commit 887e47a8446f1a7de0c24d20ac0c77ea840533de
Author: NunoSempere <nuno.sempere@protonmail.com>
Date:   Thu Apr 14 21:48:30 2022 -0400

    feat: Proof of concept of simple squiggle

diff --git a/index.js b/index.js
new file mode 100644
index 0000000..cb050bf
--- /dev/null
+++ b/index.js
@@ -0,0 +1,157 @@
+import { create, all } from "mathjs";
+const math = create(all);
+
+// Helper functions
+let printNode = (x) => console.log(JSON.stringify(x, null, 4));
+
+let isNumber = (x) => typeof x === "number" && isFinite(x);
+
+let isConstantNode = (arg) => {
+  return !!arg.value && isNumber(arg.value);
+};
+let isArgLognormal = (arg) => {
+  let isFn = typeof arg.fn != "undefined";
+  let andNameIsLognormal = isFn && arg.fn.name == "lognormal";
+  let andHasArgs = andNameIsLognormal && !!arg.args;
+  let andHasTwoArgs = andHasArgs && arg.args.length == 2;
+  let andTwoArgsAreConstant = arg.args
+    .map(
+      (innerArg) => isConstantNode(innerArg)
+      // innerArg
+    )
+    .reduce((a, b) => a && b, true);
+  return andTwoArgsAreConstant;
+};
+
+let getFactors = (node) => {
+  return node.args.map((arg) => arg.value);
+};
+
+let createLogarithmNode = (mu, sigma) => {
+  let node1 = new math.ConstantNode(mu);
+  let node2 = new math.ConstantNode(sigma);
+  let node3 = new math.FunctionNode("lognormal", [node1, node2]);
+  return node3;
+};
+
+// Main function
+let transformerInner = (string) => {
+  let nodes = math.parse(string);
+  let transformed = nodes.transform(function (node, path, parent) {
+    if (node.type == "OperatorNode" && node.op == "*") {
+      let hasArgs = node.args && node.args.length == 2;
+      if (hasArgs) {
+        let areArgsLognormal = node.args
+          .map((arg) => isArgLognormal(arg))
+          .reduce((a, b) => a && b, true);
+        if (areArgsLognormal) {
+          let factors = node.args.map((arg) => getFactors(arg));
+          let mean1 = factors[0][0];
+          let std1 = factors[0][1];
+          let mean2 = factors[1][0];
+          let std2 = factors[1][1];
+
+          let newMean = mean1 + mean2;
+          let newStd = Math.sqrt(std1 ** 2 + std2 ** 2);
+          return createLogarithmNode(newMean, newStd);
+          return new math.SymbolNode("xx");
+        } else {
+          return node;
+        }
+      } else {
+        return node;
+      }
+    } else if (node.type == "OperatorNode" && node.op == "/") {
+      let hasArgs = node.args && node.args.length == 2;
+      if (hasArgs) {
+        let areArgsLognormal = node.args
+          .map((arg) => isArgLognormal(arg))
+          .reduce((a, b) => a && b, true);
+        if (areArgsLognormal) {
+          let factors = node.args.map((arg) => getFactors(arg));
+          let mean1 = factors[0][0];
+          let std1 = factors[0][1];
+          let mean2 = factors[1][0];
+          let std2 = factors[1][1];
+
+          let newMean = mean1 + mean2;
+          let newStd = Math.sqrt(std1 ** 2 + std2 ** 2);
+          return createLogarithmNode(newMean, newStd);
+          return new math.SymbolNode("xx");
+        }
+      }
+    }
+    return node;
+  });
+
+  return transformed.toString();
+};
+
+let from90PercentCI = (low, high) => {
+  let normal95confidencePoint = 1.6448536269514722;
+  let logLow = Math.log(low);
+  let logHigh = Math.log(high);
+  let mu = (logLow + logHigh) / 2;
+  let sigma = (logHigh - logLow) / (2.0 * normal95confidencePoint);
+  return [mu, sigma];
+};
+
+let simplePreprocessor = (string) => {
+  // left for documentation purposes only
+  function replacer(match, p1, p2) {
+    console.log(match);
+    // p1 is nondigits, p2 digits, and p3 non-alphanumericsa
+    console.log([p1, p2]);
+    let result = from90PercentCI(p1, p2);
+    return `lognormal(${result[0]}, ${result[1]})`;
+  }
+  let newString = string.replace(/(\d+) to (\d+)/g, replacer);
+  console.log(newString);
+  return newString; // abc - 12345 - #$*%
+};
+
+// simplePreprocessor("1 to 10 + 1 to 20");
+
+let preprocessor = (string) => {
+  // work in progress, currently not working
+  let regex = /([\d]+\.?[\d]*|\.[\d]+) to ([\d]+\.?[\d]*|\.[\d]+)/g;
+  function replacer(match, p1, p2) {
+    let result = from90PercentCI(p1, p2);
+    return `lognormal(${result[0]}, ${result[1]})`;
+  }
+  let newString = string.replace(regex, replacer);
+  if (newString != string) console.log(`\tPreprocessing: ${newString}`);
+  return newString; // abc - 12345 - #$*%
+};
+// preprocessor("1.2 to 10.5 * 1.1 to 20 * 1 to 2.5 * 1 to 5");
+
+let transformer = (string) => {
+  string = preprocessor(string);
+  let stringNew = transformerInner(string);
+  while (stringNew != string) {
+    console.log(`\tNew transformation: ${stringNew}`);
+    string = stringNew;
+    stringNew = transformerInner(string);
+  }
+  return stringNew;
+};
+
+let testTransformer = (string) => {
+  console.log(`New test: ${string}`);
+  console.group();
+  let result = transformer(string);
+  console.groupEnd();
+  console.log(`Result: ${result}`);
+  console.log("");
+};
+
+// Defs
+let tests = [
+  `lognormal(1,10) * lognormal(1,10) + lognormal(1,10)`,
+  `lognormal(1,10) * lognormal(1,10) * lognormal(1,10)`,
+  `1 to 10 * lognormal(1, 10)`,
+  `lognormal(1, 10) * 1 to 20`,
+  `1 to 20 * 100 to 1000`,
+];
+console.clear();
+tests.forEach((test) => testTransformer(test));
diff --git a/node_modules/.bin/mathjs b/node_modules/.bin/mathjs
new file mode 120000
index 0000000..d147838
--- /dev/null
+++ b/node_modules/.bin/mathjs
@@ -0,0 +1 @@
+../mathjs/bin/cli.js
\ No newline at end of file
diff --git a/node_modules/.package-lock.json b/node_modules/.package-lock.json
new file mode 100644
index 0000000..df30ce1
--- /dev/null
+++ b/node_modules/.package-lock.json
@@ -0,0 +1,103 @@
+{
+  "name": "squiggle-simplex",
+  "version": "1.0.0",
+  "lockfileVersion": 2,
+  "requires": true,
+  "packages": {
+    "node_modules/@babel/runtime": {
+      "version": "7.17.9",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.17.9.tgz",
+      "integrity": "sha512-lSiBBvodq29uShpWGNbgFdKYNiFDo5/HIYsaCEY9ff4sb10x9jizo2+pRrSyF4jKZCXqgzuqBOQKbUm90gQwJg==",
+      "dependencies": {
+        "regenerator-runtime": "^0.13.4"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/complex.js": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.1.1.tgz",
+      "integrity": "sha512-8njCHOTtFFLtegk6zQo0kkVX1rngygb/KQI6z1qZxlFI3scluC+LVTCFbrkWjBv4vvLlbQ9t88IPMC6k95VTTg==",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "patreon",
+        "url": "https://www.patreon.com/infusion"
+      }
+    },
+    "node_modules/decimal.js": {
+      "version": "10.3.1",
+      "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.3.1.tgz",
+      "integrity": "sha512-V0pfhfr8suzyPGOx3nmq4aHqabehUZn6Ch9kyFpV79TGDTWFmHqUqXdabR7QHqxzrYolF4+tVmJhUG4OURg5dQ=="
+    },
+    "node_modules/escape-latex": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/escape-latex/-/escape-latex-1.2.0.tgz",
+      "integrity": "sha512-nV5aVWW1K0wEiUIEdZ4erkGGH8mDxGyxSeqPzRNtWP7ataw+/olFObw7hujFWlVjNsaDFw5VZ5NzVSIqRgfTiw=="
+    },
+    "node_modules/fraction.js": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-4.2.0.tgz",
+      "integrity": "sha512-MhLuK+2gUcnZe8ZHlaaINnQLl0xRIGRfcGk2yl8xoQAfHrSsL3rYu6FCmBdkdbhc9EPlwyGHewaRsvwRMJtAlA==",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "patreon",
+        "url": "https://www.patreon.com/infusion"
+      }
+    },
+    "node_modules/javascript-natural-sort": {
+      "version": "0.7.1",
+      "resolved": "https://registry.npmjs.org/javascript-natural-sort/-/javascript-natural-sort-0.7.1.tgz",
+      "integrity": "sha1-+eIwPUUH9tdDVac2ZNFED7Wg71k="
+    },
+    "node_modules/mathjs": {
+      "version": "10.4.3",
+      "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-10.4.3.tgz",
+      "integrity": "sha512-C50lWorCOplBec9Ik5fzhHuOx4G4+mtdz3r1G2I1/r8yj+CpYFXLXNqTdg59oKmIF1tKcIzpxlC4s2dGL7f3pg==",
+      "dependencies": {
+        "@babel/runtime": "^7.17.8",
+        "complex.js": "^2.1.0",
+        "decimal.js": "^10.3.1",
+        "escape-latex": "^1.2.0",
+        "fraction.js": "^4.2.0",
+        "javascript-natural-sort": "^0.7.1",
+        "seedrandom": "^3.0.5",
+        "tiny-emitter": "^2.1.0",
+        "typed-function": "^2.1.0"
+      },
+      "bin": {
+        "mathjs": "bin/cli.js"
+      },
+      "engines": {
+        "node": ">= 12"
+      }
+    },
+    "node_modules/regenerator-runtime": {
+      "version": "0.13.9",
+      "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.13.9.tgz",
+      "integrity": "sha512-p3VT+cOEgxFsRRA9X4lkI1E+k2/CtnKtU4gcxyaCUreilL/vqI6CdZ3wxVUx3UOUg+gnUOQQcRI7BmSI656MYA=="
+    },
+    "node_modules/seedrandom": {
+      "version": "3.0.5",
+      "resolved": "https://registry.npmjs.org/seedrandom/-/seedrandom-3.0.5.tgz",
+      "integrity": "sha512-8OwmbklUNzwezjGInmZ+2clQmExQPvomqjL7LFqOYqtmuxRgQYqOD3mHaU+MvZn5FLUeVxVfQjwLZW/n/JFuqg=="
+    },
+    "node_modules/tiny-emitter": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/tiny-emitter/-/tiny-emitter-2.1.0.tgz",
+      "integrity": "sha512-NB6Dk1A9xgQPMoGqC5CVXn123gWyte215ONT5Pp5a0yt4nlEoO1ZWeCwpncaekPHXO60i47ihFnZPiRPjRMq4Q=="
+    },
+    "node_modules/typed-function": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-2.1.0.tgz",
+      "integrity": "sha512-bctQIOqx2iVbWGDGPWwIm18QScpu2XRmkC19D8rQGFsjKSgteq/o1hTZvIG/wuDq8fanpBDrLkLq+aEN/6y5XQ==",
+      "engines": {
+        "node": ">= 10"
+      }
+    }
+  }
+}
diff --git a/node_modules/@babel/runtime/LICENSE b/node_modules/@babel/runtime/LICENSE
new file mode 100644
index 0000000..f31575e
--- /dev/null
+++ b/node_modules/@babel/runtime/LICENSE
@@ -0,0 +1,22 @@
+MIT License
+
+Copyright (c) 2014-present Sebastian McKenzie and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/@babel/runtime/README.md b/node_modules/@babel/runtime/README.md
new file mode 100644
index 0000000..be27e83
--- /dev/null
+++ b/node_modules/@babel/runtime/README.md
@@ -0,0 +1,19 @@
+# @babel/runtime
+
+> babel's modular runtime helpers
+
+See our website [@babel/runtime](https://babeljs.io/docs/en/babel-runtime) for more information.
+
+## Install
+
+Using npm:
+
+```sh
+npm install --save @babel/runtime
+```
+
+or using yarn:
+
+```sh
+yarn add @babel/runtime
+```
diff --git a/node_modules/@babel/runtime/helpers/AsyncGenerator.js b/node_modules/@babel/runtime/helpers/AsyncGenerator.js
new file mode 100644
index 0000000..e6a15a7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/AsyncGenerator.js
@@ -0,0 +1,98 @@
+var AwaitValue = require("./AwaitValue.js");
+
+function AsyncGenerator(gen) {
+  var front, back;
+
+  function send(key, arg) {
+    return new Promise(function (resolve, reject) {
+      var request = {
+        key: key,
+        arg: arg,
+        resolve: resolve,
+        reject: reject,
+        next: null
+      };
+
+      if (back) {
+        back = back.next = request;
+      } else {
+        front = back = request;
+        resume(key, arg);
+      }
+    });
+  }
+
+  function resume(key, arg) {
+    try {
+      var result = gen[key](arg);
+      var value = result.value;
+      var wrappedAwait = value instanceof AwaitValue;
+      Promise.resolve(wrappedAwait ? value.wrapped : value).then(function (arg) {
+        if (wrappedAwait) {
+          resume(key === "return" ? "return" : "next", arg);
+          return;
+        }
+
+        settle(result.done ? "return" : "normal", arg);
+      }, function (err) {
+        resume("throw", err);
+      });
+    } catch (err) {
+      settle("throw", err);
+    }
+  }
+
+  function settle(type, value) {
+    switch (type) {
+      case "return":
+        front.resolve({
+          value: value,
+          done: true
+        });
+        break;
+
+      case "throw":
+        front.reject(value);
+        break;
+
+      default:
+        front.resolve({
+          value: value,
+          done: false
+        });
+        break;
+    }
+
+    front = front.next;
+
+    if (front) {
+      resume(front.key, front.arg);
+    } else {
+      back = null;
+    }
+  }
+
+  this._invoke = send;
+
+  if (typeof gen["return"] !== "function") {
+    this["return"] = undefined;
+  }
+}
+
+AsyncGenerator.prototype[typeof Symbol === "function" && Symbol.asyncIterator || "@@asyncIterator"] = function () {
+  return this;
+};
+
+AsyncGenerator.prototype.next = function (arg) {
+  return this._invoke("next", arg);
+};
+
+AsyncGenerator.prototype["throw"] = function (arg) {
+  return this._invoke("throw", arg);
+};
+
+AsyncGenerator.prototype["return"] = function (arg) {
+  return this._invoke("return", arg);
+};
+
+module.exports = AsyncGenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/AwaitValue.js b/node_modules/@babel/runtime/helpers/AwaitValue.js
new file mode 100644
index 0000000..5ddee2e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/AwaitValue.js
@@ -0,0 +1,5 @@
+function _AwaitValue(value) {
+  this.wrapped = value;
+}
+
+module.exports = _AwaitValue, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js b/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js
new file mode 100644
index 0000000..9080fd6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js
@@ -0,0 +1,30 @@
+function _applyDecoratedDescriptor(target, property, decorators, descriptor, context) {
+  var desc = {};
+  Object.keys(descriptor).forEach(function (key) {
+    desc[key] = descriptor[key];
+  });
+  desc.enumerable = !!desc.enumerable;
+  desc.configurable = !!desc.configurable;
+
+  if ('value' in desc || desc.initializer) {
+    desc.writable = true;
+  }
+
+  desc = decorators.slice().reverse().reduce(function (desc, decorator) {
+    return decorator(target, property, desc) || desc;
+  }, desc);
+
+  if (context && desc.initializer !== void 0) {
+    desc.value = desc.initializer ? desc.initializer.call(context) : void 0;
+    desc.initializer = undefined;
+  }
+
+  if (desc.initializer === void 0) {
+    Object.defineProperty(target, property, desc);
+    desc = null;
+  }
+
+  return desc;
+}
+
+module.exports = _applyDecoratedDescriptor, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecs.js b/node_modules/@babel/runtime/helpers/applyDecs.js
new file mode 100644
index 0000000..b27baad
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecs.js
@@ -0,0 +1,284 @@
+var _typeof = require("./typeof.js")["default"];
+
+function createMetadataMethodsForProperty(metadataMap, kind, property, decoratorFinishedRef) {
+  return {
+    getMetadata: function getMetadata(key) {
+      assertNotFinished(decoratorFinishedRef, "getMetadata"), assertMetadataKey(key);
+      var metadataForKey = metadataMap[key];
+      if (void 0 !== metadataForKey) if (1 === kind) {
+        var pub = metadataForKey["public"];
+        if (void 0 !== pub) return pub[property];
+      } else if (2 === kind) {
+        var priv = metadataForKey["private"];
+        if (void 0 !== priv) return priv.get(property);
+      } else if (Object.hasOwnProperty.call(metadataForKey, "constructor")) return metadataForKey.constructor;
+    },
+    setMetadata: function setMetadata(key, value) {
+      assertNotFinished(decoratorFinishedRef, "setMetadata"), assertMetadataKey(key);
+      var metadataForKey = metadataMap[key];
+
+      if (void 0 === metadataForKey && (metadataForKey = metadataMap[key] = {}), 1 === kind) {
+        var pub = metadataForKey["public"];
+        void 0 === pub && (pub = metadataForKey["public"] = {}), pub[property] = value;
+      } else if (2 === kind) {
+        var priv = metadataForKey.priv;
+        void 0 === priv && (priv = metadataForKey["private"] = new Map()), priv.set(property, value);
+      } else metadataForKey.constructor = value;
+    }
+  };
+}
+
+function convertMetadataMapToFinal(obj, metadataMap) {
+  var parentMetadataMap = obj[Symbol.metadata || Symbol["for"]("Symbol.metadata")],
+      metadataKeys = Object.getOwnPropertySymbols(metadataMap);
+
+  if (0 !== metadataKeys.length) {
+    for (var i = 0; i < metadataKeys.length; i++) {
+      var key = metadataKeys[i],
+          metaForKey = metadataMap[key],
+          parentMetaForKey = parentMetadataMap ? parentMetadataMap[key] : null,
+          pub = metaForKey["public"],
+          parentPub = parentMetaForKey ? parentMetaForKey["public"] : null;
+      pub && parentPub && Object.setPrototypeOf(pub, parentPub);
+      var priv = metaForKey["private"];
+
+      if (priv) {
+        var privArr = Array.from(priv.values()),
+            parentPriv = parentMetaForKey ? parentMetaForKey["private"] : null;
+        parentPriv && (privArr = privArr.concat(parentPriv)), metaForKey["private"] = privArr;
+      }
+
+      parentMetaForKey && Object.setPrototypeOf(metaForKey, parentMetaForKey);
+    }
+
+    parentMetadataMap && Object.setPrototypeOf(metadataMap, parentMetadataMap), obj[Symbol.metadata || Symbol["for"]("Symbol.metadata")] = metadataMap;
+  }
+}
+
+function createAddInitializerMethod(initializers, decoratorFinishedRef) {
+  return function (initializer) {
+    assertNotFinished(decoratorFinishedRef, "addInitializer"), assertCallable(initializer, "An initializer"), initializers.push(initializer);
+  };
+}
+
+function memberDec(dec, name, desc, metadataMap, initializers, kind, isStatic, isPrivate, value) {
+  var kindStr;
+
+  switch (kind) {
+    case 1:
+      kindStr = "accessor";
+      break;
+
+    case 2:
+      kindStr = "method";
+      break;
+
+    case 3:
+      kindStr = "getter";
+      break;
+
+    case 4:
+      kindStr = "setter";
+      break;
+
+    default:
+      kindStr = "field";
+  }
+
+  var metadataKind,
+      metadataName,
+      ctx = {
+    kind: kindStr,
+    name: isPrivate ? "#" + name : name,
+    isStatic: isStatic,
+    isPrivate: isPrivate
+  },
+      decoratorFinishedRef = {
+    v: !1
+  };
+
+  if (0 !== kind && (ctx.addInitializer = createAddInitializerMethod(initializers, decoratorFinishedRef)), isPrivate) {
+    metadataKind = 2, metadataName = Symbol(name);
+    var access = {};
+    0 === kind ? (access.get = desc.get, access.set = desc.set) : 2 === kind ? access.get = function () {
+      return desc.value;
+    } : (1 !== kind && 3 !== kind || (access.get = function () {
+      return desc.get.call(this);
+    }), 1 !== kind && 4 !== kind || (access.set = function (v) {
+      desc.set.call(this, v);
+    })), ctx.access = access;
+  } else metadataKind = 1, metadataName = name;
+
+  try {
+    return dec(value, Object.assign(ctx, createMetadataMethodsForProperty(metadataMap, metadataKind, metadataName, decoratorFinishedRef)));
+  } finally {
+    decoratorFinishedRef.v = !0;
+  }
+}
+
+function assertNotFinished(decoratorFinishedRef, fnName) {
+  if (decoratorFinishedRef.v) throw new Error("attempted to call " + fnName + " after decoration was finished");
+}
+
+function assertMetadataKey(key) {
+  if ("symbol" != _typeof(key)) throw new TypeError("Metadata keys must be symbols, received: " + key);
+}
+
+function assertCallable(fn, hint) {
+  if ("function" != typeof fn) throw new TypeError(hint + " must be a function");
+}
+
+function assertValidReturnValue(kind, value) {
+  var type = _typeof(value);
+
+  if (1 === kind) {
+    if ("object" !== type || null === value) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+    void 0 !== value.get && assertCallable(value.get, "accessor.get"), void 0 !== value.set && assertCallable(value.set, "accessor.set"), void 0 !== value.init && assertCallable(value.init, "accessor.init"), void 0 !== value.initializer && assertCallable(value.initializer, "accessor.initializer");
+  } else if ("function" !== type) {
+    var hint;
+    throw hint = 0 === kind ? "field" : 10 === kind ? "class" : "method", new TypeError(hint + " decorators must return a function or void 0");
+  }
+}
+
+function getInit(desc) {
+  var initializer;
+  return null == (initializer = desc.init) && (initializer = desc.initializer) && "undefined" != typeof console && console.warn(".initializer has been renamed to .init as of March 2022"), initializer;
+}
+
+function applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, metadataMap, initializers) {
+  var desc,
+      initializer,
+      value,
+      newValue,
+      get,
+      set,
+      decs = decInfo[0];
+  if (isPrivate ? desc = 0 === kind || 1 === kind ? {
+    get: decInfo[3],
+    set: decInfo[4]
+  } : 3 === kind ? {
+    get: decInfo[3]
+  } : 4 === kind ? {
+    set: decInfo[3]
+  } : {
+    value: decInfo[3]
+  } : 0 !== kind && (desc = Object.getOwnPropertyDescriptor(base, name)), 1 === kind ? value = {
+    get: desc.get,
+    set: desc.set
+  } : 2 === kind ? value = desc.value : 3 === kind ? value = desc.get : 4 === kind && (value = desc.set), "function" == typeof decs) void 0 !== (newValue = memberDec(decs, name, desc, metadataMap, initializers, kind, isStatic, isPrivate, value)) && (assertValidReturnValue(kind, newValue), 0 === kind ? initializer = newValue : 1 === kind ? (initializer = getInit(newValue), get = newValue.get || value.get, set = newValue.set || value.set, value = {
+    get: get,
+    set: set
+  }) : value = newValue);else for (var i = decs.length - 1; i >= 0; i--) {
+    var newInit;
+    if (void 0 !== (newValue = memberDec(decs[i], name, desc, metadataMap, initializers, kind, isStatic, isPrivate, value))) assertValidReturnValue(kind, newValue), 0 === kind ? newInit = newValue : 1 === kind ? (newInit = getInit(newValue), get = newValue.get || value.get, set = newValue.set || value.set, value = {
+      get: get,
+      set: set
+    }) : value = newValue, void 0 !== newInit && (void 0 === initializer ? initializer = newInit : "function" == typeof initializer ? initializer = [initializer, newInit] : initializer.push(newInit));
+  }
+
+  if (0 === kind || 1 === kind) {
+    if (void 0 === initializer) initializer = function initializer(instance, init) {
+      return init;
+    };else if ("function" != typeof initializer) {
+      var ownInitializers = initializer;
+
+      initializer = function initializer(instance, init) {
+        for (var value = init, i = 0; i < ownInitializers.length; i++) {
+          value = ownInitializers[i].call(instance, value);
+        }
+
+        return value;
+      };
+    } else {
+      var originalInitializer = initializer;
+
+      initializer = function initializer(instance, init) {
+        return originalInitializer.call(instance, init);
+      };
+    }
+    ret.push(initializer);
+  }
+
+  0 !== kind && (1 === kind ? (desc.get = value.get, desc.set = value.set) : 2 === kind ? desc.value = value : 3 === kind ? desc.get = value : 4 === kind && (desc.set = value), isPrivate ? 1 === kind ? (ret.push(function (instance, args) {
+    return value.get.call(instance, args);
+  }), ret.push(function (instance, args) {
+    return value.set.call(instance, args);
+  })) : 2 === kind ? ret.push(value) : ret.push(function (instance, args) {
+    return value.call(instance, args);
+  }) : Object.defineProperty(base, name, desc));
+}
+
+function applyMemberDecs(ret, Class, protoMetadataMap, staticMetadataMap, decInfos) {
+  for (var protoInitializers, staticInitializers, existingProtoNonFields = new Map(), existingStaticNonFields = new Map(), i = 0; i < decInfos.length; i++) {
+    var decInfo = decInfos[i];
+
+    if (Array.isArray(decInfo)) {
+      var base,
+          metadataMap,
+          initializers,
+          kind = decInfo[1],
+          name = decInfo[2],
+          isPrivate = decInfo.length > 3,
+          isStatic = kind >= 5;
+
+      if (isStatic ? (base = Class, metadataMap = staticMetadataMap, 0 !== (kind -= 5) && (initializers = staticInitializers = staticInitializers || [])) : (base = Class.prototype, metadataMap = protoMetadataMap, 0 !== kind && (initializers = protoInitializers = protoInitializers || [])), 0 !== kind && !isPrivate) {
+        var existingNonFields = isStatic ? existingStaticNonFields : existingProtoNonFields,
+            existingKind = existingNonFields.get(name) || 0;
+        if (!0 === existingKind || 3 === existingKind && 4 !== kind || 4 === existingKind && 3 !== kind) throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + name);
+        !existingKind && kind > 2 ? existingNonFields.set(name, kind) : existingNonFields.set(name, !0);
+      }
+
+      applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, metadataMap, initializers);
+    }
+  }
+
+  pushInitializers(ret, protoInitializers), pushInitializers(ret, staticInitializers);
+}
+
+function pushInitializers(ret, initializers) {
+  initializers && ret.push(function (instance) {
+    for (var i = 0; i < initializers.length; i++) {
+      initializers[i].call(instance);
+    }
+
+    return instance;
+  });
+}
+
+function applyClassDecs(ret, targetClass, metadataMap, classDecs) {
+  if (classDecs.length > 0) {
+    for (var initializers = [], newClass = targetClass, name = targetClass.name, i = classDecs.length - 1; i >= 0; i--) {
+      var decoratorFinishedRef = {
+        v: !1
+      };
+
+      try {
+        var ctx = Object.assign({
+          kind: "class",
+          name: name,
+          addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef)
+        }, createMetadataMethodsForProperty(metadataMap, 0, name, decoratorFinishedRef)),
+            nextNewClass = classDecs[i](newClass, ctx);
+      } finally {
+        decoratorFinishedRef.v = !0;
+      }
+
+      void 0 !== nextNewClass && (assertValidReturnValue(10, nextNewClass), newClass = nextNewClass);
+    }
+
+    ret.push(newClass, function () {
+      for (var i = 0; i < initializers.length; i++) {
+        initializers[i].call(newClass);
+      }
+    });
+  }
+}
+
+function applyDecs(targetClass, memberDecs, classDecs) {
+  var ret = [],
+      staticMetadataMap = {},
+      protoMetadataMap = {};
+  return applyMemberDecs(ret, targetClass, protoMetadataMap, staticMetadataMap, memberDecs), convertMetadataMapToFinal(targetClass.prototype, protoMetadataMap), applyClassDecs(ret, targetClass, staticMetadataMap, classDecs), convertMetadataMapToFinal(targetClass, staticMetadataMap), ret;
+}
+
+module.exports = applyDecs, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/arrayLikeToArray.js b/node_modules/@babel/runtime/helpers/arrayLikeToArray.js
new file mode 100644
index 0000000..465974f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/arrayLikeToArray.js
@@ -0,0 +1,11 @@
+function _arrayLikeToArray(arr, len) {
+  if (len == null || len > arr.length) len = arr.length;
+
+  for (var i = 0, arr2 = new Array(len); i < len; i++) {
+    arr2[i] = arr[i];
+  }
+
+  return arr2;
+}
+
+module.exports = _arrayLikeToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/arrayWithHoles.js b/node_modules/@babel/runtime/helpers/arrayWithHoles.js
new file mode 100644
index 0000000..b5680a0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/arrayWithHoles.js
@@ -0,0 +1,5 @@
+function _arrayWithHoles(arr) {
+  if (Array.isArray(arr)) return arr;
+}
+
+module.exports = _arrayWithHoles, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js b/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js
new file mode 100644
index 0000000..30bf377
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js
@@ -0,0 +1,7 @@
+var arrayLikeToArray = require("./arrayLikeToArray.js");
+
+function _arrayWithoutHoles(arr) {
+  if (Array.isArray(arr)) return arrayLikeToArray(arr);
+}
+
+module.exports = _arrayWithoutHoles, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/assertThisInitialized.js b/node_modules/@babel/runtime/helpers/assertThisInitialized.js
new file mode 100644
index 0000000..70ea855
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/assertThisInitialized.js
@@ -0,0 +1,9 @@
+function _assertThisInitialized(self) {
+  if (self === void 0) {
+    throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+  }
+
+  return self;
+}
+
+module.exports = _assertThisInitialized, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/asyncGeneratorDelegate.js b/node_modules/@babel/runtime/helpers/asyncGeneratorDelegate.js
new file mode 100644
index 0000000..cf7d480
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/asyncGeneratorDelegate.js
@@ -0,0 +1,56 @@
+function _asyncGeneratorDelegate(inner, awaitWrap) {
+  var iter = {},
+      waiting = false;
+
+  function pump(key, value) {
+    waiting = true;
+    value = new Promise(function (resolve) {
+      resolve(inner[key](value));
+    });
+    return {
+      done: false,
+      value: awaitWrap(value)
+    };
+  }
+
+  ;
+
+  iter[typeof Symbol !== "undefined" && Symbol.iterator || "@@iterator"] = function () {
+    return this;
+  };
+
+  iter.next = function (value) {
+    if (waiting) {
+      waiting = false;
+      return value;
+    }
+
+    return pump("next", value);
+  };
+
+  if (typeof inner["throw"] === "function") {
+    iter["throw"] = function (value) {
+      if (waiting) {
+        waiting = false;
+        throw value;
+      }
+
+      return pump("throw", value);
+    };
+  }
+
+  if (typeof inner["return"] === "function") {
+    iter["return"] = function (value) {
+      if (waiting) {
+        waiting = false;
+        return value;
+      }
+
+      return pump("return", value);
+    };
+  }
+
+  return iter;
+}
+
+module.exports = _asyncGeneratorDelegate, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/asyncIterator.js b/node_modules/@babel/runtime/helpers/asyncIterator.js
new file mode 100644
index 0000000..d8e11f0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/asyncIterator.js
@@ -0,0 +1,50 @@
+function _asyncIterator(iterable) {
+  var method,
+      async,
+      sync,
+      retry = 2;
+
+  for ("undefined" != typeof Symbol && (async = Symbol.asyncIterator, sync = Symbol.iterator); retry--;) {
+    if (async && null != (method = iterable[async])) return method.call(iterable);
+    if (sync && null != (method = iterable[sync])) return new AsyncFromSyncIterator(method.call(iterable));
+    async = "@@asyncIterator", sync = "@@iterator";
+  }
+
+  throw new TypeError("Object is not async iterable");
+}
+
+function AsyncFromSyncIterator(s) {
+  function AsyncFromSyncIteratorContinuation(r) {
+    if (Object(r) !== r) return Promise.reject(new TypeError(r + " is not an object."));
+    var done = r.done;
+    return Promise.resolve(r.value).then(function (value) {
+      return {
+        value: value,
+        done: done
+      };
+    });
+  }
+
+  return AsyncFromSyncIterator = function AsyncFromSyncIterator(s) {
+    this.s = s, this.n = s.next;
+  }, AsyncFromSyncIterator.prototype = {
+    s: null,
+    n: null,
+    next: function next() {
+      return AsyncFromSyncIteratorContinuation(this.n.apply(this.s, arguments));
+    },
+    "return": function _return(value) {
+      var ret = this.s["return"];
+      return void 0 === ret ? Promise.resolve({
+        value: value,
+        done: !0
+      }) : AsyncFromSyncIteratorContinuation(ret.apply(this.s, arguments));
+    },
+    "throw": function _throw(value) {
+      var thr = this.s["return"];
+      return void 0 === thr ? Promise.reject(value) : AsyncFromSyncIteratorContinuation(thr.apply(this.s, arguments));
+    }
+  }, new AsyncFromSyncIterator(s);
+}
+
+module.exports = _asyncIterator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/asyncToGenerator.js b/node_modules/@babel/runtime/helpers/asyncToGenerator.js
new file mode 100644
index 0000000..becd163
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/asyncToGenerator.js
@@ -0,0 +1,37 @@
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
+  try {
+    var info = gen[key](arg);
+    var value = info.value;
+  } catch (error) {
+    reject(error);
+    return;
+  }
+
+  if (info.done) {
+    resolve(value);
+  } else {
+    Promise.resolve(value).then(_next, _throw);
+  }
+}
+
+function _asyncToGenerator(fn) {
+  return function () {
+    var self = this,
+        args = arguments;
+    return new Promise(function (resolve, reject) {
+      var gen = fn.apply(self, args);
+
+      function _next(value) {
+        asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
+      }
+
+      function _throw(err) {
+        asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
+      }
+
+      _next(undefined);
+    });
+  };
+}
+
+module.exports = _asyncToGenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/awaitAsyncGenerator.js b/node_modules/@babel/runtime/helpers/awaitAsyncGenerator.js
new file mode 100644
index 0000000..f0f30ed
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/awaitAsyncGenerator.js
@@ -0,0 +1,7 @@
+var AwaitValue = require("./AwaitValue.js");
+
+function _awaitAsyncGenerator(value) {
+  return new AwaitValue(value);
+}
+
+module.exports = _awaitAsyncGenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/checkPrivateRedeclaration.js b/node_modules/@babel/runtime/helpers/checkPrivateRedeclaration.js
new file mode 100644
index 0000000..6cd0fcb
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/checkPrivateRedeclaration.js
@@ -0,0 +1,7 @@
+function _checkPrivateRedeclaration(obj, privateCollection) {
+  if (privateCollection.has(obj)) {
+    throw new TypeError("Cannot initialize the same private elements twice on an object");
+  }
+}
+
+module.exports = _checkPrivateRedeclaration, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classApplyDescriptorDestructureSet.js b/node_modules/@babel/runtime/helpers/classApplyDescriptorDestructureSet.js
new file mode 100644
index 0000000..ea1c860
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classApplyDescriptorDestructureSet.js
@@ -0,0 +1,22 @@
+function _classApplyDescriptorDestructureSet(receiver, descriptor) {
+  if (descriptor.set) {
+    if (!("__destrObj" in descriptor)) {
+      descriptor.__destrObj = {
+        set value(v) {
+          descriptor.set.call(receiver, v);
+        }
+
+      };
+    }
+
+    return descriptor.__destrObj;
+  } else {
+    if (!descriptor.writable) {
+      throw new TypeError("attempted to set read only private field");
+    }
+
+    return descriptor;
+  }
+}
+
+module.exports = _classApplyDescriptorDestructureSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classApplyDescriptorGet.js b/node_modules/@babel/runtime/helpers/classApplyDescriptorGet.js
new file mode 100644
index 0000000..b9d0e94
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classApplyDescriptorGet.js
@@ -0,0 +1,9 @@
+function _classApplyDescriptorGet(receiver, descriptor) {
+  if (descriptor.get) {
+    return descriptor.get.call(receiver);
+  }
+
+  return descriptor.value;
+}
+
+module.exports = _classApplyDescriptorGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classApplyDescriptorSet.js b/node_modules/@babel/runtime/helpers/classApplyDescriptorSet.js
new file mode 100644
index 0000000..9824b5c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classApplyDescriptorSet.js
@@ -0,0 +1,13 @@
+function _classApplyDescriptorSet(receiver, descriptor, value) {
+  if (descriptor.set) {
+    descriptor.set.call(receiver, value);
+  } else {
+    if (!descriptor.writable) {
+      throw new TypeError("attempted to set read only private field");
+    }
+
+    descriptor.value = value;
+  }
+}
+
+module.exports = _classApplyDescriptorSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classCallCheck.js b/node_modules/@babel/runtime/helpers/classCallCheck.js
new file mode 100644
index 0000000..1418845
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classCallCheck.js
@@ -0,0 +1,7 @@
+function _classCallCheck(instance, Constructor) {
+  if (!(instance instanceof Constructor)) {
+    throw new TypeError("Cannot call a class as a function");
+  }
+}
+
+module.exports = _classCallCheck, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classCheckPrivateStaticAccess.js b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticAccess.js
new file mode 100644
index 0000000..7f5213b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticAccess.js
@@ -0,0 +1,7 @@
+function _classCheckPrivateStaticAccess(receiver, classConstructor) {
+  if (receiver !== classConstructor) {
+    throw new TypeError("Private static access of wrong provenance");
+  }
+}
+
+module.exports = _classCheckPrivateStaticAccess, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classCheckPrivateStaticFieldDescriptor.js b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticFieldDescriptor.js
new file mode 100644
index 0000000..87ec4ea
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticFieldDescriptor.js
@@ -0,0 +1,7 @@
+function _classCheckPrivateStaticFieldDescriptor(descriptor, action) {
+  if (descriptor === undefined) {
+    throw new TypeError("attempted to " + action + " private static field before its declaration");
+  }
+}
+
+module.exports = _classCheckPrivateStaticFieldDescriptor, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classExtractFieldDescriptor.js b/node_modules/@babel/runtime/helpers/classExtractFieldDescriptor.js
new file mode 100644
index 0000000..5c422bf
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classExtractFieldDescriptor.js
@@ -0,0 +1,9 @@
+function _classExtractFieldDescriptor(receiver, privateMap, action) {
+  if (!privateMap.has(receiver)) {
+    throw new TypeError("attempted to " + action + " private field on non-instance");
+  }
+
+  return privateMap.get(receiver);
+}
+
+module.exports = _classExtractFieldDescriptor, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classNameTDZError.js b/node_modules/@babel/runtime/helpers/classNameTDZError.js
new file mode 100644
index 0000000..9a48c70
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classNameTDZError.js
@@ -0,0 +1,5 @@
+function _classNameTDZError(name) {
+  throw new Error("Class \"" + name + "\" cannot be referenced in computed property keys.");
+}
+
+module.exports = _classNameTDZError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/classPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..07abfe5
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldDestructureSet.js
@@ -0,0 +1,10 @@
+var classApplyDescriptorDestructureSet = require("./classApplyDescriptorDestructureSet.js");
+
+var classExtractFieldDescriptor = require("./classExtractFieldDescriptor.js");
+
+function _classPrivateFieldDestructureSet(receiver, privateMap) {
+  var descriptor = classExtractFieldDescriptor(receiver, privateMap, "set");
+  return classApplyDescriptorDestructureSet(receiver, descriptor);
+}
+
+module.exports = _classPrivateFieldDestructureSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldGet.js b/node_modules/@babel/runtime/helpers/classPrivateFieldGet.js
new file mode 100644
index 0000000..470ded7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldGet.js
@@ -0,0 +1,10 @@
+var classApplyDescriptorGet = require("./classApplyDescriptorGet.js");
+
+var classExtractFieldDescriptor = require("./classExtractFieldDescriptor.js");
+
+function _classPrivateFieldGet(receiver, privateMap) {
+  var descriptor = classExtractFieldDescriptor(receiver, privateMap, "get");
+  return classApplyDescriptorGet(receiver, descriptor);
+}
+
+module.exports = _classPrivateFieldGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldInitSpec.js b/node_modules/@babel/runtime/helpers/classPrivateFieldInitSpec.js
new file mode 100644
index 0000000..a6243c2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldInitSpec.js
@@ -0,0 +1,8 @@
+var checkPrivateRedeclaration = require("./checkPrivateRedeclaration.js");
+
+function _classPrivateFieldInitSpec(obj, privateMap, value) {
+  checkPrivateRedeclaration(obj, privateMap);
+  privateMap.set(obj, value);
+}
+
+module.exports = _classPrivateFieldInitSpec, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldLooseBase.js b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseBase.js
new file mode 100644
index 0000000..571109f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseBase.js
@@ -0,0 +1,9 @@
+function _classPrivateFieldBase(receiver, privateKey) {
+  if (!Object.prototype.hasOwnProperty.call(receiver, privateKey)) {
+    throw new TypeError("attempted to use private field on non-instance");
+  }
+
+  return receiver;
+}
+
+module.exports = _classPrivateFieldBase, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldLooseKey.js b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseKey.js
new file mode 100644
index 0000000..b05e194
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseKey.js
@@ -0,0 +1,7 @@
+var id = 0;
+
+function _classPrivateFieldKey(name) {
+  return "__private_" + id++ + "_" + name;
+}
+
+module.exports = _classPrivateFieldKey, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldSet.js b/node_modules/@babel/runtime/helpers/classPrivateFieldSet.js
new file mode 100644
index 0000000..f8ab842
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldSet.js
@@ -0,0 +1,11 @@
+var classApplyDescriptorSet = require("./classApplyDescriptorSet.js");
+
+var classExtractFieldDescriptor = require("./classExtractFieldDescriptor.js");
+
+function _classPrivateFieldSet(receiver, privateMap, value) {
+  var descriptor = classExtractFieldDescriptor(receiver, privateMap, "set");
+  classApplyDescriptorSet(receiver, descriptor, value);
+  return value;
+}
+
+module.exports = _classPrivateFieldSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/classPrivateMethodGet.js
new file mode 100644
index 0000000..540a1f3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateMethodGet.js
@@ -0,0 +1,9 @@
+function _classPrivateMethodGet(receiver, privateSet, fn) {
+  if (!privateSet.has(receiver)) {
+    throw new TypeError("attempted to get private field on non-instance");
+  }
+
+  return fn;
+}
+
+module.exports = _classPrivateMethodGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateMethodInitSpec.js b/node_modules/@babel/runtime/helpers/classPrivateMethodInitSpec.js
new file mode 100644
index 0000000..6c4df76
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateMethodInitSpec.js
@@ -0,0 +1,8 @@
+var checkPrivateRedeclaration = require("./checkPrivateRedeclaration.js");
+
+function _classPrivateMethodInitSpec(obj, privateSet) {
+  checkPrivateRedeclaration(obj, privateSet);
+  privateSet.add(obj);
+}
+
+module.exports = _classPrivateMethodInitSpec, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/classPrivateMethodSet.js
new file mode 100644
index 0000000..226789d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateMethodSet.js
@@ -0,0 +1,5 @@
+function _classPrivateMethodSet() {
+  throw new TypeError("attempted to reassign private method");
+}
+
+module.exports = _classPrivateMethodSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..120c74d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldDestructureSet.js
@@ -0,0 +1,13 @@
+var classApplyDescriptorDestructureSet = require("./classApplyDescriptorDestructureSet.js");
+
+var classCheckPrivateStaticAccess = require("./classCheckPrivateStaticAccess.js");
+
+var classCheckPrivateStaticFieldDescriptor = require("./classCheckPrivateStaticFieldDescriptor.js");
+
+function _classStaticPrivateFieldDestructureSet(receiver, classConstructor, descriptor) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  classCheckPrivateStaticFieldDescriptor(descriptor, "set");
+  return classApplyDescriptorDestructureSet(receiver, descriptor);
+}
+
+module.exports = _classStaticPrivateFieldDestructureSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecGet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecGet.js
new file mode 100644
index 0000000..d7201c3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecGet.js
@@ -0,0 +1,13 @@
+var classApplyDescriptorGet = require("./classApplyDescriptorGet.js");
+
+var classCheckPrivateStaticAccess = require("./classCheckPrivateStaticAccess.js");
+
+var classCheckPrivateStaticFieldDescriptor = require("./classCheckPrivateStaticFieldDescriptor.js");
+
+function _classStaticPrivateFieldSpecGet(receiver, classConstructor, descriptor) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  classCheckPrivateStaticFieldDescriptor(descriptor, "get");
+  return classApplyDescriptorGet(receiver, descriptor);
+}
+
+module.exports = _classStaticPrivateFieldSpecGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecSet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecSet.js
new file mode 100644
index 0000000..2aa13ef
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecSet.js
@@ -0,0 +1,14 @@
+var classApplyDescriptorSet = require("./classApplyDescriptorSet.js");
+
+var classCheckPrivateStaticAccess = require("./classCheckPrivateStaticAccess.js");
+
+var classCheckPrivateStaticFieldDescriptor = require("./classCheckPrivateStaticFieldDescriptor.js");
+
+function _classStaticPrivateFieldSpecSet(receiver, classConstructor, descriptor, value) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  classCheckPrivateStaticFieldDescriptor(descriptor, "set");
+  classApplyDescriptorSet(receiver, descriptor, value);
+  return value;
+}
+
+module.exports = _classStaticPrivateFieldSpecSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodGet.js
new file mode 100644
index 0000000..d77c842
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodGet.js
@@ -0,0 +1,8 @@
+var classCheckPrivateStaticAccess = require("./classCheckPrivateStaticAccess.js");
+
+function _classStaticPrivateMethodGet(receiver, classConstructor, method) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  return method;
+}
+
+module.exports = _classStaticPrivateMethodGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodSet.js
new file mode 100644
index 0000000..2e1c83f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodSet.js
@@ -0,0 +1,5 @@
+function _classStaticPrivateMethodSet() {
+  throw new TypeError("attempted to set read only static private field");
+}
+
+module.exports = _classStaticPrivateMethodSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/construct.js b/node_modules/@babel/runtime/helpers/construct.js
new file mode 100644
index 0000000..c2518af
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/construct.js
@@ -0,0 +1,22 @@
+var setPrototypeOf = require("./setPrototypeOf.js");
+
+var isNativeReflectConstruct = require("./isNativeReflectConstruct.js");
+
+function _construct(Parent, args, Class) {
+  if (isNativeReflectConstruct()) {
+    module.exports = _construct = Reflect.construct, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  } else {
+    module.exports = _construct = function _construct(Parent, args, Class) {
+      var a = [null];
+      a.push.apply(a, args);
+      var Constructor = Function.bind.apply(Parent, a);
+      var instance = new Constructor();
+      if (Class) setPrototypeOf(instance, Class.prototype);
+      return instance;
+    }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  }
+
+  return _construct.apply(null, arguments);
+}
+
+module.exports = _construct, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createClass.js b/node_modules/@babel/runtime/helpers/createClass.js
new file mode 100644
index 0000000..4273e7a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createClass.js
@@ -0,0 +1,20 @@
+function _defineProperties(target, props) {
+  for (var i = 0; i < props.length; i++) {
+    var descriptor = props[i];
+    descriptor.enumerable = descriptor.enumerable || false;
+    descriptor.configurable = true;
+    if ("value" in descriptor) descriptor.writable = true;
+    Object.defineProperty(target, descriptor.key, descriptor);
+  }
+}
+
+function _createClass(Constructor, protoProps, staticProps) {
+  if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+  if (staticProps) _defineProperties(Constructor, staticProps);
+  Object.defineProperty(Constructor, "prototype", {
+    writable: false
+  });
+  return Constructor;
+}
+
+module.exports = _createClass, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createForOfIteratorHelper.js b/node_modules/@babel/runtime/helpers/createForOfIteratorHelper.js
new file mode 100644
index 0000000..0835893
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createForOfIteratorHelper.js
@@ -0,0 +1,60 @@
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+
+function _createForOfIteratorHelper(o, allowArrayLike) {
+  var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+
+  if (!it) {
+    if (Array.isArray(o) || (it = unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+      if (it) o = it;
+      var i = 0;
+
+      var F = function F() {};
+
+      return {
+        s: F,
+        n: function n() {
+          if (i >= o.length) return {
+            done: true
+          };
+          return {
+            done: false,
+            value: o[i++]
+          };
+        },
+        e: function e(_e) {
+          throw _e;
+        },
+        f: F
+      };
+    }
+
+    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+  }
+
+  var normalCompletion = true,
+      didErr = false,
+      err;
+  return {
+    s: function s() {
+      it = it.call(o);
+    },
+    n: function n() {
+      var step = it.next();
+      normalCompletion = step.done;
+      return step;
+    },
+    e: function e(_e2) {
+      didErr = true;
+      err = _e2;
+    },
+    f: function f() {
+      try {
+        if (!normalCompletion && it["return"] != null) it["return"]();
+      } finally {
+        if (didErr) throw err;
+      }
+    }
+  };
+}
+
+module.exports = _createForOfIteratorHelper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createForOfIteratorHelperLoose.js b/node_modules/@babel/runtime/helpers/createForOfIteratorHelperLoose.js
new file mode 100644
index 0000000..65d3bc9
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createForOfIteratorHelperLoose.js
@@ -0,0 +1,24 @@
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+
+function _createForOfIteratorHelperLoose(o, allowArrayLike) {
+  var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+  if (it) return (it = it.call(o)).next.bind(it);
+
+  if (Array.isArray(o) || (it = unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+    if (it) o = it;
+    var i = 0;
+    return function () {
+      if (i >= o.length) return {
+        done: true
+      };
+      return {
+        done: false,
+        value: o[i++]
+      };
+    };
+  }
+
+  throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+
+module.exports = _createForOfIteratorHelperLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createSuper.js b/node_modules/@babel/runtime/helpers/createSuper.js
new file mode 100644
index 0000000..624728b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createSuper.js
@@ -0,0 +1,24 @@
+var getPrototypeOf = require("./getPrototypeOf.js");
+
+var isNativeReflectConstruct = require("./isNativeReflectConstruct.js");
+
+var possibleConstructorReturn = require("./possibleConstructorReturn.js");
+
+function _createSuper(Derived) {
+  var hasNativeReflectConstruct = isNativeReflectConstruct();
+  return function _createSuperInternal() {
+    var Super = getPrototypeOf(Derived),
+        result;
+
+    if (hasNativeReflectConstruct) {
+      var NewTarget = getPrototypeOf(this).constructor;
+      result = Reflect.construct(Super, arguments, NewTarget);
+    } else {
+      result = Super.apply(this, arguments);
+    }
+
+    return possibleConstructorReturn(this, result);
+  };
+}
+
+module.exports = _createSuper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/decorate.js b/node_modules/@babel/runtime/helpers/decorate.js
new file mode 100644
index 0000000..3bd35e7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/decorate.js
@@ -0,0 +1,400 @@
+var toArray = require("./toArray.js");
+
+var toPropertyKey = require("./toPropertyKey.js");
+
+function _decorate(decorators, factory, superClass, mixins) {
+  var api = _getDecoratorsApi();
+
+  if (mixins) {
+    for (var i = 0; i < mixins.length; i++) {
+      api = mixins[i](api);
+    }
+  }
+
+  var r = factory(function initialize(O) {
+    api.initializeInstanceElements(O, decorated.elements);
+  }, superClass);
+  var decorated = api.decorateClass(_coalesceClassElements(r.d.map(_createElementDescriptor)), decorators);
+  api.initializeClassElements(r.F, decorated.elements);
+  return api.runClassFinishers(r.F, decorated.finishers);
+}
+
+function _getDecoratorsApi() {
+  _getDecoratorsApi = function _getDecoratorsApi() {
+    return api;
+  };
+
+  var api = {
+    elementsDefinitionOrder: [["method"], ["field"]],
+    initializeInstanceElements: function initializeInstanceElements(O, elements) {
+      ["method", "field"].forEach(function (kind) {
+        elements.forEach(function (element) {
+          if (element.kind === kind && element.placement === "own") {
+            this.defineClassElement(O, element);
+          }
+        }, this);
+      }, this);
+    },
+    initializeClassElements: function initializeClassElements(F, elements) {
+      var proto = F.prototype;
+      ["method", "field"].forEach(function (kind) {
+        elements.forEach(function (element) {
+          var placement = element.placement;
+
+          if (element.kind === kind && (placement === "static" || placement === "prototype")) {
+            var receiver = placement === "static" ? F : proto;
+            this.defineClassElement(receiver, element);
+          }
+        }, this);
+      }, this);
+    },
+    defineClassElement: function defineClassElement(receiver, element) {
+      var descriptor = element.descriptor;
+
+      if (element.kind === "field") {
+        var initializer = element.initializer;
+        descriptor = {
+          enumerable: descriptor.enumerable,
+          writable: descriptor.writable,
+          configurable: descriptor.configurable,
+          value: initializer === void 0 ? void 0 : initializer.call(receiver)
+        };
+      }
+
+      Object.defineProperty(receiver, element.key, descriptor);
+    },
+    decorateClass: function decorateClass(elements, decorators) {
+      var newElements = [];
+      var finishers = [];
+      var placements = {
+        "static": [],
+        prototype: [],
+        own: []
+      };
+      elements.forEach(function (element) {
+        this.addElementPlacement(element, placements);
+      }, this);
+      elements.forEach(function (element) {
+        if (!_hasDecorators(element)) return newElements.push(element);
+        var elementFinishersExtras = this.decorateElement(element, placements);
+        newElements.push(elementFinishersExtras.element);
+        newElements.push.apply(newElements, elementFinishersExtras.extras);
+        finishers.push.apply(finishers, elementFinishersExtras.finishers);
+      }, this);
+
+      if (!decorators) {
+        return {
+          elements: newElements,
+          finishers: finishers
+        };
+      }
+
+      var result = this.decorateConstructor(newElements, decorators);
+      finishers.push.apply(finishers, result.finishers);
+      result.finishers = finishers;
+      return result;
+    },
+    addElementPlacement: function addElementPlacement(element, placements, silent) {
+      var keys = placements[element.placement];
+
+      if (!silent && keys.indexOf(element.key) !== -1) {
+        throw new TypeError("Duplicated element (" + element.key + ")");
+      }
+
+      keys.push(element.key);
+    },
+    decorateElement: function decorateElement(element, placements) {
+      var extras = [];
+      var finishers = [];
+
+      for (var decorators = element.decorators, i = decorators.length - 1; i >= 0; i--) {
+        var keys = placements[element.placement];
+        keys.splice(keys.indexOf(element.key), 1);
+        var elementObject = this.fromElementDescriptor(element);
+        var elementFinisherExtras = this.toElementFinisherExtras((0, decorators[i])(elementObject) || elementObject);
+        element = elementFinisherExtras.element;
+        this.addElementPlacement(element, placements);
+
+        if (elementFinisherExtras.finisher) {
+          finishers.push(elementFinisherExtras.finisher);
+        }
+
+        var newExtras = elementFinisherExtras.extras;
+
+        if (newExtras) {
+          for (var j = 0; j < newExtras.length; j++) {
+            this.addElementPlacement(newExtras[j], placements);
+          }
+
+          extras.push.apply(extras, newExtras);
+        }
+      }
+
+      return {
+        element: element,
+        finishers: finishers,
+        extras: extras
+      };
+    },
+    decorateConstructor: function decorateConstructor(elements, decorators) {
+      var finishers = [];
+
+      for (var i = decorators.length - 1; i >= 0; i--) {
+        var obj = this.fromClassDescriptor(elements);
+        var elementsAndFinisher = this.toClassDescriptor((0, decorators[i])(obj) || obj);
+
+        if (elementsAndFinisher.finisher !== undefined) {
+          finishers.push(elementsAndFinisher.finisher);
+        }
+
+        if (elementsAndFinisher.elements !== undefined) {
+          elements = elementsAndFinisher.elements;
+
+          for (var j = 0; j < elements.length - 1; j++) {
+            for (var k = j + 1; k < elements.length; k++) {
+              if (elements[j].key === elements[k].key && elements[j].placement === elements[k].placement) {
+                throw new TypeError("Duplicated element (" + elements[j].key + ")");
+              }
+            }
+          }
+        }
+      }
+
+      return {
+        elements: elements,
+        finishers: finishers
+      };
+    },
+    fromElementDescriptor: function fromElementDescriptor(element) {
+      var obj = {
+        kind: element.kind,
+        key: element.key,
+        placement: element.placement,
+        descriptor: element.descriptor
+      };
+      var desc = {
+        value: "Descriptor",
+        configurable: true
+      };
+      Object.defineProperty(obj, Symbol.toStringTag, desc);
+      if (element.kind === "field") obj.initializer = element.initializer;
+      return obj;
+    },
+    toElementDescriptors: function toElementDescriptors(elementObjects) {
+      if (elementObjects === undefined) return;
+      return toArray(elementObjects).map(function (elementObject) {
+        var element = this.toElementDescriptor(elementObject);
+        this.disallowProperty(elementObject, "finisher", "An element descriptor");
+        this.disallowProperty(elementObject, "extras", "An element descriptor");
+        return element;
+      }, this);
+    },
+    toElementDescriptor: function toElementDescriptor(elementObject) {
+      var kind = String(elementObject.kind);
+
+      if (kind !== "method" && kind !== "field") {
+        throw new TypeError('An element descriptor\'s .kind property must be either "method" or' + ' "field", but a decorator created an element descriptor with' + ' .kind "' + kind + '"');
+      }
+
+      var key = toPropertyKey(elementObject.key);
+      var placement = String(elementObject.placement);
+
+      if (placement !== "static" && placement !== "prototype" && placement !== "own") {
+        throw new TypeError('An element descriptor\'s .placement property must be one of "static",' + ' "prototype" or "own", but a decorator created an element descriptor' + ' with .placement "' + placement + '"');
+      }
+
+      var descriptor = elementObject.descriptor;
+      this.disallowProperty(elementObject, "elements", "An element descriptor");
+      var element = {
+        kind: kind,
+        key: key,
+        placement: placement,
+        descriptor: Object.assign({}, descriptor)
+      };
+
+      if (kind !== "field") {
+        this.disallowProperty(elementObject, "initializer", "A method descriptor");
+      } else {
+        this.disallowProperty(descriptor, "get", "The property descriptor of a field descriptor");
+        this.disallowProperty(descriptor, "set", "The property descriptor of a field descriptor");
+        this.disallowProperty(descriptor, "value", "The property descriptor of a field descriptor");
+        element.initializer = elementObject.initializer;
+      }
+
+      return element;
+    },
+    toElementFinisherExtras: function toElementFinisherExtras(elementObject) {
+      var element = this.toElementDescriptor(elementObject);
+
+      var finisher = _optionalCallableProperty(elementObject, "finisher");
+
+      var extras = this.toElementDescriptors(elementObject.extras);
+      return {
+        element: element,
+        finisher: finisher,
+        extras: extras
+      };
+    },
+    fromClassDescriptor: function fromClassDescriptor(elements) {
+      var obj = {
+        kind: "class",
+        elements: elements.map(this.fromElementDescriptor, this)
+      };
+      var desc = {
+        value: "Descriptor",
+        configurable: true
+      };
+      Object.defineProperty(obj, Symbol.toStringTag, desc);
+      return obj;
+    },
+    toClassDescriptor: function toClassDescriptor(obj) {
+      var kind = String(obj.kind);
+
+      if (kind !== "class") {
+        throw new TypeError('A class descriptor\'s .kind property must be "class", but a decorator' + ' created a class descriptor with .kind "' + kind + '"');
+      }
+
+      this.disallowProperty(obj, "key", "A class descriptor");
+      this.disallowProperty(obj, "placement", "A class descriptor");
+      this.disallowProperty(obj, "descriptor", "A class descriptor");
+      this.disallowProperty(obj, "initializer", "A class descriptor");
+      this.disallowProperty(obj, "extras", "A class descriptor");
+
+      var finisher = _optionalCallableProperty(obj, "finisher");
+
+      var elements = this.toElementDescriptors(obj.elements);
+      return {
+        elements: elements,
+        finisher: finisher
+      };
+    },
+    runClassFinishers: function runClassFinishers(constructor, finishers) {
+      for (var i = 0; i < finishers.length; i++) {
+        var newConstructor = (0, finishers[i])(constructor);
+
+        if (newConstructor !== undefined) {
+          if (typeof newConstructor !== "function") {
+            throw new TypeError("Finishers must return a constructor.");
+          }
+
+          constructor = newConstructor;
+        }
+      }
+
+      return constructor;
+    },
+    disallowProperty: function disallowProperty(obj, name, objectType) {
+      if (obj[name] !== undefined) {
+        throw new TypeError(objectType + " can't have a ." + name + " property.");
+      }
+    }
+  };
+  return api;
+}
+
+function _createElementDescriptor(def) {
+  var key = toPropertyKey(def.key);
+  var descriptor;
+
+  if (def.kind === "method") {
+    descriptor = {
+      value: def.value,
+      writable: true,
+      configurable: true,
+      enumerable: false
+    };
+  } else if (def.kind === "get") {
+    descriptor = {
+      get: def.value,
+      configurable: true,
+      enumerable: false
+    };
+  } else if (def.kind === "set") {
+    descriptor = {
+      set: def.value,
+      configurable: true,
+      enumerable: false
+    };
+  } else if (def.kind === "field") {
+    descriptor = {
+      configurable: true,
+      writable: true,
+      enumerable: true
+    };
+  }
+
+  var element = {
+    kind: def.kind === "field" ? "field" : "method",
+    key: key,
+    placement: def["static"] ? "static" : def.kind === "field" ? "own" : "prototype",
+    descriptor: descriptor
+  };
+  if (def.decorators) element.decorators = def.decorators;
+  if (def.kind === "field") element.initializer = def.value;
+  return element;
+}
+
+function _coalesceGetterSetter(element, other) {
+  if (element.descriptor.get !== undefined) {
+    other.descriptor.get = element.descriptor.get;
+  } else {
+    other.descriptor.set = element.descriptor.set;
+  }
+}
+
+function _coalesceClassElements(elements) {
+  var newElements = [];
+
+  var isSameElement = function isSameElement(other) {
+    return other.kind === "method" && other.key === element.key && other.placement === element.placement;
+  };
+
+  for (var i = 0; i < elements.length; i++) {
+    var element = elements[i];
+    var other;
+
+    if (element.kind === "method" && (other = newElements.find(isSameElement))) {
+      if (_isDataDescriptor(element.descriptor) || _isDataDescriptor(other.descriptor)) {
+        if (_hasDecorators(element) || _hasDecorators(other)) {
+          throw new ReferenceError("Duplicated methods (" + element.key + ") can't be decorated.");
+        }
+
+        other.descriptor = element.descriptor;
+      } else {
+        if (_hasDecorators(element)) {
+          if (_hasDecorators(other)) {
+            throw new ReferenceError("Decorators can't be placed on different accessors with for " + "the same property (" + element.key + ").");
+          }
+
+          other.decorators = element.decorators;
+        }
+
+        _coalesceGetterSetter(element, other);
+      }
+    } else {
+      newElements.push(element);
+    }
+  }
+
+  return newElements;
+}
+
+function _hasDecorators(element) {
+  return element.decorators && element.decorators.length;
+}
+
+function _isDataDescriptor(desc) {
+  return desc !== undefined && !(desc.value === undefined && desc.writable === undefined);
+}
+
+function _optionalCallableProperty(obj, name) {
+  var value = obj[name];
+
+  if (value !== undefined && typeof value !== "function") {
+    throw new TypeError("Expected '" + name + "' to be a function");
+  }
+
+  return value;
+}
+
+module.exports = _decorate, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/defaults.js b/node_modules/@babel/runtime/helpers/defaults.js
new file mode 100644
index 0000000..6c1c196
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/defaults.js
@@ -0,0 +1,16 @@
+function _defaults(obj, defaults) {
+  var keys = Object.getOwnPropertyNames(defaults);
+
+  for (var i = 0; i < keys.length; i++) {
+    var key = keys[i];
+    var value = Object.getOwnPropertyDescriptor(defaults, key);
+
+    if (value && value.configurable && obj[key] === undefined) {
+      Object.defineProperty(obj, key, value);
+    }
+  }
+
+  return obj;
+}
+
+module.exports = _defaults, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/defineEnumerableProperties.js b/node_modules/@babel/runtime/helpers/defineEnumerableProperties.js
new file mode 100644
index 0000000..cd49128
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/defineEnumerableProperties.js
@@ -0,0 +1,24 @@
+function _defineEnumerableProperties(obj, descs) {
+  for (var key in descs) {
+    var desc = descs[key];
+    desc.configurable = desc.enumerable = true;
+    if ("value" in desc) desc.writable = true;
+    Object.defineProperty(obj, key, desc);
+  }
+
+  if (Object.getOwnPropertySymbols) {
+    var objectSymbols = Object.getOwnPropertySymbols(descs);
+
+    for (var i = 0; i < objectSymbols.length; i++) {
+      var sym = objectSymbols[i];
+      var desc = descs[sym];
+      desc.configurable = desc.enumerable = true;
+      if ("value" in desc) desc.writable = true;
+      Object.defineProperty(obj, sym, desc);
+    }
+  }
+
+  return obj;
+}
+
+module.exports = _defineEnumerableProperties, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/defineProperty.js b/node_modules/@babel/runtime/helpers/defineProperty.js
new file mode 100644
index 0000000..fe7d6bb
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/defineProperty.js
@@ -0,0 +1,16 @@
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+
+  return obj;
+}
+
+module.exports = _defineProperty, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/AsyncGenerator.js b/node_modules/@babel/runtime/helpers/esm/AsyncGenerator.js
new file mode 100644
index 0000000..919aab8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/AsyncGenerator.js
@@ -0,0 +1,95 @@
+import AwaitValue from "./AwaitValue.js";
+export default function AsyncGenerator(gen) {
+  var front, back;
+
+  function send(key, arg) {
+    return new Promise(function (resolve, reject) {
+      var request = {
+        key: key,
+        arg: arg,
+        resolve: resolve,
+        reject: reject,
+        next: null
+      };
+
+      if (back) {
+        back = back.next = request;
+      } else {
+        front = back = request;
+        resume(key, arg);
+      }
+    });
+  }
+
+  function resume(key, arg) {
+    try {
+      var result = gen[key](arg);
+      var value = result.value;
+      var wrappedAwait = value instanceof AwaitValue;
+      Promise.resolve(wrappedAwait ? value.wrapped : value).then(function (arg) {
+        if (wrappedAwait) {
+          resume(key === "return" ? "return" : "next", arg);
+          return;
+        }
+
+        settle(result.done ? "return" : "normal", arg);
+      }, function (err) {
+        resume("throw", err);
+      });
+    } catch (err) {
+      settle("throw", err);
+    }
+  }
+
+  function settle(type, value) {
+    switch (type) {
+      case "return":
+        front.resolve({
+          value: value,
+          done: true
+        });
+        break;
+
+      case "throw":
+        front.reject(value);
+        break;
+
+      default:
+        front.resolve({
+          value: value,
+          done: false
+        });
+        break;
+    }
+
+    front = front.next;
+
+    if (front) {
+      resume(front.key, front.arg);
+    } else {
+      back = null;
+    }
+  }
+
+  this._invoke = send;
+
+  if (typeof gen["return"] !== "function") {
+    this["return"] = undefined;
+  }
+}
+
+AsyncGenerator.prototype[typeof Symbol === "function" && Symbol.asyncIterator || "@@asyncIterator"] = function () {
+  return this;
+};
+
+AsyncGenerator.prototype.next = function (arg) {
+  return this._invoke("next", arg);
+};
+
+AsyncGenerator.prototype["throw"] = function (arg) {
+  return this._invoke("throw", arg);
+};
+
+AsyncGenerator.prototype["return"] = function (arg) {
+  return this._invoke("return", arg);
+};
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/AwaitValue.js b/node_modules/@babel/runtime/helpers/esm/AwaitValue.js
new file mode 100644
index 0000000..5237e18
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/AwaitValue.js
@@ -0,0 +1,3 @@
+export default function _AwaitValue(value) {
+  this.wrapped = value;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecoratedDescriptor.js b/node_modules/@babel/runtime/helpers/esm/applyDecoratedDescriptor.js
new file mode 100644
index 0000000..84b5961
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecoratedDescriptor.js
@@ -0,0 +1,28 @@
+export default function _applyDecoratedDescriptor(target, property, decorators, descriptor, context) {
+  var desc = {};
+  Object.keys(descriptor).forEach(function (key) {
+    desc[key] = descriptor[key];
+  });
+  desc.enumerable = !!desc.enumerable;
+  desc.configurable = !!desc.configurable;
+
+  if ('value' in desc || desc.initializer) {
+    desc.writable = true;
+  }
+
+  desc = decorators.slice().reverse().reduce(function (desc, decorator) {
+    return decorator(target, property, desc) || desc;
+  }, desc);
+
+  if (context && desc.initializer !== void 0) {
+    desc.value = desc.initializer ? desc.initializer.call(context) : void 0;
+    desc.initializer = undefined;
+  }
+
+  if (desc.initializer === void 0) {
+    Object.defineProperty(target, property, desc);
+    desc = null;
+  }
+
+  return desc;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecs.js b/node_modules/@babel/runtime/helpers/esm/applyDecs.js
new file mode 100644
index 0000000..a6187c0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecs.js
@@ -0,0 +1,282 @@
+import _typeof from "./typeof.js";
+
+function createMetadataMethodsForProperty(metadataMap, kind, property, decoratorFinishedRef) {
+  return {
+    getMetadata: function getMetadata(key) {
+      assertNotFinished(decoratorFinishedRef, "getMetadata"), assertMetadataKey(key);
+      var metadataForKey = metadataMap[key];
+      if (void 0 !== metadataForKey) if (1 === kind) {
+        var pub = metadataForKey["public"];
+        if (void 0 !== pub) return pub[property];
+      } else if (2 === kind) {
+        var priv = metadataForKey["private"];
+        if (void 0 !== priv) return priv.get(property);
+      } else if (Object.hasOwnProperty.call(metadataForKey, "constructor")) return metadataForKey.constructor;
+    },
+    setMetadata: function setMetadata(key, value) {
+      assertNotFinished(decoratorFinishedRef, "setMetadata"), assertMetadataKey(key);
+      var metadataForKey = metadataMap[key];
+
+      if (void 0 === metadataForKey && (metadataForKey = metadataMap[key] = {}), 1 === kind) {
+        var pub = metadataForKey["public"];
+        void 0 === pub && (pub = metadataForKey["public"] = {}), pub[property] = value;
+      } else if (2 === kind) {
+        var priv = metadataForKey.priv;
+        void 0 === priv && (priv = metadataForKey["private"] = new Map()), priv.set(property, value);
+      } else metadataForKey.constructor = value;
+    }
+  };
+}
+
+function convertMetadataMapToFinal(obj, metadataMap) {
+  var parentMetadataMap = obj[Symbol.metadata || Symbol["for"]("Symbol.metadata")],
+      metadataKeys = Object.getOwnPropertySymbols(metadataMap);
+
+  if (0 !== metadataKeys.length) {
+    for (var i = 0; i < metadataKeys.length; i++) {
+      var key = metadataKeys[i],
+          metaForKey = metadataMap[key],
+          parentMetaForKey = parentMetadataMap ? parentMetadataMap[key] : null,
+          pub = metaForKey["public"],
+          parentPub = parentMetaForKey ? parentMetaForKey["public"] : null;
+      pub && parentPub && Object.setPrototypeOf(pub, parentPub);
+      var priv = metaForKey["private"];
+
+      if (priv) {
+        var privArr = Array.from(priv.values()),
+            parentPriv = parentMetaForKey ? parentMetaForKey["private"] : null;
+        parentPriv && (privArr = privArr.concat(parentPriv)), metaForKey["private"] = privArr;
+      }
+
+      parentMetaForKey && Object.setPrototypeOf(metaForKey, parentMetaForKey);
+    }
+
+    parentMetadataMap && Object.setPrototypeOf(metadataMap, parentMetadataMap), obj[Symbol.metadata || Symbol["for"]("Symbol.metadata")] = metadataMap;
+  }
+}
+
+function createAddInitializerMethod(initializers, decoratorFinishedRef) {
+  return function (initializer) {
+    assertNotFinished(decoratorFinishedRef, "addInitializer"), assertCallable(initializer, "An initializer"), initializers.push(initializer);
+  };
+}
+
+function memberDec(dec, name, desc, metadataMap, initializers, kind, isStatic, isPrivate, value) {
+  var kindStr;
+
+  switch (kind) {
+    case 1:
+      kindStr = "accessor";
+      break;
+
+    case 2:
+      kindStr = "method";
+      break;
+
+    case 3:
+      kindStr = "getter";
+      break;
+
+    case 4:
+      kindStr = "setter";
+      break;
+
+    default:
+      kindStr = "field";
+  }
+
+  var metadataKind,
+      metadataName,
+      ctx = {
+    kind: kindStr,
+    name: isPrivate ? "#" + name : name,
+    isStatic: isStatic,
+    isPrivate: isPrivate
+  },
+      decoratorFinishedRef = {
+    v: !1
+  };
+
+  if (0 !== kind && (ctx.addInitializer = createAddInitializerMethod(initializers, decoratorFinishedRef)), isPrivate) {
+    metadataKind = 2, metadataName = Symbol(name);
+    var access = {};
+    0 === kind ? (access.get = desc.get, access.set = desc.set) : 2 === kind ? access.get = function () {
+      return desc.value;
+    } : (1 !== kind && 3 !== kind || (access.get = function () {
+      return desc.get.call(this);
+    }), 1 !== kind && 4 !== kind || (access.set = function (v) {
+      desc.set.call(this, v);
+    })), ctx.access = access;
+  } else metadataKind = 1, metadataName = name;
+
+  try {
+    return dec(value, Object.assign(ctx, createMetadataMethodsForProperty(metadataMap, metadataKind, metadataName, decoratorFinishedRef)));
+  } finally {
+    decoratorFinishedRef.v = !0;
+  }
+}
+
+function assertNotFinished(decoratorFinishedRef, fnName) {
+  if (decoratorFinishedRef.v) throw new Error("attempted to call " + fnName + " after decoration was finished");
+}
+
+function assertMetadataKey(key) {
+  if ("symbol" != _typeof(key)) throw new TypeError("Metadata keys must be symbols, received: " + key);
+}
+
+function assertCallable(fn, hint) {
+  if ("function" != typeof fn) throw new TypeError(hint + " must be a function");
+}
+
+function assertValidReturnValue(kind, value) {
+  var type = _typeof(value);
+
+  if (1 === kind) {
+    if ("object" !== type || null === value) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+    void 0 !== value.get && assertCallable(value.get, "accessor.get"), void 0 !== value.set && assertCallable(value.set, "accessor.set"), void 0 !== value.init && assertCallable(value.init, "accessor.init"), void 0 !== value.initializer && assertCallable(value.initializer, "accessor.initializer");
+  } else if ("function" !== type) {
+    var hint;
+    throw hint = 0 === kind ? "field" : 10 === kind ? "class" : "method", new TypeError(hint + " decorators must return a function or void 0");
+  }
+}
+
+function getInit(desc) {
+  var initializer;
+  return null == (initializer = desc.init) && (initializer = desc.initializer) && "undefined" != typeof console && console.warn(".initializer has been renamed to .init as of March 2022"), initializer;
+}
+
+function applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, metadataMap, initializers) {
+  var desc,
+      initializer,
+      value,
+      newValue,
+      get,
+      set,
+      decs = decInfo[0];
+  if (isPrivate ? desc = 0 === kind || 1 === kind ? {
+    get: decInfo[3],
+    set: decInfo[4]
+  } : 3 === kind ? {
+    get: decInfo[3]
+  } : 4 === kind ? {
+    set: decInfo[3]
+  } : {
+    value: decInfo[3]
+  } : 0 !== kind && (desc = Object.getOwnPropertyDescriptor(base, name)), 1 === kind ? value = {
+    get: desc.get,
+    set: desc.set
+  } : 2 === kind ? value = desc.value : 3 === kind ? value = desc.get : 4 === kind && (value = desc.set), "function" == typeof decs) void 0 !== (newValue = memberDec(decs, name, desc, metadataMap, initializers, kind, isStatic, isPrivate, value)) && (assertValidReturnValue(kind, newValue), 0 === kind ? initializer = newValue : 1 === kind ? (initializer = getInit(newValue), get = newValue.get || value.get, set = newValue.set || value.set, value = {
+    get: get,
+    set: set
+  }) : value = newValue);else for (var i = decs.length - 1; i >= 0; i--) {
+    var newInit;
+    if (void 0 !== (newValue = memberDec(decs[i], name, desc, metadataMap, initializers, kind, isStatic, isPrivate, value))) assertValidReturnValue(kind, newValue), 0 === kind ? newInit = newValue : 1 === kind ? (newInit = getInit(newValue), get = newValue.get || value.get, set = newValue.set || value.set, value = {
+      get: get,
+      set: set
+    }) : value = newValue, void 0 !== newInit && (void 0 === initializer ? initializer = newInit : "function" == typeof initializer ? initializer = [initializer, newInit] : initializer.push(newInit));
+  }
+
+  if (0 === kind || 1 === kind) {
+    if (void 0 === initializer) initializer = function initializer(instance, init) {
+      return init;
+    };else if ("function" != typeof initializer) {
+      var ownInitializers = initializer;
+
+      initializer = function initializer(instance, init) {
+        for (var value = init, i = 0; i < ownInitializers.length; i++) {
+          value = ownInitializers[i].call(instance, value);
+        }
+
+        return value;
+      };
+    } else {
+      var originalInitializer = initializer;
+
+      initializer = function initializer(instance, init) {
+        return originalInitializer.call(instance, init);
+      };
+    }
+    ret.push(initializer);
+  }
+
+  0 !== kind && (1 === kind ? (desc.get = value.get, desc.set = value.set) : 2 === kind ? desc.value = value : 3 === kind ? desc.get = value : 4 === kind && (desc.set = value), isPrivate ? 1 === kind ? (ret.push(function (instance, args) {
+    return value.get.call(instance, args);
+  }), ret.push(function (instance, args) {
+    return value.set.call(instance, args);
+  })) : 2 === kind ? ret.push(value) : ret.push(function (instance, args) {
+    return value.call(instance, args);
+  }) : Object.defineProperty(base, name, desc));
+}
+
+function applyMemberDecs(ret, Class, protoMetadataMap, staticMetadataMap, decInfos) {
+  for (var protoInitializers, staticInitializers, existingProtoNonFields = new Map(), existingStaticNonFields = new Map(), i = 0; i < decInfos.length; i++) {
+    var decInfo = decInfos[i];
+
+    if (Array.isArray(decInfo)) {
+      var base,
+          metadataMap,
+          initializers,
+          kind = decInfo[1],
+          name = decInfo[2],
+          isPrivate = decInfo.length > 3,
+          isStatic = kind >= 5;
+
+      if (isStatic ? (base = Class, metadataMap = staticMetadataMap, 0 !== (kind -= 5) && (initializers = staticInitializers = staticInitializers || [])) : (base = Class.prototype, metadataMap = protoMetadataMap, 0 !== kind && (initializers = protoInitializers = protoInitializers || [])), 0 !== kind && !isPrivate) {
+        var existingNonFields = isStatic ? existingStaticNonFields : existingProtoNonFields,
+            existingKind = existingNonFields.get(name) || 0;
+        if (!0 === existingKind || 3 === existingKind && 4 !== kind || 4 === existingKind && 3 !== kind) throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + name);
+        !existingKind && kind > 2 ? existingNonFields.set(name, kind) : existingNonFields.set(name, !0);
+      }
+
+      applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, metadataMap, initializers);
+    }
+  }
+
+  pushInitializers(ret, protoInitializers), pushInitializers(ret, staticInitializers);
+}
+
+function pushInitializers(ret, initializers) {
+  initializers && ret.push(function (instance) {
+    for (var i = 0; i < initializers.length; i++) {
+      initializers[i].call(instance);
+    }
+
+    return instance;
+  });
+}
+
+function applyClassDecs(ret, targetClass, metadataMap, classDecs) {
+  if (classDecs.length > 0) {
+    for (var initializers = [], newClass = targetClass, name = targetClass.name, i = classDecs.length - 1; i >= 0; i--) {
+      var decoratorFinishedRef = {
+        v: !1
+      };
+
+      try {
+        var ctx = Object.assign({
+          kind: "class",
+          name: name,
+          addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef)
+        }, createMetadataMethodsForProperty(metadataMap, 0, name, decoratorFinishedRef)),
+            nextNewClass = classDecs[i](newClass, ctx);
+      } finally {
+        decoratorFinishedRef.v = !0;
+      }
+
+      void 0 !== nextNewClass && (assertValidReturnValue(10, nextNewClass), newClass = nextNewClass);
+    }
+
+    ret.push(newClass, function () {
+      for (var i = 0; i < initializers.length; i++) {
+        initializers[i].call(newClass);
+      }
+    });
+  }
+}
+
+export default function applyDecs(targetClass, memberDecs, classDecs) {
+  var ret = [],
+      staticMetadataMap = {},
+      protoMetadataMap = {};
+  return applyMemberDecs(ret, targetClass, protoMetadataMap, staticMetadataMap, memberDecs), convertMetadataMapToFinal(targetClass.prototype, protoMetadataMap), applyClassDecs(ret, targetClass, staticMetadataMap, classDecs), convertMetadataMapToFinal(targetClass, staticMetadataMap), ret;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js b/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js
new file mode 100644
index 0000000..edbeb8e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js
@@ -0,0 +1,9 @@
+export default function _arrayLikeToArray(arr, len) {
+  if (len == null || len > arr.length) len = arr.length;
+
+  for (var i = 0, arr2 = new Array(len); i < len; i++) {
+    arr2[i] = arr[i];
+  }
+
+  return arr2;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js b/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js
new file mode 100644
index 0000000..be734fc
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js
@@ -0,0 +1,3 @@
+export default function _arrayWithHoles(arr) {
+  if (Array.isArray(arr)) return arr;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js b/node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js
new file mode 100644
index 0000000..f7d8dc7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js
@@ -0,0 +1,4 @@
+import arrayLikeToArray from "./arrayLikeToArray.js";
+export default function _arrayWithoutHoles(arr) {
+  if (Array.isArray(arr)) return arrayLikeToArray(arr);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js b/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js
new file mode 100644
index 0000000..bbf849c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js
@@ -0,0 +1,7 @@
+export default function _assertThisInitialized(self) {
+  if (self === void 0) {
+    throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+  }
+
+  return self;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/asyncGeneratorDelegate.js b/node_modules/@babel/runtime/helpers/esm/asyncGeneratorDelegate.js
new file mode 100644
index 0000000..a7ccd67
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/asyncGeneratorDelegate.js
@@ -0,0 +1,54 @@
+export default function _asyncGeneratorDelegate(inner, awaitWrap) {
+  var iter = {},
+      waiting = false;
+
+  function pump(key, value) {
+    waiting = true;
+    value = new Promise(function (resolve) {
+      resolve(inner[key](value));
+    });
+    return {
+      done: false,
+      value: awaitWrap(value)
+    };
+  }
+
+  ;
+
+  iter[typeof Symbol !== "undefined" && Symbol.iterator || "@@iterator"] = function () {
+    return this;
+  };
+
+  iter.next = function (value) {
+    if (waiting) {
+      waiting = false;
+      return value;
+    }
+
+    return pump("next", value);
+  };
+
+  if (typeof inner["throw"] === "function") {
+    iter["throw"] = function (value) {
+      if (waiting) {
+        waiting = false;
+        throw value;
+      }
+
+      return pump("throw", value);
+    };
+  }
+
+  if (typeof inner["return"] === "function") {
+    iter["return"] = function (value) {
+      if (waiting) {
+        waiting = false;
+        return value;
+      }
+
+      return pump("return", value);
+    };
+  }
+
+  return iter;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/asyncIterator.js b/node_modules/@babel/runtime/helpers/esm/asyncIterator.js
new file mode 100644
index 0000000..030c44e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/asyncIterator.js
@@ -0,0 +1,48 @@
+export default function _asyncIterator(iterable) {
+  var method,
+      async,
+      sync,
+      retry = 2;
+
+  for ("undefined" != typeof Symbol && (async = Symbol.asyncIterator, sync = Symbol.iterator); retry--;) {
+    if (async && null != (method = iterable[async])) return method.call(iterable);
+    if (sync && null != (method = iterable[sync])) return new AsyncFromSyncIterator(method.call(iterable));
+    async = "@@asyncIterator", sync = "@@iterator";
+  }
+
+  throw new TypeError("Object is not async iterable");
+}
+
+function AsyncFromSyncIterator(s) {
+  function AsyncFromSyncIteratorContinuation(r) {
+    if (Object(r) !== r) return Promise.reject(new TypeError(r + " is not an object."));
+    var done = r.done;
+    return Promise.resolve(r.value).then(function (value) {
+      return {
+        value: value,
+        done: done
+      };
+    });
+  }
+
+  return AsyncFromSyncIterator = function AsyncFromSyncIterator(s) {
+    this.s = s, this.n = s.next;
+  }, AsyncFromSyncIterator.prototype = {
+    s: null,
+    n: null,
+    next: function next() {
+      return AsyncFromSyncIteratorContinuation(this.n.apply(this.s, arguments));
+    },
+    "return": function _return(value) {
+      var ret = this.s["return"];
+      return void 0 === ret ? Promise.resolve({
+        value: value,
+        done: !0
+      }) : AsyncFromSyncIteratorContinuation(ret.apply(this.s, arguments));
+    },
+    "throw": function _throw(value) {
+      var thr = this.s["return"];
+      return void 0 === thr ? Promise.reject(value) : AsyncFromSyncIteratorContinuation(thr.apply(this.s, arguments));
+    }
+  }, new AsyncFromSyncIterator(s);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js b/node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js
new file mode 100644
index 0000000..2a25f54
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js
@@ -0,0 +1,35 @@
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
+  try {
+    var info = gen[key](arg);
+    var value = info.value;
+  } catch (error) {
+    reject(error);
+    return;
+  }
+
+  if (info.done) {
+    resolve(value);
+  } else {
+    Promise.resolve(value).then(_next, _throw);
+  }
+}
+
+export default function _asyncToGenerator(fn) {
+  return function () {
+    var self = this,
+        args = arguments;
+    return new Promise(function (resolve, reject) {
+      var gen = fn.apply(self, args);
+
+      function _next(value) {
+        asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
+      }
+
+      function _throw(err) {
+        asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
+      }
+
+      _next(undefined);
+    });
+  };
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/awaitAsyncGenerator.js b/node_modules/@babel/runtime/helpers/esm/awaitAsyncGenerator.js
new file mode 100644
index 0000000..ccca65e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/awaitAsyncGenerator.js
@@ -0,0 +1,4 @@
+import AwaitValue from "./AwaitValue.js";
+export default function _awaitAsyncGenerator(value) {
+  return new AwaitValue(value);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/checkPrivateRedeclaration.js b/node_modules/@babel/runtime/helpers/esm/checkPrivateRedeclaration.js
new file mode 100644
index 0000000..9901403
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/checkPrivateRedeclaration.js
@@ -0,0 +1,5 @@
+export default function _checkPrivateRedeclaration(obj, privateCollection) {
+  if (privateCollection.has(obj)) {
+    throw new TypeError("Cannot initialize the same private elements twice on an object");
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorDestructureSet.js b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorDestructureSet.js
new file mode 100644
index 0000000..4472adc
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorDestructureSet.js
@@ -0,0 +1,20 @@
+export default function _classApplyDescriptorDestructureSet(receiver, descriptor) {
+  if (descriptor.set) {
+    if (!("__destrObj" in descriptor)) {
+      descriptor.__destrObj = {
+        set value(v) {
+          descriptor.set.call(receiver, v);
+        }
+
+      };
+    }
+
+    return descriptor.__destrObj;
+  } else {
+    if (!descriptor.writable) {
+      throw new TypeError("attempted to set read only private field");
+    }
+
+    return descriptor;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorGet.js b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorGet.js
new file mode 100644
index 0000000..0fad169
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorGet.js
@@ -0,0 +1,7 @@
+export default function _classApplyDescriptorGet(receiver, descriptor) {
+  if (descriptor.get) {
+    return descriptor.get.call(receiver);
+  }
+
+  return descriptor.value;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorSet.js b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorSet.js
new file mode 100644
index 0000000..f295f3e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorSet.js
@@ -0,0 +1,11 @@
+export default function _classApplyDescriptorSet(receiver, descriptor, value) {
+  if (descriptor.set) {
+    descriptor.set.call(receiver, value);
+  } else {
+    if (!descriptor.writable) {
+      throw new TypeError("attempted to set read only private field");
+    }
+
+    descriptor.value = value;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classCallCheck.js b/node_modules/@babel/runtime/helpers/esm/classCallCheck.js
new file mode 100644
index 0000000..2f1738a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classCallCheck.js
@@ -0,0 +1,5 @@
+export default function _classCallCheck(instance, Constructor) {
+  if (!(instance instanceof Constructor)) {
+    throw new TypeError("Cannot call a class as a function");
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticAccess.js b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticAccess.js
new file mode 100644
index 0000000..098ed30
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticAccess.js
@@ -0,0 +1,5 @@
+export default function _classCheckPrivateStaticAccess(receiver, classConstructor) {
+  if (receiver !== classConstructor) {
+    throw new TypeError("Private static access of wrong provenance");
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticFieldDescriptor.js b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticFieldDescriptor.js
new file mode 100644
index 0000000..0ef34b8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticFieldDescriptor.js
@@ -0,0 +1,5 @@
+export default function _classCheckPrivateStaticFieldDescriptor(descriptor, action) {
+  if (descriptor === undefined) {
+    throw new TypeError("attempted to " + action + " private static field before its declaration");
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classExtractFieldDescriptor.js b/node_modules/@babel/runtime/helpers/esm/classExtractFieldDescriptor.js
new file mode 100644
index 0000000..8dabe9a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classExtractFieldDescriptor.js
@@ -0,0 +1,7 @@
+export default function _classExtractFieldDescriptor(receiver, privateMap, action) {
+  if (!privateMap.has(receiver)) {
+    throw new TypeError("attempted to " + action + " private field on non-instance");
+  }
+
+  return privateMap.get(receiver);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classNameTDZError.js b/node_modules/@babel/runtime/helpers/esm/classNameTDZError.js
new file mode 100644
index 0000000..f7b6dd5
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classNameTDZError.js
@@ -0,0 +1,3 @@
+export default function _classNameTDZError(name) {
+  throw new Error("Class \"" + name + "\" cannot be referenced in computed property keys.");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..fb58833
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldDestructureSet.js
@@ -0,0 +1,6 @@
+import classApplyDescriptorDestructureSet from "./classApplyDescriptorDestructureSet.js";
+import classExtractFieldDescriptor from "./classExtractFieldDescriptor.js";
+export default function _classPrivateFieldDestructureSet(receiver, privateMap) {
+  var descriptor = classExtractFieldDescriptor(receiver, privateMap, "set");
+  return classApplyDescriptorDestructureSet(receiver, descriptor);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet.js
new file mode 100644
index 0000000..53cd137
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet.js
@@ -0,0 +1,6 @@
+import classApplyDescriptorGet from "./classApplyDescriptorGet.js";
+import classExtractFieldDescriptor from "./classExtractFieldDescriptor.js";
+export default function _classPrivateFieldGet(receiver, privateMap) {
+  var descriptor = classExtractFieldDescriptor(receiver, privateMap, "get");
+  return classApplyDescriptorGet(receiver, descriptor);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldInitSpec.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldInitSpec.js
new file mode 100644
index 0000000..2253dd8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldInitSpec.js
@@ -0,0 +1,5 @@
+import checkPrivateRedeclaration from "./checkPrivateRedeclaration.js";
+export default function _classPrivateFieldInitSpec(obj, privateMap, value) {
+  checkPrivateRedeclaration(obj, privateMap);
+  privateMap.set(obj, value);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseBase.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseBase.js
new file mode 100644
index 0000000..5b10916
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseBase.js
@@ -0,0 +1,7 @@
+export default function _classPrivateFieldBase(receiver, privateKey) {
+  if (!Object.prototype.hasOwnProperty.call(receiver, privateKey)) {
+    throw new TypeError("attempted to use private field on non-instance");
+  }
+
+  return receiver;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseKey.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseKey.js
new file mode 100644
index 0000000..5b7e5ac
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseKey.js
@@ -0,0 +1,4 @@
+var id = 0;
+export default function _classPrivateFieldKey(name) {
+  return "__private_" + id++ + "_" + name;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet.js
new file mode 100644
index 0000000..ad91be4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet.js
@@ -0,0 +1,7 @@
+import classApplyDescriptorSet from "./classApplyDescriptorSet.js";
+import classExtractFieldDescriptor from "./classExtractFieldDescriptor.js";
+export default function _classPrivateFieldSet(receiver, privateMap, value) {
+  var descriptor = classExtractFieldDescriptor(receiver, privateMap, "set");
+  classApplyDescriptorSet(receiver, descriptor, value);
+  return value;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodGet.js
new file mode 100644
index 0000000..38b9d58
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodGet.js
@@ -0,0 +1,7 @@
+export default function _classPrivateMethodGet(receiver, privateSet, fn) {
+  if (!privateSet.has(receiver)) {
+    throw new TypeError("attempted to get private field on non-instance");
+  }
+
+  return fn;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateMethodInitSpec.js b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodInitSpec.js
new file mode 100644
index 0000000..18d1291
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodInitSpec.js
@@ -0,0 +1,5 @@
+import checkPrivateRedeclaration from "./checkPrivateRedeclaration.js";
+export default function _classPrivateMethodInitSpec(obj, privateSet) {
+  checkPrivateRedeclaration(obj, privateSet);
+  privateSet.add(obj);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodSet.js
new file mode 100644
index 0000000..2bbaf3a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodSet.js
@@ -0,0 +1,3 @@
+export default function _classPrivateMethodSet() {
+  throw new TypeError("attempted to reassign private method");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..77afcfb
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldDestructureSet.js
@@ -0,0 +1,8 @@
+import classApplyDescriptorDestructureSet from "./classApplyDescriptorDestructureSet.js";
+import classCheckPrivateStaticAccess from "./classCheckPrivateStaticAccess.js";
+import classCheckPrivateStaticFieldDescriptor from "./classCheckPrivateStaticFieldDescriptor.js";
+export default function _classStaticPrivateFieldDestructureSet(receiver, classConstructor, descriptor) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  classCheckPrivateStaticFieldDescriptor(descriptor, "set");
+  return classApplyDescriptorDestructureSet(receiver, descriptor);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecGet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecGet.js
new file mode 100644
index 0000000..d253d31
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecGet.js
@@ -0,0 +1,8 @@
+import classApplyDescriptorGet from "./classApplyDescriptorGet.js";
+import classCheckPrivateStaticAccess from "./classCheckPrivateStaticAccess.js";
+import classCheckPrivateStaticFieldDescriptor from "./classCheckPrivateStaticFieldDescriptor.js";
+export default function _classStaticPrivateFieldSpecGet(receiver, classConstructor, descriptor) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  classCheckPrivateStaticFieldDescriptor(descriptor, "get");
+  return classApplyDescriptorGet(receiver, descriptor);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecSet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecSet.js
new file mode 100644
index 0000000..b0b0cc6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecSet.js
@@ -0,0 +1,9 @@
+import classApplyDescriptorSet from "./classApplyDescriptorSet.js";
+import classCheckPrivateStaticAccess from "./classCheckPrivateStaticAccess.js";
+import classCheckPrivateStaticFieldDescriptor from "./classCheckPrivateStaticFieldDescriptor.js";
+export default function _classStaticPrivateFieldSpecSet(receiver, classConstructor, descriptor, value) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  classCheckPrivateStaticFieldDescriptor(descriptor, "set");
+  classApplyDescriptorSet(receiver, descriptor, value);
+  return value;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodGet.js
new file mode 100644
index 0000000..fddc7b2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodGet.js
@@ -0,0 +1,5 @@
+import classCheckPrivateStaticAccess from "./classCheckPrivateStaticAccess.js";
+export default function _classStaticPrivateMethodGet(receiver, classConstructor, method) {
+  classCheckPrivateStaticAccess(receiver, classConstructor);
+  return method;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodSet.js
new file mode 100644
index 0000000..d5ab60a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodSet.js
@@ -0,0 +1,3 @@
+export default function _classStaticPrivateMethodSet() {
+  throw new TypeError("attempted to set read only static private field");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/construct.js b/node_modules/@babel/runtime/helpers/esm/construct.js
new file mode 100644
index 0000000..0c39835
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/construct.js
@@ -0,0 +1,18 @@
+import setPrototypeOf from "./setPrototypeOf.js";
+import isNativeReflectConstruct from "./isNativeReflectConstruct.js";
+export default function _construct(Parent, args, Class) {
+  if (isNativeReflectConstruct()) {
+    _construct = Reflect.construct;
+  } else {
+    _construct = function _construct(Parent, args, Class) {
+      var a = [null];
+      a.push.apply(a, args);
+      var Constructor = Function.bind.apply(Parent, a);
+      var instance = new Constructor();
+      if (Class) setPrototypeOf(instance, Class.prototype);
+      return instance;
+    };
+  }
+
+  return _construct.apply(null, arguments);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createClass.js b/node_modules/@babel/runtime/helpers/esm/createClass.js
new file mode 100644
index 0000000..b320731
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createClass.js
@@ -0,0 +1,18 @@
+function _defineProperties(target, props) {
+  for (var i = 0; i < props.length; i++) {
+    var descriptor = props[i];
+    descriptor.enumerable = descriptor.enumerable || false;
+    descriptor.configurable = true;
+    if ("value" in descriptor) descriptor.writable = true;
+    Object.defineProperty(target, descriptor.key, descriptor);
+  }
+}
+
+export default function _createClass(Constructor, protoProps, staticProps) {
+  if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+  if (staticProps) _defineProperties(Constructor, staticProps);
+  Object.defineProperty(Constructor, "prototype", {
+    writable: false
+  });
+  return Constructor;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelper.js b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelper.js
new file mode 100644
index 0000000..a7a2a50
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelper.js
@@ -0,0 +1,57 @@
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+export default function _createForOfIteratorHelper(o, allowArrayLike) {
+  var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+
+  if (!it) {
+    if (Array.isArray(o) || (it = unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+      if (it) o = it;
+      var i = 0;
+
+      var F = function F() {};
+
+      return {
+        s: F,
+        n: function n() {
+          if (i >= o.length) return {
+            done: true
+          };
+          return {
+            done: false,
+            value: o[i++]
+          };
+        },
+        e: function e(_e) {
+          throw _e;
+        },
+        f: F
+      };
+    }
+
+    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+  }
+
+  var normalCompletion = true,
+      didErr = false,
+      err;
+  return {
+    s: function s() {
+      it = it.call(o);
+    },
+    n: function n() {
+      var step = it.next();
+      normalCompletion = step.done;
+      return step;
+    },
+    e: function e(_e2) {
+      didErr = true;
+      err = _e2;
+    },
+    f: function f() {
+      try {
+        if (!normalCompletion && it["return"] != null) it["return"]();
+      } finally {
+        if (didErr) throw err;
+      }
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelperLoose.js b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelperLoose.js
new file mode 100644
index 0000000..640ec68
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelperLoose.js
@@ -0,0 +1,21 @@
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+export default function _createForOfIteratorHelperLoose(o, allowArrayLike) {
+  var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+  if (it) return (it = it.call(o)).next.bind(it);
+
+  if (Array.isArray(o) || (it = unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+    if (it) o = it;
+    var i = 0;
+    return function () {
+      if (i >= o.length) return {
+        done: true
+      };
+      return {
+        done: false,
+        value: o[i++]
+      };
+    };
+  }
+
+  throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createSuper.js b/node_modules/@babel/runtime/helpers/esm/createSuper.js
new file mode 100644
index 0000000..ea5ea99
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createSuper.js
@@ -0,0 +1,19 @@
+import getPrototypeOf from "./getPrototypeOf.js";
+import isNativeReflectConstruct from "./isNativeReflectConstruct.js";
+import possibleConstructorReturn from "./possibleConstructorReturn.js";
+export default function _createSuper(Derived) {
+  var hasNativeReflectConstruct = isNativeReflectConstruct();
+  return function _createSuperInternal() {
+    var Super = getPrototypeOf(Derived),
+        result;
+
+    if (hasNativeReflectConstruct) {
+      var NewTarget = getPrototypeOf(this).constructor;
+      result = Reflect.construct(Super, arguments, NewTarget);
+    } else {
+      result = Super.apply(this, arguments);
+    }
+
+    return possibleConstructorReturn(this, result);
+  };
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/decorate.js b/node_modules/@babel/runtime/helpers/esm/decorate.js
new file mode 100644
index 0000000..daf56da
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/decorate.js
@@ -0,0 +1,396 @@
+import toArray from "./toArray.js";
+import toPropertyKey from "./toPropertyKey.js";
+export default function _decorate(decorators, factory, superClass, mixins) {
+  var api = _getDecoratorsApi();
+
+  if (mixins) {
+    for (var i = 0; i < mixins.length; i++) {
+      api = mixins[i](api);
+    }
+  }
+
+  var r = factory(function initialize(O) {
+    api.initializeInstanceElements(O, decorated.elements);
+  }, superClass);
+  var decorated = api.decorateClass(_coalesceClassElements(r.d.map(_createElementDescriptor)), decorators);
+  api.initializeClassElements(r.F, decorated.elements);
+  return api.runClassFinishers(r.F, decorated.finishers);
+}
+
+function _getDecoratorsApi() {
+  _getDecoratorsApi = function _getDecoratorsApi() {
+    return api;
+  };
+
+  var api = {
+    elementsDefinitionOrder: [["method"], ["field"]],
+    initializeInstanceElements: function initializeInstanceElements(O, elements) {
+      ["method", "field"].forEach(function (kind) {
+        elements.forEach(function (element) {
+          if (element.kind === kind && element.placement === "own") {
+            this.defineClassElement(O, element);
+          }
+        }, this);
+      }, this);
+    },
+    initializeClassElements: function initializeClassElements(F, elements) {
+      var proto = F.prototype;
+      ["method", "field"].forEach(function (kind) {
+        elements.forEach(function (element) {
+          var placement = element.placement;
+
+          if (element.kind === kind && (placement === "static" || placement === "prototype")) {
+            var receiver = placement === "static" ? F : proto;
+            this.defineClassElement(receiver, element);
+          }
+        }, this);
+      }, this);
+    },
+    defineClassElement: function defineClassElement(receiver, element) {
+      var descriptor = element.descriptor;
+
+      if (element.kind === "field") {
+        var initializer = element.initializer;
+        descriptor = {
+          enumerable: descriptor.enumerable,
+          writable: descriptor.writable,
+          configurable: descriptor.configurable,
+          value: initializer === void 0 ? void 0 : initializer.call(receiver)
+        };
+      }
+
+      Object.defineProperty(receiver, element.key, descriptor);
+    },
+    decorateClass: function decorateClass(elements, decorators) {
+      var newElements = [];
+      var finishers = [];
+      var placements = {
+        "static": [],
+        prototype: [],
+        own: []
+      };
+      elements.forEach(function (element) {
+        this.addElementPlacement(element, placements);
+      }, this);
+      elements.forEach(function (element) {
+        if (!_hasDecorators(element)) return newElements.push(element);
+        var elementFinishersExtras = this.decorateElement(element, placements);
+        newElements.push(elementFinishersExtras.element);
+        newElements.push.apply(newElements, elementFinishersExtras.extras);
+        finishers.push.apply(finishers, elementFinishersExtras.finishers);
+      }, this);
+
+      if (!decorators) {
+        return {
+          elements: newElements,
+          finishers: finishers
+        };
+      }
+
+      var result = this.decorateConstructor(newElements, decorators);
+      finishers.push.apply(finishers, result.finishers);
+      result.finishers = finishers;
+      return result;
+    },
+    addElementPlacement: function addElementPlacement(element, placements, silent) {
+      var keys = placements[element.placement];
+
+      if (!silent && keys.indexOf(element.key) !== -1) {
+        throw new TypeError("Duplicated element (" + element.key + ")");
+      }
+
+      keys.push(element.key);
+    },
+    decorateElement: function decorateElement(element, placements) {
+      var extras = [];
+      var finishers = [];
+
+      for (var decorators = element.decorators, i = decorators.length - 1; i >= 0; i--) {
+        var keys = placements[element.placement];
+        keys.splice(keys.indexOf(element.key), 1);
+        var elementObject = this.fromElementDescriptor(element);
+        var elementFinisherExtras = this.toElementFinisherExtras((0, decorators[i])(elementObject) || elementObject);
+        element = elementFinisherExtras.element;
+        this.addElementPlacement(element, placements);
+
+        if (elementFinisherExtras.finisher) {
+          finishers.push(elementFinisherExtras.finisher);
+        }
+
+        var newExtras = elementFinisherExtras.extras;
+
+        if (newExtras) {
+          for (var j = 0; j < newExtras.length; j++) {
+            this.addElementPlacement(newExtras[j], placements);
+          }
+
+          extras.push.apply(extras, newExtras);
+        }
+      }
+
+      return {
+        element: element,
+        finishers: finishers,
+        extras: extras
+      };
+    },
+    decorateConstructor: function decorateConstructor(elements, decorators) {
+      var finishers = [];
+
+      for (var i = decorators.length - 1; i >= 0; i--) {
+        var obj = this.fromClassDescriptor(elements);
+        var elementsAndFinisher = this.toClassDescriptor((0, decorators[i])(obj) || obj);
+
+        if (elementsAndFinisher.finisher !== undefined) {
+          finishers.push(elementsAndFinisher.finisher);
+        }
+
+        if (elementsAndFinisher.elements !== undefined) {
+          elements = elementsAndFinisher.elements;
+
+          for (var j = 0; j < elements.length - 1; j++) {
+            for (var k = j + 1; k < elements.length; k++) {
+              if (elements[j].key === elements[k].key && elements[j].placement === elements[k].placement) {
+                throw new TypeError("Duplicated element (" + elements[j].key + ")");
+              }
+            }
+          }
+        }
+      }
+
+      return {
+        elements: elements,
+        finishers: finishers
+      };
+    },
+    fromElementDescriptor: function fromElementDescriptor(element) {
+      var obj = {
+        kind: element.kind,
+        key: element.key,
+        placement: element.placement,
+        descriptor: element.descriptor
+      };
+      var desc = {
+        value: "Descriptor",
+        configurable: true
+      };
+      Object.defineProperty(obj, Symbol.toStringTag, desc);
+      if (element.kind === "field") obj.initializer = element.initializer;
+      return obj;
+    },
+    toElementDescriptors: function toElementDescriptors(elementObjects) {
+      if (elementObjects === undefined) return;
+      return toArray(elementObjects).map(function (elementObject) {
+        var element = this.toElementDescriptor(elementObject);
+        this.disallowProperty(elementObject, "finisher", "An element descriptor");
+        this.disallowProperty(elementObject, "extras", "An element descriptor");
+        return element;
+      }, this);
+    },
+    toElementDescriptor: function toElementDescriptor(elementObject) {
+      var kind = String(elementObject.kind);
+
+      if (kind !== "method" && kind !== "field") {
+        throw new TypeError('An element descriptor\'s .kind property must be either "method" or' + ' "field", but a decorator created an element descriptor with' + ' .kind "' + kind + '"');
+      }
+
+      var key = toPropertyKey(elementObject.key);
+      var placement = String(elementObject.placement);
+
+      if (placement !== "static" && placement !== "prototype" && placement !== "own") {
+        throw new TypeError('An element descriptor\'s .placement property must be one of "static",' + ' "prototype" or "own", but a decorator created an element descriptor' + ' with .placement "' + placement + '"');
+      }
+
+      var descriptor = elementObject.descriptor;
+      this.disallowProperty(elementObject, "elements", "An element descriptor");
+      var element = {
+        kind: kind,
+        key: key,
+        placement: placement,
+        descriptor: Object.assign({}, descriptor)
+      };
+
+      if (kind !== "field") {
+        this.disallowProperty(elementObject, "initializer", "A method descriptor");
+      } else {
+        this.disallowProperty(descriptor, "get", "The property descriptor of a field descriptor");
+        this.disallowProperty(descriptor, "set", "The property descriptor of a field descriptor");
+        this.disallowProperty(descriptor, "value", "The property descriptor of a field descriptor");
+        element.initializer = elementObject.initializer;
+      }
+
+      return element;
+    },
+    toElementFinisherExtras: function toElementFinisherExtras(elementObject) {
+      var element = this.toElementDescriptor(elementObject);
+
+      var finisher = _optionalCallableProperty(elementObject, "finisher");
+
+      var extras = this.toElementDescriptors(elementObject.extras);
+      return {
+        element: element,
+        finisher: finisher,
+        extras: extras
+      };
+    },
+    fromClassDescriptor: function fromClassDescriptor(elements) {
+      var obj = {
+        kind: "class",
+        elements: elements.map(this.fromElementDescriptor, this)
+      };
+      var desc = {
+        value: "Descriptor",
+        configurable: true
+      };
+      Object.defineProperty(obj, Symbol.toStringTag, desc);
+      return obj;
+    },
+    toClassDescriptor: function toClassDescriptor(obj) {
+      var kind = String(obj.kind);
+
+      if (kind !== "class") {
+        throw new TypeError('A class descriptor\'s .kind property must be "class", but a decorator' + ' created a class descriptor with .kind "' + kind + '"');
+      }
+
+      this.disallowProperty(obj, "key", "A class descriptor");
+      this.disallowProperty(obj, "placement", "A class descriptor");
+      this.disallowProperty(obj, "descriptor", "A class descriptor");
+      this.disallowProperty(obj, "initializer", "A class descriptor");
+      this.disallowProperty(obj, "extras", "A class descriptor");
+
+      var finisher = _optionalCallableProperty(obj, "finisher");
+
+      var elements = this.toElementDescriptors(obj.elements);
+      return {
+        elements: elements,
+        finisher: finisher
+      };
+    },
+    runClassFinishers: function runClassFinishers(constructor, finishers) {
+      for (var i = 0; i < finishers.length; i++) {
+        var newConstructor = (0, finishers[i])(constructor);
+
+        if (newConstructor !== undefined) {
+          if (typeof newConstructor !== "function") {
+            throw new TypeError("Finishers must return a constructor.");
+          }
+
+          constructor = newConstructor;
+        }
+      }
+
+      return constructor;
+    },
+    disallowProperty: function disallowProperty(obj, name, objectType) {
+      if (obj[name] !== undefined) {
+        throw new TypeError(objectType + " can't have a ." + name + " property.");
+      }
+    }
+  };
+  return api;
+}
+
+function _createElementDescriptor(def) {
+  var key = toPropertyKey(def.key);
+  var descriptor;
+
+  if (def.kind === "method") {
+    descriptor = {
+      value: def.value,
+      writable: true,
+      configurable: true,
+      enumerable: false
+    };
+  } else if (def.kind === "get") {
+    descriptor = {
+      get: def.value,
+      configurable: true,
+      enumerable: false
+    };
+  } else if (def.kind === "set") {
+    descriptor = {
+      set: def.value,
+      configurable: true,
+      enumerable: false
+    };
+  } else if (def.kind === "field") {
+    descriptor = {
+      configurable: true,
+      writable: true,
+      enumerable: true
+    };
+  }
+
+  var element = {
+    kind: def.kind === "field" ? "field" : "method",
+    key: key,
+    placement: def["static"] ? "static" : def.kind === "field" ? "own" : "prototype",
+    descriptor: descriptor
+  };
+  if (def.decorators) element.decorators = def.decorators;
+  if (def.kind === "field") element.initializer = def.value;
+  return element;
+}
+
+function _coalesceGetterSetter(element, other) {
+  if (element.descriptor.get !== undefined) {
+    other.descriptor.get = element.descriptor.get;
+  } else {
+    other.descriptor.set = element.descriptor.set;
+  }
+}
+
+function _coalesceClassElements(elements) {
+  var newElements = [];
+
+  var isSameElement = function isSameElement(other) {
+    return other.kind === "method" && other.key === element.key && other.placement === element.placement;
+  };
+
+  for (var i = 0; i < elements.length; i++) {
+    var element = elements[i];
+    var other;
+
+    if (element.kind === "method" && (other = newElements.find(isSameElement))) {
+      if (_isDataDescriptor(element.descriptor) || _isDataDescriptor(other.descriptor)) {
+        if (_hasDecorators(element) || _hasDecorators(other)) {
+          throw new ReferenceError("Duplicated methods (" + element.key + ") can't be decorated.");
+        }
+
+        other.descriptor = element.descriptor;
+      } else {
+        if (_hasDecorators(element)) {
+          if (_hasDecorators(other)) {
+            throw new ReferenceError("Decorators can't be placed on different accessors with for " + "the same property (" + element.key + ").");
+          }
+
+          other.decorators = element.decorators;
+        }
+
+        _coalesceGetterSetter(element, other);
+      }
+    } else {
+      newElements.push(element);
+    }
+  }
+
+  return newElements;
+}
+
+function _hasDecorators(element) {
+  return element.decorators && element.decorators.length;
+}
+
+function _isDataDescriptor(desc) {
+  return desc !== undefined && !(desc.value === undefined && desc.writable === undefined);
+}
+
+function _optionalCallableProperty(obj, name) {
+  var value = obj[name];
+
+  if (value !== undefined && typeof value !== "function") {
+    throw new TypeError("Expected '" + name + "' to be a function");
+  }
+
+  return value;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/defaults.js b/node_modules/@babel/runtime/helpers/esm/defaults.js
new file mode 100644
index 0000000..3de1d8e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/defaults.js
@@ -0,0 +1,14 @@
+export default function _defaults(obj, defaults) {
+  var keys = Object.getOwnPropertyNames(defaults);
+
+  for (var i = 0; i < keys.length; i++) {
+    var key = keys[i];
+    var value = Object.getOwnPropertyDescriptor(defaults, key);
+
+    if (value && value.configurable && obj[key] === undefined) {
+      Object.defineProperty(obj, key, value);
+    }
+  }
+
+  return obj;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/defineEnumerableProperties.js b/node_modules/@babel/runtime/helpers/esm/defineEnumerableProperties.js
new file mode 100644
index 0000000..7981acd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/defineEnumerableProperties.js
@@ -0,0 +1,22 @@
+export default function _defineEnumerableProperties(obj, descs) {
+  for (var key in descs) {
+    var desc = descs[key];
+    desc.configurable = desc.enumerable = true;
+    if ("value" in desc) desc.writable = true;
+    Object.defineProperty(obj, key, desc);
+  }
+
+  if (Object.getOwnPropertySymbols) {
+    var objectSymbols = Object.getOwnPropertySymbols(descs);
+
+    for (var i = 0; i < objectSymbols.length; i++) {
+      var sym = objectSymbols[i];
+      var desc = descs[sym];
+      desc.configurable = desc.enumerable = true;
+      if ("value" in desc) desc.writable = true;
+      Object.defineProperty(obj, sym, desc);
+    }
+  }
+
+  return obj;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/defineProperty.js b/node_modules/@babel/runtime/helpers/esm/defineProperty.js
new file mode 100644
index 0000000..7cf6e59
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/defineProperty.js
@@ -0,0 +1,14 @@
+export default function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+
+  return obj;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/extends.js b/node_modules/@babel/runtime/helpers/esm/extends.js
new file mode 100644
index 0000000..b9b138d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/extends.js
@@ -0,0 +1,17 @@
+export default function _extends() {
+  _extends = Object.assign || function (target) {
+    for (var i = 1; i < arguments.length; i++) {
+      var source = arguments[i];
+
+      for (var key in source) {
+        if (Object.prototype.hasOwnProperty.call(source, key)) {
+          target[key] = source[key];
+        }
+      }
+    }
+
+    return target;
+  };
+
+  return _extends.apply(this, arguments);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/get.js b/node_modules/@babel/runtime/helpers/esm/get.js
new file mode 100644
index 0000000..92038bd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/get.js
@@ -0,0 +1,20 @@
+import superPropBase from "./superPropBase.js";
+export default function _get() {
+  if (typeof Reflect !== "undefined" && Reflect.get) {
+    _get = Reflect.get;
+  } else {
+    _get = function _get(target, property, receiver) {
+      var base = superPropBase(target, property);
+      if (!base) return;
+      var desc = Object.getOwnPropertyDescriptor(base, property);
+
+      if (desc.get) {
+        return desc.get.call(arguments.length < 3 ? target : receiver);
+      }
+
+      return desc.value;
+    };
+  }
+
+  return _get.apply(this, arguments);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js b/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js
new file mode 100644
index 0000000..5abafe3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js
@@ -0,0 +1,6 @@
+export default function _getPrototypeOf(o) {
+  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {
+    return o.__proto__ || Object.getPrototypeOf(o);
+  };
+  return _getPrototypeOf(o);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/identity.js b/node_modules/@babel/runtime/helpers/esm/identity.js
new file mode 100644
index 0000000..a1e7e4c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/identity.js
@@ -0,0 +1,3 @@
+export default function _identity(x) {
+  return x;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/inherits.js b/node_modules/@babel/runtime/helpers/esm/inherits.js
new file mode 100644
index 0000000..e099909
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/inherits.js
@@ -0,0 +1,18 @@
+import setPrototypeOf from "./setPrototypeOf.js";
+export default function _inherits(subClass, superClass) {
+  if (typeof superClass !== "function" && superClass !== null) {
+    throw new TypeError("Super expression must either be null or a function");
+  }
+
+  subClass.prototype = Object.create(superClass && superClass.prototype, {
+    constructor: {
+      value: subClass,
+      writable: true,
+      configurable: true
+    }
+  });
+  Object.defineProperty(subClass, "prototype", {
+    writable: false
+  });
+  if (superClass) setPrototypeOf(subClass, superClass);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/inheritsLoose.js b/node_modules/@babel/runtime/helpers/esm/inheritsLoose.js
new file mode 100644
index 0000000..90bb796
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/inheritsLoose.js
@@ -0,0 +1,6 @@
+import setPrototypeOf from "./setPrototypeOf.js";
+export default function _inheritsLoose(subClass, superClass) {
+  subClass.prototype = Object.create(superClass.prototype);
+  subClass.prototype.constructor = subClass;
+  setPrototypeOf(subClass, superClass);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/initializerDefineProperty.js b/node_modules/@babel/runtime/helpers/esm/initializerDefineProperty.js
new file mode 100644
index 0000000..26fdea0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/initializerDefineProperty.js
@@ -0,0 +1,9 @@
+export default function _initializerDefineProperty(target, property, descriptor, context) {
+  if (!descriptor) return;
+  Object.defineProperty(target, property, {
+    enumerable: descriptor.enumerable,
+    configurable: descriptor.configurable,
+    writable: descriptor.writable,
+    value: descriptor.initializer ? descriptor.initializer.call(context) : void 0
+  });
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/initializerWarningHelper.js b/node_modules/@babel/runtime/helpers/esm/initializerWarningHelper.js
new file mode 100644
index 0000000..30d518c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/initializerWarningHelper.js
@@ -0,0 +1,3 @@
+export default function _initializerWarningHelper(descriptor, context) {
+  throw new Error('Decorating class property failed. Please ensure that ' + 'proposal-class-properties is enabled and runs after the decorators transform.');
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/instanceof.js b/node_modules/@babel/runtime/helpers/esm/instanceof.js
new file mode 100644
index 0000000..8c43b71
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/instanceof.js
@@ -0,0 +1,7 @@
+export default function _instanceof(left, right) {
+  if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
+    return !!right[Symbol.hasInstance](left);
+  } else {
+    return left instanceof right;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/interopRequireDefault.js b/node_modules/@babel/runtime/helpers/esm/interopRequireDefault.js
new file mode 100644
index 0000000..c2df7b6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/interopRequireDefault.js
@@ -0,0 +1,5 @@
+export default function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {
+    "default": obj
+  };
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/interopRequireWildcard.js b/node_modules/@babel/runtime/helpers/esm/interopRequireWildcard.js
new file mode 100644
index 0000000..01ee6b3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/interopRequireWildcard.js
@@ -0,0 +1,51 @@
+import _typeof from "./typeof.js";
+
+function _getRequireWildcardCache(nodeInterop) {
+  if (typeof WeakMap !== "function") return null;
+  var cacheBabelInterop = new WeakMap();
+  var cacheNodeInterop = new WeakMap();
+  return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) {
+    return nodeInterop ? cacheNodeInterop : cacheBabelInterop;
+  })(nodeInterop);
+}
+
+export default function _interopRequireWildcard(obj, nodeInterop) {
+  if (!nodeInterop && obj && obj.__esModule) {
+    return obj;
+  }
+
+  if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") {
+    return {
+      "default": obj
+    };
+  }
+
+  var cache = _getRequireWildcardCache(nodeInterop);
+
+  if (cache && cache.has(obj)) {
+    return cache.get(obj);
+  }
+
+  var newObj = {};
+  var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor;
+
+  for (var key in obj) {
+    if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) {
+      var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null;
+
+      if (desc && (desc.get || desc.set)) {
+        Object.defineProperty(newObj, key, desc);
+      } else {
+        newObj[key] = obj[key];
+      }
+    }
+  }
+
+  newObj["default"] = obj;
+
+  if (cache) {
+    cache.set(obj, newObj);
+  }
+
+  return newObj;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/isNativeFunction.js b/node_modules/@babel/runtime/helpers/esm/isNativeFunction.js
new file mode 100644
index 0000000..7b1bc82
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/isNativeFunction.js
@@ -0,0 +1,3 @@
+export default function _isNativeFunction(fn) {
+  return Function.toString.call(fn).indexOf("[native code]") !== -1;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/isNativeReflectConstruct.js b/node_modules/@babel/runtime/helpers/esm/isNativeReflectConstruct.js
new file mode 100644
index 0000000..0da1624
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/isNativeReflectConstruct.js
@@ -0,0 +1,12 @@
+export default function _isNativeReflectConstruct() {
+  if (typeof Reflect === "undefined" || !Reflect.construct) return false;
+  if (Reflect.construct.sham) return false;
+  if (typeof Proxy === "function") return true;
+
+  try {
+    Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
+    return true;
+  } catch (e) {
+    return false;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/iterableToArray.js b/node_modules/@babel/runtime/helpers/esm/iterableToArray.js
new file mode 100644
index 0000000..cfe9fbd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/iterableToArray.js
@@ -0,0 +1,3 @@
+export default function _iterableToArray(iter) {
+  if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js b/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js
new file mode 100644
index 0000000..c72ca94
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js
@@ -0,0 +1,29 @@
+export default function _iterableToArrayLimit(arr, i) {
+  var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
+
+  if (_i == null) return;
+  var _arr = [];
+  var _n = true;
+  var _d = false;
+
+  var _s, _e;
+
+  try {
+    for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {
+      _arr.push(_s.value);
+
+      if (i && _arr.length === i) break;
+    }
+  } catch (err) {
+    _d = true;
+    _e = err;
+  } finally {
+    try {
+      if (!_n && _i["return"] != null) _i["return"]();
+    } finally {
+      if (_d) throw _e;
+    }
+  }
+
+  return _arr;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimitLoose.js b/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimitLoose.js
new file mode 100644
index 0000000..27c15e0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimitLoose.js
@@ -0,0 +1,14 @@
+export default function _iterableToArrayLimitLoose(arr, i) {
+  var _i = arr && (typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"]);
+
+  if (_i == null) return;
+  var _arr = [];
+
+  for (_i = _i.call(arr), _step; !(_step = _i.next()).done;) {
+    _arr.push(_step.value);
+
+    if (i && _arr.length === i) break;
+  }
+
+  return _arr;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/jsx.js b/node_modules/@babel/runtime/helpers/esm/jsx.js
new file mode 100644
index 0000000..9a6a94c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/jsx.js
@@ -0,0 +1,26 @@
+var REACT_ELEMENT_TYPE;
+export default function _createRawReactElement(type, props, key, children) {
+  REACT_ELEMENT_TYPE || (REACT_ELEMENT_TYPE = "function" == typeof Symbol && Symbol["for"] && Symbol["for"]("react.element") || 60103);
+  var defaultProps = type && type.defaultProps,
+      childrenLength = arguments.length - 3;
+  if (props || 0 === childrenLength || (props = {
+    children: void 0
+  }), 1 === childrenLength) props.children = children;else if (childrenLength > 1) {
+    for (var childArray = new Array(childrenLength), i = 0; i < childrenLength; i++) {
+      childArray[i] = arguments[i + 3];
+    }
+
+    props.children = childArray;
+  }
+  if (props && defaultProps) for (var propName in defaultProps) {
+    void 0 === props[propName] && (props[propName] = defaultProps[propName]);
+  } else props || (props = defaultProps || {});
+  return {
+    $$typeof: REACT_ELEMENT_TYPE,
+    type: type,
+    key: void 0 === key ? null : "" + key,
+    ref: null,
+    props: props,
+    _owner: null
+  };
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/maybeArrayLike.js b/node_modules/@babel/runtime/helpers/esm/maybeArrayLike.js
new file mode 100644
index 0000000..f687959
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/maybeArrayLike.js
@@ -0,0 +1,9 @@
+import arrayLikeToArray from "./arrayLikeToArray.js";
+export default function _maybeArrayLike(next, arr, i) {
+  if (arr && !Array.isArray(arr) && typeof arr.length === "number") {
+    var len = arr.length;
+    return arrayLikeToArray(arr, i !== void 0 && i < len ? i : len);
+  }
+
+  return next(arr, i);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/newArrowCheck.js b/node_modules/@babel/runtime/helpers/esm/newArrowCheck.js
new file mode 100644
index 0000000..d6cd864
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/newArrowCheck.js
@@ -0,0 +1,5 @@
+export default function _newArrowCheck(innerThis, boundThis) {
+  if (innerThis !== boundThis) {
+    throw new TypeError("Cannot instantiate an arrow function");
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js b/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js
new file mode 100644
index 0000000..b349d00
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js
@@ -0,0 +1,3 @@
+export default function _nonIterableRest() {
+  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js b/node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js
new file mode 100644
index 0000000..82d8296
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js
@@ -0,0 +1,3 @@
+export default function _nonIterableSpread() {
+  throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectDestructuringEmpty.js b/node_modules/@babel/runtime/helpers/esm/objectDestructuringEmpty.js
new file mode 100644
index 0000000..82b67d2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectDestructuringEmpty.js
@@ -0,0 +1,3 @@
+export default function _objectDestructuringEmpty(obj) {
+  if (obj == null) throw new TypeError("Cannot destructure undefined");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectSpread.js b/node_modules/@babel/runtime/helpers/esm/objectSpread.js
new file mode 100644
index 0000000..889a5f0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectSpread.js
@@ -0,0 +1,19 @@
+import defineProperty from "./defineProperty.js";
+export default function _objectSpread(target) {
+  for (var i = 1; i < arguments.length; i++) {
+    var source = arguments[i] != null ? Object(arguments[i]) : {};
+    var ownKeys = Object.keys(source);
+
+    if (typeof Object.getOwnPropertySymbols === 'function') {
+      ownKeys.push.apply(ownKeys, Object.getOwnPropertySymbols(source).filter(function (sym) {
+        return Object.getOwnPropertyDescriptor(source, sym).enumerable;
+      }));
+    }
+
+    ownKeys.forEach(function (key) {
+      defineProperty(target, key, source[key]);
+    });
+  }
+
+  return target;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectSpread2.js b/node_modules/@babel/runtime/helpers/esm/objectSpread2.js
new file mode 100644
index 0000000..76f2968
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectSpread2.js
@@ -0,0 +1,27 @@
+import defineProperty from "./defineProperty.js";
+
+function ownKeys(object, enumerableOnly) {
+  var keys = Object.keys(object);
+
+  if (Object.getOwnPropertySymbols) {
+    var symbols = Object.getOwnPropertySymbols(object);
+    enumerableOnly && (symbols = symbols.filter(function (sym) {
+      return Object.getOwnPropertyDescriptor(object, sym).enumerable;
+    })), keys.push.apply(keys, symbols);
+  }
+
+  return keys;
+}
+
+export default function _objectSpread2(target) {
+  for (var i = 1; i < arguments.length; i++) {
+    var source = null != arguments[i] ? arguments[i] : {};
+    i % 2 ? ownKeys(Object(source), !0).forEach(function (key) {
+      defineProperty(target, key, source[key]);
+    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) {
+      Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));
+    });
+  }
+
+  return target;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js b/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js
new file mode 100644
index 0000000..0fef321
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js
@@ -0,0 +1,19 @@
+import objectWithoutPropertiesLoose from "./objectWithoutPropertiesLoose.js";
+export default function _objectWithoutProperties(source, excluded) {
+  if (source == null) return {};
+  var target = objectWithoutPropertiesLoose(source, excluded);
+  var key, i;
+
+  if (Object.getOwnPropertySymbols) {
+    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
+
+    for (i = 0; i < sourceSymbolKeys.length; i++) {
+      key = sourceSymbolKeys[i];
+      if (excluded.indexOf(key) >= 0) continue;
+      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
+      target[key] = source[key];
+    }
+  }
+
+  return target;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js b/node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js
new file mode 100644
index 0000000..c36815c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js
@@ -0,0 +1,14 @@
+export default function _objectWithoutPropertiesLoose(source, excluded) {
+  if (source == null) return {};
+  var target = {};
+  var sourceKeys = Object.keys(source);
+  var key, i;
+
+  for (i = 0; i < sourceKeys.length; i++) {
+    key = sourceKeys[i];
+    if (excluded.indexOf(key) >= 0) continue;
+    target[key] = source[key];
+  }
+
+  return target;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/package.json b/node_modules/@babel/runtime/helpers/esm/package.json
new file mode 100644
index 0000000..aead43d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "module"
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js b/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js
new file mode 100644
index 0000000..56d5544
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js
@@ -0,0 +1,11 @@
+import _typeof from "./typeof.js";
+import assertThisInitialized from "./assertThisInitialized.js";
+export default function _possibleConstructorReturn(self, call) {
+  if (call && (_typeof(call) === "object" || typeof call === "function")) {
+    return call;
+  } else if (call !== void 0) {
+    throw new TypeError("Derived constructors may only return object or undefined");
+  }
+
+  return assertThisInitialized(self);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/readOnlyError.js b/node_modules/@babel/runtime/helpers/esm/readOnlyError.js
new file mode 100644
index 0000000..166e40e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/readOnlyError.js
@@ -0,0 +1,3 @@
+export default function _readOnlyError(name) {
+  throw new TypeError("\"" + name + "\" is read-only");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/set.js b/node_modules/@babel/runtime/helpers/esm/set.js
new file mode 100644
index 0000000..9c54773
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/set.js
@@ -0,0 +1,51 @@
+import superPropBase from "./superPropBase.js";
+import defineProperty from "./defineProperty.js";
+
+function set(target, property, value, receiver) {
+  if (typeof Reflect !== "undefined" && Reflect.set) {
+    set = Reflect.set;
+  } else {
+    set = function set(target, property, value, receiver) {
+      var base = superPropBase(target, property);
+      var desc;
+
+      if (base) {
+        desc = Object.getOwnPropertyDescriptor(base, property);
+
+        if (desc.set) {
+          desc.set.call(receiver, value);
+          return true;
+        } else if (!desc.writable) {
+          return false;
+        }
+      }
+
+      desc = Object.getOwnPropertyDescriptor(receiver, property);
+
+      if (desc) {
+        if (!desc.writable) {
+          return false;
+        }
+
+        desc.value = value;
+        Object.defineProperty(receiver, property, desc);
+      } else {
+        defineProperty(receiver, property, value);
+      }
+
+      return true;
+    };
+  }
+
+  return set(target, property, value, receiver);
+}
+
+export default function _set(target, property, value, receiver, isStrict) {
+  var s = set(target, property, value, receiver || target);
+
+  if (!s && isStrict) {
+    throw new Error('failed to set property');
+  }
+
+  return value;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js b/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js
new file mode 100644
index 0000000..e6ef03e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js
@@ -0,0 +1,8 @@
+export default function _setPrototypeOf(o, p) {
+  _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {
+    o.__proto__ = p;
+    return o;
+  };
+
+  return _setPrototypeOf(o, p);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/skipFirstGeneratorNext.js b/node_modules/@babel/runtime/helpers/esm/skipFirstGeneratorNext.js
new file mode 100644
index 0000000..cadd9bb
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/skipFirstGeneratorNext.js
@@ -0,0 +1,7 @@
+export default function _skipFirstGeneratorNext(fn) {
+  return function () {
+    var it = fn.apply(this, arguments);
+    it.next();
+    return it;
+  };
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/slicedToArray.js b/node_modules/@babel/runtime/helpers/esm/slicedToArray.js
new file mode 100644
index 0000000..618200b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/slicedToArray.js
@@ -0,0 +1,7 @@
+import arrayWithHoles from "./arrayWithHoles.js";
+import iterableToArrayLimit from "./iterableToArrayLimit.js";
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+import nonIterableRest from "./nonIterableRest.js";
+export default function _slicedToArray(arr, i) {
+  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/slicedToArrayLoose.js b/node_modules/@babel/runtime/helpers/esm/slicedToArrayLoose.js
new file mode 100644
index 0000000..efc7429
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/slicedToArrayLoose.js
@@ -0,0 +1,7 @@
+import arrayWithHoles from "./arrayWithHoles.js";
+import iterableToArrayLimitLoose from "./iterableToArrayLimitLoose.js";
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+import nonIterableRest from "./nonIterableRest.js";
+export default function _slicedToArrayLoose(arr, i) {
+  return arrayWithHoles(arr) || iterableToArrayLimitLoose(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/superPropBase.js b/node_modules/@babel/runtime/helpers/esm/superPropBase.js
new file mode 100644
index 0000000..feffe6f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/superPropBase.js
@@ -0,0 +1,9 @@
+import getPrototypeOf from "./getPrototypeOf.js";
+export default function _superPropBase(object, property) {
+  while (!Object.prototype.hasOwnProperty.call(object, property)) {
+    object = getPrototypeOf(object);
+    if (object === null) break;
+  }
+
+  return object;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js
new file mode 100644
index 0000000..421f18a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js
@@ -0,0 +1,11 @@
+export default function _taggedTemplateLiteral(strings, raw) {
+  if (!raw) {
+    raw = strings.slice(0);
+  }
+
+  return Object.freeze(Object.defineProperties(strings, {
+    raw: {
+      value: Object.freeze(raw)
+    }
+  }));
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteralLoose.js b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteralLoose.js
new file mode 100644
index 0000000..c8f081e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteralLoose.js
@@ -0,0 +1,8 @@
+export default function _taggedTemplateLiteralLoose(strings, raw) {
+  if (!raw) {
+    raw = strings.slice(0);
+  }
+
+  strings.raw = raw;
+  return strings;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/tdz.js b/node_modules/@babel/runtime/helpers/esm/tdz.js
new file mode 100644
index 0000000..d5d0adc
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/tdz.js
@@ -0,0 +1,3 @@
+export default function _tdzError(name) {
+  throw new ReferenceError(name + " is not defined - temporal dead zone");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/temporalRef.js b/node_modules/@babel/runtime/helpers/esm/temporalRef.js
new file mode 100644
index 0000000..b25f7c4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/temporalRef.js
@@ -0,0 +1,5 @@
+import undef from "./temporalUndefined.js";
+import err from "./tdz.js";
+export default function _temporalRef(val, name) {
+  return val === undef ? err(name) : val;
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/temporalUndefined.js b/node_modules/@babel/runtime/helpers/esm/temporalUndefined.js
new file mode 100644
index 0000000..1a35717
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/temporalUndefined.js
@@ -0,0 +1 @@
+export default function _temporalUndefined() {}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toArray.js b/node_modules/@babel/runtime/helpers/esm/toArray.js
new file mode 100644
index 0000000..ad7c871
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toArray.js
@@ -0,0 +1,7 @@
+import arrayWithHoles from "./arrayWithHoles.js";
+import iterableToArray from "./iterableToArray.js";
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+import nonIterableRest from "./nonIterableRest.js";
+export default function _toArray(arr) {
+  return arrayWithHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableRest();
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toConsumableArray.js b/node_modules/@babel/runtime/helpers/esm/toConsumableArray.js
new file mode 100644
index 0000000..bd91285
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toConsumableArray.js
@@ -0,0 +1,7 @@
+import arrayWithoutHoles from "./arrayWithoutHoles.js";
+import iterableToArray from "./iterableToArray.js";
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+import nonIterableSpread from "./nonIterableSpread.js";
+export default function _toConsumableArray(arr) {
+  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toPrimitive.js b/node_modules/@babel/runtime/helpers/esm/toPrimitive.js
new file mode 100644
index 0000000..fa32dda
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toPrimitive.js
@@ -0,0 +1,13 @@
+import _typeof from "./typeof.js";
+export default function _toPrimitive(input, hint) {
+  if (_typeof(input) !== "object" || input === null) return input;
+  var prim = input[Symbol.toPrimitive];
+
+  if (prim !== undefined) {
+    var res = prim.call(input, hint || "default");
+    if (_typeof(res) !== "object") return res;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+
+  return (hint === "string" ? String : Number)(input);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js b/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js
new file mode 100644
index 0000000..0fcc93b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js
@@ -0,0 +1,6 @@
+import _typeof from "./typeof.js";
+import toPrimitive from "./toPrimitive.js";
+export default function _toPropertyKey(arg) {
+  var key = toPrimitive(arg, "string");
+  return _typeof(key) === "symbol" ? key : String(key);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/typeof.js b/node_modules/@babel/runtime/helpers/esm/typeof.js
new file mode 100644
index 0000000..92100c6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/typeof.js
@@ -0,0 +1,9 @@
+export default function _typeof(obj) {
+  "@babel/helpers - typeof";
+
+  return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
+    return typeof obj;
+  } : function (obj) {
+    return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+  }, _typeof(obj);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js b/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js
new file mode 100644
index 0000000..c0f63bd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js
@@ -0,0 +1,9 @@
+import arrayLikeToArray from "./arrayLikeToArray.js";
+export default function _unsupportedIterableToArray(o, minLen) {
+  if (!o) return;
+  if (typeof o === "string") return arrayLikeToArray(o, minLen);
+  var n = Object.prototype.toString.call(o).slice(8, -1);
+  if (n === "Object" && o.constructor) n = o.constructor.name;
+  if (n === "Map" || n === "Set") return Array.from(o);
+  if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/wrapAsyncGenerator.js b/node_modules/@babel/runtime/helpers/esm/wrapAsyncGenerator.js
new file mode 100644
index 0000000..723b2dd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/wrapAsyncGenerator.js
@@ -0,0 +1,6 @@
+import AsyncGenerator from "./AsyncGenerator.js";
+export default function _wrapAsyncGenerator(fn) {
+  return function () {
+    return new AsyncGenerator(fn.apply(this, arguments));
+  };
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper.js b/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper.js
new file mode 100644
index 0000000..512630d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper.js
@@ -0,0 +1,37 @@
+import getPrototypeOf from "./getPrototypeOf.js";
+import setPrototypeOf from "./setPrototypeOf.js";
+import isNativeFunction from "./isNativeFunction.js";
+import construct from "./construct.js";
+export default function _wrapNativeSuper(Class) {
+  var _cache = typeof Map === "function" ? new Map() : undefined;
+
+  _wrapNativeSuper = function _wrapNativeSuper(Class) {
+    if (Class === null || !isNativeFunction(Class)) return Class;
+
+    if (typeof Class !== "function") {
+      throw new TypeError("Super expression must either be null or a function");
+    }
+
+    if (typeof _cache !== "undefined") {
+      if (_cache.has(Class)) return _cache.get(Class);
+
+      _cache.set(Class, Wrapper);
+    }
+
+    function Wrapper() {
+      return construct(Class, arguments, getPrototypeOf(this).constructor);
+    }
+
+    Wrapper.prototype = Object.create(Class.prototype, {
+      constructor: {
+        value: Wrapper,
+        enumerable: false,
+        writable: true,
+        configurable: true
+      }
+    });
+    return setPrototypeOf(Wrapper, Class);
+  };
+
+  return _wrapNativeSuper(Class);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/wrapRegExp.js b/node_modules/@babel/runtime/helpers/esm/wrapRegExp.js
new file mode 100644
index 0000000..beac1e1
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/wrapRegExp.js
@@ -0,0 +1,50 @@
+import _typeof from "./typeof.js";
+import setPrototypeOf from "./setPrototypeOf.js";
+import inherits from "./inherits.js";
+export default function _wrapRegExp() {
+  _wrapRegExp = function _wrapRegExp(re, groups) {
+    return new BabelRegExp(re, void 0, groups);
+  };
+
+  var _super = RegExp.prototype,
+      _groups = new WeakMap();
+
+  function BabelRegExp(re, flags, groups) {
+    var _this = new RegExp(re, flags);
+
+    return _groups.set(_this, groups || _groups.get(re)), setPrototypeOf(_this, BabelRegExp.prototype);
+  }
+
+  function buildGroups(result, re) {
+    var g = _groups.get(re);
+
+    return Object.keys(g).reduce(function (groups, name) {
+      return groups[name] = result[g[name]], groups;
+    }, Object.create(null));
+  }
+
+  return inherits(BabelRegExp, RegExp), BabelRegExp.prototype.exec = function (str) {
+    var result = _super.exec.call(this, str);
+
+    return result && (result.groups = buildGroups(result, this)), result;
+  }, BabelRegExp.prototype[Symbol.replace] = function (str, substitution) {
+    if ("string" == typeof substitution) {
+      var groups = _groups.get(this);
+
+      return _super[Symbol.replace].call(this, str, substitution.replace(/\$<([^>]+)>/g, function (_, name) {
+        return "$" + groups[name];
+      }));
+    }
+
+    if ("function" == typeof substitution) {
+      var _this = this;
+
+      return _super[Symbol.replace].call(this, str, function () {
+        var args = arguments;
+        return "object" != _typeof(args[args.length - 1]) && (args = [].slice.call(args)).push(buildGroups(args, _this)), substitution.apply(this, args);
+      });
+    }
+
+    return _super[Symbol.replace].call(this, str, substitution);
+  }, _wrapRegExp.apply(this, arguments);
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/writeOnlyError.js b/node_modules/@babel/runtime/helpers/esm/writeOnlyError.js
new file mode 100644
index 0000000..9170bd4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/writeOnlyError.js
@@ -0,0 +1,3 @@
+export default function _writeOnlyError(name) {
+  throw new TypeError("\"" + name + "\" is write-only");
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/extends.js b/node_modules/@babel/runtime/helpers/extends.js
new file mode 100644
index 0000000..e8509df
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/extends.js
@@ -0,0 +1,18 @@
+function _extends() {
+  module.exports = _extends = Object.assign || function (target) {
+    for (var i = 1; i < arguments.length; i++) {
+      var source = arguments[i];
+
+      for (var key in source) {
+        if (Object.prototype.hasOwnProperty.call(source, key)) {
+          target[key] = source[key];
+        }
+      }
+    }
+
+    return target;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  return _extends.apply(this, arguments);
+}
+
+module.exports = _extends, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/get.js b/node_modules/@babel/runtime/helpers/get.js
new file mode 100644
index 0000000..7ddd81b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/get.js
@@ -0,0 +1,23 @@
+var superPropBase = require("./superPropBase.js");
+
+function _get() {
+  if (typeof Reflect !== "undefined" && Reflect.get) {
+    module.exports = _get = Reflect.get, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  } else {
+    module.exports = _get = function _get(target, property, receiver) {
+      var base = superPropBase(target, property);
+      if (!base) return;
+      var desc = Object.getOwnPropertyDescriptor(base, property);
+
+      if (desc.get) {
+        return desc.get.call(arguments.length < 3 ? target : receiver);
+      }
+
+      return desc.value;
+    }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  }
+
+  return _get.apply(this, arguments);
+}
+
+module.exports = _get, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/getPrototypeOf.js b/node_modules/@babel/runtime/helpers/getPrototypeOf.js
new file mode 100644
index 0000000..02da563
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/getPrototypeOf.js
@@ -0,0 +1,8 @@
+function _getPrototypeOf(o) {
+  module.exports = _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {
+    return o.__proto__ || Object.getPrototypeOf(o);
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  return _getPrototypeOf(o);
+}
+
+module.exports = _getPrototypeOf, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/identity.js b/node_modules/@babel/runtime/helpers/identity.js
new file mode 100644
index 0000000..3d00062
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/identity.js
@@ -0,0 +1,5 @@
+function _identity(x) {
+  return x;
+}
+
+module.exports = _identity, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/inherits.js b/node_modules/@babel/runtime/helpers/inherits.js
new file mode 100644
index 0000000..0b10f28
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/inherits.js
@@ -0,0 +1,21 @@
+var setPrototypeOf = require("./setPrototypeOf.js");
+
+function _inherits(subClass, superClass) {
+  if (typeof superClass !== "function" && superClass !== null) {
+    throw new TypeError("Super expression must either be null or a function");
+  }
+
+  subClass.prototype = Object.create(superClass && superClass.prototype, {
+    constructor: {
+      value: subClass,
+      writable: true,
+      configurable: true
+    }
+  });
+  Object.defineProperty(subClass, "prototype", {
+    writable: false
+  });
+  if (superClass) setPrototypeOf(subClass, superClass);
+}
+
+module.exports = _inherits, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/inheritsLoose.js b/node_modules/@babel/runtime/helpers/inheritsLoose.js
new file mode 100644
index 0000000..df6de46
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/inheritsLoose.js
@@ -0,0 +1,9 @@
+var setPrototypeOf = require("./setPrototypeOf.js");
+
+function _inheritsLoose(subClass, superClass) {
+  subClass.prototype = Object.create(superClass.prototype);
+  subClass.prototype.constructor = subClass;
+  setPrototypeOf(subClass, superClass);
+}
+
+module.exports = _inheritsLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/initializerDefineProperty.js b/node_modules/@babel/runtime/helpers/initializerDefineProperty.js
new file mode 100644
index 0000000..5a595a7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/initializerDefineProperty.js
@@ -0,0 +1,11 @@
+function _initializerDefineProperty(target, property, descriptor, context) {
+  if (!descriptor) return;
+  Object.defineProperty(target, property, {
+    enumerable: descriptor.enumerable,
+    configurable: descriptor.configurable,
+    writable: descriptor.writable,
+    value: descriptor.initializer ? descriptor.initializer.call(context) : void 0
+  });
+}
+
+module.exports = _initializerDefineProperty, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/initializerWarningHelper.js b/node_modules/@babel/runtime/helpers/initializerWarningHelper.js
new file mode 100644
index 0000000..001d8a3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/initializerWarningHelper.js
@@ -0,0 +1,5 @@
+function _initializerWarningHelper(descriptor, context) {
+  throw new Error('Decorating class property failed. Please ensure that ' + 'proposal-class-properties is enabled and runs after the decorators transform.');
+}
+
+module.exports = _initializerWarningHelper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/instanceof.js b/node_modules/@babel/runtime/helpers/instanceof.js
new file mode 100644
index 0000000..08eea81
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/instanceof.js
@@ -0,0 +1,9 @@
+function _instanceof(left, right) {
+  if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
+    return !!right[Symbol.hasInstance](left);
+  } else {
+    return left instanceof right;
+  }
+}
+
+module.exports = _instanceof, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/interopRequireDefault.js b/node_modules/@babel/runtime/helpers/interopRequireDefault.js
new file mode 100644
index 0000000..5faa0e4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/interopRequireDefault.js
@@ -0,0 +1,7 @@
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {
+    "default": obj
+  };
+}
+
+module.exports = _interopRequireDefault, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/interopRequireWildcard.js b/node_modules/@babel/runtime/helpers/interopRequireWildcard.js
new file mode 100644
index 0000000..0f8ffbf
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/interopRequireWildcard.js
@@ -0,0 +1,53 @@
+var _typeof = require("./typeof.js")["default"];
+
+function _getRequireWildcardCache(nodeInterop) {
+  if (typeof WeakMap !== "function") return null;
+  var cacheBabelInterop = new WeakMap();
+  var cacheNodeInterop = new WeakMap();
+  return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) {
+    return nodeInterop ? cacheNodeInterop : cacheBabelInterop;
+  })(nodeInterop);
+}
+
+function _interopRequireWildcard(obj, nodeInterop) {
+  if (!nodeInterop && obj && obj.__esModule) {
+    return obj;
+  }
+
+  if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") {
+    return {
+      "default": obj
+    };
+  }
+
+  var cache = _getRequireWildcardCache(nodeInterop);
+
+  if (cache && cache.has(obj)) {
+    return cache.get(obj);
+  }
+
+  var newObj = {};
+  var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor;
+
+  for (var key in obj) {
+    if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) {
+      var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null;
+
+      if (desc && (desc.get || desc.set)) {
+        Object.defineProperty(newObj, key, desc);
+      } else {
+        newObj[key] = obj[key];
+      }
+    }
+  }
+
+  newObj["default"] = obj;
+
+  if (cache) {
+    cache.set(obj, newObj);
+  }
+
+  return newObj;
+}
+
+module.exports = _interopRequireWildcard, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/isNativeFunction.js b/node_modules/@babel/runtime/helpers/isNativeFunction.js
new file mode 100644
index 0000000..5c3d98f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/isNativeFunction.js
@@ -0,0 +1,5 @@
+function _isNativeFunction(fn) {
+  return Function.toString.call(fn).indexOf("[native code]") !== -1;
+}
+
+module.exports = _isNativeFunction, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js b/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js
new file mode 100644
index 0000000..f07899d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js
@@ -0,0 +1,14 @@
+function _isNativeReflectConstruct() {
+  if (typeof Reflect === "undefined" || !Reflect.construct) return false;
+  if (Reflect.construct.sham) return false;
+  if (typeof Proxy === "function") return true;
+
+  try {
+    Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
+    return true;
+  } catch (e) {
+    return false;
+  }
+}
+
+module.exports = _isNativeReflectConstruct, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/iterableToArray.js b/node_modules/@babel/runtime/helpers/iterableToArray.js
new file mode 100644
index 0000000..5b9038a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/iterableToArray.js
@@ -0,0 +1,5 @@
+function _iterableToArray(iter) {
+  if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+
+module.exports = _iterableToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js b/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js
new file mode 100644
index 0000000..8d01fb3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js
@@ -0,0 +1,31 @@
+function _iterableToArrayLimit(arr, i) {
+  var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
+
+  if (_i == null) return;
+  var _arr = [];
+  var _n = true;
+  var _d = false;
+
+  var _s, _e;
+
+  try {
+    for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {
+      _arr.push(_s.value);
+
+      if (i && _arr.length === i) break;
+    }
+  } catch (err) {
+    _d = true;
+    _e = err;
+  } finally {
+    try {
+      if (!_n && _i["return"] != null) _i["return"]();
+    } finally {
+      if (_d) throw _e;
+    }
+  }
+
+  return _arr;
+}
+
+module.exports = _iterableToArrayLimit, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/iterableToArrayLimitLoose.js b/node_modules/@babel/runtime/helpers/iterableToArrayLimitLoose.js
new file mode 100644
index 0000000..bca5452
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/iterableToArrayLimitLoose.js
@@ -0,0 +1,16 @@
+function _iterableToArrayLimitLoose(arr, i) {
+  var _i = arr && (typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"]);
+
+  if (_i == null) return;
+  var _arr = [];
+
+  for (_i = _i.call(arr), _step; !(_step = _i.next()).done;) {
+    _arr.push(_step.value);
+
+    if (i && _arr.length === i) break;
+  }
+
+  return _arr;
+}
+
+module.exports = _iterableToArrayLimitLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/jsx.js b/node_modules/@babel/runtime/helpers/jsx.js
new file mode 100644
index 0000000..bc19ec4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/jsx.js
@@ -0,0 +1,29 @@
+var REACT_ELEMENT_TYPE;
+
+function _createRawReactElement(type, props, key, children) {
+  REACT_ELEMENT_TYPE || (REACT_ELEMENT_TYPE = "function" == typeof Symbol && Symbol["for"] && Symbol["for"]("react.element") || 60103);
+  var defaultProps = type && type.defaultProps,
+      childrenLength = arguments.length - 3;
+  if (props || 0 === childrenLength || (props = {
+    children: void 0
+  }), 1 === childrenLength) props.children = children;else if (childrenLength > 1) {
+    for (var childArray = new Array(childrenLength), i = 0; i < childrenLength; i++) {
+      childArray[i] = arguments[i + 3];
+    }
+
+    props.children = childArray;
+  }
+  if (props && defaultProps) for (var propName in defaultProps) {
+    void 0 === props[propName] && (props[propName] = defaultProps[propName]);
+  } else props || (props = defaultProps || {});
+  return {
+    $$typeof: REACT_ELEMENT_TYPE,
+    type: type,
+    key: void 0 === key ? null : "" + key,
+    ref: null,
+    props: props,
+    _owner: null
+  };
+}
+
+module.exports = _createRawReactElement, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/maybeArrayLike.js b/node_modules/@babel/runtime/helpers/maybeArrayLike.js
new file mode 100644
index 0000000..212d68c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/maybeArrayLike.js
@@ -0,0 +1,12 @@
+var arrayLikeToArray = require("./arrayLikeToArray.js");
+
+function _maybeArrayLike(next, arr, i) {
+  if (arr && !Array.isArray(arr) && typeof arr.length === "number") {
+    var len = arr.length;
+    return arrayLikeToArray(arr, i !== void 0 && i < len ? i : len);
+  }
+
+  return next(arr, i);
+}
+
+module.exports = _maybeArrayLike, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/newArrowCheck.js b/node_modules/@babel/runtime/helpers/newArrowCheck.js
new file mode 100644
index 0000000..86a91f2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/newArrowCheck.js
@@ -0,0 +1,7 @@
+function _newArrowCheck(innerThis, boundThis) {
+  if (innerThis !== boundThis) {
+    throw new TypeError("Cannot instantiate an arrow function");
+  }
+}
+
+module.exports = _newArrowCheck, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/nonIterableRest.js b/node_modules/@babel/runtime/helpers/nonIterableRest.js
new file mode 100644
index 0000000..e791108
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/nonIterableRest.js
@@ -0,0 +1,5 @@
+function _nonIterableRest() {
+  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+
+module.exports = _nonIterableRest, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/nonIterableSpread.js b/node_modules/@babel/runtime/helpers/nonIterableSpread.js
new file mode 100644
index 0000000..64379ea
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/nonIterableSpread.js
@@ -0,0 +1,5 @@
+function _nonIterableSpread() {
+  throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+
+module.exports = _nonIterableSpread, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectDestructuringEmpty.js b/node_modules/@babel/runtime/helpers/objectDestructuringEmpty.js
new file mode 100644
index 0000000..cb0866e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectDestructuringEmpty.js
@@ -0,0 +1,5 @@
+function _objectDestructuringEmpty(obj) {
+  if (obj == null) throw new TypeError("Cannot destructure undefined");
+}
+
+module.exports = _objectDestructuringEmpty, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectSpread.js b/node_modules/@babel/runtime/helpers/objectSpread.js
new file mode 100644
index 0000000..cfb4309
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectSpread.js
@@ -0,0 +1,22 @@
+var defineProperty = require("./defineProperty.js");
+
+function _objectSpread(target) {
+  for (var i = 1; i < arguments.length; i++) {
+    var source = arguments[i] != null ? Object(arguments[i]) : {};
+    var ownKeys = Object.keys(source);
+
+    if (typeof Object.getOwnPropertySymbols === 'function') {
+      ownKeys.push.apply(ownKeys, Object.getOwnPropertySymbols(source).filter(function (sym) {
+        return Object.getOwnPropertyDescriptor(source, sym).enumerable;
+      }));
+    }
+
+    ownKeys.forEach(function (key) {
+      defineProperty(target, key, source[key]);
+    });
+  }
+
+  return target;
+}
+
+module.exports = _objectSpread, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectSpread2.js b/node_modules/@babel/runtime/helpers/objectSpread2.js
new file mode 100644
index 0000000..7e5db07
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectSpread2.js
@@ -0,0 +1,29 @@
+var defineProperty = require("./defineProperty.js");
+
+function ownKeys(object, enumerableOnly) {
+  var keys = Object.keys(object);
+
+  if (Object.getOwnPropertySymbols) {
+    var symbols = Object.getOwnPropertySymbols(object);
+    enumerableOnly && (symbols = symbols.filter(function (sym) {
+      return Object.getOwnPropertyDescriptor(object, sym).enumerable;
+    })), keys.push.apply(keys, symbols);
+  }
+
+  return keys;
+}
+
+function _objectSpread2(target) {
+  for (var i = 1; i < arguments.length; i++) {
+    var source = null != arguments[i] ? arguments[i] : {};
+    i % 2 ? ownKeys(Object(source), !0).forEach(function (key) {
+      defineProperty(target, key, source[key]);
+    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) {
+      Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));
+    });
+  }
+
+  return target;
+}
+
+module.exports = _objectSpread2, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectWithoutProperties.js b/node_modules/@babel/runtime/helpers/objectWithoutProperties.js
new file mode 100644
index 0000000..8cf3ab8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectWithoutProperties.js
@@ -0,0 +1,22 @@
+var objectWithoutPropertiesLoose = require("./objectWithoutPropertiesLoose.js");
+
+function _objectWithoutProperties(source, excluded) {
+  if (source == null) return {};
+  var target = objectWithoutPropertiesLoose(source, excluded);
+  var key, i;
+
+  if (Object.getOwnPropertySymbols) {
+    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
+
+    for (i = 0; i < sourceSymbolKeys.length; i++) {
+      key = sourceSymbolKeys[i];
+      if (excluded.indexOf(key) >= 0) continue;
+      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
+      target[key] = source[key];
+    }
+  }
+
+  return target;
+}
+
+module.exports = _objectWithoutProperties, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectWithoutPropertiesLoose.js b/node_modules/@babel/runtime/helpers/objectWithoutPropertiesLoose.js
new file mode 100644
index 0000000..44d5771
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectWithoutPropertiesLoose.js
@@ -0,0 +1,16 @@
+function _objectWithoutPropertiesLoose(source, excluded) {
+  if (source == null) return {};
+  var target = {};
+  var sourceKeys = Object.keys(source);
+  var key, i;
+
+  for (i = 0; i < sourceKeys.length; i++) {
+    key = sourceKeys[i];
+    if (excluded.indexOf(key) >= 0) continue;
+    target[key] = source[key];
+  }
+
+  return target;
+}
+
+module.exports = _objectWithoutPropertiesLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js b/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js
new file mode 100644
index 0000000..e1997be
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js
@@ -0,0 +1,15 @@
+var _typeof = require("./typeof.js")["default"];
+
+var assertThisInitialized = require("./assertThisInitialized.js");
+
+function _possibleConstructorReturn(self, call) {
+  if (call && (_typeof(call) === "object" || typeof call === "function")) {
+    return call;
+  } else if (call !== void 0) {
+    throw new TypeError("Derived constructors may only return object or undefined");
+  }
+
+  return assertThisInitialized(self);
+}
+
+module.exports = _possibleConstructorReturn, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/readOnlyError.js b/node_modules/@babel/runtime/helpers/readOnlyError.js
new file mode 100644
index 0000000..93cb90c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/readOnlyError.js
@@ -0,0 +1,5 @@
+function _readOnlyError(name) {
+  throw new TypeError("\"" + name + "\" is read-only");
+}
+
+module.exports = _readOnlyError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/set.js b/node_modules/@babel/runtime/helpers/set.js
new file mode 100644
index 0000000..6438def
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/set.js
@@ -0,0 +1,54 @@
+var superPropBase = require("./superPropBase.js");
+
+var defineProperty = require("./defineProperty.js");
+
+function set(target, property, value, receiver) {
+  if (typeof Reflect !== "undefined" && Reflect.set) {
+    set = Reflect.set;
+  } else {
+    set = function set(target, property, value, receiver) {
+      var base = superPropBase(target, property);
+      var desc;
+
+      if (base) {
+        desc = Object.getOwnPropertyDescriptor(base, property);
+
+        if (desc.set) {
+          desc.set.call(receiver, value);
+          return true;
+        } else if (!desc.writable) {
+          return false;
+        }
+      }
+
+      desc = Object.getOwnPropertyDescriptor(receiver, property);
+
+      if (desc) {
+        if (!desc.writable) {
+          return false;
+        }
+
+        desc.value = value;
+        Object.defineProperty(receiver, property, desc);
+      } else {
+        defineProperty(receiver, property, value);
+      }
+
+      return true;
+    };
+  }
+
+  return set(target, property, value, receiver);
+}
+
+function _set(target, property, value, receiver, isStrict) {
+  var s = set(target, property, value, receiver || target);
+
+  if (!s && isStrict) {
+    throw new Error('failed to set property');
+  }
+
+  return value;
+}
+
+module.exports = _set, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/setPrototypeOf.js b/node_modules/@babel/runtime/helpers/setPrototypeOf.js
new file mode 100644
index 0000000..7efecad
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/setPrototypeOf.js
@@ -0,0 +1,9 @@
+function _setPrototypeOf(o, p) {
+  module.exports = _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {
+    o.__proto__ = p;
+    return o;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  return _setPrototypeOf(o, p);
+}
+
+module.exports = _setPrototypeOf, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/skipFirstGeneratorNext.js b/node_modules/@babel/runtime/helpers/skipFirstGeneratorNext.js
new file mode 100644
index 0000000..8890896
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/skipFirstGeneratorNext.js
@@ -0,0 +1,9 @@
+function _skipFirstGeneratorNext(fn) {
+  return function () {
+    var it = fn.apply(this, arguments);
+    it.next();
+    return it;
+  };
+}
+
+module.exports = _skipFirstGeneratorNext, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/slicedToArray.js b/node_modules/@babel/runtime/helpers/slicedToArray.js
new file mode 100644
index 0000000..bce5fc0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/slicedToArray.js
@@ -0,0 +1,13 @@
+var arrayWithHoles = require("./arrayWithHoles.js");
+
+var iterableToArrayLimit = require("./iterableToArrayLimit.js");
+
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+
+var nonIterableRest = require("./nonIterableRest.js");
+
+function _slicedToArray(arr, i) {
+  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();
+}
+
+module.exports = _slicedToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/slicedToArrayLoose.js b/node_modules/@babel/runtime/helpers/slicedToArrayLoose.js
new file mode 100644
index 0000000..cc9ace2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/slicedToArrayLoose.js
@@ -0,0 +1,13 @@
+var arrayWithHoles = require("./arrayWithHoles.js");
+
+var iterableToArrayLimitLoose = require("./iterableToArrayLimitLoose.js");
+
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+
+var nonIterableRest = require("./nonIterableRest.js");
+
+function _slicedToArrayLoose(arr, i) {
+  return arrayWithHoles(arr) || iterableToArrayLimitLoose(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();
+}
+
+module.exports = _slicedToArrayLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/superPropBase.js b/node_modules/@babel/runtime/helpers/superPropBase.js
new file mode 100644
index 0000000..dd47fff
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/superPropBase.js
@@ -0,0 +1,12 @@
+var getPrototypeOf = require("./getPrototypeOf.js");
+
+function _superPropBase(object, property) {
+  while (!Object.prototype.hasOwnProperty.call(object, property)) {
+    object = getPrototypeOf(object);
+    if (object === null) break;
+  }
+
+  return object;
+}
+
+module.exports = _superPropBase, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/taggedTemplateLiteral.js b/node_modules/@babel/runtime/helpers/taggedTemplateLiteral.js
new file mode 100644
index 0000000..6d9738c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/taggedTemplateLiteral.js
@@ -0,0 +1,13 @@
+function _taggedTemplateLiteral(strings, raw) {
+  if (!raw) {
+    raw = strings.slice(0);
+  }
+
+  return Object.freeze(Object.defineProperties(strings, {
+    raw: {
+      value: Object.freeze(raw)
+    }
+  }));
+}
+
+module.exports = _taggedTemplateLiteral, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/taggedTemplateLiteralLoose.js b/node_modules/@babel/runtime/helpers/taggedTemplateLiteralLoose.js
new file mode 100644
index 0000000..4f151ca
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/taggedTemplateLiteralLoose.js
@@ -0,0 +1,10 @@
+function _taggedTemplateLiteralLoose(strings, raw) {
+  if (!raw) {
+    raw = strings.slice(0);
+  }
+
+  strings.raw = raw;
+  return strings;
+}
+
+module.exports = _taggedTemplateLiteralLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/tdz.js b/node_modules/@babel/runtime/helpers/tdz.js
new file mode 100644
index 0000000..91ec2b2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/tdz.js
@@ -0,0 +1,5 @@
+function _tdzError(name) {
+  throw new ReferenceError(name + " is not defined - temporal dead zone");
+}
+
+module.exports = _tdzError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/temporalRef.js b/node_modules/@babel/runtime/helpers/temporalRef.js
new file mode 100644
index 0000000..6afd932
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/temporalRef.js
@@ -0,0 +1,9 @@
+var temporalUndefined = require("./temporalUndefined.js");
+
+var tdz = require("./tdz.js");
+
+function _temporalRef(val, name) {
+  return val === temporalUndefined ? tdz(name) : val;
+}
+
+module.exports = _temporalRef, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/temporalUndefined.js b/node_modules/@babel/runtime/helpers/temporalUndefined.js
new file mode 100644
index 0000000..7aca810
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/temporalUndefined.js
@@ -0,0 +1,3 @@
+function _temporalUndefined() {}
+
+module.exports = _temporalUndefined, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toArray.js b/node_modules/@babel/runtime/helpers/toArray.js
new file mode 100644
index 0000000..d0af0e9
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toArray.js
@@ -0,0 +1,13 @@
+var arrayWithHoles = require("./arrayWithHoles.js");
+
+var iterableToArray = require("./iterableToArray.js");
+
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+
+var nonIterableRest = require("./nonIterableRest.js");
+
+function _toArray(arr) {
+  return arrayWithHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableRest();
+}
+
+module.exports = _toArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toConsumableArray.js b/node_modules/@babel/runtime/helpers/toConsumableArray.js
new file mode 100644
index 0000000..9c69072
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toConsumableArray.js
@@ -0,0 +1,13 @@
+var arrayWithoutHoles = require("./arrayWithoutHoles.js");
+
+var iterableToArray = require("./iterableToArray.js");
+
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+
+var nonIterableSpread = require("./nonIterableSpread.js");
+
+function _toConsumableArray(arr) {
+  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();
+}
+
+module.exports = _toConsumableArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toPrimitive.js b/node_modules/@babel/runtime/helpers/toPrimitive.js
new file mode 100644
index 0000000..dc4da81
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toPrimitive.js
@@ -0,0 +1,16 @@
+var _typeof = require("./typeof.js")["default"];
+
+function _toPrimitive(input, hint) {
+  if (_typeof(input) !== "object" || input === null) return input;
+  var prim = input[Symbol.toPrimitive];
+
+  if (prim !== undefined) {
+    var res = prim.call(input, hint || "default");
+    if (_typeof(res) !== "object") return res;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+
+  return (hint === "string" ? String : Number)(input);
+}
+
+module.exports = _toPrimitive, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toPropertyKey.js b/node_modules/@babel/runtime/helpers/toPropertyKey.js
new file mode 100644
index 0000000..61367cf
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toPropertyKey.js
@@ -0,0 +1,10 @@
+var _typeof = require("./typeof.js")["default"];
+
+var toPrimitive = require("./toPrimitive.js");
+
+function _toPropertyKey(arg) {
+  var key = toPrimitive(arg, "string");
+  return _typeof(key) === "symbol" ? key : String(key);
+}
+
+module.exports = _toPropertyKey, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/typeof.js b/node_modules/@babel/runtime/helpers/typeof.js
new file mode 100644
index 0000000..6c7860f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/typeof.js
@@ -0,0 +1,11 @@
+function _typeof(obj) {
+  "@babel/helpers - typeof";
+
+  return (module.exports = _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
+    return typeof obj;
+  } : function (obj) {
+    return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports), _typeof(obj);
+}
+
+module.exports = _typeof, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js b/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js
new file mode 100644
index 0000000..bfe65e4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js
@@ -0,0 +1,12 @@
+var arrayLikeToArray = require("./arrayLikeToArray.js");
+
+function _unsupportedIterableToArray(o, minLen) {
+  if (!o) return;
+  if (typeof o === "string") return arrayLikeToArray(o, minLen);
+  var n = Object.prototype.toString.call(o).slice(8, -1);
+  if (n === "Object" && o.constructor) n = o.constructor.name;
+  if (n === "Map" || n === "Set") return Array.from(o);
+  if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);
+}
+
+module.exports = _unsupportedIterableToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/wrapAsyncGenerator.js b/node_modules/@babel/runtime/helpers/wrapAsyncGenerator.js
new file mode 100644
index 0000000..1fb4fd7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/wrapAsyncGenerator.js
@@ -0,0 +1,9 @@
+var AsyncGenerator = require("./AsyncGenerator.js");
+
+function _wrapAsyncGenerator(fn) {
+  return function () {
+    return new AsyncGenerator(fn.apply(this, arguments));
+  };
+}
+
+module.exports = _wrapAsyncGenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/wrapNativeSuper.js b/node_modules/@babel/runtime/helpers/wrapNativeSuper.js
new file mode 100644
index 0000000..516220b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/wrapNativeSuper.js
@@ -0,0 +1,42 @@
+var getPrototypeOf = require("./getPrototypeOf.js");
+
+var setPrototypeOf = require("./setPrototypeOf.js");
+
+var isNativeFunction = require("./isNativeFunction.js");
+
+var construct = require("./construct.js");
+
+function _wrapNativeSuper(Class) {
+  var _cache = typeof Map === "function" ? new Map() : undefined;
+
+  module.exports = _wrapNativeSuper = function _wrapNativeSuper(Class) {
+    if (Class === null || !isNativeFunction(Class)) return Class;
+
+    if (typeof Class !== "function") {
+      throw new TypeError("Super expression must either be null or a function");
+    }
+
+    if (typeof _cache !== "undefined") {
+      if (_cache.has(Class)) return _cache.get(Class);
+
+      _cache.set(Class, Wrapper);
+    }
+
+    function Wrapper() {
+      return construct(Class, arguments, getPrototypeOf(this).constructor);
+    }
+
+    Wrapper.prototype = Object.create(Class.prototype, {
+      constructor: {
+        value: Wrapper,
+        enumerable: false,
+        writable: true,
+        configurable: true
+      }
+    });
+    return setPrototypeOf(Wrapper, Class);
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  return _wrapNativeSuper(Class);
+}
+
+module.exports = _wrapNativeSuper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/wrapRegExp.js b/node_modules/@babel/runtime/helpers/wrapRegExp.js
new file mode 100644
index 0000000..5b8342b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/wrapRegExp.js
@@ -0,0 +1,55 @@
+var _typeof = require("./typeof.js")["default"];
+
+var setPrototypeOf = require("./setPrototypeOf.js");
+
+var inherits = require("./inherits.js");
+
+function _wrapRegExp() {
+  module.exports = _wrapRegExp = function _wrapRegExp(re, groups) {
+    return new BabelRegExp(re, void 0, groups);
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+
+  var _super = RegExp.prototype,
+      _groups = new WeakMap();
+
+  function BabelRegExp(re, flags, groups) {
+    var _this = new RegExp(re, flags);
+
+    return _groups.set(_this, groups || _groups.get(re)), setPrototypeOf(_this, BabelRegExp.prototype);
+  }
+
+  function buildGroups(result, re) {
+    var g = _groups.get(re);
+
+    return Object.keys(g).reduce(function (groups, name) {
+      return groups[name] = result[g[name]], groups;
+    }, Object.create(null));
+  }
+
+  return inherits(BabelRegExp, RegExp), BabelRegExp.prototype.exec = function (str) {
+    var result = _super.exec.call(this, str);
+
+    return result && (result.groups = buildGroups(result, this)), result;
+  }, BabelRegExp.prototype[Symbol.replace] = function (str, substitution) {
+    if ("string" == typeof substitution) {
+      var groups = _groups.get(this);
+
+      return _super[Symbol.replace].call(this, str, substitution.replace(/\$<([^>]+)>/g, function (_, name) {
+        return "$" + groups[name];
+      }));
+    }
+
+    if ("function" == typeof substitution) {
+      var _this = this;
+
+      return _super[Symbol.replace].call(this, str, function () {
+        var args = arguments;
+        return "object" != _typeof(args[args.length - 1]) && (args = [].slice.call(args)).push(buildGroups(args, _this)), substitution.apply(this, args);
+      });
+    }
+
+    return _super[Symbol.replace].call(this, str, substitution);
+  }, _wrapRegExp.apply(this, arguments);
+}
+
+module.exports = _wrapRegExp, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/writeOnlyError.js b/node_modules/@babel/runtime/helpers/writeOnlyError.js
new file mode 100644
index 0000000..1329487
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/writeOnlyError.js
@@ -0,0 +1,5 @@
+function _writeOnlyError(name) {
+  throw new TypeError("\"" + name + "\" is write-only");
+}
+
+module.exports = _writeOnlyError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/package.json b/node_modules/@babel/runtime/package.json
new file mode 100644
index 0000000..2a394c0
--- /dev/null
+++ b/node_modules/@babel/runtime/package.json
@@ -0,0 +1,866 @@
+{
+  "name": "@babel/runtime",
+  "version": "7.17.9",
+  "description": "babel's modular runtime helpers",
+  "license": "MIT",
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/babel/babel.git",
+    "directory": "packages/babel-runtime"
+  },
+  "homepage": "https://babel.dev/docs/en/next/babel-runtime",
+  "author": "The Babel Team (https://babel.dev/team)",
+  "dependencies": {
+    "regenerator-runtime": "^0.13.4"
+  },
+  "exports": {
+    "./helpers/applyDecs": [
+      {
+        "node": "./helpers/applyDecs.js",
+        "import": "./helpers/esm/applyDecs.js",
+        "default": "./helpers/applyDecs.js"
+      },
+      "./helpers/applyDecs.js"
+    ],
+    "./helpers/esm/applyDecs": "./helpers/esm/applyDecs.js",
+    "./helpers/asyncIterator": [
+      {
+        "node": "./helpers/asyncIterator.js",
+        "import": "./helpers/esm/asyncIterator.js",
+        "default": "./helpers/asyncIterator.js"
+      },
+      "./helpers/asyncIterator.js"
+    ],
+    "./helpers/esm/asyncIterator": "./helpers/esm/asyncIterator.js",
+    "./helpers/jsx": [
+      {
+        "node": "./helpers/jsx.js",
+        "import": "./helpers/esm/jsx.js",
+        "default": "./helpers/jsx.js"
+      },
+      "./helpers/jsx.js"
+    ],
+    "./helpers/esm/jsx": "./helpers/esm/jsx.js",
+    "./helpers/objectSpread2": [
+      {
+        "node": "./helpers/objectSpread2.js",
+        "import": "./helpers/esm/objectSpread2.js",
+        "default": "./helpers/objectSpread2.js"
+      },
+      "./helpers/objectSpread2.js"
+    ],
+    "./helpers/esm/objectSpread2": "./helpers/esm/objectSpread2.js",
+    "./helpers/typeof": [
+      {
+        "node": "./helpers/typeof.js",
+        "import": "./helpers/esm/typeof.js",
+        "default": "./helpers/typeof.js"
+      },
+      "./helpers/typeof.js"
+    ],
+    "./helpers/esm/typeof": "./helpers/esm/typeof.js",
+    "./helpers/wrapRegExp": [
+      {
+        "node": "./helpers/wrapRegExp.js",
+        "import": "./helpers/esm/wrapRegExp.js",
+        "default": "./helpers/wrapRegExp.js"
+      },
+      "./helpers/wrapRegExp.js"
+    ],
+    "./helpers/esm/wrapRegExp": "./helpers/esm/wrapRegExp.js",
+    "./helpers/AwaitValue": [
+      {
+        "node": "./helpers/AwaitValue.js",
+        "import": "./helpers/esm/AwaitValue.js",
+        "default": "./helpers/AwaitValue.js"
+      },
+      "./helpers/AwaitValue.js"
+    ],
+    "./helpers/esm/AwaitValue": "./helpers/esm/AwaitValue.js",
+    "./helpers/AsyncGenerator": [
+      {
+        "node": "./helpers/AsyncGenerator.js",
+        "import": "./helpers/esm/AsyncGenerator.js",
+        "default": "./helpers/AsyncGenerator.js"
+      },
+      "./helpers/AsyncGenerator.js"
+    ],
+    "./helpers/esm/AsyncGenerator": "./helpers/esm/AsyncGenerator.js",
+    "./helpers/wrapAsyncGenerator": [
+      {
+        "node": "./helpers/wrapAsyncGenerator.js",
+        "import": "./helpers/esm/wrapAsyncGenerator.js",
+        "default": "./helpers/wrapAsyncGenerator.js"
+      },
+      "./helpers/wrapAsyncGenerator.js"
+    ],
+    "./helpers/esm/wrapAsyncGenerator": "./helpers/esm/wrapAsyncGenerator.js",
+    "./helpers/awaitAsyncGenerator": [
+      {
+        "node": "./helpers/awaitAsyncGenerator.js",
+        "import": "./helpers/esm/awaitAsyncGenerator.js",
+        "default": "./helpers/awaitAsyncGenerator.js"
+      },
+      "./helpers/awaitAsyncGenerator.js"
+    ],
+    "./helpers/esm/awaitAsyncGenerator": "./helpers/esm/awaitAsyncGenerator.js",
+    "./helpers/asyncGeneratorDelegate": [
+      {
+        "node": "./helpers/asyncGeneratorDelegate.js",
+        "import": "./helpers/esm/asyncGeneratorDelegate.js",
+        "default": "./helpers/asyncGeneratorDelegate.js"
+      },
+      "./helpers/asyncGeneratorDelegate.js"
+    ],
+    "./helpers/esm/asyncGeneratorDelegate": "./helpers/esm/asyncGeneratorDelegate.js",
+    "./helpers/asyncToGenerator": [
+      {
+        "node": "./helpers/asyncToGenerator.js",
+        "import": "./helpers/esm/asyncToGenerator.js",
+        "default": "./helpers/asyncToGenerator.js"
+      },
+      "./helpers/asyncToGenerator.js"
+    ],
+    "./helpers/esm/asyncToGenerator": "./helpers/esm/asyncToGenerator.js",
+    "./helpers/classCallCheck": [
+      {
+        "node": "./helpers/classCallCheck.js",
+        "import": "./helpers/esm/classCallCheck.js",
+        "default": "./helpers/classCallCheck.js"
+      },
+      "./helpers/classCallCheck.js"
+    ],
+    "./helpers/esm/classCallCheck": "./helpers/esm/classCallCheck.js",
+    "./helpers/createClass": [
+      {
+        "node": "./helpers/createClass.js",
+        "import": "./helpers/esm/createClass.js",
+        "default": "./helpers/createClass.js"
+      },
+      "./helpers/createClass.js"
+    ],
+    "./helpers/esm/createClass": "./helpers/esm/createClass.js",
+    "./helpers/defineEnumerableProperties": [
+      {
+        "node": "./helpers/defineEnumerableProperties.js",
+        "import": "./helpers/esm/defineEnumerableProperties.js",
+        "default": "./helpers/defineEnumerableProperties.js"
+      },
+      "./helpers/defineEnumerableProperties.js"
+    ],
+    "./helpers/esm/defineEnumerableProperties": "./helpers/esm/defineEnumerableProperties.js",
+    "./helpers/defaults": [
+      {
+        "node": "./helpers/defaults.js",
+        "import": "./helpers/esm/defaults.js",
+        "default": "./helpers/defaults.js"
+      },
+      "./helpers/defaults.js"
+    ],
+    "./helpers/esm/defaults": "./helpers/esm/defaults.js",
+    "./helpers/defineProperty": [
+      {
+        "node": "./helpers/defineProperty.js",
+        "import": "./helpers/esm/defineProperty.js",
+        "default": "./helpers/defineProperty.js"
+      },
+      "./helpers/defineProperty.js"
+    ],
+    "./helpers/esm/defineProperty": "./helpers/esm/defineProperty.js",
+    "./helpers/extends": [
+      {
+        "node": "./helpers/extends.js",
+        "import": "./helpers/esm/extends.js",
+        "default": "./helpers/extends.js"
+      },
+      "./helpers/extends.js"
+    ],
+    "./helpers/esm/extends": "./helpers/esm/extends.js",
+    "./helpers/objectSpread": [
+      {
+        "node": "./helpers/objectSpread.js",
+        "import": "./helpers/esm/objectSpread.js",
+        "default": "./helpers/objectSpread.js"
+      },
+      "./helpers/objectSpread.js"
+    ],
+    "./helpers/esm/objectSpread": "./helpers/esm/objectSpread.js",
+    "./helpers/inherits": [
+      {
+        "node": "./helpers/inherits.js",
+        "import": "./helpers/esm/inherits.js",
+        "default": "./helpers/inherits.js"
+      },
+      "./helpers/inherits.js"
+    ],
+    "./helpers/esm/inherits": "./helpers/esm/inherits.js",
+    "./helpers/inheritsLoose": [
+      {
+        "node": "./helpers/inheritsLoose.js",
+        "import": "./helpers/esm/inheritsLoose.js",
+        "default": "./helpers/inheritsLoose.js"
+      },
+      "./helpers/inheritsLoose.js"
+    ],
+    "./helpers/esm/inheritsLoose": "./helpers/esm/inheritsLoose.js",
+    "./helpers/getPrototypeOf": [
+      {
+        "node": "./helpers/getPrototypeOf.js",
+        "import": "./helpers/esm/getPrototypeOf.js",
+        "default": "./helpers/getPrototypeOf.js"
+      },
+      "./helpers/getPrototypeOf.js"
+    ],
+    "./helpers/esm/getPrototypeOf": "./helpers/esm/getPrototypeOf.js",
+    "./helpers/setPrototypeOf": [
+      {
+        "node": "./helpers/setPrototypeOf.js",
+        "import": "./helpers/esm/setPrototypeOf.js",
+        "default": "./helpers/setPrototypeOf.js"
+      },
+      "./helpers/setPrototypeOf.js"
+    ],
+    "./helpers/esm/setPrototypeOf": "./helpers/esm/setPrototypeOf.js",
+    "./helpers/isNativeReflectConstruct": [
+      {
+        "node": "./helpers/isNativeReflectConstruct.js",
+        "import": "./helpers/esm/isNativeReflectConstruct.js",
+        "default": "./helpers/isNativeReflectConstruct.js"
+      },
+      "./helpers/isNativeReflectConstruct.js"
+    ],
+    "./helpers/esm/isNativeReflectConstruct": "./helpers/esm/isNativeReflectConstruct.js",
+    "./helpers/construct": [
+      {
+        "node": "./helpers/construct.js",
+        "import": "./helpers/esm/construct.js",
+        "default": "./helpers/construct.js"
+      },
+      "./helpers/construct.js"
+    ],
+    "./helpers/esm/construct": "./helpers/esm/construct.js",
+    "./helpers/isNativeFunction": [
+      {
+        "node": "./helpers/isNativeFunction.js",
+        "import": "./helpers/esm/isNativeFunction.js",
+        "default": "./helpers/isNativeFunction.js"
+      },
+      "./helpers/isNativeFunction.js"
+    ],
+    "./helpers/esm/isNativeFunction": "./helpers/esm/isNativeFunction.js",
+    "./helpers/wrapNativeSuper": [
+      {
+        "node": "./helpers/wrapNativeSuper.js",
+        "import": "./helpers/esm/wrapNativeSuper.js",
+        "default": "./helpers/wrapNativeSuper.js"
+      },
+      "./helpers/wrapNativeSuper.js"
+    ],
+    "./helpers/esm/wrapNativeSuper": "./helpers/esm/wrapNativeSuper.js",
+    "./helpers/instanceof": [
+      {
+        "node": "./helpers/instanceof.js",
+        "import": "./helpers/esm/instanceof.js",
+        "default": "./helpers/instanceof.js"
+      },
+      "./helpers/instanceof.js"
+    ],
+    "./helpers/esm/instanceof": "./helpers/esm/instanceof.js",
+    "./helpers/interopRequireDefault": [
+      {
+        "node": "./helpers/interopRequireDefault.js",
+        "import": "./helpers/esm/interopRequireDefault.js",
+        "default": "./helpers/interopRequireDefault.js"
+      },
+      "./helpers/interopRequireDefault.js"
+    ],
+    "./helpers/esm/interopRequireDefault": "./helpers/esm/interopRequireDefault.js",
+    "./helpers/interopRequireWildcard": [
+      {
+        "node": "./helpers/interopRequireWildcard.js",
+        "import": "./helpers/esm/interopRequireWildcard.js",
+        "default": "./helpers/interopRequireWildcard.js"
+      },
+      "./helpers/interopRequireWildcard.js"
+    ],
+    "./helpers/esm/interopRequireWildcard": "./helpers/esm/interopRequireWildcard.js",
+    "./helpers/newArrowCheck": [
+      {
+        "node": "./helpers/newArrowCheck.js",
+        "import": "./helpers/esm/newArrowCheck.js",
+        "default": "./helpers/newArrowCheck.js"
+      },
+      "./helpers/newArrowCheck.js"
+    ],
+    "./helpers/esm/newArrowCheck": "./helpers/esm/newArrowCheck.js",
+    "./helpers/objectDestructuringEmpty": [
+      {
+        "node": "./helpers/objectDestructuringEmpty.js",
+        "import": "./helpers/esm/objectDestructuringEmpty.js",
+        "default": "./helpers/objectDestructuringEmpty.js"
+      },
+      "./helpers/objectDestructuringEmpty.js"
+    ],
+    "./helpers/esm/objectDestructuringEmpty": "./helpers/esm/objectDestructuringEmpty.js",
+    "./helpers/objectWithoutPropertiesLoose": [
+      {
+        "node": "./helpers/objectWithoutPropertiesLoose.js",
+        "import": "./helpers/esm/objectWithoutPropertiesLoose.js",
+        "default": "./helpers/objectWithoutPropertiesLoose.js"
+      },
+      "./helpers/objectWithoutPropertiesLoose.js"
+    ],
+    "./helpers/esm/objectWithoutPropertiesLoose": "./helpers/esm/objectWithoutPropertiesLoose.js",
+    "./helpers/objectWithoutProperties": [
+      {
+        "node": "./helpers/objectWithoutProperties.js",
+        "import": "./helpers/esm/objectWithoutProperties.js",
+        "default": "./helpers/objectWithoutProperties.js"
+      },
+      "./helpers/objectWithoutProperties.js"
+    ],
+    "./helpers/esm/objectWithoutProperties": "./helpers/esm/objectWithoutProperties.js",
+    "./helpers/assertThisInitialized": [
+      {
+        "node": "./helpers/assertThisInitialized.js",
+        "import": "./helpers/esm/assertThisInitialized.js",
+        "default": "./helpers/assertThisInitialized.js"
+      },
+      "./helpers/assertThisInitialized.js"
+    ],
+    "./helpers/esm/assertThisInitialized": "./helpers/esm/assertThisInitialized.js",
+    "./helpers/possibleConstructorReturn": [
+      {
+        "node": "./helpers/possibleConstructorReturn.js",
+        "import": "./helpers/esm/possibleConstructorReturn.js",
+        "default": "./helpers/possibleConstructorReturn.js"
+      },
+      "./helpers/possibleConstructorReturn.js"
+    ],
+    "./helpers/esm/possibleConstructorReturn": "./helpers/esm/possibleConstructorReturn.js",
+    "./helpers/createSuper": [
+      {
+        "node": "./helpers/createSuper.js",
+        "import": "./helpers/esm/createSuper.js",
+        "default": "./helpers/createSuper.js"
+      },
+      "./helpers/createSuper.js"
+    ],
+    "./helpers/esm/createSuper": "./helpers/esm/createSuper.js",
+    "./helpers/superPropBase": [
+      {
+        "node": "./helpers/superPropBase.js",
+        "import": "./helpers/esm/superPropBase.js",
+        "default": "./helpers/superPropBase.js"
+      },
+      "./helpers/superPropBase.js"
+    ],
+    "./helpers/esm/superPropBase": "./helpers/esm/superPropBase.js",
+    "./helpers/get": [
+      {
+        "node": "./helpers/get.js",
+        "import": "./helpers/esm/get.js",
+        "default": "./helpers/get.js"
+      },
+      "./helpers/get.js"
+    ],
+    "./helpers/esm/get": "./helpers/esm/get.js",
+    "./helpers/set": [
+      {
+        "node": "./helpers/set.js",
+        "import": "./helpers/esm/set.js",
+        "default": "./helpers/set.js"
+      },
+      "./helpers/set.js"
+    ],
+    "./helpers/esm/set": "./helpers/esm/set.js",
+    "./helpers/taggedTemplateLiteral": [
+      {
+        "node": "./helpers/taggedTemplateLiteral.js",
+        "import": "./helpers/esm/taggedTemplateLiteral.js",
+        "default": "./helpers/taggedTemplateLiteral.js"
+      },
+      "./helpers/taggedTemplateLiteral.js"
+    ],
+    "./helpers/esm/taggedTemplateLiteral": "./helpers/esm/taggedTemplateLiteral.js",
+    "./helpers/taggedTemplateLiteralLoose": [
+      {
+        "node": "./helpers/taggedTemplateLiteralLoose.js",
+        "import": "./helpers/esm/taggedTemplateLiteralLoose.js",
+        "default": "./helpers/taggedTemplateLiteralLoose.js"
+      },
+      "./helpers/taggedTemplateLiteralLoose.js"
+    ],
+    "./helpers/esm/taggedTemplateLiteralLoose": "./helpers/esm/taggedTemplateLiteralLoose.js",
+    "./helpers/readOnlyError": [
+      {
+        "node": "./helpers/readOnlyError.js",
+        "import": "./helpers/esm/readOnlyError.js",
+        "default": "./helpers/readOnlyError.js"
+      },
+      "./helpers/readOnlyError.js"
+    ],
+    "./helpers/esm/readOnlyError": "./helpers/esm/readOnlyError.js",
+    "./helpers/writeOnlyError": [
+      {
+        "node": "./helpers/writeOnlyError.js",
+        "import": "./helpers/esm/writeOnlyError.js",
+        "default": "./helpers/writeOnlyError.js"
+      },
+      "./helpers/writeOnlyError.js"
+    ],
+    "./helpers/esm/writeOnlyError": "./helpers/esm/writeOnlyError.js",
+    "./helpers/classNameTDZError": [
+      {
+        "node": "./helpers/classNameTDZError.js",
+        "import": "./helpers/esm/classNameTDZError.js",
+        "default": "./helpers/classNameTDZError.js"
+      },
+      "./helpers/classNameTDZError.js"
+    ],
+    "./helpers/esm/classNameTDZError": "./helpers/esm/classNameTDZError.js",
+    "./helpers/temporalUndefined": [
+      {
+        "node": "./helpers/temporalUndefined.js",
+        "import": "./helpers/esm/temporalUndefined.js",
+        "default": "./helpers/temporalUndefined.js"
+      },
+      "./helpers/temporalUndefined.js"
+    ],
+    "./helpers/esm/temporalUndefined": "./helpers/esm/temporalUndefined.js",
+    "./helpers/tdz": [
+      {
+        "node": "./helpers/tdz.js",
+        "import": "./helpers/esm/tdz.js",
+        "default": "./helpers/tdz.js"
+      },
+      "./helpers/tdz.js"
+    ],
+    "./helpers/esm/tdz": "./helpers/esm/tdz.js",
+    "./helpers/temporalRef": [
+      {
+        "node": "./helpers/temporalRef.js",
+        "import": "./helpers/esm/temporalRef.js",
+        "default": "./helpers/temporalRef.js"
+      },
+      "./helpers/temporalRef.js"
+    ],
+    "./helpers/esm/temporalRef": "./helpers/esm/temporalRef.js",
+    "./helpers/slicedToArray": [
+      {
+        "node": "./helpers/slicedToArray.js",
+        "import": "./helpers/esm/slicedToArray.js",
+        "default": "./helpers/slicedToArray.js"
+      },
+      "./helpers/slicedToArray.js"
+    ],
+    "./helpers/esm/slicedToArray": "./helpers/esm/slicedToArray.js",
+    "./helpers/slicedToArrayLoose": [
+      {
+        "node": "./helpers/slicedToArrayLoose.js",
+        "import": "./helpers/esm/slicedToArrayLoose.js",
+        "default": "./helpers/slicedToArrayLoose.js"
+      },
+      "./helpers/slicedToArrayLoose.js"
+    ],
+    "./helpers/esm/slicedToArrayLoose": "./helpers/esm/slicedToArrayLoose.js",
+    "./helpers/toArray": [
+      {
+        "node": "./helpers/toArray.js",
+        "import": "./helpers/esm/toArray.js",
+        "default": "./helpers/toArray.js"
+      },
+      "./helpers/toArray.js"
+    ],
+    "./helpers/esm/toArray": "./helpers/esm/toArray.js",
+    "./helpers/toConsumableArray": [
+      {
+        "node": "./helpers/toConsumableArray.js",
+        "import": "./helpers/esm/toConsumableArray.js",
+        "default": "./helpers/toConsumableArray.js"
+      },
+      "./helpers/toConsumableArray.js"
+    ],
+    "./helpers/esm/toConsumableArray": "./helpers/esm/toConsumableArray.js",
+    "./helpers/arrayWithoutHoles": [
+      {
+        "node": "./helpers/arrayWithoutHoles.js",
+        "import": "./helpers/esm/arrayWithoutHoles.js",
+        "default": "./helpers/arrayWithoutHoles.js"
+      },
+      "./helpers/arrayWithoutHoles.js"
+    ],
+    "./helpers/esm/arrayWithoutHoles": "./helpers/esm/arrayWithoutHoles.js",
+    "./helpers/arrayWithHoles": [
+      {
+        "node": "./helpers/arrayWithHoles.js",
+        "import": "./helpers/esm/arrayWithHoles.js",
+        "default": "./helpers/arrayWithHoles.js"
+      },
+      "./helpers/arrayWithHoles.js"
+    ],
+    "./helpers/esm/arrayWithHoles": "./helpers/esm/arrayWithHoles.js",
+    "./helpers/maybeArrayLike": [
+      {
+        "node": "./helpers/maybeArrayLike.js",
+        "import": "./helpers/esm/maybeArrayLike.js",
+        "default": "./helpers/maybeArrayLike.js"
+      },
+      "./helpers/maybeArrayLike.js"
+    ],
+    "./helpers/esm/maybeArrayLike": "./helpers/esm/maybeArrayLike.js",
+    "./helpers/iterableToArray": [
+      {
+        "node": "./helpers/iterableToArray.js",
+        "import": "./helpers/esm/iterableToArray.js",
+        "default": "./helpers/iterableToArray.js"
+      },
+      "./helpers/iterableToArray.js"
+    ],
+    "./helpers/esm/iterableToArray": "./helpers/esm/iterableToArray.js",
+    "./helpers/iterableToArrayLimit": [
+      {
+        "node": "./helpers/iterableToArrayLimit.js",
+        "import": "./helpers/esm/iterableToArrayLimit.js",
+        "default": "./helpers/iterableToArrayLimit.js"
+      },
+      "./helpers/iterableToArrayLimit.js"
+    ],
+    "./helpers/esm/iterableToArrayLimit": "./helpers/esm/iterableToArrayLimit.js",
+    "./helpers/iterableToArrayLimitLoose": [
+      {
+        "node": "./helpers/iterableToArrayLimitLoose.js",
+        "import": "./helpers/esm/iterableToArrayLimitLoose.js",
+        "default": "./helpers/iterableToArrayLimitLoose.js"
+      },
+      "./helpers/iterableToArrayLimitLoose.js"
+    ],
+    "./helpers/esm/iterableToArrayLimitLoose": "./helpers/esm/iterableToArrayLimitLoose.js",
+    "./helpers/unsupportedIterableToArray": [
+      {
+        "node": "./helpers/unsupportedIterableToArray.js",
+        "import": "./helpers/esm/unsupportedIterableToArray.js",
+        "default": "./helpers/unsupportedIterableToArray.js"
+      },
+      "./helpers/unsupportedIterableToArray.js"
+    ],
+    "./helpers/esm/unsupportedIterableToArray": "./helpers/esm/unsupportedIterableToArray.js",
+    "./helpers/arrayLikeToArray": [
+      {
+        "node": "./helpers/arrayLikeToArray.js",
+        "import": "./helpers/esm/arrayLikeToArray.js",
+        "default": "./helpers/arrayLikeToArray.js"
+      },
+      "./helpers/arrayLikeToArray.js"
+    ],
+    "./helpers/esm/arrayLikeToArray": "./helpers/esm/arrayLikeToArray.js",
+    "./helpers/nonIterableSpread": [
+      {
+        "node": "./helpers/nonIterableSpread.js",
+        "import": "./helpers/esm/nonIterableSpread.js",
+        "default": "./helpers/nonIterableSpread.js"
+      },
+      "./helpers/nonIterableSpread.js"
+    ],
+    "./helpers/esm/nonIterableSpread": "./helpers/esm/nonIterableSpread.js",
+    "./helpers/nonIterableRest": [
+      {
+        "node": "./helpers/nonIterableRest.js",
+        "import": "./helpers/esm/nonIterableRest.js",
+        "default": "./helpers/nonIterableRest.js"
+      },
+      "./helpers/nonIterableRest.js"
+    ],
+    "./helpers/esm/nonIterableRest": "./helpers/esm/nonIterableRest.js",
+    "./helpers/createForOfIteratorHelper": [
+      {
+        "node": "./helpers/createForOfIteratorHelper.js",
+        "import": "./helpers/esm/createForOfIteratorHelper.js",
+        "default": "./helpers/createForOfIteratorHelper.js"
+      },
+      "./helpers/createForOfIteratorHelper.js"
+    ],
+    "./helpers/esm/createForOfIteratorHelper": "./helpers/esm/createForOfIteratorHelper.js",
+    "./helpers/createForOfIteratorHelperLoose": [
+      {
+        "node": "./helpers/createForOfIteratorHelperLoose.js",
+        "import": "./helpers/esm/createForOfIteratorHelperLoose.js",
+        "default": "./helpers/createForOfIteratorHelperLoose.js"
+      },
+      "./helpers/createForOfIteratorHelperLoose.js"
+    ],
+    "./helpers/esm/createForOfIteratorHelperLoose": "./helpers/esm/createForOfIteratorHelperLoose.js",
+    "./helpers/skipFirstGeneratorNext": [
+      {
+        "node": "./helpers/skipFirstGeneratorNext.js",
+        "import": "./helpers/esm/skipFirstGeneratorNext.js",
+        "default": "./helpers/skipFirstGeneratorNext.js"
+      },
+      "./helpers/skipFirstGeneratorNext.js"
+    ],
+    "./helpers/esm/skipFirstGeneratorNext": "./helpers/esm/skipFirstGeneratorNext.js",
+    "./helpers/toPrimitive": [
+      {
+        "node": "./helpers/toPrimitive.js",
+        "import": "./helpers/esm/toPrimitive.js",
+        "default": "./helpers/toPrimitive.js"
+      },
+      "./helpers/toPrimitive.js"
+    ],
+    "./helpers/esm/toPrimitive": "./helpers/esm/toPrimitive.js",
+    "./helpers/toPropertyKey": [
+      {
+        "node": "./helpers/toPropertyKey.js",
+        "import": "./helpers/esm/toPropertyKey.js",
+        "default": "./helpers/toPropertyKey.js"
+      },
+      "./helpers/toPropertyKey.js"
+    ],
+    "./helpers/esm/toPropertyKey": "./helpers/esm/toPropertyKey.js",
+    "./helpers/initializerWarningHelper": [
+      {
+        "node": "./helpers/initializerWarningHelper.js",
+        "import": "./helpers/esm/initializerWarningHelper.js",
+        "default": "./helpers/initializerWarningHelper.js"
+      },
+      "./helpers/initializerWarningHelper.js"
+    ],
+    "./helpers/esm/initializerWarningHelper": "./helpers/esm/initializerWarningHelper.js",
+    "./helpers/initializerDefineProperty": [
+      {
+        "node": "./helpers/initializerDefineProperty.js",
+        "import": "./helpers/esm/initializerDefineProperty.js",
+        "default": "./helpers/initializerDefineProperty.js"
+      },
+      "./helpers/initializerDefineProperty.js"
+    ],
+    "./helpers/esm/initializerDefineProperty": "./helpers/esm/initializerDefineProperty.js",
+    "./helpers/applyDecoratedDescriptor": [
+      {
+        "node": "./helpers/applyDecoratedDescriptor.js",
+        "import": "./helpers/esm/applyDecoratedDescriptor.js",
+        "default": "./helpers/applyDecoratedDescriptor.js"
+      },
+      "./helpers/applyDecoratedDescriptor.js"
+    ],
+    "./helpers/esm/applyDecoratedDescriptor": "./helpers/esm/applyDecoratedDescriptor.js",
+    "./helpers/classPrivateFieldLooseKey": [
+      {
+        "node": "./helpers/classPrivateFieldLooseKey.js",
+        "import": "./helpers/esm/classPrivateFieldLooseKey.js",
+        "default": "./helpers/classPrivateFieldLooseKey.js"
+      },
+      "./helpers/classPrivateFieldLooseKey.js"
+    ],
+    "./helpers/esm/classPrivateFieldLooseKey": "./helpers/esm/classPrivateFieldLooseKey.js",
+    "./helpers/classPrivateFieldLooseBase": [
+      {
+        "node": "./helpers/classPrivateFieldLooseBase.js",
+        "import": "./helpers/esm/classPrivateFieldLooseBase.js",
+        "default": "./helpers/classPrivateFieldLooseBase.js"
+      },
+      "./helpers/classPrivateFieldLooseBase.js"
+    ],
+    "./helpers/esm/classPrivateFieldLooseBase": "./helpers/esm/classPrivateFieldLooseBase.js",
+    "./helpers/classPrivateFieldGet": [
+      {
+        "node": "./helpers/classPrivateFieldGet.js",
+        "import": "./helpers/esm/classPrivateFieldGet.js",
+        "default": "./helpers/classPrivateFieldGet.js"
+      },
+      "./helpers/classPrivateFieldGet.js"
+    ],
+    "./helpers/esm/classPrivateFieldGet": "./helpers/esm/classPrivateFieldGet.js",
+    "./helpers/classPrivateFieldSet": [
+      {
+        "node": "./helpers/classPrivateFieldSet.js",
+        "import": "./helpers/esm/classPrivateFieldSet.js",
+        "default": "./helpers/classPrivateFieldSet.js"
+      },
+      "./helpers/classPrivateFieldSet.js"
+    ],
+    "./helpers/esm/classPrivateFieldSet": "./helpers/esm/classPrivateFieldSet.js",
+    "./helpers/classPrivateFieldDestructureSet": [
+      {
+        "node": "./helpers/classPrivateFieldDestructureSet.js",
+        "import": "./helpers/esm/classPrivateFieldDestructureSet.js",
+        "default": "./helpers/classPrivateFieldDestructureSet.js"
+      },
+      "./helpers/classPrivateFieldDestructureSet.js"
+    ],
+    "./helpers/esm/classPrivateFieldDestructureSet": "./helpers/esm/classPrivateFieldDestructureSet.js",
+    "./helpers/classExtractFieldDescriptor": [
+      {
+        "node": "./helpers/classExtractFieldDescriptor.js",
+        "import": "./helpers/esm/classExtractFieldDescriptor.js",
+        "default": "./helpers/classExtractFieldDescriptor.js"
+      },
+      "./helpers/classExtractFieldDescriptor.js"
+    ],
+    "./helpers/esm/classExtractFieldDescriptor": "./helpers/esm/classExtractFieldDescriptor.js",
+    "./helpers/classStaticPrivateFieldSpecGet": [
+      {
+        "node": "./helpers/classStaticPrivateFieldSpecGet.js",
+        "import": "./helpers/esm/classStaticPrivateFieldSpecGet.js",
+        "default": "./helpers/classStaticPrivateFieldSpecGet.js"
+      },
+      "./helpers/classStaticPrivateFieldSpecGet.js"
+    ],
+    "./helpers/esm/classStaticPrivateFieldSpecGet": "./helpers/esm/classStaticPrivateFieldSpecGet.js",
+    "./helpers/classStaticPrivateFieldSpecSet": [
+      {
+        "node": "./helpers/classStaticPrivateFieldSpecSet.js",
+        "import": "./helpers/esm/classStaticPrivateFieldSpecSet.js",
+        "default": "./helpers/classStaticPrivateFieldSpecSet.js"
+      },
+      "./helpers/classStaticPrivateFieldSpecSet.js"
+    ],
+    "./helpers/esm/classStaticPrivateFieldSpecSet": "./helpers/esm/classStaticPrivateFieldSpecSet.js",
+    "./helpers/classStaticPrivateMethodGet": [
+      {
+        "node": "./helpers/classStaticPrivateMethodGet.js",
+        "import": "./helpers/esm/classStaticPrivateMethodGet.js",
+        "default": "./helpers/classStaticPrivateMethodGet.js"
+      },
+      "./helpers/classStaticPrivateMethodGet.js"
+    ],
+    "./helpers/esm/classStaticPrivateMethodGet": "./helpers/esm/classStaticPrivateMethodGet.js",
+    "./helpers/classStaticPrivateMethodSet": [
+      {
+        "node": "./helpers/classStaticPrivateMethodSet.js",
+        "import": "./helpers/esm/classStaticPrivateMethodSet.js",
+        "default": "./helpers/classStaticPrivateMethodSet.js"
+      },
+      "./helpers/classStaticPrivateMethodSet.js"
+    ],
+    "./helpers/esm/classStaticPrivateMethodSet": "./helpers/esm/classStaticPrivateMethodSet.js",
+    "./helpers/classApplyDescriptorGet": [
+      {
+        "node": "./helpers/classApplyDescriptorGet.js",
+        "import": "./helpers/esm/classApplyDescriptorGet.js",
+        "default": "./helpers/classApplyDescriptorGet.js"
+      },
+      "./helpers/classApplyDescriptorGet.js"
+    ],
+    "./helpers/esm/classApplyDescriptorGet": "./helpers/esm/classApplyDescriptorGet.js",
+    "./helpers/classApplyDescriptorSet": [
+      {
+        "node": "./helpers/classApplyDescriptorSet.js",
+        "import": "./helpers/esm/classApplyDescriptorSet.js",
+        "default": "./helpers/classApplyDescriptorSet.js"
+      },
+      "./helpers/classApplyDescriptorSet.js"
+    ],
+    "./helpers/esm/classApplyDescriptorSet": "./helpers/esm/classApplyDescriptorSet.js",
+    "./helpers/classApplyDescriptorDestructureSet": [
+      {
+        "node": "./helpers/classApplyDescriptorDestructureSet.js",
+        "import": "./helpers/esm/classApplyDescriptorDestructureSet.js",
+        "default": "./helpers/classApplyDescriptorDestructureSet.js"
+      },
+      "./helpers/classApplyDescriptorDestructureSet.js"
+    ],
+    "./helpers/esm/classApplyDescriptorDestructureSet": "./helpers/esm/classApplyDescriptorDestructureSet.js",
+    "./helpers/classStaticPrivateFieldDestructureSet": [
+      {
+        "node": "./helpers/classStaticPrivateFieldDestructureSet.js",
+        "import": "./helpers/esm/classStaticPrivateFieldDestructureSet.js",
+        "default": "./helpers/classStaticPrivateFieldDestructureSet.js"
+      },
+      "./helpers/classStaticPrivateFieldDestructureSet.js"
+    ],
+    "./helpers/esm/classStaticPrivateFieldDestructureSet": "./helpers/esm/classStaticPrivateFieldDestructureSet.js",
+    "./helpers/classCheckPrivateStaticAccess": [
+      {
+        "node": "./helpers/classCheckPrivateStaticAccess.js",
+        "import": "./helpers/esm/classCheckPrivateStaticAccess.js",
+        "default": "./helpers/classCheckPrivateStaticAccess.js"
+      },
+      "./helpers/classCheckPrivateStaticAccess.js"
+    ],
+    "./helpers/esm/classCheckPrivateStaticAccess": "./helpers/esm/classCheckPrivateStaticAccess.js",
+    "./helpers/classCheckPrivateStaticFieldDescriptor": [
+      {
+        "node": "./helpers/classCheckPrivateStaticFieldDescriptor.js",
+        "import": "./helpers/esm/classCheckPrivateStaticFieldDescriptor.js",
+        "default": "./helpers/classCheckPrivateStaticFieldDescriptor.js"
+      },
+      "./helpers/classCheckPrivateStaticFieldDescriptor.js"
+    ],
+    "./helpers/esm/classCheckPrivateStaticFieldDescriptor": "./helpers/esm/classCheckPrivateStaticFieldDescriptor.js",
+    "./helpers/decorate": [
+      {
+        "node": "./helpers/decorate.js",
+        "import": "./helpers/esm/decorate.js",
+        "default": "./helpers/decorate.js"
+      },
+      "./helpers/decorate.js"
+    ],
+    "./helpers/esm/decorate": "./helpers/esm/decorate.js",
+    "./helpers/classPrivateMethodGet": [
+      {
+        "node": "./helpers/classPrivateMethodGet.js",
+        "import": "./helpers/esm/classPrivateMethodGet.js",
+        "default": "./helpers/classPrivateMethodGet.js"
+      },
+      "./helpers/classPrivateMethodGet.js"
+    ],
+    "./helpers/esm/classPrivateMethodGet": "./helpers/esm/classPrivateMethodGet.js",
+    "./helpers/checkPrivateRedeclaration": [
+      {
+        "node": "./helpers/checkPrivateRedeclaration.js",
+        "import": "./helpers/esm/checkPrivateRedeclaration.js",
+        "default": "./helpers/checkPrivateRedeclaration.js"
+      },
+      "./helpers/checkPrivateRedeclaration.js"
+    ],
+    "./helpers/esm/checkPrivateRedeclaration": "./helpers/esm/checkPrivateRedeclaration.js",
+    "./helpers/classPrivateFieldInitSpec": [
+      {
+        "node": "./helpers/classPrivateFieldInitSpec.js",
+        "import": "./helpers/esm/classPrivateFieldInitSpec.js",
+        "default": "./helpers/classPrivateFieldInitSpec.js"
+      },
+      "./helpers/classPrivateFieldInitSpec.js"
+    ],
+    "./helpers/esm/classPrivateFieldInitSpec": "./helpers/esm/classPrivateFieldInitSpec.js",
+    "./helpers/classPrivateMethodInitSpec": [
+      {
+        "node": "./helpers/classPrivateMethodInitSpec.js",
+        "import": "./helpers/esm/classPrivateMethodInitSpec.js",
+        "default": "./helpers/classPrivateMethodInitSpec.js"
+      },
+      "./helpers/classPrivateMethodInitSpec.js"
+    ],
+    "./helpers/esm/classPrivateMethodInitSpec": "./helpers/esm/classPrivateMethodInitSpec.js",
+    "./helpers/classPrivateMethodSet": [
+      {
+        "node": "./helpers/classPrivateMethodSet.js",
+        "import": "./helpers/esm/classPrivateMethodSet.js",
+        "default": "./helpers/classPrivateMethodSet.js"
+      },
+      "./helpers/classPrivateMethodSet.js"
+    ],
+    "./helpers/esm/classPrivateMethodSet": "./helpers/esm/classPrivateMethodSet.js",
+    "./helpers/identity": [
+      {
+        "node": "./helpers/identity.js",
+        "import": "./helpers/esm/identity.js",
+        "default": "./helpers/identity.js"
+      },
+      "./helpers/identity.js"
+    ],
+    "./helpers/esm/identity": "./helpers/esm/identity.js",
+    "./package": "./package.json",
+    "./package.json": "./package.json",
+    "./regenerator": "./regenerator/index.js",
+    "./regenerator/*.js": "./regenerator/*.js",
+    "./regenerator/": "./regenerator/"
+  },
+  "engines": {
+    "node": ">=6.9.0"
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/regenerator/index.js b/node_modules/@babel/runtime/regenerator/index.js
new file mode 100644
index 0000000..9fd4158
--- /dev/null
+++ b/node_modules/@babel/runtime/regenerator/index.js
@@ -0,0 +1 @@
+module.exports = require("regenerator-runtime");
diff --git a/node_modules/complex.js/.travis.yml b/node_modules/complex.js/.travis.yml
new file mode 100644
index 0000000..4632143
--- /dev/null
+++ b/node_modules/complex.js/.travis.yml
@@ -0,0 +1,4 @@
+language: node_js
+node_js:
+  - "stable"
+script: npm test
diff --git a/node_modules/complex.js/LICENSE b/node_modules/complex.js/LICENSE
new file mode 100644
index 0000000..cbed088
--- /dev/null
+++ b/node_modules/complex.js/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Robert Eisele
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/complex.js/README.md b/node_modules/complex.js/README.md
new file mode 100644
index 0000000..994ee5b
--- /dev/null
+++ b/node_modules/complex.js/README.md
@@ -0,0 +1,343 @@
+# Complex.js - ℂ in JavaScript
+
+[![NPM Package](https://nodei.co/npm-dl/complex.js.png?months=6&height=1)](https://npmjs.org/package/complex.js)
+
+[![Build Status](https://travis-ci.org/infusion/Complex.js.svg?branch=master)](https://travis-ci.org/infusion/Complex.js)
+[![MIT license](http://img.shields.io/badge/license-MIT-brightgreen.svg)](http://opensource.org/licenses/MIT)
+
+Complex.js is a well tested JavaScript library to work with [complex number arithmetic](https://www.xarg.org/book/analysis/complex-numbers/) in JavaScript. It implements every elementary complex number manipulation function and the API is intentionally similar to [Fraction.js](https://github.com/infusion/Fraction.js). Furthermore, it's the basis of [Polynomial.js](https://github.com/infusion/Polynomial.js) and [Math.js](https://github.com/josdejong/mathjs).
+
+
+Examples
+===
+
+```js
+let Complex = require('complex.js');
+
+let c = new Complex("99.3+8i");
+c.mul({re: 3, im: 9}).div(4.9).sub(3, 2);
+```
+
+A classical use case for complex numbers is solving quadratic equations `ax² + bx + c = 0` for all `a, b, c ∈ ℝ`:
+
+```js
+
+function quadraticRoot(a, b, c) {
+  let sqrt = Complex(b * b - 4 * a * c).sqrt()
+  let x1 = Complex(-b).add(sqrt).div(2 * a)
+  let x2 = Complex(-b).sub(sqrt).div(2 * a)
+  return {x1, x2}
+}
+
+// quadraticRoot(1, 4, 5) -> -2 ± i
+```
+
+Parser
+===
+
+Any function (see below) as well as the constructor of the *Complex* class parses its input like this.
+
+You can pass either Objects, Doubles or Strings.
+
+Objects
+---
+```javascript
+new Complex({re: real, im: imaginary});
+new Complex({arg: angle, abs: radius});
+new Complex({phi: angle, r: radius});
+new Complex([real, imaginary]); // Vector/Array syntax
+```
+If there are other attributes on the passed object, they're not getting preserved and have to be merged manually.
+
+Doubles
+---
+```javascript
+new Complex(55.4);
+```
+
+Strings
+---
+```javascript
+new Complex("123.45");
+new Complex("15+3i");
+new Complex("i");
+```
+
+Two arguments
+---
+```javascript
+new Complex(3, 2); // 3+2i
+```
+
+Attributes
+===
+
+Every complex number object exposes its real and imaginary part as attribute `re` and `im`:
+
+```javascript
+let c = new Complex(3, 2);
+
+console.log("Real part:", c.re); // 3
+console.log("Imaginary part:", c.im); // 2
+```
+
+Functions
+===
+
+Complex sign()
+---
+Returns the complex sign, defined as the complex number normalized by it's absolute value
+
+Complex add(n)
+---
+Adds another complex number
+
+Complex sub(n)
+---
+Subtracts another complex number
+
+Complex mul(n)
+---
+Multiplies the number with another complex number
+
+Complex div(n)
+---
+Divides the number by another complex number
+
+Complex pow(exp)
+---
+Returns the number raised to the complex exponent (Note: `Complex.ZERO.pow(0) = Complex.ONE` by convention)
+
+Complex sqrt()
+---
+Returns the complex square root of the number
+
+Complex exp(n)
+---
+Returns `e^n` with complex exponent `n`.
+
+Complex log()
+---
+Returns the natural logarithm (base `E`) of the actual complex number
+
+_Note:_ The logarithm to a different base can be calculated with `z.log().div(Math.log(base))`.
+
+double abs()
+---
+Calculates the magnitude of the complex number
+
+double arg()
+---
+Calculates the angle of the complex number
+
+Complex inverse()
+---
+Calculates the multiplicative inverse of the complex number (1 / z)
+
+Complex conjugate()
+---
+Calculates the conjugate of the complex number (multiplies the imaginary part with -1)
+
+Complex neg()
+---
+Negates the number (multiplies both the real and imaginary part with -1) in order to get the additive inverse
+
+Complex floor([places=0])
+---
+Floors the complex number parts towards zero
+
+Complex ceil([places=0])
+---
+Ceils the complex number parts off zero
+
+Complex round([places=0])
+---
+Rounds the complex number parts
+
+boolean equals(n)
+---
+Checks if both numbers are exactly the same, if both numbers are infinite they
+are considered **not** equal.
+
+boolean isNaN()
+---
+Checks if the given number is not a number
+
+boolean isFinite()
+---
+Checks if the given number is finite
+
+Complex clone()
+---
+Returns a new Complex instance with the same real and imaginary properties
+
+Array toVector()
+---
+Returns a Vector of the actual complex number with two components
+
+String toString()
+---
+Returns a string representation of the actual number. As of v1.9.0 the output is a bit more human readable
+
+```javascript
+new Complex(1, 2).toString(); // 1 + 2i
+new Complex(0, 1).toString(); // i
+new Complex(9, 0).toString(); // 9
+new Complex(1, 1).toString(); // 1 + i
+```
+
+double valueOf()
+---
+Returns the real part of the number if imaginary part is zero. Otherwise `null`
+
+
+Trigonometric functions
+===
+The following trigonometric functions are defined on Complex.js:
+
+| Trig | Arcus | Hyperbolic | Area-Hyperbolic |
+|------|-------|------------|------------------|
+| sin()  | asin()  | sinh()       | asinh()            |
+| cos()  | acos()  | cosh()       | acosh()            |
+| tan()  | atan()  | tanh()       | atanh()            |
+| cot()  | acot()  | coth()       | acoth()            |
+| sec()  | asec()  | sech()       | asech()            |
+| csc()  | acsc()  | csch()       | acsch()            |
+
+
+Geometric Equivalence
+===
+
+Complex numbers can also be seen as a vector in the 2D space. Here is a simple overview of basic operations and how to implement them with complex.js:
+
+New vector
+---
+```js
+let v1 = new Complex(1, 0);
+let v2 = new Complex(1, 1);
+```
+
+Scale vector
+---
+```js
+scale(v1, factor):= v1.mul(factor)
+```
+
+Vector norm
+---
+```js
+norm(v):= v.abs()
+```
+
+Translate vector
+---
+```js
+translate(v1, v2):= v1.add(v2)
+```
+
+Rotate vector around center
+---
+```js
+rotate(v, angle):= v.mul({abs: 1, arg: angle})
+```
+
+Rotate vector around a point
+---
+```js
+rotate(v, p, angle):= v.sub(p).mul({abs: 1, arg: angle}).add(p)
+```
+
+Distance to another vector
+---
+```js
+distance(v1, v2):= v1.sub(v2).abs()
+```
+
+Constants
+===
+
+Complex.ZERO
+---
+A complex zero value (south pole on the Riemann Sphere)
+
+Complex.ONE
+---
+A complex one instance
+
+Complex.INFINITY
+---
+A complex infinity value (north pole on the Riemann Sphere)
+
+Complex.NAN
+---
+A complex NaN value (not on the Riemann Sphere)
+
+Complex.I
+---
+An imaginary number i instance
+
+Complex.PI
+---
+A complex PI instance
+
+Complex.E
+---
+A complex euler number instance
+
+Complex.EPSILON
+---
+A small epsilon value used for `equals()` comparison in order to circumvent double imprecision.
+
+
+Installation
+===
+Installing complex.js is as easy as cloning this repo or use one of the following commands:
+
+```bash
+bower install complex.js
+```
+or
+
+```bash
+npm install complex.js
+```
+
+Using Complex.js with the browser
+===
+```html
+<script src="complex.js"></script>
+<script>
+    console.log(Complex("4+3i"));
+</script>
+```
+
+Using Complex.js with require.js
+===
+```html
+<script src="require.js"></script>
+<script>
+requirejs(['complex.js'],
+function(Complex) {
+    console.log(Complex("4+3i"));
+});
+</script>
+```
+
+Coding Style
+===
+As every library I publish, complex.js is also built to be as small as possible after compressing it with Google Closure Compiler in advanced mode. Thus the coding style orientates a little on maxing-out the compression rate. Please make sure you keep this style if you plan to extend the library.
+
+
+Testing
+===
+If you plan to enhance the library, make sure you add test cases and all the previous tests are passing. You can test the library with
+
+```bash
+npm test
+```
+
+
+Copyright and licensing
+===
+Copyright (c) 2015-2022, [Robert Eisele](https://www.xarg.org/)
+Dual licensed under the MIT or GPL Version 2 licenses.
diff --git a/node_modules/complex.js/bower.json b/node_modules/complex.js/bower.json
new file mode 100644
index 0000000..bd28a6a
--- /dev/null
+++ b/node_modules/complex.js/bower.json
@@ -0,0 +1,31 @@
+{
+    "name": "complex.js",
+    "main": "complex.js",
+    "version": "2.1.1",
+    "homepage": "https://github.com/infusion/Complex.js",
+    "description": "A complex number library",
+    "keywords": [
+       "math", "complex", "number", "calculus", "parser"
+    ],
+    "moduleType": [
+      "amd",
+      "globals",
+      "node"
+    ],
+    "authors": [
+        "Robert Eisele <robert@xarg.org> (http://www.xarg.org/)"
+    ],
+    "license": [
+        "MIT",
+        "GPL"
+    ],
+    "repository": {
+        "type": "git",
+        "url": "git://github.com/infusion/Complex.js.git"
+    },
+    "ignore": [
+        "tests",
+        ".travis.yml",
+        "package.json"
+    ]
+}
diff --git a/node_modules/complex.js/complex.d.ts b/node_modules/complex.js/complex.d.ts
new file mode 100644
index 0000000..37003f1
--- /dev/null
+++ b/node_modules/complex.js/complex.d.ts
@@ -0,0 +1,323 @@
+type AValue =
+  | Complex
+  | { im: number; re: number }
+  | { abs: number; arg: number }
+  | { r: number; phi: number }
+  | [number, number]
+  | string
+  | number
+  | null
+  | undefined;
+type BValue = number | undefined;
+
+export function Complex(a: AValue, b?: BValue): Complex;
+
+export default Complex;
+
+/**
+ *
+ * This class allows the manipulation of complex numbers.
+ * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.
+ *
+ * Object form
+ * { re: <real>, im: <imaginary> }
+ * { arg: <angle>, abs: <radius> }
+ * { phi: <angle>, r: <radius> }
+ *
+ * Array / Vector form
+ * [ real, imaginary ]
+ *
+ * Double form
+ * 99.3 - Single double value
+ *
+ * String form
+ * '23.1337' - Simple real number
+ * '15+3i' - a simple complex number
+ * '3-i' - a simple complex number
+ *
+ * Example:
+ *
+ * var c = new Complex('99.3+8i');
+ * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
+ *
+ */
+export class Complex {
+  re: number;
+  im: number;
+
+  constructor(a: AValue, b?: BValue);
+
+  /**
+   * Calculates the sign of a complex number, which is a normalized complex
+   *
+   */
+  sign(): Complex;
+  /**
+   * Adds two complex numbers
+   *
+   */
+  add(a: AValue, b?: BValue): Complex;
+  /**
+   * Subtracts two complex numbers
+   *
+   */
+  sub(a: AValue, b?: BValue): Complex;
+  /**
+   * Multiplies two complex numbers
+   *
+   */
+  mul(a: AValue, b?: BValue): Complex;
+  /**
+   * Divides two complex numbers
+   *
+   */
+  div(a: AValue, b?: BValue): Complex;
+  /**
+   * Calculate the power of two complex numbers
+   *
+   */
+  pow(a: AValue, b?: BValue): Complex;
+  /**
+   * Calculate the complex square root
+   *
+   */
+  sqrt(): Complex;
+  /**
+   * Calculate the complex exponent
+   *
+   */
+  exp(): Complex;
+  /**
+   * Calculate the complex exponent and subtracts one.
+   *
+   * This may be more accurate than `Complex(x).exp().sub(1)` if
+   * `x` is small.
+   *
+   */
+  expm1(): Complex;
+  /**
+   * Calculate the natural log
+   *
+   */
+  log(): Complex;
+  /**
+   * Calculate the magnitude of the complex number
+   *
+   */
+  abs(): number;
+  /**
+   * Calculate the angle of the complex number
+   *
+   */
+  arg(): number;
+  /**
+   * Calculate the sine of the complex number
+   *
+   */
+  sin(): Complex;
+  /**
+   * Calculate the cosine
+   *
+   */
+  cos(): Complex;
+  /**
+   * Calculate the tangent
+   *
+   */
+  tan(): Complex;
+  /**
+   * Calculate the cotangent
+   *
+   */
+  cot(): Complex;
+  /**
+   * Calculate the secant
+   *
+   */
+  sec(): Complex;
+  /**
+   * Calculate the cosecans
+   *
+   */
+  csc(): Complex;
+  /**
+   * Calculate the complex arcus sinus
+   *
+   */
+  asin(): Complex;
+  /**
+   * Calculate the complex arcus cosinus
+   *
+   */
+  acos(): Complex;
+  /**
+   * Calculate the complex arcus tangent
+   *
+   */
+  atan(): Complex;
+  /**
+   * Calculate the complex arcus cotangent
+   *
+   */
+  acot(): Complex;
+  /**
+   * Calculate the complex arcus secant
+   *
+   */
+  asec(): Complex;
+  /**
+   * Calculate the complex arcus cosecans
+   *
+   */
+  acsc(): Complex;
+  /**
+   * Calculate the complex sinh
+   *
+   */
+  sinh(): Complex;
+  /**
+   * Calculate the complex cosh
+   *
+   */
+  cosh(): Complex;
+  /**
+   * Calculate the complex tanh
+   *
+   */
+  tanh(): Complex;
+  /**
+   * Calculate the complex coth
+   *
+   */
+  coth(): Complex;
+  /**
+   * Calculate the complex coth
+   *
+   */
+  csch(): Complex;
+  /**
+   * Calculate the complex sech
+   *
+   */
+  sech(): Complex;
+  /**
+   * Calculate the complex asinh
+   *
+   */
+  asinh(): Complex;
+  /**
+   * Calculate the complex acosh
+   *
+   */
+  acosh(): Complex;
+  /**
+   * Calculate the complex atanh
+   *
+   */
+  atanh(): Complex;
+  /**
+   * Calculate the complex acoth
+   *
+   */
+  acoth(): Complex;
+  /**
+   * Calculate the complex acsch
+   *
+   */
+  acsch(): Complex;
+  /**
+   * Calculate the complex asech
+   *
+   */
+  asech(): Complex;
+  /**
+   * Calculate the complex inverse 1/z
+   *
+   */
+  inverse(): Complex;
+  /**
+   * Returns the complex conjugate
+   *
+   */
+  conjugate(): Complex;
+  /**
+   * Gets the negated complex number
+   *
+   */
+  neg(): Complex;
+  /**
+   * Ceils the actual complex number
+   *
+   */
+  ceil(places: number): Complex;
+  /**
+   * Floors the actual complex number
+   *
+   */
+  floor(places: number): Complex;
+  /**
+   * Ceils the actual complex number
+   *
+   */
+  round(places: number): Complex;
+  /**
+   * Compares two complex numbers
+   *
+   * **Note:** new Complex(Infinity).equals(Infinity) === false
+   *
+   */
+  equals(a: AValue, b?: BValue): boolean;
+  /**
+   * Clones the actual object
+   *
+   */
+  clone(): Complex;
+  /**
+   * Gets a string of the actual complex number
+   *
+   */
+  toString(): string;
+  /**
+   * Returns the actual number as a vector
+   *
+   */
+  toVector(): number[];
+  /**
+   * Returns the actual real value of the current object
+   *
+   * @returns {number|null}
+   */
+  valueOf(): number | null;
+  /**
+   * Determines whether a complex number is not on the Riemann sphere.
+   *
+   */
+  isNaN(): boolean;
+  /**
+   * Determines whether or not a complex number is at the zero pole of the
+   * Riemann sphere.
+   *
+   */
+  isZero(): boolean;
+  /**
+   * Determines whether a complex number is not at the infinity pole of the
+   * Riemann sphere.
+   *
+   */
+  isFinite(): boolean;
+  /**
+   * Determines whether or not a complex number is at the infinity pole of the
+   * Riemann sphere.
+   *
+   */
+  isInfinite(): boolean;
+
+  static ZERO: Complex;
+  static ONE: Complex;
+  static I: Complex;
+  static PI: Complex;
+  static E: Complex;
+  static INFINITY: Complex;
+  static NAN: Complex;
+  static EPSILON: number;
+}
diff --git a/node_modules/complex.js/complex.js b/node_modules/complex.js/complex.js
new file mode 100644
index 0000000..308e753
--- /dev/null
+++ b/node_modules/complex.js/complex.js
@@ -0,0 +1,1424 @@
+/**
+ * @license Complex.js v2.1.1 12/05/2020
+ *
+ * Copyright (c) 2020, Robert Eisele (robert@xarg.org)
+ * Dual licensed under the MIT or GPL Version 2 licenses.
+ **/
+
+/**
+ *
+ * This class allows the manipulation of complex numbers.
+ * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.
+ *
+ * Object form
+ * { re: <real>, im: <imaginary> }
+ * { arg: <angle>, abs: <radius> }
+ * { phi: <angle>, r: <radius> }
+ *
+ * Array / Vector form
+ * [ real, imaginary ]
+ *
+ * Double form
+ * 99.3 - Single double value
+ *
+ * String form
+ * '23.1337' - Simple real number
+ * '15+3i' - a simple complex number
+ * '3-i' - a simple complex number
+ *
+ * Example:
+ *
+ * var c = new Complex('99.3+8i');
+ * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
+ *
+ */
+
+(function(root) {
+
+  'use strict';
+
+  var cosh = Math.cosh || function(x) {
+    return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;
+  };
+
+  var sinh = Math.sinh || function(x) {
+    return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;
+  };
+
+  /**
+   * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).
+   *
+   * @param {number} x
+   * @returns {number} cos(x) - 1
+   */
+  var cosm1 = function(x) {
+
+    var b = Math.PI / 4;
+    if (-b > x || x > b) {
+      return Math.cos(x) - 1.0;
+    }
+
+    /* Calculate horner form of polynomial of taylor series in Q
+    var fac = 1, alt = 1, pol = {};
+    for (var i = 0; i <= 16; i++) {
+      fac*= i || 1;
+      if (i % 2 == 0) {
+        pol[i] = new Fraction(1, alt * fac);
+        alt = -alt;
+      }
+    }
+    console.log(new Polynomial(pol).toHorner()); // (((((((1/20922789888000x^2-1/87178291200)x^2+1/479001600)x^2-1/3628800)x^2+1/40320)x^2-1/720)x^2+1/24)x^2-1/2)x^2+1
+    */
+
+    var xx = x * x;
+    return xx * (
+      xx * (
+        xx * (
+          xx * (
+            xx * (
+              xx * (
+                xx * (
+                  xx / 20922789888000
+                  - 1 / 87178291200)
+                + 1 / 479001600)
+              - 1 / 3628800)
+            + 1 / 40320)
+          - 1 / 720)
+        + 1 / 24)
+      - 1 / 2);
+  };
+
+  var hypot = function(x, y) {
+
+    var a = Math.abs(x);
+    var b = Math.abs(y);
+
+    if (a < 3000 && b < 3000) {
+      return Math.sqrt(a * a + b * b);
+    }
+
+    if (a < b) {
+      a = b;
+      b = x / y;
+    } else {
+      b = y / x;
+    }
+    return a * Math.sqrt(1 + b * b);
+  };
+
+  var parser_exit = function() {
+    throw SyntaxError('Invalid Param');
+  };
+
+  /**
+   * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows
+   *
+   * @param {number} a
+   * @param {number} b
+   * @returns {number}
+   */
+  function logHypot(a, b) {
+
+    var _a = Math.abs(a);
+    var _b = Math.abs(b);
+
+    if (a === 0) {
+      return Math.log(_b);
+    }
+
+    if (b === 0) {
+      return Math.log(_a);
+    }
+
+    if (_a < 3000 && _b < 3000) {
+      return Math.log(a * a + b * b) * 0.5;
+    }
+
+    /* I got 4 ideas to compute this property without overflow:
+     *
+     * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate
+     *
+     * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)
+
+     Math.log(a * a + b * b) / 2
+
+     *
+     *
+     * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)
+
+     var fn = function(a, b) {
+     a = Math.abs(a);
+     b = Math.abs(b);
+     var t = Math.min(a, b);
+     a = Math.max(a, b);
+     t = t / a;
+
+     return Math.log(a) + Math.log(1 + t * t) / 2;
+     };
+
+     * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)
+
+     Math.log(a / Math.cos(Math.atan2(b, a)))
+
+     * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)
+
+     Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))
+
+     */
+
+     a = a / 2;
+     b = b / 2;
+
+    return 0.5 * Math.log(a * a + b * b) + Math.LN2;
+  }
+
+  var parse = function(a, b) {
+
+    var z = { 're': 0, 'im': 0 };
+
+    if (a === undefined || a === null) {
+      z['re'] =
+      z['im'] = 0;
+    } else if (b !== undefined) {
+      z['re'] = a;
+      z['im'] = b;
+    } else
+      switch (typeof a) {
+
+        case 'object':
+
+          if ('im' in a && 're' in a) {
+            z['re'] = a['re'];
+            z['im'] = a['im'];
+          } else if ('abs' in a && 'arg' in a) {
+            if (!Number.isFinite(a['abs']) && Number.isFinite(a['arg'])) {
+              return Complex['INFINITY'];
+            }
+            z['re'] = a['abs'] * Math.cos(a['arg']);
+            z['im'] = a['abs'] * Math.sin(a['arg']);
+          } else if ('r' in a && 'phi' in a) {
+            if (!Number.isFinite(a['r']) && Number.isFinite(a['phi'])) {
+              return Complex['INFINITY'];
+            }
+            z['re'] = a['r'] * Math.cos(a['phi']);
+            z['im'] = a['r'] * Math.sin(a['phi']);
+          } else if (a.length === 2) { // Quick array check
+            z['re'] = a[0];
+            z['im'] = a[1];
+          } else {
+            parser_exit();
+          }
+          break;
+
+        case 'string':
+
+          z['im'] = /* void */
+          z['re'] = 0;
+
+          var tokens = a.match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);
+          var plus = 1;
+          var minus = 0;
+
+          if (tokens === null) {
+            parser_exit();
+          }
+
+          for (var i = 0; i < tokens.length; i++) {
+
+            var c = tokens[i];
+
+            if (c === ' ' || c === '\t' || c === '\n') {
+              /* void */
+            } else if (c === '+') {
+              plus++;
+            } else if (c === '-') {
+              minus++;
+            } else if (c === 'i' || c === 'I') {
+
+              if (plus + minus === 0) {
+                parser_exit();
+              }
+
+              if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {
+                z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);
+                i++;
+              } else {
+                z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');
+              }
+              plus = minus = 0;
+
+            } else {
+
+              if (plus + minus === 0 || isNaN(c)) {
+                parser_exit();
+              }
+
+              if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {
+                z['im'] += parseFloat((minus % 2 ? '-' : '') + c);
+                i++;
+              } else {
+                z['re'] += parseFloat((minus % 2 ? '-' : '') + c);
+              }
+              plus = minus = 0;
+            }
+          }
+
+          // Still something on the stack
+          if (plus + minus > 0) {
+            parser_exit();
+          }
+          break;
+
+        case 'number':
+          z['im'] = 0;
+          z['re'] = a;
+          break;
+
+        default:
+          parser_exit();
+      }
+
+    if (isNaN(z['re']) || isNaN(z['im'])) {
+      // If a calculation is NaN, we treat it as NaN and don't throw
+      //parser_exit();
+    }
+
+    return z;
+  };
+
+  /**
+   * @constructor
+   * @returns {Complex}
+   */
+  function Complex(a, b) {
+
+    if (!(this instanceof Complex)) {
+      return new Complex(a, b);
+    }
+
+    var z = parse(a, b);
+
+    this['re'] = z['re'];
+    this['im'] = z['im'];
+  }
+
+  Complex.prototype = {
+
+    're': 0,
+    'im': 0,
+
+    /**
+     * Calculates the sign of a complex number, which is a normalized complex
+     *
+     * @returns {Complex}
+     */
+    'sign': function() {
+
+      var abs = this['abs']();
+
+      return new Complex(
+        this['re'] / abs,
+        this['im'] / abs);
+    },
+
+    /**
+     * Adds two complex numbers
+     *
+     * @returns {Complex}
+     */
+    'add': function(a, b) {
+
+      var z = new Complex(a, b);
+
+      // Infinity + Infinity = NaN
+      if (this['isInfinite']() && z['isInfinite']()) {
+        return Complex['NAN'];
+      }
+
+      // Infinity + z = Infinity { where z != Infinity }
+      if (this['isInfinite']() || z['isInfinite']()) {
+        return Complex['INFINITY'];
+      }
+
+      return new Complex(
+        this['re'] + z['re'],
+        this['im'] + z['im']);
+    },
+
+    /**
+     * Subtracts two complex numbers
+     *
+     * @returns {Complex}
+     */
+    'sub': function(a, b) {
+
+      var z = new Complex(a, b);
+
+      // Infinity - Infinity = NaN
+      if (this['isInfinite']() && z['isInfinite']()) {
+        return Complex['NAN'];
+      }
+
+      // Infinity - z = Infinity { where z != Infinity }
+      if (this['isInfinite']() || z['isInfinite']()) {
+        return Complex['INFINITY'];
+      }
+
+      return new Complex(
+        this['re'] - z['re'],
+        this['im'] - z['im']);
+    },
+
+    /**
+     * Multiplies two complex numbers
+     *
+     * @returns {Complex}
+     */
+    'mul': function(a, b) {
+
+      var z = new Complex(a, b);
+
+      // Infinity * 0 = NaN
+      if ((this['isInfinite']() && z['isZero']()) || (this['isZero']() && z['isInfinite']())) {
+        return Complex['NAN'];
+      }
+
+      // Infinity * z = Infinity { where z != 0 }
+      if (this['isInfinite']() || z['isInfinite']()) {
+        return Complex['INFINITY'];
+      }
+
+      // Short circuit for real values
+      if (z['im'] === 0 && this['im'] === 0) {
+        return new Complex(this['re'] * z['re'], 0);
+      }
+
+      return new Complex(
+        this['re'] * z['re'] - this['im'] * z['im'],
+        this['re'] * z['im'] + this['im'] * z['re']);
+    },
+
+    /**
+     * Divides two complex numbers
+     *
+     * @returns {Complex}
+     */
+    'div': function(a, b) {
+
+      var z = new Complex(a, b);
+
+      // 0 / 0 = NaN and Infinity / Infinity = NaN
+      if ((this['isZero']() && z['isZero']()) || (this['isInfinite']() && z['isInfinite']())) {
+        return Complex['NAN'];
+      }
+
+      // Infinity / 0 = Infinity
+      if (this['isInfinite']() || z['isZero']()) {
+        return Complex['INFINITY'];
+      }
+
+      // 0 / Infinity = 0
+      if (this['isZero']() || z['isInfinite']()) {
+        return Complex['ZERO'];
+      }
+
+      a = this['re'];
+      b = this['im'];
+
+      var c = z['re'];
+      var d = z['im'];
+      var t, x;
+
+      if (0 === d) {
+        // Divisor is real
+        return new Complex(a / c, b / c);
+      }
+
+      if (Math.abs(c) < Math.abs(d)) {
+
+        x = c / d;
+        t = c * x + d;
+
+        return new Complex(
+          (a * x + b) / t,
+          (b * x - a) / t);
+
+      } else {
+
+        x = d / c;
+        t = d * x + c;
+
+        return new Complex(
+          (a + b * x) / t,
+          (b - a * x) / t);
+      }
+    },
+
+    /**
+     * Calculate the power of two complex numbers
+     *
+     * @returns {Complex}
+     */
+    'pow': function(a, b) {
+
+      var z = new Complex(a, b);
+
+      a = this['re'];
+      b = this['im'];
+
+      if (z['isZero']()) {
+        return Complex['ONE'];
+      }
+
+      // If the exponent is real
+      if (z['im'] === 0) {
+
+        if (b === 0 && a > 0) {
+
+          return new Complex(Math.pow(a, z['re']), 0);
+
+        } else if (a === 0) { // If base is fully imaginary
+
+          switch ((z['re'] % 4 + 4) % 4) {
+            case 0:
+              return new Complex(Math.pow(b, z['re']), 0);
+            case 1:
+              return new Complex(0, Math.pow(b, z['re']));
+            case 2:
+              return new Complex(-Math.pow(b, z['re']), 0);
+            case 3:
+              return new Complex(0, -Math.pow(b, z['re']));
+          }
+        }
+      }
+
+      /* I couldn't find a good formula, so here is a derivation and optimization
+       *
+       * z_1^z_2 = (a + bi)^(c + di)
+       *         = exp((c + di) * log(a + bi)
+       *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))
+       * =>...
+       * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+       * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+       *
+       * =>...
+       * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+       * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+       *
+       * =>
+       * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))
+       * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))
+       *
+       */
+
+      if (a === 0 && b === 0 && z['re'] > 0 && z['im'] >= 0) {
+        return Complex['ZERO'];
+      }
+
+      var arg = Math.atan2(b, a);
+      var loh = logHypot(a, b);
+
+      a = Math.exp(z['re'] * loh - z['im'] * arg);
+      b = z['im'] * loh + z['re'] * arg;
+      return new Complex(
+        a * Math.cos(b),
+        a * Math.sin(b));
+    },
+
+    /**
+     * Calculate the complex square root
+     *
+     * @returns {Complex}
+     */
+    'sqrt': function() {
+
+      var a = this['re'];
+      var b = this['im'];
+      var r = this['abs']();
+
+      var re, im;
+
+      if (a >= 0) {
+
+        if (b === 0) {
+          return new Complex(Math.sqrt(a), 0);
+        }
+
+        re = 0.5 * Math.sqrt(2.0 * (r + a));
+      } else {
+        re = Math.abs(b) / Math.sqrt(2 * (r - a));
+      }
+
+      if (a <= 0) {
+        im = 0.5 * Math.sqrt(2.0 * (r - a));
+      } else {
+        im = Math.abs(b) / Math.sqrt(2 * (r + a));
+      }
+
+      return new Complex(re, b < 0 ? -im : im);
+    },
+
+    /**
+     * Calculate the complex exponent
+     *
+     * @returns {Complex}
+     */
+    'exp': function() {
+
+      var tmp = Math.exp(this['re']);
+
+      if (this['im'] === 0) {
+        //return new Complex(tmp, 0);
+      }
+      return new Complex(
+        tmp * Math.cos(this['im']),
+        tmp * Math.sin(this['im']));
+    },
+
+    /**
+     * Calculate the complex exponent and subtracts one.
+     *
+     * This may be more accurate than `Complex(x).exp().sub(1)` if
+     * `x` is small.
+     *
+     * @returns {Complex}
+     */
+    'expm1': function() {
+
+      /**
+       * exp(a + i*b) - 1
+       = exp(a) * (cos(b) + j*sin(b)) - 1
+       = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)
+       */
+
+      var a = this['re'];
+      var b = this['im'];
+
+      return new Complex(
+        Math.expm1(a) * Math.cos(b) + cosm1(b),
+        Math.exp(a) * Math.sin(b));
+    },
+
+    /**
+     * Calculate the natural log
+     *
+     * @returns {Complex}
+     */
+    'log': function() {
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (b === 0 && a > 0) {
+        //return new Complex(Math.log(a), 0);
+      }
+
+      return new Complex(
+        logHypot(a, b),
+        Math.atan2(b, a));
+    },
+
+    /**
+     * Calculate the magnitude of the complex number
+     *
+     * @returns {number}
+     */
+    'abs': function() {
+
+      return hypot(this['re'], this['im']);
+    },
+
+    /**
+     * Calculate the angle of the complex number
+     *
+     * @returns {number}
+     */
+    'arg': function() {
+
+      return Math.atan2(this['im'], this['re']);
+    },
+
+    /**
+     * Calculate the sine of the complex number
+     *
+     * @returns {Complex}
+     */
+    'sin': function() {
+
+      // sin(z) = ( e^iz - e^-iz ) / 2i 
+      //        = sin(a)cosh(b) + i cos(a)sinh(b)
+
+      var a = this['re'];
+      var b = this['im'];
+
+      return new Complex(
+        Math.sin(a) * cosh(b),
+        Math.cos(a) * sinh(b));
+    },
+
+    /**
+     * Calculate the cosine
+     *
+     * @returns {Complex}
+     */
+    'cos': function() {
+
+      // cos(z) = ( e^iz + e^-iz ) / 2 
+      //        = cos(a)cosh(b) - i sin(a)sinh(b)
+
+      var a = this['re'];
+      var b = this['im'];
+
+      return new Complex(
+        Math.cos(a) * cosh(b),
+        -Math.sin(a) * sinh(b));
+    },
+
+    /**
+     * Calculate the tangent
+     *
+     * @returns {Complex}
+     */
+    'tan': function() {
+
+      // tan(z) = sin(z) / cos(z) 
+      //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )
+      //        = ( e^2iz - 1 ) / i( e^2iz + 1 )
+      //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )
+
+      var a = 2 * this['re'];
+      var b = 2 * this['im'];
+      var d = Math.cos(a) + cosh(b);
+
+      return new Complex(
+        Math.sin(a) / d,
+        sinh(b) / d);
+    },
+
+    /**
+     * Calculate the cotangent
+     *
+     * @returns {Complex}
+     */
+    'cot': function() {
+
+      // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))
+
+      var a = 2 * this['re'];
+      var b = 2 * this['im'];
+      var d = Math.cos(a) - cosh(b);
+
+      return new Complex(
+        -Math.sin(a) / d,
+        sinh(b) / d);
+    },
+
+    /**
+     * Calculate the secant
+     *
+     * @returns {Complex}
+     */
+    'sec': function() {
+
+      // sec(c) = 2 / (e^(ci) + e^(-ci))
+
+      var a = this['re'];
+      var b = this['im'];
+      var d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);
+
+      return new Complex(
+        Math.cos(a) * cosh(b) / d,
+        Math.sin(a) * sinh(b) / d);
+    },
+
+    /**
+     * Calculate the cosecans
+     *
+     * @returns {Complex}
+     */
+    'csc': function() {
+
+      // csc(c) = 2i / (e^(ci) - e^(-ci))
+
+      var a = this['re'];
+      var b = this['im'];
+      var d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);
+
+      return new Complex(
+        Math.sin(a) * cosh(b) / d,
+        -Math.cos(a) * sinh(b) / d);
+    },
+
+    /**
+     * Calculate the complex arcus sinus
+     *
+     * @returns {Complex}
+     */
+    'asin': function() {
+
+      // asin(c) = -i * log(ci + sqrt(1 - c^2))
+
+      var a = this['re'];
+      var b = this['im'];
+
+      var t1 = new Complex(
+        b * b - a * a + 1,
+        -2 * a * b)['sqrt']();
+
+      var t2 = new Complex(
+        t1['re'] - b,
+        t1['im'] + a)['log']();
+
+      return new Complex(t2['im'], -t2['re']);
+    },
+
+    /**
+     * Calculate the complex arcus cosinus
+     *
+     * @returns {Complex}
+     */
+    'acos': function() {
+
+      // acos(c) = i * log(c - i * sqrt(1 - c^2))
+
+      var a = this['re'];
+      var b = this['im'];
+
+      var t1 = new Complex(
+        b * b - a * a + 1,
+        -2 * a * b)['sqrt']();
+
+      var t2 = new Complex(
+        t1['re'] - b,
+        t1['im'] + a)['log']();
+
+      return new Complex(Math.PI / 2 - t2['im'], t2['re']);
+    },
+
+    /**
+     * Calculate the complex arcus tangent
+     *
+     * @returns {Complex}
+     */
+    'atan': function() {
+
+      // atan(c) = i / 2 log((i + x) / (i - x))
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (a === 0) {
+
+        if (b === 1) {
+          return new Complex(0, Infinity);
+        }
+
+        if (b === -1) {
+          return new Complex(0, -Infinity);
+        }
+      }
+
+      var d = a * a + (1.0 - b) * (1.0 - b);
+
+      var t1 = new Complex(
+        (1 - b * b - a * a) / d,
+        -2 * a / d).log();
+
+      return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);
+    },
+
+    /**
+     * Calculate the complex arcus cotangent
+     *
+     * @returns {Complex}
+     */
+    'acot': function() {
+
+      // acot(c) = i / 2 log((c - i) / (c + i))
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (b === 0) {
+        return new Complex(Math.atan2(1, a), 0);
+      }
+
+      var d = a * a + b * b;
+      return (d !== 0)
+        ? new Complex(
+          a / d,
+          -b / d).atan()
+        : new Complex(
+          (a !== 0) ? a / 0 : 0,
+          (b !== 0) ? -b / 0 : 0).atan();
+    },
+
+    /**
+     * Calculate the complex arcus secant
+     *
+     * @returns {Complex}
+     */
+    'asec': function() {
+
+      // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (a === 0 && b === 0) {
+        return new Complex(0, Infinity);
+      }
+
+      var d = a * a + b * b;
+      return (d !== 0)
+        ? new Complex(
+          a / d,
+          -b / d).acos()
+        : new Complex(
+          (a !== 0) ? a / 0 : 0,
+          (b !== 0) ? -b / 0 : 0).acos();
+    },
+
+    /**
+     * Calculate the complex arcus cosecans
+     *
+     * @returns {Complex}
+     */
+    'acsc': function() {
+
+      // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (a === 0 && b === 0) {
+        return new Complex(Math.PI / 2, Infinity);
+      }
+
+      var d = a * a + b * b;
+      return (d !== 0)
+        ? new Complex(
+          a / d,
+          -b / d).asin()
+        : new Complex(
+          (a !== 0) ? a / 0 : 0,
+          (b !== 0) ? -b / 0 : 0).asin();
+    },
+
+    /**
+     * Calculate the complex sinh
+     *
+     * @returns {Complex}
+     */
+    'sinh': function() {
+
+      // sinh(c) = (e^c - e^-c) / 2
+
+      var a = this['re'];
+      var b = this['im'];
+
+      return new Complex(
+        sinh(a) * Math.cos(b),
+        cosh(a) * Math.sin(b));
+    },
+
+    /**
+     * Calculate the complex cosh
+     *
+     * @returns {Complex}
+     */
+    'cosh': function() {
+
+      // cosh(c) = (e^c + e^-c) / 2
+
+      var a = this['re'];
+      var b = this['im'];
+
+      return new Complex(
+        cosh(a) * Math.cos(b),
+        sinh(a) * Math.sin(b));
+    },
+
+    /**
+     * Calculate the complex tanh
+     *
+     * @returns {Complex}
+     */
+    'tanh': function() {
+
+      // tanh(c) = (e^c - e^-c) / (e^c + e^-c)
+
+      var a = 2 * this['re'];
+      var b = 2 * this['im'];
+      var d = cosh(a) + Math.cos(b);
+
+      return new Complex(
+        sinh(a) / d,
+        Math.sin(b) / d);
+    },
+
+    /**
+     * Calculate the complex coth
+     *
+     * @returns {Complex}
+     */
+    'coth': function() {
+
+      // coth(c) = (e^c + e^-c) / (e^c - e^-c)
+
+      var a = 2 * this['re'];
+      var b = 2 * this['im'];
+      var d = cosh(a) - Math.cos(b);
+
+      return new Complex(
+        sinh(a) / d,
+        -Math.sin(b) / d);
+    },
+
+    /**
+     * Calculate the complex coth
+     *
+     * @returns {Complex}
+     */
+    'csch': function() {
+
+      // csch(c) = 2 / (e^c - e^-c)
+
+      var a = this['re'];
+      var b = this['im'];
+      var d = Math.cos(2 * b) - cosh(2 * a);
+
+      return new Complex(
+        -2 * sinh(a) * Math.cos(b) / d,
+        2 * cosh(a) * Math.sin(b) / d);
+    },
+
+    /**
+     * Calculate the complex sech
+     *
+     * @returns {Complex}
+     */
+    'sech': function() {
+
+      // sech(c) = 2 / (e^c + e^-c)
+
+      var a = this['re'];
+      var b = this['im'];
+      var d = Math.cos(2 * b) + cosh(2 * a);
+
+      return new Complex(
+        2 * cosh(a) * Math.cos(b) / d,
+        -2 * sinh(a) * Math.sin(b) / d);
+    },
+
+    /**
+     * Calculate the complex asinh
+     *
+     * @returns {Complex}
+     */
+    'asinh': function() {
+
+      // asinh(c) = log(c + sqrt(c^2 + 1))
+
+      var tmp = this['im'];
+      this['im'] = -this['re'];
+      this['re'] = tmp;
+      var res = this['asin']();
+
+      this['re'] = -this['im'];
+      this['im'] = tmp;
+      tmp = res['re'];
+
+      res['re'] = -res['im'];
+      res['im'] = tmp;
+      return res;
+    },
+
+    /**
+     * Calculate the complex acosh
+     *
+     * @returns {Complex}
+     */
+    'acosh': function() {
+
+      // acosh(c) = log(c + sqrt(c^2 - 1))
+
+      var res = this['acos']();
+      if (res['im'] <= 0) {
+        var tmp = res['re'];
+        res['re'] = -res['im'];
+        res['im'] = tmp;
+      } else {
+        var tmp = res['im'];
+        res['im'] = -res['re'];
+        res['re'] = tmp;
+      }
+      return res;
+    },
+
+    /**
+     * Calculate the complex atanh
+     *
+     * @returns {Complex}
+     */
+    'atanh': function() {
+
+      // atanh(c) = log((1+c) / (1-c)) / 2
+
+      var a = this['re'];
+      var b = this['im'];
+
+      var noIM = a > 1 && b === 0;
+      var oneMinus = 1 - a;
+      var onePlus = 1 + a;
+      var d = oneMinus * oneMinus + b * b;
+
+      var x = (d !== 0)
+        ? new Complex(
+          (onePlus * oneMinus - b * b) / d,
+          (b * oneMinus + onePlus * b) / d)
+        : new Complex(
+          (a !== -1) ? (a / 0) : 0,
+          (b !== 0) ? (b / 0) : 0);
+
+      var temp = x['re'];
+      x['re'] = logHypot(x['re'], x['im']) / 2;
+      x['im'] = Math.atan2(x['im'], temp) / 2;
+      if (noIM) {
+        x['im'] = -x['im'];
+      }
+      return x;
+    },
+
+    /**
+     * Calculate the complex acoth
+     *
+     * @returns {Complex}
+     */
+    'acoth': function() {
+
+      // acoth(c) = log((c+1) / (c-1)) / 2
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (a === 0 && b === 0) {
+        return new Complex(0, Math.PI / 2);
+      }
+
+      var d = a * a + b * b;
+      return (d !== 0)
+        ? new Complex(
+          a / d,
+          -b / d).atanh()
+        : new Complex(
+          (a !== 0) ? a / 0 : 0,
+          (b !== 0) ? -b / 0 : 0).atanh();
+    },
+
+    /**
+     * Calculate the complex acsch
+     *
+     * @returns {Complex}
+     */
+    'acsch': function() {
+
+      // acsch(c) = log((1+sqrt(1+c^2))/c)
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (b === 0) {
+
+        return new Complex(
+          (a !== 0)
+            ? Math.log(a + Math.sqrt(a * a + 1))
+            : Infinity, 0);
+      }
+
+      var d = a * a + b * b;
+      return (d !== 0)
+        ? new Complex(
+          a / d,
+          -b / d).asinh()
+        : new Complex(
+          (a !== 0) ? a / 0 : 0,
+          (b !== 0) ? -b / 0 : 0).asinh();
+    },
+
+    /**
+     * Calculate the complex asech
+     *
+     * @returns {Complex}
+     */
+    'asech': function() {
+
+      // asech(c) = log((1+sqrt(1-c^2))/c)
+
+      var a = this['re'];
+      var b = this['im'];
+
+      if (this['isZero']()) {
+        return Complex['INFINITY'];
+      }
+
+      var d = a * a + b * b;
+      return (d !== 0)
+        ? new Complex(
+          a / d,
+          -b / d).acosh()
+        : new Complex(
+          (a !== 0) ? a / 0 : 0,
+          (b !== 0) ? -b / 0 : 0).acosh();
+    },
+
+    /**
+     * Calculate the complex inverse 1/z
+     *
+     * @returns {Complex}
+     */
+    'inverse': function() {
+
+      // 1 / 0 = Infinity and 1 / Infinity = 0
+      if (this['isZero']()) {
+        return Complex['INFINITY'];
+      }
+
+      if (this['isInfinite']()) {
+        return Complex['ZERO'];
+      }
+
+      var a = this['re'];
+      var b = this['im'];
+
+      var d = a * a + b * b;
+
+      return new Complex(a / d, -b / d);
+    },
+
+    /**
+     * Returns the complex conjugate
+     *
+     * @returns {Complex}
+     */
+    'conjugate': function() {
+
+      return new Complex(this['re'], -this['im']);
+    },
+
+    /**
+     * Gets the negated complex number
+     *
+     * @returns {Complex}
+     */
+    'neg': function() {
+
+      return new Complex(-this['re'], -this['im']);
+    },
+
+    /**
+     * Ceils the actual complex number
+     *
+     * @returns {Complex}
+     */
+    'ceil': function(places) {
+
+      places = Math.pow(10, places || 0);
+
+      return new Complex(
+        Math.ceil(this['re'] * places) / places,
+        Math.ceil(this['im'] * places) / places);
+    },
+
+    /**
+     * Floors the actual complex number
+     *
+     * @returns {Complex}
+     */
+    'floor': function(places) {
+
+      places = Math.pow(10, places || 0);
+
+      return new Complex(
+        Math.floor(this['re'] * places) / places,
+        Math.floor(this['im'] * places) / places);
+    },
+
+    /**
+     * Ceils the actual complex number
+     *
+     * @returns {Complex}
+     */
+    'round': function(places) {
+
+      places = Math.pow(10, places || 0);
+
+      return new Complex(
+        Math.round(this['re'] * places) / places,
+        Math.round(this['im'] * places) / places);
+    },
+
+    /**
+     * Compares two complex numbers
+     *
+     * **Note:** new Complex(Infinity).equals(Infinity) === false
+     *
+     * @returns {boolean}
+     */
+    'equals': function(a, b) {
+
+      var z = new Complex(a, b);
+
+      return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&
+        Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];
+    },
+
+    /**
+     * Clones the actual object
+     *
+     * @returns {Complex}
+     */
+    'clone': function() {
+
+      return new Complex(this['re'], this['im']);
+    },
+
+    /**
+     * Gets a string of the actual complex number
+     *
+     * @returns {string}
+     */
+    'toString': function() {
+
+      var a = this['re'];
+      var b = this['im'];
+      var ret = "";
+
+      if (this['isNaN']()) {
+        return 'NaN';
+      }
+
+      if (this['isInfinite']()) {
+        return 'Infinity';
+      }
+
+      if (Math.abs(a) < Complex['EPSILON']) {
+        a = 0;
+      }
+
+      if (Math.abs(b) < Complex['EPSILON']) {
+        b = 0;
+      }
+
+      // If is real number
+      if (b === 0) {
+        return ret + a;
+      }
+
+      if (a !== 0) {
+        ret += a;
+        ret += " ";
+        if (b < 0) {
+          b = -b;
+          ret += "-";
+        } else {
+          ret += "+";
+        }
+        ret += " ";
+      } else if (b < 0) {
+        b = -b;
+        ret += "-";
+      }
+
+      if (1 !== b) { // b is the absolute imaginary part
+        ret += b;
+      }
+      return ret + "i";
+    },
+
+    /**
+     * Returns the actual number as a vector
+     *
+     * @returns {Array}
+     */
+    'toVector': function() {
+
+      return [this['re'], this['im']];
+    },
+
+    /**
+     * Returns the actual real value of the current object
+     *
+     * @returns {number|null}
+     */
+    'valueOf': function() {
+
+      if (this['im'] === 0) {
+        return this['re'];
+      }
+      return null;
+    },
+
+    /**
+     * Determines whether a complex number is not on the Riemann sphere.
+     *
+     * @returns {boolean}
+     */
+    'isNaN': function() {
+      return isNaN(this['re']) || isNaN(this['im']);
+    },
+
+    /**
+     * Determines whether or not a complex number is at the zero pole of the
+     * Riemann sphere.
+     *
+     * @returns {boolean}
+     */
+    'isZero': function() {
+      return this['im'] === 0 && this['re'] === 0;
+    },
+
+    /**
+     * Determines whether a complex number is not at the infinity pole of the
+     * Riemann sphere.
+     *
+     * @returns {boolean}
+     */
+    'isFinite': function() {
+      return isFinite(this['re']) && isFinite(this['im']);
+    },
+
+    /**
+     * Determines whether or not a complex number is at the infinity pole of the
+     * Riemann sphere.
+     *
+     * @returns {boolean}
+     */
+    'isInfinite': function() {
+      return !(this['isNaN']() || this['isFinite']());
+    }
+  };
+
+  Complex['ZERO'] = new Complex(0, 0);
+  Complex['ONE'] = new Complex(1, 0);
+  Complex['I'] = new Complex(0, 1);
+  Complex['PI'] = new Complex(Math.PI, 0);
+  Complex['E'] = new Complex(Math.E, 0);
+  Complex['INFINITY'] = new Complex(Infinity, Infinity);
+  Complex['NAN'] = new Complex(NaN, NaN);
+  Complex['EPSILON'] = 1e-15;
+
+  if (typeof define === 'function' && define['amd']) {
+    define([], function() {
+      return Complex;
+    });
+  } else if (typeof exports === 'object') {
+    Object.defineProperty(Complex, "__esModule", { 'value': true });
+    Complex['default'] = Complex;
+    Complex['Complex'] = Complex;
+    module['exports'] = Complex;
+  } else {
+    root['Complex'] = Complex;
+  }
+
+})(this);
diff --git a/node_modules/complex.js/complex.min.js b/node_modules/complex.js/complex.min.js
new file mode 100644
index 0000000..a9443f0
--- /dev/null
+++ b/node_modules/complex.js/complex.min.js
@@ -0,0 +1,24 @@
+/*
+Complex.js v2.1.1 12/05/2020
+
+Copyright (c) 2022, Robert Eisele (robert@xarg.org)
+Dual licensed under the MIT or GPL Version 2 licenses.
+*/
+(function(q){function n(){throw SyntaxError("Invalid Param");}function p(a,b){var c=Math.abs(a),e=Math.abs(b);if(0===a)return Math.log(e);if(0===b)return Math.log(c);if(3E3>c&&3E3>e)return.5*Math.log(a*a+b*b);a/=2;b/=2;return.5*Math.log(a*a+b*b)+Math.LN2}function d(a,b){if(!(this instanceof d))return new d(a,b);var c={re:0,im:0};if(void 0===a||null===a)c.re=c.im=0;else if(void 0!==b)c.re=a,c.im=b;else switch(typeof a){case "object":"im"in a&&"re"in a?(c.re=a.re,c.im=a.im):"abs"in a&&"arg"in a?!Number.isFinite(a.abs)&&
+Number.isFinite(a.arg)?c=d.INFINITY:(c.re=a.abs*Math.cos(a.arg),c.im=a.abs*Math.sin(a.arg)):"r"in a&&"phi"in a?!Number.isFinite(a.r)&&Number.isFinite(a.phi)?c=d.INFINITY:(c.re=a.r*Math.cos(a.phi),c.im=a.r*Math.sin(a.phi)):2===a.length?(c.re=a[0],c.im=a[1]):n();break;case "string":c.im=c.re=0;var e=a.match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g),f=1,h=0;null===e&&n();for(var l=0;l<e.length;l++){var m=e[l];" "!==m&&"\t"!==m&&"\n"!==m&&("+"===m?f++:"-"===m?h++:("i"===m||"I"===m?(0===f+h&&n()," "===
+e[l+1]||isNaN(e[l+1])?c.im+=parseFloat((h%2?"-":"")+"1"):(c.im+=parseFloat((h%2?"-":"")+e[l+1]),l++)):((0===f+h||isNaN(m))&&n(),"i"===e[l+1]||"I"===e[l+1]?(c.im+=parseFloat((h%2?"-":"")+m),l++):c.re+=parseFloat((h%2?"-":"")+m)),f=h=0))}0<f+h&&n();break;case "number":c.im=0;c.re=a;break;default:n()}this.re=c.re;this.im=c.im}var g=Math.cosh||function(a){return 1E-9>Math.abs(a)?1-a:.5*(Math.exp(a)+Math.exp(-a))},k=Math.sinh||function(a){return 1E-9>Math.abs(a)?a:.5*(Math.exp(a)-Math.exp(-a))};d.prototype=
+{re:0,im:0,sign:function(){var a=this.abs();return new d(this.re/a,this.im/a)},add:function(a,b){var c=new d(a,b);return this.isInfinite()&&c.isInfinite()?d.NAN:this.isInfinite()||c.isInfinite()?d.INFINITY:new d(this.re+c.re,this.im+c.im)},sub:function(a,b){var c=new d(a,b);return this.isInfinite()&&c.isInfinite()?d.NAN:this.isInfinite()||c.isInfinite()?d.INFINITY:new d(this.re-c.re,this.im-c.im)},mul:function(a,b){var c=new d(a,b);return this.isInfinite()&&c.isZero()||this.isZero()&&c.isInfinite()?
+d.NAN:this.isInfinite()||c.isInfinite()?d.INFINITY:0===c.im&&0===this.im?new d(this.re*c.re,0):new d(this.re*c.re-this.im*c.im,this.re*c.im+this.im*c.re)},div:function(a,b){var c=new d(a,b);if(this.isZero()&&c.isZero()||this.isInfinite()&&c.isInfinite())return d.NAN;if(this.isInfinite()||c.isZero())return d.INFINITY;if(this.isZero()||c.isInfinite())return d.ZERO;a=this.re;b=this.im;var e=c.re,f=c.im;if(0===f)return new d(a/e,b/e);if(Math.abs(e)<Math.abs(f))return c=e/f,e=e*c+f,new d((a*c+b)/e,(b*
+c-a)/e);c=f/e;e=f*c+e;return new d((a+b*c)/e,(b-a*c)/e)},pow:function(a,b){var c=new d(a,b);a=this.re;b=this.im;if(c.isZero())return d.ONE;if(0===c.im){if(0===b&&0<a)return new d(Math.pow(a,c.re),0);if(0===a)switch((c.re%4+4)%4){case 0:return new d(Math.pow(b,c.re),0);case 1:return new d(0,Math.pow(b,c.re));case 2:return new d(-Math.pow(b,c.re),0);case 3:return new d(0,-Math.pow(b,c.re))}}if(0===a&&0===b&&0<c.re&&0<=c.im)return d.ZERO;var e=Math.atan2(b,a),f=p(a,b);a=Math.exp(c.re*f-c.im*e);b=c.im*
+f+c.re*e;return new d(a*Math.cos(b),a*Math.sin(b))},sqrt:function(){var a=this.re,b=this.im,c=this.abs();if(0<=a){if(0===b)return new d(Math.sqrt(a),0);var e=.5*Math.sqrt(2*(c+a))}else e=Math.abs(b)/Math.sqrt(2*(c-a));a=0>=a?.5*Math.sqrt(2*(c-a)):Math.abs(b)/Math.sqrt(2*(c+a));return new d(e,0>b?-a:a)},exp:function(){var a=Math.exp(this.re);return new d(a*Math.cos(this.im),a*Math.sin(this.im))},expm1:function(){var a=this.re,b=this.im,c=Math.expm1(a)*Math.cos(b);var e=Math.PI/4;-e>b||b>e?e=Math.cos(b)-
+1:(e=b*b,e*=e*(e*(e*(e*(e*(e*(e/20922789888E3-1/87178291200)+1/479001600)-1/3628800)+1/40320)-1/720)+1/24)-.5);return new d(c+e,Math.exp(a)*Math.sin(b))},log:function(){var a=this.re,b=this.im;return new d(p(a,b),Math.atan2(b,a))},abs:function(){var a=this.re;var b=this.im,c=Math.abs(a),e=Math.abs(b);3E3>c&&3E3>e?a=Math.sqrt(c*c+e*e):(c<e?(c=e,e=a/b):e=b/a,a=c*Math.sqrt(1+e*e));return a},arg:function(){return Math.atan2(this.im,this.re)},sin:function(){var a=this.re,b=this.im;return new d(Math.sin(a)*
+g(b),Math.cos(a)*k(b))},cos:function(){var a=this.re,b=this.im;return new d(Math.cos(a)*g(b),-Math.sin(a)*k(b))},tan:function(){var a=2*this.re,b=2*this.im,c=Math.cos(a)+g(b);return new d(Math.sin(a)/c,k(b)/c)},cot:function(){var a=2*this.re,b=2*this.im,c=Math.cos(a)-g(b);return new d(-Math.sin(a)/c,k(b)/c)},sec:function(){var a=this.re,b=this.im,c=.5*g(2*b)+.5*Math.cos(2*a);return new d(Math.cos(a)*g(b)/c,Math.sin(a)*k(b)/c)},csc:function(){var a=this.re,b=this.im,c=.5*g(2*b)-.5*Math.cos(2*a);return new d(Math.sin(a)*
+g(b)/c,-Math.cos(a)*k(b)/c)},asin:function(){var a=this.re,b=this.im,c=(new d(b*b-a*a+1,-2*a*b)).sqrt();a=(new d(c.re-b,c.im+a)).log();return new d(a.im,-a.re)},acos:function(){var a=this.re,b=this.im,c=(new d(b*b-a*a+1,-2*a*b)).sqrt();a=(new d(c.re-b,c.im+a)).log();return new d(Math.PI/2-a.im,a.re)},atan:function(){var a=this.re,b=this.im;if(0===a){if(1===b)return new d(0,Infinity);if(-1===b)return new d(0,-Infinity)}var c=a*a+(1-b)*(1-b);a=(new d((1-b*b-a*a)/c,-2*a/c)).log();return new d(-.5*a.im,
+.5*a.re)},acot:function(){var a=this.re,b=this.im;if(0===b)return new d(Math.atan2(1,a),0);var c=a*a+b*b;return 0!==c?(new d(a/c,-b/c)).atan():(new d(0!==a?a/0:0,0!==b?-b/0:0)).atan()},asec:function(){var a=this.re,b=this.im;if(0===a&&0===b)return new d(0,Infinity);var c=a*a+b*b;return 0!==c?(new d(a/c,-b/c)).acos():(new d(0!==a?a/0:0,0!==b?-b/0:0)).acos()},acsc:function(){var a=this.re,b=this.im;if(0===a&&0===b)return new d(Math.PI/2,Infinity);var c=a*a+b*b;return 0!==c?(new d(a/c,-b/c)).asin():
+(new d(0!==a?a/0:0,0!==b?-b/0:0)).asin()},sinh:function(){var a=this.re,b=this.im;return new d(k(a)*Math.cos(b),g(a)*Math.sin(b))},cosh:function(){var a=this.re,b=this.im;return new d(g(a)*Math.cos(b),k(a)*Math.sin(b))},tanh:function(){var a=2*this.re,b=2*this.im,c=g(a)+Math.cos(b);return new d(k(a)/c,Math.sin(b)/c)},coth:function(){var a=2*this.re,b=2*this.im,c=g(a)-Math.cos(b);return new d(k(a)/c,-Math.sin(b)/c)},csch:function(){var a=this.re,b=this.im,c=Math.cos(2*b)-g(2*a);return new d(-2*k(a)*
+Math.cos(b)/c,2*g(a)*Math.sin(b)/c)},sech:function(){var a=this.re,b=this.im,c=Math.cos(2*b)+g(2*a);return new d(2*g(a)*Math.cos(b)/c,-2*k(a)*Math.sin(b)/c)},asinh:function(){var a=this.im;this.im=-this.re;this.re=a;var b=this.asin();this.re=-this.im;this.im=a;a=b.re;b.re=-b.im;b.im=a;return b},acosh:function(){var a=this.acos();if(0>=a.im){var b=a.re;a.re=-a.im;a.im=b}else b=a.im,a.im=-a.re,a.re=b;return a},atanh:function(){var a=this.re,b=this.im,c=1<a&&0===b,e=1-a,f=1+a,h=e*e+b*b;a=0!==h?new d((f*
+e-b*b)/h,(b*e+f*b)/h):new d(-1!==a?a/0:0,0!==b?b/0:0);b=a.re;a.re=p(a.re,a.im)/2;a.im=Math.atan2(a.im,b)/2;c&&(a.im=-a.im);return a},acoth:function(){var a=this.re,b=this.im;if(0===a&&0===b)return new d(0,Math.PI/2);var c=a*a+b*b;return 0!==c?(new d(a/c,-b/c)).atanh():(new d(0!==a?a/0:0,0!==b?-b/0:0)).atanh()},acsch:function(){var a=this.re,b=this.im;if(0===b)return new d(0!==a?Math.log(a+Math.sqrt(a*a+1)):Infinity,0);var c=a*a+b*b;return 0!==c?(new d(a/c,-b/c)).asinh():(new d(0!==a?a/0:0,0!==b?-b/
+0:0)).asinh()},asech:function(){var a=this.re,b=this.im;if(this.isZero())return d.INFINITY;var c=a*a+b*b;return 0!==c?(new d(a/c,-b/c)).acosh():(new d(0!==a?a/0:0,0!==b?-b/0:0)).acosh()},inverse:function(){if(this.isZero())return d.INFINITY;if(this.isInfinite())return d.ZERO;var a=this.re,b=this.im,c=a*a+b*b;return new d(a/c,-b/c)},conjugate:function(){return new d(this.re,-this.im)},neg:function(){return new d(-this.re,-this.im)},ceil:function(a){a=Math.pow(10,a||0);return new d(Math.ceil(this.re*
+a)/a,Math.ceil(this.im*a)/a)},floor:function(a){a=Math.pow(10,a||0);return new d(Math.floor(this.re*a)/a,Math.floor(this.im*a)/a)},round:function(a){a=Math.pow(10,a||0);return new d(Math.round(this.re*a)/a,Math.round(this.im*a)/a)},equals:function(a,b){var c=new d(a,b);return Math.abs(c.re-this.re)<=d.EPSILON&&Math.abs(c.im-this.im)<=d.EPSILON},clone:function(){return new d(this.re,this.im)},toString:function(){var a=this.re,b=this.im,c="";if(this.isNaN())return"NaN";if(this.isInfinite())return"Infinity";
+Math.abs(a)<d.EPSILON&&(a=0);Math.abs(b)<d.EPSILON&&(b=0);if(0===b)return c+a;0!==a?(c=c+a+" ",0>b?(b=-b,c+="-"):c+="+",c+=" "):0>b&&(b=-b,c+="-");1!==b&&(c+=b);return c+"i"},toVector:function(){return[this.re,this.im]},valueOf:function(){return 0===this.im?this.re:null},isNaN:function(){return isNaN(this.re)||isNaN(this.im)},isZero:function(){return 0===this.im&&0===this.re},isFinite:function(){return isFinite(this.re)&&isFinite(this.im)},isInfinite:function(){return!(this.isNaN()||this.isFinite())}};
+d.ZERO=new d(0,0);d.ONE=new d(1,0);d.I=new d(0,1);d.PI=new d(Math.PI,0);d.E=new d(Math.E,0);d.INFINITY=new d(Infinity,Infinity);d.NAN=new d(NaN,NaN);d.EPSILON=1E-15;"function"===typeof define&&define.amd?define([],function(){return d}):"object"===typeof exports?(Object.defineProperty(d,"__esModule",{value:!0}),d["default"]=d,d.Complex=d,module.exports=d):q.Complex=d})(this);
\ No newline at end of file
diff --git a/node_modules/complex.js/examples/gamma.js b/node_modules/complex.js/examples/gamma.js
new file mode 100644
index 0000000..c9cfd6d
--- /dev/null
+++ b/node_modules/complex.js/examples/gamma.js
@@ -0,0 +1,31 @@
+/*
+ * A gamma function implementation based on Lanczos Approximation
+ * https://en.wikipedia.org/wiki/Lanczos_approximation
+ */
+
+var Complex = require('../complex');
+
+var P = [Complex(0.99999999999980993),
+  Complex(676.5203681218851), Complex(-1259.1392167224028), Complex(771.32342877765313),
+  Complex(-176.61502916214059), Complex(12.507343278686905), Complex(-0.13857109526572012),
+  Complex(9.9843695780195716e-6), Complex(1.5056327351493116e-7)];
+
+var SQRT2PI = Complex(Math.sqrt(2 * Math.PI));
+
+function gamma(z) {
+
+  z = z.sub(1);
+
+  var x = P[0];
+  var t = z.add(7.5);
+  for (var i = 1; i < P.length; i++) {
+    x = x.add(P[i].div(z.add(i)));
+  }
+  return SQRT2PI.mul(t.pow(z.add(0.5))).mul(t.neg().exp()).mul(x);
+}
+
+var fac = 1;
+for (var i = 1; i <= 10; i++) {
+  console.log(fac, gamma(Complex(i)));
+  fac *= i;
+}
diff --git a/node_modules/complex.js/package.json b/node_modules/complex.js/package.json
new file mode 100644
index 0000000..455a652
--- /dev/null
+++ b/node_modules/complex.js/package.json
@@ -0,0 +1,43 @@
+{
+    "name": "complex.js",
+    "homepage": "https://github.com/infusion/Complex.js",
+    "bugs": "https://github.com/infusion/Complex.js/issues",
+    "title": "complex.js",
+    "version": "2.1.1",
+    "description": "A complex numbers library",
+    "keywords": [
+        "complex numbers",
+        "math",
+        "complex",
+        "number",
+        "calculus",
+        "parser",
+        "arithmetic"
+    ],
+    "author": "Robert Eisele <robert@xarg.org> (http://www.xarg.org/)",
+    "main": "complex",
+    "types": "complex.d.ts",
+    "private": false,
+    "directories": {
+        "example": "examples"
+    },
+    "readmeFilename": "README.md",
+    "license": "MIT",
+    "repository": {
+        "type": "git",
+        "url": "git://github.com/infusion/Complex.js.git"
+    },
+    "funding": {
+        "type": "patreon",
+        "url": "https://www.patreon.com/infusion"
+    },
+    "engines": {
+        "node": "*"
+    },
+    "scripts": {
+        "test": "mocha tests/*.js"
+    },
+    "devDependencies": {
+        "mocha": "*"
+    }
+}
diff --git a/node_modules/complex.js/tests/complex.test.js b/node_modules/complex.js/tests/complex.test.js
new file mode 100644
index 0000000..c5da22d
--- /dev/null
+++ b/node_modules/complex.js/tests/complex.test.js
@@ -0,0 +1,1066 @@
+var assert = require("assert");
+
+var Complex = require("../complex.js");
+
+var functionTests = [{
+  set: Complex.I,
+  fn: "mul",
+  param: Complex(Math.PI).exp(),
+  expect: "23.140692632779267i"
+}, {
+  set: new Complex(1, 4),
+  fn: "mul",
+  param: 3,
+  expect: "3 + 12i"
+}, {
+  set: "4 + 3i",
+  fn: "add",
+  param: "-3 - 2i",
+  expect: "1 + i"
+}, {
+  set: "3i",
+  fn: "add",
+  param: "-2i",
+  expect: "i"
+}, {
+  set: "4",
+  fn: "add",
+  param: "-3",
+  expect: "1"
+}, {
+  set: 9,
+  fn: "sqrt",
+  expect: "3"
+}, {
+  set: -9,
+  fn: "sqrt",
+  expect: "3i"
+}, {
+  set: "-36",
+  fn: "sqrt",
+  expect: "6i"
+}, {
+  set: "36i",
+  fn: "sqrt",
+  expect: "4.242640687119285 + 4.242640687119285i"
+}, {
+  set: Infinity,
+  fn: "mul",
+  param: "i",
+  expect: "Infinity"
+}, {
+  set: "-36i",
+  fn: "sqrt",
+  expect: "4.242640687119285 - 4.242640687119285i"
+}, {
+  set: "4 + 2i",
+  fn: "div",
+  param: "0",
+  expect: "Infinity"
+}, {
+  set: "0",
+  fn: "div",
+  param: Infinity,
+  expect: "0"
+}, {
+  set: -Infinity,
+  fn: "div",
+  param: 0,
+  expect: "Infinity"
+}, {
+  set: Infinity,
+  fn: "div",
+  param: Infinity,
+  expect: "NaN"
+}, {
+  set: 0,
+  fn: "div",
+  param: 0,
+  expect: "NaN"
+}, {
+  set: "4 + 2i",
+  fn: "div",
+  param: "1 + i",
+  expect: "3 - i"
+}, {
+  set: "25",
+  fn: "div",
+  param: "3 - 4i",
+  expect: "3 + 4i"
+}, {
+  set: "3 - 2i",
+  fn: "div",
+  param: "i",
+  expect: "-2 - 3i"
+}, {
+  set: "4i",
+  fn: "mul",
+  param: "-5i",
+  expect: "20"
+}, {
+  set: "3 - 6i",
+  fn: "mul",
+  param: "i",
+  expect: "6 + 3i"
+}, {
+  set: Infinity,
+  fn: "mul",
+  param: 0,
+  expect: "NaN"
+}, {
+  set: "3 + 4i",
+  fn: "add",
+  param: "5 - 7i",
+  expect: "8 - 3i"
+}, {
+  set: Infinity,
+  fn: "add",
+  param: Infinity,
+  expect: "NaN"
+}, {
+  set: -Infinity,
+  fn: "sub",
+  param: -Infinity,
+  expect: "NaN"
+}, {
+  set: "6i",
+  fn: "div",
+  param: "3 - 12i",
+  expect: "-0.47058823529411764 + 0.11764705882352941i"
+}, {
+  set: "36 + 36i",
+  fn: "sqrt",
+  expect: "6.59210468080686 + 2.730539163373364i"
+}, {
+  set: "36 - 36i",
+  fn: "sqrt",
+  expect: "6.59210468080686 - 2.730539163373364i"
+}, {
+  set: "-36 + 36i",
+  fn: "sqrt",
+  expect: "2.730539163373364 + 6.59210468080686i"
+}, {
+  set: "-36 - 36i",
+  fn: "sqrt",
+  expect: "2.730539163373364 - 6.59210468080686i"
+}, {
+  set: "0",
+  fn: "sqrt",
+  expect: "0"
+}, {
+  set: Math.E,
+  fn: "log",
+  expect: "1"
+}, {
+  set: 0,
+  fn: "log",
+  expect: "Infinity"
+}, {
+  set: Infinity,
+  fn: "mul",
+  param: 3,
+  expect: "Infinity"
+}, {
+  set: "-1",
+  fn: "log",
+  expect: Math.PI + "i"
+}, {
+  set: "i",
+  fn: "log",
+  expect: (Math.PI / 2) + "i"
+}, {
+  set: "3 + 2i",
+  fn: "log",
+  expect: Math.log(13) / 2 + " + " + Math.atan2(2, 3) + "i"
+}, {
+  set: "3 - 2i",
+  fn: "log",
+  expect: Math.log(13) / 2 + " - " + Math.atan2(2, 3) + "i"
+}, {
+  set: 1,
+  fn: "exp",
+  expect: "" + Math.E
+}, {
+  set: "i",
+  fn: "exp",
+  expect: Math.cos(1) + " + " + Math.sin(1) + "i"
+}, {
+  set: "i",
+  fn: "mul",
+  param: "i",
+  expect: "-1"
+}, {
+  set: "3 + 2i",
+  fn: "exp",
+  expect: "-8.358532650935372 + 18.263727040666765i"
+}, {
+  set: "3 - 2i",
+  fn: "exp",
+  expect: "-8.358532650935372 - 18.263727040666765i"
+}, {
+  set: "3 - 2i",
+  fn: "expm1",
+  expect: "-9.358532650935372 - 18.263727040666765i"
+}, {
+  set: "0",
+  fn: "expm1",
+  expect: "0"
+}, {
+  set: "1e-6",
+  fn: "expm1",
+  expect: "0.0000010000005000001665"
+}, {
+  set: "1e-5 + 5i",
+  fn: "expm1",
+  expect: "-0.716334977900736 - 0.9589338639538314i"
+}, {
+  set: "1.2e-7 - 2e-6i",
+  fn: "expm1",
+  expect: "1.1999800719976027e-7 - 0.000002000000239998681i"
+}, {
+  set: "3",
+  fn: "pow",
+  param: "3",
+  expect: "27"
+}, {
+  set: -2,
+  fn: "pow",
+  param: 1.5,
+  expect: "-2.82842712474619i"
+}, {
+  set: -8,
+  fn: "pow",
+  param: 1 / 3,
+  expect: "1 + 1.732050807568877i"
+}, {
+  set: -25,
+  fn: "sqrt",
+  expect: "5i"
+}, {
+  set: -25,
+  fn: "pow",
+  param: 0.5,
+  expect: "5i"
+}, {
+  set: "0",
+  fn: "pow",
+  param: "1+i",
+  expect: "0"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "0",
+  expect: "1"
+}, {
+  set: "87",
+  fn: "pow",
+  param: "3",
+  expect: "658503"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "1",
+  expect: "i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "2",
+  expect: "-1"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "3",
+  expect: "-i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "4",
+  expect: "1"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "5",
+  expect: "i"
+}, {
+  set: 7,
+  fn: "pow",
+  param: 2,
+  expect: '49'
+}, {
+  set: 0,
+  fn: "pow",
+  param: 2,
+  expect: '0'
+}, {
+  set: "3i",
+  fn: "pow",
+  param: "3i",
+  expect: "-0.008876640735623678 - 0.0013801328997494863i"
+}, {
+  set: { re: 3, im: 4 },
+  fn: "abs",
+  expect: "5"
+}, {
+  set: { re: 10, im: 24 },
+  fn: "abs",
+  expect: "26"
+}, {
+  set: "+++++--+1 + 4i",
+  fn: "mul",
+  param: "3 + 2i",
+  expect: "-5 + 14i"
+}, {
+  set: "4 + 16i",
+  fn: "div",
+  param: "4.0000",
+  expect: "1 + 4i"
+}, {
+  set: { re: -7.1, im: 2.5 },
+  fn: "neg",
+  expect: "7.1 - 2.5i"
+}, {
+  set: { re: 1, im: 1 },
+  fn: "div",
+  param: { re: 3, im: 4 },
+  expect: 7 / 25 + " - " + 1 / 25 + "i"
+}, {
+  set: new Complex(-7.1, 2.5),
+  fn: "neg",
+  expect: "7.1 - 2.5i"
+}, {
+  set: { re: 1, im: 1 },
+  fn: "arg",
+  expect: "" + Math.PI / 4
+}, {
+  set: { re: -1, im: -1 },
+  fn: "arg",
+  expect: "" + -3 * Math.PI / 4
+}, {
+  set: { re: 0, im: 1 },
+  fn: "arg",
+  expect: "" + Math.PI / 2
+}, {
+  set: { re: 1, im: 0.5 * Math.sqrt(4 / 3) },
+  fn: "arg",
+  expect: "" + Math.PI / 6
+}, {
+  set: "3 + 4i",
+  fn: "conjugate",
+  expect: "3 - 4i"
+}, {
+  set: { re: 99, im: 50 },
+  fn: "conjugate",
+  expect: "99 - 50i"
+}, {
+  set: { re: 0, im: 0 },
+  fn: "conjugate",
+  expect: "0"
+}, {
+  set: { re: 1, im: 23 },
+  fn: "conjugate",
+  expect: "1 - 23i"
+}, {
+  set: "2 + 8i",
+  fn: "div",
+  param: new Complex(1, 2),
+  expect: "3.6 + 0.8i"
+}, {
+  set: "2 + 8i",
+  fn: "div",
+  param: "2 + 8i",
+  expect: "1"
+}, {
+  set: -Infinity,
+  fn: "div",
+  param: 3,
+  expect: "Infinity"
+}, {
+  set: "3+4i",
+  fn: "add",
+  param: "5 - i",
+  expect: "8 + 3i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "add",
+  param: "4 + 6i",
+  expect: "5 + 8i"
+}, {
+  set: { re: 5, im: 8 },
+  fn: "sub",
+  param: "4 + 6i",
+  expect: "1 + 2i"
+}, {
+  set: "3 + 4i",
+  fn: "sub",
+  param: "2 - 5i",
+  expect: "1 + 9i"
+}, {
+  set: "1 + 2i",
+  fn: "pow",
+  param: "2",
+  expect: "-2.999999999999999 + 4.000000000000001i"
+}, {
+  set: "1 + 2i",
+  fn: "pow",
+  param: "1 + 2i",
+  expect: "-0.22251715680177267 + 0.10070913113607541i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "pow",
+  param: new Complex(3, 4),
+  expect: "0.1290095940744669 + 0.03392409290517001i"
+}, {
+  fn: "abs",
+  set: new Complex(3, 4),
+  expect: "5"
+}, {
+  param: 2,
+  fn: "pow",
+  set: new Complex(1, 2),
+  expect: "-2.999999999999999 + 4.000000000000001i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: 7,
+  expect: "-i"
+}, {
+  set: "2+3i",
+  fn: "mul",
+  param: "4+5i",
+  expect: "-7 + 22i"
+}, {
+  set: "3 + 4i",
+  fn: "mul",
+  param: "2 - 5i",
+  expect: "26 - 7i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: 4,
+  expect: "1"
+}, {
+  set: "i",
+  fn: "pow",
+  param: 5,
+  expect: "i"
+}, {
+  set: "0-0i",
+  fn: "pow",
+  param: 2,
+  expect: "0"
+}, {
+  set: "0-0i",
+  fn: "pow",
+  param: 0,
+  expect: "1"
+}, {
+  set: "1 + 4i",
+  fn: "sqrt",
+  expect: "1.600485180440241 + 1.2496210676876531i"
+}, {
+  set: { re: -3, im: 4 },
+  fn: "sqrt",
+  expect: "1 + 2i"
+}, {
+  set: { re: 3, im: -4 },
+  fn: "sqrt",
+  expect: "2 - i"
+}, {
+  set: { re: -3, im: -4 },
+  fn: "sqrt",
+  expect: "1 - 2i"
+}, {
+  set: [-2, 0],
+  fn: "pow",
+  param: 2,
+  expect: "4"
+}, {
+  set: { abs: 1, arg: 0 },
+  fn: "equals",
+  param: { re: 1, im: 0 },
+  expect: "true"
+}, {
+  set: -Complex.E.pow(2),
+  fn: "log",
+  expect: "2 + 3.141592653589793i"
+}, {
+  set: "4 + 3i",
+  fn: "log",
+  expect: "1.6094379124341003 + 0.6435011087932844i"
+}, {
+  set: "4 + 3i",
+  fn: "exp",
+  expect: "-54.051758861078156 + 7.704891372731154i"
+}, {
+  set: "1-2i",
+  fn: "sqrt",
+  expect: "1.272019649514069 - 0.7861513777574233i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "sin",
+  expect: "3.165778513216168 + 1.9596010414216063i"
+}, {
+  set: "i",
+  fn: "cos",
+  expect: "1.5430806348152437"
+}, {
+  set: "i",
+  fn: "acos",
+  expect: "1.5707963267948966 - 0.8813735870195428i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "cos",
+  expect: "2.0327230070196656 - 3.0518977991518i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "tan",
+  expect: "0.03381282607989669 + 1.0147936161466335i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "sinh",
+  expect: "-1.1634403637032504 + 0.21775955162215221i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "cosh",
+  expect: "-1.5276382501165433 + 0.1658444019189788i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "tanh",
+  expect: "0.7680176472869112 - 0.059168539566050726i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "inverse",
+  expect: "0.1 - 0.3i"
+}, {
+  set: "3+4i",
+  fn: "inverse",
+  expect: "0.12 - 0.16i" // 3/25 - (4/25)i
+}, {
+  set: { re: 0.5, im: -0.5 },
+  fn: "inverse",
+  expect: "1 + i"
+}, {
+  set: "1 + i",
+  fn: "inverse",
+  expect: "0.5 - 0.5i"
+}, {
+  set: "0",
+  fn: "inverse",
+  expect: "Infinity"
+}, {
+  set: Infinity,
+  fn: "inverse",
+  expect: "0"
+}, {
+  set: Complex['EPSILON'],
+  fn: "equals",
+  param: 1e-16,
+  expect: "true"
+}, {
+  set: 0,
+  fn: "equals",
+  param: "5i",
+  expect: "false"
+}, {
+  set: 5,
+  fn: "equals",
+  param: "5i",
+  expect: "false"
+}, {
+  set: 5,
+  fn: "equals",
+  param: 5,
+  expect: "true"
+}, {
+  set: "10i",
+  fn: "equals",
+  param: "10i",
+  expect: "true"
+}, {
+  set: "2 + 3i",
+  fn: "equals",
+  param: "2 + 3i",
+  expect: "true"
+}, {
+  set: "2 + 3i",
+  fn: "equals",
+  param: "5i",
+  expect: "false"
+}, {
+  set: "2 + 3i",
+  fn: "round",
+  param: "0",
+  expect: "2 + 3i"
+}, {
+  set: "2.5 + 3.5i",
+  fn: "round",
+  param: "1",
+  expect: "2.5 + 3.5i"
+}, {
+  set: "2.5 + 3.5i",
+  fn: "sign",
+  param: null,
+  expect: "0.5812381937190965 + 0.813733471206735i"
+}, {
+  set: "10 + 24i",
+  fn: "sign",
+  param: null,
+  expect: "0.38461538461538464 + 0.9230769230769231i"
+}, {
+  set: "1e3i",
+  fn: "add",
+  param: "3e-3 + 1e2i",
+  expect: "0.003 + 1100i"
+}, {
+  set: "3.14-4i",
+  fn: "coth",
+  expect: "0.9994481238383576 + 0.0037048958915019857i"
+}, {
+  set: "8i-31",
+  fn: "cot",
+  expect: "1.6636768291213935e-7 - 1.0000001515864902i"
+}, {
+  set: Complex(1, 1).sub(0, 1), // Distance
+  fn: "abs",
+  expect: "1"
+}, {
+  set: Complex(1, 1), // Rotate around center
+  fn: "mul",
+  param: { abs: 1, arg: Math.PI / 2 },
+  expect: "-0.9999999999999999 + i"
+}, {
+  set: Complex(1, 1).sub(0, 1).mul({ abs: 1, arg: Math.PI / 2 }), // Rotate around another point
+  fn: "add",
+  param: "i",
+  expect: "2i"
+}, {
+  set: Complex(0, 10000000000),
+  fn: "log",
+  param: null,
+  expect: "23.025850929940457 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 1000000000000000),
+  fn: "log",
+  param: null,
+  expect: "34.538776394910684 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 100000000000000000),
+  fn: "log",
+  param: null,
+  expect: "39.14394658089878 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 10000000000000000000),
+  fn: "log",
+  param: null,
+  expect: "43.74911676688687 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 1e+30),
+  fn: "log",
+  param: null,
+  expect: "69.07755278982137 + 1.5707963267948966i"
+}, {
+  set: Complex(1, 10000000000),
+  fn: "log",
+  param: null,
+  expect: "23.025850929940454 + 1.5707963266948965i"
+}, {
+  set: Complex(1, 1000000000000000),
+  fn: "log",
+  param: null,
+  expect: "34.538776394910684 + 1.5707963267948957i"
+}, {
+  set: Complex(1, 100000000000000000),
+  fn: "log",
+  param: null,
+  expect: "39.14394658089878 + 1.5707963267948966i"
+}, {
+  set: Complex(1, 10000000000000000000),
+  fn: "log",
+  param: null,
+  expect: "43.74911676688687 + 1.5707963267948966i"
+}, {
+  set: Complex(1, 1e+30),
+  fn: "log",
+  param: null,
+  expect: "69.07755278982137 + 1.5707963267948966i"
+}, {
+  set: Complex(-1, 10000000000),
+  fn: "log",
+  param: null,
+  expect: "23.025850929940454 + 1.5707963268948968i"
+}, {
+  set: Complex(-1, 1000000000000000),
+  fn: "log",
+  param: null,
+  expect: "34.538776394910684 + 1.5707963267948977i"
+}, {
+  set: Complex(-1, 100000000000000000),
+  fn: "log",
+  param: null,
+  expect: "39.14394658089878 + 1.5707963267948968i"
+}, {
+  set: Complex(-1, 10000000000000000000),
+  fn: "log",
+  param: null,
+  expect: "43.74911676688687 + 1.5707963267948966i"
+}, {
+  set: Complex(-1, 1e+30),
+  fn: "log",
+  param: null,
+  expect: "69.07755278982137 + 1.5707963267948966i"
+}];
+
+var constructorTests = [{
+  set: null,
+  expect: "0"
+}, {
+  set: undefined,
+  expect: "0"
+}, {
+  set: "foo",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: {},
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: " + i",
+  expect: "i"
+}, {
+  set: "3+4i",
+  expect: "3 + 4i"
+}, {
+  set: "i",
+  expect: "i"
+}, {
+  set: "3",
+  expect: "3"
+}, {
+  set: [9, 8],
+  expect: "9 + 8i"
+}, {
+  set: "2.3",
+  expect: "2.3"
+}, {
+  set: "2.3",
+  expect: "2.3"
+}, {
+  set: "0",
+  expect: "0"
+}, {
+  set: "-0",
+  expect: "0"
+}, {
+  set: { re: -0, im: 0 },
+  expect: "0"
+}, {
+  set: { re: 0, im: -0 },
+  expect: "0"
+}, {
+  set: Infinity,
+  expect: "Infinity"
+}, {
+  set: -Infinity,
+  expect: "Infinity"
+}, {
+  set: { re: Infinity, im: 0 },
+  expect: "Infinity"
+}, {
+  set: { re: -Infinity, im: 0 },
+  expect: "Infinity"
+}, {
+  set: { re: 0, im: Infinity },
+  expect: "Infinity"
+}, {
+  set: { re: 0, im: -Infinity },
+  expect: "Infinity"
+}, {
+  set: " + 7  - i  +  3i   -  +  +  +  + 43  +  2i  -  i4  +  -  33  +  65 - 1	",
+  expect: "-5"
+}, {
+  set: " + 7  - i  +  3i   -  +  +  +  + 43  +  2i  -  i4  +  -  33  +  65 - 1	 + ",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "-3x + 4",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "- + 7",
+  expect: "-7"
+}, {
+  set: "4 5i",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "-",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "2.2e-1-3.2e-1i",
+  expect: "0.22 - 0.32i"
+}, {
+  set: "2.2.",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: { r: 0, phi: 4 },
+  expect: "0"
+}, {
+  set: { r: 1, phi: 1 },
+  expect: "0.5403023058681398 + 0.8414709848078965i"
+}, {
+  set: { r: Infinity, phi: 0 },
+  expect: "Infinity"
+}, {
+  set: { r: Infinity, phi: 2 },
+  expect: "Infinity"
+}, {
+  set: { r: Infinity, phi: Infinity },
+  expect: "NaN"
+}, {
+  set: { r: Infinity, phi: NaN },
+  expect: "NaN"
+}
+];
+
+for (let i = 0, len = constructorTests.length; i < len; ++i) {
+  if (constructorTests[i].set != null && constructorTests[i].set.hasOwnProperty('r')) {
+    constructorTests.push({
+      set: {
+        abs: constructorTests[i].set.r,
+        arg: constructorTests[i].set.phi,
+      },
+      expect: constructorTests[i].expect
+    })
+  }
+}
+
+
+function stringify(value) {
+  return JSON.stringify(value, function replacer(key, val) {
+    if (typeof val === "number") {
+      return val.toString();
+    }
+    return val;
+  })
+}
+
+function describeTest(test) {
+  var ctor = "new Complex(" + (test.set !== undefined ? stringify(test.set) : "") + ")";
+
+  var fnCall = test.fn == null
+    ? ""
+    : "." + test.fn + "(" + (test.param !== undefined ? stringify(test.param) : "") + ")";
+
+  var expectedResult = test.expect == null
+    ? ""
+    : " === " + stringify(test.expect);
+
+  var error = test.error == null
+    ? ""
+    : " should throw " + test.error;
+
+  return ctor + fnCall + expectedResult + error;
+}
+
+describe("Complex functions", function () {
+
+  for (var i = 0; i < functionTests.length; i++) {
+
+    (function (test) {
+
+      it(describeTest(test), function () {
+        if (test.error) {
+          try {
+            new Complex(test.set)[test.fn](test.param);
+          } catch (e) {
+            assert.strictEqual(e.toString(), test.error.toString());
+          }
+        } else {
+          assert.strictEqual(new Complex(test.set)[test.fn](test.param).toString(), test.expect);
+        }
+      });
+    })(functionTests[i]);
+  }
+});
+
+describe("Complex constructor", function () {
+
+  for (var i = 0; i < constructorTests.length; i++) {
+
+    (function (test) {
+      it(describeTest(test), function () {
+        if (test.error) {
+          try {
+            new Complex(test.set);
+          } catch (e) {
+            assert.strictEqual(e.toString(), test.error.toString());
+          }
+        } else {
+          assert.strictEqual(new Complex(test.set).toString(), test.expect);
+        }
+      });
+    })(constructorTests[i]);
+  }
+});
+
+describe("Complex Details", function () {
+
+  it("should work with different params", function () {
+    assert.strictEqual(Complex(1, -1).toString(), "1 - i");
+    assert.strictEqual(Complex(0, 0).toString(), "0");
+    assert.strictEqual(Complex(0, 2).toString(), "2i");
+    assert.strictEqual(Complex.I.toString(), "i");
+    assert.strictEqual(Complex(0, -2).toString(), "-2i");
+    assert.strictEqual(Complex({ re: 0, im: -2 }).toString(), "-2i");
+  });
+
+  it("Complex Combinations", function () {
+
+    var zero = Complex(0, 0), one = Complex(1, 1), two = Complex(2, 2);
+
+    assert.strictEqual(zero.toString(), "0");
+    assert.strictEqual(one.toString(), "1 + i");
+    assert(one.neg().equals(Complex(-1, -1)));
+    assert(one.conjugate().equals(Complex(1, -1)));
+    assert.strictEqual(one.abs(), Math.SQRT2);
+    assert.strictEqual(one.arg(), Math.PI / 4);
+    assert.strictEqual(one.add(one).toString(), two.toString());
+    assert.strictEqual(one.sub(one).toString(), zero.toString());
+    assert.strictEqual(one.mul(2).toString(), two.toString());
+    assert.strictEqual(one.mul(one).toString(), Complex(0, 2).toString());
+    assert.strictEqual(one.div(2).toString(), "0.5 + 0.5i");
+    assert.strictEqual(one.div(one).toString(), "1");
+    assert.strictEqual(one.div(0).toString(), "Infinity");
+    assert.strictEqual(one.exp().toString(), "1.4686939399158851 + 2.2873552871788423i");
+    assert.strictEqual(one.log().toString(), "0.34657359027997264 + 0.7853981633974483i");
+    assert.strictEqual(one.pow(one).toString(), "0.2739572538301211 + 0.5837007587586147i");
+    assert.strictEqual(one.pow(zero).toString(), "1");
+    assert.strictEqual(one.sqrt().toString(), "1.09868411346781 + 0.45508986056222733i");
+    assert.strictEqual(one.sin().toString(), "1.2984575814159773 + 0.6349639147847361i");
+    assert.strictEqual(one.cos().toString(), "0.8337300251311491 - 0.9888977057628651i");
+    assert.strictEqual(one.tan().toString(), "0.27175258531951174 + 1.0839233273386948i");
+    assert.strictEqual(one.asin().toString(), "0.6662394324925153 + 1.0612750619050355i");
+    assert.strictEqual(one.acos().toString(), "0.9045568943023813 - 1.0612750619050355i");
+    assert.strictEqual(one.atan().toString(), "1.0172219678978514 + 0.40235947810852507i");
+
+    assert.strictEqual(Complex(3, 4).abs(), 5);
+
+    assert.strictEqual(Complex("5i + 3").log().exp().toString(), "3 + 5i")
+    assert.strictEqual(Complex("-2i - 1").log().exp().toString(), "-1 - 2i")
+  });
+
+  it("should calculate distributed conjugate", function () {
+
+    var c1 = Complex(7, 3);
+    var c2 = Complex(1, 2);
+
+    var r1 = c1.add(c2).conjugate();
+    var r2 = c1.conjugate().add(c2.conjugate());
+
+    assert.strictEqual(r1.toString(), r2.toString());
+  });
+
+  it("should be raised to power of 6", function () {
+    var c1 = Complex(2, 2);
+
+    var t = c1.pow(6);
+
+    assert.strictEqual(t.toString(), "-9.405287417451663e-14 - 511.9999999999995i");
+  });
+
+  it("should handle inverse trig fns", function () {
+
+    var values = [
+      new Complex(2.3, 1.4),
+      new Complex(-2.3, 1.4),
+      new Complex(-2.3, -1.4),
+      new Complex(2.3, -1.4)];
+
+    var fns = ['sin', 'cos', 'tan'];
+
+    for (var i = 0; i < values.length; i++) {
+
+      for (var j = 0; j < 3; j++) {
+
+        var a = values[i]['a' + fns[j]]()[fns[j]]();
+
+        var res = values[i];
+
+        assert(Math.abs(a.re - res.re) < 1e-12 && Math.abs(a.im - res.im) < 1e-12);
+      }
+    }
+  });
+
+  it('should handle get real part', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: Math.PI / 4 }).re, Math.SQRT2 / 2);
+  });
+
+  it('should handle get complex part', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: Math.PI / 4 }).im, 0.7071067811865475);
+  });
+
+  it('should handle sum', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).add({ abs: 1, arg: Math.PI / 2 }).abs(), Math.SQRT2);
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).add({ abs: 1, arg: Math.PI / 2 }).arg(), Math.PI / 4);
+  });
+
+  it('should handle conjugate', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: Math.PI / 4 }).conjugate().toString(), Complex({ abs: 1, arg: -Math.PI / 4 }).toString());
+  });
+
+  it('should handle substract', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).sub({ abs: 1, arg: Math.PI / 2 }).abs().toString(), "1.414213562373095");
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).sub({ abs: 1, arg: Math.PI / 2 }).arg().toString(), "-0.7853981633974484");
+  });
+
+  it('should handle arg for the first quadrant', function () {
+    assert.strictEqual(Complex({ re: 1, im: 1 }).arg(), Math.PI / 4);
+  });
+
+  it('should handle arg for the second quadrant', function () {
+    assert.strictEqual(Complex({ re: -1, im: 1 }).arg(), 3 * Math.PI / 4);
+  });
+
+  it('should handle arg for the third quadrant', function () {
+    assert.strictEqual(Complex({ re: -1, im: -1 }).arg(), -3 * Math.PI / 4);
+  });
+
+  it('should handle arg for the fourth quadrant', function () {
+    assert.strictEqual(Complex({ re: 1, im: -1 }).arg(), -Math.PI / 4);
+  });
+
+  it('should handle arg for the fourth and first quadrant', function () {
+    assert.strictEqual(Complex({ re: 1, im: 0 }).arg(), 0);
+  });
+
+  it('should handle arg for first and second quadrant', function () {
+    assert.strictEqual(Complex({ re: 0, im: 1 }).arg(), Math.PI / 2);
+  });
+
+  it('should handle arg for the second and third quadrant', function () {
+    assert.strictEqual(Complex({ re: -1, im: 0 }).arg(), Math.PI);
+  });
+
+  it('should handle arg for the third and fourth quadrant', function () {
+    assert.strictEqual(Complex({ re: 0, im: -1 }).arg(), -Math.PI / 2);
+  });
+
+  it("should eat its own dog food", function () {
+
+    var a = Complex(1, -5).toString();
+    var b = Complex(a).toString();
+    var c = Complex(b).mul(a);
+
+    assert.strictEqual(c.toString(), '-24 - 10i');
+  });
+
+  it("should calculate the absolute value of i", function () {
+
+    var a = Complex("i").sign().inverse().mul("i");
+
+    assert.strictEqual(a.toString(), '1');
+  });
+
+  it('should take the natural logarithm', function () {
+    var n = Complex(Math.E * Math.E).log().div("i").mul(-Math.PI * 2, 1);
+
+    assert.strictEqual(n.toString(), '2 + ' + 4 * Math.PI + "i");
+  });
+
+});
diff --git a/node_modules/decimal.js/CHANGELOG.md b/node_modules/decimal.js/CHANGELOG.md
new file mode 100644
index 0000000..cb4f59f
--- /dev/null
+++ b/node_modules/decimal.js/CHANGELOG.md
@@ -0,0 +1,231 @@
+#### 10.3.1
+* 25/06/2021
+* Remove minified versions. Refresh *README*.
+
+#### 10.3.0
+* 22/06/2021
+* Support underscores as separators.
+* #101 Add `Decimal.clamp` method.
+* #161 Fix Decimal instances deemed plain objects.
+* #100 Add `Decimal.sum` method.
+* #146 `Symbol.for` to `Symbol['for']` for IE8.
+* #132 Fix possible infinite loop when `minE` is very low.
+* #180 Accept Decimals of different origin.
+* Update Typescript definitions.
+* Update minification examples in *README*.
+* Add minified versions for both *decimal.js* and *decimal.mjs*.
+* Add *files* field to *package.json*, and remove build script.
+
+#### 10.2.1
+* 28/09/2020
+* Correct `sqrt` initial estimate.
+
+#### 10.2.0
+* 08/05/2019
+* #128 Workaround V8 `Math.pow` change.
+* #93 Accept `+` prefix when parsing string values.
+* #129 Fix typo.
+
+#### 10.1.1
+* 27/02/2019
+* Check `Symbol` properly.
+
+#### 10.1.0
+* 26/02/2019
+* #122 Add custom `util.inspect()` function.
+* Add `Symbol.toStringTag`.
+* #121 Constructor: add range check for arguments of type number and Decimal.
+* Remove premable from uglifyjs build script.
+* Move *decimal.min.js.map* to root directory.
+
+#### 10.0.2
+* 13/12/2018
+* #114 Remove soureMappingURL from *decimal.min.js*.
+* Remove *bower.json*.
+
+#### 10.0.1
+* 24/05/2018
+* Add `browser` field to *package.json*.
+
+#### 10.0.0
+* 10/03/2018
+* #88 `toNearest` to return the nearest multiple in the direction of the rounding mode.
+* #82 #91 `const` to `var`.
+* Add trigonometric precision limit explanantion to documentation.
+* Put global ts definitions in separate file (see *bignumber.js* #143).
+
+#### 9.0.1
+* 15/12/2017
+* #80 Typings: correct return type.
+
+#### 9.0.0
+* 14/12/2017
+* #78 Typings: remove `toFormat`.
+
+#### 8.0.0
+* 10/12/2017
+* Correct typings: `toFraction` returns `Decimal[]`.
+* Type-checking: add `Decimal.isDecimal` method.
+* Enable configuration reset with `defaults: true`.
+* Add named export, Decimal, to *decimal.mjs*.
+
+#### 7.5.1
+* 03/12/2017
+* Remove typo.
+
+#### 7.5.0
+* 03/12/2017
+* Use TypeScript declarations outside modules.
+
+#### 7.4.0
+* 25/11/2017
+* Add TypeScript typings.
+
+#### 7.3.0
+* 26/09/2017
+* Rename *decimal.es6.js* to *decimal.mjs*.
+* Amend  *.travis.yml*.
+
+#### 7.2.4
+* 09/09/2017
+* Update docs regarding `global.crypto`.
+* Fix `import` issues.
+
+#### 7.2.3
+* 27/06/2017
+* Bugfix: #58 `pow` sometimes throws when result is `Infinity`.
+
+#### 7.2.2
+* 25/06/2017
+* Bugfix: #57 Powers of -1 for integers over `Number.MAX_SAFE_INTEGER`.
+
+#### 7.2.1
+* 04/05/2017
+* Fix *README* badges.
+
+#### 7.2.0
+* 09/04/2017
+* Add *decimal.es6.js*
+
+#### 7.1.2
+* 05/04/2017
+* `Decimal.default` to `Decimal['default']` IE8 issue
+
+#### 7.1.1
+* 10/01/2017
+* Remove duplicated for-loop
+* Minor refactoring
+
+#### 7.1.0
+* 09/11/2016
+* Support ES6 imports.
+
+#### 7.0.0
+* 09/11/2016
+* Remove `require('crypto')` - leave it to the user
+* Default `Decimal.crypto` to `false`
+* Add `Decimal.set` as `Decimal.config` alias
+
+#### 6.0.0
+* 30/06/2016
+* Removed base-88 serialization format
+* Amended `toJSON` and removed `Decimal.fromJSON` accordingly
+
+#### 5.0.8
+* 09/03/2016
+* Add newline to single test results
+* Correct year
+
+#### 5.0.7
+* 29/02/2016
+* Add decimal.js-light link
+* Remove outdated example from docs
+
+#### 5.0.6
+* 22/02/2016
+* Add bower.json
+
+#### 5.0.5
+* 20/02/2016
+* Bugfix: #26 wrong precision applied
+
+#### 5.0.4
+* 14/02/2016
+* Bugfix: #26 clone
+
+#### 5.0.3
+* 06/02/2016
+* Refactor tests
+
+#### 5.0.2
+* 05/02/2016
+* Added immutability tests
+* Minor *decimal.js* clean-up
+
+#### 5.0.1
+* 28/01/2016
+* Bugfix: #20 cos mutates value
+* Add pi info to docs
+
+#### 5.0.0
+* 25/01/2016
+* Added trigonometric functions and `cubeRoot` method
+* Added most of JavaScript's `Math` object methods as Decimal methods
+* Added `toBinary`, `toHexadecimal` and `toOctal` methods
+* Added `isPositive` method
+* Removed the 15 significant digit limit for numbers
+* `toFraction` now returns an array of two Decimals, not two strings
+* String values containing whitespace or a plus sign are no longer accepted
+* `valueOf` now returns `'-0'` for minus zero
+* `comparedTo` now returns `NaN` not `null` for comparisons with `NaN`
+* `Decimal.max` and `Decimal.min` no longer accept an array
+* The Decimal constructor and `toString` no longer accept a base argument
+* Binary, hexadecimal and octal prefixes are now recognised for string values
+* Removed `Decimal.errors` configuration property
+* Removed `toFormat` method
+* Removed `Decimal.ONE`
+* Renamed `exponential` method to `naturalExponential`
+* Renamed `Decimal.constructor` method to `Decimal.clone`
+* Simplified error handling and amended error messages
+* Refactored the test suite
+* `Decimal.crypto` is now `undefined` by default, and the `crypto` object will be used if available
+* Major internal refactoring
+* Removed *bower.json*
+
+#### 4.0.2
+* 20/02/2015 Add bower.json. Add source map. Amend travis CI. Amend doc/comments
+
+#### 4.0.1
+* 11/12/2014 Assign correct constructor when duplicating a Decimal
+
+#### 4.0.0
+* 10/11/2014 `toFormat` amended to use `Decimal.format` object for more flexible configuration
+
+#### 3.0.1
+* 8/06/2014 Surround crypto require in try catch. See issue #5
+
+#### 3.0.0
+* 4/06/2014 `random` simplified. Major internal changes mean the properties of a Decimal must now be considered read-only
+
+#### 2.1.0
+* 4/06/2014 Amend UMD
+
+#### 2.0.3
+* 8/05/2014 Fix NaN toNumber
+
+#### 2.0.2
+* 30/04/2014 Correct doc links
+
+#### 2.0.1
+* 10/04/2014 Update npmignore
+
+#### 2.0.0
+* 10/04/2014 Add `toSignificantDigits`
+* Remove `toInteger`
+* No arguments to `ceil`, `floor`, `round` and `trunc`
+
+#### 1.0.1
+* 07/04/2014 Minor documentation clean-up
+
+#### 1.0.0
+* 02/04/2014 Initial release
diff --git a/node_modules/decimal.js/LICENCE.md b/node_modules/decimal.js/LICENCE.md
new file mode 100644
index 0000000..ead2f60
--- /dev/null
+++ b/node_modules/decimal.js/LICENCE.md
@@ -0,0 +1,23 @@
+The MIT Licence.
+
+Copyright (c) 2021 Michael Mclaughlin
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
diff --git a/node_modules/decimal.js/README.md b/node_modules/decimal.js/README.md
new file mode 100644
index 0000000..3bc5c94
--- /dev/null
+++ b/node_modules/decimal.js/README.md
@@ -0,0 +1,246 @@
+![decimal.js](https://raw.githubusercontent.com/MikeMcl/decimal.js/gh-pages/decimaljs.png)
+
+An arbitrary-precision Decimal type for JavaScript.
+
+[![npm version](https://img.shields.io/npm/v/decimal.js.svg)](https://www.npmjs.com/package/decimal.js)
+[![npm downloads](https://img.shields.io/npm/dw/decimal.js)](https://www.npmjs.com/package/decimal.js)
+[![Build Status](https://travis-ci.org/MikeMcl/decimal.js.svg)](https://travis-ci.org/MikeMcl/decimal.js)
+[![CDNJS](https://img.shields.io/cdnjs/v/decimal.js.svg)](https://cdnjs.com/libraries/decimal.js)
+
+<br>
+
+## Features
+
+  - Integers and floats
+  - Simple but full-featured API
+  - Replicates many of the methods of JavaScript's `Number.prototype` and `Math` objects
+  - Also handles hexadecimal, binary and octal values
+  - Faster, smaller, and perhaps easier to use than JavaScript versions of Java's BigDecimal
+  - No dependencies
+  - Wide platform compatibility: uses JavaScript 1.5 (ECMAScript 3) features only
+  - Comprehensive [documentation](https://mikemcl.github.io/decimal.js/) and test set
+  - Used under the hood by [math.js](https://github.com/josdejong/mathjs)
+  - Includes a TypeScript declaration file: *decimal.d.ts*
+
+![API](https://raw.githubusercontent.com/MikeMcl/decimal.js/gh-pages/API.png)
+
+The library is similar to [bignumber.js](https://github.com/MikeMcl/bignumber.js/), but here
+precision is specified in terms of significant digits rather than decimal places, and all
+calculations are rounded to the precision (similar to Python's decimal module) rather than just
+those involving division.
+
+This library also adds the trigonometric functions, among others, and supports non-integer powers,
+which makes it a significantly larger library than *bignumber.js* and the even smaller
+[big.js](https://github.com/MikeMcl/big.js/).
+
+For a lighter version of this library without the trigonometric functions see
+[decimal.js-light](https://github.com/MikeMcl/decimal.js-light/).
+
+## Load
+
+The library is the single JavaScript file *decimal.js* or ES module *decimal.mjs*.
+
+Browser:
+
+```html
+<script src='path/to/decimal.js'></script>
+
+<script type="module">
+  import Decimal from './path/to/decimal.mjs';
+  ...
+</script>
+```
+
+[Node.js](https://nodejs.org):
+
+```bash
+npm install decimal.js
+```
+```js
+const Decimal = require('decimal.js');
+
+import Decimal from 'decimal.js';
+
+import {Decimal} from 'decimal.js';
+```
+
+## Use
+
+*In all examples below, semicolons and `toString` calls are not shown.
+If a commented-out value is in quotes it means `toString` has been called on the preceding expression.*
+
+The library exports a single constructor function, `Decimal`, which expects a single argument that is a number, string or Decimal instance.
+
+```js
+x = new Decimal(123.4567)
+y = new Decimal('123456.7e-3')
+z = new Decimal(x)
+x.equals(y) && y.equals(z) && x.equals(z)        // true
+```
+
+If using values with more than a few digits, it is recommended to pass strings rather than numbers to avoid a potential loss of precision.
+
+```js
+// Precision loss from using numeric literals with more than 15 significant digits.
+new Decimal(1.0000000000000001)         // '1'
+new Decimal(88259496234518.57)          // '88259496234518.56'
+new Decimal(99999999999999999999)       // '100000000000000000000'
+
+// Precision loss from using numeric literals outside the range of Number values.
+new Decimal(2e+308)                     // 'Infinity'
+new Decimal(1e-324)                     // '0'
+
+// Precision loss from the unexpected result of arithmetic with Number values.
+new Decimal(0.7 + 0.1)                  // '0.7999999999999999'
+```
+
+As with JavaScript numbers, strings can contain underscores as separators to improve readability.
+
+```js
+x = new Decimal('2_147_483_647')
+```
+
+String values in binary, hexadecimal or octal notation are also accepted if the appropriate prefix is included.
+
+```js
+x = new Decimal('0xff.f')            // '255.9375'
+y = new Decimal('0b10101100')        // '172'
+z = x.plus(y)                        // '427.9375'
+
+z.toBinary()                         // '0b110101011.1111'
+z.toBinary(13)                       // '0b1.101010111111p+8'
+
+// Using binary exponential notation to create a Decimal with the value of `Number.MAX_VALUE`.
+x = new Decimal('0b1.1111111111111111111111111111111111111111111111111111p+1023')
+// '1.7976931348623157081e+308'
+```
+
+Decimal instances are immutable in the sense that they are not changed by their methods.
+
+```js
+0.3 - 0.1                     // 0.19999999999999998
+x = new Decimal(0.3)
+x.minus(0.1)                  // '0.2'
+x                             // '0.3'
+```
+
+The methods that return a Decimal can be chained.
+
+```js
+x.dividedBy(y).plus(z).times(9).floor()
+x.times('1.23456780123456789e+9').plus(9876.5432321).dividedBy('4444562598.111772').ceil()
+```
+
+Many method names have a shorter alias.
+
+```js
+x.squareRoot().dividedBy(y).toPower(3).equals(x.sqrt().div(y).pow(3))     // true
+x.comparedTo(y.modulo(z).negated() === x.cmp(y.mod(z).neg())              // true
+```
+
+Most of the methods of JavaScript's `Number.prototype` and `Math` objects are replicated.
+
+```js
+x = new Decimal(255.5)
+x.toExponential(5)                       // '2.55500e+2'
+x.toFixed(5)                             // '255.50000'
+x.toPrecision(5)                         // '255.50'
+
+Decimal.sqrt('6.98372465832e+9823')      // '8.3568682281821340204e+4911'
+Decimal.pow(2, 0.0979843)                // '1.0702770511687781839'
+
+// Using `toFixed()` to avoid exponential notation:
+x = new Decimal('0.0000001')
+x.toString()                             // '1e-7'
+x.toFixed()                              // '0.0000001'
+```
+
+And there are `isNaN` and `isFinite` methods, as `NaN` and `Infinity` are valid `Decimal` values.
+
+```js
+x = new Decimal(NaN)                                           // 'NaN'
+y = new Decimal(Infinity)                                      // 'Infinity'
+x.isNaN() && !y.isNaN() && !x.isFinite() && !y.isFinite()      // true
+```
+
+There is also a `toFraction` method with an optional *maximum denominator* argument.
+
+```js
+z = new Decimal(355)
+pi = z.dividedBy(113)        // '3.1415929204'
+pi.toFraction()              // [ '7853982301', '2500000000' ]
+pi.toFraction(1000)          // [ '355', '113' ]
+```
+
+All calculations are rounded according to the number of significant digits and rounding mode specified
+by the `precision` and `rounding` properties of the Decimal constructor.
+
+For advanced usage, multiple Decimal constructors can be created, each with their own independent
+configuration which applies to all Decimal numbers created from it.
+
+```js
+// Set the precision and rounding of the default Decimal constructor
+Decimal.set({ precision: 5, rounding: 4 })
+
+// Create another Decimal constructor, optionally passing in a configuration object
+Dec = Decimal.clone({ precision: 9, rounding: 1 })
+
+x = new Decimal(5)
+y = new Dec(5)
+
+x.div(3)                           // '1.6667'
+y.div(3)                           // '1.66666666'
+```
+
+The value of a Decimal is stored in a floating point format in terms of its digits, exponent and sign, but these properties should be considered read-only.
+
+```js
+x = new Decimal(-12345.67);
+x.d                            // [ 12345, 6700000 ]    digits (base 10000000)
+x.e                            // 4                     exponent (base 10)
+x.s                            // -1                    sign
+```
+
+For further information see the [API](http://mikemcl.github.io/decimal.js/) reference in the *doc* directory.
+
+## Test
+
+To run the tests using Node.js from the root directory:
+
+```bash
+npm test
+```
+
+Each separate test module can also be executed individually, for example:
+
+```bash
+node test/modules/toFraction
+```
+
+To run the tests in a browser, open *test/test.html*.
+
+## Minify
+
+Two minification examples:
+
+Using [uglify-js](https://github.com/mishoo/UglifyJS) to minify the *decimal.js* file:
+
+```bash
+npm install uglify-js -g
+uglifyjs decimal.js --source-map url=decimal.min.js.map -c -m -o decimal.min.js
+```
+
+Using [terser](https://github.com/terser/terser) to minify the ES module version, *decimal.mjs*:
+
+```bash
+npm install terser -g
+terser decimal.mjs --source-map url=decimal.min.mjs.map -c -m --toplevel -o decimal.min.mjs
+```
+
+```js
+import Decimal from './decimal.min.mjs';
+```
+
+## Licence
+
+[The MIT Licence (Expat).](LICENCE.md)
diff --git a/node_modules/decimal.js/decimal.d.ts b/node_modules/decimal.js/decimal.d.ts
new file mode 100644
index 0000000..4539dbe
--- /dev/null
+++ b/node_modules/decimal.js/decimal.d.ts
@@ -0,0 +1,300 @@
+// Type definitions for decimal.js >=7.0.0
+// Project: https://github.com/MikeMcl/decimal.js
+// Definitions by: Michael Mclaughlin <https://github.com/MikeMcl>
+// Definitions: https://github.com/MikeMcl/decimal.js
+//
+// Documentation: http://mikemcl.github.io/decimal.js/
+//
+// Exports:
+//
+//   class     Decimal (default export)
+//   type      Decimal.Constructor
+//   type      Decimal.Instance
+//   type      Decimal.Modulo
+//   type      Decimal.Rounding
+//   type      Decimal.Value
+//   interface Decimal.Config
+//
+// Example (alternative syntax commented-out):
+//
+//   import {Decimal} from "decimal.js"
+//   //import Decimal from "decimal.js"
+//
+//   let r: Decimal.Rounding = Decimal.ROUND_UP;
+//   let c: Decimal.Configuration = {precision: 4, rounding: r};
+//   Decimal.set(c);
+//   let v: Decimal.Value = '12345.6789';
+//   let d: Decimal = new Decimal(v);
+//   //let d: Decimal.Instance = new Decimal(v);
+//
+// The use of compiler option `--strictNullChecks` is recommended.
+
+export default Decimal;
+
+export namespace Decimal {
+  export type Constructor = typeof Decimal;
+  export type Instance = Decimal;
+  export type Rounding = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8;
+  export type Modulo = Rounding | 9;
+  export type Value = string | number | Decimal;
+
+  // http://mikemcl.github.io/decimal.js/#constructor-properties
+  export interface Config {
+    precision?: number;
+    rounding?: Rounding;
+    toExpNeg?: number;
+    toExpPos?: number;
+    minE?: number;
+    maxE?: number;
+    crypto?: boolean;
+    modulo?: Modulo;
+    defaults?: boolean;
+  }
+}
+
+export declare class Decimal {
+  readonly d: number[];
+  readonly e: number;
+  readonly s: number;
+  private readonly toStringTag: string;
+
+  constructor(n: Decimal.Value);
+
+  absoluteValue(): Decimal;
+  abs(): Decimal;
+
+  ceil(): Decimal;
+  
+  clampedTo(min: Decimal.Value, max: Decimal.Value): Decimal;
+  clamp(min: Decimal.Value, max: Decimal.Value): Decimal;
+
+  comparedTo(n: Decimal.Value): number;
+  cmp(n: Decimal.Value): number;
+
+  cosine(): Decimal;
+  cos(): Decimal;
+
+  cubeRoot(): Decimal;
+  cbrt(): Decimal;
+
+  decimalPlaces(): number;
+  dp(): number;
+
+  dividedBy(n: Decimal.Value): Decimal;
+  div(n: Decimal.Value): Decimal;
+
+  dividedToIntegerBy(n: Decimal.Value): Decimal;
+  divToInt(n: Decimal.Value): Decimal;
+
+  equals(n: Decimal.Value): boolean;
+  eq(n: Decimal.Value): boolean;
+
+  floor(): Decimal;
+
+  greaterThan(n: Decimal.Value): boolean;
+  gt(n: Decimal.Value): boolean;
+
+  greaterThanOrEqualTo(n: Decimal.Value): boolean;
+  gte(n: Decimal.Value): boolean;
+
+  hyperbolicCosine(): Decimal;
+  cosh(): Decimal;
+
+  hyperbolicSine(): Decimal;
+  sinh(): Decimal;
+
+  hyperbolicTangent(): Decimal;
+  tanh(): Decimal;
+
+  inverseCosine(): Decimal;
+  acos(): Decimal;
+
+  inverseHyperbolicCosine(): Decimal;
+  acosh(): Decimal;
+
+  inverseHyperbolicSine(): Decimal;
+  asinh(): Decimal;
+
+  inverseHyperbolicTangent(): Decimal;
+  atanh(): Decimal;
+
+  inverseSine(): Decimal;
+  asin(): Decimal;
+
+  inverseTangent(): Decimal;
+  atan(): Decimal;
+
+  isFinite(): boolean;
+
+  isInteger(): boolean;
+  isInt(): boolean;
+
+  isNaN(): boolean;
+
+  isNegative(): boolean;
+  isNeg(): boolean;
+
+  isPositive(): boolean;
+  isPos(): boolean;
+
+  isZero(): boolean;
+
+  lessThan(n: Decimal.Value): boolean;
+  lt(n: Decimal.Value): boolean;
+
+  lessThanOrEqualTo(n: Decimal.Value): boolean;
+  lte(n: Decimal.Value): boolean;
+
+  logarithm(n?: Decimal.Value): Decimal;
+  log(n?: Decimal.Value): Decimal;
+
+  minus(n: Decimal.Value): Decimal;
+  sub(n: Decimal.Value): Decimal;
+
+  modulo(n: Decimal.Value): Decimal;
+  mod(n: Decimal.Value): Decimal;
+
+  naturalExponential(): Decimal;
+  exp(): Decimal;
+
+  naturalLogarithm(): Decimal;
+  ln(): Decimal;
+
+  negated(): Decimal;
+  neg(): Decimal;
+
+  plus(n: Decimal.Value): Decimal;
+  add(n: Decimal.Value): Decimal;
+
+  precision(includeZeros?: boolean): number;
+  sd(includeZeros?: boolean): number;
+
+  round(): Decimal;
+
+  sine() : Decimal;
+  sin() : Decimal;
+
+  squareRoot(): Decimal;
+  sqrt(): Decimal;
+
+  tangent() : Decimal;
+  tan() : Decimal;
+
+  times(n: Decimal.Value): Decimal;
+  mul(n: Decimal.Value) : Decimal;
+
+  toBinary(significantDigits?: number): string;
+  toBinary(significantDigits: number, rounding: Decimal.Rounding): string;
+
+  toDecimalPlaces(decimalPlaces?: number): Decimal;
+  toDecimalPlaces(decimalPlaces: number, rounding: Decimal.Rounding): Decimal;
+  toDP(decimalPlaces?: number): Decimal;
+  toDP(decimalPlaces: number, rounding: Decimal.Rounding): Decimal;
+
+  toExponential(decimalPlaces?: number): string;
+  toExponential(decimalPlaces: number, rounding: Decimal.Rounding): string;
+
+  toFixed(decimalPlaces?: number): string;
+  toFixed(decimalPlaces: number, rounding: Decimal.Rounding): string;
+
+  toFraction(max_denominator?: Decimal.Value): Decimal[];
+
+  toHexadecimal(significantDigits?: number): string;
+  toHexadecimal(significantDigits: number, rounding: Decimal.Rounding): string;
+  toHex(significantDigits?: number): string;
+  toHex(significantDigits: number, rounding?: Decimal.Rounding): string;
+
+  toJSON(): string;
+
+  toNearest(n: Decimal.Value, rounding?: Decimal.Rounding): Decimal;
+
+  toNumber(): number;
+
+  toOctal(significantDigits?: number): string;
+  toOctal(significantDigits: number, rounding: Decimal.Rounding): string;
+
+  toPower(n: Decimal.Value): Decimal;
+  pow(n: Decimal.Value): Decimal;
+
+  toPrecision(significantDigits?: number): string;
+  toPrecision(significantDigits: number, rounding: Decimal.Rounding): string;
+
+  toSignificantDigits(significantDigits?: number): Decimal;
+  toSignificantDigits(significantDigits: number, rounding: Decimal.Rounding): Decimal;
+  toSD(significantDigits?: number): Decimal;
+  toSD(significantDigits: number, rounding: Decimal.Rounding): Decimal;
+
+  toString(): string;
+
+  truncated(): Decimal;
+  trunc(): Decimal;
+
+  valueOf(): string;
+
+  static abs(n: Decimal.Value): Decimal;
+  static acos(n: Decimal.Value): Decimal;
+  static acosh(n: Decimal.Value): Decimal;
+  static add(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static asin(n: Decimal.Value): Decimal;
+  static asinh(n: Decimal.Value): Decimal;
+  static atan(n: Decimal.Value): Decimal;
+  static atanh(n: Decimal.Value): Decimal;
+  static atan2(y: Decimal.Value, x: Decimal.Value): Decimal;
+  static cbrt(n: Decimal.Value): Decimal;
+  static ceil(n: Decimal.Value): Decimal;
+  static clamp(n: Decimal.Value, min: Decimal.Value, max: Decimal.Value): Decimal;
+  static clone(object?: Decimal.Config): Decimal.Constructor;
+  static config(object: Decimal.Config): Decimal.Constructor;
+  static cos(n: Decimal.Value): Decimal;
+  static cosh(n: Decimal.Value): Decimal;
+  static div(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static exp(n: Decimal.Value): Decimal;
+  static floor(n: Decimal.Value): Decimal;
+  static hypot(...n: Decimal.Value[]): Decimal;
+  static isDecimal(object: any): boolean
+  static ln(n: Decimal.Value): Decimal;
+  static log(n: Decimal.Value, base?: Decimal.Value): Decimal;
+  static log2(n: Decimal.Value): Decimal;
+  static log10(n: Decimal.Value): Decimal;
+  static max(...n: Decimal.Value[]): Decimal;
+  static min(...n: Decimal.Value[]): Decimal;
+  static mod(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static mul(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static noConflict(): Decimal.Constructor;   // Browser only
+  static pow(base: Decimal.Value, exponent: Decimal.Value): Decimal;
+  static random(significantDigits?: number): Decimal;
+  static round(n: Decimal.Value): Decimal;
+  static set(object: Decimal.Config): Decimal.Constructor;
+  static sign(n: Decimal.Value): Decimal;
+  static sin(n: Decimal.Value): Decimal;
+  static sinh(n: Decimal.Value): Decimal;
+  static sqrt(n: Decimal.Value): Decimal;
+  static sub(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static sum(...n: Decimal.Value[]): Decimal;
+  static tan(n: Decimal.Value): Decimal;
+  static tanh(n: Decimal.Value): Decimal;
+  static trunc(n: Decimal.Value): Decimal;
+
+  static readonly default?: Decimal.Constructor;
+  static readonly Decimal?: Decimal.Constructor;
+
+  static readonly precision: number;
+  static readonly rounding: Decimal.Rounding;
+  static readonly toExpNeg: number;
+  static readonly toExpPos: number;
+  static readonly minE: number;
+  static readonly maxE: number;
+  static readonly crypto: boolean;
+  static readonly modulo: Decimal.Modulo;
+
+  static readonly ROUND_UP: 0;
+  static readonly ROUND_DOWN: 1;
+  static readonly ROUND_CEIL: 2;
+  static readonly ROUND_FLOOR: 3;
+  static readonly ROUND_HALF_UP: 4;
+  static readonly ROUND_HALF_DOWN: 5;
+  static readonly ROUND_HALF_EVEN: 6;
+  static readonly ROUND_HALF_CEIL: 7;
+  static readonly ROUND_HALF_FLOOR: 8;
+  static readonly EUCLID: 9;
+}
diff --git a/node_modules/decimal.js/decimal.js b/node_modules/decimal.js/decimal.js
new file mode 100644
index 0000000..7290d8c
--- /dev/null
+++ b/node_modules/decimal.js/decimal.js
@@ -0,0 +1,4934 @@
+;(function (globalScope) {
+  'use strict';
+
+
+  /*
+   *  decimal.js v10.3.1
+   *  An arbitrary-precision Decimal type for JavaScript.
+   *  https://github.com/MikeMcl/decimal.js
+   *  Copyright (c) 2021 Michael Mclaughlin <M8ch88l@gmail.com>
+   *  MIT Licence
+   */
+
+
+  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //
+
+
+    // The maximum exponent magnitude.
+    // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.
+  var EXP_LIMIT = 9e15,                      // 0 to 9e15
+
+    // The limit on the value of `precision`, and on the value of the first argument to
+    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.
+    MAX_DIGITS = 1e9,                        // 0 to 1e9
+
+    // Base conversion alphabet.
+    NUMERALS = '0123456789abcdef',
+
+    // The natural logarithm of 10 (1025 digits).
+    LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',
+
+    // Pi (1025 digits).
+    PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',
+
+
+    // The initial configuration properties of the Decimal constructor.
+    DEFAULTS = {
+
+      // These values must be integers within the stated ranges (inclusive).
+      // Most of these values can be changed at run-time using the `Decimal.config` method.
+
+      // The maximum number of significant digits of the result of a calculation or base conversion.
+      // E.g. `Decimal.config({ precision: 20 });`
+      precision: 20,                         // 1 to MAX_DIGITS
+
+      // The rounding mode used when rounding to `precision`.
+      //
+      // ROUND_UP         0 Away from zero.
+      // ROUND_DOWN       1 Towards zero.
+      // ROUND_CEIL       2 Towards +Infinity.
+      // ROUND_FLOOR      3 Towards -Infinity.
+      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.
+      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.
+      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.
+      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.
+      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
+      //
+      // E.g.
+      // `Decimal.rounding = 4;`
+      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
+      rounding: 4,                           // 0 to 8
+
+      // The modulo mode used when calculating the modulus: a mod n.
+      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
+      // The remainder (r) is calculated as: r = a - n * q.
+      //
+      // UP         0 The remainder is positive if the dividend is negative, else is negative.
+      // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).
+      // FLOOR      3 The remainder has the same sign as the divisor (Python %).
+      // HALF_EVEN  6 The IEEE 754 remainder function.
+      // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
+      //
+      // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
+      // division (9) are commonly used for the modulus operation. The other rounding modes can also
+      // be used, but they may not give useful results.
+      modulo: 1,                             // 0 to 9
+
+      // The exponent value at and beneath which `toString` returns exponential notation.
+      // JavaScript numbers: -7
+      toExpNeg: -7,                          // 0 to -EXP_LIMIT
+
+      // The exponent value at and above which `toString` returns exponential notation.
+      // JavaScript numbers: 21
+      toExpPos:  21,                         // 0 to EXP_LIMIT
+
+      // The minimum exponent value, beneath which underflow to zero occurs.
+      // JavaScript numbers: -324  (5e-324)
+      minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT
+
+      // The maximum exponent value, above which overflow to Infinity occurs.
+      // JavaScript numbers: 308  (1.7976931348623157e+308)
+      maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT
+
+      // Whether to use cryptographically-secure random number generation, if available.
+      crypto: false                          // true/false
+    },
+
+
+  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //
+
+
+    Decimal, inexact, noConflict, quadrant,
+    external = true,
+
+    decimalError = '[DecimalError] ',
+    invalidArgument = decimalError + 'Invalid argument: ',
+    precisionLimitExceeded = decimalError + 'Precision limit exceeded',
+    cryptoUnavailable = decimalError + 'crypto unavailable',
+    tag = '[object Decimal]',
+
+    mathfloor = Math.floor,
+    mathpow = Math.pow,
+
+    isBinary = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,
+    isHex = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,
+    isOctal = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,
+    isDecimal = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,
+
+    BASE = 1e7,
+    LOG_BASE = 7,
+    MAX_SAFE_INTEGER = 9007199254740991,
+
+    LN10_PRECISION = LN10.length - 1,
+    PI_PRECISION = PI.length - 1,
+
+    // Decimal.prototype object
+    P = { toStringTag: tag };
+
+
+  // Decimal prototype methods
+
+
+  /*
+   *  absoluteValue             abs
+   *  ceil
+   *  clampedTo                 clamp
+   *  comparedTo                cmp
+   *  cosine                    cos
+   *  cubeRoot                  cbrt
+   *  decimalPlaces             dp
+   *  dividedBy                 div
+   *  dividedToIntegerBy        divToInt
+   *  equals                    eq
+   *  floor
+   *  greaterThan               gt
+   *  greaterThanOrEqualTo      gte
+   *  hyperbolicCosine          cosh
+   *  hyperbolicSine            sinh
+   *  hyperbolicTangent         tanh
+   *  inverseCosine             acos
+   *  inverseHyperbolicCosine   acosh
+   *  inverseHyperbolicSine     asinh
+   *  inverseHyperbolicTangent  atanh
+   *  inverseSine               asin
+   *  inverseTangent            atan
+   *  isFinite
+   *  isInteger                 isInt
+   *  isNaN
+   *  isNegative                isNeg
+   *  isPositive                isPos
+   *  isZero
+   *  lessThan                  lt
+   *  lessThanOrEqualTo         lte
+   *  logarithm                 log
+   *  [maximum]                 [max]
+   *  [minimum]                 [min]
+   *  minus                     sub
+   *  modulo                    mod
+   *  naturalExponential        exp
+   *  naturalLogarithm          ln
+   *  negated                   neg
+   *  plus                      add
+   *  precision                 sd
+   *  round
+   *  sine                      sin
+   *  squareRoot                sqrt
+   *  tangent                   tan
+   *  times                     mul
+   *  toBinary
+   *  toDecimalPlaces           toDP
+   *  toExponential
+   *  toFixed
+   *  toFraction
+   *  toHexadecimal             toHex
+   *  toNearest
+   *  toNumber
+   *  toOctal
+   *  toPower                   pow
+   *  toPrecision
+   *  toSignificantDigits       toSD
+   *  toString
+   *  truncated                 trunc
+   *  valueOf                   toJSON
+   */
+
+
+  /*
+   * Return a new Decimal whose value is the absolute value of this Decimal.
+   *
+   */
+  P.absoluteValue = P.abs = function () {
+    var x = new this.constructor(this);
+    if (x.s < 0) x.s = 1;
+    return finalise(x);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+   * direction of positive Infinity.
+   *
+   */
+  P.ceil = function () {
+    return finalise(new this.constructor(this), this.e + 1, 2);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal clamped to the range
+   * delineated by `min` and `max`.
+   *
+   * min {number|string|Decimal}
+   * max {number|string|Decimal}
+   *
+   */
+  P.clampedTo = P.clamp = function (min, max) {
+    var k,
+      x = this,
+      Ctor = x.constructor;
+    min = new Ctor(min);
+    max = new Ctor(max);
+    if (!min.s || !max.s) return new Ctor(NaN);
+    if (min.gt(max)) throw Error(invalidArgument + max);
+    k = x.cmp(min);
+    return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);
+  };
+
+
+  /*
+   * Return
+   *   1    if the value of this Decimal is greater than the value of `y`,
+   *  -1    if the value of this Decimal is less than the value of `y`,
+   *   0    if they have the same value,
+   *   NaN  if the value of either Decimal is NaN.
+   *
+   */
+  P.comparedTo = P.cmp = function (y) {
+    var i, j, xdL, ydL,
+      x = this,
+      xd = x.d,
+      yd = (y = new x.constructor(y)).d,
+      xs = x.s,
+      ys = y.s;
+
+    // Either NaN or ±Infinity?
+    if (!xd || !yd) {
+      return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;
+    }
+
+    // Either zero?
+    if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;
+
+    // Signs differ?
+    if (xs !== ys) return xs;
+
+    // Compare exponents.
+    if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;
+
+    xdL = xd.length;
+    ydL = yd.length;
+
+    // Compare digit by digit.
+    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {
+      if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;
+    }
+
+    // Compare lengths.
+    return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-1, 1]
+   *
+   * cos(0)         = 1
+   * cos(-0)        = 1
+   * cos(Infinity)  = NaN
+   * cos(-Infinity) = NaN
+   * cos(NaN)       = NaN
+   *
+   */
+  P.cosine = P.cos = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.d) return new Ctor(NaN);
+
+    // cos(0) = cos(-0) = 1
+    if (!x.d[0]) return new Ctor(1);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+    Ctor.rounding = 1;
+
+    x = cosine(Ctor, toLessThanHalfPi(Ctor, x));
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);
+  };
+
+
+  /*
+   *
+   * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   *  cbrt(0)  =  0
+   *  cbrt(-0) = -0
+   *  cbrt(1)  =  1
+   *  cbrt(-1) = -1
+   *  cbrt(N)  =  N
+   *  cbrt(-I) = -I
+   *  cbrt(I)  =  I
+   *
+   * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))
+   *
+   */
+  P.cubeRoot = P.cbrt = function () {
+    var e, m, n, r, rep, s, sd, t, t3, t3plusx,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite() || x.isZero()) return new Ctor(x);
+    external = false;
+
+    // Initial estimate.
+    s = x.s * mathpow(x.s * x, 1 / 3);
+
+     // Math.cbrt underflow/overflow?
+     // Pass x to Math.pow as integer, then adjust the exponent of the result.
+    if (!s || Math.abs(s) == 1 / 0) {
+      n = digitsToString(x.d);
+      e = x.e;
+
+      // Adjust n exponent so it is a multiple of 3 away from x exponent.
+      if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');
+      s = mathpow(n, 1 / 3);
+
+      // Rarely, e may be one less than the result exponent value.
+      e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));
+
+      if (s == 1 / 0) {
+        n = '5e' + e;
+      } else {
+        n = s.toExponential();
+        n = n.slice(0, n.indexOf('e') + 1) + e;
+      }
+
+      r = new Ctor(n);
+      r.s = x.s;
+    } else {
+      r = new Ctor(s.toString());
+    }
+
+    sd = (e = Ctor.precision) + 3;
+
+    // Halley's method.
+    // TODO? Compare Newton's method.
+    for (;;) {
+      t = r;
+      t3 = t.times(t).times(t);
+      t3plusx = t3.plus(x);
+      r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);
+
+      // TODO? Replace with for-loop and checkRoundingDigits.
+      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+        n = n.slice(sd - 3, sd + 1);
+
+        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999
+        // , i.e. approaching a rounding boundary, continue the iteration.
+        if (n == '9999' || !rep && n == '4999') {
+
+          // On the first iteration only, check to see if rounding up gives the exact result as the
+          // nines may infinitely repeat.
+          if (!rep) {
+            finalise(t, e + 1, 0);
+
+            if (t.times(t).times(t).eq(x)) {
+              r = t;
+              break;
+            }
+          }
+
+          sd += 4;
+          rep = 1;
+        } else {
+
+          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+          // If not, then there are further digits and m will be truthy.
+          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+            // Truncate to the first rounding digit.
+            finalise(r, e + 1, 1);
+            m = !r.times(r).times(r).eq(x);
+          }
+
+          break;
+        }
+      }
+    }
+
+    external = true;
+
+    return finalise(r, e, Ctor.rounding, m);
+  };
+
+
+  /*
+   * Return the number of decimal places of the value of this Decimal.
+   *
+   */
+  P.decimalPlaces = P.dp = function () {
+    var w,
+      d = this.d,
+      n = NaN;
+
+    if (d) {
+      w = d.length - 1;
+      n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;
+
+      // Subtract the number of trailing zeros of the last word.
+      w = d[w];
+      if (w) for (; w % 10 == 0; w /= 10) n--;
+      if (n < 0) n = 0;
+    }
+
+    return n;
+  };
+
+
+  /*
+   *  n / 0 = I
+   *  n / N = N
+   *  n / I = 0
+   *  0 / n = 0
+   *  0 / 0 = N
+   *  0 / N = N
+   *  0 / I = 0
+   *  N / n = N
+   *  N / 0 = N
+   *  N / N = N
+   *  N / I = N
+   *  I / n = I
+   *  I / 0 = I
+   *  I / N = N
+   *  I / I = N
+   *
+   * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   */
+  P.dividedBy = P.div = function (y) {
+    return divide(this, new this.constructor(y));
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal
+   * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   */
+  P.dividedToIntegerBy = P.divToInt = function (y) {
+    var x = this,
+      Ctor = x.constructor;
+    return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.
+   *
+   */
+  P.equals = P.eq = function (y) {
+    return this.cmp(y) === 0;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+   * direction of negative Infinity.
+   *
+   */
+  P.floor = function () {
+    return finalise(new this.constructor(this), this.e + 1, 3);
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return
+   * false.
+   *
+   */
+  P.greaterThan = P.gt = function (y) {
+    return this.cmp(y) > 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is greater than or equal to the value of `y`,
+   * otherwise return false.
+   *
+   */
+  P.greaterThanOrEqualTo = P.gte = function (y) {
+    var k = this.cmp(y);
+    return k == 1 || k === 0;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [1, Infinity]
+   *
+   * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...
+   *
+   * cosh(0)         = 1
+   * cosh(-0)        = 1
+   * cosh(Infinity)  = Infinity
+   * cosh(-Infinity) = Infinity
+   * cosh(NaN)       = NaN
+   *
+   *  x        time taken (ms)   result
+   * 1000      9                 9.8503555700852349694e+433
+   * 10000     25                4.4034091128314607936e+4342
+   * 100000    171               1.4033316802130615897e+43429
+   * 1000000   3817              1.5166076984010437725e+434294
+   * 10000000  abandoned after 2 minute wait
+   *
+   * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))
+   *
+   */
+  P.hyperbolicCosine = P.cosh = function () {
+    var k, n, pr, rm, len,
+      x = this,
+      Ctor = x.constructor,
+      one = new Ctor(1);
+
+    if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);
+    if (x.isZero()) return one;
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+    Ctor.rounding = 1;
+    len = x.d.length;
+
+    // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1
+    // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))
+
+    // Estimate the optimum number of times to use the argument reduction.
+    // TODO? Estimation reused from cosine() and may not be optimal here.
+    if (len < 32) {
+      k = Math.ceil(len / 3);
+      n = (1 / tinyPow(4, k)).toString();
+    } else {
+      k = 16;
+      n = '2.3283064365386962890625e-10';
+    }
+
+    x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);
+
+    // Reverse argument reduction
+    var cosh2_x,
+      i = k,
+      d8 = new Ctor(8);
+    for (; i--;) {
+      cosh2_x = x.times(x);
+      x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));
+    }
+
+    return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-Infinity, Infinity]
+   *
+   * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...
+   *
+   * sinh(0)         = 0
+   * sinh(-0)        = -0
+   * sinh(Infinity)  = Infinity
+   * sinh(-Infinity) = -Infinity
+   * sinh(NaN)       = NaN
+   *
+   * x        time taken (ms)
+   * 10       2 ms
+   * 100      5 ms
+   * 1000     14 ms
+   * 10000    82 ms
+   * 100000   886 ms            1.4033316802130615897e+43429
+   * 200000   2613 ms
+   * 300000   5407 ms
+   * 400000   8824 ms
+   * 500000   13026 ms          8.7080643612718084129e+217146
+   * 1000000  48543 ms
+   *
+   * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))
+   *
+   */
+  P.hyperbolicSine = P.sinh = function () {
+    var k, pr, rm, len,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+    Ctor.rounding = 1;
+    len = x.d.length;
+
+    if (len < 3) {
+      x = taylorSeries(Ctor, 2, x, x, true);
+    } else {
+
+      // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))
+      // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))
+      // 3 multiplications and 1 addition
+
+      // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))
+      // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))
+      // 4 multiplications and 2 additions
+
+      // Estimate the optimum number of times to use the argument reduction.
+      k = 1.4 * Math.sqrt(len);
+      k = k > 16 ? 16 : k | 0;
+
+      x = x.times(1 / tinyPow(5, k));
+      x = taylorSeries(Ctor, 2, x, x, true);
+
+      // Reverse argument reduction
+      var sinh2_x,
+        d5 = new Ctor(5),
+        d16 = new Ctor(16),
+        d20 = new Ctor(20);
+      for (; k--;) {
+        sinh2_x = x.times(x);
+        x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));
+      }
+    }
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(x, pr, rm, true);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-1, 1]
+   *
+   * tanh(x) = sinh(x) / cosh(x)
+   *
+   * tanh(0)         = 0
+   * tanh(-0)        = -0
+   * tanh(Infinity)  = 1
+   * tanh(-Infinity) = -1
+   * tanh(NaN)       = NaN
+   *
+   */
+  P.hyperbolicTangent = P.tanh = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(x.s);
+    if (x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + 7;
+    Ctor.rounding = 1;
+
+    return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of
+   * this Decimal.
+   *
+   * Domain: [-1, 1]
+   * Range: [0, pi]
+   *
+   * acos(x) = pi/2 - asin(x)
+   *
+   * acos(0)       = pi/2
+   * acos(-0)      = pi/2
+   * acos(1)       = 0
+   * acos(-1)      = pi
+   * acos(1/2)     = pi/3
+   * acos(-1/2)    = 2*pi/3
+   * acos(|x| > 1) = NaN
+   * acos(NaN)     = NaN
+   *
+   */
+  P.inverseCosine = P.acos = function () {
+    var halfPi,
+      x = this,
+      Ctor = x.constructor,
+      k = x.abs().cmp(1),
+      pr = Ctor.precision,
+      rm = Ctor.rounding;
+
+    if (k !== -1) {
+      return k === 0
+        // |x| is 1
+        ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)
+        // |x| > 1 or x is NaN
+        : new Ctor(NaN);
+    }
+
+    if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);
+
+    // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3
+
+    Ctor.precision = pr + 6;
+    Ctor.rounding = 1;
+
+    x = x.asin();
+    halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return halfPi.minus(x);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the
+   * value of this Decimal.
+   *
+   * Domain: [1, Infinity]
+   * Range: [0, Infinity]
+   *
+   * acosh(x) = ln(x + sqrt(x^2 - 1))
+   *
+   * acosh(x < 1)     = NaN
+   * acosh(NaN)       = NaN
+   * acosh(Infinity)  = Infinity
+   * acosh(-Infinity) = NaN
+   * acosh(0)         = NaN
+   * acosh(-0)        = NaN
+   * acosh(1)         = 0
+   * acosh(-1)        = NaN
+   *
+   */
+  P.inverseHyperbolicCosine = P.acosh = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);
+    if (!x.isFinite()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;
+    Ctor.rounding = 1;
+    external = false;
+
+    x = x.times(x).minus(1).sqrt().plus(x);
+
+    external = true;
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.ln();
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value
+   * of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-Infinity, Infinity]
+   *
+   * asinh(x) = ln(x + sqrt(x^2 + 1))
+   *
+   * asinh(NaN)       = NaN
+   * asinh(Infinity)  = Infinity
+   * asinh(-Infinity) = -Infinity
+   * asinh(0)         = 0
+   * asinh(-0)        = -0
+   *
+   */
+  P.inverseHyperbolicSine = P.asinh = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;
+    Ctor.rounding = 1;
+    external = false;
+
+    x = x.times(x).plus(1).sqrt().plus(x);
+
+    external = true;
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.ln();
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the
+   * value of this Decimal.
+   *
+   * Domain: [-1, 1]
+   * Range: [-Infinity, Infinity]
+   *
+   * atanh(x) = 0.5 * ln((1 + x) / (1 - x))
+   *
+   * atanh(|x| > 1)   = NaN
+   * atanh(NaN)       = NaN
+   * atanh(Infinity)  = NaN
+   * atanh(-Infinity) = NaN
+   * atanh(0)         = 0
+   * atanh(-0)        = -0
+   * atanh(1)         = Infinity
+   * atanh(-1)        = -Infinity
+   *
+   */
+  P.inverseHyperbolicTangent = P.atanh = function () {
+    var pr, rm, wpr, xsd,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(NaN);
+    if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    xsd = x.sd();
+
+    if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);
+
+    Ctor.precision = wpr = xsd - x.e;
+
+    x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);
+
+    Ctor.precision = pr + 4;
+    Ctor.rounding = 1;
+
+    x = x.ln();
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.times(0.5);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-pi/2, pi/2]
+   *
+   * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))
+   *
+   * asin(0)       = 0
+   * asin(-0)      = -0
+   * asin(1/2)     = pi/6
+   * asin(-1/2)    = -pi/6
+   * asin(1)       = pi/2
+   * asin(-1)      = -pi/2
+   * asin(|x| > 1) = NaN
+   * asin(NaN)     = NaN
+   *
+   * TODO? Compare performance of Taylor series.
+   *
+   */
+  P.inverseSine = P.asin = function () {
+    var halfPi, k,
+      pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (x.isZero()) return new Ctor(x);
+
+    k = x.abs().cmp(1);
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    if (k !== -1) {
+
+      // |x| is 1
+      if (k === 0) {
+        halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
+        halfPi.s = x.s;
+        return halfPi;
+      }
+
+      // |x| > 1 or x is NaN
+      return new Ctor(NaN);
+    }
+
+    // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6
+
+    Ctor.precision = pr + 6;
+    Ctor.rounding = 1;
+
+    x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.times(2);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value
+   * of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-pi/2, pi/2]
+   *
+   * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+   *
+   * atan(0)         = 0
+   * atan(-0)        = -0
+   * atan(1)         = pi/4
+   * atan(-1)        = -pi/4
+   * atan(Infinity)  = pi/2
+   * atan(-Infinity) = -pi/2
+   * atan(NaN)       = NaN
+   *
+   */
+  P.inverseTangent = P.atan = function () {
+    var i, j, k, n, px, t, r, wpr, x2,
+      x = this,
+      Ctor = x.constructor,
+      pr = Ctor.precision,
+      rm = Ctor.rounding;
+
+    if (!x.isFinite()) {
+      if (!x.s) return new Ctor(NaN);
+      if (pr + 4 <= PI_PRECISION) {
+        r = getPi(Ctor, pr + 4, rm).times(0.5);
+        r.s = x.s;
+        return r;
+      }
+    } else if (x.isZero()) {
+      return new Ctor(x);
+    } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {
+      r = getPi(Ctor, pr + 4, rm).times(0.25);
+      r.s = x.s;
+      return r;
+    }
+
+    Ctor.precision = wpr = pr + 10;
+    Ctor.rounding = 1;
+
+    // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);
+
+    // Argument reduction
+    // Ensure |x| < 0.42
+    // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))
+
+    k = Math.min(28, wpr / LOG_BASE + 2 | 0);
+
+    for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));
+
+    external = false;
+
+    j = Math.ceil(wpr / LOG_BASE);
+    n = 1;
+    x2 = x.times(x);
+    r = new Ctor(x);
+    px = x;
+
+    // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+    for (; i !== -1;) {
+      px = px.times(x2);
+      t = r.minus(px.div(n += 2));
+
+      px = px.times(x2);
+      r = t.plus(px.div(n += 2));
+
+      if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);
+    }
+
+    if (k) r = r.times(2 << (k - 1));
+
+    external = true;
+
+    return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is a finite number, otherwise return false.
+   *
+   */
+  P.isFinite = function () {
+    return !!this.d;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is an integer, otherwise return false.
+   *
+   */
+  P.isInteger = P.isInt = function () {
+    return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is NaN, otherwise return false.
+   *
+   */
+  P.isNaN = function () {
+    return !this.s;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is negative, otherwise return false.
+   *
+   */
+  P.isNegative = P.isNeg = function () {
+    return this.s < 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is positive, otherwise return false.
+   *
+   */
+  P.isPositive = P.isPos = function () {
+    return this.s > 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is 0 or -0, otherwise return false.
+   *
+   */
+  P.isZero = function () {
+    return !!this.d && this.d[0] === 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is less than `y`, otherwise return false.
+   *
+   */
+  P.lessThan = P.lt = function (y) {
+    return this.cmp(y) < 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.
+   *
+   */
+  P.lessThanOrEqualTo = P.lte = function (y) {
+    return this.cmp(y) < 1;
+  };
+
+
+  /*
+   * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * If no base is specified, return log[10](arg).
+   *
+   * log[base](arg) = ln(arg) / ln(base)
+   *
+   * The result will always be correctly rounded if the base of the log is 10, and 'almost always'
+   * otherwise:
+   *
+   * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen
+   * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error
+   * between the result and the correctly rounded result will be one ulp (unit in the last place).
+   *
+   * log[-b](a)       = NaN
+   * log[0](a)        = NaN
+   * log[1](a)        = NaN
+   * log[NaN](a)      = NaN
+   * log[Infinity](a) = NaN
+   * log[b](0)        = -Infinity
+   * log[b](-0)       = -Infinity
+   * log[b](-a)       = NaN
+   * log[b](1)        = 0
+   * log[b](Infinity) = Infinity
+   * log[b](NaN)      = NaN
+   *
+   * [base] {number|string|Decimal} The base of the logarithm.
+   *
+   */
+  P.logarithm = P.log = function (base) {
+    var isBase10, d, denominator, k, inf, num, sd, r,
+      arg = this,
+      Ctor = arg.constructor,
+      pr = Ctor.precision,
+      rm = Ctor.rounding,
+      guard = 5;
+
+    // Default base is 10.
+    if (base == null) {
+      base = new Ctor(10);
+      isBase10 = true;
+    } else {
+      base = new Ctor(base);
+      d = base.d;
+
+      // Return NaN if base is negative, or non-finite, or is 0 or 1.
+      if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);
+
+      isBase10 = base.eq(10);
+    }
+
+    d = arg.d;
+
+    // Is arg negative, non-finite, 0 or 1?
+    if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {
+      return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);
+    }
+
+    // The result will have a non-terminating decimal expansion if base is 10 and arg is not an
+    // integer power of 10.
+    if (isBase10) {
+      if (d.length > 1) {
+        inf = true;
+      } else {
+        for (k = d[0]; k % 10 === 0;) k /= 10;
+        inf = k !== 1;
+      }
+    }
+
+    external = false;
+    sd = pr + guard;
+    num = naturalLogarithm(arg, sd);
+    denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+
+    // The result will have 5 rounding digits.
+    r = divide(num, denominator, sd, 1);
+
+    // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,
+    // calculate 10 further digits.
+    //
+    // If the result is known to have an infinite decimal expansion, repeat this until it is clear
+    // that the result is above or below the boundary. Otherwise, if after calculating the 10
+    // further digits, the last 14 are nines, round up and assume the result is exact.
+    // Also assume the result is exact if the last 14 are zero.
+    //
+    // Example of a result that will be incorrectly rounded:
+    // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...
+    // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it
+    // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so
+    // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal
+    // place is still 2.6.
+    if (checkRoundingDigits(r.d, k = pr, rm)) {
+
+      do {
+        sd += 10;
+        num = naturalLogarithm(arg, sd);
+        denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+        r = divide(num, denominator, sd, 1);
+
+        if (!inf) {
+
+          // Check for 14 nines from the 2nd rounding digit, as the first may be 4.
+          if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {
+            r = finalise(r, pr + 1, 0);
+          }
+
+          break;
+        }
+      } while (checkRoundingDigits(r.d, k += 10, rm));
+    }
+
+    external = true;
+
+    return finalise(r, pr, rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.
+   *
+   * arguments {number|string|Decimal}
+   *
+  P.max = function () {
+    Array.prototype.push.call(arguments, this);
+    return maxOrMin(this.constructor, arguments, 'lt');
+  };
+   */
+
+
+  /*
+   * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.
+   *
+   * arguments {number|string|Decimal}
+   *
+  P.min = function () {
+    Array.prototype.push.call(arguments, this);
+    return maxOrMin(this.constructor, arguments, 'gt');
+  };
+   */
+
+
+  /*
+   *  n - 0 = n
+   *  n - N = N
+   *  n - I = -I
+   *  0 - n = -n
+   *  0 - 0 = 0
+   *  0 - N = N
+   *  0 - I = -I
+   *  N - n = N
+   *  N - 0 = N
+   *  N - N = N
+   *  N - I = N
+   *  I - n = I
+   *  I - 0 = I
+   *  I - N = N
+   *  I - I = N
+   *
+   * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   */
+  P.minus = P.sub = function (y) {
+    var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,
+      x = this,
+      Ctor = x.constructor;
+
+    y = new Ctor(y);
+
+    // If either is not finite...
+    if (!x.d || !y.d) {
+
+      // Return NaN if either is NaN.
+      if (!x.s || !y.s) y = new Ctor(NaN);
+
+      // Return y negated if x is finite and y is ±Infinity.
+      else if (x.d) y.s = -y.s;
+
+      // Return x if y is finite and x is ±Infinity.
+      // Return x if both are ±Infinity with different signs.
+      // Return NaN if both are ±Infinity with the same sign.
+      else y = new Ctor(y.d || x.s !== y.s ? x : NaN);
+
+      return y;
+    }
+
+    // If signs differ...
+    if (x.s != y.s) {
+      y.s = -y.s;
+      return x.plus(y);
+    }
+
+    xd = x.d;
+    yd = y.d;
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    // If either is zero...
+    if (!xd[0] || !yd[0]) {
+
+      // Return y negated if x is zero and y is non-zero.
+      if (yd[0]) y.s = -y.s;
+
+      // Return x if y is zero and x is non-zero.
+      else if (xd[0]) y = new Ctor(x);
+
+      // Return zero if both are zero.
+      // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.
+      else return new Ctor(rm === 3 ? -0 : 0);
+
+      return external ? finalise(y, pr, rm) : y;
+    }
+
+    // x and y are finite, non-zero numbers with the same sign.
+
+    // Calculate base 1e7 exponents.
+    e = mathfloor(y.e / LOG_BASE);
+    xe = mathfloor(x.e / LOG_BASE);
+
+    xd = xd.slice();
+    k = xe - e;
+
+    // If base 1e7 exponents differ...
+    if (k) {
+      xLTy = k < 0;
+
+      if (xLTy) {
+        d = xd;
+        k = -k;
+        len = yd.length;
+      } else {
+        d = yd;
+        e = xe;
+        len = xd.length;
+      }
+
+      // Numbers with massively different exponents would result in a very high number of
+      // zeros needing to be prepended, but this can be avoided while still ensuring correct
+      // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.
+      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;
+
+      if (k > i) {
+        k = i;
+        d.length = 1;
+      }
+
+      // Prepend zeros to equalise exponents.
+      d.reverse();
+      for (i = k; i--;) d.push(0);
+      d.reverse();
+
+    // Base 1e7 exponents equal.
+    } else {
+
+      // Check digits to determine which is the bigger number.
+
+      i = xd.length;
+      len = yd.length;
+      xLTy = i < len;
+      if (xLTy) len = i;
+
+      for (i = 0; i < len; i++) {
+        if (xd[i] != yd[i]) {
+          xLTy = xd[i] < yd[i];
+          break;
+        }
+      }
+
+      k = 0;
+    }
+
+    if (xLTy) {
+      d = xd;
+      xd = yd;
+      yd = d;
+      y.s = -y.s;
+    }
+
+    len = xd.length;
+
+    // Append zeros to `xd` if shorter.
+    // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.
+    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;
+
+    // Subtract yd from xd.
+    for (i = yd.length; i > k;) {
+
+      if (xd[--i] < yd[i]) {
+        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;
+        --xd[j];
+        xd[i] += BASE;
+      }
+
+      xd[i] -= yd[i];
+    }
+
+    // Remove trailing zeros.
+    for (; xd[--len] === 0;) xd.pop();
+
+    // Remove leading zeros and adjust exponent accordingly.
+    for (; xd[0] === 0; xd.shift()) --e;
+
+    // Zero?
+    if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);
+
+    y.d = xd;
+    y.e = getBase10Exponent(xd, e);
+
+    return external ? finalise(y, pr, rm) : y;
+  };
+
+
+  /*
+   *   n % 0 =  N
+   *   n % N =  N
+   *   n % I =  n
+   *   0 % n =  0
+   *  -0 % n = -0
+   *   0 % 0 =  N
+   *   0 % N =  N
+   *   0 % I =  0
+   *   N % n =  N
+   *   N % 0 =  N
+   *   N % N =  N
+   *   N % I =  N
+   *   I % n =  N
+   *   I % 0 =  N
+   *   I % N =  N
+   *   I % I =  N
+   *
+   * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * The result depends on the modulo mode.
+   *
+   */
+  P.modulo = P.mod = function (y) {
+    var q,
+      x = this,
+      Ctor = x.constructor;
+
+    y = new Ctor(y);
+
+    // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.
+    if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);
+
+    // Return x if y is ±Infinity or x is ±0.
+    if (!y.d || x.d && !x.d[0]) {
+      return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);
+    }
+
+    // Prevent rounding of intermediate calculations.
+    external = false;
+
+    if (Ctor.modulo == 9) {
+
+      // Euclidian division: q = sign(y) * floor(x / abs(y))
+      // result = x - q * y    where  0 <= result < abs(y)
+      q = divide(x, y.abs(), 0, 3, 1);
+      q.s *= y.s;
+    } else {
+      q = divide(x, y, 0, Ctor.modulo, 1);
+    }
+
+    q = q.times(y);
+
+    external = true;
+
+    return x.minus(q);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,
+   * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   */
+  P.naturalExponential = P.exp = function () {
+    return naturalExponential(this);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,
+   * rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   */
+  P.naturalLogarithm = P.ln = function () {
+    return naturalLogarithm(this);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by
+   * -1.
+   *
+   */
+  P.negated = P.neg = function () {
+    var x = new this.constructor(this);
+    x.s = -x.s;
+    return finalise(x);
+  };
+
+
+  /*
+   *  n + 0 = n
+   *  n + N = N
+   *  n + I = I
+   *  0 + n = n
+   *  0 + 0 = 0
+   *  0 + N = N
+   *  0 + I = I
+   *  N + n = N
+   *  N + 0 = N
+   *  N + N = N
+   *  N + I = N
+   *  I + n = I
+   *  I + 0 = I
+   *  I + N = N
+   *  I + I = I
+   *
+   * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   */
+  P.plus = P.add = function (y) {
+    var carry, d, e, i, k, len, pr, rm, xd, yd,
+      x = this,
+      Ctor = x.constructor;
+
+    y = new Ctor(y);
+
+    // If either is not finite...
+    if (!x.d || !y.d) {
+
+      // Return NaN if either is NaN.
+      if (!x.s || !y.s) y = new Ctor(NaN);
+
+      // Return x if y is finite and x is ±Infinity.
+      // Return x if both are ±Infinity with the same sign.
+      // Return NaN if both are ±Infinity with different signs.
+      // Return y if x is finite and y is ±Infinity.
+      else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);
+
+      return y;
+    }
+
+     // If signs differ...
+    if (x.s != y.s) {
+      y.s = -y.s;
+      return x.minus(y);
+    }
+
+    xd = x.d;
+    yd = y.d;
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    // If either is zero...
+    if (!xd[0] || !yd[0]) {
+
+      // Return x if y is zero.
+      // Return y if y is non-zero.
+      if (!yd[0]) y = new Ctor(x);
+
+      return external ? finalise(y, pr, rm) : y;
+    }
+
+    // x and y are finite, non-zero numbers with the same sign.
+
+    // Calculate base 1e7 exponents.
+    k = mathfloor(x.e / LOG_BASE);
+    e = mathfloor(y.e / LOG_BASE);
+
+    xd = xd.slice();
+    i = k - e;
+
+    // If base 1e7 exponents differ...
+    if (i) {
+
+      if (i < 0) {
+        d = xd;
+        i = -i;
+        len = yd.length;
+      } else {
+        d = yd;
+        e = k;
+        len = xd.length;
+      }
+
+      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.
+      k = Math.ceil(pr / LOG_BASE);
+      len = k > len ? k + 1 : len + 1;
+
+      if (i > len) {
+        i = len;
+        d.length = 1;
+      }
+
+      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.
+      d.reverse();
+      for (; i--;) d.push(0);
+      d.reverse();
+    }
+
+    len = xd.length;
+    i = yd.length;
+
+    // If yd is longer than xd, swap xd and yd so xd points to the longer array.
+    if (len - i < 0) {
+      i = len;
+      d = yd;
+      yd = xd;
+      xd = d;
+    }
+
+    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.
+    for (carry = 0; i;) {
+      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;
+      xd[i] %= BASE;
+    }
+
+    if (carry) {
+      xd.unshift(carry);
+      ++e;
+    }
+
+    // Remove trailing zeros.
+    // No need to check for zero, as +x + +y != 0 && -x + -y != 0
+    for (len = xd.length; xd[--len] == 0;) xd.pop();
+
+    y.d = xd;
+    y.e = getBase10Exponent(xd, e);
+
+    return external ? finalise(y, pr, rm) : y;
+  };
+
+
+  /*
+   * Return the number of significant digits of the value of this Decimal.
+   *
+   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.
+   *
+   */
+  P.precision = P.sd = function (z) {
+    var k,
+      x = this;
+
+    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);
+
+    if (x.d) {
+      k = getPrecision(x.d);
+      if (z && x.e + 1 > k) k = x.e + 1;
+    } else {
+      k = NaN;
+    }
+
+    return k;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using
+   * rounding mode `rounding`.
+   *
+   */
+  P.round = function () {
+    var x = this,
+      Ctor = x.constructor;
+
+    return finalise(new Ctor(x), x.e + 1, Ctor.rounding);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the sine of the value in radians of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-1, 1]
+   *
+   * sin(x) = x - x^3/3! + x^5/5! - ...
+   *
+   * sin(0)         = 0
+   * sin(-0)        = -0
+   * sin(Infinity)  = NaN
+   * sin(-Infinity) = NaN
+   * sin(NaN)       = NaN
+   *
+   */
+  P.sine = P.sin = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(NaN);
+    if (x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+    Ctor.rounding = 1;
+
+    x = sine(Ctor, toLessThanHalfPi(Ctor, x));
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   *  sqrt(-n) =  N
+   *  sqrt(N)  =  N
+   *  sqrt(-I) =  N
+   *  sqrt(I)  =  I
+   *  sqrt(0)  =  0
+   *  sqrt(-0) = -0
+   *
+   */
+  P.squareRoot = P.sqrt = function () {
+    var m, n, sd, r, rep, t,
+      x = this,
+      d = x.d,
+      e = x.e,
+      s = x.s,
+      Ctor = x.constructor;
+
+    // Negative/NaN/Infinity/zero?
+    if (s !== 1 || !d || !d[0]) {
+      return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);
+    }
+
+    external = false;
+
+    // Initial estimate.
+    s = Math.sqrt(+x);
+
+    // Math.sqrt underflow/overflow?
+    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.
+    if (s == 0 || s == 1 / 0) {
+      n = digitsToString(d);
+
+      if ((n.length + e) % 2 == 0) n += '0';
+      s = Math.sqrt(n);
+      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);
+
+      if (s == 1 / 0) {
+        n = '5e' + e;
+      } else {
+        n = s.toExponential();
+        n = n.slice(0, n.indexOf('e') + 1) + e;
+      }
+
+      r = new Ctor(n);
+    } else {
+      r = new Ctor(s.toString());
+    }
+
+    sd = (e = Ctor.precision) + 3;
+
+    // Newton-Raphson iteration.
+    for (;;) {
+      t = r;
+      r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);
+
+      // TODO? Replace with for-loop and checkRoundingDigits.
+      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+        n = n.slice(sd - 3, sd + 1);
+
+        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or
+        // 4999, i.e. approaching a rounding boundary, continue the iteration.
+        if (n == '9999' || !rep && n == '4999') {
+
+          // On the first iteration only, check to see if rounding up gives the exact result as the
+          // nines may infinitely repeat.
+          if (!rep) {
+            finalise(t, e + 1, 0);
+
+            if (t.times(t).eq(x)) {
+              r = t;
+              break;
+            }
+          }
+
+          sd += 4;
+          rep = 1;
+        } else {
+
+          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+          // If not, then there are further digits and m will be truthy.
+          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+            // Truncate to the first rounding digit.
+            finalise(r, e + 1, 1);
+            m = !r.times(r).eq(x);
+          }
+
+          break;
+        }
+      }
+    }
+
+    external = true;
+
+    return finalise(r, e, Ctor.rounding, m);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-Infinity, Infinity]
+   *
+   * tan(0)         = 0
+   * tan(-0)        = -0
+   * tan(Infinity)  = NaN
+   * tan(-Infinity) = NaN
+   * tan(NaN)       = NaN
+   *
+   */
+  P.tangent = P.tan = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(NaN);
+    if (x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + 10;
+    Ctor.rounding = 1;
+
+    x = x.sin();
+    x.s = 1;
+    x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);
+  };
+
+
+  /*
+   *  n * 0 = 0
+   *  n * N = N
+   *  n * I = I
+   *  0 * n = 0
+   *  0 * 0 = 0
+   *  0 * N = N
+   *  0 * I = N
+   *  N * n = N
+   *  N * 0 = N
+   *  N * N = N
+   *  N * I = N
+   *  I * n = I
+   *  I * 0 = N
+   *  I * N = N
+   *  I * I = I
+   *
+   * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   */
+  P.times = P.mul = function (y) {
+    var carry, e, i, k, r, rL, t, xdL, ydL,
+      x = this,
+      Ctor = x.constructor,
+      xd = x.d,
+      yd = (y = new Ctor(y)).d;
+
+    y.s *= x.s;
+
+     // If either is NaN, ±Infinity or ±0...
+    if (!xd || !xd[0] || !yd || !yd[0]) {
+
+      return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd
+
+        // Return NaN if either is NaN.
+        // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.
+        ? NaN
+
+        // Return ±Infinity if either is ±Infinity.
+        // Return ±0 if either is ±0.
+        : !xd || !yd ? y.s / 0 : y.s * 0);
+    }
+
+    e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);
+    xdL = xd.length;
+    ydL = yd.length;
+
+    // Ensure xd points to the longer array.
+    if (xdL < ydL) {
+      r = xd;
+      xd = yd;
+      yd = r;
+      rL = xdL;
+      xdL = ydL;
+      ydL = rL;
+    }
+
+    // Initialise the result array with zeros.
+    r = [];
+    rL = xdL + ydL;
+    for (i = rL; i--;) r.push(0);
+
+    // Multiply!
+    for (i = ydL; --i >= 0;) {
+      carry = 0;
+      for (k = xdL + i; k > i;) {
+        t = r[k] + yd[i] * xd[k - i - 1] + carry;
+        r[k--] = t % BASE | 0;
+        carry = t / BASE | 0;
+      }
+
+      r[k] = (r[k] + carry) % BASE | 0;
+    }
+
+    // Remove trailing zeros.
+    for (; !r[--rL];) r.pop();
+
+    if (carry) ++e;
+    else r.shift();
+
+    y.d = r;
+    y.e = getBase10Exponent(r, e);
+
+    return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in base 2, round to `sd` significant
+   * digits using rounding mode `rm`.
+   *
+   * If the optional `sd` argument is present then return binary exponential notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toBinary = function (sd, rm) {
+    return toStringBinary(this, 2, sd, rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`
+   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.
+   *
+   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.
+   *
+   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toDecimalPlaces = P.toDP = function (dp, rm) {
+    var x = this,
+      Ctor = x.constructor;
+
+    x = new Ctor(x);
+    if (dp === void 0) return x;
+
+    checkInt32(dp, 0, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    return finalise(x, dp + x.e + 1, rm);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in exponential notation rounded to
+   * `dp` fixed decimal places using rounding mode `rounding`.
+   *
+   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toExponential = function (dp, rm) {
+    var str,
+      x = this,
+      Ctor = x.constructor;
+
+    if (dp === void 0) {
+      str = finiteToString(x, true);
+    } else {
+      checkInt32(dp, 0, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+
+      x = finalise(new Ctor(x), dp + 1, rm);
+      str = finiteToString(x, true, dp + 1);
+    }
+
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in normal (fixed-point) notation to
+   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is
+   * omitted.
+   *
+   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.
+   *
+   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.
+   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.
+   * (-0).toFixed(3) is '0.000'.
+   * (-0.5).toFixed(0) is '-0'.
+   *
+   */
+  P.toFixed = function (dp, rm) {
+    var str, y,
+      x = this,
+      Ctor = x.constructor;
+
+    if (dp === void 0) {
+      str = finiteToString(x);
+    } else {
+      checkInt32(dp, 0, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+
+      y = finalise(new Ctor(x), dp + x.e + 1, rm);
+      str = finiteToString(y, false, dp + y.e + 1);
+    }
+
+    // To determine whether to add the minus sign look at the value before it was rounded,
+    // i.e. look at `x` rather than `y`.
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return an array representing the value of this Decimal as a simple fraction with an integer
+   * numerator and an integer denominator.
+   *
+   * The denominator will be a positive non-zero value less than or equal to the specified maximum
+   * denominator. If a maximum denominator is not specified, the denominator will be the lowest
+   * value necessary to represent the number exactly.
+   *
+   * [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.
+   *
+   */
+  P.toFraction = function (maxD) {
+    var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,
+      x = this,
+      xd = x.d,
+      Ctor = x.constructor;
+
+    if (!xd) return new Ctor(x);
+
+    n1 = d0 = new Ctor(1);
+    d1 = n0 = new Ctor(0);
+
+    d = new Ctor(d1);
+    e = d.e = getPrecision(xd) - x.e - 1;
+    k = e % LOG_BASE;
+    d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);
+
+    if (maxD == null) {
+
+      // d is 10**e, the minimum max-denominator needed.
+      maxD = e > 0 ? d : n1;
+    } else {
+      n = new Ctor(maxD);
+      if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);
+      maxD = n.gt(d) ? (e > 0 ? d : n1) : n;
+    }
+
+    external = false;
+    n = new Ctor(digitsToString(xd));
+    pr = Ctor.precision;
+    Ctor.precision = e = xd.length * LOG_BASE * 2;
+
+    for (;;)  {
+      q = divide(n, d, 0, 1, 1);
+      d2 = d0.plus(q.times(d1));
+      if (d2.cmp(maxD) == 1) break;
+      d0 = d1;
+      d1 = d2;
+      d2 = n1;
+      n1 = n0.plus(q.times(d2));
+      n0 = d2;
+      d2 = d;
+      d = n.minus(q.times(d2));
+      n = d2;
+    }
+
+    d2 = divide(maxD.minus(d0), d1, 0, 1, 1);
+    n0 = n0.plus(d2.times(n1));
+    d0 = d0.plus(d2.times(d1));
+    n0.s = n1.s = x.s;
+
+    // Determine which fraction is closer to x, n0/d0 or n1/d1?
+    r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1
+        ? [n1, d1] : [n0, d0];
+
+    Ctor.precision = pr;
+    external = true;
+
+    return r;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in base 16, round to `sd` significant
+   * digits using rounding mode `rm`.
+   *
+   * If the optional `sd` argument is present then return binary exponential notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toHexadecimal = P.toHex = function (sd, rm) {
+    return toStringBinary(this, 16, sd, rm);
+  };
+
+
+  /*
+   * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding
+   * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.
+   *
+   * The return value will always have the same sign as this Decimal, unless either this Decimal
+   * or `y` is NaN, in which case the return value will be also be NaN.
+   *
+   * The return value is not affected by the value of `precision`.
+   *
+   * y {number|string|Decimal} The magnitude to round to a multiple of.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   * 'toNearest() rounding mode not an integer: {rm}'
+   * 'toNearest() rounding mode out of range: {rm}'
+   *
+   */
+  P.toNearest = function (y, rm) {
+    var x = this,
+      Ctor = x.constructor;
+
+    x = new Ctor(x);
+
+    if (y == null) {
+
+      // If x is not finite, return x.
+      if (!x.d) return x;
+
+      y = new Ctor(1);
+      rm = Ctor.rounding;
+    } else {
+      y = new Ctor(y);
+      if (rm === void 0) {
+        rm = Ctor.rounding;
+      } else {
+        checkInt32(rm, 0, 8);
+      }
+
+      // If x is not finite, return x if y is not NaN, else NaN.
+      if (!x.d) return y.s ? x : y;
+
+      // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.
+      if (!y.d) {
+        if (y.s) y.s = x.s;
+        return y;
+      }
+    }
+
+    // If y is not zero, calculate the nearest multiple of y to x.
+    if (y.d[0]) {
+      external = false;
+      x = divide(x, y, 0, rm, 1).times(y);
+      external = true;
+      finalise(x);
+
+    // If y is zero, return zero with the sign of x.
+    } else {
+      y.s = x.s;
+      x = y;
+    }
+
+    return x;
+  };
+
+
+  /*
+   * Return the value of this Decimal converted to a number primitive.
+   * Zero keeps its sign.
+   *
+   */
+  P.toNumber = function () {
+    return +this;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in base 8, round to `sd` significant
+   * digits using rounding mode `rm`.
+   *
+   * If the optional `sd` argument is present then return binary exponential notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toOctal = function (sd, rm) {
+    return toStringBinary(this, 8, sd, rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded
+   * to `precision` significant digits using rounding mode `rounding`.
+   *
+   * ECMAScript compliant.
+   *
+   *   pow(x, NaN)                           = NaN
+   *   pow(x, ±0)                            = 1
+
+   *   pow(NaN, non-zero)                    = NaN
+   *   pow(abs(x) > 1, +Infinity)            = +Infinity
+   *   pow(abs(x) > 1, -Infinity)            = +0
+   *   pow(abs(x) == 1, ±Infinity)           = NaN
+   *   pow(abs(x) < 1, +Infinity)            = +0
+   *   pow(abs(x) < 1, -Infinity)            = +Infinity
+   *   pow(+Infinity, y > 0)                 = +Infinity
+   *   pow(+Infinity, y < 0)                 = +0
+   *   pow(-Infinity, odd integer > 0)       = -Infinity
+   *   pow(-Infinity, even integer > 0)      = +Infinity
+   *   pow(-Infinity, odd integer < 0)       = -0
+   *   pow(-Infinity, even integer < 0)      = +0
+   *   pow(+0, y > 0)                        = +0
+   *   pow(+0, y < 0)                        = +Infinity
+   *   pow(-0, odd integer > 0)              = -0
+   *   pow(-0, even integer > 0)             = +0
+   *   pow(-0, odd integer < 0)              = -Infinity
+   *   pow(-0, even integer < 0)             = +Infinity
+   *   pow(finite x < 0, finite non-integer) = NaN
+   *
+   * For non-integer or very large exponents pow(x, y) is calculated using
+   *
+   *   x^y = exp(y*ln(x))
+   *
+   * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the
+   * probability of an incorrectly rounded result
+   * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14
+   * i.e. 1 in 250,000,000,000,000
+   *
+   * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).
+   *
+   * y {number|string|Decimal} The power to which to raise this Decimal.
+   *
+   */
+  P.toPower = P.pow = function (y) {
+    var e, k, pr, r, rm, s,
+      x = this,
+      Ctor = x.constructor,
+      yn = +(y = new Ctor(y));
+
+    // Either ±Infinity, NaN or ±0?
+    if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));
+
+    x = new Ctor(x);
+
+    if (x.eq(1)) return x;
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    if (y.eq(1)) return finalise(x, pr, rm);
+
+    // y exponent
+    e = mathfloor(y.e / LOG_BASE);
+
+    // If y is a small integer use the 'exponentiation by squaring' algorithm.
+    if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {
+      r = intPow(Ctor, x, k, pr);
+      return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);
+    }
+
+    s = x.s;
+
+    // if x is negative
+    if (s < 0) {
+
+      // if y is not an integer
+      if (e < y.d.length - 1) return new Ctor(NaN);
+
+      // Result is positive if x is negative and the last digit of integer y is even.
+      if ((y.d[e] & 1) == 0) s = 1;
+
+      // if x.eq(-1)
+      if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {
+        x.s = s;
+        return x;
+      }
+    }
+
+    // Estimate result exponent.
+    // x^y = 10^e,  where e = y * log10(x)
+    // log10(x) = log10(x_significand) + x_exponent
+    // log10(x_significand) = ln(x_significand) / ln(10)
+    k = mathpow(+x, yn);
+    e = k == 0 || !isFinite(k)
+      ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))
+      : new Ctor(k + '').e;
+
+    // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.
+
+    // Overflow/underflow?
+    if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);
+
+    external = false;
+    Ctor.rounding = x.s = 1;
+
+    // Estimate the extra guard digits needed to ensure five correct rounding digits from
+    // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):
+    // new Decimal(2.32456).pow('2087987436534566.46411')
+    // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815
+    k = Math.min(12, (e + '').length);
+
+    // r = x^y = exp(y*ln(x))
+    r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);
+
+    // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)
+    if (r.d) {
+
+      // Truncate to the required precision plus five rounding digits.
+      r = finalise(r, pr + 5, 1);
+
+      // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate
+      // the result.
+      if (checkRoundingDigits(r.d, pr, rm)) {
+        e = pr + 10;
+
+        // Truncate to the increased precision plus five rounding digits.
+        r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);
+
+        // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).
+        if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {
+          r = finalise(r, pr + 1, 0);
+        }
+      }
+    }
+
+    r.s = s;
+    external = true;
+    Ctor.rounding = rm;
+
+    return finalise(r, pr, rm);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal rounded to `sd` significant digits
+   * using rounding mode `rounding`.
+   *
+   * Return exponential notation if `sd` is less than the number of digits necessary to represent
+   * the integer part of the value in normal notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toPrecision = function (sd, rm) {
+    var str,
+      x = this,
+      Ctor = x.constructor;
+
+    if (sd === void 0) {
+      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+    } else {
+      checkInt32(sd, 1, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+
+      x = finalise(new Ctor(x), sd, rm);
+      str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);
+    }
+
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`
+   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if
+   * omitted.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   * 'toSD() digits out of range: {sd}'
+   * 'toSD() digits not an integer: {sd}'
+   * 'toSD() rounding mode not an integer: {rm}'
+   * 'toSD() rounding mode out of range: {rm}'
+   *
+   */
+  P.toSignificantDigits = P.toSD = function (sd, rm) {
+    var x = this,
+      Ctor = x.constructor;
+
+    if (sd === void 0) {
+      sd = Ctor.precision;
+      rm = Ctor.rounding;
+    } else {
+      checkInt32(sd, 1, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+    }
+
+    return finalise(new Ctor(x), sd, rm);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal.
+   *
+   * Return exponential notation if this Decimal has a positive exponent equal to or greater than
+   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.
+   *
+   */
+  P.toString = function () {
+    var x = this,
+      Ctor = x.constructor,
+      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.
+   *
+   */
+  P.truncated = P.trunc = function () {
+    return finalise(new this.constructor(this), this.e + 1, 1);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal.
+   * Unlike `toString`, negative zero will include the minus sign.
+   *
+   */
+  P.valueOf = P.toJSON = function () {
+    var x = this,
+      Ctor = x.constructor,
+      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+    return x.isNeg() ? '-' + str : str;
+  };
+
+
+  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.
+
+
+  /*
+   *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,
+   *                           finiteToString, naturalExponential, naturalLogarithm
+   *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,
+   *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random
+   *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm
+   *  convertBase              toStringBinary, parseOther
+   *  cos                      P.cos
+   *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,
+   *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,
+   *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,
+   *                           taylorSeries, atan2, parseOther
+   *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,
+   *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,
+   *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,
+   *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,
+   *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,
+   *                           P.truncated, divide, getLn10, getPi, naturalExponential,
+   *                           naturalLogarithm, ceil, floor, round, trunc
+   *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,
+   *                           toStringBinary
+   *  getBase10Exponent        P.minus, P.plus, P.times, parseOther
+   *  getLn10                  P.logarithm, naturalLogarithm
+   *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2
+   *  getPrecision             P.precision, P.toFraction
+   *  getZeroString            digitsToString, finiteToString
+   *  intPow                   P.toPower, parseOther
+   *  isOdd                    toLessThanHalfPi
+   *  maxOrMin                 max, min
+   *  naturalExponential       P.naturalExponential, P.toPower
+   *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,
+   *                           P.toPower, naturalExponential
+   *  nonFiniteToString        finiteToString, toStringBinary
+   *  parseDecimal             Decimal
+   *  parseOther               Decimal
+   *  sin                      P.sin
+   *  taylorSeries             P.cosh, P.sinh, cos, sin
+   *  toLessThanHalfPi         P.cos, P.sin
+   *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal
+   *  truncate                 intPow
+   *
+   *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,
+   *                           naturalLogarithm, config, parseOther, random, Decimal
+   */
+
+
+  function digitsToString(d) {
+    var i, k, ws,
+      indexOfLastWord = d.length - 1,
+      str = '',
+      w = d[0];
+
+    if (indexOfLastWord > 0) {
+      str += w;
+      for (i = 1; i < indexOfLastWord; i++) {
+        ws = d[i] + '';
+        k = LOG_BASE - ws.length;
+        if (k) str += getZeroString(k);
+        str += ws;
+      }
+
+      w = d[i];
+      ws = w + '';
+      k = LOG_BASE - ws.length;
+      if (k) str += getZeroString(k);
+    } else if (w === 0) {
+      return '0';
+    }
+
+    // Remove trailing zeros of last w.
+    for (; w % 10 === 0;) w /= 10;
+
+    return str + w;
+  }
+
+
+  function checkInt32(i, min, max) {
+    if (i !== ~~i || i < min || i > max) {
+      throw Error(invalidArgument + i);
+    }
+  }
+
+
+  /*
+   * Check 5 rounding digits if `repeating` is null, 4 otherwise.
+   * `repeating == null` if caller is `log` or `pow`,
+   * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.
+   */
+  function checkRoundingDigits(d, i, rm, repeating) {
+    var di, k, r, rd;
+
+    // Get the length of the first word of the array d.
+    for (k = d[0]; k >= 10; k /= 10) --i;
+
+    // Is the rounding digit in the first word of d?
+    if (--i < 0) {
+      i += LOG_BASE;
+      di = 0;
+    } else {
+      di = Math.ceil((i + 1) / LOG_BASE);
+      i %= LOG_BASE;
+    }
+
+    // i is the index (0 - 6) of the rounding digit.
+    // E.g. if within the word 3487563 the first rounding digit is 5,
+    // then i = 4, k = 1000, rd = 3487563 % 1000 = 563
+    k = mathpow(10, LOG_BASE - i);
+    rd = d[di] % k | 0;
+
+    if (repeating == null) {
+      if (i < 3) {
+        if (i == 0) rd = rd / 100 | 0;
+        else if (i == 1) rd = rd / 10 | 0;
+        r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;
+      } else {
+        r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&
+          (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||
+            (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;
+      }
+    } else {
+      if (i < 4) {
+        if (i == 0) rd = rd / 1000 | 0;
+        else if (i == 1) rd = rd / 100 | 0;
+        else if (i == 2) rd = rd / 10 | 0;
+        r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;
+      } else {
+        r = ((repeating || rm < 4) && rd + 1 == k ||
+        (!repeating && rm > 3) && rd + 1 == k / 2) &&
+          (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;
+      }
+    }
+
+    return r;
+  }
+
+
+  // Convert string of `baseIn` to an array of numbers of `baseOut`.
+  // Eg. convertBase('255', 10, 16) returns [15, 15].
+  // Eg. convertBase('ff', 16, 10) returns [2, 5, 5].
+  function convertBase(str, baseIn, baseOut) {
+    var j,
+      arr = [0],
+      arrL,
+      i = 0,
+      strL = str.length;
+
+    for (; i < strL;) {
+      for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;
+      arr[0] += NUMERALS.indexOf(str.charAt(i++));
+      for (j = 0; j < arr.length; j++) {
+        if (arr[j] > baseOut - 1) {
+          if (arr[j + 1] === void 0) arr[j + 1] = 0;
+          arr[j + 1] += arr[j] / baseOut | 0;
+          arr[j] %= baseOut;
+        }
+      }
+    }
+
+    return arr.reverse();
+  }
+
+
+  /*
+   * cos(x) = 1 - x^2/2! + x^4/4! - ...
+   * |x| < pi/2
+   *
+   */
+  function cosine(Ctor, x) {
+    var k, len, y;
+
+    if (x.isZero()) return x;
+
+    // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1
+    // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1
+
+    // Estimate the optimum number of times to use the argument reduction.
+    len = x.d.length;
+    if (len < 32) {
+      k = Math.ceil(len / 3);
+      y = (1 / tinyPow(4, k)).toString();
+    } else {
+      k = 16;
+      y = '2.3283064365386962890625e-10';
+    }
+
+    Ctor.precision += k;
+
+    x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));
+
+    // Reverse argument reduction
+    for (var i = k; i--;) {
+      var cos2x = x.times(x);
+      x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);
+    }
+
+    Ctor.precision -= k;
+
+    return x;
+  }
+
+
+  /*
+   * Perform division in the specified base.
+   */
+  var divide = (function () {
+
+    // Assumes non-zero x and k, and hence non-zero result.
+    function multiplyInteger(x, k, base) {
+      var temp,
+        carry = 0,
+        i = x.length;
+
+      for (x = x.slice(); i--;) {
+        temp = x[i] * k + carry;
+        x[i] = temp % base | 0;
+        carry = temp / base | 0;
+      }
+
+      if (carry) x.unshift(carry);
+
+      return x;
+    }
+
+    function compare(a, b, aL, bL) {
+      var i, r;
+
+      if (aL != bL) {
+        r = aL > bL ? 1 : -1;
+      } else {
+        for (i = r = 0; i < aL; i++) {
+          if (a[i] != b[i]) {
+            r = a[i] > b[i] ? 1 : -1;
+            break;
+          }
+        }
+      }
+
+      return r;
+    }
+
+    function subtract(a, b, aL, base) {
+      var i = 0;
+
+      // Subtract b from a.
+      for (; aL--;) {
+        a[aL] -= i;
+        i = a[aL] < b[aL] ? 1 : 0;
+        a[aL] = i * base + a[aL] - b[aL];
+      }
+
+      // Remove leading zeros.
+      for (; !a[0] && a.length > 1;) a.shift();
+    }
+
+    return function (x, y, pr, rm, dp, base) {
+      var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,
+        yL, yz,
+        Ctor = x.constructor,
+        sign = x.s == y.s ? 1 : -1,
+        xd = x.d,
+        yd = y.d;
+
+      // Either NaN, Infinity or 0?
+      if (!xd || !xd[0] || !yd || !yd[0]) {
+
+        return new Ctor(// Return NaN if either NaN, or both Infinity or 0.
+          !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :
+
+          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
+          xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);
+      }
+
+      if (base) {
+        logBase = 1;
+        e = x.e - y.e;
+      } else {
+        base = BASE;
+        logBase = LOG_BASE;
+        e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);
+      }
+
+      yL = yd.length;
+      xL = xd.length;
+      q = new Ctor(sign);
+      qd = q.d = [];
+
+      // Result exponent may be one less than e.
+      // The digit array of a Decimal from toStringBinary may have trailing zeros.
+      for (i = 0; yd[i] == (xd[i] || 0); i++);
+
+      if (yd[i] > (xd[i] || 0)) e--;
+
+      if (pr == null) {
+        sd = pr = Ctor.precision;
+        rm = Ctor.rounding;
+      } else if (dp) {
+        sd = pr + (x.e - y.e) + 1;
+      } else {
+        sd = pr;
+      }
+
+      if (sd < 0) {
+        qd.push(1);
+        more = true;
+      } else {
+
+        // Convert precision in number of base 10 digits to base 1e7 digits.
+        sd = sd / logBase + 2 | 0;
+        i = 0;
+
+        // divisor < 1e7
+        if (yL == 1) {
+          k = 0;
+          yd = yd[0];
+          sd++;
+
+          // k is the carry.
+          for (; (i < xL || k) && sd--; i++) {
+            t = k * base + (xd[i] || 0);
+            qd[i] = t / yd | 0;
+            k = t % yd | 0;
+          }
+
+          more = k || i < xL;
+
+        // divisor >= 1e7
+        } else {
+
+          // Normalise xd and yd so highest order digit of yd is >= base/2
+          k = base / (yd[0] + 1) | 0;
+
+          if (k > 1) {
+            yd = multiplyInteger(yd, k, base);
+            xd = multiplyInteger(xd, k, base);
+            yL = yd.length;
+            xL = xd.length;
+          }
+
+          xi = yL;
+          rem = xd.slice(0, yL);
+          remL = rem.length;
+
+          // Add zeros to make remainder as long as divisor.
+          for (; remL < yL;) rem[remL++] = 0;
+
+          yz = yd.slice();
+          yz.unshift(0);
+          yd0 = yd[0];
+
+          if (yd[1] >= base / 2) ++yd0;
+
+          do {
+            k = 0;
+
+            // Compare divisor and remainder.
+            cmp = compare(yd, rem, yL, remL);
+
+            // If divisor < remainder.
+            if (cmp < 0) {
+
+              // Calculate trial digit, k.
+              rem0 = rem[0];
+              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
+
+              // k will be how many times the divisor goes into the current remainder.
+              k = rem0 / yd0 | 0;
+
+              //  Algorithm:
+              //  1. product = divisor * trial digit (k)
+              //  2. if product > remainder: product -= divisor, k--
+              //  3. remainder -= product
+              //  4. if product was < remainder at 2:
+              //    5. compare new remainder and divisor
+              //    6. If remainder > divisor: remainder -= divisor, k++
+
+              if (k > 1) {
+                if (k >= base) k = base - 1;
+
+                // product = divisor * trial digit.
+                prod = multiplyInteger(yd, k, base);
+                prodL = prod.length;
+                remL = rem.length;
+
+                // Compare product and remainder.
+                cmp = compare(prod, rem, prodL, remL);
+
+                // product > remainder.
+                if (cmp == 1) {
+                  k--;
+
+                  // Subtract divisor from product.
+                  subtract(prod, yL < prodL ? yz : yd, prodL, base);
+                }
+              } else {
+
+                // cmp is -1.
+                // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1
+                // to avoid it. If k is 1 there is a need to compare yd and rem again below.
+                if (k == 0) cmp = k = 1;
+                prod = yd.slice();
+              }
+
+              prodL = prod.length;
+              if (prodL < remL) prod.unshift(0);
+
+              // Subtract product from remainder.
+              subtract(rem, prod, remL, base);
+
+              // If product was < previous remainder.
+              if (cmp == -1) {
+                remL = rem.length;
+
+                // Compare divisor and new remainder.
+                cmp = compare(yd, rem, yL, remL);
+
+                // If divisor < new remainder, subtract divisor from remainder.
+                if (cmp < 1) {
+                  k++;
+
+                  // Subtract divisor from remainder.
+                  subtract(rem, yL < remL ? yz : yd, remL, base);
+                }
+              }
+
+              remL = rem.length;
+            } else if (cmp === 0) {
+              k++;
+              rem = [0];
+            }    // if cmp === 1, k will be 0
+
+            // Add the next digit, k, to the result array.
+            qd[i++] = k;
+
+            // Update the remainder.
+            if (cmp && rem[0]) {
+              rem[remL++] = xd[xi] || 0;
+            } else {
+              rem = [xd[xi]];
+              remL = 1;
+            }
+
+          } while ((xi++ < xL || rem[0] !== void 0) && sd--);
+
+          more = rem[0] !== void 0;
+        }
+
+        // Leading zero?
+        if (!qd[0]) qd.shift();
+      }
+
+      // logBase is 1 when divide is being used for base conversion.
+      if (logBase == 1) {
+        q.e = e;
+        inexact = more;
+      } else {
+
+        // To calculate q.e, first get the number of digits of qd[0].
+        for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;
+        q.e = i + e * logBase - 1;
+
+        finalise(q, dp ? pr + q.e + 1 : pr, rm, more);
+      }
+
+      return q;
+    };
+  })();
+
+
+  /*
+   * Round `x` to `sd` significant digits using rounding mode `rm`.
+   * Check for over/under-flow.
+   */
+   function finalise(x, sd, rm, isTruncated) {
+    var digits, i, j, k, rd, roundUp, w, xd, xdi,
+      Ctor = x.constructor;
+
+    // Don't round if sd is null or undefined.
+    out: if (sd != null) {
+      xd = x.d;
+
+      // Infinity/NaN.
+      if (!xd) return x;
+
+      // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.
+      // w: the word of xd containing rd, a base 1e7 number.
+      // xdi: the index of w within xd.
+      // digits: the number of digits of w.
+      // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if
+      // they had leading zeros)
+      // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).
+
+      // Get the length of the first word of the digits array xd.
+      for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;
+      i = sd - digits;
+
+      // Is the rounding digit in the first word of xd?
+      if (i < 0) {
+        i += LOG_BASE;
+        j = sd;
+        w = xd[xdi = 0];
+
+        // Get the rounding digit at index j of w.
+        rd = w / mathpow(10, digits - j - 1) % 10 | 0;
+      } else {
+        xdi = Math.ceil((i + 1) / LOG_BASE);
+        k = xd.length;
+        if (xdi >= k) {
+          if (isTruncated) {
+
+            // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.
+            for (; k++ <= xdi;) xd.push(0);
+            w = rd = 0;
+            digits = 1;
+            i %= LOG_BASE;
+            j = i - LOG_BASE + 1;
+          } else {
+            break out;
+          }
+        } else {
+          w = k = xd[xdi];
+
+          // Get the number of digits of w.
+          for (digits = 1; k >= 10; k /= 10) digits++;
+
+          // Get the index of rd within w.
+          i %= LOG_BASE;
+
+          // Get the index of rd within w, adjusted for leading zeros.
+          // The number of leading zeros of w is given by LOG_BASE - digits.
+          j = i - LOG_BASE + digits;
+
+          // Get the rounding digit at index j of w.
+          rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;
+        }
+      }
+
+      // Are there any non-zero digits after the rounding digit?
+      isTruncated = isTruncated || sd < 0 ||
+        xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));
+
+      // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right
+      // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression
+      // will give 714.
+
+      roundUp = rm < 4
+        ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))
+        : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&
+
+          // Check whether the digit to the left of the rounding digit is odd.
+          ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||
+            rm == (x.s < 0 ? 8 : 7));
+
+      if (sd < 1 || !xd[0]) {
+        xd.length = 0;
+        if (roundUp) {
+
+          // Convert sd to decimal places.
+          sd -= x.e + 1;
+
+          // 1, 0.1, 0.01, 0.001, 0.0001 etc.
+          xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);
+          x.e = -sd || 0;
+        } else {
+
+          // Zero.
+          xd[0] = x.e = 0;
+        }
+
+        return x;
+      }
+
+      // Remove excess digits.
+      if (i == 0) {
+        xd.length = xdi;
+        k = 1;
+        xdi--;
+      } else {
+        xd.length = xdi + 1;
+        k = mathpow(10, LOG_BASE - i);
+
+        // E.g. 56700 becomes 56000 if 7 is the rounding digit.
+        // j > 0 means i > number of leading zeros of w.
+        xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;
+      }
+
+      if (roundUp) {
+        for (;;) {
+
+          // Is the digit to be rounded up in the first word of xd?
+          if (xdi == 0) {
+
+            // i will be the length of xd[0] before k is added.
+            for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;
+            j = xd[0] += k;
+            for (k = 1; j >= 10; j /= 10) k++;
+
+            // if i != k the length has increased.
+            if (i != k) {
+              x.e++;
+              if (xd[0] == BASE) xd[0] = 1;
+            }
+
+            break;
+          } else {
+            xd[xdi] += k;
+            if (xd[xdi] != BASE) break;
+            xd[xdi--] = 0;
+            k = 1;
+          }
+        }
+      }
+
+      // Remove trailing zeros.
+      for (i = xd.length; xd[--i] === 0;) xd.pop();
+    }
+
+    if (external) {
+
+      // Overflow?
+      if (x.e > Ctor.maxE) {
+
+        // Infinity.
+        x.d = null;
+        x.e = NaN;
+
+      // Underflow?
+      } else if (x.e < Ctor.minE) {
+
+        // Zero.
+        x.e = 0;
+        x.d = [0];
+        // Ctor.underflow = true;
+      } // else Ctor.underflow = false;
+    }
+
+    return x;
+  }
+
+
+  function finiteToString(x, isExp, sd) {
+    if (!x.isFinite()) return nonFiniteToString(x);
+    var k,
+      e = x.e,
+      str = digitsToString(x.d),
+      len = str.length;
+
+    if (isExp) {
+      if (sd && (k = sd - len) > 0) {
+        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);
+      } else if (len > 1) {
+        str = str.charAt(0) + '.' + str.slice(1);
+      }
+
+      str = str + (x.e < 0 ? 'e' : 'e+') + x.e;
+    } else if (e < 0) {
+      str = '0.' + getZeroString(-e - 1) + str;
+      if (sd && (k = sd - len) > 0) str += getZeroString(k);
+    } else if (e >= len) {
+      str += getZeroString(e + 1 - len);
+      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);
+    } else {
+      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);
+      if (sd && (k = sd - len) > 0) {
+        if (e + 1 === len) str += '.';
+        str += getZeroString(k);
+      }
+    }
+
+    return str;
+  }
+
+
+  // Calculate the base 10 exponent from the base 1e7 exponent.
+  function getBase10Exponent(digits, e) {
+    var w = digits[0];
+
+    // Add the number of digits of the first word of the digits array.
+    for ( e *= LOG_BASE; w >= 10; w /= 10) e++;
+    return e;
+  }
+
+
+  function getLn10(Ctor, sd, pr) {
+    if (sd > LN10_PRECISION) {
+
+      // Reset global state in case the exception is caught.
+      external = true;
+      if (pr) Ctor.precision = pr;
+      throw Error(precisionLimitExceeded);
+    }
+    return finalise(new Ctor(LN10), sd, 1, true);
+  }
+
+
+  function getPi(Ctor, sd, rm) {
+    if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);
+    return finalise(new Ctor(PI), sd, rm, true);
+  }
+
+
+  function getPrecision(digits) {
+    var w = digits.length - 1,
+      len = w * LOG_BASE + 1;
+
+    w = digits[w];
+
+    // If non-zero...
+    if (w) {
+
+      // Subtract the number of trailing zeros of the last word.
+      for (; w % 10 == 0; w /= 10) len--;
+
+      // Add the number of digits of the first word.
+      for (w = digits[0]; w >= 10; w /= 10) len++;
+    }
+
+    return len;
+  }
+
+
+  function getZeroString(k) {
+    var zs = '';
+    for (; k--;) zs += '0';
+    return zs;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an
+   * integer of type number.
+   *
+   * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.
+   *
+   */
+  function intPow(Ctor, x, n, pr) {
+    var isTruncated,
+      r = new Ctor(1),
+
+      // Max n of 9007199254740991 takes 53 loop iterations.
+      // Maximum digits array length; leaves [28, 34] guard digits.
+      k = Math.ceil(pr / LOG_BASE + 4);
+
+    external = false;
+
+    for (;;) {
+      if (n % 2) {
+        r = r.times(x);
+        if (truncate(r.d, k)) isTruncated = true;
+      }
+
+      n = mathfloor(n / 2);
+      if (n === 0) {
+
+        // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.
+        n = r.d.length - 1;
+        if (isTruncated && r.d[n] === 0) ++r.d[n];
+        break;
+      }
+
+      x = x.times(x);
+      truncate(x.d, k);
+    }
+
+    external = true;
+
+    return r;
+  }
+
+
+  function isOdd(n) {
+    return n.d[n.d.length - 1] & 1;
+  }
+
+
+  /*
+   * Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.
+   */
+  function maxOrMin(Ctor, args, ltgt) {
+    var y,
+      x = new Ctor(args[0]),
+      i = 0;
+
+    for (; ++i < args.length;) {
+      y = new Ctor(args[i]);
+      if (!y.s) {
+        x = y;
+        break;
+      } else if (x[ltgt](y)) {
+        x = y;
+      }
+    }
+
+    return x;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant
+   * digits.
+   *
+   * Taylor/Maclaurin series.
+   *
+   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...
+   *
+   * Argument reduction:
+   *   Repeat x = x / 32, k += 5, until |x| < 0.1
+   *   exp(x) = exp(x / 2^k)^(2^k)
+   *
+   * Previously, the argument was initially reduced by
+   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)
+   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was
+   * found to be slower than just dividing repeatedly by 32 as above.
+   *
+   * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000
+   * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000
+   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)
+   *
+   *  exp(Infinity)  = Infinity
+   *  exp(-Infinity) = 0
+   *  exp(NaN)       = NaN
+   *  exp(±0)        = 1
+   *
+   *  exp(x) is non-terminating for any finite, non-zero x.
+   *
+   *  The result will always be correctly rounded.
+   *
+   */
+  function naturalExponential(x, sd) {
+    var denominator, guard, j, pow, sum, t, wpr,
+      rep = 0,
+      i = 0,
+      k = 0,
+      Ctor = x.constructor,
+      rm = Ctor.rounding,
+      pr = Ctor.precision;
+
+    // 0/NaN/Infinity?
+    if (!x.d || !x.d[0] || x.e > 17) {
+
+      return new Ctor(x.d
+        ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0
+        : x.s ? x.s < 0 ? 0 : x : 0 / 0);
+    }
+
+    if (sd == null) {
+      external = false;
+      wpr = pr;
+    } else {
+      wpr = sd;
+    }
+
+    t = new Ctor(0.03125);
+
+    // while abs(x) >= 0.1
+    while (x.e > -2) {
+
+      // x = x / 2^5
+      x = x.times(t);
+      k += 5;
+    }
+
+    // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision
+    // necessary to ensure the first 4 rounding digits are correct.
+    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;
+    wpr += guard;
+    denominator = pow = sum = new Ctor(1);
+    Ctor.precision = wpr;
+
+    for (;;) {
+      pow = finalise(pow.times(x), wpr, 1);
+      denominator = denominator.times(++i);
+      t = sum.plus(divide(pow, denominator, wpr, 1));
+
+      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+        j = k;
+        while (j--) sum = finalise(sum.times(sum), wpr, 1);
+
+        // Check to see if the first 4 rounding digits are [49]999.
+        // If so, repeat the summation with a higher precision, otherwise
+        // e.g. with precision: 18, rounding: 1
+        // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)
+        // `wpr - guard` is the index of first rounding digit.
+        if (sd == null) {
+
+          if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+            Ctor.precision = wpr += 10;
+            denominator = pow = t = new Ctor(1);
+            i = 0;
+            rep++;
+          } else {
+            return finalise(sum, Ctor.precision = pr, rm, external = true);
+          }
+        } else {
+          Ctor.precision = pr;
+          return sum;
+        }
+      }
+
+      sum = t;
+    }
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant
+   * digits.
+   *
+   *  ln(-n)        = NaN
+   *  ln(0)         = -Infinity
+   *  ln(-0)        = -Infinity
+   *  ln(1)         = 0
+   *  ln(Infinity)  = Infinity
+   *  ln(-Infinity) = NaN
+   *  ln(NaN)       = NaN
+   *
+   *  ln(n) (n != 1) is non-terminating.
+   *
+   */
+  function naturalLogarithm(y, sd) {
+    var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,
+      n = 1,
+      guard = 10,
+      x = y,
+      xd = x.d,
+      Ctor = x.constructor,
+      rm = Ctor.rounding,
+      pr = Ctor.precision;
+
+    // Is x negative or Infinity, NaN, 0 or 1?
+    if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {
+      return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);
+    }
+
+    if (sd == null) {
+      external = false;
+      wpr = pr;
+    } else {
+      wpr = sd;
+    }
+
+    Ctor.precision = wpr += guard;
+    c = digitsToString(xd);
+    c0 = c.charAt(0);
+
+    if (Math.abs(e = x.e) < 1.5e15) {
+
+      // Argument reduction.
+      // The series converges faster the closer the argument is to 1, so using
+      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b
+      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,
+      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can
+      // later be divided by this number, then separate out the power of 10 using
+      // ln(a*10^b) = ln(a) + b*ln(10).
+
+      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).
+      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {
+      // max n is 6 (gives 0.7 - 1.3)
+      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {
+        x = x.times(y);
+        c = digitsToString(x.d);
+        c0 = c.charAt(0);
+        n++;
+      }
+
+      e = x.e;
+
+      if (c0 > 1) {
+        x = new Ctor('0.' + c);
+        e++;
+      } else {
+        x = new Ctor(c0 + '.' + c.slice(1));
+      }
+    } else {
+
+      // The argument reduction method above may result in overflow if the argument y is a massive
+      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this
+      // function using ln(x*10^e) = ln(x) + e*ln(10).
+      t = getLn10(Ctor, wpr + 2, pr).times(e + '');
+      x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);
+      Ctor.precision = pr;
+
+      return sd == null ? finalise(x, pr, rm, external = true) : x;
+    }
+
+    // x1 is x reduced to a value near 1.
+    x1 = x;
+
+    // Taylor series.
+    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)
+    // where x = (y - 1)/(y + 1)    (|x| < 1)
+    sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);
+    x2 = finalise(x.times(x), wpr, 1);
+    denominator = 3;
+
+    for (;;) {
+      numerator = finalise(numerator.times(x2), wpr, 1);
+      t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));
+
+      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+        sum = sum.times(2);
+
+        // Reverse the argument reduction. Check that e is not 0 because, besides preventing an
+        // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.
+        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));
+        sum = divide(sum, new Ctor(n), wpr, 1);
+
+        // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has
+        // been repeated previously) and the first 4 rounding digits 9999?
+        // If so, restart the summation with a higher precision, otherwise
+        // e.g. with precision: 12, rounding: 1
+        // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.
+        // `wpr - guard` is the index of first rounding digit.
+        if (sd == null) {
+          if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+            Ctor.precision = wpr += guard;
+            t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);
+            x2 = finalise(x.times(x), wpr, 1);
+            denominator = rep = 1;
+          } else {
+            return finalise(sum, Ctor.precision = pr, rm, external = true);
+          }
+        } else {
+          Ctor.precision = pr;
+          return sum;
+        }
+      }
+
+      sum = t;
+      denominator += 2;
+    }
+  }
+
+
+  // ±Infinity, NaN.
+  function nonFiniteToString(x) {
+    // Unsigned.
+    return String(x.s * x.s / 0);
+  }
+
+
+  /*
+   * Parse the value of a new Decimal `x` from string `str`.
+   */
+  function parseDecimal(x, str) {
+    var e, i, len;
+
+    // Decimal point?
+    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
+
+    // Exponential form?
+    if ((i = str.search(/e/i)) > 0) {
+
+      // Determine exponent.
+      if (e < 0) e = i;
+      e += +str.slice(i + 1);
+      str = str.substring(0, i);
+    } else if (e < 0) {
+
+      // Integer.
+      e = str.length;
+    }
+
+    // Determine leading zeros.
+    for (i = 0; str.charCodeAt(i) === 48; i++);
+
+    // Determine trailing zeros.
+    for (len = str.length; str.charCodeAt(len - 1) === 48; --len);
+    str = str.slice(i, len);
+
+    if (str) {
+      len -= i;
+      x.e = e = e - i - 1;
+      x.d = [];
+
+      // Transform base
+
+      // e is the base 10 exponent.
+      // i is where to slice str to get the first word of the digits array.
+      i = (e + 1) % LOG_BASE;
+      if (e < 0) i += LOG_BASE;
+
+      if (i < len) {
+        if (i) x.d.push(+str.slice(0, i));
+        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));
+        str = str.slice(i);
+        i = LOG_BASE - str.length;
+      } else {
+        i -= len;
+      }
+
+      for (; i--;) str += '0';
+      x.d.push(+str);
+
+      if (external) {
+
+        // Overflow?
+        if (x.e > x.constructor.maxE) {
+
+          // Infinity.
+          x.d = null;
+          x.e = NaN;
+
+        // Underflow?
+        } else if (x.e < x.constructor.minE) {
+
+          // Zero.
+          x.e = 0;
+          x.d = [0];
+          // x.constructor.underflow = true;
+        } // else x.constructor.underflow = false;
+      }
+    } else {
+
+      // Zero.
+      x.e = 0;
+      x.d = [0];
+    }
+
+    return x;
+  }
+
+
+  /*
+   * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.
+   */
+  function parseOther(x, str) {
+    var base, Ctor, divisor, i, isFloat, len, p, xd, xe;
+
+    if (str.indexOf('_') > -1) {
+      str = str.replace(/(\d)_(?=\d)/g, '$1');
+      if (isDecimal.test(str)) return parseDecimal(x, str);
+    } else if (str === 'Infinity' || str === 'NaN') {
+      if (!+str) x.s = NaN;
+      x.e = NaN;
+      x.d = null;
+      return x;
+    }
+
+    if (isHex.test(str))  {
+      base = 16;
+      str = str.toLowerCase();
+    } else if (isBinary.test(str))  {
+      base = 2;
+    } else if (isOctal.test(str))  {
+      base = 8;
+    } else {
+      throw Error(invalidArgument + str);
+    }
+
+    // Is there a binary exponent part?
+    i = str.search(/p/i);
+
+    if (i > 0) {
+      p = +str.slice(i + 1);
+      str = str.substring(2, i);
+    } else {
+      str = str.slice(2);
+    }
+
+    // Convert `str` as an integer then divide the result by `base` raised to a power such that the
+    // fraction part will be restored.
+    i = str.indexOf('.');
+    isFloat = i >= 0;
+    Ctor = x.constructor;
+
+    if (isFloat) {
+      str = str.replace('.', '');
+      len = str.length;
+      i = len - i;
+
+      // log[10](16) = 1.2041... , log[10](88) = 1.9444....
+      divisor = intPow(Ctor, new Ctor(base), i, i * 2);
+    }
+
+    xd = convertBase(str, base, BASE);
+    xe = xd.length - 1;
+
+    // Remove trailing zeros.
+    for (i = xe; xd[i] === 0; --i) xd.pop();
+    if (i < 0) return new Ctor(x.s * 0);
+    x.e = getBase10Exponent(xd, xe);
+    x.d = xd;
+    external = false;
+
+    // At what precision to perform the division to ensure exact conversion?
+    // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)
+    // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412
+    // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.
+    // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount
+    // Therefore using 4 * the number of digits of str will always be enough.
+    if (isFloat) x = divide(x, divisor, len * 4);
+
+    // Multiply by the binary exponent part if present.
+    if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));
+    external = true;
+
+    return x;
+  }
+
+
+  /*
+   * sin(x) = x - x^3/3! + x^5/5! - ...
+   * |x| < pi/2
+   *
+   */
+  function sine(Ctor, x) {
+    var k,
+      len = x.d.length;
+
+    if (len < 3) {
+      return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);
+    }
+
+    // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)
+    // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)
+    // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))
+
+    // Estimate the optimum number of times to use the argument reduction.
+    k = 1.4 * Math.sqrt(len);
+    k = k > 16 ? 16 : k | 0;
+
+    x = x.times(1 / tinyPow(5, k));
+    x = taylorSeries(Ctor, 2, x, x);
+
+    // Reverse argument reduction
+    var sin2_x,
+      d5 = new Ctor(5),
+      d16 = new Ctor(16),
+      d20 = new Ctor(20);
+    for (; k--;) {
+      sin2_x = x.times(x);
+      x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));
+    }
+
+    return x;
+  }
+
+
+  // Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.
+  function taylorSeries(Ctor, n, x, y, isHyperbolic) {
+    var j, t, u, x2,
+      i = 1,
+      pr = Ctor.precision,
+      k = Math.ceil(pr / LOG_BASE);
+
+    external = false;
+    x2 = x.times(x);
+    u = new Ctor(y);
+
+    for (;;) {
+      t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);
+      u = isHyperbolic ? y.plus(t) : y.minus(t);
+      y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);
+      t = u.plus(y);
+
+      if (t.d[k] !== void 0) {
+        for (j = k; t.d[j] === u.d[j] && j--;);
+        if (j == -1) break;
+      }
+
+      j = u;
+      u = y;
+      y = t;
+      t = j;
+      i++;
+    }
+
+    external = true;
+    t.d.length = k + 1;
+
+    return t;
+  }
+
+
+  // Exponent e must be positive and non-zero.
+  function tinyPow(b, e) {
+    var n = b;
+    while (--e) n *= b;
+    return n;
+  }
+
+
+  // Return the absolute value of `x` reduced to less than or equal to half pi.
+  function toLessThanHalfPi(Ctor, x) {
+    var t,
+      isNeg = x.s < 0,
+      pi = getPi(Ctor, Ctor.precision, 1),
+      halfPi = pi.times(0.5);
+
+    x = x.abs();
+
+    if (x.lte(halfPi)) {
+      quadrant = isNeg ? 4 : 1;
+      return x;
+    }
+
+    t = x.divToInt(pi);
+
+    if (t.isZero()) {
+      quadrant = isNeg ? 3 : 2;
+    } else {
+      x = x.minus(t.times(pi));
+
+      // 0 <= x < pi
+      if (x.lte(halfPi)) {
+        quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);
+        return x;
+      }
+
+      quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);
+    }
+
+    return x.minus(pi).abs();
+  }
+
+
+  /*
+   * Return the value of Decimal `x` as a string in base `baseOut`.
+   *
+   * If the optional `sd` argument is present include a binary exponent suffix.
+   */
+  function toStringBinary(x, baseOut, sd, rm) {
+    var base, e, i, k, len, roundUp, str, xd, y,
+      Ctor = x.constructor,
+      isExp = sd !== void 0;
+
+    if (isExp) {
+      checkInt32(sd, 1, MAX_DIGITS);
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+    } else {
+      sd = Ctor.precision;
+      rm = Ctor.rounding;
+    }
+
+    if (!x.isFinite()) {
+      str = nonFiniteToString(x);
+    } else {
+      str = finiteToString(x);
+      i = str.indexOf('.');
+
+      // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:
+      // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))
+      // minBinaryExponent = floor(decimalExponent * log[2](10))
+      // log[2](10) = 3.321928094887362347870319429489390175864
+
+      if (isExp) {
+        base = 2;
+        if (baseOut == 16) {
+          sd = sd * 4 - 3;
+        } else if (baseOut == 8) {
+          sd = sd * 3 - 2;
+        }
+      } else {
+        base = baseOut;
+      }
+
+      // Convert the number as an integer then divide the result by its base raised to a power such
+      // that the fraction part will be restored.
+
+      // Non-integer.
+      if (i >= 0) {
+        str = str.replace('.', '');
+        y = new Ctor(1);
+        y.e = str.length - i;
+        y.d = convertBase(finiteToString(y), 10, base);
+        y.e = y.d.length;
+      }
+
+      xd = convertBase(str, 10, base);
+      e = len = xd.length;
+
+      // Remove trailing zeros.
+      for (; xd[--len] == 0;) xd.pop();
+
+      if (!xd[0]) {
+        str = isExp ? '0p+0' : '0';
+      } else {
+        if (i < 0) {
+          e--;
+        } else {
+          x = new Ctor(x);
+          x.d = xd;
+          x.e = e;
+          x = divide(x, y, sd, rm, 0, base);
+          xd = x.d;
+          e = x.e;
+          roundUp = inexact;
+        }
+
+        // The rounding digit, i.e. the digit after the digit that may be rounded up.
+        i = xd[sd];
+        k = base / 2;
+        roundUp = roundUp || xd[sd + 1] !== void 0;
+
+        roundUp = rm < 4
+          ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))
+          : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||
+            rm === (x.s < 0 ? 8 : 7));
+
+        xd.length = sd;
+
+        if (roundUp) {
+
+          // Rounding up may mean the previous digit has to be rounded up and so on.
+          for (; ++xd[--sd] > base - 1;) {
+            xd[sd] = 0;
+            if (!sd) {
+              ++e;
+              xd.unshift(1);
+            }
+          }
+        }
+
+        // Determine trailing zeros.
+        for (len = xd.length; !xd[len - 1]; --len);
+
+        // E.g. [4, 11, 15] becomes 4bf.
+        for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);
+
+        // Add binary exponent suffix?
+        if (isExp) {
+          if (len > 1) {
+            if (baseOut == 16 || baseOut == 8) {
+              i = baseOut == 16 ? 4 : 3;
+              for (--len; len % i; len++) str += '0';
+              xd = convertBase(str, base, baseOut);
+              for (len = xd.length; !xd[len - 1]; --len);
+
+              // xd[0] will always be be 1
+              for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);
+            } else {
+              str = str.charAt(0) + '.' + str.slice(1);
+            }
+          }
+
+          str =  str + (e < 0 ? 'p' : 'p+') + e;
+        } else if (e < 0) {
+          for (; ++e;) str = '0' + str;
+          str = '0.' + str;
+        } else {
+          if (++e > len) for (e -= len; e-- ;) str += '0';
+          else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);
+        }
+      }
+
+      str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;
+    }
+
+    return x.s < 0 ? '-' + str : str;
+  }
+
+
+  // Does not strip trailing zeros.
+  function truncate(arr, len) {
+    if (arr.length > len) {
+      arr.length = len;
+      return true;
+    }
+  }
+
+
+  // Decimal methods
+
+
+  /*
+   *  abs
+   *  acos
+   *  acosh
+   *  add
+   *  asin
+   *  asinh
+   *  atan
+   *  atanh
+   *  atan2
+   *  cbrt
+   *  ceil
+   *  clamp
+   *  clone
+   *  config
+   *  cos
+   *  cosh
+   *  div
+   *  exp
+   *  floor
+   *  hypot
+   *  ln
+   *  log
+   *  log2
+   *  log10
+   *  max
+   *  min
+   *  mod
+   *  mul
+   *  pow
+   *  random
+   *  round
+   *  set
+   *  sign
+   *  sin
+   *  sinh
+   *  sqrt
+   *  sub
+   *  sum
+   *  tan
+   *  tanh
+   *  trunc
+   */
+
+
+  /*
+   * Return a new Decimal whose value is the absolute value of `x`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function abs(x) {
+    return new this(x).abs();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arccosine in radians of `x`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function acos(x) {
+    return new this(x).acos();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function acosh(x) {
+    return new this(x).acosh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   * y {number|string|Decimal}
+   *
+   */
+  function add(x, y) {
+    return new this(x).plus(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function asin(x) {
+    return new this(x).asin();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function asinh(x) {
+    return new this(x).asinh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function atan(x) {
+    return new this(x).atan();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function atanh(x) {
+    return new this(x).atanh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi
+   * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-pi, pi]
+   *
+   * y {number|string|Decimal} The y-coordinate.
+   * x {number|string|Decimal} The x-coordinate.
+   *
+   * atan2(±0, -0)               = ±pi
+   * atan2(±0, +0)               = ±0
+   * atan2(±0, -x)               = ±pi for x > 0
+   * atan2(±0, x)                = ±0 for x > 0
+   * atan2(-y, ±0)               = -pi/2 for y > 0
+   * atan2(y, ±0)                = pi/2 for y > 0
+   * atan2(±y, -Infinity)        = ±pi for finite y > 0
+   * atan2(±y, +Infinity)        = ±0 for finite y > 0
+   * atan2(±Infinity, x)         = ±pi/2 for finite x
+   * atan2(±Infinity, -Infinity) = ±3*pi/4
+   * atan2(±Infinity, +Infinity) = ±pi/4
+   * atan2(NaN, x) = NaN
+   * atan2(y, NaN) = NaN
+   *
+   */
+  function atan2(y, x) {
+    y = new this(y);
+    x = new this(x);
+    var r,
+      pr = this.precision,
+      rm = this.rounding,
+      wpr = pr + 4;
+
+    // Either NaN
+    if (!y.s || !x.s) {
+      r = new this(NaN);
+
+    // Both ±Infinity
+    } else if (!y.d && !x.d) {
+      r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);
+      r.s = y.s;
+
+    // x is ±Infinity or y is ±0
+    } else if (!x.d || y.isZero()) {
+      r = x.s < 0 ? getPi(this, pr, rm) : new this(0);
+      r.s = y.s;
+
+    // y is ±Infinity or x is ±0
+    } else if (!y.d || x.isZero()) {
+      r = getPi(this, wpr, 1).times(0.5);
+      r.s = y.s;
+
+    // Both non-zero and finite
+    } else if (x.s < 0) {
+      this.precision = wpr;
+      this.rounding = 1;
+      r = this.atan(divide(y, x, wpr, 1));
+      x = getPi(this, wpr, 1);
+      this.precision = pr;
+      this.rounding = rm;
+      r = y.s < 0 ? r.minus(x) : r.plus(x);
+    } else {
+      r = this.atan(divide(y, x, wpr, 1));
+    }
+
+    return r;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function cbrt(x) {
+    return new this(x).cbrt();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function ceil(x) {
+    return finalise(x = new this(x), x.e + 1, 2);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.
+   *
+   * x {number|string|Decimal}
+   * min {number|string|Decimal}
+   * max {number|string|Decimal}
+   *
+   */
+  function clamp(x, min, max) {
+    return new this(x).clamp(min, max);
+  }
+
+
+  /*
+   * Configure global settings for a Decimal constructor.
+   *
+   * `obj` is an object with one or more of the following properties,
+   *
+   *   precision  {number}
+   *   rounding   {number}
+   *   toExpNeg   {number}
+   *   toExpPos   {number}
+   *   maxE       {number}
+   *   minE       {number}
+   *   modulo     {number}
+   *   crypto     {boolean|number}
+   *   defaults   {true}
+   *
+   * E.g. Decimal.config({ precision: 20, rounding: 4 })
+   *
+   */
+  function config(obj) {
+    if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');
+    var i, p, v,
+      useDefaults = obj.defaults === true,
+      ps = [
+        'precision', 1, MAX_DIGITS,
+        'rounding', 0, 8,
+        'toExpNeg', -EXP_LIMIT, 0,
+        'toExpPos', 0, EXP_LIMIT,
+        'maxE', 0, EXP_LIMIT,
+        'minE', -EXP_LIMIT, 0,
+        'modulo', 0, 9
+      ];
+
+    for (i = 0; i < ps.length; i += 3) {
+      if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];
+      if ((v = obj[p]) !== void 0) {
+        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;
+        else throw Error(invalidArgument + p + ': ' + v);
+      }
+    }
+
+    if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];
+    if ((v = obj[p]) !== void 0) {
+      if (v === true || v === false || v === 0 || v === 1) {
+        if (v) {
+          if (typeof crypto != 'undefined' && crypto &&
+            (crypto.getRandomValues || crypto.randomBytes)) {
+            this[p] = true;
+          } else {
+            throw Error(cryptoUnavailable);
+          }
+        } else {
+          this[p] = false;
+        }
+      } else {
+        throw Error(invalidArgument + p + ': ' + v);
+      }
+    }
+
+    return this;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function cos(x) {
+    return new this(x).cos();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function cosh(x) {
+    return new this(x).cosh();
+  }
+
+
+  /*
+   * Create and return a Decimal constructor with the same configuration properties as this Decimal
+   * constructor.
+   *
+   */
+  function clone(obj) {
+    var i, p, ps;
+
+    /*
+     * The Decimal constructor and exported function.
+     * Return a new Decimal instance.
+     *
+     * v {number|string|Decimal} A numeric value.
+     *
+     */
+    function Decimal(v) {
+      var e, i, t,
+        x = this;
+
+      // Decimal called without new.
+      if (!(x instanceof Decimal)) return new Decimal(v);
+
+      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor
+      // which points to Object.
+      x.constructor = Decimal;
+
+      // Duplicate.
+      if (isDecimalInstance(v)) {
+        x.s = v.s;
+
+        if (external) {
+          if (!v.d || v.e > Decimal.maxE) {
+
+            // Infinity.
+            x.e = NaN;
+            x.d = null;
+          } else if (v.e < Decimal.minE) {
+
+            // Zero.
+            x.e = 0;
+            x.d = [0];
+          } else {
+            x.e = v.e;
+            x.d = v.d.slice();
+          }
+        } else {
+          x.e = v.e;
+          x.d = v.d ? v.d.slice() : v.d;
+        }
+
+        return;
+      }
+
+      t = typeof v;
+
+      if (t === 'number') {
+        if (v === 0) {
+          x.s = 1 / v < 0 ? -1 : 1;
+          x.e = 0;
+          x.d = [0];
+          return;
+        }
+
+        if (v < 0) {
+          v = -v;
+          x.s = -1;
+        } else {
+          x.s = 1;
+        }
+
+        // Fast path for small integers.
+        if (v === ~~v && v < 1e7) {
+          for (e = 0, i = v; i >= 10; i /= 10) e++;
+
+          if (external) {
+            if (e > Decimal.maxE) {
+              x.e = NaN;
+              x.d = null;
+            } else if (e < Decimal.minE) {
+              x.e = 0;
+              x.d = [0];
+            } else {
+              x.e = e;
+              x.d = [v];
+            }
+          } else {
+            x.e = e;
+            x.d = [v];
+          }
+
+          return;
+
+        // Infinity, NaN.
+        } else if (v * 0 !== 0) {
+          if (!v) x.s = NaN;
+          x.e = NaN;
+          x.d = null;
+          return;
+        }
+
+        return parseDecimal(x, v.toString());
+
+      } else if (t !== 'string') {
+        throw Error(invalidArgument + v);
+      }
+
+      // Minus sign?
+      if ((i = v.charCodeAt(0)) === 45) {
+        v = v.slice(1);
+        x.s = -1;
+      } else {
+        // Plus sign?
+        if (i === 43) v = v.slice(1);
+        x.s = 1;
+      }
+
+      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);
+    }
+
+    Decimal.prototype = P;
+
+    Decimal.ROUND_UP = 0;
+    Decimal.ROUND_DOWN = 1;
+    Decimal.ROUND_CEIL = 2;
+    Decimal.ROUND_FLOOR = 3;
+    Decimal.ROUND_HALF_UP = 4;
+    Decimal.ROUND_HALF_DOWN = 5;
+    Decimal.ROUND_HALF_EVEN = 6;
+    Decimal.ROUND_HALF_CEIL = 7;
+    Decimal.ROUND_HALF_FLOOR = 8;
+    Decimal.EUCLID = 9;
+
+    Decimal.config = Decimal.set = config;
+    Decimal.clone = clone;
+    Decimal.isDecimal = isDecimalInstance;
+
+    Decimal.abs = abs;
+    Decimal.acos = acos;
+    Decimal.acosh = acosh;        // ES6
+    Decimal.add = add;
+    Decimal.asin = asin;
+    Decimal.asinh = asinh;        // ES6
+    Decimal.atan = atan;
+    Decimal.atanh = atanh;        // ES6
+    Decimal.atan2 = atan2;
+    Decimal.cbrt = cbrt;          // ES6
+    Decimal.ceil = ceil;
+    Decimal.clamp = clamp;
+    Decimal.cos = cos;
+    Decimal.cosh = cosh;          // ES6
+    Decimal.div = div;
+    Decimal.exp = exp;
+    Decimal.floor = floor;
+    Decimal.hypot = hypot;        // ES6
+    Decimal.ln = ln;
+    Decimal.log = log;
+    Decimal.log10 = log10;        // ES6
+    Decimal.log2 = log2;          // ES6
+    Decimal.max = max;
+    Decimal.min = min;
+    Decimal.mod = mod;
+    Decimal.mul = mul;
+    Decimal.pow = pow;
+    Decimal.random = random;
+    Decimal.round = round;
+    Decimal.sign = sign;          // ES6
+    Decimal.sin = sin;
+    Decimal.sinh = sinh;          // ES6
+    Decimal.sqrt = sqrt;
+    Decimal.sub = sub;
+    Decimal.sum = sum;
+    Decimal.tan = tan;
+    Decimal.tanh = tanh;          // ES6
+    Decimal.trunc = trunc;        // ES6
+
+    if (obj === void 0) obj = {};
+    if (obj) {
+      if (obj.defaults !== true) {
+        ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];
+        for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];
+      }
+    }
+
+    Decimal.config(obj);
+
+    return Decimal;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   * y {number|string|Decimal}
+   *
+   */
+  function div(x, y) {
+    return new this(x).div(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} The power to which to raise the base of the natural log.
+   *
+   */
+  function exp(x) {
+    return new this(x).exp();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function floor(x) {
+    return finalise(x = new this(x), x.e + 1, 3);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,
+   * rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)
+   *
+   * arguments {number|string|Decimal}
+   *
+   */
+  function hypot() {
+    var i, n,
+      t = new this(0);
+
+    external = false;
+
+    for (i = 0; i < arguments.length;) {
+      n = new this(arguments[i++]);
+      if (!n.d) {
+        if (n.s) {
+          external = true;
+          return new this(1 / 0);
+        }
+        t = n;
+      } else if (t.d) {
+        t = t.plus(n.times(n));
+      }
+    }
+
+    external = true;
+
+    return t.sqrt();
+  }
+
+
+  /*
+   * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),
+   * otherwise return false.
+   *
+   */
+  function isDecimalInstance(obj) {
+    return obj instanceof Decimal || obj && obj.toStringTag === tag || false;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function ln(x) {
+    return new this(x).ln();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base
+   * is specified, rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   * log[y](x)
+   *
+   * x {number|string|Decimal} The argument of the logarithm.
+   * y {number|string|Decimal} The base of the logarithm.
+   *
+   */
+  function log(x, y) {
+    return new this(x).log(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function log2(x) {
+    return new this(x).log(2);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function log10(x) {
+    return new this(x).log(10);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the maximum of the arguments.
+   *
+   * arguments {number|string|Decimal}
+   *
+   */
+  function max() {
+    return maxOrMin(this, arguments, 'lt');
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the minimum of the arguments.
+   *
+   * arguments {number|string|Decimal}
+   *
+   */
+  function min() {
+    return maxOrMin(this, arguments, 'gt');
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits
+   * using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   * y {number|string|Decimal}
+   *
+   */
+  function mod(x, y) {
+    return new this(x).mod(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   * y {number|string|Decimal}
+   *
+   */
+  function mul(x, y) {
+    return new this(x).mul(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} The base.
+   * y {number|string|Decimal} The exponent.
+   *
+   */
+  function pow(x, y) {
+    return new this(x).pow(y);
+  }
+
+
+  /*
+   * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with
+   * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros
+   * are produced).
+   *
+   * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.
+   *
+   */
+  function random(sd) {
+    var d, e, k, n,
+      i = 0,
+      r = new this(1),
+      rd = [];
+
+    if (sd === void 0) sd = this.precision;
+    else checkInt32(sd, 1, MAX_DIGITS);
+
+    k = Math.ceil(sd / LOG_BASE);
+
+    if (!this.crypto) {
+      for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;
+
+    // Browsers supporting crypto.getRandomValues.
+    } else if (crypto.getRandomValues) {
+      d = crypto.getRandomValues(new Uint32Array(k));
+
+      for (; i < k;) {
+        n = d[i];
+
+        // 0 <= n < 4294967296
+        // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).
+        if (n >= 4.29e9) {
+          d[i] = crypto.getRandomValues(new Uint32Array(1))[0];
+        } else {
+
+          // 0 <= n <= 4289999999
+          // 0 <= (n % 1e7) <= 9999999
+          rd[i++] = n % 1e7;
+        }
+      }
+
+    // Node.js supporting crypto.randomBytes.
+    } else if (crypto.randomBytes) {
+
+      // buffer
+      d = crypto.randomBytes(k *= 4);
+
+      for (; i < k;) {
+
+        // 0 <= n < 2147483648
+        n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);
+
+        // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).
+        if (n >= 2.14e9) {
+          crypto.randomBytes(4).copy(d, i);
+        } else {
+
+          // 0 <= n <= 2139999999
+          // 0 <= (n % 1e7) <= 9999999
+          rd.push(n % 1e7);
+          i += 4;
+        }
+      }
+
+      i = k / 4;
+    } else {
+      throw Error(cryptoUnavailable);
+    }
+
+    k = rd[--i];
+    sd %= LOG_BASE;
+
+    // Convert trailing digits to zeros according to sd.
+    if (k && sd) {
+      n = mathpow(10, LOG_BASE - sd);
+      rd[i] = (k / n | 0) * n;
+    }
+
+    // Remove trailing words which are zero.
+    for (; rd[i] === 0; i--) rd.pop();
+
+    // Zero?
+    if (i < 0) {
+      e = 0;
+      rd = [0];
+    } else {
+      e = -1;
+
+      // Remove leading words which are zero and adjust exponent accordingly.
+      for (; rd[0] === 0; e -= LOG_BASE) rd.shift();
+
+      // Count the digits of the first word of rd to determine leading zeros.
+      for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;
+
+      // Adjust the exponent for leading zeros of the first word of rd.
+      if (k < LOG_BASE) e -= LOG_BASE - k;
+    }
+
+    r.e = e;
+    r.d = rd;
+
+    return r;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.
+   *
+   * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function round(x) {
+    return finalise(x = new this(x), x.e + 1, this.rounding);
+  }
+
+
+  /*
+   * Return
+   *   1    if x > 0,
+   *  -1    if x < 0,
+   *   0    if x is 0,
+   *  -0    if x is -0,
+   *   NaN  otherwise
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function sign(x) {
+    x = new this(x);
+    return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits
+   * using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function sin(x) {
+    return new this(x).sin();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function sinh(x) {
+    return new this(x).sinh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function sqrt(x) {
+    return new this(x).sqrt();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits
+   * using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal}
+   * y {number|string|Decimal}
+   *
+   */
+  function sub(x, y) {
+    return new this(x).sub(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * Only the result is rounded, not the intermediate calculations.
+   *
+   * arguments {number|string|Decimal}
+   *
+   */
+  function sum() {
+    var i = 0,
+      args = arguments,
+      x = new this(args[i]);
+
+    external = false;
+    for (; x.s && ++i < args.length;) x = x.plus(args[i]);
+    external = true;
+
+    return finalise(x, this.precision, this.rounding);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function tan(x) {
+    return new this(x).tan();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|Decimal} A value in radians.
+   *
+   */
+  function tanh(x) {
+    return new this(x).tanh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` truncated to an integer.
+   *
+   * x {number|string|Decimal}
+   *
+   */
+  function trunc(x) {
+    return finalise(x = new this(x), x.e + 1, 1);
+  }
+
+
+  // Create and configure initial Decimal constructor.
+  Decimal = clone(DEFAULTS);
+  Decimal.prototype.constructor = Decimal;
+  Decimal['default'] = Decimal.Decimal = Decimal;
+
+  // Create the internal constants from their string values.
+  LN10 = new Decimal(LN10);
+  PI = new Decimal(PI);
+
+
+  // Export.
+
+
+  // AMD.
+  if (typeof define == 'function' && define.amd) {
+    define(function () {
+      return Decimal;
+    });
+
+  // Node and other environments that support module.exports.
+  } else if (typeof module != 'undefined' && module.exports) {
+    if (typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol') {
+      P[Symbol['for']('nodejs.util.inspect.custom')] = P.toString;
+      P[Symbol.toStringTag] = 'Decimal';
+    }
+
+    module.exports = Decimal;
+
+  // Browser.
+  } else {
+    if (!globalScope) {
+      globalScope = typeof self != 'undefined' && self && self.self == self ? self : window;
+    }
+
+    noConflict = globalScope.Decimal;
+    Decimal.noConflict = function () {
+      globalScope.Decimal = noConflict;
+      return Decimal;
+    };
+
+    globalScope.Decimal = Decimal;
+  }
+})(this);
diff --git a/node_modules/decimal.js/decimal.mjs b/node_modules/decimal.js/decimal.mjs
new file mode 100644
index 0000000..03f385d
--- /dev/null
+++ b/node_modules/decimal.js/decimal.mjs
@@ -0,0 +1,4898 @@
+/*
+ *  decimal.js v10.3.1
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2021 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */
+
+
+// -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //
+
+
+  // The maximum exponent magnitude.
+  // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.
+var EXP_LIMIT = 9e15,                      // 0 to 9e15
+
+  // The limit on the value of `precision`, and on the value of the first argument to
+  // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.
+  MAX_DIGITS = 1e9,                        // 0 to 1e9
+
+  // Base conversion alphabet.
+  NUMERALS = '0123456789abcdef',
+
+  // The natural logarithm of 10 (1025 digits).
+  LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',
+
+  // Pi (1025 digits).
+  PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',
+
+
+  // The initial configuration properties of the Decimal constructor.
+  DEFAULTS = {
+
+    // These values must be integers within the stated ranges (inclusive).
+    // Most of these values can be changed at run-time using the `Decimal.config` method.
+
+    // The maximum number of significant digits of the result of a calculation or base conversion.
+    // E.g. `Decimal.config({ precision: 20 });`
+    precision: 20,                         // 1 to MAX_DIGITS
+
+    // The rounding mode used when rounding to `precision`.
+    //
+    // ROUND_UP         0 Away from zero.
+    // ROUND_DOWN       1 Towards zero.
+    // ROUND_CEIL       2 Towards +Infinity.
+    // ROUND_FLOOR      3 Towards -Infinity.
+    // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.
+    // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.
+    // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.
+    // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.
+    // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
+    //
+    // E.g.
+    // `Decimal.rounding = 4;`
+    // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
+    rounding: 4,                           // 0 to 8
+
+    // The modulo mode used when calculating the modulus: a mod n.
+    // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
+    // The remainder (r) is calculated as: r = a - n * q.
+    //
+    // UP         0 The remainder is positive if the dividend is negative, else is negative.
+    // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).
+    // FLOOR      3 The remainder has the same sign as the divisor (Python %).
+    // HALF_EVEN  6 The IEEE 754 remainder function.
+    // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
+    //
+    // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
+    // division (9) are commonly used for the modulus operation. The other rounding modes can also
+    // be used, but they may not give useful results.
+    modulo: 1,                             // 0 to 9
+
+    // The exponent value at and beneath which `toString` returns exponential notation.
+    // JavaScript numbers: -7
+    toExpNeg: -7,                          // 0 to -EXP_LIMIT
+
+    // The exponent value at and above which `toString` returns exponential notation.
+    // JavaScript numbers: 21
+    toExpPos:  21,                         // 0 to EXP_LIMIT
+
+    // The minimum exponent value, beneath which underflow to zero occurs.
+    // JavaScript numbers: -324  (5e-324)
+    minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT
+
+    // The maximum exponent value, above which overflow to Infinity occurs.
+    // JavaScript numbers: 308  (1.7976931348623157e+308)
+    maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT
+
+    // Whether to use cryptographically-secure random number generation, if available.
+    crypto: false                          // true/false
+  },
+
+
+// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //
+
+
+  inexact, quadrant,
+  external = true,
+
+  decimalError = '[DecimalError] ',
+  invalidArgument = decimalError + 'Invalid argument: ',
+  precisionLimitExceeded = decimalError + 'Precision limit exceeded',
+  cryptoUnavailable = decimalError + 'crypto unavailable',
+  tag = '[object Decimal]',
+
+  mathfloor = Math.floor,
+  mathpow = Math.pow,
+
+  isBinary = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,
+  isHex = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,
+  isOctal = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,
+  isDecimal = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,
+
+  BASE = 1e7,
+  LOG_BASE = 7,
+  MAX_SAFE_INTEGER = 9007199254740991,
+
+  LN10_PRECISION = LN10.length - 1,
+  PI_PRECISION = PI.length - 1,
+
+  // Decimal.prototype object
+  P = { toStringTag: tag };
+
+
+// Decimal prototype methods
+
+
+/*
+ *  absoluteValue             abs
+ *  ceil
+ *  clampedTo                 clamp
+ *  comparedTo                cmp
+ *  cosine                    cos
+ *  cubeRoot                  cbrt
+ *  decimalPlaces             dp
+ *  dividedBy                 div
+ *  dividedToIntegerBy        divToInt
+ *  equals                    eq
+ *  floor
+ *  greaterThan               gt
+ *  greaterThanOrEqualTo      gte
+ *  hyperbolicCosine          cosh
+ *  hyperbolicSine            sinh
+ *  hyperbolicTangent         tanh
+ *  inverseCosine             acos
+ *  inverseHyperbolicCosine   acosh
+ *  inverseHyperbolicSine     asinh
+ *  inverseHyperbolicTangent  atanh
+ *  inverseSine               asin
+ *  inverseTangent            atan
+ *  isFinite
+ *  isInteger                 isInt
+ *  isNaN
+ *  isNegative                isNeg
+ *  isPositive                isPos
+ *  isZero
+ *  lessThan                  lt
+ *  lessThanOrEqualTo         lte
+ *  logarithm                 log
+ *  [maximum]                 [max]
+ *  [minimum]                 [min]
+ *  minus                     sub
+ *  modulo                    mod
+ *  naturalExponential        exp
+ *  naturalLogarithm          ln
+ *  negated                   neg
+ *  plus                      add
+ *  precision                 sd
+ *  round
+ *  sine                      sin
+ *  squareRoot                sqrt
+ *  tangent                   tan
+ *  times                     mul
+ *  toBinary
+ *  toDecimalPlaces           toDP
+ *  toExponential
+ *  toFixed
+ *  toFraction
+ *  toHexadecimal             toHex
+ *  toNearest
+ *  toNumber
+ *  toOctal
+ *  toPower                   pow
+ *  toPrecision
+ *  toSignificantDigits       toSD
+ *  toString
+ *  truncated                 trunc
+ *  valueOf                   toJSON
+ */
+
+
+/*
+ * Return a new Decimal whose value is the absolute value of this Decimal.
+ *
+ */
+P.absoluteValue = P.abs = function () {
+  var x = new this.constructor(this);
+  if (x.s < 0) x.s = 1;
+  return finalise(x);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+ * direction of positive Infinity.
+ *
+ */
+P.ceil = function () {
+  return finalise(new this.constructor(this), this.e + 1, 2);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal clamped to the range
+ * delineated by `min` and `max`.
+ *
+ * min {number|string|Decimal}
+ * max {number|string|Decimal}
+ *
+ */
+P.clampedTo = P.clamp = function (min, max) {
+  var k,
+    x = this,
+    Ctor = x.constructor;
+  min = new Ctor(min);
+  max = new Ctor(max);
+  if (!min.s || !max.s) return new Ctor(NaN);
+  if (min.gt(max)) throw Error(invalidArgument + max);
+  k = x.cmp(min);
+  return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);
+};
+
+
+/*
+ * Return
+ *   1    if the value of this Decimal is greater than the value of `y`,
+ *  -1    if the value of this Decimal is less than the value of `y`,
+ *   0    if they have the same value,
+ *   NaN  if the value of either Decimal is NaN.
+ *
+ */
+P.comparedTo = P.cmp = function (y) {
+  var i, j, xdL, ydL,
+    x = this,
+    xd = x.d,
+    yd = (y = new x.constructor(y)).d,
+    xs = x.s,
+    ys = y.s;
+
+  // Either NaN or ±Infinity?
+  if (!xd || !yd) {
+    return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;
+  }
+
+  // Either zero?
+  if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;
+
+  // Signs differ?
+  if (xs !== ys) return xs;
+
+  // Compare exponents.
+  if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;
+
+  xdL = xd.length;
+  ydL = yd.length;
+
+  // Compare digit by digit.
+  for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {
+    if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;
+  }
+
+  // Compare lengths.
+  return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;
+};
+
+
+/*
+ * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-1, 1]
+ *
+ * cos(0)         = 1
+ * cos(-0)        = 1
+ * cos(Infinity)  = NaN
+ * cos(-Infinity) = NaN
+ * cos(NaN)       = NaN
+ *
+ */
+P.cosine = P.cos = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.d) return new Ctor(NaN);
+
+  // cos(0) = cos(-0) = 1
+  if (!x.d[0]) return new Ctor(1);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+  Ctor.rounding = 1;
+
+  x = cosine(Ctor, toLessThanHalfPi(Ctor, x));
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);
+};
+
+
+/*
+ *
+ * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ *  cbrt(0)  =  0
+ *  cbrt(-0) = -0
+ *  cbrt(1)  =  1
+ *  cbrt(-1) = -1
+ *  cbrt(N)  =  N
+ *  cbrt(-I) = -I
+ *  cbrt(I)  =  I
+ *
+ * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))
+ *
+ */
+P.cubeRoot = P.cbrt = function () {
+  var e, m, n, r, rep, s, sd, t, t3, t3plusx,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite() || x.isZero()) return new Ctor(x);
+  external = false;
+
+  // Initial estimate.
+  s = x.s * mathpow(x.s * x, 1 / 3);
+
+   // Math.cbrt underflow/overflow?
+   // Pass x to Math.pow as integer, then adjust the exponent of the result.
+  if (!s || Math.abs(s) == 1 / 0) {
+    n = digitsToString(x.d);
+    e = x.e;
+
+    // Adjust n exponent so it is a multiple of 3 away from x exponent.
+    if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');
+    s = mathpow(n, 1 / 3);
+
+    // Rarely, e may be one less than the result exponent value.
+    e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));
+
+    if (s == 1 / 0) {
+      n = '5e' + e;
+    } else {
+      n = s.toExponential();
+      n = n.slice(0, n.indexOf('e') + 1) + e;
+    }
+
+    r = new Ctor(n);
+    r.s = x.s;
+  } else {
+    r = new Ctor(s.toString());
+  }
+
+  sd = (e = Ctor.precision) + 3;
+
+  // Halley's method.
+  // TODO? Compare Newton's method.
+  for (;;) {
+    t = r;
+    t3 = t.times(t).times(t);
+    t3plusx = t3.plus(x);
+    r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);
+
+    // TODO? Replace with for-loop and checkRoundingDigits.
+    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+      n = n.slice(sd - 3, sd + 1);
+
+      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999
+      // , i.e. approaching a rounding boundary, continue the iteration.
+      if (n == '9999' || !rep && n == '4999') {
+
+        // On the first iteration only, check to see if rounding up gives the exact result as the
+        // nines may infinitely repeat.
+        if (!rep) {
+          finalise(t, e + 1, 0);
+
+          if (t.times(t).times(t).eq(x)) {
+            r = t;
+            break;
+          }
+        }
+
+        sd += 4;
+        rep = 1;
+      } else {
+
+        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+        // If not, then there are further digits and m will be truthy.
+        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+          // Truncate to the first rounding digit.
+          finalise(r, e + 1, 1);
+          m = !r.times(r).times(r).eq(x);
+        }
+
+        break;
+      }
+    }
+  }
+
+  external = true;
+
+  return finalise(r, e, Ctor.rounding, m);
+};
+
+
+/*
+ * Return the number of decimal places of the value of this Decimal.
+ *
+ */
+P.decimalPlaces = P.dp = function () {
+  var w,
+    d = this.d,
+    n = NaN;
+
+  if (d) {
+    w = d.length - 1;
+    n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;
+
+    // Subtract the number of trailing zeros of the last word.
+    w = d[w];
+    if (w) for (; w % 10 == 0; w /= 10) n--;
+    if (n < 0) n = 0;
+  }
+
+  return n;
+};
+
+
+/*
+ *  n / 0 = I
+ *  n / N = N
+ *  n / I = 0
+ *  0 / n = 0
+ *  0 / 0 = N
+ *  0 / N = N
+ *  0 / I = 0
+ *  N / n = N
+ *  N / 0 = N
+ *  N / N = N
+ *  N / I = N
+ *  I / n = I
+ *  I / 0 = I
+ *  I / N = N
+ *  I / I = N
+ *
+ * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ */
+P.dividedBy = P.div = function (y) {
+  return divide(this, new this.constructor(y));
+};
+
+
+/*
+ * Return a new Decimal whose value is the integer part of dividing the value of this Decimal
+ * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ */
+P.dividedToIntegerBy = P.divToInt = function (y) {
+  var x = this,
+    Ctor = x.constructor;
+  return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);
+};
+
+
+/*
+ * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.
+ *
+ */
+P.equals = P.eq = function (y) {
+  return this.cmp(y) === 0;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+ * direction of negative Infinity.
+ *
+ */
+P.floor = function () {
+  return finalise(new this.constructor(this), this.e + 1, 3);
+};
+
+
+/*
+ * Return true if the value of this Decimal is greater than the value of `y`, otherwise return
+ * false.
+ *
+ */
+P.greaterThan = P.gt = function (y) {
+  return this.cmp(y) > 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is greater than or equal to the value of `y`,
+ * otherwise return false.
+ *
+ */
+P.greaterThanOrEqualTo = P.gte = function (y) {
+  var k = this.cmp(y);
+  return k == 1 || k === 0;
+};
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [1, Infinity]
+ *
+ * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...
+ *
+ * cosh(0)         = 1
+ * cosh(-0)        = 1
+ * cosh(Infinity)  = Infinity
+ * cosh(-Infinity) = Infinity
+ * cosh(NaN)       = NaN
+ *
+ *  x        time taken (ms)   result
+ * 1000      9                 9.8503555700852349694e+433
+ * 10000     25                4.4034091128314607936e+4342
+ * 100000    171               1.4033316802130615897e+43429
+ * 1000000   3817              1.5166076984010437725e+434294
+ * 10000000  abandoned after 2 minute wait
+ *
+ * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))
+ *
+ */
+P.hyperbolicCosine = P.cosh = function () {
+  var k, n, pr, rm, len,
+    x = this,
+    Ctor = x.constructor,
+    one = new Ctor(1);
+
+  if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);
+  if (x.isZero()) return one;
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+  Ctor.rounding = 1;
+  len = x.d.length;
+
+  // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1
+  // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))
+
+  // Estimate the optimum number of times to use the argument reduction.
+  // TODO? Estimation reused from cosine() and may not be optimal here.
+  if (len < 32) {
+    k = Math.ceil(len / 3);
+    n = (1 / tinyPow(4, k)).toString();
+  } else {
+    k = 16;
+    n = '2.3283064365386962890625e-10';
+  }
+
+  x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);
+
+  // Reverse argument reduction
+  var cosh2_x,
+    i = k,
+    d8 = new Ctor(8);
+  for (; i--;) {
+    cosh2_x = x.times(x);
+    x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));
+  }
+
+  return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);
+};
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-Infinity, Infinity]
+ *
+ * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...
+ *
+ * sinh(0)         = 0
+ * sinh(-0)        = -0
+ * sinh(Infinity)  = Infinity
+ * sinh(-Infinity) = -Infinity
+ * sinh(NaN)       = NaN
+ *
+ * x        time taken (ms)
+ * 10       2 ms
+ * 100      5 ms
+ * 1000     14 ms
+ * 10000    82 ms
+ * 100000   886 ms            1.4033316802130615897e+43429
+ * 200000   2613 ms
+ * 300000   5407 ms
+ * 400000   8824 ms
+ * 500000   13026 ms          8.7080643612718084129e+217146
+ * 1000000  48543 ms
+ *
+ * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))
+ *
+ */
+P.hyperbolicSine = P.sinh = function () {
+  var k, pr, rm, len,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+  Ctor.rounding = 1;
+  len = x.d.length;
+
+  if (len < 3) {
+    x = taylorSeries(Ctor, 2, x, x, true);
+  } else {
+
+    // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))
+    // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))
+    // 3 multiplications and 1 addition
+
+    // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))
+    // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))
+    // 4 multiplications and 2 additions
+
+    // Estimate the optimum number of times to use the argument reduction.
+    k = 1.4 * Math.sqrt(len);
+    k = k > 16 ? 16 : k | 0;
+
+    x = x.times(1 / tinyPow(5, k));
+    x = taylorSeries(Ctor, 2, x, x, true);
+
+    // Reverse argument reduction
+    var sinh2_x,
+      d5 = new Ctor(5),
+      d16 = new Ctor(16),
+      d20 = new Ctor(20);
+    for (; k--;) {
+      sinh2_x = x.times(x);
+      x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));
+    }
+  }
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(x, pr, rm, true);
+};
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-1, 1]
+ *
+ * tanh(x) = sinh(x) / cosh(x)
+ *
+ * tanh(0)         = 0
+ * tanh(-0)        = -0
+ * tanh(Infinity)  = 1
+ * tanh(-Infinity) = -1
+ * tanh(NaN)       = NaN
+ *
+ */
+P.hyperbolicTangent = P.tanh = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(x.s);
+  if (x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + 7;
+  Ctor.rounding = 1;
+
+  return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of
+ * this Decimal.
+ *
+ * Domain: [-1, 1]
+ * Range: [0, pi]
+ *
+ * acos(x) = pi/2 - asin(x)
+ *
+ * acos(0)       = pi/2
+ * acos(-0)      = pi/2
+ * acos(1)       = 0
+ * acos(-1)      = pi
+ * acos(1/2)     = pi/3
+ * acos(-1/2)    = 2*pi/3
+ * acos(|x| > 1) = NaN
+ * acos(NaN)     = NaN
+ *
+ */
+P.inverseCosine = P.acos = function () {
+  var halfPi,
+    x = this,
+    Ctor = x.constructor,
+    k = x.abs().cmp(1),
+    pr = Ctor.precision,
+    rm = Ctor.rounding;
+
+  if (k !== -1) {
+    return k === 0
+      // |x| is 1
+      ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)
+      // |x| > 1 or x is NaN
+      : new Ctor(NaN);
+  }
+
+  if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);
+
+  // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3
+
+  Ctor.precision = pr + 6;
+  Ctor.rounding = 1;
+
+  x = x.asin();
+  halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return halfPi.minus(x);
+};
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the
+ * value of this Decimal.
+ *
+ * Domain: [1, Infinity]
+ * Range: [0, Infinity]
+ *
+ * acosh(x) = ln(x + sqrt(x^2 - 1))
+ *
+ * acosh(x < 1)     = NaN
+ * acosh(NaN)       = NaN
+ * acosh(Infinity)  = Infinity
+ * acosh(-Infinity) = NaN
+ * acosh(0)         = NaN
+ * acosh(-0)        = NaN
+ * acosh(1)         = 0
+ * acosh(-1)        = NaN
+ *
+ */
+P.inverseHyperbolicCosine = P.acosh = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);
+  if (!x.isFinite()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;
+  Ctor.rounding = 1;
+  external = false;
+
+  x = x.times(x).minus(1).sqrt().plus(x);
+
+  external = true;
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.ln();
+};
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value
+ * of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-Infinity, Infinity]
+ *
+ * asinh(x) = ln(x + sqrt(x^2 + 1))
+ *
+ * asinh(NaN)       = NaN
+ * asinh(Infinity)  = Infinity
+ * asinh(-Infinity) = -Infinity
+ * asinh(0)         = 0
+ * asinh(-0)        = -0
+ *
+ */
+P.inverseHyperbolicSine = P.asinh = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;
+  Ctor.rounding = 1;
+  external = false;
+
+  x = x.times(x).plus(1).sqrt().plus(x);
+
+  external = true;
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.ln();
+};
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the
+ * value of this Decimal.
+ *
+ * Domain: [-1, 1]
+ * Range: [-Infinity, Infinity]
+ *
+ * atanh(x) = 0.5 * ln((1 + x) / (1 - x))
+ *
+ * atanh(|x| > 1)   = NaN
+ * atanh(NaN)       = NaN
+ * atanh(Infinity)  = NaN
+ * atanh(-Infinity) = NaN
+ * atanh(0)         = 0
+ * atanh(-0)        = -0
+ * atanh(1)         = Infinity
+ * atanh(-1)        = -Infinity
+ *
+ */
+P.inverseHyperbolicTangent = P.atanh = function () {
+  var pr, rm, wpr, xsd,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(NaN);
+  if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  xsd = x.sd();
+
+  if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);
+
+  Ctor.precision = wpr = xsd - x.e;
+
+  x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);
+
+  Ctor.precision = pr + 4;
+  Ctor.rounding = 1;
+
+  x = x.ln();
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.times(0.5);
+};
+
+
+/*
+ * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-pi/2, pi/2]
+ *
+ * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))
+ *
+ * asin(0)       = 0
+ * asin(-0)      = -0
+ * asin(1/2)     = pi/6
+ * asin(-1/2)    = -pi/6
+ * asin(1)       = pi/2
+ * asin(-1)      = -pi/2
+ * asin(|x| > 1) = NaN
+ * asin(NaN)     = NaN
+ *
+ * TODO? Compare performance of Taylor series.
+ *
+ */
+P.inverseSine = P.asin = function () {
+  var halfPi, k,
+    pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (x.isZero()) return new Ctor(x);
+
+  k = x.abs().cmp(1);
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  if (k !== -1) {
+
+    // |x| is 1
+    if (k === 0) {
+      halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
+      halfPi.s = x.s;
+      return halfPi;
+    }
+
+    // |x| > 1 or x is NaN
+    return new Ctor(NaN);
+  }
+
+  // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6
+
+  Ctor.precision = pr + 6;
+  Ctor.rounding = 1;
+
+  x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.times(2);
+};
+
+
+/*
+ * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value
+ * of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-pi/2, pi/2]
+ *
+ * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+ *
+ * atan(0)         = 0
+ * atan(-0)        = -0
+ * atan(1)         = pi/4
+ * atan(-1)        = -pi/4
+ * atan(Infinity)  = pi/2
+ * atan(-Infinity) = -pi/2
+ * atan(NaN)       = NaN
+ *
+ */
+P.inverseTangent = P.atan = function () {
+  var i, j, k, n, px, t, r, wpr, x2,
+    x = this,
+    Ctor = x.constructor,
+    pr = Ctor.precision,
+    rm = Ctor.rounding;
+
+  if (!x.isFinite()) {
+    if (!x.s) return new Ctor(NaN);
+    if (pr + 4 <= PI_PRECISION) {
+      r = getPi(Ctor, pr + 4, rm).times(0.5);
+      r.s = x.s;
+      return r;
+    }
+  } else if (x.isZero()) {
+    return new Ctor(x);
+  } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {
+    r = getPi(Ctor, pr + 4, rm).times(0.25);
+    r.s = x.s;
+    return r;
+  }
+
+  Ctor.precision = wpr = pr + 10;
+  Ctor.rounding = 1;
+
+  // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);
+
+  // Argument reduction
+  // Ensure |x| < 0.42
+  // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))
+
+  k = Math.min(28, wpr / LOG_BASE + 2 | 0);
+
+  for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));
+
+  external = false;
+
+  j = Math.ceil(wpr / LOG_BASE);
+  n = 1;
+  x2 = x.times(x);
+  r = new Ctor(x);
+  px = x;
+
+  // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+  for (; i !== -1;) {
+    px = px.times(x2);
+    t = r.minus(px.div(n += 2));
+
+    px = px.times(x2);
+    r = t.plus(px.div(n += 2));
+
+    if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);
+  }
+
+  if (k) r = r.times(2 << (k - 1));
+
+  external = true;
+
+  return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);
+};
+
+
+/*
+ * Return true if the value of this Decimal is a finite number, otherwise return false.
+ *
+ */
+P.isFinite = function () {
+  return !!this.d;
+};
+
+
+/*
+ * Return true if the value of this Decimal is an integer, otherwise return false.
+ *
+ */
+P.isInteger = P.isInt = function () {
+  return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;
+};
+
+
+/*
+ * Return true if the value of this Decimal is NaN, otherwise return false.
+ *
+ */
+P.isNaN = function () {
+  return !this.s;
+};
+
+
+/*
+ * Return true if the value of this Decimal is negative, otherwise return false.
+ *
+ */
+P.isNegative = P.isNeg = function () {
+  return this.s < 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is positive, otherwise return false.
+ *
+ */
+P.isPositive = P.isPos = function () {
+  return this.s > 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is 0 or -0, otherwise return false.
+ *
+ */
+P.isZero = function () {
+  return !!this.d && this.d[0] === 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is less than `y`, otherwise return false.
+ *
+ */
+P.lessThan = P.lt = function (y) {
+  return this.cmp(y) < 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.
+ *
+ */
+P.lessThanOrEqualTo = P.lte = function (y) {
+  return this.cmp(y) < 1;
+};
+
+
+/*
+ * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * If no base is specified, return log[10](arg).
+ *
+ * log[base](arg) = ln(arg) / ln(base)
+ *
+ * The result will always be correctly rounded if the base of the log is 10, and 'almost always'
+ * otherwise:
+ *
+ * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen
+ * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error
+ * between the result and the correctly rounded result will be one ulp (unit in the last place).
+ *
+ * log[-b](a)       = NaN
+ * log[0](a)        = NaN
+ * log[1](a)        = NaN
+ * log[NaN](a)      = NaN
+ * log[Infinity](a) = NaN
+ * log[b](0)        = -Infinity
+ * log[b](-0)       = -Infinity
+ * log[b](-a)       = NaN
+ * log[b](1)        = 0
+ * log[b](Infinity) = Infinity
+ * log[b](NaN)      = NaN
+ *
+ * [base] {number|string|Decimal} The base of the logarithm.
+ *
+ */
+P.logarithm = P.log = function (base) {
+  var isBase10, d, denominator, k, inf, num, sd, r,
+    arg = this,
+    Ctor = arg.constructor,
+    pr = Ctor.precision,
+    rm = Ctor.rounding,
+    guard = 5;
+
+  // Default base is 10.
+  if (base == null) {
+    base = new Ctor(10);
+    isBase10 = true;
+  } else {
+    base = new Ctor(base);
+    d = base.d;
+
+    // Return NaN if base is negative, or non-finite, or is 0 or 1.
+    if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);
+
+    isBase10 = base.eq(10);
+  }
+
+  d = arg.d;
+
+  // Is arg negative, non-finite, 0 or 1?
+  if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {
+    return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);
+  }
+
+  // The result will have a non-terminating decimal expansion if base is 10 and arg is not an
+  // integer power of 10.
+  if (isBase10) {
+    if (d.length > 1) {
+      inf = true;
+    } else {
+      for (k = d[0]; k % 10 === 0;) k /= 10;
+      inf = k !== 1;
+    }
+  }
+
+  external = false;
+  sd = pr + guard;
+  num = naturalLogarithm(arg, sd);
+  denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+
+  // The result will have 5 rounding digits.
+  r = divide(num, denominator, sd, 1);
+
+  // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,
+  // calculate 10 further digits.
+  //
+  // If the result is known to have an infinite decimal expansion, repeat this until it is clear
+  // that the result is above or below the boundary. Otherwise, if after calculating the 10
+  // further digits, the last 14 are nines, round up and assume the result is exact.
+  // Also assume the result is exact if the last 14 are zero.
+  //
+  // Example of a result that will be incorrectly rounded:
+  // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...
+  // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it
+  // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so
+  // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal
+  // place is still 2.6.
+  if (checkRoundingDigits(r.d, k = pr, rm)) {
+
+    do {
+      sd += 10;
+      num = naturalLogarithm(arg, sd);
+      denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+      r = divide(num, denominator, sd, 1);
+
+      if (!inf) {
+
+        // Check for 14 nines from the 2nd rounding digit, as the first may be 4.
+        if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {
+          r = finalise(r, pr + 1, 0);
+        }
+
+        break;
+      }
+    } while (checkRoundingDigits(r.d, k += 10, rm));
+  }
+
+  external = true;
+
+  return finalise(r, pr, rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.
+ *
+ * arguments {number|string|Decimal}
+ *
+P.max = function () {
+  Array.prototype.push.call(arguments, this);
+  return maxOrMin(this.constructor, arguments, 'lt');
+};
+ */
+
+
+/*
+ * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.
+ *
+ * arguments {number|string|Decimal}
+ *
+P.min = function () {
+  Array.prototype.push.call(arguments, this);
+  return maxOrMin(this.constructor, arguments, 'gt');
+};
+ */
+
+
+/*
+ *  n - 0 = n
+ *  n - N = N
+ *  n - I = -I
+ *  0 - n = -n
+ *  0 - 0 = 0
+ *  0 - N = N
+ *  0 - I = -I
+ *  N - n = N
+ *  N - 0 = N
+ *  N - N = N
+ *  N - I = N
+ *  I - n = I
+ *  I - 0 = I
+ *  I - N = N
+ *  I - I = N
+ *
+ * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ */
+P.minus = P.sub = function (y) {
+  var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,
+    x = this,
+    Ctor = x.constructor;
+
+  y = new Ctor(y);
+
+  // If either is not finite...
+  if (!x.d || !y.d) {
+
+    // Return NaN if either is NaN.
+    if (!x.s || !y.s) y = new Ctor(NaN);
+
+    // Return y negated if x is finite and y is ±Infinity.
+    else if (x.d) y.s = -y.s;
+
+    // Return x if y is finite and x is ±Infinity.
+    // Return x if both are ±Infinity with different signs.
+    // Return NaN if both are ±Infinity with the same sign.
+    else y = new Ctor(y.d || x.s !== y.s ? x : NaN);
+
+    return y;
+  }
+
+  // If signs differ...
+  if (x.s != y.s) {
+    y.s = -y.s;
+    return x.plus(y);
+  }
+
+  xd = x.d;
+  yd = y.d;
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  // If either is zero...
+  if (!xd[0] || !yd[0]) {
+
+    // Return y negated if x is zero and y is non-zero.
+    if (yd[0]) y.s = -y.s;
+
+    // Return x if y is zero and x is non-zero.
+    else if (xd[0]) y = new Ctor(x);
+
+    // Return zero if both are zero.
+    // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.
+    else return new Ctor(rm === 3 ? -0 : 0);
+
+    return external ? finalise(y, pr, rm) : y;
+  }
+
+  // x and y are finite, non-zero numbers with the same sign.
+
+  // Calculate base 1e7 exponents.
+  e = mathfloor(y.e / LOG_BASE);
+  xe = mathfloor(x.e / LOG_BASE);
+
+  xd = xd.slice();
+  k = xe - e;
+
+  // If base 1e7 exponents differ...
+  if (k) {
+    xLTy = k < 0;
+
+    if (xLTy) {
+      d = xd;
+      k = -k;
+      len = yd.length;
+    } else {
+      d = yd;
+      e = xe;
+      len = xd.length;
+    }
+
+    // Numbers with massively different exponents would result in a very high number of
+    // zeros needing to be prepended, but this can be avoided while still ensuring correct
+    // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.
+    i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;
+
+    if (k > i) {
+      k = i;
+      d.length = 1;
+    }
+
+    // Prepend zeros to equalise exponents.
+    d.reverse();
+    for (i = k; i--;) d.push(0);
+    d.reverse();
+
+  // Base 1e7 exponents equal.
+  } else {
+
+    // Check digits to determine which is the bigger number.
+
+    i = xd.length;
+    len = yd.length;
+    xLTy = i < len;
+    if (xLTy) len = i;
+
+    for (i = 0; i < len; i++) {
+      if (xd[i] != yd[i]) {
+        xLTy = xd[i] < yd[i];
+        break;
+      }
+    }
+
+    k = 0;
+  }
+
+  if (xLTy) {
+    d = xd;
+    xd = yd;
+    yd = d;
+    y.s = -y.s;
+  }
+
+  len = xd.length;
+
+  // Append zeros to `xd` if shorter.
+  // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.
+  for (i = yd.length - len; i > 0; --i) xd[len++] = 0;
+
+  // Subtract yd from xd.
+  for (i = yd.length; i > k;) {
+
+    if (xd[--i] < yd[i]) {
+      for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;
+      --xd[j];
+      xd[i] += BASE;
+    }
+
+    xd[i] -= yd[i];
+  }
+
+  // Remove trailing zeros.
+  for (; xd[--len] === 0;) xd.pop();
+
+  // Remove leading zeros and adjust exponent accordingly.
+  for (; xd[0] === 0; xd.shift()) --e;
+
+  // Zero?
+  if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);
+
+  y.d = xd;
+  y.e = getBase10Exponent(xd, e);
+
+  return external ? finalise(y, pr, rm) : y;
+};
+
+
+/*
+ *   n % 0 =  N
+ *   n % N =  N
+ *   n % I =  n
+ *   0 % n =  0
+ *  -0 % n = -0
+ *   0 % 0 =  N
+ *   0 % N =  N
+ *   0 % I =  0
+ *   N % n =  N
+ *   N % 0 =  N
+ *   N % N =  N
+ *   N % I =  N
+ *   I % n =  N
+ *   I % 0 =  N
+ *   I % N =  N
+ *   I % I =  N
+ *
+ * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * The result depends on the modulo mode.
+ *
+ */
+P.modulo = P.mod = function (y) {
+  var q,
+    x = this,
+    Ctor = x.constructor;
+
+  y = new Ctor(y);
+
+  // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.
+  if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);
+
+  // Return x if y is ±Infinity or x is ±0.
+  if (!y.d || x.d && !x.d[0]) {
+    return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);
+  }
+
+  // Prevent rounding of intermediate calculations.
+  external = false;
+
+  if (Ctor.modulo == 9) {
+
+    // Euclidian division: q = sign(y) * floor(x / abs(y))
+    // result = x - q * y    where  0 <= result < abs(y)
+    q = divide(x, y.abs(), 0, 3, 1);
+    q.s *= y.s;
+  } else {
+    q = divide(x, y, 0, Ctor.modulo, 1);
+  }
+
+  q = q.times(y);
+
+  external = true;
+
+  return x.minus(q);
+};
+
+
+/*
+ * Return a new Decimal whose value is the natural exponential of the value of this Decimal,
+ * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ */
+P.naturalExponential = P.exp = function () {
+  return naturalExponential(this);
+};
+
+
+/*
+ * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,
+ * rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ */
+P.naturalLogarithm = P.ln = function () {
+  return naturalLogarithm(this);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by
+ * -1.
+ *
+ */
+P.negated = P.neg = function () {
+  var x = new this.constructor(this);
+  x.s = -x.s;
+  return finalise(x);
+};
+
+
+/*
+ *  n + 0 = n
+ *  n + N = N
+ *  n + I = I
+ *  0 + n = n
+ *  0 + 0 = 0
+ *  0 + N = N
+ *  0 + I = I
+ *  N + n = N
+ *  N + 0 = N
+ *  N + N = N
+ *  N + I = N
+ *  I + n = I
+ *  I + 0 = I
+ *  I + N = N
+ *  I + I = I
+ *
+ * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ */
+P.plus = P.add = function (y) {
+  var carry, d, e, i, k, len, pr, rm, xd, yd,
+    x = this,
+    Ctor = x.constructor;
+
+  y = new Ctor(y);
+
+  // If either is not finite...
+  if (!x.d || !y.d) {
+
+    // Return NaN if either is NaN.
+    if (!x.s || !y.s) y = new Ctor(NaN);
+
+    // Return x if y is finite and x is ±Infinity.
+    // Return x if both are ±Infinity with the same sign.
+    // Return NaN if both are ±Infinity with different signs.
+    // Return y if x is finite and y is ±Infinity.
+    else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);
+
+    return y;
+  }
+
+   // If signs differ...
+  if (x.s != y.s) {
+    y.s = -y.s;
+    return x.minus(y);
+  }
+
+  xd = x.d;
+  yd = y.d;
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  // If either is zero...
+  if (!xd[0] || !yd[0]) {
+
+    // Return x if y is zero.
+    // Return y if y is non-zero.
+    if (!yd[0]) y = new Ctor(x);
+
+    return external ? finalise(y, pr, rm) : y;
+  }
+
+  // x and y are finite, non-zero numbers with the same sign.
+
+  // Calculate base 1e7 exponents.
+  k = mathfloor(x.e / LOG_BASE);
+  e = mathfloor(y.e / LOG_BASE);
+
+  xd = xd.slice();
+  i = k - e;
+
+  // If base 1e7 exponents differ...
+  if (i) {
+
+    if (i < 0) {
+      d = xd;
+      i = -i;
+      len = yd.length;
+    } else {
+      d = yd;
+      e = k;
+      len = xd.length;
+    }
+
+    // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.
+    k = Math.ceil(pr / LOG_BASE);
+    len = k > len ? k + 1 : len + 1;
+
+    if (i > len) {
+      i = len;
+      d.length = 1;
+    }
+
+    // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.
+    d.reverse();
+    for (; i--;) d.push(0);
+    d.reverse();
+  }
+
+  len = xd.length;
+  i = yd.length;
+
+  // If yd is longer than xd, swap xd and yd so xd points to the longer array.
+  if (len - i < 0) {
+    i = len;
+    d = yd;
+    yd = xd;
+    xd = d;
+  }
+
+  // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.
+  for (carry = 0; i;) {
+    carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;
+    xd[i] %= BASE;
+  }
+
+  if (carry) {
+    xd.unshift(carry);
+    ++e;
+  }
+
+  // Remove trailing zeros.
+  // No need to check for zero, as +x + +y != 0 && -x + -y != 0
+  for (len = xd.length; xd[--len] == 0;) xd.pop();
+
+  y.d = xd;
+  y.e = getBase10Exponent(xd, e);
+
+  return external ? finalise(y, pr, rm) : y;
+};
+
+
+/*
+ * Return the number of significant digits of the value of this Decimal.
+ *
+ * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.
+ *
+ */
+P.precision = P.sd = function (z) {
+  var k,
+    x = this;
+
+  if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);
+
+  if (x.d) {
+    k = getPrecision(x.d);
+    if (z && x.e + 1 > k) k = x.e + 1;
+  } else {
+    k = NaN;
+  }
+
+  return k;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using
+ * rounding mode `rounding`.
+ *
+ */
+P.round = function () {
+  var x = this,
+    Ctor = x.constructor;
+
+  return finalise(new Ctor(x), x.e + 1, Ctor.rounding);
+};
+
+
+/*
+ * Return a new Decimal whose value is the sine of the value in radians of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-1, 1]
+ *
+ * sin(x) = x - x^3/3! + x^5/5! - ...
+ *
+ * sin(0)         = 0
+ * sin(-0)        = -0
+ * sin(Infinity)  = NaN
+ * sin(-Infinity) = NaN
+ * sin(NaN)       = NaN
+ *
+ */
+P.sine = P.sin = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(NaN);
+  if (x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+  Ctor.rounding = 1;
+
+  x = sine(Ctor, toLessThanHalfPi(Ctor, x));
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);
+};
+
+
+/*
+ * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ *  sqrt(-n) =  N
+ *  sqrt(N)  =  N
+ *  sqrt(-I) =  N
+ *  sqrt(I)  =  I
+ *  sqrt(0)  =  0
+ *  sqrt(-0) = -0
+ *
+ */
+P.squareRoot = P.sqrt = function () {
+  var m, n, sd, r, rep, t,
+    x = this,
+    d = x.d,
+    e = x.e,
+    s = x.s,
+    Ctor = x.constructor;
+
+  // Negative/NaN/Infinity/zero?
+  if (s !== 1 || !d || !d[0]) {
+    return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);
+  }
+
+  external = false;
+
+  // Initial estimate.
+  s = Math.sqrt(+x);
+
+  // Math.sqrt underflow/overflow?
+  // Pass x to Math.sqrt as integer, then adjust the exponent of the result.
+  if (s == 0 || s == 1 / 0) {
+    n = digitsToString(d);
+
+    if ((n.length + e) % 2 == 0) n += '0';
+    s = Math.sqrt(n);
+    e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);
+
+    if (s == 1 / 0) {
+      n = '5e' + e;
+    } else {
+      n = s.toExponential();
+      n = n.slice(0, n.indexOf('e') + 1) + e;
+    }
+
+    r = new Ctor(n);
+  } else {
+    r = new Ctor(s.toString());
+  }
+
+  sd = (e = Ctor.precision) + 3;
+
+  // Newton-Raphson iteration.
+  for (;;) {
+    t = r;
+    r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);
+
+    // TODO? Replace with for-loop and checkRoundingDigits.
+    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+      n = n.slice(sd - 3, sd + 1);
+
+      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or
+      // 4999, i.e. approaching a rounding boundary, continue the iteration.
+      if (n == '9999' || !rep && n == '4999') {
+
+        // On the first iteration only, check to see if rounding up gives the exact result as the
+        // nines may infinitely repeat.
+        if (!rep) {
+          finalise(t, e + 1, 0);
+
+          if (t.times(t).eq(x)) {
+            r = t;
+            break;
+          }
+        }
+
+        sd += 4;
+        rep = 1;
+      } else {
+
+        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+        // If not, then there are further digits and m will be truthy.
+        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+          // Truncate to the first rounding digit.
+          finalise(r, e + 1, 1);
+          m = !r.times(r).eq(x);
+        }
+
+        break;
+      }
+    }
+  }
+
+  external = true;
+
+  return finalise(r, e, Ctor.rounding, m);
+};
+
+
+/*
+ * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-Infinity, Infinity]
+ *
+ * tan(0)         = 0
+ * tan(-0)        = -0
+ * tan(Infinity)  = NaN
+ * tan(-Infinity) = NaN
+ * tan(NaN)       = NaN
+ *
+ */
+P.tangent = P.tan = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(NaN);
+  if (x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + 10;
+  Ctor.rounding = 1;
+
+  x = x.sin();
+  x.s = 1;
+  x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);
+};
+
+
+/*
+ *  n * 0 = 0
+ *  n * N = N
+ *  n * I = I
+ *  0 * n = 0
+ *  0 * 0 = 0
+ *  0 * N = N
+ *  0 * I = N
+ *  N * n = N
+ *  N * 0 = N
+ *  N * N = N
+ *  N * I = N
+ *  I * n = I
+ *  I * 0 = N
+ *  I * N = N
+ *  I * I = I
+ *
+ * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ */
+P.times = P.mul = function (y) {
+  var carry, e, i, k, r, rL, t, xdL, ydL,
+    x = this,
+    Ctor = x.constructor,
+    xd = x.d,
+    yd = (y = new Ctor(y)).d;
+
+  y.s *= x.s;
+
+   // If either is NaN, ±Infinity or ±0...
+  if (!xd || !xd[0] || !yd || !yd[0]) {
+
+    return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd
+
+      // Return NaN if either is NaN.
+      // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.
+      ? NaN
+
+      // Return ±Infinity if either is ±Infinity.
+      // Return ±0 if either is ±0.
+      : !xd || !yd ? y.s / 0 : y.s * 0);
+  }
+
+  e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);
+  xdL = xd.length;
+  ydL = yd.length;
+
+  // Ensure xd points to the longer array.
+  if (xdL < ydL) {
+    r = xd;
+    xd = yd;
+    yd = r;
+    rL = xdL;
+    xdL = ydL;
+    ydL = rL;
+  }
+
+  // Initialise the result array with zeros.
+  r = [];
+  rL = xdL + ydL;
+  for (i = rL; i--;) r.push(0);
+
+  // Multiply!
+  for (i = ydL; --i >= 0;) {
+    carry = 0;
+    for (k = xdL + i; k > i;) {
+      t = r[k] + yd[i] * xd[k - i - 1] + carry;
+      r[k--] = t % BASE | 0;
+      carry = t / BASE | 0;
+    }
+
+    r[k] = (r[k] + carry) % BASE | 0;
+  }
+
+  // Remove trailing zeros.
+  for (; !r[--rL];) r.pop();
+
+  if (carry) ++e;
+  else r.shift();
+
+  y.d = r;
+  y.e = getBase10Exponent(r, e);
+
+  return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in base 2, round to `sd` significant
+ * digits using rounding mode `rm`.
+ *
+ * If the optional `sd` argument is present then return binary exponential notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toBinary = function (sd, rm) {
+  return toStringBinary(this, 2, sd, rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`
+ * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.
+ *
+ * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.
+ *
+ * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toDecimalPlaces = P.toDP = function (dp, rm) {
+  var x = this,
+    Ctor = x.constructor;
+
+  x = new Ctor(x);
+  if (dp === void 0) return x;
+
+  checkInt32(dp, 0, MAX_DIGITS);
+
+  if (rm === void 0) rm = Ctor.rounding;
+  else checkInt32(rm, 0, 8);
+
+  return finalise(x, dp + x.e + 1, rm);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in exponential notation rounded to
+ * `dp` fixed decimal places using rounding mode `rounding`.
+ *
+ * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toExponential = function (dp, rm) {
+  var str,
+    x = this,
+    Ctor = x.constructor;
+
+  if (dp === void 0) {
+    str = finiteToString(x, true);
+  } else {
+    checkInt32(dp, 0, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    x = finalise(new Ctor(x), dp + 1, rm);
+    str = finiteToString(x, true, dp + 1);
+  }
+
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in normal (fixed-point) notation to
+ * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is
+ * omitted.
+ *
+ * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.
+ *
+ * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.
+ * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.
+ * (-0).toFixed(3) is '0.000'.
+ * (-0.5).toFixed(0) is '-0'.
+ *
+ */
+P.toFixed = function (dp, rm) {
+  var str, y,
+    x = this,
+    Ctor = x.constructor;
+
+  if (dp === void 0) {
+    str = finiteToString(x);
+  } else {
+    checkInt32(dp, 0, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    y = finalise(new Ctor(x), dp + x.e + 1, rm);
+    str = finiteToString(y, false, dp + y.e + 1);
+  }
+
+  // To determine whether to add the minus sign look at the value before it was rounded,
+  // i.e. look at `x` rather than `y`.
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return an array representing the value of this Decimal as a simple fraction with an integer
+ * numerator and an integer denominator.
+ *
+ * The denominator will be a positive non-zero value less than or equal to the specified maximum
+ * denominator. If a maximum denominator is not specified, the denominator will be the lowest
+ * value necessary to represent the number exactly.
+ *
+ * [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.
+ *
+ */
+P.toFraction = function (maxD) {
+  var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,
+    x = this,
+    xd = x.d,
+    Ctor = x.constructor;
+
+  if (!xd) return new Ctor(x);
+
+  n1 = d0 = new Ctor(1);
+  d1 = n0 = new Ctor(0);
+
+  d = new Ctor(d1);
+  e = d.e = getPrecision(xd) - x.e - 1;
+  k = e % LOG_BASE;
+  d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);
+
+  if (maxD == null) {
+
+    // d is 10**e, the minimum max-denominator needed.
+    maxD = e > 0 ? d : n1;
+  } else {
+    n = new Ctor(maxD);
+    if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);
+    maxD = n.gt(d) ? (e > 0 ? d : n1) : n;
+  }
+
+  external = false;
+  n = new Ctor(digitsToString(xd));
+  pr = Ctor.precision;
+  Ctor.precision = e = xd.length * LOG_BASE * 2;
+
+  for (;;)  {
+    q = divide(n, d, 0, 1, 1);
+    d2 = d0.plus(q.times(d1));
+    if (d2.cmp(maxD) == 1) break;
+    d0 = d1;
+    d1 = d2;
+    d2 = n1;
+    n1 = n0.plus(q.times(d2));
+    n0 = d2;
+    d2 = d;
+    d = n.minus(q.times(d2));
+    n = d2;
+  }
+
+  d2 = divide(maxD.minus(d0), d1, 0, 1, 1);
+  n0 = n0.plus(d2.times(n1));
+  d0 = d0.plus(d2.times(d1));
+  n0.s = n1.s = x.s;
+
+  // Determine which fraction is closer to x, n0/d0 or n1/d1?
+  r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1
+      ? [n1, d1] : [n0, d0];
+
+  Ctor.precision = pr;
+  external = true;
+
+  return r;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in base 16, round to `sd` significant
+ * digits using rounding mode `rm`.
+ *
+ * If the optional `sd` argument is present then return binary exponential notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toHexadecimal = P.toHex = function (sd, rm) {
+  return toStringBinary(this, 16, sd, rm);
+};
+
+
+/*
+ * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding
+ * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.
+ *
+ * The return value will always have the same sign as this Decimal, unless either this Decimal
+ * or `y` is NaN, in which case the return value will be also be NaN.
+ *
+ * The return value is not affected by the value of `precision`.
+ *
+ * y {number|string|Decimal} The magnitude to round to a multiple of.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ * 'toNearest() rounding mode not an integer: {rm}'
+ * 'toNearest() rounding mode out of range: {rm}'
+ *
+ */
+P.toNearest = function (y, rm) {
+  var x = this,
+    Ctor = x.constructor;
+
+  x = new Ctor(x);
+
+  if (y == null) {
+
+    // If x is not finite, return x.
+    if (!x.d) return x;
+
+    y = new Ctor(1);
+    rm = Ctor.rounding;
+  } else {
+    y = new Ctor(y);
+    if (rm === void 0) {
+      rm = Ctor.rounding;
+    } else {
+      checkInt32(rm, 0, 8);
+    }
+
+    // If x is not finite, return x if y is not NaN, else NaN.
+    if (!x.d) return y.s ? x : y;
+
+    // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.
+    if (!y.d) {
+      if (y.s) y.s = x.s;
+      return y;
+    }
+  }
+
+  // If y is not zero, calculate the nearest multiple of y to x.
+  if (y.d[0]) {
+    external = false;
+    x = divide(x, y, 0, rm, 1).times(y);
+    external = true;
+    finalise(x);
+
+  // If y is zero, return zero with the sign of x.
+  } else {
+    y.s = x.s;
+    x = y;
+  }
+
+  return x;
+};
+
+
+/*
+ * Return the value of this Decimal converted to a number primitive.
+ * Zero keeps its sign.
+ *
+ */
+P.toNumber = function () {
+  return +this;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in base 8, round to `sd` significant
+ * digits using rounding mode `rm`.
+ *
+ * If the optional `sd` argument is present then return binary exponential notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toOctal = function (sd, rm) {
+  return toStringBinary(this, 8, sd, rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded
+ * to `precision` significant digits using rounding mode `rounding`.
+ *
+ * ECMAScript compliant.
+ *
+ *   pow(x, NaN)                           = NaN
+ *   pow(x, ±0)                            = 1
+
+ *   pow(NaN, non-zero)                    = NaN
+ *   pow(abs(x) > 1, +Infinity)            = +Infinity
+ *   pow(abs(x) > 1, -Infinity)            = +0
+ *   pow(abs(x) == 1, ±Infinity)           = NaN
+ *   pow(abs(x) < 1, +Infinity)            = +0
+ *   pow(abs(x) < 1, -Infinity)            = +Infinity
+ *   pow(+Infinity, y > 0)                 = +Infinity
+ *   pow(+Infinity, y < 0)                 = +0
+ *   pow(-Infinity, odd integer > 0)       = -Infinity
+ *   pow(-Infinity, even integer > 0)      = +Infinity
+ *   pow(-Infinity, odd integer < 0)       = -0
+ *   pow(-Infinity, even integer < 0)      = +0
+ *   pow(+0, y > 0)                        = +0
+ *   pow(+0, y < 0)                        = +Infinity
+ *   pow(-0, odd integer > 0)              = -0
+ *   pow(-0, even integer > 0)             = +0
+ *   pow(-0, odd integer < 0)              = -Infinity
+ *   pow(-0, even integer < 0)             = +Infinity
+ *   pow(finite x < 0, finite non-integer) = NaN
+ *
+ * For non-integer or very large exponents pow(x, y) is calculated using
+ *
+ *   x^y = exp(y*ln(x))
+ *
+ * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the
+ * probability of an incorrectly rounded result
+ * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14
+ * i.e. 1 in 250,000,000,000,000
+ *
+ * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).
+ *
+ * y {number|string|Decimal} The power to which to raise this Decimal.
+ *
+ */
+P.toPower = P.pow = function (y) {
+  var e, k, pr, r, rm, s,
+    x = this,
+    Ctor = x.constructor,
+    yn = +(y = new Ctor(y));
+
+  // Either ±Infinity, NaN or ±0?
+  if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));
+
+  x = new Ctor(x);
+
+  if (x.eq(1)) return x;
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  if (y.eq(1)) return finalise(x, pr, rm);
+
+  // y exponent
+  e = mathfloor(y.e / LOG_BASE);
+
+  // If y is a small integer use the 'exponentiation by squaring' algorithm.
+  if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {
+    r = intPow(Ctor, x, k, pr);
+    return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);
+  }
+
+  s = x.s;
+
+  // if x is negative
+  if (s < 0) {
+
+    // if y is not an integer
+    if (e < y.d.length - 1) return new Ctor(NaN);
+
+    // Result is positive if x is negative and the last digit of integer y is even.
+    if ((y.d[e] & 1) == 0) s = 1;
+
+    // if x.eq(-1)
+    if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {
+      x.s = s;
+      return x;
+    }
+  }
+
+  // Estimate result exponent.
+  // x^y = 10^e,  where e = y * log10(x)
+  // log10(x) = log10(x_significand) + x_exponent
+  // log10(x_significand) = ln(x_significand) / ln(10)
+  k = mathpow(+x, yn);
+  e = k == 0 || !isFinite(k)
+    ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))
+    : new Ctor(k + '').e;
+
+  // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.
+
+  // Overflow/underflow?
+  if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);
+
+  external = false;
+  Ctor.rounding = x.s = 1;
+
+  // Estimate the extra guard digits needed to ensure five correct rounding digits from
+  // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):
+  // new Decimal(2.32456).pow('2087987436534566.46411')
+  // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815
+  k = Math.min(12, (e + '').length);
+
+  // r = x^y = exp(y*ln(x))
+  r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);
+
+  // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)
+  if (r.d) {
+
+    // Truncate to the required precision plus five rounding digits.
+    r = finalise(r, pr + 5, 1);
+
+    // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate
+    // the result.
+    if (checkRoundingDigits(r.d, pr, rm)) {
+      e = pr + 10;
+
+      // Truncate to the increased precision plus five rounding digits.
+      r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);
+
+      // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).
+      if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {
+        r = finalise(r, pr + 1, 0);
+      }
+    }
+  }
+
+  r.s = s;
+  external = true;
+  Ctor.rounding = rm;
+
+  return finalise(r, pr, rm);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal rounded to `sd` significant digits
+ * using rounding mode `rounding`.
+ *
+ * Return exponential notation if `sd` is less than the number of digits necessary to represent
+ * the integer part of the value in normal notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toPrecision = function (sd, rm) {
+  var str,
+    x = this,
+    Ctor = x.constructor;
+
+  if (sd === void 0) {
+    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+  } else {
+    checkInt32(sd, 1, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    x = finalise(new Ctor(x), sd, rm);
+    str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);
+  }
+
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`
+ * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if
+ * omitted.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ * 'toSD() digits out of range: {sd}'
+ * 'toSD() digits not an integer: {sd}'
+ * 'toSD() rounding mode not an integer: {rm}'
+ * 'toSD() rounding mode out of range: {rm}'
+ *
+ */
+P.toSignificantDigits = P.toSD = function (sd, rm) {
+  var x = this,
+    Ctor = x.constructor;
+
+  if (sd === void 0) {
+    sd = Ctor.precision;
+    rm = Ctor.rounding;
+  } else {
+    checkInt32(sd, 1, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+  }
+
+  return finalise(new Ctor(x), sd, rm);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal.
+ *
+ * Return exponential notation if this Decimal has a positive exponent equal to or greater than
+ * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.
+ *
+ */
+P.toString = function () {
+  var x = this,
+    Ctor = x.constructor,
+    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.
+ *
+ */
+P.truncated = P.trunc = function () {
+  return finalise(new this.constructor(this), this.e + 1, 1);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal.
+ * Unlike `toString`, negative zero will include the minus sign.
+ *
+ */
+P.valueOf = P.toJSON = function () {
+  var x = this,
+    Ctor = x.constructor,
+    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+  return x.isNeg() ? '-' + str : str;
+};
+
+
+// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.
+
+
+/*
+ *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,
+ *                           finiteToString, naturalExponential, naturalLogarithm
+ *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,
+ *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random
+ *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm
+ *  convertBase              toStringBinary, parseOther
+ *  cos                      P.cos
+ *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,
+ *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,
+ *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,
+ *                           taylorSeries, atan2, parseOther
+ *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,
+ *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,
+ *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,
+ *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,
+ *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,
+ *                           P.truncated, divide, getLn10, getPi, naturalExponential,
+ *                           naturalLogarithm, ceil, floor, round, trunc
+ *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,
+ *                           toStringBinary
+ *  getBase10Exponent        P.minus, P.plus, P.times, parseOther
+ *  getLn10                  P.logarithm, naturalLogarithm
+ *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2
+ *  getPrecision             P.precision, P.toFraction
+ *  getZeroString            digitsToString, finiteToString
+ *  intPow                   P.toPower, parseOther
+ *  isOdd                    toLessThanHalfPi
+ *  maxOrMin                 max, min
+ *  naturalExponential       P.naturalExponential, P.toPower
+ *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,
+ *                           P.toPower, naturalExponential
+ *  nonFiniteToString        finiteToString, toStringBinary
+ *  parseDecimal             Decimal
+ *  parseOther               Decimal
+ *  sin                      P.sin
+ *  taylorSeries             P.cosh, P.sinh, cos, sin
+ *  toLessThanHalfPi         P.cos, P.sin
+ *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal
+ *  truncate                 intPow
+ *
+ *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,
+ *                           naturalLogarithm, config, parseOther, random, Decimal
+ */
+
+
+function digitsToString(d) {
+  var i, k, ws,
+    indexOfLastWord = d.length - 1,
+    str = '',
+    w = d[0];
+
+  if (indexOfLastWord > 0) {
+    str += w;
+    for (i = 1; i < indexOfLastWord; i++) {
+      ws = d[i] + '';
+      k = LOG_BASE - ws.length;
+      if (k) str += getZeroString(k);
+      str += ws;
+    }
+
+    w = d[i];
+    ws = w + '';
+    k = LOG_BASE - ws.length;
+    if (k) str += getZeroString(k);
+  } else if (w === 0) {
+    return '0';
+  }
+
+  // Remove trailing zeros of last w.
+  for (; w % 10 === 0;) w /= 10;
+
+  return str + w;
+}
+
+
+function checkInt32(i, min, max) {
+  if (i !== ~~i || i < min || i > max) {
+    throw Error(invalidArgument + i);
+  }
+}
+
+
+/*
+ * Check 5 rounding digits if `repeating` is null, 4 otherwise.
+ * `repeating == null` if caller is `log` or `pow`,
+ * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.
+ */
+function checkRoundingDigits(d, i, rm, repeating) {
+  var di, k, r, rd;
+
+  // Get the length of the first word of the array d.
+  for (k = d[0]; k >= 10; k /= 10) --i;
+
+  // Is the rounding digit in the first word of d?
+  if (--i < 0) {
+    i += LOG_BASE;
+    di = 0;
+  } else {
+    di = Math.ceil((i + 1) / LOG_BASE);
+    i %= LOG_BASE;
+  }
+
+  // i is the index (0 - 6) of the rounding digit.
+  // E.g. if within the word 3487563 the first rounding digit is 5,
+  // then i = 4, k = 1000, rd = 3487563 % 1000 = 563
+  k = mathpow(10, LOG_BASE - i);
+  rd = d[di] % k | 0;
+
+  if (repeating == null) {
+    if (i < 3) {
+      if (i == 0) rd = rd / 100 | 0;
+      else if (i == 1) rd = rd / 10 | 0;
+      r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;
+    } else {
+      r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&
+        (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||
+          (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;
+    }
+  } else {
+    if (i < 4) {
+      if (i == 0) rd = rd / 1000 | 0;
+      else if (i == 1) rd = rd / 100 | 0;
+      else if (i == 2) rd = rd / 10 | 0;
+      r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;
+    } else {
+      r = ((repeating || rm < 4) && rd + 1 == k ||
+      (!repeating && rm > 3) && rd + 1 == k / 2) &&
+        (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;
+    }
+  }
+
+  return r;
+}
+
+
+// Convert string of `baseIn` to an array of numbers of `baseOut`.
+// Eg. convertBase('255', 10, 16) returns [15, 15].
+// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].
+function convertBase(str, baseIn, baseOut) {
+  var j,
+    arr = [0],
+    arrL,
+    i = 0,
+    strL = str.length;
+
+  for (; i < strL;) {
+    for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;
+    arr[0] += NUMERALS.indexOf(str.charAt(i++));
+    for (j = 0; j < arr.length; j++) {
+      if (arr[j] > baseOut - 1) {
+        if (arr[j + 1] === void 0) arr[j + 1] = 0;
+        arr[j + 1] += arr[j] / baseOut | 0;
+        arr[j] %= baseOut;
+      }
+    }
+  }
+
+  return arr.reverse();
+}
+
+
+/*
+ * cos(x) = 1 - x^2/2! + x^4/4! - ...
+ * |x| < pi/2
+ *
+ */
+function cosine(Ctor, x) {
+  var k, len, y;
+
+  if (x.isZero()) return x;
+
+  // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1
+  // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1
+
+  // Estimate the optimum number of times to use the argument reduction.
+  len = x.d.length;
+  if (len < 32) {
+    k = Math.ceil(len / 3);
+    y = (1 / tinyPow(4, k)).toString();
+  } else {
+    k = 16;
+    y = '2.3283064365386962890625e-10';
+  }
+
+  Ctor.precision += k;
+
+  x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));
+
+  // Reverse argument reduction
+  for (var i = k; i--;) {
+    var cos2x = x.times(x);
+    x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);
+  }
+
+  Ctor.precision -= k;
+
+  return x;
+}
+
+
+/*
+ * Perform division in the specified base.
+ */
+var divide = (function () {
+
+  // Assumes non-zero x and k, and hence non-zero result.
+  function multiplyInteger(x, k, base) {
+    var temp,
+      carry = 0,
+      i = x.length;
+
+    for (x = x.slice(); i--;) {
+      temp = x[i] * k + carry;
+      x[i] = temp % base | 0;
+      carry = temp / base | 0;
+    }
+
+    if (carry) x.unshift(carry);
+
+    return x;
+  }
+
+  function compare(a, b, aL, bL) {
+    var i, r;
+
+    if (aL != bL) {
+      r = aL > bL ? 1 : -1;
+    } else {
+      for (i = r = 0; i < aL; i++) {
+        if (a[i] != b[i]) {
+          r = a[i] > b[i] ? 1 : -1;
+          break;
+        }
+      }
+    }
+
+    return r;
+  }
+
+  function subtract(a, b, aL, base) {
+    var i = 0;
+
+    // Subtract b from a.
+    for (; aL--;) {
+      a[aL] -= i;
+      i = a[aL] < b[aL] ? 1 : 0;
+      a[aL] = i * base + a[aL] - b[aL];
+    }
+
+    // Remove leading zeros.
+    for (; !a[0] && a.length > 1;) a.shift();
+  }
+
+  return function (x, y, pr, rm, dp, base) {
+    var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,
+      yL, yz,
+      Ctor = x.constructor,
+      sign = x.s == y.s ? 1 : -1,
+      xd = x.d,
+      yd = y.d;
+
+    // Either NaN, Infinity or 0?
+    if (!xd || !xd[0] || !yd || !yd[0]) {
+
+      return new Ctor(// Return NaN if either NaN, or both Infinity or 0.
+        !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :
+
+        // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
+        xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);
+    }
+
+    if (base) {
+      logBase = 1;
+      e = x.e - y.e;
+    } else {
+      base = BASE;
+      logBase = LOG_BASE;
+      e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);
+    }
+
+    yL = yd.length;
+    xL = xd.length;
+    q = new Ctor(sign);
+    qd = q.d = [];
+
+    // Result exponent may be one less than e.
+    // The digit array of a Decimal from toStringBinary may have trailing zeros.
+    for (i = 0; yd[i] == (xd[i] || 0); i++);
+
+    if (yd[i] > (xd[i] || 0)) e--;
+
+    if (pr == null) {
+      sd = pr = Ctor.precision;
+      rm = Ctor.rounding;
+    } else if (dp) {
+      sd = pr + (x.e - y.e) + 1;
+    } else {
+      sd = pr;
+    }
+
+    if (sd < 0) {
+      qd.push(1);
+      more = true;
+    } else {
+
+      // Convert precision in number of base 10 digits to base 1e7 digits.
+      sd = sd / logBase + 2 | 0;
+      i = 0;
+
+      // divisor < 1e7
+      if (yL == 1) {
+        k = 0;
+        yd = yd[0];
+        sd++;
+
+        // k is the carry.
+        for (; (i < xL || k) && sd--; i++) {
+          t = k * base + (xd[i] || 0);
+          qd[i] = t / yd | 0;
+          k = t % yd | 0;
+        }
+
+        more = k || i < xL;
+
+      // divisor >= 1e7
+      } else {
+
+        // Normalise xd and yd so highest order digit of yd is >= base/2
+        k = base / (yd[0] + 1) | 0;
+
+        if (k > 1) {
+          yd = multiplyInteger(yd, k, base);
+          xd = multiplyInteger(xd, k, base);
+          yL = yd.length;
+          xL = xd.length;
+        }
+
+        xi = yL;
+        rem = xd.slice(0, yL);
+        remL = rem.length;
+
+        // Add zeros to make remainder as long as divisor.
+        for (; remL < yL;) rem[remL++] = 0;
+
+        yz = yd.slice();
+        yz.unshift(0);
+        yd0 = yd[0];
+
+        if (yd[1] >= base / 2) ++yd0;
+
+        do {
+          k = 0;
+
+          // Compare divisor and remainder.
+          cmp = compare(yd, rem, yL, remL);
+
+          // If divisor < remainder.
+          if (cmp < 0) {
+
+            // Calculate trial digit, k.
+            rem0 = rem[0];
+            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
+
+            // k will be how many times the divisor goes into the current remainder.
+            k = rem0 / yd0 | 0;
+
+            //  Algorithm:
+            //  1. product = divisor * trial digit (k)
+            //  2. if product > remainder: product -= divisor, k--
+            //  3. remainder -= product
+            //  4. if product was < remainder at 2:
+            //    5. compare new remainder and divisor
+            //    6. If remainder > divisor: remainder -= divisor, k++
+
+            if (k > 1) {
+              if (k >= base) k = base - 1;
+
+              // product = divisor * trial digit.
+              prod = multiplyInteger(yd, k, base);
+              prodL = prod.length;
+              remL = rem.length;
+
+              // Compare product and remainder.
+              cmp = compare(prod, rem, prodL, remL);
+
+              // product > remainder.
+              if (cmp == 1) {
+                k--;
+
+                // Subtract divisor from product.
+                subtract(prod, yL < prodL ? yz : yd, prodL, base);
+              }
+            } else {
+
+              // cmp is -1.
+              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1
+              // to avoid it. If k is 1 there is a need to compare yd and rem again below.
+              if (k == 0) cmp = k = 1;
+              prod = yd.slice();
+            }
+
+            prodL = prod.length;
+            if (prodL < remL) prod.unshift(0);
+
+            // Subtract product from remainder.
+            subtract(rem, prod, remL, base);
+
+            // If product was < previous remainder.
+            if (cmp == -1) {
+              remL = rem.length;
+
+              // Compare divisor and new remainder.
+              cmp = compare(yd, rem, yL, remL);
+
+              // If divisor < new remainder, subtract divisor from remainder.
+              if (cmp < 1) {
+                k++;
+
+                // Subtract divisor from remainder.
+                subtract(rem, yL < remL ? yz : yd, remL, base);
+              }
+            }
+
+            remL = rem.length;
+          } else if (cmp === 0) {
+            k++;
+            rem = [0];
+          }    // if cmp === 1, k will be 0
+
+          // Add the next digit, k, to the result array.
+          qd[i++] = k;
+
+          // Update the remainder.
+          if (cmp && rem[0]) {
+            rem[remL++] = xd[xi] || 0;
+          } else {
+            rem = [xd[xi]];
+            remL = 1;
+          }
+
+        } while ((xi++ < xL || rem[0] !== void 0) && sd--);
+
+        more = rem[0] !== void 0;
+      }
+
+      // Leading zero?
+      if (!qd[0]) qd.shift();
+    }
+
+    // logBase is 1 when divide is being used for base conversion.
+    if (logBase == 1) {
+      q.e = e;
+      inexact = more;
+    } else {
+
+      // To calculate q.e, first get the number of digits of qd[0].
+      for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;
+      q.e = i + e * logBase - 1;
+
+      finalise(q, dp ? pr + q.e + 1 : pr, rm, more);
+    }
+
+    return q;
+  };
+})();
+
+
+/*
+ * Round `x` to `sd` significant digits using rounding mode `rm`.
+ * Check for over/under-flow.
+ */
+ function finalise(x, sd, rm, isTruncated) {
+  var digits, i, j, k, rd, roundUp, w, xd, xdi,
+    Ctor = x.constructor;
+
+  // Don't round if sd is null or undefined.
+  out: if (sd != null) {
+    xd = x.d;
+
+    // Infinity/NaN.
+    if (!xd) return x;
+
+    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.
+    // w: the word of xd containing rd, a base 1e7 number.
+    // xdi: the index of w within xd.
+    // digits: the number of digits of w.
+    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if
+    // they had leading zeros)
+    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).
+
+    // Get the length of the first word of the digits array xd.
+    for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;
+    i = sd - digits;
+
+    // Is the rounding digit in the first word of xd?
+    if (i < 0) {
+      i += LOG_BASE;
+      j = sd;
+      w = xd[xdi = 0];
+
+      // Get the rounding digit at index j of w.
+      rd = w / mathpow(10, digits - j - 1) % 10 | 0;
+    } else {
+      xdi = Math.ceil((i + 1) / LOG_BASE);
+      k = xd.length;
+      if (xdi >= k) {
+        if (isTruncated) {
+
+          // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.
+          for (; k++ <= xdi;) xd.push(0);
+          w = rd = 0;
+          digits = 1;
+          i %= LOG_BASE;
+          j = i - LOG_BASE + 1;
+        } else {
+          break out;
+        }
+      } else {
+        w = k = xd[xdi];
+
+        // Get the number of digits of w.
+        for (digits = 1; k >= 10; k /= 10) digits++;
+
+        // Get the index of rd within w.
+        i %= LOG_BASE;
+
+        // Get the index of rd within w, adjusted for leading zeros.
+        // The number of leading zeros of w is given by LOG_BASE - digits.
+        j = i - LOG_BASE + digits;
+
+        // Get the rounding digit at index j of w.
+        rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;
+      }
+    }
+
+    // Are there any non-zero digits after the rounding digit?
+    isTruncated = isTruncated || sd < 0 ||
+      xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));
+
+    // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right
+    // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression
+    // will give 714.
+
+    roundUp = rm < 4
+      ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))
+      : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&
+
+        // Check whether the digit to the left of the rounding digit is odd.
+        ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||
+          rm == (x.s < 0 ? 8 : 7));
+
+    if (sd < 1 || !xd[0]) {
+      xd.length = 0;
+      if (roundUp) {
+
+        // Convert sd to decimal places.
+        sd -= x.e + 1;
+
+        // 1, 0.1, 0.01, 0.001, 0.0001 etc.
+        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);
+        x.e = -sd || 0;
+      } else {
+
+        // Zero.
+        xd[0] = x.e = 0;
+      }
+
+      return x;
+    }
+
+    // Remove excess digits.
+    if (i == 0) {
+      xd.length = xdi;
+      k = 1;
+      xdi--;
+    } else {
+      xd.length = xdi + 1;
+      k = mathpow(10, LOG_BASE - i);
+
+      // E.g. 56700 becomes 56000 if 7 is the rounding digit.
+      // j > 0 means i > number of leading zeros of w.
+      xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;
+    }
+
+    if (roundUp) {
+      for (;;) {
+
+        // Is the digit to be rounded up in the first word of xd?
+        if (xdi == 0) {
+
+          // i will be the length of xd[0] before k is added.
+          for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;
+          j = xd[0] += k;
+          for (k = 1; j >= 10; j /= 10) k++;
+
+          // if i != k the length has increased.
+          if (i != k) {
+            x.e++;
+            if (xd[0] == BASE) xd[0] = 1;
+          }
+
+          break;
+        } else {
+          xd[xdi] += k;
+          if (xd[xdi] != BASE) break;
+          xd[xdi--] = 0;
+          k = 1;
+        }
+      }
+    }
+
+    // Remove trailing zeros.
+    for (i = xd.length; xd[--i] === 0;) xd.pop();
+  }
+
+  if (external) {
+
+    // Overflow?
+    if (x.e > Ctor.maxE) {
+
+      // Infinity.
+      x.d = null;
+      x.e = NaN;
+
+    // Underflow?
+    } else if (x.e < Ctor.minE) {
+
+      // Zero.
+      x.e = 0;
+      x.d = [0];
+      // Ctor.underflow = true;
+    } // else Ctor.underflow = false;
+  }
+
+  return x;
+}
+
+
+function finiteToString(x, isExp, sd) {
+  if (!x.isFinite()) return nonFiniteToString(x);
+  var k,
+    e = x.e,
+    str = digitsToString(x.d),
+    len = str.length;
+
+  if (isExp) {
+    if (sd && (k = sd - len) > 0) {
+      str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);
+    } else if (len > 1) {
+      str = str.charAt(0) + '.' + str.slice(1);
+    }
+
+    str = str + (x.e < 0 ? 'e' : 'e+') + x.e;
+  } else if (e < 0) {
+    str = '0.' + getZeroString(-e - 1) + str;
+    if (sd && (k = sd - len) > 0) str += getZeroString(k);
+  } else if (e >= len) {
+    str += getZeroString(e + 1 - len);
+    if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);
+  } else {
+    if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);
+    if (sd && (k = sd - len) > 0) {
+      if (e + 1 === len) str += '.';
+      str += getZeroString(k);
+    }
+  }
+
+  return str;
+}
+
+
+// Calculate the base 10 exponent from the base 1e7 exponent.
+function getBase10Exponent(digits, e) {
+  var w = digits[0];
+
+  // Add the number of digits of the first word of the digits array.
+  for ( e *= LOG_BASE; w >= 10; w /= 10) e++;
+  return e;
+}
+
+
+function getLn10(Ctor, sd, pr) {
+  if (sd > LN10_PRECISION) {
+
+    // Reset global state in case the exception is caught.
+    external = true;
+    if (pr) Ctor.precision = pr;
+    throw Error(precisionLimitExceeded);
+  }
+  return finalise(new Ctor(LN10), sd, 1, true);
+}
+
+
+function getPi(Ctor, sd, rm) {
+  if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);
+  return finalise(new Ctor(PI), sd, rm, true);
+}
+
+
+function getPrecision(digits) {
+  var w = digits.length - 1,
+    len = w * LOG_BASE + 1;
+
+  w = digits[w];
+
+  // If non-zero...
+  if (w) {
+
+    // Subtract the number of trailing zeros of the last word.
+    for (; w % 10 == 0; w /= 10) len--;
+
+    // Add the number of digits of the first word.
+    for (w = digits[0]; w >= 10; w /= 10) len++;
+  }
+
+  return len;
+}
+
+
+function getZeroString(k) {
+  var zs = '';
+  for (; k--;) zs += '0';
+  return zs;
+}
+
+
+/*
+ * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an
+ * integer of type number.
+ *
+ * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.
+ *
+ */
+function intPow(Ctor, x, n, pr) {
+  var isTruncated,
+    r = new Ctor(1),
+
+    // Max n of 9007199254740991 takes 53 loop iterations.
+    // Maximum digits array length; leaves [28, 34] guard digits.
+    k = Math.ceil(pr / LOG_BASE + 4);
+
+  external = false;
+
+  for (;;) {
+    if (n % 2) {
+      r = r.times(x);
+      if (truncate(r.d, k)) isTruncated = true;
+    }
+
+    n = mathfloor(n / 2);
+    if (n === 0) {
+
+      // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.
+      n = r.d.length - 1;
+      if (isTruncated && r.d[n] === 0) ++r.d[n];
+      break;
+    }
+
+    x = x.times(x);
+    truncate(x.d, k);
+  }
+
+  external = true;
+
+  return r;
+}
+
+
+function isOdd(n) {
+  return n.d[n.d.length - 1] & 1;
+}
+
+
+/*
+ * Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.
+ */
+function maxOrMin(Ctor, args, ltgt) {
+  var y,
+    x = new Ctor(args[0]),
+    i = 0;
+
+  for (; ++i < args.length;) {
+    y = new Ctor(args[i]);
+    if (!y.s) {
+      x = y;
+      break;
+    } else if (x[ltgt](y)) {
+      x = y;
+    }
+  }
+
+  return x;
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant
+ * digits.
+ *
+ * Taylor/Maclaurin series.
+ *
+ * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...
+ *
+ * Argument reduction:
+ *   Repeat x = x / 32, k += 5, until |x| < 0.1
+ *   exp(x) = exp(x / 2^k)^(2^k)
+ *
+ * Previously, the argument was initially reduced by
+ * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)
+ * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was
+ * found to be slower than just dividing repeatedly by 32 as above.
+ *
+ * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000
+ * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000
+ * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)
+ *
+ *  exp(Infinity)  = Infinity
+ *  exp(-Infinity) = 0
+ *  exp(NaN)       = NaN
+ *  exp(±0)        = 1
+ *
+ *  exp(x) is non-terminating for any finite, non-zero x.
+ *
+ *  The result will always be correctly rounded.
+ *
+ */
+function naturalExponential(x, sd) {
+  var denominator, guard, j, pow, sum, t, wpr,
+    rep = 0,
+    i = 0,
+    k = 0,
+    Ctor = x.constructor,
+    rm = Ctor.rounding,
+    pr = Ctor.precision;
+
+  // 0/NaN/Infinity?
+  if (!x.d || !x.d[0] || x.e > 17) {
+
+    return new Ctor(x.d
+      ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0
+      : x.s ? x.s < 0 ? 0 : x : 0 / 0);
+  }
+
+  if (sd == null) {
+    external = false;
+    wpr = pr;
+  } else {
+    wpr = sd;
+  }
+
+  t = new Ctor(0.03125);
+
+  // while abs(x) >= 0.1
+  while (x.e > -2) {
+
+    // x = x / 2^5
+    x = x.times(t);
+    k += 5;
+  }
+
+  // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision
+  // necessary to ensure the first 4 rounding digits are correct.
+  guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;
+  wpr += guard;
+  denominator = pow = sum = new Ctor(1);
+  Ctor.precision = wpr;
+
+  for (;;) {
+    pow = finalise(pow.times(x), wpr, 1);
+    denominator = denominator.times(++i);
+    t = sum.plus(divide(pow, denominator, wpr, 1));
+
+    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+      j = k;
+      while (j--) sum = finalise(sum.times(sum), wpr, 1);
+
+      // Check to see if the first 4 rounding digits are [49]999.
+      // If so, repeat the summation with a higher precision, otherwise
+      // e.g. with precision: 18, rounding: 1
+      // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)
+      // `wpr - guard` is the index of first rounding digit.
+      if (sd == null) {
+
+        if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+          Ctor.precision = wpr += 10;
+          denominator = pow = t = new Ctor(1);
+          i = 0;
+          rep++;
+        } else {
+          return finalise(sum, Ctor.precision = pr, rm, external = true);
+        }
+      } else {
+        Ctor.precision = pr;
+        return sum;
+      }
+    }
+
+    sum = t;
+  }
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant
+ * digits.
+ *
+ *  ln(-n)        = NaN
+ *  ln(0)         = -Infinity
+ *  ln(-0)        = -Infinity
+ *  ln(1)         = 0
+ *  ln(Infinity)  = Infinity
+ *  ln(-Infinity) = NaN
+ *  ln(NaN)       = NaN
+ *
+ *  ln(n) (n != 1) is non-terminating.
+ *
+ */
+function naturalLogarithm(y, sd) {
+  var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,
+    n = 1,
+    guard = 10,
+    x = y,
+    xd = x.d,
+    Ctor = x.constructor,
+    rm = Ctor.rounding,
+    pr = Ctor.precision;
+
+  // Is x negative or Infinity, NaN, 0 or 1?
+  if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {
+    return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);
+  }
+
+  if (sd == null) {
+    external = false;
+    wpr = pr;
+  } else {
+    wpr = sd;
+  }
+
+  Ctor.precision = wpr += guard;
+  c = digitsToString(xd);
+  c0 = c.charAt(0);
+
+  if (Math.abs(e = x.e) < 1.5e15) {
+
+    // Argument reduction.
+    // The series converges faster the closer the argument is to 1, so using
+    // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b
+    // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,
+    // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can
+    // later be divided by this number, then separate out the power of 10 using
+    // ln(a*10^b) = ln(a) + b*ln(10).
+
+    // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).
+    //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {
+    // max n is 6 (gives 0.7 - 1.3)
+    while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {
+      x = x.times(y);
+      c = digitsToString(x.d);
+      c0 = c.charAt(0);
+      n++;
+    }
+
+    e = x.e;
+
+    if (c0 > 1) {
+      x = new Ctor('0.' + c);
+      e++;
+    } else {
+      x = new Ctor(c0 + '.' + c.slice(1));
+    }
+  } else {
+
+    // The argument reduction method above may result in overflow if the argument y is a massive
+    // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this
+    // function using ln(x*10^e) = ln(x) + e*ln(10).
+    t = getLn10(Ctor, wpr + 2, pr).times(e + '');
+    x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);
+    Ctor.precision = pr;
+
+    return sd == null ? finalise(x, pr, rm, external = true) : x;
+  }
+
+  // x1 is x reduced to a value near 1.
+  x1 = x;
+
+  // Taylor series.
+  // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)
+  // where x = (y - 1)/(y + 1)    (|x| < 1)
+  sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);
+  x2 = finalise(x.times(x), wpr, 1);
+  denominator = 3;
+
+  for (;;) {
+    numerator = finalise(numerator.times(x2), wpr, 1);
+    t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));
+
+    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+      sum = sum.times(2);
+
+      // Reverse the argument reduction. Check that e is not 0 because, besides preventing an
+      // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.
+      if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));
+      sum = divide(sum, new Ctor(n), wpr, 1);
+
+      // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has
+      // been repeated previously) and the first 4 rounding digits 9999?
+      // If so, restart the summation with a higher precision, otherwise
+      // e.g. with precision: 12, rounding: 1
+      // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.
+      // `wpr - guard` is the index of first rounding digit.
+      if (sd == null) {
+        if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+          Ctor.precision = wpr += guard;
+          t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);
+          x2 = finalise(x.times(x), wpr, 1);
+          denominator = rep = 1;
+        } else {
+          return finalise(sum, Ctor.precision = pr, rm, external = true);
+        }
+      } else {
+        Ctor.precision = pr;
+        return sum;
+      }
+    }
+
+    sum = t;
+    denominator += 2;
+  }
+}
+
+
+// ±Infinity, NaN.
+function nonFiniteToString(x) {
+  // Unsigned.
+  return String(x.s * x.s / 0);
+}
+
+
+/*
+ * Parse the value of a new Decimal `x` from string `str`.
+ */
+function parseDecimal(x, str) {
+  var e, i, len;
+
+  // Decimal point?
+  if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
+
+  // Exponential form?
+  if ((i = str.search(/e/i)) > 0) {
+
+    // Determine exponent.
+    if (e < 0) e = i;
+    e += +str.slice(i + 1);
+    str = str.substring(0, i);
+  } else if (e < 0) {
+
+    // Integer.
+    e = str.length;
+  }
+
+  // Determine leading zeros.
+  for (i = 0; str.charCodeAt(i) === 48; i++);
+
+  // Determine trailing zeros.
+  for (len = str.length; str.charCodeAt(len - 1) === 48; --len);
+  str = str.slice(i, len);
+
+  if (str) {
+    len -= i;
+    x.e = e = e - i - 1;
+    x.d = [];
+
+    // Transform base
+
+    // e is the base 10 exponent.
+    // i is where to slice str to get the first word of the digits array.
+    i = (e + 1) % LOG_BASE;
+    if (e < 0) i += LOG_BASE;
+
+    if (i < len) {
+      if (i) x.d.push(+str.slice(0, i));
+      for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));
+      str = str.slice(i);
+      i = LOG_BASE - str.length;
+    } else {
+      i -= len;
+    }
+
+    for (; i--;) str += '0';
+    x.d.push(+str);
+
+    if (external) {
+
+      // Overflow?
+      if (x.e > x.constructor.maxE) {
+
+        // Infinity.
+        x.d = null;
+        x.e = NaN;
+
+      // Underflow?
+      } else if (x.e < x.constructor.minE) {
+
+        // Zero.
+        x.e = 0;
+        x.d = [0];
+        // x.constructor.underflow = true;
+      } // else x.constructor.underflow = false;
+    }
+  } else {
+
+    // Zero.
+    x.e = 0;
+    x.d = [0];
+  }
+
+  return x;
+}
+
+
+/*
+ * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.
+ */
+function parseOther(x, str) {
+  var base, Ctor, divisor, i, isFloat, len, p, xd, xe;
+
+  if (str.indexOf('_') > -1) {
+    str = str.replace(/(\d)_(?=\d)/g, '$1');
+    if (isDecimal.test(str)) return parseDecimal(x, str);
+  } else if (str === 'Infinity' || str === 'NaN') {
+    if (!+str) x.s = NaN;
+    x.e = NaN;
+    x.d = null;
+    return x;
+  }
+
+  if (isHex.test(str))  {
+    base = 16;
+    str = str.toLowerCase();
+  } else if (isBinary.test(str))  {
+    base = 2;
+  } else if (isOctal.test(str))  {
+    base = 8;
+  } else {
+    throw Error(invalidArgument + str);
+  }
+
+  // Is there a binary exponent part?
+  i = str.search(/p/i);
+
+  if (i > 0) {
+    p = +str.slice(i + 1);
+    str = str.substring(2, i);
+  } else {
+    str = str.slice(2);
+  }
+
+  // Convert `str` as an integer then divide the result by `base` raised to a power such that the
+  // fraction part will be restored.
+  i = str.indexOf('.');
+  isFloat = i >= 0;
+  Ctor = x.constructor;
+
+  if (isFloat) {
+    str = str.replace('.', '');
+    len = str.length;
+    i = len - i;
+
+    // log[10](16) = 1.2041... , log[10](88) = 1.9444....
+    divisor = intPow(Ctor, new Ctor(base), i, i * 2);
+  }
+
+  xd = convertBase(str, base, BASE);
+  xe = xd.length - 1;
+
+  // Remove trailing zeros.
+  for (i = xe; xd[i] === 0; --i) xd.pop();
+  if (i < 0) return new Ctor(x.s * 0);
+  x.e = getBase10Exponent(xd, xe);
+  x.d = xd;
+  external = false;
+
+  // At what precision to perform the division to ensure exact conversion?
+  // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)
+  // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412
+  // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.
+  // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount
+  // Therefore using 4 * the number of digits of str will always be enough.
+  if (isFloat) x = divide(x, divisor, len * 4);
+
+  // Multiply by the binary exponent part if present.
+  if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));
+  external = true;
+
+  return x;
+}
+
+
+/*
+ * sin(x) = x - x^3/3! + x^5/5! - ...
+ * |x| < pi/2
+ *
+ */
+function sine(Ctor, x) {
+  var k,
+    len = x.d.length;
+
+  if (len < 3) {
+    return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);
+  }
+
+  // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)
+  // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)
+  // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))
+
+  // Estimate the optimum number of times to use the argument reduction.
+  k = 1.4 * Math.sqrt(len);
+  k = k > 16 ? 16 : k | 0;
+
+  x = x.times(1 / tinyPow(5, k));
+  x = taylorSeries(Ctor, 2, x, x);
+
+  // Reverse argument reduction
+  var sin2_x,
+    d5 = new Ctor(5),
+    d16 = new Ctor(16),
+    d20 = new Ctor(20);
+  for (; k--;) {
+    sin2_x = x.times(x);
+    x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));
+  }
+
+  return x;
+}
+
+
+// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.
+function taylorSeries(Ctor, n, x, y, isHyperbolic) {
+  var j, t, u, x2,
+    i = 1,
+    pr = Ctor.precision,
+    k = Math.ceil(pr / LOG_BASE);
+
+  external = false;
+  x2 = x.times(x);
+  u = new Ctor(y);
+
+  for (;;) {
+    t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);
+    u = isHyperbolic ? y.plus(t) : y.minus(t);
+    y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);
+    t = u.plus(y);
+
+    if (t.d[k] !== void 0) {
+      for (j = k; t.d[j] === u.d[j] && j--;);
+      if (j == -1) break;
+    }
+
+    j = u;
+    u = y;
+    y = t;
+    t = j;
+    i++;
+  }
+
+  external = true;
+  t.d.length = k + 1;
+
+  return t;
+}
+
+
+// Exponent e must be positive and non-zero.
+function tinyPow(b, e) {
+  var n = b;
+  while (--e) n *= b;
+  return n;
+}
+
+
+// Return the absolute value of `x` reduced to less than or equal to half pi.
+function toLessThanHalfPi(Ctor, x) {
+  var t,
+    isNeg = x.s < 0,
+    pi = getPi(Ctor, Ctor.precision, 1),
+    halfPi = pi.times(0.5);
+
+  x = x.abs();
+
+  if (x.lte(halfPi)) {
+    quadrant = isNeg ? 4 : 1;
+    return x;
+  }
+
+  t = x.divToInt(pi);
+
+  if (t.isZero()) {
+    quadrant = isNeg ? 3 : 2;
+  } else {
+    x = x.minus(t.times(pi));
+
+    // 0 <= x < pi
+    if (x.lte(halfPi)) {
+      quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);
+      return x;
+    }
+
+    quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);
+  }
+
+  return x.minus(pi).abs();
+}
+
+
+/*
+ * Return the value of Decimal `x` as a string in base `baseOut`.
+ *
+ * If the optional `sd` argument is present include a binary exponent suffix.
+ */
+function toStringBinary(x, baseOut, sd, rm) {
+  var base, e, i, k, len, roundUp, str, xd, y,
+    Ctor = x.constructor,
+    isExp = sd !== void 0;
+
+  if (isExp) {
+    checkInt32(sd, 1, MAX_DIGITS);
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+  } else {
+    sd = Ctor.precision;
+    rm = Ctor.rounding;
+  }
+
+  if (!x.isFinite()) {
+    str = nonFiniteToString(x);
+  } else {
+    str = finiteToString(x);
+    i = str.indexOf('.');
+
+    // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:
+    // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))
+    // minBinaryExponent = floor(decimalExponent * log[2](10))
+    // log[2](10) = 3.321928094887362347870319429489390175864
+
+    if (isExp) {
+      base = 2;
+      if (baseOut == 16) {
+        sd = sd * 4 - 3;
+      } else if (baseOut == 8) {
+        sd = sd * 3 - 2;
+      }
+    } else {
+      base = baseOut;
+    }
+
+    // Convert the number as an integer then divide the result by its base raised to a power such
+    // that the fraction part will be restored.
+
+    // Non-integer.
+    if (i >= 0) {
+      str = str.replace('.', '');
+      y = new Ctor(1);
+      y.e = str.length - i;
+      y.d = convertBase(finiteToString(y), 10, base);
+      y.e = y.d.length;
+    }
+
+    xd = convertBase(str, 10, base);
+    e = len = xd.length;
+
+    // Remove trailing zeros.
+    for (; xd[--len] == 0;) xd.pop();
+
+    if (!xd[0]) {
+      str = isExp ? '0p+0' : '0';
+    } else {
+      if (i < 0) {
+        e--;
+      } else {
+        x = new Ctor(x);
+        x.d = xd;
+        x.e = e;
+        x = divide(x, y, sd, rm, 0, base);
+        xd = x.d;
+        e = x.e;
+        roundUp = inexact;
+      }
+
+      // The rounding digit, i.e. the digit after the digit that may be rounded up.
+      i = xd[sd];
+      k = base / 2;
+      roundUp = roundUp || xd[sd + 1] !== void 0;
+
+      roundUp = rm < 4
+        ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))
+        : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||
+          rm === (x.s < 0 ? 8 : 7));
+
+      xd.length = sd;
+
+      if (roundUp) {
+
+        // Rounding up may mean the previous digit has to be rounded up and so on.
+        for (; ++xd[--sd] > base - 1;) {
+          xd[sd] = 0;
+          if (!sd) {
+            ++e;
+            xd.unshift(1);
+          }
+        }
+      }
+
+      // Determine trailing zeros.
+      for (len = xd.length; !xd[len - 1]; --len);
+
+      // E.g. [4, 11, 15] becomes 4bf.
+      for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);
+
+      // Add binary exponent suffix?
+      if (isExp) {
+        if (len > 1) {
+          if (baseOut == 16 || baseOut == 8) {
+            i = baseOut == 16 ? 4 : 3;
+            for (--len; len % i; len++) str += '0';
+            xd = convertBase(str, base, baseOut);
+            for (len = xd.length; !xd[len - 1]; --len);
+
+            // xd[0] will always be be 1
+            for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);
+          } else {
+            str = str.charAt(0) + '.' + str.slice(1);
+          }
+        }
+
+        str =  str + (e < 0 ? 'p' : 'p+') + e;
+      } else if (e < 0) {
+        for (; ++e;) str = '0' + str;
+        str = '0.' + str;
+      } else {
+        if (++e > len) for (e -= len; e-- ;) str += '0';
+        else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);
+      }
+    }
+
+    str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;
+  }
+
+  return x.s < 0 ? '-' + str : str;
+}
+
+
+// Does not strip trailing zeros.
+function truncate(arr, len) {
+  if (arr.length > len) {
+    arr.length = len;
+    return true;
+  }
+}
+
+
+// Decimal methods
+
+
+/*
+ *  abs
+ *  acos
+ *  acosh
+ *  add
+ *  asin
+ *  asinh
+ *  atan
+ *  atanh
+ *  atan2
+ *  cbrt
+ *  ceil
+ *  clamp
+ *  clone
+ *  config
+ *  cos
+ *  cosh
+ *  div
+ *  exp
+ *  floor
+ *  hypot
+ *  ln
+ *  log
+ *  log2
+ *  log10
+ *  max
+ *  min
+ *  mod
+ *  mul
+ *  pow
+ *  random
+ *  round
+ *  set
+ *  sign
+ *  sin
+ *  sinh
+ *  sqrt
+ *  sub
+ *  sum
+ *  tan
+ *  tanh
+ *  trunc
+ */
+
+
+/*
+ * Return a new Decimal whose value is the absolute value of `x`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function abs(x) {
+  return new this(x).abs();
+}
+
+
+/*
+ * Return a new Decimal whose value is the arccosine in radians of `x`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function acos(x) {
+  return new this(x).acos();
+}
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function acosh(x) {
+  return new this(x).acosh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ * y {number|string|Decimal}
+ *
+ */
+function add(x, y) {
+  return new this(x).plus(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function asin(x) {
+  return new this(x).asin();
+}
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function asinh(x) {
+  return new this(x).asinh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function atan(x) {
+  return new this(x).atan();
+}
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function atanh(x) {
+  return new this(x).atanh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi
+ * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-pi, pi]
+ *
+ * y {number|string|Decimal} The y-coordinate.
+ * x {number|string|Decimal} The x-coordinate.
+ *
+ * atan2(±0, -0)               = ±pi
+ * atan2(±0, +0)               = ±0
+ * atan2(±0, -x)               = ±pi for x > 0
+ * atan2(±0, x)                = ±0 for x > 0
+ * atan2(-y, ±0)               = -pi/2 for y > 0
+ * atan2(y, ±0)                = pi/2 for y > 0
+ * atan2(±y, -Infinity)        = ±pi for finite y > 0
+ * atan2(±y, +Infinity)        = ±0 for finite y > 0
+ * atan2(±Infinity, x)         = ±pi/2 for finite x
+ * atan2(±Infinity, -Infinity) = ±3*pi/4
+ * atan2(±Infinity, +Infinity) = ±pi/4
+ * atan2(NaN, x) = NaN
+ * atan2(y, NaN) = NaN
+ *
+ */
+function atan2(y, x) {
+  y = new this(y);
+  x = new this(x);
+  var r,
+    pr = this.precision,
+    rm = this.rounding,
+    wpr = pr + 4;
+
+  // Either NaN
+  if (!y.s || !x.s) {
+    r = new this(NaN);
+
+  // Both ±Infinity
+  } else if (!y.d && !x.d) {
+    r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);
+    r.s = y.s;
+
+  // x is ±Infinity or y is ±0
+  } else if (!x.d || y.isZero()) {
+    r = x.s < 0 ? getPi(this, pr, rm) : new this(0);
+    r.s = y.s;
+
+  // y is ±Infinity or x is ±0
+  } else if (!y.d || x.isZero()) {
+    r = getPi(this, wpr, 1).times(0.5);
+    r.s = y.s;
+
+  // Both non-zero and finite
+  } else if (x.s < 0) {
+    this.precision = wpr;
+    this.rounding = 1;
+    r = this.atan(divide(y, x, wpr, 1));
+    x = getPi(this, wpr, 1);
+    this.precision = pr;
+    this.rounding = rm;
+    r = y.s < 0 ? r.minus(x) : r.plus(x);
+  } else {
+    r = this.atan(divide(y, x, wpr, 1));
+  }
+
+  return r;
+}
+
+
+/*
+ * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function cbrt(x) {
+  return new this(x).cbrt();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function ceil(x) {
+  return finalise(x = new this(x), x.e + 1, 2);
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.
+ *
+ * x {number|string|Decimal}
+ * min {number|string|Decimal}
+ * max {number|string|Decimal}
+ *
+ */
+function clamp(x, min, max) {
+  return new this(x).clamp(min, max);
+}
+
+
+/*
+ * Configure global settings for a Decimal constructor.
+ *
+ * `obj` is an object with one or more of the following properties,
+ *
+ *   precision  {number}
+ *   rounding   {number}
+ *   toExpNeg   {number}
+ *   toExpPos   {number}
+ *   maxE       {number}
+ *   minE       {number}
+ *   modulo     {number}
+ *   crypto     {boolean|number}
+ *   defaults   {true}
+ *
+ * E.g. Decimal.config({ precision: 20, rounding: 4 })
+ *
+ */
+function config(obj) {
+  if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');
+  var i, p, v,
+    useDefaults = obj.defaults === true,
+    ps = [
+      'precision', 1, MAX_DIGITS,
+      'rounding', 0, 8,
+      'toExpNeg', -EXP_LIMIT, 0,
+      'toExpPos', 0, EXP_LIMIT,
+      'maxE', 0, EXP_LIMIT,
+      'minE', -EXP_LIMIT, 0,
+      'modulo', 0, 9
+    ];
+
+  for (i = 0; i < ps.length; i += 3) {
+    if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];
+    if ((v = obj[p]) !== void 0) {
+      if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;
+      else throw Error(invalidArgument + p + ': ' + v);
+    }
+  }
+
+  if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];
+  if ((v = obj[p]) !== void 0) {
+    if (v === true || v === false || v === 0 || v === 1) {
+      if (v) {
+        if (typeof crypto != 'undefined' && crypto &&
+          (crypto.getRandomValues || crypto.randomBytes)) {
+          this[p] = true;
+        } else {
+          throw Error(cryptoUnavailable);
+        }
+      } else {
+        this[p] = false;
+      }
+    } else {
+      throw Error(invalidArgument + p + ': ' + v);
+    }
+  }
+
+  return this;
+}
+
+
+/*
+ * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function cos(x) {
+  return new this(x).cos();
+}
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function cosh(x) {
+  return new this(x).cosh();
+}
+
+
+/*
+ * Create and return a Decimal constructor with the same configuration properties as this Decimal
+ * constructor.
+ *
+ */
+function clone(obj) {
+  var i, p, ps;
+
+  /*
+   * The Decimal constructor and exported function.
+   * Return a new Decimal instance.
+   *
+   * v {number|string|Decimal} A numeric value.
+   *
+   */
+  function Decimal(v) {
+    var e, i, t,
+      x = this;
+
+    // Decimal called without new.
+    if (!(x instanceof Decimal)) return new Decimal(v);
+
+    // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor
+    // which points to Object.
+    x.constructor = Decimal;
+
+    // Duplicate.
+    if (isDecimalInstance(v)) {
+      x.s = v.s;
+
+      if (external) {
+        if (!v.d || v.e > Decimal.maxE) {
+
+          // Infinity.
+          x.e = NaN;
+          x.d = null;
+        } else if (v.e < Decimal.minE) {
+
+          // Zero.
+          x.e = 0;
+          x.d = [0];
+        } else {
+          x.e = v.e;
+          x.d = v.d.slice();
+        }
+      } else {
+        x.e = v.e;
+        x.d = v.d ? v.d.slice() : v.d;
+      }
+
+      return;
+    }
+
+    t = typeof v;
+
+    if (t === 'number') {
+      if (v === 0) {
+        x.s = 1 / v < 0 ? -1 : 1;
+        x.e = 0;
+        x.d = [0];
+        return;
+      }
+
+      if (v < 0) {
+        v = -v;
+        x.s = -1;
+      } else {
+        x.s = 1;
+      }
+
+      // Fast path for small integers.
+      if (v === ~~v && v < 1e7) {
+        for (e = 0, i = v; i >= 10; i /= 10) e++;
+
+        if (external) {
+          if (e > Decimal.maxE) {
+            x.e = NaN;
+            x.d = null;
+          } else if (e < Decimal.minE) {
+            x.e = 0;
+            x.d = [0];
+          } else {
+            x.e = e;
+            x.d = [v];
+          }
+        } else {
+          x.e = e;
+          x.d = [v];
+        }
+
+        return;
+
+      // Infinity, NaN.
+      } else if (v * 0 !== 0) {
+        if (!v) x.s = NaN;
+        x.e = NaN;
+        x.d = null;
+        return;
+      }
+
+      return parseDecimal(x, v.toString());
+
+    } else if (t !== 'string') {
+      throw Error(invalidArgument + v);
+    }
+
+    // Minus sign?
+    if ((i = v.charCodeAt(0)) === 45) {
+      v = v.slice(1);
+      x.s = -1;
+    } else {
+      // Plus sign?
+      if (i === 43) v = v.slice(1);
+      x.s = 1;
+    }
+
+    return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);
+  }
+
+  Decimal.prototype = P;
+
+  Decimal.ROUND_UP = 0;
+  Decimal.ROUND_DOWN = 1;
+  Decimal.ROUND_CEIL = 2;
+  Decimal.ROUND_FLOOR = 3;
+  Decimal.ROUND_HALF_UP = 4;
+  Decimal.ROUND_HALF_DOWN = 5;
+  Decimal.ROUND_HALF_EVEN = 6;
+  Decimal.ROUND_HALF_CEIL = 7;
+  Decimal.ROUND_HALF_FLOOR = 8;
+  Decimal.EUCLID = 9;
+
+  Decimal.config = Decimal.set = config;
+  Decimal.clone = clone;
+  Decimal.isDecimal = isDecimalInstance;
+
+  Decimal.abs = abs;
+  Decimal.acos = acos;
+  Decimal.acosh = acosh;        // ES6
+  Decimal.add = add;
+  Decimal.asin = asin;
+  Decimal.asinh = asinh;        // ES6
+  Decimal.atan = atan;
+  Decimal.atanh = atanh;        // ES6
+  Decimal.atan2 = atan2;
+  Decimal.cbrt = cbrt;          // ES6
+  Decimal.ceil = ceil;
+  Decimal.clamp = clamp;
+  Decimal.cos = cos;
+  Decimal.cosh = cosh;          // ES6
+  Decimal.div = div;
+  Decimal.exp = exp;
+  Decimal.floor = floor;
+  Decimal.hypot = hypot;        // ES6
+  Decimal.ln = ln;
+  Decimal.log = log;
+  Decimal.log10 = log10;        // ES6
+  Decimal.log2 = log2;          // ES6
+  Decimal.max = max;
+  Decimal.min = min;
+  Decimal.mod = mod;
+  Decimal.mul = mul;
+  Decimal.pow = pow;
+  Decimal.random = random;
+  Decimal.round = round;
+  Decimal.sign = sign;          // ES6
+  Decimal.sin = sin;
+  Decimal.sinh = sinh;          // ES6
+  Decimal.sqrt = sqrt;
+  Decimal.sub = sub;
+  Decimal.sum = sum;
+  Decimal.tan = tan;
+  Decimal.tanh = tanh;          // ES6
+  Decimal.trunc = trunc;        // ES6
+
+  if (obj === void 0) obj = {};
+  if (obj) {
+    if (obj.defaults !== true) {
+      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];
+      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];
+    }
+  }
+
+  Decimal.config(obj);
+
+  return Decimal;
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ * y {number|string|Decimal}
+ *
+ */
+function div(x, y) {
+  return new this(x).div(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} The power to which to raise the base of the natural log.
+ *
+ */
+function exp(x) {
+  return new this(x).exp();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function floor(x) {
+  return finalise(x = new this(x), x.e + 1, 3);
+}
+
+
+/*
+ * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,
+ * rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)
+ *
+ * arguments {number|string|Decimal}
+ *
+ */
+function hypot() {
+  var i, n,
+    t = new this(0);
+
+  external = false;
+
+  for (i = 0; i < arguments.length;) {
+    n = new this(arguments[i++]);
+    if (!n.d) {
+      if (n.s) {
+        external = true;
+        return new this(1 / 0);
+      }
+      t = n;
+    } else if (t.d) {
+      t = t.plus(n.times(n));
+    }
+  }
+
+  external = true;
+
+  return t.sqrt();
+}
+
+
+/*
+ * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),
+ * otherwise return false.
+ *
+ */
+function isDecimalInstance(obj) {
+  return obj instanceof Decimal || obj && obj.toStringTag === tag || false;
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function ln(x) {
+  return new this(x).ln();
+}
+
+
+/*
+ * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base
+ * is specified, rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ * log[y](x)
+ *
+ * x {number|string|Decimal} The argument of the logarithm.
+ * y {number|string|Decimal} The base of the logarithm.
+ *
+ */
+function log(x, y) {
+  return new this(x).log(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function log2(x) {
+  return new this(x).log(2);
+}
+
+
+/*
+ * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function log10(x) {
+  return new this(x).log(10);
+}
+
+
+/*
+ * Return a new Decimal whose value is the maximum of the arguments.
+ *
+ * arguments {number|string|Decimal}
+ *
+ */
+function max() {
+  return maxOrMin(this, arguments, 'lt');
+}
+
+
+/*
+ * Return a new Decimal whose value is the minimum of the arguments.
+ *
+ * arguments {number|string|Decimal}
+ *
+ */
+function min() {
+  return maxOrMin(this, arguments, 'gt');
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits
+ * using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ * y {number|string|Decimal}
+ *
+ */
+function mod(x, y) {
+  return new this(x).mod(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ * y {number|string|Decimal}
+ *
+ */
+function mul(x, y) {
+  return new this(x).mul(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} The base.
+ * y {number|string|Decimal} The exponent.
+ *
+ */
+function pow(x, y) {
+  return new this(x).pow(y);
+}
+
+
+/*
+ * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with
+ * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros
+ * are produced).
+ *
+ * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.
+ *
+ */
+function random(sd) {
+  var d, e, k, n,
+    i = 0,
+    r = new this(1),
+    rd = [];
+
+  if (sd === void 0) sd = this.precision;
+  else checkInt32(sd, 1, MAX_DIGITS);
+
+  k = Math.ceil(sd / LOG_BASE);
+
+  if (!this.crypto) {
+    for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;
+
+  // Browsers supporting crypto.getRandomValues.
+  } else if (crypto.getRandomValues) {
+    d = crypto.getRandomValues(new Uint32Array(k));
+
+    for (; i < k;) {
+      n = d[i];
+
+      // 0 <= n < 4294967296
+      // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).
+      if (n >= 4.29e9) {
+        d[i] = crypto.getRandomValues(new Uint32Array(1))[0];
+      } else {
+
+        // 0 <= n <= 4289999999
+        // 0 <= (n % 1e7) <= 9999999
+        rd[i++] = n % 1e7;
+      }
+    }
+
+  // Node.js supporting crypto.randomBytes.
+  } else if (crypto.randomBytes) {
+
+    // buffer
+    d = crypto.randomBytes(k *= 4);
+
+    for (; i < k;) {
+
+      // 0 <= n < 2147483648
+      n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);
+
+      // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).
+      if (n >= 2.14e9) {
+        crypto.randomBytes(4).copy(d, i);
+      } else {
+
+        // 0 <= n <= 2139999999
+        // 0 <= (n % 1e7) <= 9999999
+        rd.push(n % 1e7);
+        i += 4;
+      }
+    }
+
+    i = k / 4;
+  } else {
+    throw Error(cryptoUnavailable);
+  }
+
+  k = rd[--i];
+  sd %= LOG_BASE;
+
+  // Convert trailing digits to zeros according to sd.
+  if (k && sd) {
+    n = mathpow(10, LOG_BASE - sd);
+    rd[i] = (k / n | 0) * n;
+  }
+
+  // Remove trailing words which are zero.
+  for (; rd[i] === 0; i--) rd.pop();
+
+  // Zero?
+  if (i < 0) {
+    e = 0;
+    rd = [0];
+  } else {
+    e = -1;
+
+    // Remove leading words which are zero and adjust exponent accordingly.
+    for (; rd[0] === 0; e -= LOG_BASE) rd.shift();
+
+    // Count the digits of the first word of rd to determine leading zeros.
+    for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;
+
+    // Adjust the exponent for leading zeros of the first word of rd.
+    if (k < LOG_BASE) e -= LOG_BASE - k;
+  }
+
+  r.e = e;
+  r.d = rd;
+
+  return r;
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.
+ *
+ * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function round(x) {
+  return finalise(x = new this(x), x.e + 1, this.rounding);
+}
+
+
+/*
+ * Return
+ *   1    if x > 0,
+ *  -1    if x < 0,
+ *   0    if x is 0,
+ *  -0    if x is -0,
+ *   NaN  otherwise
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function sign(x) {
+  x = new this(x);
+  return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;
+}
+
+
+/*
+ * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits
+ * using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function sin(x) {
+  return new this(x).sin();
+}
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function sinh(x) {
+  return new this(x).sinh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function sqrt(x) {
+  return new this(x).sqrt();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits
+ * using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal}
+ * y {number|string|Decimal}
+ *
+ */
+function sub(x, y) {
+  return new this(x).sub(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * Only the result is rounded, not the intermediate calculations.
+ *
+ * arguments {number|string|Decimal}
+ *
+ */
+function sum() {
+  var i = 0,
+    args = arguments,
+    x = new this(args[i]);
+
+  external = false;
+  for (; x.s && ++i < args.length;) x = x.plus(args[i]);
+  external = true;
+
+  return finalise(x, this.precision, this.rounding);
+}
+
+
+/*
+ * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function tan(x) {
+  return new this(x).tan();
+}
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|Decimal} A value in radians.
+ *
+ */
+function tanh(x) {
+  return new this(x).tanh();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` truncated to an integer.
+ *
+ * x {number|string|Decimal}
+ *
+ */
+function trunc(x) {
+  return finalise(x = new this(x), x.e + 1, 1);
+}
+
+
+P[Symbol.for('nodejs.util.inspect.custom')] = P.toString;
+P[Symbol.toStringTag] = 'Decimal';
+
+// Create and configure initial Decimal constructor.
+export var Decimal = P.constructor = clone(DEFAULTS);
+
+// Create the internal constants from their string values.
+LN10 = new Decimal(LN10);
+PI = new Decimal(PI);
+
+export default Decimal;
diff --git a/node_modules/decimal.js/package.json b/node_modules/decimal.js/package.json
new file mode 100644
index 0000000..355b18c
--- /dev/null
+++ b/node_modules/decimal.js/package.json
@@ -0,0 +1,40 @@
+{
+  "name": "decimal.js",
+  "description": "An arbitrary-precision Decimal type for JavaScript.",
+  "version": "10.3.1",
+  "keywords": [
+    "arbitrary",
+    "precision",
+    "arithmetic",
+    "big",
+    "number",
+    "decimal",
+    "float",
+    "biginteger",
+    "bigdecimal",
+    "bignumber",
+    "bigint",
+    "bignum"
+  ],
+  "repository" : {
+    "type": "git",
+    "url": "https://github.com/MikeMcl/decimal.js.git"
+  },
+  "main": "decimal",
+  "module": "decimal.mjs",
+  "browser": "decimal.js",
+  "author": {
+    "name": "Michael Mclaughlin",
+    "email": "M8ch88l@gmail.com"
+  },
+  "license": "MIT",
+  "scripts": {
+    "test": "node ./test/test.js"
+  },
+  "types": "decimal.d.ts",
+  "files": [
+    "decimal.js",
+    "decimal.mjs",
+    "decimal.d.ts"
+  ]
+}
diff --git a/node_modules/escape-latex/LICENSE.md b/node_modules/escape-latex/LICENSE.md
new file mode 100644
index 0000000..6e54eff
--- /dev/null
+++ b/node_modules/escape-latex/LICENSE.md
@@ -0,0 +1,18 @@
+Copyright (c) 2012 Dang Mai
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/escape-latex/README.md b/node_modules/escape-latex/README.md
new file mode 100644
index 0000000..78ff9da
--- /dev/null
+++ b/node_modules/escape-latex/README.md
@@ -0,0 +1,75 @@
+# escape-latex
+
+[![Greenkeeper badge](https://badges.greenkeeper.io/dangmai/escape-latex.svg)](https://greenkeeper.io/)
+
+[![Build Status](https://travis-ci.org/dangmai/escape-latex.png)](https://travis-ci.org/dangmai/escape-latex)
+
+Escape LaTeX special characters with Javascript in NodeJS (>= 4.x) environment.
+
+## Usage
+
+```javascript
+npm install escape-latex
+var lescape = require('escape-latex');
+lescape("String to be escaped here #yolo");
+```
+
+## API
+
+```javascript
+lescape((input: String), {
+  preserveFormatting: Boolean,
+  escapeMapFn: Function,
+});
+```
+
+By default,
+`escape-latex` only escapes characters that would result in malformed LaTeX.
+These characters include `# $ % & \ ^ _ { }`.
+
+This means that the final LaTeX output might not look the same as your input Javascript string.
+For example, multiple spaces are kept as-is, which may be truncated to 1 space by your LaTeX software.
+
+If you want the final output string to be as similar to your input Javascript string as possible,
+you can set the `preserveFormatting` param to `true`, like so:
+
+```javascript
+lescape("Hello   World", { preserveFormatting: true });
+// Hello~~~World
+```
+
+Which will be converted to three non-breaking spaces by your LaTeX software.
+
+The list of format characters that are escaped include `space, \t (tab), – (en-dash), — (em-dash)`.
+
+There is also the param `escapeMapFn` to modify the mapping of escaped characters,
+so you can add/modify/remove your own escapes if necessary.
+
+It accepts a callback function that takes in the default character escapes and the formatting escapes as parameters, and returns a complete escape mapping. Here's an example:
+
+```javascript
+lescape("Hello   World", {
+  preseveFormatting: true,
+  escapeMapFn: function(defaultEscapes, formattingEscapes) {
+    formattingEscapes[" "] = "\\\\";
+    return Object.assign({}, defaultEscapes, formattingEscapes);
+  },
+});
+// Hello\\\\\\world
+```
+
+## Testing
+
+```
+npm test
+```
+
+## Notes
+
+* If you are updating from `escape-latex < 1.0.0`,
+  the `en-dash` and `em-dash` are no longer escaped by default.
+  Please use `preserveFormatting` to turn them on if necessary.
+
+## License
+
+MIT
diff --git a/node_modules/escape-latex/dist/index.js b/node_modules/escape-latex/dist/index.js
new file mode 100644
index 0000000..0da9c0d
--- /dev/null
+++ b/node_modules/escape-latex/dist/index.js
@@ -0,0 +1,80 @@
+"use strict";
+
+// Map the characters to escape to their escaped values. The list is derived
+// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters
+
+var _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };
+
+var defaultEscapes = {
+  "{": "\\{",
+  "}": "\\}",
+  "\\": "\\textbackslash{}",
+  "#": "\\#",
+  $: "\\$",
+  "%": "\\%",
+  "&": "\\&",
+  "^": "\\textasciicircum{}",
+  _: "\\_",
+  "~": "\\textasciitilde{}"
+};
+var formatEscapes = {
+  "\u2013": "\\--",
+  "\u2014": "\\---",
+  " ": "~",
+  "\t": "\\qquad{}",
+  "\r\n": "\\newline{}",
+  "\n": "\\newline{}"
+};
+
+var defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {
+  return _extends({}, defaultEscapes, formatEscapes);
+};
+
+/**
+ * Escape a string to be used in LaTeX documents.
+ * @param {string} str the string to be escaped.
+ * @param {boolean} params.preserveFormatting whether formatting escapes should
+ *  be performed (default: false).
+ * @param {function} params.escapeMapFn the function to modify the escape maps.
+ * @return {string} the escaped string, ready to be used in LaTeX.
+ */
+module.exports = function (str) {
+  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
+      _ref$preserveFormatti = _ref.preserveFormatting,
+      preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,
+      _ref$escapeMapFn = _ref.escapeMapFn,
+      escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;
+
+  var runningStr = String(str);
+  var result = "";
+
+  var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});
+  var escapeKeys = Object.keys(escapes); // as it is reused later on
+
+  // Algorithm: Go through the string character by character, if it matches
+  // with one of the special characters then we'll replace it with the escaped
+  // version.
+
+  var _loop = function _loop() {
+    var specialCharFound = false;
+    escapeKeys.forEach(function (key, index) {
+      if (specialCharFound) {
+        return;
+      }
+      if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {
+        result += escapes[escapeKeys[index]];
+        runningStr = runningStr.slice(key.length, runningStr.length);
+        specialCharFound = true;
+      }
+    });
+    if (!specialCharFound) {
+      result += runningStr.slice(0, 1);
+      runningStr = runningStr.slice(1, runningStr.length);
+    }
+  };
+
+  while (runningStr) {
+    _loop();
+  }
+  return result;
+};
\ No newline at end of file
diff --git a/node_modules/escape-latex/package.json b/node_modules/escape-latex/package.json
new file mode 100644
index 0000000..a57945d
--- /dev/null
+++ b/node_modules/escape-latex/package.json
@@ -0,0 +1,55 @@
+{
+  "name": "escape-latex",
+  "version": "1.2.0",
+  "description": "Escape LaTeX special characters with Javascript",
+  "main": "./dist/index.js",
+  "files": ["dist"],
+  "scripts": {
+    "test": "mocha --require babel-core/register -u tdd ./src/**/*.test.js",
+    "preversion": "npm test && npm run build",
+    "postversion": "git push && git push --tags",
+    "precommit": "npm run lint && lint-staged",
+    "prettier": "prettier --write ./src/**/*.js",
+    "lint": "eslint ./src",
+    "init": "mkdir dist",
+    "clean": "rm -rf dist",
+    "prebuild": "npm run clean && npm run init",
+    "build": "babel ./src -d ./dist --ignore index.test.js"
+  },
+  "lint-staged": {
+    "*.{js,json,css,md}": ["npm run prettier", "git add"]
+  },
+  "eslintConfig": {
+    "parserOptions": {
+      "ecmaVersion": 8
+    },
+    "extends": ["eslint:recommended", "google", "prettier"],
+    "env": {
+      "node": "true"
+    }
+  },
+  "prettier": {
+    "trailingComma": "all"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/dangmai/escape-latex"
+  },
+  "keywords": ["latex", "escape"],
+  "devDependencies": {
+    "babel-cli": "^6.26.0",
+    "babel-core": "^6.26.0",
+    "babel-plugin-transform-object-assign": "^6.22.0",
+    "babel-preset-env": "^1.6.1",
+    "chai": "^4.1.2",
+    "eslint": "^5.0.1",
+    "eslint-config-google": "^0.9.1",
+    "eslint-config-prettier": "^3.0.1",
+    "husky": "^0.14.3",
+    "lint-staged": "^7.0.5",
+    "mocha": "^5.0.0",
+    "prettier": "^1.9.2"
+  },
+  "author": "Dang Mai",
+  "license": "MIT"
+}
diff --git a/node_modules/fraction.js/LICENSE b/node_modules/fraction.js/LICENSE
new file mode 100644
index 0000000..49057d3
--- /dev/null
+++ b/node_modules/fraction.js/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 Robert Eisele
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/fraction.js/README.md b/node_modules/fraction.js/README.md
new file mode 100644
index 0000000..8ae1963
--- /dev/null
+++ b/node_modules/fraction.js/README.md
@@ -0,0 +1,492 @@
+# Fraction.js - ℚ in JavaScript
+
+[![NPM Package](https://nodei.co/npm-dl/fraction.js.png?months=6&height=1)](https://npmjs.org/package/fraction.js)
+
+[![Build Status](https://travis-ci.org/infusion/Fraction.js.svg?branch=master)](https://travis-ci.org/infusion/Fraction.js)
+[![MIT license](http://img.shields.io/badge/license-MIT-brightgreen.svg)](http://opensource.org/licenses/MIT)
+
+
+Tired of inprecise numbers represented by doubles, which have to store rational and irrational numbers like PI or sqrt(2) the same way? Obviously the following problem is preventable:
+
+```javascript
+1 / 98 * 98 // = 0.9999999999999999
+```
+
+If you need more precision or just want a fraction as a result, have a look at *Fraction.js*:
+
+```javascript
+var Fraction = require('fraction.js');
+
+Fraction(1).div(98).mul(98) // = 1
+```
+
+Internally, numbers are represented as *numerator / denominator*, which adds just a little overhead. However, the library is written with performance in mind and outperforms any other implementation, as you can see [here](http://jsperf.com/convert-a-rational-number-to-a-babylonian-fractions/28). This basic data-type makes it the perfect basis for [Polynomial.js](https://github.com/infusion/Polynomial.js) and [Math.js](https://github.com/josdejong/mathjs).
+
+Convert decimal to fraction
+===
+The simplest job for fraction.js is to get a fraction out of a decimal:
+```javascript
+var x = new Fraction(1.88);
+var res = x.toFraction(true); // String "1 22/25"
+```
+
+Examples / Motivation
+===
+A simple example might be
+
+```javascript
+var f = new Fraction("9.4'31'"); // 9.4313131313131...
+f.mul([-4, 3]).mod("4.'8'"); // 4.88888888888888...
+```
+The result is
+
+```javascript
+console.log(f.toFraction()); // -4154 / 1485
+```
+You could of course also access the sign (s), numerator (n) and denominator (d) on your own:
+```javascript
+f.s * f.n / f.d = -1 * 4154 / 1485 = -2.797306...
+```
+
+If you would try to calculate it yourself, you would come up with something like:
+
+```javascript
+(9.4313131 * (-4 / 3)) % 4.888888 = -2.797308133...
+```
+
+Quite okay, but yea - not as accurate as it could be.
+
+
+Laplace Probability
+===
+Simple example. What's the probability of throwing a 3, and 1 or 4, and 2 or 4 or 6 with a fair dice?
+
+P({3}):
+```javascript
+var p = new Fraction([3].length, 6).toString(); // 0.1(6)
+```
+
+P({1, 4}):
+```javascript
+var p = new Fraction([1, 4].length, 6).toString(); // 0.(3)
+```
+
+P({2, 4, 6}):
+```javascript
+var p = new Fraction([2, 4, 6].length, 6).toString(); // 0.5
+```
+
+Convert degrees/minutes/seconds to precise rational representation:
+===
+
+57+45/60+17/3600
+```javascript
+var deg = 57; // 57°
+var min = 45; // 45 Minutes
+var sec = 17; // 17 Seconds
+
+new Fraction(deg).add(min, 60).add(sec, 3600).toString() // -> 57.7547(2)
+```
+
+Rounding a fraction to the closest tape measure value
+=== 
+
+A tape measure is usually divided in parts of `1/16`. Rounding a given fraction to the closest value on a tape measure can be determined by
+
+```javascript
+function closestTapeMeasure(frac) {
+
+    /*
+    k/16 ≤ a/b < (k+1)/16
+    ⇔ k ≤ 16*a/b < (k+1)
+    ⇔ k = floor(16*a/b)
+    */
+    return new Fraction(Math.round(16 * Fraction(frac).valueOf()), 16);
+}
+// closestTapeMeasure("1/3") // 5/16
+```
+
+Rational approximation of irrational numbers
+===
+
+Now it's getting messy ;d To approximate a number like *sqrt(5) - 2* with a numerator and denominator, you can reformat the equation as follows: *pow(n / d + 2, 2) = 5*.
+
+Then the following algorithm will generate the rational number besides the binary representation.
+
+```javascript
+var x = "/", s = "";
+
+var a = new Fraction(0),
+    b = new Fraction(1);
+for (var n = 0; n <= 10; n++) {
+
+  var c = a.add(b).div(2);
+
+  console.log(n + "\t" + a + "\t" + b + "\t" + c + "\t" + x);
+
+  if (c.add(2).pow(2) < 5) {
+    a = c;
+    x = "1";
+  } else {
+    b = c;
+    x = "0";
+  }
+  s+= x;
+}
+console.log(s)
+```
+
+The result is
+
+```
+n   a[n]        b[n]        c[n]            x[n]
+0   0/1         1/1         1/2             /
+1   0/1         1/2         1/4             0
+2   0/1         1/4         1/8             0
+3   1/8         1/4         3/16            1
+4   3/16        1/4         7/32            1
+5   7/32        1/4         15/64           1
+6   15/64       1/4         31/128          1
+7   15/64       31/128      61/256          0
+8   15/64       61/256      121/512         0
+9   15/64       121/512     241/1024        0
+10  241/1024    121/512     483/2048        1
+```
+Thus the approximation after 11 iterations of the bisection method is *483 / 2048* and the binary representation is 0.00111100011 (see [WolframAlpha](http://www.wolframalpha.com/input/?i=sqrt%285%29-2+binary))
+
+
+I published another example on how to approximate PI with fraction.js on my [blog](http://www.xarg.org/2014/03/precise-calculations-in-javascript/) (Still not the best idea to approximate irrational numbers, but it illustrates the capabilities of Fraction.js perfectly).
+
+
+Get the exact fractional part of a number
+---
+```javascript
+var f = new Fraction("-6.(3416)");
+console.log("" + f.mod(1).abs()); // Will print 0.(3416)
+```
+
+Mathematical correct modulo
+---
+The behaviour on negative congruences is different to most modulo implementations in computer science. Even the *mod()* function of Fraction.js behaves in the typical way. To solve the problem of having the mathematical correct modulo with Fraction.js you could come up with this:
+
+```javascript
+var a = -1;
+var b = 10.99;
+
+console.log(new Fraction(a)
+  .mod(b)); // Not correct, usual Modulo
+
+console.log(new Fraction(a)
+  .mod(b).add(b).mod(b)); // Correct! Mathematical Modulo
+```
+
+fmod() impreciseness circumvented
+---
+It turns out that Fraction.js outperforms almost any fmod() implementation, including JavaScript itself, [php.js](http://phpjs.org/functions/fmod/), C++, Python, Java and even Wolframalpha due to the fact that numbers like 0.05, 0.1, ... are infinite decimal in base 2.
+
+The equation *fmod(4.55, 0.05)* gives *0.04999999999999957*, wolframalpha says *1/20*. The correct answer should be **zero**, as 0.05 divides 4.55 without any remainder.
+
+
+Parser
+===
+
+Any function (see below) as well as the constructor of the *Fraction* class parses its input and reduce it to the smallest term.
+
+You can pass either Arrays, Objects, Integers, Doubles or Strings.
+
+Arrays / Objects
+---
+```javascript
+new Fraction(numerator, denominator);
+new Fraction([numerator, denominator]);
+new Fraction({n: numerator, d: denominator});
+```
+
+Integers
+---
+```javascript
+new Fraction(123);
+```
+
+Doubles
+---
+```javascript
+new Fraction(55.4);
+```
+
+**Note:** If you pass a double as it is, Fraction.js will perform a number analysis based on Farey Sequences. If you concern performance, cache Fraction.js objects and pass arrays/objects.
+
+The method is really precise, but too large exact numbers, like 1234567.9991829 will result in a wrong approximation. If you want to keep the number as it is, convert it to a string, as the string parser will not perform any further observations. If you have problems with the approximation, in the file `examples/approx.js` is a different approximation algorithm, which might work better in some more specific use-cases.
+
+
+Strings
+---
+```javascript
+new Fraction("123.45");
+new Fraction("123/45"); // A rational number represented as two decimals, separated by a slash
+new Fraction("123:45"); // A rational number represented as two decimals, separated by a colon
+new Fraction("4 123/45"); // A rational number represented as a whole number and a fraction
+new Fraction("123.'456'"); // Note the quotes, see below!
+new Fraction("123.(456)"); // Note the brackets, see below!
+new Fraction("123.45'6'"); // Note the quotes, see below!
+new Fraction("123.45(6)"); // Note the brackets, see below!
+```
+
+Two arguments
+---
+```javascript
+new Fraction(3, 2); // 3/2 = 1.5
+```
+
+Repeating decimal places
+---
+*Fraction.js* can easily handle repeating decimal places. For example *1/3* is *0.3333...*. There is only one repeating digit. As you can see in the examples above, you can pass a number like *1/3* as "0.'3'" or "0.(3)", which are synonym. There are no tests to parse something like 0.166666666 to 1/6! If you really want to handle this number, wrap around brackets on your own with the function below for example: 0.1(66666666)
+
+Assume you want to divide 123.32 / 33.6(567). [WolframAlpha](http://www.wolframalpha.com/input/?i=123.32+%2F+%2812453%2F370%29) states that you'll get a period of 1776 digits. *Fraction.js* comes to the same result. Give it a try:
+
+```javascript
+var f = new Fraction("123.32");
+console.log("Bam: " + f.div("33.6(567)"));
+```
+
+To automatically make a number like "0.123123123" to something more Fraction.js friendly like "0.(123)", I hacked this little brute force algorithm in a 10 minutes. Improvements are welcome...
+
+```javascript
+function formatDecimal(str) {
+
+  var comma, pre, offset, pad, times, repeat;
+
+  if (-1 === (comma = str.indexOf(".")))
+    return str;
+
+  pre = str.substr(0, comma + 1);
+  str = str.substr(comma + 1);
+
+  for (var i = 0; i < str.length; i++) {
+
+    offset = str.substr(0, i);
+
+    for (var j = 0; j < 5; j++) {
+
+      pad = str.substr(i, j + 1);
+
+      times = Math.ceil((str.length - offset.length) / pad.length);
+
+      repeat = new Array(times + 1).join(pad); // Silly String.repeat hack
+
+      if (0 === (offset + repeat).indexOf(str)) {
+        return pre + offset + "(" + pad + ")";
+      }
+    }
+  }
+  return null;
+}
+
+var f, x = formatDecimal("13.0123123123"); // = 13.0(123)
+if (x !== null) {
+  f = new Fraction(x);
+}
+```
+
+Attributes
+===
+
+The Fraction object allows direct access to the numerator, denominator and sign attributes. It is ensured that only the sign-attribute holds sign information so that a sign comparison is only necessary against this attribute.
+
+```javascript
+var f = new Fraction('-1/2');
+console.log(f.n); // Numerator: 1
+console.log(f.d); // Denominator: 2
+console.log(f.s); // Sign: -1
+```
+
+
+Functions
+===
+
+Fraction abs()
+---
+Returns the actual number without any sign information
+
+Fraction neg()
+---
+Returns the actual number with flipped sign in order to get the additive inverse
+
+Fraction add(n)
+---
+Returns the sum of the actual number and the parameter n
+
+Fraction sub(n)
+---
+Returns the difference of the actual number and the parameter n
+
+Fraction mul(n)
+---
+Returns the product of the actual number and the parameter n
+
+Fraction div(n)
+---
+Returns the quotient of the actual number and the parameter n
+
+Fraction pow(exp)
+---
+Returns the power of the actual number, raised to an possible rational exponent. If the result becomes non-rational the function returns `null`.
+
+Fraction mod(n)
+---
+Returns the modulus (rest of the division) of the actual object and n (this % n). It's a much more precise [fmod()](#fmod-impreciseness-circumvented) if you will. Please note that *mod()* is just like the modulo operator of most programming languages. If you want a mathematical correct modulo, see [here](#mathematical-correct-modulo).
+
+Fraction mod()
+---
+Returns the modulus (rest of the division) of the actual object (numerator mod denominator)
+
+Fraction gcd(n)
+---
+Returns the fractional greatest common divisor
+
+Fraction lcm(n)
+---
+Returns the fractional least common multiple
+
+Fraction ceil([places=0-16])
+---
+Returns the ceiling of a rational number with Math.ceil
+
+Fraction floor([places=0-16])
+---
+Returns the floor of a rational number with Math.floor
+
+Fraction round([places=0-16])
+---
+Returns the rational number rounded with Math.round
+
+Fraction inverse()
+---
+Returns the multiplicative inverse of the actual number (n / d becomes d / n) in order to get the reciprocal
+
+Fraction simplify([eps=0.001])
+---
+Simplifies the rational number under a certain error threshold. Ex. `0.333` will be `1/3` with `eps=0.001`
+
+boolean equals(n)
+---
+Check if two numbers are equal
+
+int compare(n)
+---
+Compare two numbers.
+```
+result < 0: n is greater than actual number
+result > 0: n is smaller than actual number
+result = 0: n is equal to the actual number
+```
+
+boolean divisible(n)
+---
+Check if two numbers are divisible (n divides this)
+
+double valueOf()
+---
+Returns a decimal representation of the fraction
+
+String toString([decimalPlaces=15])
+---
+Generates an exact string representation of the actual object. For repeated decimal places all digits are collected within brackets, like `1/3 = "0.(3)"`. For all other numbers, up to `decimalPlaces` significant digits are collected - which includes trailing zeros if the number is getting truncated. However, `1/2 = "0.5"` without trailing zeros of course.
+
+**Note:** As `valueOf()` and `toString()` are provided, `toString()` is only called implicitly in a real string context. Using the plus-operator like `"123" + new Fraction` will call valueOf(), because JavaScript tries to combine two primitives first and concatenates them later, as string will be the more dominant type. `alert(new Fraction)` or `String(new Fraction)` on the other hand will do what you expect. If you really want to have control, you should call `toString()` or `valueOf()` explicitly!
+
+String toLatex(excludeWhole=false)
+---
+Generates an exact LaTeX representation of the actual object. You can see a [live demo](http://www.xarg.org/2014/03/precise-calculations-in-javascript/) on my blog.
+
+The optional boolean parameter indicates if you want to exclude the whole part. "1 1/3" instead of "4/3"
+
+String toFraction(excludeWhole=false)
+---
+Gets a string representation of the fraction
+
+The optional boolean parameter indicates if you want to exclude the whole part. "1 1/3" instead of "4/3"
+
+Array toContinued()
+---
+Gets an array of the fraction represented as a continued fraction. The first element always contains the whole part.
+
+```javascript
+var f = new Fraction('88/33');
+var c = f.toContinued(); // [2, 1, 2]
+```
+
+Fraction clone()
+---
+Creates a copy of the actual Fraction object
+
+
+Exceptions
+===
+If a really hard error occurs (parsing error, division by zero), *fraction.js* throws exceptions! Please make sure you handle them correctly.
+
+
+
+Installation
+===
+Installing fraction.js is as easy as cloning this repo or use one of the following commands:
+
+```
+bower install fraction.js
+```
+or
+
+```
+npm install fraction.js
+```
+
+Using Fraction.js with the browser
+===
+```html
+<script src="fraction.js"></script>
+<script>
+    console.log(Fraction("123/456"));
+</script>
+```
+
+Using Fraction.js with require.js
+===
+```html
+<script src="require.js"></script>
+<script>
+requirejs(['fraction.js'],
+function(Fraction) {
+    console.log(Fraction("123/456"));
+});
+</script>
+```
+
+Using Fraction.js with TypeScript
+===
+```js
+import Fraction from "fraction.js";
+console.log(Fraction("123/456"));
+```
+
+Coding Style
+===
+As every library I publish, fraction.js is also built to be as small as possible after compressing it with Google Closure Compiler in advanced mode. Thus the coding style orientates a little on maxing-out the compression rate. Please make sure you keep this style if you plan to extend the library.
+
+
+Precision
+===
+Fraction.js tries to circumvent floating point errors, by having an internal representation of numerator and denominator. As it relies on JavaScript, there is also a limit. The biggest number representable is `Number.MAX_SAFE_INTEGER / 1` and the smallest is `-1 / Number.MAX_SAFE_INTEGER`, with `Number.MAX_SAFE_INTEGER=9007199254740991`. If this is not enough, there is `bigfraction.js` shipped experimentally, which relies on `BigInt` and should become the new Fraction.js eventually. 
+
+Testing
+===
+If you plan to enhance the library, make sure you add test cases and all the previous tests are passing. You can test the library with
+
+```
+npm test
+```
+
+
+Copyright and licensing
+===
+Copyright (c) 2014-2019, [Robert Eisele](https://www.xarg.org/)
+Dual licensed under the MIT or GPL Version 2 licenses.
diff --git a/node_modules/fraction.js/bigfraction.js b/node_modules/fraction.js/bigfraction.js
new file mode 100644
index 0000000..2e504d7
--- /dev/null
+++ b/node_modules/fraction.js/bigfraction.js
@@ -0,0 +1,895 @@
+/**
+ * @license Fraction.js v4.2.0 23/05/2021
+ * https://www.xarg.org/2014/03/rational-numbers-in-javascript/
+ *
+ * Copyright (c) 2021, Robert Eisele (robert@xarg.org)
+ * Dual licensed under the MIT or GPL Version 2 licenses.
+ **/
+
+
+/**
+ *
+ * This class offers the possibility to calculate fractions.
+ * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
+ *
+ * Array/Object form
+ * [ 0 => <nominator>, 1 => <denominator> ]
+ * [ n => <nominator>, d => <denominator> ]
+ *
+ * Integer form
+ * - Single integer value
+ *
+ * Double form
+ * - Single double value
+ *
+ * String form
+ * 123.456 - a simple double
+ * 123/456 - a string fraction
+ * 123.'456' - a double with repeating decimal places
+ * 123.(456) - synonym
+ * 123.45'6' - a double with repeating last place
+ * 123.45(6) - synonym
+ *
+ * Example:
+ *
+ * let f = new Fraction("9.4'31'");
+ * f.mul([-4, 3]).div(4.9);
+ *
+ */
+
+(function(root) {
+
+  "use strict";
+
+  // Set Identity function to downgrade BigInt to Number if needed
+  if (!BigInt) BigInt = function(n) { if (isNaN(n)) throw new Error(""); return n; };
+
+  const C_ONE = BigInt(1);
+  const C_ZERO = BigInt(0);
+  const C_TEN = BigInt(10);
+  const C_TWO = BigInt(2);
+  const C_FIVE = BigInt(5);
+
+  // Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
+  // Example: 1/7 = 0.(142857) has 6 repeating decimal places.
+  // If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
+  const MAX_CYCLE_LEN = 2000;
+
+  // Parsed data to avoid calling "new" all the time
+  const P = {
+    "s": C_ONE,
+    "n": C_ZERO,
+    "d": C_ONE
+  };
+
+  function assign(n, s) {
+
+    try {
+      n = BigInt(n);
+    } catch (e) {
+      throw Fraction['InvalidParameter'];
+    }
+    return n * s;
+  }
+
+  // Creates a new Fraction internally without the need of the bulky constructor
+  function newFraction(n, d) {
+
+    if (d === C_ZERO) {
+      throw Fraction['DivisionByZero'];
+    }
+
+    const f = Object.create(Fraction.prototype);
+    f["s"] = n < C_ZERO ? -C_ONE : C_ONE;
+
+    n = n < C_ZERO ? -n : n;
+
+    const a = gcd(n, d);
+
+    f["n"] = n / a;
+    f["d"] = d / a;
+    return f;
+  }
+
+  function factorize(num) {
+
+    const factors = {};
+
+    let n = num;
+    let i = C_TWO;
+    let s = C_FIVE - C_ONE;
+
+    while (s <= n) {
+
+      while (n % i === C_ZERO) {
+        n/= i;
+        factors[i] = (factors[i] || C_ZERO) + C_ONE;
+      }
+      s+= C_ONE + C_TWO * i++;
+    }
+
+    if (n !== num) {
+      if (n > 1)
+        factors[n] = (factors[n] || C_ZERO) + C_ONE;
+    } else {
+      factors[num] = (factors[num] || C_ZERO) + C_ONE;
+    }
+    return factors;
+  }
+
+  const parse = function(p1, p2) {
+
+    let n = C_ZERO, d = C_ONE, s = C_ONE;
+
+    if (p1 === undefined || p1 === null) {
+      /* void */
+    } else if (p2 !== undefined) {
+      n = BigInt(p1);
+      d = BigInt(p2);
+      s = n * d;
+
+      if (n % C_ONE !== C_ZERO || d % C_ONE !== C_ZERO) {
+        throw Fraction['NonIntegerParameter'];
+      }
+
+    } else if (typeof p1 === "object") {
+      if ("d" in p1 && "n" in p1) {
+        n = BigInt(p1["n"]);
+        d = BigInt(p1["d"]);
+        if ("s" in p1)
+          n*= BigInt(p1["s"]);
+      } else if (0 in p1) {
+        n = BigInt(p1[0]);
+        if (1 in p1)
+          d = BigInt(p1[1]);
+      } else if (p1 instanceof BigInt) {
+        n = BigInt(p1);
+      } else {
+        throw Fraction['InvalidParameter'];
+      }
+      s = n * d;
+    } else if (typeof p1 === "bigint") {
+      n = p1;
+      s = p1;
+      d = BigInt(1);
+    } else if (typeof p1 === "number") {
+
+      if (isNaN(p1)) {
+        throw Fraction['InvalidParameter'];
+      }
+
+      if (p1 < 0) {
+        s = -C_ONE;
+        p1 = -p1;
+      }
+
+      if (p1 % 1 === 0) {
+        n = BigInt(p1);
+      } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow
+
+        let z = 1;
+
+        let A = 0, B = 1;
+        let C = 1, D = 1;
+
+        let N = 10000000;
+
+        if (p1 >= 1) {
+          z = 10 ** Math.floor(1 + Math.log10(p1));
+          p1/= z;
+        }
+
+        // Using Farey Sequences
+
+        while (B <= N && D <= N) {
+          let M = (A + C) / (B + D);
+
+          if (p1 === M) {
+            if (B + D <= N) {
+              n = A + C;
+              d = B + D;
+            } else if (D > B) {
+              n = C;
+              d = D;
+            } else {
+              n = A;
+              d = B;
+            }
+            break;
+
+          } else {
+
+            if (p1 > M) {
+              A+= C;
+              B+= D;
+            } else {
+              C+= A;
+              D+= B;
+            }
+
+            if (B > N) {
+              n = C;
+              d = D;
+            } else {
+              n = A;
+              d = B;
+            }
+          }
+        }
+        n = BigInt(n) * BigInt(z);
+        d = BigInt(d);
+
+      }
+
+    } else if (typeof p1 === "string") {
+
+      let ndx = 0;
+
+      let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;
+
+      let match = p1.match(/\d+|./g);
+
+      if (match === null)
+        throw Fraction['InvalidParameter'];
+
+      if (match[ndx] === '-') {// Check for minus sign at the beginning
+        s = -C_ONE;
+        ndx++;
+      } else if (match[ndx] === '+') {// Check for plus sign at the beginning
+        ndx++;
+      }
+
+      if (match.length === ndx + 1) { // Check if it's just a simple number "1234"
+        w = assign(match[ndx++], s);
+      } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number
+
+        if (match[ndx] !== '.') { // Handle 0.5 and .5
+          v = assign(match[ndx++], s);
+        }
+        ndx++;
+
+        // Check for decimal places
+        if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === "'" && match[ndx + 3] === "'") {
+          w = assign(match[ndx], s);
+          y = C_TEN ** BigInt(match[ndx].length);
+          ndx++;
+        }
+
+        // Check for repeating places
+        if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === "'" && match[ndx + 2] === "'") {
+          x = assign(match[ndx + 1], s);
+          z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;
+          ndx+= 3;
+        }
+
+      } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
+        w = assign(match[ndx], s);
+        y = assign(match[ndx + 2], C_ONE);
+        ndx+= 3;
+      } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction "123 1/2"
+        v = assign(match[ndx], s);
+        w = assign(match[ndx + 2], s);
+        y = assign(match[ndx + 4], C_ONE);
+        ndx+= 5;
+      }
+
+      if (match.length <= ndx) { // Check for more tokens on the stack
+        d = y * z;
+        s = /* void */
+        n = x + d * v + z * w;
+      } else {
+        throw Fraction['InvalidParameter'];
+      }
+
+    } else {
+      throw Fraction['InvalidParameter'];
+    }
+
+    if (d === C_ZERO) {
+      throw Fraction['DivisionByZero'];
+    }
+
+    P["s"] = s < C_ZERO ? -C_ONE : C_ONE;
+    P["n"] = n < C_ZERO ? -n : n;
+    P["d"] = d < C_ZERO ? -d : d;
+  };
+
+  function modpow(b, e, m) {
+
+    let r = C_ONE;
+    for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {
+
+      if (e & C_ONE) {
+        r = (r * b) % m;
+      }
+    }
+    return r;
+  }
+
+  function cycleLen(n, d) {
+
+    for (; d % C_TWO === C_ZERO;
+      d/= C_TWO) {
+    }
+
+    for (; d % C_FIVE === C_ZERO;
+      d/= C_FIVE) {
+    }
+
+    if (d === C_ONE) // Catch non-cyclic numbers
+      return C_ZERO;
+
+    // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
+    // 10^(d-1) % d == 1
+    // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
+    // as we want to translate the numbers to strings.
+
+    let rem = C_TEN % d;
+    let t = 1;
+
+    for (; rem !== C_ONE; t++) {
+      rem = rem * C_TEN % d;
+
+      if (t > MAX_CYCLE_LEN)
+        return C_ZERO; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
+    }
+    return BigInt(t);
+  }
+
+  function cycleStart(n, d, len) {
+
+    let rem1 = C_ONE;
+    let rem2 = modpow(C_TEN, len, d);
+
+    for (let t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
+      // Solve 10^s == 10^(s+t) (mod d)
+
+      if (rem1 === rem2)
+        return BigInt(t);
+
+      rem1 = rem1 * C_TEN % d;
+      rem2 = rem2 * C_TEN % d;
+    }
+    return 0;
+  }
+
+  function gcd(a, b) {
+
+    if (!a)
+      return b;
+    if (!b)
+      return a;
+
+    while (1) {
+      a%= b;
+      if (!a)
+        return b;
+      b%= a;
+      if (!b)
+        return a;
+    }
+  }
+
+  /**
+   * Module constructor
+   *
+   * @constructor
+   * @param {number|Fraction=} a
+   * @param {number=} b
+   */
+  function Fraction(a, b) {
+
+    parse(a, b);
+
+    if (this instanceof Fraction) {
+      a = gcd(P["d"], P["n"]); // Abuse a
+      this["s"] = P["s"];
+      this["n"] = P["n"] / a;
+      this["d"] = P["d"] / a;
+    } else {
+      return newFraction(P['s'] * P['n'], P['d']);
+    }
+  }
+
+  Fraction['DivisionByZero'] = new Error("Division by Zero");
+  Fraction['InvalidParameter'] = new Error("Invalid argument");
+  Fraction['NonIntegerParameter'] = new Error("Parameters must be integer");
+
+  Fraction.prototype = {
+
+    "s": C_ONE,
+    "n": C_ZERO,
+    "d": C_ONE,
+
+    /**
+     * Calculates the absolute value
+     *
+     * Ex: new Fraction(-4).abs() => 4
+     **/
+    "abs": function() {
+
+      return newFraction(this["n"], this["d"]);
+    },
+
+    /**
+     * Inverts the sign of the current fraction
+     *
+     * Ex: new Fraction(-4).neg() => 4
+     **/
+    "neg": function() {
+
+      return newFraction(-this["s"] * this["n"], this["d"]);
+    },
+
+    /**
+     * Adds two rational numbers
+     *
+     * Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
+     **/
+    "add": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * this["n"] * P["d"] + P["s"] * this["d"] * P["n"],
+        this["d"] * P["d"]
+      );
+    },
+
+    /**
+     * Subtracts two rational numbers
+     *
+     * Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
+     **/
+    "sub": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * this["n"] * P["d"] - P["s"] * this["d"] * P["n"],
+        this["d"] * P["d"]
+      );
+    },
+
+    /**
+     * Multiplies two rational numbers
+     *
+     * Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
+     **/
+    "mul": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * P["s"] * this["n"] * P["n"],
+        this["d"] * P["d"]
+      );
+    },
+
+    /**
+     * Divides two rational numbers
+     *
+     * Ex: new Fraction("-17.(345)").inverse().div(3)
+     **/
+    "div": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * P["s"] * this["n"] * P["d"],
+        this["d"] * P["n"]
+      );
+    },
+
+    /**
+     * Clones the actual object
+     *
+     * Ex: new Fraction("-17.(345)").clone()
+     **/
+    "clone": function() {
+      return newFraction(this['s'] * this['n'], this['d']);
+    },
+
+    /**
+     * Calculates the modulo of two rational numbers - a more precise fmod
+     *
+     * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
+     **/
+    "mod": function(a, b) {
+
+      if (a === undefined) {
+        return newFraction(this["s"] * this["n"] % this["d"], C_ONE);
+      }
+
+      parse(a, b);
+      if (0 === P["n"] && 0 === this["d"]) {
+        throw Fraction['DivisionByZero'];
+      }
+
+      /*
+       * First silly attempt, kinda slow
+       *
+       return that["sub"]({
+       "n": num["n"] * Math.floor((this.n / this.d) / (num.n / num.d)),
+       "d": num["d"],
+       "s": this["s"]
+       });*/
+
+      /*
+       * New attempt: a1 / b1 = a2 / b2 * q + r
+       * => b2 * a1 = a2 * b1 * q + b1 * b2 * r
+       * => (b2 * a1 % a2 * b1) / (b1 * b2)
+       */
+      return newFraction(
+        this["s"] * (P["d"] * this["n"]) % (P["n"] * this["d"]),
+        P["d"] * this["d"]
+      );
+    },
+
+    /**
+     * Calculates the fractional gcd of two rational numbers
+     *
+     * Ex: new Fraction(5,8).gcd(3,7) => 1/56
+     */
+    "gcd": function(a, b) {
+
+      parse(a, b);
+
+      // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
+
+      return newFraction(gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]), P["d"] * this["d"]);
+    },
+
+    /**
+     * Calculates the fractional lcm of two rational numbers
+     *
+     * Ex: new Fraction(5,8).lcm(3,7) => 15
+     */
+    "lcm": function(a, b) {
+
+      parse(a, b);
+
+      // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
+
+      if (P["n"] === C_ZERO && this["n"] === C_ZERO) {
+        return newFraction(C_ZERO, C_ONE);
+      }
+      return newFraction(P["n"] * this["n"], gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]));
+    },
+
+    /**
+     * Gets the inverse of the fraction, means numerator and denominator are exchanged
+     *
+     * Ex: new Fraction([-3, 4]).inverse() => -4 / 3
+     **/
+    "inverse": function() {
+      return newFraction(this["s"] * this["d"], this["n"]);
+    },
+
+    /**
+     * Calculates the fraction to some integer exponent
+     *
+     * Ex: new Fraction(-1,2).pow(-3) => -8
+     */
+    "pow": function(a, b) {
+
+      parse(a, b);
+
+      // Trivial case when exp is an integer
+
+      if (P['d'] === C_ONE) {
+
+        if (P['s'] < C_ZERO) {
+          return newFraction((this['s'] * this["d"]) ** P['n'], this["n"] ** P['n']);
+        } else {
+          return newFraction((this['s'] * this["n"]) ** P['n'], this["d"] ** P['n']);
+        }
+      }
+
+      // Negative roots become complex
+      //     (-a/b)^(c/d) = x
+      // <=> (-1)^(c/d) * (a/b)^(c/d) = x
+      // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x
+      // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula
+      // From which follows that only for c=0 the root is non-complex
+      if (this['s'] < C_ZERO) return null;
+
+      // Now prime factor n and d
+      let N = factorize(this['n']);
+      let D = factorize(this['d']);
+
+      // Exponentiate and take root for n and d individually
+      let n = C_ONE;
+      let d = C_ONE;
+      for (let k in N) {
+        if (k === '1') continue;
+        if (k === '0') {
+          n = C_ZERO;
+          break;
+        }
+        N[k]*= P['n'];
+
+        if (N[k] % P['d'] === C_ZERO) {
+          N[k]/= P['d'];
+        } else return null;
+        n*= BigInt(k) ** N[k];
+      }
+
+      for (let k in D) {
+        if (k === '1') continue;
+        D[k]*= P['n'];
+
+        if (D[k] % P['d'] === C_ZERO) {
+          D[k]/= P['d'];
+        } else return null;
+        d*= BigInt(k) ** D[k];
+      }
+
+      if (P['s'] < C_ZERO) {
+        return newFraction(d, n);
+      }
+      return newFraction(n, d);
+    },
+
+    /**
+     * Check if two rational numbers are the same
+     *
+     * Ex: new Fraction(19.6).equals([98, 5]);
+     **/
+    "equals": function(a, b) {
+
+      parse(a, b);
+      return this["s"] * this["n"] * P["d"] === P["s"] * P["n"] * this["d"]; // Same as compare() === 0
+    },
+
+    /**
+     * Check if two rational numbers are the same
+     *
+     * Ex: new Fraction(19.6).equals([98, 5]);
+     **/
+    "compare": function(a, b) {
+
+      parse(a, b);
+      let t = (this["s"] * this["n"] * P["d"] - P["s"] * P["n"] * this["d"]);
+
+      return (C_ZERO < t) - (t < C_ZERO);
+    },
+
+    /**
+     * Calculates the ceil of a rational number
+     *
+     * Ex: new Fraction('4.(3)').ceil() => (5 / 1)
+     **/
+    "ceil": function(places) {
+
+      places = C_TEN ** BigInt(places || 0);
+
+      return newFraction(this["s"] * places * this["n"] / this["d"] +
+        (places * this["n"] % this["d"] > C_ZERO && this["s"] >= C_ZERO ? C_ONE : C_ZERO),
+        places);
+    },
+
+    /**
+     * Calculates the floor of a rational number
+     *
+     * Ex: new Fraction('4.(3)').floor() => (4 / 1)
+     **/
+    "floor": function(places) {
+
+      places = C_TEN ** BigInt(places || 0);
+
+      return newFraction(this["s"] * places * this["n"] / this["d"] -
+        (places * this["n"] % this["d"] > C_ZERO && this["s"] < C_ZERO ? C_ONE : C_ZERO),
+        places);
+    },
+
+    /**
+     * Rounds a rational numbers
+     *
+     * Ex: new Fraction('4.(3)').round() => (4 / 1)
+     **/
+    "round": function(places) {
+
+      places = C_TEN ** BigInt(places || 0);
+
+      /* Derivation:
+
+      s >= 0:
+        round(n / d) = trunc(n / d) + (n % d) / d >= 0.5 ? 1 : 0
+                     = trunc(n / d) + 2(n % d) >= d ? 1 : 0
+      s < 0:
+        round(n / d) =-trunc(n / d) - (n % d) / d > 0.5 ? 1 : 0
+                     =-trunc(n / d) - 2(n % d) > d ? 1 : 0
+
+      =>:
+
+      round(s * n / d) = s * trunc(n / d) + s * (C + 2(n % d) > d ? 1 : 0)
+          where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.
+      */
+
+      return newFraction(this["s"] * places * this["n"] / this["d"] +
+        this["s"] * ((this["s"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this["n"] % this["d"]) > this["d"] ? C_ONE : C_ZERO),
+        places);
+    },
+
+    /**
+     * Check if two rational numbers are divisible
+     *
+     * Ex: new Fraction(19.6).divisible(1.5);
+     */
+    "divisible": function(a, b) {
+
+      parse(a, b);
+      return !(!(P["n"] * this["d"]) || ((this["n"] * P["d"]) % (P["n"] * this["d"])));
+    },
+
+    /**
+     * Returns a decimal representation of the fraction
+     *
+     * Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
+     **/
+    'valueOf': function() {
+      // Best we can do so far
+      return Number(this["s"] * this["n"]) / Number(this["d"]);
+    },
+
+    /**
+     * Creates a string representation of a fraction with all digits
+     *
+     * Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
+     **/
+    'toString': function(dec) {
+
+      let N = this["n"];
+      let D = this["d"];
+
+      dec = dec || 15; // 15 = decimal places when no repitation
+
+      let cycLen = cycleLen(N, D); // Cycle length
+      let cycOff = cycleStart(N, D, cycLen); // Cycle start
+
+      let str = this['s'] < C_ZERO ? "-" : "";
+
+      // Append integer part
+      str+= N / D;
+
+      N%= D;
+      N*= C_TEN;
+
+      if (N)
+        str+= ".";
+
+      if (cycLen) {
+
+        for (let i = cycOff; i--;) {
+          str+= N / D;
+          N%= D;
+          N*= C_TEN;
+        }
+        str+= "(";
+        for (let i = cycLen; i--;) {
+          str+= N / D;
+          N%= D;
+          N*= C_TEN;
+        }
+        str+= ")";
+      } else {
+        for (let i = dec; N && i--;) {
+          str+= N / D;
+          N%= D;
+          N*= C_TEN;
+        }
+      }
+      return str;
+    },
+
+    /**
+     * Returns a string-fraction representation of a Fraction object
+     *
+     * Ex: new Fraction("1.'3'").toFraction() => "4 1/3"
+     **/
+    'toFraction': function(excludeWhole) {
+
+      let n = this["n"];
+      let d = this["d"];
+      let str = this['s'] < C_ZERO ? "-" : "";
+
+      if (d === C_ONE) {
+        str+= n;
+      } else {
+        let whole = n / d;
+        if (excludeWhole && whole > C_ZERO) {
+          str+= whole;
+          str+= " ";
+          n%= d;
+        }
+
+        str+= n;
+        str+= '/';
+        str+= d;
+      }
+      return str;
+    },
+
+    /**
+     * Returns a latex representation of a Fraction object
+     *
+     * Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
+     **/
+    'toLatex': function(excludeWhole) {
+
+      let n = this["n"];
+      let d = this["d"];
+      let str = this['s'] < C_ZERO ? "-" : "";
+
+      if (d === C_ONE) {
+        str+= n;
+      } else {
+        let whole = n / d;
+        if (excludeWhole && whole > C_ZERO) {
+          str+= whole;
+          n%= d;
+        }
+
+        str+= "\\frac{";
+        str+= n;
+        str+= '}{';
+        str+= d;
+        str+= '}';
+      }
+      return str;
+    },
+
+    /**
+     * Returns an array of continued fraction elements
+     *
+     * Ex: new Fraction("7/8").toContinued() => [0,1,7]
+     */
+    'toContinued': function() {
+
+      let a = this['n'];
+      let b = this['d'];
+      let res = [];
+
+      do {
+        res.push(a / b);
+        let t = a % b;
+        a = b;
+        b = t;
+      } while (a !== C_ONE);
+
+      return res;
+    },
+
+    "simplify": function(eps) {
+
+      eps = eps || 0.001;
+
+      const thisABS = this['abs']();
+      const cont = thisABS['toContinued']();
+
+      for (let i = 1; i < cont.length; i++) {
+
+        let s = newFraction(cont[i - 1], C_ONE);
+        for (let k = i - 2; k >= 0; k--) {
+          s = s['inverse']()['add'](cont[k]);
+        }
+
+        if (s['sub'](thisABS)['abs']().valueOf() < eps) {
+          return s['mul'](this['s']);
+        }
+      }
+      return this;
+    }
+  };
+
+  if (typeof define === "function" && define["amd"]) {
+    define([], function() {
+      return Fraction;
+    });
+  } else if (typeof exports === "object") {
+    Object.defineProperty(exports, "__esModule", { 'value': true });
+    Fraction['default'] = Fraction;
+    Fraction['Fraction'] = Fraction;
+    module['exports'] = Fraction;
+  } else {
+    root['Fraction'] = Fraction;
+  }
+
+})(this);
diff --git a/node_modules/fraction.js/fraction.d.ts b/node_modules/fraction.js/fraction.d.ts
new file mode 100644
index 0000000..e62cfe1
--- /dev/null
+++ b/node_modules/fraction.js/fraction.d.ts
@@ -0,0 +1,60 @@
+declare module 'Fraction';
+
+export interface NumeratorDenominator {
+  n: number;
+  d: number;
+}
+
+type FractionConstructor = {
+  (fraction: Fraction): Fraction;
+  (num: number | string): Fraction;
+  (numerator: number, denominator: number): Fraction;
+  (numbers: [number | string, number | string]): Fraction;
+  (fraction: NumeratorDenominator): Fraction;
+  (firstValue: Fraction | number | string | [number | string, number | string] | NumeratorDenominator, secondValue?: number): Fraction;
+};
+
+export default class Fraction {
+  constructor (fraction: Fraction);
+  constructor (num: number | string);
+  constructor (numerator: number, denominator: number);
+  constructor (numbers: [number | string, number | string]);
+  constructor (fraction: NumeratorDenominator);
+  constructor (firstValue: Fraction | number | string | [number | string, number | string] | NumeratorDenominator, secondValue?: number);
+
+  s: number;
+  n: number;
+  d: number;
+
+  abs(): Fraction;
+  neg(): Fraction;
+
+  add: FractionConstructor;
+  sub: FractionConstructor;
+  mul: FractionConstructor;
+  div: FractionConstructor;
+  pow: FractionConstructor;
+  gcd: FractionConstructor;
+  lcm: FractionConstructor;
+  
+  mod(n?: number | string | Fraction): Fraction;
+
+  ceil(places?: number): Fraction;
+  floor(places?: number): Fraction;
+  round(places?: number): Fraction;
+
+  inverse(): Fraction;
+  
+  simplify(eps?: number): Fraction;
+  
+  equals(n: number | string | Fraction): boolean;
+  compare(n: number | string | Fraction): number;
+  divisible(n: number | string | Fraction): boolean;
+  
+  valueOf(): number;
+  toString(decimalPlaces?: number): string;
+  toLatex(excludeWhole?: boolean): string;
+  toFraction(excludeWhole?: boolean): string;
+  toContinued(): number[];
+  clone(): Fraction;
+}
diff --git a/node_modules/fraction.js/fraction.js b/node_modules/fraction.js/fraction.js
new file mode 100644
index 0000000..82d05d2
--- /dev/null
+++ b/node_modules/fraction.js/fraction.js
@@ -0,0 +1,891 @@
+/**
+ * @license Fraction.js v4.2.0 05/03/2022
+ * https://www.xarg.org/2014/03/rational-numbers-in-javascript/
+ *
+ * Copyright (c) 2021, Robert Eisele (robert@xarg.org)
+ * Dual licensed under the MIT or GPL Version 2 licenses.
+ **/
+
+
+/**
+ *
+ * This class offers the possibility to calculate fractions.
+ * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
+ *
+ * Array/Object form
+ * [ 0 => <nominator>, 1 => <denominator> ]
+ * [ n => <nominator>, d => <denominator> ]
+ *
+ * Integer form
+ * - Single integer value
+ *
+ * Double form
+ * - Single double value
+ *
+ * String form
+ * 123.456 - a simple double
+ * 123/456 - a string fraction
+ * 123.'456' - a double with repeating decimal places
+ * 123.(456) - synonym
+ * 123.45'6' - a double with repeating last place
+ * 123.45(6) - synonym
+ *
+ * Example:
+ *
+ * var f = new Fraction("9.4'31'");
+ * f.mul([-4, 3]).div(4.9);
+ *
+ */
+
+(function(root) {
+
+  "use strict";
+
+  // Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
+  // Example: 1/7 = 0.(142857) has 6 repeating decimal places.
+  // If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
+  var MAX_CYCLE_LEN = 2000;
+
+  // Parsed data to avoid calling "new" all the time
+  var P = {
+    "s": 1,
+    "n": 0,
+    "d": 1
+  };
+
+  function assign(n, s) {
+
+    if (isNaN(n = parseInt(n, 10))) {
+      throw Fraction['InvalidParameter'];
+    }
+    return n * s;
+  }
+
+  // Creates a new Fraction internally without the need of the bulky constructor
+  function newFraction(n, d) {
+
+    if (d === 0) {
+      throw Fraction['DivisionByZero'];
+    }
+
+    var f = Object.create(Fraction.prototype);
+    f["s"] = n < 0 ? -1 : 1;
+
+    n = n < 0 ? -n : n;
+
+    var a = gcd(n, d);
+
+    f["n"] = n / a;
+    f["d"] = d / a;
+    return f;
+  }
+
+  function factorize(num) {
+
+    var factors = {};
+
+    var n = num;
+    var i = 2;
+    var s = 4;
+
+    while (s <= n) {
+
+      while (n % i === 0) {
+        n/= i;
+        factors[i] = (factors[i] || 0) + 1;
+      }
+      s+= 1 + 2 * i++;
+    }
+
+    if (n !== num) {
+      if (n > 1)
+        factors[n] = (factors[n] || 0) + 1;
+    } else {
+      factors[num] = (factors[num] || 0) + 1;
+    }
+    return factors;
+  }
+
+  var parse = function(p1, p2) {
+
+    var n = 0, d = 1, s = 1;
+    var v = 0, w = 0, x = 0, y = 1, z = 1;
+
+    var A = 0, B = 1;
+    var C = 1, D = 1;
+
+    var N = 10000000;
+    var M;
+
+    if (p1 === undefined || p1 === null) {
+      /* void */
+    } else if (p2 !== undefined) {
+      n = p1;
+      d = p2;
+      s = n * d;
+
+      if (n % 1 !== 0 || d % 1 !== 0) {
+        throw Fraction['NonIntegerParameter'];
+      }
+
+    } else
+      switch (typeof p1) {
+
+        case "object":
+          {
+            if ("d" in p1 && "n" in p1) {
+              n = p1["n"];
+              d = p1["d"];
+              if ("s" in p1)
+                n*= p1["s"];
+            } else if (0 in p1) {
+              n = p1[0];
+              if (1 in p1)
+                d = p1[1];
+            } else {
+              throw Fraction['InvalidParameter'];
+            }
+            s = n * d;
+            break;
+          }
+        case "number":
+          {
+            if (p1 < 0) {
+              s = p1;
+              p1 = -p1;
+            }
+
+            if (p1 % 1 === 0) {
+              n = p1;
+            } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow
+
+              if (p1 >= 1) {
+                z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));
+                p1/= z;
+              }
+
+              // Using Farey Sequences
+              // http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/
+
+              while (B <= N && D <= N) {
+                M = (A + C) / (B + D);
+
+                if (p1 === M) {
+                  if (B + D <= N) {
+                    n = A + C;
+                    d = B + D;
+                  } else if (D > B) {
+                    n = C;
+                    d = D;
+                  } else {
+                    n = A;
+                    d = B;
+                  }
+                  break;
+
+                } else {
+
+                  if (p1 > M) {
+                    A+= C;
+                    B+= D;
+                  } else {
+                    C+= A;
+                    D+= B;
+                  }
+
+                  if (B > N) {
+                    n = C;
+                    d = D;
+                  } else {
+                    n = A;
+                    d = B;
+                  }
+                }
+              }
+              n*= z;
+            } else if (isNaN(p1) || isNaN(p2)) {
+              d = n = NaN;
+            }
+            break;
+          }
+        case "string":
+          {
+            B = p1.match(/\d+|./g);
+
+            if (B === null)
+              throw Fraction['InvalidParameter'];
+
+            if (B[A] === '-') {// Check for minus sign at the beginning
+              s = -1;
+              A++;
+            } else if (B[A] === '+') {// Check for plus sign at the beginning
+              A++;
+            }
+
+            if (B.length === A + 1) { // Check if it's just a simple number "1234"
+              w = assign(B[A++], s);
+            } else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number
+
+              if (B[A] !== '.') { // Handle 0.5 and .5
+                v = assign(B[A++], s);
+              }
+              A++;
+
+              // Check for decimal places
+              if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === "'" && B[A + 3] === "'") {
+                w = assign(B[A], s);
+                y = Math.pow(10, B[A].length);
+                A++;
+              }
+
+              // Check for repeating places
+              if (B[A] === '(' && B[A + 2] === ')' || B[A] === "'" && B[A + 2] === "'") {
+                x = assign(B[A + 1], s);
+                z = Math.pow(10, B[A + 1].length) - 1;
+                A+= 3;
+              }
+
+            } else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
+              w = assign(B[A], s);
+              y = assign(B[A + 2], 1);
+              A+= 3;
+            } else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction "123 1/2"
+              v = assign(B[A], s);
+              w = assign(B[A + 2], s);
+              y = assign(B[A + 4], 1);
+              A+= 5;
+            }
+
+            if (B.length <= A) { // Check for more tokens on the stack
+              d = y * z;
+              s = /* void */
+              n = x + d * v + z * w;
+              break;
+            }
+
+            /* Fall through on error */
+          }
+        default:
+          throw Fraction['InvalidParameter'];
+      }
+
+    if (d === 0) {
+      throw Fraction['DivisionByZero'];
+    }
+
+    P["s"] = s < 0 ? -1 : 1;
+    P["n"] = Math.abs(n);
+    P["d"] = Math.abs(d);
+  };
+
+  function modpow(b, e, m) {
+
+    var r = 1;
+    for (; e > 0; b = (b * b) % m, e >>= 1) {
+
+      if (e & 1) {
+        r = (r * b) % m;
+      }
+    }
+    return r;
+  }
+
+
+  function cycleLen(n, d) {
+
+    for (; d % 2 === 0;
+      d/= 2) {
+    }
+
+    for (; d % 5 === 0;
+      d/= 5) {
+    }
+
+    if (d === 1) // Catch non-cyclic numbers
+      return 0;
+
+    // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
+    // 10^(d-1) % d == 1
+    // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
+    // as we want to translate the numbers to strings.
+
+    var rem = 10 % d;
+    var t = 1;
+
+    for (; rem !== 1; t++) {
+      rem = rem * 10 % d;
+
+      if (t > MAX_CYCLE_LEN)
+        return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
+    }
+    return t;
+  }
+
+
+  function cycleStart(n, d, len) {
+
+    var rem1 = 1;
+    var rem2 = modpow(10, len, d);
+
+    for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
+      // Solve 10^s == 10^(s+t) (mod d)
+
+      if (rem1 === rem2)
+        return t;
+
+      rem1 = rem1 * 10 % d;
+      rem2 = rem2 * 10 % d;
+    }
+    return 0;
+  }
+
+  function gcd(a, b) {
+
+    if (!a)
+      return b;
+    if (!b)
+      return a;
+
+    while (1) {
+      a%= b;
+      if (!a)
+        return b;
+      b%= a;
+      if (!b)
+        return a;
+    }
+  };
+
+  /**
+   * Module constructor
+   *
+   * @constructor
+   * @param {number|Fraction=} a
+   * @param {number=} b
+   */
+  function Fraction(a, b) {
+
+    parse(a, b);
+
+    if (this instanceof Fraction) {
+      a = gcd(P["d"], P["n"]); // Abuse variable a
+      this["s"] = P["s"];
+      this["n"] = P["n"] / a;
+      this["d"] = P["d"] / a;
+    } else {
+      return newFraction(P['s'] * P['n'], P['d']);
+    }
+  }
+
+  Fraction['DivisionByZero'] = new Error("Division by Zero");
+  Fraction['InvalidParameter'] = new Error("Invalid argument");
+  Fraction['NonIntegerParameter'] = new Error("Parameters must be integer");
+
+  Fraction.prototype = {
+
+    "s": 1,
+    "n": 0,
+    "d": 1,
+
+    /**
+     * Calculates the absolute value
+     *
+     * Ex: new Fraction(-4).abs() => 4
+     **/
+    "abs": function() {
+
+      return newFraction(this["n"], this["d"]);
+    },
+
+    /**
+     * Inverts the sign of the current fraction
+     *
+     * Ex: new Fraction(-4).neg() => 4
+     **/
+    "neg": function() {
+
+      return newFraction(-this["s"] * this["n"], this["d"]);
+    },
+
+    /**
+     * Adds two rational numbers
+     *
+     * Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
+     **/
+    "add": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * this["n"] * P["d"] + P["s"] * this["d"] * P["n"],
+        this["d"] * P["d"]
+      );
+    },
+
+    /**
+     * Subtracts two rational numbers
+     *
+     * Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
+     **/
+    "sub": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * this["n"] * P["d"] - P["s"] * this["d"] * P["n"],
+        this["d"] * P["d"]
+      );
+    },
+
+    /**
+     * Multiplies two rational numbers
+     *
+     * Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
+     **/
+    "mul": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * P["s"] * this["n"] * P["n"],
+        this["d"] * P["d"]
+      );
+    },
+
+    /**
+     * Divides two rational numbers
+     *
+     * Ex: new Fraction("-17.(345)").inverse().div(3)
+     **/
+    "div": function(a, b) {
+
+      parse(a, b);
+      return newFraction(
+        this["s"] * P["s"] * this["n"] * P["d"],
+        this["d"] * P["n"]
+      );
+    },
+
+    /**
+     * Clones the actual object
+     *
+     * Ex: new Fraction("-17.(345)").clone()
+     **/
+    "clone": function() {
+      return newFraction(this['s'] * this['n'], this['d']);
+    },
+
+    /**
+     * Calculates the modulo of two rational numbers - a more precise fmod
+     *
+     * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
+     **/
+    "mod": function(a, b) {
+
+      if (isNaN(this['n']) || isNaN(this['d'])) {
+        return new Fraction(NaN);
+      }
+
+      if (a === undefined) {
+        return newFraction(this["s"] * this["n"] % this["d"], 1);
+      }
+
+      parse(a, b);
+      if (0 === P["n"] && 0 === this["d"]) {
+        throw Fraction['DivisionByZero'];
+      }
+
+      /*
+       * First silly attempt, kinda slow
+       *
+       return that["sub"]({
+       "n": num["n"] * Math.floor((this.n / this.d) / (num.n / num.d)),
+       "d": num["d"],
+       "s": this["s"]
+       });*/
+
+      /*
+       * New attempt: a1 / b1 = a2 / b2 * q + r
+       * => b2 * a1 = a2 * b1 * q + b1 * b2 * r
+       * => (b2 * a1 % a2 * b1) / (b1 * b2)
+       */
+      return newFraction(
+        this["s"] * (P["d"] * this["n"]) % (P["n"] * this["d"]),
+        P["d"] * this["d"]
+      );
+    },
+
+    /**
+     * Calculates the fractional gcd of two rational numbers
+     *
+     * Ex: new Fraction(5,8).gcd(3,7) => 1/56
+     */
+    "gcd": function(a, b) {
+
+      parse(a, b);
+
+      // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
+
+      return newFraction(gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]), P["d"] * this["d"]);
+    },
+
+    /**
+     * Calculates the fractional lcm of two rational numbers
+     *
+     * Ex: new Fraction(5,8).lcm(3,7) => 15
+     */
+    "lcm": function(a, b) {
+
+      parse(a, b);
+
+      // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
+
+      if (P["n"] === 0 && this["n"] === 0) {
+        return newFraction(0, 1);
+      }
+      return newFraction(P["n"] * this["n"], gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]));
+    },
+
+    /**
+     * Calculates the ceil of a rational number
+     *
+     * Ex: new Fraction('4.(3)').ceil() => (5 / 1)
+     **/
+    "ceil": function(places) {
+
+      places = Math.pow(10, places || 0);
+
+      if (isNaN(this["n"]) || isNaN(this["d"])) {
+        return new Fraction(NaN);
+      }
+      return newFraction(Math.ceil(places * this["s"] * this["n"] / this["d"]), places);
+    },
+
+    /**
+     * Calculates the floor of a rational number
+     *
+     * Ex: new Fraction('4.(3)').floor() => (4 / 1)
+     **/
+    "floor": function(places) {
+
+      places = Math.pow(10, places || 0);
+
+      if (isNaN(this["n"]) || isNaN(this["d"])) {
+        return new Fraction(NaN);
+      }
+      return newFraction(Math.floor(places * this["s"] * this["n"] / this["d"]), places);
+    },
+
+    /**
+     * Rounds a rational numbers
+     *
+     * Ex: new Fraction('4.(3)').round() => (4 / 1)
+     **/
+    "round": function(places) {
+
+      places = Math.pow(10, places || 0);
+
+      if (isNaN(this["n"]) || isNaN(this["d"])) {
+        return new Fraction(NaN);
+      }
+      return newFraction(Math.round(places * this["s"] * this["n"] / this["d"]), places);
+    },
+
+    /**
+     * Gets the inverse of the fraction, means numerator and denominator are exchanged
+     *
+     * Ex: new Fraction([-3, 4]).inverse() => -4 / 3
+     **/
+    "inverse": function() {
+
+      return newFraction(this["s"] * this["d"], this["n"]);
+    },
+
+    /**
+     * Calculates the fraction to some rational exponent, if possible
+     *
+     * Ex: new Fraction(-1,2).pow(-3) => -8
+     */
+    "pow": function(a, b) {
+
+      parse(a, b);
+
+      // Trivial case when exp is an integer
+
+      if (P['d'] === 1) {
+
+        if (P['s'] < 0) {
+          return newFraction(Math.pow(this['s'] * this["d"], P['n']), Math.pow(this["n"], P['n']));
+        } else {
+          return newFraction(Math.pow(this['s'] * this["n"], P['n']), Math.pow(this["d"], P['n']));
+        }
+      }
+
+      // Negative roots become complex
+      //     (-a/b)^(c/d) = x
+      // <=> (-1)^(c/d) * (a/b)^(c/d) = x
+      // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x         # rotate 1 by 180°
+      // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula in Q ( https://proofwiki.org/wiki/De_Moivre%27s_Formula/Rational_Index )
+      // From which follows that only for c=0 the root is non-complex. c/d is a reduced fraction, so that sin(c/dpi)=0 occurs for d=1, which is handled by our trivial case.
+      if (this['s'] < 0) return null;
+
+      // Now prime factor n and d
+      var N = factorize(this['n']);
+      var D = factorize(this['d']);
+
+      // Exponentiate and take root for n and d individually
+      var n = 1;
+      var d = 1;
+      for (var k in N) {
+        if (k === '1') continue;
+        if (k === '0') {
+          n = 0;
+          break;
+        }
+        N[k]*= P['n'];
+
+        if (N[k] % P['d'] === 0) {
+          N[k]/= P['d'];
+        } else return null;
+        n*= Math.pow(k, N[k]);
+      }
+
+      for (var k in D) {
+        if (k === '1') continue;
+        D[k]*= P['n'];
+
+        if (D[k] % P['d'] === 0) {
+          D[k]/= P['d'];
+        } else return null;
+        d*= Math.pow(k, D[k]);
+      }
+
+      if (P['s'] < 0) {
+        return newFraction(d, n);
+      }
+      return newFraction(n, d);
+    },
+
+    /**
+     * Check if two rational numbers are the same
+     *
+     * Ex: new Fraction(19.6).equals([98, 5]);
+     **/
+    "equals": function(a, b) {
+
+      parse(a, b);
+      return this["s"] * this["n"] * P["d"] === P["s"] * P["n"] * this["d"]; // Same as compare() === 0
+    },
+
+    /**
+     * Check if two rational numbers are the same
+     *
+     * Ex: new Fraction(19.6).equals([98, 5]);
+     **/
+    "compare": function(a, b) {
+
+      parse(a, b);
+      var t = (this["s"] * this["n"] * P["d"] - P["s"] * P["n"] * this["d"]);
+      return (0 < t) - (t < 0);
+    },
+
+    "simplify": function(eps) {
+
+      if (isNaN(this['n']) || isNaN(this['d'])) {
+        return this;
+      }
+
+      eps = eps || 0.001;
+
+      var thisABS = this['abs']();
+      var cont = thisABS['toContinued']();
+
+      for (var i = 1; i < cont.length; i++) {
+
+        var s = newFraction(cont[i - 1], 1);
+        for (var k = i - 2; k >= 0; k--) {
+          s = s['inverse']()['add'](cont[k]);
+        }
+
+        if (s['sub'](thisABS)['abs']().valueOf() < eps) {
+          return s['mul'](this['s']);
+        }
+      }
+      return this;
+    },
+
+    /**
+     * Check if two rational numbers are divisible
+     *
+     * Ex: new Fraction(19.6).divisible(1.5);
+     */
+    "divisible": function(a, b) {
+
+      parse(a, b);
+      return !(!(P["n"] * this["d"]) || ((this["n"] * P["d"]) % (P["n"] * this["d"])));
+    },
+
+    /**
+     * Returns a decimal representation of the fraction
+     *
+     * Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
+     **/
+    'valueOf': function() {
+
+      return this["s"] * this["n"] / this["d"];
+    },
+
+    /**
+     * Returns a string-fraction representation of a Fraction object
+     *
+     * Ex: new Fraction("1.'3'").toFraction(true) => "4 1/3"
+     **/
+    'toFraction': function(excludeWhole) {
+
+      var whole, str = "";
+      var n = this["n"];
+      var d = this["d"];
+      if (this["s"] < 0) {
+        str+= '-';
+      }
+
+      if (d === 1) {
+        str+= n;
+      } else {
+
+        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
+          str+= whole;
+          str+= " ";
+          n%= d;
+        }
+
+        str+= n;
+        str+= '/';
+        str+= d;
+      }
+      return str;
+    },
+
+    /**
+     * Returns a latex representation of a Fraction object
+     *
+     * Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
+     **/
+    'toLatex': function(excludeWhole) {
+
+      var whole, str = "";
+      var n = this["n"];
+      var d = this["d"];
+      if (this["s"] < 0) {
+        str+= '-';
+      }
+
+      if (d === 1) {
+        str+= n;
+      } else {
+
+        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
+          str+= whole;
+          n%= d;
+        }
+
+        str+= "\\frac{";
+        str+= n;
+        str+= '}{';
+        str+= d;
+        str+= '}';
+      }
+      return str;
+    },
+
+    /**
+     * Returns an array of continued fraction elements
+     *
+     * Ex: new Fraction("7/8").toContinued() => [0,1,7]
+     */
+    'toContinued': function() {
+
+      var t;
+      var a = this['n'];
+      var b = this['d'];
+      var res = [];
+
+      if (isNaN(a) || isNaN(b)) {
+        return res;
+      }
+
+      do {
+        res.push(Math.floor(a / b));
+        t = a % b;
+        a = b;
+        b = t;
+      } while (a !== 1);
+
+      return res;
+    },
+
+    /**
+     * Creates a string representation of a fraction with all digits
+     *
+     * Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
+     **/
+    'toString': function(dec) {
+
+      var N = this["n"];
+      var D = this["d"];
+
+      if (isNaN(N) || isNaN(D)) {
+        return "NaN";
+      }
+
+      dec = dec || 15; // 15 = decimal places when no repetation
+
+      var cycLen = cycleLen(N, D); // Cycle length
+      var cycOff = cycleStart(N, D, cycLen); // Cycle start
+
+      var str = this['s'] < 0 ? "-" : "";
+
+      str+= N / D | 0;
+
+      N%= D;
+      N*= 10;
+
+      if (N)
+        str+= ".";
+
+      if (cycLen) {
+
+        for (var i = cycOff; i--;) {
+          str+= N / D | 0;
+          N%= D;
+          N*= 10;
+        }
+        str+= "(";
+        for (var i = cycLen; i--;) {
+          str+= N / D | 0;
+          N%= D;
+          N*= 10;
+        }
+        str+= ")";
+      } else {
+        for (var i = dec; N && i--;) {
+          str+= N / D | 0;
+          N%= D;
+          N*= 10;
+        }
+      }
+      return str;
+    }
+  };
+
+  if (typeof define === "function" && define["amd"]) {
+    define([], function() {
+      return Fraction;
+    });
+  } else if (typeof exports === "object") {
+    Object.defineProperty(Fraction, "__esModule", { 'value': true });
+    Fraction['default'] = Fraction;
+    Fraction['Fraction'] = Fraction;
+    module['exports'] = Fraction;
+  } else {
+    root['Fraction'] = Fraction;
+  }
+
+})(this);
diff --git a/node_modules/fraction.js/fraction.min.js b/node_modules/fraction.js/fraction.min.js
new file mode 100644
index 0000000..f0cc9d5
--- /dev/null
+++ b/node_modules/fraction.js/fraction.min.js
@@ -0,0 +1,19 @@
+/*
+Fraction.js v4.2.0 05/03/2022
+https://www.xarg.org/2014/03/rational-numbers-in-javascript/
+
+Copyright (c) 2021, Robert Eisele (robert@xarg.org)
+Dual licensed under the MIT or GPL Version 2 licenses.
+*/
+(function(z){function p(a,c){var b=0,d=1,f=1,l=0,k=0,t=0,x=1,u=1,g=0,h=1,v=1,q=1;if(void 0!==a&&null!==a)if(void 0!==c){if(b=a,d=c,f=b*d,0!==b%1||0!==d%1)throw m.NonIntegerParameter;}else switch(typeof a){case "object":if("d"in a&&"n"in a)b=a.n,d=a.d,"s"in a&&(b*=a.s);else if(0 in a)b=a[0],1 in a&&(d=a[1]);else throw m.InvalidParameter;f=b*d;break;case "number":0>a&&(f=a,a=-a);if(0===a%1)b=a;else if(0<a){1<=a&&(u=Math.pow(10,Math.floor(1+Math.log(a)/Math.LN10)),a/=u);for(;1E7>=h&&1E7>=q;)if(b=(g+
+v)/(h+q),a===b){1E7>=h+q?(b=g+v,d=h+q):q>h?(b=v,d=q):(b=g,d=h);break}else a>b?(g+=v,h+=q):(v+=g,q+=h),1E7<h?(b=v,d=q):(b=g,d=h);b*=u}else if(isNaN(a)||isNaN(c))d=b=NaN;break;case "string":h=a.match(/\d+|./g);if(null===h)throw m.InvalidParameter;"-"===h[g]?(f=-1,g++):"+"===h[g]&&g++;if(h.length===g+1)k=r(h[g++],f);else if("."===h[g+1]||"."===h[g]){"."!==h[g]&&(l=r(h[g++],f));g++;if(g+1===h.length||"("===h[g+1]&&")"===h[g+3]||"'"===h[g+1]&&"'"===h[g+3])k=r(h[g],f),x=Math.pow(10,h[g].length),g++;if("("===
+h[g]&&")"===h[g+2]||"'"===h[g]&&"'"===h[g+2])t=r(h[g+1],f),u=Math.pow(10,h[g+1].length)-1,g+=3}else"/"===h[g+1]||":"===h[g+1]?(k=r(h[g],f),x=r(h[g+2],1),g+=3):"/"===h[g+3]&&" "===h[g+1]&&(l=r(h[g],f),k=r(h[g+2],f),x=r(h[g+4],1),g+=5);if(h.length<=g){d=x*u;f=b=t+d*l+u*k;break}default:throw m.InvalidParameter;}if(0===d)throw m.DivisionByZero;e.s=0>f?-1:1;e.n=Math.abs(b);e.d=Math.abs(d)}function r(a,c){if(isNaN(a=parseInt(a,10)))throw m.InvalidParameter;return a*c}function n(a,c){if(0===c)throw m.DivisionByZero;
+var b=Object.create(m.prototype);b.s=0>a?-1:1;a=0>a?-a:a;var d=w(a,c);b.n=a/d;b.d=c/d;return b}function y(a){for(var c={},b=a,d=2,f=4;f<=b;){for(;0===b%d;)b/=d,c[d]=(c[d]||0)+1;f+=1+2*d++}b!==a?1<b&&(c[b]=(c[b]||0)+1):c[a]=(c[a]||0)+1;return c}function w(a,c){if(!a)return c;if(!c)return a;for(;;){a%=c;if(!a)return c;c%=a;if(!c)return a}}function m(a,c){p(a,c);if(this instanceof m)a=w(e.d,e.n),this.s=e.s,this.n=e.n/a,this.d=e.d/a;else return n(e.s*e.n,e.d)}var e={s:1,n:0,d:1};m.DivisionByZero=Error("Division by Zero");
+m.InvalidParameter=Error("Invalid argument");m.NonIntegerParameter=Error("Parameters must be integer");m.prototype={s:1,n:0,d:1,abs:function(){return n(this.n,this.d)},neg:function(){return n(-this.s*this.n,this.d)},add:function(a,c){p(a,c);return n(this.s*this.n*e.d+e.s*this.d*e.n,this.d*e.d)},sub:function(a,c){p(a,c);return n(this.s*this.n*e.d-e.s*this.d*e.n,this.d*e.d)},mul:function(a,c){p(a,c);return n(this.s*e.s*this.n*e.n,this.d*e.d)},div:function(a,c){p(a,c);return n(this.s*e.s*this.n*e.d,
+this.d*e.n)},clone:function(){return n(this.s*this.n,this.d)},mod:function(a,c){if(isNaN(this.n)||isNaN(this.d))return new m(NaN);if(void 0===a)return n(this.s*this.n%this.d,1);p(a,c);if(0===e.n&&0===this.d)throw m.DivisionByZero;return n(this.s*e.d*this.n%(e.n*this.d),e.d*this.d)},gcd:function(a,c){p(a,c);return n(w(e.n,this.n)*w(e.d,this.d),e.d*this.d)},lcm:function(a,c){p(a,c);return 0===e.n&&0===this.n?n(0,1):n(e.n*this.n,w(e.n,this.n)*w(e.d,this.d))},ceil:function(a){a=Math.pow(10,a||0);return isNaN(this.n)||
+isNaN(this.d)?new m(NaN):n(Math.ceil(a*this.s*this.n/this.d),a)},floor:function(a){a=Math.pow(10,a||0);return isNaN(this.n)||isNaN(this.d)?new m(NaN):n(Math.floor(a*this.s*this.n/this.d),a)},round:function(a){a=Math.pow(10,a||0);return isNaN(this.n)||isNaN(this.d)?new m(NaN):n(Math.round(a*this.s*this.n/this.d),a)},inverse:function(){return n(this.s*this.d,this.n)},pow:function(a,c){p(a,c);if(1===e.d)return 0>e.s?n(Math.pow(this.s*this.d,e.n),Math.pow(this.n,e.n)):n(Math.pow(this.s*this.n,e.n),Math.pow(this.d,
+e.n));if(0>this.s)return null;var b=y(this.n),d=y(this.d),f=1,l=1,k;for(k in b)if("1"!==k){if("0"===k){f=0;break}b[k]*=e.n;if(0===b[k]%e.d)b[k]/=e.d;else return null;f*=Math.pow(k,b[k])}for(k in d)if("1"!==k){d[k]*=e.n;if(0===d[k]%e.d)d[k]/=e.d;else return null;l*=Math.pow(k,d[k])}return 0>e.s?n(l,f):n(f,l)},equals:function(a,c){p(a,c);return this.s*this.n*e.d===e.s*e.n*this.d},compare:function(a,c){p(a,c);var b=this.s*this.n*e.d-e.s*e.n*this.d;return(0<b)-(0>b)},simplify:function(a){if(isNaN(this.n)||
+isNaN(this.d))return this;a=a||.001;for(var c=this.abs(),b=c.toContinued(),d=1;d<b.length;d++){for(var f=n(b[d-1],1),l=d-2;0<=l;l--)f=f.inverse().add(b[l]);if(f.sub(c).abs().valueOf()<a)return f.mul(this.s)}return this},divisible:function(a,c){p(a,c);return!(!(e.n*this.d)||this.n*e.d%(e.n*this.d))},valueOf:function(){return this.s*this.n/this.d},toFraction:function(a){var c,b="",d=this.n,f=this.d;0>this.s&&(b+="-");1===f?b+=d:(a&&0<(c=Math.floor(d/f))&&(b=b+c+" ",d%=f),b=b+d+"/",b+=f);return b},toLatex:function(a){var c,
+b="",d=this.n,f=this.d;0>this.s&&(b+="-");1===f?b+=d:(a&&0<(c=Math.floor(d/f))&&(b+=c,d%=f),b=b+"\\frac{"+d+"}{"+f,b+="}");return b},toContinued:function(){var a=this.n,c=this.d,b=[];if(isNaN(a)||isNaN(c))return b;do{b.push(Math.floor(a/c));var d=a%c;a=c;c=d}while(1!==a);return b},toString:function(a){var c=this.n,b=this.d;if(isNaN(c)||isNaN(b))return"NaN";var d;a:{for(d=b;0===d%2;d/=2);for(;0===d%5;d/=5);if(1===d)d=0;else{for(var f=10%d,l=1;1!==f;l++)if(f=10*f%d,2E3<l){d=0;break a}d=l}}a:{f=1;l=
+10;for(var k=d,t=1;0<k;l=l*l%b,k>>=1)k&1&&(t=t*l%b);l=t;for(k=0;300>k;k++){if(f===l){l=k;break a}f=10*f%b;l=10*l%b}l=0}f=0>this.s?"-":"";f+=c/b|0;(c=c%b*10)&&(f+=".");if(d){for(a=l;a--;)f+=c/b|0,c%=b,c*=10;f+="(";for(a=d;a--;)f+=c/b|0,c%=b,c*=10;f+=")"}else for(a=a||15;c&&a--;)f+=c/b|0,c%=b,c*=10;return f}};"function"===typeof define&&define.amd?define([],function(){return m}):"object"===typeof exports?(Object.defineProperty(m,"__esModule",{value:!0}),m["default"]=m,m.Fraction=m,module.exports=m):
+z.Fraction=m})(this);
\ No newline at end of file
diff --git a/node_modules/fraction.js/package.json b/node_modules/fraction.js/package.json
new file mode 100644
index 0000000..9be0262
--- /dev/null
+++ b/node_modules/fraction.js/package.json
@@ -0,0 +1,43 @@
+{
+    "name": "fraction.js",
+    "title": "fraction.js",
+    "version": "4.2.0",
+    "homepage": "https://www.xarg.org/2014/03/rational-numbers-in-javascript/",
+    "bugs": "https://github.com/infusion/Fraction.js/issues",
+    "description": "A rational number library",
+    "keywords": [
+        "math",
+        "fraction",
+        "rational",
+        "rationals",
+        "number",
+        "parser",
+        "rational numbers"
+    ],
+    "author": "Robert Eisele <robert@xarg.org> (http://www.xarg.org/)",
+    "main": "fraction",
+    "types": "./fraction.d.ts",
+    "private": false,
+    "readmeFilename": "README.md",
+    "directories": {
+        "example": "examples"
+    },
+    "license": "MIT",
+    "repository": {
+        "type": "git",
+        "url": "git://github.com/infusion/Fraction.js.git"
+    },
+    "funding": {
+        "type": "patreon",
+        "url": "https://www.patreon.com/infusion"
+    },
+    "engines": {
+        "node": "*"
+    },
+    "scripts": {
+        "test": "mocha tests/*.js"
+    },
+    "devDependencies": {
+        "mocha": "*"
+    }
+}
diff --git a/node_modules/javascript-natural-sort/.gitattributes b/node_modules/javascript-natural-sort/.gitattributes
new file mode 100644
index 0000000..412eeda
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.gitattributes
@@ -0,0 +1,22 @@
+# Auto detect text files and perform LF normalization
+* text=auto
+
+# Custom for Visual Studio
+*.cs     diff=csharp
+*.sln    merge=union
+*.csproj merge=union
+*.vbproj merge=union
+*.fsproj merge=union
+*.dbproj merge=union
+
+# Standard to msysgit
+*.doc	 diff=astextplain
+*.DOC	 diff=astextplain
+*.docx diff=astextplain
+*.DOCX diff=astextplain
+*.dot  diff=astextplain
+*.DOT  diff=astextplain
+*.pdf  diff=astextplain
+*.PDF	 diff=astextplain
+*.rtf	 diff=astextplain
+*.RTF	 diff=astextplain
diff --git a/node_modules/javascript-natural-sort/.idea/.name b/node_modules/javascript-natural-sort/.idea/.name
new file mode 100644
index 0000000..f9bd021
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/.name
@@ -0,0 +1 @@
+javascript-natural-sort
\ No newline at end of file
diff --git a/node_modules/javascript-natural-sort/.idea/encodings.xml b/node_modules/javascript-natural-sort/.idea/encodings.xml
new file mode 100644
index 0000000..e206d70
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/encodings.xml
@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="Encoding" useUTFGuessing="true" native2AsciiForPropertiesFiles="false" />
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/javascript-natural-sort.iml b/node_modules/javascript-natural-sort/.idea/javascript-natural-sort.iml
new file mode 100644
index 0000000..6b8184f
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/javascript-natural-sort.iml
@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="WEB_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
+
diff --git a/node_modules/javascript-natural-sort/.idea/misc.xml b/node_modules/javascript-natural-sort/.idea/misc.xml
new file mode 100644
index 0000000..1162f43
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/misc.xml
@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" />
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/modules.xml b/node_modules/javascript-natural-sort/.idea/modules.xml
new file mode 100644
index 0000000..63a98c1
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/modules.xml
@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/javascript-natural-sort.iml" filepath="$PROJECT_DIR$/.idea/javascript-natural-sort.iml" />
+    </modules>
+  </component>
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/scopes/scope_settings.xml b/node_modules/javascript-natural-sort/.idea/scopes/scope_settings.xml
new file mode 100644
index 0000000..922003b
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/scopes/scope_settings.xml
@@ -0,0 +1,5 @@
+<component name="DependencyValidationManager">
+  <state>
+    <option name="SKIP_IMPORT_STATEMENTS" value="false" />
+  </state>
+</component>
\ No newline at end of file
diff --git a/node_modules/javascript-natural-sort/.idea/vcs.xml b/node_modules/javascript-natural-sort/.idea/vcs.xml
new file mode 100644
index 0000000..c80f219
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/vcs.xml
@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/workspace.xml b/node_modules/javascript-natural-sort/.idea/workspace.xml
new file mode 100644
index 0000000..e229274
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/workspace.xml
@@ -0,0 +1,318 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ChangeListManager">
+    <list default="true" id="7e2ccc79-07ee-4d3a-8f78-ceb66a24e495" name="Default" comment="">
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/naturalSort.js" afterPath="$PROJECT_DIR$/naturalSort.js" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/package.json" afterPath="$PROJECT_DIR$/package.json" />
+    </list>
+    <ignored path="javascript-natural-sort.iws" />
+    <ignored path=".idea/workspace.xml" />
+    <option name="TRACKING_ENABLED" value="true" />
+    <option name="SHOW_DIALOG" value="false" />
+    <option name="HIGHLIGHT_CONFLICTS" value="true" />
+    <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
+    <option name="LAST_RESOLUTION" value="IGNORE" />
+  </component>
+  <component name="ChangesViewManager" flattened_view="true" show_ignored="false" />
+  <component name="CreatePatchCommitExecutor">
+    <option name="PATCH_PATH" value="" />
+  </component>
+  <component name="DaemonCodeAnalyzer">
+    <disable_hints />
+  </component>
+  <component name="ExecutionTargetManager" SELECTED_TARGET="default_target" />
+  <component name="FavoritesManager">
+    <favorites_list name="javascript-natural-sort" />
+  </component>
+  <component name="FileEditorManager">
+    <leaf>
+      <file leaf-file-name="naturalSort.js" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/naturalSort.js">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="14" column="40" selection-start="689" selection-end="689" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="867">
+              <folding>
+                <element signature="n#!!doc" expanded="true" />
+              </folding>
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="README.md" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/README.md">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="238" max-vertical-offset="1394">
+              <folding />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="package.json" pinned="false" current="true" current-in-tab="true">
+        <entry file="file://$PROJECT_DIR$/package.json">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="2" column="19" selection-start="58" selection-end="58" vertical-scroll-proportion="0.05724508" vertical-offset="2" max-vertical-offset="561">
+              <folding />
+            </state>
+          </provider>
+        </entry>
+      </file>
+    </leaf>
+  </component>
+  <component name="FindManager">
+    <FindUsagesManager>
+      <setting name="OPEN_NEW_TAB" value="false" />
+    </FindUsagesManager>
+  </component>
+  <component name="Git.Settings">
+    <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$" />
+  </component>
+  <component name="GitLogSettings">
+    <option name="myDateState">
+      <MyDateState />
+    </option>
+  </component>
+  <component name="IdeDocumentHistory">
+    <option name="changedFiles">
+      <list>
+        <option value="$PROJECT_DIR$/naturalSort.js" />
+        <option value="$PROJECT_DIR$/package.json" />
+      </list>
+    </option>
+  </component>
+  <component name="ProjectFrameBounds">
+    <option name="x" value="-1928" />
+    <option name="y" value="-8" />
+    <option name="width" value="1936" />
+    <option name="height" value="1066" />
+  </component>
+  <component name="ProjectLevelVcsManager" settingsEditedManually="false">
+    <OptionsSetting value="true" id="Add" />
+    <OptionsSetting value="true" id="Remove" />
+    <OptionsSetting value="true" id="Checkout" />
+    <OptionsSetting value="true" id="Update" />
+    <OptionsSetting value="true" id="Status" />
+    <OptionsSetting value="true" id="Edit" />
+    <ConfirmationsSetting value="0" id="Add" />
+    <ConfirmationsSetting value="0" id="Remove" />
+  </component>
+  <component name="ProjectReloadState">
+    <option name="STATE" value="0" />
+  </component>
+  <component name="ProjectView">
+    <navigator currentView="ProjectPane" proportions="" version="1" splitterProportion="0.5">
+      <flattenPackages />
+      <showMembers />
+      <showModules />
+      <showLibraryContents />
+      <hideEmptyPackages />
+      <abbreviatePackageNames />
+      <autoscrollToSource />
+      <autoscrollFromSource />
+      <sortByType />
+    </navigator>
+    <panes>
+      <pane id="ProjectPane">
+        <subPane>
+          <PATH>
+            <PATH_ELEMENT>
+              <option name="myItemId" value="javascript-natural-sort" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
+            </PATH_ELEMENT>
+          </PATH>
+          <PATH>
+            <PATH_ELEMENT>
+              <option name="myItemId" value="javascript-natural-sort" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
+            </PATH_ELEMENT>
+            <PATH_ELEMENT>
+              <option name="myItemId" value="javascript-natural-sort" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
+            </PATH_ELEMENT>
+          </PATH>
+        </subPane>
+      </pane>
+      <pane id="Scope" />
+    </panes>
+  </component>
+  <component name="PropertiesComponent">
+    <property name="WebServerToolWindowFactoryState" value="false" />
+    <property name="last_opened_file_path" value="$PROJECT_DIR$" />
+  </component>
+  <component name="RunManager">
+    <configuration default="true" type="DartCommandLineRunConfigurationType" factoryName="Dart Command Line Application">
+      <option name="VMOptions" />
+      <option name="arguments" />
+      <option name="filePath" />
+      <option name="name" value="Dart" />
+      <option name="saveOutputToFile" value="false" />
+      <option name="showConsoleOnStdErr" value="false" />
+      <option name="showConsoleOnStdOut" value="false" />
+      <method />
+    </configuration>
+    <configuration default="true" type="DartUnitRunConfigurationType" factoryName="DartUnit">
+      <option name="VMOptions" />
+      <option name="arguments" />
+      <option name="filePath" />
+      <option name="scope" value="ALL" />
+      <option name="testName" />
+      <method />
+    </configuration>
+    <configuration default="true" type="JavaScriptTestRunnerKarma" factoryName="Karma" singleton="true" config-file="">
+      <envs />
+      <method />
+    </configuration>
+    <configuration default="true" type="JSTestDriver:ConfigurationType" factoryName="JsTestDriver">
+      <setting name="configLocationType" value="CONFIG_FILE" />
+      <setting name="settingsFile" value="" />
+      <setting name="serverType" value="INTERNAL" />
+      <setting name="preferredDebugBrowser" value="CHROME" />
+      <method />
+    </configuration>
+    <configuration default="true" type="JavascriptDebugType" factoryName="JavaScript Debug" singleton="true">
+      <method />
+    </configuration>
+    <configuration default="true" type="NodeJSConfigurationType" factoryName="Node.js" working-dir="">
+      <browser start="false" url="" with-js-debugger="false" />
+      <method />
+    </configuration>
+    <list size="0" />
+  </component>
+  <component name="ShelveChangesManager" show_recycled="false" />
+  <component name="TaskManager">
+    <task active="true" id="Default" summary="Default task">
+      <changelist id="7e2ccc79-07ee-4d3a-8f78-ceb66a24e495" name="Default" comment="" />
+      <created>1388535088299</created>
+      <updated>1388535088299</updated>
+    </task>
+    <task id="LOCAL-00001" summary="Added package.json, using commonjs now">
+      <created>1388535399296</created>
+      <updated>1388535399296</updated>
+    </task>
+    <option name="localTasksCounter" value="2" />
+    <servers />
+  </component>
+  <component name="ToolWindowManager">
+    <frame x="-1928" y="-8" width="1936" height="1066" extended-state="0" />
+    <editor active="false" />
+    <layout>
+      <window_info id="Changes" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.32929516" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="Terminal" active="true" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="true" weight="0.32857144" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="TODO" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="6" side_tool="false" content_ui="tabs" />
+      <window_info id="Structure" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="1" side_tool="false" content_ui="tabs" />
+      <window_info id="Project" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="true" weight="0.14654718" sideWeight="0.67142856" order="0" side_tool="false" content_ui="combo" />
+      <window_info id="Debug" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.4" sideWeight="0.5" order="3" side_tool="false" content_ui="tabs" />
+      <window_info id="Favorites" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="2" side_tool="true" content_ui="tabs" />
+      <window_info id="Event Log" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="7" side_tool="true" content_ui="tabs" />
+      <window_info id="Run" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="2" side_tool="false" content_ui="tabs" />
+      <window_info id="Version Control" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="Cvs" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="4" side_tool="false" content_ui="tabs" />
+      <window_info id="Message" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="0" side_tool="false" content_ui="tabs" />
+      <window_info id="Ant Build" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="1" side_tool="false" content_ui="tabs" />
+      <window_info id="Find" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="1" side_tool="false" content_ui="tabs" />
+      <window_info id="Messages" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="Commander" active="false" anchor="right" auto_hide="false" internal_type="SLIDING" type="SLIDING" visible="false" weight="0.4" sideWeight="0.5" order="0" side_tool="false" content_ui="tabs" />
+      <window_info id="Hierarchy" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="2" side_tool="false" content_ui="combo" />
+      <window_info id="Inspection" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.4" sideWeight="0.5" order="5" side_tool="false" content_ui="tabs" />
+    </layout>
+  </component>
+  <component name="VcsContentAnnotationSettings">
+    <option name="myLimit" value="2678400000" />
+  </component>
+  <component name="VcsManagerConfiguration">
+    <option name="myTodoPanelSettings">
+      <TodoPanelSettings />
+    </option>
+    <MESSAGE value="Added package.json, using commonjs now" />
+    <option name="LAST_COMMIT_MESSAGE" value="Added package.json, using commonjs now" />
+  </component>
+  <component name="XDebuggerManager">
+    <breakpoint-manager />
+  </component>
+  <component name="editorHistoryManager">
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="11" column="19" selection-start="506" selection-end="506" vertical-scroll-proportion="0.0" vertical-offset="51" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/README.md">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="238" max-vertical-offset="1394">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="10" column="49" selection-start="354" selection-end="354" vertical-scroll-proportion="0.0" vertical-offset="170" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="5" column="26" selection-start="206" selection-end="206" vertical-scroll-proportion="0.0" vertical-offset="85" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/README.md">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="238" max-vertical-offset="1394">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="0" column="0" selection-start="0" selection-end="0" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="5" column="26" selection-start="206" selection-end="206" vertical-scroll-proportion="0.0" vertical-offset="85" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="0" column="0" selection-start="0" selection-end="0" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/README.md">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="1394">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="40" selection-start="689" selection-end="689" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="2" column="19" selection-start="58" selection-end="58" vertical-scroll-proportion="0.05724508" vertical-offset="2" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+  </component>
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.npmignore b/node_modules/javascript-natural-sort/.npmignore
new file mode 100644
index 0000000..5ebd21a
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.npmignore
@@ -0,0 +1,163 @@
+#################
+## Eclipse
+#################
+
+*.pydevproject
+.project
+.metadata
+bin/
+tmp/
+*.tmp
+*.bak
+*.swp
+*~.nib
+local.properties
+.classpath
+.settings/
+.loadpath
+
+# External tool builders
+.externalToolBuilders/
+
+# Locally stored "Eclipse launch configurations"
+*.launch
+
+# CDT-specific
+.cproject
+
+# PDT-specific
+.buildpath
+
+
+#################
+## Visual Studio
+#################
+
+## Ignore Visual Studio temporary files, build results, and
+## files generated by popular Visual Studio add-ons.
+
+# User-specific files
+*.suo
+*.user
+*.sln.docstates
+
+# Build results
+[Dd]ebug/
+[Rr]elease/
+*_i.c
+*_p.c
+*.ilk
+*.meta
+*.obj
+*.pch
+*.pdb
+*.pgc
+*.pgd
+*.rsp
+*.sbr
+*.tlb
+*.tli
+*.tlh
+*.tmp
+*.vspscc
+.builds
+*.dotCover
+
+## TODO: If you have NuGet Package Restore enabled, uncomment this
+#packages/
+
+# Visual C++ cache files
+ipch/
+*.aps
+*.ncb
+*.opensdf
+*.sdf
+
+# Visual Studio profiler
+*.psess
+*.vsp
+
+# ReSharper is a .NET coding add-in
+_ReSharper*
+
+# Installshield output folder
+[Ee]xpress
+
+# DocProject is a documentation generator add-in
+DocProject/buildhelp/
+DocProject/Help/*.HxT
+DocProject/Help/*.HxC
+DocProject/Help/*.hhc
+DocProject/Help/*.hhk
+DocProject/Help/*.hhp
+DocProject/Help/Html2
+DocProject/Help/html
+
+# Click-Once directory
+publish
+
+# Others
+[Bb]in
+[Oo]bj
+sql
+TestResults
+*.Cache
+ClientBin
+stylecop.*
+~$*
+*.dbmdl
+Generated_Code #added for RIA/Silverlight projects
+
+# Backup & report files from converting an old project file to a newer
+# Visual Studio version. Backup files are not needed, because we have git ;-)
+_UpgradeReport_Files/
+Backup*/
+UpgradeLog*.XML
+
+
+
+############
+## Windows
+############
+
+# Windows image file caches
+Thumbs.db
+
+# Folder config file
+Desktop.ini
+
+
+#############
+## Python
+#############
+
+*.py[co]
+
+# Packages
+*.egg
+*.egg-info
+dist
+build
+eggs
+parts
+bin
+var
+sdist
+develop-eggs
+.installed.cfg
+
+# Installer logs
+pip-log.txt
+
+# Unit test / coverage reports
+.coverage
+.tox
+
+#Translations
+*.mo
+
+#Mr Developer
+.mr.developer.cfg
+
+# Mac crap
+.DS_Store
diff --git a/node_modules/javascript-natural-sort/README.md b/node_modules/javascript-natural-sort/README.md
new file mode 100644
index 0000000..8270bd1
--- /dev/null
+++ b/node_modules/javascript-natural-sort/README.md
@@ -0,0 +1,76 @@
+### Simple numerics
+
+```javascript
+>>> ['10',9,2,'1','4'].sort(naturalSort)
+['1',2,'4',9,'10']
+```
+
+### Floats
+
+```javascript
+>>> ['10.0401',10.022,10.042,'10.021999'].sort(naturalSort)
+['10.021999',10.022,'10.0401',10.042]
+```
+
+### Float & decimal notation
+
+```javascript
+>>> ['10.04f','10.039F','10.038d','10.037D'].sort(naturalSort)
+['10.037D','10.038d','10.039F','10.04f']
+```
+
+### Scientific notation
+
+```javascript
+>>> ['1.528535047e5','1.528535047e7','1.528535047e3'].sort(naturalSort)
+['1.528535047e3','1.528535047e5','1.528535047e7']
+```
+
+### IP addresses
+
+```javascript
+>>> ['192.168.0.100','192.168.0.1','192.168.1.1'].sort(naturalSort)
+['192.168.0.1','192.168.0.100','192.168.1.1']
+```
+
+### Filenames
+
+```javascript
+>>> ['car.mov','01alpha.sgi','001alpha.sgi','my.string_41299.tif'].sort(naturalSort)
+['001alpha.sgi','01alpha.sgi','car.mov','my.string_41299.tif'
+```
+
+### Dates
+
+```javascript
+>>> ['10/12/2008','10/11/2008','10/11/2007','10/12/2007'].sort(naturalSort)
+['10/11/2007', '10/12/2007', '10/11/2008', '10/12/2008']
+```
+
+### Money
+
+```javascript
+>>> ['$10002.00','$10001.02','$10001.01'].sort(naturalSort)
+['$10001.01','$10001.02','$10002.00']
+```
+
+### Movie Titles
+
+```javascript
+>>> ['1 Title - The Big Lebowski','1 Title - Gattaca','1 Title - Last Picture Show'].sort(naturalSort)
+['1 Title - Gattaca','1 Title - Last Picture Show','1 Title - The Big Lebowski']
+```
+
+### By default - case-sensitive sorting
+
+```javascript
+>>> ['a', 'B'].sort(naturalSort);
+['B', 'a']
+```
+
+### To enable case-insensitive sorting
+```javascript
+>>> naturalSort.insensitive = true;
+>>> ['a', 'B'].sort(naturalSort);
+['a', 'B']
+```
diff --git a/node_modules/javascript-natural-sort/index.html b/node_modules/javascript-natural-sort/index.html
new file mode 100644
index 0000000..9c0bf7e
--- /dev/null
+++ b/node_modules/javascript-natural-sort/index.html
@@ -0,0 +1,100 @@
+<!DOCTYPE html>
+<html>
+<head>
+  <meta charset='utf-8'>
+
+  <title>overset/javascript-natural-sort @ GitHub</title>
+
+  <style type="text/css">
+    body {
+      margin-top: 1.0em;
+      background-color: #ffffff;
+      font-family: Helvetica, Arial, FreeSans, san-serif;
+      color: #000000;
+    }
+    #container {
+      margin: 0 auto;
+      width: 700px;
+    }
+    h1 { font-size: 3.8em; color: #000000; margin-bottom: 3px; }
+    h1 .small { font-size: 0.4em; }
+    h1 a { text-decoration: none }
+    h2 { font-size: 1.5em; color: #000000; }
+    h3 { text-align: center; color: #000000; }
+    a { color: #000000; }
+    .description { font-size: 1.2em; margin-bottom: 30px; margin-top: 30px; font-style: italic;}
+    .download { float: right; }
+    pre { background: #000; color: #fff; padding: 15px;}
+    hr { border: 0; width: 80%; border-bottom: 1px solid #aaa}
+    .footer { text-align:center; padding-top:30px; font-style: italic; }
+  </style>
+</head>
+
+<body>
+  <a href="https://github.com/overset/javascript-natural-sort"><img style="position: absolute; top: 0; right: 0; border: 0;" src="http://s3.amazonaws.com/github/ribbons/forkme_right_darkblue_121621.png" alt="Fork me on GitHub" /></a>
+
+  <div id="container">
+
+    <div class="download">
+      <a href="https://github.com/overset/javascript-natural-sort/zipball/master">
+        <img border="0" width="90" src="https://github.com/images/modules/download/zip.png"></a>
+      <a href="https://github.com/overset/javascript-natural-sort/tarball/master">
+        <img border="0" width="90" src="https://github.com/images/modules/download/tar.png"></a>
+    </div>
+
+    <h1><a href="https://github.com/overset/javascript-natural-sort">javascript-natural-sort</a>
+      <span class="small">by <a href="https://github.com/overset">overset</a></span></h1>
+
+    <div class="description">
+      A fast and lightweight function to be used in conjunction with the Array.sort() using the browser's default bubble sort. This will properly sort padded numbers, numbers preceding text, dates, floats, etc.
+    </div>
+
+    
+
+    
+
+    
+
+    
+      <h2>License</h2>
+      <p>MIT</p>
+    
+
+    
+      <h2>Authors</h2>
+      <p>Jim Palmer (jimpalmer@gmail.com)
<br/>      </p>
+    
+
+    
+      <h2>Contact</h2>
+      <p>Jim Palmer (jimpalmer@gmail.com)
<br/>      </p>
+    
+
+    <h2>Download</h2>
+    <p>
+      You can download this project in either
+      <a href="https://github.com/overset/javascript-natural-sort/zipball/master">zip</a> or
+      <a href="https://github.com/overset/javascript-natural-sort/tarball/master">tar formats.
+    </p>
+    <p>You can also clone the project with <a href="http://git-scm.com">Git</a>
+      by running:
+      <pre>$ git clone git://github.com/overset/javascript-natural-sort</pre>
+    </p>
+
+    <div class="footer">
+      get the source code on GitHub : <a href="https://github.com/overset/javascript-natural-sort">overset/javascript-natural-sort</a>
+    </div>
+
+  </div>
+
+<script type="text/javascript">
+var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
+document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
+</script>
+<script type="text/javascript">
+try {
+var pageTracker = _gat._getTracker("UA-87585-8");
+pageTracker._trackPageview();
+} catch(err) {}</script>"
+</body>
+</html>
diff --git a/node_modules/javascript-natural-sort/naturalSort.js b/node_modules/javascript-natural-sort/naturalSort.js
new file mode 100644
index 0000000..28dd64d
--- /dev/null
+++ b/node_modules/javascript-natural-sort/naturalSort.js
@@ -0,0 +1,45 @@
+/*
+ * Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license
+ * Author: Jim Palmer (based on chunking idea from Dave Koelle)
+ */
+/*jshint unused:false */
+module.exports = function naturalSort (a, b) {
+	"use strict";
+	var re = /(^([+\-]?(?:0|[1-9]\d*)(?:\.\d*)?(?:[eE][+\-]?\d+)?)?$|^0x[0-9a-f]+$|\d+)/gi,
+		sre = /(^[ ]*|[ ]*$)/g,
+		dre = /(^([\w ]+,?[\w ]+)?[\w ]+,?[\w ]+\d+:\d+(:\d+)?[\w ]?|^\d{1,4}[\/\-]\d{1,4}[\/\-]\d{1,4}|^\w+, \w+ \d+, \d{4})/,
+		hre = /^0x[0-9a-f]+$/i,
+		ore = /^0/,
+		i = function(s) { return naturalSort.insensitive && ('' + s).toLowerCase() || '' + s; },
+		// convert all to strings strip whitespace
+		x = i(a).replace(sre, '') || '',
+		y = i(b).replace(sre, '') || '',
+		// chunk/tokenize
+		xN = x.replace(re, '\0$1\0').replace(/\0$/,'').replace(/^\0/,'').split('\0'),
+		yN = y.replace(re, '\0$1\0').replace(/\0$/,'').replace(/^\0/,'').split('\0'),
+		// numeric, hex or date detection
+		xD = parseInt(x.match(hre), 16) || (xN.length !== 1 && x.match(dre) && Date.parse(x)),
+		yD = parseInt(y.match(hre), 16) || xD && y.match(dre) && Date.parse(y) || null,
+		oFxNcL, oFyNcL;
+	// first try and sort Hex codes or Dates
+	if (yD) {
+		if ( xD < yD ) { return -1; }
+		else if ( xD > yD ) { return 1; }
+	}
+	// natural sorting through split numeric strings and default strings
+	for(var cLoc=0, numS=Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {
+		// find floats not starting with '0', string or 0 if not defined (Clint Priest)
+		oFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;
+		oFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;
+		// handle numeric vs string comparison - number < string - (Kyle Adams)
+		if (isNaN(oFxNcL) !== isNaN(oFyNcL)) { return (isNaN(oFxNcL)) ? 1 : -1; }
+		// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'
+		else if (typeof oFxNcL !== typeof oFyNcL) {
+			oFxNcL += '';
+			oFyNcL += '';
+		}
+		if (oFxNcL < oFyNcL) { return -1; }
+		if (oFxNcL > oFyNcL) { return 1; }
+	}
+	return 0;
+};
diff --git a/node_modules/javascript-natural-sort/package.json b/node_modules/javascript-natural-sort/package.json
new file mode 100644
index 0000000..4b1bf07
--- /dev/null
+++ b/node_modules/javascript-natural-sort/package.json
@@ -0,0 +1,27 @@
+{
+  "name": "javascript-natural-sort",
+  "version": "0.7.1",
+  "description": "Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license",
+  "main": "naturalSort.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/Bill4Time/javascript-natural-sort.git"
+  },
+  "keywords": [
+    "natural",
+    "sort",
+    "javascript",
+    "array",
+    "sort",
+    "sorting"
+  ],
+  "author": "Jim Palmer (based on chunking idea from Dave Koelle, packaged by @khous of Bill4Time)",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/Bill4Time/javascript-natural-sort/issues"
+  },
+  "homepage": "https://github.com/Bill4Time/javascript-natural-sort"
+}
diff --git a/node_modules/javascript-natural-sort/speed-tests.html b/node_modules/javascript-natural-sort/speed-tests.html
new file mode 100644
index 0000000..090259b
--- /dev/null
+++ b/node_modules/javascript-natural-sort/speed-tests.html
@@ -0,0 +1,105 @@
+<!DOCTYPE html>
+<html>
+<head>
+<script src="naturalSort.js" type="text/javascript"></script>
+
+<script>
+
+/* Mike Grier's fixes on v0.2 http://mgrier.com/code/natsort.optimized.txt */
+function naturalSort2(a,b){
+	// setup temp-scope variables for comparison evauluation
+	var x = a.toString().toLowerCase() || '',
+	re=/(-?[0-9.]+)/g,
+	y = b.toString().toLowerCase() || '',
+	nC = String.fromCharCode(0),
+	xN = x.replace( re, nC + '$1' + nC ).split(nC),
+	yN = y.replace( re, nC + '$1' + nC ).split(nC),
+	xD = (new Date(x)).getTime(),yD;
+
+	if(xD) yD = (new Date(y)).getTime(); //no point in getting yD if xD is not a date
+
+	// natural sorting of dates
+	if(yD){ // we already checked if(xD), so if(yD), it's a date, too
+		if( xD < yD ) return -1;
+		else if( xD > yD ) return 1;
+	}
+
+	// natural sorting through split numeric strings and default strings
+	var cLoc, numS=Math.max(xN.length,yN.length);
+	for(cLoc=0; cLoc<numS; cLoc++){
+		// instead of performing these next 6 operations in the if
+		// and the same 6 operations in the else if, just do them once
+		// so we can reuse results instead of computing twice
+		xNcL = xN[cLoc]; // only look up values
+		yNcL = yN[cLoc]; // in arrays once
+		FxNcL = parseFloat(xNcL);
+		FyNcL = parseFloat(yNcL);
+		oFxNcL = FxNcL || xNcL;
+		oFyNcL = FyNcL || yNcL;
+
+		if(oFxNcL < oFyNcL)return -1;
+		else if(oFxNcL > oFyNcL)return 1;
+	}
+	return 0;
+}
+
+/*
+ * Natural Sort algorithm for Javascript
+ *	Version 0.3
+ * Author: Jim Palmer (based on chunking idea from Dave Koelle)
+ *	optimizations and safari fix by Mike Grier (mgrier.com)
+ * Released under MIT license.
+ */
+function naturalSort3(a, b){
+	// setup temp-scope variables for comparison evauluation
+	var re = /(-?[0-9\.]+)/g,
+		x = a.toString().toLowerCase() || '',
+		y = b.toString().toLowerCase() || '',
+		nC = String.fromCharCode(0),
+		xN = x.replace( re, nC + '$1' + nC ).split(nC),
+		yN = y.replace( re, nC + '$1' + nC ).split(nC),
+		xD = (new Date(x)).getTime(),
+		yD = xD ? (new Date(y)).getTime() : null;
+	// natural sorting of dates
+	if ( yD )
+		if ( xD < yD ) return -1;
+		else if ( xD > yD )	return 1;
+	// natural sorting through split numeric strings and default strings
+	for( var cLoc = 0, numS = Math.max(xN.length, yN.length); cLoc < numS; cLoc++ ) {
+		oFxNcL = parseFloat(xN[cLoc]) || xN[cLoc];
+		oFyNcL = parseFloat(yN[cLoc]) || yN[cLoc];
+		if (oFxNcL < oFyNcL) return -1;
+		else if (oFxNcL > oFyNcL) return 1;
+	}
+	return 0;
+}
+
+var a = [], b = [], c = [];
+for ( var i = 0; i < 1000; i++ ) {
+	a.push(String.fromCharCode( Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65 ));
+	b.push(String.fromCharCode( Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65 ));
+	c.push(String.fromCharCode( Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65 ));
+}
+for ( i = 0; i < 1000; i++ ) {
+	a.push(Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() );
+	b.push(Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() );
+	c.push(Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() );
+}
+for ( i = 0; i < 1000; i++ ) {
+	a.push( (Math.floor(Math.random() * 12) + 1).toString() + '/' + (Math.floor(Math.random() * 28) + 1).toString() + '/' + ( 2009 - Math.floor(Math.random() * 2)) );
+	b.push( (Math.floor(Math.random() * 12) + 1).toString() + '/' + (Math.floor(Math.random() * 28) + 1).toString() + '/' + ( 2009 - Math.floor(Math.random() * 2)) );
+	c.push( (Math.floor(Math.random() * 12) + 1).toString() + '/' + (Math.floor(Math.random() * 28) + 1).toString() + '/' + ( 2009 - Math.floor(Math.random() * 2)) );
+}
+
+var d = new Date();
+document.write(a.sort(naturalSort)[0] + ' <BR>[' + ((new Date()).getTime() - d.getTime()) + 'ms]<BR><BR>');
+//d = new Date();
+//document.write(b.sort(naturalSort2)[0] + ' <BR>[' + ((new Date()).getTime() - d.getTime()) + 'ms]<BR><BR>');
+//d = new Date();
+//document.write(c.sort(naturalSort3)[0] + ' <BR>[' + ((new Date()).getTime() - d.getTime()) + 'ms]');
+
+</script>
+<style>*{font-family:tahoma;font-size:9px;}</style>
+</head>
+<body></body>
+</html>
diff --git a/node_modules/javascript-natural-sort/unit-tests.html b/node_modules/javascript-natural-sort/unit-tests.html
new file mode 100644
index 0000000..7b11540
--- /dev/null
+++ b/node_modules/javascript-natural-sort/unit-tests.html
@@ -0,0 +1,365 @@
+<!DOCTYPE html>
+<html>
+<head>
+	<title>js-naturalsort test suite</title>
+	<script src='http://code.jquery.com/jquery-latest.js'></script>
+	<link rel='stylesheet' href='http://code.jquery.com/qunit/git/qunit.css' type='text/css' media='screen' />
+	<script type='text/javascript' src='http://code.jquery.com/qunit/git/qunit.js'></script>
+	<script src='naturalSort.js' type='text/javascript'></script>
+	<script type='text/javascript'>
+	$(function () {
+		test('different values types', function () {
+			wrapTest(
+				['a',1],
+				[1,'a'],
+				'number always comes first');
+			wrapTest(
+				['1',1],
+				['1',1],
+				'number vs numeric string - should remain unchanged (error in chrome)');
+			wrapTest(
+				['02',3,2,'01'],
+				['01','02',2,3],
+				'padding numeric string vs number');
+		});
+		test('datetime', function () {
+			wrapTest(
+				['10/12/2008','10/11/2008','10/11/2007','10/12/2007'],
+				['10/11/2007','10/12/2007','10/11/2008','10/12/2008'],
+				'similar dates');
+			wrapTest(
+				['01/01/2008','01/10/2008','01/01/1992','01/01/1991'],
+				['01/01/1991','01/01/1992','01/01/2008','01/10/2008'],
+				'similar dates');
+			wrapTest(
+				[
+					'Wed Jan 01 2010 00:00:00 GMT-0800 (Pacific Standard Time)',
+					'Thu Dec 31 2009 00:00:00 GMT-0800 (Pacific Standard Time)',
+					'Wed Jan 01 2010 00:00:00 GMT-0500 (Eastern Standard Time)'
+				],[
+					'Thu Dec 31 2009 00:00:00 GMT-0800 (Pacific Standard Time)',
+					'Wed Jan 01 2010 00:00:00 GMT-0500 (Eastern Standard Time)',
+					'Wed Jan 01 2010 00:00:00 GMT-0800 (Pacific Standard Time)'
+				], 'javascript toString(), different timezones');
+			wrapTest(
+				[
+					'Saturday, July 3, 2010',
+					'Monday, August 2, 2010',
+					'Monday, May 3, 2010'
+				],[
+					'Monday, May 3, 2010',
+					'Saturday, July 3, 2010',
+					'Monday, August 2, 2010'
+				], 'Date.toString(), Date.toLocaleString()');
+			wrapTest(
+				[
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 3 May 2010 17:45:30 GMT',
+					'Mon, 15 Jun 2009 17:45:30 GMT'
+				],[
+					'Mon, 15 Jun 2009 17:45:30 GMT',
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 3 May 2010 17:45:30 GMT'
+				], 'Date.toUTCString()');
+			wrapTest(
+				[
+					'Saturday, July 3, 2010 1:45 PM',
+					'Saturday, July 3, 2010 1:45 AM',
+					'Monday, August 2, 2010 1:45 PM',
+					'Monday, May 3, 2010 1:45 PM'
+				],[
+					'Monday, May 3, 2010 1:45 PM',
+					'Saturday, July 3, 2010 1:45 AM',
+					'Saturday, July 3, 2010 1:45 PM',
+					'Monday, August 2, 2010 1:45 PM'
+				], '');
+			wrapTest(
+				[
+					'Saturday, July 3, 2010 1:45:30 PM',
+					'Saturday, July 3, 2010 1:45:29 PM',
+					'Monday, August 2, 2010 1:45:01 PM',
+					'Monday, May 3, 2010 1:45:00 PM'
+				],[
+					'Monday, May 3, 2010 1:45:00 PM',
+					'Saturday, July 3, 2010 1:45:29 PM',
+					'Saturday, July 3, 2010 1:45:30 PM',
+					'Monday, August 2, 2010 1:45:01 PM'
+				], '');
+			wrapTest(
+				[
+					'2/15/2009 1:45 PM',
+					'1/15/2009 1:45 PM',
+					'2/15/2009 1:45 AM'
+				],[
+					'1/15/2009 1:45 PM',
+					'2/15/2009 1:45 AM',
+					'2/15/2009 1:45 PM'
+				], '');
+			wrapTest(
+				[
+					'2010-06-15T13:45:30',
+					'2009-06-15T13:45:30',
+					'2009-06-15T01:45:30.2',
+					'2009-01-15T01:45:30'
+				],[
+					'2009-01-15T01:45:30',
+					'2009-06-15T01:45:30.2',
+					'2009-06-15T13:45:30',
+					'2010-06-15T13:45:30'
+				], 'ISO8601 Dates');
+			wrapTest(
+				[
+					'2010-06-15 13:45:30',
+					'2009-06-15 13:45:30',
+					'2009-01-15 01:45:30'
+				],[
+					'2009-01-15 01:45:30',
+					'2009-06-15 13:45:30',
+					'2010-06-15 13:45:30'
+				], 'ISO8601-ish YYYY-MM-DDThh:mm:ss - which does not parse into a Date instance');
+			wrapTest(
+				[
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 15 Jun 2009 20:45:30 PDT',
+					'Mon, 15 Jun 2009 20:45:30 EST',
+				],[
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 15 Jun 2009 20:45:30 EST',
+					'Mon, 15 Jun 2009 20:45:30 PDT'
+				], 'RFC1123 testing different timezones');
+			wrapTest(
+				[
+					'1245098730000',
+					'14330728000',
+					'1245098728000'
+				],[
+					'14330728000',
+					'1245098728000',
+					'1245098730000'
+				], 'unix epoch, Date.getTime()');
+		});
+		test('version number strings', function () {
+			wrapTest(
+				['1.0.2','1.0.1','1.0.0','1.0.9'],
+				['1.0.0','1.0.1','1.0.2','1.0.9'],
+				'close version numbers');
+			wrapTest(
+				['1.0.03','1.0.003','1.0.002','1.0.0001'],
+				['1.0.0001','1.0.002','1.0.003','1.0.03'],
+				'multi-digit branch release');
+			wrapTest(
+				['1.1beta','1.1.2alpha3','1.0.2alpha3','1.0.2alpha1','1.0.1alpha4','2.1.2','2.1.1'],
+				['1.0.1alpha4','1.0.2alpha1','1.0.2alpha3','1.1.2alpha3','1.1beta','2.1.1','2.1.2'],
+				'close version numbers');
+			wrapTest(
+				['myrelease-1.1.3','myrelease-1.2.3','myrelease-1.1.4','myrelease-1.1.1','myrelease-1.0.5'],
+				['myrelease-1.0.5','myrelease-1.1.1','myrelease-1.1.3','myrelease-1.1.4','myrelease-1.2.3'],
+				'string first');
+		});
+		test('numerics', function () {
+			wrapTest(
+				['10',9,2,'1','4'],
+				['1',2,'4',9,'10'],
+				'string vs number');
+			wrapTest(
+				['0001','002','001'],
+				['0001','001','002'],
+				'0 left-padded numbers');
+			wrapTest(
+				[2,1,'1','0001','002','02','001'],
+				['0001','001','002','02',1,'1',2],
+				'0 left-padded numbers and regular numbers');
+			wrapTest(
+				['10.0401',10.022,10.042,'10.021999'],
+				['10.021999',10.022,'10.0401',10.042],
+				'decimal string vs decimal, different precision');
+			wrapTest(
+				['10.04',10.02,10.03,'10.01'],
+				['10.01',10.02,10.03,'10.04'],
+				'decimal string vs decimal, same precision');
+			wrapTest(
+				['10.04f','10.039F','10.038d','10.037D'],
+				['10.037D','10.038d','10.039F','10.04f'],
+				'float/decimal with \'F\' or \'D\' notation');
+			wrapTest(
+				['10.004Z','10.039T','10.038ooo','10.037g'],
+				['10.004Z','10.037g','10.038ooo','10.039T'],
+				'not foat/decimal notation');
+			wrapTest(
+				['1.528535047e5','1.528535047e7','1.52e15','1.528535047e3','1.59e-3'],
+				['1.59e-3','1.528535047e3','1.528535047e5','1.528535047e7','1.52e15'],
+				'scientific notation');
+			wrapTest(
+				['-1','-2','4','-3','0','-5'],
+				['-5','-3','-2','-1','0','4'],
+				'negative numbers as strings');
+			wrapTest(
+				[-1,'-2',4,-3,'0','-5'],
+				['-5',-3,'-2',-1,'0',4],
+				'negative numbers as strings - mixed input type, string + numeric');
+			wrapTest(
+				[-2.01,-2.1,4.144,4.1,-2.001,-5],
+				[-5,-2.1,-2.01,-2.001,4.1,4.144],
+				'negative floats - all numeric');
+		});
+		test('IP addresses', function () {
+			wrapTest(
+				[
+					'192.168.0.100',
+					'192.168.0.1',
+					'192.168.1.1',
+					'192.168.0.250',
+					'192.168.1.123',
+					'10.0.0.2',
+					'10.0.0.1'
+				],
+				[
+					'10.0.0.1',
+					'10.0.0.2',
+					'192.168.0.1',
+					'192.168.0.100',
+					'192.168.0.250',
+					'192.168.1.1',
+					'192.168.1.123'
+				]);
+		});
+		test('filenames', function () {
+			wrapTest(
+				['img12.png','img10.png','img2.png','img1.png'],
+				['img1.png','img2.png','img10.png','img12.png'],
+				'simple image filenames');
+			wrapTest(
+				['car.mov','01alpha.sgi','001alpha.sgi','my.string_41299.tif','organic2.0001.sgi'],
+				['001alpha.sgi','01alpha.sgi','car.mov','my.string_41299.tif','organic2.0001.sgi'],
+				'complex filenames');
+			wrapTest([
+					'./system/kernel/js/01_ui.core.js',
+					'./system/kernel/js/00_jquery-1.3.2.js',
+					'./system/kernel/js/02_my.desktop.js'
+				],[
+					'./system/kernel/js/00_jquery-1.3.2.js',
+					'./system/kernel/js/01_ui.core.js',
+					'./system/kernel/js/02_my.desktop.js'
+				], 'unix filenames');
+		});
+		test('space(s) as first character(s)', function () {
+			wrapTest(
+				['alpha',' 1','  3',' 2',0],
+				[0,' 1',' 2','  3','alpha']);
+		});
+		test('empty strings and space character', function () {
+			wrapTest(
+				['10023','999','',2,5.663,5.6629],
+				['',2,5.6629,5.663,'999','10023']);
+			wrapTest(
+				[0,'0',''],
+				[0,'0','']);
+		});
+		test('hex', function () {
+			wrapTest(
+				[ '0xA','0x9','0x99' ],
+				[ '0x9','0xA','0x99'],
+				'real hex numbers');
+			wrapTest(
+				[ '0xZZ','0xVVV','0xVEV','0xUU' ],
+				[ '0xUU','0xVEV','0xVVV','0xZZ' ],'fake hex numbers');
+		});
+		test('unicode', function () {
+			wrapTest(
+				[ '\u0044', '\u0055', '\u0054', '\u0043' ],
+				[ '\u0043', '\u0044', '\u0054', '\u0055' ],
+				'basic latin');
+		});
+		test('sparse array sort', function () {
+			var sarray = [3, 2]
+			sarrayOutput = [1, 2, 3];
+			sarray[10] = 1;
+			for (var i=0; i < 8; i++)
+				sarrayOutput.push(undefined);
+			wrapTest(sarray, sarrayOutput,'simple sparse array');
+		});
+		test('case insensitive support', function () {
+			naturalSort.insensitive = true;
+			wrapTest(
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				'case sensitive pre-sorted array');
+			wrapTest(
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				'case sensitive un-sorted array');
+			naturalSort.insensitive = false;
+			wrapTest(
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				'case sensitive pre-sorted array');
+			wrapTest(
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				'case sensitive un-sorted array');
+		});
+		test('contributed tests', function () {
+			wrapTest(
+				['T78','U17','U10','U12','U14','745','U7','01','485','S16','S2','S22','1081','S25','1055','779','776','771','44','4','87','1091','42','480','952','951','756','1000','824','770','666','633','619','1','991','77H','PIER-7','47','29','9','77L','433'],
+				['01','1','4','9','29','42','44','47','77H','77L','87','433','480','485','619','633','666','745','756','770','771','776','779','824','951','952','991','1000','1055','1081','1091','PIER-7','S2','S16','S22','S25','T78','U7','U10','U12','U14','U17'],
+				'contributed by Bob Zeiner');
+			wrapTest(
+				[
+					'FSI stop, Position: 5',
+					'Mail Group stop, Position: 5',
+					'Mail Group stop, Position: 5',
+					'FSI stop, Position: 6',
+					'FSI stop, Position: 6',
+					'Newsstand stop, Position: 4',
+					'Newsstand stop, Position: 4',
+					'FSI stop, Position: 5'
+				],[
+					'FSI stop, Position: 5',
+					'FSI stop, Position: 5',
+					'FSI stop, Position: 6',
+					'FSI stop, Position: 6',
+					'Mail Group stop, Position: 5',
+					'Mail Group stop, Position: 5',
+					'Newsstand stop, Position: 4',
+					'Newsstand stop, Position: 4'
+				],'contributed by Scott');
+		wrapTest(
+			[2, 10, 1, 'azd', undefined, 'asd'],
+			[1, 2, 10, 'asd', 'azd', undefined],
+			'issue #2 - undefined support - jarvinen pekka');
+		wrapTest(
+			[undefined, undefined, undefined, 1, undefined],
+			[1, undefined, undefined, undefined],
+			'issue #2 - undefined support - jarvinen pekka');
+		wrapTest(
+			['-1', '-2', '4', '-3', '0', '-5'],
+			['-5', '-3', '-2', '-1', '0', '4'],
+			'issue #3 - invalid numeric string sorting - guilermo.dev');
+		naturalSort.insensitive = true;
+		wrapTest(
+			['9','11','22','99','A','aaaa','bbbb','Aaaa','aAaa','aa','AA','Aa','aA','BB','bB','aaA','AaA','aaa'],
+			['9', '11', '22', '99', 'A', 'aa', 'AA', 'Aa', 'aA', 'aaA', 'AaA', 'aaa', 'aaaa', 'Aaaa', 'aAaa', 'BB', 'bB', 'bbbb'],
+			'issue #5 - invalid sort order - Howie Schecter');
+		naturalSort.insensitive = false;
+		wrapTest(
+			['9','11','22','99','A','aaaa','bbbb','Aaaa','aAaa','aa','AA','Aa','aA','BB','bB','aaA','AaA','aaa'],
+			['9', '11', '22', '99', 'A', 'AA', 'Aa', 'AaA', 'Aaaa', 'BB', 'aA', 'aAaa', 'aa', 'aaA', 'aaa', 'aaaa', 'bB', 'bbbb'],
+			'issue #5 - invalid sort order - Howie Schecter');
+		wrapTest(
+			['5D','1A','2D','33A','5E','33K','33D','5S','2C','5C','5F','1D','2M'],
+			['1A','1D','2C','2D','2M','5C','5D','5E','5F','5S','33A','33D','33K'],
+			'alphanumeric - number first');
+		});
+	});
+	function wrapTest(origArray, sortArray, message) {
+		deepEqual($.extend([], origArray).sort(naturalSort), sortArray, (message ? message + ' - ' : '') + QUnit.jsDump.parse(origArray));
+	}
+	</script>
+</head>
+<body>
+	<h1 id='qunit-header'>js-naturalsort test suite</h1>
+	<h2 id='qunit-banner'></h2>
+	<h2 id='qunit-userAgent'></h2>
+	<ol id='qunit-tests' />
+</body>
+</html>
diff --git a/node_modules/mathjs/CONTRIBUTING.md b/node_modules/mathjs/CONTRIBUTING.md
new file mode 100644
index 0000000..4478db6
--- /dev/null
+++ b/node_modules/mathjs/CONTRIBUTING.md
@@ -0,0 +1,23 @@
+## Contributing
+
+Contributions to the math.js library are very welcome! We can't do this alone.
+You can contribute in different ways: spread the word, report bugs, come up with
+ideas and suggestions, and contribute to the code.
+
+There are a few preferences regarding code contributions:
+
+- The code of math.js follows the JavaScript Standard Style as described on https://standardjs.com/.
+- Make sure you properly unit test your changes.
+- Before creating a pull request, run the unit tests to make sure they all pass.
+- Only commit changes done in the source files under `src`, not to the generated builds
+  which are located in the folders `dist` and `lib`.
+- Send pull requests to the `develop` branch, not the `master` branch.
+
+What can I do?
+
+- Search through the [issues](https://github.com/josdejong/mathjs/issues) looking
+  for something that looks interesting to you to pick up. Some issues are marked
+  ["help wanted"](https://github.com/josdejong/mathjs/issues?q=is%3Aissue+is%3Aopen+label%3A%22help+wanted%22),
+  these are typically issues which should be relatively easy to pick up.
+
+Thanks!
diff --git a/node_modules/mathjs/HISTORY.md b/node_modules/mathjs/HISTORY.md
new file mode 100644
index 0000000..9374900
--- /dev/null
+++ b/node_modules/mathjs/HISTORY.md
@@ -0,0 +1,2574 @@
+# History
+
+
+# 2022-04-08, version 10.4.3
+
+- Fix #2508: improve the precision of stirlingS2 (#2509). Thanks @gwhitney.
+- Fix #2514: implement optional argument `base` in the number implementation
+  of function `log` (#2515). Thanks @gwhitney.
+- Improve the documentation on operator `;` (#2512). Thanks @gwhitney.
+
+
+# 2022-03-29, version 10.4.2
+
+- Fix #2499: different behavior for unit conversion "degC" and "K" (#2501).
+  Also disables getting the sign for units with an offset, which is ambiguous. 
+  Thanks @gwhitney.
+- Fix #2503: fix an issue in `log()` for complex numbers in which the imaginary
+  part is much larger in absolute value than the real part, fixed in 
+  `complex.js@2.1.0` (#2505), thanks @gwhitney, @infusion.
+- Fix #2493: unclear error message when an entity that is not a function
+  is being called as a function (#2494). Thanks @gwhitney.
+- Some fixes in the docs on units (#2498). Thanks @dvd101x.
+- Add `forEach` example in embedded docs (#2507). Thanks @dvd101x.
+- Correct approx.deepEqual() to accept an epsilon argument giving the
+  comparison tolerance. It was already being called this way, but was
+  silently ignoring the tolerance. Thanks @yifanwww.
+
+
+# 2022-03-23, version 10.4.1
+
+- Improve TypeScript definitions for function `unit` (#2479). 
+  Thanks @SinanAkkoyun.
+- Add tests for type declarations (#2448). Thanks @samestep.
+- Further improvement to TypeScript definitions of `std` and `variance`
+  (make dimension parameter optional, #2474). Thanks @NattapongSiri.
+- Next step (as per #2431) for full publication of "is" functions like
+  `isMatrix` etc: Provide TypeScript definitions of "is" functions and
+  make them type guards. (#2432). Thanks @ChristopherChudzicki.
+- Fix #2491: Multi line object expressions don't work with comments (#2492).
+  Thanks @gwhitney.
+- Fix #2478: a bug in calculating the eigenvectors when dealing with complex
+  numbers (#2496). Thanks @gwhitney.
+- Update project dependencies and devDependencies.
+
+
+# 2022-03-07, version 10.4.0
+
+- Fix #2461: make sure `simplifyCore` recurses over all binary nodes (#2462).
+  Thanks @gwhitney.
+- Fix #2429: fix the TypeScript definitions of functions `std` and `variance`
+  (#2455). Thanks @NattapongSiri.
+- Fix #1633: implement a `cumsum` function generating cumulative sums of a list
+  of values or a matrix. (#1870). Thanks @hjonasson.
+- Upgrade to the latest version of `Fraction.js`, having more strict input, 
+  only accepting an integer numerator and denominator. See #2427.
+- Fix typo in documentation example for `format`. (#2468) Thanks @abranhe.
+- Write unit tests for all jsdoc examples. See #2452. Thanks @gwhitney. 
+
+
+# 2021-03-02, version 10.3.0
+
+- Fix #1260: implement function `symbolicEqual` (#2424). Thanks @gwhitney.
+- Fix #2441, #2442: support passing a function as argument to functions created
+  in the expression parser (#2443). Thanks @gwhitney.
+- Fix #2325: improve documentation of subset indices (#2446). Thanks @gwhitney.
+- Fix #2439: fix a bug in `complexEigs` in which real-valued norms were 
+  inadvertently being typed as complex numbers (#2445). Thanks @gwhitney.
+- Fix #2436: improve documentation and error message of function `map` (#2457).
+  Thanks @gwhitney.
+
+
+# 2022-03-01, version 10.2.0
+
+- Implemented context options to control simplifications allowed in `simplify`, 
+  see #2399, #2391. Thanks @gwhitney.
+- Implemented function `leafCount` as a first simple measure of the complexity 
+  of an expression, see #2411, #2389. Thanks @gwhitney.
+- Fix #2413: improve `combinations` to return an integer result without rounding
+  errors for larger values, see #2414. Thanks @gwhitney.
+- Fix #2385: function `rotate` missing in TypeScript definitions. 
+  Thanks @DIVYA-19.
+- Fix #2450: Add BigNumber to parameter type in `math.unit` and add TypeScript
+  types for `Unit.simplify` and `Unit.units` (#2353). Thanks @joshhansen.
+- Fix #2383: detect infinite loops in `simplify` (#2405). Thanks @gwhitney.
+- Fix #1423: collect like factors and cancel like terms in sums (#2388). 
+  Thanks @gwhitney.
+
+
+# 2022-02-02, version 10.1.1
+
+- Improvements and fixes in function `simplify`, thanks @gwhitney:
+  - Fix #2393: regression bug in `simplify('2-(x+1)')`.
+  - Ad option `consoleDebug` to `simplify` to see what is going on.
+- Fix TypeScript definition of `ConfigOptions`, which was missing option 
+  `predictable`.
+
+
+# 2022-01-15, version 10.1.0
+
+- Implemented function `invmod`, see #2368, #1744. Thanks @thetazero.
+- Improvements and fixes in function `simplify`, thanks @gwhitney:
+  - Fix #1179, #1290: improve collection of non-constant like terms (#2384).
+  - Fix #2152: do not transform strings into numbers (#2372).
+  - Fix #1913: implement support for array and object simplification (#2382).
+- Fix #2379: add embedded documentation for function `print`.
+- Remove broken example from the embedded documentation of function `forEach`.
+
+
+# 2021-12-29, version 10.0.2
+
+- Fix #2156: simplify expressions like `-1 / (-x)` to `1/x`. Thanks @ony3000.
+- Fix #2363: remove a redundant part of the regex to split a number.
+- Fix #2291: add support for fractions in function `intersect`. 
+  Thanks @thetazero.
+- Fix #2358: bug in `SparseMatrix` when replacing a subset of a matrix with
+  a non-consecutive index. Thanks @Al-0.
+
+
+# 2021-12-22, version 10.0.1
+
+- Fix #1681: function `gamma` giving inaccurate complex results in some cases.
+  Thanks @kmdrGroch.
+- Fixed a typo in an example, see #2366. Thanks @blackwindforce.
+
+
+# 2021-11-03, version 10.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES IN THE TYPESCRIPT DEFINITIONS !!!
+
+- Improvements to the Typescript typings (commit fc5c202e). 
+  Thanks @joshhansen. First introduced in v9.5.1, but reverted because
+  it contains breaking changes.
+  
+  Breaking changes: interface `MathNode` is now renamed to `MathNodeCommon`
+  and the related interfaces are structured in a different way.
+
+- Fixed a typo in the TypeScript definition of toHTML. Thanks @TheToto.
+
+
+# 2021-11-03, version 9.5.2`
+
+- Revert the improvements to the Typescript typings because they contain
+  breaking changes. The improvements will be published in v10.0.0. See #2339.
+
+
+# 2021-10-13, version 9.5.1
+
+- Various improvements to the Typescript typings. 
+  Thanks @joshhansen and @DianaTdr.
+
+
+# 2021-09-22, version 9.5.0
+
+- Implemented support for calculations with percentage, see #2303. 
+  Thanks @rvramesh.
+- Fix #2319: make the API of `Parser.evaluate` consistent with `math.evaluate`: 
+  support a list with expressions as input.
+- Improved documentation of function `setCartesian`. Thanks @fieldfoxWim.
+
+
+# 2021-09-15, version 9.4.5
+
+- Improved the performance of `Node.equals` by improving the internal 
+  function `deepStrictEqual`. Thanks @tomlarkworthy.
+- Fixes in the TypeScript definitions:
+  - Define `hasNumericValue`. Thanks @write2kcl. 
+  - Define `MathNode.isRelationalNode`. Thanks @m93a.
+  - Fix typo in `MathNode.isConditionalNode`. Thanks @m93a.
+
+
+# 2021-07-07, version 9.4.4
+
+- Fixed `ArrayNode.toTex()`: remove the row delimiter on the last row, 
+  see #2267. Thanks @davidtranhq.
+- Fix #2269: `intersect`  not returning `null` for matrix input. Thanks @m93a.
+- Fix #2245: mathjs not working in IE11 anymore due to a missing polyfill for
+  `Symbol`. The browser bundle now includes the necessary polyfills (it is 
+  larger now because of that, see also #2266). Thanks @m93a.
+- Update dependencies (`complex.js@2.0.15`, `decimal.js@10.3.1`)
+- Drop official support for node.js 10, which has reached end of life. 
+  See #2258.
+
+
+# 2021-06-23, version 9.4.3
+
+- Fix #2222: mathjs polluting the `Decimal` prototype. Thanks @m93a.
+- Fix #2253: expression parser throwing an error when accessing nested object
+  properties named `e`.
+- Fixes in the TypeScript definitions:
+  - function `floor`, #2159, #2246. Thanks @write2kcl.
+  - function `simplify`, see #2252. Thanks @nitroin. 
+- Upgraded to `decimal.js@10.3.0`
+
+
+# 2021-06-05, version 9.4.2
+
+- Implemented iterative eigenvalue finder for `eigs`, making it much more 
+  robust. See #2179, #2237. Thanks @m93a.
+- Improved TypeScript definitions of function `parse`. Thanks @OpportunityLiu.
+
+
+# 2021-05-24, version 9.4.1
+
+- Fix #2100: add TypeScript declaration for `eigs`. Thanks @andrebianchessi.
+- Fix #2220: add TypeScript files to published npm package. Thanks @dhritzkiv.
+- Update readme regarding TypeScript definition files. Thanks @dhritzkiv.
+- Update to `fraction.js@4.1.1`
+
+
+# 2021-05-16, version 9.4.0
+
+- Implemented support to use objects with a `Map` interface as scope, 
+  see #2143, #2166. Thanks @jhugman.
+- Extend `eigs` to support general complex matrices, see #1741. Thanks @m93a.
+- DenseMatrix and SparseMatrix are now iterable, see #1184. Thanks @m93a.
+- Implemented utility functions `matrixFromRows`, `matrixFromColumns`, and 
+  `matrixFromFunction`, see #2155, #2153. Thanks @m93a.
+- Added TypeScript definitions to the project, making it redundant to install
+  `@types/mathjs`, and making it easier to improve the definitions. See #2187, 
+  #2192. Thanks @CatsMiaow.
+- Upgraded dependencies
+  - `complex.js@2.0.13` (fixing #2211). Thanks @infusion
+  - `fraction.js@4.1.0` (`pow` now supporting rational exponents).
+- Fix #2174: function `pickRandom` having no name. Thanks @HK-SHAO.
+- Fix #2019: VSCode auto import keeps adding import { null } from 'mathjs'.
+- Fix #2185: Fix TypeScript definition of unit division, which can also return 
+  a number.
+- Fix #2123: add type definitions for functions `row` and `column`.
+- Fix some files not exposed in the package, see #2213. Thanks @javiermarinros.
+
+
+# 2021-04-12, version 9.3.2
+
+- Fix #2169: mathjs requesting `@babel/runtime` dependency. 
+  Regression introduced in `v9.3.1`.
+
+
+# 2021-04-10, version 9.3.1
+
+- Fix #2133: strongly improved the performance of `isPrime`, see #2139. 
+  Thanks @Yaffle.
+- Fix #2150: give a clear error "Error: Undefined function ..." instead when
+  evaluating a non-existing function.
+- Fix #660: expose internal functions `FunctionNode.onUndefinedFunction(name)` 
+  and `SymbolNode.onUndefinedSymbol(name)`, allowing to override the behavior.
+  By default, an Error is thrown.
+
+
+# 2021-03-10, version 9.3.0
+
+- Implemented support for parsing non decimal numbers with radix point,
+  see #2122, #2121. Thanks @clnhlzmn.
+- Fix #2128: typo in docs of `luSolveAll` and `usolveAll`.
+
+
+# 2021-02-03, version 9.2.0
+
+- Implemented function `count` to count the total elements in a matrix, 
+  see #2085. Thanks @Josef37.
+- Fix #2096: cleanup old reference to external dependency `crypto`.
+- Some refactoring in the code to remove duplications, see #2093. 
+  Thanks @Josef37.
+
+
+# 2021-01-27, version 9.1.0
+
+- Extended function `reshape` with support for a wildcard `-1` to automatically
+  calculate the remaining size, like `reshape([1, 2, 3, 4, 5, 6], [-1, 2])` 
+  which will output `[[0, 1], [2, 3], [4, 5]]`. See #2075. Thanks @Josef37.
+- Fix #2087: function `simplify` ignores second argument of `log`, for example
+  in `simplify('log(e, 9)')` . Thanks @quentintruong.
+
+
+# 2021-01-16, version 9.0.0
+
+- Improved support for bin, hex, and oct literals. See #1996. Thanks @clnhlzmn.
+  - **Breaking change**: parse literals with prefixes `0b`, `0c`, and `0x` are  
+    now unsigned by default. To parse them as signed, you have to specify a
+    suffix specifying the word size such as `i16` or `i32`.
+  - Function `format` now supports more notations: `bin`, 'hex', and `oct`,
+    for example `format(255, {notation: "hex"})`.
+  - The functions `format`, `bin`, `hex`, `oct` now allow specifying a wordSize, 
+    like `bin(10, 32)` and `format(10, {notation: "bin", wordSize: 32})`.
+  - BigNumber support for the bin, hex, and oct literals. 
+- Extended and improved the example rocket_trajectory_optimization.html.
+  Thanks @Josef37.
+
+
+# 2020-12-30, version 8.1.1
+
+- Improved the performance of parsing and evaluating units a lot, see #2065. 
+  Thanks @flaviut.
+- Upgraded dependency `fraction.js` to `v4.0.13`. 
+- Moved continuous integration testing from Travis CI to Github Workflow, 
+  see #2024, #2041. Thanks @harrysarson.
+
+
+# 2020-12-04, version 8.1.0
+
+- Implemented units `kilogramforce` (`kgf`). Thanks @rnd-debug.
+- Fix #2026: Implement a new option `fractionsLimit` for function `simplify`, 
+  defaulting to `Infinity`.
+- Improved the documentation of function `clone`. Thanks @redbar0n.
+
+
+# 2020-11-09, version 8.0.1
+
+- Fix #1979: missing "subset" dependency when using "mathjs/number" entry point.
+- Fix #2022: update pretty printing with MathJax example to the latest version 
+  of MathJax. Thanks @pkra.
+
+
+# 2020-11-06, version 8.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+- You can now use mathjs directly in node.js using ES modules without need for 
+  a transpiler (see #1928, #1941, #1962). 
+  Automatically loading either commonjs code or ES modules code is improved.
+  All generated code is moved under `/lib`: the browser bundle is moved from 
+  `/dist` to `/lib/browser`, ES module files are moved to `/lib/esm`, 
+  and commonjs files are moved to `/lib/cjs`. Thanks @GreenImp.
+- Non-minified bundle `dist/math.js` is no longer provided. Either use the
+  minified bundle, or create a bundle yourself.
+- Replaced random library `seed-random` with `seedrandom`, see #1955. 
+  Thanks @poppinlp.
+- Breaking changes in `pickRandom`, see #1990, #1976.
+  - Will no longer return the input matrix when the given number is greater 
+    than the length of the provided possibles. Instead, the function always
+    returns results with the requested number of picks.
+  - Will now return a `Matrix` as output when input was a `Matrix`.
+  - Introduced a new syntax:
+    
+    ```
+    math.pickRandom(array, { weights, number, elementWise })
+    ```
+  - Introduced a new option `elementWise`, which is `true` by default. 
+    When setting `elementWise` to false, an array containing arrays will return
+    random pick of arrays instead of the elements inside of the nested arrays.
+
+
+# 2020-11-02, version 7.6.0
+
+- Implemented function `rotate(w, theta)`. See #1992, #1160. Thanks @rnd-debug. 
+- Implemented support for custom characters in Units via `Unit.isValidAlpha`. 
+  See #1663, #2000. Thanks @rnd-debug.
+
+
+# 2020-10-10, version 7.5.1
+
+- Fix object pollution vulnerability in `math.config`. Thanks Snyk.
+
+
+# 2020-10-07, version 7.5.0
+
+- Function `pickRandom` now allows randomly picking elements from matrices 
+  with 2 or more dimensions instead of only from a vector, see #1974.
+  Thanks @KonradLinkowski.
+
+
+# 2020-10-07, version 7.4.0
+
+- Implemented support for passing a precision in functions `ceil`, `floor`, 
+  and `fix`, similar to `round`, see #1967, #1901. Thanks @rnd-debug.
+- Implemented function `rotationMatrix`, see #1160, #1984. Thanks @rnd-debug.
+- Implement a clear error message when using `sqrtm` with a matrix having 
+  more than two dimensions. Thanks @KonradLinkowski.
+- Update dependency `decimal.js` to `10.2.1`.
+
+
+# 2020-09-26, version 7.3.0
+
+- Implemented functions `usolveAll` and `lsolveAll`, see #1916. Thanks @m93a.
+- Implemented support for units in functions `std` and `variance`, see #1950. 
+  Thanks @rnd-debug.
+- Implemented support for binary, octal, and hexadecimal notation in the 
+  expression parser, and implemented functions `bin`, `oct`, and `hex` for 
+  formatting. Thanks @clnhlzmn.
+- Fix #1964: inconsistent calculation of negative dividend modulo for 
+  `BigNumber` and `Fraction`. Thanks @ovk.
+
+
+# 2020-08-24, version 7.2.0
+
+- Implemented new function `diff`, see #1634, #1920. Thanks @Veeloxfire. 
+- Implemented support for norm 2 for matrices in function `norm`. 
+  Thanks @rnd-debug. 
+
+
+# 2020-07-13, version 7.1.0
+
+- Implement support for recursion (self-referencing) of typed-functions, 
+  new in `typed-function@2.0.0`. This fixes #1885: functions which where 
+  extended with a new data type did not always work. Thanks @nickewing.
+- Fix #1899: documentation on expression trees still using old namespace 
+  `math.expression.node.*` instead of `math.*`.
+
+
+# 2020-06-24, version 7.0.2
+
+- Fix #1882: have `DenseMatrix.resize` and `SparseMatrix.resize` accept 
+  `DenseMatrix` and `SparseMatrix` as inputs too, not only `Array`.
+- Fix functions `sum`, `prod`, `min`, and `max` not throwing a conversion error
+  when passing a single string, like `sum("abc")`.
+
+
+# 2020-05-30, version 7.0.1
+
+- Fix #1844: clarify the documentation of function `eigs`. Thanks @Lazersmoke.
+- Fix #1855: Fix error in the documentation for `math.nthRoots(x)`.  
+- Fix #1856: make the library robust against Object prototype pollution.
+
+
+# 2020-05-07, version 7.0.0
+
+Breaking changes:
+
+- Improvements in calculation of the `dot` product of complex values. 
+  The first argument is now conjugated. See #1761. Thanks @m93a.  
+- Dropped official support for Node.js v8 which has reached end of life.
+- Removed all deprecation warnings introduced in v6. 
+  To upgrade smoothly from v5 to v7 or higher, upgrade to v6 first
+  and resolve all deprecation warnings.
+
+
+# 2020-05-04, version 6.6.5
+
+- Fix #1834: value `Infinity` cannot be serialized and deserialized. 
+  This is solved now with a new `math.replacer` function used as 
+  `JSON.stringify(value, math.replacer)`.
+- Fix #1842: value `Infinity` not turned into the latex symbol `\\infty`.
+
+
+# 2020-04-15, version 6.6.4
+
+- Fix published files containing Windows line endings (CRLF instead of LF).  
+
+
+# 2020-04-10, version 6.6.3
+
+- Fix #1813: bug in engineering notation for numbers of function `format`,
+  sometimes resulting in needless trailing zeros.
+- Fix #1808: methods `.toNumber()` and `.toNumeric()` not working on a 
+  unitless unit.
+- Fix #1645: not being able to use named operators `mod`, `and`, `not`, `or`,
+  `xor`, `to`, `in` as object keys. Thanks @Veeloxfire.
+- Fix `eigs` not using `config.epsilon`.
+
+
+# 2020-03-29, version 6.6.2
+
+- Fix #1789: Function `eigs` not calculating with BigNumber precision 
+  when input contains BigNumbers.
+- Run the build script during npm `prepare`, so you can use the library
+  directly when installing directly from git. See #1751. Thanks @cinderblock.
+
+
+# 2020-02-26, version 6.6.1
+
+- Fix #1725: simplify `a/(b/c)`. Thanks @dbramwell.
+- Fix examples in documentation of `row` and `column`.
+
+
+# 2020-02-01, version 6.6.0
+
+- Implemented function `eigs`, see #1705, #542 #1175. Thanks @arkajitmandal.
+- Fixed #1727: validate matrix size when creating a `DenseMatrix` using
+  `fromJSON`.
+- Fixed `DenseMatrix.map` copying the size and datatype from the original
+  matrix instead of checking the returned dimensions and type of the callback.
+- Add a caret to dependencies (like) `^1.2.3`) to allow downstream updates
+  without having to await a new release of mathjs.
+
+
+# 2020-01-08, version 6.5.0
+
+- Implemented `baseName` option for `createUnit`, see #1707.
+  Thanks @ericman314.
+
+
+# 2020-01-06, version 6.4.0
+
+- Extended function `dimension` with support for n-dimensional points.
+  Thanks @Veeloxfire.
+
+
+# 2019-12-31, version 6.3.0
+
+- Improved performance of `factorial` for `BigNumber` up to a factor two,
+  see #1687. Thanks @kmdrGroch.
+
+
+# 2019-11-20, version 6.2.5
+
+- Fixed `IndexNode` using a hardcoded, one-based implementation of `index`,
+  making it impossible to instantiate a zero-based version of the expression
+  parser. See #782.
+
+
+# 2019-11-20, version 6.2.4
+
+- Fixed #1669: function 'qr' threw an error if the pivot was zero,
+  thanks @kevinkelleher12 and @harrysarson.
+- Resolves #942: remove misleading assert in 'qr'. Thanks @harrysarson.
+- Work around a bug in complex.js where `sign(0)` returns complex NaN.
+  Thanks @harrysarson.
+
+
+# 2019-10-06, version 6.2.3
+
+- Fixed #1640: function `mean` not working for units. Thanks @clintonc.
+- Fixed #1639: function `min` listed twice in the "See also" section of the
+  embedded docs of function `std`.
+- Improved performance of `isPrime`, see #1641. Thanks @arguiot.
+
+
+# 2019-09-23, version 6.2.2
+
+- Fixed methods `map` and `clone` not copying the `dotNotation` property of
+  `IndexNode`. Thanks @rianmcguire.
+- Fixed a typo in the documentation of `toHTML`. Thanks @maytanthegeek.
+- Fixed #1615: error in the docs of `isNumeric`.
+- Fixed #1628: Cannot call methods on empty strings or numbers with value `0`.
+
+
+# 2019-08-31, version 6.2.1
+
+- Fixed #1606: function `format` not working for expressions.
+
+
+# 2019-08-28, version 6.2.0
+
+- Improved performance of `combinationsWithRep`. Thanks @waseemyusuf.
+- Add unit aliases `bit` and `byte`.
+- Fix docs referring to `bit` and `byte` instead of `bits` and `bytes`.
+- Updated dependency `typed-function@1.1.1`.
+
+
+# 2019-08-17, version 6.1.0
+
+- Implemented function `combinationsWithRep` (see #1329). Thanks @waseemyusuf.
+
+
+# 2019-08-05, version 6.0.4
+
+- Fixed #1554, #1565: ES Modules where not transpiled to ES5, giving issues on
+  old browsers. Thanks @mockdeep for helping to find a solution.
+
+
+# 2019-07-07, version 6.0.3
+
+- Add `unpkg` and `jsdelivr` fields in package.json pointing to UMD build.
+  Thanks @tmcw.
+- Fix #1550: nested user defined function not receiving variables of an
+  outer user defined function.
+
+
+# 2019-06-11, version 6.0.2
+
+- Fix not being able to set configuration after disabling function `import`
+  (regression since v6.0.0).
+
+
+# 2019-06-09, version 6.0.1
+
+- Fix function reference not published in npm library.
+- Fix function `evaluate` and `parse` missing in generated docs.
+
+
+# 2019-06-08, version 6.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+### Most notable changes
+
+1.  Full support for **ES modules**. Support for tree-shaking out of the box.
+
+    Load all functions:
+
+    ```js
+    import * as math from 'mathjs'
+    ```
+
+    Use a few functions:
+
+    ```js
+    import { add, multiply } from 'mathjs'
+    ```
+
+    Load all functions with custom configuration:
+
+    ```js
+    import { create, all } from 'mathjs'
+    const config = { number: 'BigNumber' }
+    const math = create(all, config)
+    ```
+
+    Load a few functions with custom configuration:
+
+    ```js
+    import { create, addDependencies, multiplyDependencies } from 'mathjs'
+    const config = { number: 'BigNumber' }
+    const { add, multiply } = create({
+      addDependencies,
+      multiplyDependencies
+    }, config)
+    ```
+
+2.  Support for **lightweight, number-only** implementations of all functions:
+
+    ```
+    import { add, multiply } from 'mathjs/number'
+    ```
+
+3.  New **dependency injection** solution used under the hood.
+
+
+### Breaking changes
+
+- Node 6 is no longer supported.
+
+- Functions `config` and `import` are not available anymore in the global
+  context:
+
+  ```js
+  // v5
+  import * as mathjs from 'mathjs'
+  mathjs.config(...) // error in v6.0.0
+  mathjs.import(...) // error in v6.0.0
+  ```
+
+  Instead, create your own mathjs instance and pass config and imports
+  there:
+
+  ```js
+  // v6
+  import { create, all } from 'mathjs'
+  const config = { number: 'BigNumber' }
+  const mathjs = create(all, config)
+  mathjs.import(...)
+  ```
+
+- Renamed function `typeof` to `typeOf`, `var` to `variance`,
+  and `eval` to `evaluate`. (the old function names are reserved keywords
+  which can not be used as a variable name).
+- Deprecated the `Matrix.storage` function. Use `math.matrix` instead to create
+  a matrix.
+- Deprecated function `math.expression.parse`, use `math.parse` instead.
+  Was used before for example to customize supported characters by replacing
+  `math.parse.isAlpha`.
+- Moved all classes like `math.type.Unit` and `math.expression.Parser` to
+  `math.Unit` and `math.Parser` respectively.
+- Fixed #1428: transform iterating over replaced nodes. New behavior
+  is that it stops iterating when a node is replaced.
+- Dropped support for renaming factory functions when importing them.
+- Dropped fake BigNumber support of function `erf`.
+- Removed all index.js files used to load specific functions instead of all, like:
+
+  ```
+  // v5
+  // ... set up empty instance of mathjs, then load a set of functions:
+  math.import(require('mathjs/lib/function/arithmetic'))
+  ```
+
+  Individual functions are now loaded simply like:
+
+  ```js
+  // v6
+  import { add, multiply } from 'mathjs'
+  ```
+
+  To set a specific configuration on the functions:
+
+  ```js
+  // v6
+  import { create, addDependencies, multiplyDependencies } from 'mathjs'
+  const config = { number: 'BigNumber' }
+  const math = create({ addDependencies, multiplyDependencies }, config)
+  ```
+
+  See example `advanced/custom_loading.js`.
+
+- Updated the values of all physical units to their latest official values.
+  See #1529. Thanks @ericman314.
+
+### Non breaking changes
+
+- Implemented units `t`, `tonne`, `bel`, `decibel`, `dB`, and prefixes
+  for `candela`. Thanks @mcvladthegoat.
+- Fixed `epsilon` setting being applied globally to Complex numbers.
+- Fix `math.simplify('add(2, 3)')` throwing an error.
+- Fix #1530: number formatting first applied `lowerExp` and `upperExp`
+  and after that rounded the value instead of the other way around.
+- Fix #1473: remove `'use strict'` in every file, not needed anymore.
+
+
+# 2019-05-18, version 5.10.3
+
+- Fixed dependency `del` being a dependency instead of devDependency.
+
+
+# 2019-05-18, version 5.10.2
+
+- Fix #1515, #1516, #1517: broken package due to a naming conflict in
+  the build folder of a util file `typeOf.js` and `typeof.js`.
+  Solved by properly cleaning all build folders before building.
+
+
+# 2019-05-17, version 5.10.1
+
+- Fix #1512: format using notation `engineering` can give wrong results
+  when the value has less significant digits than the number of digits in
+  the output.
+
+
+# 2019-05-08, version 5.10.0
+
+- Fix `lib/header.js` not having filled in date and version. Thanks @kevjin.
+- Upgraded dependency `decimal.js@10.2.0`, fixing an issue on node.js 12.
+
+
+# 2019-04-08, version 5.9.0
+
+- Implemented functions `row` and `column` (see #1413). Thanks @SzechuanSage.
+- Fixed #1459: `engineering` notation of function `format` not available
+  for `BigNumber`.
+- Fixed #1465: `node.toHTML()` not correct for unary operators like
+  `factorial`.
+
+
+# 2019-03-20, version 5.8.0
+
+- Implemented new function `apply`. Thanks @bnlcas.
+- Implemented passing an optional `dimension` argument to `std` and `var`.
+  Thanks @bnlcas.
+
+
+# 2019-03-10, version 5.7.0
+
+- Implemented support for `pow()` in `derivative`. Thanks @sam-19.
+- Gracefully handle round-off errors in fix, ceil, floor, and range
+  (Fixes #1429, see also #1434, #1432). Thanks @ericman314.
+
+
+# 2019-03-02, version 5.6.0
+
+- Upgrade decimal.js to v10.1.1 (#1421).
+- Fixed #1418: missing whitespace when stringifying an expression
+  containing "not".
+
+
+# 2019-02-20, version 5.5.0
+
+- Fixed #1401: methods `map` and `forEach` of `SparseMatrix` not working
+  correctly when indexes are unordered.
+- Fixed #1404: inconsistent rounding of negative numbers.
+- Upgrade tiny-emitter to v2.1.0 (#1397).
+
+
+# 2019-01-25, version 5.4.2
+
+- Fixed `math.format` not working for BigNumbers with a precision above
+  1025 digits (see #1385). Thanks @ericman314.
+- Fixed incorrect LaTeX output of `RelationalNode`. Thanks @rianmcguire.
+- Fixed a bug the methods `map`, `forEach`, `traverse`, and `transform`
+  of `FunctionNode`.
+
+
+# 2019-01-10, version 5.4.1
+
+- Fix #1378: negative bignumbers not formatted correctly.
+- Upgrade fraction.js to version 4.0.12 (#1369).
+
+
+# 2018-12-09, version 5.4.0
+
+- Extended sum.js to accept a dimension input to calculate the sum over a
+  specific axis. Thanks @bnlcas.
+- Fix #1328: objects can't be written multi-line. Thanks @GHolk.
+- Remove side effects caused by `Unit.format` and `Unit.toString`,
+  making changes to the unit on execution. Thanks @ericman314.
+
+
+# 2018-12-03, version 5.3.1
+
+- Fixed #1336: Unit.toSI() returning units with prefix like `mm` instead
+  of `m`. Thanks @ericman314.
+
+
+# 2018-11-29, version 5.3.0
+
+- Implemented function `hasNumericValue`. Thanks @Sathish-kumar-Subramani.
+- Fix #1326: non-ascii character in print.js.
+- Fix #1337: `math.format` not working correctly with `{ precision: 0 }`.
+  Thanks @dkenul.
+
+
+# 2018-10-30, version 5.2.3
+
+- Fixed #1293: non-unicode characters in `escape-latex` giving issues in some
+  specific cases. Thanks @dangmai.
+- Fixed incorrect LaTeX output of function `bitNot`, see #1299. Thanks @FSMaxB.
+- Fixed #1304: function `pow` not supporting inputs `pow(Unit, BigNumber)`.
+- Upgraded dependencies (`escape-latex@1.2.0`)
+
+
+# 2018-10-23, version 5.2.2
+
+- Fixed #1286: Fixed unit base recognition and formatting for
+  user-defined units. Thanks @ericman314.
+
+
+# 2018-10-18, version 5.2.1
+
+- Fixed unit `rod` being defined as `5.02921` instead of `5.0292`.
+  Thanks @ericman314.
+- Upgraded dependencies (`fraction.js@4.0.10`)
+- Upgraded devDependencies (`@babel/core@7.1.2`, `nyc@13.1.0`,
+  `webpack@4.21.0`).
+
+
+# 2018-10-05, version 5.2.0
+
+- Implemented support for chained conditionals like `10 < x <= 50`.
+  Thanks @ericman314.
+- Add an example showing a proof of concept of using `BigInt` in mathjs.
+- Fixed #1269: Bugfix for BigNumber divided by unit. Thanks @ericman314.
+- Fixed #1240: allow units having just a value and no unit.
+  Thanks @ericman314.
+
+
+## 2018-09-09, version 5.1.2
+
+- Fixed a typo in the docs of `parse`. Thanks @mathiasvr.
+- Fixed #1222: a typo in the docs of `subset`.
+- Fixed #1236: `quantileSeq` has inconsistent return.
+- Fixed #1237: norm sometimes returning a complex number instead of
+  number.
+- Upgraded dependencies (`fraction.js@4.0.9`)
+- Upgraded devDependencies (`babel@7`, `karma-webpack@3.0.4`,
+  `nyc@13.0.1`, `standard@12.0.0`, `uglify-js@3.4.9`, `webpack@4.17.2`)
+
+
+## 2018-08-21, version 5.1.1
+
+- Function `isNumeric` now recognizes more types.
+- Fixed #1214: functions `sqrt`, `max`, `min`, `var`, `std`, `mode`, `mad`,
+  `median`, and `partitionSelect` not neatly handling `NaN` inputs. In some
+  cases (`median`, `mad`, and `partitionSelect`) this resulted in an infinite
+  loop.
+- Upgraded dependencies (`escape-latex@1.1.1`)
+- Upgraded devDependencies (`webpack@4.17.0`)
+
+
+## 2018-08-12, version 5.1.0
+
+- Implemented support for strings enclosed in single quotes.
+  Thanks @jean-emmanuel.
+- Implemented function `getMatrixDataType`. Thanks @JasonShin.
+- Implemented new `options` argument in `simplify`. Thanks @paulobuchsbaum.
+- Bug fixes in `rationalize`, see #1173. Thanks @paulobuchsbaum.
+
+
+## 2018-07-22, version 5.0.4
+
+- Strongly improved the performance of functions `factorial` for numbers.
+  This improves performance of functions `gamma`, `permutation`, and
+  `combination` too. See #1170. Thanks @honeybar.
+- Strongly improved the performance of function `reshape`, thanks to a
+  friend of @honeybar.
+
+
+## 2018-07-14, version 5.0.3
+
+- Fixed many functions (for example `add` and `subtract`) not working
+  with matrices having a `datatype` defined.
+- Fixed #1147: bug in `format` with `engineering` notation in outputting
+  the correct number of significant figures. Thanks @ericman314.
+- Fixed #1162: transform functions not being cleaned up when overriding
+  it by importing a factory function with the same name.
+- Fixed broken links in the documentation. Thanks @stropitek.
+- Refactored the code of `parse` into a functional approach.
+  Thanks @harrysarson.
+- Changed `decimal.js` import to ES6. Thanks @weinshel.
+
+
+## 2018-07-07, version 5.0.2
+
+- Fixed #1136: rocket trajectory example broken (since v4.0.0).
+- Fixed #1137: `simplify` unnecessarily replacing implicit multiplication with
+  explicit multiplication.
+- Fixed #1146: `rationalize` throwing exceptions for some input with decimals.
+  Thanks @maruta.
+- Fixed #1088: function arguments not being passed to `rawArgs` functions.
+- Fixed advanced example `add_new_datatypes`.
+- Fixed mathjs core constants not working without complex numbers.
+  Thanks @ChristopherChudzicki.
+- Fixed a broken link in the documentation on units. Thanks @stropitek.
+- Upgraded dependencies (`typed-function@1.0.4`, `complex.js@2.0.11`).
+- Upgraded devDependencies (`babel-loader@7.1.5 `, `uglify-js@3.4.3`,
+  `expr-eval@1.2.2`, `webpack@4.15.1`).
+
+
+## 2018-07-01, version 5.0.1
+
+- Improved error messaging when converting units. Thanks @gap777.
+- Upgraded devDependencies (`kerma`, `uglify-js`, `webpack`).
+
+
+## 2018-06-16, version 5.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+- Implemented complex conjugate transpose `math.ctranspose`. See #1097.
+  Thanks @jackschmidt.
+- Changed the behavior of `A'` (transpose) in the expression parser to
+  calculate the complex conjugate transpose. See #1097. Thanks @jackschmidt.
+- Added support for `complex({abs: 1, arg: 1})`, and improved the docs on
+  complex numbers. Thanks @ssaket.
+- Renamed `eye` to `identity`, see #1054.
+- Math.js code can now contain ES6. The ES6 source code is moved from `lib`
+  to `src`, and `lib` now contains the compiled ES5 code.
+- Upgraded dependencies:
+  - `decimal.js` from `9.0.1` to `10.0.1`
+  - Upgraded dev dependencies
+- Changed code style to https://standardjs.com/, run linter on `npm test`.
+  See #1110.
+- Dropped support for bower. Use npm or an other package manages instead.
+- Dropped support for (non-primitive) instances of `Number`, `Boolean`, and
+  `String` from functions `clone` and `typeof`.
+- Dropped official support for IE9 (probably still works, but it's not tested).
+- Fixed #851: More consistent behavior of sqrt, nthRoot, and pow.
+  Thanks @dakotablair.
+- Fixed #1103: Calling `toTex` on node that contains `derivative` causing
+  an exception. Thanks @joelhoover.
+
+
+## 2018-06-02, version 4.4.2
+
+- Drastically improved the performance of `det`. Thanks @ericman314.
+- Fixed #1065, #1121: Fixed wrong documentation of function
+  `compareNatural` and clarified the behavior for strings.
+- Fixed #1122 a regression in function `inv` (since `v4.4.1`).
+  Thanks @ericman314.
+
+
+## 2018-05-29, version 4.4.1
+
+- Fixed #1109: a bug in `inv` when dealing with values close to zero.
+  Thanks @ericman314.
+
+
+## 2018-05-28, version 4.4.0
+
+- Implemented functions `equalText` and `compareText`. See #1085.
+
+
+## 2018-05-21, version 4.3.0
+
+- Implemented matrix exponential `math.expm`. Thanks @ericman314.
+- Fixed #1101: math.js bundle not working when loading in a WebWorker.
+- Upgraded dependencies
+  - `complex.js` from `v2.0.2` to `v2.0.10`.
+  - `fraction.js` from `v4.0.4` to `v4.0.8`.
+- Upgraded devDependencies (`mocha`, `uglify-js`, `webpack`).
+
+
+## 2018-05-05, version 4.2.2
+
+- Fixed calculating the Frobenius norm of complex matrices correctly,
+  see #1098. Thanks @jackschmidt.
+- Fixed #1076: cannot use mathjs in React VR by updating to
+  `escape-latex@1.0.3`.
+
+
+## 2018-05-02, version 4.2.1
+
+- Fixed `dist/math.js` being minified.
+
+
+## 2018-05-02, version 4.2.0
+
+- Implemented function `math.sqrtm`. Thanks @ferrolho.
+- Implemented functions `math.log2`, `math.log1p`, and `math.expm1`.
+  Thanks @BigFav and @harrysarson.
+- Fixed some unit tests broken on nodejs v10.
+- Upgraded development dependencies.
+- Dropped integration testing on nodejs v4.
+
+
+## 2018-04-18, version 4.1.2
+
+- Fixed #1082: implemented support for unit plurals `decades`, `centuries`,
+  and `millennia`.
+- Fixed #1083: units `decade` and `watt` having a wrong name when stringifying.
+  Thanks @ericman314.
+
+
+## 2018-04-11, version 4.1.1
+
+- Fixed #1063: derivative not working when resolving a variable with unary
+  minus like `math.derivative('-x', 'x')`.
+
+
+## 2018-04-08, version 4.1.0
+
+- Extended function `math.print` with support for arrays and matrices.
+  Thanks @jean-emmanuel.
+- Fixed #1077: Serialization/deserialization to JSON with reviver not being
+  supported by nodes.
+- Fixed #1016: Extended `math.typeof` with support for `ResultSet` and nodes
+  like `SymbolNode`.
+- Fixed #1072: Added support for long and short prefixes for the unit `bar`
+  (i.e. `millibar` and `mbar`).
+
+
+## 2018-03-17, version 4.0.1
+
+- Fixed #1062: mathjs not working on ES5 browsers like IE11 and Safari 9.3.
+- Fixed #1061: `math.unit` not accepting input like `1/s`.
+
+
+## 2018-02-25, version 4.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+Breaking changes (see also #682):
+
+- **New expression compiler**
+
+    The compiler of the expression parser is replaced with one that doesn't use
+    `eval` internally. See #1019. This means:
+
+    - a slightly improved performance on most browsers.
+    - less risk of security exploits.
+    - the code of the new compiler is easier to understand, maintain, and debug.
+
+    Breaking change here: When using custom nodes in the expression parser,
+    the syntax of `_compile` has changed. This is an undocumented feature though.
+
+- **Parsed expressions**
+
+    - The class `ConstantNode` is changed such that it just holds a value
+      instead of holding a stringified value and it's type.
+      `ConstantNode(valueStr, valueType`) is now `ConstantNode(value)`
+      Stringification uses `math.format`, which may result in differently
+      formatted numeric output.
+
+    - The constants `true`, `false`, `null`, `undefined`, `NaN`, `Infinity`,
+      and `uninitialized` are now parsed as ConstantNodes instead of
+      SymbolNodes in the expression parser. See #833.
+
+- **Implicit multiplication**
+
+    - Changed the behavior of implicit multiplication to have higher
+      precedence than explicit multiplication and division, except in
+      a number of specific cases. This gives a more natural behavior
+      for implicit multiplications. For example `24h / 6h` now returns `4`,
+      whilst `1/2 kg` evaluates to `0.5 kg`. Thanks @ericman314. See: #792.
+      Detailed documentation: https://github.com/josdejong/mathjs/blob/v4/docs/expressions/syntax.md#implicit-multiplication.
+
+    - Immediately invoking a function returned by a function like `partialAdd(2)(3)`
+      is no longer supported, instead these expressions are evaluated as
+      an implicit multiplication `partialAdd(2) * (3)`. See #1035.
+
+- **String formatting**
+
+    - In function `math.format`, the options `{exponential: {lower: number, upper: number}}`
+      (where `lower` and `upper` are values) are replaced with `{lowerExp: number, upperExp: number}`
+      (where `lowerExp` and `upperExp` are exponents). See #676. For example:
+      ```js
+      math.format(2000, {exponential: {lower: 1e-2, upper: 1e2}})
+      ```
+      is now:
+      ```js
+      math.format(2000, {lowerExp: -2, upperExp: 2})
+      ```
+
+    - In function `math.format`, the option `notation: 'fixed'` no longer rounds to
+      zero digits  when no precision is specified: it leaves the digits as is.
+      See #676.
+
+- **String comparison**
+
+    Changed the behavior of relational functions (`compare`, `equal`,
+    `equalScalar`, `larger`, `largerEq`, `smaller`, `smallerEq`, `unequal`)
+    to compare strings by their numeric value they contain instead of
+    alphabetically. This also impacts functions `deepEqual`, `sort`, `min`,
+    `max`, `median`, and `partitionSelect`. Use `compareNatural` if you
+    need to sort an array with text. See #680.
+
+- **Angle units**
+
+    Changed `rad`, `deg`, and `grad` to have short prefixes,
+    and introduced `radian`, `degree`, and `gradian` and their plurals
+    having long prefixes. See #749.
+
+- **Null**
+
+    - `null` is no longer implicitly casted to a number `0`, so input like
+      `math.add(2, null)` is no longer supported. See #830, #353.
+
+    - Dropped constant `uninitialized`, which was used to initialize
+      leave new entries undefined when resizing a matrix is removed.
+      Use `undefined` instead to indicate entries that are not explicitly
+      set. See #833.
+
+- **New typed-function library**
+
+    - The `typed-function` library used to check the input types
+      of functions is completely rewritten and doesn't use `eval` under
+      the hood anymore. This means a reduced security risk, and easier
+      to debug code. The API is the same, but error messages may differ
+      a bit. Performance is comparable but may differ in specific
+      use cases and browsers.
+
+Non breaking changes:
+
+- Thanks to the new expression compiler and `typed-function` implementation,
+  mathjs doesn't use JavaScript's `eval` anymore under the hood.
+  This allows using mathjs in environments with security restrictions.
+  See #401.
+- Implemented additional methods `isUnary()` and `isBinary()` on
+  `OperatorNode`. See #1025.
+- Improved error messages for statistical functions.
+- Upgraded devDependencies.
+- Fixed #1014: `derivative` silently dropping additional arguments
+  from operator nodes with more than two arguments.
+
+
+## 2018-02-07, version 3.20.2
+
+- Upgraded to `typed-function@0.10.7` (bug-fix release).
+- Fixed option `implicit` not being copied from an `OperatorNode`
+  when applying function `map`. Thanks @HarrySarson.
+- Fixed #995: spaces and underscores not property being escaped
+  in `toTex()`. Thanks @FSMaxB.
+
+
+## 2018-01-17, version 3.20.1
+
+- Fixed #1018: `simplifyCore` failing in some cases with parentheses.
+  Thanks @firepick1.
+
+
+## 2018-01-14, version 3.20.0
+
+- Implement support for 3 or more arguments for operators `+` and `*` in
+  `derivative`. Thanks @HarrySarson. See #1002.
+- Fixed `simplify` evalution of `simplify` of functions with more than two
+  arguments wrongly: `simplify('f(x, y, z)') evaluated to `f(f(x, y), z)`
+  instead of `f(x, y, z)`. Thanks @joelhoover.
+- Fixed `simplify` throwing an error in some cases when simplifying unknown
+  functions, for example `simplify('f(4)')`. Thanks @joelhoover.
+- Fixed #1013: `simplify` wrongly simplifing some expressions containing unary
+  minus, like `0 - -x`. Thanks @joelhoover.
+- Fixed an error in an example in the documentation of `xor`. Thanks @denisx.
+
+
+## 2018-01-06, version 3.19.0
+
+- Extended functions `distance` and `intersect` with support for BigNumbers.
+  Thanks @ovk.
+- Improvements in function `simplify`: added a rule that allows combining
+  of like terms in embedded quantities. Thanks @joelhoover.
+
+
+## 2017-12-28, version 3.18.1
+
+- Fixed #998: An issue with simplifying an expression containing a subtraction.
+  Thanks @firepick1.
+
+
+## 2017-12-16, version 3.18.0
+
+- Implemented function `rationalize`. Thanks @paulobuchsbaum.
+- Upgraded dependencies:
+  ```
+  decimal.js    7.2.3  →  9.0.1 (no breaking changes affecting mathjs)
+  fraction.js   4.0.2  →  4.0.4
+  tiny-emitter  2.0.0  →  2.0.2
+  ```
+- Upgraded dev dependencies.
+- Fixed #975: a wrong example in the docs of lusolve.
+- Fixed #983: `pickRandom` returning an array instead of single value
+  when input was an array with just one value. Clarified docs.
+- Fixed #969: preven issues with yarn autoclean by renaming an
+  interally used folder "docs" to "embeddedDocs".
+
+
+## 2017-11-18, version 3.17.0
+
+- Improved `simplify` for nested exponentiations. Thanks @IvanVergiliev.
+- Fixed a security issue in `typed-function` allowing arbitrary code execution
+  in the JavaScript engine by creating a typed function with JavaScript code
+  in the name. Thanks Masato Kinugawa.
+- Fixed a security issue where forbidden properties like constructor could be
+  replaced by using unicode characters when creating an object. No known exploit,
+  but could possibly allow arbitrary code execution. Thanks Masato Kinugawa.
+
+
+## 2017-10-18, version 3.16.5
+
+- Fixed #954: Functions `add` and `multiply` not working when
+  passing three or more arrays or matrices.
+
+
+## 2017-10-01, version 3.16.4
+
+- Fixed #948, #949: function `simplify` returning wrong results or
+  running into an infinite recursive loop. Thanks @ericman314.
+- Fixed many small issues in the embedded docs.  Thanks @Schnark.
+
+
+## 2017-08-28, version 3.16.3
+
+- Fixed #934: Wrong simplification of unary minus. Thanks @firepick1.
+- Fixed #933: function `simplify` reordering operations. Thanks @firepick1.
+- Fixed #930: function `isNaN` returning wrong result for complex
+  numbers having just one of their parts (re/im) being `NaN`.
+- Fixed #929: `FibonacciHeap.isEmpty` returning wrong result.
+
+
+## 2017-08-20, version 3.16.2
+
+- Fixed #924: a regression in `simplify` not accepting the signature
+  `simplify(expr, rules, scope)` anymore. Thanks @firepick1.
+- Fixed missing parenthesis when stringifying expressions containing
+  implicit multiplications (see #922). Thanks @FSMaxB.
+
+
+## 2017-08-12, version 3.16.1
+
+- For security reasons, type checking is now done in a more strict
+  way using functions like `isComplex(x)` instead of duck type checking
+  like `x && x.isComplex === true`.
+- Fixed #915: No access to property "name".
+- Fixed #901: Simplify units when calling `unit.toNumeric()`.
+  Thanks @AlexanderBeyn.
+- Fixed `toString` of a parsed expression tree containing an
+  immediately invoked function assignment not being wrapped in
+  parenthesis (for example `(f(x) = x^2)(4)`).
+
+
+## 2017-08-06, version 3.16.0
+
+- Significant performance improvements in `math.simplify`.
+  Thanks @firepick1.
+- Improved API for `math.simplify`, optionally pass a scope with
+  variables which are resolved, see #907. Thanks @firepick1.
+- Fixed #912: math.js didn't work on IE10 anymore (regression
+  since 3.15.0).
+
+
+## 2017-07-29, version 3.15.0
+
+- Added support for the dollar character `$` in symbol names (see #895).
+- Allow objects with prototypes as scope again in the expression parser,
+  this was disabled for security reasons some time ago. See #888, #899.
+  Thanks @ThomasBrierley.
+- Fixed #846: Issues in the functions `map`, `forEach`, and `filter`
+  when used in the expression parser:
+  - Not being able to use a function assignment as inline expression
+    for the callback function.
+  - Not being able to pass an inline expression as callback for `map`
+    and `forEach`.
+  - Index and original array/matrix not passed in `map` and `filter`.
+
+
+## 2017-07-05, version 3.14.2
+
+- Upgraded to `fraction.js@4.0.2`
+- Fixed #891 using BigNumbers not working in browser environments.
+
+
+## 2017-06-30, version 3.14.1
+
+- Reverted to `fraction.js@4.0.0`, there is an issue with `4.0.1`
+  in the browser.
+
+
+## 2017-06-30, version 3.14.0
+
+- Implemented set methods `setCartesian`, `setDifference`,
+  `setDistinct`, `setIntersect`, `setIsSubset`, `setPowerset`,
+  `setSize`. Thanks @Nekomajin42.
+- Implemented method `toHTML` on nodes. Thanks @Nekomajin42.
+- Implemented `compareNatural` and `sort([...], 'natural')`.
+- Upgraded dependencies to the latest versions:
+  - `complex.js@2.0.4`
+  - `decimal.js@7.2.3`
+  - `fraction.js@4.0.1`
+  - `tiny-emitter@2.0.0`
+  - And all devDependencies.
+- Fixed #865: `splitUnit` can now deal with round-off errors.
+  Thanks @ericman314.
+- Fixed #876: incorrect definition for unit `erg`. Thanks @pjhampton.
+- More informative error message when using single quotes instead of
+  double quotes around a string. Thanks @HarrySarson.
+
+
+## 2017-05-27, version 3.13.3
+
+- Fixed a bug in function `intersection` of line and plane.
+  Thanks @viclai.
+- Fixed security vulnerabilities.
+
+
+## 2017-05-26, version 3.13.2
+
+- Disabled function `chain` inside the expression parser for security
+  reasons (it's not needed there anyway).
+- Fixed #856: function `subset` not returning non-primitive scalars
+  from Arrays correctly. (like `math.eval('arr[1]', {arr: [math.bignumber(2)]})`.
+- Fixed #861: physical constants not available in the expression parser.
+
+
+## 2017-05-12, version 3.13.1
+
+- Fixed creating units with an alias not working within the expression
+  parser.
+- Fixed security vulnerabilities. Thanks Sam.
+
+
+## 2017-05-12, version 3.13.0
+
+- Command line application can now evaluate inline expressions
+  like `mathjs 1+2`. Thanks @slavaGanzin.
+- Function `derivative` now supports `abs`. Thanks @tetslee.
+- Function `simplify` now supports BigNumbers. Thanks @tetslee.
+- Prevent against endless loops in `simplify`. Thanks @tetslee.
+- Fixed #813: function `simplify` converting small numbers to inexact
+  Fractions. Thanks @tetslee.
+- Fixed #838: Function `simplify` now supports constants like `e`.
+  Thanks @tetslee.
+
+
+## 2017-05-05, version 3.12.3
+
+- Fixed security vulnerabilities. Thanks Dan and Sam.
+
+
+## 2017-04-30, version 3.12.2
+
+- Added a rocket trajectory optimization example.
+
+
+## 2017-04-24, version 3.12.1
+
+- Fixed #804
+  - Improved handling of powers of `Infinity`. Thanks @HarrySarson.
+  - Fixed wrong formatting of complex NaN.
+- Fixed security vulnerabilities in the expression parser.
+  Thanks Sam and Dan.
+
+
+## 2017-04-17, version 3.12.0
+
+- Implemented QR decomposition, function `math.qr`. Thanks @HarrySarson.
+- Fixed #824: Calling `math.random()` freezes IE and node.js.
+
+
+## 2017-04-08, version 3.11.5
+
+- More security measures in the expression parser.
+  WARNING: the behavior of the expression parser is now more strict,
+  some undocumented features may not work any longer.
+  - Accessing and assigning properties is now only allowed on plain
+    objects, not on classes, arrays, and functions anymore.
+  - Accessing methods is restricted to a set of known, safe methods.
+
+
+## 2017-04-03, version 3.11.4
+
+- Fixed a security vulnerability in the expression parser. Thanks @xfix.
+
+
+## 2017-04-03, version 3.11.3
+
+- Fixed a security vulnerability in the expression parser. Thanks @xfix.
+
+
+## 2017-04-03, version 3.11.2
+
+- Fixed a security vulnerability in the expression parser. Thanks @xfix.
+
+
+## 2017-04-02, version 3.11.1
+
+- Fixed security vulnerabilities in the expression parser.
+  Thanks Joe Vennix and @xfix.
+
+
+## 2017-04-02, version 3.11.0
+
+- Implemented method Unit.toSI() to convert a unit to base SI units.
+  Thanks @ericman314.
+- Fixed #821, #822: security vulnerabilities in the expression parser.
+  Thanks @comex and @xfix.
+
+
+## 2017-03-31, version 3.10.3
+
+- More security fixes related to the ones fixed in `v3.10.2`.
+
+
+## 2017-03-31, version 3.10.2
+
+- Fixed a security vulnerability in the expression parser allowing
+  execution of arbitrary JavaScript. Thanks @CapacitorSet and @denvit.
+
+
+## 2017-03-26, version 3.10.1
+
+- Fixed `xgcd` for negative values. Thanks @litmit.
+- Fixed #807: function transform of existing functions not being removed when
+  overriding such a function.
+
+
+## 2017-03-05, version 3.10.0
+
+- Implemented function `reshape`. Thanks @patgrasso and @ericman314.
+- Implemented configuration option `seedRandom` for deterministic random
+  numbers. Thanks @morsecodist.
+- Small fixes in the docs. Thanks @HarrySarson.
+- Dropped support for component package manager (which became deprecated about
+  one and a half year ago).
+
+
+## 2017-02-22, version 3.9.3
+
+- Fixed #797: issue with production builds of React Native projects.
+- Fixed `math.round` not accepting inputs `NaN`, `Infinity`, `-Infinity`.
+- Upgraded all dependencies.
+
+
+## 2017-02-16, version 3.9.2
+
+- Fixed #795: Parse error in case of a multi-line expression with just comments.
+
+
+## 2017-02-06, version 3.9.1
+
+- Fixed #789: Math.js not supporting conversion of `string` to `BigNumber`,
+  `Fraction`, or `Complex` number.
+- Fixed #790: Expression parser did not pass function arguments of enclosing
+  functions via `scope` to functions having `rawArgs = true`.
+- Small fixes in the docs. Thanks @HarrySarson.
+
+
+## 2017-01-23, version 3.9.0
+
+- Implemented support for algebra: powerful new functions `simplify` and
+  `derivative`. Thanks @ericman314, @tetslee, and @BigFav.
+- Implemented Kronecker Product `kron`. Thanks @adamisntdead.
+- Reverted `FunctionNode` not accepting a string as function name anymore.
+- Fixed #765: `FunctionAssignmentNode.toString()` returning a string
+  incompatible with the function assignment syntax.
+
+
+## 2016-12-15, version 3.8.1
+
+- Implemented function `mad` (median absolute deviation). Thanks @ruhleder.
+- Fixed #762: expression parser failing to invoke a function returned
+  by a function.
+
+
+## 2016-11-18, version 3.8.0
+
+- Functions `add` and `multiply` now accept more than two arguments. See #739.
+- `OperatorNode` now supports more than two arguments. See #739. Thanks @FSMaxB.
+- Implemented a method `Node.cloneDeep` for the expression nodes. See #745.
+- Fixed a bug in `Node.clone()` not cloning implicit multiplication correctly.
+  Thanks @FSMaxB.
+- Fixed #737: Improved algorithm determining the best prefix for units.
+  It will now retain the original unit like `1 cm` when close enough,
+  instead of returning `10 mm`. Thanks @ericman314.
+- Fixed #732: Allow letter-like unicode characters like Ohm `\u2126`.
+- Fixed #749: Units `rad`, `deg`, and `grad` can now have prefixes like `millirad`.
+- Some fixes in the docs and comments of examples. Thanks @HarrySarson.
+
+
+## 2016-11-05, version 3.7.0
+
+- Implemented method `Node.equals(other)` for all nodes of the expression parser.
+- Implemented BigNumber support in function `arg()`.
+- Command Line Interface loads faster.
+- Implicit conversions between Fractions and BigNumbers throw a neat error now
+  (See #710).
+
+
+## 2016-10-21, version 3.6.0
+
+- Implemented function `erf()`. THanks @patgrasso.
+- Extended function `cross()` to support n-d vectors. Thanks @patgrasso.
+- Extended function `pickRandom` with the option to pick multiple values from
+  an array and give the values weights: `pickRandom(possibles, number, weights)`.
+  Thanks @woylie.
+- Parser now exposes test functions like `isAlpha` which can be replaced in
+  order to adjust the allowed characters in variables names (See #715).
+- Fixed #727: Parser not throwing an error for invalid implicit multiplications
+  like `-2 2` and `2^3 4` (right after the second value of an operator).
+- Fixed #688: Describe allowed variable names in the docs.
+
+
+## 2016-09-21, version 3.5.3
+
+- Some more fixes regarding numbers ending with a decimal mark (like `2.`).
+
+
+## 2016-09-20, version 3.5.2
+
+- Fixed numbers ending with a decimal mark (like `2.`) not being supported by
+  the parser, solved the underlying ambiguity in the parser. See #707, #711.
+
+
+## 2016-09-12, version 3.5.1
+
+- Removed a left over console.log statement. Thanks @eknkc.
+
+
+## 2016-09-07, version 3.5.0
+
+- Comments of expressions are are now stored in the parsed nodes. See #690.
+- Fixed function `print` not accepting an Object with formatting options as
+  third parameter Thanks @ThomasBrierley.
+- Fixed #707: The expression parser no longer accepts numbers ending with a dot
+  like `2.`.
+
+
+## 2016-08-08, version 3.4.1
+
+- Fixed broken bundle files (`dist/math.js`, `dist/math.min.js`).
+- Fixed some layout issues in the function reference docs.
+
+
+## 2016-08-07, version 3.4.0
+
+- Implemented support for custom units using `createUnit`. Thanks @ericman314.
+- Implemented function `splitUnits`. Thanks @ericman314.
+- Implemented function `isPrime`. Thanks @MathBunny.
+
+
+## 2016-07-05, version 3.3.0
+
+- Implemented function `isNaN`.
+- Function `math.filter` now passes three arguments to the callback function:
+  value, index, and array.
+- Removed the check on the number of arguments from functions defined in the
+  expression parser (see #665).
+- Fixed #665: functions `map`, `forEach`, and `filter` now invoke callbacks
+  which are a typed-function with the correct number of arguments.
+
+
+## 2016-04-26, version 3.2.1
+
+- Fixed #651: unable to perform calculations on "Unit-less" units.
+- Fixed matrix.subset mutating the replacement matrix when unsqueezing it.
+
+
+## 2016-04-16, version 3.2.0
+
+- Implemented #644: method `Parser.getAll()` to retrieve all defined variables.
+- Upgraded dependencies (decimal.js@5.0.8, fraction.js@3.3.1,
+  typed-function@0.10.4).
+- Fixed #601: Issue with unnamed typed-functions by upgrading to
+  typed-function v0.10.4.
+- Fixed #636: More strict `toTex` templates, reckon with number of arguments.
+- Fixed #641: Bug in expression parser parsing implicit multiplication with
+  wrong precedence in specific cases.
+- Fixed #645: Added documentation about `engineering` notation of function
+  `math.format`.
+
+
+## 2016-04-03, version 3.1.4
+
+- Using ES6 Math functions like `Math.sinh`, `Math.cbrt`, `Math.sign`, etc when
+  available.
+- Fixed #631: unit aliases `weeks`, `months`, and `years` where missing.
+- Fixed #632: problem with escaped backslashes at the end of strings.
+- Fixed #635: `Node.toString` options where not passed to function arguments.
+- Fixed #629: expression parser throws an error when passing a number with
+  decimal exponent instead of parsing them as implicit multiplication.
+- Fixed #484, #555: inaccuracy of `math.sinh` for values between -1 and 1.
+- Fixed #625: Unit `in` (`inch`) not always working due to ambiguity with
+  the operator `a in b` (alias of `a to b`).
+
+
+## 2016-03-24, version 3.1.3
+
+- Fix broken bundle.
+
+
+## 2016-03-24, version 3.1.2
+
+- Fix broken npm release.
+
+
+## 2016-03-24, version 3.1.1
+
+- Fixed #621: a bug in parsing implicit multiplications like `(2)(3)+4`.
+- Fixed #623: `nthRoot` of zero with a negative root returned `0` instead of
+  `Infinity`.
+- Throw an error when functions `min`, `max`, `mean`, or `median` are invoked
+  with multiple matrices as arguments (see #598).
+
+
+## 2016-03-19, version 3.1.0
+
+- Hide multiplication operator by default when outputting `toTex` and `toString`
+  for implicit multiplications. Implemented and option to output the operator.
+- Implemented unit `kip` and alias `kips`. Thanks @hgupta9.
+- Added support for prefixes for units `mol` and `mole`. Thanks @stu-blair.
+- Restored support for implicit multiplications like `2(3+4)` and `(2+3)(4+5)`.
+- Some improvements in the docs.
+- Added automatic conversions from `boolean` and `null` to `Fraction`,
+  and conversions from `Fraction` to `Complex`.
+
+
+## 2016-03-04, version 3.0.0
+
+### breaking changes
+
+- More restricted support for implicit multiplication in the expression
+  parser: `(...)(...)` is now evaluated as a function invocation,
+  and `[...][...]` as a matrix subset.
+- Matrix multiplication no longer squeezes scalar outputs to a scalar value,
+  but leaves them as they are: a vector or matrix containing a single value.
+  See #529.
+- Assignments in the expression parser now return the assigned value rather
+  than the created or updated object (see #533). Example:
+
+  ```
+  A = eye(3)
+  A[1,1] = 2   # this assignment now returns 2 instead of A
+  ```
+
+- Expression parser now supports objects. This involves a refactoring and
+  extension in expression nodes:
+  - Implemented new node `ObjectNode`.
+  - Refactored `AssignmentNode`, `UpdateNode`, and `IndexNode` are refactored
+    into `AccessorNode`, `AssignmentNode`, and `IndexNode` having a different API.
+- Upgraded the used BigNumber library `decimal.js` to v5. Replaced the
+  trigonometric functions of math.js with those provided in decimal.js v5.
+  This can give slightly different behavior qua round-off errors.
+- Replaced the internal `Complex.js` class with the `complex.js` library
+  created by @infusion.
+- Entries in a matrix (typically numbers, BigNumbers, Units, etc) are now
+  considered immutable, they are no longer copied when performing operations on
+  the entries, improving performance.
+- Implemented nearly equal comparison for relational functions (`equal`,
+  `larger`, `smaller`, etc.) when using BigNumbers.
+- Changed the casing of the configuration options `matrix` (`Array` or `Matrix`)
+  and `number` (`number`, `BigNumber`, `Fraction`) such that they now match
+  the type returned by `math.typeof`. Wrong casing gives a console warning but
+  will still work.
+- Changed the default config value for `epsilon` from `1e-14` to `1e-12`,
+  see #561.
+
+### non-breaking changes
+
+- Extended function `pow` to return the real root for cubic roots of negative
+  numbers. See #525, #482, #567.
+- Implemented support for JSON objects in the expression parser and the
+  function `math.format`.
+- Function `math.fraction` now supports `BigNumber`, and function
+  `math.bignumber` now supports `Fraction`.
+- Expression parser now allows function and/or variable assignments inside
+  accessors and conditionals, like `A[x=2]` or `a > 2 ? b="ok" : b="fail"`.
+- Command line interface:
+  - Outputs the variable name of assignments.
+  - Fixed not rounding BigNumbers to 14 digits like numbers.
+  - Fixed non-working autocompletion of user defined variables.
+- Reorganized and extended docs, added docs on classes and more. Thanks @hgupta9.
+- Added new units `acre`, `hectare`, `torr`, `bar`, `mmHg`, `mmH2O`, `cmH2O`,
+  and added new aliases `acres`, `hectares`, `sqfeet`, `sqyard`, `sqmile`,
+  `sqmiles`, `mmhg`, `mmh2o`, `cmh2o`. Thanks @hgupta9.
+- Fixed a bug in the toString method of an IndexNode.
+- Fixed angle units `deg`, `rad`, `grad`, `cycle`, `arcsec`, and `arcmin` not
+  being defined as BigNumbers when configuring to use BigNumbers.
+
+
+## 2016-02-03, version 2.7.0
+
+- Added more unit aliases for time: `secs`, `mins`, `hr`, `hrs`. See #551.
+- Added support for doing operations with mixed `Fractions` and `BigNumbers`.
+- Fixed #540: `math.intersect()` returning null in some cases. Thanks @void42.
+- Fixed #546: Cannot import BigNumber, Fraction, Matrix, Array.
+  Thanks @brettjurgens.
+
+
+## 2016-01-08, version 2.6.0
+
+- Implemented (complex) units `VA` and `VAR`.
+- Implemented time units for weeks, months, years, decades, centuries, and
+  millennia. Thanks @owenversteeg.
+- Implemented new notation `engineering` in function `math.format`.
+  Thanks @johnmarinelli.
+- Fixed #523: In some circumstances, matrix subset returned a scalar instead
+  of the correct subset.
+- Fixed #536: A bug in an internal method used for sparse matrices.
+
+
+## 2015-12-05, version 2.5.0
+
+- Implemented support for numeric types `Fraction` and `BigNumber` in units.
+- Implemented new method `toNumeric` for units.
+- Implemented new units `arcsec`, `arcsecond`, `arcmin`, `arcminute`.
+  Thanks @devdevdata222.
+- Implemented new unit `Herts` (`Hz`). Thanks @SwamWithTurtles.
+- Fixed #485: Scoping issue with variables both used globally as well as in a
+  function definition.
+- Fixed: Function `number` didn't support `Fraction` as input.
+
+
+## 2015-11-14, version 2.4.2
+
+- Fixed #502: Issue with `format` in some JavaScript engines.
+- Fixed #503: Removed trailing commas and the use of keyword `import` as
+  property, as this gives issues with old JavaScript engines.
+
+
+## 2015-10-29, version 2.4.1
+
+- Fixed #480: `nthRoot` not working on Internet Explorer (up to IE 11).
+- Fixed #490: `nthRoot` returning an error for negative values like
+  `nthRoot(-2, 3)`.
+- Fixed #489: an issue with initializing a sparse matrix without data.
+  Thanks @Retsam.
+- Fixed: #493: function `combinations` did not throw an exception for
+  non-integer values of `k`.
+- Fixed: function `import` did not override typed functions when the option
+  override was set true.
+- Fixed: added functions `math.sparse` and `math.index` to the reference docs,
+  they where missing.
+- Fixed: removed memoization from `gamma` and `factorial` functions, this
+  could blow up memory.
+
+
+## 2015-10-09, version 2.4.0
+
+- Added support in the expression parser for mathematical alphanumeric symbols
+  in the expression parser: unicode range \u{1D400} to \u{1D7FF} excluding
+  invalid code points.
+- Extended function `distance` with more signatures. Thanks @kv-kunalvyas.
+- Fixed a bug in functions `sin` and `cos`, which gave wrong results for
+  BigNumber integer values around multiples of tau (i.e. `sin(bignumber(7))`).
+- Fixed value of unit `stone`. Thanks @Esvandiary for finding the error.
+
+
+## 2015-09-19, version 2.3.0
+
+- Implemented function `distance`. Thanks @devanp92.
+- Implemented support for Fractions in function `lcm`. Thanks @infusion.
+- Implemented function `cbrt` for numbers, complex numbers, BigNumbers, Units.
+- Implemented function `hypot`.
+- Upgraded to fraction.js v3.0.0.
+- Fixed #450: issue with non sorted index in sparse matrices.
+- Fixed #463, #322: inconsistent handling of implicit multiplication.
+- Fixed #444: factorial of infinity not returning infinity.
+
+
+## 2015-08-30, version 2.2.0
+
+- Units with powers (like `m^2` and `s^-1`) now output with the best prefix.
+- Implemented support for units to `abs`, `cube`, `sign`, `sqrt`, `square`.
+  Thanks @ericman314.
+- Implemented function `catalan` (Combinatorics). Thanks @devanp92.
+- Improved the `canDefineProperty` check to return false in case of IE8, which
+  has a broken implementation of `defineProperty`. Thanks @golmansax.
+- Fixed function `to` not working in case of a simplified unit.
+- Fixed #437: an issue with row swapping in `lup`, also affecting `lusolve`.
+
+
+## 2015-08-12, version 2.1.1
+
+- Fixed wrong values of the physical constants `speedOfLight`, `molarMassC12`,
+  and `magneticFluxQuantum`. Thanks @ericman314 for finding two of them.
+
+
+## 2015-08-11, version 2.1.0
+
+- Implemented derived units (like `110 km/h in m/s`). Thanks @ericman314.
+- Implemented support for electric units. Thanks @ericman314.
+- Implemented about 50 physical constants like `speedOfLight`, `gravity`, etc.
+- Implemented function `kldivergence` (Kullback-Leibler divergence).
+  Thanks @saromanov.
+- Implemented function `mode`. Thanks @kv-kunalvyas.
+- Added support for unicode characters in the expression parser: greek letters
+  and latin letters with accents. See #265.
+- Internal functions `Unit.parse` and `Complex.parse` now throw an Error
+  instead of returning null when passing invalid input.
+
+
+## 2015-07-29, version 2.0.1
+
+- Fixed operations with mixed fractions and numbers be converted to numbers
+  instead of fractions.
+
+
+## 2015-07-28, version 2.0.0
+
+- Large internal refactoring:
+  - performance improvements.
+  - allows to create custom bundles
+  - functions are composed using `typed-function` and are extensible
+- Implemented support for fractions, powered by the library `fraction.js`.
+- Implemented matrix LU decomposition with partial pivoting and a LU based
+  linear equations solver (functions `lup` and `lusolve`). Thanks @rjbaucells.
+- Implemented a new configuration option `predictable`, which can be set to
+  true in order to ensure predictable function output types.
+- Implemented function `intersect`. Thanks @kv-kunalvyas.
+- Implemented support for adding `toTex` properties to custom functions.
+  Thanks @FSMaxB.
+- Implemented support for complex values to `nthRoot`. Thanks @gangachris.
+- Implemented util functions `isInteger`, `isNegative`, `isNumeric`,
+  `isPositive`, and `isZero`.
+
+### breaking changes
+
+- String input is now converted to numbers by default for all functions.
+- Adding two strings will no longer concatenate them, but will convert the
+  strings to numbers and add them.
+- Function `index` does no longer accept an array `[start, end, step]`, but
+  instead accepts an array with arbitrary index values. It also accepts
+  a `Range` object as input.
+- Function `typeof` no longer returns lower case names, but now returns lower
+  case names for primitives (like `number`, `boolean`, `string`), and
+  upper-camel-case for non-primitives (like `Array`, `Complex`, `Function`).
+- Function `import` no longer supports a module name as argument. Instead,
+  modules can be loaded using require: `math.import(require('module-name'))`.
+- Function `import` has a new option `silent` to ignore errors, and throws
+  errors on duplicates by default.
+- Method `Node.compile()` no longer needs `math` to be passed as argument.
+- Reintroduced method `Node.eval([scope])`.
+- Function `sum` now returns zero when input is an empty array. Thanks @FSMAxB.
+- The size of Arrays is no longer validated. Matrices will validate this on
+  creation.
+
+
+## 2015-07-12, version 1.7.1
+
+- Fixed #397: Inaccuracies in nthRoot for very large values, and wrong results
+  for very small values. (backported from v2)
+- Fixed #405: Parser throws error when defining a function in a multiline
+  expression.
+
+
+## 2015-05-31, version 1.7.0
+
+- Implemented function `quantileSeq` and `partitionSelect`. Thanks @BigFav.
+- Implemented functions `stirlingS2`, `bellNumbers`, `composition`, and
+  `multinomial`. Thanks @devanp92.
+- Improved the performance of `median` (see #373). Thanks @BigFav.
+- Extended the command line interface with a `mode` option to output either
+  the expressions result, string representation, or tex representation.
+  Thanks @FSMaxB.
+- Fixed #309: Function median mutating the input matrix. Thanks @FSMaxB.
+- Fixed `Node.transform` not recursing over replaced parts of the
+  node tree (see #349).
+- Fixed #381: issue in docs of `randomInt`.
+
+
+## 2015-04-22, version 1.6.0
+
+- Improvements in `toTex`. Thanks @FSMaxB.
+- Fixed #328: `abs(0 + 0i)` evaluated to `NaN`.
+- Fixed not being able to override lazy loaded constants.
+
+
+## 2015-04-09, version 1.5.2
+
+- Fixed #313: parsed functions did not handle recursive calls correctly.
+- Fixed #251: binary prefix and SI prefix incorrectly used for byte. Now
+  following SI standards (`1 KiB == 1024 B`, `1 kB == 1000 B`).
+- Performance improvements in parsed functions.
+
+
+## 2015-04-08, version 1.5.1
+
+- Fixed #316: a bug in rounding values when formatting.
+- Fixed #317, #319: a bug in formatting negative values.
+
+
+## 2015-03-28, version 1.5.0
+
+- Added unit `stone` (6.35 kg).
+- Implemented support for sparse matrices. Thanks @rjbaucells.
+- Implemented BigNumber support for function `atan2`. Thanks @BigFav.
+- Implemented support for custom LaTeX representations. Thanks @FSMaxB.
+- Improvements and bug fixes in outputting parentheses in `Node.toString` and
+  `Node.toTex` functions. Thanks @FSMaxB.
+- Fixed #291: function `format` sometimes returning exponential notation when
+  it should return a fixed notation.
+
+
+## 2015-02-28, version 1.4.0
+
+- Implemented trigonometric functions:
+  `acosh`, `acoth`, `acsch`, `asech`, `asinh`, `atanh`, `acot`, `acsc`, `asec`.
+  Thanks @BigFav.
+- Added BigNumber support for functions: `cot`, `csc`, `sec`, `coth`,
+  `csch`, `sech`. Thanks @BigFav.
+- Implemented support for serialization and deserialization of math.js data
+  types.
+- Fixed the calculation of `norm()` and `abs()` for large complex numbers.
+  Thanks @rjbaucells.
+- Fixed #281: improved formatting complex numbers. Round the real or imaginary
+  part to zero when the difference is larger than the configured precision.
+
+
+## 2015-02-09, version 1.3.0
+
+- Implemented BigNumber implementations of most trigonometric functions: `sin`,
+  `cos`, `tan`, `asin`, `acos`, `atan`, `cosh`, `sinh`, `tanh`. Thanks @BigFav.
+- Implemented function `trace`. Thanks @pcorey.
+- Faster loading of BigNumber configuration with a high precision by lazy
+  loading constants like `pi` and `e`.
+- Fixed constants `NaN` and `Infinity` not being BigNumber objects when
+  BigNumbers are configured.
+- Fixed missing parentheses in the `toTex` representation of function
+  `permutations`.
+- Some minor fixes in the docs. Thanks @KenanY.
+
+
+## 2014-12-25, version 1.2.0
+
+- Support for bitwise operations `bitAnd`, `bitNot`, `bitOr`, `bitXor`,
+  `leftShift`, `rightArithShift`, and `rightLogShift`. Thanks @BigFav.
+- Support for boolean operations `and`, `not`, `or`, `xor`. Thanks @BigFav.
+- Support for `gamma` function. Thanks @BigFav.
+- Converting a unit without value will now result in a unit *with* value,
+  i.e. `inch in cm` will return `2.54 cm` instead of `cm`.
+- Improved accuracy of `sinh` and complex `cos` and `sin`. Thanks @pavpanchekha.
+- Renamed function `select` to `chain`. The old function `select` will remain
+  functional until math.js v2.0.
+- Upgraded to decimal.js v4.0.1 (BigNumber library).
+
+
+## 2014-11-22, version 1.1.1
+
+- Fixed Unit divided by Number returning zero.
+- Fixed BigNumber downgrading to Number for a negative base in `pow`.
+- Fixed some typos in error messaging (thanks @andy0130tw) and docs.
+
+
+## 2014-11-15, version 1.1.0
+
+- Implemented functions `dot` (dot product), `cross` (cross product), and
+  `nthRoot`.
+- Officially opened up the API of expression trees:
+  - Documented the API.
+  - Implemented recursive functions `clone`, `map`, `forEach`, `traverse`,
+    `transform`, and `filter` for expression trees.
+  - Parameter `index` in the callbacks of `map` and `forEach` are now cloned
+    for every callback.
+  - Some internal refactoring inside nodes to make the API consistent:
+    - Renamed `params` to `args` and vice versa to make things consistent.
+    - Renamed `Block.nodes` to `Block.blocks`.
+    - `FunctionNode` now has a `name: string` instead of a `symbol: SymbolNode`.
+    - Changed constructor of `RangeNode` to
+      `new RangeNode(start: Node, end: Node [, step: Node])`.
+    - Nodes for a `BlockNode` must now be passed via the constructor instead
+      of via a function `add`.
+- Fixed `2e` giving a syntax error instead of being parsed as `2 * e`.
+
+
+## 2014-09-12, version 1.0.1
+
+- Disabled array notation for ranges in a matrix index in the expression parser
+  (it is confusing and redundant there).
+- Fixed a regression in the build of function subset not being able to return
+  a scalar.
+- Fixed some missing docs and broken links in the docs.
+
+
+## 2014-09-04, version 1.0.0
+
+- Implemented a function `filter(x, test)`.
+- Removed `math.distribution` for now, needs some rethinking.
+- `math.number` can convert units to numbers (requires a second argument)
+- Fixed some precedence issues with the range and conversion operators.
+- Fixed an zero-based issue when getting a matrix subset using an index
+  containing a matrix.
+
+
+## 2014-08-21, version 0.27.0
+
+- Implemented functions `sort(x [, compare])` and `flatten(x)`.
+- Implemented support for `null` in all functions.
+- Implemented support for "rawArgs" functions in the expression parser. Raw
+  functions are invoked with unevaluated parameters (nodes).
+- Expressions in the expression parser can now be spread over multiple lines,
+  like '2 +\n3'.
+- Changed default value of the option `wrap` of function `math.import` to false.
+- Changed the default value for new entries in a resized matrix when to zero.
+  To leave new entries uninitialized, use the new constant `math.uninitialized`
+  as default value.
+- Renamed transform property from `__transform__` to `transform`, and documented
+  the transform feature.
+- Fixed a bug in `math.import` not applying options when passing a module name.
+- A returned matrix subset is now only squeezed when the `index` consists of
+  scalar values, and no longer for ranges resolving into a single value.
+
+
+## 2014-08-03, version 0.26.0
+
+- A new instance of math.js can no longer be created like `math([options])`,
+  to prevent side effects from math being a function instead of an object.
+  Instead, use the function `math.create([options])` to create a new instance.
+- Implemented `BigNumber` support for all constants: `pi`, `tau`, `e`, `phi`,
+  `E`, `LN2`, `LN10`, `LOG2E`, `LOG10E`, `PI`, `SQRT1_2`, and `SQRT2`.
+- Implemented `BigNumber` support for functions `gcd`, `xgcd`, and `lcm`.
+- Fixed function `gxcd` returning an Array when math.js was configured
+  as `{matrix: 'matrix'}`.
+- Multi-line expressions now return a `ResultSet` instead of an `Array`.
+- Implemented transforms (used right now to transform one-based indices to
+  zero-based for expressions).
+- When used inside the expression parser, functions `concat`, `min`, `max`,
+  and `mean` expect an one-based dimension number.
+- Functions `map` and `forEach` invoke the callback with one-based indices
+  when used from within the expression parser.
+- When adding or removing dimensions when resizing a matrix, the dimensions
+  are added/removed from the inner side (right) instead of outer side (left).
+- Improved index out of range errors.
+- Fixed function `concat` not accepting a `BigNumber` for parameter `dim`.
+- Function `squeeze` now squeezes both inner and outer singleton dimensions.
+- Output of getting a matrix subset is not automatically squeezed anymore
+  except for scalar output.
+- Renamed `FunctionNode` to `FunctionAssignmentNode`, and renamed `ParamsNode`
+  to `FunctionNode` for more clarity.
+- Fixed broken auto completion in CLI.
+- Some minor fixes.
+
+
+## 2014-07-01, version 0.25.0
+
+- The library now immediately returns a default instance of mathjs, there is
+  no need to instantiate math.js in a separate step unless one ones to set
+  configuration options:
+
+        // instead of:
+        var mathjs = require('mathjs'),  // load math.js
+            math = mathjs();             // create an instance
+
+        // just do:
+        var math = require('mathjs');
+- Implemented support for implicit multiplication, like `math.eval('2a', {a:3})`
+  and `math.eval('(2+3)(1-3)')`. This changes behavior of matrix indexes as
+  well: an expression like `[...][...]` is not evaluated as taking a subset of
+  the first matrix, but as an implicit multiplication of two matrices.
+- Removed utility function `ifElse`. This function is redundant now the
+  expression parser has a conditional operator `a ? b : c`.
+- Fixed a bug with multiplying a number with a temperature,
+  like `math.eval('10 * celsius')`.
+- Fixed a bug with symbols having value `undefined` not being evaluated.
+
+
+## 2014-06-20, version 0.24.1
+
+- Something went wrong with publishing on npm.
+
+
+## 2014-06-20, version 0.24.0
+
+- Added constant `null`.
+- Functions `equal` and `unequal` support `null` and `undefined` now.
+- Function `typeof` now recognizes regular expressions as well.
+- Objects `Complex`, `Unit`, and `Help` now return their string representation
+  when calling `.valueOf()`.
+- Changed the default number of significant digits for BigNumbers from 20 to 64.
+- Changed the behavior of the conditional operator (a ? b : c) to lazy
+  evaluating.
+- Fixed imported, wrapped functions not accepting `null` and `undefined` as
+  function arguments.
+
+
+## 2014-06-10, version 0.23.0
+
+- Renamed some functions (everything now has a logical, camel case name):
+  - Renamed functions `edivide`, `emultiply`, and `epow` to `dotDivide`,
+    `dotMultiply`, and `dotPow` respectively.
+  - Renamed functions `smallereq` and `largereq` to `smallerEq` and `largerEq`.
+  - Renamed function `unary` to `unaryMinus` and added support for strings.
+- `end` is now a reserved keyword which cannot be used as function or symbol
+  name in the expression parser, and is not allowed in the scope against which
+  an expression is evaluated.
+- Implemented function `unaryPlus` and unary plus operator.
+- Implemented function `deepEqual` for matrix comparisons.
+- Added constant `phi`, the golden ratio (`phi = 1.618...`).
+- Added constant `version`, returning the version number of math.js as string.
+- Added unit `drop` (`gtt`).
+- Fixed not being able to load math.js using AMD/require.js.
+- Changed signature of `math.parse(expr, nodes)` to `math.parse(expr, options)`
+  where `options: {nodes: Object.<String, Node>}`
+- Removed matrix support from conditional function `ifElse`.
+- Removed automatic assignment of expression results to variable `ans`.
+  This functionality can be restored by pre- or postprocessing every evaluation,
+  something like:
+
+        function evalWithAns (expr, scope) {
+          var ans = math.eval(expr, scope);
+          if (scope) {
+            scope.ans = ans;
+          }
+          return ans;
+        }
+
+
+## 2014-05-22, version 0.22.0
+
+- Implemented support to export expressions to LaTeX. Thanks Niels Heisterkamp
+  (@nheisterkamp).
+- Output of matrix multiplication is now consistently squeezed.
+- Added reference documentation in the section /docs/reference.
+- Fixed a bug in multiplying units without value with a number (like `5 * cm`).
+- Fixed a bug in multiplying two matrices containing vectors (worked fine for
+  arrays).
+- Fixed random functions not accepting Matrix as input, and always returning
+  a Matrix as output.
+
+
+## 2014-05-13, version 0.21.1
+
+- Removed `crypto` library from the bundle.
+- Deprecated functions `Parser.parse` and `Parser.compile`. Use
+  `math.parse` and `math.compile` instead.
+- Fixed function `add` not adding strings and matrices element wise.
+- Fixed parser not being able to evaluate an exponent followed by a unary minus
+  like `2^-3`, and a transpose followed by an index like `[3]'[1]`.
+
+
+## 2014-04-24, version 0.21.0
+
+- Implemented trigonometric hyperbolic functions `cosh`, `coth`, `csch`,
+  `sech`, `sinh`, `tanh`. Thanks Rogelio J. Baucells (@rjbaucells).
+- Added property `type` to all expression nodes in an expression tree.
+- Fixed functions `log`, `log10`, `pow`, and `sqrt` not supporting complex
+  results from BigNumber input (like `sqrt(bignumber(-4))`).
+
+
+## 2014-04-16, version 0.20.0
+
+- Switched to module `decimal.js` for BigNumber support, instead of
+  `bignumber.js`.
+- Implemented support for polar coordinates to the `Complex` datatype.
+  Thanks Finn Pauls (@finnp).
+- Implemented BigNumber support for functions `exp`, `log`, and `log10`.
+- Implemented conditional operator `a ? b : c` in expression parser.
+- Improved floating point comparison: the functions now check whether values
+  are nearly equal, against a configured maximum relative difference `epsilon`.
+  Thanks Rogelio J. Baucells (@rjbaucells).
+- Implemented function `norm`. Thanks Rogelio J. Baucells (@rjbaucells).
+- Improved function `ifElse`, is now specified for special data types too.
+- Improved function `det`. Thanks Bryan Cuccioli (@bcuccioli).
+- Implemented `BigNumber` support for functions `det` and `diag`.
+- Added unit alias `lbs` (pound mass).
+- Changed configuration option `decimals` to `precision` (applies to BigNumbers
+  only).
+- Fixed support for element-wise comparisons between a string and a matrix.
+- Fixed: expression parser now trows IndexErrors with one-based indices instead
+  of zero-based.
+- Minor bug fixes.
+
+
+## 2014-03-30, version 0.19.0
+
+- Implemented functions `compare`, `sum`, `prod`, `var`, `std`, `median`.
+- Implemented function `ifElse` Thanks @mtraynham.
+- Minor bug fixes.
+
+
+## 2014-02-15, version 0.18.1
+
+- Added unit `feet`.
+- Implemented function `compile` (shortcut for parsing and then compiling).
+- Improved performance of function `pow` for matrices. Thanks @hamadu.
+- Fixed broken auto completion in the command line interface.
+- Fixed an error in function `combinations` for large numbers, and
+  improved performance of both functions `combinations` and `permutations`.
+
+
+## 2014-01-18, version 0.18.0
+
+- Changed matrix index notation of expression parser from round brackets to
+  square brackets, for example `A[1, 1:3]` instead of `A(1, 1:3)`.
+- Removed need to use the `function` keyword for function assignments in the
+  expression parser, you can define a function now like `f(x) = x^2`.
+- Implemented a compilation step in the expression parser: expressions are
+  compiled into JavaScript, giving much better performance (easily 10x as fast).
+- Renamed unit conversion function and operator `in` to `to`. Operator `in` is
+  still available in the expression parser as an alias for `to`. Added unit
+  `in`, an abbreviation for `inch`. Thanks Elijah Insua (@tmpvar).
+- Added plurals and aliases for units.
+- Implemented an argument `includeEnd` for function `range` (false by default).
+- Ranges in the expression parser now support big numbers.
+- Implemented functions `permutations` and `combinations`.
+  Thanks Daniel Levin (@daniel-levin).
+- Added lower case abbreviation `l` for unit litre.
+
+
+## 2013-12-19, version 0.17.1
+
+- Fixed a bug with negative temperatures.
+- Fixed a bug with prefixes of units squared meter `m2` and cubic meter `m3`.
+
+
+## 2013-12-12, version 0.17.0
+
+- Renamed and flattened configuration settings:
+  - `number.defaultType` is now `number`.
+  - `number.precision` is now `decimals`.
+  - `matrix.defaultType` is now `matrix`.
+- Function `multiply` now consistently outputs a complex number on complex input.
+- Fixed `mod` and `in` not working as function (only as operator).
+- Fixed support for old browsers (IE8 and older), compatible when using es5-shim.
+- Fixed support for Java's ScriptEngine.
+
+
+## 2013-11-28, version 0.16.0
+
+- Implemented BigNumber support for arbitrary precision calculations.
+  Added settings `number.defaultType` and `number.precision` to configure
+  big numbers.
+- Documentation is extended.
+- Removed utility functions `isScalar`, `toScalar`, `isVector`, `toVector`
+  from `Matrix` and `Range`. Use `math.squeeze` and `math.size` instead.
+- Implemented functions `get` and `set` on `Matrix`, for easier and faster
+  retrieval/replacement of elements in a matrix.
+- Implemented function `resize`, handling matrices, scalars, and strings.
+- Functions `ones` and `zeros` now return an empty matrix instead of a
+  number 1 or 0 when no arguments are provided.
+- Implemented functions `min` and `max` for `Range` and `Index`.
+- Resizing matrices now leaves new elements undefined by default instead of
+  filling them with zeros. Function `resize` now has an extra optional
+  parameter `defaultValue`.
+- Range operator `:` in expression parser has been given a higher precedence.
+- Functions don't allow arguments of unknown type anymore.
+- Options be set when constructing a math.js instance or using the new function
+  `config(options`. Options are no longer accessible via `math.options`.
+- Renamed `scientific` notation to `exponential` in function `format`.
+- Function `format` outputs exponential notation with positive exponents now
+  always with `+` sign, so outputs `2.1e+3` instead of `2.1e3`.
+- Fixed function `squeeze` not being able squeeze into a scalar.
+- Some fixes and performance improvements in the `resize` and `subset`
+  functions.
+- Function `size` now adheres to the option `matrix.defaultType` for scalar
+  input.
+- Minor bug fixes.
+
+
+## 2013-10-26, version 0.15.0
+
+- Math.js must be instantiated now, static calls are no longer supported. Usage:
+  - node.js: `var math = require('mathjs')();`
+  - browser: `var math = mathjs();`
+- Implemented support for multiplying vectors with matrices.
+- Improved number formatting:
+  - Function `format` now support various options: precision, different
+    notations (`fixed`, `scientific`, `auto`), and more.
+  - Numbers are no longer rounded to 5 digits by default when formatted.
+  - Implemented a function `format` for `Matrix`, `Complex`, `Unit`, `Range`,
+    and `Selector` to format using options.
+  - Function `format` does only stringify values now, and has a new parameter
+    `precision` to round to a specific number of digits.
+  - Removed option `math.options.precision`,
+    use `math.format(value [, precision])` instead.
+  - Fixed formatting numbers as scientific notation in some cases returning
+    a zero digit left from the decimal point. (like "0.33333e8" rather than
+    "3.3333e7"). Thanks @husayt.
+- Implemented a function `print` to interpolate values in a template string,
+  this functionality was moved from the function `format`.
+- Implemented statistics function `mean`. Thanks Guillermo Indalecio Fernandez
+  (@guillermobox).
+- Extended and changed `max` and `min` for multi dimensional matrices: they now
+  return the maximum and minimum of the flattened array. An optional second
+  argument `dim` allows to calculate the `max` or `min` for specified dimension.
+- Renamed option `math.options.matrix.default` to
+  `math.options.matrix.defaultType`.
+- Removed support for comparing complex numbers in functions `smaller`,
+  `smallereq`, `larger`, `largereq`. Complex numbers cannot be ordered.
+
+
+## 2013-10-08, version 0.14.0
+
+- Introduced an option `math.options.matrix.default` which can have values
+  `matrix` (default) or `array`. This option is used by the functions `eye`,
+  `ones`, `range`, and `zeros`, to determine the type of matrix output.
+- Getting a subset of a matrix will automatically squeeze the resulting subset,
+  setting a subset of a matrix will automatically unsqueeze the given subset.
+- Removed concatenation of nested arrays in the expression parser.
+  You can now input nested arrays like in JavaScript. Matrices can be
+  concatenated using the function `concat`.
+- The matrix syntax `[...]` in the expression parser now creates 1 dimensional
+  matrices by default. `math.eval('[1,2,3,4]')` returns a matrix with
+  size `[4]`, `math.eval('[1,2;3,4]')` returns a matrix with size `[2,2]`.
+- Documentation is restructured and extended.
+- Fixed non working operator `mod` (modulus operator).
+
+
+## 2013-09-03, version 0.13.0
+
+- Implemented support for booleans in all relevant functions.
+- Implemented functions `map` and `forEach`. Thanks Sebastien Piquemal (@sebpic).
+- All construction functions can be used to convert the type of variables,
+  also element-wise for all elements in an Array or Matrix.
+- Changed matrix indexes of the expression parser to one-based with the
+  upper-bound included, similar to most math applications. Note that on a
+  JavaScript level, math.js uses zero-based indexes with excluded upper-bound.
+- Removed support for scalars in the function `subset`, it now only supports
+  Array, Matrix, and String.
+- Removed the functions `get` and `set` from a selector, they are a duplicate
+  of the function `subset`.
+- Replaced functions `get` and `set` of `Matrix` with a single function
+  `subset`.
+- Some moving around with code and namespaces:
+  - Renamed namespace `math.expr` to `math.expression` (contains Scope, Parser,
+    node objects).
+  - Renamed namespace `math.docs` to `math.expression.docs`.
+  - Moved `math.expr.Selector` to `math.chaining.Selector`.
+- Fixed some edge cases in functions `lcm` and `xgcd`.
+
+
+## 2013-08-22, version 0.12.1
+
+- Fixed outdated version of README.md.
+- Fixed a broken unit test.
+
+
+## 2013-08-22, version 0.12.0
+
+- Implemented functions `random([min, max])`, `randomInt([min, max])`,
+  `pickRandom(array)`. Thanks Sebastien Piquemal (@sebpic).
+- Implemented function `distribution(name)`, generating a distribution object
+  with functions `random`, `randomInt`, `pickRandom` for different
+  distributions. Currently supporting `uniform` and `normal`.
+- Changed the behavior of `range` to exclude the upper bound, so `range(1, 4)`
+  now returns `[1, 2, 3]` instead of `[1, 2, 3, 4]`.
+- Changed the syntax of `range`, which is now `range(start, end [, step])`
+  instead of `range(start, [step, ] end)`.
+- Changed the behavior of `ones` and `zeros` to geometric dimensions, for
+  example `ones(3)` returns a vector with length 3, filled with ones, and
+  `ones(3,3)` returns a 2D array with size [3, 3].
+- Changed the return type of `ones` and `zeros`: they now return an Array when
+  arguments are Numbers or an Array, and returns a Matrix when the argument
+  is a Matrix.
+- Change matrix index notation in parser from round brackets to square brackets,
+  for example `A[0, 0:3]`.
+- Removed the feature introduced in v0.10.0 to automatically convert a complex
+  value with an imaginary part equal to zero to a number.
+- Fixed zeros being formatted as null. Thanks @TimKraft.
+
+
+## 2013-07-23, version 0.11.1
+
+- Fixed missing development dependency
+
+
+## 2013-07-23, version 0.11.0
+
+- Changed math.js from one-based to zero-based indexes.
+  - Getting and setting matrix subset is now zero-based.
+  - The dimension argument in function `concat` is now zero-based.
+- Improvements in the string output of function help.
+- Added constants `true` and `false`.
+- Added constructor function `boolean`.
+- Fixed function `select` not accepting `0` as input.
+  Thanks Elijah Manor (@elijahmanor).
+- Parser now supports multiple unary minus operators after each other.
+- Fixed not accepting empty matrices like `[[], []]`.
+- Some fixes in the end user documentation.
+
+
+## 2013-07-08, version 0.10.0
+
+- For complex calculations, all functions now automatically replace results
+  having an imaginary part of zero with a Number. (`2i * 2i` now returns a
+  Number `-4` instead of a Complex `-4 + 0i`).
+- Implemented support for injecting custom node handlers in the parser. Can be
+  used for example to implement a node handler for plotting a graph.
+- Implemented end user documentation and a new `help` function.
+- Functions `size` and `squeeze` now return a Matrix instead of an Array as
+  output on Matrix input.
+- Added a constant tau (2 * pi). Thanks Zak Zibrat (@palimpsests).
+- Renamed function `unaryminus` to `unary`.
+- Fixed a bug in determining node dependencies in function assignments.
+
+
+## 2013-06-14, version 0.9.1
+
+- Implemented element-wise functions and operators: `emultiply` (`x .* y`),
+  `edivide` (`x ./ y`), `epow` (`x .^ y`).
+- Added constants `Infinity` and `NaN`.
+- Removed support for Workspace to keep the library focused on its core task.
+- Fixed a bug in the Complex constructor, not accepting NaN values.
+- Fixed division by zero in case of pure complex values.
+- Fixed a bug in function multiply multiplying a pure complex value with
+  Infinity.
+
+
+## 2013-05-29, version 0.9.0
+
+- Implemented function `math.parse(expr [,scope])`. Optional parameter scope can
+  be a plain JavaScript Object containing variables.
+- Extended function `math.expr(expr [, scope])` with an additional parameter
+  `scope`, similar to `parse`. Example: `math.eval('x^a', {x:3, a:2});`.
+- Implemented function `subset`, to get or set a subset from a matrix, string,
+  or other data types.
+- Implemented construction functions number and string (mainly useful inside
+  the parser).
+- Improved function `det`. Thanks Bryan Cuccioli (@bcuccioli).
+- Moved the parse code from prototype math.expr.Parser to function math.parse,
+  simplified Parser a little bit.
+- Strongly simplified the code of Scope and Workspace.
+- Fixed function mod for negative numerators, and added error messages in case
+  of wrong input.
+
+
+## 2013-05-18, version 0.8.2
+
+- Extended the import function and some other minor improvements.
+- Fixed a bug in merging one dimensional vectors into a matrix.
+- Fixed a bug in function subtract, when subtracting a complex number from a
+  real number.
+
+
+## 2013-05-10, version 0.8.1
+
+- Fixed an npm warning when installing mathjs globally.
+
+
+## 2013-05-10, version 0.8.0
+
+- Implemented a command line interface. When math.js is installed globally via
+  npm, the application is available on your system as 'mathjs'.
+- Implemented `end` keyword for index operator, and added support for implicit
+  start and end (expressions like `a(2,:)` and `b(2:end,3:end-1)` are supported
+  now).
+- Function math.eval is more flexible now: it supports variables and multi-line
+  expressions.
+- Removed the read-only option from Parser and Scope.
+- Fixed non-working unequal operator != in the parser.
+- Fixed a bug in resizing matrices when replacing a subset.
+- Fixed a bug in updating a subset of a non-existing variable.
+- Minor bug fixes.
+
+
+## 2013-05-04, version 0.7.2
+
+- Fixed method unequal, which was checking for equality instead of inequality.
+  Thanks @FJS2.
+
+
+## 2013-04-27, version 0.7.1
+
+- Improvements in the parser:
+  - Added support for chained arguments.
+  - Added support for chained variable assignments.
+  - Added a function remove(name) to remove a variable from the parsers scope.
+  - Renamed nodes for more consistency and to resolve naming conflicts.
+  - Improved stringification of an expression tree.
+  - Some simplifications in the code.
+  - Minor bug fixes.
+- Fixed a bug in the parser, returning NaN instead of throwing an error for a
+  number with multiple decimal separators like `2.3.4`.
+- Fixed a bug in Workspace.insertAfter.
+- Fixed: math.js now works on IE 6-8 too.
+
+
+## 2013-04-20, version 0.7.0
+
+- Implemented method `math.eval`, which uses a readonly parser to evaluate
+  expressions.
+- Implemented method `xgcd` (extended eucledian algorithm). Thanks Bart Kiers
+  (@bkiers).
+- Improved math.format, which now rounds values to a maximum number of digits
+  instead of decimals (default is 5 digits, for example `math.format(math.pi)`
+  returns `3.1416`).
+- Added examples.
+- Changed methods square and cube to evaluate matrices element wise (consistent
+  with all other methods).
+- Changed second parameter of method import to an object with options.
+- Fixed method math.typeof on IE.
+- Minor bug fixes and improvements.
+
+
+## 2013-04-13, version 0.6.0
+
+- Implemented chained operations via method math.select(). For example
+  `math.select(3).add(4).subtract(2).done()` will return `5`.
+- Implemented methods gcd and lcm.
+- Implemented method `Unit.in(unit)`, which creates a clone of the unit with a
+  fixed representation. For example `math.unit('5.08 cm').in('inch')` will
+  return a unit which string representation always is in inch, thus `2 inch`.
+  `Unit.in(unit)` is the same as method `math.in(x, unit)`.
+- Implemented `Unit.toNumber(unit)`, which returns the value of the unit when
+  represented with given unit. For example
+  `math.unit('5.08 cm').toNumber('inch')` returns the number `2`, as the
+  representation of the unit in inches has 2 as value.
+- Improved: method `math.in(x, unit)` now supports a string as second parameter,
+  for example `math.in(math.unit('5.08 cm'), 'inch')`.
+- Split the end user documentation of the parser functions from the source
+  files.
+- Removed function help and the built-in documentation from the core library.
+- Fixed constant i being defined as -1i instead of 1i.
+- Minor bug fixes.
+
+
+## 2013-04-06, version 0.5.0
+
+- Implemented data types Matrix and Range.
+- Implemented matrix methods clone, concat, det, diag, eye, inv, ones, size,
+  squeeze, transpose, zeros.
+- Implemented range operator `:`, and transpose operator `'` in parser.
+- Changed: created construction methods for easy object creation for all data
+  types and for the parser. For example, a complex value is now created
+  with `math.complex(2, 3)` instead of `new math.Complex(2, 3)`, and a parser
+  is now created with `math.parser()` instead of `new math.parser.Parser()`.
+- Changed: moved all data types under the namespace math.type, and moved the
+  Parser, Workspace, etc. under the namespace math.expr.
+- Changed: changed operator precedence of the power operator:
+  - it is now right associative instead of left associative like most scripting
+    languages. So `2^3^4` is now calculated as `2^(3^4)`.
+  - it has now higher precedence than unary minus most languages, thus `-3^2` is
+    now calculated as `-(3^2)`.
+- Changed: renamed the parsers method 'put' into 'set'.
+- Fixed: method 'in' did not check for units to have the same base.
+
+
+## 2013-03-16, version 0.4.0
+
+- Implemented Array support for all methods.
+- Implemented Array support in the Parser.
+- Implemented method format.
+- Implemented parser for units, math.Unit.parse(str).
+- Improved parser for complex values math.Complex.parse(str);
+- Improved method help: it now evaluates the examples.
+- Fixed: a scoping issue with the Parser when defining functions.
+- Fixed: method 'typeof' was not working well with minified and mangled code.
+- Fixed: errors in determining the best prefix for a unit.
+
+
+## 2013-03-09, version 0.3.0
+
+- Implemented Workspace
+- Implemented methods cot, csc, sec.
+- Implemented Array support for methods with one parameter.
+
+
+## 2013-02-25, version 0.2.0
+
+- Parser, Scope, and expression tree with Nodes implemented.
+- Implemented method import which makes it easy to extend math.js.
+- Implemented methods arg, conj, cube, equal, factorial, im, largereq,
+  log(x, base), log10, mod, re, sign, smallereq, square, unequal.
+
+
+## 2013-02-18, version 0.1.0
+
+- Reached full compatibility with Javascripts built-in Math library.
+- More functions implemented.
+- Some bugfixes.
+
+
+## 2013-02-16, version 0.0.2
+
+- All constants of Math implemented, plus the imaginary unit i.
+- Data types Complex and Unit implemented.
+- First set of functions implemented.
+
+
+## 2013-02-15, version 0.0.1
+
+- First publish of the mathjs package. (package is still empty)
diff --git a/node_modules/mathjs/LICENSE b/node_modules/mathjs/LICENSE
new file mode 100644
index 0000000..9cf8c11
--- /dev/null
+++ b/node_modules/mathjs/LICENSE
@@ -0,0 +1,176 @@
+                               Apache License
+                           Version 2.0, January 2004
+                        https://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
diff --git a/node_modules/mathjs/NOTICE b/node_modules/mathjs/NOTICE
new file mode 100644
index 0000000..3da7407
--- /dev/null
+++ b/node_modules/mathjs/NOTICE
@@ -0,0 +1,16 @@
+math.js
+https://github.com/josdejong/mathjs
+
+Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   https://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
diff --git a/node_modules/mathjs/README.md b/node_modules/mathjs/README.md
new file mode 100644
index 0000000..8a88a1b
--- /dev/null
+++ b/node_modules/mathjs/README.md
@@ -0,0 +1,197 @@
+![math.js](https://raw.github.com/josdejong/mathjs/master/misc/img/mathjs.png)
+
+[https://mathjs.org](https://mathjs.org)
+
+Math.js is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with different data types like numbers, big numbers, complex numbers, fractions, units, and matrices. Powerful and easy to use.
+
+[![Version](https://img.shields.io/npm/v/mathjs.svg)](https://www.npmjs.com/package/mathjs)
+[![Downloads](https://img.shields.io/npm/dm/mathjs.svg)](https://www.npmjs.com/package/mathjs)
+[![Build Status](https://github.com/josdejong/mathjs/workflows/Node.js%20CI/badge.svg)](https://github.com/josdejong/mathjs/actions)
+[![Maintenance](https://img.shields.io/maintenance/yes/2022.svg)](https://github.com/josdejong/mathjs/graphs/commit-activity)
+[![License](https://img.shields.io/github/license/josdejong/mathjs.svg)](https://github.com/josdejong/mathjs/blob/master/LICENSE)
+[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2Fjosdejong%2Fmathjs.svg?type=shield)](https://app.fossa.io/projects/git%2Bgithub.com%2Fjosdejong%2Fmathjs?ref=badge_shield)
+[![Codecov](https://codecov.io/gh/josdejong/mathjs/branch/develop/graph/badge.svg)](https://codecov.io/gh/josdejong/mathjs)
+[![Github Sponsor](https://camo.githubusercontent.com/7d9333b097b2f54a8957d126ab82937811489c9b75c3850f609985cf94cd29fe/68747470733a2f2f696d672e736869656c64732e696f2f62616467652f2532302d53706f6e736f722532306d652532306f6e2532304769744875622d6f72616e6765)](https://github.com/sponsors/josdejong)
+
+## Features
+
+- Supports numbers, big numbers, complex numbers, fractions, units, strings, arrays, and matrices.
+- Is compatible with JavaScript's built-in Math library.
+- Contains a flexible expression parser.
+- Does symbolic computation.
+- Comes with a large set of built-in functions and constants.
+- Can be used as a command line application as well.
+- Runs on any JavaScript engine.
+- Is easily extensible.
+- Open source.
+
+## Usage
+
+Math.js can be used in both node.js and in the browser.
+
+Install math.js using [npm](https://www.npmjs.com/package/mathjs):
+
+    npm install mathjs
+
+Or download mathjs via one of the CDN's listed on the downloads page:
+
+&nbsp;&nbsp;&nbsp;&nbsp;[https://mathjs.org/download.html](https://mathjs.org/download.html#download)
+
+Math.js can be used similar to JavaScript's built-in Math library. Besides that,
+math.js can evaluate
+[expressions](https://mathjs.org/docs/expressions/index.html)
+and supports
+[chained operations](https://mathjs.org/docs/core/chaining.html).
+
+```js
+import {
+  atan2, chain, derivative, e, evaluate, log, pi, pow, round, sqrt
+} from 'mathjs'
+
+// functions and constants
+round(e, 3)                    // 2.718
+atan2(3, -3) / pi              // 0.75
+log(10000, 10)                 // 4
+sqrt(-4)                       // 2i
+pow([[-1, 2], [3, 1]], 2)      // [[7, 0], [0, 7]]
+derivative('x^2 + x', 'x')     // 2 * x + 1
+
+// expressions
+evaluate('12 / (2.3 + 0.7)')   // 4
+evaluate('12.7 cm to inch')    // 5 inch
+evaluate('sin(45 deg) ^ 2')    // 0.5
+evaluate('9 / 3 + 2i')         // 3 + 2i
+evaluate('det([-1, 2; 3, 1])') // -7
+
+// chaining
+chain(3)
+    .add(4)
+    .multiply(2)
+    .done()  // 14
+```
+
+See the [Getting Started](https://mathjs.org/docs/getting_started.html) for a more detailed tutorial.
+
+
+## Browser support
+
+Math.js works on any ES5 compatible JavaScript engine: node.js, Chrome, Firefox, Safari, Edge, and IE11.
+
+
+## Documentation
+
+- [Getting Started](https://mathjs.org/docs/getting_started.html)
+- [Examples](https://mathjs.org/examples/index.html)
+- [Overview](https://mathjs.org/docs/index.html)
+- [History](https://mathjs.org/history.html)
+
+
+## Build
+
+First clone the project from github:
+
+    git clone git://github.com/josdejong/mathjs.git
+    cd mathjs
+
+Install the project dependencies:
+
+    npm install
+
+Then, the project can be build by executing the build script via npm:
+
+    npm run build
+
+This will build ESM output, CommonJS output, and the bundle math.js
+from the source files and put them in the folder lib.
+
+
+## Develop
+
+When developing new features for mathjs, it is good to be aware of the following background information.
+
+### Code
+
+The code of `mathjs` is written in ES modules, and requires all files to have a real, relative path, meaning the files must have a `*.js` extension. Please configure adding file extensions on auto import in your IDE.
+
+### Architecture
+
+What mathjs tries to achieve is to offer an environment where you can do calculations with mixed data types,
+like multiplying a regular `number` with a `Complex` number or a `BigNumber`, and work with all of those in matrices.
+Mathjs also allows to add a new data type, like say `BigInt`, with little effort.
+
+The solution that mathjs uses has two main ingredients:
+
+- **Typed functions**. All functions are created using [`typed-function`](https://github.com/josdejong/typed-function/). This makes it easier to (dynamically) create and extend a single function with new data types, automatically do type conversions on function inputs, etc. So, if you create function multiply for two `number`s, you can extend it with support for multiplying two `BigInts`. If you define a conversion from `BigInt` to `number`, the typed-function will automatically allow you to multiply a `BigInt` with a `number`.
+
+- **Dependency injection**. When we have a function `multiply` with support for `BigInt`, thanks to the dependency injection, other functions using `multiply` under the hood, like `prod`, will automatically support `BigInt` too. This also works the other way around: if you don't need the heavyweight `multiply` (which supports BigNumbers, matrices, etc), and you just need a plain and simple number support, you can use a lightweight implementation of `multiply` just for numbers, and inject that in `prod` and other functions.
+
+At the lowest level, mathjs has immutable factory functions which create immutable functions. The core function `math.create(...)` creates a new instance having functions created from all passed factory functions. A mathjs instance is a collection of created functions. It contains a function like `math.import` to allow extending the instance with new functions, which can then be used in the expression parser.
+
+### Build scripts
+
+The build script currently generates two types of output:
+
+- **any**, generate entry points to create full versions of all functions
+- **number**: generating and entry points to create lightweight functions just supporting `number`
+
+For each function, an object is generated containing the factory functions of all dependencies of the function. This allows to just load a specific set of functions, and not load or bundle any other functionality. So for example, to just create function `add` you can do `math.create(addDependencies)`.
+
+
+## Test
+
+To execute tests for the library, install the project dependencies once:
+
+    npm install
+
+Then, the tests can be executed:
+
+    npm test
+
+Additionally, the tests can be run on FireFox using [headless mode](https://developer.mozilla.org/en-US/Firefox/Headless_mode):
+
+    npm run test:browser
+
+To run the tests remotely on BrowserStack, first set the environment variables `BROWSER_STACK_USERNAME` and `BROWSER_STACK_ACCESS_KEY` with your username and access key and then execute:
+
+    npm run test:browserstack
+
+You can separately run the code linter, though it is also executed with `npm test`:
+
+    npm run lint
+
+To automatically fix linting issue, run:
+
+    npm run format
+
+To test code coverage of the tests:
+
+    npm run coverage
+
+To see the coverage results, open the generated report in your browser:
+
+    ./coverage/lcov-report/index.html
+
+
+### Continuous integration testing
+
+Continuous integration tests are run on [Github Actions](https://github.com/josdejong/mathjs/actions) and [BrowserStack](https://www.browserstack.com) every time a commit is pushed to github. Github Actions runs the tests for different versions of node.js, and BrowserStack runs the tests on all major browsers.
+
+[![BrowserStack](https://raw.github.com/josdejong/mathjs/master/misc/browserstack.png)](https://www.browserstack.com)
+
+Thanks Github Actions and BrowserStack for the generous free hosting of this open source project!
+
+## License
+
+Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   https://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
diff --git a/node_modules/mathjs/bin/cli.js b/node_modules/mathjs/bin/cli.js
new file mode 100755
index 0000000..618006d
--- /dev/null
+++ b/node_modules/mathjs/bin/cli.js
@@ -0,0 +1,432 @@
+#!/usr/bin/env node
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * Usage:
+ *
+ *     mathjs [scriptfile(s)] {OPTIONS}
+ *
+ * Options:
+ *
+ *     --version, -v       Show application version
+ *     --help,    -h       Show this message
+ *     --tex               Generate LaTeX instead of evaluating
+ *     --string            Generate string instead of evaluating
+ *     --parenthesis=      Set the parenthesis option to
+ *                         either of "keep", "auto" and "all"
+ *
+ * Example usage:
+ *     mathjs                                 Open a command prompt
+ *     mathjs 1+2                             Evaluate expression
+ *     mathjs script.txt                      Run a script file
+ *     mathjs script1.txt script2.txt         Run two script files
+ *     mathjs script.txt > results.txt        Run a script file, output to file
+ *     cat script.txt | mathjs                Run input stream
+ *     cat script.txt | mathjs > results.txt  Run input stream, output to file
+ *
+ * @license
+ * Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License"); you may not
+ * use this file except in compliance with the License. You may obtain a copy
+ * of the License at
+ *
+ * https://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
+ * License for the specific language governing permissions and limitations under
+ * the License.
+ */
+
+const fs = require('fs')
+const path = require('path')
+const { createEmptyMap } = require('../lib/cjs/utils/map.js')
+let scope = createEmptyMap()
+
+const PRECISION = 14 // decimals
+
+/**
+ * "Lazy" load math.js: only require when we actually start using it.
+ * This ensures the cli application looks like it loads instantly.
+ * When requesting help or version number, math.js isn't even loaded.
+ * @return {*}
+ */
+function getMath () {
+  return require('../lib/cjs/defaultInstance.js').default
+}
+
+/**
+ * Helper function to format a value. Regular numbers will be rounded
+ * to 14 digits to prevent round-off errors from showing up.
+ * @param {*} value
+ */
+function format (value) {
+  const math = getMath()
+
+  return math.format(value, {
+    fn: function (value) {
+      if (typeof value === 'number') {
+        // round numbers
+        return math.format(value, PRECISION)
+      } else {
+        return math.format(value)
+      }
+    }
+  })
+}
+
+/**
+ * auto complete a text
+ * @param {String} text
+ * @return {[Array, String]} completions
+ */
+function completer (text) {
+  const math = getMath()
+  let matches = []
+  let keyword
+  const m = /[a-zA-Z_0-9]+$/.exec(text)
+  if (m) {
+    keyword = m[0]
+
+    // scope variables
+    for (const def in scope.keys()) {
+      if (def.indexOf(keyword) === 0) {
+        matches.push(def)
+      }
+    }
+
+    // commandline keywords
+    ['exit', 'quit', 'clear'].forEach(function (cmd) {
+      if (cmd.indexOf(keyword) === 0) {
+        matches.push(cmd)
+      }
+    })
+
+    // math functions and constants
+    const ignore = ['expr', 'type']
+    for (const func in math.expression.mathWithTransform) {
+      if (hasOwnProperty(math.expression.mathWithTransform, func)) {
+        if (func.indexOf(keyword) === 0 && ignore.indexOf(func) === -1) {
+          matches.push(func)
+        }
+      }
+    }
+
+    // units
+    const Unit = math.Unit
+    for (const name in Unit.UNITS) {
+      if (hasOwnProperty(Unit.UNITS, name)) {
+        if (name.indexOf(keyword) === 0) {
+          matches.push(name)
+        }
+      }
+    }
+    for (const name in Unit.PREFIXES) {
+      if (hasOwnProperty(Unit.PREFIXES, name)) {
+        const prefixes = Unit.PREFIXES[name]
+        for (const prefix in prefixes) {
+          if (hasOwnProperty(prefixes, prefix)) {
+            if (prefix.indexOf(keyword) === 0) {
+              matches.push(prefix)
+            } else if (keyword.indexOf(prefix) === 0) {
+              const unitKeyword = keyword.substring(prefix.length)
+              for (const n in Unit.UNITS) {
+                if (hasOwnProperty(Unit.UNITS, n)) {
+                  if (n.indexOf(unitKeyword) === 0 &&
+                      Unit.isValuelessUnit(prefix + n)) {
+                    matches.push(prefix + n)
+                  }
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+
+    // remove duplicates
+    matches = matches.filter(function (elem, pos, arr) {
+      return arr.indexOf(elem) === pos
+    })
+  }
+
+  return [matches, keyword]
+}
+
+/**
+ * Run stream, read and evaluate input and stream that to output.
+ * Text lines read from the input are evaluated, and the results are send to
+ * the output.
+ * @param input   Input stream
+ * @param output  Output stream
+ * @param mode    Output mode
+ * @param parenthesis Parenthesis option
+ */
+function runStream (input, output, mode, parenthesis) {
+  const readline = require('readline')
+  const rl = readline.createInterface({
+    input: input || process.stdin,
+    output: output || process.stdout,
+    completer: completer
+  })
+
+  if (rl.output.isTTY) {
+    rl.setPrompt('> ')
+    rl.prompt()
+  }
+
+  // load math.js now, right *after* loading the prompt.
+  const math = getMath()
+
+  // TODO: automatic insertion of 'ans' before operators like +, -, *, /
+
+  rl.on('line', function (line) {
+    const expr = line.trim()
+
+    switch (expr.toLowerCase()) {
+      case 'quit':
+      case 'exit':
+        // exit application
+        rl.close()
+        break
+      case 'clear':
+        // clear memory
+        scope = createEmptyMap()
+        console.log('memory cleared')
+
+        // get next input
+        if (rl.output.isTTY) {
+          rl.prompt()
+        }
+        break
+      default:
+        if (!expr) {
+          break
+        }
+        switch (mode) {
+          case 'evaluate':
+            // evaluate expression
+            try {
+              let node = math.parse(expr)
+              let res = node.evaluate(scope)
+
+              if (math.isResultSet(res)) {
+                // we can have 0 or 1 results in the ResultSet, as the CLI
+                // does not allow multiple expressions separated by a return
+                res = res.entries[0]
+                node = node.blocks
+                  .filter(function (entry) { return entry.visible })
+                  .map(function (entry) { return entry.node })[0]
+              }
+
+              if (node) {
+                if (math.isAssignmentNode(node)) {
+                  const name = findSymbolName(node)
+                  if (name !== null) {
+                    const value = scope.get(name)
+                    scope.set('ans', value)
+                    console.log(name + ' = ' + format(value))
+                  } else {
+                    scope.set('ans', res)
+                    console.log(format(res))
+                  }
+                } else if (math.isHelp(res)) {
+                  console.log(res.toString())
+                } else {
+                  scope.set('ans', res)
+                  console.log(format(res))
+                }
+              }
+            } catch (err) {
+              console.log(err.toString())
+            }
+            break
+
+          case 'string':
+            try {
+              const string = math.parse(expr).toString({ parenthesis: parenthesis })
+              console.log(string)
+            } catch (err) {
+              console.log(err.toString())
+            }
+            break
+
+          case 'tex':
+            try {
+              const tex = math.parse(expr).toTex({ parenthesis: parenthesis })
+              console.log(tex)
+            } catch (err) {
+              console.log(err.toString())
+            }
+            break
+        }
+    }
+
+    // get next input
+    if (rl.output.isTTY) {
+      rl.prompt()
+    }
+  })
+
+  rl.on('close', function () {
+    console.log()
+    process.exit(0)
+  })
+}
+
+/**
+ * Find the symbol name of an AssignmentNode. Recurses into the chain of
+ * objects to the root object.
+ * @param {AssignmentNode} node
+ * @return {string | null} Returns the name when found, else returns null.
+ */
+function findSymbolName (node) {
+  const math = getMath()
+  let n = node
+
+  while (n) {
+    if (math.isSymbolNode(n)) {
+      return n.name
+    }
+    n = n.object
+  }
+
+  return null
+}
+
+/**
+ * Output application version number.
+ * Version number is read version from package.json.
+ */
+function outputVersion () {
+  fs.readFile(path.join(__dirname, '/../package.json'), function (err, data) {
+    if (err) {
+      console.log(err.toString())
+    } else {
+      const pkg = JSON.parse(data)
+      const version = pkg && pkg.version ? pkg.version : 'unknown'
+      console.log(version)
+    }
+    process.exit(0)
+  })
+}
+
+/**
+ * Output a help message
+ */
+function outputHelp () {
+  console.log('math.js')
+  console.log('https://mathjs.org')
+  console.log()
+  console.log('Math.js is an extensive math library for JavaScript and Node.js. It features ')
+  console.log('real and complex numbers, units, matrices, a large set of mathematical')
+  console.log('functions, and a flexible expression parser.')
+  console.log()
+  console.log('Usage:')
+  console.log('    mathjs [scriptfile(s)|expression] {OPTIONS}')
+  console.log()
+  console.log('Options:')
+  console.log('    --version, -v       Show application version')
+  console.log('    --help,    -h       Show this message')
+  console.log('    --tex               Generate LaTeX instead of evaluating')
+  console.log('    --string            Generate string instead of evaluating')
+  console.log('    --parenthesis=      Set the parenthesis option to')
+  console.log('                        either of "keep", "auto" and "all"')
+  console.log()
+  console.log('Example usage:')
+  console.log('    mathjs                                Open a command prompt')
+  console.log('    mathjs 1+2                            Evaluate expression')
+  console.log('    mathjs script.txt                     Run a script file')
+  console.log('    mathjs script.txt script2.txt         Run two script files')
+  console.log('    mathjs script.txt > results.txt       Run a script file, output to file')
+  console.log('    cat script.txt | mathjs               Run input stream')
+  console.log('    cat script.txt | mathjs > results.txt Run input stream, output to file')
+  console.log()
+  process.exit(0)
+}
+
+/**
+ * Process input and output, based on the command line arguments
+ */
+const scripts = [] // queue of scripts that need to be processed
+let mode = 'evaluate' // one of 'evaluate', 'tex' or 'string'
+let parenthesis = 'keep'
+let version = false
+let help = false
+
+process.argv.forEach(function (arg, index) {
+  if (index < 2) {
+    return
+  }
+
+  switch (arg) {
+    case '-v':
+    case '--version':
+      version = true
+      break
+
+    case '-h':
+    case '--help':
+      help = true
+      break
+
+    case '--tex':
+      mode = 'tex'
+      break
+
+    case '--string':
+      mode = 'string'
+      break
+
+    case '--parenthesis=keep':
+      parenthesis = 'keep'
+      break
+
+    case '--parenthesis=auto':
+      parenthesis = 'auto'
+      break
+
+    case '--parenthesis=all':
+      parenthesis = 'all'
+      break
+
+      // TODO: implement configuration via command line arguments
+
+    default:
+      scripts.push(arg)
+  }
+})
+
+if (version) {
+  outputVersion()
+} else if (help) {
+  outputHelp()
+} else if (scripts.length === 0) {
+  // run a stream, can be user input or pipe input
+  runStream(process.stdin, process.stdout, mode, parenthesis)
+} else {
+  fs.stat(scripts[0], function (e, f) {
+    if (e) {
+      console.log(getMath().evaluate(scripts.join(' ')).toString())
+    } else {
+    // work through the queue of scripts
+      scripts.forEach(function (arg) {
+        // run a script file
+        runStream(fs.createReadStream(arg), process.stdout, mode, parenthesis)
+      })
+    }
+  })
+}
+
+// helper function to safely check whether an object as a property
+// copy from the function in object.js which is ES6
+function hasOwnProperty (object, property) {
+  return object && Object.hasOwnProperty.call(object, property)
+}
diff --git a/node_modules/mathjs/bin/package.json b/node_modules/mathjs/bin/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/bin/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/bin/repl.js b/node_modules/mathjs/bin/repl.js
new file mode 100644
index 0000000..21c9b11
--- /dev/null
+++ b/node_modules/mathjs/bin/repl.js
@@ -0,0 +1,10 @@
+#!/usr/bin/env node
+
+/*
+ * This simply preloads mathjs and drops you into a REPL to
+ * help interactive debugging.
+ **/
+global.math = require('../lib/cjs/defaultInstance.js').default
+const repl = require('repl')
+
+repl.start({ useGlobal: true })
diff --git a/node_modules/mathjs/dist/math.js b/node_modules/mathjs/dist/math.js
new file mode 100644
index 0000000..b01e410
--- /dev/null
+++ b/node_modules/mathjs/dist/math.js
@@ -0,0 +1,3 @@
+// TODO: deprecated since v8, remove this deprecation warning in v9
+throw new Error('The non-minified file "mathjs/dist/math.js" has removed since mathjs@8.0.0. ' +
+  'Please use the minified bundle "mathjs/lib/browser/math.js" instead.')
diff --git a/node_modules/mathjs/dist/math.min.js b/node_modules/mathjs/dist/math.min.js
new file mode 100644
index 0000000..2a2391f
--- /dev/null
+++ b/node_modules/mathjs/dist/math.min.js
@@ -0,0 +1,3 @@
+// TODO: deprecated since v8, remove this deprecation warning in v9
+throw new Error('The file "mathjs/dist/math.min.js" has been moved to "mathjs/lib/browser/math.js" since mathjs@8.0.0. ' +
+  'Please load the bundle via the new path.')
diff --git a/node_modules/mathjs/dist/package.json b/node_modules/mathjs/dist/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/dist/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/docs/command_line_interface.md b/node_modules/mathjs/docs/command_line_interface.md
new file mode 100644
index 0000000..1287e7b
--- /dev/null
+++ b/node_modules/mathjs/docs/command_line_interface.md
@@ -0,0 +1,87 @@
+# Command Line Interface (CLI)
+
+When math.js is installed globally using npm, its expression parser can be used
+from the command line. To install math.js globally:
+
+```bash
+$ npm install -g mathjs
+```
+
+Normally, a global installation must be run with admin rights (precede the
+command with `sudo`). After installation, the application `mathjs` is available
+via the command line:
+
+```bash
+$ mathjs
+> 12 / (2.3 + 0.7)
+4
+> 12.7 cm to inch
+5 inch
+> sin(45 deg) ^ 2
+0.5
+> 9 / 3 + 2i
+3 + 2i
+> det([-1, 2; 3, 1])
+-7
+```
+
+The command line interface can be used to open a prompt, to execute a script,
+or to pipe input and output streams:
+
+```bash
+$ mathjs                                 # Open a command prompt
+$ mathjs script.txt                      # Run a script file, output to console
+$ mathjs script1.txt script2.txt         # Run two script files
+$ mathjs script.txt > results.txt        # Run a script file, output to file
+$ cat script.txt | mathjs                # Run input stream, output to console
+$ cat script.txt | mathjs > results.txt  # Run input stream, output to file
+```
+
+You can also use it to create LaTeX from or sanitize your expressions using the
+`--tex` and `--string` options:
+
+```bash
+$ mathjs --tex
+> 1/2
+\frac{1}{2}
+```
+
+```bash
+$ mathjs --string
+> (1+1+1)
+(1 + 1 + 1)
+```
+
+To change the parenthesis option use the `--parenthesis=` flag:
+
+```bash
+$ mathjs --string --parenthesis=auto
+> (1+1+1)
+1 + 1 + 1
+```
+
+```bash
+$ mathjs --string --parenthesis=all
+> (1+1+1)
+(1 + 1) + 1
+```
+
+# Command line debugging (REPL)
+
+For debugging purposes, `bin/repl.js` provides a REPL (Read Evaluate Print Loop)
+for interactive testing of mathjs without having to build new build files after every
+little change to the source files. You can either start it directly (`./bin/repl.js`) or
+via node (`node bin/repl.js`).
+
+You can exit using either [ctrl]-[C] or [ctrl]-[D].
+
+```bash
+$ ./bin/repl.js 
+> math.parse('1+1')
+{ op: '+',
+  fn: 'add',
+  args: 
+   [ { value: '1', valueType: 'number' },
+     { value: '1', valueType: 'number' } ] }
+> 
+```
diff --git a/node_modules/mathjs/docs/core/chaining.md b/node_modules/mathjs/docs/core/chaining.md
new file mode 100644
index 0000000..c97bcc5
--- /dev/null
+++ b/node_modules/mathjs/docs/core/chaining.md
@@ -0,0 +1,41 @@
+# Chaining
+
+Math.js supports chaining operations by wrapping a value into a `Chain`.
+A chain can be created with the function `math.chain(value)`
+(formerly `math.select(value)`).
+All functions available in the math namespace can be executed via the chain.
+The functions will be executed with the chain's value as the first argument,
+followed by extra arguments provided by the function call itself.
+
+```js
+math.chain(3)
+    .add(4)
+    .subtract(2)
+    .done() // 5
+
+math.chain( [[1, 2], [3, 4]] )
+    .subset(math.index(0, 0), 8)
+    .multiply(3)
+    .done() // [[24, 6], [9, 12]]
+```
+
+### API
+
+A `Chain` is constructed as:
+
+```js
+math.chain()
+math.chain(value)
+```
+
+The `Chain` has all functions available in the `math` namespace, and has
+a number of special functions:
+
+ - `done()`
+   Finalize the chain and return the chain's value.
+ - `valueOf()`
+   The same as `done()`, returns the chain's value.
+ - `toString()`
+   Executes `math.format(value)` onto the chain's value, returning
+   a string representation of the value.
+
diff --git a/node_modules/mathjs/docs/core/configuration.md b/node_modules/mathjs/docs/core/configuration.md
new file mode 100644
index 0000000..3365794
--- /dev/null
+++ b/node_modules/mathjs/docs/core/configuration.md
@@ -0,0 +1,144 @@
+# Configuration
+
+Math.js contains a number of configuration options.
+These options can be applied on a created mathjs instance and changed afterwards.
+
+```js
+import { create, all } from 'mathjs'
+
+// create a mathjs instance with configuration
+const config = {
+  epsilon: 1e-12,
+  matrix: 'Matrix',
+  number: 'number',
+  precision: 64,
+  predictable: false,
+  randomSeed: null
+}
+const math = create(all, config)
+
+// read the applied configuration
+console.log(math.config())
+
+// change the configuration
+math.config({
+  number: 'BigNumber'
+})
+```
+
+The following configuration options are available:
+
+- `epsilon`. The minimum relative difference used to test equality between two
+  compared values. This value is used by all relational functions.
+  Default value is `1e-12`.
+
+- `matrix`. The default type of matrix output for functions.
+  Available values are: `'Matrix'` (default) or `'Array'`.
+  Where possible, the type of matrix output from functions is determined from
+  the function input: An array as input will return an Array, a Matrix as input
+  will return a Matrix. In case of no matrix as input, the type of output is
+  determined by the option `matrix`. In case of mixed matrix
+  inputs, a matrix will be returned always.
+
+- `number`. The type of numeric output for functions which cannot
+  determine the numeric type from the inputs. For most functions though,
+  the type of output is determined from the the input:
+  a number as input will return a number as output,
+  a BigNumber as input returns a BigNumber as output.
+
+  For example the functions `math.evaluate('2+3')`, `math.parse('2+3')`,
+  `math.range('1:10')`, and `math.unit('5cm')` use the `number` configuration
+  setting. But `math.sqrt(4)` will always return the number `2`
+  regardless of the `number` configuration, because the input is a number.
+
+  Available values are: `'number'` (default), `'BigNumber'`, or `'Fraction'`.
+  [BigNumbers](../datatypes/bignumbers.js) have higher precision than the default
+  numbers of JavaScript, and [`Fractions`](../datatypes/fractions.js) store
+  values in terms of a numerator and denominator.
+
+- `precision`. The maximum number of significant digits for BigNumbers.
+  This setting only applies to BigNumbers, not to numbers.
+  Default value is `64`.
+
+- `predictable`. Predictable output type of functions. When true, output type
+  depends only on the input types. When false (default), output type can vary
+  depending on input values. For example `math.sqrt(-4)` returns `complex('2i')` when
+  predictable is false, and returns `NaN` when true.
+  Predictable output can be needed when programmatically handling the result of
+  a calculation, but can be inconvenient for users when evaluating dynamic
+  equations.
+
+- `randomSeed`. Set this option to seed pseudo random number generation, making it deterministic. The pseudo random number generator is reset with the seed provided each time this option is set. For example, setting it to `'a'` will cause `math.random()` to return `0.43449421599986604` upon the first call after setting the option every time. Set to `null` to seed the pseudo random number generator with a random seed. Default value is `null`.
+
+
+## Examples
+
+This section shows a number of configuration examples.
+
+### node.js
+
+```js
+import { create, all } from 'mathjs'
+
+const config = {
+  matrix: 'Array' // Choose 'Matrix' (default) or 'Array'
+}
+const math = create(all, config)
+
+// range will output an Array
+math.range(0, 4) // Array [0, 1, 2, 3]
+
+// change the configuration from Arrays to Matrices
+math.config({
+  matrix: 'Matrix' // Choose 'Matrix' (default) or 'Array'
+})
+
+// range will output a Matrix
+math.range(0, 4) // Matrix [0, 1, 2, 3]
+
+// create an instance of math.js with BigNumber configuration
+const bigmath = create(all, {
+  number: 'BigNumber', // Choose 'number' (default), 'BigNumber', or 'Fraction'
+  precision: 32        // 64 by default, only applicable for BigNumbers
+})
+
+// parser will parse numbers as BigNumber now:
+bigmath.evaluate('1 / 3') // BigNumber, 0.33333333333333333333333333333333
+```
+
+### browser
+
+
+```html
+<!DOCTYPE HTML>
+<html>
+<head>
+  <script src="math.js" type="text/javascript"></script>
+</head>
+<body>
+  <script type="text/javascript">
+    // the default instance of math.js is available as 'math'
+
+    // range will output a Matrix
+    math.range(0, 4)          // Matrix [0, 1, 2, 3]
+
+    // change the configuration of math from Matrices to Arrays
+    math.config({
+      matrix: 'Array'         // Choose 'Matrix' (default) or 'Array'
+    })
+
+    // range will output an Array
+    math.range(0, 4)          // Array [0, 1, 2, 3]
+
+    // create a new instance of math.js with bignumber configuration
+    const bigmath = math.create({
+      number: 'BigNumber',    // Choose 'number' (default), 'BigNumber', or 'Fraction'
+      precision: 32           // 64 by default, only applicable for BigNumbers
+    })
+
+    // parser will parse numbers as BigNumber now:
+    bigmath.evaluate('1 / 3') // BigNumber, 0.33333333333333333333333333333333
+  </script>
+</body>
+</html>
+```
diff --git a/node_modules/mathjs/docs/core/extension.md b/node_modules/mathjs/docs/core/extension.md
new file mode 100644
index 0000000..5a2fff3
--- /dev/null
+++ b/node_modules/mathjs/docs/core/extension.md
@@ -0,0 +1,263 @@
+# Extension
+
+The library can easily be extended with functions and variables using the
+[`import`](../reference/functions/import.md) function. The `import` function is available on a mathjs instance, which can be created using the `create` function.
+
+```js
+import { create, all } from 'mathjs'
+
+const math = create(all)
+
+math.import(/* ... */)
+```
+
+The function `import` accepts an object with functions and variables, or an array with factory functions. It has the following syntax:
+
+```js
+math.import(functions: Object [, options: Object])
+```
+
+Where:
+
+- `functions` is an object or array containing the functions and/or values to be
+  imported. `import` support regular values and functions, typed functions
+  (see section [Typed functions](#typed-functions)), and factory functions
+  (see section [Factory functions](#factory-functions)).
+  An array is only applicable when it contains factory functions.
+
+- `options` is an optional second argument with options.
+  The following options are available:
+
+    - `{boolean} override`
+      If `true`, existing functions will be overwritten. The default value is `false`.
+    - `{boolean} silent`
+      If `true`, the function will not throw errors on duplicates or invalid
+      types. Default value is `false`.
+    - `{boolean} wrap`
+      If `true`, the functions will be wrapped in a wrapper function which
+      converts data types like Matrix to primitive data types like Array.
+      The wrapper is needed when extending math.js with libraries which do not
+      support the math.js data types. The default value is `false`.
+
+The following code example shows how to import a function and a value into math.js:
+
+```js
+// define new functions and variables
+math.import({
+  myvalue: 42,
+  hello: function (name) {
+    return 'hello, ' + name + '!'
+  }
+})
+
+// defined functions can be used in both JavaScript as well as the parser
+math.myvalue * 2                 // 84
+math.hello('user')               // 'hello, user!'
+
+const parser = math.parser()
+parser.evaluate('myvalue + 10')  // 52
+parser.evaluate('hello("user")') // 'hello, user!'
+```
+
+## Import external libraries
+
+External libraries like
+[numbers.js](https://github.com/sjkaliski/numbers.js) and
+[numeric.js](https://github.com/sloisel/numeric) can be imported as follows.
+The libraries must be installed using npm:
+
+    $ npm install numbers
+    $ npm install numeric
+
+The libraries can be easily imported into math.js using `import`.
+In order to convert math.js specific data types like `Matrix` to primitive types
+like `Array`, the imported functions can be wrapped by enabling `{wrap: true}`.
+
+```js
+import { create, all } from 'mathjs'
+import * as numbers from 'numbers'
+import * as numeric from 'numeric'
+
+// create a mathjs instance and import the numbers.js and numeric.js libraries
+const math = create(all)
+math.import(numbers, {wrap: true, silent: true})
+math.import(numeric, {wrap: true, silent: true})
+
+// use functions from numbers.js
+math.fibonacci(7)                           // 13
+math.evaluate('fibonacci(7)')               // 13
+
+// use functions from numeric.js
+math.evaluate('eig([1, 2; 4, 3])').lambda.x // [5, -1]
+```
+
+
+## Typed functions
+
+Typed functions can be created using `math.typed`. A typed function is a function
+which does type checking on the input arguments. It can have multiple signatures.
+And can automatically convert input types where needed.
+
+A typed function can be created like:
+
+```js
+const max = typed('max', {
+  'number, number': function (a, b) {
+    return Math.max(a, b)
+  },
+
+  'BigNumber, BigNumber': function (a, b) {
+    return a.greaterThan(b) ? a : b
+  }
+})
+```
+
+Typed functions can be merged as long as there are no conflicts in the signatures.
+This allows for extending existing functions in math.js with support for new
+data types.
+
+```js
+// create a new data type
+function MyType (value) {
+  this.value = value
+}
+MyType.prototype.isMyType = true
+MyType.prototype.toString = function () {
+  return 'MyType:' + this.value
+}
+
+// define a new datatype
+math.typed.addType({
+  name: 'MyType',
+  test: function (x) {
+    // test whether x is of type MyType
+    return x && x.isMyType
+  }
+})
+
+// use the type in a new typed function
+const add = typed('add', {
+  'MyType, MyType': function (a, b) {
+    return new MyType(a.value + b.value)
+  }
+})
+
+// import in math.js, extend the existing function `add` with support for MyType
+math.import({add: add})
+
+// use the new type
+const ans = math.add(new MyType(2), new MyType(3)) // returns MyType(5)
+console.log(ans)                                 // outputs 'MyType:5'
+```
+
+Detailed information on typed functions is available here:
+[https://github.com/josdejong/typed-function](https://github.com/josdejong/typed-function)
+
+
+
+
+## Factory functions
+
+Regular JavaScript functions can be imported in math.js using `math.import`:
+
+```js
+math.import({
+  myFunction: function (a, b) {
+     // ...
+  }
+})
+```
+
+The function can be stored in a separate file:
+
+```js
+export function myFunction (a, b) {
+  // ...
+}
+```
+
+Which can be imported like:
+
+```js
+import { myFunction } from './myFunction.js'
+
+math.import({
+  myFunction
+})
+```
+
+An issue arises when `myFunction` needs functionality from math.js:
+it doesn't have access to the current instance of math.js when in a separate file.
+Factory functions can be used to solve this issue. A factory function allows to inject dependencies into a function when creating it.
+
+A syntax of factory function is:
+
+```js
+factory(name: string, dependencies: string[], create: function, meta?: Object): function
+```
+
+where:
+
+-   `name` is the name of the created function.
+-   `dependencies` is an array with names of the dependent functions.
+-   `create` is a function which creates the function.
+    An object with the dependencies is passed as first argument.
+-   `meta` An optional object which can contain any meta data you want.
+    This will be attached as a property `meta` on the created function.
+    Known meta data properties used by the mathjs instance are:
+    -   `isClass: boolean`  If true, the created function is supposed to be a
+        class, and for example will not be exposed in the expression parser
+        for security reasons.
+    -   `lazy: boolean`.  By default, everything is imported lazily by `import`.
+        only as soon as the imported function or constant is actually used, it
+        will be constructed. A function can be forced to be created immediately
+        by setting `lazy: false` in the meta data.
+    -   `isTransformFunction: boolean`. If true, the created function is imported
+        as a transform function. It will not be imported in `math` itself, only
+        in the internal `mathWithTransform` namespace that is used by the
+        expression parser.
+    -   `recreateOnConfigChange: boolean`. If true, the imported factory will be
+        created again when there is a change in the configuration. This is for
+        example used for the constants like `pi`, which is different depending
+        on the configsetting `number` which can be numbers or BigNumbers.
+
+Here an example of a factory function which depends on `multiply`:
+
+```js
+import { factory, create, all } from 'mathjs'
+
+// create a factory function
+const name = 'negativeSquare'
+const dependencies = ['multiply', 'unaryMinus']
+const createNegativeSquare = factory(name, dependencies, function ({ multiply, unaryMinus }) {
+    return function negativeSquare (x) {
+      return unaryMinus(multiply(x, x))
+    }
+  })
+
+// create an instance of the function yourself:
+const multiply = (a, b) => a * b
+const unaryMinus = (a) => -a
+const negativeSquare = createNegativeSquare({ multiply, unaryMinus })
+console.log(negativeSquare(3)) // -9
+
+// or import the factory in a mathjs instance and use it there
+const math = create(all)
+math.import(createNegativeSquare)
+console.log(math.negativeSquare(4)) // -16
+console.log(math.evaluate('negativeSquare(5)')) // -25
+```
+
+You may wonder why you would inject functions `multiply` and `unaryMinus`
+instead of just doing these calculations inside the function itself. The
+reason is that this makes the factory function `negativeSquare` work for
+different implementations: numbers, BigNumbers, units, etc.
+
+```js
+import { Decimal } from 'decimal.js'
+
+// create an instance of our negativeSquare supporting BigNumbers instead of numbers
+const multiply = (a, b) => a.mul(b)
+const unaryMinus = (a) => new Decimal(0).minus(a)
+const negativeSquare = createNegativeSquare({ multiply, unaryMinus })
+```
\ No newline at end of file
diff --git a/node_modules/mathjs/docs/core/index.md b/node_modules/mathjs/docs/core/index.md
new file mode 100644
index 0000000..3e2b089
--- /dev/null
+++ b/node_modules/mathjs/docs/core/index.md
@@ -0,0 +1,21 @@
+# Core
+
+## Usage
+
+The core of math.js is the `math` namespace containing all functions and constants. There are three ways to do calculations in math.js:
+
+- Doing regular function calls like `math.add(math.sqrt(4), 2)`.
+- Evaluating expressions like `math.evaluate('sqrt(4) + 2')`
+- Chaining operations like `math.chain(4).sqrt().add(2)`.
+
+## Configuration
+
+math.js can be configured using the `math.config()`, see page [Configuration](configuration.md).
+
+## Extension
+
+math.js can be extended with new functions and constants using the function `math.import()`, see page [Extension](extension.md).
+
+## Serialization
+
+To persist or exchange data structures like matrices and units, the data types of math.js can be stringified as JSON. This is explained on the page [Serialization](serialization.md).
diff --git a/node_modules/mathjs/docs/core/serialization.md b/node_modules/mathjs/docs/core/serialization.md
new file mode 100644
index 0000000..afab6a7
--- /dev/null
+++ b/node_modules/mathjs/docs/core/serialization.md
@@ -0,0 +1,50 @@
+# Serialization
+
+Math.js has a number of data types like `Matrix`, `Complex`, and `Unit`. These
+types are instantiated JavaScript objects. To be able to store these data types
+or send them between processes, they must be serialized. The data types of
+math.js can be serialized to JSON. Use cases:
+
+- Store data in a database or on disk.
+- Interchange of data between a server and a client.
+- Interchange of data between a web worker and the browser.
+
+Math.js types can be serialized using JavaScript's built-in `JSON.stringify`
+function:
+
+```js
+const x = math.complex('2 + 3i')
+const str = JSON.stringify(x, math.replacer)
+console.log(str)
+// outputs a string '{"mathjs":"Complex","re":2,"im":3}'
+```
+
+> IMPORTANT: in most cases works, serialization correctly without
+> passing the `math.replacer` function as second argument. This is because
+> in most cases we can rely on the default behavior of JSON.stringify, which 
+> uses the `.toJSON` method on classes like `Unit` and `Complex` to correctly 
+> serialize them. However, there are a few special cases like the 
+> number `Infinity` which does require the replacer function in order to be 
+> serialized without losing information: without it, `Infinity` will be 
+> serialized as `"null"` and cannot be deserialized correctly.
+>
+> So, it's best to always pass the `math.replacer` function to prevent 
+> weird edge cases.
+
+In order to deserialize a string, containing math.js data types, `JSON.parse`
+can be used. In order to recognize the data types of math.js, `JSON.parse` must
+be called with the reviver function of math.js:
+
+```js
+const json = '{"mathjs":"Unit","value":5,"unit":"cm","fixPrefix":false}'
+const x = JSON.parse(json, math.reviver)   // Unit 5 cm
+```
+
+Note that if math.js is used in conjunction with other data types, it is
+possible to use multiple reviver functions at the same time by cascading them:
+
+```js
+const reviver = function (key, value) {
+  return reviver1(key, reviver2(key, value))
+}
+```
diff --git a/node_modules/mathjs/docs/custom_bundling.md b/node_modules/mathjs/docs/custom_bundling.md
new file mode 100644
index 0000000..55b1d54
--- /dev/null
+++ b/node_modules/mathjs/docs/custom_bundling.md
@@ -0,0 +1,116 @@
+# Custom bundling
+
+Math.js is a large library containing many data types and functions.
+It is well possible that you only need a small portion of the library.
+Math.js allows for picking just the functions and data types you need.
+This gives faster load times and smaller browser bundles. Math.js uses
+ES modules, and creating small bundles using tree-shaking works out of
+the box when using Webpack for example.
+
+This page describes:
+
+- How to use just a few functions for faster load times and smaller bundles.
+- How to use light-weight, number only implementations of functions.
+- What to expect from bundle sizes when using tree-shaking.
+
+## Using just a few functions
+
+Using the function `create`, a mathjs instance can be created.
+The `all` object contains all functionality available in mathjs,
+and a mathjs instance containing everything can be created like:
+
+```js
+import { create, all } from 'mathjs'
+
+const math = create(all)
+```
+
+To create an instance with just a few functions, you have to pass the
+factory functions of the functions you need, and all their dependencies.
+For example the function `add` depends on the functions `addScalar`,
+`equalScalar`, classes `DenseMatrix` and `SparseMatrix`, and more.
+Because it is hard to figure out what the dependencies of a function are,
+and the dependencies of the dependencies, mathjs provides ready made
+collections of all dependencies for every function. For example all
+factory functions of function `add` and its dependencies are available
+as `addDependencies`.
+
+Here is a full example of loading just a few functions in a mathjs instance:
+
+```js
+// file: custom_loading.js
+
+import {
+  create,
+  fractionDependencies,
+  addDependencies,
+  divideDependencies,
+  formatDependencies
+} from 'mathjs'
+
+const config = {
+  // optionally, you can specify configuration
+}
+
+// Create just the functions we need
+const { fraction, add, divide, format } = create({
+  fractionDependencies,
+  addDependencies,
+  divideDependencies,
+  formatDependencies
+}, config)
+
+// Use the created functions
+const a = fraction(1, 3)
+const b = fraction(3, 7)
+const c = add(a, b)
+const d = divide(a, b)
+console.log('c =', format(c)) // outputs "c = 16/21"
+console.log('d =', format(d)) // outputs "d = 7/9"
+```
+
+This example can be bundled using for example Webpack:
+
+```
+npx webpack custom_loading.js -o custom_loading.bundle.js --mode=production
+```
+
+Only the used parts of mathjs will be bundled thanks to tree-shaking.
+
+
+## Numbers only
+
+The functions of mathjs support multiple data types out of the box, like
+numbers, bignumbers, complex numbers, units, and matrices. Quite commonly however,
+only support for numbers is needed and the other data-types are overkill.
+
+To accomodate for this use case of only numbers only, mathjs offers light-weight,
+number only implementations of all relevant functions. These are available by
+importing from `'mathjs/number'` instead of `'mathjs'`:
+
+```js
+// use light-weight, numbers only implementations of functions
+import { create, all } from 'mathjs/number'
+
+const math = create(all)
+console.log(add(2, 3)) // 5
+```
+
+## Bundle size
+
+When using just a few functions of mathjs instead of the whole library,
+you may expect the size of the bundle to be just a small fraction of the
+complete library. However, to create the function `add` supporting all data
+types, all these data types must be included: Unit, BigNumber, Complex,
+DenseMatrix, SparseMatrix, etc. A rough idea of the size of different parts of
+mathjs:
+
+- About 5% is coming from core functionality like `create`, `import`, `factory`,
+  `typed-function`, etc.
+- About 30% of the bundle size comes from the data classes `Complex`, `BigNumber`, `Fraction`, `Unit`, `SparseMatrix`, `DenseMatrix`.
+- About 25%  of the bundle size comes from the expression parser.
+  Half of this comes from the embedded docs.
+- About 40% comes from the about 200 built-in functions and some constants.
+
+To get a better insight in what is in your JavaScript bundle, you can use
+a tool like [source-map-explorer](https://github.com/danvk/source-map-explorer).
diff --git a/node_modules/mathjs/docs/datatypes/bignumbers.md b/node_modules/mathjs/docs/datatypes/bignumbers.md
new file mode 100644
index 0000000..e2874a7
--- /dev/null
+++ b/node_modules/mathjs/docs/datatypes/bignumbers.md
@@ -0,0 +1,102 @@
+# BigNumbers
+
+For calculations with an arbitrary precision, math.js supports a `BigNumber`
+datatype. BigNumber support is powered by
+[decimal.js](https://github.com/MikeMcl/decimal.js/).
+
+## Usage
+
+A BigNumber can be created using the function `bignumber`:
+
+```js
+math.bignumber('2.3e+500') // BigNumber, 2.3e+500
+```
+
+Most functions can determine the type of output from the type of input:
+a number as input will return a number as output, a BigNumber as input returns
+a BigNumber as output. Functions which cannot determine the type of output
+from the input (for example `math.evaluate`) use the default number type `number`,
+which can be configured when instantiating math.js. To configure the use of
+BigNumbers instead of [numbers](numbers.md) by default, configure math.js like:
+
+```js
+math.config({
+  number: 'BigNumber',      // Default type of number:
+                            // 'number' (default), 'BigNumber', or 'Fraction'
+  precision: 64             // Number of significant digits for BigNumbers
+})
+
+// use math
+math.evaluate('0.1 + 0.2')  // BigNumber, 0.3
+```
+
+The default precision for BigNumber is 64 digits, and can be configured with
+the option `precision`.
+
+
+## Support
+
+Most functions in math.js support BigNumbers, but not all of them.
+For example the function `random` doesn't support BigNumbers.
+
+
+## Round-off errors
+
+Calculations with BigNumber are much slower than calculations with Number,
+but they can be executed with an arbitrary precision. By using a higher
+precision, it is less likely that round-off errors occur:
+
+```js
+// round-off errors with numbers
+math.add(0.1, 0.2)                                     // Number, 0.30000000000000004
+math.divide(0.3, 0.2)                                  // Number, 1.4999999999999998
+
+// no round-off errors with BigNumbers :)
+math.add(math.bignumber(0.1), math.bignumber(0.2))     // BigNumber, 0.3
+math.divide(math.bignumber(0.3), math.bignumber(0.2))  // BigNumber, 1.5
+```
+
+
+## Limitations
+
+It's important to realize that BigNumbers do not solve *all* problems related
+to precision and round-off errors. Numbers with an infinite number of digits
+cannot be represented with a regular number nor a BigNumber. Though a BigNumber
+can store a much larger number of digits, the amount of digits remains limited
+if only to keep calculations fast enough to remain practical.
+
+```js
+const one = math.bignumber(1)
+const three = math.bignumber(3)
+const third = math.divide(one, three)
+console.log(third.toString())
+// outputs 0.3333333333333333333333333333333333333333333333333333333333333333
+
+const ans = math.multiply(third, three)
+console.log(ans.toString())
+// outputs 0.9999999999999999999999999999999999999999999999999999999999999999
+// this should be 1 again, but `third` is rounded to a limited number of digits 3
+```
+
+
+## Conversion
+
+BigNumbers can be converted to numbers and vice versa using the functions
+`number` and `bignumber`. When converting a BigNumber to a number, the high
+precision of the BigNumber will be lost. When a BigNumber is too large to be represented
+as Number, it will be initialized as `Infinity`.
+
+```js
+// converting numbers and BigNumbers
+const a = math.number(0.3)                         // number, 0.3
+const b = math.bignumber(a)                        // BigNumber, 0.3
+const c = math.number(b)                           // number, 0.3
+
+// exceeding the maximum of a number
+const d = math.bignumber('1.2e500')                // BigNumber, 1.2e+500
+const e = math.number(d)                           // number, Infinity
+
+// loosing precision when converting to number
+const f = math.bignumber('0.2222222222222222222')  // BigNumber, 0.2222222222222222222
+const g = math.number(f)                           // number,    0.2222222222222222
+```
diff --git a/node_modules/mathjs/docs/datatypes/complex_numbers.md b/node_modules/mathjs/docs/datatypes/complex_numbers.md
new file mode 100644
index 0000000..1b98698
--- /dev/null
+++ b/node_modules/mathjs/docs/datatypes/complex_numbers.md
@@ -0,0 +1,168 @@
+# Complex Numbers
+
+Math.js supports the creation, manipulation, and calculations with complex numbers.
+Support of complex numbers is powered by the library [complex.js](https://github.com/infusion/Complex.js).
+
+In mathematics, a complex number is an expression of the form `a + bi`,
+where `a` and `b` are real numbers and `i` represents the imaginary number
+defined as `i^2 = -1`. (In other words, `i` is the square root of `-1`.)
+The real number `a` is called the real part of the complex number,
+and the real number `b` is the imaginary part. For example, `3 + 2i` is a
+complex number, having real part `3` and imaginary part `2`.
+Complex numbers are often used in applied mathematics, control theory,
+signal analysis, fluid dynamics and other fields.
+
+## Usage
+
+A complex number is created using the function `math.complex`. This function
+accepts:
+
+- two numbers representing the real and imaginary part of the value,
+- a single string containing a complex value in the form `a + bi` where `a`
+  and `b` respectively represent the real and imaginary part of the complex number.
+- an object with either properties `re` and `im` for the real and imaginary
+  part of the value, or two properties `r` and `phi` containing the polar
+  coordinates of a complex value.
+The function returns a `Complex` object.
+
+Syntax:
+
+```js
+math.complex(re: number) : Complex
+math.complex(re: number, im: number) : Complex
+math.complex(complex: Complex) : Complex
+math.complex({re: Number, im: Number}) : Complex
+math.complex({r: number, phi: number}) : Complex
+math.complex({abs: number, arg: number}) : Complex
+math.complex(str: string) : Complex
+```
+
+Examples:
+
+```js
+const a = math.complex(2, 3)     // Complex 2 + 3i
+a.re                             // Number 2
+a.im                             // Number 3
+
+const b = math.complex('4 - 2i') // Complex 4 - 2i
+b.re = 5                         // Number 5
+b                                // Complex 5 - 2i
+```
+
+## Calculations
+
+Most functions of math.js support complex numbers. Complex and real numbers
+can be used together.
+
+```js
+const a = math.complex(2, 3)     // Complex 2 + 3i
+const b = math.complex('4 - 2i') // Complex 4 - 2i
+
+math.re(a)                       // Number 2
+math.im(a)                       // Number 3
+math.conj(a)                     // Complex 2 - 3i
+
+math.add(a, b)                   // Complex 6 + i
+math.multiply(a, 2)              // Complex 4 + 6i
+math.sqrt(-4)                    // Complex 2i
+```
+
+## API
+A `Complex` object created by `math.complex` contains the following properties and functions:
+
+### complex.re
+
+A number containing the real part of the complex number. Can be read and replaced.
+
+### complex.im
+
+A number containing the imaginary part of the complex number. Can be read and replaced.
+
+### complex.clone()
+
+Create a clone of the complex number.
+
+### complex.equals(other)
+
+Test whether a complex number equals another complex value.
+
+  Two complex numbers are equal when both their real and imaginary parts are
+  equal.
+
+### complex.neg()
+
+Returns a complex number with a real part and an imaginary part equal in magnitude but opposite in sign to the current complex number.
+
+### complex.conjugate()
+
+Returns a complex number with an equal real part and an imaginary part equal in magnitude but opposite in sign to the current complex number.
+
+### complex.inverse()
+
+Returns a complex number that is inverse of the current complex number.
+
+### complex.toVector()
+
+Get the vector representation of the current complex number. Returns an array of size 2.
+
+### complex.toJSON()
+
+Returns a JSON representation of the complex number, with signature
+  `{mathjs: 'Complex', re: number, im: number}`.
+  Used when serializing a complex number, see [Serialization](../core/serialization.md).
+
+### complex.toPolar()
+
+Get the polar coordinates of the complex number, returns
+  an object with properties `r` and `phi`.
+
+### complex.toString()
+
+Returns a string representation of the complex number, formatted
+  as `a + bi` where `a` is the real part and `b` the imaginary part.
+
+
+### complex.format([precision: number])
+
+Get a string representation of the complex number,
+  formatted as `a + bi` where `a` is the real part and `b` the imaginary part.
+  If precision is defined, the units value will be rounded to the provided
+  number of digits.
+
+## Static methods
+The following static methods can be accessed using `math.Complex`
+
+
+### Complex.fromJSON(json)
+
+Revive a complex number from a JSON object. Accepts
+  An object `{mathjs: 'Complex', re: number, im: number}`, where the property
+  `mathjs` is optional.
+  Used when deserializing a complex number, see [Serialization](../core/serialization.md).
+
+### Complex.fromPolar(r: number, phi: number)
+
+Create a complex number from polar coordinates.
+
+
+### Complex.compare(a: Complex, b: Complex)
+
+Returns the comparision result of two complex number:
+
+- Returns 1 when the real part of `a` is larger than the real part of `b`
+- Returns -1 when the real part of `a` is smaller than the real part of `b`
+- Returns 1 when the real parts are equal
+  and the imaginary part of `a` is larger than the imaginary part of `b`
+- Returns -1 when the real parts are equal
+  and the imaginary part of `a` is smaller than the imaginary part of `b`
+- Returns 0 when both real and imaginary parts are equal.
+
+Example:
+```js
+const a = math.complex(2, 3)   // Complex 2 + 3i
+const b = math.complex(2, 1)   // Complex 2 + 1i
+math.Complex.compare(a,b) // returns 1
+
+//create from json 
+const c = math.Complex.fromJSON({mathjs: 'Complex', re: 4, im: 3})  // Complex 4 + 3i
+```
diff --git a/node_modules/mathjs/docs/datatypes/fractions.md b/node_modules/mathjs/docs/datatypes/fractions.md
new file mode 100644
index 0000000..fa73de4
--- /dev/null
+++ b/node_modules/mathjs/docs/datatypes/fractions.md
@@ -0,0 +1,75 @@
+# Fractions
+
+For calculations with fractions, math.js supports a `Fraction` data type. 
+Fraction support is powered by [fraction.js](https://github.com/infusion/Fraction.js).
+Unlike [numbers](numbers.md) and [BigNumbers](./bignumbers.md), fractions can 
+store numbers with infinitely repeating decimals, for example `1/3 = 0.3333333...`, 
+which can be represented as `0.(3)`, or `2/7` which can be represented as `0.(285714)`.
+
+
+## Usage
+
+A Fraction can be created using the function `fraction`:
+
+```js
+math.fraction('1/3')   // Fraction, 1/3
+math.fraction(2, 3)    // Fraction, 2/3
+math.fraction('0.(3)') // Fraction, 1/3
+```
+
+And can be used in functions like `add` and `multiply` like:
+
+```js
+math.add(math.fraction('1/3'), math.fraction('1/6'))      // Fraction, 1/2
+math.multiply(math.fraction('1/4'), math.fraction('1/2')) // Fraction, 1/8
+```
+
+Note that not all functions support fractions. For example trigonometric 
+functions doesn't support fractions. When not supported, the functions
+will convert the input to numbers and return a number as result.
+
+Most functions will determine the type of output from the type of input:
+a number as input will return a number as output, a Fraction as input returns
+a Fraction as output. Functions which cannot determine the type of output
+from the input (for example `math.evaluate`) use the default number type `number`,
+which can be configured when instantiating math.js. To configure the use of
+fractions instead of [numbers](numbers.md) by default, configure math.js like:
+
+```js
+// Configure the default type of number: 'number' (default), 'BigNumber', or 'Fraction'
+math.config({
+  number: 'Fraction'
+})
+
+// use the expression parser
+math.evaluate('0.32 + 0.08') // Fraction, 2/5
+```
+
+## Support
+
+The following functions support fractions:
+
+- Arithmetic functions: `abs`, `add`, `ceil`, `cube`, `divide`, `dotDivide`, `dotMultiply`, `fix`, `floor`, `gcd`, `mod`, `multiply`, `round`, `sign`, `square`, `subtract`, `unaryMinus`, `unaryPlus`.
+- Construction functions: `fraction`.
+- Relational functions: `compare`, `deepEqual`, `equal`, `larger`, `largerEq`, `smaller`, `smallerEq`, `unequal`.
+- Utils functions: `format`.
+
+
+## Conversion
+
+Fractions can be converted to numbers and vice versa using the functions
+`number` and `fraction`. When converting a Fraction to a number, precision
+may be lost when the value cannot represented in 16 digits. 
+
+```js
+// converting numbers and fractions
+const a = math.number(0.3)                       // number, 0.3
+const b = math.fraction(a)                       // Fraction, 3/10
+const c = math.number(b)                         // number, 0.3
+
+// loosing precision when converting to number: a fraction can represent
+// a number with an infinite number of repeating decimals, a number just
+// stores about 16 digits and cuts consecutive digits.
+const d = math.fraction('2/5')                   // Fraction, 2/5
+const e = math.number(d)                         // number, 0.4
+```
diff --git a/node_modules/mathjs/docs/datatypes/index.md b/node_modules/mathjs/docs/datatypes/index.md
new file mode 100644
index 0000000..5f3cd2e
--- /dev/null
+++ b/node_modules/mathjs/docs/datatypes/index.md
@@ -0,0 +1,67 @@
+# Data Types
+
+The functions of math.js support multiple data types, both native JavaScript
+types as well as more advanced types implemented in math.js. The data types can
+be mixed together in calculations, for example by adding a Number to a
+Complex number or Array.
+
+The supported data types are:
+
+- Boolean
+- [Number](numbers.md)
+- [BigNumber](bignumbers.md)
+- [Complex](complex_numbers.md)
+- [Fraction](fractions.md)
+- [Array](matrices.md)
+- [Matrix](matrices.md)
+- [Unit](units.md)
+- String
+
+Function [`math.typeOf(x)`](../reference/functions/typeOf.md) can be used to get
+the type of a variable.
+
+Example usage:
+
+```js
+// use numbers
+math.subtract(7.1, 2.3)          // 4.8
+math.round(math.pi, 3)           // 3.142
+math.sqrt(4.41e2)                // 21
+
+// use BigNumbers
+math.add(math.bignumber(0.1), math.bignumber(0.2)) // BigNumber, 0.3
+
+// use Fractions
+math.add(math.fraction(1), math.fraction(3)) // Fraction, 0.(3)
+
+// use strings
+math.add('hello ', 'world')      // 'hello world'
+math.max('A', 'D', 'C')          // 'D'
+
+// use complex numbers
+const a = math.complex(2, 3)     // 2 + 3i
+a.re                             // 2
+a.im                             // 3
+const b = math.complex('4 - 2i') // 4 - 2i
+math.add(a, b)                   // 6 + i
+math.sqrt(-4)                    // 2i
+
+// use arrays
+const array = [1, 2, 3, 4, 5]
+math.factorial(array)            // Array,  [1, 2, 6, 24, 120]
+math.add(array, 3)               // Array,  [3, 5, 6, 7, 8]
+
+// use matrices
+const matrix = math.matrix([1, 4, 9, 16, 25]) // Matrix, [1, 4, 9, 16, 25]
+math.sqrt(matrix)                             // Matrix, [1, 2, 3, 4, 5]
+
+// use units
+const a = math.unit(55, 'cm')    // 550 mm
+const b = math.unit('0.1m')      // 100 mm
+math.add(a, b)                   // 0.65 m
+
+// check the type of a variable
+math.typeOf(2)                   // 'number'
+math.typeOf(math.unit('2 inch')) // 'Unit'
+math.typeOf(math.sqrt(-4))       // 'Complex'
+```
diff --git a/node_modules/mathjs/docs/datatypes/matrices.md b/node_modules/mathjs/docs/datatypes/matrices.md
new file mode 100644
index 0000000..a931376
--- /dev/null
+++ b/node_modules/mathjs/docs/datatypes/matrices.md
@@ -0,0 +1,358 @@
+# Matrices
+
+Math.js supports multi dimensional matrices and arrays. Matrices can be
+created, manipulated, and used in calculations. Both regular JavaScript
+arrays as well as the matrix type implemented by math.js can be used
+interchangeably in all relevant math.js functions. math.js supports both
+dense and sparse matrices.
+
+
+## Arrays and matrices
+
+Math.js supports two types of matrices:
+
+- `Array`, a regular JavaScript array. A multi dimensional array can be created
+  by nesting arrays.
+- `Matrix`, a matrix implementation by math.js. A `Matrix` is an object wrapped
+  around a regular JavaScript `Array`, providing utility functions for easy
+  matrix manipulation such as `subset`, `size`, `resize`, `clone`, and more.
+
+In most cases, the type of matrix output from functions is determined by the
+function input: An `Array` as input will return an `Array`, a `Matrix` as input
+will return a `Matrix`. In case of mixed input, a `Matrix` is returned.
+For functions where the type of output cannot be determined from the
+input, the output is determined by the configuration option `matrix`,
+which can be a string `'Matrix'` (default) or `'Array'`.
+
+```js
+// create an array and a matrix
+const array = [[2, 0], [-1, 3]]               // Array
+const matrix = math.matrix([[7, 1], [-2, 3]]) // Matrix
+
+// perform a calculation on an array and matrix
+math.square(array)                            // Array,  [[4, 0], [1, 9]]
+math.square(matrix)                           // Matrix, [[49, 1], [4, 9]]
+
+// perform calculations with mixed array and matrix input
+math.add(array, matrix)                       // Matrix, [[9, 1], [-3, 6]]
+math.multiply(array, matrix)                  // Matrix, [[14, 2], [-13, 8]]
+
+// create a matrix. Type of output of function ones is determined by the
+// configuration option `matrix`
+math.ones(2, 3)                               // Matrix, [[1, 1, 1], [1, 1, 1]]
+```
+
+
+## Creation
+
+A matrix can be created from an array using the function `math.matrix`. The
+provided array can contain nested arrays in order to create a multi-dimensional matrix. When called without arguments, an empty matrix will be
+created.
+
+```js
+// create matrices
+math.matrix()                           // Matrix, size [0]
+math.matrix([0, 1, 2])                  // Matrix, size [3]
+math.matrix([[0, 1], [2, 3], [4, 5]])   // Matrix, size [3, 2]
+```
+
+Math.js supports regular Arrays. Multiple dimensions can be created
+by nesting Arrays in each other.
+
+```js
+// create arrays
+[]                                      // Array, size [0]
+[0, 1, 2]                               // Array, size [3]
+[[0, 1], [2, 3], [4, 5]]                // Array, size [3, 2]
+```
+
+Matrices can contain different types of values: numbers, complex numbers,
+units, or strings. Different types can be mixed together in a single matrix.
+
+```js
+// create a matrix with mixed types
+const a = math.matrix([2.3, 'hello', math.complex(3, -4), math.unit('5.2 mm')]) 
+a.subset(math.index(1))  // 'hello'
+```
+
+
+There are a number of functions to create a matrix with a specific size and
+content: `ones`, `zeros`, `identity`.
+
+```js
+// zeros creates a matrix filled with zeros
+math.zeros(3)           // Matrix, size [3],    [0, 0, 0]
+math.zeros(3, 2)        // Matrix, size [3, 2], [[0, 0], [0, 0], [0, 0]]
+math.zeros(2, 2, 2)     // Matrix, size [2, 2, 2],
+                        //   [[[0, 0], [0, 0]], [[0, 0], [0, 0]]]
+
+// ones creates a matrix filled with ones
+math.ones(3)                        // Matrix, size [3],    [1, 1, 1]
+math.multiply(math.ones(2, 2), 5)   // Matrix, size [2, 2], [[5, 5], [5, 5]]
+
+// identity creates an identity matrix
+math.identity(3)      // Matrix, size [3, 3], [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+math.identity(2, 3)   // Matrix, size [2, 3], [[1, 0, 0], [0, 1, 0]]
+```
+
+
+The functions `ones`, `zeros`, and `identity` also accept a single array
+or matrix containing the dimensions for the matrix. When the input is an Array,
+the functions will output an Array. When the input is a Matrix, the output will
+be a Matrix. Note that in case of numbers as arguments, the output is
+determined by the option `matrix` as discussed in section
+[Arrays and matrices](#arrays-and-matrices).
+
+```js
+// Array as input gives Array as output
+math.ones([2, 3])               // Array,  size [3, 2], [[1, 1, 1], [1, 1, 1]]
+math.ones(math.matrix([2, 3]))  // Matrix, size [3, 2], [[1, 1, 1], [1, 1, 1]]
+```
+
+Ranges can be created using the function `range`. The function `range` is
+called with parameters start and end, and optionally a parameter step.
+The start of the range is included, the end of the range is excluded.
+
+```js
+math.range(0, 4)        // [0, 1, 2, 3]
+math.range(0, 8, 2)     // [0, 2, 4, 6]
+math.range(3, -1, -1)   // [3, 2, 1, 0]
+```
+
+
+## Calculations
+
+All relevant functions of math.js support matrices and arrays.
+
+```js
+// perform a calculation on a matrix
+const a = math.matrix([1, 4, 9, 16, 25])  // Matrix, [1, 4, 9, 16, 25]
+math.sqrt(a)                              // Matrix, [1, 2, 3, 4, 5]
+
+// perform a calculation on an array
+const b = [1, 2, 3, 4, 5] 
+math.factorial(b)                         // Array,  [1, 2, 6, 24, 120]
+
+// multiply an array with a matrix
+const c = [[2, 0], [-1, 3]]               // Array
+const d = math.matrix([[7, 1], [-2, 3]])  // Matrix
+math.multiply(c, d)                       // Matrix, [[14, 2], [-13, 8]]
+
+// add a number to a matrix
+math.add(c, 2)                            // Array, [[4, 2], [1, 5]]
+
+// calculate the determinant of a matrix
+math.det(c)                               // 6
+math.det(d)                               // 23
+```
+
+
+## Size and Dimensions
+
+Math.js uses geometric dimensions:
+
+- A scalar is zero-dimensional.
+- A vector is one-dimensional.
+- A matrix is two or multi-dimensional.
+
+The size of a matrix can be calculated with the function `size`. Function `size`
+returns a `Matrix` or `Array`, depending on the configuration option `matrix`.
+Furthermore, matrices have a function `size` as well, which always returns
+an Array.
+
+```js
+// get the size of a scalar
+math.size(2.4)                                // Matrix, []
+math.size(math.complex(3, 2))                 // Matrix, []
+math.size(math.unit('5.3 mm'))                // Matrix, []
+
+// get the size of a one-dimensional matrix (a vector) and a string
+math.size([0, 1, 2, 3])                       // Array, [4]
+math.size('hello world')                      // Matrix, [11]
+
+// get the size of a two-dimensional matrix
+const a = [[0, 1, 2, 3]]                      // Array
+const b = math.matrix([[0, 1, 2], [3, 4, 5]]) // Matrix
+math.size(a)                                  // Array, [1, 4]
+math.size(b)                                  // Matrix, [2, 3]
+
+// matrices have a function size (always returns an Array)
+b.size()                                      // Array, [2, 3]
+
+// get the size of a multi-dimensional matrix
+const c = [[[0, 1, 2], [3, 4, 5]], [[6, 7, 8], [9, 10, 11]]]
+math.size(c)                                  // Array, [2, 2, 3]
+```
+
+Note that the dimensions themselves do not have a meaning attached. 
+When creating and printing a two dimensional matrix, the first dimension is 
+normally rendered as the _column_, and the second dimension is rendered as 
+the _row_. For example:
+
+```js
+console.table(math.zeros([2, 4]))
+// 0 0 0 0
+// 0 0 0 0
+```
+
+If you have a matrix where the first dimension means `x` and the second 
+means `y`, this will look confusing since `x` is printed as _column_ 
+(vertically) and `y` as _row_ (horizontally).
+
+
+## Resizing
+
+Matrices can be resized using their `resize` function. This function is called
+with an Array with the new size as the first argument, and accepts an optional
+default value. By default, new entries will be set to `0`, but it is possible
+to pass a different default value like `null` to clearly indicate that
+the entries haven't been explicitly set.
+
+```js
+const a = math.matrix() // Matrix, size [0],       []
+a.resize([2, 3])        // Matrix, size [2, 3],    [[0, 0, 0], [0, 0, 0]]
+a.resize([2, 2, 2])     // Matrix, size [2, 2, 2],
+                        //   [[[0, 0], [0, 0]], [[0, 0], [0, 0]]]
+
+const b = math.matrix()
+b.resize([3], 7)        // Matrix, size [3],    [7, 7, 7]
+b.resize([5], 9)        // Matrix, size [5],    [7, 7, 7, 9, 9]
+b.resize([2])           // Matrix, size [2],    [7, 7]
+```
+
+
+Outer dimensions of a matrix can be squeezed using the function `squeeze`. When
+getting or setting a subset in a matrix, the subset is automatically squeezed
+or unsqueezed.
+
+```js
+// squeeze a matrix
+const a = [[[0, 1, 2]]]
+math.squeeze(a)             // [0, 1, 2]
+math.squeeze([[3]])         // 3
+
+// subsets are automatically squeezed
+const b = math.matrix([[0, 1], [2, 3]])
+b.subset(math.index(1, 0))  // 2
+```
+
+
+## Getting or replacing subsets
+
+Subsets of a matrix can be retrieved or replaced using the function `subset`.
+Matrices have a `subset` function, which is applied to the matrix itself:
+`Matrix.subset(index [, replacement])`. For both matrices and arrays,
+the static function `subset(matrix, index [, replacement])` can be used.
+When parameter `replacement` is provided, the function will replace a subset
+in the matrix, and if not, a subset of the matrix will be returned.
+
+A subset can be defined using an `Index`. An `Index` contains a single value
+or a set of values for each dimension of a matrix. An `Index` can be
+created using the function `index`.
+Matrix indexes in math.js are zero-based, like most programming languages
+including JavaScript itself.
+
+Note that mathematical applications like Matlab and Octave work differently,
+as they use one-based indexes.
+
+```js
+// create some matrices
+const a = [0, 1, 2, 3]
+const b = [[0, 1], [2, 3]]
+const c = math.zeros(2, 2)
+const d = math.matrix([[0, 1, 2], [3, 4, 5], [6, 7, 8]])
+const e = math.matrix()
+
+// get a subset
+math.subset(a, math.index(1))                 // 1
+math.subset(a, math.index([2, 3]))            // Array, [2, 3]
+math.subset(a, math.index(math.range(0,4)))   // Array, [0, 1, 2, 3]
+math.subset(b, math.index(1, 0))              // 2
+math.subset(b, math.index(1, [0, 1]))         // Array, [2, 3]
+math.subset(b, math.index([0, 1], 0))         // Matrix, [[0], [2]]
+
+// get a subset
+d.subset(math.index([1, 2], [0, 1]))          // Matrix, [[3, 4], [6, 7]]
+d.subset(math.index(1, 2))                    // 5
+
+// replace a subset. The subset will be applied to a clone of the matrix
+math.subset(b, math.index(1, 0), 9)           // Array, [[0, 1], [9, 3]]
+math.subset(b, math.index(2, [0, 1]), [4, 5]) // Array, [[0, 1], [2, 3], [4, 5]]
+
+// replace a subset. The subset will be applied to the matrix itself
+c.subset(math.index(0, 1),1)                  // Matrix, [[0, 1], [0, 0]]
+c.subset(math.index(1, [0, 1]), [2, 3])       // Matrix, [[0, 1], [2, 3]]
+e.resize([2, 3], 0)                           // Matrix, [[0, 0, 0], [0, 0, 0]]
+e.subset(math.index(1, 2), 5)                 // Matrix, [[0, 0, 0], [0, 0, 5]]
+```
+
+## Iterating
+
+Matrices contain functions `map` and `forEach` to iterate over all elements of
+the (multidimensional) matrix. The callback function of `map` and `forEach` has
+three parameters: `value` (the value of the currently iterated element),
+`index` (an array with the index value for each dimension), and `matrix` (the
+matrix being iterated). This syntax is similar to the `map` and `forEach`
+functions of native JavaScript Arrays, except that the index is no number but
+an Array with numbers for each dimension.
+
+```js
+const a = math.matrix([[0, 1], [2, 3], [4, 5]])
+
+// The iteration below will output the following in the console:
+//    value: 0 index: [0, 0]
+//    value: 1 index: [0, 1]
+//    value: 2 index: [1, 0]
+//    value: 3 index: [1, 1]
+//    value: 4 index: [2, 0]
+//    value: 5 index: [2, 1]
+a.forEach(function (value, index, matrix) {
+  console.log('value:', value, 'index:', index) 
+}) 
+
+// Apply a transformation on the matrix
+const b = a.map(function (value, index, matrix) {
+  return math.multiply(math.sin(value), math.exp(math.abs(value))) 
+}) 
+console.log(b.format(5))  // [[0, 2.2874], [6.7188, 2.8345], [-41.32, -142.32]]
+
+// Create a matrix with the cumulative of all elements
+let count = 0
+const cum = a.map(function (value, index, matrix) {
+  count += value 
+  return count 
+}) 
+console.log(cum.toString())  // [[0, 1], [3, 6], [10, 15]]
+```
+
+## Storage types
+
+Math.js supports both dense matrices as well as sparse matrices. Sparse matrices are efficient for matrices largely containing zeros. In that case they save a lot of memory, and calculations can be much faster than for dense matrices.
+
+Math.js supports two type of matrices:
+
+- Dense matrix (`'dense'`, `default`) A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.
+- Sparse matrix (`'sparse'`): A two dimensional sparse matrix implementation.
+
+The type of matrix can be selected when creating a matrix using the construction functions `matrix`, `diag`, `identity`, `ones`, and `zeros`.
+
+```js
+// create sparse matrices
+const m1 = math.matrix([[0, 1], [0, 0]], 'sparse')
+const m2 = math.identity(1000, 1000, 'sparse')
+```
+
+## API
+
+All relevant functions in math.js support Matrices and Arrays. Functions like `math.add` and `math.subtract`, `math.sqrt` handle matrices element wise. There is a set of functions specifically for creating or manipulating matrices, such as:
+
+- Functions like `math.matrix` and `math.sparse`, `math.ones`, `math.zeros`, and `math.identity` to create a matrix.
+- Functions like `math.subset` and `math.index` to get or replace a part of a matrix
+- Functions like `math.transpose` and `math.diag` to manipulate matrices.
+
+A full list of matrix functions is available on the [functions reference page](../reference/functions.md#matrix-functions).
+
+Two types of matrix classes are available in math.js, for storage of dense and sparse matrices. Although they contain public functions documented as follows, using the following API directly is *not* recommended. Prefer using the functions in the "math" namespace wherever possible.
+
+- [DenseMatrix](../reference/classes/densematrix.md)
+- [SparseMatrix](../reference/classes/sparsematrix.md)
diff --git a/node_modules/mathjs/docs/datatypes/numbers.md b/node_modules/mathjs/docs/datatypes/numbers.md
new file mode 100644
index 0000000..29e7534
--- /dev/null
+++ b/node_modules/mathjs/docs/datatypes/numbers.md
@@ -0,0 +1,106 @@
+# Numbers
+
+Math.js supports three types of numbers:
+
+- Number for fast floating point arithmetic, described on this page.
+- BigNumber for arbitrary precision arithmetic, described on the page
+  [BigNumbers](bignumbers.md).
+- Fraction, which stores numbers in terms of a numerator and denominators, 
+  described on the page [Fractions](fractions.md).
+
+
+## Configuration
+
+Most functions can determine the type of output from the type of input:
+a number as input will return a number as output, a BigNumber as input returns
+a BigNumber as output. Functions which cannot determine the type of output
+from the input (for example `math.evaluate`) use the default number type, which
+can be configured when instantiating math.js:
+
+```js
+math.config({
+  number: 'number' // Default type of number: 
+                   // 'number' (default), 'BigNumber', or 'Fraction'
+})
+```
+
+## Round-off errors
+
+Math.js uses the built-in JavaScript Number type. A Number is a floating point
+number with a limited precision of 64 bits, about 16 digits. The largest integer
+number which can be represented by a JavaScript Number
+is `+/- 9007199254740992` (`+/- 2^53`). Because of the limited precision of
+floating point numbers round-off errors can occur during calculations.
+This can be easily demonstrated:
+
+```js
+// a round-off error
+0.1 + 0.2            // 0.30000000000000004
+math.add(0.1, 0.2)   // 0.30000000000000004
+```
+
+In most cases, round-off errors don't matter: they have no significant
+impact on the results. However, it looks ugly when displaying output to a user.
+A solution is to limit the precision just below the actual precision of 16
+digits in the displayed output:
+
+```js
+// prevent round-off errors showing up in output
+const ans = math.add(0.1, 0.2)     //  0.30000000000000004
+math.format(ans, {precision: 14})  // '0.3'
+```
+
+Alternatives are to use [Fractions](fractions.md) which store a number as a numerator and denominator, or [BigNumbers](bignumbers.md), which store a number with a higher precision.
+
+
+## Minimum and maximum
+
+A Number can store values between `5e-324` and `1.7976931348623157e+308`.
+Values smaller than the minimum are stored as `0`, and values larger than the
+maximum are stored as `+/- Infinity`.
+
+```js
+// exceeding the maximum and minimum number
+console.log(1e309)   // Infinity
+console.log(1e-324)  // 0
+```
+
+## Equality
+
+Because of rounding errors in calculations, it is unsafe to compare JavaScript
+Numbers. For example executing `0.1 + 0.2 == 0.3` in JavaScript will return
+false, as the addition `0.1 + 0.2` introduces a round-off error and does not
+return exactly `0.3`.
+
+To solve this problem, the relational functions of math.js check whether the
+relative difference between the compared values is smaller than the configured
+option `epsilon`. In pseudo code (without exceptions for 0, Infinity and NaN):
+
+    diff = abs(x - y)
+    nearlyEqual = (diff <= max(abs(x), abs(y)) * EPSILON) OR (diff < DBL_EPSILON)
+
+where:
+
+ - `EPSILON` is the relative difference between x and y. Epsilon is configurable
+   and is `1e-12` by default. See [Configuration](../core/configuration.md).
+ - `DBL_EPSILON` is the minimum positive floating point number such that
+   `1.0 + DBL_EPSILON !== 1.0`. This is a constant with a value of approximately
+   `2.2204460492503130808472633361816e-16`.
+
+Note that the relational functions cannot be used to compare small values
+(`< 2.22e-16`). These values are all considered equal to zero.
+
+Examples:
+
+```js
+// compare values having a round-off error
+console.log(0.1 + 0.2 === 0.3)           // false
+console.log(math.equal(0.1 + 0.2, 0.3))  // true
+
+// small values (< 2.22e-16) cannot be compared
+console.log(3e-20 === 3.1e-20)           // false
+console.log(math.equal(3e-20, 3.1e-20))  // true
+```
+
+The available relational functions are: `compare`, `equal`, `larger`,
+`largerEq`, `smaller`, `smallerEq`, `unequal`.
diff --git a/node_modules/mathjs/docs/datatypes/units.md b/node_modules/mathjs/docs/datatypes/units.md
new file mode 100644
index 0000000..1d7cf86
--- /dev/null
+++ b/node_modules/mathjs/docs/datatypes/units.md
@@ -0,0 +1,444 @@
+# Units
+
+Math.js supports units. Units can be used to do calculations and to perform
+conversions.
+
+## Usage
+
+Units can be created using the function `math.unit`. This function accepts
+either a single string argument containing a value and unit, or two arguments,
+the first being a numeric value and the second a string containing a unit.
+Most units support prefixes like `k` or `kilo`, and many units have both a
+full name and an abbreviation. The returned object is a `Unit`.
+
+Syntax:
+
+```js
+math.unit(value: number, name: string) : Unit
+math.unit(unit: string) : Unit
+math.unit(unit: Unit) : Unit
+```
+
+Example usage:
+
+```js
+const a = math.unit(45, 'cm')             // Unit 450 mm
+const b = math.unit('0.1 kilogram')       // Unit 100 gram
+const c = math.unit('2 inch')             // Unit 2 inch
+const d = math.unit('90 km/h')            // Unit 90 km/h
+const e = math.unit('101325 kg/(m s^2)')  // Unit 101325 kg / (m s^2)
+
+const d = c.to('cm')                      // Unit 5.08 cm
+b.toNumber('gram')                        // Number 100
+math.number(b, 'gram')                    // Number 100
+
+c.equals(a)                               // false
+c.equals(d)                               // true
+c.equalBase(a)                            // true
+c.equalBase(b)                            // false
+
+d.toString()                              // String "5.08 cm"
+```
+
+Use care when creating a unit with multiple terms in the denominator. Implicit multiplication has the same operator precedence as explicit multiplication and division, which means these three expressions are identical:
+
+```js
+// These three are identical
+const correct1 = math.unit('8.314 m^3 Pa / mol / K')          // Unit 8.314 (m^3 Pa) / (mol K)
+const correct2 = math.unit('8.314 (m^3 Pa) / (mol K)')        // Unit 8.314 (m^3 Pa) / (mol K)
+const correct3 = math.unit('8.314 (m^3 * Pa) / (mol * K)')    // Unit 8.314 (m^3 Pa) / (mol K)
+```
+But this expression, which omits the second `/` between `mol` and `K`, results in the wrong value:
+
+```js
+// Missing the second '/' between 'mol' and 'K'
+const incorrect = math.unit('8.314 m^3 Pa / mol K')           // Unit 8.314 (m^3 Pa K) / mol
+```
+
+## Calculations
+
+The operations that support units are `add`, `subtract`, `multiply`, `divide`, `pow`, `abs`, `sqrt`, `square`, `cube`, and `sign`.
+Trigonometric functions like `cos` are also supported when the argument is an angle.
+
+```js
+const a = math.unit(45, 'cm')       // Unit 450 mm
+const b = math.unit('0.1m')         // Unit 100 mm
+math.add(a, b)                      // Unit 0.65 m
+math.multiply(b, 2)                 // Unit 200 mm
+
+const c = math.unit(45, 'deg')      // Unit 45 deg
+math.cos(c)                         // Number 0.7071067811865476
+
+// Kinetic energy of average sedan on highway
+const d = math.unit('80 mi/h')      // Unit 80 mi/h
+const e = math.unit('2 tonne')      // Unit 2 tonne
+const f = math.multiply(0.5, math.multipy(math.pow(d, 2), e))
+                                    // 1.2790064742399996 MJ
+```
+
+Operations with arrays are supported too:
+
+```js
+// Force on a charged particle moving through a magnetic field
+const B = math.evaluate('[1, 0, 0] T')         // [1 T, 0 T, 0 T]
+const v = math.evaluate('[0, 1, 0] m/s')       // [0 m / s, 1 m / s, 0 m / s]
+const q = math.evaluate('1 C')                 // 1 C
+
+const F = math.multiply(q, math.cross(v, B))   // [0 N, 0 N, -1 N]
+```
+
+All arithmetic operators act on the value of the unit as it is represented in SI units.
+This may lead to surprising behavior when working with temperature scales like `celsius` (or `degC`) and `fahrenheit` (or `degF`).
+In general you should avoid calculations using `celsius` and `fahrenheit`. Rather, use `kelvin` (or `K`) and `rankine` (or `degR`) instead.
+This example highlights some problems when using `celsius` and `fahrenheit` in calculations:
+
+```js
+const T_14F = math.unit('14 degF')            // Unit 14 degF (263.15 K)
+const T_28F = math.multiply(T1, 2)            // Unit 487.67 degF (526.3 K), not 28 degF
+
+const Tnegative = math.unit(-13, 'degF')      // Unit -13 degF (248.15 K)
+const Tpositive = math.abs(T1)                // Unit -13 degF (248.15 K), not 13 degF
+
+const Trate1 = math.evaluate('5 (degC/hour)') // Unit 5 degC/hour
+const Trate2 = math.evaluate('(5 degC)/hour') // Unit 278.15 degC/hour
+```
+
+The expression parser supports units too. This is described in the section about
+units on the page [Syntax](../expressions/syntax.md#units).
+
+## User-Defined Units
+
+You can add your own units to Math.js using the `math.createUnit` function. The following example defines a new unit `furlong`, then uses the user-defined unit in a calculation:
+
+```js
+math.createUnit('furlong', '220 yards') 
+math.evaluate('1 mile to furlong')            // 8 furlong
+```
+
+If you cannot express the new unit in terms of any existing unit, then the second argument can be omitted. In this case, a new *base unit* is created:
+
+```js
+// A 'foo' cannot be expressed in terms of any other unit.
+math.createUnit('foo') 
+math.evaluate('8 foo * 4 feet')               // 32 foo feet
+```
+
+The second argument to `createUnit` can also be a configuration object consisting of the following properties:
+
+* **definition** A `string` or `Unit` which defines the user-defined unit in terms of existing built-in or user-defined units. If omitted, a new base unit is created.
+* **prefixes** A `string` indicating which prefixes math.js should use with the new unit. Possible values are `'none'`, `'short'`, `'long'`, `'binary_short'`, or `'binary_long'`. Default is `'none'`.
+* **offset** A value applied when converting to the unit. This is very helpful for temperature scales that do not share a zero with the absolute temperature scale. For example, if we were defining fahrenheit for the first time, we would use: `math.createUnit('fahrenheit', {definition: '0.555556 kelvin', offset: 459.67})`
+* **aliases** An array of strings to alias the new unit. Example: `math.createUnit('knot', {definition: '0.514444 m/s', aliases: ['knots', 'kt', 'kts']})`
+* **baseName** A `string` that specifies the name of the new dimension in case one needs to be created. Every unit in math.js has a dimension: length, time, velocity, etc. If the unit's `definition` doesn't match any existing dimension, or it is a new base unit, then `createUnit` will create a new dimension with the name `baseName` and assign it to the new unit. The default is to append `'_STUFF'` to the unit's name. If the unit already matches an existing dimension, this option has no effect.
+
+An optional `options` object can also be supplied as the last argument to `createUnits`. Currently only the `override` option is supported:
+
+```js
+// Redefine the mile (would not be the first time in history)
+math.createUnit('mile', '1609.347218694 m', {override: true})
+```
+Base units created without specifying a definition cannot be overridden.
+
+### Create several units at once
+Multiple units can defined using a single call to `createUnit` by passing an object map as the first argument, where each key in the object is the name of a new unit and the value is either a string defining the unit, or an object with the configuration properties listed above. If the value is an empty string or an object lacking a definition property, a new base unit is created.
+
+For example:
+
+```js
+math.createUnit( {
+  foo: {
+    prefixes: 'long',
+    baseName: 'essence-of-foo'
+  },
+  bar: '40 foo',
+  baz: {
+    definition: '1 bar/hour',
+    prefixes: 'long'
+  }
+},
+{
+  override: true
+})
+math.evaluate('50000 kilofoo/s')  // 4.5 gigabaz
+```
+
+### Return Value
+`createUnit` returns the created unit, or, when multiple units are created, the last unit created. Since `createUnit` is also compatible with the expression parser, this allows you to do things like this:
+
+```js
+math.evaluate('45 mile/hour to createUnit("knot", "0.514444m/s")')
+// 39.103964668651976 knot
+```
+
+### Support of custom characters in unit names
+Per default, the name of a new unit:
+- should start by a latin (A-Z or a-z) character
+- should contain only numeric (0-9) or latin characters
+
+It is possible to allow the usage of special characters (such as Greek alphabet, cyrillic alphabet, any Unicode symbols, etc.) by overriding the `Unit.isValidAlpha` static method. For example:
+```js
+const isAlphaOriginal = math.Unit.isValidAlpha
+const isGreekLowercaseChar = function (c) {
+  const charCode = c.charCodeAt(0)
+  return charCode > 944 && charCode < 970
+}
+math.Unit.isValidAlpha = function (c) {
+  return isAlphaOriginal(c) || isGreekLowercaseChar(c)
+}
+
+math.createUnit('θ', '1 rad')
+math.evaluate('1θ + 3 deg').toNumber('deg') // 60.29577951308232
+```
+
+## API
+A `Unit` object contains the following functions:
+
+### unit.clone()
+Clone the unit, returns a new unit with the same parameters.
+
+### unit.equalBase(unit)
+Test whether a unit has the same base as an other unit:
+length, mass, etc.
+
+### unit.equals(unit)
+Test whether a unit equals an other unit. Units are equal
+when they have the same base and same value when normalized to SI units.
+
+### unit.format([options])
+Get a string representation of the unit. The function
+will determine the best fitting prefix for the unit. See the [Format](../reference/functions/format.md)
+page for available options.
+
+### unit.fromJSON(json)
+Revive a unit from a JSON object. Accepts
+An object `{mathjs: 'Unit', value: number, unit: string, fixPrefix: boolean}`,
+where the property `mathjs` and `fixPrefix` are optional.
+Used when deserializing a unit, see [Serialization](../core/serialization.md).
+
+### unit.splitUnit(parts)
+Split a unit into the specified parts. For example:
+
+```js
+const u = math.unit(1, 'm')
+u.splitUnit(['ft', 'in'])    // 3 feet,3.3700787401574765 inch
+```
+
+### unit.to(unitName)
+Convert the unit to a specific unit name. Returns a clone of
+the unit with a fixed prefix and unit.
+
+### unit.toJSON()
+Returns a JSON representation of the unit, with signature
+`{mathjs: 'Unit', value: number, unit: string, fixPrefix: boolean}`.
+Used when serializing a unit, see [Serialization](../core/serialization.md).
+
+### unit.toNumber(unitName)
+Get the value of a unit when converted to the
+specified unit (a unit with optional prefix but without value).
+The type of the returned value is always `number`.
+
+### unit.toNumeric(unitName)
+Get the value of a unit when converted to the
+specified unit (a unit with optional prefix but without value).
+The type of the returned value depends on how the unit was created and
+can be `number`, `Fraction`, or `BigNumber`.
+
+### unit.toSI()
+Returns a clone of a unit represented in SI units. Works with units with or without a value.
+
+### unit.toString()
+Get a string representation of the unit. The function will
+determine the best fitting prefix for the unit.
+
+## Unit reference
+
+This section lists all available units, prefixes, and physical constants. These can be used via the Unit object, or via `math.evaluate()`.
+
+## Reference
+
+Math.js comes with the following built-in units.
+
+Base                | Unit
+------------------- | ---
+Length              | meter (m), inch (in), foot (ft), yard (yd), mile (mi), link (li), rod (rd), chain (ch), angstrom, mil
+Surface area        | m2, sqin, sqft, sqyd, sqmi, sqrd, sqch, sqmil, acre, hectare
+Volume              | m3, litre (l, L, lt, liter), cc, cuin, cuft, cuyd, teaspoon, tablespoon
+Liquid volume       | minim (min), fluiddram (fldr), fluidounce (floz), gill (gi), cup (cp), pint (pt), quart (qt), gallon (gal), beerbarrel (bbl), oilbarrel (obl), hogshead, drop (gtt)
+Angles              | rad (radian), deg (degree), grad (gradian), cycle, arcsec (arcsecond), arcmin (arcminute)
+Time                | second (s, secs, seconds), minute (mins, minutes), hour (h, hr, hrs, hours), day (days), week (weeks), month (months), year (years), decade (decades), century (centuries), millennium (millennia)
+Frequency           | hertz (Hz)
+Mass                | gram(g), tonne, ton, grain (gr), dram (dr), ounce (oz), poundmass (lbm, lb, lbs), hundredweight (cwt), stick, stone
+Electric current    | ampere (A)
+Temperature         | kelvin (K), celsius (degC), fahrenheit (degF), rankine (degR)
+Amount of substance | mole (mol)
+Luminous intensity  | candela (cd)
+Force               | newton (N), dyne (dyn), poundforce (lbf), kip
+Energy              | joule (J), erg, Wh, BTU, electronvolt (eV)
+Power               | watt (W), hp
+Pressure            | Pa, psi, atm, torr, bar, mmHg, mmH2O, cmH2O
+Electricity and magnetism | ampere (A), coulomb (C), watt (W), volt (V), ohm, farad (F), weber (Wb), tesla (T), henry (H), siemens (S), electronvolt (eV)
+Binary              | bits (b), bytes (B)
+
+Note: all time units are based on the Julian year, with one month being 1/12th of a Julian year, a year being one Julian year, a decade being 10 Julian years, a century being 100, and a millennium being 1000.
+
+Note that all relevant units can also be written in plural form, for example `5 meters` instead of `5 meter` or `10 seconds` instead of `10 second`.
+
+Surface and volume units can alternatively be expressed in terms of length units raised to a power, for example `100 in^2` instead of `100 sqin`.
+
+### Prefixes
+
+The following decimal prefixes are available.
+
+Name    | Abbreviation  | Value
+------- | ------------- | -----
+deca    | da            | 1e1
+hecto   | h             | 1e2
+kilo    | k             | 1e3
+mega    | M             | 1e6
+giga    | G             | 1e9
+tera    | T             | 1e12
+peta    | P             | 1e15
+exa     | E             | 1e18
+zetta   | Z             | 1e21
+yotta   | Y             | 1e24
+
+Name    | Abbreviation  | Value
+------  | ------------- | -----
+deci    | d             | 1e-1
+centi   | c             | 1e-2
+milli   | m             | 1e-3
+micro   | u             | 1e-6
+nano    | n             | 1e-9
+pico    | p             | 1e-12
+femto   | f             | 1e-15
+atto    | a             | 1e-18
+zepto   | z             | 1e-21
+yocto   | y             | 1e-24
+
+The following binary prefixes are available.
+They can be used with units `bits` (`b`) and `bytes` (`B`).
+
+Name | Abbreviation | Value
+---- | ------------ | -----
+kibi | Ki           | 1024
+mebi | Mi           | 1024^2
+gibi | Gi           | 1024^3
+tebi | Ti           | 1024^4
+pebi | Pi           | 1024^5
+exi  | Ei           | 1024^6
+zebi | Zi           | 1024^7
+yobi | Yi           | 1024^8
+
+Name  | Abbreviation | Value
+----- | ------------ | -----
+kilo  | k            | 1e3
+mega  | M            | 1e6
+giga  | G            | 1e9
+tera  | T            | 1e12
+peta  | P            | 1e15
+exa   | E            | 1e18
+zetta | Z            | 1e21
+yotta | Y            | 1e24
+
+
+### Physical Constants
+
+Math.js includes the following physical constants. See [Wikipedia](https://en.wikipedia.org/wiki/Physical_constants) for more information.
+
+
+#### Universal constants
+
+Name                  | Symbol                                                 | Value             | Unit
+----------------------|--------------------------------------------------------|-------------------|-------------------------------------------------------
+speedOfLight          | <i>c</i>                                               | 299792458         | m &#183; s<sup>-1</sup>
+gravitationConstant   | <i>G</i>                                               | 6.6738480e-11     | m<sup>3</sup> &#183; kg<sup>-1</sup> &#183; s<sup>-2</sup>
+planckConstant        | <i>h</i>                                               | 6.626069311e-34   | J &#183; s
+reducedPlanckConstant | <i><span style="text-decoration:overline">h</span></i> | 1.05457172647e-34 | J &#183; s
+
+
+#### Electromagnetic constants
+
+Name                      | Symbol                                           | Value                 | Unit
+--------------------------|--------------------------------------------------|-----------------------|----------------------------------------
+magneticConstant          | <i>&mu;<sub>0</sub></i>                          | 1.2566370614e-6       | N &#183; A<sup>-2</sup>
+electricConstant          | <i>&epsilon;<sub>0</sub></i>                     | 8.854187817e-12       | F &#183; m<sup>-1</sup>
+vacuumImpedance           | <i>Z<sub>0</sub></i>                             | 376.730313461         | &ohm;
+coulomb                   | <i>&kappa;</i>                                   | 8.9875517873681764e9  | N &#183; m<sup>2</sup> &#183; C<sup>-2</sup>
+elementaryCharge          | <i>e</i>                                         | 1.60217656535e-19     | C
+bohrMagneton              | <i>&mu;<sub>B</sub></i>                          | 9.2740096820e-24      | J &#183; T<sup>-1</sup>
+conductanceQuantum        | <i>G<sub>0</sub></i>                             | 7.748091734625e-5     | S
+inverseConductanceQuantum | <i>G<sub>0</sub><sup>-1</sup></i>                | 12906.403721742       | &ohm;
+magneticFluxQuantum       | <i><font face="Symbol">f</font><sub>0</sub></i>  | 2.06783375846e-15     | Wb
+nuclearMagneton           | <i>&mu;<sub>N</sub></i>                          | 5.0507835311e-27      | J &#183; T<sup>-1</sup>
+klitzing                  | <i>R<sub>K</sub></i>                             | 25812.807443484       | &ohm;
+
+<!-- TODO: implement josephson
+josephson                 | <i>K<sub>J</sub></i>                             | 4.8359787011e-14    | Hz &#183; V<sup>-1</sup>
+-->
+
+
+#### Atomic and nuclear constants
+
+Name                    | Symbol                | Value                 | Unit
+------------------------|------------------------------|-----------------------|----------------------------------
+bohrRadius              | <i>a<sub>0</sub></i>         | 5.291772109217e-11    | m
+classicalElectronRadius | <i>r<sub>e</sub></i>         | 2.817940326727e-15    | m
+electronMass            | <i>m<sub>e</sub></i>         | 9.1093829140e-31      | kg
+fermiCoupling           | <i>G<sub>F</sub></i>         | 1.1663645e-5          | GeV<sup>-2</sup>
+fineStructure           | <i>&alpha;</i>               | 7.297352569824e-3     | -
+hartreeEnergy           | <i>E<abbr>h</abbr> </i>      | 4.3597443419e-18      | J
+protonMass              | <i>m<sub>p</sub></i>         | 1.67262177774e-27     | kg
+deuteronMass            | <i>m<sub>d</sub></i>         | 3.3435830926e-27      | kg
+neutronMass             | <i>m<sub>n</sub></i>         | 1.6749271613e-27      | kg
+quantumOfCirculation    | <i>h / (2m<sub>e</sub>)</i>  | 3.636947552024e-4     | m<sup>2</sup> &#183; s<sup>-1</sup>
+rydberg                 | <i>R<sub>&infin;</sub></i>   | 10973731.56853955     | m<sup>-1</sup>
+thomsonCrossSection     |                              | 6.65245873413e-29     | m<sup>2</sup>
+weakMixingAngle         |                              | 0.222321              | -
+efimovFactor            |                              | 22.7                  | -
+
+
+#### Physico-chemical constants
+
+Name                | Symbol                       | Value               | Unit
+--------------------|------------------------------|---------------------|--------------------------------------------
+atomicMass          | <i>m<sub>u</sub></i>         | 1.66053892173e-27   | kg
+avogadro            | <i>N<sub>A</sub></i>         | 6.0221412927e23     | mol<sup>-1</sup>
+boltzmann           | <i>k</i>                     | 1.380648813e-23     | J &#183; K<sup>-1</sup>
+faraday             | <i>F</i>                     | 96485.336521        | C &#183; mol<sup>-1</sup>
+firstRadiation      | <i>c<sub>1</sub></i>         | 3.7417715317e-16    | W &#183; m<sup>2</sup>
+loschmidt           | <i>n<sub>0</sub></i>         | 2.686780524e25      | m<sup>-3</sup>
+gasConstant         | <i>R</i>                     | 8.314462175         | J &#183; K<sup>-1</sup> &#183; mol<sup>-1</sup>
+molarPlanckConstant | <i>N<sub>A</sub> &#183; h</i>| 3.990312717628e-10| J &#183; s &#183; mol<sup>-1</sup>
+molarVolume         | <i>V<sub>m</sub></i>         | 2.241396820e-10     | m<sup>3</sup> &#183; mol<sup>-1</sup>
+sackurTetrode       |                              | -1.164870823        | -
+secondRadiation     | <i>c<sub>2</sub></i>         | 1.438777013e-2      | m &#183; K
+stefanBoltzmann     | <i>&sigma;</i>               | 5.67037321e-8       | W &#183; m<sup>-2</sup> &#183; K<sup>-4</sup>
+wienDisplacement    | <i>b</i>                     | 2.897772126e-3      | m &#183; K
+
+<!-- TODO: implement spectralRadiance
+spectralRadiance    | <i>c<sub>1L</sub></i>        | 1.19104286953e-16  | W &#183; m<sup>2</sup> &#183; sr<sup>-1</sup>
+-->
+
+Note that the values of `loschmidt` and `molarVolume` are at `T = 273.15 K` and `p = 101.325 kPa`.
+The value of `sackurTetrode` is at `T = 1 K` and `p = 101.325 kPa`.
+
+
+#### Adopted values
+
+Name          | Symbol                       | Value   | Unit
+--------------|------------------------------|---------|-------------------------
+molarMass     | <i>M<sub>u</sub></i>         | 1e-3    | kg &#183; mol<sup>-1</sup>
+molarMassC12  | <i>M(<sub>12</sub>C)</i>     | 1.2e-2  | kg &#183; mol<sup>-1</sup>
+gravity       | <i>g<sub>n</sub></i>         | 9.80665 | m &#183; s<sup>-2</sup>
+atm           | <i>atm</i>                   | 101325  | Pa
+
+
+#### Natural units
+
+Name              | Symbol                | Value              | Unit
+------------------|-----------------------|--------------------|-----
+planckLength      | <i>l<sub>P</sub></i>  | 1.61619997e-35     | m
+planckMass        | <i>m<sub>P</sub></i>  | 2.1765113e-8       | kg
+planckTime        | <i>t<sub>P</sub></i>  | 5.3910632e-44      | s
+planckCharge      | <i>q<sub>P</sub></i>  | 1.87554595641e-18  | C
+planckTemperature | <i>T<sub>P</sub></i>  | 1.41683385e+32     | K
diff --git a/node_modules/mathjs/docs/expressions/algebra.md b/node_modules/mathjs/docs/expressions/algebra.md
new file mode 100644
index 0000000..943680c
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/algebra.md
@@ -0,0 +1,110 @@
+# Algebra (symbolic computation)
+
+math.js has built-in support for symbolic computation ([CAS](https://www.wikiwand.com/en/Computer_algebra_system)). It can parse expressions into an expression tree and do algebraic operations like simplification and derivation on the tree.
+
+> It's worth mentioning an excellent extension on math.js here: [mathsteps](https://github.com/socraticorg/mathsteps), a step-by-step math solver library that is focused on pedagogy (how best to teach). The math problems it focuses on are pre-algebra and algebra problems involving simplifying expressions.
+
+
+## Simplify
+
+The function [`math.simplify`](../reference/functions/simplify.md) simplifies an expression tree:
+
+```js
+// simplify an expression
+console.log(math.simplify('3 + 2 / 4').toString())              // '7 / 2'
+console.log(math.simplify('2x + 3x').toString())                // '5 * x'
+console.log(math.simplify('x^2 + x + 3 + x^2').toString())      // '2 * x ^ 2 + x + 3'
+console.log(math.simplify('x * y * -x / (x ^ 2)').toString())   // '-y'
+```
+
+The function accepts either a string or an expression tree (`Node`) as input, and outputs a simplified expression tree (`Node`). This node tree can be transformed and evaluated as described in detail on the page [Expression trees](expression_trees.md).
+
+```js
+// work with an expression tree, evaluate results
+const f = math.parse('2x + x')
+const simplified = math.simplify(f)
+console.log(simplified.toString())       // '3 * x'
+console.log(simplified.evaluate({x: 4})) // 12
+```
+
+Note that `simplify` has an optional argument `scope` that allows the definitions of variables in the expression (as numeric values, or as further expressions) to be specified and used in the simplification, e.g. continuing the previous example,
+
+```js
+console.log(math.simplify(f, {x: 4}).toString()) // 12
+console.log(math.simplify(f, {x: math.parse('y+z')}).toString()) // '3*(y+z)'
+```
+
+In general, simplification is an inherently dfficult problem; in fact, for certain classes of expressions and algebraic equivalences, it is undecidable whether a given expression is equivalent to zero. Moreover, simplification generally depends on the properties of the operations involved; since multiplication (for example) may have different properties (e.g., it might or might not be commutative) depending on the domain under consideration, different simplifications might be appropriate.
+
+As a result, `simplify()` has an additional optional argument, `options`, which controls its behavior. This argument is an object specifying any of various properties concerning the simplification process. See the [detailed documentation](../reference/functions/simplify.md) for a complete list, but currently the two most important properties are as follows. Note that the `options` argument may only be specified if the `scope` is as well.
+
+- `exactFractions` - a boolean which specifies whether non-integer numerical constants should be simplified to rational numbers when possible (true), or always converted to decimal notation (false).
+- `context` - an object whose keys are the names of operations ('add', 'multiply', etc.) and whose values specify algebraic properties of the corresponding operation (currently any of 'total', 'trivial', 'commutative', and 'associative'). Simplifications will only be performed if the properties they rely on are true in the given context. For example,
+```js
+const expr = math.parse('x*y-y*x')
+console.log(math.simplify(expr).toString())  // 0; * is commutative by default
+console.log(math.simplify(expr, {}, {context: {multiply: {commutative: false}}}))
+  // 'x*y-y*x'; the order of the right multiplication can't be reversed.
+```
+
+Note that the default context is very permissive (allows a lot of simplifications) but that there is also a `math.simplify.realContext` that only allows simplifications that are guaranteed to preserve the value of the expression on all real numbers:
+```js
+const rational = math.parse('(x-1)*x/(x-1)')
+console.log(math.simplify(expr, {}, {context: math.simplify.realContext})
+  // '(x-1)*x/(x-1)'; canceling the 'x-1' makes the expression defined at 1
+```
+
+For more details on the theory of expression simplification, see:
+
+- [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
+- [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
+
+
+## Derivative
+
+The function [`math.derivative`](../reference/functions/derivative.md) finds the symbolic derivative of an expression:
+
+```js
+// calculate a derivative
+console.log(math.derivative('2x^2 + 3x + 4', 'x').toString())   // '4 * x + 3'
+console.log(math.derivative('sin(2x)', 'x').toString())         // '2 * cos(2 * x)'
+```
+
+Similar to the function `math.simplify`, `math.derivative` accepts either a string or an expression tree (`Node`) as input, and outputs a simplified expression tree (`Node`).
+
+```js
+// work with an expression tree, evaluate results
+const h = math.parse('x^2 + x')
+const x = math.parse('x')
+const dh = math.derivative(h, x)
+console.log(dh.toString())        // '2 * x + 1'
+console.log(dh.evaluate({x: 3}))  // '7'
+```
+
+The rules used by `math.derivative` can be found on Wikipedia:
+
+- [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)
+
+
+## Rationalize
+
+The function [`math.transform`](../reference/functions/transform.md)  transforms a rationalizable expression in a rational fraction.
+If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.
+
+```js
+
+math.rationalize('2x/y - y/(x+1)')
+              // (2*x^2-y^2+2*x)/(x*y+y)
+math.rationalize('(2x+1)^6')
+              // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1
+math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')
+              // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)
+
+math.rationalize('x+x+x+y',{y:1}) // 3*x+1
+math.rationalize('x+x+x+y',{})    // 3*x+y
+
+const ret = math.rationalize('x+x+x+y',{},true)
+              // ret.expression=3*x+y, ret.variables = ["x","y"]
+const ret = math.rationalize('-2+5x^2',{},true)
+              // ret.expression=5*x^2-2, ret.variables = ["x"], ret.coefficients=[-2,0,5]
+```
\ No newline at end of file
diff --git a/node_modules/mathjs/docs/expressions/customization.md b/node_modules/mathjs/docs/expressions/customization.md
new file mode 100644
index 0000000..20895b2
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/customization.md
@@ -0,0 +1,379 @@
+# Customization
+
+Besides parsing and evaluating expressions, the expression parser supports
+a number of features to customize processing and evaluation of expressions
+and outputting expressions.
+
+On this page:
+
+- [Function transforms](#function-transforms)
+- [Custom argument parsing](#custom-argument-parsing)
+- [Custom LaTeX handlers](#custom-latex-handlers)
+- [Custom HTML, LaTeX and string output](#custom-html-latex-and-string-output)
+- [Customize supported characters](#customize-supported-characters)
+
+## Function transforms
+
+It is possible to preprocess function arguments and post process a functions
+return value by writing a *transform* for the function. A transform is a
+function wrapping around a function to be transformed or completely replaces
+a function.
+
+For example, the functions for math.js use zero-based matrix indices (as is
+common in programing languages), but the expression parser uses one-based
+indices. To enable this, all functions dealing with indices have a transform,
+which changes input from one-based to zero-based, and transforms output (and
+error message) from zero-based to one-based.
+
+```js
+// using plain JavaScript, indices are zero-based:
+const a = [[1, 2], [3, 4]]       // a 2x2 matrix
+math.subset(a, math.index(0, 1)) // returns 2
+
+// using the expression parser, indices are transformed to one-based:
+const a = [[1, 2], [3, 4]] // a 2x2 matrix
+let scope = {
+  a: a
+}
+math.evaluate('subset(a, index(1, 2))', scope) // returns 2
+```
+
+To create a transform for a function, the transform function must be attached
+to the function as property `transform`:
+
+```js
+import { create, all } from 'mathjs'
+const math = create(all)
+
+// create a function
+function addIt(a, b) {
+  return a + b
+}
+
+// attach a transform function to the function addIt
+addIt.transform = function (a, b) {
+  console.log('input: a=' + a + ', b=' + b)
+  // we can manipulate input here before executing addIt
+
+  const res = addIt(a, b)
+
+  console.log('result: ' + res)
+  // we can manipulate result here before returning
+
+  return res
+}
+
+// import the function into math.js
+math.import({
+  addIt: addIt
+})
+
+// use the function via the expression parser
+console.log('Using expression parser:')
+console.log('2+4=' + math.evaluate('addIt(2, 4)'))
+// This will output:
+//
+//     input: a=2, b=4
+//     result: 6
+//     2+4=6
+
+// when used via plain JavaScript, the transform is not invoked
+console.log('')
+console.log('Using plain JavaScript:')
+console.log('2+4=' + math.addIt(2, 4))
+// This will output:
+//
+//     6
+```
+
+Functions with a transform must be imported in the `math` namespace, as they
+need to be processed at compile time. They are not supported when passed via a
+scope at evaluation time.
+
+
+## Custom argument parsing
+
+The expression parser of math.js has support for letting functions
+parse and evaluate arguments themselves, instead of calling them with
+evaluated arguments. This is useful for example when creating a function
+like `plot(f(x), x)` or `integrate(f(x), x, start, end)`, where some of the
+arguments need to be processed in a special way. In these cases, the expression
+`f(x)` will be evaluated repeatedly by the function, and `x` is not evaluated
+but used to specify the variable looping over the function `f(x)`.
+
+Functions having a property `rawArgs` with value `true` are treated in a special
+way by the expression parser: they will be invoked with unevaluated arguments,
+allowing the function to process the arguments in a customized way. Raw
+functions are called as:
+
+```
+rawFunction(args: Node[], math: Object, scope: Object)
+```
+
+Where :
+
+- `args` is an Array with nodes of the parsed arguments.
+- `math` is the math namespace against which the expression was compiled.
+- `scope` is a shallow _copy_ of the `scope` object provided when evaluating 
+  the expression, optionally extended with nested variables like a function 
+  parameter `x` of in a custom defined function like `f(x) = x^2`.
+
+Raw functions must be imported in the `math` namespace, as they need to be
+processed at compile time. They are not supported when passed via a scope
+at evaluation time.
+
+A simple example:
+
+```js
+function myFunction(args, math, scope) {
+  // get string representation of the arguments
+  const str = args.map(function (arg) {
+    return arg.toString()
+  })
+
+  // evaluate the arguments
+  const res = args.map(function (arg) {
+    return arg.compile().evaluate(scope)
+  })
+
+  return 'arguments: ' + str.join(',') + ', evaluated: ' + res.join(',')
+}
+
+// mark the function as "rawArgs", so it will be called with unevaluated arguments
+myFunction.rawArgs = true
+
+// import the new function in the math namespace
+math.import({
+  myFunction: myFunction
+})
+
+// use the function
+math.evaluate('myFunction(2 + 3, sqrt(4))')
+// returns 'arguments: 2 + 3, sqrt(4), evaluated: 5, 2'
+```
+
+## Custom LaTeX handlers
+
+You can attach a `toTex` property to your custom functions before importing them to define their LaTeX output. This
+`toTex` property can be a handler in the format described in the next section 'Custom LaTeX and String conversion'
+or a template string similar to ES6 templates.
+
+### Template syntax
+
+- `${name}`: Gets replaced by the name of the function
+- `${args}`: Gets replaced by a comma separated list of the arguments of the function.
+- `${args[0]}`: Gets replaced by the first argument of a function
+- `$$`: Gets replaced by `$`
+
+#### Example
+
+```js
+const customFunctions = {
+  plus: function (a, b) {
+    return a + b
+  },
+  minus: function (a, b) {
+    return a - b
+  },
+  binom: function (n, k) {
+    return 1
+  }
+}
+
+customFunctions.plus.toTex = '${args[0]}+${args[1]}' //template string
+customFunctions.binom.toTex = '\\mathrm{${name}}\\left(${args}\\right)' //template string
+customFunctions.minus.toTex = function (node, options) { //handler function
+  return node.args[0].toTex(options) + node.name + node.args[1].toTex(options)
+}
+
+math.import(customFunctions)
+
+math.parse('plus(1,2)').toTex()    // '1+2'
+math.parse('binom(1,2)').toTex()   // '\\mathrm{binom}\\left(1,2\\right)'
+math.parse('minus(1,2)').toTex()   // '1minus2'
+```
+
+## Custom HTML, LaTeX and string output
+
+All expression nodes have a method `toTex` and `toString` to output an expression respectively in HTML or LaTex format or as regular text .
+The functions `toHTML`, `toTex` and `toString` accept an `options` argument to customise output. This object is of the following form:
+
+```js
+{
+  parenthesis: 'keep',    // parenthesis option
+  handler: someHandler,   // handler to change the output
+  implicit: 'hide'        // how to treat implicit multiplication
+}
+```
+
+### Parenthesis
+
+The `parenthesis` option changes the way parentheses are used in the output. There are three options available:
+
+- `keep` Keep the parentheses from the input and display them as is. This is the default.
+- `auto` Only display parentheses that are necessary. Mathjs tries to get rid of as much parentheses as possible.
+- `all` Display all parentheses that are given by the structure of the node tree. This makes the output precedence unambiguous.
+
+There's two ways of passing callbacks:
+
+1. Pass an object that maps function names to callbacks. Those callbacks will be used for FunctionNodes with
+functions of that name.
+2. Pass a function to `toTex`. This function will then be used for every node.
+
+```js
+const expression = math.parse('(1+1+1)')
+
+expression.toString()                      // (1 + 1 + 1)
+expression.toString({parenthesis: 'keep'}) // (1 + 1 + 1)
+expression.toString({parenthesis: 'auto'}) // 1 + 1 + 1
+expression.toString({parenthesis: 'all'})  // (1 + 1) + 1
+```
+
+### Handler
+
+You can provide the `toTex` and `toString` functions of an expression with your own custom handlers that override the internal behaviour. This is especially useful to provide LaTeX/string output for your own custom functions. This can be done in two ways:
+
+1. Pass an object that maps function names to callbacks. Those callbacks will be used for FunctionNodes that contain functions with that name.
+2. Pass a callback directly. This callback will run for every node, so you can replace the output of anything you like.
+
+A callback function has the following form:
+
+```js
+function callback (node, options) {
+  ...
+}
+```
+Where `options` is the object passed to `toHTML`/`toTex`/`toString`. Don't forget to pass this on to the child nodes, and `node` is a reference to the current node.
+
+If a callback returns nothing, the standard output will be used. If your callback returns a string, this string will be used.
+
+**Although the following examples use `toTex`, it works for `toString` and `toHTML` in the same way**
+
+#### Examples for option 1
+
+```js
+const customFunctions = {
+  binomial: function (n, k) {
+    //calculate n choose k
+    // (do some stuff)
+    return result
+  }
+}
+
+const customLaTeX = {
+  'binomial': function (node, options) { //provide toTex for your own custom function
+    return '\\binom{' + node.args[0].toTex(options) + '}{' + node.args[1].toTex(options) + '}'
+  },
+  'factorial': function (node, options) { //override toTex for builtin functions
+  	return 'factorial\\left(' + node.args[0] + '\\right)'
+  }
+}
+```
+
+You can simply use your custom toTex functions by passing them to `toTex`:
+
+```js
+math.import(customFunctions)
+const expression = math.parse('binomial(factorial(2),1)')
+const latex = expression.toTex({handler: customLaTeX})
+// latex now contains "\binom{factorial\\left(2\\right)}{1}"
+```
+
+#### Examples for option 2:
+
+```js
+function customLaTeX(node, options) {
+  if ((node.type === 'OperatorNode') && (node.fn === 'add')) {
+    //don't forget to pass the options to the toTex functions
+    return node.args[0].toTex(options) + ' plus ' + node.args[1].toTex(options)
+  }
+  else if (node.type === 'ConstantNode') {
+    if (node.value === 0) {
+        return '\\mbox{zero}'
+    }
+    else if (node.value === 1) {
+        return '\\mbox{one}'
+    }
+    else if (node.value === 2) {
+        return '\\mbox{two}'
+    }
+    else {
+        return node.value
+    }
+  }
+}
+
+const expression = math.parse('1+2')
+const latex = expression.toTex({handler: customLaTeX})
+// latex now contains '\mbox{one} plus \mbox{two}'
+```
+
+Another example in conjunction with custom functions:
+
+```js
+const customFunctions = {
+  binomial: function (n, k) {
+    //calculate n choose k
+    // (do some stuff)
+    return result
+  }
+}
+
+function customLaTeX(node, options) {
+  if ((node.type === 'FunctionNode') && (node.name === 'binomial')) {
+      return '\\binom{' + node.args[0].toTex(options) + '}{' + node.args[1].toTex(options) + '}'
+  }
+}
+
+math.import(customFunctions)
+const expression = math.parse('binomial(2,1)')
+const latex = expression.toTex({handler: customLaTeX})
+// latex now contains "\binom{2}{1}"
+```
+
+### Implicit multiplication
+
+You can change the way that implicit multiplication is converted to a string or LaTeX. The two options are `hide`, to not show a multiplication operator for implicit multiplication and `show` to show it.
+
+Example:
+
+```js
+const node = math.parse('2a')
+
+node.toString()                   // '2 a'
+node.toString({implicit: 'hide'}) // '2 a'
+node.toString({implicit: 'show'}) // '2 * a'
+
+node.toTex()                      // '2~ a'
+node.toTex({implicit: 'hide'})    // '2~ a'
+node.toTex({implicit: 'show'})    // '2\\cdot a'
+```
+
+
+## Customize supported characters
+
+It is possible to customize the characters allowed in symbols and digits.
+The `parse` function exposes the following test functions:
+
+- `math.parse.isAlpha(c, cPrev, cNext)`
+- `math.parse.isWhitespace(c, nestingLevel)`
+- `math.parse.isDecimalMark(c, cNext)`
+- `math.parse.isDigitDot(c)`
+- `math.parse.isDigit(c)`
+
+The exact signature and implementation of these functions can be looked up in
+the [source code of the parser](https://github.com/josdejong/mathjs/blob/master/lib/expression/parse.js). The allowed alpha characters are described here: [Constants and variables](syntax.md#constants-and-variables).
+
+For example, the phone character <code>&#9742;</code> is not supported by default. It can be enabled
+by replacing the `isAlpha` function:
+
+```js
+const isAlphaOriginal = math.parse.isAlpha
+math.parse.isAlpha = function (c, cPrev, cNext) {
+  return isAlphaOriginal(c, cPrev, cNext) || (c === '\u260E')
+}
+
+// now we can use the \u260E (phone) character in expressions
+const result = math.evaluate('\u260Efoo', {'\u260Efoo': 42}) // returns 42
+console.log(result)
+```
diff --git a/node_modules/mathjs/docs/expressions/expression_trees.md b/node_modules/mathjs/docs/expressions/expression_trees.md
new file mode 100644
index 0000000..f2ce692
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/expression_trees.md
@@ -0,0 +1,700 @@
+# Expression trees
+
+When parsing an expression via `math.parse(expr)`, math.js generates an
+expression tree and returns the root node of the tree. An expression tree can
+be used to analyze, manipulate, and evaluate expressions.
+
+Example:
+
+```js
+const node = math.parse('sqrt(2 + x)')
+```
+
+In this case, the expression `sqrt(2 + x)` is parsed as:
+
+```
+  FunctionNode    sqrt
+                   |
+  OperatorNode     +
+                  / \
+  ConstantNode   2   x   SymbolNode
+```
+
+Alternatively, this expression tree can be build by manually creating nodes:
+
+```js
+const node1 = new math.ConstantNode(2)
+const node2 = new math.SymbolNode('x')
+const node3 = new math.OperatorNode('+', 'add', [node1, node2])
+const node4 = new math.FunctionNode('sqrt', [node3])
+```
+
+The resulting expression tree with root node `node4` is equal to the expression
+tree generated by `math.parse('sqrt(2 + x)')`.
+
+
+## API
+
+### Methods
+
+All nodes have the following methods:
+
+-   `clone() : Node`
+
+    Create a shallow clone of the node.
+    The node itself is cloned, its childs are not cloned.
+
+-   `cloneDeep() : Node`
+
+    Create a deep clone of the node.
+    Both the node as well as all its childs are cloned recursively.
+
+-   `compile() : Object`
+
+    Compile an expression into optimized JavaScript code. `compile` returns an
+    object with a function `evaluate([scope])` to evaluate. Example:
+
+    ```js
+    const node = math.parse('2 + x')   // returns the root Node of an expression tree
+    const code = node.compile()        // returns {evaluate: function (scope) {...}}
+    const evaluate = code.evaluate({x: 3}) // returns 5
+    ```
+
+-   `evaluate([scope]) : Object`
+
+    Compile and evaluate an expression, this is the equivalent of doing
+    `node.compile().evaluate(scope)`. Example:
+
+    ```js
+    const node = math.parse('2 + x')   // returns the root Node of an expression tree
+    const evaluate = node.evaluate({x: 3}) // returns 5
+    ```
+
+-   `equals(other: Node) : boolean`
+
+    Test whether this node equals an other node. Does a deep comparison of the
+    values of both nodes.
+
+-   `filter(callback: function) : Node[]`
+
+    Recursively filter nodes in an expression tree. The `callback` function is
+    called as `callback(node: Node, path: string, parent: Node) : boolean` for
+    every node in the tree, and must return a boolean. The function `filter`
+    returns an array with nodes for which the test returned true.
+    Parameter `path` is a string containing a relative JSON Path.
+
+    Example:
+
+    ```js
+    const node = math.parse('x^2 + x/4 + 3*y')
+    const filtered = node.filter(function (node) {
+      return node.isSymbolNode && node.name === 'x'
+    })
+    // returns an array with two entries: two SymbolNodes 'x'
+    ```
+
+-   `forEach(callback: function) : Node[]`
+
+    Execute a callback for each of the child nodes of this node. The `callback`
+    function is called as `callback(child: Node, path: string, parent: Node)`.
+    Parameter `path` is a string containing a relative JSON Path.
+
+    See also `traverse`, which is a recursive version of `forEach`.
+
+    Example:
+
+    ```js
+    const node = math.parse('3 * x + 2')
+    node.forEach(function (node, path, parent) {
+      switch (node.type) {
+        case 'OperatorNode':
+          console.log(node.type, node.op)
+          break
+        case 'ConstantNode':
+          console.log(node.type, node.value)
+          break
+        case 'SymbolNode':
+          console.log(node.type, node.name)
+          break
+        default:
+          console.log(node.type)
+      }
+    })
+    // outputs:
+    //   OperatorNode *
+    //   ConstantNode 2
+    ```
+
+-   `map(callback: function) : Node[]`
+
+    Transform a node. Creates a new Node having it's childs be the results of
+    calling the provided callback function for each of the childs of the original
+    node. The `callback` function is called as `callback(child: Node, path: string,
+    parent: Node)` and must return a Node. Parameter `path` is a string containing
+    a relative JSON Path.
+
+    See also `transform`, which is a recursive version of `map`.
+
+-	`toHTML(options: object): string`
+
+	Get a HTML representation of the parsed expression. Example:
+
+    ```js
+    const node = math.parse('sqrt(2/3)')
+    node.toHTML()
+	// returns
+	// <span class="math-function">sqrt</span>
+	// <span class="math-paranthesis math-round-parenthesis">(</span>
+	// <span class="math-number">2</span>
+	// <span class="math-operator math-binary-operator math-explicit-binary-operator">/</span>
+	// <span class="math-number">3</span>
+	// <span class="math-paranthesis math-round-parenthesis">)</span>
+    ```
+
+    Information about the available HTML classes in [HTML Classes](html_classes.md).
+    Information about the options in [Customization](customization.md#custom-html-latex-and-string-output).
+
+-   `toString(options: object) : string`
+
+    Get a string representation of the parsed expression. This is not exactly
+    the same as the original input. Example:
+
+    ```js
+    const node = math.parse('3+4*2')
+    node.toString()  // returns '3 + (4 * 2)'
+    ```
+
+    Information about the options in [Customization](customization.md#custom-html-latex-and-string-output).
+
+-   `toTex(options: object): string`
+
+    Get a [LaTeX](https://en.wikipedia.org/wiki/LaTeX) representation of the
+    expression. Example:
+
+    ```js
+    const node = math.parse('sqrt(2/3)')
+    node.toTex() // returns '\sqrt{\frac{2}{3}}'
+    ```
+
+    Information about the options in [Customization](customization.md#custom-html-latex-and-string-output).
+
+-   `transform(callback: function)`
+
+    Recursively transform an expression tree via a transform function. Similar
+    to `Array.map`, but recursively executed on all nodes in the expression tree.
+    The callback function is a mapping function accepting a node, and returning
+    a replacement for the node or the original node. Function `callback` is
+    called as `callback(node: Node, path: string, parent: Node)` for every node
+    in the tree, and must return a `Node`. Parameter `path` is a string containing
+    a relative JSON Path.
+
+    The transform function will stop iterating when a node is replaced by the
+    callback function, it will not iterate over replaced nodes.
+
+    For example, to replace all nodes of type `SymbolNode` having name 'x' with a
+    ConstantNode with value `3`:
+
+    ```js
+    const node = math.parse('x^2 + 5*x')
+    const transformed = node.transform(function (node, path, parent) {
+      if (node.isSymbolNode && node.name === 'x') {
+        return new math.ConstantNode(3)
+      }
+      else {
+        return node
+      }
+    })
+    transformed.toString() // returns '3 ^ 2 + 5 * 3'
+    ```
+
+-   `traverse(callback)`
+
+    Recursively traverse all nodes in a node tree. Executes given callback for
+    this node and each of its child nodes. Similar to `Array.forEach`, except
+    recursive.
+    The callback function is a mapping function accepting a node, and returning
+    a replacement for the node or the original node. Function `callback` is
+    called as `callback(node: Node, path: string, parent: Node)` for every node
+    in the tree. Parameter `path` is a string containing a relative JSON Path.
+    Example:
+
+    ```js
+    const node = math.parse('3 * x + 2')
+    node.traverse(function (node, path, parent) {
+      switch (node.type) {
+        case 'OperatorNode':
+          console.log(node.type, node.op)
+          break
+        case 'ConstantNode':
+          console.log(node.type, node.value)
+          break
+        case 'SymbolNode':
+          console.log(node.type, node.name)
+          break
+        default:
+          console.log(node.type)
+      }
+    })
+    // outputs:
+    //   OperatorNode +
+    //   OperatorNode *
+    //   ConstantNode 3
+    //   SymbolNode x
+    //   ConstantNode 2
+    ```
+
+
+### Properties
+
+Each `Node` has the following properties:
+
+-   `comment: string`
+
+    A string holding a comment if there was any in the expression, or else the
+    string will be empty string. A comment can be attached to the root node of
+    an expression or to each of the childs nodes of a `BlockNode`.
+
+-   `isNode: true`
+
+    Is defined with value `true` on Nodes. Additionally, each type of node
+    adds it's own flag, for example a `SymbolNode` as has a property
+    `isSymbolNode: true`.
+
+-   `type: string`
+
+    The type of the node, for example `'SymbolNode'` in case of a `SymbolNode`.
+
+
+## Nodes
+
+math.js has the following types of nodes. All nodes are available at the
+namespace `math`.
+
+
+### AccessorNode
+
+Construction:
+
+```
+new AccessorNode(object: Node, index: IndexNode)
+```
+
+Properties:
+
+- `object: Node`
+- `index: IndexNode`
+- `name: string` (read-only) The function or method name. Returns an empty string when undefined.
+
+Examples:
+
+```js
+const node1 = math.parse('a[3]')
+
+const object = new math.SymbolNode('a')
+const index = new math.IndexNode([3])
+const node2 = new math.AccessorNode(object, index)
+```
+
+
+### ArrayNode
+
+Construction:
+
+```
+new ArrayNode(items: Node[])
+```
+
+Properties:
+
+- `items: Node[]`
+
+Examples:
+
+```js
+const node1 = math.parse('[1, 2, 3]')
+
+const one    = new math.ConstantNode(1)
+const two    = new math.ConstantNode(2)
+const three  = new math.ConstantNode(3)
+const node2  = new math.ArrayNode([one, two, three])
+```
+
+
+### AssignmentNode
+
+Construction:
+
+```
+new AssignmentNode(object: SymbolNode, value: Node)
+new AssignmentNode(object: SymbolNode | AccessorNode, index: IndexNode, value: Node)
+```
+
+Properties:
+
+- `object: SymbolNode | AccessorNode`
+- `index: IndexNode | null`
+- `value: Node`
+- `name: string` (read-only) The function or method name. Returns an empty string when undefined.
+
+Examples:
+
+```js
+const node1 = math.parse('a = 3')
+
+const object = new math.SymbolNode('a')
+const value = new math.ConstantNode(3)
+const node2 = new math.AssignmentNode(object, value)
+```
+
+
+### BlockNode
+
+A `BlockNode` is created when parsing a multi line expression like `a=2;b=3` or
+`a=2\nb=3`. Evaluating a `BlockNode` returns a `ResultSet`. The results can be
+retrieved via `ResultSet.entries` or `ResultSet.valueOf()`, which contains
+an `Array` with the results of the visible lines (i.e. lines not ending with
+a semicolon).
+
+Construction:
+
+```
+block = new BlockNode(Array.<{node: Node} | {node: Node, visible: boolean}>)
+```
+
+Properties:
+
+- `blocks: Array.<{node: Node, visible: boolean}>`
+
+Examples:
+
+```js
+const block1 = math.parse('a=1; b=2; c=3')
+
+const a = new math.SymbolNode('a')
+const one = new math.ConstantNode(1)
+const ass1 = new math.AssignmentNode(a, one)
+
+const b = new math.SymbolNode('b')
+const two = new math.ConstantNode(2)
+const ass2 = new math.AssignmentNode(b, two)
+
+const c = new math.SymbolNode('c')
+const three = new math.ConstantNode(3)
+const ass3 = new math.AssignmentNode(c, three)
+
+const block2 = new BlockNode([
+  {node: ass1, visible: false},
+  {node: ass2, visible: false},
+  {node: ass3, visible: true}
+])
+```
+
+
+### ConditionalNode
+
+Construction:
+
+```
+new ConditionalNode(condition: Node, trueExpr: Node, falseExpr: Node)
+```
+
+Properties:
+
+- `condition: Node`
+- `trueExpr: Node`
+- `falseExpr: Node`
+
+Examples:
+
+```js
+const node1 = math.parse('a > 0 ? a : -a')
+
+const a         = new math.SymbolNode('a')
+const zero      = new math.ConstantNode(0)
+const condition = new math.OperatorNode('>', 'larger', [a, zero])
+const trueExpr  = a
+const falseExpr = new math.OperatorNode('-', 'unaryMinus', [a])
+const node2     = new math.ConditionalNode(condition, trueExpr, falseExpr)
+```
+
+### ConstantNode
+
+Construction:
+
+```
+new ConstantNode(value: *)
+```
+
+Properties:
+
+- `value: *`
+
+Examples:
+
+```js
+const node1 = math.parse('2.4')
+
+const node2 = new math.ConstantNode(2.4)
+const node3 = new math.ConstantNode('foo')
+```
+
+
+### FunctionAssignmentNode
+
+Construction:
+
+```
+new FunctionAssignmentNode(name: string, params: string[], expr: Node)
+```
+
+Properties:
+
+- `name: string`
+- `params: string[]`
+- `expr: Node`
+
+Examples:
+
+```js
+const node1 = math.parse('f(x) = x^2')
+
+const x      = new math.SymbolNode('x')
+const two    = new math.ConstantNode(2)
+const expr   = new math.OperatorNode('^', 'pow', [x, 2])
+const node2  = new math.FunctionAssignmentNode('f', ['x'], expr)
+```
+
+
+### FunctionNode
+
+Construction:
+
+```
+new FunctionNode(fn: Node | string, args: Node[])
+```
+
+Properties:
+
+- `fn: Node | string` (read-only) The object or function name which to invoke.
+- `args: Node[]`
+
+Examples:
+
+```js
+const node1 = math.parse('sqrt(4)')
+
+const four  = new math.ConstantNode(4)
+const node3 = new math.FunctionNode(new SymbolNode('sqrt'), [four])
+```
+
+
+### IndexNode
+
+Construction:
+
+```
+new IndexNode(dimensions: Node[])
+new IndexNode(dimensions: Node[], dotNotation: boolean)
+```
+
+Each dimension can be a single value, a range, or a property. The values of
+indices are one-based, including range end.
+
+An optional property `dotNotation` can be provided describing whether this index
+was written using dot notation like `a.b`, or using bracket notation
+like `a["b"]`. Default value is `false`. This information is used when
+stringifying the IndexNode.
+
+Properties:
+
+- `dimensions: Node[]`
+- `dotNotation: boolean`
+
+Examples:
+
+```js
+const node1 = math.parse('A[1:3, 2]')
+
+const A     = new math.SymbolNode('A')
+const one   = new math.ConstantNode(1)
+const two   = new math.ConstantNode(2)
+const three = new math.ConstantNode(3)
+
+const range = new math.RangeNode(one, three)
+const index = new math.IndexNode([range, two])
+const node2 = new math.AccessNode(A, index)
+```
+
+### ObjectNode
+
+Construction:
+
+```
+new ObjectNode(properties: Object.<string, Node>)
+```
+
+Properties:
+
+- `properties: Object.<string, Node>`
+
+Examples:
+
+```js
+const node1 = math.parse('{a: 1, b: 2, c: 3}')
+
+const a = new math.ConstantNode(1)
+const b = new math.ConstantNode(2)
+const c = new math.ConstantNode(3)
+const node2 = new math.ObjectNode({a: a, b: b, c: c})
+```
+
+
+### OperatorNode
+
+Construction:
+
+```
+new OperatorNode(op: string, fn: string, args: Node[], implicit: boolean = false)
+```
+
+Additional methods:
+
+-   `isUnary() : boolean`
+
+    Returns true when the `OperatorNode` contains exactly one argument,
+    like with a unary minus:
+
+    ```js
+    const a = new math.ConstantNode(2)
+    const b = new math.OperatorNode('-', 'unaryMinus', [a])
+    b.isUnary() // true
+    ```
+
+-   `isBinary() : boolean`
+
+    Returns true when the `OperatorNode` contains exactly two arguments,
+    like with most regular operators:
+
+    ```js
+    const a = new math.ConstantNode(2)
+    const b = new math.ConstantNode(3)
+    const c = new math.OperatorNode('+', 'add', [a, b])
+    c.isBinary() // true
+    ```
+
+Properties:
+
+- `op: string`
+- `fn: string`
+- `args: Node[]`
+- `implicit: boolean` True in case of an implicit multiplication, false otherwise
+
+Examples:
+
+```js
+const node1 = math.parse('2.3 + 5')
+
+const a     = new math.ConstantNode(2.3)
+const b     = new math.ConstantNode(5)
+const node2 = new math.OperatorNode('+', 'add', [a, b])
+```
+
+### ParenthesisNode
+
+Construction:
+
+```
+new ParenthesisNode(content: Node)
+```
+
+Properties:
+
+- `content: Node`
+
+Examples:
+
+```js
+const node1 = math.parse('(1)')
+
+const a     = new math.ConstantNode(1)
+const node2 = new math.ParenthesisNode(a)
+```
+
+### RangeNode
+
+Construction:
+
+```
+new RangeNode(start: Node, end: Node [, step: Node])
+```
+
+Properties:
+
+- `start: Node`
+- `end: Node`
+- `step: Node | null`
+
+Examples:
+
+```js
+const node1 = math.parse('1:10')
+const node2 = math.parse('0:2:10')
+
+const zero = new math.ConstantNode(0)
+const one = new math.ConstantNode(1)
+const two = new math.ConstantNode(2)
+const ten = new math.ConstantNode(10)
+
+const node3 = new math.RangeNode(one, ten)
+const node4 = new math.RangeNode(zero, ten, two)
+```
+
+### RelationalNode
+
+Construction:
+
+```
+new RelationalNode(conditionals: string[], params: Node[])
+```
+
+`conditionals` is an array of strings, each of which may be 'smaller', 'larger', 'smallerEq', 'largerEq', 'equal', or 'unequal'. The `conditionals` array must contain exactly one fewer item than `params`.
+
+Properties:
+
+- `conditionals: string[]`
+- `params: Node[]`
+
+A `RelationalNode` efficiently represents a chained conditional expression with two or more comparison operators, such as `10 < x <= 50`. The expression is equivalent to `10 < x and x <= 50`, except that `x` is evaluated only once, and evaluation stops (is "short-circuited") once any condition tests false. Operators that are subject to chaining are `<`, `>`, `<=`, `>=`, `==`, and `!=`. For backward compatibility, `math.parse` will return an `OperatorNode` if only a single conditional is present (such as `x > 2`).
+
+Examples:
+
+```js
+
+const ten = new math.ConstantNode(10)
+const x = new math.SymbolNode('x')
+const fifty = new math.ConstantNode(50)
+
+const node1 = new math.RelationalNode(['smaller', 'smallerEq'], [ten, x, fifty])
+const node2 = math.parse('10 < x <= 50')
+```
+
+
+### SymbolNode
+
+Construction:
+
+```
+new SymbolNode(name: string)
+```
+
+Properties:
+
+- `name: string`
+
+Examples:
+
+```js
+const node = math.parse('x')
+
+const x = new math.SymbolNode('x')
+```
diff --git a/node_modules/mathjs/docs/expressions/html_classes.md b/node_modules/mathjs/docs/expressions/html_classes.md
new file mode 100644
index 0000000..8922765
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/html_classes.md
@@ -0,0 +1,38 @@
+# HTML output
+
+The expression parser can output a HTML string, where every `Node` is
+transformed into a `<span>` element with semantic class names. Each class
+name begins with the `math-` prefix. These class names can be used in CSS to
+highlight the syntax or change the default layout (e.g. spaces around operators).
+
+## Available class names
+
+- `math-number`
+- `math-string`
+- `math-boolean` (`true` and `false`)
+- `math-undefined`
+- `math-function` (function names)
+- `math-parameter` (function parameters)
+- `math-property` (object members)
+- `math-symbol` (variables, units and built-in constants)
+  - `math-null-symbol` (`null`)
+  - `math-nan-symbol` (`NaN`)
+  - `math-infinity-symbol` (`Infinity`)
+  - `math-imaginary-symbol` (`i`)
+- `math-operator`
+  - `math-unary-operator`
+    - `math-lefthand-unary-operator`
+    - `math-righthand-unary-operator`
+  - `math-binary-operator`
+    - `math-explicit-binary-operator`
+    - `math-implicit-binary-operator` (empty element)
+  - `math-assignment-operator`
+    - `math-variable-assignment-operator` (`=`)
+    - `math-property-assignment-operator` (`:` in objects)
+  - `math-accessor-operator` (`.` in objects)
+  - `math-range-operator` (`:` in ranges)
+- `math-parenthesis`
+  -`math-round-parenthesis` (`(` and `)`)
+  -`math-square-parenthesis` (`[` and `]`)
+  -`math-curly-parenthesis` (`{` and `}`)
+- `math-separator` (�,`, `;` and <code>&lt;br /&gt;</code>)
\ No newline at end of file
diff --git a/node_modules/mathjs/docs/expressions/index.md b/node_modules/mathjs/docs/expressions/index.md
new file mode 100644
index 0000000..6bc6c03
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/index.md
@@ -0,0 +1,21 @@
+# Expressions
+
+Math.js contains a flexible and easy to use expression parser.
+The parser supports all data types, functions and constants available in math.js.
+
+Whilst the math.js library is aimed at JavaScript developers, the expression
+parser is aimed at end users: mathematicians, engineers, students, pupils.
+The syntax of the expression parser differs from JavaScript and the low-level
+math.js library.
+
+This section is divided in the following pages:
+
+- [Parsing and evaluation](parsing.md) describes how to parse and
+  evaluate expressions with math.js.
+- [Syntax](syntax.md) describes how to write expressions.
+- [Expression trees](expression_trees.md) explains how to parse an expression into an
+  expression tree, and use this to analyse and manipulate the expression.
+- [Algebra](algebra.md) describing symbolic computation in math.js.
+- [Customization](customization.md) describes how to customize processing and
+  evaluation of expressions.
+- [Security](security.md) about security risks of executing arbitrary expressions.
diff --git a/node_modules/mathjs/docs/expressions/parsing.md b/node_modules/mathjs/docs/expressions/parsing.md
new file mode 100644
index 0000000..50fe6c7
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/parsing.md
@@ -0,0 +1,224 @@
+# Expression parsing and evaluation
+
+Expressions can be parsed and evaluated in various ways:
+
+- Using the function [`math.evaluate(expr [,scope])`](#evaluate).
+- Using the function [`math.compile(expr)`](#compile).
+- Using the function [`math.parse(expr)`](#parse).
+- By creating a [parser](#parser), `math.parser()`, which contains a method
+  `evaluate` and keeps a scope with assigned variables in memory.
+
+
+## Evaluate
+
+Math.js comes with a function `math.evaluate` to evaluate expressions. Syntax:
+
+```js
+math.evaluate(expr)
+math.evaluate(expr, scope)
+math.evaluate([expr1, expr2, expr3, ...])
+math.evaluate([expr1, expr2, expr3, ...], scope)
+```
+
+Function `evaluate` accepts a single expression or an array with
+expressions as the first argument and has an optional second argument
+containing a scope with variables and functions. The scope can be a regular
+JavaScript Object, or Map. The scope will be used to resolve symbols, and to write
+assigned variables or function.
+
+The following code demonstrates how to evaluate expressions.
+
+```js
+// evaluate expressions
+math.evaluate('sqrt(3^2 + 4^2)')        // 5
+math.evaluate('sqrt(-4)')               // 2i
+math.evaluate('2 inch to cm')           // 5.08 cm
+math.evaluate('cos(45 deg)')            // 0.7071067811865476
+
+// provide a scope
+let scope = {
+    a: 3,
+    b: 4
+}
+math.evaluate('a * b', scope)           // 12
+math.evaluate('c = 2.3 + 4.5', scope)   // 6.8
+scope.c                                 // 6.8
+```
+
+
+## Compile
+
+Math.js contains a function `math.compile` which compiles expressions
+into JavaScript code. This is a shortcut for first [parsing](#parse) and then
+compiling an expression. The syntax is:
+
+```js
+math.compile(expr)
+math.compile([expr1, expr2, expr3, ...])
+```
+
+Function `compile` accepts a single expression or an array with
+expressions as the argument. Function `compile` returns an object with a function
+`evaluate([scope])`, which can be executed to evaluate the expression against an
+(optional) scope:
+
+```js
+const code = math.compile(expr)       // compile an expression
+const result = code.evaluate([scope]) // evaluate the code with an optional scope
+```
+
+An expression needs to be compiled only once, after which the
+expression can be evaluated repeatedly and against different scopes.
+The optional scope is used to resolve symbols and to write assigned
+variables or functions. Parameter [`scope`](#scope) can be a regular Object, or Map.
+
+Example usage:
+
+```js
+// parse an expression into a node, and evaluate the node
+const code1 = math.compile('sqrt(3^2 + 4^2)')
+code1.evaluate()  // 5
+```
+
+
+## Parse
+
+Math.js contains a function `math.parse` to parse expressions into an
+[expression tree](expression_trees.md). The syntax is:
+
+```js
+math.parse(expr)
+math.parse([expr1, expr2, expr3, ...])
+```
+
+Function `parse` accepts a single expression or an array with
+expressions as the argument. Function `parse` returns a the root node of the tree,
+which can be successively compiled and evaluated:
+
+```js
+const node = math.parse(expr)         // parse expression into a node tree
+const code = node.compile()           // compile the node tree
+const result = code.evaluate([scope]) // evaluate the code with an optional scope
+```
+
+The API of nodes is described in detail on the page
+[Expression trees](expression_trees.md).
+
+An expression needs to be parsed and compiled only once, after which the
+expression can be evaluated repeatedly. On evaluation, an optional scope
+can be provided, which is used to resolve symbols and to write assigned
+variables or functions. Parameter [`scope`](#scope) is a regular Object or Map.
+
+Example usage:
+
+```js
+// parse an expression into a node, and evaluate the node
+const node1 = math.parse('sqrt(3^2 + 4^2)')
+const code1 = node1.compile()
+code1.evaluate() // 5
+
+// provide a scope
+const node2 = math.parse('x^a')
+const code2 = node2.compile()
+let scope = {
+    x: 3,
+    a: 2
+}
+code2.evaluate(scope) // 9
+
+// change a value in the scope and re-evaluate the node
+scope.a = 3
+code2.evaluate(scope) // 27
+```
+
+Parsed expressions can be exported to text using `node.toString()`, and can
+be exported to LaTeX using `node.toTex()`. The LaTeX export can be used to
+pretty print an expression in the browser with a library like
+[MathJax](https://www.mathjax.org/). Example usage:
+
+```js
+// parse an expression
+const node = math.parse('sqrt(x/x+1)')
+node.toString()   // returns 'sqrt((x / x) + 1)'
+node.toTex()      // returns '\sqrt{ {\frac{x}{x} }+{1} }'
+```
+
+
+## Parser
+
+In addition to the static functions [`math.evaluate`](#evaluate) and
+[`math.parse`](#parse), math.js contains a parser with functions `evaluate` and
+`parse`, which automatically keeps a scope with assigned variables in memory.
+The parser also contains some convenience functions to get, set, and remove
+variables from memory.
+
+A parser can be created by:
+
+```js
+const parser = math.parser()
+```
+
+The parser contains the following functions:
+
+- `clear()`
+  Completely clear the parser's scope.
+- `evaluate(expr)`
+  Evaluate an expression. Returns the result of the expression.
+- `get(name)`
+  Retrieve a variable or function from the parser's scope.
+- `getAll()`
+  Retrieve a map with all defined a variables from the parser's scope.
+- `remove(name)`
+  Remove a variable or function from the parser's scope.
+- `set(name, value)`
+  Set a variable or function in the parser's scope.
+
+The following code shows how to create and use a parser.
+
+```js
+// create a parser
+const parser = math.parser()
+
+// evaluate expressions
+parser.evaluate('sqrt(3^2 + 4^2)')      // 5
+parser.evaluate('sqrt(-4)')             // 2i
+parser.evaluate('2 inch to cm')         // 5.08 cm
+parser.evaluate('cos(45 deg)')          // 0.7071067811865476
+
+// define variables and functions
+parser.evaluate('x = 7 / 2')            // 3.5
+parser.evaluate('x + 3')                // 6.5
+parser.evaluate('f(x, y) = x^y')        // f(x, y)
+parser.evaluate('f(2, 3)')              // 8
+
+// get and set variables and functions
+const x = parser.get('x')               // x = 7
+const f = parser.get('f')               // function
+const g = f(3, 3)                       // g = 27
+parser.set('h', 500)
+parser.evaluate('h / 2')                // 250
+parser.set('hello', function (name) {
+    return 'hello, ' + name + '!'
+})
+parser.evaluate('hello("user")')        // "hello, user!"
+
+// clear defined functions and variables
+parser.clear()
+```
+
+## Scope
+
+The scope is a data-structure used to store and lookup variables and functions defined and used by expressions.
+
+It is passed to mathjs via calls to [`math.evaluate`](#evaluate) or `simplify`.
+
+For ease of use, it can be a Plain Javascript Object; for safety it can be a plain `Map` and for flexibility, any object that has
+the methods `get`/`set`/`has`/`keys`, seen on `Map`.
+
+Some care is taken to mutate the same object that is passed into mathjs, so they can collect the definitions from mathjs scripts and expressions.
+
+`evaluate` will fail if the expression uses a blacklisted symbol, preventing mathjs expressions to escape into Javascript. This is enforced by access to the scope.
+
+For less reliance on this blacklist, scope can also be a `Map`, which allows mathjs expressions to define variables and functions of any name.
+
+For more, see [examples of custom scopes](../../examples/advanced/custom_scope_objects.js).
diff --git a/node_modules/mathjs/docs/expressions/security.md b/node_modules/mathjs/docs/expressions/security.md
new file mode 100644
index 0000000..a25668e
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/security.md
@@ -0,0 +1,89 @@
+# Security
+
+Executing arbitrary expressions like enabled by the expression parser of
+mathjs involves a risk in general. When you're using mathjs to let users
+execute arbitrary expressions, it's good to take a moment to think about
+possible security and stability implications, especially when running
+the code server side.
+
+## Security risks
+
+A user could try to inject malicious JavaScript code via the expression
+parser. The expression parser of mathjs offers a sandboxed environment
+to execute expressions which should make this impossible. It's possible
+though that there are unknown security vulnerabilities, so it's important
+to be careful, especially when allowing server side execution of
+arbitrary expressions.
+
+The expression parser of mathjs parses the input in a controlled
+way into an expression tree or abstract syntax tree (AST).
+In a "compile" step, it does as much as possible preprocessing on the
+static parts of the expression, and creates a fast performing function
+which can be used to evaluate the expression repeatedly using a
+dynamically passed scope.
+
+The parser actively prevents access to JavaScripts internal `eval` and
+`new Function` which are the main cause of security attacks. Mathjs
+versions 4 and newer does not use JavaScript's `eval` under the hood.
+Version 3 and older did use `eval` for the compile step. This is not
+directly a security issue but results in a larger possible attack surface.
+
+When running a node.js server, it's good to be aware of the different
+types of security risks. The risk whe running inside a browser may be
+limited though it's good to be aware of [Cross side scripting (XSS)](https://www.wikiwand.com/en/Cross-site_scripting) vulnerabilities. A nice overview of
+security risks of a node.js servers is listed in an article [Node.js security checklist](https://blog.risingstack.com/node-js-security-checklist/) by Gergely Nemeth.
+
+### Less vulnerable expression parser
+
+There is a small number of functions which yield the biggest security
+risk in the expression parser:
+
+- `import` and `createUnit` which alter the built-in functionality and
+  allow overriding existing functions and units.
+- `evaluate`, `parse`, `simplify`, and `derivative` which parse arbitrary
+  input into a manipulable expression tree.
+
+To make the expression parser less vulnerable whilst still supporting
+most functionality, these functions can be disabled:
+
+```js
+import { create, all } from 'mathjs'
+
+const math = create(all)
+const limitedEvaluate = math.evaluate
+
+math.import({
+  'import':     function () { throw new Error('Function import is disabled') },
+  'createUnit': function () { throw new Error('Function createUnit is disabled') },
+  'evaluate':   function () { throw new Error('Function evaluate is disabled') },
+  'parse':      function () { throw new Error('Function parse is disabled') },
+  'simplify':   function () { throw new Error('Function simplify is disabled') },
+  'derivative': function () { throw new Error('Function derivative is disabled') }
+}, { override: true })
+
+console.log(limitedEvaluate('sqrt(16)'))     // Ok, 4
+console.log(limitedEvaluate('parse("2+3")')) // Error: Function parse is disabled
+```
+
+
+### Found a security vulnerability? Please report in private!
+
+You found a security vulnerability? Awesome! We hope you don't have bad
+intentions and want to help fix the issue. Please report the
+vulnerability in a private way by contacting one of the maintainers
+via mail or an other private channel. That way we can work together
+on a fix before sharing the issue with everybody including the bad guys.
+
+## Stability risks
+
+A user could accidentally or on purpose execute a
+heavy expression like creating a huge matrix. That can let the
+JavaScript engine run out of memory or freeze it when the CPU goes
+to 100% for a long time.
+
+To protect against this sort of issue, one can run the expression parser
+in a separate Web Worker or child_process, so it can't affect the
+main process. The workers can be killed when it runs for too
+long or consumes too much memory. A useful library in this regard
+is [workerpool](https://github.com/josdejong/workerpool), which makes
+it easy to manage a pool of workers in both browser and node.js.
diff --git a/node_modules/mathjs/docs/expressions/syntax.md b/node_modules/mathjs/docs/expressions/syntax.md
new file mode 100644
index 0000000..34487b9
--- /dev/null
+++ b/node_modules/mathjs/docs/expressions/syntax.md
@@ -0,0 +1,703 @@
+# Expression syntax
+
+This page describes the syntax of expression parser of math.js. It describes
+how to work with the available data types, functions, operators, variables,
+and more.
+
+## Differences from JavaScript
+
+The expression parser of math.js is aimed at a mathematical audience,
+not a programming audience. The syntax is similar to most calculators and
+mathematical applications. This is close to JavaScript as well, though there
+are a few important differences between the syntax of the expression parser and
+the lower level syntax of math.js. Differences are:
+
+- No need to prefix functions and constants with the `math.*` namespace,
+  you can just enter `sin(pi / 4)`.
+- Matrix indexes are one-based instead of zero-based.
+- There are index and range operators which allow more conveniently getting
+  and setting matrix indexes, like `A[2:4, 1]`.
+- Both indexes and ranges and have the upper-bound included.
+- There is a differing syntax for defining functions. Example: `f(x) = x^2`.
+- There are custom operators like `x + y` instead of `add(x, y)`.
+- Some operators are different. For example  `^` is used for exponentiation,
+  not bitwise xor.
+- Implicit multiplication, like `2 pi`, is supported and has special rules.
+- Relational operators (`<`, `>`, `<=`, `>=`, `==`, and `!=`) are chained, so the expression `5 < x < 10` is equivalent to `5 < x and x < 10`.
+- Multi-expression constructs like `a = 1; b = 2; a + b` or
+  `"a = 1;\n cos(a)\n sin(a)"` (where `\n` denotes newline)
+  produce a collection ("ResultSet") of values. Those expressions
+  terminated by `;` are evaluated for side effect only and their values
+  are suppressed from the result.
+
+## Operators
+
+The expression parser has operators for all common arithmetic operations such
+as addition and multiplication. The expression parser uses conventional infix
+notation for operators: an operator is placed between its arguments.
+Round parentheses can be used to override the default precedence of operators.
+
+```js
+// use operators
+math.evaluate('2 + 3')       // 5
+math.evaluate('2 * 3')       // 6
+
+// use parentheses to override the default precedence
+math.evaluate('2 + 3 * 4')   // 14
+math.evaluate('(2 + 3) * 4') // 20
+```
+
+The following operators are available:
+
+Operator    | Name                       | Syntax      | Associativity | Example               | Result
+----------- | -------------------------- | ----------  | ------------- | --------------------- | ---------------
+`(`, `)`    | Grouping                   | `(x)`       | None          | `2 * (3 + 4)`         | `14`
+`[`, `]`    | Matrix, Index              | `[...]`     | None          | `[[1,2],[3,4]]`       | `[[1,2],[3,4]]`
+`{`, `}`    | Object                     | `{...}`     | None          | `{a: 1, b: 2}`        | `{a: 1, b: 2}`
+`,`         | Parameter separator        | `x, y`      | Left to right | `max(2, 1, 5)`        | `5`
+`.`         | Property accessor          | `obj.prop`  | Left to right | `obj={a: 12}; obj.a`  | `12`
+`;`         | Statement separator        | `x; y`      | Left to right | `a=2; b=3; a*b`       | `[6]`
+`;`         | Row separator              | `[x; y]`    | Left to right | `[1,2;3,4]`           | `[[1,2],[3,4]]`
+`\n`        | Statement separator        | `x \n y`    | Left to right | `a=2 \n b=3 \n a*b`   | `[2,3,6]`
+`+`         | Add                        | `x + y`     | Left to right | `4 + 5`               | `9`
+`+`         | Unary plus                 | `+y`        | Right to left | `+4`                  | `4`
+`-`         | Subtract                   | `x - y`     | Left to right | `7 - 3`               | `4`
+`-`         | Unary minus                | `-y`        | Right to left | `-4`                  | `-4`
+`*`         | Multiply                   | `x * y`     | Left to right | `2 * 3`               | `6`
+`.*`        | Element-wise multiply      | `x .* y`    | Left to right | `[1,2,3] .* [1,2,3]`  | `[1,4,9]`
+`/`         | Divide                     | `x / y`     | Left to right | `6 / 2`               | `3`
+`./`        | Element-wise divide        | `x ./ y`    | Left to right | `[9,6,4] ./ [3,2,2]`  | `[3,3,2]`
+`%`         | Percentage                 | `x%`        | None          | `8%`                  | `0.08`
+`%`         | Addition with Percentage   | `x + y%`    | Left to right | `100 + 3%`            | `103`
+`%`         | Subtraction with Percentage| `x - y%`    | Left to right | `100 - 3%`            | `97`
+`%` `mod`   | Modulus                    | `x % y`     | Left to right | `8 % 3`               | `2`
+`^`         | Power                      | `x ^ y`     | Right to left | `2 ^ 3`               | `8`
+`.^`        | Element-wise power         | `x .^ y`    | Right to left | `[2,3] .^ [3,3]`      | `[8,27]`
+`'`         | Transpose                  | `y'`        | Left to right | `[[1,2],[3,4]]'`      | `[[1,3],[2,4]]`
+`!`         | Factorial                  | `y!`        | Left to right | `5!`                  | `120`
+`&`         | Bitwise and                | `x & y`     | Left to right | `5 & 3`               | `1`
+`~`         | Bitwise not                | `~x`        | Right to left | `~2`                  | `-3`
+<code>&#124;</code>  | Bitwise or     | <code>x &#124; y</code>   | Left to right | <code>5 &#124; 3</code>  | `7`
+<code>^&#124;</code> | Bitwise xor    | <code>x ^&#124; y</code>  | Left to right | <code>5 ^&#124; 2</code> | `7`
+`<<`        | Left shift                 | `x << y`    | Left to right | `4 << 1`              | `8`
+`>>`        | Right arithmetic shift     | `x >> y`    | Left to right | `8 >> 1`              | `4`
+`>>>`       | Right logical shift        | `x >>> y`   | Left to right | `-8 >>> 1`            | `2147483644`
+`and`       | Logical and                | `x and y`   | Left to right | `true and false`      | `false`
+`not`       | Logical not                | `not y`     | Right to left | `not true`            | `false`
+`or`        | Logical or                 | `x or y`    | Left to right | `true or false`       | `true`
+`xor`       | Logical xor                | `x xor y`   | Left to right | `true xor true`       | `false`
+`=`         | Assignment                 | `x = y`     | Right to left | `a = 5`               | `5`
+`?` `:`     | Conditional expression     | `x ? y : z` | Right to left | `15 > 100 ? 1 : -1`   | `-1`
+`:`         | Range                      | `x : y`     | Right to left | `1:4`                 | `[1,2,3,4]`
+`to`, `in`  | Unit conversion            | `x to y`    | Left to right | `2 inch to cm`        | `5.08 cm`
+`==`        | Equal                      | `x == y`    | Left to right | `2 == 4 - 2`          | `true`
+`!=`        | Unequal                    | `x != y`    | Left to right | `2 != 3`              | `true`
+`<`         | Smaller                    | `x < y`     | Left to right | `2 < 3`               | `true`
+`>`         | Larger                     | `x > y`     | Left to right | `2 > 3`               | `false`
+`<=`        | Smallereq                  | `x <= y`    | Left to right | `4 <= 3`              | `false`
+`>=`        | Largereq                   | `x >= y`    | Left to right | `2 + 4 >= 6`          | `true`
+
+
+## Precedence
+
+The operators have the following precedence, from highest to lowest:
+
+Operators                         | Description
+--------------------------------- | --------------------
+`(...)`<br>`[...]`<br>`{...}`     | Grouping<br>Matrix<br>Object
+`x(...)`<br>`x[...]`<br>`obj.prop`<br>`:`| Function call<br>Matrix index<br>Property accessor<br>Key/value separator
+`'`                               | Matrix transpose
+`!`                               | Factorial
+`^`, `.^`                         | Exponentiation
+`+`, `-`, `~`, `not`              | Unary plus, unary minus, bitwise not, logical not
+See section below                 | Implicit multiplication
+`*`, `/`, `.*`, `./`, `%`, `mod`  | Multiply, divide, percentage, modulus
+`+`, `-`                          | Add, subtract
+`:`                               | Range
+`to`, `in`                        | Unit conversion
+`<<`, `>>`, `>>>`                 | Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift
+`==`, `!=`, `<`, `>`, `<=`, `>=`  | Relational
+`&`                               | Bitwise and
+<code>^&#124;</code>              | Bitwise xor
+<code>&#124;</code>               | Bitwise or
+`and`                             | Logical and
+`xor`                             | Logical xor
+`or`                              | Logical or
+`?`, `:`                          | Conditional expression
+`=`                               | Assignment
+`,`                               | Parameter and column separator
+`;`                               | Row separator
+`\n`, `;`                         | Statement separators
+
+
+## Functions
+
+Functions are called by entering their name, followed by zero or more
+arguments enclosed by parentheses. All available functions are listed on the
+page [Functions](../reference/functions.md).
+
+```js
+math.evaluate('sqrt(25)')           // 5
+math.evaluate('log(10000, 3 + 7)')  // 4
+math.evaluate('sin(pi / 4)')        // 0.7071067811865475
+```
+
+New functions can be defined by "assigning" an expression to a function call
+with one or more variables. Such function assignments are limited: they can
+only be defined on a single line.
+
+```js
+const parser = math.parser()
+
+parser.evaluate('f(x) = x ^ 2 - 5')
+parser.evaluate('f(2)')     // -1
+parser.evaluate('f(3)')     // 4
+
+parser.evaluate('g(x, y) = x ^ y')
+parser.evaluate('g(2, 3)')  // 8
+```
+
+Note that these function assignments do _not_ create closures; put another way,
+all free variables in mathjs are dynamic:
+
+```js
+const parser = math.parser()
+
+parser.evaluate('x = 7')
+parser.evaluate('h(y) = x + y')
+parser.evaluate('h(3)')         // 10
+parser.evaluate('x = 3')
+parser.evaluate('h(3)')         // 6, *not* 10
+```
+
+It is however possible to pass functions as parameters:
+
+```js
+const parser = math.parser()
+
+parser.evaluate('twice(func, x) = func(func(x))')
+parser.evaluate('twice(square, 2)')    // 16
+parser.evaluate('f(x) = 3*x')
+parser.evaluate('twice(f, 2)')         // 18
+
+// a simplistic "numerical derivative":
+parser.evaluate('eps = 1e-10')
+parser.evaluate('nd(f, x) = (f(x+eps) - func(x-eps))/(2*eps)')
+parser.evaluate('nd(square,2)')        // 4.000000330961484
+```
+
+Math.js itself heavily uses typed functions, which ensure correct inputs and
+throws meaningful errors when the input arguments are invalid. One can create
+a [typed-function](https://github.com/josdejong/typed-function) in the
+expression parser like:
+
+```js
+const parser = math.parser()
+
+parser.evaluate('f = typed({"number": f(x) = x ^ 2 - 5})')
+```
+
+
+## Constants and variables
+
+Math.js has a number of built-in constants such as `pi` and `e`.
+All available constants are listed on he page
+[Constants](../reference/constants.md).
+
+```js
+// use constants
+math.evaluate('pi')                 // 3.141592653589793
+math.evaluate('e ^ 2')              // 7.3890560989306495
+math.evaluate('log(e)')             // 1
+math.evaluate('e ^ (pi * i) + 1')   // ~0 (Euler)
+```
+
+Variables can be defined using the assignment operator `=`, and can be used
+like constants.
+
+```js
+const parser = math.parser()
+
+// define variables
+parser.evaluate('a = 3.4')      // 3.4
+parser.evaluate('b = 5 / 2')    // 2.5
+
+// use variables
+parser.evaluate('a * b')        // 8.5
+```
+
+Variable names must:
+
+- Begin with an "alpha character", which is:
+  - A latin letter (upper or lower case). Ascii: `a-z`, `A-Z`
+  - An underscore.                        Ascii: `_`
+  - A dollar sign.                        Ascii: `$`
+  - A latin letter with accents.          Unicode: `\u00C0` - `\u02AF`
+  - A greek letter.                       Unicode: `\u0370` - `\u03FF`
+  - A letter-like character.              Unicode: `\u2100` - `\u214F`
+  - A mathematical alphanumeric symbol.   Unicode: `\u{1D400}` - `\u{1D7FF}` excluding invalid code points
+- Contain only alpha characters (above) and digits `0-9`
+- Not be any of the following: `mod`, `to`, `in`, `and`, `xor`, `or`, `not`, `end`. It is possible to assign to some of these, but that's not recommended.
+
+It is possible to customize the allowed alpha characters, see [Customize supported characters](customization.md#customize-supported-characters) for more information.
+
+
+## Data types
+
+The expression parser supports booleans, numbers, complex numbers, units,
+strings, matrices, and objects.
+
+
+### Booleans
+
+Booleans `true` and `false` can be used in expressions.
+
+```js
+// use booleans
+math.evaluate('true')               // true
+math.evaluate('false')              // false
+math.evaluate('(2 == 3) == false')  // true
+```
+
+Booleans can be converted to numbers and strings and vice versa using the
+functions `number` and `boolean`, and `string`.
+
+```js
+// convert booleans
+math.evaluate('number(true)')       // 1
+math.evaluate('string(false)')      // "false"
+math.evaluate('boolean(1)')         // true
+math.evaluate('boolean("false")')   // false
+```
+
+
+### Numbers
+
+The most important and basic data type in math.js are numbers. Numbers use a
+point as decimal mark. Numbers can be entered with exponential notation.
+Examples:
+
+```js
+// numbers in math.js
+math.evaluate('2')        // 2
+math.evaluate('3.14')     // 3.14
+math.evaluate('1.4e3')    // 1400
+math.evaluate('22e-3')    // 0.022
+```
+
+A number can be converted to a string and vice versa using the functions
+`number` and `string`.
+
+```js
+// convert a string into a number
+math.evaluate('number("2.3")')    // 2.3
+math.evaluate('string(2.3)')      // "2.3"
+```
+
+Math.js uses regular JavaScript numbers, which are floating points with a
+limited precision and limited range. The limitations are described in detail
+on the page [Numbers](../datatypes/numbers.md).
+
+```js
+math.evaluate('1e-325')   // 0
+math.evaluate('1e309')    // Infinity
+math.evaluate('-1e309')   // -Infinity
+```
+
+When doing calculations with floats, one can very easily get round-off errors:
+
+```js
+// round-off error due to limited floating point precision
+math.evaluate('0.1 + 0.2')  // 0.30000000000000004
+```
+
+When outputting results, the function `math.format` can be used to hide
+these round-off errors when outputting results for the user:
+
+```js
+const ans = math.evaluate('0.1 + 0.2')  //  0.30000000000000004
+math.format(ans, {precision: 14})       // "0.3"
+```
+
+Numbers can be expressed as binary, octal, and hexadecimal literals:
+
+```js
+math.evaluate('0b11')  //  3
+math.evaluate('0o77')  //  63
+math.evaluate('0xff')  //  255
+```
+
+A word size suffix can be used to change the behavior of non decimal literal evaluation:
+
+```js
+math.evaluate('0xffi8')         // -1
+math.evaluate('0xffffffffi32')  //  -1
+math.evaluate('0xfffffffffi32') //  SyntaxError: String "0xfffffffff" is out of range
+```
+
+Non decimal numbers can include a radix point:
+```js
+math.evaluate('0b1.1')         // 1.5
+math.evaluate('0o1.4')         // 1.5
+math.evaluate('0x1.8')         // 1.5
+```
+
+Numbers can be formatted as binary, octal, and hex strings using the `notation` option of the `format` function:
+
+```js
+math.evaluate('format(3, {notation: "bin"})')    //  '0b11'
+math.evaluate('format(63, {notation: "oct"})')   //  '0o77'
+math.evaluate('format(255, {notation: "hex"})')  //  '0xff'
+math.evaluate('format(-1, {notation: "hex"})')   //  '-0x1'
+math.evaluate('format(2.3, {notation: "hex"})')  //  '0x2.4cccccccccccc'
+```
+
+The `format` function accepts a `wordSize` option to use in conjunction with the non binary notations:
+
+```js
+math.evaluate('format(-1, {notation: "hex", wordSize: 8})')   //  '0xffi8'
+```
+
+The functions `bin`, `oct`, and `hex` are shorthand for the `format` function with `notation` set accordingly:
+
+```js
+math.evaluate('bin(-1)')     // '-0b1'
+math.evaluate('bin(-1, 8)')  // '0b11111111i8'
+```
+
+### BigNumbers
+
+Math.js supports BigNumbers for calculations with an arbitrary precision.
+The pros and cons of Number and BigNumber are explained in detail on the page
+[Numbers](../datatypes/numbers.md).
+
+BigNumbers are slower but have a higher precision. Calculations with big
+numbers are supported only by arithmetic functions.
+
+BigNumbers can be created using the `bignumber` function:
+
+```js
+math.evaluate('bignumber(0.1) + bignumber(0.2)') // BigNumber, 0.3
+```
+
+The default number type of the expression parser can be changed at instantiation
+of math.js. The expression parser parses numbers as BigNumber by default:
+
+```js
+// Configure the type of number: 'number' (default), 'BigNumber', or 'Fraction'
+math.config({number: 'BigNumber'})
+
+// all numbers are parsed as BigNumber
+math.evaluate('0.1 + 0.2')  // BigNumber, 0.3
+```
+
+BigNumbers can be converted to numbers and vice versa using the functions
+`number` and `bignumber`. When converting a BigNumber to a Number, the high
+precision of the BigNumber will be lost. When a BigNumber is too large to be represented
+as Number, it will be initialized as `Infinity`.
+
+
+### Complex numbers
+
+Complex numbers can be created using the imaginary unit `i`, which is defined
+as `i^2 = -1`. Complex numbers have a real and complex part, which can be
+retrieved using the functions `re` and `im`.
+
+```js
+const parser = math.parser()
+
+// create complex numbers
+parser.evaluate('a = 2 + 3i')   // Complex, 2 + 3i
+parser.evaluate('b = 4 - i')    // Complex, 4 - i
+
+// get real and imaginary part of a complex number
+parser.evaluate('re(a)')        // Number,  2
+parser.evaluate('im(a)')        // Number,  3
+
+// calculations with complex numbers
+parser.evaluate('a + b')        // Complex, 6 + 2i
+parser.evaluate('a * b')        // Complex, 11 + 10i
+parser.evaluate('i * i')        // Number,  -1
+parser.evaluate('sqrt(-4)')     // Complex, 2i
+```
+
+Math.js does not automatically convert complex numbers with an imaginary part
+of zero to numbers. They can be converted to a number using the function
+`number`.
+
+```js
+// convert a complex number to a number
+const parser = math.parser()
+parser.evaluate('a = 2 + 3i')   // Complex, 2 + 3i
+parser.evaluate('b = a - 3i')   // Complex, 2 + 0i
+parser.evaluate('number(b)')    // Number,  2
+parser.evaluate('number(a)')    // Error: 2 + i is no valid number
+```
+
+
+### Units
+
+math.js supports units. Units can be used in the arithmetic operations
+add, subtract, multiply, divide, and exponentiation.
+Units can also be converted from one to another.
+An overview of all available units can be found on the page
+[Units](../datatypes/units.md).
+
+Units can be converted using the operator `to` or `in`.
+
+```js
+// create a unit
+math.evaluate('5.4 kg')                     // Unit, 5.4 kg
+
+// convert a unit
+math.evaluate('2 inch to cm')               // Unit, 5.08 cm
+math.evaluate('20 celsius in fahrenheit')   // Unit, ~68 fahrenheit
+math.evaluate('90 km/h to m/s')             // Unit, 25 m / s
+
+// convert a unit to a number
+// A second parameter with the unit for the exported number must be provided
+math.evaluate('number(5 cm, mm)')           // Number, 50
+
+// calculations with units
+math.evaluate('0.5kg + 33g')                // Unit, 0.533 kg
+math.evaluate('3 inch + 2 cm')              // Unit, 3.7874 inch
+math.evaluate('3 inch + 2 cm')              // Unit, 3.7874 inch
+math.evaluate('12 seconds * 2')             // Unit, 24 seconds
+math.evaluate('sin(45 deg)')                // Number, 0.7071067811865475
+math.evaluate('9.81 m/s^2 * 5 s to mi/h')   // Unit, 109.72172512527 mi / h
+```
+
+
+### Strings
+
+Strings are enclosed by double quotes " or single quotes '. Strings can be concatenated using the
+function `concat` (not by adding them using `+` like in JavaScript). Parts of
+a string can be retrieved or replaced by using indexes. Strings can be converted
+to a number using function `number`, and numbers can be converted to a string
+using function `string`.
+
+When setting the value of a character in a string, the character that has been
+set is returned. Likewise, when a range of characters is set, that range of
+characters is returned.
+
+
+```js
+const parser = math.parser()
+
+// create a string
+parser.evaluate('"hello"')                        // String, "hello"
+
+// string manipulation
+parser.evaluate('a = concat("hello", " world")')  // String, "hello world"
+parser.evaluate('size(a)')                        // Matrix [11]
+parser.evaluate('a[1:5]')                         // String, "hello"
+parser.evaluate('a[1] = "H"')                     // String, "H"
+parser.evaluate('a[7:12] = "there!"')             // String, "there!"
+parser.evaluate('a')                              // String, "Hello there!"
+
+// string conversion
+parser.evaluate('number("300")')                  // Number, 300
+parser.evaluate('string(300)')                    // String, "300"
+```
+
+Strings can be used in the `evaluate` function, to parse expressions inside
+the expression parser:
+
+```js
+math.evaluate('evaluate("2 + 3")')  // 5
+```
+
+
+### Matrices
+
+Matrices can be created by entering a series of values between square brackets,
+elements are separated by a comma `,`.
+A matrix like `[1, 2, 3]` will create a vector, a 1-dimensional matrix with
+size `[3]`. To create a multi-dimensional matrix, matrices can be nested into
+each other. For easier creation of two-dimensional matrices, a semicolon `;`
+can be used to separate rows in a matrix.
+
+```js
+// create a matrix
+math.evaluate('[1, 2, 3]')                                // Matrix, size [3]
+math.evaluate('[[1, 2, 3], [4, 5, 6]]')                   // Matrix, size [2, 3]
+math.evaluate('[[[1, 2], [3, 4]], [[5, 6], [7, 8]]]')     // Matrix, size [2, 2, 2]
+
+// create a two dimensional matrix
+math.evaluate('[1, 2, 3; 4, 5, 6]')                       // Matrix, size [2, 3]
+```
+
+Another way to create filled matrices is using the functions `zeros`, `ones`,
+`identity`, and `range`.
+
+```js
+// initialize a matrix with ones or zeros
+math.evaluate('zeros(3, 2)')      // Matrix, [[0, 0], [0, 0], [0, 0]],  size [3, 2]
+math.evaluate('ones(3)')          // Matrix, [1, 1, 1],                 size [3]
+math.evaluate('5 * ones(2, 2)')   // Matrix, [[5, 5], [5, 5]],          size [2, 2]
+
+// create an identity matrix
+math.evaluate('identity(2)')      // Matrix, [[1, 0], [0, 1]],          size [2, 2]
+
+// create a range
+math.evaluate('1:4')              // Matrix, [1, 2, 3, 4],              size [4]
+math.evaluate('0:2:10')           // Matrix, [0, 2, 4, 6, 8, 10],       size [6]
+```
+
+A subset can be retrieved from a matrix using indexes and a subset of a matrix
+can be replaced by using indexes. Indexes are enclosed in square brackets, and
+contain a number or a range for each of the matrix dimensions. A range can have
+its start and/or end undefined. When the start is undefined, the range will start
+at 1, when the end is undefined, the range will end at the end of the matrix.
+There is a context variable `end` available as well to denote the end of the
+matrix.
+
+*IMPORTANT: matrix indexes and ranges work differently from the math.js indexes
+in JavaScript: They are one-based with an included upper-bound, similar to most
+math applications.*
+
+```js
+parser = math.parser()
+
+// create matrices
+parser.evaluate('a = [1, 2; 3, 4]')       // Matrix, [[1, 2], [3, 4]]
+parser.evaluate('b = zeros(2, 2)')        // Matrix, [[0, 0], [0, 0]]
+parser.evaluate('c = 5:9')                // Matrix, [5, 6, 7, 8, 9]
+
+// replace a subset in a matrix
+parser.evaluate('b[1, 1:2] = [5, 6]')     // Matrix, [[5, 6], [0, 0]]
+parser.evaluate('b[2, :] = [7, 8]')       // Matrix, [[5, 6], [7, 8]]
+
+// perform a matrix calculation
+parser.evaluate('d = a * b')              // Matrix, [[19, 22], [43, 50]]
+
+// retrieve a subset of a matrix
+parser.evaluate('d[2, 1]')                // 43
+parser.evaluate('d[2, 1:end]')            // Matrix, [[43, 50]]
+parser.evaluate('c[end - 1 : -1 : 2]')    // Matrix, [8, 7, 6]
+```
+
+## Objects
+
+Objects in math.js work the same as in languages like JavaScript and Python.
+An object is enclosed by curly brackets `{`, `}`, and contains a set of
+comma separated key/value pairs. Keys and values are separated by a colon `:`.
+Keys can be a symbol like `prop` or a string like `"prop"`.
+
+```js
+math.evaluate('{a: 2 + 1, b: 4}')         // {a: 3, b: 4}
+math.evaluate('{"a": 2 + 1, "b": 4}')     // {a: 3, b: 4}
+```
+
+Objects can contain objects:
+
+```js
+math.evaluate('{a: 2, b: {c: 3, d: 4}}')  // {a: 2, b: {c: 3, d: 4}}
+```
+
+Object properties can be retrieved or replaced using dot notation or bracket
+notation. Unlike JavaScript, when setting a property value, the whole object
+is returned, not the property value
+
+```js
+let scope = {
+  obj: {
+    prop: 42
+  }
+}
+
+// retrieve properties
+math.evaluate('obj.prop', scope)          // 42
+math.evaluate('obj["prop"]', scope)       // 42
+
+// set properties (returns the whole object, not the property value!)
+math.evaluate('obj.prop = 43', scope)     // {prop: 43}
+math.evaluate('obj["prop"] = 43', scope)  // {prop: 43}
+scope.obj                                 // {prop: 43}
+```
+
+
+## Multi-line expressions
+
+An expression can contain multiple lines, and expressions can be spread over
+multiple lines. Lines can be separated by a newline character `\n` or by a
+semicolon `;`. Output of statements followed by a semicolon will be hidden from
+the output, and empty lines are ignored. The output is returned as a `ResultSet`,
+with an entry for every visible statement.
+
+```js
+// a multi-line expression
+math.evaluate('1 * 3 \n 2 * 3 \n 3 * 3')    // ResultSet, [3, 6, 9]
+
+// semicolon statements are hidden from the output
+math.evaluate('a=3; b=4; a + b \n a * b')   // ResultSet, [7, 12]
+
+// single expression spread over multiple lines
+math.evaluate('a = 2 +\n  3')               // 5
+math.evaluate('[\n  1, 2;\n  3, 4\n]')      // Matrix, [[1, 2], [3, 4]]
+```
+
+The results can be read from a `ResultSet` via the property `ResultSet.entries`
+which is an `Array`, or by calling `ResultSet.valueOf()`, which returns the
+array with results.
+
+
+## Implicit multiplication
+
+*Implicit multiplication* means the multiplication of two symbols, numbers, or a grouped expression inside parentheses without using the `*` operator. This type of syntax allows a more natural way to enter expressions. For example:
+
+```js
+math.evaluate('2 pi')         // 6.283185307179586
+math.evaluate('(1+2)(3+4)')   // 21
+```
+
+Parentheses are parsed as a function call when there is a symbol or accessor on
+the left hand side, like `sqrt(4)` or `obj.method(4)`. In other cases the
+parentheses are interpreted as an implicit multiplication.
+
+Math.js will always evaluate implicit multiplication before explicit multiplication `*`, so that the expression `x * y z` is parsed as `x * (y * z)`. Math.js also gives implicit multiplication higher precedence than division, *except* when the division matches the pattern `[unaryPrefixOp]?[number] / [number] [symbol]` or `[unaryPrefixOp]?[number] / [number] [left paren]`. In that special case, the division is evaluated first:
+
+```js
+math.evaluate('20 kg / 4 kg')   // 5      Evaluated as (20 kg) / (4 kg)
+math.evaluate('20 / 4 kg')      // 5 kg   Evaluated as (20 / 4) kg
+```
+
+The behavior of implicit multiplication can be summarized by these operator precedence rules, listed from highest to lowest precedence:
+
+- Function calls: `[symbol] [left paren]`
+- Explicit division `/` when the division matches this pattern: `[+-~]?[number] / [+-~]?[number] [symbol]` or `[number] / [number] [left paren]`
+- Implicit multiplication
+- All other division `/` and multiplication `*`
+
+Implicit multiplication is tricky as there can appear to be ambiguity in how an expression will be evaluated. Experience has shown that the above rules most closely match user intent when entering expressions that could be interpreted different ways. It's also possible that these rules could be tweaked in future major releases.  Use implicit multiplication carefully. If you don't like the uncertainty introduced by implicit multiplication, use explicit `*` operators and parentheses to ensure your expression is evaluated the way you intend.
+
+Here are some more examples using implicit multiplication:
+
+Expression      | Evaluated as        | Result
+--------------- | ------------------- | ------------------
+(1 + 3) pi      | (1 + 3) * pi        | 12.566370614359172
+(4 - 1) 2       | (4 - 1) * 2         | 6
+3 / 4 mm        | (3 / 4) * mm        | 0.75 mm
+2 + 3 i         | 2 + (3 * i)         | 2 + 3i
+(1 + 2) (4 - 2) | (1 + 2) * (4 - 2)   | 6
+sqrt(4) (1 + 2) | sqrt(4) * (1 + 2)   | 6
+8 pi / 2 pi     | (8 * pi) / (2 * pi) | 4
+pi / 2 pi       | pi / (2 * pi)       | 0.5
+1 / 2i          | (1 / 2) * i         | 0.5 i
+8.314 J / mol K | 8.314 J / (mol * K) | 8.314 J / (mol * K)
+
+
+## Comments
+
+Comments can be added to explain or describe calculations in the text. A comment
+starts with a sharp sign character `#`, and ends at the end of the line. A line
+can contain a comment only, or can contain an expression followed by a comment.
+
+```js
+const parser = math.parser()
+
+parser.evaluate('# define some variables')
+parser.evaluate('width = 3')                              // 3
+parser.evaluate('height = 4')                             // 4
+parser.evaluate('width * height   # calculate the area')  // 12
+```
diff --git a/node_modules/mathjs/docs/getting_started.md b/node_modules/mathjs/docs/getting_started.md
new file mode 100644
index 0000000..469ad74
--- /dev/null
+++ b/node_modules/mathjs/docs/getting_started.md
@@ -0,0 +1,124 @@
+# Getting Started
+
+This getting started describes how to install, load, and use math.js.
+
+
+## Install
+
+Math.js can be installed using various package managers like [npm](https://npmjs.org/), or by just downloading the library from the website: [https://mathjs.org/download.html](https://mathjs.org/download.html).
+
+To install via npm, run:
+
+    npm install mathjs
+
+Other ways to install math.js are described on the [website](https://mathjs.org/download.html).
+
+
+## Load
+
+Math.js can be used in node.js and in the browser. The library must be loaded
+and instantiated. When creating an instance, one can optionally provide
+configuration options as described in
+[Configuration](core/configuration.md).
+
+### ES modules
+
+Load the functions you need and use them:
+
+```js
+import { sqrt } from 'mathjs'
+
+console.log(sqrt(-4).toString()) // 2i
+```
+
+To use lightweight, number only implementations of all functions:
+
+```js
+import { sqrt } from 'mathjs/number'
+
+console.log(sqrt(4).toString()) // 2
+console.log(sqrt(-4).toString()) // NaN
+```
+
+You can create a mathjs instance allowing [configuration](core/configuration.md) and importing of external functions as follows:
+
+```js
+import { create, all } from 'mathjs'
+
+const config = { }
+const math = create(all, config)
+
+console.log(math.sqrt(-4).toString()) // 2i
+```
+
+How to optimize your bundle size using tree-shaking is described on the page
+[Custom bundling](custom_bundling.md).
+
+
+### Node.js
+
+Load math.js in [node.js](https://nodejs.org/) (CommonJS module system):
+
+```js
+const { sqrt } = require('mathjs')
+
+console.log(sqrt(-4).toString()) // 2i
+```
+
+
+### Browser
+
+Math.js can be loaded as a regular JavaScript file in the browser, use the global
+variable `math` to access the libary once loaded:
+
+```html
+<!DOCTYPE HTML>
+<html>
+<head>
+  <script src="math.js" type="text/javascript"></script>
+</head>
+<body>
+  <script type="text/javascript">
+    console.log(math.sqrt(-4).toString()) // 2i
+  </script>
+</body>
+</html>
+```
+
+## Use
+
+Math.js can be used similar to JavaScript's built-in Math library. Besides that,
+math.js can evaluate expressions (see [Expressions](expressions/index.md)) and
+supports chaining (see [Chaining](core/chaining.md)).
+
+The example code below shows how to use math.js. More examples can be found in the
+section [Examples](https://mathjs.org/examples/index.html).
+
+```js
+// functions and constants
+math.round(math.e, 3)                // 2.718
+math.atan2(3, -3) / math.pi          // 0.75
+math.log(10000, 10)                  // 4
+math.sqrt(-4)                        // 2i
+math.pow([[-1, 2], [3, 1]], 2)       // [[7, 0], [0, 7]]
+
+// expressions
+math.evaluate('12 / (2.3 + 0.7)')    // 4
+math.evaluate('12.7 cm to inch')     // 5 inch
+math.evaluate('sin(45 deg) ^ 2')     // 0.5
+math.evaluate('9 / 3 + 2i')          // 3 + 2i
+math.evaluate('det([-1, 2; 3, 1])')  // -7
+
+// chained operations
+math.chain(3)
+    .add(4)
+    .multiply(2)
+    .done() // 14
+```
+
+## Next
+
+To learn more about math.js, check out the available documentation and examples:
+
+- [Documentation](index.md)
+- [Examples](https://mathjs.org/examples/index.html)
diff --git a/node_modules/mathjs/docs/index.md b/node_modules/mathjs/docs/index.md
new file mode 100644
index 0000000..f3e77f9
--- /dev/null
+++ b/node_modules/mathjs/docs/index.md
@@ -0,0 +1,39 @@
+# Documentation
+
+[Math.js](https://mathjs.org) is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with different data types like numbers, big numbers, complex numbers, fractions, units, and matrices.
+
+Math.js can be used in the browser, in node.js and in any JavaScript engine. Installation and download instructions are available on the [Download page](https://mathjs.org/download.html) of the website.
+
+## Getting Started
+
+- [Getting Started](getting_started.md)
+- [Examples](//mathjs.org/examples/index.html)
+
+## Documentation
+
+- **[Core](core/index.md)**
+  - [Configuration](core/configuration.md)
+  - [Chaining](core/chaining.md)
+  - [Extension](core/extension.md)
+  - [Serialization](core/serialization.md)
+- **[Expressions](expressions/index.md)**
+  - [Parsing and evaluation](expressions/parsing.md)
+  - [Syntax](expressions/syntax.md)
+  - [Expression trees](expressions/expression_trees.md)
+  - [Algebra](expressions/algebra.md)
+  - [Customization](expressions/customization.md)
+  - [Security](expressions/security.md)
+- **[Data Types](datatypes/index.md)**
+  - [Numbers](datatypes/numbers.md)
+  - [BigNumbers](datatypes/bignumbers.md)
+  - [Fractions](datatypes/fractions.md)
+  - [Complex Numbers](datatypes/complex_numbers.md)
+  - [Matrices](datatypes/matrices.md)
+  - [Units](datatypes/units.md)
+- **[Reference](reference/index.md)**
+  - [Classes](reference/classes.md)
+  - [Functions](reference/functions.md)
+  - [Constants](reference/constants.md)
+- [Custom bundling](custom_bundling.md)
+- [Command Line Interface](command_line_interface.md)
+- [History](../HISTORY.md)
diff --git a/node_modules/mathjs/docs/reference/classes.md b/node_modules/mathjs/docs/reference/classes.md
new file mode 100644
index 0000000..8954572
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes.md
@@ -0,0 +1,86 @@
+
+# Class Reference
+
+This page lists all the various class types in Math.js. Every top-level function is listed here and links to its detailed reference to other parts of the documentation.
+
+## math
+
+The "math" namespace contains the entire math.js functionality. All of the mathematical functions are available in the "math" namespace, and allow for inputs of various types.
+
+- [Function reference](functions.md)
+- [Constant reference](constants.md)
+
+
+## Unit
+
+Stores values for a scalar unit and its postfix. (eg `100 mm` or `100 kg`). Although the `Unit` class contains public functions documented as follows, using the following API directly is *not* recommended. Prefer using the functions in the "math" namespace wherever possible.
+
+- [Overview](../datatypes/units.md)
+- [Class API](classes/unit.md)
+
+
+## Fraction
+
+Stores values for a fractional number.
+
+- [Overview](../datatypes/fractions.md)
+- [Class API](https://github.com/infusion/Fraction.js/)
+
+## BigNumber
+
+Stores values for a arbitrary-precision floating point number.
+
+- [Overview](../datatypes/bignumbers.md)
+- [Class API](https://mikemcl.github.io/decimal.js/)
+
+
+## Matrix
+
+Two types of matrix classes are available in math.js, for storage of dense and sparse matrices. Although they contain public functions documented as follows, using the following API directly is *not* recommended. Prefer using the functions in the "math" namespace wherever possible.
+
+- [Overview](../datatypes/matrices.md)
+- [DenseMatrix](classes/densematrix.md)
+- [SparseMatrix](classes/sparsematrix.md)
+
+Classes used internally that may be of use to developers:
+
+- [Index](classes/matrixindex.md)
+- [Range](classes/matrixrange.md)
+- [ResultSet](classes/matrixrange.md)
+- [FibonacciHeap](classes/fibonacciheap.md)
+
+## Complex
+
+Stores values for a complex number.
+
+- [Overview](../datatypes/complex_numbers.md)
+- [Class API](https://github.com/infusion/Complex.js/)
+
+## Parser
+
+The Parser object returned by `math.parser()`.
+
+- [Overview](../expressions/parsing.md)
+
+## Node
+
+A node in an expression-tree, which can be used to analyze, manipulate, and evaluate expressions.
+
+- [Overview](../expressions/expression_trees.md)
+
+`Node` is the base class of all other node classes:
+
+- [AccessorNode](../expressions/expression_trees.md#accessornode)
+- [ArrayNode](../expressions/expression_trees.md#arraynode)
+- [AssignmentNode](../expressions/expression_trees.md#assignmentnode)
+- [BlockNode](../expressions/expression_trees.md#blocknode)
+- [ConditionalNode](../expressions/expression_trees.md#conditionalnode)
+- [ConstantNode](../expressions/expression_trees.md#constantnode)
+- [FunctionAssignmentNode](../expressions/expression_trees.md#functionassignmentnode)
+- [FunctionNode](../expressions/expression_trees.md#functionnode)
+- [IndexNode](../expressions/expression_trees.md#indexnode)
+- [ObjectNode](../expressions/expression_trees.md#objectnode)
+- [OperatorNode](../expressions/expression_trees.md#operatornode)
+- [ParenthesisNode](../expressions/expression_trees.md#parenthesisnode)
+- [RangeNode](../expressions/expression_trees.md#rangenode)
+- [SymbolNode](../expressions/expression_trees.md#symbolnode)
diff --git a/node_modules/mathjs/docs/reference/classes/densematrix.md b/node_modules/mathjs/docs/reference/classes/densematrix.md
new file mode 100644
index 0000000..8c9f377
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes/densematrix.md
@@ -0,0 +1,247 @@
+<a name="DenseMatrix"></a>
+## DenseMatrix
+Dense Matrix implementation. This type implements an efficient Array format
+for dense matrices.
+
+* _instance_
+	* [.storage()](#DenseMatrix+storage) ⇒ <code>string</code>
+	* [.datatype()](#DenseMatrix+datatype) ⇒ <code>string</code>
+	* [.create(data, [datatype])](#DenseMatrix+create)
+	* [.subset(index, [replacement], [defaultValue])](#DenseMatrix+subset)
+	* [.get(index)](#DenseMatrix+get) ⇒ <code>\*</code>
+	* [.set(index, value, [defaultValue])](#DenseMatrix+set) ⇒ <code>DenseMatrix</code>
+	* [.resize(size, [defaultValue], [copy])](#DenseMatrix+resize) ⇒ <code>Matrix</code>
+	* [.clone()](#DenseMatrix+clone) ⇒ <code>DenseMatrix</code>
+	* [.size()](#DenseMatrix+size) ⇒ <code>Array.&lt;number&gt;</code>
+	* [.map(callback)](#DenseMatrix+map) ⇒ <code>DenseMatrix</code>
+	* [.forEach(callback)](#DenseMatrix+forEach)
+	* [.toArray()](#DenseMatrix+toArray) ⇒ <code>Array</code>
+	* [.valueOf()](#DenseMatrix+valueOf) ⇒ <code>Array</code>
+	* [.format([options])](#DenseMatrix+format) ⇒ <code>string</code>
+	* [.toString()](#DenseMatrix+toString) ⇒ <code>string</code>
+	* [.toJSON()](#DenseMatrix+toJSON) ⇒ <code>Object</code>
+	* [.diagonal([k])](#DenseMatrix+diagonal) ⇒ <code>Array</code>
+	* [.swapRows(i, j)](#DenseMatrix+swapRows) ⇒ <code>Matrix</code>
+* _static_
+	* [.diagonal(size, value, [k], [defaultValue])](#DenseMatrix.diagonal) ⇒ <code>DenseMatrix</code>
+	* [.fromJSON(json)](#DenseMatrix.fromJSON) ⇒ <code>DenseMatrix</code>
+	* [.preprocess(data)](#DenseMatrix.preprocess) ⇒ <code>Array</code>
+
+<a name="DenseMatrix+storage"></a>
+### denseMatrix.storage() ⇒ <code>string</code>
+Get the storage format used by the matrix.
+
+Usage:
+
+```js
+const format = matrix.storage()                   // retrieve storage format
+```
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>string</code> - The storage format.  
+<a name="DenseMatrix+datatype"></a>
+### denseMatrix.datatype() ⇒ <code>string</code>
+Get the datatype of the data stored in the matrix.
+
+Usage:
+
+```js
+const format = matrix.datatype()                   // retrieve matrix datatype
+```
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>string</code> - The datatype.  
+<a name="DenseMatrix+create"></a>
+### denseMatrix.create(data, [datatype])
+Create a new DenseMatrix
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+
+| Param | Type |
+| --- | --- |
+| data | <code>Array</code> | 
+| [datatype] | <code>string</code> | 
+
+<a name="DenseMatrix+subset"></a>
+### denseMatrix.subset(index, [replacement], [defaultValue])
+Get a subset of the matrix, or replace a subset of the matrix.
+
+Usage:
+
+```js
+const subset = matrix.subset(index)               // retrieve subset
+const value = matrix.subset(index, replacement)   // replace subset
+```
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| index | <code>Index</code> |  |  |
+| [replacement] | <code>Array</code> &#124; <code>DenseMatrix</code>&#124; <code>\*</code> |  |  |
+| [defaultValue] | <code>\*</code> | <code>0</code> | Default value, filled in on new entries when                                  the matrix is resized. If not provided,                                  new matrix elements will be filled with zeros. |
+
+<a name="DenseMatrix+get"></a>
+### denseMatrix.get(index) ⇒ <code>\*</code>
+Get a single element from the matrix.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>\*</code> - value  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| index | <code>Array.&lt;number&gt;</code> | Zero-based index |
+
+<a name="DenseMatrix+set"></a>
+### denseMatrix.set(index, value, [defaultValue]) ⇒ <code>DenseMatrix</code>
+Replace a single element in the matrix.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>DenseMatrix</code>- self  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| index | <code>Array.&lt;number&gt;</code> | Zero-based index |
+| value | <code>\*</code> |  |
+| [defaultValue] | <code>\*</code> | Default value, filled in on new entries when                                  the matrix is resized. If not provided,                                  new matrix elements will be left undefined. |
+
+<a name="DenseMatrix+resize"></a>
+### denseMatrix.resize(size, [defaultValue], [copy]) ⇒ <code>Matrix</code>
+Resize the matrix to the given size. Returns a copy of the matrix when
+`copy=true`, otherwise return the matrix itself (resize in place).
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>Matrix</code> - The resized matrix  
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| size | <code>Array.&lt;number&gt;</code> |  | The new size the matrix should have. |
+| [defaultValue] | <code>\*</code> | <code>0</code> | Default value, filled in on new entries.                                  If not provided, the matrix elements will                                  be filled with zeros. |
+| [copy] | <code>boolean</code> |  | Return a resized copy of the matrix |
+
+<a name="DenseMatrix+clone"></a>
+### denseMatrix.clone() ⇒ <code>DenseMatrix</code>
+Create a clone of the matrix
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>DenseMatrix</code>- clone  
+<a name="DenseMatrix+size"></a>
+### denseMatrix.size() ⇒ <code>Array.&lt;number&gt;</code>
+Retrieve the size of the matrix.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>Array.&lt;number&gt;</code> - size  
+<a name="DenseMatrix+map"></a>
+### denseMatrix.map(callback) ⇒ <code>DenseMatrix</code>
+Create a new matrix with the results of the callback function executed on
+each entry of the matrix.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>DenseMatrix</code>- matrix  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| callback | <code>function</code> | The callback function is invoked with three                              parameters: the value of the element, the index                              of the element, and the Matrix being traversed. |
+
+<a name="DenseMatrix+forEach"></a>
+### denseMatrix.forEach(callback)
+Execute a callback function on each entry of the matrix.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+
+| Param | Type | Description |
+| --- | --- | --- |
+| callback | <code>function</code> | The callback function is invoked with three                              parameters: the value of the element, the index                              of the element, and the Matrix being traversed. |
+
+<a name="DenseMatrix+toArray"></a>
+### denseMatrix.toArray() ⇒ <code>Array</code>
+Create an Array with a copy of the data of the DenseMatrix
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>Array</code> - array  
+<a name="DenseMatrix+valueOf"></a>
+### denseMatrix.valueOf() ⇒ <code>Array</code>
+Get the primitive value of the DenseMatrix: a multidimensional array
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>Array</code> - array  
+<a name="DenseMatrix+format"></a>
+### denseMatrix.format([options]) ⇒ <code>string</code>
+Get a string representation of the matrix, with optional formatting options.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>string</code> - str  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| [options] | <code>Object</code> &#124; <code>number</code> &#124; <code>function</code> | Formatting options. See                                                lib/utils/number:format for a                                                description of the available                                                options. |
+
+<a name="DenseMatrix+toString"></a>
+### denseMatrix.toString() ⇒ <code>string</code>
+Get a string representation of the matrix
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>string</code> - str  
+<a name="DenseMatrix+toJSON"></a>
+### denseMatrix.toJSON() ⇒ <code>Object</code>
+Get a JSON representation of the matrix
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+<a name="DenseMatrix+diagonal"></a>
+### denseMatrix.diagonal([k]) ⇒ <code>Array</code>
+Get the kth Matrix diagonal.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>Array</code> - The array vector with the diagonal values.  
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| [k] | <code>number</code> &#124; <code>BigNumber</code> | <code>0</code> | The kth diagonal where the vector will retrieved. |
+
+<a name="DenseMatrix+swapRows"></a>
+### denseMatrix.swapRows(i, j) ⇒ <code>Matrix</code>
+Swap rows i and j in Matrix.
+
+**Kind**: instance method of <code>DenseMatrix</code> 
+**Returns**: <code>Matrix</code> - The matrix reference  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| i | <code>number</code> | Matrix row index 1 |
+| j | <code>number</code> | Matrix row index 2 |
+
+<a name="DenseMatrix.diagonal"></a>
+### DenseMatrix.diagonal(size, value, [k], [defaultValue]) ⇒ <code>DenseMatrix</code>
+Create a diagonal matrix.
+
+**Kind**: static method of <code>DenseMatrix</code> 
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| size | <code>Array</code> |  | The matrix size. |
+| value | <code>number</code> &#124; <code>Array</code> |  | The values for the diagonal. |
+| [k] | <code>number</code> &#124; <code>BigNumber</code> | <code>0</code> | The kth diagonal where the vector will be filled in. |
+| [defaultValue] | <code>number</code> |  | The default value for non-diagonal |
+
+<a name="DenseMatrix.fromJSON"></a>
+### DenseMatrix.fromJSON(json) ⇒ <code>DenseMatrix</code>
+Generate a matrix from a JSON object
+
+**Kind**: static method of <code>DenseMatrix</code> 
+
+| Param | Type | Description |
+| --- | --- | --- |
+| json | <code>Object</code> | An object structured like                       `{"mathjs": "DenseMatrix", data: [], size: []}`,                       where mathjs is optional |
+
+<a name="DenseMatrix.preprocess"></a>
+### DenseMatrix.preprocess(data) ⇒ <code>Array</code>
+Preprocess data, which can be an Array or DenseMatrix with nested Arrays and
+Matrices. Replaces all nested Matrices with Arrays
+
+**Kind**: static method of <code>DenseMatrix</code> 
+**Returns**: <code>Array</code> - data  
+
+| Param | Type |
+| --- | --- |
+| data | <code>Array</code> | 
+
diff --git a/node_modules/mathjs/docs/reference/classes/fibonacciheap.md b/node_modules/mathjs/docs/reference/classes/fibonacciheap.md
new file mode 100644
index 0000000..7021674
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes/fibonacciheap.md
@@ -0,0 +1,70 @@
+<a name="FibonacciHeap"></a>
+## FibonacciHeap
+* [new FibonacciHeap()](#new_FibonacciHeap_new)
+* _instance_
+	* [.insert()](#FibonacciHeap+insert)
+	* [.size()](#FibonacciHeap+size)
+	* [.clear()](#FibonacciHeap+clear)
+	* [.isEmpty()](#FibonacciHeap+isEmpty)
+	* [.extractMinimum()](#FibonacciHeap+extractMinimum)
+	* [.remove()](#FibonacciHeap+remove)
+* _static_
+	* [._decreaseKey()](#FibonacciHeap._decreaseKey)
+	* [._cut()](#FibonacciHeap._cut)
+	* [._cascadingCut()](#FibonacciHeap._cascadingCut)
+	* [._linkNodes()](#FibonacciHeap._linkNodes)
+
+<a name="new_FibonacciHeap_new"></a>
+### new FibonacciHeap()
+Creates a new instance of a Fibonacci Heap.
+
+<a name="FibonacciHeap+insert"></a>
+### fibonacciHeap.insert()
+Inserts a new data element into the heap. No heap consolidation is
performed at this time, the new node is simply inserted into the root
list of this heap. Running time: O(1) actual.
+
+**Kind**: instance method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap+size"></a>
+### fibonacciHeap.size()
+Returns the number of nodes in heap. Running time: O(1) actual.
+
+**Kind**: instance method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap+clear"></a>
+### fibonacciHeap.clear()
+Removes all elements from this heap.
+
+**Kind**: instance method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap+isEmpty"></a>
+### fibonacciHeap.isEmpty()
+Returns true if the heap is empty, otherwise false.
+
+**Kind**: instance method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap+extractMinimum"></a>
+### fibonacciHeap.extractMinimum()
+Extracts the node with minimum key from heap. Amortized running 
time: O(log n).
+
+**Kind**: instance method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap+remove"></a>
+### fibonacciHeap.remove()
+Removes a node from the heap given the reference to the node. The trees
in the heap will be consolidated, if necessary. This operation may fail
to remove the correct element if there are nodes with key value -Infinity.
Running time: O(log n) amortized.
+
+**Kind**: instance method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap._decreaseKey"></a>
+### FibonacciHeap._decreaseKey()
+Decreases the key value for a heap node, given the new value to take on.
The structure of the heap may be changed and will not be consolidated. 
Running time: O(1) amortized.
+
+**Kind**: static method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap._cut"></a>
+### FibonacciHeap._cut()
+The reverse of the link operation: removes node from the child list of parent.
This method assumes that min is non-null. Running time: O(1).
+
+**Kind**: static method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap._cascadingCut"></a>
+### FibonacciHeap._cascadingCut()
+Performs a cascading cut operation. This cuts node from its parent and then
does the same for its parent, and so on up the tree.
Running time: O(log n); O(1) excluding the recursion.
+
+**Kind**: static method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
+<a name="FibonacciHeap._linkNodes"></a>
+### FibonacciHeap._linkNodes()
+Make the first node a child of the second one. Running time: O(1) actual.
+
+**Kind**: static method of <code>[FibonacciHeap](#FibonacciHeap)</code>  
diff --git a/node_modules/mathjs/docs/reference/classes/matrixindex.md b/node_modules/mathjs/docs/reference/classes/matrixindex.md
new file mode 100644
index 0000000..2e21133
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes/matrixindex.md
@@ -0,0 +1,133 @@
+<a name="Index"></a>
+## Index
+* [new Index(...ranges)](#new_Index_new)
+* _instance_
+	* [.valueOf](#Index+valueOf) ⇒ <code>Array</code>
+	* [.clone()](#Index+clone) ⇒ <code>[Index](#Index)</code>
+	* [.size()](#Index+size) ⇒ <code>Array.&lt;number&gt;</code>
+	* [.max()](#Index+max) ⇒ <code>Array.&lt;number&gt;</code>
+	* [.min()](#Index+min) ⇒ <code>Array.&lt;number&gt;</code>
+	* [.forEach(callback)](#Index+forEach)
+	* [.dimension(dim)](#Index+dimension) ⇒ <code>Range</code> &#124; <code>null</code>
+	* [.isScalar()](#Index+isScalar) ⇒ <code>boolean</code>
+	* [.toArray()](#Index+toArray) ⇒ <code>Array</code>
+	* [.toString()](#Index+toString) ⇒ <code>String</code>
+	* [.toJSON()](#Index+toJSON) ⇒ <code>Object</code>
+* _static_
+	* [.fromJSON(json)](#Index.fromJSON) ⇒ <code>[Index](#Index)</code>
+
+<a name="new_Index_new"></a>
+### new Index(...ranges)
+Create an index. An Index can store ranges and sets for multiple dimensions.
+Matrix.get, Matrix.set, and math.subset accept an Index as input.
+
+Usage:
+```js
+const index = new Index(range1, range2, matrix1, array1, ...)
+```
+
+Where each parameter can be any of:
+
+- A number
+- An instance of Range
+- An Array with the Set values
+- A Matrix with the Set values
+
+The parameters start, end, and step must be integer numbers.
+
+
+| Param | Type |
+| --- | --- |
+| ...ranges | <code>\*</code> | 
+
+<a name="Index+valueOf"></a>
+### index.valueOf ⇒ <code>Array</code>
+Get the primitive value of the Index, a two dimensional array.
+Equivalent to Index.toArray().
+
+**Kind**: instance property of <code>[Index](#Index)</code>  
+**Returns**: <code>Array</code> - array  
+<a name="Index+clone"></a>
+### index.clone() ⇒ <code>[Index](#Index)</code>
+Create a clone of the index
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>[Index](#Index)</code> - clone  
+<a name="Index+size"></a>
+### index.size() ⇒ <code>Array.&lt;number&gt;</code>
+Retrieve the size of the index, the number of elements for each dimension.
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>Array.&lt;number&gt;</code> - size  
+<a name="Index+max"></a>
+### index.max() ⇒ <code>Array.&lt;number&gt;</code>
+Get the maximum value for each of the indexes ranges.
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>Array.&lt;number&gt;</code> - max  
+<a name="Index+min"></a>
+### index.min() ⇒ <code>Array.&lt;number&gt;</code>
+Get the minimum value for each of the indexes ranges.
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>Array.&lt;number&gt;</code> - min  
+<a name="Index+forEach"></a>
+### index.forEach(callback)
+Loop over each of the ranges of the index
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| callback | <code>function</code> | Called for each range with a Range as first                              argument, the dimension as second, and the                              index object as third. |
+
+<a name="Index+dimension"></a>
+### index.dimension(dim) ⇒ <code>Range</code> &#124; <code>null</code>
+Retrieve the dimension for the given index
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>Range</code> &#124; <code>null</code> - range  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| dim | <code>Number</code> | Number of the dimension |
+
+<a name="Index+isScalar"></a>
+### index.isScalar() ⇒ <code>boolean</code>
+Test whether this index contains only a single value.
+
+This is the case when the index is created with only scalar values as ranges,
+not for ranges resolving into a single value.
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>boolean</code> - isScalar  
+<a name="Index+toArray"></a>
+### index.toArray() ⇒ <code>Array</code>
+Expand the Index into an array.
+For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>Array</code> - array  
+<a name="Index+toString"></a>
+### index.toString() ⇒ <code>String</code>
+Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>String</code> - str  
+<a name="Index+toJSON"></a>
+### index.toJSON() ⇒ <code>Object</code>
+Get a JSON representation of the Index
+
+**Kind**: instance method of <code>[Index](#Index)</code>  
+**Returns**: <code>Object</code> - Returns a JSON object structured as:
+                  `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`  
+<a name="Index.fromJSON"></a>
+### Index.fromJSON(json) ⇒ <code>[Index](#Index)</code>
+Instantiate an Index from a JSON object
+
+**Kind**: static method of <code>[Index](#Index)</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| json | <code>Object</code> | A JSON object structured as:                     `{"mathjs": "Index", "dimensions": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}` |
+
diff --git a/node_modules/mathjs/docs/reference/classes/matrixrange.md b/node_modules/mathjs/docs/reference/classes/matrixrange.md
new file mode 100644
index 0000000..a16002e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes/matrixrange.md
@@ -0,0 +1,158 @@
+<a name="Range"></a>
+## Range
+* [new Range(start, end, [step])](#new_Range_new)
+* _instance_
+	* [.size()](#Range+size) ⇒ <code>Array.&lt;number&gt;</code>
+	* [.min()](#Range+min) ⇒ <code>number</code> &#124; <code>undefined</code>
+	* [.max()](#Range+max) ⇒ <code>number</code> &#124; <code>undefined</code>
+	* [.forEach(callback)](#Range+forEach)
+	* [.map(callback)](#Range+map) ⇒ <code>Array</code>
+	* [.toArray()](#Range+toArray) ⇒ <code>Array</code>
+	* [.valueOf()](#Range+valueOf) ⇒ <code>Array</code>
+	* [.format([options])](#Range+format) ⇒ <code>string</code>
+	* [.toString()](#Range+toString) ⇒ <code>string</code>
+	* [.toJSON()](#Range+toJSON) ⇒ <code>Object</code>
+* _static_
+	* [.parse(str)](#Range.parse) ⇒ <code>[Range](#Range)</code> &#124; <code>null</code>
+	* [.fromJSON(json)](#Range.fromJSON) ⇒ <code>[Range](#Range)</code>
+
+<a name="new_Range_new"></a>
+### new Range(start, end, [step])
+Create a range. A range has a start, step, and end, and contains functions
+to iterate over the range.
+
+A range can be constructed as:
+
+```js
+const range = new Range(start, end) 
+const range = new Range(start, end, step) 
+```
+
+To get the result of the range:
+
+```js
+range.forEach(function (x) {
+    console.log(x) 
+}) 
+range.map(function (x) {
+    return math.sin(x) 
+}) 
+range.toArray() 
+```
+
+Example usage:
+
+```js
+const c = new Range(2, 6)        // 2:1:5
+c.toArray()                      // [2, 3, 4, 5]
+const d = new Range(2, -3, -1)   // 2:-1:-2
+d.toArray()                      // [2, 1, 0, -1, -2]
+```
+
+| Param | Type | Description |
+| --- | --- | --- |
+| start | <code>number</code> | included lower bound |
+| end | <code>number</code> | excluded upper bound |
+| [step] | <code>number</code> | step size, default value is 1 |
+
+<a name="Range+size"></a>
+### range.size() ⇒ <code>Array.&lt;number&gt;</code>
+Retrieve the size of the range.
+Returns an array containing one number, the number of elements in the range.
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>Array.&lt;number&gt;</code> - size  
+<a name="Range+min"></a>
+### range.min() ⇒ <code>number</code> &#124; <code>undefined</code>
+Calculate the minimum value in the range
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>number</code> &#124; <code>undefined</code> - min  
+<a name="Range+max"></a>
+### range.max() ⇒ <code>number</code> &#124; <code>undefined</code>
+Calculate the maximum value in the range
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>number</code> &#124; <code>undefined</code> - max  
+<a name="Range+forEach"></a>
+### range.forEach(callback)
+Execute a callback function for each value in the range.
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| callback | <code>function</code> | The callback method is invoked with three                              parameters: the value of the element, the index                              of the element, and the Range being traversed. |
+
+<a name="Range+map"></a>
+### range.map(callback) ⇒ <code>Array</code>
+Execute a callback function for each value in the Range, and return the
+results as an array
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>Array</code> - array  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| callback | <code>function</code> | The callback method is invoked with three                              parameters: the value of the element, the index                              of the element, and the Matrix being traversed. |
+
+<a name="Range+toArray"></a>
+### range.toArray() ⇒ <code>Array</code>
+Create an Array with a copy of the Ranges data
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>Array</code> - array  
+<a name="Range+valueOf"></a>
+### range.valueOf() ⇒ <code>Array</code>
+Get the primitive value of the Range, a one dimensional array
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>Array</code> - array  
+<a name="Range+format"></a>
+### range.format([options]) ⇒ <code>string</code>
+Get a string representation of the range, with optional formatting options.
+Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>string</code> - str  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| [options] | <code>Object</code> &#124; <code>number</code> &#124; <code>function</code> | Formatting options. See                                                lib/utils/number:format for a                                                description of the available                                                options. |
+
+<a name="Range+toString"></a>
+### range.toString() ⇒ <code>string</code>
+Get a string representation of the range.
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+<a name="Range+toJSON"></a>
+### range.toJSON() ⇒ <code>Object</code>
+Get a JSON representation of the range
+
+**Kind**: instance method of <code>[Range](#Range)</code>  
+**Returns**: <code>Object</code> - Returns a JSON object structured as:
+                  `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`  
+<a name="Range.parse"></a>
+### Range.parse(str) ⇒ <code>[Range](#Range)</code> &#124; <code>null</code>
+Parse a string into a range,
+The string contains the start, optional step, and end, separated by a colon.
+If the string does not contain a valid range, null is returned.
+For example str='0:2:11'.
+
+**Kind**: static method of <code>[Range](#Range)</code>  
+**Returns**: <code>[Range](#Range)</code> &#124; <code>null</code> - range  
+
+| Param | Type |
+| --- | --- |
+| str | <code>string</code> | 
+
+<a name="Range.fromJSON"></a>
+### Range.fromJSON(json) ⇒ <code>[Range](#Range)</code>
+Instantiate a Range from a JSON object
+
+**Kind**: static method of <code>[Range](#Range)</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| json | <code>Object</code> | A JSON object structured as:                      `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}` |
+
diff --git a/node_modules/mathjs/docs/reference/classes/resultset.md b/node_modules/mathjs/docs/reference/classes/resultset.md
new file mode 100644
index 0000000..b70ffb6
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes/resultset.md
@@ -0,0 +1,47 @@
+<a name="ResultSet"></a>
+## ResultSet
+* [new ResultSet(entries)](#new_ResultSet_new)
+* _instance_
+	* [.valueOf()](#ResultSet+valueOf) ⇒ <code>Array</code>
+	* [.toString()](#ResultSet+toString) ⇒ <code>string</code>
+	* [.toJSON()](#ResultSet+toJSON) ⇒ <code>Object</code>
+* _static_
+	* [.fromJSON(json)](#ResultSet.fromJSON) ⇒ <code>[ResultSet](#ResultSet)</code>
+
+<a name="new_ResultSet_new"></a>
+### new ResultSet(entries)
+A ResultSet contains a list or results
+
+
+| Param | Type |
+| --- | --- |
+| entries | <code>Array</code> | 
+
+<a name="ResultSet+valueOf"></a>
+### resultSet.valueOf() ⇒ <code>Array</code>
+Returns the array with results hold by this ResultSet
+
+**Kind**: instance method of <code>[ResultSet](#ResultSet)</code>  
+**Returns**: <code>Array</code> - entries  
+<a name="ResultSet+toString"></a>
+### resultSet.toString() ⇒ <code>string</code>
+Returns the stringified results of the ResultSet
+
+**Kind**: instance method of <code>[ResultSet](#ResultSet)</code>  
+**Returns**: <code>string</code> - string  
+<a name="ResultSet+toJSON"></a>
+### resultSet.toJSON() ⇒ <code>Object</code>
+Get a JSON representation of the ResultSet
+
+**Kind**: instance method of <code>[ResultSet](#ResultSet)</code>  
+**Returns**: <code>Object</code> - Returns a JSON object structured as:
                  `{"mathjs": "ResultSet", "entries": [...]}`  
+<a name="ResultSet.fromJSON"></a>
+### ResultSet.fromJSON(json) ⇒ <code>[ResultSet](#ResultSet)</code>
+Instantiate a ResultSet from a JSON object
+
+**Kind**: static method of <code>[ResultSet](#ResultSet)</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| json | <code>Object</code> | A JSON object structured as:                       `{"mathjs": "ResultSet", "entries": [...]}` |
+
diff --git a/node_modules/mathjs/docs/reference/classes/sparsematrix.md b/node_modules/mathjs/docs/reference/classes/sparsematrix.md
new file mode 100644
index 0000000..3007436
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes/sparsematrix.md
@@ -0,0 +1,245 @@
+<a name="SparseMatrix"></a>
+## SparseMatrix
+Sparse Matrix implementation. This type implements a Compressed Column Storage format
+for sparse matrices.
+
+* _instance_
+	* [.storage()](#SparseMatrix+storage) ⇒ <code>string</code>
+	* [.datatype()](#SparseMatrix+datatype) ⇒ <code>string</code>
+	* [.create(data, [datatype])](#SparseMatrix+create)
+	* [.density()](#SparseMatrix+density) ⇒ <code>number</code>
+	* [.subset(index, [replacement], [defaultValue])](#SparseMatrix+subset)
+	* [.get(index)](#SparseMatrix+get) ⇒ <code>\*</code>
+	* [.set(index, value, [defaultValue])](#SparseMatrix+set) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+	* [.resize(size, [defaultValue], [copy])](#SparseMatrix+resize) ⇒ <code>Matrix</code>
+	* [.clone()](#SparseMatrix+clone) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+	* [.size()](#SparseMatrix+size) ⇒ <code>Array.&lt;number&gt;</code>
+	* [.map(callback, [skipZeros])](#SparseMatrix+map) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+	* [.forEach(callback, [skipZeros])](#SparseMatrix+forEach)
+	* [.toArray()](#SparseMatrix+toArray) ⇒ <code>Array</code>
+	* [.valueOf()](#SparseMatrix+valueOf) ⇒ <code>Array</code>
+	* [.format([options])](#SparseMatrix+format) ⇒ <code>string</code>
+	* [.toString()](#SparseMatrix+toString) ⇒ <code>string</code>
+	* [.toJSON()](#SparseMatrix+toJSON) ⇒ <code>Object</code>
+	* [.diagonal([k])](#SparseMatrix+diagonal) ⇒ <code>Matrix</code>
+	* [.swapRows(i, j)](#SparseMatrix+swapRows) ⇒ <code>Matrix</code>
+* _static_
+	* [.fromJSON(json)](#SparseMatrix.fromJSON) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+	* [.diagonal(size, value, [k], [datatype])](#SparseMatrix.diagonal) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+
+<a name="SparseMatrix+storage"></a>
+### sparseMatrix.storage() ⇒ <code>string</code>
+Get the storage format used by the matrix.
+
+Usage:
+```js
+const format = matrix.storage()  // retrieve storage format
+```
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>string</code> - The storage format.  
+<a name="SparseMatrix+datatype"></a>
+### sparseMatrix.datatype() ⇒ <code>string</code>
+Get the datatype of the data stored in the matrix.
+
+Usage:
+```js
+const format = matrix.datatype()  // retrieve matrix datatype
+```
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>string</code> - The datatype.  
+<a name="SparseMatrix+create"></a>
+### sparseMatrix.create(data, [datatype])
+Create a new SparseMatrix
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+
+| Param | Type |
+| --- | --- |
+| data | <code>Array</code> | 
+| [datatype] | <code>string</code> | 
+
+<a name="SparseMatrix+density"></a>
+### sparseMatrix.density() ⇒ <code>number</code>
+Get the matrix density.
+
+Usage:
+```js
+const density = matrix.density()  // retrieve matrix density
+```
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>number</code> - The matrix density.  
+<a name="SparseMatrix+subset"></a>
+### sparseMatrix.subset(index, [replacement], [defaultValue])
+Get a subset of the matrix, or replace a subset of the matrix.
+
+Usage:
+```js
+const subset = matrix.subset(index)               // retrieve subset
+const value = matrix.subset(index, replacement)   // replace subset
+```
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| index | <code>Index</code> |  |  |
+| [replacement] | <code>Array</code> &#124; <code>Maytrix</code> &#124; <code>\*</code> |  |  |
+| [defaultValue] | <code>\*</code> | <code>0</code> | Default value, filled in on new entries when                                  the matrix is resized. If not provided,                                  new matrix elements will be filled with zeros. |
+
+<a name="SparseMatrix+get"></a>
+### sparseMatrix.get(index) ⇒ <code>\*</code>
+Get a single element from the matrix.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>\*</code> - value  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| index | <code>Array.&lt;number&gt;</code> | Zero-based index |
+
+<a name="SparseMatrix+set"></a>
+### sparseMatrix.set(index, value, [defaultValue]) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+Replace a single element in the matrix.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>[SparseMatrix](#SparseMatrix)</code> - self  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| index | <code>Array.&lt;number&gt;</code> | Zero-based index |
+| value | <code>\*</code> |  |
+| [defaultValue] | <code>\*</code> | Default value, filled in on new entries when                                  the matrix is resized. If not provided,                                  new matrix elements will be set to zero. |
+
+<a name="SparseMatrix+resize"></a>
+### sparseMatrix.resize(size, [defaultValue], [copy]) ⇒ <code>Matrix</code>
+Resize the matrix to the given size. Returns a copy of the matrix when 
+`copy=true`, otherwise return the matrix itself (resize in place).
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>Matrix</code> - The resized matrix  
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| size | <code>Array.&lt;number&gt;</code> |  | The new size the matrix should have. |
+| [defaultValue] | <code>\*</code> | <code>0</code> | Default value, filled in on new entries.                                  If not provided, the matrix elements will                                  be filled with zeros. |
+| [copy] | <code>boolean</code> |  | Return a resized copy of the matrix |
+
+<a name="SparseMatrix+clone"></a>
+### sparseMatrix.clone() ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+Create a clone of the matrix
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>[SparseMatrix](#SparseMatrix)</code> - clone  
+<a name="SparseMatrix+size"></a>
+### sparseMatrix.size() ⇒ <code>Array.&lt;number&gt;</code>
+Retrieve the size of the matrix.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>Array.&lt;number&gt;</code> - size  
+<a name="SparseMatrix+map"></a>
+### sparseMatrix.map(callback, [skipZeros]) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+Create a new matrix with the results of the callback function executed on
+each entry of the matrix.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>[SparseMatrix](#SparseMatrix)</code> - matrix  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| callback | <code>function</code> | The callback function is invoked with three                              parameters: the value of the element, the index                              of the element, and the Matrix being traversed. |
+| [skipZeros] | <code>boolean</code> | Invoke callback function for non-zero values only. |
+
+<a name="SparseMatrix+forEach"></a>
+### sparseMatrix.forEach(callback, [skipZeros])
+Execute a callback function on each entry of the matrix.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| callback | <code>function</code> | The callback function is invoked with three                              parameters: the value of the element, the index                              of the element, and the Matrix being traversed. |
+| [skipZeros] | <code>boolean</code> | Invoke callback function for non-zero values only. |
+
+<a name="SparseMatrix+toArray"></a>
+### sparseMatrix.toArray() ⇒ <code>Array</code>
+Create an Array with a copy of the data of the SparseMatrix
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>Array</code> - array  
+<a name="SparseMatrix+valueOf"></a>
+### sparseMatrix.valueOf() ⇒ <code>Array</code>
+Get the primitive value of the SparseMatrix: a two dimensions array
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>Array</code> - array  
+<a name="SparseMatrix+format"></a>
+### sparseMatrix.format([options]) ⇒ <code>string</code>
+Get a string representation of the matrix, with optional formatting options.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>string</code> - str  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| [options] | <code>Object</code> &#124; <code>number</code> &#124; <code>function</code> | Formatting options. See                                                lib/utils/number:format for a                                                description of the available                                                options. |
+
+<a name="SparseMatrix+toString"></a>
+### sparseMatrix.toString() ⇒ <code>string</code>
+Get a string representation of the matrix
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>string</code> - str  
+<a name="SparseMatrix+toJSON"></a>
+### sparseMatrix.toJSON() ⇒ <code>Object</code>
+Get a JSON representation of the matrix
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+<a name="SparseMatrix+diagonal"></a>
+### sparseMatrix.diagonal([k]) ⇒ <code>Matrix</code>
+Get the kth Matrix diagonal.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>Matrix</code> - The matrix vector with the diagonal values.  
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| [k] | <code>number</code> &#124; <code>BigNumber</code> | <code>0</code> | The kth diagonal where the vector will retrieved. |
+
+<a name="SparseMatrix+swapRows"></a>
+### sparseMatrix.swapRows(i, j) ⇒ <code>Matrix</code>
+Swap rows i and j in Matrix.
+
+**Kind**: instance method of <code>[SparseMatrix](#SparseMatrix)</code>  
+**Returns**: <code>Matrix</code> - The matrix reference  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| i | <code>number</code> | Matrix row index 1 |
+| j | <code>number</code> | Matrix row index 2 |
+
+<a name="SparseMatrix.fromJSON"></a>
+### SparseMatrix.fromJSON(json) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+Generate a matrix from a JSON object
+
+**Kind**: static method of <code>[SparseMatrix](#SparseMatrix)</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| json | <code>Object</code> | An object structured like                       `{"mathjs": "SparseMatrix", "values": [], "index": [], "ptr": [], "size": []}`,                       where mathjs is optional |
+
+<a name="SparseMatrix.diagonal"></a>
+### SparseMatrix.diagonal(size, value, [k], [datatype]) ⇒ <code>[SparseMatrix](#SparseMatrix)</code>
+Create a diagonal matrix.
+
+**Kind**: static method of <code>[SparseMatrix](#SparseMatrix)</code>  
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| size | <code>Array</code> |  | The matrix size. |
+| value | <code>number</code> &#124; <code>Array</code> &#124; <code>Matrix</code> |  | The values for the diagonal. |
+| [k] | <code>number</code> &#124; <code>BigNumber</code> | <code>0</code> | The kth diagonal where the vector will be filled in. |
+| [datatype] | <code>string</code> |  | The Matrix datatype, values must be of this datatype. |
+
diff --git a/node_modules/mathjs/docs/reference/classes/unit.md b/node_modules/mathjs/docs/reference/classes/unit.md
new file mode 100644
index 0000000..5deae14
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/classes/unit.md
@@ -0,0 +1,242 @@
+<a name="Unit"></a>
+## Unit
+* [new Unit([value], [name])](#new_Unit_new)
+* _instance_
+	* [.valueOf](#Unit+valueOf) ⇒ <code>string</code>
+	* [.clone()](#Unit+clone) ⇒ <code>Unit</code>
+	* [._isDerived()](#Unit+_isDerived) ⇒ <code>boolean</code>
+	* [.hasBase(base)](#Unit+hasBase)
+	* [.equalBase(other)](#Unit+equalBase) ⇒ <code>boolean</code>
+	* [.equals(other)](#Unit+equals) ⇒ <code>boolean</code>
+	* [.multiply(other)](#Unit+multiply) ⇒ <code>Unit</code>
+	* [.divide(other)](#Unit+divide) ⇒ <code>Unit</code>
+	* [.pow(p)](#Unit+pow) ⇒ <code>Unit</code>
+	* [.abs(x)](#Unit+abs) ⇒ <code>Unit</code>
+	* [.to(valuelessUnit)](#Unit+to) ⇒ <code>Unit</code>
+	* [.toNumber(valuelessUnit)](#Unit+toNumber) ⇒ <code>number</code>
+	* [.toNumeric(valuelessUnit)](#Unit+toNumeric) ⇒ <code>number</code> &#124; <code>BigNumber</code> &#124; <code>Fraction</code>
+	* [.toString()](#Unit+toString) ⇒ <code>string</code>
+	* [.toJSON()](#Unit+toJSON) ⇒ <code>Object</code>
+	* [.formatUnits()](#Unit+formatUnits) ⇒ <code>string</code>
+	* [.format([options])](#Unit+format) ⇒ <code>string</code>
+* _static_
+	* [.parse(str)](#Unit.parse) ⇒ <code>Unit</code>
+	* [.isValuelessUnit(name)](#Unit.isValuelessUnit) ⇒ <code>boolean</code>
+	* [.fromJSON(json)](#Unit.fromJSON) ⇒ <code>Unit</code>
+
+<a name="new_Unit_new"></a>
+### new Unit([value], [name])
+A unit can be constructed in the following ways:
+
+```js
+const a = new Unit(value, name)
+const b = new Unit(null, name)
+const c = Unit.parse(str)
+```
+
+Example usage:
+
+```js
+const a = new Unit(5, 'cm')               // 50 mm
+const b = Unit.parse('23 kg')             // 23 kg
+const c = math.in(a, new Unit(null, 'm')  // 0.05 m
+const d = new Unit(9.81, "m/s^2")         // 9.81 m/s^2
+```
+
+| Param | Type | Description |
+| --- | --- | --- |
+| [value] | <code>number</code> &#124; <code>BigNumber</code> &#124; <code>Fraction</code> &#124; <code>Complex</code> &#124; <code>boolean</code> | A value like 5.2 |
+| [name] | <code>string</code> | A unit name like "cm" or "inch", or a derived unit of the form: "u1[^ex1] [u2[^ex2] ...] [/ u3[^ex3] [u4[^ex4]]]", such as "kg m^2/s^2", where each unit appearing after the forward slash is taken to be in the denominator. "kg m^2 s^-2" is a synonym and is also acceptable. Any of the units can include a prefix. |
+
+<a name="Unit+valueOf"></a>
+### unit.valueOf ⇒ <code>string</code>
+Returns the string representation of the unit.
+
+**Kind**: instance property of <code>Unit</code>  
+<a name="Unit+clone"></a>
+### unit.clone() ⇒ <code>Unit</code>
+create a copy of this unit
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>Unit</code> - Returns a cloned version of the unit  
+<a name="Unit+_isDerived"></a>
+### unit._isDerived() ⇒ <code>boolean</code>
+Return whether the unit is derived (such as m/s, or cm^2, but not N)
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>boolean</code> - True if the unit is derived  
+<a name="Unit+hasBase"></a>
+### unit.hasBase(base)
+check if this unit has given base unit
+If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.
+
+**Kind**: instance method of <code>Unit</code>  
+
+| Param | Type |
+| --- | --- |
+| base | <code>BASE_UNITS</code> &#124; <code>STRING</code> &#124; <code>undefined</code> | 
+
+<a name="Unit+equalBase"></a>
+### unit.equalBase(other) ⇒ <code>boolean</code>
+Check if this unit has a base or bases equal to another base or bases
+For derived units, the exponent on each base also must match
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>boolean</code> - true if equal base  
+
+| Param | Type |
+| --- | --- |
+| other | <code>Unit</code> | 
+
+<a name="Unit+equals"></a>
+### unit.equals(other) ⇒ <code>boolean</code>
+Check if this unit equals another unit
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>boolean</code> - true if both units are equal  
+
+| Param | Type |
+| --- | --- |
+| other | <code>Unit</code> | 
+
+<a name="Unit+multiply"></a>
+### unit.multiply(other) ⇒ <code>Unit</code>
+Multiply this unit with another one
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>Unit</code> - product of this unit and the other unit  
+
+| Param | Type |
+| --- | --- |
+| other | <code>Unit</code> | 
+
+<a name="Unit+divide"></a>
+### unit.divide(other) ⇒ <code>Unit</code>
+Divide this unit by another one
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>Unit</code> - result of dividing this unit by the other unit  
+
+| Param | Type |
+| --- | --- |
+| other | <code>Unit</code> | 
+
+<a name="Unit+pow"></a>
+### unit.pow(p) ⇒ <code>Unit</code>
+Calculate the power of a unit
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>Unit</code> - The result: this^p  
+
+| Param | Type |
+| --- | --- |
+| p | <code>number</code> &#124; <code>Fraction</code> &#124; <code>BigNumber</code> | 
+
+<a name="Unit+abs"></a>
+### unit.abs(x) ⇒ <code>Unit</code>
+Calculate the absolute value of a unit
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>Unit</code> - The result: |x|, absolute value of x  
+
+| Param | Type |
+| --- | --- |
+| x | <code>number</code> &#124; <code>Fraction</code> &#124; <code>BigNumber</code> | 
+
+<a name="Unit+to"></a>
+### unit.to(valuelessUnit) ⇒ <code>Unit</code>
+Convert the unit to a specific unit name.
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>Unit</code> - Returns a clone of the unit with a fixed prefix and unit.  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| valuelessUnit | <code>string</code> &#124; <code>Unit</code> | A unit without value. Can have prefix, like "cm" |
+
+<a name="Unit+toNumber"></a>
+### unit.toNumber(valuelessUnit) ⇒ <code>number</code>
+Return the value of the unit when represented with given valueless unit
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>number</code> - Returns the unit value as number.  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| valuelessUnit | <code>string</code> &#124; <code>Unit</code> | For example 'cm' or 'inch' |
+
+<a name="Unit+toNumeric"></a>
+### unit.toNumeric(valuelessUnit) ⇒ <code>number</code> &#124; <code>BigNumber</code> &#124; <code>Fraction</code>
+Return the value of the unit in the original numeric type
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>number</code> &#124; <code>BigNumber</code> &#124; <code>Fraction</code> - Returns the unit value  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| valuelessUnit | <code>string</code> &#124; <code>Unit</code> | For example 'cm' or 'inch' |
+
+<a name="Unit+toString"></a>
+### unit.toString() ⇒ <code>string</code>
+Get a string representation of the unit.
+
+**Kind**: instance method of <code>Unit</code>  
+<a name="Unit+toJSON"></a>
+### unit.toJSON() ⇒ <code>Object</code>
+Get a JSON representation of the unit
+
+**Kind**: instance method of <code>Unit</code>  
+**Returns**: <code>Object</code> - Returns a JSON object structured as:
+                  `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`  
+<a name="Unit+formatUnits"></a>
+### unit.formatUnits() ⇒ <code>string</code>
+Get a string representation of the units of this Unit, without the value.
+
+**Kind**: instance method of <code>Unit</code>  
+<a name="Unit+format"></a>
+### unit.format([options]) ⇒ <code>string</code>
+Get a string representation of the Unit, with optional formatting options.
+
+**Kind**: instance method of <code>Unit</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| [options] | <code>Object</code> &#124; <code>number</code> &#124; <code>function</code> | Formatting options. See                                                lib/utils/number:format for a                                                description of the available                                                options. |
+
+<a name="Unit.parse"></a>
+### Unit.parse(str) ⇒ <code>Unit</code>
+Parse a string into a unit. The value of the unit is parsed as number,
+BigNumber, or Fraction depending on the math.js config setting `number`.
+
+Throws an exception if the provided string does not contain a valid unit or
+cannot be parsed.
+
+**Kind**: static method of <code>Unit</code>  
+**Returns**: <code>Unit</code> - unit  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| str | <code>string</code> | A string like "5.2 inch", "4e2 cm/s^2" |
+
+<a name="Unit.isValuelessUnit"></a>
+### Unit.isValuelessUnit(name) ⇒ <code>boolean</code>
+Test if the given expression is a unit.
+The unit can have a prefix but cannot have a value.
+
+**Kind**: static method of <code>Unit</code>  
+**Returns**: <code>boolean</code> - true if the given string is a unit  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| name | <code>string</code> | A string to be tested whether it is a value less unit.                        The unit can have prefix, like "cm" |
+
+<a name="Unit.fromJSON"></a>
+### Unit.fromJSON(json) ⇒ <code>Unit</code>
+Instantiate a Unit from a JSON object
+
+**Kind**: static method of <code>Unit</code>  
+
+| Param | Type | Description |
+| --- | --- | --- |
+| json | <code>Object</code> | A JSON object structured as:                       `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}` |
+
diff --git a/node_modules/mathjs/docs/reference/constants.md b/node_modules/mathjs/docs/reference/constants.md
new file mode 100644
index 0000000..ebe15d1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/constants.md
@@ -0,0 +1,29 @@
+# Constant reference
+
+Math.js contains the following constants. 
+
+Constant        | Description | Value
+--------------- | ----------- | -----
+`e`, `E`        | Euler's number, the base of the natural logarithm. | 2.718281828459045
+`i`             | Imaginary unit, defined as `i * i = -1`. A complex number is described as `a + b * i`, where a is the real part, and b is the imaginary part. | `sqrt(-1)`
+`Infinity`      | Infinity, a number which is larger than the maximum number that can be handled by a floating point number. | `Infinity`
+`LN2`           | Returns the natural logarithm of 2. | `0.6931471805599453`
+`LN10`          | Returns the natural logarithm of 10. | `2.302585092994046`
+`LOG2E`         | Returns the base-2 logarithm of E. | `1.4426950408889634`
+`LOG10E`        | Returns the base-10 logarithm of E. | `0.4342944819032518`
+`NaN`           | Not a number. | `NaN`
+`null`          | Value null. | `null`
+`phi`           | Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` | `1.618033988749895`
+`pi`, `PI`      | The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter. | `3.141592653589793`
+`SQRT1_2`       | Returns the square root of 1/2. | `0.7071067811865476`
+`SQRT2`         | Returns the square root of 2. | `1.4142135623730951`
+`tau`           | Tau is the ratio constant of a circle\'s circumference to radius, equal to `2 * pi`. | `6.283185307179586`
+`undefined`     | An undefined value. Preferably, use `null` to indicate undefined values. | `undefined`
+`version`       | Returns the version number of math.js. | For example `0.24.1`
+
+Example usage:
+
+```js
+math.sin(math.pi / 4)          // 0.70711
+math.multiply(math.i, math.i)  // -1
+```
diff --git a/node_modules/mathjs/docs/reference/functions.md b/node_modules/mathjs/docs/reference/functions.md
new file mode 100644
index 0000000..088e4e0
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions.md
@@ -0,0 +1,295 @@
+# Function reference
+
+## Expression functions
+
+Function | Description
+---- | -----------
+[math.compile(expr)](functions/compile.md) | Parse and compile an expression.
+[math.evaluate(expr&nbsp;[,&nbsp;scope])](functions/evaluate.md) | Evaluate an expression.
+[math.help(search)](functions/help.md) | Retrieve help on a function or data type.
+[math.parser()](functions/parser.md) | Create a parser.
+
+## Algebra functions
+
+Function | Description
+---- | -----------
+[derivative(expr,&nbsp;variable)](functions/derivative.md) | Takes the derivative of an expression expressed in parser Nodes.
+[leafCount(expr)](functions/leafCount.md) | Gives the number of "leaf nodes" in the parse tree of the given expression A leaf node is one that has no subexpressions, essentially either a symbol or a constant.
+[math.lsolve(L,&nbsp;b)](functions/lsolve.md) | Finds one solution of a linear equation system by forwards substitution.
+[math.lsolveAll(L,&nbsp;b)](functions/lsolveAll.md) | Finds all solutions of a linear equation system by forwards substitution.
+[math.lup(A)](functions/lup.md) | Calculate the Matrix LU decomposition with partial pivoting.
+[math.lusolve(A,&nbsp;b)](functions/lusolve.md) | Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.
+[math.qr(A)](functions/qr.md) | Calculate the Matrix QR decomposition.
+[rationalize(expr)](functions/rationalize.md) | Transform a rationalizable expression in a rational fraction.
+[resolve(expr,&nbsp;scope)](functions/resolve.md) | resolve(expr, scope) replaces variable nodes with their scoped values.
+[simplify(expr)](functions/simplify.md) | Simplify an expression tree.
+[simplifyCore(expr)](functions/simplifyCore.md) | simplifyCore() performs single pass simplification suitable for applications requiring ultimate performance.
+[math.slu(A,&nbsp;order,&nbsp;threshold)](functions/slu.md) | Calculate the Sparse Matrix LU decomposition with full pivoting.
+[symbolicEqual(expr1,&nbsp;expr2)](functions/symbolicEqual.md) | Attempts to determine if two expressions are symbolically equal, i.
+[math.usolve(U,&nbsp;b)](functions/usolve.md) | Finds one solution of a linear equation system by backward substitution.
+[math.usolveAll(U,&nbsp;b)](functions/usolveAll.md) | Finds all solutions of a linear equation system by backward substitution.
+
+## Arithmetic functions
+
+Function | Description
+---- | -----------
+[math.abs(x)](functions/abs.md) | Calculate the absolute value of a number.
+[math.add(x,&nbsp;y)](functions/add.md) | Add two or more values, `x + y`.
+[math.cbrt(x&nbsp;[,&nbsp;allRoots])](functions/cbrt.md) | Calculate the cubic root of a value.
+[math.ceil(x)](functions/ceil.md) | Round a value towards plus infinity If `x` is complex, both real and imaginary part are rounded towards plus infinity.
+[math.cube(x)](functions/cube.md) | Compute the cube of a value, `x * x * x`.
+[math.divide(x,&nbsp;y)](functions/divide.md) | Divide two values, `x / y`.
+[math.dotDivide(x,&nbsp;y)](functions/dotDivide.md) | Divide two matrices element wise.
+[math.dotMultiply(x,&nbsp;y)](functions/dotMultiply.md) | Multiply two matrices element wise.
+[math.dotPow(x,&nbsp;y)](functions/dotPow.md) | Calculates the power of x to y element wise.
+[math.exp(x)](functions/exp.md) | Calculate the exponent of a value.
+[math.expm1(x)](functions/expm1.md) | Calculate the value of subtracting 1 from the exponential value.
+[math.fix(x)](functions/fix.md) | Round a value towards zero.
+[math.floor(x)](functions/floor.md) | Round a value towards minus infinity.
+[math.gcd(a,&nbsp;b)](functions/gcd.md) | Calculate the greatest common divisor for two or more values or arrays.
+[math.hypot(a,&nbsp;b,&nbsp;...)](functions/hypot.md) | Calculate the hypotenusa of a list with values.
+[math.invmod(a,&nbsp;b)](functions/invmod.md) | Calculate the (modular) multiplicative inverse of a modulo b.
+[math.lcm(a,&nbsp;b)](functions/lcm.md) | Calculate the least common multiple for two or more values or arrays.
+[math.log(x&nbsp;[,&nbsp;base])](functions/log.md) | Calculate the logarithm of a value.
+[math.log10(x)](functions/log10.md) | Calculate the 10-base logarithm of a value.
+[math.log1p(x)](functions/log1p.md) | Calculate the logarithm of a `value+1`.
+[math.log2(x)](functions/log2.md) | Calculate the 2-base of a value.
+[math.mod(x,&nbsp;y)](functions/mod.md) | Calculates the modulus, the remainder of an integer division.
+[math.multiply(x,&nbsp;y)](functions/multiply.md) | Multiply two or more values, `x * y`.
+[math.norm(x&nbsp;[,&nbsp;p])](functions/norm.md) | Calculate the norm of a number, vector or matrix.
+[math.nthRoot(a)](functions/nthRoot.md) | Calculate the nth root of a value.
+[math.nthRoots(x)](functions/nthRoots.md) | Calculate the nth roots of a value.
+[math.pow(x,&nbsp;y)](functions/pow.md) | Calculates the power of x to y, `x ^ y`.
+[math.round(x&nbsp;[,&nbsp;n])](functions/round.md) | Round a value towards the nearest integer.
+[math.sign(x)](functions/sign.md) | Compute the sign of a value.
+[math.sqrt(x)](functions/sqrt.md) | Calculate the square root of a value.
+[math.square(x)](functions/square.md) | Compute the square of a value, `x * x`.
+[math.subtract(x,&nbsp;y)](functions/subtract.md) | Subtract two values, `x - y`.
+[math.unaryMinus(x)](functions/unaryMinus.md) | Inverse the sign of a value, apply a unary minus operation.
+[math.unaryPlus(x)](functions/unaryPlus.md) | Unary plus operation.
+[math.xgcd(a,&nbsp;b)](functions/xgcd.md) | Calculate the extended greatest common divisor for two values.
+
+## Bitwise functions
+
+Function | Description
+---- | -----------
+[math.bitAnd(x,&nbsp;y)](functions/bitAnd.md) | Bitwise AND two values, `x & y`.
+[math.bitNot(x)](functions/bitNot.md) | Bitwise NOT value, `~x`.
+[math.bitOr(x,&nbsp;y)](functions/bitOr.md) | Bitwise OR two values, `x | y`.
+[math.bitXor(x,&nbsp;y)](functions/bitXor.md) | Bitwise XOR two values, `x ^ y`.
+[math.leftShift(x,&nbsp;y)](functions/leftShift.md) | Bitwise left logical shift of a value x by y number of bits, `x << y`.
+[math.rightArithShift(x,&nbsp;y)](functions/rightArithShift.md) | Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.
+[math.rightLogShift(x,&nbsp;y)](functions/rightLogShift.md) | Bitwise right logical shift of value x by y number of bits, `x >>> y`.
+
+## Combinatorics functions
+
+Function | Description
+---- | -----------
+[math.bellNumbers(n)](functions/bellNumbers.md) | The Bell Numbers count the number of partitions of a set.
+[math.catalan(n)](functions/catalan.md) | The Catalan Numbers enumerate combinatorial structures of many different types.
+[math.composition(n,&nbsp;k)](functions/composition.md) | The composition counts of n into k parts.
+[math.stirlingS2(n,&nbsp;k)](functions/stirlingS2.md) | The Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets.
+
+## Complex functions
+
+Function | Description
+---- | -----------
+[math.arg(x)](functions/arg.md) | Compute the argument of a complex value.
+[math.conj(x)](functions/conj.md) | Compute the complex conjugate of a complex value.
+[math.im(x)](functions/im.md) | Get the imaginary part of a complex number.
+[math.re(x)](functions/re.md) | Get the real part of a complex number.
+
+## Geometry functions
+
+Function | Description
+---- | -----------
+[math.distance([x1,&nbsp;y1],&nbsp;[x2,&nbsp;y2])](functions/distance.md) | Calculates:    The eucledian distance between two points in N-dimensional spaces.
+[math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)](functions/intersect.md) | Calculates the point of intersection of two lines in two or three dimensions and of a line and a plane in three dimensions.
+
+## Logical functions
+
+Function | Description
+---- | -----------
+[math.and(x,&nbsp;y)](functions/and.md) | Logical `and`.
+[math.not(x)](functions/not.md) | Logical `not`.
+[math.or(x,&nbsp;y)](functions/or.md) | Logical `or`.
+[math.xor(x,&nbsp;y)](functions/xor.md) | Logical `xor`.
+
+## Matrix functions
+
+Function | Description
+---- | -----------
+[math.apply(A,&nbsp;dim,&nbsp;callback)](functions/apply.md) | Apply a function that maps an array to a scalar along a given axis of a matrix or array.
+[math.column(value,&nbsp;index)](functions/column.md) | Return a column from a Matrix.
+[math.concat(a,&nbsp;b,&nbsp;c,&nbsp;...&nbsp;[,&nbsp;dim])](functions/concat.md) | Concatenate two or more matrices.
+[math.count(x)](functions/count.md) | Count the number of elements of a matrix, array or string.
+[math.cross(x,&nbsp;y)](functions/cross.md) | Calculate the cross product for two vectors in three dimensional space.
+[math.ctranspose(x)](functions/ctranspose.md) | Transpose and complex conjugate a matrix.
+[math.det(x)](functions/det.md) | Calculate the determinant of a matrix.
+[math.diag(X)](functions/diag.md) | Create a diagonal matrix or retrieve the diagonal of a matrix  When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.
+[math.diff(arr)](functions/diff.md) | Create a new matrix or array of the difference between elements of the given array The optional dim parameter lets you specify the dimension to evaluate the difference of If no dimension parameter is passed it is assumed as dimension 0  Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber Arrays must be 'rectangular' meaning arrays like [1, 2] If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays.
+[math.dot(x,&nbsp;y)](functions/dot.md) | Calculate the dot product of two vectors.
+[math.eigs(x,&nbsp;[prec])](functions/eigs.md) | Compute eigenvalues and eigenvectors of a matrix.
+[math.expm(x)](functions/expm.md) | Compute the matrix exponential, expm(A) = e^A.
+[math.filter(x,&nbsp;test)](functions/filter.md) | Filter the items in an array or one dimensional matrix.
+[math.flatten(x)](functions/flatten.md) | Flatten a multi dimensional matrix into a single dimensional matrix.
+[math.forEach(x,&nbsp;callback)](functions/forEach.md) | Iterate over all elements of a matrix/array, and executes the given callback function.
+[math.getMatrixDataType(x)](functions/getMatrixDataType.md) | Find the data type of all elements in a matrix or array, for example 'number' if all items are a number and 'Complex' if all values are complex numbers.
+[math.identity(n)](functions/identity.md) | Create a 2-dimensional identity matrix with size m x n or n x n.
+[math.inv(x)](functions/inv.md) | Calculate the inverse of a square matrix.
+[math.kron(x,&nbsp;y)](functions/kron.md) | Calculates the kronecker product of 2 matrices or vectors.
+[math.map(x,&nbsp;callback)](functions/map.md) | Create a new matrix or array with the results of a callback function executed on each entry of a given matrix/array.
+[math.matrixFromColumns(...arr)](functions/matrixFromColumns.md) | Create a dense matrix from vectors as individual columns.
+[math.matrixFromFunction(size,&nbsp;fn)](functions/matrixFromFunction.md) | Create a matrix by evaluating a generating function at each index.
+[math.matrixFromRows(...arr)](functions/matrixFromRows.md) | Create a dense matrix from vectors as individual rows.
+[math.ones(m,&nbsp;n,&nbsp;p,&nbsp;...)](functions/ones.md) | Create a matrix filled with ones.
+[math.partitionSelect(x,&nbsp;k)](functions/partitionSelect.md) | Partition-based selection of an array or 1D matrix.
+[math.range(start,&nbsp;end&nbsp;[,&nbsp;step])](functions/range.md) | Create an array from a range.
+[math.reshape(x,&nbsp;sizes)](functions/reshape.md) | Reshape a multi dimensional array to fit the specified dimensions.
+[math.resize(x,&nbsp;size&nbsp;[,&nbsp;defaultValue])](functions/resize.md) | Resize a matrix.
+[math.rotate(w,&nbsp;theta)](functions/rotate.md) | Rotate a vector of size 1x2 counter-clockwise by a given angle Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis.
+[math.rotationMatrix(theta)](functions/rotationMatrix.md) | Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).
+[math.row(value,&nbsp;index)](functions/row.md) | Return a row from a Matrix.
+[math.size(x)](functions/size.md) | Calculate the size of a matrix or scalar.
+[math.sort(x)](functions/sort.md) | Sort the items in a matrix.
+[X&nbsp;=&nbsp;math.sqrtm(A)](functions/sqrtm.md) | Calculate the principal square root of a square matrix.
+[math.squeeze(x)](functions/squeeze.md) | Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.
+[math.subset(x,&nbsp;index&nbsp;[,&nbsp;replacement])](functions/subset.md) | Get or set a subset of a matrix or string.
+[math.trace(x)](functions/trace.md) | Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.
+[math.transpose(x)](functions/transpose.md) | Transpose a matrix.
+[math.zeros(m,&nbsp;n,&nbsp;p,&nbsp;...)](functions/zeros.md) | Create a matrix filled with zeros.
+
+## Probability functions
+
+Function | Description
+---- | -----------
+[math.combinations(n,&nbsp;k)](functions/combinations.md) | Compute the number of ways of picking `k` unordered outcomes from `n` possibilities.
+[math.combinationsWithRep(n,&nbsp;k)](functions/combinationsWithRep.md) | Compute the number of ways of picking `k` unordered outcomes from `n` possibilities, allowing individual outcomes to be repeated more than once.
+[math.factorial(n)](functions/factorial.md) | Compute the factorial of a value  Factorial only supports an integer value as argument.
+[math.gamma(n)](functions/gamma.md) | Compute the gamma function of a value using Lanczos approximation for small values, and an extended Stirling approximation for large values.
+[math.kldivergence(x,&nbsp;y)](functions/kldivergence.md) | Calculate the Kullback-Leibler (KL) divergence  between two distributions.
+[math.multinomial(a)](functions/multinomial.md) | Multinomial Coefficients compute the number of ways of picking a1, a2, .
+[math.permutations(n&nbsp;[,&nbsp;k])](functions/permutations.md) | Compute the number of ways of obtaining an ordered subset of `k` elements from a set of `n` elements.
+[math.pickRandom(array)](functions/pickRandom.md) | Random pick one or more values from a one dimensional array.
+[math.random([min,&nbsp;max])](functions/random.md) | Return a random number larger or equal to `min` and smaller than `max` using a uniform distribution.
+[math.randomInt([min,&nbsp;max])](functions/randomInt.md) | Return a random integer number larger or equal to `min` and smaller than `max` using a uniform distribution.
+
+## Relational functions
+
+Function | Description
+---- | -----------
+[math.compare(x,&nbsp;y)](functions/compare.md) | Compare two values.
+[math.compareNatural(x,&nbsp;y)](functions/compareNatural.md) | Compare two values of any type in a deterministic, natural way.
+[math.compareText(x,&nbsp;y)](functions/compareText.md) | Compare two strings lexically.
+[math.deepEqual(x,&nbsp;y)](functions/deepEqual.md) | Test element wise whether two matrices are equal.
+[math.equal(x,&nbsp;y)](functions/equal.md) | Test whether two values are equal.
+[math.equalText(x,&nbsp;y)](functions/equalText.md) | Check equality of two strings.
+[math.larger(x,&nbsp;y)](functions/larger.md) | Test whether value x is larger than y.
+[math.largerEq(x,&nbsp;y)](functions/largerEq.md) | Test whether value x is larger or equal to y.
+[math.smaller(x,&nbsp;y)](functions/smaller.md) | Test whether value x is smaller than y.
+[math.smallerEq(x,&nbsp;y)](functions/smallerEq.md) | Test whether value x is smaller or equal to y.
+[math.unequal(x,&nbsp;y)](functions/unequal.md) | Test whether two values are unequal.
+
+## Set functions
+
+Function | Description
+---- | -----------
+[math.setCartesian(set1,&nbsp;set2)](functions/setCartesian.md) | Create the cartesian product of two (multi)sets.
+[math.setDifference(set1,&nbsp;set2)](functions/setDifference.md) | Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
+[math.setDistinct(set)](functions/setDistinct.md) | Collect the distinct elements of a multiset.
+[math.setIntersect(set1,&nbsp;set2)](functions/setIntersect.md) | Create the intersection of two (multi)sets.
+[math.setIsSubset(set1,&nbsp;set2)](functions/setIsSubset.md) | Check whether a (multi)set is a subset of another (multi)set.
+[math.setMultiplicity(element,&nbsp;set)](functions/setMultiplicity.md) | Count the multiplicity of an element in a multiset.
+[math.setPowerset(set)](functions/setPowerset.md) | Create the powerset of a (multi)set.
+[math.setSize(set)](functions/setSize.md) | Count the number of elements of a (multi)set.
+[math.setSymDifference(set1,&nbsp;set2)](functions/setSymDifference.md) | Create the symmetric difference of two (multi)sets.
+[math.setUnion(set1,&nbsp;set2)](functions/setUnion.md) | Create the union of two (multi)sets.
+
+## Special functions
+
+Function | Description
+---- | -----------
+[math.erf(x)](functions/erf.md) | Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x.
+
+## Statistics functions
+
+Function | Description
+---- | -----------
+[math.cumsum(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/cumsum.md) | Compute the cumulative sum of a matrix or a list with values.
+[math.mad(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/mad.md) | Compute the median absolute deviation of a matrix or a list with values.
+[math.max(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/max.md) | Compute the maximum value of a matrix or a  list with values.
+[math.mean(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/mean.md) | Compute the mean value of matrix or a list with values.
+[math.median(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/median.md) | Compute the median of a matrix or a list with values.
+[math.min(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/min.md) | Compute the minimum value of a matrix or a  list of values.
+[math.mode(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/mode.md) | Computes the mode of a set of numbers or a list with values(numbers or characters).
+[math.prod(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/prod.md) | Compute the product of a matrix or a list with values.
+[math.quantileSeq(A,&nbsp;prob[,&nbsp;sorted])](functions/quantileSeq.md) | Compute the prob order quantile of a matrix or a list with values.
+[math.std(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/std.md) | Compute the standard deviation of a matrix or a  list with values.
+[math.sum(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/sum.md) | Compute the sum of a matrix or a list with values.
+[math.variance(a,&nbsp;b,&nbsp;c,&nbsp;...)](functions/variance.md) | Compute the variance of a matrix or a  list with values.
+
+## String functions
+
+Function | Description
+---- | -----------
+[math.bin(value)](functions/bin.md) | Format a number as binary.
+[math.format(value&nbsp;[,&nbsp;precision])](functions/format.md) | Format a value of any type into a string.
+[math.hex(value)](functions/hex.md) | Format a number as hexadecimal.
+[math.oct(value)](functions/oct.md) | Format a number as octal.
+[math.print(template, values [, precision])](functions/print.md) | Interpolate values into a string template.
+
+## Trigonometry functions
+
+Function | Description
+---- | -----------
+[math.acos(x)](functions/acos.md) | Calculate the inverse cosine of a value.
+[math.acosh(x)](functions/acosh.md) | Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
+[math.acot(x)](functions/acot.md) | Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
+[math.acoth(x)](functions/acoth.md) | Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
+[math.acsc(x)](functions/acsc.md) | Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
+[math.acsch(x)](functions/acsch.md) | Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.
+[math.asec(x)](functions/asec.md) | Calculate the inverse secant of a value.
+[math.asech(x)](functions/asech.md) | Calculate the hyperbolic arcsecant of a value, defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
+[math.asin(x)](functions/asin.md) | Calculate the inverse sine of a value.
+[math.asinh(x)](functions/asinh.md) | Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.
+[math.atan(x)](functions/atan.md) | Calculate the inverse tangent of a value.
+[math.atan2(y,&nbsp;x)](functions/atan2.md) | Calculate the inverse tangent function with two arguments, y/x.
+[math.atanh(x)](functions/atanh.md) | Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.
+[math.cos(x)](functions/cos.md) | Calculate the cosine of a value.
+[math.cosh(x)](functions/cosh.md) | Calculate the hyperbolic cosine of a value, defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.
+[math.cot(x)](functions/cot.md) | Calculate the cotangent of a value.
+[math.coth(x)](functions/coth.md) | Calculate the hyperbolic cotangent of a value, defined as `coth(x) = 1 / tanh(x)`.
+[math.csc(x)](functions/csc.md) | Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.
+[math.csch(x)](functions/csch.md) | Calculate the hyperbolic cosecant of a value, defined as `csch(x) = 1 / sinh(x)`.
+[math.sec(x)](functions/sec.md) | Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.
+[math.sech(x)](functions/sech.md) | Calculate the hyperbolic secant of a value, defined as `sech(x) = 1 / cosh(x)`.
+[math.sin(x)](functions/sin.md) | Calculate the sine of a value.
+[math.sinh(x)](functions/sinh.md) | Calculate the hyperbolic sine of a value, defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.
+[math.tan(x)](functions/tan.md) | Calculate the tangent of a value.
+[math.tanh(x)](functions/tanh.md) | Calculate the hyperbolic tangent of a value, defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.
+
+## Unit functions
+
+Function | Description
+---- | -----------
+[math.to(x,&nbsp;unit)](functions/to.md) | Change the unit of a value.
+
+## Utils functions
+
+Function | Description
+---- | -----------
+[math.clone(x)](functions/clone.md) | Clone an object.
+[math.hasNumericValue(x)](functions/hasNumericValue.md) | Test whether a value is an numeric value.
+[math.isInteger(x)](functions/isInteger.md) | Test whether a value is an integer number.
+[math.isNaN(x)](functions/isNaN.md) | Test whether a value is NaN (not a number).
+[math.isNegative(x)](functions/isNegative.md) | Test whether a value is negative: smaller than zero.
+[math.isNumeric(x)](functions/isNumeric.md) | Test whether a value is an numeric value.
+[math.isPositive(x)](functions/isPositive.md) | Test whether a value is positive: larger than zero.
+[math.isPrime(x)](functions/isPrime.md) | Test whether a value is prime: has no divisors other than itself and one.
+[math.isZero(x)](functions/isZero.md) | Test whether a value is zero.
+[math.numeric(x)](functions/numeric.md) | Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.
+[math.typeOf(x)](functions/typeOf.md) | Determine the type of a variable.
+
+
+
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
diff --git a/node_modules/mathjs/docs/reference/functions/abs.md b/node_modules/mathjs/docs/reference/functions/abs.md
new file mode 100644
index 0000000..e0f0440
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/abs.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function abs
+
+Calculate the absolute value of a number. For matrices, the function is
+evaluated element wise.
+
+
+## Syntax
+
+```js
+math.abs(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit |  A number or matrix for which to get the absolute value
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit |  Absolute value of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.abs(3.5)                // returns number 3.5
+math.abs(-4.2)               // returns number 4.2
+
+math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]
+```
+
+
+## See also
+
+[sign](sign.md)
diff --git a/node_modules/mathjs/docs/reference/functions/acos.md b/node_modules/mathjs/docs/reference/functions/acos.md
new file mode 100644
index 0000000..8896040
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/acos.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function acos
+
+Calculate the inverse cosine of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.acos(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | The arc cosine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.acos(0.5)           // returns number 1.0471975511965979
+math.acos(math.cos(1.5)) // returns number 1.5
+
+math.acos(2)             // returns Complex 0 + 1.3169578969248166 i
+```
+
+
+## See also
+
+[cos](cos.md),
+[atan](atan.md),
+[asin](asin.md)
diff --git a/node_modules/mathjs/docs/reference/functions/acosh.md b/node_modules/mathjs/docs/reference/functions/acosh.md
new file mode 100644
index 0000000..0c0604b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/acosh.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function acosh
+
+Calculate the hyperbolic arccos of a value,
+defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.acosh(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic arccosine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.acosh(1.5)       // returns 0.9624236501192069
+```
+
+
+## See also
+
+[cosh](cosh.md),
+[asinh](asinh.md),
+[atanh](atanh.md)
diff --git a/node_modules/mathjs/docs/reference/functions/acot.md b/node_modules/mathjs/docs/reference/functions/acot.md
new file mode 100644
index 0000000..40f86d8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/acot.md
@@ -0,0 +1,48 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function acot
+
+Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.acot(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | The arc cotangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.acot(0.5)           // returns number 0.4636476090008061
+math.acot(math.cot(1.5)) // returns number 1.5
+
+math.acot(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+```
+
+
+## See also
+
+[cot](cot.md),
+[atan](atan.md)
diff --git a/node_modules/mathjs/docs/reference/functions/acoth.md b/node_modules/mathjs/docs/reference/functions/acoth.md
new file mode 100644
index 0000000..6da323f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/acoth.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function acoth
+
+Calculate the hyperbolic arccotangent of a value,
+defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.acoth(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic arccotangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.acoth(0.5)       // returns 0.8047189562170503
+```
+
+
+## See also
+
+[acsch](acsch.md),
+[asech](asech.md)
diff --git a/node_modules/mathjs/docs/reference/functions/acsc.md b/node_modules/mathjs/docs/reference/functions/acsc.md
new file mode 100644
index 0000000..98a09d1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/acsc.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function acsc
+
+Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.acsc(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | The arc cosecant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.acsc(0.5)           // returns number 0.5235987755982989
+math.acsc(math.csc(1.5)) // returns number ~1.5
+
+math.acsc(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+```
+
+
+## See also
+
+[csc](csc.md),
+[asin](asin.md),
+[asec](asec.md)
diff --git a/node_modules/mathjs/docs/reference/functions/acsch.md b/node_modules/mathjs/docs/reference/functions/acsch.md
new file mode 100644
index 0000000..9735f59
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/acsch.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function acsch
+
+Calculate the hyperbolic arccosecant of a value,
+defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.acsch(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic arccosecant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.acsch(0.5)       // returns 1.4436354751788103
+```
+
+
+## See also
+
+[asech](asech.md),
+[acoth](acoth.md)
diff --git a/node_modules/mathjs/docs/reference/functions/add.md b/node_modules/mathjs/docs/reference/functions/add.md
new file mode 100644
index 0000000..051b05c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/add.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function add
+
+Add two or more values, `x + y`.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.add(x, y)
+math.add(x, y, z, ...)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | First value to add
+`y` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Second value to add
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Sum of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.add(2, 3)               // returns number 5
+math.add(2, 3, 4)            // returns number 9
+
+const a = math.complex(2, 3)
+const b = math.complex(-4, 1)
+math.add(a, b)               // returns Complex -2 + 4i
+
+math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
+
+const c = math.unit('5 cm')
+const d = math.unit('2.1 mm')
+math.add(c, d)               // returns Unit 52.1 mm
+
+math.add("2.3", "4")         // returns number 6.3
+```
+
+
+## See also
+
+[subtract](subtract.md),
+[sum](sum.md)
diff --git a/node_modules/mathjs/docs/reference/functions/and.md b/node_modules/mathjs/docs/reference/functions/and.md
new file mode 100644
index 0000000..592b013
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/and.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function and
+
+Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.and(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | First value to check
+`y` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Second value to check
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix |  Returns true when both inputs are defined with a nonzero/nonempty value.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.and(2, 4)   // returns true
+
+a = [2, 0, 0]
+b = [3, 7, 0]
+c = 0
+
+math.and(a, b)   // returns [true, false, false]
+math.and(a, c)   // returns [false, false, false]
+```
+
+
+## See also
+
+[not](not.md),
+[or](or.md),
+[xor](xor.md)
diff --git a/node_modules/mathjs/docs/reference/functions/apply.md b/node_modules/mathjs/docs/reference/functions/apply.md
new file mode 100644
index 0000000..5914def
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/apply.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function apply
+
+Apply a function that maps an array to a scalar
+along a given axis of a matrix or array.
+Returns a new matrix or array with one less dimension than the input.
+
+
+## Syntax
+
+```js
+math.apply(A, dim, callback)
+```
+
+### Where
+
+- `dim: number` is a zero-based dimension over which to concatenate the matrices.
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`array` | Array &#124; Matrix | The input Matrix
+`dim` | number | The dimension along which the callback is applied
+`callback` | Function | The callback function that is applied. This Function should take an array or 1-d matrix as an input and return a number.
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | res    The residual matrix with the function applied over some dimension.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const A = [[1, 2], [3, 4]]
+const sum = math.sum
+
+math.apply(A, 0, sum)             // returns [4, 6]
+math.apply(A, 1, sum)             // returns [3, 7]
+```
+
+
+## See also
+
+[map](map.md),
+[filter](filter.md),
+[forEach](forEach.md)
diff --git a/node_modules/mathjs/docs/reference/functions/arg.md b/node_modules/mathjs/docs/reference/functions/arg.md
new file mode 100644
index 0000000..5de1c00
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/arg.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function arg
+
+Compute the argument of a complex value.
+For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.arg(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  A complex number or array with complex numbers
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | The argument of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const a = math.complex(2, 2)
+math.arg(a) / math.pi          // returns number 0.25
+
+const b = math.complex('2 + 3i')
+math.arg(b)                    // returns number 0.982793723247329
+math.atan2(3, 2)               // returns number 0.982793723247329
+```
+
+
+## See also
+
+[re](re.md),
+[im](im.md),
+[conj](conj.md),
+[abs](abs.md)
diff --git a/node_modules/mathjs/docs/reference/functions/asec.md b/node_modules/mathjs/docs/reference/functions/asec.md
new file mode 100644
index 0000000..83f3b74
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/asec.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function asec
+
+Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.asec(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | The arc secant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.asec(0.5)           // returns 1.0471975511965979
+math.asec(math.sec(1.5)) // returns 1.5
+
+math.asec(2)             // returns 0 + 1.3169578969248166 i
+```
+
+
+## See also
+
+[acos](acos.md),
+[acot](acot.md),
+[acsc](acsc.md)
diff --git a/node_modules/mathjs/docs/reference/functions/asech.md b/node_modules/mathjs/docs/reference/functions/asech.md
new file mode 100644
index 0000000..0731b68
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/asech.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function asech
+
+Calculate the hyperbolic arcsecant of a value,
+defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.asech(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic arcsecant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.asech(0.5)       // returns 1.3169578969248166
+```
+
+
+## See also
+
+[acsch](acsch.md),
+[acoth](acoth.md)
diff --git a/node_modules/mathjs/docs/reference/functions/asin.md b/node_modules/mathjs/docs/reference/functions/asin.md
new file mode 100644
index 0000000..7d39ee8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/asin.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function asin
+
+Calculate the inverse sine of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.asin(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | The arc sine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.asin(0.5)           // returns number 0.5235987755982989
+math.asin(math.sin(1.5)) // returns number ~1.5
+
+math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+```
+
+
+## See also
+
+[sin](sin.md),
+[atan](atan.md),
+[acos](acos.md)
diff --git a/node_modules/mathjs/docs/reference/functions/asinh.md b/node_modules/mathjs/docs/reference/functions/asinh.md
new file mode 100644
index 0000000..07b06af
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/asinh.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function asinh
+
+Calculate the hyperbolic arcsine of a value,
+defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.asinh(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic arcsine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.asinh(0.5)       // returns 0.48121182505960347
+```
+
+
+## See also
+
+[acosh](acosh.md),
+[atanh](atanh.md)
diff --git a/node_modules/mathjs/docs/reference/functions/atan.md b/node_modules/mathjs/docs/reference/functions/atan.md
new file mode 100644
index 0000000..938a79e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/atan.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function atan
+
+Calculate the inverse tangent of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.atan(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | The arc tangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.atan(0.5)           // returns number 0.4636476090008061
+math.atan(math.tan(1.5)) // returns number 1.5
+
+math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+```
+
+
+## See also
+
+[tan](tan.md),
+[asin](asin.md),
+[acos](acos.md)
diff --git a/node_modules/mathjs/docs/reference/functions/atan2.md b/node_modules/mathjs/docs/reference/functions/atan2.md
new file mode 100644
index 0000000..923ba42
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/atan2.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function atan2
+
+Calculate the inverse tangent function with two arguments, y/x.
+By providing two arguments, the right quadrant of the computed angle can be
+determined.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.atan2(y, x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`y` | number &#124; Array &#124; Matrix | Second dimension
+`x` | number &#124; Array &#124; Matrix | First dimension
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; Matrix | Four-quadrant inverse tangent
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.atan2(2, 2) / math.pi       // returns number 0.25
+
+const angle = math.unit(60, 'deg') // returns Unit 60 deg
+const x = math.cos(angle)
+const y = math.sin(angle)
+
+math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+```
+
+
+## See also
+
+[tan](tan.md),
+[atan](atan.md),
+[sin](sin.md),
+[cos](cos.md)
diff --git a/node_modules/mathjs/docs/reference/functions/atanh.md b/node_modules/mathjs/docs/reference/functions/atanh.md
new file mode 100644
index 0000000..6e933c1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/atanh.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function atanh
+
+Calculate the hyperbolic arctangent of a value,
+defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.atanh(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic arctangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.atanh(0.5)       // returns 0.5493061443340549
+```
+
+
+## See also
+
+[acosh](acosh.md),
+[asinh](asinh.md)
diff --git a/node_modules/mathjs/docs/reference/functions/bellNumbers.md b/node_modules/mathjs/docs/reference/functions/bellNumbers.md
new file mode 100644
index 0000000..d594fde
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/bellNumbers.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function bellNumbers
+
+The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.
+bellNumbers only takes integer arguments.
+The following condition must be enforced: n >= 0
+
+
+## Syntax
+
+```js
+math.bellNumbers(n)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | Number &#124; BigNumber | Total number of objects in the set
+
+### Returns
+
+Type | Description
+---- | -----------
+Number &#124; BigNumber | B(n)
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.bellNumbers(3) // returns 5
+math.bellNumbers(8) // returns 4140
+```
+
+
+## See also
+
+[stirlingS2](stirlingS2.md)
diff --git a/node_modules/mathjs/docs/reference/functions/bignumber.md b/node_modules/mathjs/docs/reference/functions/bignumber.md
new file mode 100644
index 0000000..ee21838
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/bignumber.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function bignumber
+
+Create a BigNumber, which can store numbers with arbitrary precision.
+When a matrix is provided, all elements will be converted to BigNumber.
+
+
+## Syntax
+
+```js
+math.bignumber(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | number &#124; string &#124; Fraction &#124; BigNumber &#124; Array &#124; Matrix &#124; boolean &#124; null | Value for the big number, 0 by default.
+
+### Returns
+
+Type | Description
+---- | -----------
+BigNumber | The created bignumber
+
+
+## Examples
+
+```js
+0.1 + 0.2                                  // returns number 0.30000000000000004
+math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3
+
+
+7.2e500                                    // returns number Infinity
+math.bignumber('7.2e500')                  // returns BigNumber 7.2e500
+```
+
+
+## See also
+
+[boolean](boolean.md),
+[complex](complex.md),
+[index](index.md),
+[matrix](matrix.md),
+[string](string.md),
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/bin.md b/node_modules/mathjs/docs/reference/functions/bin.md
new file mode 100644
index 0000000..37a209f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/bin.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function bin
+
+Format a number as binary.
+
+
+## Syntax
+
+```js
+math.bin(value)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | number | Value to be stringified
+`wordSize` | number | Optional word size (see `format`)
+
+### Returns
+
+Type | Description
+---- | -----------
+string | The formatted value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+//the following outputs "0b10"
+math.bin(2)
+```
+
+
+## See also
+
+[oct](oct.md),
+[hex](hex.md)
diff --git a/node_modules/mathjs/docs/reference/functions/bitAnd.md b/node_modules/mathjs/docs/reference/functions/bitAnd.md
new file mode 100644
index 0000000..baab265
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/bitAnd.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function bitAnd
+
+Bitwise AND two values, `x & y`.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.bitAnd(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Array &#124; Matrix | First value to and
+`y` | number &#124; BigNumber &#124; Array &#124; Matrix | Second value to and
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | AND of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.bitAnd(53, 131)               // returns number 1
+
+math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]
+```
+
+
+## See also
+
+[bitNot](bitNot.md),
+[bitOr](bitOr.md),
+[bitXor](bitXor.md),
+[leftShift](leftShift.md),
+[rightArithShift](rightArithShift.md),
+[rightLogShift](rightLogShift.md)
diff --git a/node_modules/mathjs/docs/reference/functions/bitNot.md b/node_modules/mathjs/docs/reference/functions/bitNot.md
new file mode 100644
index 0000000..abd5eef
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/bitNot.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function bitNot
+
+Bitwise NOT value, `~x`.
+For matrices, the function is evaluated element wise.
+For units, the function is evaluated on the best prefix base.
+
+
+## Syntax
+
+```js
+math.bitNot(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Array &#124; Matrix | Value to not
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | NOT of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.bitNot(1)               // returns number -2
+
+math.bitNot([2, -3, 4])      // returns Array [-3, 2, 5]
+```
+
+
+## See also
+
+[bitAnd](bitAnd.md),
+[bitOr](bitOr.md),
+[bitXor](bitXor.md),
+[leftShift](leftShift.md),
+[rightArithShift](rightArithShift.md),
+[rightLogShift](rightLogShift.md)
diff --git a/node_modules/mathjs/docs/reference/functions/bitOr.md b/node_modules/mathjs/docs/reference/functions/bitOr.md
new file mode 100644
index 0000000..d71dcd3
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/bitOr.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function bitOr
+
+Bitwise OR two values, `x | y`.
+For matrices, the function is evaluated element wise.
+For units, the function is evaluated on the lowest print base.
+
+
+## Syntax
+
+```js
+math.bitOr(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Array &#124; Matrix | First value to or
+`y` | number &#124; BigNumber &#124; Array &#124; Matrix | Second value to or
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | OR of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.bitOr(1, 2)               // returns number 3
+
+math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]
+```
+
+
+## See also
+
+[bitAnd](bitAnd.md),
+[bitNot](bitNot.md),
+[bitXor](bitXor.md),
+[leftShift](leftShift.md),
+[rightArithShift](rightArithShift.md),
+[rightLogShift](rightLogShift.md)
diff --git a/node_modules/mathjs/docs/reference/functions/bitXor.md b/node_modules/mathjs/docs/reference/functions/bitXor.md
new file mode 100644
index 0000000..c1465b5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/bitXor.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function bitXor
+
+Bitwise XOR two values, `x ^ y`.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.bitXor(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Array &#124; Matrix | First value to xor
+`y` | number &#124; BigNumber &#124; Array &#124; Matrix | Second value to xor
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | XOR of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.bitXor(1, 2)               // returns number 3
+
+math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]
+```
+
+
+## See also
+
+[bitAnd](bitAnd.md),
+[bitNot](bitNot.md),
+[bitOr](bitOr.md),
+[leftShift](leftShift.md),
+[rightArithShift](rightArithShift.md),
+[rightLogShift](rightLogShift.md)
diff --git a/node_modules/mathjs/docs/reference/functions/boolean.md b/node_modules/mathjs/docs/reference/functions/boolean.md
new file mode 100644
index 0000000..4d87c59
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/boolean.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function boolean
+
+Create a boolean or convert a string or number to a boolean.
+In case of a number, `true` is returned for non-zero numbers, and `false` in
+case of zero.
+Strings can be `'true'` or `'false'`, or can contain a number.
+When value is a matrix, all elements will be converted to boolean.
+
+
+## Syntax
+
+```js
+math.boolean(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | string &#124; number &#124; boolean &#124; Array &#124; Matrix &#124; null | A value of any type
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix | The boolean value
+
+
+## Examples
+
+```js
+math.boolean(0)     // returns false
+math.boolean(1)     // returns true
+math.boolean(-3)     // returns true
+math.boolean('true')     // returns true
+math.boolean('false')     // returns false
+math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[complex](complex.md),
+[index](index.md),
+[matrix](matrix.md),
+[string](string.md),
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/catalan.md b/node_modules/mathjs/docs/reference/functions/catalan.md
new file mode 100644
index 0000000..3517b7d
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/catalan.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function catalan
+
+The Catalan Numbers enumerate combinatorial structures of many different types.
+catalan only takes integer arguments.
+The following condition must be enforced: n >= 0
+
+
+## Syntax
+
+```js
+math.catalan(n)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | Number &#124; BigNumber | nth Catalan number
+
+### Returns
+
+Type | Description
+---- | -----------
+Number &#124; BigNumber | Cn(n)
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.catalan(3) // returns 5
+math.catalan(8) // returns 1430
+```
+
+
+## See also
+
+[bellNumbers](bellNumbers.md)
diff --git a/node_modules/mathjs/docs/reference/functions/cbrt.md b/node_modules/mathjs/docs/reference/functions/cbrt.md
new file mode 100644
index 0000000..3a9bd40
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/cbrt.md
@@ -0,0 +1,60 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function cbrt
+
+Calculate the cubic root of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.cbrt(x)
+math.cbrt(x, allRoots)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Value for which to calculate the cubic root.
+`allRoots` | boolean | Optional, false by default. Only applicable when `x` is a number or complex number. If true, all complex roots are returned, if false (default) the principal root is returned.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Returns the cubic root of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.cbrt(27)                  // returns 3
+math.cube(3)                   // returns 27
+math.cbrt(-64)                 // returns -4
+math.cbrt(math.unit('27 m^3')) // returns Unit 3 m
+math.cbrt([27, 64, 125])       // returns [3, 4, 5]
+
+const x = math.complex('8i')
+math.cbrt(x)                   // returns Complex 1.7320508075689 + i
+math.cbrt(x, true)             // returns Matrix [
+                                //    1.7320508075689 + i
+                                //   -1.7320508075689 + i
+                                //   -2i
+                                // ]
+```
+
+
+## See also
+
+[square](square.md),
+[sqrt](sqrt.md),
+[cube](cube.md)
diff --git a/node_modules/mathjs/docs/reference/functions/ceil.md b/node_modules/mathjs/docs/reference/functions/ceil.md
new file mode 100644
index 0000000..f8eb6ee
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/ceil.md
@@ -0,0 +1,63 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function ceil
+
+Round a value towards plus infinity
+If `x` is complex, both real and imaginary part are rounded towards plus infinity.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.ceil(x)
+math.ceil(x, n)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Number to be rounded
+`n` | number &#124; BigNumber &#124; Array | Number of decimals Default value: 0.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Rounded value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.ceil(3.2)               // returns number 4
+math.ceil(3.8)               // returns number 4
+math.ceil(-4.2)              // returns number -4
+math.ceil(-4.7)              // returns number -4
+
+math.ceil(3.212, 2)          // returns number 3.22
+math.ceil(3.288, 2)          // returns number 3.29
+math.ceil(-4.212, 2)         // returns number -4.21
+math.ceil(-4.782, 2)         // returns number -4.78
+
+const c = math.complex(3.24, -2.71)
+math.ceil(c)                 // returns Complex 4 - 2i
+math.ceil(c, 1)              // returns Complex 3.3 - 2.7i
+
+math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]
+math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]
+```
+
+
+## See also
+
+[floor](floor.md),
+[fix](fix.md),
+[round](round.md)
diff --git a/node_modules/mathjs/docs/reference/functions/chain.md b/node_modules/mathjs/docs/reference/functions/chain.md
new file mode 100644
index 0000000..2feda68
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/chain.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function chain
+
+Wrap any value in a chain, allowing to perform chained operations on
+the value.
+
+All methods available in the math.js library can be called upon the chain,
+and then will be evaluated with the value itself as first argument.
+The chain can be closed by executing `chain.done()`, which returns
+the final value.
+
+The chain has a number of special functions:
+
+- `done()`     Finalize the chain and return the chain's value.
+- `valueOf()`  The same as `done()`
+- `toString()` Executes `math.format()` onto the chain's value, returning
+               a string representation of the value.
+
+
+## Syntax
+
+```js
+math.chain(value)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | * | A value of any type on which to start a chained operation.
+
+### Returns
+
+Type | Description
+---- | -----------
+math.Chain | The created chain
+
+
+## Examples
+
+```js
+math.chain(3)
+    .add(4)
+    .subtract(2)
+    .done()     // 5
+
+math.chain( [[1, 2], [3, 4]] )
+    .subset(math.index(0, 0), 8)
+    .multiply(3)
+    .done()     // [[24, 6], [9, 12]]
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/clone.md b/node_modules/mathjs/docs/reference/functions/clone.md
new file mode 100644
index 0000000..8d4a0b3
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/clone.md
@@ -0,0 +1,43 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function clone
+
+Clone an object. Will make a deep copy of the data.
+
+
+## Syntax
+
+```js
+math.clone(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | * | Object to be cloned
+
+### Returns
+
+Type | Description
+---- | -----------
+* | A clone of object x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.clone(3.5)                   // returns number 3.5
+math.clone(math.complex('2-4i') // returns Complex 2 - 4i
+math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg
+math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]
+math.clone("hello world")         // returns string "hello world"
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/column.md b/node_modules/mathjs/docs/reference/functions/column.md
new file mode 100644
index 0000000..e96d3f5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/column.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function column
+
+Return a column from a Matrix.
+
+
+## Syntax
+
+```js
+math.column(value, index)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | Array &#124; Matrix | An array or matrix
+`column` | number | The index of the column
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The retrieved column
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// get a column
+const d = [[1, 2], [3, 4]]
+math.column(d, 1) // returns [[2], [4]]
+```
+
+
+## See also
+
+[row](row.md)
diff --git a/node_modules/mathjs/docs/reference/functions/combinations.md b/node_modules/mathjs/docs/reference/functions/combinations.md
new file mode 100644
index 0000000..08174f8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/combinations.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function combinations
+
+Compute the number of ways of picking `k` unordered outcomes from `n`
+possibilities.
+
+Combinations only takes integer arguments.
+The following condition must be enforced: k <= n.
+
+
+## Syntax
+
+```js
+math.combinations(n, k)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | number &#124; BigNumber | Total number of objects in the set
+`k` | number &#124; BigNumber | Number of objects in the subset
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber | Number of possible combinations.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.combinations(7, 5) // returns 21
+```
+
+
+## See also
+
+[combinationsWithRep](combinationsWithRep.md),
+[permutations](permutations.md),
+[factorial](factorial.md)
diff --git a/node_modules/mathjs/docs/reference/functions/combinationsWithRep.md b/node_modules/mathjs/docs/reference/functions/combinationsWithRep.md
new file mode 100644
index 0000000..13fad3b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/combinationsWithRep.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function combinationsWithRep
+
+Compute the number of ways of picking `k` unordered outcomes from `n`
+possibilities, allowing individual outcomes to be repeated more than once.
+
+CombinationsWithRep only takes integer arguments.
+The following condition must be enforced: k <= n + k -1.
+
+
+## Syntax
+
+```js
+math.combinationsWithRep(n, k)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | number &#124; BigNumber | Total number of objects in the set
+`k` | number &#124; BigNumber | Number of objects in the subset
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber | Number of possible combinations with replacement.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.combinationsWithRep(7, 5) // returns 462
+```
+
+
+## See also
+
+[combinations](combinations.md),
+[permutations](permutations.md),
+[factorial](factorial.md)
diff --git a/node_modules/mathjs/docs/reference/functions/compare.md b/node_modules/mathjs/docs/reference/functions/compare.md
new file mode 100644
index 0000000..027928d
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/compare.md
@@ -0,0 +1,67 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function compare
+
+Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+
+x and y are considered equal when the relative difference between x and y
+is smaller than the configured epsilon. The function cannot be used to
+compare values smaller than approximately 2.22e-16.
+
+For matrices, the function is evaluated element wise.
+Strings are compared by their numerical value.
+
+
+## Syntax
+
+```js
+math.compare(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Unit &#124; string &#124; Array &#124; Matrix | First value to compare
+`y` | number &#124; BigNumber &#124; Fraction &#124; Unit &#124; string &#124; Array &#124; Matrix | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Array &#124; Matrix | Returns the result of the comparison: 1 when x > y, -1 when x < y, and 0 when x == y.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.compare(6, 1)           // returns 1
+math.compare(2, 3)           // returns -1
+math.compare(7, 7)           // returns 0
+math.compare('10', '2')      // returns 1
+math.compare('1000', '1e3')  // returns 0
+
+const a = math.unit('5 cm')
+const b = math.unit('40 mm')
+math.compare(a, b)           // returns 1
+
+math.compare(2, [1, 2, 3])   // returns [1, 0, -1]
+```
+
+
+## See also
+
+[equal](equal.md),
+[unequal](unequal.md),
+[smaller](smaller.md),
+[smallerEq](smallerEq.md),
+[larger](larger.md),
+[largerEq](largerEq.md),
+[compareNatural](compareNatural.md),
+[compareText](compareText.md)
diff --git a/node_modules/mathjs/docs/reference/functions/compareNatural.md b/node_modules/mathjs/docs/reference/functions/compareNatural.md
new file mode 100644
index 0000000..cd26c43
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/compareNatural.md
@@ -0,0 +1,92 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function compareNatural
+
+Compare two values of any type in a deterministic, natural way.
+
+For numeric values, the function works the same as `math.compare`.
+For types of values that can't be compared mathematically,
+the function compares in a natural way.
+
+For numeric values, x and y are considered equal when the relative
+difference between x and y is smaller than the configured epsilon.
+The function cannot be used to compare values smaller than
+approximately 2.22e-16.
+
+For Complex numbers, first the real parts are compared. If equal,
+the imaginary parts are compared.
+
+Strings are compared with a natural sorting algorithm, which
+orders strings in a "logic" way following some heuristics.
+This differs from the function `compare`, which converts the string
+into a numeric value and compares that. The function `compareText`
+on the other hand compares text lexically.
+
+Arrays and Matrices are compared value by value until there is an
+unequal pair of values encountered. Objects are compared by sorted
+keys until the keys or their values are unequal.
+
+
+## Syntax
+
+```js
+math.compareNatural(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | * | First value to compare
+`y` | * | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+number | Returns the result of the comparison: 1 when x > y, -1 when x < y, and 0 when x == y.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.compareNatural(6, 1)              // returns 1
+math.compareNatural(2, 3)              // returns -1
+math.compareNatural(7, 7)              // returns 0
+
+math.compareNatural('10', '2')         // returns 1
+math.compareText('10', '2')            // returns -1
+math.compare('10', '2')                // returns 1
+
+math.compareNatural('Answer: 10', 'Answer: 2') // returns 1
+math.compareText('Answer: 10', 'Answer: 2')    // returns -1
+math.compare('Answer: 10', 'Answer: 2')
+    // Error: Cannot convert "Answer: 10" to a number
+
+const a = math.unit('5 cm')
+const b = math.unit('40 mm')
+math.compareNatural(a, b)              // returns 1
+
+const c = math.complex('2 + 3i')
+const d = math.complex('2 + 4i')
+math.compareNatural(c, d)              // returns -1
+
+math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1
+math.compareNatural([1, 2, 3], [1, 2])    // returns 1
+math.compareNatural([1, 5], [1, 2, 3])    // returns 1
+math.compareNatural([1, 2], [1, 2])       // returns 0
+
+math.compareNatural({a: 2}, {a: 4})       // returns -1
+```
+
+
+## See also
+
+[compare](compare.md),
+[compareText](compareText.md)
diff --git a/node_modules/mathjs/docs/reference/functions/compareText.md b/node_modules/mathjs/docs/reference/functions/compareText.md
new file mode 100644
index 0000000..8d54ff0
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/compareText.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function compareText
+
+Compare two strings lexically. Comparison is case sensitive.
+Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.compareText(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | string &#124; Array &#124; DenseMatrix | First string to compare
+`y` | string &#124; Array &#124; DenseMatrix | Second string to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; DenseMatrix | Returns the result of the comparison: 1 when x > y, -1 when x < y, and 0 when x == y.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.compareText('B', 'A')     // returns 1
+math.compareText('2', '10')    // returns 1
+math.compare('2', '10')        // returns -1
+math.compareNatural('2', '10') // returns -1
+
+math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]
+```
+
+
+## See also
+
+[equal](equal.md),
+[equalText](equalText.md),
+[compare](compare.md),
+[compareNatural](compareNatural.md)
diff --git a/node_modules/mathjs/docs/reference/functions/compile.md b/node_modules/mathjs/docs/reference/functions/compile.md
new file mode 100644
index 0000000..e3dbf84
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/compile.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function compile
+
+Parse and compile an expression.
+Returns a an object with a function `evaluate([scope])` to evaluate the
+compiled expression.
+
+
+## Syntax
+
+```js
+math.compile(expr)                       // returns one node
+math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr` | string &#124; string[] &#124; Array &#124; Matrix |  The expression to be compiled
+
+### Returns
+
+Type | Description
+---- | -----------
+{evaluate: Function} &#124; Array.&lt;{evaluate: Function}&gt; | code An object with the compiled expression
+
+
+### Throws
+
+Type | Description
+---- | -----------
+Error | 
+
+## Examples
+
+```js
+const code1 = math.compile('sqrt(3^2 + 4^2)')
+code1.evaluate() // 5
+
+let scope = {a: 3, b: 4}
+const code2 = math.compile('a * b') // 12
+code2.evaluate(scope) // 12
+scope.a = 5
+code2.evaluate(scope) // 20
+
+const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])
+nodes[2].evaluate() // 12
+```
+
+
+## See also
+
+[parse](parse.md),
+[evaluate](evaluate.md)
diff --git a/node_modules/mathjs/docs/reference/functions/complex.md b/node_modules/mathjs/docs/reference/functions/complex.md
new file mode 100644
index 0000000..ee28aa9
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/complex.md
@@ -0,0 +1,17 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function complex
+
+
+
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`arr` | number[][] | the matrix to find eigenvalues of
+`N` | number | size of the matrix
+`prec` | number &#124; BigNumber | precision, anything lower will be considered zero
+`type` | 'number' &#124; 'BigNumber' &#124; 'Complex' | 
+`findVectors` | boolean | should we find eigenvectors?
+
diff --git a/node_modules/mathjs/docs/reference/functions/composition.md b/node_modules/mathjs/docs/reference/functions/composition.md
new file mode 100644
index 0000000..33f81f8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/composition.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function composition
+
+The composition counts of n into k parts.
+
+composition only takes integer arguments.
+The following condition must be enforced: k <= n.
+
+
+## Syntax
+
+```js
+math.composition(n, k)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | Number &#124; BigNumber | Total number of objects in the set
+`k` | Number &#124; BigNumber | Number of objects in the subset
+
+### Returns
+
+Type | Description
+---- | -----------
+Number &#124; BigNumber | Returns the composition counts of n into k parts.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.composition(5, 3) // returns 6
+```
+
+
+## See also
+
+[combinations](combinations.md)
diff --git a/node_modules/mathjs/docs/reference/functions/concat.md b/node_modules/mathjs/docs/reference/functions/concat.md
new file mode 100644
index 0000000..0b90d85
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/concat.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function concat
+
+Concatenate two or more matrices.
+
+
+## Syntax
+
+```js
+math.concat(A, B, C, ...)
+math.concat(A, B, C, ..., dim)
+```
+
+### Where
+
+- `dim: number` is a zero-based dimension over which to concatenate the matrices.
+  By default the last dimension of the matrices.
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... Array &#124; Matrix | Two or more matrices
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | Concatenated matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const A = [[1, 2], [5, 6]]
+const B = [[3, 4], [7, 8]]
+
+math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]
+math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]
+math.concat('hello', ' ', 'world') // returns 'hello world'
+```
+
+
+## See also
+
+[size](size.md),
+[squeeze](squeeze.md),
+[subset](subset.md),
+[transpose](transpose.md)
diff --git a/node_modules/mathjs/docs/reference/functions/config.md b/node_modules/mathjs/docs/reference/functions/config.md
new file mode 100644
index 0000000..236115e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/config.md
@@ -0,0 +1,44 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function config
+
+Set configuration options for math.js, and get current options.
+Will emit a 'config' event, with arguments (curr, prev, changes).
+
+This function is only available on a mathjs instance created using `create`.
+
+
+## Syntax
+
+```js
+math.config(config: Object): Object
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`options` | Object | Available options: {number} epsilon Minimum relative difference between two compared values, used by all comparison functions. {string} matrix A string 'Matrix' (default) or 'Array'. {string} number A string 'number' (default), 'BigNumber', or 'Fraction' {number} precision The number of significant digits for BigNumbers. Not applicable for Numbers. {string} parenthesis How to display parentheses in LaTeX and string output. {string} randomSeed Random seed for seeded pseudo random number generator. Set to null to randomly seed.
+
+### Returns
+
+Type | Description
+---- | -----------
+Object | Returns the current configuration
+
+
+## Examples
+
+```js
+import { create, all } from 'mathjs'
+
+// create a mathjs instance
+const math = create(all)
+
+math.config().number                // outputs 'number'
+math.evaluate('0.4')                // outputs number 0.4
+math.config({number: 'Fraction'})
+math.evaluate('0.4')                // outputs Fraction 2/5
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/conj.md b/node_modules/mathjs/docs/reference/functions/conj.md
new file mode 100644
index 0000000..aa874a2
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/conj.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function conj
+
+Compute the complex conjugate of a complex value.
+If `x = a+bi`, the complex conjugate of `x` is `a - bi`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.conj(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  A complex number or array with complex numbers
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  The complex conjugate of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i
+math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i
+math.conj(math.complex('-5.2i'))  // returns Complex 5.2i
+```
+
+
+## See also
+
+[re](re.md),
+[im](im.md),
+[arg](arg.md),
+[abs](abs.md)
diff --git a/node_modules/mathjs/docs/reference/functions/cos.md b/node_modules/mathjs/docs/reference/functions/cos.md
new file mode 100644
index 0000000..f6df69e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/cos.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function cos
+
+Calculate the cosine of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.cos(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Cosine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.cos(2)                      // returns number -0.4161468365471422
+math.cos(math.pi / 4)            // returns number  0.7071067811865475
+math.cos(math.unit(180, 'deg'))  // returns number -1
+math.cos(math.unit(60, 'deg'))   // returns number  0.5
+
+const angle = 0.2
+math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
+```
+
+
+## See also
+
+[cos](cos.md),
+[tan](tan.md)
diff --git a/node_modules/mathjs/docs/reference/functions/cosh.md b/node_modules/mathjs/docs/reference/functions/cosh.md
new file mode 100644
index 0000000..6cb014b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/cosh.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function cosh
+
+Calculate the hyperbolic cosine of a value,
+defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.cosh(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Hyperbolic cosine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.cosh(0.5)       // returns number 1.1276259652063807
+```
+
+
+## See also
+
+[sinh](sinh.md),
+[tanh](tanh.md)
diff --git a/node_modules/mathjs/docs/reference/functions/cot.md b/node_modules/mathjs/docs/reference/functions/cot.md
new file mode 100644
index 0000000..0f4bb81
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/cot.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function cot
+
+Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.cot(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Cotangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.cot(2)      // returns number -0.45765755436028577
+1 / math.tan(2)  // returns number -0.45765755436028577
+```
+
+
+## See also
+
+[tan](tan.md),
+[sec](sec.md),
+[csc](csc.md)
diff --git a/node_modules/mathjs/docs/reference/functions/coth.md b/node_modules/mathjs/docs/reference/functions/coth.md
new file mode 100644
index 0000000..2f73056
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/coth.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function coth
+
+Calculate the hyperbolic cotangent of a value,
+defined as `coth(x) = 1 / tanh(x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.coth(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic cotangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// coth(x) = 1 / tanh(x)
+math.coth(2)         // returns 1.0373147207275482
+1 / math.tanh(2)     // returns 1.0373147207275482
+```
+
+
+## See also
+
+[sinh](sinh.md),
+[tanh](tanh.md),
+[cosh](cosh.md)
diff --git a/node_modules/mathjs/docs/reference/functions/count.md b/node_modules/mathjs/docs/reference/functions/count.md
new file mode 100644
index 0000000..86078c0
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/count.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function count
+
+Count the number of elements of a matrix, array or string.
+
+
+## Syntax
+
+```js
+math.count(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | string &#124; Array &#124; Matrix | A matrix or string
+
+### Returns
+
+Type | Description
+---- | -----------
+number | An integer with the elements in `x`.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.count('hello world')        // returns 11
+const A = [[1, 2, 3], [4, 5, 6]]
+math.count(A)                    // returns 6
+math.count(math.range(1,6))      // returns 5
+```
+
+
+## See also
+
+[size](size.md)
diff --git a/node_modules/mathjs/docs/reference/functions/createUnit.md b/node_modules/mathjs/docs/reference/functions/createUnit.md
new file mode 100644
index 0000000..1c8e2a9
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/createUnit.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function createUnit
+
+Create a user-defined unit and register it with the Unit type.
+
+
+## Syntax
+
+```js
+math.createUnit({
+  baseUnit1: {
+    aliases: [string, ...]
+    prefixes: object
+  },
+  unit2: {
+    definition: string,
+    aliases: [string, ...]
+    prefixes: object,
+    offset: number
+  },
+  unit3: string    // Shortcut
+})
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`name` | string | The name of the new unit. Must be unique. Example: 'knot'
+`definition` | string, Unit | Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.
+`options` | Object | (optional) An object containing any of the following properties:</br>- `prefixes {string}` "none", "short", "long", "binary_short", or "binary_long". The default is "none".</br>- `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']</br>- `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.
+
+### Returns
+
+Type | Description
+---- | -----------
+Unit | The new unit
+
+
+## Examples
+
+```js
+math.createUnit('foo')
+math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})
+math.createUnit('mph', '1 mile/hour')
+```
+
+
+## See also
+
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/cross.md b/node_modules/mathjs/docs/reference/functions/cross.md
new file mode 100644
index 0000000..4822da0
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/cross.md
@@ -0,0 +1,58 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function cross
+
+Calculate the cross product for two vectors in three dimensional space.
+The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined
+as:
+
+   cross(A, B) = [
+     a2 * b3 - a3 * b2,
+     a3 * b1 - a1 * b3,
+     a1 * b2 - a2 * b1
+   ]
+
+If one of the input vectors has a dimension greater than 1, the output
+vector will be a 1x3 (2-dimensional) matrix.
+
+
+## Syntax
+
+```js
+math.cross(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | First vector
+`y` | Array &#124; Matrix | Second vector
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | Returns the cross product of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]
+math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]
+math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]
+math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]
+```
+
+
+## See also
+
+[dot](dot.md),
+[multiply](multiply.md)
diff --git a/node_modules/mathjs/docs/reference/functions/csc.md b/node_modules/mathjs/docs/reference/functions/csc.md
new file mode 100644
index 0000000..507c6c1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/csc.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function csc
+
+Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.csc(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Cosecant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.csc(2)      // returns number 1.099750170294617
+1 / math.sin(2)  // returns number 1.099750170294617
+```
+
+
+## See also
+
+[sin](sin.md),
+[sec](sec.md),
+[cot](cot.md)
diff --git a/node_modules/mathjs/docs/reference/functions/csch.md b/node_modules/mathjs/docs/reference/functions/csch.md
new file mode 100644
index 0000000..18a89c3
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/csch.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function csch
+
+Calculate the hyperbolic cosecant of a value,
+defined as `csch(x) = 1 / sinh(x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.csch(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic cosecant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// csch(x) = 1/ sinh(x)
+math.csch(0.5)       // returns 1.9190347513349437
+1 / math.sinh(0.5)   // returns 1.9190347513349437
+```
+
+
+## See also
+
+[sinh](sinh.md),
+[sech](sech.md),
+[coth](coth.md)
diff --git a/node_modules/mathjs/docs/reference/functions/ctranspose.md b/node_modules/mathjs/docs/reference/functions/ctranspose.md
new file mode 100644
index 0000000..ac9c94e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/ctranspose.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function ctranspose
+
+Transpose and complex conjugate a matrix. All values of the matrix are
+reflected over its main diagonal and then the complex conjugate is
+taken. This is equivalent to complex conjugation for scalars and
+vectors.
+
+
+## Syntax
+
+```js
+math.ctranspose(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | Matrix to be ctransposed
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The ctransposed matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]
+math.ctranspose(A)               // returns [[1, 4], [2, 5], [3, {re:6,im:7}]]
+```
+
+
+## See also
+
+[transpose](transpose.md),
+[diag](diag.md),
+[inv](inv.md),
+[subset](subset.md),
+[squeeze](squeeze.md)
diff --git a/node_modules/mathjs/docs/reference/functions/cube.md b/node_modules/mathjs/docs/reference/functions/cube.md
new file mode 100644
index 0000000..883310c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/cube.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function cube
+
+Compute the cube of a value, `x * x * x`.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.cube(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit | Number for which to calculate the cube
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit | Cube of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.cube(2)            // returns number 8
+math.pow(2, 3)          // returns number 8
+math.cube(4)            // returns number 64
+4 * 4 * 4               // returns number 64
+
+math.cube([1, 2, 3, 4]) // returns Array [1, 8, 27, 64]
+```
+
+
+## See also
+
+[multiply](multiply.md),
+[square](square.md),
+[pow](pow.md),
+[cbrt](cbrt.md)
diff --git a/node_modules/mathjs/docs/reference/functions/cumsum.md b/node_modules/mathjs/docs/reference/functions/cumsum.md
new file mode 100644
index 0000000..aca34ef
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/cumsum.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function cumsum
+
+Compute the cumulative sum of a matrix or a list with values.
+In case of a (multi dimensional) array or matrix, the cumulative sums
+along a specified dimension (defaulting to the first) will be calculated.
+
+
+## Syntax
+
+```js
+math.cumsum(a, b, c, ...)
+math.cumsum(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix or or multiple scalar values
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The cumulative sum of all values
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]
+math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]
+math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]
+math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]
+math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]
+math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]
+```
+
+
+## See also
+
+[mean](mean.md),
+[median](median.md),
+[min](min.md),
+[max](max.md),
+[prod](prod.md),
+[std](std.md),
+[variance](variance.md),
+[sum](sum.md)
diff --git a/node_modules/mathjs/docs/reference/functions/deepEqual.md b/node_modules/mathjs/docs/reference/functions/deepEqual.md
new file mode 100644
index 0000000..47b33b2
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/deepEqual.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function deepEqual
+
+Test element wise whether two matrices are equal.
+The function accepts both matrices and scalar values.
+
+Strings are compared by their numerical value.
+
+
+## Syntax
+
+```js
+math.deepEqual(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | First matrix to compare
+`y` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Second matrix to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Returns true when the input matrices have the same size and each of their elements is equal.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.deepEqual(2, 4)   // returns false
+
+a = [2, 5, 1]
+b = [2, 7, 1]
+
+math.deepEqual(a, b)   // returns false
+math.equal(a, b)       // returns [true, false, true]
+```
+
+
+## See also
+
+[equal](equal.md),
+[unequal](unequal.md)
diff --git a/node_modules/mathjs/docs/reference/functions/derivative.md b/node_modules/mathjs/docs/reference/functions/derivative.md
new file mode 100644
index 0000000..1c84f69
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/derivative.md
@@ -0,0 +1,61 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function derivative
+
+Takes the derivative of an expression expressed in parser Nodes.
+The derivative will be taken over the supplied variable in the
+second parameter. If there are multiple variables in the expression,
+it will return a partial derivative.
+
+This uses rules of differentiation which can be found here:
+
+- [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)
+
+
+## Syntax
+
+```js
+derivative(expr, variable)
+derivative(expr, variable, options)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr` | Node &#124; string | The expression to differentiate
+`variable` | SymbolNode &#124; string | The variable over which to differentiate
+`options` | {simplify: boolean} |  There is one option available, `simplify`, which is true by default. When false, output will not be simplified.
+
+### Returns
+
+Type | Description
+---- | -----------
+ConstantNode &#124; SymbolNode &#124; ParenthesisNode &#124; FunctionNode &#124; OperatorNode | The derivative of `expr`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.derivative('x^2', 'x')                     // Node {2 * x}
+math.derivative('x^2', 'x', {simplify: false})  // Node {2 * 1 * x ^ (2 - 1)
+math.derivative('sin(2x)', 'x'))                // Node {2 * cos(2 * x)}
+math.derivative('2*x', 'x').evaluate()          // number 2
+math.derivative('x^2', 'x').evaluate({x: 4})    // number 8
+const f = math.parse('x^2')
+const x = math.parse('x')
+math.derivative(f, x)                           // Node {2 * x}
+```
+
+
+## See also
+
+[simplify](simplify.md),
+[parse](parse.md),
+[evaluate](evaluate.md)
diff --git a/node_modules/mathjs/docs/reference/functions/det.md b/node_modules/mathjs/docs/reference/functions/det.md
new file mode 100644
index 0000000..44f269a
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/det.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function det
+
+Calculate the determinant of a matrix.
+
+
+## Syntax
+
+```js
+math.det(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | A matrix
+
+### Returns
+
+Type | Description
+---- | -----------
+number | The determinant of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.det([[1, 2], [3, 4]]) // returns -2
+
+const A = [
+  [-2, 2, 3],
+  [-1, 1, 3],
+  [2, 0, -1]
+]
+math.det(A) // returns 6
+```
+
+
+## See also
+
+[inv](inv.md)
diff --git a/node_modules/mathjs/docs/reference/functions/diag.md b/node_modules/mathjs/docs/reference/functions/diag.md
new file mode 100644
index 0000000..52a67ce
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/diag.md
@@ -0,0 +1,61 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function diag
+
+Create a diagonal matrix or retrieve the diagonal of a matrix
+
+When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.
+When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.
+When k is positive, the values are placed on the super diagonal.
+When k is negative, the values are placed on the sub diagonal.
+
+
+## Syntax
+
+```js
+math.diag(X)
+math.diag(X, format)
+math.diag(X, k)
+math.diag(X, k, format)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | A two dimensional matrix or a vector
+`k` | number &#124; BigNumber | The diagonal where the vector will be filled in or retrieved. Default value: 0.
+`format` | string | The matrix storage format. Default value: 'dense'.
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix &#124; Array | Diagonal matrix from input vector, or diagonal from input matrix.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+ // create a diagonal matrix
+ math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]
+ math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]
+ math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]
+
+// retrieve the diagonal from a matrix
+const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
+math.diag(a)   // returns [1, 5, 9]
+```
+
+
+## See also
+
+[ones](ones.md),
+[zeros](zeros.md),
+[identity](identity.md)
diff --git a/node_modules/mathjs/docs/reference/functions/diff.md b/node_modules/mathjs/docs/reference/functions/diff.md
new file mode 100644
index 0000000..69f1338
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/diff.md
@@ -0,0 +1,70 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function diff
+
+Create a new matrix or array of the difference between elements of the given array
+The optional dim parameter lets you specify the dimension to evaluate the difference of
+If no dimension parameter is passed it is assumed as dimension 0
+
+Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber
+Arrays must be 'rectangular' meaning arrays like [1, 2]
+If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays
+
+
+## Syntax
+
+```js
+math.diff(arr)
+math.diff(arr, dim)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`arr` | Array &#124; Matrix | An array or matrix
+`dim` | number | Dimension
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | Difference between array elements in given dimension
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const arr = [1, 2, 4, 7, 0]
+math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)
+math.diff(math.matrix(arr)) // returns math.matrix([1, 2, 3, -7])
+
+const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]
+math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+
+math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3
+math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed
+
+// These will all produce the same result
+math.diff([[1, 2], [3, 4]])
+math.diff([math.matrix([1, 2]), math.matrix([3, 4])])
+math.diff([[1, 2], math.matrix([3, 4])])
+math.diff([math.matrix([1, 2]), [3, 4]])
+// They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix
+```
+
+
+## See also
+
+[sum](sum.md),
+[subtract](subtract.md),
+[partitionSelect](partitionSelect.md)
diff --git a/node_modules/mathjs/docs/reference/functions/distance.md b/node_modules/mathjs/docs/reference/functions/distance.md
new file mode 100644
index 0000000..d69dfe8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/distance.md
@@ -0,0 +1,80 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function distance
+
+Calculates:
+   The eucledian distance between two points in N-dimensional spaces.
+   Distance between point and a line in 2 and 3 dimensional spaces.
+   Pairwise distance between a set of 2D or 3D points
+NOTE:
+   When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c
+   For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)
+
+
+## Syntax
+
+```js
+math.distance([x1, y1], [x2, y2])
+ math.distance({pointOneX: 4, pointOneY: 5}, {pointTwoX: 2, pointTwoY: 7})
+math.distance([x1, y1, z1], [x2, y2, z2])
+math.distance({pointOneX: 4, pointOneY: 5, pointOneZ: 8}, {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})
+math.distance([x1, y1, ... , N1], [x2, y2, ... , N2])
+math.distance([[A], [B], [C]...])
+math.distance([x1, y1], [LinePtX1, LinePtY1], [LinePtX2, LinePtY2])
+math.distance({pointX: 1, pointY: 4}, {lineOnePtX: 6, lineOnePtY: 3}, {lineTwoPtX: 2, lineTwoPtY: 8})
+math.distance([x1, y1, z1], [LinePtX1, LinePtY1, LinePtZ1], [LinePtX2, LinePtY2, LinePtZ2])
+math.distance({pointX: 1, pointY: 4, pointZ: 7}, {lineOnePtX: 6, lineOnePtY: 3, lineOnePtZ: 4}, {lineTwoPtX: 2, lineTwoPtY: 8, lineTwoPtZ: 5})
+math.distance([x1, y1], [xCoeffLine, yCoeffLine, constant])
+math.distance({pointX: 10, pointY: 10}, {xCoeffLine: 8, yCoeffLine: 1, constant: 3})
+math.distance([x1, y1, z1], [x0, y0, z0, a-tCoeff, b-tCoeff, c-tCoeff]) point and parametric equation of 3D line
+math.distance([x, y, z], [x0, y0, z0, a, b, c])
+math.distance({pointX: 2, pointY: 5, pointZ: 9}, {x0: 4, y0: 6, z0: 3, a: 4, b: 2, c: 0})
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix &#124; Object | Co-ordinates of first point
+`y` | Array &#124; Matrix &#124; Object | Co-ordinates of second point
+
+### Returns
+
+Type | Description
+---- | -----------
+Number &#124; BigNumber | Returns the distance from two/three points
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.distance([0,0], [4,4])                     // Returns 5.6569
+math.distance(
+ {pointOneX: 0, pointOneY: 0},
+ {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951
+math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.74166
+math.distance(
+ {pointOneX: 4, pointOneY: 5, pointOneZ: 8},
+ {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3
+math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2
+math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]
+math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]
+math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387
+math.distance([10, 10], [2, 3], [-8, 0])        // Returns 8.759953130362847
+math.distance(
+ {pointX: 1, pointY: 4},
+ {lineOnePtX: 6, lineOnePtY: 3},
+ {lineTwoPtX: 2, lineTwoPtY: 8})                // Returns 2.720549372624744
+math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857
+math.distance(
+ {pointX: 2, pointY: 3, pointZ: 1},
+ {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1}        // Returns 2.3204774044612857
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/divide.md b/node_modules/mathjs/docs/reference/functions/divide.md
new file mode 100644
index 0000000..836c9d1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/divide.md
@@ -0,0 +1,55 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function divide
+
+Divide two values, `x / y`.
+To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.
+
+
+## Syntax
+
+```js
+math.divide(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Numerator
+`y` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Denominator
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Quotient, `x / y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.divide(2, 3)            // returns number 0.6666666666666666
+
+const a = math.complex(5, 14)
+const b = math.complex(4, 1)
+math.divide(a, b)            // returns Complex 2 + 3i
+
+const c = [[7, -6], [13, -4]]
+const d = [[1, 2], [4, 3]]
+math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]
+
+const e = math.unit('18 km')
+math.divide(e, 4.5)          // returns Unit 4 km
+```
+
+
+## See also
+
+[multiply](multiply.md)
diff --git a/node_modules/mathjs/docs/reference/functions/dot.md b/node_modules/mathjs/docs/reference/functions/dot.md
new file mode 100644
index 0000000..4a7c96a
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/dot.md
@@ -0,0 +1,48 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function dot
+
+Calculate the dot product of two vectors. The dot product of
+`A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:
+
+   dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn
+
+
+## Syntax
+
+```js
+math.dot(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | First vector
+`y` | Array &#124; Matrix | Second vector
+
+### Returns
+
+Type | Description
+---- | -----------
+number | Returns the dot product of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.dot([2, 4, 1], [2, 2, 3])       // returns number 15
+math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15
+```
+
+
+## See also
+
+[multiply](multiply.md),
+[cross](cross.md)
diff --git a/node_modules/mathjs/docs/reference/functions/dotDivide.md b/node_modules/mathjs/docs/reference/functions/dotDivide.md
new file mode 100644
index 0000000..d250bbd
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/dotDivide.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function dotDivide
+
+Divide two matrices element wise. The function accepts both matrices and
+scalar values.
+
+
+## Syntax
+
+```js
+math.dotDivide(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Numerator
+`y` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Denominator
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Quotient, `x ./ y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.dotDivide(2, 4)   // returns 0.5
+
+a = [[9, 5], [6, 1]]
+b = [[3, 2], [5, 2]]
+
+math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]
+math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]
+```
+
+
+## See also
+
+[divide](divide.md),
+[multiply](multiply.md),
+[dotMultiply](dotMultiply.md)
diff --git a/node_modules/mathjs/docs/reference/functions/dotMultiply.md b/node_modules/mathjs/docs/reference/functions/dotMultiply.md
new file mode 100644
index 0000000..2d99eaa
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/dotMultiply.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function dotMultiply
+
+Multiply two matrices element wise. The function accepts both matrices and
+scalar values.
+
+
+## Syntax
+
+```js
+math.dotMultiply(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Left hand value
+`y` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Right hand value
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Multiplication of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.dotMultiply(2, 4) // returns 8
+
+a = [[9, 5], [6, 1]]
+b = [[3, 2], [5, 2]]
+
+math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]
+math.multiply(a, b)    // returns [[52, 28], [23, 14]]
+```
+
+
+## See also
+
+[multiply](multiply.md),
+[divide](divide.md),
+[dotDivide](dotDivide.md)
diff --git a/node_modules/mathjs/docs/reference/functions/dotPow.md b/node_modules/mathjs/docs/reference/functions/dotPow.md
new file mode 100644
index 0000000..7447649
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/dotPow.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function dotPow
+
+Calculates the power of x to y element wise.
+
+
+## Syntax
+
+```js
+math.dotPow(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | The base
+`y` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | The exponent
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | The value of `x` to the power `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.dotPow(2, 3)            // returns number 8
+
+const a = [[1, 2], [4, 3]]
+math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]
+math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]
+```
+
+
+## See also
+
+[pow](pow.md),
+[sqrt](sqrt.md),
+[multiply](multiply.md)
diff --git a/node_modules/mathjs/docs/reference/functions/eigs.md b/node_modules/mathjs/docs/reference/functions/eigs.md
new file mode 100644
index 0000000..12882e8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/eigs.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function eigs
+
+Compute eigenvalues and eigenvectors of a matrix. The eigenvalues are sorted by their absolute value, ascending.
+An eigenvalue with multiplicity k will be listed k times. The eigenvectors are returned as columns of a matrix –
+the eigenvector that belongs to the j-th eigenvalue in the list (eg. `values[j]`) is the j-th column (eg. `column(vectors, j)`).
+If the algorithm fails to converge, it will throw an error – in that case, however, you may still find useful information
+in `err.values` and `err.vectors`.
+
+
+## Syntax
+
+```js
+math.eigs(x, [prec])
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | Matrix to be diagonalized
+`prec` | number &#124; BigNumber | Precision, default value: 1e-15
+
+### Returns
+
+Type | Description
+---- | -----------
+{values: Array &#124; Matrix, vectors: Array &#124; Matrix} | Object containing an array of eigenvalues and a matrix with eigenvectors as columns.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const { eigs, multiply, column, transpose } = math
+const H = [[5, 2.3], [2.3, 1]]
+const ans = eigs(H) // returns {values: [E1,E2...sorted], vectors: [v1,v2.... corresponding vectors as columns]}
+const E = ans.values
+const U = ans.vectors
+multiply(H, column(U, 0)) // returns multiply(E[0], column(U, 0))
+const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H
+E[0] == UTxHxU[0][0]  // returns true
+```
+
+
+## See also
+
+[inv](inv.md)
diff --git a/node_modules/mathjs/docs/reference/functions/equal.md b/node_modules/mathjs/docs/reference/functions/equal.md
new file mode 100644
index 0000000..ecff69f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/equal.md
@@ -0,0 +1,75 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function equal
+
+Test whether two values are equal.
+
+The function tests whether the relative difference between x and y is
+smaller than the configured epsilon. The function cannot be used to
+compare values smaller than approximately 2.22e-16.
+
+For matrices, the function is evaluated element wise.
+In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.
+
+Values `null` and `undefined` are compared strictly, thus `null` is only
+equal to `null` and nothing else, and `undefined` is only equal to
+`undefined` and nothing else. Strings are compared by their numerical value.
+
+
+## Syntax
+
+```js
+math.equal(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; boolean &#124; Complex &#124; Unit &#124; string &#124; Array &#124; Matrix | First value to compare
+`y` | number &#124; BigNumber &#124; boolean &#124; Complex &#124; Unit &#124; string &#124; Array &#124; Matrix | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix | Returns true when the compared values are equal, else returns false
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.equal(2 + 2, 3)         // returns false
+math.equal(2 + 2, 4)         // returns true
+
+const a = math.unit('50 cm')
+const b = math.unit('5 m')
+math.equal(a, b)             // returns true
+
+const c = [2, 5, 1]
+const d = [2, 7, 1]
+
+math.equal(c, d)             // returns [true, false, true]
+math.deepEqual(c, d)         // returns false
+
+math.equal("1000", "1e3")    // returns true
+math.equal(0, null)          // returns false
+```
+
+
+## See also
+
+[unequal](unequal.md),
+[smaller](smaller.md),
+[smallerEq](smallerEq.md),
+[larger](larger.md),
+[largerEq](largerEq.md),
+[compare](compare.md),
+[deepEqual](deepEqual.md),
+[equalText](equalText.md)
diff --git a/node_modules/mathjs/docs/reference/functions/equalText.md b/node_modules/mathjs/docs/reference/functions/equalText.md
new file mode 100644
index 0000000..b708755
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/equalText.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function equalText
+
+Check equality of two strings. Comparison is case sensitive.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.equalText(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | string &#124; Array &#124; DenseMatrix | First string to compare
+`y` | string &#124; Array &#124; DenseMatrix | Second string to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; DenseMatrix | Returns true if the values are equal, and false if not.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.equalText('Hello', 'Hello')     // returns true
+math.equalText('a', 'A')             // returns false
+math.equal('2e3', '2000')            // returns true
+math.equalText('2e3', '2000')        // returns false
+
+math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]
+```
+
+
+## See also
+
+[equal](equal.md),
+[compareText](compareText.md),
+[compare](compare.md),
+[compareNatural](compareNatural.md)
diff --git a/node_modules/mathjs/docs/reference/functions/erf.md b/node_modules/mathjs/docs/reference/functions/erf.md
new file mode 100644
index 0000000..8a5b6bc
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/erf.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function erf
+
+Compute the erf function of a value using a rational Chebyshev
+approximations for different intervals of x.
+
+This is a translation of W. J. Cody's Fortran implementation from 1987
+( https://www.netlib.org/specfun/erf ). See the AMS publication
+"Rational Chebyshev Approximations for the Error Function" by W. J. Cody
+for an explanation of this process.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.erf(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Array &#124; Matrix | A real number
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; Matrix | The erf of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.erf(0.2)    // returns 0.22270258921047847
+math.erf(-0.5)   // returns -0.5204998778130465
+math.erf(4)      // returns 0.9999999845827421
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/evaluate.md b/node_modules/mathjs/docs/reference/functions/evaluate.md
new file mode 100644
index 0000000..dd16bb1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/evaluate.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function evaluate
+
+Evaluate an expression.
+
+Note the evaluating arbitrary expressions may involve security risks,
+see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+
+
+## Syntax
+
+```js
+math.evaluate(expr)
+math.evaluate(expr, scope)
+math.evaluate([expr1, expr2, expr3, ...])
+math.evaluate([expr1, expr2, expr3, ...], scope)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr` | string &#124; string[] &#124; Matrix | The expression to be evaluated
+`scope` | Object | Scope to read/write variables
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The result of the expression
+
+
+### Throws
+
+Type | Description
+---- | -----------
+Error | 
+
+## Examples
+
+```js
+math.evaluate('(2+3)/4')                // 1.25
+math.evaluate('sqrt(3^2 + 4^2)')        // 5
+math.evaluate('sqrt(-4)')               // 2i
+math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]
+
+let scope = {a:3, b:4}
+math.evaluate('a * b', scope)           // 12
+```
+
+
+## See also
+
+[parse](parse.md),
+[compile](compile.md)
diff --git a/node_modules/mathjs/docs/reference/functions/exp.md b/node_modules/mathjs/docs/reference/functions/exp.md
new file mode 100644
index 0000000..d8d2f6f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/exp.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function exp
+
+Calculate the exponent of a value.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.exp(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | A number or matrix to exponentiate
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Exponent of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.exp(2)                  // returns number 7.3890560989306495
+math.pow(math.e, 2)          // returns number 7.3890560989306495
+math.log(math.exp(2))        // returns number 2
+
+math.exp([1, 2, 3])
+// returns Array [
+//   2.718281828459045,
+//   7.3890560989306495,
+//   20.085536923187668
+// ]
+```
+
+
+## See also
+
+[expm1](expm1.md),
+[log](log.md),
+[pow](pow.md)
diff --git a/node_modules/mathjs/docs/reference/functions/expm.md b/node_modules/mathjs/docs/reference/functions/expm.md
new file mode 100644
index 0000000..9e9558b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/expm.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function expm
+
+Compute the matrix exponential, expm(A) = e^A. The matrix must be square.
+Not to be confused with exp(a), which performs element-wise
+exponentiation.
+
+The exponential is calculated using the Padé approximant with scaling and
+squaring; see "Nineteen Dubious Ways to Compute the Exponential of a
+Matrix," by Moler and Van Loan.
+
+
+## Syntax
+
+```js
+math.expm(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix | A square Matrix
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix | The exponential of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const A = [[0,2],[0,0]]
+math.expm(A)        // returns [[1,2],[0,1]]
+```
+
+
+## See also
+
+[exp](exp.md)
diff --git a/node_modules/mathjs/docs/reference/functions/expm1.md b/node_modules/mathjs/docs/reference/functions/expm1.md
new file mode 100644
index 0000000..ddf7e6f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/expm1.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function expm1
+
+Calculate the value of subtracting 1 from the exponential value.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.expm1(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | A number or matrix to apply expm1
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Exponent of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.expm1(2)                      // returns number 6.38905609893065
+math.pow(math.e, 2) - 1            // returns number 6.3890560989306495
+math.log(math.expm1(2) + 1)        // returns number 2
+
+math.expm1([1, 2, 3])
+// returns Array [
+//   1.718281828459045,
+//   6.3890560989306495,
+//   19.085536923187668
+// ]
+```
+
+
+## See also
+
+[exp](exp.md),
+[log](log.md),
+[pow](pow.md)
diff --git a/node_modules/mathjs/docs/reference/functions/factorial.md b/node_modules/mathjs/docs/reference/functions/factorial.md
new file mode 100644
index 0000000..5cdfdf9
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/factorial.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function factorial
+
+Compute the factorial of a value
+
+Factorial only supports an integer value as argument.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.factorial(n)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | number &#124; BigNumber &#124; Array &#124; Matrix | An integer number
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | The factorial of `n`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.factorial(5)    // returns 120
+math.factorial(3)    // returns 6
+```
+
+
+## See also
+
+[combinations](combinations.md),
+[combinationsWithRep](combinationsWithRep.md),
+[gamma](gamma.md),
+[permutations](permutations.md)
diff --git a/node_modules/mathjs/docs/reference/functions/filter.md b/node_modules/mathjs/docs/reference/functions/filter.md
new file mode 100644
index 0000000..d584a2b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/filter.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function filter
+
+Filter the items in an array or one dimensional matrix.
+
+
+## Syntax
+
+```js
+math.filter(x, test)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | A one dimensional matrix or array to filter
+`test` | Function &#124; RegExp |  A function or regular expression to test items. All entries for which `test` returns true are returned. When `test` is a function, it is invoked with three parameters: the value of the element, the index of the element, and the matrix/array being traversed. The function must return a boolean.
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix &#124; Array | Returns the filtered matrix.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+function isPositive (x) {
+  return x > 0
+}
+math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]
+
+math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/) // returns ["23", "100", "55"]
+```
+
+
+## See also
+
+[forEach](forEach.md),
+[map](map.md),
+[sort](sort.md)
diff --git a/node_modules/mathjs/docs/reference/functions/fix.md b/node_modules/mathjs/docs/reference/functions/fix.md
new file mode 100644
index 0000000..59c487d
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/fix.md
@@ -0,0 +1,61 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function fix
+
+Round a value towards zero.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.fix(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Number to be rounded
+`n` | number &#124; BigNumber &#124; Array | Number of decimals Default value: 0.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Rounded value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.fix(3.2)                // returns number 3
+math.fix(3.8)                // returns number 3
+math.fix(-4.2)               // returns number -4
+math.fix(-4.7)               // returns number -4
+
+math.fix(3.12, 1)                // returns number 3.1
+math.fix(3.18, 1)                // returns number 3.1
+math.fix(-4.12, 1)               // returns number -4.1
+math.fix(-4.17, 1)               // returns number -4.1
+
+const c = math.complex(3.22, -2.78)
+math.fix(c)                  // returns Complex 3 - 2i
+math.fix(c, 1)               // returns Complex 3.2 - 2.7i
+
+math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]
+math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]
+```
+
+
+## See also
+
+[ceil](ceil.md),
+[floor](floor.md),
+[round](round.md)
diff --git a/node_modules/mathjs/docs/reference/functions/flatten.md b/node_modules/mathjs/docs/reference/functions/flatten.md
new file mode 100644
index 0000000..46f59a7
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/flatten.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function flatten
+
+Flatten a multi dimensional matrix into a single dimensional matrix.
+It is guaranteed to always return a clone of the argument.
+
+
+## Syntax
+
+```js
+math.flatten(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | Matrix to be flattened
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix &#124; Array | Returns the flattened matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]
+```
+
+
+## See also
+
+[concat](concat.md),
+[resize](resize.md),
+[size](size.md),
+[squeeze](squeeze.md)
diff --git a/node_modules/mathjs/docs/reference/functions/floor.md b/node_modules/mathjs/docs/reference/functions/floor.md
new file mode 100644
index 0000000..4b23594
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/floor.md
@@ -0,0 +1,62 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function floor
+
+Round a value towards minus infinity.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.floor(x)
+math.floor(x, n)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Number to be rounded
+`n` | number &#124; BigNumber &#124; Array | Number of decimals Default value: 0.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Rounded value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.floor(3.2)              // returns number 3
+math.floor(3.8)              // returns number 3
+math.floor(-4.2)             // returns number -5
+math.floor(-4.7)             // returns number -5
+
+math.floor(3.212, 2)          // returns number 3.21
+math.floor(3.288, 2)          // returns number 3.28
+math.floor(-4.212, 2)         // returns number -4.22
+math.floor(-4.782, 2)         // returns number -4.79
+
+const c = math.complex(3.24, -2.71)
+math.floor(c)                 // returns Complex 3 - 3i
+math.floor(c, 1)              // returns Complex 3.2 - 2.8i
+
+math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]
+math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]
+```
+
+
+## See also
+
+[ceil](ceil.md),
+[fix](fix.md),
+[round](round.md)
diff --git a/node_modules/mathjs/docs/reference/functions/forEach.md b/node_modules/mathjs/docs/reference/functions/forEach.md
new file mode 100644
index 0000000..315ac4f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/forEach.md
@@ -0,0 +1,41 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function forEach
+
+Iterate over all elements of a matrix/array, and executes the given callback function.
+
+
+## Syntax
+
+```js
+math.forEach(x, callback)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | The matrix to iterate on.
+`callback` | Function | The callback function is invoked with three parameters: the value of the element, the index of the element, and the Matrix/array being traversed.
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.forEach([1, 2, 3], function(value) {
+  console.log(value)
+})
+// outputs 1, 2, 3
+```
+
+
+## See also
+
+[filter](filter.md),
+[map](map.md),
+[sort](sort.md)
diff --git a/node_modules/mathjs/docs/reference/functions/format.md b/node_modules/mathjs/docs/reference/functions/format.md
new file mode 100644
index 0000000..7d0dfea
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/format.md
@@ -0,0 +1,127 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function format
+
+Format a value of any type into a string.
+
+
+## Syntax
+
+```js
+math.format(value)
+math.format(value, options)
+math.format(value, precision)
+math.format(value, callback)
+```
+
+### Where
+
+ - `value: *`
+   The value to be formatted
+ - `options: Object`
+   An object with formatting options. Available options:
+   - `notation: string`
+     Number notation. Choose from:
+     - 'fixed'
+       Always use regular number notation.
+       For example '123.40' and '14000000'
+     - 'exponential'
+       Always use exponential notation.
+       For example '1.234e+2' and '1.4e+7'
+     - 'engineering'
+       Always use engineering notation: always have exponential notation,
+       and select the exponent to be a multiple of 3.
+       For example '123.4e+0' and '14.0e+6'
+     - 'auto' (default)
+       Regular number notation for numbers having an absolute value between
+       `lower` and `upper` bounds, and uses exponential notation elsewhere.
+       Lower bound is included, upper bound is excluded.
+       For example '123.4' and '1.4e7'.
+     - 'bin', 'oct, or 'hex'
+       Format the number using binary, octal, or hexadecimal notation.
+       For example '0b1101' and '0x10fe'.
+   - `wordSize: number`
+     The word size in bits to use for formatting in binary, octal, or
+     hexadecimal notation. To be used only with 'bin', 'oct', or 'hex'
+     values for 'notation' option. When this option is defined the value
+     is formatted as a signed twos complement integer of the given word
+     size and the size suffix is appended to the output.
+     For example format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+     Default value is undefined.
+   - `precision: number`
+     Limit the number of digits of the formatted value.
+     For regular numbers, must be a number between 0 and 16.
+     For bignumbers, the maximum depends on the configured precision,
+     see function `config()`.
+     In case of notations 'exponential', 'engineering', and 'auto', `precision`
+     defines the total number of significant digits returned.
+     In case of notation 'fixed', `precision` defines the number of
+     significant digits after the decimal point.
+     `precision` is undefined by default.
+   - `lowerExp: number`
+     Exponent determining the lower boundary for formatting a value with
+     an exponent when `notation='auto`. Default value is `-3`.
+   - `upperExp: number`
+     Exponent determining the upper boundary for formatting a value with
+     an exponent when `notation='auto`. Default value is `5`.
+   - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.
+     For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is
+     configured, and will output `0.(3)` when 'decimal' is configured.
+   - `truncate: number`. Specifies the maximum allowed length of the
+     returned string. If it would have been longer, the excess characters
+     are deleted and replaced with `'...'`.
+- `callback: function`
+  A custom formatting function, invoked for all numeric elements in `value`,
+  for example all elements of a matrix, or the real and imaginary
+  parts of a complex number. This callback can be used to override the
+  built-in numeric notation with any type of formatting. Function `callback`
+  is called with `value` as parameter and must return a string.
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | * | Value to be stringified
+`options` | Object &#124; Function &#124; number | Formatting options
+
+### Returns
+
+Type | Description
+---- | -----------
+string | The formatted value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.format(6.4)                                        // returns '6.4'
+math.format(1240000)                                    // returns '1.24e6'
+math.format(1/3)                                        // returns '0.3333333333333333'
+math.format(1/3, 3)                                     // returns '0.333'
+math.format(21385, 2)                                   // returns '21000'
+math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'
+math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'
+math.format(12400,{notation: 'engineering'})            // returns '12.400e+3'
+math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'
+
+function formatCurrency(value) {
+  // return currency notation with two digits:
+  return '$' + value.toFixed(2)
+
+  // you could also use math.format inside the callback:
+  // return '$' + math.format(value, {notation: 'fixed', precision: 2})
+}
+math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'
+```
+
+
+## See also
+
+[print](print.md)
diff --git a/node_modules/mathjs/docs/reference/functions/fraction.md b/node_modules/mathjs/docs/reference/functions/fraction.md
new file mode 100644
index 0000000..fd7b108
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/fraction.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function fraction
+
+Create a fraction convert a value to a fraction.
+
+
+## Syntax
+
+```js
+math.fraction(numerator, denominator)
+math.fraction({n: numerator, d: denominator})
+math.fraction(matrix: Array | Matrix)         Turn all matrix entries
+                                              into fractions
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | number &#124; string &#124; Fraction &#124; BigNumber &#124; Array &#124; Matrix |  Arguments specifying the numerator and denominator of the fraction
+
+### Returns
+
+Type | Description
+---- | -----------
+Fraction &#124; Array &#124; Matrix | Returns a fraction
+
+
+## Examples
+
+```js
+math.fraction(1, 3)
+math.fraction('2/3')
+math.fraction({n: 2, d: 3})
+math.fraction([0.2, 0.25, 1.25])
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[number](number.md),
+[string](string.md),
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/gamma.md b/node_modules/mathjs/docs/reference/functions/gamma.md
new file mode 100644
index 0000000..07d2b07
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/gamma.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function gamma
+
+Compute the gamma function of a value using Lanczos approximation for
+small values, and an extended Stirling approximation for large values.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.gamma(n)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | number &#124; Array &#124; Matrix | A real or complex number
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; Matrix | The gamma of `n`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.gamma(5)       // returns 24
+math.gamma(-0.5)    // returns -3.5449077018110335
+math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i
+```
+
+
+## See also
+
+[combinations](combinations.md),
+[factorial](factorial.md),
+[permutations](permutations.md)
diff --git a/node_modules/mathjs/docs/reference/functions/gcd.md b/node_modules/mathjs/docs/reference/functions/gcd.md
new file mode 100644
index 0000000..5778a9b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/gcd.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function gcd
+
+Calculate the greatest common divisor for two or more values or arrays.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.gcd(a, b)
+math.gcd(a, b, c, ...)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... number &#124; BigNumber &#124; Fraction &#124; Array &#124; Matrix | Two or more integer numbers
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Array &#124; Matrix | The greatest common divisor
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.gcd(8, 12)              // returns 4
+math.gcd(-4, 6)              // returns 2
+math.gcd(25, 15, -10)        // returns 5
+
+math.gcd([8, -4], [12, 6])   // returns [4, 2]
+```
+
+
+## See also
+
+[lcm](lcm.md),
+[xgcd](xgcd.md)
diff --git a/node_modules/mathjs/docs/reference/functions/getMatrixDataType.md b/node_modules/mathjs/docs/reference/functions/getMatrixDataType.md
new file mode 100644
index 0000000..f3944b8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/getMatrixDataType.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function getMatrixDataType
+
+Find the data type of all elements in a matrix or array,
+for example 'number' if all items are a number and 'Complex' if all values
+are complex numbers.
+If a matrix contains more than one data type, it will return 'mixed'.
+
+
+## Syntax
+
+```js
+math.getMatrixDataType(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | ...Matrix &#124; Array | The Matrix with values.
+
+### Returns
+
+Type | Description
+---- | -----------
+string | A string representation of the matrix type
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const x = [ [1, 2, 3], [4, 5, 6] ]
+const mixedX = [ [1, true], [2, 3] ]
+const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3] ]
+const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]
+const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]
+const sparse = math.sparse(x)
+const dense = math.matrix(x)
+math.getMatrixDataType(x)   // returns 'number'
+math.getMatrixDataType(sparse)   // returns 'number'
+math.getMatrixDataType(dense)   // returns 'number'
+math.getMatrixDataType(mixedX) // returns 'mixed'
+math.getMatrixDataType(fractionX) // returns 'Fraction'
+math.getMatrixDataType(unitX) // returns 'Unit'
+math.getMatrixDataType(bigNumberX) // return 'BigNumber'
+```
+
+
+## See also
+
+[SparseMatrix](SparseMatrix.md),
+[DenseMatrix](DenseMatrix.md)
diff --git a/node_modules/mathjs/docs/reference/functions/hasNumericValue.md b/node_modules/mathjs/docs/reference/functions/hasNumericValue.md
new file mode 100644
index 0000000..d15f3ac
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/hasNumericValue.md
@@ -0,0 +1,55 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function hasNumericValue
+
+Test whether a value is an numeric value.
+
+In case of a string, true is returned if the string contains a numeric value.
+
+
+## Syntax
+
+```js
+math.hasNumericValue(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | * | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` is a `number`, `BigNumber`, `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types. Throws an error in case of unknown types.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.hasNumericValue(2)                     // returns true
+math.hasNumericValue('2')                   // returns true
+math.isNumeric('2')                         // returns false
+math.hasNumericValue(0)                     // returns true
+math.hasNumericValue(math.bignumber(500))   // returns true
+math.hasNumericValue(math.fraction(4))      // returns true
+math.hasNumericValue(math.complex('2-4i')   // returns false
+math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]
+```
+
+
+## See also
+
+[isZero](isZero.md),
+[isPositive](isPositive.md),
+[isNegative](isNegative.md),
+[isInteger](isInteger.md),
+[isNumeric](isNumeric.md)
diff --git a/node_modules/mathjs/docs/reference/functions/help.md b/node_modules/mathjs/docs/reference/functions/help.md
new file mode 100644
index 0000000..d71e968
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/help.md
@@ -0,0 +1,42 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function help
+
+Retrieve help on a function or data type.
+Help files are retrieved from the embedded documentation in math.docs.
+
+
+## Syntax
+
+```js
+math.help(search)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`search` | Function &#124; string &#124; Object | A function or function name for which to get help
+
+### Returns
+
+Type | Description
+---- | -----------
+Help | A help object
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+console.log(math.help('sin').toString())
+console.log(math.help(math.add).toString())
+console.log(math.help(math.add).toJSON())
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/hex.md b/node_modules/mathjs/docs/reference/functions/hex.md
new file mode 100644
index 0000000..8d2146c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/hex.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function hex
+
+Format a number as hexadecimal.
+
+
+## Syntax
+
+```js
+math.hex(value)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | number | Value to be stringified
+`wordSize` | number | Optional word size (see `format`)
+
+### Returns
+
+Type | Description
+---- | -----------
+string | The formatted value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+//the following outputs "0xF0"
+math.hex(240)
+```
+
+
+## See also
+
+[oct](oct.md),
+[bin](bin.md)
diff --git a/node_modules/mathjs/docs/reference/functions/hypot.md b/node_modules/mathjs/docs/reference/functions/hypot.md
new file mode 100644
index 0000000..d7c6e54
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/hypot.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function hypot
+
+Calculate the hypotenusa of a list with values. The hypotenusa is defined as:
+
+    hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)
+
+For matrix input, the hypotenusa is calculated for all values in the matrix.
+
+
+## Syntax
+
+```js
+math.hypot(a, b, ...)
+math.hypot([a, b, c, ...])
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... number &#124; BigNumber &#124; Array &#124; Matrix | A list with numeric values or an Array or Matrix. Matrix and Array input is flattened and returns a single number for the whole matrix.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber | Returns the hypothenusa of the input values.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.hypot(3, 4)      // 5
+math.hypot(3, 4, 5)   // 7.0710678118654755
+math.hypot([3, 4, 5]) // 7.0710678118654755
+math.hypot(-2)        // 2
+```
+
+
+## See also
+
+[abs](abs.md),
+[norm](norm.md)
diff --git a/node_modules/mathjs/docs/reference/functions/identity.md b/node_modules/mathjs/docs/reference/functions/identity.md
new file mode 100644
index 0000000..e3a6321
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/identity.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function identity
+
+Create a 2-dimensional identity matrix with size m x n or n x n.
+The matrix has ones on the diagonal and zeros elsewhere.
+
+
+## Syntax
+
+```js
+math.identity(n)
+math.identity(n, format)
+math.identity(m, n)
+math.identity(m, n, format)
+math.identity([m, n])
+math.identity([m, n], format)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`size` | ...number &#124; Matrix &#124; Array | The size for the matrix
+`format` | string | The Matrix storage format
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix &#124; Array &#124; number | A matrix with ones on the diagonal.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]
+
+const A = [[1, 2, 3], [4, 5, 6]]
+math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]
+```
+
+
+## See also
+
+[diag](diag.md),
+[ones](ones.md),
+[zeros](zeros.md),
+[size](size.md),
+[range](range.md)
diff --git a/node_modules/mathjs/docs/reference/functions/im.md b/node_modules/mathjs/docs/reference/functions/im.md
new file mode 100644
index 0000000..1e606f3
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/im.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function im
+
+Get the imaginary part of a complex number.
+For a complex number `a + bi`, the function returns `b`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.im(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  A complex number or array with complex numbers
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | The imaginary part of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const a = math.complex(2, 3)
+math.re(a)                     // returns number 2
+math.im(a)                     // returns number 3
+
+math.re(math.complex('-5.2i')) // returns number -5.2
+math.re(math.complex(2.4))     // returns number 0
+```
+
+
+## See also
+
+[re](re.md),
+[conj](conj.md),
+[abs](abs.md),
+[arg](arg.md)
diff --git a/node_modules/mathjs/docs/reference/functions/import.md b/node_modules/mathjs/docs/reference/functions/import.md
new file mode 100644
index 0000000..5788652
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/import.md
@@ -0,0 +1,68 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function import
+
+Import functions from an object or a module.
+
+This function is only available on a mathjs instance created using `create`.
+
+
+## Syntax
+
+```js
+math.import(functions)
+math.import(functions, options)
+```
+
+### Where
+
+- `functions: Object`
+  An object with functions or factories to be imported.
+- `options: Object` An object with import options. Available options:
+  - `override: boolean`
+    If true, existing functions will be overwritten. False by default.
+  - `silent: boolean`
+    If true, the function will not throw errors on duplicates or invalid
+    types. False by default.
+  - `wrap: boolean`
+    If true, the functions will be wrapped in a wrapper function
+    which converts data types like Matrix to primitive data types like Array.
+    The wrapper is needed when extending math.js with libraries which do not
+    support these data type. False by default.
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`functions` | Object &#124; Array | Object with functions to be imported.
+`options` | Object | Import options.
+
+## Examples
+
+```js
+import { create, all } from 'mathjs'
+import * as numbers from 'numbers'
+
+// create a mathjs instance
+const math = create(all)
+
+// define new functions and variables
+math.import({
+  myvalue: 42,
+  hello: function (name) {
+    return 'hello, ' + name + '!'
+  }
+})
+
+// use the imported function and variable
+math.myvalue * 2               // 84
+math.hello('user')             // 'hello, user!'
+
+// import the npm module 'numbers'
+// (must be installed first with `npm install numbers`)
+math.import(numbers, {wrap: true})
+
+math.fibonacci(7) // returns 13
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/index.md b/node_modules/mathjs/docs/reference/functions/index.md
new file mode 100644
index 0000000..533feca
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/index.md
@@ -0,0 +1,55 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function index
+
+Create an index. An Index can store ranges having start, step, and end
+for multiple dimensions.
+Matrix.get, Matrix.set, and math.subset accept an Index as input.
+
+
+## Syntax
+
+```js
+math.index(range1, range2, ...)
+```
+
+### Where
+
+- A number
+- A string for getting/setting an object property
+- An instance of `Range`
+- A one-dimensional Array or a Matrix with numbers
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`ranges` | ...* | Zero or more ranges or numbers.
+
+### Returns
+
+Type | Description
+---- | -----------
+Index | Returns the created index
+
+
+## Examples
+
+```js
+const b = [1, 2, 3, 4, 5]
+math.subset(b, math.index([1, 2, 3]))     // returns [2, 3, 4]
+
+const a = math.matrix([[1, 2], [3, 4]])
+a.subset(math.index(0, 1))             // returns 2
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[boolean](boolean.md),
+[complex](complex.md),
+[matrix](matrix.md),
+[number](number.md),
+[string](string.md),
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/intersect.md b/node_modules/mathjs/docs/reference/functions/intersect.md
new file mode 100644
index 0000000..839c16c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/intersect.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function intersect
+
+Calculates the point of intersection of two lines in two or three dimensions
+and of a line and a plane in three dimensions. The inputs are in the form of
+arrays or 1 dimensional matrices. The line intersection functions return null
+if the lines do not meet.
+
+Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.
+
+
+## Syntax
+
+```js
+math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)
+math.intersect(endPoint1, endPoint2, planeCoefficients)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`w` | Array &#124; Matrix | Co-ordinates of first end-point of first line
+`x` | Array &#124; Matrix | Co-ordinates of second end-point of first line
+`y` | Array &#124; Matrix | Co-ordinates of first end-point of second line OR Co-efficients of the plane's equation
+`z` | Array &#124; Matrix | Co-ordinates of second end-point of second line OR undefined if the calculation is for line and plane
+
+### Returns
+
+Type | Description
+---- | -----------
+Array | Returns the point of intersection of lines/lines-planes
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]
+math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]
+math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/inv.md b/node_modules/mathjs/docs/reference/functions/inv.md
new file mode 100644
index 0000000..5fc36cb
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/inv.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function inv
+
+Calculate the inverse of a square matrix.
+
+
+## Syntax
+
+```js
+math.inv(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Array &#124; Matrix | Matrix to be inversed
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | The inverse of `x`.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]
+math.inv(4)                 // returns 0.25
+1 / 4                       // returns 0.25
+```
+
+
+## See also
+
+[det](det.md),
+[transpose](transpose.md)
diff --git a/node_modules/mathjs/docs/reference/functions/invmod.md b/node_modules/mathjs/docs/reference/functions/invmod.md
new file mode 100644
index 0000000..825f9a0
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/invmod.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function invmod
+
+Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`
+See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.
+
+
+## Syntax
+
+```js
+math.invmod(a, b)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a` | number &#124; BigNumber | An integer number
+`b` | number &#124; BigNumber | An integer number
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber | Returns an integer number where `invmod(a,b)*a ≣ 1 (mod b)`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.invmod(8, 12)             // returns NaN
+math.invmod(7, 13)             // return 2
+math.invmod(15151, 15122)      // returns 10429
+```
+
+
+## See also
+
+[gcd](gcd.md),
+[xgcd](xgcd.md)
diff --git a/node_modules/mathjs/docs/reference/functions/isInteger.md b/node_modules/mathjs/docs/reference/functions/isInteger.md
new file mode 100644
index 0000000..1e00dac
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/isInteger.md
@@ -0,0 +1,55 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function isInteger
+
+Test whether a value is an integer number.
+The function supports `number`, `BigNumber`, and `Fraction`.
+
+The function is evaluated element-wise in case of Array or Matrix input.
+
+
+## Syntax
+
+```js
+math.isInteger(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Array &#124; Matrix | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` contains a numeric, integer value. Throws an error in case of an unknown data type.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.isInteger(2)                     // returns true
+math.isInteger(0)                     // returns true
+math.isInteger(0.5)                   // returns false
+math.isInteger(math.bignumber(500))   // returns true
+math.isInteger(math.fraction(4))      // returns true
+math.isInteger('3')                   // returns true
+math.isInteger([3, 0.5, -2])          // returns [true, false, true]
+math.isInteger(math.complex('2-4i')   // throws an error
+```
+
+
+## See also
+
+[isNumeric](isNumeric.md),
+[isPositive](isPositive.md),
+[isNegative](isNegative.md),
+[isZero](isZero.md)
diff --git a/node_modules/mathjs/docs/reference/functions/isNaN.md b/node_modules/mathjs/docs/reference/functions/isNaN.md
new file mode 100644
index 0000000..71984a1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/isNaN.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function isNaN
+
+Test whether a value is NaN (not a number).
+The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.
+
+The function is evaluated element-wise in case of Array or Matrix input.
+
+
+## Syntax
+
+```js
+math.isNaN(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Unit &#124; Array &#124; Matrix | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` is NaN. Throws an error in case of an unknown data type.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.isNaN(3)                     // returns false
+math.isNaN(NaN)                   // returns true
+math.isNaN(0)                     // returns false
+math.isNaN(math.bignumber(NaN))   // returns true
+math.isNaN(math.bignumber(0))     // returns false
+math.isNaN(math.fraction(-2, 5))  // returns false
+math.isNaN('-2')                  // returns false
+math.isNaN([2, 0, -3, NaN]')      // returns [false, false, false, true]
+```
+
+
+## See also
+
+[isNumeric](isNumeric.md),
+[isNegative](isNegative.md),
+[isPositive](isPositive.md),
+[isZero](isZero.md),
+[isInteger](isInteger.md)
diff --git a/node_modules/mathjs/docs/reference/functions/isNegative.md b/node_modules/mathjs/docs/reference/functions/isNegative.md
new file mode 100644
index 0000000..b0018d9
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/isNegative.md
@@ -0,0 +1,55 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function isNegative
+
+Test whether a value is negative: smaller than zero.
+The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+
+The function is evaluated element-wise in case of Array or Matrix input.
+
+
+## Syntax
+
+```js
+math.isNegative(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Unit &#124; Array &#124; Matrix | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` is larger than zero. Throws an error in case of an unknown data type.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.isNegative(3)                     // returns false
+math.isNegative(-2)                    // returns true
+math.isNegative(0)                     // returns false
+math.isNegative(-0)                    // returns false
+math.isNegative(math.bignumber(2))     // returns false
+math.isNegative(math.fraction(-2, 5))  // returns true
+math.isNegative('-2')                  // returns true
+math.isNegative([2, 0, -3]')           // returns [false, false, true]
+```
+
+
+## See also
+
+[isNumeric](isNumeric.md),
+[isPositive](isPositive.md),
+[isZero](isZero.md),
+[isInteger](isInteger.md)
diff --git a/node_modules/mathjs/docs/reference/functions/isNumeric.md b/node_modules/mathjs/docs/reference/functions/isNumeric.md
new file mode 100644
index 0000000..9188bc9
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/isNumeric.md
@@ -0,0 +1,55 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function isNumeric
+
+Test whether a value is an numeric value.
+
+The function is evaluated element-wise in case of Array or Matrix input.
+
+
+## Syntax
+
+```js
+math.isNumeric(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | * | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` is a `number`, `BigNumber`, `Fraction`, or `boolean`. Returns false for other types. Throws an error in case of unknown types.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.isNumeric(2)                     // returns true
+math.isNumeric('2')                   // returns false
+math.hasNumericValue('2')             // returns true
+math.isNumeric(0)                     // returns true
+math.isNumeric(math.bignumber(500))   // returns true
+math.isNumeric(math.fraction(4))      // returns true
+math.isNumeric(math.complex('2-4i')   // returns false
+math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]
+```
+
+
+## See also
+
+[isZero](isZero.md),
+[isPositive](isPositive.md),
+[isNegative](isNegative.md),
+[isInteger](isInteger.md),
+[hasNumericValue](hasNumericValue.md)
diff --git a/node_modules/mathjs/docs/reference/functions/isPositive.md b/node_modules/mathjs/docs/reference/functions/isPositive.md
new file mode 100644
index 0000000..44caf46
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/isPositive.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function isPositive
+
+Test whether a value is positive: larger than zero.
+The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+
+The function is evaluated element-wise in case of Array or Matrix input.
+
+
+## Syntax
+
+```js
+math.isPositive(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Unit &#124; Array &#124; Matrix | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` is larger than zero. Throws an error in case of an unknown data type.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.isPositive(3)                     // returns true
+math.isPositive(-2)                    // returns false
+math.isPositive(0)                     // returns false
+math.isPositive(-0)                    // returns false
+math.isPositive(0.5)                   // returns true
+math.isPositive(math.bignumber(2))     // returns true
+math.isPositive(math.fraction(-2, 5))  // returns false
+math.isPositive(math.fraction(1,3))    // returns false
+math.isPositive('2')                   // returns true
+math.isPositive([2, 0, -3])            // returns [true, false, false]
+```
+
+
+## See also
+
+[isNumeric](isNumeric.md),
+[isZero](isZero.md),
+[isNegative](isNegative.md),
+[isInteger](isInteger.md)
diff --git a/node_modules/mathjs/docs/reference/functions/isPrime.md b/node_modules/mathjs/docs/reference/functions/isPrime.md
new file mode 100644
index 0000000..8403bd4
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/isPrime.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function isPrime
+
+Test whether a value is prime: has no divisors other than itself and one.
+The function supports type `number`, `bignumber`.
+
+The function is evaluated element-wise in case of Array or Matrix input.
+
+
+## Syntax
+
+```js
+math.isPrime(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Array &#124; Matrix | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` is larger than zero. Throws an error in case of an unknown data type.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.isPrime(3)                     // returns true
+math.isPrime(-2)                    // returns false
+math.isPrime(0)                     // returns false
+math.isPrime(-0)                    // returns false
+math.isPrime(0.5)                   // returns false
+math.isPrime('2')                   // returns true
+math.isPrime([2, 17, 100])           // returns [true, true, false]
+```
+
+
+## See also
+
+[isNumeric](isNumeric.md),
+[isZero](isZero.md),
+[isNegative](isNegative.md),
+[isInteger](isInteger.md)
diff --git a/node_modules/mathjs/docs/reference/functions/isZero.md b/node_modules/mathjs/docs/reference/functions/isZero.md
new file mode 100644
index 0000000..9ce8032
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/isZero.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function isZero
+
+Test whether a value is zero.
+The function can check for zero for types `number`, `BigNumber`, `Fraction`,
+`Complex`, and `Unit`.
+
+The function is evaluated element-wise in case of Array or Matrix input.
+
+
+## Syntax
+
+```js
+math.isZero(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Fraction &#124; Unit &#124; Array &#124; Matrix | Value to be tested
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | Returns true when `x` is zero. Throws an error in case of an unknown data type.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.isZero(0)                     // returns true
+math.isZero(2)                     // returns false
+math.isZero(0.5)                   // returns false
+math.isZero(math.bignumber(0))     // returns true
+math.isZero(math.fraction(0))      // returns true
+math.isZero(math.fraction(1,3))    // returns false
+math.isZero(math.complex('2 - 4i') // returns false
+math.isZero(math.complex('0i')     // returns true
+math.isZero('0')                   // returns true
+math.isZero('2')                   // returns false
+math.isZero([2, 0, -3]')           // returns [false, true, false]
+```
+
+
+## See also
+
+[isNumeric](isNumeric.md),
+[isPositive](isPositive.md),
+[isNegative](isNegative.md),
+[isInteger](isInteger.md)
diff --git a/node_modules/mathjs/docs/reference/functions/kldivergence.md b/node_modules/mathjs/docs/reference/functions/kldivergence.md
new file mode 100644
index 0000000..f95b381
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/kldivergence.md
@@ -0,0 +1,41 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function kldivergence
+
+Calculate the Kullback-Leibler (KL) divergence  between two distributions
+
+
+## Syntax
+
+```js
+math.kldivergence(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`q` | Array &#124; Matrix | First vector
+`p` | Array &#124; Matrix | Second vector
+
+### Returns
+
+Type | Description
+---- | -----------
+number | Returns distance between q and p
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153
+
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/kron.md b/node_modules/mathjs/docs/reference/functions/kron.md
new file mode 100644
index 0000000..cde5165
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/kron.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function kron
+
+Calculates the kronecker product of 2 matrices or vectors.
+
+NOTE: If a one dimensional vector / matrix is given, it will be
+wrapped so its two dimensions.
+See the examples.
+
+
+## Syntax
+
+```js
+math.kron(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | First vector
+`y` | Array &#124; Matrix | Second vector
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | Returns the kronecker product of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])
+// returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]
+
+math.kron([1,1], [2,3,4])
+// returns [ [ 2, 3, 4, 2, 3, 4 ] ]
+```
+
+
+## See also
+
+[multiply](multiply.md),
+[dot](dot.md),
+[cross](cross.md)
diff --git a/node_modules/mathjs/docs/reference/functions/larger.md b/node_modules/mathjs/docs/reference/functions/larger.md
new file mode 100644
index 0000000..083d1c1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/larger.md
@@ -0,0 +1,60 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function larger
+
+Test whether value x is larger than y.
+
+The function returns true when x is larger than y and the relative
+difference between x and y is larger than the configured epsilon. The
+function cannot be used to compare values smaller than approximately 2.22e-16.
+
+For matrices, the function is evaluated element wise.
+Strings are compared by their numerical value.
+
+
+## Syntax
+
+```js
+math.larger(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | First value to compare
+`y` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix | Returns true when the x is larger than y, else returns false
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.larger(2, 3)             // returns false
+math.larger(5, 2 + 2)         // returns true
+
+const a = math.unit('5 cm')
+const b = math.unit('2 inch')
+math.larger(a, b)             // returns false
+```
+
+
+## See also
+
+[equal](equal.md),
+[unequal](unequal.md),
+[smaller](smaller.md),
+[smallerEq](smallerEq.md),
+[largerEq](largerEq.md),
+[compare](compare.md)
diff --git a/node_modules/mathjs/docs/reference/functions/largerEq.md b/node_modules/mathjs/docs/reference/functions/largerEq.md
new file mode 100644
index 0000000..cd3400a
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/largerEq.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function largerEq
+
+Test whether value x is larger or equal to y.
+
+The function returns true when x is larger than y or the relative
+difference between x and y is smaller than the configured epsilon. The
+function cannot be used to compare values smaller than approximately 2.22e-16.
+
+For matrices, the function is evaluated element wise.
+Strings are compared by their numerical value.
+
+
+## Syntax
+
+```js
+math.largerEq(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | First value to compare
+`y` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix | Returns true when the x is larger or equal to y, else returns false
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.larger(2, 1 + 1)         // returns false
+math.largerEq(2, 1 + 1)       // returns true
+```
+
+
+## See also
+
+[equal](equal.md),
+[unequal](unequal.md),
+[smaller](smaller.md),
+[smallerEq](smallerEq.md),
+[larger](larger.md),
+[compare](compare.md)
diff --git a/node_modules/mathjs/docs/reference/functions/lcm.md b/node_modules/mathjs/docs/reference/functions/lcm.md
new file mode 100644
index 0000000..bf9876e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/lcm.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function lcm
+
+Calculate the least common multiple for two or more values or arrays.
+
+lcm is defined as:
+
+    lcm(a, b) = abs(a * b) / gcd(a, b)
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.lcm(a, b)
+math.lcm(a, b, c, ...)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... number &#124; BigNumber &#124; Array &#124; Matrix | Two or more integer numbers
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | The least common multiple
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.lcm(4, 6)               // returns 12
+math.lcm(6, 21)              // returns 42
+math.lcm(6, 21, 5)           // returns 210
+
+math.lcm([4, 6], [6, 21])    // returns [12, 42]
+```
+
+
+## See also
+
+[gcd](gcd.md),
+[xgcd](xgcd.md)
diff --git a/node_modules/mathjs/docs/reference/functions/leafCount.md b/node_modules/mathjs/docs/reference/functions/leafCount.md
new file mode 100644
index 0000000..00c3b2a
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/leafCount.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function leafCount
+
+Gives the number of "leaf nodes" in the parse tree of the given expression
+A leaf node is one that has no subexpressions, essentially either a
+symbol or a constant. Note that `5!` has just one leaf, the '5'; the
+unary factorial operator does not add a leaf. On the other hand,
+function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.
+
+The `simplify()` function should generally not increase the `leafCount()`
+of an expression, although currently there is no guarantee that it never
+does so. In many cases, `simplify()` reduces the leaf count.
+
+
+## Syntax
+
+```js
+leafCount(expr)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr` | Node &#124; string | The expression to count the leaves of
+
+### Returns
+
+Type | Description
+---- | -----------
+number | The number of leaves of `expr`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.leafCount('x') // 1
+math.leafCount(math.parse('a*d-b*c')) // 4
+math.leafCount('[a,b;c,d][0,1]') // 6
+```
+
+
+## See also
+
+[simplify](simplify.md)
diff --git a/node_modules/mathjs/docs/reference/functions/leftShift.md b/node_modules/mathjs/docs/reference/functions/leftShift.md
new file mode 100644
index 0000000..587bdd5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/leftShift.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function leftShift
+
+Bitwise left logical shift of a value x by y number of bits, `x << y`.
+For matrices, the function is evaluated element wise.
+For units, the function is evaluated on the best prefix base.
+
+
+## Syntax
+
+```js
+math.leftShift(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Array &#124; Matrix | Value to be shifted
+`y` | number &#124; BigNumber | Amount of shifts
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | `x` shifted left `y` times
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.leftShift(1, 2)               // returns number 4
+
+math.leftShift([1, 2, 3], 4)       // returns Array [16, 32, 64]
+```
+
+
+## See also
+
+[leftShift](leftShift.md),
+[bitNot](bitNot.md),
+[bitOr](bitOr.md),
+[bitXor](bitXor.md),
+[rightArithShift](rightArithShift.md),
+[rightLogShift](rightLogShift.md)
diff --git a/node_modules/mathjs/docs/reference/functions/log.md b/node_modules/mathjs/docs/reference/functions/log.md
new file mode 100644
index 0000000..7cb39bd
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/log.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function log
+
+Calculate the logarithm of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.log(x)
+math.log(x, base)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Value for which to calculate the logarithm.
+`base` | number &#124; BigNumber &#124; Complex |  Optional base for the logarithm. If not provided, the natural logarithm of `x` is calculated. Default value: e.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Returns the logarithm of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.log(3.5)                  // returns 1.252762968495368
+math.exp(math.log(2.4))        // returns 2.4
+
+math.pow(10, 4)                // returns 10000
+math.log(10000, 10)            // returns 4
+math.log(10000) / math.log(10) // returns 4
+
+math.log(1024, 2)              // returns 10
+math.pow(2, 10)                // returns 1024
+```
+
+
+## See also
+
+[exp](exp.md),
+[log2](log2.md),
+[log10](log10.md),
+[log1p](log1p.md)
diff --git a/node_modules/mathjs/docs/reference/functions/log10.md b/node_modules/mathjs/docs/reference/functions/log10.md
new file mode 100644
index 0000000..b710efd
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/log10.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function log10
+
+Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.log10(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Value for which to calculate the logarithm.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Returns the 10-base logarithm of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.log10(0.00001)            // returns -5
+math.log10(10000)              // returns 4
+math.log(10000) / math.log(10) // returns 4
+math.pow(10, 4)                // returns 10000
+```
+
+
+## See also
+
+[exp](exp.md),
+[log](log.md),
+[log1p](log1p.md),
+[log2](log2.md)
diff --git a/node_modules/mathjs/docs/reference/functions/log1p.md b/node_modules/mathjs/docs/reference/functions/log1p.md
new file mode 100644
index 0000000..fdc9b4d
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/log1p.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function log1p
+
+Calculate the logarithm of a `value+1`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.log1p(x)
+math.log1p(x, base)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Value for which to calculate the logarithm of `x+1`.
+`base` | number &#124; BigNumber &#124; Complex |  Optional base for the logarithm. If not provided, the natural logarithm of `x+1` is calculated. Default value: e.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Returns the logarithm of `x+1`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.log1p(2.5)                 // returns 1.252762968495368
+math.exp(math.log1p(1.4))       // returns 2.4
+
+math.pow(10, 4)                 // returns 10000
+math.log1p(9999, 10)            // returns 4
+math.log1p(9999) / math.log(10) // returns 4
+```
+
+
+## See also
+
+[exp](exp.md),
+[log](log.md),
+[log2](log2.md),
+[log10](log10.md)
diff --git a/node_modules/mathjs/docs/reference/functions/log2.md b/node_modules/mathjs/docs/reference/functions/log2.md
new file mode 100644
index 0000000..1697061
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/log2.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function log2
+
+Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.log2(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Value for which to calculate the logarithm.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Returns the 2-base logarithm of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.log2(0.03125)           // returns -5
+math.log2(16)                // returns 4
+math.log2(16) / math.log2(2) // returns 4
+math.pow(2, 4)               // returns 16
+```
+
+
+## See also
+
+[exp](exp.md),
+[log](log.md),
+[log1p](log1p.md),
+[log10](log10.md)
diff --git a/node_modules/mathjs/docs/reference/functions/lsolve.md b/node_modules/mathjs/docs/reference/functions/lsolve.md
new file mode 100644
index 0000000..97b59d5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/lsolve.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function lsolve
+
+Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.
+
+`L * x = b`
+
+
+## Syntax
+
+```js
+math.lsolve(L, b)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`L` | Matrix, Array | A N x N matrix or array (L)
+`b` | Matrix, Array | A column vector with the b values
+
+### Returns
+
+Type | Description
+---- | -----------
+DenseMatrix &#124; Array | A column vector with the linear system solution (x)
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const a = [[-2, 3], [2, 1]]
+const b = [11, 9]
+const x = lsolve(a, b)  // [[-5.5], [20]]
+```
+
+
+## See also
+
+[lsolveAll](lsolveAll.md),
+[lup](lup.md),
+[slu](slu.md),
+[usolve](usolve.md),
+[lusolve](lusolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/lsolveAll.md b/node_modules/mathjs/docs/reference/functions/lsolveAll.md
new file mode 100644
index 0000000..4e264df
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/lsolveAll.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function lsolveAll
+
+Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.
+
+`L * x = b`
+
+
+## Syntax
+
+```js
+math.lsolveAll(L, b)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`L` | Matrix, Array | A N x N matrix or array (L)
+`b` | Matrix, Array | A column vector with the b values
+
+### Returns
+
+Type | Description
+---- | -----------
+DenseMatrix[] &#124; Array[] | An array of affine-independent column vectors (x) that solve the linear system
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const a = [[-2, 3], [2, 1]]
+const b = [11, 9]
+const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]
+```
+
+
+## See also
+
+[lsolve](lsolve.md),
+[lup](lup.md),
+[slu](slu.md),
+[usolve](usolve.md),
+[lusolve](lusolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/lup.md b/node_modules/mathjs/docs/reference/functions/lup.md
new file mode 100644
index 0000000..629c207
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/lup.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function lup
+
+Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a
+row permutation vector `p` where `A[p,:] = L * U`
+
+
+## Syntax
+
+```js
+math.lup(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`A` | Matrix &#124; Array | A two dimensional matrix or array for which to get the LUP decomposition.
+
+### Returns
+
+Type | Description
+---- | -----------
+{L: Array &#124; Matrix, U: Array &#124; Matrix, P: Array.&lt;number&gt;} | The lower triangular matrix, the upper triangular matrix and the permutation matrix.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const m = [[2, 1], [1, 4]]
+const r = math.lup(m)
+// r = {
+//   L: [[1, 0], [0.5, 1]],
+//   U: [[2, 1], [0, 3.5]],
+//   P: [0, 1]
+// }
+```
+
+
+## See also
+
+[slu](slu.md),
+[lsolve](lsolve.md),
+[lusolve](lusolve.md),
+[usolve](usolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/lusolve.md b/node_modules/mathjs/docs/reference/functions/lusolve.md
new file mode 100644
index 0000000..c00ec9a
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/lusolve.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function lusolve
+
+Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.
+
+
+## Syntax
+
+```js
+math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b
+math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`A` | Matrix &#124; Array &#124; Object | Invertible Matrix or the Matrix LU decomposition
+`b` | Matrix &#124; Array | Column Vector
+`order` | number | The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix
+`threshold` | Number | Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.
+
+### Returns
+
+Type | Description
+---- | -----------
+DenseMatrix &#124; Array | Column vector with the solution to the linear system A * x = b
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]
+
+const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]
+
+const f = math.lup(m)
+const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]
+const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]
+
+const a = [[-2, 3], [2, 1]]
+const b = [11, 9]
+const x = math.lusolve(a, b)  // [[2], [5]]
+```
+
+
+## See also
+
+[lup](lup.md),
+[slu](slu.md),
+[lsolve](lsolve.md),
+[usolve](usolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/mad.md b/node_modules/mathjs/docs/reference/functions/mad.md
new file mode 100644
index 0000000..768a082
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/mad.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function mad
+
+Compute the median absolute deviation of a matrix or a list with values.
+The median absolute deviation is defined as the median of the absolute
+deviations from the median.
+
+
+## Syntax
+
+```js
+math.mad(a, b, c, ...)
+math.mad(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`array` | Array &#124; Matrix |  A single matrix or multiple scalar values.
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The median absolute deviation.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.mad(10, 20, 30)             // returns 10
+math.mad([1, 2, 3])              // returns 1
+math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5
+```
+
+
+## See also
+
+[median](median.md),
+[mean](mean.md),
+[std](std.md),
+[abs](abs.md)
diff --git a/node_modules/mathjs/docs/reference/functions/map.md b/node_modules/mathjs/docs/reference/functions/map.md
new file mode 100644
index 0000000..110c576
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/map.md
@@ -0,0 +1,65 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function map
+
+Create a new matrix or array with the results of a callback function executed on
+each entry of a given matrix/array.
+
+For each entry of the input, the callback is invoked with three arguments:
+the value of the entry, the index at which that entry occurs, and the full
+matrix/array being traversed. Note that because the matrix/array might be
+multidimensional, the "index" argument is always an array of numbers giving
+the index in each dimension. This is true even for vectors: the "index"
+argument is an array of length 1, rather than simply a number.
+
+
+## Syntax
+
+```js
+math.map(x, callback)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | The input to iterate on.
+`callback` | Function |  The function to call (as described above) on each entry of the input
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix &#124; array |  Transformed map of x; always has the same type and shape as x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.map([1, 2, 3], function(value) {
+  return value * value
+})  // returns [1, 4, 9]
+
+// The calling convention for the callback can cause subtleties:
+math.map([1, 2, 3], math.format)
+// throws TypeError: map attempted to call 'format(1,[0])' but argument 2 of type Array does not match expected type number or function or Object or string or boolean
+// [This happens because `format` _can_ take a second argument,
+// but its semantics don't match that of the 2nd argument `map` provides]
+
+// To avoid this error, use a function that takes exactly the
+// desired arguments:
+math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']
+```
+
+
+## See also
+
+[filter](filter.md),
+[forEach](forEach.md),
+[sort](sort.md)
diff --git a/node_modules/mathjs/docs/reference/functions/matrix.md b/node_modules/mathjs/docs/reference/functions/matrix.md
new file mode 100644
index 0000000..4f61539
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/matrix.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function matrix
+
+Create a Matrix. The function creates a new `math.Matrix` object from
+an `Array`. A Matrix has utility functions to manipulate the data in the
+matrix, like getting the size and getting or setting values in the matrix.
+Supported storage formats are 'dense' and 'sparse'.
+
+
+## Syntax
+
+```js
+math.matrix()                         // creates an empty matrix using default storage format (dense).
+math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).
+math.matrix('dense')                  // creates an empty matrix using the given storage format.
+math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.
+math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.
+math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`data` | Array &#124; Matrix | A multi dimensional array
+`format` | string | The Matrix storage format
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix | The created matrix
+
+
+## Examples
+
+```js
+let m = math.matrix([[1, 2], [3, 4]])
+m.size()                        // Array [2, 2]
+m.resize([3, 2], 5)
+m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+m.get([1, 0])                    // number 3
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[boolean](boolean.md),
+[complex](complex.md),
+[index](index.md),
+[number](number.md),
+[string](string.md),
+[unit](unit.md),
+[sparse](sparse.md)
diff --git a/node_modules/mathjs/docs/reference/functions/matrixFromColumns.md b/node_modules/mathjs/docs/reference/functions/matrixFromColumns.md
new file mode 100644
index 0000000..e0c7995
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/matrixFromColumns.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function matrixFromColumns
+
+Create a dense matrix from vectors as individual columns.
+If you pass row vectors, they will be transposed (but not conjugated!)
+
+
+## Syntax
+
+```js
+math.matrixFromColumns(...arr)
+math.matrixFromColumns(col1, col2)
+math.matrixFromColumns(col1, col2, col3)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`cols` | ... Array &#124; Matrix | Multiple columns
+
+### Returns
+
+Type | Description
+---- | -----------
+number[][] &#124; Matrix | if at least one of the arguments is an array, an array will be returned
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])
+math.matrixFromColumns(...vectors)
+```
+
+
+## See also
+
+[matrix](matrix.md),
+[matrixFromRows](matrixFromRows.md),
+[matrixFromFunction](matrixFromFunction.md),
+[zeros](zeros.md)
diff --git a/node_modules/mathjs/docs/reference/functions/matrixFromFunction.md b/node_modules/mathjs/docs/reference/functions/matrixFromFunction.md
new file mode 100644
index 0000000..8529643
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/matrixFromFunction.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function matrixFromFunction
+
+Create a matrix by evaluating a generating function at each index.
+The simplest overload returns a multi-dimensional array as long as `size` is an array.
+Passing `size` as a Matrix or specifying a `format` will result in returning a Matrix.
+
+
+## Syntax
+
+```js
+math.matrixFromFunction(size, fn)
+math.matrixFromFunction(size, fn, format)
+math.matrixFromFunction(size, fn, format, datatype)
+math.matrixFromFunction(size, format, fn)
+math.matrixFromFunction(size, format, datatype, fn)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`size` | Array &#124; Matrix | The size of the matrix to be created
+`fn` | function | Callback function invoked for every entry in the matrix
+`format` | string | The Matrix storage format, either `'dense'` or `'sparse'`
+`datatype` | string | Type of the values
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | Returns the created matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix
+math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix
+math.matrixFromFunction([5], i => math.random()) // a random vector
+```
+
+
+## See also
+
+[matrix](matrix.md),
+[zeros](zeros.md)
diff --git a/node_modules/mathjs/docs/reference/functions/matrixFromRows.md b/node_modules/mathjs/docs/reference/functions/matrixFromRows.md
new file mode 100644
index 0000000..a7de41f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/matrixFromRows.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function matrixFromRows
+
+Create a dense matrix from vectors as individual rows.
+If you pass column vectors, they will be transposed (but not conjugated!)
+
+
+## Syntax
+
+```js
+math.matrixFromRows(...arr)
+math.matrixFromRows(row1, row2)
+math.matrixFromRows(row1, row2, row3)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`rows` | ... Array &#124; Matrix | Multiple rows
+
+### Returns
+
+Type | Description
+---- | -----------
+number[][] &#124; Matrix | if at least one of the arguments is an array, an array will be returned
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.matrixFromRows([1, 2, 3], [[4],[5],[6]])
+math.matrixFromRows(...vectors)
+```
+
+
+## See also
+
+[matrix](matrix.md),
+[matrixFromColumns](matrixFromColumns.md),
+[matrixFromFunction](matrixFromFunction.md),
+[zeros](zeros.md)
diff --git a/node_modules/mathjs/docs/reference/functions/max.md b/node_modules/mathjs/docs/reference/functions/max.md
new file mode 100644
index 0000000..4ffc4d0
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/max.md
@@ -0,0 +1,61 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function max
+
+Compute the maximum value of a matrix or a  list with values.
+In case of a multi dimensional array, the maximum of the flattened array
+will be calculated. When `dim` is provided, the maximum over the selected
+dimension will be calculated. Parameter `dim` is zero-based.
+
+
+## Syntax
+
+```js
+math.max(a, b, c, ...)
+math.max(A)
+math.max(A, dim)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix or or multiple scalar values
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The maximum value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.max(2, 1, 4, 3)                  // returns 4
+math.max([2, 1, 4, 3])                // returns 4
+
+// maximum over a specified dimension (zero-based)
+math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]
+math.max([[2, 5], [4, 3]], [1, 7], 1) // returns [5, 4, 7]
+
+math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+```
+
+
+## See also
+
+[mean](mean.md),
+[median](median.md),
+[min](min.md),
+[prod](prod.md),
+[std](std.md),
+[sum](sum.md),
+[variance](variance.md)
diff --git a/node_modules/mathjs/docs/reference/functions/mean.md b/node_modules/mathjs/docs/reference/functions/mean.md
new file mode 100644
index 0000000..ae921f6
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/mean.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function mean
+
+Compute the mean value of matrix or a list with values.
+In case of a multi dimensional array, the mean of the flattened array
+will be calculated. When `dim` is provided, the maximum over the selected
+dimension will be calculated. Parameter `dim` is zero-based.
+
+
+## Syntax
+
+```js
+math.mean(a, b, c, ...)
+math.mean(A)
+math.mean(A, dim)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix or or multiple scalar values
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The mean of all values
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.mean(2, 1, 4, 3)                     // returns 2.5
+math.mean([1, 2.7, 3.2, 4])               // returns 2.725
+
+math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]
+math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]
+```
+
+
+## See also
+
+[median](median.md),
+[min](min.md),
+[max](max.md),
+[sum](sum.md),
+[prod](prod.md),
+[std](std.md),
+[variance](variance.md)
diff --git a/node_modules/mathjs/docs/reference/functions/median.md b/node_modules/mathjs/docs/reference/functions/median.md
new file mode 100644
index 0000000..6d7134c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/median.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function median
+
+Compute the median of a matrix or a list with values. The values are
+sorted and the middle value is returned. In case of an even number of
+values, the average of the two middle values is returned.
+Supported types of values are: Number, BigNumber, Unit
+
+In case of a (multi dimensional) array or matrix, the median of all
+elements will be calculated.
+
+
+## Syntax
+
+```js
+math.median(a, b, c, ...)
+math.median(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix or or multiple scalar values
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The median
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.median(5, 2, 7)        // returns 5
+math.median([3, -1, 5, 7])  // returns 4
+```
+
+
+## See also
+
+[mean](mean.md),
+[min](min.md),
+[max](max.md),
+[sum](sum.md),
+[prod](prod.md),
+[std](std.md),
+[variance](variance.md),
+[quantileSeq](quantileSeq.md)
diff --git a/node_modules/mathjs/docs/reference/functions/min.md b/node_modules/mathjs/docs/reference/functions/min.md
new file mode 100644
index 0000000..799e42f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/min.md
@@ -0,0 +1,61 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function min
+
+Compute the minimum value of a matrix or a  list of values.
+In case of a multi dimensional array, the minimum of the flattened array
+will be calculated. When `dim` is provided, the minimum over the selected
+dimension will be calculated. Parameter `dim` is zero-based.
+
+
+## Syntax
+
+```js
+math.min(a, b, c, ...)
+math.min(A)
+math.min(A, dim)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix or or multiple scalar values
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The minimum value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.min(2, 1, 4, 3)                  // returns 1
+math.min([2, 1, 4, 3])                // returns 1
+
+// minimum over a specified dimension (zero-based)
+math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]
+math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]
+
+math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+```
+
+
+## See also
+
+[mean](mean.md),
+[median](median.md),
+[max](max.md),
+[prod](prod.md),
+[std](std.md),
+[sum](sum.md),
+[variance](variance.md)
diff --git a/node_modules/mathjs/docs/reference/functions/mod.md b/node_modules/mathjs/docs/reference/functions/mod.md
new file mode 100644
index 0000000..271c097
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/mod.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function mod
+
+Calculates the modulus, the remainder of an integer division.
+
+For matrices, the function is evaluated element wise.
+
+The modulus is defined as:
+
+    x - y * floor(x / y)
+
+See https://en.wikipedia.org/wiki/Modulo_operation.
+
+
+## Syntax
+
+```js
+math.mod(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Array &#124; Matrix | Dividend
+`y` | number &#124; BigNumber &#124; Fraction &#124; Array &#124; Matrix | Divisor
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Array &#124; Matrix | Returns the remainder of `x` divided by `y`.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.mod(8, 3)                // returns 2
+math.mod(11, 2)               // returns 1
+
+function isOdd(x) {
+  return math.mod(x, 2) != 0
+}
+
+isOdd(2)                      // returns false
+isOdd(3)                      // returns true
+```
+
+
+## See also
+
+[divide](divide.md)
diff --git a/node_modules/mathjs/docs/reference/functions/mode.md b/node_modules/mathjs/docs/reference/functions/mode.md
new file mode 100644
index 0000000..744ed41
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/mode.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function mode
+
+Computes the mode of a set of numbers or a list with values(numbers or characters).
+If there are more than one modes, it returns a list of those values.
+
+
+## Syntax
+
+```js
+math.mode(a, b, c, ...)
+math.mode(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The mode of all values
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.mode(2, 1, 4, 3, 1)                            // returns [1]
+math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]
+math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]
+math.mode('a','a','b','c')                           // returns ["a"]
+math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, "abc"]
+```
+
+
+## See also
+
+[median](median.md),
+[](.md),
+[mean](mean.md)
diff --git a/node_modules/mathjs/docs/reference/functions/multinomial.md b/node_modules/mathjs/docs/reference/functions/multinomial.md
new file mode 100644
index 0000000..a98b580
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/multinomial.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function multinomial
+
+Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.
+
+multinomial takes one array of integers as an argument.
+The following condition must be enforced: every ai <= 0
+
+
+## Syntax
+
+```js
+math.multinomial(a) // a is an array type
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a` | number[] &#124; BigNumber[] | Integer numbers of objects in the subset
+
+### Returns
+
+Type | Description
+---- | -----------
+Number &#124; BigNumber | Multinomial coefficient.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.multinomial([1,2,1]) // returns 12
+```
+
+
+## See also
+
+[combinations](combinations.md),
+[factorial](factorial.md)
diff --git a/node_modules/mathjs/docs/reference/functions/multiply.md b/node_modules/mathjs/docs/reference/functions/multiply.md
new file mode 100644
index 0000000..f85c2cd
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/multiply.md
@@ -0,0 +1,60 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function multiply
+
+Multiply two or more values, `x * y`.
+For matrices, the matrix product is calculated.
+
+
+## Syntax
+
+```js
+math.multiply(x, y)
+math.multiply(x, y, z, ...)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | First value to multiply
+`y` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Second value to multiply
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Multiplication of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.multiply(4, 5.2)        // returns number 20.8
+math.multiply(2, 3, 4)       // returns number 24
+
+const a = math.complex(2, 3)
+const b = math.complex(4, 1)
+math.multiply(a, b)          // returns Complex 5 + 14i
+
+const c = [[1, 2], [4, 3]]
+const d = [[1, 2, 3], [3, -4, 7]]
+math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]
+
+const e = math.unit('2.1 km')
+math.multiply(3, e)          // returns Unit 6.3 km
+```
+
+
+## See also
+
+[divide](divide.md),
+[prod](prod.md),
+[cross](cross.md),
+[dot](dot.md)
diff --git a/node_modules/mathjs/docs/reference/functions/norm.md b/node_modules/mathjs/docs/reference/functions/norm.md
new file mode 100644
index 0000000..a531a95
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/norm.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function norm
+
+Calculate the norm of a number, vector or matrix.
+
+The second parameter p is optional. If not provided, it defaults to 2.
+
+
+## Syntax
+
+```js
+math.norm(x)
+math.norm(x, p)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  Value for which to calculate the norm
+`p` | number &#124; BigNumber &#124; string |  Vector space. Supported numbers include Infinity and -Infinity. Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm) Default value: 2.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber | the p-norm
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.abs(-3.5)                         // returns 3.5
+math.norm(-3.5)                        // returns 3.5
+
+math.norm(math.complex(3, -4))         // returns 5
+
+math.norm([1, 2, -3], Infinity)        // returns 3
+math.norm([1, 2, -3], -Infinity)       // returns 1
+
+math.norm([3, 4], 2)                   // returns 5
+
+math.norm([[1, 2], [3, 4]], 1)          // returns 6
+math.norm([[1, 2], [3, 4]], 'inf')     // returns 7
+math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661
+```
+
+
+## See also
+
+[abs](abs.md),
+[hypot](hypot.md)
diff --git a/node_modules/mathjs/docs/reference/functions/not.md b/node_modules/mathjs/docs/reference/functions/not.md
new file mode 100644
index 0000000..3ab29d4
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/not.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function not
+
+Logical `not`. Flips boolean value of a given parameter.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.not(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | First value to check
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix |  Returns true when input is a zero or empty value.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.not(2)      // returns false
+math.not(0)      // returns true
+math.not(true)   // returns false
+
+a = [2, -7, 0]
+math.not(a)      // returns [false, false, true]
+```
+
+
+## See also
+
+[and](and.md),
+[or](or.md),
+[xor](xor.md)
diff --git a/node_modules/mathjs/docs/reference/functions/nthRoot.md b/node_modules/mathjs/docs/reference/functions/nthRoot.md
new file mode 100644
index 0000000..be8b7ad
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/nthRoot.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function nthRoot
+
+Calculate the nth root of a value.
+The principal nth root of a positive real number A, is the positive real
+solution of the equation
+
+    x^root = A
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.nthRoot(a)
+math.nthRoot(a, root)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a` | number &#124; BigNumber &#124; Array &#124; Matrix &#124; Complex |  Value for which to calculate the nth root
+`root` | number &#124; BigNumber | The root. Default value: 2.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Returns the nth root of `a`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.nthRoot(9, 2)    // returns 3, as 3^2 == 9
+math.sqrt(9)          // returns 3, as 3^2 == 9
+math.nthRoot(64, 3)   // returns 4, as 4^3 == 64
+```
+
+
+## See also
+
+[sqrt](sqrt.md),
+[pow](pow.md)
diff --git a/node_modules/mathjs/docs/reference/functions/nthRoots.md b/node_modules/mathjs/docs/reference/functions/nthRoots.md
new file mode 100644
index 0000000..f655845
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/nthRoots.md
@@ -0,0 +1,58 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function nthRoots
+
+Calculate the nth roots of a value.
+An nth root of a positive real number A,
+is a positive real solution of the equation "x^root = A".
+This function returns an array of complex values.
+
+
+## Syntax
+
+```js
+math.nthRoots(x)
+math.nthRoots(x, root)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex | Number to be rounded
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex | Rounded value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.nthRoots(1)
+// returns [
+//   {re: 1, im: 0},
+//   {re: -1, im: 0}
+// ]
+nthRoots(1, 3)
+// returns [
+//   { re: 1, im: 0 },
+//   { re: -0.4999999999999998, im: 0.8660254037844387 },
+//   { re: -0.5000000000000004, im: -0.8660254037844385 }
+]
+```
+
+
+## See also
+
+[nthRoot](nthRoot.md),
+[pow](pow.md),
+[sqrt](sqrt.md)
diff --git a/node_modules/mathjs/docs/reference/functions/number.md b/node_modules/mathjs/docs/reference/functions/number.md
new file mode 100644
index 0000000..61bc017
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/number.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function number
+
+Create a number or convert a string, boolean, or unit to a number.
+When value is a matrix, all elements will be converted to number.
+
+
+## Syntax
+
+```js
+math.number(value)
+math.number(unit, valuelessUnit)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | string &#124; number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Array &#124; Matrix &#124; Unit &#124; null | Value to be converted
+`valuelessUnit` | Unit &#124; string | A valueless unit, used to convert a unit to a number
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; Matrix | The created number
+
+
+## Examples
+
+```js
+math.number(2)                         // returns number 2
+math.number('7.2')                     // returns number 7.2
+math.number(true)                      // returns number 1
+math.number([true, false, true, true]) // returns [1, 0, 1, 1]
+math.number(math.unit('52cm'), 'm')    // returns 0.52
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[boolean](boolean.md),
+[complex](complex.md),
+[index](index.md),
+[matrix](matrix.md),
+[string](string.md),
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/numeric.md b/node_modules/mathjs/docs/reference/functions/numeric.md
new file mode 100644
index 0000000..fa58b35
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/numeric.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function numeric
+
+Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.
+
+
+## Syntax
+
+```js
+math.numeric(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | string &#124; number &#124; BigNumber &#124; Fraction |  A numeric value or a string containing a numeric value
+`outputType` | string |  Desired numeric output type. Available values: 'number', 'BigNumber', or 'Fraction'
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction |  Returns an instance of the numeric in the requested type
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.numeric('4')                           // returns number 4
+math.numeric('4', 'number')                 // returns number 4
+math.numeric('4', 'BigNumber')              // returns BigNumber 4
+math.numeric('4', 'Fraction')               // returns Fraction 4
+math.numeric(4, 'Fraction')                 // returns Fraction 4
+math.numeric(math.fraction(2, 5), 'number') // returns number 0.4
+```
+
+
+## See also
+
+[number](number.md),
+[fraction](fraction.md),
+[bignumber](bignumber.md),
+[string](string.md),
+[format](format.md)
diff --git a/node_modules/mathjs/docs/reference/functions/oct.md b/node_modules/mathjs/docs/reference/functions/oct.md
new file mode 100644
index 0000000..71d87b5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/oct.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function oct
+
+Format a number as octal.
+
+
+## Syntax
+
+```js
+math.oct(value)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | number | Value to be stringified
+`wordSize` | number | Optional word size (see `format`)
+
+### Returns
+
+Type | Description
+---- | -----------
+string | The formatted value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+//the following outputs "0o70"
+math.oct(56)
+```
+
+
+## See also
+
+[bin](bin.md),
+[hex](hex.md)
diff --git a/node_modules/mathjs/docs/reference/functions/ones.md b/node_modules/mathjs/docs/reference/functions/ones.md
new file mode 100644
index 0000000..5e372d8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/ones.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function ones
+
+Create a matrix filled with ones. The created matrix can have one or
+multiple dimensions.
+
+
+## Syntax
+
+```js
+math.ones(m)
+math.ones(m, format)
+math.ones(m, n)
+math.ones(m, n, format)
+math.ones([m, n])
+math.ones([m, n], format)
+math.ones([m, n, p, ...])
+math.ones([m, n, p, ...], format)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`size` | ...number &#124; Array | The size of each dimension of the matrix
+`format` | string | The Matrix storage format
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix &#124; number | A matrix filled with ones
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.ones(3)                   // returns [1, 1, 1]
+math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]
+math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]
+
+const A = [[1, 2, 3], [4, 5, 6]]
+math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]
+```
+
+
+## See also
+
+[zeros](zeros.md),
+[identity](identity.md),
+[size](size.md),
+[range](range.md)
diff --git a/node_modules/mathjs/docs/reference/functions/or.md b/node_modules/mathjs/docs/reference/functions/or.md
new file mode 100644
index 0000000..2e565e2
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/or.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function or
+
+Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.or(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | First value to check
+`y` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Second value to check
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix |  Returns true when one of the inputs is defined with a nonzero/nonempty value.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.or(2, 4)   // returns true
+
+a = [2, 5, 0]
+b = [0, 22, 0]
+c = 0
+
+math.or(a, b)   // returns [true, true, false]
+math.or(b, c)   // returns [false, true, false]
+```
+
+
+## See also
+
+[and](and.md),
+[not](not.md),
+[xor](xor.md)
diff --git a/node_modules/mathjs/docs/reference/functions/parse.md b/node_modules/mathjs/docs/reference/functions/parse.md
new file mode 100644
index 0000000..5370b95
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/parse.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function parse
+
+Parse an expression. Returns a node tree, which can be evaluated by
+invoking node.evaluate().
+
+Note the evaluating arbitrary expressions may involve security risks,
+see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+
+
+## Syntax
+
+```js
+math.parse(expr)
+math.parse(expr, options)
+math.parse([expr1, expr2, expr3, ...])
+math.parse([expr1, expr2, expr3, ...], options)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr` | string &#124; string[] &#124; Matrix | Expression to be parsed
+`options` | {nodes: Object&lt;string, Node&gt;} | Available options:</br>- `nodes` a set of custom nodes
+
+### Returns
+
+Type | Description
+---- | -----------
+Node &#124; Node[] | node
+
+
+## Examples
+
+```js
+const node1 = math.parse('sqrt(3^2 + 4^2)')
+node1.compile().evaluate() // 5
+
+let scope = {a:3, b:4}
+const node2 = math.parse('a * b') // 12
+const code2 = node2.compile()
+code2.evaluate(scope) // 12
+scope.a = 5
+code2.evaluate(scope) // 20
+
+const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
+nodes[2].compile().evaluate() // 12
+```
+
+
+## See also
+
+[evaluate](evaluate.md),
+[compile](compile.md)
diff --git a/node_modules/mathjs/docs/reference/functions/parser.md b/node_modules/mathjs/docs/reference/functions/parser.md
new file mode 100644
index 0000000..1027709
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/parser.md
@@ -0,0 +1,70 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function parser
+
+Create a parser. The function creates a new `math.Parser` object.
+
+
+## Syntax
+
+```js
+math.parser()
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+
+
+### Returns
+
+Type | Description
+---- | -----------
+Parser | Parser
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const parser = new math.parser()
+
+// evaluate expressions
+const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5
+const b = parser.evaluate('sqrt(-4)')        // 2i
+const c = parser.evaluate('2 inch in cm')    // 5.08 cm
+const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476
+
+// define variables and functions
+parser.evaluate('x = 7 / 2')             // 3.5
+parser.evaluate('x + 3')                 // 6.5
+parser.evaluate('f(x, y) = x^y')         // f(x, y)
+parser.evaluate('f(2, 3)')               // 8
+
+// get and set variables and functions
+const x = parser.get('x')                // 7
+const f = parser.get('f')                // function
+const g = f(3, 2)                        // 9
+parser.set('h', 500)
+const i = parser.evaluate('h / 2')       // 250
+parser.set('hello', function (name) {
+  return 'hello, ' + name + '!'
+})
+parser.evaluate('hello("user")')         // "hello, user!"
+
+// clear defined functions and variables
+parser.clear()
+```
+
+
+## See also
+
+[evaluate](evaluate.md),
+[compile](compile.md),
+[parse](parse.md)
diff --git a/node_modules/mathjs/docs/reference/functions/partitionSelect.md b/node_modules/mathjs/docs/reference/functions/partitionSelect.md
new file mode 100644
index 0000000..1ab1e01
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/partitionSelect.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function partitionSelect
+
+Partition-based selection of an array or 1D matrix.
+Will find the kth smallest value, and mutates the input array.
+Uses Quickselect.
+
+
+## Syntax
+
+```js
+math.partitionSelect(x, k)
+math.partitionSelect(x, k, compare)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | A one dimensional matrix or array to sort
+`k` | Number | The kth smallest value to be retrieved zero-based index
+`compare` | Function &#124; 'asc' &#124; 'desc' |  An optional comparator function. The function is called as `compare(a, b)`, and must return 1 when a > b, -1 when a < b, and 0 when a == b. Default value: 'asc'.
+
+### Returns
+
+Type | Description
+---- | -----------
+* | Returns the kth lowest value.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.partitionSelect([5, 10, 1], 2)           // returns 10
+math.partitionSelect(['C', 'B', 'A', 'D'], 1) // returns 'B'
+
+function sortByLength (a, b) {
+  return a.length - b.length
+}
+math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'
+```
+
+
+## See also
+
+[sort](sort.md)
diff --git a/node_modules/mathjs/docs/reference/functions/permutations.md b/node_modules/mathjs/docs/reference/functions/permutations.md
new file mode 100644
index 0000000..46853a5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/permutations.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function permutations
+
+Compute the number of ways of obtaining an ordered subset of `k` elements
+from a set of `n` elements.
+
+Permutations only takes integer arguments.
+The following condition must be enforced: k <= n.
+
+
+## Syntax
+
+```js
+math.permutations(n)
+math.permutations(n, k)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | number &#124; BigNumber | The number of objects in total
+`k` | number &#124; BigNumber | The number of objects in the subset
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber | The number of permutations
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.permutations(5)     // 120
+math.permutations(5, 3)  // 60
+```
+
+
+## See also
+
+[combinations](combinations.md),
+[combinationsWithRep](combinationsWithRep.md),
+[factorial](factorial.md)
diff --git a/node_modules/mathjs/docs/reference/functions/pickRandom.md b/node_modules/mathjs/docs/reference/functions/pickRandom.md
new file mode 100644
index 0000000..a945714
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/pickRandom.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function pickRandom
+
+Random pick one or more values from a one dimensional array.
+Array elements are picked using a random function with uniform or weighted distribution.
+
+
+## Syntax
+
+```js
+math.pickRandom(array)
+math.pickRandom(array, number)
+math.pickRandom(array, weights)
+math.pickRandom(array, number, weights)
+math.pickRandom(array, weights, number)
+math.pickRandom(array, { weights, number, elementWise })
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`array` | Array &#124; Matrix | A one dimensional array
+`number` | Int | An int or float
+`weights` | Array &#124; Matrix | An array of ints or floats
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array | Returns a single random value from array when number is 1 or undefined. Returns an array with the configured number of elements when number is > 1.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array
+math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array
+math.pickRandom([3, 6, 12, 2], { number: 2 })   // returns an array of two of the values in the array
+math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution
+math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution
+math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution
+
+math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })
+    // returns one of the items in the array
+```
+
+
+## See also
+
+[random](random.md),
+[randomInt](randomInt.md)
diff --git a/node_modules/mathjs/docs/reference/functions/pow.md b/node_modules/mathjs/docs/reference/functions/pow.md
new file mode 100644
index 0000000..bd75d21
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/pow.md
@@ -0,0 +1,59 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function pow
+
+Calculates the power of x to y, `x ^ y`.
+Matrix exponentiation is supported for square matrices `x`, and positive
+integer exponents `y`.
+
+For cubic roots of negative numbers, the function returns the principal
+root by default. In order to let the function return the real root,
+math.js can be configured with `math.config({predictable: true})`.
+To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.
+
+
+## Syntax
+
+```js
+math.pow(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | The base
+`y` | number &#124; BigNumber &#124; Complex | The exponent
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | The value of `x` to the power `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.pow(2, 3)               // returns number 8
+
+const a = math.complex(2, 3)
+math.pow(a, 2)                // returns Complex -5 + 12i
+
+const b = [[1, 2], [4, 3]]
+math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]
+```
+
+
+## See also
+
+[multiply](multiply.md),
+[sqrt](sqrt.md),
+[cbrt](cbrt.md),
+[nthRoot](nthRoot.md)
diff --git a/node_modules/mathjs/docs/reference/functions/print.md b/node_modules/mathjs/docs/reference/functions/print.md
new file mode 100644
index 0000000..442f2d1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/print.md
@@ -0,0 +1,64 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function print
+
+Interpolate values into a string template.
+
+
+## Syntax
+
+```js
+math.print(template, values)
+math.print(template, values, precision)
+math.print(template, values, options)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`template` | string | A string containing variable placeholders.
+`values` | Object &#124; Array &#124; Matrix | An object or array containing variables which will be filled in in the template.
+`options` | number &#124; Object | Formatting options, or the number of digits to format numbers. See function math.format for a description of all options.
+
+### Returns
+
+Type | Description
+---- | -----------
+string | Interpolated string
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// the following outputs: 'Lucy is 5 years old'
+math.print('Lucy is $age years old', {age: 5})
+
+// the following outputs: 'The value of pi is 3.141592654'
+math.print('The value of pi is $pi', {pi: math.pi}, 10)
+
+// the following outputs: 'hello Mary! The date is 2013-03-23'
+math.print('Hello $user.name! The date is $date', {
+  user: {
+    name: 'Mary',
+  },
+  date: new Date(2013, 2, 23).toISOString().substring(0, 10)
+})
+
+// the following outputs: 'My favorite fruits are apples and bananas !'
+math.print('My favorite fruits are $0 and $1 !', [
+  'apples',
+  'bananas'
+])
+```
+
+
+## See also
+
+[format](format.md)
diff --git a/node_modules/mathjs/docs/reference/functions/prod.md b/node_modules/mathjs/docs/reference/functions/prod.md
new file mode 100644
index 0000000..3c2812c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/prod.md
@@ -0,0 +1,55 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function prod
+
+Compute the product of a matrix or a list with values.
+In case of a (multi dimensional) array or matrix, the sum of all
+elements will be calculated.
+
+
+## Syntax
+
+```js
+math.prod(a, b, c, ...)
+math.prod(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix or or multiple scalar values
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The product of all values
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.multiply(2, 3)           // returns 6
+math.prod(2, 3)               // returns 6
+math.prod(2, 3, 4)            // returns 24
+math.prod([2, 3, 4])          // returns 24
+math.prod([[2, 5], [4, 3]])   // returns 120
+```
+
+
+## See also
+
+[mean](mean.md),
+[median](median.md),
+[min](min.md),
+[max](max.md),
+[sum](sum.md),
+[std](std.md),
+[variance](variance.md)
diff --git a/node_modules/mathjs/docs/reference/functions/qr.md b/node_modules/mathjs/docs/reference/functions/qr.md
new file mode 100644
index 0000000..327f93c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/qr.md
@@ -0,0 +1,65 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function qr
+
+Calculate the Matrix QR decomposition. Matrix `A` is decomposed in
+two matrices (`Q`, `R`) where `Q` is an
+orthogonal matrix and `R` is an upper triangular matrix.
+
+
+## Syntax
+
+```js
+math.qr(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`A` | Matrix &#124; Array | A two dimensional matrix or array for which to get the QR decomposition.
+
+### Returns
+
+Type | Description
+---- | -----------
+{Q: Array &#124; Matrix, R: Array &#124; Matrix} | Q: the orthogonal matrix and R: the upper triangular matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const m = [
+  [1, -1,  4],
+  [1,  4, -2],
+  [1,  4,  2],
+  [1,  -1, 0]
+]
+const result = math.qr(m)
+// r = {
+//   Q: [
+//     [0.5, -0.5,   0.5],
+//     [0.5,  0.5,  -0.5],
+//     [0.5,  0.5,   0.5],
+//     [0.5, -0.5,  -0.5],
+//   ],
+//   R: [
+//     [2, 3,  2],
+//     [0, 5, -2],
+//     [0, 0,  4],
+//     [0, 0,  0]
+//   ]
+// }
+```
+
+
+## See also
+
+[lup](lup.md),
+[lusolve](lusolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/quantileSeq.md b/node_modules/mathjs/docs/reference/functions/quantileSeq.md
new file mode 100644
index 0000000..c3518fb
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/quantileSeq.md
@@ -0,0 +1,62 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function quantileSeq
+
+Compute the prob order quantile of a matrix or a list with values.
+The sequence is sorted and the middle value is returned.
+Supported types of sequence values are: Number, BigNumber, Unit
+Supported types of probability are: Number, BigNumber
+
+In case of a (multi dimensional) array or matrix, the prob order quantile
+of all elements will be calculated.
+
+
+## Syntax
+
+```js
+math.quantileSeq(A, prob[, sorted])
+math.quantileSeq(A, [prob1, prob2, ...][, sorted])
+math.quantileSeq(A, N[, sorted])
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`data` | Array, Matrix | A single matrix or Array
+`probOrN` | Number, BigNumber, Array | prob is the order of the quantile, while N is the amount of evenly distributed steps of probabilities; only one of these options can be provided
+`sorted` | Boolean | =false              is data sorted in ascending order
+
+### Returns
+
+Type | Description
+---- | -----------
+Number, BigNumber, Unit, Array | Quantile(s)
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4
+math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]
+math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]
+math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4
+```
+
+
+## See also
+
+[median](median.md),
+[mean](mean.md),
+[min](min.md),
+[max](max.md),
+[sum](sum.md),
+[prod](prod.md),
+[std](std.md),
+[variance](variance.md)
diff --git a/node_modules/mathjs/docs/reference/functions/random.md b/node_modules/mathjs/docs/reference/functions/random.md
new file mode 100644
index 0000000..3d7a27f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/random.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function random
+
+Return a random number larger or equal to `min` and smaller than `max`
+using a uniform distribution.
+
+
+## Syntax
+
+```js
+math.random()                // generate a random number between 0 and 1
+math.random(max)             // generate a random number between 0 and max
+math.random(min, max)        // generate a random number between min and max
+math.random(size)            // generate a matrix with random numbers between 0 and 1
+math.random(size, max)       // generate a matrix with random numbers between 0 and max
+math.random(size, min, max)  // generate a matrix with random numbers between min and max
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`size` | Array &#124; Matrix | If provided, an array or matrix with given size and filled with random values is returned
+`min` | number | Minimum boundary for the random value, included
+`max` | number | Maximum boundary for the random value, excluded
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; Matrix | A random number
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.random()       // returns a random number between 0 and 1
+math.random(100)    // returns a random number between 0 and 100
+math.random(30, 40) // returns a random number between 30 and 40
+math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1
+```
+
+
+## See also
+
+[randomInt](randomInt.md),
+[pickRandom](pickRandom.md)
diff --git a/node_modules/mathjs/docs/reference/functions/randomInt.md b/node_modules/mathjs/docs/reference/functions/randomInt.md
new file mode 100644
index 0000000..7706888
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/randomInt.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function randomInt
+
+Return a random integer number larger or equal to `min` and smaller than `max`
+using a uniform distribution.
+
+
+## Syntax
+
+```js
+math.randomInt()                // generate a random integer between 0 and 1
+math.randomInt(max)             // generate a random integer between 0 and max
+math.randomInt(min, max)        // generate a random integer between min and max
+math.randomInt(size)            // generate a matrix with random integer between 0 and 1
+math.randomInt(size, max)       // generate a matrix with random integer between 0 and max
+math.randomInt(size, min, max)  // generate a matrix with random integer between min and max
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`size` | Array &#124; Matrix | If provided, an array or matrix with given size and filled with random values is returned
+`min` | number | Minimum boundary for the random value, included
+`max` | number | Maximum boundary for the random value, excluded
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; Matrix | A random integer value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.randomInt(100)    // returns a random integer between 0 and 100
+math.randomInt(30, 40) // returns a random integer between 30 and 40
+math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1
+```
+
+
+## See also
+
+[random](random.md),
+[pickRandom](pickRandom.md)
diff --git a/node_modules/mathjs/docs/reference/functions/range.md b/node_modules/mathjs/docs/reference/functions/range.md
new file mode 100644
index 0000000..79c9295
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/range.md
@@ -0,0 +1,70 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function range
+
+Create an array from a range.
+By default, the range end is excluded. This can be customized by providing
+an extra parameter `includeEnd`.
+
+
+## Syntax
+
+```js
+math.range(str [, includeEnd])               // Create a range from a string,
+                                             // where the string contains the
+                                             // start, optional step, and end,
+                                             // separated by a colon.
+math.range(start, end [, includeEnd])        // Create a range with start and
+                                             // end and a step size of 1.
+math.range(start, end, step [, includeEnd])  // Create a range with start, step,
+                                             // and end.
+```
+
+### Where
+
+- `str: string`
+  A string 'start:end' or 'start:step:end'
+- `start: {number | BigNumber}`
+  Start of the range
+- `end: number | BigNumber`
+  End of the range, excluded by default, included when parameter includeEnd=true
+- `step: number | BigNumber`
+  Step size. Default value is 1.
+- `includeEnd: boolean`
+  Option to specify whether to include the end or not. False by default.
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | * | Parameters describing the ranges `start`, `end`, and optional `step`.
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | range
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.range(2, 6)        // [2, 3, 4, 5]
+math.range(2, -3, -1)   // [2, 1, 0, -1, -2]
+math.range('2:1:6')     // [2, 3, 4, 5]
+math.range(2, 6, true)  // [2, 3, 4, 5, 6]
+```
+
+
+## See also
+
+[ones](ones.md),
+[zeros](zeros.md),
+[size](size.md),
+[subset](subset.md)
diff --git a/node_modules/mathjs/docs/reference/functions/rationalize.md b/node_modules/mathjs/docs/reference/functions/rationalize.md
new file mode 100644
index 0000000..51fa391
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/rationalize.md
@@ -0,0 +1,68 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function rationalize
+
+Transform a rationalizable expression in a rational fraction.
+If rational fraction is one variable polynomial then converts
+the numerator and denominator in canonical form, with decreasing
+exponents, returning the coefficients of numerator.
+
+
+## Syntax
+
+```js
+rationalize(expr)
+rationalize(expr, detailed)
+rationalize(expr, scope)
+rationalize(expr, scope, detailed)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr` | Node &#124; string | The expression to check if is a polynomial expression
+`optional` | Object &#124; boolean | scope of expression or true for already evaluated rational expression at input
+`detailed` | Boolean | optional True if return an object, false if return expression node (default)
+
+### Returns
+
+Type | Description
+---- | -----------
+Object &#124; Node | The rational polynomial of `expr` or an object `{expression, numerator, denominator, variables, coefficients}`, where `expression` is a `Node` with the node simplified expression, `numerator` is a `Node` with the simplified numerator of expression, `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator), `variables` is an array with variable names, and `coefficients` is an array with coefficients of numerator sorted by increased exponent {Expression Node}  node simplified expression
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.rationalize('sin(x)+y')
+              //  Error: There is an unsolved function call
+math.rationalize('2x/y - y/(x+1)')
+              // (2*x^2-y^2+2*x)/(x*y+y)
+math.rationalize('(2x+1)^6')
+              // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1
+math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')
+              // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)
+math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =
+              // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/
+              //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)
+
+math.rationalize('x+x+x+y',{y:1}) // 3*x+1
+math.rationalize('x+x+x+y',{})    // 3*x+y
+
+const ret = math.rationalize('x+x+x+y',{},true)
+              // ret.expression=3*x+y, ret.variables = ["x","y"]
+const ret = math.rationalize('-2+5x^2',{},true)
+              // ret.expression=5*x^2-2, ret.variables = ["x"], ret.coefficients=[-2,0,5]
+```
+
+
+## See also
+
+[simplify](simplify.md)
diff --git a/node_modules/mathjs/docs/reference/functions/re.md b/node_modules/mathjs/docs/reference/functions/re.md
new file mode 100644
index 0000000..95fc28e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/re.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function re
+
+Get the real part of a complex number.
+For a complex number `a + bi`, the function returns `a`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.re(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix |  A complex number or array with complex numbers
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | The real part of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const a = math.complex(2, 3)
+math.re(a)                     // returns number 2
+math.im(a)                     // returns number 3
+
+math.re(math.complex('-5.2i')) // returns number 0
+math.re(math.complex(2.4))     // returns number 2.4
+```
+
+
+## See also
+
+[im](im.md),
+[conj](conj.md),
+[abs](abs.md),
+[arg](arg.md)
diff --git a/node_modules/mathjs/docs/reference/functions/reshape.md b/node_modules/mathjs/docs/reference/functions/reshape.md
new file mode 100644
index 0000000..97dee1c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/reshape.md
@@ -0,0 +1,60 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function reshape
+
+Reshape a multi dimensional array to fit the specified dimensions
+
+
+## Syntax
+
+```js
+math.reshape(x, sizes)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix &#124; * | Matrix to be reshaped
+`sizes` | number[] | One dimensional array with integral sizes for each dimension. One -1 is allowed as wildcard, which calculates this dimension automatically.
+
+### Returns
+
+Type | Description
+---- | -----------
+* &#124; Array &#124; Matrix | A reshaped clone of matrix `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+TypeError | If `sizes` does not contain solely integers
+DimensionError | If the product of the new dimension sizes does not equal that of the old ones
+
+## Examples
+
+```js
+ math.reshape([1, 2, 3, 4, 5, 6], [2, 3])
+ // returns Array  [[1, 2, 3], [4, 5, 6]]
+
+ math.reshape([[1, 2], [3, 4]], [1, 4])
+ // returns Array  [[1, 2, 3, 4]]
+
+ math.reshape([[1, 2], [3, 4]], [4])
+ // returns Array [1, 2, 3, 4]
+
+ const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])
+ math.reshape(x, [2, 2, 2])
+ // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]
+
+math.reshape([1, 2, 3, 4], [-1, 2])
+// returns Matrix [[1, 2], [3, 4]]
+```
+
+
+## See also
+
+[size](size.md),
+[squeeze](squeeze.md),
+[resize](resize.md)
diff --git a/node_modules/mathjs/docs/reference/functions/resize.md b/node_modules/mathjs/docs/reference/functions/resize.md
new file mode 100644
index 0000000..40fc149
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/resize.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function resize
+
+Resize a matrix
+
+
+## Syntax
+
+```js
+math.resize(x, size)
+math.resize(x, size, defaultValue)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix &#124; * | Matrix to be resized
+`size` | Array &#124; Matrix | One dimensional array with numbers
+`defaultValue` | number &#124; string | Zero by default, except in case of a string, in that case defaultValue = ' ' Default value: 0.
+
+### Returns
+
+Type | Description
+---- | -----------
+* &#124; Array &#124; Matrix | A resized clone of matrix `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]
+math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]
+math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]
+math.resize("hello", [8], "!")    // returns string 'hello!!!'
+```
+
+
+## See also
+
+[size](size.md),
+[squeeze](squeeze.md),
+[subset](subset.md),
+[reshape](reshape.md)
diff --git a/node_modules/mathjs/docs/reference/functions/resolve.md b/node_modules/mathjs/docs/reference/functions/resolve.md
new file mode 100644
index 0000000..f7cc590
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/resolve.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function resolve
+
+resolve(expr, scope) replaces variable nodes with their scoped values
+
+
+## Syntax
+
+```js
+resolve(expr, scope)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`node` | Node |  The expression tree to be simplified
+`scope` | Object |  Scope specifying variables to be resolved
+
+### Returns
+
+Type | Description
+---- | -----------
+Node | Returns `node` with variables recursively substituted.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+ReferenceError |  If there is a cyclic dependency among the variables in `scope`, resolution is impossible and a ReferenceError is thrown.
+
+## Examples
+
+```js
+math.resolve('x + y', {x:1, y:2})           // Node {1 + 2}
+math.resolve(math.parse('x+y'), {x:1, y:2}) // Node {1 + 2}
+math.simplify('x+y', {x:2, y:'x+x'}).toString()      // "6"
+```
+
+
+## See also
+
+[simplify](simplify.md),
+[evaluate](evaluate.md)
diff --git a/node_modules/mathjs/docs/reference/functions/rightArithShift.md b/node_modules/mathjs/docs/reference/functions/rightArithShift.md
new file mode 100644
index 0000000..bf62d95
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/rightArithShift.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function rightArithShift
+
+Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.
+For matrices, the function is evaluated element wise.
+For units, the function is evaluated on the best prefix base.
+
+
+## Syntax
+
+```js
+math.rightArithShift(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Array &#124; Matrix | Value to be shifted
+`y` | number &#124; BigNumber | Amount of shifts
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Array &#124; Matrix | `x` sign-filled shifted right `y` times
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.rightArithShift(4, 2)               // returns number 1
+
+math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 3]
+```
+
+
+## See also
+
+[bitAnd](bitAnd.md),
+[bitNot](bitNot.md),
+[bitOr](bitOr.md),
+[bitXor](bitXor.md),
+[rightArithShift](rightArithShift.md),
+[rightLogShift](rightLogShift.md)
diff --git a/node_modules/mathjs/docs/reference/functions/rightLogShift.md b/node_modules/mathjs/docs/reference/functions/rightLogShift.md
new file mode 100644
index 0000000..a268a25
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/rightLogShift.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function rightLogShift
+
+Bitwise right logical shift of value x by y number of bits, `x >>> y`.
+For matrices, the function is evaluated element wise.
+For units, the function is evaluated on the best prefix base.
+
+
+## Syntax
+
+```js
+math.rightLogShift(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Array &#124; Matrix | Value to be shifted
+`y` | number | Amount of shifts
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Array &#124; Matrix | `x` zero-filled shifted right `y` times
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.rightLogShift(4, 2)               // returns number 1
+
+math.rightLogShift([16, -32, 64], 4)   // returns Array [1, 2, 3]
+```
+
+
+## See also
+
+[bitAnd](bitAnd.md),
+[bitNot](bitNot.md),
+[bitOr](bitOr.md),
+[bitXor](bitXor.md),
+[leftShift](leftShift.md),
+[rightLogShift](rightLogShift.md)
diff --git a/node_modules/mathjs/docs/reference/functions/rotate.md b/node_modules/mathjs/docs/reference/functions/rotate.md
new file mode 100644
index 0000000..e7ace0f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/rotate.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function rotate
+
+Rotate a vector of size 1x2 counter-clockwise by a given angle
+Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis
+
+
+## Syntax
+
+```js
+math.rotate(w, theta)
+math.rotate(w, theta, v)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`w` | Array &#124; Matrix | Vector to rotate
+`theta` | number &#124; BigNumber &#124; Complex &#124; Unit | Rotation angle
+`v` | Array &#124; Matrix | Rotation axis
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | Multiplication of the rotation matrix and w
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.rotate([11, 12], math.pi / 2)                           // returns matrix([-12, 11])
+math.rotate(matrix([11, 12]), math.pi / 2)                   // returns matrix([-12, 11])
+
+math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns matrix([0, 1, 0])
+math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns matrix([0, 1, 0])
+
+math.rotate([1, 0], math.complex(1 + i))                     // returns matrix([cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)])
+```
+
+
+## See also
+
+[matrix](matrix.md),
+[rotationMatrix](rotationMatrix.md)
diff --git a/node_modules/mathjs/docs/reference/functions/rotationMatrix.md b/node_modules/mathjs/docs/reference/functions/rotationMatrix.md
new file mode 100644
index 0000000..34bca0d
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/rotationMatrix.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function rotationMatrix
+
+Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).
+Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).
+
+
+## Syntax
+
+```js
+math.rotationMatrix(theta)
+math.rotationMatrix(theta, format)
+math.rotationMatrix(theta, [v])
+math.rotationMatrix(theta, [v], format)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`theta` | number &#124; BigNumber &#124; Complex &#124; Unit | Rotation angle
+`v` | Array &#124; Matrix | Rotation axis
+`format` | string | Result Matrix storage format
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | Rotation matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]
+math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]
+math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]
+math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]
+
+math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]
+math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])
+
+```
+
+
+## See also
+
+[matrix](matrix.md),
+[cos](cos.md),
+[sin](sin.md)
diff --git a/node_modules/mathjs/docs/reference/functions/round.md b/node_modules/mathjs/docs/reference/functions/round.md
new file mode 100644
index 0000000..c4d43dd
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/round.md
@@ -0,0 +1,61 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function round
+
+Round a value towards the nearest integer.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.round(x)
+math.round(x, n)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Number to be rounded
+`n` | number &#124; BigNumber &#124; Array | Number of decimals Default value: 0.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix | Rounded value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.round(3.22)             // returns number 3
+math.round(3.82)             // returns number 4
+math.round(-4.2)             // returns number -4
+math.round(-4.7)             // returns number -5
+math.round(3.22, 1)          // returns number 3.2
+math.round(3.88, 1)          // returns number 3.9
+math.round(-4.21, 1)         // returns number -4.2
+math.round(-4.71, 1)         // returns number -4.7
+math.round(math.pi, 3)       // returns number 3.142
+math.round(123.45678, 2)     // returns number 123.46
+
+const c = math.complex(3.2, -2.7)
+math.round(c)                // returns Complex 3 - 3i
+
+math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]
+```
+
+
+## See also
+
+[ceil](ceil.md),
+[fix](fix.md),
+[floor](floor.md)
diff --git a/node_modules/mathjs/docs/reference/functions/row.md b/node_modules/mathjs/docs/reference/functions/row.md
new file mode 100644
index 0000000..34d8a59
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/row.md
@@ -0,0 +1,45 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function row
+
+Return a row from a Matrix.
+
+
+## Syntax
+
+```js
+math.row(value, index)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | Array &#124; Matrix | An array or matrix
+`row` | number | The index of the row
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The retrieved row
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// get a row
+const d = [[1, 2], [3, 4]]
+math.row(d, 1) // returns [[3, 4]]
+```
+
+
+## See also
+
+[column](column.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sec.md b/node_modules/mathjs/docs/reference/functions/sec.md
new file mode 100644
index 0000000..f939d04
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sec.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sec
+
+Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.sec(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Secant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sec(2)      // returns number -2.4029979617223822
+1 / math.cos(2)  // returns number -2.4029979617223822
+```
+
+
+## See also
+
+[cos](cos.md),
+[csc](csc.md),
+[cot](cot.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sech.md b/node_modules/mathjs/docs/reference/functions/sech.md
new file mode 100644
index 0000000..13582f4
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sech.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sech
+
+Calculate the hyperbolic secant of a value,
+defined as `sech(x) = 1 / cosh(x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.sech(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; Complex &#124; Array &#124; Matrix | Hyperbolic secant of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// sech(x) = 1/ cosh(x)
+math.sech(0.5)       // returns 0.886818883970074
+1 / math.cosh(0.5)   // returns 0.886818883970074
+```
+
+
+## See also
+
+[cosh](cosh.md),
+[csch](csch.md),
+[coth](coth.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setCartesian.md b/node_modules/mathjs/docs/reference/functions/setCartesian.md
new file mode 100644
index 0000000..da3acfb
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setCartesian.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setCartesian
+
+Create the cartesian product of two (multi)sets.
+Multi-dimension arrays will be converted to single-dimension arrays
+and the values will be sorted in ascending order before the operation.
+
+
+## Syntax
+
+```js
+math.setCartesian(set1, set2)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a1` | Array &#124; Matrix | A (multi)set
+`a2` | Array &#124; Matrix | A (multi)set
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The cartesian product of two (multi)sets
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]
+math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]
+```
+
+
+## See also
+
+[setUnion](setUnion.md),
+[setIntersect](setIntersect.md),
+[setDifference](setDifference.md),
+[setPowerset](setPowerset.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setDifference.md b/node_modules/mathjs/docs/reference/functions/setDifference.md
new file mode 100644
index 0000000..7182764
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setDifference.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setDifference
+
+Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
+Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+
+
+## Syntax
+
+```js
+math.setDifference(set1, set2)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a1` | Array &#124; Matrix | A (multi)set
+`a2` | Array &#124; Matrix | A (multi)set
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The difference of two (multi)sets
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]
+math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]
+```
+
+
+## See also
+
+[setUnion](setUnion.md),
+[setIntersect](setIntersect.md),
+[setSymDifference](setSymDifference.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setDistinct.md b/node_modules/mathjs/docs/reference/functions/setDistinct.md
new file mode 100644
index 0000000..703d3dc
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setDistinct.md
@@ -0,0 +1,43 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setDistinct
+
+Collect the distinct elements of a multiset.
+A multi-dimension array will be converted to a single-dimension array before the operation.
+
+
+## Syntax
+
+```js
+math.setDistinct(set)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a` | Array &#124; Matrix | A multiset
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | A set containing the distinc elements of the multiset
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]
+```
+
+
+## See also
+
+[setMultiplicity](setMultiplicity.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setIntersect.md b/node_modules/mathjs/docs/reference/functions/setIntersect.md
new file mode 100644
index 0000000..b6e2f6a
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setIntersect.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setIntersect
+
+Create the intersection of two (multi)sets.
+Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+
+
+## Syntax
+
+```js
+math.setIntersect(set1, set2)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a1` | Array &#124; Matrix | A (multi)set
+`a2` | Array &#124; Matrix | A (multi)set
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The intersection of two (multi)sets
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]
+math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]
+```
+
+
+## See also
+
+[setUnion](setUnion.md),
+[setDifference](setDifference.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setIsSubset.md b/node_modules/mathjs/docs/reference/functions/setIsSubset.md
new file mode 100644
index 0000000..ee64402
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setIsSubset.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setIsSubset
+
+Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
+Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+
+
+## Syntax
+
+```js
+math.setIsSubset(set1, set2)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a1` | Array &#124; Matrix | A (multi)set
+`a2` | Array &#124; Matrix | A (multi)set
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean | true | false
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false
+math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true
+```
+
+
+## See also
+
+[setUnion](setUnion.md),
+[setIntersect](setIntersect.md),
+[setDifference](setDifference.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setMultiplicity.md b/node_modules/mathjs/docs/reference/functions/setMultiplicity.md
new file mode 100644
index 0000000..9b6decb
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setMultiplicity.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setMultiplicity
+
+Count the multiplicity of an element in a multiset.
+A multi-dimension array will be converted to a single-dimension array before the operation.
+
+
+## Syntax
+
+```js
+math.setMultiplicity(element, set)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`e` | number &#124; BigNumber &#124; Fraction &#124; Complex | An element in the multiset
+`a` | Array &#124; Matrix | A multiset
+
+### Returns
+
+Type | Description
+---- | -----------
+number | The number of how many times the multiset contains the element
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1
+math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2
+```
+
+
+## See also
+
+[setDistinct](setDistinct.md),
+[setSize](setSize.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setPowerset.md b/node_modules/mathjs/docs/reference/functions/setPowerset.md
new file mode 100644
index 0000000..757ee44
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setPowerset.md
@@ -0,0 +1,43 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setPowerset
+
+Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)
+A multi-dimension array will be converted to a single-dimension array before the operation.
+
+
+## Syntax
+
+```js
+math.setPowerset(set)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a` | Array &#124; Matrix | A (multi)set
+
+### Returns
+
+Type | Description
+---- | -----------
+Array | The powerset of the (multi)set
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
+```
+
+
+## See also
+
+[setCartesian](setCartesian.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setSize.md b/node_modules/mathjs/docs/reference/functions/setSize.md
new file mode 100644
index 0000000..133a3d5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setSize.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setSize
+
+Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.
+A multi-dimension array will be converted to a single-dimension array before the operation.
+
+
+## Syntax
+
+```js
+math.setSize(set)
+math.setSize(set, unique)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a` | Array &#124; Matrix | A multiset
+
+### Returns
+
+Type | Description
+---- | -----------
+number | The number of elements of the (multi)set
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setSize([1, 2, 2, 4])          // returns 4
+math.setSize([1, 2, 2, 4], true)    // returns 3
+```
+
+
+## See also
+
+[setUnion](setUnion.md),
+[setIntersect](setIntersect.md),
+[setDifference](setDifference.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setSymDifference.md b/node_modules/mathjs/docs/reference/functions/setSymDifference.md
new file mode 100644
index 0000000..51a2642
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setSymDifference.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setSymDifference
+
+Create the symmetric difference of two (multi)sets.
+Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+
+
+## Syntax
+
+```js
+math.setSymDifference(set1, set2)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a1` | Array &#124; Matrix | A (multi)set
+`a2` | Array &#124; Matrix | A (multi)set
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The symmetric difference of two (multi)sets
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]
+math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]
+```
+
+
+## See also
+
+[setUnion](setUnion.md),
+[setIntersect](setIntersect.md),
+[setDifference](setDifference.md)
diff --git a/node_modules/mathjs/docs/reference/functions/setUnion.md b/node_modules/mathjs/docs/reference/functions/setUnion.md
new file mode 100644
index 0000000..6e62fc5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/setUnion.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function setUnion
+
+Create the union of two (multi)sets.
+Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+
+
+## Syntax
+
+```js
+math.setUnion(set1, set2)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a1` | Array &#124; Matrix | A (multi)set
+`a2` | Array &#124; Matrix | A (multi)set
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The union of two (multi)sets
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]
+math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]
+```
+
+
+## See also
+
+[setIntersect](setIntersect.md),
+[setDifference](setDifference.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sign.md b/node_modules/mathjs/docs/reference/functions/sign.md
new file mode 100644
index 0000000..37123f6
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sign.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sign
+
+Compute the sign of a value. The sign of a value x is:
+
+-  1 when x > 0
+- -1 when x < 0
+-  0 when x == 0
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.sign(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit |  The number for which to determine the sign
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit | e The sign of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sign(3.5)               // returns 1
+math.sign(-4.2)              // returns -1
+math.sign(0)                 // returns 0
+
+math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]
+```
+
+
+## See also
+
+[abs](abs.md)
diff --git a/node_modules/mathjs/docs/reference/functions/simplify.md b/node_modules/mathjs/docs/reference/functions/simplify.md
new file mode 100644
index 0000000..8605787
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/simplify.md
@@ -0,0 +1,130 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function simplify
+
+Simplify an expression tree.
+
+A list of rules are applied to an expression, repeating over the list until
+no further changes are made.
+It's possible to pass a custom set of rules to the function as second
+argument. A rule can be specified as an object, string, or function:
+
+    const rules = [
+      { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },
+      'n1*n3 + n2*n3 -> (n1+n2)*n3',
+      function (node) {
+        // ... return a new node or return the node unchanged
+        return node
+      }
+    ]
+
+String and object rules consist of a left and right pattern. The left is
+used to match against the expression and the right determines what matches
+are replaced with. The main difference between a pattern and a normal
+expression is that variables starting with the following characters are
+interpreted as wildcards:
+
+- 'n' - matches any Node
+- 'c' - matches any ConstantNode
+- 'v' - matches any Node that is not a ConstantNode
+
+The default list of rules is exposed on the function as `simplify.rules`
+and can be used as a basis to built a set of custom rules.
+
+To specify a rule as a string, separate the left and right pattern by '->'
+When specifying a rule as an object, the following keys are meaningful:
+- l - the left pattern
+- r - the right pattern
+- s - in lieu of l and r, the string form that is broken at -> to give them
+- repeat - whether to repeat this rule until the expression stabilizes
+- assuming - gives a context object, as in the 'context' option to
+    simplify. Every property in the context object must match the current
+    context in order, or else the rule will not be applied.
+- imposeContext - gives a context object, as in the 'context' option to
+    simplify. Any settings specified will override the incoming context
+    for all matches of this rule.
+
+For more details on the theory, see:
+
+- [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
+- [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
+
+ An optional `options` argument can be passed as last argument of `simplify`.
+ Currently available options (defaults in parentheses):
+ - `consoleDebug` (false): whether to write the expression being simplified
+   and any changes to it, along with the rule responsible, to console
+ - `context` (simplify.defaultContext): an object giving properties of
+   each operator, which determine what simplifications are allowed. The
+   currently meaningful properties are commutative, associative,
+   total (whether the operation is defined for all arguments), and
+   trivial (whether the operation applied to a single argument leaves
+   that argument unchanged). The default context is very permissive and
+   allows almost all simplifications. Only properties differing from
+   the default need to be specified; the default context is used as a
+   fallback. Additional contexts `simplify.realContext` and
+   `simplify.positiveContext` are supplied to cause simplify to perform
+   just simplifications guaranteed to preserve all values of the expression
+   assuming all variables and subexpressions are real numbers or
+   positive real numbers, respectively. (Note that these are in some cases
+   more restrictive than the default context; for example, the default
+   context will allow `x/x` to simplify to 1, whereas
+   `simplify.realContext` will not, as `0/0` is not equal to 1.)
+ - `exactFractions` (true): whether to try to convert all constants to
+   exact rational numbers.
+ - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+   be expressed as fractions only when both numerator and denominator
+   are smaller than `fractionsLimit`.
+
+
+## Syntax
+
+```js
+simplify(expr)
+simplify(expr, rules)
+simplify(expr, rules)
+simplify(expr, rules, scope)
+simplify(expr, rules, scope, options)
+simplify(expr, scope)
+simplify(expr, scope, options)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr` | Node &#124; string |  The expression to be simplified
+`rules` | Array&lt;{l:string, r: string} &#124; string &#124; function&gt; |  Optional list with custom rules
+
+### Returns
+
+Type | Description
+---- | -----------
+Node | Returns the simplified form of `expr`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.simplify('2 * 1 * x ^ (2 - 1)')      // Node "2 * x"
+math.simplify('2 * 3 * x', {x: 4})        // Node "24"
+const f = math.parse('2 * 1 * x ^ (2 - 1)')
+math.simplify(f)                          // Node "2 * x"
+math.simplify('0.4 * x', {}, {exactFractions: true})  // Node "x * 2 / 5"
+math.simplify('0.4 * x', {}, {exactFractions: false}) // Node "0.4 * x"
+```
+
+
+## See also
+
+[simplifyCore](simplifyCore.md),
+[derivative](derivative.md),
+[evaluate](evaluate.md),
+[parse](parse.md),
+[rationalize](rationalize.md),
+[resolve](resolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/simplifyCore.md b/node_modules/mathjs/docs/reference/functions/simplifyCore.md
new file mode 100644
index 0000000..df89ab9
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/simplifyCore.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function simplifyCore
+
+simplifyCore() performs single pass simplification suitable for
+applications requiring ultimate performance. In contrast, simplify()
+extends simplifyCore() with additional passes to provide deeper
+simplification.
+
+
+## Syntax
+
+```js
+simplifyCore(expr)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`node` | Node |  The expression to be simplified
+`options` | Object |  Simplification options, as per simplify()
+
+### Returns
+
+Type | Description
+---- | -----------
+Node | Returns expression with basic simplifications applied
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const f = math.parse('2 * 1 * x ^ (2 - 1)')
+math.simpifyCore(f)                          // Node {2 * x}
+math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplifyCore]) // Node {2 * x}
+```
+
+
+## See also
+
+[simplify](simplify.md),
+[resolve](resolve.md),
+[derivative](derivative.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sin.md b/node_modules/mathjs/docs/reference/functions/sin.md
new file mode 100644
index 0000000..c9a0485
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sin.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sin
+
+Calculate the sine of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.sin(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Sine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sin(2)                      // returns number 0.9092974268256813
+math.sin(math.pi / 4)            // returns number 0.7071067811865475
+math.sin(math.unit(90, 'deg'))   // returns number 1
+math.sin(math.unit(30, 'deg'))   // returns number 0.5
+
+const angle = 0.2
+math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
+```
+
+
+## See also
+
+[cos](cos.md),
+[tan](tan.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sinh.md b/node_modules/mathjs/docs/reference/functions/sinh.md
new file mode 100644
index 0000000..52dae97
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sinh.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sinh
+
+Calculate the hyperbolic sine of a value,
+defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.sinh(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Hyperbolic sine of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sinh(0.5)       // returns number 0.5210953054937474
+```
+
+
+## See also
+
+[cosh](cosh.md),
+[tanh](tanh.md)
diff --git a/node_modules/mathjs/docs/reference/functions/size.md b/node_modules/mathjs/docs/reference/functions/size.md
new file mode 100644
index 0000000..d91e58b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/size.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function size
+
+Calculate the size of a matrix or scalar.
+
+
+## Syntax
+
+```js
+math.size(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | boolean &#124; number &#124; Complex &#124; Unit &#124; string &#124; Array &#124; Matrix | A matrix
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | A vector with size of `x`.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.size(2.3)                  // returns []
+math.size('hello world')        // returns [11]
+
+const A = [[1, 2, 3], [4, 5, 6]]
+math.size(A)                    // returns [2, 3]
+math.size(math.range(1,6))      // returns [5]
+```
+
+
+## See also
+
+[count](count.md),
+[resize](resize.md),
+[squeeze](squeeze.md),
+[subset](subset.md)
diff --git a/node_modules/mathjs/docs/reference/functions/slu.md b/node_modules/mathjs/docs/reference/functions/slu.md
new file mode 100644
index 0000000..9d03038
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/slu.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function slu
+
+Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where
+
+`P * A * Q = L * U`
+
+
+## Syntax
+
+```js
+math.slu(A, order, threshold)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`A` | SparseMatrix | A two dimensional sparse matrix for which to get the LU decomposition.
+`order` | Number | The Symbolic Ordering and Analysis order: 0 - Natural ordering, no permutation vector q is returned 1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A' 2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'. This is appropriatefor LU factorization of unsymmetric matrices. 3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.
+`threshold` | Number | Partial pivoting threshold (1 for partial pivoting)
+
+### Returns
+
+Type | Description
+---- | -----------
+Object | The lower triangular matrix, the upper triangular matrix and the permutation vectors.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const A = math.sparse([[4,3], [6, 3]])
+math.slu(A, 1, 0.001)
+// returns:
+// {
+//   L: [[1, 0], [1.5, 1]]
+//   U: [[4, 3], [0, -1.5]]
+//   p: [0, 1]
+//   q: [0, 1]
+// }
+```
+
+
+## See also
+
+[lup](lup.md),
+[lsolve](lsolve.md),
+[usolve](usolve.md),
+[lusolve](lusolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/smaller.md b/node_modules/mathjs/docs/reference/functions/smaller.md
new file mode 100644
index 0000000..5ef2be5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/smaller.md
@@ -0,0 +1,60 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function smaller
+
+Test whether value x is smaller than y.
+
+The function returns true when x is smaller than y and the relative
+difference between x and y is smaller than the configured epsilon. The
+function cannot be used to compare values smaller than approximately 2.22e-16.
+
+For matrices, the function is evaluated element wise.
+Strings are compared by their numerical value.
+
+
+## Syntax
+
+```js
+math.smaller(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | First value to compare
+`y` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix | Returns true when the x is smaller than y, else returns false
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.smaller(2, 3)            // returns true
+math.smaller(5, 2 * 2)        // returns false
+
+const a = math.unit('5 cm')
+const b = math.unit('2 inch')
+math.smaller(a, b)            // returns true
+```
+
+
+## See also
+
+[equal](equal.md),
+[unequal](unequal.md),
+[smallerEq](smallerEq.md),
+[smaller](smaller.md),
+[smallerEq](smallerEq.md),
+[compare](compare.md)
diff --git a/node_modules/mathjs/docs/reference/functions/smallerEq.md b/node_modules/mathjs/docs/reference/functions/smallerEq.md
new file mode 100644
index 0000000..e14ec28
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/smallerEq.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function smallerEq
+
+Test whether value x is smaller or equal to y.
+
+The function returns true when x is smaller than y or the relative
+difference between x and y is smaller than the configured epsilon. The
+function cannot be used to compare values smaller than approximately 2.22e-16.
+
+For matrices, the function is evaluated element wise.
+Strings are compared by their numerical value.
+
+
+## Syntax
+
+```js
+math.smallerEq(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | First value to compare
+`y` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Unit &#124; string &#124; Array &#124; Matrix | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix | Returns true when the x is smaller than y, else returns false
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.smaller(1 + 2, 3)        // returns false
+math.smallerEq(1 + 2, 3)      // returns true
+```
+
+
+## See also
+
+[equal](equal.md),
+[unequal](unequal.md),
+[smaller](smaller.md),
+[larger](larger.md),
+[largerEq](largerEq.md),
+[compare](compare.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sort.md b/node_modules/mathjs/docs/reference/functions/sort.md
new file mode 100644
index 0000000..8d10583
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sort.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sort
+
+Sort the items in a matrix.
+
+
+## Syntax
+
+```js
+math.sort(x)
+math.sort(x, compare)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | A one dimensional matrix or array to sort
+`compare` | Function &#124; 'asc' &#124; 'desc' &#124; 'natural' |  An optional _comparator function or name. The function is called as `compare(a, b)`, and must return 1 when a > b, -1 when a < b, and 0 when a == b. Default value: 'asc'.
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix &#124; Array | Returns the sorted matrix.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sort([5, 10, 1]) // returns [1, 5, 10]
+math.sort(['C', 'B', 'A', 'D'], math.compareNatural)
+// returns ['A', 'B', 'C', 'D']
+
+function sortByLength (a, b) {
+  return a.length - b.length
+}
+math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)
+// returns ['Tom', 'Sara', 'Langdon']
+```
+
+
+## See also
+
+[filter](filter.md),
+[forEach](forEach.md),
+[map](map.md),
+[compare](compare.md),
+[compareNatural](compareNatural.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sparse.md b/node_modules/mathjs/docs/reference/functions/sparse.md
new file mode 100644
index 0000000..083034d
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sparse.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sparse
+
+Create a Sparse Matrix. The function creates a new `math.Matrix` object from
+an `Array`. A Matrix has utility functions to manipulate the data in the
+matrix, like getting the size and getting or setting values in the matrix.
+
+
+## Syntax
+
+```js
+math.sparse()               // creates an empty sparse matrix.
+math.sparse(data)           // creates a sparse matrix with initial data.
+math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`data` | Array &#124; Matrix | A two dimensional array
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix | The created matrix
+
+
+## Examples
+
+```js
+let m = math.sparse([[1, 2], [3, 4]])
+m.size()                        // Array [2, 2]
+m.resize([3, 2], 5)
+m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+m.get([1, 0])                    // number 3
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[boolean](boolean.md),
+[complex](complex.md),
+[index](index.md),
+[number](number.md),
+[string](string.md),
+[unit](unit.md),
+[matrix](matrix.md)
diff --git a/node_modules/mathjs/docs/reference/functions/splitUnit.md b/node_modules/mathjs/docs/reference/functions/splitUnit.md
new file mode 100644
index 0000000..5011952
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/splitUnit.md
@@ -0,0 +1,37 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function splitUnit
+
+Split a unit in an array of units whose sum is equal to the original unit.
+
+
+## Syntax
+
+```js
+splitUnit(unit: Unit, parts: Array.<Unit>)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`parts` | Array | An array of strings or valueless units.
+
+### Returns
+
+Type | Description
+---- | -----------
+Array | An array of units.
+
+
+## Examples
+
+```js
+math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])
+// [ 3 feet, 3.3700787401575 inch ]
+```
+
+
+## See also
+
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sqrt.md b/node_modules/mathjs/docs/reference/functions/sqrt.md
new file mode 100644
index 0000000..cc5c1f8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sqrt.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sqrt
+
+Calculate the square root of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.sqrt(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix &#124; Unit |  Value for which to calculate the square root.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix &#124; Unit |  Returns the square root of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sqrt(25)                // returns 5
+math.square(5)               // returns 25
+math.sqrt(-4)                // returns Complex 2i
+```
+
+
+## See also
+
+[square](square.md),
+[multiply](multiply.md),
+[cube](cube.md),
+[cbrt](cbrt.md),
+[sqrtm](sqrtm.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sqrtm.md b/node_modules/mathjs/docs/reference/functions/sqrtm.md
new file mode 100644
index 0000000..c694cf3
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sqrtm.md
@@ -0,0 +1,46 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sqrtm
+
+Calculate the principal square root of a square matrix.
+The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.
+
+https://en.wikipedia.org/wiki/Square_root_of_a_matrix
+
+
+## Syntax
+
+```js
+X = math.sqrtm(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`A` | Array &#124; Matrix | The square matrix `A`
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The principal square root of matrix `A`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sqrtm([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]
+```
+
+
+## See also
+
+[sqrt](sqrt.md),
+[pow](pow.md)
diff --git a/node_modules/mathjs/docs/reference/functions/square.md b/node_modules/mathjs/docs/reference/functions/square.md
new file mode 100644
index 0000000..b540c9e
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/square.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function square
+
+Compute the square of a value, `x * x`.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.square(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit |  Number for which to calculate the square
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Array &#124; Matrix &#124; Unit |  Squared value
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.square(2)           // returns number 4
+math.square(3)           // returns number 9
+math.pow(3, 2)           // returns number 9
+math.multiply(3, 3)      // returns number 9
+
+math.square([1, 2, 3, 4])  // returns Array [1, 4, 9, 16]
+```
+
+
+## See also
+
+[multiply](multiply.md),
+[cube](cube.md),
+[sqrt](sqrt.md),
+[pow](pow.md)
diff --git a/node_modules/mathjs/docs/reference/functions/squeeze.md b/node_modules/mathjs/docs/reference/functions/squeeze.md
new file mode 100644
index 0000000..7a772fa
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/squeeze.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function squeeze
+
+Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.
+
+
+## Syntax
+
+```js
+math.squeeze(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Matrix &#124; Array | Matrix to be squeezed
+
+### Returns
+
+Type | Description
+---- | -----------
+Matrix &#124; Array | Squeezed matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.squeeze([3])           // returns 3
+math.squeeze([[3]])         // returns 3
+
+const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)
+math.squeeze(A)             // returns [0, 0, 0] (size 3)
+
+const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)
+math.squeeze(B)             // returns [0, 0, 0] (size 3)
+
+// only inner and outer dimensions are removed
+const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+```
+
+
+## See also
+
+[subset](subset.md)
diff --git a/node_modules/mathjs/docs/reference/functions/std.md b/node_modules/mathjs/docs/reference/functions/std.md
new file mode 100644
index 0000000..dc348d2
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/std.md
@@ -0,0 +1,76 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function std
+
+Compute the standard deviation of a matrix or a  list with values.
+The standard deviations is defined as the square root of the variance:
+`std(A) = sqrt(variance(A))`.
+In case of a (multi dimensional) array or matrix, the standard deviation
+over all elements will be calculated by default, unless an axis is specified
+in which case the standard deviation will be computed along that axis.
+
+Additionally, it is possible to compute the standard deviation along the rows
+or columns of a matrix by specifying the dimension as the second argument.
+
+Optionally, the type of normalization can be specified as the final
+parameter. The parameter `normalization` can be one of the following values:
+
+- 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+- 'uncorrected'        The sum of squared errors is divided by n
+- 'biased'             The sum of squared errors is divided by (n + 1)
+
+
+## Syntax
+
+```js
+math.std(a, b, c, ...)
+math.std(A)
+math.std(A, normalization)
+math.std(A, dimension)
+math.std(A, dimension, normalization)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`array` | Array &#124; Matrix |  A single matrix or or multiple scalar values
+`normalization` | string |  Determines how to normalize the variance. Choose 'unbiased' (default), 'uncorrected', or 'biased'. Default value: 'unbiased'.
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The standard deviation
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.std(2, 4, 6)                     // returns 2
+math.std([2, 4, 6, 8])                // returns 2.581988897471611
+math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979
+math.std([2, 4, 6, 8], 'biased')      // returns 2
+
+math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707
+math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]
+math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]
+math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]
+```
+
+
+## See also
+
+[mean](mean.md),
+[median](median.md),
+[max](max.md),
+[min](min.md),
+[prod](prod.md),
+[sum](sum.md),
+[variance](variance.md)
diff --git a/node_modules/mathjs/docs/reference/functions/stirlingS2.md b/node_modules/mathjs/docs/reference/functions/stirlingS2.md
new file mode 100644
index 0000000..0c7ba0c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/stirlingS2.md
@@ -0,0 +1,52 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function stirlingS2
+
+The Stirling numbers of the second kind, counts the number of ways to partition
+a set of n labelled objects into k nonempty unlabelled subsets.
+stirlingS2 only takes integer arguments.
+The following condition must be enforced: k <= n.
+
+ If n = k or k = 1 <= n, then s(n,k) = 1
+ If k = 0 < n, then s(n,k) = 0
+
+Note that if either n or k is supplied as a BigNumber, the result will be
+as well.
+
+
+## Syntax
+
+```js
+math.stirlingS2(n, k)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`n` | Number &#124; BigNumber | Total number of objects in the set
+`k` | Number &#124; BigNumber | Number of objects in the subset
+
+### Returns
+
+Type | Description
+---- | -----------
+Number &#124; BigNumber | S(n,k)
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.stirlingS2(5, 3) //returns 25
+```
+
+
+## See also
+
+[bellNumbers](bellNumbers.md)
diff --git a/node_modules/mathjs/docs/reference/functions/string.md b/node_modules/mathjs/docs/reference/functions/string.md
new file mode 100644
index 0000000..88d0b54
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/string.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function string
+
+Create a string or convert any object into a string.
+Elements of Arrays and Matrices are processed element wise.
+
+
+## Syntax
+
+```js
+math.string(value)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`value` | * &#124; Array &#124; Matrix &#124; null | A value to convert to a string
+
+### Returns
+
+Type | Description
+---- | -----------
+string &#124; Array &#124; Matrix | The created string
+
+
+## Examples
+
+```js
+math.string(4.2)               // returns string '4.2'
+math.string(math.complex(3, 2) // returns string '3 + 2i'
+
+const u = math.unit(5, 'km')
+math.string(u.to('m'))         // returns string '5000 m'
+
+math.string([true, false])     // returns ['true', 'false']
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[boolean](boolean.md),
+[complex](complex.md),
+[index](index.md),
+[matrix](matrix.md),
+[number](number.md),
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/subset.md b/node_modules/mathjs/docs/reference/functions/subset.md
new file mode 100644
index 0000000..06b614f
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/subset.md
@@ -0,0 +1,65 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function subset
+
+Get or set a subset of a matrix or string.
+
+
+## Syntax
+
+```js
+math.subset(value, index)                                // retrieve a subset
+math.subset(value, index, replacement [, defaultValue])  // replace a subset
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`matrix` | Array &#124; Matrix &#124; string | An array, matrix, or string
+`index` | Index |  For each dimension of the target, specifies an index or a list of indices to fetch or set. `subset` uses the cartesian product of the indices specified in each dimension.
+`replacement` | * | An array, matrix, or scalar. If provided, the subset is replaced with replacement. If not provided, the subset is returned
+`defaultValue` | * | Default value, filled in on new entries when the matrix is resized. If not provided, math.matrix elements will be left undefined. Default value: undefined.
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix &#124; string | Either the retrieved subset or the updated matrix.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// get a subset
+const d = [[1, 2], [3, 4]]
+math.subset(d, math.index(1, 0))        // returns 3
+math.subset(d, math.index([0, 1], 1))   // returns [[2], [4]]
+
+// replace a subset
+const e = []
+const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 6]] and e = [[5, 0, 6]]
+const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 6], [0, 7]]
+
+// get submatrix using ranges
+const M = [
+  [1,2,3],
+  [4,5,6],
+  [7,8,9]
+]
+math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1,2,3],[4,5,6]]
+```
+
+
+## See also
+
+[size](size.md),
+[resize](resize.md),
+[squeeze](squeeze.md),
+[index](index.md)
diff --git a/node_modules/mathjs/docs/reference/functions/subtract.md b/node_modules/mathjs/docs/reference/functions/subtract.md
new file mode 100644
index 0000000..d3cc04b
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/subtract.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function subtract
+
+Subtract two values, `x - y`.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.subtract(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Initial value
+`y` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Value to subtract from `x`
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Subtraction of `x` and `y`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.subtract(5.3, 2)        // returns number 3.3
+
+const a = math.complex(2, 3)
+const b = math.complex(4, 1)
+math.subtract(a, b)          // returns Complex -2 + 2i
+
+math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]
+
+const c = math.unit('2.1 km')
+const d = math.unit('500m')
+math.subtract(c, d)          // returns Unit 1.6 km
+```
+
+
+## See also
+
+[add](add.md)
diff --git a/node_modules/mathjs/docs/reference/functions/sum.md b/node_modules/mathjs/docs/reference/functions/sum.md
new file mode 100644
index 0000000..91cce87
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/sum.md
@@ -0,0 +1,54 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function sum
+
+Compute the sum of a matrix or a list with values.
+In case of a (multi dimensional) array or matrix, the sum of all
+elements will be calculated.
+
+
+## Syntax
+
+```js
+math.sum(a, b, c, ...)
+math.sum(A)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | ... * | A single matrix or or multiple scalar values
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The sum of all values
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.sum(2, 1, 4, 3)               // returns 10
+math.sum([2, 1, 4, 3])             // returns 10
+math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22
+```
+
+
+## See also
+
+[mean](mean.md),
+[median](median.md),
+[min](min.md),
+[max](max.md),
+[prod](prod.md),
+[std](std.md),
+[variance](variance.md),
+[cumsum](cumsum.md)
diff --git a/node_modules/mathjs/docs/reference/functions/symbolicEqual.md b/node_modules/mathjs/docs/reference/functions/symbolicEqual.md
new file mode 100644
index 0000000..501f0ef
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/symbolicEqual.md
@@ -0,0 +1,62 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function symbolicEqual
+
+Attempts to determine if two expressions are symbolically equal, i.e.
+one is the result of valid algebraic manipulations on the other.
+Currently, this simply checks if the difference of the two expressions
+simplifies down to 0. So there are two important caveats:
+1. whether two expressions are symbolically equal depends on the
+    manipulations allowed. Therefore, this function takes an optional
+    third argument, which are the options that control the behavior
+    as documented for the `simplify()` function.
+2. it is in general intractable to find the minimal simplification of
+    an arbitrarily complicated expression. So while a `true` value
+    of `symbolicEqual` ensures that the two expressions can be manipulated
+    to match each other, a `false` value does not absolutely rule this out.
+
+
+## Syntax
+
+```js
+symbolicEqual(expr1, expr2)
+symbolicEqual(expr1, expr2, options)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`expr1` | Node &#124; string | The first expression to compare
+`expr2` | Node &#124; string | The second expression to compare
+`options` | Object | Optional option object, passed to simplify
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean |  Returns true if a valid manipulation making the expressions equal is found.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+symbolicEqual('x*y', 'y*x') // true
+symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}})
+    //false
+symbolicEqual('x/y', '(y*x^(-1))^(-1)') // true
+symbolicEqual('abs(x)','x') // false
+symbolicEqual('abs(x)','x', simplify.positiveContext) // true
+```
+
+
+## See also
+
+[simplify](simplify.md),
+[evaluate](evaluate.md)
diff --git a/node_modules/mathjs/docs/reference/functions/tan.md b/node_modules/mathjs/docs/reference/functions/tan.md
new file mode 100644
index 0000000..30984a9
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/tan.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function tan
+
+Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.tan(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Tangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.tan(0.5)                    // returns number 0.5463024898437905
+math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905
+math.tan(math.pi / 4)            // returns number 1
+math.tan(math.unit(45, 'deg'))   // returns number 1
+```
+
+
+## See also
+
+[atan](atan.md),
+[sin](sin.md),
+[cos](cos.md)
diff --git a/node_modules/mathjs/docs/reference/functions/tanh.md b/node_modules/mathjs/docs/reference/functions/tanh.md
new file mode 100644
index 0000000..1b0eef0
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/tanh.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function tanh
+
+Calculate the hyperbolic tangent of a value,
+defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.tanh(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Function input
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Complex &#124; Array &#124; Matrix | Hyperbolic tangent of x
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+// tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)
+math.tanh(0.5)                   // returns 0.46211715726000974
+math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974
+1 / math.coth(0.5)               // returns 0.46211715726000974
+```
+
+
+## See also
+
+[sinh](sinh.md),
+[cosh](cosh.md),
+[coth](coth.md)
diff --git a/node_modules/mathjs/docs/reference/functions/to.md b/node_modules/mathjs/docs/reference/functions/to.md
new file mode 100644
index 0000000..edbaafc
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/to.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function to
+
+Change the unit of a value.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.to(x, unit)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Unit &#124; Array &#124; Matrix | The unit to be converted.
+`unit` | Unit &#124; Array &#124; Matrix | New unit. Can be a string like "cm" or a unit without value.
+
+### Returns
+
+Type | Description
+---- | -----------
+Unit &#124; Array &#124; Matrix | value with changed, fixed unit.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.to(math.unit('2 inch'), 'cm')                   // returns Unit 5.08 cm
+math.to(math.unit('2 inch'), math.unit(null, 'cm'))  // returns Unit 5.08 cm
+math.to(math.unit(16, 'bytes'), 'bits')              // returns Unit 128 bits
+```
+
+
+## See also
+
+[unit](unit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/trace.md b/node_modules/mathjs/docs/reference/functions/trace.md
new file mode 100644
index 0000000..be03119
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/trace.md
@@ -0,0 +1,50 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function trace
+
+Calculate the trace of a matrix: the sum of the elements on the main
+diagonal of a square matrix.
+
+
+## Syntax
+
+```js
+math.trace(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | A matrix
+
+### Returns
+
+Type | Description
+---- | -----------
+number | The trace of `x`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.trace([[1, 2], [3, 4]]) // returns 5
+
+const A = [
+  [1, 2, 3],
+  [-1, 2, 3],
+  [2, 0, 3]
+]
+math.trace(A) // returns 6
+```
+
+
+## See also
+
+[diag](diag.md)
diff --git a/node_modules/mathjs/docs/reference/functions/transpose.md b/node_modules/mathjs/docs/reference/functions/transpose.md
new file mode 100644
index 0000000..ac46903
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/transpose.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function transpose
+
+Transpose a matrix. All values of the matrix are reflected over its
+main diagonal. Only applicable to two dimensional matrices containing
+a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional
+vectors and scalars return the input unchanged.
+
+
+## Syntax
+
+```js
+math.transpose(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | Array &#124; Matrix | Matrix to be transposed
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | The transposed matrix
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const A = [[1, 2, 3], [4, 5, 6]]
+math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]
+```
+
+
+## See also
+
+[diag](diag.md),
+[inv](inv.md),
+[subset](subset.md),
+[squeeze](squeeze.md)
diff --git a/node_modules/mathjs/docs/reference/functions/typeOf.md b/node_modules/mathjs/docs/reference/functions/typeOf.md
new file mode 100644
index 0000000..d79e14c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/typeOf.md
@@ -0,0 +1,81 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function typeOf
+
+Determine the type of a variable.
+
+Function `typeOf` recognizes the following types of objects:
+
+Object                 | Returns       | Example
+---------------------- | ------------- | ------------------------------------------
+null                   | `'null'`      | `math.typeOf(null)`
+number                 | `'number'`    | `math.typeOf(3.5)`
+boolean                | `'boolean'`   | `math.typeOf(true)`
+string                 | `'string'`    | `math.typeOf('hello world')`
+Array                  | `'Array'`     | `math.typeOf([1, 2, 3])`
+Date                   | `'Date'`      | `math.typeOf(new Date())`
+Function               | `'Function'`  | `math.typeOf(function () {})`
+Object                 | `'Object'`    | `math.typeOf({a: 2, b: 3})`
+RegExp                 | `'RegExp'`    | `math.typeOf(/a regexp/)`
+undefined              | `'undefined'` | `math.typeOf(undefined)`
+math.BigNumber         | `'BigNumber'` | `math.typeOf(math.bignumber('2.3e500'))`
+math.Chain             | `'Chain'`     | `math.typeOf(math.chain(2))`
+math.Complex           | `'Complex'`   | `math.typeOf(math.complex(2, 3))`
+math.Fraction          | `'Fraction'`  | `math.typeOf(math.fraction(1, 3))`
+math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`
+math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`
+math.Index             | `'Index'`     | `math.typeOf(math.index(1, 3))`
+math.Matrix            | `'Matrix'`    | `math.typeOf(math.matrix([[1,2], [3, 4]]))`
+math.Range             | `'Range'`     | `math.typeOf(math.range(0, 10))`
+math.ResultSet         | `'ResultSet'` | `math.typeOf(math.evaluate('a=2\nb=3'))`
+math.Unit              | `'Unit'`      | `math.typeOf(math.unit('45 deg'))`
+math.AccessorNode            | `'AccessorNode'`            | `math.typeOf(math.parse('A[2]'))`
+math.ArrayNode               | `'ArrayNode'`               | `math.typeOf(math.parse('[1,2,3]'))`
+math.AssignmentNode          | `'AssignmentNode'`          | `math.typeOf(math.parse('x=2'))`
+math.BlockNode               | `'BlockNode'`               | `math.typeOf(math.parse('a=2; b=3'))`
+math.ConditionalNode         | `'ConditionalNode'`         | `math.typeOf(math.parse('x<0 ? -x : x'))`
+math.ConstantNode            | `'ConstantNode'`            | `math.typeOf(math.parse('2.3'))`
+math.FunctionAssignmentNode  | `'FunctionAssignmentNode'`  | `math.typeOf(math.parse('f(x)=x^2'))`
+math.FunctionNode            | `'FunctionNode'`            | `math.typeOf(math.parse('sqrt(4)'))`
+math.IndexNode               | `'IndexNode'`               | `math.typeOf(math.parse('A[2]').index)`
+math.ObjectNode              | `'ObjectNode'`              | `math.typeOf(math.parse('{a:2}'))`
+math.ParenthesisNode         | `'ParenthesisNode'`         | `math.typeOf(math.parse('(2+3)'))`
+math.RangeNode               | `'RangeNode'`               | `math.typeOf(math.parse('1:10'))`
+math.SymbolNode              | `'SymbolNode'`              | `math.typeOf(math.parse('x'))`
+
+
+## Syntax
+
+```js
+math.typeOf(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | * | The variable for which to test the type.
+
+### Returns
+
+Type | Description
+---- | -----------
+string | Returns the name of the type. Primitive types are lower case, non-primitive types are upper-camel-case. For example 'number', 'string', 'Array', 'Date'.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.typeOf(3.5)                     // returns 'number'
+math.typeOf(math.complex('2-4i'))    // returns 'Complex'
+math.typeOf(math.unit('45 deg'))     // returns 'Unit'
+math.typeOf('hello world')           // returns 'string'
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/typed.md b/node_modules/mathjs/docs/reference/functions/typed.md
new file mode 100644
index 0000000..db84e40
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/typed.md
@@ -0,0 +1,56 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function typed
+
+Create a typed-function which checks the types of the arguments and
+can match them against multiple provided signatures. The typed-function
+automatically converts inputs in order to find a matching signature.
+Typed functions throw informative errors in case of wrong input arguments.
+
+See the library [typed-function](https://github.com/josdejong/typed-function)
+for detailed documentation.
+
+
+## Syntax
+
+```js
+math.typed(name, signatures) : function
+math.typed(signatures) : function
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`name` | string | Optional name for the typed-function
+`signatures` | Object&lt;string, function&gt; | Object with one or multiple function signatures
+
+### Returns
+
+Type | Description
+---- | -----------
+function | The created typed-function.
+
+
+## Examples
+
+```js
+// create a typed function with multiple types per argument (type union)
+const fn2 = typed({
+  'number | boolean': function (b) {
+    return 'b is a number or boolean'
+  },
+  'string, number | boolean': function (a, b) {
+    return 'a is a string, b is a number or boolean'
+  }
+})
+
+// create a typed function with an any type argument
+const log = typed({
+  'string, any': function (event, data) {
+    console.log('event: ' + event + ', data: ' + JSON.stringify(data))
+  }
+})
+```
+
+
diff --git a/node_modules/mathjs/docs/reference/functions/unaryMinus.md b/node_modules/mathjs/docs/reference/functions/unaryMinus.md
new file mode 100644
index 0000000..46858b1
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/unaryMinus.md
@@ -0,0 +1,49 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function unaryMinus
+
+Inverse the sign of a value, apply a unary minus operation.
+
+For matrices, the function is evaluated element wise. Boolean values and
+strings will be converted to a number. For complex numbers, both real and
+complex value are inverted.
+
+
+## Syntax
+
+```js
+math.unaryMinus(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Number to be inverted.
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Returns the value with inverted sign.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.unaryMinus(3.5)      // returns -3.5
+math.unaryMinus(-4.2)     // returns 4.2
+```
+
+
+## See also
+
+[add](add.md),
+[subtract](subtract.md),
+[unaryPlus](unaryPlus.md)
diff --git a/node_modules/mathjs/docs/reference/functions/unaryPlus.md b/node_modules/mathjs/docs/reference/functions/unaryPlus.md
new file mode 100644
index 0000000..117b179
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/unaryPlus.md
@@ -0,0 +1,48 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function unaryPlus
+
+Unary plus operation.
+Boolean values and strings will be converted to a number, numeric values will be returned as is.
+
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.unaryPlus(x)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; string &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Input value
+
+### Returns
+
+Type | Description
+---- | -----------
+number &#124; BigNumber &#124; Fraction &#124; Complex &#124; Unit &#124; Array &#124; Matrix |  Returns the input value when numeric, converts to a number when input is non-numeric.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.unaryPlus(3.5)      // returns 3.5
+math.unaryPlus(1)     // returns 1
+```
+
+
+## See also
+
+[unaryMinus](unaryMinus.md),
+[add](add.md),
+[subtract](subtract.md)
diff --git a/node_modules/mathjs/docs/reference/functions/unequal.md b/node_modules/mathjs/docs/reference/functions/unequal.md
new file mode 100644
index 0000000..3738276
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/unequal.md
@@ -0,0 +1,74 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function unequal
+
+Test whether two values are unequal.
+
+The function tests whether the relative difference between x and y is
+larger than the configured epsilon. The function cannot be used to compare
+values smaller than approximately 2.22e-16.
+
+For matrices, the function is evaluated element wise.
+In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.
+Strings are compared by their numerical value.
+
+Values `null` and `undefined` are compared strictly, thus `null` is unequal
+with everything except `null`, and `undefined` is unequal with everything
+except `undefined`.
+
+
+## Syntax
+
+```js
+math.unequal(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Complex &#124; Unit &#124; string &#124; Array &#124; Matrix &#124; undefined | First value to compare
+`y` | number &#124; BigNumber &#124; Fraction &#124; boolean &#124; Complex &#124; Unit &#124; string &#124; Array &#124; Matrix &#124; undefined | Second value to compare
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix | Returns true when the compared values are unequal, else returns false
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.unequal(2 + 2, 3)       // returns true
+math.unequal(2 + 2, 4)       // returns false
+
+const a = math.unit('50 cm')
+const b = math.unit('5 m')
+math.unequal(a, b)           // returns false
+
+const c = [2, 5, 1]
+const d = [2, 7, 1]
+
+math.unequal(c, d)           // returns [false, true, false]
+math.deepEqual(c, d)         // returns false
+
+math.unequal(0, null)        // returns true
+```
+
+
+## See also
+
+[equal](equal.md),
+[deepEqual](deepEqual.md),
+[smaller](smaller.md),
+[smallerEq](smallerEq.md),
+[larger](larger.md),
+[largerEq](largerEq.md),
+[compare](compare.md)
diff --git a/node_modules/mathjs/docs/reference/functions/unit.md b/node_modules/mathjs/docs/reference/functions/unit.md
new file mode 100644
index 0000000..e81d94c
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/unit.md
@@ -0,0 +1,48 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function unit
+
+Create a unit. Depending on the passed arguments, the function
+will create and return a new math.Unit object.
+When a matrix is provided, all elements will be converted to units.
+
+
+## Syntax
+
+```js
+math.unit(unit : string)
+math.unit(value : number, unit : string)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`args` | * &#124; Array &#124; Matrix | A number and unit.
+
+### Returns
+
+Type | Description
+---- | -----------
+Unit &#124; Array &#124; Matrix | The created unit
+
+
+## Examples
+
+```js
+const a = math.unit(5, 'cm')    // returns Unit 50 mm
+const b = math.unit('23 kg')    // returns Unit 23 kg
+a.to('m')                       // returns Unit 0.05 m
+```
+
+
+## See also
+
+[bignumber](bignumber.md),
+[boolean](boolean.md),
+[complex](complex.md),
+[index](index.md),
+[matrix](matrix.md),
+[number](number.md),
+[string](string.md),
+[createUnit](createUnit.md)
diff --git a/node_modules/mathjs/docs/reference/functions/usolve.md b/node_modules/mathjs/docs/reference/functions/usolve.md
new file mode 100644
index 0000000..d3783a8
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/usolve.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function usolve
+
+Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.
+
+`U * x = b`
+
+
+## Syntax
+
+```js
+math.usolve(U, b)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`U` | Matrix, Array | A N x N matrix or array (U)
+`b` | Matrix, Array | A column vector with the b values
+
+### Returns
+
+Type | Description
+---- | -----------
+DenseMatrix &#124; Array | A column vector with the linear system solution (x)
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const a = [[-2, 3], [2, 1]]
+const b = [11, 9]
+const x = usolve(a, b)  // [[8], [9]]
+```
+
+
+## See also
+
+[usolveAll](usolveAll.md),
+[lup](lup.md),
+[slu](slu.md),
+[usolve](usolve.md),
+[lusolve](lusolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/usolveAll.md b/node_modules/mathjs/docs/reference/functions/usolveAll.md
new file mode 100644
index 0000000..38e4618
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/usolveAll.md
@@ -0,0 +1,51 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function usolveAll
+
+Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.
+
+`U * x = b`
+
+
+## Syntax
+
+```js
+math.usolveAll(U, b)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`U` | Matrix, Array | A N x N matrix or array (U)
+`b` | Matrix, Array | A column vector with the b values
+
+### Returns
+
+Type | Description
+---- | -----------
+DenseMatrix[] &#124; Array[] | An array of affine-independent column vectors (x) that solve the linear system
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+const a = [[-2, 3], [2, 1]]
+const b = [11, 9]
+const x = usolveAll(a, b)  // [ [[8], [9]] ]
+```
+
+
+## See also
+
+[usolve](usolve.md),
+[lup](lup.md),
+[slu](slu.md),
+[usolve](usolve.md),
+[lusolve](lusolve.md)
diff --git a/node_modules/mathjs/docs/reference/functions/variance.md b/node_modules/mathjs/docs/reference/functions/variance.md
new file mode 100644
index 0000000..17bf357
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/variance.md
@@ -0,0 +1,78 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function variance
+
+Compute the variance of a matrix or a  list with values.
+In case of a (multi dimensional) array or matrix, the variance over all
+elements will be calculated.
+
+Additionally, it is possible to compute the variance along the rows
+or columns of a matrix by specifying the dimension as the second argument.
+
+Optionally, the type of normalization can be specified as the final
+parameter. The parameter `normalization` can be one of the following values:
+
+- 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+- 'uncorrected'        The sum of squared errors is divided by n
+- 'biased'             The sum of squared errors is divided by (n + 1)
+
+
+Note that older browser may not like the variable name `var`. In that
+case, the function can be called as `math['var'](...)` instead of
+`math.var(...)`.
+
+
+## Syntax
+
+```js
+math.variance(a, b, c, ...)
+math.variance(A)
+math.variance(A, normalization)
+math.variance(A, dimension)
+math.variance(A, dimension, normalization)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`array` | Array &#124; Matrix |  A single matrix or or multiple scalar values
+`normalization` | string |  Determines how to normalize the variance. Choose 'unbiased' (default), 'uncorrected', or 'biased'. Default value: 'unbiased'.
+
+### Returns
+
+Type | Description
+---- | -----------
+* | The variance
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.variance(2, 4, 6)                     // returns 4
+math.variance([2, 4, 6, 8])                // returns 6.666666666666667
+math.variance([2, 4, 6, 8], 'uncorrected') // returns 5
+math.variance([2, 4, 6, 8], 'biased')      // returns 4
+
+math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5
+math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]
+math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]
+math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]
+```
+
+
+## See also
+
+[mean](mean.md),
+[median](median.md),
+[max](max.md),
+[min](min.md),
+[prod](prod.md),
+[std](std.md),
+[sum](sum.md)
diff --git a/node_modules/mathjs/docs/reference/functions/xgcd.md b/node_modules/mathjs/docs/reference/functions/xgcd.md
new file mode 100644
index 0000000..4e33656
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/xgcd.md
@@ -0,0 +1,47 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function xgcd
+
+Calculate the extended greatest common divisor for two values.
+See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+
+
+## Syntax
+
+```js
+math.xgcd(a, b)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`a` | number &#124; BigNumber | An integer number
+`b` | number &#124; BigNumber | An integer number
+
+### Returns
+
+Type | Description
+---- | -----------
+Array | Returns an array containing 3 integers `[div, m, n]` where `div = gcd(a, b)` and `a*m + b*n = div`
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.xgcd(8, 12)             // returns [4, -1, 1]
+math.gcd(8, 12)              // returns 4
+math.xgcd(36163, 21199)      // returns [1247, -7, 12]
+```
+
+
+## See also
+
+[gcd](gcd.md),
+[lcm](lcm.md)
diff --git a/node_modules/mathjs/docs/reference/functions/xor.md b/node_modules/mathjs/docs/reference/functions/xor.md
new file mode 100644
index 0000000..86959d5
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/xor.md
@@ -0,0 +1,53 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function xor
+
+Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.
+For matrices, the function is evaluated element wise.
+
+
+## Syntax
+
+```js
+math.xor(x, y)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`x` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | First value to check
+`y` | number &#124; BigNumber &#124; Complex &#124; Unit &#124; Array &#124; Matrix | Second value to check
+
+### Returns
+
+Type | Description
+---- | -----------
+boolean &#124; Array &#124; Matrix |  Returns true when one and only one input is defined with a nonzero/nonempty value.
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.xor(2, 4)   // returns false
+
+a = [2, 0, 0]
+b = [2, 7, 0]
+c = 0
+
+math.xor(a, b)   // returns [false, true, false]
+math.xor(a, c)   // returns [true, false, false]
+```
+
+
+## See also
+
+[and](and.md),
+[not](not.md),
+[or](or.md)
diff --git a/node_modules/mathjs/docs/reference/functions/zeros.md b/node_modules/mathjs/docs/reference/functions/zeros.md
new file mode 100644
index 0000000..6978a33
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/functions/zeros.md
@@ -0,0 +1,57 @@
+<!-- Note: This file is automatically generated from source code comments. Changes made in this file will be overridden. -->
+
+# Function zeros
+
+Create a matrix filled with zeros. The created matrix can have one or
+multiple dimensions.
+
+
+## Syntax
+
+```js
+math.zeros(m)
+math.zeros(m, format)
+math.zeros(m, n)
+math.zeros(m, n, format)
+math.zeros([m, n])
+math.zeros([m, n], format)
+```
+
+### Parameters
+
+Parameter | Type | Description
+--------- | ---- | -----------
+`size` | ...number &#124; Array | The size of each dimension of the matrix
+`format` | string | The Matrix storage format
+
+### Returns
+
+Type | Description
+---- | -----------
+Array &#124; Matrix | A matrix filled with zeros
+
+
+### Throws
+
+Type | Description
+---- | -----------
+
+
+## Examples
+
+```js
+math.zeros(3)                  // returns [0, 0, 0]
+math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]
+math.zeros(3, 'dense')         // returns [0, 0, 0]
+
+const A = [[1, 2, 3], [4, 5, 6]]
+math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]
+```
+
+
+## See also
+
+[ones](ones.md),
+[identity](identity.md),
+[size](size.md),
+[range](range.md)
diff --git a/node_modules/mathjs/docs/reference/index.md b/node_modules/mathjs/docs/reference/index.md
new file mode 100644
index 0000000..06aa3eb
--- /dev/null
+++ b/node_modules/mathjs/docs/reference/index.md
@@ -0,0 +1,5 @@
+# Reference
+
+- [Classes](classes.md)
+- [Constants](constants.md)
+- [Functions](functions.md)
diff --git a/node_modules/mathjs/examples/advanced/convert_fraction_to_bignumber.js b/node_modules/mathjs/examples/advanced/convert_fraction_to_bignumber.js
new file mode 100644
index 0000000..d3903cd
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/convert_fraction_to_bignumber.js
@@ -0,0 +1,59 @@
+// Convert from Fraction to BigNumber
+//
+// In the configuration of math.js one can specify the default number type to
+// be `number`, `BigNumber`, or `Fraction`. Not all functions support `Fraction`
+// or `BigNumber`, and if not supported these input types will be converted to
+// numbers.
+//
+// When `Fraction` is configured, one may want to fallback to `BigNumber`
+// instead of `number`. Also, one may want to be able to mix `Fraction` and
+// `BigNumber` in operations like summing them up. This can be achieved by
+// adding an extra conversion to the list of conversions as demonstrated in
+// this example.
+
+// Create an empty math.js instance, with only typed
+// (every instance contains `import` and `config` also out of the box)
+const { create, typedDependencies, all } = require('../..')
+const math = create({
+  typedDependencies
+})
+
+// TODO: this should be much easier
+const allExceptLoaded = Object.keys(all)
+  .map(key => all[key])
+  .filter(factory => math[factory.fn] === undefined)
+
+// Configure to use fractions by default
+math.config({ number: 'Fraction' })
+
+// Add a conversion from Faction -> BigNumber
+// this conversion:
+// - must be inserted in the conversions list before the conversion Fraction -> number
+// - must be added to the conversions before loading functions into math.js
+math.typed.conversions.unshift({
+  from: 'Fraction',
+  to: 'BigNumber',
+  convert: function (fraction) {
+    return new math.BigNumber(fraction.n).div(fraction.d)
+  }
+})
+
+// Import all data types, functions, constants, the expression parser, etc.
+math.import(allExceptLoaded)
+
+// Operators `add` and `divide` do have support for Fractions, so the result
+// will simply be a Fraction (default behavior of math.js).
+const ans1 = math.evaluate('1/3 + 1/4')
+console.log(math.typeOf(ans1), math.format(ans1))
+// outputs "Fraction 7/12"
+
+// Function sqrt doesn't have Fraction support, will now fall back to BigNumber
+// instead of number.
+const ans2 = math.evaluate('sqrt(4)')
+console.log(math.typeOf(ans2), math.format(ans2))
+// outputs "BigNumber 2"
+
+// We can now do operations with mixed Fractions and BigNumbers
+const ans3 = math.add(math.fraction(2, 5), math.bignumber(3))
+console.log(math.typeOf(ans3), math.format(ans3))
+// outputs "BigNumber 3.4"
diff --git a/node_modules/mathjs/examples/advanced/custom_argument_parsing.js b/node_modules/mathjs/examples/advanced/custom_argument_parsing.js
new file mode 100644
index 0000000..19198b8
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/custom_argument_parsing.js
@@ -0,0 +1,98 @@
+/**
+ * The expression parser of math.js has support for letting functions
+ * parse and evaluate arguments themselves, instead of calling them with
+ * evaluated arguments.
+ *
+ * By adding a property `raw` with value true to a function, the function
+ * will be invoked with unevaluated arguments, allowing the function
+ * to process the arguments in a customized way.
+ */
+const { create, all } = require('../..')
+const math = create(all)
+
+/**
+ * Calculate the numeric integration of a function
+ * @param {Function} f
+ * @param {number} start
+ * @param {number} end
+ * @param {number} [step=0.01]
+ */
+function integrate (f, start, end, step) {
+  let total = 0
+  step = step || 0.01
+  for (let x = start; x < end; x += step) {
+    total += f(x + step / 2) * step
+  }
+  return total
+}
+
+/**
+ * A transformation for the integrate function. This transformation will be
+ * invoked when the function is used via the expression parser of math.js.
+ *
+ * Syntax:
+ *
+ *     integrate(integrand, variable, start, end)
+ *     integrate(integrand, variable, start, end, step)
+ *
+ * Usage:
+ *
+ *     math.evaluate('integrate(2*x, x, 0, 2)')
+ *     math.evaluate('integrate(2*x, x, 0, 2, 0.01)')
+ *
+ * @param {Array.<math.Node>} args
+ *            Expects the following arguments: [f, x, start, end, step]
+ * @param {Object} math
+ * @param {Object} [scope]
+ */
+integrate.transform = function (args, math, scope) {
+  // determine the variable name
+  if (!args[1].isSymbolNode) {
+    throw new Error('Second argument must be a symbol')
+  }
+  const variable = args[1].name
+
+  // evaluate start, end, and step
+  const start = args[2].compile().evaluate(scope)
+  const end = args[3].compile().evaluate(scope)
+  const step = args[4] && args[4].compile().evaluate(scope) // step is optional
+
+  // create a new scope, linked to the provided scope. We use this new scope
+  // to apply the variable.
+  const fnScope = Object.create(scope)
+
+  // construct a function which evaluates the first parameter f after applying
+  // a value for parameter x.
+  const fnCode = args[0].compile()
+  const f = function (x) {
+    fnScope[variable] = x
+    return fnCode.evaluate(fnScope)
+  }
+
+  // execute the integration
+  return integrate(f, start, end, step)
+}
+
+// mark the transform function with a "rawArgs" property, so it will be called
+// with uncompiled, unevaluated arguments.
+integrate.transform.rawArgs = true
+
+// import the function into math.js. Raw functions must be imported in the
+// math namespace, they can't be used via `evaluate(scope)`.
+math.import({
+  integrate: integrate
+})
+
+// use the function in JavaScript
+function f (x) {
+  return math.pow(x, 0.5)
+}
+console.log(math.integrate(f, 0, 1)) // outputs 0.6667254718034714
+
+// use the function via the expression parser
+console.log(math.evaluate('integrate(x^0.5, x, 0, 1)')) // outputs 0.6667254718034714
+
+// use the function via the expression parser (2)
+const scope = {}
+math.evaluate('f(x) = 2 * x', scope)
+console.log(math.evaluate('integrate(f(x), x, 0, 2)', scope)) // outputs 4.000000000000003
diff --git a/node_modules/mathjs/examples/advanced/custom_datatype.js b/node_modules/mathjs/examples/advanced/custom_datatype.js
new file mode 100644
index 0000000..ea83d3b
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/custom_datatype.js
@@ -0,0 +1,56 @@
+// This example demonstrates importing a custom data type,
+// and extending an existing function (add) with support for this data type.
+
+const { create, factory, all } = require('../..')
+const math = create(all)
+
+// factory function which defines a new data type CustomValue
+const createCustomValue = factory('CustomValue', ['typed'], ({ typed }) => {
+  // create a new data type
+  function CustomValue (value) {
+    this.value = value
+  }
+  CustomValue.prototype.isCustomValue = true
+  CustomValue.prototype.toString = function () {
+    return 'CustomValue:' + this.value
+  }
+
+  // define a new data type with typed-function
+  typed.addType({
+    name: 'CustomValue',
+    test: function (x) {
+      // test whether x is of type CustomValue
+      return x && x.isCustomValue === true
+    }
+  })
+
+  return CustomValue
+})
+
+// function add which can add the CustomValue data type
+// When imported in math.js, the existing function `add` with support for
+// CustomValue, because both implementations are typed-functions and do not
+// have conflicting signatures.
+const createAddCustomValue = factory('add', ['typed', 'CustomValue'], ({ typed, CustomValue }) => {
+  return typed('add', {
+    'CustomValue, CustomValue': function (a, b) {
+      return new CustomValue(a.value + b.value)
+    }
+  })
+})
+
+// import the new data type and function
+math.import([
+  createCustomValue,
+  createAddCustomValue
+])
+
+// use the new type
+const ans1 = math.add(new math.CustomValue(2), new math.CustomValue(3))
+console.log(ans1.toString())
+// outputs 'CustomValue:5'
+
+// you can automatically use the new type in functions which use `add` under the hood:
+const ans2 = math.sum(new math.CustomValue(6), new math.CustomValue(1), new math.CustomValue(2))
+console.log(ans2.toString())
+// outputs 'CustomValue:9'
diff --git a/node_modules/mathjs/examples/advanced/custom_evaluate_using_factories.js b/node_modules/mathjs/examples/advanced/custom_evaluate_using_factories.js
new file mode 100644
index 0000000..e878845
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/custom_evaluate_using_factories.js
@@ -0,0 +1,19 @@
+const { create, evaluateDependencies, factory } = require('../..')
+
+// custom implementations of all functions you want to support
+const add = (a, b) => a + b
+const subtract = (a, b) => a - b
+const multiply = (a, b) => a * b
+const divide = (a, b) => a / b
+
+// create factories for the functions, and create an evaluate function with those
+// these functions will also be used by the classes like Unit.
+const { evaluate } = create({
+  evaluateDependencies,
+  createAdd: factory('add', [], () => add),
+  createSubtract: factory('subtract', [], () => subtract),
+  createMultiply: factory('multiply', [], () => multiply),
+  createDivide: factory('divide', [], () => divide)
+})
+
+console.log(evaluate('2 + 3 * 4')) // 14
diff --git a/node_modules/mathjs/examples/advanced/custom_evaluate_using_import.js b/node_modules/mathjs/examples/advanced/custom_evaluate_using_import.js
new file mode 100644
index 0000000..3c486b3
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/custom_evaluate_using_import.js
@@ -0,0 +1,18 @@
+const { create, evaluateDependencies } = require('../..')
+
+// custom implementations of all functions you want to support
+const add = (a, b) => a + b
+const subtract = (a, b) => a - b
+const multiply = (a, b) => a * b
+const divide = (a, b) => a / b
+
+// create a mathjs instance with hardly any functions
+// there are some functions created which are used internally by evaluate though,
+// for example by the Unit class which has dependencies on addScalar, subtract,
+// multiplyScalar, etc.
+const math = create(evaluateDependencies)
+
+// import your own functions
+math.import({ add, subtract, multiply, divide }, { override: true })
+
+console.log(math.evaluate('2 + 3 * 4')) // 14
diff --git a/node_modules/mathjs/examples/advanced/custom_loading.js b/node_modules/mathjs/examples/advanced/custom_loading.js
new file mode 100644
index 0000000..5c0d270
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/custom_loading.js
@@ -0,0 +1,33 @@
+import {
+  create,
+  fractionDependencies,
+  addDependencies,
+  divideDependencies,
+  formatDependencies
+} from '../..'
+
+const config = {
+  // optionally, you can specify configuration
+}
+
+// Create just the functions we need
+const { fraction, add, divide, format } = create({
+  fractionDependencies,
+  addDependencies,
+  divideDependencies,
+  formatDependencies
+}, config)
+
+// Use the created functions
+const a = fraction(1, 3)
+const b = fraction(3, 7)
+const c = add(a, b)
+const d = divide(a, b)
+console.log('c =', format(c)) // outputs "c = 16/21"
+console.log('d =', format(d)) // outputs "d = 7/9"
+
+// Now, when bundling your application for use in the browser, only the used
+// parts of math.js will be bundled. For example to create a bundle using Webpack:
+//
+//     npx webpack custom_loading.js -o custom_loading.bundle.js --mode=production
+//
diff --git a/node_modules/mathjs/examples/advanced/custom_relational_functions.js b/node_modules/mathjs/examples/advanced/custom_relational_functions.js
new file mode 100644
index 0000000..fbcb2ab
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/custom_relational_functions.js
@@ -0,0 +1,62 @@
+const { create, all, factory } = require('../..')
+
+// First let's see what the default behavior is:
+// strings are compared by their numerical value
+console.log('default (compare string by their numerical value)')
+const { evaluate } = create(all)
+evaluateAndLog(evaluate, '2 < 10') // true
+evaluateAndLog(evaluate, '"2" < "10"') // true
+evaluateAndLog(evaluate, '"a" == "b"') // Error: Cannot convert "a" to a number
+evaluateAndLog(evaluate, '"a" == "a"') // Error: Cannot convert "a" to a number
+console.log('')
+
+// Suppose we want different behavior for string comparisons. To achieve
+// this we can replace the factory functions for all relational functions
+// with our own. In this simple example we use the JavaScript implementation.
+console.log('custom (compare strings lexically)')
+
+const allWithCustomFunctions = {
+  ...all,
+
+  createEqual: factory('equal', [], () => function equal (a, b) {
+    return a === b
+  }),
+
+  createUnequal: factory('unequal', [], () => function unequal (a, b) {
+    return a !== b
+  }),
+
+  createSmaller: factory('smaller', [], () => function smaller (a, b) {
+    return a < b
+  }),
+
+  createSmallerEq: factory('smallerEq', [], () => function smallerEq (a, b) {
+    return a <= b
+  }),
+
+  createLarger: factory('larger', [], () => function larger (a, b) {
+    return a > b
+  }),
+
+  createLargerEq: factory('largerEq', [], () => function largerEq (a, b) {
+    return a >= b
+  }),
+
+  createCompare: factory('compare', [], () => function compare (a, b) {
+    return a > b ? 1 : a < b ? -1 : 0
+  })
+}
+const evaluateCustom = create(allWithCustomFunctions).evaluate
+evaluateAndLog(evaluateCustom, '2 < 10') // true
+evaluateAndLog(evaluateCustom, '"2" < "10"') // false
+evaluateAndLog(evaluateCustom, '"a" == "b"') // false
+evaluateAndLog(evaluateCustom, '"a" == "a"') // true
+
+// helper function to evaluate an expression and print the results
+function evaluateAndLog (evaluate, expression) {
+  try {
+    console.log(expression, evaluate(expression))
+  } catch (err) {
+    console.error(expression, err.toString())
+  }
+}
diff --git a/node_modules/mathjs/examples/advanced/custom_scope_objects.js b/node_modules/mathjs/examples/advanced/custom_scope_objects.js
new file mode 100644
index 0000000..2114d04
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/custom_scope_objects.js
@@ -0,0 +1,115 @@
+const { create, all } = require('../..')
+
+const math = create(all)
+
+// The expression evaluator accepts an optional scope object.
+// This is the symbol table for variable defintions and function declations.
+
+// Scope can be a bare object.
+function withObjectScope () {
+  const scope = { x: 3 }
+
+  math.evaluate('x', scope) // 1
+  math.evaluate('y = 2 x', scope)
+  math.evaluate('scalar = 1', scope)
+  math.evaluate('area(length, width) = length * width * scalar', scope)
+  math.evaluate('A = area(x, y)', scope)
+
+  console.log('Object scope:', scope)
+}
+
+// Where flexibility is important, scope can duck type appear to be a Map.
+function withMapScope (scope, name) {
+  scope.set('x', 3)
+
+  math.evaluate('x', scope) // 1
+  math.evaluate('y = 2 x', scope)
+  math.evaluate('scalar = 1', scope)
+  math.evaluate('area(length, width) = length * width * scalar', scope)
+  math.evaluate('A = area(x, y)', scope)
+
+  console.log(`Map-like scope (${name}):`, scope.localScope)
+}
+
+// This is a minimal set of functions to look like a Map.
+class MapScope {
+  constructor () {
+    this.localScope = new Map()
+  }
+
+  get (key) {
+    // Remember to sanitize your inputs, or use
+    // a datastructure that isn't a footgun.
+    return this.localScope.get(key)
+  }
+
+  set (key, value) {
+    return this.localScope.set(key, value)
+  }
+
+  has (key) {
+    return this.localScope.has(key)
+  }
+
+  keys () {
+    return this.localScope.keys()
+  }
+}
+
+/*
+ * This is a more fully featured example, with all methods
+ * used in mathjs.
+ *
+ */
+class AdvancedMapScope extends MapScope {
+  constructor (parent) {
+    super()
+    this.parentScope = parent
+  }
+
+  get (key) {
+    return this.localScope.get(key) ?? this.parentScope?.get(key)
+  }
+
+  has (key) {
+    return this.localScope.has(key) ?? this.parentScope?.get(key)
+  }
+
+  keys () {
+    if (this.parentScope) {
+      return new Set([...this.localScope.keys(), ...this.parentScope.keys()])
+    } else {
+      return this.localScope.keys()
+    }
+  }
+
+  delete () {
+    return this.localScope.delete()
+  }
+
+  clear () {
+    return this.localScope.clear()
+  }
+
+  /**
+   * Creates a child scope from this one. This is used in function calls.
+   *
+   * @returns a new Map scope that has access to the symbols in the parent, but
+   * cannot overwrite them.
+   */
+  createSubScope () {
+    return new AdvancedMapScope(this)
+  }
+
+  toString () {
+    return this.localScope.toString()
+  }
+}
+
+withObjectScope()
+// Where safety is important, scope can also be a Map
+withMapScope(new Map(), 'simple Map')
+// Where flexibility is important, scope can duck type appear to be a Map.
+withMapScope(new MapScope(), 'MapScope example')
+// Extra methods allow even finer grain control.
+withMapScope(new AdvancedMapScope(), 'AdvancedScope example')
diff --git a/node_modules/mathjs/examples/advanced/expression_trees.js b/node_modules/mathjs/examples/advanced/expression_trees.js
new file mode 100644
index 0000000..eaa956b
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/expression_trees.js
@@ -0,0 +1,55 @@
+const { parse, ConstantNode } = require('../..')
+
+// Filter an expression tree
+console.log('Filter all symbol nodes "x" in the expression "x^2 + x/4 + 3*y"')
+const node = parse('x^2 + x/4 + 3*y')
+const filtered = node.filter(function (node) {
+  return node.isSymbolNode && node.name === 'x'
+})
+// returns an array with two entries: two SymbolNodes 'x'
+
+filtered.forEach(function (node) {
+  console.log(node.type, node.toString())
+})
+// outputs:
+//  SymbolNode x
+//  SymbolNode x
+
+// Traverse an expression tree
+console.log()
+console.log('Traverse the expression tree of expression "3 * x + 2"')
+const node1 = parse('3 * x + 2')
+node1.traverse(function (node, path, parent) {
+  switch (node.type) {
+    case 'OperatorNode':
+      console.log(node.type, node.op)
+      break
+    case 'ConstantNode':
+      console.log(node.type, node.value)
+      break
+    case 'SymbolNode':
+      console.log(node.type, node.name)
+      break
+    default: console.log(node.type)
+  }
+})
+// outputs:
+//   OperatorNode +
+//   OperatorNode *
+//   ConstantNode 3
+//   SymbolNode x
+//   ConstantNode 2
+
+// transform an expression tree
+console.log()
+console.log('Replace all symbol nodes "x" in expression "x^2 + 5*x" with a constant 3')
+const node2 = parse('x^2 + 5*x')
+const transformed = node2.transform(function (node, path, parent) {
+  if (node.isSymbolNode && node.name === 'x') {
+    return new ConstantNode(3)
+  } else {
+    return node
+  }
+})
+console.log(transformed.toString())
+// outputs: '3 ^ 2 + 5 * 3'
diff --git a/node_modules/mathjs/examples/advanced/function_transform.js b/node_modules/mathjs/examples/advanced/function_transform.js
new file mode 100644
index 0000000..ae212f2
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/function_transform.js
@@ -0,0 +1,50 @@
+/**
+ * Function transforms
+ *
+ * When using functions via the expression parser, it is possible to preprocess
+ * function arguments and post process a functions return value by writing a
+ * *transform* for the function. A transform is a function wrapping around a
+ * function to be transformed or completely replaces a function.
+ */
+const { create, all } = require('../..')
+const math = create(all)
+
+// create a function
+function addIt (a, b) {
+  return a + b
+}
+
+// attach a transform function to the function addIt
+addIt.transform = function (a, b) {
+  console.log('input: a=' + a + ', b=' + b)
+  // we can manipulate the input arguments here before executing addIt
+
+  const res = addIt(a, b)
+
+  console.log('result: ' + res)
+  // we can manipulate the result here before returning
+
+  return res
+}
+
+// import the function into math.js
+math.import({
+  addIt: addIt
+})
+
+// use the function via the expression parser
+console.log('Using expression parser:')
+console.log('2+4=' + math.evaluate('addIt(2, 4)'))
+// This will output:
+//
+//     input: a=2, b=4
+//     result: 6
+//     2+4=6
+
+// when used via plain JavaScript, the transform is not invoked
+console.log('')
+console.log('Using plain JavaScript:')
+console.log('2+4=' + math.addIt(2, 4))
+// This will output:
+//
+//     6
diff --git a/node_modules/mathjs/examples/advanced/more_secure_eval.js b/node_modules/mathjs/examples/advanced/more_secure_eval.js
new file mode 100644
index 0000000..46329ba
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/more_secure_eval.js
@@ -0,0 +1,36 @@
+// Expression parser security
+//
+// Executing arbitrary expressions like enabled by the expression parser of
+// mathjs involves a risk in general. When you're using mathjs to let users
+// execute arbitrary expressions, it's good to take a moment to think about
+// possible security and stability implications, especially when running the
+// code server side.
+//
+// There is a small number of functions which yield the biggest security risk
+// in the expression parser of math.js:
+//
+// - `import` and `createUnit` which alter the built-in functionality and allow
+//   overriding existing functions and units.
+// - `evaluate`, `parse`, `simplify`, and `derivative` which parse arbitrary input
+//   into a manipulable expression tree.
+//
+// To make the expression parser less vulnerable whilst still supporting most
+// functionality, these functions can be disabled, as demonstrated in this
+// example.
+
+const { create, all } = require('../..')
+const math = create(all)
+
+const limitedEvaluate = math.evaluate
+
+math.import({
+  import: function () { throw new Error('Function import is disabled') },
+  createUnit: function () { throw new Error('Function createUnit is disabled') },
+  evaluate: function () { throw new Error('Function evaluate is disabled') },
+  parse: function () { throw new Error('Function parse is disabled') },
+  simplify: function () { throw new Error('Function simplify is disabled') },
+  derivative: function () { throw new Error('Function derivative is disabled') }
+}, { override: true })
+
+console.log(limitedEvaluate('sqrt(16)')) // Ok, 4
+console.log(limitedEvaluate('parse("2+3")')) // Error: Function parse is disabled
diff --git a/node_modules/mathjs/examples/advanced/use_bigint.js b/node_modules/mathjs/examples/advanced/use_bigint.js
new file mode 100644
index 0000000..79780fa
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/use_bigint.js
@@ -0,0 +1,43 @@
+// This example demonstrates how you could integrate support for BigInt
+// in mathjs. It's just a proof of concept, for full support you will
+// have to defined more functions and define conversions from and to
+// other data types.
+
+const { create, all, factory } = require('../..')
+const math = create(all)
+
+// we can also add conversions here from number or string to BigInt
+// and vice versa using math.typed.addConversion(...)
+
+math.import([
+  factory('BigInt', ['typed'], function createBigInt ({ typed }) {
+    typed.addType({
+      name: 'BigInt',
+      test: (x) => typeof x === 'bigint' // eslint-disable-line
+    })
+
+    return BigInt // eslint-disable-line
+  }, { lazy: false }),
+
+  factory('bigint', ['typed', 'BigInt'], function createBigint ({ typed, BigInt }) {
+    return typed('bigint', {
+      'number | string ': (x) => BigInt(x) // eslint-disable-line
+    })
+  }),
+
+  factory('add', ['typed'], function createBigIntAdd ({ typed }) {
+    return typed('add', {
+      'BigInt, BigInt': (a, b) => a + b
+    })
+  }),
+
+  factory('pow', ['typed'], function createBigIntPow ({ typed }) {
+    return typed('pow', {
+      'BigInt, BigInt': (a, b) => a ** b
+    })
+  })
+])
+
+console.log(math.evaluate('4349 + 5249'))
+console.log(math.evaluate('bigint(4349) + bigint(5249)'))
+console.log(math.evaluate('bigint(4349) ^ bigint(5249)'))
diff --git a/node_modules/mathjs/examples/advanced/web_server/math_worker.js b/node_modules/mathjs/examples/advanced/web_server/math_worker.js
new file mode 100644
index 0000000..56cd497
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/web_server/math_worker.js
@@ -0,0 +1,24 @@
+const { create, all } = require('../../..')
+const workerpool = require('workerpool')
+const math = create(all)
+
+// disable the import function so the math.js instance cannot be changed
+function noImport () {
+  throw new Error('function import is disabled.')
+}
+math.import({ import: noImport }, { override: true })
+
+/**
+ * Evaluate an expression
+ * @param {string} expr
+ * @return {string} result
+ */
+function evaluate (expr) {
+  const ans = math.evaluate(expr)
+  return math.format(ans)
+}
+
+// create a worker and register public functions
+workerpool.worker({
+  evaluate: evaluate
+})
diff --git a/node_modules/mathjs/examples/advanced/web_server/server.js b/node_modules/mathjs/examples/advanced/web_server/server.js
new file mode 100644
index 0000000..24dba89
--- /dev/null
+++ b/node_modules/mathjs/examples/advanced/web_server/server.js
@@ -0,0 +1,80 @@
+/**
+ * This example demonstrates how to run math.js in a child process with limited
+ * execution time.
+ *
+ * Prerequisites:
+ *
+ *     npm install express workerpool
+ *
+ * Start the server:
+ *
+ *     node ./server.js
+ *
+ * Make a request to the server:
+ *
+ *     GET http://localhost:8080/mathjs?expr=sqrt(16)
+ *
+ * Note that the query parameter `expr` should be properly url encoded.
+ */
+const path = require('path')
+
+let express
+let workerpool
+try {
+  express = require('express')
+  workerpool = require('workerpool')
+} catch (err) {
+  console.log('Error: To run this example, install express and workerpool first via:\n\n' +
+      '    npm install express workerpool\n')
+  process.exit()
+}
+
+const app = express()
+const pool = workerpool.pool(path.join(__dirname, '/math_worker.js'))
+
+const TIMEOUT = 10000 // milliseconds
+
+/**
+ * GET /mathjs?expr=...
+ */
+app.get('/mathjs', function (req, res) {
+  const expr = req.query.expr
+  if (expr === undefined) {
+    return res.status(400).send('Error: Required query parameter "expr" missing in url.')
+  }
+
+  pool.exec('evaluate', [expr])
+    .timeout(TIMEOUT)
+    .then(function (result) {
+      res.send(result)
+    })
+    .catch(function (err) {
+      res.status(400).send(formatError(err))
+    })
+})
+
+/**
+ * Format error messages as string
+ * @param {Error} err
+ * @return {String} message
+ */
+function formatError (err) {
+  if (err instanceof workerpool.Promise.TimeoutError) {
+    return 'TimeoutError: Evaluation exceeded maximum duration of ' + TIMEOUT / 1000 + ' seconds'
+  } else {
+    return err.toString()
+  }
+}
+
+// handle uncaught exceptions so the application cannot crash
+process.on('uncaughtException', function (err) {
+  console.log('Caught exception: ' + err)
+  console.trace()
+})
+
+// start the server
+const PORT = process.env.PORT || 8080
+app.listen(PORT, function () {
+  console.log('Listening at http://localhost:' + PORT)
+  console.log('Example request:\n    GET http://localhost:' + PORT + '/mathjs?expr=sqrt(16)')
+})
diff --git a/node_modules/mathjs/examples/algebra.js b/node_modules/mathjs/examples/algebra.js
new file mode 100644
index 0000000..080c47d
--- /dev/null
+++ b/node_modules/mathjs/examples/algebra.js
@@ -0,0 +1,34 @@
+// algebra
+//
+// math.js has support for symbolic computation (CAS). It can parse
+// expressions in an expression tree and do algebraic operations like
+// simplification and derivation on this tree.
+
+// load math.js (using node.js)
+const { simplify, parse, derivative } = require('..')
+
+// simplify an expression
+console.log('simplify expressions')
+console.log(simplify('3 + 2 / 4').toString()) // '7 / 2'
+console.log(simplify('2x + 3x').toString()) // '5 * x'
+console.log(simplify('2 * 3 * x', { x: 4 }).toString()) // '24'
+console.log(simplify('x^2 + x + 3 + x^2').toString()) // '2 * x ^ 2 + x + 3'
+console.log(simplify('x * y * -x / (x ^ 2)').toString()) // '-y'
+
+// work with an expression tree, evaluate results
+const f = parse('2x + x')
+const simplified = simplify(f)
+console.log(simplified.toString()) // '3 * x'
+console.log(simplified.evaluate({ x: 4 })) // 12
+console.log()
+
+// calculate a derivative
+console.log('calculate derivatives')
+console.log(derivative('2x^2 + 3x + 4', 'x').toString()) // '4 * x + 3'
+console.log(derivative('sin(2x)', 'x').toString()) // '2 * cos(2 * x)'
+
+// work with an expression tree, evaluate results
+const h = parse('x^2 + x')
+const dh = derivative(h, 'x')
+console.log(dh.toString()) // '2 * x + 1'
+console.log(dh.evaluate({ x: 3 })) // '7'
diff --git a/node_modules/mathjs/examples/basic_usage.js b/node_modules/mathjs/examples/basic_usage.js
new file mode 100644
index 0000000..82af46d
--- /dev/null
+++ b/node_modules/mathjs/examples/basic_usage.js
@@ -0,0 +1,49 @@
+// basic usage
+
+// load math.js (using node.js)
+const math = require('..')
+
+// functions and constants
+console.log('functions and constants')
+print(math.round(math.e, 3)) // 2.718
+print(math.atan2(3, -3) / math.pi) // 0.75
+print(math.log(10000, 10)) // 4
+print(math.sqrt(-4)) // 2i
+print(math.pow([[-1, 2], [3, 1]], 2)) // [[7, 0], [0, 7]]
+print(math.derivative('x^2 + x', 'x')) // 2 * x + 1
+console.log()
+
+// expressions
+console.log('expressions')
+print(math.evaluate('1.2 * (2 + 4.5)')) // 7.8
+print(math.evaluate('12.7 cm to inch')) // 5 inch
+print(math.evaluate('sin(45 deg) ^ 2')) // 0.5
+print(math.evaluate('9 / 3 + 2i')) // 3 + 2i
+print(math.evaluate('det([-1, 2; 3, 1])')) // -7
+console.log()
+
+// chained operations
+console.log('chained operations')
+const a = math.chain(3)
+  .add(4)
+  .multiply(2)
+  .done()
+print(a) // 14
+console.log()
+
+// mixed use of different data types in functions
+console.log('mixed use of data types')
+print(math.add(4, [5, 6])) // number + Array, [9, 10]
+print(math.multiply(math.unit('5 mm'), 3)) // Unit * number,  15 mm
+print(math.subtract([2, 3, 4], 5)) // Array - number, [-3, -2, -1]
+print(math.add(math.matrix([2, 3]), [4, 5])) // Matrix + Array, [6, 8]
+console.log()
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  const precision = 14
+  console.log(math.format(value, precision))
+}
diff --git a/node_modules/mathjs/examples/bignumbers.js b/node_modules/mathjs/examples/bignumbers.js
new file mode 100644
index 0000000..bebc210
--- /dev/null
+++ b/node_modules/mathjs/examples/bignumbers.js
@@ -0,0 +1,52 @@
+/* eslint-disable no-loss-of-precision */
+
+// BigNumbers
+
+const { create, all } = require('..')
+
+// configure the default type of numbers as BigNumbers
+const config = {
+  // Default type of number
+  // Available options: 'number' (default), 'BigNumber', or 'Fraction'
+  number: 'BigNumber',
+
+  // Number of significant digits for BigNumbers
+  precision: 20
+}
+const math = create(all, config)
+
+console.log('round-off errors with numbers')
+print(math.add(0.1, 0.2)) // number, 0.30000000000000004
+print(math.divide(0.3, 0.2)) // number, 1.4999999999999998
+console.log()
+
+console.log('no round-off errors with BigNumbers')
+print(math.add(math.bignumber(0.1), math.bignumber(0.2))) // BigNumber, 0.3
+print(math.divide(math.bignumber(0.3), math.bignumber(0.2))) // BigNumber, 1.5
+console.log()
+
+console.log('create BigNumbers from strings when exceeding the range of a number')
+print(math.bignumber(1.2e+500)) // BigNumber, Infinity      WRONG
+print(math.bignumber('1.2e+500')) // BigNumber, 1.2e+500
+console.log()
+
+console.log('BigNumbers still have a limited precision and are no silve bullet')
+const third = math.divide(math.bignumber(1), math.bignumber(3))
+const total = math.add(third, third, third)
+print(total) // BigNumber, 0.99999999999999999999
+console.log()
+
+// one can work conveniently with BigNumbers using the expression parser.
+// note though that BigNumbers are only supported in arithmetic functions
+console.log('use BigNumbers in the expression parser')
+print(math.evaluate('0.1 + 0.2')) // BigNumber, 0.3
+print(math.evaluate('0.3 / 0.2')) // BigNumber, 1.5
+console.log()
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  console.log(math.format(value))
+}
diff --git a/node_modules/mathjs/examples/browser/angle_configuration.html b/node_modules/mathjs/examples/browser/angle_configuration.html
new file mode 100644
index 0000000..d5f66cd
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/angle_configuration.html
@@ -0,0 +1,134 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | angle configuration</title>
+  <style>
+    body, input, select {
+      font: 11pt sans-serif;
+    }
+    input, select, th, #result {
+      padding: 5px 10px;
+    }
+    th {
+      text-align: left;
+    }
+  </style>
+
+  <script src="../../lib/browser/math.js"></script>
+</head>
+<body>
+
+<p>
+  This code example extends the trigonometric functions of math.js with configurable angles: degrees, radians, or gradians.
+</p>
+
+<table>
+  <tr>
+    <th>Angles</th>
+    <td>
+      <select id="angles">
+        <option value="deg">deg</option>
+        <option value="grad">grad</option>
+        <option value="rad">rad</option>
+      </select>
+    </td>
+  </tr>
+  <tr>
+    <th>Expression</th>
+    <td>
+      <input id="expression" type="text" value="sin(45)" />
+      <input id="evaluate" type="button" value="Evaluate">
+    </td>
+  </tr>
+  <tr>
+    <th>Result</th>
+    <td id="result"></td>
+  </tr>
+</table>
+
+<script>
+  let replacements = {}
+
+  // our extended configuration options
+  const config = {
+    angles: 'deg' // 'rad', 'deg', 'grad'
+  }
+
+  // create trigonometric functions replacing the input depending on angle config
+  const fns1 = ['sin', 'cos', 'tan', 'sec', 'cot', 'csc']
+  fns1.forEach(function(name) {
+    const fn = math[name] // the original function
+
+    const fnNumber = function (x) {
+      // convert from configured type of angles to radians
+      switch (config.angles) {
+        case 'deg':
+          return fn(x / 360 * 2 * Math.PI)
+        case 'grad':
+          return fn(x / 400 * 2 * Math.PI)
+        default:
+          return fn(x)
+      }
+    }
+
+    // create a typed-function which check the input types
+    replacements[name] = math.typed(name, {
+      'number': fnNumber,
+      'Array | Matrix': function (x) {
+        return math.map(x, fnNumber)
+      }
+    })
+  })
+
+  // create trigonometric functions replacing the output depending on angle config
+  const fns2 = ['asin', 'acos', 'atan', 'atan2', 'acot', 'acsc', 'asec']
+  fns2.forEach(function(name) {
+    const fn = math[name] // the original function
+
+    const fnNumber = function (x) {
+      const result = fn(x)
+
+      if (typeof result === 'number') {
+        // convert to radians to configured type of angles
+        switch(config.angles) {
+          case 'deg':  return result / 2 / Math.PI * 360
+          case 'grad': return result / 2 / Math.PI * 400
+          default: return result
+        }
+      }
+
+      return result
+    }
+
+    // create a typed-function which check the input types
+    replacements[name] = math.typed(name, {
+      'number': fnNumber,
+      'Array | Matrix': function (x) {
+        return math.map(x, fnNumber)
+      }
+    })
+  })
+
+  // import all replacements into math.js, override existing trigonometric functions
+  math.import(replacements, {override: true})
+
+  // pointers to the input elements
+  const expression = document.getElementById('expression')
+  const evaluate   = document.getElementById('evaluate')
+  const result     = document.getElementById('result')
+  const angles     = document.getElementById('angles')
+
+  // attach event handlers for select box and button
+  angles.onchange = function () {
+    config.angles = this.value
+    config.angles = this.value
+  }
+  evaluate.onclick = function () {
+    result.innerHTML = math.evaluate(expression.value)
+  }
+</script>
+
+
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/browser/basic_usage.html b/node_modules/mathjs/examples/browser/basic_usage.html
new file mode 100644
index 0000000..28ecc06
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/basic_usage.html
@@ -0,0 +1,39 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | basic usage</title>
+  <script src="../../lib/browser/math.js"></script>
+</head>
+<body>
+
+<script>
+  function print(value) {
+    const precision = 14
+    document.write(math.format(value, precision) + '<br>')
+  }
+
+  // functions and constants
+  print(math.round(math.e, 3))            // 2.718
+  print(math.atan2(3, -3) / math.pi)      // 0.75
+  print(math.log(10000, 10))              // 4
+  print(math.sqrt(-4))                    // 2i
+  print(math.pow([[-1, 2], [3, 1]], 2))   // [[7, 0], [0, 7]]
+  print(math.derivative('x^2 + x', 'x'))  // 2 * x + 1
+
+  // expressions
+  print(math.evaluate('12 / (2.3 + 0.7)'))    // 4
+  print(math.evaluate('12.7 cm to inch'))     // 5 inch
+  print(math.evaluate('9 / 3 + 2i'))          // 3 + 2i
+  print(math.evaluate('det([-1, 2; 3, 1])'))  // -7
+
+  // chained operations
+  const a = math.chain(3)
+      .add(4)
+      .multiply(2)
+      .done()
+  print(a)  // 14
+</script>
+
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/browser/currency_conversion.html b/node_modules/mathjs/examples/browser/currency_conversion.html
new file mode 100644
index 0000000..4b826b8
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/currency_conversion.html
@@ -0,0 +1,125 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | currency conversion</title>
+
+  <script src="../../lib/browser/math.js"></script>
+
+  <style>
+    body,
+    html,
+    input {
+      font-size: 11pt;
+      font-family: verdana, arial, sans-serif;
+      color: #4d4d4d;
+      max-width: 600px;
+    }
+
+    h1 {
+      font-size: 120%;
+    }
+
+    input {
+      padding: 5px;
+      width: 400px;
+    }
+    button {
+      padding: 5px;
+    }
+  </style>
+</head>
+<body>
+
+<h1>Currency conversion with math.js</h1>
+
+<p>
+  This example demonstrates how you can fetch actual currencies from <a href="https://fixer.io">fixer.io</a> and use them in math.js.
+</p>
+
+<p>
+  Create a (free) account at <a href="https://fixer.io">fixer.io</a> and fill in your API access key below:
+</p>
+
+<form id="fetchForm">
+    <input type="text" id="apiKey" placeholder="fixer.io API access key..." />
+    <button type="submit" id="ok">Fetch currencies</button>
+</form>
+
+<p id="info">
+</p>
+<div id="form" style="display: none;">
+  <p>
+    <label for="expr">Enter an expression with currencies:</label>
+  </p>
+  <p>
+    <input id="expr" value="5 EUR + 2 * 3 EUR in USD" /><br/>
+  </p>
+  <p id="result"></p>
+</div>
+
+<script>
+  const accessKey = document.getElementById('apiKey')
+  const fetchForm = document.getElementById('fetchForm')
+
+  fetchForm.onsubmit = function (event) {
+    event.preventDefault()
+
+    document.getElementById('info').innerHTML = 'Fetching currencies...'
+
+    fetchAndImportCurrencies(accessKey.value)
+      .then(function (currencies) {
+        document.getElementById('expr').oninput = evaluate
+        document.getElementById('form').style.display = ''
+        document.getElementById('info').innerHTML = 'Available currencies: ' + currencies.join(', ')
+
+        evaluate()
+      })
+      .catch(function (err) {
+        console.error(err)
+        document.getElementById('info').innerHTML = '<span style="color: red;">' + err.toString() + '</span>'
+      })
+  }
+
+  function fetchAndImportCurrencies (accessKey) {
+    // fetch actual currency conversion rates
+    return fetch('http://data.fixer.io/api/latest?access_key=' + accessKey)
+      .then(function (response) {
+        return response.json()
+      })
+      .then(function (data) {
+        if (data.success) {
+          // import the currencies
+          math.createUnit(data.base)
+          Object.keys(data.rates)
+            .filter(function (currency) {
+              return currency !== data.base
+            })
+            .forEach(function (currency) {
+              math.createUnit(currency, math.unit(1 / data.rates[currency], data.base))
+            })
+
+          // return an array with all available currencies
+          return Object.keys(data.rates).concat(data.base)
+        }
+        else {
+          throw new Error(data.error.info)
+        }
+      })
+  }
+
+  function evaluate () {
+    const expr = document.getElementById('expr')
+    const result = document.getElementById('result')
+
+    try {
+      const resultStr = math.format(math.evaluate(expr.value), {notation: 'fixed', precision: 2})
+      result.innerHTML = '<span style="color: dodgerblue;">' + resultStr + '</span>'
+    }
+    catch (err) {
+      result.innerHTML = '<span style="color: red;">' + err.toString() + '</span>'
+    }
+  }
+</script>
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/browser/custom_separators.html b/node_modules/mathjs/examples/browser/custom_separators.html
new file mode 100644
index 0000000..e81a813
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/custom_separators.html
@@ -0,0 +1,81 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | custom separators</title>
+  <style>
+    body, input, select {
+      font: 11pt sans-serif;
+    }
+    input, select, th, #result {
+      padding: 5px 10px;
+    }
+    th {
+      text-align: left;
+    }
+  </style>
+
+  <script src="../../lib/browser/math.js"></script>
+</head>
+<body>
+
+<p>
+  This code example shows how to apply custom separators for function arguments and decimal separator.
+</p>
+
+<table>
+  <tr>
+    <th>Argument separator</th>
+    <td>
+      <input id="args" type="text" value=";">
+    </td>
+  </tr>
+  <tr>
+    <th>Decimal separator</th>
+    <td>
+      <input id="decimals" type="text" value=",">
+    </td>
+  </tr>
+  <tr>
+    <th>Expression</th>
+    <td>
+      <input id="expression" type="text" value="sum(3,4; 2,1; 2,0)" />
+      <input id="evaluate" type="button" value="Evaluate">
+    </td>
+  </tr>
+  <tr>
+    <th>Result</th>
+    <td id="result"></td>
+  </tr>
+</table>
+
+<script>
+  // pointers to the input elements
+  const expression = document.getElementById('expression')
+  const evaluate   = document.getElementById('evaluate')
+  const result     = document.getElementById('result')
+  const args       = document.getElementById('args')
+  const decimals   = document.getElementById('decimals')
+
+  // attach event handler to the button
+  evaluate.onclick = function () {
+    // replace the custom separators in the input with the default separators
+    const expr = expression.value
+        .replace(new RegExp('\\' + decimals.value + '|\\' + args.value, 'g'), function (match) {
+          return match === decimals.value ? '.': ','
+        })
+
+    // do the actual evaluation
+    const res = math.evaluate(expr)
+
+    // replace the default separators in the output with custom separators
+    result.innerHTML = res.toString()
+        .replace(new RegExp(',|\\.', 'g'), function (match) {
+          return match === '.' ? decimals.value : args.value
+        })
+  }
+</script>
+
+
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/browser/plot.html b/node_modules/mathjs/examples/browser/plot.html
new file mode 100644
index 0000000..eefc6bb
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/plot.html
@@ -0,0 +1,78 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | plot</title>
+  <script src="../../lib/browser/math.js"></script>
+
+  <script src="https://cdn.plot.ly/plotly-1.35.2.min.js"></script>
+
+  <style>
+    input[type=text] {
+      width: 300px;
+    }
+    input {
+      padding: 6px;
+    }
+    body, html, input {
+      font-family: sans-serif;
+      font-size: 11pt;
+
+    }
+    form {
+      margin: 20px 0;
+    }
+  </style>
+</head>
+<body>
+
+<form id="form">
+  <label for="eq">Enter an equation:</label>
+  <input type="text" id="eq" value="4 * sin(x) + 5 * cos(x/2)" />
+  <input type="submit" value="Draw" />
+</form>
+
+<div id="plot"></div>
+
+<p>
+  Used plot library: <a href="https://plot.ly/javascript/">Plotly</a>
+</p>
+
+<script>
+  function draw() {
+    try {
+      // compile the expression once
+      const expression = document.getElementById('eq').value
+      const expr = math.compile(expression)
+
+      // evaluate the expression repeatedly for different values of x
+      const xValues = math.range(-10, 10, 0.5).toArray()
+      const yValues = xValues.map(function (x) {
+        return expr.evaluate({x: x})
+      })
+
+      // render the plot using plotly
+      const trace1 = {
+        x: xValues,
+        y: yValues,
+        type: 'scatter'
+      }
+      const data = [trace1]
+      Plotly.newPlot('plot', data)
+    }
+    catch (err) {
+      console.error(err)
+      alert(err)
+    }
+  }
+
+  document.getElementById('form').onsubmit = function (event) {
+    event.preventDefault()
+    draw()
+  }
+
+  draw()
+</script>
+
+</body>
+</html>
diff --git a/node_modules/mathjs/examples/browser/pretty_printing_with_mathjax.html b/node_modules/mathjs/examples/browser/pretty_printing_with_mathjax.html
new file mode 100644
index 0000000..1fa2732
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/pretty_printing_with_mathjax.html
@@ -0,0 +1,122 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | pretty printing with MathJax</title>
+
+  <script src="../../lib/browser/math.js"></script>
+  <script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
+  <script src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-svg.js"></script>
+
+  <style>
+    body,
+    html,
+    table td,
+    table th,
+    input[type=text] {
+      font-size: 11pt;
+      font-family: verdana, arial, sans-serif;
+    }
+
+    h1 {
+      font-size: 11pt;
+    }
+
+    input[type=text] {
+      padding: 5px;
+      width: 400px;
+    }
+
+    table {
+      border-collapse: collapse;
+    }
+
+    table td,
+    table th {
+      padding: 5px;
+      border: 1px solid lightgray;
+    }
+
+    table th {
+      background-color: lightgray;
+    }
+
+  </style>
+</head>
+<body>
+
+<h1>
+  Expression evaluation with math.js, pretty printing with MathJax
+</h1>
+
+<table>
+  <tr>
+    <th>Expression</th>
+    <td><input type="text" id="expr"/></td>
+  </tr>
+  <tr>
+    <th>Pretty print</th>
+    <td><div id="pretty"></div></td>
+  </tr>
+  <tr>
+    <th>Result</th>
+    <td><div id="result"></div></td>
+  </tr>
+</table>
+<b>Parenthesis option:</b>
+<input type="radio" name="parenthesis" value="keep" onclick="parenthesis = 'keep'; expr.oninput();" checked>keep
+<input type="radio" name="parenthesis" value="auto" onclick="parenthesis = 'auto'; expr.oninput();">auto
+<input type="radio" name="parenthesis" value="all" onclick="parenthesis = 'all'; expr.oninput();">all
+<br/>
+<b>Implicit multiplication:</b>
+<input type="radio" name="implicit" value="hide" onclick="implicit = 'hide'; expr.oninput();" checked>hide
+<input type="radio" name="implicit" value="show" onclick="implicit = 'show'; expr.oninput();">show
+
+
+<script>
+  const expr = document.getElementById('expr')
+  const pretty = document.getElementById('pretty')
+  const result = document.getElementById('result')
+  let parenthesis = 'keep'
+  let implicit = 'hide'
+
+  const mj = function (tex) {
+    return MathJax.tex2svg(tex, {em: 16, ex: 6, display: false});
+  }
+
+  // initialize with an example expression
+  expr.value = 'sqrt(75 / 3) + det([[-1, 2], [3, 1]]) - sin(pi / 4)^2'
+  pretty.innerHTML = '';
+  pretty.appendChild(mj(math.parse(expr.value).toTex({parenthesis: parenthesis})));
+  result.innerHTML = math.format(math.evaluate(expr.value))
+
+  expr.oninput = function () {
+    let node = null
+
+    try {
+      // parse the expression
+      node = math.parse(expr.value)
+
+      // evaluate the result of the expression
+      result.innerHTML = math.format(node.compile().evaluate())
+    }
+    catch (err) {
+      result.innerHTML = '<span style="color: red;">' + err.toString() + '</span>'
+    }
+
+    try {
+      // export the expression to LaTeX
+      const latex = node ? node.toTex({parenthesis: parenthesis, implicit: implicit}) : ''
+      console.log('LaTeX expression:', latex)
+
+      // display and re-render the expression
+      MathJax.typesetClear();
+      pretty.innerHTML = '';
+      pretty.appendChild(mj(latex));
+    }
+    catch (err) {}
+  }
+</script>
+
+</body>
+</html>
diff --git a/node_modules/mathjs/examples/browser/printing_html.html b/node_modules/mathjs/examples/browser/printing_html.html
new file mode 100644
index 0000000..4cf2cdf
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/printing_html.html
@@ -0,0 +1,170 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+	<meta charset="utf-8">
+	<title>math.js | printing HTML</title>
+
+	<script src="../../lib/browser/math.js"></script>
+
+	<style>
+		body {
+			font-size: 11pt;
+			font-family: verdana, arial, sans-serif;
+		}
+
+		h1 {
+			font-size: 1rem;
+		}
+
+		fieldset {
+			display: inline;
+			margin: 0 50px 10px 0;
+			padding: 0;
+			border: none;
+		}
+
+		input[type=text] {
+			font-size: 11pt;
+			font-family: verdana, arial, sans-serif;
+			padding: 5px;
+			width: calc(100% - 14px);
+		}
+
+		label {
+			margin: 0 5px 0 0;
+		}
+
+		table {
+			width: 100%;
+			border-collapse: collapse;
+		}
+
+		table td,
+		table th {
+			padding: 5px;
+			border: 1px solid LightGrey;
+		}
+
+		table th {
+			background-color: LightGrey;
+		}
+
+		/* style the HTML output */
+		.math-function {
+			color: Purple;
+			font-weight: bold;
+		}
+
+		.math-number {
+			color: Blue;
+		}
+
+		.math-boolean {
+			color: Green;
+		}
+
+		.math-string {
+			color: Grey;
+		}
+
+		.math-string::before,
+		.math-string::after {
+			content: "\"";
+		}
+
+		.math-property {
+			font-style: italic;
+		}
+
+		.math-explicit-binary-operator::before,
+		.math-explicit-binary-operator::after {
+			content: " ";
+		}
+
+		.math-separator::after,
+		.math-assignment-operator::after {
+			content: " ";
+		}
+	</style>
+</head>
+<body>
+<h1>Expression evaluation and HTML code generation with math.js</h1>
+<form>
+	<fieldset>
+		Parenthesis option:
+		<label><input type="radio" name="parenthesis" value="keep" checked>keep</label>
+		<label><input type="radio" name="parenthesis" value="auto">auto</label>
+		<label><input type="radio" name="parenthesis" value="all">all</label>
+	</fieldset>
+	<fieldset>
+		Implicit multiplication:
+		<label><input type="radio" name="implicit" value="hide" checked>hide</label>
+		<label><input type="radio" name="implicit" value="show">show</label>
+	</fieldset>
+</form>
+<table>
+	<tr>
+		<th>Expression</th>
+		<td><input type="text" id="expr"/></td>
+	</tr>
+	<tr>
+		<th>Result</th>
+		<td><div id="result"></div></td>
+	</tr>
+	<tr>
+		<th>HTML output</th>
+		<td><div id="output">$$$$</div></td>
+	</tr>
+	<tr>
+		<th>HTML code</th>
+		<td><div id="code">$$$$</div></td>
+	</tr>
+</table>
+<script>
+  const expr = document.getElementById('expr')
+  const output = document.getElementById('output')
+  const code = document.getElementById('code')
+  const result = document.getElementById('result')
+  let options = {parenthesis: 'keep', implicit: 'hide'}
+
+  // initialize with an example expression
+  expr.value = 'sqrt(75/3)+det([[-1,2],[3,1]])-sin(pi/4)^2'
+
+  function print () {
+    let parsed = null
+
+    try {
+      // parse the expression
+      parsed = math.parse(expr.value)
+
+      // evaluate the result of the expression
+      result.innerHTML = math.format(parsed.compile().evaluate())
+
+      // print the HTML output
+      const html = math.parse(expr.value).toHTML(options)
+      output.innerHTML = html
+
+      // print the HTML code
+      code.innerHTML = html.replace(/</g, '&lt;').
+      replace(/>/g, '&gt;').
+      replace(/&lt;\/span&gt;/g, '&lt;/span&gt;<br />')
+    }
+    catch (err) {
+      result.innerHTML = '<span style="color: red;">' + err.toString() + '</span>'
+    }
+  }
+
+  window.onload = print
+  expr.oninput = print
+
+  // make the controls work
+  const controls = document.querySelectorAll('input[type=radio]')
+  controls.forEach(function (control) {
+    control.onclick = function() {
+      options[control.name] = control.value
+      print()
+    }
+  })
+</script>
+</body>
+</html>
diff --git a/node_modules/mathjs/examples/browser/requirejs_loading.html b/node_modules/mathjs/examples/browser/requirejs_loading.html
new file mode 100644
index 0000000..76a1bb9
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/requirejs_loading.html
@@ -0,0 +1,20 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | require.js loading</title>
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/require.js/2.1.20/require.min.js"></script>
+</head>
+<body>
+
+<script>
+  // load math.js using require.js
+  require(['../../lib/browser/math.js'], function (math) {
+    // evaluate some expression
+    const result = math.evaluate('1.2 * (2 + 4.5)')
+    document.write(result)
+  })
+</script>
+
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/browser/rocket_trajectory_optimization.html b/node_modules/mathjs/examples/browser/rocket_trajectory_optimization.html
new file mode 100644
index 0000000..7c98c48
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/rocket_trajectory_optimization.html
@@ -0,0 +1,301 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+  <meta charset="utf-8">
+  <title>math.js | rocket trajectory optimization</title>
+
+  <script src="../../lib/browser/math.js"></script>
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/Chart.js/2.5.0/Chart.min.js"></script>
+
+  <style>
+    body {
+      font-family: sans-serif;
+    }
+
+    #canvas-grid {
+      display: grid;
+      grid-template-columns: repeat(2, 1fr);
+      gap: 5%;
+      margin-top: 5%;
+    }
+
+    #canvas-grid>div {
+      overflow: hidden;
+    }
+  </style>
+</head>
+
+<body>
+  <h1>Rocket trajectory optimization</h1>
+  <p>
+    This example simulates the launch of a SpaceX Falcon 9 modeled using a system of ordinary differential equations.
+  </p>
+
+  <canvas id="canvas" width="1600" height="600"></canvas>
+  <div id="canvas-grid"></div>
+
+  <script>
+    // Solve ODE `dx/dt = f(x,t), x(0) = x0` numerically. 
+    function ndsolve(f, x0, dt, tmax) {
+      let x = x0.clone()  // Current values of variables
+      const result = [x]  // Contains entire solution
+      const nsteps = math.divide(tmax, dt)   // Number of time steps
+      for (let i = 0; i < nsteps; i++) {
+        // Compute derivatives
+        const dxdt = f.map(func => func(...x.toArray()))
+        // Euler method to compute next time step
+        const dx = math.multiply(dxdt, dt)
+        x = math.add(x, dx)
+        result.push(x)
+      }
+      return math.matrix(result)
+    }
+
+    // Import the numerical ODE solver
+    math.import({ ndsolve })
+
+    // Create a math.js context for our simulation. Everything else occurs in the context of the expression parser!
+    const sim = math.parser()
+
+    sim.evaluate("G = 6.67408e-11 m^3 kg^-1 s^-2")  // Gravitational constant
+    sim.evaluate("mbody = 5.9724e24 kg")            // Mass of Earth
+    sim.evaluate("mu = G * mbody")                  // Standard gravitational parameter
+    sim.evaluate("g0 = 9.80665 m/s^2")              // Standard gravity: used for calculating prop consumption (dmdt)
+    sim.evaluate("r0 = 6371 km")                    // Mean radius of Earth
+    sim.evaluate("t0 = 0 s")                        // Simulation start
+    sim.evaluate("dt = 0.5 s")                      // Simulation timestep
+    sim.evaluate("tfinal = 149.5 s")                // Simulation duration
+    sim.evaluate("isp_sea = 282 s")                 // Specific impulse (at sea level)
+    sim.evaluate("isp_vac = 311 s")                 // Specific impulse (in vacuum)
+    sim.evaluate("gamma0 = 89.99970 deg")           // Initial pitch angle (90 deg is vertical)
+    sim.evaluate("v0 = 1 m/s")                      // Initial velocity (must be non-zero because ODE is ill-conditioned)
+    sim.evaluate("phi0 = 0 deg")                    // Initial orbital reference angle
+    sim.evaluate("m1 = 433100 kg")                  // First stage mass
+    sim.evaluate("m2 = 111500 kg")                  // Second stage mass
+    sim.evaluate("m3 = 1700 kg")                    // Third stage / fairing mass
+    sim.evaluate("mp = 5000 kg")                    // Payload mass
+    sim.evaluate("m0 = m1+m2+m3+mp")                // Initial mass of rocket
+    sim.evaluate("dm = 2750 kg/s")                  // Mass flow rate
+    sim.evaluate("A = (3.66 m)^2 * pi")             // Area of the rocket
+    sim.evaluate("dragCoef = 0.2")                  // Drag coefficient
+
+    // Define the equations of motion. We just thrust into current direction of motion, e.g. making a gravity turn.
+    sim.evaluate("gravity(r) = mu / r^2")
+    sim.evaluate("angVel(r, v, gamma) = v/r * cos(gamma) * rad")   // Angular velocity of rocket around moon
+    sim.evaluate("density(r) = 1.2250 kg/m^3 * exp(-g0 * (r - r0) / (83246.8 m^2/s^2))") // Assume constant temperature
+    sim.evaluate("drag(r, v) = 1/2 * density(r) .* v.^2 * A * dragCoef")
+    sim.evaluate("isp(r) = isp_vac + (isp_sea - isp_vac) * density(r)/density(r0)") // pressure ~ density for constant temperature
+    sim.evaluate("thrust(isp) = g0 * isp * dm")
+    // It is important to maintain the same argument order for each of these functions.
+    sim.evaluate("drdt(r, v, m, phi, gamma, t) = v sin(gamma)")
+    sim.evaluate("dvdt(r, v, m, phi, gamma, t) = - gravity(r) * sin(gamma) + (thrust(isp(r)) - drag(r, v)) / m")
+    sim.evaluate("dmdt(r, v, m, phi, gamma, t) = - dm")
+    sim.evaluate("dphidt(r, v, m, phi, gamma, t) = angVel(r, v, gamma)")
+    sim.evaluate("dgammadt(r, v, m, phi, gamma, t) = angVel(r, v, gamma) - gravity(r) * cos(gamma) / v * rad")
+    sim.evaluate("dtdt(r, v, m, phi, gamma, t) = 1")
+
+    // Remember to maintain the same variable order in the call to ndsolve.
+    sim.evaluate("result_stage1 = ndsolve([drdt, dvdt, dmdt, dphidt, dgammadt, dtdt], [r0, v0, m0, phi0, gamma0, t0], dt, tfinal)")
+
+    // Reset initial conditions for interstage flight
+    sim.evaluate("dm = 0 kg/s")
+    sim.evaluate("tfinal = 10 s")
+    sim.evaluate("x = flatten(result_stage1[end,:])")
+    sim.evaluate("x[3] = m2+m3+mp") // New mass after stage seperation
+    sim.evaluate("result_interstage = ndsolve([drdt, dvdt, dmdt, dphidt, dgammadt, dtdt], x, dt, tfinal)")
+
+    // Reset initial conditions for stage 2 flight
+    sim.evaluate("dm = 270.8 kg/s")
+    sim.evaluate("isp_vac = 348 s")
+    sim.evaluate("tfinal = 350 s")
+    sim.evaluate("x = flatten(result_interstage[end,:])")
+    sim.evaluate("result_stage2 = ndsolve([drdt, dvdt, dmdt, dphidt, dgammadt, dtdt], x, dt, tfinal)")
+
+    // Reset initial conditions for unpowered flight
+    sim.evaluate("dm = 0 kg/s")
+    sim.evaluate("tfinal = 900 s")
+    sim.evaluate("dt = 10 s")
+    sim.evaluate("x = flatten(result_stage2[end,:])")
+    sim.evaluate("result_unpowered1 = ndsolve([drdt, dvdt, dmdt, dphidt, dgammadt, dtdt], x, dt, tfinal)")
+
+    // Reset initial conditions for final orbit insertion
+    sim.evaluate("dm = 270.8 kg/s")
+    sim.evaluate("tfinal = 39 s")
+    sim.evaluate("dt = 0.5 s")
+    sim.evaluate("x = flatten(result_unpowered1[end,:])")
+    sim.evaluate("result_insertion = ndsolve([drdt, dvdt, dmdt, dphidt, dgammadt, dtdt], x, dt, tfinal)")
+
+    // Reset initial conditions for unpowered flight
+    sim.evaluate("dm = 0 kg/s")
+    sim.evaluate("tfinal = 250 s")
+    sim.evaluate("dt = 10 s")
+    sim.evaluate("x = flatten(result_insertion[end,:])")
+    sim.evaluate("result_unpowered2 = ndsolve([drdt, dvdt, dmdt, dphidt, dgammadt, dtdt], x, dt, tfinal)")
+
+    // Now it's time to prepare results for plotting
+    const resultNames = ['stage1', 'interstage', 'stage2', 'unpowered1', 'insertion', 'unpowered2']
+      .map(stageName => `result_${stageName}`)
+
+    // Concat result matrices
+    sim.set('result',
+      math.concat(
+        ...resultNames.map(resultName =>
+          sim.evaluate(`${resultName}[:end-1, :]`)  // Avoid overlap
+        ),
+        0 // Concat in row-dimension
+      )
+    )
+
+    const mainDatasets = resultNames.map((resultName, i) => ({
+      label: resultName.slice(7),
+      data: sim.evaluate(
+        'concat('
+        + `(${resultName}[:,4] - phi0) * r0 / rad / km,`  // Surface distance from start (in km)
+        + `(${resultName}[:,1] - r0) / km`                // Height above surface (in km)
+        + ')'
+      ).toArray().map(([x, y]) => ({ x, y })),
+      borderColor: i % 2 ? '#999' : '#dc3912',
+      fill: false,
+      pointRadius: 0,
+    }))
+    new Chart(document.getElementById('canvas'), {
+      type: 'line',
+      data: { datasets: mainDatasets },
+      options: getMainChartOptions()
+    })
+
+    createChart([{
+      label: 'velocity (in m/s)',
+      data: sim.evaluate("result[:,[2,6]]")
+        .toArray()
+        .map(([v, t]) => ({ x: t.toNumber('s'), y: v.toNumber('m/s') }))
+    }])
+    createChart([{
+      label: 'height (in km)',
+      data: sim.evaluate("concat((result[:, 1] - r0), result[:, 6])")
+        .toArray()
+        .map(([r, t]) => ({ x: t.toNumber('s'), y: r.toNumber('km') })),
+    }])
+    createChart([{
+      label: 'gamma (in deg)',
+      data: sim.evaluate("result[:, [5,6]]")
+        .toArray()
+        .map(([gamma, t]) => ({ x: t.toNumber('s'), y: gamma.toNumber('deg') })),
+    }])
+    createChart([{
+      label: 'acceleration (in m/s^2)',
+      data: sim.evaluate("concat(diff(result[:, 2]) ./ diff(result[:, 6]), result[:end-1, 6])")
+        .toArray()
+        .map(([acc, t]) => ({ x: t.toNumber('s'), y: acc.toNumber('m/s^2') })),
+    }])
+    createChart([{
+      label: 'drag acceleration (in m/s^2)',
+      data: sim.evaluate("concat(drag(result[:, 1], result[:, 2]) ./ result[:, 3], result[:, 6])")
+        .toArray()
+        .map(([dragAcc, t]) => ({ x: t.toNumber('s'), y: dragAcc.toNumber('m/s^2') })),
+    }])
+    createChart(
+      [
+        {
+          data: sim.evaluate("result[:, [1,4]]")
+            .toArray()
+            .map(([r, phi]) => math.rotate([r.toNumber('km'), 0], phi))
+            .map(([x, y]) => ({ x, y })),
+        },
+        {
+          data: sim.evaluate("map(0:0.25:360, function(angle) = rotate([r0/km, 0], angle))")
+            .toArray()
+            .map(([x, y]) => ({ x, y })),
+          borderColor: "#999",
+          fill: true
+        }
+      ],
+      getEarthChartOptions()
+    )
+
+    // Helper functions for plotting data (nothing to learn about math.js from here on)
+    function createChart(datasets, options = {}) {
+      const container = document.createElement("div")
+      document.querySelector("#canvas-grid").appendChild(container)
+      const canvas = document.createElement("canvas")
+      container.appendChild(canvas)
+      new Chart(canvas, {
+        type: 'line',
+        data: {
+          datasets: datasets.map(dataset => ({
+            borderColor: "#dc3912",
+            fill: false,
+            pointRadius: 0,
+            ...dataset
+          }))
+        },
+        options: getChartOptions(options)
+      })
+    }
+
+    function getMainChartOptions() {
+      return {
+        scales: {
+          xAxes: [{
+            type: 'linear',
+            position: 'bottom',
+            scaleLabel: {
+              display: true,
+              labelString: 'surface distance travelled (in km)'
+            }
+          }],
+          yAxes: [{
+            type: 'linear',
+            scaleLabel: {
+              display: true,
+              labelString: 'height above surface (in km)'
+            }
+          }]
+        },
+        animation: false
+      }
+    }
+
+    function getChartOptions(options) {
+      return {
+        scales: {
+          xAxes: [{
+            type: 'linear',
+            position: 'bottom',
+            scaleLabel: {
+              display: true,
+              labelString: 'time (in s)'
+            }
+          }]
+        },
+        animation: false,
+        ...options
+      }
+    }
+
+    function getEarthChartOptions() {
+      return {
+        aspectRatio: 1,
+        scales: {
+          xAxes: [{
+            type: 'linear',
+            position: 'bottom',
+            min: -8000,
+            max: 8000,
+            display: false
+          }],
+          yAxes: [{
+            type: 'linear',
+            min: -8000,
+            max: 8000,
+            display: false
+          }]
+        },
+        legend: { display: false }
+      }
+    }
+  </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/browser/webworkers/webworkers.html b/node_modules/mathjs/examples/browser/webworkers/webworkers.html
new file mode 100644
index 0000000..26a230c
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/webworkers/webworkers.html
@@ -0,0 +1,80 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="utf-8">
+  <title>math.js | web workers</title>
+</head>
+<body>
+
+<p>
+  In this example, a math.js parser is running in a separate
+  <a href="https://www.html5rocks.com/en/tutorials/workers/basics/">web worker</a>,
+  preventing the user interface from freezing during heavy calculations.
+</p>
+
+<p id="results"></p>
+
+<script>
+  /**
+   * MathWorker evaluates expressions asynchronously in a web worker.
+   *
+   * Example usage:
+   *
+   *     const worker = new MathWorker()
+   *     const expr = '12 / (2.3 + 0.7)'
+   *     worker.evaluate(expr, function (err, result) {
+   *       console.log(err, result)
+   *     })
+   */
+  function MathWorker () {
+    this.worker = new Worker('worker.js')
+    this.callbacks = {}
+    this.seq = 0
+
+    // create a listener to receive responses from the web worker
+    const me = this
+    this.worker.addEventListener('message', function(event) {
+      const response = JSON.parse(event.data)
+
+      // find the callback corresponding to this response
+      const callback = me.callbacks[response.id]
+      delete me.callbacks[response.id]
+
+      // call the requests callback with the result
+      callback(response.err, response.result)
+    }, false)
+  }
+
+  /**
+   * Evaluate an expression
+   * @param {string} expr
+   * @param {Function} callback   Called as callback(err, result)
+   */
+  MathWorker.prototype.evaluate = function evaluate (expr, callback) {
+    // build a request,
+    // add an id so we can link returned responses to the right callback
+    const id = this.seq++
+    const request = {
+      id: id,
+      expr: expr
+    }
+
+    // queue the callback, it will be called when the worker returns the result
+    this.callbacks[id] = callback
+
+    // send the request to the worker
+    this.worker.postMessage(JSON.stringify(request))
+  }
+
+  // create a MathWorker
+  const worker = new MathWorker()
+
+  // evaluate an expression via the worker
+  worker.evaluate('12 / (2.3 + 0.7)', function (err, result) {
+    document.getElementById('results').innerHTML += 'result: ' + result + '<br>'
+  })
+
+</script>
+
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/browser/webworkers/worker.js b/node_modules/mathjs/examples/browser/webworkers/worker.js
new file mode 100644
index 0000000..0af5d85
--- /dev/null
+++ b/node_modules/mathjs/examples/browser/webworkers/worker.js
@@ -0,0 +1,28 @@
+importScripts('../../../lib/browser/math.js')
+
+// create a parser
+const parser = self.math.parser()
+
+self.addEventListener('message', function (event) {
+  const request = JSON.parse(event.data)
+  let result = null
+  let err = null
+
+  try {
+    // evaluate the expression
+    result = parser.evaluate(request.expr)
+  } catch (e) {
+    // return the error
+    err = e
+  }
+
+  // build a response
+  const response = {
+    id: request.id,
+    result: self.math.format(result),
+    err: err
+  }
+
+  // send the response back
+  self.postMessage(JSON.stringify(response))
+}, false)
diff --git a/node_modules/mathjs/examples/chaining.js b/node_modules/mathjs/examples/chaining.js
new file mode 100644
index 0000000..a46f9dd
--- /dev/null
+++ b/node_modules/mathjs/examples/chaining.js
@@ -0,0 +1,56 @@
+// chaining
+
+// load math.js (using node.js)
+const math = require('..')
+
+// create a chained operation using the function `chain(value)`
+// end a chain using done(). Let's calculate (3 + 4) * 2
+const a = math.chain(3)
+  .add(4)
+  .multiply(2)
+  .done()
+print(a) // 14
+
+// Another example, calculate square(sin(pi / 4))
+const b = math.chain(math.pi)
+  .divide(4)
+  .sin()
+  .square()
+  .done()
+print(b) // 0.5
+
+// A chain has a few special methods: done, toString, valueOf, get, and set.
+// these are demonstrated in the following examples
+
+// toString will return a string representation of the chain's value
+const chain = math.chain(2).divide(3)
+const str = chain.toString()
+print(str) // "0.6666666666666666"
+
+// a chain has a function .valueOf(), which returns the value hold by the chain.
+// This allows using it in regular operations. The function valueOf() acts the
+// same as function done().
+print(chain.valueOf()) // 0.66666666666667
+print(chain + 2) // 2.6666666666667
+
+// the function subset can be used to get or replace sub matrices
+const array = [[1, 2], [3, 4]]
+const v = math.chain(array)
+  .subset(math.index(1, 0))
+  .done()
+print(v) // 3
+
+const m = math.chain(array)
+  .subset(math.index(0, 0), 8)
+  .multiply(3)
+  .done()
+print(m) // [[24, 6], [9, 12]]
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  const precision = 14
+  console.log(math.format(value, precision))
+}
diff --git a/node_modules/mathjs/examples/complex_numbers.js b/node_modules/mathjs/examples/complex_numbers.js
new file mode 100644
index 0000000..7480002
--- /dev/null
+++ b/node_modules/mathjs/examples/complex_numbers.js
@@ -0,0 +1,67 @@
+// complex numbers
+
+// load js (using node.js)
+const { complex, add, multiply, sin, sqrt, pi, equal, sort, format } = require('..')
+
+// create a complex number with a numeric real and complex part
+console.log('create and manipulate complex numbers')
+const a = complex(2, 3)
+print(a) // 2 + 3i
+
+// read the real and complex parts of the complex number
+print(a.re) // 2
+print(a.im) // 3
+
+// clone a complex value
+const clone = a.clone()
+print(clone) // 2 + 3i
+
+// adjust the complex value
+a.re = 5
+print(a) // 5 + 3i
+
+// create a complex number by providing a string with real and complex parts
+const b = complex('3-7i')
+print(b) // 3 - 7i
+console.log()
+
+// perform operations with complex numbers
+console.log('perform operations')
+print(add(a, b)) // 8 - 4i
+print(multiply(a, b)) // 36 - 26i
+print(sin(a)) // -9.6541254768548 + 2.8416922956064i
+
+// some operations will return a complex number depending on the arguments
+print(sqrt(4)) // 2
+print(sqrt(-4)) // 2i
+console.log()
+
+// create a complex number from polar coordinates
+console.log('create complex numbers with polar coordinates')
+const c = complex({ r: sqrt(2), phi: pi / 4 })
+print(c) // 1 + i
+
+// get polar coordinates of a complex number
+const d = complex(3, 4)
+console.log(d.abs(), d.arg()) // radius = 5, phi = 0.9272952180016122
+console.log()
+
+// comparision operations
+// note that there is no mathematical ordering defined for complex numbers
+// we can only check equality. To sort a list with complex numbers,
+// the natural sorting can be used
+console.log('\ncomparision and sorting operations')
+console.log('equal', equal(a, b)) // returns false
+const values = [a, b, c]
+console.log('values:', format(values, 14)) // [5 + 3i, 3 - 7i, 1 + i]
+sort(values, 'natural')
+console.log('sorted:', format(values, 14)) // [1 + i, 3 - 7i, 5 + 3i]
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  const precision = 14
+  console.log(format(value, precision))
+}
diff --git a/node_modules/mathjs/examples/expressions.js b/node_modules/mathjs/examples/expressions.js
new file mode 100644
index 0000000..2f8500b
--- /dev/null
+++ b/node_modules/mathjs/examples/expressions.js
@@ -0,0 +1,188 @@
+/**
+ * Expressions can be evaluated in various ways:
+ *
+ * 1. using the function math.evaluate
+ * 2. using the function math.parse
+ * 3. using a parser. A parser contains functions evaluate and parse,
+ *    and keeps a scope with assigned variables in memory
+ */
+
+// load math.js (using node.js)
+const math = require('..')
+
+// 1. using the function math.evaluate
+//
+// Function `evaluate` accepts a single expression or an array with
+// expressions as first argument, and has an optional second argument
+// containing a scope with variables and functions. The scope is a regular
+// JavaScript Object. The scope will be used to resolve symbols, and to write
+// assigned variables or function.
+console.log('1. USING FUNCTION MATH.EVAL')
+
+// evaluate expressions
+console.log('\nevaluate expressions')
+print(math.evaluate('sqrt(3^2 + 4^2)')) // 5
+print(math.evaluate('sqrt(-4)')) // 2i
+print(math.evaluate('2 inch to cm')) // 5.08 cm
+print(math.evaluate('cos(45 deg)')) // 0.70711
+
+// evaluate multiple expressions at once
+console.log('\nevaluate multiple expressions at once')
+print(math.evaluate([
+  'f = 3',
+  'g = 4',
+  'f * g'
+])) // [3, 4, 12]
+
+// provide a scope (just a regular JavaScript Object)
+console.log('\nevaluate expressions providing a scope with variables and functions')
+const scope = {
+  a: 3,
+  b: 4
+}
+
+// variables can be read from the scope
+print(math.evaluate('a * b', scope)) // 12
+
+// variable assignments are written to the scope
+print(math.evaluate('c = 2.3 + 4.5', scope)) // 6.8
+print(scope.c) // 6.8
+
+// scope can contain both variables and functions
+scope.hello = function (name) {
+  return 'hello, ' + name + '!'
+}
+print(math.evaluate('hello("hero")', scope)) // "hello, hero!"
+
+// define a function as an expression
+const f = math.evaluate('f(x) = x ^ a', scope)
+print(f(2)) // 8
+print(scope.f(2)) // 8
+
+// 2. using function math.parse
+//
+// Function `math.parse` parses expressions into a node tree. The syntax is
+// similar to function `math.evaluate`.
+// Function `parse` accepts a single expression or an array with
+// expressions as first argument. The function returns a node tree, which
+// then can be compiled against math, and then evaluated against an (optional
+// scope. This scope is a regular JavaScript Object. The scope will be used
+// to resolve symbols, and to write assigned variables or function.
+console.log('\n2. USING FUNCTION MATH.PARSE')
+
+// parse an expression
+console.log('\nparse an expression into a node tree')
+const node1 = math.parse('sqrt(3^2 + 4^2)')
+print(node1.toString()) // "sqrt((3 ^ 2) + (4 ^ 2))"
+
+// compile and evaluate the compiled code
+// you could also do this in two steps: node1.compile().evaluate()
+print(node1.evaluate()) // 5
+
+// provide a scope
+console.log('\nprovide a scope')
+const node2 = math.parse('x^a')
+const code2 = node2.compile()
+print(node2.toString()) // "x ^ a"
+const scope2 = {
+  x: 3,
+  a: 2
+}
+print(code2.evaluate(scope2)) // 9
+
+// change a value in the scope and re-evaluate the node
+scope2.a = 3
+print(code2.evaluate(scope2)) // 27
+
+// 3. using function math.compile
+//
+// Function `math.compile` compiles expressions into a node tree. The syntax is
+// similar to function `math.evaluate`.
+// Function `compile` accepts a single expression or an array with
+// expressions as first argument, and returns an object with a function evaluate
+// to evaluate the compiled expression. On evaluation, an optional scope can
+// be provided. This scope will be used to resolve symbols, and to write
+// assigned variables or function.
+console.log('\n3. USING FUNCTION MATH.COMPILE')
+
+// parse an expression
+console.log('\ncompile an expression')
+const code3 = math.compile('sqrt(3^2 + 4^2)')
+
+// evaluate the compiled code
+print(code3.evaluate()) // 5
+
+// provide a scope for the variable assignment
+console.log('\nprovide a scope')
+const code4 = math.compile('a = a + 3')
+const scope3 = {
+  a: 7
+}
+code4.evaluate(scope3)
+print(scope3.a) // 10
+
+// 4. using a parser
+//
+// In addition to the static functions `math.evaluate` and `math.parse`, math.js
+// contains a parser with functions `evaluate` and `parse`, which automatically
+// keeps a scope with assigned variables in memory. The parser also contains
+// some convenience methods to get, set, and remove variables from memory.
+console.log('\n4. USING A PARSER')
+const parser = math.parser()
+
+// evaluate with parser
+console.log('\nevaluate expressions')
+print(parser.evaluate('sqrt(3^2 + 4^2)')) // 5
+print(parser.evaluate('sqrt(-4)')) // 2i
+print(parser.evaluate('2 inch to cm')) // 5.08 cm
+print(parser.evaluate('cos(45 deg)')) // 0.70710678118655
+
+// define variables and functions
+console.log('\ndefine variables and functions')
+print(parser.evaluate('x = 7 / 2')) // 3.5
+print(parser.evaluate('x + 3')) // 6.5
+print(parser.evaluate('f2(x, y) = x^y')) // f2(x, y)
+print(parser.evaluate('f2(2, 3)')) // 8
+
+// manipulate matrices
+// Note that matrix indexes in the expression parser are one-based with the
+// upper-bound included. On a JavaScript level however, math.js uses zero-based
+// indexes with an excluded upper-bound.
+console.log('\nmanipulate matrices')
+print(parser.evaluate('k = [1, 2; 3, 4]')) // [[1, 2], [3, 4]]
+print(parser.evaluate('l = zeros(2, 2)')) // [[0, 0], [0, 0]]
+print(parser.evaluate('l[1, 1:2] = [5, 6]')) // [5, 6]
+print(parser.evaluate('l')) // [[5, 6], [0, 0]]
+print(parser.evaluate('l[2, :] = [7, 8]')) // [7, 8]
+print(parser.evaluate('l')) // [[5, 6], [7, 8]]
+print(parser.evaluate('m = k * l')) // [[19, 22], [43, 50]]
+print(parser.evaluate('n = m[2, 1]')) // 43
+print(parser.evaluate('n = m[:, 1]')) // [[19], [43]]
+
+// get and set variables and functions
+console.log('\nget and set variables and function in the scope of the parser')
+const x = parser.get('x')
+console.log('x =', x) // x = 3.5
+const f2 = parser.get('f2')
+console.log('f2 =', math.format(f2)) // f2 = f2(x, y)
+const h = f2(3, 3)
+console.log('h =', h) // h = 27
+
+parser.set('i', 500)
+print(parser.evaluate('i / 2')) // 250
+parser.set('hello', function (name) {
+  return 'hello, ' + name + '!'
+})
+print(parser.evaluate('hello("hero")')) // "hello, hero!"
+
+// clear defined functions and variables
+parser.clear()
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  const precision = 14
+  console.log(math.format(value, precision))
+}
diff --git a/node_modules/mathjs/examples/fractions.js b/node_modules/mathjs/examples/fractions.js
new file mode 100644
index 0000000..73aed71
--- /dev/null
+++ b/node_modules/mathjs/examples/fractions.js
@@ -0,0 +1,74 @@
+// Fractions
+
+// load math.js (using node.js)
+const { create, all } = require('..')
+
+// configure the default type of numbers as Fractions
+const config = {
+  // Default type of number
+  // Available options: 'number' (default), 'BigNumber', or 'Fraction'
+  number: 'Fraction'
+}
+
+// create a mathjs instance with everything included
+const math = create(all, config)
+
+console.log('basic usage')
+printRatio(math.fraction(0.125)) // Fraction, 1/8
+printRatio(math.fraction(0.32)) // Fraction, 8/25
+printRatio(math.fraction('1/3')) // Fraction, 1/3
+printRatio(math.fraction('0.(3)')) // Fraction, 1/3
+printRatio(math.fraction(2, 3)) // Fraction, 2/3
+printRatio(math.fraction('0.(285714)')) // Fraction, 2/7
+console.log()
+
+console.log('round-off errors with numbers')
+print(math.add(0.1, 0.2)) // number, 0.30000000000000004
+print(math.divide(0.3, 0.2)) // number, 1.4999999999999998
+console.log()
+
+console.log('no round-off errors with fractions :)')
+print(math.add(math.fraction(0.1), math.fraction(0.2))) // Fraction, 0.3
+print(math.divide(math.fraction(0.3), math.fraction(0.2))) // Fraction, 1.5
+console.log()
+
+console.log('represent an infinite number of repeating digits')
+print(math.fraction('1/3')) // Fraction, 0.(3)
+print(math.fraction('2/7')) // Fraction, 0.(285714)
+print(math.fraction('23/11')) // Fraction, 2.(09)
+console.log()
+
+// one can work conveniently with fractions using the expression parser.
+// note though that Fractions are only supported by basic arithmetic functions
+console.log('use fractions in the expression parser')
+printRatio(math.evaluate('0.1 + 0.2')) // Fraction,  3/10
+printRatio(math.evaluate('0.3 / 0.2')) // Fraction,  3/2
+printRatio(math.evaluate('23 / 11')) // Fraction, 23/11
+console.log()
+
+// output formatting
+console.log('output formatting of fractions')
+const a = math.fraction('2/3')
+console.log(math.format(a)) // Fraction,  2/3
+console.log(math.format(a, { fraction: 'ratio' })) // Fraction,  2/3
+console.log(math.format(a, { fraction: 'decimal' })) // Fraction,  0.(6)
+console.log(a.toString()) // Fraction,  0.(6)
+console.log()
+
+/**
+ * Helper function to output a value in the console.
+ * Fractions will be formatted as ratio, like '1/3'.
+ * @param {*} value
+ */
+function printRatio (value) {
+  console.log(math.format(value, { fraction: 'ratio' }))
+}
+
+/**
+ * Helper function to output a value in the console.
+ * Fractions will be formatted as decimal, like '0.(3)'.
+ * @param {*} value
+ */
+function print (value) {
+  console.log(math.format(value, { fraction: 'decimal' }))
+}
diff --git a/node_modules/mathjs/examples/import.js b/node_modules/mathjs/examples/import.js
new file mode 100644
index 0000000..351cc09
--- /dev/null
+++ b/node_modules/mathjs/examples/import.js
@@ -0,0 +1,95 @@
+/**
+ * Math.js can easily be extended with functions and variables using the
+ * `import` function. The function `import` accepts a module name or an object
+ * containing functions and variables.
+ */
+
+// load math.js (using node.js)
+const { create, all } = require('..')
+const math = create(all)
+
+/**
+ * Define new functions and variables
+ */
+math.import({
+  myConstant: 42,
+  hello: function (name) {
+    return 'hello, ' + name + '!'
+  }
+})
+
+// defined methods can be used in both JavaScript as well as the parser
+print(math.myConstant * 2) // 84
+print(math.hello('user')) // 'hello, user!'
+
+print(math.evaluate('myConstant + 10')) // 52
+print(math.evaluate('hello("user")')) // 'hello, user!'
+
+/**
+ * Import the math library numbers.js, https://github.com/sjkaliski/numbers.js
+ * The library must be installed first using npm:
+ *     npm install numbers
+ */
+try {
+  // load the numbers.js library
+  const numbers = require('numbers')
+
+  // import the numbers.js library into math.js
+  math.import(numbers, { wrap: true, silent: true })
+
+  if (math.fibonacci) {
+    // calculate fibonacci
+    print(math.fibonacci(7)) // 13
+    print(math.evaluate('fibonacci(7)')) // 13
+  }
+} catch (err) {
+  console.log('Warning: To use numbers.js, the library must ' +
+      'be installed first via `npm install numbers`.')
+}
+
+/**
+ * Import the math library numeric.js, https://github.com/sloisel/numeric
+ * The library must be installed first using npm:
+ *     npm install numeric
+ */
+try {
+  // load the numeric.js library
+  const numeric = require('numeric')
+
+  // import the numeric.js library into math.js
+  math.import(numeric, { wrap: true, silent: true })
+
+  if (math.eig) {
+    // calculate eigenvalues of a matrix
+    print(math.evaluate('eig([1, 2; 4, 3])').lambda.x) // [5, -1]
+
+    // solve AX = b
+    const A = math.evaluate('[1, 2, 3; 2, -1, 1; 3, 0, -1]')
+    const b = [9, 8, 3]
+    print(math.solve(A, b)) // [2, -1, 3]
+  }
+} catch (err) {
+  console.log('Warning: To use numeric.js, the library must ' +
+      'be installed first via `npm install numeric`.')
+}
+
+/**
+ * By default, the function import does not allow overriding existing functions.
+ * Existing functions can be overridden by specifying option `override: true`
+ */
+math.import({
+  pi: 3.14
+}, {
+  override: true
+})
+
+print(math.pi) // returns 3.14 instead of 3.141592653589793
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  const precision = 14
+  console.log(math.format(value, precision))
+}
diff --git a/node_modules/mathjs/examples/matrices.js b/node_modules/mathjs/examples/matrices.js
new file mode 100644
index 0000000..0e69021
--- /dev/null
+++ b/node_modules/mathjs/examples/matrices.js
@@ -0,0 +1,101 @@
+// matrices
+
+// load math.js (using node.js)
+const math = require('..')
+
+// create matrices and arrays. a matrix is just a wrapper around an Array,
+// providing some handy utilities.
+console.log('create a matrix')
+const a = math.matrix([1, 4, 9, 16, 25])
+print(a) // [1, 4, 9, 16, 25]
+const b = math.matrix(math.ones([2, 3]))
+print(b) // [[1, 1, 1], [1, 1, 1]]
+print(b.size()) // [2, 3]
+
+// the Array data of a Matrix can be retrieved using valueOf()
+const array = a.valueOf()
+print(array) // [1, 4, 9, 16, 25]
+
+// Matrices can be cloned
+const clone = a.clone()
+print(clone) // [1, 4, 9, 16, 25]
+console.log()
+
+// perform operations with matrices
+console.log('perform operations')
+print(math.sqrt(a)) // [1, 2, 3, 4, 5]
+const c = [1, 2, 3, 4, 5]
+print(math.factorial(c)) // [1, 2, 6, 24, 120]
+console.log()
+
+// create and manipulate matrices. Arrays and Matrices can be used mixed.
+console.log('manipulate matrices')
+const d = [[1, 2], [3, 4]]
+print(d) // [[1, 2], [3, 4]]
+const e = math.matrix([[5, 6], [1, 1]])
+print(e) // [[5, 6], [1, 1]]
+
+// set a submatrix.
+// Matrix indexes are zero-based.
+e.subset(math.index(1, [0, 1]), [[7, 8]])
+print(e) // [[5, 6], [7, 8]]
+const f = math.multiply(d, e)
+print(f) // [[19, 22], [43, 50]]
+const g = f.subset(math.index(1, 0))
+print(g) // 43
+console.log()
+
+// get a sub matrix
+// Matrix indexes are zero-based.
+console.log('get a sub matrix')
+const h = math.diag(math.range(1, 4))
+print(h) // [[1, 0, 0], [0, 2, 0], [0, 0, 3]]
+print(h.subset(math.index([1, 2], [1, 2]))) // [[2, 0], [0, 3]]
+const i = math.range(1, 6)
+print(i) // [1, 2, 3, 4, 5]
+print(i.subset(math.index(math.range(1, 4)))) // [2, 3, 4]
+console.log()
+
+// resize a multi dimensional matrix
+console.log('resizing a matrix')
+const j = math.matrix()
+let defaultValue = 0
+j.resize([2, 2, 2], defaultValue)
+print(j) // [[[0, 0], [0, 0]], [[0, 0], [0, 0]]]
+print(j.size()) // [2, 2, 2]
+j.resize([2, 2])
+print(j) // [[0, 0], [0, 0]]
+print(j.size()) // [2, 2]
+console.log()
+
+// setting a value outside the matrices range will resize the matrix.
+// new elements will be initialized with zero.
+console.log('set a value outside a matrices range')
+const k = math.matrix()
+k.subset(math.index(2), 6)
+print(k) // [0, 0, 6]
+console.log()
+
+console.log('set a value outside a matrices range, setting other new entries to null')
+const m = math.matrix()
+defaultValue = null
+m.subset(math.index(2), 6, defaultValue)
+print(m) // [null, null, 6]
+console.log()
+
+// create ranges
+console.log('create ranges')
+print(math.range(1, 6)) // [1, 2, 3, 4, 5]
+print(math.range(0, 18, 3)) // [0, 3, 6, 9, 12, 15]
+print(math.range('2:-1:-3')) // [2, 1, 0, -1, -2]
+print(math.factorial(math.range('1:6'))) // [1, 2, 6, 24, 120]
+console.log()
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  const precision = 14
+  console.log(math.format(value, precision))
+}
diff --git a/node_modules/mathjs/examples/node_modules/.bin/acorn b/node_modules/mathjs/examples/node_modules/.bin/acorn
new file mode 100644
index 0000000..46a3e61
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/acorn
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../acorn/bin/acorn" "$@"
+else 
+  exec node  "$basedir/../acorn/bin/acorn" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/acorn.cmd b/node_modules/mathjs/examples/node_modules/.bin/acorn.cmd
new file mode 100644
index 0000000..f38017c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/acorn.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\acorn\bin\acorn" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/acorn.ps1 b/node_modules/mathjs/examples/node_modules/.bin/acorn.ps1
new file mode 100644
index 0000000..6f6dcdd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/acorn.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../acorn/bin/acorn" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../acorn/bin/acorn" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../acorn/bin/acorn" $args
+  } else {
+    & "node$exe"  "$basedir/../acorn/bin/acorn" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/browserslist b/node_modules/mathjs/examples/node_modules/.bin/browserslist
new file mode 100644
index 0000000..68dd69d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/browserslist
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../browserslist/cli.js" "$@"
+else 
+  exec node  "$basedir/../browserslist/cli.js" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/browserslist.cmd b/node_modules/mathjs/examples/node_modules/.bin/browserslist.cmd
new file mode 100644
index 0000000..e2a0d3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/browserslist.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\browserslist\cli.js" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/browserslist.ps1 b/node_modules/mathjs/examples/node_modules/.bin/browserslist.ps1
new file mode 100644
index 0000000..01e10a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/browserslist.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../browserslist/cli.js" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../browserslist/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../browserslist/cli.js" $args
+  } else {
+    & "node$exe"  "$basedir/../browserslist/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/envinfo b/node_modules/mathjs/examples/node_modules/.bin/envinfo
new file mode 100644
index 0000000..239315f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/envinfo
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../envinfo/dist/cli.js" "$@"
+else 
+  exec node  "$basedir/../envinfo/dist/cli.js" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/envinfo.cmd b/node_modules/mathjs/examples/node_modules/.bin/envinfo.cmd
new file mode 100644
index 0000000..6b7a5b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/envinfo.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\envinfo\dist\cli.js" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/envinfo.ps1 b/node_modules/mathjs/examples/node_modules/.bin/envinfo.ps1
new file mode 100644
index 0000000..f9e36e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/envinfo.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../envinfo/dist/cli.js" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../envinfo/dist/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../envinfo/dist/cli.js" $args
+  } else {
+    & "node$exe"  "$basedir/../envinfo/dist/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture b/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture
new file mode 100644
index 0000000..79e3180
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../import-local/fixtures/cli.js" "$@"
+else 
+  exec node  "$basedir/../import-local/fixtures/cli.js" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture.cmd b/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture.cmd
new file mode 100644
index 0000000..53ee97f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\import-local\fixtures\cli.js" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture.ps1 b/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture.ps1
new file mode 100644
index 0000000..01ef784
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/import-local-fixture.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../import-local/fixtures/cli.js" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../import-local/fixtures/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../import-local/fixtures/cli.js" $args
+  } else {
+    & "node$exe"  "$basedir/../import-local/fixtures/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/node-which b/node_modules/mathjs/examples/node_modules/.bin/node-which
new file mode 100644
index 0000000..aece735
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/node-which
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../which/bin/node-which" "$@"
+else 
+  exec node  "$basedir/../which/bin/node-which" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/node-which.cmd b/node_modules/mathjs/examples/node_modules/.bin/node-which.cmd
new file mode 100644
index 0000000..7eeb316
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/node-which.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\which\bin\node-which" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/node-which.ps1 b/node_modules/mathjs/examples/node_modules/.bin/node-which.ps1
new file mode 100644
index 0000000..cfb09e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/node-which.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../which/bin/node-which" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../which/bin/node-which" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../which/bin/node-which" $args
+  } else {
+    & "node$exe"  "$basedir/../which/bin/node-which" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/resolve b/node_modules/mathjs/examples/node_modules/.bin/resolve
new file mode 100644
index 0000000..757d454
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/resolve
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../resolve/bin/resolve" "$@"
+else 
+  exec node  "$basedir/../resolve/bin/resolve" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/resolve.cmd b/node_modules/mathjs/examples/node_modules/.bin/resolve.cmd
new file mode 100644
index 0000000..6358238
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/resolve.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\resolve\bin\resolve" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/resolve.ps1 b/node_modules/mathjs/examples/node_modules/.bin/resolve.ps1
new file mode 100644
index 0000000..f22b2d3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/resolve.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../resolve/bin/resolve" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../resolve/bin/resolve" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../resolve/bin/resolve" $args
+  } else {
+    & "node$exe"  "$basedir/../resolve/bin/resolve" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/terser b/node_modules/mathjs/examples/node_modules/.bin/terser
new file mode 100644
index 0000000..2d3fa89
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/terser
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../terser/bin/terser" "$@"
+else 
+  exec node  "$basedir/../terser/bin/terser" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/terser.cmd b/node_modules/mathjs/examples/node_modules/.bin/terser.cmd
new file mode 100644
index 0000000..5186ade
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/terser.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\terser\bin\terser" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/terser.ps1 b/node_modules/mathjs/examples/node_modules/.bin/terser.ps1
new file mode 100644
index 0000000..0bbfff6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/terser.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../terser/bin/terser" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../terser/bin/terser" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../terser/bin/terser" $args
+  } else {
+    & "node$exe"  "$basedir/../terser/bin/terser" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/webpack b/node_modules/mathjs/examples/node_modules/.bin/webpack
new file mode 100644
index 0000000..e674801
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/webpack
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../webpack/bin/webpack.js" "$@"
+else 
+  exec node  "$basedir/../webpack/bin/webpack.js" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/webpack-cli b/node_modules/mathjs/examples/node_modules/.bin/webpack-cli
new file mode 100644
index 0000000..d04406f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/webpack-cli
@@ -0,0 +1,12 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+    *CYGWIN*|*MINGW*|*MSYS*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+  exec "$basedir/node"  "$basedir/../webpack-cli/bin/cli.js" "$@"
+else 
+  exec node  "$basedir/../webpack-cli/bin/cli.js" "$@"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/.bin/webpack-cli.cmd b/node_modules/mathjs/examples/node_modules/.bin/webpack-cli.cmd
new file mode 100644
index 0000000..c469b5d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/webpack-cli.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\webpack-cli\bin\cli.js" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/webpack-cli.ps1 b/node_modules/mathjs/examples/node_modules/.bin/webpack-cli.ps1
new file mode 100644
index 0000000..9400edb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/webpack-cli.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../webpack-cli/bin/cli.js" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../webpack-cli/bin/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../webpack-cli/bin/cli.js" $args
+  } else {
+    & "node$exe"  "$basedir/../webpack-cli/bin/cli.js" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.bin/webpack.cmd b/node_modules/mathjs/examples/node_modules/.bin/webpack.cmd
new file mode 100644
index 0000000..6fbf5ec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/webpack.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+  SET "_prog=%dp0%\node.exe"
+) ELSE (
+  SET "_prog=node"
+  SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%"  "%dp0%\..\webpack\bin\webpack.js" %*
diff --git a/node_modules/mathjs/examples/node_modules/.bin/webpack.ps1 b/node_modules/mathjs/examples/node_modules/.bin/webpack.ps1
new file mode 100644
index 0000000..57bb525
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.bin/webpack.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+  # Fix case when both the Windows and Linux builds of Node
+  # are installed in the same directory
+  $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "$basedir/node$exe"  "$basedir/../webpack/bin/webpack.js" $args
+  } else {
+    & "$basedir/node$exe"  "$basedir/../webpack/bin/webpack.js" $args
+  }
+  $ret=$LASTEXITCODE
+} else {
+  # Support pipeline input
+  if ($MyInvocation.ExpectingInput) {
+    $input | & "node$exe"  "$basedir/../webpack/bin/webpack.js" $args
+  } else {
+    & "node$exe"  "$basedir/../webpack/bin/webpack.js" $args
+  }
+  $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/node_modules/mathjs/examples/node_modules/.package-lock.json b/node_modules/mathjs/examples/node_modules/.package-lock.json
new file mode 100644
index 0000000..a430373
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/.package-lock.json
@@ -0,0 +1,1407 @@
+{
+  "name": "examples",
+  "lockfileVersion": 2,
+  "requires": true,
+  "packages": {
+    "node_modules/@discoveryjs/json-ext": {
+      "version": "0.5.7",
+      "resolved": "https://registry.npmjs.org/@discoveryjs/json-ext/-/json-ext-0.5.7.tgz",
+      "integrity": "sha512-dBVuXR082gk3jsFp7Rd/JI4kytwGHecnCoTtXFb7DB6CNHp4rg5k1bhg0nWdLGLnOV71lmDzGQaLMy8iPLY0pw==",
+      "dev": true,
+      "engines": {
+        "node": ">=10.0.0"
+      }
+    },
+    "node_modules/@types/eslint": {
+      "version": "8.4.1",
+      "resolved": "https://registry.npmjs.org/@types/eslint/-/eslint-8.4.1.tgz",
+      "integrity": "sha512-GE44+DNEyxxh2Kc6ro/VkIj+9ma0pO0bwv9+uHSyBrikYOHr8zYcdPvnBOp1aw8s+CjRvuSx7CyWqRrNFQ59mA==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@types/estree": "*",
+        "@types/json-schema": "*"
+      }
+    },
+    "node_modules/@types/eslint-scope": {
+      "version": "3.7.3",
+      "resolved": "https://registry.npmjs.org/@types/eslint-scope/-/eslint-scope-3.7.3.tgz",
+      "integrity": "sha512-PB3ldyrcnAicT35TWPs5IcwKD8S333HMaa2VVv4+wdvebJkjWuW/xESoB8IwRcog8HYVYamb1g/R31Qv5Bx03g==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@types/eslint": "*",
+        "@types/estree": "*"
+      }
+    },
+    "node_modules/@types/estree": {
+      "version": "0.0.51",
+      "resolved": "https://registry.npmjs.org/@types/estree/-/estree-0.0.51.tgz",
+      "integrity": "sha512-CuPgU6f3eT/XgKKPqKd/gLZV1Xmvf1a2R5POBOGQa6uv82xpls89HU5zKeVoyR8XzHd1RGNOlQlvUe3CFkjWNQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@types/json-schema": {
+      "version": "7.0.11",
+      "resolved": "https://registry.npmjs.org/@types/json-schema/-/json-schema-7.0.11.tgz",
+      "integrity": "sha512-wOuvG1SN4Us4rez+tylwwwCV1psiNVOkJeM3AUWUNWg/jDQY2+HE/444y5gc+jBmRqASOm2Oeh5c1axHobwRKQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@types/node": {
+      "version": "17.0.23",
+      "resolved": "https://registry.npmjs.org/@types/node/-/node-17.0.23.tgz",
+      "integrity": "sha512-UxDxWn7dl97rKVeVS61vErvw086aCYhDLyvRQZ5Rk65rZKepaFdm53GeqXaKBuOhED4e9uWq34IC3TdSdJJ2Gw==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@webassemblyjs/ast": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.1.tgz",
+      "integrity": "sha512-ukBh14qFLjxTQNTXocdyksN5QdM28S1CxHt2rdskFyL+xFV7VremuBLVbmCePj+URalXBENx/9Lm7lnhihtCSw==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/helper-numbers": "1.11.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.1"
+      }
+    },
+    "node_modules/@webassemblyjs/floating-point-hex-parser": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/floating-point-hex-parser/-/floating-point-hex-parser-1.11.1.tgz",
+      "integrity": "sha512-iGRfyc5Bq+NnNuX8b5hwBrRjzf0ocrJPI6GWFodBFzmFnyvrQ83SHKhmilCU/8Jv67i4GJZBMhEzltxzcNagtQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@webassemblyjs/helper-api-error": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-api-error/-/helper-api-error-1.11.1.tgz",
+      "integrity": "sha512-RlhS8CBCXfRUR/cwo2ho9bkheSXG0+NwooXcc3PAILALf2QLdFyj7KGsKRbVc95hZnhnERon4kW/D3SZpp6Tcg==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@webassemblyjs/helper-buffer": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.1.tgz",
+      "integrity": "sha512-gwikF65aDNeeXa8JxXa2BAk+REjSyhrNC9ZwdT0f8jc4dQQeDQ7G4m0f2QCLPJiMTTO6wfDmRmj/pW0PsUvIcA==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@webassemblyjs/helper-numbers": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-numbers/-/helper-numbers-1.11.1.tgz",
+      "integrity": "sha512-vDkbxiB8zfnPdNK9Rajcey5C0w+QJugEglN0of+kmO8l7lDb77AnlKYQF7aarZuCrv+l0UvqL+68gSDr3k9LPQ==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/floating-point-hex-parser": "1.11.1",
+        "@webassemblyjs/helper-api-error": "1.11.1",
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "node_modules/@webassemblyjs/helper-wasm-bytecode": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-bytecode/-/helper-wasm-bytecode-1.11.1.tgz",
+      "integrity": "sha512-PvpoOGiJwXeTrSf/qfudJhwlvDQxFgelbMqtq52WWiXC6Xgg1IREdngmPN3bs4RoO83PnL/nFrxucXj1+BX62Q==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@webassemblyjs/helper-wasm-section": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.1.tgz",
+      "integrity": "sha512-10P9No29rYX1j7F3EVPX3JvGPQPae+AomuSTPiF9eBQeChHI6iqjMIwR9JmOJXwpnn/oVGDk7I5IlskuMwU/pg==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/ast": "1.11.1",
+        "@webassemblyjs/helper-buffer": "1.11.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+        "@webassemblyjs/wasm-gen": "1.11.1"
+      }
+    },
+    "node_modules/@webassemblyjs/ieee754": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/ieee754/-/ieee754-1.11.1.tgz",
+      "integrity": "sha512-hJ87QIPtAMKbFq6CGTkZYJivEwZDbQUgYd3qKSadTNOhVY7p+gfP6Sr0lLRVTaG1JjFj+r3YchoqRYxNH3M0GQ==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@xtuc/ieee754": "^1.2.0"
+      }
+    },
+    "node_modules/@webassemblyjs/leb128": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/leb128/-/leb128-1.11.1.tgz",
+      "integrity": "sha512-BJ2P0hNZ0u+Th1YZXJpzW6miwqQUGcIHT1G/sf72gLVD9DZ5AdYTqPNbHZh6K1M5VmKvFXwGSWZADz+qBWxeRw==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "node_modules/@webassemblyjs/utf8": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/utf8/-/utf8-1.11.1.tgz",
+      "integrity": "sha512-9kqcxAEdMhiwQkHpkNiorZzqpGrodQQ2IGrHHxCy+Ozng0ofyMA0lTqiLkVs1uzTRejX+/O0EOT7KxqVPuXosQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@webassemblyjs/wasm-edit": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.1.tgz",
+      "integrity": "sha512-g+RsupUC1aTHfR8CDgnsVRVZFJqdkFHpsHMfJuWQzWU3tvnLC07UqHICfP+4XyL2tnr1amvl1Sdp06TnYCmVkA==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/ast": "1.11.1",
+        "@webassemblyjs/helper-buffer": "1.11.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+        "@webassemblyjs/helper-wasm-section": "1.11.1",
+        "@webassemblyjs/wasm-gen": "1.11.1",
+        "@webassemblyjs/wasm-opt": "1.11.1",
+        "@webassemblyjs/wasm-parser": "1.11.1",
+        "@webassemblyjs/wast-printer": "1.11.1"
+      }
+    },
+    "node_modules/@webassemblyjs/wasm-gen": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.1.tgz",
+      "integrity": "sha512-F7QqKXwwNlMmsulj6+O7r4mmtAlCWfO/0HdgOxSklZfQcDu0TpLiD1mRt/zF25Bk59FIjEuGAIyn5ei4yMfLhA==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/ast": "1.11.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+        "@webassemblyjs/ieee754": "1.11.1",
+        "@webassemblyjs/leb128": "1.11.1",
+        "@webassemblyjs/utf8": "1.11.1"
+      }
+    },
+    "node_modules/@webassemblyjs/wasm-opt": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.1.tgz",
+      "integrity": "sha512-VqnkNqnZlU5EB64pp1l7hdm3hmQw7Vgqa0KF/KCNO9sIpI6Fk6brDEiX+iCOYrvMuBWDws0NkTOxYEb85XQHHw==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/ast": "1.11.1",
+        "@webassemblyjs/helper-buffer": "1.11.1",
+        "@webassemblyjs/wasm-gen": "1.11.1",
+        "@webassemblyjs/wasm-parser": "1.11.1"
+      }
+    },
+    "node_modules/@webassemblyjs/wasm-parser": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.1.tgz",
+      "integrity": "sha512-rrBujw+dJu32gYB7/Lup6UhdkPx9S9SnobZzRVL7VcBH9Bt9bCBLEuX/YXOOtBsOZ4NQrRykKhffRWHvigQvOA==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/ast": "1.11.1",
+        "@webassemblyjs/helper-api-error": "1.11.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+        "@webassemblyjs/ieee754": "1.11.1",
+        "@webassemblyjs/leb128": "1.11.1",
+        "@webassemblyjs/utf8": "1.11.1"
+      }
+    },
+    "node_modules/@webassemblyjs/wast-printer": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.1.tgz",
+      "integrity": "sha512-IQboUWM4eKzWW+N/jij2sRatKMh99QEelo3Eb2q0qXkvPRISAj8Qxtmw5itwqK+TTkBuUIE45AxYPToqPtL5gg==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@webassemblyjs/ast": "1.11.1",
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "node_modules/@webpack-cli/configtest": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/@webpack-cli/configtest/-/configtest-1.1.1.tgz",
+      "integrity": "sha512-1FBc1f9G4P/AxMqIgfZgeOTuRnwZMten8E7zap5zgpPInnCrP8D4Q81+4CWIch8i/Nf7nXjP0v6CjjbHOrXhKg==",
+      "dev": true,
+      "peerDependencies": {
+        "webpack": "4.x.x || 5.x.x",
+        "webpack-cli": "4.x.x"
+      }
+    },
+    "node_modules/@webpack-cli/info": {
+      "version": "1.4.1",
+      "resolved": "https://registry.npmjs.org/@webpack-cli/info/-/info-1.4.1.tgz",
+      "integrity": "sha512-PKVGmazEq3oAo46Q63tpMr4HipI3OPfP7LiNOEJg963RMgT0rqheag28NCML0o3GIzA3DmxP1ZIAv9oTX1CUIA==",
+      "dev": true,
+      "dependencies": {
+        "envinfo": "^7.7.3"
+      },
+      "peerDependencies": {
+        "webpack-cli": "4.x.x"
+      }
+    },
+    "node_modules/@webpack-cli/serve": {
+      "version": "1.6.1",
+      "resolved": "https://registry.npmjs.org/@webpack-cli/serve/-/serve-1.6.1.tgz",
+      "integrity": "sha512-gNGTiTrjEVQ0OcVnzsRSqTxaBSr+dmTfm+qJsCDluky8uhdLWep7Gcr62QsAKHTMxjCS/8nEITsmFAhfIx+QSw==",
+      "dev": true,
+      "peerDependencies": {
+        "webpack-cli": "4.x.x"
+      },
+      "peerDependenciesMeta": {
+        "webpack-dev-server": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@xtuc/ieee754": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/@xtuc/ieee754/-/ieee754-1.2.0.tgz",
+      "integrity": "sha512-DX8nKgqcGwsc0eJSqYt5lwP4DH5FlHnmuWWBRy7X0NcaGR0ZtuyeESgMwTYVEtxmsNGY+qit4QYT/MIYTOTPeA==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/@xtuc/long": {
+      "version": "4.2.2",
+      "resolved": "https://registry.npmjs.org/@xtuc/long/-/long-4.2.2.tgz",
+      "integrity": "sha512-NuHqBY1PB/D8xU6s/thBgOAiAP7HOYDQ32+BFZILJ8ivkUkAHQnWfn6WhL79Owj1qmUnoN/YPhktdIoucipkAQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/acorn": {
+      "version": "8.7.0",
+      "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.7.0.tgz",
+      "integrity": "sha512-V/LGr1APy+PXIwKebEWrkZPwoeoF+w1jiOBUmuxuiUIaOHtob8Qc9BTrYo7VuI5fR8tqsy+buA2WFooR5olqvQ==",
+      "dev": true,
+      "peer": true,
+      "bin": {
+        "acorn": "bin/acorn"
+      },
+      "engines": {
+        "node": ">=0.4.0"
+      }
+    },
+    "node_modules/acorn-import-assertions": {
+      "version": "1.8.0",
+      "resolved": "https://registry.npmjs.org/acorn-import-assertions/-/acorn-import-assertions-1.8.0.tgz",
+      "integrity": "sha512-m7VZ3jwz4eK6A4Vtt8Ew1/mNbP24u0FhdyfA7fSvnJR6LMdfOYnmuIrrJAgrYfYJ10F/otaHTtrtrtmHdMNzEw==",
+      "dev": true,
+      "peer": true,
+      "peerDependencies": {
+        "acorn": "^8"
+      }
+    },
+    "node_modules/ajv": {
+      "version": "6.12.6",
+      "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.12.6.tgz",
+      "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/ajv-keywords": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmjs.org/ajv-keywords/-/ajv-keywords-3.5.2.tgz",
+      "integrity": "sha512-5p6WTN0DdTGVQk6VjcEju19IgaHudalcfabD7yhDGeA6bcQnmL+CpveLJq/3hvfwd1aof6L386Ougkx6RfyMIQ==",
+      "dev": true,
+      "peer": true,
+      "peerDependencies": {
+        "ajv": "^6.9.1"
+      }
+    },
+    "node_modules/browserslist": {
+      "version": "4.20.2",
+      "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.20.2.tgz",
+      "integrity": "sha512-CQOBCqp/9pDvDbx3xfMi+86pr4KXIf2FDkTTdeuYw8OxS9t898LA1Khq57gtufFILXpfgsSx5woNgsBgvGjpsA==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/browserslist"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/browserslist"
+        }
+      ],
+      "peer": true,
+      "dependencies": {
+        "caniuse-lite": "^1.0.30001317",
+        "electron-to-chromium": "^1.4.84",
+        "escalade": "^3.1.1",
+        "node-releases": "^2.0.2",
+        "picocolors": "^1.0.0"
+      },
+      "bin": {
+        "browserslist": "cli.js"
+      },
+      "engines": {
+        "node": "^6 || ^7 || ^8 || ^9 || ^10 || ^11 || ^12 || >=13.7"
+      }
+    },
+    "node_modules/buffer-from": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/buffer-from/-/buffer-from-1.1.2.tgz",
+      "integrity": "sha512-E+XQCRwSbaaiChtv6k6Dwgc+bx+Bs6vuKJHHl5kox/BaKbhiXzqQOwK4cO22yElGp2OCmjwVhT3HmxgyPGnJfQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/caniuse-lite": {
+      "version": "1.0.30001320",
+      "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001320.tgz",
+      "integrity": "sha512-MWPzG54AGdo3nWx7zHZTefseM5Y1ccM7hlQKHRqJkPozUaw3hNbBTMmLn16GG2FUzjR13Cr3NPfhIieX5PzXDA==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/browserslist"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/caniuse-lite"
+        }
+      ],
+      "peer": true
+    },
+    "node_modules/chrome-trace-event": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/chrome-trace-event/-/chrome-trace-event-1.0.3.tgz",
+      "integrity": "sha512-p3KULyQg4S7NIHixdwbGX+nFHkoBiA4YQmyWtjb8XngSKV124nJmRysgAeujbUVb15vh+RvFUfCPqU7rXk+hZg==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=6.0"
+      }
+    },
+    "node_modules/clone-deep": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/clone-deep/-/clone-deep-4.0.1.tgz",
+      "integrity": "sha512-neHB9xuzh/wk0dIHweyAXv2aPGZIVk3pLMe+/RNzINf17fe0OG96QroktYAUm7SM1PBnzTabaLboqqxDyMU+SQ==",
+      "dev": true,
+      "dependencies": {
+        "is-plain-object": "^2.0.4",
+        "kind-of": "^6.0.2",
+        "shallow-clone": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/colorette": {
+      "version": "2.0.16",
+      "resolved": "https://registry.npmjs.org/colorette/-/colorette-2.0.16.tgz",
+      "integrity": "sha512-hUewv7oMjCp+wkBv5Rm0v87eJhq4woh5rSR+42YSQJKecCqgIqNkZ6lAlQms/BwHPJA5NKMRlpxPRv0n8HQW6g==",
+      "dev": true
+    },
+    "node_modules/commander": {
+      "version": "2.20.3",
+      "resolved": "https://registry.npmjs.org/commander/-/commander-2.20.3.tgz",
+      "integrity": "sha512-GpVkmM8vF2vQUkj2LvZmD35JxeJOLCwJ9cUkugyk2nuhbv3+mJvpLYYt+0+USMxE+oj+ey/lJEnhZw75x/OMcQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/cross-spawn": {
+      "version": "7.0.3",
+      "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-7.0.3.tgz",
+      "integrity": "sha512-iRDPJKUPVEND7dHPO8rkbOnPpyDygcDFtWjpeWNCgy8WP2rXcxXL8TskReQl6OrB2G7+UJrags1q15Fudc7G6w==",
+      "dev": true,
+      "dependencies": {
+        "path-key": "^3.1.0",
+        "shebang-command": "^2.0.0",
+        "which": "^2.0.1"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/electron-to-chromium": {
+      "version": "1.4.96",
+      "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.4.96.tgz",
+      "integrity": "sha512-DPNjvNGPabv6FcyjzLAN4C0psN/GgD9rSGvMTuv81SeXG/EX3mCz0wiw9N1tUEnfQXYCJi3H8M0oFPRziZh7rw==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/enhanced-resolve": {
+      "version": "5.9.2",
+      "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.9.2.tgz",
+      "integrity": "sha512-GIm3fQfwLJ8YZx2smuHpBKkXC1yOk+OBEmKckVyL0i/ea8mqDEykK3ld5dgH1QYPNyT/lIllxV2LULnxCHaHkA==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "graceful-fs": "^4.2.4",
+        "tapable": "^2.2.0"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/envinfo": {
+      "version": "7.8.1",
+      "resolved": "https://registry.npmjs.org/envinfo/-/envinfo-7.8.1.tgz",
+      "integrity": "sha512-/o+BXHmB7ocbHEAs6F2EnG0ogybVVUdkRunTT2glZU9XAaGmhqskrvKwqXuDfNjEO0LZKWdejEEpnq8aM0tOaw==",
+      "dev": true,
+      "bin": {
+        "envinfo": "dist/cli.js"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/es-module-lexer": {
+      "version": "0.9.3",
+      "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-0.9.3.tgz",
+      "integrity": "sha512-1HQ2M2sPtxwnvOvT1ZClHyQDiggdNjURWpY2we6aMKCQiUVxTmVs2UYPLIrD84sS+kMdUwfBSylbJPwNnBrnHQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/escalade": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/escalade/-/escalade-3.1.1.tgz",
+      "integrity": "sha512-k0er2gUkLf8O0zKJiAhmkTnJlTvINGv7ygDNPbeIsX/TJjGJZHuh9B2UxbsaEkmlEo9MfhrSzmhIlhRlI2GXnw==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/eslint-scope": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmjs.org/eslint-scope/-/eslint-scope-5.1.1.tgz",
+      "integrity": "sha512-2NxwbF/hZ0KpepYN0cNbo+FN6XoK7GaHlQhgx/hIZl6Va0bF45RQOOwhLIy8lQDbuCiadSLCBnH2CFYquit5bw==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "esrecurse": "^4.3.0",
+        "estraverse": "^4.1.1"
+      },
+      "engines": {
+        "node": ">=8.0.0"
+      }
+    },
+    "node_modules/esrecurse": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmjs.org/esrecurse/-/esrecurse-4.3.0.tgz",
+      "integrity": "sha512-KmfKL3b6G+RXvP8N1vr3Tq1kL/oCFgn2NYXEtqP8/L3pKapUA4G8cFVaoF3SU323CD4XypR/ffioHmkti6/Tag==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "estraverse": "^5.2.0"
+      },
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/esrecurse/node_modules/estraverse": {
+      "version": "5.3.0",
+      "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.3.0.tgz",
+      "integrity": "sha512-MMdARuVEQziNTeJD8DgMqmhwR11BRQ/cBP+pLtYdSTnf3MIO8fFeiINEbX36ZdNlfU/7A9f3gUw49B3oQsvwBA==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/estraverse": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-4.3.0.tgz",
+      "integrity": "sha512-39nnKffWz8xN1BU/2c79n9nB9HDzo0niYUqx6xyqUnyoAnQyyWpOTdZEeiCch8BBu515t4wp9ZmgVfVhn9EBpw==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/events": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmjs.org/events/-/events-3.3.0.tgz",
+      "integrity": "sha512-mQw+2fkQbALzQ7V0MY0IqdnXNOeTtP4r0lN9z7AAawCXgqea7bDii20AYrIBrFd/Hx0M2Ocz6S111CaFkUcb0Q==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=0.8.x"
+      }
+    },
+    "node_modules/execa": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmjs.org/execa/-/execa-5.1.1.tgz",
+      "integrity": "sha512-8uSpZZocAZRBAPIEINJj3Lo9HyGitllczc27Eh5YYojjMFMn8yHMDMaUHE2Jqfq05D/wucwI4JGURyXt1vchyg==",
+      "dev": true,
+      "dependencies": {
+        "cross-spawn": "^7.0.3",
+        "get-stream": "^6.0.0",
+        "human-signals": "^2.1.0",
+        "is-stream": "^2.0.0",
+        "merge-stream": "^2.0.0",
+        "npm-run-path": "^4.0.1",
+        "onetime": "^5.1.2",
+        "signal-exit": "^3.0.3",
+        "strip-final-newline": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sindresorhus/execa?sponsor=1"
+      }
+    },
+    "node_modules/fast-deep-equal": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.3.tgz",
+      "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/fast-json-stable-stringify": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/fast-json-stable-stringify/-/fast-json-stable-stringify-2.1.0.tgz",
+      "integrity": "sha512-lhd/wF+Lk98HZoTCtlVraHtfh5XYijIjalXck7saUtuanSDyLMxnHhSXEDJqHxD7msR8D0uCmqlkwjCV8xvwHw==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/fastest-levenshtein": {
+      "version": "1.0.12",
+      "resolved": "https://registry.npmjs.org/fastest-levenshtein/-/fastest-levenshtein-1.0.12.tgz",
+      "integrity": "sha512-On2N+BpYJ15xIC974QNVuYGMOlEVt4s0EOI3wwMqOmK1fdDY+FN/zltPV8vosq4ad4c/gJ1KHScUn/6AWIgiow==",
+      "dev": true
+    },
+    "node_modules/find-up": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmjs.org/find-up/-/find-up-4.1.0.tgz",
+      "integrity": "sha512-PpOwAdQ/YlXQ2vj8a3h8IipDuYRi3wceVQQGYWxNINccq40Anw7BlsEXCMbt1Zt+OLA6Fq9suIpIWD0OsnISlw==",
+      "dev": true,
+      "dependencies": {
+        "locate-path": "^5.0.0",
+        "path-exists": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/function-bind": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.1.tgz",
+      "integrity": "sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A==",
+      "dev": true
+    },
+    "node_modules/get-stream": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-6.0.1.tgz",
+      "integrity": "sha512-ts6Wi+2j3jQjqi70w5AlN8DFnkSwC+MqmxEzdEALB2qXZYV3X/b1CTfgPLGJNMeAWxdPfU8FO1ms3NUfaHCPYg==",
+      "dev": true,
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/glob-to-regexp": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/glob-to-regexp/-/glob-to-regexp-0.4.1.tgz",
+      "integrity": "sha512-lkX1HJXwyMcprw/5YUZc2s7DrpAiHB21/V+E1rHUrVNokkvB6bqMzT0VfV6/86ZNabt1k14YOIaT7nDvOX3Iiw==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/graceful-fs": {
+      "version": "4.2.9",
+      "resolved": "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.9.tgz",
+      "integrity": "sha512-NtNxqUcXgpW2iMrfqSfR73Glt39K+BLwWsPs94yR63v45T0Wbej7eRmL5cWfwEgqXnmjQp3zaJTshdRW/qC2ZQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/has": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/has/-/has-1.0.3.tgz",
+      "integrity": "sha512-f2dvO0VU6Oej7RkWJGrehjbzMAjFp5/VKPp5tTpWIV4JHHZK1/BxbFRtf/siA2SWTe09caDmVtYYzWEIbBS4zw==",
+      "dev": true,
+      "dependencies": {
+        "function-bind": "^1.1.1"
+      },
+      "engines": {
+        "node": ">= 0.4.0"
+      }
+    },
+    "node_modules/has-flag": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-4.0.0.tgz",
+      "integrity": "sha512-EykJT/Q1KjTWctppgIAgfSO0tKVuZUjhgMr17kqTumMl6Afv3EISleU7qZUzoXDFTAHTDC4NOoG/ZxU3EvlMPQ==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/human-signals": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/human-signals/-/human-signals-2.1.0.tgz",
+      "integrity": "sha512-B4FFZ6q/T2jhhksgkbEW3HBvWIfDW85snkQgawt07S7J5QXTk6BkNV+0yAeZrM5QpMAdYlocGoljn0sJ/WQkFw==",
+      "dev": true,
+      "engines": {
+        "node": ">=10.17.0"
+      }
+    },
+    "node_modules/import-local": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/import-local/-/import-local-3.1.0.tgz",
+      "integrity": "sha512-ASB07uLtnDs1o6EHjKpX34BKYDSqnFerfTOJL2HvMqF70LnxpjkzDB8J44oT9pu4AMPkQwf8jl6szgvNd2tRIg==",
+      "dev": true,
+      "dependencies": {
+        "pkg-dir": "^4.2.0",
+        "resolve-cwd": "^3.0.0"
+      },
+      "bin": {
+        "import-local-fixture": "fixtures/cli.js"
+      },
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/interpret": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/interpret/-/interpret-2.2.0.tgz",
+      "integrity": "sha512-Ju0Bz/cEia55xDwUWEa8+olFpCiQoypjnQySseKtmjNrnps3P+xfpUmGr90T7yjlVJmOtybRvPXhKMbHr+fWnw==",
+      "dev": true,
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/is-core-module": {
+      "version": "2.8.1",
+      "resolved": "https://registry.npmjs.org/is-core-module/-/is-core-module-2.8.1.tgz",
+      "integrity": "sha512-SdNCUs284hr40hFTFP6l0IfZ/RSrMXF3qgoRHd3/79unUTvrFO/JoXwkGm+5J/Oe3E/b5GsnG330uUNgRpu1PA==",
+      "dev": true,
+      "dependencies": {
+        "has": "^1.0.3"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/is-plain-object": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmjs.org/is-plain-object/-/is-plain-object-2.0.4.tgz",
+      "integrity": "sha512-h5PpgXkWitc38BBMYawTYMWJHFZJVnBquFE57xFpjB8pJFiF6gZ+bU+WyI/yqXiFR5mdLsgYNaPe8uao6Uv9Og==",
+      "dev": true,
+      "dependencies": {
+        "isobject": "^3.0.1"
+      },
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-stream": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/is-stream/-/is-stream-2.0.1.tgz",
+      "integrity": "sha512-hFoiJiTl63nn+kstHGBtewWSKnQLpyb155KHheA1l39uvtO9nWIop1p3udqPcUd/xbF1VLMO4n7OI6p7RbngDg==",
+      "dev": true,
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/isexe": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/isexe/-/isexe-2.0.0.tgz",
+      "integrity": "sha1-6PvzdNxVb/iUehDcsFctYz8s+hA=",
+      "dev": true
+    },
+    "node_modules/isobject": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/isobject/-/isobject-3.0.1.tgz",
+      "integrity": "sha1-TkMekrEalzFjaqH5yNHMvP2reN8=",
+      "dev": true,
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/jest-worker": {
+      "version": "27.5.1",
+      "resolved": "https://registry.npmjs.org/jest-worker/-/jest-worker-27.5.1.tgz",
+      "integrity": "sha512-7vuh85V5cdDofPyxn58nrPjBktZo0u9x1g8WtjQol+jZDaE+fhN+cIvTj11GndBnMnyfrUOG1sZQxCdjKh+DKg==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@types/node": "*",
+        "merge-stream": "^2.0.0",
+        "supports-color": "^8.0.0"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      }
+    },
+    "node_modules/json-parse-better-errors": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/json-parse-better-errors/-/json-parse-better-errors-1.0.2.tgz",
+      "integrity": "sha512-mrqyZKfX5EhL7hvqcV6WG1yYjnjeuYDzDhhcAAUrq8Po85NBQBJP+ZDUT75qZQ98IkUoBqdkExkukOU7Ts2wrw==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/kind-of": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-6.0.3.tgz",
+      "integrity": "sha512-dcS1ul+9tmeD95T+x28/ehLgd9mENa3LsvDTtzm3vyBEO7RPptvAD+t44WVXaUjTBRcrpFeFlC8WCruUR456hw==",
+      "dev": true,
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/loader-runner": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/loader-runner/-/loader-runner-4.2.0.tgz",
+      "integrity": "sha512-92+huvxMvYlMzMt0iIOukcwYBFpkYJdpl2xsZ7LrlayO7E8SOv+JJUEK17B/dJIHAOLMfh2dZZ/Y18WgmGtYNw==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=6.11.5"
+      }
+    },
+    "node_modules/locate-path": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-5.0.0.tgz",
+      "integrity": "sha512-t7hw9pI+WvuwNJXwk5zVHpyhIqzg2qTlklJOf0mVxGSbe3Fp2VieZcduNYjaLDoy6p9uGpQEGWG87WpMKlNq8g==",
+      "dev": true,
+      "dependencies": {
+        "p-locate": "^4.1.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/merge-stream": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/merge-stream/-/merge-stream-2.0.0.tgz",
+      "integrity": "sha512-abv/qOcuPfk3URPfDzmZU1LKmuw8kT+0nIHvKrKgFrwifol/doWcdA4ZqsWQ8ENrFKkd67Mfpo/LovbIUsbt3w==",
+      "dev": true
+    },
+    "node_modules/mime-db": {
+      "version": "1.52.0",
+      "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.52.0.tgz",
+      "integrity": "sha512-sPU4uV7dYlvtWJxwwxHD0PuihVNiE7TyAbQ5SWxDCB9mUYvOgroQOwYQQOKPJ8CIbE+1ETVlOoK1UC2nU3gYvg==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/mime-types": {
+      "version": "2.1.35",
+      "resolved": "https://registry.npmjs.org/mime-types/-/mime-types-2.1.35.tgz",
+      "integrity": "sha512-ZDY+bPm5zTTF+YpCrAU9nK0UgICYPT0QtT1NZWFv4s++TNkcgVaT0g6+4R2uI4MjQjzysHB1zxuWL50hzaeXiw==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "mime-db": "1.52.0"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/mimic-fn": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/mimic-fn/-/mimic-fn-2.1.0.tgz",
+      "integrity": "sha512-OqbOk5oEQeAZ8WXWydlu9HJjz9WVdEIvamMCcXmuqUYjTknH/sqsWvhQ3vgwKFRR1HpjvNBKQ37nbJgYzGqGcg==",
+      "dev": true,
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/neo-async": {
+      "version": "2.6.2",
+      "resolved": "https://registry.npmjs.org/neo-async/-/neo-async-2.6.2.tgz",
+      "integrity": "sha512-Yd3UES5mWCSqR+qNT93S3UoYUkqAZ9lLg8a7g9rimsWmYGK8cVToA4/sF3RrshdyV3sAGMXVUmpMYOw+dLpOuw==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/node-releases": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/node-releases/-/node-releases-2.0.2.tgz",
+      "integrity": "sha512-XxYDdcQ6eKqp/YjI+tb2C5WM2LgjnZrfYg4vgQt49EK268b6gYCHsBLrK2qvJo4FmCtqmKezb0WZFK4fkrZNsg==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/npm-run-path": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/npm-run-path/-/npm-run-path-4.0.1.tgz",
+      "integrity": "sha512-S48WzZW777zhNIrn7gxOlISNAqi9ZC/uQFnRdbeIHhZhCA6UqpkOT8T1G7BvfdgP4Er8gF4sUbaS0i7QvIfCWw==",
+      "dev": true,
+      "dependencies": {
+        "path-key": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/onetime": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmjs.org/onetime/-/onetime-5.1.2.tgz",
+      "integrity": "sha512-kbpaSSGJTWdAY5KPVeMOKXSrPtr8C8C7wodJbcsd51jRnmD+GZu8Y0VoU6Dm5Z4vWr0Ig/1NKuWRKf7j5aaYSg==",
+      "dev": true,
+      "dependencies": {
+        "mimic-fn": "^2.1.0"
+      },
+      "engines": {
+        "node": ">=6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/p-limit": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmjs.org/p-limit/-/p-limit-2.3.0.tgz",
+      "integrity": "sha512-//88mFWSJx8lxCzwdAABTJL2MyWB12+eIY7MDL2SqLmAkeKU9qxRvWuSyTjm3FUmpBEMuFfckAIqEaVGUDxb6w==",
+      "dev": true,
+      "dependencies": {
+        "p-try": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/p-locate": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-4.1.0.tgz",
+      "integrity": "sha512-R79ZZ/0wAxKGu3oYMlz8jy/kbhsNrS7SKZ7PxEHBgJ5+F2mtFW2fK2cOtBh1cHYkQsbzFV7I+EoRKe6Yt0oK7A==",
+      "dev": true,
+      "dependencies": {
+        "p-limit": "^2.2.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/p-try": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/p-try/-/p-try-2.2.0.tgz",
+      "integrity": "sha512-R4nPAVTAU0B9D35/Gk3uJf/7XYbQcyohSKdvAxIRSNghFl4e71hVoGnBNQz9cWaXxO2I10KTC+3jMdvvoKw6dQ==",
+      "dev": true,
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/path-exists": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-4.0.0.tgz",
+      "integrity": "sha512-ak9Qy5Q7jYb2Wwcey5Fpvg2KoAc/ZIhLSLOSBmRmygPsGwkVVt0fZa0qrtMz+m6tJTAHfZQ8FnmB4MG4LWy7/w==",
+      "dev": true,
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/path-key": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/path-key/-/path-key-3.1.1.tgz",
+      "integrity": "sha512-ojmeN0qd+y0jszEtoY48r0Peq5dwMEkIlCOu6Q5f41lfkswXuKtYrhgoTpLnyIcHm24Uhqx+5Tqm2InSwLhE6Q==",
+      "dev": true,
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/path-parse": {
+      "version": "1.0.7",
+      "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.7.tgz",
+      "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==",
+      "dev": true
+    },
+    "node_modules/picocolors": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.0.0.tgz",
+      "integrity": "sha512-1fygroTLlHu66zi26VoTDv8yRgm0Fccecssto+MhsZ0D/DGW2sm8E8AjW7NU5VVTRt5GxbeZ5qBuJr+HyLYkjQ==",
+      "dev": true,
+      "peer": true
+    },
+    "node_modules/pkg-dir": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/pkg-dir/-/pkg-dir-4.2.0.tgz",
+      "integrity": "sha512-HRDzbaKjC+AOWVXxAU/x54COGeIv9eb+6CkDSQoNTt4XyWoIJvuPsXizxu/Fr23EiekbtZwmh1IcIG/l/a10GQ==",
+      "dev": true,
+      "dependencies": {
+        "find-up": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/punycode": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/punycode/-/punycode-2.1.1.tgz",
+      "integrity": "sha512-XRsRjdf+j5ml+y/6GKHPZbrF/8p2Yga0JPtdqTIY2Xe5ohJPD9saDJJLPvp9+NSBprVvevdXZybnj2cv8OEd0A==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/randombytes": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/randombytes/-/randombytes-2.1.0.tgz",
+      "integrity": "sha512-vYl3iOX+4CKUWuxGi9Ukhie6fsqXqS9FE2Zaic4tNFD2N2QQaXOMFbuKK4QmDHC0JO6B1Zp41J0LpT0oR68amQ==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "safe-buffer": "^5.1.0"
+      }
+    },
+    "node_modules/rechoir": {
+      "version": "0.7.1",
+      "resolved": "https://registry.npmjs.org/rechoir/-/rechoir-0.7.1.tgz",
+      "integrity": "sha512-/njmZ8s1wVeR6pjTZ+0nCnv8SpZNRMT2D1RLOJQESlYFDBvwpTA4KWJpZ+sBJ4+vhjILRcK7JIFdGCdxEAAitg==",
+      "dev": true,
+      "dependencies": {
+        "resolve": "^1.9.0"
+      },
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/resolve": {
+      "version": "1.22.0",
+      "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.22.0.tgz",
+      "integrity": "sha512-Hhtrw0nLeSrFQ7phPp4OOcVjLPIeMnRlr5mcnVuMe7M/7eBn98A3hmFRLoFo3DLZkivSYwhRUJTyPyWAk56WLw==",
+      "dev": true,
+      "dependencies": {
+        "is-core-module": "^2.8.1",
+        "path-parse": "^1.0.7",
+        "supports-preserve-symlinks-flag": "^1.0.0"
+      },
+      "bin": {
+        "resolve": "bin/resolve"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/resolve-cwd": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/resolve-cwd/-/resolve-cwd-3.0.0.tgz",
+      "integrity": "sha512-OrZaX2Mb+rJCpH/6CpSqt9xFVpN++x01XnN2ie9g6P5/3xelLAkXWVADpdz1IHD/KFfEXyE6V0U01OQ3UO2rEg==",
+      "dev": true,
+      "dependencies": {
+        "resolve-from": "^5.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/resolve-from": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/resolve-from/-/resolve-from-5.0.0.tgz",
+      "integrity": "sha512-qYg9KP24dD5qka9J47d0aVky0N+b4fTU89LN9iDnjB5waksiC49rvMB0PrUJQGoTmH50XPiqOvAjDfaijGxYZw==",
+      "dev": true,
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/safe-buffer": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.2.1.tgz",
+      "integrity": "sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/feross"
+        },
+        {
+          "type": "patreon",
+          "url": "https://www.patreon.com/feross"
+        },
+        {
+          "type": "consulting",
+          "url": "https://feross.org/support"
+        }
+      ],
+      "peer": true
+    },
+    "node_modules/schema-utils": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.1.1.tgz",
+      "integrity": "sha512-Y5PQxS4ITlC+EahLuXaY86TXfR7Dc5lw294alXOq86JAHCihAIZfqv8nNCWvaEJvaC51uN9hbLGeV0cFBdH+Fw==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@types/json-schema": "^7.0.8",
+        "ajv": "^6.12.5",
+        "ajv-keywords": "^3.5.2"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
+    "node_modules/serialize-javascript": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-6.0.0.tgz",
+      "integrity": "sha512-Qr3TosvguFt8ePWqsvRfrKyQXIiW+nGbYpy8XK24NQHE83caxWt+mIymTT19DGFbNWNLfEwsrkSmN64lVWB9ag==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "randombytes": "^2.1.0"
+      }
+    },
+    "node_modules/shallow-clone": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/shallow-clone/-/shallow-clone-3.0.1.tgz",
+      "integrity": "sha512-/6KqX+GVUdqPuPPd2LxDDxzX6CAbjJehAAOKlNpqqUpAqPM6HeL8f+o3a+JsyGjn2lv0WY8UsTgUJjU9Ok55NA==",
+      "dev": true,
+      "dependencies": {
+        "kind-of": "^6.0.2"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/shebang-command": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/shebang-command/-/shebang-command-2.0.0.tgz",
+      "integrity": "sha512-kHxr2zZpYtdmrN1qDjrrX/Z1rR1kG8Dx+gkpK1G4eXmvXswmcE1hTWBWYUzlraYw1/yZp6YuDY77YtvbN0dmDA==",
+      "dev": true,
+      "dependencies": {
+        "shebang-regex": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/shebang-regex": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/shebang-regex/-/shebang-regex-3.0.0.tgz",
+      "integrity": "sha512-7++dFhtcx3353uBaq8DDR4NuxBetBzC7ZQOhmTQInHEd6bSrXdiEyzCvG07Z44UYdLShWUyXt5M/yhz8ekcb1A==",
+      "dev": true,
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/signal-exit": {
+      "version": "3.0.7",
+      "resolved": "https://registry.npmjs.org/signal-exit/-/signal-exit-3.0.7.tgz",
+      "integrity": "sha512-wnD2ZE+l+SPC/uoS0vXeE9L1+0wuaMqKlfz9AMUo38JsyLSBWSFcHR1Rri62LZc12vLr1gb3jl7iwQhgwpAbGQ==",
+      "dev": true
+    },
+    "node_modules/source-map": {
+      "version": "0.6.1",
+      "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.6.1.tgz",
+      "integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/source-map-support": {
+      "version": "0.5.21",
+      "resolved": "https://registry.npmjs.org/source-map-support/-/source-map-support-0.5.21.tgz",
+      "integrity": "sha512-uBHU3L3czsIyYXKX88fdrGovxdSCoTGDRZ6SYXtSRxLZUzHg5P/66Ht6uoUlHu9EZod+inXhKo3qQgwXUT/y1w==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "buffer-from": "^1.0.0",
+        "source-map": "^0.6.0"
+      }
+    },
+    "node_modules/strip-final-newline": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/strip-final-newline/-/strip-final-newline-2.0.0.tgz",
+      "integrity": "sha512-BrpvfNAE3dcvq7ll3xVumzjKjZQ5tI1sEUIKr3Uoks0XUl45St3FlatVqef9prk4jRDzhW6WZg+3bk93y6pLjA==",
+      "dev": true,
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/supports-color": {
+      "version": "8.1.1",
+      "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-8.1.1.tgz",
+      "integrity": "sha512-MpUEN2OodtUzxvKQl72cUF7RQ5EiHsGvSsVG0ia9c5RbWGL2CI4C7EpPS8UTBIplnlzZiNuV56w+FuNxy3ty2Q==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "has-flag": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/supports-color?sponsor=1"
+      }
+    },
+    "node_modules/supports-preserve-symlinks-flag": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/supports-preserve-symlinks-flag/-/supports-preserve-symlinks-flag-1.0.0.tgz",
+      "integrity": "sha512-ot0WnXS9fgdkgIcePe6RHNk1WA8+muPa6cSjeR3V8K27q9BB1rTE3R1p7Hv0z1ZyAc8s6Vvv8DIyWf681MAt0w==",
+      "dev": true,
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/tapable": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmjs.org/tapable/-/tapable-2.2.1.tgz",
+      "integrity": "sha512-GNzQvQTOIP6RyTfE2Qxb8ZVlNmw0n88vp1szwWRimP02mnTsx3Wtn5qRdqY9w2XduFNUgvOwhNnQsjwCp+kqaQ==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/terser": {
+      "version": "5.12.1",
+      "resolved": "https://registry.npmjs.org/terser/-/terser-5.12.1.tgz",
+      "integrity": "sha512-NXbs+7nisos5E+yXwAD+y7zrcTkMqb0dEJxIGtSKPdCBzopf7ni4odPul2aechpV7EXNvOudYOX2bb5tln1jbQ==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "acorn": "^8.5.0",
+        "commander": "^2.20.0",
+        "source-map": "~0.7.2",
+        "source-map-support": "~0.5.20"
+      },
+      "bin": {
+        "terser": "bin/terser"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/terser-webpack-plugin": {
+      "version": "5.3.1",
+      "resolved": "https://registry.npmjs.org/terser-webpack-plugin/-/terser-webpack-plugin-5.3.1.tgz",
+      "integrity": "sha512-GvlZdT6wPQKbDNW/GDQzZFg/j4vKU96yl2q6mcUkzKOgW4gwf1Z8cZToUCrz31XHlPWH8MVb1r2tFtdDtTGJ7g==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "jest-worker": "^27.4.5",
+        "schema-utils": "^3.1.1",
+        "serialize-javascript": "^6.0.0",
+        "source-map": "^0.6.1",
+        "terser": "^5.7.2"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^5.1.0"
+      },
+      "peerDependenciesMeta": {
+        "@swc/core": {
+          "optional": true
+        },
+        "esbuild": {
+          "optional": true
+        },
+        "uglify-js": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/terser/node_modules/source-map": {
+      "version": "0.7.3",
+      "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.7.3.tgz",
+      "integrity": "sha512-CkCj6giN3S+n9qrYiBTX5gystlENnRW5jZeNLHpe6aue+SrHcG5VYwujhW9s4dY31mEGsxBDrHR6oI69fTXsaQ==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/uri-js": {
+      "version": "4.4.1",
+      "resolved": "https://registry.npmjs.org/uri-js/-/uri-js-4.4.1.tgz",
+      "integrity": "sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "punycode": "^2.1.0"
+      }
+    },
+    "node_modules/watchpack": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.3.1.tgz",
+      "integrity": "sha512-x0t0JuydIo8qCNctdDrn1OzH/qDzk2+rdCOC3YzumZ42fiMqmQ7T3xQurykYMhYfHaPHTp4ZxAx2NfUo1K6QaA==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "glob-to-regexp": "^0.4.1",
+        "graceful-fs": "^4.1.2"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/webpack": {
+      "version": "5.70.0",
+      "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.70.0.tgz",
+      "integrity": "sha512-ZMWWy8CeuTTjCxbeaQI21xSswseF2oNOwc70QSKNePvmxE7XW36i7vpBMYZFAUHPwQiEbNGCEYIOOlyRbdGmxw==",
+      "dev": true,
+      "peer": true,
+      "dependencies": {
+        "@types/eslint-scope": "^3.7.3",
+        "@types/estree": "^0.0.51",
+        "@webassemblyjs/ast": "1.11.1",
+        "@webassemblyjs/wasm-edit": "1.11.1",
+        "@webassemblyjs/wasm-parser": "1.11.1",
+        "acorn": "^8.4.1",
+        "acorn-import-assertions": "^1.7.6",
+        "browserslist": "^4.14.5",
+        "chrome-trace-event": "^1.0.2",
+        "enhanced-resolve": "^5.9.2",
+        "es-module-lexer": "^0.9.0",
+        "eslint-scope": "5.1.1",
+        "events": "^3.2.0",
+        "glob-to-regexp": "^0.4.1",
+        "graceful-fs": "^4.2.9",
+        "json-parse-better-errors": "^1.0.2",
+        "loader-runner": "^4.2.0",
+        "mime-types": "^2.1.27",
+        "neo-async": "^2.6.2",
+        "schema-utils": "^3.1.0",
+        "tapable": "^2.1.1",
+        "terser-webpack-plugin": "^5.1.3",
+        "watchpack": "^2.3.1",
+        "webpack-sources": "^3.2.3"
+      },
+      "bin": {
+        "webpack": "bin/webpack.js"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependenciesMeta": {
+        "webpack-cli": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/webpack-cli": {
+      "version": "4.9.2",
+      "resolved": "https://registry.npmjs.org/webpack-cli/-/webpack-cli-4.9.2.tgz",
+      "integrity": "sha512-m3/AACnBBzK/kMTcxWHcZFPrw/eQuY4Df1TxvIWfWM2x7mRqBQCqKEd96oCUa9jkapLBaFfRce33eGDb4Pr7YQ==",
+      "dev": true,
+      "dependencies": {
+        "@discoveryjs/json-ext": "^0.5.0",
+        "@webpack-cli/configtest": "^1.1.1",
+        "@webpack-cli/info": "^1.4.1",
+        "@webpack-cli/serve": "^1.6.1",
+        "colorette": "^2.0.14",
+        "commander": "^7.0.0",
+        "execa": "^5.0.0",
+        "fastest-levenshtein": "^1.0.12",
+        "import-local": "^3.0.2",
+        "interpret": "^2.2.0",
+        "rechoir": "^0.7.0",
+        "webpack-merge": "^5.7.3"
+      },
+      "bin": {
+        "webpack-cli": "bin/cli.js"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      },
+      "peerDependencies": {
+        "webpack": "4.x.x || 5.x.x"
+      },
+      "peerDependenciesMeta": {
+        "@webpack-cli/generators": {
+          "optional": true
+        },
+        "@webpack-cli/migrate": {
+          "optional": true
+        },
+        "webpack-bundle-analyzer": {
+          "optional": true
+        },
+        "webpack-dev-server": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/webpack-cli/node_modules/commander": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmjs.org/commander/-/commander-7.2.0.tgz",
+      "integrity": "sha512-QrWXB+ZQSVPmIWIhtEO9H+gwHaMGYiF5ChvoJ+K9ZGHG/sVsa6yiesAD1GC/x46sET00Xlwo1u49RVVVzvcSkw==",
+      "dev": true,
+      "engines": {
+        "node": ">= 10"
+      }
+    },
+    "node_modules/webpack-merge": {
+      "version": "5.8.0",
+      "resolved": "https://registry.npmjs.org/webpack-merge/-/webpack-merge-5.8.0.tgz",
+      "integrity": "sha512-/SaI7xY0831XwP6kzuwhKWVKDP9t1QY1h65lAFLbZqMPIuYcD9QAW4u9STIbU9kaJbPBB/geU/gLr1wDjOhQ+Q==",
+      "dev": true,
+      "dependencies": {
+        "clone-deep": "^4.0.1",
+        "wildcard": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=10.0.0"
+      }
+    },
+    "node_modules/webpack-sources": {
+      "version": "3.2.3",
+      "resolved": "https://registry.npmjs.org/webpack-sources/-/webpack-sources-3.2.3.tgz",
+      "integrity": "sha512-/DyMEOrDgLKKIG0fmvtz+4dUX/3Ghozwgm6iPp8KRhvn+eQf9+Q7GWxVNMk3+uCPWfdXYC4ExGBckIXdFEfH1w==",
+      "dev": true,
+      "peer": true,
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/which": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/which/-/which-2.0.2.tgz",
+      "integrity": "sha512-BLI3Tl1TW3Pvl70l3yq3Y64i+awpwXqsGBYWkkqMtnbXgrMD+yj7rhW0kuEDxzJaYXGjEW5ogapKNMEKNMjibA==",
+      "dev": true,
+      "dependencies": {
+        "isexe": "^2.0.0"
+      },
+      "bin": {
+        "node-which": "bin/node-which"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/wildcard": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/wildcard/-/wildcard-2.0.0.tgz",
+      "integrity": "sha512-JcKqAHLPxcdb9KM49dufGXn2x3ssnfjbcaQdLlfZsL9rH9wgDQjUtDxbo8NE0F6SFvydeu1VhZe7hZuHsB2/pw==",
+      "dev": true
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/LICENSE b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/LICENSE
new file mode 100644
index 0000000..44f551a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 Roman Dvornov <rdvornov@gmail.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/README.md b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/README.md
new file mode 100644
index 0000000..f155a9d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/README.md
@@ -0,0 +1,256 @@
+# json-ext
+
+[![NPM version](https://img.shields.io/npm/v/@discoveryjs/json-ext.svg)](https://www.npmjs.com/package/@discoveryjs/json-ext)
+[![Build Status](https://github.com/discoveryjs/json-ext/actions/workflows/ci.yml/badge.svg)](https://github.com/discoveryjs/json-ext/actions/workflows/ci.yml)
+[![Coverage Status](https://coveralls.io/repos/github/discoveryjs/json-ext/badge.svg?branch=master)](https://coveralls.io/github/discoveryjs/json-ext?)
+[![NPM Downloads](https://img.shields.io/npm/dm/@discoveryjs/json-ext.svg)](https://www.npmjs.com/package/@discoveryjs/json-ext)
+
+A set of utilities that extend the use of JSON. Designed to be fast and memory efficient
+
+Features:
+
+- [x] `parseChunked()` – Parse JSON that comes by chunks (e.g. FS readable stream or fetch response stream)
+- [x] `stringifyStream()` – Stringify stream (Node.js)
+- [x] `stringifyInfo()` – Get estimated size and other facts of JSON.stringify() without converting a value to string
+- [ ] **TBD** Support for circular references
+- [ ] **TBD** Binary representation [branch](https://github.com/discoveryjs/json-ext/tree/binary)
+- [ ] **TBD** WHATWG [Streams](https://streams.spec.whatwg.org/) support
+
+## Install
+
+```bash
+npm install @discoveryjs/json-ext
+```
+
+## API
+
+- [parseChunked(chunkEmitter)](#parsechunkedchunkemitter)
+- [stringifyStream(value[, replacer[, space]])](#stringifystreamvalue-replacer-space)
+- [stringifyInfo(value[, replacer[, space[, options]]])](#stringifyinfovalue-replacer-space-options)
+    - [Options](#options)
+        - [async](#async)
+        - [continueOnCircular](#continueoncircular)
+- [version](#version)
+
+### parseChunked(chunkEmitter)
+
+Works the same as [`JSON.parse()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/parse) but takes `chunkEmitter` instead of string and returns [Promise](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise).
+
+> NOTE: `reviver` parameter is not supported yet, but will be added in next releases.
+> NOTE: WHATWG streams aren't supported yet
+
+When to use:
+- It's required to avoid freezing the main thread during big JSON parsing, since this process can be distributed in time
+- Huge JSON needs to be parsed (e.g. >500MB on Node.js)
+- Needed to reduce memory pressure. `JSON.parse()` needs to receive the entire JSON before parsing it. With `parseChunked()` you may parse JSON as first bytes of it comes. This approach helps to avoid storing a huge string in the memory at a single time point and following GC.
+
+[Benchmark](https://github.com/discoveryjs/json-ext/tree/master/benchmarks#parse-chunked)
+
+Usage:
+
+```js
+const { parseChunked } = require('@discoveryjs/json-ext');
+
+// as a regular Promise
+parseChunked(chunkEmitter)
+    .then(data => {
+        /* data is parsed JSON */
+    });
+
+// using await (keep in mind that not every runtime has a support for top level await)
+const data = await parseChunked(chunkEmitter);
+```
+
+Parameter `chunkEmitter` can be:
+- [`ReadableStream`](https://nodejs.org/dist/latest-v14.x/docs/api/stream.html#stream_readable_streams) (Node.js only)
+```js
+const fs = require('fs');
+const { parseChunked } = require('@discoveryjs/json-ext');
+
+parseChunked(fs.createReadStream('path/to/file.json'))
+```
+- Generator, async generator or function that returns iterable (chunks). Chunk might be a `string`, `Uint8Array` or `Buffer` (Node.js only):
+```js
+const { parseChunked } = require('@discoveryjs/json-ext');
+const encoder = new TextEncoder();
+
+// generator
+parseChunked(function*() {
+    yield '{ "hello":';
+    yield Buffer.from(' "wor');    // Node.js only
+    yield encoder.encode('ld" }'); // returns Uint8Array(5) [ 108, 100, 34, 32, 125 ]
+});
+
+// async generator
+parseChunked(async function*() {
+    for await (const chunk of someAsyncSource) {
+        yield chunk;
+    }
+});
+
+// function that returns iterable
+parseChunked(() => ['{ "hello":', ' "world"}'])
+```
+
+Using with [fetch()](https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API):
+
+```js
+async function loadData(url) {
+    const response = await fetch(url);
+    const reader = response.body.getReader();
+
+    return parseChunked(async function*() {
+        while (true) {
+            const { done, value } = await reader.read();
+
+            if (done) {
+                break;
+            }
+
+            yield value;
+        }
+    });
+}
+
+loadData('https://example.com/data.json')
+    .then(data => {
+        /* data is parsed JSON */
+    })
+```
+
+### stringifyStream(value[, replacer[, space]])
+
+Works the same as [`JSON.stringify()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify), but returns an instance of [`ReadableStream`](https://nodejs.org/dist/latest-v14.x/docs/api/stream.html#stream_readable_streams) instead of string.
+
+> NOTE: WHATWG Streams aren't supported yet, so function available for Node.js only for now
+
+Departs from JSON.stringify():
+- Outputs `null` when `JSON.stringify()` returns `undefined` (since streams may not emit `undefined`)
+- A promise is resolving and the resulting value is stringifying as a regular one
+- A stream in non-object mode is piping to output as is
+- A stream in object mode is piping to output as an array of objects
+
+When to use:
+- Huge JSON needs to be generated (e.g. >500MB on Node.js)
+- Needed to reduce memory pressure. `JSON.stringify()` needs to generate the entire JSON before send or write it to somewhere. With `stringifyStream()` you may send a result to somewhere as first bytes of the result appears. This approach helps to avoid storing a huge string in the memory at a single time point.
+- The object being serialized contains Promises or Streams (see Usage for examples)
+
+[Benchmark](https://github.com/discoveryjs/json-ext/tree/master/benchmarks#stream-stringifying)
+
+Usage:
+
+```js
+const { stringifyStream } = require('@discoveryjs/json-ext');
+
+// handle events
+stringifyStream(data)
+    .on('data', chunk => console.log(chunk))
+    .on('error', error => consold.error(error))
+    .on('finish', () => console.log('DONE!'));
+
+// pipe into a stream
+stringifyStream(data)
+    .pipe(writableStream);
+```
+
+Using Promise or ReadableStream in serializing object:
+
+```js
+const fs = require('fs');
+const { stringifyStream } = require('@discoveryjs/json-ext');
+
+// output will be
+// {"name":"example","willSerializeResolvedValue":42,"fromFile":[1, 2, 3],"at":{"any":{"level":"promise!"}}}
+stringifyStream({
+    name: 'example',
+    willSerializeResolvedValue: Promise.resolve(42),
+    fromFile: fs.createReadStream('path/to/file.json'), // support file content is "[1, 2, 3]", it'll be inserted as it
+    at: {
+        any: {
+            level: new Promise(resolve => setTimeout(() => resolve('promise!'), 100))
+        }
+    }
+})
+
+// in case several async requests are used in object, it's prefered
+// to put fastest requests first, because in this case
+stringifyStream({
+    foo: fetch('http://example.com/request_takes_2s').then(req => req.json()),
+    bar: fetch('http://example.com/request_takes_5s').then(req => req.json())
+});
+```
+
+Using with [`WritableStream`](https://nodejs.org/dist/latest-v14.x/docs/api/stream.html#stream_writable_streams) (Node.js only):
+
+```js
+const fs = require('fs');
+const { stringifyStream } = require('@discoveryjs/json-ext');
+
+// pipe into a console
+stringifyStream(data)
+    .pipe(process.stdout);
+
+// pipe into a file
+stringifyStream(data)
+    .pipe(fs.createWriteStream('path/to/file.json'));
+
+// wrapping into a Promise
+new Promise((resolve, reject) => {
+    stringifyStream(data)
+        .on('error', reject)
+        .pipe(stream)
+        .on('error', reject)
+        .on('finish', resolve);
+});
+```
+
+### stringifyInfo(value[, replacer[, space[, options]]])
+
+`value`, `replacer` and `space` arguments are the same as for `JSON.stringify()`.
+
+Result is an object:
+
+```js
+{
+    minLength: Number,  // minimal bytes when values is stringified
+    circular: [...],    // list of circular references
+    duplicate: [...],   // list of objects that occur more than once
+    async: [...]        // list of async values, i.e. promises and streams
+}
+```
+
+Example:
+
+```js
+const { stringifyInfo } = require('@discoveryjs/json-ext');
+
+console.log(
+    stringifyInfo({ test: true }).minLength
+);
+// > 13
+// that equals '{"test":true}'.length
+```
+
+#### Options
+
+##### async
+
+Type: `Boolean`  
+Default: `false`
+
+Collect async values (promises and streams) or not.
+
+##### continueOnCircular
+
+Type: `Boolean`  
+Default: `false`
+
+Stop collecting info for a value or not whenever circular reference is found. Setting option to `true` allows to find all circular references.
+
+### version
+
+The version of library, e.g. `"0.3.1"`.
+
+## License
+
+MIT
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/json-ext.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/json-ext.js
new file mode 100644
index 0000000..298fbd4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/json-ext.js
@@ -0,0 +1,791 @@
+(function (global, factory) {
+    typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
+    typeof define === 'function' && define.amd ? define(factory) :
+    (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.jsonExt = factory());
+})(this, (function () { 'use strict';
+
+    var version = "0.5.7";
+
+    const PrimitiveType = 1;
+    const ObjectType = 2;
+    const ArrayType = 3;
+    const PromiseType = 4;
+    const ReadableStringType = 5;
+    const ReadableObjectType = 6;
+    // https://tc39.es/ecma262/#table-json-single-character-escapes
+    const escapableCharCodeSubstitution$1 = { // JSON Single Character Escape Sequences
+        0x08: '\\b',
+        0x09: '\\t',
+        0x0a: '\\n',
+        0x0c: '\\f',
+        0x0d: '\\r',
+        0x22: '\\\"',
+        0x5c: '\\\\'
+    };
+
+    function isLeadingSurrogate$1(code) {
+        return code >= 0xD800 && code <= 0xDBFF;
+    }
+
+    function isTrailingSurrogate$1(code) {
+        return code >= 0xDC00 && code <= 0xDFFF;
+    }
+
+    function isReadableStream$1(value) {
+        return (
+            typeof value.pipe === 'function' &&
+            typeof value._read === 'function' &&
+            typeof value._readableState === 'object' && value._readableState !== null
+        );
+    }
+
+    function replaceValue$1(holder, key, value, replacer) {
+        if (value && typeof value.toJSON === 'function') {
+            value = value.toJSON();
+        }
+
+        if (replacer !== null) {
+            value = replacer.call(holder, String(key), value);
+        }
+
+        switch (typeof value) {
+            case 'function':
+            case 'symbol':
+                value = undefined;
+                break;
+
+            case 'object':
+                if (value !== null) {
+                    const cls = value.constructor;
+                    if (cls === String || cls === Number || cls === Boolean) {
+                        value = value.valueOf();
+                    }
+                }
+                break;
+        }
+
+        return value;
+    }
+
+    function getTypeNative$1(value) {
+        if (value === null || typeof value !== 'object') {
+            return PrimitiveType;
+        }
+
+        if (Array.isArray(value)) {
+            return ArrayType;
+        }
+
+        return ObjectType;
+    }
+
+    function getTypeAsync$1(value) {
+        if (value === null || typeof value !== 'object') {
+            return PrimitiveType;
+        }
+
+        if (typeof value.then === 'function') {
+            return PromiseType;
+        }
+
+        if (isReadableStream$1(value)) {
+            return value._readableState.objectMode ? ReadableObjectType : ReadableStringType;
+        }
+
+        if (Array.isArray(value)) {
+            return ArrayType;
+        }
+
+        return ObjectType;
+    }
+
+    function normalizeReplacer$1(replacer) {
+        if (typeof replacer === 'function') {
+            return replacer;
+        }
+
+        if (Array.isArray(replacer)) {
+            const allowlist = new Set(replacer
+                .map(item => {
+                    const cls = item && item.constructor;
+                    return cls === String || cls === Number ? String(item) : null;
+                })
+                .filter(item => typeof item === 'string')
+            );
+
+            return [...allowlist];
+        }
+
+        return null;
+    }
+
+    function normalizeSpace$1(space) {
+        if (typeof space === 'number') {
+            if (!Number.isFinite(space) || space < 1) {
+                return false;
+            }
+
+            return ' '.repeat(Math.min(space, 10));
+        }
+
+        if (typeof space === 'string') {
+            return space.slice(0, 10) || false;
+        }
+
+        return false;
+    }
+
+    var utils = {
+        escapableCharCodeSubstitution: escapableCharCodeSubstitution$1,
+        isLeadingSurrogate: isLeadingSurrogate$1,
+        isTrailingSurrogate: isTrailingSurrogate$1,
+        type: {
+            PRIMITIVE: PrimitiveType,
+            PROMISE: PromiseType,
+            ARRAY: ArrayType,
+            OBJECT: ObjectType,
+            STRING_STREAM: ReadableStringType,
+            OBJECT_STREAM: ReadableObjectType
+        },
+
+        isReadableStream: isReadableStream$1,
+        replaceValue: replaceValue$1,
+        getTypeNative: getTypeNative$1,
+        getTypeAsync: getTypeAsync$1,
+        normalizeReplacer: normalizeReplacer$1,
+        normalizeSpace: normalizeSpace$1
+    };
+
+    const {
+        normalizeReplacer,
+        normalizeSpace,
+        replaceValue,
+        getTypeNative,
+        getTypeAsync,
+        isLeadingSurrogate,
+        isTrailingSurrogate,
+        escapableCharCodeSubstitution,
+        type: {
+            PRIMITIVE,
+            OBJECT,
+            ARRAY,
+            PROMISE,
+            STRING_STREAM,
+            OBJECT_STREAM
+        }
+    } = utils;
+    const charLength2048 = Array.from({ length: 2048 }).map((_, code) => {
+        if (escapableCharCodeSubstitution.hasOwnProperty(code)) {
+            return 2; // \X
+        }
+
+        if (code < 0x20) {
+            return 6; // \uXXXX
+        }
+
+        return code < 128 ? 1 : 2; // UTF8 bytes
+    });
+
+    function stringLength(str) {
+        let len = 0;
+        let prevLeadingSurrogate = false;
+
+        for (let i = 0; i < str.length; i++) {
+            const code = str.charCodeAt(i);
+
+            if (code < 2048) {
+                len += charLength2048[code];
+            } else if (isLeadingSurrogate(code)) {
+                len += 6; // \uXXXX since no pair with trailing surrogate yet
+                prevLeadingSurrogate = true;
+                continue;
+            } else if (isTrailingSurrogate(code)) {
+                len = prevLeadingSurrogate
+                    ? len - 2  // surrogate pair (4 bytes), since we calculate prev leading surrogate as 6 bytes, substruct 2 bytes
+                    : len + 6; // \uXXXX
+            } else {
+                len += 3; // code >= 2048 is 3 bytes length for UTF8
+            }
+
+            prevLeadingSurrogate = false;
+        }
+
+        return len + 2; // +2 for quotes
+    }
+
+    function primitiveLength(value) {
+        switch (typeof value) {
+            case 'string':
+                return stringLength(value);
+
+            case 'number':
+                return Number.isFinite(value) ? String(value).length : 4 /* null */;
+
+            case 'boolean':
+                return value ? 4 /* true */ : 5 /* false */;
+
+            case 'undefined':
+            case 'object':
+                return 4; /* null */
+
+            default:
+                return 0;
+        }
+    }
+
+    function spaceLength(space) {
+        space = normalizeSpace(space);
+        return typeof space === 'string' ? space.length : 0;
+    }
+
+    var stringifyInfo = function jsonStringifyInfo(value, replacer, space, options) {
+        function walk(holder, key, value) {
+            if (stop) {
+                return;
+            }
+
+            value = replaceValue(holder, key, value, replacer);
+
+            let type = getType(value);
+
+            // check for circular structure
+            if (type !== PRIMITIVE && stack.has(value)) {
+                circular.add(value);
+                length += 4; // treat as null
+
+                if (!options.continueOnCircular) {
+                    stop = true;
+                }
+
+                return;
+            }
+
+            switch (type) {
+                case PRIMITIVE:
+                    if (value !== undefined || Array.isArray(holder)) {
+                        length += primitiveLength(value);
+                    } else if (holder === root) {
+                        length += 9; // FIXME: that's the length of undefined, should we normalize behaviour to convert it to null?
+                    }
+                    break;
+
+                case OBJECT: {
+                    if (visited.has(value)) {
+                        duplicate.add(value);
+                        length += visited.get(value);
+                        break;
+                    }
+
+                    const valueLength = length;
+                    let entries = 0;
+
+                    length += 2; // {}
+
+                    stack.add(value);
+
+                    for (const key in value) {
+                        if (hasOwnProperty.call(value, key) && (allowlist === null || allowlist.has(key))) {
+                            const prevLength = length;
+                            walk(value, key, value[key]);
+
+                            if (prevLength !== length) {
+                                // value is printed
+                                length += stringLength(key) + 1; // "key":
+                                entries++;
+                            }
+                        }
+                    }
+
+                    if (entries > 1) {
+                        length += entries - 1; // commas
+                    }
+
+                    stack.delete(value);
+
+                    if (space > 0 && entries > 0) {
+                        length += (1 + (stack.size + 1) * space + 1) * entries; // for each key-value: \n{space}
+                        length += 1 + stack.size * space; // for }
+                    }
+
+                    visited.set(value, length - valueLength);
+
+                    break;
+                }
+
+                case ARRAY: {
+                    if (visited.has(value)) {
+                        duplicate.add(value);
+                        length += visited.get(value);
+                        break;
+                    }
+
+                    const valueLength = length;
+
+                    length += 2; // []
+
+                    stack.add(value);
+
+                    for (let i = 0; i < value.length; i++) {
+                        walk(value, i, value[i]);
+                    }
+
+                    if (value.length > 1) {
+                        length += value.length - 1; // commas
+                    }
+
+                    stack.delete(value);
+
+                    if (space > 0 && value.length > 0) {
+                        length += (1 + (stack.size + 1) * space) * value.length; // for each element: \n{space}
+                        length += 1 + stack.size * space; // for ]
+                    }
+
+                    visited.set(value, length - valueLength);
+
+                    break;
+                }
+
+                case PROMISE:
+                case STRING_STREAM:
+                    async.add(value);
+                    break;
+
+                case OBJECT_STREAM:
+                    length += 2; // []
+                    async.add(value);
+                    break;
+            }
+        }
+
+        let allowlist = null;
+        replacer = normalizeReplacer(replacer);
+
+        if (Array.isArray(replacer)) {
+            allowlist = new Set(replacer);
+            replacer = null;
+        }
+
+        space = spaceLength(space);
+        options = options || {};
+
+        const visited = new Map();
+        const stack = new Set();
+        const duplicate = new Set();
+        const circular = new Set();
+        const async = new Set();
+        const getType = options.async ? getTypeAsync : getTypeNative;
+        const root = { '': value };
+        let stop = false;
+        let length = 0;
+
+        walk(root, '', value);
+
+        return {
+            minLength: isNaN(length) ? Infinity : length,
+            circular: [...circular],
+            duplicate: [...duplicate],
+            async: [...async]
+        };
+    };
+
+    var stringifyStreamBrowser = () => {
+        throw new Error('Method is not supported');
+    };
+
+    var textDecoderBrowser = TextDecoder;
+
+    const { isReadableStream } = utils;
+
+
+    const STACK_OBJECT = 1;
+    const STACK_ARRAY = 2;
+    const decoder = new textDecoderBrowser();
+
+    function isObject(value) {
+        return value !== null && typeof value === 'object';
+    }
+
+    function adjustPosition(error, parser) {
+        if (error.name === 'SyntaxError' && parser.jsonParseOffset) {
+            error.message = error.message.replace(/at position (\d+)/, (_, pos) =>
+                'at position ' + (Number(pos) + parser.jsonParseOffset)
+            );
+        }
+
+        return error;
+    }
+
+    function append(array, elements) {
+        // Note: Avoid to use array.push(...elements) since it may lead to
+        // "RangeError: Maximum call stack size exceeded" for a long arrays
+        const initialLength = array.length;
+        array.length += elements.length;
+
+        for (let i = 0; i < elements.length; i++) {
+            array[initialLength + i] = elements[i];
+        }
+    }
+
+    var parseChunked = function(chunkEmitter) {
+        let parser = new ChunkParser();
+
+        if (isObject(chunkEmitter) && isReadableStream(chunkEmitter)) {
+            return new Promise((resolve, reject) => {
+                chunkEmitter
+                    .on('data', chunk => {
+                        try {
+                            parser.push(chunk);
+                        } catch (e) {
+                            reject(adjustPosition(e, parser));
+                            parser = null;
+                        }
+                    })
+                    .on('error', (e) => {
+                        parser = null;
+                        reject(e);
+                    })
+                    .on('end', () => {
+                        try {
+                            resolve(parser.finish());
+                        } catch (e) {
+                            reject(adjustPosition(e, parser));
+                        } finally {
+                            parser = null;
+                        }
+                    });
+            });
+        }
+
+        if (typeof chunkEmitter === 'function') {
+            const iterator = chunkEmitter();
+
+            if (isObject(iterator) && (Symbol.iterator in iterator || Symbol.asyncIterator in iterator)) {
+                return new Promise(async (resolve, reject) => {
+                    try {
+                        for await (const chunk of iterator) {
+                            parser.push(chunk);
+                        }
+
+                        resolve(parser.finish());
+                    } catch (e) {
+                        reject(adjustPosition(e, parser));
+                    } finally {
+                        parser = null;
+                    }
+                });
+            }
+        }
+
+        throw new Error(
+            'Chunk emitter should be readable stream, generator, ' +
+            'async generator or function returning an iterable object'
+        );
+    };
+
+    class ChunkParser {
+        constructor() {
+            this.value = undefined;
+            this.valueStack = null;
+
+            this.stack = new Array(100);
+            this.lastFlushDepth = 0;
+            this.flushDepth = 0;
+            this.stateString = false;
+            this.stateStringEscape = false;
+            this.pendingByteSeq = null;
+            this.pendingChunk = null;
+            this.chunkOffset = 0;
+            this.jsonParseOffset = 0;
+        }
+
+        parseAndAppend(fragment, wrap) {
+            // Append new entries or elements
+            if (this.stack[this.lastFlushDepth - 1] === STACK_OBJECT) {
+                if (wrap) {
+                    this.jsonParseOffset--;
+                    fragment = '{' + fragment + '}';
+                }
+
+                Object.assign(this.valueStack.value, JSON.parse(fragment));
+            } else {
+                if (wrap) {
+                    this.jsonParseOffset--;
+                    fragment = '[' + fragment + ']';
+                }
+
+                append(this.valueStack.value, JSON.parse(fragment));
+            }
+        }
+
+        prepareAddition(fragment) {
+            const { value } = this.valueStack;
+            const expectComma = Array.isArray(value)
+                ? value.length !== 0
+                : Object.keys(value).length !== 0;
+
+            if (expectComma) {
+                // Skip a comma at the beginning of fragment, otherwise it would
+                // fail to parse
+                if (fragment[0] === ',') {
+                    this.jsonParseOffset++;
+                    return fragment.slice(1);
+                }
+
+                // When value (an object or array) is not empty and a fragment
+                // doesn't start with a comma, a single valid fragment starting
+                // is a closing bracket. If it's not, a prefix is adding to fail
+                // parsing. Otherwise, the sequence of chunks can be successfully
+                // parsed, although it should not, e.g. ["[{}", "{}]"]
+                if (fragment[0] !== '}' && fragment[0] !== ']') {
+                    this.jsonParseOffset -= 3;
+                    return '[[]' + fragment;
+                }
+            }
+
+            return fragment;
+        }
+
+        flush(chunk, start, end) {
+            let fragment = chunk.slice(start, end);
+
+            // Save position correction an error in JSON.parse() if any
+            this.jsonParseOffset = this.chunkOffset + start;
+
+            // Prepend pending chunk if any
+            if (this.pendingChunk !== null) {
+                fragment = this.pendingChunk + fragment;
+                this.jsonParseOffset -= this.pendingChunk.length;
+                this.pendingChunk = null;
+            }
+
+            if (this.flushDepth === this.lastFlushDepth) {
+                // Depth didn't changed, so it's a root value or entry/element set
+                if (this.flushDepth > 0) {
+                    this.parseAndAppend(this.prepareAddition(fragment), true);
+                } else {
+                    // That's an entire value on a top level
+                    this.value = JSON.parse(fragment);
+                    this.valueStack = {
+                        value: this.value,
+                        prev: null
+                    };
+                }
+            } else if (this.flushDepth > this.lastFlushDepth) {
+                // Add missed closing brackets/parentheses
+                for (let i = this.flushDepth - 1; i >= this.lastFlushDepth; i--) {
+                    fragment += this.stack[i] === STACK_OBJECT ? '}' : ']';
+                }
+
+                if (this.lastFlushDepth === 0) {
+                    // That's a root value
+                    this.value = JSON.parse(fragment);
+                    this.valueStack = {
+                        value: this.value,
+                        prev: null
+                    };
+                } else {
+                    this.parseAndAppend(this.prepareAddition(fragment), true);
+                }
+
+                // Move down to the depths to the last object/array, which is current now
+                for (let i = this.lastFlushDepth || 1; i < this.flushDepth; i++) {
+                    let value = this.valueStack.value;
+
+                    if (this.stack[i - 1] === STACK_OBJECT) {
+                        // find last entry
+                        let key;
+                        // eslint-disable-next-line curly
+                        for (key in value);
+                        value = value[key];
+                    } else {
+                        // last element
+                        value = value[value.length - 1];
+                    }
+
+                    this.valueStack = {
+                        value,
+                        prev: this.valueStack
+                    };
+                }
+            } else /* this.flushDepth < this.lastFlushDepth */ {
+                fragment = this.prepareAddition(fragment);
+
+                // Add missed opening brackets/parentheses
+                for (let i = this.lastFlushDepth - 1; i >= this.flushDepth; i--) {
+                    this.jsonParseOffset--;
+                    fragment = (this.stack[i] === STACK_OBJECT ? '{' : '[') + fragment;
+                }
+
+                this.parseAndAppend(fragment, false);
+
+                for (let i = this.lastFlushDepth - 1; i >= this.flushDepth; i--) {
+                    this.valueStack = this.valueStack.prev;
+                }
+            }
+
+            this.lastFlushDepth = this.flushDepth;
+        }
+
+        push(chunk) {
+            if (typeof chunk !== 'string') {
+                // Suppose chunk is Buffer or Uint8Array
+
+                // Prepend uncompleted byte sequence if any
+                if (this.pendingByteSeq !== null) {
+                    const origRawChunk = chunk;
+                    chunk = new Uint8Array(this.pendingByteSeq.length + origRawChunk.length);
+                    chunk.set(this.pendingByteSeq);
+                    chunk.set(origRawChunk, this.pendingByteSeq.length);
+                    this.pendingByteSeq = null;
+                }
+
+                // In case Buffer/Uint8Array, an input is encoded in UTF8
+                // Seek for parts of uncompleted UTF8 symbol on the ending
+                // This makes sense only if we expect more chunks and last char is not multi-bytes
+                if (chunk[chunk.length - 1] > 127) {
+                    for (let seqLength = 0; seqLength < chunk.length; seqLength++) {
+                        const byte = chunk[chunk.length - 1 - seqLength];
+
+                        // 10xxxxxx - 2nd, 3rd or 4th byte
+                        // 110xxxxx – first byte of 2-byte sequence
+                        // 1110xxxx - first byte of 3-byte sequence
+                        // 11110xxx - first byte of 4-byte sequence
+                        if (byte >> 6 === 3) {
+                            seqLength++;
+
+                            // If the sequence is really incomplete, then preserve it
+                            // for the future chunk and cut off it from the current chunk
+                            if ((seqLength !== 4 && byte >> 3 === 0b11110) ||
+                                (seqLength !== 3 && byte >> 4 === 0b1110) ||
+                                (seqLength !== 2 && byte >> 5 === 0b110)) {
+                                this.pendingByteSeq = chunk.slice(chunk.length - seqLength);
+                                chunk = chunk.slice(0, -seqLength);
+                            }
+
+                            break;
+                        }
+                    }
+                }
+
+                // Convert chunk to a string, since single decode per chunk
+                // is much effective than decode multiple small substrings
+                chunk = decoder.decode(chunk);
+            }
+
+            const chunkLength = chunk.length;
+            let lastFlushPoint = 0;
+            let flushPoint = 0;
+
+            // Main scan loop
+            scan: for (let i = 0; i < chunkLength; i++) {
+                if (this.stateString) {
+                    for (; i < chunkLength; i++) {
+                        if (this.stateStringEscape) {
+                            this.stateStringEscape = false;
+                        } else {
+                            switch (chunk.charCodeAt(i)) {
+                                case 0x22: /* " */
+                                    this.stateString = false;
+                                    continue scan;
+
+                                case 0x5C: /* \ */
+                                    this.stateStringEscape = true;
+                            }
+                        }
+                    }
+
+                    break;
+                }
+
+                switch (chunk.charCodeAt(i)) {
+                    case 0x22: /* " */
+                        this.stateString = true;
+                        this.stateStringEscape = false;
+                        break;
+
+                    case 0x2C: /* , */
+                        flushPoint = i;
+                        break;
+
+                    case 0x7B: /* { */
+                        // Open an object
+                        flushPoint = i + 1;
+                        this.stack[this.flushDepth++] = STACK_OBJECT;
+                        break;
+
+                    case 0x5B: /* [ */
+                        // Open an array
+                        flushPoint = i + 1;
+                        this.stack[this.flushDepth++] = STACK_ARRAY;
+                        break;
+
+                    case 0x5D: /* ] */
+                    case 0x7D: /* } */
+                        // Close an object or array
+                        flushPoint = i + 1;
+                        this.flushDepth--;
+
+                        if (this.flushDepth < this.lastFlushDepth) {
+                            this.flush(chunk, lastFlushPoint, flushPoint);
+                            lastFlushPoint = flushPoint;
+                        }
+
+                        break;
+
+                    case 0x09: /* \t */
+                    case 0x0A: /* \n */
+                    case 0x0D: /* \r */
+                    case 0x20: /* space */
+                        // Move points forward when they points on current position and it's a whitespace
+                        if (lastFlushPoint === i) {
+                            lastFlushPoint++;
+                        }
+
+                        if (flushPoint === i) {
+                            flushPoint++;
+                        }
+
+                        break;
+                }
+            }
+
+            if (flushPoint > lastFlushPoint) {
+                this.flush(chunk, lastFlushPoint, flushPoint);
+            }
+
+            // Produce pendingChunk if something left
+            if (flushPoint < chunkLength) {
+                if (this.pendingChunk !== null) {
+                    // When there is already a pending chunk then no flush happened,
+                    // appending entire chunk to pending one
+                    this.pendingChunk += chunk;
+                } else {
+                    // Create a pending chunk, it will start with non-whitespace since
+                    // flushPoint was moved forward away from whitespaces on scan
+                    this.pendingChunk = chunk.slice(flushPoint, chunkLength);
+                }
+            }
+
+            this.chunkOffset += chunkLength;
+        }
+
+        finish() {
+            if (this.pendingChunk !== null) {
+                this.flush('', 0, 0);
+                this.pendingChunk = null;
+            }
+
+            return this.value;
+        }
+    }
+
+    var src = {
+        version: version,
+        stringifyInfo: stringifyInfo,
+        stringifyStream: stringifyStreamBrowser,
+        parseChunked: parseChunked
+    };
+
+    return src;
+
+}));
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/json-ext.min.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/json-ext.min.js
new file mode 100644
index 0000000..e7e66b7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/json-ext.min.js
@@ -0,0 +1 @@
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):(e="undefined"!=typeof globalThis?globalThis:e||self).jsonExt=t()}(this,(function(){"use strict";function e(e){return"function"==typeof e.pipe&&"function"==typeof e._read&&"object"==typeof e._readableState&&null!==e._readableState}var t={escapableCharCodeSubstitution:{8:"\\b",9:"\\t",10:"\\n",12:"\\f",13:"\\r",34:'\\"',92:"\\\\"},isLeadingSurrogate:function(e){return e>=55296&&e<=56319},isTrailingSurrogate:function(e){return e>=56320&&e<=57343},type:{PRIMITIVE:1,PROMISE:4,ARRAY:3,OBJECT:2,STRING_STREAM:5,OBJECT_STREAM:6},isReadableStream:e,replaceValue:function(e,t,s,n){switch(s&&"function"==typeof s.toJSON&&(s=s.toJSON()),null!==n&&(s=n.call(e,String(t),s)),typeof s){case"function":case"symbol":s=void 0;break;case"object":if(null!==s){const e=s.constructor;e!==String&&e!==Number&&e!==Boolean||(s=s.valueOf())}}return s},getTypeNative:function(e){return null===e||"object"!=typeof e?1:Array.isArray(e)?3:2},getTypeAsync:function(t){return null===t||"object"!=typeof t?1:"function"==typeof t.then?4:e(t)?t._readableState.objectMode?6:5:Array.isArray(t)?3:2},normalizeReplacer:function(e){return"function"==typeof e?e:Array.isArray(e)?[...new Set(e.map((e=>{const t=e&&e.constructor;return t===String||t===Number?String(e):null})).filter((e=>"string"==typeof e)))]:null},normalizeSpace:function(e){return"number"==typeof e?!(!Number.isFinite(e)||e<1)&&" ".repeat(Math.min(e,10)):"string"==typeof e&&e.slice(0,10)||!1}};const{normalizeReplacer:s,normalizeSpace:n,replaceValue:i,getTypeNative:r,getTypeAsync:a,isLeadingSurrogate:l,isTrailingSurrogate:h,escapableCharCodeSubstitution:u,type:{PRIMITIVE:o,OBJECT:c,ARRAY:f,PROMISE:p,STRING_STREAM:d,OBJECT_STREAM:g}}=t,y=Array.from({length:2048}).map(((e,t)=>u.hasOwnProperty(t)?2:t<32?6:t<128?1:2));function S(e){let t=0,s=!1;for(let n=0;n<e.length;n++){const i=e.charCodeAt(n);if(i<2048)t+=y[i];else{if(l(i)){t+=6,s=!0;continue}h(i)?t=s?t-2:t+6:t+=3}s=!1}return t+2}var b=TextDecoder;const{isReadableStream:k}=t,A=new b;function v(e){return null!==e&&"object"==typeof e}function m(e,t){return"SyntaxError"===e.name&&t.jsonParseOffset&&(e.message=e.message.replace(/at position (\d+)/,((e,s)=>"at position "+(Number(s)+t.jsonParseOffset)))),e}class O{constructor(){this.value=void 0,this.valueStack=null,this.stack=new Array(100),this.lastFlushDepth=0,this.flushDepth=0,this.stateString=!1,this.stateStringEscape=!1,this.pendingByteSeq=null,this.pendingChunk=null,this.chunkOffset=0,this.jsonParseOffset=0}parseAndAppend(e,t){1===this.stack[this.lastFlushDepth-1]?(t&&(this.jsonParseOffset--,e="{"+e+"}"),Object.assign(this.valueStack.value,JSON.parse(e))):(t&&(this.jsonParseOffset--,e="["+e+"]"),function(e,t){const s=e.length;e.length+=t.length;for(let n=0;n<t.length;n++)e[s+n]=t[n]}(this.valueStack.value,JSON.parse(e)))}prepareAddition(e){const{value:t}=this.valueStack;if(Array.isArray(t)?0!==t.length:0!==Object.keys(t).length){if(","===e[0])return this.jsonParseOffset++,e.slice(1);if("}"!==e[0]&&"]"!==e[0])return this.jsonParseOffset-=3,"[[]"+e}return e}flush(e,t,s){let n=e.slice(t,s);if(this.jsonParseOffset=this.chunkOffset+t,null!==this.pendingChunk&&(n=this.pendingChunk+n,this.jsonParseOffset-=this.pendingChunk.length,this.pendingChunk=null),this.flushDepth===this.lastFlushDepth)this.flushDepth>0?this.parseAndAppend(this.prepareAddition(n),!0):(this.value=JSON.parse(n),this.valueStack={value:this.value,prev:null});else if(this.flushDepth>this.lastFlushDepth){for(let e=this.flushDepth-1;e>=this.lastFlushDepth;e--)n+=1===this.stack[e]?"}":"]";0===this.lastFlushDepth?(this.value=JSON.parse(n),this.valueStack={value:this.value,prev:null}):this.parseAndAppend(this.prepareAddition(n),!0);for(let e=this.lastFlushDepth||1;e<this.flushDepth;e++){let t=this.valueStack.value;if(1===this.stack[e-1]){let e;for(e in t);t=t[e]}else t=t[t.length-1];this.valueStack={value:t,prev:this.valueStack}}}else{n=this.prepareAddition(n);for(let e=this.lastFlushDepth-1;e>=this.flushDepth;e--)this.jsonParseOffset--,n=(1===this.stack[e]?"{":"[")+n;this.parseAndAppend(n,!1);for(let e=this.lastFlushDepth-1;e>=this.flushDepth;e--)this.valueStack=this.valueStack.prev}this.lastFlushDepth=this.flushDepth}push(e){if("string"!=typeof e){if(null!==this.pendingByteSeq){const t=e;(e=new Uint8Array(this.pendingByteSeq.length+t.length)).set(this.pendingByteSeq),e.set(t,this.pendingByteSeq.length),this.pendingByteSeq=null}if(e[e.length-1]>127)for(let t=0;t<e.length;t++){const s=e[e.length-1-t];if(s>>6==3){t++,(4!==t&&s>>3==30||3!==t&&s>>4==14||2!==t&&s>>5==6)&&(this.pendingByteSeq=e.slice(e.length-t),e=e.slice(0,-t));break}}e=A.decode(e)}const t=e.length;let s=0,n=0;e:for(let i=0;i<t;i++){if(this.stateString){for(;i<t;i++)if(this.stateStringEscape)this.stateStringEscape=!1;else switch(e.charCodeAt(i)){case 34:this.stateString=!1;continue e;case 92:this.stateStringEscape=!0}break}switch(e.charCodeAt(i)){case 34:this.stateString=!0,this.stateStringEscape=!1;break;case 44:n=i;break;case 123:n=i+1,this.stack[this.flushDepth++]=1;break;case 91:n=i+1,this.stack[this.flushDepth++]=2;break;case 93:case 125:n=i+1,this.flushDepth--,this.flushDepth<this.lastFlushDepth&&(this.flush(e,s,n),s=n);break;case 9:case 10:case 13:case 32:s===i&&s++,n===i&&n++}}n>s&&this.flush(e,s,n),n<t&&(null!==this.pendingChunk?this.pendingChunk+=e:this.pendingChunk=e.slice(n,t)),this.chunkOffset+=t}finish(){return null!==this.pendingChunk&&(this.flush("",0,0),this.pendingChunk=null),this.value}}return{version:"0.5.7",stringifyInfo:function(e,t,l,h){let u=null;t=s(t),Array.isArray(t)&&(u=new Set(t),t=null),l=function(e){return"string"==typeof(e=n(e))?e.length:0}(l),h=h||{};const y=new Map,b=new Set,k=new Set,A=new Set,v=new Set,m=h.async?a:r,O={"":e};let w=!1,D=0;return function e(s,n,r){if(w)return;r=i(s,n,r,t);let a=m(r);if(a!==o&&b.has(r))return A.add(r),D+=4,void(h.continueOnCircular||(w=!0));switch(a){case o:void 0!==r||Array.isArray(s)?D+=function(e){switch(typeof e){case"string":return S(e);case"number":return Number.isFinite(e)?String(e).length:4;case"boolean":return e?4:5;case"undefined":case"object":return 4;default:return 0}}(r):s===O&&(D+=9);break;case c:{if(y.has(r)){k.add(r),D+=y.get(r);break}const t=D;let s=0;D+=2,b.add(r);for(const t in r)if(hasOwnProperty.call(r,t)&&(null===u||u.has(t))){const n=D;e(r,t,r[t]),n!==D&&(D+=S(t)+1,s++)}s>1&&(D+=s-1),b.delete(r),l>0&&s>0&&(D+=(1+(b.size+1)*l+1)*s,D+=1+b.size*l),y.set(r,D-t);break}case f:{if(y.has(r)){k.add(r),D+=y.get(r);break}const t=D;D+=2,b.add(r);for(let t=0;t<r.length;t++)e(r,t,r[t]);r.length>1&&(D+=r.length-1),b.delete(r),l>0&&r.length>0&&(D+=(1+(b.size+1)*l)*r.length,D+=1+b.size*l),y.set(r,D-t);break}case p:case d:v.add(r);break;case g:D+=2,v.add(r)}}(O,"",e),{minLength:isNaN(D)?1/0:D,circular:[...A],duplicate:[...k],async:[...v]}},stringifyStream:()=>{throw new Error("Method is not supported")},parseChunked:function(e){let t=new O;if(v(e)&&k(e))return new Promise(((s,n)=>{e.on("data",(e=>{try{t.push(e)}catch(e){n(m(e,t)),t=null}})).on("error",(e=>{t=null,n(e)})).on("end",(()=>{try{s(t.finish())}catch(e){n(m(e,t))}finally{t=null}}))}));if("function"==typeof e){const s=e();if(v(s)&&(Symbol.iterator in s||Symbol.asyncIterator in s))return new Promise((async(e,n)=>{try{for await(const e of s)t.push(e);e(t.finish())}catch(e){n(m(e,t))}finally{t=null}}))}throw new Error("Chunk emitter should be readable stream, generator, async generator or function returning an iterable object")}}}));
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/version.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/version.js
new file mode 100644
index 0000000..3d0dce2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/dist/version.js
@@ -0,0 +1 @@
+module.exports = "0.5.7";
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/index.d.ts b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/index.d.ts
new file mode 100644
index 0000000..8b1d7c9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/index.d.ts
@@ -0,0 +1,31 @@
+declare module '@discoveryjs/json-ext' {
+    import { Readable } from 'stream';
+
+    type TReplacer =
+        | ((this: any, key: string, value: any) => any)
+        | string[]
+        | number[]
+        | null;
+    type TSpace = string | number | null;
+    type TChunk = string | Buffer | Uint8Array;
+
+    export function parseChunked(input: Readable): Promise<any>;
+    export function parseChunked(input: () => (Iterable<TChunk> | AsyncIterable<TChunk>)): Promise<any>;
+
+    export function stringifyStream(value: any, replacer?: TReplacer, space?: TSpace): Readable;
+
+    export function stringifyInfo(
+        value: any,
+        replacer?: TReplacer,
+        space?: TSpace,
+        options?: {
+            async?: boolean;
+            continueOnCircular?: boolean;
+        }
+    ): {
+        minLength: number;
+        circular: any[];
+        duplicate: any[];
+        async: any[];
+    };
+}
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/package.json b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/package.json
new file mode 100644
index 0000000..f6ccde5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/package.json
@@ -0,0 +1,56 @@
+{
+    "name": "@discoveryjs/json-ext",
+    "version": "0.5.7",
+    "description": "A set of utilities that extend the use of JSON",
+    "keywords": [
+        "json",
+        "utils",
+        "stream",
+        "async",
+        "promise",
+        "stringify",
+        "info"
+    ],
+    "author": "Roman Dvornov <rdvornov@gmail.com> (https://github.com/lahmatiy)",
+    "license": "MIT",
+    "repository": "discoveryjs/json-ext",
+    "main": "./src/index",
+    "browser": {
+        "./src/stringify-stream.js": "./src/stringify-stream-browser.js",
+        "./src/text-decoder.js": "./src/text-decoder-browser.js",
+        "./src/version.js": "./dist/version.js"
+    },
+    "types": "./index.d.ts",
+    "scripts": {
+        "test": "mocha --reporter progress",
+        "lint": "eslint src test",
+        "lint-and-test": "npm run lint && npm test",
+        "build": "rollup --config",
+        "test:all": "npm run test:src && npm run test:dist",
+        "test:src": "npm test",
+        "test:dist": "cross-env MODE=dist npm test && cross-env MODE=dist-min npm test",
+        "build-and-test": "npm run build && npm run test:dist",
+        "coverage": "c8 --reporter=lcovonly npm test",
+        "prepublishOnly": "npm run lint && npm test && npm run build-and-test"
+    },
+    "devDependencies": {
+        "@rollup/plugin-commonjs": "^15.1.0",
+        "@rollup/plugin-json": "^4.1.0",
+        "@rollup/plugin-node-resolve": "^9.0.0",
+        "c8": "^7.10.0",
+        "chalk": "^4.1.0",
+        "cross-env": "^7.0.3",
+        "eslint": "^8.10.0",
+        "mocha": "^8.4.0",
+        "rollup": "^2.28.2",
+        "rollup-plugin-terser": "^7.0.2"
+    },
+    "engines": {
+        "node": ">=10.0.0"
+    },
+    "files": [
+        "dist",
+        "src",
+        "index.d.ts"
+    ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/index.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/index.js
new file mode 100644
index 0000000..ae05057
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/index.js
@@ -0,0 +1,6 @@
+module.exports = {
+    version: require('./version'),
+    stringifyInfo: require('./stringify-info'),
+    stringifyStream: require('./stringify-stream'),
+    parseChunked: require('./parse-chunked')
+};
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/parse-chunked.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/parse-chunked.js
new file mode 100644
index 0000000..87f7209
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/parse-chunked.js
@@ -0,0 +1,384 @@
+const { isReadableStream } = require('./utils');
+const TextDecoder = require('./text-decoder');
+
+const STACK_OBJECT = 1;
+const STACK_ARRAY = 2;
+const decoder = new TextDecoder();
+
+function isObject(value) {
+    return value !== null && typeof value === 'object';
+}
+
+function adjustPosition(error, parser) {
+    if (error.name === 'SyntaxError' && parser.jsonParseOffset) {
+        error.message = error.message.replace(/at position (\d+)/, (_, pos) =>
+            'at position ' + (Number(pos) + parser.jsonParseOffset)
+        );
+    }
+
+    return error;
+}
+
+function append(array, elements) {
+    // Note: Avoid to use array.push(...elements) since it may lead to
+    // "RangeError: Maximum call stack size exceeded" for a long arrays
+    const initialLength = array.length;
+    array.length += elements.length;
+
+    for (let i = 0; i < elements.length; i++) {
+        array[initialLength + i] = elements[i];
+    }
+}
+
+module.exports = function(chunkEmitter) {
+    let parser = new ChunkParser();
+
+    if (isObject(chunkEmitter) && isReadableStream(chunkEmitter)) {
+        return new Promise((resolve, reject) => {
+            chunkEmitter
+                .on('data', chunk => {
+                    try {
+                        parser.push(chunk);
+                    } catch (e) {
+                        reject(adjustPosition(e, parser));
+                        parser = null;
+                    }
+                })
+                .on('error', (e) => {
+                    parser = null;
+                    reject(e);
+                })
+                .on('end', () => {
+                    try {
+                        resolve(parser.finish());
+                    } catch (e) {
+                        reject(adjustPosition(e, parser));
+                    } finally {
+                        parser = null;
+                    }
+                });
+        });
+    }
+
+    if (typeof chunkEmitter === 'function') {
+        const iterator = chunkEmitter();
+
+        if (isObject(iterator) && (Symbol.iterator in iterator || Symbol.asyncIterator in iterator)) {
+            return new Promise(async (resolve, reject) => {
+                try {
+                    for await (const chunk of iterator) {
+                        parser.push(chunk);
+                    }
+
+                    resolve(parser.finish());
+                } catch (e) {
+                    reject(adjustPosition(e, parser));
+                } finally {
+                    parser = null;
+                }
+            });
+        }
+    }
+
+    throw new Error(
+        'Chunk emitter should be readable stream, generator, ' +
+        'async generator or function returning an iterable object'
+    );
+};
+
+class ChunkParser {
+    constructor() {
+        this.value = undefined;
+        this.valueStack = null;
+
+        this.stack = new Array(100);
+        this.lastFlushDepth = 0;
+        this.flushDepth = 0;
+        this.stateString = false;
+        this.stateStringEscape = false;
+        this.pendingByteSeq = null;
+        this.pendingChunk = null;
+        this.chunkOffset = 0;
+        this.jsonParseOffset = 0;
+    }
+
+    parseAndAppend(fragment, wrap) {
+        // Append new entries or elements
+        if (this.stack[this.lastFlushDepth - 1] === STACK_OBJECT) {
+            if (wrap) {
+                this.jsonParseOffset--;
+                fragment = '{' + fragment + '}';
+            }
+
+            Object.assign(this.valueStack.value, JSON.parse(fragment));
+        } else {
+            if (wrap) {
+                this.jsonParseOffset--;
+                fragment = '[' + fragment + ']';
+            }
+
+            append(this.valueStack.value, JSON.parse(fragment));
+        }
+    }
+
+    prepareAddition(fragment) {
+        const { value } = this.valueStack;
+        const expectComma = Array.isArray(value)
+            ? value.length !== 0
+            : Object.keys(value).length !== 0;
+
+        if (expectComma) {
+            // Skip a comma at the beginning of fragment, otherwise it would
+            // fail to parse
+            if (fragment[0] === ',') {
+                this.jsonParseOffset++;
+                return fragment.slice(1);
+            }
+
+            // When value (an object or array) is not empty and a fragment
+            // doesn't start with a comma, a single valid fragment starting
+            // is a closing bracket. If it's not, a prefix is adding to fail
+            // parsing. Otherwise, the sequence of chunks can be successfully
+            // parsed, although it should not, e.g. ["[{}", "{}]"]
+            if (fragment[0] !== '}' && fragment[0] !== ']') {
+                this.jsonParseOffset -= 3;
+                return '[[]' + fragment;
+            }
+        }
+
+        return fragment;
+    }
+
+    flush(chunk, start, end) {
+        let fragment = chunk.slice(start, end);
+
+        // Save position correction an error in JSON.parse() if any
+        this.jsonParseOffset = this.chunkOffset + start;
+
+        // Prepend pending chunk if any
+        if (this.pendingChunk !== null) {
+            fragment = this.pendingChunk + fragment;
+            this.jsonParseOffset -= this.pendingChunk.length;
+            this.pendingChunk = null;
+        }
+
+        if (this.flushDepth === this.lastFlushDepth) {
+            // Depth didn't changed, so it's a root value or entry/element set
+            if (this.flushDepth > 0) {
+                this.parseAndAppend(this.prepareAddition(fragment), true);
+            } else {
+                // That's an entire value on a top level
+                this.value = JSON.parse(fragment);
+                this.valueStack = {
+                    value: this.value,
+                    prev: null
+                };
+            }
+        } else if (this.flushDepth > this.lastFlushDepth) {
+            // Add missed closing brackets/parentheses
+            for (let i = this.flushDepth - 1; i >= this.lastFlushDepth; i--) {
+                fragment += this.stack[i] === STACK_OBJECT ? '}' : ']';
+            }
+
+            if (this.lastFlushDepth === 0) {
+                // That's a root value
+                this.value = JSON.parse(fragment);
+                this.valueStack = {
+                    value: this.value,
+                    prev: null
+                };
+            } else {
+                this.parseAndAppend(this.prepareAddition(fragment), true);
+            }
+
+            // Move down to the depths to the last object/array, which is current now
+            for (let i = this.lastFlushDepth || 1; i < this.flushDepth; i++) {
+                let value = this.valueStack.value;
+
+                if (this.stack[i - 1] === STACK_OBJECT) {
+                    // find last entry
+                    let key;
+                    // eslint-disable-next-line curly
+                    for (key in value);
+                    value = value[key];
+                } else {
+                    // last element
+                    value = value[value.length - 1];
+                }
+
+                this.valueStack = {
+                    value,
+                    prev: this.valueStack
+                };
+            }
+        } else /* this.flushDepth < this.lastFlushDepth */ {
+            fragment = this.prepareAddition(fragment);
+
+            // Add missed opening brackets/parentheses
+            for (let i = this.lastFlushDepth - 1; i >= this.flushDepth; i--) {
+                this.jsonParseOffset--;
+                fragment = (this.stack[i] === STACK_OBJECT ? '{' : '[') + fragment;
+            }
+
+            this.parseAndAppend(fragment, false);
+
+            for (let i = this.lastFlushDepth - 1; i >= this.flushDepth; i--) {
+                this.valueStack = this.valueStack.prev;
+            }
+        }
+
+        this.lastFlushDepth = this.flushDepth;
+    }
+
+    push(chunk) {
+        if (typeof chunk !== 'string') {
+            // Suppose chunk is Buffer or Uint8Array
+
+            // Prepend uncompleted byte sequence if any
+            if (this.pendingByteSeq !== null) {
+                const origRawChunk = chunk;
+                chunk = new Uint8Array(this.pendingByteSeq.length + origRawChunk.length);
+                chunk.set(this.pendingByteSeq);
+                chunk.set(origRawChunk, this.pendingByteSeq.length);
+                this.pendingByteSeq = null;
+            }
+
+            // In case Buffer/Uint8Array, an input is encoded in UTF8
+            // Seek for parts of uncompleted UTF8 symbol on the ending
+            // This makes sense only if we expect more chunks and last char is not multi-bytes
+            if (chunk[chunk.length - 1] > 127) {
+                for (let seqLength = 0; seqLength < chunk.length; seqLength++) {
+                    const byte = chunk[chunk.length - 1 - seqLength];
+
+                    // 10xxxxxx - 2nd, 3rd or 4th byte
+                    // 110xxxxx – first byte of 2-byte sequence
+                    // 1110xxxx - first byte of 3-byte sequence
+                    // 11110xxx - first byte of 4-byte sequence
+                    if (byte >> 6 === 3) {
+                        seqLength++;
+
+                        // If the sequence is really incomplete, then preserve it
+                        // for the future chunk and cut off it from the current chunk
+                        if ((seqLength !== 4 && byte >> 3 === 0b11110) ||
+                            (seqLength !== 3 && byte >> 4 === 0b1110) ||
+                            (seqLength !== 2 && byte >> 5 === 0b110)) {
+                            this.pendingByteSeq = chunk.slice(chunk.length - seqLength);
+                            chunk = chunk.slice(0, -seqLength);
+                        }
+
+                        break;
+                    }
+                }
+            }
+
+            // Convert chunk to a string, since single decode per chunk
+            // is much effective than decode multiple small substrings
+            chunk = decoder.decode(chunk);
+        }
+
+        const chunkLength = chunk.length;
+        let lastFlushPoint = 0;
+        let flushPoint = 0;
+
+        // Main scan loop
+        scan: for (let i = 0; i < chunkLength; i++) {
+            if (this.stateString) {
+                for (; i < chunkLength; i++) {
+                    if (this.stateStringEscape) {
+                        this.stateStringEscape = false;
+                    } else {
+                        switch (chunk.charCodeAt(i)) {
+                            case 0x22: /* " */
+                                this.stateString = false;
+                                continue scan;
+
+                            case 0x5C: /* \ */
+                                this.stateStringEscape = true;
+                        }
+                    }
+                }
+
+                break;
+            }
+
+            switch (chunk.charCodeAt(i)) {
+                case 0x22: /* " */
+                    this.stateString = true;
+                    this.stateStringEscape = false;
+                    break;
+
+                case 0x2C: /* , */
+                    flushPoint = i;
+                    break;
+
+                case 0x7B: /* { */
+                    // Open an object
+                    flushPoint = i + 1;
+                    this.stack[this.flushDepth++] = STACK_OBJECT;
+                    break;
+
+                case 0x5B: /* [ */
+                    // Open an array
+                    flushPoint = i + 1;
+                    this.stack[this.flushDepth++] = STACK_ARRAY;
+                    break;
+
+                case 0x5D: /* ] */
+                case 0x7D: /* } */
+                    // Close an object or array
+                    flushPoint = i + 1;
+                    this.flushDepth--;
+
+                    if (this.flushDepth < this.lastFlushDepth) {
+                        this.flush(chunk, lastFlushPoint, flushPoint);
+                        lastFlushPoint = flushPoint;
+                    }
+
+                    break;
+
+                case 0x09: /* \t */
+                case 0x0A: /* \n */
+                case 0x0D: /* \r */
+                case 0x20: /* space */
+                    // Move points forward when they points on current position and it's a whitespace
+                    if (lastFlushPoint === i) {
+                        lastFlushPoint++;
+                    }
+
+                    if (flushPoint === i) {
+                        flushPoint++;
+                    }
+
+                    break;
+            }
+        }
+
+        if (flushPoint > lastFlushPoint) {
+            this.flush(chunk, lastFlushPoint, flushPoint);
+        }
+
+        // Produce pendingChunk if something left
+        if (flushPoint < chunkLength) {
+            if (this.pendingChunk !== null) {
+                // When there is already a pending chunk then no flush happened,
+                // appending entire chunk to pending one
+                this.pendingChunk += chunk;
+            } else {
+                // Create a pending chunk, it will start with non-whitespace since
+                // flushPoint was moved forward away from whitespaces on scan
+                this.pendingChunk = chunk.slice(flushPoint, chunkLength);
+            }
+        }
+
+        this.chunkOffset += chunkLength;
+    }
+
+    finish() {
+        if (this.pendingChunk !== null) {
+            this.flush('', 0, 0);
+            this.pendingChunk = null;
+        }
+
+        return this.value;
+    }
+};
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-info.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-info.js
new file mode 100644
index 0000000..2678f11
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-info.js
@@ -0,0 +1,231 @@
+const {
+    normalizeReplacer,
+    normalizeSpace,
+    replaceValue,
+    getTypeNative,
+    getTypeAsync,
+    isLeadingSurrogate,
+    isTrailingSurrogate,
+    escapableCharCodeSubstitution,
+    type: {
+        PRIMITIVE,
+        OBJECT,
+        ARRAY,
+        PROMISE,
+        STRING_STREAM,
+        OBJECT_STREAM
+    }
+} = require('./utils');
+const charLength2048 = Array.from({ length: 2048 }).map((_, code) => {
+    if (escapableCharCodeSubstitution.hasOwnProperty(code)) {
+        return 2; // \X
+    }
+
+    if (code < 0x20) {
+        return 6; // \uXXXX
+    }
+
+    return code < 128 ? 1 : 2; // UTF8 bytes
+});
+
+function stringLength(str) {
+    let len = 0;
+    let prevLeadingSurrogate = false;
+
+    for (let i = 0; i < str.length; i++) {
+        const code = str.charCodeAt(i);
+
+        if (code < 2048) {
+            len += charLength2048[code];
+        } else if (isLeadingSurrogate(code)) {
+            len += 6; // \uXXXX since no pair with trailing surrogate yet
+            prevLeadingSurrogate = true;
+            continue;
+        } else if (isTrailingSurrogate(code)) {
+            len = prevLeadingSurrogate
+                ? len - 2  // surrogate pair (4 bytes), since we calculate prev leading surrogate as 6 bytes, substruct 2 bytes
+                : len + 6; // \uXXXX
+        } else {
+            len += 3; // code >= 2048 is 3 bytes length for UTF8
+        }
+
+        prevLeadingSurrogate = false;
+    }
+
+    return len + 2; // +2 for quotes
+}
+
+function primitiveLength(value) {
+    switch (typeof value) {
+        case 'string':
+            return stringLength(value);
+
+        case 'number':
+            return Number.isFinite(value) ? String(value).length : 4 /* null */;
+
+        case 'boolean':
+            return value ? 4 /* true */ : 5 /* false */;
+
+        case 'undefined':
+        case 'object':
+            return 4; /* null */
+
+        default:
+            return 0;
+    }
+}
+
+function spaceLength(space) {
+    space = normalizeSpace(space);
+    return typeof space === 'string' ? space.length : 0;
+}
+
+module.exports = function jsonStringifyInfo(value, replacer, space, options) {
+    function walk(holder, key, value) {
+        if (stop) {
+            return;
+        }
+
+        value = replaceValue(holder, key, value, replacer);
+
+        let type = getType(value);
+
+        // check for circular structure
+        if (type !== PRIMITIVE && stack.has(value)) {
+            circular.add(value);
+            length += 4; // treat as null
+
+            if (!options.continueOnCircular) {
+                stop = true;
+            }
+
+            return;
+        }
+
+        switch (type) {
+            case PRIMITIVE:
+                if (value !== undefined || Array.isArray(holder)) {
+                    length += primitiveLength(value);
+                } else if (holder === root) {
+                    length += 9; // FIXME: that's the length of undefined, should we normalize behaviour to convert it to null?
+                }
+                break;
+
+            case OBJECT: {
+                if (visited.has(value)) {
+                    duplicate.add(value);
+                    length += visited.get(value);
+                    break;
+                }
+
+                const valueLength = length;
+                let entries = 0;
+
+                length += 2; // {}
+
+                stack.add(value);
+
+                for (const key in value) {
+                    if (hasOwnProperty.call(value, key) && (allowlist === null || allowlist.has(key))) {
+                        const prevLength = length;
+                        walk(value, key, value[key]);
+
+                        if (prevLength !== length) {
+                            // value is printed
+                            length += stringLength(key) + 1; // "key":
+                            entries++;
+                        }
+                    }
+                }
+
+                if (entries > 1) {
+                    length += entries - 1; // commas
+                }
+
+                stack.delete(value);
+
+                if (space > 0 && entries > 0) {
+                    length += (1 + (stack.size + 1) * space + 1) * entries; // for each key-value: \n{space}
+                    length += 1 + stack.size * space; // for }
+                }
+
+                visited.set(value, length - valueLength);
+
+                break;
+            }
+
+            case ARRAY: {
+                if (visited.has(value)) {
+                    duplicate.add(value);
+                    length += visited.get(value);
+                    break;
+                }
+
+                const valueLength = length;
+
+                length += 2; // []
+
+                stack.add(value);
+
+                for (let i = 0; i < value.length; i++) {
+                    walk(value, i, value[i]);
+                }
+
+                if (value.length > 1) {
+                    length += value.length - 1; // commas
+                }
+
+                stack.delete(value);
+
+                if (space > 0 && value.length > 0) {
+                    length += (1 + (stack.size + 1) * space) * value.length; // for each element: \n{space}
+                    length += 1 + stack.size * space; // for ]
+                }
+
+                visited.set(value, length - valueLength);
+
+                break;
+            }
+
+            case PROMISE:
+            case STRING_STREAM:
+                async.add(value);
+                break;
+
+            case OBJECT_STREAM:
+                length += 2; // []
+                async.add(value);
+                break;
+        }
+    }
+
+    let allowlist = null;
+    replacer = normalizeReplacer(replacer);
+
+    if (Array.isArray(replacer)) {
+        allowlist = new Set(replacer);
+        replacer = null;
+    }
+
+    space = spaceLength(space);
+    options = options || {};
+
+    const visited = new Map();
+    const stack = new Set();
+    const duplicate = new Set();
+    const circular = new Set();
+    const async = new Set();
+    const getType = options.async ? getTypeAsync : getTypeNative;
+    const root = { '': value };
+    let stop = false;
+    let length = 0;
+
+    walk(root, '', value);
+
+    return {
+        minLength: isNaN(length) ? Infinity : length,
+        circular: [...circular],
+        duplicate: [...duplicate],
+        async: [...async]
+    };
+};
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-stream-browser.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-stream-browser.js
new file mode 100644
index 0000000..e11ccb6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-stream-browser.js
@@ -0,0 +1,3 @@
+module.exports = () => {
+    throw new Error('Method is not supported');
+};
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-stream.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-stream.js
new file mode 100644
index 0000000..4f983a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/stringify-stream.js
@@ -0,0 +1,408 @@
+const { Readable } = require('stream');
+const {
+    normalizeReplacer,
+    normalizeSpace,
+    replaceValue,
+    getTypeAsync,
+    type: {
+        PRIMITIVE,
+        OBJECT,
+        ARRAY,
+        PROMISE,
+        STRING_STREAM,
+        OBJECT_STREAM
+    }
+} = require('./utils');
+const noop = () => {};
+const hasOwnProperty = Object.prototype.hasOwnProperty;
+
+// TODO: Remove when drop support for Node.js 10
+// Node.js 10 has no well-formed JSON.stringify()
+// https://github.com/tc39/proposal-well-formed-stringify
+// Adopted code from https://bugs.chromium.org/p/v8/issues/detail?id=7782#c12
+const wellformedStringStringify = JSON.stringify('\ud800') === '"\\ud800"'
+    ? JSON.stringify
+    : s => JSON.stringify(s).replace(
+        /\p{Surrogate}/gu,
+        m => `\\u${m.charCodeAt(0).toString(16)}`
+    );
+
+function push() {
+    this.push(this._stack.value);
+    this.popStack();
+}
+
+function pushPrimitive(value) {
+    switch (typeof value) {
+        case 'string':
+            this.push(this.encodeString(value));
+            break;
+
+        case 'number':
+            this.push(Number.isFinite(value) ? this.encodeNumber(value) : 'null');
+            break;
+
+        case 'boolean':
+            this.push(value ? 'true' : 'false');
+            break;
+
+        case 'undefined':
+        case 'object': // typeof null === 'object'
+            this.push('null');
+            break;
+
+        default:
+            this.destroy(new TypeError(`Do not know how to serialize a ${value.constructor && value.constructor.name || typeof value}`));
+    }
+}
+
+function processObjectEntry(key) {
+    const current = this._stack;
+
+    if (!current.first) {
+        current.first = true;
+    } else {
+        this.push(',');
+    }
+
+    if (this.space) {
+        this.push(`\n${this.space.repeat(this._depth)}${this.encodeString(key)}: `);
+    } else {
+        this.push(this.encodeString(key) + ':');
+    }
+}
+
+function processObject() {
+    const current = this._stack;
+
+    // when no keys left, remove obj from stack
+    if (current.index === current.keys.length) {
+        if (this.space && current.first) {
+            this.push(`\n${this.space.repeat(this._depth - 1)}}`);
+        } else {
+            this.push('}');
+        }
+
+        this.popStack();
+        return;
+    }
+
+    const key = current.keys[current.index];
+
+    this.processValue(current.value, key, current.value[key], processObjectEntry);
+    current.index++;
+}
+
+function processArrayItem(index) {
+    if (index !== 0) {
+        this.push(',');
+    }
+
+    if (this.space) {
+        this.push(`\n${this.space.repeat(this._depth)}`);
+    }
+}
+
+function processArray() {
+    const current = this._stack;
+
+    if (current.index === current.value.length) {
+        if (this.space && current.index > 0) {
+            this.push(`\n${this.space.repeat(this._depth - 1)}]`);
+        } else {
+            this.push(']');
+        }
+
+        this.popStack();
+        return;
+    }
+
+    this.processValue(current.value, current.index, current.value[current.index], processArrayItem);
+    current.index++;
+}
+
+function createStreamReader(fn) {
+    return function() {
+        const current = this._stack;
+        const data = current.value.read(this._readSize);
+
+        if (data !== null) {
+            current.first = false;
+            fn.call(this, data, current);
+        } else {
+            if ((current.first && !current.value._readableState.reading) || current.ended) {
+                this.popStack();
+            } else {
+                current.first = true;
+                current.awaiting = true;
+            }
+        }
+    };
+}
+
+const processReadableObject = createStreamReader(function(data, current) {
+    this.processValue(current.value, current.index, data, processArrayItem);
+    current.index++;
+});
+
+const processReadableString = createStreamReader(function(data) {
+    this.push(data);
+});
+
+class JsonStringifyStream extends Readable {
+    constructor(value, replacer, space) {
+        super({
+            autoDestroy: true
+        });
+
+        this.getKeys = Object.keys;
+        this.replacer = normalizeReplacer(replacer);
+
+        if (Array.isArray(this.replacer)) {
+            const allowlist = this.replacer;
+
+            this.getKeys = (value) => allowlist.filter(key => hasOwnProperty.call(value, key));
+            this.replacer = null;
+        }
+
+        this.space = normalizeSpace(space);
+        this._depth = 0;
+
+        this.error = null;
+        this._processing = false;
+        this._ended = false;
+
+        this._readSize = 0;
+        this._buffer = '';
+
+        this._stack = null;
+        this._visited = new WeakSet();
+
+        this.pushStack({
+            handler: () => {
+                this.popStack();
+                this.processValue({ '': value }, '', value, noop);
+            }
+        });
+    }
+
+    encodeString(value) {
+        if (/[^\x20-\uD799]|[\x22\x5c]/.test(value)) {
+            return wellformedStringStringify(value);
+        }
+
+        return '"' + value + '"';
+    }
+
+    encodeNumber(value) {
+        return value;
+    }
+
+    processValue(holder, key, value, callback) {
+        value = replaceValue(holder, key, value, this.replacer);
+
+        let type = getTypeAsync(value);
+
+        switch (type) {
+            case PRIMITIVE:
+                if (callback !== processObjectEntry || value !== undefined) {
+                    callback.call(this, key);
+                    pushPrimitive.call(this, value);
+                }
+                break;
+
+            case OBJECT:
+                callback.call(this, key);
+
+                // check for circular structure
+                if (this._visited.has(value)) {
+                    return this.destroy(new TypeError('Converting circular structure to JSON'));
+                }
+
+                this._visited.add(value);
+                this._depth++;
+                this.push('{');
+                this.pushStack({
+                    handler: processObject,
+                    value,
+                    index: 0,
+                    first: false,
+                    keys: this.getKeys(value)
+                });
+                break;
+
+            case ARRAY:
+                callback.call(this, key);
+
+                // check for circular structure
+                if (this._visited.has(value)) {
+                    return this.destroy(new TypeError('Converting circular structure to JSON'));
+                }
+
+                this._visited.add(value);
+
+                this.push('[');
+                this.pushStack({
+                    handler: processArray,
+                    value,
+                    index: 0
+                });
+                this._depth++;
+                break;
+
+            case PROMISE:
+                this.pushStack({
+                    handler: noop,
+                    awaiting: true
+                });
+
+                Promise.resolve(value)
+                    .then(resolved => {
+                        this.popStack();
+                        this.processValue(holder, key, resolved, callback);
+                        this.processStack();
+                    })
+                    .catch(error => {
+                        this.destroy(error);
+                    });
+                break;
+
+            case STRING_STREAM:
+            case OBJECT_STREAM:
+                callback.call(this, key);
+
+                // TODO: Remove when drop support for Node.js 10
+                // Used `_readableState.endEmitted` as fallback, since Node.js 10 has no `readableEnded` getter
+                if (value.readableEnded || value._readableState.endEmitted) {
+                    return this.destroy(new Error('Readable Stream has ended before it was serialized. All stream data have been lost'));
+                }
+
+                if (value.readableFlowing) {
+                    return this.destroy(new Error('Readable Stream is in flowing mode, data may have been lost. Trying to pause stream.'));
+                }
+
+                if (type === OBJECT_STREAM) {
+                    this.push('[');
+                    this.pushStack({
+                        handler: push,
+                        value: this.space ? '\n' + this.space.repeat(this._depth) + ']' : ']'
+                    });
+                    this._depth++;
+                }
+
+                const self = this.pushStack({
+                    handler: type === OBJECT_STREAM ? processReadableObject : processReadableString,
+                    value,
+                    index: 0,
+                    first: false,
+                    ended: false,
+                    awaiting: !value.readable || value.readableLength === 0
+                });
+                const continueProcessing = () => {
+                    if (self.awaiting) {
+                        self.awaiting = false;
+                        this.processStack();
+                    }
+                };
+
+                value.once('error', error => this.destroy(error));
+                value.once('end', () => {
+                    self.ended = true;
+                    continueProcessing();
+                });
+                value.on('readable', continueProcessing);
+                break;
+        }
+    }
+
+    pushStack(node) {
+        node.prev = this._stack;
+        return this._stack = node;
+    }
+
+    popStack() {
+        const { handler, value } = this._stack;
+
+        if (handler === processObject || handler === processArray || handler === processReadableObject) {
+            this._visited.delete(value);
+            this._depth--;
+        }
+
+        this._stack = this._stack.prev;
+    }
+
+    processStack() {
+        if (this._processing || this._ended) {
+            return;
+        }
+
+        try {
+            this._processing = true;
+
+            while (this._stack !== null && !this._stack.awaiting) {
+                this._stack.handler.call(this);
+
+                if (!this._processing) {
+                    return;
+                }
+            }
+
+            this._processing = false;
+        } catch (error) {
+            this.destroy(error);
+            return;
+        }
+
+        if (this._stack === null && !this._ended) {
+            this._finish();
+            this.push(null);
+        }
+    }
+
+    push(data) {
+        if (data !== null) {
+            this._buffer += data;
+
+            // check buffer overflow
+            if (this._buffer.length < this._readSize) {
+                return;
+            }
+
+            // flush buffer
+            data = this._buffer;
+            this._buffer = '';
+            this._processing = false;
+        }
+
+        super.push(data);
+    }
+
+    _read(size) {
+        // start processing
+        this._readSize = size || this.readableHighWaterMark;
+        this.processStack();
+    }
+
+    _finish() {
+        this._ended = true;
+        this._processing = false;
+        this._stack = null;
+        this._visited = null;
+
+        if (this._buffer && this._buffer.length) {
+            super.push(this._buffer); // flush buffer
+        }
+
+        this._buffer = '';
+    }
+
+    _destroy(error, cb) {
+        this.error = this.error || error;
+        this._finish();
+        cb(error);
+    }
+}
+
+module.exports = function createJsonStringifyStream(value, replacer, space) {
+    return new JsonStringifyStream(value, replacer, space);
+};
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/text-decoder-browser.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/text-decoder-browser.js
new file mode 100644
index 0000000..11befa2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/text-decoder-browser.js
@@ -0,0 +1 @@
+module.exports = TextDecoder;
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/text-decoder.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/text-decoder.js
new file mode 100644
index 0000000..99fa6d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/text-decoder.js
@@ -0,0 +1 @@
+module.exports = require('util').TextDecoder;
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/utils.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/utils.js
new file mode 100644
index 0000000..b79bc72
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/utils.js
@@ -0,0 +1,149 @@
+const PrimitiveType = 1;
+const ObjectType = 2;
+const ArrayType = 3;
+const PromiseType = 4;
+const ReadableStringType = 5;
+const ReadableObjectType = 6;
+// https://tc39.es/ecma262/#table-json-single-character-escapes
+const escapableCharCodeSubstitution = { // JSON Single Character Escape Sequences
+    0x08: '\\b',
+    0x09: '\\t',
+    0x0a: '\\n',
+    0x0c: '\\f',
+    0x0d: '\\r',
+    0x22: '\\\"',
+    0x5c: '\\\\'
+};
+
+function isLeadingSurrogate(code) {
+    return code >= 0xD800 && code <= 0xDBFF;
+}
+
+function isTrailingSurrogate(code) {
+    return code >= 0xDC00 && code <= 0xDFFF;
+}
+
+function isReadableStream(value) {
+    return (
+        typeof value.pipe === 'function' &&
+        typeof value._read === 'function' &&
+        typeof value._readableState === 'object' && value._readableState !== null
+    );
+}
+
+function replaceValue(holder, key, value, replacer) {
+    if (value && typeof value.toJSON === 'function') {
+        value = value.toJSON();
+    }
+
+    if (replacer !== null) {
+        value = replacer.call(holder, String(key), value);
+    }
+
+    switch (typeof value) {
+        case 'function':
+        case 'symbol':
+            value = undefined;
+            break;
+
+        case 'object':
+            if (value !== null) {
+                const cls = value.constructor;
+                if (cls === String || cls === Number || cls === Boolean) {
+                    value = value.valueOf();
+                }
+            }
+            break;
+    }
+
+    return value;
+}
+
+function getTypeNative(value) {
+    if (value === null || typeof value !== 'object') {
+        return PrimitiveType;
+    }
+
+    if (Array.isArray(value)) {
+        return ArrayType;
+    }
+
+    return ObjectType;
+}
+
+function getTypeAsync(value) {
+    if (value === null || typeof value !== 'object') {
+        return PrimitiveType;
+    }
+
+    if (typeof value.then === 'function') {
+        return PromiseType;
+    }
+
+    if (isReadableStream(value)) {
+        return value._readableState.objectMode ? ReadableObjectType : ReadableStringType;
+    }
+
+    if (Array.isArray(value)) {
+        return ArrayType;
+    }
+
+    return ObjectType;
+}
+
+function normalizeReplacer(replacer) {
+    if (typeof replacer === 'function') {
+        return replacer;
+    }
+
+    if (Array.isArray(replacer)) {
+        const allowlist = new Set(replacer
+            .map(item => {
+                const cls = item && item.constructor;
+                return cls === String || cls === Number ? String(item) : null;
+            })
+            .filter(item => typeof item === 'string')
+        );
+
+        return [...allowlist];
+    }
+
+    return null;
+}
+
+function normalizeSpace(space) {
+    if (typeof space === 'number') {
+        if (!Number.isFinite(space) || space < 1) {
+            return false;
+        }
+
+        return ' '.repeat(Math.min(space, 10));
+    }
+
+    if (typeof space === 'string') {
+        return space.slice(0, 10) || false;
+    }
+
+    return false;
+}
+
+module.exports = {
+    escapableCharCodeSubstitution,
+    isLeadingSurrogate,
+    isTrailingSurrogate,
+    type: {
+        PRIMITIVE: PrimitiveType,
+        PROMISE: PromiseType,
+        ARRAY: ArrayType,
+        OBJECT: ObjectType,
+        STRING_STREAM: ReadableStringType,
+        OBJECT_STREAM: ReadableObjectType
+    },
+
+    isReadableStream,
+    replaceValue,
+    getTypeNative,
+    getTypeAsync,
+    normalizeReplacer,
+    normalizeSpace
+};
diff --git a/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/version.js b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/version.js
new file mode 100644
index 0000000..81f6e78
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@discoveryjs/json-ext/src/version.js
@@ -0,0 +1 @@
+module.exports = require('../package.json').version;
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint-scope/LICENSE b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/LICENSE
new file mode 100644
index 0000000..9e841e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/LICENSE
@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint-scope/README.md b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/README.md
new file mode 100644
index 0000000..81f42d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/README.md
@@ -0,0 +1,84 @@
+# Installation
+> `npm install --save @types/eslint-scope`
+
+# Summary
+This package contains type definitions for eslint-scope (https://github.com/eslint/eslint-scope).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/eslint-scope.
+## [index.d.ts](https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/eslint-scope/index.d.ts)
+````ts
+// Type definitions for eslint-scope 3.7
+// Project: https://github.com/eslint/eslint-scope
+// Definitions by: Toru Nagashima <https://github.com/mysticatea>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+// TypeScript Version: 3.8
+import * as eslint from "eslint";
+import * as estree from "estree";
+
+export const version: string;
+
+export class ScopeManager implements eslint.Scope.ScopeManager {
+    scopes: Scope[];
+    globalScope: Scope;
+    acquire(node: {}, inner?: boolean): Scope | null;
+    getDeclaredVariables(node: {}): Variable[];
+}
+
+export class Scope implements eslint.Scope.Scope {
+    type: "block" | "catch" | "class" | "for" | "function" | "function-expression-name" | "global" | "module" | "switch" | "with" | "TDZ";
+    isStrict: boolean;
+    upper: Scope | null;
+    childScopes: Scope[];
+    variableScope: Scope;
+    block: estree.Node;
+    variables: Variable[];
+    set: Map<string, Variable>;
+    references: Reference[];
+    through: Reference[];
+    functionExpressionScope: boolean;
+}
+
+export class Variable implements eslint.Scope.Variable {
+    name: string;
+    identifiers: estree.Identifier[];
+    references: Reference[];
+    defs: eslint.Scope.Definition[];
+}
+
+export class Reference implements eslint.Scope.Reference {
+    identifier: estree.Identifier;
+    from: Scope;
+    resolved: Variable | null;
+    writeExpr: estree.Node | null;
+    init: boolean;
+
+    isWrite(): boolean;
+    isRead(): boolean;
+    isWriteOnly(): boolean;
+    isReadOnly(): boolean;
+    isReadWrite(): boolean;
+}
+
+export interface AnalysisOptions {
+    optimistic?: boolean;
+    directive?: boolean;
+    ignoreEval?: boolean;
+    nodejsScope?: boolean;
+    impliedStrict?: boolean;
+    fallback?: string | ((node: {}) => string[]);
+    sourceType?: "script" | "module";
+    ecmaVersion?: number;
+}
+
+export function analyze(ast: {}, options?: AnalysisOptions): ScopeManager;
+
+````
+
+### Additional Details
+ * Last updated: Mon, 10 Jan 2022 21:01:33 GMT
+ * Dependencies: [@types/eslint](https://npmjs.com/package/@types/eslint), [@types/estree](https://npmjs.com/package/@types/estree)
+ * Global values: none
+
+# Credits
+These definitions were written by [Toru Nagashima](https://github.com/mysticatea).
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint-scope/index.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/index.d.ts
new file mode 100644
index 0000000..a54941d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/index.d.ts
@@ -0,0 +1,64 @@
+// Type definitions for eslint-scope 3.7
+// Project: https://github.com/eslint/eslint-scope
+// Definitions by: Toru Nagashima <https://github.com/mysticatea>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+// TypeScript Version: 3.8
+import * as eslint from "eslint";
+import * as estree from "estree";
+
+export const version: string;
+
+export class ScopeManager implements eslint.Scope.ScopeManager {
+    scopes: Scope[];
+    globalScope: Scope;
+    acquire(node: {}, inner?: boolean): Scope | null;
+    getDeclaredVariables(node: {}): Variable[];
+}
+
+export class Scope implements eslint.Scope.Scope {
+    type: "block" | "catch" | "class" | "for" | "function" | "function-expression-name" | "global" | "module" | "switch" | "with" | "TDZ";
+    isStrict: boolean;
+    upper: Scope | null;
+    childScopes: Scope[];
+    variableScope: Scope;
+    block: estree.Node;
+    variables: Variable[];
+    set: Map<string, Variable>;
+    references: Reference[];
+    through: Reference[];
+    functionExpressionScope: boolean;
+}
+
+export class Variable implements eslint.Scope.Variable {
+    name: string;
+    identifiers: estree.Identifier[];
+    references: Reference[];
+    defs: eslint.Scope.Definition[];
+}
+
+export class Reference implements eslint.Scope.Reference {
+    identifier: estree.Identifier;
+    from: Scope;
+    resolved: Variable | null;
+    writeExpr: estree.Node | null;
+    init: boolean;
+
+    isWrite(): boolean;
+    isRead(): boolean;
+    isWriteOnly(): boolean;
+    isReadOnly(): boolean;
+    isReadWrite(): boolean;
+}
+
+export interface AnalysisOptions {
+    optimistic?: boolean;
+    directive?: boolean;
+    ignoreEval?: boolean;
+    nodejsScope?: boolean;
+    impliedStrict?: boolean;
+    fallback?: string | ((node: {}) => string[]);
+    sourceType?: "script" | "module";
+    ecmaVersion?: number;
+}
+
+export function analyze(ast: {}, options?: AnalysisOptions): ScopeManager;
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint-scope/package.json b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/package.json
new file mode 100644
index 0000000..9a67ffb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint-scope/package.json
@@ -0,0 +1,28 @@
+{
+    "name": "@types/eslint-scope",
+    "version": "3.7.3",
+    "description": "TypeScript definitions for eslint-scope",
+    "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/eslint-scope",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "Toru Nagashima",
+            "url": "https://github.com/mysticatea",
+            "githubUsername": "mysticatea"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/eslint-scope"
+    },
+    "scripts": {},
+    "dependencies": {
+        "@types/eslint": "*",
+        "@types/estree": "*"
+    },
+    "typesPublisherContentHash": "8e411ace0ab4265f36d35de1569d64466d2b58696d0afdd65620550a4762f1f4",
+    "typeScriptVersion": "3.8"
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/LICENSE b/node_modules/mathjs/examples/node_modules/@types/eslint/LICENSE
new file mode 100644
index 0000000..9e841e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/LICENSE
@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/README.md b/node_modules/mathjs/examples/node_modules/@types/eslint/README.md
new file mode 100644
index 0000000..e2923b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/README.md
@@ -0,0 +1,16 @@
+# Installation
+> `npm install --save @types/eslint`
+
+# Summary
+This package contains type definitions for eslint (https://eslint.org).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/eslint.
+
+### Additional Details
+ * Last updated: Sat, 22 Jan 2022 19:01:30 GMT
+ * Dependencies: [@types/json-schema](https://npmjs.com/package/@types/json-schema), [@types/estree](https://npmjs.com/package/@types/estree)
+ * Global values: none
+
+# Credits
+These definitions were written by [Pierre-Marie Dartus](https://github.com/pmdartus), [Jed Fox](https://github.com/j-f1), [Saad Quadri](https://github.com/saadq), [Jason Kwok](https://github.com/JasonHK), [Brad Zacher](https://github.com/bradzacher), and [JounQin](https://github.com/JounQin).
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/helpers.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/helpers.d.ts
new file mode 100644
index 0000000..0cf2141
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/helpers.d.ts
@@ -0,0 +1,3 @@
+type Prepend<Tuple extends any[], Addend> = ((_: Addend, ..._1: Tuple) => any) extends (..._: infer Result) => any
+    ? Result
+    : never;
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/index.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/index.d.ts
new file mode 100644
index 0000000..1f50fcc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/index.d.ts
@@ -0,0 +1,953 @@
+// Type definitions for eslint 8.4
+// Project: https://eslint.org
+// Definitions by: Pierre-Marie Dartus <https://github.com/pmdartus>
+//                 Jed Fox <https://github.com/j-f1>
+//                 Saad Quadri <https://github.com/saadq>
+//                 Jason Kwok <https://github.com/JasonHK>
+//                 Brad Zacher <https://github.com/bradzacher>
+//                 JounQin <https://github.com/JounQin>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="helpers.d.ts" />
+
+import { JSONSchema4 } from "json-schema";
+import * as ESTree from "estree";
+
+export namespace AST {
+    type TokenType =
+        | "Boolean"
+        | "Null"
+        | "Identifier"
+        | "Keyword"
+        | "Punctuator"
+        | "JSXIdentifier"
+        | "JSXText"
+        | "Numeric"
+        | "String"
+        | "RegularExpression";
+
+    interface Token {
+        type: TokenType;
+        value: string;
+        range: Range;
+        loc: SourceLocation;
+    }
+
+    interface SourceLocation {
+        start: ESTree.Position;
+        end: ESTree.Position;
+    }
+
+    type Range = [number, number];
+
+    interface Program extends ESTree.Program {
+        comments: ESTree.Comment[];
+        tokens: Token[];
+        loc: SourceLocation;
+        range: Range;
+    }
+}
+
+export namespace Scope {
+    interface ScopeManager {
+        scopes: Scope[];
+        globalScope: Scope | null;
+
+        acquire(node: ESTree.Node, inner?: boolean): Scope | null;
+
+        getDeclaredVariables(node: ESTree.Node): Variable[];
+    }
+
+    interface Scope {
+        type:
+            | "block"
+            | "catch"
+            | "class"
+            | "for"
+            | "function"
+            | "function-expression-name"
+            | "global"
+            | "module"
+            | "switch"
+            | "with"
+            | "TDZ";
+        isStrict: boolean;
+        upper: Scope | null;
+        childScopes: Scope[];
+        variableScope: Scope;
+        block: ESTree.Node;
+        variables: Variable[];
+        set: Map<string, Variable>;
+        references: Reference[];
+        through: Reference[];
+        functionExpressionScope: boolean;
+    }
+
+    interface Variable {
+        name: string;
+        identifiers: ESTree.Identifier[];
+        references: Reference[];
+        defs: Definition[];
+    }
+
+    interface Reference {
+        identifier: ESTree.Identifier;
+        from: Scope;
+        resolved: Variable | null;
+        writeExpr: ESTree.Node | null;
+        init: boolean;
+
+        isWrite(): boolean;
+
+        isRead(): boolean;
+
+        isWriteOnly(): boolean;
+
+        isReadOnly(): boolean;
+
+        isReadWrite(): boolean;
+    }
+
+    type DefinitionType =
+        | { type: "CatchClause"; node: ESTree.CatchClause; parent: null }
+        | { type: "ClassName"; node: ESTree.ClassDeclaration | ESTree.ClassExpression; parent: null }
+        | { type: "FunctionName"; node: ESTree.FunctionDeclaration | ESTree.FunctionExpression; parent: null }
+        | { type: "ImplicitGlobalVariable"; node: ESTree.Program; parent: null }
+        | {
+              type: "ImportBinding";
+              node: ESTree.ImportSpecifier | ESTree.ImportDefaultSpecifier | ESTree.ImportNamespaceSpecifier;
+              parent: ESTree.ImportDeclaration;
+          }
+        | {
+              type: "Parameter";
+              node: ESTree.FunctionDeclaration | ESTree.FunctionExpression | ESTree.ArrowFunctionExpression;
+              parent: null;
+          }
+        | { type: "TDZ"; node: any; parent: null }
+        | { type: "Variable"; node: ESTree.VariableDeclarator; parent: ESTree.VariableDeclaration };
+
+    type Definition = DefinitionType & { name: ESTree.Identifier };
+}
+
+//#region SourceCode
+
+export class SourceCode {
+    text: string;
+    ast: AST.Program;
+    lines: string[];
+    hasBOM: boolean;
+    parserServices: SourceCode.ParserServices;
+    scopeManager: Scope.ScopeManager;
+    visitorKeys: SourceCode.VisitorKeys;
+
+    constructor(text: string, ast: AST.Program);
+    constructor(config: SourceCode.Config);
+
+    static splitLines(text: string): string[];
+
+    getText(node?: ESTree.Node, beforeCount?: number, afterCount?: number): string;
+
+    getLines(): string[];
+
+    getAllComments(): ESTree.Comment[];
+
+    getComments(node: ESTree.Node): { leading: ESTree.Comment[]; trailing: ESTree.Comment[] };
+
+    getJSDocComment(node: ESTree.Node): ESTree.Comment | null;
+
+    getNodeByRangeIndex(index: number): ESTree.Node | null;
+
+    isSpaceBetweenTokens(first: AST.Token, second: AST.Token): boolean;
+
+    getLocFromIndex(index: number): ESTree.Position;
+
+    getIndexFromLoc(location: ESTree.Position): number;
+
+    // Inherited methods from TokenStore
+    // ---------------------------------
+
+    getTokenByRangeStart(offset: number, options?: { includeComments: false }): AST.Token | null;
+    getTokenByRangeStart(offset: number, options: { includeComments: boolean }): AST.Token | ESTree.Comment | null;
+
+    getFirstToken: SourceCode.UnaryNodeCursorWithSkipOptions;
+
+    getFirstTokens: SourceCode.UnaryNodeCursorWithCountOptions;
+
+    getLastToken: SourceCode.UnaryNodeCursorWithSkipOptions;
+
+    getLastTokens: SourceCode.UnaryNodeCursorWithCountOptions;
+
+    getTokenBefore: SourceCode.UnaryCursorWithSkipOptions;
+
+    getTokensBefore: SourceCode.UnaryCursorWithCountOptions;
+
+    getTokenAfter: SourceCode.UnaryCursorWithSkipOptions;
+
+    getTokensAfter: SourceCode.UnaryCursorWithCountOptions;
+
+    getFirstTokenBetween: SourceCode.BinaryCursorWithSkipOptions;
+
+    getFirstTokensBetween: SourceCode.BinaryCursorWithCountOptions;
+
+    getLastTokenBetween: SourceCode.BinaryCursorWithSkipOptions;
+
+    getLastTokensBetween: SourceCode.BinaryCursorWithCountOptions;
+
+    getTokensBetween: SourceCode.BinaryCursorWithCountOptions;
+
+    getTokens: ((node: ESTree.Node, beforeCount?: number, afterCount?: number) => AST.Token[]) &
+        SourceCode.UnaryNodeCursorWithCountOptions;
+
+    commentsExistBetween(
+        left: ESTree.Node | AST.Token | ESTree.Comment,
+        right: ESTree.Node | AST.Token | ESTree.Comment,
+    ): boolean;
+
+    getCommentsBefore(nodeOrToken: ESTree.Node | AST.Token): ESTree.Comment[];
+
+    getCommentsAfter(nodeOrToken: ESTree.Node | AST.Token): ESTree.Comment[];
+
+    getCommentsInside(node: ESTree.Node): ESTree.Comment[];
+}
+
+export namespace SourceCode {
+    interface Config {
+        text: string;
+        ast: AST.Program;
+        parserServices?: ParserServices | undefined;
+        scopeManager?: Scope.ScopeManager | undefined;
+        visitorKeys?: VisitorKeys | undefined;
+    }
+
+    type ParserServices = any;
+
+    interface VisitorKeys {
+        [nodeType: string]: string[];
+    }
+
+    interface UnaryNodeCursorWithSkipOptions {
+        <T extends AST.Token>(
+            node: ESTree.Node,
+            options:
+                | ((token: AST.Token) => token is T)
+                | { filter: (token: AST.Token) => token is T; includeComments?: false | undefined; skip?: number | undefined },
+        ): T | null;
+        <T extends AST.Token | ESTree.Comment>(
+            node: ESTree.Node,
+            options: {
+                filter: (tokenOrComment: AST.Token | ESTree.Comment) => tokenOrComment is T;
+                includeComments: boolean;
+                skip?: number | undefined;
+            },
+        ): T | null;
+        (
+            node: ESTree.Node,
+            options?:
+                | { filter?: ((token: AST.Token) => boolean) | undefined; includeComments?: false | undefined; skip?: number | undefined }
+                | ((token: AST.Token) => boolean)
+                | number,
+        ): AST.Token | null;
+        (
+            node: ESTree.Node,
+            options: {
+                filter?: ((token: AST.Token | ESTree.Comment) => boolean) | undefined;
+                includeComments: boolean;
+                skip?: number | undefined;
+            },
+        ): AST.Token | ESTree.Comment | null;
+    }
+
+    interface UnaryNodeCursorWithCountOptions {
+        <T extends AST.Token>(
+            node: ESTree.Node,
+            options:
+                | ((token: AST.Token) => token is T)
+                | { filter: (token: AST.Token) => token is T; includeComments?: false | undefined; count?: number | undefined },
+        ): T[];
+        <T extends AST.Token | ESTree.Comment>(
+            node: ESTree.Node,
+            options: {
+                filter: (tokenOrComment: AST.Token | ESTree.Comment) => tokenOrComment is T;
+                includeComments: boolean;
+                count?: number | undefined;
+            },
+        ): T[];
+        (
+            node: ESTree.Node,
+            options?:
+                | { filter?: ((token: AST.Token) => boolean) | undefined; includeComments?: false | undefined; count?: number | undefined }
+                | ((token: AST.Token) => boolean)
+                | number,
+        ): AST.Token[];
+        (
+            node: ESTree.Node,
+            options: {
+                filter?: ((token: AST.Token | ESTree.Comment) => boolean) | undefined;
+                includeComments: boolean;
+                count?: number | undefined;
+            },
+        ): Array<AST.Token | ESTree.Comment>;
+    }
+
+    interface UnaryCursorWithSkipOptions {
+        <T extends AST.Token>(
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options:
+                | ((token: AST.Token) => token is T)
+                | { filter: (token: AST.Token) => token is T; includeComments?: false | undefined; skip?: number | undefined },
+        ): T | null;
+        <T extends AST.Token | ESTree.Comment>(
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter: (tokenOrComment: AST.Token | ESTree.Comment) => tokenOrComment is T;
+                includeComments: boolean;
+                skip?: number | undefined;
+            },
+        ): T | null;
+        (
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options?:
+                | { filter?: ((token: AST.Token) => boolean) | undefined; includeComments?: false | undefined; skip?: number | undefined }
+                | ((token: AST.Token) => boolean)
+                | number,
+        ): AST.Token | null;
+        (
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter?: ((token: AST.Token | ESTree.Comment) => boolean) | undefined;
+                includeComments: boolean;
+                skip?: number | undefined;
+            },
+        ): AST.Token | ESTree.Comment | null;
+    }
+
+    interface UnaryCursorWithCountOptions {
+        <T extends AST.Token>(
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options:
+                | ((token: AST.Token) => token is T)
+                | { filter: (token: AST.Token) => token is T; includeComments?: false | undefined; count?: number | undefined },
+        ): T[];
+        <T extends AST.Token | ESTree.Comment>(
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter: (tokenOrComment: AST.Token | ESTree.Comment) => tokenOrComment is T;
+                includeComments: boolean;
+                count?: number | undefined;
+            },
+        ): T[];
+        (
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options?:
+                | { filter?: ((token: AST.Token) => boolean) | undefined; includeComments?: false | undefined; count?: number | undefined }
+                | ((token: AST.Token) => boolean)
+                | number,
+        ): AST.Token[];
+        (
+            node: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter?: ((token: AST.Token | ESTree.Comment) => boolean) | undefined;
+                includeComments: boolean;
+                count?: number | undefined;
+            },
+        ): Array<AST.Token | ESTree.Comment>;
+    }
+
+    interface BinaryCursorWithSkipOptions {
+        <T extends AST.Token>(
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options:
+                | ((token: AST.Token) => token is T)
+                | { filter: (token: AST.Token) => token is T; includeComments?: false | undefined; skip?: number | undefined },
+        ): T | null;
+        <T extends AST.Token | ESTree.Comment>(
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter: (tokenOrComment: AST.Token | ESTree.Comment) => tokenOrComment is T;
+                includeComments: boolean;
+                skip?: number | undefined;
+            },
+        ): T | null;
+        (
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options?:
+                | { filter?: ((token: AST.Token) => boolean) | undefined; includeComments?: false | undefined; skip?: number | undefined }
+                | ((token: AST.Token) => boolean)
+                | number,
+        ): AST.Token | null;
+        (
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter?: ((token: AST.Token | ESTree.Comment) => boolean) | undefined;
+                includeComments: boolean;
+                skip?: number | undefined;
+            },
+        ): AST.Token | ESTree.Comment | null;
+    }
+
+    interface BinaryCursorWithCountOptions {
+        <T extends AST.Token>(
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options:
+                | ((token: AST.Token) => token is T)
+                | { filter: (token: AST.Token) => token is T; includeComments?: false | undefined; count?: number | undefined },
+        ): T[];
+        <T extends AST.Token | ESTree.Comment>(
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter: (tokenOrComment: AST.Token | ESTree.Comment) => tokenOrComment is T;
+                includeComments: boolean;
+                count?: number | undefined;
+            },
+        ): T[];
+        (
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options?:
+                | { filter?: ((token: AST.Token) => boolean) | undefined; includeComments?: false | undefined; count?: number | undefined }
+                | ((token: AST.Token) => boolean)
+                | number,
+        ): AST.Token[];
+        (
+            left: ESTree.Node | AST.Token | ESTree.Comment,
+            right: ESTree.Node | AST.Token | ESTree.Comment,
+            options: {
+                filter?: ((token: AST.Token | ESTree.Comment) => boolean) | undefined;
+                includeComments: boolean;
+                count?: number | undefined;
+            },
+        ): Array<AST.Token | ESTree.Comment>;
+    }
+}
+
+//#endregion
+
+export namespace Rule {
+    interface RuleModule {
+        create(context: RuleContext): RuleListener;
+        meta?: RuleMetaData | undefined;
+    }
+
+    type NodeTypes = ESTree.Node["type"];
+    interface NodeListener {
+        ArrayExpression?: ((node: ESTree.ArrayExpression & NodeParentExtension) => void) | undefined;
+        ArrayPattern?: ((node: ESTree.ArrayPattern & NodeParentExtension) => void) | undefined;
+        ArrowFunctionExpression?: ((node: ESTree.ArrowFunctionExpression & NodeParentExtension) => void) | undefined;
+        AssignmentExpression?: ((node: ESTree.AssignmentExpression & NodeParentExtension) => void) | undefined;
+        AssignmentPattern?: ((node: ESTree.AssignmentPattern & NodeParentExtension) => void) | undefined;
+        AwaitExpression?: ((node: ESTree.AwaitExpression & NodeParentExtension) => void) | undefined;
+        BinaryExpression?: ((node: ESTree.BinaryExpression & NodeParentExtension) => void) | undefined;
+        BlockStatement?: ((node: ESTree.BlockStatement & NodeParentExtension) => void) | undefined;
+        BreakStatement?: ((node: ESTree.BreakStatement & NodeParentExtension) => void) | undefined;
+        CallExpression?: ((node: ESTree.CallExpression & NodeParentExtension) => void) | undefined;
+        CatchClause?: ((node: ESTree.CatchClause & NodeParentExtension) => void) | undefined;
+        ChainExpression?: ((node: ESTree.ChainExpression & NodeParentExtension) => void) | undefined;
+        ClassBody?: ((node: ESTree.ClassBody & NodeParentExtension) => void) | undefined;
+        ClassDeclaration?: ((node: ESTree.ClassDeclaration & NodeParentExtension) => void) | undefined;
+        ClassExpression?: ((node: ESTree.ClassExpression & NodeParentExtension) => void) | undefined;
+        ConditionalExpression?: ((node: ESTree.ConditionalExpression & NodeParentExtension) => void) | undefined;
+        ContinueStatement?: ((node: ESTree.ContinueStatement & NodeParentExtension) => void) | undefined;
+        DebuggerStatement?: ((node: ESTree.DebuggerStatement & NodeParentExtension) => void) | undefined;
+        DoWhileStatement?: ((node: ESTree.DoWhileStatement & NodeParentExtension) => void) | undefined;
+        EmptyStatement?: ((node: ESTree.EmptyStatement & NodeParentExtension) => void) | undefined;
+        ExportAllDeclaration?: ((node: ESTree.ExportAllDeclaration & NodeParentExtension) => void) | undefined;
+        ExportDefaultDeclaration?: ((node: ESTree.ExportDefaultDeclaration & NodeParentExtension) => void) | undefined;
+        ExportNamedDeclaration?: ((node: ESTree.ExportNamedDeclaration & NodeParentExtension) => void) | undefined;
+        ExportSpecifier?: ((node: ESTree.ExportSpecifier & NodeParentExtension) => void) | undefined;
+        ExpressionStatement?: ((node: ESTree.ExpressionStatement & NodeParentExtension) => void) | undefined;
+        ForInStatement?: ((node: ESTree.ForInStatement & NodeParentExtension) => void) | undefined;
+        ForOfStatement?: ((node: ESTree.ForOfStatement & NodeParentExtension) => void) | undefined;
+        ForStatement?: ((node: ESTree.ForStatement & NodeParentExtension) => void) | undefined;
+        FunctionDeclaration?: ((node: ESTree.FunctionDeclaration & NodeParentExtension) => void) | undefined;
+        FunctionExpression?: ((node: ESTree.FunctionExpression & NodeParentExtension) => void) | undefined;
+        Identifier?: ((node: ESTree.Identifier & NodeParentExtension) => void) | undefined;
+        IfStatement?: ((node: ESTree.IfStatement & NodeParentExtension) => void) | undefined;
+        ImportDeclaration?: ((node: ESTree.ImportDeclaration & NodeParentExtension) => void) | undefined;
+        ImportDefaultSpecifier?: ((node: ESTree.ImportDefaultSpecifier & NodeParentExtension) => void) | undefined;
+        ImportExpression?: ((node: ESTree.ImportExpression & NodeParentExtension) => void) | undefined;
+        ImportNamespaceSpecifier?: ((node: ESTree.ImportNamespaceSpecifier & NodeParentExtension) => void) | undefined;
+        ImportSpecifier?: ((node: ESTree.ImportSpecifier & NodeParentExtension) => void) | undefined;
+        LabeledStatement?: ((node: ESTree.LabeledStatement & NodeParentExtension) => void) | undefined;
+        Literal?: ((node: ESTree.Literal & NodeParentExtension) => void) | undefined;
+        LogicalExpression?: ((node: ESTree.LogicalExpression & NodeParentExtension) => void) | undefined;
+        MemberExpression?: ((node: ESTree.MemberExpression & NodeParentExtension) => void) | undefined;
+        MetaProperty?: ((node: ESTree.MetaProperty & NodeParentExtension) => void) | undefined;
+        MethodDefinition?: ((node: ESTree.MethodDefinition & NodeParentExtension) => void) | undefined;
+        NewExpression?: ((node: ESTree.NewExpression & NodeParentExtension) => void) | undefined;
+        ObjectExpression?: ((node: ESTree.ObjectExpression & NodeParentExtension) => void) | undefined;
+        ObjectPattern?: ((node: ESTree.ObjectPattern & NodeParentExtension) => void) | undefined;
+        Program?: ((node: ESTree.Program) => void) | undefined;
+        Property?: ((node: ESTree.Property & NodeParentExtension) => void) | undefined;
+        RestElement?: ((node: ESTree.RestElement & NodeParentExtension) => void) | undefined;
+        ReturnStatement?: ((node: ESTree.ReturnStatement & NodeParentExtension) => void) | undefined;
+        SequenceExpression?: ((node: ESTree.SequenceExpression & NodeParentExtension) => void) | undefined;
+        SpreadElement?: ((node: ESTree.SpreadElement & NodeParentExtension) => void) | undefined;
+        Super?: ((node: ESTree.Super & NodeParentExtension) => void) | undefined;
+        SwitchCase?: ((node: ESTree.SwitchCase & NodeParentExtension) => void) | undefined;
+        SwitchStatement?: ((node: ESTree.SwitchStatement & NodeParentExtension) => void) | undefined;
+        TaggedTemplateExpression?: ((node: ESTree.TaggedTemplateExpression & NodeParentExtension) => void) | undefined;
+        TemplateElement?: ((node: ESTree.TemplateElement & NodeParentExtension) => void) | undefined;
+        TemplateLiteral?: ((node: ESTree.TemplateLiteral & NodeParentExtension) => void) | undefined;
+        ThisExpression?: ((node: ESTree.ThisExpression & NodeParentExtension) => void) | undefined;
+        ThrowStatement?: ((node: ESTree.ThrowStatement & NodeParentExtension) => void) | undefined;
+        TryStatement?: ((node: ESTree.TryStatement & NodeParentExtension) => void) | undefined;
+        UnaryExpression?: ((node: ESTree.UnaryExpression & NodeParentExtension) => void) | undefined;
+        UpdateExpression?: ((node: ESTree.UpdateExpression & NodeParentExtension) => void) | undefined;
+        VariableDeclaration?: ((node: ESTree.VariableDeclaration & NodeParentExtension) => void) | undefined;
+        VariableDeclarator?: ((node: ESTree.VariableDeclarator & NodeParentExtension) => void) | undefined;
+        WhileStatement?: ((node: ESTree.WhileStatement & NodeParentExtension) => void) | undefined;
+        WithStatement?: ((node: ESTree.WithStatement & NodeParentExtension) => void) | undefined;
+        YieldExpression?: ((node: ESTree.YieldExpression & NodeParentExtension) => void) | undefined;
+    }
+
+    interface NodeParentExtension {
+        parent: Node;
+    }
+    type Node = ESTree.Node & NodeParentExtension;
+
+    interface RuleListener extends NodeListener {
+        onCodePathStart?(codePath: CodePath, node: Node): void;
+
+        onCodePathEnd?(codePath: CodePath, node: Node): void;
+
+        onCodePathSegmentStart?(segment: CodePathSegment, node: Node): void;
+
+        onCodePathSegmentEnd?(segment: CodePathSegment, node: Node): void;
+
+        onCodePathSegmentLoop?(fromSegment: CodePathSegment, toSegment: CodePathSegment, node: Node): void;
+
+        [key: string]:
+            | ((codePath: CodePath, node: Node) => void)
+            | ((segment: CodePathSegment, node: Node) => void)
+            | ((fromSegment: CodePathSegment, toSegment: CodePathSegment, node: Node) => void)
+            | ((node: Node) => void)
+            | NodeListener[keyof NodeListener]
+            | undefined;
+    }
+
+    interface CodePath {
+        id: string;
+        initialSegment: CodePathSegment;
+        finalSegments: CodePathSegment[];
+        returnedSegments: CodePathSegment[];
+        thrownSegments: CodePathSegment[];
+        currentSegments: CodePathSegment[];
+        upper: CodePath | null;
+        childCodePaths: CodePath[];
+    }
+
+    interface CodePathSegment {
+        id: string;
+        nextSegments: CodePathSegment[];
+        prevSegments: CodePathSegment[];
+        reachable: boolean;
+    }
+
+    interface RuleMetaData {
+        docs?: {
+            /** provides the short description of the rule in the [rules index](https://eslint.org/docs/rules/) */
+            description?: string | undefined;
+            /** specifies the heading under which the rule is listed in the [rules index](https://eslint.org/docs/rules/) */
+            category?: string | undefined;
+            /** is whether the `"extends": "eslint:recommended"` property in a [configuration file](https://eslint.org/docs/user-guide/configuring#extending-configuration-files) enables the rule */
+            recommended?: boolean | undefined;
+            /** specifies the URL at which the full documentation can be accessed */
+            url?: string | undefined;
+            /** specifies whether rules can return suggestions (defaults to false if omitted) */
+            suggestion?: boolean | undefined;
+        } | undefined;
+        messages?: { [messageId: string]: string } | undefined;
+        fixable?: "code" | "whitespace" | undefined;
+        schema?: JSONSchema4 | JSONSchema4[] | undefined;
+        deprecated?: boolean | undefined;
+        type?: "problem" | "suggestion" | "layout" | undefined;
+        /** specifies whether rules can return suggestions (defaults to false if omitted) */
+        hasSuggestions?: boolean | undefined;
+    }
+
+    interface RuleContext {
+        id: string;
+        options: any[];
+        settings: { [name: string]: any };
+        parserPath: string;
+        parserOptions: Linter.ParserOptions;
+        parserServices: SourceCode.ParserServices;
+
+        getAncestors(): ESTree.Node[];
+
+        getDeclaredVariables(node: ESTree.Node): Scope.Variable[];
+
+        getFilename(): string;
+
+        getPhysicalFilename(): string;
+
+        getCwd(): string;
+
+        getScope(): Scope.Scope;
+
+        getSourceCode(): SourceCode;
+
+        markVariableAsUsed(name: string): boolean;
+
+        report(descriptor: ReportDescriptor): void;
+    }
+
+    type ReportFixer = (fixer: RuleFixer) => null | Fix | IterableIterator<Fix> | Fix[];
+
+    interface ReportDescriptorOptionsBase {
+        data?: { [key: string]: string };
+
+        fix?: null | ReportFixer;
+    }
+
+    interface SuggestionReportOptions {
+        data?: { [key: string]: string };
+
+        fix: ReportFixer;
+    }
+
+    type SuggestionDescriptorMessage = { desc: string } | { messageId: string };
+    type SuggestionReportDescriptor = SuggestionDescriptorMessage & SuggestionReportOptions;
+
+    interface ReportDescriptorOptions extends ReportDescriptorOptionsBase {
+        suggest?: SuggestionReportDescriptor[] | null | undefined;
+    }
+
+    type ReportDescriptor = ReportDescriptorMessage & ReportDescriptorLocation & ReportDescriptorOptions;
+    type ReportDescriptorMessage = { message: string } | { messageId: string };
+    type ReportDescriptorLocation =
+        | { node: ESTree.Node }
+        | { loc: AST.SourceLocation | { line: number; column: number } };
+
+    interface RuleFixer {
+        insertTextAfter(nodeOrToken: ESTree.Node | AST.Token, text: string): Fix;
+
+        insertTextAfterRange(range: AST.Range, text: string): Fix;
+
+        insertTextBefore(nodeOrToken: ESTree.Node | AST.Token, text: string): Fix;
+
+        insertTextBeforeRange(range: AST.Range, text: string): Fix;
+
+        remove(nodeOrToken: ESTree.Node | AST.Token): Fix;
+
+        removeRange(range: AST.Range): Fix;
+
+        replaceText(nodeOrToken: ESTree.Node | AST.Token, text: string): Fix;
+
+        replaceTextRange(range: AST.Range, text: string): Fix;
+    }
+
+    interface Fix {
+        range: AST.Range;
+        text: string;
+    }
+}
+
+//#region Linter
+
+export class Linter {
+    static version: string;
+
+    version: string;
+
+    constructor(options?: { cwd?: string | undefined });
+
+    verify(code: SourceCode | string, config: Linter.Config, filename?: string): Linter.LintMessage[];
+    verify(code: SourceCode | string, config: Linter.Config, options: Linter.LintOptions): Linter.LintMessage[];
+
+    verifyAndFix(code: string, config: Linter.Config, filename?: string): Linter.FixReport;
+    verifyAndFix(code: string, config: Linter.Config, options: Linter.FixOptions): Linter.FixReport;
+
+    getSourceCode(): SourceCode;
+
+    defineRule(name: string, rule: Rule.RuleModule): void;
+
+    defineRules(rules: { [name: string]: Rule.RuleModule }): void;
+
+    getRules(): Map<string, Rule.RuleModule>;
+
+    defineParser(name: string, parser: Linter.ParserModule): void;
+}
+
+export namespace Linter {
+    type Severity = 0 | 1 | 2;
+
+    type RuleLevel = Severity | "off" | "warn" | "error";
+    type RuleLevelAndOptions<Options extends any[] = any[]> = Prepend<Partial<Options>, RuleLevel>;
+
+    type RuleEntry<Options extends any[] = any[]> = RuleLevel | RuleLevelAndOptions<Options>;
+
+    interface RulesRecord {
+        [rule: string]: RuleEntry;
+    }
+
+    interface HasRules<Rules extends RulesRecord = RulesRecord> {
+        rules?: Partial<Rules> | undefined;
+    }
+
+    interface BaseConfig<Rules extends RulesRecord = RulesRecord> extends HasRules<Rules> {
+        $schema?: string | undefined;
+        env?: { [name: string]: boolean } | undefined;
+        extends?: string | string[] | undefined;
+        globals?: { [name: string]: boolean | "readonly" | "readable" | "writable" | "writeable" } | undefined;
+        noInlineConfig?: boolean | undefined;
+        overrides?: ConfigOverride[] | undefined;
+        parser?: string | undefined;
+        parserOptions?: ParserOptions | undefined;
+        plugins?: string[] | undefined;
+        processor?: string | undefined;
+        reportUnusedDisableDirectives?: boolean | undefined;
+        settings?: { [name: string]: any } | undefined;
+    }
+
+    interface ConfigOverride<Rules extends RulesRecord = RulesRecord> extends BaseConfig<Rules> {
+        excludedFiles?: string | string[] | undefined;
+        files: string | string[];
+    }
+
+    // https://github.com/eslint/eslint/blob/v6.8.0/conf/config-schema.js
+    interface Config<Rules extends RulesRecord = RulesRecord> extends BaseConfig<Rules> {
+        ignorePatterns?: string | string[] | undefined;
+        root?: boolean | undefined;
+    }
+
+    interface ParserOptions {
+        ecmaVersion?: 3 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | "latest" | undefined;
+        sourceType?: "script" | "module" | undefined;
+        ecmaFeatures?: {
+            globalReturn?: boolean | undefined;
+            impliedStrict?: boolean | undefined;
+            jsx?: boolean | undefined;
+            experimentalObjectRestSpread?: boolean | undefined;
+            [key: string]: any;
+        } | undefined;
+        [key: string]: any;
+    }
+
+    interface LintOptions {
+        filename?: string | undefined;
+        preprocess?: ((code: string) => string[]) | undefined;
+        postprocess?: ((problemLists: LintMessage[][]) => LintMessage[]) | undefined;
+        filterCodeBlock?: boolean | undefined;
+        disableFixes?: boolean | undefined;
+        allowInlineConfig?: boolean | undefined;
+        reportUnusedDisableDirectives?: boolean | undefined;
+    }
+
+    interface LintSuggestion {
+        desc: string;
+        fix: Rule.Fix;
+        messageId?: string | undefined;
+    }
+
+    interface LintMessage {
+        column: number;
+        line: number;
+        endColumn?: number | undefined;
+        endLine?: number | undefined;
+        ruleId: string | null;
+        message: string;
+        messageId?: string | undefined;
+        nodeType?: string | undefined;
+        fatal?: true | undefined;
+        severity: Severity;
+        fix?: Rule.Fix | undefined;
+        /** @deprecated Use `linter.getSourceCode()` */
+        source?: string | null | undefined;
+        suggestions?: LintSuggestion[] | undefined;
+    }
+
+    interface FixOptions extends LintOptions {
+        fix?: boolean | undefined;
+    }
+
+    interface FixReport {
+        fixed: boolean;
+        output: string;
+        messages: LintMessage[];
+    }
+
+    type ParserModule =
+        | {
+              parse(text: string, options?: any): AST.Program;
+          }
+        | {
+              parseForESLint(text: string, options?: any): ESLintParseResult;
+          };
+
+    interface ESLintParseResult {
+        ast: AST.Program;
+        parserServices?: SourceCode.ParserServices | undefined;
+        scopeManager?: Scope.ScopeManager | undefined;
+        visitorKeys?: SourceCode.VisitorKeys | undefined;
+    }
+
+    interface ProcessorFile {
+        text: string;
+        filename: string;
+    }
+
+    // https://eslint.org/docs/developer-guide/working-with-plugins#processors-in-plugins
+    interface Processor<T extends string | ProcessorFile = string | ProcessorFile> {
+        supportsAutofix?: boolean | undefined;
+        preprocess?(text: string, filename: string): T[];
+        postprocess?(messages: LintMessage[][], filename: string): LintMessage[];
+    }
+}
+
+//#endregion
+
+//#region ESLint
+
+export class ESLint {
+    static version: string;
+
+    static outputFixes(results: ESLint.LintResult[]): Promise<void>;
+
+    static getErrorResults(results: ESLint.LintResult[]): ESLint.LintResult[];
+
+    constructor(options?: ESLint.Options);
+
+    lintFiles(patterns: string | string[]): Promise<ESLint.LintResult[]>;
+
+    lintText(code: string, options?: { filePath?: string | undefined; warnIgnored?: boolean | undefined }): Promise<ESLint.LintResult[]>;
+
+    getRulesMetaForResults(results: ESLint.LintResult[]): ESLint.LintResultData['rulesMeta'];
+
+    calculateConfigForFile(filePath: string): Promise<any>;
+
+    isPathIgnored(filePath: string): Promise<boolean>;
+
+    loadFormatter(nameOrPath?: string): Promise<ESLint.Formatter>;
+}
+
+export namespace ESLint {
+    interface Options {
+        // File enumeration
+        cwd?: string | undefined;
+        errorOnUnmatchedPattern?: boolean | undefined;
+        extensions?: string[] | undefined;
+        globInputPaths?: boolean | undefined;
+        ignore?: boolean | undefined;
+        ignorePath?: string | undefined;
+
+        // Linting
+        allowInlineConfig?: boolean | undefined;
+        baseConfig?: Linter.Config | undefined;
+        overrideConfig?: Linter.Config | undefined;
+        overrideConfigFile?: string | undefined;
+        plugins?: Record<string, any> | undefined;
+        reportUnusedDisableDirectives?: Linter.RuleLevel | undefined;
+        resolvePluginsRelativeTo?: string | undefined;
+        rulePaths?: string[] | undefined;
+        useEslintrc?: boolean | undefined;
+
+        // Autofix
+        fix?: boolean | ((message: Linter.LintMessage) => boolean) | undefined;
+        fixTypes?: Array<Rule.RuleMetaData["type"]> | undefined;
+
+        // Cache-related
+        cache?: boolean | undefined;
+        cacheLocation?: string | undefined;
+        cacheStrategy?: "content" | "metadata" | undefined;
+    }
+
+    interface LintResult {
+        filePath: string;
+        messages: Linter.LintMessage[];
+        errorCount: number;
+        fatalErrorCount: number;
+        warningCount: number;
+        fixableErrorCount: number;
+        fixableWarningCount: number;
+        output?: string | undefined;
+        source?: string | undefined;
+        usedDeprecatedRules: DeprecatedRuleUse[];
+    }
+
+    interface LintResultData {
+        cwd: string;
+        rulesMeta: {
+            [ruleId: string]: Rule.RuleMetaData;
+        };
+    }
+
+    interface DeprecatedRuleUse {
+        ruleId: string;
+        replacedBy: string[];
+    }
+
+    interface Formatter {
+        format(results: LintResult[], data?: LintResultData): string | Promise<string>;
+    }
+
+    // Docs reference the type by this name
+    type EditInfo = Rule.Fix;
+}
+
+//#endregion
+
+//#region RuleTester
+
+export class RuleTester {
+    constructor(config?: any);
+
+    run(
+        name: string,
+        rule: Rule.RuleModule,
+        tests: {
+            valid?: Array<string | RuleTester.ValidTestCase> | undefined;
+            invalid?: RuleTester.InvalidTestCase[] | undefined;
+        },
+    ): void;
+
+    static only(
+        item: string | RuleTester.ValidTestCase | RuleTester.InvalidTestCase,
+    ): RuleTester.ValidTestCase | RuleTester.InvalidTestCase;
+}
+
+export namespace RuleTester {
+    interface ValidTestCase {
+        name?: string;
+        code: string;
+        options?: any;
+        filename?: string | undefined;
+        only?: boolean;
+        parserOptions?: Linter.ParserOptions | undefined;
+        settings?: { [name: string]: any } | undefined;
+        parser?: string | undefined;
+        globals?: { [name: string]: boolean } | undefined;
+    }
+
+    interface SuggestionOutput {
+        messageId?: string | undefined;
+        desc?: string | undefined;
+        data?: Record<string, unknown> | undefined;
+        output: string;
+    }
+
+    interface InvalidTestCase extends ValidTestCase {
+        errors: number | Array<TestCaseError | string>;
+        output?: string | null | undefined;
+    }
+
+    interface TestCaseError {
+        message?: string | RegExp | undefined;
+        messageId?: string | undefined;
+        type?: string | undefined;
+        data?: any;
+        line?: number | undefined;
+        column?: number | undefined;
+        endLine?: number | undefined;
+        endColumn?: number | undefined;
+        suggestions?: SuggestionOutput[] | undefined;
+    }
+}
+
+//#endregion
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/package.json b/node_modules/mathjs/examples/node_modules/@types/eslint/package.json
new file mode 100644
index 0000000..71fdf84
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/package.json
@@ -0,0 +1,65 @@
+{
+    "name": "@types/eslint",
+    "version": "8.4.1",
+    "description": "TypeScript definitions for eslint",
+    "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/eslint",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "Pierre-Marie Dartus",
+            "url": "https://github.com/pmdartus",
+            "githubUsername": "pmdartus"
+        },
+        {
+            "name": "Jed Fox",
+            "url": "https://github.com/j-f1",
+            "githubUsername": "j-f1"
+        },
+        {
+            "name": "Saad Quadri",
+            "url": "https://github.com/saadq",
+            "githubUsername": "saadq"
+        },
+        {
+            "name": "Jason Kwok",
+            "url": "https://github.com/JasonHK",
+            "githubUsername": "JasonHK"
+        },
+        {
+            "name": "Brad Zacher",
+            "url": "https://github.com/bradzacher",
+            "githubUsername": "bradzacher"
+        },
+        {
+            "name": "JounQin",
+            "url": "https://github.com/JounQin",
+            "githubUsername": "JounQin"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/eslint"
+    },
+    "scripts": {},
+    "dependencies": {
+        "@types/estree": "*",
+        "@types/json-schema": "*"
+    },
+    "typesPublisherContentHash": "90cb9cf20ae7859ce7f641c07d2d274a142d14ed7b4824a89b6abc48c961d03f",
+    "typeScriptVersion": "3.8",
+    "exports": {
+        ".": {
+            "types": "./index.d.ts"
+        },
+        "./use-at-your-own-risk": {
+            "types": "./use-at-your-own-risk.d.ts"
+        },
+        "./rules": {
+            "types": "./rules/index.d.ts"
+        },
+        "./package.json": "./package.json"
+    }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/best-practices.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/best-practices.d.ts
new file mode 100644
index 0000000..68be5d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/best-practices.d.ts
@@ -0,0 +1,931 @@
+import { Linter } from "../index";
+
+export interface BestPractices extends Linter.RulesRecord {
+    /**
+     * Rule to enforce getter and setter pairs in objects.
+     *
+     * @since 0.22.0
+     * @see https://eslint.org/docs/rules/accessor-pairs
+     */
+    "accessor-pairs": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                setWithoutGet: boolean;
+                /**
+                 * @default false
+                 */
+                getWithoutSet: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce `return` statements in callbacks of array methods.
+     *
+     * @since 2.0.0-alpha-1
+     * @see https://eslint.org/docs/rules/array-callback-return
+     */
+    "array-callback-return": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowImplicit: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce the use of variables within the scope they are defined.
+     *
+     * @since 0.1.0
+     * @see https://eslint.org/docs/rules/block-scoped-var
+     */
+    "block-scoped-var": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce that class methods utilize `this`.
+     *
+     * @since 3.4.0
+     * @see https://eslint.org/docs/rules/class-methods-use-this
+     */
+    "class-methods-use-this": Linter.RuleEntry<
+        [
+            Partial<{
+                exceptMethods: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum cyclomatic complexity allowed in a program.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/complexity
+     */
+    complexity: Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default 20
+                   */
+                  max: number;
+                  /**
+                   * @deprecated
+                   * @default 20
+                   */
+                  maximum: number;
+              }>
+            | number,
+        ]
+    >;
+
+    /**
+     * Rule to require `return` statements to either always or never specify values.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/consistent-return
+     */
+    "consistent-return": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                treatUndefinedAsUnspecified: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent brace style for all control statements.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/curly
+     */
+    curly: Linter.RuleEntry<["all" | "multi" | "multi-line" | "multi-or-nest" | "consistent"]>;
+
+    /**
+     * Rule to require `default` cases in `switch` statements.
+     *
+     * @since 0.6.0
+     * @see https://eslint.org/docs/rules/default-case
+     */
+    "default-case": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default '^no default$'
+                 */
+                commentPattern: string;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent newlines before and after dots.
+     *
+     * @since 0.21.0
+     * @see https://eslint.org/docs/rules/dot-location
+     */
+    "dot-location": Linter.RuleEntry<["object" | "property"]>;
+
+    /**
+     * Rule to enforce dot notation whenever possible.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/dot-notation
+     */
+    "dot-notation": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                allowKeywords: boolean;
+                allowPattern: string;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require the use of `===` and `!==`.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/eqeqeq
+     */
+    eqeqeq:
+        | Linter.RuleEntry<
+              [
+                  "always",
+                  Partial<{
+                      /**
+                       * @default 'always'
+                       */
+                      null: "always" | "never" | "ignore";
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<["smart" | "allow-null"]>;
+
+    /**
+     * Rule to require `for-in` loops to include an `if` statement.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/guard-for-in
+     */
+    "guard-for-in": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce a maximum number of classes per file.
+     *
+     * @since 5.0.0-alpha.3
+     * @see https://eslint.org/docs/rules/max-classes-per-file
+     */
+    "max-classes-per-file": Linter.RuleEntry<[number]>;
+
+    /**
+     * Rule to disallow the use of `alert`, `confirm`, and `prompt`.
+     *
+     * @since 0.0.5
+     * @see https://eslint.org/docs/rules/no-alert
+     */
+    "no-alert": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of `arguments.caller` or `arguments.callee`.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/no-caller
+     */
+    "no-caller": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow lexical declarations in case clauses.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 1.9.0
+     * @see https://eslint.org/docs/rules/no-case-declarations
+     */
+    "no-case-declarations": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow division operators explicitly at the beginning of regular expressions.
+     *
+     * @since 0.1.0
+     * @see https://eslint.org/docs/rules/no-div-regex
+     */
+    "no-div-regex": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `else` blocks after `return` statements in `if` statements.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-else-return
+     */
+    "no-else-return": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                allowElseIf: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow empty functions.
+     *
+     * @since 2.0.0
+     * @see https://eslint.org/docs/rules/no-empty-function
+     */
+    "no-empty-function": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default []
+                 */
+                allow: Array<
+                    | "functions"
+                    | "arrowFunctions"
+                    | "generatorFunctions"
+                    | "methods"
+                    | "generatorMethods"
+                    | "getters"
+                    | "setters"
+                    | "constructors"
+                >;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow empty destructuring patterns.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 1.7.0
+     * @see https://eslint.org/docs/rules/no-empty-pattern
+     */
+    "no-empty-pattern": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `null` comparisons without type-checking operators.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-eq-null
+     */
+    "no-eq-null": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of `eval()`.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/no-eval
+     */
+    "no-eval": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowIndirect: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow extending native types.
+     *
+     * @since 0.1.4
+     * @see https://eslint.org/docs/rules/no-extend-native
+     */
+    "no-extend-native": Linter.RuleEntry<
+        [
+            Partial<{
+                exceptions: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow unnecessary calls to `.bind()`.
+     *
+     * @since 0.8.0
+     * @see https://eslint.org/docs/rules/no-extra-bind
+     */
+    "no-extra-bind": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary labels.
+     *
+     * @since 2.0.0-rc.0
+     * @see https://eslint.org/docs/rules/no-extra-label
+     */
+    "no-extra-label": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow fallthrough of `case` statements.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/no-fallthrough
+     */
+    "no-fallthrough": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 'falls?\s?through'
+                 */
+                commentPattern: string;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow leading or trailing decimal points in numeric literals.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/no-floating-decimal
+     */
+    "no-floating-decimal": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow assignments to native objects or read-only global variables.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 3.3.0
+     * @see https://eslint.org/docs/rules/no-global-assign
+     */
+    "no-global-assign": Linter.RuleEntry<
+        [
+            Partial<{
+                exceptions: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow shorthand type conversions.
+     *
+     * @since 1.0.0-rc-2
+     * @see https://eslint.org/docs/rules/no-implicit-coercion
+     */
+    "no-implicit-coercion": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                boolean: boolean;
+                /**
+                 * @default true
+                 */
+                number: boolean;
+                /**
+                 * @default true
+                 */
+                string: boolean;
+                /**
+                 * @default []
+                 */
+                allow: Array<"~" | "!!" | "+" | "*">;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow variable and `function` declarations in the global scope.
+     *
+     * @since 2.0.0-alpha-1
+     * @see https://eslint.org/docs/rules/no-implicit-globals
+     */
+    "no-implicit-globals": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of `eval()`-like methods.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/no-implied-eval
+     */
+    "no-implied-eval": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `this` keywords outside of classes or class-like objects.
+     *
+     * @since 1.0.0-rc-2
+     * @see https://eslint.org/docs/rules/no-invalid-this
+     */
+    "no-invalid-this": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of the `__iterator__` property.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-iterator
+     */
+    "no-iterator": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow labeled statements.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-labels
+     */
+    "no-labels": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowLoop: boolean;
+                /**
+                 * @default false
+                 */
+                allowSwitch: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow unnecessary nested blocks.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-lone-blocks
+     */
+    "no-lone-blocks": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow function declarations that contain unsafe references inside loop statements.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-loop-func
+     */
+    "no-loop-func": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow magic numbers.
+     *
+     * @since 1.7.0
+     * @see https://eslint.org/docs/rules/no-magic-numbers
+     */
+    "no-magic-numbers": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default []
+                 */
+                ignore: number[];
+                /**
+                 * @default false
+                 */
+                ignoreArrayIndexes: boolean;
+                /**
+                 * @default false
+                 */
+                enforceConst: boolean;
+                /**
+                 * @default false
+                 */
+                detectObjects: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow multiple spaces.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/no-multi-spaces
+     */
+    "no-multi-spaces": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                ignoreEOLComments: boolean;
+                /**
+                 * @default { Property: true }
+                 */
+                exceptions: Record<string, boolean>;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow multiline strings.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-multi-str
+     */
+    "no-multi-str": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `new` operators outside of assignments or comparisons.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/no-new
+     */
+    "no-new": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `new` operators with the `Function` object.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/no-new-func
+     */
+    "no-new-func": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `new` operators with the `String`, `Number`, and `Boolean` objects.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/no-new-wrappers
+     */
+    "no-new-wrappers": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow octal literals.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/no-octal
+     */
+    "no-octal": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow octal escape sequences in string literals.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-octal-escape
+     */
+    "no-octal-escape": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow reassigning `function` parameters.
+     *
+     * @since 0.18.0
+     * @see https://eslint.org/docs/rules/no-param-reassign
+     */
+    "no-param-reassign": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                props: boolean;
+                /**
+                 * @default []
+                 */
+                ignorePropertyModificationsFor: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow the use of the `__proto__` property.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-proto
+     */
+    "no-proto": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow variable redeclaration.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-redeclare
+     */
+    "no-redeclare": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                builtinGlobals: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow certain properties on certain objects.
+     *
+     * @since 3.5.0
+     * @see https://eslint.org/docs/rules/no-restricted-properties
+     */
+    "no-restricted-properties": Linter.RuleEntry<
+        [
+            ...Array<
+                | {
+                      object: string;
+                      property?: string | undefined;
+                      message?: string | undefined;
+                  }
+                | {
+                      property: string;
+                      message?: string | undefined;
+                  }
+            >
+        ]
+    >;
+
+    /**
+     * Rule to disallow assignment operators in `return` statements.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-return-assign
+     */
+    "no-return-assign": Linter.RuleEntry<["except-parens" | "always"]>;
+
+    /**
+     * Rule to disallow unnecessary `return await`.
+     *
+     * @since 3.10.0
+     * @see https://eslint.org/docs/rules/no-return-await
+     */
+    "no-return-await": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `javascript:` urls.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-script-url
+     */
+    "no-script-url": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow assignments where both sides are exactly the same.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 2.0.0-rc.0
+     * @see https://eslint.org/docs/rules/no-self-assign
+     */
+    "no-self-assign": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow comparisons where both sides are exactly the same.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-self-compare
+     */
+    "no-self-compare": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow comma operators.
+     *
+     * @since 0.5.1
+     * @see https://eslint.org/docs/rules/no-sequences
+     */
+    "no-sequences": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow throwing literals as exceptions.
+     *
+     * @since 0.15.0
+     * @see https://eslint.org/docs/rules/no-throw-literal
+     */
+    "no-throw-literal": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unmodified loop conditions.
+     *
+     * @since 2.0.0-alpha-2
+     * @see https://eslint.org/docs/rules/no-unmodified-loop-condition
+     */
+    "no-unmodified-loop-condition": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unused expressions.
+     *
+     * @since 0.1.0
+     * @see https://eslint.org/docs/rules/no-unused-expressions
+     */
+    "no-unused-expressions": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowShortCircuit: boolean;
+                /**
+                 * @default false
+                 */
+                allowTernary: boolean;
+                /**
+                 * @default false
+                 */
+                allowTaggedTemplates: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow unused labels.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 2.0.0-rc.0
+     * @see https://eslint.org/docs/rules/no-unused-labels
+     */
+    "no-unused-labels": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary calls to `.call()` and `.apply()`.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/no-useless-call
+     */
+    "no-useless-call": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary `catch` clauses.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 5.11.0
+     * @see https://eslint.org/docs/rules/no-useless-catch
+     */
+    "no-useless-catch": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary concatenation of literals or template literals.
+     *
+     * @since 1.3.0
+     * @see https://eslint.org/docs/rules/no-useless-concat
+     */
+    "no-useless-concat": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary escape characters.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 2.5.0
+     * @see https://eslint.org/docs/rules/no-useless-escape
+     */
+    "no-useless-escape": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow redundant return statements.
+     *
+     * @since 3.9.0
+     * @see https://eslint.org/docs/rules/no-useless-return
+     */
+    "no-useless-return": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `void` operators.
+     *
+     * @since 0.8.0
+     * @see https://eslint.org/docs/rules/no-void
+     */
+    "no-void": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow specified warning terms in comments.
+     *
+     * @since 0.4.4
+     * @see https://eslint.org/docs/rules/no-warning-comments
+     */
+    "no-warning-comments": Linter.RuleEntry<
+        [
+            {
+                /**
+                 * @default ["todo", "fixme", "xxx"]
+                 */
+                terms: string[];
+                /**
+                 * @default 'start'
+                 */
+                location: "start" | "anywhere";
+            },
+        ]
+    >;
+
+    /**
+     * Rule to disallow `with` statements.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/no-with
+     */
+    "no-with": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce using named capture group in regular expression.
+     *
+     * @since 5.15.0
+     * @see https://eslint.org/docs/rules/prefer-named-capture-group
+     */
+    "prefer-named-capture-group": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require using Error objects as Promise rejection reasons.
+     *
+     * @since 3.14.0
+     * @see https://eslint.org/docs/rules/prefer-promise-reject-errors
+     */
+    "prefer-promise-reject-errors": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowEmptyReject: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce the consistent use of the radix argument when using `parseInt()`.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/radix
+     */
+    radix: Linter.RuleEntry<["always" | "as-needed"]>;
+
+    /**
+     * Rule to disallow async functions which have no `await` expression.
+     *
+     * @since 3.11.0
+     * @see https://eslint.org/docs/rules/require-await
+     */
+    "require-await": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce the use of `u` flag on RegExp.
+     *
+     * @since 5.3.0
+     * @see https://eslint.org/docs/rules/require-unicode-regexp
+     */
+    "require-unicode-regexp": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require `var` declarations be placed at the top of their containing scope.
+     *
+     * @since 0.8.0
+     * @see https://eslint.org/docs/rules/vars-on-top
+     */
+    "vars-on-top": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require parentheses around immediate `function` invocations.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/wrap-iife
+     */
+    "wrap-iife": Linter.RuleEntry<
+        [
+            "outside" | "inside" | "any",
+            Partial<{
+                /**
+                 * @default false
+                 */
+                functionPrototypeMethods: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow “Yoda” conditions.
+     *
+     * @since 0.7.1
+     * @see https://eslint.org/docs/rules/yoda
+     */
+    yoda:
+        | Linter.RuleEntry<
+              [
+                  "never",
+                  Partial<{
+                      exceptRange: boolean;
+                      onlyEquality: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<["always"]>;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/deprecated.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/deprecated.d.ts
new file mode 100644
index 0000000..f18607c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/deprecated.d.ts
@@ -0,0 +1,267 @@
+import { Linter } from "../index";
+
+export interface Deprecated extends Linter.RulesRecord {
+    /**
+     * Rule to enforce consistent indentation.
+     *
+     * @since 4.0.0-alpha.0
+     * @deprecated since 4.0.0, use [`indent`](https://eslint.org/docs/rules/indent) instead.
+     * @see https://eslint.org/docs/rules/indent-legacy
+     */
+    "indent-legacy": Linter.RuleEntry<
+        [
+            number | "tab",
+            Partial<{
+                /**
+                 * @default 0
+                 */
+                SwitchCase: number;
+                /**
+                 * @default 1
+                 */
+                VariableDeclarator:
+                    | Partial<{
+                          /**
+                           * @default 1
+                           */
+                          var: number | "first";
+                          /**
+                           * @default 1
+                           */
+                          let: number | "first";
+                          /**
+                           * @default 1
+                           */
+                          const: number | "first";
+                      }>
+                    | number
+                    | "first";
+                /**
+                 * @default 1
+                 */
+                outerIIFEBody: number;
+                /**
+                 * @default 1
+                 */
+                MemberExpression: number | "off";
+                /**
+                 * @default { parameters: 1, body: 1 }
+                 */
+                FunctionDeclaration: Partial<{
+                    /**
+                     * @default 1
+                     */
+                    parameters: number | "first" | "off";
+                    /**
+                     * @default 1
+                     */
+                    body: number;
+                }>;
+                /**
+                 * @default { parameters: 1, body: 1 }
+                 */
+                FunctionExpression: Partial<{
+                    /**
+                     * @default 1
+                     */
+                    parameters: number | "first" | "off";
+                    /**
+                     * @default 1
+                     */
+                    body: number;
+                }>;
+                /**
+                 * @default { arguments: 1 }
+                 */
+                CallExpression: Partial<{
+                    /**
+                     * @default 1
+                     */
+                    arguments: number | "first" | "off";
+                }>;
+                /**
+                 * @default 1
+                 */
+                ArrayExpression: number | "first" | "off";
+                /**
+                 * @default 1
+                 */
+                ObjectExpression: number | "first" | "off";
+                /**
+                 * @default 1
+                 */
+                ImportDeclaration: number | "first" | "off";
+                /**
+                 * @default false
+                 */
+                flatTernaryExpressions: boolean;
+                ignoredNodes: string[];
+                /**
+                 * @default false
+                 */
+                ignoreComments: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow newlines around directives.
+     *
+     * @since 3.5.0
+     * @deprecated since 4.0.0, use [`padding-line-between-statements`](https://eslint.org/docs/rules/padding-line-between-statements) instead.
+     * @see https://eslint.org/docs/rules/lines-around-directive
+     */
+    "lines-around-directive": Linter.RuleEntry<["always" | "never"]>;
+
+    /**
+     * Rule to require or disallow an empty line after variable declarations.
+     *
+     * @since 0.18.0
+     * @deprecated since 4.0.0, use [`padding-line-between-statements`](https://eslint.org/docs/rules/padding-line-between-statements) instead.
+     * @see https://eslint.org/docs/rules/newline-after-var
+     */
+    "newline-after-var": Linter.RuleEntry<["always" | "never"]>;
+
+    /**
+     * Rule to require an empty line before `return` statements.
+     *
+     * @since 2.3.0
+     * @deprecated since 4.0.0, use [`padding-line-between-statements`](https://eslint.org/docs/rules/padding-line-between-statements) instead.
+     * @see https://eslint.org/docs/rules/newline-before-return
+     */
+    "newline-before-return": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow shadowing of variables inside of `catch`.
+     *
+     * @since 0.0.9
+     * @deprecated since 5.1.0, use [`no-shadow`](https://eslint.org/docs/rules/no-shadow) instead.
+     * @see https://eslint.org/docs/rules/no-catch-shadow
+     */
+    "no-catch-shadow": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow reassignment of native objects.
+     *
+     * @since 0.0.9
+     * @deprecated since 3.3.0, use [`no-global-assign`](https://eslint.org/docs/rules/no-global-assign) instead.
+     * @see https://eslint.org/docs/rules/no-native-reassign
+     */
+    "no-native-reassign": Linter.RuleEntry<
+        [
+            Partial<{
+                exceptions: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow negating the left operand in `in` expressions.
+     *
+     * @since 0.1.2
+     * @deprecated since 3.3.0, use [`no-unsafe-negation`](https://eslint.org/docs/rules/no-unsafe-negation) instead.
+     * @see https://eslint.org/docs/rules/no-negated-in-lhs
+     */
+    "no-negated-in-lhs": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow spacing between function identifiers and their applications.
+     *
+     * @since 0.1.2
+     * @deprecated since 3.3.0, use [`func-call-spacing`](https://eslint.org/docs/rules/func-call-spacing) instead.
+     * @see https://eslint.org/docs/rules/no-spaced-func
+     */
+    "no-spaced-func": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to suggest using `Reflect` methods where applicable.
+     *
+     * @since 1.0.0-rc-2
+     * @deprecated since 3.9.0
+     * @see https://eslint.org/docs/rules/prefer-reflect
+     */
+    "prefer-reflect": Linter.RuleEntry<
+        [
+            Partial<{
+                exceptions: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require JSDoc comments.
+     *
+     * @since 1.4.0
+     * @deprecated since 5.10.0
+     * @see https://eslint.org/docs/rules/require-jsdoc
+     */
+    "require-jsdoc": Linter.RuleEntry<
+        [
+            Partial<{
+                require: Partial<{
+                    /**
+                     * @default true
+                     */
+                    FunctionDeclaration: boolean;
+                    /**
+                     * @default false
+                     */
+                    MethodDefinition: boolean;
+                    /**
+                     * @default false
+                     */
+                    ClassDeclaration: boolean;
+                    /**
+                     * @default false
+                     */
+                    ArrowFunctionExpression: boolean;
+                    /**
+                     * @default false
+                     */
+                    FunctionExpression: boolean;
+                }>;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce valid JSDoc comments.
+     *
+     * @since 0.4.0
+     * @deprecated since 5.10.0
+     * @see https://eslint.org/docs/rules/valid-jsdoc
+     */
+    "valid-jsdoc": Linter.RuleEntry<
+        [
+            Partial<{
+                prefer: Record<string, string>;
+                preferType: Record<string, string>;
+                /**
+                 * @default true
+                 */
+                requireReturn: boolean;
+                /**
+                 * @default true
+                 */
+                requireReturnType: boolean;
+                /**
+                 * @remarks
+                 * Also accept for regular expression pattern
+                 */
+                matchDescription: string;
+                /**
+                 * @default true
+                 */
+                requireParamDescription: boolean;
+                /**
+                 * @default true
+                 */
+                requireReturnDescription: boolean;
+                /**
+                 * @default true
+                 */
+                requireParamType: boolean;
+            }>,
+        ]
+    >;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/ecmascript-6.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/ecmascript-6.d.ts
new file mode 100644
index 0000000..966f359
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/ecmascript-6.d.ts
@@ -0,0 +1,502 @@
+import { Linter } from "../index";
+
+export interface ECMAScript6 extends Linter.RulesRecord {
+    /**
+     * Rule to require braces around arrow function bodies.
+     *
+     * @since 1.8.0
+     * @see https://eslint.org/docs/rules/arrow-body-style
+     */
+    "arrow-body-style":
+        | Linter.RuleEntry<
+              [
+                  "as-needed",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      requireReturnForObjectLiteral: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<["always" | "never"]>;
+
+    /**
+     * Rule to require parentheses around arrow function arguments.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/arrow-parens
+     */
+    "arrow-parens":
+        | Linter.RuleEntry<["always"]>
+        | Linter.RuleEntry<
+              [
+                  "as-needed",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      requireForBlockBody: boolean;
+                  }>,
+              ]
+          >;
+
+    /**
+     * Rule to enforce consistent spacing before and after the arrow in arrow functions.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/arrow-spacing
+     */
+    "arrow-spacing": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require `super()` calls in constructors.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.24.0
+     * @see https://eslint.org/docs/rules/constructor-super
+     */
+    "constructor-super": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce consistent spacing around `*` operators in generator functions.
+     *
+     * @since 0.17.0
+     * @see https://eslint.org/docs/rules/generator-star-spacing
+     */
+    "generator-star-spacing": Linter.RuleEntry<
+        [
+            | Partial<{
+                  before: boolean;
+                  after: boolean;
+                  named:
+                      | Partial<{
+                            before: boolean;
+                            after: boolean;
+                        }>
+                      | "before"
+                      | "after"
+                      | "both"
+                      | "neither";
+                  anonymous:
+                      | Partial<{
+                            before: boolean;
+                            after: boolean;
+                        }>
+                      | "before"
+                      | "after"
+                      | "both"
+                      | "neither";
+                  method:
+                      | Partial<{
+                            before: boolean;
+                            after: boolean;
+                        }>
+                      | "before"
+                      | "after"
+                      | "both"
+                      | "neither";
+              }>
+            | "before"
+            | "after"
+            | "both"
+            | "neither",
+        ]
+    >;
+
+    /**
+     * Rule to disallow reassigning class members.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/no-class-assign
+     */
+    "no-class-assign": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow arrow functions where they could be confused with comparisons.
+     *
+     * @since 2.0.0-alpha-2
+     * @see https://eslint.org/docs/rules/no-confusing-arrow
+     */
+    "no-confusing-arrow": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                allowParens: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow reassigning `const` variables.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/no-const-assign
+     */
+    "no-const-assign": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow duplicate class members.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 1.2.0
+     * @see https://eslint.org/docs/rules/no-dupe-class-members
+     */
+    "no-dupe-class-members": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow duplicate module imports.
+     *
+     * @since 2.5.0
+     * @see https://eslint.org/docs/rules/no-duplicate-import
+     */
+    "no-duplicate-import": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                includeExports: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow `new` operators with the `Symbol` object.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 2.0.0-beta.1
+     * @see https://eslint.org/docs/rules/no-new-symbol
+     */
+    "no-new-symbol": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow specified modules when loaded by `import`.
+     *
+     * @since 2.0.0-alpha-1
+     * @see https://eslint.org/docs/rules/no-restricted-imports
+     */
+    "no-restricted-imports": Linter.RuleEntry<
+        [
+            ...Array<
+                | string
+                | {
+                      name: string;
+                      importNames?: string[] | undefined;
+                      message?: string | undefined;
+                  }
+                | Partial<{
+                      paths: Array<
+                          | string
+                          | {
+                                name: string;
+                                importNames?: string[] | undefined;
+                                message?: string | undefined;
+                            }
+                      >;
+                      patterns: string[];
+                  }>
+            >
+        ]
+    >;
+
+    /**
+     * Rule to disallow `this`/`super` before calling `super()` in constructors.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.24.0
+     * @see https://eslint.org/docs/rules/no-this-before-super
+     */
+    "no-this-before-super": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary computed property keys in object literals.
+     *
+     * @since 2.9.0
+     * @see https://eslint.org/docs/rules/no-useless-computed-key
+     */
+    "no-useless-computed-key": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary constructors.
+     *
+     * @since 2.0.0-beta.1
+     * @see https://eslint.org/docs/rules/no-useless-constructor
+     */
+    "no-useless-constructor": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow renaming import, export, and destructured assignments to the same name.
+     *
+     * @since 2.11.0
+     * @see https://eslint.org/docs/rules/no-useless-rename
+     */
+    "no-useless-rename": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                ignoreImport: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreExport: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreDestructuring: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require `let` or `const` instead of `var`.
+     *
+     * @since 0.12.0
+     * @see https://eslint.org/docs/rules/no-var
+     */
+    "no-var": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require or disallow method and property shorthand syntax for object literals.
+     *
+     * @since 0.20.0
+     * @see https://eslint.org/docs/rules/object-shorthand
+     */
+    "object-shorthand":
+        | Linter.RuleEntry<
+              [
+                  "always" | "methods",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      avoidQuotes: boolean;
+                      /**
+                       * @default false
+                       */
+                      ignoreConstructors: boolean;
+                      /**
+                       * @default false
+                       */
+                      avoidExplicitReturnArrows: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<
+              [
+                  "properties",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      avoidQuotes: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<["never" | "consistent" | "consistent-as-needed"]>;
+
+    /**
+     * Rule to require using arrow functions for callbacks.
+     *
+     * @since 1.2.0
+     * @see https://eslint.org/docs/rules/prefer-arrow-callback
+     */
+    "prefer-arrow-callback": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowNamedFunctions: boolean;
+                /**
+                 * @default true
+                 */
+                allowUnboundThis: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require `const` declarations for variables that are never reassigned after declared.
+     *
+     * @since 0.23.0
+     * @see https://eslint.org/docs/rules/prefer-const
+     */
+    "prefer-const": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 'any'
+                 */
+                destructuring: "any" | "all";
+                /**
+                 * @default false
+                 */
+                ignoreReadBeforeAssign: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require destructuring from arrays and/or objects.
+     *
+     * @since 3.13.0
+     * @see https://eslint.org/docs/rules/prefer-destructuring
+     */
+    "prefer-destructuring": Linter.RuleEntry<
+        [
+            Partial<
+                | {
+                      VariableDeclarator: Partial<{
+                          array: boolean;
+                          object: boolean;
+                      }>;
+                      AssignmentExpression: Partial<{
+                          array: boolean;
+                          object: boolean;
+                      }>;
+                  }
+                | {
+                      array: boolean;
+                      object: boolean;
+                  }
+            >,
+            Partial<{
+                enforceForRenamedProperties: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow `parseInt()` and `Number.parseInt()` in favor of binary, octal, and hexadecimal literals.
+     *
+     * @since 3.5.0
+     * @see https://eslint.org/docs/rules/prefer-numeric-literals
+     */
+    "prefer-numeric-literals": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require rest parameters instead of `arguments`.
+     *
+     * @since 2.0.0-alpha-1
+     * @see https://eslint.org/docs/rules/prefer-rest-params
+     */
+    "prefer-rest-params": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require spread operators instead of `.apply()`.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/prefer-spread
+     */
+    "prefer-spread": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require template literals instead of string concatenation.
+     *
+     * @since 1.2.0
+     * @see https://eslint.org/docs/rules/prefer-template
+     */
+    "prefer-template": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require generator functions to contain `yield`.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/require-yield
+     */
+    "require-yield": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce spacing between rest and spread operators and their expressions.
+     *
+     * @since 2.12.0
+     * @see https://eslint.org/docs/rules/rest-spread-spacing
+     */
+    "rest-spread-spacing": Linter.RuleEntry<["never" | "always"]>;
+
+    /**
+     * Rule to enforce sorted import declarations within modules.
+     *
+     * @since 2.0.0-beta.1
+     * @see https://eslint.org/docs/rules/sort-imports
+     */
+    "sort-imports": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                ignoreCase: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreDeclarationSort: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreMemberSort: boolean;
+                /**
+                 * @default ['none', 'all', 'multiple', 'single']
+                 */
+                memberSyntaxSortOrder: Array<"none" | "all" | "multiple" | "single">;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require symbol descriptions.
+     *
+     * @since 3.4.0
+     * @see https://eslint.org/docs/rules/symbol-description
+     */
+    "symbol-description": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require or disallow spacing around embedded expressions of template strings.
+     *
+     * @since 2.0.0-rc.0
+     * @see https://eslint.org/docs/rules/template-curly-spacing
+     */
+    "template-curly-spacing": Linter.RuleEntry<["never" | "always"]>;
+
+    /**
+     * Rule to require or disallow spacing around the `*` in `yield*` expressions.
+     *
+     * @since 2.0.0-alpha-1
+     * @see https://eslint.org/docs/rules/yield-star-spacing
+     */
+    "yield-star-spacing": Linter.RuleEntry<
+        [
+            | Partial<{
+                  before: boolean;
+                  after: boolean;
+              }>
+            | "before"
+            | "after"
+            | "both"
+            | "neither",
+        ]
+    >;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/index.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/index.d.ts
new file mode 100644
index 0000000..e0f517b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/index.d.ts
@@ -0,0 +1,21 @@
+import { Linter } from "../index";
+
+import { BestPractices } from "./best-practices";
+import { Deprecated } from "./deprecated";
+import { ECMAScript6 } from "./ecmascript-6";
+import { NodeJSAndCommonJS } from "./node-commonjs";
+import { PossibleErrors } from "./possible-errors";
+import { StrictMode } from "./strict-mode";
+import { StylisticIssues } from "./stylistic-issues";
+import { Variables } from "./variables";
+
+export interface ESLintRules
+    extends Linter.RulesRecord,
+        PossibleErrors,
+        BestPractices,
+        StrictMode,
+        Variables,
+        NodeJSAndCommonJS,
+        StylisticIssues,
+        ECMAScript6,
+        Deprecated {}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/node-commonjs.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/node-commonjs.d.ts
new file mode 100644
index 0000000..c248029
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/node-commonjs.d.ts
@@ -0,0 +1,133 @@
+import { Linter } from "../index";
+
+export interface NodeJSAndCommonJS extends Linter.RulesRecord {
+    /**
+     * Rule to require `return` statements after callbacks.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/callback-return
+     */
+    "callback-return": Linter.RuleEntry<[string[]]>;
+
+    /**
+     * Rule to require `require()` calls to be placed at top-level module scope.
+     *
+     * @since 1.4.0
+     * @see https://eslint.org/docs/rules/global-require
+     */
+    "global-require": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require error handling in callbacks.
+     *
+     * @since 0.4.5
+     * @see https://eslint.org/docs/rules/handle-callback-err
+     */
+    "handle-callback-err": Linter.RuleEntry<[string]>;
+
+    /**
+     * Rule to disallow use of the `Buffer()` constructor.
+     *
+     * @since 4.0.0-alpha.0
+     * @see https://eslint.org/docs/rules/no-buffer-constructor
+     */
+    "no-buffer-constructor": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `require` calls to be mixed with regular variable declarations.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-mixed-requires
+     */
+    "no-mixed-requires": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                grouping: boolean;
+                /**
+                 * @default false
+                 */
+                allowCall: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow `new` operators with calls to `require`.
+     *
+     * @since 0.6.0
+     * @see https://eslint.org/docs/rules/no-new-require
+     */
+    "no-new-require": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow string concatenation when using `__dirname` and `__filename`.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-path-concat
+     */
+    "no-path-concat": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of `process.env`.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/no-process-env
+     */
+    "no-process-env": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of `process.exit()`.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-process-exit
+     */
+    "no-process-exit": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow specified modules when loaded by `require`.
+     *
+     * @since 0.6.0
+     * @see https://eslint.org/docs/rules/no-restricted-modules
+     */
+    "no-restricted-modules": Linter.RuleEntry<
+        [
+            ...Array<
+                | string
+                | {
+                      name: string;
+                      message?: string | undefined;
+                  }
+                | Partial<{
+                      paths: Array<
+                          | string
+                          | {
+                                name: string;
+                                message?: string | undefined;
+                            }
+                      >;
+                      patterns: string[];
+                  }>
+            >
+        ]
+    >;
+
+    /**
+     * Rule to disallow synchronous methods.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-sync
+     */
+    "no-sync": Linter.RuleEntry<
+        [
+            {
+                /**
+                 * @default false
+                 */
+                allowAtRootLevel: boolean;
+            },
+        ]
+    >;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/possible-errors.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/possible-errors.d.ts
new file mode 100644
index 0000000..c27a862
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/possible-errors.d.ts
@@ -0,0 +1,484 @@
+import { Linter } from "../index";
+
+export interface PossibleErrors extends Linter.RulesRecord {
+    /**
+     * Rule to enforce `for` loop update clause moving the counter in the right direction.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 4.0.0-beta.0
+     * @see https://eslint.org/docs/rules/for-direction
+     */
+    "for-direction": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce `return` statements in getters.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 4.2.0
+     * @see https://eslint.org/docs/rules/getter-return
+     */
+    "getter-return": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowImplicit: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow using an async function as a `Promise` executor.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 5.3.0
+     * @see https://eslint.org/docs/rules/no-async-promise-executor
+     */
+    "no-async-promise-executor": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `await` inside of loops.
+     *
+     * @since 3.12.0
+     * @see https://eslint.org/docs/rules/no-await-in-loop
+     */
+    "no-await-in-loop": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow comparing against `-0`.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 3.17.0
+     * @see https://eslint.org/docs/rules/no-compare-neg-zero
+     */
+    "no-compare-neg-zero": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow assignment operators in conditional statements.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-cond-assign
+     */
+    "no-cond-assign": Linter.RuleEntry<["except-parens" | "always"]>;
+
+    /**
+     * Rule to disallow the use of `console`.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/no-console
+     */
+    "no-console": Linter.RuleEntry<
+        [
+            Partial<{
+                allow: Array<keyof Console>;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow constant expressions in conditions.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.4.1
+     * @see https://eslint.org/docs/rules/no-constant-condition
+     */
+    "no-constant-condition": Linter.RuleEntry<
+        [
+            {
+                /**
+                 * @default true
+                 */
+                checkLoops: boolean;
+            },
+        ]
+    >;
+
+    /**
+     * Rule to disallow control characters in regular expressions.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.1.0
+     * @see https://eslint.org/docs/rules/no-control-regex
+     */
+    "no-control-regex": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of `debugger`.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/no-debugger
+     */
+    "no-debugger": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow duplicate arguments in `function` definitions.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.16.0
+     * @see https://eslint.org/docs/rules/no-dupe-args
+     */
+    "no-dupe-args": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow duplicate keys in object literals.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-dupe-keys
+     */
+    "no-dupe-keys": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow a duplicate case label.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.17.0
+     * @see https://eslint.org/docs/rules/no-duplicate-case
+     */
+    "no-duplicate-case": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow empty block statements.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/no-empty
+     */
+    "no-empty": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowEmptyCatch: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow empty character classes in regular expressions.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.22.0
+     * @see https://eslint.org/docs/rules/no-empty-character-class
+     */
+    "no-empty-character-class": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow reassigning exceptions in `catch` clauses.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-ex-assign
+     */
+    "no-ex-assign": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary boolean casts.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-extra-boolean-cast
+     */
+    "no-extra-boolean-cast": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unnecessary parentheses.
+     *
+     * @since 0.1.4
+     * @see https://eslint.org/docs/rules/no-extra-parens
+     */
+    "no-extra-parens":
+        | Linter.RuleEntry<
+              [
+                  "all",
+                  Partial<{
+                      /**
+                       * @default true,
+                       */
+                      conditionalAssign: boolean;
+                      /**
+                       * @default true
+                       */
+                      returnAssign: boolean;
+                      /**
+                       * @default true
+                       */
+                      nestedBinaryExpressions: boolean;
+                      /**
+                       * @default 'none'
+                       */
+                      ignoreJSX: "none" | "all" | "multi-line" | "single-line";
+                      /**
+                       * @default true
+                       */
+                      enforceForArrowConditionals: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<["functions"]>;
+
+    /**
+     * Rule to disallow unnecessary semicolons.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-extra-semi
+     */
+    "no-extra-semi": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow reassigning `function` declarations.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-func-assign
+     */
+    "no-func-assign": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow variable or `function` declarations in nested blocks.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.6.0
+     * @see https://eslint.org/docs/rules/no-inner-declarations
+     */
+    "no-inner-declarations": Linter.RuleEntry<["functions" | "both"]>;
+
+    /**
+     * Rule to disallow invalid regular expression strings in `RegExp` constructors.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.1.4
+     * @see https://eslint.org/docs/rules/no-invalid-regexp
+     */
+    "no-invalid-regexp": Linter.RuleEntry<
+        [
+            Partial<{
+                allowConstructorFlags: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow irregular whitespace.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/no-irregular-whitespace
+     */
+    "no-irregular-whitespace": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                skipStrings: boolean;
+                /**
+                 * @default false
+                 */
+                skipComments: boolean;
+                /**
+                 * @default false
+                 */
+                skipRegExps: boolean;
+                /**
+                 * @default false
+                 */
+                skipTemplates: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow characters which are made with multiple code points in character class syntax.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 5.3.0
+     * @see https://eslint.org/docs/rules/no-misleading-character-class
+     */
+    "no-misleading-character-class": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow calling global object properties as functions.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-obj-calls
+     */
+    "no-obj-calls": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow use of `Object.prototypes` builtins directly.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 2.11.0
+     * @see https://eslint.org/docs/rules/no-prototype-builtins
+     */
+    "no-prototype-builtins": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow multiple spaces in regular expressions.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-regex-spaces
+     */
+    "no-regex-spaces": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow sparse arrays.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-sparse-arrays
+     */
+    "no-sparse-arrays": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow template literal placeholder syntax in regular strings.
+     *
+     * @since 3.3.0
+     * @see https://eslint.org/docs/rules/no-template-curly-in-string
+     */
+    "no-template-curly-in-string": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow confusing multiline expressions.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.24.0
+     * @see https://eslint.org/docs/rules/no-unexpected-multiline
+     */
+    "no-unexpected-multiline": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unreachable code after `return`, `throw`, `continue`, and `break` statements.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/no-unreachable
+     */
+    "no-unreachable": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow control flow statements in `finally` blocks.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 2.9.0
+     * @see https://eslint.org/docs/rules/no-unsafe-finally
+     */
+    "no-unsafe-finally": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow negating the left operand of relational operators.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 3.3.0
+     * @see https://eslint.org/docs/rules/no-unsafe-negation
+     */
+    "no-unsafe-negation": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow assignments that can lead to race conditions due to usage of `await` or `yield`.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 5.3.0
+     * @see https://eslint.org/docs/rules/require-atomic-updates
+     */
+    "require-atomic-updates": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require calls to `isNaN()` when checking for `NaN`.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/use-isnan
+     */
+    "use-isnan": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce comparing `typeof` expressions against valid strings.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.5.0
+     * @see https://eslint.org/docs/rules/valid-typeof
+     */
+    "valid-typeof": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                requireStringLiterals: boolean;
+            }>,
+        ]
+    >;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/strict-mode.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/strict-mode.d.ts
new file mode 100644
index 0000000..d63929b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/strict-mode.d.ts
@@ -0,0 +1,11 @@
+import { Linter } from "../index";
+
+export interface StrictMode extends Linter.RulesRecord {
+    /**
+     * Rule to require or disallow strict mode directives.
+     *
+     * @since 0.1.0
+     * @see https://eslint.org/docs/rules/strict
+     */
+    strict: Linter.RuleEntry<["safe" | "global" | "function" | "never"]>;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/stylistic-issues.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/stylistic-issues.d.ts
new file mode 100644
index 0000000..af7e0c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/stylistic-issues.d.ts
@@ -0,0 +1,1893 @@
+import { Linter } from "../index";
+
+export interface StylisticIssues extends Linter.RulesRecord {
+    /**
+     * Rule to enforce linebreaks after opening and before closing array brackets.
+     *
+     * @since 4.0.0-alpha.1
+     * @see https://eslint.org/docs/rules/array-bracket-newline
+     */
+    "array-bracket-newline": Linter.RuleEntry<
+        [
+            | "always"
+            | "never"
+            | "consistent"
+            | Partial<{
+                  /**
+                   * @default true
+                   */
+                  multiline: boolean;
+                  /**
+                   * @default null
+                   */
+                  minItems: number | null;
+              }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing inside array brackets.
+     *
+     * @since 0.24.0
+     * @see https://eslint.org/docs/rules/array-bracket-spacing
+     */
+    "array-bracket-spacing":
+        | Linter.RuleEntry<
+              [
+                  "never",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      singleValue: boolean;
+                      /**
+                       * @default false
+                       */
+                      objectsInArrays: boolean;
+                      /**
+                       * @default false
+                       */
+                      arraysInArrays: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<
+              [
+                  "always",
+                  Partial<{
+                      /**
+                       * @default true
+                       */
+                      singleValue: boolean;
+                      /**
+                       * @default true
+                       */
+                      objectsInArrays: boolean;
+                      /**
+                       * @default true
+                       */
+                      arraysInArrays: boolean;
+                  }>,
+              ]
+          >;
+
+    /**
+     * Rule to enforce line breaks after each array element.
+     *
+     * @since 4.0.0-rc.0
+     * @see https://eslint.org/docs/rules/array-element-newline
+     */
+    "array-element-newline": Linter.RuleEntry<
+        [
+            | "always"
+            | "never"
+            | "consistent"
+            | Partial<{
+                  /**
+                   * @default true
+                   */
+                  multiline: boolean;
+                  /**
+                   * @default null
+                   */
+                  minItems: number | null;
+              }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow or enforce spaces inside of blocks after opening block and before closing block.
+     *
+     * @since 1.2.0
+     * @see https://eslint.org/docs/rules/block-spacing
+     */
+    "block-spacing": Linter.RuleEntry<["always" | "never"]>;
+
+    /**
+     * Rule to enforce consistent brace style for blocks.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/brace-style
+     */
+    "brace-style": Linter.RuleEntry<
+        [
+            "1tbs" | "stroustrup" | "allman",
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowSingleLine: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce camelcase naming convention.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/camelcase
+     */
+    camelcase: Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 'always'
+                 */
+                properties: "always" | "never";
+                /**
+                 * @default false
+                 */
+                ignoreDestructuring: boolean;
+                /**
+                 * @remarks
+                 * Also accept for regular expression patterns
+                 */
+                allow: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce or disallow capitalization of the first letter of a comment.
+     *
+     * @since 3.11.0
+     * @see https://eslint.org/docs/rules/capitalized-comments
+     */
+    "capitalized-comments": Linter.RuleEntry<
+        [
+            "always" | "never",
+            Partial<{
+                ignorePattern: string;
+                /**
+                 * @default false
+                 */
+                ignoreInlineComments: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreConsecutiveComments: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow trailing commas.
+     *
+     * @since 0.16.0
+     * @see https://eslint.org/docs/rules/comma-dangle
+     */
+    "comma-dangle": Linter.RuleEntry<
+        [
+            | "never"
+            | "always"
+            | "always-multiline"
+            | "only-multiline"
+            | Partial<{
+                  /**
+                   * @default 'never'
+                   */
+                  arrays: "never" | "always" | "always-multiline" | "only-multiline";
+                  /**
+                   * @default 'never'
+                   */
+                  objects: "never" | "always" | "always-multiline" | "only-multiline";
+                  /**
+                   * @default 'never'
+                   */
+                  imports: "never" | "always" | "always-multiline" | "only-multiline";
+                  /**
+                   * @default 'never'
+                   */
+                  exports: "never" | "always" | "always-multiline" | "only-multiline";
+                  /**
+                   * @default 'never'
+                   */
+                  functions: "never" | "always" | "always-multiline" | "only-multiline";
+              }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing before and after commas.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/comma-spacing
+     */
+    "comma-spacing": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                before: boolean;
+                /**
+                 * @default true
+                 */
+                after: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent comma style.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/comma-style
+     */
+    "comma-style": Linter.RuleEntry<
+        [
+            "last" | "first",
+            Partial<{
+                exceptions: Record<string, boolean>;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing inside computed property brackets.
+     *
+     * @since 0.23.0
+     * @see https://eslint.org/docs/rules/computed-property-spacing
+     */
+    "computed-property-spacing": Linter.RuleEntry<["never" | "always"]>;
+
+    /**
+     * Rule to enforce consistent naming when capturing the current execution context.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/consistent-this
+     */
+    "consistent-this": Linter.RuleEntry<[...string[]]>;
+
+    /**
+     * Rule to require or disallow newline at the end of files.
+     *
+     * @since 0.7.1
+     * @see https://eslint.org/docs/rules/eol-last
+     */
+    "eol-last": Linter.RuleEntry<
+        [
+            "always" | "never", // | 'unix' | 'windows'
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow spacing between function identifiers and their invocations.
+     *
+     * @since 3.3.0
+     * @see https://eslint.org/docs/rules/func-call-spacing
+     */
+    "func-call-spacing": Linter.RuleEntry<["never" | "always"]>;
+
+    /**
+     * Rule to require function names to match the name of the variable or property to which they are assigned.
+     *
+     * @since 3.8.0
+     * @see https://eslint.org/docs/rules/func-name-matching
+     */
+    "func-name-matching":
+        | Linter.RuleEntry<
+              [
+                  "always" | "never",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      considerPropertyDescriptor: boolean;
+                      /**
+                       * @default false
+                       */
+                      includeCommonJSModuleExports: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<
+              [
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      considerPropertyDescriptor: boolean;
+                      /**
+                       * @default false
+                       */
+                      includeCommonJSModuleExports: boolean;
+                  }>,
+              ]
+          >;
+
+    /**
+     * Rule to require or disallow named `function` expressions.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/func-names
+     */
+    "func-names": Linter.RuleEntry<
+        [
+            "always" | "as-needed" | "never",
+            Partial<{
+                generators: "always" | "as-needed" | "never";
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce the consistent use of either `function` declarations or expressions.
+     *
+     * @since 0.2.0
+     * @see https://eslint.org/docs/rules/func-style
+     */
+    "func-style": Linter.RuleEntry<
+        [
+            "expression" | "declaration",
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowArrowFunctions: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent line breaks inside function parentheses.
+     *
+     * @since 4.6.0
+     * @see https://eslint.org/docs/rules/function-paren-newline
+     */
+    "function-paren-newline": Linter.RuleEntry<
+        [
+            | "always"
+            | "never"
+            | "multiline"
+            | "multiline-arguments"
+            | "consistent"
+            | Partial<{
+                  minItems: number;
+              }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow specified identifiers.
+     *
+     * @since 2.0.0-beta.2
+     * @see https://eslint.org/docs/rules/id-blacklist
+     */
+    "id-blacklist": Linter.RuleEntry<[...string[]]>;
+
+    /**
+     * Rule to enforce minimum and maximum identifier lengths.
+     *
+     * @since 1.0.0
+     * @see https://eslint.org/docs/rules/id-length
+     */
+    "id-length": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 2
+                 */
+                min: number;
+                /**
+                 * @default Infinity
+                 */
+                max: number;
+                /**
+                 * @default 'always'
+                 */
+                properties: "always" | "never";
+                exceptions: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require identifiers to match a specified regular expression.
+     *
+     * @since 1.0.0
+     * @see https://eslint.org/docs/rules/id-match
+     */
+    "id-match": Linter.RuleEntry<
+        [
+            string,
+            Partial<{
+                /**
+                 * @default false
+                 */
+                properties: boolean;
+                /**
+                 * @default false
+                 */
+                onlyDeclarations: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreDestructuring: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce the location of arrow function bodies.
+     *
+     * @since 4.12.0
+     * @see https://eslint.org/docs/rules/implicit-arrow-linebreak
+     */
+    "implicit-arrow-linebreak": Linter.RuleEntry<["beside" | "below"]>;
+
+    /**
+     * Rule to enforce consistent indentation.
+     *
+     * @since 0.14.0
+     * @see https://eslint.org/docs/rules/indent
+     */
+    indent: Linter.RuleEntry<
+        [
+            number | "tab",
+            Partial<{
+                /**
+                 * @default 0
+                 */
+                SwitchCase: number;
+                /**
+                 * @default 1
+                 */
+                VariableDeclarator:
+                    | Partial<{
+                          /**
+                           * @default 1
+                           */
+                          var: number | "first";
+                          /**
+                           * @default 1
+                           */
+                          let: number | "first";
+                          /**
+                           * @default 1
+                           */
+                          const: number | "first";
+                      }>
+                    | number
+                    | "first";
+                /**
+                 * @default 1
+                 */
+                outerIIFEBody: number;
+                /**
+                 * @default 1
+                 */
+                MemberExpression: number | "off";
+                /**
+                 * @default { parameters: 1, body: 1 }
+                 */
+                FunctionDeclaration: Partial<{
+                    /**
+                     * @default 1
+                     */
+                    parameters: number | "first" | "off";
+                    /**
+                     * @default 1
+                     */
+                    body: number;
+                }>;
+                /**
+                 * @default { parameters: 1, body: 1 }
+                 */
+                FunctionExpression: Partial<{
+                    /**
+                     * @default 1
+                     */
+                    parameters: number | "first" | "off";
+                    /**
+                     * @default 1
+                     */
+                    body: number;
+                }>;
+                /**
+                 * @default { arguments: 1 }
+                 */
+                CallExpression: Partial<{
+                    /**
+                     * @default 1
+                     */
+                    arguments: number | "first" | "off";
+                }>;
+                /**
+                 * @default 1
+                 */
+                ArrayExpression: number | "first" | "off";
+                /**
+                 * @default 1
+                 */
+                ObjectExpression: number | "first" | "off";
+                /**
+                 * @default 1
+                 */
+                ImportDeclaration: number | "first" | "off";
+                /**
+                 * @default false
+                 */
+                flatTernaryExpressions: boolean;
+                ignoredNodes: string[];
+                /**
+                 * @default false
+                 */
+                ignoreComments: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce the consistent use of either double or single quotes in JSX attributes.
+     *
+     * @since 1.4.0
+     * @see https://eslint.org/docs/rules/jsx-quotes
+     */
+    "jsx-quotes": Linter.RuleEntry<["prefer-double" | "prefer-single"]>;
+
+    /**
+     * Rule to enforce consistent spacing between keys and values in object literal properties.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/key-spacing
+     */
+    "key-spacing": Linter.RuleEntry<
+        [
+            | Partial<
+                  | {
+                        /**
+                         * @default false
+                         */
+                        beforeColon: boolean;
+                        /**
+                         * @default true
+                         */
+                        afterColon: boolean;
+                        /**
+                         * @default 'strict'
+                         */
+                        mode: "strict" | "minimum";
+                        align:
+                            | Partial<{
+                                  /**
+                                   * @default false
+                                   */
+                                  beforeColon: boolean;
+                                  /**
+                                   * @default true
+                                   */
+                                  afterColon: boolean;
+                                  /**
+                                   * @default 'colon'
+                                   */
+                                  on: "value" | "colon";
+                                  /**
+                                   * @default 'strict'
+                                   */
+                                  mode: "strict" | "minimum";
+                              }>
+                            | "value"
+                            | "colon";
+                    }
+                  | {
+                        singleLine?: Partial<{
+                            /**
+                             * @default false
+                             */
+                            beforeColon: boolean;
+                            /**
+                             * @default true
+                             */
+                            afterColon: boolean;
+                            /**
+                             * @default 'strict'
+                             */
+                            mode: "strict" | "minimum";
+                        }> | undefined;
+                        multiLine?: Partial<{
+                            /**
+                             * @default false
+                             */
+                            beforeColon: boolean;
+                            /**
+                             * @default true
+                             */
+                            afterColon: boolean;
+                            /**
+                             * @default 'strict'
+                             */
+                            mode: "strict" | "minimum";
+                            align:
+                                | Partial<{
+                                      /**
+                                       * @default false
+                                       */
+                                      beforeColon: boolean;
+                                      /**
+                                       * @default true
+                                       */
+                                      afterColon: boolean;
+                                      /**
+                                       * @default 'colon'
+                                       */
+                                      on: "value" | "colon";
+                                      /**
+                                       * @default 'strict'
+                                       */
+                                      mode: "strict" | "minimum";
+                                  }>
+                                | "value"
+                                | "colon";
+                        }> | undefined;
+                    }
+              >
+            | {
+                  align: Partial<{
+                      /**
+                       * @default false
+                       */
+                      beforeColon: boolean;
+                      /**
+                       * @default true
+                       */
+                      afterColon: boolean;
+                      /**
+                       * @default 'colon'
+                       */
+                      on: "value" | "colon";
+                      /**
+                       * @default 'strict'
+                       */
+                      mode: "strict" | "minimum";
+                  }>;
+                  singleLine?: Partial<{
+                      /**
+                       * @default false
+                       */
+                      beforeColon: boolean;
+                      /**
+                       * @default true
+                       */
+                      afterColon: boolean;
+                      /**
+                       * @default 'strict'
+                       */
+                      mode: "strict" | "minimum";
+                  }> | undefined;
+                  multiLine?: Partial<{
+                      /**
+                       * @default false
+                       */
+                      beforeColon: boolean;
+                      /**
+                       * @default true
+                       */
+                      afterColon: boolean;
+                      /**
+                       * @default 'strict'
+                       */
+                      mode: "strict" | "minimum";
+                  }> | undefined;
+              },
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing before and after keywords.
+     *
+     * @since 2.0.0-beta.1
+     * @see https://eslint.org/docs/rules/keyword-spacing
+     */
+    "keyword-spacing": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                before: boolean;
+                /**
+                 * @default true
+                 */
+                after: boolean;
+                overrides: Record<
+                    string,
+                    Partial<{
+                        before: boolean;
+                        after: boolean;
+                    }>
+                >;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce position of line comments.
+     *
+     * @since 3.5.0
+     * @see https://eslint.org/docs/rules/line-comment-position
+     */
+    "line-comment-position": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 'above'
+                 */
+                position: "above" | "beside";
+                ignorePattern: string;
+                /**
+                 * @default true
+                 */
+                applyDefaultIgnorePatterns: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent linebreak style.
+     *
+     * @since 0.21.0
+     * @see https://eslint.org/docs/rules/linebreak-style
+     */
+    "linebreak-style": Linter.RuleEntry<["unix" | "windows"]>;
+
+    /**
+     * Rule to require empty lines around comments.
+     *
+     * @since 0.22.0
+     * @see https://eslint.org/docs/rules/lines-around-comment
+     */
+    "lines-around-comment": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                beforeBlockComment: boolean;
+                /**
+                 * @default false
+                 */
+                afterBlockComment: boolean;
+                /**
+                 * @default false
+                 */
+                beforeLineComment: boolean;
+                /**
+                 * @default false
+                 */
+                afterLineComment: boolean;
+                /**
+                 * @default false
+                 */
+                allowBlockStart: boolean;
+                /**
+                 * @default false
+                 */
+                allowBlockEnd: boolean;
+                /**
+                 * @default false
+                 */
+                allowObjectStart: boolean;
+                /**
+                 * @default false
+                 */
+                allowObjectEnd: boolean;
+                /**
+                 * @default false
+                 */
+                allowArrayStart: boolean;
+                /**
+                 * @default false
+                 */
+                allowArrayEnd: boolean;
+                /**
+                 * @default false
+                 */
+                allowClassStart: boolean;
+                /**
+                 * @default false
+                 */
+                allowClassEnd: boolean;
+                ignorePattern: string;
+                /**
+                 * @default true
+                 */
+                applyDefaultIgnorePatterns: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow an empty line between class members.
+     *
+     * @since 4.9.0
+     * @see https://eslint.org/docs/rules/lines-between-class-members
+     */
+    "lines-between-class-members": Linter.RuleEntry<
+        [
+            "always" | "never",
+            Partial<{
+                /**
+                 * @default false
+                 */
+                exceptAfterSingleLine: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum depth that blocks can be nested.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/max-depth
+     */
+    "max-depth": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 4
+                 */
+                max: number;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum line length.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/max-len
+     */
+    "max-len": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 80
+                 */
+                code: number;
+                /**
+                 * @default 4
+                 */
+                tabWidth: number;
+                comments: number;
+                ignorePattern: string;
+                /**
+                 * @default false
+                 */
+                ignoreComments: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreTrailingComments: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreUrls: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreStrings: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreTemplateLiterals: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreRegExpLiterals: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum number of lines per file.
+     *
+     * @since 2.12.0
+     * @see https://eslint.org/docs/rules/max-lines
+     */
+    "max-lines": Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default 300
+                   */
+                  max: number;
+                  /**
+                   * @default false
+                   */
+                  skipBlankLines: boolean;
+                  /**
+                   * @default false
+                   */
+                  skipComments: boolean;
+              }>
+            | number,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum number of line of code in a function.
+     *
+     * @since 5.0.0
+     * @see https://eslint.org/docs/rules/max-lines-per-function
+     */
+    "max-lines-per-function": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 50
+                 */
+                max: number;
+                /**
+                 * @default false
+                 */
+                skipBlankLines: boolean;
+                /**
+                 * @default false
+                 */
+                skipComments: boolean;
+                /**
+                 * @default false
+                 */
+                IIFEs: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum depth that callbacks can be nested.
+     *
+     * @since 0.2.0
+     * @see https://eslint.org/docs/rules/max-nested-callbacks
+     */
+    "max-nested-callbacks": Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default 10
+                   */
+                  max: number;
+              }>
+            | number,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum number of parameters in function definitions.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/max-params
+     */
+    "max-params": Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default 3
+                   */
+                  max: number;
+              }>
+            | number,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum number of statements allowed in function blocks.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/max-statements
+     */
+    "max-statements": Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default 10
+                   */
+                  max: number;
+                  /**
+                   * @default false
+                   */
+                  ignoreTopLevelFunctions: boolean;
+              }>
+            | number,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a maximum number of statements allowed per line.
+     *
+     * @since 2.5.0
+     * @see https://eslint.org/docs/rules/max-statements-per-line
+     */
+    "max-statements-per-line": Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default 1
+                   */
+                  max: number;
+              }>
+            | number,
+        ]
+    >;
+
+    /**
+     * Rule to enforce a particular style for multiline comments.
+     *
+     * @since 4.10.0
+     * @see https://eslint.org/docs/rules/multiline-comment-style
+     */
+    "multiline-comment-style": Linter.RuleEntry<["starred-block" | "bare-block" | "separate-lines"]>;
+
+    /**
+     * Rule to enforce newlines between operands of ternary expressions.
+     *
+     * @since 3.1.0
+     * @see https://eslint.org/docs/rules/multiline-ternary
+     */
+    "multiline-ternary": Linter.RuleEntry<["always" | "always-multiline" | "never"]>;
+
+    /**
+     * Rule to require constructor names to begin with a capital letter.
+     *
+     * @since 0.0.3-0
+     * @see https://eslint.org/docs/rules/new-cap
+     */
+    "new-cap": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                newIsCap: boolean;
+                /**
+                 * @default true
+                 */
+                capIsNew: boolean;
+                newIsCapExceptions: string[];
+                newIsCapExceptionPattern: string;
+                capIsNewExceptions: string[];
+                capIsNewExceptionPattern: string;
+                /**
+                 * @default true
+                 */
+                properties: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce or disallow parentheses when invoking a constructor with no arguments.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/new-parens
+     */
+    "new-parens": Linter.RuleEntry<["always" | "never"]>;
+
+    /**
+     * Rule to require a newline after each call in a method chain.
+     *
+     * @since 2.0.0-rc.0
+     * @see https://eslint.org/docs/rules/newline-per-chained-call
+     */
+    "newline-per-chained-call": Linter.RuleEntry<
+        [
+            {
+                /**
+                 * @default 2
+                 */
+                ignoreChainWithDepth: number;
+            },
+        ]
+    >;
+
+    /**
+     * Rule to disallow `Array` constructors.
+     *
+     * @since 0.4.0
+     * @see https://eslint.org/docs/rules/no-array-constructor
+     */
+    "no-array-constructor": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow bitwise operators.
+     *
+     * @since 0.0.2
+     * @see https://eslint.org/docs/rules/no-bitwise
+     */
+    "no-bitwise": Linter.RuleEntry<
+        [
+            Partial<{
+                allow: string[];
+                /**
+                 * @default false
+                 */
+                int32Hint: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow `continue` statements.
+     *
+     * @since 0.19.0
+     * @see https://eslint.org/docs/rules/no-continue
+     */
+    "no-continue": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow inline comments after code.
+     *
+     * @since 0.10.0
+     * @see https://eslint.org/docs/rules/no-inline-comments
+     */
+    "no-inline-comments": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `if` statements as the only statement in `else` blocks.
+     *
+     * @since 0.6.0
+     * @see https://eslint.org/docs/rules/no-lonely-if
+     */
+    "no-lonely-if": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow mixed binary operators.
+     *
+     * @since 2.12.0
+     * @see https://eslint.org/docs/rules/no-mixed-operators
+     */
+    "no-mixed-operators": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default
+                 * [
+                 *     ["+", "-", "*", "/", "%", "**"],
+                 *     ["&", "|", "^", "~", "<<", ">>", ">>>"],
+                 *     ["==", "!=", "===", "!==", ">", ">=", "<", "<="],
+                 *     ["&&", "||"],
+                 *     ["in", "instanceof"]
+                 * ]
+                 */
+                groups: string[][];
+                /**
+                 * @default true
+                 */
+                allowSamePrecedence: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow mixed spaces and tabs for indentation.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.7.1
+     * @see https://eslint.org/docs/rules/no-mixed-spaces-and-tabs
+     */
+    "no-mixed-spaces-and-tabs": Linter.RuleEntry<["smart-tabs"]>;
+
+    /**
+     * Rule to disallow use of chained assignment expressions.
+     *
+     * @since 3.14.0
+     * @see https://eslint.org/docs/rules/no-multi-assign
+     */
+    "no-multi-assign": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow multiple empty lines.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/no-multiple-empty-lines
+     */
+    "no-multiple-empty-lines": Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default 2
+                   */
+                  max: number;
+                  maxEOF: number;
+                  maxBOF: number;
+              }>
+            | number,
+        ]
+    >;
+
+    /**
+     * Rule to disallow negated conditions.
+     *
+     * @since 1.6.0
+     * @see https://eslint.org/docs/rules/no-negated-condition
+     */
+    "no-negated-condition": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow nested ternary expressions.
+     *
+     * @since 0.2.0
+     * @see https://eslint.org/docs/rules/no-nested-ternary
+     */
+    "no-nested-ternary": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow `Object` constructors.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-new-object
+     */
+    "no-new-object": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the unary operators `++` and `--`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-plusplus
+     */
+    "no-plusplus": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowForLoopAfterthoughts: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow specified syntax.
+     *
+     * @since 1.4.0
+     * @see https://eslint.org/docs/rules/no-restricted-syntax
+     */
+    "no-restricted-syntax": Linter.RuleEntry<
+        [
+            ...Array<
+                | string
+                | {
+                      selector: string;
+                      message?: string | undefined;
+                  }
+            >
+        ]
+    >;
+
+    /**
+     * Rule to disallow all tabs.
+     *
+     * @since 3.2.0
+     * @see https://eslint.org/docs/rules/no-tabs
+     */
+    "no-tabs": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowIndentationTabs: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow ternary operators.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-ternary
+     */
+    "no-ternary": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow trailing whitespace at the end of lines.
+     *
+     * @since 0.7.1
+     * @see https://eslint.org/docs/rules/no-trailing-spaces
+     */
+    "no-trailing-spaces": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                skipBlankLines: boolean;
+                /**
+                 * @default false
+                 */
+                ignoreComments: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow dangling underscores in identifiers.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-underscore-dangle
+     */
+    "no-underscore-dangle": Linter.RuleEntry<
+        [
+            Partial<{
+                allow: string[];
+                /**
+                 * @default false
+                 */
+                allowAfterThis: boolean;
+                /**
+                 * @default false
+                 */
+                allowAfterSuper: boolean;
+                /**
+                 * @default false
+                 */
+                enforceInMethodNames: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow ternary operators when simpler alternatives exist.
+     *
+     * @since 0.21.0
+     * @see https://eslint.org/docs/rules/no-unneeded-ternary
+     */
+    "no-unneeded-ternary": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                defaultAssignment: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow whitespace before properties.
+     *
+     * @since 2.0.0-beta.1
+     * @see https://eslint.org/docs/rules/no-whitespace-before-property
+     */
+    "no-whitespace-before-property": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to enforce the location of single-line statements.
+     *
+     * @since 3.17.0
+     * @see https://eslint.org/docs/rules/nonblock-statement-body-position
+     */
+    "nonblock-statement-body-position": Linter.RuleEntry<
+        [
+            "beside" | "below" | "any",
+            Partial<{
+                overrides: Record<string, "beside" | "below" | "any">;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent line breaks inside braces.
+     *
+     * @since 2.12.0
+     * @see https://eslint.org/docs/rules/object-curly-newline
+     */
+    "object-curly-newline": Linter.RuleEntry<
+        [
+            | "always"
+            | "never"
+            | Partial<{
+                  /**
+                   * @default false
+                   */
+                  multiline: boolean;
+                  minProperties: number;
+                  /**
+                   * @default true
+                   */
+                  consistent: boolean;
+              }>
+            | Partial<
+                  Record<
+                      "ObjectExpression" | "ObjectPattern" | "ImportDeclaration" | "ExportDeclaration",
+                      | "always"
+                      | "never"
+                      | Partial<{
+                            /**
+                             * @default false
+                             */
+                            multiline: boolean;
+                            minProperties: number;
+                            /**
+                             * @default true
+                             */
+                            consistent: boolean;
+                        }>
+                  >
+              >,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing inside braces.
+     *
+     * @since 0.22.0
+     * @see https://eslint.org/docs/rules/object-curly-spacing
+     */
+    "object-curly-spacing":
+        | Linter.RuleEntry<
+              [
+                  "never",
+                  {
+                      /**
+                       * @default false
+                       */
+                      arraysInObjects: boolean;
+                      /**
+                       * @default false
+                       */
+                      objectsInObjects: boolean;
+                  },
+              ]
+          >
+        | Linter.RuleEntry<
+              [
+                  "always",
+                  {
+                      /**
+                       * @default true
+                       */
+                      arraysInObjects: boolean;
+                      /**
+                       * @default true
+                       */
+                      objectsInObjects: boolean;
+                  },
+              ]
+          >;
+
+    /**
+     * Rule to enforce placing object properties on separate lines.
+     *
+     * @since 2.10.0
+     * @see https://eslint.org/docs/rules/object-property-newline
+     */
+    "object-property-newline": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                allowAllPropertiesOnSameLine: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce variables to be declared either together or separately in functions.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/one-var
+     */
+    "one-var": Linter.RuleEntry<
+        [
+            | "always"
+            | "never"
+            | "consecutive"
+            | Partial<
+                  {
+                      /**
+                       * @default false
+                       */
+                      separateRequires: boolean;
+                  } & Record<"var" | "let" | "const", "always" | "never" | "consecutive">
+              >
+            | Partial<Record<"initialized" | "uninitialized", "always" | "never" | "consecutive">>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow newlines around variable declarations.
+     *
+     * @since 2.0.0-beta.3
+     * @see https://eslint.org/docs/rules/one-var-declaration-per-line
+     */
+    "one-var-declaration-per-line": Linter.RuleEntry<["initializations" | "always"]>;
+
+    /**
+     * Rule to require or disallow assignment operator shorthand where possible.
+     *
+     * @since 0.10.0
+     * @see https://eslint.org/docs/rules/operator-assignment
+     */
+    "operator-assignment": Linter.RuleEntry<["always" | "never"]>;
+
+    /**
+     * Rule to enforce consistent linebreak style for operators.
+     *
+     * @since 0.19.0
+     * @see https://eslint.org/docs/rules/operator-linebreak
+     */
+    "operator-linebreak": Linter.RuleEntry<
+        [
+            "after" | "before" | "none",
+            Partial<{
+                overrides: Record<string, "after" | "before" | "none">;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow padding within blocks.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/padded-blocks
+     */
+    "padded-blocks": Linter.RuleEntry<
+        [
+            "always" | "never" | Partial<Record<"blocks" | "classes" | "switches", "always" | "never">>,
+            {
+                /**
+                 * @default false
+                 */
+                allowSingleLineBlocks: boolean;
+            },
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow padding lines between statements.
+     *
+     * @since 4.0.0-beta.0
+     * @see https://eslint.org/docs/rules/padding-line-between-statements
+     */
+    "padding-line-between-statements": Linter.RuleEntry<
+        [
+            ...Array<
+                {
+                    blankLine: "any" | "never" | "always";
+                } & Record<"prev" | "next", string | string[]>
+            >
+        ]
+    >;
+
+    /**
+     * Rule to disallow using Object.assign with an object literal as the first argument and prefer the use of object spread instead.
+     *
+     * @since 5.0.0-alpha.3
+     * @see https://eslint.org/docs/rules/prefer-object-spread
+     */
+    "prefer-object-spread": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to require quotes around object literal property names.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/quote-props
+     */
+    "quote-props":
+        | Linter.RuleEntry<["always" | "consistent"]>
+        | Linter.RuleEntry<
+              [
+                  "as-needed",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      keywords: boolean;
+                      /**
+                       * @default true
+                       */
+                      unnecessary: boolean;
+                      /**
+                       * @default false
+                       */
+                      numbers: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<
+              [
+                  "consistent-as-needed",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      keywords: boolean;
+                  }>,
+              ]
+          >;
+
+    /**
+     * Rule to enforce the consistent use of either backticks, double, or single quotes.
+     *
+     * @since 0.0.7
+     * @see https://eslint.org/docs/rules/quotes
+     */
+    quotes: Linter.RuleEntry<
+        [
+            "double" | "single" | "backtick",
+            Partial<{
+                /**
+                 * @default false
+                 */
+                avoidEscape: boolean;
+                /**
+                 * @default false
+                 */
+                allowTemplateLiterals: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow semicolons instead of ASI.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/semi
+     */
+    semi:
+        | Linter.RuleEntry<
+              [
+                  "always",
+                  Partial<{
+                      /**
+                       * @default false
+                       */
+                      omitLastInOneLineBlock: boolean;
+                  }>,
+              ]
+          >
+        | Linter.RuleEntry<
+              [
+                  "never",
+                  Partial<{
+                      /**
+                       * @default 'any'
+                       */
+                      beforeStatementContinuationChars: "any" | "always" | "never";
+                  }>,
+              ]
+          >;
+
+    /**
+     * Rule to enforce consistent spacing before and after semicolons.
+     *
+     * @since 0.16.0
+     * @see https://eslint.org/docs/rules/semi-spacing
+     */
+    "semi-spacing": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                before: boolean;
+                /**
+                 * @default true
+                 */
+                after: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce location of semicolons.
+     *
+     * @since 4.0.0-beta.0
+     * @see https://eslint.org/docs/rules/semi-style
+     */
+    "semi-style": Linter.RuleEntry<["last" | "first"]>;
+
+    /**
+     * Rule to require object keys to be sorted.
+     *
+     * @since 3.3.0
+     * @see https://eslint.org/docs/rules/sort-keys
+     */
+    "sort-keys": Linter.RuleEntry<
+        [
+            "asc" | "desc",
+            Partial<{
+                /**
+                 * @default true
+                 */
+                caseSensitive: boolean;
+                /**
+                 * @default 2
+                 */
+                minKeys: number;
+                /**
+                 * @default false
+                 */
+                natural: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require variables within the same declaration block to be sorted.
+     *
+     * @since 0.2.0
+     * @see https://eslint.org/docs/rules/sort-vars
+     */
+    "sort-vars": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                ignoreCase: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing before blocks.
+     *
+     * @since 0.9.0
+     * @see https://eslint.org/docs/rules/space-before-blocks
+     */
+    "space-before-blocks": Linter.RuleEntry<
+        ["always" | "never" | Partial<Record<"functions" | "keywords" | "classes", "always" | "never" | "off">>]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing before `function` definition opening parenthesis.
+     *
+     * @since 0.18.0
+     * @see https://eslint.org/docs/rules/space-before-function-paren
+     */
+    "space-before-function-paren": Linter.RuleEntry<
+        ["always" | "never" | Partial<Record<"anonymous" | "named" | "asyncArrow", "always" | "never" | "ignore">>]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing inside parentheses.
+     *
+     * @since 0.8.0
+     * @see https://eslint.org/docs/rules/space-in-parens
+     */
+    "space-in-parens": Linter.RuleEntry<
+        [
+            "never" | "always",
+            Partial<{
+                exceptions: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require spacing around infix operators.
+     *
+     * @since 0.2.0
+     * @see https://eslint.org/docs/rules/space-infix-ops
+     */
+    "space-infix-ops": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                int32Hint: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing before or after unary operators.
+     *
+     * @since 0.10.0
+     * @see https://eslint.org/docs/rules/space-unary-ops
+     */
+    "space-unary-ops": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default true
+                 */
+                words: boolean;
+                /**
+                 * @default false
+                 */
+                nonwords: boolean;
+                overrides: Record<string, boolean>;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to enforce consistent spacing after the `//` or `/*` in a comment.
+     *
+     * @since 0.23.0
+     * @see https://eslint.org/docs/rules/spaced-comment
+     */
+    "spaced-comment": Linter.RuleEntry<
+        [
+            "always" | "never",
+            {
+                exceptions: string[];
+                markers: string[];
+                line: {
+                    exceptions: string[];
+                    markers: string[];
+                };
+                block: {
+                    exceptions: string[];
+                    markers: string[];
+                    /**
+                     * @default false
+                     */
+                    balanced: boolean;
+                };
+            },
+        ]
+    >;
+
+    /**
+     * Rule to enforce spacing around colons of switch statements.
+     *
+     * @since 4.0.0-beta.0
+     * @see https://eslint.org/docs/rules/switch-colon-spacing
+     */
+    "switch-colon-spacing": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                before: boolean;
+                /**
+                 * @default true
+                 */
+                after: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to require or disallow spacing between template tags and their literals.
+     *
+     * @since 3.15.0
+     * @see https://eslint.org/docs/rules/template-tag-spacing
+     */
+    "template-tag-spacing": Linter.RuleEntry<["never" | "always"]>;
+
+    /**
+     * Rule to require or disallow Unicode byte order mark (BOM).
+     *
+     * @since 2.11.0
+     * @see https://eslint.org/docs/rules/unicode-bom
+     */
+    "unicode-bom": Linter.RuleEntry<["never" | "always"]>;
+
+    /**
+     * Rule to require parenthesis around regex literals.
+     *
+     * @since 0.1.0
+     * @see https://eslint.org/docs/rules/wrap-regex
+     */
+    "wrap-regex": Linter.RuleEntry<[]>;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/rules/variables.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/variables.d.ts
new file mode 100644
index 0000000..6347531
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/rules/variables.d.ts
@@ -0,0 +1,187 @@
+import { Linter } from "../index";
+
+export interface Variables extends Linter.RulesRecord {
+    /**
+     * Rule to require or disallow initialization in variable declarations.
+     *
+     * @since 1.0.0-rc-1
+     * @see https://eslint.org/docs/rules/init-declarations
+     */
+    "init-declarations":
+        | Linter.RuleEntry<["always"]>
+        | Linter.RuleEntry<
+              [
+                  "never",
+                  Partial<{
+                      ignoreForLoopInit: boolean;
+                  }>,
+              ]
+          >;
+
+    /**
+     * Rule to disallow deleting variables.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-delete-var
+     */
+    "no-delete-var": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow labels that share a name with a variable.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-label-var
+     */
+    "no-label-var": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow specified global variables.
+     *
+     * @since 2.3.0
+     * @see https://eslint.org/docs/rules/no-restricted-globals
+     */
+    "no-restricted-globals": Linter.RuleEntry<
+        [
+            ...Array<
+                | string
+                | {
+                      name: string;
+                      message?: string | undefined;
+                  }
+            >
+        ]
+    >;
+
+    /**
+     * Rule to disallow variable declarations from shadowing variables declared in the outer scope.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-shadow
+     */
+    "no-shadow": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                builtinGlobals: boolean;
+                /**
+                 * @default 'functions'
+                 */
+                hoist: "functions" | "all" | "never";
+                allow: string[];
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow identifiers from shadowing restricted names.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.1.4
+     * @see https://eslint.org/docs/rules/no-shadow-restricted-names
+     */
+    "no-shadow-restricted-names": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of undeclared variables unless mentioned in `global` comments.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-undef
+     */
+    "no-undef": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default false
+                 */
+                typeof: boolean;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow initializing variables to `undefined`.
+     *
+     * @since 0.0.6
+     * @see https://eslint.org/docs/rules/no-undef-init
+     */
+    "no-undef-init": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow the use of `undefined` as an identifier.
+     *
+     * @since 0.7.1
+     * @see https://eslint.org/docs/rules/no-undefined
+     */
+    "no-undefined": Linter.RuleEntry<[]>;
+
+    /**
+     * Rule to disallow unused variables.
+     *
+     * @remarks
+     * Recommended by ESLint, the rule was enabled in `eslint:recommended`.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-unused-vars
+     */
+    "no-unused-vars": Linter.RuleEntry<
+        [
+            Partial<{
+                /**
+                 * @default 'all'
+                 */
+                vars: "all" | "local";
+                varsIgnorePattern: string;
+                /**
+                 * @default 'after-used'
+                 */
+                args: "after-used" | "all" | "none";
+                /**
+                 * @default false
+                 */
+                ignoreRestSiblings: boolean;
+                argsIgnorePattern: string;
+                /**
+                 * @default 'none'
+                 */
+                caughtErrors: "none" | "all";
+                caughtErrorsIgnorePattern: string;
+            }>,
+        ]
+    >;
+
+    /**
+     * Rule to disallow the use of variables before they are defined.
+     *
+     * @since 0.0.9
+     * @see https://eslint.org/docs/rules/no-use-before-define
+     */
+    "no-use-before-define": Linter.RuleEntry<
+        [
+            | Partial<{
+                  /**
+                   * @default true
+                   */
+                  functions: boolean;
+                  /**
+                   * @default true
+                   */
+                  classes: boolean;
+                  /**
+                   * @default true
+                   */
+                  variables: boolean;
+              }>
+            | "nofunc",
+        ]
+    >;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/eslint/use-at-your-own-risk.d.ts b/node_modules/mathjs/examples/node_modules/@types/eslint/use-at-your-own-risk.d.ts
new file mode 100644
index 0000000..29492ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/eslint/use-at-your-own-risk.d.ts
@@ -0,0 +1,8 @@
+/** @deprecated */
+export const builtinRules: Map<string, import("./index.js").Rule.RuleModule>;
+/** @deprecated */
+export class FileEnumerator {
+    constructor(params?: {cwd?: string, configArrayFactory?: any, extensions?: any, globInputPaths?: boolean, errorOnUnmatchedPattern?: boolean, ignore?: boolean});
+    isTargetPath(filePath: string, providedConfig?: any): boolean;
+    iterateFiles(patternOrPatterns: string | string[]): IterableIterator<{config: any, filePath: string, ignored: boolean}>;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@types/estree/LICENSE b/node_modules/mathjs/examples/node_modules/@types/estree/LICENSE
new file mode 100644
index 0000000..9e841e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/estree/LICENSE
@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE
diff --git a/node_modules/mathjs/examples/node_modules/@types/estree/README.md b/node_modules/mathjs/examples/node_modules/@types/estree/README.md
new file mode 100644
index 0000000..1d3dfee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/estree/README.md
@@ -0,0 +1,16 @@
+# Installation
+> `npm install --save @types/estree`
+
+# Summary
+This package contains type definitions for ESTree AST specification (https://github.com/estree/estree).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/estree.
+
+### Additional Details
+ * Last updated: Sun, 06 Feb 2022 12:01:26 GMT
+ * Dependencies: none
+ * Global values: none
+
+# Credits
+These definitions were written by [RReverser](https://github.com/RReverser).
diff --git a/node_modules/mathjs/examples/node_modules/@types/estree/flow.d.ts b/node_modules/mathjs/examples/node_modules/@types/estree/flow.d.ts
new file mode 100644
index 0000000..605765e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/estree/flow.d.ts
@@ -0,0 +1,174 @@
+// Type definitions for ESTree AST extensions for Facebook Flow
+// Project: https://github.com/estree/estree
+// Definitions by: RReverser <https://github.com/RReverser>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+
+
+declare namespace ESTree {
+  interface FlowTypeAnnotation extends Node {}
+
+  interface FlowBaseTypeAnnotation extends FlowTypeAnnotation {}
+
+  interface FlowLiteralTypeAnnotation extends FlowTypeAnnotation, Literal {}
+
+  interface FlowDeclaration extends Declaration {}
+
+  interface AnyTypeAnnotation extends FlowBaseTypeAnnotation {}
+
+  interface ArrayTypeAnnotation extends FlowTypeAnnotation {
+    elementType: FlowTypeAnnotation;
+  }
+
+  interface BooleanLiteralTypeAnnotation extends FlowLiteralTypeAnnotation {}
+
+  interface BooleanTypeAnnotation extends FlowBaseTypeAnnotation {}
+
+  interface ClassImplements extends Node {
+    id: Identifier;
+    typeParameters?: TypeParameterInstantiation | null;
+  }
+
+  interface ClassProperty {
+    key: Expression;
+    value?: Expression | null;
+    typeAnnotation?: TypeAnnotation | null;
+    computed: boolean;
+    static: boolean;
+  }
+
+  interface DeclareClass extends FlowDeclaration {
+    id: Identifier;
+    typeParameters?: TypeParameterDeclaration | null;
+    body: ObjectTypeAnnotation;
+    extends: Array<InterfaceExtends>;
+  }
+
+  interface DeclareFunction extends FlowDeclaration {
+    id: Identifier;
+  }
+
+  interface DeclareModule extends FlowDeclaration {
+    id: Literal | Identifier;
+    body: BlockStatement;
+  }
+
+  interface DeclareVariable extends FlowDeclaration {
+    id: Identifier;
+  }
+
+  interface FunctionTypeAnnotation extends FlowTypeAnnotation {
+    params: Array<FunctionTypeParam>;
+    returnType: FlowTypeAnnotation;
+    rest?: FunctionTypeParam | null;
+    typeParameters?: TypeParameterDeclaration | null;
+  }
+
+  interface FunctionTypeParam {
+    name: Identifier;
+    typeAnnotation: FlowTypeAnnotation;
+    optional: boolean;
+  }
+
+  interface GenericTypeAnnotation extends FlowTypeAnnotation {
+    id: Identifier | QualifiedTypeIdentifier;
+    typeParameters?: TypeParameterInstantiation | null;
+  }
+
+  interface InterfaceExtends extends Node {
+    id: Identifier | QualifiedTypeIdentifier;
+    typeParameters?: TypeParameterInstantiation | null;
+  }
+
+  interface InterfaceDeclaration extends FlowDeclaration {
+    id: Identifier;
+    typeParameters?: TypeParameterDeclaration | null;
+    extends: Array<InterfaceExtends>;
+    body: ObjectTypeAnnotation;
+  }
+
+  interface IntersectionTypeAnnotation extends FlowTypeAnnotation {
+    types: Array<FlowTypeAnnotation>;
+  }
+
+  interface MixedTypeAnnotation extends FlowBaseTypeAnnotation {}
+
+  interface NullableTypeAnnotation extends FlowTypeAnnotation {
+    typeAnnotation: TypeAnnotation;
+  }
+
+  interface NumberLiteralTypeAnnotation extends FlowLiteralTypeAnnotation {}
+
+  interface NumberTypeAnnotation extends FlowBaseTypeAnnotation {}
+
+  interface StringLiteralTypeAnnotation extends FlowLiteralTypeAnnotation {}
+
+  interface StringTypeAnnotation extends FlowBaseTypeAnnotation {}
+
+  interface TupleTypeAnnotation extends FlowTypeAnnotation {
+    types: Array<FlowTypeAnnotation>;
+  }
+
+  interface TypeofTypeAnnotation extends FlowTypeAnnotation {
+    argument: FlowTypeAnnotation;
+  }
+
+  interface TypeAlias extends FlowDeclaration {
+    id: Identifier;
+    typeParameters?: TypeParameterDeclaration | null;
+    right: FlowTypeAnnotation;
+  }
+
+  interface TypeAnnotation extends Node {
+    typeAnnotation: FlowTypeAnnotation;
+  }
+
+  interface TypeCastExpression extends Expression {
+    expression: Expression;
+    typeAnnotation: TypeAnnotation;
+  }
+
+  interface TypeParameterDeclaration extends Node {
+    params: Array<Identifier>;
+  }
+
+  interface TypeParameterInstantiation extends Node {
+    params: Array<FlowTypeAnnotation>;
+  }
+
+  interface ObjectTypeAnnotation extends FlowTypeAnnotation {
+    properties: Array<ObjectTypeProperty>;
+    indexers: Array<ObjectTypeIndexer>;
+    callProperties: Array<ObjectTypeCallProperty>;
+  }
+
+  interface ObjectTypeCallProperty extends Node {
+    value: FunctionTypeAnnotation;
+    static: boolean;
+  }
+
+  interface ObjectTypeIndexer extends Node {
+    id: Identifier;
+    key: FlowTypeAnnotation;
+    value: FlowTypeAnnotation;
+    static: boolean;
+  }
+
+  interface ObjectTypeProperty extends Node {
+    key: Expression;
+    value: FlowTypeAnnotation;
+    optional: boolean;
+    static: boolean;
+  }
+
+  interface QualifiedTypeIdentifier extends Node {
+    qualification: Identifier | QualifiedTypeIdentifier;
+    id: Identifier;
+  }
+
+  interface UnionTypeAnnotation extends FlowTypeAnnotation {
+    types: Array<FlowTypeAnnotation>;
+  }
+
+  interface VoidTypeAnnotation extends FlowBaseTypeAnnotation {}
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/estree/index.d.ts b/node_modules/mathjs/examples/node_modules/@types/estree/index.d.ts
new file mode 100644
index 0000000..c0db842
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/estree/index.d.ts
@@ -0,0 +1,595 @@
+// Type definitions for ESTree AST specification
+// Project: https://github.com/estree/estree
+// Definitions by: RReverser <https://github.com/RReverser>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+// This definition file follows a somewhat unusual format. ESTree allows
+// runtime type checks based on the `type` parameter. In order to explain this
+// to typescript we want to use discriminated union types:
+// https://github.com/Microsoft/TypeScript/pull/9163
+//
+// For ESTree this is a bit tricky because the high level interfaces like
+// Node or Function are pulling double duty. We want to pass common fields down
+// to the interfaces that extend them (like Identifier or
+// ArrowFunctionExpression), but you can't extend a type union or enforce
+// common fields on them. So we've split the high level interfaces into two
+// types, a base type which passes down inherited fields, and a type union of
+// all types which extend the base type. Only the type union is exported, and
+// the union is how other types refer to the collection of inheriting types.
+//
+// This makes the definitions file here somewhat more difficult to maintain,
+// but it has the notable advantage of making ESTree much easier to use as
+// an end user.
+
+interface BaseNodeWithoutComments {
+  // Every leaf interface that extends BaseNode must specify a type property.
+  // The type property should be a string literal. For example, Identifier
+  // has: `type: "Identifier"`
+  type: string;
+  loc?: SourceLocation | null | undefined;
+  range?: [number, number] | undefined;
+}
+
+interface BaseNode extends BaseNodeWithoutComments {
+  leadingComments?: Array<Comment> | undefined;
+  trailingComments?: Array<Comment> | undefined;
+}
+
+export type Node =
+    Identifier | Literal | Program | Function | SwitchCase | CatchClause |
+    VariableDeclarator | Statement | Expression | PrivateIdentifier | Property | PropertyDefinition |
+    AssignmentProperty | Super | TemplateElement | SpreadElement | Pattern |
+    ClassBody | Class | MethodDefinition | ModuleDeclaration | ModuleSpecifier;
+
+export interface Comment extends BaseNodeWithoutComments {
+  type: "Line" | "Block";
+  value: string;
+}
+
+interface SourceLocation {
+  source?: string | null | undefined;
+  start: Position;
+  end: Position;
+}
+
+export interface Position {
+  /** >= 1 */
+  line: number;
+  /** >= 0 */
+  column: number;
+}
+
+export interface Program extends BaseNode {
+  type: "Program";
+  sourceType: "script" | "module";
+  body: Array<Directive | Statement | ModuleDeclaration>;
+  comments?: Array<Comment> | undefined;
+}
+
+export interface Directive extends BaseNode {
+  type: "ExpressionStatement";
+  expression: Literal;
+  directive: string;
+}
+
+interface BaseFunction extends BaseNode {
+  params: Array<Pattern>;
+  generator?: boolean | undefined;
+  async?: boolean | undefined;
+  // The body is either BlockStatement or Expression because arrow functions
+  // can have a body that's either. FunctionDeclarations and
+  // FunctionExpressions have only BlockStatement bodies.
+  body: BlockStatement | Expression;
+}
+
+export type Function =
+    FunctionDeclaration | FunctionExpression | ArrowFunctionExpression;
+
+export type Statement =
+    ExpressionStatement | BlockStatement | StaticBlock | EmptyStatement |
+    DebuggerStatement | WithStatement | ReturnStatement | LabeledStatement |
+    BreakStatement | ContinueStatement | IfStatement | SwitchStatement |
+    ThrowStatement | TryStatement | WhileStatement | DoWhileStatement |
+    ForStatement | ForInStatement | ForOfStatement | Declaration;
+
+interface BaseStatement extends BaseNode { }
+
+export interface EmptyStatement extends BaseStatement {
+  type: "EmptyStatement";
+}
+
+export interface BlockStatement extends BaseStatement {
+  type: "BlockStatement";
+  body: Array<Statement>;
+  innerComments?: Array<Comment> | undefined;
+}
+
+export interface StaticBlock extends Omit<BlockStatement, 'type'> {
+    type: "StaticBlock";
+}
+
+export interface ExpressionStatement extends BaseStatement {
+  type: "ExpressionStatement";
+  expression: Expression;
+}
+
+export interface IfStatement extends BaseStatement {
+  type: "IfStatement";
+  test: Expression;
+  consequent: Statement;
+  alternate?: Statement | null | undefined;
+}
+
+export interface LabeledStatement extends BaseStatement {
+  type: "LabeledStatement";
+  label: Identifier;
+  body: Statement;
+}
+
+export interface BreakStatement extends BaseStatement {
+  type: "BreakStatement";
+  label?: Identifier | null | undefined;
+}
+
+export interface ContinueStatement extends BaseStatement {
+  type: "ContinueStatement";
+  label?: Identifier | null | undefined;
+}
+
+export interface WithStatement extends BaseStatement {
+  type: "WithStatement";
+  object: Expression;
+  body: Statement;
+}
+
+export interface SwitchStatement extends BaseStatement {
+  type: "SwitchStatement";
+  discriminant: Expression;
+  cases: Array<SwitchCase>;
+}
+
+export interface ReturnStatement extends BaseStatement {
+  type: "ReturnStatement";
+  argument?: Expression | null | undefined;
+}
+
+export interface ThrowStatement extends BaseStatement {
+  type: "ThrowStatement";
+  argument: Expression;
+}
+
+export interface TryStatement extends BaseStatement {
+  type: "TryStatement";
+  block: BlockStatement;
+  handler?: CatchClause | null | undefined;
+  finalizer?: BlockStatement | null | undefined;
+}
+
+export interface WhileStatement extends BaseStatement {
+  type: "WhileStatement";
+  test: Expression;
+  body: Statement;
+}
+
+export interface DoWhileStatement extends BaseStatement {
+  type: "DoWhileStatement";
+  body: Statement;
+  test: Expression;
+}
+
+export interface ForStatement extends BaseStatement {
+  type: "ForStatement";
+  init?: VariableDeclaration | Expression | null | undefined;
+  test?: Expression | null | undefined;
+  update?: Expression | null | undefined;
+  body: Statement;
+}
+
+interface BaseForXStatement extends BaseStatement {
+  left: VariableDeclaration | Pattern;
+  right: Expression;
+  body: Statement;
+}
+
+export interface ForInStatement extends BaseForXStatement {
+  type: "ForInStatement";
+}
+
+export interface DebuggerStatement extends BaseStatement {
+  type: "DebuggerStatement";
+}
+
+export type Declaration =
+      FunctionDeclaration | VariableDeclaration | ClassDeclaration;
+
+interface BaseDeclaration extends BaseStatement { }
+
+export interface FunctionDeclaration extends BaseFunction, BaseDeclaration {
+  type: "FunctionDeclaration";
+  /** It is null when a function declaration is a part of the `export default function` statement */
+  id: Identifier | null;
+  body: BlockStatement;
+}
+
+export interface VariableDeclaration extends BaseDeclaration {
+  type: "VariableDeclaration";
+  declarations: Array<VariableDeclarator>;
+  kind: "var" | "let" | "const";
+}
+
+export interface VariableDeclarator extends BaseNode {
+  type: "VariableDeclarator";
+  id: Pattern;
+  init?: Expression | null | undefined;
+}
+
+type Expression =
+    ThisExpression | ArrayExpression | ObjectExpression | FunctionExpression |
+    ArrowFunctionExpression | YieldExpression | Literal | UnaryExpression |
+    UpdateExpression | BinaryExpression | AssignmentExpression |
+    LogicalExpression | MemberExpression | ConditionalExpression |
+    CallExpression | NewExpression | SequenceExpression | TemplateLiteral |
+    TaggedTemplateExpression | ClassExpression | MetaProperty | Identifier |
+    AwaitExpression | ImportExpression | ChainExpression;
+
+export interface BaseExpression extends BaseNode { }
+
+type ChainElement = SimpleCallExpression | MemberExpression;
+
+export interface ChainExpression extends BaseExpression {
+  type: "ChainExpression";
+  expression: ChainElement;
+}
+
+export interface ThisExpression extends BaseExpression {
+  type: "ThisExpression";
+}
+
+export interface ArrayExpression extends BaseExpression {
+  type: "ArrayExpression";
+  elements: Array<Expression | SpreadElement | null>;
+}
+
+export interface ObjectExpression extends BaseExpression {
+  type: "ObjectExpression";
+  properties: Array<Property | SpreadElement>;
+}
+
+export interface PrivateIdentifier extends BaseNode {
+    type: "PrivateIdentifier";
+    name: string;
+}
+
+export interface Property extends BaseNode {
+  type: "Property";
+  key: Expression | PrivateIdentifier;
+  value: Expression | Pattern; // Could be an AssignmentProperty
+  kind: "init" | "get" | "set";
+  method: boolean;
+  shorthand: boolean;
+  computed: boolean;
+}
+
+export interface PropertyDefinition extends BaseNode {
+    type: "PropertyDefinition";
+    key: Expression | PrivateIdentifier;
+    value?: Expression | null | undefined;
+    computed: boolean;
+    static: boolean;
+}
+
+export interface FunctionExpression extends BaseFunction, BaseExpression {
+  id?: Identifier | null | undefined;
+  type: "FunctionExpression";
+  body: BlockStatement;
+}
+
+export interface SequenceExpression extends BaseExpression {
+  type: "SequenceExpression";
+  expressions: Array<Expression>;
+}
+
+export interface UnaryExpression extends BaseExpression {
+  type: "UnaryExpression";
+  operator: UnaryOperator;
+  prefix: true;
+  argument: Expression;
+}
+
+export interface BinaryExpression extends BaseExpression {
+  type: "BinaryExpression";
+  operator: BinaryOperator;
+  left: Expression;
+  right: Expression;
+}
+
+export interface AssignmentExpression extends BaseExpression {
+  type: "AssignmentExpression";
+  operator: AssignmentOperator;
+  left: Pattern | MemberExpression;
+  right: Expression;
+}
+
+export interface UpdateExpression extends BaseExpression {
+  type: "UpdateExpression";
+  operator: UpdateOperator;
+  argument: Expression;
+  prefix: boolean;
+}
+
+export interface LogicalExpression extends BaseExpression {
+  type: "LogicalExpression";
+  operator: LogicalOperator;
+  left: Expression;
+  right: Expression;
+}
+
+export interface ConditionalExpression extends BaseExpression {
+  type: "ConditionalExpression";
+  test: Expression;
+  alternate: Expression;
+  consequent: Expression;
+}
+
+interface BaseCallExpression extends BaseExpression {
+  callee: Expression | Super;
+  arguments: Array<Expression | SpreadElement>;
+}
+export type CallExpression = SimpleCallExpression | NewExpression;
+
+export interface SimpleCallExpression extends BaseCallExpression {
+  type: "CallExpression";
+  optional: boolean;
+}
+
+export interface NewExpression extends BaseCallExpression {
+  type: "NewExpression";
+}
+
+export interface MemberExpression extends BaseExpression, BasePattern {
+  type: "MemberExpression";
+  object: Expression | Super;
+  property: Expression | PrivateIdentifier;
+  computed: boolean;
+  optional: boolean;
+}
+
+export type Pattern =
+    Identifier | ObjectPattern | ArrayPattern | RestElement |
+    AssignmentPattern | MemberExpression;
+
+interface BasePattern extends BaseNode { }
+
+export interface SwitchCase extends BaseNode {
+  type: "SwitchCase";
+  test?: Expression | null | undefined;
+  consequent: Array<Statement>;
+}
+
+export interface CatchClause extends BaseNode {
+  type: "CatchClause";
+  param: Pattern | null;
+  body: BlockStatement;
+}
+
+export interface Identifier extends BaseNode, BaseExpression, BasePattern {
+  type: "Identifier";
+  name: string;
+}
+
+export type Literal = SimpleLiteral | RegExpLiteral | BigIntLiteral;
+
+export interface SimpleLiteral extends BaseNode, BaseExpression {
+  type: "Literal";
+  value: string | boolean | number | null;
+  raw?: string | undefined;
+}
+
+export interface RegExpLiteral extends BaseNode, BaseExpression {
+  type: "Literal";
+  value?: RegExp | null | undefined;
+  regex: {
+    pattern: string;
+    flags: string;
+  };
+  raw?: string | undefined;
+}
+
+export interface BigIntLiteral extends BaseNode, BaseExpression {
+  type: "Literal";
+  value?: bigint | null | undefined;
+  bigint: string;
+  raw?: string | undefined;
+}
+
+export type UnaryOperator =
+    "-" | "+" | "!" | "~" | "typeof" | "void" | "delete";
+
+export type BinaryOperator =
+    "==" | "!=" | "===" | "!==" | "<" | "<=" | ">" | ">=" | "<<" |
+    ">>" | ">>>" | "+" | "-" | "*" | "/" | "%" | "**" | "|" | "^" | "&" | "in" |
+    "instanceof";
+
+export type LogicalOperator = "||" | "&&" | "??";
+
+export type AssignmentOperator =
+    "=" | "+=" | "-=" | "*=" | "/=" | "%=" | "**=" | "<<=" | ">>=" | ">>>=" |
+    "|=" | "^=" | "&=";
+
+export type UpdateOperator = "++" | "--";
+
+export interface ForOfStatement extends BaseForXStatement {
+  type: "ForOfStatement";
+  await: boolean;
+}
+
+export interface Super extends BaseNode {
+  type: "Super";
+}
+
+export interface SpreadElement extends BaseNode {
+  type: "SpreadElement";
+  argument: Expression;
+}
+
+export interface ArrowFunctionExpression extends BaseExpression, BaseFunction {
+  type: "ArrowFunctionExpression";
+  expression: boolean;
+  body: BlockStatement | Expression;
+}
+
+export interface YieldExpression extends BaseExpression {
+  type: "YieldExpression";
+  argument?: Expression | null | undefined;
+  delegate: boolean;
+}
+
+export interface TemplateLiteral extends BaseExpression {
+  type: "TemplateLiteral";
+  quasis: Array<TemplateElement>;
+  expressions: Array<Expression>;
+}
+
+export interface TaggedTemplateExpression extends BaseExpression {
+  type: "TaggedTemplateExpression";
+  tag: Expression;
+  quasi: TemplateLiteral;
+}
+
+export interface TemplateElement extends BaseNode {
+  type: "TemplateElement";
+  tail: boolean;
+  value: {
+    /** It is null when the template literal is tagged and the text has an invalid escape (e.g. - tag`\unicode and \u{55}`) */
+    cooked?: string | null | undefined;
+    raw: string;
+  };
+}
+
+export interface AssignmentProperty extends Property {
+  value: Pattern;
+  kind: "init";
+  method: boolean; // false
+}
+
+export interface ObjectPattern extends BasePattern {
+  type: "ObjectPattern";
+  properties: Array<AssignmentProperty | RestElement>;
+}
+
+export interface ArrayPattern extends BasePattern {
+  type: "ArrayPattern";
+  elements: Array<Pattern | null>;
+}
+
+export interface RestElement extends BasePattern {
+  type: "RestElement";
+  argument: Pattern;
+}
+
+export interface AssignmentPattern extends BasePattern {
+  type: "AssignmentPattern";
+  left: Pattern;
+  right: Expression;
+}
+
+export type Class = ClassDeclaration | ClassExpression;
+interface BaseClass extends BaseNode {
+  superClass?: Expression | null | undefined;
+  body: ClassBody;
+}
+
+export interface ClassBody extends BaseNode {
+  type: "ClassBody";
+  body: Array<MethodDefinition | PropertyDefinition | StaticBlock>;
+}
+
+export interface MethodDefinition extends BaseNode {
+  type: "MethodDefinition";
+  key: Expression | PrivateIdentifier;
+  value: FunctionExpression;
+  kind: "constructor" | "method" | "get" | "set";
+  computed: boolean;
+  static: boolean;
+}
+
+export interface ClassDeclaration extends BaseClass, BaseDeclaration {
+  type: "ClassDeclaration";
+  /** It is null when a class declaration is a part of the `export default class` statement */
+  id: Identifier | null;
+}
+
+export interface ClassExpression extends BaseClass, BaseExpression {
+  type: "ClassExpression";
+  id?: Identifier | null | undefined;
+}
+
+export interface MetaProperty extends BaseExpression {
+  type: "MetaProperty";
+  meta: Identifier;
+  property: Identifier;
+}
+
+export type ModuleDeclaration =
+    ImportDeclaration | ExportNamedDeclaration | ExportDefaultDeclaration |
+    ExportAllDeclaration;
+interface BaseModuleDeclaration extends BaseNode { }
+
+export type ModuleSpecifier =
+    ImportSpecifier | ImportDefaultSpecifier | ImportNamespaceSpecifier |
+    ExportSpecifier;
+interface BaseModuleSpecifier extends BaseNode {
+  local: Identifier;
+}
+
+export interface ImportDeclaration extends BaseModuleDeclaration {
+  type: "ImportDeclaration";
+  specifiers: Array<ImportSpecifier | ImportDefaultSpecifier | ImportNamespaceSpecifier>;
+  source: Literal;
+}
+
+export interface ImportSpecifier extends BaseModuleSpecifier {
+  type: "ImportSpecifier";
+  imported: Identifier;
+}
+
+export interface ImportExpression extends BaseExpression {
+  type: "ImportExpression";
+  source: Expression;
+}
+
+export interface ImportDefaultSpecifier extends BaseModuleSpecifier {
+  type: "ImportDefaultSpecifier";
+}
+
+export interface ImportNamespaceSpecifier extends BaseModuleSpecifier {
+  type: "ImportNamespaceSpecifier";
+}
+
+export interface ExportNamedDeclaration extends BaseModuleDeclaration {
+  type: "ExportNamedDeclaration";
+  declaration?: Declaration | null | undefined;
+  specifiers: Array<ExportSpecifier>;
+  source?: Literal | null | undefined;
+}
+
+export interface ExportSpecifier extends BaseModuleSpecifier {
+  type: "ExportSpecifier";
+  exported: Identifier;
+}
+
+export interface ExportDefaultDeclaration extends BaseModuleDeclaration {
+  type: "ExportDefaultDeclaration";
+  declaration: Declaration | Expression;
+}
+
+export interface ExportAllDeclaration extends BaseModuleDeclaration {
+  type: "ExportAllDeclaration";
+  exported: Identifier | null;
+  source: Literal;
+}
+
+export interface AwaitExpression extends BaseExpression {
+  type: "AwaitExpression";
+  argument: Expression;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/estree/package.json b/node_modules/mathjs/examples/node_modules/@types/estree/package.json
new file mode 100644
index 0000000..dea75b7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/estree/package.json
@@ -0,0 +1,25 @@
+{
+    "name": "@types/estree",
+    "version": "0.0.51",
+    "description": "TypeScript definitions for ESTree AST specification",
+    "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/estree",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "RReverser",
+            "url": "https://github.com/RReverser",
+            "githubUsername": "RReverser"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/estree"
+    },
+    "scripts": {},
+    "dependencies": {},
+    "typesPublisherContentHash": "95cbccd2dde8b8492f61e0e8049641ae05129705d9ba742955b711cfb71f3621",
+    "typeScriptVersion": "3.8"
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@types/json-schema/LICENSE b/node_modules/mathjs/examples/node_modules/@types/json-schema/LICENSE
new file mode 100644
index 0000000..9e841e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/json-schema/LICENSE
@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE
diff --git a/node_modules/mathjs/examples/node_modules/@types/json-schema/README.md b/node_modules/mathjs/examples/node_modules/@types/json-schema/README.md
new file mode 100644
index 0000000..e410136
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/json-schema/README.md
@@ -0,0 +1,16 @@
+# Installation
+> `npm install --save @types/json-schema`
+
+# Summary
+This package contains type definitions for json-schema 4.0, 6.0 and (https://github.com/kriszyp/json-schema).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/json-schema.
+
+### Additional Details
+ * Last updated: Fri, 25 Mar 2022 14:01:45 GMT
+ * Dependencies: none
+ * Global values: none
+
+# Credits
+These definitions were written by [Boris Cherny](https://github.com/bcherny), [Lucian Buzzo](https://github.com/lucianbuzzo), [Roland Groza](https://github.com/rolandjitsu), and [Jason Kwok](https://github.com/JasonHK).
diff --git a/node_modules/mathjs/examples/node_modules/@types/json-schema/index.d.ts b/node_modules/mathjs/examples/node_modules/@types/json-schema/index.d.ts
new file mode 100644
index 0000000..7a92dec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/json-schema/index.d.ts
@@ -0,0 +1,758 @@
+// Type definitions for json-schema 4.0, 6.0 and 7.0
+// Project: https://github.com/kriszyp/json-schema
+// Definitions by: Boris Cherny <https://github.com/bcherny>
+//                 Lucian Buzzo <https://github.com/lucianbuzzo>
+//                 Roland Groza <https://github.com/rolandjitsu>
+//                 Jason Kwok <https://github.com/JasonHK>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+// TypeScript Version: 2.2
+
+//==================================================================================================
+// JSON Schema Draft 04
+//==================================================================================================
+
+/**
+ * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.1
+ */
+export type JSONSchema4TypeName =
+    | 'string' //
+    | 'number'
+    | 'integer'
+    | 'boolean'
+    | 'object'
+    | 'array'
+    | 'null'
+    | 'any';
+
+/**
+ * @see https://tools.ietf.org/html/draft-zyp-json-schema-04#section-3.5
+ */
+export type JSONSchema4Type =
+    | string //
+    | number
+    | boolean
+    | JSONSchema4Object
+    | JSONSchema4Array
+    | null;
+
+// Workaround for infinite type recursion
+export interface JSONSchema4Object {
+    [key: string]: JSONSchema4Type;
+}
+
+// Workaround for infinite type recursion
+// https://github.com/Microsoft/TypeScript/issues/3496#issuecomment-128553540
+export interface JSONSchema4Array extends Array<JSONSchema4Type> {}
+
+/**
+ * Meta schema
+ *
+ * Recommended values:
+ * - 'http://json-schema.org/schema#'
+ * - 'http://json-schema.org/hyper-schema#'
+ * - 'http://json-schema.org/draft-04/schema#'
+ * - 'http://json-schema.org/draft-04/hyper-schema#'
+ * - 'http://json-schema.org/draft-03/schema#'
+ * - 'http://json-schema.org/draft-03/hyper-schema#'
+ *
+ * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-5
+ */
+export type JSONSchema4Version = string;
+
+/**
+ * JSON Schema V4
+ * @see https://tools.ietf.org/html/draft-zyp-json-schema-04
+ */
+export interface JSONSchema4 {
+    id?: string | undefined;
+    $ref?: string | undefined;
+    $schema?: JSONSchema4Version | undefined;
+
+    /**
+     * This attribute is a string that provides a short description of the
+     * instance property.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.21
+     */
+    title?: string | undefined;
+
+    /**
+     * This attribute is a string that provides a full description of the of
+     * purpose the instance property.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.22
+     */
+    description?: string | undefined;
+
+    default?: JSONSchema4Type | undefined;
+    multipleOf?: number | undefined;
+    maximum?: number | undefined;
+    exclusiveMaximum?: boolean | undefined;
+    minimum?: number | undefined;
+    exclusiveMinimum?: boolean | undefined;
+    maxLength?: number | undefined;
+    minLength?: number | undefined;
+    pattern?: string | undefined;
+
+    /**
+     * May only be defined when "items" is defined, and is a tuple of JSONSchemas.
+     *
+     * This provides a definition for additional items in an array instance
+     * when tuple definitions of the items is provided.  This can be false
+     * to indicate additional items in the array are not allowed, or it can
+     * be a schema that defines the schema of the additional items.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.6
+     */
+    additionalItems?: boolean | JSONSchema4 | undefined;
+
+    /**
+     * This attribute defines the allowed items in an instance array, and
+     * MUST be a schema or an array of schemas.  The default value is an
+     * empty schema which allows any value for items in the instance array.
+     *
+     * When this attribute value is a schema and the instance value is an
+     * array, then all the items in the array MUST be valid according to the
+     * schema.
+     *
+     * When this attribute value is an array of schemas and the instance
+     * value is an array, each position in the instance array MUST conform
+     * to the schema in the corresponding position for this array.  This
+     * called tuple typing.  When tuple typing is used, additional items are
+     * allowed, disallowed, or constrained by the "additionalItems"
+     * (Section 5.6) attribute using the same rules as
+     * "additionalProperties" (Section 5.4) for objects.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.5
+     */
+    items?: JSONSchema4 | JSONSchema4[] | undefined;
+
+    maxItems?: number | undefined;
+    minItems?: number | undefined;
+    uniqueItems?: boolean | undefined;
+    maxProperties?: number | undefined;
+    minProperties?: number | undefined;
+
+    /**
+     * This attribute indicates if the instance must have a value, and not
+     * be undefined. This is false by default, making the instance
+     * optional.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.7
+     */
+    required?: boolean | string[] | undefined;
+
+    /**
+     * This attribute defines a schema for all properties that are not
+     * explicitly defined in an object type definition. If specified, the
+     * value MUST be a schema or a boolean. If false is provided, no
+     * additional properties are allowed beyond the properties defined in
+     * the schema. The default value is an empty schema which allows any
+     * value for additional properties.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.4
+     */
+    additionalProperties?: boolean | JSONSchema4 | undefined;
+
+    definitions?: {
+        [k: string]: JSONSchema4;
+    } | undefined;
+
+    /**
+     * This attribute is an object with property definitions that define the
+     * valid values of instance object property values. When the instance
+     * value is an object, the property values of the instance object MUST
+     * conform to the property definitions in this object. In this object,
+     * each property definition's value MUST be a schema, and the property's
+     * name MUST be the name of the instance property that it defines.  The
+     * instance property value MUST be valid according to the schema from
+     * the property definition. Properties are considered unordered, the
+     * order of the instance properties MAY be in any order.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.2
+     */
+    properties?: {
+        [k: string]: JSONSchema4;
+    } | undefined;
+
+    /**
+     * This attribute is an object that defines the schema for a set of
+     * property names of an object instance. The name of each property of
+     * this attribute's object is a regular expression pattern in the ECMA
+     * 262/Perl 5 format, while the value is a schema. If the pattern
+     * matches the name of a property on the instance object, the value of
+     * the instance's property MUST be valid against the pattern name's
+     * schema value.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.3
+     */
+    patternProperties?: {
+        [k: string]: JSONSchema4;
+    } | undefined;
+    dependencies?: {
+        [k: string]: JSONSchema4 | string[];
+    } | undefined;
+
+    /**
+     * This provides an enumeration of all possible values that are valid
+     * for the instance property. This MUST be an array, and each item in
+     * the array represents a possible value for the instance value. If
+     * this attribute is defined, the instance value MUST be one of the
+     * values in the array in order for the schema to be valid.
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.19
+     */
+    enum?: JSONSchema4Type[] | undefined;
+
+    /**
+     * A single type, or a union of simple types
+     */
+    type?: JSONSchema4TypeName | JSONSchema4TypeName[] | undefined;
+
+    allOf?: JSONSchema4[] | undefined;
+    anyOf?: JSONSchema4[] | undefined;
+    oneOf?: JSONSchema4[] | undefined;
+    not?: JSONSchema4 | undefined;
+
+    /**
+     * The value of this property MUST be another schema which will provide
+     * a base schema which the current schema will inherit from.  The
+     * inheritance rules are such that any instance that is valid according
+     * to the current schema MUST be valid according to the referenced
+     * schema.  This MAY also be an array, in which case, the instance MUST
+     * be valid for all the schemas in the array.  A schema that extends
+     * another schema MAY define additional attributes, constrain existing
+     * attributes, or add other constraints.
+     *
+     * Conceptually, the behavior of extends can be seen as validating an
+     * instance against all constraints in the extending schema as well as
+     * the extended schema(s).
+     *
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-03#section-5.26
+     */
+    extends?: string | string[] | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-zyp-json-schema-04#section-5.6
+     */
+    [k: string]: any;
+
+    format?: string | undefined;
+}
+
+//==================================================================================================
+// JSON Schema Draft 06
+//==================================================================================================
+
+export type JSONSchema6TypeName =
+    | 'string' //
+    | 'number'
+    | 'integer'
+    | 'boolean'
+    | 'object'
+    | 'array'
+    | 'null'
+    | 'any';
+
+export type JSONSchema6Type =
+    | string //
+    | number
+    | boolean
+    | JSONSchema6Object
+    | JSONSchema6Array
+    | null;
+
+// Workaround for infinite type recursion
+export interface JSONSchema6Object {
+    [key: string]: JSONSchema6Type;
+}
+
+// Workaround for infinite type recursion
+// https://github.com/Microsoft/TypeScript/issues/3496#issuecomment-128553540
+export interface JSONSchema6Array extends Array<JSONSchema6Type> {}
+
+/**
+ * Meta schema
+ *
+ * Recommended values:
+ * - 'http://json-schema.org/schema#'
+ * - 'http://json-schema.org/hyper-schema#'
+ * - 'http://json-schema.org/draft-06/schema#'
+ * - 'http://json-schema.org/draft-06/hyper-schema#'
+ *
+ * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-5
+ */
+export type JSONSchema6Version = string;
+
+/**
+ * JSON Schema V6
+ * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01
+ */
+export type JSONSchema6Definition = JSONSchema6 | boolean;
+export interface JSONSchema6 {
+    $id?: string | undefined;
+    $ref?: string | undefined;
+    $schema?: JSONSchema6Version | undefined;
+
+    /**
+     * Must be strictly greater than 0.
+     * A numeric instance is valid only if division by this keyword's value results in an integer.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.1
+     */
+    multipleOf?: number | undefined;
+
+    /**
+     * Representing an inclusive upper limit for a numeric instance.
+     * This keyword validates only if the instance is less than or exactly equal to "maximum".
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.2
+     */
+    maximum?: number | undefined;
+
+    /**
+     * Representing an exclusive upper limit for a numeric instance.
+     * This keyword validates only if the instance is strictly less than (not equal to) to "exclusiveMaximum".
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.3
+     */
+    exclusiveMaximum?: number | undefined;
+
+    /**
+     * Representing an inclusive lower limit for a numeric instance.
+     * This keyword validates only if the instance is greater than or exactly equal to "minimum".
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.4
+     */
+    minimum?: number | undefined;
+
+    /**
+     * Representing an exclusive lower limit for a numeric instance.
+     * This keyword validates only if the instance is strictly greater than (not equal to) to "exclusiveMinimum".
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.5
+     */
+    exclusiveMinimum?: number | undefined;
+
+    /**
+     * Must be a non-negative integer.
+     * A string instance is valid against this keyword if its length is less than, or equal to, the value of this keyword.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.6
+     */
+    maxLength?: number | undefined;
+
+    /**
+     * Must be a non-negative integer.
+     * A string instance is valid against this keyword if its length is greater than, or equal to, the value of this keyword.
+     * Omitting this keyword has the same behavior as a value of 0.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.7
+     */
+    minLength?: number | undefined;
+
+    /**
+     * Should be a valid regular expression, according to the ECMA 262 regular expression dialect.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.8
+     */
+    pattern?: string | undefined;
+
+    /**
+     * This keyword determines how child instances validate for arrays, and does not directly validate the immediate instance itself.
+     * Omitting this keyword has the same behavior as an empty schema.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.9
+     */
+    items?: JSONSchema6Definition | JSONSchema6Definition[] | undefined;
+
+    /**
+     * This keyword determines how child instances validate for arrays, and does not directly validate the immediate instance itself.
+     * If "items" is an array of schemas, validation succeeds if every instance element
+     * at a position greater than the size of "items" validates against "additionalItems".
+     * Otherwise, "additionalItems" MUST be ignored, as the "items" schema
+     * (possibly the default value of an empty schema) is applied to all elements.
+     * Omitting this keyword has the same behavior as an empty schema.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.10
+     */
+    additionalItems?: JSONSchema6Definition | undefined;
+
+    /**
+     * Must be a non-negative integer.
+     * An array instance is valid against "maxItems" if its size is less than, or equal to, the value of this keyword.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.11
+     */
+    maxItems?: number | undefined;
+
+    /**
+     * Must be a non-negative integer.
+     * An array instance is valid against "maxItems" if its size is greater than, or equal to, the value of this keyword.
+     * Omitting this keyword has the same behavior as a value of 0.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.12
+     */
+    minItems?: number | undefined;
+
+    /**
+     * If this keyword has boolean value false, the instance validates successfully.
+     * If it has boolean value true, the instance validates successfully if all of its elements are unique.
+     * Omitting this keyword has the same behavior as a value of false.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.13
+     */
+    uniqueItems?: boolean | undefined;
+
+    /**
+     * An array instance is valid against "contains" if at least one of its elements is valid against the given schema.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.14
+     */
+    contains?: JSONSchema6Definition | undefined;
+
+    /**
+     * Must be a non-negative integer.
+     * An object instance is valid against "maxProperties" if its number of properties is less than, or equal to, the value of this keyword.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.15
+     */
+    maxProperties?: number | undefined;
+
+    /**
+     * Must be a non-negative integer.
+     * An object instance is valid against "maxProperties" if its number of properties is greater than,
+     * or equal to, the value of this keyword.
+     * Omitting this keyword has the same behavior as a value of 0.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.16
+     */
+    minProperties?: number | undefined;
+
+    /**
+     * Elements of this array must be unique.
+     * An object instance is valid against this keyword if every item in the array is the name of a property in the instance.
+     * Omitting this keyword has the same behavior as an empty array.
+     *
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.17
+     */
+    required?: string[] | undefined;
+
+    /**
+     * This keyword determines how child instances validate for objects, and does not directly validate the immediate instance itself.
+     * Validation succeeds if, for each name that appears in both the instance and as a name within this keyword's value,
+     * the child instance for that name successfully validates against the corresponding schema.
+     * Omitting this keyword has the same behavior as an empty object.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.18
+     */
+    properties?: {
+        [k: string]: JSONSchema6Definition;
+    } | undefined;
+
+    /**
+     * This attribute is an object that defines the schema for a set of property names of an object instance.
+     * The name of each property of this attribute's object is a regular expression pattern in the ECMA 262, while the value is a schema.
+     * If the pattern matches the name of a property on the instance object, the value of the instance's property
+     * MUST be valid against the pattern name's schema value.
+     * Omitting this keyword has the same behavior as an empty object.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.19
+     */
+    patternProperties?: {
+        [k: string]: JSONSchema6Definition;
+    } | undefined;
+
+    /**
+     * This attribute defines a schema for all properties that are not explicitly defined in an object type definition.
+     * If specified, the value MUST be a schema or a boolean.
+     * If false is provided, no additional properties are allowed beyond the properties defined in the schema.
+     * The default value is an empty schema which allows any value for additional properties.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.20
+     */
+    additionalProperties?: JSONSchema6Definition | undefined;
+
+    /**
+     * This keyword specifies rules that are evaluated if the instance is an object and contains a certain property.
+     * Each property specifies a dependency.
+     * If the dependency value is an array, each element in the array must be unique.
+     * Omitting this keyword has the same behavior as an empty object.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.21
+     */
+    dependencies?: {
+        [k: string]: JSONSchema6Definition | string[];
+    } | undefined;
+
+    /**
+     * Takes a schema which validates the names of all properties rather than their values.
+     * Note the property name that the schema is testing will always be a string.
+     * Omitting this keyword has the same behavior as an empty schema.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.22
+     */
+    propertyNames?: JSONSchema6Definition | undefined;
+
+    /**
+     * This provides an enumeration of all possible values that are valid
+     * for the instance property. This MUST be an array, and each item in
+     * the array represents a possible value for the instance value. If
+     * this attribute is defined, the instance value MUST be one of the
+     * values in the array in order for the schema to be valid.
+     *
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.23
+     */
+    enum?: JSONSchema6Type[] | undefined;
+
+    /**
+     * More readable form of a one-element "enum"
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.24
+     */
+    const?: JSONSchema6Type | undefined;
+
+    /**
+     * A single type, or a union of simple types
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.25
+     */
+    type?: JSONSchema6TypeName | JSONSchema6TypeName[] | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.26
+     */
+    allOf?: JSONSchema6Definition[] | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.27
+     */
+    anyOf?: JSONSchema6Definition[] | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.28
+     */
+    oneOf?: JSONSchema6Definition[] | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-6.29
+     */
+    not?: JSONSchema6Definition | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-7.1
+     */
+    definitions?: {
+        [k: string]: JSONSchema6Definition;
+    } | undefined;
+
+    /**
+     * This attribute is a string that provides a short description of the instance property.
+     *
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-7.2
+     */
+    title?: string | undefined;
+
+    /**
+     * This attribute is a string that provides a full description of the of purpose the instance property.
+     *
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-7.2
+     */
+    description?: string | undefined;
+
+    /**
+     * This keyword can be used to supply a default JSON value associated with a particular schema.
+     * It is RECOMMENDED that a default value be valid against the associated schema.
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-7.3
+     */
+    default?: JSONSchema6Type | undefined;
+
+    /**
+     * Array of examples with no validation effect the value of "default" is usable as an example without repeating it under this keyword
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-7.4
+     */
+    examples?: JSONSchema6Type[] | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-wright-json-schema-validation-01#section-8
+     */
+    format?: string | undefined;
+}
+
+//==================================================================================================
+// JSON Schema Draft 07
+//==================================================================================================
+// https://tools.ietf.org/html/draft-handrews-json-schema-validation-01
+//--------------------------------------------------------------------------------------------------
+
+/**
+ * Primitive type
+ * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.1.1
+ */
+export type JSONSchema7TypeName =
+    | 'string' //
+    | 'number'
+    | 'integer'
+    | 'boolean'
+    | 'object'
+    | 'array'
+    | 'null';
+
+/**
+ * Primitive type
+ * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.1.1
+ */
+export type JSONSchema7Type =
+    | string //
+    | number
+    | boolean
+    | JSONSchema7Object
+    | JSONSchema7Array
+    | null;
+
+// Workaround for infinite type recursion
+export interface JSONSchema7Object {
+    [key: string]: JSONSchema7Type;
+}
+
+// Workaround for infinite type recursion
+// https://github.com/Microsoft/TypeScript/issues/3496#issuecomment-128553540
+export interface JSONSchema7Array extends Array<JSONSchema7Type> {}
+
+/**
+ * Meta schema
+ *
+ * Recommended values:
+ * - 'http://json-schema.org/schema#'
+ * - 'http://json-schema.org/hyper-schema#'
+ * - 'http://json-schema.org/draft-07/schema#'
+ * - 'http://json-schema.org/draft-07/hyper-schema#'
+ *
+ * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-5
+ */
+export type JSONSchema7Version = string;
+
+/**
+ * JSON Schema v7
+ * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01
+ */
+export type JSONSchema7Definition = JSONSchema7 | boolean;
+export interface JSONSchema7 {
+    $id?: string | undefined;
+    $ref?: string | undefined;
+    $schema?: JSONSchema7Version | undefined;
+    $comment?: string | undefined;
+
+    /**
+     * @see https://datatracker.ietf.org/doc/html/draft-bhutton-json-schema-00#section-8.2.4
+     * @see https://datatracker.ietf.org/doc/html/draft-bhutton-json-schema-validation-00#appendix-A
+     */
+    $defs?: {
+              [key: string]: JSONSchema7Definition;
+    } | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.1
+     */
+    type?: JSONSchema7TypeName | JSONSchema7TypeName[] | undefined;
+    enum?: JSONSchema7Type[] | undefined;
+    const?: JSONSchema7Type | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.2
+     */
+    multipleOf?: number | undefined;
+    maximum?: number | undefined;
+    exclusiveMaximum?: number | undefined;
+    minimum?: number | undefined;
+    exclusiveMinimum?: number | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.3
+     */
+    maxLength?: number | undefined;
+    minLength?: number | undefined;
+    pattern?: string | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.4
+     */
+    items?: JSONSchema7Definition | JSONSchema7Definition[] | undefined;
+    additionalItems?: JSONSchema7Definition | undefined;
+    maxItems?: number | undefined;
+    minItems?: number | undefined;
+    uniqueItems?: boolean | undefined;
+    contains?: JSONSchema7 | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.5
+     */
+    maxProperties?: number | undefined;
+    minProperties?: number | undefined;
+    required?: string[] | undefined;
+    properties?: {
+        [key: string]: JSONSchema7Definition;
+    } | undefined;
+    patternProperties?: {
+        [key: string]: JSONSchema7Definition;
+    } | undefined;
+    additionalProperties?: JSONSchema7Definition | undefined;
+    dependencies?: {
+        [key: string]: JSONSchema7Definition | string[];
+    } | undefined;
+    propertyNames?: JSONSchema7Definition | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.6
+     */
+    if?: JSONSchema7Definition | undefined;
+    then?: JSONSchema7Definition | undefined;
+    else?: JSONSchema7Definition | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-6.7
+     */
+    allOf?: JSONSchema7Definition[] | undefined;
+    anyOf?: JSONSchema7Definition[] | undefined;
+    oneOf?: JSONSchema7Definition[] | undefined;
+    not?: JSONSchema7Definition | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-7
+     */
+    format?: string | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-8
+     */
+    contentMediaType?: string | undefined;
+    contentEncoding?: string | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-9
+     */
+    definitions?: {
+        [key: string]: JSONSchema7Definition;
+    } | undefined;
+
+    /**
+     * @see https://tools.ietf.org/html/draft-handrews-json-schema-validation-01#section-10
+     */
+    title?: string | undefined;
+    description?: string | undefined;
+    default?: JSONSchema7Type | undefined;
+    readOnly?: boolean | undefined;
+    writeOnly?: boolean | undefined;
+    examples?: JSONSchema7Type | undefined;
+}
+
+export interface ValidationResult {
+    valid: boolean;
+    errors: ValidationError[];
+}
+
+export interface ValidationError {
+    property: string;
+    message: string;
+}
+
+/**
+ * To use the validator call JSONSchema.validate with an instance object and an optional schema object.
+ * If a schema is provided, it will be used to validate. If the instance object refers to a schema (self-validating),
+ * that schema will be used to validate and the schema parameter is not necessary (if both exist,
+ * both validations will occur).
+ */
+export function validate(instance: {}, schema: JSONSchema4 | JSONSchema6 | JSONSchema7): ValidationResult;
+
+/**
+ * The checkPropertyChange method will check to see if an value can legally be in property with the given schema
+ * This is slightly different than the validate method in that it will fail if the schema is readonly and it will
+ * not check for self-validation, it is assumed that the passed in value is already internally valid.
+ */
+export function checkPropertyChange(
+    value: any,
+    schema: JSONSchema4 | JSONSchema6 | JSONSchema7,
+    property: string,
+): ValidationResult;
+
+/**
+ * This checks to ensure that the result is valid and will throw an appropriate error message if it is not.
+ */
+export function mustBeValid(result: ValidationResult): void;
diff --git a/node_modules/mathjs/examples/node_modules/@types/json-schema/package.json b/node_modules/mathjs/examples/node_modules/@types/json-schema/package.json
new file mode 100644
index 0000000..f4ac271
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/json-schema/package.json
@@ -0,0 +1,40 @@
+{
+    "name": "@types/json-schema",
+    "version": "7.0.11",
+    "description": "TypeScript definitions for json-schema 4.0, 6.0 and",
+    "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/json-schema",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "Boris Cherny",
+            "url": "https://github.com/bcherny",
+            "githubUsername": "bcherny"
+        },
+        {
+            "name": "Lucian Buzzo",
+            "url": "https://github.com/lucianbuzzo",
+            "githubUsername": "lucianbuzzo"
+        },
+        {
+            "name": "Roland Groza",
+            "url": "https://github.com/rolandjitsu",
+            "githubUsername": "rolandjitsu"
+        },
+        {
+            "name": "Jason Kwok",
+            "url": "https://github.com/JasonHK",
+            "githubUsername": "JasonHK"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/json-schema"
+    },
+    "scripts": {},
+    "dependencies": {},
+    "typesPublisherContentHash": "84a402b9e31ddb097f08b5c07c08590bf087035c483db7a4071a04903775dc44",
+    "typeScriptVersion": "3.9"
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/LICENSE b/node_modules/mathjs/examples/node_modules/@types/node/LICENSE
new file mode 100644
index 0000000..9e841e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/LICENSE
@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/README.md b/node_modules/mathjs/examples/node_modules/@types/node/README.md
new file mode 100644
index 0000000..cb40e88
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/README.md
@@ -0,0 +1,16 @@
+# Installation
+> `npm install --save @types/node`
+
+# Summary
+This package contains type definitions for Node.js (https://nodejs.org/).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/node.
+
+### Additional Details
+ * Last updated: Wed, 23 Mar 2022 17:01:45 GMT
+ * Dependencies: none
+ * Global values: `AbortController`, `AbortSignal`, `__dirname`, `__filename`, `console`, `exports`, `gc`, `global`, `module`, `process`, `require`
+
+# Credits
+These definitions were written by [Microsoft TypeScript](https://github.com/Microsoft), [DefinitelyTyped](https://github.com/DefinitelyTyped), [Alberto Schiabel](https://github.com/jkomyno), [Alvis HT Tang](https://github.com/alvis), [Andrew Makarov](https://github.com/r3nya), [Benjamin Toueg](https://github.com/btoueg), [Chigozirim C.](https://github.com/smac89), [David Junger](https://github.com/touffy), [Deividas Bakanas](https://github.com/DeividasBakanas), [Eugene Y. Q. Shen](https://github.com/eyqs), [Hannes Magnusson](https://github.com/Hannes-Magnusson-CK), [Huw](https://github.com/hoo29), [Kelvin Jin](https://github.com/kjin), [Klaus Meinhardt](https://github.com/ajafff), [Lishude](https://github.com/islishude), [Mariusz Wiktorczyk](https://github.com/mwiktorczyk), [Mohsen Azimi](https://github.com/mohsen1), [Nicolas Even](https://github.com/n-e), [Nikita Galkin](https://github.com/galkin), [Parambir Singh](https://github.com/parambirs), [Sebastian Silbermann](https://github.com/eps1lon), [Simon Schick](https://github.com/SimonSchick), [Thomas den Hollander](https://github.com/ThomasdenH), [Wilco Bakker](https://github.com/WilcoBakker), [wwwy3y3](https://github.com/wwwy3y3), [Samuel Ainsworth](https://github.com/samuela), [Kyle Uehlein](https://github.com/kuehlein), [Thanik Bhongbhibhat](https://github.com/bhongy), [Marcin Kopacz](https://github.com/chyzwar), [Trivikram Kamat](https://github.com/trivikr), [Junxiao Shi](https://github.com/yoursunny), [Ilia Baryshnikov](https://github.com/qwelias), [ExE Boss](https://github.com/ExE-Boss), [Piotr Błażejewicz](https://github.com/peterblazejewicz), [Anna Henningsen](https://github.com/addaleax), [Victor Perin](https://github.com/victorperin), [Yongsheng Zhang](https://github.com/ZYSzys), [NodeJS Contributors](https://github.com/NodeJS), [Linus Unnebäck](https://github.com/LinusU), and [wafuwafu13](https://github.com/wafuwafu13).
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/assert.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/assert.d.ts
new file mode 100644
index 0000000..fb71586
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/assert.d.ts
@@ -0,0 +1,912 @@
+/**
+ * The `assert` module provides a set of assertion functions for verifying
+ * invariants.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/assert.js)
+ */
+declare module 'assert' {
+    /**
+     * An alias of {@link ok}.
+     * @since v0.5.9
+     * @param value The input that is checked for being truthy.
+     */
+    function assert(value: unknown, message?: string | Error): asserts value;
+    namespace assert {
+        /**
+         * Indicates the failure of an assertion. All errors thrown by the `assert` module
+         * will be instances of the `AssertionError` class.
+         */
+        class AssertionError extends Error {
+            actual: unknown;
+            expected: unknown;
+            operator: string;
+            generatedMessage: boolean;
+            code: 'ERR_ASSERTION';
+            constructor(options?: {
+                /** If provided, the error message is set to this value. */
+                message?: string | undefined;
+                /** The `actual` property on the error instance. */
+                actual?: unknown | undefined;
+                /** The `expected` property on the error instance. */
+                expected?: unknown | undefined;
+                /** The `operator` property on the error instance. */
+                operator?: string | undefined;
+                /** If provided, the generated stack trace omits frames before this function. */
+                // tslint:disable-next-line:ban-types
+                stackStartFn?: Function | undefined;
+            });
+        }
+        /**
+         * This feature is currently experimental and behavior might still change.
+         * @since v14.2.0, v12.19.0
+         * @experimental
+         */
+        class CallTracker {
+            /**
+             * The wrapper function is expected to be called exactly `exact` times. If the
+             * function has not been called exactly `exact` times when `tracker.verify()` is called, then `tracker.verify()` will throw an
+             * error.
+             *
+             * ```js
+             * import assert from 'assert';
+             *
+             * // Creates call tracker.
+             * const tracker = new assert.CallTracker();
+             *
+             * function func() {}
+             *
+             * // Returns a function that wraps func() that must be called exact times
+             * // before tracker.verify().
+             * const callsfunc = tracker.calls(func);
+             * ```
+             * @since v14.2.0, v12.19.0
+             * @param [fn='A no-op function']
+             * @param [exact=1]
+             * @return that wraps `fn`.
+             */
+            calls(exact?: number): () => void;
+            calls<Func extends (...args: any[]) => any>(fn?: Func, exact?: number): Func;
+            /**
+             * The arrays contains information about the expected and actual number of calls of
+             * the functions that have not been called the expected number of times.
+             *
+             * ```js
+             * import assert from 'assert';
+             *
+             * // Creates call tracker.
+             * const tracker = new assert.CallTracker();
+             *
+             * function func() {}
+             *
+             * function foo() {}
+             *
+             * // Returns a function that wraps func() that must be called exact times
+             * // before tracker.verify().
+             * const callsfunc = tracker.calls(func, 2);
+             *
+             * // Returns an array containing information on callsfunc()
+             * tracker.report();
+             * // [
+             * //  {
+             * //    message: 'Expected the func function to be executed 2 time(s) but was
+             * //    executed 0 time(s).',
+             * //    actual: 0,
+             * //    expected: 2,
+             * //    operator: 'func',
+             * //    stack: stack trace
+             * //  }
+             * // ]
+             * ```
+             * @since v14.2.0, v12.19.0
+             * @return of objects containing information about the wrapper functions returned by `calls`.
+             */
+            report(): CallTrackerReportInformation[];
+            /**
+             * Iterates through the list of functions passed to `tracker.calls()` and will throw an error for functions that
+             * have not been called the expected number of times.
+             *
+             * ```js
+             * import assert from 'assert';
+             *
+             * // Creates call tracker.
+             * const tracker = new assert.CallTracker();
+             *
+             * function func() {}
+             *
+             * // Returns a function that wraps func() that must be called exact times
+             * // before tracker.verify().
+             * const callsfunc = tracker.calls(func, 2);
+             *
+             * callsfunc();
+             *
+             * // Will throw an error since callsfunc() was only called once.
+             * tracker.verify();
+             * ```
+             * @since v14.2.0, v12.19.0
+             */
+            verify(): void;
+        }
+        interface CallTrackerReportInformation {
+            message: string;
+            /** The actual number of times the function was called. */
+            actual: number;
+            /** The number of times the function was expected to be called. */
+            expected: number;
+            /** The name of the function that is wrapped. */
+            operator: string;
+            /** A stack trace of the function. */
+            stack: object;
+        }
+        type AssertPredicate = RegExp | (new () => object) | ((thrown: unknown) => boolean) | object | Error;
+        /**
+         * Throws an `AssertionError` with the provided error message or a default
+         * error message. If the `message` parameter is an instance of an `Error` then
+         * it will be thrown instead of the `AssertionError`.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.fail();
+         * // AssertionError [ERR_ASSERTION]: Failed
+         *
+         * assert.fail('boom');
+         * // AssertionError [ERR_ASSERTION]: boom
+         *
+         * assert.fail(new TypeError('need array'));
+         * // TypeError: need array
+         * ```
+         *
+         * Using `assert.fail()` with more than two arguments is possible but deprecated.
+         * See below for further details.
+         * @since v0.1.21
+         * @param [message='Failed']
+         */
+        function fail(message?: string | Error): never;
+        /** @deprecated since v10.0.0 - use fail([message]) or other assert functions instead. */
+        function fail(
+            actual: unknown,
+            expected: unknown,
+            message?: string | Error,
+            operator?: string,
+            // tslint:disable-next-line:ban-types
+            stackStartFn?: Function
+        ): never;
+        /**
+         * Tests if `value` is truthy. It is equivalent to`assert.equal(!!value, true, message)`.
+         *
+         * If `value` is not truthy, an `AssertionError` is thrown with a `message`property set equal to the value of the `message` parameter. If the `message`parameter is `undefined`, a default
+         * error message is assigned. If the `message`parameter is an instance of an `Error` then it will be thrown instead of the`AssertionError`.
+         * If no arguments are passed in at all `message` will be set to the string:`` 'No value argument passed to `assert.ok()`' ``.
+         *
+         * Be aware that in the `repl` the error message will be different to the one
+         * thrown in a file! See below for further details.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.ok(true);
+         * // OK
+         * assert.ok(1);
+         * // OK
+         *
+         * assert.ok();
+         * // AssertionError: No value argument passed to `assert.ok()`
+         *
+         * assert.ok(false, 'it\'s false');
+         * // AssertionError: it's false
+         *
+         * // In the repl:
+         * assert.ok(typeof 123 === 'string');
+         * // AssertionError: false == true
+         *
+         * // In a file (e.g. test.js):
+         * assert.ok(typeof 123 === 'string');
+         * // AssertionError: The expression evaluated to a falsy value:
+         * //
+         * //   assert.ok(typeof 123 === 'string')
+         *
+         * assert.ok(false);
+         * // AssertionError: The expression evaluated to a falsy value:
+         * //
+         * //   assert.ok(false)
+         *
+         * assert.ok(0);
+         * // AssertionError: The expression evaluated to a falsy value:
+         * //
+         * //   assert.ok(0)
+         * ```
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * // Using `assert()` works the same:
+         * assert(0);
+         * // AssertionError: The expression evaluated to a falsy value:
+         * //
+         * //   assert(0)
+         * ```
+         * @since v0.1.21
+         */
+        function ok(value: unknown, message?: string | Error): asserts value;
+        /**
+         * **Strict assertion mode**
+         *
+         * An alias of {@link strictEqual}.
+         *
+         * **Legacy assertion mode**
+         *
+         * > Stability: 3 - Legacy: Use {@link strictEqual} instead.
+         *
+         * Tests shallow, coercive equality between the `actual` and `expected` parameters
+         * using the [Abstract Equality Comparison](https://tc39.github.io/ecma262/#sec-abstract-equality-comparison) ( `==` ). `NaN` is special handled
+         * and treated as being identical in case both sides are `NaN`.
+         *
+         * ```js
+         * import assert from 'assert';
+         *
+         * assert.equal(1, 1);
+         * // OK, 1 == 1
+         * assert.equal(1, '1');
+         * // OK, 1 == '1'
+         * assert.equal(NaN, NaN);
+         * // OK
+         *
+         * assert.equal(1, 2);
+         * // AssertionError: 1 == 2
+         * assert.equal({ a: { b: 1 } }, { a: { b: 1 } });
+         * // AssertionError: { a: { b: 1 } } == { a: { b: 1 } }
+         * ```
+         *
+         * If the values are not equal, an `AssertionError` is thrown with a `message`property set equal to the value of the `message` parameter. If the `message`parameter is undefined, a default
+         * error message is assigned. If the `message`parameter is an instance of an `Error` then it will be thrown instead of the`AssertionError`.
+         * @since v0.1.21
+         */
+        function equal(actual: unknown, expected: unknown, message?: string | Error): void;
+        /**
+         * **Strict assertion mode**
+         *
+         * An alias of {@link notStrictEqual}.
+         *
+         * **Legacy assertion mode**
+         *
+         * > Stability: 3 - Legacy: Use {@link notStrictEqual} instead.
+         *
+         * Tests shallow, coercive inequality with the [Abstract Equality Comparison](https://tc39.github.io/ecma262/#sec-abstract-equality-comparison)(`!=` ). `NaN` is special handled and treated as
+         * being identical in case both
+         * sides are `NaN`.
+         *
+         * ```js
+         * import assert from 'assert';
+         *
+         * assert.notEqual(1, 2);
+         * // OK
+         *
+         * assert.notEqual(1, 1);
+         * // AssertionError: 1 != 1
+         *
+         * assert.notEqual(1, '1');
+         * // AssertionError: 1 != '1'
+         * ```
+         *
+         * If the values are equal, an `AssertionError` is thrown with a `message`property set equal to the value of the `message` parameter. If the `message`parameter is undefined, a default error
+         * message is assigned. If the `message`parameter is an instance of an `Error` then it will be thrown instead of the`AssertionError`.
+         * @since v0.1.21
+         */
+        function notEqual(actual: unknown, expected: unknown, message?: string | Error): void;
+        /**
+         * **Strict assertion mode**
+         *
+         * An alias of {@link deepStrictEqual}.
+         *
+         * **Legacy assertion mode**
+         *
+         * > Stability: 3 - Legacy: Use {@link deepStrictEqual} instead.
+         *
+         * Tests for deep equality between the `actual` and `expected` parameters. Consider
+         * using {@link deepStrictEqual} instead. {@link deepEqual} can have
+         * surprising results.
+         *
+         * _Deep equality_ means that the enumerable "own" properties of child objects
+         * are also recursively evaluated by the following rules.
+         * @since v0.1.21
+         */
+        function deepEqual(actual: unknown, expected: unknown, message?: string | Error): void;
+        /**
+         * **Strict assertion mode**
+         *
+         * An alias of {@link notDeepStrictEqual}.
+         *
+         * **Legacy assertion mode**
+         *
+         * > Stability: 3 - Legacy: Use {@link notDeepStrictEqual} instead.
+         *
+         * Tests for any deep inequality. Opposite of {@link deepEqual}.
+         *
+         * ```js
+         * import assert from 'assert';
+         *
+         * const obj1 = {
+         *   a: {
+         *     b: 1
+         *   }
+         * };
+         * const obj2 = {
+         *   a: {
+         *     b: 2
+         *   }
+         * };
+         * const obj3 = {
+         *   a: {
+         *     b: 1
+         *   }
+         * };
+         * const obj4 = Object.create(obj1);
+         *
+         * assert.notDeepEqual(obj1, obj1);
+         * // AssertionError: { a: { b: 1 } } notDeepEqual { a: { b: 1 } }
+         *
+         * assert.notDeepEqual(obj1, obj2);
+         * // OK
+         *
+         * assert.notDeepEqual(obj1, obj3);
+         * // AssertionError: { a: { b: 1 } } notDeepEqual { a: { b: 1 } }
+         *
+         * assert.notDeepEqual(obj1, obj4);
+         * // OK
+         * ```
+         *
+         * If the values are deeply equal, an `AssertionError` is thrown with a`message` property set equal to the value of the `message` parameter. If the`message` parameter is undefined, a default
+         * error message is assigned. If the`message` parameter is an instance of an `Error` then it will be thrown
+         * instead of the `AssertionError`.
+         * @since v0.1.21
+         */
+        function notDeepEqual(actual: unknown, expected: unknown, message?: string | Error): void;
+        /**
+         * Tests strict equality between the `actual` and `expected` parameters as
+         * determined by the [SameValue Comparison](https://tc39.github.io/ecma262/#sec-samevalue).
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.strictEqual(1, 2);
+         * // AssertionError [ERR_ASSERTION]: Expected inputs to be strictly equal:
+         * //
+         * // 1 !== 2
+         *
+         * assert.strictEqual(1, 1);
+         * // OK
+         *
+         * assert.strictEqual('Hello foobar', 'Hello World!');
+         * // AssertionError [ERR_ASSERTION]: Expected inputs to be strictly equal:
+         * // + actual - expected
+         * //
+         * // + 'Hello foobar'
+         * // - 'Hello World!'
+         * //          ^
+         *
+         * const apples = 1;
+         * const oranges = 2;
+         * assert.strictEqual(apples, oranges, `apples ${apples} !== oranges ${oranges}`);
+         * // AssertionError [ERR_ASSERTION]: apples 1 !== oranges 2
+         *
+         * assert.strictEqual(1, '1', new TypeError('Inputs are not identical'));
+         * // TypeError: Inputs are not identical
+         * ```
+         *
+         * If the values are not strictly equal, an `AssertionError` is thrown with a`message` property set equal to the value of the `message` parameter. If the`message` parameter is undefined, a
+         * default error message is assigned. If the`message` parameter is an instance of an `Error` then it will be thrown
+         * instead of the `AssertionError`.
+         * @since v0.1.21
+         */
+        function strictEqual<T>(actual: unknown, expected: T, message?: string | Error): asserts actual is T;
+        /**
+         * Tests strict inequality between the `actual` and `expected` parameters as
+         * determined by the [SameValue Comparison](https://tc39.github.io/ecma262/#sec-samevalue).
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.notStrictEqual(1, 2);
+         * // OK
+         *
+         * assert.notStrictEqual(1, 1);
+         * // AssertionError [ERR_ASSERTION]: Expected "actual" to be strictly unequal to:
+         * //
+         * // 1
+         *
+         * assert.notStrictEqual(1, '1');
+         * // OK
+         * ```
+         *
+         * If the values are strictly equal, an `AssertionError` is thrown with a`message` property set equal to the value of the `message` parameter. If the`message` parameter is undefined, a
+         * default error message is assigned. If the`message` parameter is an instance of an `Error` then it will be thrown
+         * instead of the `AssertionError`.
+         * @since v0.1.21
+         */
+        function notStrictEqual(actual: unknown, expected: unknown, message?: string | Error): void;
+        /**
+         * Tests for deep equality between the `actual` and `expected` parameters.
+         * "Deep" equality means that the enumerable "own" properties of child objects
+         * are recursively evaluated also by the following rules.
+         * @since v1.2.0
+         */
+        function deepStrictEqual<T>(actual: unknown, expected: T, message?: string | Error): asserts actual is T;
+        /**
+         * Tests for deep strict inequality. Opposite of {@link deepStrictEqual}.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.notDeepStrictEqual({ a: 1 }, { a: '1' });
+         * // OK
+         * ```
+         *
+         * If the values are deeply and strictly equal, an `AssertionError` is thrown
+         * with a `message` property set equal to the value of the `message` parameter. If
+         * the `message` parameter is undefined, a default error message is assigned. If
+         * the `message` parameter is an instance of an `Error` then it will be thrown
+         * instead of the `AssertionError`.
+         * @since v1.2.0
+         */
+        function notDeepStrictEqual(actual: unknown, expected: unknown, message?: string | Error): void;
+        /**
+         * Expects the function `fn` to throw an error.
+         *
+         * If specified, `error` can be a [`Class`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes),
+         * [`RegExp`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions), a validation function,
+         * a validation object where each property will be tested for strict deep equality,
+         * or an instance of error where each property will be tested for strict deep
+         * equality including the non-enumerable `message` and `name` properties. When
+         * using an object, it is also possible to use a regular expression, when
+         * validating against a string property. See below for examples.
+         *
+         * If specified, `message` will be appended to the message provided by the`AssertionError` if the `fn` call fails to throw or in case the error validation
+         * fails.
+         *
+         * Custom validation object/error instance:
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * const err = new TypeError('Wrong value');
+         * err.code = 404;
+         * err.foo = 'bar';
+         * err.info = {
+         *   nested: true,
+         *   baz: 'text'
+         * };
+         * err.reg = /abc/i;
+         *
+         * assert.throws(
+         *   () => {
+         *     throw err;
+         *   },
+         *   {
+         *     name: 'TypeError',
+         *     message: 'Wrong value',
+         *     info: {
+         *       nested: true,
+         *       baz: 'text'
+         *     }
+         *     // Only properties on the validation object will be tested for.
+         *     // Using nested objects requires all properties to be present. Otherwise
+         *     // the validation is going to fail.
+         *   }
+         * );
+         *
+         * // Using regular expressions to validate error properties:
+         * throws(
+         *   () => {
+         *     throw err;
+         *   },
+         *   {
+         *     // The `name` and `message` properties are strings and using regular
+         *     // expressions on those will match against the string. If they fail, an
+         *     // error is thrown.
+         *     name: /^TypeError$/,
+         *     message: /Wrong/,
+         *     foo: 'bar',
+         *     info: {
+         *       nested: true,
+         *       // It is not possible to use regular expressions for nested properties!
+         *       baz: 'text'
+         *     },
+         *     // The `reg` property contains a regular expression and only if the
+         *     // validation object contains an identical regular expression, it is going
+         *     // to pass.
+         *     reg: /abc/i
+         *   }
+         * );
+         *
+         * // Fails due to the different `message` and `name` properties:
+         * throws(
+         *   () => {
+         *     const otherErr = new Error('Not found');
+         *     // Copy all enumerable properties from `err` to `otherErr`.
+         *     for (const [key, value] of Object.entries(err)) {
+         *       otherErr[key] = value;
+         *     }
+         *     throw otherErr;
+         *   },
+         *   // The error's `message` and `name` properties will also be checked when using
+         *   // an error as validation object.
+         *   err
+         * );
+         * ```
+         *
+         * Validate instanceof using constructor:
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.throws(
+         *   () => {
+         *     throw new Error('Wrong value');
+         *   },
+         *   Error
+         * );
+         * ```
+         *
+         * Validate error message using [`RegExp`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions):
+         *
+         * Using a regular expression runs `.toString` on the error object, and will
+         * therefore also include the error name.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.throws(
+         *   () => {
+         *     throw new Error('Wrong value');
+         *   },
+         *   /^Error: Wrong value$/
+         * );
+         * ```
+         *
+         * Custom error validation:
+         *
+         * The function must return `true` to indicate all internal validations passed.
+         * It will otherwise fail with an `AssertionError`.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.throws(
+         *   () => {
+         *     throw new Error('Wrong value');
+         *   },
+         *   (err) => {
+         *     assert(err instanceof Error);
+         *     assert(/value/.test(err));
+         *     // Avoid returning anything from validation functions besides `true`.
+         *     // Otherwise, it's not clear what part of the validation failed. Instead,
+         *     // throw an error about the specific validation that failed (as done in this
+         *     // example) and add as much helpful debugging information to that error as
+         *     // possible.
+         *     return true;
+         *   },
+         *   'unexpected error'
+         * );
+         * ```
+         *
+         * `error` cannot be a string. If a string is provided as the second
+         * argument, then `error` is assumed to be omitted and the string will be used for`message` instead. This can lead to easy-to-miss mistakes. Using the same
+         * message as the thrown error message is going to result in an`ERR_AMBIGUOUS_ARGUMENT` error. Please read the example below carefully if using
+         * a string as the second argument gets considered:
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * function throwingFirst() {
+         *   throw new Error('First');
+         * }
+         *
+         * function throwingSecond() {
+         *   throw new Error('Second');
+         * }
+         *
+         * function notThrowing() {}
+         *
+         * // The second argument is a string and the input function threw an Error.
+         * // The first case will not throw as it does not match for the error message
+         * // thrown by the input function!
+         * assert.throws(throwingFirst, 'Second');
+         * // In the next example the message has no benefit over the message from the
+         * // error and since it is not clear if the user intended to actually match
+         * // against the error message, Node.js throws an `ERR_AMBIGUOUS_ARGUMENT` error.
+         * assert.throws(throwingSecond, 'Second');
+         * // TypeError [ERR_AMBIGUOUS_ARGUMENT]
+         *
+         * // The string is only used (as message) in case the function does not throw:
+         * assert.throws(notThrowing, 'Second');
+         * // AssertionError [ERR_ASSERTION]: Missing expected exception: Second
+         *
+         * // If it was intended to match for the error message do this instead:
+         * // It does not throw because the error messages match.
+         * assert.throws(throwingSecond, /Second$/);
+         *
+         * // If the error message does not match, an AssertionError is thrown.
+         * assert.throws(throwingFirst, /Second$/);
+         * // AssertionError [ERR_ASSERTION]
+         * ```
+         *
+         * Due to the confusing error-prone notation, avoid a string as the second
+         * argument.
+         * @since v0.1.21
+         */
+        function throws(block: () => unknown, message?: string | Error): void;
+        function throws(block: () => unknown, error: AssertPredicate, message?: string | Error): void;
+        /**
+         * Asserts that the function `fn` does not throw an error.
+         *
+         * Using `assert.doesNotThrow()` is actually not useful because there
+         * is no benefit in catching an error and then rethrowing it. Instead, consider
+         * adding a comment next to the specific code path that should not throw and keep
+         * error messages as expressive as possible.
+         *
+         * When `assert.doesNotThrow()` is called, it will immediately call the `fn`function.
+         *
+         * If an error is thrown and it is the same type as that specified by the `error`parameter, then an `AssertionError` is thrown. If the error is of a
+         * different type, or if the `error` parameter is undefined, the error is
+         * propagated back to the caller.
+         *
+         * If specified, `error` can be a [`Class`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes),
+         * [`RegExp`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions) or a validation
+         * function. See {@link throws} for more details.
+         *
+         * The following, for instance, will throw the `TypeError` because there is no
+         * matching error type in the assertion:
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.doesNotThrow(
+         *   () => {
+         *     throw new TypeError('Wrong value');
+         *   },
+         *   SyntaxError
+         * );
+         * ```
+         *
+         * However, the following will result in an `AssertionError` with the message
+         * 'Got unwanted exception...':
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.doesNotThrow(
+         *   () => {
+         *     throw new TypeError('Wrong value');
+         *   },
+         *   TypeError
+         * );
+         * ```
+         *
+         * If an `AssertionError` is thrown and a value is provided for the `message`parameter, the value of `message` will be appended to the `AssertionError` message:
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.doesNotThrow(
+         *   () => {
+         *     throw new TypeError('Wrong value');
+         *   },
+         *   /Wrong value/,
+         *   'Whoops'
+         * );
+         * // Throws: AssertionError: Got unwanted exception: Whoops
+         * ```
+         * @since v0.1.21
+         */
+        function doesNotThrow(block: () => unknown, message?: string | Error): void;
+        function doesNotThrow(block: () => unknown, error: AssertPredicate, message?: string | Error): void;
+        /**
+         * Throws `value` if `value` is not `undefined` or `null`. This is useful when
+         * testing the `error` argument in callbacks. The stack trace contains all frames
+         * from the error passed to `ifError()` including the potential new frames for`ifError()` itself.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.ifError(null);
+         * // OK
+         * assert.ifError(0);
+         * // AssertionError [ERR_ASSERTION]: ifError got unwanted exception: 0
+         * assert.ifError('error');
+         * // AssertionError [ERR_ASSERTION]: ifError got unwanted exception: 'error'
+         * assert.ifError(new Error());
+         * // AssertionError [ERR_ASSERTION]: ifError got unwanted exception: Error
+         *
+         * // Create some random error frames.
+         * let err;
+         * (function errorFrame() {
+         *   err = new Error('test error');
+         * })();
+         *
+         * (function ifErrorFrame() {
+         *   assert.ifError(err);
+         * })();
+         * // AssertionError [ERR_ASSERTION]: ifError got unwanted exception: test error
+         * //     at ifErrorFrame
+         * //     at errorFrame
+         * ```
+         * @since v0.1.97
+         */
+        function ifError(value: unknown): asserts value is null | undefined;
+        /**
+         * Awaits the `asyncFn` promise or, if `asyncFn` is a function, immediately
+         * calls the function and awaits the returned promise to complete. It will then
+         * check that the promise is rejected.
+         *
+         * If `asyncFn` is a function and it throws an error synchronously,`assert.rejects()` will return a rejected `Promise` with that error. If the
+         * function does not return a promise, `assert.rejects()` will return a rejected`Promise` with an `ERR_INVALID_RETURN_VALUE` error. In both cases the error
+         * handler is skipped.
+         *
+         * Besides the async nature to await the completion behaves identically to {@link throws}.
+         *
+         * If specified, `error` can be a [`Class`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes),
+         * [`RegExp`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions), a validation function,
+         * an object where each property will be tested for, or an instance of error where
+         * each property will be tested for including the non-enumerable `message` and`name` properties.
+         *
+         * If specified, `message` will be the message provided by the `AssertionError` if the `asyncFn` fails to reject.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * await assert.rejects(
+         *   async () => {
+         *     throw new TypeError('Wrong value');
+         *   },
+         *   {
+         *     name: 'TypeError',
+         *     message: 'Wrong value'
+         *   }
+         * );
+         * ```
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * await assert.rejects(
+         *   async () => {
+         *     throw new TypeError('Wrong value');
+         *   },
+         *   (err) => {
+         *     assert.strictEqual(err.name, 'TypeError');
+         *     assert.strictEqual(err.message, 'Wrong value');
+         *     return true;
+         *   }
+         * );
+         * ```
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.rejects(
+         *   Promise.reject(new Error('Wrong value')),
+         *   Error
+         * ).then(() => {
+         *   // ...
+         * });
+         * ```
+         *
+         * `error` cannot be a string. If a string is provided as the second
+         * argument, then `error` is assumed to be omitted and the string will be used for`message` instead. This can lead to easy-to-miss mistakes. Please read the
+         * example in {@link throws} carefully if using a string as the second
+         * argument gets considered.
+         * @since v10.0.0
+         */
+        function rejects(block: (() => Promise<unknown>) | Promise<unknown>, message?: string | Error): Promise<void>;
+        function rejects(block: (() => Promise<unknown>) | Promise<unknown>, error: AssertPredicate, message?: string | Error): Promise<void>;
+        /**
+         * Awaits the `asyncFn` promise or, if `asyncFn` is a function, immediately
+         * calls the function and awaits the returned promise to complete. It will then
+         * check that the promise is not rejected.
+         *
+         * If `asyncFn` is a function and it throws an error synchronously,`assert.doesNotReject()` will return a rejected `Promise` with that error. If
+         * the function does not return a promise, `assert.doesNotReject()` will return a
+         * rejected `Promise` with an `ERR_INVALID_RETURN_VALUE` error. In both cases
+         * the error handler is skipped.
+         *
+         * Using `assert.doesNotReject()` is actually not useful because there is little
+         * benefit in catching a rejection and then rejecting it again. Instead, consider
+         * adding a comment next to the specific code path that should not reject and keep
+         * error messages as expressive as possible.
+         *
+         * If specified, `error` can be a [`Class`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes),
+         * [`RegExp`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions) or a validation
+         * function. See {@link throws} for more details.
+         *
+         * Besides the async nature to await the completion behaves identically to {@link doesNotThrow}.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * await assert.doesNotReject(
+         *   async () => {
+         *     throw new TypeError('Wrong value');
+         *   },
+         *   SyntaxError
+         * );
+         * ```
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.doesNotReject(Promise.reject(new TypeError('Wrong value')))
+         *   .then(() => {
+         *     // ...
+         *   });
+         * ```
+         * @since v10.0.0
+         */
+        function doesNotReject(block: (() => Promise<unknown>) | Promise<unknown>, message?: string | Error): Promise<void>;
+        function doesNotReject(block: (() => Promise<unknown>) | Promise<unknown>, error: AssertPredicate, message?: string | Error): Promise<void>;
+        /**
+         * Expects the `string` input to match the regular expression.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.match('I will fail', /pass/);
+         * // AssertionError [ERR_ASSERTION]: The input did not match the regular ...
+         *
+         * assert.match(123, /pass/);
+         * // AssertionError [ERR_ASSERTION]: The "string" argument must be of type string.
+         *
+         * assert.match('I will pass', /pass/);
+         * // OK
+         * ```
+         *
+         * If the values do not match, or if the `string` argument is of another type than`string`, an `AssertionError` is thrown with a `message` property set equal
+         * to the value of the `message` parameter. If the `message` parameter is
+         * undefined, a default error message is assigned. If the `message` parameter is an
+         * instance of an `Error` then it will be thrown instead of the `AssertionError`.
+         * @since v13.6.0, v12.16.0
+         */
+        function match(value: string, regExp: RegExp, message?: string | Error): void;
+        /**
+         * Expects the `string` input not to match the regular expression.
+         *
+         * ```js
+         * import assert from 'assert/strict';
+         *
+         * assert.doesNotMatch('I will fail', /fail/);
+         * // AssertionError [ERR_ASSERTION]: The input was expected to not match the ...
+         *
+         * assert.doesNotMatch(123, /pass/);
+         * // AssertionError [ERR_ASSERTION]: The "string" argument must be of type string.
+         *
+         * assert.doesNotMatch('I will pass', /different/);
+         * // OK
+         * ```
+         *
+         * If the values do match, or if the `string` argument is of another type than`string`, an `AssertionError` is thrown with a `message` property set equal
+         * to the value of the `message` parameter. If the `message` parameter is
+         * undefined, a default error message is assigned. If the `message` parameter is an
+         * instance of an `Error` then it will be thrown instead of the `AssertionError`.
+         * @since v13.6.0, v12.16.0
+         */
+        function doesNotMatch(value: string, regExp: RegExp, message?: string | Error): void;
+        const strict: Omit<typeof assert, 'equal' | 'notEqual' | 'deepEqual' | 'notDeepEqual' | 'ok' | 'strictEqual' | 'deepStrictEqual' | 'ifError' | 'strict'> & {
+            (value: unknown, message?: string | Error): asserts value;
+            equal: typeof strictEqual;
+            notEqual: typeof notStrictEqual;
+            deepEqual: typeof deepStrictEqual;
+            notDeepEqual: typeof notDeepStrictEqual;
+            // Mapped types and assertion functions are incompatible?
+            // TS2775: Assertions require every name in the call target
+            // to be declared with an explicit type annotation.
+            ok: typeof ok;
+            strictEqual: typeof strictEqual;
+            deepStrictEqual: typeof deepStrictEqual;
+            ifError: typeof ifError;
+            strict: typeof strict;
+        };
+    }
+    export = assert;
+}
+declare module 'node:assert' {
+    import assert = require('assert');
+    export = assert;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/assert/strict.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/assert/strict.d.ts
new file mode 100644
index 0000000..b4319b9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/assert/strict.d.ts
@@ -0,0 +1,8 @@
+declare module 'assert/strict' {
+    import { strict } from 'node:assert';
+    export = strict;
+}
+declare module 'node:assert/strict' {
+    import { strict } from 'node:assert';
+    export = strict;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/async_hooks.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/async_hooks.d.ts
new file mode 100644
index 0000000..f53198e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/async_hooks.d.ts
@@ -0,0 +1,501 @@
+/**
+ * The `async_hooks` module provides an API to track asynchronous resources. It
+ * can be accessed using:
+ *
+ * ```js
+ * import async_hooks from 'async_hooks';
+ * ```
+ * @experimental
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/async_hooks.js)
+ */
+declare module 'async_hooks' {
+    /**
+     * ```js
+     * import { executionAsyncId } from 'async_hooks';
+     *
+     * console.log(executionAsyncId());  // 1 - bootstrap
+     * fs.open(path, 'r', (err, fd) => {
+     *   console.log(executionAsyncId());  // 6 - open()
+     * });
+     * ```
+     *
+     * The ID returned from `executionAsyncId()` is related to execution timing, not
+     * causality (which is covered by `triggerAsyncId()`):
+     *
+     * ```js
+     * const server = net.createServer((conn) => {
+     *   // Returns the ID of the server, not of the new connection, because the
+     *   // callback runs in the execution scope of the server's MakeCallback().
+     *   async_hooks.executionAsyncId();
+     *
+     * }).listen(port, () => {
+     *   // Returns the ID of a TickObject (process.nextTick()) because all
+     *   // callbacks passed to .listen() are wrapped in a nextTick().
+     *   async_hooks.executionAsyncId();
+     * });
+     * ```
+     *
+     * Promise contexts may not get precise `executionAsyncIds` by default.
+     * See the section on `promise execution tracking`.
+     * @since v8.1.0
+     * @return The `asyncId` of the current execution context. Useful to track when something calls.
+     */
+    function executionAsyncId(): number;
+    /**
+     * Resource objects returned by `executionAsyncResource()` are most often internal
+     * Node.js handle objects with undocumented APIs. Using any functions or properties
+     * on the object is likely to crash your application and should be avoided.
+     *
+     * Using `executionAsyncResource()` in the top-level execution context will
+     * return an empty object as there is no handle or request object to use,
+     * but having an object representing the top-level can be helpful.
+     *
+     * ```js
+     * import { open } from 'fs';
+     * import { executionAsyncId, executionAsyncResource } from 'async_hooks';
+     *
+     * console.log(executionAsyncId(), executionAsyncResource());  // 1 {}
+     * open(new URL(import.meta.url), 'r', (err, fd) => {
+     *   console.log(executionAsyncId(), executionAsyncResource());  // 7 FSReqWrap
+     * });
+     * ```
+     *
+     * This can be used to implement continuation local storage without the
+     * use of a tracking `Map` to store the metadata:
+     *
+     * ```js
+     * import { createServer } from 'http';
+     * import {
+     *   executionAsyncId,
+     *   executionAsyncResource,
+     *   createHook
+     * } from 'async_hooks';
+     * const sym = Symbol('state'); // Private symbol to avoid pollution
+     *
+     * createHook({
+     *   init(asyncId, type, triggerAsyncId, resource) {
+     *     const cr = executionAsyncResource();
+     *     if (cr) {
+     *       resource[sym] = cr[sym];
+     *     }
+     *   }
+     * }).enable();
+     *
+     * const server = createServer((req, res) => {
+     *   executionAsyncResource()[sym] = { state: req.url };
+     *   setTimeout(function() {
+     *     res.end(JSON.stringify(executionAsyncResource()[sym]));
+     *   }, 100);
+     * }).listen(3000);
+     * ```
+     * @since v13.9.0, v12.17.0
+     * @return The resource representing the current execution. Useful to store data within the resource.
+     */
+    function executionAsyncResource(): object;
+    /**
+     * ```js
+     * const server = net.createServer((conn) => {
+     *   // The resource that caused (or triggered) this callback to be called
+     *   // was that of the new connection. Thus the return value of triggerAsyncId()
+     *   // is the asyncId of "conn".
+     *   async_hooks.triggerAsyncId();
+     *
+     * }).listen(port, () => {
+     *   // Even though all callbacks passed to .listen() are wrapped in a nextTick()
+     *   // the callback itself exists because the call to the server's .listen()
+     *   // was made. So the return value would be the ID of the server.
+     *   async_hooks.triggerAsyncId();
+     * });
+     * ```
+     *
+     * Promise contexts may not get valid `triggerAsyncId`s by default. See
+     * the section on `promise execution tracking`.
+     * @return The ID of the resource responsible for calling the callback that is currently being executed.
+     */
+    function triggerAsyncId(): number;
+    interface HookCallbacks {
+        /**
+         * Called when a class is constructed that has the possibility to emit an asynchronous event.
+         * @param asyncId a unique ID for the async resource
+         * @param type the type of the async resource
+         * @param triggerAsyncId the unique ID of the async resource in whose execution context this async resource was created
+         * @param resource reference to the resource representing the async operation, needs to be released during destroy
+         */
+        init?(asyncId: number, type: string, triggerAsyncId: number, resource: object): void;
+        /**
+         * When an asynchronous operation is initiated or completes a callback is called to notify the user.
+         * The before callback is called just before said callback is executed.
+         * @param asyncId the unique identifier assigned to the resource about to execute the callback.
+         */
+        before?(asyncId: number): void;
+        /**
+         * Called immediately after the callback specified in before is completed.
+         * @param asyncId the unique identifier assigned to the resource which has executed the callback.
+         */
+        after?(asyncId: number): void;
+        /**
+         * Called when a promise has resolve() called. This may not be in the same execution id
+         * as the promise itself.
+         * @param asyncId the unique id for the promise that was resolve()d.
+         */
+        promiseResolve?(asyncId: number): void;
+        /**
+         * Called after the resource corresponding to asyncId is destroyed
+         * @param asyncId a unique ID for the async resource
+         */
+        destroy?(asyncId: number): void;
+    }
+    interface AsyncHook {
+        /**
+         * Enable the callbacks for a given AsyncHook instance. If no callbacks are provided enabling is a noop.
+         */
+        enable(): this;
+        /**
+         * Disable the callbacks for a given AsyncHook instance from the global pool of AsyncHook callbacks to be executed. Once a hook has been disabled it will not be called again until enabled.
+         */
+        disable(): this;
+    }
+    /**
+     * Registers functions to be called for different lifetime events of each async
+     * operation.
+     *
+     * The callbacks `init()`/`before()`/`after()`/`destroy()` are called for the
+     * respective asynchronous event during a resource's lifetime.
+     *
+     * All callbacks are optional. For example, if only resource cleanup needs to
+     * be tracked, then only the `destroy` callback needs to be passed. The
+     * specifics of all functions that can be passed to `callbacks` is in the `Hook Callbacks` section.
+     *
+     * ```js
+     * import { createHook } from 'async_hooks';
+     *
+     * const asyncHook = createHook({
+     *   init(asyncId, type, triggerAsyncId, resource) { },
+     *   destroy(asyncId) { }
+     * });
+     * ```
+     *
+     * The callbacks will be inherited via the prototype chain:
+     *
+     * ```js
+     * class MyAsyncCallbacks {
+     *   init(asyncId, type, triggerAsyncId, resource) { }
+     *   destroy(asyncId) {}
+     * }
+     *
+     * class MyAddedCallbacks extends MyAsyncCallbacks {
+     *   before(asyncId) { }
+     *   after(asyncId) { }
+     * }
+     *
+     * const asyncHook = async_hooks.createHook(new MyAddedCallbacks());
+     * ```
+     *
+     * Because promises are asynchronous resources whose lifecycle is tracked
+     * via the async hooks mechanism, the `init()`, `before()`, `after()`, and`destroy()` callbacks _must not_ be async functions that return promises.
+     * @since v8.1.0
+     * @param callbacks The `Hook Callbacks` to register
+     * @return Instance used for disabling and enabling hooks
+     */
+    function createHook(callbacks: HookCallbacks): AsyncHook;
+    interface AsyncResourceOptions {
+        /**
+         * The ID of the execution context that created this async event.
+         * @default executionAsyncId()
+         */
+        triggerAsyncId?: number | undefined;
+        /**
+         * Disables automatic `emitDestroy` when the object is garbage collected.
+         * This usually does not need to be set (even if `emitDestroy` is called
+         * manually), unless the resource's `asyncId` is retrieved and the
+         * sensitive API's `emitDestroy` is called with it.
+         * @default false
+         */
+        requireManualDestroy?: boolean | undefined;
+    }
+    /**
+     * The class `AsyncResource` is designed to be extended by the embedder's async
+     * resources. Using this, users can easily trigger the lifetime events of their
+     * own resources.
+     *
+     * The `init` hook will trigger when an `AsyncResource` is instantiated.
+     *
+     * The following is an overview of the `AsyncResource` API.
+     *
+     * ```js
+     * import { AsyncResource, executionAsyncId } from 'async_hooks';
+     *
+     * // AsyncResource() is meant to be extended. Instantiating a
+     * // new AsyncResource() also triggers init. If triggerAsyncId is omitted then
+     * // async_hook.executionAsyncId() is used.
+     * const asyncResource = new AsyncResource(
+     *   type, { triggerAsyncId: executionAsyncId(), requireManualDestroy: false }
+     * );
+     *
+     * // Run a function in the execution context of the resource. This will
+     * // * establish the context of the resource
+     * // * trigger the AsyncHooks before callbacks
+     * // * call the provided function `fn` with the supplied arguments
+     * // * trigger the AsyncHooks after callbacks
+     * // * restore the original execution context
+     * asyncResource.runInAsyncScope(fn, thisArg, ...args);
+     *
+     * // Call AsyncHooks destroy callbacks.
+     * asyncResource.emitDestroy();
+     *
+     * // Return the unique ID assigned to the AsyncResource instance.
+     * asyncResource.asyncId();
+     *
+     * // Return the trigger ID for the AsyncResource instance.
+     * asyncResource.triggerAsyncId();
+     * ```
+     */
+    class AsyncResource {
+        /**
+         * AsyncResource() is meant to be extended. Instantiating a
+         * new AsyncResource() also triggers init. If triggerAsyncId is omitted then
+         * async_hook.executionAsyncId() is used.
+         * @param type The type of async event.
+         * @param triggerAsyncId The ID of the execution context that created
+         *   this async event (default: `executionAsyncId()`), or an
+         *   AsyncResourceOptions object (since 9.3)
+         */
+        constructor(type: string, triggerAsyncId?: number | AsyncResourceOptions);
+        /**
+         * Binds the given function to the current execution context.
+         *
+         * The returned function will have an `asyncResource` property referencing
+         * the `AsyncResource` to which the function is bound.
+         * @since v14.8.0, v12.19.0
+         * @param fn The function to bind to the current execution context.
+         * @param type An optional name to associate with the underlying `AsyncResource`.
+         */
+        static bind<Func extends (this: ThisArg, ...args: any[]) => any, ThisArg>(
+            fn: Func,
+            type?: string,
+            thisArg?: ThisArg
+        ): Func & {
+            asyncResource: AsyncResource;
+        };
+        /**
+         * Binds the given function to execute to this `AsyncResource`'s scope.
+         *
+         * The returned function will have an `asyncResource` property referencing
+         * the `AsyncResource` to which the function is bound.
+         * @since v14.8.0, v12.19.0
+         * @param fn The function to bind to the current `AsyncResource`.
+         */
+        bind<Func extends (...args: any[]) => any>(
+            fn: Func
+        ): Func & {
+            asyncResource: AsyncResource;
+        };
+        /**
+         * Call the provided function with the provided arguments in the execution context
+         * of the async resource. This will establish the context, trigger the AsyncHooks
+         * before callbacks, call the function, trigger the AsyncHooks after callbacks, and
+         * then restore the original execution context.
+         * @since v9.6.0
+         * @param fn The function to call in the execution context of this async resource.
+         * @param thisArg The receiver to be used for the function call.
+         * @param args Optional arguments to pass to the function.
+         */
+        runInAsyncScope<This, Result>(fn: (this: This, ...args: any[]) => Result, thisArg?: This, ...args: any[]): Result;
+        /**
+         * Call all `destroy` hooks. This should only ever be called once. An error will
+         * be thrown if it is called more than once. This **must** be manually called. If
+         * the resource is left to be collected by the GC then the `destroy` hooks will
+         * never be called.
+         * @return A reference to `asyncResource`.
+         */
+        emitDestroy(): this;
+        /**
+         * @return The unique `asyncId` assigned to the resource.
+         */
+        asyncId(): number;
+        /**
+         *
+         * @return The same `triggerAsyncId` that is passed to the `AsyncResource` constructor.
+         */
+        triggerAsyncId(): number;
+    }
+    /**
+     * This class creates stores that stay coherent through asynchronous operations.
+     *
+     * While you can create your own implementation on top of the `async_hooks` module,`AsyncLocalStorage` should be preferred as it is a performant and memory safe
+     * implementation that involves significant optimizations that are non-obvious to
+     * implement.
+     *
+     * The following example uses `AsyncLocalStorage` to build a simple logger
+     * that assigns IDs to incoming HTTP requests and includes them in messages
+     * logged within each request.
+     *
+     * ```js
+     * import http from 'http';
+     * import { AsyncLocalStorage } from 'async_hooks';
+     *
+     * const asyncLocalStorage = new AsyncLocalStorage();
+     *
+     * function logWithId(msg) {
+     *   const id = asyncLocalStorage.getStore();
+     *   console.log(`${id !== undefined ? id : '-'}:`, msg);
+     * }
+     *
+     * let idSeq = 0;
+     * http.createServer((req, res) => {
+     *   asyncLocalStorage.run(idSeq++, () => {
+     *     logWithId('start');
+     *     // Imagine any chain of async operations here
+     *     setImmediate(() => {
+     *       logWithId('finish');
+     *       res.end();
+     *     });
+     *   });
+     * }).listen(8080);
+     *
+     * http.get('http://localhost:8080');
+     * http.get('http://localhost:8080');
+     * // Prints:
+     * //   0: start
+     * //   1: start
+     * //   0: finish
+     * //   1: finish
+     * ```
+     *
+     * Each instance of `AsyncLocalStorage` maintains an independent storage context.
+     * Multiple instances can safely exist simultaneously without risk of interfering
+     * with each other data.
+     * @since v13.10.0, v12.17.0
+     */
+    class AsyncLocalStorage<T> {
+        /**
+         * Disables the instance of `AsyncLocalStorage`. All subsequent calls
+         * to `asyncLocalStorage.getStore()` will return `undefined` until`asyncLocalStorage.run()` or `asyncLocalStorage.enterWith()` is called again.
+         *
+         * When calling `asyncLocalStorage.disable()`, all current contexts linked to the
+         * instance will be exited.
+         *
+         * Calling `asyncLocalStorage.disable()` is required before the`asyncLocalStorage` can be garbage collected. This does not apply to stores
+         * provided by the `asyncLocalStorage`, as those objects are garbage collected
+         * along with the corresponding async resources.
+         *
+         * Use this method when the `asyncLocalStorage` is not in use anymore
+         * in the current process.
+         * @since v13.10.0, v12.17.0
+         * @experimental
+         */
+        disable(): void;
+        /**
+         * Returns the current store.
+         * If called outside of an asynchronous context initialized by
+         * calling `asyncLocalStorage.run()` or `asyncLocalStorage.enterWith()`, it
+         * returns `undefined`.
+         * @since v13.10.0, v12.17.0
+         */
+        getStore(): T | undefined;
+        /**
+         * Runs a function synchronously within a context and returns its
+         * return value. The store is not accessible outside of the callback function.
+         * The store is accessible to any asynchronous operations created within the
+         * callback.
+         *
+         * The optional `args` are passed to the callback function.
+         *
+         * If the callback function throws an error, the error is thrown by `run()` too.
+         * The stacktrace is not impacted by this call and the context is exited.
+         *
+         * Example:
+         *
+         * ```js
+         * const store = { id: 2 };
+         * try {
+         *   asyncLocalStorage.run(store, () => {
+         *     asyncLocalStorage.getStore(); // Returns the store object
+         *     setTimeout(() => {
+         *       asyncLocalStorage.getStore(); // Returns the store object
+         *     }, 200);
+         *     throw new Error();
+         *   });
+         * } catch (e) {
+         *   asyncLocalStorage.getStore(); // Returns undefined
+         *   // The error will be caught here
+         * }
+         * ```
+         * @since v13.10.0, v12.17.0
+         */
+        run<R, TArgs extends any[]>(store: T, callback: (...args: TArgs) => R, ...args: TArgs): R;
+        /**
+         * Runs a function synchronously outside of a context and returns its
+         * return value. The store is not accessible within the callback function or
+         * the asynchronous operations created within the callback. Any `getStore()`call done within the callback function will always return `undefined`.
+         *
+         * The optional `args` are passed to the callback function.
+         *
+         * If the callback function throws an error, the error is thrown by `exit()` too.
+         * The stacktrace is not impacted by this call and the context is re-entered.
+         *
+         * Example:
+         *
+         * ```js
+         * // Within a call to run
+         * try {
+         *   asyncLocalStorage.getStore(); // Returns the store object or value
+         *   asyncLocalStorage.exit(() => {
+         *     asyncLocalStorage.getStore(); // Returns undefined
+         *     throw new Error();
+         *   });
+         * } catch (e) {
+         *   asyncLocalStorage.getStore(); // Returns the same object or value
+         *   // The error will be caught here
+         * }
+         * ```
+         * @since v13.10.0, v12.17.0
+         * @experimental
+         */
+        exit<R, TArgs extends any[]>(callback: (...args: TArgs) => R, ...args: TArgs): R;
+        /**
+         * Transitions into the context for the remainder of the current
+         * synchronous execution and then persists the store through any following
+         * asynchronous calls.
+         *
+         * Example:
+         *
+         * ```js
+         * const store = { id: 1 };
+         * // Replaces previous store with the given store object
+         * asyncLocalStorage.enterWith(store);
+         * asyncLocalStorage.getStore(); // Returns the store object
+         * someAsyncOperation(() => {
+         *   asyncLocalStorage.getStore(); // Returns the same object
+         * });
+         * ```
+         *
+         * This transition will continue for the _entire_ synchronous execution.
+         * This means that if, for example, the context is entered within an event
+         * handler subsequent event handlers will also run within that context unless
+         * specifically bound to another context with an `AsyncResource`. That is why`run()` should be preferred over `enterWith()` unless there are strong reasons
+         * to use the latter method.
+         *
+         * ```js
+         * const store = { id: 1 };
+         *
+         * emitter.on('my-event', () => {
+         *   asyncLocalStorage.enterWith(store);
+         * });
+         * emitter.on('my-event', () => {
+         *   asyncLocalStorage.getStore(); // Returns the same object
+         * });
+         *
+         * asyncLocalStorage.getStore(); // Returns undefined
+         * emitter.emit('my-event');
+         * asyncLocalStorage.getStore(); // Returns the same object
+         * ```
+         * @since v13.11.0, v12.17.0
+         * @experimental
+         */
+        enterWith(store: T): void;
+    }
+}
+declare module 'node:async_hooks' {
+    export * from 'async_hooks';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/buffer.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/buffer.d.ts
new file mode 100644
index 0000000..1a26043
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/buffer.d.ts
@@ -0,0 +1,2232 @@
+/**
+ * `Buffer` objects are used to represent a fixed-length sequence of bytes. Many
+ * Node.js APIs support `Buffer`s.
+ *
+ * The `Buffer` class is a subclass of JavaScript's [`Uint8Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint8Array) class and
+ * extends it with methods that cover additional use cases. Node.js APIs accept
+ * plain [`Uint8Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint8Array) s wherever `Buffer`s are supported as well.
+ *
+ * While the `Buffer` class is available within the global scope, it is still
+ * recommended to explicitly reference it via an import or require statement.
+ *
+ * ```js
+ * import { Buffer } from 'buffer';
+ *
+ * // Creates a zero-filled Buffer of length 10.
+ * const buf1 = Buffer.alloc(10);
+ *
+ * // Creates a Buffer of length 10,
+ * // filled with bytes which all have the value `1`.
+ * const buf2 = Buffer.alloc(10, 1);
+ *
+ * // Creates an uninitialized buffer of length 10.
+ * // This is faster than calling Buffer.alloc() but the returned
+ * // Buffer instance might contain old data that needs to be
+ * // overwritten using fill(), write(), or other functions that fill the Buffer's
+ * // contents.
+ * const buf3 = Buffer.allocUnsafe(10);
+ *
+ * // Creates a Buffer containing the bytes [1, 2, 3].
+ * const buf4 = Buffer.from([1, 2, 3]);
+ *
+ * // Creates a Buffer containing the bytes [1, 1, 1, 1] – the entries
+ * // are all truncated using `(value &#x26; 255)` to fit into the range 0–255.
+ * const buf5 = Buffer.from([257, 257.5, -255, '1']);
+ *
+ * // Creates a Buffer containing the UTF-8-encoded bytes for the string 'tést':
+ * // [0x74, 0xc3, 0xa9, 0x73, 0x74] (in hexadecimal notation)
+ * // [116, 195, 169, 115, 116] (in decimal notation)
+ * const buf6 = Buffer.from('tést');
+ *
+ * // Creates a Buffer containing the Latin-1 bytes [0x74, 0xe9, 0x73, 0x74].
+ * const buf7 = Buffer.from('tést', 'latin1');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/buffer.js)
+ */
+declare module 'buffer' {
+    import { BinaryLike } from 'node:crypto';
+    export const INSPECT_MAX_BYTES: number;
+    export const kMaxLength: number;
+    export const kStringMaxLength: number;
+    export const constants: {
+        MAX_LENGTH: number;
+        MAX_STRING_LENGTH: number;
+    };
+    export type TranscodeEncoding = 'ascii' | 'utf8' | 'utf16le' | 'ucs2' | 'latin1' | 'binary';
+    /**
+     * Re-encodes the given `Buffer` or `Uint8Array` instance from one character
+     * encoding to another. Returns a new `Buffer` instance.
+     *
+     * Throws if the `fromEnc` or `toEnc` specify invalid character encodings or if
+     * conversion from `fromEnc` to `toEnc` is not permitted.
+     *
+     * Encodings supported by `buffer.transcode()` are: `'ascii'`, `'utf8'`,`'utf16le'`, `'ucs2'`, `'latin1'`, and `'binary'`.
+     *
+     * The transcoding process will use substitution characters if a given byte
+     * sequence cannot be adequately represented in the target encoding. For instance:
+     *
+     * ```js
+     * import { Buffer, transcode } from 'buffer';
+     *
+     * const newBuf = transcode(Buffer.from('€'), 'utf8', 'ascii');
+     * console.log(newBuf.toString('ascii'));
+     * // Prints: '?'
+     * ```
+     *
+     * Because the Euro (`€`) sign is not representable in US-ASCII, it is replaced
+     * with `?` in the transcoded `Buffer`.
+     * @since v7.1.0
+     * @param source A `Buffer` or `Uint8Array` instance.
+     * @param fromEnc The current encoding.
+     * @param toEnc To target encoding.
+     */
+    export function transcode(source: Uint8Array, fromEnc: TranscodeEncoding, toEnc: TranscodeEncoding): Buffer;
+    export const SlowBuffer: {
+        /** @deprecated since v6.0.0, use `Buffer.allocUnsafeSlow()` */
+        new (size: number): Buffer;
+        prototype: Buffer;
+    };
+    /**
+     * Resolves a `'blob:nodedata:...'` an associated `Blob` object registered using
+     * a prior call to `URL.createObjectURL()`.
+     * @since v16.7.0
+     * @experimental
+     * @param id A `'blob:nodedata:...` URL string returned by a prior call to `URL.createObjectURL()`.
+     */
+    export function resolveObjectURL(id: string): Blob | undefined;
+    export { Buffer };
+    /**
+     * @experimental
+     */
+    export interface BlobOptions {
+        /**
+         * @default 'utf8'
+         */
+        encoding?: BufferEncoding | undefined;
+        /**
+         * The Blob content-type. The intent is for `type` to convey
+         * the MIME media type of the data, however no validation of the type format
+         * is performed.
+         */
+        type?: string | undefined;
+    }
+    /**
+     * A [`Blob`](https://developer.mozilla.org/en-US/docs/Web/API/Blob) encapsulates immutable, raw data that can be safely shared across
+     * multiple worker threads.
+     * @since v15.7.0, v14.18.0
+     * @experimental
+     */
+    export class Blob {
+        /**
+         * The total size of the `Blob` in bytes.
+         * @since v15.7.0, v14.18.0
+         */
+        readonly size: number;
+        /**
+         * The content-type of the `Blob`.
+         * @since v15.7.0, v14.18.0
+         */
+        readonly type: string;
+        /**
+         * Creates a new `Blob` object containing a concatenation of the given sources.
+         *
+         * {ArrayBuffer}, {TypedArray}, {DataView}, and {Buffer} sources are copied into
+         * the 'Blob' and can therefore be safely modified after the 'Blob' is created.
+         *
+         * String sources are also copied into the `Blob`.
+         */
+        constructor(sources: Array<BinaryLike | Blob>, options?: BlobOptions);
+        /**
+         * Returns a promise that fulfills with an [ArrayBuffer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer) containing a copy of
+         * the `Blob` data.
+         * @since v15.7.0, v14.18.0
+         */
+        arrayBuffer(): Promise<ArrayBuffer>;
+        /**
+         * Creates and returns a new `Blob` containing a subset of this `Blob` objects
+         * data. The original `Blob` is not altered.
+         * @since v15.7.0, v14.18.0
+         * @param start The starting index.
+         * @param end The ending index.
+         * @param type The content-type for the new `Blob`
+         */
+        slice(start?: number, end?: number, type?: string): Blob;
+        /**
+         * Returns a promise that fulfills with the contents of the `Blob` decoded as a
+         * UTF-8 string.
+         * @since v15.7.0, v14.18.0
+         */
+        text(): Promise<string>;
+        /**
+         * Returns a new `ReadableStream` that allows the content of the `Blob` to be read.
+         * @since v16.7.0
+         */
+        stream(): unknown; // pending web streams types
+    }
+    export import atob = globalThis.atob;
+    export import btoa = globalThis.btoa;
+    global {
+        // Buffer class
+        type BufferEncoding = 'ascii' | 'utf8' | 'utf-8' | 'utf16le' | 'ucs2' | 'ucs-2' | 'base64' | 'base64url' | 'latin1' | 'binary' | 'hex';
+        type WithImplicitCoercion<T> =
+            | T
+            | {
+                  valueOf(): T;
+              };
+        /**
+         * Raw data is stored in instances of the Buffer class.
+         * A Buffer is similar to an array of integers but corresponds to a raw memory allocation outside the V8 heap.  A Buffer cannot be resized.
+         * Valid string encodings: 'ascii'|'utf8'|'utf16le'|'ucs2'(alias of 'utf16le')|'base64'|'base64url'|'binary'(deprecated)|'hex'
+         */
+        interface BufferConstructor {
+            /**
+             * Allocates a new buffer containing the given {str}.
+             *
+             * @param str String to store in buffer.
+             * @param encoding encoding to use, optional.  Default is 'utf8'
+             * @deprecated since v10.0.0 - Use `Buffer.from(string[, encoding])` instead.
+             */
+            new (str: string, encoding?: BufferEncoding): Buffer;
+            /**
+             * Allocates a new buffer of {size} octets.
+             *
+             * @param size count of octets to allocate.
+             * @deprecated since v10.0.0 - Use `Buffer.alloc()` instead (also see `Buffer.allocUnsafe()`).
+             */
+            new (size: number): Buffer;
+            /**
+             * Allocates a new buffer containing the given {array} of octets.
+             *
+             * @param array The octets to store.
+             * @deprecated since v10.0.0 - Use `Buffer.from(array)` instead.
+             */
+            new (array: Uint8Array): Buffer;
+            /**
+             * Produces a Buffer backed by the same allocated memory as
+             * the given {ArrayBuffer}/{SharedArrayBuffer}.
+             *
+             *
+             * @param arrayBuffer The ArrayBuffer with which to share memory.
+             * @deprecated since v10.0.0 - Use `Buffer.from(arrayBuffer[, byteOffset[, length]])` instead.
+             */
+            new (arrayBuffer: ArrayBuffer | SharedArrayBuffer): Buffer;
+            /**
+             * Allocates a new buffer containing the given {array} of octets.
+             *
+             * @param array The octets to store.
+             * @deprecated since v10.0.0 - Use `Buffer.from(array)` instead.
+             */
+            new (array: ReadonlyArray<any>): Buffer;
+            /**
+             * Copies the passed {buffer} data onto a new {Buffer} instance.
+             *
+             * @param buffer The buffer to copy.
+             * @deprecated since v10.0.0 - Use `Buffer.from(buffer)` instead.
+             */
+            new (buffer: Buffer): Buffer;
+            /**
+             * Allocates a new `Buffer` using an `array` of bytes in the range `0` – `255`.
+             * Array entries outside that range will be truncated to fit into it.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Creates a new Buffer containing the UTF-8 bytes of the string 'buffer'.
+             * const buf = Buffer.from([0x62, 0x75, 0x66, 0x66, 0x65, 0x72]);
+             * ```
+             *
+             * A `TypeError` will be thrown if `array` is not an `Array` or another type
+             * appropriate for `Buffer.from()` variants.
+             *
+             * `Buffer.from(array)` and `Buffer.from(string)` may also use the internal`Buffer` pool like `Buffer.allocUnsafe()` does.
+             * @since v5.10.0
+             */
+            from(arrayBuffer: WithImplicitCoercion<ArrayBuffer | SharedArrayBuffer>, byteOffset?: number, length?: number): Buffer;
+            /**
+             * Creates a new Buffer using the passed {data}
+             * @param data data to create a new Buffer
+             */
+            from(data: Uint8Array | ReadonlyArray<number>): Buffer;
+            from(data: WithImplicitCoercion<Uint8Array | ReadonlyArray<number> | string>): Buffer;
+            /**
+             * Creates a new Buffer containing the given JavaScript string {str}.
+             * If provided, the {encoding} parameter identifies the character encoding.
+             * If not provided, {encoding} defaults to 'utf8'.
+             */
+            from(
+                str:
+                    | WithImplicitCoercion<string>
+                    | {
+                          [Symbol.toPrimitive](hint: 'string'): string;
+                      },
+                encoding?: BufferEncoding
+            ): Buffer;
+            /**
+             * Creates a new Buffer using the passed {data}
+             * @param values to create a new Buffer
+             */
+            of(...items: number[]): Buffer;
+            /**
+             * Returns `true` if `obj` is a `Buffer`, `false` otherwise.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * Buffer.isBuffer(Buffer.alloc(10)); // true
+             * Buffer.isBuffer(Buffer.from('foo')); // true
+             * Buffer.isBuffer('a string'); // false
+             * Buffer.isBuffer([]); // false
+             * Buffer.isBuffer(new Uint8Array(1024)); // false
+             * ```
+             * @since v0.1.101
+             */
+            isBuffer(obj: any): obj is Buffer;
+            /**
+             * Returns `true` if `encoding` is the name of a supported character encoding,
+             * or `false` otherwise.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * console.log(Buffer.isEncoding('utf8'));
+             * // Prints: true
+             *
+             * console.log(Buffer.isEncoding('hex'));
+             * // Prints: true
+             *
+             * console.log(Buffer.isEncoding('utf/8'));
+             * // Prints: false
+             *
+             * console.log(Buffer.isEncoding(''));
+             * // Prints: false
+             * ```
+             * @since v0.9.1
+             * @param encoding A character encoding name to check.
+             */
+            isEncoding(encoding: string): encoding is BufferEncoding;
+            /**
+             * Returns the byte length of a string when encoded using `encoding`.
+             * This is not the same as [`String.prototype.length`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/length), which does not account
+             * for the encoding that is used to convert the string into bytes.
+             *
+             * For `'base64'`, `'base64url'`, and `'hex'`, this function assumes valid input.
+             * For strings that contain non-base64/hex-encoded data (e.g. whitespace), the
+             * return value might be greater than the length of a `Buffer` created from the
+             * string.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const str = '\u00bd + \u00bc = \u00be';
+             *
+             * console.log(`${str}: ${str.length} characters, ` +
+             *             `${Buffer.byteLength(str, 'utf8')} bytes`);
+             * // Prints: ½ + ¼ = ¾: 9 characters, 12 bytes
+             * ```
+             *
+             * When `string` is a
+             * `Buffer`/[`DataView`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView)/[`TypedArray`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/-
+             * Reference/Global_Objects/TypedArray)/[`ArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer)/[`SharedArrayBuffer`](https://develop-
+             * er.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer), the byte length as reported by `.byteLength`is returned.
+             * @since v0.1.90
+             * @param string A value to calculate the length of.
+             * @param [encoding='utf8'] If `string` is a string, this is its encoding.
+             * @return The number of bytes contained within `string`.
+             */
+            byteLength(string: string | NodeJS.ArrayBufferView | ArrayBuffer | SharedArrayBuffer, encoding?: BufferEncoding): number;
+            /**
+             * Returns a new `Buffer` which is the result of concatenating all the `Buffer`instances in the `list` together.
+             *
+             * If the list has no items, or if the `totalLength` is 0, then a new zero-length`Buffer` is returned.
+             *
+             * If `totalLength` is not provided, it is calculated from the `Buffer` instances
+             * in `list` by adding their lengths.
+             *
+             * If `totalLength` is provided, it is coerced to an unsigned integer. If the
+             * combined length of the `Buffer`s in `list` exceeds `totalLength`, the result is
+             * truncated to `totalLength`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Create a single `Buffer` from a list of three `Buffer` instances.
+             *
+             * const buf1 = Buffer.alloc(10);
+             * const buf2 = Buffer.alloc(14);
+             * const buf3 = Buffer.alloc(18);
+             * const totalLength = buf1.length + buf2.length + buf3.length;
+             *
+             * console.log(totalLength);
+             * // Prints: 42
+             *
+             * const bufA = Buffer.concat([buf1, buf2, buf3], totalLength);
+             *
+             * console.log(bufA);
+             * // Prints: <Buffer 00 00 00 00 ...>
+             * console.log(bufA.length);
+             * // Prints: 42
+             * ```
+             *
+             * `Buffer.concat()` may also use the internal `Buffer` pool like `Buffer.allocUnsafe()` does.
+             * @since v0.7.11
+             * @param list List of `Buffer` or {@link Uint8Array} instances to concatenate.
+             * @param totalLength Total length of the `Buffer` instances in `list` when concatenated.
+             */
+            concat(list: ReadonlyArray<Uint8Array>, totalLength?: number): Buffer;
+            /**
+             * Compares `buf1` to `buf2`, typically for the purpose of sorting arrays of`Buffer` instances. This is equivalent to calling `buf1.compare(buf2)`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.from('1234');
+             * const buf2 = Buffer.from('0123');
+             * const arr = [buf1, buf2];
+             *
+             * console.log(arr.sort(Buffer.compare));
+             * // Prints: [ <Buffer 30 31 32 33>, <Buffer 31 32 33 34> ]
+             * // (This result is equal to: [buf2, buf1].)
+             * ```
+             * @since v0.11.13
+             * @return Either `-1`, `0`, or `1`, depending on the result of the comparison. See `compare` for details.
+             */
+            compare(buf1: Uint8Array, buf2: Uint8Array): -1 | 0 | 1;
+            /**
+             * Allocates a new `Buffer` of `size` bytes. If `fill` is `undefined`, the`Buffer` will be zero-filled.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.alloc(5);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 00 00 00 00 00>
+             * ```
+             *
+             * If `size` is larger than {@link constants.MAX_LENGTH} or smaller than 0, `ERR_INVALID_ARG_VALUE` is thrown.
+             *
+             * If `fill` is specified, the allocated `Buffer` will be initialized by calling `buf.fill(fill)`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.alloc(5, 'a');
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 61 61 61 61 61>
+             * ```
+             *
+             * If both `fill` and `encoding` are specified, the allocated `Buffer` will be
+             * initialized by calling `buf.fill(fill, encoding)`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.alloc(11, 'aGVsbG8gd29ybGQ=', 'base64');
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 68 65 6c 6c 6f 20 77 6f 72 6c 64>
+             * ```
+             *
+             * Calling `Buffer.alloc()` can be measurably slower than the alternative `Buffer.allocUnsafe()` but ensures that the newly created `Buffer` instance
+             * contents will never contain sensitive data from previous allocations, including
+             * data that might not have been allocated for `Buffer`s.
+             *
+             * A `TypeError` will be thrown if `size` is not a number.
+             * @since v5.10.0
+             * @param size The desired length of the new `Buffer`.
+             * @param [fill=0] A value to pre-fill the new `Buffer` with.
+             * @param [encoding='utf8'] If `fill` is a string, this is its encoding.
+             */
+            alloc(size: number, fill?: string | Buffer | number, encoding?: BufferEncoding): Buffer;
+            /**
+             * Allocates a new `Buffer` of `size` bytes. If `size` is larger than {@link constants.MAX_LENGTH} or smaller than 0, `ERR_INVALID_ARG_VALUE` is thrown.
+             *
+             * The underlying memory for `Buffer` instances created in this way is _not_
+             * _initialized_. The contents of the newly created `Buffer` are unknown and_may contain sensitive data_. Use `Buffer.alloc()` instead to initialize`Buffer` instances with zeroes.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(10);
+             *
+             * console.log(buf);
+             * // Prints (contents may vary): <Buffer a0 8b 28 3f 01 00 00 00 50 32>
+             *
+             * buf.fill(0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 00 00 00 00 00 00 00 00 00 00>
+             * ```
+             *
+             * A `TypeError` will be thrown if `size` is not a number.
+             *
+             * The `Buffer` module pre-allocates an internal `Buffer` instance of
+             * size `Buffer.poolSize` that is used as a pool for the fast allocation of new`Buffer` instances created using `Buffer.allocUnsafe()`,`Buffer.from(array)`, `Buffer.concat()`, and the
+             * deprecated`new Buffer(size)` constructor only when `size` is less than or equal
+             * to `Buffer.poolSize >> 1` (floor of `Buffer.poolSize` divided by two).
+             *
+             * Use of this pre-allocated internal memory pool is a key difference between
+             * calling `Buffer.alloc(size, fill)` vs. `Buffer.allocUnsafe(size).fill(fill)`.
+             * Specifically, `Buffer.alloc(size, fill)` will _never_ use the internal `Buffer`pool, while `Buffer.allocUnsafe(size).fill(fill)`_will_ use the internal`Buffer` pool if `size` is less
+             * than or equal to half `Buffer.poolSize`. The
+             * difference is subtle but can be important when an application requires the
+             * additional performance that `Buffer.allocUnsafe()` provides.
+             * @since v5.10.0
+             * @param size The desired length of the new `Buffer`.
+             */
+            allocUnsafe(size: number): Buffer;
+            /**
+             * Allocates a new `Buffer` of `size` bytes. If `size` is larger than {@link constants.MAX_LENGTH} or smaller than 0, `ERR_INVALID_ARG_VALUE` is thrown. A zero-length `Buffer` is created
+             * if `size` is 0.
+             *
+             * The underlying memory for `Buffer` instances created in this way is _not_
+             * _initialized_. The contents of the newly created `Buffer` are unknown and_may contain sensitive data_. Use `buf.fill(0)` to initialize
+             * such `Buffer` instances with zeroes.
+             *
+             * When using `Buffer.allocUnsafe()` to allocate new `Buffer` instances,
+             * allocations under 4 KB are sliced from a single pre-allocated `Buffer`. This
+             * allows applications to avoid the garbage collection overhead of creating many
+             * individually allocated `Buffer` instances. This approach improves both
+             * performance and memory usage by eliminating the need to track and clean up as
+             * many individual `ArrayBuffer` objects.
+             *
+             * However, in the case where a developer may need to retain a small chunk of
+             * memory from a pool for an indeterminate amount of time, it may be appropriate
+             * to create an un-pooled `Buffer` instance using `Buffer.allocUnsafeSlow()` and
+             * then copying out the relevant bits.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Need to keep around a few small chunks of memory.
+             * const store = [];
+             *
+             * socket.on('readable', () => {
+             *   let data;
+             *   while (null !== (data = readable.read())) {
+             *     // Allocate for retained data.
+             *     const sb = Buffer.allocUnsafeSlow(10);
+             *
+             *     // Copy the data into the new allocation.
+             *     data.copy(sb, 0, 0, 10);
+             *
+             *     store.push(sb);
+             *   }
+             * });
+             * ```
+             *
+             * A `TypeError` will be thrown if `size` is not a number.
+             * @since v5.12.0
+             * @param size The desired length of the new `Buffer`.
+             */
+            allocUnsafeSlow(size: number): Buffer;
+            /**
+             * This is the size (in bytes) of pre-allocated internal `Buffer` instances used
+             * for pooling. This value may be modified.
+             * @since v0.11.3
+             */
+            poolSize: number;
+        }
+        interface Buffer extends Uint8Array {
+            /**
+             * Writes `string` to `buf` at `offset` according to the character encoding in`encoding`. The `length` parameter is the number of bytes to write. If `buf` did
+             * not contain enough space to fit the entire string, only part of `string` will be
+             * written. However, partially encoded characters will not be written.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.alloc(256);
+             *
+             * const len = buf.write('\u00bd + \u00bc = \u00be', 0);
+             *
+             * console.log(`${len} bytes: ${buf.toString('utf8', 0, len)}`);
+             * // Prints: 12 bytes: ½ + ¼ = ¾
+             *
+             * const buffer = Buffer.alloc(10);
+             *
+             * const length = buffer.write('abcd', 8);
+             *
+             * console.log(`${length} bytes: ${buffer.toString('utf8', 8, 10)}`);
+             * // Prints: 2 bytes : ab
+             * ```
+             * @since v0.1.90
+             * @param string String to write to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write `string`.
+             * @param [length=buf.length - offset] Maximum number of bytes to write (written bytes will not exceed `buf.length - offset`).
+             * @param [encoding='utf8'] The character encoding of `string`.
+             * @return Number of bytes written.
+             */
+            write(string: string, encoding?: BufferEncoding): number;
+            write(string: string, offset: number, encoding?: BufferEncoding): number;
+            write(string: string, offset: number, length: number, encoding?: BufferEncoding): number;
+            /**
+             * Decodes `buf` to a string according to the specified character encoding in`encoding`. `start` and `end` may be passed to decode only a subset of `buf`.
+             *
+             * If `encoding` is `'utf8'` and a byte sequence in the input is not valid UTF-8,
+             * then each invalid byte is replaced with the replacement character `U+FFFD`.
+             *
+             * The maximum length of a string instance (in UTF-16 code units) is available
+             * as {@link constants.MAX_STRING_LENGTH}.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.allocUnsafe(26);
+             *
+             * for (let i = 0; i < 26; i++) {
+             *   // 97 is the decimal ASCII value for 'a'.
+             *   buf1[i] = i + 97;
+             * }
+             *
+             * console.log(buf1.toString('utf8'));
+             * // Prints: abcdefghijklmnopqrstuvwxyz
+             * console.log(buf1.toString('utf8', 0, 5));
+             * // Prints: abcde
+             *
+             * const buf2 = Buffer.from('tést');
+             *
+             * console.log(buf2.toString('hex'));
+             * // Prints: 74c3a97374
+             * console.log(buf2.toString('utf8', 0, 3));
+             * // Prints: té
+             * console.log(buf2.toString(undefined, 0, 3));
+             * // Prints: té
+             * ```
+             * @since v0.1.90
+             * @param [encoding='utf8'] The character encoding to use.
+             * @param [start=0] The byte offset to start decoding at.
+             * @param [end=buf.length] The byte offset to stop decoding at (not inclusive).
+             */
+            toString(encoding?: BufferEncoding, start?: number, end?: number): string;
+            /**
+             * Returns a JSON representation of `buf`. [`JSON.stringify()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify) implicitly calls
+             * this function when stringifying a `Buffer` instance.
+             *
+             * `Buffer.from()` accepts objects in the format returned from this method.
+             * In particular, `Buffer.from(buf.toJSON())` works like `Buffer.from(buf)`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x1, 0x2, 0x3, 0x4, 0x5]);
+             * const json = JSON.stringify(buf);
+             *
+             * console.log(json);
+             * // Prints: {"type":"Buffer","data":[1,2,3,4,5]}
+             *
+             * const copy = JSON.parse(json, (key, value) => {
+             *   return value &#x26;&#x26; value.type === 'Buffer' ?
+             *     Buffer.from(value) :
+             *     value;
+             * });
+             *
+             * console.log(copy);
+             * // Prints: <Buffer 01 02 03 04 05>
+             * ```
+             * @since v0.9.2
+             */
+            toJSON(): {
+                type: 'Buffer';
+                data: number[];
+            };
+            /**
+             * Returns `true` if both `buf` and `otherBuffer` have exactly the same bytes,`false` otherwise. Equivalent to `buf.compare(otherBuffer) === 0`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.from('ABC');
+             * const buf2 = Buffer.from('414243', 'hex');
+             * const buf3 = Buffer.from('ABCD');
+             *
+             * console.log(buf1.equals(buf2));
+             * // Prints: true
+             * console.log(buf1.equals(buf3));
+             * // Prints: false
+             * ```
+             * @since v0.11.13
+             * @param otherBuffer A `Buffer` or {@link Uint8Array} with which to compare `buf`.
+             */
+            equals(otherBuffer: Uint8Array): boolean;
+            /**
+             * Compares `buf` with `target` and returns a number indicating whether `buf`comes before, after, or is the same as `target` in sort order.
+             * Comparison is based on the actual sequence of bytes in each `Buffer`.
+             *
+             * * `0` is returned if `target` is the same as `buf`
+             * * `1` is returned if `target` should come _before_`buf` when sorted.
+             * * `-1` is returned if `target` should come _after_`buf` when sorted.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.from('ABC');
+             * const buf2 = Buffer.from('BCD');
+             * const buf3 = Buffer.from('ABCD');
+             *
+             * console.log(buf1.compare(buf1));
+             * // Prints: 0
+             * console.log(buf1.compare(buf2));
+             * // Prints: -1
+             * console.log(buf1.compare(buf3));
+             * // Prints: -1
+             * console.log(buf2.compare(buf1));
+             * // Prints: 1
+             * console.log(buf2.compare(buf3));
+             * // Prints: 1
+             * console.log([buf1, buf2, buf3].sort(Buffer.compare));
+             * // Prints: [ <Buffer 41 42 43>, <Buffer 41 42 43 44>, <Buffer 42 43 44> ]
+             * // (This result is equal to: [buf1, buf3, buf2].)
+             * ```
+             *
+             * The optional `targetStart`, `targetEnd`, `sourceStart`, and `sourceEnd`arguments can be used to limit the comparison to specific ranges within `target`and `buf` respectively.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.from([1, 2, 3, 4, 5, 6, 7, 8, 9]);
+             * const buf2 = Buffer.from([5, 6, 7, 8, 9, 1, 2, 3, 4]);
+             *
+             * console.log(buf1.compare(buf2, 5, 9, 0, 4));
+             * // Prints: 0
+             * console.log(buf1.compare(buf2, 0, 6, 4));
+             * // Prints: -1
+             * console.log(buf1.compare(buf2, 5, 6, 5));
+             * // Prints: 1
+             * ```
+             *
+             * `ERR_OUT_OF_RANGE` is thrown if `targetStart < 0`, `sourceStart < 0`,`targetEnd > target.byteLength`, or `sourceEnd > source.byteLength`.
+             * @since v0.11.13
+             * @param target A `Buffer` or {@link Uint8Array} with which to compare `buf`.
+             * @param [targetStart=0] The offset within `target` at which to begin comparison.
+             * @param [targetEnd=target.length] The offset within `target` at which to end comparison (not inclusive).
+             * @param [sourceStart=0] The offset within `buf` at which to begin comparison.
+             * @param [sourceEnd=buf.length] The offset within `buf` at which to end comparison (not inclusive).
+             */
+            compare(target: Uint8Array, targetStart?: number, targetEnd?: number, sourceStart?: number, sourceEnd?: number): -1 | 0 | 1;
+            /**
+             * Copies data from a region of `buf` to a region in `target`, even if the `target`memory region overlaps with `buf`.
+             *
+             * [`TypedArray.prototype.set()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray/set) performs the same operation, and is available
+             * for all TypedArrays, including Node.js `Buffer`s, although it takes
+             * different function arguments.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Create two `Buffer` instances.
+             * const buf1 = Buffer.allocUnsafe(26);
+             * const buf2 = Buffer.allocUnsafe(26).fill('!');
+             *
+             * for (let i = 0; i < 26; i++) {
+             *   // 97 is the decimal ASCII value for 'a'.
+             *   buf1[i] = i + 97;
+             * }
+             *
+             * // Copy `buf1` bytes 16 through 19 into `buf2` starting at byte 8 of `buf2`.
+             * buf1.copy(buf2, 8, 16, 20);
+             * // This is equivalent to:
+             * // buf2.set(buf1.subarray(16, 20), 8);
+             *
+             * console.log(buf2.toString('ascii', 0, 25));
+             * // Prints: !!!!!!!!qrst!!!!!!!!!!!!!
+             * ```
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Create a `Buffer` and copy data from one region to an overlapping region
+             * // within the same `Buffer`.
+             *
+             * const buf = Buffer.allocUnsafe(26);
+             *
+             * for (let i = 0; i < 26; i++) {
+             *   // 97 is the decimal ASCII value for 'a'.
+             *   buf[i] = i + 97;
+             * }
+             *
+             * buf.copy(buf, 0, 4, 10);
+             *
+             * console.log(buf.toString());
+             * // Prints: efghijghijklmnopqrstuvwxyz
+             * ```
+             * @since v0.1.90
+             * @param target A `Buffer` or {@link Uint8Array} to copy into.
+             * @param [targetStart=0] The offset within `target` at which to begin writing.
+             * @param [sourceStart=0] The offset within `buf` from which to begin copying.
+             * @param [sourceEnd=buf.length] The offset within `buf` at which to stop copying (not inclusive).
+             * @return The number of bytes copied.
+             */
+            copy(target: Uint8Array, targetStart?: number, sourceStart?: number, sourceEnd?: number): number;
+            /**
+             * Returns a new `Buffer` that references the same memory as the original, but
+             * offset and cropped by the `start` and `end` indices.
+             *
+             * This is the same behavior as `buf.subarray()`.
+             *
+             * This method is not compatible with the `Uint8Array.prototype.slice()`,
+             * which is a superclass of `Buffer`. To copy the slice, use`Uint8Array.prototype.slice()`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('buffer');
+             *
+             * const copiedBuf = Uint8Array.prototype.slice.call(buf);
+             * copiedBuf[0]++;
+             * console.log(copiedBuf.toString());
+             * // Prints: cuffer
+             *
+             * console.log(buf.toString());
+             * // Prints: buffer
+             * ```
+             * @since v0.3.0
+             * @param [start=0] Where the new `Buffer` will start.
+             * @param [end=buf.length] Where the new `Buffer` will end (not inclusive).
+             */
+            slice(start?: number, end?: number): Buffer;
+            /**
+             * Returns a new `Buffer` that references the same memory as the original, but
+             * offset and cropped by the `start` and `end` indices.
+             *
+             * Specifying `end` greater than `buf.length` will return the same result as
+             * that of `end` equal to `buf.length`.
+             *
+             * This method is inherited from [`TypedArray.prototype.subarray()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray/subarray).
+             *
+             * Modifying the new `Buffer` slice will modify the memory in the original `Buffer`because the allocated memory of the two objects overlap.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Create a `Buffer` with the ASCII alphabet, take a slice, and modify one byte
+             * // from the original `Buffer`.
+             *
+             * const buf1 = Buffer.allocUnsafe(26);
+             *
+             * for (let i = 0; i < 26; i++) {
+             *   // 97 is the decimal ASCII value for 'a'.
+             *   buf1[i] = i + 97;
+             * }
+             *
+             * const buf2 = buf1.subarray(0, 3);
+             *
+             * console.log(buf2.toString('ascii', 0, buf2.length));
+             * // Prints: abc
+             *
+             * buf1[0] = 33;
+             *
+             * console.log(buf2.toString('ascii', 0, buf2.length));
+             * // Prints: !bc
+             * ```
+             *
+             * Specifying negative indexes causes the slice to be generated relative to the
+             * end of `buf` rather than the beginning.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('buffer');
+             *
+             * console.log(buf.subarray(-6, -1).toString());
+             * // Prints: buffe
+             * // (Equivalent to buf.subarray(0, 5).)
+             *
+             * console.log(buf.subarray(-6, -2).toString());
+             * // Prints: buff
+             * // (Equivalent to buf.subarray(0, 4).)
+             *
+             * console.log(buf.subarray(-5, -2).toString());
+             * // Prints: uff
+             * // (Equivalent to buf.subarray(1, 4).)
+             * ```
+             * @since v3.0.0
+             * @param [start=0] Where the new `Buffer` will start.
+             * @param [end=buf.length] Where the new `Buffer` will end (not inclusive).
+             */
+            subarray(start?: number, end?: number): Buffer;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian.
+             *
+             * `value` is interpreted and written as a two's complement signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(8);
+             *
+             * buf.writeBigInt64BE(0x0102030405060708n, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 01 02 03 04 05 06 07 08>
+             * ```
+             * @since v12.0.0, v10.20.0
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy: `0 <= offset <= buf.length - 8`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeBigInt64BE(value: bigint, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian.
+             *
+             * `value` is interpreted and written as a two's complement signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(8);
+             *
+             * buf.writeBigInt64LE(0x0102030405060708n, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 08 07 06 05 04 03 02 01>
+             * ```
+             * @since v12.0.0, v10.20.0
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy: `0 <= offset <= buf.length - 8`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeBigInt64LE(value: bigint, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian.
+             *
+             * This function is also available under the `writeBigUint64BE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(8);
+             *
+             * buf.writeBigUInt64BE(0xdecafafecacefaden, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer de ca fa fe ca ce fa de>
+             * ```
+             * @since v12.0.0, v10.20.0
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy: `0 <= offset <= buf.length - 8`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeBigUInt64BE(value: bigint, offset?: number): number;
+            /**
+             * @alias Buffer.writeBigUInt64BE
+             * @since v14.10.0, v12.19.0
+             */
+            writeBigUint64BE(value: bigint, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(8);
+             *
+             * buf.writeBigUInt64LE(0xdecafafecacefaden, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer de fa ce ca fe fa ca de>
+             * ```
+             *
+             * This function is also available under the `writeBigUint64LE` alias.
+             * @since v12.0.0, v10.20.0
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy: `0 <= offset <= buf.length - 8`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeBigUInt64LE(value: bigint, offset?: number): number;
+            /**
+             * @alias Buffer.writeBigUInt64LE
+             * @since v14.10.0, v12.19.0
+             */
+            writeBigUint64LE(value: bigint, offset?: number): number;
+            /**
+             * Writes `byteLength` bytes of `value` to `buf` at the specified `offset`as little-endian. Supports up to 48 bits of accuracy. Behavior is undefined
+             * when `value` is anything other than an unsigned integer.
+             *
+             * This function is also available under the `writeUintLE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(6);
+             *
+             * buf.writeUIntLE(0x1234567890ab, 0, 6);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer ab 90 78 56 34 12>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param offset Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to write. Must satisfy `0 < byteLength <= 6`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeUIntLE(value: number, offset: number, byteLength: number): number;
+            /**
+             * @alias Buffer.writeUIntLE
+             * @since v14.9.0, v12.19.0
+             */
+            writeUintLE(value: number, offset: number, byteLength: number): number;
+            /**
+             * Writes `byteLength` bytes of `value` to `buf` at the specified `offset`as big-endian. Supports up to 48 bits of accuracy. Behavior is undefined
+             * when `value` is anything other than an unsigned integer.
+             *
+             * This function is also available under the `writeUintBE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(6);
+             *
+             * buf.writeUIntBE(0x1234567890ab, 0, 6);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 12 34 56 78 90 ab>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param offset Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to write. Must satisfy `0 < byteLength <= 6`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeUIntBE(value: number, offset: number, byteLength: number): number;
+            /**
+             * @alias Buffer.writeUIntBE
+             * @since v14.9.0, v12.19.0
+             */
+            writeUintBE(value: number, offset: number, byteLength: number): number;
+            /**
+             * Writes `byteLength` bytes of `value` to `buf` at the specified `offset`as little-endian. Supports up to 48 bits of accuracy. Behavior is undefined
+             * when `value` is anything other than a signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(6);
+             *
+             * buf.writeIntLE(0x1234567890ab, 0, 6);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer ab 90 78 56 34 12>
+             * ```
+             * @since v0.11.15
+             * @param value Number to be written to `buf`.
+             * @param offset Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to write. Must satisfy `0 < byteLength <= 6`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeIntLE(value: number, offset: number, byteLength: number): number;
+            /**
+             * Writes `byteLength` bytes of `value` to `buf` at the specified `offset`as big-endian. Supports up to 48 bits of accuracy. Behavior is undefined when`value` is anything other than a
+             * signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(6);
+             *
+             * buf.writeIntBE(0x1234567890ab, 0, 6);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 12 34 56 78 90 ab>
+             * ```
+             * @since v0.11.15
+             * @param value Number to be written to `buf`.
+             * @param offset Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to write. Must satisfy `0 < byteLength <= 6`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeIntBE(value: number, offset: number, byteLength: number): number;
+            /**
+             * Reads an unsigned, big-endian 64-bit integer from `buf` at the specified`offset`.
+             *
+             * This function is also available under the `readBigUint64BE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x00, 0x00, 0x00, 0x00, 0xff, 0xff, 0xff, 0xff]);
+             *
+             * console.log(buf.readBigUInt64BE(0));
+             * // Prints: 4294967295n
+             * ```
+             * @since v12.0.0, v10.20.0
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy: `0 <= offset <= buf.length - 8`.
+             */
+            readBigUInt64BE(offset?: number): bigint;
+            /**
+             * @alias Buffer.readBigUInt64BE
+             * @since v14.10.0, v12.19.0
+             */
+            readBigUint64BE(offset?: number): bigint;
+            /**
+             * Reads an unsigned, little-endian 64-bit integer from `buf` at the specified`offset`.
+             *
+             * This function is also available under the `readBigUint64LE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x00, 0x00, 0x00, 0x00, 0xff, 0xff, 0xff, 0xff]);
+             *
+             * console.log(buf.readBigUInt64LE(0));
+             * // Prints: 18446744069414584320n
+             * ```
+             * @since v12.0.0, v10.20.0
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy: `0 <= offset <= buf.length - 8`.
+             */
+            readBigUInt64LE(offset?: number): bigint;
+            /**
+             * @alias Buffer.readBigUInt64LE
+             * @since v14.10.0, v12.19.0
+             */
+            readBigUint64LE(offset?: number): bigint;
+            /**
+             * Reads a signed, big-endian 64-bit integer from `buf` at the specified `offset`.
+             *
+             * Integers read from a `Buffer` are interpreted as two's complement signed
+             * values.
+             * @since v12.0.0, v10.20.0
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy: `0 <= offset <= buf.length - 8`.
+             */
+            readBigInt64BE(offset?: number): bigint;
+            /**
+             * Reads a signed, little-endian 64-bit integer from `buf` at the specified`offset`.
+             *
+             * Integers read from a `Buffer` are interpreted as two's complement signed
+             * values.
+             * @since v12.0.0, v10.20.0
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy: `0 <= offset <= buf.length - 8`.
+             */
+            readBigInt64LE(offset?: number): bigint;
+            /**
+             * Reads `byteLength` number of bytes from `buf` at the specified `offset`and interprets the result as an unsigned, little-endian integer supporting
+             * up to 48 bits of accuracy.
+             *
+             * This function is also available under the `readUintLE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56, 0x78, 0x90, 0xab]);
+             *
+             * console.log(buf.readUIntLE(0, 6).toString(16));
+             * // Prints: ab9078563412
+             * ```
+             * @since v0.11.15
+             * @param offset Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to read. Must satisfy `0 < byteLength <= 6`.
+             */
+            readUIntLE(offset: number, byteLength: number): number;
+            /**
+             * @alias Buffer.readUIntLE
+             * @since v14.9.0, v12.19.0
+             */
+            readUintLE(offset: number, byteLength: number): number;
+            /**
+             * Reads `byteLength` number of bytes from `buf` at the specified `offset`and interprets the result as an unsigned big-endian integer supporting
+             * up to 48 bits of accuracy.
+             *
+             * This function is also available under the `readUintBE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56, 0x78, 0x90, 0xab]);
+             *
+             * console.log(buf.readUIntBE(0, 6).toString(16));
+             * // Prints: 1234567890ab
+             * console.log(buf.readUIntBE(1, 6).toString(16));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.11.15
+             * @param offset Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to read. Must satisfy `0 < byteLength <= 6`.
+             */
+            readUIntBE(offset: number, byteLength: number): number;
+            /**
+             * @alias Buffer.readUIntBE
+             * @since v14.9.0, v12.19.0
+             */
+            readUintBE(offset: number, byteLength: number): number;
+            /**
+             * Reads `byteLength` number of bytes from `buf` at the specified `offset`and interprets the result as a little-endian, two's complement signed value
+             * supporting up to 48 bits of accuracy.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56, 0x78, 0x90, 0xab]);
+             *
+             * console.log(buf.readIntLE(0, 6).toString(16));
+             * // Prints: -546f87a9cbee
+             * ```
+             * @since v0.11.15
+             * @param offset Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to read. Must satisfy `0 < byteLength <= 6`.
+             */
+            readIntLE(offset: number, byteLength: number): number;
+            /**
+             * Reads `byteLength` number of bytes from `buf` at the specified `offset`and interprets the result as a big-endian, two's complement signed value
+             * supporting up to 48 bits of accuracy.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56, 0x78, 0x90, 0xab]);
+             *
+             * console.log(buf.readIntBE(0, 6).toString(16));
+             * // Prints: 1234567890ab
+             * console.log(buf.readIntBE(1, 6).toString(16));
+             * // Throws ERR_OUT_OF_RANGE.
+             * console.log(buf.readIntBE(1, 0).toString(16));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.11.15
+             * @param offset Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - byteLength`.
+             * @param byteLength Number of bytes to read. Must satisfy `0 < byteLength <= 6`.
+             */
+            readIntBE(offset: number, byteLength: number): number;
+            /**
+             * Reads an unsigned 8-bit integer from `buf` at the specified `offset`.
+             *
+             * This function is also available under the `readUint8` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([1, -2]);
+             *
+             * console.log(buf.readUInt8(0));
+             * // Prints: 1
+             * console.log(buf.readUInt8(1));
+             * // Prints: 254
+             * console.log(buf.readUInt8(2));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.5.0
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 1`.
+             */
+            readUInt8(offset?: number): number;
+            /**
+             * @alias Buffer.readUInt8
+             * @since v14.9.0, v12.19.0
+             */
+            readUint8(offset?: number): number;
+            /**
+             * Reads an unsigned, little-endian 16-bit integer from `buf` at the specified`offset`.
+             *
+             * This function is also available under the `readUint16LE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56]);
+             *
+             * console.log(buf.readUInt16LE(0).toString(16));
+             * // Prints: 3412
+             * console.log(buf.readUInt16LE(1).toString(16));
+             * // Prints: 5634
+             * console.log(buf.readUInt16LE(2).toString(16));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 2`.
+             */
+            readUInt16LE(offset?: number): number;
+            /**
+             * @alias Buffer.readUInt16LE
+             * @since v14.9.0, v12.19.0
+             */
+            readUint16LE(offset?: number): number;
+            /**
+             * Reads an unsigned, big-endian 16-bit integer from `buf` at the specified`offset`.
+             *
+             * This function is also available under the `readUint16BE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56]);
+             *
+             * console.log(buf.readUInt16BE(0).toString(16));
+             * // Prints: 1234
+             * console.log(buf.readUInt16BE(1).toString(16));
+             * // Prints: 3456
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 2`.
+             */
+            readUInt16BE(offset?: number): number;
+            /**
+             * @alias Buffer.readUInt16BE
+             * @since v14.9.0, v12.19.0
+             */
+            readUint16BE(offset?: number): number;
+            /**
+             * Reads an unsigned, little-endian 32-bit integer from `buf` at the specified`offset`.
+             *
+             * This function is also available under the `readUint32LE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56, 0x78]);
+             *
+             * console.log(buf.readUInt32LE(0).toString(16));
+             * // Prints: 78563412
+             * console.log(buf.readUInt32LE(1).toString(16));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 4`.
+             */
+            readUInt32LE(offset?: number): number;
+            /**
+             * @alias Buffer.readUInt32LE
+             * @since v14.9.0, v12.19.0
+             */
+            readUint32LE(offset?: number): number;
+            /**
+             * Reads an unsigned, big-endian 32-bit integer from `buf` at the specified`offset`.
+             *
+             * This function is also available under the `readUint32BE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0x12, 0x34, 0x56, 0x78]);
+             *
+             * console.log(buf.readUInt32BE(0).toString(16));
+             * // Prints: 12345678
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 4`.
+             */
+            readUInt32BE(offset?: number): number;
+            /**
+             * @alias Buffer.readUInt32BE
+             * @since v14.9.0, v12.19.0
+             */
+            readUint32BE(offset?: number): number;
+            /**
+             * Reads a signed 8-bit integer from `buf` at the specified `offset`.
+             *
+             * Integers read from a `Buffer` are interpreted as two's complement signed values.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([-1, 5]);
+             *
+             * console.log(buf.readInt8(0));
+             * // Prints: -1
+             * console.log(buf.readInt8(1));
+             * // Prints: 5
+             * console.log(buf.readInt8(2));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.5.0
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 1`.
+             */
+            readInt8(offset?: number): number;
+            /**
+             * Reads a signed, little-endian 16-bit integer from `buf` at the specified`offset`.
+             *
+             * Integers read from a `Buffer` are interpreted as two's complement signed values.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0, 5]);
+             *
+             * console.log(buf.readInt16LE(0));
+             * // Prints: 1280
+             * console.log(buf.readInt16LE(1));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 2`.
+             */
+            readInt16LE(offset?: number): number;
+            /**
+             * Reads a signed, big-endian 16-bit integer from `buf` at the specified `offset`.
+             *
+             * Integers read from a `Buffer` are interpreted as two's complement signed values.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0, 5]);
+             *
+             * console.log(buf.readInt16BE(0));
+             * // Prints: 5
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 2`.
+             */
+            readInt16BE(offset?: number): number;
+            /**
+             * Reads a signed, little-endian 32-bit integer from `buf` at the specified`offset`.
+             *
+             * Integers read from a `Buffer` are interpreted as two's complement signed values.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0, 0, 0, 5]);
+             *
+             * console.log(buf.readInt32LE(0));
+             * // Prints: 83886080
+             * console.log(buf.readInt32LE(1));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 4`.
+             */
+            readInt32LE(offset?: number): number;
+            /**
+             * Reads a signed, big-endian 32-bit integer from `buf` at the specified `offset`.
+             *
+             * Integers read from a `Buffer` are interpreted as two's complement signed values.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([0, 0, 0, 5]);
+             *
+             * console.log(buf.readInt32BE(0));
+             * // Prints: 5
+             * ```
+             * @since v0.5.5
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 4`.
+             */
+            readInt32BE(offset?: number): number;
+            /**
+             * Reads a 32-bit, little-endian float from `buf` at the specified `offset`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([1, 2, 3, 4]);
+             *
+             * console.log(buf.readFloatLE(0));
+             * // Prints: 1.539989614439558e-36
+             * console.log(buf.readFloatLE(1));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.11.15
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 4`.
+             */
+            readFloatLE(offset?: number): number;
+            /**
+             * Reads a 32-bit, big-endian float from `buf` at the specified `offset`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([1, 2, 3, 4]);
+             *
+             * console.log(buf.readFloatBE(0));
+             * // Prints: 2.387939260590663e-38
+             * ```
+             * @since v0.11.15
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 4`.
+             */
+            readFloatBE(offset?: number): number;
+            /**
+             * Reads a 64-bit, little-endian double from `buf` at the specified `offset`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([1, 2, 3, 4, 5, 6, 7, 8]);
+             *
+             * console.log(buf.readDoubleLE(0));
+             * // Prints: 5.447603722011605e-270
+             * console.log(buf.readDoubleLE(1));
+             * // Throws ERR_OUT_OF_RANGE.
+             * ```
+             * @since v0.11.15
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 8`.
+             */
+            readDoubleLE(offset?: number): number;
+            /**
+             * Reads a 64-bit, big-endian double from `buf` at the specified `offset`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from([1, 2, 3, 4, 5, 6, 7, 8]);
+             *
+             * console.log(buf.readDoubleBE(0));
+             * // Prints: 8.20788039913184e-304
+             * ```
+             * @since v0.11.15
+             * @param [offset=0] Number of bytes to skip before starting to read. Must satisfy `0 <= offset <= buf.length - 8`.
+             */
+            readDoubleBE(offset?: number): number;
+            reverse(): this;
+            /**
+             * Interprets `buf` as an array of unsigned 16-bit integers and swaps the
+             * byte order _in-place_. Throws `ERR_INVALID_BUFFER_SIZE` if `buf.length` is not a multiple of 2.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.from([0x1, 0x2, 0x3, 0x4, 0x5, 0x6, 0x7, 0x8]);
+             *
+             * console.log(buf1);
+             * // Prints: <Buffer 01 02 03 04 05 06 07 08>
+             *
+             * buf1.swap16();
+             *
+             * console.log(buf1);
+             * // Prints: <Buffer 02 01 04 03 06 05 08 07>
+             *
+             * const buf2 = Buffer.from([0x1, 0x2, 0x3]);
+             *
+             * buf2.swap16();
+             * // Throws ERR_INVALID_BUFFER_SIZE.
+             * ```
+             *
+             * One convenient use of `buf.swap16()` is to perform a fast in-place conversion
+             * between UTF-16 little-endian and UTF-16 big-endian:
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('This is little-endian UTF-16', 'utf16le');
+             * buf.swap16(); // Convert to big-endian UTF-16 text.
+             * ```
+             * @since v5.10.0
+             * @return A reference to `buf`.
+             */
+            swap16(): Buffer;
+            /**
+             * Interprets `buf` as an array of unsigned 32-bit integers and swaps the
+             * byte order _in-place_. Throws `ERR_INVALID_BUFFER_SIZE` if `buf.length` is not a multiple of 4.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.from([0x1, 0x2, 0x3, 0x4, 0x5, 0x6, 0x7, 0x8]);
+             *
+             * console.log(buf1);
+             * // Prints: <Buffer 01 02 03 04 05 06 07 08>
+             *
+             * buf1.swap32();
+             *
+             * console.log(buf1);
+             * // Prints: <Buffer 04 03 02 01 08 07 06 05>
+             *
+             * const buf2 = Buffer.from([0x1, 0x2, 0x3]);
+             *
+             * buf2.swap32();
+             * // Throws ERR_INVALID_BUFFER_SIZE.
+             * ```
+             * @since v5.10.0
+             * @return A reference to `buf`.
+             */
+            swap32(): Buffer;
+            /**
+             * Interprets `buf` as an array of 64-bit numbers and swaps byte order _in-place_.
+             * Throws `ERR_INVALID_BUFFER_SIZE` if `buf.length` is not a multiple of 8.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf1 = Buffer.from([0x1, 0x2, 0x3, 0x4, 0x5, 0x6, 0x7, 0x8]);
+             *
+             * console.log(buf1);
+             * // Prints: <Buffer 01 02 03 04 05 06 07 08>
+             *
+             * buf1.swap64();
+             *
+             * console.log(buf1);
+             * // Prints: <Buffer 08 07 06 05 04 03 02 01>
+             *
+             * const buf2 = Buffer.from([0x1, 0x2, 0x3]);
+             *
+             * buf2.swap64();
+             * // Throws ERR_INVALID_BUFFER_SIZE.
+             * ```
+             * @since v6.3.0
+             * @return A reference to `buf`.
+             */
+            swap64(): Buffer;
+            /**
+             * Writes `value` to `buf` at the specified `offset`. `value` must be a
+             * valid unsigned 8-bit integer. Behavior is undefined when `value` is anything
+             * other than an unsigned 8-bit integer.
+             *
+             * This function is also available under the `writeUint8` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeUInt8(0x3, 0);
+             * buf.writeUInt8(0x4, 1);
+             * buf.writeUInt8(0x23, 2);
+             * buf.writeUInt8(0x42, 3);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 03 04 23 42>
+             * ```
+             * @since v0.5.0
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 1`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeUInt8(value: number, offset?: number): number;
+            /**
+             * @alias Buffer.writeUInt8
+             * @since v14.9.0, v12.19.0
+             */
+            writeUint8(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian. The `value`must be a valid unsigned 16-bit integer. Behavior is undefined when `value` is
+             * anything other than an unsigned 16-bit integer.
+             *
+             * This function is also available under the `writeUint16LE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeUInt16LE(0xdead, 0);
+             * buf.writeUInt16LE(0xbeef, 2);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer ad de ef be>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 2`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeUInt16LE(value: number, offset?: number): number;
+            /**
+             * @alias Buffer.writeUInt16LE
+             * @since v14.9.0, v12.19.0
+             */
+            writeUint16LE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian. The `value`must be a valid unsigned 16-bit integer. Behavior is undefined when `value`is anything other than an
+             * unsigned 16-bit integer.
+             *
+             * This function is also available under the `writeUint16BE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeUInt16BE(0xdead, 0);
+             * buf.writeUInt16BE(0xbeef, 2);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer de ad be ef>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 2`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeUInt16BE(value: number, offset?: number): number;
+            /**
+             * @alias Buffer.writeUInt16BE
+             * @since v14.9.0, v12.19.0
+             */
+            writeUint16BE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian. The `value`must be a valid unsigned 32-bit integer. Behavior is undefined when `value` is
+             * anything other than an unsigned 32-bit integer.
+             *
+             * This function is also available under the `writeUint32LE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeUInt32LE(0xfeedface, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer ce fa ed fe>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 4`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeUInt32LE(value: number, offset?: number): number;
+            /**
+             * @alias Buffer.writeUInt32LE
+             * @since v14.9.0, v12.19.0
+             */
+            writeUint32LE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian. The `value`must be a valid unsigned 32-bit integer. Behavior is undefined when `value`is anything other than an
+             * unsigned 32-bit integer.
+             *
+             * This function is also available under the `writeUint32BE` alias.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeUInt32BE(0xfeedface, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer fe ed fa ce>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 4`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeUInt32BE(value: number, offset?: number): number;
+            /**
+             * @alias Buffer.writeUInt32BE
+             * @since v14.9.0, v12.19.0
+             */
+            writeUint32BE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset`. `value` must be a valid
+             * signed 8-bit integer. Behavior is undefined when `value` is anything other than
+             * a signed 8-bit integer.
+             *
+             * `value` is interpreted and written as a two's complement signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(2);
+             *
+             * buf.writeInt8(2, 0);
+             * buf.writeInt8(-2, 1);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 02 fe>
+             * ```
+             * @since v0.5.0
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 1`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeInt8(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian.  The `value`must be a valid signed 16-bit integer. Behavior is undefined when `value` is
+             * anything other than a signed 16-bit integer.
+             *
+             * The `value` is interpreted and written as a two's complement signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(2);
+             *
+             * buf.writeInt16LE(0x0304, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 04 03>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 2`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeInt16LE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian.  The `value`must be a valid signed 16-bit integer. Behavior is undefined when `value` is
+             * anything other than a signed 16-bit integer.
+             *
+             * The `value` is interpreted and written as a two's complement signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(2);
+             *
+             * buf.writeInt16BE(0x0102, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 01 02>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 2`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeInt16BE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian. The `value`must be a valid signed 32-bit integer. Behavior is undefined when `value` is
+             * anything other than a signed 32-bit integer.
+             *
+             * The `value` is interpreted and written as a two's complement signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeInt32LE(0x05060708, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 08 07 06 05>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 4`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeInt32LE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian. The `value`must be a valid signed 32-bit integer. Behavior is undefined when `value` is
+             * anything other than a signed 32-bit integer.
+             *
+             * The `value` is interpreted and written as a two's complement signed integer.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeInt32BE(0x01020304, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 01 02 03 04>
+             * ```
+             * @since v0.5.5
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 4`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeInt32BE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian. Behavior is
+             * undefined when `value` is anything other than a JavaScript number.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeFloatLE(0xcafebabe, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer bb fe 4a 4f>
+             * ```
+             * @since v0.11.15
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 4`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeFloatLE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian. Behavior is
+             * undefined when `value` is anything other than a JavaScript number.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(4);
+             *
+             * buf.writeFloatBE(0xcafebabe, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 4f 4a fe bb>
+             * ```
+             * @since v0.11.15
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 4`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeFloatBE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as little-endian. The `value`must be a JavaScript number. Behavior is undefined when `value` is anything
+             * other than a JavaScript number.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(8);
+             *
+             * buf.writeDoubleLE(123.456, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 77 be 9f 1a 2f dd 5e 40>
+             * ```
+             * @since v0.11.15
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 8`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeDoubleLE(value: number, offset?: number): number;
+            /**
+             * Writes `value` to `buf` at the specified `offset` as big-endian. The `value`must be a JavaScript number. Behavior is undefined when `value` is anything
+             * other than a JavaScript number.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(8);
+             *
+             * buf.writeDoubleBE(123.456, 0);
+             *
+             * console.log(buf);
+             * // Prints: <Buffer 40 5e dd 2f 1a 9f be 77>
+             * ```
+             * @since v0.11.15
+             * @param value Number to be written to `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to write. Must satisfy `0 <= offset <= buf.length - 8`.
+             * @return `offset` plus the number of bytes written.
+             */
+            writeDoubleBE(value: number, offset?: number): number;
+            /**
+             * Fills `buf` with the specified `value`. If the `offset` and `end` are not given,
+             * the entire `buf` will be filled:
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Fill a `Buffer` with the ASCII character 'h'.
+             *
+             * const b = Buffer.allocUnsafe(50).fill('h');
+             *
+             * console.log(b.toString());
+             * // Prints: hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
+             * ```
+             *
+             * `value` is coerced to a `uint32` value if it is not a string, `Buffer`, or
+             * integer. If the resulting integer is greater than `255` (decimal), `buf` will be
+             * filled with `value &#x26; 255`.
+             *
+             * If the final write of a `fill()` operation falls on a multi-byte character,
+             * then only the bytes of that character that fit into `buf` are written:
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Fill a `Buffer` with character that takes up two bytes in UTF-8.
+             *
+             * console.log(Buffer.allocUnsafe(5).fill('\u0222'));
+             * // Prints: <Buffer c8 a2 c8 a2 c8>
+             * ```
+             *
+             * If `value` contains invalid characters, it is truncated; if no valid
+             * fill data remains, an exception is thrown:
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.allocUnsafe(5);
+             *
+             * console.log(buf.fill('a'));
+             * // Prints: <Buffer 61 61 61 61 61>
+             * console.log(buf.fill('aazz', 'hex'));
+             * // Prints: <Buffer aa aa aa aa aa>
+             * console.log(buf.fill('zz', 'hex'));
+             * // Throws an exception.
+             * ```
+             * @since v0.5.0
+             * @param value The value with which to fill `buf`.
+             * @param [offset=0] Number of bytes to skip before starting to fill `buf`.
+             * @param [end=buf.length] Where to stop filling `buf` (not inclusive).
+             * @param [encoding='utf8'] The encoding for `value` if `value` is a string.
+             * @return A reference to `buf`.
+             */
+            fill(value: string | Uint8Array | number, offset?: number, end?: number, encoding?: BufferEncoding): this;
+            /**
+             * If `value` is:
+             *
+             * * a string, `value` is interpreted according to the character encoding in`encoding`.
+             * * a `Buffer` or [`Uint8Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint8Array), `value` will be used in its entirety.
+             * To compare a partial `Buffer`, use `buf.slice()`.
+             * * a number, `value` will be interpreted as an unsigned 8-bit integer
+             * value between `0` and `255`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('this is a buffer');
+             *
+             * console.log(buf.indexOf('this'));
+             * // Prints: 0
+             * console.log(buf.indexOf('is'));
+             * // Prints: 2
+             * console.log(buf.indexOf(Buffer.from('a buffer')));
+             * // Prints: 8
+             * console.log(buf.indexOf(97));
+             * // Prints: 8 (97 is the decimal ASCII value for 'a')
+             * console.log(buf.indexOf(Buffer.from('a buffer example')));
+             * // Prints: -1
+             * console.log(buf.indexOf(Buffer.from('a buffer example').slice(0, 8)));
+             * // Prints: 8
+             *
+             * const utf16Buffer = Buffer.from('\u039a\u0391\u03a3\u03a3\u0395', 'utf16le');
+             *
+             * console.log(utf16Buffer.indexOf('\u03a3', 0, 'utf16le'));
+             * // Prints: 4
+             * console.log(utf16Buffer.indexOf('\u03a3', -4, 'utf16le'));
+             * // Prints: 6
+             * ```
+             *
+             * If `value` is not a string, number, or `Buffer`, this method will throw a`TypeError`. If `value` is a number, it will be coerced to a valid byte value,
+             * an integer between 0 and 255.
+             *
+             * If `byteOffset` is not a number, it will be coerced to a number. If the result
+             * of coercion is `NaN` or `0`, then the entire buffer will be searched. This
+             * behavior matches [`String.prototype.indexOf()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/indexOf).
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const b = Buffer.from('abcdef');
+             *
+             * // Passing a value that's a number, but not a valid byte.
+             * // Prints: 2, equivalent to searching for 99 or 'c'.
+             * console.log(b.indexOf(99.9));
+             * console.log(b.indexOf(256 + 99));
+             *
+             * // Passing a byteOffset that coerces to NaN or 0.
+             * // Prints: 1, searching the whole buffer.
+             * console.log(b.indexOf('b', undefined));
+             * console.log(b.indexOf('b', {}));
+             * console.log(b.indexOf('b', null));
+             * console.log(b.indexOf('b', []));
+             * ```
+             *
+             * If `value` is an empty string or empty `Buffer` and `byteOffset` is less
+             * than `buf.length`, `byteOffset` will be returned. If `value` is empty and`byteOffset` is at least `buf.length`, `buf.length` will be returned.
+             * @since v1.5.0
+             * @param value What to search for.
+             * @param [byteOffset=0] Where to begin searching in `buf`. If negative, then offset is calculated from the end of `buf`.
+             * @param [encoding='utf8'] If `value` is a string, this is the encoding used to determine the binary representation of the string that will be searched for in `buf`.
+             * @return The index of the first occurrence of `value` in `buf`, or `-1` if `buf` does not contain `value`.
+             */
+            indexOf(value: string | number | Uint8Array, byteOffset?: number, encoding?: BufferEncoding): number;
+            /**
+             * Identical to `buf.indexOf()`, except the last occurrence of `value` is found
+             * rather than the first occurrence.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('this buffer is a buffer');
+             *
+             * console.log(buf.lastIndexOf('this'));
+             * // Prints: 0
+             * console.log(buf.lastIndexOf('buffer'));
+             * // Prints: 17
+             * console.log(buf.lastIndexOf(Buffer.from('buffer')));
+             * // Prints: 17
+             * console.log(buf.lastIndexOf(97));
+             * // Prints: 15 (97 is the decimal ASCII value for 'a')
+             * console.log(buf.lastIndexOf(Buffer.from('yolo')));
+             * // Prints: -1
+             * console.log(buf.lastIndexOf('buffer', 5));
+             * // Prints: 5
+             * console.log(buf.lastIndexOf('buffer', 4));
+             * // Prints: -1
+             *
+             * const utf16Buffer = Buffer.from('\u039a\u0391\u03a3\u03a3\u0395', 'utf16le');
+             *
+             * console.log(utf16Buffer.lastIndexOf('\u03a3', undefined, 'utf16le'));
+             * // Prints: 6
+             * console.log(utf16Buffer.lastIndexOf('\u03a3', -5, 'utf16le'));
+             * // Prints: 4
+             * ```
+             *
+             * If `value` is not a string, number, or `Buffer`, this method will throw a`TypeError`. If `value` is a number, it will be coerced to a valid byte value,
+             * an integer between 0 and 255.
+             *
+             * If `byteOffset` is not a number, it will be coerced to a number. Any arguments
+             * that coerce to `NaN`, like `{}` or `undefined`, will search the whole buffer.
+             * This behavior matches [`String.prototype.lastIndexOf()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/lastIndexOf).
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const b = Buffer.from('abcdef');
+             *
+             * // Passing a value that's a number, but not a valid byte.
+             * // Prints: 2, equivalent to searching for 99 or 'c'.
+             * console.log(b.lastIndexOf(99.9));
+             * console.log(b.lastIndexOf(256 + 99));
+             *
+             * // Passing a byteOffset that coerces to NaN.
+             * // Prints: 1, searching the whole buffer.
+             * console.log(b.lastIndexOf('b', undefined));
+             * console.log(b.lastIndexOf('b', {}));
+             *
+             * // Passing a byteOffset that coerces to 0.
+             * // Prints: -1, equivalent to passing 0.
+             * console.log(b.lastIndexOf('b', null));
+             * console.log(b.lastIndexOf('b', []));
+             * ```
+             *
+             * If `value` is an empty string or empty `Buffer`, `byteOffset` will be returned.
+             * @since v6.0.0
+             * @param value What to search for.
+             * @param [byteOffset=buf.length - 1] Where to begin searching in `buf`. If negative, then offset is calculated from the end of `buf`.
+             * @param [encoding='utf8'] If `value` is a string, this is the encoding used to determine the binary representation of the string that will be searched for in `buf`.
+             * @return The index of the last occurrence of `value` in `buf`, or `-1` if `buf` does not contain `value`.
+             */
+            lastIndexOf(value: string | number | Uint8Array, byteOffset?: number, encoding?: BufferEncoding): number;
+            /**
+             * Creates and returns an [iterator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols) of `[index, byte]` pairs from the contents
+             * of `buf`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * // Log the entire contents of a `Buffer`.
+             *
+             * const buf = Buffer.from('buffer');
+             *
+             * for (const pair of buf.entries()) {
+             *   console.log(pair);
+             * }
+             * // Prints:
+             * //   [0, 98]
+             * //   [1, 117]
+             * //   [2, 102]
+             * //   [3, 102]
+             * //   [4, 101]
+             * //   [5, 114]
+             * ```
+             * @since v1.1.0
+             */
+            entries(): IterableIterator<[number, number]>;
+            /**
+             * Equivalent to `buf.indexOf() !== -1`.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('this is a buffer');
+             *
+             * console.log(buf.includes('this'));
+             * // Prints: true
+             * console.log(buf.includes('is'));
+             * // Prints: true
+             * console.log(buf.includes(Buffer.from('a buffer')));
+             * // Prints: true
+             * console.log(buf.includes(97));
+             * // Prints: true (97 is the decimal ASCII value for 'a')
+             * console.log(buf.includes(Buffer.from('a buffer example')));
+             * // Prints: false
+             * console.log(buf.includes(Buffer.from('a buffer example').slice(0, 8)));
+             * // Prints: true
+             * console.log(buf.includes('this', 4));
+             * // Prints: false
+             * ```
+             * @since v5.3.0
+             * @param value What to search for.
+             * @param [byteOffset=0] Where to begin searching in `buf`. If negative, then offset is calculated from the end of `buf`.
+             * @param [encoding='utf8'] If `value` is a string, this is its encoding.
+             * @return `true` if `value` was found in `buf`, `false` otherwise.
+             */
+            includes(value: string | number | Buffer, byteOffset?: number, encoding?: BufferEncoding): boolean;
+            /**
+             * Creates and returns an [iterator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols) of `buf` keys (indices).
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('buffer');
+             *
+             * for (const key of buf.keys()) {
+             *   console.log(key);
+             * }
+             * // Prints:
+             * //   0
+             * //   1
+             * //   2
+             * //   3
+             * //   4
+             * //   5
+             * ```
+             * @since v1.1.0
+             */
+            keys(): IterableIterator<number>;
+            /**
+             * Creates and returns an [iterator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols) for `buf` values (bytes). This function is
+             * called automatically when a `Buffer` is used in a `for..of` statement.
+             *
+             * ```js
+             * import { Buffer } from 'buffer';
+             *
+             * const buf = Buffer.from('buffer');
+             *
+             * for (const value of buf.values()) {
+             *   console.log(value);
+             * }
+             * // Prints:
+             * //   98
+             * //   117
+             * //   102
+             * //   102
+             * //   101
+             * //   114
+             *
+             * for (const value of buf) {
+             *   console.log(value);
+             * }
+             * // Prints:
+             * //   98
+             * //   117
+             * //   102
+             * //   102
+             * //   101
+             * //   114
+             * ```
+             * @since v1.1.0
+             */
+            values(): IterableIterator<number>;
+        }
+        var Buffer: BufferConstructor;
+        /**
+         * Decodes a string of Base64-encoded data into bytes, and encodes those bytes
+         * into a string using Latin-1 (ISO-8859-1).
+         *
+         * The `data` may be any JavaScript-value that can be coerced into a string.
+         *
+         * **This function is only provided for compatibility with legacy web platform APIs**
+         * **and should never be used in new code, because they use strings to represent**
+         * **binary data and predate the introduction of typed arrays in JavaScript.**
+         * **For code running using Node.js APIs, converting between base64-encoded strings**
+         * **and binary data should be performed using `Buffer.from(str, 'base64')` and`buf.toString('base64')`.**
+         * @since v15.13.0, v14.17.0
+         * @deprecated Use `Buffer.from(data, 'base64')` instead.
+         * @param data The Base64-encoded input string.
+         */
+        function atob(data: string): string;
+        /**
+         * Decodes a string into bytes using Latin-1 (ISO-8859), and encodes those bytes
+         * into a string using Base64.
+         *
+         * The `data` may be any JavaScript-value that can be coerced into a string.
+         *
+         * **This function is only provided for compatibility with legacy web platform APIs**
+         * **and should never be used in new code, because they use strings to represent**
+         * **binary data and predate the introduction of typed arrays in JavaScript.**
+         * **For code running using Node.js APIs, converting between base64-encoded strings**
+         * **and binary data should be performed using `Buffer.from(str, 'base64')` and`buf.toString('base64')`.**
+         * @since v15.13.0, v14.17.0
+         * @deprecated Use `buf.toString('base64')` instead.
+         * @param data An ASCII (Latin1) string.
+         */
+        function btoa(data: string): string;
+    }
+}
+declare module 'node:buffer' {
+    export * from 'buffer';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/child_process.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/child_process.d.ts
new file mode 100644
index 0000000..7eae502
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/child_process.d.ts
@@ -0,0 +1,1366 @@
+/**
+ * The `child_process` module provides the ability to spawn subprocesses in
+ * a manner that is similar, but not identical, to [`popen(3)`](http://man7.org/linux/man-pages/man3/popen.3.html). This capability
+ * is primarily provided by the {@link spawn} function:
+ *
+ * ```js
+ * const { spawn } = require('child_process');
+ * const ls = spawn('ls', ['-lh', '/usr']);
+ *
+ * ls.stdout.on('data', (data) => {
+ *   console.log(`stdout: ${data}`);
+ * });
+ *
+ * ls.stderr.on('data', (data) => {
+ *   console.error(`stderr: ${data}`);
+ * });
+ *
+ * ls.on('close', (code) => {
+ *   console.log(`child process exited with code ${code}`);
+ * });
+ * ```
+ *
+ * By default, pipes for `stdin`, `stdout`, and `stderr` are established between
+ * the parent Node.js process and the spawned subprocess. These pipes have
+ * limited (and platform-specific) capacity. If the subprocess writes to
+ * stdout in excess of that limit without the output being captured, the
+ * subprocess blocks waiting for the pipe buffer to accept more data. This is
+ * identical to the behavior of pipes in the shell. Use the `{ stdio: 'ignore' }`option if the output will not be consumed.
+ *
+ * The command lookup is performed using the `options.env.PATH` environment
+ * variable if it is in the `options` object. Otherwise, `process.env.PATH` is
+ * used.
+ *
+ * On Windows, environment variables are case-insensitive. Node.js
+ * lexicographically sorts the `env` keys and uses the first one that
+ * case-insensitively matches. Only first (in lexicographic order) entry will be
+ * passed to the subprocess. This might lead to issues on Windows when passing
+ * objects to the `env` option that have multiple variants of the same key, such as`PATH` and `Path`.
+ *
+ * The {@link spawn} method spawns the child process asynchronously,
+ * without blocking the Node.js event loop. The {@link spawnSync} function provides equivalent functionality in a synchronous manner that blocks
+ * the event loop until the spawned process either exits or is terminated.
+ *
+ * For convenience, the `child_process` module provides a handful of synchronous
+ * and asynchronous alternatives to {@link spawn} and {@link spawnSync}. Each of these alternatives are implemented on
+ * top of {@link spawn} or {@link spawnSync}.
+ *
+ * * {@link exec}: spawns a shell and runs a command within that
+ * shell, passing the `stdout` and `stderr` to a callback function when
+ * complete.
+ * * {@link execFile}: similar to {@link exec} except
+ * that it spawns the command directly without first spawning a shell by
+ * default.
+ * * {@link fork}: spawns a new Node.js process and invokes a
+ * specified module with an IPC communication channel established that allows
+ * sending messages between parent and child.
+ * * {@link execSync}: a synchronous version of {@link exec} that will block the Node.js event loop.
+ * * {@link execFileSync}: a synchronous version of {@link execFile} that will block the Node.js event loop.
+ *
+ * For certain use cases, such as automating shell scripts, the `synchronous counterparts` may be more convenient. In many cases, however,
+ * the synchronous methods can have significant impact on performance due to
+ * stalling the event loop while spawned processes complete.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/child_process.js)
+ */
+declare module 'child_process' {
+    import { ObjectEncodingOptions } from 'node:fs';
+    import { EventEmitter, Abortable } from 'node:events';
+    import * as net from 'node:net';
+    import { Writable, Readable, Stream, Pipe } from 'node:stream';
+    import { URL } from 'node:url';
+    type Serializable = string | object | number | boolean | bigint;
+    type SendHandle = net.Socket | net.Server;
+    /**
+     * Instances of the `ChildProcess` represent spawned child processes.
+     *
+     * Instances of `ChildProcess` are not intended to be created directly. Rather,
+     * use the {@link spawn}, {@link exec},{@link execFile}, or {@link fork} methods to create
+     * instances of `ChildProcess`.
+     * @since v2.2.0
+     */
+    class ChildProcess extends EventEmitter {
+        /**
+         * A `Writable Stream` that represents the child process's `stdin`.
+         *
+         * If a child process waits to read all of its input, the child will not continue
+         * until this stream has been closed via `end()`.
+         *
+         * If the child was spawned with `stdio[0]` set to anything other than `'pipe'`,
+         * then this will be `null`.
+         *
+         * `subprocess.stdin` is an alias for `subprocess.stdio[0]`. Both properties will
+         * refer to the same value.
+         *
+         * The `subprocess.stdin` property can be `undefined` if the child process could
+         * not be successfully spawned.
+         * @since v0.1.90
+         */
+        stdin: Writable | null;
+        /**
+         * A `Readable Stream` that represents the child process's `stdout`.
+         *
+         * If the child was spawned with `stdio[1]` set to anything other than `'pipe'`,
+         * then this will be `null`.
+         *
+         * `subprocess.stdout` is an alias for `subprocess.stdio[1]`. Both properties will
+         * refer to the same value.
+         *
+         * ```js
+         * const { spawn } = require('child_process');
+         *
+         * const subprocess = spawn('ls');
+         *
+         * subprocess.stdout.on('data', (data) => {
+         *   console.log(`Received chunk ${data}`);
+         * });
+         * ```
+         *
+         * The `subprocess.stdout` property can be `null` if the child process could
+         * not be successfully spawned.
+         * @since v0.1.90
+         */
+        stdout: Readable | null;
+        /**
+         * A `Readable Stream` that represents the child process's `stderr`.
+         *
+         * If the child was spawned with `stdio[2]` set to anything other than `'pipe'`,
+         * then this will be `null`.
+         *
+         * `subprocess.stderr` is an alias for `subprocess.stdio[2]`. Both properties will
+         * refer to the same value.
+         *
+         * The `subprocess.stderr` property can be `null` if the child process could
+         * not be successfully spawned.
+         * @since v0.1.90
+         */
+        stderr: Readable | null;
+        /**
+         * The `subprocess.channel` property is a reference to the child's IPC channel. If
+         * no IPC channel currently exists, this property is `undefined`.
+         * @since v7.1.0
+         */
+        readonly channel?: Pipe | null | undefined;
+        /**
+         * A sparse array of pipes to the child process, corresponding with positions in
+         * the `stdio` option passed to {@link spawn} that have been set
+         * to the value `'pipe'`. `subprocess.stdio[0]`, `subprocess.stdio[1]`, and`subprocess.stdio[2]` are also available as `subprocess.stdin`,`subprocess.stdout`, and `subprocess.stderr`,
+         * respectively.
+         *
+         * In the following example, only the child's fd `1` (stdout) is configured as a
+         * pipe, so only the parent's `subprocess.stdio[1]` is a stream, all other values
+         * in the array are `null`.
+         *
+         * ```js
+         * const assert = require('assert');
+         * const fs = require('fs');
+         * const child_process = require('child_process');
+         *
+         * const subprocess = child_process.spawn('ls', {
+         *   stdio: [
+         *     0, // Use parent's stdin for child.
+         *     'pipe', // Pipe child's stdout to parent.
+         *     fs.openSync('err.out', 'w'), // Direct child's stderr to a file.
+         *   ]
+         * });
+         *
+         * assert.strictEqual(subprocess.stdio[0], null);
+         * assert.strictEqual(subprocess.stdio[0], subprocess.stdin);
+         *
+         * assert(subprocess.stdout);
+         * assert.strictEqual(subprocess.stdio[1], subprocess.stdout);
+         *
+         * assert.strictEqual(subprocess.stdio[2], null);
+         * assert.strictEqual(subprocess.stdio[2], subprocess.stderr);
+         * ```
+         *
+         * The `subprocess.stdio` property can be `undefined` if the child process could
+         * not be successfully spawned.
+         * @since v0.7.10
+         */
+        readonly stdio: [
+            Writable | null,
+            // stdin
+            Readable | null,
+            // stdout
+            Readable | null,
+            // stderr
+            Readable | Writable | null | undefined,
+            // extra
+            Readable | Writable | null | undefined // extra
+        ];
+        /**
+         * The `subprocess.killed` property indicates whether the child process
+         * successfully received a signal from `subprocess.kill()`. The `killed` property
+         * does not indicate that the child process has been terminated.
+         * @since v0.5.10
+         */
+        readonly killed: boolean;
+        /**
+         * Returns the process identifier (PID) of the child process. If the child process
+         * fails to spawn due to errors, then the value is `undefined` and `error` is
+         * emitted.
+         *
+         * ```js
+         * const { spawn } = require('child_process');
+         * const grep = spawn('grep', ['ssh']);
+         *
+         * console.log(`Spawned child pid: ${grep.pid}`);
+         * grep.stdin.end();
+         * ```
+         * @since v0.1.90
+         */
+        readonly pid?: number | undefined;
+        /**
+         * The `subprocess.connected` property indicates whether it is still possible to
+         * send and receive messages from a child process. When `subprocess.connected` is`false`, it is no longer possible to send or receive messages.
+         * @since v0.7.2
+         */
+        readonly connected: boolean;
+        /**
+         * The `subprocess.exitCode` property indicates the exit code of the child process.
+         * If the child process is still running, the field will be `null`.
+         */
+        readonly exitCode: number | null;
+        /**
+         * The `subprocess.signalCode` property indicates the signal received by
+         * the child process if any, else `null`.
+         */
+        readonly signalCode: NodeJS.Signals | null;
+        /**
+         * The `subprocess.spawnargs` property represents the full list of command-line
+         * arguments the child process was launched with.
+         */
+        readonly spawnargs: string[];
+        /**
+         * The `subprocess.spawnfile` property indicates the executable file name of
+         * the child process that is launched.
+         *
+         * For {@link fork}, its value will be equal to `process.execPath`.
+         * For {@link spawn}, its value will be the name of
+         * the executable file.
+         * For {@link exec},  its value will be the name of the shell
+         * in which the child process is launched.
+         */
+        readonly spawnfile: string;
+        /**
+         * The `subprocess.kill()` method sends a signal to the child process. If no
+         * argument is given, the process will be sent the `'SIGTERM'` signal. See [`signal(7)`](http://man7.org/linux/man-pages/man7/signal.7.html) for a list of available signals. This function
+         * returns `true` if [`kill(2)`](http://man7.org/linux/man-pages/man2/kill.2.html) succeeds, and `false` otherwise.
+         *
+         * ```js
+         * const { spawn } = require('child_process');
+         * const grep = spawn('grep', ['ssh']);
+         *
+         * grep.on('close', (code, signal) => {
+         *   console.log(
+         *     `child process terminated due to receipt of signal ${signal}`);
+         * });
+         *
+         * // Send SIGHUP to process.
+         * grep.kill('SIGHUP');
+         * ```
+         *
+         * The `ChildProcess` object may emit an `'error'` event if the signal
+         * cannot be delivered. Sending a signal to a child process that has already exited
+         * is not an error but may have unforeseen consequences. Specifically, if the
+         * process identifier (PID) has been reassigned to another process, the signal will
+         * be delivered to that process instead which can have unexpected results.
+         *
+         * While the function is called `kill`, the signal delivered to the child process
+         * may not actually terminate the process.
+         *
+         * See [`kill(2)`](http://man7.org/linux/man-pages/man2/kill.2.html) for reference.
+         *
+         * On Windows, where POSIX signals do not exist, the `signal` argument will be
+         * ignored, and the process will be killed forcefully and abruptly (similar to`'SIGKILL'`).
+         * See `Signal Events` for more details.
+         *
+         * On Linux, child processes of child processes will not be terminated
+         * when attempting to kill their parent. This is likely to happen when running a
+         * new process in a shell or with the use of the `shell` option of `ChildProcess`:
+         *
+         * ```js
+         * 'use strict';
+         * const { spawn } = require('child_process');
+         *
+         * const subprocess = spawn(
+         *   'sh',
+         *   [
+         *     '-c',
+         *     `node -e "setInterval(() => {
+         *       console.log(process.pid, 'is alive')
+         *     }, 500);"`,
+         *   ], {
+         *     stdio: ['inherit', 'inherit', 'inherit']
+         *   }
+         * );
+         *
+         * setTimeout(() => {
+         *   subprocess.kill(); // Does not terminate the Node.js process in the shell.
+         * }, 2000);
+         * ```
+         * @since v0.1.90
+         */
+        kill(signal?: NodeJS.Signals | number): boolean;
+        /**
+         * When an IPC channel has been established between the parent and child (
+         * i.e. when using {@link fork}), the `subprocess.send()` method can
+         * be used to send messages to the child process. When the child process is a
+         * Node.js instance, these messages can be received via the `'message'` event.
+         *
+         * The message goes through serialization and parsing. The resulting
+         * message might not be the same as what is originally sent.
+         *
+         * For example, in the parent script:
+         *
+         * ```js
+         * const cp = require('child_process');
+         * const n = cp.fork(`${__dirname}/sub.js`);
+         *
+         * n.on('message', (m) => {
+         *   console.log('PARENT got message:', m);
+         * });
+         *
+         * // Causes the child to print: CHILD got message: { hello: 'world' }
+         * n.send({ hello: 'world' });
+         * ```
+         *
+         * And then the child script, `'sub.js'` might look like this:
+         *
+         * ```js
+         * process.on('message', (m) => {
+         *   console.log('CHILD got message:', m);
+         * });
+         *
+         * // Causes the parent to print: PARENT got message: { foo: 'bar', baz: null }
+         * process.send({ foo: 'bar', baz: NaN });
+         * ```
+         *
+         * Child Node.js processes will have a `process.send()` method of their own
+         * that allows the child to send messages back to the parent.
+         *
+         * There is a special case when sending a `{cmd: 'NODE_foo'}` message. Messages
+         * containing a `NODE_` prefix in the `cmd` property are reserved for use within
+         * Node.js core and will not be emitted in the child's `'message'` event. Rather, such messages are emitted using the`'internalMessage'` event and are consumed internally by Node.js.
+         * Applications should avoid using such messages or listening for`'internalMessage'` events as it is subject to change without notice.
+         *
+         * The optional `sendHandle` argument that may be passed to `subprocess.send()` is
+         * for passing a TCP server or socket object to the child process. The child will
+         * receive the object as the second argument passed to the callback function
+         * registered on the `'message'` event. Any data that is received
+         * and buffered in the socket will not be sent to the child.
+         *
+         * The optional `callback` is a function that is invoked after the message is
+         * sent but before the child may have received it. The function is called with a
+         * single argument: `null` on success, or an `Error` object on failure.
+         *
+         * If no `callback` function is provided and the message cannot be sent, an`'error'` event will be emitted by the `ChildProcess` object. This can
+         * happen, for instance, when the child process has already exited.
+         *
+         * `subprocess.send()` will return `false` if the channel has closed or when the
+         * backlog of unsent messages exceeds a threshold that makes it unwise to send
+         * more. Otherwise, the method returns `true`. The `callback` function can be
+         * used to implement flow control.
+         *
+         * #### Example: sending a server object
+         *
+         * The `sendHandle` argument can be used, for instance, to pass the handle of
+         * a TCP server object to the child process as illustrated in the example below:
+         *
+         * ```js
+         * const subprocess = require('child_process').fork('subprocess.js');
+         *
+         * // Open up the server object and send the handle.
+         * const server = require('net').createServer();
+         * server.on('connection', (socket) => {
+         *   socket.end('handled by parent');
+         * });
+         * server.listen(1337, () => {
+         *   subprocess.send('server', server);
+         * });
+         * ```
+         *
+         * The child would then receive the server object as:
+         *
+         * ```js
+         * process.on('message', (m, server) => {
+         *   if (m === 'server') {
+         *     server.on('connection', (socket) => {
+         *       socket.end('handled by child');
+         *     });
+         *   }
+         * });
+         * ```
+         *
+         * Once the server is now shared between the parent and child, some connections
+         * can be handled by the parent and some by the child.
+         *
+         * While the example above uses a server created using the `net` module, `dgram`module servers use exactly the same workflow with the exceptions of listening on
+         * a `'message'` event instead of `'connection'` and using `server.bind()` instead
+         * of `server.listen()`. This is, however, currently only supported on Unix
+         * platforms.
+         *
+         * #### Example: sending a socket object
+         *
+         * Similarly, the `sendHandler` argument can be used to pass the handle of a
+         * socket to the child process. The example below spawns two children that each
+         * handle connections with "normal" or "special" priority:
+         *
+         * ```js
+         * const { fork } = require('child_process');
+         * const normal = fork('subprocess.js', ['normal']);
+         * const special = fork('subprocess.js', ['special']);
+         *
+         * // Open up the server and send sockets to child. Use pauseOnConnect to prevent
+         * // the sockets from being read before they are sent to the child process.
+         * const server = require('net').createServer({ pauseOnConnect: true });
+         * server.on('connection', (socket) => {
+         *
+         *   // If this is special priority...
+         *   if (socket.remoteAddress === '74.125.127.100') {
+         *     special.send('socket', socket);
+         *     return;
+         *   }
+         *   // This is normal priority.
+         *   normal.send('socket', socket);
+         * });
+         * server.listen(1337);
+         * ```
+         *
+         * The `subprocess.js` would receive the socket handle as the second argument
+         * passed to the event callback function:
+         *
+         * ```js
+         * process.on('message', (m, socket) => {
+         *   if (m === 'socket') {
+         *     if (socket) {
+         *       // Check that the client socket exists.
+         *       // It is possible for the socket to be closed between the time it is
+         *       // sent and the time it is received in the child process.
+         *       socket.end(`Request handled with ${process.argv[2]} priority`);
+         *     }
+         *   }
+         * });
+         * ```
+         *
+         * Do not use `.maxConnections` on a socket that has been passed to a subprocess.
+         * The parent cannot track when the socket is destroyed.
+         *
+         * Any `'message'` handlers in the subprocess should verify that `socket` exists,
+         * as the connection may have been closed during the time it takes to send the
+         * connection to the child.
+         * @since v0.5.9
+         * @param options The `options` argument, if present, is an object used to parameterize the sending of certain types of handles. `options` supports the following properties:
+         */
+        send(message: Serializable, callback?: (error: Error | null) => void): boolean;
+        send(message: Serializable, sendHandle?: SendHandle, callback?: (error: Error | null) => void): boolean;
+        send(message: Serializable, sendHandle?: SendHandle, options?: MessageOptions, callback?: (error: Error | null) => void): boolean;
+        /**
+         * Closes the IPC channel between parent and child, allowing the child to exit
+         * gracefully once there are no other connections keeping it alive. After calling
+         * this method the `subprocess.connected` and `process.connected` properties in
+         * both the parent and child (respectively) will be set to `false`, and it will be
+         * no longer possible to pass messages between the processes.
+         *
+         * The `'disconnect'` event will be emitted when there are no messages in the
+         * process of being received. This will most often be triggered immediately after
+         * calling `subprocess.disconnect()`.
+         *
+         * When the child process is a Node.js instance (e.g. spawned using {@link fork}), the `process.disconnect()` method can be invoked
+         * within the child process to close the IPC channel as well.
+         * @since v0.7.2
+         */
+        disconnect(): void;
+        /**
+         * By default, the parent will wait for the detached child to exit. To prevent the
+         * parent from waiting for a given `subprocess` to exit, use the`subprocess.unref()` method. Doing so will cause the parent's event loop to not
+         * include the child in its reference count, allowing the parent to exit
+         * independently of the child, unless there is an established IPC channel between
+         * the child and the parent.
+         *
+         * ```js
+         * const { spawn } = require('child_process');
+         *
+         * const subprocess = spawn(process.argv[0], ['child_program.js'], {
+         *   detached: true,
+         *   stdio: 'ignore'
+         * });
+         *
+         * subprocess.unref();
+         * ```
+         * @since v0.7.10
+         */
+        unref(): void;
+        /**
+         * Calling `subprocess.ref()` after making a call to `subprocess.unref()` will
+         * restore the removed reference count for the child process, forcing the parent
+         * to wait for the child to exit before exiting itself.
+         *
+         * ```js
+         * const { spawn } = require('child_process');
+         *
+         * const subprocess = spawn(process.argv[0], ['child_program.js'], {
+         *   detached: true,
+         *   stdio: 'ignore'
+         * });
+         *
+         * subprocess.unref();
+         * subprocess.ref();
+         * ```
+         * @since v0.7.10
+         */
+        ref(): void;
+        /**
+         * events.EventEmitter
+         * 1. close
+         * 2. disconnect
+         * 3. error
+         * 4. exit
+         * 5. message
+         * 6. spawn
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'close', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        addListener(event: 'disconnect', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'exit', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        addListener(event: 'message', listener: (message: Serializable, sendHandle: SendHandle) => void): this;
+        addListener(event: 'spawn', listener: () => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'close', code: number | null, signal: NodeJS.Signals | null): boolean;
+        emit(event: 'disconnect'): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'exit', code: number | null, signal: NodeJS.Signals | null): boolean;
+        emit(event: 'message', message: Serializable, sendHandle: SendHandle): boolean;
+        emit(event: 'spawn', listener: () => void): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        on(event: 'disconnect', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'exit', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        on(event: 'message', listener: (message: Serializable, sendHandle: SendHandle) => void): this;
+        on(event: 'spawn', listener: () => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        once(event: 'disconnect', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'exit', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        once(event: 'message', listener: (message: Serializable, sendHandle: SendHandle) => void): this;
+        once(event: 'spawn', listener: () => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        prependListener(event: 'disconnect', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'exit', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        prependListener(event: 'message', listener: (message: Serializable, sendHandle: SendHandle) => void): this;
+        prependListener(event: 'spawn', listener: () => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        prependOnceListener(event: 'disconnect', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'exit', listener: (code: number | null, signal: NodeJS.Signals | null) => void): this;
+        prependOnceListener(event: 'message', listener: (message: Serializable, sendHandle: SendHandle) => void): this;
+        prependOnceListener(event: 'spawn', listener: () => void): this;
+    }
+    // return this object when stdio option is undefined or not specified
+    interface ChildProcessWithoutNullStreams extends ChildProcess {
+        stdin: Writable;
+        stdout: Readable;
+        stderr: Readable;
+        readonly stdio: [
+            Writable,
+            Readable,
+            Readable,
+            // stderr
+            Readable | Writable | null | undefined,
+            // extra, no modification
+            Readable | Writable | null | undefined // extra, no modification
+        ];
+    }
+    // return this object when stdio option is a tuple of 3
+    interface ChildProcessByStdio<I extends null | Writable, O extends null | Readable, E extends null | Readable> extends ChildProcess {
+        stdin: I;
+        stdout: O;
+        stderr: E;
+        readonly stdio: [
+            I,
+            O,
+            E,
+            Readable | Writable | null | undefined,
+            // extra, no modification
+            Readable | Writable | null | undefined // extra, no modification
+        ];
+    }
+    interface MessageOptions {
+        keepOpen?: boolean | undefined;
+    }
+    type IOType = 'overlapped' | 'pipe' | 'ignore' | 'inherit';
+    type StdioOptions = IOType | Array<IOType | 'ipc' | Stream | number | null | undefined>;
+    type SerializationType = 'json' | 'advanced';
+    interface MessagingOptions extends Abortable {
+        /**
+         * Specify the kind of serialization used for sending messages between processes.
+         * @default 'json'
+         */
+        serialization?: SerializationType | undefined;
+        /**
+         * The signal value to be used when the spawned process will be killed by the abort signal.
+         * @default 'SIGTERM'
+         */
+        killSignal?: NodeJS.Signals | number | undefined;
+        /**
+         * In milliseconds the maximum amount of time the process is allowed to run.
+         */
+        timeout?: number | undefined;
+    }
+    interface ProcessEnvOptions {
+        uid?: number | undefined;
+        gid?: number | undefined;
+        cwd?: string | URL | undefined;
+        env?: NodeJS.ProcessEnv | undefined;
+    }
+    interface CommonOptions extends ProcessEnvOptions {
+        /**
+         * @default true
+         */
+        windowsHide?: boolean | undefined;
+        /**
+         * @default 0
+         */
+        timeout?: number | undefined;
+    }
+    interface CommonSpawnOptions extends CommonOptions, MessagingOptions, Abortable {
+        argv0?: string | undefined;
+        stdio?: StdioOptions | undefined;
+        shell?: boolean | string | undefined;
+        windowsVerbatimArguments?: boolean | undefined;
+    }
+    interface SpawnOptions extends CommonSpawnOptions {
+        detached?: boolean | undefined;
+    }
+    interface SpawnOptionsWithoutStdio extends SpawnOptions {
+        stdio?: StdioPipeNamed | StdioPipe[] | undefined;
+    }
+    type StdioNull = 'inherit' | 'ignore' | Stream;
+    type StdioPipeNamed = 'pipe' | 'overlapped';
+    type StdioPipe = undefined | null | StdioPipeNamed;
+    interface SpawnOptionsWithStdioTuple<Stdin extends StdioNull | StdioPipe, Stdout extends StdioNull | StdioPipe, Stderr extends StdioNull | StdioPipe> extends SpawnOptions {
+        stdio: [Stdin, Stdout, Stderr];
+    }
+    /**
+     * The `child_process.spawn()` method spawns a new process using the given`command`, with command-line arguments in `args`. If omitted, `args` defaults
+     * to an empty array.
+     *
+     * **If the `shell` option is enabled, do not pass unsanitized user input to this**
+     * **function. Any input containing shell metacharacters may be used to trigger**
+     * **arbitrary command execution.**
+     *
+     * A third argument may be used to specify additional options, with these defaults:
+     *
+     * ```js
+     * const defaults = {
+     *   cwd: undefined,
+     *   env: process.env
+     * };
+     * ```
+     *
+     * Use `cwd` to specify the working directory from which the process is spawned.
+     * If not given, the default is to inherit the current working directory. If given,
+     * but the path does not exist, the child process emits an `ENOENT` error
+     * and exits immediately. `ENOENT` is also emitted when the command
+     * does not exist.
+     *
+     * Use `env` to specify environment variables that will be visible to the new
+     * process, the default is `process.env`.
+     *
+     * `undefined` values in `env` will be ignored.
+     *
+     * Example of running `ls -lh /usr`, capturing `stdout`, `stderr`, and the
+     * exit code:
+     *
+     * ```js
+     * const { spawn } = require('child_process');
+     * const ls = spawn('ls', ['-lh', '/usr']);
+     *
+     * ls.stdout.on('data', (data) => {
+     *   console.log(`stdout: ${data}`);
+     * });
+     *
+     * ls.stderr.on('data', (data) => {
+     *   console.error(`stderr: ${data}`);
+     * });
+     *
+     * ls.on('close', (code) => {
+     *   console.log(`child process exited with code ${code}`);
+     * });
+     * ```
+     *
+     * Example: A very elaborate way to run `ps ax | grep ssh`
+     *
+     * ```js
+     * const { spawn } = require('child_process');
+     * const ps = spawn('ps', ['ax']);
+     * const grep = spawn('grep', ['ssh']);
+     *
+     * ps.stdout.on('data', (data) => {
+     *   grep.stdin.write(data);
+     * });
+     *
+     * ps.stderr.on('data', (data) => {
+     *   console.error(`ps stderr: ${data}`);
+     * });
+     *
+     * ps.on('close', (code) => {
+     *   if (code !== 0) {
+     *     console.log(`ps process exited with code ${code}`);
+     *   }
+     *   grep.stdin.end();
+     * });
+     *
+     * grep.stdout.on('data', (data) => {
+     *   console.log(data.toString());
+     * });
+     *
+     * grep.stderr.on('data', (data) => {
+     *   console.error(`grep stderr: ${data}`);
+     * });
+     *
+     * grep.on('close', (code) => {
+     *   if (code !== 0) {
+     *     console.log(`grep process exited with code ${code}`);
+     *   }
+     * });
+     * ```
+     *
+     * Example of checking for failed `spawn`:
+     *
+     * ```js
+     * const { spawn } = require('child_process');
+     * const subprocess = spawn('bad_command');
+     *
+     * subprocess.on('error', (err) => {
+     *   console.error('Failed to start subprocess.');
+     * });
+     * ```
+     *
+     * Certain platforms (macOS, Linux) will use the value of `argv[0]` for the process
+     * title while others (Windows, SunOS) will use `command`.
+     *
+     * Node.js currently overwrites `argv[0]` with `process.execPath` on startup, so`process.argv[0]` in a Node.js child process will not match the `argv0`parameter passed to `spawn` from the parent,
+     * retrieve it with the`process.argv0` property instead.
+     *
+     * If the `signal` option is enabled, calling `.abort()` on the corresponding`AbortController` is similar to calling `.kill()` on the child process except
+     * the error passed to the callback will be an `AbortError`:
+     *
+     * ```js
+     * const { spawn } = require('child_process');
+     * const controller = new AbortController();
+     * const { signal } = controller;
+     * const grep = spawn('grep', ['ssh'], { signal });
+     * grep.on('error', (err) => {
+     *   // This will be called with err being an AbortError if the controller aborts
+     * });
+     * controller.abort(); // Stops the child process
+     * ```
+     * @since v0.1.90
+     * @param command The command to run.
+     * @param args List of string arguments.
+     */
+    function spawn(command: string, options?: SpawnOptionsWithoutStdio): ChildProcessWithoutNullStreams;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioPipe, StdioPipe>): ChildProcessByStdio<Writable, Readable, Readable>;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioPipe, StdioNull>): ChildProcessByStdio<Writable, Readable, null>;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioNull, StdioPipe>): ChildProcessByStdio<Writable, null, Readable>;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioNull, StdioPipe, StdioPipe>): ChildProcessByStdio<null, Readable, Readable>;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioNull, StdioNull>): ChildProcessByStdio<Writable, null, null>;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioNull, StdioPipe, StdioNull>): ChildProcessByStdio<null, Readable, null>;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioNull, StdioNull, StdioPipe>): ChildProcessByStdio<null, null, Readable>;
+    function spawn(command: string, options: SpawnOptionsWithStdioTuple<StdioNull, StdioNull, StdioNull>): ChildProcessByStdio<null, null, null>;
+    function spawn(command: string, options: SpawnOptions): ChildProcess;
+    // overloads of spawn with 'args'
+    function spawn(command: string, args?: ReadonlyArray<string>, options?: SpawnOptionsWithoutStdio): ChildProcessWithoutNullStreams;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioPipe, StdioPipe>): ChildProcessByStdio<Writable, Readable, Readable>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioPipe, StdioNull>): ChildProcessByStdio<Writable, Readable, null>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioNull, StdioPipe>): ChildProcessByStdio<Writable, null, Readable>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioNull, StdioPipe, StdioPipe>): ChildProcessByStdio<null, Readable, Readable>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioPipe, StdioNull, StdioNull>): ChildProcessByStdio<Writable, null, null>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioNull, StdioPipe, StdioNull>): ChildProcessByStdio<null, Readable, null>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioNull, StdioNull, StdioPipe>): ChildProcessByStdio<null, null, Readable>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptionsWithStdioTuple<StdioNull, StdioNull, StdioNull>): ChildProcessByStdio<null, null, null>;
+    function spawn(command: string, args: ReadonlyArray<string>, options: SpawnOptions): ChildProcess;
+    interface ExecOptions extends CommonOptions {
+        shell?: string | undefined;
+        signal?: AbortSignal | undefined;
+        maxBuffer?: number | undefined;
+        killSignal?: NodeJS.Signals | number | undefined;
+    }
+    interface ExecOptionsWithStringEncoding extends ExecOptions {
+        encoding: BufferEncoding;
+    }
+    interface ExecOptionsWithBufferEncoding extends ExecOptions {
+        encoding: BufferEncoding | null; // specify `null`.
+    }
+    interface ExecException extends Error {
+        cmd?: string | undefined;
+        killed?: boolean | undefined;
+        code?: number | undefined;
+        signal?: NodeJS.Signals | undefined;
+    }
+    /**
+     * Spawns a shell then executes the `command` within that shell, buffering any
+     * generated output. The `command` string passed to the exec function is processed
+     * directly by the shell and special characters (vary based on [shell](https://en.wikipedia.org/wiki/List_of_command-line_interpreters))
+     * need to be dealt with accordingly:
+     *
+     * ```js
+     * const { exec } = require('child_process');
+     *
+     * exec('"/path/to/test file/test.sh" arg1 arg2');
+     * // Double quotes are used so that the space in the path is not interpreted as
+     * // a delimiter of multiple arguments.
+     *
+     * exec('echo "The \\$HOME variable is $HOME"');
+     * // The $HOME variable is escaped in the first instance, but not in the second.
+     * ```
+     *
+     * **Never pass unsanitized user input to this function. Any input containing shell**
+     * **metacharacters may be used to trigger arbitrary command execution.**
+     *
+     * If a `callback` function is provided, it is called with the arguments`(error, stdout, stderr)`. On success, `error` will be `null`. On error,`error` will be an instance of `Error`. The
+     * `error.code` property will be
+     * the exit code of the process. By convention, any exit code other than `0`indicates an error. `error.signal` will be the signal that terminated the
+     * process.
+     *
+     * The `stdout` and `stderr` arguments passed to the callback will contain the
+     * stdout and stderr output of the child process. By default, Node.js will decode
+     * the output as UTF-8 and pass strings to the callback. The `encoding` option
+     * can be used to specify the character encoding used to decode the stdout and
+     * stderr output. If `encoding` is `'buffer'`, or an unrecognized character
+     * encoding, `Buffer` objects will be passed to the callback instead.
+     *
+     * ```js
+     * const { exec } = require('child_process');
+     * exec('cat *.js missing_file | wc -l', (error, stdout, stderr) => {
+     *   if (error) {
+     *     console.error(`exec error: ${error}`);
+     *     return;
+     *   }
+     *   console.log(`stdout: ${stdout}`);
+     *   console.error(`stderr: ${stderr}`);
+     * });
+     * ```
+     *
+     * If `timeout` is greater than `0`, the parent will send the signal
+     * identified by the `killSignal` property (the default is `'SIGTERM'`) if the
+     * child runs longer than `timeout` milliseconds.
+     *
+     * Unlike the [`exec(3)`](http://man7.org/linux/man-pages/man3/exec.3.html) POSIX system call, `child_process.exec()` does not replace
+     * the existing process and uses a shell to execute the command.
+     *
+     * If this method is invoked as its `util.promisify()` ed version, it returns
+     * a `Promise` for an `Object` with `stdout` and `stderr` properties. The returned`ChildProcess` instance is attached to the `Promise` as a `child` property. In
+     * case of an error (including any error resulting in an exit code other than 0), a
+     * rejected promise is returned, with the same `error` object given in the
+     * callback, but with two additional properties `stdout` and `stderr`.
+     *
+     * ```js
+     * const util = require('util');
+     * const exec = util.promisify(require('child_process').exec);
+     *
+     * async function lsExample() {
+     *   const { stdout, stderr } = await exec('ls');
+     *   console.log('stdout:', stdout);
+     *   console.error('stderr:', stderr);
+     * }
+     * lsExample();
+     * ```
+     *
+     * If the `signal` option is enabled, calling `.abort()` on the corresponding`AbortController` is similar to calling `.kill()` on the child process except
+     * the error passed to the callback will be an `AbortError`:
+     *
+     * ```js
+     * const { exec } = require('child_process');
+     * const controller = new AbortController();
+     * const { signal } = controller;
+     * const child = exec('grep ssh', { signal }, (error) => {
+     *   console.log(error); // an AbortError
+     * });
+     * controller.abort();
+     * ```
+     * @since v0.1.90
+     * @param command The command to run, with space-separated arguments.
+     * @param callback called with the output when process terminates.
+     */
+    function exec(command: string, callback?: (error: ExecException | null, stdout: string, stderr: string) => void): ChildProcess;
+    // `options` with `"buffer"` or `null` for `encoding` means stdout/stderr are definitely `Buffer`.
+    function exec(
+        command: string,
+        options: {
+            encoding: 'buffer' | null;
+        } & ExecOptions,
+        callback?: (error: ExecException | null, stdout: Buffer, stderr: Buffer) => void
+    ): ChildProcess;
+    // `options` with well known `encoding` means stdout/stderr are definitely `string`.
+    function exec(
+        command: string,
+        options: {
+            encoding: BufferEncoding;
+        } & ExecOptions,
+        callback?: (error: ExecException | null, stdout: string, stderr: string) => void
+    ): ChildProcess;
+    // `options` with an `encoding` whose type is `string` means stdout/stderr could either be `Buffer` or `string`.
+    // There is no guarantee the `encoding` is unknown as `string` is a superset of `BufferEncoding`.
+    function exec(
+        command: string,
+        options: {
+            encoding: BufferEncoding;
+        } & ExecOptions,
+        callback?: (error: ExecException | null, stdout: string | Buffer, stderr: string | Buffer) => void
+    ): ChildProcess;
+    // `options` without an `encoding` means stdout/stderr are definitely `string`.
+    function exec(command: string, options: ExecOptions, callback?: (error: ExecException | null, stdout: string, stderr: string) => void): ChildProcess;
+    // fallback if nothing else matches. Worst case is always `string | Buffer`.
+    function exec(
+        command: string,
+        options: (ObjectEncodingOptions & ExecOptions) | undefined | null,
+        callback?: (error: ExecException | null, stdout: string | Buffer, stderr: string | Buffer) => void
+    ): ChildProcess;
+    interface PromiseWithChild<T> extends Promise<T> {
+        child: ChildProcess;
+    }
+    namespace exec {
+        function __promisify__(command: string): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            command: string,
+            options: {
+                encoding: 'buffer' | null;
+            } & ExecOptions
+        ): PromiseWithChild<{
+            stdout: Buffer;
+            stderr: Buffer;
+        }>;
+        function __promisify__(
+            command: string,
+            options: {
+                encoding: BufferEncoding;
+            } & ExecOptions
+        ): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            command: string,
+            options: ExecOptions
+        ): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            command: string,
+            options?: (ObjectEncodingOptions & ExecOptions) | null
+        ): PromiseWithChild<{
+            stdout: string | Buffer;
+            stderr: string | Buffer;
+        }>;
+    }
+    interface ExecFileOptions extends CommonOptions, Abortable {
+        maxBuffer?: number | undefined;
+        killSignal?: NodeJS.Signals | number | undefined;
+        windowsVerbatimArguments?: boolean | undefined;
+        shell?: boolean | string | undefined;
+        signal?: AbortSignal | undefined;
+    }
+    interface ExecFileOptionsWithStringEncoding extends ExecFileOptions {
+        encoding: BufferEncoding;
+    }
+    interface ExecFileOptionsWithBufferEncoding extends ExecFileOptions {
+        encoding: 'buffer' | null;
+    }
+    interface ExecFileOptionsWithOtherEncoding extends ExecFileOptions {
+        encoding: BufferEncoding;
+    }
+    type ExecFileException = ExecException & NodeJS.ErrnoException;
+    /**
+     * The `child_process.execFile()` function is similar to {@link exec} except that it does not spawn a shell by default. Rather, the specified
+     * executable `file` is spawned directly as a new process making it slightly more
+     * efficient than {@link exec}.
+     *
+     * The same options as {@link exec} are supported. Since a shell is
+     * not spawned, behaviors such as I/O redirection and file globbing are not
+     * supported.
+     *
+     * ```js
+     * const { execFile } = require('child_process');
+     * const child = execFile('node', ['--version'], (error, stdout, stderr) => {
+     *   if (error) {
+     *     throw error;
+     *   }
+     *   console.log(stdout);
+     * });
+     * ```
+     *
+     * The `stdout` and `stderr` arguments passed to the callback will contain the
+     * stdout and stderr output of the child process. By default, Node.js will decode
+     * the output as UTF-8 and pass strings to the callback. The `encoding` option
+     * can be used to specify the character encoding used to decode the stdout and
+     * stderr output. If `encoding` is `'buffer'`, or an unrecognized character
+     * encoding, `Buffer` objects will be passed to the callback instead.
+     *
+     * If this method is invoked as its `util.promisify()` ed version, it returns
+     * a `Promise` for an `Object` with `stdout` and `stderr` properties. The returned`ChildProcess` instance is attached to the `Promise` as a `child` property. In
+     * case of an error (including any error resulting in an exit code other than 0), a
+     * rejected promise is returned, with the same `error` object given in the
+     * callback, but with two additional properties `stdout` and `stderr`.
+     *
+     * ```js
+     * const util = require('util');
+     * const execFile = util.promisify(require('child_process').execFile);
+     * async function getVersion() {
+     *   const { stdout } = await execFile('node', ['--version']);
+     *   console.log(stdout);
+     * }
+     * getVersion();
+     * ```
+     *
+     * **If the `shell` option is enabled, do not pass unsanitized user input to this**
+     * **function. Any input containing shell metacharacters may be used to trigger**
+     * **arbitrary command execution.**
+     *
+     * If the `signal` option is enabled, calling `.abort()` on the corresponding`AbortController` is similar to calling `.kill()` on the child process except
+     * the error passed to the callback will be an `AbortError`:
+     *
+     * ```js
+     * const { execFile } = require('child_process');
+     * const controller = new AbortController();
+     * const { signal } = controller;
+     * const child = execFile('node', ['--version'], { signal }, (error) => {
+     *   console.log(error); // an AbortError
+     * });
+     * controller.abort();
+     * ```
+     * @since v0.1.91
+     * @param file The name or path of the executable file to run.
+     * @param args List of string arguments.
+     * @param callback Called with the output when process terminates.
+     */
+    function execFile(file: string): ChildProcess;
+    function execFile(file: string, options: (ObjectEncodingOptions & ExecFileOptions) | undefined | null): ChildProcess;
+    function execFile(file: string, args?: ReadonlyArray<string> | null): ChildProcess;
+    function execFile(file: string, args: ReadonlyArray<string> | undefined | null, options: (ObjectEncodingOptions & ExecFileOptions) | undefined | null): ChildProcess;
+    // no `options` definitely means stdout/stderr are `string`.
+    function execFile(file: string, callback: (error: ExecFileException | null, stdout: string, stderr: string) => void): ChildProcess;
+    function execFile(file: string, args: ReadonlyArray<string> | undefined | null, callback: (error: ExecFileException | null, stdout: string, stderr: string) => void): ChildProcess;
+    // `options` with `"buffer"` or `null` for `encoding` means stdout/stderr are definitely `Buffer`.
+    function execFile(file: string, options: ExecFileOptionsWithBufferEncoding, callback: (error: ExecFileException | null, stdout: Buffer, stderr: Buffer) => void): ChildProcess;
+    function execFile(
+        file: string,
+        args: ReadonlyArray<string> | undefined | null,
+        options: ExecFileOptionsWithBufferEncoding,
+        callback: (error: ExecFileException | null, stdout: Buffer, stderr: Buffer) => void
+    ): ChildProcess;
+    // `options` with well known `encoding` means stdout/stderr are definitely `string`.
+    function execFile(file: string, options: ExecFileOptionsWithStringEncoding, callback: (error: ExecFileException | null, stdout: string, stderr: string) => void): ChildProcess;
+    function execFile(
+        file: string,
+        args: ReadonlyArray<string> | undefined | null,
+        options: ExecFileOptionsWithStringEncoding,
+        callback: (error: ExecFileException | null, stdout: string, stderr: string) => void
+    ): ChildProcess;
+    // `options` with an `encoding` whose type is `string` means stdout/stderr could either be `Buffer` or `string`.
+    // There is no guarantee the `encoding` is unknown as `string` is a superset of `BufferEncoding`.
+    function execFile(file: string, options: ExecFileOptionsWithOtherEncoding, callback: (error: ExecFileException | null, stdout: string | Buffer, stderr: string | Buffer) => void): ChildProcess;
+    function execFile(
+        file: string,
+        args: ReadonlyArray<string> | undefined | null,
+        options: ExecFileOptionsWithOtherEncoding,
+        callback: (error: ExecFileException | null, stdout: string | Buffer, stderr: string | Buffer) => void
+    ): ChildProcess;
+    // `options` without an `encoding` means stdout/stderr are definitely `string`.
+    function execFile(file: string, options: ExecFileOptions, callback: (error: ExecFileException | null, stdout: string, stderr: string) => void): ChildProcess;
+    function execFile(
+        file: string,
+        args: ReadonlyArray<string> | undefined | null,
+        options: ExecFileOptions,
+        callback: (error: ExecFileException | null, stdout: string, stderr: string) => void
+    ): ChildProcess;
+    // fallback if nothing else matches. Worst case is always `string | Buffer`.
+    function execFile(
+        file: string,
+        options: (ObjectEncodingOptions & ExecFileOptions) | undefined | null,
+        callback: ((error: ExecFileException | null, stdout: string | Buffer, stderr: string | Buffer) => void) | undefined | null
+    ): ChildProcess;
+    function execFile(
+        file: string,
+        args: ReadonlyArray<string> | undefined | null,
+        options: (ObjectEncodingOptions & ExecFileOptions) | undefined | null,
+        callback: ((error: ExecFileException | null, stdout: string | Buffer, stderr: string | Buffer) => void) | undefined | null
+    ): ChildProcess;
+    namespace execFile {
+        function __promisify__(file: string): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            file: string,
+            args: ReadonlyArray<string> | undefined | null
+        ): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            file: string,
+            options: ExecFileOptionsWithBufferEncoding
+        ): PromiseWithChild<{
+            stdout: Buffer;
+            stderr: Buffer;
+        }>;
+        function __promisify__(
+            file: string,
+            args: ReadonlyArray<string> | undefined | null,
+            options: ExecFileOptionsWithBufferEncoding
+        ): PromiseWithChild<{
+            stdout: Buffer;
+            stderr: Buffer;
+        }>;
+        function __promisify__(
+            file: string,
+            options: ExecFileOptionsWithStringEncoding
+        ): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            file: string,
+            args: ReadonlyArray<string> | undefined | null,
+            options: ExecFileOptionsWithStringEncoding
+        ): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            file: string,
+            options: ExecFileOptionsWithOtherEncoding
+        ): PromiseWithChild<{
+            stdout: string | Buffer;
+            stderr: string | Buffer;
+        }>;
+        function __promisify__(
+            file: string,
+            args: ReadonlyArray<string> | undefined | null,
+            options: ExecFileOptionsWithOtherEncoding
+        ): PromiseWithChild<{
+            stdout: string | Buffer;
+            stderr: string | Buffer;
+        }>;
+        function __promisify__(
+            file: string,
+            options: ExecFileOptions
+        ): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            file: string,
+            args: ReadonlyArray<string> | undefined | null,
+            options: ExecFileOptions
+        ): PromiseWithChild<{
+            stdout: string;
+            stderr: string;
+        }>;
+        function __promisify__(
+            file: string,
+            options: (ObjectEncodingOptions & ExecFileOptions) | undefined | null
+        ): PromiseWithChild<{
+            stdout: string | Buffer;
+            stderr: string | Buffer;
+        }>;
+        function __promisify__(
+            file: string,
+            args: ReadonlyArray<string> | undefined | null,
+            options: (ObjectEncodingOptions & ExecFileOptions) | undefined | null
+        ): PromiseWithChild<{
+            stdout: string | Buffer;
+            stderr: string | Buffer;
+        }>;
+    }
+    interface ForkOptions extends ProcessEnvOptions, MessagingOptions, Abortable {
+        execPath?: string | undefined;
+        execArgv?: string[] | undefined;
+        silent?: boolean | undefined;
+        stdio?: StdioOptions | undefined;
+        detached?: boolean | undefined;
+        windowsVerbatimArguments?: boolean | undefined;
+    }
+    /**
+     * The `child_process.fork()` method is a special case of {@link spawn} used specifically to spawn new Node.js processes.
+     * Like {@link spawn}, a `ChildProcess` object is returned. The
+     * returned `ChildProcess` will have an additional communication channel
+     * built-in that allows messages to be passed back and forth between the parent and
+     * child. See `subprocess.send()` for details.
+     *
+     * Keep in mind that spawned Node.js child processes are
+     * independent of the parent with exception of the IPC communication channel
+     * that is established between the two. Each process has its own memory, with
+     * their own V8 instances. Because of the additional resource allocations
+     * required, spawning a large number of child Node.js processes is not
+     * recommended.
+     *
+     * By default, `child_process.fork()` will spawn new Node.js instances using the `process.execPath` of the parent process. The `execPath` property in the`options` object allows for an alternative
+     * execution path to be used.
+     *
+     * Node.js processes launched with a custom `execPath` will communicate with the
+     * parent process using the file descriptor (fd) identified using the
+     * environment variable `NODE_CHANNEL_FD` on the child process.
+     *
+     * Unlike the [`fork(2)`](http://man7.org/linux/man-pages/man2/fork.2.html) POSIX system call, `child_process.fork()` does not clone the
+     * current process.
+     *
+     * The `shell` option available in {@link spawn} is not supported by`child_process.fork()` and will be ignored if set.
+     *
+     * If the `signal` option is enabled, calling `.abort()` on the corresponding`AbortController` is similar to calling `.kill()` on the child process except
+     * the error passed to the callback will be an `AbortError`:
+     *
+     * ```js
+     * if (process.argv[2] === 'child') {
+     *   setTimeout(() => {
+     *     console.log(`Hello from ${process.argv[2]}!`);
+     *   }, 1_000);
+     * } else {
+     *   const { fork } = require('child_process');
+     *   const controller = new AbortController();
+     *   const { signal } = controller;
+     *   const child = fork(__filename, ['child'], { signal });
+     *   child.on('error', (err) => {
+     *     // This will be called with err being an AbortError if the controller aborts
+     *   });
+     *   controller.abort(); // Stops the child process
+     * }
+     * ```
+     * @since v0.5.0
+     * @param modulePath The module to run in the child.
+     * @param args List of string arguments.
+     */
+    function fork(modulePath: string, options?: ForkOptions): ChildProcess;
+    function fork(modulePath: string, args?: ReadonlyArray<string>, options?: ForkOptions): ChildProcess;
+    interface SpawnSyncOptions extends CommonSpawnOptions {
+        input?: string | NodeJS.ArrayBufferView | undefined;
+        maxBuffer?: number | undefined;
+        encoding?: BufferEncoding | 'buffer' | null | undefined;
+    }
+    interface SpawnSyncOptionsWithStringEncoding extends SpawnSyncOptions {
+        encoding: BufferEncoding;
+    }
+    interface SpawnSyncOptionsWithBufferEncoding extends SpawnSyncOptions {
+        encoding?: 'buffer' | null | undefined;
+    }
+    interface SpawnSyncReturns<T> {
+        pid: number;
+        output: Array<T | null>;
+        stdout: T;
+        stderr: T;
+        status: number | null;
+        signal: NodeJS.Signals | null;
+        error?: Error | undefined;
+    }
+    /**
+     * The `child_process.spawnSync()` method is generally identical to {@link spawn} with the exception that the function will not return
+     * until the child process has fully closed. When a timeout has been encountered
+     * and `killSignal` is sent, the method won't return until the process has
+     * completely exited. If the process intercepts and handles the `SIGTERM` signal
+     * and doesn't exit, the parent process will wait until the child process has
+     * exited.
+     *
+     * **If the `shell` option is enabled, do not pass unsanitized user input to this**
+     * **function. Any input containing shell metacharacters may be used to trigger**
+     * **arbitrary command execution.**
+     * @since v0.11.12
+     * @param command The command to run.
+     * @param args List of string arguments.
+     */
+    function spawnSync(command: string): SpawnSyncReturns<Buffer>;
+    function spawnSync(command: string, options: SpawnSyncOptionsWithStringEncoding): SpawnSyncReturns<string>;
+    function spawnSync(command: string, options: SpawnSyncOptionsWithBufferEncoding): SpawnSyncReturns<Buffer>;
+    function spawnSync(command: string, options?: SpawnSyncOptions): SpawnSyncReturns<string | Buffer>;
+    function spawnSync(command: string, args: ReadonlyArray<string>): SpawnSyncReturns<Buffer>;
+    function spawnSync(command: string, args: ReadonlyArray<string>, options: SpawnSyncOptionsWithStringEncoding): SpawnSyncReturns<string>;
+    function spawnSync(command: string, args: ReadonlyArray<string>, options: SpawnSyncOptionsWithBufferEncoding): SpawnSyncReturns<Buffer>;
+    function spawnSync(command: string, args?: ReadonlyArray<string>, options?: SpawnSyncOptions): SpawnSyncReturns<string | Buffer>;
+    interface CommonExecOptions extends CommonOptions {
+        input?: string | NodeJS.ArrayBufferView | undefined;
+        stdio?: StdioOptions | undefined;
+        killSignal?: NodeJS.Signals | number | undefined;
+        maxBuffer?: number | undefined;
+        encoding?: BufferEncoding | 'buffer' | null | undefined;
+    }
+    interface ExecSyncOptions extends CommonExecOptions {
+        shell?: string | undefined;
+    }
+    interface ExecSyncOptionsWithStringEncoding extends ExecSyncOptions {
+        encoding: BufferEncoding;
+    }
+    interface ExecSyncOptionsWithBufferEncoding extends ExecSyncOptions {
+        encoding?: 'buffer' | null | undefined;
+    }
+    /**
+     * The `child_process.execSync()` method is generally identical to {@link exec} with the exception that the method will not return
+     * until the child process has fully closed. When a timeout has been encountered
+     * and `killSignal` is sent, the method won't return until the process has
+     * completely exited. If the child process intercepts and handles the `SIGTERM`signal and doesn't exit, the parent process will wait until the child process
+     * has exited.
+     *
+     * If the process times out or has a non-zero exit code, this method will throw.
+     * The `Error` object will contain the entire result from {@link spawnSync}.
+     *
+     * **Never pass unsanitized user input to this function. Any input containing shell**
+     * **metacharacters may be used to trigger arbitrary command execution.**
+     * @since v0.11.12
+     * @param command The command to run.
+     * @return The stdout from the command.
+     */
+    function execSync(command: string): Buffer;
+    function execSync(command: string, options: ExecSyncOptionsWithStringEncoding): string;
+    function execSync(command: string, options: ExecSyncOptionsWithBufferEncoding): Buffer;
+    function execSync(command: string, options?: ExecSyncOptions): string | Buffer;
+    interface ExecFileSyncOptions extends CommonExecOptions {
+        shell?: boolean | string | undefined;
+    }
+    interface ExecFileSyncOptionsWithStringEncoding extends ExecFileSyncOptions {
+        encoding: BufferEncoding;
+    }
+    interface ExecFileSyncOptionsWithBufferEncoding extends ExecFileSyncOptions {
+        encoding?: 'buffer' | null; // specify `null`.
+    }
+    /**
+     * The `child_process.execFileSync()` method is generally identical to {@link execFile} with the exception that the method will not
+     * return until the child process has fully closed. When a timeout has been
+     * encountered and `killSignal` is sent, the method won't return until the process
+     * has completely exited.
+     *
+     * If the child process intercepts and handles the `SIGTERM` signal and
+     * does not exit, the parent process will still wait until the child process has
+     * exited.
+     *
+     * If the process times out or has a non-zero exit code, this method will throw an `Error` that will include the full result of the underlying {@link spawnSync}.
+     *
+     * **If the `shell` option is enabled, do not pass unsanitized user input to this**
+     * **function. Any input containing shell metacharacters may be used to trigger**
+     * **arbitrary command execution.**
+     * @since v0.11.12
+     * @param file The name or path of the executable file to run.
+     * @param args List of string arguments.
+     * @return The stdout from the command.
+     */
+    function execFileSync(file: string): Buffer;
+    function execFileSync(file: string, options: ExecFileSyncOptionsWithStringEncoding): string;
+    function execFileSync(file: string, options: ExecFileSyncOptionsWithBufferEncoding): Buffer;
+    function execFileSync(file: string, options?: ExecFileSyncOptions): string | Buffer;
+    function execFileSync(file: string, args: ReadonlyArray<string>): Buffer;
+    function execFileSync(file: string, args: ReadonlyArray<string>, options: ExecFileSyncOptionsWithStringEncoding): string;
+    function execFileSync(file: string, args: ReadonlyArray<string>, options: ExecFileSyncOptionsWithBufferEncoding): Buffer;
+    function execFileSync(file: string, args?: ReadonlyArray<string>, options?: ExecFileSyncOptions): string | Buffer;
+}
+declare module 'node:child_process' {
+    export * from 'child_process';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/cluster.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/cluster.d.ts
new file mode 100644
index 0000000..c48084d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/cluster.d.ts
@@ -0,0 +1,414 @@
+/**
+ * A single instance of Node.js runs in a single thread. To take advantage of
+ * multi-core systems, the user will sometimes want to launch a cluster of Node.js
+ * processes to handle the load.
+ *
+ * The cluster module allows easy creation of child processes that all share
+ * server ports.
+ *
+ * ```js
+ * import cluster from 'cluster';
+ * import http from 'http';
+ * import { cpus } from 'os';
+ * import process from 'process';
+ *
+ * const numCPUs = cpus().length;
+ *
+ * if (cluster.isPrimary) {
+ *   console.log(`Primary ${process.pid} is running`);
+ *
+ *   // Fork workers.
+ *   for (let i = 0; i < numCPUs; i++) {
+ *     cluster.fork();
+ *   }
+ *
+ *   cluster.on('exit', (worker, code, signal) => {
+ *     console.log(`worker ${worker.process.pid} died`);
+ *   });
+ * } else {
+ *   // Workers can share any TCP connection
+ *   // In this case it is an HTTP server
+ *   http.createServer((req, res) => {
+ *     res.writeHead(200);
+ *     res.end('hello world\n');
+ *   }).listen(8000);
+ *
+ *   console.log(`Worker ${process.pid} started`);
+ * }
+ * ```
+ *
+ * Running Node.js will now share port 8000 between the workers:
+ *
+ * ```console
+ * $ node server.js
+ * Primary 3596 is running
+ * Worker 4324 started
+ * Worker 4520 started
+ * Worker 6056 started
+ * Worker 5644 started
+ * ```
+ *
+ * On Windows, it is not yet possible to set up a named pipe server in a worker.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/cluster.js)
+ */
+declare module 'cluster' {
+    import * as child from 'node:child_process';
+    import EventEmitter = require('node:events');
+    import * as net from 'node:net';
+    export interface ClusterSettings {
+        execArgv?: string[] | undefined; // default: process.execArgv
+        exec?: string | undefined;
+        args?: string[] | undefined;
+        silent?: boolean | undefined;
+        stdio?: any[] | undefined;
+        uid?: number | undefined;
+        gid?: number | undefined;
+        inspectPort?: number | (() => number) | undefined;
+    }
+    export interface Address {
+        address: string;
+        port: number;
+        addressType: number | 'udp4' | 'udp6'; // 4, 6, -1, "udp4", "udp6"
+    }
+    /**
+     * A `Worker` object contains all public information and method about a worker.
+     * In the primary it can be obtained using `cluster.workers`. In a worker
+     * it can be obtained using `cluster.worker`.
+     * @since v0.7.0
+     */
+    export class Worker extends EventEmitter {
+        /**
+         * Each new worker is given its own unique id, this id is stored in the`id`.
+         *
+         * While a worker is alive, this is the key that indexes it in`cluster.workers`.
+         * @since v0.8.0
+         */
+        id: number;
+        /**
+         * All workers are created using `child_process.fork()`, the returned object
+         * from this function is stored as `.process`. In a worker, the global `process`is stored.
+         *
+         * See: `Child Process module`.
+         *
+         * Workers will call `process.exit(0)` if the `'disconnect'` event occurs
+         * on `process` and `.exitedAfterDisconnect` is not `true`. This protects against
+         * accidental disconnection.
+         * @since v0.7.0
+         */
+        process: child.ChildProcess;
+        /**
+         * Send a message to a worker or primary, optionally with a handle.
+         *
+         * In the primary this sends a message to a specific worker. It is identical to `ChildProcess.send()`.
+         *
+         * In a worker this sends a message to the primary. It is identical to`process.send()`.
+         *
+         * This example will echo back all messages from the primary:
+         *
+         * ```js
+         * if (cluster.isPrimary) {
+         *   const worker = cluster.fork();
+         *   worker.send('hi there');
+         *
+         * } else if (cluster.isWorker) {
+         *   process.on('message', (msg) => {
+         *     process.send(msg);
+         *   });
+         * }
+         * ```
+         * @since v0.7.0
+         * @param options The `options` argument, if present, is an object used to parameterize the sending of certain types of handles. `options` supports the following properties:
+         */
+        send(message: child.Serializable, callback?: (error: Error | null) => void): boolean;
+        send(message: child.Serializable, sendHandle: child.SendHandle, callback?: (error: Error | null) => void): boolean;
+        send(message: child.Serializable, sendHandle: child.SendHandle, options?: child.MessageOptions, callback?: (error: Error | null) => void): boolean;
+        /**
+         * This function will kill the worker. In the primary, it does this
+         * by disconnecting the `worker.process`, and once disconnected, killing
+         * with `signal`. In the worker, it does it by disconnecting the channel,
+         * and then exiting with code `0`.
+         *
+         * Because `kill()` attempts to gracefully disconnect the worker process, it is
+         * susceptible to waiting indefinitely for the disconnect to complete. For example,
+         * if the worker enters an infinite loop, a graceful disconnect will never occur.
+         * If the graceful disconnect behavior is not needed, use `worker.process.kill()`.
+         *
+         * Causes `.exitedAfterDisconnect` to be set.
+         *
+         * This method is aliased as `worker.destroy()` for backward compatibility.
+         *
+         * In a worker, `process.kill()` exists, but it is not this function;
+         * it is `kill()`.
+         * @since v0.9.12
+         * @param [signal='SIGTERM'] Name of the kill signal to send to the worker process.
+         */
+        kill(signal?: string): void;
+        destroy(signal?: string): void;
+        /**
+         * In a worker, this function will close all servers, wait for the `'close'` event
+         * on those servers, and then disconnect the IPC channel.
+         *
+         * In the primary, an internal message is sent to the worker causing it to call`.disconnect()` on itself.
+         *
+         * Causes `.exitedAfterDisconnect` to be set.
+         *
+         * After a server is closed, it will no longer accept new connections,
+         * but connections may be accepted by any other listening worker. Existing
+         * connections will be allowed to close as usual. When no more connections exist,
+         * see `server.close()`, the IPC channel to the worker will close allowing it
+         * to die gracefully.
+         *
+         * The above applies _only_ to server connections, client connections are not
+         * automatically closed by workers, and disconnect does not wait for them to close
+         * before exiting.
+         *
+         * In a worker, `process.disconnect` exists, but it is not this function;
+         * it is `disconnect()`.
+         *
+         * Because long living server connections may block workers from disconnecting, it
+         * may be useful to send a message, so application specific actions may be taken to
+         * close them. It also may be useful to implement a timeout, killing a worker if
+         * the `'disconnect'` event has not been emitted after some time.
+         *
+         * ```js
+         * if (cluster.isPrimary) {
+         *   const worker = cluster.fork();
+         *   let timeout;
+         *
+         *   worker.on('listening', (address) => {
+         *     worker.send('shutdown');
+         *     worker.disconnect();
+         *     timeout = setTimeout(() => {
+         *       worker.kill();
+         *     }, 2000);
+         *   });
+         *
+         *   worker.on('disconnect', () => {
+         *     clearTimeout(timeout);
+         *   });
+         *
+         * } else if (cluster.isWorker) {
+         *   const net = require('net');
+         *   const server = net.createServer((socket) => {
+         *     // Connections never end
+         *   });
+         *
+         *   server.listen(8000);
+         *
+         *   process.on('message', (msg) => {
+         *     if (msg === 'shutdown') {
+         *       // Initiate graceful close of any connections to server
+         *     }
+         *   });
+         * }
+         * ```
+         * @since v0.7.7
+         * @return A reference to `worker`.
+         */
+        disconnect(): void;
+        /**
+         * This function returns `true` if the worker is connected to its primary via its
+         * IPC channel, `false` otherwise. A worker is connected to its primary after it
+         * has been created. It is disconnected after the `'disconnect'` event is emitted.
+         * @since v0.11.14
+         */
+        isConnected(): boolean;
+        /**
+         * This function returns `true` if the worker's process has terminated (either
+         * because of exiting or being signaled). Otherwise, it returns `false`.
+         *
+         * ```js
+         * import cluster from 'cluster';
+         * import http from 'http';
+         * import { cpus } from 'os';
+         * import process from 'process';
+         *
+         * const numCPUs = cpus().length;
+         *
+         * if (cluster.isPrimary) {
+         *   console.log(`Primary ${process.pid} is running`);
+         *
+         *   // Fork workers.
+         *   for (let i = 0; i < numCPUs; i++) {
+         *     cluster.fork();
+         *   }
+         *
+         *   cluster.on('fork', (worker) => {
+         *     console.log('worker is dead:', worker.isDead());
+         *   });
+         *
+         *   cluster.on('exit', (worker, code, signal) => {
+         *     console.log('worker is dead:', worker.isDead());
+         *   });
+         * } else {
+         *   // Workers can share any TCP connection. In this case, it is an HTTP server.
+         *   http.createServer((req, res) => {
+         *     res.writeHead(200);
+         *     res.end(`Current process\n ${process.pid}`);
+         *     process.kill(process.pid);
+         *   }).listen(8000);
+         * }
+         * ```
+         * @since v0.11.14
+         */
+        isDead(): boolean;
+        /**
+         * This property is `true` if the worker exited due to `.kill()` or`.disconnect()`. If the worker exited any other way, it is `false`. If the
+         * worker has not exited, it is `undefined`.
+         *
+         * The boolean `worker.exitedAfterDisconnect` allows distinguishing between
+         * voluntary and accidental exit, the primary may choose not to respawn a worker
+         * based on this value.
+         *
+         * ```js
+         * cluster.on('exit', (worker, code, signal) => {
+         *   if (worker.exitedAfterDisconnect === true) {
+         *     console.log('Oh, it was just voluntary – no need to worry');
+         *   }
+         * });
+         *
+         * // kill worker
+         * worker.kill();
+         * ```
+         * @since v6.0.0
+         */
+        exitedAfterDisconnect: boolean;
+        /**
+         * events.EventEmitter
+         *   1. disconnect
+         *   2. error
+         *   3. exit
+         *   4. listening
+         *   5. message
+         *   6. online
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'disconnect', listener: () => void): this;
+        addListener(event: 'error', listener: (error: Error) => void): this;
+        addListener(event: 'exit', listener: (code: number, signal: string) => void): this;
+        addListener(event: 'listening', listener: (address: Address) => void): this;
+        addListener(event: 'message', listener: (message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        addListener(event: 'online', listener: () => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'disconnect'): boolean;
+        emit(event: 'error', error: Error): boolean;
+        emit(event: 'exit', code: number, signal: string): boolean;
+        emit(event: 'listening', address: Address): boolean;
+        emit(event: 'message', message: any, handle: net.Socket | net.Server): boolean;
+        emit(event: 'online'): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'disconnect', listener: () => void): this;
+        on(event: 'error', listener: (error: Error) => void): this;
+        on(event: 'exit', listener: (code: number, signal: string) => void): this;
+        on(event: 'listening', listener: (address: Address) => void): this;
+        on(event: 'message', listener: (message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        on(event: 'online', listener: () => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'disconnect', listener: () => void): this;
+        once(event: 'error', listener: (error: Error) => void): this;
+        once(event: 'exit', listener: (code: number, signal: string) => void): this;
+        once(event: 'listening', listener: (address: Address) => void): this;
+        once(event: 'message', listener: (message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        once(event: 'online', listener: () => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'disconnect', listener: () => void): this;
+        prependListener(event: 'error', listener: (error: Error) => void): this;
+        prependListener(event: 'exit', listener: (code: number, signal: string) => void): this;
+        prependListener(event: 'listening', listener: (address: Address) => void): this;
+        prependListener(event: 'message', listener: (message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        prependListener(event: 'online', listener: () => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'disconnect', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (error: Error) => void): this;
+        prependOnceListener(event: 'exit', listener: (code: number, signal: string) => void): this;
+        prependOnceListener(event: 'listening', listener: (address: Address) => void): this;
+        prependOnceListener(event: 'message', listener: (message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        prependOnceListener(event: 'online', listener: () => void): this;
+    }
+    export interface Cluster extends EventEmitter {
+        disconnect(callback?: () => void): void;
+        fork(env?: any): Worker;
+        /** @deprecated since v16.0.0 - use isPrimary. */
+        readonly isMaster: boolean;
+        readonly isPrimary: boolean;
+        readonly isWorker: boolean;
+        schedulingPolicy: number;
+        readonly settings: ClusterSettings;
+        /** @deprecated since v16.0.0 - use setupPrimary. */
+        setupMaster(settings?: ClusterSettings): void;
+        /**
+         * `setupPrimary` is used to change the default 'fork' behavior. Once called, the settings will be present in cluster.settings.
+         */
+        setupPrimary(settings?: ClusterSettings): void;
+        readonly worker?: Worker | undefined;
+        readonly workers?: NodeJS.Dict<Worker> | undefined;
+        readonly SCHED_NONE: number;
+        readonly SCHED_RR: number;
+        /**
+         * events.EventEmitter
+         *   1. disconnect
+         *   2. exit
+         *   3. fork
+         *   4. listening
+         *   5. message
+         *   6. online
+         *   7. setup
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'disconnect', listener: (worker: Worker) => void): this;
+        addListener(event: 'exit', listener: (worker: Worker, code: number, signal: string) => void): this;
+        addListener(event: 'fork', listener: (worker: Worker) => void): this;
+        addListener(event: 'listening', listener: (worker: Worker, address: Address) => void): this;
+        addListener(event: 'message', listener: (worker: Worker, message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        addListener(event: 'online', listener: (worker: Worker) => void): this;
+        addListener(event: 'setup', listener: (settings: ClusterSettings) => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'disconnect', worker: Worker): boolean;
+        emit(event: 'exit', worker: Worker, code: number, signal: string): boolean;
+        emit(event: 'fork', worker: Worker): boolean;
+        emit(event: 'listening', worker: Worker, address: Address): boolean;
+        emit(event: 'message', worker: Worker, message: any, handle: net.Socket | net.Server): boolean;
+        emit(event: 'online', worker: Worker): boolean;
+        emit(event: 'setup', settings: ClusterSettings): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'disconnect', listener: (worker: Worker) => void): this;
+        on(event: 'exit', listener: (worker: Worker, code: number, signal: string) => void): this;
+        on(event: 'fork', listener: (worker: Worker) => void): this;
+        on(event: 'listening', listener: (worker: Worker, address: Address) => void): this;
+        on(event: 'message', listener: (worker: Worker, message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        on(event: 'online', listener: (worker: Worker) => void): this;
+        on(event: 'setup', listener: (settings: ClusterSettings) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'disconnect', listener: (worker: Worker) => void): this;
+        once(event: 'exit', listener: (worker: Worker, code: number, signal: string) => void): this;
+        once(event: 'fork', listener: (worker: Worker) => void): this;
+        once(event: 'listening', listener: (worker: Worker, address: Address) => void): this;
+        once(event: 'message', listener: (worker: Worker, message: any, handle: net.Socket | net.Server) => void): this; // the handle is a net.Socket or net.Server object, or undefined.
+        once(event: 'online', listener: (worker: Worker) => void): this;
+        once(event: 'setup', listener: (settings: ClusterSettings) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'disconnect', listener: (worker: Worker) => void): this;
+        prependListener(event: 'exit', listener: (worker: Worker, code: number, signal: string) => void): this;
+        prependListener(event: 'fork', listener: (worker: Worker) => void): this;
+        prependListener(event: 'listening', listener: (worker: Worker, address: Address) => void): this;
+        // the handle is a net.Socket or net.Server object, or undefined.
+        prependListener(event: 'message', listener: (worker: Worker, message: any, handle?: net.Socket | net.Server) => void): this;
+        prependListener(event: 'online', listener: (worker: Worker) => void): this;
+        prependListener(event: 'setup', listener: (settings: ClusterSettings) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'disconnect', listener: (worker: Worker) => void): this;
+        prependOnceListener(event: 'exit', listener: (worker: Worker, code: number, signal: string) => void): this;
+        prependOnceListener(event: 'fork', listener: (worker: Worker) => void): this;
+        prependOnceListener(event: 'listening', listener: (worker: Worker, address: Address) => void): this;
+        // the handle is a net.Socket or net.Server object, or undefined.
+        prependOnceListener(event: 'message', listener: (worker: Worker, message: any, handle: net.Socket | net.Server) => void): this;
+        prependOnceListener(event: 'online', listener: (worker: Worker) => void): this;
+        prependOnceListener(event: 'setup', listener: (settings: ClusterSettings) => void): this;
+    }
+    const cluster: Cluster;
+    export default cluster;
+}
+declare module 'node:cluster' {
+    export * from 'cluster';
+    export { default as default } from 'cluster';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/console.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/console.d.ts
new file mode 100644
index 0000000..9297018
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/console.d.ts
@@ -0,0 +1,412 @@
+/**
+ * The `console` module provides a simple debugging console that is similar to the
+ * JavaScript console mechanism provided by web browsers.
+ *
+ * The module exports two specific components:
+ *
+ * * A `Console` class with methods such as `console.log()`, `console.error()` and`console.warn()` that can be used to write to any Node.js stream.
+ * * A global `console` instance configured to write to `process.stdout` and `process.stderr`. The global `console` can be used without calling`require('console')`.
+ *
+ * _**Warning**_: The global console object's methods are neither consistently
+ * synchronous like the browser APIs they resemble, nor are they consistently
+ * asynchronous like all other Node.js streams. See the `note on process I/O` for
+ * more information.
+ *
+ * Example using the global `console`:
+ *
+ * ```js
+ * console.log('hello world');
+ * // Prints: hello world, to stdout
+ * console.log('hello %s', 'world');
+ * // Prints: hello world, to stdout
+ * console.error(new Error('Whoops, something bad happened'));
+ * // Prints error message and stack trace to stderr:
+ * //   Error: Whoops, something bad happened
+ * //     at [eval]:5:15
+ * //     at Script.runInThisContext (node:vm:132:18)
+ * //     at Object.runInThisContext (node:vm:309:38)
+ * //     at node:internal/process/execution:77:19
+ * //     at [eval]-wrapper:6:22
+ * //     at evalScript (node:internal/process/execution:76:60)
+ * //     at node:internal/main/eval_string:23:3
+ *
+ * const name = 'Will Robinson';
+ * console.warn(`Danger ${name}! Danger!`);
+ * // Prints: Danger Will Robinson! Danger!, to stderr
+ * ```
+ *
+ * Example using the `Console` class:
+ *
+ * ```js
+ * const out = getStreamSomehow();
+ * const err = getStreamSomehow();
+ * const myConsole = new console.Console(out, err);
+ *
+ * myConsole.log('hello world');
+ * // Prints: hello world, to out
+ * myConsole.log('hello %s', 'world');
+ * // Prints: hello world, to out
+ * myConsole.error(new Error('Whoops, something bad happened'));
+ * // Prints: [Error: Whoops, something bad happened], to err
+ *
+ * const name = 'Will Robinson';
+ * myConsole.warn(`Danger ${name}! Danger!`);
+ * // Prints: Danger Will Robinson! Danger!, to err
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/console.js)
+ */
+declare module 'console' {
+    import console = require('node:console');
+    export = console;
+}
+declare module 'node:console' {
+    import { InspectOptions } from 'node:util';
+    global {
+        // This needs to be global to avoid TS2403 in case lib.dom.d.ts is present in the same build
+        interface Console {
+            Console: console.ConsoleConstructor;
+            /**
+             * `console.assert()` writes a message if `value` is [falsy](https://developer.mozilla.org/en-US/docs/Glossary/Falsy) or omitted. It only
+             * writes a message and does not otherwise affect execution. The output always
+             * starts with `"Assertion failed"`. If provided, `message` is formatted using `util.format()`.
+             *
+             * If `value` is [truthy](https://developer.mozilla.org/en-US/docs/Glossary/Truthy), nothing happens.
+             *
+             * ```js
+             * console.assert(true, 'does nothing');
+             *
+             * console.assert(false, 'Whoops %s work', 'didn\'t');
+             * // Assertion failed: Whoops didn't work
+             *
+             * console.assert();
+             * // Assertion failed
+             * ```
+             * @since v0.1.101
+             * @param value The value tested for being truthy.
+             * @param message All arguments besides `value` are used as error message.
+             */
+            assert(value: any, message?: string, ...optionalParams: any[]): void;
+            /**
+             * When `stdout` is a TTY, calling `console.clear()` will attempt to clear the
+             * TTY. When `stdout` is not a TTY, this method does nothing.
+             *
+             * The specific operation of `console.clear()` can vary across operating systems
+             * and terminal types. For most Linux operating systems, `console.clear()`operates similarly to the `clear` shell command. On Windows, `console.clear()`will clear only the output in the
+             * current terminal viewport for the Node.js
+             * binary.
+             * @since v8.3.0
+             */
+            clear(): void;
+            /**
+             * Maintains an internal counter specific to `label` and outputs to `stdout` the
+             * number of times `console.count()` has been called with the given `label`.
+             *
+             * ```js
+             * > console.count()
+             * default: 1
+             * undefined
+             * > console.count('default')
+             * default: 2
+             * undefined
+             * > console.count('abc')
+             * abc: 1
+             * undefined
+             * > console.count('xyz')
+             * xyz: 1
+             * undefined
+             * > console.count('abc')
+             * abc: 2
+             * undefined
+             * > console.count()
+             * default: 3
+             * undefined
+             * >
+             * ```
+             * @since v8.3.0
+             * @param label The display label for the counter.
+             */
+            count(label?: string): void;
+            /**
+             * Resets the internal counter specific to `label`.
+             *
+             * ```js
+             * > console.count('abc');
+             * abc: 1
+             * undefined
+             * > console.countReset('abc');
+             * undefined
+             * > console.count('abc');
+             * abc: 1
+             * undefined
+             * >
+             * ```
+             * @since v8.3.0
+             * @param label The display label for the counter.
+             */
+            countReset(label?: string): void;
+            /**
+             * The `console.debug()` function is an alias for {@link log}.
+             * @since v8.0.0
+             */
+            debug(message?: any, ...optionalParams: any[]): void;
+            /**
+             * Uses `util.inspect()` on `obj` and prints the resulting string to `stdout`.
+             * This function bypasses any custom `inspect()` function defined on `obj`.
+             * @since v0.1.101
+             */
+            dir(obj: any, options?: InspectOptions): void;
+            /**
+             * This method calls `console.log()` passing it the arguments received.
+             * This method does not produce any XML formatting.
+             * @since v8.0.0
+             */
+            dirxml(...data: any[]): void;
+            /**
+             * Prints to `stderr` with newline. Multiple arguments can be passed, with the
+             * first used as the primary message and all additional used as substitution
+             * values similar to [`printf(3)`](http://man7.org/linux/man-pages/man3/printf.3.html) (the arguments are all passed to `util.format()`).
+             *
+             * ```js
+             * const code = 5;
+             * console.error('error #%d', code);
+             * // Prints: error #5, to stderr
+             * console.error('error', code);
+             * // Prints: error 5, to stderr
+             * ```
+             *
+             * If formatting elements (e.g. `%d`) are not found in the first string then `util.inspect()` is called on each argument and the resulting string
+             * values are concatenated. See `util.format()` for more information.
+             * @since v0.1.100
+             */
+            error(message?: any, ...optionalParams: any[]): void;
+            /**
+             * Increases indentation of subsequent lines by spaces for `groupIndentation`length.
+             *
+             * If one or more `label`s are provided, those are printed first without the
+             * additional indentation.
+             * @since v8.5.0
+             */
+            group(...label: any[]): void;
+            /**
+             * An alias for {@link group}.
+             * @since v8.5.0
+             */
+            groupCollapsed(...label: any[]): void;
+            /**
+             * Decreases indentation of subsequent lines by spaces for `groupIndentation`length.
+             * @since v8.5.0
+             */
+            groupEnd(): void;
+            /**
+             * The `console.info()` function is an alias for {@link log}.
+             * @since v0.1.100
+             */
+            info(message?: any, ...optionalParams: any[]): void;
+            /**
+             * Prints to `stdout` with newline. Multiple arguments can be passed, with the
+             * first used as the primary message and all additional used as substitution
+             * values similar to [`printf(3)`](http://man7.org/linux/man-pages/man3/printf.3.html) (the arguments are all passed to `util.format()`).
+             *
+             * ```js
+             * const count = 5;
+             * console.log('count: %d', count);
+             * // Prints: count: 5, to stdout
+             * console.log('count:', count);
+             * // Prints: count: 5, to stdout
+             * ```
+             *
+             * See `util.format()` for more information.
+             * @since v0.1.100
+             */
+            log(message?: any, ...optionalParams: any[]): void;
+            /**
+             * Try to construct a table with the columns of the properties of `tabularData`(or use `properties`) and rows of `tabularData` and log it. Falls back to just
+             * logging the argument if it can’t be parsed as tabular.
+             *
+             * ```js
+             * // These can't be parsed as tabular data
+             * console.table(Symbol());
+             * // Symbol()
+             *
+             * console.table(undefined);
+             * // undefined
+             *
+             * console.table([{ a: 1, b: 'Y' }, { a: 'Z', b: 2 }]);
+             * // ┌─────────┬─────┬─────┐
+             * // │ (index) │  a  │  b  │
+             * // ├─────────┼─────┼─────┤
+             * // │    0    │  1  │ 'Y' │
+             * // │    1    │ 'Z' │  2  │
+             * // └─────────┴─────┴─────┘
+             *
+             * console.table([{ a: 1, b: 'Y' }, { a: 'Z', b: 2 }], ['a']);
+             * // ┌─────────┬─────┐
+             * // │ (index) │  a  │
+             * // ├─────────┼─────┤
+             * // │    0    │  1  │
+             * // │    1    │ 'Z' │
+             * // └─────────┴─────┘
+             * ```
+             * @since v10.0.0
+             * @param properties Alternate properties for constructing the table.
+             */
+            table(tabularData: any, properties?: ReadonlyArray<string>): void;
+            /**
+             * Starts a timer that can be used to compute the duration of an operation. Timers
+             * are identified by a unique `label`. Use the same `label` when calling {@link timeEnd} to stop the timer and output the elapsed time in
+             * suitable time units to `stdout`. For example, if the elapsed
+             * time is 3869ms, `console.timeEnd()` displays "3.869s".
+             * @since v0.1.104
+             */
+            time(label?: string): void;
+            /**
+             * Stops a timer that was previously started by calling {@link time} and
+             * prints the result to `stdout`:
+             *
+             * ```js
+             * console.time('100-elements');
+             * for (let i = 0; i < 100; i++) {}
+             * console.timeEnd('100-elements');
+             * // prints 100-elements: 225.438ms
+             * ```
+             * @since v0.1.104
+             */
+            timeEnd(label?: string): void;
+            /**
+             * For a timer that was previously started by calling {@link time}, prints
+             * the elapsed time and other `data` arguments to `stdout`:
+             *
+             * ```js
+             * console.time('process');
+             * const value = expensiveProcess1(); // Returns 42
+             * console.timeLog('process', value);
+             * // Prints "process: 365.227ms 42".
+             * doExpensiveProcess2(value);
+             * console.timeEnd('process');
+             * ```
+             * @since v10.7.0
+             */
+            timeLog(label?: string, ...data: any[]): void;
+            /**
+             * Prints to `stderr` the string `'Trace: '`, followed by the `util.format()` formatted message and stack trace to the current position in the code.
+             *
+             * ```js
+             * console.trace('Show me');
+             * // Prints: (stack trace will vary based on where trace is called)
+             * //  Trace: Show me
+             * //    at repl:2:9
+             * //    at REPLServer.defaultEval (repl.js:248:27)
+             * //    at bound (domain.js:287:14)
+             * //    at REPLServer.runBound [as eval] (domain.js:300:12)
+             * //    at REPLServer.<anonymous> (repl.js:412:12)
+             * //    at emitOne (events.js:82:20)
+             * //    at REPLServer.emit (events.js:169:7)
+             * //    at REPLServer.Interface._onLine (readline.js:210:10)
+             * //    at REPLServer.Interface._line (readline.js:549:8)
+             * //    at REPLServer.Interface._ttyWrite (readline.js:826:14)
+             * ```
+             * @since v0.1.104
+             */
+            trace(message?: any, ...optionalParams: any[]): void;
+            /**
+             * The `console.warn()` function is an alias for {@link error}.
+             * @since v0.1.100
+             */
+            warn(message?: any, ...optionalParams: any[]): void;
+            // --- Inspector mode only ---
+            /**
+             * This method does not display anything unless used in the inspector.
+             *  Starts a JavaScript CPU profile with an optional label.
+             */
+            profile(label?: string): void;
+            /**
+             * This method does not display anything unless used in the inspector.
+             *  Stops the current JavaScript CPU profiling session if one has been started and prints the report to the Profiles panel of the inspector.
+             */
+            profileEnd(label?: string): void;
+            /**
+             * This method does not display anything unless used in the inspector.
+             *  Adds an event with the label `label` to the Timeline panel of the inspector.
+             */
+            timeStamp(label?: string): void;
+        }
+        /**
+         * The `console` module provides a simple debugging console that is similar to the
+         * JavaScript console mechanism provided by web browsers.
+         *
+         * The module exports two specific components:
+         *
+         * * A `Console` class with methods such as `console.log()`, `console.error()` and`console.warn()` that can be used to write to any Node.js stream.
+         * * A global `console` instance configured to write to `process.stdout` and `process.stderr`. The global `console` can be used without calling`require('console')`.
+         *
+         * _**Warning**_: The global console object's methods are neither consistently
+         * synchronous like the browser APIs they resemble, nor are they consistently
+         * asynchronous like all other Node.js streams. See the `note on process I/O` for
+         * more information.
+         *
+         * Example using the global `console`:
+         *
+         * ```js
+         * console.log('hello world');
+         * // Prints: hello world, to stdout
+         * console.log('hello %s', 'world');
+         * // Prints: hello world, to stdout
+         * console.error(new Error('Whoops, something bad happened'));
+         * // Prints error message and stack trace to stderr:
+         * //   Error: Whoops, something bad happened
+         * //     at [eval]:5:15
+         * //     at Script.runInThisContext (node:vm:132:18)
+         * //     at Object.runInThisContext (node:vm:309:38)
+         * //     at node:internal/process/execution:77:19
+         * //     at [eval]-wrapper:6:22
+         * //     at evalScript (node:internal/process/execution:76:60)
+         * //     at node:internal/main/eval_string:23:3
+         *
+         * const name = 'Will Robinson';
+         * console.warn(`Danger ${name}! Danger!`);
+         * // Prints: Danger Will Robinson! Danger!, to stderr
+         * ```
+         *
+         * Example using the `Console` class:
+         *
+         * ```js
+         * const out = getStreamSomehow();
+         * const err = getStreamSomehow();
+         * const myConsole = new console.Console(out, err);
+         *
+         * myConsole.log('hello world');
+         * // Prints: hello world, to out
+         * myConsole.log('hello %s', 'world');
+         * // Prints: hello world, to out
+         * myConsole.error(new Error('Whoops, something bad happened'));
+         * // Prints: [Error: Whoops, something bad happened], to err
+         *
+         * const name = 'Will Robinson';
+         * myConsole.warn(`Danger ${name}! Danger!`);
+         * // Prints: Danger Will Robinson! Danger!, to err
+         * ```
+         * @see [source](https://github.com/nodejs/node/blob/v16.4.2/lib/console.js)
+         */
+        namespace console {
+            interface ConsoleConstructorOptions {
+                stdout: NodeJS.WritableStream;
+                stderr?: NodeJS.WritableStream | undefined;
+                ignoreErrors?: boolean | undefined;
+                colorMode?: boolean | 'auto' | undefined;
+                inspectOptions?: InspectOptions | undefined;
+                /**
+                 * Set group indentation
+                 * @default 2
+                 */
+                groupIndentation?: number | undefined;
+            }
+            interface ConsoleConstructor {
+                prototype: Console;
+                new (stdout: NodeJS.WritableStream, stderr?: NodeJS.WritableStream, ignoreErrors?: boolean): Console;
+                new (options: ConsoleConstructorOptions): Console;
+            }
+        }
+        var console: Console;
+    }
+    export = globalThis.console;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/constants.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/constants.d.ts
new file mode 100644
index 0000000..208020d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/constants.d.ts
@@ -0,0 +1,18 @@
+/** @deprecated since v6.3.0 - use constants property exposed by the relevant module instead. */
+declare module 'constants' {
+    import { constants as osConstants, SignalConstants } from 'node:os';
+    import { constants as cryptoConstants } from 'node:crypto';
+    import { constants as fsConstants } from 'node:fs';
+
+    const exp: typeof osConstants.errno &
+        typeof osConstants.priority &
+        SignalConstants &
+        typeof cryptoConstants &
+        typeof fsConstants;
+    export = exp;
+}
+
+declare module 'node:constants' {
+    import constants = require('constants');
+    export = constants;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/crypto.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/crypto.d.ts
new file mode 100644
index 0000000..4dff488
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/crypto.d.ts
@@ -0,0 +1,3307 @@
+/**
+ * The `crypto` module provides cryptographic functionality that includes a set of
+ * wrappers for OpenSSL's hash, HMAC, cipher, decipher, sign, and verify functions.
+ *
+ * ```js
+ * const { createHmac } = await import('crypto');
+ *
+ * const secret = 'abcdefg';
+ * const hash = createHmac('sha256', secret)
+ *                .update('I love cupcakes')
+ *                .digest('hex');
+ * console.log(hash);
+ * // Prints:
+ * //   c0fa1bc00531bd78ef38c628449c5102aeabd49b5dc3a2a516ea6ea959d6658e
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/crypto.js)
+ */
+declare module 'crypto' {
+    import * as stream from 'node:stream';
+    import { PeerCertificate } from 'node:tls';
+    interface Certificate {
+        /**
+         * @deprecated
+         * @param spkac
+         * @returns The challenge component of the `spkac` data structure,
+         * which includes a public key and a challenge.
+         */
+        exportChallenge(spkac: BinaryLike): Buffer;
+        /**
+         * @deprecated
+         * @param spkac
+         * @param encoding The encoding of the spkac string.
+         * @returns The public key component of the `spkac` data structure,
+         * which includes a public key and a challenge.
+         */
+        exportPublicKey(spkac: BinaryLike, encoding?: string): Buffer;
+        /**
+         * @deprecated
+         * @param spkac
+         * @returns `true` if the given `spkac` data structure is valid,
+         * `false` otherwise.
+         */
+        verifySpkac(spkac: NodeJS.ArrayBufferView): boolean;
+    }
+    const Certificate: Certificate & {
+        /** @deprecated since v14.9.0 - Use static methods of `crypto.Certificate` instead. */
+        new (): Certificate;
+        /** @deprecated since v14.9.0 - Use static methods of `crypto.Certificate` instead. */
+        (): Certificate;
+        /**
+         * @param spkac
+         * @returns The challenge component of the `spkac` data structure,
+         * which includes a public key and a challenge.
+         */
+        exportChallenge(spkac: BinaryLike): Buffer;
+        /**
+         * @param spkac
+         * @param encoding The encoding of the spkac string.
+         * @returns The public key component of the `spkac` data structure,
+         * which includes a public key and a challenge.
+         */
+        exportPublicKey(spkac: BinaryLike, encoding?: string): Buffer;
+        /**
+         * @param spkac
+         * @returns `true` if the given `spkac` data structure is valid,
+         * `false` otherwise.
+         */
+        verifySpkac(spkac: NodeJS.ArrayBufferView): boolean;
+    };
+    namespace constants {
+        // https://nodejs.org/dist/latest-v10.x/docs/api/crypto.html#crypto_crypto_constants
+        const OPENSSL_VERSION_NUMBER: number;
+        /** Applies multiple bug workarounds within OpenSSL. See https://www.openssl.org/docs/man1.0.2/ssl/SSL_CTX_set_options.html for detail. */
+        const SSL_OP_ALL: number;
+        /** Allows legacy insecure renegotiation between OpenSSL and unpatched clients or servers. See https://www.openssl.org/docs/man1.0.2/ssl/SSL_CTX_set_options.html. */
+        const SSL_OP_ALLOW_UNSAFE_LEGACY_RENEGOTIATION: number;
+        /** Attempts to use the server's preferences instead of the client's when selecting a cipher. See https://www.openssl.org/docs/man1.0.2/ssl/SSL_CTX_set_options.html. */
+        const SSL_OP_CIPHER_SERVER_PREFERENCE: number;
+        /** Instructs OpenSSL to use Cisco's "speshul" version of DTLS_BAD_VER. */
+        const SSL_OP_CISCO_ANYCONNECT: number;
+        /** Instructs OpenSSL to turn on cookie exchange. */
+        const SSL_OP_COOKIE_EXCHANGE: number;
+        /** Instructs OpenSSL to add server-hello extension from an early version of the cryptopro draft. */
+        const SSL_OP_CRYPTOPRO_TLSEXT_BUG: number;
+        /** Instructs OpenSSL to disable a SSL 3.0/TLS 1.0 vulnerability workaround added in OpenSSL 0.9.6d. */
+        const SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS: number;
+        /** Instructs OpenSSL to always use the tmp_rsa key when performing RSA operations. */
+        const SSL_OP_EPHEMERAL_RSA: number;
+        /** Allows initial connection to servers that do not support RI. */
+        const SSL_OP_LEGACY_SERVER_CONNECT: number;
+        const SSL_OP_MICROSOFT_BIG_SSLV3_BUFFER: number;
+        const SSL_OP_MICROSOFT_SESS_ID_BUG: number;
+        /** Instructs OpenSSL to disable the workaround for a man-in-the-middle protocol-version vulnerability in the SSL 2.0 server implementation. */
+        const SSL_OP_MSIE_SSLV2_RSA_PADDING: number;
+        const SSL_OP_NETSCAPE_CA_DN_BUG: number;
+        const SSL_OP_NETSCAPE_CHALLENGE_BUG: number;
+        const SSL_OP_NETSCAPE_DEMO_CIPHER_CHANGE_BUG: number;
+        const SSL_OP_NETSCAPE_REUSE_CIPHER_CHANGE_BUG: number;
+        /** Instructs OpenSSL to disable support for SSL/TLS compression. */
+        const SSL_OP_NO_COMPRESSION: number;
+        const SSL_OP_NO_QUERY_MTU: number;
+        /** Instructs OpenSSL to always start a new session when performing renegotiation. */
+        const SSL_OP_NO_SESSION_RESUMPTION_ON_RENEGOTIATION: number;
+        const SSL_OP_NO_SSLv2: number;
+        const SSL_OP_NO_SSLv3: number;
+        const SSL_OP_NO_TICKET: number;
+        const SSL_OP_NO_TLSv1: number;
+        const SSL_OP_NO_TLSv1_1: number;
+        const SSL_OP_NO_TLSv1_2: number;
+        const SSL_OP_PKCS1_CHECK_1: number;
+        const SSL_OP_PKCS1_CHECK_2: number;
+        /** Instructs OpenSSL to always create a new key when using temporary/ephemeral DH parameters. */
+        const SSL_OP_SINGLE_DH_USE: number;
+        /** Instructs OpenSSL to always create a new key when using temporary/ephemeral ECDH parameters. */
+        const SSL_OP_SINGLE_ECDH_USE: number;
+        const SSL_OP_SSLEAY_080_CLIENT_DH_BUG: number;
+        const SSL_OP_SSLREF2_REUSE_CERT_TYPE_BUG: number;
+        const SSL_OP_TLS_BLOCK_PADDING_BUG: number;
+        const SSL_OP_TLS_D5_BUG: number;
+        /** Instructs OpenSSL to disable version rollback attack detection. */
+        const SSL_OP_TLS_ROLLBACK_BUG: number;
+        const ENGINE_METHOD_RSA: number;
+        const ENGINE_METHOD_DSA: number;
+        const ENGINE_METHOD_DH: number;
+        const ENGINE_METHOD_RAND: number;
+        const ENGINE_METHOD_EC: number;
+        const ENGINE_METHOD_CIPHERS: number;
+        const ENGINE_METHOD_DIGESTS: number;
+        const ENGINE_METHOD_PKEY_METHS: number;
+        const ENGINE_METHOD_PKEY_ASN1_METHS: number;
+        const ENGINE_METHOD_ALL: number;
+        const ENGINE_METHOD_NONE: number;
+        const DH_CHECK_P_NOT_SAFE_PRIME: number;
+        const DH_CHECK_P_NOT_PRIME: number;
+        const DH_UNABLE_TO_CHECK_GENERATOR: number;
+        const DH_NOT_SUITABLE_GENERATOR: number;
+        const ALPN_ENABLED: number;
+        const RSA_PKCS1_PADDING: number;
+        const RSA_SSLV23_PADDING: number;
+        const RSA_NO_PADDING: number;
+        const RSA_PKCS1_OAEP_PADDING: number;
+        const RSA_X931_PADDING: number;
+        const RSA_PKCS1_PSS_PADDING: number;
+        /** Sets the salt length for RSA_PKCS1_PSS_PADDING to the digest size when signing or verifying. */
+        const RSA_PSS_SALTLEN_DIGEST: number;
+        /** Sets the salt length for RSA_PKCS1_PSS_PADDING to the maximum permissible value when signing data. */
+        const RSA_PSS_SALTLEN_MAX_SIGN: number;
+        /** Causes the salt length for RSA_PKCS1_PSS_PADDING to be determined automatically when verifying a signature. */
+        const RSA_PSS_SALTLEN_AUTO: number;
+        const POINT_CONVERSION_COMPRESSED: number;
+        const POINT_CONVERSION_UNCOMPRESSED: number;
+        const POINT_CONVERSION_HYBRID: number;
+        /** Specifies the built-in default cipher list used by Node.js (colon-separated values). */
+        const defaultCoreCipherList: string;
+        /** Specifies the active default cipher list used by the current Node.js process  (colon-separated values). */
+        const defaultCipherList: string;
+    }
+    interface HashOptions extends stream.TransformOptions {
+        /**
+         * For XOF hash functions such as `shake256`, the
+         * outputLength option can be used to specify the desired output length in bytes.
+         */
+        outputLength?: number | undefined;
+    }
+    /** @deprecated since v10.0.0 */
+    const fips: boolean;
+    /**
+     * Creates and returns a `Hash` object that can be used to generate hash digests
+     * using the given `algorithm`. Optional `options` argument controls stream
+     * behavior. For XOF hash functions such as `'shake256'`, the `outputLength` option
+     * can be used to specify the desired output length in bytes.
+     *
+     * The `algorithm` is dependent on the available algorithms supported by the
+     * version of OpenSSL on the platform. Examples are `'sha256'`, `'sha512'`, etc.
+     * On recent releases of OpenSSL, `openssl list -digest-algorithms`(`openssl list-message-digest-algorithms` for older versions of OpenSSL) will
+     * display the available digest algorithms.
+     *
+     * Example: generating the sha256 sum of a file
+     *
+     * ```js
+     * import {
+     *   createReadStream
+     * } from 'fs';
+     * import { argv } from 'process';
+     * const {
+     *   createHash
+     * } = await import('crypto');
+     *
+     * const filename = argv[2];
+     *
+     * const hash = createHash('sha256');
+     *
+     * const input = createReadStream(filename);
+     * input.on('readable', () => {
+     *   // Only one element is going to be produced by the
+     *   // hash stream.
+     *   const data = input.read();
+     *   if (data)
+     *     hash.update(data);
+     *   else {
+     *     console.log(`${hash.digest('hex')} ${filename}`);
+     *   }
+     * });
+     * ```
+     * @since v0.1.92
+     * @param options `stream.transform` options
+     */
+    function createHash(algorithm: string, options?: HashOptions): Hash;
+    /**
+     * Creates and returns an `Hmac` object that uses the given `algorithm` and `key`.
+     * Optional `options` argument controls stream behavior.
+     *
+     * The `algorithm` is dependent on the available algorithms supported by the
+     * version of OpenSSL on the platform. Examples are `'sha256'`, `'sha512'`, etc.
+     * On recent releases of OpenSSL, `openssl list -digest-algorithms`(`openssl list-message-digest-algorithms` for older versions of OpenSSL) will
+     * display the available digest algorithms.
+     *
+     * The `key` is the HMAC key used to generate the cryptographic HMAC hash. If it is
+     * a `KeyObject`, its type must be `secret`.
+     *
+     * Example: generating the sha256 HMAC of a file
+     *
+     * ```js
+     * import {
+     *   createReadStream
+     * } from 'fs';
+     * import { argv } from 'process';
+     * const {
+     *   createHmac
+     * } = await import('crypto');
+     *
+     * const filename = argv[2];
+     *
+     * const hmac = createHmac('sha256', 'a secret');
+     *
+     * const input = createReadStream(filename);
+     * input.on('readable', () => {
+     *   // Only one element is going to be produced by the
+     *   // hash stream.
+     *   const data = input.read();
+     *   if (data)
+     *     hmac.update(data);
+     *   else {
+     *     console.log(`${hmac.digest('hex')} ${filename}`);
+     *   }
+     * });
+     * ```
+     * @since v0.1.94
+     * @param options `stream.transform` options
+     */
+    function createHmac(algorithm: string, key: BinaryLike | KeyObject, options?: stream.TransformOptions): Hmac;
+    // https://nodejs.org/api/buffer.html#buffer_buffers_and_character_encodings
+    type BinaryToTextEncoding = 'base64' | 'base64url' | 'hex' | 'binary';
+    type CharacterEncoding = 'utf8' | 'utf-8' | 'utf16le' | 'latin1';
+    type LegacyCharacterEncoding = 'ascii' | 'binary' | 'ucs2' | 'ucs-2';
+    type Encoding = BinaryToTextEncoding | CharacterEncoding | LegacyCharacterEncoding;
+    type ECDHKeyFormat = 'compressed' | 'uncompressed' | 'hybrid';
+    /**
+     * The `Hash` class is a utility for creating hash digests of data. It can be
+     * used in one of two ways:
+     *
+     * * As a `stream` that is both readable and writable, where data is written
+     * to produce a computed hash digest on the readable side, or
+     * * Using the `hash.update()` and `hash.digest()` methods to produce the
+     * computed hash.
+     *
+     * The {@link createHash} method is used to create `Hash` instances. `Hash`objects are not to be created directly using the `new` keyword.
+     *
+     * Example: Using `Hash` objects as streams:
+     *
+     * ```js
+     * const {
+     *   createHash
+     * } = await import('crypto');
+     *
+     * const hash = createHash('sha256');
+     *
+     * hash.on('readable', () => {
+     *   // Only one element is going to be produced by the
+     *   // hash stream.
+     *   const data = hash.read();
+     *   if (data) {
+     *     console.log(data.toString('hex'));
+     *     // Prints:
+     *     //   6a2da20943931e9834fc12cfe5bb47bbd9ae43489a30726962b576f4e3993e50
+     *   }
+     * });
+     *
+     * hash.write('some data to hash');
+     * hash.end();
+     * ```
+     *
+     * Example: Using `Hash` and piped streams:
+     *
+     * ```js
+     * import { createReadStream } from 'fs';
+     * import { stdout } from 'process';
+     * const { createHash } = await import('crypto');
+     *
+     * const hash = createHash('sha256');
+     *
+     * const input = createReadStream('test.js');
+     * input.pipe(hash).setEncoding('hex').pipe(stdout);
+     * ```
+     *
+     * Example: Using the `hash.update()` and `hash.digest()` methods:
+     *
+     * ```js
+     * const {
+     *   createHash
+     * } = await import('crypto');
+     *
+     * const hash = createHash('sha256');
+     *
+     * hash.update('some data to hash');
+     * console.log(hash.digest('hex'));
+     * // Prints:
+     * //   6a2da20943931e9834fc12cfe5bb47bbd9ae43489a30726962b576f4e3993e50
+     * ```
+     * @since v0.1.92
+     */
+    class Hash extends stream.Transform {
+        private constructor();
+        /**
+         * Creates a new `Hash` object that contains a deep copy of the internal state
+         * of the current `Hash` object.
+         *
+         * The optional `options` argument controls stream behavior. For XOF hash
+         * functions such as `'shake256'`, the `outputLength` option can be used to
+         * specify the desired output length in bytes.
+         *
+         * An error is thrown when an attempt is made to copy the `Hash` object after
+         * its `hash.digest()` method has been called.
+         *
+         * ```js
+         * // Calculate a rolling hash.
+         * const {
+         *   createHash
+         * } = await import('crypto');
+         *
+         * const hash = createHash('sha256');
+         *
+         * hash.update('one');
+         * console.log(hash.copy().digest('hex'));
+         *
+         * hash.update('two');
+         * console.log(hash.copy().digest('hex'));
+         *
+         * hash.update('three');
+         * console.log(hash.copy().digest('hex'));
+         *
+         * // Etc.
+         * ```
+         * @since v13.1.0
+         * @param options `stream.transform` options
+         */
+        copy(options?: stream.TransformOptions): Hash;
+        /**
+         * Updates the hash content with the given `data`, the encoding of which
+         * is given in `inputEncoding`.
+         * If `encoding` is not provided, and the `data` is a string, an
+         * encoding of `'utf8'` is enforced. If `data` is a `Buffer`, `TypedArray`, or`DataView`, then `inputEncoding` is ignored.
+         *
+         * This can be called many times with new data as it is streamed.
+         * @since v0.1.92
+         * @param inputEncoding The `encoding` of the `data` string.
+         */
+        update(data: BinaryLike): Hash;
+        update(data: string, inputEncoding: Encoding): Hash;
+        /**
+         * Calculates the digest of all of the data passed to be hashed (using the `hash.update()` method).
+         * If `encoding` is provided a string will be returned; otherwise
+         * a `Buffer` is returned.
+         *
+         * The `Hash` object can not be used again after `hash.digest()` method has been
+         * called. Multiple calls will cause an error to be thrown.
+         * @since v0.1.92
+         * @param encoding The `encoding` of the return value.
+         */
+        digest(): Buffer;
+        digest(encoding: BinaryToTextEncoding): string;
+    }
+    /**
+     * The `Hmac` class is a utility for creating cryptographic HMAC digests. It can
+     * be used in one of two ways:
+     *
+     * * As a `stream` that is both readable and writable, where data is written
+     * to produce a computed HMAC digest on the readable side, or
+     * * Using the `hmac.update()` and `hmac.digest()` methods to produce the
+     * computed HMAC digest.
+     *
+     * The {@link createHmac} method is used to create `Hmac` instances. `Hmac`objects are not to be created directly using the `new` keyword.
+     *
+     * Example: Using `Hmac` objects as streams:
+     *
+     * ```js
+     * const {
+     *   createHmac
+     * } = await import('crypto');
+     *
+     * const hmac = createHmac('sha256', 'a secret');
+     *
+     * hmac.on('readable', () => {
+     *   // Only one element is going to be produced by the
+     *   // hash stream.
+     *   const data = hmac.read();
+     *   if (data) {
+     *     console.log(data.toString('hex'));
+     *     // Prints:
+     *     //   7fd04df92f636fd450bc841c9418e5825c17f33ad9c87c518115a45971f7f77e
+     *   }
+     * });
+     *
+     * hmac.write('some data to hash');
+     * hmac.end();
+     * ```
+     *
+     * Example: Using `Hmac` and piped streams:
+     *
+     * ```js
+     * import { createReadStream } from 'fs';
+     * import { stdout } from 'process';
+     * const {
+     *   createHmac
+     * } = await import('crypto');
+     *
+     * const hmac = createHmac('sha256', 'a secret');
+     *
+     * const input = createReadStream('test.js');
+     * input.pipe(hmac).pipe(stdout);
+     * ```
+     *
+     * Example: Using the `hmac.update()` and `hmac.digest()` methods:
+     *
+     * ```js
+     * const {
+     *   createHmac
+     * } = await import('crypto');
+     *
+     * const hmac = createHmac('sha256', 'a secret');
+     *
+     * hmac.update('some data to hash');
+     * console.log(hmac.digest('hex'));
+     * // Prints:
+     * //   7fd04df92f636fd450bc841c9418e5825c17f33ad9c87c518115a45971f7f77e
+     * ```
+     * @since v0.1.94
+     */
+    class Hmac extends stream.Transform {
+        private constructor();
+        /**
+         * Updates the `Hmac` content with the given `data`, the encoding of which
+         * is given in `inputEncoding`.
+         * If `encoding` is not provided, and the `data` is a string, an
+         * encoding of `'utf8'` is enforced. If `data` is a `Buffer`, `TypedArray`, or`DataView`, then `inputEncoding` is ignored.
+         *
+         * This can be called many times with new data as it is streamed.
+         * @since v0.1.94
+         * @param inputEncoding The `encoding` of the `data` string.
+         */
+        update(data: BinaryLike): Hmac;
+        update(data: string, inputEncoding: Encoding): Hmac;
+        /**
+         * Calculates the HMAC digest of all of the data passed using `hmac.update()`.
+         * If `encoding` is
+         * provided a string is returned; otherwise a `Buffer` is returned;
+         *
+         * The `Hmac` object can not be used again after `hmac.digest()` has been
+         * called. Multiple calls to `hmac.digest()` will result in an error being thrown.
+         * @since v0.1.94
+         * @param encoding The `encoding` of the return value.
+         */
+        digest(): Buffer;
+        digest(encoding: BinaryToTextEncoding): string;
+    }
+    type KeyObjectType = 'secret' | 'public' | 'private';
+    interface KeyExportOptions<T extends KeyFormat> {
+        type: 'pkcs1' | 'spki' | 'pkcs8' | 'sec1';
+        format: T;
+        cipher?: string | undefined;
+        passphrase?: string | Buffer | undefined;
+    }
+    interface JwkKeyExportOptions {
+        format: 'jwk';
+    }
+    interface JsonWebKey {
+        crv?: string | undefined;
+        d?: string | undefined;
+        dp?: string | undefined;
+        dq?: string | undefined;
+        e?: string | undefined;
+        k?: string | undefined;
+        kty?: string | undefined;
+        n?: string | undefined;
+        p?: string | undefined;
+        q?: string | undefined;
+        qi?: string | undefined;
+        x?: string | undefined;
+        y?: string | undefined;
+        [key: string]: unknown;
+    }
+    interface AsymmetricKeyDetails {
+        /**
+         * Key size in bits (RSA, DSA).
+         */
+        modulusLength?: number | undefined;
+        /**
+         * Public exponent (RSA).
+         */
+        publicExponent?: bigint | undefined;
+        /**
+         * Name of the message digest (RSA-PSS).
+         */
+        hashAlgorithm?: string | undefined;
+        /**
+         * Name of the message digest used by MGF1 (RSA-PSS).
+         */
+        mgf1HashAlgorithm?: string | undefined;
+        /**
+         * Minimal salt length in bytes (RSA-PSS).
+         */
+        saltLength?: number | undefined;
+        /**
+         * Size of q in bits (DSA).
+         */
+        divisorLength?: number | undefined;
+        /**
+         * Name of the curve (EC).
+         */
+        namedCurve?: string | undefined;
+    }
+    interface JwkKeyExportOptions {
+        format: 'jwk';
+    }
+    /**
+     * Node.js uses a `KeyObject` class to represent a symmetric or asymmetric key,
+     * and each kind of key exposes different functions. The {@link createSecretKey}, {@link createPublicKey} and {@link createPrivateKey} methods are used to create `KeyObject`instances. `KeyObject`
+     * objects are not to be created directly using the `new`keyword.
+     *
+     * Most applications should consider using the new `KeyObject` API instead of
+     * passing keys as strings or `Buffer`s due to improved security features.
+     *
+     * `KeyObject` instances can be passed to other threads via `postMessage()`.
+     * The receiver obtains a cloned `KeyObject`, and the `KeyObject` does not need to
+     * be listed in the `transferList` argument.
+     * @since v11.6.0
+     */
+    class KeyObject {
+        private constructor();
+        /**
+         * Example: Converting a `CryptoKey` instance to a `KeyObject`:
+         *
+         * ```js
+         * const { webcrypto, KeyObject } = await import('crypto');
+         * const { subtle } = webcrypto;
+         *
+         * const key = await subtle.generateKey({
+         *   name: 'HMAC',
+         *   hash: 'SHA-256',
+         *   length: 256
+         * }, true, ['sign', 'verify']);
+         *
+         * const keyObject = KeyObject.from(key);
+         * console.log(keyObject.symmetricKeySize);
+         * // Prints: 32 (symmetric key size in bytes)
+         * ```
+         * @since v15.0.0
+         */
+        static from(key: webcrypto.CryptoKey): KeyObject;
+        /**
+         * For asymmetric keys, this property represents the type of the key. Supported key
+         * types are:
+         *
+         * * `'rsa'` (OID 1.2.840.113549.1.1.1)
+         * * `'rsa-pss'` (OID 1.2.840.113549.1.1.10)
+         * * `'dsa'` (OID 1.2.840.10040.4.1)
+         * * `'ec'` (OID 1.2.840.10045.2.1)
+         * * `'x25519'` (OID 1.3.101.110)
+         * * `'x448'` (OID 1.3.101.111)
+         * * `'ed25519'` (OID 1.3.101.112)
+         * * `'ed448'` (OID 1.3.101.113)
+         * * `'dh'` (OID 1.2.840.113549.1.3.1)
+         *
+         * This property is `undefined` for unrecognized `KeyObject` types and symmetric
+         * keys.
+         * @since v11.6.0
+         */
+        asymmetricKeyType?: KeyType | undefined;
+        /**
+         * For asymmetric keys, this property represents the size of the embedded key in
+         * bytes. This property is `undefined` for symmetric keys.
+         */
+        asymmetricKeySize?: number | undefined;
+        /**
+         * This property exists only on asymmetric keys. Depending on the type of the key,
+         * this object contains information about the key. None of the information obtained
+         * through this property can be used to uniquely identify a key or to compromise
+         * the security of the key.
+         *
+         * For RSA-PSS keys, if the key material contains a `RSASSA-PSS-params` sequence,
+         * the `hashAlgorithm`, `mgf1HashAlgorithm`, and `saltLength` properties will be
+         * set.
+         *
+         * Other key details might be exposed via this API using additional attributes.
+         * @since v15.7.0
+         */
+        asymmetricKeyDetails?: AsymmetricKeyDetails | undefined;
+        /**
+         * For symmetric keys, the following encoding options can be used:
+         *
+         * For public keys, the following encoding options can be used:
+         *
+         * For private keys, the following encoding options can be used:
+         *
+         * The result type depends on the selected encoding format, when PEM the
+         * result is a string, when DER it will be a buffer containing the data
+         * encoded as DER, when [JWK](https://tools.ietf.org/html/rfc7517) it will be an object.
+         *
+         * When [JWK](https://tools.ietf.org/html/rfc7517) encoding format was selected, all other encoding options are
+         * ignored.
+         *
+         * PKCS#1, SEC1, and PKCS#8 type keys can be encrypted by using a combination of
+         * the `cipher` and `format` options. The PKCS#8 `type` can be used with any`format` to encrypt any key algorithm (RSA, EC, or DH) by specifying a`cipher`. PKCS#1 and SEC1 can only be
+         * encrypted by specifying a `cipher`when the PEM `format` is used. For maximum compatibility, use PKCS#8 for
+         * encrypted private keys. Since PKCS#8 defines its own
+         * encryption mechanism, PEM-level encryption is not supported when encrypting
+         * a PKCS#8 key. See [RFC 5208](https://www.rfc-editor.org/rfc/rfc5208.txt) for PKCS#8 encryption and [RFC 1421](https://www.rfc-editor.org/rfc/rfc1421.txt) for
+         * PKCS#1 and SEC1 encryption.
+         * @since v11.6.0
+         */
+        export(options: KeyExportOptions<'pem'>): string | Buffer;
+        export(options?: KeyExportOptions<'der'>): Buffer;
+        export(options?: JwkKeyExportOptions): JsonWebKey;
+        /**
+         * For secret keys, this property represents the size of the key in bytes. This
+         * property is `undefined` for asymmetric keys.
+         * @since v11.6.0
+         */
+        symmetricKeySize?: number | undefined;
+        /**
+         * Depending on the type of this `KeyObject`, this property is either`'secret'` for secret (symmetric) keys, `'public'` for public (asymmetric) keys
+         * or `'private'` for private (asymmetric) keys.
+         * @since v11.6.0
+         */
+        type: KeyObjectType;
+    }
+    type CipherCCMTypes = 'aes-128-ccm' | 'aes-192-ccm' | 'aes-256-ccm' | 'chacha20-poly1305';
+    type CipherGCMTypes = 'aes-128-gcm' | 'aes-192-gcm' | 'aes-256-gcm';
+    type BinaryLike = string | NodeJS.ArrayBufferView;
+    type CipherKey = BinaryLike | KeyObject;
+    interface CipherCCMOptions extends stream.TransformOptions {
+        authTagLength: number;
+    }
+    interface CipherGCMOptions extends stream.TransformOptions {
+        authTagLength?: number | undefined;
+    }
+    /**
+     * Creates and returns a `Cipher` object that uses the given `algorithm` and`password`.
+     *
+     * The `options` argument controls stream behavior and is optional except when a
+     * cipher in CCM or OCB mode is used (e.g. `'aes-128-ccm'`). In that case, the`authTagLength` option is required and specifies the length of the
+     * authentication tag in bytes, see `CCM mode`. In GCM mode, the `authTagLength`option is not required but can be used to set the length of the authentication
+     * tag that will be returned by `getAuthTag()` and defaults to 16 bytes.
+     *
+     * The `algorithm` is dependent on OpenSSL, examples are `'aes192'`, etc. On
+     * recent OpenSSL releases, `openssl list -cipher-algorithms`(`openssl list-cipher-algorithms` for older versions of OpenSSL) will
+     * display the available cipher algorithms.
+     *
+     * The `password` is used to derive the cipher key and initialization vector (IV).
+     * The value must be either a `'latin1'` encoded string, a `Buffer`, a`TypedArray`, or a `DataView`.
+     *
+     * The implementation of `crypto.createCipher()` derives keys using the OpenSSL
+     * function [`EVP_BytesToKey`](https://www.openssl.org/docs/man1.1.0/crypto/EVP_BytesToKey.html) with the digest algorithm set to MD5, one
+     * iteration, and no salt. The lack of salt allows dictionary attacks as the same
+     * password always creates the same key. The low iteration count and
+     * non-cryptographically secure hash algorithm allow passwords to be tested very
+     * rapidly.
+     *
+     * In line with OpenSSL's recommendation to use a more modern algorithm instead of [`EVP_BytesToKey`](https://www.openssl.org/docs/man1.1.0/crypto/EVP_BytesToKey.html) it is recommended that
+     * developers derive a key and IV on
+     * their own using {@link scrypt} and to use {@link createCipheriv} to create the `Cipher` object. Users should not use ciphers with counter mode
+     * (e.g. CTR, GCM, or CCM) in `crypto.createCipher()`. A warning is emitted when
+     * they are used in order to avoid the risk of IV reuse that causes
+     * vulnerabilities. For the case when IV is reused in GCM, see [Nonce-Disrespecting Adversaries](https://github.com/nonce-disrespect/nonce-disrespect) for details.
+     * @since v0.1.94
+     * @deprecated Since v10.0.0 - Use {@link createCipheriv} instead.
+     * @param options `stream.transform` options
+     */
+    function createCipher(algorithm: CipherCCMTypes, password: BinaryLike, options: CipherCCMOptions): CipherCCM;
+    /** @deprecated since v10.0.0 use `createCipheriv()` */
+    function createCipher(algorithm: CipherGCMTypes, password: BinaryLike, options?: CipherGCMOptions): CipherGCM;
+    /** @deprecated since v10.0.0 use `createCipheriv()` */
+    function createCipher(algorithm: string, password: BinaryLike, options?: stream.TransformOptions): Cipher;
+    /**
+     * Creates and returns a `Cipher` object, with the given `algorithm`, `key` and
+     * initialization vector (`iv`).
+     *
+     * The `options` argument controls stream behavior and is optional except when a
+     * cipher in CCM or OCB mode is used (e.g. `'aes-128-ccm'`). In that case, the`authTagLength` option is required and specifies the length of the
+     * authentication tag in bytes, see `CCM mode`. In GCM mode, the `authTagLength`option is not required but can be used to set the length of the authentication
+     * tag that will be returned by `getAuthTag()` and defaults to 16 bytes.
+     *
+     * The `algorithm` is dependent on OpenSSL, examples are `'aes192'`, etc. On
+     * recent OpenSSL releases, `openssl list -cipher-algorithms`(`openssl list-cipher-algorithms` for older versions of OpenSSL) will
+     * display the available cipher algorithms.
+     *
+     * The `key` is the raw key used by the `algorithm` and `iv` is an [initialization vector](https://en.wikipedia.org/wiki/Initialization_vector). Both arguments must be `'utf8'` encoded
+     * strings,`Buffers`, `TypedArray`, or `DataView`s. The `key` may optionally be
+     * a `KeyObject` of type `secret`. If the cipher does not need
+     * an initialization vector, `iv` may be `null`.
+     *
+     * When passing strings for `key` or `iv`, please consider `caveats when using strings as inputs to cryptographic APIs`.
+     *
+     * Initialization vectors should be unpredictable and unique; ideally, they will be
+     * cryptographically random. They do not have to be secret: IVs are typically just
+     * added to ciphertext messages unencrypted. It may sound contradictory that
+     * something has to be unpredictable and unique, but does not have to be secret;
+     * remember that an attacker must not be able to predict ahead of time what a
+     * given IV will be.
+     * @since v0.1.94
+     * @param options `stream.transform` options
+     */
+    function createCipheriv(algorithm: CipherCCMTypes, key: CipherKey, iv: BinaryLike | null, options: CipherCCMOptions): CipherCCM;
+    function createCipheriv(algorithm: CipherGCMTypes, key: CipherKey, iv: BinaryLike | null, options?: CipherGCMOptions): CipherGCM;
+    function createCipheriv(algorithm: string, key: CipherKey, iv: BinaryLike | null, options?: stream.TransformOptions): Cipher;
+    /**
+     * Instances of the `Cipher` class are used to encrypt data. The class can be
+     * used in one of two ways:
+     *
+     * * As a `stream` that is both readable and writable, where plain unencrypted
+     * data is written to produce encrypted data on the readable side, or
+     * * Using the `cipher.update()` and `cipher.final()` methods to produce
+     * the encrypted data.
+     *
+     * The {@link createCipher} or {@link createCipheriv} methods are
+     * used to create `Cipher` instances. `Cipher` objects are not to be created
+     * directly using the `new` keyword.
+     *
+     * Example: Using `Cipher` objects as streams:
+     *
+     * ```js
+     * const {
+     *   scrypt,
+     *   randomFill,
+     *   createCipheriv
+     * } = await import('crypto');
+     *
+     * const algorithm = 'aes-192-cbc';
+     * const password = 'Password used to generate key';
+     *
+     * // First, we'll generate the key. The key length is dependent on the algorithm.
+     * // In this case for aes192, it is 24 bytes (192 bits).
+     * scrypt(password, 'salt', 24, (err, key) => {
+     *   if (err) throw err;
+     *   // Then, we'll generate a random initialization vector
+     *   randomFill(new Uint8Array(16), (err, iv) => {
+     *     if (err) throw err;
+     *
+     *     // Once we have the key and iv, we can create and use the cipher...
+     *     const cipher = createCipheriv(algorithm, key, iv);
+     *
+     *     let encrypted = '';
+     *     cipher.setEncoding('hex');
+     *
+     *     cipher.on('data', (chunk) => encrypted += chunk);
+     *     cipher.on('end', () => console.log(encrypted));
+     *
+     *     cipher.write('some clear text data');
+     *     cipher.end();
+     *   });
+     * });
+     * ```
+     *
+     * Example: Using `Cipher` and piped streams:
+     *
+     * ```js
+     * import {
+     *   createReadStream,
+     *   createWriteStream,
+     * } from 'fs';
+     *
+     * import {
+     *   pipeline
+     * } from 'stream';
+     *
+     * const {
+     *   scrypt,
+     *   randomFill,
+     *   createCipheriv
+     * } = await import('crypto');
+     *
+     * const algorithm = 'aes-192-cbc';
+     * const password = 'Password used to generate key';
+     *
+     * // First, we'll generate the key. The key length is dependent on the algorithm.
+     * // In this case for aes192, it is 24 bytes (192 bits).
+     * scrypt(password, 'salt', 24, (err, key) => {
+     *   if (err) throw err;
+     *   // Then, we'll generate a random initialization vector
+     *   randomFill(new Uint8Array(16), (err, iv) => {
+     *     if (err) throw err;
+     *
+     *     const cipher = createCipheriv(algorithm, key, iv);
+     *
+     *     const input = createReadStream('test.js');
+     *     const output = createWriteStream('test.enc');
+     *
+     *     pipeline(input, cipher, output, (err) => {
+     *       if (err) throw err;
+     *     });
+     *   });
+     * });
+     * ```
+     *
+     * Example: Using the `cipher.update()` and `cipher.final()` methods:
+     *
+     * ```js
+     * const {
+     *   scrypt,
+     *   randomFill,
+     *   createCipheriv
+     * } = await import('crypto');
+     *
+     * const algorithm = 'aes-192-cbc';
+     * const password = 'Password used to generate key';
+     *
+     * // First, we'll generate the key. The key length is dependent on the algorithm.
+     * // In this case for aes192, it is 24 bytes (192 bits).
+     * scrypt(password, 'salt', 24, (err, key) => {
+     *   if (err) throw err;
+     *   // Then, we'll generate a random initialization vector
+     *   randomFill(new Uint8Array(16), (err, iv) => {
+     *     if (err) throw err;
+     *
+     *     const cipher = createCipheriv(algorithm, key, iv);
+     *
+     *     let encrypted = cipher.update('some clear text data', 'utf8', 'hex');
+     *     encrypted += cipher.final('hex');
+     *     console.log(encrypted);
+     *   });
+     * });
+     * ```
+     * @since v0.1.94
+     */
+    class Cipher extends stream.Transform {
+        private constructor();
+        /**
+         * Updates the cipher with `data`. If the `inputEncoding` argument is given,
+         * the `data`argument is a string using the specified encoding. If the `inputEncoding`argument is not given, `data` must be a `Buffer`, `TypedArray`, or`DataView`. If `data` is a `Buffer`,
+         * `TypedArray`, or `DataView`, then`inputEncoding` is ignored.
+         *
+         * The `outputEncoding` specifies the output format of the enciphered
+         * data. If the `outputEncoding`is specified, a string using the specified encoding is returned. If no`outputEncoding` is provided, a `Buffer` is returned.
+         *
+         * The `cipher.update()` method can be called multiple times with new data until `cipher.final()` is called. Calling `cipher.update()` after `cipher.final()` will result in an error being
+         * thrown.
+         * @since v0.1.94
+         * @param inputEncoding The `encoding` of the data.
+         * @param outputEncoding The `encoding` of the return value.
+         */
+        update(data: BinaryLike): Buffer;
+        update(data: string, inputEncoding: Encoding): Buffer;
+        update(data: NodeJS.ArrayBufferView, inputEncoding: undefined, outputEncoding: Encoding): string;
+        update(data: string, inputEncoding: Encoding | undefined, outputEncoding: Encoding): string;
+        /**
+         * Once the `cipher.final()` method has been called, the `Cipher` object can no
+         * longer be used to encrypt data. Attempts to call `cipher.final()` more than
+         * once will result in an error being thrown.
+         * @since v0.1.94
+         * @param outputEncoding The `encoding` of the return value.
+         * @return Any remaining enciphered contents. If `outputEncoding` is specified, a string is returned. If an `outputEncoding` is not provided, a {@link Buffer} is returned.
+         */
+        final(): Buffer;
+        final(outputEncoding: BufferEncoding): string;
+        /**
+         * When using block encryption algorithms, the `Cipher` class will automatically
+         * add padding to the input data to the appropriate block size. To disable the
+         * default padding call `cipher.setAutoPadding(false)`.
+         *
+         * When `autoPadding` is `false`, the length of the entire input data must be a
+         * multiple of the cipher's block size or `cipher.final()` will throw an error.
+         * Disabling automatic padding is useful for non-standard padding, for instance
+         * using `0x0` instead of PKCS padding.
+         *
+         * The `cipher.setAutoPadding()` method must be called before `cipher.final()`.
+         * @since v0.7.1
+         * @param [autoPadding=true]
+         * @return for method chaining.
+         */
+        setAutoPadding(autoPadding?: boolean): this;
+    }
+    interface CipherCCM extends Cipher {
+        setAAD(
+            buffer: NodeJS.ArrayBufferView,
+            options: {
+                plaintextLength: number;
+            }
+        ): this;
+        getAuthTag(): Buffer;
+    }
+    interface CipherGCM extends Cipher {
+        setAAD(
+            buffer: NodeJS.ArrayBufferView,
+            options?: {
+                plaintextLength: number;
+            }
+        ): this;
+        getAuthTag(): Buffer;
+    }
+    /**
+     * Creates and returns a `Decipher` object that uses the given `algorithm` and`password` (key).
+     *
+     * The `options` argument controls stream behavior and is optional except when a
+     * cipher in CCM or OCB mode is used (e.g. `'aes-128-ccm'`). In that case, the`authTagLength` option is required and specifies the length of the
+     * authentication tag in bytes, see `CCM mode`.
+     *
+     * The implementation of `crypto.createDecipher()` derives keys using the OpenSSL
+     * function [`EVP_BytesToKey`](https://www.openssl.org/docs/man1.1.0/crypto/EVP_BytesToKey.html) with the digest algorithm set to MD5, one
+     * iteration, and no salt. The lack of salt allows dictionary attacks as the same
+     * password always creates the same key. The low iteration count and
+     * non-cryptographically secure hash algorithm allow passwords to be tested very
+     * rapidly.
+     *
+     * In line with OpenSSL's recommendation to use a more modern algorithm instead of [`EVP_BytesToKey`](https://www.openssl.org/docs/man1.1.0/crypto/EVP_BytesToKey.html) it is recommended that
+     * developers derive a key and IV on
+     * their own using {@link scrypt} and to use {@link createDecipheriv} to create the `Decipher` object.
+     * @since v0.1.94
+     * @deprecated Since v10.0.0 - Use {@link createDecipheriv} instead.
+     * @param options `stream.transform` options
+     */
+    function createDecipher(algorithm: CipherCCMTypes, password: BinaryLike, options: CipherCCMOptions): DecipherCCM;
+    /** @deprecated since v10.0.0 use `createDecipheriv()` */
+    function createDecipher(algorithm: CipherGCMTypes, password: BinaryLike, options?: CipherGCMOptions): DecipherGCM;
+    /** @deprecated since v10.0.0 use `createDecipheriv()` */
+    function createDecipher(algorithm: string, password: BinaryLike, options?: stream.TransformOptions): Decipher;
+    /**
+     * Creates and returns a `Decipher` object that uses the given `algorithm`, `key`and initialization vector (`iv`).
+     *
+     * The `options` argument controls stream behavior and is optional except when a
+     * cipher in CCM or OCB mode is used (e.g. `'aes-128-ccm'`). In that case, the`authTagLength` option is required and specifies the length of the
+     * authentication tag in bytes, see `CCM mode`. In GCM mode, the `authTagLength`option is not required but can be used to restrict accepted authentication tags
+     * to those with the specified length.
+     *
+     * The `algorithm` is dependent on OpenSSL, examples are `'aes192'`, etc. On
+     * recent OpenSSL releases, `openssl list -cipher-algorithms`(`openssl list-cipher-algorithms` for older versions of OpenSSL) will
+     * display the available cipher algorithms.
+     *
+     * The `key` is the raw key used by the `algorithm` and `iv` is an [initialization vector](https://en.wikipedia.org/wiki/Initialization_vector). Both arguments must be `'utf8'` encoded
+     * strings,`Buffers`, `TypedArray`, or `DataView`s. The `key` may optionally be
+     * a `KeyObject` of type `secret`. If the cipher does not need
+     * an initialization vector, `iv` may be `null`.
+     *
+     * When passing strings for `key` or `iv`, please consider `caveats when using strings as inputs to cryptographic APIs`.
+     *
+     * Initialization vectors should be unpredictable and unique; ideally, they will be
+     * cryptographically random. They do not have to be secret: IVs are typically just
+     * added to ciphertext messages unencrypted. It may sound contradictory that
+     * something has to be unpredictable and unique, but does not have to be secret;
+     * remember that an attacker must not be able to predict ahead of time what a given
+     * IV will be.
+     * @since v0.1.94
+     * @param options `stream.transform` options
+     */
+    function createDecipheriv(algorithm: CipherCCMTypes, key: CipherKey, iv: BinaryLike | null, options: CipherCCMOptions): DecipherCCM;
+    function createDecipheriv(algorithm: CipherGCMTypes, key: CipherKey, iv: BinaryLike | null, options?: CipherGCMOptions): DecipherGCM;
+    function createDecipheriv(algorithm: string, key: CipherKey, iv: BinaryLike | null, options?: stream.TransformOptions): Decipher;
+    /**
+     * Instances of the `Decipher` class are used to decrypt data. The class can be
+     * used in one of two ways:
+     *
+     * * As a `stream` that is both readable and writable, where plain encrypted
+     * data is written to produce unencrypted data on the readable side, or
+     * * Using the `decipher.update()` and `decipher.final()` methods to
+     * produce the unencrypted data.
+     *
+     * The {@link createDecipher} or {@link createDecipheriv} methods are
+     * used to create `Decipher` instances. `Decipher` objects are not to be created
+     * directly using the `new` keyword.
+     *
+     * Example: Using `Decipher` objects as streams:
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const {
+     *   scryptSync,
+     *   createDecipheriv
+     * } = await import('crypto');
+     *
+     * const algorithm = 'aes-192-cbc';
+     * const password = 'Password used to generate key';
+     * // Key length is dependent on the algorithm. In this case for aes192, it is
+     * // 24 bytes (192 bits).
+     * // Use the async `crypto.scrypt()` instead.
+     * const key = scryptSync(password, 'salt', 24);
+     * // The IV is usually passed along with the ciphertext.
+     * const iv = Buffer.alloc(16, 0); // Initialization vector.
+     *
+     * const decipher = createDecipheriv(algorithm, key, iv);
+     *
+     * let decrypted = '';
+     * decipher.on('readable', () => {
+     *   while (null !== (chunk = decipher.read())) {
+     *     decrypted += chunk.toString('utf8');
+     *   }
+     * });
+     * decipher.on('end', () => {
+     *   console.log(decrypted);
+     *   // Prints: some clear text data
+     * });
+     *
+     * // Encrypted with same algorithm, key and iv.
+     * const encrypted =
+     *   'e5f79c5915c02171eec6b212d5520d44480993d7d622a7c4c2da32f6efda0ffa';
+     * decipher.write(encrypted, 'hex');
+     * decipher.end();
+     * ```
+     *
+     * Example: Using `Decipher` and piped streams:
+     *
+     * ```js
+     * import {
+     *   createReadStream,
+     *   createWriteStream,
+     * } from 'fs';
+     * import { Buffer } from 'buffer';
+     * const {
+     *   scryptSync,
+     *   createDecipheriv
+     * } = await import('crypto');
+     *
+     * const algorithm = 'aes-192-cbc';
+     * const password = 'Password used to generate key';
+     * // Use the async `crypto.scrypt()` instead.
+     * const key = scryptSync(password, 'salt', 24);
+     * // The IV is usually passed along with the ciphertext.
+     * const iv = Buffer.alloc(16, 0); // Initialization vector.
+     *
+     * const decipher = createDecipheriv(algorithm, key, iv);
+     *
+     * const input = createReadStream('test.enc');
+     * const output = createWriteStream('test.js');
+     *
+     * input.pipe(decipher).pipe(output);
+     * ```
+     *
+     * Example: Using the `decipher.update()` and `decipher.final()` methods:
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const {
+     *   scryptSync,
+     *   createDecipheriv
+     * } = await import('crypto');
+     *
+     * const algorithm = 'aes-192-cbc';
+     * const password = 'Password used to generate key';
+     * // Use the async `crypto.scrypt()` instead.
+     * const key = scryptSync(password, 'salt', 24);
+     * // The IV is usually passed along with the ciphertext.
+     * const iv = Buffer.alloc(16, 0); // Initialization vector.
+     *
+     * const decipher = createDecipheriv(algorithm, key, iv);
+     *
+     * // Encrypted using same algorithm, key and iv.
+     * const encrypted =
+     *   'e5f79c5915c02171eec6b212d5520d44480993d7d622a7c4c2da32f6efda0ffa';
+     * let decrypted = decipher.update(encrypted, 'hex', 'utf8');
+     * decrypted += decipher.final('utf8');
+     * console.log(decrypted);
+     * // Prints: some clear text data
+     * ```
+     * @since v0.1.94
+     */
+    class Decipher extends stream.Transform {
+        private constructor();
+        /**
+         * Updates the decipher with `data`. If the `inputEncoding` argument is given,
+         * the `data`argument is a string using the specified encoding. If the `inputEncoding`argument is not given, `data` must be a `Buffer`. If `data` is a `Buffer` then `inputEncoding` is
+         * ignored.
+         *
+         * The `outputEncoding` specifies the output format of the enciphered
+         * data. If the `outputEncoding`is specified, a string using the specified encoding is returned. If no`outputEncoding` is provided, a `Buffer` is returned.
+         *
+         * The `decipher.update()` method can be called multiple times with new data until `decipher.final()` is called. Calling `decipher.update()` after `decipher.final()` will result in an error
+         * being thrown.
+         * @since v0.1.94
+         * @param inputEncoding The `encoding` of the `data` string.
+         * @param outputEncoding The `encoding` of the return value.
+         */
+        update(data: NodeJS.ArrayBufferView): Buffer;
+        update(data: string, inputEncoding: Encoding): Buffer;
+        update(data: NodeJS.ArrayBufferView, inputEncoding: undefined, outputEncoding: Encoding): string;
+        update(data: string, inputEncoding: Encoding | undefined, outputEncoding: Encoding): string;
+        /**
+         * Once the `decipher.final()` method has been called, the `Decipher` object can
+         * no longer be used to decrypt data. Attempts to call `decipher.final()` more
+         * than once will result in an error being thrown.
+         * @since v0.1.94
+         * @param outputEncoding The `encoding` of the return value.
+         * @return Any remaining deciphered contents. If `outputEncoding` is specified, a string is returned. If an `outputEncoding` is not provided, a {@link Buffer} is returned.
+         */
+        final(): Buffer;
+        final(outputEncoding: BufferEncoding): string;
+        /**
+         * When data has been encrypted without standard block padding, calling`decipher.setAutoPadding(false)` will disable automatic padding to prevent `decipher.final()` from checking for and
+         * removing padding.
+         *
+         * Turning auto padding off will only work if the input data's length is a
+         * multiple of the ciphers block size.
+         *
+         * The `decipher.setAutoPadding()` method must be called before `decipher.final()`.
+         * @since v0.7.1
+         * @param [autoPadding=true]
+         * @return for method chaining.
+         */
+        setAutoPadding(auto_padding?: boolean): this;
+    }
+    interface DecipherCCM extends Decipher {
+        setAuthTag(buffer: NodeJS.ArrayBufferView): this;
+        setAAD(
+            buffer: NodeJS.ArrayBufferView,
+            options: {
+                plaintextLength: number;
+            }
+        ): this;
+    }
+    interface DecipherGCM extends Decipher {
+        setAuthTag(buffer: NodeJS.ArrayBufferView): this;
+        setAAD(
+            buffer: NodeJS.ArrayBufferView,
+            options?: {
+                plaintextLength: number;
+            }
+        ): this;
+    }
+    interface PrivateKeyInput {
+        key: string | Buffer;
+        format?: KeyFormat | undefined;
+        type?: 'pkcs1' | 'pkcs8' | 'sec1' | undefined;
+        passphrase?: string | Buffer | undefined;
+    }
+    interface PublicKeyInput {
+        key: string | Buffer;
+        format?: KeyFormat | undefined;
+        type?: 'pkcs1' | 'spki' | undefined;
+    }
+    /**
+     * Asynchronously generates a new random secret key of the given `length`. The`type` will determine which validations will be performed on the `length`.
+     *
+     * ```js
+     * const {
+     *   generateKey
+     * } = await import('crypto');
+     *
+     * generateKey('hmac', { length: 64 }, (err, key) => {
+     *   if (err) throw err;
+     *   console.log(key.export().toString('hex'));  // 46e..........620
+     * });
+     * ```
+     * @since v15.0.0
+     * @param type The intended use of the generated secret key. Currently accepted values are `'hmac'` and `'aes'`.
+     */
+    function generateKey(
+        type: 'hmac' | 'aes',
+        options: {
+            length: number;
+        },
+        callback: (err: Error | null, key: KeyObject) => void
+    ): void;
+    /**
+     * Synchronously generates a new random secret key of the given `length`. The`type` will determine which validations will be performed on the `length`.
+     *
+     * ```js
+     * const {
+     *   generateKeySync
+     * } = await import('crypto');
+     *
+     * const key = generateKeySync('hmac', { length: 64 });
+     * console.log(key.export().toString('hex'));  // e89..........41e
+     * ```
+     * @since v15.0.0
+     * @param type The intended use of the generated secret key. Currently accepted values are `'hmac'` and `'aes'`.
+     */
+    function generateKeySync(
+        type: 'hmac' | 'aes',
+        options: {
+            length: number;
+        }
+    ): KeyObject;
+    interface JsonWebKeyInput {
+        key: JsonWebKey;
+        format: 'jwk';
+    }
+    /**
+     * Creates and returns a new key object containing a private key. If `key` is a
+     * string or `Buffer`, `format` is assumed to be `'pem'`; otherwise, `key`must be an object with the properties described above.
+     *
+     * If the private key is encrypted, a `passphrase` must be specified. The length
+     * of the passphrase is limited to 1024 bytes.
+     * @since v11.6.0
+     */
+    function createPrivateKey(key: PrivateKeyInput | string | Buffer | JsonWebKeyInput): KeyObject;
+    /**
+     * Creates and returns a new key object containing a public key. If `key` is a
+     * string or `Buffer`, `format` is assumed to be `'pem'`; if `key` is a `KeyObject`with type `'private'`, the public key is derived from the given private key;
+     * otherwise, `key` must be an object with the properties described above.
+     *
+     * If the format is `'pem'`, the `'key'` may also be an X.509 certificate.
+     *
+     * Because public keys can be derived from private keys, a private key may be
+     * passed instead of a public key. In that case, this function behaves as if {@link createPrivateKey} had been called, except that the type of the
+     * returned `KeyObject` will be `'public'` and that the private key cannot be
+     * extracted from the returned `KeyObject`. Similarly, if a `KeyObject` with type`'private'` is given, a new `KeyObject` with type `'public'` will be returned
+     * and it will be impossible to extract the private key from the returned object.
+     * @since v11.6.0
+     */
+    function createPublicKey(key: PublicKeyInput | string | Buffer | KeyObject | JsonWebKeyInput): KeyObject;
+    /**
+     * Creates and returns a new key object containing a secret key for symmetric
+     * encryption or `Hmac`.
+     * @since v11.6.0
+     * @param encoding The string encoding when `key` is a string.
+     */
+    function createSecretKey(key: NodeJS.ArrayBufferView): KeyObject;
+    function createSecretKey(key: string, encoding: BufferEncoding): KeyObject;
+    /**
+     * Creates and returns a `Sign` object that uses the given `algorithm`. Use {@link getHashes} to obtain the names of the available digest algorithms.
+     * Optional `options` argument controls the `stream.Writable` behavior.
+     *
+     * In some cases, a `Sign` instance can be created using the name of a signature
+     * algorithm, such as `'RSA-SHA256'`, instead of a digest algorithm. This will use
+     * the corresponding digest algorithm. This does not work for all signature
+     * algorithms, such as `'ecdsa-with-SHA256'`, so it is best to always use digest
+     * algorithm names.
+     * @since v0.1.92
+     * @param options `stream.Writable` options
+     */
+    function createSign(algorithm: string, options?: stream.WritableOptions): Sign;
+    type DSAEncoding = 'der' | 'ieee-p1363';
+    interface SigningOptions {
+        /**
+         * @See crypto.constants.RSA_PKCS1_PADDING
+         */
+        padding?: number | undefined;
+        saltLength?: number | undefined;
+        dsaEncoding?: DSAEncoding | undefined;
+    }
+    interface SignPrivateKeyInput extends PrivateKeyInput, SigningOptions {}
+    interface SignKeyObjectInput extends SigningOptions {
+        key: KeyObject;
+    }
+    interface VerifyPublicKeyInput extends PublicKeyInput, SigningOptions {}
+    interface VerifyKeyObjectInput extends SigningOptions {
+        key: KeyObject;
+    }
+    type KeyLike = string | Buffer | KeyObject;
+    /**
+     * The `Sign` class is a utility for generating signatures. It can be used in one
+     * of two ways:
+     *
+     * * As a writable `stream`, where data to be signed is written and the `sign.sign()` method is used to generate and return the signature, or
+     * * Using the `sign.update()` and `sign.sign()` methods to produce the
+     * signature.
+     *
+     * The {@link createSign} method is used to create `Sign` instances. The
+     * argument is the string name of the hash function to use. `Sign` objects are not
+     * to be created directly using the `new` keyword.
+     *
+     * Example: Using `Sign` and `Verify` objects as streams:
+     *
+     * ```js
+     * const {
+     *   generateKeyPairSync,
+     *   createSign,
+     *   createVerify
+     * } = await import('crypto');
+     *
+     * const { privateKey, publicKey } = generateKeyPairSync('ec', {
+     *   namedCurve: 'sect239k1'
+     * });
+     *
+     * const sign = createSign('SHA256');
+     * sign.write('some data to sign');
+     * sign.end();
+     * const signature = sign.sign(privateKey, 'hex');
+     *
+     * const verify = createVerify('SHA256');
+     * verify.write('some data to sign');
+     * verify.end();
+     * console.log(verify.verify(publicKey, signature, 'hex'));
+     * // Prints: true
+     * ```
+     *
+     * Example: Using the `sign.update()` and `verify.update()` methods:
+     *
+     * ```js
+     * const {
+     *   generateKeyPairSync,
+     *   createSign,
+     *   createVerify
+     * } = await import('crypto');
+     *
+     * const { privateKey, publicKey } = generateKeyPairSync('rsa', {
+     *   modulusLength: 2048,
+     * });
+     *
+     * const sign = createSign('SHA256');
+     * sign.update('some data to sign');
+     * sign.end();
+     * const signature = sign.sign(privateKey);
+     *
+     * const verify = createVerify('SHA256');
+     * verify.update('some data to sign');
+     * verify.end();
+     * console.log(verify.verify(publicKey, signature));
+     * // Prints: true
+     * ```
+     * @since v0.1.92
+     */
+    class Sign extends stream.Writable {
+        private constructor();
+        /**
+         * Updates the `Sign` content with the given `data`, the encoding of which
+         * is given in `inputEncoding`.
+         * If `encoding` is not provided, and the `data` is a string, an
+         * encoding of `'utf8'` is enforced. If `data` is a `Buffer`, `TypedArray`, or`DataView`, then `inputEncoding` is ignored.
+         *
+         * This can be called many times with new data as it is streamed.
+         * @since v0.1.92
+         * @param inputEncoding The `encoding` of the `data` string.
+         */
+        update(data: BinaryLike): this;
+        update(data: string, inputEncoding: Encoding): this;
+        /**
+         * Calculates the signature on all the data passed through using either `sign.update()` or `sign.write()`.
+         *
+         * If `privateKey` is not a `KeyObject`, this function behaves as if`privateKey` had been passed to {@link createPrivateKey}. If it is an
+         * object, the following additional properties can be passed:
+         *
+         * If `outputEncoding` is provided a string is returned; otherwise a `Buffer` is returned.
+         *
+         * The `Sign` object can not be again used after `sign.sign()` method has been
+         * called. Multiple calls to `sign.sign()` will result in an error being thrown.
+         * @since v0.1.92
+         */
+        sign(privateKey: KeyLike | SignKeyObjectInput | SignPrivateKeyInput): Buffer;
+        sign(privateKey: KeyLike | SignKeyObjectInput | SignPrivateKeyInput, outputFormat: BinaryToTextEncoding): string;
+    }
+    /**
+     * Creates and returns a `Verify` object that uses the given algorithm.
+     * Use {@link getHashes} to obtain an array of names of the available
+     * signing algorithms. Optional `options` argument controls the`stream.Writable` behavior.
+     *
+     * In some cases, a `Verify` instance can be created using the name of a signature
+     * algorithm, such as `'RSA-SHA256'`, instead of a digest algorithm. This will use
+     * the corresponding digest algorithm. This does not work for all signature
+     * algorithms, such as `'ecdsa-with-SHA256'`, so it is best to always use digest
+     * algorithm names.
+     * @since v0.1.92
+     * @param options `stream.Writable` options
+     */
+    function createVerify(algorithm: string, options?: stream.WritableOptions): Verify;
+    /**
+     * The `Verify` class is a utility for verifying signatures. It can be used in one
+     * of two ways:
+     *
+     * * As a writable `stream` where written data is used to validate against the
+     * supplied signature, or
+     * * Using the `verify.update()` and `verify.verify()` methods to verify
+     * the signature.
+     *
+     * The {@link createVerify} method is used to create `Verify` instances.`Verify` objects are not to be created directly using the `new` keyword.
+     *
+     * See `Sign` for examples.
+     * @since v0.1.92
+     */
+    class Verify extends stream.Writable {
+        private constructor();
+        /**
+         * Updates the `Verify` content with the given `data`, the encoding of which
+         * is given in `inputEncoding`.
+         * If `inputEncoding` is not provided, and the `data` is a string, an
+         * encoding of `'utf8'` is enforced. If `data` is a `Buffer`, `TypedArray`, or`DataView`, then `inputEncoding` is ignored.
+         *
+         * This can be called many times with new data as it is streamed.
+         * @since v0.1.92
+         * @param inputEncoding The `encoding` of the `data` string.
+         */
+        update(data: BinaryLike): Verify;
+        update(data: string, inputEncoding: Encoding): Verify;
+        /**
+         * Verifies the provided data using the given `object` and `signature`.
+         *
+         * If `object` is not a `KeyObject`, this function behaves as if`object` had been passed to {@link createPublicKey}. If it is an
+         * object, the following additional properties can be passed:
+         *
+         * The `signature` argument is the previously calculated signature for the data, in
+         * the `signatureEncoding`.
+         * If a `signatureEncoding` is specified, the `signature` is expected to be a
+         * string; otherwise `signature` is expected to be a `Buffer`,`TypedArray`, or `DataView`.
+         *
+         * The `verify` object can not be used again after `verify.verify()` has been
+         * called. Multiple calls to `verify.verify()` will result in an error being
+         * thrown.
+         *
+         * Because public keys can be derived from private keys, a private key may
+         * be passed instead of a public key.
+         * @since v0.1.92
+         */
+        verify(object: KeyLike | VerifyKeyObjectInput | VerifyPublicKeyInput, signature: NodeJS.ArrayBufferView): boolean;
+        verify(object: KeyLike | VerifyKeyObjectInput | VerifyPublicKeyInput, signature: string, signature_format?: BinaryToTextEncoding): boolean;
+    }
+    /**
+     * Creates a `DiffieHellman` key exchange object using the supplied `prime` and an
+     * optional specific `generator`.
+     *
+     * The `generator` argument can be a number, string, or `Buffer`. If`generator` is not specified, the value `2` is used.
+     *
+     * If `primeEncoding` is specified, `prime` is expected to be a string; otherwise
+     * a `Buffer`, `TypedArray`, or `DataView` is expected.
+     *
+     * If `generatorEncoding` is specified, `generator` is expected to be a string;
+     * otherwise a number, `Buffer`, `TypedArray`, or `DataView` is expected.
+     * @since v0.11.12
+     * @param primeEncoding The `encoding` of the `prime` string.
+     * @param [generator=2]
+     * @param generatorEncoding The `encoding` of the `generator` string.
+     */
+    function createDiffieHellman(primeLength: number, generator?: number | NodeJS.ArrayBufferView): DiffieHellman;
+    function createDiffieHellman(prime: NodeJS.ArrayBufferView): DiffieHellman;
+    function createDiffieHellman(prime: string, primeEncoding: BinaryToTextEncoding): DiffieHellman;
+    function createDiffieHellman(prime: string, primeEncoding: BinaryToTextEncoding, generator: number | NodeJS.ArrayBufferView): DiffieHellman;
+    function createDiffieHellman(prime: string, primeEncoding: BinaryToTextEncoding, generator: string, generatorEncoding: BinaryToTextEncoding): DiffieHellman;
+    /**
+     * The `DiffieHellman` class is a utility for creating Diffie-Hellman key
+     * exchanges.
+     *
+     * Instances of the `DiffieHellman` class can be created using the {@link createDiffieHellman} function.
+     *
+     * ```js
+     * import assert from 'assert';
+     *
+     * const {
+     *   createDiffieHellman
+     * } = await import('crypto');
+     *
+     * // Generate Alice's keys...
+     * const alice = createDiffieHellman(2048);
+     * const aliceKey = alice.generateKeys();
+     *
+     * // Generate Bob's keys...
+     * const bob = createDiffieHellman(alice.getPrime(), alice.getGenerator());
+     * const bobKey = bob.generateKeys();
+     *
+     * // Exchange and generate the secret...
+     * const aliceSecret = alice.computeSecret(bobKey);
+     * const bobSecret = bob.computeSecret(aliceKey);
+     *
+     * // OK
+     * assert.strictEqual(aliceSecret.toString('hex'), bobSecret.toString('hex'));
+     * ```
+     * @since v0.5.0
+     */
+    class DiffieHellman {
+        private constructor();
+        /**
+         * Generates private and public Diffie-Hellman key values, and returns
+         * the public key in the specified `encoding`. This key should be
+         * transferred to the other party.
+         * If `encoding` is provided a string is returned; otherwise a `Buffer` is returned.
+         * @since v0.5.0
+         * @param encoding The `encoding` of the return value.
+         */
+        generateKeys(): Buffer;
+        generateKeys(encoding: BinaryToTextEncoding): string;
+        /**
+         * Computes the shared secret using `otherPublicKey` as the other
+         * party's public key and returns the computed shared secret. The supplied
+         * key is interpreted using the specified `inputEncoding`, and secret is
+         * encoded using specified `outputEncoding`.
+         * If the `inputEncoding` is not
+         * provided, `otherPublicKey` is expected to be a `Buffer`,`TypedArray`, or `DataView`.
+         *
+         * If `outputEncoding` is given a string is returned; otherwise, a `Buffer` is returned.
+         * @since v0.5.0
+         * @param inputEncoding The `encoding` of an `otherPublicKey` string.
+         * @param outputEncoding The `encoding` of the return value.
+         */
+        computeSecret(otherPublicKey: NodeJS.ArrayBufferView): Buffer;
+        computeSecret(otherPublicKey: string, inputEncoding: BinaryToTextEncoding): Buffer;
+        computeSecret(otherPublicKey: NodeJS.ArrayBufferView, outputEncoding: BinaryToTextEncoding): string;
+        computeSecret(otherPublicKey: string, inputEncoding: BinaryToTextEncoding, outputEncoding: BinaryToTextEncoding): string;
+        /**
+         * Returns the Diffie-Hellman prime in the specified `encoding`.
+         * If `encoding` is provided a string is
+         * returned; otherwise a `Buffer` is returned.
+         * @since v0.5.0
+         * @param encoding The `encoding` of the return value.
+         */
+        getPrime(): Buffer;
+        getPrime(encoding: BinaryToTextEncoding): string;
+        /**
+         * Returns the Diffie-Hellman generator in the specified `encoding`.
+         * If `encoding` is provided a string is
+         * returned; otherwise a `Buffer` is returned.
+         * @since v0.5.0
+         * @param encoding The `encoding` of the return value.
+         */
+        getGenerator(): Buffer;
+        getGenerator(encoding: BinaryToTextEncoding): string;
+        /**
+         * Returns the Diffie-Hellman public key in the specified `encoding`.
+         * If `encoding` is provided a
+         * string is returned; otherwise a `Buffer` is returned.
+         * @since v0.5.0
+         * @param encoding The `encoding` of the return value.
+         */
+        getPublicKey(): Buffer;
+        getPublicKey(encoding: BinaryToTextEncoding): string;
+        /**
+         * Returns the Diffie-Hellman private key in the specified `encoding`.
+         * If `encoding` is provided a
+         * string is returned; otherwise a `Buffer` is returned.
+         * @since v0.5.0
+         * @param encoding The `encoding` of the return value.
+         */
+        getPrivateKey(): Buffer;
+        getPrivateKey(encoding: BinaryToTextEncoding): string;
+        /**
+         * Sets the Diffie-Hellman public key. If the `encoding` argument is provided,`publicKey` is expected
+         * to be a string. If no `encoding` is provided, `publicKey` is expected
+         * to be a `Buffer`, `TypedArray`, or `DataView`.
+         * @since v0.5.0
+         * @param encoding The `encoding` of the `publicKey` string.
+         */
+        setPublicKey(publicKey: NodeJS.ArrayBufferView): void;
+        setPublicKey(publicKey: string, encoding: BufferEncoding): void;
+        /**
+         * Sets the Diffie-Hellman private key. If the `encoding` argument is provided,`privateKey` is expected
+         * to be a string. If no `encoding` is provided, `privateKey` is expected
+         * to be a `Buffer`, `TypedArray`, or `DataView`.
+         * @since v0.5.0
+         * @param encoding The `encoding` of the `privateKey` string.
+         */
+        setPrivateKey(privateKey: NodeJS.ArrayBufferView): void;
+        setPrivateKey(privateKey: string, encoding: BufferEncoding): void;
+        /**
+         * A bit field containing any warnings and/or errors resulting from a check
+         * performed during initialization of the `DiffieHellman` object.
+         *
+         * The following values are valid for this property (as defined in `constants`module):
+         *
+         * * `DH_CHECK_P_NOT_SAFE_PRIME`
+         * * `DH_CHECK_P_NOT_PRIME`
+         * * `DH_UNABLE_TO_CHECK_GENERATOR`
+         * * `DH_NOT_SUITABLE_GENERATOR`
+         * @since v0.11.12
+         */
+        verifyError: number;
+    }
+    /**
+     * Creates a predefined `DiffieHellmanGroup` key exchange object. The
+     * supported groups are: `'modp1'`, `'modp2'`, `'modp5'` (defined in [RFC 2412](https://www.rfc-editor.org/rfc/rfc2412.txt), but see `Caveats`) and `'modp14'`, `'modp15'`,`'modp16'`, `'modp17'`,
+     * `'modp18'` (defined in [RFC 3526](https://www.rfc-editor.org/rfc/rfc3526.txt)). The
+     * returned object mimics the interface of objects created by {@link createDiffieHellman}, but will not allow changing
+     * the keys (with `diffieHellman.setPublicKey()`, for example). The
+     * advantage of using this method is that the parties do not have to
+     * generate nor exchange a group modulus beforehand, saving both processor
+     * and communication time.
+     *
+     * Example (obtaining a shared secret):
+     *
+     * ```js
+     * const {
+     *   getDiffieHellman
+     * } = await import('crypto');
+     * const alice = getDiffieHellman('modp14');
+     * const bob = getDiffieHellman('modp14');
+     *
+     * alice.generateKeys();
+     * bob.generateKeys();
+     *
+     * const aliceSecret = alice.computeSecret(bob.getPublicKey(), null, 'hex');
+     * const bobSecret = bob.computeSecret(alice.getPublicKey(), null, 'hex');
+     *
+     * // aliceSecret and bobSecret should be the same
+     * console.log(aliceSecret === bobSecret);
+     * ```
+     * @since v0.7.5
+     */
+    function getDiffieHellman(groupName: string): DiffieHellman;
+    /**
+     * Provides an asynchronous Password-Based Key Derivation Function 2 (PBKDF2)
+     * implementation. A selected HMAC digest algorithm specified by `digest` is
+     * applied to derive a key of the requested byte length (`keylen`) from the`password`, `salt` and `iterations`.
+     *
+     * The supplied `callback` function is called with two arguments: `err` and`derivedKey`. If an error occurs while deriving the key, `err` will be set;
+     * otherwise `err` will be `null`. By default, the successfully generated`derivedKey` will be passed to the callback as a `Buffer`. An error will be
+     * thrown if any of the input arguments specify invalid values or types.
+     *
+     * If `digest` is `null`, `'sha1'` will be used. This behavior is deprecated,
+     * please specify a `digest` explicitly.
+     *
+     * The `iterations` argument must be a number set as high as possible. The
+     * higher the number of iterations, the more secure the derived key will be,
+     * but will take a longer amount of time to complete.
+     *
+     * The `salt` should be as unique as possible. It is recommended that a salt is
+     * random and at least 16 bytes long. See [NIST SP 800-132](https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-132.pdf) for details.
+     *
+     * When passing strings for `password` or `salt`, please consider `caveats when using strings as inputs to cryptographic APIs`.
+     *
+     * ```js
+     * const {
+     *   pbkdf2
+     * } = await import('crypto');
+     *
+     * pbkdf2('secret', 'salt', 100000, 64, 'sha512', (err, derivedKey) => {
+     *   if (err) throw err;
+     *   console.log(derivedKey.toString('hex'));  // '3745e48...08d59ae'
+     * });
+     * ```
+     *
+     * The `crypto.DEFAULT_ENCODING` property can be used to change the way the`derivedKey` is passed to the callback. This property, however, has been
+     * deprecated and use should be avoided.
+     *
+     * ```js
+     * import crypto from 'crypto';
+     * crypto.DEFAULT_ENCODING = 'hex';
+     * crypto.pbkdf2('secret', 'salt', 100000, 512, 'sha512', (err, derivedKey) => {
+     *   if (err) throw err;
+     *   console.log(derivedKey);  // '3745e48...aa39b34'
+     * });
+     * ```
+     *
+     * An array of supported digest functions can be retrieved using {@link getHashes}.
+     *
+     * This API uses libuv's threadpool, which can have surprising and
+     * negative performance implications for some applications; see the `UV_THREADPOOL_SIZE` documentation for more information.
+     * @since v0.5.5
+     */
+    function pbkdf2(password: BinaryLike, salt: BinaryLike, iterations: number, keylen: number, digest: string, callback: (err: Error | null, derivedKey: Buffer) => void): void;
+    /**
+     * Provides a synchronous Password-Based Key Derivation Function 2 (PBKDF2)
+     * implementation. A selected HMAC digest algorithm specified by `digest` is
+     * applied to derive a key of the requested byte length (`keylen`) from the`password`, `salt` and `iterations`.
+     *
+     * If an error occurs an `Error` will be thrown, otherwise the derived key will be
+     * returned as a `Buffer`.
+     *
+     * If `digest` is `null`, `'sha1'` will be used. This behavior is deprecated,
+     * please specify a `digest` explicitly.
+     *
+     * The `iterations` argument must be a number set as high as possible. The
+     * higher the number of iterations, the more secure the derived key will be,
+     * but will take a longer amount of time to complete.
+     *
+     * The `salt` should be as unique as possible. It is recommended that a salt is
+     * random and at least 16 bytes long. See [NIST SP 800-132](https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-132.pdf) for details.
+     *
+     * When passing strings for `password` or `salt`, please consider `caveats when using strings as inputs to cryptographic APIs`.
+     *
+     * ```js
+     * const {
+     *   pbkdf2Sync
+     * } = await import('crypto');
+     *
+     * const key = pbkdf2Sync('secret', 'salt', 100000, 64, 'sha512');
+     * console.log(key.toString('hex'));  // '3745e48...08d59ae'
+     * ```
+     *
+     * The `crypto.DEFAULT_ENCODING` property may be used to change the way the`derivedKey` is returned. This property, however, is deprecated and use
+     * should be avoided.
+     *
+     * ```js
+     * import crypto from 'crypto';
+     * crypto.DEFAULT_ENCODING = 'hex';
+     * const key = crypto.pbkdf2Sync('secret', 'salt', 100000, 512, 'sha512');
+     * console.log(key);  // '3745e48...aa39b34'
+     * ```
+     *
+     * An array of supported digest functions can be retrieved using {@link getHashes}.
+     * @since v0.9.3
+     */
+    function pbkdf2Sync(password: BinaryLike, salt: BinaryLike, iterations: number, keylen: number, digest: string): Buffer;
+    /**
+     * Generates cryptographically strong pseudorandom data. The `size` argument
+     * is a number indicating the number of bytes to generate.
+     *
+     * If a `callback` function is provided, the bytes are generated asynchronously
+     * and the `callback` function is invoked with two arguments: `err` and `buf`.
+     * If an error occurs, `err` will be an `Error` object; otherwise it is `null`. The`buf` argument is a `Buffer` containing the generated bytes.
+     *
+     * ```js
+     * // Asynchronous
+     * const {
+     *   randomBytes
+     * } = await import('crypto');
+     *
+     * randomBytes(256, (err, buf) => {
+     *   if (err) throw err;
+     *   console.log(`${buf.length} bytes of random data: ${buf.toString('hex')}`);
+     * });
+     * ```
+     *
+     * If the `callback` function is not provided, the random bytes are generated
+     * synchronously and returned as a `Buffer`. An error will be thrown if
+     * there is a problem generating the bytes.
+     *
+     * ```js
+     * // Synchronous
+     * const {
+     *   randomBytes
+     * } = await import('crypto');
+     *
+     * const buf = randomBytes(256);
+     * console.log(
+     *   `${buf.length} bytes of random data: ${buf.toString('hex')}`);
+     * ```
+     *
+     * The `crypto.randomBytes()` method will not complete until there is
+     * sufficient entropy available.
+     * This should normally never take longer than a few milliseconds. The only time
+     * when generating the random bytes may conceivably block for a longer period of
+     * time is right after boot, when the whole system is still low on entropy.
+     *
+     * This API uses libuv's threadpool, which can have surprising and
+     * negative performance implications for some applications; see the `UV_THREADPOOL_SIZE` documentation for more information.
+     *
+     * The asynchronous version of `crypto.randomBytes()` is carried out in a single
+     * threadpool request. To minimize threadpool task length variation, partition
+     * large `randomBytes` requests when doing so as part of fulfilling a client
+     * request.
+     * @since v0.5.8
+     * @param size The number of bytes to generate. The `size` must not be larger than `2**31 - 1`.
+     * @return if the `callback` function is not provided.
+     */
+    function randomBytes(size: number): Buffer;
+    function randomBytes(size: number, callback: (err: Error | null, buf: Buffer) => void): void;
+    function pseudoRandomBytes(size: number): Buffer;
+    function pseudoRandomBytes(size: number, callback: (err: Error | null, buf: Buffer) => void): void;
+    /**
+     * Return a random integer `n` such that `min <= n < max`.  This
+     * implementation avoids [modulo bias](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#Modulo_bias).
+     *
+     * The range (`max - min`) must be less than 248. `min` and `max` must
+     * be [safe integers](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/isSafeInteger).
+     *
+     * If the `callback` function is not provided, the random integer is
+     * generated synchronously.
+     *
+     * ```js
+     * // Asynchronous
+     * const {
+     *   randomInt
+     * } = await import('crypto');
+     *
+     * randomInt(3, (err, n) => {
+     *   if (err) throw err;
+     *   console.log(`Random number chosen from (0, 1, 2): ${n}`);
+     * });
+     * ```
+     *
+     * ```js
+     * // Synchronous
+     * const {
+     *   randomInt
+     * } = await import('crypto');
+     *
+     * const n = randomInt(3);
+     * console.log(`Random number chosen from (0, 1, 2): ${n}`);
+     * ```
+     *
+     * ```js
+     * // With `min` argument
+     * const {
+     *   randomInt
+     * } = await import('crypto');
+     *
+     * const n = randomInt(1, 7);
+     * console.log(`The dice rolled: ${n}`);
+     * ```
+     * @since v14.10.0, v12.19.0
+     * @param [min=0] Start of random range (inclusive).
+     * @param max End of random range (exclusive).
+     * @param callback `function(err, n) {}`.
+     */
+    function randomInt(max: number): number;
+    function randomInt(min: number, max: number): number;
+    function randomInt(max: number, callback: (err: Error | null, value: number) => void): void;
+    function randomInt(min: number, max: number, callback: (err: Error | null, value: number) => void): void;
+    /**
+     * Synchronous version of {@link randomFill}.
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const { randomFillSync } = await import('crypto');
+     *
+     * const buf = Buffer.alloc(10);
+     * console.log(randomFillSync(buf).toString('hex'));
+     *
+     * randomFillSync(buf, 5);
+     * console.log(buf.toString('hex'));
+     *
+     * // The above is equivalent to the following:
+     * randomFillSync(buf, 5, 5);
+     * console.log(buf.toString('hex'));
+     * ```
+     *
+     * Any `ArrayBuffer`, `TypedArray` or `DataView` instance may be passed as`buffer`.
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const { randomFillSync } = await import('crypto');
+     *
+     * const a = new Uint32Array(10);
+     * console.log(Buffer.from(randomFillSync(a).buffer,
+     *                         a.byteOffset, a.byteLength).toString('hex'));
+     *
+     * const b = new DataView(new ArrayBuffer(10));
+     * console.log(Buffer.from(randomFillSync(b).buffer,
+     *                         b.byteOffset, b.byteLength).toString('hex'));
+     *
+     * const c = new ArrayBuffer(10);
+     * console.log(Buffer.from(randomFillSync(c)).toString('hex'));
+     * ```
+     * @since v7.10.0, v6.13.0
+     * @param buffer Must be supplied. The size of the provided `buffer` must not be larger than `2**31 - 1`.
+     * @param [offset=0]
+     * @param [size=buffer.length - offset]
+     * @return The object passed as `buffer` argument.
+     */
+    function randomFillSync<T extends NodeJS.ArrayBufferView>(buffer: T, offset?: number, size?: number): T;
+    /**
+     * This function is similar to {@link randomBytes} but requires the first
+     * argument to be a `Buffer` that will be filled. It also
+     * requires that a callback is passed in.
+     *
+     * If the `callback` function is not provided, an error will be thrown.
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const { randomFill } = await import('crypto');
+     *
+     * const buf = Buffer.alloc(10);
+     * randomFill(buf, (err, buf) => {
+     *   if (err) throw err;
+     *   console.log(buf.toString('hex'));
+     * });
+     *
+     * randomFill(buf, 5, (err, buf) => {
+     *   if (err) throw err;
+     *   console.log(buf.toString('hex'));
+     * });
+     *
+     * // The above is equivalent to the following:
+     * randomFill(buf, 5, 5, (err, buf) => {
+     *   if (err) throw err;
+     *   console.log(buf.toString('hex'));
+     * });
+     * ```
+     *
+     * Any `ArrayBuffer`, `TypedArray`, or `DataView` instance may be passed as`buffer`.
+     *
+     * While this includes instances of `Float32Array` and `Float64Array`, this
+     * function should not be used to generate random floating-point numbers. The
+     * result may contain `+Infinity`, `-Infinity`, and `NaN`, and even if the array
+     * contains finite numbers only, they are not drawn from a uniform random
+     * distribution and have no meaningful lower or upper bounds.
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const { randomFill } = await import('crypto');
+     *
+     * const a = new Uint32Array(10);
+     * randomFill(a, (err, buf) => {
+     *   if (err) throw err;
+     *   console.log(Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength)
+     *     .toString('hex'));
+     * });
+     *
+     * const b = new DataView(new ArrayBuffer(10));
+     * randomFill(b, (err, buf) => {
+     *   if (err) throw err;
+     *   console.log(Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength)
+     *     .toString('hex'));
+     * });
+     *
+     * const c = new ArrayBuffer(10);
+     * randomFill(c, (err, buf) => {
+     *   if (err) throw err;
+     *   console.log(Buffer.from(buf).toString('hex'));
+     * });
+     * ```
+     *
+     * This API uses libuv's threadpool, which can have surprising and
+     * negative performance implications for some applications; see the `UV_THREADPOOL_SIZE` documentation for more information.
+     *
+     * The asynchronous version of `crypto.randomFill()` is carried out in a single
+     * threadpool request. To minimize threadpool task length variation, partition
+     * large `randomFill` requests when doing so as part of fulfilling a client
+     * request.
+     * @since v7.10.0, v6.13.0
+     * @param buffer Must be supplied. The size of the provided `buffer` must not be larger than `2**31 - 1`.
+     * @param [offset=0]
+     * @param [size=buffer.length - offset]
+     * @param callback `function(err, buf) {}`.
+     */
+    function randomFill<T extends NodeJS.ArrayBufferView>(buffer: T, callback: (err: Error | null, buf: T) => void): void;
+    function randomFill<T extends NodeJS.ArrayBufferView>(buffer: T, offset: number, callback: (err: Error | null, buf: T) => void): void;
+    function randomFill<T extends NodeJS.ArrayBufferView>(buffer: T, offset: number, size: number, callback: (err: Error | null, buf: T) => void): void;
+    interface ScryptOptions {
+        cost?: number | undefined;
+        blockSize?: number | undefined;
+        parallelization?: number | undefined;
+        N?: number | undefined;
+        r?: number | undefined;
+        p?: number | undefined;
+        maxmem?: number | undefined;
+    }
+    /**
+     * Provides an asynchronous [scrypt](https://en.wikipedia.org/wiki/Scrypt) implementation. Scrypt is a password-based
+     * key derivation function that is designed to be expensive computationally and
+     * memory-wise in order to make brute-force attacks unrewarding.
+     *
+     * The `salt` should be as unique as possible. It is recommended that a salt is
+     * random and at least 16 bytes long. See [NIST SP 800-132](https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-132.pdf) for details.
+     *
+     * When passing strings for `password` or `salt`, please consider `caveats when using strings as inputs to cryptographic APIs`.
+     *
+     * The `callback` function is called with two arguments: `err` and `derivedKey`.`err` is an exception object when key derivation fails, otherwise `err` is`null`. `derivedKey` is passed to the
+     * callback as a `Buffer`.
+     *
+     * An exception is thrown when any of the input arguments specify invalid values
+     * or types.
+     *
+     * ```js
+     * const {
+     *   scrypt
+     * } = await import('crypto');
+     *
+     * // Using the factory defaults.
+     * scrypt('password', 'salt', 64, (err, derivedKey) => {
+     *   if (err) throw err;
+     *   console.log(derivedKey.toString('hex'));  // '3745e48...08d59ae'
+     * });
+     * // Using a custom N parameter. Must be a power of two.
+     * scrypt('password', 'salt', 64, { N: 1024 }, (err, derivedKey) => {
+     *   if (err) throw err;
+     *   console.log(derivedKey.toString('hex'));  // '3745e48...aa39b34'
+     * });
+     * ```
+     * @since v10.5.0
+     */
+    function scrypt(password: BinaryLike, salt: BinaryLike, keylen: number, callback: (err: Error | null, derivedKey: Buffer) => void): void;
+    function scrypt(password: BinaryLike, salt: BinaryLike, keylen: number, options: ScryptOptions, callback: (err: Error | null, derivedKey: Buffer) => void): void;
+    /**
+     * Provides a synchronous [scrypt](https://en.wikipedia.org/wiki/Scrypt) implementation. Scrypt is a password-based
+     * key derivation function that is designed to be expensive computationally and
+     * memory-wise in order to make brute-force attacks unrewarding.
+     *
+     * The `salt` should be as unique as possible. It is recommended that a salt is
+     * random and at least 16 bytes long. See [NIST SP 800-132](https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-132.pdf) for details.
+     *
+     * When passing strings for `password` or `salt`, please consider `caveats when using strings as inputs to cryptographic APIs`.
+     *
+     * An exception is thrown when key derivation fails, otherwise the derived key is
+     * returned as a `Buffer`.
+     *
+     * An exception is thrown when any of the input arguments specify invalid values
+     * or types.
+     *
+     * ```js
+     * const {
+     *   scryptSync
+     * } = await import('crypto');
+     * // Using the factory defaults.
+     *
+     * const key1 = scryptSync('password', 'salt', 64);
+     * console.log(key1.toString('hex'));  // '3745e48...08d59ae'
+     * // Using a custom N parameter. Must be a power of two.
+     * const key2 = scryptSync('password', 'salt', 64, { N: 1024 });
+     * console.log(key2.toString('hex'));  // '3745e48...aa39b34'
+     * ```
+     * @since v10.5.0
+     */
+    function scryptSync(password: BinaryLike, salt: BinaryLike, keylen: number, options?: ScryptOptions): Buffer;
+    interface RsaPublicKey {
+        key: KeyLike;
+        padding?: number | undefined;
+    }
+    interface RsaPrivateKey {
+        key: KeyLike;
+        passphrase?: string | undefined;
+        /**
+         * @default 'sha1'
+         */
+        oaepHash?: string | undefined;
+        oaepLabel?: NodeJS.TypedArray | undefined;
+        padding?: number | undefined;
+    }
+    /**
+     * Encrypts the content of `buffer` with `key` and returns a new `Buffer` with encrypted content. The returned data can be decrypted using
+     * the corresponding private key, for example using {@link privateDecrypt}.
+     *
+     * If `key` is not a `KeyObject`, this function behaves as if`key` had been passed to {@link createPublicKey}. If it is an
+     * object, the `padding` property can be passed. Otherwise, this function uses`RSA_PKCS1_OAEP_PADDING`.
+     *
+     * Because RSA public keys can be derived from private keys, a private key may
+     * be passed instead of a public key.
+     * @since v0.11.14
+     */
+    function publicEncrypt(key: RsaPublicKey | RsaPrivateKey | KeyLike, buffer: NodeJS.ArrayBufferView): Buffer;
+    /**
+     * Decrypts `buffer` with `key`.`buffer` was previously encrypted using
+     * the corresponding private key, for example using {@link privateEncrypt}.
+     *
+     * If `key` is not a `KeyObject`, this function behaves as if`key` had been passed to {@link createPublicKey}. If it is an
+     * object, the `padding` property can be passed. Otherwise, this function uses`RSA_PKCS1_PADDING`.
+     *
+     * Because RSA public keys can be derived from private keys, a private key may
+     * be passed instead of a public key.
+     * @since v1.1.0
+     */
+    function publicDecrypt(key: RsaPublicKey | RsaPrivateKey | KeyLike, buffer: NodeJS.ArrayBufferView): Buffer;
+    /**
+     * Decrypts `buffer` with `privateKey`. `buffer` was previously encrypted using
+     * the corresponding public key, for example using {@link publicEncrypt}.
+     *
+     * If `privateKey` is not a `KeyObject`, this function behaves as if`privateKey` had been passed to {@link createPrivateKey}. If it is an
+     * object, the `padding` property can be passed. Otherwise, this function uses`RSA_PKCS1_OAEP_PADDING`.
+     * @since v0.11.14
+     */
+    function privateDecrypt(privateKey: RsaPrivateKey | KeyLike, buffer: NodeJS.ArrayBufferView): Buffer;
+    /**
+     * Encrypts `buffer` with `privateKey`. The returned data can be decrypted using
+     * the corresponding public key, for example using {@link publicDecrypt}.
+     *
+     * If `privateKey` is not a `KeyObject`, this function behaves as if`privateKey` had been passed to {@link createPrivateKey}. If it is an
+     * object, the `padding` property can be passed. Otherwise, this function uses`RSA_PKCS1_PADDING`.
+     * @since v1.1.0
+     */
+    function privateEncrypt(privateKey: RsaPrivateKey | KeyLike, buffer: NodeJS.ArrayBufferView): Buffer;
+    /**
+     * ```js
+     * const {
+     *   getCiphers
+     * } = await import('crypto');
+     *
+     * console.log(getCiphers()); // ['aes-128-cbc', 'aes-128-ccm', ...]
+     * ```
+     * @since v0.9.3
+     * @return An array with the names of the supported cipher algorithms.
+     */
+    function getCiphers(): string[];
+    /**
+     * ```js
+     * const {
+     *   getCurves
+     * } = await import('crypto');
+     *
+     * console.log(getCurves()); // ['Oakley-EC2N-3', 'Oakley-EC2N-4', ...]
+     * ```
+     * @since v2.3.0
+     * @return An array with the names of the supported elliptic curves.
+     */
+    function getCurves(): string[];
+    /**
+     * @since v10.0.0
+     * @return `1` if and only if a FIPS compliant crypto provider is currently in use, `0` otherwise. A future semver-major release may change the return type of this API to a {boolean}.
+     */
+    function getFips(): 1 | 0;
+    /**
+     * ```js
+     * const {
+     *   getHashes
+     * } = await import('crypto');
+     *
+     * console.log(getHashes()); // ['DSA', 'DSA-SHA', 'DSA-SHA1', ...]
+     * ```
+     * @since v0.9.3
+     * @return An array of the names of the supported hash algorithms, such as `'RSA-SHA256'`. Hash algorithms are also called "digest" algorithms.
+     */
+    function getHashes(): string[];
+    /**
+     * The `ECDH` class is a utility for creating Elliptic Curve Diffie-Hellman (ECDH)
+     * key exchanges.
+     *
+     * Instances of the `ECDH` class can be created using the {@link createECDH} function.
+     *
+     * ```js
+     * import assert from 'assert';
+     *
+     * const {
+     *   createECDH
+     * } = await import('crypto');
+     *
+     * // Generate Alice's keys...
+     * const alice = createECDH('secp521r1');
+     * const aliceKey = alice.generateKeys();
+     *
+     * // Generate Bob's keys...
+     * const bob = createECDH('secp521r1');
+     * const bobKey = bob.generateKeys();
+     *
+     * // Exchange and generate the secret...
+     * const aliceSecret = alice.computeSecret(bobKey);
+     * const bobSecret = bob.computeSecret(aliceKey);
+     *
+     * assert.strictEqual(aliceSecret.toString('hex'), bobSecret.toString('hex'));
+     * // OK
+     * ```
+     * @since v0.11.14
+     */
+    class ECDH {
+        private constructor();
+        /**
+         * Converts the EC Diffie-Hellman public key specified by `key` and `curve` to the
+         * format specified by `format`. The `format` argument specifies point encoding
+         * and can be `'compressed'`, `'uncompressed'` or `'hybrid'`. The supplied key is
+         * interpreted using the specified `inputEncoding`, and the returned key is encoded
+         * using the specified `outputEncoding`.
+         *
+         * Use {@link getCurves} to obtain a list of available curve names.
+         * On recent OpenSSL releases, `openssl ecparam -list_curves` will also display
+         * the name and description of each available elliptic curve.
+         *
+         * If `format` is not specified the point will be returned in `'uncompressed'`format.
+         *
+         * If the `inputEncoding` is not provided, `key` is expected to be a `Buffer`,`TypedArray`, or `DataView`.
+         *
+         * Example (uncompressing a key):
+         *
+         * ```js
+         * const {
+         *   createECDH,
+         *   ECDH
+         * } = await import('crypto');
+         *
+         * const ecdh = createECDH('secp256k1');
+         * ecdh.generateKeys();
+         *
+         * const compressedKey = ecdh.getPublicKey('hex', 'compressed');
+         *
+         * const uncompressedKey = ECDH.convertKey(compressedKey,
+         *                                         'secp256k1',
+         *                                         'hex',
+         *                                         'hex',
+         *                                         'uncompressed');
+         *
+         * // The converted key and the uncompressed public key should be the same
+         * console.log(uncompressedKey === ecdh.getPublicKey('hex'));
+         * ```
+         * @since v10.0.0
+         * @param inputEncoding The `encoding` of the `key` string.
+         * @param outputEncoding The `encoding` of the return value.
+         * @param [format='uncompressed']
+         */
+        static convertKey(
+            key: BinaryLike,
+            curve: string,
+            inputEncoding?: BinaryToTextEncoding,
+            outputEncoding?: 'latin1' | 'hex' | 'base64' | 'base64url',
+            format?: 'uncompressed' | 'compressed' | 'hybrid'
+        ): Buffer | string;
+        /**
+         * Generates private and public EC Diffie-Hellman key values, and returns
+         * the public key in the specified `format` and `encoding`. This key should be
+         * transferred to the other party.
+         *
+         * The `format` argument specifies point encoding and can be `'compressed'` or`'uncompressed'`. If `format` is not specified, the point will be returned in`'uncompressed'` format.
+         *
+         * If `encoding` is provided a string is returned; otherwise a `Buffer` is returned.
+         * @since v0.11.14
+         * @param encoding The `encoding` of the return value.
+         * @param [format='uncompressed']
+         */
+        generateKeys(): Buffer;
+        generateKeys(encoding: BinaryToTextEncoding, format?: ECDHKeyFormat): string;
+        /**
+         * Computes the shared secret using `otherPublicKey` as the other
+         * party's public key and returns the computed shared secret. The supplied
+         * key is interpreted using specified `inputEncoding`, and the returned secret
+         * is encoded using the specified `outputEncoding`.
+         * If the `inputEncoding` is not
+         * provided, `otherPublicKey` is expected to be a `Buffer`, `TypedArray`, or`DataView`.
+         *
+         * If `outputEncoding` is given a string will be returned; otherwise a `Buffer` is returned.
+         *
+         * `ecdh.computeSecret` will throw an`ERR_CRYPTO_ECDH_INVALID_PUBLIC_KEY` error when `otherPublicKey`lies outside of the elliptic curve. Since `otherPublicKey` is
+         * usually supplied from a remote user over an insecure network,
+         * be sure to handle this exception accordingly.
+         * @since v0.11.14
+         * @param inputEncoding The `encoding` of the `otherPublicKey` string.
+         * @param outputEncoding The `encoding` of the return value.
+         */
+        computeSecret(otherPublicKey: NodeJS.ArrayBufferView): Buffer;
+        computeSecret(otherPublicKey: string, inputEncoding: BinaryToTextEncoding): Buffer;
+        computeSecret(otherPublicKey: NodeJS.ArrayBufferView, outputEncoding: BinaryToTextEncoding): string;
+        computeSecret(otherPublicKey: string, inputEncoding: BinaryToTextEncoding, outputEncoding: BinaryToTextEncoding): string;
+        /**
+         * If `encoding` is specified, a string is returned; otherwise a `Buffer` is
+         * returned.
+         * @since v0.11.14
+         * @param encoding The `encoding` of the return value.
+         * @return The EC Diffie-Hellman in the specified `encoding`.
+         */
+        getPrivateKey(): Buffer;
+        getPrivateKey(encoding: BinaryToTextEncoding): string;
+        /**
+         * The `format` argument specifies point encoding and can be `'compressed'` or`'uncompressed'`. If `format` is not specified the point will be returned in`'uncompressed'` format.
+         *
+         * If `encoding` is specified, a string is returned; otherwise a `Buffer` is
+         * returned.
+         * @since v0.11.14
+         * @param encoding The `encoding` of the return value.
+         * @param [format='uncompressed']
+         * @return The EC Diffie-Hellman public key in the specified `encoding` and `format`.
+         */
+        getPublicKey(): Buffer;
+        getPublicKey(encoding: BinaryToTextEncoding, format?: ECDHKeyFormat): string;
+        /**
+         * Sets the EC Diffie-Hellman private key.
+         * If `encoding` is provided, `privateKey` is expected
+         * to be a string; otherwise `privateKey` is expected to be a `Buffer`,`TypedArray`, or `DataView`.
+         *
+         * If `privateKey` is not valid for the curve specified when the `ECDH` object was
+         * created, an error is thrown. Upon setting the private key, the associated
+         * public point (key) is also generated and set in the `ECDH` object.
+         * @since v0.11.14
+         * @param encoding The `encoding` of the `privateKey` string.
+         */
+        setPrivateKey(privateKey: NodeJS.ArrayBufferView): void;
+        setPrivateKey(privateKey: string, encoding: BinaryToTextEncoding): void;
+    }
+    /**
+     * Creates an Elliptic Curve Diffie-Hellman (`ECDH`) key exchange object using a
+     * predefined curve specified by the `curveName` string. Use {@link getCurves} to obtain a list of available curve names. On recent
+     * OpenSSL releases, `openssl ecparam -list_curves` will also display the name
+     * and description of each available elliptic curve.
+     * @since v0.11.14
+     */
+    function createECDH(curveName: string): ECDH;
+    /**
+     * This function is based on a constant-time algorithm.
+     * Returns true if `a` is equal to `b`, without leaking timing information that
+     * would allow an attacker to guess one of the values. This is suitable for
+     * comparing HMAC digests or secret values like authentication cookies or [capability urls](https://www.w3.org/TR/capability-urls/).
+     *
+     * `a` and `b` must both be `Buffer`s, `TypedArray`s, or `DataView`s, and they
+     * must have the same byte length.
+     *
+     * If at least one of `a` and `b` is a `TypedArray` with more than one byte per
+     * entry, such as `Uint16Array`, the result will be computed using the platform
+     * byte order.
+     *
+     * Use of `crypto.timingSafeEqual` does not guarantee that the _surrounding_ code
+     * is timing-safe. Care should be taken to ensure that the surrounding code does
+     * not introduce timing vulnerabilities.
+     * @since v6.6.0
+     */
+    function timingSafeEqual(a: NodeJS.ArrayBufferView, b: NodeJS.ArrayBufferView): boolean;
+    /** @deprecated since v10.0.0 */
+    const DEFAULT_ENCODING: BufferEncoding;
+    type KeyType = 'rsa' | 'rsa-pss' | 'dsa' | 'ec' | 'ed25519' | 'ed448' | 'x25519' | 'x448';
+    type KeyFormat = 'pem' | 'der';
+    interface BasePrivateKeyEncodingOptions<T extends KeyFormat> {
+        format: T;
+        cipher?: string | undefined;
+        passphrase?: string | undefined;
+    }
+    interface KeyPairKeyObjectResult {
+        publicKey: KeyObject;
+        privateKey: KeyObject;
+    }
+    interface ED25519KeyPairKeyObjectOptions {}
+    interface ED448KeyPairKeyObjectOptions {}
+    interface X25519KeyPairKeyObjectOptions {}
+    interface X448KeyPairKeyObjectOptions {}
+    interface ECKeyPairKeyObjectOptions {
+        /**
+         * Name of the curve to use
+         */
+        namedCurve: string;
+    }
+    interface RSAKeyPairKeyObjectOptions {
+        /**
+         * Key size in bits
+         */
+        modulusLength: number;
+        /**
+         * Public exponent
+         * @default 0x10001
+         */
+        publicExponent?: number | undefined;
+    }
+    interface RSAPSSKeyPairKeyObjectOptions {
+        /**
+         * Key size in bits
+         */
+        modulusLength: number;
+        /**
+         * Public exponent
+         * @default 0x10001
+         */
+        publicExponent?: number | undefined;
+        /**
+         * Name of the message digest
+         */
+        hashAlgorithm?: string;
+        /**
+         * Name of the message digest used by MGF1
+         */
+        mgf1HashAlgorithm?: string;
+        /**
+         * Minimal salt length in bytes
+         */
+        saltLength?: string;
+    }
+    interface DSAKeyPairKeyObjectOptions {
+        /**
+         * Key size in bits
+         */
+        modulusLength: number;
+        /**
+         * Size of q in bits
+         */
+        divisorLength: number;
+    }
+    interface RSAKeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        /**
+         * Key size in bits
+         */
+        modulusLength: number;
+        /**
+         * Public exponent
+         * @default 0x10001
+         */
+        publicExponent?: number | undefined;
+        publicKeyEncoding: {
+            type: 'pkcs1' | 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'pkcs1' | 'pkcs8';
+        };
+    }
+    interface RSAPSSKeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        /**
+         * Key size in bits
+         */
+        modulusLength: number;
+        /**
+         * Public exponent
+         * @default 0x10001
+         */
+        publicExponent?: number | undefined;
+        /**
+         * Name of the message digest
+         */
+        hashAlgorithm?: string;
+        /**
+         * Name of the message digest used by MGF1
+         */
+        mgf1HashAlgorithm?: string;
+        /**
+         * Minimal salt length in bytes
+         */
+        saltLength?: string;
+        publicKeyEncoding: {
+            type: 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'pkcs8';
+        };
+    }
+    interface DSAKeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        /**
+         * Key size in bits
+         */
+        modulusLength: number;
+        /**
+         * Size of q in bits
+         */
+        divisorLength: number;
+        publicKeyEncoding: {
+            type: 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'pkcs8';
+        };
+    }
+    interface ECKeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        /**
+         * Name of the curve to use.
+         */
+        namedCurve: string;
+        publicKeyEncoding: {
+            type: 'pkcs1' | 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'sec1' | 'pkcs8';
+        };
+    }
+    interface ED25519KeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        publicKeyEncoding: {
+            type: 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'pkcs8';
+        };
+    }
+    interface ED448KeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        publicKeyEncoding: {
+            type: 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'pkcs8';
+        };
+    }
+    interface X25519KeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        publicKeyEncoding: {
+            type: 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'pkcs8';
+        };
+    }
+    interface X448KeyPairOptions<PubF extends KeyFormat, PrivF extends KeyFormat> {
+        publicKeyEncoding: {
+            type: 'spki';
+            format: PubF;
+        };
+        privateKeyEncoding: BasePrivateKeyEncodingOptions<PrivF> & {
+            type: 'pkcs8';
+        };
+    }
+    interface KeyPairSyncResult<T1 extends string | Buffer, T2 extends string | Buffer> {
+        publicKey: T1;
+        privateKey: T2;
+    }
+    /**
+     * Generates a new asymmetric key pair of the given `type`. RSA, RSA-PSS, DSA, EC,
+     * Ed25519, Ed448, X25519, X448, and DH are currently supported.
+     *
+     * If a `publicKeyEncoding` or `privateKeyEncoding` was specified, this function
+     * behaves as if `keyObject.export()` had been called on its result. Otherwise,
+     * the respective part of the key is returned as a `KeyObject`.
+     *
+     * When encoding public keys, it is recommended to use `'spki'`. When encoding
+     * private keys, it is recommended to use `'pkcs8'` with a strong passphrase,
+     * and to keep the passphrase confidential.
+     *
+     * ```js
+     * const {
+     *   generateKeyPairSync
+     * } = await import('crypto');
+     *
+     * const {
+     *   publicKey,
+     *   privateKey,
+     * } = generateKeyPairSync('rsa', {
+     *   modulusLength: 4096,
+     *   publicKeyEncoding: {
+     *     type: 'spki',
+     *     format: 'pem'
+     *   },
+     *   privateKeyEncoding: {
+     *     type: 'pkcs8',
+     *     format: 'pem',
+     *     cipher: 'aes-256-cbc',
+     *     passphrase: 'top secret'
+     *   }
+     * });
+     * ```
+     *
+     * The return value `{ publicKey, privateKey }` represents the generated key pair.
+     * When PEM encoding was selected, the respective key will be a string, otherwise
+     * it will be a buffer containing the data encoded as DER.
+     * @since v10.12.0
+     * @param type Must be `'rsa'`, `'rsa-pss'`, `'dsa'`, `'ec'`, `'ed25519'`, `'ed448'`, `'x25519'`, `'x448'`, or `'dh'`.
+     */
+    function generateKeyPairSync(type: 'rsa', options: RSAKeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'rsa', options: RSAKeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'rsa', options: RSAKeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'rsa', options: RSAKeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'rsa', options: RSAKeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    function generateKeyPairSync(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'rsa-pss', options: RSAPSSKeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    function generateKeyPairSync(type: 'dsa', options: DSAKeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'dsa', options: DSAKeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'dsa', options: DSAKeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'dsa', options: DSAKeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'dsa', options: DSAKeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    function generateKeyPairSync(type: 'ec', options: ECKeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'ec', options: ECKeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'ec', options: ECKeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'ec', options: ECKeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'ec', options: ECKeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    function generateKeyPairSync(type: 'ed25519', options: ED25519KeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'ed25519', options: ED25519KeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'ed25519', options: ED25519KeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'ed25519', options: ED25519KeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'ed25519', options?: ED25519KeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    function generateKeyPairSync(type: 'ed448', options: ED448KeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'ed448', options: ED448KeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'ed448', options: ED448KeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'ed448', options: ED448KeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'ed448', options?: ED448KeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    function generateKeyPairSync(type: 'x25519', options: X25519KeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'x25519', options: X25519KeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'x25519', options: X25519KeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'x25519', options: X25519KeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'x25519', options?: X25519KeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    function generateKeyPairSync(type: 'x448', options: X448KeyPairOptions<'pem', 'pem'>): KeyPairSyncResult<string, string>;
+    function generateKeyPairSync(type: 'x448', options: X448KeyPairOptions<'pem', 'der'>): KeyPairSyncResult<string, Buffer>;
+    function generateKeyPairSync(type: 'x448', options: X448KeyPairOptions<'der', 'pem'>): KeyPairSyncResult<Buffer, string>;
+    function generateKeyPairSync(type: 'x448', options: X448KeyPairOptions<'der', 'der'>): KeyPairSyncResult<Buffer, Buffer>;
+    function generateKeyPairSync(type: 'x448', options?: X448KeyPairKeyObjectOptions): KeyPairKeyObjectResult;
+    /**
+     * Generates a new asymmetric key pair of the given `type`. RSA, RSA-PSS, DSA, EC,
+     * Ed25519, Ed448, X25519, X448, and DH are currently supported.
+     *
+     * If a `publicKeyEncoding` or `privateKeyEncoding` was specified, this function
+     * behaves as if `keyObject.export()` had been called on its result. Otherwise,
+     * the respective part of the key is returned as a `KeyObject`.
+     *
+     * It is recommended to encode public keys as `'spki'` and private keys as`'pkcs8'` with encryption for long-term storage:
+     *
+     * ```js
+     * const {
+     *   generateKeyPair
+     * } = await import('crypto');
+     *
+     * generateKeyPair('rsa', {
+     *   modulusLength: 4096,
+     *   publicKeyEncoding: {
+     *     type: 'spki',
+     *     format: 'pem'
+     *   },
+     *   privateKeyEncoding: {
+     *     type: 'pkcs8',
+     *     format: 'pem',
+     *     cipher: 'aes-256-cbc',
+     *     passphrase: 'top secret'
+     *   }
+     * }, (err, publicKey, privateKey) => {
+     *   // Handle errors and use the generated key pair.
+     * });
+     * ```
+     *
+     * On completion, `callback` will be called with `err` set to `undefined` and`publicKey` / `privateKey` representing the generated key pair.
+     *
+     * If this method is invoked as its `util.promisify()` ed version, it returns
+     * a `Promise` for an `Object` with `publicKey` and `privateKey` properties.
+     * @since v10.12.0
+     * @param type Must be `'rsa'`, `'rsa-pss'`, `'dsa'`, `'ec'`, `'ed25519'`, `'ed448'`, `'x25519'`, `'x448'`, or `'dh'`.
+     */
+    function generateKeyPair(type: 'rsa', options: RSAKeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'rsa', options: RSAKeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'rsa', options: RSAKeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'rsa', options: RSAKeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'rsa', options: RSAKeyPairKeyObjectOptions, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    function generateKeyPair(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'rsa-pss', options: RSAPSSKeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'rsa-pss', options: RSAPSSKeyPairKeyObjectOptions, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    function generateKeyPair(type: 'dsa', options: DSAKeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'dsa', options: DSAKeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'dsa', options: DSAKeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'dsa', options: DSAKeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'dsa', options: DSAKeyPairKeyObjectOptions, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    function generateKeyPair(type: 'ec', options: ECKeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'ec', options: ECKeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'ec', options: ECKeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'ec', options: ECKeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'ec', options: ECKeyPairKeyObjectOptions, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    function generateKeyPair(type: 'ed25519', options: ED25519KeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'ed25519', options: ED25519KeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'ed25519', options: ED25519KeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'ed25519', options: ED25519KeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'ed25519', options: ED25519KeyPairKeyObjectOptions | undefined, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    function generateKeyPair(type: 'ed448', options: ED448KeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'ed448', options: ED448KeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'ed448', options: ED448KeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'ed448', options: ED448KeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'ed448', options: ED448KeyPairKeyObjectOptions | undefined, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    function generateKeyPair(type: 'x25519', options: X25519KeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'x25519', options: X25519KeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'x25519', options: X25519KeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'x25519', options: X25519KeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'x25519', options: X25519KeyPairKeyObjectOptions | undefined, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    function generateKeyPair(type: 'x448', options: X448KeyPairOptions<'pem', 'pem'>, callback: (err: Error | null, publicKey: string, privateKey: string) => void): void;
+    function generateKeyPair(type: 'x448', options: X448KeyPairOptions<'pem', 'der'>, callback: (err: Error | null, publicKey: string, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'x448', options: X448KeyPairOptions<'der', 'pem'>, callback: (err: Error | null, publicKey: Buffer, privateKey: string) => void): void;
+    function generateKeyPair(type: 'x448', options: X448KeyPairOptions<'der', 'der'>, callback: (err: Error | null, publicKey: Buffer, privateKey: Buffer) => void): void;
+    function generateKeyPair(type: 'x448', options: X448KeyPairKeyObjectOptions | undefined, callback: (err: Error | null, publicKey: KeyObject, privateKey: KeyObject) => void): void;
+    namespace generateKeyPair {
+        function __promisify__(
+            type: 'rsa',
+            options: RSAKeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'rsa',
+            options: RSAKeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'rsa',
+            options: RSAKeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'rsa',
+            options: RSAKeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'rsa', options: RSAKeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+        function __promisify__(
+            type: 'rsa-pss',
+            options: RSAPSSKeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'rsa-pss',
+            options: RSAPSSKeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'rsa-pss',
+            options: RSAPSSKeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'rsa-pss',
+            options: RSAPSSKeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'rsa-pss', options: RSAPSSKeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+        function __promisify__(
+            type: 'dsa',
+            options: DSAKeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'dsa',
+            options: DSAKeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'dsa',
+            options: DSAKeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'dsa',
+            options: DSAKeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'dsa', options: DSAKeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+        function __promisify__(
+            type: 'ec',
+            options: ECKeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'ec',
+            options: ECKeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'ec',
+            options: ECKeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'ec',
+            options: ECKeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'ec', options: ECKeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+        function __promisify__(
+            type: 'ed25519',
+            options: ED25519KeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'ed25519',
+            options: ED25519KeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'ed25519',
+            options: ED25519KeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'ed25519',
+            options: ED25519KeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'ed25519', options?: ED25519KeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+        function __promisify__(
+            type: 'ed448',
+            options: ED448KeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'ed448',
+            options: ED448KeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'ed448',
+            options: ED448KeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'ed448',
+            options: ED448KeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'ed448', options?: ED448KeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+        function __promisify__(
+            type: 'x25519',
+            options: X25519KeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'x25519',
+            options: X25519KeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'x25519',
+            options: X25519KeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'x25519',
+            options: X25519KeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'x25519', options?: X25519KeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+        function __promisify__(
+            type: 'x448',
+            options: X448KeyPairOptions<'pem', 'pem'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'x448',
+            options: X448KeyPairOptions<'pem', 'der'>
+        ): Promise<{
+            publicKey: string;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(
+            type: 'x448',
+            options: X448KeyPairOptions<'der', 'pem'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: string;
+        }>;
+        function __promisify__(
+            type: 'x448',
+            options: X448KeyPairOptions<'der', 'der'>
+        ): Promise<{
+            publicKey: Buffer;
+            privateKey: Buffer;
+        }>;
+        function __promisify__(type: 'x448', options?: X448KeyPairKeyObjectOptions): Promise<KeyPairKeyObjectResult>;
+    }
+    /**
+     * Calculates and returns the signature for `data` using the given private key and
+     * algorithm. If `algorithm` is `null` or `undefined`, then the algorithm is
+     * dependent upon the key type (especially Ed25519 and Ed448).
+     *
+     * If `key` is not a `KeyObject`, this function behaves as if `key` had been
+     * passed to {@link createPrivateKey}. If it is an object, the following
+     * additional properties can be passed:
+     *
+     * If the `callback` function is provided this function uses libuv's threadpool.
+     * @since v12.0.0
+     */
+    function sign(algorithm: string | null | undefined, data: NodeJS.ArrayBufferView, key: KeyLike | SignKeyObjectInput | SignPrivateKeyInput): Buffer;
+    function sign(
+        algorithm: string | null | undefined,
+        data: NodeJS.ArrayBufferView,
+        key: KeyLike | SignKeyObjectInput | SignPrivateKeyInput,
+        callback: (error: Error | null, data: Buffer) => void
+    ): void;
+    /**
+     * Verifies the given signature for `data` using the given key and algorithm. If`algorithm` is `null` or `undefined`, then the algorithm is dependent upon the
+     * key type (especially Ed25519 and Ed448).
+     *
+     * If `key` is not a `KeyObject`, this function behaves as if `key` had been
+     * passed to {@link createPublicKey}. If it is an object, the following
+     * additional properties can be passed:
+     *
+     * The `signature` argument is the previously calculated signature for the `data`.
+     *
+     * Because public keys can be derived from private keys, a private key or a public
+     * key may be passed for `key`.
+     *
+     * If the `callback` function is provided this function uses libuv's threadpool.
+     * @since v12.0.0
+     */
+    function verify(algorithm: string | null | undefined, data: NodeJS.ArrayBufferView, key: KeyLike | VerifyKeyObjectInput | VerifyPublicKeyInput, signature: NodeJS.ArrayBufferView): boolean;
+    function verify(
+        algorithm: string | null | undefined,
+        data: NodeJS.ArrayBufferView,
+        key: KeyLike | VerifyKeyObjectInput | VerifyPublicKeyInput,
+        signature: NodeJS.ArrayBufferView,
+        callback: (error: Error | null, result: boolean) => void
+    ): void;
+    /**
+     * Computes the Diffie-Hellman secret based on a `privateKey` and a `publicKey`.
+     * Both keys must have the same `asymmetricKeyType`, which must be one of `'dh'`(for Diffie-Hellman), `'ec'` (for ECDH), `'x448'`, or `'x25519'` (for ECDH-ES).
+     * @since v13.9.0, v12.17.0
+     */
+    function diffieHellman(options: { privateKey: KeyObject; publicKey: KeyObject }): Buffer;
+    type CipherMode = 'cbc' | 'ccm' | 'cfb' | 'ctr' | 'ecb' | 'gcm' | 'ocb' | 'ofb' | 'stream' | 'wrap' | 'xts';
+    interface CipherInfoOptions {
+        /**
+         * A test key length.
+         */
+        keyLength?: number | undefined;
+        /**
+         * A test IV length.
+         */
+        ivLength?: number | undefined;
+    }
+    interface CipherInfo {
+        /**
+         * The name of the cipher.
+         */
+        name: string;
+        /**
+         * The nid of the cipher.
+         */
+        nid: number;
+        /**
+         * The block size of the cipher in bytes.
+         * This property is omitted when mode is 'stream'.
+         */
+        blockSize?: number | undefined;
+        /**
+         * The expected or default initialization vector length in bytes.
+         * This property is omitted if the cipher does not use an initialization vector.
+         */
+        ivLength?: number | undefined;
+        /**
+         * The expected or default key length in bytes.
+         */
+        keyLength: number;
+        /**
+         * The cipher mode.
+         */
+        mode: CipherMode;
+    }
+    /**
+     * Returns information about a given cipher.
+     *
+     * Some ciphers accept variable length keys and initialization vectors. By default,
+     * the `crypto.getCipherInfo()` method will return the default values for these
+     * ciphers. To test if a given key length or iv length is acceptable for given
+     * cipher, use the `keyLength` and `ivLength` options. If the given values are
+     * unacceptable, `undefined` will be returned.
+     * @since v15.0.0
+     * @param nameOrNid The name or nid of the cipher to query.
+     */
+    function getCipherInfo(nameOrNid: string | number, options?: CipherInfoOptions): CipherInfo | undefined;
+    /**
+     * HKDF is a simple key derivation function defined in RFC 5869\. The given `ikm`,`salt` and `info` are used with the `digest` to derive a key of `keylen` bytes.
+     *
+     * The supplied `callback` function is called with two arguments: `err` and`derivedKey`. If an errors occurs while deriving the key, `err` will be set;
+     * otherwise `err` will be `null`. The successfully generated `derivedKey` will
+     * be passed to the callback as an [ArrayBuffer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer). An error will be thrown if any
+     * of the input arguments specify invalid values or types.
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const {
+     *   hkdf
+     * } = await import('crypto');
+     *
+     * hkdf('sha512', 'key', 'salt', 'info', 64, (err, derivedKey) => {
+     *   if (err) throw err;
+     *   console.log(Buffer.from(derivedKey).toString('hex'));  // '24156e2...5391653'
+     * });
+     * ```
+     * @since v15.0.0
+     * @param digest The digest algorithm to use.
+     * @param ikm The input keying material. It must be at least one byte in length.
+     * @param salt The salt value. Must be provided but can be zero-length.
+     * @param info Additional info value. Must be provided but can be zero-length, and cannot be more than 1024 bytes.
+     * @param keylen The length of the key to generate. Must be greater than 0. The maximum allowable value is `255` times the number of bytes produced by the selected digest function (e.g. `sha512`
+     * generates 64-byte hashes, making the maximum HKDF output 16320 bytes).
+     */
+    function hkdf(digest: string, irm: BinaryLike | KeyObject, salt: BinaryLike, info: BinaryLike, keylen: number, callback: (err: Error | null, derivedKey: ArrayBuffer) => void): void;
+    /**
+     * Provides a synchronous HKDF key derivation function as defined in RFC 5869\. The
+     * given `ikm`, `salt` and `info` are used with the `digest` to derive a key of`keylen` bytes.
+     *
+     * The successfully generated `derivedKey` will be returned as an [ArrayBuffer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer).
+     *
+     * An error will be thrown if any of the input arguments specify invalid values or
+     * types, or if the derived key cannot be generated.
+     *
+     * ```js
+     * import { Buffer } from 'buffer';
+     * const {
+     *   hkdfSync
+     * } = await import('crypto');
+     *
+     * const derivedKey = hkdfSync('sha512', 'key', 'salt', 'info', 64);
+     * console.log(Buffer.from(derivedKey).toString('hex'));  // '24156e2...5391653'
+     * ```
+     * @since v15.0.0
+     * @param digest The digest algorithm to use.
+     * @param ikm The input keying material. It must be at least one byte in length.
+     * @param salt The salt value. Must be provided but can be zero-length.
+     * @param info Additional info value. Must be provided but can be zero-length, and cannot be more than 1024 bytes.
+     * @param keylen The length of the key to generate. Must be greater than 0. The maximum allowable value is `255` times the number of bytes produced by the selected digest function (e.g. `sha512`
+     * generates 64-byte hashes, making the maximum HKDF output 16320 bytes).
+     */
+    function hkdfSync(digest: string, ikm: BinaryLike | KeyObject, salt: BinaryLike, info: BinaryLike, keylen: number): ArrayBuffer;
+    interface SecureHeapUsage {
+        /**
+         * The total allocated secure heap size as specified using the `--secure-heap=n` command-line flag.
+         */
+        total: number;
+        /**
+         * The minimum allocation from the secure heap as specified using the `--secure-heap-min` command-line flag.
+         */
+        min: number;
+        /**
+         * The total number of bytes currently allocated from the secure heap.
+         */
+        used: number;
+        /**
+         * The calculated ratio of `used` to `total` allocated bytes.
+         */
+        utilization: number;
+    }
+    /**
+     * @since v15.6.0
+     */
+    function secureHeapUsed(): SecureHeapUsage;
+    interface RandomUUIDOptions {
+        /**
+         * By default, to improve performance,
+         * Node.js will pre-emptively generate and persistently cache enough
+         * random data to generate up to 128 random UUIDs. To generate a UUID
+         * without using the cache, set `disableEntropyCache` to `true`.
+         *
+         * @default `false`
+         */
+        disableEntropyCache?: boolean | undefined;
+    }
+    /**
+     * Generates a random [RFC 4122](https://www.rfc-editor.org/rfc/rfc4122.txt) version 4 UUID. The UUID is generated using a
+     * cryptographic pseudorandom number generator.
+     * @since v15.6.0, v14.17.0
+     */
+    function randomUUID(options?: RandomUUIDOptions): string;
+    interface X509CheckOptions {
+        /**
+         * @default 'always'
+         */
+        subject: 'always' | 'never';
+        /**
+         * @default true
+         */
+        wildcards: boolean;
+        /**
+         * @default true
+         */
+        partialWildcards: boolean;
+        /**
+         * @default false
+         */
+        multiLabelWildcards: boolean;
+        /**
+         * @default false
+         */
+        singleLabelSubdomains: boolean;
+    }
+    /**
+     * Encapsulates an X509 certificate and provides read-only access to
+     * its information.
+     *
+     * ```js
+     * const { X509Certificate } = await import('crypto');
+     *
+     * const x509 = new X509Certificate('{... pem encoded cert ...}');
+     *
+     * console.log(x509.subject);
+     * ```
+     * @since v15.6.0
+     */
+    class X509Certificate {
+        /**
+         * Will be \`true\` if this is a Certificate Authority (ca) certificate.
+         * @since v15.6.0
+         */
+        readonly ca: boolean;
+        /**
+         * The SHA-1 fingerprint of this certificate.
+         * @since v15.6.0
+         */
+        readonly fingerprint: string;
+        /**
+         * The SHA-256 fingerprint of this certificate.
+         * @since v15.6.0
+         */
+        readonly fingerprint256: string;
+        /**
+         * The complete subject of this certificate.
+         * @since v15.6.0
+         */
+        readonly subject: string;
+        /**
+         * The subject alternative name specified for this certificate.
+         * @since v15.6.0
+         */
+        readonly subjectAltName: string;
+        /**
+         * The information access content of this certificate.
+         * @since v15.6.0
+         */
+        readonly infoAccess: string;
+        /**
+         * An array detailing the key usages for this certificate.
+         * @since v15.6.0
+         */
+        readonly keyUsage: string[];
+        /**
+         * The issuer identification included in this certificate.
+         * @since v15.6.0
+         */
+        readonly issuer: string;
+        /**
+         * The issuer certificate or `undefined` if the issuer certificate is not
+         * available.
+         * @since v15.9.0
+         */
+        readonly issuerCertificate?: X509Certificate | undefined;
+        /**
+         * The public key `KeyObject` for this certificate.
+         * @since v15.6.0
+         */
+        readonly publicKey: KeyObject;
+        /**
+         * A `Buffer` containing the DER encoding of this certificate.
+         * @since v15.6.0
+         */
+        readonly raw: Buffer;
+        /**
+         * The serial number of this certificate.
+         * @since v15.6.0
+         */
+        readonly serialNumber: string;
+        /**
+         * The date/time from which this certificate is considered valid.
+         * @since v15.6.0
+         */
+        readonly validFrom: string;
+        /**
+         * The date/time until which this certificate is considered valid.
+         * @since v15.6.0
+         */
+        readonly validTo: string;
+        constructor(buffer: BinaryLike);
+        /**
+         * Checks whether the certificate matches the given email address.
+         * @since v15.6.0
+         * @return Returns `email` if the certificate matches, `undefined` if it does not.
+         */
+        checkEmail(email: string, options?: X509CheckOptions): string | undefined;
+        /**
+         * Checks whether the certificate matches the given host name.
+         * @since v15.6.0
+         * @return Returns `name` if the certificate matches, `undefined` if it does not.
+         */
+        checkHost(name: string, options?: X509CheckOptions): string | undefined;
+        /**
+         * Checks whether the certificate matches the given IP address (IPv4 or IPv6).
+         * @since v15.6.0
+         * @return Returns `ip` if the certificate matches, `undefined` if it does not.
+         */
+        checkIP(ip: string, options?: X509CheckOptions): string | undefined;
+        /**
+         * Checks whether this certificate was issued by the given `otherCert`.
+         * @since v15.6.0
+         */
+        checkIssued(otherCert: X509Certificate): boolean;
+        /**
+         * Checks whether the public key for this certificate is consistent with
+         * the given private key.
+         * @since v15.6.0
+         * @param privateKey A private key.
+         */
+        checkPrivateKey(privateKey: KeyObject): boolean;
+        /**
+         * There is no standard JSON encoding for X509 certificates. The`toJSON()` method returns a string containing the PEM encoded
+         * certificate.
+         * @since v15.6.0
+         */
+        toJSON(): string;
+        /**
+         * Returns information about this certificate using the legacy `certificate object` encoding.
+         * @since v15.6.0
+         */
+        toLegacyObject(): PeerCertificate;
+        /**
+         * Returns the PEM-encoded certificate.
+         * @since v15.6.0
+         */
+        toString(): string;
+        /**
+         * Verifies that this certificate was signed by the given public key.
+         * Does not perform any other validation checks on the certificate.
+         * @since v15.6.0
+         * @param publicKey A public key.
+         */
+        verify(publicKey: KeyObject): boolean;
+    }
+    type LargeNumberLike = NodeJS.ArrayBufferView | SharedArrayBuffer | ArrayBuffer | bigint;
+    interface GeneratePrimeOptions {
+        add?: LargeNumberLike | undefined;
+        rem?: LargeNumberLike | undefined;
+        /**
+         * @default false
+         */
+        safe?: boolean | undefined;
+        bigint?: boolean | undefined;
+    }
+    interface GeneratePrimeOptionsBigInt extends GeneratePrimeOptions {
+        bigint: true;
+    }
+    interface GeneratePrimeOptionsArrayBuffer extends GeneratePrimeOptions {
+        bigint?: false | undefined;
+    }
+    /**
+     * Generates a pseudorandom prime of `size` bits.
+     *
+     * If `options.safe` is `true`, the prime will be a safe prime -- that is,`(prime - 1) / 2` will also be a prime.
+     *
+     * The `options.add` and `options.rem` parameters can be used to enforce additional
+     * requirements, e.g., for Diffie-Hellman:
+     *
+     * * If `options.add` and `options.rem` are both set, the prime will satisfy the
+     * condition that `prime % add = rem`.
+     * * If only `options.add` is set and `options.safe` is not `true`, the prime will
+     * satisfy the condition that `prime % add = 1`.
+     * * If only `options.add` is set and `options.safe` is set to `true`, the prime
+     * will instead satisfy the condition that `prime % add = 3`. This is necessary
+     * because `prime % add = 1` for `options.add > 2` would contradict the condition
+     * enforced by `options.safe`.
+     * * `options.rem` is ignored if `options.add` is not given.
+     *
+     * Both `options.add` and `options.rem` must be encoded as big-endian sequences
+     * if given as an `ArrayBuffer`, `SharedArrayBuffer`, `TypedArray`, `Buffer`, or`DataView`.
+     *
+     * By default, the prime is encoded as a big-endian sequence of octets
+     * in an [ArrayBuffer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer). If the `bigint` option is `true`, then a
+     * [bigint](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt) is provided.
+     * @since v15.8.0
+     * @param size The size (in bits) of the prime to generate.
+     */
+    function generatePrime(size: number, callback: (err: Error | null, prime: ArrayBuffer) => void): void;
+    function generatePrime(size: number, options: GeneratePrimeOptionsBigInt, callback: (err: Error | null, prime: bigint) => void): void;
+    function generatePrime(size: number, options: GeneratePrimeOptionsArrayBuffer, callback: (err: Error | null, prime: ArrayBuffer) => void): void;
+    function generatePrime(size: number, options: GeneratePrimeOptions, callback: (err: Error | null, prime: ArrayBuffer | bigint) => void): void;
+    /**
+     * Generates a pseudorandom prime of `size` bits.
+     *
+     * If `options.safe` is `true`, the prime will be a safe prime -- that is,`(prime - 1) / 2` will also be a prime.
+     *
+     * The `options.add` and `options.rem` parameters can be used to enforce additional
+     * requirements, e.g., for Diffie-Hellman:
+     *
+     * * If `options.add` and `options.rem` are both set, the prime will satisfy the
+     * condition that `prime % add = rem`.
+     * * If only `options.add` is set and `options.safe` is not `true`, the prime will
+     * satisfy the condition that `prime % add = 1`.
+     * * If only `options.add` is set and `options.safe` is set to `true`, the prime
+     * will instead satisfy the condition that `prime % add = 3`. This is necessary
+     * because `prime % add = 1` for `options.add > 2` would contradict the condition
+     * enforced by `options.safe`.
+     * * `options.rem` is ignored if `options.add` is not given.
+     *
+     * Both `options.add` and `options.rem` must be encoded as big-endian sequences
+     * if given as an `ArrayBuffer`, `SharedArrayBuffer`, `TypedArray`, `Buffer`, or`DataView`.
+     *
+     * By default, the prime is encoded as a big-endian sequence of octets
+     * in an [ArrayBuffer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer). If the `bigint` option is `true`, then a
+     * [bigint](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt) is provided.
+     * @since v15.8.0
+     * @param size The size (in bits) of the prime to generate.
+     */
+    function generatePrimeSync(size: number): ArrayBuffer;
+    function generatePrimeSync(size: number, options: GeneratePrimeOptionsBigInt): bigint;
+    function generatePrimeSync(size: number, options: GeneratePrimeOptionsArrayBuffer): ArrayBuffer;
+    function generatePrimeSync(size: number, options: GeneratePrimeOptions): ArrayBuffer | bigint;
+    interface CheckPrimeOptions {
+        /**
+         * The number of Miller-Rabin probabilistic primality iterations to perform.
+         * When the value is 0 (zero), a number of checks is used that yields a false positive rate of at most 2-64 for random input.
+         * Care must be used when selecting a number of checks.
+         * Refer to the OpenSSL documentation for the BN_is_prime_ex function nchecks options for more details.
+         *
+         * @default 0
+         */
+        checks?: number | undefined;
+    }
+    /**
+     * Checks the primality of the `candidate`.
+     * @since v15.8.0
+     * @param candidate A possible prime encoded as a sequence of big endian octets of arbitrary length.
+     */
+    function checkPrime(value: LargeNumberLike, callback: (err: Error | null, result: boolean) => void): void;
+    function checkPrime(value: LargeNumberLike, options: CheckPrimeOptions, callback: (err: Error | null, result: boolean) => void): void;
+    /**
+     * Checks the primality of the `candidate`.
+     * @since v15.8.0
+     * @param candidate A possible prime encoded as a sequence of big endian octets of arbitrary length.
+     * @return `true` if the candidate is a prime with an error probability less than `0.25 ** options.checks`.
+     */
+    function checkPrimeSync(candidate: LargeNumberLike, options?: CheckPrimeOptions): boolean;
+    namespace webcrypto {
+        class CryptoKey {} // placeholder
+    }
+}
+declare module 'node:crypto' {
+    export * from 'crypto';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/dgram.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/dgram.d.ts
new file mode 100644
index 0000000..b4a9892
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/dgram.d.ts
@@ -0,0 +1,545 @@
+/**
+ * The `dgram` module provides an implementation of UDP datagram sockets.
+ *
+ * ```js
+ * import dgram from 'dgram';
+ *
+ * const server = dgram.createSocket('udp4');
+ *
+ * server.on('error', (err) => {
+ *   console.log(`server error:\n${err.stack}`);
+ *   server.close();
+ * });
+ *
+ * server.on('message', (msg, rinfo) => {
+ *   console.log(`server got: ${msg} from ${rinfo.address}:${rinfo.port}`);
+ * });
+ *
+ * server.on('listening', () => {
+ *   const address = server.address();
+ *   console.log(`server listening ${address.address}:${address.port}`);
+ * });
+ *
+ * server.bind(41234);
+ * // Prints: server listening 0.0.0.0:41234
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/dgram.js)
+ */
+declare module 'dgram' {
+    import { AddressInfo } from 'node:net';
+    import * as dns from 'node:dns';
+    import { EventEmitter, Abortable } from 'node:events';
+    interface RemoteInfo {
+        address: string;
+        family: 'IPv4' | 'IPv6';
+        port: number;
+        size: number;
+    }
+    interface BindOptions {
+        port?: number | undefined;
+        address?: string | undefined;
+        exclusive?: boolean | undefined;
+        fd?: number | undefined;
+    }
+    type SocketType = 'udp4' | 'udp6';
+    interface SocketOptions extends Abortable {
+        type: SocketType;
+        reuseAddr?: boolean | undefined;
+        /**
+         * @default false
+         */
+        ipv6Only?: boolean | undefined;
+        recvBufferSize?: number | undefined;
+        sendBufferSize?: number | undefined;
+        lookup?: ((hostname: string, options: dns.LookupOneOptions, callback: (err: NodeJS.ErrnoException | null, address: string, family: number) => void) => void) | undefined;
+    }
+    /**
+     * Creates a `dgram.Socket` object. Once the socket is created, calling `socket.bind()` will instruct the socket to begin listening for datagram
+     * messages. When `address` and `port` are not passed to `socket.bind()` the
+     * method will bind the socket to the "all interfaces" address on a random port
+     * (it does the right thing for both `udp4` and `udp6` sockets). The bound address
+     * and port can be retrieved using `socket.address().address` and `socket.address().port`.
+     *
+     * If the `signal` option is enabled, calling `.abort()` on the corresponding`AbortController` is similar to calling `.close()` on the socket:
+     *
+     * ```js
+     * const controller = new AbortController();
+     * const { signal } = controller;
+     * const server = dgram.createSocket({ type: 'udp4', signal });
+     * server.on('message', (msg, rinfo) => {
+     *   console.log(`server got: ${msg} from ${rinfo.address}:${rinfo.port}`);
+     * });
+     * // Later, when you want to close the server.
+     * controller.abort();
+     * ```
+     * @since v0.11.13
+     * @param options Available options are:
+     * @param callback Attached as a listener for `'message'` events. Optional.
+     */
+    function createSocket(type: SocketType, callback?: (msg: Buffer, rinfo: RemoteInfo) => void): Socket;
+    function createSocket(options: SocketOptions, callback?: (msg: Buffer, rinfo: RemoteInfo) => void): Socket;
+    /**
+     * Encapsulates the datagram functionality.
+     *
+     * New instances of `dgram.Socket` are created using {@link createSocket}.
+     * The `new` keyword is not to be used to create `dgram.Socket` instances.
+     * @since v0.1.99
+     */
+    class Socket extends EventEmitter {
+        /**
+         * Tells the kernel to join a multicast group at the given `multicastAddress` and`multicastInterface` using the `IP_ADD_MEMBERSHIP` socket option. If the`multicastInterface` argument is not
+         * specified, the operating system will choose
+         * one interface and will add membership to it. To add membership to every
+         * available interface, call `addMembership` multiple times, once per interface.
+         *
+         * When called on an unbound socket, this method will implicitly bind to a random
+         * port, listening on all interfaces.
+         *
+         * When sharing a UDP socket across multiple `cluster` workers, the`socket.addMembership()` function must be called only once or an`EADDRINUSE` error will occur:
+         *
+         * ```js
+         * import cluster from 'cluster';
+         * import dgram from 'dgram';
+         *
+         * if (cluster.isPrimary) {
+         *   cluster.fork(); // Works ok.
+         *   cluster.fork(); // Fails with EADDRINUSE.
+         * } else {
+         *   const s = dgram.createSocket('udp4');
+         *   s.bind(1234, () => {
+         *     s.addMembership('224.0.0.114');
+         *   });
+         * }
+         * ```
+         * @since v0.6.9
+         */
+        addMembership(multicastAddress: string, multicastInterface?: string): void;
+        /**
+         * Returns an object containing the address information for a socket.
+         * For UDP sockets, this object will contain `address`, `family` and `port`properties.
+         *
+         * This method throws `EBADF` if called on an unbound socket.
+         * @since v0.1.99
+         */
+        address(): AddressInfo;
+        /**
+         * For UDP sockets, causes the `dgram.Socket` to listen for datagram
+         * messages on a named `port` and optional `address`. If `port` is not
+         * specified or is `0`, the operating system will attempt to bind to a
+         * random port. If `address` is not specified, the operating system will
+         * attempt to listen on all addresses. Once binding is complete, a`'listening'` event is emitted and the optional `callback` function is
+         * called.
+         *
+         * Specifying both a `'listening'` event listener and passing a`callback` to the `socket.bind()` method is not harmful but not very
+         * useful.
+         *
+         * A bound datagram socket keeps the Node.js process running to receive
+         * datagram messages.
+         *
+         * If binding fails, an `'error'` event is generated. In rare case (e.g.
+         * attempting to bind with a closed socket), an `Error` may be thrown.
+         *
+         * Example of a UDP server listening on port 41234:
+         *
+         * ```js
+         * import dgram from 'dgram';
+         *
+         * const server = dgram.createSocket('udp4');
+         *
+         * server.on('error', (err) => {
+         *   console.log(`server error:\n${err.stack}`);
+         *   server.close();
+         * });
+         *
+         * server.on('message', (msg, rinfo) => {
+         *   console.log(`server got: ${msg} from ${rinfo.address}:${rinfo.port}`);
+         * });
+         *
+         * server.on('listening', () => {
+         *   const address = server.address();
+         *   console.log(`server listening ${address.address}:${address.port}`);
+         * });
+         *
+         * server.bind(41234);
+         * // Prints: server listening 0.0.0.0:41234
+         * ```
+         * @since v0.1.99
+         * @param callback with no parameters. Called when binding is complete.
+         */
+        bind(port?: number, address?: string, callback?: () => void): this;
+        bind(port?: number, callback?: () => void): this;
+        bind(callback?: () => void): this;
+        bind(options: BindOptions, callback?: () => void): this;
+        /**
+         * Close the underlying socket and stop listening for data on it. If a callback is
+         * provided, it is added as a listener for the `'close'` event.
+         * @since v0.1.99
+         * @param callback Called when the socket has been closed.
+         */
+        close(callback?: () => void): this;
+        /**
+         * Associates the `dgram.Socket` to a remote address and port. Every
+         * message sent by this handle is automatically sent to that destination. Also,
+         * the socket will only receive messages from that remote peer.
+         * Trying to call `connect()` on an already connected socket will result
+         * in an `ERR_SOCKET_DGRAM_IS_CONNECTED` exception. If `address` is not
+         * provided, `'127.0.0.1'` (for `udp4` sockets) or `'::1'` (for `udp6` sockets)
+         * will be used by default. Once the connection is complete, a `'connect'` event
+         * is emitted and the optional `callback` function is called. In case of failure,
+         * the `callback` is called or, failing this, an `'error'` event is emitted.
+         * @since v12.0.0
+         * @param callback Called when the connection is completed or on error.
+         */
+        connect(port: number, address?: string, callback?: () => void): void;
+        connect(port: number, callback: () => void): void;
+        /**
+         * A synchronous function that disassociates a connected `dgram.Socket` from
+         * its remote address. Trying to call `disconnect()` on an unbound or already
+         * disconnected socket will result in an `ERR_SOCKET_DGRAM_NOT_CONNECTED` exception.
+         * @since v12.0.0
+         */
+        disconnect(): void;
+        /**
+         * Instructs the kernel to leave a multicast group at `multicastAddress` using the`IP_DROP_MEMBERSHIP` socket option. This method is automatically called by the
+         * kernel when the socket is closed or the process terminates, so most apps will
+         * never have reason to call this.
+         *
+         * If `multicastInterface` is not specified, the operating system will attempt to
+         * drop membership on all valid interfaces.
+         * @since v0.6.9
+         */
+        dropMembership(multicastAddress: string, multicastInterface?: string): void;
+        /**
+         * This method throws `ERR_SOCKET_BUFFER_SIZE` if called on an unbound socket.
+         * @since v8.7.0
+         * @return the `SO_RCVBUF` socket receive buffer size in bytes.
+         */
+        getRecvBufferSize(): number;
+        /**
+         * This method throws `ERR_SOCKET_BUFFER_SIZE` if called on an unbound socket.
+         * @since v8.7.0
+         * @return the `SO_SNDBUF` socket send buffer size in bytes.
+         */
+        getSendBufferSize(): number;
+        /**
+         * By default, binding a socket will cause it to block the Node.js process from
+         * exiting as long as the socket is open. The `socket.unref()` method can be used
+         * to exclude the socket from the reference counting that keeps the Node.js
+         * process active. The `socket.ref()` method adds the socket back to the reference
+         * counting and restores the default behavior.
+         *
+         * Calling `socket.ref()` multiples times will have no additional effect.
+         *
+         * The `socket.ref()` method returns a reference to the socket so calls can be
+         * chained.
+         * @since v0.9.1
+         */
+        ref(): this;
+        /**
+         * Returns an object containing the `address`, `family`, and `port` of the remote
+         * endpoint. This method throws an `ERR_SOCKET_DGRAM_NOT_CONNECTED` exception
+         * if the socket is not connected.
+         * @since v12.0.0
+         */
+        remoteAddress(): AddressInfo;
+        /**
+         * Broadcasts a datagram on the socket.
+         * For connectionless sockets, the destination `port` and `address` must be
+         * specified. Connected sockets, on the other hand, will use their associated
+         * remote endpoint, so the `port` and `address` arguments must not be set.
+         *
+         * The `msg` argument contains the message to be sent.
+         * Depending on its type, different behavior can apply. If `msg` is a `Buffer`,
+         * any `TypedArray` or a `DataView`,
+         * the `offset` and `length` specify the offset within the `Buffer` where the
+         * message begins and the number of bytes in the message, respectively.
+         * If `msg` is a `String`, then it is automatically converted to a `Buffer`with `'utf8'` encoding. With messages that
+         * contain multi-byte characters, `offset` and `length` will be calculated with
+         * respect to `byte length` and not the character position.
+         * If `msg` is an array, `offset` and `length` must not be specified.
+         *
+         * The `address` argument is a string. If the value of `address` is a host name,
+         * DNS will be used to resolve the address of the host. If `address` is not
+         * provided or otherwise nullish, `'127.0.0.1'` (for `udp4` sockets) or `'::1'`(for `udp6` sockets) will be used by default.
+         *
+         * If the socket has not been previously bound with a call to `bind`, the socket
+         * is assigned a random port number and is bound to the "all interfaces" address
+         * (`'0.0.0.0'` for `udp4` sockets, `'::0'` for `udp6` sockets.)
+         *
+         * An optional `callback` function may be specified to as a way of reporting
+         * DNS errors or for determining when it is safe to reuse the `buf` object.
+         * DNS lookups delay the time to send for at least one tick of the
+         * Node.js event loop.
+         *
+         * The only way to know for sure that the datagram has been sent is by using a`callback`. If an error occurs and a `callback` is given, the error will be
+         * passed as the first argument to the `callback`. If a `callback` is not given,
+         * the error is emitted as an `'error'` event on the `socket` object.
+         *
+         * Offset and length are optional but both _must_ be set if either are used.
+         * They are supported only when the first argument is a `Buffer`, a `TypedArray`,
+         * or a `DataView`.
+         *
+         * This method throws `ERR_SOCKET_BAD_PORT` if called on an unbound socket.
+         *
+         * Example of sending a UDP packet to a port on `localhost`;
+         *
+         * ```js
+         * import dgram from 'dgram';
+         * import { Buffer } from 'buffer';
+         *
+         * const message = Buffer.from('Some bytes');
+         * const client = dgram.createSocket('udp4');
+         * client.send(message, 41234, 'localhost', (err) => {
+         *   client.close();
+         * });
+         * ```
+         *
+         * Example of sending a UDP packet composed of multiple buffers to a port on`127.0.0.1`;
+         *
+         * ```js
+         * import dgram from 'dgram';
+         * import { Buffer } from 'buffer';
+         *
+         * const buf1 = Buffer.from('Some ');
+         * const buf2 = Buffer.from('bytes');
+         * const client = dgram.createSocket('udp4');
+         * client.send([buf1, buf2], 41234, (err) => {
+         *   client.close();
+         * });
+         * ```
+         *
+         * Sending multiple buffers might be faster or slower depending on the
+         * application and operating system. Run benchmarks to
+         * determine the optimal strategy on a case-by-case basis. Generally speaking,
+         * however, sending multiple buffers is faster.
+         *
+         * Example of sending a UDP packet using a socket connected to a port on`localhost`:
+         *
+         * ```js
+         * import dgram from 'dgram';
+         * import { Buffer } from 'buffer';
+         *
+         * const message = Buffer.from('Some bytes');
+         * const client = dgram.createSocket('udp4');
+         * client.connect(41234, 'localhost', (err) => {
+         *   client.send(message, (err) => {
+         *     client.close();
+         *   });
+         * });
+         * ```
+         * @since v0.1.99
+         * @param msg Message to be sent.
+         * @param offset Offset in the buffer where the message starts.
+         * @param length Number of bytes in the message.
+         * @param port Destination port.
+         * @param address Destination host name or IP address.
+         * @param callback Called when the message has been sent.
+         */
+        send(msg: string | Uint8Array | ReadonlyArray<any>, port?: number, address?: string, callback?: (error: Error | null, bytes: number) => void): void;
+        send(msg: string | Uint8Array | ReadonlyArray<any>, port?: number, callback?: (error: Error | null, bytes: number) => void): void;
+        send(msg: string | Uint8Array | ReadonlyArray<any>, callback?: (error: Error | null, bytes: number) => void): void;
+        send(msg: string | Uint8Array, offset: number, length: number, port?: number, address?: string, callback?: (error: Error | null, bytes: number) => void): void;
+        send(msg: string | Uint8Array, offset: number, length: number, port?: number, callback?: (error: Error | null, bytes: number) => void): void;
+        send(msg: string | Uint8Array, offset: number, length: number, callback?: (error: Error | null, bytes: number) => void): void;
+        /**
+         * Sets or clears the `SO_BROADCAST` socket option. When set to `true`, UDP
+         * packets may be sent to a local interface's broadcast address.
+         *
+         * This method throws `EBADF` if called on an unbound socket.
+         * @since v0.6.9
+         */
+        setBroadcast(flag: boolean): void;
+        /**
+         * _All references to scope in this section are referring to [IPv6 Zone Indices](https://en.wikipedia.org/wiki/IPv6_address#Scoped_literal_IPv6_addresses), which are defined by [RFC
+         * 4007](https://tools.ietf.org/html/rfc4007). In string form, an IP_
+         * _with a scope index is written as `'IP%scope'` where scope is an interface name_
+         * _or interface number._
+         *
+         * Sets the default outgoing multicast interface of the socket to a chosen
+         * interface or back to system interface selection. The `multicastInterface` must
+         * be a valid string representation of an IP from the socket's family.
+         *
+         * For IPv4 sockets, this should be the IP configured for the desired physical
+         * interface. All packets sent to multicast on the socket will be sent on the
+         * interface determined by the most recent successful use of this call.
+         *
+         * For IPv6 sockets, `multicastInterface` should include a scope to indicate the
+         * interface as in the examples that follow. In IPv6, individual `send` calls can
+         * also use explicit scope in addresses, so only packets sent to a multicast
+         * address without specifying an explicit scope are affected by the most recent
+         * successful use of this call.
+         *
+         * This method throws `EBADF` if called on an unbound socket.
+         *
+         * #### Example: IPv6 outgoing multicast interface
+         *
+         * On most systems, where scope format uses the interface name:
+         *
+         * ```js
+         * const socket = dgram.createSocket('udp6');
+         *
+         * socket.bind(1234, () => {
+         *   socket.setMulticastInterface('::%eth1');
+         * });
+         * ```
+         *
+         * On Windows, where scope format uses an interface number:
+         *
+         * ```js
+         * const socket = dgram.createSocket('udp6');
+         *
+         * socket.bind(1234, () => {
+         *   socket.setMulticastInterface('::%2');
+         * });
+         * ```
+         *
+         * #### Example: IPv4 outgoing multicast interface
+         *
+         * All systems use an IP of the host on the desired physical interface:
+         *
+         * ```js
+         * const socket = dgram.createSocket('udp4');
+         *
+         * socket.bind(1234, () => {
+         *   socket.setMulticastInterface('10.0.0.2');
+         * });
+         * ```
+         * @since v8.6.0
+         */
+        setMulticastInterface(multicastInterface: string): void;
+        /**
+         * Sets or clears the `IP_MULTICAST_LOOP` socket option. When set to `true`,
+         * multicast packets will also be received on the local interface.
+         *
+         * This method throws `EBADF` if called on an unbound socket.
+         * @since v0.3.8
+         */
+        setMulticastLoopback(flag: boolean): boolean;
+        /**
+         * Sets the `IP_MULTICAST_TTL` socket option. While TTL generally stands for
+         * "Time to Live", in this context it specifies the number of IP hops that a
+         * packet is allowed to travel through, specifically for multicast traffic. Each
+         * router or gateway that forwards a packet decrements the TTL. If the TTL is
+         * decremented to 0 by a router, it will not be forwarded.
+         *
+         * The `ttl` argument may be between 0 and 255\. The default on most systems is `1`.
+         *
+         * This method throws `EBADF` if called on an unbound socket.
+         * @since v0.3.8
+         */
+        setMulticastTTL(ttl: number): number;
+        /**
+         * Sets the `SO_RCVBUF` socket option. Sets the maximum socket receive buffer
+         * in bytes.
+         *
+         * This method throws `ERR_SOCKET_BUFFER_SIZE` if called on an unbound socket.
+         * @since v8.7.0
+         */
+        setRecvBufferSize(size: number): void;
+        /**
+         * Sets the `SO_SNDBUF` socket option. Sets the maximum socket send buffer
+         * in bytes.
+         *
+         * This method throws `ERR_SOCKET_BUFFER_SIZE` if called on an unbound socket.
+         * @since v8.7.0
+         */
+        setSendBufferSize(size: number): void;
+        /**
+         * Sets the `IP_TTL` socket option. While TTL generally stands for "Time to Live",
+         * in this context it specifies the number of IP hops that a packet is allowed to
+         * travel through. Each router or gateway that forwards a packet decrements the
+         * TTL. If the TTL is decremented to 0 by a router, it will not be forwarded.
+         * Changing TTL values is typically done for network probes or when multicasting.
+         *
+         * The `ttl` argument may be between between 1 and 255\. The default on most systems
+         * is 64.
+         *
+         * This method throws `EBADF` if called on an unbound socket.
+         * @since v0.1.101
+         */
+        setTTL(ttl: number): number;
+        /**
+         * By default, binding a socket will cause it to block the Node.js process from
+         * exiting as long as the socket is open. The `socket.unref()` method can be used
+         * to exclude the socket from the reference counting that keeps the Node.js
+         * process active, allowing the process to exit even if the socket is still
+         * listening.
+         *
+         * Calling `socket.unref()` multiple times will have no addition effect.
+         *
+         * The `socket.unref()` method returns a reference to the socket so calls can be
+         * chained.
+         * @since v0.9.1
+         */
+        unref(): this;
+        /**
+         * Tells the kernel to join a source-specific multicast channel at the given`sourceAddress` and `groupAddress`, using the `multicastInterface` with the`IP_ADD_SOURCE_MEMBERSHIP` socket
+         * option. If the `multicastInterface` argument
+         * is not specified, the operating system will choose one interface and will add
+         * membership to it. To add membership to every available interface, call`socket.addSourceSpecificMembership()` multiple times, once per interface.
+         *
+         * When called on an unbound socket, this method will implicitly bind to a random
+         * port, listening on all interfaces.
+         * @since v13.1.0, v12.16.0
+         */
+        addSourceSpecificMembership(sourceAddress: string, groupAddress: string, multicastInterface?: string): void;
+        /**
+         * Instructs the kernel to leave a source-specific multicast channel at the given`sourceAddress` and `groupAddress` using the `IP_DROP_SOURCE_MEMBERSHIP`socket option. This method is
+         * automatically called by the kernel when the
+         * socket is closed or the process terminates, so most apps will never have
+         * reason to call this.
+         *
+         * If `multicastInterface` is not specified, the operating system will attempt to
+         * drop membership on all valid interfaces.
+         * @since v13.1.0, v12.16.0
+         */
+        dropSourceSpecificMembership(sourceAddress: string, groupAddress: string, multicastInterface?: string): void;
+        /**
+         * events.EventEmitter
+         * 1. close
+         * 2. connect
+         * 3. error
+         * 4. listening
+         * 5. message
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'connect', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'listening', listener: () => void): this;
+        addListener(event: 'message', listener: (msg: Buffer, rinfo: RemoteInfo) => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'connect'): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'listening'): boolean;
+        emit(event: 'message', msg: Buffer, rinfo: RemoteInfo): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'connect', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'listening', listener: () => void): this;
+        on(event: 'message', listener: (msg: Buffer, rinfo: RemoteInfo) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'connect', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'listening', listener: () => void): this;
+        once(event: 'message', listener: (msg: Buffer, rinfo: RemoteInfo) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'connect', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'listening', listener: () => void): this;
+        prependListener(event: 'message', listener: (msg: Buffer, rinfo: RemoteInfo) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'connect', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'listening', listener: () => void): this;
+        prependOnceListener(event: 'message', listener: (msg: Buffer, rinfo: RemoteInfo) => void): this;
+    }
+}
+declare module 'node:dgram' {
+    export * from 'dgram';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/diagnostics_channel.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/diagnostics_channel.d.ts
new file mode 100644
index 0000000..915d2af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/diagnostics_channel.d.ts
@@ -0,0 +1,134 @@
+/**
+ * The `diagnostics_channel` module provides an API to create named channels
+ * to report arbitrary message data for diagnostics purposes.
+ *
+ * It can be accessed using:
+ *
+ * ```js
+ * import diagnostics_channel from 'diagnostics_channel';
+ * ```
+ *
+ * It is intended that a module writer wanting to report diagnostics messages
+ * will create one or many top-level channels to report messages through.
+ * Channels may also be acquired at runtime but it is not encouraged
+ * due to the additional overhead of doing so. Channels may be exported for
+ * convenience, but as long as the name is known it can be acquired anywhere.
+ *
+ * If you intend for your module to produce diagnostics data for others to
+ * consume it is recommended that you include documentation of what named
+ * channels are used along with the shape of the message data. Channel names
+ * should generally include the module name to avoid collisions with data from
+ * other modules.
+ * @experimental
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/diagnostics_channel.js)
+ */
+declare module 'diagnostics_channel' {
+    /**
+     * Check if there are active subscribers to the named channel. This is helpful if
+     * the message you want to send might be expensive to prepare.
+     *
+     * This API is optional but helpful when trying to publish messages from very
+     * performance-sensitive code.
+     *
+     * ```js
+     * import diagnostics_channel from 'diagnostics_channel';
+     *
+     * if (diagnostics_channel.hasSubscribers('my-channel')) {
+     *   // There are subscribers, prepare and publish message
+     * }
+     * ```
+     * @since v15.1.0, v14.17.0
+     * @param name The channel name
+     * @return If there are active subscribers
+     */
+    function hasSubscribers(name: string): boolean;
+    /**
+     * This is the primary entry-point for anyone wanting to interact with a named
+     * channel. It produces a channel object which is optimized to reduce overhead at
+     * publish time as much as possible.
+     *
+     * ```js
+     * import diagnostics_channel from 'diagnostics_channel';
+     *
+     * const channel = diagnostics_channel.channel('my-channel');
+     * ```
+     * @since v15.1.0, v14.17.0
+     * @param name The channel name
+     * @return The named channel object
+     */
+    function channel(name: string): Channel;
+    type ChannelListener = (name: string, message: unknown) => void;
+    /**
+     * The class `Channel` represents an individual named channel within the data
+     * pipeline. It is use to track subscribers and to publish messages when there
+     * are subscribers present. It exists as a separate object to avoid channel
+     * lookups at publish time, enabling very fast publish speeds and allowing
+     * for heavy use while incurring very minimal cost. Channels are created with {@link channel}, constructing a channel directly
+     * with `new Channel(name)` is not supported.
+     * @since v15.1.0, v14.17.0
+     */
+    class Channel {
+        readonly name: string;
+        /**
+         * Check if there are active subscribers to this channel. This is helpful if
+         * the message you want to send might be expensive to prepare.
+         *
+         * This API is optional but helpful when trying to publish messages from very
+         * performance-sensitive code.
+         *
+         * ```js
+         * import diagnostics_channel from 'diagnostics_channel';
+         *
+         * const channel = diagnostics_channel.channel('my-channel');
+         *
+         * if (channel.hasSubscribers) {
+         *   // There are subscribers, prepare and publish message
+         * }
+         * ```
+         * @since v15.1.0, v14.17.0
+         */
+        readonly hasSubscribers: boolean;
+        private constructor(name: string);
+        /**
+         * Register a message handler to subscribe to this channel. This message handler
+         * will be run synchronously whenever a message is published to the channel. Any
+         * errors thrown in the message handler will trigger an `'uncaughtException'`.
+         *
+         * ```js
+         * import diagnostics_channel from 'diagnostics_channel';
+         *
+         * const channel = diagnostics_channel.channel('my-channel');
+         *
+         * channel.subscribe((message, name) => {
+         *   // Received data
+         * });
+         * ```
+         * @since v15.1.0, v14.17.0
+         * @param onMessage The handler to receive channel messages
+         */
+        subscribe(onMessage: ChannelListener): void;
+        /**
+         * Remove a message handler previously registered to this channel with `channel.subscribe(onMessage)`.
+         *
+         * ```js
+         * import diagnostics_channel from 'diagnostics_channel';
+         *
+         * const channel = diagnostics_channel.channel('my-channel');
+         *
+         * function onMessage(message, name) {
+         *   // Received data
+         * }
+         *
+         * channel.subscribe(onMessage);
+         *
+         * channel.unsubscribe(onMessage);
+         * ```
+         * @since v15.1.0, v14.17.0
+         * @param onMessage The previous subscribed handler to remove
+         */
+        unsubscribe(onMessage: ChannelListener): void;
+    }
+}
+declare module 'node:diagnostics_channel' {
+    export * from 'diagnostics_channel';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/dns.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/dns.d.ts
new file mode 100644
index 0000000..d59f554
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/dns.d.ts
@@ -0,0 +1,659 @@
+/**
+ * The `dns` module enables name resolution. For example, use it to look up IP
+ * addresses of host names.
+ *
+ * Although named for the [Domain Name System (DNS)](https://en.wikipedia.org/wiki/Domain_Name_System), it does not always use the
+ * DNS protocol for lookups. {@link lookup} uses the operating system
+ * facilities to perform name resolution. It may not need to perform any network
+ * communication. To perform name resolution the way other applications on the same
+ * system do, use {@link lookup}.
+ *
+ * ```js
+ * const dns = require('dns');
+ *
+ * dns.lookup('example.org', (err, address, family) => {
+ *   console.log('address: %j family: IPv%s', address, family);
+ * });
+ * // address: "93.184.216.34" family: IPv4
+ * ```
+ *
+ * All other functions in the `dns` module connect to an actual DNS server to
+ * perform name resolution. They will always use the network to perform DNS
+ * queries. These functions do not use the same set of configuration files used by {@link lookup} (e.g. `/etc/hosts`). Use these functions to always perform
+ * DNS queries, bypassing other name-resolution facilities.
+ *
+ * ```js
+ * const dns = require('dns');
+ *
+ * dns.resolve4('archive.org', (err, addresses) => {
+ *   if (err) throw err;
+ *
+ *   console.log(`addresses: ${JSON.stringify(addresses)}`);
+ *
+ *   addresses.forEach((a) => {
+ *     dns.reverse(a, (err, hostnames) => {
+ *       if (err) {
+ *         throw err;
+ *       }
+ *       console.log(`reverse for ${a}: ${JSON.stringify(hostnames)}`);
+ *     });
+ *   });
+ * });
+ * ```
+ *
+ * See the `Implementation considerations section` for more information.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/dns.js)
+ */
+declare module 'dns' {
+    import * as dnsPromises from 'node:dns/promises';
+    // Supported getaddrinfo flags.
+    export const ADDRCONFIG: number;
+    export const V4MAPPED: number;
+    /**
+     * If `dns.V4MAPPED` is specified, return resolved IPv6 addresses as
+     * well as IPv4 mapped IPv6 addresses.
+     */
+    export const ALL: number;
+    export interface LookupOptions {
+        family?: number | undefined;
+        hints?: number | undefined;
+        all?: boolean | undefined;
+        /**
+         * @default true
+         */
+        verbatim?: boolean | undefined;
+    }
+    export interface LookupOneOptions extends LookupOptions {
+        all?: false | undefined;
+    }
+    export interface LookupAllOptions extends LookupOptions {
+        all: true;
+    }
+    export interface LookupAddress {
+        address: string;
+        family: number;
+    }
+    /**
+     * Resolves a host name (e.g. `'nodejs.org'`) into the first found A (IPv4) or
+     * AAAA (IPv6) record. All `option` properties are optional. If `options` is an
+     * integer, then it must be `4` or `6` – if `options` is not provided, then IPv4
+     * and IPv6 addresses are both returned if found.
+     *
+     * With the `all` option set to `true`, the arguments for `callback` change to`(err, addresses)`, with `addresses` being an array of objects with the
+     * properties `address` and `family`.
+     *
+     * On error, `err` is an `Error` object, where `err.code` is the error code.
+     * Keep in mind that `err.code` will be set to `'ENOTFOUND'` not only when
+     * the host name does not exist but also when the lookup fails in other ways
+     * such as no available file descriptors.
+     *
+     * `dns.lookup()` does not necessarily have anything to do with the DNS protocol.
+     * The implementation uses an operating system facility that can associate names
+     * with addresses, and vice versa. This implementation can have subtle but
+     * important consequences on the behavior of any Node.js program. Please take some
+     * time to consult the `Implementation considerations section` before using`dns.lookup()`.
+     *
+     * Example usage:
+     *
+     * ```js
+     * const dns = require('dns');
+     * const options = {
+     *   family: 6,
+     *   hints: dns.ADDRCONFIG | dns.V4MAPPED,
+     * };
+     * dns.lookup('example.com', options, (err, address, family) =>
+     *   console.log('address: %j family: IPv%s', address, family));
+     * // address: "2606:2800:220:1:248:1893:25c8:1946" family: IPv6
+     *
+     * // When options.all is true, the result will be an Array.
+     * options.all = true;
+     * dns.lookup('example.com', options, (err, addresses) =>
+     *   console.log('addresses: %j', addresses));
+     * // addresses: [{"address":"2606:2800:220:1:248:1893:25c8:1946","family":6}]
+     * ```
+     *
+     * If this method is invoked as its `util.promisify()` ed version, and `all`is not set to `true`, it returns a `Promise` for an `Object` with `address` and`family` properties.
+     * @since v0.1.90
+     */
+    export function lookup(hostname: string, family: number, callback: (err: NodeJS.ErrnoException | null, address: string, family: number) => void): void;
+    export function lookup(hostname: string, options: LookupOneOptions, callback: (err: NodeJS.ErrnoException | null, address: string, family: number) => void): void;
+    export function lookup(hostname: string, options: LookupAllOptions, callback: (err: NodeJS.ErrnoException | null, addresses: LookupAddress[]) => void): void;
+    export function lookup(hostname: string, options: LookupOptions, callback: (err: NodeJS.ErrnoException | null, address: string | LookupAddress[], family: number) => void): void;
+    export function lookup(hostname: string, callback: (err: NodeJS.ErrnoException | null, address: string, family: number) => void): void;
+    export namespace lookup {
+        function __promisify__(hostname: string, options: LookupAllOptions): Promise<LookupAddress[]>;
+        function __promisify__(hostname: string, options?: LookupOneOptions | number): Promise<LookupAddress>;
+        function __promisify__(hostname: string, options: LookupOptions): Promise<LookupAddress | LookupAddress[]>;
+    }
+    /**
+     * Resolves the given `address` and `port` into a host name and service using
+     * the operating system's underlying `getnameinfo` implementation.
+     *
+     * If `address` is not a valid IP address, a `TypeError` will be thrown.
+     * The `port` will be coerced to a number. If it is not a legal port, a `TypeError`will be thrown.
+     *
+     * On an error, `err` is an `Error` object, where `err.code` is the error code.
+     *
+     * ```js
+     * const dns = require('dns');
+     * dns.lookupService('127.0.0.1', 22, (err, hostname, service) => {
+     *   console.log(hostname, service);
+     *   // Prints: localhost ssh
+     * });
+     * ```
+     *
+     * If this method is invoked as its `util.promisify()` ed version, it returns a`Promise` for an `Object` with `hostname` and `service` properties.
+     * @since v0.11.14
+     */
+    export function lookupService(address: string, port: number, callback: (err: NodeJS.ErrnoException | null, hostname: string, service: string) => void): void;
+    export namespace lookupService {
+        function __promisify__(
+            address: string,
+            port: number
+        ): Promise<{
+            hostname: string;
+            service: string;
+        }>;
+    }
+    export interface ResolveOptions {
+        ttl: boolean;
+    }
+    export interface ResolveWithTtlOptions extends ResolveOptions {
+        ttl: true;
+    }
+    export interface RecordWithTtl {
+        address: string;
+        ttl: number;
+    }
+    /** @deprecated Use `AnyARecord` or `AnyAaaaRecord` instead. */
+    export type AnyRecordWithTtl = AnyARecord | AnyAaaaRecord;
+    export interface AnyARecord extends RecordWithTtl {
+        type: 'A';
+    }
+    export interface AnyAaaaRecord extends RecordWithTtl {
+        type: 'AAAA';
+    }
+    export interface CaaRecord {
+        critial: number;
+        issue?: string | undefined;
+        issuewild?: string | undefined;
+        iodef?: string | undefined;
+        contactemail?: string | undefined;
+        contactphone?: string | undefined;
+    }
+    export interface MxRecord {
+        priority: number;
+        exchange: string;
+    }
+    export interface AnyMxRecord extends MxRecord {
+        type: 'MX';
+    }
+    export interface NaptrRecord {
+        flags: string;
+        service: string;
+        regexp: string;
+        replacement: string;
+        order: number;
+        preference: number;
+    }
+    export interface AnyNaptrRecord extends NaptrRecord {
+        type: 'NAPTR';
+    }
+    export interface SoaRecord {
+        nsname: string;
+        hostmaster: string;
+        serial: number;
+        refresh: number;
+        retry: number;
+        expire: number;
+        minttl: number;
+    }
+    export interface AnySoaRecord extends SoaRecord {
+        type: 'SOA';
+    }
+    export interface SrvRecord {
+        priority: number;
+        weight: number;
+        port: number;
+        name: string;
+    }
+    export interface AnySrvRecord extends SrvRecord {
+        type: 'SRV';
+    }
+    export interface AnyTxtRecord {
+        type: 'TXT';
+        entries: string[];
+    }
+    export interface AnyNsRecord {
+        type: 'NS';
+        value: string;
+    }
+    export interface AnyPtrRecord {
+        type: 'PTR';
+        value: string;
+    }
+    export interface AnyCnameRecord {
+        type: 'CNAME';
+        value: string;
+    }
+    export type AnyRecord = AnyARecord | AnyAaaaRecord | AnyCnameRecord | AnyMxRecord | AnyNaptrRecord | AnyNsRecord | AnyPtrRecord | AnySoaRecord | AnySrvRecord | AnyTxtRecord;
+    /**
+     * Uses the DNS protocol to resolve a host name (e.g. `'nodejs.org'`) into an array
+     * of the resource records. The `callback` function has arguments`(err, records)`. When successful, `records` will be an array of resource
+     * records. The type and structure of individual results varies based on `rrtype`:
+     *
+     * <omitted>
+     *
+     * On error, `err` is an `Error` object, where `err.code` is one of theDNS error codes.
+     * @since v0.1.27
+     * @param hostname Host name to resolve.
+     * @param [rrtype='A'] Resource record type.
+     */
+    export function resolve(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'A', callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'AAAA', callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'ANY', callback: (err: NodeJS.ErrnoException | null, addresses: AnyRecord[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'CNAME', callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'MX', callback: (err: NodeJS.ErrnoException | null, addresses: MxRecord[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'NAPTR', callback: (err: NodeJS.ErrnoException | null, addresses: NaptrRecord[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'NS', callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'PTR', callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'SOA', callback: (err: NodeJS.ErrnoException | null, addresses: SoaRecord) => void): void;
+    export function resolve(hostname: string, rrtype: 'SRV', callback: (err: NodeJS.ErrnoException | null, addresses: SrvRecord[]) => void): void;
+    export function resolve(hostname: string, rrtype: 'TXT', callback: (err: NodeJS.ErrnoException | null, addresses: string[][]) => void): void;
+    export function resolve(
+        hostname: string,
+        rrtype: string,
+        callback: (err: NodeJS.ErrnoException | null, addresses: string[] | MxRecord[] | NaptrRecord[] | SoaRecord | SrvRecord[] | string[][] | AnyRecord[]) => void
+    ): void;
+    export namespace resolve {
+        function __promisify__(hostname: string, rrtype?: 'A' | 'AAAA' | 'CNAME' | 'NS' | 'PTR'): Promise<string[]>;
+        function __promisify__(hostname: string, rrtype: 'ANY'): Promise<AnyRecord[]>;
+        function __promisify__(hostname: string, rrtype: 'MX'): Promise<MxRecord[]>;
+        function __promisify__(hostname: string, rrtype: 'NAPTR'): Promise<NaptrRecord[]>;
+        function __promisify__(hostname: string, rrtype: 'SOA'): Promise<SoaRecord>;
+        function __promisify__(hostname: string, rrtype: 'SRV'): Promise<SrvRecord[]>;
+        function __promisify__(hostname: string, rrtype: 'TXT'): Promise<string[][]>;
+        function __promisify__(hostname: string, rrtype: string): Promise<string[] | MxRecord[] | NaptrRecord[] | SoaRecord | SrvRecord[] | string[][] | AnyRecord[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve a IPv4 addresses (`A` records) for the`hostname`. The `addresses` argument passed to the `callback` function
+     * will contain an array of IPv4 addresses (e.g.`['74.125.79.104', '74.125.79.105', '74.125.79.106']`).
+     * @since v0.1.16
+     * @param hostname Host name to resolve.
+     */
+    export function resolve4(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve4(hostname: string, options: ResolveWithTtlOptions, callback: (err: NodeJS.ErrnoException | null, addresses: RecordWithTtl[]) => void): void;
+    export function resolve4(hostname: string, options: ResolveOptions, callback: (err: NodeJS.ErrnoException | null, addresses: string[] | RecordWithTtl[]) => void): void;
+    export namespace resolve4 {
+        function __promisify__(hostname: string): Promise<string[]>;
+        function __promisify__(hostname: string, options: ResolveWithTtlOptions): Promise<RecordWithTtl[]>;
+        function __promisify__(hostname: string, options?: ResolveOptions): Promise<string[] | RecordWithTtl[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve a IPv6 addresses (`AAAA` records) for the`hostname`. The `addresses` argument passed to the `callback` function
+     * will contain an array of IPv6 addresses.
+     * @since v0.1.16
+     * @param hostname Host name to resolve.
+     */
+    export function resolve6(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export function resolve6(hostname: string, options: ResolveWithTtlOptions, callback: (err: NodeJS.ErrnoException | null, addresses: RecordWithTtl[]) => void): void;
+    export function resolve6(hostname: string, options: ResolveOptions, callback: (err: NodeJS.ErrnoException | null, addresses: string[] | RecordWithTtl[]) => void): void;
+    export namespace resolve6 {
+        function __promisify__(hostname: string): Promise<string[]>;
+        function __promisify__(hostname: string, options: ResolveWithTtlOptions): Promise<RecordWithTtl[]>;
+        function __promisify__(hostname: string, options?: ResolveOptions): Promise<string[] | RecordWithTtl[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve `CNAME` records for the `hostname`. The`addresses` argument passed to the `callback` function
+     * will contain an array of canonical name records available for the `hostname`(e.g. `['bar.example.com']`).
+     * @since v0.3.2
+     */
+    export function resolveCname(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export namespace resolveCname {
+        function __promisify__(hostname: string): Promise<string[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve `CAA` records for the `hostname`. The`addresses` argument passed to the `callback` function
+     * will contain an array of certification authority authorization records
+     * available for the `hostname` (e.g. `[{critical: 0, iodef: 'mailto:pki@example.com'}, {critical: 128, issue: 'pki.example.com'}]`).
+     * @since v15.0.0, v14.17.0
+     */
+    export function resolveCaa(hostname: string, callback: (err: NodeJS.ErrnoException | null, records: CaaRecord[]) => void): void;
+    export namespace resolveCaa {
+        function __promisify__(hostname: string): Promise<CaaRecord[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve mail exchange records (`MX` records) for the`hostname`. The `addresses` argument passed to the `callback` function will
+     * contain an array of objects containing both a `priority` and `exchange`property (e.g. `[{priority: 10, exchange: 'mx.example.com'}, ...]`).
+     * @since v0.1.27
+     */
+    export function resolveMx(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: MxRecord[]) => void): void;
+    export namespace resolveMx {
+        function __promisify__(hostname: string): Promise<MxRecord[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve regular expression based records (`NAPTR`records) for the `hostname`. The `addresses` argument passed to the `callback`function will contain an array of
+     * objects with the following properties:
+     *
+     * * `flags`
+     * * `service`
+     * * `regexp`
+     * * `replacement`
+     * * `order`
+     * * `preference`
+     *
+     * ```js
+     * {
+     *   flags: 's',
+     *   service: 'SIP+D2U',
+     *   regexp: '',
+     *   replacement: '_sip._udp.example.com',
+     *   order: 30,
+     *   preference: 100
+     * }
+     * ```
+     * @since v0.9.12
+     */
+    export function resolveNaptr(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: NaptrRecord[]) => void): void;
+    export namespace resolveNaptr {
+        function __promisify__(hostname: string): Promise<NaptrRecord[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve name server records (`NS` records) for the`hostname`. The `addresses` argument passed to the `callback` function will
+     * contain an array of name server records available for `hostname`(e.g. `['ns1.example.com', 'ns2.example.com']`).
+     * @since v0.1.90
+     */
+    export function resolveNs(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export namespace resolveNs {
+        function __promisify__(hostname: string): Promise<string[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve pointer records (`PTR` records) for the`hostname`. The `addresses` argument passed to the `callback` function will
+     * be an array of strings containing the reply records.
+     * @since v6.0.0
+     */
+    export function resolvePtr(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: string[]) => void): void;
+    export namespace resolvePtr {
+        function __promisify__(hostname: string): Promise<string[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve a start of authority record (`SOA` record) for
+     * the `hostname`. The `address` argument passed to the `callback` function will
+     * be an object with the following properties:
+     *
+     * * `nsname`
+     * * `hostmaster`
+     * * `serial`
+     * * `refresh`
+     * * `retry`
+     * * `expire`
+     * * `minttl`
+     *
+     * ```js
+     * {
+     *   nsname: 'ns.example.com',
+     *   hostmaster: 'root.example.com',
+     *   serial: 2013101809,
+     *   refresh: 10000,
+     *   retry: 2400,
+     *   expire: 604800,
+     *   minttl: 3600
+     * }
+     * ```
+     * @since v0.11.10
+     */
+    export function resolveSoa(hostname: string, callback: (err: NodeJS.ErrnoException | null, address: SoaRecord) => void): void;
+    export namespace resolveSoa {
+        function __promisify__(hostname: string): Promise<SoaRecord>;
+    }
+    /**
+     * Uses the DNS protocol to resolve service records (`SRV` records) for the`hostname`. The `addresses` argument passed to the `callback` function will
+     * be an array of objects with the following properties:
+     *
+     * * `priority`
+     * * `weight`
+     * * `port`
+     * * `name`
+     *
+     * ```js
+     * {
+     *   priority: 10,
+     *   weight: 5,
+     *   port: 21223,
+     *   name: 'service.example.com'
+     * }
+     * ```
+     * @since v0.1.27
+     */
+    export function resolveSrv(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: SrvRecord[]) => void): void;
+    export namespace resolveSrv {
+        function __promisify__(hostname: string): Promise<SrvRecord[]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve text queries (`TXT` records) for the`hostname`. The `records` argument passed to the `callback` function is a
+     * two-dimensional array of the text records available for `hostname` (e.g.`[ ['v=spf1 ip4:0.0.0.0 ', '~all' ] ]`). Each sub-array contains TXT chunks of
+     * one record. Depending on the use case, these could be either joined together or
+     * treated separately.
+     * @since v0.1.27
+     */
+    export function resolveTxt(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: string[][]) => void): void;
+    export namespace resolveTxt {
+        function __promisify__(hostname: string): Promise<string[][]>;
+    }
+    /**
+     * Uses the DNS protocol to resolve all records (also known as `ANY` or `*` query).
+     * The `ret` argument passed to the `callback` function will be an array containing
+     * various types of records. Each object has a property `type` that indicates the
+     * type of the current record. And depending on the `type`, additional properties
+     * will be present on the object:
+     *
+     * <omitted>
+     *
+     * Here is an example of the `ret` object passed to the callback:
+     *
+     * ```js
+     * [ { type: 'A', address: '127.0.0.1', ttl: 299 },
+     *   { type: 'CNAME', value: 'example.com' },
+     *   { type: 'MX', exchange: 'alt4.aspmx.l.example.com', priority: 50 },
+     *   { type: 'NS', value: 'ns1.example.com' },
+     *   { type: 'TXT', entries: [ 'v=spf1 include:_spf.example.com ~all' ] },
+     *   { type: 'SOA',
+     *     nsname: 'ns1.example.com',
+     *     hostmaster: 'admin.example.com',
+     *     serial: 156696742,
+     *     refresh: 900,
+     *     retry: 900,
+     *     expire: 1800,
+     *     minttl: 60 } ]
+     * ```
+     *
+     * DNS server operators may choose not to respond to `ANY`queries. It may be better to call individual methods like {@link resolve4},{@link resolveMx}, and so on. For more details, see [RFC
+     * 8482](https://tools.ietf.org/html/rfc8482).
+     */
+    export function resolveAny(hostname: string, callback: (err: NodeJS.ErrnoException | null, addresses: AnyRecord[]) => void): void;
+    export namespace resolveAny {
+        function __promisify__(hostname: string): Promise<AnyRecord[]>;
+    }
+    /**
+     * Performs a reverse DNS query that resolves an IPv4 or IPv6 address to an
+     * array of host names.
+     *
+     * On error, `err` is an `Error` object, where `err.code` is
+     * one of the `DNS error codes`.
+     * @since v0.1.16
+     */
+    export function reverse(ip: string, callback: (err: NodeJS.ErrnoException | null, hostnames: string[]) => void): void;
+    /**
+     * Sets the IP address and port of servers to be used when performing DNS
+     * resolution. The `servers` argument is an array of [RFC 5952](https://tools.ietf.org/html/rfc5952#section-6) formatted
+     * addresses. If the port is the IANA default DNS port (53) it can be omitted.
+     *
+     * ```js
+     * dns.setServers([
+     *   '4.4.4.4',
+     *   '[2001:4860:4860::8888]',
+     *   '4.4.4.4:1053',
+     *   '[2001:4860:4860::8888]:1053',
+     * ]);
+     * ```
+     *
+     * An error will be thrown if an invalid address is provided.
+     *
+     * The `dns.setServers()` method must not be called while a DNS query is in
+     * progress.
+     *
+     * The {@link setServers} method affects only {@link resolve},`dns.resolve*()` and {@link reverse} (and specifically _not_ {@link lookup}).
+     *
+     * This method works much like [resolve.conf](https://man7.org/linux/man-pages/man5/resolv.conf.5.html).
+     * That is, if attempting to resolve with the first server provided results in a`NOTFOUND` error, the `resolve()` method will _not_ attempt to resolve with
+     * subsequent servers provided. Fallback DNS servers will only be used if the
+     * earlier ones time out or result in some other error.
+     * @since v0.11.3
+     * @param servers array of `RFC 5952` formatted addresses
+     */
+    export function setServers(servers: ReadonlyArray<string>): void;
+    /**
+     * Returns an array of IP address strings, formatted according to [RFC 5952](https://tools.ietf.org/html/rfc5952#section-6),
+     * that are currently configured for DNS resolution. A string will include a port
+     * section if a custom port is used.
+     *
+     * ```js
+     * [
+     *   '4.4.4.4',
+     *   '2001:4860:4860::8888',
+     *   '4.4.4.4:1053',
+     *   '[2001:4860:4860::8888]:1053',
+     * ]
+     * ```
+     * @since v0.11.3
+     */
+    export function getServers(): string[];
+    /**
+     * Set the default value of `verbatim` in {@link lookup} and `dnsPromises.lookup()`. The value could be:
+     *
+     * * `ipv4first`: sets default `verbatim` `false`.
+     * * `verbatim`: sets default `verbatim` `true`.
+     *
+     * The default is `ipv4first` and {@link setDefaultResultOrder} have higher
+     * priority than `--dns-result-order`. When using `worker threads`,{@link setDefaultResultOrder} from the main thread won't affect the default
+     * dns orders in workers.
+     * @since v16.4.0, v14.18.0
+     * @param order must be `'ipv4first'` or `'verbatim'`.
+     */
+    export function setDefaultResultOrder(order: 'ipv4first' | 'verbatim'): void;
+    // Error codes
+    export const NODATA: string;
+    export const FORMERR: string;
+    export const SERVFAIL: string;
+    export const NOTFOUND: string;
+    export const NOTIMP: string;
+    export const REFUSED: string;
+    export const BADQUERY: string;
+    export const BADNAME: string;
+    export const BADFAMILY: string;
+    export const BADRESP: string;
+    export const CONNREFUSED: string;
+    export const TIMEOUT: string;
+    export const EOF: string;
+    export const FILE: string;
+    export const NOMEM: string;
+    export const DESTRUCTION: string;
+    export const BADSTR: string;
+    export const BADFLAGS: string;
+    export const NONAME: string;
+    export const BADHINTS: string;
+    export const NOTINITIALIZED: string;
+    export const LOADIPHLPAPI: string;
+    export const ADDRGETNETWORKPARAMS: string;
+    export const CANCELLED: string;
+    export interface ResolverOptions {
+        timeout?: number | undefined;
+        /**
+         * @default 4
+         */
+        tries?: number;
+    }
+    /**
+     * An independent resolver for DNS requests.
+     *
+     * Creating a new resolver uses the default server settings. Setting
+     * the servers used for a resolver using `resolver.setServers()` does not affect
+     * other resolvers:
+     *
+     * ```js
+     * const { Resolver } = require('dns');
+     * const resolver = new Resolver();
+     * resolver.setServers(['4.4.4.4']);
+     *
+     * // This request will use the server at 4.4.4.4, independent of global settings.
+     * resolver.resolve4('example.org', (err, addresses) => {
+     *   // ...
+     * });
+     * ```
+     *
+     * The following methods from the `dns` module are available:
+     *
+     * * `resolver.getServers()`
+     * * `resolver.resolve()`
+     * * `resolver.resolve4()`
+     * * `resolver.resolve6()`
+     * * `resolver.resolveAny()`
+     * * `resolver.resolveCaa()`
+     * * `resolver.resolveCname()`
+     * * `resolver.resolveMx()`
+     * * `resolver.resolveNaptr()`
+     * * `resolver.resolveNs()`
+     * * `resolver.resolvePtr()`
+     * * `resolver.resolveSoa()`
+     * * `resolver.resolveSrv()`
+     * * `resolver.resolveTxt()`
+     * * `resolver.reverse()`
+     * * `resolver.setServers()`
+     * @since v8.3.0
+     */
+    export class Resolver {
+        constructor(options?: ResolverOptions);
+        /**
+         * Cancel all outstanding DNS queries made by this resolver. The corresponding
+         * callbacks will be called with an error with code `ECANCELLED`.
+         * @since v8.3.0
+         */
+        cancel(): void;
+        getServers: typeof getServers;
+        resolve: typeof resolve;
+        resolve4: typeof resolve4;
+        resolve6: typeof resolve6;
+        resolveAny: typeof resolveAny;
+        resolveCname: typeof resolveCname;
+        resolveMx: typeof resolveMx;
+        resolveNaptr: typeof resolveNaptr;
+        resolveNs: typeof resolveNs;
+        resolvePtr: typeof resolvePtr;
+        resolveSoa: typeof resolveSoa;
+        resolveSrv: typeof resolveSrv;
+        resolveTxt: typeof resolveTxt;
+        reverse: typeof reverse;
+        /**
+         * The resolver instance will send its requests from the specified IP address.
+         * This allows programs to specify outbound interfaces when used on multi-homed
+         * systems.
+         *
+         * If a v4 or v6 address is not specified, it is set to the default, and the
+         * operating system will choose a local address automatically.
+         *
+         * The resolver will use the v4 local address when making requests to IPv4 DNS
+         * servers, and the v6 local address when making requests to IPv6 DNS servers.
+         * The `rrtype` of resolution requests has no impact on the local address used.
+         * @since v15.1.0, v14.17.0
+         * @param [ipv4='0.0.0.0'] A string representation of an IPv4 address.
+         * @param [ipv6='::0'] A string representation of an IPv6 address.
+         */
+        setLocalAddress(ipv4?: string, ipv6?: string): void;
+        setServers: typeof setServers;
+    }
+    export { dnsPromises as promises };
+}
+declare module 'node:dns' {
+    export * from 'dns';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/dns/promises.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/dns/promises.d.ts
new file mode 100644
index 0000000..165b62b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/dns/promises.d.ts
@@ -0,0 +1,370 @@
+/**
+ * The `dns.promises` API provides an alternative set of asynchronous DNS methods
+ * that return `Promise` objects rather than using callbacks. The API is accessible
+ * via `require('dns').promises` or `require('dns/promises')`.
+ * @since v10.6.0
+ */
+declare module 'dns/promises' {
+    import {
+        LookupAddress,
+        LookupOneOptions,
+        LookupAllOptions,
+        LookupOptions,
+        AnyRecord,
+        CaaRecord,
+        MxRecord,
+        NaptrRecord,
+        SoaRecord,
+        SrvRecord,
+        ResolveWithTtlOptions,
+        RecordWithTtl,
+        ResolveOptions,
+        ResolverOptions,
+    } from 'node:dns';
+    /**
+     * Returns an array of IP address strings, formatted according to [RFC 5952](https://tools.ietf.org/html/rfc5952#section-6),
+     * that are currently configured for DNS resolution. A string will include a port
+     * section if a custom port is used.
+     *
+     * ```js
+     * [
+     *   '4.4.4.4',
+     *   '2001:4860:4860::8888',
+     *   '4.4.4.4:1053',
+     *   '[2001:4860:4860::8888]:1053',
+     * ]
+     * ```
+     * @since v10.6.0
+     */
+    function getServers(): string[];
+    /**
+     * Resolves a host name (e.g. `'nodejs.org'`) into the first found A (IPv4) or
+     * AAAA (IPv6) record. All `option` properties are optional. If `options` is an
+     * integer, then it must be `4` or `6` – if `options` is not provided, then IPv4
+     * and IPv6 addresses are both returned if found.
+     *
+     * With the `all` option set to `true`, the `Promise` is resolved with `addresses`being an array of objects with the properties `address` and `family`.
+     *
+     * On error, the `Promise` is rejected with an `Error` object, where `err.code`is the error code.
+     * Keep in mind that `err.code` will be set to `'ENOTFOUND'` not only when
+     * the host name does not exist but also when the lookup fails in other ways
+     * such as no available file descriptors.
+     *
+     * `dnsPromises.lookup()` does not necessarily have anything to do with the DNS
+     * protocol. The implementation uses an operating system facility that can
+     * associate names with addresses, and vice versa. This implementation can have
+     * subtle but important consequences on the behavior of any Node.js program. Please
+     * take some time to consult the `Implementation considerations section` before
+     * using `dnsPromises.lookup()`.
+     *
+     * Example usage:
+     *
+     * ```js
+     * const dns = require('dns');
+     * const dnsPromises = dns.promises;
+     * const options = {
+     *   family: 6,
+     *   hints: dns.ADDRCONFIG | dns.V4MAPPED,
+     * };
+     *
+     * dnsPromises.lookup('example.com', options).then((result) => {
+     *   console.log('address: %j family: IPv%s', result.address, result.family);
+     *   // address: "2606:2800:220:1:248:1893:25c8:1946" family: IPv6
+     * });
+     *
+     * // When options.all is true, the result will be an Array.
+     * options.all = true;
+     * dnsPromises.lookup('example.com', options).then((result) => {
+     *   console.log('addresses: %j', result);
+     *   // addresses: [{"address":"2606:2800:220:1:248:1893:25c8:1946","family":6}]
+     * });
+     * ```
+     * @since v10.6.0
+     */
+    function lookup(hostname: string, family: number): Promise<LookupAddress>;
+    function lookup(hostname: string, options: LookupOneOptions): Promise<LookupAddress>;
+    function lookup(hostname: string, options: LookupAllOptions): Promise<LookupAddress[]>;
+    function lookup(hostname: string, options: LookupOptions): Promise<LookupAddress | LookupAddress[]>;
+    function lookup(hostname: string): Promise<LookupAddress>;
+    /**
+     * Resolves the given `address` and `port` into a host name and service using
+     * the operating system's underlying `getnameinfo` implementation.
+     *
+     * If `address` is not a valid IP address, a `TypeError` will be thrown.
+     * The `port` will be coerced to a number. If it is not a legal port, a `TypeError`will be thrown.
+     *
+     * On error, the `Promise` is rejected with an `Error` object, where `err.code`is the error code.
+     *
+     * ```js
+     * const dnsPromises = require('dns').promises;
+     * dnsPromises.lookupService('127.0.0.1', 22).then((result) => {
+     *   console.log(result.hostname, result.service);
+     *   // Prints: localhost ssh
+     * });
+     * ```
+     * @since v10.6.0
+     */
+    function lookupService(
+        address: string,
+        port: number
+    ): Promise<{
+        hostname: string;
+        service: string;
+    }>;
+    /**
+     * Uses the DNS protocol to resolve a host name (e.g. `'nodejs.org'`) into an array
+     * of the resource records. When successful, the `Promise` is resolved with an
+     * array of resource records. The type and structure of individual results vary
+     * based on `rrtype`:
+     *
+     * <omitted>
+     *
+     * On error, the `Promise` is rejected with an `Error` object, where `err.code`is one of the DNS error codes.
+     * @since v10.6.0
+     * @param hostname Host name to resolve.
+     * @param [rrtype='A'] Resource record type.
+     */
+    function resolve(hostname: string): Promise<string[]>;
+    function resolve(hostname: string, rrtype: 'A'): Promise<string[]>;
+    function resolve(hostname: string, rrtype: 'AAAA'): Promise<string[]>;
+    function resolve(hostname: string, rrtype: 'ANY'): Promise<AnyRecord[]>;
+    function resolve(hostname: string, rrtype: 'CAA'): Promise<CaaRecord[]>;
+    function resolve(hostname: string, rrtype: 'CNAME'): Promise<string[]>;
+    function resolve(hostname: string, rrtype: 'MX'): Promise<MxRecord[]>;
+    function resolve(hostname: string, rrtype: 'NAPTR'): Promise<NaptrRecord[]>;
+    function resolve(hostname: string, rrtype: 'NS'): Promise<string[]>;
+    function resolve(hostname: string, rrtype: 'PTR'): Promise<string[]>;
+    function resolve(hostname: string, rrtype: 'SOA'): Promise<SoaRecord>;
+    function resolve(hostname: string, rrtype: 'SRV'): Promise<SrvRecord[]>;
+    function resolve(hostname: string, rrtype: 'TXT'): Promise<string[][]>;
+    function resolve(hostname: string, rrtype: string): Promise<string[] | MxRecord[] | NaptrRecord[] | SoaRecord | SrvRecord[] | string[][] | AnyRecord[]>;
+    /**
+     * Uses the DNS protocol to resolve IPv4 addresses (`A` records) for the`hostname`. On success, the `Promise` is resolved with an array of IPv4
+     * addresses (e.g. `['74.125.79.104', '74.125.79.105', '74.125.79.106']`).
+     * @since v10.6.0
+     * @param hostname Host name to resolve.
+     */
+    function resolve4(hostname: string): Promise<string[]>;
+    function resolve4(hostname: string, options: ResolveWithTtlOptions): Promise<RecordWithTtl[]>;
+    function resolve4(hostname: string, options: ResolveOptions): Promise<string[] | RecordWithTtl[]>;
+    /**
+     * Uses the DNS protocol to resolve IPv6 addresses (`AAAA` records) for the`hostname`. On success, the `Promise` is resolved with an array of IPv6
+     * addresses.
+     * @since v10.6.0
+     * @param hostname Host name to resolve.
+     */
+    function resolve6(hostname: string): Promise<string[]>;
+    function resolve6(hostname: string, options: ResolveWithTtlOptions): Promise<RecordWithTtl[]>;
+    function resolve6(hostname: string, options: ResolveOptions): Promise<string[] | RecordWithTtl[]>;
+    /**
+     * Uses the DNS protocol to resolve all records (also known as `ANY` or `*` query).
+     * On success, the `Promise` is resolved with an array containing various types of
+     * records. Each object has a property `type` that indicates the type of the
+     * current record. And depending on the `type`, additional properties will be
+     * present on the object:
+     *
+     * <omitted>
+     *
+     * Here is an example of the result object:
+     *
+     * ```js
+     * [ { type: 'A', address: '127.0.0.1', ttl: 299 },
+     *   { type: 'CNAME', value: 'example.com' },
+     *   { type: 'MX', exchange: 'alt4.aspmx.l.example.com', priority: 50 },
+     *   { type: 'NS', value: 'ns1.example.com' },
+     *   { type: 'TXT', entries: [ 'v=spf1 include:_spf.example.com ~all' ] },
+     *   { type: 'SOA',
+     *     nsname: 'ns1.example.com',
+     *     hostmaster: 'admin.example.com',
+     *     serial: 156696742,
+     *     refresh: 900,
+     *     retry: 900,
+     *     expire: 1800,
+     *     minttl: 60 } ]
+     * ```
+     * @since v10.6.0
+     */
+    function resolveAny(hostname: string): Promise<AnyRecord[]>;
+    /**
+     * Uses the DNS protocol to resolve `CAA` records for the `hostname`. On success,
+     * the `Promise` is resolved with an array of objects containing available
+     * certification authority authorization records available for the `hostname`(e.g. `[{critical: 0, iodef: 'mailto:pki@example.com'},{critical: 128, issue: 'pki.example.com'}]`).
+     * @since v15.0.0, v14.17.0
+     */
+    function resolveCaa(hostname: string): Promise<CaaRecord[]>;
+    /**
+     * Uses the DNS protocol to resolve `CNAME` records for the `hostname`. On success,
+     * the `Promise` is resolved with an array of canonical name records available for
+     * the `hostname` (e.g. `['bar.example.com']`).
+     * @since v10.6.0
+     */
+    function resolveCname(hostname: string): Promise<string[]>;
+    /**
+     * Uses the DNS protocol to resolve mail exchange records (`MX` records) for the`hostname`. On success, the `Promise` is resolved with an array of objects
+     * containing both a `priority` and `exchange` property (e.g.`[{priority: 10, exchange: 'mx.example.com'}, ...]`).
+     * @since v10.6.0
+     */
+    function resolveMx(hostname: string): Promise<MxRecord[]>;
+    /**
+     * Uses the DNS protocol to resolve regular expression based records (`NAPTR`records) for the `hostname`. On success, the `Promise` is resolved with an array
+     * of objects with the following properties:
+     *
+     * * `flags`
+     * * `service`
+     * * `regexp`
+     * * `replacement`
+     * * `order`
+     * * `preference`
+     *
+     * ```js
+     * {
+     *   flags: 's',
+     *   service: 'SIP+D2U',
+     *   regexp: '',
+     *   replacement: '_sip._udp.example.com',
+     *   order: 30,
+     *   preference: 100
+     * }
+     * ```
+     * @since v10.6.0
+     */
+    function resolveNaptr(hostname: string): Promise<NaptrRecord[]>;
+    /**
+     * Uses the DNS protocol to resolve name server records (`NS` records) for the`hostname`. On success, the `Promise` is resolved with an array of name server
+     * records available for `hostname` (e.g.`['ns1.example.com', 'ns2.example.com']`).
+     * @since v10.6.0
+     */
+    function resolveNs(hostname: string): Promise<string[]>;
+    /**
+     * Uses the DNS protocol to resolve pointer records (`PTR` records) for the`hostname`. On success, the `Promise` is resolved with an array of strings
+     * containing the reply records.
+     * @since v10.6.0
+     */
+    function resolvePtr(hostname: string): Promise<string[]>;
+    /**
+     * Uses the DNS protocol to resolve a start of authority record (`SOA` record) for
+     * the `hostname`. On success, the `Promise` is resolved with an object with the
+     * following properties:
+     *
+     * * `nsname`
+     * * `hostmaster`
+     * * `serial`
+     * * `refresh`
+     * * `retry`
+     * * `expire`
+     * * `minttl`
+     *
+     * ```js
+     * {
+     *   nsname: 'ns.example.com',
+     *   hostmaster: 'root.example.com',
+     *   serial: 2013101809,
+     *   refresh: 10000,
+     *   retry: 2400,
+     *   expire: 604800,
+     *   minttl: 3600
+     * }
+     * ```
+     * @since v10.6.0
+     */
+    function resolveSoa(hostname: string): Promise<SoaRecord>;
+    /**
+     * Uses the DNS protocol to resolve service records (`SRV` records) for the`hostname`. On success, the `Promise` is resolved with an array of objects with
+     * the following properties:
+     *
+     * * `priority`
+     * * `weight`
+     * * `port`
+     * * `name`
+     *
+     * ```js
+     * {
+     *   priority: 10,
+     *   weight: 5,
+     *   port: 21223,
+     *   name: 'service.example.com'
+     * }
+     * ```
+     * @since v10.6.0
+     */
+    function resolveSrv(hostname: string): Promise<SrvRecord[]>;
+    /**
+     * Uses the DNS protocol to resolve text queries (`TXT` records) for the`hostname`. On success, the `Promise` is resolved with a two-dimensional array
+     * of the text records available for `hostname` (e.g.`[ ['v=spf1 ip4:0.0.0.0 ', '~all' ] ]`). Each sub-array contains TXT chunks of
+     * one record. Depending on the use case, these could be either joined together or
+     * treated separately.
+     * @since v10.6.0
+     */
+    function resolveTxt(hostname: string): Promise<string[][]>;
+    /**
+     * Performs a reverse DNS query that resolves an IPv4 or IPv6 address to an
+     * array of host names.
+     *
+     * On error, the `Promise` is rejected with an `Error` object, where `err.code`is one of the DNS error codes.
+     * @since v10.6.0
+     */
+    function reverse(ip: string): Promise<string[]>;
+    /**
+     * Sets the IP address and port of servers to be used when performing DNS
+     * resolution. The `servers` argument is an array of [RFC 5952](https://tools.ietf.org/html/rfc5952#section-6) formatted
+     * addresses. If the port is the IANA default DNS port (53) it can be omitted.
+     *
+     * ```js
+     * dnsPromises.setServers([
+     *   '4.4.4.4',
+     *   '[2001:4860:4860::8888]',
+     *   '4.4.4.4:1053',
+     *   '[2001:4860:4860::8888]:1053',
+     * ]);
+     * ```
+     *
+     * An error will be thrown if an invalid address is provided.
+     *
+     * The `dnsPromises.setServers()` method must not be called while a DNS query is in
+     * progress.
+     *
+     * This method works much like [resolve.conf](https://man7.org/linux/man-pages/man5/resolv.conf.5.html).
+     * That is, if attempting to resolve with the first server provided results in a`NOTFOUND` error, the `resolve()` method will _not_ attempt to resolve with
+     * subsequent servers provided. Fallback DNS servers will only be used if the
+     * earlier ones time out or result in some other error.
+     * @since v10.6.0
+     * @param servers array of `RFC 5952` formatted addresses
+     */
+    function setServers(servers: ReadonlyArray<string>): void;
+    /**
+     * Set the default value of `verbatim` in `dns.lookup()` and `dnsPromises.lookup()`. The value could be:
+     *
+     * * `ipv4first`: sets default `verbatim` `false`.
+     * * `verbatim`: sets default `verbatim` `true`.
+     *
+     * The default is `ipv4first` and `dnsPromises.setDefaultResultOrder()` have
+     * higher priority than `--dns-result-order`. When using `worker threads`,`dnsPromises.setDefaultResultOrder()` from the main thread won't affect the
+     * default dns orders in workers.
+     * @since v16.4.0, v14.18.0
+     * @param order must be `'ipv4first'` or `'verbatim'`.
+     */
+    function setDefaultResultOrder(order: 'ipv4first' | 'verbatim'): void;
+    class Resolver {
+        constructor(options?: ResolverOptions);
+        cancel(): void;
+        getServers: typeof getServers;
+        resolve: typeof resolve;
+        resolve4: typeof resolve4;
+        resolve6: typeof resolve6;
+        resolveAny: typeof resolveAny;
+        resolveCname: typeof resolveCname;
+        resolveMx: typeof resolveMx;
+        resolveNaptr: typeof resolveNaptr;
+        resolveNs: typeof resolveNs;
+        resolvePtr: typeof resolvePtr;
+        resolveSoa: typeof resolveSoa;
+        resolveSrv: typeof resolveSrv;
+        resolveTxt: typeof resolveTxt;
+        reverse: typeof reverse;
+        setLocalAddress(ipv4?: string, ipv6?: string): void;
+        setServers: typeof setServers;
+    }
+}
+declare module 'node:dns/promises' {
+    export * from 'dns/promises';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/domain.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/domain.d.ts
new file mode 100644
index 0000000..f8dd26e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/domain.d.ts
@@ -0,0 +1,169 @@
+/**
+ * **This module is pending deprecation.** Once a replacement API has been
+ * finalized, this module will be fully deprecated. Most developers should**not** have cause to use this module. Users who absolutely must have
+ * the functionality that domains provide may rely on it for the time being
+ * but should expect to have to migrate to a different solution
+ * in the future.
+ *
+ * Domains provide a way to handle multiple different IO operations as a
+ * single group. If any of the event emitters or callbacks registered to a
+ * domain emit an `'error'` event, or throw an error, then the domain object
+ * will be notified, rather than losing the context of the error in the`process.on('uncaughtException')` handler, or causing the program to
+ * exit immediately with an error code.
+ * @deprecated Since v1.4.2 - Deprecated
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/domain.js)
+ */
+declare module 'domain' {
+    import EventEmitter = require('node:events');
+    /**
+     * The `Domain` class encapsulates the functionality of routing errors and
+     * uncaught exceptions to the active `Domain` object.
+     *
+     * To handle the errors that it catches, listen to its `'error'` event.
+     */
+    class Domain extends EventEmitter {
+        /**
+         * An array of timers and event emitters that have been explicitly added
+         * to the domain.
+         */
+        members: Array<EventEmitter | NodeJS.Timer>;
+        /**
+         * The `enter()` method is plumbing used by the `run()`, `bind()`, and`intercept()` methods to set the active domain. It sets `domain.active` and`process.domain` to the domain, and implicitly
+         * pushes the domain onto the domain
+         * stack managed by the domain module (see {@link exit} for details on the
+         * domain stack). The call to `enter()` delimits the beginning of a chain of
+         * asynchronous calls and I/O operations bound to a domain.
+         *
+         * Calling `enter()` changes only the active domain, and does not alter the domain
+         * itself. `enter()` and `exit()` can be called an arbitrary number of times on a
+         * single domain.
+         */
+        enter(): void;
+        /**
+         * The `exit()` method exits the current domain, popping it off the domain stack.
+         * Any time execution is going to switch to the context of a different chain of
+         * asynchronous calls, it's important to ensure that the current domain is exited.
+         * The call to `exit()` delimits either the end of or an interruption to the chain
+         * of asynchronous calls and I/O operations bound to a domain.
+         *
+         * If there are multiple, nested domains bound to the current execution context,`exit()` will exit any domains nested within this domain.
+         *
+         * Calling `exit()` changes only the active domain, and does not alter the domain
+         * itself. `enter()` and `exit()` can be called an arbitrary number of times on a
+         * single domain.
+         */
+        exit(): void;
+        /**
+         * Run the supplied function in the context of the domain, implicitly
+         * binding all event emitters, timers, and lowlevel requests that are
+         * created in that context. Optionally, arguments can be passed to
+         * the function.
+         *
+         * This is the most basic way to use a domain.
+         *
+         * ```js
+         * const domain = require('domain');
+         * const fs = require('fs');
+         * const d = domain.create();
+         * d.on('error', (er) => {
+         *   console.error('Caught error!', er);
+         * });
+         * d.run(() => {
+         *   process.nextTick(() => {
+         *     setTimeout(() => { // Simulating some various async stuff
+         *       fs.open('non-existent file', 'r', (er, fd) => {
+         *         if (er) throw er;
+         *         // proceed...
+         *       });
+         *     }, 100);
+         *   });
+         * });
+         * ```
+         *
+         * In this example, the `d.on('error')` handler will be triggered, rather
+         * than crashing the program.
+         */
+        run<T>(fn: (...args: any[]) => T, ...args: any[]): T;
+        /**
+         * Explicitly adds an emitter to the domain. If any event handlers called by
+         * the emitter throw an error, or if the emitter emits an `'error'` event, it
+         * will be routed to the domain's `'error'` event, just like with implicit
+         * binding.
+         *
+         * This also works with timers that are returned from `setInterval()` and `setTimeout()`. If their callback function throws, it will be caught by
+         * the domain `'error'` handler.
+         *
+         * If the Timer or `EventEmitter` was already bound to a domain, it is removed
+         * from that one, and bound to this one instead.
+         * @param emitter emitter or timer to be added to the domain
+         */
+        add(emitter: EventEmitter | NodeJS.Timer): void;
+        /**
+         * The opposite of {@link add}. Removes domain handling from the
+         * specified emitter.
+         * @param emitter emitter or timer to be removed from the domain
+         */
+        remove(emitter: EventEmitter | NodeJS.Timer): void;
+        /**
+         * The returned function will be a wrapper around the supplied callback
+         * function. When the returned function is called, any errors that are
+         * thrown will be routed to the domain's `'error'` event.
+         *
+         * ```js
+         * const d = domain.create();
+         *
+         * function readSomeFile(filename, cb) {
+         *   fs.readFile(filename, 'utf8', d.bind((er, data) => {
+         *     // If this throws, it will also be passed to the domain.
+         *     return cb(er, data ? JSON.parse(data) : null);
+         *   }));
+         * }
+         *
+         * d.on('error', (er) => {
+         *   // An error occurred somewhere. If we throw it now, it will crash the program
+         *   // with the normal line number and stack message.
+         * });
+         * ```
+         * @param callback The callback function
+         * @return The bound function
+         */
+        bind<T extends Function>(callback: T): T;
+        /**
+         * This method is almost identical to {@link bind}. However, in
+         * addition to catching thrown errors, it will also intercept `Error` objects sent as the first argument to the function.
+         *
+         * In this way, the common `if (err) return callback(err);` pattern can be replaced
+         * with a single error handler in a single place.
+         *
+         * ```js
+         * const d = domain.create();
+         *
+         * function readSomeFile(filename, cb) {
+         *   fs.readFile(filename, 'utf8', d.intercept((data) => {
+         *     // Note, the first argument is never passed to the
+         *     // callback since it is assumed to be the 'Error' argument
+         *     // and thus intercepted by the domain.
+         *
+         *     // If this throws, it will also be passed to the domain
+         *     // so the error-handling logic can be moved to the 'error'
+         *     // event on the domain instead of being repeated throughout
+         *     // the program.
+         *     return cb(null, JSON.parse(data));
+         *   }));
+         * }
+         *
+         * d.on('error', (er) => {
+         *   // An error occurred somewhere. If we throw it now, it will crash the program
+         *   // with the normal line number and stack message.
+         * });
+         * ```
+         * @param callback The callback function
+         * @return The intercepted function
+         */
+        intercept<T extends Function>(callback: T): T;
+    }
+    function create(): Domain;
+}
+declare module 'node:domain' {
+    export * from 'domain';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/events.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/events.d.ts
new file mode 100644
index 0000000..c1cef43
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/events.d.ts
@@ -0,0 +1,651 @@
+/**
+ * Much of the Node.js core API is built around an idiomatic asynchronous
+ * event-driven architecture in which certain kinds of objects (called "emitters")
+ * emit named events that cause `Function` objects ("listeners") to be called.
+ *
+ * For instance: a `net.Server` object emits an event each time a peer
+ * connects to it; a `fs.ReadStream` emits an event when the file is opened;
+ * a `stream` emits an event whenever data is available to be read.
+ *
+ * All objects that emit events are instances of the `EventEmitter` class. These
+ * objects expose an `eventEmitter.on()` function that allows one or more
+ * functions to be attached to named events emitted by the object. Typically,
+ * event names are camel-cased strings but any valid JavaScript property key
+ * can be used.
+ *
+ * When the `EventEmitter` object emits an event, all of the functions attached
+ * to that specific event are called _synchronously_. Any values returned by the
+ * called listeners are _ignored_ and discarded.
+ *
+ * The following example shows a simple `EventEmitter` instance with a single
+ * listener. The `eventEmitter.on()` method is used to register listeners, while
+ * the `eventEmitter.emit()` method is used to trigger the event.
+ *
+ * ```js
+ * const EventEmitter = require('events');
+ *
+ * class MyEmitter extends EventEmitter {}
+ *
+ * const myEmitter = new MyEmitter();
+ * myEmitter.on('event', () => {
+ *   console.log('an event occurred!');
+ * });
+ * myEmitter.emit('event');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/events.js)
+ */
+declare module 'events' {
+    interface EventEmitterOptions {
+        /**
+         * Enables automatic capturing of promise rejection.
+         */
+        captureRejections?: boolean | undefined;
+    }
+    interface NodeEventTarget {
+        once(eventName: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    interface DOMEventTarget {
+        addEventListener(
+            eventName: string,
+            listener: (...args: any[]) => void,
+            opts?: {
+                once: boolean;
+            },
+        ): any;
+    }
+    interface StaticEventEmitterOptions {
+        signal?: AbortSignal | undefined;
+    }
+    interface EventEmitter extends NodeJS.EventEmitter {}
+    /**
+     * The `EventEmitter` class is defined and exposed by the `events` module:
+     *
+     * ```js
+     * const EventEmitter = require('events');
+     * ```
+     *
+     * All `EventEmitter`s emit the event `'newListener'` when new listeners are
+     * added and `'removeListener'` when existing listeners are removed.
+     *
+     * It supports the following option:
+     * @since v0.1.26
+     */
+    class EventEmitter {
+        constructor(options?: EventEmitterOptions);
+        /**
+         * Creates a `Promise` that is fulfilled when the `EventEmitter` emits the given
+         * event or that is rejected if the `EventEmitter` emits `'error'` while waiting.
+         * The `Promise` will resolve with an array of all the arguments emitted to the
+         * given event.
+         *
+         * This method is intentionally generic and works with the web platform [EventTarget](https://dom.spec.whatwg.org/#interface-eventtarget) interface, which has no special`'error'` event
+         * semantics and does not listen to the `'error'` event.
+         *
+         * ```js
+         * const { once, EventEmitter } = require('events');
+         *
+         * async function run() {
+         *   const ee = new EventEmitter();
+         *
+         *   process.nextTick(() => {
+         *     ee.emit('myevent', 42);
+         *   });
+         *
+         *   const [value] = await once(ee, 'myevent');
+         *   console.log(value);
+         *
+         *   const err = new Error('kaboom');
+         *   process.nextTick(() => {
+         *     ee.emit('error', err);
+         *   });
+         *
+         *   try {
+         *     await once(ee, 'myevent');
+         *   } catch (err) {
+         *     console.log('error happened', err);
+         *   }
+         * }
+         *
+         * run();
+         * ```
+         *
+         * The special handling of the `'error'` event is only used when `events.once()`is used to wait for another event. If `events.once()` is used to wait for the
+         * '`error'` event itself, then it is treated as any other kind of event without
+         * special handling:
+         *
+         * ```js
+         * const { EventEmitter, once } = require('events');
+         *
+         * const ee = new EventEmitter();
+         *
+         * once(ee, 'error')
+         *   .then(([err]) => console.log('ok', err.message))
+         *   .catch((err) => console.log('error', err.message));
+         *
+         * ee.emit('error', new Error('boom'));
+         *
+         * // Prints: ok boom
+         * ```
+         *
+         * An `AbortSignal` can be used to cancel waiting for the event:
+         *
+         * ```js
+         * const { EventEmitter, once } = require('events');
+         *
+         * const ee = new EventEmitter();
+         * const ac = new AbortController();
+         *
+         * async function foo(emitter, event, signal) {
+         *   try {
+         *     await once(emitter, event, { signal });
+         *     console.log('event emitted!');
+         *   } catch (error) {
+         *     if (error.name === 'AbortError') {
+         *       console.error('Waiting for the event was canceled!');
+         *     } else {
+         *       console.error('There was an error', error.message);
+         *     }
+         *   }
+         * }
+         *
+         * foo(ee, 'foo', ac.signal);
+         * ac.abort(); // Abort waiting for the event
+         * ee.emit('foo'); // Prints: Waiting for the event was canceled!
+         * ```
+         * @since v11.13.0, v10.16.0
+         */
+        static once(
+            emitter: NodeEventTarget,
+            eventName: string | symbol,
+            options?: StaticEventEmitterOptions,
+        ): Promise<any[]>;
+        static once(emitter: DOMEventTarget, eventName: string, options?: StaticEventEmitterOptions): Promise<any[]>;
+        /**
+         * ```js
+         * const { on, EventEmitter } = require('events');
+         *
+         * (async () => {
+         *   const ee = new EventEmitter();
+         *
+         *   // Emit later on
+         *   process.nextTick(() => {
+         *     ee.emit('foo', 'bar');
+         *     ee.emit('foo', 42);
+         *   });
+         *
+         *   for await (const event of on(ee, 'foo')) {
+         *     // The execution of this inner block is synchronous and it
+         *     // processes one event at a time (even with await). Do not use
+         *     // if concurrent execution is required.
+         *     console.log(event); // prints ['bar'] [42]
+         *   }
+         *   // Unreachable here
+         * })();
+         * ```
+         *
+         * Returns an `AsyncIterator` that iterates `eventName` events. It will throw
+         * if the `EventEmitter` emits `'error'`. It removes all listeners when
+         * exiting the loop. The `value` returned by each iteration is an array
+         * composed of the emitted event arguments.
+         *
+         * An `AbortSignal` can be used to cancel waiting on events:
+         *
+         * ```js
+         * const { on, EventEmitter } = require('events');
+         * const ac = new AbortController();
+         *
+         * (async () => {
+         *   const ee = new EventEmitter();
+         *
+         *   // Emit later on
+         *   process.nextTick(() => {
+         *     ee.emit('foo', 'bar');
+         *     ee.emit('foo', 42);
+         *   });
+         *
+         *   for await (const event of on(ee, 'foo', { signal: ac.signal })) {
+         *     // The execution of this inner block is synchronous and it
+         *     // processes one event at a time (even with await). Do not use
+         *     // if concurrent execution is required.
+         *     console.log(event); // prints ['bar'] [42]
+         *   }
+         *   // Unreachable here
+         * })();
+         *
+         * process.nextTick(() => ac.abort());
+         * ```
+         * @since v13.6.0, v12.16.0
+         * @param eventName The name of the event being listened for
+         * @return that iterates `eventName` events emitted by the `emitter`
+         */
+        static on(
+            emitter: NodeJS.EventEmitter,
+            eventName: string,
+            options?: StaticEventEmitterOptions,
+        ): AsyncIterableIterator<any>;
+        /**
+         * A class method that returns the number of listeners for the given `eventName`registered on the given `emitter`.
+         *
+         * ```js
+         * const { EventEmitter, listenerCount } = require('events');
+         * const myEmitter = new EventEmitter();
+         * myEmitter.on('event', () => {});
+         * myEmitter.on('event', () => {});
+         * console.log(listenerCount(myEmitter, 'event'));
+         * // Prints: 2
+         * ```
+         * @since v0.9.12
+         * @deprecated Since v3.2.0 - Use `listenerCount` instead.
+         * @param emitter The emitter to query
+         * @param eventName The event name
+         */
+        static listenerCount(emitter: NodeJS.EventEmitter, eventName: string | symbol): number;
+        /**
+         * Returns a copy of the array of listeners for the event named `eventName`.
+         *
+         * For `EventEmitter`s this behaves exactly the same as calling `.listeners` on
+         * the emitter.
+         *
+         * For `EventTarget`s this is the only way to get the event listeners for the
+         * event target. This is useful for debugging and diagnostic purposes.
+         *
+         * ```js
+         * const { getEventListeners, EventEmitter } = require('events');
+         *
+         * {
+         *   const ee = new EventEmitter();
+         *   const listener = () => console.log('Events are fun');
+         *   ee.on('foo', listener);
+         *   getEventListeners(ee, 'foo'); // [listener]
+         * }
+         * {
+         *   const et = new EventTarget();
+         *   const listener = () => console.log('Events are fun');
+         *   et.addEventListener('foo', listener);
+         *   getEventListeners(et, 'foo'); // [listener]
+         * }
+         * ```
+         * @since v15.2.0, v14.17.0
+         */
+        static getEventListeners(emitter: DOMEventTarget | NodeJS.EventEmitter, name: string | symbol): Function[];
+        /**
+         * By default `EventEmitter`s will print a warning if more than `10` listeners are
+         * added for a particular event. This is a useful default that helps finding
+         * memory leaks. The `EventEmitter.setMaxListeners()` method allows the default limit to be
+         * modified (if eventTargets is empty) or modify the limit specified in every `EventTarget` | `EventEmitter` passed as arguments.
+         * The value can be set to`Infinity` (or `0`) to indicate an unlimited number of listeners.
+         *
+         * ```js
+         * EventEmitter.setMaxListeners(20);
+         * // Equivalent to
+         * EventEmitter.defaultMaxListeners = 20;
+         *
+         * const eventTarget = new EventTarget();
+         * // Only way to increase limit for `EventTarget` instances
+         * // as these doesn't expose its own `setMaxListeners` method
+         * EventEmitter.setMaxListeners(20, eventTarget);
+         * ```
+         * @since v15.3.0, v14.17.0
+         */
+        static setMaxListeners(n?: number, ...eventTargets: Array<DOMEventTarget | NodeJS.EventEmitter>): void;
+        /**
+         * This symbol shall be used to install a listener for only monitoring `'error'`
+         * events. Listeners installed using this symbol are called before the regular
+         * `'error'` listeners are called.
+         *
+         * Installing a listener using this symbol does not change the behavior once an
+         * `'error'` event is emitted, therefore the process will still crash if no
+         * regular `'error'` listener is installed.
+         */
+        static readonly errorMonitor: unique symbol;
+        static readonly captureRejectionSymbol: unique symbol;
+        /**
+         * Sets or gets the default captureRejection value for all emitters.
+         */
+        // TODO: These should be described using static getter/setter pairs:
+        static captureRejections: boolean;
+        static defaultMaxListeners: number;
+    }
+    import internal = require('node:events');
+    namespace EventEmitter {
+        // Should just be `export { EventEmitter }`, but that doesn't work in TypeScript 3.4
+        export { internal as EventEmitter };
+        export interface Abortable {
+            /**
+             * When provided the corresponding `AbortController` can be used to cancel an asynchronous action.
+             */
+            signal?: AbortSignal | undefined;
+        }
+    }
+    global {
+        namespace NodeJS {
+            interface EventEmitter {
+                /**
+                 * Alias for `emitter.on(eventName, listener)`.
+                 * @since v0.1.26
+                 */
+                addListener(eventName: string | symbol, listener: (...args: any[]) => void): this;
+                /**
+                 * Adds the `listener` function to the end of the listeners array for the
+                 * event named `eventName`. No checks are made to see if the `listener` has
+                 * already been added. Multiple calls passing the same combination of `eventName`and `listener` will result in the `listener` being added, and called, multiple
+                 * times.
+                 *
+                 * ```js
+                 * server.on('connection', (stream) => {
+                 *   console.log('someone connected!');
+                 * });
+                 * ```
+                 *
+                 * Returns a reference to the `EventEmitter`, so that calls can be chained.
+                 *
+                 * By default, event listeners are invoked in the order they are added. The`emitter.prependListener()` method can be used as an alternative to add the
+                 * event listener to the beginning of the listeners array.
+                 *
+                 * ```js
+                 * const myEE = new EventEmitter();
+                 * myEE.on('foo', () => console.log('a'));
+                 * myEE.prependListener('foo', () => console.log('b'));
+                 * myEE.emit('foo');
+                 * // Prints:
+                 * //   b
+                 * //   a
+                 * ```
+                 * @since v0.1.101
+                 * @param eventName The name of the event.
+                 * @param listener The callback function
+                 */
+                on(eventName: string | symbol, listener: (...args: any[]) => void): this;
+                /**
+                 * Adds a **one-time**`listener` function for the event named `eventName`. The
+                 * next time `eventName` is triggered, this listener is removed and then invoked.
+                 *
+                 * ```js
+                 * server.once('connection', (stream) => {
+                 *   console.log('Ah, we have our first user!');
+                 * });
+                 * ```
+                 *
+                 * Returns a reference to the `EventEmitter`, so that calls can be chained.
+                 *
+                 * By default, event listeners are invoked in the order they are added. The`emitter.prependOnceListener()` method can be used as an alternative to add the
+                 * event listener to the beginning of the listeners array.
+                 *
+                 * ```js
+                 * const myEE = new EventEmitter();
+                 * myEE.once('foo', () => console.log('a'));
+                 * myEE.prependOnceListener('foo', () => console.log('b'));
+                 * myEE.emit('foo');
+                 * // Prints:
+                 * //   b
+                 * //   a
+                 * ```
+                 * @since v0.3.0
+                 * @param eventName The name of the event.
+                 * @param listener The callback function
+                 */
+                once(eventName: string | symbol, listener: (...args: any[]) => void): this;
+                /**
+                 * Removes the specified `listener` from the listener array for the event named`eventName`.
+                 *
+                 * ```js
+                 * const callback = (stream) => {
+                 *   console.log('someone connected!');
+                 * };
+                 * server.on('connection', callback);
+                 * // ...
+                 * server.removeListener('connection', callback);
+                 * ```
+                 *
+                 * `removeListener()` will remove, at most, one instance of a listener from the
+                 * listener array. If any single listener has been added multiple times to the
+                 * listener array for the specified `eventName`, then `removeListener()` must be
+                 * called multiple times to remove each instance.
+                 *
+                 * Once an event is emitted, all listeners attached to it at the
+                 * time of emitting are called in order. This implies that any`removeListener()` or `removeAllListeners()` calls _after_ emitting and_before_ the last listener finishes execution will
+                 * not remove them from`emit()` in progress. Subsequent events behave as expected.
+                 *
+                 * ```js
+                 * const myEmitter = new MyEmitter();
+                 *
+                 * const callbackA = () => {
+                 *   console.log('A');
+                 *   myEmitter.removeListener('event', callbackB);
+                 * };
+                 *
+                 * const callbackB = () => {
+                 *   console.log('B');
+                 * };
+                 *
+                 * myEmitter.on('event', callbackA);
+                 *
+                 * myEmitter.on('event', callbackB);
+                 *
+                 * // callbackA removes listener callbackB but it will still be called.
+                 * // Internal listener array at time of emit [callbackA, callbackB]
+                 * myEmitter.emit('event');
+                 * // Prints:
+                 * //   A
+                 * //   B
+                 *
+                 * // callbackB is now removed.
+                 * // Internal listener array [callbackA]
+                 * myEmitter.emit('event');
+                 * // Prints:
+                 * //   A
+                 * ```
+                 *
+                 * Because listeners are managed using an internal array, calling this will
+                 * change the position indices of any listener registered _after_ the listener
+                 * being removed. This will not impact the order in which listeners are called,
+                 * but it means that any copies of the listener array as returned by
+                 * the `emitter.listeners()` method will need to be recreated.
+                 *
+                 * When a single function has been added as a handler multiple times for a single
+                 * event (as in the example below), `removeListener()` will remove the most
+                 * recently added instance. In the example the `once('ping')`listener is removed:
+                 *
+                 * ```js
+                 * const ee = new EventEmitter();
+                 *
+                 * function pong() {
+                 *   console.log('pong');
+                 * }
+                 *
+                 * ee.on('ping', pong);
+                 * ee.once('ping', pong);
+                 * ee.removeListener('ping', pong);
+                 *
+                 * ee.emit('ping');
+                 * ee.emit('ping');
+                 * ```
+                 *
+                 * Returns a reference to the `EventEmitter`, so that calls can be chained.
+                 * @since v0.1.26
+                 */
+                removeListener(eventName: string | symbol, listener: (...args: any[]) => void): this;
+                /**
+                 * Alias for `emitter.removeListener()`.
+                 * @since v10.0.0
+                 */
+                off(eventName: string | symbol, listener: (...args: any[]) => void): this;
+                /**
+                 * Removes all listeners, or those of the specified `eventName`.
+                 *
+                 * It is bad practice to remove listeners added elsewhere in the code,
+                 * particularly when the `EventEmitter` instance was created by some other
+                 * component or module (e.g. sockets or file streams).
+                 *
+                 * Returns a reference to the `EventEmitter`, so that calls can be chained.
+                 * @since v0.1.26
+                 */
+                removeAllListeners(event?: string | symbol): this;
+                /**
+                 * By default `EventEmitter`s will print a warning if more than `10` listeners are
+                 * added for a particular event. This is a useful default that helps finding
+                 * memory leaks. The `emitter.setMaxListeners()` method allows the limit to be
+                 * modified for this specific `EventEmitter` instance. The value can be set to`Infinity` (or `0`) to indicate an unlimited number of listeners.
+                 *
+                 * Returns a reference to the `EventEmitter`, so that calls can be chained.
+                 * @since v0.3.5
+                 */
+                setMaxListeners(n: number): this;
+                /**
+                 * Returns the current max listener value for the `EventEmitter` which is either
+                 * set by `emitter.setMaxListeners(n)` or defaults to {@link defaultMaxListeners}.
+                 * @since v1.0.0
+                 */
+                getMaxListeners(): number;
+                /**
+                 * Returns a copy of the array of listeners for the event named `eventName`.
+                 *
+                 * ```js
+                 * server.on('connection', (stream) => {
+                 *   console.log('someone connected!');
+                 * });
+                 * console.log(util.inspect(server.listeners('connection')));
+                 * // Prints: [ [Function] ]
+                 * ```
+                 * @since v0.1.26
+                 */
+                listeners(eventName: string | symbol): Function[];
+                /**
+                 * Returns a copy of the array of listeners for the event named `eventName`,
+                 * including any wrappers (such as those created by `.once()`).
+                 *
+                 * ```js
+                 * const emitter = new EventEmitter();
+                 * emitter.once('log', () => console.log('log once'));
+                 *
+                 * // Returns a new Array with a function `onceWrapper` which has a property
+                 * // `listener` which contains the original listener bound above
+                 * const listeners = emitter.rawListeners('log');
+                 * const logFnWrapper = listeners[0];
+                 *
+                 * // Logs "log once" to the console and does not unbind the `once` event
+                 * logFnWrapper.listener();
+                 *
+                 * // Logs "log once" to the console and removes the listener
+                 * logFnWrapper();
+                 *
+                 * emitter.on('log', () => console.log('log persistently'));
+                 * // Will return a new Array with a single function bound by `.on()` above
+                 * const newListeners = emitter.rawListeners('log');
+                 *
+                 * // Logs "log persistently" twice
+                 * newListeners[0]();
+                 * emitter.emit('log');
+                 * ```
+                 * @since v9.4.0
+                 */
+                rawListeners(eventName: string | symbol): Function[];
+                /**
+                 * Synchronously calls each of the listeners registered for the event named`eventName`, in the order they were registered, passing the supplied arguments
+                 * to each.
+                 *
+                 * Returns `true` if the event had listeners, `false` otherwise.
+                 *
+                 * ```js
+                 * const EventEmitter = require('events');
+                 * const myEmitter = new EventEmitter();
+                 *
+                 * // First listener
+                 * myEmitter.on('event', function firstListener() {
+                 *   console.log('Helloooo! first listener');
+                 * });
+                 * // Second listener
+                 * myEmitter.on('event', function secondListener(arg1, arg2) {
+                 *   console.log(`event with parameters ${arg1}, ${arg2} in second listener`);
+                 * });
+                 * // Third listener
+                 * myEmitter.on('event', function thirdListener(...args) {
+                 *   const parameters = args.join(', ');
+                 *   console.log(`event with parameters ${parameters} in third listener`);
+                 * });
+                 *
+                 * console.log(myEmitter.listeners('event'));
+                 *
+                 * myEmitter.emit('event', 1, 2, 3, 4, 5);
+                 *
+                 * // Prints:
+                 * // [
+                 * //   [Function: firstListener],
+                 * //   [Function: secondListener],
+                 * //   [Function: thirdListener]
+                 * // ]
+                 * // Helloooo! first listener
+                 * // event with parameters 1, 2 in second listener
+                 * // event with parameters 1, 2, 3, 4, 5 in third listener
+                 * ```
+                 * @since v0.1.26
+                 */
+                emit(eventName: string | symbol, ...args: any[]): boolean;
+                /**
+                 * Returns the number of listeners listening to the event named `eventName`.
+                 * @since v3.2.0
+                 * @param eventName The name of the event being listened for
+                 */
+                listenerCount(eventName: string | symbol): number;
+                /**
+                 * Adds the `listener` function to the _beginning_ of the listeners array for the
+                 * event named `eventName`. No checks are made to see if the `listener` has
+                 * already been added. Multiple calls passing the same combination of `eventName`and `listener` will result in the `listener` being added, and called, multiple
+                 * times.
+                 *
+                 * ```js
+                 * server.prependListener('connection', (stream) => {
+                 *   console.log('someone connected!');
+                 * });
+                 * ```
+                 *
+                 * Returns a reference to the `EventEmitter`, so that calls can be chained.
+                 * @since v6.0.0
+                 * @param eventName The name of the event.
+                 * @param listener The callback function
+                 */
+                prependListener(eventName: string | symbol, listener: (...args: any[]) => void): this;
+                /**
+                 * Adds a **one-time**`listener` function for the event named `eventName` to the_beginning_ of the listeners array. The next time `eventName` is triggered, this
+                 * listener is removed, and then invoked.
+                 *
+                 * ```js
+                 * server.prependOnceListener('connection', (stream) => {
+                 *   console.log('Ah, we have our first user!');
+                 * });
+                 * ```
+                 *
+                 * Returns a reference to the `EventEmitter`, so that calls can be chained.
+                 * @since v6.0.0
+                 * @param eventName The name of the event.
+                 * @param listener The callback function
+                 */
+                prependOnceListener(eventName: string | symbol, listener: (...args: any[]) => void): this;
+                /**
+                 * Returns an array listing the events for which the emitter has registered
+                 * listeners. The values in the array are strings or `Symbol`s.
+                 *
+                 * ```js
+                 * const EventEmitter = require('events');
+                 * const myEE = new EventEmitter();
+                 * myEE.on('foo', () => {});
+                 * myEE.on('bar', () => {});
+                 *
+                 * const sym = Symbol('symbol');
+                 * myEE.on(sym, () => {});
+                 *
+                 * console.log(myEE.eventNames());
+                 * // Prints: [ 'foo', 'bar', Symbol(symbol) ]
+                 * ```
+                 * @since v6.0.0
+                 */
+                eventNames(): Array<string | symbol>;
+            }
+        }
+    }
+    export = EventEmitter;
+}
+declare module 'node:events' {
+    import events = require('events');
+    export = events;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/fs.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/fs.d.ts
new file mode 100644
index 0000000..c220c03
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/fs.d.ts
@@ -0,0 +1,3869 @@
+/**
+ * The `fs` module enables interacting with the file system in a
+ * way modeled on standard POSIX functions.
+ *
+ * To use the promise-based APIs:
+ *
+ * ```js
+ * import * as fs from 'fs/promises';
+ * ```
+ *
+ * To use the callback and sync APIs:
+ *
+ * ```js
+ * import * as fs from 'fs';
+ * ```
+ *
+ * All file system operations have synchronous, callback, and promise-based
+ * forms, and are accessible using both CommonJS syntax and ES6 Modules (ESM).
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/fs.js)
+ */
+declare module 'fs' {
+    import * as stream from 'node:stream';
+    import { Abortable, EventEmitter } from 'node:events';
+    import { URL } from 'node:url';
+    import * as promises from 'node:fs/promises';
+    export { promises };
+    /**
+     * Valid types for path values in "fs".
+     */
+    export type PathLike = string | Buffer | URL;
+    export type PathOrFileDescriptor = PathLike | number;
+    export type TimeLike = string | number | Date;
+    export type NoParamCallback = (err: NodeJS.ErrnoException | null) => void;
+    export type BufferEncodingOption =
+        | 'buffer'
+        | {
+              encoding: 'buffer';
+          };
+    export interface ObjectEncodingOptions {
+        encoding?: BufferEncoding | null | undefined;
+    }
+    export type EncodingOption = ObjectEncodingOptions | BufferEncoding | undefined | null;
+    export type OpenMode = number | string;
+    export type Mode = number | string;
+    export interface StatsBase<T> {
+        isFile(): boolean;
+        isDirectory(): boolean;
+        isBlockDevice(): boolean;
+        isCharacterDevice(): boolean;
+        isSymbolicLink(): boolean;
+        isFIFO(): boolean;
+        isSocket(): boolean;
+        dev: T;
+        ino: T;
+        mode: T;
+        nlink: T;
+        uid: T;
+        gid: T;
+        rdev: T;
+        size: T;
+        blksize: T;
+        blocks: T;
+        atimeMs: T;
+        mtimeMs: T;
+        ctimeMs: T;
+        birthtimeMs: T;
+        atime: Date;
+        mtime: Date;
+        ctime: Date;
+        birthtime: Date;
+    }
+    export interface Stats extends StatsBase<number> {}
+    /**
+     * A `fs.Stats` object provides information about a file.
+     *
+     * Objects returned from {@link stat}, {@link lstat} and {@link fstat} and
+     * their synchronous counterparts are of this type.
+     * If `bigint` in the `options` passed to those methods is true, the numeric values
+     * will be `bigint` instead of `number`, and the object will contain additional
+     * nanosecond-precision properties suffixed with `Ns`.
+     *
+     * ```console
+     * Stats {
+     *   dev: 2114,
+     *   ino: 48064969,
+     *   mode: 33188,
+     *   nlink: 1,
+     *   uid: 85,
+     *   gid: 100,
+     *   rdev: 0,
+     *   size: 527,
+     *   blksize: 4096,
+     *   blocks: 8,
+     *   atimeMs: 1318289051000.1,
+     *   mtimeMs: 1318289051000.1,
+     *   ctimeMs: 1318289051000.1,
+     *   birthtimeMs: 1318289051000.1,
+     *   atime: Mon, 10 Oct 2011 23:24:11 GMT,
+     *   mtime: Mon, 10 Oct 2011 23:24:11 GMT,
+     *   ctime: Mon, 10 Oct 2011 23:24:11 GMT,
+     *   birthtime: Mon, 10 Oct 2011 23:24:11 GMT }
+     * ```
+     *
+     * `bigint` version:
+     *
+     * ```console
+     * BigIntStats {
+     *   dev: 2114n,
+     *   ino: 48064969n,
+     *   mode: 33188n,
+     *   nlink: 1n,
+     *   uid: 85n,
+     *   gid: 100n,
+     *   rdev: 0n,
+     *   size: 527n,
+     *   blksize: 4096n,
+     *   blocks: 8n,
+     *   atimeMs: 1318289051000n,
+     *   mtimeMs: 1318289051000n,
+     *   ctimeMs: 1318289051000n,
+     *   birthtimeMs: 1318289051000n,
+     *   atimeNs: 1318289051000000000n,
+     *   mtimeNs: 1318289051000000000n,
+     *   ctimeNs: 1318289051000000000n,
+     *   birthtimeNs: 1318289051000000000n,
+     *   atime: Mon, 10 Oct 2011 23:24:11 GMT,
+     *   mtime: Mon, 10 Oct 2011 23:24:11 GMT,
+     *   ctime: Mon, 10 Oct 2011 23:24:11 GMT,
+     *   birthtime: Mon, 10 Oct 2011 23:24:11 GMT }
+     * ```
+     * @since v0.1.21
+     */
+    export class Stats {}
+    /**
+     * A representation of a directory entry, which can be a file or a subdirectory
+     * within the directory, as returned by reading from an `fs.Dir`. The
+     * directory entry is a combination of the file name and file type pairs.
+     *
+     * Additionally, when {@link readdir} or {@link readdirSync} is called with
+     * the `withFileTypes` option set to `true`, the resulting array is filled with `fs.Dirent` objects, rather than strings or `Buffer` s.
+     * @since v10.10.0
+     */
+    export class Dirent {
+        /**
+         * Returns `true` if the `fs.Dirent` object describes a regular file.
+         * @since v10.10.0
+         */
+        isFile(): boolean;
+        /**
+         * Returns `true` if the `fs.Dirent` object describes a file system
+         * directory.
+         * @since v10.10.0
+         */
+        isDirectory(): boolean;
+        /**
+         * Returns `true` if the `fs.Dirent` object describes a block device.
+         * @since v10.10.0
+         */
+        isBlockDevice(): boolean;
+        /**
+         * Returns `true` if the `fs.Dirent` object describes a character device.
+         * @since v10.10.0
+         */
+        isCharacterDevice(): boolean;
+        /**
+         * Returns `true` if the `fs.Dirent` object describes a symbolic link.
+         * @since v10.10.0
+         */
+        isSymbolicLink(): boolean;
+        /**
+         * Returns `true` if the `fs.Dirent` object describes a first-in-first-out
+         * (FIFO) pipe.
+         * @since v10.10.0
+         */
+        isFIFO(): boolean;
+        /**
+         * Returns `true` if the `fs.Dirent` object describes a socket.
+         * @since v10.10.0
+         */
+        isSocket(): boolean;
+        /**
+         * The file name that this `fs.Dirent` object refers to. The type of this
+         * value is determined by the `options.encoding` passed to {@link readdir} or {@link readdirSync}.
+         * @since v10.10.0
+         */
+        name: string;
+    }
+    /**
+     * A class representing a directory stream.
+     *
+     * Created by {@link opendir}, {@link opendirSync}, or `fsPromises.opendir()`.
+     *
+     * ```js
+     * import { opendir } from 'fs/promises';
+     *
+     * try {
+     *   const dir = await opendir('./');
+     *   for await (const dirent of dir)
+     *     console.log(dirent.name);
+     * } catch (err) {
+     *   console.error(err);
+     * }
+     * ```
+     *
+     * When using the async iterator, the `fs.Dir` object will be automatically
+     * closed after the iterator exits.
+     * @since v12.12.0
+     */
+    export class Dir implements AsyncIterable<Dirent> {
+        /**
+         * The read-only path of this directory as was provided to {@link opendir},{@link opendirSync}, or `fsPromises.opendir()`.
+         * @since v12.12.0
+         */
+        readonly path: string;
+        /**
+         * Asynchronously iterates over the directory via `readdir(3)` until all entries have been read.
+         */
+        [Symbol.asyncIterator](): AsyncIterableIterator<Dirent>;
+        /**
+         * Asynchronously close the directory's underlying resource handle.
+         * Subsequent reads will result in errors.
+         *
+         * A promise is returned that will be resolved after the resource has been
+         * closed.
+         * @since v12.12.0
+         */
+        close(): Promise<void>;
+        close(cb: NoParamCallback): void;
+        /**
+         * Synchronously close the directory's underlying resource handle.
+         * Subsequent reads will result in errors.
+         * @since v12.12.0
+         */
+        closeSync(): void;
+        /**
+         * Asynchronously read the next directory entry via [`readdir(3)`](http://man7.org/linux/man-pages/man3/readdir.3.html) as an `fs.Dirent`.
+         *
+         * A promise is returned that will be resolved with an `fs.Dirent`, or `null`if there are no more directory entries to read.
+         *
+         * Directory entries returned by this function are in no particular order as
+         * provided by the operating system's underlying directory mechanisms.
+         * Entries added or removed while iterating over the directory might not be
+         * included in the iteration results.
+         * @since v12.12.0
+         * @return containing {fs.Dirent|null}
+         */
+        read(): Promise<Dirent | null>;
+        read(cb: (err: NodeJS.ErrnoException | null, dirEnt: Dirent | null) => void): void;
+        /**
+         * Synchronously read the next directory entry as an `fs.Dirent`. See the
+         * POSIX [`readdir(3)`](http://man7.org/linux/man-pages/man3/readdir.3.html) documentation for more detail.
+         *
+         * If there are no more directory entries to read, `null` will be returned.
+         *
+         * Directory entries returned by this function are in no particular order as
+         * provided by the operating system's underlying directory mechanisms.
+         * Entries added or removed while iterating over the directory might not be
+         * included in the iteration results.
+         * @since v12.12.0
+         */
+        readSync(): Dirent | null;
+    }
+    /**
+     * Class: fs.StatWatcher
+     * @since v14.3.0, v12.20.0
+     * Extends `EventEmitter`
+     * A successful call to {@link watchFile} method will return a new fs.StatWatcher object.
+     */
+    export interface StatWatcher extends EventEmitter {
+        /**
+         * When called, requests that the Node.js event loop _not_ exit so long as the `fs.StatWatcher` is active. Calling `watcher.ref()` multiple times will have
+         * no effect.
+         *
+         * By default, all `fs.StatWatcher` objects are "ref'ed", making it normally
+         * unnecessary to call `watcher.ref()` unless `watcher.unref()` had been
+         * called previously.
+         * @since v14.3.0, v12.20.0
+         */
+        ref(): this;
+        /**
+         * When called, the active `fs.StatWatcher` object will not require the Node.js
+         * event loop to remain active. If there is no other activity keeping the
+         * event loop running, the process may exit before the `fs.StatWatcher` object's
+         * callback is invoked. Calling `watcher.unref()` multiple times will have
+         * no effect.
+         * @since v14.3.0, v12.20.0
+         */
+        unref(): this;
+    }
+    export interface FSWatcher extends EventEmitter {
+        /**
+         * Stop watching for changes on the given `fs.FSWatcher`. Once stopped, the `fs.FSWatcher` object is no longer usable.
+         * @since v0.5.8
+         */
+        close(): void;
+        /**
+         * events.EventEmitter
+         *   1. change
+         *   2. error
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'change', listener: (eventType: string, filename: string | Buffer) => void): this;
+        addListener(event: 'error', listener: (error: Error) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'change', listener: (eventType: string, filename: string | Buffer) => void): this;
+        on(event: 'error', listener: (error: Error) => void): this;
+        on(event: 'close', listener: () => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'change', listener: (eventType: string, filename: string | Buffer) => void): this;
+        once(event: 'error', listener: (error: Error) => void): this;
+        once(event: 'close', listener: () => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'change', listener: (eventType: string, filename: string | Buffer) => void): this;
+        prependListener(event: 'error', listener: (error: Error) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'change', listener: (eventType: string, filename: string | Buffer) => void): this;
+        prependOnceListener(event: 'error', listener: (error: Error) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+    }
+    /**
+     * Instances of `fs.ReadStream` are created and returned using the {@link createReadStream} function.
+     * @since v0.1.93
+     */
+    export class ReadStream extends stream.Readable {
+        close(callback?: (err?: NodeJS.ErrnoException | null) => void): void;
+        /**
+         * The number of bytes that have been read so far.
+         * @since v6.4.0
+         */
+        bytesRead: number;
+        /**
+         * The path to the file the stream is reading from as specified in the first
+         * argument to `fs.createReadStream()`. If `path` is passed as a string, then`readStream.path` will be a string. If `path` is passed as a `Buffer`, then`readStream.path` will be a
+         * `Buffer`. If `fd` is specified, then`readStream.path` will be `undefined`.
+         * @since v0.1.93
+         */
+        path: string | Buffer;
+        /**
+         * This property is `true` if the underlying file has not been opened yet,
+         * i.e. before the `'ready'` event is emitted.
+         * @since v11.2.0, v10.16.0
+         */
+        pending: boolean;
+        /**
+         * events.EventEmitter
+         *   1. open
+         *   2. close
+         *   3. ready
+         */
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        addListener(event: 'end', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'open', listener: (fd: number) => void): this;
+        addListener(event: 'pause', listener: () => void): this;
+        addListener(event: 'readable', listener: () => void): this;
+        addListener(event: 'ready', listener: () => void): this;
+        addListener(event: 'resume', listener: () => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        on(event: 'end', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'open', listener: (fd: number) => void): this;
+        on(event: 'pause', listener: () => void): this;
+        on(event: 'readable', listener: () => void): this;
+        on(event: 'ready', listener: () => void): this;
+        on(event: 'resume', listener: () => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        once(event: 'end', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'open', listener: (fd: number) => void): this;
+        once(event: 'pause', listener: () => void): this;
+        once(event: 'readable', listener: () => void): this;
+        once(event: 'ready', listener: () => void): this;
+        once(event: 'resume', listener: () => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        prependListener(event: 'end', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'open', listener: (fd: number) => void): this;
+        prependListener(event: 'pause', listener: () => void): this;
+        prependListener(event: 'readable', listener: () => void): this;
+        prependListener(event: 'ready', listener: () => void): this;
+        prependListener(event: 'resume', listener: () => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        prependOnceListener(event: 'end', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'open', listener: (fd: number) => void): this;
+        prependOnceListener(event: 'pause', listener: () => void): this;
+        prependOnceListener(event: 'readable', listener: () => void): this;
+        prependOnceListener(event: 'ready', listener: () => void): this;
+        prependOnceListener(event: 'resume', listener: () => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    /**
+     * * Extends `stream.Writable`
+     *
+     * Instances of `fs.WriteStream` are created and returned using the {@link createWriteStream} function.
+     * @since v0.1.93
+     */
+    export class WriteStream extends stream.Writable {
+        /**
+         * Closes `writeStream`. Optionally accepts a
+         * callback that will be executed once the `writeStream`is closed.
+         * @since v0.9.4
+         */
+        close(callback?: (err?: NodeJS.ErrnoException | null) => void): void;
+        /**
+         * The number of bytes written so far. Does not include data that is still queued
+         * for writing.
+         * @since v0.4.7
+         */
+        bytesWritten: number;
+        /**
+         * The path to the file the stream is writing to as specified in the first
+         * argument to {@link createWriteStream}. If `path` is passed as a string, then`writeStream.path` will be a string. If `path` is passed as a `Buffer`, then`writeStream.path` will be a
+         * `Buffer`.
+         * @since v0.1.93
+         */
+        path: string | Buffer;
+        /**
+         * This property is `true` if the underlying file has not been opened yet,
+         * i.e. before the `'ready'` event is emitted.
+         * @since v11.2.0
+         */
+        pending: boolean;
+        /**
+         * events.EventEmitter
+         *   1. open
+         *   2. close
+         *   3. ready
+         */
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'drain', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'finish', listener: () => void): this;
+        addListener(event: 'open', listener: (fd: number) => void): this;
+        addListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: 'ready', listener: () => void): this;
+        addListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'drain', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'finish', listener: () => void): this;
+        on(event: 'open', listener: (fd: number) => void): this;
+        on(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        on(event: 'ready', listener: () => void): this;
+        on(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'drain', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'finish', listener: () => void): this;
+        once(event: 'open', listener: (fd: number) => void): this;
+        once(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        once(event: 'ready', listener: () => void): this;
+        once(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'drain', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'finish', listener: () => void): this;
+        prependListener(event: 'open', listener: (fd: number) => void): this;
+        prependListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: 'ready', listener: () => void): this;
+        prependListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'drain', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'finish', listener: () => void): this;
+        prependOnceListener(event: 'open', listener: (fd: number) => void): this;
+        prependOnceListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: 'ready', listener: () => void): this;
+        prependOnceListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    /**
+     * Asynchronously rename file at `oldPath` to the pathname provided
+     * as `newPath`. In the case that `newPath` already exists, it will
+     * be overwritten. If there is a directory at `newPath`, an error will
+     * be raised instead. No arguments other than a possible exception are
+     * given to the completion callback.
+     *
+     * See also: [`rename(2)`](http://man7.org/linux/man-pages/man2/rename.2.html).
+     *
+     * ```js
+     * import { rename } from 'fs';
+     *
+     * rename('oldFile.txt', 'newFile.txt', (err) => {
+     *   if (err) throw err;
+     *   console.log('Rename complete!');
+     * });
+     * ```
+     * @since v0.0.2
+     */
+    export function rename(oldPath: PathLike, newPath: PathLike, callback: NoParamCallback): void;
+    export namespace rename {
+        /**
+         * Asynchronous rename(2) - Change the name or location of a file or directory.
+         * @param oldPath A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         * @param newPath A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         */
+        function __promisify__(oldPath: PathLike, newPath: PathLike): Promise<void>;
+    }
+    /**
+     * Renames the file from `oldPath` to `newPath`. Returns `undefined`.
+     *
+     * See the POSIX [`rename(2)`](http://man7.org/linux/man-pages/man2/rename.2.html) documentation for more details.
+     * @since v0.1.21
+     */
+    export function renameSync(oldPath: PathLike, newPath: PathLike): void;
+    /**
+     * Truncates the file. No arguments other than a possible exception are
+     * given to the completion callback. A file descriptor can also be passed as the
+     * first argument. In this case, `fs.ftruncate()` is called.
+     *
+     * ```js
+     * import { truncate } from 'fs';
+     * // Assuming that 'path/file.txt' is a regular file.
+     * truncate('path/file.txt', (err) => {
+     *   if (err) throw err;
+     *   console.log('path/file.txt was truncated');
+     * });
+     * ```
+     *
+     * Passing a file descriptor is deprecated and may result in an error being thrown
+     * in the future.
+     *
+     * See the POSIX [`truncate(2)`](http://man7.org/linux/man-pages/man2/truncate.2.html) documentation for more details.
+     * @since v0.8.6
+     * @param [len=0]
+     */
+    export function truncate(path: PathLike, len: number | undefined | null, callback: NoParamCallback): void;
+    /**
+     * Asynchronous truncate(2) - Truncate a file to a specified length.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function truncate(path: PathLike, callback: NoParamCallback): void;
+    export namespace truncate {
+        /**
+         * Asynchronous truncate(2) - Truncate a file to a specified length.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param len If not specified, defaults to `0`.
+         */
+        function __promisify__(path: PathLike, len?: number | null): Promise<void>;
+    }
+    /**
+     * Truncates the file. Returns `undefined`. A file descriptor can also be
+     * passed as the first argument. In this case, `fs.ftruncateSync()` is called.
+     *
+     * Passing a file descriptor is deprecated and may result in an error being thrown
+     * in the future.
+     * @since v0.8.6
+     * @param [len=0]
+     */
+    export function truncateSync(path: PathLike, len?: number | null): void;
+    /**
+     * Truncates the file descriptor. No arguments other than a possible exception are
+     * given to the completion callback.
+     *
+     * See the POSIX [`ftruncate(2)`](http://man7.org/linux/man-pages/man2/ftruncate.2.html) documentation for more detail.
+     *
+     * If the file referred to by the file descriptor was larger than `len` bytes, only
+     * the first `len` bytes will be retained in the file.
+     *
+     * For example, the following program retains only the first four bytes of the
+     * file:
+     *
+     * ```js
+     * import { open, close, ftruncate } from 'fs';
+     *
+     * function closeFd(fd) {
+     *   close(fd, (err) => {
+     *     if (err) throw err;
+     *   });
+     * }
+     *
+     * open('temp.txt', 'r+', (err, fd) => {
+     *   if (err) throw err;
+     *
+     *   try {
+     *     ftruncate(fd, 4, (err) => {
+     *       closeFd(fd);
+     *       if (err) throw err;
+     *     });
+     *   } catch (err) {
+     *     closeFd(fd);
+     *     if (err) throw err;
+     *   }
+     * });
+     * ```
+     *
+     * If the file previously was shorter than `len` bytes, it is extended, and the
+     * extended part is filled with null bytes (`'\0'`):
+     *
+     * If `len` is negative then `0` will be used.
+     * @since v0.8.6
+     * @param [len=0]
+     */
+    export function ftruncate(fd: number, len: number | undefined | null, callback: NoParamCallback): void;
+    /**
+     * Asynchronous ftruncate(2) - Truncate a file to a specified length.
+     * @param fd A file descriptor.
+     */
+    export function ftruncate(fd: number, callback: NoParamCallback): void;
+    export namespace ftruncate {
+        /**
+         * Asynchronous ftruncate(2) - Truncate a file to a specified length.
+         * @param fd A file descriptor.
+         * @param len If not specified, defaults to `0`.
+         */
+        function __promisify__(fd: number, len?: number | null): Promise<void>;
+    }
+    /**
+     * Truncates the file descriptor. Returns `undefined`.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link ftruncate}.
+     * @since v0.8.6
+     * @param [len=0]
+     */
+    export function ftruncateSync(fd: number, len?: number | null): void;
+    /**
+     * Asynchronously changes owner and group of a file. No arguments other than a
+     * possible exception are given to the completion callback.
+     *
+     * See the POSIX [`chown(2)`](http://man7.org/linux/man-pages/man2/chown.2.html) documentation for more detail.
+     * @since v0.1.97
+     */
+    export function chown(path: PathLike, uid: number, gid: number, callback: NoParamCallback): void;
+    export namespace chown {
+        /**
+         * Asynchronous chown(2) - Change ownership of a file.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         */
+        function __promisify__(path: PathLike, uid: number, gid: number): Promise<void>;
+    }
+    /**
+     * Synchronously changes owner and group of a file. Returns `undefined`.
+     * This is the synchronous version of {@link chown}.
+     *
+     * See the POSIX [`chown(2)`](http://man7.org/linux/man-pages/man2/chown.2.html) documentation for more detail.
+     * @since v0.1.97
+     */
+    export function chownSync(path: PathLike, uid: number, gid: number): void;
+    /**
+     * Sets the owner of the file. No arguments other than a possible exception are
+     * given to the completion callback.
+     *
+     * See the POSIX [`fchown(2)`](http://man7.org/linux/man-pages/man2/fchown.2.html) documentation for more detail.
+     * @since v0.4.7
+     */
+    export function fchown(fd: number, uid: number, gid: number, callback: NoParamCallback): void;
+    export namespace fchown {
+        /**
+         * Asynchronous fchown(2) - Change ownership of a file.
+         * @param fd A file descriptor.
+         */
+        function __promisify__(fd: number, uid: number, gid: number): Promise<void>;
+    }
+    /**
+     * Sets the owner of the file. Returns `undefined`.
+     *
+     * See the POSIX [`fchown(2)`](http://man7.org/linux/man-pages/man2/fchown.2.html) documentation for more detail.
+     * @since v0.4.7
+     * @param uid The file's new owner's user id.
+     * @param gid The file's new group's group id.
+     */
+    export function fchownSync(fd: number, uid: number, gid: number): void;
+    /**
+     * Set the owner of the symbolic link. No arguments other than a possible
+     * exception are given to the completion callback.
+     *
+     * See the POSIX [`lchown(2)`](http://man7.org/linux/man-pages/man2/lchown.2.html) documentation for more detail.
+     */
+    export function lchown(path: PathLike, uid: number, gid: number, callback: NoParamCallback): void;
+    export namespace lchown {
+        /**
+         * Asynchronous lchown(2) - Change ownership of a file. Does not dereference symbolic links.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         */
+        function __promisify__(path: PathLike, uid: number, gid: number): Promise<void>;
+    }
+    /**
+     * Set the owner for the path. Returns `undefined`.
+     *
+     * See the POSIX [`lchown(2)`](http://man7.org/linux/man-pages/man2/lchown.2.html) documentation for more details.
+     * @param uid The file's new owner's user id.
+     * @param gid The file's new group's group id.
+     */
+    export function lchownSync(path: PathLike, uid: number, gid: number): void;
+    /**
+     * Changes the access and modification times of a file in the same way as {@link utimes}, with the difference that if the path refers to a symbolic
+     * link, then the link is not dereferenced: instead, the timestamps of the
+     * symbolic link itself are changed.
+     *
+     * No arguments other than a possible exception are given to the completion
+     * callback.
+     * @since v14.5.0, v12.19.0
+     */
+    export function lutimes(path: PathLike, atime: TimeLike, mtime: TimeLike, callback: NoParamCallback): void;
+    export namespace lutimes {
+        /**
+         * Changes the access and modification times of a file in the same way as `fsPromises.utimes()`,
+         * with the difference that if the path refers to a symbolic link, then the link is not
+         * dereferenced: instead, the timestamps of the symbolic link itself are changed.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param atime The last access time. If a string is provided, it will be coerced to number.
+         * @param mtime The last modified time. If a string is provided, it will be coerced to number.
+         */
+        function __promisify__(path: PathLike, atime: TimeLike, mtime: TimeLike): Promise<void>;
+    }
+    /**
+     * Change the file system timestamps of the symbolic link referenced by `path`.
+     * Returns `undefined`, or throws an exception when parameters are incorrect or
+     * the operation fails. This is the synchronous version of {@link lutimes}.
+     * @since v14.5.0, v12.19.0
+     */
+    export function lutimesSync(path: PathLike, atime: TimeLike, mtime: TimeLike): void;
+    /**
+     * Asynchronously changes the permissions of a file. No arguments other than a
+     * possible exception are given to the completion callback.
+     *
+     * See the POSIX [`chmod(2)`](http://man7.org/linux/man-pages/man2/chmod.2.html) documentation for more detail.
+     *
+     * ```js
+     * import { chmod } from 'fs';
+     *
+     * chmod('my_file.txt', 0o775, (err) => {
+     *   if (err) throw err;
+     *   console.log('The permissions for file "my_file.txt" have been changed!');
+     * });
+     * ```
+     * @since v0.1.30
+     */
+    export function chmod(path: PathLike, mode: Mode, callback: NoParamCallback): void;
+    export namespace chmod {
+        /**
+         * Asynchronous chmod(2) - Change permissions of a file.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param mode A file mode. If a string is passed, it is parsed as an octal integer.
+         */
+        function __promisify__(path: PathLike, mode: Mode): Promise<void>;
+    }
+    /**
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link chmod}.
+     *
+     * See the POSIX [`chmod(2)`](http://man7.org/linux/man-pages/man2/chmod.2.html) documentation for more detail.
+     * @since v0.6.7
+     */
+    export function chmodSync(path: PathLike, mode: Mode): void;
+    /**
+     * Sets the permissions on the file. No arguments other than a possible exception
+     * are given to the completion callback.
+     *
+     * See the POSIX [`fchmod(2)`](http://man7.org/linux/man-pages/man2/fchmod.2.html) documentation for more detail.
+     * @since v0.4.7
+     */
+    export function fchmod(fd: number, mode: Mode, callback: NoParamCallback): void;
+    export namespace fchmod {
+        /**
+         * Asynchronous fchmod(2) - Change permissions of a file.
+         * @param fd A file descriptor.
+         * @param mode A file mode. If a string is passed, it is parsed as an octal integer.
+         */
+        function __promisify__(fd: number, mode: Mode): Promise<void>;
+    }
+    /**
+     * Sets the permissions on the file. Returns `undefined`.
+     *
+     * See the POSIX [`fchmod(2)`](http://man7.org/linux/man-pages/man2/fchmod.2.html) documentation for more detail.
+     * @since v0.4.7
+     */
+    export function fchmodSync(fd: number, mode: Mode): void;
+    /**
+     * Changes the permissions on a symbolic link. No arguments other than a possible
+     * exception are given to the completion callback.
+     *
+     * This method is only implemented on macOS.
+     *
+     * See the POSIX [`lchmod(2)`](https://www.freebsd.org/cgi/man.cgi?query=lchmod&sektion=2) documentation for more detail.
+     * @deprecated Since v0.4.7
+     */
+    export function lchmod(path: PathLike, mode: Mode, callback: NoParamCallback): void;
+    /** @deprecated */
+    export namespace lchmod {
+        /**
+         * Asynchronous lchmod(2) - Change permissions of a file. Does not dereference symbolic links.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param mode A file mode. If a string is passed, it is parsed as an octal integer.
+         */
+        function __promisify__(path: PathLike, mode: Mode): Promise<void>;
+    }
+    /**
+     * Changes the permissions on a symbolic link. Returns `undefined`.
+     *
+     * This method is only implemented on macOS.
+     *
+     * See the POSIX [`lchmod(2)`](https://www.freebsd.org/cgi/man.cgi?query=lchmod&sektion=2) documentation for more detail.
+     * @deprecated Since v0.4.7
+     */
+    export function lchmodSync(path: PathLike, mode: Mode): void;
+    /**
+     * Asynchronous [`stat(2)`](http://man7.org/linux/man-pages/man2/stat.2.html). The callback gets two arguments `(err, stats)` where`stats` is an `fs.Stats` object.
+     *
+     * In case of an error, the `err.code` will be one of `Common System Errors`.
+     *
+     * Using `fs.stat()` to check for the existence of a file before calling`fs.open()`, `fs.readFile()` or `fs.writeFile()` is not recommended.
+     * Instead, user code should open/read/write the file directly and handle the
+     * error raised if the file is not available.
+     *
+     * To check if a file exists without manipulating it afterwards, {@link access} is recommended.
+     *
+     * For example, given the following directory structure:
+     *
+     * ```text
+     * - txtDir
+     * -- file.txt
+     * - app.js
+     * ```
+     *
+     * The next program will check for the stats of the given paths:
+     *
+     * ```js
+     * import { stat } from 'fs';
+     *
+     * const pathsToCheck = ['./txtDir', './txtDir/file.txt'];
+     *
+     * for (let i = 0; i < pathsToCheck.length; i++) {
+     *   stat(pathsToCheck[i], (err, stats) => {
+     *     console.log(stats.isDirectory());
+     *     console.log(stats);
+     *   });
+     * }
+     * ```
+     *
+     * The resulting output will resemble:
+     *
+     * ```console
+     * true
+     * Stats {
+     *   dev: 16777220,
+     *   mode: 16877,
+     *   nlink: 3,
+     *   uid: 501,
+     *   gid: 20,
+     *   rdev: 0,
+     *   blksize: 4096,
+     *   ino: 14214262,
+     *   size: 96,
+     *   blocks: 0,
+     *   atimeMs: 1561174653071.963,
+     *   mtimeMs: 1561174614583.3518,
+     *   ctimeMs: 1561174626623.5366,
+     *   birthtimeMs: 1561174126937.2893,
+     *   atime: 2019-06-22T03:37:33.072Z,
+     *   mtime: 2019-06-22T03:36:54.583Z,
+     *   ctime: 2019-06-22T03:37:06.624Z,
+     *   birthtime: 2019-06-22T03:28:46.937Z
+     * }
+     * false
+     * Stats {
+     *   dev: 16777220,
+     *   mode: 33188,
+     *   nlink: 1,
+     *   uid: 501,
+     *   gid: 20,
+     *   rdev: 0,
+     *   blksize: 4096,
+     *   ino: 14214074,
+     *   size: 8,
+     *   blocks: 8,
+     *   atimeMs: 1561174616618.8555,
+     *   mtimeMs: 1561174614584,
+     *   ctimeMs: 1561174614583.8145,
+     *   birthtimeMs: 1561174007710.7478,
+     *   atime: 2019-06-22T03:36:56.619Z,
+     *   mtime: 2019-06-22T03:36:54.584Z,
+     *   ctime: 2019-06-22T03:36:54.584Z,
+     *   birthtime: 2019-06-22T03:26:47.711Z
+     * }
+     * ```
+     * @since v0.0.2
+     */
+    export function stat(path: PathLike, callback: (err: NodeJS.ErrnoException | null, stats: Stats) => void): void;
+    export function stat(
+        path: PathLike,
+        options:
+            | (StatOptions & {
+                  bigint?: false | undefined;
+              })
+            | undefined,
+        callback: (err: NodeJS.ErrnoException | null, stats: Stats) => void
+    ): void;
+    export function stat(
+        path: PathLike,
+        options: StatOptions & {
+            bigint: true;
+        },
+        callback: (err: NodeJS.ErrnoException | null, stats: BigIntStats) => void
+    ): void;
+    export function stat(path: PathLike, options: StatOptions | undefined, callback: (err: NodeJS.ErrnoException | null, stats: Stats | BigIntStats) => void): void;
+    export namespace stat {
+        /**
+         * Asynchronous stat(2) - Get file status.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         */
+        function __promisify__(
+            path: PathLike,
+            options?: StatOptions & {
+                bigint?: false | undefined;
+            }
+        ): Promise<Stats>;
+        function __promisify__(
+            path: PathLike,
+            options: StatOptions & {
+                bigint: true;
+            }
+        ): Promise<BigIntStats>;
+        function __promisify__(path: PathLike, options?: StatOptions): Promise<Stats | BigIntStats>;
+    }
+    export interface StatSyncFn extends Function {
+        (path: PathLike, options?: undefined): Stats;
+        (
+            path: PathLike,
+            options?: StatSyncOptions & {
+                bigint?: false | undefined;
+                throwIfNoEntry: false;
+            }
+        ): Stats | undefined;
+        (
+            path: PathLike,
+            options: StatSyncOptions & {
+                bigint: true;
+                throwIfNoEntry: false;
+            }
+        ): BigIntStats | undefined;
+        (
+            path: PathLike,
+            options?: StatSyncOptions & {
+                bigint?: false | undefined;
+            }
+        ): Stats;
+        (
+            path: PathLike,
+            options: StatSyncOptions & {
+                bigint: true;
+            }
+        ): BigIntStats;
+        (
+            path: PathLike,
+            options: StatSyncOptions & {
+                bigint: boolean;
+                throwIfNoEntry?: false | undefined;
+            }
+        ): Stats | BigIntStats;
+        (path: PathLike, options?: StatSyncOptions): Stats | BigIntStats | undefined;
+    }
+    /**
+     * Synchronous stat(2) - Get file status.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export const statSync: StatSyncFn;
+    /**
+     * Invokes the callback with the `fs.Stats` for the file descriptor.
+     *
+     * See the POSIX [`fstat(2)`](http://man7.org/linux/man-pages/man2/fstat.2.html) documentation for more detail.
+     * @since v0.1.95
+     */
+    export function fstat(fd: number, callback: (err: NodeJS.ErrnoException | null, stats: Stats) => void): void;
+    export function fstat(
+        fd: number,
+        options:
+            | (StatOptions & {
+                  bigint?: false | undefined;
+              })
+            | undefined,
+        callback: (err: NodeJS.ErrnoException | null, stats: Stats) => void
+    ): void;
+    export function fstat(
+        fd: number,
+        options: StatOptions & {
+            bigint: true;
+        },
+        callback: (err: NodeJS.ErrnoException | null, stats: BigIntStats) => void
+    ): void;
+    export function fstat(fd: number, options: StatOptions | undefined, callback: (err: NodeJS.ErrnoException | null, stats: Stats | BigIntStats) => void): void;
+    export namespace fstat {
+        /**
+         * Asynchronous fstat(2) - Get file status.
+         * @param fd A file descriptor.
+         */
+        function __promisify__(
+            fd: number,
+            options?: StatOptions & {
+                bigint?: false | undefined;
+            }
+        ): Promise<Stats>;
+        function __promisify__(
+            fd: number,
+            options: StatOptions & {
+                bigint: true;
+            }
+        ): Promise<BigIntStats>;
+        function __promisify__(fd: number, options?: StatOptions): Promise<Stats | BigIntStats>;
+    }
+    /**
+     * Retrieves the `fs.Stats` for the file descriptor.
+     *
+     * See the POSIX [`fstat(2)`](http://man7.org/linux/man-pages/man2/fstat.2.html) documentation for more detail.
+     * @since v0.1.95
+     */
+    export function fstatSync(
+        fd: number,
+        options?: StatOptions & {
+            bigint?: false | undefined;
+        }
+    ): Stats;
+    export function fstatSync(
+        fd: number,
+        options: StatOptions & {
+            bigint: true;
+        }
+    ): BigIntStats;
+    export function fstatSync(fd: number, options?: StatOptions): Stats | BigIntStats;
+    /**
+     * Retrieves the `fs.Stats` for the symbolic link referred to by the path.
+     * The callback gets two arguments `(err, stats)` where `stats` is a `fs.Stats` object. `lstat()` is identical to `stat()`, except that if `path` is a symbolic
+     * link, then the link itself is stat-ed, not the file that it refers to.
+     *
+     * See the POSIX [`lstat(2)`](http://man7.org/linux/man-pages/man2/lstat.2.html) documentation for more details.
+     * @since v0.1.30
+     */
+    export function lstat(path: PathLike, callback: (err: NodeJS.ErrnoException | null, stats: Stats) => void): void;
+    export function lstat(
+        path: PathLike,
+        options:
+            | (StatOptions & {
+                  bigint?: false | undefined;
+              })
+            | undefined,
+        callback: (err: NodeJS.ErrnoException | null, stats: Stats) => void
+    ): void;
+    export function lstat(
+        path: PathLike,
+        options: StatOptions & {
+            bigint: true;
+        },
+        callback: (err: NodeJS.ErrnoException | null, stats: BigIntStats) => void
+    ): void;
+    export function lstat(path: PathLike, options: StatOptions | undefined, callback: (err: NodeJS.ErrnoException | null, stats: Stats | BigIntStats) => void): void;
+    export namespace lstat {
+        /**
+         * Asynchronous lstat(2) - Get file status. Does not dereference symbolic links.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         */
+        function __promisify__(
+            path: PathLike,
+            options?: StatOptions & {
+                bigint?: false | undefined;
+            }
+        ): Promise<Stats>;
+        function __promisify__(
+            path: PathLike,
+            options: StatOptions & {
+                bigint: true;
+            }
+        ): Promise<BigIntStats>;
+        function __promisify__(path: PathLike, options?: StatOptions): Promise<Stats | BigIntStats>;
+    }
+    /**
+     * Synchronous lstat(2) - Get file status. Does not dereference symbolic links.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export const lstatSync: StatSyncFn;
+    /**
+     * Creates a new link from the `existingPath` to the `newPath`. See the POSIX [`link(2)`](http://man7.org/linux/man-pages/man2/link.2.html) documentation for more detail. No arguments other than
+     * a possible
+     * exception are given to the completion callback.
+     * @since v0.1.31
+     */
+    export function link(existingPath: PathLike, newPath: PathLike, callback: NoParamCallback): void;
+    export namespace link {
+        /**
+         * Asynchronous link(2) - Create a new link (also known as a hard link) to an existing file.
+         * @param existingPath A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param newPath A path to a file. If a URL is provided, it must use the `file:` protocol.
+         */
+        function __promisify__(existingPath: PathLike, newPath: PathLike): Promise<void>;
+    }
+    /**
+     * Creates a new link from the `existingPath` to the `newPath`. See the POSIX [`link(2)`](http://man7.org/linux/man-pages/man2/link.2.html) documentation for more detail. Returns `undefined`.
+     * @since v0.1.31
+     */
+    export function linkSync(existingPath: PathLike, newPath: PathLike): void;
+    /**
+     * Creates the link called `path` pointing to `target`. No arguments other than a
+     * possible exception are given to the completion callback.
+     *
+     * See the POSIX [`symlink(2)`](http://man7.org/linux/man-pages/man2/symlink.2.html) documentation for more details.
+     *
+     * The `type` argument is only available on Windows and ignored on other platforms.
+     * It can be set to `'dir'`, `'file'`, or `'junction'`. If the `type` argument is
+     * not set, Node.js will autodetect `target` type and use `'file'` or `'dir'`. If
+     * the `target` does not exist, `'file'` will be used. Windows junction points
+     * require the destination path to be absolute. When using `'junction'`, the`target` argument will automatically be normalized to absolute path.
+     *
+     * Relative targets are relative to the link’s parent directory.
+     *
+     * ```js
+     * import { symlink } from 'fs';
+     *
+     * symlink('./mew', './example/mewtwo', callback);
+     * ```
+     *
+     * The above example creates a symbolic link `mewtwo` in the `example` which points
+     * to `mew` in the same directory:
+     *
+     * ```bash
+     * $ tree example/
+     * example/
+     * ├── mew
+     * └── mewtwo -> ./mew
+     * ```
+     * @since v0.1.31
+     */
+    export function symlink(target: PathLike, path: PathLike, type: symlink.Type | undefined | null, callback: NoParamCallback): void;
+    /**
+     * Asynchronous symlink(2) - Create a new symbolic link to an existing file.
+     * @param target A path to an existing file. If a URL is provided, it must use the `file:` protocol.
+     * @param path A path to the new symlink. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function symlink(target: PathLike, path: PathLike, callback: NoParamCallback): void;
+    export namespace symlink {
+        /**
+         * Asynchronous symlink(2) - Create a new symbolic link to an existing file.
+         * @param target A path to an existing file. If a URL is provided, it must use the `file:` protocol.
+         * @param path A path to the new symlink. If a URL is provided, it must use the `file:` protocol.
+         * @param type May be set to `'dir'`, `'file'`, or `'junction'` (default is `'file'`) and is only available on Windows (ignored on other platforms).
+         * When using `'junction'`, the `target` argument will automatically be normalized to an absolute path.
+         */
+        function __promisify__(target: PathLike, path: PathLike, type?: string | null): Promise<void>;
+        type Type = 'dir' | 'file' | 'junction';
+    }
+    /**
+     * Returns `undefined`.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link symlink}.
+     * @since v0.1.31
+     */
+    export function symlinkSync(target: PathLike, path: PathLike, type?: symlink.Type | null): void;
+    /**
+     * Reads the contents of the symbolic link referred to by `path`. The callback gets
+     * two arguments `(err, linkString)`.
+     *
+     * See the POSIX [`readlink(2)`](http://man7.org/linux/man-pages/man2/readlink.2.html) documentation for more details.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the link path passed to the callback. If the `encoding` is set to `'buffer'`,
+     * the link path returned will be passed as a `Buffer` object.
+     * @since v0.1.31
+     */
+    export function readlink(path: PathLike, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, linkString: string) => void): void;
+    /**
+     * Asynchronous readlink(2) - read value of a symbolic link.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readlink(path: PathLike, options: BufferEncodingOption, callback: (err: NodeJS.ErrnoException | null, linkString: Buffer) => void): void;
+    /**
+     * Asynchronous readlink(2) - read value of a symbolic link.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readlink(path: PathLike, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, linkString: string | Buffer) => void): void;
+    /**
+     * Asynchronous readlink(2) - read value of a symbolic link.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function readlink(path: PathLike, callback: (err: NodeJS.ErrnoException | null, linkString: string) => void): void;
+    export namespace readlink {
+        /**
+         * Asynchronous readlink(2) - read value of a symbolic link.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(path: PathLike, options?: EncodingOption): Promise<string>;
+        /**
+         * Asynchronous readlink(2) - read value of a symbolic link.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(path: PathLike, options: BufferEncodingOption): Promise<Buffer>;
+        /**
+         * Asynchronous readlink(2) - read value of a symbolic link.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(path: PathLike, options?: EncodingOption): Promise<string | Buffer>;
+    }
+    /**
+     * Returns the symbolic link's string value.
+     *
+     * See the POSIX [`readlink(2)`](http://man7.org/linux/man-pages/man2/readlink.2.html) documentation for more details.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the link path returned. If the `encoding` is set to `'buffer'`,
+     * the link path returned will be passed as a `Buffer` object.
+     * @since v0.1.31
+     */
+    export function readlinkSync(path: PathLike, options?: EncodingOption): string;
+    /**
+     * Synchronous readlink(2) - read value of a symbolic link.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readlinkSync(path: PathLike, options: BufferEncodingOption): Buffer;
+    /**
+     * Synchronous readlink(2) - read value of a symbolic link.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readlinkSync(path: PathLike, options?: EncodingOption): string | Buffer;
+    /**
+     * Asynchronously computes the canonical pathname by resolving `.`, `..` and
+     * symbolic links.
+     *
+     * A canonical pathname is not necessarily unique. Hard links and bind mounts can
+     * expose a file system entity through many pathnames.
+     *
+     * This function behaves like [`realpath(3)`](http://man7.org/linux/man-pages/man3/realpath.3.html), with some exceptions:
+     *
+     * 1. No case conversion is performed on case-insensitive file systems.
+     * 2. The maximum number of symbolic links is platform-independent and generally
+     * (much) higher than what the native [`realpath(3)`](http://man7.org/linux/man-pages/man3/realpath.3.html) implementation supports.
+     *
+     * The `callback` gets two arguments `(err, resolvedPath)`. May use `process.cwd`to resolve relative paths.
+     *
+     * Only paths that can be converted to UTF8 strings are supported.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the path passed to the callback. If the `encoding` is set to `'buffer'`,
+     * the path returned will be passed as a `Buffer` object.
+     *
+     * If `path` resolves to a socket or a pipe, the function will return a system
+     * dependent name for that object.
+     * @since v0.1.31
+     */
+    export function realpath(path: PathLike, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, resolvedPath: string) => void): void;
+    /**
+     * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function realpath(path: PathLike, options: BufferEncodingOption, callback: (err: NodeJS.ErrnoException | null, resolvedPath: Buffer) => void): void;
+    /**
+     * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function realpath(path: PathLike, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, resolvedPath: string | Buffer) => void): void;
+    /**
+     * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function realpath(path: PathLike, callback: (err: NodeJS.ErrnoException | null, resolvedPath: string) => void): void;
+    export namespace realpath {
+        /**
+         * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(path: PathLike, options?: EncodingOption): Promise<string>;
+        /**
+         * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(path: PathLike, options: BufferEncodingOption): Promise<Buffer>;
+        /**
+         * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(path: PathLike, options?: EncodingOption): Promise<string | Buffer>;
+        /**
+         * Asynchronous [`realpath(3)`](http://man7.org/linux/man-pages/man3/realpath.3.html).
+         *
+         * The `callback` gets two arguments `(err, resolvedPath)`.
+         *
+         * Only paths that can be converted to UTF8 strings are supported.
+         *
+         * The optional `options` argument can be a string specifying an encoding, or an
+         * object with an `encoding` property specifying the character encoding to use for
+         * the path passed to the callback. If the `encoding` is set to `'buffer'`,
+         * the path returned will be passed as a `Buffer` object.
+         *
+         * On Linux, when Node.js is linked against musl libc, the procfs file system must
+         * be mounted on `/proc` in order for this function to work. Glibc does not have
+         * this restriction.
+         * @since v9.2.0
+         */
+        function native(path: PathLike, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, resolvedPath: string) => void): void;
+        function native(path: PathLike, options: BufferEncodingOption, callback: (err: NodeJS.ErrnoException | null, resolvedPath: Buffer) => void): void;
+        function native(path: PathLike, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, resolvedPath: string | Buffer) => void): void;
+        function native(path: PathLike, callback: (err: NodeJS.ErrnoException | null, resolvedPath: string) => void): void;
+    }
+    /**
+     * Returns the resolved pathname.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link realpath}.
+     * @since v0.1.31
+     */
+    export function realpathSync(path: PathLike, options?: EncodingOption): string;
+    /**
+     * Synchronous realpath(3) - return the canonicalized absolute pathname.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function realpathSync(path: PathLike, options: BufferEncodingOption): Buffer;
+    /**
+     * Synchronous realpath(3) - return the canonicalized absolute pathname.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function realpathSync(path: PathLike, options?: EncodingOption): string | Buffer;
+    export namespace realpathSync {
+        function native(path: PathLike, options?: EncodingOption): string;
+        function native(path: PathLike, options: BufferEncodingOption): Buffer;
+        function native(path: PathLike, options?: EncodingOption): string | Buffer;
+    }
+    /**
+     * Asynchronously removes a file or symbolic link. No arguments other than a
+     * possible exception are given to the completion callback.
+     *
+     * ```js
+     * import { unlink } from 'fs';
+     * // Assuming that 'path/file.txt' is a regular file.
+     * unlink('path/file.txt', (err) => {
+     *   if (err) throw err;
+     *   console.log('path/file.txt was deleted');
+     * });
+     * ```
+     *
+     * `fs.unlink()` will not work on a directory, empty or otherwise. To remove a
+     * directory, use {@link rmdir}.
+     *
+     * See the POSIX [`unlink(2)`](http://man7.org/linux/man-pages/man2/unlink.2.html) documentation for more details.
+     * @since v0.0.2
+     */
+    export function unlink(path: PathLike, callback: NoParamCallback): void;
+    export namespace unlink {
+        /**
+         * Asynchronous unlink(2) - delete a name and possibly the file it refers to.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         */
+        function __promisify__(path: PathLike): Promise<void>;
+    }
+    /**
+     * Synchronous [`unlink(2)`](http://man7.org/linux/man-pages/man2/unlink.2.html). Returns `undefined`.
+     * @since v0.1.21
+     */
+    export function unlinkSync(path: PathLike): void;
+    export interface RmDirOptions {
+        /**
+         * If an `EBUSY`, `EMFILE`, `ENFILE`, `ENOTEMPTY`, or
+         * `EPERM` error is encountered, Node.js will retry the operation with a linear
+         * backoff wait of `retryDelay` ms longer on each try. This option represents the
+         * number of retries. This option is ignored if the `recursive` option is not
+         * `true`.
+         * @default 0
+         */
+        maxRetries?: number | undefined;
+        /**
+         * @deprecated since v14.14.0 In future versions of Node.js and will trigger a warning
+         * `fs.rmdir(path, { recursive: true })` will throw if `path` does not exist or is a file.
+         * Use `fs.rm(path, { recursive: true, force: true })` instead.
+         *
+         * If `true`, perform a recursive directory removal. In
+         * recursive mode soperations are retried on failure.
+         * @default false
+         */
+        recursive?: boolean | undefined;
+        /**
+         * The amount of time in milliseconds to wait between retries.
+         * This option is ignored if the `recursive` option is not `true`.
+         * @default 100
+         */
+        retryDelay?: number | undefined;
+    }
+    /**
+     * Asynchronous [`rmdir(2)`](http://man7.org/linux/man-pages/man2/rmdir.2.html). No arguments other than a possible exception are given
+     * to the completion callback.
+     *
+     * Using `fs.rmdir()` on a file (not a directory) results in an `ENOENT` error on
+     * Windows and an `ENOTDIR` error on POSIX.
+     *
+     * To get a behavior similar to the `rm -rf` Unix command, use {@link rm} with options `{ recursive: true, force: true }`.
+     * @since v0.0.2
+     */
+    export function rmdir(path: PathLike, callback: NoParamCallback): void;
+    export function rmdir(path: PathLike, options: RmDirOptions, callback: NoParamCallback): void;
+    export namespace rmdir {
+        /**
+         * Asynchronous rmdir(2) - delete a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         */
+        function __promisify__(path: PathLike, options?: RmDirOptions): Promise<void>;
+    }
+    /**
+     * Synchronous [`rmdir(2)`](http://man7.org/linux/man-pages/man2/rmdir.2.html). Returns `undefined`.
+     *
+     * Using `fs.rmdirSync()` on a file (not a directory) results in an `ENOENT` error
+     * on Windows and an `ENOTDIR` error on POSIX.
+     *
+     * To get a behavior similar to the `rm -rf` Unix command, use {@link rmSync} with options `{ recursive: true, force: true }`.
+     * @since v0.1.21
+     */
+    export function rmdirSync(path: PathLike, options?: RmDirOptions): void;
+    export interface RmOptions {
+        /**
+         * When `true`, exceptions will be ignored if `path` does not exist.
+         * @default false
+         */
+        force?: boolean | undefined;
+        /**
+         * If an `EBUSY`, `EMFILE`, `ENFILE`, `ENOTEMPTY`, or
+         * `EPERM` error is encountered, Node.js will retry the operation with a linear
+         * backoff wait of `retryDelay` ms longer on each try. This option represents the
+         * number of retries. This option is ignored if the `recursive` option is not
+         * `true`.
+         * @default 0
+         */
+        maxRetries?: number | undefined;
+        /**
+         * If `true`, perform a recursive directory removal. In
+         * recursive mode, operations are retried on failure.
+         * @default false
+         */
+        recursive?: boolean | undefined;
+        /**
+         * The amount of time in milliseconds to wait between retries.
+         * This option is ignored if the `recursive` option is not `true`.
+         * @default 100
+         */
+        retryDelay?: number | undefined;
+    }
+    /**
+     * Asynchronously removes files and directories (modeled on the standard POSIX `rm`utility). No arguments other than a possible exception are given to the
+     * completion callback.
+     * @since v14.14.0
+     */
+    export function rm(path: PathLike, callback: NoParamCallback): void;
+    export function rm(path: PathLike, options: RmOptions, callback: NoParamCallback): void;
+    export namespace rm {
+        /**
+         * Asynchronously removes files and directories (modeled on the standard POSIX `rm` utility).
+         */
+        function __promisify__(path: PathLike, options?: RmOptions): Promise<void>;
+    }
+    /**
+     * Synchronously removes files and directories (modeled on the standard POSIX `rm`utility). Returns `undefined`.
+     * @since v14.14.0
+     */
+    export function rmSync(path: PathLike, options?: RmOptions): void;
+    export interface MakeDirectoryOptions {
+        /**
+         * Indicates whether parent folders should be created.
+         * If a folder was created, the path to the first created folder will be returned.
+         * @default false
+         */
+        recursive?: boolean | undefined;
+        /**
+         * A file mode. If a string is passed, it is parsed as an octal integer. If not specified
+         * @default 0o777
+         */
+        mode?: Mode | undefined;
+    }
+    /**
+     * Asynchronously creates a directory.
+     *
+     * The callback is given a possible exception and, if `recursive` is `true`, the
+     * first directory path created, `(err[, path])`.`path` can still be `undefined` when `recursive` is `true`, if no directory was
+     * created.
+     *
+     * The optional `options` argument can be an integer specifying `mode` (permission
+     * and sticky bits), or an object with a `mode` property and a `recursive`property indicating whether parent directories should be created. Calling`fs.mkdir()` when `path` is a directory that
+     * exists results in an error only
+     * when `recursive` is false.
+     *
+     * ```js
+     * import { mkdir } from 'fs';
+     *
+     * // Creates /tmp/a/apple, regardless of whether `/tmp` and /tmp/a exist.
+     * mkdir('/tmp/a/apple', { recursive: true }, (err) => {
+     *   if (err) throw err;
+     * });
+     * ```
+     *
+     * On Windows, using `fs.mkdir()` on the root directory even with recursion will
+     * result in an error:
+     *
+     * ```js
+     * import { mkdir } from 'fs';
+     *
+     * mkdir('/', { recursive: true }, (err) => {
+     *   // => [Error: EPERM: operation not permitted, mkdir 'C:\']
+     * });
+     * ```
+     *
+     * See the POSIX [`mkdir(2)`](http://man7.org/linux/man-pages/man2/mkdir.2.html) documentation for more details.
+     * @since v0.1.8
+     */
+    export function mkdir(
+        path: PathLike,
+        options: MakeDirectoryOptions & {
+            recursive: true;
+        },
+        callback: (err: NodeJS.ErrnoException | null, path?: string) => void
+    ): void;
+    /**
+     * Asynchronous mkdir(2) - create a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+     * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+     */
+    export function mkdir(
+        path: PathLike,
+        options:
+            | Mode
+            | (MakeDirectoryOptions & {
+                  recursive?: false | undefined;
+              })
+            | null
+            | undefined,
+        callback: NoParamCallback
+    ): void;
+    /**
+     * Asynchronous mkdir(2) - create a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+     * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+     */
+    export function mkdir(path: PathLike, options: Mode | MakeDirectoryOptions | null | undefined, callback: (err: NodeJS.ErrnoException | null, path?: string) => void): void;
+    /**
+     * Asynchronous mkdir(2) - create a directory with a mode of `0o777`.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function mkdir(path: PathLike, callback: NoParamCallback): void;
+    export namespace mkdir {
+        /**
+         * Asynchronous mkdir(2) - create a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+         * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+         */
+        function __promisify__(
+            path: PathLike,
+            options: MakeDirectoryOptions & {
+                recursive: true;
+            }
+        ): Promise<string | undefined>;
+        /**
+         * Asynchronous mkdir(2) - create a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+         * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+         */
+        function __promisify__(
+            path: PathLike,
+            options?:
+                | Mode
+                | (MakeDirectoryOptions & {
+                      recursive?: false | undefined;
+                  })
+                | null
+        ): Promise<void>;
+        /**
+         * Asynchronous mkdir(2) - create a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+         * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+         */
+        function __promisify__(path: PathLike, options?: Mode | MakeDirectoryOptions | null): Promise<string | undefined>;
+    }
+    /**
+     * Synchronously creates a directory. Returns `undefined`, or if `recursive` is`true`, the first directory path created.
+     * This is the synchronous version of {@link mkdir}.
+     *
+     * See the POSIX [`mkdir(2)`](http://man7.org/linux/man-pages/man2/mkdir.2.html) documentation for more details.
+     * @since v0.1.21
+     */
+    export function mkdirSync(
+        path: PathLike,
+        options: MakeDirectoryOptions & {
+            recursive: true;
+        }
+    ): string | undefined;
+    /**
+     * Synchronous mkdir(2) - create a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+     * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+     */
+    export function mkdirSync(
+        path: PathLike,
+        options?:
+            | Mode
+            | (MakeDirectoryOptions & {
+                  recursive?: false | undefined;
+              })
+            | null
+    ): void;
+    /**
+     * Synchronous mkdir(2) - create a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+     * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+     */
+    export function mkdirSync(path: PathLike, options?: Mode | MakeDirectoryOptions | null): string | undefined;
+    /**
+     * Creates a unique temporary directory.
+     *
+     * Generates six random characters to be appended behind a required`prefix` to create a unique temporary directory. Due to platform
+     * inconsistencies, avoid trailing `X` characters in `prefix`. Some platforms,
+     * notably the BSDs, can return more than six random characters, and replace
+     * trailing `X` characters in `prefix` with random characters.
+     *
+     * The created directory path is passed as a string to the callback's second
+     * parameter.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use.
+     *
+     * ```js
+     * import { mkdtemp } from 'fs';
+     *
+     * mkdtemp(path.join(os.tmpdir(), 'foo-'), (err, directory) => {
+     *   if (err) throw err;
+     *   console.log(directory);
+     *   // Prints: /tmp/foo-itXde2 or C:\Users\...\AppData\Local\Temp\foo-itXde2
+     * });
+     * ```
+     *
+     * The `fs.mkdtemp()` method will append the six randomly selected characters
+     * directly to the `prefix` string. For instance, given a directory `/tmp`, if the
+     * intention is to create a temporary directory _within_`/tmp`, the `prefix`must end with a trailing platform-specific path separator
+     * (`require('path').sep`).
+     *
+     * ```js
+     * import { tmpdir } from 'os';
+     * import { mkdtemp } from 'fs';
+     *
+     * // The parent directory for the new temporary directory
+     * const tmpDir = tmpdir();
+     *
+     * // This method is *INCORRECT*:
+     * mkdtemp(tmpDir, (err, directory) => {
+     *   if (err) throw err;
+     *   console.log(directory);
+     *   // Will print something similar to `/tmpabc123`.
+     *   // A new temporary directory is created at the file system root
+     *   // rather than *within* the /tmp directory.
+     * });
+     *
+     * // This method is *CORRECT*:
+     * import { sep } from 'path';
+     * mkdtemp(`${tmpDir}${sep}`, (err, directory) => {
+     *   if (err) throw err;
+     *   console.log(directory);
+     *   // Will print something similar to `/tmp/abc123`.
+     *   // A new temporary directory is created within
+     *   // the /tmp directory.
+     * });
+     * ```
+     * @since v5.10.0
+     */
+    export function mkdtemp(prefix: string, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, folder: string) => void): void;
+    /**
+     * Asynchronously creates a unique temporary directory.
+     * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function mkdtemp(
+        prefix: string,
+        options:
+            | 'buffer'
+            | {
+                  encoding: 'buffer';
+              },
+        callback: (err: NodeJS.ErrnoException | null, folder: Buffer) => void
+    ): void;
+    /**
+     * Asynchronously creates a unique temporary directory.
+     * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function mkdtemp(prefix: string, options: EncodingOption, callback: (err: NodeJS.ErrnoException | null, folder: string | Buffer) => void): void;
+    /**
+     * Asynchronously creates a unique temporary directory.
+     * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+     */
+    export function mkdtemp(prefix: string, callback: (err: NodeJS.ErrnoException | null, folder: string) => void): void;
+    export namespace mkdtemp {
+        /**
+         * Asynchronously creates a unique temporary directory.
+         * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(prefix: string, options?: EncodingOption): Promise<string>;
+        /**
+         * Asynchronously creates a unique temporary directory.
+         * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(prefix: string, options: BufferEncodingOption): Promise<Buffer>;
+        /**
+         * Asynchronously creates a unique temporary directory.
+         * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(prefix: string, options?: EncodingOption): Promise<string | Buffer>;
+    }
+    /**
+     * Returns the created directory path.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link mkdtemp}.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use.
+     * @since v5.10.0
+     */
+    export function mkdtempSync(prefix: string, options?: EncodingOption): string;
+    /**
+     * Synchronously creates a unique temporary directory.
+     * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function mkdtempSync(prefix: string, options: BufferEncodingOption): Buffer;
+    /**
+     * Synchronously creates a unique temporary directory.
+     * Generates six random characters to be appended behind a required prefix to create a unique temporary directory.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function mkdtempSync(prefix: string, options?: EncodingOption): string | Buffer;
+    /**
+     * Reads the contents of a directory. The callback gets two arguments `(err, files)`where `files` is an array of the names of the files in the directory excluding`'.'` and `'..'`.
+     *
+     * See the POSIX [`readdir(3)`](http://man7.org/linux/man-pages/man3/readdir.3.html) documentation for more details.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the filenames passed to the callback. If the `encoding` is set to `'buffer'`,
+     * the filenames returned will be passed as `Buffer` objects.
+     *
+     * If `options.withFileTypes` is set to `true`, the `files` array will contain `fs.Dirent` objects.
+     * @since v0.1.8
+     */
+    export function readdir(
+        path: PathLike,
+        options:
+            | {
+                  encoding: BufferEncoding | null;
+                  withFileTypes?: false | undefined;
+              }
+            | BufferEncoding
+            | undefined
+            | null,
+        callback: (err: NodeJS.ErrnoException | null, files: string[]) => void
+    ): void;
+    /**
+     * Asynchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readdir(
+        path: PathLike,
+        options:
+            | {
+                  encoding: 'buffer';
+                  withFileTypes?: false | undefined;
+              }
+            | 'buffer',
+        callback: (err: NodeJS.ErrnoException | null, files: Buffer[]) => void
+    ): void;
+    /**
+     * Asynchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readdir(
+        path: PathLike,
+        options:
+            | (ObjectEncodingOptions & {
+                  withFileTypes?: false | undefined;
+              })
+            | BufferEncoding
+            | undefined
+            | null,
+        callback: (err: NodeJS.ErrnoException | null, files: string[] | Buffer[]) => void
+    ): void;
+    /**
+     * Asynchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function readdir(path: PathLike, callback: (err: NodeJS.ErrnoException | null, files: string[]) => void): void;
+    /**
+     * Asynchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options If called with `withFileTypes: true` the result data will be an array of Dirent.
+     */
+    export function readdir(
+        path: PathLike,
+        options: ObjectEncodingOptions & {
+            withFileTypes: true;
+        },
+        callback: (err: NodeJS.ErrnoException | null, files: Dirent[]) => void
+    ): void;
+    export namespace readdir {
+        /**
+         * Asynchronous readdir(3) - read a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(
+            path: PathLike,
+            options?:
+                | {
+                      encoding: BufferEncoding | null;
+                      withFileTypes?: false | undefined;
+                  }
+                | BufferEncoding
+                | null
+        ): Promise<string[]>;
+        /**
+         * Asynchronous readdir(3) - read a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(
+            path: PathLike,
+            options:
+                | 'buffer'
+                | {
+                      encoding: 'buffer';
+                      withFileTypes?: false | undefined;
+                  }
+        ): Promise<Buffer[]>;
+        /**
+         * Asynchronous readdir(3) - read a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+         */
+        function __promisify__(
+            path: PathLike,
+            options?:
+                | (ObjectEncodingOptions & {
+                      withFileTypes?: false | undefined;
+                  })
+                | BufferEncoding
+                | null
+        ): Promise<string[] | Buffer[]>;
+        /**
+         * Asynchronous readdir(3) - read a directory.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param options If called with `withFileTypes: true` the result data will be an array of Dirent
+         */
+        function __promisify__(
+            path: PathLike,
+            options: ObjectEncodingOptions & {
+                withFileTypes: true;
+            }
+        ): Promise<Dirent[]>;
+    }
+    /**
+     * Reads the contents of the directory.
+     *
+     * See the POSIX [`readdir(3)`](http://man7.org/linux/man-pages/man3/readdir.3.html) documentation for more details.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the filenames returned. If the `encoding` is set to `'buffer'`,
+     * the filenames returned will be passed as `Buffer` objects.
+     *
+     * If `options.withFileTypes` is set to `true`, the result will contain `fs.Dirent` objects.
+     * @since v0.1.21
+     */
+    export function readdirSync(
+        path: PathLike,
+        options?:
+            | {
+                  encoding: BufferEncoding | null;
+                  withFileTypes?: false | undefined;
+              }
+            | BufferEncoding
+            | null
+    ): string[];
+    /**
+     * Synchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readdirSync(
+        path: PathLike,
+        options:
+            | {
+                  encoding: 'buffer';
+                  withFileTypes?: false | undefined;
+              }
+            | 'buffer'
+    ): Buffer[];
+    /**
+     * Synchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    export function readdirSync(
+        path: PathLike,
+        options?:
+            | (ObjectEncodingOptions & {
+                  withFileTypes?: false | undefined;
+              })
+            | BufferEncoding
+            | null
+    ): string[] | Buffer[];
+    /**
+     * Synchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options If called with `withFileTypes: true` the result data will be an array of Dirent.
+     */
+    export function readdirSync(
+        path: PathLike,
+        options: ObjectEncodingOptions & {
+            withFileTypes: true;
+        }
+    ): Dirent[];
+    /**
+     * Closes the file descriptor. No arguments other than a possible exception are
+     * given to the completion callback.
+     *
+     * Calling `fs.close()` on any file descriptor (`fd`) that is currently in use
+     * through any other `fs` operation may lead to undefined behavior.
+     *
+     * See the POSIX [`close(2)`](http://man7.org/linux/man-pages/man2/close.2.html) documentation for more detail.
+     * @since v0.0.2
+     */
+    export function close(fd: number, callback?: NoParamCallback): void;
+    export namespace close {
+        /**
+         * Asynchronous close(2) - close a file descriptor.
+         * @param fd A file descriptor.
+         */
+        function __promisify__(fd: number): Promise<void>;
+    }
+    /**
+     * Closes the file descriptor. Returns `undefined`.
+     *
+     * Calling `fs.closeSync()` on any file descriptor (`fd`) that is currently in use
+     * through any other `fs` operation may lead to undefined behavior.
+     *
+     * See the POSIX [`close(2)`](http://man7.org/linux/man-pages/man2/close.2.html) documentation for more detail.
+     * @since v0.1.21
+     */
+    export function closeSync(fd: number): void;
+    /**
+     * Asynchronous file open. See the POSIX [`open(2)`](http://man7.org/linux/man-pages/man2/open.2.html) documentation for more details.
+     *
+     * `mode` sets the file mode (permission and sticky bits), but only if the file was
+     * created. On Windows, only the write permission can be manipulated; see {@link chmod}.
+     *
+     * The callback gets two arguments `(err, fd)`.
+     *
+     * Some characters (`< > : " / \ | ? *`) are reserved under Windows as documented
+     * by [Naming Files, Paths, and Namespaces](https://docs.microsoft.com/en-us/windows/desktop/FileIO/naming-a-file). Under NTFS, if the filename contains
+     * a colon, Node.js will open a file system stream, as described by [this MSDN page](https://docs.microsoft.com/en-us/windows/desktop/FileIO/using-streams).
+     *
+     * Functions based on `fs.open()` exhibit this behavior as well:`fs.writeFile()`, `fs.readFile()`, etc.
+     * @since v0.0.2
+     * @param [flags='r'] See `support of file system `flags``.
+     * @param [mode=0o666]
+     */
+    export function open(path: PathLike, flags: OpenMode, mode: Mode | undefined | null, callback: (err: NodeJS.ErrnoException | null, fd: number) => void): void;
+    /**
+     * Asynchronous open(2) - open and possibly create a file. If the file is created, its mode will be `0o666`.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function open(path: PathLike, flags: OpenMode, callback: (err: NodeJS.ErrnoException | null, fd: number) => void): void;
+    export namespace open {
+        /**
+         * Asynchronous open(2) - open and possibly create a file.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param mode A file mode. If a string is passed, it is parsed as an octal integer. If not supplied, defaults to `0o666`.
+         */
+        function __promisify__(path: PathLike, flags: OpenMode, mode?: Mode | null): Promise<number>;
+    }
+    /**
+     * Returns an integer representing the file descriptor.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link open}.
+     * @since v0.1.21
+     * @param [flags='r']
+     * @param [mode=0o666]
+     */
+    export function openSync(path: PathLike, flags: OpenMode, mode?: Mode | null): number;
+    /**
+     * Change the file system timestamps of the object referenced by `path`.
+     *
+     * The `atime` and `mtime` arguments follow these rules:
+     *
+     * * Values can be either numbers representing Unix epoch time in seconds,`Date`s, or a numeric string like `'123456789.0'`.
+     * * If the value can not be converted to a number, or is `NaN`, `Infinity` or`-Infinity`, an `Error` will be thrown.
+     * @since v0.4.2
+     */
+    export function utimes(path: PathLike, atime: TimeLike, mtime: TimeLike, callback: NoParamCallback): void;
+    export namespace utimes {
+        /**
+         * Asynchronously change file timestamps of the file referenced by the supplied path.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * @param atime The last access time. If a string is provided, it will be coerced to number.
+         * @param mtime The last modified time. If a string is provided, it will be coerced to number.
+         */
+        function __promisify__(path: PathLike, atime: TimeLike, mtime: TimeLike): Promise<void>;
+    }
+    /**
+     * Returns `undefined`.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link utimes}.
+     * @since v0.4.2
+     */
+    export function utimesSync(path: PathLike, atime: TimeLike, mtime: TimeLike): void;
+    /**
+     * Change the file system timestamps of the object referenced by the supplied file
+     * descriptor. See {@link utimes}.
+     * @since v0.4.2
+     */
+    export function futimes(fd: number, atime: TimeLike, mtime: TimeLike, callback: NoParamCallback): void;
+    export namespace futimes {
+        /**
+         * Asynchronously change file timestamps of the file referenced by the supplied file descriptor.
+         * @param fd A file descriptor.
+         * @param atime The last access time. If a string is provided, it will be coerced to number.
+         * @param mtime The last modified time. If a string is provided, it will be coerced to number.
+         */
+        function __promisify__(fd: number, atime: TimeLike, mtime: TimeLike): Promise<void>;
+    }
+    /**
+     * Synchronous version of {@link futimes}. Returns `undefined`.
+     * @since v0.4.2
+     */
+    export function futimesSync(fd: number, atime: TimeLike, mtime: TimeLike): void;
+    /**
+     * Request that all data for the open file descriptor is flushed to the storage
+     * device. The specific implementation is operating system and device specific.
+     * Refer to the POSIX [`fsync(2)`](http://man7.org/linux/man-pages/man2/fsync.2.html) documentation for more detail. No arguments other
+     * than a possible exception are given to the completion callback.
+     * @since v0.1.96
+     */
+    export function fsync(fd: number, callback: NoParamCallback): void;
+    export namespace fsync {
+        /**
+         * Asynchronous fsync(2) - synchronize a file's in-core state with the underlying storage device.
+         * @param fd A file descriptor.
+         */
+        function __promisify__(fd: number): Promise<void>;
+    }
+    /**
+     * Request that all data for the open file descriptor is flushed to the storage
+     * device. The specific implementation is operating system and device specific.
+     * Refer to the POSIX [`fsync(2)`](http://man7.org/linux/man-pages/man2/fsync.2.html) documentation for more detail. Returns `undefined`.
+     * @since v0.1.96
+     */
+    export function fsyncSync(fd: number): void;
+    /**
+     * Write `buffer` to the file specified by `fd`. If `buffer` is a normal object, it
+     * must have an own `toString` function property.
+     *
+     * `offset` determines the part of the buffer to be written, and `length` is
+     * an integer specifying the number of bytes to write.
+     *
+     * `position` refers to the offset from the beginning of the file where this data
+     * should be written. If `typeof position !== 'number'`, the data will be written
+     * at the current position. See [`pwrite(2)`](http://man7.org/linux/man-pages/man2/pwrite.2.html).
+     *
+     * The callback will be given three arguments `(err, bytesWritten, buffer)` where`bytesWritten` specifies how many _bytes_ were written from `buffer`.
+     *
+     * If this method is invoked as its `util.promisify()` ed version, it returns
+     * a promise for an `Object` with `bytesWritten` and `buffer` properties.
+     *
+     * It is unsafe to use `fs.write()` multiple times on the same file without waiting
+     * for the callback. For this scenario, {@link createWriteStream} is
+     * recommended.
+     *
+     * On Linux, positional writes don't work when the file is opened in append mode.
+     * The kernel ignores the position argument and always appends the data to
+     * the end of the file.
+     * @since v0.0.2
+     */
+    export function write<TBuffer extends NodeJS.ArrayBufferView>(
+        fd: number,
+        buffer: TBuffer,
+        offset: number | undefined | null,
+        length: number | undefined | null,
+        position: number | undefined | null,
+        callback: (err: NodeJS.ErrnoException | null, written: number, buffer: TBuffer) => void
+    ): void;
+    /**
+     * Asynchronously writes `buffer` to the file referenced by the supplied file descriptor.
+     * @param fd A file descriptor.
+     * @param offset The part of the buffer to be written. If not supplied, defaults to `0`.
+     * @param length The number of bytes to write. If not supplied, defaults to `buffer.length - offset`.
+     */
+    export function write<TBuffer extends NodeJS.ArrayBufferView>(
+        fd: number,
+        buffer: TBuffer,
+        offset: number | undefined | null,
+        length: number | undefined | null,
+        callback: (err: NodeJS.ErrnoException | null, written: number, buffer: TBuffer) => void
+    ): void;
+    /**
+     * Asynchronously writes `buffer` to the file referenced by the supplied file descriptor.
+     * @param fd A file descriptor.
+     * @param offset The part of the buffer to be written. If not supplied, defaults to `0`.
+     */
+    export function write<TBuffer extends NodeJS.ArrayBufferView>(
+        fd: number,
+        buffer: TBuffer,
+        offset: number | undefined | null,
+        callback: (err: NodeJS.ErrnoException | null, written: number, buffer: TBuffer) => void
+    ): void;
+    /**
+     * Asynchronously writes `buffer` to the file referenced by the supplied file descriptor.
+     * @param fd A file descriptor.
+     */
+    export function write<TBuffer extends NodeJS.ArrayBufferView>(fd: number, buffer: TBuffer, callback: (err: NodeJS.ErrnoException | null, written: number, buffer: TBuffer) => void): void;
+    /**
+     * Asynchronously writes `string` to the file referenced by the supplied file descriptor.
+     * @param fd A file descriptor.
+     * @param string A string to write.
+     * @param position The offset from the beginning of the file where this data should be written. If not supplied, defaults to the current position.
+     * @param encoding The expected string encoding.
+     */
+    export function write(
+        fd: number,
+        string: string,
+        position: number | undefined | null,
+        encoding: BufferEncoding | undefined | null,
+        callback: (err: NodeJS.ErrnoException | null, written: number, str: string) => void
+    ): void;
+    /**
+     * Asynchronously writes `string` to the file referenced by the supplied file descriptor.
+     * @param fd A file descriptor.
+     * @param string A string to write.
+     * @param position The offset from the beginning of the file where this data should be written. If not supplied, defaults to the current position.
+     */
+    export function write(fd: number, string: string, position: number | undefined | null, callback: (err: NodeJS.ErrnoException | null, written: number, str: string) => void): void;
+    /**
+     * Asynchronously writes `string` to the file referenced by the supplied file descriptor.
+     * @param fd A file descriptor.
+     * @param string A string to write.
+     */
+    export function write(fd: number, string: string, callback: (err: NodeJS.ErrnoException | null, written: number, str: string) => void): void;
+    export namespace write {
+        /**
+         * Asynchronously writes `buffer` to the file referenced by the supplied file descriptor.
+         * @param fd A file descriptor.
+         * @param offset The part of the buffer to be written. If not supplied, defaults to `0`.
+         * @param length The number of bytes to write. If not supplied, defaults to `buffer.length - offset`.
+         * @param position The offset from the beginning of the file where this data should be written. If not supplied, defaults to the current position.
+         */
+        function __promisify__<TBuffer extends NodeJS.ArrayBufferView>(
+            fd: number,
+            buffer?: TBuffer,
+            offset?: number,
+            length?: number,
+            position?: number | null
+        ): Promise<{
+            bytesWritten: number;
+            buffer: TBuffer;
+        }>;
+        /**
+         * Asynchronously writes `string` to the file referenced by the supplied file descriptor.
+         * @param fd A file descriptor.
+         * @param string A string to write.
+         * @param position The offset from the beginning of the file where this data should be written. If not supplied, defaults to the current position.
+         * @param encoding The expected string encoding.
+         */
+        function __promisify__(
+            fd: number,
+            string: string,
+            position?: number | null,
+            encoding?: BufferEncoding | null
+        ): Promise<{
+            bytesWritten: number;
+            buffer: string;
+        }>;
+    }
+    /**
+     * If `buffer` is a plain object, it must have an own (not inherited) `toString`function property.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link write}.
+     * @since v0.1.21
+     * @return The number of bytes written.
+     */
+    export function writeSync(fd: number, buffer: NodeJS.ArrayBufferView, offset?: number | null, length?: number | null, position?: number | null): number;
+    /**
+     * Synchronously writes `string` to the file referenced by the supplied file descriptor, returning the number of bytes written.
+     * @param fd A file descriptor.
+     * @param string A string to write.
+     * @param position The offset from the beginning of the file where this data should be written. If not supplied, defaults to the current position.
+     * @param encoding The expected string encoding.
+     */
+    export function writeSync(fd: number, string: string, position?: number | null, encoding?: BufferEncoding | null): number;
+    export type ReadPosition = number | bigint;
+    export interface ReadSyncOptions {
+        /**
+         * @default 0
+         */
+        offset?: number | undefined;
+        /**
+         * @default `length of buffer`
+         */
+        length?: number | undefined;
+        /**
+         * @default null
+         */
+        position?: ReadPosition | null | undefined;
+    }
+    export interface ReadAsyncOptions<TBuffer extends NodeJS.ArrayBufferView> extends ReadSyncOptions {
+        buffer?: TBuffer;
+    }
+    /**
+     * Read data from the file specified by `fd`.
+     *
+     * The callback is given the three arguments, `(err, bytesRead, buffer)`.
+     *
+     * If the file is not modified concurrently, the end-of-file is reached when the
+     * number of bytes read is zero.
+     *
+     * If this method is invoked as its `util.promisify()` ed version, it returns
+     * a promise for an `Object` with `bytesRead` and `buffer` properties.
+     * @since v0.0.2
+     * @param buffer The buffer that the data will be written to.
+     * @param offset The position in `buffer` to write the data to.
+     * @param length The number of bytes to read.
+     * @param position Specifies where to begin reading from in the file. If `position` is `null` or `-1 `, data will be read from the current file position, and the file position will be updated. If
+     * `position` is an integer, the file position will be unchanged.
+     */
+    export function read<TBuffer extends NodeJS.ArrayBufferView>(
+        fd: number,
+        buffer: TBuffer,
+        offset: number,
+        length: number,
+        position: ReadPosition | null,
+        callback: (err: NodeJS.ErrnoException | null, bytesRead: number, buffer: TBuffer) => void
+    ): void;
+    /**
+     * Similar to the above `fs.read` function, this version takes an optional `options` object.
+     * If not otherwise specified in an `options` object,
+     * `buffer` defaults to `Buffer.alloc(16384)`,
+     * `offset` defaults to `0`,
+     * `length` defaults to `buffer.byteLength`, `- offset` as of Node 17.6.0
+     * `position` defaults to `null`
+     * @since v12.17.0, 13.11.0
+     */
+    export function read<TBuffer extends NodeJS.ArrayBufferView>(
+        fd: number,
+        options: ReadAsyncOptions<TBuffer>,
+        callback: (err: NodeJS.ErrnoException | null, bytesRead: number, buffer: TBuffer) => void
+    ): void;
+    export function read(
+        fd: number,
+        callback: (err: NodeJS.ErrnoException | null, bytesRead: number, buffer: NodeJS.ArrayBufferView) => void
+    ): void;
+    export namespace read {
+        /**
+         * @param fd A file descriptor.
+         * @param buffer The buffer that the data will be written to.
+         * @param offset The offset in the buffer at which to start writing.
+         * @param length The number of bytes to read.
+         * @param position The offset from the beginning of the file from which data should be read. If `null`, data will be read from the current position.
+         */
+        function __promisify__<TBuffer extends NodeJS.ArrayBufferView>(
+            fd: number,
+            buffer: TBuffer,
+            offset: number,
+            length: number,
+            position: number | null
+        ): Promise<{
+            bytesRead: number;
+            buffer: TBuffer;
+        }>;
+        function __promisify__<TBuffer extends NodeJS.ArrayBufferView>(
+            fd: number,
+            options: ReadAsyncOptions<TBuffer>
+        ): Promise<{
+            bytesRead: number;
+            buffer: TBuffer;
+        }>;
+        function __promisify__(
+            fd: number
+        ): Promise<{
+            bytesRead: number;
+            buffer: NodeJS.ArrayBufferView;
+        }>;
+    }
+    /**
+     * Returns the number of `bytesRead`.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link read}.
+     * @since v0.1.21
+     */
+    export function readSync(fd: number, buffer: NodeJS.ArrayBufferView, offset: number, length: number, position: ReadPosition | null): number;
+    /**
+     * Similar to the above `fs.readSync` function, this version takes an optional `options` object.
+     * If no `options` object is specified, it will default with the above values.
+     */
+    export function readSync(fd: number, buffer: NodeJS.ArrayBufferView, opts?: ReadSyncOptions): number;
+    /**
+     * Asynchronously reads the entire contents of a file.
+     *
+     * ```js
+     * import { readFile } from 'fs';
+     *
+     * readFile('/etc/passwd', (err, data) => {
+     *   if (err) throw err;
+     *   console.log(data);
+     * });
+     * ```
+     *
+     * The callback is passed two arguments `(err, data)`, where `data` is the
+     * contents of the file.
+     *
+     * If no encoding is specified, then the raw buffer is returned.
+     *
+     * If `options` is a string, then it specifies the encoding:
+     *
+     * ```js
+     * import { readFile } from 'fs';
+     *
+     * readFile('/etc/passwd', 'utf8', callback);
+     * ```
+     *
+     * When the path is a directory, the behavior of `fs.readFile()` and {@link readFileSync} is platform-specific. On macOS, Linux, and Windows, an
+     * error will be returned. On FreeBSD, a representation of the directory's contents
+     * will be returned.
+     *
+     * ```js
+     * import { readFile } from 'fs';
+     *
+     * // macOS, Linux, and Windows
+     * readFile('<directory>', (err, data) => {
+     *   // => [Error: EISDIR: illegal operation on a directory, read <directory>]
+     * });
+     *
+     * //  FreeBSD
+     * readFile('<directory>', (err, data) => {
+     *   // => null, <data>
+     * });
+     * ```
+     *
+     * It is possible to abort an ongoing request using an `AbortSignal`. If a
+     * request is aborted the callback is called with an `AbortError`:
+     *
+     * ```js
+     * import { readFile } from 'fs';
+     *
+     * const controller = new AbortController();
+     * const signal = controller.signal;
+     * readFile(fileInfo[0].name, { signal }, (err, buf) => {
+     *   // ...
+     * });
+     * // When you want to abort the request
+     * controller.abort();
+     * ```
+     *
+     * The `fs.readFile()` function buffers the entire file. To minimize memory costs,
+     * when possible prefer streaming via `fs.createReadStream()`.
+     *
+     * Aborting an ongoing request does not abort individual operating
+     * system requests but rather the internal buffering `fs.readFile` performs.
+     * @since v0.1.29
+     * @param path filename or file descriptor
+     */
+    export function readFile(
+        path: PathOrFileDescriptor,
+        options:
+            | ({
+                  encoding?: null | undefined;
+                  flag?: string | undefined;
+              } & Abortable)
+            | undefined
+            | null,
+        callback: (err: NodeJS.ErrnoException | null, data: Buffer) => void
+    ): void;
+    /**
+     * Asynchronously reads the entire contents of a file.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+     * @param options Either the encoding for the result, or an object that contains the encoding and an optional flag.
+     * If a flag is not provided, it defaults to `'r'`.
+     */
+    export function readFile(
+        path: PathOrFileDescriptor,
+        options:
+            | ({
+                  encoding: BufferEncoding;
+                  flag?: string | undefined;
+              } & Abortable)
+            | BufferEncoding,
+        callback: (err: NodeJS.ErrnoException | null, data: string) => void
+    ): void;
+    /**
+     * Asynchronously reads the entire contents of a file.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+     * @param options Either the encoding for the result, or an object that contains the encoding and an optional flag.
+     * If a flag is not provided, it defaults to `'r'`.
+     */
+    export function readFile(
+        path: PathOrFileDescriptor,
+        options:
+            | (ObjectEncodingOptions & {
+                  flag?: string | undefined;
+              } & Abortable)
+            | BufferEncoding
+            | undefined
+            | null,
+        callback: (err: NodeJS.ErrnoException | null, data: string | Buffer) => void
+    ): void;
+    /**
+     * Asynchronously reads the entire contents of a file.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+     */
+    export function readFile(path: PathOrFileDescriptor, callback: (err: NodeJS.ErrnoException | null, data: Buffer) => void): void;
+    export namespace readFile {
+        /**
+         * Asynchronously reads the entire contents of a file.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+         * @param options An object that may contain an optional flag.
+         * If a flag is not provided, it defaults to `'r'`.
+         */
+        function __promisify__(
+            path: PathOrFileDescriptor,
+            options?: {
+                encoding?: null | undefined;
+                flag?: string | undefined;
+            } | null
+        ): Promise<Buffer>;
+        /**
+         * Asynchronously reads the entire contents of a file.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+         * @param options Either the encoding for the result, or an object that contains the encoding and an optional flag.
+         * If a flag is not provided, it defaults to `'r'`.
+         */
+        function __promisify__(
+            path: PathOrFileDescriptor,
+            options:
+                | {
+                      encoding: BufferEncoding;
+                      flag?: string | undefined;
+                  }
+                | BufferEncoding
+        ): Promise<string>;
+        /**
+         * Asynchronously reads the entire contents of a file.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+         * @param options Either the encoding for the result, or an object that contains the encoding and an optional flag.
+         * If a flag is not provided, it defaults to `'r'`.
+         */
+        function __promisify__(
+            path: PathOrFileDescriptor,
+            options?:
+                | (ObjectEncodingOptions & {
+                      flag?: string | undefined;
+                  })
+                | BufferEncoding
+                | null
+        ): Promise<string | Buffer>;
+    }
+    /**
+     * Returns the contents of the `path`.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link readFile}.
+     *
+     * If the `encoding` option is specified then this function returns a
+     * string. Otherwise it returns a buffer.
+     *
+     * Similar to {@link readFile}, when the path is a directory, the behavior of`fs.readFileSync()` is platform-specific.
+     *
+     * ```js
+     * import { readFileSync } from 'fs';
+     *
+     * // macOS, Linux, and Windows
+     * readFileSync('<directory>');
+     * // => [Error: EISDIR: illegal operation on a directory, read <directory>]
+     *
+     * //  FreeBSD
+     * readFileSync('<directory>'); // => <data>
+     * ```
+     * @since v0.1.8
+     * @param path filename or file descriptor
+     */
+    export function readFileSync(
+        path: PathOrFileDescriptor,
+        options?: {
+            encoding?: null | undefined;
+            flag?: string | undefined;
+        } | null
+    ): Buffer;
+    /**
+     * Synchronously reads the entire contents of a file.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+     * @param options Either the encoding for the result, or an object that contains the encoding and an optional flag.
+     * If a flag is not provided, it defaults to `'r'`.
+     */
+    export function readFileSync(
+        path: PathOrFileDescriptor,
+        options:
+            | {
+                  encoding: BufferEncoding;
+                  flag?: string | undefined;
+              }
+            | BufferEncoding
+    ): string;
+    /**
+     * Synchronously reads the entire contents of a file.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+     * @param options Either the encoding for the result, or an object that contains the encoding and an optional flag.
+     * If a flag is not provided, it defaults to `'r'`.
+     */
+    export function readFileSync(
+        path: PathOrFileDescriptor,
+        options?:
+            | (ObjectEncodingOptions & {
+                  flag?: string | undefined;
+              })
+            | BufferEncoding
+            | null
+    ): string | Buffer;
+    export type WriteFileOptions =
+        | (ObjectEncodingOptions &
+              Abortable & {
+                  mode?: Mode | undefined;
+                  flag?: string | undefined;
+              })
+        | BufferEncoding
+        | null;
+    /**
+     * When `file` is a filename, asynchronously writes data to the file, replacing the
+     * file if it already exists. `data` can be a string or a buffer.
+     *
+     * When `file` is a file descriptor, the behavior is similar to calling`fs.write()` directly (which is recommended). See the notes below on using
+     * a file descriptor.
+     *
+     * The `encoding` option is ignored if `data` is a buffer.
+     *
+     * The `mode` option only affects the newly created file. See {@link open} for more details.
+     *
+     * If `data` is a plain object, it must have an own (not inherited) `toString`function property.
+     *
+     * ```js
+     * import { writeFile } from 'fs';
+     * import { Buffer } from 'buffer';
+     *
+     * const data = new Uint8Array(Buffer.from('Hello Node.js'));
+     * writeFile('message.txt', data, (err) => {
+     *   if (err) throw err;
+     *   console.log('The file has been saved!');
+     * });
+     * ```
+     *
+     * If `options` is a string, then it specifies the encoding:
+     *
+     * ```js
+     * import { writeFile } from 'fs';
+     *
+     * writeFile('message.txt', 'Hello Node.js', 'utf8', callback);
+     * ```
+     *
+     * It is unsafe to use `fs.writeFile()` multiple times on the same file without
+     * waiting for the callback. For this scenario, {@link createWriteStream} is
+     * recommended.
+     *
+     * Similarly to `fs.readFile` \- `fs.writeFile` is a convenience method that
+     * performs multiple `write` calls internally to write the buffer passed to it.
+     * For performance sensitive code consider using {@link createWriteStream}.
+     *
+     * It is possible to use an `AbortSignal` to cancel an `fs.writeFile()`.
+     * Cancelation is "best effort", and some amount of data is likely still
+     * to be written.
+     *
+     * ```js
+     * import { writeFile } from 'fs';
+     * import { Buffer } from 'buffer';
+     *
+     * const controller = new AbortController();
+     * const { signal } = controller;
+     * const data = new Uint8Array(Buffer.from('Hello Node.js'));
+     * writeFile('message.txt', data, { signal }, (err) => {
+     *   // When a request is aborted - the callback is called with an AbortError
+     * });
+     * // When the request should be aborted
+     * controller.abort();
+     * ```
+     *
+     * Aborting an ongoing request does not abort individual operating
+     * system requests but rather the internal buffering `fs.writeFile` performs.
+     * @since v0.1.29
+     * @param file filename or file descriptor
+     */
+    export function writeFile(file: PathOrFileDescriptor, data: string | NodeJS.ArrayBufferView, options: WriteFileOptions, callback: NoParamCallback): void;
+    /**
+     * Asynchronously writes data to a file, replacing the file if it already exists.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+     * @param data The data to write. If something other than a Buffer or Uint8Array is provided, the value is coerced to a string.
+     */
+    export function writeFile(path: PathOrFileDescriptor, data: string | NodeJS.ArrayBufferView, callback: NoParamCallback): void;
+    export namespace writeFile {
+        /**
+         * Asynchronously writes data to a file, replacing the file if it already exists.
+         * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+         * @param data The data to write. If something other than a Buffer or Uint8Array is provided, the value is coerced to a string.
+         * @param options Either the encoding for the file, or an object optionally specifying the encoding, file mode, and flag.
+         * If `encoding` is not supplied, the default of `'utf8'` is used.
+         * If `mode` is not supplied, the default of `0o666` is used.
+         * If `mode` is a string, it is parsed as an octal integer.
+         * If `flag` is not supplied, the default of `'w'` is used.
+         */
+        function __promisify__(path: PathOrFileDescriptor, data: string | NodeJS.ArrayBufferView, options?: WriteFileOptions): Promise<void>;
+    }
+    /**
+     * Returns `undefined`.
+     *
+     * If `data` is a plain object, it must have an own (not inherited) `toString`function property.
+     *
+     * The `mode` option only affects the newly created file. See {@link open} for more details.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link writeFile}.
+     * @since v0.1.29
+     * @param file filename or file descriptor
+     */
+    export function writeFileSync(file: PathOrFileDescriptor, data: string | NodeJS.ArrayBufferView, options?: WriteFileOptions): void;
+    /**
+     * Asynchronously append data to a file, creating the file if it does not yet
+     * exist. `data` can be a string or a `Buffer`.
+     *
+     * The `mode` option only affects the newly created file. See {@link open} for more details.
+     *
+     * ```js
+     * import { appendFile } from 'fs';
+     *
+     * appendFile('message.txt', 'data to append', (err) => {
+     *   if (err) throw err;
+     *   console.log('The "data to append" was appended to file!');
+     * });
+     * ```
+     *
+     * If `options` is a string, then it specifies the encoding:
+     *
+     * ```js
+     * import { appendFile } from 'fs';
+     *
+     * appendFile('message.txt', 'data to append', 'utf8', callback);
+     * ```
+     *
+     * The `path` may be specified as a numeric file descriptor that has been opened
+     * for appending (using `fs.open()` or `fs.openSync()`). The file descriptor will
+     * not be closed automatically.
+     *
+     * ```js
+     * import { open, close, appendFile } from 'fs';
+     *
+     * function closeFd(fd) {
+     *   close(fd, (err) => {
+     *     if (err) throw err;
+     *   });
+     * }
+     *
+     * open('message.txt', 'a', (err, fd) => {
+     *   if (err) throw err;
+     *
+     *   try {
+     *     appendFile(fd, 'data to append', 'utf8', (err) => {
+     *       closeFd(fd);
+     *       if (err) throw err;
+     *     });
+     *   } catch (err) {
+     *     closeFd(fd);
+     *     throw err;
+     *   }
+     * });
+     * ```
+     * @since v0.6.7
+     * @param path filename or file descriptor
+     */
+    export function appendFile(path: PathOrFileDescriptor, data: string | Uint8Array, options: WriteFileOptions, callback: NoParamCallback): void;
+    /**
+     * Asynchronously append data to a file, creating the file if it does not exist.
+     * @param file A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+     * @param data The data to write. If something other than a Buffer or Uint8Array is provided, the value is coerced to a string.
+     */
+    export function appendFile(file: PathOrFileDescriptor, data: string | Uint8Array, callback: NoParamCallback): void;
+    export namespace appendFile {
+        /**
+         * Asynchronously append data to a file, creating the file if it does not exist.
+         * @param file A path to a file. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         * If a file descriptor is provided, the underlying file will _not_ be closed automatically.
+         * @param data The data to write. If something other than a Buffer or Uint8Array is provided, the value is coerced to a string.
+         * @param options Either the encoding for the file, or an object optionally specifying the encoding, file mode, and flag.
+         * If `encoding` is not supplied, the default of `'utf8'` is used.
+         * If `mode` is not supplied, the default of `0o666` is used.
+         * If `mode` is a string, it is parsed as an octal integer.
+         * If `flag` is not supplied, the default of `'a'` is used.
+         */
+        function __promisify__(file: PathOrFileDescriptor, data: string | Uint8Array, options?: WriteFileOptions): Promise<void>;
+    }
+    /**
+     * Synchronously append data to a file, creating the file if it does not yet
+     * exist. `data` can be a string or a `Buffer`.
+     *
+     * The `mode` option only affects the newly created file. See {@link open} for more details.
+     *
+     * ```js
+     * import { appendFileSync } from 'fs';
+     *
+     * try {
+     *   appendFileSync('message.txt', 'data to append');
+     *   console.log('The "data to append" was appended to file!');
+     * } catch (err) {
+     *   // Handle the error
+     * }
+     * ```
+     *
+     * If `options` is a string, then it specifies the encoding:
+     *
+     * ```js
+     * import { appendFileSync } from 'fs';
+     *
+     * appendFileSync('message.txt', 'data to append', 'utf8');
+     * ```
+     *
+     * The `path` may be specified as a numeric file descriptor that has been opened
+     * for appending (using `fs.open()` or `fs.openSync()`). The file descriptor will
+     * not be closed automatically.
+     *
+     * ```js
+     * import { openSync, closeSync, appendFileSync } from 'fs';
+     *
+     * let fd;
+     *
+     * try {
+     *   fd = openSync('message.txt', 'a');
+     *   appendFileSync(fd, 'data to append', 'utf8');
+     * } catch (err) {
+     *   // Handle the error
+     * } finally {
+     *   if (fd !== undefined)
+     *     closeSync(fd);
+     * }
+     * ```
+     * @since v0.6.7
+     * @param path filename or file descriptor
+     */
+    export function appendFileSync(path: PathOrFileDescriptor, data: string | Uint8Array, options?: WriteFileOptions): void;
+    /**
+     * Watch for changes on `filename`. The callback `listener` will be called each
+     * time the file is accessed.
+     *
+     * The `options` argument may be omitted. If provided, it should be an object. The`options` object may contain a boolean named `persistent` that indicates
+     * whether the process should continue to run as long as files are being watched.
+     * The `options` object may specify an `interval` property indicating how often the
+     * target should be polled in milliseconds.
+     *
+     * The `listener` gets two arguments the current stat object and the previous
+     * stat object:
+     *
+     * ```js
+     * import { watchFile } from 'fs';
+     *
+     * watchFile('message.text', (curr, prev) => {
+     *   console.log(`the current mtime is: ${curr.mtime}`);
+     *   console.log(`the previous mtime was: ${prev.mtime}`);
+     * });
+     * ```
+     *
+     * These stat objects are instances of `fs.Stat`. If the `bigint` option is `true`,
+     * the numeric values in these objects are specified as `BigInt`s.
+     *
+     * To be notified when the file was modified, not just accessed, it is necessary
+     * to compare `curr.mtimeMs` and `prev.mtimeMs`.
+     *
+     * When an `fs.watchFile` operation results in an `ENOENT` error, it
+     * will invoke the listener once, with all the fields zeroed (or, for dates, the
+     * Unix Epoch). If the file is created later on, the listener will be called
+     * again, with the latest stat objects. This is a change in functionality since
+     * v0.10.
+     *
+     * Using {@link watch} is more efficient than `fs.watchFile` and`fs.unwatchFile`. `fs.watch` should be used instead of `fs.watchFile` and`fs.unwatchFile` when possible.
+     *
+     * When a file being watched by `fs.watchFile()` disappears and reappears,
+     * then the contents of `previous` in the second callback event (the file's
+     * reappearance) will be the same as the contents of `previous` in the first
+     * callback event (its disappearance).
+     *
+     * This happens when:
+     *
+     * * the file is deleted, followed by a restore
+     * * the file is renamed and then renamed a second time back to its original name
+     * @since v0.1.31
+     */
+    export interface WatchFileOptions {
+        bigint?: boolean | undefined;
+        persistent?: boolean | undefined;
+        interval?: number | undefined;
+    }
+    /**
+     * Watch for changes on `filename`. The callback `listener` will be called each
+     * time the file is accessed.
+     *
+     * The `options` argument may be omitted. If provided, it should be an object. The`options` object may contain a boolean named `persistent` that indicates
+     * whether the process should continue to run as long as files are being watched.
+     * The `options` object may specify an `interval` property indicating how often the
+     * target should be polled in milliseconds.
+     *
+     * The `listener` gets two arguments the current stat object and the previous
+     * stat object:
+     *
+     * ```js
+     * import { watchFile } from 'fs';
+     *
+     * watchFile('message.text', (curr, prev) => {
+     *   console.log(`the current mtime is: ${curr.mtime}`);
+     *   console.log(`the previous mtime was: ${prev.mtime}`);
+     * });
+     * ```
+     *
+     * These stat objects are instances of `fs.Stat`. If the `bigint` option is `true`,
+     * the numeric values in these objects are specified as `BigInt`s.
+     *
+     * To be notified when the file was modified, not just accessed, it is necessary
+     * to compare `curr.mtimeMs` and `prev.mtimeMs`.
+     *
+     * When an `fs.watchFile` operation results in an `ENOENT` error, it
+     * will invoke the listener once, with all the fields zeroed (or, for dates, the
+     * Unix Epoch). If the file is created later on, the listener will be called
+     * again, with the latest stat objects. This is a change in functionality since
+     * v0.10.
+     *
+     * Using {@link watch} is more efficient than `fs.watchFile` and`fs.unwatchFile`. `fs.watch` should be used instead of `fs.watchFile` and`fs.unwatchFile` when possible.
+     *
+     * When a file being watched by `fs.watchFile()` disappears and reappears,
+     * then the contents of `previous` in the second callback event (the file's
+     * reappearance) will be the same as the contents of `previous` in the first
+     * callback event (its disappearance).
+     *
+     * This happens when:
+     *
+     * * the file is deleted, followed by a restore
+     * * the file is renamed and then renamed a second time back to its original name
+     * @since v0.1.31
+     */
+    export function watchFile(
+        filename: PathLike,
+        options:
+            | (WatchFileOptions & {
+                  bigint?: false | undefined;
+              })
+            | undefined,
+        listener: (curr: Stats, prev: Stats) => void
+    ): StatWatcher;
+    export function watchFile(
+        filename: PathLike,
+        options:
+            | (WatchFileOptions & {
+                  bigint: true;
+              })
+            | undefined,
+        listener: (curr: BigIntStats, prev: BigIntStats) => void
+    ): StatWatcher;
+    /**
+     * Watch for changes on `filename`. The callback `listener` will be called each time the file is accessed.
+     * @param filename A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function watchFile(filename: PathLike, listener: (curr: Stats, prev: Stats) => void): StatWatcher;
+    /**
+     * Stop watching for changes on `filename`. If `listener` is specified, only that
+     * particular listener is removed. Otherwise, _all_ listeners are removed,
+     * effectively stopping watching of `filename`.
+     *
+     * Calling `fs.unwatchFile()` with a filename that is not being watched is a
+     * no-op, not an error.
+     *
+     * Using {@link watch} is more efficient than `fs.watchFile()` and`fs.unwatchFile()`. `fs.watch()` should be used instead of `fs.watchFile()`and `fs.unwatchFile()` when possible.
+     * @since v0.1.31
+     * @param listener Optional, a listener previously attached using `fs.watchFile()`
+     */
+    export function unwatchFile(filename: PathLike, listener?: (curr: Stats, prev: Stats) => void): void;
+    export interface WatchOptions extends Abortable {
+        encoding?: BufferEncoding | 'buffer' | undefined;
+        persistent?: boolean | undefined;
+        recursive?: boolean | undefined;
+    }
+    export type WatchEventType = 'rename' | 'change';
+    export type WatchListener<T> = (event: WatchEventType, filename: T) => void;
+    /**
+     * Watch for changes on `filename`, where `filename` is either a file or a
+     * directory.
+     *
+     * The second argument is optional. If `options` is provided as a string, it
+     * specifies the `encoding`. Otherwise `options` should be passed as an object.
+     *
+     * The listener callback gets two arguments `(eventType, filename)`. `eventType`is either `'rename'` or `'change'`, and `filename` is the name of the file
+     * which triggered the event.
+     *
+     * On most platforms, `'rename'` is emitted whenever a filename appears or
+     * disappears in the directory.
+     *
+     * The listener callback is attached to the `'change'` event fired by `fs.FSWatcher`, but it is not the same thing as the `'change'` value of`eventType`.
+     *
+     * If a `signal` is passed, aborting the corresponding AbortController will close
+     * the returned `fs.FSWatcher`.
+     * @since v0.5.10
+     * @param listener
+     */
+    export function watch(
+        filename: PathLike,
+        options:
+            | (WatchOptions & {
+                  encoding: 'buffer';
+              })
+            | 'buffer',
+        listener?: WatchListener<Buffer>
+    ): FSWatcher;
+    /**
+     * Watch for changes on `filename`, where `filename` is either a file or a directory, returning an `FSWatcher`.
+     * @param filename A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the encoding for the filename provided to the listener, or an object optionally specifying encoding, persistent, and recursive options.
+     * If `encoding` is not supplied, the default of `'utf8'` is used.
+     * If `persistent` is not supplied, the default of `true` is used.
+     * If `recursive` is not supplied, the default of `false` is used.
+     */
+    export function watch(filename: PathLike, options?: WatchOptions | BufferEncoding | null, listener?: WatchListener<string>): FSWatcher;
+    /**
+     * Watch for changes on `filename`, where `filename` is either a file or a directory, returning an `FSWatcher`.
+     * @param filename A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the encoding for the filename provided to the listener, or an object optionally specifying encoding, persistent, and recursive options.
+     * If `encoding` is not supplied, the default of `'utf8'` is used.
+     * If `persistent` is not supplied, the default of `true` is used.
+     * If `recursive` is not supplied, the default of `false` is used.
+     */
+    export function watch(filename: PathLike, options: WatchOptions | string, listener?: WatchListener<string | Buffer>): FSWatcher;
+    /**
+     * Watch for changes on `filename`, where `filename` is either a file or a directory, returning an `FSWatcher`.
+     * @param filename A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function watch(filename: PathLike, listener?: WatchListener<string>): FSWatcher;
+    /**
+     * Test whether or not the given path exists by checking with the file system.
+     * Then call the `callback` argument with either true or false:
+     *
+     * ```js
+     * import { exists } from 'fs';
+     *
+     * exists('/etc/passwd', (e) => {
+     *   console.log(e ? 'it exists' : 'no passwd!');
+     * });
+     * ```
+     *
+     * **The parameters for this callback are not consistent with other Node.js**
+     * **callbacks.** Normally, the first parameter to a Node.js callback is an `err`parameter, optionally followed by other parameters. The `fs.exists()` callback
+     * has only one boolean parameter. This is one reason `fs.access()` is recommended
+     * instead of `fs.exists()`.
+     *
+     * Using `fs.exists()` to check for the existence of a file before calling`fs.open()`, `fs.readFile()` or `fs.writeFile()` is not recommended. Doing
+     * so introduces a race condition, since other processes may change the file's
+     * state between the two calls. Instead, user code should open/read/write the
+     * file directly and handle the error raised if the file does not exist.
+     *
+     * **write (NOT RECOMMENDED)**
+     *
+     * ```js
+     * import { exists, open, close } from 'fs';
+     *
+     * exists('myfile', (e) => {
+     *   if (e) {
+     *     console.error('myfile already exists');
+     *   } else {
+     *     open('myfile', 'wx', (err, fd) => {
+     *       if (err) throw err;
+     *
+     *       try {
+     *         writeMyData(fd);
+     *       } finally {
+     *         close(fd, (err) => {
+     *           if (err) throw err;
+     *         });
+     *       }
+     *     });
+     *   }
+     * });
+     * ```
+     *
+     * **write (RECOMMENDED)**
+     *
+     * ```js
+     * import { open, close } from 'fs';
+     * open('myfile', 'wx', (err, fd) => {
+     *   if (err) {
+     *     if (err.code === 'EEXIST') {
+     *       console.error('myfile already exists');
+     *       return;
+     *     }
+     *
+     *     throw err;
+     *   }
+     *
+     *   try {
+     *     writeMyData(fd);
+     *   } finally {
+     *     close(fd, (err) => {
+     *       if (err) throw err;
+     *     });
+     *   }
+     * });
+     * ```
+     *
+     * **read (NOT RECOMMENDED)**
+     *
+     * ```js
+     * import { open, close, exists } from 'fs';
+     *
+     * exists('myfile', (e) => {
+     *   if (e) {
+     *     open('myfile', 'r', (err, fd) => {
+     *       if (err) throw err;
+     *
+     *       try {
+     *         readMyData(fd);
+     *       } finally {
+     *         close(fd, (err) => {
+     *           if (err) throw err;
+     *         });
+     *       }
+     *     });
+     *   } else {
+     *     console.error('myfile does not exist');
+     *   }
+     * });
+     * ```
+     *
+     * **read (RECOMMENDED)**
+     *
+     * ```js
+     * import { open, close } from 'fs';
+     *
+     * open('myfile', 'r', (err, fd) => {
+     *   if (err) {
+     *     if (err.code === 'ENOENT') {
+     *       console.error('myfile does not exist');
+     *       return;
+     *     }
+     *
+     *     throw err;
+     *   }
+     *
+     *   try {
+     *     readMyData(fd);
+     *   } finally {
+     *     close(fd, (err) => {
+     *       if (err) throw err;
+     *     });
+     *   }
+     * });
+     * ```
+     *
+     * The "not recommended" examples above check for existence and then use the
+     * file; the "recommended" examples are better because they use the file directly
+     * and handle the error, if any.
+     *
+     * In general, check for the existence of a file only if the file won’t be
+     * used directly, for example when its existence is a signal from another
+     * process.
+     * @since v0.0.2
+     * @deprecated Since v1.0.0 - Use {@link stat} or {@link access} instead.
+     */
+    export function exists(path: PathLike, callback: (exists: boolean) => void): void;
+    /** @deprecated */
+    export namespace exists {
+        /**
+         * @param path A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         */
+        function __promisify__(path: PathLike): Promise<boolean>;
+    }
+    /**
+     * Returns `true` if the path exists, `false` otherwise.
+     *
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link exists}.
+     *
+     * `fs.exists()` is deprecated, but `fs.existsSync()` is not. The `callback`parameter to `fs.exists()` accepts parameters that are inconsistent with other
+     * Node.js callbacks. `fs.existsSync()` does not use a callback.
+     *
+     * ```js
+     * import { existsSync } from 'fs';
+     *
+     * if (existsSync('/etc/passwd'))
+     *   console.log('The path exists.');
+     * ```
+     * @since v0.1.21
+     */
+    export function existsSync(path: PathLike): boolean;
+    export namespace constants {
+        // File Access Constants
+        /** Constant for fs.access(). File is visible to the calling process. */
+        const F_OK: number;
+        /** Constant for fs.access(). File can be read by the calling process. */
+        const R_OK: number;
+        /** Constant for fs.access(). File can be written by the calling process. */
+        const W_OK: number;
+        /** Constant for fs.access(). File can be executed by the calling process. */
+        const X_OK: number;
+        // File Copy Constants
+        /** Constant for fs.copyFile. Flag indicating the destination file should not be overwritten if it already exists. */
+        const COPYFILE_EXCL: number;
+        /**
+         * Constant for fs.copyFile. copy operation will attempt to create a copy-on-write reflink.
+         * If the underlying platform does not support copy-on-write, then a fallback copy mechanism is used.
+         */
+        const COPYFILE_FICLONE: number;
+        /**
+         * Constant for fs.copyFile. Copy operation will attempt to create a copy-on-write reflink.
+         * If the underlying platform does not support copy-on-write, then the operation will fail with an error.
+         */
+        const COPYFILE_FICLONE_FORCE: number;
+        // File Open Constants
+        /** Constant for fs.open(). Flag indicating to open a file for read-only access. */
+        const O_RDONLY: number;
+        /** Constant for fs.open(). Flag indicating to open a file for write-only access. */
+        const O_WRONLY: number;
+        /** Constant for fs.open(). Flag indicating to open a file for read-write access. */
+        const O_RDWR: number;
+        /** Constant for fs.open(). Flag indicating to create the file if it does not already exist. */
+        const O_CREAT: number;
+        /** Constant for fs.open(). Flag indicating that opening a file should fail if the O_CREAT flag is set and the file already exists. */
+        const O_EXCL: number;
+        /**
+         * Constant for fs.open(). Flag indicating that if path identifies a terminal device,
+         * opening the path shall not cause that terminal to become the controlling terminal for the process
+         * (if the process does not already have one).
+         */
+        const O_NOCTTY: number;
+        /** Constant for fs.open(). Flag indicating that if the file exists and is a regular file, and the file is opened successfully for write access, its length shall be truncated to zero. */
+        const O_TRUNC: number;
+        /** Constant for fs.open(). Flag indicating that data will be appended to the end of the file. */
+        const O_APPEND: number;
+        /** Constant for fs.open(). Flag indicating that the open should fail if the path is not a directory. */
+        const O_DIRECTORY: number;
+        /**
+         * constant for fs.open().
+         * Flag indicating reading accesses to the file system will no longer result in
+         * an update to the atime information associated with the file.
+         * This flag is available on Linux operating systems only.
+         */
+        const O_NOATIME: number;
+        /** Constant for fs.open(). Flag indicating that the open should fail if the path is a symbolic link. */
+        const O_NOFOLLOW: number;
+        /** Constant for fs.open(). Flag indicating that the file is opened for synchronous I/O. */
+        const O_SYNC: number;
+        /** Constant for fs.open(). Flag indicating that the file is opened for synchronous I/O with write operations waiting for data integrity. */
+        const O_DSYNC: number;
+        /** Constant for fs.open(). Flag indicating to open the symbolic link itself rather than the resource it is pointing to. */
+        const O_SYMLINK: number;
+        /** Constant for fs.open(). When set, an attempt will be made to minimize caching effects of file I/O. */
+        const O_DIRECT: number;
+        /** Constant for fs.open(). Flag indicating to open the file in nonblocking mode when possible. */
+        const O_NONBLOCK: number;
+        // File Type Constants
+        /** Constant for fs.Stats mode property for determining a file's type. Bit mask used to extract the file type code. */
+        const S_IFMT: number;
+        /** Constant for fs.Stats mode property for determining a file's type. File type constant for a regular file. */
+        const S_IFREG: number;
+        /** Constant for fs.Stats mode property for determining a file's type. File type constant for a directory. */
+        const S_IFDIR: number;
+        /** Constant for fs.Stats mode property for determining a file's type. File type constant for a character-oriented device file. */
+        const S_IFCHR: number;
+        /** Constant for fs.Stats mode property for determining a file's type. File type constant for a block-oriented device file. */
+        const S_IFBLK: number;
+        /** Constant for fs.Stats mode property for determining a file's type. File type constant for a FIFO/pipe. */
+        const S_IFIFO: number;
+        /** Constant for fs.Stats mode property for determining a file's type. File type constant for a symbolic link. */
+        const S_IFLNK: number;
+        /** Constant for fs.Stats mode property for determining a file's type. File type constant for a socket. */
+        const S_IFSOCK: number;
+        // File Mode Constants
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating readable, writable and executable by owner. */
+        const S_IRWXU: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating readable by owner. */
+        const S_IRUSR: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating writable by owner. */
+        const S_IWUSR: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating executable by owner. */
+        const S_IXUSR: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating readable, writable and executable by group. */
+        const S_IRWXG: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating readable by group. */
+        const S_IRGRP: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating writable by group. */
+        const S_IWGRP: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating executable by group. */
+        const S_IXGRP: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating readable, writable and executable by others. */
+        const S_IRWXO: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating readable by others. */
+        const S_IROTH: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating writable by others. */
+        const S_IWOTH: number;
+        /** Constant for fs.Stats mode property for determining access permissions for a file. File mode indicating executable by others. */
+        const S_IXOTH: number;
+        /**
+         * When set, a memory file mapping is used to access the file. This flag
+         * is available on Windows operating systems only. On other operating systems,
+         * this flag is ignored.
+         */
+        const UV_FS_O_FILEMAP: number;
+    }
+    /**
+     * Tests a user's permissions for the file or directory specified by `path`.
+     * The `mode` argument is an optional integer that specifies the accessibility
+     * checks to be performed. Check `File access constants` for possible values
+     * of `mode`. It is possible to create a mask consisting of the bitwise OR of
+     * two or more values (e.g. `fs.constants.W_OK | fs.constants.R_OK`).
+     *
+     * The final argument, `callback`, is a callback function that is invoked with
+     * a possible error argument. If any of the accessibility checks fail, the error
+     * argument will be an `Error` object. The following examples check if`package.json` exists, and if it is readable or writable.
+     *
+     * ```js
+     * import { access, constants } from 'fs';
+     *
+     * const file = 'package.json';
+     *
+     * // Check if the file exists in the current directory.
+     * access(file, constants.F_OK, (err) => {
+     *   console.log(`${file} ${err ? 'does not exist' : 'exists'}`);
+     * });
+     *
+     * // Check if the file is readable.
+     * access(file, constants.R_OK, (err) => {
+     *   console.log(`${file} ${err ? 'is not readable' : 'is readable'}`);
+     * });
+     *
+     * // Check if the file is writable.
+     * access(file, constants.W_OK, (err) => {
+     *   console.log(`${file} ${err ? 'is not writable' : 'is writable'}`);
+     * });
+     *
+     * // Check if the file exists in the current directory, and if it is writable.
+     * access(file, constants.F_OK | constants.W_OK, (err) => {
+     *   if (err) {
+     *     console.error(
+     *       `${file} ${err.code === 'ENOENT' ? 'does not exist' : 'is read-only'}`);
+     *   } else {
+     *     console.log(`${file} exists, and it is writable`);
+     *   }
+     * });
+     * ```
+     *
+     * Do not use `fs.access()` to check for the accessibility of a file before calling`fs.open()`, `fs.readFile()` or `fs.writeFile()`. Doing
+     * so introduces a race condition, since other processes may change the file's
+     * state between the two calls. Instead, user code should open/read/write the
+     * file directly and handle the error raised if the file is not accessible.
+     *
+     * **write (NOT RECOMMENDED)**
+     *
+     * ```js
+     * import { access, open, close } from 'fs';
+     *
+     * access('myfile', (err) => {
+     *   if (!err) {
+     *     console.error('myfile already exists');
+     *     return;
+     *   }
+     *
+     *   open('myfile', 'wx', (err, fd) => {
+     *     if (err) throw err;
+     *
+     *     try {
+     *       writeMyData(fd);
+     *     } finally {
+     *       close(fd, (err) => {
+     *         if (err) throw err;
+     *       });
+     *     }
+     *   });
+     * });
+     * ```
+     *
+     * **write (RECOMMENDED)**
+     *
+     * ```js
+     * import { open, close } from 'fs';
+     *
+     * open('myfile', 'wx', (err, fd) => {
+     *   if (err) {
+     *     if (err.code === 'EEXIST') {
+     *       console.error('myfile already exists');
+     *       return;
+     *     }
+     *
+     *     throw err;
+     *   }
+     *
+     *   try {
+     *     writeMyData(fd);
+     *   } finally {
+     *     close(fd, (err) => {
+     *       if (err) throw err;
+     *     });
+     *   }
+     * });
+     * ```
+     *
+     * **read (NOT RECOMMENDED)**
+     *
+     * ```js
+     * import { access, open, close } from 'fs';
+     * access('myfile', (err) => {
+     *   if (err) {
+     *     if (err.code === 'ENOENT') {
+     *       console.error('myfile does not exist');
+     *       return;
+     *     }
+     *
+     *     throw err;
+     *   }
+     *
+     *   open('myfile', 'r', (err, fd) => {
+     *     if (err) throw err;
+     *
+     *     try {
+     *       readMyData(fd);
+     *     } finally {
+     *       close(fd, (err) => {
+     *         if (err) throw err;
+     *       });
+     *     }
+     *   });
+     * });
+     * ```
+     *
+     * **read (RECOMMENDED)**
+     *
+     * ```js
+     * import { open, close } from 'fs';
+     *
+     * open('myfile', 'r', (err, fd) => {
+     *   if (err) {
+     *     if (err.code === 'ENOENT') {
+     *       console.error('myfile does not exist');
+     *       return;
+     *     }
+     *
+     *     throw err;
+     *   }
+     *
+     *   try {
+     *     readMyData(fd);
+     *   } finally {
+     *     close(fd, (err) => {
+     *       if (err) throw err;
+     *     });
+     *   }
+     * });
+     * ```
+     *
+     * The "not recommended" examples above check for accessibility and then use the
+     * file; the "recommended" examples are better because they use the file directly
+     * and handle the error, if any.
+     *
+     * In general, check for the accessibility of a file only if the file will not be
+     * used directly, for example when its accessibility is a signal from another
+     * process.
+     *
+     * On Windows, access-control policies (ACLs) on a directory may limit access to
+     * a file or directory. The `fs.access()` function, however, does not check the
+     * ACL and therefore may report that a path is accessible even if the ACL restricts
+     * the user from reading or writing to it.
+     * @since v0.11.15
+     * @param [mode=fs.constants.F_OK]
+     */
+    export function access(path: PathLike, mode: number | undefined, callback: NoParamCallback): void;
+    /**
+     * Asynchronously tests a user's permissions for the file specified by path.
+     * @param path A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+     */
+    export function access(path: PathLike, callback: NoParamCallback): void;
+    export namespace access {
+        /**
+         * Asynchronously tests a user's permissions for the file specified by path.
+         * @param path A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+         * URL support is _experimental_.
+         */
+        function __promisify__(path: PathLike, mode?: number): Promise<void>;
+    }
+    /**
+     * Synchronously tests a user's permissions for the file or directory specified
+     * by `path`. The `mode` argument is an optional integer that specifies the
+     * accessibility checks to be performed. Check `File access constants` for
+     * possible values of `mode`. It is possible to create a mask consisting of
+     * the bitwise OR of two or more values
+     * (e.g. `fs.constants.W_OK | fs.constants.R_OK`).
+     *
+     * If any of the accessibility checks fail, an `Error` will be thrown. Otherwise,
+     * the method will return `undefined`.
+     *
+     * ```js
+     * import { accessSync, constants } from 'fs';
+     *
+     * try {
+     *   accessSync('etc/passwd', constants.R_OK | constants.W_OK);
+     *   console.log('can read/write');
+     * } catch (err) {
+     *   console.error('no access!');
+     * }
+     * ```
+     * @since v0.11.15
+     * @param [mode=fs.constants.F_OK]
+     */
+    export function accessSync(path: PathLike, mode?: number): void;
+    interface StreamOptions {
+        flags?: string | undefined;
+        encoding?: BufferEncoding | undefined;
+        fd?: number | promises.FileHandle | undefined;
+        mode?: number | undefined;
+        autoClose?: boolean | undefined;
+        /**
+         * @default false
+         */
+        emitClose?: boolean | undefined;
+        start?: number | undefined;
+        highWaterMark?: number | undefined;
+    }
+    interface ReadStreamOptions extends StreamOptions {
+        end?: number | undefined;
+    }
+    /**
+     * Unlike the 16 kb default `highWaterMark` for a `stream.Readable`, the stream
+     * returned by this method has a default `highWaterMark` of 64 kb.
+     *
+     * `options` can include `start` and `end` values to read a range of bytes from
+     * the file instead of the entire file. Both `start` and `end` are inclusive and
+     * start counting at 0, allowed values are in the
+     * \[0, [`Number.MAX_SAFE_INTEGER`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/MAX_SAFE_INTEGER)\] range. If `fd` is specified and `start` is
+     * omitted or `undefined`, `fs.createReadStream()` reads sequentially from the
+     * current file position. The `encoding` can be any one of those accepted by `Buffer`.
+     *
+     * If `fd` is specified, `ReadStream` will ignore the `path` argument and will use
+     * the specified file descriptor. This means that no `'open'` event will be
+     * emitted. `fd` should be blocking; non-blocking `fd`s should be passed to `net.Socket`.
+     *
+     * If `fd` points to a character device that only supports blocking reads
+     * (such as keyboard or sound card), read operations do not finish until data is
+     * available. This can prevent the process from exiting and the stream from
+     * closing naturally.
+     *
+     * By default, the stream will emit a `'close'` event after it has been
+     * destroyed.  Set the `emitClose` option to `false` to change this behavior.
+     *
+     * By providing the `fs` option, it is possible to override the corresponding `fs`implementations for `open`, `read`, and `close`. When providing the `fs` option,
+     * an override for `read` is required. If no `fd` is provided, an override for`open` is also required. If `autoClose` is `true`, an override for `close` is
+     * also required.
+     *
+     * ```js
+     * import { createReadStream } from 'fs';
+     *
+     * // Create a stream from some character device.
+     * const stream = createReadStream('/dev/input/event0');
+     * setTimeout(() => {
+     *   stream.close(); // This may not close the stream.
+     *   // Artificially marking end-of-stream, as if the underlying resource had
+     *   // indicated end-of-file by itself, allows the stream to close.
+     *   // This does not cancel pending read operations, and if there is such an
+     *   // operation, the process may still not be able to exit successfully
+     *   // until it finishes.
+     *   stream.push(null);
+     *   stream.read(0);
+     * }, 100);
+     * ```
+     *
+     * If `autoClose` is false, then the file descriptor won't be closed, even if
+     * there's an error. It is the application's responsibility to close it and make
+     * sure there's no file descriptor leak. If `autoClose` is set to true (default
+     * behavior), on `'error'` or `'end'` the file descriptor will be closed
+     * automatically.
+     *
+     * `mode` sets the file mode (permission and sticky bits), but only if the
+     * file was created.
+     *
+     * An example to read the last 10 bytes of a file which is 100 bytes long:
+     *
+     * ```js
+     * import { createReadStream } from 'fs';
+     *
+     * createReadStream('sample.txt', { start: 90, end: 99 });
+     * ```
+     *
+     * If `options` is a string, then it specifies the encoding.
+     * @since v0.1.31
+     */
+    export function createReadStream(path: PathLike, options?: BufferEncoding | ReadStreamOptions): ReadStream;
+    /**
+     * `options` may also include a `start` option to allow writing data at some
+     * position past the beginning of the file, allowed values are in the
+     * \[0, [`Number.MAX_SAFE_INTEGER`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/MAX_SAFE_INTEGER)\] range. Modifying a file rather than replacing
+     * it may require the `flags` option to be set to `r+` rather than the default `w`.
+     * The `encoding` can be any one of those accepted by `Buffer`.
+     *
+     * If `autoClose` is set to true (default behavior) on `'error'` or `'finish'`the file descriptor will be closed automatically. If `autoClose` is false,
+     * then the file descriptor won't be closed, even if there's an error.
+     * It is the application's responsibility to close it and make sure there's no
+     * file descriptor leak.
+     *
+     * By default, the stream will emit a `'close'` event after it has been
+     * destroyed.  Set the `emitClose` option to `false` to change this behavior.
+     *
+     * By providing the `fs` option it is possible to override the corresponding `fs`implementations for `open`, `write`, `writev` and `close`. Overriding `write()`without `writev()` can reduce
+     * performance as some optimizations (`_writev()`)
+     * will be disabled. When providing the `fs` option, overrides for at least one of`write` and `writev` are required. If no `fd` option is supplied, an override
+     * for `open` is also required. If `autoClose` is `true`, an override for `close`is also required.
+     *
+     * Like `fs.ReadStream`, if `fd` is specified, `fs.WriteStream` will ignore the`path` argument and will use the specified file descriptor. This means that no`'open'` event will be
+     * emitted. `fd` should be blocking; non-blocking `fd`s
+     * should be passed to `net.Socket`.
+     *
+     * If `options` is a string, then it specifies the encoding.
+     * @since v0.1.31
+     */
+    export function createWriteStream(path: PathLike, options?: BufferEncoding | StreamOptions): WriteStream;
+    /**
+     * Forces all currently queued I/O operations associated with the file to the
+     * operating system's synchronized I/O completion state. Refer to the POSIX [`fdatasync(2)`](http://man7.org/linux/man-pages/man2/fdatasync.2.html) documentation for details. No arguments other
+     * than a possible
+     * exception are given to the completion callback.
+     * @since v0.1.96
+     */
+    export function fdatasync(fd: number, callback: NoParamCallback): void;
+    export namespace fdatasync {
+        /**
+         * Asynchronous fdatasync(2) - synchronize a file's in-core state with storage device.
+         * @param fd A file descriptor.
+         */
+        function __promisify__(fd: number): Promise<void>;
+    }
+    /**
+     * Forces all currently queued I/O operations associated with the file to the
+     * operating system's synchronized I/O completion state. Refer to the POSIX [`fdatasync(2)`](http://man7.org/linux/man-pages/man2/fdatasync.2.html) documentation for details. Returns `undefined`.
+     * @since v0.1.96
+     */
+    export function fdatasyncSync(fd: number): void;
+    /**
+     * Asynchronously copies `src` to `dest`. By default, `dest` is overwritten if it
+     * already exists. No arguments other than a possible exception are given to the
+     * callback function. Node.js makes no guarantees about the atomicity of the copy
+     * operation. If an error occurs after the destination file has been opened for
+     * writing, Node.js will attempt to remove the destination.
+     *
+     * `mode` is an optional integer that specifies the behavior
+     * of the copy operation. It is possible to create a mask consisting of the bitwise
+     * OR of two or more values (e.g.`fs.constants.COPYFILE_EXCL | fs.constants.COPYFILE_FICLONE`).
+     *
+     * * `fs.constants.COPYFILE_EXCL`: The copy operation will fail if `dest` already
+     * exists.
+     * * `fs.constants.COPYFILE_FICLONE`: The copy operation will attempt to create a
+     * copy-on-write reflink. If the platform does not support copy-on-write, then a
+     * fallback copy mechanism is used.
+     * * `fs.constants.COPYFILE_FICLONE_FORCE`: The copy operation will attempt to
+     * create a copy-on-write reflink. If the platform does not support
+     * copy-on-write, then the operation will fail.
+     *
+     * ```js
+     * import { copyFile, constants } from 'fs';
+     *
+     * function callback(err) {
+     *   if (err) throw err;
+     *   console.log('source.txt was copied to destination.txt');
+     * }
+     *
+     * // destination.txt will be created or overwritten by default.
+     * copyFile('source.txt', 'destination.txt', callback);
+     *
+     * // By using COPYFILE_EXCL, the operation will fail if destination.txt exists.
+     * copyFile('source.txt', 'destination.txt', constants.COPYFILE_EXCL, callback);
+     * ```
+     * @since v8.5.0
+     * @param src source filename to copy
+     * @param dest destination filename of the copy operation
+     * @param [mode=0] modifiers for copy operation.
+     */
+    export function copyFile(src: PathLike, dest: PathLike, callback: NoParamCallback): void;
+    export function copyFile(src: PathLike, dest: PathLike, mode: number, callback: NoParamCallback): void;
+    export namespace copyFile {
+        function __promisify__(src: PathLike, dst: PathLike, mode?: number): Promise<void>;
+    }
+    /**
+     * Synchronously copies `src` to `dest`. By default, `dest` is overwritten if it
+     * already exists. Returns `undefined`. Node.js makes no guarantees about the
+     * atomicity of the copy operation. If an error occurs after the destination file
+     * has been opened for writing, Node.js will attempt to remove the destination.
+     *
+     * `mode` is an optional integer that specifies the behavior
+     * of the copy operation. It is possible to create a mask consisting of the bitwise
+     * OR of two or more values (e.g.`fs.constants.COPYFILE_EXCL | fs.constants.COPYFILE_FICLONE`).
+     *
+     * * `fs.constants.COPYFILE_EXCL`: The copy operation will fail if `dest` already
+     * exists.
+     * * `fs.constants.COPYFILE_FICLONE`: The copy operation will attempt to create a
+     * copy-on-write reflink. If the platform does not support copy-on-write, then a
+     * fallback copy mechanism is used.
+     * * `fs.constants.COPYFILE_FICLONE_FORCE`: The copy operation will attempt to
+     * create a copy-on-write reflink. If the platform does not support
+     * copy-on-write, then the operation will fail.
+     *
+     * ```js
+     * import { copyFileSync, constants } from 'fs';
+     *
+     * // destination.txt will be created or overwritten by default.
+     * copyFileSync('source.txt', 'destination.txt');
+     * console.log('source.txt was copied to destination.txt');
+     *
+     * // By using COPYFILE_EXCL, the operation will fail if destination.txt exists.
+     * copyFileSync('source.txt', 'destination.txt', constants.COPYFILE_EXCL);
+     * ```
+     * @since v8.5.0
+     * @param src source filename to copy
+     * @param dest destination filename of the copy operation
+     * @param [mode=0] modifiers for copy operation.
+     */
+    export function copyFileSync(src: PathLike, dest: PathLike, mode?: number): void;
+    /**
+     * Write an array of `ArrayBufferView`s to the file specified by `fd` using`writev()`.
+     *
+     * `position` is the offset from the beginning of the file where this data
+     * should be written. If `typeof position !== 'number'`, the data will be written
+     * at the current position.
+     *
+     * The callback will be given three arguments: `err`, `bytesWritten`, and`buffers`. `bytesWritten` is how many bytes were written from `buffers`.
+     *
+     * If this method is `util.promisify()` ed, it returns a promise for an`Object` with `bytesWritten` and `buffers` properties.
+     *
+     * It is unsafe to use `fs.writev()` multiple times on the same file without
+     * waiting for the callback. For this scenario, use {@link createWriteStream}.
+     *
+     * On Linux, positional writes don't work when the file is opened in append mode.
+     * The kernel ignores the position argument and always appends the data to
+     * the end of the file.
+     * @since v12.9.0
+     */
+    export function writev(fd: number, buffers: ReadonlyArray<NodeJS.ArrayBufferView>, cb: (err: NodeJS.ErrnoException | null, bytesWritten: number, buffers: NodeJS.ArrayBufferView[]) => void): void;
+    export function writev(
+        fd: number,
+        buffers: ReadonlyArray<NodeJS.ArrayBufferView>,
+        position: number,
+        cb: (err: NodeJS.ErrnoException | null, bytesWritten: number, buffers: NodeJS.ArrayBufferView[]) => void
+    ): void;
+    export interface WriteVResult {
+        bytesWritten: number;
+        buffers: NodeJS.ArrayBufferView[];
+    }
+    export namespace writev {
+        function __promisify__(fd: number, buffers: ReadonlyArray<NodeJS.ArrayBufferView>, position?: number): Promise<WriteVResult>;
+    }
+    /**
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link writev}.
+     * @since v12.9.0
+     * @return The number of bytes written.
+     */
+    export function writevSync(fd: number, buffers: ReadonlyArray<NodeJS.ArrayBufferView>, position?: number): number;
+    /**
+     * Read from a file specified by `fd` and write to an array of `ArrayBufferView`s
+     * using `readv()`.
+     *
+     * `position` is the offset from the beginning of the file from where data
+     * should be read. If `typeof position !== 'number'`, the data will be read
+     * from the current position.
+     *
+     * The callback will be given three arguments: `err`, `bytesRead`, and`buffers`. `bytesRead` is how many bytes were read from the file.
+     *
+     * If this method is invoked as its `util.promisify()` ed version, it returns
+     * a promise for an `Object` with `bytesRead` and `buffers` properties.
+     * @since v13.13.0, v12.17.0
+     */
+    export function readv(fd: number, buffers: ReadonlyArray<NodeJS.ArrayBufferView>, cb: (err: NodeJS.ErrnoException | null, bytesRead: number, buffers: NodeJS.ArrayBufferView[]) => void): void;
+    export function readv(
+        fd: number,
+        buffers: ReadonlyArray<NodeJS.ArrayBufferView>,
+        position: number,
+        cb: (err: NodeJS.ErrnoException | null, bytesRead: number, buffers: NodeJS.ArrayBufferView[]) => void
+    ): void;
+    export interface ReadVResult {
+        bytesRead: number;
+        buffers: NodeJS.ArrayBufferView[];
+    }
+    export namespace readv {
+        function __promisify__(fd: number, buffers: ReadonlyArray<NodeJS.ArrayBufferView>, position?: number): Promise<ReadVResult>;
+    }
+    /**
+     * For detailed information, see the documentation of the asynchronous version of
+     * this API: {@link readv}.
+     * @since v13.13.0, v12.17.0
+     * @return The number of bytes read.
+     */
+    export function readvSync(fd: number, buffers: ReadonlyArray<NodeJS.ArrayBufferView>, position?: number): number;
+    export interface OpenDirOptions {
+        encoding?: BufferEncoding | undefined;
+        /**
+         * Number of directory entries that are buffered
+         * internally when reading from the directory. Higher values lead to better
+         * performance but higher memory usage.
+         * @default 32
+         */
+        bufferSize?: number | undefined;
+    }
+    /**
+     * Synchronously open a directory. See [`opendir(3)`](http://man7.org/linux/man-pages/man3/opendir.3.html).
+     *
+     * Creates an `fs.Dir`, which contains all further functions for reading from
+     * and cleaning up the directory.
+     *
+     * The `encoding` option sets the encoding for the `path` while opening the
+     * directory and subsequent read operations.
+     * @since v12.12.0
+     */
+    export function opendirSync(path: PathLike, options?: OpenDirOptions): Dir;
+    /**
+     * Asynchronously open a directory. See the POSIX [`opendir(3)`](http://man7.org/linux/man-pages/man3/opendir.3.html) documentation for
+     * more details.
+     *
+     * Creates an `fs.Dir`, which contains all further functions for reading from
+     * and cleaning up the directory.
+     *
+     * The `encoding` option sets the encoding for the `path` while opening the
+     * directory and subsequent read operations.
+     * @since v12.12.0
+     */
+    export function opendir(path: PathLike, cb: (err: NodeJS.ErrnoException | null, dir: Dir) => void): void;
+    export function opendir(path: PathLike, options: OpenDirOptions, cb: (err: NodeJS.ErrnoException | null, dir: Dir) => void): void;
+    export namespace opendir {
+        function __promisify__(path: PathLike, options?: OpenDirOptions): Promise<Dir>;
+    }
+    export interface BigIntStats extends StatsBase<bigint> {
+        atimeNs: bigint;
+        mtimeNs: bigint;
+        ctimeNs: bigint;
+        birthtimeNs: bigint;
+    }
+    export interface BigIntOptions {
+        bigint: true;
+    }
+    export interface StatOptions {
+        bigint?: boolean | undefined;
+    }
+    export interface StatSyncOptions extends StatOptions {
+        throwIfNoEntry?: boolean | undefined;
+    }
+    export interface CopyOptions {
+        /**
+         * Dereference symlinks
+         * @default false
+         */
+        dereference?: boolean;
+        /**
+         * When `force` is `false`, and the destination
+         * exists, throw an error.
+         * @default false
+         */
+        errorOnExist?: boolean;
+        /**
+         * Function to filter copied files/directories. Return
+         * `true` to copy the item, `false` to ignore it.
+         */
+        filter?(source: string, destination: string): boolean;
+        /**
+         * Overwrite existing file or directory. _The copy
+         * operation will ignore errors if you set this to false and the destination
+         * exists. Use the `errorOnExist` option to change this behavior.
+         * @default true
+         */
+        force?: boolean;
+        /**
+         * When `true` timestamps from `src` will
+         * be preserved.
+         * @default false
+         */
+        preserveTimestamps?: boolean;
+        /**
+         * Copy directories recursively.
+         * @default false
+         */
+        recursive?: boolean;
+    }
+    /**
+     * Asynchronously copies the entire directory structure from `src` to `dest`,
+     * including subdirectories and files.
+     *
+     * When copying a directory to another directory, globs are not supported and
+     * behavior is similar to `cp dir1/ dir2/`.
+     * @since v16.7.0
+     * @experimental
+     * @param src source path to copy.
+     * @param dest destination path to copy to.
+     */
+    export function cp(source: string, destination: string, callback: (err: NodeJS.ErrnoException | null) => void): void;
+    export function cp(source: string, destination: string, opts: CopyOptions, callback: (err: NodeJS.ErrnoException | null) => void): void;
+    /**
+     * Synchronously copies the entire directory structure from `src` to `dest`,
+     * including subdirectories and files.
+     *
+     * When copying a directory to another directory, globs are not supported and
+     * behavior is similar to `cp dir1/ dir2/`.
+     * @since v16.7.0
+     * @experimental
+     * @param src source path to copy.
+     * @param dest destination path to copy to.
+     */
+    export function cpSync(source: string, destination: string, opts?: CopyOptions): void;
+}
+declare module 'node:fs' {
+    export * from 'fs';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/fs/promises.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/fs/promises.d.ts
new file mode 100644
index 0000000..f6c77d3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/fs/promises.d.ts
@@ -0,0 +1,1091 @@
+/**
+ * The `fs/promises` API provides asynchronous file system methods that return
+ * promises.
+ *
+ * The promise APIs use the underlying Node.js threadpool to perform file
+ * system operations off the event loop thread. These operations are not
+ * synchronized or threadsafe. Care must be taken when performing multiple
+ * concurrent modifications on the same file or data corruption may occur.
+ * @since v10.0.0
+ */
+declare module 'fs/promises' {
+    import { Abortable } from 'node:events';
+    import { Stream } from 'node:stream';
+    import {
+        Stats,
+        BigIntStats,
+        StatOptions,
+        WriteVResult,
+        ReadVResult,
+        PathLike,
+        RmDirOptions,
+        RmOptions,
+        MakeDirectoryOptions,
+        Dirent,
+        OpenDirOptions,
+        Dir,
+        ObjectEncodingOptions,
+        BufferEncodingOption,
+        OpenMode,
+        Mode,
+        WatchOptions,
+        WatchEventType,
+        CopyOptions,
+        ReadStream,
+        WriteStream,
+    } from 'node:fs';
+    interface FileChangeInfo<T extends string | Buffer> {
+        eventType: WatchEventType;
+        filename: T;
+    }
+    interface FlagAndOpenMode {
+        mode?: Mode | undefined;
+        flag?: OpenMode | undefined;
+    }
+    interface FileReadResult<T extends NodeJS.ArrayBufferView> {
+        bytesRead: number;
+        buffer: T;
+    }
+    interface FileReadOptions<T extends NodeJS.ArrayBufferView = Buffer> {
+        /**
+         * @default `Buffer.alloc(0xffff)`
+         */
+        buffer?: T;
+        /**
+         * @default 0
+         */
+        offset?: number | null;
+        /**
+         * @default `buffer.byteLength`
+         */
+        length?: number | null;
+        position?: number | null;
+    }
+    interface CreateReadStreamOptions {
+        encoding?: BufferEncoding | null | undefined;
+        autoClose?: boolean | undefined;
+        emitClose?: boolean | undefined;
+        start?: number | undefined;
+        end?: number | undefined;
+        highWaterMark?: number | undefined;
+    }
+    interface CreateWriteStreamOptions {
+        encoding?: BufferEncoding | null | undefined;
+        autoClose?: boolean | undefined;
+        emitClose?: boolean | undefined;
+        start?: number | undefined;
+    }
+    // TODO: Add `EventEmitter` close
+    interface FileHandle {
+        /**
+         * The numeric file descriptor managed by the {FileHandle} object.
+         * @since v10.0.0
+         */
+        readonly fd: number;
+        /**
+         * Alias of `filehandle.writeFile()`.
+         *
+         * When operating on file handles, the mode cannot be changed from what it was set
+         * to with `fsPromises.open()`. Therefore, this is equivalent to `filehandle.writeFile()`.
+         * @since v10.0.0
+         * @return Fulfills with `undefined` upon success.
+         */
+        appendFile(data: string | Uint8Array, options?: (ObjectEncodingOptions & FlagAndOpenMode) | BufferEncoding | null): Promise<void>;
+        /**
+         * Changes the ownership of the file. A wrapper for [`chown(2)`](http://man7.org/linux/man-pages/man2/chown.2.html).
+         * @since v10.0.0
+         * @param uid The file's new owner's user id.
+         * @param gid The file's new group's group id.
+         * @return Fulfills with `undefined` upon success.
+         */
+        chown(uid: number, gid: number): Promise<void>;
+        /**
+         * Modifies the permissions on the file. See [`chmod(2)`](http://man7.org/linux/man-pages/man2/chmod.2.html).
+         * @since v10.0.0
+         * @param mode the file mode bit mask.
+         * @return Fulfills with `undefined` upon success.
+         */
+        chmod(mode: Mode): Promise<void>;
+        /**
+         * Unlike the 16 kb default `highWaterMark` for a `stream.Readable`, the stream
+         * returned by this method has a default `highWaterMark` of 64 kb.
+         *
+         * `options` can include `start` and `end` values to read a range of bytes from
+         * the file instead of the entire file. Both `start` and `end` are inclusive and
+         * start counting at 0, allowed values are in the
+         * \[0, [`Number.MAX_SAFE_INTEGER`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/MAX_SAFE_INTEGER)\] range. If `start` is
+         * omitted or `undefined`, `filehandle.createReadStream()` reads sequentially from
+         * the current file position. The `encoding` can be any one of those accepted by `Buffer`.
+         *
+         * If the `FileHandle` points to a character device that only supports blocking
+         * reads (such as keyboard or sound card), read operations do not finish until data
+         * is available. This can prevent the process from exiting and the stream from
+         * closing naturally.
+         *
+         * By default, the stream will emit a `'close'` event after it has been
+         * destroyed.  Set the `emitClose` option to `false` to change this behavior.
+         *
+         * ```js
+         * import { open } from 'fs/promises';
+         *
+         * const fd = await open('/dev/input/event0');
+         * // Create a stream from some character device.
+         * const stream = fd.createReadStream();
+         * setTimeout(() => {
+         *   stream.close(); // This may not close the stream.
+         *   // Artificially marking end-of-stream, as if the underlying resource had
+         *   // indicated end-of-file by itself, allows the stream to close.
+         *   // This does not cancel pending read operations, and if there is such an
+         *   // operation, the process may still not be able to exit successfully
+         *   // until it finishes.
+         *   stream.push(null);
+         *   stream.read(0);
+         * }, 100);
+         * ```
+         *
+         * If `autoClose` is false, then the file descriptor won't be closed, even if
+         * there's an error. It is the application's responsibility to close it and make
+         * sure there's no file descriptor leak. If `autoClose` is set to true (default
+         * behavior), on `'error'` or `'end'` the file descriptor will be closed
+         * automatically.
+         *
+         * An example to read the last 10 bytes of a file which is 100 bytes long:
+         *
+         * ```js
+         * import { open } from 'fs/promises';
+         *
+         * const fd = await open('sample.txt');
+         * fd.createReadStream({ start: 90, end: 99 });
+         * ```
+         * @since v16.11.0
+         */
+        createReadStream(options?: CreateReadStreamOptions): ReadStream;
+        /**
+         * `options` may also include a `start` option to allow writing data at some
+         * position past the beginning of the file, allowed values are in the
+         * \[0, [`Number.MAX_SAFE_INTEGER`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/MAX_SAFE_INTEGER)\] range. Modifying a file rather than replacing
+         * it may require the `flags` `open` option to be set to `r+` rather than the
+         * default `r`. The `encoding` can be any one of those accepted by `Buffer`.
+         *
+         * If `autoClose` is set to true (default behavior) on `'error'` or `'finish'`the file descriptor will be closed automatically. If `autoClose` is false,
+         * then the file descriptor won't be closed, even if there's an error.
+         * It is the application's responsibility to close it and make sure there's no
+         * file descriptor leak.
+         *
+         * By default, the stream will emit a `'close'` event after it has been
+         * destroyed.  Set the `emitClose` option to `false` to change this behavior.
+         * @since v16.11.0
+         */
+        createWriteStream(options?: CreateWriteStreamOptions): WriteStream;
+        /**
+         * Forces all currently queued I/O operations associated with the file to the
+         * operating system's synchronized I/O completion state. Refer to the POSIX [`fdatasync(2)`](http://man7.org/linux/man-pages/man2/fdatasync.2.html) documentation for details.
+         *
+         * Unlike `filehandle.sync` this method does not flush modified metadata.
+         * @since v10.0.0
+         * @return Fulfills with `undefined` upon success.
+         */
+        datasync(): Promise<void>;
+        /**
+         * Request that all data for the open file descriptor is flushed to the storage
+         * device. The specific implementation is operating system and device specific.
+         * Refer to the POSIX [`fsync(2)`](http://man7.org/linux/man-pages/man2/fsync.2.html) documentation for more detail.
+         * @since v10.0.0
+         * @return Fufills with `undefined` upon success.
+         */
+        sync(): Promise<void>;
+        /**
+         * Reads data from the file and stores that in the given buffer.
+         *
+         * If the file is not modified concurrently, the end-of-file is reached when the
+         * number of bytes read is zero.
+         * @since v10.0.0
+         * @param buffer A buffer that will be filled with the file data read.
+         * @param offset The location in the buffer at which to start filling.
+         * @param length The number of bytes to read.
+         * @param position The location where to begin reading data from the file. If `null`, data will be read from the current file position, and the position will be updated. If `position` is an
+         * integer, the current file position will remain unchanged.
+         * @return Fulfills upon success with an object with two properties:
+         */
+        read<T extends NodeJS.ArrayBufferView>(buffer: T, offset?: number | null, length?: number | null, position?: number | null): Promise<FileReadResult<T>>;
+        read<T extends NodeJS.ArrayBufferView = Buffer>(options?: FileReadOptions<T>): Promise<FileReadResult<T>>;
+        /**
+         * Asynchronously reads the entire contents of a file.
+         *
+         * If `options` is a string, then it specifies the `encoding`.
+         *
+         * The `FileHandle` has to support reading.
+         *
+         * If one or more `filehandle.read()` calls are made on a file handle and then a`filehandle.readFile()` call is made, the data will be read from the current
+         * position till the end of the file. It doesn't always read from the beginning
+         * of the file.
+         * @since v10.0.0
+         * @return Fulfills upon a successful read with the contents of the file. If no encoding is specified (using `options.encoding`), the data is returned as a {Buffer} object. Otherwise, the
+         * data will be a string.
+         */
+        readFile(
+            options?: {
+                encoding?: null | undefined;
+                flag?: OpenMode | undefined;
+            } | null
+        ): Promise<Buffer>;
+        /**
+         * Asynchronously reads the entire contents of a file. The underlying file will _not_ be closed automatically.
+         * The `FileHandle` must have been opened for reading.
+         * @param options An object that may contain an optional flag.
+         * If a flag is not provided, it defaults to `'r'`.
+         */
+        readFile(
+            options:
+                | {
+                      encoding: BufferEncoding;
+                      flag?: OpenMode | undefined;
+                  }
+                | BufferEncoding
+        ): Promise<string>;
+        /**
+         * Asynchronously reads the entire contents of a file. The underlying file will _not_ be closed automatically.
+         * The `FileHandle` must have been opened for reading.
+         * @param options An object that may contain an optional flag.
+         * If a flag is not provided, it defaults to `'r'`.
+         */
+        readFile(
+            options?:
+                | (ObjectEncodingOptions & {
+                      flag?: OpenMode | undefined;
+                  })
+                | BufferEncoding
+                | null
+        ): Promise<string | Buffer>;
+        /**
+         * @since v10.0.0
+         * @return Fulfills with an {fs.Stats} for the file.
+         */
+        stat(
+            opts?: StatOptions & {
+                bigint?: false | undefined;
+            }
+        ): Promise<Stats>;
+        stat(
+            opts: StatOptions & {
+                bigint: true;
+            }
+        ): Promise<BigIntStats>;
+        stat(opts?: StatOptions): Promise<Stats | BigIntStats>;
+        /**
+         * Truncates the file.
+         *
+         * If the file was larger than `len` bytes, only the first `len` bytes will be
+         * retained in the file.
+         *
+         * The following example retains only the first four bytes of the file:
+         *
+         * ```js
+         * import { open } from 'fs/promises';
+         *
+         * let filehandle = null;
+         * try {
+         *   filehandle = await open('temp.txt', 'r+');
+         *   await filehandle.truncate(4);
+         * } finally {
+         *   await filehandle?.close();
+         * }
+         * ```
+         *
+         * If the file previously was shorter than `len` bytes, it is extended, and the
+         * extended part is filled with null bytes (`'\0'`):
+         *
+         * If `len` is negative then `0` will be used.
+         * @since v10.0.0
+         * @param [len=0]
+         * @return Fulfills with `undefined` upon success.
+         */
+        truncate(len?: number): Promise<void>;
+        /**
+         * Change the file system timestamps of the object referenced by the `FileHandle` then resolves the promise with no arguments upon success.
+         * @since v10.0.0
+         */
+        utimes(atime: string | number | Date, mtime: string | number | Date): Promise<void>;
+        /**
+         * Asynchronously writes data to a file, replacing the file if it already exists.`data` can be a string, a buffer, an
+         * [AsyncIterable](https://tc39.github.io/ecma262/#sec-asynciterable-interface) or
+         * [Iterable](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterable_protocol) object, or an
+         * object with an own `toString` function
+         * property. The promise is resolved with no arguments upon success.
+         *
+         * If `options` is a string, then it specifies the `encoding`.
+         *
+         * The `FileHandle` has to support writing.
+         *
+         * It is unsafe to use `filehandle.writeFile()` multiple times on the same file
+         * without waiting for the promise to be resolved (or rejected).
+         *
+         * If one or more `filehandle.write()` calls are made on a file handle and then a`filehandle.writeFile()` call is made, the data will be written from the
+         * current position till the end of the file. It doesn't always write from the
+         * beginning of the file.
+         * @since v10.0.0
+         */
+        writeFile(data: string | Uint8Array, options?: (ObjectEncodingOptions & FlagAndOpenMode & Abortable) | BufferEncoding | null): Promise<void>;
+        /**
+         * Write `buffer` to the file.
+         *
+         * If `buffer` is a plain object, it must have an own (not inherited) `toString`function property.
+         *
+         * The promise is resolved with an object containing two properties:
+         *
+         * It is unsafe to use `filehandle.write()` multiple times on the same file
+         * without waiting for the promise to be resolved (or rejected). For this
+         * scenario, use `fs.createWriteStream()`.
+         *
+         * On Linux, positional writes do not work when the file is opened in append mode.
+         * The kernel ignores the position argument and always appends the data to
+         * the end of the file.
+         * @since v10.0.0
+         * @param [offset=0] The start position from within `buffer` where the data to write begins.
+         * @param [length=buffer.byteLength] The number of bytes from `buffer` to write.
+         * @param position The offset from the beginning of the file where the data from `buffer` should be written. If `position` is not a `number`, the data will be written at the current position.
+         * See the POSIX pwrite(2) documentation for more detail.
+         */
+        write<TBuffer extends Uint8Array>(
+            buffer: TBuffer,
+            offset?: number | null,
+            length?: number | null,
+            position?: number | null
+        ): Promise<{
+            bytesWritten: number;
+            buffer: TBuffer;
+        }>;
+        write(
+            data: string,
+            position?: number | null,
+            encoding?: BufferEncoding | null
+        ): Promise<{
+            bytesWritten: number;
+            buffer: string;
+        }>;
+        /**
+         * Write an array of [ArrayBufferView](https://developer.mozilla.org/en-US/docs/Web/API/ArrayBufferView) s to the file.
+         *
+         * The promise is resolved with an object containing a two properties:
+         *
+         * It is unsafe to call `writev()` multiple times on the same file without waiting
+         * for the promise to be resolved (or rejected).
+         *
+         * On Linux, positional writes don't work when the file is opened in append mode.
+         * The kernel ignores the position argument and always appends the data to
+         * the end of the file.
+         * @since v12.9.0
+         * @param position The offset from the beginning of the file where the data from `buffers` should be written. If `position` is not a `number`, the data will be written at the current
+         * position.
+         */
+        writev(buffers: ReadonlyArray<NodeJS.ArrayBufferView>, position?: number): Promise<WriteVResult>;
+        /**
+         * Read from a file and write to an array of [ArrayBufferView](https://developer.mozilla.org/en-US/docs/Web/API/ArrayBufferView) s
+         * @since v13.13.0, v12.17.0
+         * @param position The offset from the beginning of the file where the data should be read from. If `position` is not a `number`, the data will be read from the current position.
+         * @return Fulfills upon success an object containing two properties:
+         */
+        readv(buffers: ReadonlyArray<NodeJS.ArrayBufferView>, position?: number): Promise<ReadVResult>;
+        /**
+         * Closes the file handle after waiting for any pending operation on the handle to
+         * complete.
+         *
+         * ```js
+         * import { open } from 'fs/promises';
+         *
+         * let filehandle;
+         * try {
+         *   filehandle = await open('thefile.txt', 'r');
+         * } finally {
+         *   await filehandle?.close();
+         * }
+         * ```
+         * @since v10.0.0
+         * @return Fulfills with `undefined` upon success.
+         */
+        close(): Promise<void>;
+    }
+    /**
+     * Tests a user's permissions for the file or directory specified by `path`.
+     * The `mode` argument is an optional integer that specifies the accessibility
+     * checks to be performed. Check `File access constants` for possible values
+     * of `mode`. It is possible to create a mask consisting of the bitwise OR of
+     * two or more values (e.g. `fs.constants.W_OK | fs.constants.R_OK`).
+     *
+     * If the accessibility check is successful, the promise is resolved with no
+     * value. If any of the accessibility checks fail, the promise is rejected
+     * with an [Error](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error) object. The following example checks if the file`/etc/passwd` can be read and
+     * written by the current process.
+     *
+     * ```js
+     * import { access } from 'fs/promises';
+     * import { constants } from 'fs';
+     *
+     * try {
+     *   await access('/etc/passwd', constants.R_OK | constants.W_OK);
+     *   console.log('can access');
+     * } catch {
+     *   console.error('cannot access');
+     * }
+     * ```
+     *
+     * Using `fsPromises.access()` to check for the accessibility of a file before
+     * calling `fsPromises.open()` is not recommended. Doing so introduces a race
+     * condition, since other processes may change the file's state between the two
+     * calls. Instead, user code should open/read/write the file directly and handle
+     * the error raised if the file is not accessible.
+     * @since v10.0.0
+     * @param [mode=fs.constants.F_OK]
+     * @return Fulfills with `undefined` upon success.
+     */
+    function access(path: PathLike, mode?: number): Promise<void>;
+    /**
+     * Asynchronously copies `src` to `dest`. By default, `dest` is overwritten if it
+     * already exists.
+     *
+     * No guarantees are made about the atomicity of the copy operation. If an
+     * error occurs after the destination file has been opened for writing, an attempt
+     * will be made to remove the destination.
+     *
+     * ```js
+     * import { constants } from 'fs';
+     * import { copyFile } from 'fs/promises';
+     *
+     * try {
+     *   await copyFile('source.txt', 'destination.txt');
+     *   console.log('source.txt was copied to destination.txt');
+     * } catch {
+     *   console.log('The file could not be copied');
+     * }
+     *
+     * // By using COPYFILE_EXCL, the operation will fail if destination.txt exists.
+     * try {
+     *   await copyFile('source.txt', 'destination.txt', constants.COPYFILE_EXCL);
+     *   console.log('source.txt was copied to destination.txt');
+     * } catch {
+     *   console.log('The file could not be copied');
+     * }
+     * ```
+     * @since v10.0.0
+     * @param src source filename to copy
+     * @param dest destination filename of the copy operation
+     * @param [mode=0] Optional modifiers that specify the behavior of the copy operation. It is possible to create a mask consisting of the bitwise OR of two or more values (e.g.
+     * `fs.constants.COPYFILE_EXCL | fs.constants.COPYFILE_FICLONE`)
+     * @return Fulfills with `undefined` upon success.
+     */
+    function copyFile(src: PathLike, dest: PathLike, mode?: number): Promise<void>;
+    /**
+     * Opens a `FileHandle`.
+     *
+     * Refer to the POSIX [`open(2)`](http://man7.org/linux/man-pages/man2/open.2.html) documentation for more detail.
+     *
+     * Some characters (`< > : " / \ | ? *`) are reserved under Windows as documented
+     * by [Naming Files, Paths, and Namespaces](https://docs.microsoft.com/en-us/windows/desktop/FileIO/naming-a-file). Under NTFS, if the filename contains
+     * a colon, Node.js will open a file system stream, as described by [this MSDN page](https://docs.microsoft.com/en-us/windows/desktop/FileIO/using-streams).
+     * @since v10.0.0
+     * @param [flags='r'] See `support of file system `flags``.
+     * @param [mode=0o666] Sets the file mode (permission and sticky bits) if the file is created.
+     * @return Fulfills with a {FileHandle} object.
+     */
+    function open(path: PathLike, flags: string | number, mode?: Mode): Promise<FileHandle>;
+    /**
+     * Renames `oldPath` to `newPath`.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function rename(oldPath: PathLike, newPath: PathLike): Promise<void>;
+    /**
+     * Truncates (shortens or extends the length) of the content at `path` to `len`bytes.
+     * @since v10.0.0
+     * @param [len=0]
+     * @return Fulfills with `undefined` upon success.
+     */
+    function truncate(path: PathLike, len?: number): Promise<void>;
+    /**
+     * Removes the directory identified by `path`.
+     *
+     * Using `fsPromises.rmdir()` on a file (not a directory) results in the
+     * promise being rejected with an `ENOENT` error on Windows and an `ENOTDIR`error on POSIX.
+     *
+     * To get a behavior similar to the `rm -rf` Unix command, use `fsPromises.rm()` with options `{ recursive: true, force: true }`.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function rmdir(path: PathLike, options?: RmDirOptions): Promise<void>;
+    /**
+     * Removes files and directories (modeled on the standard POSIX `rm` utility).
+     * @since v14.14.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function rm(path: PathLike, options?: RmOptions): Promise<void>;
+    /**
+     * Asynchronously creates a directory.
+     *
+     * The optional `options` argument can be an integer specifying `mode` (permission
+     * and sticky bits), or an object with a `mode` property and a `recursive`property indicating whether parent directories should be created. Calling`fsPromises.mkdir()` when `path` is a directory
+     * that exists results in a
+     * rejection only when `recursive` is false.
+     * @since v10.0.0
+     * @return Upon success, fulfills with `undefined` if `recursive` is `false`, or the first directory path created if `recursive` is `true`.
+     */
+    function mkdir(
+        path: PathLike,
+        options: MakeDirectoryOptions & {
+            recursive: true;
+        }
+    ): Promise<string | undefined>;
+    /**
+     * Asynchronous mkdir(2) - create a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+     * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+     */
+    function mkdir(
+        path: PathLike,
+        options?:
+            | Mode
+            | (MakeDirectoryOptions & {
+                  recursive?: false | undefined;
+              })
+            | null
+    ): Promise<void>;
+    /**
+     * Asynchronous mkdir(2) - create a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the file mode, or an object optionally specifying the file mode and whether parent folders
+     * should be created. If a string is passed, it is parsed as an octal integer. If not specified, defaults to `0o777`.
+     */
+    function mkdir(path: PathLike, options?: Mode | MakeDirectoryOptions | null): Promise<string | undefined>;
+    /**
+     * Reads the contents of a directory.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the filenames. If the `encoding` is set to `'buffer'`, the filenames returned
+     * will be passed as `Buffer` objects.
+     *
+     * If `options.withFileTypes` is set to `true`, the resolved array will contain `fs.Dirent` objects.
+     *
+     * ```js
+     * import { readdir } from 'fs/promises';
+     *
+     * try {
+     *   const files = await readdir(path);
+     *   for (const file of files)
+     *     console.log(file);
+     * } catch (err) {
+     *   console.error(err);
+     * }
+     * ```
+     * @since v10.0.0
+     * @return Fulfills with an array of the names of the files in the directory excluding `'.'` and `'..'`.
+     */
+    function readdir(
+        path: PathLike,
+        options?:
+            | (ObjectEncodingOptions & {
+                  withFileTypes?: false | undefined;
+              })
+            | BufferEncoding
+            | null
+    ): Promise<string[]>;
+    /**
+     * Asynchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function readdir(
+        path: PathLike,
+        options:
+            | {
+                  encoding: 'buffer';
+                  withFileTypes?: false | undefined;
+              }
+            | 'buffer'
+    ): Promise<Buffer[]>;
+    /**
+     * Asynchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function readdir(
+        path: PathLike,
+        options?:
+            | (ObjectEncodingOptions & {
+                  withFileTypes?: false | undefined;
+              })
+            | BufferEncoding
+            | null
+    ): Promise<string[] | Buffer[]>;
+    /**
+     * Asynchronous readdir(3) - read a directory.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options If called with `withFileTypes: true` the result data will be an array of Dirent.
+     */
+    function readdir(
+        path: PathLike,
+        options: ObjectEncodingOptions & {
+            withFileTypes: true;
+        }
+    ): Promise<Dirent[]>;
+    /**
+     * Reads the contents of the symbolic link referred to by `path`. See the POSIX [`readlink(2)`](http://man7.org/linux/man-pages/man2/readlink.2.html) documentation for more detail. The promise is
+     * resolved with the`linkString` upon success.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the link path returned. If the `encoding` is set to `'buffer'`, the link path
+     * returned will be passed as a `Buffer` object.
+     * @since v10.0.0
+     * @return Fulfills with the `linkString` upon success.
+     */
+    function readlink(path: PathLike, options?: ObjectEncodingOptions | BufferEncoding | null): Promise<string>;
+    /**
+     * Asynchronous readlink(2) - read value of a symbolic link.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function readlink(path: PathLike, options: BufferEncodingOption): Promise<Buffer>;
+    /**
+     * Asynchronous readlink(2) - read value of a symbolic link.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function readlink(path: PathLike, options?: ObjectEncodingOptions | string | null): Promise<string | Buffer>;
+    /**
+     * Creates a symbolic link.
+     *
+     * The `type` argument is only used on Windows platforms and can be one of `'dir'`,`'file'`, or `'junction'`. Windows junction points require the destination path
+     * to be absolute. When using `'junction'`, the `target` argument will
+     * automatically be normalized to absolute path.
+     * @since v10.0.0
+     * @param [type='file']
+     * @return Fulfills with `undefined` upon success.
+     */
+    function symlink(target: PathLike, path: PathLike, type?: string | null): Promise<void>;
+    /**
+     * Equivalent to `fsPromises.stat()` unless `path` refers to a symbolic link,
+     * in which case the link itself is stat-ed, not the file that it refers to.
+     * Refer to the POSIX [`lstat(2)`](http://man7.org/linux/man-pages/man2/lstat.2.html) document for more detail.
+     * @since v10.0.0
+     * @return Fulfills with the {fs.Stats} object for the given symbolic link `path`.
+     */
+    function lstat(
+        path: PathLike,
+        opts?: StatOptions & {
+            bigint?: false | undefined;
+        }
+    ): Promise<Stats>;
+    function lstat(
+        path: PathLike,
+        opts: StatOptions & {
+            bigint: true;
+        }
+    ): Promise<BigIntStats>;
+    function lstat(path: PathLike, opts?: StatOptions): Promise<Stats | BigIntStats>;
+    /**
+     * @since v10.0.0
+     * @return Fulfills with the {fs.Stats} object for the given `path`.
+     */
+    function stat(
+        path: PathLike,
+        opts?: StatOptions & {
+            bigint?: false | undefined;
+        }
+    ): Promise<Stats>;
+    function stat(
+        path: PathLike,
+        opts: StatOptions & {
+            bigint: true;
+        }
+    ): Promise<BigIntStats>;
+    function stat(path: PathLike, opts?: StatOptions): Promise<Stats | BigIntStats>;
+    /**
+     * Creates a new link from the `existingPath` to the `newPath`. See the POSIX [`link(2)`](http://man7.org/linux/man-pages/man2/link.2.html) documentation for more detail.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function link(existingPath: PathLike, newPath: PathLike): Promise<void>;
+    /**
+     * If `path` refers to a symbolic link, then the link is removed without affecting
+     * the file or directory to which that link refers. If the `path` refers to a file
+     * path that is not a symbolic link, the file is deleted. See the POSIX [`unlink(2)`](http://man7.org/linux/man-pages/man2/unlink.2.html) documentation for more detail.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function unlink(path: PathLike): Promise<void>;
+    /**
+     * Changes the permissions of a file.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function chmod(path: PathLike, mode: Mode): Promise<void>;
+    /**
+     * Changes the permissions on a symbolic link.
+     *
+     * This method is only implemented on macOS.
+     * @deprecated Since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function lchmod(path: PathLike, mode: Mode): Promise<void>;
+    /**
+     * Changes the ownership on a symbolic link.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function lchown(path: PathLike, uid: number, gid: number): Promise<void>;
+    /**
+     * Changes the access and modification times of a file in the same way as `fsPromises.utimes()`, with the difference that if the path refers to a
+     * symbolic link, then the link is not dereferenced: instead, the timestamps of
+     * the symbolic link itself are changed.
+     * @since v14.5.0, v12.19.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function lutimes(path: PathLike, atime: string | number | Date, mtime: string | number | Date): Promise<void>;
+    /**
+     * Changes the ownership of a file.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function chown(path: PathLike, uid: number, gid: number): Promise<void>;
+    /**
+     * Change the file system timestamps of the object referenced by `path`.
+     *
+     * The `atime` and `mtime` arguments follow these rules:
+     *
+     * * Values can be either numbers representing Unix epoch time, `Date`s, or a
+     * numeric string like `'123456789.0'`.
+     * * If the value can not be converted to a number, or is `NaN`, `Infinity` or`-Infinity`, an `Error` will be thrown.
+     * @since v10.0.0
+     * @return Fulfills with `undefined` upon success.
+     */
+    function utimes(path: PathLike, atime: string | number | Date, mtime: string | number | Date): Promise<void>;
+    /**
+     * Determines the actual location of `path` using the same semantics as the`fs.realpath.native()` function.
+     *
+     * Only paths that can be converted to UTF8 strings are supported.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use for
+     * the path. If the `encoding` is set to `'buffer'`, the path returned will be
+     * passed as a `Buffer` object.
+     *
+     * On Linux, when Node.js is linked against musl libc, the procfs file system must
+     * be mounted on `/proc` in order for this function to work. Glibc does not have
+     * this restriction.
+     * @since v10.0.0
+     * @return Fulfills with the resolved path upon success.
+     */
+    function realpath(path: PathLike, options?: ObjectEncodingOptions | BufferEncoding | null): Promise<string>;
+    /**
+     * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function realpath(path: PathLike, options: BufferEncodingOption): Promise<Buffer>;
+    /**
+     * Asynchronous realpath(3) - return the canonicalized absolute pathname.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function realpath(path: PathLike, options?: ObjectEncodingOptions | BufferEncoding | null): Promise<string | Buffer>;
+    /**
+     * Creates a unique temporary directory. A unique directory name is generated by
+     * appending six random characters to the end of the provided `prefix`. Due to
+     * platform inconsistencies, avoid trailing `X` characters in `prefix`. Some
+     * platforms, notably the BSDs, can return more than six random characters, and
+     * replace trailing `X` characters in `prefix` with random characters.
+     *
+     * The optional `options` argument can be a string specifying an encoding, or an
+     * object with an `encoding` property specifying the character encoding to use.
+     *
+     * ```js
+     * import { mkdtemp } from 'fs/promises';
+     *
+     * try {
+     *   await mkdtemp(path.join(os.tmpdir(), 'foo-'));
+     * } catch (err) {
+     *   console.error(err);
+     * }
+     * ```
+     *
+     * The `fsPromises.mkdtemp()` method will append the six randomly selected
+     * characters directly to the `prefix` string. For instance, given a directory`/tmp`, if the intention is to create a temporary directory _within_`/tmp`, the`prefix` must end with a trailing
+     * platform-specific path separator
+     * (`require('path').sep`).
+     * @since v10.0.0
+     * @return Fulfills with a string containing the filesystem path of the newly created temporary directory.
+     */
+    function mkdtemp(prefix: string, options?: ObjectEncodingOptions | BufferEncoding | null): Promise<string>;
+    /**
+     * Asynchronously creates a unique temporary directory.
+     * Generates six random characters to be appended behind a required `prefix` to create a unique temporary directory.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function mkdtemp(prefix: string, options: BufferEncodingOption): Promise<Buffer>;
+    /**
+     * Asynchronously creates a unique temporary directory.
+     * Generates six random characters to be appended behind a required `prefix` to create a unique temporary directory.
+     * @param options The encoding (or an object specifying the encoding), used as the encoding of the result. If not provided, `'utf8'` is used.
+     */
+    function mkdtemp(prefix: string, options?: ObjectEncodingOptions | BufferEncoding | null): Promise<string | Buffer>;
+    /**
+     * Asynchronously writes data to a file, replacing the file if it already exists.`data` can be a string, a `Buffer`, or, an object with an own (not inherited)`toString` function property.
+     *
+     * The `encoding` option is ignored if `data` is a buffer.
+     *
+     * If `options` is a string, then it specifies the encoding.
+     *
+     * The `mode` option only affects the newly created file. See `fs.open()` for more details.
+     *
+     * Any specified `FileHandle` has to support writing.
+     *
+     * It is unsafe to use `fsPromises.writeFile()` multiple times on the same file
+     * without waiting for the promise to be settled.
+     *
+     * Similarly to `fsPromises.readFile` \- `fsPromises.writeFile` is a convenience
+     * method that performs multiple `write` calls internally to write the buffer
+     * passed to it. For performance sensitive code consider using `fs.createWriteStream()`.
+     *
+     * It is possible to use an `AbortSignal` to cancel an `fsPromises.writeFile()`.
+     * Cancelation is "best effort", and some amount of data is likely still
+     * to be written.
+     *
+     * ```js
+     * import { writeFile } from 'fs/promises';
+     * import { Buffer } from 'buffer';
+     *
+     * try {
+     *   const controller = new AbortController();
+     *   const { signal } = controller;
+     *   const data = new Uint8Array(Buffer.from('Hello Node.js'));
+     *   const promise = writeFile('message.txt', data, { signal });
+     *
+     *   // Abort the request before the promise settles.
+     *   controller.abort();
+     *
+     *   await promise;
+     * } catch (err) {
+     *   // When a request is aborted - err is an AbortError
+     *   console.error(err);
+     * }
+     * ```
+     *
+     * Aborting an ongoing request does not abort individual operating
+     * system requests but rather the internal buffering `fs.writeFile` performs.
+     * @since v10.0.0
+     * @param file filename or `FileHandle`
+     * @return Fulfills with `undefined` upon success.
+     */
+    function writeFile(
+        file: PathLike | FileHandle,
+        data: string | NodeJS.ArrayBufferView | Iterable<string | NodeJS.ArrayBufferView> | AsyncIterable<string | NodeJS.ArrayBufferView> | Stream,
+        options?:
+            | (ObjectEncodingOptions & {
+                  mode?: Mode | undefined;
+                  flag?: OpenMode | undefined;
+              } & Abortable)
+            | BufferEncoding
+            | null
+    ): Promise<void>;
+    /**
+     * Asynchronously append data to a file, creating the file if it does not yet
+     * exist. `data` can be a string or a `Buffer`.
+     *
+     * If `options` is a string, then it specifies the `encoding`.
+     *
+     * The `mode` option only affects the newly created file. See `fs.open()` for more details.
+     *
+     * The `path` may be specified as a `FileHandle` that has been opened
+     * for appending (using `fsPromises.open()`).
+     * @since v10.0.0
+     * @param path filename or {FileHandle}
+     * @return Fulfills with `undefined` upon success.
+     */
+    function appendFile(path: PathLike | FileHandle, data: string | Uint8Array, options?: (ObjectEncodingOptions & FlagAndOpenMode) | BufferEncoding | null): Promise<void>;
+    /**
+     * Asynchronously reads the entire contents of a file.
+     *
+     * If no encoding is specified (using `options.encoding`), the data is returned
+     * as a `Buffer` object. Otherwise, the data will be a string.
+     *
+     * If `options` is a string, then it specifies the encoding.
+     *
+     * When the `path` is a directory, the behavior of `fsPromises.readFile()` is
+     * platform-specific. On macOS, Linux, and Windows, the promise will be rejected
+     * with an error. On FreeBSD, a representation of the directory's contents will be
+     * returned.
+     *
+     * It is possible to abort an ongoing `readFile` using an `AbortSignal`. If a
+     * request is aborted the promise returned is rejected with an `AbortError`:
+     *
+     * ```js
+     * import { readFile } from 'fs/promises';
+     *
+     * try {
+     *   const controller = new AbortController();
+     *   const { signal } = controller;
+     *   const promise = readFile(fileName, { signal });
+     *
+     *   // Abort the request before the promise settles.
+     *   controller.abort();
+     *
+     *   await promise;
+     * } catch (err) {
+     *   // When a request is aborted - err is an AbortError
+     *   console.error(err);
+     * }
+     * ```
+     *
+     * Aborting an ongoing request does not abort individual operating
+     * system requests but rather the internal buffering `fs.readFile` performs.
+     *
+     * Any specified `FileHandle` has to support reading.
+     * @since v10.0.0
+     * @param path filename or `FileHandle`
+     * @return Fulfills with the contents of the file.
+     */
+    function readFile(
+        path: PathLike | FileHandle,
+        options?:
+            | ({
+                  encoding?: null | undefined;
+                  flag?: OpenMode | undefined;
+              } & Abortable)
+            | null
+    ): Promise<Buffer>;
+    /**
+     * Asynchronously reads the entire contents of a file.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a `FileHandle` is provided, the underlying file will _not_ be closed automatically.
+     * @param options An object that may contain an optional flag.
+     * If a flag is not provided, it defaults to `'r'`.
+     */
+    function readFile(
+        path: PathLike | FileHandle,
+        options:
+            | ({
+                  encoding: BufferEncoding;
+                  flag?: OpenMode | undefined;
+              } & Abortable)
+            | BufferEncoding
+    ): Promise<string>;
+    /**
+     * Asynchronously reads the entire contents of a file.
+     * @param path A path to a file. If a URL is provided, it must use the `file:` protocol.
+     * If a `FileHandle` is provided, the underlying file will _not_ be closed automatically.
+     * @param options An object that may contain an optional flag.
+     * If a flag is not provided, it defaults to `'r'`.
+     */
+    function readFile(
+        path: PathLike | FileHandle,
+        options?:
+            | (ObjectEncodingOptions &
+                  Abortable & {
+                      flag?: OpenMode | undefined;
+                  })
+            | BufferEncoding
+            | null
+    ): Promise<string | Buffer>;
+    /**
+     * Asynchronously open a directory for iterative scanning. See the POSIX [`opendir(3)`](http://man7.org/linux/man-pages/man3/opendir.3.html) documentation for more detail.
+     *
+     * Creates an `fs.Dir`, which contains all further functions for reading from
+     * and cleaning up the directory.
+     *
+     * The `encoding` option sets the encoding for the `path` while opening the
+     * directory and subsequent read operations.
+     *
+     * Example using async iteration:
+     *
+     * ```js
+     * import { opendir } from 'fs/promises';
+     *
+     * try {
+     *   const dir = await opendir('./');
+     *   for await (const dirent of dir)
+     *     console.log(dirent.name);
+     * } catch (err) {
+     *   console.error(err);
+     * }
+     * ```
+     *
+     * When using the async iterator, the `fs.Dir` object will be automatically
+     * closed after the iterator exits.
+     * @since v12.12.0
+     * @return Fulfills with an {fs.Dir}.
+     */
+    function opendir(path: PathLike, options?: OpenDirOptions): Promise<Dir>;
+    /**
+     * Returns an async iterator that watches for changes on `filename`, where `filename`is either a file or a directory.
+     *
+     * ```js
+     * const { watch } = require('fs/promises');
+     *
+     * const ac = new AbortController();
+     * const { signal } = ac;
+     * setTimeout(() => ac.abort(), 10000);
+     *
+     * (async () => {
+     *   try {
+     *     const watcher = watch(__filename, { signal });
+     *     for await (const event of watcher)
+     *       console.log(event);
+     *   } catch (err) {
+     *     if (err.name === 'AbortError')
+     *       return;
+     *     throw err;
+     *   }
+     * })();
+     * ```
+     *
+     * On most platforms, `'rename'` is emitted whenever a filename appears or
+     * disappears in the directory.
+     *
+     * All the `caveats` for `fs.watch()` also apply to `fsPromises.watch()`.
+     * @since v15.9.0, v14.18.0
+     * @return of objects with the properties:
+     */
+    function watch(
+        filename: PathLike,
+        options:
+            | (WatchOptions & {
+                  encoding: 'buffer';
+              })
+            | 'buffer'
+    ): AsyncIterable<FileChangeInfo<Buffer>>;
+    /**
+     * Watch for changes on `filename`, where `filename` is either a file or a directory, returning an `FSWatcher`.
+     * @param filename A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the encoding for the filename provided to the listener, or an object optionally specifying encoding, persistent, and recursive options.
+     * If `encoding` is not supplied, the default of `'utf8'` is used.
+     * If `persistent` is not supplied, the default of `true` is used.
+     * If `recursive` is not supplied, the default of `false` is used.
+     */
+    function watch(filename: PathLike, options?: WatchOptions | BufferEncoding): AsyncIterable<FileChangeInfo<string>>;
+    /**
+     * Watch for changes on `filename`, where `filename` is either a file or a directory, returning an `FSWatcher`.
+     * @param filename A path to a file or directory. If a URL is provided, it must use the `file:` protocol.
+     * @param options Either the encoding for the filename provided to the listener, or an object optionally specifying encoding, persistent, and recursive options.
+     * If `encoding` is not supplied, the default of `'utf8'` is used.
+     * If `persistent` is not supplied, the default of `true` is used.
+     * If `recursive` is not supplied, the default of `false` is used.
+     */
+    function watch(filename: PathLike, options: WatchOptions | string): AsyncIterable<FileChangeInfo<string>> | AsyncIterable<FileChangeInfo<Buffer>>;
+    /**
+     * Asynchronously copies the entire directory structure from `src` to `dest`,
+     * including subdirectories and files.
+     *
+     * When copying a directory to another directory, globs are not supported and
+     * behavior is similar to `cp dir1/ dir2/`.
+     * @since v16.7.0
+     * @experimental
+     * @param src source path to copy.
+     * @param dest destination path to copy to.
+     * @return Fulfills with `undefined` upon success.
+     */
+    function cp(source: string, destination: string, opts?: CopyOptions): Promise<void>;
+}
+declare module 'node:fs/promises' {
+    export * from 'fs/promises';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/globals.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/globals.d.ts
new file mode 100644
index 0000000..4533f1c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/globals.d.ts
@@ -0,0 +1,284 @@
+// Declare "static" methods in Error
+interface ErrorConstructor {
+    /** Create .stack property on a target object */
+    captureStackTrace(targetObject: object, constructorOpt?: Function): void;
+
+    /**
+     * Optional override for formatting stack traces
+     *
+     * @see https://v8.dev/docs/stack-trace-api#customizing-stack-traces
+     */
+    prepareStackTrace?: ((err: Error, stackTraces: NodeJS.CallSite[]) => any) | undefined;
+
+    stackTraceLimit: number;
+}
+
+/*-----------------------------------------------*
+ *                                               *
+ *                   GLOBAL                      *
+ *                                               *
+ ------------------------------------------------*/
+
+// For backwards compability
+interface NodeRequire extends NodeJS.Require { }
+interface RequireResolve extends NodeJS.RequireResolve { }
+interface NodeModule extends NodeJS.Module { }
+
+declare var process: NodeJS.Process;
+declare var console: Console;
+
+declare var __filename: string;
+declare var __dirname: string;
+
+declare var require: NodeRequire;
+declare var module: NodeModule;
+
+// Same as module.exports
+declare var exports: any;
+
+/**
+ * Only available if `--expose-gc` is passed to the process.
+ */
+declare var gc: undefined | (() => void);
+
+//#region borrowed
+// from https://github.com/microsoft/TypeScript/blob/38da7c600c83e7b31193a62495239a0fe478cb67/lib/lib.webworker.d.ts#L633 until moved to separate lib
+/** A controller object that allows you to abort one or more DOM requests as and when desired. */
+interface AbortController {
+    /**
+     * Returns the AbortSignal object associated with this object.
+     */
+
+    readonly signal: AbortSignal;
+    /**
+     * Invoking this method will set this object's AbortSignal's aborted flag and signal to any observers that the associated activity is to be aborted.
+     */
+    abort(): void;
+}
+
+/** A signal object that allows you to communicate with a DOM request (such as a Fetch) and abort it if required via an AbortController object. */
+interface AbortSignal {
+    /**
+     * Returns true if this AbortSignal's AbortController has signaled to abort, and false otherwise.
+     */
+    readonly aborted: boolean;
+}
+
+declare var AbortController: {
+    prototype: AbortController;
+    new(): AbortController;
+};
+
+declare var AbortSignal: {
+    prototype: AbortSignal;
+    new(): AbortSignal;
+    // TODO: Add abort() static
+};
+//#endregion borrowed
+
+//#region ArrayLike.at()
+interface RelativeIndexable<T> {
+    /**
+     * Takes an integer value and returns the item at that index,
+     * allowing for positive and negative integers.
+     * Negative integers count back from the last item in the array.
+     */
+    at(index: number): T | undefined;
+}
+interface String extends RelativeIndexable<string> {}
+interface Array<T> extends RelativeIndexable<T> {}
+interface Int8Array extends RelativeIndexable<number> {}
+interface Uint8Array extends RelativeIndexable<number> {}
+interface Uint8ClampedArray extends RelativeIndexable<number> {}
+interface Int16Array extends RelativeIndexable<number> {}
+interface Uint16Array extends RelativeIndexable<number> {}
+interface Int32Array extends RelativeIndexable<number> {}
+interface Uint32Array extends RelativeIndexable<number> {}
+interface Float32Array extends RelativeIndexable<number> {}
+interface Float64Array extends RelativeIndexable<number> {}
+interface BigInt64Array extends RelativeIndexable<bigint> {}
+interface BigUint64Array extends RelativeIndexable<bigint> {}
+//#endregion ArrayLike.at() end
+
+/*----------------------------------------------*
+*                                               *
+*               GLOBAL INTERFACES               *
+*                                               *
+*-----------------------------------------------*/
+declare namespace NodeJS {
+    interface CallSite {
+        /**
+         * Value of "this"
+         */
+        getThis(): unknown;
+
+        /**
+         * Type of "this" as a string.
+         * This is the name of the function stored in the constructor field of
+         * "this", if available.  Otherwise the object's [[Class]] internal
+         * property.
+         */
+        getTypeName(): string | null;
+
+        /**
+         * Current function
+         */
+        getFunction(): Function | undefined;
+
+        /**
+         * Name of the current function, typically its name property.
+         * If a name property is not available an attempt will be made to try
+         * to infer a name from the function's context.
+         */
+        getFunctionName(): string | null;
+
+        /**
+         * Name of the property [of "this" or one of its prototypes] that holds
+         * the current function
+         */
+        getMethodName(): string | null;
+
+        /**
+         * Name of the script [if this function was defined in a script]
+         */
+        getFileName(): string | null;
+
+        /**
+         * Current line number [if this function was defined in a script]
+         */
+        getLineNumber(): number | null;
+
+        /**
+         * Current column number [if this function was defined in a script]
+         */
+        getColumnNumber(): number | null;
+
+        /**
+         * A call site object representing the location where eval was called
+         * [if this function was created using a call to eval]
+         */
+        getEvalOrigin(): string | undefined;
+
+        /**
+         * Is this a toplevel invocation, that is, is "this" the global object?
+         */
+        isToplevel(): boolean;
+
+        /**
+         * Does this call take place in code defined by a call to eval?
+         */
+        isEval(): boolean;
+
+        /**
+         * Is this call in native V8 code?
+         */
+        isNative(): boolean;
+
+        /**
+         * Is this a constructor call?
+         */
+        isConstructor(): boolean;
+    }
+
+    interface ErrnoException extends Error {
+        errno?: number | undefined;
+        code?: string | undefined;
+        path?: string | undefined;
+        syscall?: string | undefined;
+    }
+
+    interface ReadableStream extends EventEmitter {
+        readable: boolean;
+        read(size?: number): string | Buffer;
+        setEncoding(encoding: BufferEncoding): this;
+        pause(): this;
+        resume(): this;
+        isPaused(): boolean;
+        pipe<T extends WritableStream>(destination: T, options?: { end?: boolean | undefined; }): T;
+        unpipe(destination?: WritableStream): this;
+        unshift(chunk: string | Uint8Array, encoding?: BufferEncoding): void;
+        wrap(oldStream: ReadableStream): this;
+        [Symbol.asyncIterator](): AsyncIterableIterator<string | Buffer>;
+    }
+
+    interface WritableStream extends EventEmitter {
+        writable: boolean;
+        write(buffer: Uint8Array | string, cb?: (err?: Error | null) => void): boolean;
+        write(str: string, encoding?: BufferEncoding, cb?: (err?: Error | null) => void): boolean;
+        end(cb?: () => void): this;
+        end(data: string | Uint8Array, cb?: () => void): this;
+        end(str: string, encoding?: BufferEncoding, cb?: () => void): this;
+    }
+
+    interface ReadWriteStream extends ReadableStream, WritableStream { }
+
+    interface RefCounted {
+        ref(): this;
+        unref(): this;
+    }
+
+    type TypedArray =
+        | Uint8Array
+        | Uint8ClampedArray
+        | Uint16Array
+        | Uint32Array
+        | Int8Array
+        | Int16Array
+        | Int32Array
+        | BigUint64Array
+        | BigInt64Array
+        | Float32Array
+        | Float64Array;
+    type ArrayBufferView = TypedArray | DataView;
+
+    interface Require {
+        (id: string): any;
+        resolve: RequireResolve;
+        cache: Dict<NodeModule>;
+        /**
+         * @deprecated
+         */
+        extensions: RequireExtensions;
+        main: Module | undefined;
+    }
+
+    interface RequireResolve {
+        (id: string, options?: { paths?: string[] | undefined; }): string;
+        paths(request: string): string[] | null;
+    }
+
+    interface RequireExtensions extends Dict<(m: Module, filename: string) => any> {
+        '.js': (m: Module, filename: string) => any;
+        '.json': (m: Module, filename: string) => any;
+        '.node': (m: Module, filename: string) => any;
+    }
+    interface Module {
+        /**
+         * `true` if the module is running during the Node.js preload
+         */
+        isPreloading: boolean;
+        exports: any;
+        require: Require;
+        id: string;
+        filename: string;
+        loaded: boolean;
+        /** @deprecated since 14.6.0 Please use `require.main` and `module.children` instead. */
+        parent: Module | null | undefined;
+        children: Module[];
+        /**
+         * @since 11.14.0
+         *
+         * The directory name of the module. This is usually the same as the path.dirname() of the module.id.
+         */
+        path: string;
+        paths: string[];
+    }
+
+    interface Dict<T> {
+        [key: string]: T | undefined;
+    }
+
+    interface ReadOnlyDict<T> {
+        readonly [key: string]: T | undefined;
+    }
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/globals.global.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/globals.global.d.ts
new file mode 100644
index 0000000..ef1198c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/globals.global.d.ts
@@ -0,0 +1 @@
+declare var global: typeof globalThis;
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/http.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/http.d.ts
new file mode 100644
index 0000000..bb3a93c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/http.d.ts
@@ -0,0 +1,1396 @@
+/**
+ * To use the HTTP server and client one must `require('http')`.
+ *
+ * The HTTP interfaces in Node.js are designed to support many features
+ * of the protocol which have been traditionally difficult to use.
+ * In particular, large, possibly chunk-encoded, messages. The interface is
+ * careful to never buffer entire requests or responses, so the
+ * user is able to stream data.
+ *
+ * HTTP message headers are represented by an object like this:
+ *
+ * ```js
+ * { 'content-length': '123',
+ *   'content-type': 'text/plain',
+ *   'connection': 'keep-alive',
+ *   'host': 'mysite.com',
+ *   'accept': '*' }
+ * ```
+ *
+ * Keys are lowercased. Values are not modified.
+ *
+ * In order to support the full spectrum of possible HTTP applications, the Node.js
+ * HTTP API is very low-level. It deals with stream handling and message
+ * parsing only. It parses a message into headers and body but it does not
+ * parse the actual headers or the body.
+ *
+ * See `message.headers` for details on how duplicate headers are handled.
+ *
+ * The raw headers as they were received are retained in the `rawHeaders`property, which is an array of `[key, value, key2, value2, ...]`. For
+ * example, the previous message header object might have a `rawHeaders`list like the following:
+ *
+ * ```js
+ * [ 'ConTent-Length', '123456',
+ *   'content-LENGTH', '123',
+ *   'content-type', 'text/plain',
+ *   'CONNECTION', 'keep-alive',
+ *   'Host', 'mysite.com',
+ *   'accepT', '*' ]
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/http.js)
+ */
+declare module 'http' {
+    import * as stream from 'node:stream';
+    import { URL } from 'node:url';
+    import { TcpSocketConnectOpts, Socket, Server as NetServer, LookupFunction } from 'node:net';
+    // incoming headers will never contain number
+    interface IncomingHttpHeaders extends NodeJS.Dict<string | string[]> {
+        accept?: string | undefined;
+        'accept-language'?: string | undefined;
+        'accept-patch'?: string | undefined;
+        'accept-ranges'?: string | undefined;
+        'access-control-allow-credentials'?: string | undefined;
+        'access-control-allow-headers'?: string | undefined;
+        'access-control-allow-methods'?: string | undefined;
+        'access-control-allow-origin'?: string | undefined;
+        'access-control-expose-headers'?: string | undefined;
+        'access-control-max-age'?: string | undefined;
+        'access-control-request-headers'?: string | undefined;
+        'access-control-request-method'?: string | undefined;
+        age?: string | undefined;
+        allow?: string | undefined;
+        'alt-svc'?: string | undefined;
+        authorization?: string | undefined;
+        'cache-control'?: string | undefined;
+        connection?: string | undefined;
+        'content-disposition'?: string | undefined;
+        'content-encoding'?: string | undefined;
+        'content-language'?: string | undefined;
+        'content-length'?: string | undefined;
+        'content-location'?: string | undefined;
+        'content-range'?: string | undefined;
+        'content-type'?: string | undefined;
+        cookie?: string | undefined;
+        date?: string | undefined;
+        etag?: string | undefined;
+        expect?: string | undefined;
+        expires?: string | undefined;
+        forwarded?: string | undefined;
+        from?: string | undefined;
+        host?: string | undefined;
+        'if-match'?: string | undefined;
+        'if-modified-since'?: string | undefined;
+        'if-none-match'?: string | undefined;
+        'if-unmodified-since'?: string | undefined;
+        'last-modified'?: string | undefined;
+        location?: string | undefined;
+        origin?: string | undefined;
+        pragma?: string | undefined;
+        'proxy-authenticate'?: string | undefined;
+        'proxy-authorization'?: string | undefined;
+        'public-key-pins'?: string | undefined;
+        range?: string | undefined;
+        referer?: string | undefined;
+        'retry-after'?: string | undefined;
+        'sec-websocket-accept'?: string | undefined;
+        'sec-websocket-extensions'?: string | undefined;
+        'sec-websocket-key'?: string | undefined;
+        'sec-websocket-protocol'?: string | undefined;
+        'sec-websocket-version'?: string | undefined;
+        'set-cookie'?: string[] | undefined;
+        'strict-transport-security'?: string | undefined;
+        tk?: string | undefined;
+        trailer?: string | undefined;
+        'transfer-encoding'?: string | undefined;
+        upgrade?: string | undefined;
+        'user-agent'?: string | undefined;
+        vary?: string | undefined;
+        via?: string | undefined;
+        warning?: string | undefined;
+        'www-authenticate'?: string | undefined;
+    }
+    // outgoing headers allows numbers (as they are converted internally to strings)
+    type OutgoingHttpHeader = number | string | string[];
+    interface OutgoingHttpHeaders extends NodeJS.Dict<OutgoingHttpHeader> {}
+    interface ClientRequestArgs {
+        signal?: AbortSignal | undefined;
+        protocol?: string | null | undefined;
+        host?: string | null | undefined;
+        hostname?: string | null | undefined;
+        family?: number | undefined;
+        port?: number | string | null | undefined;
+        defaultPort?: number | string | undefined;
+        localAddress?: string | undefined;
+        socketPath?: string | undefined;
+        /**
+         * @default 8192
+         */
+        maxHeaderSize?: number | undefined;
+        method?: string | undefined;
+        path?: string | null | undefined;
+        headers?: OutgoingHttpHeaders | undefined;
+        auth?: string | null | undefined;
+        agent?: Agent | boolean | undefined;
+        _defaultAgent?: Agent | undefined;
+        timeout?: number | undefined;
+        setHost?: boolean | undefined;
+        // https://github.com/nodejs/node/blob/master/lib/_http_client.js#L278
+        createConnection?: ((options: ClientRequestArgs, oncreate: (err: Error, socket: Socket) => void) => Socket) | undefined;
+        lookup?: LookupFunction | undefined;
+    }
+    interface ServerOptions {
+        IncomingMessage?: typeof IncomingMessage | undefined;
+        ServerResponse?: typeof ServerResponse | undefined;
+        /**
+         * Optionally overrides the value of
+         * `--max-http-header-size` for requests received by this server, i.e.
+         * the maximum length of request headers in bytes.
+         * @default 8192
+         */
+        maxHeaderSize?: number | undefined;
+        /**
+         * Use an insecure HTTP parser that accepts invalid HTTP headers when true.
+         * Using the insecure parser should be avoided.
+         * See --insecure-http-parser for more information.
+         * @default false
+         */
+        insecureHTTPParser?: boolean | undefined;
+    }
+    type RequestListener = (req: IncomingMessage, res: ServerResponse) => void;
+    /**
+     * @since v0.1.17
+     */
+    class Server extends NetServer {
+        constructor(requestListener?: RequestListener);
+        constructor(options: ServerOptions, requestListener?: RequestListener);
+        /**
+         * Sets the timeout value for sockets, and emits a `'timeout'` event on
+         * the Server object, passing the socket as an argument, if a timeout
+         * occurs.
+         *
+         * If there is a `'timeout'` event listener on the Server object, then it
+         * will be called with the timed-out socket as an argument.
+         *
+         * By default, the Server does not timeout sockets. However, if a callback
+         * is assigned to the Server's `'timeout'` event, timeouts must be handled
+         * explicitly.
+         * @since v0.9.12
+         * @param [msecs=0 (no timeout)]
+         */
+        setTimeout(msecs?: number, callback?: () => void): this;
+        setTimeout(callback: () => void): this;
+        /**
+         * Limits maximum incoming headers count. If set to 0, no limit will be applied.
+         * @since v0.7.0
+         */
+        maxHeadersCount: number | null;
+        /**
+         * The maximum number of requests socket can handle
+         * before closing keep alive connection.
+         *
+         * A value of `0` will disable the limit.
+         *
+         * When the limit is reached it will set the `Connection` header value to `close`,
+         * but will not actually close the connection, subsequent requests sent
+         * after the limit is reached will get `503 Service Unavailable` as a response.
+         * @since v16.10.0
+         */
+        maxRequestsPerSocket: number | null;
+        /**
+         * The number of milliseconds of inactivity before a socket is presumed
+         * to have timed out.
+         *
+         * A value of `0` will disable the timeout behavior on incoming connections.
+         *
+         * The socket timeout logic is set up on connection, so changing this
+         * value only affects new connections to the server, not any existing connections.
+         * @since v0.9.12
+         */
+        timeout: number;
+        /**
+         * Limit the amount of time the parser will wait to receive the complete HTTP
+         * headers.
+         *
+         * In case of inactivity, the rules defined in `server.timeout` apply. However,
+         * that inactivity based timeout would still allow the connection to be kept open
+         * if the headers are being sent very slowly (by default, up to a byte per 2
+         * minutes). In order to prevent this, whenever header data arrives an additional
+         * check is made that more than `server.headersTimeout` milliseconds has not
+         * passed since the connection was established. If the check fails, a `'timeout'`event is emitted on the server object, and (by default) the socket is destroyed.
+         * See `server.timeout` for more information on how timeout behavior can be
+         * customized.
+         * @since v11.3.0, v10.14.0
+         */
+        headersTimeout: number;
+        /**
+         * The number of milliseconds of inactivity a server needs to wait for additional
+         * incoming data, after it has finished writing the last response, before a socket
+         * will be destroyed. If the server receives new data before the keep-alive
+         * timeout has fired, it will reset the regular inactivity timeout, i.e.,`server.timeout`.
+         *
+         * A value of `0` will disable the keep-alive timeout behavior on incoming
+         * connections.
+         * A value of `0` makes the http server behave similarly to Node.js versions prior
+         * to 8.0.0, which did not have a keep-alive timeout.
+         *
+         * The socket timeout logic is set up on connection, so changing this value only
+         * affects new connections to the server, not any existing connections.
+         * @since v8.0.0
+         */
+        keepAliveTimeout: number;
+        /**
+         * Sets the timeout value in milliseconds for receiving the entire request from
+         * the client.
+         *
+         * If the timeout expires, the server responds with status 408 without
+         * forwarding the request to the request listener and then closes the connection.
+         *
+         * It must be set to a non-zero value (e.g. 120 seconds) to protect against
+         * potential Denial-of-Service attacks in case the server is deployed without a
+         * reverse proxy in front.
+         * @since v14.11.0
+         */
+        requestTimeout: number;
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'connection', listener: (socket: Socket) => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'listening', listener: () => void): this;
+        addListener(event: 'checkContinue', listener: RequestListener): this;
+        addListener(event: 'checkExpectation', listener: RequestListener): this;
+        addListener(event: 'clientError', listener: (err: Error, socket: stream.Duplex) => void): this;
+        addListener(event: 'connect', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        addListener(event: 'request', listener: RequestListener): this;
+        addListener(event: 'upgrade', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        emit(event: string, ...args: any[]): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'connection', socket: Socket): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'listening'): boolean;
+        emit(event: 'checkContinue', req: IncomingMessage, res: ServerResponse): boolean;
+        emit(event: 'checkExpectation', req: IncomingMessage, res: ServerResponse): boolean;
+        emit(event: 'clientError', err: Error, socket: stream.Duplex): boolean;
+        emit(event: 'connect', req: IncomingMessage, socket: stream.Duplex, head: Buffer): boolean;
+        emit(event: 'request', req: IncomingMessage, res: ServerResponse): boolean;
+        emit(event: 'upgrade', req: IncomingMessage, socket: stream.Duplex, head: Buffer): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'connection', listener: (socket: Socket) => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'listening', listener: () => void): this;
+        on(event: 'checkContinue', listener: RequestListener): this;
+        on(event: 'checkExpectation', listener: RequestListener): this;
+        on(event: 'clientError', listener: (err: Error, socket: stream.Duplex) => void): this;
+        on(event: 'connect', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        on(event: 'request', listener: RequestListener): this;
+        on(event: 'upgrade', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'connection', listener: (socket: Socket) => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'listening', listener: () => void): this;
+        once(event: 'checkContinue', listener: RequestListener): this;
+        once(event: 'checkExpectation', listener: RequestListener): this;
+        once(event: 'clientError', listener: (err: Error, socket: stream.Duplex) => void): this;
+        once(event: 'connect', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        once(event: 'request', listener: RequestListener): this;
+        once(event: 'upgrade', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'connection', listener: (socket: Socket) => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'listening', listener: () => void): this;
+        prependListener(event: 'checkContinue', listener: RequestListener): this;
+        prependListener(event: 'checkExpectation', listener: RequestListener): this;
+        prependListener(event: 'clientError', listener: (err: Error, socket: stream.Duplex) => void): this;
+        prependListener(event: 'connect', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        prependListener(event: 'request', listener: RequestListener): this;
+        prependListener(event: 'upgrade', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'connection', listener: (socket: Socket) => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'listening', listener: () => void): this;
+        prependOnceListener(event: 'checkContinue', listener: RequestListener): this;
+        prependOnceListener(event: 'checkExpectation', listener: RequestListener): this;
+        prependOnceListener(event: 'clientError', listener: (err: Error, socket: stream.Duplex) => void): this;
+        prependOnceListener(event: 'connect', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+        prependOnceListener(event: 'request', listener: RequestListener): this;
+        prependOnceListener(event: 'upgrade', listener: (req: IncomingMessage, socket: stream.Duplex, head: Buffer) => void): this;
+    }
+    /**
+     * This class serves as the parent class of {@link ClientRequest} and {@link ServerResponse}. It is an abstract of outgoing message from
+     * the perspective of the participants of HTTP transaction.
+     * @since v0.1.17
+     */
+    class OutgoingMessage extends stream.Writable {
+        readonly req: IncomingMessage;
+        chunkedEncoding: boolean;
+        shouldKeepAlive: boolean;
+        useChunkedEncodingByDefault: boolean;
+        sendDate: boolean;
+        /**
+         * @deprecated Use `writableEnded` instead.
+         */
+        finished: boolean;
+        /**
+         * Read-only. `true` if the headers were sent, otherwise `false`.
+         * @since v0.9.3
+         */
+        readonly headersSent: boolean;
+        /**
+         * Aliases of `outgoingMessage.socket`
+         * @since v0.3.0
+         * @deprecated Since v15.12.0,v14.17.1 - Use `socket` instead.
+         */
+        readonly connection: Socket | null;
+        /**
+         * Reference to the underlying socket. Usually, users will not want to access
+         * this property.
+         *
+         * After calling `outgoingMessage.end()`, this property will be nulled.
+         * @since v0.3.0
+         */
+        readonly socket: Socket | null;
+        constructor();
+        /**
+         * Once a socket is associated with the message and is connected,`socket.setTimeout()` will be called with `msecs` as the first parameter.
+         * @since v0.9.12
+         * @param callback Optional function to be called when a timeout occurs. Same as binding to the `timeout` event.
+         */
+        setTimeout(msecs: number, callback?: () => void): this;
+        /**
+         * Sets a single header value for the header object.
+         * @since v0.4.0
+         * @param name Header name
+         * @param value Header value
+         */
+        setHeader(name: string, value: number | string | ReadonlyArray<string>): this;
+        /**
+         * Gets the value of HTTP header with the given name. If such a name doesn't
+         * exist in message, it will be `undefined`.
+         * @since v0.4.0
+         * @param name Name of header
+         */
+        getHeader(name: string): number | string | string[] | undefined;
+        /**
+         * Returns a shallow copy of the current outgoing headers. Since a shallow
+         * copy is used, array values may be mutated without additional calls to
+         * various header-related HTTP module methods. The keys of the returned
+         * object are the header names and the values are the respective header
+         * values. All header names are lowercase.
+         *
+         * The object returned by the `outgoingMessage.getHeaders()` method does
+         * not prototypically inherit from the JavaScript Object. This means that
+         * typical Object methods such as `obj.toString()`, `obj.hasOwnProperty()`,
+         * and others are not defined and will not work.
+         *
+         * ```js
+         * outgoingMessage.setHeader('Foo', 'bar');
+         * outgoingMessage.setHeader('Set-Cookie', ['foo=bar', 'bar=baz']);
+         *
+         * const headers = outgoingMessage.getHeaders();
+         * // headers === { foo: 'bar', 'set-cookie': ['foo=bar', 'bar=baz'] }
+         * ```
+         * @since v8.0.0
+         */
+        getHeaders(): OutgoingHttpHeaders;
+        /**
+         * Returns an array of names of headers of the outgoing outgoingMessage. All
+         * names are lowercase.
+         * @since v8.0.0
+         */
+        getHeaderNames(): string[];
+        /**
+         * Returns `true` if the header identified by `name` is currently set in the
+         * outgoing headers. The header name is case-insensitive.
+         *
+         * ```js
+         * const hasContentType = outgoingMessage.hasHeader('content-type');
+         * ```
+         * @since v8.0.0
+         */
+        hasHeader(name: string): boolean;
+        /**
+         * Removes a header that is queued for implicit sending.
+         *
+         * ```js
+         * outgoingMessage.removeHeader('Content-Encoding');
+         * ```
+         * @since v0.4.0
+         */
+        removeHeader(name: string): void;
+        /**
+         * Adds HTTP trailers (headers but at the end of the message) to the message.
+         *
+         * Trailers are **only** be emitted if the message is chunked encoded. If not,
+         * the trailer will be silently discarded.
+         *
+         * HTTP requires the `Trailer` header to be sent to emit trailers,
+         * with a list of header fields in its value, e.g.
+         *
+         * ```js
+         * message.writeHead(200, { 'Content-Type': 'text/plain',
+         *                          'Trailer': 'Content-MD5' });
+         * message.write(fileData);
+         * message.addTrailers({ 'Content-MD5': '7895bf4b8828b55ceaf47747b4bca667' });
+         * message.end();
+         * ```
+         *
+         * Attempting to set a header field name or value that contains invalid characters
+         * will result in a `TypeError` being thrown.
+         * @since v0.3.0
+         */
+        addTrailers(headers: OutgoingHttpHeaders | ReadonlyArray<[string, string]>): void;
+        /**
+         * Compulsorily flushes the message headers
+         *
+         * For efficiency reason, Node.js normally buffers the message headers
+         * until `outgoingMessage.end()` is called or the first chunk of message data
+         * is written. It then tries to pack the headers and data into a single TCP
+         * packet.
+         *
+         * It is usually desired (it saves a TCP round-trip), but not when the first
+         * data is not sent until possibly much later. `outgoingMessage.flushHeaders()`bypasses the optimization and kickstarts the request.
+         * @since v1.6.0
+         */
+        flushHeaders(): void;
+    }
+    /**
+     * This object is created internally by an HTTP server, not by the user. It is
+     * passed as the second parameter to the `'request'` event.
+     * @since v0.1.17
+     */
+    class ServerResponse extends OutgoingMessage {
+        /**
+         * When using implicit headers (not calling `response.writeHead()` explicitly),
+         * this property controls the status code that will be sent to the client when
+         * the headers get flushed.
+         *
+         * ```js
+         * response.statusCode = 404;
+         * ```
+         *
+         * After response header was sent to the client, this property indicates the
+         * status code which was sent out.
+         * @since v0.4.0
+         */
+        statusCode: number;
+        /**
+         * When using implicit headers (not calling `response.writeHead()` explicitly),
+         * this property controls the status message that will be sent to the client when
+         * the headers get flushed. If this is left as `undefined` then the standard
+         * message for the status code will be used.
+         *
+         * ```js
+         * response.statusMessage = 'Not found';
+         * ```
+         *
+         * After response header was sent to the client, this property indicates the
+         * status message which was sent out.
+         * @since v0.11.8
+         */
+        statusMessage: string;
+        constructor(req: IncomingMessage);
+        assignSocket(socket: Socket): void;
+        detachSocket(socket: Socket): void;
+        /**
+         * Sends a HTTP/1.1 100 Continue message to the client, indicating that
+         * the request body should be sent. See the `'checkContinue'` event on`Server`.
+         * @since v0.3.0
+         */
+        writeContinue(callback?: () => void): void;
+        /**
+         * Sends a response header to the request. The status code is a 3-digit HTTP
+         * status code, like `404`. The last argument, `headers`, are the response headers.
+         * Optionally one can give a human-readable `statusMessage` as the second
+         * argument.
+         *
+         * `headers` may be an `Array` where the keys and values are in the same list.
+         * It is _not_ a list of tuples. So, the even-numbered offsets are key values,
+         * and the odd-numbered offsets are the associated values. The array is in the same
+         * format as `request.rawHeaders`.
+         *
+         * Returns a reference to the `ServerResponse`, so that calls can be chained.
+         *
+         * ```js
+         * const body = 'hello world';
+         * response
+         *   .writeHead(200, {
+         *     'Content-Length': Buffer.byteLength(body),
+         *     'Content-Type': 'text/plain'
+         *   })
+         *   .end(body);
+         * ```
+         *
+         * This method must only be called once on a message and it must
+         * be called before `response.end()` is called.
+         *
+         * If `response.write()` or `response.end()` are called before calling
+         * this, the implicit/mutable headers will be calculated and call this function.
+         *
+         * When headers have been set with `response.setHeader()`, they will be merged
+         * with any headers passed to `response.writeHead()`, with the headers passed
+         * to `response.writeHead()` given precedence.
+         *
+         * If this method is called and `response.setHeader()` has not been called,
+         * it will directly write the supplied header values onto the network channel
+         * without caching internally, and the `response.getHeader()` on the header
+         * will not yield the expected result. If progressive population of headers is
+         * desired with potential future retrieval and modification, use `response.setHeader()` instead.
+         *
+         * ```js
+         * // Returns content-type = text/plain
+         * const server = http.createServer((req, res) => {
+         *   res.setHeader('Content-Type', 'text/html');
+         *   res.setHeader('X-Foo', 'bar');
+         *   res.writeHead(200, { 'Content-Type': 'text/plain' });
+         *   res.end('ok');
+         * });
+         * ```
+         *
+         * `Content-Length` is given in bytes, not characters. Use `Buffer.byteLength()` to determine the length of the body in bytes. Node.js
+         * does not check whether `Content-Length` and the length of the body which has
+         * been transmitted are equal or not.
+         *
+         * Attempting to set a header field name or value that contains invalid characters
+         * will result in a `TypeError` being thrown.
+         * @since v0.1.30
+         */
+        writeHead(statusCode: number, statusMessage?: string, headers?: OutgoingHttpHeaders | OutgoingHttpHeader[]): this;
+        writeHead(statusCode: number, headers?: OutgoingHttpHeaders | OutgoingHttpHeader[]): this;
+        /**
+         * Sends a HTTP/1.1 102 Processing message to the client, indicating that
+         * the request body should be sent.
+         * @since v10.0.0
+         */
+        writeProcessing(): void;
+    }
+    interface InformationEvent {
+        statusCode: number;
+        statusMessage: string;
+        httpVersion: string;
+        httpVersionMajor: number;
+        httpVersionMinor: number;
+        headers: IncomingHttpHeaders;
+        rawHeaders: string[];
+    }
+    /**
+     * This object is created internally and returned from {@link request}. It
+     * represents an _in-progress_ request whose header has already been queued. The
+     * header is still mutable using the `setHeader(name, value)`,`getHeader(name)`, `removeHeader(name)` API. The actual header will
+     * be sent along with the first data chunk or when calling `request.end()`.
+     *
+     * To get the response, add a listener for `'response'` to the request object.`'response'` will be emitted from the request object when the response
+     * headers have been received. The `'response'` event is executed with one
+     * argument which is an instance of {@link IncomingMessage}.
+     *
+     * During the `'response'` event, one can add listeners to the
+     * response object; particularly to listen for the `'data'` event.
+     *
+     * If no `'response'` handler is added, then the response will be
+     * entirely discarded. However, if a `'response'` event handler is added,
+     * then the data from the response object **must** be consumed, either by
+     * calling `response.read()` whenever there is a `'readable'` event, or
+     * by adding a `'data'` handler, or by calling the `.resume()` method.
+     * Until the data is consumed, the `'end'` event will not fire. Also, until
+     * the data is read it will consume memory that can eventually lead to a
+     * 'process out of memory' error.
+     *
+     * For backward compatibility, `res` will only emit `'error'` if there is an`'error'` listener registered.
+     *
+     * Node.js does not check whether Content-Length and the length of the
+     * body which has been transmitted are equal or not.
+     * @since v0.1.17
+     */
+    class ClientRequest extends OutgoingMessage {
+        /**
+         * The `request.aborted` property will be `true` if the request has
+         * been aborted.
+         * @since v0.11.14
+         * @deprecated Since v17.0.0 - Check `destroyed` instead.
+         */
+        aborted: boolean;
+        /**
+         * The request host.
+         * @since v14.5.0, v12.19.0
+         */
+        host: string;
+        /**
+         * The request protocol.
+         * @since v14.5.0, v12.19.0
+         */
+        protocol: string;
+        /**
+         * Whether the request is send through a reused socket.
+         * @since v13.0.0, v12.16.0
+         */
+        reusedSocket: boolean;
+        /**
+         * Limits maximum response headers count. If set to 0, no limit will be applied.
+         * @default 2000
+         */
+        maxHeadersCount: number;
+        constructor(url: string | URL | ClientRequestArgs, cb?: (res: IncomingMessage) => void);
+        /**
+         * The request method.
+         * @since v0.1.97
+         */
+        method: string;
+        /**
+         * The request path.
+         * @since v0.4.0
+         */
+        path: string;
+        /**
+         * Marks the request as aborting. Calling this will cause remaining data
+         * in the response to be dropped and the socket to be destroyed.
+         * @since v0.3.8
+         * @deprecated Since v14.1.0,v13.14.0 - Use `destroy` instead.
+         */
+        abort(): void;
+        onSocket(socket: Socket): void;
+        /**
+         * Once a socket is assigned to this request and is connected `socket.setTimeout()` will be called.
+         * @since v0.5.9
+         * @param timeout Milliseconds before a request times out.
+         * @param callback Optional function to be called when a timeout occurs. Same as binding to the `'timeout'` event.
+         */
+        setTimeout(timeout: number, callback?: () => void): this;
+        /**
+         * Once a socket is assigned to this request and is connected `socket.setNoDelay()` will be called.
+         * @since v0.5.9
+         */
+        setNoDelay(noDelay?: boolean): void;
+        /**
+         * Once a socket is assigned to this request and is connected `socket.setKeepAlive()` will be called.
+         * @since v0.5.9
+         */
+        setSocketKeepAlive(enable?: boolean, initialDelay?: number): void;
+        /**
+         * Returns an array containing the unique names of the current outgoing raw
+         * headers. Header names are returned with their exact casing being set.
+         *
+         * ```js
+         * request.setHeader('Foo', 'bar');
+         * request.setHeader('Set-Cookie', ['foo=bar', 'bar=baz']);
+         *
+         * const headerNames = request.getRawHeaderNames();
+         * // headerNames === ['Foo', 'Set-Cookie']
+         * ```
+         * @since v15.13.0, v14.17.0
+         */
+        getRawHeaderNames(): string[];
+        /**
+         * @deprecated
+         */
+        addListener(event: 'abort', listener: () => void): this;
+        addListener(event: 'connect', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        addListener(event: 'continue', listener: () => void): this;
+        addListener(event: 'information', listener: (info: InformationEvent) => void): this;
+        addListener(event: 'response', listener: (response: IncomingMessage) => void): this;
+        addListener(event: 'socket', listener: (socket: Socket) => void): this;
+        addListener(event: 'timeout', listener: () => void): this;
+        addListener(event: 'upgrade', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'drain', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'finish', listener: () => void): this;
+        addListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        /**
+         * @deprecated
+         */
+        on(event: 'abort', listener: () => void): this;
+        on(event: 'connect', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        on(event: 'continue', listener: () => void): this;
+        on(event: 'information', listener: (info: InformationEvent) => void): this;
+        on(event: 'response', listener: (response: IncomingMessage) => void): this;
+        on(event: 'socket', listener: (socket: Socket) => void): this;
+        on(event: 'timeout', listener: () => void): this;
+        on(event: 'upgrade', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'drain', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'finish', listener: () => void): this;
+        on(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        on(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        /**
+         * @deprecated
+         */
+        once(event: 'abort', listener: () => void): this;
+        once(event: 'connect', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        once(event: 'continue', listener: () => void): this;
+        once(event: 'information', listener: (info: InformationEvent) => void): this;
+        once(event: 'response', listener: (response: IncomingMessage) => void): this;
+        once(event: 'socket', listener: (socket: Socket) => void): this;
+        once(event: 'timeout', listener: () => void): this;
+        once(event: 'upgrade', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'drain', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'finish', listener: () => void): this;
+        once(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        once(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        /**
+         * @deprecated
+         */
+        prependListener(event: 'abort', listener: () => void): this;
+        prependListener(event: 'connect', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        prependListener(event: 'continue', listener: () => void): this;
+        prependListener(event: 'information', listener: (info: InformationEvent) => void): this;
+        prependListener(event: 'response', listener: (response: IncomingMessage) => void): this;
+        prependListener(event: 'socket', listener: (socket: Socket) => void): this;
+        prependListener(event: 'timeout', listener: () => void): this;
+        prependListener(event: 'upgrade', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'drain', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'finish', listener: () => void): this;
+        prependListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        /**
+         * @deprecated
+         */
+        prependOnceListener(event: 'abort', listener: () => void): this;
+        prependOnceListener(event: 'connect', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        prependOnceListener(event: 'continue', listener: () => void): this;
+        prependOnceListener(event: 'information', listener: (info: InformationEvent) => void): this;
+        prependOnceListener(event: 'response', listener: (response: IncomingMessage) => void): this;
+        prependOnceListener(event: 'socket', listener: (socket: Socket) => void): this;
+        prependOnceListener(event: 'timeout', listener: () => void): this;
+        prependOnceListener(event: 'upgrade', listener: (response: IncomingMessage, socket: Socket, head: Buffer) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'drain', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'finish', listener: () => void): this;
+        prependOnceListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    /**
+     * An `IncomingMessage` object is created by {@link Server} or {@link ClientRequest} and passed as the first argument to the `'request'` and `'response'` event respectively. It may be used to
+     * access response
+     * status, headers and data.
+     *
+     * Different from its `socket` value which is a subclass of `stream.Duplex`, the`IncomingMessage` itself extends `stream.Readable` and is created separately to
+     * parse and emit the incoming HTTP headers and payload, as the underlying socket
+     * may be reused multiple times in case of keep-alive.
+     * @since v0.1.17
+     */
+    class IncomingMessage extends stream.Readable {
+        constructor(socket: Socket);
+        /**
+         * The `message.aborted` property will be `true` if the request has
+         * been aborted.
+         * @since v10.1.0
+         * @deprecated Since v17.0.0 - Check `message.destroyed` from [stream.Readable](https://nodejs.org/dist/latest-v17.x/docs/api/stream.html#class-streamreadable).
+         */
+        aborted: boolean;
+        /**
+         * In case of server request, the HTTP version sent by the client. In the case of
+         * client response, the HTTP version of the connected-to server.
+         * Probably either `'1.1'` or `'1.0'`.
+         *
+         * Also `message.httpVersionMajor` is the first integer and`message.httpVersionMinor` is the second.
+         * @since v0.1.1
+         */
+        httpVersion: string;
+        httpVersionMajor: number;
+        httpVersionMinor: number;
+        /**
+         * The `message.complete` property will be `true` if a complete HTTP message has
+         * been received and successfully parsed.
+         *
+         * This property is particularly useful as a means of determining if a client or
+         * server fully transmitted a message before a connection was terminated:
+         *
+         * ```js
+         * const req = http.request({
+         *   host: '127.0.0.1',
+         *   port: 8080,
+         *   method: 'POST'
+         * }, (res) => {
+         *   res.resume();
+         *   res.on('end', () => {
+         *     if (!res.complete)
+         *       console.error(
+         *         'The connection was terminated while the message was still being sent');
+         *   });
+         * });
+         * ```
+         * @since v0.3.0
+         */
+        complete: boolean;
+        /**
+         * Alias for `message.socket`.
+         * @since v0.1.90
+         * @deprecated Since v16.0.0 - Use `socket`.
+         */
+        connection: Socket;
+        /**
+         * The `net.Socket` object associated with the connection.
+         *
+         * With HTTPS support, use `request.socket.getPeerCertificate()` to obtain the
+         * client's authentication details.
+         *
+         * This property is guaranteed to be an instance of the `net.Socket` class,
+         * a subclass of `stream.Duplex`, unless the user specified a socket
+         * type other than `net.Socket`.
+         * @since v0.3.0
+         */
+        socket: Socket;
+        /**
+         * The request/response headers object.
+         *
+         * Key-value pairs of header names and values. Header names are lower-cased.
+         *
+         * ```js
+         * // Prints something like:
+         * //
+         * // { 'user-agent': 'curl/7.22.0',
+         * //   host: '127.0.0.1:8000',
+         * //   accept: '*' }
+         * console.log(request.headers);
+         * ```
+         *
+         * Duplicates in raw headers are handled in the following ways, depending on the
+         * header name:
+         *
+         * * Duplicates of `age`, `authorization`, `content-length`, `content-type`,`etag`, `expires`, `from`, `host`, `if-modified-since`, `if-unmodified-since`,`last-modified`, `location`,
+         * `max-forwards`, `proxy-authorization`, `referer`,`retry-after`, `server`, or `user-agent` are discarded.
+         * * `set-cookie` is always an array. Duplicates are added to the array.
+         * * For duplicate `cookie` headers, the values are joined together with '; '.
+         * * For all other headers, the values are joined together with ', '.
+         * @since v0.1.5
+         */
+        headers: IncomingHttpHeaders;
+        /**
+         * The raw request/response headers list exactly as they were received.
+         *
+         * The keys and values are in the same list. It is _not_ a
+         * list of tuples. So, the even-numbered offsets are key values, and the
+         * odd-numbered offsets are the associated values.
+         *
+         * Header names are not lowercased, and duplicates are not merged.
+         *
+         * ```js
+         * // Prints something like:
+         * //
+         * // [ 'user-agent',
+         * //   'this is invalid because there can be only one',
+         * //   'User-Agent',
+         * //   'curl/7.22.0',
+         * //   'Host',
+         * //   '127.0.0.1:8000',
+         * //   'ACCEPT',
+         * //   '*' ]
+         * console.log(request.rawHeaders);
+         * ```
+         * @since v0.11.6
+         */
+        rawHeaders: string[];
+        /**
+         * The request/response trailers object. Only populated at the `'end'` event.
+         * @since v0.3.0
+         */
+        trailers: NodeJS.Dict<string>;
+        /**
+         * The raw request/response trailer keys and values exactly as they were
+         * received. Only populated at the `'end'` event.
+         * @since v0.11.6
+         */
+        rawTrailers: string[];
+        /**
+         * Calls `message.socket.setTimeout(msecs, callback)`.
+         * @since v0.5.9
+         */
+        setTimeout(msecs: number, callback?: () => void): this;
+        /**
+         * **Only valid for request obtained from {@link Server}.**
+         *
+         * The request method as a string. Read only. Examples: `'GET'`, `'DELETE'`.
+         * @since v0.1.1
+         */
+        method?: string | undefined;
+        /**
+         * **Only valid for request obtained from {@link Server}.**
+         *
+         * Request URL string. This contains only the URL that is present in the actual
+         * HTTP request. Take the following request:
+         *
+         * ```http
+         * GET /status?name=ryan HTTP/1.1
+         * Accept: text/plain
+         * ```
+         *
+         * To parse the URL into its parts:
+         *
+         * ```js
+         * new URL(request.url, `http://${request.headers.host}`);
+         * ```
+         *
+         * When `request.url` is `'/status?name=ryan'` and`request.headers.host` is `'localhost:3000'`:
+         *
+         * ```console
+         * $ node
+         * > new URL(request.url, `http://${request.headers.host}`)
+         * URL {
+         *   href: 'http://localhost:3000/status?name=ryan',
+         *   origin: 'http://localhost:3000',
+         *   protocol: 'http:',
+         *   username: '',
+         *   password: '',
+         *   host: 'localhost:3000',
+         *   hostname: 'localhost',
+         *   port: '3000',
+         *   pathname: '/status',
+         *   search: '?name=ryan',
+         *   searchParams: URLSearchParams { 'name' => 'ryan' },
+         *   hash: ''
+         * }
+         * ```
+         * @since v0.1.90
+         */
+        url?: string | undefined;
+        /**
+         * **Only valid for response obtained from {@link ClientRequest}.**
+         *
+         * The 3-digit HTTP response status code. E.G. `404`.
+         * @since v0.1.1
+         */
+        statusCode?: number | undefined;
+        /**
+         * **Only valid for response obtained from {@link ClientRequest}.**
+         *
+         * The HTTP response status message (reason phrase). E.G. `OK` or `Internal Server Error`.
+         * @since v0.11.10
+         */
+        statusMessage?: string | undefined;
+        /**
+         * Calls `destroy()` on the socket that received the `IncomingMessage`. If `error`is provided, an `'error'` event is emitted on the socket and `error` is passed
+         * as an argument to any listeners on the event.
+         * @since v0.3.0
+         */
+        destroy(error?: Error): this;
+    }
+    interface AgentOptions extends Partial<TcpSocketConnectOpts> {
+        /**
+         * Keep sockets around in a pool to be used by other requests in the future. Default = false
+         */
+        keepAlive?: boolean | undefined;
+        /**
+         * When using HTTP KeepAlive, how often to send TCP KeepAlive packets over sockets being kept alive. Default = 1000.
+         * Only relevant if keepAlive is set to true.
+         */
+        keepAliveMsecs?: number | undefined;
+        /**
+         * Maximum number of sockets to allow per host. Default for Node 0.10 is 5, default for Node 0.12 is Infinity
+         */
+        maxSockets?: number | undefined;
+        /**
+         * Maximum number of sockets allowed for all hosts in total. Each request will use a new socket until the maximum is reached. Default: Infinity.
+         */
+        maxTotalSockets?: number | undefined;
+        /**
+         * Maximum number of sockets to leave open in a free state. Only relevant if keepAlive is set to true. Default = 256.
+         */
+        maxFreeSockets?: number | undefined;
+        /**
+         * Socket timeout in milliseconds. This will set the timeout after the socket is connected.
+         */
+        timeout?: number | undefined;
+        /**
+         * Scheduling strategy to apply when picking the next free socket to use.
+         * @default `lifo`
+         */
+        scheduling?: 'fifo' | 'lifo' | undefined;
+    }
+    /**
+     * An `Agent` is responsible for managing connection persistence
+     * and reuse for HTTP clients. It maintains a queue of pending requests
+     * for a given host and port, reusing a single socket connection for each
+     * until the queue is empty, at which time the socket is either destroyed
+     * or put into a pool where it is kept to be used again for requests to the
+     * same host and port. Whether it is destroyed or pooled depends on the`keepAlive` `option`.
+     *
+     * Pooled connections have TCP Keep-Alive enabled for them, but servers may
+     * still close idle connections, in which case they will be removed from the
+     * pool and a new connection will be made when a new HTTP request is made for
+     * that host and port. Servers may also refuse to allow multiple requests
+     * over the same connection, in which case the connection will have to be
+     * remade for every request and cannot be pooled. The `Agent` will still make
+     * the requests to that server, but each one will occur over a new connection.
+     *
+     * When a connection is closed by the client or the server, it is removed
+     * from the pool. Any unused sockets in the pool will be unrefed so as not
+     * to keep the Node.js process running when there are no outstanding requests.
+     * (see `socket.unref()`).
+     *
+     * It is good practice, to `destroy()` an `Agent` instance when it is no
+     * longer in use, because unused sockets consume OS resources.
+     *
+     * Sockets are removed from an agent when the socket emits either
+     * a `'close'` event or an `'agentRemove'` event. When intending to keep one
+     * HTTP request open for a long time without keeping it in the agent, something
+     * like the following may be done:
+     *
+     * ```js
+     * http.get(options, (res) => {
+     *   // Do stuff
+     * }).on('socket', (socket) => {
+     *   socket.emit('agentRemove');
+     * });
+     * ```
+     *
+     * An agent may also be used for an individual request. By providing`{agent: false}` as an option to the `http.get()` or `http.request()`functions, a one-time use `Agent` with default options
+     * will be used
+     * for the client connection.
+     *
+     * `agent:false`:
+     *
+     * ```js
+     * http.get({
+     *   hostname: 'localhost',
+     *   port: 80,
+     *   path: '/',
+     *   agent: false  // Create a new agent just for this one request
+     * }, (res) => {
+     *   // Do stuff with response
+     * });
+     * ```
+     * @since v0.3.4
+     */
+    class Agent {
+        /**
+         * By default set to 256\. For agents with `keepAlive` enabled, this
+         * sets the maximum number of sockets that will be left open in the free
+         * state.
+         * @since v0.11.7
+         */
+        maxFreeSockets: number;
+        /**
+         * By default set to `Infinity`. Determines how many concurrent sockets the agent
+         * can have open per origin. Origin is the returned value of `agent.getName()`.
+         * @since v0.3.6
+         */
+        maxSockets: number;
+        /**
+         * By default set to `Infinity`. Determines how many concurrent sockets the agent
+         * can have open. Unlike `maxSockets`, this parameter applies across all origins.
+         * @since v14.5.0, v12.19.0
+         */
+        maxTotalSockets: number;
+        /**
+         * An object which contains arrays of sockets currently awaiting use by
+         * the agent when `keepAlive` is enabled. Do not modify.
+         *
+         * Sockets in the `freeSockets` list will be automatically destroyed and
+         * removed from the array on `'timeout'`.
+         * @since v0.11.4
+         */
+        readonly freeSockets: NodeJS.ReadOnlyDict<Socket[]>;
+        /**
+         * An object which contains arrays of sockets currently in use by the
+         * agent. Do not modify.
+         * @since v0.3.6
+         */
+        readonly sockets: NodeJS.ReadOnlyDict<Socket[]>;
+        /**
+         * An object which contains queues of requests that have not yet been assigned to
+         * sockets. Do not modify.
+         * @since v0.5.9
+         */
+        readonly requests: NodeJS.ReadOnlyDict<IncomingMessage[]>;
+        constructor(opts?: AgentOptions);
+        /**
+         * Destroy any sockets that are currently in use by the agent.
+         *
+         * It is usually not necessary to do this. However, if using an
+         * agent with `keepAlive` enabled, then it is best to explicitly shut down
+         * the agent when it is no longer needed. Otherwise,
+         * sockets might stay open for quite a long time before the server
+         * terminates them.
+         * @since v0.11.4
+         */
+        destroy(): void;
+    }
+    const METHODS: string[];
+    const STATUS_CODES: {
+        [errorCode: number]: string | undefined;
+        [errorCode: string]: string | undefined;
+    };
+    /**
+     * Returns a new instance of {@link Server}.
+     *
+     * The `requestListener` is a function which is automatically
+     * added to the `'request'` event.
+     * @since v0.1.13
+     */
+    function createServer(requestListener?: RequestListener): Server;
+    function createServer(options: ServerOptions, requestListener?: RequestListener): Server;
+    // although RequestOptions are passed as ClientRequestArgs to ClientRequest directly,
+    // create interface RequestOptions would make the naming more clear to developers
+    interface RequestOptions extends ClientRequestArgs {}
+    /**
+     * Node.js maintains several connections per server to make HTTP requests.
+     * This function allows one to transparently issue requests.
+     *
+     * `url` can be a string or a `URL` object. If `url` is a
+     * string, it is automatically parsed with `new URL()`. If it is a `URL` object, it will be automatically converted to an ordinary `options` object.
+     *
+     * If both `url` and `options` are specified, the objects are merged, with the`options` properties taking precedence.
+     *
+     * The optional `callback` parameter will be added as a one-time listener for
+     * the `'response'` event.
+     *
+     * `http.request()` returns an instance of the {@link ClientRequest} class. The `ClientRequest` instance is a writable stream. If one needs to
+     * upload a file with a POST request, then write to the `ClientRequest` object.
+     *
+     * ```js
+     * const http = require('http');
+     *
+     * const postData = JSON.stringify({
+     *   'msg': 'Hello World!'
+     * });
+     *
+     * const options = {
+     *   hostname: 'www.google.com',
+     *   port: 80,
+     *   path: '/upload',
+     *   method: 'POST',
+     *   headers: {
+     *     'Content-Type': 'application/json',
+     *     'Content-Length': Buffer.byteLength(postData)
+     *   }
+     * };
+     *
+     * const req = http.request(options, (res) => {
+     *   console.log(`STATUS: ${res.statusCode}`);
+     *   console.log(`HEADERS: ${JSON.stringify(res.headers)}`);
+     *   res.setEncoding('utf8');
+     *   res.on('data', (chunk) => {
+     *     console.log(`BODY: ${chunk}`);
+     *   });
+     *   res.on('end', () => {
+     *     console.log('No more data in response.');
+     *   });
+     * });
+     *
+     * req.on('error', (e) => {
+     *   console.error(`problem with request: ${e.message}`);
+     * });
+     *
+     * // Write data to request body
+     * req.write(postData);
+     * req.end();
+     * ```
+     *
+     * In the example `req.end()` was called. With `http.request()` one
+     * must always call `req.end()` to signify the end of the request -
+     * even if there is no data being written to the request body.
+     *
+     * If any error is encountered during the request (be that with DNS resolution,
+     * TCP level errors, or actual HTTP parse errors) an `'error'` event is emitted
+     * on the returned request object. As with all `'error'` events, if no listeners
+     * are registered the error will be thrown.
+     *
+     * There are a few special headers that should be noted.
+     *
+     * * Sending a 'Connection: keep-alive' will notify Node.js that the connection to
+     * the server should be persisted until the next request.
+     * * Sending a 'Content-Length' header will disable the default chunked encoding.
+     * * Sending an 'Expect' header will immediately send the request headers.
+     * Usually, when sending 'Expect: 100-continue', both a timeout and a listener
+     * for the `'continue'` event should be set. See RFC 2616 Section 8.2.3 for more
+     * information.
+     * * Sending an Authorization header will override using the `auth` option
+     * to compute basic authentication.
+     *
+     * Example using a `URL` as `options`:
+     *
+     * ```js
+     * const options = new URL('http://abc:xyz@example.com');
+     *
+     * const req = http.request(options, (res) => {
+     *   // ...
+     * });
+     * ```
+     *
+     * In a successful request, the following events will be emitted in the following
+     * order:
+     *
+     * * `'socket'`
+     * * `'response'`
+     *    * `'data'` any number of times, on the `res` object
+     *    (`'data'` will not be emitted at all if the response body is empty, for
+     *    instance, in most redirects)
+     *    * `'end'` on the `res` object
+     * * `'close'`
+     *
+     * In the case of a connection error, the following events will be emitted:
+     *
+     * * `'socket'`
+     * * `'error'`
+     * * `'close'`
+     *
+     * In the case of a premature connection close before the response is received,
+     * the following events will be emitted in the following order:
+     *
+     * * `'socket'`
+     * * `'error'` with an error with message `'Error: socket hang up'` and code`'ECONNRESET'`
+     * * `'close'`
+     *
+     * In the case of a premature connection close after the response is received,
+     * the following events will be emitted in the following order:
+     *
+     * * `'socket'`
+     * * `'response'`
+     *    * `'data'` any number of times, on the `res` object
+     * * (connection closed here)
+     * * `'aborted'` on the `res` object
+     * * `'error'` on the `res` object with an error with message`'Error: aborted'` and code `'ECONNRESET'`.
+     * * `'close'`
+     * * `'close'` on the `res` object
+     *
+     * If `req.destroy()` is called before a socket is assigned, the following
+     * events will be emitted in the following order:
+     *
+     * * (`req.destroy()` called here)
+     * * `'error'` with an error with message `'Error: socket hang up'` and code`'ECONNRESET'`
+     * * `'close'`
+     *
+     * If `req.destroy()` is called before the connection succeeds, the following
+     * events will be emitted in the following order:
+     *
+     * * `'socket'`
+     * * (`req.destroy()` called here)
+     * * `'error'` with an error with message `'Error: socket hang up'` and code`'ECONNRESET'`
+     * * `'close'`
+     *
+     * If `req.destroy()` is called after the response is received, the following
+     * events will be emitted in the following order:
+     *
+     * * `'socket'`
+     * * `'response'`
+     *    * `'data'` any number of times, on the `res` object
+     * * (`req.destroy()` called here)
+     * * `'aborted'` on the `res` object
+     * * `'error'` on the `res` object with an error with message`'Error: aborted'` and code `'ECONNRESET'`.
+     * * `'close'`
+     * * `'close'` on the `res` object
+     *
+     * If `req.abort()` is called before a socket is assigned, the following
+     * events will be emitted in the following order:
+     *
+     * * (`req.abort()` called here)
+     * * `'abort'`
+     * * `'close'`
+     *
+     * If `req.abort()` is called before the connection succeeds, the following
+     * events will be emitted in the following order:
+     *
+     * * `'socket'`
+     * * (`req.abort()` called here)
+     * * `'abort'`
+     * * `'error'` with an error with message `'Error: socket hang up'` and code`'ECONNRESET'`
+     * * `'close'`
+     *
+     * If `req.abort()` is called after the response is received, the following
+     * events will be emitted in the following order:
+     *
+     * * `'socket'`
+     * * `'response'`
+     *    * `'data'` any number of times, on the `res` object
+     * * (`req.abort()` called here)
+     * * `'abort'`
+     * * `'aborted'` on the `res` object
+     * * `'error'` on the `res` object with an error with message`'Error: aborted'` and code `'ECONNRESET'`.
+     * * `'close'`
+     * * `'close'` on the `res` object
+     *
+     * Setting the `timeout` option or using the `setTimeout()` function will
+     * not abort the request or do anything besides add a `'timeout'` event.
+     *
+     * Passing an `AbortSignal` and then calling `abort` on the corresponding`AbortController` will behave the same way as calling `.destroy()` on the
+     * request itself.
+     * @since v0.3.6
+     */
+    function request(options: RequestOptions | string | URL, callback?: (res: IncomingMessage) => void): ClientRequest;
+    function request(url: string | URL, options: RequestOptions, callback?: (res: IncomingMessage) => void): ClientRequest;
+    /**
+     * Since most requests are GET requests without bodies, Node.js provides this
+     * convenience method. The only difference between this method and {@link request} is that it sets the method to GET and calls `req.end()`automatically. The callback must take care to consume the
+     * response
+     * data for reasons stated in {@link ClientRequest} section.
+     *
+     * The `callback` is invoked with a single argument that is an instance of {@link IncomingMessage}.
+     *
+     * JSON fetching example:
+     *
+     * ```js
+     * http.get('http://localhost:8000/', (res) => {
+     *   const { statusCode } = res;
+     *   const contentType = res.headers['content-type'];
+     *
+     *   let error;
+     *   // Any 2xx status code signals a successful response but
+     *   // here we're only checking for 200.
+     *   if (statusCode !== 200) {
+     *     error = new Error('Request Failed.\n' +
+     *                       `Status Code: ${statusCode}`);
+     *   } else if (!/^application\/json/.test(contentType)) {
+     *     error = new Error('Invalid content-type.\n' +
+     *                       `Expected application/json but received ${contentType}`);
+     *   }
+     *   if (error) {
+     *     console.error(error.message);
+     *     // Consume response data to free up memory
+     *     res.resume();
+     *     return;
+     *   }
+     *
+     *   res.setEncoding('utf8');
+     *   let rawData = '';
+     *   res.on('data', (chunk) => { rawData += chunk; });
+     *   res.on('end', () => {
+     *     try {
+     *       const parsedData = JSON.parse(rawData);
+     *       console.log(parsedData);
+     *     } catch (e) {
+     *       console.error(e.message);
+     *     }
+     *   });
+     * }).on('error', (e) => {
+     *   console.error(`Got error: ${e.message}`);
+     * });
+     *
+     * // Create a local server to receive data from
+     * const server = http.createServer((req, res) => {
+     *   res.writeHead(200, { 'Content-Type': 'application/json' });
+     *   res.end(JSON.stringify({
+     *     data: 'Hello World!'
+     *   }));
+     * });
+     *
+     * server.listen(8000);
+     * ```
+     * @since v0.3.6
+     * @param options Accepts the same `options` as {@link request}, with the `method` always set to `GET`. Properties that are inherited from the prototype are ignored.
+     */
+    function get(options: RequestOptions | string | URL, callback?: (res: IncomingMessage) => void): ClientRequest;
+    function get(url: string | URL, options: RequestOptions, callback?: (res: IncomingMessage) => void): ClientRequest;
+    let globalAgent: Agent;
+    /**
+     * Read-only property specifying the maximum allowed size of HTTP headers in bytes.
+     * Defaults to 16KB. Configurable using the `--max-http-header-size` CLI option.
+     */
+    const maxHeaderSize: number;
+}
+declare module 'node:http' {
+    export * from 'http';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/http2.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/http2.d.ts
new file mode 100644
index 0000000..1166c90
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/http2.d.ts
@@ -0,0 +1,2100 @@
+/**
+ * The `http2` module provides an implementation of the [HTTP/2](https://tools.ietf.org/html/rfc7540) protocol. It
+ * can be accessed using:
+ *
+ * ```js
+ * const http2 = require('http2');
+ * ```
+ * @since v8.4.0
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/http2.js)
+ */
+declare module 'http2' {
+    import EventEmitter = require('node:events');
+    import * as fs from 'node:fs';
+    import * as net from 'node:net';
+    import * as stream from 'node:stream';
+    import * as tls from 'node:tls';
+    import * as url from 'node:url';
+    import { IncomingHttpHeaders as Http1IncomingHttpHeaders, OutgoingHttpHeaders, IncomingMessage, ServerResponse } from 'node:http';
+    export { OutgoingHttpHeaders } from 'node:http';
+    export interface IncomingHttpStatusHeader {
+        ':status'?: number | undefined;
+    }
+    export interface IncomingHttpHeaders extends Http1IncomingHttpHeaders {
+        ':path'?: string | undefined;
+        ':method'?: string | undefined;
+        ':authority'?: string | undefined;
+        ':scheme'?: string | undefined;
+    }
+    // Http2Stream
+    export interface StreamPriorityOptions {
+        exclusive?: boolean | undefined;
+        parent?: number | undefined;
+        weight?: number | undefined;
+        silent?: boolean | undefined;
+    }
+    export interface StreamState {
+        localWindowSize?: number | undefined;
+        state?: number | undefined;
+        localClose?: number | undefined;
+        remoteClose?: number | undefined;
+        sumDependencyWeight?: number | undefined;
+        weight?: number | undefined;
+    }
+    export interface ServerStreamResponseOptions {
+        endStream?: boolean | undefined;
+        waitForTrailers?: boolean | undefined;
+    }
+    export interface StatOptions {
+        offset: number;
+        length: number;
+    }
+    export interface ServerStreamFileResponseOptions {
+        statCheck?(stats: fs.Stats, headers: OutgoingHttpHeaders, statOptions: StatOptions): void | boolean;
+        waitForTrailers?: boolean | undefined;
+        offset?: number | undefined;
+        length?: number | undefined;
+    }
+    export interface ServerStreamFileResponseOptionsWithError extends ServerStreamFileResponseOptions {
+        onError?(err: NodeJS.ErrnoException): void;
+    }
+    export interface Http2Stream extends stream.Duplex {
+        /**
+         * Set to `true` if the `Http2Stream` instance was aborted abnormally. When set,
+         * the `'aborted'` event will have been emitted.
+         * @since v8.4.0
+         */
+        readonly aborted: boolean;
+        /**
+         * This property shows the number of characters currently buffered to be written.
+         * See `net.Socket.bufferSize` for details.
+         * @since v11.2.0, v10.16.0
+         */
+        readonly bufferSize: number;
+        /**
+         * Set to `true` if the `Http2Stream` instance has been closed.
+         * @since v9.4.0
+         */
+        readonly closed: boolean;
+        /**
+         * Set to `true` if the `Http2Stream` instance has been destroyed and is no longer
+         * usable.
+         * @since v8.4.0
+         */
+        readonly destroyed: boolean;
+        /**
+         * Set the `true` if the `END_STREAM` flag was set in the request or response
+         * HEADERS frame received, indicating that no additional data should be received
+         * and the readable side of the `Http2Stream` will be closed.
+         * @since v10.11.0
+         */
+        readonly endAfterHeaders: boolean;
+        /**
+         * The numeric stream identifier of this `Http2Stream` instance. Set to `undefined`if the stream identifier has not yet been assigned.
+         * @since v8.4.0
+         */
+        readonly id?: number | undefined;
+        /**
+         * Set to `true` if the `Http2Stream` instance has not yet been assigned a
+         * numeric stream identifier.
+         * @since v9.4.0
+         */
+        readonly pending: boolean;
+        /**
+         * Set to the `RST_STREAM` `error code` reported when the `Http2Stream` is
+         * destroyed after either receiving an `RST_STREAM` frame from the connected peer,
+         * calling `http2stream.close()`, or `http2stream.destroy()`. Will be`undefined` if the `Http2Stream` has not been closed.
+         * @since v8.4.0
+         */
+        readonly rstCode: number;
+        /**
+         * An object containing the outbound headers sent for this `Http2Stream`.
+         * @since v9.5.0
+         */
+        readonly sentHeaders: OutgoingHttpHeaders;
+        /**
+         * An array of objects containing the outbound informational (additional) headers
+         * sent for this `Http2Stream`.
+         * @since v9.5.0
+         */
+        readonly sentInfoHeaders?: OutgoingHttpHeaders[] | undefined;
+        /**
+         * An object containing the outbound trailers sent for this `HttpStream`.
+         * @since v9.5.0
+         */
+        readonly sentTrailers?: OutgoingHttpHeaders | undefined;
+        /**
+         * A reference to the `Http2Session` instance that owns this `Http2Stream`. The
+         * value will be `undefined` after the `Http2Stream` instance is destroyed.
+         * @since v8.4.0
+         */
+        readonly session: Http2Session;
+        /**
+         * Provides miscellaneous information about the current state of the`Http2Stream`.
+         *
+         * A current state of this `Http2Stream`.
+         * @since v8.4.0
+         */
+        readonly state: StreamState;
+        /**
+         * Closes the `Http2Stream` instance by sending an `RST_STREAM` frame to the
+         * connected HTTP/2 peer.
+         * @since v8.4.0
+         * @param [code=http2.constants.NGHTTP2_NO_ERROR] Unsigned 32-bit integer identifying the error code.
+         * @param callback An optional function registered to listen for the `'close'` event.
+         */
+        close(code?: number, callback?: () => void): void;
+        /**
+         * Updates the priority for this `Http2Stream` instance.
+         * @since v8.4.0
+         */
+        priority(options: StreamPriorityOptions): void;
+        /**
+         * ```js
+         * const http2 = require('http2');
+         * const client = http2.connect('http://example.org:8000');
+         * const { NGHTTP2_CANCEL } = http2.constants;
+         * const req = client.request({ ':path': '/' });
+         *
+         * // Cancel the stream if there's no activity after 5 seconds
+         * req.setTimeout(5000, () => req.close(NGHTTP2_CANCEL));
+         * ```
+         * @since v8.4.0
+         */
+        setTimeout(msecs: number, callback?: () => void): void;
+        /**
+         * Sends a trailing `HEADERS` frame to the connected HTTP/2 peer. This method
+         * will cause the `Http2Stream` to be immediately closed and must only be
+         * called after the `'wantTrailers'` event has been emitted. When sending a
+         * request or sending a response, the `options.waitForTrailers` option must be set
+         * in order to keep the `Http2Stream` open after the final `DATA` frame so that
+         * trailers can be sent.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   stream.respond(undefined, { waitForTrailers: true });
+         *   stream.on('wantTrailers', () => {
+         *     stream.sendTrailers({ xyz: 'abc' });
+         *   });
+         *   stream.end('Hello World');
+         * });
+         * ```
+         *
+         * The HTTP/1 specification forbids trailers from containing HTTP/2 pseudo-header
+         * fields (e.g. `':method'`, `':path'`, etc).
+         * @since v10.0.0
+         */
+        sendTrailers(headers: OutgoingHttpHeaders): void;
+        addListener(event: 'aborted', listener: () => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        addListener(event: 'drain', listener: () => void): this;
+        addListener(event: 'end', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'finish', listener: () => void): this;
+        addListener(event: 'frameError', listener: (frameType: number, errorCode: number) => void): this;
+        addListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: 'streamClosed', listener: (code: number) => void): this;
+        addListener(event: 'timeout', listener: () => void): this;
+        addListener(event: 'trailers', listener: (trailers: IncomingHttpHeaders, flags: number) => void): this;
+        addListener(event: 'wantTrailers', listener: () => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'aborted'): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'data', chunk: Buffer | string): boolean;
+        emit(event: 'drain'): boolean;
+        emit(event: 'end'): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'finish'): boolean;
+        emit(event: 'frameError', frameType: number, errorCode: number): boolean;
+        emit(event: 'pipe', src: stream.Readable): boolean;
+        emit(event: 'unpipe', src: stream.Readable): boolean;
+        emit(event: 'streamClosed', code: number): boolean;
+        emit(event: 'timeout'): boolean;
+        emit(event: 'trailers', trailers: IncomingHttpHeaders, flags: number): boolean;
+        emit(event: 'wantTrailers'): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'aborted', listener: () => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        on(event: 'drain', listener: () => void): this;
+        on(event: 'end', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'finish', listener: () => void): this;
+        on(event: 'frameError', listener: (frameType: number, errorCode: number) => void): this;
+        on(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        on(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        on(event: 'streamClosed', listener: (code: number) => void): this;
+        on(event: 'timeout', listener: () => void): this;
+        on(event: 'trailers', listener: (trailers: IncomingHttpHeaders, flags: number) => void): this;
+        on(event: 'wantTrailers', listener: () => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'aborted', listener: () => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        once(event: 'drain', listener: () => void): this;
+        once(event: 'end', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'finish', listener: () => void): this;
+        once(event: 'frameError', listener: (frameType: number, errorCode: number) => void): this;
+        once(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        once(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        once(event: 'streamClosed', listener: (code: number) => void): this;
+        once(event: 'timeout', listener: () => void): this;
+        once(event: 'trailers', listener: (trailers: IncomingHttpHeaders, flags: number) => void): this;
+        once(event: 'wantTrailers', listener: () => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'aborted', listener: () => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        prependListener(event: 'drain', listener: () => void): this;
+        prependListener(event: 'end', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'finish', listener: () => void): this;
+        prependListener(event: 'frameError', listener: (frameType: number, errorCode: number) => void): this;
+        prependListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: 'streamClosed', listener: (code: number) => void): this;
+        prependListener(event: 'timeout', listener: () => void): this;
+        prependListener(event: 'trailers', listener: (trailers: IncomingHttpHeaders, flags: number) => void): this;
+        prependListener(event: 'wantTrailers', listener: () => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'aborted', listener: () => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        prependOnceListener(event: 'drain', listener: () => void): this;
+        prependOnceListener(event: 'end', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'finish', listener: () => void): this;
+        prependOnceListener(event: 'frameError', listener: (frameType: number, errorCode: number) => void): this;
+        prependOnceListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: 'streamClosed', listener: (code: number) => void): this;
+        prependOnceListener(event: 'timeout', listener: () => void): this;
+        prependOnceListener(event: 'trailers', listener: (trailers: IncomingHttpHeaders, flags: number) => void): this;
+        prependOnceListener(event: 'wantTrailers', listener: () => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    export interface ClientHttp2Stream extends Http2Stream {
+        addListener(event: 'continue', listener: () => {}): this;
+        addListener(event: 'headers', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        addListener(event: 'push', listener: (headers: IncomingHttpHeaders, flags: number) => void): this;
+        addListener(event: 'response', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'continue'): boolean;
+        emit(event: 'headers', headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number): boolean;
+        emit(event: 'push', headers: IncomingHttpHeaders, flags: number): boolean;
+        emit(event: 'response', headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'continue', listener: () => {}): this;
+        on(event: 'headers', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        on(event: 'push', listener: (headers: IncomingHttpHeaders, flags: number) => void): this;
+        on(event: 'response', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'continue', listener: () => {}): this;
+        once(event: 'headers', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        once(event: 'push', listener: (headers: IncomingHttpHeaders, flags: number) => void): this;
+        once(event: 'response', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'continue', listener: () => {}): this;
+        prependListener(event: 'headers', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        prependListener(event: 'push', listener: (headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependListener(event: 'response', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'continue', listener: () => {}): this;
+        prependOnceListener(event: 'headers', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        prependOnceListener(event: 'push', listener: (headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependOnceListener(event: 'response', listener: (headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    export interface ServerHttp2Stream extends Http2Stream {
+        /**
+         * True if headers were sent, false otherwise (read-only).
+         * @since v8.4.0
+         */
+        readonly headersSent: boolean;
+        /**
+         * Read-only property mapped to the `SETTINGS_ENABLE_PUSH` flag of the remote
+         * client's most recent `SETTINGS` frame. Will be `true` if the remote peer
+         * accepts push streams, `false` otherwise. Settings are the same for every`Http2Stream` in the same `Http2Session`.
+         * @since v8.4.0
+         */
+        readonly pushAllowed: boolean;
+        /**
+         * Sends an additional informational `HEADERS` frame to the connected HTTP/2 peer.
+         * @since v8.4.0
+         */
+        additionalHeaders(headers: OutgoingHttpHeaders): void;
+        /**
+         * Initiates a push stream. The callback is invoked with the new `Http2Stream`instance created for the push stream passed as the second argument, or an`Error` passed as the first argument.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   stream.respond({ ':status': 200 });
+         *   stream.pushStream({ ':path': '/' }, (err, pushStream, headers) => {
+         *     if (err) throw err;
+         *     pushStream.respond({ ':status': 200 });
+         *     pushStream.end('some pushed data');
+         *   });
+         *   stream.end('some data');
+         * });
+         * ```
+         *
+         * Setting the weight of a push stream is not allowed in the `HEADERS` frame. Pass
+         * a `weight` value to `http2stream.priority` with the `silent` option set to`true` to enable server-side bandwidth balancing between concurrent streams.
+         *
+         * Calling `http2stream.pushStream()` from within a pushed stream is not permitted
+         * and will throw an error.
+         * @since v8.4.0
+         * @param callback Callback that is called once the push stream has been initiated.
+         */
+        pushStream(headers: OutgoingHttpHeaders, callback?: (err: Error | null, pushStream: ServerHttp2Stream, headers: OutgoingHttpHeaders) => void): void;
+        pushStream(headers: OutgoingHttpHeaders, options?: StreamPriorityOptions, callback?: (err: Error | null, pushStream: ServerHttp2Stream, headers: OutgoingHttpHeaders) => void): void;
+        /**
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   stream.respond({ ':status': 200 });
+         *   stream.end('some data');
+         * });
+         * ```
+         *
+         * When the `options.waitForTrailers` option is set, the `'wantTrailers'` event
+         * will be emitted immediately after queuing the last chunk of payload data to be
+         * sent. The `http2stream.sendTrailers()` method can then be used to sent trailing
+         * header fields to the peer.
+         *
+         * When `options.waitForTrailers` is set, the `Http2Stream` will not automatically
+         * close when the final `DATA` frame is transmitted. User code must call either`http2stream.sendTrailers()` or `http2stream.close()` to close the`Http2Stream`.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   stream.respond({ ':status': 200 }, { waitForTrailers: true });
+         *   stream.on('wantTrailers', () => {
+         *     stream.sendTrailers({ ABC: 'some value to send' });
+         *   });
+         *   stream.end('some data');
+         * });
+         * ```
+         * @since v8.4.0
+         */
+        respond(headers?: OutgoingHttpHeaders, options?: ServerStreamResponseOptions): void;
+        /**
+         * Initiates a response whose data is read from the given file descriptor. No
+         * validation is performed on the given file descriptor. If an error occurs while
+         * attempting to read data using the file descriptor, the `Http2Stream` will be
+         * closed using an `RST_STREAM` frame using the standard `INTERNAL_ERROR` code.
+         *
+         * When used, the `Http2Stream` object's `Duplex` interface will be closed
+         * automatically.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const fs = require('fs');
+         *
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   const fd = fs.openSync('/some/file', 'r');
+         *
+         *   const stat = fs.fstatSync(fd);
+         *   const headers = {
+         *     'content-length': stat.size,
+         *     'last-modified': stat.mtime.toUTCString(),
+         *     'content-type': 'text/plain; charset=utf-8'
+         *   };
+         *   stream.respondWithFD(fd, headers);
+         *   stream.on('close', () => fs.closeSync(fd));
+         * });
+         * ```
+         *
+         * The optional `options.statCheck` function may be specified to give user code
+         * an opportunity to set additional content headers based on the `fs.Stat` details
+         * of the given fd. If the `statCheck` function is provided, the`http2stream.respondWithFD()` method will perform an `fs.fstat()` call to
+         * collect details on the provided file descriptor.
+         *
+         * The `offset` and `length` options may be used to limit the response to a
+         * specific range subset. This can be used, for instance, to support HTTP Range
+         * requests.
+         *
+         * The file descriptor or `FileHandle` is not closed when the stream is closed,
+         * so it will need to be closed manually once it is no longer needed.
+         * Using the same file descriptor concurrently for multiple streams
+         * is not supported and may result in data loss. Re-using a file descriptor
+         * after a stream has finished is supported.
+         *
+         * When the `options.waitForTrailers` option is set, the `'wantTrailers'` event
+         * will be emitted immediately after queuing the last chunk of payload data to be
+         * sent. The `http2stream.sendTrailers()` method can then be used to sent trailing
+         * header fields to the peer.
+         *
+         * When `options.waitForTrailers` is set, the `Http2Stream` will not automatically
+         * close when the final `DATA` frame is transmitted. User code _must_ call either`http2stream.sendTrailers()` or `http2stream.close()` to close the`Http2Stream`.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const fs = require('fs');
+         *
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   const fd = fs.openSync('/some/file', 'r');
+         *
+         *   const stat = fs.fstatSync(fd);
+         *   const headers = {
+         *     'content-length': stat.size,
+         *     'last-modified': stat.mtime.toUTCString(),
+         *     'content-type': 'text/plain; charset=utf-8'
+         *   };
+         *   stream.respondWithFD(fd, headers, { waitForTrailers: true });
+         *   stream.on('wantTrailers', () => {
+         *     stream.sendTrailers({ ABC: 'some value to send' });
+         *   });
+         *
+         *   stream.on('close', () => fs.closeSync(fd));
+         * });
+         * ```
+         * @since v8.4.0
+         * @param fd A readable file descriptor.
+         */
+        respondWithFD(fd: number | fs.promises.FileHandle, headers?: OutgoingHttpHeaders, options?: ServerStreamFileResponseOptions): void;
+        /**
+         * Sends a regular file as the response. The `path` must specify a regular file
+         * or an `'error'` event will be emitted on the `Http2Stream` object.
+         *
+         * When used, the `Http2Stream` object's `Duplex` interface will be closed
+         * automatically.
+         *
+         * The optional `options.statCheck` function may be specified to give user code
+         * an opportunity to set additional content headers based on the `fs.Stat` details
+         * of the given file:
+         *
+         * If an error occurs while attempting to read the file data, the `Http2Stream`will be closed using an `RST_STREAM` frame using the standard `INTERNAL_ERROR`code. If the `onError` callback is
+         * defined, then it will be called. Otherwise
+         * the stream will be destroyed.
+         *
+         * Example using a file path:
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   function statCheck(stat, headers) {
+         *     headers['last-modified'] = stat.mtime.toUTCString();
+         *   }
+         *
+         *   function onError(err) {
+         *     // stream.respond() can throw if the stream has been destroyed by
+         *     // the other side.
+         *     try {
+         *       if (err.code === 'ENOENT') {
+         *         stream.respond({ ':status': 404 });
+         *       } else {
+         *         stream.respond({ ':status': 500 });
+         *       }
+         *     } catch (err) {
+         *       // Perform actual error handling.
+         *       console.log(err);
+         *     }
+         *     stream.end();
+         *   }
+         *
+         *   stream.respondWithFile('/some/file',
+         *                          { 'content-type': 'text/plain; charset=utf-8' },
+         *                          { statCheck, onError });
+         * });
+         * ```
+         *
+         * The `options.statCheck` function may also be used to cancel the send operation
+         * by returning `false`. For instance, a conditional request may check the stat
+         * results to determine if the file has been modified to return an appropriate`304` response:
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   function statCheck(stat, headers) {
+         *     // Check the stat here...
+         *     stream.respond({ ':status': 304 });
+         *     return false; // Cancel the send operation
+         *   }
+         *   stream.respondWithFile('/some/file',
+         *                          { 'content-type': 'text/plain; charset=utf-8' },
+         *                          { statCheck });
+         * });
+         * ```
+         *
+         * The `content-length` header field will be automatically set.
+         *
+         * The `offset` and `length` options may be used to limit the response to a
+         * specific range subset. This can be used, for instance, to support HTTP Range
+         * requests.
+         *
+         * The `options.onError` function may also be used to handle all the errors
+         * that could happen before the delivery of the file is initiated. The
+         * default behavior is to destroy the stream.
+         *
+         * When the `options.waitForTrailers` option is set, the `'wantTrailers'` event
+         * will be emitted immediately after queuing the last chunk of payload data to be
+         * sent. The `http2stream.sendTrailers()` method can then be used to sent trailing
+         * header fields to the peer.
+         *
+         * When `options.waitForTrailers` is set, the `Http2Stream` will not automatically
+         * close when the final `DATA` frame is transmitted. User code must call either`http2stream.sendTrailers()` or `http2stream.close()` to close the`Http2Stream`.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer();
+         * server.on('stream', (stream) => {
+         *   stream.respondWithFile('/some/file',
+         *                          { 'content-type': 'text/plain; charset=utf-8' },
+         *                          { waitForTrailers: true });
+         *   stream.on('wantTrailers', () => {
+         *     stream.sendTrailers({ ABC: 'some value to send' });
+         *   });
+         * });
+         * ```
+         * @since v8.4.0
+         */
+        respondWithFile(path: string, headers?: OutgoingHttpHeaders, options?: ServerStreamFileResponseOptionsWithError): void;
+    }
+    // Http2Session
+    export interface Settings {
+        headerTableSize?: number | undefined;
+        enablePush?: boolean | undefined;
+        initialWindowSize?: number | undefined;
+        maxFrameSize?: number | undefined;
+        maxConcurrentStreams?: number | undefined;
+        maxHeaderListSize?: number | undefined;
+        enableConnectProtocol?: boolean | undefined;
+    }
+    export interface ClientSessionRequestOptions {
+        endStream?: boolean | undefined;
+        exclusive?: boolean | undefined;
+        parent?: number | undefined;
+        weight?: number | undefined;
+        waitForTrailers?: boolean | undefined;
+    }
+    export interface SessionState {
+        effectiveLocalWindowSize?: number | undefined;
+        effectiveRecvDataLength?: number | undefined;
+        nextStreamID?: number | undefined;
+        localWindowSize?: number | undefined;
+        lastProcStreamID?: number | undefined;
+        remoteWindowSize?: number | undefined;
+        outboundQueueSize?: number | undefined;
+        deflateDynamicTableSize?: number | undefined;
+        inflateDynamicTableSize?: number | undefined;
+    }
+    export interface Http2Session extends EventEmitter {
+        /**
+         * Value will be `undefined` if the `Http2Session` is not yet connected to a
+         * socket, `h2c` if the `Http2Session` is not connected to a `TLSSocket`, or
+         * will return the value of the connected `TLSSocket`'s own `alpnProtocol`property.
+         * @since v9.4.0
+         */
+        readonly alpnProtocol?: string | undefined;
+        /**
+         * Will be `true` if this `Http2Session` instance has been closed, otherwise`false`.
+         * @since v9.4.0
+         */
+        readonly closed: boolean;
+        /**
+         * Will be `true` if this `Http2Session` instance is still connecting, will be set
+         * to `false` before emitting `connect` event and/or calling the `http2.connect`callback.
+         * @since v10.0.0
+         */
+        readonly connecting: boolean;
+        /**
+         * Will be `true` if this `Http2Session` instance has been destroyed and must no
+         * longer be used, otherwise `false`.
+         * @since v8.4.0
+         */
+        readonly destroyed: boolean;
+        /**
+         * Value is `undefined` if the `Http2Session` session socket has not yet been
+         * connected, `true` if the `Http2Session` is connected with a `TLSSocket`,
+         * and `false` if the `Http2Session` is connected to any other kind of socket
+         * or stream.
+         * @since v9.4.0
+         */
+        readonly encrypted?: boolean | undefined;
+        /**
+         * A prototype-less object describing the current local settings of this`Http2Session`. The local settings are local to _this_`Http2Session` instance.
+         * @since v8.4.0
+         */
+        readonly localSettings: Settings;
+        /**
+         * If the `Http2Session` is connected to a `TLSSocket`, the `originSet` property
+         * will return an `Array` of origins for which the `Http2Session` may be
+         * considered authoritative.
+         *
+         * The `originSet` property is only available when using a secure TLS connection.
+         * @since v9.4.0
+         */
+        readonly originSet?: string[] | undefined;
+        /**
+         * Indicates whether the `Http2Session` is currently waiting for acknowledgment of
+         * a sent `SETTINGS` frame. Will be `true` after calling the`http2session.settings()` method. Will be `false` once all sent `SETTINGS`frames have been acknowledged.
+         * @since v8.4.0
+         */
+        readonly pendingSettingsAck: boolean;
+        /**
+         * A prototype-less object describing the current remote settings of this`Http2Session`. The remote settings are set by the _connected_ HTTP/2 peer.
+         * @since v8.4.0
+         */
+        readonly remoteSettings: Settings;
+        /**
+         * Returns a `Proxy` object that acts as a `net.Socket` (or `tls.TLSSocket`) but
+         * limits available methods to ones safe to use with HTTP/2.
+         *
+         * `destroy`, `emit`, `end`, `pause`, `read`, `resume`, and `write` will throw
+         * an error with code `ERR_HTTP2_NO_SOCKET_MANIPULATION`. See `Http2Session and Sockets` for more information.
+         *
+         * `setTimeout` method will be called on this `Http2Session`.
+         *
+         * All other interactions will be routed directly to the socket.
+         * @since v8.4.0
+         */
+        readonly socket: net.Socket | tls.TLSSocket;
+        /**
+         * Provides miscellaneous information about the current state of the`Http2Session`.
+         *
+         * An object describing the current status of this `Http2Session`.
+         * @since v8.4.0
+         */
+        readonly state: SessionState;
+        /**
+         * The `http2session.type` will be equal to`http2.constants.NGHTTP2_SESSION_SERVER` if this `Http2Session` instance is a
+         * server, and `http2.constants.NGHTTP2_SESSION_CLIENT` if the instance is a
+         * client.
+         * @since v8.4.0
+         */
+        readonly type: number;
+        /**
+         * Gracefully closes the `Http2Session`, allowing any existing streams to
+         * complete on their own and preventing new `Http2Stream` instances from being
+         * created. Once closed, `http2session.destroy()`_might_ be called if there
+         * are no open `Http2Stream` instances.
+         *
+         * If specified, the `callback` function is registered as a handler for the`'close'` event.
+         * @since v9.4.0
+         */
+        close(callback?: () => void): void;
+        /**
+         * Immediately terminates the `Http2Session` and the associated `net.Socket` or`tls.TLSSocket`.
+         *
+         * Once destroyed, the `Http2Session` will emit the `'close'` event. If `error`is not undefined, an `'error'` event will be emitted immediately before the`'close'` event.
+         *
+         * If there are any remaining open `Http2Streams` associated with the`Http2Session`, those will also be destroyed.
+         * @since v8.4.0
+         * @param error An `Error` object if the `Http2Session` is being destroyed due to an error.
+         * @param code The HTTP/2 error code to send in the final `GOAWAY` frame. If unspecified, and `error` is not undefined, the default is `INTERNAL_ERROR`, otherwise defaults to `NO_ERROR`.
+         */
+        destroy(error?: Error, code?: number): void;
+        /**
+         * Transmits a `GOAWAY` frame to the connected peer _without_ shutting down the`Http2Session`.
+         * @since v9.4.0
+         * @param code An HTTP/2 error code
+         * @param lastStreamID The numeric ID of the last processed `Http2Stream`
+         * @param opaqueData A `TypedArray` or `DataView` instance containing additional data to be carried within the `GOAWAY` frame.
+         */
+        goaway(code?: number, lastStreamID?: number, opaqueData?: NodeJS.ArrayBufferView): void;
+        /**
+         * Sends a `PING` frame to the connected HTTP/2 peer. A `callback` function must
+         * be provided. The method will return `true` if the `PING` was sent, `false`otherwise.
+         *
+         * The maximum number of outstanding (unacknowledged) pings is determined by the`maxOutstandingPings` configuration option. The default maximum is 10.
+         *
+         * If provided, the `payload` must be a `Buffer`, `TypedArray`, or `DataView`containing 8 bytes of data that will be transmitted with the `PING` and
+         * returned with the ping acknowledgment.
+         *
+         * The callback will be invoked with three arguments: an error argument that will
+         * be `null` if the `PING` was successfully acknowledged, a `duration` argument
+         * that reports the number of milliseconds elapsed since the ping was sent and the
+         * acknowledgment was received, and a `Buffer` containing the 8-byte `PING`payload.
+         *
+         * ```js
+         * session.ping(Buffer.from('abcdefgh'), (err, duration, payload) => {
+         *   if (!err) {
+         *     console.log(`Ping acknowledged in ${duration} milliseconds`);
+         *     console.log(`With payload '${payload.toString()}'`);
+         *   }
+         * });
+         * ```
+         *
+         * If the `payload` argument is not specified, the default payload will be the
+         * 64-bit timestamp (little endian) marking the start of the `PING` duration.
+         * @since v8.9.3
+         * @param payload Optional ping payload.
+         */
+        ping(callback: (err: Error | null, duration: number, payload: Buffer) => void): boolean;
+        ping(payload: NodeJS.ArrayBufferView, callback: (err: Error | null, duration: number, payload: Buffer) => void): boolean;
+        /**
+         * Calls `ref()` on this `Http2Session`instance's underlying `net.Socket`.
+         * @since v9.4.0
+         */
+        ref(): void;
+        /**
+         * Sets the local endpoint's window size.
+         * The `windowSize` is the total window size to set, not
+         * the delta.
+         *
+         * ```js
+         * const http2 = require('http2');
+         *
+         * const server = http2.createServer();
+         * const expectedWindowSize = 2 ** 20;
+         * server.on('connect', (session) => {
+         *
+         *   // Set local window size to be 2 ** 20
+         *   session.setLocalWindowSize(expectedWindowSize);
+         * });
+         * ```
+         * @since v15.3.0, v14.18.0
+         */
+        setLocalWindowSize(windowSize: number): void;
+        /**
+         * Used to set a callback function that is called when there is no activity on
+         * the `Http2Session` after `msecs` milliseconds. The given `callback` is
+         * registered as a listener on the `'timeout'` event.
+         * @since v8.4.0
+         */
+        setTimeout(msecs: number, callback?: () => void): void;
+        /**
+         * Updates the current local settings for this `Http2Session` and sends a new`SETTINGS` frame to the connected HTTP/2 peer.
+         *
+         * Once called, the `http2session.pendingSettingsAck` property will be `true`while the session is waiting for the remote peer to acknowledge the new
+         * settings.
+         *
+         * The new settings will not become effective until the `SETTINGS` acknowledgment
+         * is received and the `'localSettings'` event is emitted. It is possible to send
+         * multiple `SETTINGS` frames while acknowledgment is still pending.
+         * @since v8.4.0
+         * @param callback Callback that is called once the session is connected or right away if the session is already connected.
+         */
+        settings(settings: Settings): void;
+        /**
+         * Calls `unref()` on this `Http2Session`instance's underlying `net.Socket`.
+         * @since v9.4.0
+         */
+        unref(): void;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'frameError', listener: (frameType: number, errorCode: number, streamID: number) => void): this;
+        addListener(event: 'goaway', listener: (errorCode: number, lastStreamID: number, opaqueData: Buffer) => void): this;
+        addListener(event: 'localSettings', listener: (settings: Settings) => void): this;
+        addListener(event: 'ping', listener: () => void): this;
+        addListener(event: 'remoteSettings', listener: (settings: Settings) => void): this;
+        addListener(event: 'timeout', listener: () => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'close'): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'frameError', frameType: number, errorCode: number, streamID: number): boolean;
+        emit(event: 'goaway', errorCode: number, lastStreamID: number, opaqueData: Buffer): boolean;
+        emit(event: 'localSettings', settings: Settings): boolean;
+        emit(event: 'ping'): boolean;
+        emit(event: 'remoteSettings', settings: Settings): boolean;
+        emit(event: 'timeout'): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'frameError', listener: (frameType: number, errorCode: number, streamID: number) => void): this;
+        on(event: 'goaway', listener: (errorCode: number, lastStreamID: number, opaqueData: Buffer) => void): this;
+        on(event: 'localSettings', listener: (settings: Settings) => void): this;
+        on(event: 'ping', listener: () => void): this;
+        on(event: 'remoteSettings', listener: (settings: Settings) => void): this;
+        on(event: 'timeout', listener: () => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'frameError', listener: (frameType: number, errorCode: number, streamID: number) => void): this;
+        once(event: 'goaway', listener: (errorCode: number, lastStreamID: number, opaqueData: Buffer) => void): this;
+        once(event: 'localSettings', listener: (settings: Settings) => void): this;
+        once(event: 'ping', listener: () => void): this;
+        once(event: 'remoteSettings', listener: (settings: Settings) => void): this;
+        once(event: 'timeout', listener: () => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'frameError', listener: (frameType: number, errorCode: number, streamID: number) => void): this;
+        prependListener(event: 'goaway', listener: (errorCode: number, lastStreamID: number, opaqueData: Buffer) => void): this;
+        prependListener(event: 'localSettings', listener: (settings: Settings) => void): this;
+        prependListener(event: 'ping', listener: () => void): this;
+        prependListener(event: 'remoteSettings', listener: (settings: Settings) => void): this;
+        prependListener(event: 'timeout', listener: () => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'frameError', listener: (frameType: number, errorCode: number, streamID: number) => void): this;
+        prependOnceListener(event: 'goaway', listener: (errorCode: number, lastStreamID: number, opaqueData: Buffer) => void): this;
+        prependOnceListener(event: 'localSettings', listener: (settings: Settings) => void): this;
+        prependOnceListener(event: 'ping', listener: () => void): this;
+        prependOnceListener(event: 'remoteSettings', listener: (settings: Settings) => void): this;
+        prependOnceListener(event: 'timeout', listener: () => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    export interface ClientHttp2Session extends Http2Session {
+        /**
+         * For HTTP/2 Client `Http2Session` instances only, the `http2session.request()`creates and returns an `Http2Stream` instance that can be used to send an
+         * HTTP/2 request to the connected server.
+         *
+         * This method is only available if `http2session.type` is equal to`http2.constants.NGHTTP2_SESSION_CLIENT`.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const clientSession = http2.connect('https://localhost:1234');
+         * const {
+         *   HTTP2_HEADER_PATH,
+         *   HTTP2_HEADER_STATUS
+         * } = http2.constants;
+         *
+         * const req = clientSession.request({ [HTTP2_HEADER_PATH]: '/' });
+         * req.on('response', (headers) => {
+         *   console.log(headers[HTTP2_HEADER_STATUS]);
+         *   req.on('data', (chunk) => { // ..  });
+         *   req.on('end', () => { // ..  });
+         * });
+         * ```
+         *
+         * When the `options.waitForTrailers` option is set, the `'wantTrailers'` event
+         * is emitted immediately after queuing the last chunk of payload data to be sent.
+         * The `http2stream.sendTrailers()` method can then be called to send trailing
+         * headers to the peer.
+         *
+         * When `options.waitForTrailers` is set, the `Http2Stream` will not automatically
+         * close when the final `DATA` frame is transmitted. User code must call either`http2stream.sendTrailers()` or `http2stream.close()` to close the`Http2Stream`.
+         *
+         * When `options.signal` is set with an `AbortSignal` and then `abort` on the
+         * corresponding `AbortController` is called, the request will emit an `'error'`event with an `AbortError` error.
+         *
+         * The `:method` and `:path` pseudo-headers are not specified within `headers`,
+         * they respectively default to:
+         *
+         * * `:method` \= `'GET'`
+         * * `:path` \= `/`
+         * @since v8.4.0
+         */
+        request(headers?: OutgoingHttpHeaders, options?: ClientSessionRequestOptions): ClientHttp2Stream;
+        addListener(event: 'altsvc', listener: (alt: string, origin: string, stream: number) => void): this;
+        addListener(event: 'origin', listener: (origins: string[]) => void): this;
+        addListener(event: 'connect', listener: (session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        addListener(event: 'stream', listener: (stream: ClientHttp2Stream, headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'altsvc', alt: string, origin: string, stream: number): boolean;
+        emit(event: 'origin', origins: ReadonlyArray<string>): boolean;
+        emit(event: 'connect', session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket): boolean;
+        emit(event: 'stream', stream: ClientHttp2Stream, headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'altsvc', listener: (alt: string, origin: string, stream: number) => void): this;
+        on(event: 'origin', listener: (origins: string[]) => void): this;
+        on(event: 'connect', listener: (session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        on(event: 'stream', listener: (stream: ClientHttp2Stream, headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'altsvc', listener: (alt: string, origin: string, stream: number) => void): this;
+        once(event: 'origin', listener: (origins: string[]) => void): this;
+        once(event: 'connect', listener: (session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        once(event: 'stream', listener: (stream: ClientHttp2Stream, headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'altsvc', listener: (alt: string, origin: string, stream: number) => void): this;
+        prependListener(event: 'origin', listener: (origins: string[]) => void): this;
+        prependListener(event: 'connect', listener: (session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        prependListener(event: 'stream', listener: (stream: ClientHttp2Stream, headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'altsvc', listener: (alt: string, origin: string, stream: number) => void): this;
+        prependOnceListener(event: 'origin', listener: (origins: string[]) => void): this;
+        prependOnceListener(event: 'connect', listener: (session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        prependOnceListener(event: 'stream', listener: (stream: ClientHttp2Stream, headers: IncomingHttpHeaders & IncomingHttpStatusHeader, flags: number) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    export interface AlternativeServiceOptions {
+        origin: number | string | url.URL;
+    }
+    export interface ServerHttp2Session extends Http2Session {
+        readonly server: Http2Server | Http2SecureServer;
+        /**
+         * Submits an `ALTSVC` frame (as defined by [RFC 7838](https://tools.ietf.org/html/rfc7838)) to the connected client.
+         *
+         * ```js
+         * const http2 = require('http2');
+         *
+         * const server = http2.createServer();
+         * server.on('session', (session) => {
+         *   // Set altsvc for origin https://example.org:80
+         *   session.altsvc('h2=":8000"', 'https://example.org:80');
+         * });
+         *
+         * server.on('stream', (stream) => {
+         *   // Set altsvc for a specific stream
+         *   stream.session.altsvc('h2=":8000"', stream.id);
+         * });
+         * ```
+         *
+         * Sending an `ALTSVC` frame with a specific stream ID indicates that the alternate
+         * service is associated with the origin of the given `Http2Stream`.
+         *
+         * The `alt` and origin string _must_ contain only ASCII bytes and are
+         * strictly interpreted as a sequence of ASCII bytes. The special value `'clear'`may be passed to clear any previously set alternative service for a given
+         * domain.
+         *
+         * When a string is passed for the `originOrStream` argument, it will be parsed as
+         * a URL and the origin will be derived. For instance, the origin for the
+         * HTTP URL `'https://example.org/foo/bar'` is the ASCII string`'https://example.org'`. An error will be thrown if either the given string
+         * cannot be parsed as a URL or if a valid origin cannot be derived.
+         *
+         * A `URL` object, or any object with an `origin` property, may be passed as`originOrStream`, in which case the value of the `origin` property will be
+         * used. The value of the `origin` property _must_ be a properly serialized
+         * ASCII origin.
+         * @since v9.4.0
+         * @param alt A description of the alternative service configuration as defined by `RFC 7838`.
+         * @param originOrStream Either a URL string specifying the origin (or an `Object` with an `origin` property) or the numeric identifier of an active `Http2Stream` as given by the
+         * `http2stream.id` property.
+         */
+        altsvc(alt: string, originOrStream: number | string | url.URL | AlternativeServiceOptions): void;
+        /**
+         * Submits an `ORIGIN` frame (as defined by [RFC 8336](https://tools.ietf.org/html/rfc8336)) to the connected client
+         * to advertise the set of origins for which the server is capable of providing
+         * authoritative responses.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const options = getSecureOptionsSomehow();
+         * const server = http2.createSecureServer(options);
+         * server.on('stream', (stream) => {
+         *   stream.respond();
+         *   stream.end('ok');
+         * });
+         * server.on('session', (session) => {
+         *   session.origin('https://example.com', 'https://example.org');
+         * });
+         * ```
+         *
+         * When a string is passed as an `origin`, it will be parsed as a URL and the
+         * origin will be derived. For instance, the origin for the HTTP URL`'https://example.org/foo/bar'` is the ASCII string`'https://example.org'`. An error will be thrown if either the given
+         * string
+         * cannot be parsed as a URL or if a valid origin cannot be derived.
+         *
+         * A `URL` object, or any object with an `origin` property, may be passed as
+         * an `origin`, in which case the value of the `origin` property will be
+         * used. The value of the `origin` property _must_ be a properly serialized
+         * ASCII origin.
+         *
+         * Alternatively, the `origins` option may be used when creating a new HTTP/2
+         * server using the `http2.createSecureServer()` method:
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const options = getSecureOptionsSomehow();
+         * options.origins = ['https://example.com', 'https://example.org'];
+         * const server = http2.createSecureServer(options);
+         * server.on('stream', (stream) => {
+         *   stream.respond();
+         *   stream.end('ok');
+         * });
+         * ```
+         * @since v10.12.0
+         * @param origins One or more URL Strings passed as separate arguments.
+         */
+        origin(
+            ...origins: Array<
+                | string
+                | url.URL
+                | {
+                      origin: string;
+                  }
+            >
+        ): void;
+        addListener(event: 'connect', listener: (session: ServerHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        addListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'connect', session: ServerHttp2Session, socket: net.Socket | tls.TLSSocket): boolean;
+        emit(event: 'stream', stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'connect', listener: (session: ServerHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        on(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'connect', listener: (session: ServerHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        once(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'connect', listener: (session: ServerHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        prependListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'connect', listener: (session: ServerHttp2Session, socket: net.Socket | tls.TLSSocket) => void): this;
+        prependOnceListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    // Http2Server
+    export interface SessionOptions {
+        maxDeflateDynamicTableSize?: number | undefined;
+        maxSessionMemory?: number | undefined;
+        maxHeaderListPairs?: number | undefined;
+        maxOutstandingPings?: number | undefined;
+        maxSendHeaderBlockLength?: number | undefined;
+        paddingStrategy?: number | undefined;
+        peerMaxConcurrentStreams?: number | undefined;
+        settings?: Settings | undefined;
+        /**
+         * Specifies a timeout in milliseconds that
+         * a server should wait when an [`'unknownProtocol'`][] is emitted. If the
+         * socket has not been destroyed by that time the server will destroy it.
+         * @default 100000
+         */
+        unknownProtocolTimeout?: number | undefined;
+        selectPadding?(frameLen: number, maxFrameLen: number): number;
+        createConnection?(authority: url.URL, option: SessionOptions): stream.Duplex;
+    }
+    export interface ClientSessionOptions extends SessionOptions {
+        maxReservedRemoteStreams?: number | undefined;
+        createConnection?: ((authority: url.URL, option: SessionOptions) => stream.Duplex) | undefined;
+        protocol?: 'http:' | 'https:' | undefined;
+    }
+    export interface ServerSessionOptions extends SessionOptions {
+        Http1IncomingMessage?: typeof IncomingMessage | undefined;
+        Http1ServerResponse?: typeof ServerResponse | undefined;
+        Http2ServerRequest?: typeof Http2ServerRequest | undefined;
+        Http2ServerResponse?: typeof Http2ServerResponse | undefined;
+    }
+    export interface SecureClientSessionOptions extends ClientSessionOptions, tls.ConnectionOptions {}
+    export interface SecureServerSessionOptions extends ServerSessionOptions, tls.TlsOptions {}
+    export interface ServerOptions extends ServerSessionOptions {}
+    export interface SecureServerOptions extends SecureServerSessionOptions {
+        allowHTTP1?: boolean | undefined;
+        origins?: string[] | undefined;
+    }
+    interface HTTP2ServerCommon {
+        setTimeout(msec?: number, callback?: () => void): this;
+        /**
+         * Throws ERR_HTTP2_INVALID_SETTING_VALUE for invalid settings values.
+         * Throws ERR_INVALID_ARG_TYPE for invalid settings argument.
+         */
+        updateSettings(settings: Settings): void;
+    }
+    export interface Http2Server extends net.Server, HTTP2ServerCommon {
+        addListener(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        addListener(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        addListener(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        addListener(event: 'sessionError', listener: (err: Error) => void): this;
+        addListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        addListener(event: 'timeout', listener: () => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'checkContinue', request: Http2ServerRequest, response: Http2ServerResponse): boolean;
+        emit(event: 'request', request: Http2ServerRequest, response: Http2ServerResponse): boolean;
+        emit(event: 'session', session: ServerHttp2Session): boolean;
+        emit(event: 'sessionError', err: Error): boolean;
+        emit(event: 'stream', stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number): boolean;
+        emit(event: 'timeout'): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        on(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        on(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        on(event: 'sessionError', listener: (err: Error) => void): this;
+        on(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        on(event: 'timeout', listener: () => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        once(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        once(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        once(event: 'sessionError', listener: (err: Error) => void): this;
+        once(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        once(event: 'timeout', listener: () => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependListener(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependListener(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        prependListener(event: 'sessionError', listener: (err: Error) => void): this;
+        prependListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependListener(event: 'timeout', listener: () => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependOnceListener(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependOnceListener(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        prependOnceListener(event: 'sessionError', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependOnceListener(event: 'timeout', listener: () => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    export interface Http2SecureServer extends tls.Server, HTTP2ServerCommon {
+        addListener(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        addListener(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        addListener(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        addListener(event: 'sessionError', listener: (err: Error) => void): this;
+        addListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        addListener(event: 'timeout', listener: () => void): this;
+        addListener(event: 'unknownProtocol', listener: (socket: tls.TLSSocket) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'checkContinue', request: Http2ServerRequest, response: Http2ServerResponse): boolean;
+        emit(event: 'request', request: Http2ServerRequest, response: Http2ServerResponse): boolean;
+        emit(event: 'session', session: ServerHttp2Session): boolean;
+        emit(event: 'sessionError', err: Error): boolean;
+        emit(event: 'stream', stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number): boolean;
+        emit(event: 'timeout'): boolean;
+        emit(event: 'unknownProtocol', socket: tls.TLSSocket): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        on(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        on(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        on(event: 'sessionError', listener: (err: Error) => void): this;
+        on(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        on(event: 'timeout', listener: () => void): this;
+        on(event: 'unknownProtocol', listener: (socket: tls.TLSSocket) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        once(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        once(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        once(event: 'sessionError', listener: (err: Error) => void): this;
+        once(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        once(event: 'timeout', listener: () => void): this;
+        once(event: 'unknownProtocol', listener: (socket: tls.TLSSocket) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependListener(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependListener(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        prependListener(event: 'sessionError', listener: (err: Error) => void): this;
+        prependListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependListener(event: 'timeout', listener: () => void): this;
+        prependListener(event: 'unknownProtocol', listener: (socket: tls.TLSSocket) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'checkContinue', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependOnceListener(event: 'request', listener: (request: Http2ServerRequest, response: Http2ServerResponse) => void): this;
+        prependOnceListener(event: 'session', listener: (session: ServerHttp2Session) => void): this;
+        prependOnceListener(event: 'sessionError', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'stream', listener: (stream: ServerHttp2Stream, headers: IncomingHttpHeaders, flags: number) => void): this;
+        prependOnceListener(event: 'timeout', listener: () => void): this;
+        prependOnceListener(event: 'unknownProtocol', listener: (socket: tls.TLSSocket) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    /**
+     * A `Http2ServerRequest` object is created by {@link Server} or {@link SecureServer} and passed as the first argument to the `'request'` event. It may be used to access a request status,
+     * headers, and
+     * data.
+     * @since v8.4.0
+     */
+    export class Http2ServerRequest extends stream.Readable {
+        constructor(stream: ServerHttp2Stream, headers: IncomingHttpHeaders, options: stream.ReadableOptions, rawHeaders: ReadonlyArray<string>);
+        /**
+         * The `request.aborted` property will be `true` if the request has
+         * been aborted.
+         * @since v10.1.0
+         */
+        readonly aborted: boolean;
+        /**
+         * The request authority pseudo header field. Because HTTP/2 allows requests
+         * to set either `:authority` or `host`, this value is derived from`req.headers[':authority']` if present. Otherwise, it is derived from`req.headers['host']`.
+         * @since v8.4.0
+         */
+        readonly authority: string;
+        /**
+         * See `request.socket`.
+         * @since v8.4.0
+         * @deprecated Since v13.0.0 - Use `socket`.
+         */
+        readonly connection: net.Socket | tls.TLSSocket;
+        /**
+         * The `request.complete` property will be `true` if the request has
+         * been completed, aborted, or destroyed.
+         * @since v12.10.0
+         */
+        readonly complete: boolean;
+        /**
+         * The request/response headers object.
+         *
+         * Key-value pairs of header names and values. Header names are lower-cased.
+         *
+         * ```js
+         * // Prints something like:
+         * //
+         * // { 'user-agent': 'curl/7.22.0',
+         * //   host: '127.0.0.1:8000',
+         * //   accept: '*' }
+         * console.log(request.headers);
+         * ```
+         *
+         * See `HTTP/2 Headers Object`.
+         *
+         * In HTTP/2, the request path, host name, protocol, and method are represented as
+         * special headers prefixed with the `:` character (e.g. `':path'`). These special
+         * headers will be included in the `request.headers` object. Care must be taken not
+         * to inadvertently modify these special headers or errors may occur. For instance,
+         * removing all headers from the request will cause errors to occur:
+         *
+         * ```js
+         * removeAllHeaders(request.headers);
+         * assert(request.url);   // Fails because the :path header has been removed
+         * ```
+         * @since v8.4.0
+         */
+        readonly headers: IncomingHttpHeaders;
+        /**
+         * In case of server request, the HTTP version sent by the client. In the case of
+         * client response, the HTTP version of the connected-to server. Returns`'2.0'`.
+         *
+         * Also `message.httpVersionMajor` is the first integer and`message.httpVersionMinor` is the second.
+         * @since v8.4.0
+         */
+        readonly httpVersion: string;
+        readonly httpVersionMinor: number;
+        readonly httpVersionMajor: number;
+        /**
+         * The request method as a string. Read-only. Examples: `'GET'`, `'DELETE'`.
+         * @since v8.4.0
+         */
+        readonly method: string;
+        /**
+         * The raw request/response headers list exactly as they were received.
+         *
+         * The keys and values are in the same list. It is _not_ a
+         * list of tuples. So, the even-numbered offsets are key values, and the
+         * odd-numbered offsets are the associated values.
+         *
+         * Header names are not lowercased, and duplicates are not merged.
+         *
+         * ```js
+         * // Prints something like:
+         * //
+         * // [ 'user-agent',
+         * //   'this is invalid because there can be only one',
+         * //   'User-Agent',
+         * //   'curl/7.22.0',
+         * //   'Host',
+         * //   '127.0.0.1:8000',
+         * //   'ACCEPT',
+         * //   '*' ]
+         * console.log(request.rawHeaders);
+         * ```
+         * @since v8.4.0
+         */
+        readonly rawHeaders: string[];
+        /**
+         * The raw request/response trailer keys and values exactly as they were
+         * received. Only populated at the `'end'` event.
+         * @since v8.4.0
+         */
+        readonly rawTrailers: string[];
+        /**
+         * The request scheme pseudo header field indicating the scheme
+         * portion of the target URL.
+         * @since v8.4.0
+         */
+        readonly scheme: string;
+        /**
+         * Returns a `Proxy` object that acts as a `net.Socket` (or `tls.TLSSocket`) but
+         * applies getters, setters, and methods based on HTTP/2 logic.
+         *
+         * `destroyed`, `readable`, and `writable` properties will be retrieved from and
+         * set on `request.stream`.
+         *
+         * `destroy`, `emit`, `end`, `on` and `once` methods will be called on`request.stream`.
+         *
+         * `setTimeout` method will be called on `request.stream.session`.
+         *
+         * `pause`, `read`, `resume`, and `write` will throw an error with code`ERR_HTTP2_NO_SOCKET_MANIPULATION`. See `Http2Session and Sockets` for
+         * more information.
+         *
+         * All other interactions will be routed directly to the socket. With TLS support,
+         * use `request.socket.getPeerCertificate()` to obtain the client's
+         * authentication details.
+         * @since v8.4.0
+         */
+        readonly socket: net.Socket | tls.TLSSocket;
+        /**
+         * The `Http2Stream` object backing the request.
+         * @since v8.4.0
+         */
+        readonly stream: ServerHttp2Stream;
+        /**
+         * The request/response trailers object. Only populated at the `'end'` event.
+         * @since v8.4.0
+         */
+        readonly trailers: IncomingHttpHeaders;
+        /**
+         * Request URL string. This contains only the URL that is present in the actual
+         * HTTP request. If the request is:
+         *
+         * ```http
+         * GET /status?name=ryan HTTP/1.1
+         * Accept: text/plain
+         * ```
+         *
+         * Then `request.url` will be:
+         *
+         * ```js
+         * '/status?name=ryan'
+         * ```
+         *
+         * To parse the url into its parts, `new URL()` can be used:
+         *
+         * ```console
+         * $ node
+         * > new URL('/status?name=ryan', 'http://example.com')
+         * URL {
+         *   href: 'http://example.com/status?name=ryan',
+         *   origin: 'http://example.com',
+         *   protocol: 'http:',
+         *   username: '',
+         *   password: '',
+         *   host: 'example.com',
+         *   hostname: 'example.com',
+         *   port: '',
+         *   pathname: '/status',
+         *   search: '?name=ryan',
+         *   searchParams: URLSearchParams { 'name' => 'ryan' },
+         *   hash: ''
+         * }
+         * ```
+         * @since v8.4.0
+         */
+        url: string;
+        /**
+         * Sets the `Http2Stream`'s timeout value to `msecs`. If a callback is
+         * provided, then it is added as a listener on the `'timeout'` event on
+         * the response object.
+         *
+         * If no `'timeout'` listener is added to the request, the response, or
+         * the server, then `Http2Stream` s are destroyed when they time out. If a
+         * handler is assigned to the request, the response, or the server's `'timeout'`events, timed out sockets must be handled explicitly.
+         * @since v8.4.0
+         */
+        setTimeout(msecs: number, callback?: () => void): void;
+        read(size?: number): Buffer | string | null;
+        addListener(event: 'aborted', listener: (hadError: boolean, code: number) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        addListener(event: 'end', listener: () => void): this;
+        addListener(event: 'readable', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'aborted', hadError: boolean, code: number): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'data', chunk: Buffer | string): boolean;
+        emit(event: 'end'): boolean;
+        emit(event: 'readable'): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'aborted', listener: (hadError: boolean, code: number) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        on(event: 'end', listener: () => void): this;
+        on(event: 'readable', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'aborted', listener: (hadError: boolean, code: number) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        once(event: 'end', listener: () => void): this;
+        once(event: 'readable', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'aborted', listener: (hadError: boolean, code: number) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        prependListener(event: 'end', listener: () => void): this;
+        prependListener(event: 'readable', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'aborted', listener: (hadError: boolean, code: number) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'data', listener: (chunk: Buffer | string) => void): this;
+        prependOnceListener(event: 'end', listener: () => void): this;
+        prependOnceListener(event: 'readable', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    /**
+     * This object is created internally by an HTTP server, not by the user. It is
+     * passed as the second parameter to the `'request'` event.
+     * @since v8.4.0
+     */
+    export class Http2ServerResponse extends stream.Writable {
+        constructor(stream: ServerHttp2Stream);
+        /**
+         * See `response.socket`.
+         * @since v8.4.0
+         * @deprecated Since v13.0.0 - Use `socket`.
+         */
+        readonly connection: net.Socket | tls.TLSSocket;
+        /**
+         * Boolean value that indicates whether the response has completed. Starts
+         * as `false`. After `response.end()` executes, the value will be `true`.
+         * @since v8.4.0
+         * @deprecated Since v13.4.0,v12.16.0 - Use `writableEnded`.
+         */
+        readonly finished: boolean;
+        /**
+         * True if headers were sent, false otherwise (read-only).
+         * @since v8.4.0
+         */
+        readonly headersSent: boolean;
+        /**
+         * A reference to the original HTTP2 request object.
+         * @since v15.7.0
+         */
+        readonly req: Http2ServerRequest;
+        /**
+         * Returns a `Proxy` object that acts as a `net.Socket` (or `tls.TLSSocket`) but
+         * applies getters, setters, and methods based on HTTP/2 logic.
+         *
+         * `destroyed`, `readable`, and `writable` properties will be retrieved from and
+         * set on `response.stream`.
+         *
+         * `destroy`, `emit`, `end`, `on` and `once` methods will be called on`response.stream`.
+         *
+         * `setTimeout` method will be called on `response.stream.session`.
+         *
+         * `pause`, `read`, `resume`, and `write` will throw an error with code`ERR_HTTP2_NO_SOCKET_MANIPULATION`. See `Http2Session and Sockets` for
+         * more information.
+         *
+         * All other interactions will be routed directly to the socket.
+         *
+         * ```js
+         * const http2 = require('http2');
+         * const server = http2.createServer((req, res) => {
+         *   const ip = req.socket.remoteAddress;
+         *   const port = req.socket.remotePort;
+         *   res.end(`Your IP address is ${ip} and your source port is ${port}.`);
+         * }).listen(3000);
+         * ```
+         * @since v8.4.0
+         */
+        readonly socket: net.Socket | tls.TLSSocket;
+        /**
+         * The `Http2Stream` object backing the response.
+         * @since v8.4.0
+         */
+        readonly stream: ServerHttp2Stream;
+        /**
+         * When true, the Date header will be automatically generated and sent in
+         * the response if it is not already present in the headers. Defaults to true.
+         *
+         * This should only be disabled for testing; HTTP requires the Date header
+         * in responses.
+         * @since v8.4.0
+         */
+        sendDate: boolean;
+        /**
+         * When using implicit headers (not calling `response.writeHead()` explicitly),
+         * this property controls the status code that will be sent to the client when
+         * the headers get flushed.
+         *
+         * ```js
+         * response.statusCode = 404;
+         * ```
+         *
+         * After response header was sent to the client, this property indicates the
+         * status code which was sent out.
+         * @since v8.4.0
+         */
+        statusCode: number;
+        /**
+         * Status message is not supported by HTTP/2 (RFC 7540 8.1.2.4). It returns
+         * an empty string.
+         * @since v8.4.0
+         */
+        statusMessage: '';
+        /**
+         * This method adds HTTP trailing headers (a header but at the end of the
+         * message) to the response.
+         *
+         * Attempting to set a header field name or value that contains invalid characters
+         * will result in a `TypeError` being thrown.
+         * @since v8.4.0
+         */
+        addTrailers(trailers: OutgoingHttpHeaders): void;
+        /**
+         * This method signals to the server that all of the response headers and body
+         * have been sent; that server should consider this message complete.
+         * The method, `response.end()`, MUST be called on each response.
+         *
+         * If `data` is specified, it is equivalent to calling `response.write(data, encoding)` followed by `response.end(callback)`.
+         *
+         * If `callback` is specified, it will be called when the response stream
+         * is finished.
+         * @since v8.4.0
+         */
+        end(callback?: () => void): this;
+        end(data: string | Uint8Array, callback?: () => void): this;
+        end(data: string | Uint8Array, encoding: BufferEncoding, callback?: () => void): this;
+        /**
+         * Reads out a header that has already been queued but not sent to the client.
+         * The name is case-insensitive.
+         *
+         * ```js
+         * const contentType = response.getHeader('content-type');
+         * ```
+         * @since v8.4.0
+         */
+        getHeader(name: string): string;
+        /**
+         * Returns an array containing the unique names of the current outgoing headers.
+         * All header names are lowercase.
+         *
+         * ```js
+         * response.setHeader('Foo', 'bar');
+         * response.setHeader('Set-Cookie', ['foo=bar', 'bar=baz']);
+         *
+         * const headerNames = response.getHeaderNames();
+         * // headerNames === ['foo', 'set-cookie']
+         * ```
+         * @since v8.4.0
+         */
+        getHeaderNames(): string[];
+        /**
+         * Returns a shallow copy of the current outgoing headers. Since a shallow copy
+         * is used, array values may be mutated without additional calls to various
+         * header-related http module methods. The keys of the returned object are the
+         * header names and the values are the respective header values. All header names
+         * are lowercase.
+         *
+         * The object returned by the `response.getHeaders()` method _does not_prototypically inherit from the JavaScript `Object`. This means that typical`Object` methods such as `obj.toString()`,
+         * `obj.hasOwnProperty()`, and others
+         * are not defined and _will not work_.
+         *
+         * ```js
+         * response.setHeader('Foo', 'bar');
+         * response.setHeader('Set-Cookie', ['foo=bar', 'bar=baz']);
+         *
+         * const headers = response.getHeaders();
+         * // headers === { foo: 'bar', 'set-cookie': ['foo=bar', 'bar=baz'] }
+         * ```
+         * @since v8.4.0
+         */
+        getHeaders(): OutgoingHttpHeaders;
+        /**
+         * Returns `true` if the header identified by `name` is currently set in the
+         * outgoing headers. The header name matching is case-insensitive.
+         *
+         * ```js
+         * const hasContentType = response.hasHeader('content-type');
+         * ```
+         * @since v8.4.0
+         */
+        hasHeader(name: string): boolean;
+        /**
+         * Removes a header that has been queued for implicit sending.
+         *
+         * ```js
+         * response.removeHeader('Content-Encoding');
+         * ```
+         * @since v8.4.0
+         */
+        removeHeader(name: string): void;
+        /**
+         * Sets a single header value for implicit headers. If this header already exists
+         * in the to-be-sent headers, its value will be replaced. Use an array of strings
+         * here to send multiple headers with the same name.
+         *
+         * ```js
+         * response.setHeader('Content-Type', 'text/html; charset=utf-8');
+         * ```
+         *
+         * or
+         *
+         * ```js
+         * response.setHeader('Set-Cookie', ['type=ninja', 'language=javascript']);
+         * ```
+         *
+         * Attempting to set a header field name or value that contains invalid characters
+         * will result in a `TypeError` being thrown.
+         *
+         * When headers have been set with `response.setHeader()`, they will be merged
+         * with any headers passed to `response.writeHead()`, with the headers passed
+         * to `response.writeHead()` given precedence.
+         *
+         * ```js
+         * // Returns content-type = text/plain
+         * const server = http2.createServer((req, res) => {
+         *   res.setHeader('Content-Type', 'text/html; charset=utf-8');
+         *   res.setHeader('X-Foo', 'bar');
+         *   res.writeHead(200, { 'Content-Type': 'text/plain; charset=utf-8' });
+         *   res.end('ok');
+         * });
+         * ```
+         * @since v8.4.0
+         */
+        setHeader(name: string, value: number | string | ReadonlyArray<string>): void;
+        /**
+         * Sets the `Http2Stream`'s timeout value to `msecs`. If a callback is
+         * provided, then it is added as a listener on the `'timeout'` event on
+         * the response object.
+         *
+         * If no `'timeout'` listener is added to the request, the response, or
+         * the server, then `Http2Stream` s are destroyed when they time out. If a
+         * handler is assigned to the request, the response, or the server's `'timeout'`events, timed out sockets must be handled explicitly.
+         * @since v8.4.0
+         */
+        setTimeout(msecs: number, callback?: () => void): void;
+        /**
+         * If this method is called and `response.writeHead()` has not been called,
+         * it will switch to implicit header mode and flush the implicit headers.
+         *
+         * This sends a chunk of the response body. This method may
+         * be called multiple times to provide successive parts of the body.
+         *
+         * In the `http` module, the response body is omitted when the
+         * request is a HEAD request. Similarly, the `204` and `304` responses_must not_ include a message body.
+         *
+         * `chunk` can be a string or a buffer. If `chunk` is a string,
+         * the second parameter specifies how to encode it into a byte stream.
+         * By default the `encoding` is `'utf8'`. `callback` will be called when this chunk
+         * of data is flushed.
+         *
+         * This is the raw HTTP body and has nothing to do with higher-level multi-part
+         * body encodings that may be used.
+         *
+         * The first time `response.write()` is called, it will send the buffered
+         * header information and the first chunk of the body to the client. The second
+         * time `response.write()` is called, Node.js assumes data will be streamed,
+         * and sends the new data separately. That is, the response is buffered up to the
+         * first chunk of the body.
+         *
+         * Returns `true` if the entire data was flushed successfully to the kernel
+         * buffer. Returns `false` if all or part of the data was queued in user memory.`'drain'` will be emitted when the buffer is free again.
+         * @since v8.4.0
+         */
+        write(chunk: string | Uint8Array, callback?: (err: Error) => void): boolean;
+        write(chunk: string | Uint8Array, encoding: BufferEncoding, callback?: (err: Error) => void): boolean;
+        /**
+         * Sends a status `100 Continue` to the client, indicating that the request body
+         * should be sent. See the `'checkContinue'` event on `Http2Server` and`Http2SecureServer`.
+         * @since v8.4.0
+         */
+        writeContinue(): void;
+        /**
+         * Sends a response header to the request. The status code is a 3-digit HTTP
+         * status code, like `404`. The last argument, `headers`, are the response headers.
+         *
+         * Returns a reference to the `Http2ServerResponse`, so that calls can be chained.
+         *
+         * For compatibility with `HTTP/1`, a human-readable `statusMessage` may be
+         * passed as the second argument. However, because the `statusMessage` has no
+         * meaning within HTTP/2, the argument will have no effect and a process warning
+         * will be emitted.
+         *
+         * ```js
+         * const body = 'hello world';
+         * response.writeHead(200, {
+         *   'Content-Length': Buffer.byteLength(body),
+         *   'Content-Type': 'text/plain; charset=utf-8',
+         * });
+         * ```
+         *
+         * `Content-Length` is given in bytes not characters. The`Buffer.byteLength()` API may be used to determine the number of bytes in a
+         * given encoding. On outbound messages, Node.js does not check if Content-Length
+         * and the length of the body being transmitted are equal or not. However, when
+         * receiving messages, Node.js will automatically reject messages when the`Content-Length` does not match the actual payload size.
+         *
+         * This method may be called at most one time on a message before `response.end()` is called.
+         *
+         * If `response.write()` or `response.end()` are called before calling
+         * this, the implicit/mutable headers will be calculated and call this function.
+         *
+         * When headers have been set with `response.setHeader()`, they will be merged
+         * with any headers passed to `response.writeHead()`, with the headers passed
+         * to `response.writeHead()` given precedence.
+         *
+         * ```js
+         * // Returns content-type = text/plain
+         * const server = http2.createServer((req, res) => {
+         *   res.setHeader('Content-Type', 'text/html; charset=utf-8');
+         *   res.setHeader('X-Foo', 'bar');
+         *   res.writeHead(200, { 'Content-Type': 'text/plain; charset=utf-8' });
+         *   res.end('ok');
+         * });
+         * ```
+         *
+         * Attempting to set a header field name or value that contains invalid characters
+         * will result in a `TypeError` being thrown.
+         * @since v8.4.0
+         */
+        writeHead(statusCode: number, headers?: OutgoingHttpHeaders): this;
+        writeHead(statusCode: number, statusMessage: string, headers?: OutgoingHttpHeaders): this;
+        /**
+         * Call `http2stream.pushStream()` with the given headers, and wrap the
+         * given `Http2Stream` on a newly created `Http2ServerResponse` as the callback
+         * parameter if successful. When `Http2ServerRequest` is closed, the callback is
+         * called with an error `ERR_HTTP2_INVALID_STREAM`.
+         * @since v8.4.0
+         * @param headers An object describing the headers
+         * @param callback Called once `http2stream.pushStream()` is finished, or either when the attempt to create the pushed `Http2Stream` has failed or has been rejected, or the state of
+         * `Http2ServerRequest` is closed prior to calling the `http2stream.pushStream()` method
+         */
+        createPushResponse(headers: OutgoingHttpHeaders, callback: (err: Error | null, res: Http2ServerResponse) => void): void;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'drain', listener: () => void): this;
+        addListener(event: 'error', listener: (error: Error) => void): this;
+        addListener(event: 'finish', listener: () => void): this;
+        addListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'close'): boolean;
+        emit(event: 'drain'): boolean;
+        emit(event: 'error', error: Error): boolean;
+        emit(event: 'finish'): boolean;
+        emit(event: 'pipe', src: stream.Readable): boolean;
+        emit(event: 'unpipe', src: stream.Readable): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'drain', listener: () => void): this;
+        on(event: 'error', listener: (error: Error) => void): this;
+        on(event: 'finish', listener: () => void): this;
+        on(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        on(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'drain', listener: () => void): this;
+        once(event: 'error', listener: (error: Error) => void): this;
+        once(event: 'finish', listener: () => void): this;
+        once(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        once(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'drain', listener: () => void): this;
+        prependListener(event: 'error', listener: (error: Error) => void): this;
+        prependListener(event: 'finish', listener: () => void): this;
+        prependListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'drain', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (error: Error) => void): this;
+        prependOnceListener(event: 'finish', listener: () => void): this;
+        prependOnceListener(event: 'pipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: 'unpipe', listener: (src: stream.Readable) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    export namespace constants {
+        const NGHTTP2_SESSION_SERVER: number;
+        const NGHTTP2_SESSION_CLIENT: number;
+        const NGHTTP2_STREAM_STATE_IDLE: number;
+        const NGHTTP2_STREAM_STATE_OPEN: number;
+        const NGHTTP2_STREAM_STATE_RESERVED_LOCAL: number;
+        const NGHTTP2_STREAM_STATE_RESERVED_REMOTE: number;
+        const NGHTTP2_STREAM_STATE_HALF_CLOSED_LOCAL: number;
+        const NGHTTP2_STREAM_STATE_HALF_CLOSED_REMOTE: number;
+        const NGHTTP2_STREAM_STATE_CLOSED: number;
+        const NGHTTP2_NO_ERROR: number;
+        const NGHTTP2_PROTOCOL_ERROR: number;
+        const NGHTTP2_INTERNAL_ERROR: number;
+        const NGHTTP2_FLOW_CONTROL_ERROR: number;
+        const NGHTTP2_SETTINGS_TIMEOUT: number;
+        const NGHTTP2_STREAM_CLOSED: number;
+        const NGHTTP2_FRAME_SIZE_ERROR: number;
+        const NGHTTP2_REFUSED_STREAM: number;
+        const NGHTTP2_CANCEL: number;
+        const NGHTTP2_COMPRESSION_ERROR: number;
+        const NGHTTP2_CONNECT_ERROR: number;
+        const NGHTTP2_ENHANCE_YOUR_CALM: number;
+        const NGHTTP2_INADEQUATE_SECURITY: number;
+        const NGHTTP2_HTTP_1_1_REQUIRED: number;
+        const NGHTTP2_ERR_FRAME_SIZE_ERROR: number;
+        const NGHTTP2_FLAG_NONE: number;
+        const NGHTTP2_FLAG_END_STREAM: number;
+        const NGHTTP2_FLAG_END_HEADERS: number;
+        const NGHTTP2_FLAG_ACK: number;
+        const NGHTTP2_FLAG_PADDED: number;
+        const NGHTTP2_FLAG_PRIORITY: number;
+        const DEFAULT_SETTINGS_HEADER_TABLE_SIZE: number;
+        const DEFAULT_SETTINGS_ENABLE_PUSH: number;
+        const DEFAULT_SETTINGS_INITIAL_WINDOW_SIZE: number;
+        const DEFAULT_SETTINGS_MAX_FRAME_SIZE: number;
+        const MAX_MAX_FRAME_SIZE: number;
+        const MIN_MAX_FRAME_SIZE: number;
+        const MAX_INITIAL_WINDOW_SIZE: number;
+        const NGHTTP2_DEFAULT_WEIGHT: number;
+        const NGHTTP2_SETTINGS_HEADER_TABLE_SIZE: number;
+        const NGHTTP2_SETTINGS_ENABLE_PUSH: number;
+        const NGHTTP2_SETTINGS_MAX_CONCURRENT_STREAMS: number;
+        const NGHTTP2_SETTINGS_INITIAL_WINDOW_SIZE: number;
+        const NGHTTP2_SETTINGS_MAX_FRAME_SIZE: number;
+        const NGHTTP2_SETTINGS_MAX_HEADER_LIST_SIZE: number;
+        const PADDING_STRATEGY_NONE: number;
+        const PADDING_STRATEGY_MAX: number;
+        const PADDING_STRATEGY_CALLBACK: number;
+        const HTTP2_HEADER_STATUS: string;
+        const HTTP2_HEADER_METHOD: string;
+        const HTTP2_HEADER_AUTHORITY: string;
+        const HTTP2_HEADER_SCHEME: string;
+        const HTTP2_HEADER_PATH: string;
+        const HTTP2_HEADER_ACCEPT_CHARSET: string;
+        const HTTP2_HEADER_ACCEPT_ENCODING: string;
+        const HTTP2_HEADER_ACCEPT_LANGUAGE: string;
+        const HTTP2_HEADER_ACCEPT_RANGES: string;
+        const HTTP2_HEADER_ACCEPT: string;
+        const HTTP2_HEADER_ACCESS_CONTROL_ALLOW_ORIGIN: string;
+        const HTTP2_HEADER_AGE: string;
+        const HTTP2_HEADER_ALLOW: string;
+        const HTTP2_HEADER_AUTHORIZATION: string;
+        const HTTP2_HEADER_CACHE_CONTROL: string;
+        const HTTP2_HEADER_CONNECTION: string;
+        const HTTP2_HEADER_CONTENT_DISPOSITION: string;
+        const HTTP2_HEADER_CONTENT_ENCODING: string;
+        const HTTP2_HEADER_CONTENT_LANGUAGE: string;
+        const HTTP2_HEADER_CONTENT_LENGTH: string;
+        const HTTP2_HEADER_CONTENT_LOCATION: string;
+        const HTTP2_HEADER_CONTENT_MD5: string;
+        const HTTP2_HEADER_CONTENT_RANGE: string;
+        const HTTP2_HEADER_CONTENT_TYPE: string;
+        const HTTP2_HEADER_COOKIE: string;
+        const HTTP2_HEADER_DATE: string;
+        const HTTP2_HEADER_ETAG: string;
+        const HTTP2_HEADER_EXPECT: string;
+        const HTTP2_HEADER_EXPIRES: string;
+        const HTTP2_HEADER_FROM: string;
+        const HTTP2_HEADER_HOST: string;
+        const HTTP2_HEADER_IF_MATCH: string;
+        const HTTP2_HEADER_IF_MODIFIED_SINCE: string;
+        const HTTP2_HEADER_IF_NONE_MATCH: string;
+        const HTTP2_HEADER_IF_RANGE: string;
+        const HTTP2_HEADER_IF_UNMODIFIED_SINCE: string;
+        const HTTP2_HEADER_LAST_MODIFIED: string;
+        const HTTP2_HEADER_LINK: string;
+        const HTTP2_HEADER_LOCATION: string;
+        const HTTP2_HEADER_MAX_FORWARDS: string;
+        const HTTP2_HEADER_PREFER: string;
+        const HTTP2_HEADER_PROXY_AUTHENTICATE: string;
+        const HTTP2_HEADER_PROXY_AUTHORIZATION: string;
+        const HTTP2_HEADER_RANGE: string;
+        const HTTP2_HEADER_REFERER: string;
+        const HTTP2_HEADER_REFRESH: string;
+        const HTTP2_HEADER_RETRY_AFTER: string;
+        const HTTP2_HEADER_SERVER: string;
+        const HTTP2_HEADER_SET_COOKIE: string;
+        const HTTP2_HEADER_STRICT_TRANSPORT_SECURITY: string;
+        const HTTP2_HEADER_TRANSFER_ENCODING: string;
+        const HTTP2_HEADER_TE: string;
+        const HTTP2_HEADER_UPGRADE: string;
+        const HTTP2_HEADER_USER_AGENT: string;
+        const HTTP2_HEADER_VARY: string;
+        const HTTP2_HEADER_VIA: string;
+        const HTTP2_HEADER_WWW_AUTHENTICATE: string;
+        const HTTP2_HEADER_HTTP2_SETTINGS: string;
+        const HTTP2_HEADER_KEEP_ALIVE: string;
+        const HTTP2_HEADER_PROXY_CONNECTION: string;
+        const HTTP2_METHOD_ACL: string;
+        const HTTP2_METHOD_BASELINE_CONTROL: string;
+        const HTTP2_METHOD_BIND: string;
+        const HTTP2_METHOD_CHECKIN: string;
+        const HTTP2_METHOD_CHECKOUT: string;
+        const HTTP2_METHOD_CONNECT: string;
+        const HTTP2_METHOD_COPY: string;
+        const HTTP2_METHOD_DELETE: string;
+        const HTTP2_METHOD_GET: string;
+        const HTTP2_METHOD_HEAD: string;
+        const HTTP2_METHOD_LABEL: string;
+        const HTTP2_METHOD_LINK: string;
+        const HTTP2_METHOD_LOCK: string;
+        const HTTP2_METHOD_MERGE: string;
+        const HTTP2_METHOD_MKACTIVITY: string;
+        const HTTP2_METHOD_MKCALENDAR: string;
+        const HTTP2_METHOD_MKCOL: string;
+        const HTTP2_METHOD_MKREDIRECTREF: string;
+        const HTTP2_METHOD_MKWORKSPACE: string;
+        const HTTP2_METHOD_MOVE: string;
+        const HTTP2_METHOD_OPTIONS: string;
+        const HTTP2_METHOD_ORDERPATCH: string;
+        const HTTP2_METHOD_PATCH: string;
+        const HTTP2_METHOD_POST: string;
+        const HTTP2_METHOD_PRI: string;
+        const HTTP2_METHOD_PROPFIND: string;
+        const HTTP2_METHOD_PROPPATCH: string;
+        const HTTP2_METHOD_PUT: string;
+        const HTTP2_METHOD_REBIND: string;
+        const HTTP2_METHOD_REPORT: string;
+        const HTTP2_METHOD_SEARCH: string;
+        const HTTP2_METHOD_TRACE: string;
+        const HTTP2_METHOD_UNBIND: string;
+        const HTTP2_METHOD_UNCHECKOUT: string;
+        const HTTP2_METHOD_UNLINK: string;
+        const HTTP2_METHOD_UNLOCK: string;
+        const HTTP2_METHOD_UPDATE: string;
+        const HTTP2_METHOD_UPDATEREDIRECTREF: string;
+        const HTTP2_METHOD_VERSION_CONTROL: string;
+        const HTTP_STATUS_CONTINUE: number;
+        const HTTP_STATUS_SWITCHING_PROTOCOLS: number;
+        const HTTP_STATUS_PROCESSING: number;
+        const HTTP_STATUS_OK: number;
+        const HTTP_STATUS_CREATED: number;
+        const HTTP_STATUS_ACCEPTED: number;
+        const HTTP_STATUS_NON_AUTHORITATIVE_INFORMATION: number;
+        const HTTP_STATUS_NO_CONTENT: number;
+        const HTTP_STATUS_RESET_CONTENT: number;
+        const HTTP_STATUS_PARTIAL_CONTENT: number;
+        const HTTP_STATUS_MULTI_STATUS: number;
+        const HTTP_STATUS_ALREADY_REPORTED: number;
+        const HTTP_STATUS_IM_USED: number;
+        const HTTP_STATUS_MULTIPLE_CHOICES: number;
+        const HTTP_STATUS_MOVED_PERMANENTLY: number;
+        const HTTP_STATUS_FOUND: number;
+        const HTTP_STATUS_SEE_OTHER: number;
+        const HTTP_STATUS_NOT_MODIFIED: number;
+        const HTTP_STATUS_USE_PROXY: number;
+        const HTTP_STATUS_TEMPORARY_REDIRECT: number;
+        const HTTP_STATUS_PERMANENT_REDIRECT: number;
+        const HTTP_STATUS_BAD_REQUEST: number;
+        const HTTP_STATUS_UNAUTHORIZED: number;
+        const HTTP_STATUS_PAYMENT_REQUIRED: number;
+        const HTTP_STATUS_FORBIDDEN: number;
+        const HTTP_STATUS_NOT_FOUND: number;
+        const HTTP_STATUS_METHOD_NOT_ALLOWED: number;
+        const HTTP_STATUS_NOT_ACCEPTABLE: number;
+        const HTTP_STATUS_PROXY_AUTHENTICATION_REQUIRED: number;
+        const HTTP_STATUS_REQUEST_TIMEOUT: number;
+        const HTTP_STATUS_CONFLICT: number;
+        const HTTP_STATUS_GONE: number;
+        const HTTP_STATUS_LENGTH_REQUIRED: number;
+        const HTTP_STATUS_PRECONDITION_FAILED: number;
+        const HTTP_STATUS_PAYLOAD_TOO_LARGE: number;
+        const HTTP_STATUS_URI_TOO_LONG: number;
+        const HTTP_STATUS_UNSUPPORTED_MEDIA_TYPE: number;
+        const HTTP_STATUS_RANGE_NOT_SATISFIABLE: number;
+        const HTTP_STATUS_EXPECTATION_FAILED: number;
+        const HTTP_STATUS_TEAPOT: number;
+        const HTTP_STATUS_MISDIRECTED_REQUEST: number;
+        const HTTP_STATUS_UNPROCESSABLE_ENTITY: number;
+        const HTTP_STATUS_LOCKED: number;
+        const HTTP_STATUS_FAILED_DEPENDENCY: number;
+        const HTTP_STATUS_UNORDERED_COLLECTION: number;
+        const HTTP_STATUS_UPGRADE_REQUIRED: number;
+        const HTTP_STATUS_PRECONDITION_REQUIRED: number;
+        const HTTP_STATUS_TOO_MANY_REQUESTS: number;
+        const HTTP_STATUS_REQUEST_HEADER_FIELDS_TOO_LARGE: number;
+        const HTTP_STATUS_UNAVAILABLE_FOR_LEGAL_REASONS: number;
+        const HTTP_STATUS_INTERNAL_SERVER_ERROR: number;
+        const HTTP_STATUS_NOT_IMPLEMENTED: number;
+        const HTTP_STATUS_BAD_GATEWAY: number;
+        const HTTP_STATUS_SERVICE_UNAVAILABLE: number;
+        const HTTP_STATUS_GATEWAY_TIMEOUT: number;
+        const HTTP_STATUS_HTTP_VERSION_NOT_SUPPORTED: number;
+        const HTTP_STATUS_VARIANT_ALSO_NEGOTIATES: number;
+        const HTTP_STATUS_INSUFFICIENT_STORAGE: number;
+        const HTTP_STATUS_LOOP_DETECTED: number;
+        const HTTP_STATUS_BANDWIDTH_LIMIT_EXCEEDED: number;
+        const HTTP_STATUS_NOT_EXTENDED: number;
+        const HTTP_STATUS_NETWORK_AUTHENTICATION_REQUIRED: number;
+    }
+    /**
+     * This symbol can be set as a property on the HTTP/2 headers object with
+     * an array value in order to provide a list of headers considered sensitive.
+     */
+    export const sensitiveHeaders: symbol;
+    /**
+     * Returns an object containing the default settings for an `Http2Session`instance. This method returns a new object instance every time it is called
+     * so instances returned may be safely modified for use.
+     * @since v8.4.0
+     */
+    export function getDefaultSettings(): Settings;
+    /**
+     * Returns a `Buffer` instance containing serialized representation of the given
+     * HTTP/2 settings as specified in the [HTTP/2](https://tools.ietf.org/html/rfc7540) specification. This is intended
+     * for use with the `HTTP2-Settings` header field.
+     *
+     * ```js
+     * const http2 = require('http2');
+     *
+     * const packed = http2.getPackedSettings({ enablePush: false });
+     *
+     * console.log(packed.toString('base64'));
+     * // Prints: AAIAAAAA
+     * ```
+     * @since v8.4.0
+     */
+    export function getPackedSettings(settings: Settings): Buffer;
+    /**
+     * Returns a `HTTP/2 Settings Object` containing the deserialized settings from
+     * the given `Buffer` as generated by `http2.getPackedSettings()`.
+     * @since v8.4.0
+     * @param buf The packed settings.
+     */
+    export function getUnpackedSettings(buf: Uint8Array): Settings;
+    /**
+     * Returns a `net.Server` instance that creates and manages `Http2Session`instances.
+     *
+     * Since there are no browsers known that support [unencrypted HTTP/2](https://http2.github.io/faq/#does-http2-require-encryption), the use of {@link createSecureServer} is necessary when
+     * communicating
+     * with browser clients.
+     *
+     * ```js
+     * const http2 = require('http2');
+     *
+     * // Create an unencrypted HTTP/2 server.
+     * // Since there are no browsers known that support
+     * // unencrypted HTTP/2, the use of `http2.createSecureServer()`
+     * // is necessary when communicating with browser clients.
+     * const server = http2.createServer();
+     *
+     * server.on('stream', (stream, headers) => {
+     *   stream.respond({
+     *     'content-type': 'text/html; charset=utf-8',
+     *     ':status': 200
+     *   });
+     *   stream.end('<h1>Hello World</h1>');
+     * });
+     *
+     * server.listen(80);
+     * ```
+     * @since v8.4.0
+     * @param onRequestHandler See `Compatibility API`
+     */
+    export function createServer(onRequestHandler?: (request: Http2ServerRequest, response: Http2ServerResponse) => void): Http2Server;
+    export function createServer(options: ServerOptions, onRequestHandler?: (request: Http2ServerRequest, response: Http2ServerResponse) => void): Http2Server;
+    /**
+     * Returns a `tls.Server` instance that creates and manages `Http2Session`instances.
+     *
+     * ```js
+     * const http2 = require('http2');
+     * const fs = require('fs');
+     *
+     * const options = {
+     *   key: fs.readFileSync('server-key.pem'),
+     *   cert: fs.readFileSync('server-cert.pem')
+     * };
+     *
+     * // Create a secure HTTP/2 server
+     * const server = http2.createSecureServer(options);
+     *
+     * server.on('stream', (stream, headers) => {
+     *   stream.respond({
+     *     'content-type': 'text/html; charset=utf-8',
+     *     ':status': 200
+     *   });
+     *   stream.end('<h1>Hello World</h1>');
+     * });
+     *
+     * server.listen(80);
+     * ```
+     * @since v8.4.0
+     * @param onRequestHandler See `Compatibility API`
+     */
+    export function createSecureServer(onRequestHandler?: (request: Http2ServerRequest, response: Http2ServerResponse) => void): Http2SecureServer;
+    export function createSecureServer(options: SecureServerOptions, onRequestHandler?: (request: Http2ServerRequest, response: Http2ServerResponse) => void): Http2SecureServer;
+    /**
+     * Returns a `ClientHttp2Session` instance.
+     *
+     * ```js
+     * const http2 = require('http2');
+     * const client = http2.connect('https://localhost:1234');
+     *
+     * // Use the client
+     *
+     * client.close();
+     * ```
+     * @since v8.4.0
+     * @param authority The remote HTTP/2 server to connect to. This must be in the form of a minimal, valid URL with the `http://` or `https://` prefix, host name, and IP port (if a non-default port
+     * is used). Userinfo (user ID and password), path, querystring, and fragment details in the URL will be ignored.
+     * @param listener Will be registered as a one-time listener of the {@link 'connect'} event.
+     */
+    export function connect(authority: string | url.URL, listener: (session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket) => void): ClientHttp2Session;
+    export function connect(
+        authority: string | url.URL,
+        options?: ClientSessionOptions | SecureClientSessionOptions,
+        listener?: (session: ClientHttp2Session, socket: net.Socket | tls.TLSSocket) => void
+    ): ClientHttp2Session;
+}
+declare module 'node:http2' {
+    export * from 'http2';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/https.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/https.d.ts
new file mode 100644
index 0000000..9abd7b1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/https.d.ts
@@ -0,0 +1,391 @@
+/**
+ * HTTPS is the HTTP protocol over TLS/SSL. In Node.js this is implemented as a
+ * separate module.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/https.js)
+ */
+declare module 'https' {
+    import { Duplex } from 'node:stream';
+    import * as tls from 'node:tls';
+    import * as http from 'node:http';
+    import { URL } from 'node:url';
+    type ServerOptions = tls.SecureContextOptions & tls.TlsOptions & http.ServerOptions;
+    type RequestOptions = http.RequestOptions &
+        tls.SecureContextOptions & {
+            rejectUnauthorized?: boolean | undefined; // Defaults to true
+            servername?: string | undefined; // SNI TLS Extension
+        };
+    interface AgentOptions extends http.AgentOptions, tls.ConnectionOptions {
+        rejectUnauthorized?: boolean | undefined;
+        maxCachedSessions?: number | undefined;
+    }
+    /**
+     * An `Agent` object for HTTPS similar to `http.Agent`. See {@link request} for more information.
+     * @since v0.4.5
+     */
+    class Agent extends http.Agent {
+        constructor(options?: AgentOptions);
+        options: AgentOptions;
+    }
+    interface Server extends http.Server {}
+    /**
+     * See `http.Server` for more information.
+     * @since v0.3.4
+     */
+    class Server extends tls.Server {
+        constructor(requestListener?: http.RequestListener);
+        constructor(options: ServerOptions, requestListener?: http.RequestListener);
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'keylog', listener: (line: Buffer, tlsSocket: tls.TLSSocket) => void): this;
+        addListener(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        addListener(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        addListener(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        addListener(event: 'secureConnection', listener: (tlsSocket: tls.TLSSocket) => void): this;
+        addListener(event: 'tlsClientError', listener: (err: Error, tlsSocket: tls.TLSSocket) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'connection', listener: (socket: Duplex) => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'listening', listener: () => void): this;
+        addListener(event: 'checkContinue', listener: http.RequestListener): this;
+        addListener(event: 'checkExpectation', listener: http.RequestListener): this;
+        addListener(event: 'clientError', listener: (err: Error, socket: Duplex) => void): this;
+        addListener(event: 'connect', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        addListener(event: 'request', listener: http.RequestListener): this;
+        addListener(event: 'upgrade', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        emit(event: string, ...args: any[]): boolean;
+        emit(event: 'keylog', line: Buffer, tlsSocket: tls.TLSSocket): boolean;
+        emit(event: 'newSession', sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void): boolean;
+        emit(event: 'OCSPRequest', certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void): boolean;
+        emit(event: 'resumeSession', sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void): boolean;
+        emit(event: 'secureConnection', tlsSocket: tls.TLSSocket): boolean;
+        emit(event: 'tlsClientError', err: Error, tlsSocket: tls.TLSSocket): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'connection', socket: Duplex): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'listening'): boolean;
+        emit(event: 'checkContinue', req: http.IncomingMessage, res: http.ServerResponse): boolean;
+        emit(event: 'checkExpectation', req: http.IncomingMessage, res: http.ServerResponse): boolean;
+        emit(event: 'clientError', err: Error, socket: Duplex): boolean;
+        emit(event: 'connect', req: http.IncomingMessage, socket: Duplex, head: Buffer): boolean;
+        emit(event: 'request', req: http.IncomingMessage, res: http.ServerResponse): boolean;
+        emit(event: 'upgrade', req: http.IncomingMessage, socket: Duplex, head: Buffer): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'keylog', listener: (line: Buffer, tlsSocket: tls.TLSSocket) => void): this;
+        on(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        on(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        on(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        on(event: 'secureConnection', listener: (tlsSocket: tls.TLSSocket) => void): this;
+        on(event: 'tlsClientError', listener: (err: Error, tlsSocket: tls.TLSSocket) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'connection', listener: (socket: Duplex) => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'listening', listener: () => void): this;
+        on(event: 'checkContinue', listener: http.RequestListener): this;
+        on(event: 'checkExpectation', listener: http.RequestListener): this;
+        on(event: 'clientError', listener: (err: Error, socket: Duplex) => void): this;
+        on(event: 'connect', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        on(event: 'request', listener: http.RequestListener): this;
+        on(event: 'upgrade', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'keylog', listener: (line: Buffer, tlsSocket: tls.TLSSocket) => void): this;
+        once(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        once(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        once(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        once(event: 'secureConnection', listener: (tlsSocket: tls.TLSSocket) => void): this;
+        once(event: 'tlsClientError', listener: (err: Error, tlsSocket: tls.TLSSocket) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'connection', listener: (socket: Duplex) => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'listening', listener: () => void): this;
+        once(event: 'checkContinue', listener: http.RequestListener): this;
+        once(event: 'checkExpectation', listener: http.RequestListener): this;
+        once(event: 'clientError', listener: (err: Error, socket: Duplex) => void): this;
+        once(event: 'connect', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        once(event: 'request', listener: http.RequestListener): this;
+        once(event: 'upgrade', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'keylog', listener: (line: Buffer, tlsSocket: tls.TLSSocket) => void): this;
+        prependListener(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        prependListener(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        prependListener(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        prependListener(event: 'secureConnection', listener: (tlsSocket: tls.TLSSocket) => void): this;
+        prependListener(event: 'tlsClientError', listener: (err: Error, tlsSocket: tls.TLSSocket) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'connection', listener: (socket: Duplex) => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'listening', listener: () => void): this;
+        prependListener(event: 'checkContinue', listener: http.RequestListener): this;
+        prependListener(event: 'checkExpectation', listener: http.RequestListener): this;
+        prependListener(event: 'clientError', listener: (err: Error, socket: Duplex) => void): this;
+        prependListener(event: 'connect', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        prependListener(event: 'request', listener: http.RequestListener): this;
+        prependListener(event: 'upgrade', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'keylog', listener: (line: Buffer, tlsSocket: tls.TLSSocket) => void): this;
+        prependOnceListener(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        prependOnceListener(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        prependOnceListener(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        prependOnceListener(event: 'secureConnection', listener: (tlsSocket: tls.TLSSocket) => void): this;
+        prependOnceListener(event: 'tlsClientError', listener: (err: Error, tlsSocket: tls.TLSSocket) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'connection', listener: (socket: Duplex) => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'listening', listener: () => void): this;
+        prependOnceListener(event: 'checkContinue', listener: http.RequestListener): this;
+        prependOnceListener(event: 'checkExpectation', listener: http.RequestListener): this;
+        prependOnceListener(event: 'clientError', listener: (err: Error, socket: Duplex) => void): this;
+        prependOnceListener(event: 'connect', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+        prependOnceListener(event: 'request', listener: http.RequestListener): this;
+        prependOnceListener(event: 'upgrade', listener: (req: http.IncomingMessage, socket: Duplex, head: Buffer) => void): this;
+    }
+    /**
+     * ```js
+     * // curl -k https://localhost:8000/
+     * const https = require('https');
+     * const fs = require('fs');
+     *
+     * const options = {
+     *   key: fs.readFileSync('test/fixtures/keys/agent2-key.pem'),
+     *   cert: fs.readFileSync('test/fixtures/keys/agent2-cert.pem')
+     * };
+     *
+     * https.createServer(options, (req, res) => {
+     *   res.writeHead(200);
+     *   res.end('hello world\n');
+     * }).listen(8000);
+     * ```
+     *
+     * Or
+     *
+     * ```js
+     * const https = require('https');
+     * const fs = require('fs');
+     *
+     * const options = {
+     *   pfx: fs.readFileSync('test/fixtures/test_cert.pfx'),
+     *   passphrase: 'sample'
+     * };
+     *
+     * https.createServer(options, (req, res) => {
+     *   res.writeHead(200);
+     *   res.end('hello world\n');
+     * }).listen(8000);
+     * ```
+     * @since v0.3.4
+     * @param options Accepts `options` from `createServer`, `createSecureContext` and `createServer`.
+     * @param requestListener A listener to be added to the `'request'` event.
+     */
+    function createServer(requestListener?: http.RequestListener): Server;
+    function createServer(options: ServerOptions, requestListener?: http.RequestListener): Server;
+    /**
+     * Makes a request to a secure web server.
+     *
+     * The following additional `options` from `tls.connect()` are also accepted:`ca`, `cert`, `ciphers`, `clientCertEngine`, `crl`, `dhparam`, `ecdhCurve`,`honorCipherOrder`, `key`, `passphrase`,
+     * `pfx`, `rejectUnauthorized`,`secureOptions`, `secureProtocol`, `servername`, `sessionIdContext`,`highWaterMark`.
+     *
+     * `options` can be an object, a string, or a `URL` object. If `options` is a
+     * string, it is automatically parsed with `new URL()`. If it is a `URL` object, it will be automatically converted to an ordinary `options` object.
+     *
+     * `https.request()` returns an instance of the `http.ClientRequest` class. The `ClientRequest` instance is a writable stream. If one needs to
+     * upload a file with a POST request, then write to the `ClientRequest` object.
+     *
+     * ```js
+     * const https = require('https');
+     *
+     * const options = {
+     *   hostname: 'encrypted.google.com',
+     *   port: 443,
+     *   path: '/',
+     *   method: 'GET'
+     * };
+     *
+     * const req = https.request(options, (res) => {
+     *   console.log('statusCode:', res.statusCode);
+     *   console.log('headers:', res.headers);
+     *
+     *   res.on('data', (d) => {
+     *     process.stdout.write(d);
+     *   });
+     * });
+     *
+     * req.on('error', (e) => {
+     *   console.error(e);
+     * });
+     * req.end();
+     * ```
+     *
+     * Example using options from `tls.connect()`:
+     *
+     * ```js
+     * const options = {
+     *   hostname: 'encrypted.google.com',
+     *   port: 443,
+     *   path: '/',
+     *   method: 'GET',
+     *   key: fs.readFileSync('test/fixtures/keys/agent2-key.pem'),
+     *   cert: fs.readFileSync('test/fixtures/keys/agent2-cert.pem')
+     * };
+     * options.agent = new https.Agent(options);
+     *
+     * const req = https.request(options, (res) => {
+     *   // ...
+     * });
+     * ```
+     *
+     * Alternatively, opt out of connection pooling by not using an `Agent`.
+     *
+     * ```js
+     * const options = {
+     *   hostname: 'encrypted.google.com',
+     *   port: 443,
+     *   path: '/',
+     *   method: 'GET',
+     *   key: fs.readFileSync('test/fixtures/keys/agent2-key.pem'),
+     *   cert: fs.readFileSync('test/fixtures/keys/agent2-cert.pem'),
+     *   agent: false
+     * };
+     *
+     * const req = https.request(options, (res) => {
+     *   // ...
+     * });
+     * ```
+     *
+     * Example using a `URL` as `options`:
+     *
+     * ```js
+     * const options = new URL('https://abc:xyz@example.com');
+     *
+     * const req = https.request(options, (res) => {
+     *   // ...
+     * });
+     * ```
+     *
+     * Example pinning on certificate fingerprint, or the public key (similar to`pin-sha256`):
+     *
+     * ```js
+     * const tls = require('tls');
+     * const https = require('https');
+     * const crypto = require('crypto');
+     *
+     * function sha256(s) {
+     *   return crypto.createHash('sha256').update(s).digest('base64');
+     * }
+     * const options = {
+     *   hostname: 'github.com',
+     *   port: 443,
+     *   path: '/',
+     *   method: 'GET',
+     *   checkServerIdentity: function(host, cert) {
+     *     // Make sure the certificate is issued to the host we are connected to
+     *     const err = tls.checkServerIdentity(host, cert);
+     *     if (err) {
+     *       return err;
+     *     }
+     *
+     *     // Pin the public key, similar to HPKP pin-sha25 pinning
+     *     const pubkey256 = 'pL1+qb9HTMRZJmuC/bB/ZI9d302BYrrqiVuRyW+DGrU=';
+     *     if (sha256(cert.pubkey) !== pubkey256) {
+     *       const msg = 'Certificate verification error: ' +
+     *         `The public key of '${cert.subject.CN}' ` +
+     *         'does not match our pinned fingerprint';
+     *       return new Error(msg);
+     *     }
+     *
+     *     // Pin the exact certificate, rather than the pub key
+     *     const cert256 = '25:FE:39:32:D9:63:8C:8A:FC:A1:9A:29:87:' +
+     *       'D8:3E:4C:1D:98:DB:71:E4:1A:48:03:98:EA:22:6A:BD:8B:93:16';
+     *     if (cert.fingerprint256 !== cert256) {
+     *       const msg = 'Certificate verification error: ' +
+     *         `The certificate of '${cert.subject.CN}' ` +
+     *         'does not match our pinned fingerprint';
+     *       return new Error(msg);
+     *     }
+     *
+     *     // This loop is informational only.
+     *     // Print the certificate and public key fingerprints of all certs in the
+     *     // chain. Its common to pin the public key of the issuer on the public
+     *     // internet, while pinning the public key of the service in sensitive
+     *     // environments.
+     *     do {
+     *       console.log('Subject Common Name:', cert.subject.CN);
+     *       console.log('  Certificate SHA256 fingerprint:', cert.fingerprint256);
+     *
+     *       hash = crypto.createHash('sha256');
+     *       console.log('  Public key ping-sha256:', sha256(cert.pubkey));
+     *
+     *       lastprint256 = cert.fingerprint256;
+     *       cert = cert.issuerCertificate;
+     *     } while (cert.fingerprint256 !== lastprint256);
+     *
+     *   },
+     * };
+     *
+     * options.agent = new https.Agent(options);
+     * const req = https.request(options, (res) => {
+     *   console.log('All OK. Server matched our pinned cert or public key');
+     *   console.log('statusCode:', res.statusCode);
+     *   // Print the HPKP values
+     *   console.log('headers:', res.headers['public-key-pins']);
+     *
+     *   res.on('data', (d) => {});
+     * });
+     *
+     * req.on('error', (e) => {
+     *   console.error(e.message);
+     * });
+     * req.end();
+     * ```
+     *
+     * Outputs for example:
+     *
+     * ```text
+     * Subject Common Name: github.com
+     *   Certificate SHA256 fingerprint: 25:FE:39:32:D9:63:8C:8A:FC:A1:9A:29:87:D8:3E:4C:1D:98:DB:71:E4:1A:48:03:98:EA:22:6A:BD:8B:93:16
+     *   Public key ping-sha256: pL1+qb9HTMRZJmuC/bB/ZI9d302BYrrqiVuRyW+DGrU=
+     * Subject Common Name: DigiCert SHA2 Extended Validation Server CA
+     *   Certificate SHA256 fingerprint: 40:3E:06:2A:26:53:05:91:13:28:5B:AF:80:A0:D4:AE:42:2C:84:8C:9F:78:FA:D0:1F:C9:4B:C5:B8:7F:EF:1A
+     *   Public key ping-sha256: RRM1dGqnDFsCJXBTHky16vi1obOlCgFFn/yOhI/y+ho=
+     * Subject Common Name: DigiCert High Assurance EV Root CA
+     *   Certificate SHA256 fingerprint: 74:31:E5:F4:C3:C1:CE:46:90:77:4F:0B:61:E0:54:40:88:3B:A9:A0:1E:D0:0B:A6:AB:D7:80:6E:D3:B1:18:CF
+     *   Public key ping-sha256: WoiWRyIOVNa9ihaBciRSC7XHjliYS9VwUGOIud4PB18=
+     * All OK. Server matched our pinned cert or public key
+     * statusCode: 200
+     * headers: max-age=0; pin-sha256="WoiWRyIOVNa9ihaBciRSC7XHjliYS9VwUGOIud4PB18="; pin-sha256="RRM1dGqnDFsCJXBTHky16vi1obOlCgFFn/yOhI/y+ho=";
+     * pin-sha256="k2v657xBsOVe1PQRwOsHsw3bsGT2VzIqz5K+59sNQws="; pin-sha256="K87oWBWM9UZfyddvDfoxL+8lpNyoUB2ptGtn0fv6G2Q="; pin-sha256="IQBnNBEiFuhj+8x6X8XLgh01V9Ic5/V3IRQLNFFc7v4=";
+     * pin-sha256="iie1VXtL7HzAMF+/PVPR9xzT80kQxdZeJ+zduCB3uj0="; pin-sha256="LvRiGEjRqfzurezaWuj8Wie2gyHMrW5Q06LspMnox7A="; includeSubDomains
+     * ```
+     * @since v0.3.6
+     * @param options Accepts all `options` from `request`, with some differences in default values:
+     */
+    function request(options: RequestOptions | string | URL, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
+    function request(url: string | URL, options: RequestOptions, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
+    /**
+     * Like `http.get()` but for HTTPS.
+     *
+     * `options` can be an object, a string, or a `URL` object. If `options` is a
+     * string, it is automatically parsed with `new URL()`. If it is a `URL` object, it will be automatically converted to an ordinary `options` object.
+     *
+     * ```js
+     * const https = require('https');
+     *
+     * https.get('https://encrypted.google.com/', (res) => {
+     *   console.log('statusCode:', res.statusCode);
+     *   console.log('headers:', res.headers);
+     *
+     *   res.on('data', (d) => {
+     *     process.stdout.write(d);
+     *   });
+     *
+     * }).on('error', (e) => {
+     *   console.error(e);
+     * });
+     * ```
+     * @since v0.3.6
+     * @param options Accepts the same `options` as {@link request}, with the `method` always set to `GET`.
+     */
+    function get(options: RequestOptions | string | URL, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
+    function get(url: string | URL, options: RequestOptions, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
+    let globalAgent: Agent;
+}
+declare module 'node:https' {
+    export * from 'https';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/index.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/index.d.ts
new file mode 100644
index 0000000..ae3e4cc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/index.d.ts
@@ -0,0 +1,129 @@
+// Type definitions for non-npm package Node.js 17.0
+// Project: https://nodejs.org/
+// Definitions by: Microsoft TypeScript <https://github.com/Microsoft>
+//                 DefinitelyTyped <https://github.com/DefinitelyTyped>
+//                 Alberto Schiabel <https://github.com/jkomyno>
+//                 Alvis HT Tang <https://github.com/alvis>
+//                 Andrew Makarov <https://github.com/r3nya>
+//                 Benjamin Toueg <https://github.com/btoueg>
+//                 Chigozirim C. <https://github.com/smac89>
+//                 David Junger <https://github.com/touffy>
+//                 Deividas Bakanas <https://github.com/DeividasBakanas>
+//                 Eugene Y. Q. Shen <https://github.com/eyqs>
+//                 Hannes Magnusson <https://github.com/Hannes-Magnusson-CK>
+//                 Huw <https://github.com/hoo29>
+//                 Kelvin Jin <https://github.com/kjin>
+//                 Klaus Meinhardt <https://github.com/ajafff>
+//                 Lishude <https://github.com/islishude>
+//                 Mariusz Wiktorczyk <https://github.com/mwiktorczyk>
+//                 Mohsen Azimi <https://github.com/mohsen1>
+//                 Nicolas Even <https://github.com/n-e>
+//                 Nikita Galkin <https://github.com/galkin>
+//                 Parambir Singh <https://github.com/parambirs>
+//                 Sebastian Silbermann <https://github.com/eps1lon>
+//                 Simon Schick <https://github.com/SimonSchick>
+//                 Thomas den Hollander <https://github.com/ThomasdenH>
+//                 Wilco Bakker <https://github.com/WilcoBakker>
+//                 wwwy3y3 <https://github.com/wwwy3y3>
+//                 Samuel Ainsworth <https://github.com/samuela>
+//                 Kyle Uehlein <https://github.com/kuehlein>
+//                 Thanik Bhongbhibhat <https://github.com/bhongy>
+//                 Marcin Kopacz <https://github.com/chyzwar>
+//                 Trivikram Kamat <https://github.com/trivikr>
+//                 Junxiao Shi <https://github.com/yoursunny>
+//                 Ilia Baryshnikov <https://github.com/qwelias>
+//                 ExE Boss <https://github.com/ExE-Boss>
+//                 Piotr Błażejewicz <https://github.com/peterblazejewicz>
+//                 Anna Henningsen <https://github.com/addaleax>
+//                 Victor Perin <https://github.com/victorperin>
+//                 Yongsheng Zhang <https://github.com/ZYSzys>
+//                 NodeJS Contributors <https://github.com/NodeJS>
+//                 Linus Unnebäck <https://github.com/LinusU>
+//                 wafuwafu13 <https://github.com/wafuwafu13>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/**
+ * License for programmatically and manually incorporated
+ * documentation aka. `JSDoc` from https://github.com/nodejs/node/tree/master/doc
+ *
+ * Copyright Node.js contributors. All rights reserved.
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to
+ * deal in the Software without restriction, including without limitation the
+ * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+ * sell copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+ * IN THE SOFTWARE.
+ */
+
+// NOTE: These definitions support NodeJS and TypeScript 3.7+.
+
+// Reference required types from the default lib:
+/// <reference lib="es2020" />
+/// <reference lib="esnext.asynciterable" />
+/// <reference lib="esnext.intl" />
+/// <reference lib="esnext.bigint" />
+
+// Base definitions for all NodeJS modules that are not specific to any version of TypeScript:
+/// <reference path="assert.d.ts" />
+/// <reference path="assert/strict.d.ts" />
+/// <reference path="globals.d.ts" />
+/// <reference path="async_hooks.d.ts" />
+/// <reference path="buffer.d.ts" />
+/// <reference path="child_process.d.ts" />
+/// <reference path="cluster.d.ts" />
+/// <reference path="console.d.ts" />
+/// <reference path="constants.d.ts" />
+/// <reference path="crypto.d.ts" />
+/// <reference path="dgram.d.ts" />
+/// <reference path="diagnostics_channel.d.ts" />
+/// <reference path="dns.d.ts" />
+/// <reference path="dns/promises.d.ts" />
+/// <reference path="dns/promises.d.ts" />
+/// <reference path="domain.d.ts" />
+/// <reference path="events.d.ts" />
+/// <reference path="fs.d.ts" />
+/// <reference path="fs/promises.d.ts" />
+/// <reference path="http.d.ts" />
+/// <reference path="http2.d.ts" />
+/// <reference path="https.d.ts" />
+/// <reference path="inspector.d.ts" />
+/// <reference path="module.d.ts" />
+/// <reference path="net.d.ts" />
+/// <reference path="os.d.ts" />
+/// <reference path="path.d.ts" />
+/// <reference path="perf_hooks.d.ts" />
+/// <reference path="process.d.ts" />
+/// <reference path="punycode.d.ts" />
+/// <reference path="querystring.d.ts" />
+/// <reference path="readline.d.ts" />
+/// <reference path="repl.d.ts" />
+/// <reference path="stream.d.ts" />
+/// <reference path="stream/promises.d.ts" />
+/// <reference path="stream/consumers.d.ts" />
+/// <reference path="stream/web.d.ts" />
+/// <reference path="string_decoder.d.ts" />
+/// <reference path="timers.d.ts" />
+/// <reference path="timers/promises.d.ts" />
+/// <reference path="tls.d.ts" />
+/// <reference path="trace_events.d.ts" />
+/// <reference path="tty.d.ts" />
+/// <reference path="url.d.ts" />
+/// <reference path="util.d.ts" />
+/// <reference path="v8.d.ts" />
+/// <reference path="vm.d.ts" />
+/// <reference path="wasi.d.ts" />
+/// <reference path="worker_threads.d.ts" />
+/// <reference path="zlib.d.ts" />
+
+/// <reference path="globals.global.d.ts" />
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/inspector.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/inspector.d.ts
new file mode 100644
index 0000000..7b9598c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/inspector.d.ts
@@ -0,0 +1,2744 @@
+// tslint:disable-next-line:dt-header
+// Type definitions for inspector
+
+// These definitions are auto-generated.
+// Please see https://github.com/DefinitelyTyped/DefinitelyTyped/pull/19330
+// for more information.
+
+// tslint:disable:max-line-length
+
+/**
+ * The `inspector` module provides an API for interacting with the V8 inspector.
+ *
+ * It can be accessed using:
+ *
+ * ```js
+ * const inspector = require('inspector');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/inspector.js)
+ */
+declare module 'inspector' {
+    import EventEmitter = require('node:events');
+    interface InspectorNotification<T> {
+        method: string;
+        params: T;
+    }
+    namespace Schema {
+        /**
+         * Description of the protocol domain.
+         */
+        interface Domain {
+            /**
+             * Domain name.
+             */
+            name: string;
+            /**
+             * Domain version.
+             */
+            version: string;
+        }
+        interface GetDomainsReturnType {
+            /**
+             * List of supported domains.
+             */
+            domains: Domain[];
+        }
+    }
+    namespace Runtime {
+        /**
+         * Unique script identifier.
+         */
+        type ScriptId = string;
+        /**
+         * Unique object identifier.
+         */
+        type RemoteObjectId = string;
+        /**
+         * Primitive value which cannot be JSON-stringified.
+         */
+        type UnserializableValue = string;
+        /**
+         * Mirror object referencing original JavaScript object.
+         */
+        interface RemoteObject {
+            /**
+             * Object type.
+             */
+            type: string;
+            /**
+             * Object subtype hint. Specified for <code>object</code> type values only.
+             */
+            subtype?: string | undefined;
+            /**
+             * Object class (constructor) name. Specified for <code>object</code> type values only.
+             */
+            className?: string | undefined;
+            /**
+             * Remote object value in case of primitive values or JSON values (if it was requested).
+             */
+            value?: any;
+            /**
+             * Primitive value which can not be JSON-stringified does not have <code>value</code>, but gets this property.
+             */
+            unserializableValue?: UnserializableValue | undefined;
+            /**
+             * String representation of the object.
+             */
+            description?: string | undefined;
+            /**
+             * Unique object identifier (for non-primitive values).
+             */
+            objectId?: RemoteObjectId | undefined;
+            /**
+             * Preview containing abbreviated property values. Specified for <code>object</code> type values only.
+             * @experimental
+             */
+            preview?: ObjectPreview | undefined;
+            /**
+             * @experimental
+             */
+            customPreview?: CustomPreview | undefined;
+        }
+        /**
+         * @experimental
+         */
+        interface CustomPreview {
+            header: string;
+            hasBody: boolean;
+            formatterObjectId: RemoteObjectId;
+            bindRemoteObjectFunctionId: RemoteObjectId;
+            configObjectId?: RemoteObjectId | undefined;
+        }
+        /**
+         * Object containing abbreviated remote object value.
+         * @experimental
+         */
+        interface ObjectPreview {
+            /**
+             * Object type.
+             */
+            type: string;
+            /**
+             * Object subtype hint. Specified for <code>object</code> type values only.
+             */
+            subtype?: string | undefined;
+            /**
+             * String representation of the object.
+             */
+            description?: string | undefined;
+            /**
+             * True iff some of the properties or entries of the original object did not fit.
+             */
+            overflow: boolean;
+            /**
+             * List of the properties.
+             */
+            properties: PropertyPreview[];
+            /**
+             * List of the entries. Specified for <code>map</code> and <code>set</code> subtype values only.
+             */
+            entries?: EntryPreview[] | undefined;
+        }
+        /**
+         * @experimental
+         */
+        interface PropertyPreview {
+            /**
+             * Property name.
+             */
+            name: string;
+            /**
+             * Object type. Accessor means that the property itself is an accessor property.
+             */
+            type: string;
+            /**
+             * User-friendly property value string.
+             */
+            value?: string | undefined;
+            /**
+             * Nested value preview.
+             */
+            valuePreview?: ObjectPreview | undefined;
+            /**
+             * Object subtype hint. Specified for <code>object</code> type values only.
+             */
+            subtype?: string | undefined;
+        }
+        /**
+         * @experimental
+         */
+        interface EntryPreview {
+            /**
+             * Preview of the key. Specified for map-like collection entries.
+             */
+            key?: ObjectPreview | undefined;
+            /**
+             * Preview of the value.
+             */
+            value: ObjectPreview;
+        }
+        /**
+         * Object property descriptor.
+         */
+        interface PropertyDescriptor {
+            /**
+             * Property name or symbol description.
+             */
+            name: string;
+            /**
+             * The value associated with the property.
+             */
+            value?: RemoteObject | undefined;
+            /**
+             * True if the value associated with the property may be changed (data descriptors only).
+             */
+            writable?: boolean | undefined;
+            /**
+             * A function which serves as a getter for the property, or <code>undefined</code> if there is no getter (accessor descriptors only).
+             */
+            get?: RemoteObject | undefined;
+            /**
+             * A function which serves as a setter for the property, or <code>undefined</code> if there is no setter (accessor descriptors only).
+             */
+            set?: RemoteObject | undefined;
+            /**
+             * True if the type of this property descriptor may be changed and if the property may be deleted from the corresponding object.
+             */
+            configurable: boolean;
+            /**
+             * True if this property shows up during enumeration of the properties on the corresponding object.
+             */
+            enumerable: boolean;
+            /**
+             * True if the result was thrown during the evaluation.
+             */
+            wasThrown?: boolean | undefined;
+            /**
+             * True if the property is owned for the object.
+             */
+            isOwn?: boolean | undefined;
+            /**
+             * Property symbol object, if the property is of the <code>symbol</code> type.
+             */
+            symbol?: RemoteObject | undefined;
+        }
+        /**
+         * Object internal property descriptor. This property isn't normally visible in JavaScript code.
+         */
+        interface InternalPropertyDescriptor {
+            /**
+             * Conventional property name.
+             */
+            name: string;
+            /**
+             * The value associated with the property.
+             */
+            value?: RemoteObject | undefined;
+        }
+        /**
+         * Represents function call argument. Either remote object id <code>objectId</code>, primitive <code>value</code>, unserializable primitive value or neither of (for undefined) them should be specified.
+         */
+        interface CallArgument {
+            /**
+             * Primitive value or serializable javascript object.
+             */
+            value?: any;
+            /**
+             * Primitive value which can not be JSON-stringified.
+             */
+            unserializableValue?: UnserializableValue | undefined;
+            /**
+             * Remote object handle.
+             */
+            objectId?: RemoteObjectId | undefined;
+        }
+        /**
+         * Id of an execution context.
+         */
+        type ExecutionContextId = number;
+        /**
+         * Description of an isolated world.
+         */
+        interface ExecutionContextDescription {
+            /**
+             * Unique id of the execution context. It can be used to specify in which execution context script evaluation should be performed.
+             */
+            id: ExecutionContextId;
+            /**
+             * Execution context origin.
+             */
+            origin: string;
+            /**
+             * Human readable name describing given context.
+             */
+            name: string;
+            /**
+             * Embedder-specific auxiliary data.
+             */
+            auxData?: {} | undefined;
+        }
+        /**
+         * Detailed information about exception (or error) that was thrown during script compilation or execution.
+         */
+        interface ExceptionDetails {
+            /**
+             * Exception id.
+             */
+            exceptionId: number;
+            /**
+             * Exception text, which should be used together with exception object when available.
+             */
+            text: string;
+            /**
+             * Line number of the exception location (0-based).
+             */
+            lineNumber: number;
+            /**
+             * Column number of the exception location (0-based).
+             */
+            columnNumber: number;
+            /**
+             * Script ID of the exception location.
+             */
+            scriptId?: ScriptId | undefined;
+            /**
+             * URL of the exception location, to be used when the script was not reported.
+             */
+            url?: string | undefined;
+            /**
+             * JavaScript stack trace if available.
+             */
+            stackTrace?: StackTrace | undefined;
+            /**
+             * Exception object if available.
+             */
+            exception?: RemoteObject | undefined;
+            /**
+             * Identifier of the context where exception happened.
+             */
+            executionContextId?: ExecutionContextId | undefined;
+        }
+        /**
+         * Number of milliseconds since epoch.
+         */
+        type Timestamp = number;
+        /**
+         * Stack entry for runtime errors and assertions.
+         */
+        interface CallFrame {
+            /**
+             * JavaScript function name.
+             */
+            functionName: string;
+            /**
+             * JavaScript script id.
+             */
+            scriptId: ScriptId;
+            /**
+             * JavaScript script name or url.
+             */
+            url: string;
+            /**
+             * JavaScript script line number (0-based).
+             */
+            lineNumber: number;
+            /**
+             * JavaScript script column number (0-based).
+             */
+            columnNumber: number;
+        }
+        /**
+         * Call frames for assertions or error messages.
+         */
+        interface StackTrace {
+            /**
+             * String label of this stack trace. For async traces this may be a name of the function that initiated the async call.
+             */
+            description?: string | undefined;
+            /**
+             * JavaScript function name.
+             */
+            callFrames: CallFrame[];
+            /**
+             * Asynchronous JavaScript stack trace that preceded this stack, if available.
+             */
+            parent?: StackTrace | undefined;
+            /**
+             * Asynchronous JavaScript stack trace that preceded this stack, if available.
+             * @experimental
+             */
+            parentId?: StackTraceId | undefined;
+        }
+        /**
+         * Unique identifier of current debugger.
+         * @experimental
+         */
+        type UniqueDebuggerId = string;
+        /**
+         * If <code>debuggerId</code> is set stack trace comes from another debugger and can be resolved there. This allows to track cross-debugger calls. See <code>Runtime.StackTrace</code> and <code>Debugger.paused</code> for usages.
+         * @experimental
+         */
+        interface StackTraceId {
+            id: string;
+            debuggerId?: UniqueDebuggerId | undefined;
+        }
+        interface EvaluateParameterType {
+            /**
+             * Expression to evaluate.
+             */
+            expression: string;
+            /**
+             * Symbolic group name that can be used to release multiple objects.
+             */
+            objectGroup?: string | undefined;
+            /**
+             * Determines whether Command Line API should be available during the evaluation.
+             */
+            includeCommandLineAPI?: boolean | undefined;
+            /**
+             * In silent mode exceptions thrown during evaluation are not reported and do not pause execution. Overrides <code>setPauseOnException</code> state.
+             */
+            silent?: boolean | undefined;
+            /**
+             * Specifies in which execution context to perform evaluation. If the parameter is omitted the evaluation will be performed in the context of the inspected page.
+             */
+            contextId?: ExecutionContextId | undefined;
+            /**
+             * Whether the result is expected to be a JSON object that should be sent by value.
+             */
+            returnByValue?: boolean | undefined;
+            /**
+             * Whether preview should be generated for the result.
+             * @experimental
+             */
+            generatePreview?: boolean | undefined;
+            /**
+             * Whether execution should be treated as initiated by user in the UI.
+             */
+            userGesture?: boolean | undefined;
+            /**
+             * Whether execution should <code>await</code> for resulting value and return once awaited promise is resolved.
+             */
+            awaitPromise?: boolean | undefined;
+        }
+        interface AwaitPromiseParameterType {
+            /**
+             * Identifier of the promise.
+             */
+            promiseObjectId: RemoteObjectId;
+            /**
+             * Whether the result is expected to be a JSON object that should be sent by value.
+             */
+            returnByValue?: boolean | undefined;
+            /**
+             * Whether preview should be generated for the result.
+             */
+            generatePreview?: boolean | undefined;
+        }
+        interface CallFunctionOnParameterType {
+            /**
+             * Declaration of the function to call.
+             */
+            functionDeclaration: string;
+            /**
+             * Identifier of the object to call function on. Either objectId or executionContextId should be specified.
+             */
+            objectId?: RemoteObjectId | undefined;
+            /**
+             * Call arguments. All call arguments must belong to the same JavaScript world as the target object.
+             */
+            arguments?: CallArgument[] | undefined;
+            /**
+             * In silent mode exceptions thrown during evaluation are not reported and do not pause execution. Overrides <code>setPauseOnException</code> state.
+             */
+            silent?: boolean | undefined;
+            /**
+             * Whether the result is expected to be a JSON object which should be sent by value.
+             */
+            returnByValue?: boolean | undefined;
+            /**
+             * Whether preview should be generated for the result.
+             * @experimental
+             */
+            generatePreview?: boolean | undefined;
+            /**
+             * Whether execution should be treated as initiated by user in the UI.
+             */
+            userGesture?: boolean | undefined;
+            /**
+             * Whether execution should <code>await</code> for resulting value and return once awaited promise is resolved.
+             */
+            awaitPromise?: boolean | undefined;
+            /**
+             * Specifies execution context which global object will be used to call function on. Either executionContextId or objectId should be specified.
+             */
+            executionContextId?: ExecutionContextId | undefined;
+            /**
+             * Symbolic group name that can be used to release multiple objects. If objectGroup is not specified and objectId is, objectGroup will be inherited from object.
+             */
+            objectGroup?: string | undefined;
+        }
+        interface GetPropertiesParameterType {
+            /**
+             * Identifier of the object to return properties for.
+             */
+            objectId: RemoteObjectId;
+            /**
+             * If true, returns properties belonging only to the element itself, not to its prototype chain.
+             */
+            ownProperties?: boolean | undefined;
+            /**
+             * If true, returns accessor properties (with getter/setter) only; internal properties are not returned either.
+             * @experimental
+             */
+            accessorPropertiesOnly?: boolean | undefined;
+            /**
+             * Whether preview should be generated for the results.
+             * @experimental
+             */
+            generatePreview?: boolean | undefined;
+        }
+        interface ReleaseObjectParameterType {
+            /**
+             * Identifier of the object to release.
+             */
+            objectId: RemoteObjectId;
+        }
+        interface ReleaseObjectGroupParameterType {
+            /**
+             * Symbolic object group name.
+             */
+            objectGroup: string;
+        }
+        interface SetCustomObjectFormatterEnabledParameterType {
+            enabled: boolean;
+        }
+        interface CompileScriptParameterType {
+            /**
+             * Expression to compile.
+             */
+            expression: string;
+            /**
+             * Source url to be set for the script.
+             */
+            sourceURL: string;
+            /**
+             * Specifies whether the compiled script should be persisted.
+             */
+            persistScript: boolean;
+            /**
+             * Specifies in which execution context to perform script run. If the parameter is omitted the evaluation will be performed in the context of the inspected page.
+             */
+            executionContextId?: ExecutionContextId | undefined;
+        }
+        interface RunScriptParameterType {
+            /**
+             * Id of the script to run.
+             */
+            scriptId: ScriptId;
+            /**
+             * Specifies in which execution context to perform script run. If the parameter is omitted the evaluation will be performed in the context of the inspected page.
+             */
+            executionContextId?: ExecutionContextId | undefined;
+            /**
+             * Symbolic group name that can be used to release multiple objects.
+             */
+            objectGroup?: string | undefined;
+            /**
+             * In silent mode exceptions thrown during evaluation are not reported and do not pause execution. Overrides <code>setPauseOnException</code> state.
+             */
+            silent?: boolean | undefined;
+            /**
+             * Determines whether Command Line API should be available during the evaluation.
+             */
+            includeCommandLineAPI?: boolean | undefined;
+            /**
+             * Whether the result is expected to be a JSON object which should be sent by value.
+             */
+            returnByValue?: boolean | undefined;
+            /**
+             * Whether preview should be generated for the result.
+             */
+            generatePreview?: boolean | undefined;
+            /**
+             * Whether execution should <code>await</code> for resulting value and return once awaited promise is resolved.
+             */
+            awaitPromise?: boolean | undefined;
+        }
+        interface QueryObjectsParameterType {
+            /**
+             * Identifier of the prototype to return objects for.
+             */
+            prototypeObjectId: RemoteObjectId;
+        }
+        interface GlobalLexicalScopeNamesParameterType {
+            /**
+             * Specifies in which execution context to lookup global scope variables.
+             */
+            executionContextId?: ExecutionContextId | undefined;
+        }
+        interface EvaluateReturnType {
+            /**
+             * Evaluation result.
+             */
+            result: RemoteObject;
+            /**
+             * Exception details.
+             */
+            exceptionDetails?: ExceptionDetails | undefined;
+        }
+        interface AwaitPromiseReturnType {
+            /**
+             * Promise result. Will contain rejected value if promise was rejected.
+             */
+            result: RemoteObject;
+            /**
+             * Exception details if stack strace is available.
+             */
+            exceptionDetails?: ExceptionDetails | undefined;
+        }
+        interface CallFunctionOnReturnType {
+            /**
+             * Call result.
+             */
+            result: RemoteObject;
+            /**
+             * Exception details.
+             */
+            exceptionDetails?: ExceptionDetails | undefined;
+        }
+        interface GetPropertiesReturnType {
+            /**
+             * Object properties.
+             */
+            result: PropertyDescriptor[];
+            /**
+             * Internal object properties (only of the element itself).
+             */
+            internalProperties?: InternalPropertyDescriptor[] | undefined;
+            /**
+             * Exception details.
+             */
+            exceptionDetails?: ExceptionDetails | undefined;
+        }
+        interface CompileScriptReturnType {
+            /**
+             * Id of the script.
+             */
+            scriptId?: ScriptId | undefined;
+            /**
+             * Exception details.
+             */
+            exceptionDetails?: ExceptionDetails | undefined;
+        }
+        interface RunScriptReturnType {
+            /**
+             * Run result.
+             */
+            result: RemoteObject;
+            /**
+             * Exception details.
+             */
+            exceptionDetails?: ExceptionDetails | undefined;
+        }
+        interface QueryObjectsReturnType {
+            /**
+             * Array with objects.
+             */
+            objects: RemoteObject;
+        }
+        interface GlobalLexicalScopeNamesReturnType {
+            names: string[];
+        }
+        interface ExecutionContextCreatedEventDataType {
+            /**
+             * A newly created execution context.
+             */
+            context: ExecutionContextDescription;
+        }
+        interface ExecutionContextDestroyedEventDataType {
+            /**
+             * Id of the destroyed context
+             */
+            executionContextId: ExecutionContextId;
+        }
+        interface ExceptionThrownEventDataType {
+            /**
+             * Timestamp of the exception.
+             */
+            timestamp: Timestamp;
+            exceptionDetails: ExceptionDetails;
+        }
+        interface ExceptionRevokedEventDataType {
+            /**
+             * Reason describing why exception was revoked.
+             */
+            reason: string;
+            /**
+             * The id of revoked exception, as reported in <code>exceptionThrown</code>.
+             */
+            exceptionId: number;
+        }
+        interface ConsoleAPICalledEventDataType {
+            /**
+             * Type of the call.
+             */
+            type: string;
+            /**
+             * Call arguments.
+             */
+            args: RemoteObject[];
+            /**
+             * Identifier of the context where the call was made.
+             */
+            executionContextId: ExecutionContextId;
+            /**
+             * Call timestamp.
+             */
+            timestamp: Timestamp;
+            /**
+             * Stack trace captured when the call was made.
+             */
+            stackTrace?: StackTrace | undefined;
+            /**
+             * Console context descriptor for calls on non-default console context (not console.*): 'anonymous#unique-logger-id' for call on unnamed context, 'name#unique-logger-id' for call on named context.
+             * @experimental
+             */
+            context?: string | undefined;
+        }
+        interface InspectRequestedEventDataType {
+            object: RemoteObject;
+            hints: {};
+        }
+    }
+    namespace Debugger {
+        /**
+         * Breakpoint identifier.
+         */
+        type BreakpointId = string;
+        /**
+         * Call frame identifier.
+         */
+        type CallFrameId = string;
+        /**
+         * Location in the source code.
+         */
+        interface Location {
+            /**
+             * Script identifier as reported in the <code>Debugger.scriptParsed</code>.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * Line number in the script (0-based).
+             */
+            lineNumber: number;
+            /**
+             * Column number in the script (0-based).
+             */
+            columnNumber?: number | undefined;
+        }
+        /**
+         * Location in the source code.
+         * @experimental
+         */
+        interface ScriptPosition {
+            lineNumber: number;
+            columnNumber: number;
+        }
+        /**
+         * JavaScript call frame. Array of call frames form the call stack.
+         */
+        interface CallFrame {
+            /**
+             * Call frame identifier. This identifier is only valid while the virtual machine is paused.
+             */
+            callFrameId: CallFrameId;
+            /**
+             * Name of the JavaScript function called on this call frame.
+             */
+            functionName: string;
+            /**
+             * Location in the source code.
+             */
+            functionLocation?: Location | undefined;
+            /**
+             * Location in the source code.
+             */
+            location: Location;
+            /**
+             * JavaScript script name or url.
+             */
+            url: string;
+            /**
+             * Scope chain for this call frame.
+             */
+            scopeChain: Scope[];
+            /**
+             * <code>this</code> object for this call frame.
+             */
+            this: Runtime.RemoteObject;
+            /**
+             * The value being returned, if the function is at return point.
+             */
+            returnValue?: Runtime.RemoteObject | undefined;
+        }
+        /**
+         * Scope description.
+         */
+        interface Scope {
+            /**
+             * Scope type.
+             */
+            type: string;
+            /**
+             * Object representing the scope. For <code>global</code> and <code>with</code> scopes it represents the actual object; for the rest of the scopes, it is artificial transient object enumerating scope variables as its properties.
+             */
+            object: Runtime.RemoteObject;
+            name?: string | undefined;
+            /**
+             * Location in the source code where scope starts
+             */
+            startLocation?: Location | undefined;
+            /**
+             * Location in the source code where scope ends
+             */
+            endLocation?: Location | undefined;
+        }
+        /**
+         * Search match for resource.
+         */
+        interface SearchMatch {
+            /**
+             * Line number in resource content.
+             */
+            lineNumber: number;
+            /**
+             * Line with match content.
+             */
+            lineContent: string;
+        }
+        interface BreakLocation {
+            /**
+             * Script identifier as reported in the <code>Debugger.scriptParsed</code>.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * Line number in the script (0-based).
+             */
+            lineNumber: number;
+            /**
+             * Column number in the script (0-based).
+             */
+            columnNumber?: number | undefined;
+            type?: string | undefined;
+        }
+        interface SetBreakpointsActiveParameterType {
+            /**
+             * New value for breakpoints active state.
+             */
+            active: boolean;
+        }
+        interface SetSkipAllPausesParameterType {
+            /**
+             * New value for skip pauses state.
+             */
+            skip: boolean;
+        }
+        interface SetBreakpointByUrlParameterType {
+            /**
+             * Line number to set breakpoint at.
+             */
+            lineNumber: number;
+            /**
+             * URL of the resources to set breakpoint on.
+             */
+            url?: string | undefined;
+            /**
+             * Regex pattern for the URLs of the resources to set breakpoints on. Either <code>url</code> or <code>urlRegex</code> must be specified.
+             */
+            urlRegex?: string | undefined;
+            /**
+             * Script hash of the resources to set breakpoint on.
+             */
+            scriptHash?: string | undefined;
+            /**
+             * Offset in the line to set breakpoint at.
+             */
+            columnNumber?: number | undefined;
+            /**
+             * Expression to use as a breakpoint condition. When specified, debugger will only stop on the breakpoint if this expression evaluates to true.
+             */
+            condition?: string | undefined;
+        }
+        interface SetBreakpointParameterType {
+            /**
+             * Location to set breakpoint in.
+             */
+            location: Location;
+            /**
+             * Expression to use as a breakpoint condition. When specified, debugger will only stop on the breakpoint if this expression evaluates to true.
+             */
+            condition?: string | undefined;
+        }
+        interface RemoveBreakpointParameterType {
+            breakpointId: BreakpointId;
+        }
+        interface GetPossibleBreakpointsParameterType {
+            /**
+             * Start of range to search possible breakpoint locations in.
+             */
+            start: Location;
+            /**
+             * End of range to search possible breakpoint locations in (excluding). When not specified, end of scripts is used as end of range.
+             */
+            end?: Location | undefined;
+            /**
+             * Only consider locations which are in the same (non-nested) function as start.
+             */
+            restrictToFunction?: boolean | undefined;
+        }
+        interface ContinueToLocationParameterType {
+            /**
+             * Location to continue to.
+             */
+            location: Location;
+            targetCallFrames?: string | undefined;
+        }
+        interface PauseOnAsyncCallParameterType {
+            /**
+             * Debugger will pause when async call with given stack trace is started.
+             */
+            parentStackTraceId: Runtime.StackTraceId;
+        }
+        interface StepIntoParameterType {
+            /**
+             * Debugger will issue additional Debugger.paused notification if any async task is scheduled before next pause.
+             * @experimental
+             */
+            breakOnAsyncCall?: boolean | undefined;
+        }
+        interface GetStackTraceParameterType {
+            stackTraceId: Runtime.StackTraceId;
+        }
+        interface SearchInContentParameterType {
+            /**
+             * Id of the script to search in.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * String to search for.
+             */
+            query: string;
+            /**
+             * If true, search is case sensitive.
+             */
+            caseSensitive?: boolean | undefined;
+            /**
+             * If true, treats string parameter as regex.
+             */
+            isRegex?: boolean | undefined;
+        }
+        interface SetScriptSourceParameterType {
+            /**
+             * Id of the script to edit.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * New content of the script.
+             */
+            scriptSource: string;
+            /**
+             *  If true the change will not actually be applied. Dry run may be used to get result description without actually modifying the code.
+             */
+            dryRun?: boolean | undefined;
+        }
+        interface RestartFrameParameterType {
+            /**
+             * Call frame identifier to evaluate on.
+             */
+            callFrameId: CallFrameId;
+        }
+        interface GetScriptSourceParameterType {
+            /**
+             * Id of the script to get source for.
+             */
+            scriptId: Runtime.ScriptId;
+        }
+        interface SetPauseOnExceptionsParameterType {
+            /**
+             * Pause on exceptions mode.
+             */
+            state: string;
+        }
+        interface EvaluateOnCallFrameParameterType {
+            /**
+             * Call frame identifier to evaluate on.
+             */
+            callFrameId: CallFrameId;
+            /**
+             * Expression to evaluate.
+             */
+            expression: string;
+            /**
+             * String object group name to put result into (allows rapid releasing resulting object handles using <code>releaseObjectGroup</code>).
+             */
+            objectGroup?: string | undefined;
+            /**
+             * Specifies whether command line API should be available to the evaluated expression, defaults to false.
+             */
+            includeCommandLineAPI?: boolean | undefined;
+            /**
+             * In silent mode exceptions thrown during evaluation are not reported and do not pause execution. Overrides <code>setPauseOnException</code> state.
+             */
+            silent?: boolean | undefined;
+            /**
+             * Whether the result is expected to be a JSON object that should be sent by value.
+             */
+            returnByValue?: boolean | undefined;
+            /**
+             * Whether preview should be generated for the result.
+             * @experimental
+             */
+            generatePreview?: boolean | undefined;
+            /**
+             * Whether to throw an exception if side effect cannot be ruled out during evaluation.
+             */
+            throwOnSideEffect?: boolean | undefined;
+        }
+        interface SetVariableValueParameterType {
+            /**
+             * 0-based number of scope as was listed in scope chain. Only 'local', 'closure' and 'catch' scope types are allowed. Other scopes could be manipulated manually.
+             */
+            scopeNumber: number;
+            /**
+             * Variable name.
+             */
+            variableName: string;
+            /**
+             * New variable value.
+             */
+            newValue: Runtime.CallArgument;
+            /**
+             * Id of callframe that holds variable.
+             */
+            callFrameId: CallFrameId;
+        }
+        interface SetReturnValueParameterType {
+            /**
+             * New return value.
+             */
+            newValue: Runtime.CallArgument;
+        }
+        interface SetAsyncCallStackDepthParameterType {
+            /**
+             * Maximum depth of async call stacks. Setting to <code>0</code> will effectively disable collecting async call stacks (default).
+             */
+            maxDepth: number;
+        }
+        interface SetBlackboxPatternsParameterType {
+            /**
+             * Array of regexps that will be used to check script url for blackbox state.
+             */
+            patterns: string[];
+        }
+        interface SetBlackboxedRangesParameterType {
+            /**
+             * Id of the script.
+             */
+            scriptId: Runtime.ScriptId;
+            positions: ScriptPosition[];
+        }
+        interface EnableReturnType {
+            /**
+             * Unique identifier of the debugger.
+             * @experimental
+             */
+            debuggerId: Runtime.UniqueDebuggerId;
+        }
+        interface SetBreakpointByUrlReturnType {
+            /**
+             * Id of the created breakpoint for further reference.
+             */
+            breakpointId: BreakpointId;
+            /**
+             * List of the locations this breakpoint resolved into upon addition.
+             */
+            locations: Location[];
+        }
+        interface SetBreakpointReturnType {
+            /**
+             * Id of the created breakpoint for further reference.
+             */
+            breakpointId: BreakpointId;
+            /**
+             * Location this breakpoint resolved into.
+             */
+            actualLocation: Location;
+        }
+        interface GetPossibleBreakpointsReturnType {
+            /**
+             * List of the possible breakpoint locations.
+             */
+            locations: BreakLocation[];
+        }
+        interface GetStackTraceReturnType {
+            stackTrace: Runtime.StackTrace;
+        }
+        interface SearchInContentReturnType {
+            /**
+             * List of search matches.
+             */
+            result: SearchMatch[];
+        }
+        interface SetScriptSourceReturnType {
+            /**
+             * New stack trace in case editing has happened while VM was stopped.
+             */
+            callFrames?: CallFrame[] | undefined;
+            /**
+             * Whether current call stack  was modified after applying the changes.
+             */
+            stackChanged?: boolean | undefined;
+            /**
+             * Async stack trace, if any.
+             */
+            asyncStackTrace?: Runtime.StackTrace | undefined;
+            /**
+             * Async stack trace, if any.
+             * @experimental
+             */
+            asyncStackTraceId?: Runtime.StackTraceId | undefined;
+            /**
+             * Exception details if any.
+             */
+            exceptionDetails?: Runtime.ExceptionDetails | undefined;
+        }
+        interface RestartFrameReturnType {
+            /**
+             * New stack trace.
+             */
+            callFrames: CallFrame[];
+            /**
+             * Async stack trace, if any.
+             */
+            asyncStackTrace?: Runtime.StackTrace | undefined;
+            /**
+             * Async stack trace, if any.
+             * @experimental
+             */
+            asyncStackTraceId?: Runtime.StackTraceId | undefined;
+        }
+        interface GetScriptSourceReturnType {
+            /**
+             * Script source.
+             */
+            scriptSource: string;
+        }
+        interface EvaluateOnCallFrameReturnType {
+            /**
+             * Object wrapper for the evaluation result.
+             */
+            result: Runtime.RemoteObject;
+            /**
+             * Exception details.
+             */
+            exceptionDetails?: Runtime.ExceptionDetails | undefined;
+        }
+        interface ScriptParsedEventDataType {
+            /**
+             * Identifier of the script parsed.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * URL or name of the script parsed (if any).
+             */
+            url: string;
+            /**
+             * Line offset of the script within the resource with given URL (for script tags).
+             */
+            startLine: number;
+            /**
+             * Column offset of the script within the resource with given URL.
+             */
+            startColumn: number;
+            /**
+             * Last line of the script.
+             */
+            endLine: number;
+            /**
+             * Length of the last line of the script.
+             */
+            endColumn: number;
+            /**
+             * Specifies script creation context.
+             */
+            executionContextId: Runtime.ExecutionContextId;
+            /**
+             * Content hash of the script.
+             */
+            hash: string;
+            /**
+             * Embedder-specific auxiliary data.
+             */
+            executionContextAuxData?: {} | undefined;
+            /**
+             * True, if this script is generated as a result of the live edit operation.
+             * @experimental
+             */
+            isLiveEdit?: boolean | undefined;
+            /**
+             * URL of source map associated with script (if any).
+             */
+            sourceMapURL?: string | undefined;
+            /**
+             * True, if this script has sourceURL.
+             */
+            hasSourceURL?: boolean | undefined;
+            /**
+             * True, if this script is ES6 module.
+             */
+            isModule?: boolean | undefined;
+            /**
+             * This script length.
+             */
+            length?: number | undefined;
+            /**
+             * JavaScript top stack frame of where the script parsed event was triggered if available.
+             * @experimental
+             */
+            stackTrace?: Runtime.StackTrace | undefined;
+        }
+        interface ScriptFailedToParseEventDataType {
+            /**
+             * Identifier of the script parsed.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * URL or name of the script parsed (if any).
+             */
+            url: string;
+            /**
+             * Line offset of the script within the resource with given URL (for script tags).
+             */
+            startLine: number;
+            /**
+             * Column offset of the script within the resource with given URL.
+             */
+            startColumn: number;
+            /**
+             * Last line of the script.
+             */
+            endLine: number;
+            /**
+             * Length of the last line of the script.
+             */
+            endColumn: number;
+            /**
+             * Specifies script creation context.
+             */
+            executionContextId: Runtime.ExecutionContextId;
+            /**
+             * Content hash of the script.
+             */
+            hash: string;
+            /**
+             * Embedder-specific auxiliary data.
+             */
+            executionContextAuxData?: {} | undefined;
+            /**
+             * URL of source map associated with script (if any).
+             */
+            sourceMapURL?: string | undefined;
+            /**
+             * True, if this script has sourceURL.
+             */
+            hasSourceURL?: boolean | undefined;
+            /**
+             * True, if this script is ES6 module.
+             */
+            isModule?: boolean | undefined;
+            /**
+             * This script length.
+             */
+            length?: number | undefined;
+            /**
+             * JavaScript top stack frame of where the script parsed event was triggered if available.
+             * @experimental
+             */
+            stackTrace?: Runtime.StackTrace | undefined;
+        }
+        interface BreakpointResolvedEventDataType {
+            /**
+             * Breakpoint unique identifier.
+             */
+            breakpointId: BreakpointId;
+            /**
+             * Actual breakpoint location.
+             */
+            location: Location;
+        }
+        interface PausedEventDataType {
+            /**
+             * Call stack the virtual machine stopped on.
+             */
+            callFrames: CallFrame[];
+            /**
+             * Pause reason.
+             */
+            reason: string;
+            /**
+             * Object containing break-specific auxiliary properties.
+             */
+            data?: {} | undefined;
+            /**
+             * Hit breakpoints IDs
+             */
+            hitBreakpoints?: string[] | undefined;
+            /**
+             * Async stack trace, if any.
+             */
+            asyncStackTrace?: Runtime.StackTrace | undefined;
+            /**
+             * Async stack trace, if any.
+             * @experimental
+             */
+            asyncStackTraceId?: Runtime.StackTraceId | undefined;
+            /**
+             * Just scheduled async call will have this stack trace as parent stack during async execution. This field is available only after <code>Debugger.stepInto</code> call with <code>breakOnAsynCall</code> flag.
+             * @experimental
+             */
+            asyncCallStackTraceId?: Runtime.StackTraceId | undefined;
+        }
+    }
+    namespace Console {
+        /**
+         * Console message.
+         */
+        interface ConsoleMessage {
+            /**
+             * Message source.
+             */
+            source: string;
+            /**
+             * Message severity.
+             */
+            level: string;
+            /**
+             * Message text.
+             */
+            text: string;
+            /**
+             * URL of the message origin.
+             */
+            url?: string | undefined;
+            /**
+             * Line number in the resource that generated this message (1-based).
+             */
+            line?: number | undefined;
+            /**
+             * Column number in the resource that generated this message (1-based).
+             */
+            column?: number | undefined;
+        }
+        interface MessageAddedEventDataType {
+            /**
+             * Console message that has been added.
+             */
+            message: ConsoleMessage;
+        }
+    }
+    namespace Profiler {
+        /**
+         * Profile node. Holds callsite information, execution statistics and child nodes.
+         */
+        interface ProfileNode {
+            /**
+             * Unique id of the node.
+             */
+            id: number;
+            /**
+             * Function location.
+             */
+            callFrame: Runtime.CallFrame;
+            /**
+             * Number of samples where this node was on top of the call stack.
+             */
+            hitCount?: number | undefined;
+            /**
+             * Child node ids.
+             */
+            children?: number[] | undefined;
+            /**
+             * The reason of being not optimized. The function may be deoptimized or marked as don't optimize.
+             */
+            deoptReason?: string | undefined;
+            /**
+             * An array of source position ticks.
+             */
+            positionTicks?: PositionTickInfo[] | undefined;
+        }
+        /**
+         * Profile.
+         */
+        interface Profile {
+            /**
+             * The list of profile nodes. First item is the root node.
+             */
+            nodes: ProfileNode[];
+            /**
+             * Profiling start timestamp in microseconds.
+             */
+            startTime: number;
+            /**
+             * Profiling end timestamp in microseconds.
+             */
+            endTime: number;
+            /**
+             * Ids of samples top nodes.
+             */
+            samples?: number[] | undefined;
+            /**
+             * Time intervals between adjacent samples in microseconds. The first delta is relative to the profile startTime.
+             */
+            timeDeltas?: number[] | undefined;
+        }
+        /**
+         * Specifies a number of samples attributed to a certain source position.
+         */
+        interface PositionTickInfo {
+            /**
+             * Source line number (1-based).
+             */
+            line: number;
+            /**
+             * Number of samples attributed to the source line.
+             */
+            ticks: number;
+        }
+        /**
+         * Coverage data for a source range.
+         */
+        interface CoverageRange {
+            /**
+             * JavaScript script source offset for the range start.
+             */
+            startOffset: number;
+            /**
+             * JavaScript script source offset for the range end.
+             */
+            endOffset: number;
+            /**
+             * Collected execution count of the source range.
+             */
+            count: number;
+        }
+        /**
+         * Coverage data for a JavaScript function.
+         */
+        interface FunctionCoverage {
+            /**
+             * JavaScript function name.
+             */
+            functionName: string;
+            /**
+             * Source ranges inside the function with coverage data.
+             */
+            ranges: CoverageRange[];
+            /**
+             * Whether coverage data for this function has block granularity.
+             */
+            isBlockCoverage: boolean;
+        }
+        /**
+         * Coverage data for a JavaScript script.
+         */
+        interface ScriptCoverage {
+            /**
+             * JavaScript script id.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * JavaScript script name or url.
+             */
+            url: string;
+            /**
+             * Functions contained in the script that has coverage data.
+             */
+            functions: FunctionCoverage[];
+        }
+        /**
+         * Describes a type collected during runtime.
+         * @experimental
+         */
+        interface TypeObject {
+            /**
+             * Name of a type collected with type profiling.
+             */
+            name: string;
+        }
+        /**
+         * Source offset and types for a parameter or return value.
+         * @experimental
+         */
+        interface TypeProfileEntry {
+            /**
+             * Source offset of the parameter or end of function for return values.
+             */
+            offset: number;
+            /**
+             * The types for this parameter or return value.
+             */
+            types: TypeObject[];
+        }
+        /**
+         * Type profile data collected during runtime for a JavaScript script.
+         * @experimental
+         */
+        interface ScriptTypeProfile {
+            /**
+             * JavaScript script id.
+             */
+            scriptId: Runtime.ScriptId;
+            /**
+             * JavaScript script name or url.
+             */
+            url: string;
+            /**
+             * Type profile entries for parameters and return values of the functions in the script.
+             */
+            entries: TypeProfileEntry[];
+        }
+        interface SetSamplingIntervalParameterType {
+            /**
+             * New sampling interval in microseconds.
+             */
+            interval: number;
+        }
+        interface StartPreciseCoverageParameterType {
+            /**
+             * Collect accurate call counts beyond simple 'covered' or 'not covered'.
+             */
+            callCount?: boolean | undefined;
+            /**
+             * Collect block-based coverage.
+             */
+            detailed?: boolean | undefined;
+        }
+        interface StopReturnType {
+            /**
+             * Recorded profile.
+             */
+            profile: Profile;
+        }
+        interface TakePreciseCoverageReturnType {
+            /**
+             * Coverage data for the current isolate.
+             */
+            result: ScriptCoverage[];
+        }
+        interface GetBestEffortCoverageReturnType {
+            /**
+             * Coverage data for the current isolate.
+             */
+            result: ScriptCoverage[];
+        }
+        interface TakeTypeProfileReturnType {
+            /**
+             * Type profile for all scripts since startTypeProfile() was turned on.
+             */
+            result: ScriptTypeProfile[];
+        }
+        interface ConsoleProfileStartedEventDataType {
+            id: string;
+            /**
+             * Location of console.profile().
+             */
+            location: Debugger.Location;
+            /**
+             * Profile title passed as an argument to console.profile().
+             */
+            title?: string | undefined;
+        }
+        interface ConsoleProfileFinishedEventDataType {
+            id: string;
+            /**
+             * Location of console.profileEnd().
+             */
+            location: Debugger.Location;
+            profile: Profile;
+            /**
+             * Profile title passed as an argument to console.profile().
+             */
+            title?: string | undefined;
+        }
+    }
+    namespace HeapProfiler {
+        /**
+         * Heap snapshot object id.
+         */
+        type HeapSnapshotObjectId = string;
+        /**
+         * Sampling Heap Profile node. Holds callsite information, allocation statistics and child nodes.
+         */
+        interface SamplingHeapProfileNode {
+            /**
+             * Function location.
+             */
+            callFrame: Runtime.CallFrame;
+            /**
+             * Allocations size in bytes for the node excluding children.
+             */
+            selfSize: number;
+            /**
+             * Child nodes.
+             */
+            children: SamplingHeapProfileNode[];
+        }
+        /**
+         * Profile.
+         */
+        interface SamplingHeapProfile {
+            head: SamplingHeapProfileNode;
+        }
+        interface StartTrackingHeapObjectsParameterType {
+            trackAllocations?: boolean | undefined;
+        }
+        interface StopTrackingHeapObjectsParameterType {
+            /**
+             * If true 'reportHeapSnapshotProgress' events will be generated while snapshot is being taken when the tracking is stopped.
+             */
+            reportProgress?: boolean | undefined;
+        }
+        interface TakeHeapSnapshotParameterType {
+            /**
+             * If true 'reportHeapSnapshotProgress' events will be generated while snapshot is being taken.
+             */
+            reportProgress?: boolean | undefined;
+        }
+        interface GetObjectByHeapObjectIdParameterType {
+            objectId: HeapSnapshotObjectId;
+            /**
+             * Symbolic group name that can be used to release multiple objects.
+             */
+            objectGroup?: string | undefined;
+        }
+        interface AddInspectedHeapObjectParameterType {
+            /**
+             * Heap snapshot object id to be accessible by means of $x command line API.
+             */
+            heapObjectId: HeapSnapshotObjectId;
+        }
+        interface GetHeapObjectIdParameterType {
+            /**
+             * Identifier of the object to get heap object id for.
+             */
+            objectId: Runtime.RemoteObjectId;
+        }
+        interface StartSamplingParameterType {
+            /**
+             * Average sample interval in bytes. Poisson distribution is used for the intervals. The default value is 32768 bytes.
+             */
+            samplingInterval?: number | undefined;
+        }
+        interface GetObjectByHeapObjectIdReturnType {
+            /**
+             * Evaluation result.
+             */
+            result: Runtime.RemoteObject;
+        }
+        interface GetHeapObjectIdReturnType {
+            /**
+             * Id of the heap snapshot object corresponding to the passed remote object id.
+             */
+            heapSnapshotObjectId: HeapSnapshotObjectId;
+        }
+        interface StopSamplingReturnType {
+            /**
+             * Recorded sampling heap profile.
+             */
+            profile: SamplingHeapProfile;
+        }
+        interface GetSamplingProfileReturnType {
+            /**
+             * Return the sampling profile being collected.
+             */
+            profile: SamplingHeapProfile;
+        }
+        interface AddHeapSnapshotChunkEventDataType {
+            chunk: string;
+        }
+        interface ReportHeapSnapshotProgressEventDataType {
+            done: number;
+            total: number;
+            finished?: boolean | undefined;
+        }
+        interface LastSeenObjectIdEventDataType {
+            lastSeenObjectId: number;
+            timestamp: number;
+        }
+        interface HeapStatsUpdateEventDataType {
+            /**
+             * An array of triplets. Each triplet describes a fragment. The first integer is the fragment index, the second integer is a total count of objects for the fragment, the third integer is a total size of the objects for the fragment.
+             */
+            statsUpdate: number[];
+        }
+    }
+    namespace NodeTracing {
+        interface TraceConfig {
+            /**
+             * Controls how the trace buffer stores data.
+             */
+            recordMode?: string;
+            /**
+             * Included category filters.
+             */
+            includedCategories: string[];
+        }
+        interface StartParameterType {
+            traceConfig: TraceConfig;
+        }
+        interface GetCategoriesReturnType {
+            /**
+             * A list of supported tracing categories.
+             */
+            categories: string[];
+        }
+        interface DataCollectedEventDataType {
+            value: Array<{}>;
+        }
+    }
+    namespace NodeWorker {
+        type WorkerID = string;
+        /**
+         * Unique identifier of attached debugging session.
+         */
+        type SessionID = string;
+        interface WorkerInfo {
+            workerId: WorkerID;
+            type: string;
+            title: string;
+            url: string;
+        }
+        interface SendMessageToWorkerParameterType {
+            message: string;
+            /**
+             * Identifier of the session.
+             */
+            sessionId: SessionID;
+        }
+        interface EnableParameterType {
+            /**
+             * Whether to new workers should be paused until the frontend sends `Runtime.runIfWaitingForDebugger`
+             * message to run them.
+             */
+            waitForDebuggerOnStart: boolean;
+        }
+        interface DetachParameterType {
+            sessionId: SessionID;
+        }
+        interface AttachedToWorkerEventDataType {
+            /**
+             * Identifier assigned to the session used to send/receive messages.
+             */
+            sessionId: SessionID;
+            workerInfo: WorkerInfo;
+            waitingForDebugger: boolean;
+        }
+        interface DetachedFromWorkerEventDataType {
+            /**
+             * Detached session identifier.
+             */
+            sessionId: SessionID;
+        }
+        interface ReceivedMessageFromWorkerEventDataType {
+            /**
+             * Identifier of a session which sends a message.
+             */
+            sessionId: SessionID;
+            message: string;
+        }
+    }
+    namespace NodeRuntime {
+        interface NotifyWhenWaitingForDisconnectParameterType {
+            enabled: boolean;
+        }
+    }
+    /**
+     * The `inspector.Session` is used for dispatching messages to the V8 inspector
+     * back-end and receiving message responses and notifications.
+     */
+    class Session extends EventEmitter {
+        /**
+         * Create a new instance of the inspector.Session class.
+         * The inspector session needs to be connected through session.connect() before the messages can be dispatched to the inspector backend.
+         */
+        constructor();
+        /**
+         * Connects a session to the inspector back-end.
+         * @since v8.0.0
+         */
+        connect(): void;
+        /**
+         * Connects a session to the main thread inspector back-end. An exception will
+         * be thrown if this API was not called on a Worker thread.
+         * @since v12.11.0
+         */
+        connectToMainThread(): void;
+        /**
+         * Immediately close the session. All pending message callbacks will be called
+         * with an error. `session.connect()` will need to be called to be able to send
+         * messages again. Reconnected session will lose all inspector state, such as
+         * enabled agents or configured breakpoints.
+         * @since v8.0.0
+         */
+        disconnect(): void;
+        /**
+         * Posts a message to the inspector back-end. `callback` will be notified when
+         * a response is received. `callback` is a function that accepts two optional
+         * arguments: error and message-specific result.
+         *
+         * ```js
+         * session.post('Runtime.evaluate', { expression: '2 + 2' },
+         *              (error, { result }) => console.log(result));
+         * // Output: { type: 'number', value: 4, description: '4' }
+         * ```
+         *
+         * The latest version of the V8 inspector protocol is published on the [Chrome DevTools Protocol Viewer](https://chromedevtools.github.io/devtools-protocol/v8/).
+         *
+         * Node.js inspector supports all the Chrome DevTools Protocol domains declared
+         * by V8\. Chrome DevTools Protocol domain provides an interface for interacting
+         * with one of the runtime agents used to inspect the application state and listen
+         * to the run-time events.
+         *
+         * ## Example usage
+         *
+         * Apart from the debugger, various V8 Profilers are available through the DevTools
+         * protocol.
+         * @since v8.0.0
+         */
+        post(method: string, params?: {}, callback?: (err: Error | null, params?: {}) => void): void;
+        post(method: string, callback?: (err: Error | null, params?: {}) => void): void;
+        /**
+         * Returns supported domains.
+         */
+        post(method: 'Schema.getDomains', callback?: (err: Error | null, params: Schema.GetDomainsReturnType) => void): void;
+        /**
+         * Evaluates expression on global object.
+         */
+        post(method: 'Runtime.evaluate', params?: Runtime.EvaluateParameterType, callback?: (err: Error | null, params: Runtime.EvaluateReturnType) => void): void;
+        post(method: 'Runtime.evaluate', callback?: (err: Error | null, params: Runtime.EvaluateReturnType) => void): void;
+        /**
+         * Add handler to promise with given promise object id.
+         */
+        post(method: 'Runtime.awaitPromise', params?: Runtime.AwaitPromiseParameterType, callback?: (err: Error | null, params: Runtime.AwaitPromiseReturnType) => void): void;
+        post(method: 'Runtime.awaitPromise', callback?: (err: Error | null, params: Runtime.AwaitPromiseReturnType) => void): void;
+        /**
+         * Calls function with given declaration on the given object. Object group of the result is inherited from the target object.
+         */
+        post(method: 'Runtime.callFunctionOn', params?: Runtime.CallFunctionOnParameterType, callback?: (err: Error | null, params: Runtime.CallFunctionOnReturnType) => void): void;
+        post(method: 'Runtime.callFunctionOn', callback?: (err: Error | null, params: Runtime.CallFunctionOnReturnType) => void): void;
+        /**
+         * Returns properties of a given object. Object group of the result is inherited from the target object.
+         */
+        post(method: 'Runtime.getProperties', params?: Runtime.GetPropertiesParameterType, callback?: (err: Error | null, params: Runtime.GetPropertiesReturnType) => void): void;
+        post(method: 'Runtime.getProperties', callback?: (err: Error | null, params: Runtime.GetPropertiesReturnType) => void): void;
+        /**
+         * Releases remote object with given id.
+         */
+        post(method: 'Runtime.releaseObject', params?: Runtime.ReleaseObjectParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Runtime.releaseObject', callback?: (err: Error | null) => void): void;
+        /**
+         * Releases all remote objects that belong to a given group.
+         */
+        post(method: 'Runtime.releaseObjectGroup', params?: Runtime.ReleaseObjectGroupParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Runtime.releaseObjectGroup', callback?: (err: Error | null) => void): void;
+        /**
+         * Tells inspected instance to run if it was waiting for debugger to attach.
+         */
+        post(method: 'Runtime.runIfWaitingForDebugger', callback?: (err: Error | null) => void): void;
+        /**
+         * Enables reporting of execution contexts creation by means of <code>executionContextCreated</code> event. When the reporting gets enabled the event will be sent immediately for each existing execution context.
+         */
+        post(method: 'Runtime.enable', callback?: (err: Error | null) => void): void;
+        /**
+         * Disables reporting of execution contexts creation.
+         */
+        post(method: 'Runtime.disable', callback?: (err: Error | null) => void): void;
+        /**
+         * Discards collected exceptions and console API calls.
+         */
+        post(method: 'Runtime.discardConsoleEntries', callback?: (err: Error | null) => void): void;
+        /**
+         * @experimental
+         */
+        post(method: 'Runtime.setCustomObjectFormatterEnabled', params?: Runtime.SetCustomObjectFormatterEnabledParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Runtime.setCustomObjectFormatterEnabled', callback?: (err: Error | null) => void): void;
+        /**
+         * Compiles expression.
+         */
+        post(method: 'Runtime.compileScript', params?: Runtime.CompileScriptParameterType, callback?: (err: Error | null, params: Runtime.CompileScriptReturnType) => void): void;
+        post(method: 'Runtime.compileScript', callback?: (err: Error | null, params: Runtime.CompileScriptReturnType) => void): void;
+        /**
+         * Runs script with given id in a given context.
+         */
+        post(method: 'Runtime.runScript', params?: Runtime.RunScriptParameterType, callback?: (err: Error | null, params: Runtime.RunScriptReturnType) => void): void;
+        post(method: 'Runtime.runScript', callback?: (err: Error | null, params: Runtime.RunScriptReturnType) => void): void;
+        post(method: 'Runtime.queryObjects', params?: Runtime.QueryObjectsParameterType, callback?: (err: Error | null, params: Runtime.QueryObjectsReturnType) => void): void;
+        post(method: 'Runtime.queryObjects', callback?: (err: Error | null, params: Runtime.QueryObjectsReturnType) => void): void;
+        /**
+         * Returns all let, const and class variables from global scope.
+         */
+        post(
+            method: 'Runtime.globalLexicalScopeNames',
+            params?: Runtime.GlobalLexicalScopeNamesParameterType,
+            callback?: (err: Error | null, params: Runtime.GlobalLexicalScopeNamesReturnType) => void
+        ): void;
+        post(method: 'Runtime.globalLexicalScopeNames', callback?: (err: Error | null, params: Runtime.GlobalLexicalScopeNamesReturnType) => void): void;
+        /**
+         * Enables debugger for the given page. Clients should not assume that the debugging has been enabled until the result for this command is received.
+         */
+        post(method: 'Debugger.enable', callback?: (err: Error | null, params: Debugger.EnableReturnType) => void): void;
+        /**
+         * Disables debugger for given page.
+         */
+        post(method: 'Debugger.disable', callback?: (err: Error | null) => void): void;
+        /**
+         * Activates / deactivates all breakpoints on the page.
+         */
+        post(method: 'Debugger.setBreakpointsActive', params?: Debugger.SetBreakpointsActiveParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setBreakpointsActive', callback?: (err: Error | null) => void): void;
+        /**
+         * Makes page not interrupt on any pauses (breakpoint, exception, dom exception etc).
+         */
+        post(method: 'Debugger.setSkipAllPauses', params?: Debugger.SetSkipAllPausesParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setSkipAllPauses', callback?: (err: Error | null) => void): void;
+        /**
+         * Sets JavaScript breakpoint at given location specified either by URL or URL regex. Once this command is issued, all existing parsed scripts will have breakpoints resolved and returned in <code>locations</code> property. Further matching script parsing will result in subsequent <code>breakpointResolved</code> events issued. This logical breakpoint will survive page reloads.
+         */
+        post(method: 'Debugger.setBreakpointByUrl', params?: Debugger.SetBreakpointByUrlParameterType, callback?: (err: Error | null, params: Debugger.SetBreakpointByUrlReturnType) => void): void;
+        post(method: 'Debugger.setBreakpointByUrl', callback?: (err: Error | null, params: Debugger.SetBreakpointByUrlReturnType) => void): void;
+        /**
+         * Sets JavaScript breakpoint at a given location.
+         */
+        post(method: 'Debugger.setBreakpoint', params?: Debugger.SetBreakpointParameterType, callback?: (err: Error | null, params: Debugger.SetBreakpointReturnType) => void): void;
+        post(method: 'Debugger.setBreakpoint', callback?: (err: Error | null, params: Debugger.SetBreakpointReturnType) => void): void;
+        /**
+         * Removes JavaScript breakpoint.
+         */
+        post(method: 'Debugger.removeBreakpoint', params?: Debugger.RemoveBreakpointParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.removeBreakpoint', callback?: (err: Error | null) => void): void;
+        /**
+         * Returns possible locations for breakpoint. scriptId in start and end range locations should be the same.
+         */
+        post(
+            method: 'Debugger.getPossibleBreakpoints',
+            params?: Debugger.GetPossibleBreakpointsParameterType,
+            callback?: (err: Error | null, params: Debugger.GetPossibleBreakpointsReturnType) => void
+        ): void;
+        post(method: 'Debugger.getPossibleBreakpoints', callback?: (err: Error | null, params: Debugger.GetPossibleBreakpointsReturnType) => void): void;
+        /**
+         * Continues execution until specific location is reached.
+         */
+        post(method: 'Debugger.continueToLocation', params?: Debugger.ContinueToLocationParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.continueToLocation', callback?: (err: Error | null) => void): void;
+        /**
+         * @experimental
+         */
+        post(method: 'Debugger.pauseOnAsyncCall', params?: Debugger.PauseOnAsyncCallParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.pauseOnAsyncCall', callback?: (err: Error | null) => void): void;
+        /**
+         * Steps over the statement.
+         */
+        post(method: 'Debugger.stepOver', callback?: (err: Error | null) => void): void;
+        /**
+         * Steps into the function call.
+         */
+        post(method: 'Debugger.stepInto', params?: Debugger.StepIntoParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.stepInto', callback?: (err: Error | null) => void): void;
+        /**
+         * Steps out of the function call.
+         */
+        post(method: 'Debugger.stepOut', callback?: (err: Error | null) => void): void;
+        /**
+         * Stops on the next JavaScript statement.
+         */
+        post(method: 'Debugger.pause', callback?: (err: Error | null) => void): void;
+        /**
+         * This method is deprecated - use Debugger.stepInto with breakOnAsyncCall and Debugger.pauseOnAsyncTask instead. Steps into next scheduled async task if any is scheduled before next pause. Returns success when async task is actually scheduled, returns error if no task were scheduled or another scheduleStepIntoAsync was called.
+         * @experimental
+         */
+        post(method: 'Debugger.scheduleStepIntoAsync', callback?: (err: Error | null) => void): void;
+        /**
+         * Resumes JavaScript execution.
+         */
+        post(method: 'Debugger.resume', callback?: (err: Error | null) => void): void;
+        /**
+         * Returns stack trace with given <code>stackTraceId</code>.
+         * @experimental
+         */
+        post(method: 'Debugger.getStackTrace', params?: Debugger.GetStackTraceParameterType, callback?: (err: Error | null, params: Debugger.GetStackTraceReturnType) => void): void;
+        post(method: 'Debugger.getStackTrace', callback?: (err: Error | null, params: Debugger.GetStackTraceReturnType) => void): void;
+        /**
+         * Searches for given string in script content.
+         */
+        post(method: 'Debugger.searchInContent', params?: Debugger.SearchInContentParameterType, callback?: (err: Error | null, params: Debugger.SearchInContentReturnType) => void): void;
+        post(method: 'Debugger.searchInContent', callback?: (err: Error | null, params: Debugger.SearchInContentReturnType) => void): void;
+        /**
+         * Edits JavaScript source live.
+         */
+        post(method: 'Debugger.setScriptSource', params?: Debugger.SetScriptSourceParameterType, callback?: (err: Error | null, params: Debugger.SetScriptSourceReturnType) => void): void;
+        post(method: 'Debugger.setScriptSource', callback?: (err: Error | null, params: Debugger.SetScriptSourceReturnType) => void): void;
+        /**
+         * Restarts particular call frame from the beginning.
+         */
+        post(method: 'Debugger.restartFrame', params?: Debugger.RestartFrameParameterType, callback?: (err: Error | null, params: Debugger.RestartFrameReturnType) => void): void;
+        post(method: 'Debugger.restartFrame', callback?: (err: Error | null, params: Debugger.RestartFrameReturnType) => void): void;
+        /**
+         * Returns source for the script with given id.
+         */
+        post(method: 'Debugger.getScriptSource', params?: Debugger.GetScriptSourceParameterType, callback?: (err: Error | null, params: Debugger.GetScriptSourceReturnType) => void): void;
+        post(method: 'Debugger.getScriptSource', callback?: (err: Error | null, params: Debugger.GetScriptSourceReturnType) => void): void;
+        /**
+         * Defines pause on exceptions state. Can be set to stop on all exceptions, uncaught exceptions or no exceptions. Initial pause on exceptions state is <code>none</code>.
+         */
+        post(method: 'Debugger.setPauseOnExceptions', params?: Debugger.SetPauseOnExceptionsParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setPauseOnExceptions', callback?: (err: Error | null) => void): void;
+        /**
+         * Evaluates expression on a given call frame.
+         */
+        post(method: 'Debugger.evaluateOnCallFrame', params?: Debugger.EvaluateOnCallFrameParameterType, callback?: (err: Error | null, params: Debugger.EvaluateOnCallFrameReturnType) => void): void;
+        post(method: 'Debugger.evaluateOnCallFrame', callback?: (err: Error | null, params: Debugger.EvaluateOnCallFrameReturnType) => void): void;
+        /**
+         * Changes value of variable in a callframe. Object-based scopes are not supported and must be mutated manually.
+         */
+        post(method: 'Debugger.setVariableValue', params?: Debugger.SetVariableValueParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setVariableValue', callback?: (err: Error | null) => void): void;
+        /**
+         * Changes return value in top frame. Available only at return break position.
+         * @experimental
+         */
+        post(method: 'Debugger.setReturnValue', params?: Debugger.SetReturnValueParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setReturnValue', callback?: (err: Error | null) => void): void;
+        /**
+         * Enables or disables async call stacks tracking.
+         */
+        post(method: 'Debugger.setAsyncCallStackDepth', params?: Debugger.SetAsyncCallStackDepthParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setAsyncCallStackDepth', callback?: (err: Error | null) => void): void;
+        /**
+         * Replace previous blackbox patterns with passed ones. Forces backend to skip stepping/pausing in scripts with url matching one of the patterns. VM will try to leave blackboxed script by performing 'step in' several times, finally resorting to 'step out' if unsuccessful.
+         * @experimental
+         */
+        post(method: 'Debugger.setBlackboxPatterns', params?: Debugger.SetBlackboxPatternsParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setBlackboxPatterns', callback?: (err: Error | null) => void): void;
+        /**
+         * Makes backend skip steps in the script in blackboxed ranges. VM will try leave blacklisted scripts by performing 'step in' several times, finally resorting to 'step out' if unsuccessful. Positions array contains positions where blackbox state is changed. First interval isn't blackboxed. Array should be sorted.
+         * @experimental
+         */
+        post(method: 'Debugger.setBlackboxedRanges', params?: Debugger.SetBlackboxedRangesParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Debugger.setBlackboxedRanges', callback?: (err: Error | null) => void): void;
+        /**
+         * Enables console domain, sends the messages collected so far to the client by means of the <code>messageAdded</code> notification.
+         */
+        post(method: 'Console.enable', callback?: (err: Error | null) => void): void;
+        /**
+         * Disables console domain, prevents further console messages from being reported to the client.
+         */
+        post(method: 'Console.disable', callback?: (err: Error | null) => void): void;
+        /**
+         * Does nothing.
+         */
+        post(method: 'Console.clearMessages', callback?: (err: Error | null) => void): void;
+        post(method: 'Profiler.enable', callback?: (err: Error | null) => void): void;
+        post(method: 'Profiler.disable', callback?: (err: Error | null) => void): void;
+        /**
+         * Changes CPU profiler sampling interval. Must be called before CPU profiles recording started.
+         */
+        post(method: 'Profiler.setSamplingInterval', params?: Profiler.SetSamplingIntervalParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Profiler.setSamplingInterval', callback?: (err: Error | null) => void): void;
+        post(method: 'Profiler.start', callback?: (err: Error | null) => void): void;
+        post(method: 'Profiler.stop', callback?: (err: Error | null, params: Profiler.StopReturnType) => void): void;
+        /**
+         * Enable precise code coverage. Coverage data for JavaScript executed before enabling precise code coverage may be incomplete. Enabling prevents running optimized code and resets execution counters.
+         */
+        post(method: 'Profiler.startPreciseCoverage', params?: Profiler.StartPreciseCoverageParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'Profiler.startPreciseCoverage', callback?: (err: Error | null) => void): void;
+        /**
+         * Disable precise code coverage. Disabling releases unnecessary execution count records and allows executing optimized code.
+         */
+        post(method: 'Profiler.stopPreciseCoverage', callback?: (err: Error | null) => void): void;
+        /**
+         * Collect coverage data for the current isolate, and resets execution counters. Precise code coverage needs to have started.
+         */
+        post(method: 'Profiler.takePreciseCoverage', callback?: (err: Error | null, params: Profiler.TakePreciseCoverageReturnType) => void): void;
+        /**
+         * Collect coverage data for the current isolate. The coverage data may be incomplete due to garbage collection.
+         */
+        post(method: 'Profiler.getBestEffortCoverage', callback?: (err: Error | null, params: Profiler.GetBestEffortCoverageReturnType) => void): void;
+        /**
+         * Enable type profile.
+         * @experimental
+         */
+        post(method: 'Profiler.startTypeProfile', callback?: (err: Error | null) => void): void;
+        /**
+         * Disable type profile. Disabling releases type profile data collected so far.
+         * @experimental
+         */
+        post(method: 'Profiler.stopTypeProfile', callback?: (err: Error | null) => void): void;
+        /**
+         * Collect type profile.
+         * @experimental
+         */
+        post(method: 'Profiler.takeTypeProfile', callback?: (err: Error | null, params: Profiler.TakeTypeProfileReturnType) => void): void;
+        post(method: 'HeapProfiler.enable', callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.disable', callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.startTrackingHeapObjects', params?: HeapProfiler.StartTrackingHeapObjectsParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.startTrackingHeapObjects', callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.stopTrackingHeapObjects', params?: HeapProfiler.StopTrackingHeapObjectsParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.stopTrackingHeapObjects', callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.takeHeapSnapshot', params?: HeapProfiler.TakeHeapSnapshotParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.takeHeapSnapshot', callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.collectGarbage', callback?: (err: Error | null) => void): void;
+        post(
+            method: 'HeapProfiler.getObjectByHeapObjectId',
+            params?: HeapProfiler.GetObjectByHeapObjectIdParameterType,
+            callback?: (err: Error | null, params: HeapProfiler.GetObjectByHeapObjectIdReturnType) => void
+        ): void;
+        post(method: 'HeapProfiler.getObjectByHeapObjectId', callback?: (err: Error | null, params: HeapProfiler.GetObjectByHeapObjectIdReturnType) => void): void;
+        /**
+         * Enables console to refer to the node with given id via $x (see Command Line API for more details $x functions).
+         */
+        post(method: 'HeapProfiler.addInspectedHeapObject', params?: HeapProfiler.AddInspectedHeapObjectParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.addInspectedHeapObject', callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.getHeapObjectId', params?: HeapProfiler.GetHeapObjectIdParameterType, callback?: (err: Error | null, params: HeapProfiler.GetHeapObjectIdReturnType) => void): void;
+        post(method: 'HeapProfiler.getHeapObjectId', callback?: (err: Error | null, params: HeapProfiler.GetHeapObjectIdReturnType) => void): void;
+        post(method: 'HeapProfiler.startSampling', params?: HeapProfiler.StartSamplingParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.startSampling', callback?: (err: Error | null) => void): void;
+        post(method: 'HeapProfiler.stopSampling', callback?: (err: Error | null, params: HeapProfiler.StopSamplingReturnType) => void): void;
+        post(method: 'HeapProfiler.getSamplingProfile', callback?: (err: Error | null, params: HeapProfiler.GetSamplingProfileReturnType) => void): void;
+        /**
+         * Gets supported tracing categories.
+         */
+        post(method: 'NodeTracing.getCategories', callback?: (err: Error | null, params: NodeTracing.GetCategoriesReturnType) => void): void;
+        /**
+         * Start trace events collection.
+         */
+        post(method: 'NodeTracing.start', params?: NodeTracing.StartParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'NodeTracing.start', callback?: (err: Error | null) => void): void;
+        /**
+         * Stop trace events collection. Remaining collected events will be sent as a sequence of
+         * dataCollected events followed by tracingComplete event.
+         */
+        post(method: 'NodeTracing.stop', callback?: (err: Error | null) => void): void;
+        /**
+         * Sends protocol message over session with given id.
+         */
+        post(method: 'NodeWorker.sendMessageToWorker', params?: NodeWorker.SendMessageToWorkerParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'NodeWorker.sendMessageToWorker', callback?: (err: Error | null) => void): void;
+        /**
+         * Instructs the inspector to attach to running workers. Will also attach to new workers
+         * as they start
+         */
+        post(method: 'NodeWorker.enable', params?: NodeWorker.EnableParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'NodeWorker.enable', callback?: (err: Error | null) => void): void;
+        /**
+         * Detaches from all running workers and disables attaching to new workers as they are started.
+         */
+        post(method: 'NodeWorker.disable', callback?: (err: Error | null) => void): void;
+        /**
+         * Detached from the worker with given sessionId.
+         */
+        post(method: 'NodeWorker.detach', params?: NodeWorker.DetachParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'NodeWorker.detach', callback?: (err: Error | null) => void): void;
+        /**
+         * Enable the `NodeRuntime.waitingForDisconnect`.
+         */
+        post(method: 'NodeRuntime.notifyWhenWaitingForDisconnect', params?: NodeRuntime.NotifyWhenWaitingForDisconnectParameterType, callback?: (err: Error | null) => void): void;
+        post(method: 'NodeRuntime.notifyWhenWaitingForDisconnect', callback?: (err: Error | null) => void): void;
+        // Events
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        /**
+         * Emitted when any notification from the V8 Inspector is received.
+         */
+        addListener(event: 'inspectorNotification', listener: (message: InspectorNotification<{}>) => void): this;
+        /**
+         * Issued when new execution context is created.
+         */
+        addListener(event: 'Runtime.executionContextCreated', listener: (message: InspectorNotification<Runtime.ExecutionContextCreatedEventDataType>) => void): this;
+        /**
+         * Issued when execution context is destroyed.
+         */
+        addListener(event: 'Runtime.executionContextDestroyed', listener: (message: InspectorNotification<Runtime.ExecutionContextDestroyedEventDataType>) => void): this;
+        /**
+         * Issued when all executionContexts were cleared in browser
+         */
+        addListener(event: 'Runtime.executionContextsCleared', listener: () => void): this;
+        /**
+         * Issued when exception was thrown and unhandled.
+         */
+        addListener(event: 'Runtime.exceptionThrown', listener: (message: InspectorNotification<Runtime.ExceptionThrownEventDataType>) => void): this;
+        /**
+         * Issued when unhandled exception was revoked.
+         */
+        addListener(event: 'Runtime.exceptionRevoked', listener: (message: InspectorNotification<Runtime.ExceptionRevokedEventDataType>) => void): this;
+        /**
+         * Issued when console API was called.
+         */
+        addListener(event: 'Runtime.consoleAPICalled', listener: (message: InspectorNotification<Runtime.ConsoleAPICalledEventDataType>) => void): this;
+        /**
+         * Issued when object should be inspected (for example, as a result of inspect() command line API call).
+         */
+        addListener(event: 'Runtime.inspectRequested', listener: (message: InspectorNotification<Runtime.InspectRequestedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine parses script. This event is also fired for all known and uncollected scripts upon enabling debugger.
+         */
+        addListener(event: 'Debugger.scriptParsed', listener: (message: InspectorNotification<Debugger.ScriptParsedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine fails to parse the script.
+         */
+        addListener(event: 'Debugger.scriptFailedToParse', listener: (message: InspectorNotification<Debugger.ScriptFailedToParseEventDataType>) => void): this;
+        /**
+         * Fired when breakpoint is resolved to an actual script and location.
+         */
+        addListener(event: 'Debugger.breakpointResolved', listener: (message: InspectorNotification<Debugger.BreakpointResolvedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine stopped on breakpoint or exception or any other stop criteria.
+         */
+        addListener(event: 'Debugger.paused', listener: (message: InspectorNotification<Debugger.PausedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine resumed execution.
+         */
+        addListener(event: 'Debugger.resumed', listener: () => void): this;
+        /**
+         * Issued when new console message is added.
+         */
+        addListener(event: 'Console.messageAdded', listener: (message: InspectorNotification<Console.MessageAddedEventDataType>) => void): this;
+        /**
+         * Sent when new profile recording is started using console.profile() call.
+         */
+        addListener(event: 'Profiler.consoleProfileStarted', listener: (message: InspectorNotification<Profiler.ConsoleProfileStartedEventDataType>) => void): this;
+        addListener(event: 'Profiler.consoleProfileFinished', listener: (message: InspectorNotification<Profiler.ConsoleProfileFinishedEventDataType>) => void): this;
+        addListener(event: 'HeapProfiler.addHeapSnapshotChunk', listener: (message: InspectorNotification<HeapProfiler.AddHeapSnapshotChunkEventDataType>) => void): this;
+        addListener(event: 'HeapProfiler.resetProfiles', listener: () => void): this;
+        addListener(event: 'HeapProfiler.reportHeapSnapshotProgress', listener: (message: InspectorNotification<HeapProfiler.ReportHeapSnapshotProgressEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend regularly sends a current value for last seen object id and corresponding timestamp. If the were changes in the heap since last event then one or more heapStatsUpdate events will be sent before a new lastSeenObjectId event.
+         */
+        addListener(event: 'HeapProfiler.lastSeenObjectId', listener: (message: InspectorNotification<HeapProfiler.LastSeenObjectIdEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend may send update for one or more fragments
+         */
+        addListener(event: 'HeapProfiler.heapStatsUpdate', listener: (message: InspectorNotification<HeapProfiler.HeapStatsUpdateEventDataType>) => void): this;
+        /**
+         * Contains an bucket of collected trace events.
+         */
+        addListener(event: 'NodeTracing.dataCollected', listener: (message: InspectorNotification<NodeTracing.DataCollectedEventDataType>) => void): this;
+        /**
+         * Signals that tracing is stopped and there is no trace buffers pending flush, all data were
+         * delivered via dataCollected events.
+         */
+        addListener(event: 'NodeTracing.tracingComplete', listener: () => void): this;
+        /**
+         * Issued when attached to a worker.
+         */
+        addListener(event: 'NodeWorker.attachedToWorker', listener: (message: InspectorNotification<NodeWorker.AttachedToWorkerEventDataType>) => void): this;
+        /**
+         * Issued when detached from the worker.
+         */
+        addListener(event: 'NodeWorker.detachedFromWorker', listener: (message: InspectorNotification<NodeWorker.DetachedFromWorkerEventDataType>) => void): this;
+        /**
+         * Notifies about a new protocol message received from the session
+         * (session ID is provided in attachedToWorker notification).
+         */
+        addListener(event: 'NodeWorker.receivedMessageFromWorker', listener: (message: InspectorNotification<NodeWorker.ReceivedMessageFromWorkerEventDataType>) => void): this;
+        /**
+         * This event is fired instead of `Runtime.executionContextDestroyed` when
+         * enabled.
+         * It is fired when the Node process finished all code execution and is
+         * waiting for all frontends to disconnect.
+         */
+        addListener(event: 'NodeRuntime.waitingForDisconnect', listener: () => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'inspectorNotification', message: InspectorNotification<{}>): boolean;
+        emit(event: 'Runtime.executionContextCreated', message: InspectorNotification<Runtime.ExecutionContextCreatedEventDataType>): boolean;
+        emit(event: 'Runtime.executionContextDestroyed', message: InspectorNotification<Runtime.ExecutionContextDestroyedEventDataType>): boolean;
+        emit(event: 'Runtime.executionContextsCleared'): boolean;
+        emit(event: 'Runtime.exceptionThrown', message: InspectorNotification<Runtime.ExceptionThrownEventDataType>): boolean;
+        emit(event: 'Runtime.exceptionRevoked', message: InspectorNotification<Runtime.ExceptionRevokedEventDataType>): boolean;
+        emit(event: 'Runtime.consoleAPICalled', message: InspectorNotification<Runtime.ConsoleAPICalledEventDataType>): boolean;
+        emit(event: 'Runtime.inspectRequested', message: InspectorNotification<Runtime.InspectRequestedEventDataType>): boolean;
+        emit(event: 'Debugger.scriptParsed', message: InspectorNotification<Debugger.ScriptParsedEventDataType>): boolean;
+        emit(event: 'Debugger.scriptFailedToParse', message: InspectorNotification<Debugger.ScriptFailedToParseEventDataType>): boolean;
+        emit(event: 'Debugger.breakpointResolved', message: InspectorNotification<Debugger.BreakpointResolvedEventDataType>): boolean;
+        emit(event: 'Debugger.paused', message: InspectorNotification<Debugger.PausedEventDataType>): boolean;
+        emit(event: 'Debugger.resumed'): boolean;
+        emit(event: 'Console.messageAdded', message: InspectorNotification<Console.MessageAddedEventDataType>): boolean;
+        emit(event: 'Profiler.consoleProfileStarted', message: InspectorNotification<Profiler.ConsoleProfileStartedEventDataType>): boolean;
+        emit(event: 'Profiler.consoleProfileFinished', message: InspectorNotification<Profiler.ConsoleProfileFinishedEventDataType>): boolean;
+        emit(event: 'HeapProfiler.addHeapSnapshotChunk', message: InspectorNotification<HeapProfiler.AddHeapSnapshotChunkEventDataType>): boolean;
+        emit(event: 'HeapProfiler.resetProfiles'): boolean;
+        emit(event: 'HeapProfiler.reportHeapSnapshotProgress', message: InspectorNotification<HeapProfiler.ReportHeapSnapshotProgressEventDataType>): boolean;
+        emit(event: 'HeapProfiler.lastSeenObjectId', message: InspectorNotification<HeapProfiler.LastSeenObjectIdEventDataType>): boolean;
+        emit(event: 'HeapProfiler.heapStatsUpdate', message: InspectorNotification<HeapProfiler.HeapStatsUpdateEventDataType>): boolean;
+        emit(event: 'NodeTracing.dataCollected', message: InspectorNotification<NodeTracing.DataCollectedEventDataType>): boolean;
+        emit(event: 'NodeTracing.tracingComplete'): boolean;
+        emit(event: 'NodeWorker.attachedToWorker', message: InspectorNotification<NodeWorker.AttachedToWorkerEventDataType>): boolean;
+        emit(event: 'NodeWorker.detachedFromWorker', message: InspectorNotification<NodeWorker.DetachedFromWorkerEventDataType>): boolean;
+        emit(event: 'NodeWorker.receivedMessageFromWorker', message: InspectorNotification<NodeWorker.ReceivedMessageFromWorkerEventDataType>): boolean;
+        emit(event: 'NodeRuntime.waitingForDisconnect'): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        /**
+         * Emitted when any notification from the V8 Inspector is received.
+         */
+        on(event: 'inspectorNotification', listener: (message: InspectorNotification<{}>) => void): this;
+        /**
+         * Issued when new execution context is created.
+         */
+        on(event: 'Runtime.executionContextCreated', listener: (message: InspectorNotification<Runtime.ExecutionContextCreatedEventDataType>) => void): this;
+        /**
+         * Issued when execution context is destroyed.
+         */
+        on(event: 'Runtime.executionContextDestroyed', listener: (message: InspectorNotification<Runtime.ExecutionContextDestroyedEventDataType>) => void): this;
+        /**
+         * Issued when all executionContexts were cleared in browser
+         */
+        on(event: 'Runtime.executionContextsCleared', listener: () => void): this;
+        /**
+         * Issued when exception was thrown and unhandled.
+         */
+        on(event: 'Runtime.exceptionThrown', listener: (message: InspectorNotification<Runtime.ExceptionThrownEventDataType>) => void): this;
+        /**
+         * Issued when unhandled exception was revoked.
+         */
+        on(event: 'Runtime.exceptionRevoked', listener: (message: InspectorNotification<Runtime.ExceptionRevokedEventDataType>) => void): this;
+        /**
+         * Issued when console API was called.
+         */
+        on(event: 'Runtime.consoleAPICalled', listener: (message: InspectorNotification<Runtime.ConsoleAPICalledEventDataType>) => void): this;
+        /**
+         * Issued when object should be inspected (for example, as a result of inspect() command line API call).
+         */
+        on(event: 'Runtime.inspectRequested', listener: (message: InspectorNotification<Runtime.InspectRequestedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine parses script. This event is also fired for all known and uncollected scripts upon enabling debugger.
+         */
+        on(event: 'Debugger.scriptParsed', listener: (message: InspectorNotification<Debugger.ScriptParsedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine fails to parse the script.
+         */
+        on(event: 'Debugger.scriptFailedToParse', listener: (message: InspectorNotification<Debugger.ScriptFailedToParseEventDataType>) => void): this;
+        /**
+         * Fired when breakpoint is resolved to an actual script and location.
+         */
+        on(event: 'Debugger.breakpointResolved', listener: (message: InspectorNotification<Debugger.BreakpointResolvedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine stopped on breakpoint or exception or any other stop criteria.
+         */
+        on(event: 'Debugger.paused', listener: (message: InspectorNotification<Debugger.PausedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine resumed execution.
+         */
+        on(event: 'Debugger.resumed', listener: () => void): this;
+        /**
+         * Issued when new console message is added.
+         */
+        on(event: 'Console.messageAdded', listener: (message: InspectorNotification<Console.MessageAddedEventDataType>) => void): this;
+        /**
+         * Sent when new profile recording is started using console.profile() call.
+         */
+        on(event: 'Profiler.consoleProfileStarted', listener: (message: InspectorNotification<Profiler.ConsoleProfileStartedEventDataType>) => void): this;
+        on(event: 'Profiler.consoleProfileFinished', listener: (message: InspectorNotification<Profiler.ConsoleProfileFinishedEventDataType>) => void): this;
+        on(event: 'HeapProfiler.addHeapSnapshotChunk', listener: (message: InspectorNotification<HeapProfiler.AddHeapSnapshotChunkEventDataType>) => void): this;
+        on(event: 'HeapProfiler.resetProfiles', listener: () => void): this;
+        on(event: 'HeapProfiler.reportHeapSnapshotProgress', listener: (message: InspectorNotification<HeapProfiler.ReportHeapSnapshotProgressEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend regularly sends a current value for last seen object id and corresponding timestamp. If the were changes in the heap since last event then one or more heapStatsUpdate events will be sent before a new lastSeenObjectId event.
+         */
+        on(event: 'HeapProfiler.lastSeenObjectId', listener: (message: InspectorNotification<HeapProfiler.LastSeenObjectIdEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend may send update for one or more fragments
+         */
+        on(event: 'HeapProfiler.heapStatsUpdate', listener: (message: InspectorNotification<HeapProfiler.HeapStatsUpdateEventDataType>) => void): this;
+        /**
+         * Contains an bucket of collected trace events.
+         */
+        on(event: 'NodeTracing.dataCollected', listener: (message: InspectorNotification<NodeTracing.DataCollectedEventDataType>) => void): this;
+        /**
+         * Signals that tracing is stopped and there is no trace buffers pending flush, all data were
+         * delivered via dataCollected events.
+         */
+        on(event: 'NodeTracing.tracingComplete', listener: () => void): this;
+        /**
+         * Issued when attached to a worker.
+         */
+        on(event: 'NodeWorker.attachedToWorker', listener: (message: InspectorNotification<NodeWorker.AttachedToWorkerEventDataType>) => void): this;
+        /**
+         * Issued when detached from the worker.
+         */
+        on(event: 'NodeWorker.detachedFromWorker', listener: (message: InspectorNotification<NodeWorker.DetachedFromWorkerEventDataType>) => void): this;
+        /**
+         * Notifies about a new protocol message received from the session
+         * (session ID is provided in attachedToWorker notification).
+         */
+        on(event: 'NodeWorker.receivedMessageFromWorker', listener: (message: InspectorNotification<NodeWorker.ReceivedMessageFromWorkerEventDataType>) => void): this;
+        /**
+         * This event is fired instead of `Runtime.executionContextDestroyed` when
+         * enabled.
+         * It is fired when the Node process finished all code execution and is
+         * waiting for all frontends to disconnect.
+         */
+        on(event: 'NodeRuntime.waitingForDisconnect', listener: () => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        /**
+         * Emitted when any notification from the V8 Inspector is received.
+         */
+        once(event: 'inspectorNotification', listener: (message: InspectorNotification<{}>) => void): this;
+        /**
+         * Issued when new execution context is created.
+         */
+        once(event: 'Runtime.executionContextCreated', listener: (message: InspectorNotification<Runtime.ExecutionContextCreatedEventDataType>) => void): this;
+        /**
+         * Issued when execution context is destroyed.
+         */
+        once(event: 'Runtime.executionContextDestroyed', listener: (message: InspectorNotification<Runtime.ExecutionContextDestroyedEventDataType>) => void): this;
+        /**
+         * Issued when all executionContexts were cleared in browser
+         */
+        once(event: 'Runtime.executionContextsCleared', listener: () => void): this;
+        /**
+         * Issued when exception was thrown and unhandled.
+         */
+        once(event: 'Runtime.exceptionThrown', listener: (message: InspectorNotification<Runtime.ExceptionThrownEventDataType>) => void): this;
+        /**
+         * Issued when unhandled exception was revoked.
+         */
+        once(event: 'Runtime.exceptionRevoked', listener: (message: InspectorNotification<Runtime.ExceptionRevokedEventDataType>) => void): this;
+        /**
+         * Issued when console API was called.
+         */
+        once(event: 'Runtime.consoleAPICalled', listener: (message: InspectorNotification<Runtime.ConsoleAPICalledEventDataType>) => void): this;
+        /**
+         * Issued when object should be inspected (for example, as a result of inspect() command line API call).
+         */
+        once(event: 'Runtime.inspectRequested', listener: (message: InspectorNotification<Runtime.InspectRequestedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine parses script. This event is also fired for all known and uncollected scripts upon enabling debugger.
+         */
+        once(event: 'Debugger.scriptParsed', listener: (message: InspectorNotification<Debugger.ScriptParsedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine fails to parse the script.
+         */
+        once(event: 'Debugger.scriptFailedToParse', listener: (message: InspectorNotification<Debugger.ScriptFailedToParseEventDataType>) => void): this;
+        /**
+         * Fired when breakpoint is resolved to an actual script and location.
+         */
+        once(event: 'Debugger.breakpointResolved', listener: (message: InspectorNotification<Debugger.BreakpointResolvedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine stopped on breakpoint or exception or any other stop criteria.
+         */
+        once(event: 'Debugger.paused', listener: (message: InspectorNotification<Debugger.PausedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine resumed execution.
+         */
+        once(event: 'Debugger.resumed', listener: () => void): this;
+        /**
+         * Issued when new console message is added.
+         */
+        once(event: 'Console.messageAdded', listener: (message: InspectorNotification<Console.MessageAddedEventDataType>) => void): this;
+        /**
+         * Sent when new profile recording is started using console.profile() call.
+         */
+        once(event: 'Profiler.consoleProfileStarted', listener: (message: InspectorNotification<Profiler.ConsoleProfileStartedEventDataType>) => void): this;
+        once(event: 'Profiler.consoleProfileFinished', listener: (message: InspectorNotification<Profiler.ConsoleProfileFinishedEventDataType>) => void): this;
+        once(event: 'HeapProfiler.addHeapSnapshotChunk', listener: (message: InspectorNotification<HeapProfiler.AddHeapSnapshotChunkEventDataType>) => void): this;
+        once(event: 'HeapProfiler.resetProfiles', listener: () => void): this;
+        once(event: 'HeapProfiler.reportHeapSnapshotProgress', listener: (message: InspectorNotification<HeapProfiler.ReportHeapSnapshotProgressEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend regularly sends a current value for last seen object id and corresponding timestamp. If the were changes in the heap since last event then one or more heapStatsUpdate events will be sent before a new lastSeenObjectId event.
+         */
+        once(event: 'HeapProfiler.lastSeenObjectId', listener: (message: InspectorNotification<HeapProfiler.LastSeenObjectIdEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend may send update for one or more fragments
+         */
+        once(event: 'HeapProfiler.heapStatsUpdate', listener: (message: InspectorNotification<HeapProfiler.HeapStatsUpdateEventDataType>) => void): this;
+        /**
+         * Contains an bucket of collected trace events.
+         */
+        once(event: 'NodeTracing.dataCollected', listener: (message: InspectorNotification<NodeTracing.DataCollectedEventDataType>) => void): this;
+        /**
+         * Signals that tracing is stopped and there is no trace buffers pending flush, all data were
+         * delivered via dataCollected events.
+         */
+        once(event: 'NodeTracing.tracingComplete', listener: () => void): this;
+        /**
+         * Issued when attached to a worker.
+         */
+        once(event: 'NodeWorker.attachedToWorker', listener: (message: InspectorNotification<NodeWorker.AttachedToWorkerEventDataType>) => void): this;
+        /**
+         * Issued when detached from the worker.
+         */
+        once(event: 'NodeWorker.detachedFromWorker', listener: (message: InspectorNotification<NodeWorker.DetachedFromWorkerEventDataType>) => void): this;
+        /**
+         * Notifies about a new protocol message received from the session
+         * (session ID is provided in attachedToWorker notification).
+         */
+        once(event: 'NodeWorker.receivedMessageFromWorker', listener: (message: InspectorNotification<NodeWorker.ReceivedMessageFromWorkerEventDataType>) => void): this;
+        /**
+         * This event is fired instead of `Runtime.executionContextDestroyed` when
+         * enabled.
+         * It is fired when the Node process finished all code execution and is
+         * waiting for all frontends to disconnect.
+         */
+        once(event: 'NodeRuntime.waitingForDisconnect', listener: () => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        /**
+         * Emitted when any notification from the V8 Inspector is received.
+         */
+        prependListener(event: 'inspectorNotification', listener: (message: InspectorNotification<{}>) => void): this;
+        /**
+         * Issued when new execution context is created.
+         */
+        prependListener(event: 'Runtime.executionContextCreated', listener: (message: InspectorNotification<Runtime.ExecutionContextCreatedEventDataType>) => void): this;
+        /**
+         * Issued when execution context is destroyed.
+         */
+        prependListener(event: 'Runtime.executionContextDestroyed', listener: (message: InspectorNotification<Runtime.ExecutionContextDestroyedEventDataType>) => void): this;
+        /**
+         * Issued when all executionContexts were cleared in browser
+         */
+        prependListener(event: 'Runtime.executionContextsCleared', listener: () => void): this;
+        /**
+         * Issued when exception was thrown and unhandled.
+         */
+        prependListener(event: 'Runtime.exceptionThrown', listener: (message: InspectorNotification<Runtime.ExceptionThrownEventDataType>) => void): this;
+        /**
+         * Issued when unhandled exception was revoked.
+         */
+        prependListener(event: 'Runtime.exceptionRevoked', listener: (message: InspectorNotification<Runtime.ExceptionRevokedEventDataType>) => void): this;
+        /**
+         * Issued when console API was called.
+         */
+        prependListener(event: 'Runtime.consoleAPICalled', listener: (message: InspectorNotification<Runtime.ConsoleAPICalledEventDataType>) => void): this;
+        /**
+         * Issued when object should be inspected (for example, as a result of inspect() command line API call).
+         */
+        prependListener(event: 'Runtime.inspectRequested', listener: (message: InspectorNotification<Runtime.InspectRequestedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine parses script. This event is also fired for all known and uncollected scripts upon enabling debugger.
+         */
+        prependListener(event: 'Debugger.scriptParsed', listener: (message: InspectorNotification<Debugger.ScriptParsedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine fails to parse the script.
+         */
+        prependListener(event: 'Debugger.scriptFailedToParse', listener: (message: InspectorNotification<Debugger.ScriptFailedToParseEventDataType>) => void): this;
+        /**
+         * Fired when breakpoint is resolved to an actual script and location.
+         */
+        prependListener(event: 'Debugger.breakpointResolved', listener: (message: InspectorNotification<Debugger.BreakpointResolvedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine stopped on breakpoint or exception or any other stop criteria.
+         */
+        prependListener(event: 'Debugger.paused', listener: (message: InspectorNotification<Debugger.PausedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine resumed execution.
+         */
+        prependListener(event: 'Debugger.resumed', listener: () => void): this;
+        /**
+         * Issued when new console message is added.
+         */
+        prependListener(event: 'Console.messageAdded', listener: (message: InspectorNotification<Console.MessageAddedEventDataType>) => void): this;
+        /**
+         * Sent when new profile recording is started using console.profile() call.
+         */
+        prependListener(event: 'Profiler.consoleProfileStarted', listener: (message: InspectorNotification<Profiler.ConsoleProfileStartedEventDataType>) => void): this;
+        prependListener(event: 'Profiler.consoleProfileFinished', listener: (message: InspectorNotification<Profiler.ConsoleProfileFinishedEventDataType>) => void): this;
+        prependListener(event: 'HeapProfiler.addHeapSnapshotChunk', listener: (message: InspectorNotification<HeapProfiler.AddHeapSnapshotChunkEventDataType>) => void): this;
+        prependListener(event: 'HeapProfiler.resetProfiles', listener: () => void): this;
+        prependListener(event: 'HeapProfiler.reportHeapSnapshotProgress', listener: (message: InspectorNotification<HeapProfiler.ReportHeapSnapshotProgressEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend regularly sends a current value for last seen object id and corresponding timestamp. If the were changes in the heap since last event then one or more heapStatsUpdate events will be sent before a new lastSeenObjectId event.
+         */
+        prependListener(event: 'HeapProfiler.lastSeenObjectId', listener: (message: InspectorNotification<HeapProfiler.LastSeenObjectIdEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend may send update for one or more fragments
+         */
+        prependListener(event: 'HeapProfiler.heapStatsUpdate', listener: (message: InspectorNotification<HeapProfiler.HeapStatsUpdateEventDataType>) => void): this;
+        /**
+         * Contains an bucket of collected trace events.
+         */
+        prependListener(event: 'NodeTracing.dataCollected', listener: (message: InspectorNotification<NodeTracing.DataCollectedEventDataType>) => void): this;
+        /**
+         * Signals that tracing is stopped and there is no trace buffers pending flush, all data were
+         * delivered via dataCollected events.
+         */
+        prependListener(event: 'NodeTracing.tracingComplete', listener: () => void): this;
+        /**
+         * Issued when attached to a worker.
+         */
+        prependListener(event: 'NodeWorker.attachedToWorker', listener: (message: InspectorNotification<NodeWorker.AttachedToWorkerEventDataType>) => void): this;
+        /**
+         * Issued when detached from the worker.
+         */
+        prependListener(event: 'NodeWorker.detachedFromWorker', listener: (message: InspectorNotification<NodeWorker.DetachedFromWorkerEventDataType>) => void): this;
+        /**
+         * Notifies about a new protocol message received from the session
+         * (session ID is provided in attachedToWorker notification).
+         */
+        prependListener(event: 'NodeWorker.receivedMessageFromWorker', listener: (message: InspectorNotification<NodeWorker.ReceivedMessageFromWorkerEventDataType>) => void): this;
+        /**
+         * This event is fired instead of `Runtime.executionContextDestroyed` when
+         * enabled.
+         * It is fired when the Node process finished all code execution and is
+         * waiting for all frontends to disconnect.
+         */
+        prependListener(event: 'NodeRuntime.waitingForDisconnect', listener: () => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        /**
+         * Emitted when any notification from the V8 Inspector is received.
+         */
+        prependOnceListener(event: 'inspectorNotification', listener: (message: InspectorNotification<{}>) => void): this;
+        /**
+         * Issued when new execution context is created.
+         */
+        prependOnceListener(event: 'Runtime.executionContextCreated', listener: (message: InspectorNotification<Runtime.ExecutionContextCreatedEventDataType>) => void): this;
+        /**
+         * Issued when execution context is destroyed.
+         */
+        prependOnceListener(event: 'Runtime.executionContextDestroyed', listener: (message: InspectorNotification<Runtime.ExecutionContextDestroyedEventDataType>) => void): this;
+        /**
+         * Issued when all executionContexts were cleared in browser
+         */
+        prependOnceListener(event: 'Runtime.executionContextsCleared', listener: () => void): this;
+        /**
+         * Issued when exception was thrown and unhandled.
+         */
+        prependOnceListener(event: 'Runtime.exceptionThrown', listener: (message: InspectorNotification<Runtime.ExceptionThrownEventDataType>) => void): this;
+        /**
+         * Issued when unhandled exception was revoked.
+         */
+        prependOnceListener(event: 'Runtime.exceptionRevoked', listener: (message: InspectorNotification<Runtime.ExceptionRevokedEventDataType>) => void): this;
+        /**
+         * Issued when console API was called.
+         */
+        prependOnceListener(event: 'Runtime.consoleAPICalled', listener: (message: InspectorNotification<Runtime.ConsoleAPICalledEventDataType>) => void): this;
+        /**
+         * Issued when object should be inspected (for example, as a result of inspect() command line API call).
+         */
+        prependOnceListener(event: 'Runtime.inspectRequested', listener: (message: InspectorNotification<Runtime.InspectRequestedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine parses script. This event is also fired for all known and uncollected scripts upon enabling debugger.
+         */
+        prependOnceListener(event: 'Debugger.scriptParsed', listener: (message: InspectorNotification<Debugger.ScriptParsedEventDataType>) => void): this;
+        /**
+         * Fired when virtual machine fails to parse the script.
+         */
+        prependOnceListener(event: 'Debugger.scriptFailedToParse', listener: (message: InspectorNotification<Debugger.ScriptFailedToParseEventDataType>) => void): this;
+        /**
+         * Fired when breakpoint is resolved to an actual script and location.
+         */
+        prependOnceListener(event: 'Debugger.breakpointResolved', listener: (message: InspectorNotification<Debugger.BreakpointResolvedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine stopped on breakpoint or exception or any other stop criteria.
+         */
+        prependOnceListener(event: 'Debugger.paused', listener: (message: InspectorNotification<Debugger.PausedEventDataType>) => void): this;
+        /**
+         * Fired when the virtual machine resumed execution.
+         */
+        prependOnceListener(event: 'Debugger.resumed', listener: () => void): this;
+        /**
+         * Issued when new console message is added.
+         */
+        prependOnceListener(event: 'Console.messageAdded', listener: (message: InspectorNotification<Console.MessageAddedEventDataType>) => void): this;
+        /**
+         * Sent when new profile recording is started using console.profile() call.
+         */
+        prependOnceListener(event: 'Profiler.consoleProfileStarted', listener: (message: InspectorNotification<Profiler.ConsoleProfileStartedEventDataType>) => void): this;
+        prependOnceListener(event: 'Profiler.consoleProfileFinished', listener: (message: InspectorNotification<Profiler.ConsoleProfileFinishedEventDataType>) => void): this;
+        prependOnceListener(event: 'HeapProfiler.addHeapSnapshotChunk', listener: (message: InspectorNotification<HeapProfiler.AddHeapSnapshotChunkEventDataType>) => void): this;
+        prependOnceListener(event: 'HeapProfiler.resetProfiles', listener: () => void): this;
+        prependOnceListener(event: 'HeapProfiler.reportHeapSnapshotProgress', listener: (message: InspectorNotification<HeapProfiler.ReportHeapSnapshotProgressEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend regularly sends a current value for last seen object id and corresponding timestamp. If the were changes in the heap since last event then one or more heapStatsUpdate events will be sent before a new lastSeenObjectId event.
+         */
+        prependOnceListener(event: 'HeapProfiler.lastSeenObjectId', listener: (message: InspectorNotification<HeapProfiler.LastSeenObjectIdEventDataType>) => void): this;
+        /**
+         * If heap objects tracking has been started then backend may send update for one or more fragments
+         */
+        prependOnceListener(event: 'HeapProfiler.heapStatsUpdate', listener: (message: InspectorNotification<HeapProfiler.HeapStatsUpdateEventDataType>) => void): this;
+        /**
+         * Contains an bucket of collected trace events.
+         */
+        prependOnceListener(event: 'NodeTracing.dataCollected', listener: (message: InspectorNotification<NodeTracing.DataCollectedEventDataType>) => void): this;
+        /**
+         * Signals that tracing is stopped and there is no trace buffers pending flush, all data were
+         * delivered via dataCollected events.
+         */
+        prependOnceListener(event: 'NodeTracing.tracingComplete', listener: () => void): this;
+        /**
+         * Issued when attached to a worker.
+         */
+        prependOnceListener(event: 'NodeWorker.attachedToWorker', listener: (message: InspectorNotification<NodeWorker.AttachedToWorkerEventDataType>) => void): this;
+        /**
+         * Issued when detached from the worker.
+         */
+        prependOnceListener(event: 'NodeWorker.detachedFromWorker', listener: (message: InspectorNotification<NodeWorker.DetachedFromWorkerEventDataType>) => void): this;
+        /**
+         * Notifies about a new protocol message received from the session
+         * (session ID is provided in attachedToWorker notification).
+         */
+        prependOnceListener(event: 'NodeWorker.receivedMessageFromWorker', listener: (message: InspectorNotification<NodeWorker.ReceivedMessageFromWorkerEventDataType>) => void): this;
+        /**
+         * This event is fired instead of `Runtime.executionContextDestroyed` when
+         * enabled.
+         * It is fired when the Node process finished all code execution and is
+         * waiting for all frontends to disconnect.
+         */
+        prependOnceListener(event: 'NodeRuntime.waitingForDisconnect', listener: () => void): this;
+    }
+    /**
+     * Activate inspector on host and port. Equivalent to `node --inspect=[[host:]port]`, but can be done programmatically after node has
+     * started.
+     *
+     * If wait is `true`, will block until a client has connected to the inspect port
+     * and flow control has been passed to the debugger client.
+     *
+     * See the `security warning` regarding the `host`parameter usage.
+     * @param [port='what was specified on the CLI'] Port to listen on for inspector connections. Optional.
+     * @param [host='what was specified on the CLI'] Host to listen on for inspector connections. Optional.
+     * @param [wait=false] Block until a client has connected. Optional.
+     */
+    function open(port?: number, host?: string, wait?: boolean): void;
+    /**
+     * Deactivate the inspector. Blocks until there are no active connections.
+     */
+    function close(): void;
+    /**
+     * Return the URL of the active inspector, or `undefined` if there is none.
+     *
+     * ```console
+     * $ node --inspect -p 'inspector.url()'
+     * Debugger listening on ws://127.0.0.1:9229/166e272e-7a30-4d09-97ce-f1c012b43c34
+     * For help see https://nodejs.org/en/docs/inspector
+     * ws://127.0.0.1:9229/166e272e-7a30-4d09-97ce-f1c012b43c34
+     *
+     * $ node --inspect=localhost:3000 -p 'inspector.url()'
+     * Debugger listening on ws://localhost:3000/51cf8d0e-3c36-4c59-8efd-54519839e56a
+     * For help see https://nodejs.org/en/docs/inspector
+     * ws://localhost:3000/51cf8d0e-3c36-4c59-8efd-54519839e56a
+     *
+     * $ node -p 'inspector.url()'
+     * undefined
+     * ```
+     */
+    function url(): string | undefined;
+    /**
+     * Blocks until a client (existing or connected later) has sent`Runtime.runIfWaitingForDebugger` command.
+     *
+     * An exception will be thrown if there is no active inspector.
+     * @since v12.7.0
+     */
+    function waitForDebugger(): void;
+}
+declare module 'node:inspector' {
+    import EventEmitter = require('inspector');
+    export = EventEmitter;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/module.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/module.d.ts
new file mode 100644
index 0000000..d83aec9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/module.d.ts
@@ -0,0 +1,114 @@
+/**
+ * @since v0.3.7
+ */
+declare module 'module' {
+    import { URL } from 'node:url';
+    namespace Module {
+        /**
+         * The `module.syncBuiltinESMExports()` method updates all the live bindings for
+         * builtin `ES Modules` to match the properties of the `CommonJS` exports. It
+         * does not add or remove exported names from the `ES Modules`.
+         *
+         * ```js
+         * const fs = require('fs');
+         * const assert = require('assert');
+         * const { syncBuiltinESMExports } = require('module');
+         *
+         * fs.readFile = newAPI;
+         *
+         * delete fs.readFileSync;
+         *
+         * function newAPI() {
+         *   // ...
+         * }
+         *
+         * fs.newAPI = newAPI;
+         *
+         * syncBuiltinESMExports();
+         *
+         * import('fs').then((esmFS) => {
+         *   // It syncs the existing readFile property with the new value
+         *   assert.strictEqual(esmFS.readFile, newAPI);
+         *   // readFileSync has been deleted from the required fs
+         *   assert.strictEqual('readFileSync' in fs, false);
+         *   // syncBuiltinESMExports() does not remove readFileSync from esmFS
+         *   assert.strictEqual('readFileSync' in esmFS, true);
+         *   // syncBuiltinESMExports() does not add names
+         *   assert.strictEqual(esmFS.newAPI, undefined);
+         * });
+         * ```
+         * @since v12.12.0
+         */
+        function syncBuiltinESMExports(): void;
+        /**
+         * `path` is the resolved path for the file for which a corresponding source map
+         * should be fetched.
+         * @since v13.7.0, v12.17.0
+         */
+        function findSourceMap(path: string, error?: Error): SourceMap;
+        interface SourceMapPayload {
+            file: string;
+            version: number;
+            sources: string[];
+            sourcesContent: string[];
+            names: string[];
+            mappings: string;
+            sourceRoot: string;
+        }
+        interface SourceMapping {
+            generatedLine: number;
+            generatedColumn: number;
+            originalSource: string;
+            originalLine: number;
+            originalColumn: number;
+        }
+        /**
+         * @since v13.7.0, v12.17.0
+         */
+        class SourceMap {
+            /**
+             * Getter for the payload used to construct the `SourceMap` instance.
+             */
+            readonly payload: SourceMapPayload;
+            constructor(payload: SourceMapPayload);
+            /**
+             * Given a line number and column number in the generated source file, returns
+             * an object representing the position in the original file. The object returned
+             * consists of the following keys:
+             */
+            findEntry(line: number, column: number): SourceMapping;
+        }
+    }
+    interface Module extends NodeModule {}
+    class Module {
+        static runMain(): void;
+        static wrap(code: string): string;
+        static createRequire(path: string | URL): NodeRequire;
+        static builtinModules: string[];
+        static Module: typeof Module;
+        constructor(id: string, parent?: Module);
+    }
+    global {
+        interface ImportMeta {
+            url: string;
+            /**
+             * @experimental
+             * This feature is only available with the `--experimental-import-meta-resolve`
+             * command flag enabled.
+             *
+             * Provides a module-relative resolution function scoped to each module, returning
+             * the URL string.
+             *
+             * @param specified The module specifier to resolve relative to `parent`.
+             * @param parent The absolute parent module URL to resolve from. If none
+             * is specified, the value of `import.meta.url` is used as the default.
+             */
+            resolve?(specified: string, parent?: string | URL): Promise<string>;
+        }
+    }
+    export = Module;
+}
+declare module 'node:module' {
+    import module = require('module');
+    export = module;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/net.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/net.d.ts
new file mode 100644
index 0000000..f24b16c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/net.d.ts
@@ -0,0 +1,784 @@
+/**
+ * > Stability: 2 - Stable
+ *
+ * The `net` module provides an asynchronous network API for creating stream-based
+ * TCP or `IPC` servers ({@link createServer}) and clients
+ * ({@link createConnection}).
+ *
+ * It can be accessed using:
+ *
+ * ```js
+ * const net = require('net');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/net.js)
+ */
+declare module 'net' {
+    import * as stream from 'node:stream';
+    import { Abortable, EventEmitter } from 'node:events';
+    import * as dns from 'node:dns';
+    type LookupFunction = (hostname: string, options: dns.LookupOneOptions, callback: (err: NodeJS.ErrnoException | null, address: string, family: number) => void) => void;
+    interface AddressInfo {
+        address: string;
+        family: string;
+        port: number;
+    }
+    interface SocketConstructorOpts {
+        fd?: number | undefined;
+        allowHalfOpen?: boolean | undefined;
+        readable?: boolean | undefined;
+        writable?: boolean | undefined;
+        signal?: AbortSignal;
+    }
+    interface OnReadOpts {
+        buffer: Uint8Array | (() => Uint8Array);
+        /**
+         * This function is called for every chunk of incoming data.
+         * Two arguments are passed to it: the number of bytes written to buffer and a reference to buffer.
+         * Return false from this function to implicitly pause() the socket.
+         */
+        callback(bytesWritten: number, buf: Uint8Array): boolean;
+    }
+    interface ConnectOpts {
+        /**
+         * If specified, incoming data is stored in a single buffer and passed to the supplied callback when data arrives on the socket.
+         * Note: this will cause the streaming functionality to not provide any data, however events like 'error', 'end', and 'close' will
+         * still be emitted as normal and methods like pause() and resume() will also behave as expected.
+         */
+        onread?: OnReadOpts | undefined;
+    }
+    interface TcpSocketConnectOpts extends ConnectOpts {
+        port: number;
+        host?: string | undefined;
+        localAddress?: string | undefined;
+        localPort?: number | undefined;
+        hints?: number | undefined;
+        family?: number | undefined;
+        lookup?: LookupFunction | undefined;
+    }
+    interface IpcSocketConnectOpts extends ConnectOpts {
+        path: string;
+    }
+    type SocketConnectOpts = TcpSocketConnectOpts | IpcSocketConnectOpts;
+    /**
+     * This class is an abstraction of a TCP socket or a streaming `IPC` endpoint
+     * (uses named pipes on Windows, and Unix domain sockets otherwise). It is also
+     * an `EventEmitter`.
+     *
+     * A `net.Socket` can be created by the user and used directly to interact with
+     * a server. For example, it is returned by {@link createConnection},
+     * so the user can use it to talk to the server.
+     *
+     * It can also be created by Node.js and passed to the user when a connection
+     * is received. For example, it is passed to the listeners of a `'connection'` event emitted on a {@link Server}, so the user can use
+     * it to interact with the client.
+     * @since v0.3.4
+     */
+    class Socket extends stream.Duplex {
+        constructor(options?: SocketConstructorOpts);
+        /**
+         * Sends data on the socket. The second parameter specifies the encoding in the
+         * case of a string. It defaults to UTF8 encoding.
+         *
+         * Returns `true` if the entire data was flushed successfully to the kernel
+         * buffer. Returns `false` if all or part of the data was queued in user memory.`'drain'` will be emitted when the buffer is again free.
+         *
+         * The optional `callback` parameter will be executed when the data is finally
+         * written out, which may not be immediately.
+         *
+         * See `Writable` stream `write()` method for more
+         * information.
+         * @since v0.1.90
+         * @param [encoding='utf8'] Only used when data is `string`.
+         */
+        write(buffer: Uint8Array | string, cb?: (err?: Error) => void): boolean;
+        write(str: Uint8Array | string, encoding?: BufferEncoding, cb?: (err?: Error) => void): boolean;
+        /**
+         * Initiate a connection on a given socket.
+         *
+         * Possible signatures:
+         *
+         * * `socket.connect(options[, connectListener])`
+         * * `socket.connect(path[, connectListener])` for `IPC` connections.
+         * * `socket.connect(port[, host][, connectListener])` for TCP connections.
+         * * Returns: `net.Socket` The socket itself.
+         *
+         * This function is asynchronous. When the connection is established, the `'connect'` event will be emitted. If there is a problem connecting,
+         * instead of a `'connect'` event, an `'error'` event will be emitted with
+         * the error passed to the `'error'` listener.
+         * The last parameter `connectListener`, if supplied, will be added as a listener
+         * for the `'connect'` event **once**.
+         *
+         * This function should only be used for reconnecting a socket after`'close'` has been emitted or otherwise it may lead to undefined
+         * behavior.
+         */
+        connect(options: SocketConnectOpts, connectionListener?: () => void): this;
+        connect(port: number, host: string, connectionListener?: () => void): this;
+        connect(port: number, connectionListener?: () => void): this;
+        connect(path: string, connectionListener?: () => void): this;
+        /**
+         * Set the encoding for the socket as a `Readable Stream`. See `readable.setEncoding()` for more information.
+         * @since v0.1.90
+         * @return The socket itself.
+         */
+        setEncoding(encoding?: BufferEncoding): this;
+        /**
+         * Pauses the reading of data. That is, `'data'` events will not be emitted.
+         * Useful to throttle back an upload.
+         * @return The socket itself.
+         */
+        pause(): this;
+        /**
+         * Resumes reading after a call to `socket.pause()`.
+         * @return The socket itself.
+         */
+        resume(): this;
+        /**
+         * Sets the socket to timeout after `timeout` milliseconds of inactivity on
+         * the socket. By default `net.Socket` do not have a timeout.
+         *
+         * When an idle timeout is triggered the socket will receive a `'timeout'` event but the connection will not be severed. The user must manually call `socket.end()` or `socket.destroy()` to
+         * end the connection.
+         *
+         * ```js
+         * socket.setTimeout(3000);
+         * socket.on('timeout', () => {
+         *   console.log('socket timeout');
+         *   socket.end();
+         * });
+         * ```
+         *
+         * If `timeout` is 0, then the existing idle timeout is disabled.
+         *
+         * The optional `callback` parameter will be added as a one-time listener for the `'timeout'` event.
+         * @since v0.1.90
+         * @return The socket itself.
+         */
+        setTimeout(timeout: number, callback?: () => void): this;
+        /**
+         * Enable/disable the use of Nagle's algorithm.
+         *
+         * When a TCP connection is created, it will have Nagle's algorithm enabled.
+         *
+         * Nagle's algorithm delays data before it is sent via the network. It attempts
+         * to optimize throughput at the expense of latency.
+         *
+         * Passing `true` for `noDelay` or not passing an argument will disable Nagle's
+         * algorithm for the socket. Passing `false` for `noDelay` will enable Nagle's
+         * algorithm.
+         * @since v0.1.90
+         * @param [noDelay=true]
+         * @return The socket itself.
+         */
+        setNoDelay(noDelay?: boolean): this;
+        /**
+         * Enable/disable keep-alive functionality, and optionally set the initial
+         * delay before the first keepalive probe is sent on an idle socket.
+         *
+         * Set `initialDelay` (in milliseconds) to set the delay between the last
+         * data packet received and the first keepalive probe. Setting `0` for`initialDelay` will leave the value unchanged from the default
+         * (or previous) setting.
+         *
+         * Enabling the keep-alive functionality will set the following socket options:
+         *
+         * * `SO_KEEPALIVE=1`
+         * * `TCP_KEEPIDLE=initialDelay`
+         * * `TCP_KEEPCNT=10`
+         * * `TCP_KEEPINTVL=1`
+         * @since v0.1.92
+         * @param [enable=false]
+         * @param [initialDelay=0]
+         * @return The socket itself.
+         */
+        setKeepAlive(enable?: boolean, initialDelay?: number): this;
+        /**
+         * Returns the bound `address`, the address `family` name and `port` of the
+         * socket as reported by the operating system:`{ port: 12346, family: 'IPv4', address: '127.0.0.1' }`
+         * @since v0.1.90
+         */
+        address(): AddressInfo | {};
+        /**
+         * Calling `unref()` on a socket will allow the program to exit if this is the only
+         * active socket in the event system. If the socket is already `unref`ed calling`unref()` again will have no effect.
+         * @since v0.9.1
+         * @return The socket itself.
+         */
+        unref(): this;
+        /**
+         * Opposite of `unref()`, calling `ref()` on a previously `unref`ed socket will_not_ let the program exit if it's the only socket left (the default behavior).
+         * If the socket is `ref`ed calling `ref` again will have no effect.
+         * @since v0.9.1
+         * @return The socket itself.
+         */
+        ref(): this;
+        /**
+         * This property shows the number of characters buffered for writing. The buffer
+         * may contain strings whose length after encoding is not yet known. So this number
+         * is only an approximation of the number of bytes in the buffer.
+         *
+         * `net.Socket` has the property that `socket.write()` always works. This is to
+         * help users get up and running quickly. The computer cannot always keep up
+         * with the amount of data that is written to a socket. The network connection
+         * simply might be too slow. Node.js will internally queue up the data written to a
+         * socket and send it out over the wire when it is possible.
+         *
+         * The consequence of this internal buffering is that memory may grow.
+         * Users who experience large or growing `bufferSize` should attempt to
+         * "throttle" the data flows in their program with `socket.pause()` and `socket.resume()`.
+         * @since v0.3.8
+         * @deprecated Since v14.6.0 - Use `writableLength` instead.
+         */
+        readonly bufferSize: number;
+        /**
+         * The amount of received bytes.
+         * @since v0.5.3
+         */
+        readonly bytesRead: number;
+        /**
+         * The amount of bytes sent.
+         * @since v0.5.3
+         */
+        readonly bytesWritten: number;
+        /**
+         * If `true`,`socket.connect(options[, connectListener])` was
+         * called and has not yet finished. It will stay `true` until the socket becomes
+         * connected, then it is set to `false` and the `'connect'` event is emitted. Note
+         * that the `socket.connect(options[, connectListener])` callback is a listener for the `'connect'` event.
+         * @since v6.1.0
+         */
+        readonly connecting: boolean;
+        /**
+         * See `writable.destroyed` for further details.
+         */
+        readonly destroyed: boolean;
+        /**
+         * The string representation of the local IP address the remote client is
+         * connecting on. For example, in a server listening on `'0.0.0.0'`, if a client
+         * connects on `'192.168.1.1'`, the value of `socket.localAddress` would be`'192.168.1.1'`.
+         * @since v0.9.6
+         */
+        readonly localAddress?: string;
+        /**
+         * The numeric representation of the local port. For example, `80` or `21`.
+         * @since v0.9.6
+         */
+        readonly localPort?: number;
+        /**
+         * The string representation of the remote IP address. For example,`'74.125.127.100'` or `'2001:4860:a005::68'`. Value may be `undefined` if
+         * the socket is destroyed (for example, if the client disconnected).
+         * @since v0.5.10
+         */
+        readonly remoteAddress?: string | undefined;
+        /**
+         * The string representation of the remote IP family. `'IPv4'` or `'IPv6'`.
+         * @since v0.11.14
+         */
+        readonly remoteFamily?: string | undefined;
+        /**
+         * The numeric representation of the remote port. For example, `80` or `21`.
+         * @since v0.5.10
+         */
+        readonly remotePort?: number | undefined;
+        /**
+         * Half-closes the socket. i.e., it sends a FIN packet. It is possible the
+         * server will still send some data.
+         *
+         * See `writable.end()` for further details.
+         * @since v0.1.90
+         * @param [encoding='utf8'] Only used when data is `string`.
+         * @param callback Optional callback for when the socket is finished.
+         * @return The socket itself.
+         */
+        end(callback?: () => void): this;
+        end(buffer: Uint8Array | string, callback?: () => void): this;
+        end(str: Uint8Array | string, encoding?: BufferEncoding, callback?: () => void): this;
+        /**
+         * events.EventEmitter
+         *   1. close
+         *   2. connect
+         *   3. data
+         *   4. drain
+         *   5. end
+         *   6. error
+         *   7. lookup
+         *   8. timeout
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'close', listener: (hadError: boolean) => void): this;
+        addListener(event: 'connect', listener: () => void): this;
+        addListener(event: 'data', listener: (data: Buffer) => void): this;
+        addListener(event: 'drain', listener: () => void): this;
+        addListener(event: 'end', listener: () => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'lookup', listener: (err: Error, address: string, family: string | number, host: string) => void): this;
+        addListener(event: 'ready', listener: () => void): this;
+        addListener(event: 'timeout', listener: () => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'close', hadError: boolean): boolean;
+        emit(event: 'connect'): boolean;
+        emit(event: 'data', data: Buffer): boolean;
+        emit(event: 'drain'): boolean;
+        emit(event: 'end'): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'lookup', err: Error, address: string, family: string | number, host: string): boolean;
+        emit(event: 'ready'): boolean;
+        emit(event: 'timeout'): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: (hadError: boolean) => void): this;
+        on(event: 'connect', listener: () => void): this;
+        on(event: 'data', listener: (data: Buffer) => void): this;
+        on(event: 'drain', listener: () => void): this;
+        on(event: 'end', listener: () => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'lookup', listener: (err: Error, address: string, family: string | number, host: string) => void): this;
+        on(event: 'ready', listener: () => void): this;
+        on(event: 'timeout', listener: () => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: (hadError: boolean) => void): this;
+        once(event: 'connect', listener: () => void): this;
+        once(event: 'data', listener: (data: Buffer) => void): this;
+        once(event: 'drain', listener: () => void): this;
+        once(event: 'end', listener: () => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'lookup', listener: (err: Error, address: string, family: string | number, host: string) => void): this;
+        once(event: 'ready', listener: () => void): this;
+        once(event: 'timeout', listener: () => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: (hadError: boolean) => void): this;
+        prependListener(event: 'connect', listener: () => void): this;
+        prependListener(event: 'data', listener: (data: Buffer) => void): this;
+        prependListener(event: 'drain', listener: () => void): this;
+        prependListener(event: 'end', listener: () => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'lookup', listener: (err: Error, address: string, family: string | number, host: string) => void): this;
+        prependListener(event: 'ready', listener: () => void): this;
+        prependListener(event: 'timeout', listener: () => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: (hadError: boolean) => void): this;
+        prependOnceListener(event: 'connect', listener: () => void): this;
+        prependOnceListener(event: 'data', listener: (data: Buffer) => void): this;
+        prependOnceListener(event: 'drain', listener: () => void): this;
+        prependOnceListener(event: 'end', listener: () => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'lookup', listener: (err: Error, address: string, family: string | number, host: string) => void): this;
+        prependOnceListener(event: 'ready', listener: () => void): this;
+        prependOnceListener(event: 'timeout', listener: () => void): this;
+    }
+    interface ListenOptions extends Abortable {
+        port?: number | undefined;
+        host?: string | undefined;
+        backlog?: number | undefined;
+        path?: string | undefined;
+        exclusive?: boolean | undefined;
+        readableAll?: boolean | undefined;
+        writableAll?: boolean | undefined;
+        /**
+         * @default false
+         */
+        ipv6Only?: boolean | undefined;
+    }
+    interface ServerOpts {
+        /**
+         * Indicates whether half-opened TCP connections are allowed.
+         * @default false
+         */
+        allowHalfOpen?: boolean | undefined;
+        /**
+         * Indicates whether the socket should be paused on incoming connections.
+         * @default false
+         */
+        pauseOnConnect?: boolean | undefined;
+    }
+    /**
+     * This class is used to create a TCP or `IPC` server.
+     * @since v0.1.90
+     */
+    class Server extends EventEmitter {
+        constructor(connectionListener?: (socket: Socket) => void);
+        constructor(options?: ServerOpts, connectionListener?: (socket: Socket) => void);
+        /**
+         * Start a server listening for connections. A `net.Server` can be a TCP or
+         * an `IPC` server depending on what it listens to.
+         *
+         * Possible signatures:
+         *
+         * * `server.listen(handle[, backlog][, callback])`
+         * * `server.listen(options[, callback])`
+         * * `server.listen(path[, backlog][, callback])` for `IPC` servers
+         * * `server.listen([port[, host[, backlog]]][, callback])` for TCP servers
+         *
+         * This function is asynchronous. When the server starts listening, the `'listening'` event will be emitted. The last parameter `callback`will be added as a listener for the `'listening'`
+         * event.
+         *
+         * All `listen()` methods can take a `backlog` parameter to specify the maximum
+         * length of the queue of pending connections. The actual length will be determined
+         * by the OS through sysctl settings such as `tcp_max_syn_backlog` and `somaxconn`on Linux. The default value of this parameter is 511 (not 512).
+         *
+         * All {@link Socket} are set to `SO_REUSEADDR` (see [`socket(7)`](https://man7.org/linux/man-pages/man7/socket.7.html) for
+         * details).
+         *
+         * The `server.listen()` method can be called again if and only if there was an
+         * error during the first `server.listen()` call or `server.close()` has been
+         * called. Otherwise, an `ERR_SERVER_ALREADY_LISTEN` error will be thrown.
+         *
+         * One of the most common errors raised when listening is `EADDRINUSE`.
+         * This happens when another server is already listening on the requested`port`/`path`/`handle`. One way to handle this would be to retry
+         * after a certain amount of time:
+         *
+         * ```js
+         * server.on('error', (e) => {
+         *   if (e.code === 'EADDRINUSE') {
+         *     console.log('Address in use, retrying...');
+         *     setTimeout(() => {
+         *       server.close();
+         *       server.listen(PORT, HOST);
+         *     }, 1000);
+         *   }
+         * });
+         * ```
+         */
+        listen(port?: number, hostname?: string, backlog?: number, listeningListener?: () => void): this;
+        listen(port?: number, hostname?: string, listeningListener?: () => void): this;
+        listen(port?: number, backlog?: number, listeningListener?: () => void): this;
+        listen(port?: number, listeningListener?: () => void): this;
+        listen(path: string, backlog?: number, listeningListener?: () => void): this;
+        listen(path: string, listeningListener?: () => void): this;
+        listen(options: ListenOptions, listeningListener?: () => void): this;
+        listen(handle: any, backlog?: number, listeningListener?: () => void): this;
+        listen(handle: any, listeningListener?: () => void): this;
+        /**
+         * Stops the server from accepting new connections and keeps existing
+         * connections. This function is asynchronous, the server is finally closed
+         * when all connections are ended and the server emits a `'close'` event.
+         * The optional `callback` will be called once the `'close'` event occurs. Unlike
+         * that event, it will be called with an `Error` as its only argument if the server
+         * was not open when it was closed.
+         * @since v0.1.90
+         * @param callback Called when the server is closed.
+         */
+        close(callback?: (err?: Error) => void): this;
+        /**
+         * Returns the bound `address`, the address `family` name, and `port` of the server
+         * as reported by the operating system if listening on an IP socket
+         * (useful to find which port was assigned when getting an OS-assigned address):`{ port: 12346, family: 'IPv4', address: '127.0.0.1' }`.
+         *
+         * For a server listening on a pipe or Unix domain socket, the name is returned
+         * as a string.
+         *
+         * ```js
+         * const server = net.createServer((socket) => {
+         *   socket.end('goodbye\n');
+         * }).on('error', (err) => {
+         *   // Handle errors here.
+         *   throw err;
+         * });
+         *
+         * // Grab an arbitrary unused port.
+         * server.listen(() => {
+         *   console.log('opened server on', server.address());
+         * });
+         * ```
+         *
+         * `server.address()` returns `null` before the `'listening'` event has been
+         * emitted or after calling `server.close()`.
+         * @since v0.1.90
+         */
+        address(): AddressInfo | string | null;
+        /**
+         * Asynchronously get the number of concurrent connections on the server. Works
+         * when sockets were sent to forks.
+         *
+         * Callback should take two arguments `err` and `count`.
+         * @since v0.9.7
+         */
+        getConnections(cb: (error: Error | null, count: number) => void): void;
+        /**
+         * Opposite of `unref()`, calling `ref()` on a previously `unref`ed server will_not_ let the program exit if it's the only server left (the default behavior).
+         * If the server is `ref`ed calling `ref()` again will have no effect.
+         * @since v0.9.1
+         */
+        ref(): this;
+        /**
+         * Calling `unref()` on a server will allow the program to exit if this is the only
+         * active server in the event system. If the server is already `unref`ed calling`unref()` again will have no effect.
+         * @since v0.9.1
+         */
+        unref(): this;
+        /**
+         * Set this property to reject connections when the server's connection count gets
+         * high.
+         *
+         * It is not recommended to use this option once a socket has been sent to a child
+         * with `child_process.fork()`.
+         * @since v0.2.0
+         */
+        maxConnections: number;
+        connections: number;
+        /**
+         * Indicates whether or not the server is listening for connections.
+         * @since v5.7.0
+         */
+        listening: boolean;
+        /**
+         * events.EventEmitter
+         *   1. close
+         *   2. connection
+         *   3. error
+         *   4. listening
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'connection', listener: (socket: Socket) => void): this;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'listening', listener: () => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'connection', socket: Socket): boolean;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'listening'): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'connection', listener: (socket: Socket) => void): this;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'listening', listener: () => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'connection', listener: (socket: Socket) => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'listening', listener: () => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'connection', listener: (socket: Socket) => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'listening', listener: () => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'connection', listener: (socket: Socket) => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'listening', listener: () => void): this;
+    }
+    type IPVersion = 'ipv4' | 'ipv6';
+    /**
+     * The `BlockList` object can be used with some network APIs to specify rules for
+     * disabling inbound or outbound access to specific IP addresses, IP ranges, or
+     * IP subnets.
+     * @since v15.0.0, v14.18.0
+     */
+    class BlockList {
+        /**
+         * Adds a rule to block the given IP address.
+         * @since v15.0.0, v14.18.0
+         * @param address An IPv4 or IPv6 address.
+         * @param [type='ipv4'] Either `'ipv4'` or `'ipv6'`.
+         */
+        addAddress(address: string, type?: IPVersion): void;
+        addAddress(address: SocketAddress): void;
+        /**
+         * Adds a rule to block a range of IP addresses from `start` (inclusive) to`end` (inclusive).
+         * @since v15.0.0, v14.18.0
+         * @param start The starting IPv4 or IPv6 address in the range.
+         * @param end The ending IPv4 or IPv6 address in the range.
+         * @param [type='ipv4'] Either `'ipv4'` or `'ipv6'`.
+         */
+        addRange(start: string, end: string, type?: IPVersion): void;
+        addRange(start: SocketAddress, end: SocketAddress): void;
+        /**
+         * Adds a rule to block a range of IP addresses specified as a subnet mask.
+         * @since v15.0.0, v14.18.0
+         * @param net The network IPv4 or IPv6 address.
+         * @param prefix The number of CIDR prefix bits. For IPv4, this must be a value between `0` and `32`. For IPv6, this must be between `0` and `128`.
+         * @param [type='ipv4'] Either `'ipv4'` or `'ipv6'`.
+         */
+        addSubnet(net: SocketAddress, prefix: number): void;
+        addSubnet(net: string, prefix: number, type?: IPVersion): void;
+        /**
+         * Returns `true` if the given IP address matches any of the rules added to the`BlockList`.
+         *
+         * ```js
+         * const blockList = new net.BlockList();
+         * blockList.addAddress('123.123.123.123');
+         * blockList.addRange('10.0.0.1', '10.0.0.10');
+         * blockList.addSubnet('8592:757c:efae:4e45::', 64, 'ipv6');
+         *
+         * console.log(blockList.check('123.123.123.123'));  // Prints: true
+         * console.log(blockList.check('10.0.0.3'));  // Prints: true
+         * console.log(blockList.check('222.111.111.222'));  // Prints: false
+         *
+         * // IPv6 notation for IPv4 addresses works:
+         * console.log(blockList.check('::ffff:7b7b:7b7b', 'ipv6')); // Prints: true
+         * console.log(blockList.check('::ffff:123.123.123.123', 'ipv6')); // Prints: true
+         * ```
+         * @since v15.0.0, v14.18.0
+         * @param address The IP address to check
+         * @param [type='ipv4'] Either `'ipv4'` or `'ipv6'`.
+         */
+        check(address: SocketAddress): boolean;
+        check(address: string, type?: IPVersion): boolean;
+    }
+    interface TcpNetConnectOpts extends TcpSocketConnectOpts, SocketConstructorOpts {
+        timeout?: number | undefined;
+    }
+    interface IpcNetConnectOpts extends IpcSocketConnectOpts, SocketConstructorOpts {
+        timeout?: number | undefined;
+    }
+    type NetConnectOpts = TcpNetConnectOpts | IpcNetConnectOpts;
+    /**
+     * Creates a new TCP or `IPC` server.
+     *
+     * If `allowHalfOpen` is set to `true`, when the other end of the socket
+     * signals the end of transmission, the server will only send back the end of
+     * transmission when `socket.end()` is explicitly called. For example, in the
+     * context of TCP, when a FIN packed is received, a FIN packed is sent
+     * back only when `socket.end()` is explicitly called. Until then the
+     * connection is half-closed (non-readable but still writable). See `'end'` event and [RFC 1122](https://tools.ietf.org/html/rfc1122) (section 4.2.2.13) for more information.
+     *
+     * If `pauseOnConnect` is set to `true`, then the socket associated with each
+     * incoming connection will be paused, and no data will be read from its handle.
+     * This allows connections to be passed between processes without any data being
+     * read by the original process. To begin reading data from a paused socket, call `socket.resume()`.
+     *
+     * The server can be a TCP server or an `IPC` server, depending on what it `listen()` to.
+     *
+     * Here is an example of an TCP echo server which listens for connections
+     * on port 8124:
+     *
+     * ```js
+     * const net = require('net');
+     * const server = net.createServer((c) => {
+     *   // 'connection' listener.
+     *   console.log('client connected');
+     *   c.on('end', () => {
+     *     console.log('client disconnected');
+     *   });
+     *   c.write('hello\r\n');
+     *   c.pipe(c);
+     * });
+     * server.on('error', (err) => {
+     *   throw err;
+     * });
+     * server.listen(8124, () => {
+     *   console.log('server bound');
+     * });
+     * ```
+     *
+     * Test this by using `telnet`:
+     *
+     * ```console
+     * $ telnet localhost 8124
+     * ```
+     *
+     * To listen on the socket `/tmp/echo.sock`:
+     *
+     * ```js
+     * server.listen('/tmp/echo.sock', () => {
+     *   console.log('server bound');
+     * });
+     * ```
+     *
+     * Use `nc` to connect to a Unix domain socket server:
+     *
+     * ```console
+     * $ nc -U /tmp/echo.sock
+     * ```
+     * @since v0.5.0
+     * @param connectionListener Automatically set as a listener for the {@link 'connection'} event.
+     */
+    function createServer(connectionListener?: (socket: Socket) => void): Server;
+    function createServer(options?: ServerOpts, connectionListener?: (socket: Socket) => void): Server;
+    /**
+     * Aliases to {@link createConnection}.
+     *
+     * Possible signatures:
+     *
+     * * {@link connect}
+     * * {@link connect} for `IPC` connections.
+     * * {@link connect} for TCP connections.
+     */
+    function connect(options: NetConnectOpts, connectionListener?: () => void): Socket;
+    function connect(port: number, host?: string, connectionListener?: () => void): Socket;
+    function connect(path: string, connectionListener?: () => void): Socket;
+    /**
+     * A factory function, which creates a new {@link Socket},
+     * immediately initiates connection with `socket.connect()`,
+     * then returns the `net.Socket` that starts the connection.
+     *
+     * When the connection is established, a `'connect'` event will be emitted
+     * on the returned socket. The last parameter `connectListener`, if supplied,
+     * will be added as a listener for the `'connect'` event **once**.
+     *
+     * Possible signatures:
+     *
+     * * {@link createConnection}
+     * * {@link createConnection} for `IPC` connections.
+     * * {@link createConnection} for TCP connections.
+     *
+     * The {@link connect} function is an alias to this function.
+     */
+    function createConnection(options: NetConnectOpts, connectionListener?: () => void): Socket;
+    function createConnection(port: number, host?: string, connectionListener?: () => void): Socket;
+    function createConnection(path: string, connectionListener?: () => void): Socket;
+    /**
+     * Tests if input is an IP address. Returns `0` for invalid strings,
+     * returns `4` for IP version 4 addresses, and returns `6` for IP version 6
+     * addresses.
+     * @since v0.3.0
+     */
+    function isIP(input: string): number;
+    /**
+     * Returns `true` if input is a version 4 IP address, otherwise returns `false`.
+     * @since v0.3.0
+     */
+    function isIPv4(input: string): boolean;
+    /**
+     * Returns `true` if input is a version 6 IP address, otherwise returns `false`.
+     * @since v0.3.0
+     */
+    function isIPv6(input: string): boolean;
+    interface SocketAddressInitOptions {
+        /**
+         * The network address as either an IPv4 or IPv6 string.
+         * @default 127.0.0.1
+         */
+        address?: string | undefined;
+        /**
+         * @default `'ipv4'`
+         */
+        family?: IPVersion | undefined;
+        /**
+         * An IPv6 flow-label used only if `family` is `'ipv6'`.
+         * @default 0
+         */
+        flowlabel?: number | undefined;
+        /**
+         * An IP port.
+         * @default 0
+         */
+        port?: number | undefined;
+    }
+    /**
+     * @since v15.14.0, v14.18.0
+     */
+    class SocketAddress {
+        constructor(options: SocketAddressInitOptions);
+        /**
+         * Either \`'ipv4'\` or \`'ipv6'\`.
+         * @since v15.14.0, v14.18.0
+         */
+        readonly address: string;
+        /**
+         * Either \`'ipv4'\` or \`'ipv6'\`.
+         * @since v15.14.0, v14.18.0
+         */
+        readonly family: IPVersion;
+        /**
+         * @since v15.14.0, v14.18.0
+         */
+        readonly port: number;
+        /**
+         * @since v15.14.0, v14.18.0
+         */
+        readonly flowlabel: number;
+    }
+}
+declare module 'node:net' {
+    export * from 'net';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/os.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/os.d.ts
new file mode 100644
index 0000000..a618e91
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/os.d.ts
@@ -0,0 +1,455 @@
+/**
+ * The `os` module provides operating system-related utility methods and
+ * properties. It can be accessed using:
+ *
+ * ```js
+ * const os = require('os');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/os.js)
+ */
+declare module 'os' {
+    interface CpuInfo {
+        model: string;
+        speed: number;
+        times: {
+            user: number;
+            nice: number;
+            sys: number;
+            idle: number;
+            irq: number;
+        };
+    }
+    interface NetworkInterfaceBase {
+        address: string;
+        netmask: string;
+        mac: string;
+        internal: boolean;
+        cidr: string | null;
+    }
+    interface NetworkInterfaceInfoIPv4 extends NetworkInterfaceBase {
+        family: 'IPv4';
+    }
+    interface NetworkInterfaceInfoIPv6 extends NetworkInterfaceBase {
+        family: 'IPv6';
+        scopeid: number;
+    }
+    interface UserInfo<T> {
+        username: T;
+        uid: number;
+        gid: number;
+        shell: T;
+        homedir: T;
+    }
+    type NetworkInterfaceInfo = NetworkInterfaceInfoIPv4 | NetworkInterfaceInfoIPv6;
+    /**
+     * Returns the host name of the operating system as a string.
+     * @since v0.3.3
+     */
+    function hostname(): string;
+    /**
+     * Returns an array containing the 1, 5, and 15 minute load averages.
+     *
+     * The load average is a measure of system activity calculated by the operating
+     * system and expressed as a fractional number.
+     *
+     * The load average is a Unix-specific concept. On Windows, the return value is
+     * always `[0, 0, 0]`.
+     * @since v0.3.3
+     */
+    function loadavg(): number[];
+    /**
+     * Returns the system uptime in number of seconds.
+     * @since v0.3.3
+     */
+    function uptime(): number;
+    /**
+     * Returns the amount of free system memory in bytes as an integer.
+     * @since v0.3.3
+     */
+    function freemem(): number;
+    /**
+     * Returns the total amount of system memory in bytes as an integer.
+     * @since v0.3.3
+     */
+    function totalmem(): number;
+    /**
+     * Returns an array of objects containing information about each logical CPU core.
+     *
+     * The properties included on each object include:
+     *
+     * ```js
+     * [
+     *   {
+     *     model: 'Intel(R) Core(TM) i7 CPU         860  @ 2.80GHz',
+     *     speed: 2926,
+     *     times: {
+     *       user: 252020,
+     *       nice: 0,
+     *       sys: 30340,
+     *       idle: 1070356870,
+     *       irq: 0
+     *     }
+     *   },
+     *   {
+     *     model: 'Intel(R) Core(TM) i7 CPU         860  @ 2.80GHz',
+     *     speed: 2926,
+     *     times: {
+     *       user: 306960,
+     *       nice: 0,
+     *       sys: 26980,
+     *       idle: 1071569080,
+     *       irq: 0
+     *     }
+     *   },
+     *   {
+     *     model: 'Intel(R) Core(TM) i7 CPU         860  @ 2.80GHz',
+     *     speed: 2926,
+     *     times: {
+     *       user: 248450,
+     *       nice: 0,
+     *       sys: 21750,
+     *       idle: 1070919370,
+     *       irq: 0
+     *     }
+     *   },
+     *   {
+     *     model: 'Intel(R) Core(TM) i7 CPU         860  @ 2.80GHz',
+     *     speed: 2926,
+     *     times: {
+     *       user: 256880,
+     *       nice: 0,
+     *       sys: 19430,
+     *       idle: 1070905480,
+     *       irq: 20
+     *     }
+     *   },
+     * ]
+     * ```
+     *
+     * `nice` values are POSIX-only. On Windows, the `nice` values of all processors
+     * are always 0.
+     * @since v0.3.3
+     */
+    function cpus(): CpuInfo[];
+    /**
+     * Returns the operating system name as returned by [`uname(3)`](https://linux.die.net/man/3/uname). For example, it
+     * returns `'Linux'` on Linux, `'Darwin'` on macOS, and `'Windows_NT'` on Windows.
+     *
+     * See [https://en.wikipedia.org/wiki/Uname#Examples](https://en.wikipedia.org/wiki/Uname#Examples) for additional information
+     * about the output of running [`uname(3)`](https://linux.die.net/man/3/uname) on various operating systems.
+     * @since v0.3.3
+     */
+    function type(): string;
+    /**
+     * Returns the operating system as a string.
+     *
+     * On POSIX systems, the operating system release is determined by calling [`uname(3)`](https://linux.die.net/man/3/uname). On Windows, `GetVersionExW()` is used. See
+     * [https://en.wikipedia.org/wiki/Uname#Examples](https://en.wikipedia.org/wiki/Uname#Examples) for more information.
+     * @since v0.3.3
+     */
+    function release(): string;
+    /**
+     * Returns an object containing network interfaces that have been assigned a
+     * network address.
+     *
+     * Each key on the returned object identifies a network interface. The associated
+     * value is an array of objects that each describe an assigned network address.
+     *
+     * The properties available on the assigned network address object include:
+     *
+     * ```js
+     * {
+     *   lo: [
+     *     {
+     *       address: '127.0.0.1',
+     *       netmask: '255.0.0.0',
+     *       family: 'IPv4',
+     *       mac: '00:00:00:00:00:00',
+     *       internal: true,
+     *       cidr: '127.0.0.1/8'
+     *     },
+     *     {
+     *       address: '::1',
+     *       netmask: 'ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff',
+     *       family: 'IPv6',
+     *       mac: '00:00:00:00:00:00',
+     *       scopeid: 0,
+     *       internal: true,
+     *       cidr: '::1/128'
+     *     }
+     *   ],
+     *   eth0: [
+     *     {
+     *       address: '192.168.1.108',
+     *       netmask: '255.255.255.0',
+     *       family: 'IPv4',
+     *       mac: '01:02:03:0a:0b:0c',
+     *       internal: false,
+     *       cidr: '192.168.1.108/24'
+     *     },
+     *     {
+     *       address: 'fe80::a00:27ff:fe4e:66a1',
+     *       netmask: 'ffff:ffff:ffff:ffff::',
+     *       family: 'IPv6',
+     *       mac: '01:02:03:0a:0b:0c',
+     *       scopeid: 1,
+     *       internal: false,
+     *       cidr: 'fe80::a00:27ff:fe4e:66a1/64'
+     *     }
+     *   ]
+     * }
+     * ```
+     * @since v0.6.0
+     */
+    function networkInterfaces(): NodeJS.Dict<NetworkInterfaceInfo[]>;
+    /**
+     * Returns the string path of the current user's home directory.
+     *
+     * On POSIX, it uses the `$HOME` environment variable if defined. Otherwise it
+     * uses the [effective UID](https://en.wikipedia.org/wiki/User_identifier#Effective_user_ID) to look up the user's home directory.
+     *
+     * On Windows, it uses the `USERPROFILE` environment variable if defined.
+     * Otherwise it uses the path to the profile directory of the current user.
+     * @since v2.3.0
+     */
+    function homedir(): string;
+    /**
+     * Returns information about the currently effective user. On POSIX platforms,
+     * this is typically a subset of the password file. The returned object includes
+     * the `username`, `uid`, `gid`, `shell`, and `homedir`. On Windows, the `uid` and`gid` fields are `-1`, and `shell` is `null`.
+     *
+     * The value of `homedir` returned by `os.userInfo()` is provided by the operating
+     * system. This differs from the result of `os.homedir()`, which queries
+     * environment variables for the home directory before falling back to the
+     * operating system response.
+     *
+     * Throws a `SystemError` if a user has no `username` or `homedir`.
+     * @since v6.0.0
+     */
+    function userInfo(options: { encoding: 'buffer' }): UserInfo<Buffer>;
+    function userInfo(options?: { encoding: BufferEncoding }): UserInfo<string>;
+    type SignalConstants = {
+        [key in NodeJS.Signals]: number;
+    };
+    namespace constants {
+        const UV_UDP_REUSEADDR: number;
+        namespace signals {}
+        const signals: SignalConstants;
+        namespace errno {
+            const E2BIG: number;
+            const EACCES: number;
+            const EADDRINUSE: number;
+            const EADDRNOTAVAIL: number;
+            const EAFNOSUPPORT: number;
+            const EAGAIN: number;
+            const EALREADY: number;
+            const EBADF: number;
+            const EBADMSG: number;
+            const EBUSY: number;
+            const ECANCELED: number;
+            const ECHILD: number;
+            const ECONNABORTED: number;
+            const ECONNREFUSED: number;
+            const ECONNRESET: number;
+            const EDEADLK: number;
+            const EDESTADDRREQ: number;
+            const EDOM: number;
+            const EDQUOT: number;
+            const EEXIST: number;
+            const EFAULT: number;
+            const EFBIG: number;
+            const EHOSTUNREACH: number;
+            const EIDRM: number;
+            const EILSEQ: number;
+            const EINPROGRESS: number;
+            const EINTR: number;
+            const EINVAL: number;
+            const EIO: number;
+            const EISCONN: number;
+            const EISDIR: number;
+            const ELOOP: number;
+            const EMFILE: number;
+            const EMLINK: number;
+            const EMSGSIZE: number;
+            const EMULTIHOP: number;
+            const ENAMETOOLONG: number;
+            const ENETDOWN: number;
+            const ENETRESET: number;
+            const ENETUNREACH: number;
+            const ENFILE: number;
+            const ENOBUFS: number;
+            const ENODATA: number;
+            const ENODEV: number;
+            const ENOENT: number;
+            const ENOEXEC: number;
+            const ENOLCK: number;
+            const ENOLINK: number;
+            const ENOMEM: number;
+            const ENOMSG: number;
+            const ENOPROTOOPT: number;
+            const ENOSPC: number;
+            const ENOSR: number;
+            const ENOSTR: number;
+            const ENOSYS: number;
+            const ENOTCONN: number;
+            const ENOTDIR: number;
+            const ENOTEMPTY: number;
+            const ENOTSOCK: number;
+            const ENOTSUP: number;
+            const ENOTTY: number;
+            const ENXIO: number;
+            const EOPNOTSUPP: number;
+            const EOVERFLOW: number;
+            const EPERM: number;
+            const EPIPE: number;
+            const EPROTO: number;
+            const EPROTONOSUPPORT: number;
+            const EPROTOTYPE: number;
+            const ERANGE: number;
+            const EROFS: number;
+            const ESPIPE: number;
+            const ESRCH: number;
+            const ESTALE: number;
+            const ETIME: number;
+            const ETIMEDOUT: number;
+            const ETXTBSY: number;
+            const EWOULDBLOCK: number;
+            const EXDEV: number;
+            const WSAEINTR: number;
+            const WSAEBADF: number;
+            const WSAEACCES: number;
+            const WSAEFAULT: number;
+            const WSAEINVAL: number;
+            const WSAEMFILE: number;
+            const WSAEWOULDBLOCK: number;
+            const WSAEINPROGRESS: number;
+            const WSAEALREADY: number;
+            const WSAENOTSOCK: number;
+            const WSAEDESTADDRREQ: number;
+            const WSAEMSGSIZE: number;
+            const WSAEPROTOTYPE: number;
+            const WSAENOPROTOOPT: number;
+            const WSAEPROTONOSUPPORT: number;
+            const WSAESOCKTNOSUPPORT: number;
+            const WSAEOPNOTSUPP: number;
+            const WSAEPFNOSUPPORT: number;
+            const WSAEAFNOSUPPORT: number;
+            const WSAEADDRINUSE: number;
+            const WSAEADDRNOTAVAIL: number;
+            const WSAENETDOWN: number;
+            const WSAENETUNREACH: number;
+            const WSAENETRESET: number;
+            const WSAECONNABORTED: number;
+            const WSAECONNRESET: number;
+            const WSAENOBUFS: number;
+            const WSAEISCONN: number;
+            const WSAENOTCONN: number;
+            const WSAESHUTDOWN: number;
+            const WSAETOOMANYREFS: number;
+            const WSAETIMEDOUT: number;
+            const WSAECONNREFUSED: number;
+            const WSAELOOP: number;
+            const WSAENAMETOOLONG: number;
+            const WSAEHOSTDOWN: number;
+            const WSAEHOSTUNREACH: number;
+            const WSAENOTEMPTY: number;
+            const WSAEPROCLIM: number;
+            const WSAEUSERS: number;
+            const WSAEDQUOT: number;
+            const WSAESTALE: number;
+            const WSAEREMOTE: number;
+            const WSASYSNOTREADY: number;
+            const WSAVERNOTSUPPORTED: number;
+            const WSANOTINITIALISED: number;
+            const WSAEDISCON: number;
+            const WSAENOMORE: number;
+            const WSAECANCELLED: number;
+            const WSAEINVALIDPROCTABLE: number;
+            const WSAEINVALIDPROVIDER: number;
+            const WSAEPROVIDERFAILEDINIT: number;
+            const WSASYSCALLFAILURE: number;
+            const WSASERVICE_NOT_FOUND: number;
+            const WSATYPE_NOT_FOUND: number;
+            const WSA_E_NO_MORE: number;
+            const WSA_E_CANCELLED: number;
+            const WSAEREFUSED: number;
+        }
+        namespace priority {
+            const PRIORITY_LOW: number;
+            const PRIORITY_BELOW_NORMAL: number;
+            const PRIORITY_NORMAL: number;
+            const PRIORITY_ABOVE_NORMAL: number;
+            const PRIORITY_HIGH: number;
+            const PRIORITY_HIGHEST: number;
+        }
+    }
+    const devNull: string;
+    const EOL: string;
+    /**
+     * Returns the operating system CPU architecture for which the Node.js binary was
+     * compiled. Possible values are `'arm'`, `'arm64'`, `'ia32'`, `'mips'`,`'mipsel'`, `'ppc'`, `'ppc64'`, `'s390'`, `'s390x'`, `'x32'`, and `'x64'`.
+     *
+     * The return value is equivalent to `process.arch`.
+     * @since v0.5.0
+     */
+    function arch(): string;
+    /**
+     * Returns a string identifying the kernel version.
+     *
+     * On POSIX systems, the operating system release is determined by calling [`uname(3)`](https://linux.die.net/man/3/uname). On Windows, `RtlGetVersion()` is used, and if it is not
+     * available, `GetVersionExW()` will be used. See [https://en.wikipedia.org/wiki/Uname#Examples](https://en.wikipedia.org/wiki/Uname#Examples) for more information.
+     * @since v13.11.0, v12.17.0
+     */
+    function version(): string;
+    /**
+     * Returns a string identifying the operating system platform. The value is set
+     * at compile time. Possible values are `'aix'`, `'darwin'`, `'freebsd'`,`'linux'`, `'openbsd'`, `'sunos'`, and `'win32'`.
+     *
+     * The return value is equivalent to `process.platform`.
+     *
+     * The value `'android'` may also be returned if Node.js is built on the Android
+     * operating system. [Android support is experimental](https://github.com/nodejs/node/blob/HEAD/BUILDING.md#androidandroid-based-devices-eg-firefox-os).
+     * @since v0.5.0
+     */
+    function platform(): NodeJS.Platform;
+    /**
+     * Returns the operating system's default directory for temporary files as a
+     * string.
+     * @since v0.9.9
+     */
+    function tmpdir(): string;
+    /**
+     * Returns a string identifying the endianness of the CPU for which the Node.js
+     * binary was compiled.
+     *
+     * Possible values are `'BE'` for big endian and `'LE'` for little endian.
+     * @since v0.9.4
+     */
+    function endianness(): 'BE' | 'LE';
+    /**
+     * Returns the scheduling priority for the process specified by `pid`. If `pid` is
+     * not provided or is `0`, the priority of the current process is returned.
+     * @since v10.10.0
+     * @param [pid=0] The process ID to retrieve scheduling priority for.
+     */
+    function getPriority(pid?: number): number;
+    /**
+     * Attempts to set the scheduling priority for the process specified by `pid`. If`pid` is not provided or is `0`, the process ID of the current process is used.
+     *
+     * The `priority` input must be an integer between `-20` (high priority) and `19`(low priority). Due to differences between Unix priority levels and Windows
+     * priority classes, `priority` is mapped to one of six priority constants in`os.constants.priority`. When retrieving a process priority level, this range
+     * mapping may cause the return value to be slightly different on Windows. To avoid
+     * confusion, set `priority` to one of the priority constants.
+     *
+     * On Windows, setting priority to `PRIORITY_HIGHEST` requires elevated user
+     * privileges. Otherwise the set priority will be silently reduced to`PRIORITY_HIGH`.
+     * @since v10.10.0
+     * @param [pid=0] The process ID to set scheduling priority for.
+     * @param priority The scheduling priority to assign to the process.
+     */
+    function setPriority(priority: number): void;
+    function setPriority(pid: number, priority: number): void;
+}
+declare module 'node:os' {
+    export * from 'os';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/package.json b/node_modules/mathjs/examples/node_modules/@types/node/package.json
new file mode 100644
index 0000000..7662dff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/package.json
@@ -0,0 +1,220 @@
+{
+    "name": "@types/node",
+    "version": "17.0.23",
+    "description": "TypeScript definitions for Node.js",
+    "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/node",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "Microsoft TypeScript",
+            "url": "https://github.com/Microsoft",
+            "githubUsername": "Microsoft"
+        },
+        {
+            "name": "DefinitelyTyped",
+            "url": "https://github.com/DefinitelyTyped",
+            "githubUsername": "DefinitelyTyped"
+        },
+        {
+            "name": "Alberto Schiabel",
+            "url": "https://github.com/jkomyno",
+            "githubUsername": "jkomyno"
+        },
+        {
+            "name": "Alvis HT Tang",
+            "url": "https://github.com/alvis",
+            "githubUsername": "alvis"
+        },
+        {
+            "name": "Andrew Makarov",
+            "url": "https://github.com/r3nya",
+            "githubUsername": "r3nya"
+        },
+        {
+            "name": "Benjamin Toueg",
+            "url": "https://github.com/btoueg",
+            "githubUsername": "btoueg"
+        },
+        {
+            "name": "Chigozirim C.",
+            "url": "https://github.com/smac89",
+            "githubUsername": "smac89"
+        },
+        {
+            "name": "David Junger",
+            "url": "https://github.com/touffy",
+            "githubUsername": "touffy"
+        },
+        {
+            "name": "Deividas Bakanas",
+            "url": "https://github.com/DeividasBakanas",
+            "githubUsername": "DeividasBakanas"
+        },
+        {
+            "name": "Eugene Y. Q. Shen",
+            "url": "https://github.com/eyqs",
+            "githubUsername": "eyqs"
+        },
+        {
+            "name": "Hannes Magnusson",
+            "url": "https://github.com/Hannes-Magnusson-CK",
+            "githubUsername": "Hannes-Magnusson-CK"
+        },
+        {
+            "name": "Huw",
+            "url": "https://github.com/hoo29",
+            "githubUsername": "hoo29"
+        },
+        {
+            "name": "Kelvin Jin",
+            "url": "https://github.com/kjin",
+            "githubUsername": "kjin"
+        },
+        {
+            "name": "Klaus Meinhardt",
+            "url": "https://github.com/ajafff",
+            "githubUsername": "ajafff"
+        },
+        {
+            "name": "Lishude",
+            "url": "https://github.com/islishude",
+            "githubUsername": "islishude"
+        },
+        {
+            "name": "Mariusz Wiktorczyk",
+            "url": "https://github.com/mwiktorczyk",
+            "githubUsername": "mwiktorczyk"
+        },
+        {
+            "name": "Mohsen Azimi",
+            "url": "https://github.com/mohsen1",
+            "githubUsername": "mohsen1"
+        },
+        {
+            "name": "Nicolas Even",
+            "url": "https://github.com/n-e",
+            "githubUsername": "n-e"
+        },
+        {
+            "name": "Nikita Galkin",
+            "url": "https://github.com/galkin",
+            "githubUsername": "galkin"
+        },
+        {
+            "name": "Parambir Singh",
+            "url": "https://github.com/parambirs",
+            "githubUsername": "parambirs"
+        },
+        {
+            "name": "Sebastian Silbermann",
+            "url": "https://github.com/eps1lon",
+            "githubUsername": "eps1lon"
+        },
+        {
+            "name": "Simon Schick",
+            "url": "https://github.com/SimonSchick",
+            "githubUsername": "SimonSchick"
+        },
+        {
+            "name": "Thomas den Hollander",
+            "url": "https://github.com/ThomasdenH",
+            "githubUsername": "ThomasdenH"
+        },
+        {
+            "name": "Wilco Bakker",
+            "url": "https://github.com/WilcoBakker",
+            "githubUsername": "WilcoBakker"
+        },
+        {
+            "name": "wwwy3y3",
+            "url": "https://github.com/wwwy3y3",
+            "githubUsername": "wwwy3y3"
+        },
+        {
+            "name": "Samuel Ainsworth",
+            "url": "https://github.com/samuela",
+            "githubUsername": "samuela"
+        },
+        {
+            "name": "Kyle Uehlein",
+            "url": "https://github.com/kuehlein",
+            "githubUsername": "kuehlein"
+        },
+        {
+            "name": "Thanik Bhongbhibhat",
+            "url": "https://github.com/bhongy",
+            "githubUsername": "bhongy"
+        },
+        {
+            "name": "Marcin Kopacz",
+            "url": "https://github.com/chyzwar",
+            "githubUsername": "chyzwar"
+        },
+        {
+            "name": "Trivikram Kamat",
+            "url": "https://github.com/trivikr",
+            "githubUsername": "trivikr"
+        },
+        {
+            "name": "Junxiao Shi",
+            "url": "https://github.com/yoursunny",
+            "githubUsername": "yoursunny"
+        },
+        {
+            "name": "Ilia Baryshnikov",
+            "url": "https://github.com/qwelias",
+            "githubUsername": "qwelias"
+        },
+        {
+            "name": "ExE Boss",
+            "url": "https://github.com/ExE-Boss",
+            "githubUsername": "ExE-Boss"
+        },
+        {
+            "name": "Piotr Błażejewicz",
+            "url": "https://github.com/peterblazejewicz",
+            "githubUsername": "peterblazejewicz"
+        },
+        {
+            "name": "Anna Henningsen",
+            "url": "https://github.com/addaleax",
+            "githubUsername": "addaleax"
+        },
+        {
+            "name": "Victor Perin",
+            "url": "https://github.com/victorperin",
+            "githubUsername": "victorperin"
+        },
+        {
+            "name": "Yongsheng Zhang",
+            "url": "https://github.com/ZYSzys",
+            "githubUsername": "ZYSzys"
+        },
+        {
+            "name": "NodeJS Contributors",
+            "url": "https://github.com/NodeJS",
+            "githubUsername": "NodeJS"
+        },
+        {
+            "name": "Linus Unnebäck",
+            "url": "https://github.com/LinusU",
+            "githubUsername": "LinusU"
+        },
+        {
+            "name": "wafuwafu13",
+            "url": "https://github.com/wafuwafu13",
+            "githubUsername": "wafuwafu13"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/node"
+    },
+    "scripts": {},
+    "dependencies": {},
+    "typesPublisherContentHash": "31d9626c2d3ccc7c4b4e0d91e1ed56f52997cd7409e001330de7b00feb84ad8b",
+    "typeScriptVersion": "3.9"
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/path.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/path.d.ts
new file mode 100644
index 0000000..c19dce8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/path.d.ts
@@ -0,0 +1,180 @@
+declare module 'path/posix' {
+    import path = require('path');
+    export = path;
+}
+declare module 'path/win32' {
+    import path = require('path');
+    export = path;
+}
+/**
+ * The `path` module provides utilities for working with file and directory paths.
+ * It can be accessed using:
+ *
+ * ```js
+ * const path = require('path');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/path.js)
+ */
+declare module 'path' {
+    namespace path {
+        /**
+         * A parsed path object generated by path.parse() or consumed by path.format().
+         */
+        interface ParsedPath {
+            /**
+             * The root of the path such as '/' or 'c:\'
+             */
+            root: string;
+            /**
+             * The full directory path such as '/home/user/dir' or 'c:\path\dir'
+             */
+            dir: string;
+            /**
+             * The file name including extension (if any) such as 'index.html'
+             */
+            base: string;
+            /**
+             * The file extension (if any) such as '.html'
+             */
+            ext: string;
+            /**
+             * The file name without extension (if any) such as 'index'
+             */
+            name: string;
+        }
+        interface FormatInputPathObject {
+            /**
+             * The root of the path such as '/' or 'c:\'
+             */
+            root?: string | undefined;
+            /**
+             * The full directory path such as '/home/user/dir' or 'c:\path\dir'
+             */
+            dir?: string | undefined;
+            /**
+             * The file name including extension (if any) such as 'index.html'
+             */
+            base?: string | undefined;
+            /**
+             * The file extension (if any) such as '.html'
+             */
+            ext?: string | undefined;
+            /**
+             * The file name without extension (if any) such as 'index'
+             */
+            name?: string | undefined;
+        }
+        interface PlatformPath {
+            /**
+             * Normalize a string path, reducing '..' and '.' parts.
+             * When multiple slashes are found, they're replaced by a single one; when the path contains a trailing slash, it is preserved. On Windows backslashes are used.
+             *
+             * @param p string path to normalize.
+             */
+            normalize(p: string): string;
+            /**
+             * Join all arguments together and normalize the resulting path.
+             * Arguments must be strings. In v0.8, non-string arguments were silently ignored. In v0.10 and up, an exception is thrown.
+             *
+             * @param paths paths to join.
+             */
+            join(...paths: string[]): string;
+            /**
+             * The right-most parameter is considered {to}.  Other parameters are considered an array of {from}.
+             *
+             * Starting from leftmost {from} parameter, resolves {to} to an absolute path.
+             *
+             * If {to} isn't already absolute, {from} arguments are prepended in right to left order,
+             * until an absolute path is found. If after using all {from} paths still no absolute path is found,
+             * the current working directory is used as well. The resulting path is normalized,
+             * and trailing slashes are removed unless the path gets resolved to the root directory.
+             *
+             * @param pathSegments string paths to join.  Non-string arguments are ignored.
+             */
+            resolve(...pathSegments: string[]): string;
+            /**
+             * Determines whether {path} is an absolute path. An absolute path will always resolve to the same location, regardless of the working directory.
+             *
+             * @param path path to test.
+             */
+            isAbsolute(p: string): boolean;
+            /**
+             * Solve the relative path from {from} to {to}.
+             * At times we have two absolute paths, and we need to derive the relative path from one to the other. This is actually the reverse transform of path.resolve.
+             */
+            relative(from: string, to: string): string;
+            /**
+             * Return the directory name of a path. Similar to the Unix dirname command.
+             *
+             * @param p the path to evaluate.
+             */
+            dirname(p: string): string;
+            /**
+             * Return the last portion of a path. Similar to the Unix basename command.
+             * Often used to extract the file name from a fully qualified path.
+             *
+             * @param p the path to evaluate.
+             * @param ext optionally, an extension to remove from the result.
+             */
+            basename(p: string, ext?: string): string;
+            /**
+             * Return the extension of the path, from the last '.' to end of string in the last portion of the path.
+             * If there is no '.' in the last portion of the path or the first character of it is '.', then it returns an empty string
+             *
+             * @param p the path to evaluate.
+             */
+            extname(p: string): string;
+            /**
+             * The platform-specific file separator. '\\' or '/'.
+             */
+            readonly sep: string;
+            /**
+             * The platform-specific file delimiter. ';' or ':'.
+             */
+            readonly delimiter: string;
+            /**
+             * Returns an object from a path string - the opposite of format().
+             *
+             * @param pathString path to evaluate.
+             */
+            parse(p: string): ParsedPath;
+            /**
+             * Returns a path string from an object - the opposite of parse().
+             *
+             * @param pathString path to evaluate.
+             */
+            format(pP: FormatInputPathObject): string;
+            /**
+             * On Windows systems only, returns an equivalent namespace-prefixed path for the given path.
+             * If path is not a string, path will be returned without modifications.
+             * This method is meaningful only on Windows system.
+             * On POSIX systems, the method is non-operational and always returns path without modifications.
+             */
+            toNamespacedPath(path: string): string;
+            /**
+             * Posix specific pathing.
+             * Same as parent object on posix.
+             */
+            readonly posix: PlatformPath;
+            /**
+             * Windows specific pathing.
+             * Same as parent object on windows
+             */
+            readonly win32: PlatformPath;
+        }
+    }
+    const path: path.PlatformPath;
+    export = path;
+}
+declare module 'node:path' {
+    import path = require('path');
+    export = path;
+}
+declare module 'node:path/posix' {
+    import path = require('path/posix');
+    export = path;
+}
+declare module 'node:path/win32' {
+    import path = require('path/win32');
+    export = path;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/perf_hooks.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/perf_hooks.d.ts
new file mode 100644
index 0000000..7d1e0b3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/perf_hooks.d.ts
@@ -0,0 +1,557 @@
+/**
+ * This module provides an implementation of a subset of the W3C [Web Performance APIs](https://w3c.github.io/perf-timing-primer/) as well as additional APIs for
+ * Node.js-specific performance measurements.
+ *
+ * Node.js supports the following [Web Performance APIs](https://w3c.github.io/perf-timing-primer/):
+ *
+ * * [High Resolution Time](https://www.w3.org/TR/hr-time-2)
+ * * [Performance Timeline](https://w3c.github.io/performance-timeline/)
+ * * [User Timing](https://www.w3.org/TR/user-timing/)
+ *
+ * ```js
+ * const { PerformanceObserver, performance } = require('perf_hooks');
+ *
+ * const obs = new PerformanceObserver((items) => {
+ *   console.log(items.getEntries()[0].duration);
+ *   performance.clearMarks();
+ * });
+ * obs.observe({ type: 'measure' });
+ * performance.measure('Start to Now');
+ *
+ * performance.mark('A');
+ * doSomeLongRunningProcess(() => {
+ *   performance.measure('A to Now', 'A');
+ *
+ *   performance.mark('B');
+ *   performance.measure('A to B', 'A', 'B');
+ * });
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/perf_hooks.js)
+ */
+declare module 'perf_hooks' {
+    import { AsyncResource } from 'node:async_hooks';
+    type EntryType = 'node' | 'mark' | 'measure' | 'gc' | 'function' | 'http2' | 'http';
+    interface NodeGCPerformanceDetail {
+        /**
+         * When `performanceEntry.entryType` is equal to 'gc', `the performance.kind` property identifies
+         * the type of garbage collection operation that occurred.
+         * See perf_hooks.constants for valid values.
+         */
+        readonly kind?: number | undefined;
+        /**
+         * When `performanceEntry.entryType` is equal to 'gc', the `performance.flags`
+         * property contains additional information about garbage collection operation.
+         * See perf_hooks.constants for valid values.
+         */
+        readonly flags?: number | undefined;
+    }
+    /**
+     * @since v8.5.0
+     */
+    class PerformanceEntry {
+        protected constructor();
+        /**
+         * The total number of milliseconds elapsed for this entry. This value will not
+         * be meaningful for all Performance Entry types.
+         * @since v8.5.0
+         */
+        readonly duration: number;
+        /**
+         * The name of the performance entry.
+         * @since v8.5.0
+         */
+        readonly name: string;
+        /**
+         * The high resolution millisecond timestamp marking the starting time of the
+         * Performance Entry.
+         * @since v8.5.0
+         */
+        readonly startTime: number;
+        /**
+         * The type of the performance entry. It may be one of:
+         *
+         * * `'node'` (Node.js only)
+         * * `'mark'` (available on the Web)
+         * * `'measure'` (available on the Web)
+         * * `'gc'` (Node.js only)
+         * * `'function'` (Node.js only)
+         * * `'http2'` (Node.js only)
+         * * `'http'` (Node.js only)
+         * @since v8.5.0
+         */
+        readonly entryType: EntryType;
+        /**
+         * Additional detail specific to the `entryType`.
+         * @since v16.0.0
+         */
+        readonly detail?: NodeGCPerformanceDetail | unknown | undefined; // TODO: Narrow this based on entry type.
+    }
+    /**
+     * _This property is an extension by Node.js. It is not available in Web browsers._
+     *
+     * Provides timing details for Node.js itself. The constructor of this class
+     * is not exposed to users.
+     * @since v8.5.0
+     */
+    class PerformanceNodeTiming extends PerformanceEntry {
+        /**
+         * The high resolution millisecond timestamp at which the Node.js process
+         * completed bootstrapping. If bootstrapping has not yet finished, the property
+         * has the value of -1.
+         * @since v8.5.0
+         */
+        readonly bootstrapComplete: number;
+        /**
+         * The high resolution millisecond timestamp at which the Node.js environment was
+         * initialized.
+         * @since v8.5.0
+         */
+        readonly environment: number;
+        /**
+         * The high resolution millisecond timestamp of the amount of time the event loop
+         * has been idle within the event loop's event provider (e.g. `epoll_wait`). This
+         * does not take CPU usage into consideration. If the event loop has not yet
+         * started (e.g., in the first tick of the main script), the property has the
+         * value of 0.
+         * @since v14.10.0, v12.19.0
+         */
+        readonly idleTime: number;
+        /**
+         * The high resolution millisecond timestamp at which the Node.js event loop
+         * exited. If the event loop has not yet exited, the property has the value of -1\.
+         * It can only have a value of not -1 in a handler of the `'exit'` event.
+         * @since v8.5.0
+         */
+        readonly loopExit: number;
+        /**
+         * The high resolution millisecond timestamp at which the Node.js event loop
+         * started. If the event loop has not yet started (e.g., in the first tick of the
+         * main script), the property has the value of -1.
+         * @since v8.5.0
+         */
+        readonly loopStart: number;
+        /**
+         * The high resolution millisecond timestamp at which the V8 platform was
+         * initialized.
+         * @since v8.5.0
+         */
+        readonly v8Start: number;
+    }
+    interface EventLoopUtilization {
+        idle: number;
+        active: number;
+        utilization: number;
+    }
+    /**
+     * @param util1 The result of a previous call to eventLoopUtilization()
+     * @param util2 The result of a previous call to eventLoopUtilization() prior to util1
+     */
+    type EventLoopUtilityFunction = (util1?: EventLoopUtilization, util2?: EventLoopUtilization) => EventLoopUtilization;
+    interface MarkOptions {
+        /**
+         * Additional optional detail to include with the mark.
+         */
+        detail?: unknown | undefined;
+        /**
+         * An optional timestamp to be used as the mark time.
+         * @default `performance.now()`.
+         */
+        startTime?: number | undefined;
+    }
+    interface MeasureOptions {
+        /**
+         * Additional optional detail to include with the mark.
+         */
+        detail?: unknown | undefined;
+        /**
+         * Duration between start and end times.
+         */
+        duration?: number | undefined;
+        /**
+         * Timestamp to be used as the end time, or a string identifying a previously recorded mark.
+         */
+        end?: number | string | undefined;
+        /**
+         * Timestamp to be used as the start time, or a string identifying a previously recorded mark.
+         */
+        start?: number | string | undefined;
+    }
+    interface TimerifyOptions {
+        /**
+         * A histogram object created using
+         * `perf_hooks.createHistogram()` that will record runtime durations in
+         * nanoseconds.
+         */
+        histogram?: RecordableHistogram | undefined;
+    }
+    interface Performance {
+        /**
+         * If name is not provided, removes all PerformanceMark objects from the Performance Timeline.
+         * If name is provided, removes only the named mark.
+         * @param name
+         */
+        clearMarks(name?: string): void;
+        /**
+         * Creates a new PerformanceMark entry in the Performance Timeline.
+         * A PerformanceMark is a subclass of PerformanceEntry whose performanceEntry.entryType is always 'mark',
+         * and whose performanceEntry.duration is always 0.
+         * Performance marks are used to mark specific significant moments in the Performance Timeline.
+         * @param name
+         */
+        mark(name?: string, options?: MarkOptions): void;
+        /**
+         * Creates a new PerformanceMeasure entry in the Performance Timeline.
+         * A PerformanceMeasure is a subclass of PerformanceEntry whose performanceEntry.entryType is always 'measure',
+         * and whose performanceEntry.duration measures the number of milliseconds elapsed since startMark and endMark.
+         *
+         * The startMark argument may identify any existing PerformanceMark in the the Performance Timeline, or may identify
+         * any of the timestamp properties provided by the PerformanceNodeTiming class. If the named startMark does not exist,
+         * then startMark is set to timeOrigin by default.
+         *
+         * The endMark argument must identify any existing PerformanceMark in the the Performance Timeline or any of the timestamp
+         * properties provided by the PerformanceNodeTiming class. If the named endMark does not exist, an error will be thrown.
+         * @param name
+         * @param startMark
+         * @param endMark
+         */
+        measure(name: string, startMark?: string, endMark?: string): void;
+        measure(name: string, options: MeasureOptions): void;
+        /**
+         * An instance of the PerformanceNodeTiming class that provides performance metrics for specific Node.js operational milestones.
+         */
+        readonly nodeTiming: PerformanceNodeTiming;
+        /**
+         * @return the current high resolution millisecond timestamp
+         */
+        now(): number;
+        /**
+         * The timeOrigin specifies the high resolution millisecond timestamp from which all performance metric durations are measured.
+         */
+        readonly timeOrigin: number;
+        /**
+         * Wraps a function within a new function that measures the running time of the wrapped function.
+         * A PerformanceObserver must be subscribed to the 'function' event type in order for the timing details to be accessed.
+         * @param fn
+         */
+        timerify<T extends (...params: any[]) => any>(fn: T, options?: TimerifyOptions): T;
+        /**
+         * eventLoopUtilization is similar to CPU utilization except that it is calculated using high precision wall-clock time.
+         * It represents the percentage of time the event loop has spent outside the event loop's event provider (e.g. epoll_wait).
+         * No other CPU idle time is taken into consideration.
+         */
+        eventLoopUtilization: EventLoopUtilityFunction;
+    }
+    interface PerformanceObserverEntryList {
+        /**
+         * Returns a list of `PerformanceEntry` objects in chronological order
+         * with respect to `performanceEntry.startTime`.
+         *
+         * ```js
+         * const {
+         *   performance,
+         *   PerformanceObserver
+         * } = require('perf_hooks');
+         *
+         * const obs = new PerformanceObserver((perfObserverList, observer) => {
+         *   console.log(perfObserverList.getEntries());
+         *
+         *    * [
+         *    *   PerformanceEntry {
+         *    *     name: 'test',
+         *    *     entryType: 'mark',
+         *    *     startTime: 81.465639,
+         *    *     duration: 0
+         *    *   },
+         *    *   PerformanceEntry {
+         *    *     name: 'meow',
+         *    *     entryType: 'mark',
+         *    *     startTime: 81.860064,
+         *    *     duration: 0
+         *    *   }
+         *    * ]
+         *
+         *   observer.disconnect();
+         * });
+         * obs.observe({ type: 'mark' });
+         *
+         * performance.mark('test');
+         * performance.mark('meow');
+         * ```
+         * @since v8.5.0
+         */
+        getEntries(): PerformanceEntry[];
+        /**
+         * Returns a list of `PerformanceEntry` objects in chronological order
+         * with respect to `performanceEntry.startTime` whose `performanceEntry.name` is
+         * equal to `name`, and optionally, whose `performanceEntry.entryType` is equal to`type`.
+         *
+         * ```js
+         * const {
+         *   performance,
+         *   PerformanceObserver
+         * } = require('perf_hooks');
+         *
+         * const obs = new PerformanceObserver((perfObserverList, observer) => {
+         *   console.log(perfObserverList.getEntriesByName('meow'));
+         *
+         *    * [
+         *    *   PerformanceEntry {
+         *    *     name: 'meow',
+         *    *     entryType: 'mark',
+         *    *     startTime: 98.545991,
+         *    *     duration: 0
+         *    *   }
+         *    * ]
+         *
+         *   console.log(perfObserverList.getEntriesByName('nope')); // []
+         *
+         *   console.log(perfObserverList.getEntriesByName('test', 'mark'));
+         *
+         *    * [
+         *    *   PerformanceEntry {
+         *    *     name: 'test',
+         *    *     entryType: 'mark',
+         *    *     startTime: 63.518931,
+         *    *     duration: 0
+         *    *   }
+         *    * ]
+         *
+         *   console.log(perfObserverList.getEntriesByName('test', 'measure')); // []
+         *   observer.disconnect();
+         * });
+         * obs.observe({ entryTypes: ['mark', 'measure'] });
+         *
+         * performance.mark('test');
+         * performance.mark('meow');
+         * ```
+         * @since v8.5.0
+         */
+        getEntriesByName(name: string, type?: EntryType): PerformanceEntry[];
+        /**
+         * Returns a list of `PerformanceEntry` objects in chronological order
+         * with respect to `performanceEntry.startTime` whose `performanceEntry.entryType`is equal to `type`.
+         *
+         * ```js
+         * const {
+         *   performance,
+         *   PerformanceObserver
+         * } = require('perf_hooks');
+         *
+         * const obs = new PerformanceObserver((perfObserverList, observer) => {
+         *   console.log(perfObserverList.getEntriesByType('mark'));
+         *
+         *    * [
+         *    *   PerformanceEntry {
+         *    *     name: 'test',
+         *    *     entryType: 'mark',
+         *    *     startTime: 55.897834,
+         *    *     duration: 0
+         *    *   },
+         *    *   PerformanceEntry {
+         *    *     name: 'meow',
+         *    *     entryType: 'mark',
+         *    *     startTime: 56.350146,
+         *    *     duration: 0
+         *    *   }
+         *    * ]
+         *
+         *   observer.disconnect();
+         * });
+         * obs.observe({ type: 'mark' });
+         *
+         * performance.mark('test');
+         * performance.mark('meow');
+         * ```
+         * @since v8.5.0
+         */
+        getEntriesByType(type: EntryType): PerformanceEntry[];
+    }
+    type PerformanceObserverCallback = (list: PerformanceObserverEntryList, observer: PerformanceObserver) => void;
+    class PerformanceObserver extends AsyncResource {
+        constructor(callback: PerformanceObserverCallback);
+        /**
+         * Disconnects the `PerformanceObserver` instance from all notifications.
+         * @since v8.5.0
+         */
+        disconnect(): void;
+        /**
+         * Subscribes the `PerformanceObserver` instance to notifications of new `PerformanceEntry` instances identified either by `options.entryTypes`or `options.type`:
+         *
+         * ```js
+         * const {
+         *   performance,
+         *   PerformanceObserver
+         * } = require('perf_hooks');
+         *
+         * const obs = new PerformanceObserver((list, observer) => {
+         *   // Called three times synchronously. `list` contains one item.
+         * });
+         * obs.observe({ type: 'mark' });
+         *
+         * for (let n = 0; n < 3; n++)
+         *   performance.mark(`test${n}`);
+         * ```
+         * @since v8.5.0
+         */
+        observe(
+            options:
+                | {
+                      entryTypes: ReadonlyArray<EntryType>;
+                      buffered?: boolean | undefined;
+                  }
+                | {
+                      type: EntryType;
+                      buffered?: boolean | undefined;
+                  }
+        ): void;
+    }
+    namespace constants {
+        const NODE_PERFORMANCE_GC_MAJOR: number;
+        const NODE_PERFORMANCE_GC_MINOR: number;
+        const NODE_PERFORMANCE_GC_INCREMENTAL: number;
+        const NODE_PERFORMANCE_GC_WEAKCB: number;
+        const NODE_PERFORMANCE_GC_FLAGS_NO: number;
+        const NODE_PERFORMANCE_GC_FLAGS_CONSTRUCT_RETAINED: number;
+        const NODE_PERFORMANCE_GC_FLAGS_FORCED: number;
+        const NODE_PERFORMANCE_GC_FLAGS_SYNCHRONOUS_PHANTOM_PROCESSING: number;
+        const NODE_PERFORMANCE_GC_FLAGS_ALL_AVAILABLE_GARBAGE: number;
+        const NODE_PERFORMANCE_GC_FLAGS_ALL_EXTERNAL_MEMORY: number;
+        const NODE_PERFORMANCE_GC_FLAGS_SCHEDULE_IDLE: number;
+    }
+    const performance: Performance;
+    interface EventLoopMonitorOptions {
+        /**
+         * The sampling rate in milliseconds.
+         * Must be greater than zero.
+         * @default 10
+         */
+        resolution?: number | undefined;
+    }
+    interface Histogram {
+        /**
+         * Returns a `Map` object detailing the accumulated percentile distribution.
+         * @since v11.10.0
+         */
+        readonly percentiles: Map<number, number>;
+        /**
+         * The number of times the event loop delay exceeded the maximum 1 hour event
+         * loop delay threshold.
+         * @since v11.10.0
+         */
+        readonly exceeds: number;
+        /**
+         * The minimum recorded event loop delay.
+         * @since v11.10.0
+         */
+        readonly min: number;
+        /**
+         * The maximum recorded event loop delay.
+         * @since v11.10.0
+         */
+        readonly max: number;
+        /**
+         * The mean of the recorded event loop delays.
+         * @since v11.10.0
+         */
+        readonly mean: number;
+        /**
+         * The standard deviation of the recorded event loop delays.
+         * @since v11.10.0
+         */
+        readonly stddev: number;
+        /**
+         * Resets the collected histogram data.
+         * @since v11.10.0
+         */
+        reset(): void;
+        /**
+         * Returns the value at the given percentile.
+         * @since v11.10.0
+         * @param percentile A percentile value in the range (0, 100].
+         */
+        percentile(percentile: number): number;
+    }
+    interface IntervalHistogram extends Histogram {
+        /**
+         * Enables the update interval timer. Returns `true` if the timer was
+         * started, `false` if it was already started.
+         * @since v11.10.0
+         */
+        enable(): boolean;
+        /**
+         * Disables the update interval timer. Returns `true` if the timer was
+         * stopped, `false` if it was already stopped.
+         * @since v11.10.0
+         */
+        disable(): boolean;
+    }
+    interface RecordableHistogram extends Histogram {
+        /**
+         * @since v15.9.0, v14.18.0
+         * @param val The amount to record in the histogram.
+         */
+        record(val: number | bigint): void;
+        /**
+         * Calculates the amount of time (in nanoseconds) that has passed since the
+         * previous call to `recordDelta()` and records that amount in the histogram.
+         *
+         * ## Examples
+         * @since v15.9.0, v14.18.0
+         */
+        recordDelta(): void;
+    }
+    /**
+     * _This property is an extension by Node.js. It is not available in Web browsers._
+     *
+     * Creates an `IntervalHistogram` object that samples and reports the event loop
+     * delay over time. The delays will be reported in nanoseconds.
+     *
+     * Using a timer to detect approximate event loop delay works because the
+     * execution of timers is tied specifically to the lifecycle of the libuv
+     * event loop. That is, a delay in the loop will cause a delay in the execution
+     * of the timer, and those delays are specifically what this API is intended to
+     * detect.
+     *
+     * ```js
+     * const { monitorEventLoopDelay } = require('perf_hooks');
+     * const h = monitorEventLoopDelay({ resolution: 20 });
+     * h.enable();
+     * // Do something.
+     * h.disable();
+     * console.log(h.min);
+     * console.log(h.max);
+     * console.log(h.mean);
+     * console.log(h.stddev);
+     * console.log(h.percentiles);
+     * console.log(h.percentile(50));
+     * console.log(h.percentile(99));
+     * ```
+     * @since v11.10.0
+     */
+    function monitorEventLoopDelay(options?: EventLoopMonitorOptions): IntervalHistogram;
+    interface CreateHistogramOptions {
+        /**
+         * The minimum recordable value. Must be an integer value greater than 0.
+         * @default 1
+         */
+        min?: number | bigint | undefined;
+        /**
+         * The maximum recordable value. Must be an integer value greater than min.
+         * @default Number.MAX_SAFE_INTEGER
+         */
+        max?: number | bigint | undefined;
+        /**
+         * The number of accuracy digits. Must be a number between 1 and 5.
+         * @default 3
+         */
+        figures?: number | undefined;
+    }
+    /**
+     * Returns a `RecordableHistogram`.
+     * @since v15.9.0, v14.18.0
+     */
+    function createHistogram(options?: CreateHistogramOptions): RecordableHistogram;
+}
+declare module 'node:perf_hooks' {
+    export * from 'perf_hooks';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/process.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/process.d.ts
new file mode 100644
index 0000000..24bbfba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/process.d.ts
@@ -0,0 +1,1481 @@
+declare module 'process' {
+    import * as tty from 'node:tty';
+    import { Worker } from 'node:worker_threads';
+    global {
+        var process: NodeJS.Process;
+        namespace NodeJS {
+            // this namespace merge is here because these are specifically used
+            // as the type for process.stdin, process.stdout, and process.stderr.
+            // they can't live in tty.d.ts because we need to disambiguate the imported name.
+            interface ReadStream extends tty.ReadStream {}
+            interface WriteStream extends tty.WriteStream {}
+            interface MemoryUsageFn {
+                /**
+                 * The `process.memoryUsage()` method iterate over each page to gather informations about memory
+                 * usage which can be slow depending on the program memory allocations.
+                 */
+                (): MemoryUsage;
+                /**
+                 * method returns an integer representing the Resident Set Size (RSS) in bytes.
+                 */
+                rss(): number;
+            }
+            interface MemoryUsage {
+                rss: number;
+                heapTotal: number;
+                heapUsed: number;
+                external: number;
+                arrayBuffers: number;
+            }
+            interface CpuUsage {
+                user: number;
+                system: number;
+            }
+            interface ProcessRelease {
+                name: string;
+                sourceUrl?: string | undefined;
+                headersUrl?: string | undefined;
+                libUrl?: string | undefined;
+                lts?: string | undefined;
+            }
+            interface ProcessVersions extends Dict<string> {
+                http_parser: string;
+                node: string;
+                v8: string;
+                ares: string;
+                uv: string;
+                zlib: string;
+                modules: string;
+                openssl: string;
+            }
+            type Platform = 'aix' | 'android' | 'darwin' | 'freebsd' | 'haiku' | 'linux' | 'openbsd' | 'sunos' | 'win32' | 'cygwin' | 'netbsd';
+            type Signals =
+                | 'SIGABRT'
+                | 'SIGALRM'
+                | 'SIGBUS'
+                | 'SIGCHLD'
+                | 'SIGCONT'
+                | 'SIGFPE'
+                | 'SIGHUP'
+                | 'SIGILL'
+                | 'SIGINT'
+                | 'SIGIO'
+                | 'SIGIOT'
+                | 'SIGKILL'
+                | 'SIGPIPE'
+                | 'SIGPOLL'
+                | 'SIGPROF'
+                | 'SIGPWR'
+                | 'SIGQUIT'
+                | 'SIGSEGV'
+                | 'SIGSTKFLT'
+                | 'SIGSTOP'
+                | 'SIGSYS'
+                | 'SIGTERM'
+                | 'SIGTRAP'
+                | 'SIGTSTP'
+                | 'SIGTTIN'
+                | 'SIGTTOU'
+                | 'SIGUNUSED'
+                | 'SIGURG'
+                | 'SIGUSR1'
+                | 'SIGUSR2'
+                | 'SIGVTALRM'
+                | 'SIGWINCH'
+                | 'SIGXCPU'
+                | 'SIGXFSZ'
+                | 'SIGBREAK'
+                | 'SIGLOST'
+                | 'SIGINFO';
+            type UncaughtExceptionOrigin = 'uncaughtException' | 'unhandledRejection';
+            type MultipleResolveType = 'resolve' | 'reject';
+            type BeforeExitListener = (code: number) => void;
+            type DisconnectListener = () => void;
+            type ExitListener = (code: number) => void;
+            type RejectionHandledListener = (promise: Promise<unknown>) => void;
+            type UncaughtExceptionListener = (error: Error, origin: UncaughtExceptionOrigin) => void;
+            /**
+             * Most of the time the unhandledRejection will be an Error, but this should not be relied upon
+             * as *anything* can be thrown/rejected, it is therefore unsafe to assume the the value is an Error.
+             */
+            type UnhandledRejectionListener = (reason: unknown, promise: Promise<unknown>) => void;
+            type WarningListener = (warning: Error) => void;
+            type MessageListener = (message: unknown, sendHandle: unknown) => void;
+            type SignalsListener = (signal: Signals) => void;
+            type MultipleResolveListener = (type: MultipleResolveType, promise: Promise<unknown>, value: unknown) => void;
+            type WorkerListener = (worker: Worker) => void;
+            interface Socket extends ReadWriteStream {
+                isTTY?: true | undefined;
+            }
+            // Alias for compatibility
+            interface ProcessEnv extends Dict<string> {
+                /**
+                 * Can be used to change the default timezone at runtime
+                 */
+                TZ?: string;
+            }
+            interface HRTime {
+                (time?: [number, number]): [number, number];
+                bigint(): bigint;
+            }
+            interface ProcessReport {
+                /**
+                 * Directory where the report is written.
+                 * working directory of the Node.js process.
+                 * @default '' indicating that reports are written to the current
+                 */
+                directory: string;
+                /**
+                 * Filename where the report is written.
+                 * The default value is the empty string.
+                 * @default '' the output filename will be comprised of a timestamp,
+                 * PID, and sequence number.
+                 */
+                filename: string;
+                /**
+                 * Returns a JSON-formatted diagnostic report for the running process.
+                 * The report's JavaScript stack trace is taken from err, if present.
+                 */
+                getReport(err?: Error): string;
+                /**
+                 * If true, a diagnostic report is generated on fatal errors,
+                 * such as out of memory errors or failed C++ assertions.
+                 * @default false
+                 */
+                reportOnFatalError: boolean;
+                /**
+                 * If true, a diagnostic report is generated when the process
+                 * receives the signal specified by process.report.signal.
+                 * @default false
+                 */
+                reportOnSignal: boolean;
+                /**
+                 * If true, a diagnostic report is generated on uncaught exception.
+                 * @default false
+                 */
+                reportOnUncaughtException: boolean;
+                /**
+                 * The signal used to trigger the creation of a diagnostic report.
+                 * @default 'SIGUSR2'
+                 */
+                signal: Signals;
+                /**
+                 * Writes a diagnostic report to a file. If filename is not provided, the default filename
+                 * includes the date, time, PID, and a sequence number.
+                 * The report's JavaScript stack trace is taken from err, if present.
+                 *
+                 * @param fileName Name of the file where the report is written.
+                 * This should be a relative path, that will be appended to the directory specified in
+                 * `process.report.directory`, or the current working directory of the Node.js process,
+                 * if unspecified.
+                 * @param error A custom error used for reporting the JavaScript stack.
+                 * @return Filename of the generated report.
+                 */
+                writeReport(fileName?: string): string;
+                writeReport(error?: Error): string;
+                writeReport(fileName?: string, err?: Error): string;
+            }
+            interface ResourceUsage {
+                fsRead: number;
+                fsWrite: number;
+                involuntaryContextSwitches: number;
+                ipcReceived: number;
+                ipcSent: number;
+                majorPageFault: number;
+                maxRSS: number;
+                minorPageFault: number;
+                sharedMemorySize: number;
+                signalsCount: number;
+                swappedOut: number;
+                systemCPUTime: number;
+                unsharedDataSize: number;
+                unsharedStackSize: number;
+                userCPUTime: number;
+                voluntaryContextSwitches: number;
+            }
+            interface EmitWarningOptions {
+                /**
+                 * When `warning` is a `string`, `type` is the name to use for the _type_ of warning being emitted.
+                 *
+                 * @default 'Warning'
+                 */
+                type?: string | undefined;
+                /**
+                 * A unique identifier for the warning instance being emitted.
+                 */
+                code?: string | undefined;
+                /**
+                 * When `warning` is a `string`, `ctor` is an optional function used to limit the generated stack trace.
+                 *
+                 * @default process.emitWarning
+                 */
+                ctor?: Function | undefined;
+                /**
+                 * Additional text to include with the error.
+                 */
+                detail?: string | undefined;
+            }
+            interface ProcessConfig {
+                readonly target_defaults: {
+                    readonly cflags: any[];
+                    readonly default_configuration: string;
+                    readonly defines: string[];
+                    readonly include_dirs: string[];
+                    readonly libraries: string[];
+                };
+                readonly variables: {
+                    readonly clang: number;
+                    readonly host_arch: string;
+                    readonly node_install_npm: boolean;
+                    readonly node_install_waf: boolean;
+                    readonly node_prefix: string;
+                    readonly node_shared_openssl: boolean;
+                    readonly node_shared_v8: boolean;
+                    readonly node_shared_zlib: boolean;
+                    readonly node_use_dtrace: boolean;
+                    readonly node_use_etw: boolean;
+                    readonly node_use_openssl: boolean;
+                    readonly target_arch: string;
+                    readonly v8_no_strict_aliasing: number;
+                    readonly v8_use_snapshot: boolean;
+                    readonly visibility: string;
+                };
+            }
+            interface Process extends EventEmitter {
+                /**
+                 * The `process.stdout` property returns a stream connected to`stdout` (fd `1`). It is a `net.Socket` (which is a `Duplex` stream) unless fd `1` refers to a file, in which case it is
+                 * a `Writable` stream.
+                 *
+                 * For example, to copy `process.stdin` to `process.stdout`:
+                 *
+                 * ```js
+                 * import { stdin, stdout } from 'process';
+                 *
+                 * stdin.pipe(stdout);
+                 * ```
+                 *
+                 * `process.stdout` differs from other Node.js streams in important ways. See `note on process I/O` for more information.
+                 */
+                stdout: WriteStream & {
+                    fd: 1;
+                };
+                /**
+                 * The `process.stderr` property returns a stream connected to`stderr` (fd `2`). It is a `net.Socket` (which is a `Duplex` stream) unless fd `2` refers to a file, in which case it is
+                 * a `Writable` stream.
+                 *
+                 * `process.stderr` differs from other Node.js streams in important ways. See `note on process I/O` for more information.
+                 */
+                stderr: WriteStream & {
+                    fd: 2;
+                };
+                /**
+                 * The `process.stdin` property returns a stream connected to`stdin` (fd `0`). It is a `net.Socket` (which is a `Duplex` stream) unless fd `0` refers to a file, in which case it is
+                 * a `Readable` stream.
+                 *
+                 * For details of how to read from `stdin` see `readable.read()`.
+                 *
+                 * As a `Duplex` stream, `process.stdin` can also be used in "old" mode that
+                 * is compatible with scripts written for Node.js prior to v0.10\.
+                 * For more information see `Stream compatibility`.
+                 *
+                 * In "old" streams mode the `stdin` stream is paused by default, so one
+                 * must call `process.stdin.resume()` to read from it. Note also that calling`process.stdin.resume()` itself would switch stream to "old" mode.
+                 */
+                stdin: ReadStream & {
+                    fd: 0;
+                };
+                openStdin(): Socket;
+                /**
+                 * The `process.argv` property returns an array containing the command-line
+                 * arguments passed when the Node.js process was launched. The first element will
+                 * be {@link execPath}. See `process.argv0` if access to the original value
+                 * of `argv[0]` is needed. The second element will be the path to the JavaScript
+                 * file being executed. The remaining elements will be any additional command-line
+                 * arguments.
+                 *
+                 * For example, assuming the following script for `process-args.js`:
+                 *
+                 * ```js
+                 * import { argv } from 'process';
+                 *
+                 * // print process.argv
+                 * argv.forEach((val, index) => {
+                 *   console.log(`${index}: ${val}`);
+                 * });
+                 * ```
+                 *
+                 * Launching the Node.js process as:
+                 *
+                 * ```console
+                 * $ node process-args.js one two=three four
+                 * ```
+                 *
+                 * Would generate the output:
+                 *
+                 * ```text
+                 * 0: /usr/local/bin/node
+                 * 1: /Users/mjr/work/node/process-args.js
+                 * 2: one
+                 * 3: two=three
+                 * 4: four
+                 * ```
+                 * @since v0.1.27
+                 */
+                argv: string[];
+                /**
+                 * The `process.argv0` property stores a read-only copy of the original value of`argv[0]` passed when Node.js starts.
+                 *
+                 * ```console
+                 * $ bash -c 'exec -a customArgv0 ./node'
+                 * > process.argv[0]
+                 * '/Volumes/code/external/node/out/Release/node'
+                 * > process.argv0
+                 * 'customArgv0'
+                 * ```
+                 * @since v6.4.0
+                 */
+                argv0: string;
+                /**
+                 * The `process.execArgv` property returns the set of Node.js-specific command-line
+                 * options passed when the Node.js process was launched. These options do not
+                 * appear in the array returned by the {@link argv} property, and do not
+                 * include the Node.js executable, the name of the script, or any options following
+                 * the script name. These options are useful in order to spawn child processes with
+                 * the same execution environment as the parent.
+                 *
+                 * ```console
+                 * $ node --harmony script.js --version
+                 * ```
+                 *
+                 * Results in `process.execArgv`:
+                 *
+                 * ```js
+                 * ['--harmony']
+                 * ```
+                 *
+                 * And `process.argv`:
+                 *
+                 * ```js
+                 * ['/usr/local/bin/node', 'script.js', '--version']
+                 * ```
+                 *
+                 * Refer to `Worker constructor` for the detailed behavior of worker
+                 * threads with this property.
+                 * @since v0.7.7
+                 */
+                execArgv: string[];
+                /**
+                 * The `process.execPath` property returns the absolute pathname of the executable
+                 * that started the Node.js process. Symbolic links, if any, are resolved.
+                 *
+                 * ```js
+                 * '/usr/local/bin/node'
+                 * ```
+                 * @since v0.1.100
+                 */
+                execPath: string;
+                /**
+                 * The `process.abort()` method causes the Node.js process to exit immediately and
+                 * generate a core file.
+                 *
+                 * This feature is not available in `Worker` threads.
+                 * @since v0.7.0
+                 */
+                abort(): never;
+                /**
+                 * The `process.chdir()` method changes the current working directory of the
+                 * Node.js process or throws an exception if doing so fails (for instance, if
+                 * the specified `directory` does not exist).
+                 *
+                 * ```js
+                 * import { chdir, cwd } from 'process';
+                 *
+                 * console.log(`Starting directory: ${cwd()}`);
+                 * try {
+                 *   chdir('/tmp');
+                 *   console.log(`New directory: ${cwd()}`);
+                 * } catch (err) {
+                 *   console.error(`chdir: ${err}`);
+                 * }
+                 * ```
+                 *
+                 * This feature is not available in `Worker` threads.
+                 * @since v0.1.17
+                 */
+                chdir(directory: string): void;
+                /**
+                 * The `process.cwd()` method returns the current working directory of the Node.js
+                 * process.
+                 *
+                 * ```js
+                 * import { cwd } from 'process';
+                 *
+                 * console.log(`Current directory: ${cwd()}`);
+                 * ```
+                 * @since v0.1.8
+                 */
+                cwd(): string;
+                /**
+                 * The port used by the Node.js debugger when enabled.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * process.debugPort = 5858;
+                 * ```
+                 * @since v0.7.2
+                 */
+                debugPort: number;
+                /**
+                 * The `process.emitWarning()` method can be used to emit custom or application
+                 * specific process warnings. These can be listened for by adding a handler to the `'warning'` event.
+                 *
+                 * ```js
+                 * import { emitWarning } from 'process';
+                 *
+                 * // Emit a warning with a code and additional detail.
+                 * emitWarning('Something happened!', {
+                 *   code: 'MY_WARNING',
+                 *   detail: 'This is some additional information'
+                 * });
+                 * // Emits:
+                 * // (node:56338) [MY_WARNING] Warning: Something happened!
+                 * // This is some additional information
+                 * ```
+                 *
+                 * In this example, an `Error` object is generated internally by`process.emitWarning()` and passed through to the `'warning'` handler.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * process.on('warning', (warning) => {
+                 *   console.warn(warning.name);    // 'Warning'
+                 *   console.warn(warning.message); // 'Something happened!'
+                 *   console.warn(warning.code);    // 'MY_WARNING'
+                 *   console.warn(warning.stack);   // Stack trace
+                 *   console.warn(warning.detail);  // 'This is some additional information'
+                 * });
+                 * ```
+                 *
+                 * If `warning` is passed as an `Error` object, the `options` argument is ignored.
+                 * @since v8.0.0
+                 * @param warning The warning to emit.
+                 */
+                emitWarning(warning: string | Error, ctor?: Function): void;
+                emitWarning(warning: string | Error, type?: string, ctor?: Function): void;
+                emitWarning(warning: string | Error, type?: string, code?: string, ctor?: Function): void;
+                emitWarning(warning: string | Error, options?: EmitWarningOptions): void;
+                /**
+                 * The `process.env` property returns an object containing the user environment.
+                 * See [`environ(7)`](http://man7.org/linux/man-pages/man7/environ.7.html).
+                 *
+                 * An example of this object looks like:
+                 *
+                 * ```js
+                 * {
+                 *   TERM: 'xterm-256color',
+                 *   SHELL: '/usr/local/bin/bash',
+                 *   USER: 'maciej',
+                 *   PATH: '~/.bin/:/usr/bin:/bin:/usr/sbin:/sbin:/usr/local/bin',
+                 *   PWD: '/Users/maciej',
+                 *   EDITOR: 'vim',
+                 *   SHLVL: '1',
+                 *   HOME: '/Users/maciej',
+                 *   LOGNAME: 'maciej',
+                 *   _: '/usr/local/bin/node'
+                 * }
+                 * ```
+                 *
+                 * It is possible to modify this object, but such modifications will not be
+                 * reflected outside the Node.js process, or (unless explicitly requested)
+                 * to other `Worker` threads.
+                 * In other words, the following example would not work:
+                 *
+                 * ```console
+                 * $ node -e 'process.env.foo = "bar"' &#x26;&#x26; echo $foo
+                 * ```
+                 *
+                 * While the following will:
+                 *
+                 * ```js
+                 * import { env } from 'process';
+                 *
+                 * env.foo = 'bar';
+                 * console.log(env.foo);
+                 * ```
+                 *
+                 * Assigning a property on `process.env` will implicitly convert the value
+                 * to a string. **This behavior is deprecated.** Future versions of Node.js may
+                 * throw an error when the value is not a string, number, or boolean.
+                 *
+                 * ```js
+                 * import { env } from 'process';
+                 *
+                 * env.test = null;
+                 * console.log(env.test);
+                 * // => 'null'
+                 * env.test = undefined;
+                 * console.log(env.test);
+                 * // => 'undefined'
+                 * ```
+                 *
+                 * Use `delete` to delete a property from `process.env`.
+                 *
+                 * ```js
+                 * import { env } from 'process';
+                 *
+                 * env.TEST = 1;
+                 * delete env.TEST;
+                 * console.log(env.TEST);
+                 * // => undefined
+                 * ```
+                 *
+                 * On Windows operating systems, environment variables are case-insensitive.
+                 *
+                 * ```js
+                 * import { env } from 'process';
+                 *
+                 * env.TEST = 1;
+                 * console.log(env.test);
+                 * // => 1
+                 * ```
+                 *
+                 * Unless explicitly specified when creating a `Worker` instance,
+                 * each `Worker` thread has its own copy of `process.env`, based on its
+                 * parent thread’s `process.env`, or whatever was specified as the `env` option
+                 * to the `Worker` constructor. Changes to `process.env` will not be visible
+                 * across `Worker` threads, and only the main thread can make changes that
+                 * are visible to the operating system or to native add-ons.
+                 * @since v0.1.27
+                 */
+                env: ProcessEnv;
+                /**
+                 * The `process.exit()` method instructs Node.js to terminate the process
+                 * synchronously with an exit status of `code`. If `code` is omitted, exit uses
+                 * either the 'success' code `0` or the value of `process.exitCode` if it has been
+                 * set. Node.js will not terminate until all the `'exit'` event listeners are
+                 * called.
+                 *
+                 * To exit with a 'failure' code:
+                 *
+                 * ```js
+                 * import { exit } from 'process';
+                 *
+                 * exit(1);
+                 * ```
+                 *
+                 * The shell that executed Node.js should see the exit code as `1`.
+                 *
+                 * Calling `process.exit()` will force the process to exit as quickly as possible
+                 * even if there are still asynchronous operations pending that have not yet
+                 * completed fully, including I/O operations to `process.stdout` and`process.stderr`.
+                 *
+                 * In most situations, it is not actually necessary to call `process.exit()`explicitly. The Node.js process will exit on its own _if there is no additional_
+                 * _work pending_ in the event loop. The `process.exitCode` property can be set to
+                 * tell the process which exit code to use when the process exits gracefully.
+                 *
+                 * For instance, the following example illustrates a _misuse_ of the`process.exit()` method that could lead to data printed to stdout being
+                 * truncated and lost:
+                 *
+                 * ```js
+                 * import { exit } from 'process';
+                 *
+                 * // This is an example of what *not* to do:
+                 * if (someConditionNotMet()) {
+                 *   printUsageToStdout();
+                 *   exit(1);
+                 * }
+                 * ```
+                 *
+                 * The reason this is problematic is because writes to `process.stdout` in Node.js
+                 * are sometimes _asynchronous_ and may occur over multiple ticks of the Node.js
+                 * event loop. Calling `process.exit()`, however, forces the process to exit_before_ those additional writes to `stdout` can be performed.
+                 *
+                 * Rather than calling `process.exit()` directly, the code _should_ set the`process.exitCode` and allow the process to exit naturally by avoiding
+                 * scheduling any additional work for the event loop:
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * // How to properly set the exit code while letting
+                 * // the process exit gracefully.
+                 * if (someConditionNotMet()) {
+                 *   printUsageToStdout();
+                 *   process.exitCode = 1;
+                 * }
+                 * ```
+                 *
+                 * If it is necessary to terminate the Node.js process due to an error condition,
+                 * throwing an _uncaught_ error and allowing the process to terminate accordingly
+                 * is safer than calling `process.exit()`.
+                 *
+                 * In `Worker` threads, this function stops the current thread rather
+                 * than the current process.
+                 * @since v0.1.13
+                 * @param [code=0] The exit code.
+                 */
+                exit(code?: number): never;
+                /**
+                 * A number which will be the process exit code, when the process either
+                 * exits gracefully, or is exited via {@link exit} without specifying
+                 * a code.
+                 *
+                 * Specifying a code to {@link exit} will override any
+                 * previous setting of `process.exitCode`.
+                 * @since v0.11.8
+                 */
+                exitCode?: number | undefined;
+                /**
+                 * The `process.getgid()` method returns the numerical group identity of the
+                 * process. (See [`getgid(2)`](http://man7.org/linux/man-pages/man2/getgid.2.html).)
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getgid) {
+                 *   console.log(`Current gid: ${process.getgid()}`);
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * @since v0.1.31
+                 */
+                getgid(): number;
+                /**
+                 * The `process.setgid()` method sets the group identity of the process. (See [`setgid(2)`](http://man7.org/linux/man-pages/man2/setgid.2.html).) The `id` can be passed as either a
+                 * numeric ID or a group name
+                 * string. If a group name is specified, this method blocks while resolving the
+                 * associated numeric ID.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getgid &#x26;&#x26; process.setgid) {
+                 *   console.log(`Current gid: ${process.getgid()}`);
+                 *   try {
+                 *     process.setgid(501);
+                 *     console.log(`New gid: ${process.getgid()}`);
+                 *   } catch (err) {
+                 *     console.log(`Failed to set gid: ${err}`);
+                 *   }
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * This feature is not available in `Worker` threads.
+                 * @since v0.1.31
+                 * @param id The group name or ID
+                 */
+                setgid(id: number | string): void;
+                /**
+                 * The `process.getuid()` method returns the numeric user identity of the process.
+                 * (See [`getuid(2)`](http://man7.org/linux/man-pages/man2/getuid.2.html).)
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getuid) {
+                 *   console.log(`Current uid: ${process.getuid()}`);
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * @since v0.1.28
+                 */
+                getuid(): number;
+                /**
+                 * The `process.setuid(id)` method sets the user identity of the process. (See [`setuid(2)`](http://man7.org/linux/man-pages/man2/setuid.2.html).) The `id` can be passed as either a
+                 * numeric ID or a username string.
+                 * If a username is specified, the method blocks while resolving the associated
+                 * numeric ID.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getuid &#x26;&#x26; process.setuid) {
+                 *   console.log(`Current uid: ${process.getuid()}`);
+                 *   try {
+                 *     process.setuid(501);
+                 *     console.log(`New uid: ${process.getuid()}`);
+                 *   } catch (err) {
+                 *     console.log(`Failed to set uid: ${err}`);
+                 *   }
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * This feature is not available in `Worker` threads.
+                 * @since v0.1.28
+                 */
+                setuid(id: number | string): void;
+                /**
+                 * The `process.geteuid()` method returns the numerical effective user identity of
+                 * the process. (See [`geteuid(2)`](http://man7.org/linux/man-pages/man2/geteuid.2.html).)
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.geteuid) {
+                 *   console.log(`Current uid: ${process.geteuid()}`);
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * @since v2.0.0
+                 */
+                geteuid(): number;
+                /**
+                 * The `process.seteuid()` method sets the effective user identity of the process.
+                 * (See [`seteuid(2)`](http://man7.org/linux/man-pages/man2/seteuid.2.html).) The `id` can be passed as either a numeric ID or a username
+                 * string. If a username is specified, the method blocks while resolving the
+                 * associated numeric ID.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.geteuid &#x26;&#x26; process.seteuid) {
+                 *   console.log(`Current uid: ${process.geteuid()}`);
+                 *   try {
+                 *     process.seteuid(501);
+                 *     console.log(`New uid: ${process.geteuid()}`);
+                 *   } catch (err) {
+                 *     console.log(`Failed to set uid: ${err}`);
+                 *   }
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * This feature is not available in `Worker` threads.
+                 * @since v2.0.0
+                 * @param id A user name or ID
+                 */
+                seteuid(id: number | string): void;
+                /**
+                 * The `process.getegid()` method returns the numerical effective group identity
+                 * of the Node.js process. (See [`getegid(2)`](http://man7.org/linux/man-pages/man2/getegid.2.html).)
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getegid) {
+                 *   console.log(`Current gid: ${process.getegid()}`);
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * @since v2.0.0
+                 */
+                getegid(): number;
+                /**
+                 * The `process.setegid()` method sets the effective group identity of the process.
+                 * (See [`setegid(2)`](http://man7.org/linux/man-pages/man2/setegid.2.html).) The `id` can be passed as either a numeric ID or a group
+                 * name string. If a group name is specified, this method blocks while resolving
+                 * the associated a numeric ID.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getegid &#x26;&#x26; process.setegid) {
+                 *   console.log(`Current gid: ${process.getegid()}`);
+                 *   try {
+                 *     process.setegid(501);
+                 *     console.log(`New gid: ${process.getegid()}`);
+                 *   } catch (err) {
+                 *     console.log(`Failed to set gid: ${err}`);
+                 *   }
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * This feature is not available in `Worker` threads.
+                 * @since v2.0.0
+                 * @param id A group name or ID
+                 */
+                setegid(id: number | string): void;
+                /**
+                 * The `process.getgroups()` method returns an array with the supplementary group
+                 * IDs. POSIX leaves it unspecified if the effective group ID is included but
+                 * Node.js ensures it always is.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getgroups) {
+                 *   console.log(process.getgroups()); // [ 16, 21, 297 ]
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * @since v0.9.4
+                 */
+                getgroups(): number[];
+                /**
+                 * The `process.setgroups()` method sets the supplementary group IDs for the
+                 * Node.js process. This is a privileged operation that requires the Node.js
+                 * process to have `root` or the `CAP_SETGID` capability.
+                 *
+                 * The `groups` array can contain numeric group IDs, group names, or both.
+                 *
+                 * ```js
+                 * import process from 'process';
+                 *
+                 * if (process.getgroups &#x26;&#x26; process.setgroups) {
+                 *   try {
+                 *     process.setgroups([501]);
+                 *     console.log(process.getgroups()); // new groups
+                 *   } catch (err) {
+                 *     console.log(`Failed to set groups: ${err}`);
+                 *   }
+                 * }
+                 * ```
+                 *
+                 * This function is only available on POSIX platforms (i.e. not Windows or
+                 * Android).
+                 * This feature is not available in `Worker` threads.
+                 * @since v0.9.4
+                 */
+                setgroups(groups: ReadonlyArray<string | number>): void;
+                /**
+                 * The `process.setUncaughtExceptionCaptureCallback()` function sets a function
+                 * that will be invoked when an uncaught exception occurs, which will receive the
+                 * exception value itself as its first argument.
+                 *
+                 * If such a function is set, the `'uncaughtException'` event will
+                 * not be emitted. If `--abort-on-uncaught-exception` was passed from the
+                 * command line or set through `v8.setFlagsFromString()`, the process will
+                 * not abort. Actions configured to take place on exceptions such as report
+                 * generations will be affected too
+                 *
+                 * To unset the capture function,`process.setUncaughtExceptionCaptureCallback(null)` may be used. Calling this
+                 * method with a non-`null` argument while another capture function is set will
+                 * throw an error.
+                 *
+                 * Using this function is mutually exclusive with using the deprecated `domain` built-in module.
+                 * @since v9.3.0
+                 */
+                setUncaughtExceptionCaptureCallback(cb: ((err: Error) => void) | null): void;
+                /**
+                 * Indicates whether a callback has been set using {@link setUncaughtExceptionCaptureCallback}.
+                 * @since v9.3.0
+                 */
+                hasUncaughtExceptionCaptureCallback(): boolean;
+                /**
+                 * The `process.version` property contains the Node.js version string.
+                 *
+                 * ```js
+                 * import { version } from 'process';
+                 *
+                 * console.log(`Version: ${version}`);
+                 * // Version: v14.8.0
+                 * ```
+                 *
+                 * To get the version string without the prepended _v_, use`process.versions.node`.
+                 * @since v0.1.3
+                 */
+                readonly version: string;
+                /**
+                 * The `process.versions` property returns an object listing the version strings of
+                 * Node.js and its dependencies. `process.versions.modules` indicates the current
+                 * ABI version, which is increased whenever a C++ API changes. Node.js will refuse
+                 * to load modules that were compiled against a different module ABI version.
+                 *
+                 * ```js
+                 * import { versions } from 'process';
+                 *
+                 * console.log(versions);
+                 * ```
+                 *
+                 * Will generate an object similar to:
+                 *
+                 * ```console
+                 * { node: '11.13.0',
+                 *   v8: '7.0.276.38-node.18',
+                 *   uv: '1.27.0',
+                 *   zlib: '1.2.11',
+                 *   brotli: '1.0.7',
+                 *   ares: '1.15.0',
+                 *   modules: '67',
+                 *   nghttp2: '1.34.0',
+                 *   napi: '4',
+                 *   llhttp: '1.1.1',
+                 *   openssl: '1.1.1b',
+                 *   cldr: '34.0',
+                 *   icu: '63.1',
+                 *   tz: '2018e',
+                 *   unicode: '11.0' }
+                 * ```
+                 * @since v0.2.0
+                 */
+                readonly versions: ProcessVersions;
+                /**
+                 * The `process.config` property returns an `Object` containing the JavaScript
+                 * representation of the configure options used to compile the current Node.js
+                 * executable. This is the same as the `config.gypi` file that was produced when
+                 * running the `./configure` script.
+                 *
+                 * An example of the possible output looks like:
+                 *
+                 * ```js
+                 * {
+                 *   target_defaults:
+                 *    { cflags: [],
+                 *      default_configuration: 'Release',
+                 *      defines: [],
+                 *      include_dirs: [],
+                 *      libraries: [] },
+                 *   variables:
+                 *    {
+                 *      host_arch: 'x64',
+                 *      napi_build_version: 5,
+                 *      node_install_npm: 'true',
+                 *      node_prefix: '',
+                 *      node_shared_cares: 'false',
+                 *      node_shared_http_parser: 'false',
+                 *      node_shared_libuv: 'false',
+                 *      node_shared_zlib: 'false',
+                 *      node_use_dtrace: 'false',
+                 *      node_use_openssl: 'true',
+                 *      node_shared_openssl: 'false',
+                 *      strict_aliasing: 'true',
+                 *      target_arch: 'x64',
+                 *      v8_use_snapshot: 1
+                 *    }
+                 * }
+                 * ```
+                 *
+                 * The `process.config` property is **not** read-only and there are existing
+                 * modules in the ecosystem that are known to extend, modify, or entirely replace
+                 * the value of `process.config`.
+                 *
+                 * Modifying the `process.config` property, or any child-property of the`process.config` object has been deprecated. The `process.config` will be made
+                 * read-only in a future release.
+                 * @since v0.7.7
+                 */
+                readonly config: ProcessConfig;
+                /**
+                 * The `process.kill()` method sends the `signal` to the process identified by`pid`.
+                 *
+                 * Signal names are strings such as `'SIGINT'` or `'SIGHUP'`. See `Signal Events` and [`kill(2)`](http://man7.org/linux/man-pages/man2/kill.2.html) for more information.
+                 *
+                 * This method will throw an error if the target `pid` does not exist. As a special
+                 * case, a signal of `0` can be used to test for the existence of a process.
+                 * Windows platforms will throw an error if the `pid` is used to kill a process
+                 * group.
+                 *
+                 * Even though the name of this function is `process.kill()`, it is really just a
+                 * signal sender, like the `kill` system call. The signal sent may do something
+                 * other than kill the target process.
+                 *
+                 * ```js
+                 * import process, { kill } from 'process';
+                 *
+                 * process.on('SIGHUP', () => {
+                 *   console.log('Got SIGHUP signal.');
+                 * });
+                 *
+                 * setTimeout(() => {
+                 *   console.log('Exiting.');
+                 *   process.exit(0);
+                 * }, 100);
+                 *
+                 * kill(process.pid, 'SIGHUP');
+                 * ```
+                 *
+                 * When `SIGUSR1` is received by a Node.js process, Node.js will start the
+                 * debugger. See `Signal Events`.
+                 * @since v0.0.6
+                 * @param pid A process ID
+                 * @param [signal='SIGTERM'] The signal to send, either as a string or number.
+                 */
+                kill(pid: number, signal?: string | number): true;
+                /**
+                 * The `process.pid` property returns the PID of the process.
+                 *
+                 * ```js
+                 * import { pid } from 'process';
+                 *
+                 * console.log(`This process is pid ${pid}`);
+                 * ```
+                 * @since v0.1.15
+                 */
+                readonly pid: number;
+                /**
+                 * The `process.ppid` property returns the PID of the parent of the
+                 * current process.
+                 *
+                 * ```js
+                 * import { ppid } from 'process';
+                 *
+                 * console.log(`The parent process is pid ${ppid}`);
+                 * ```
+                 * @since v9.2.0, v8.10.0, v6.13.0
+                 */
+                readonly ppid: number;
+                /**
+                 * The `process.title` property returns the current process title (i.e. returns
+                 * the current value of `ps`). Assigning a new value to `process.title` modifies
+                 * the current value of `ps`.
+                 *
+                 * When a new value is assigned, different platforms will impose different maximum
+                 * length restrictions on the title. Usually such restrictions are quite limited.
+                 * For instance, on Linux and macOS, `process.title` is limited to the size of the
+                 * binary name plus the length of the command-line arguments because setting the`process.title` overwrites the `argv` memory of the process. Node.js v0.8
+                 * allowed for longer process title strings by also overwriting the `environ`memory but that was potentially insecure and confusing in some (rather obscure)
+                 * cases.
+                 *
+                 * Assigning a value to `process.title` might not result in an accurate label
+                 * within process manager applications such as macOS Activity Monitor or Windows
+                 * Services Manager.
+                 * @since v0.1.104
+                 */
+                title: string;
+                /**
+                 * The operating system CPU architecture for which the Node.js binary was compiled.
+                 * Possible values are: `'arm'`, `'arm64'`, `'ia32'`, `'mips'`,`'mipsel'`, `'ppc'`,`'ppc64'`, `'s390'`, `'s390x'`, `'x32'`, and `'x64'`.
+                 *
+                 * ```js
+                 * import { arch } from 'process';
+                 *
+                 * console.log(`This processor architecture is ${arch}`);
+                 * ```
+                 * @since v0.5.0
+                 */
+                readonly arch: string;
+                /**
+                 * The `process.platform` property returns a string identifying the operating
+                 * system platform on which the Node.js process is running.
+                 *
+                 * Currently possible values are:
+                 *
+                 * * `'aix'`
+                 * * `'darwin'`
+                 * * `'freebsd'`
+                 * * `'linux'`
+                 * * `'openbsd'`
+                 * * `'sunos'`
+                 * * `'win32'`
+                 *
+                 * ```js
+                 * import { platform } from 'process';
+                 *
+                 * console.log(`This platform is ${platform}`);
+                 * ```
+                 *
+                 * The value `'android'` may also be returned if the Node.js is built on the
+                 * Android operating system. However, Android support in Node.js [is experimental](https://github.com/nodejs/node/blob/HEAD/BUILDING.md#androidandroid-based-devices-eg-firefox-os).
+                 * @since v0.1.16
+                 */
+                readonly platform: Platform;
+                /**
+                 * The `process.mainModule` property provides an alternative way of retrieving `require.main`. The difference is that if the main module changes at
+                 * runtime, `require.main` may still refer to the original main module in
+                 * modules that were required before the change occurred. Generally, it's
+                 * safe to assume that the two refer to the same module.
+                 *
+                 * As with `require.main`, `process.mainModule` will be `undefined` if there
+                 * is no entry script.
+                 * @since v0.1.17
+                 * @deprecated Since v14.0.0 - Use `main` instead.
+                 */
+                mainModule?: Module | undefined;
+                memoryUsage: MemoryUsageFn;
+                /**
+                 * The `process.cpuUsage()` method returns the user and system CPU time usage of
+                 * the current process, in an object with properties `user` and `system`, whose
+                 * values are microsecond values (millionth of a second). These values measure time
+                 * spent in user and system code respectively, and may end up being greater than
+                 * actual elapsed time if multiple CPU cores are performing work for this process.
+                 *
+                 * The result of a previous call to `process.cpuUsage()` can be passed as the
+                 * argument to the function, to get a diff reading.
+                 *
+                 * ```js
+                 * import { cpuUsage } from 'process';
+                 *
+                 * const startUsage = cpuUsage();
+                 * // { user: 38579, system: 6986 }
+                 *
+                 * // spin the CPU for 500 milliseconds
+                 * const now = Date.now();
+                 * while (Date.now() - now < 500);
+                 *
+                 * console.log(cpuUsage(startUsage));
+                 * // { user: 514883, system: 11226 }
+                 * ```
+                 * @since v6.1.0
+                 * @param previousValue A previous return value from calling `process.cpuUsage()`
+                 */
+                cpuUsage(previousValue?: CpuUsage): CpuUsage;
+                /**
+                 * `process.nextTick()` adds `callback` to the "next tick queue". This queue is
+                 * fully drained after the current operation on the JavaScript stack runs to
+                 * completion and before the event loop is allowed to continue. It's possible to
+                 * create an infinite loop if one were to recursively call `process.nextTick()`.
+                 * See the [Event Loop](https://nodejs.org/en/docs/guides/event-loop-timers-and-nexttick/#process-nexttick) guide for more background.
+                 *
+                 * ```js
+                 * import { nextTick } from 'process';
+                 *
+                 * console.log('start');
+                 * nextTick(() => {
+                 *   console.log('nextTick callback');
+                 * });
+                 * console.log('scheduled');
+                 * // Output:
+                 * // start
+                 * // scheduled
+                 * // nextTick callback
+                 * ```
+                 *
+                 * This is important when developing APIs in order to give users the opportunity
+                 * to assign event handlers _after_ an object has been constructed but before any
+                 * I/O has occurred:
+                 *
+                 * ```js
+                 * import { nextTick } from 'process';
+                 *
+                 * function MyThing(options) {
+                 *   this.setupOptions(options);
+                 *
+                 *   nextTick(() => {
+                 *     this.startDoingStuff();
+                 *   });
+                 * }
+                 *
+                 * const thing = new MyThing();
+                 * thing.getReadyForStuff();
+                 *
+                 * // thing.startDoingStuff() gets called now, not before.
+                 * ```
+                 *
+                 * It is very important for APIs to be either 100% synchronous or 100%
+                 * asynchronous. Consider this example:
+                 *
+                 * ```js
+                 * // WARNING!  DO NOT USE!  BAD UNSAFE HAZARD!
+                 * function maybeSync(arg, cb) {
+                 *   if (arg) {
+                 *     cb();
+                 *     return;
+                 *   }
+                 *
+                 *   fs.stat('file', cb);
+                 * }
+                 * ```
+                 *
+                 * This API is hazardous because in the following case:
+                 *
+                 * ```js
+                 * const maybeTrue = Math.random() > 0.5;
+                 *
+                 * maybeSync(maybeTrue, () => {
+                 *   foo();
+                 * });
+                 *
+                 * bar();
+                 * ```
+                 *
+                 * It is not clear whether `foo()` or `bar()` will be called first.
+                 *
+                 * The following approach is much better:
+                 *
+                 * ```js
+                 * import { nextTick } from 'process';
+                 *
+                 * function definitelyAsync(arg, cb) {
+                 *   if (arg) {
+                 *     nextTick(cb);
+                 *     return;
+                 *   }
+                 *
+                 *   fs.stat('file', cb);
+                 * }
+                 * ```
+                 * @since v0.1.26
+                 * @param args Additional arguments to pass when invoking the `callback`
+                 */
+                nextTick(callback: Function, ...args: any[]): void;
+                /**
+                 * The `process.release` property returns an `Object` containing metadata related
+                 * to the current release, including URLs for the source tarball and headers-only
+                 * tarball.
+                 *
+                 * `process.release` contains the following properties:
+                 *
+                 * ```js
+                 * {
+                 *   name: 'node',
+                 *   lts: 'Erbium',
+                 *   sourceUrl: 'https://nodejs.org/download/release/v12.18.1/node-v12.18.1.tar.gz',
+                 *   headersUrl: 'https://nodejs.org/download/release/v12.18.1/node-v12.18.1-headers.tar.gz',
+                 *   libUrl: 'https://nodejs.org/download/release/v12.18.1/win-x64/node.lib'
+                 * }
+                 * ```
+                 *
+                 * In custom builds from non-release versions of the source tree, only the`name` property may be present. The additional properties should not be
+                 * relied upon to exist.
+                 * @since v3.0.0
+                 */
+                readonly release: ProcessRelease;
+                features: {
+                    inspector: boolean;
+                    debug: boolean;
+                    uv: boolean;
+                    ipv6: boolean;
+                    tls_alpn: boolean;
+                    tls_sni: boolean;
+                    tls_ocsp: boolean;
+                    tls: boolean;
+                };
+                /**
+                 * `process.umask()` returns the Node.js process's file mode creation mask. Child
+                 * processes inherit the mask from the parent process.
+                 * @since v0.1.19
+                 * @deprecated Calling `process.umask()` with no argument causes the process-wide umask to be written twice. This introduces a race condition between threads, and is a potential   *
+                 * security vulnerability. There is no safe, cross-platform alternative API.
+                 */
+                umask(): number;
+                /**
+                 * Can only be set if not in worker thread.
+                 */
+                umask(mask: string | number): number;
+                /**
+                 * The `process.uptime()` method returns the number of seconds the current Node.js
+                 * process has been running.
+                 *
+                 * The return value includes fractions of a second. Use `Math.floor()` to get whole
+                 * seconds.
+                 * @since v0.5.0
+                 */
+                uptime(): number;
+                hrtime: HRTime;
+                /**
+                 * If Node.js is spawned with an IPC channel, the `process.send()` method can be
+                 * used to send messages to the parent process. Messages will be received as a `'message'` event on the parent's `ChildProcess` object.
+                 *
+                 * If Node.js was not spawned with an IPC channel, `process.send` will be`undefined`.
+                 *
+                 * The message goes through serialization and parsing. The resulting message might
+                 * not be the same as what is originally sent.
+                 * @since v0.5.9
+                 * @param options used to parameterize the sending of certain types of handles.`options` supports the following properties:
+                 */
+                send?(
+                    message: any,
+                    sendHandle?: any,
+                    options?: {
+                        swallowErrors?: boolean | undefined;
+                    },
+                    callback?: (error: Error | null) => void
+                ): boolean;
+                /**
+                 * If the Node.js process is spawned with an IPC channel (see the `Child Process` and `Cluster` documentation), the `process.disconnect()` method will close the
+                 * IPC channel to the parent process, allowing the child process to exit gracefully
+                 * once there are no other connections keeping it alive.
+                 *
+                 * The effect of calling `process.disconnect()` is the same as calling `ChildProcess.disconnect()` from the parent process.
+                 *
+                 * If the Node.js process was not spawned with an IPC channel,`process.disconnect()` will be `undefined`.
+                 * @since v0.7.2
+                 */
+                disconnect(): void;
+                /**
+                 * If the Node.js process is spawned with an IPC channel (see the `Child Process` and `Cluster` documentation), the `process.connected` property will return`true` so long as the IPC
+                 * channel is connected and will return `false` after`process.disconnect()` is called.
+                 *
+                 * Once `process.connected` is `false`, it is no longer possible to send messages
+                 * over the IPC channel using `process.send()`.
+                 * @since v0.7.2
+                 */
+                connected: boolean;
+                /**
+                 * The `process.allowedNodeEnvironmentFlags` property is a special,
+                 * read-only `Set` of flags allowable within the `NODE_OPTIONS` environment variable.
+                 *
+                 * `process.allowedNodeEnvironmentFlags` extends `Set`, but overrides`Set.prototype.has` to recognize several different possible flag
+                 * representations. `process.allowedNodeEnvironmentFlags.has()` will
+                 * return `true` in the following cases:
+                 *
+                 * * Flags may omit leading single (`-`) or double (`--`) dashes; e.g.,`inspect-brk` for `--inspect-brk`, or `r` for `-r`.
+                 * * Flags passed through to V8 (as listed in `--v8-options`) may replace
+                 * one or more _non-leading_ dashes for an underscore, or vice-versa;
+                 * e.g., `--perf_basic_prof`, `--perf-basic-prof`, `--perf_basic-prof`,
+                 * etc.
+                 * * Flags may contain one or more equals (`=`) characters; all
+                 * characters after and including the first equals will be ignored;
+                 * e.g., `--stack-trace-limit=100`.
+                 * * Flags _must_ be allowable within `NODE_OPTIONS`.
+                 *
+                 * When iterating over `process.allowedNodeEnvironmentFlags`, flags will
+                 * appear only _once_; each will begin with one or more dashes. Flags
+                 * passed through to V8 will contain underscores instead of non-leading
+                 * dashes:
+                 *
+                 * ```js
+                 * import { allowedNodeEnvironmentFlags } from 'process';
+                 *
+                 * allowedNodeEnvironmentFlags.forEach((flag) => {
+                 *   // -r
+                 *   // --inspect-brk
+                 *   // --abort_on_uncaught_exception
+                 *   // ...
+                 * });
+                 * ```
+                 *
+                 * The methods `add()`, `clear()`, and `delete()` of`process.allowedNodeEnvironmentFlags` do nothing, and will fail
+                 * silently.
+                 *
+                 * If Node.js was compiled _without_ `NODE_OPTIONS` support (shown in {@link config}), `process.allowedNodeEnvironmentFlags` will
+                 * contain what _would have_ been allowable.
+                 * @since v10.10.0
+                 */
+                allowedNodeEnvironmentFlags: ReadonlySet<string>;
+                /**
+                 * `process.report` is an object whose methods are used to generate diagnostic
+                 * reports for the current process. Additional documentation is available in the `report documentation`.
+                 * @since v11.8.0
+                 */
+                report?: ProcessReport | undefined;
+                /**
+                 * ```js
+                 * import { resourceUsage } from 'process';
+                 *
+                 * console.log(resourceUsage());
+                 * /*
+                 *   Will output:
+                 *   {
+                 *     userCPUTime: 82872,
+                 *     systemCPUTime: 4143,
+                 *     maxRSS: 33164,
+                 *     sharedMemorySize: 0,
+                 *     unsharedDataSize: 0,
+                 *     unsharedStackSize: 0,
+                 *     minorPageFault: 2469,
+                 *     majorPageFault: 0,
+                 *     swappedOut: 0,
+                 *     fsRead: 0,
+                 *     fsWrite: 8,
+                 *     ipcSent: 0,
+                 *     ipcReceived: 0,
+                 *     signalsCount: 0,
+                 *     voluntaryContextSwitches: 79,
+                 *     involuntaryContextSwitches: 1
+                 *   }
+                 *
+                 * ```
+                 * @since v12.6.0
+                 * @return the resource usage for the current process. All of these values come from the `uv_getrusage` call which returns a [`uv_rusage_t` struct][uv_rusage_t].
+                 */
+                resourceUsage(): ResourceUsage;
+                /**
+                 * The `process.traceDeprecation` property indicates whether the`--trace-deprecation` flag is set on the current Node.js process. See the
+                 * documentation for the `'warning' event` and the `emitWarning() method` for more information about this
+                 * flag's behavior.
+                 * @since v0.8.0
+                 */
+                traceDeprecation: boolean;
+                /* EventEmitter */
+                addListener(event: 'beforeExit', listener: BeforeExitListener): this;
+                addListener(event: 'disconnect', listener: DisconnectListener): this;
+                addListener(event: 'exit', listener: ExitListener): this;
+                addListener(event: 'rejectionHandled', listener: RejectionHandledListener): this;
+                addListener(event: 'uncaughtException', listener: UncaughtExceptionListener): this;
+                addListener(event: 'uncaughtExceptionMonitor', listener: UncaughtExceptionListener): this;
+                addListener(event: 'unhandledRejection', listener: UnhandledRejectionListener): this;
+                addListener(event: 'warning', listener: WarningListener): this;
+                addListener(event: 'message', listener: MessageListener): this;
+                addListener(event: Signals, listener: SignalsListener): this;
+                addListener(event: 'multipleResolves', listener: MultipleResolveListener): this;
+                addListener(event: 'worker', listener: WorkerListener): this;
+                emit(event: 'beforeExit', code: number): boolean;
+                emit(event: 'disconnect'): boolean;
+                emit(event: 'exit', code: number): boolean;
+                emit(event: 'rejectionHandled', promise: Promise<unknown>): boolean;
+                emit(event: 'uncaughtException', error: Error): boolean;
+                emit(event: 'uncaughtExceptionMonitor', error: Error): boolean;
+                emit(event: 'unhandledRejection', reason: unknown, promise: Promise<unknown>): boolean;
+                emit(event: 'warning', warning: Error): boolean;
+                emit(event: 'message', message: unknown, sendHandle: unknown): this;
+                emit(event: Signals, signal?: Signals): boolean;
+                emit(event: 'multipleResolves', type: MultipleResolveType, promise: Promise<unknown>, value: unknown): this;
+                emit(event: 'worker', listener: WorkerListener): this;
+                on(event: 'beforeExit', listener: BeforeExitListener): this;
+                on(event: 'disconnect', listener: DisconnectListener): this;
+                on(event: 'exit', listener: ExitListener): this;
+                on(event: 'rejectionHandled', listener: RejectionHandledListener): this;
+                on(event: 'uncaughtException', listener: UncaughtExceptionListener): this;
+                on(event: 'uncaughtExceptionMonitor', listener: UncaughtExceptionListener): this;
+                on(event: 'unhandledRejection', listener: UnhandledRejectionListener): this;
+                on(event: 'warning', listener: WarningListener): this;
+                on(event: 'message', listener: MessageListener): this;
+                on(event: Signals, listener: SignalsListener): this;
+                on(event: 'multipleResolves', listener: MultipleResolveListener): this;
+                on(event: 'worker', listener: WorkerListener): this;
+                on(event: string | symbol, listener: (...args: any[]) => void): this;
+                once(event: 'beforeExit', listener: BeforeExitListener): this;
+                once(event: 'disconnect', listener: DisconnectListener): this;
+                once(event: 'exit', listener: ExitListener): this;
+                once(event: 'rejectionHandled', listener: RejectionHandledListener): this;
+                once(event: 'uncaughtException', listener: UncaughtExceptionListener): this;
+                once(event: 'uncaughtExceptionMonitor', listener: UncaughtExceptionListener): this;
+                once(event: 'unhandledRejection', listener: UnhandledRejectionListener): this;
+                once(event: 'warning', listener: WarningListener): this;
+                once(event: 'message', listener: MessageListener): this;
+                once(event: Signals, listener: SignalsListener): this;
+                once(event: 'multipleResolves', listener: MultipleResolveListener): this;
+                once(event: 'worker', listener: WorkerListener): this;
+                once(event: string | symbol, listener: (...args: any[]) => void): this;
+                prependListener(event: 'beforeExit', listener: BeforeExitListener): this;
+                prependListener(event: 'disconnect', listener: DisconnectListener): this;
+                prependListener(event: 'exit', listener: ExitListener): this;
+                prependListener(event: 'rejectionHandled', listener: RejectionHandledListener): this;
+                prependListener(event: 'uncaughtException', listener: UncaughtExceptionListener): this;
+                prependListener(event: 'uncaughtExceptionMonitor', listener: UncaughtExceptionListener): this;
+                prependListener(event: 'unhandledRejection', listener: UnhandledRejectionListener): this;
+                prependListener(event: 'warning', listener: WarningListener): this;
+                prependListener(event: 'message', listener: MessageListener): this;
+                prependListener(event: Signals, listener: SignalsListener): this;
+                prependListener(event: 'multipleResolves', listener: MultipleResolveListener): this;
+                prependListener(event: 'worker', listener: WorkerListener): this;
+                prependOnceListener(event: 'beforeExit', listener: BeforeExitListener): this;
+                prependOnceListener(event: 'disconnect', listener: DisconnectListener): this;
+                prependOnceListener(event: 'exit', listener: ExitListener): this;
+                prependOnceListener(event: 'rejectionHandled', listener: RejectionHandledListener): this;
+                prependOnceListener(event: 'uncaughtException', listener: UncaughtExceptionListener): this;
+                prependOnceListener(event: 'uncaughtExceptionMonitor', listener: UncaughtExceptionListener): this;
+                prependOnceListener(event: 'unhandledRejection', listener: UnhandledRejectionListener): this;
+                prependOnceListener(event: 'warning', listener: WarningListener): this;
+                prependOnceListener(event: 'message', listener: MessageListener): this;
+                prependOnceListener(event: Signals, listener: SignalsListener): this;
+                prependOnceListener(event: 'multipleResolves', listener: MultipleResolveListener): this;
+                prependOnceListener(event: 'worker', listener: WorkerListener): this;
+                listeners(event: 'beforeExit'): BeforeExitListener[];
+                listeners(event: 'disconnect'): DisconnectListener[];
+                listeners(event: 'exit'): ExitListener[];
+                listeners(event: 'rejectionHandled'): RejectionHandledListener[];
+                listeners(event: 'uncaughtException'): UncaughtExceptionListener[];
+                listeners(event: 'uncaughtExceptionMonitor'): UncaughtExceptionListener[];
+                listeners(event: 'unhandledRejection'): UnhandledRejectionListener[];
+                listeners(event: 'warning'): WarningListener[];
+                listeners(event: 'message'): MessageListener[];
+                listeners(event: Signals): SignalsListener[];
+                listeners(event: 'multipleResolves'): MultipleResolveListener[];
+                listeners(event: 'worker'): WorkerListener[];
+            }
+        }
+    }
+    export = process;
+}
+declare module 'node:process' {
+    import process = require('process');
+    export = process;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/punycode.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/punycode.d.ts
new file mode 100644
index 0000000..81b3c63
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/punycode.d.ts
@@ -0,0 +1,117 @@
+/**
+ * **The version of the punycode module bundled in Node.js is being deprecated.**In a future major version of Node.js this module will be removed. Users
+ * currently depending on the `punycode` module should switch to using the
+ * userland-provided [Punycode.js](https://github.com/bestiejs/punycode.js) module instead. For punycode-based URL
+ * encoding, see `url.domainToASCII` or, more generally, the `WHATWG URL API`.
+ *
+ * The `punycode` module is a bundled version of the [Punycode.js](https://github.com/bestiejs/punycode.js) module. It
+ * can be accessed using:
+ *
+ * ```js
+ * const punycode = require('punycode');
+ * ```
+ *
+ * [Punycode](https://tools.ietf.org/html/rfc3492) is a character encoding scheme defined by RFC 3492 that is
+ * primarily intended for use in Internationalized Domain Names. Because host
+ * names in URLs are limited to ASCII characters only, Domain Names that contain
+ * non-ASCII characters must be converted into ASCII using the Punycode scheme.
+ * For instance, the Japanese character that translates into the English word,`'example'` is `'例'`. The Internationalized Domain Name, `'例.com'` (equivalent
+ * to `'example.com'`) is represented by Punycode as the ASCII string`'xn--fsq.com'`.
+ *
+ * The `punycode` module provides a simple implementation of the Punycode standard.
+ *
+ * The `punycode` module is a third-party dependency used by Node.js and
+ * made available to developers as a convenience. Fixes or other modifications to
+ * the module must be directed to the [Punycode.js](https://github.com/bestiejs/punycode.js) project.
+ * @deprecated Since v7.0.0 - Deprecated
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/punycode.js)
+ */
+declare module 'punycode' {
+    /**
+     * The `punycode.decode()` method converts a [Punycode](https://tools.ietf.org/html/rfc3492) string of ASCII-only
+     * characters to the equivalent string of Unicode codepoints.
+     *
+     * ```js
+     * punycode.decode('maana-pta'); // 'mañana'
+     * punycode.decode('--dqo34k'); // '☃-⌘'
+     * ```
+     * @since v0.5.1
+     */
+    function decode(string: string): string;
+    /**
+     * The `punycode.encode()` method converts a string of Unicode codepoints to a [Punycode](https://tools.ietf.org/html/rfc3492) string of ASCII-only characters.
+     *
+     * ```js
+     * punycode.encode('mañana'); // 'maana-pta'
+     * punycode.encode('☃-⌘'); // '--dqo34k'
+     * ```
+     * @since v0.5.1
+     */
+    function encode(string: string): string;
+    /**
+     * The `punycode.toUnicode()` method converts a string representing a domain name
+     * containing [Punycode](https://tools.ietf.org/html/rfc3492) encoded characters into Unicode. Only the [Punycode](https://tools.ietf.org/html/rfc3492) encoded parts of the domain name are be
+     * converted.
+     *
+     * ```js
+     * // decode domain names
+     * punycode.toUnicode('xn--maana-pta.com'); // 'mañana.com'
+     * punycode.toUnicode('xn----dqo34k.com');  // '☃-⌘.com'
+     * punycode.toUnicode('example.com');       // 'example.com'
+     * ```
+     * @since v0.6.1
+     */
+    function toUnicode(domain: string): string;
+    /**
+     * The `punycode.toASCII()` method converts a Unicode string representing an
+     * Internationalized Domain Name to [Punycode](https://tools.ietf.org/html/rfc3492). Only the non-ASCII parts of the
+     * domain name will be converted. Calling `punycode.toASCII()` on a string that
+     * already only contains ASCII characters will have no effect.
+     *
+     * ```js
+     * // encode domain names
+     * punycode.toASCII('mañana.com');  // 'xn--maana-pta.com'
+     * punycode.toASCII('☃-⌘.com');   // 'xn----dqo34k.com'
+     * punycode.toASCII('example.com'); // 'example.com'
+     * ```
+     * @since v0.6.1
+     */
+    function toASCII(domain: string): string;
+    /**
+     * @deprecated since v7.0.0
+     * The version of the punycode module bundled in Node.js is being deprecated.
+     * In a future major version of Node.js this module will be removed.
+     * Users currently depending on the punycode module should switch to using
+     * the userland-provided Punycode.js module instead.
+     */
+    const ucs2: ucs2;
+    interface ucs2 {
+        /**
+         * @deprecated since v7.0.0
+         * The version of the punycode module bundled in Node.js is being deprecated.
+         * In a future major version of Node.js this module will be removed.
+         * Users currently depending on the punycode module should switch to using
+         * the userland-provided Punycode.js module instead.
+         */
+        decode(string: string): number[];
+        /**
+         * @deprecated since v7.0.0
+         * The version of the punycode module bundled in Node.js is being deprecated.
+         * In a future major version of Node.js this module will be removed.
+         * Users currently depending on the punycode module should switch to using
+         * the userland-provided Punycode.js module instead.
+         */
+        encode(codePoints: ReadonlyArray<number>): string;
+    }
+    /**
+     * @deprecated since v7.0.0
+     * The version of the punycode module bundled in Node.js is being deprecated.
+     * In a future major version of Node.js this module will be removed.
+     * Users currently depending on the punycode module should switch to using
+     * the userland-provided Punycode.js module instead.
+     */
+    const version: string;
+}
+declare module 'node:punycode' {
+    export * from 'punycode';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/querystring.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/querystring.d.ts
new file mode 100644
index 0000000..572828a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/querystring.d.ts
@@ -0,0 +1,131 @@
+/**
+ * The `querystring` module provides utilities for parsing and formatting URL
+ * query strings. It can be accessed using:
+ *
+ * ```js
+ * const querystring = require('querystring');
+ * ```
+ *
+ * The `querystring` API is considered Legacy. While it is still maintained,
+ * new code should use the `URLSearchParams` API instead.
+ * @deprecated Legacy
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/querystring.js)
+ */
+declare module 'querystring' {
+    interface StringifyOptions {
+        encodeURIComponent?: ((str: string) => string) | undefined;
+    }
+    interface ParseOptions {
+        maxKeys?: number | undefined;
+        decodeURIComponent?: ((str: string) => string) | undefined;
+    }
+    interface ParsedUrlQuery extends NodeJS.Dict<string | string[]> {}
+    interface ParsedUrlQueryInput extends NodeJS.Dict<string | number | boolean | ReadonlyArray<string> | ReadonlyArray<number> | ReadonlyArray<boolean> | null> {}
+    /**
+     * The `querystring.stringify()` method produces a URL query string from a
+     * given `obj` by iterating through the object's "own properties".
+     *
+     * It serializes the following types of values passed in `obj`:[string](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures#String_type) |
+     * [number](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures#Number_type) |
+     * [bigint](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt) |
+     * [boolean](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures#Boolean_type) |
+     * [string\[\]](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures#String_type) |
+     * [number\[\]](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures#Number_type) |
+     * [bigint\[\]](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt) |
+     * [boolean\[\]](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures#Boolean_type) The numeric values must be finite. Any other input values will be coerced to
+     * empty strings.
+     *
+     * ```js
+     * querystring.stringify({ foo: 'bar', baz: ['qux', 'quux'], corge: '' });
+     * // Returns 'foo=bar&#x26;baz=qux&#x26;baz=quux&#x26;corge='
+     *
+     * querystring.stringify({ foo: 'bar', baz: 'qux' }, ';', ':');
+     * // Returns 'foo:bar;baz:qux'
+     * ```
+     *
+     * By default, characters requiring percent-encoding within the query string will
+     * be encoded as UTF-8\. If an alternative encoding is required, then an alternative`encodeURIComponent` option will need to be specified:
+     *
+     * ```js
+     * // Assuming gbkEncodeURIComponent function already exists,
+     *
+     * querystring.stringify({ w: '中文', foo: 'bar' }, null, null,
+     *                       { encodeURIComponent: gbkEncodeURIComponent });
+     * ```
+     * @since v0.1.25
+     * @param obj The object to serialize into a URL query string
+     * @param [sep='&'] The substring used to delimit key and value pairs in the query string.
+     * @param [eq='='] . The substring used to delimit keys and values in the query string.
+     */
+    function stringify(obj?: ParsedUrlQueryInput, sep?: string, eq?: string, options?: StringifyOptions): string;
+    /**
+     * The `querystring.parse()` method parses a URL query string (`str`) into a
+     * collection of key and value pairs.
+     *
+     * For example, the query string `'foo=bar&#x26;abc=xyz&#x26;abc=123'` is parsed into:
+     *
+     * ```js
+     * {
+     *   foo: 'bar',
+     *   abc: ['xyz', '123']
+     * }
+     * ```
+     *
+     * The object returned by the `querystring.parse()` method _does not_prototypically inherit from the JavaScript `Object`. This means that typical`Object` methods such as `obj.toString()`,
+     * `obj.hasOwnProperty()`, and others
+     * are not defined and _will not work_.
+     *
+     * By default, percent-encoded characters within the query string will be assumed
+     * to use UTF-8 encoding. If an alternative character encoding is used, then an
+     * alternative `decodeURIComponent` option will need to be specified:
+     *
+     * ```js
+     * // Assuming gbkDecodeURIComponent function already exists...
+     *
+     * querystring.parse('w=%D6%D0%CE%C4&#x26;foo=bar', null, null,
+     *                   { decodeURIComponent: gbkDecodeURIComponent });
+     * ```
+     * @since v0.1.25
+     * @param str The URL query string to parse
+     * @param [sep='&'] The substring used to delimit key and value pairs in the query string.
+     * @param [eq='='] . The substring used to delimit keys and values in the query string.
+     */
+    function parse(str: string, sep?: string, eq?: string, options?: ParseOptions): ParsedUrlQuery;
+    /**
+     * The querystring.encode() function is an alias for querystring.stringify().
+     */
+    const encode: typeof stringify;
+    /**
+     * The querystring.decode() function is an alias for querystring.parse().
+     */
+    const decode: typeof parse;
+    /**
+     * The `querystring.escape()` method performs URL percent-encoding on the given`str` in a manner that is optimized for the specific requirements of URL
+     * query strings.
+     *
+     * The `querystring.escape()` method is used by `querystring.stringify()` and is
+     * generally not expected to be used directly. It is exported primarily to allow
+     * application code to provide a replacement percent-encoding implementation if
+     * necessary by assigning `querystring.escape` to an alternative function.
+     * @since v0.1.25
+     */
+    function escape(str: string): string;
+    /**
+     * The `querystring.unescape()` method performs decoding of URL percent-encoded
+     * characters on the given `str`.
+     *
+     * The `querystring.unescape()` method is used by `querystring.parse()` and is
+     * generally not expected to be used directly. It is exported primarily to allow
+     * application code to provide a replacement decoding implementation if
+     * necessary by assigning `querystring.unescape` to an alternative function.
+     *
+     * By default, the `querystring.unescape()` method will attempt to use the
+     * JavaScript built-in `decodeURIComponent()` method to decode. If that fails,
+     * a safer equivalent that does not throw on malformed URLs will be used.
+     * @since v0.1.25
+     */
+    function unescape(str: string): string;
+}
+declare module 'node:querystring' {
+    export * from 'querystring';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/readline.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/readline.d.ts
new file mode 100644
index 0000000..43ab1db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/readline.d.ts
@@ -0,0 +1,650 @@
+/**
+ * The `readline` module provides an interface for reading data from a `Readable` stream (such as `process.stdin`) one line at a time.
+ *
+ * To use the promise-based APIs:
+ *
+ * ```js
+ * import * as readline from 'node:readline/promises';
+ * ```
+ *
+ * To use the callback and sync APIs:
+ *
+ * ```js
+ * import * as readline from 'node:readline';
+ * ```
+ *
+ * The following simple example illustrates the basic use of the `readline` module.
+ *
+ * ```js
+ * import * as readline from 'node:readline/promises';
+ * import { stdin as input, stdout as output } from 'process';
+ *
+ * const rl = readline.createInterface({ input, output });
+ *
+ * const answer = await rl.question('What do you think of Node.js? ');
+ *
+ * console.log(`Thank you for your valuable feedback: ${answer}`);
+ *
+ * rl.close();
+ * ```
+ *
+ * Once this code is invoked, the Node.js application will not terminate until the`readline.Interface` is closed because the interface waits for data to be
+ * received on the `input` stream.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/readline.js)
+ */
+declare module 'readline' {
+    import { Abortable, EventEmitter } from 'node:events';
+    interface Key {
+        sequence?: string | undefined;
+        name?: string | undefined;
+        ctrl?: boolean | undefined;
+        meta?: boolean | undefined;
+        shift?: boolean | undefined;
+    }
+    /**
+     * Instances of the `readline.Interface` class are constructed using the`readline.createInterface()` method. Every instance is associated with a
+     * single `input` `Readable` stream and a single `output` `Writable` stream.
+     * The `output` stream is used to print prompts for user input that arrives on,
+     * and is read from, the `input` stream.
+     * @since v0.1.104
+     */
+    class Interface extends EventEmitter {
+        readonly terminal: boolean;
+        /**
+         * The current input data being processed by node.
+         *
+         * This can be used when collecting input from a TTY stream to retrieve the
+         * current value that has been processed thus far, prior to the `line` event
+         * being emitted. Once the `line` event has been emitted, this property will
+         * be an empty string.
+         *
+         * Be aware that modifying the value during the instance runtime may have
+         * unintended consequences if `rl.cursor` is not also controlled.
+         *
+         * **If not using a TTY stream for input, use the `'line'` event.**
+         *
+         * One possible use case would be as follows:
+         *
+         * ```js
+         * const values = ['lorem ipsum', 'dolor sit amet'];
+         * const rl = readline.createInterface(process.stdin);
+         * const showResults = debounce(() => {
+         *   console.log(
+         *     '\n',
+         *     values.filter((val) => val.startsWith(rl.line)).join(' ')
+         *   );
+         * }, 300);
+         * process.stdin.on('keypress', (c, k) => {
+         *   showResults();
+         * });
+         * ```
+         * @since v0.1.98
+         */
+        readonly line: string;
+        /**
+         * The cursor position relative to `rl.line`.
+         *
+         * This will track where the current cursor lands in the input string, when
+         * reading input from a TTY stream. The position of cursor determines the
+         * portion of the input string that will be modified as input is processed,
+         * as well as the column where the terminal caret will be rendered.
+         * @since v0.1.98
+         */
+        readonly cursor: number;
+        /**
+         * NOTE: According to the documentation:
+         *
+         * > Instances of the `readline.Interface` class are constructed using the
+         * > `readline.createInterface()` method.
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/readline.html#readline_class_interface
+         */
+        protected constructor(input: NodeJS.ReadableStream, output?: NodeJS.WritableStream, completer?: Completer | AsyncCompleter, terminal?: boolean);
+        /**
+         * NOTE: According to the documentation:
+         *
+         * > Instances of the `readline.Interface` class are constructed using the
+         * > `readline.createInterface()` method.
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/readline.html#readline_class_interface
+         */
+        protected constructor(options: ReadLineOptions);
+        /**
+         * The `rl.getPrompt()` method returns the current prompt used by `rl.prompt()`.
+         * @since v15.3.0
+         * @return the current prompt string
+         */
+        getPrompt(): string;
+        /**
+         * The `rl.setPrompt()` method sets the prompt that will be written to `output`whenever `rl.prompt()` is called.
+         * @since v0.1.98
+         */
+        setPrompt(prompt: string): void;
+        /**
+         * The `rl.prompt()` method writes the `readline.Interface` instances configured`prompt` to a new line in `output` in order to provide a user with a new
+         * location at which to provide input.
+         *
+         * When called, `rl.prompt()` will resume the `input` stream if it has been
+         * paused.
+         *
+         * If the `readline.Interface` was created with `output` set to `null` or`undefined` the prompt is not written.
+         * @since v0.1.98
+         * @param preserveCursor If `true`, prevents the cursor placement from being reset to `0`.
+         */
+        prompt(preserveCursor?: boolean): void;
+        /**
+         * The `rl.question()` method displays the `query` by writing it to the `output`,
+         * waits for user input to be provided on `input`, then invokes the `callback`function passing the provided input as the first argument.
+         *
+         * When called, `rl.question()` will resume the `input` stream if it has been
+         * paused.
+         *
+         * If the `readline.Interface` was created with `output` set to `null` or`undefined` the `query` is not written.
+         *
+         * The `callback` function passed to `rl.question()` does not follow the typical
+         * pattern of accepting an `Error` object or `null` as the first argument.
+         * The `callback` is called with the provided answer as the only argument.
+         *
+         * Example usage:
+         *
+         * ```js
+         * rl.question('What is your favorite food? ', (answer) => {
+         *   console.log(`Oh, so your favorite food is ${answer}`);
+         * });
+         * ```
+         *
+         * Using an `AbortController` to cancel a question.
+         *
+         * ```js
+         * const ac = new AbortController();
+         * const signal = ac.signal;
+         *
+         * rl.question('What is your favorite food? ', { signal }, (answer) => {
+         *   console.log(`Oh, so your favorite food is ${answer}`);
+         * });
+         *
+         * signal.addEventListener('abort', () => {
+         *   console.log('The food question timed out');
+         * }, { once: true });
+         *
+         * setTimeout(() => ac.abort(), 10000);
+         * ```
+         *
+         * If this method is invoked as it's util.promisify()ed version, it returns a
+         * Promise that fulfills with the answer. If the question is canceled using
+         * an `AbortController` it will reject with an `AbortError`.
+         *
+         * ```js
+         * const util = require('util');
+         * const question = util.promisify(rl.question).bind(rl);
+         *
+         * async function questionExample() {
+         *   try {
+         *     const answer = await question('What is you favorite food? ');
+         *     console.log(`Oh, so your favorite food is ${answer}`);
+         *   } catch (err) {
+         *     console.error('Question rejected', err);
+         *   }
+         * }
+         * questionExample();
+         * ```
+         * @since v0.3.3
+         * @param query A statement or query to write to `output`, prepended to the prompt.
+         * @param callback A callback function that is invoked with the user's input in response to the `query`.
+         */
+        question(query: string, callback: (answer: string) => void): void;
+        question(query: string, options: Abortable, callback: (answer: string) => void): void;
+        /**
+         * The `rl.pause()` method pauses the `input` stream, allowing it to be resumed
+         * later if necessary.
+         *
+         * Calling `rl.pause()` does not immediately pause other events (including`'line'`) from being emitted by the `readline.Interface` instance.
+         * @since v0.3.4
+         */
+        pause(): this;
+        /**
+         * The `rl.resume()` method resumes the `input` stream if it has been paused.
+         * @since v0.3.4
+         */
+        resume(): this;
+        /**
+         * The `rl.close()` method closes the `readline.Interface` instance and
+         * relinquishes control over the `input` and `output` streams. When called,
+         * the `'close'` event will be emitted.
+         *
+         * Calling `rl.close()` does not immediately stop other events (including `'line'`)
+         * from being emitted by the `readline.Interface` instance.
+         * @since v0.1.98
+         */
+        close(): void;
+        /**
+         * The `rl.write()` method will write either `data` or a key sequence identified
+         * by `key` to the `output`. The `key` argument is supported only if `output` is
+         * a `TTY` text terminal. See `TTY keybindings` for a list of key
+         * combinations.
+         *
+         * If `key` is specified, `data` is ignored.
+         *
+         * When called, `rl.write()` will resume the `input` stream if it has been
+         * paused.
+         *
+         * If the `readline.Interface` was created with `output` set to `null` or`undefined` the `data` and `key` are not written.
+         *
+         * ```js
+         * rl.write('Delete this!');
+         * // Simulate Ctrl+U to delete the line written previously
+         * rl.write(null, { ctrl: true, name: 'u' });
+         * ```
+         *
+         * The `rl.write()` method will write the data to the `readline` `Interface`'s`input`_as if it were provided by the user_.
+         * @since v0.1.98
+         */
+        write(data: string | Buffer, key?: Key): void;
+        write(data: undefined | null | string | Buffer, key: Key): void;
+        /**
+         * Returns the real position of the cursor in relation to the input
+         * prompt + string. Long input (wrapping) strings, as well as multiple
+         * line prompts are included in the calculations.
+         * @since v13.5.0, v12.16.0
+         */
+        getCursorPos(): CursorPos;
+        /**
+         * events.EventEmitter
+         * 1. close
+         * 2. line
+         * 3. pause
+         * 4. resume
+         * 5. SIGCONT
+         * 6. SIGINT
+         * 7. SIGTSTP
+         * 8. history
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'line', listener: (input: string) => void): this;
+        addListener(event: 'pause', listener: () => void): this;
+        addListener(event: 'resume', listener: () => void): this;
+        addListener(event: 'SIGCONT', listener: () => void): this;
+        addListener(event: 'SIGINT', listener: () => void): this;
+        addListener(event: 'SIGTSTP', listener: () => void): this;
+        addListener(event: 'history', listener: (history: string[]) => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'line', input: string): boolean;
+        emit(event: 'pause'): boolean;
+        emit(event: 'resume'): boolean;
+        emit(event: 'SIGCONT'): boolean;
+        emit(event: 'SIGINT'): boolean;
+        emit(event: 'SIGTSTP'): boolean;
+        emit(event: 'history', history: string[]): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'line', listener: (input: string) => void): this;
+        on(event: 'pause', listener: () => void): this;
+        on(event: 'resume', listener: () => void): this;
+        on(event: 'SIGCONT', listener: () => void): this;
+        on(event: 'SIGINT', listener: () => void): this;
+        on(event: 'SIGTSTP', listener: () => void): this;
+        on(event: 'history', listener: (history: string[]) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'line', listener: (input: string) => void): this;
+        once(event: 'pause', listener: () => void): this;
+        once(event: 'resume', listener: () => void): this;
+        once(event: 'SIGCONT', listener: () => void): this;
+        once(event: 'SIGINT', listener: () => void): this;
+        once(event: 'SIGTSTP', listener: () => void): this;
+        once(event: 'history', listener: (history: string[]) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'line', listener: (input: string) => void): this;
+        prependListener(event: 'pause', listener: () => void): this;
+        prependListener(event: 'resume', listener: () => void): this;
+        prependListener(event: 'SIGCONT', listener: () => void): this;
+        prependListener(event: 'SIGINT', listener: () => void): this;
+        prependListener(event: 'SIGTSTP', listener: () => void): this;
+        prependListener(event: 'history', listener: (history: string[]) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'line', listener: (input: string) => void): this;
+        prependOnceListener(event: 'pause', listener: () => void): this;
+        prependOnceListener(event: 'resume', listener: () => void): this;
+        prependOnceListener(event: 'SIGCONT', listener: () => void): this;
+        prependOnceListener(event: 'SIGINT', listener: () => void): this;
+        prependOnceListener(event: 'SIGTSTP', listener: () => void): this;
+        prependOnceListener(event: 'history', listener: (history: string[]) => void): this;
+        [Symbol.asyncIterator](): AsyncIterableIterator<string>;
+    }
+    type ReadLine = Interface; // type forwarded for backwards compatibility
+    type Completer = (line: string) => CompleterResult;
+    type AsyncCompleter = (line: string, callback: (err?: null | Error, result?: CompleterResult) => void) => void;
+    type CompleterResult = [string[], string];
+    interface ReadLineOptions {
+        input: NodeJS.ReadableStream;
+        output?: NodeJS.WritableStream | undefined;
+        completer?: Completer | AsyncCompleter | undefined;
+        terminal?: boolean | undefined;
+        /**
+         *  Initial list of history lines. This option makes sense
+         * only if `terminal` is set to `true` by the user or by an internal `output`
+         * check, otherwise the history caching mechanism is not initialized at all.
+         * @default []
+         */
+        history?: string[] | undefined;
+        historySize?: number | undefined;
+        prompt?: string | undefined;
+        crlfDelay?: number | undefined;
+        /**
+         * If `true`, when a new input line added
+         * to the history list duplicates an older one, this removes the older line
+         * from the list.
+         * @default false
+         */
+        removeHistoryDuplicates?: boolean | undefined;
+        escapeCodeTimeout?: number | undefined;
+        tabSize?: number | undefined;
+    }
+    /**
+     * The `readline.createInterface()` method creates a new `readline.Interface`instance.
+     *
+     * ```js
+     * const readline = require('readline');
+     * const rl = readline.createInterface({
+     *   input: process.stdin,
+     *   output: process.stdout
+     * });
+     * ```
+     *
+     * Once the `readline.Interface` instance is created, the most common case is to
+     * listen for the `'line'` event:
+     *
+     * ```js
+     * rl.on('line', (line) => {
+     *   console.log(`Received: ${line}`);
+     * });
+     * ```
+     *
+     * If `terminal` is `true` for this instance then the `output` stream will get
+     * the best compatibility if it defines an `output.columns` property and emits
+     * a `'resize'` event on the `output` if or when the columns ever change
+     * (`process.stdout` does this automatically when it is a TTY).
+     *
+     * When creating a `readline.Interface` using `stdin` as input, the program
+     * will not terminate until it receives `EOF` (Ctrl+D on
+     * Linux/macOS, Ctrl+Z followed by Return on
+     * Windows).
+     * If you want your application to exit without waiting for user input, you can `unref()` the standard input stream:
+     *
+     * ```js
+     * process.stdin.unref();
+     * ```
+     * @since v0.1.98
+     */
+    function createInterface(input: NodeJS.ReadableStream, output?: NodeJS.WritableStream, completer?: Completer | AsyncCompleter, terminal?: boolean): Interface;
+    function createInterface(options: ReadLineOptions): Interface;
+    /**
+     * The `readline.emitKeypressEvents()` method causes the given `Readable` stream to begin emitting `'keypress'` events corresponding to received input.
+     *
+     * Optionally, `interface` specifies a `readline.Interface` instance for which
+     * autocompletion is disabled when copy-pasted input is detected.
+     *
+     * If the `stream` is a `TTY`, then it must be in raw mode.
+     *
+     * This is automatically called by any readline instance on its `input` if the`input` is a terminal. Closing the `readline` instance does not stop
+     * the `input` from emitting `'keypress'` events.
+     *
+     * ```js
+     * readline.emitKeypressEvents(process.stdin);
+     * if (process.stdin.isTTY)
+     *   process.stdin.setRawMode(true);
+     * ```
+     *
+     * ## Example: Tiny CLI
+     *
+     * The following example illustrates the use of `readline.Interface` class to
+     * implement a small command-line interface:
+     *
+     * ```js
+     * const readline = require('readline');
+     * const rl = readline.createInterface({
+     *   input: process.stdin,
+     *   output: process.stdout,
+     *   prompt: 'OHAI> '
+     * });
+     *
+     * rl.prompt();
+     *
+     * rl.on('line', (line) => {
+     *   switch (line.trim()) {
+     *     case 'hello':
+     *       console.log('world!');
+     *       break;
+     *     default:
+     *       console.log(`Say what? I might have heard '${line.trim()}'`);
+     *       break;
+     *   }
+     *   rl.prompt();
+     * }).on('close', () => {
+     *   console.log('Have a great day!');
+     *   process.exit(0);
+     * });
+     * ```
+     *
+     * ## Example: Read file stream line-by-Line
+     *
+     * A common use case for `readline` is to consume an input file one line at a
+     * time. The easiest way to do so is leveraging the `fs.ReadStream` API as
+     * well as a `for await...of` loop:
+     *
+     * ```js
+     * const fs = require('fs');
+     * const readline = require('readline');
+     *
+     * async function processLineByLine() {
+     *   const fileStream = fs.createReadStream('input.txt');
+     *
+     *   const rl = readline.createInterface({
+     *     input: fileStream,
+     *     crlfDelay: Infinity
+     *   });
+     *   // Note: we use the crlfDelay option to recognize all instances of CR LF
+     *   // ('\r\n') in input.txt as a single line break.
+     *
+     *   for await (const line of rl) {
+     *     // Each line in input.txt will be successively available here as `line`.
+     *     console.log(`Line from file: ${line}`);
+     *   }
+     * }
+     *
+     * processLineByLine();
+     * ```
+     *
+     * Alternatively, one could use the `'line'` event:
+     *
+     * ```js
+     * const fs = require('fs');
+     * const readline = require('readline');
+     *
+     * const rl = readline.createInterface({
+     *   input: fs.createReadStream('sample.txt'),
+     *   crlfDelay: Infinity
+     * });
+     *
+     * rl.on('line', (line) => {
+     *   console.log(`Line from file: ${line}`);
+     * });
+     * ```
+     *
+     * Currently, `for await...of` loop can be a bit slower. If `async` / `await`flow and speed are both essential, a mixed approach can be applied:
+     *
+     * ```js
+     * const { once } = require('events');
+     * const { createReadStream } = require('fs');
+     * const { createInterface } = require('readline');
+     *
+     * (async function processLineByLine() {
+     *   try {
+     *     const rl = createInterface({
+     *       input: createReadStream('big-file.txt'),
+     *       crlfDelay: Infinity
+     *     });
+     *
+     *     rl.on('line', (line) => {
+     *       // Process the line.
+     *     });
+     *
+     *     await once(rl, 'close');
+     *
+     *     console.log('File processed.');
+     *   } catch (err) {
+     *     console.error(err);
+     *   }
+     * })();
+     * ```
+     * @since v0.7.7
+     */
+    function emitKeypressEvents(stream: NodeJS.ReadableStream, readlineInterface?: Interface): void;
+    type Direction = -1 | 0 | 1;
+    interface CursorPos {
+        rows: number;
+        cols: number;
+    }
+    /**
+     * The `readline.clearLine()` method clears current line of given `TTY` stream
+     * in a specified direction identified by `dir`.
+     * @since v0.7.7
+     * @param callback Invoked once the operation completes.
+     * @return `false` if `stream` wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+     */
+    function clearLine(stream: NodeJS.WritableStream, dir: Direction, callback?: () => void): boolean;
+    /**
+     * The `readline.clearScreenDown()` method clears the given `TTY` stream from
+     * the current position of the cursor down.
+     * @since v0.7.7
+     * @param callback Invoked once the operation completes.
+     * @return `false` if `stream` wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+     */
+    function clearScreenDown(stream: NodeJS.WritableStream, callback?: () => void): boolean;
+    /**
+     * The `readline.cursorTo()` method moves cursor to the specified position in a
+     * given `TTY` `stream`.
+     * @since v0.7.7
+     * @param callback Invoked once the operation completes.
+     * @return `false` if `stream` wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+     */
+    function cursorTo(stream: NodeJS.WritableStream, x: number, y?: number, callback?: () => void): boolean;
+    /**
+     * The `readline.moveCursor()` method moves the cursor _relative_ to its current
+     * position in a given `TTY` `stream`.
+     *
+     * ## Example: Tiny CLI
+     *
+     * The following example illustrates the use of `readline.Interface` class to
+     * implement a small command-line interface:
+     *
+     * ```js
+     * const readline = require('readline');
+     * const rl = readline.createInterface({
+     *   input: process.stdin,
+     *   output: process.stdout,
+     *   prompt: 'OHAI> '
+     * });
+     *
+     * rl.prompt();
+     *
+     * rl.on('line', (line) => {
+     *   switch (line.trim()) {
+     *     case 'hello':
+     *       console.log('world!');
+     *       break;
+     *     default:
+     *       console.log(`Say what? I might have heard '${line.trim()}'`);
+     *       break;
+     *   }
+     *   rl.prompt();
+     * }).on('close', () => {
+     *   console.log('Have a great day!');
+     *   process.exit(0);
+     * });
+     * ```
+     *
+     * ## Example: Read file stream line-by-Line
+     *
+     * A common use case for `readline` is to consume an input file one line at a
+     * time. The easiest way to do so is leveraging the `fs.ReadStream` API as
+     * well as a `for await...of` loop:
+     *
+     * ```js
+     * const fs = require('fs');
+     * const readline = require('readline');
+     *
+     * async function processLineByLine() {
+     *   const fileStream = fs.createReadStream('input.txt');
+     *
+     *   const rl = readline.createInterface({
+     *     input: fileStream,
+     *     crlfDelay: Infinity
+     *   });
+     *   // Note: we use the crlfDelay option to recognize all instances of CR LF
+     *   // ('\r\n') in input.txt as a single line break.
+     *
+     *   for await (const line of rl) {
+     *     // Each line in input.txt will be successively available here as `line`.
+     *     console.log(`Line from file: ${line}`);
+     *   }
+     * }
+     *
+     * processLineByLine();
+     * ```
+     *
+     * Alternatively, one could use the `'line'` event:
+     *
+     * ```js
+     * const fs = require('fs');
+     * const readline = require('readline');
+     *
+     * const rl = readline.createInterface({
+     *   input: fs.createReadStream('sample.txt'),
+     *   crlfDelay: Infinity
+     * });
+     *
+     * rl.on('line', (line) => {
+     *   console.log(`Line from file: ${line}`);
+     * });
+     * ```
+     *
+     * Currently, `for await...of` loop can be a bit slower. If `async` / `await`flow and speed are both essential, a mixed approach can be applied:
+     *
+     * ```js
+     * const { once } = require('events');
+     * const { createReadStream } = require('fs');
+     * const { createInterface } = require('readline');
+     *
+     * (async function processLineByLine() {
+     *   try {
+     *     const rl = createInterface({
+     *       input: createReadStream('big-file.txt'),
+     *       crlfDelay: Infinity
+     *     });
+     *
+     *     rl.on('line', (line) => {
+     *       // Process the line.
+     *     });
+     *
+     *     await once(rl, 'close');
+     *
+     *     console.log('File processed.');
+     *   } catch (err) {
+     *     console.error(err);
+     *   }
+     * })();
+     * ```
+     * @since v0.7.7
+     * @param callback Invoked once the operation completes.
+     * @return `false` if `stream` wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+     */
+    function moveCursor(stream: NodeJS.WritableStream, dx: number, dy: number, callback?: () => void): boolean;
+}
+declare module 'node:readline' {
+    export * from 'readline';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/repl.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/repl.d.ts
new file mode 100644
index 0000000..e81fee5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/repl.d.ts
@@ -0,0 +1,424 @@
+/**
+ * The `repl` module provides a Read-Eval-Print-Loop (REPL) implementation that
+ * is available both as a standalone program or includible in other applications.
+ * It can be accessed using:
+ *
+ * ```js
+ * const repl = require('repl');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/repl.js)
+ */
+declare module 'repl' {
+    import { Interface, Completer, AsyncCompleter } from 'node:readline';
+    import { Context } from 'node:vm';
+    import { InspectOptions } from 'node:util';
+    interface ReplOptions {
+        /**
+         * The input prompt to display.
+         * @default "> "
+         */
+        prompt?: string | undefined;
+        /**
+         * The `Readable` stream from which REPL input will be read.
+         * @default process.stdin
+         */
+        input?: NodeJS.ReadableStream | undefined;
+        /**
+         * The `Writable` stream to which REPL output will be written.
+         * @default process.stdout
+         */
+        output?: NodeJS.WritableStream | undefined;
+        /**
+         * If `true`, specifies that the output should be treated as a TTY terminal, and have
+         * ANSI/VT100 escape codes written to it.
+         * Default: checking the value of the `isTTY` property on the output stream upon
+         * instantiation.
+         */
+        terminal?: boolean | undefined;
+        /**
+         * The function to be used when evaluating each given line of input.
+         * Default: an async wrapper for the JavaScript `eval()` function. An `eval` function can
+         * error with `repl.Recoverable` to indicate the input was incomplete and prompt for
+         * additional lines.
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_default_evaluation
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_custom_evaluation_functions
+         */
+        eval?: REPLEval | undefined;
+        /**
+         * Defines if the repl prints output previews or not.
+         * @default `true` Always `false` in case `terminal` is falsy.
+         */
+        preview?: boolean | undefined;
+        /**
+         * If `true`, specifies that the default `writer` function should include ANSI color
+         * styling to REPL output. If a custom `writer` function is provided then this has no
+         * effect.
+         * Default: the REPL instance's `terminal` value.
+         */
+        useColors?: boolean | undefined;
+        /**
+         * If `true`, specifies that the default evaluation function will use the JavaScript
+         * `global` as the context as opposed to creating a new separate context for the REPL
+         * instance. The node CLI REPL sets this value to `true`.
+         * Default: `false`.
+         */
+        useGlobal?: boolean | undefined;
+        /**
+         * If `true`, specifies that the default writer will not output the return value of a
+         * command if it evaluates to `undefined`.
+         * Default: `false`.
+         */
+        ignoreUndefined?: boolean | undefined;
+        /**
+         * The function to invoke to format the output of each command before writing to `output`.
+         * Default: a wrapper for `util.inspect`.
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_customizing_repl_output
+         */
+        writer?: REPLWriter | undefined;
+        /**
+         * An optional function used for custom Tab auto completion.
+         *
+         * @see https://nodejs.org/dist/latest-v11.x/docs/api/readline.html#readline_use_of_the_completer_function
+         */
+        completer?: Completer | AsyncCompleter | undefined;
+        /**
+         * A flag that specifies whether the default evaluator executes all JavaScript commands in
+         * strict mode or default (sloppy) mode.
+         * Accepted values are:
+         * - `repl.REPL_MODE_SLOPPY` - evaluates expressions in sloppy mode.
+         * - `repl.REPL_MODE_STRICT` - evaluates expressions in strict mode. This is equivalent to
+         *   prefacing every repl statement with `'use strict'`.
+         */
+        replMode?: typeof REPL_MODE_SLOPPY | typeof REPL_MODE_STRICT | undefined;
+        /**
+         * Stop evaluating the current piece of code when `SIGINT` is received, i.e. `Ctrl+C` is
+         * pressed. This cannot be used together with a custom `eval` function.
+         * Default: `false`.
+         */
+        breakEvalOnSigint?: boolean | undefined;
+    }
+    type REPLEval = (this: REPLServer, evalCmd: string, context: Context, file: string, cb: (err: Error | null, result: any) => void) => void;
+    type REPLWriter = (this: REPLServer, obj: any) => string;
+    /**
+     * This is the default "writer" value, if none is passed in the REPL options,
+     * and it can be overridden by custom print functions.
+     */
+    const writer: REPLWriter & {
+        options: InspectOptions;
+    };
+    type REPLCommandAction = (this: REPLServer, text: string) => void;
+    interface REPLCommand {
+        /**
+         * Help text to be displayed when `.help` is entered.
+         */
+        help?: string | undefined;
+        /**
+         * The function to execute, optionally accepting a single string argument.
+         */
+        action: REPLCommandAction;
+    }
+    /**
+     * Instances of `repl.REPLServer` are created using the {@link start} method
+     * or directly using the JavaScript `new` keyword.
+     *
+     * ```js
+     * const repl = require('repl');
+     *
+     * const options = { useColors: true };
+     *
+     * const firstInstance = repl.start(options);
+     * const secondInstance = new repl.REPLServer(options);
+     * ```
+     * @since v0.1.91
+     */
+    class REPLServer extends Interface {
+        /**
+         * The `vm.Context` provided to the `eval` function to be used for JavaScript
+         * evaluation.
+         */
+        readonly context: Context;
+        /**
+         * @deprecated since v14.3.0 - Use `input` instead.
+         */
+        readonly inputStream: NodeJS.ReadableStream;
+        /**
+         * @deprecated since v14.3.0 - Use `output` instead.
+         */
+        readonly outputStream: NodeJS.WritableStream;
+        /**
+         * The `Readable` stream from which REPL input will be read.
+         */
+        readonly input: NodeJS.ReadableStream;
+        /**
+         * The `Writable` stream to which REPL output will be written.
+         */
+        readonly output: NodeJS.WritableStream;
+        /**
+         * The commands registered via `replServer.defineCommand()`.
+         */
+        readonly commands: NodeJS.ReadOnlyDict<REPLCommand>;
+        /**
+         * A value indicating whether the REPL is currently in "editor mode".
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_commands_and_special_keys
+         */
+        readonly editorMode: boolean;
+        /**
+         * A value indicating whether the `_` variable has been assigned.
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_assignment_of_the_underscore_variable
+         */
+        readonly underscoreAssigned: boolean;
+        /**
+         * The last evaluation result from the REPL (assigned to the `_` variable inside of the REPL).
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_assignment_of_the_underscore_variable
+         */
+        readonly last: any;
+        /**
+         * A value indicating whether the `_error` variable has been assigned.
+         *
+         * @since v9.8.0
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_assignment_of_the_underscore_variable
+         */
+        readonly underscoreErrAssigned: boolean;
+        /**
+         * The last error raised inside the REPL (assigned to the `_error` variable inside of the REPL).
+         *
+         * @since v9.8.0
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_assignment_of_the_underscore_variable
+         */
+        readonly lastError: any;
+        /**
+         * Specified in the REPL options, this is the function to be used when evaluating each
+         * given line of input. If not specified in the REPL options, this is an async wrapper
+         * for the JavaScript `eval()` function.
+         */
+        readonly eval: REPLEval;
+        /**
+         * Specified in the REPL options, this is a value indicating whether the default
+         * `writer` function should include ANSI color styling to REPL output.
+         */
+        readonly useColors: boolean;
+        /**
+         * Specified in the REPL options, this is a value indicating whether the default `eval`
+         * function will use the JavaScript `global` as the context as opposed to creating a new
+         * separate context for the REPL instance.
+         */
+        readonly useGlobal: boolean;
+        /**
+         * Specified in the REPL options, this is a value indicating whether the default `writer`
+         * function should output the result of a command if it evaluates to `undefined`.
+         */
+        readonly ignoreUndefined: boolean;
+        /**
+         * Specified in the REPL options, this is the function to invoke to format the output of
+         * each command before writing to `outputStream`. If not specified in the REPL options,
+         * this will be a wrapper for `util.inspect`.
+         */
+        readonly writer: REPLWriter;
+        /**
+         * Specified in the REPL options, this is the function to use for custom Tab auto-completion.
+         */
+        readonly completer: Completer | AsyncCompleter;
+        /**
+         * Specified in the REPL options, this is a flag that specifies whether the default `eval`
+         * function should execute all JavaScript commands in strict mode or default (sloppy) mode.
+         * Possible values are:
+         * - `repl.REPL_MODE_SLOPPY` - evaluates expressions in sloppy mode.
+         * - `repl.REPL_MODE_STRICT` - evaluates expressions in strict mode. This is equivalent to
+         *    prefacing every repl statement with `'use strict'`.
+         */
+        readonly replMode: typeof REPL_MODE_SLOPPY | typeof REPL_MODE_STRICT;
+        /**
+         * NOTE: According to the documentation:
+         *
+         * > Instances of `repl.REPLServer` are created using the `repl.start()` method and
+         * > _should not_ be created directly using the JavaScript `new` keyword.
+         *
+         * `REPLServer` cannot be subclassed due to implementation specifics in NodeJS.
+         *
+         * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_class_replserver
+         */
+        private constructor();
+        /**
+         * The `replServer.defineCommand()` method is used to add new `.`\-prefixed commands
+         * to the REPL instance. Such commands are invoked by typing a `.` followed by the`keyword`. The `cmd` is either a `Function` or an `Object` with the following
+         * properties:
+         *
+         * The following example shows two new commands added to the REPL instance:
+         *
+         * ```js
+         * const repl = require('repl');
+         *
+         * const replServer = repl.start({ prompt: '> ' });
+         * replServer.defineCommand('sayhello', {
+         *   help: 'Say hello',
+         *   action(name) {
+         *     this.clearBufferedCommand();
+         *     console.log(`Hello, ${name}!`);
+         *     this.displayPrompt();
+         *   }
+         * });
+         * replServer.defineCommand('saybye', function saybye() {
+         *   console.log('Goodbye!');
+         *   this.close();
+         * });
+         * ```
+         *
+         * The new commands can then be used from within the REPL instance:
+         *
+         * ```console
+         * > .sayhello Node.js User
+         * Hello, Node.js User!
+         * > .saybye
+         * Goodbye!
+         * ```
+         * @since v0.3.0
+         * @param keyword The command keyword (*without* a leading `.` character).
+         * @param cmd The function to invoke when the command is processed.
+         */
+        defineCommand(keyword: string, cmd: REPLCommandAction | REPLCommand): void;
+        /**
+         * The `replServer.displayPrompt()` method readies the REPL instance for input
+         * from the user, printing the configured `prompt` to a new line in the `output`and resuming the `input` to accept new input.
+         *
+         * When multi-line input is being entered, an ellipsis is printed rather than the
+         * 'prompt'.
+         *
+         * When `preserveCursor` is `true`, the cursor placement will not be reset to `0`.
+         *
+         * The `replServer.displayPrompt` method is primarily intended to be called from
+         * within the action function for commands registered using the`replServer.defineCommand()` method.
+         * @since v0.1.91
+         */
+        displayPrompt(preserveCursor?: boolean): void;
+        /**
+         * The `replServer.clearBufferedCommand()` method clears any command that has been
+         * buffered but not yet executed. This method is primarily intended to be
+         * called from within the action function for commands registered using the`replServer.defineCommand()` method.
+         * @since v9.0.0
+         */
+        clearBufferedCommand(): void;
+        /**
+         * Initializes a history log file for the REPL instance. When executing the
+         * Node.js binary and using the command-line REPL, a history file is initialized
+         * by default. However, this is not the case when creating a REPL
+         * programmatically. Use this method to initialize a history log file when working
+         * with REPL instances programmatically.
+         * @since v11.10.0
+         * @param historyPath the path to the history file
+         * @param callback called when history writes are ready or upon error
+         */
+        setupHistory(path: string, callback: (err: Error | null, repl: this) => void): void;
+        /**
+         * events.EventEmitter
+         * 1. close - inherited from `readline.Interface`
+         * 2. line - inherited from `readline.Interface`
+         * 3. pause - inherited from `readline.Interface`
+         * 4. resume - inherited from `readline.Interface`
+         * 5. SIGCONT - inherited from `readline.Interface`
+         * 6. SIGINT - inherited from `readline.Interface`
+         * 7. SIGTSTP - inherited from `readline.Interface`
+         * 8. exit
+         * 9. reset
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'line', listener: (input: string) => void): this;
+        addListener(event: 'pause', listener: () => void): this;
+        addListener(event: 'resume', listener: () => void): this;
+        addListener(event: 'SIGCONT', listener: () => void): this;
+        addListener(event: 'SIGINT', listener: () => void): this;
+        addListener(event: 'SIGTSTP', listener: () => void): this;
+        addListener(event: 'exit', listener: () => void): this;
+        addListener(event: 'reset', listener: (context: Context) => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'close'): boolean;
+        emit(event: 'line', input: string): boolean;
+        emit(event: 'pause'): boolean;
+        emit(event: 'resume'): boolean;
+        emit(event: 'SIGCONT'): boolean;
+        emit(event: 'SIGINT'): boolean;
+        emit(event: 'SIGTSTP'): boolean;
+        emit(event: 'exit'): boolean;
+        emit(event: 'reset', context: Context): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'line', listener: (input: string) => void): this;
+        on(event: 'pause', listener: () => void): this;
+        on(event: 'resume', listener: () => void): this;
+        on(event: 'SIGCONT', listener: () => void): this;
+        on(event: 'SIGINT', listener: () => void): this;
+        on(event: 'SIGTSTP', listener: () => void): this;
+        on(event: 'exit', listener: () => void): this;
+        on(event: 'reset', listener: (context: Context) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'line', listener: (input: string) => void): this;
+        once(event: 'pause', listener: () => void): this;
+        once(event: 'resume', listener: () => void): this;
+        once(event: 'SIGCONT', listener: () => void): this;
+        once(event: 'SIGINT', listener: () => void): this;
+        once(event: 'SIGTSTP', listener: () => void): this;
+        once(event: 'exit', listener: () => void): this;
+        once(event: 'reset', listener: (context: Context) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'line', listener: (input: string) => void): this;
+        prependListener(event: 'pause', listener: () => void): this;
+        prependListener(event: 'resume', listener: () => void): this;
+        prependListener(event: 'SIGCONT', listener: () => void): this;
+        prependListener(event: 'SIGINT', listener: () => void): this;
+        prependListener(event: 'SIGTSTP', listener: () => void): this;
+        prependListener(event: 'exit', listener: () => void): this;
+        prependListener(event: 'reset', listener: (context: Context) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'line', listener: (input: string) => void): this;
+        prependOnceListener(event: 'pause', listener: () => void): this;
+        prependOnceListener(event: 'resume', listener: () => void): this;
+        prependOnceListener(event: 'SIGCONT', listener: () => void): this;
+        prependOnceListener(event: 'SIGINT', listener: () => void): this;
+        prependOnceListener(event: 'SIGTSTP', listener: () => void): this;
+        prependOnceListener(event: 'exit', listener: () => void): this;
+        prependOnceListener(event: 'reset', listener: (context: Context) => void): this;
+    }
+    /**
+     * A flag passed in the REPL options. Evaluates expressions in sloppy mode.
+     */
+    const REPL_MODE_SLOPPY: unique symbol;
+    /**
+     * A flag passed in the REPL options. Evaluates expressions in strict mode.
+     * This is equivalent to prefacing every repl statement with `'use strict'`.
+     */
+    const REPL_MODE_STRICT: unique symbol;
+    /**
+     * The `repl.start()` method creates and starts a {@link REPLServer} instance.
+     *
+     * If `options` is a string, then it specifies the input prompt:
+     *
+     * ```js
+     * const repl = require('repl');
+     *
+     * // a Unix style prompt
+     * repl.start('$ ');
+     * ```
+     * @since v0.1.91
+     */
+    function start(options?: string | ReplOptions): REPLServer;
+    /**
+     * Indicates a recoverable error that a `REPLServer` can use to support multi-line input.
+     *
+     * @see https://nodejs.org/dist/latest-v10.x/docs/api/repl.html#repl_recoverable_errors
+     */
+    class Recoverable extends SyntaxError {
+        err: Error;
+        constructor(err: Error);
+    }
+}
+declare module 'node:repl' {
+    export * from 'repl';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/stream.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/stream.d.ts
new file mode 100644
index 0000000..7edc7bf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/stream.d.ts
@@ -0,0 +1,1249 @@
+/**
+ * A stream is an abstract interface for working with streaming data in Node.js.
+ * The `stream` module provides an API for implementing the stream interface.
+ *
+ * There are many stream objects provided by Node.js. For instance, a `request to an HTTP server` and `process.stdout` are both stream instances.
+ *
+ * Streams can be readable, writable, or both. All streams are instances of `EventEmitter`.
+ *
+ * To access the `stream` module:
+ *
+ * ```js
+ * const stream = require('stream');
+ * ```
+ *
+ * The `stream` module is useful for creating new types of stream instances. It is
+ * usually not necessary to use the `stream` module to consume streams.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/stream.js)
+ */
+declare module 'stream' {
+    import { EventEmitter, Abortable } from 'node:events';
+    import * as streamPromises from 'node:stream/promises';
+    import * as streamConsumers from 'node:stream/consumers';
+    class internal extends EventEmitter {
+        pipe<T extends NodeJS.WritableStream>(
+            destination: T,
+            options?: {
+                end?: boolean | undefined;
+            }
+        ): T;
+    }
+    namespace internal {
+        class Stream extends internal {
+            constructor(opts?: ReadableOptions);
+        }
+        interface StreamOptions<T extends Stream> extends Abortable {
+            emitClose?: boolean | undefined;
+            highWaterMark?: number | undefined;
+            objectMode?: boolean | undefined;
+            construct?(this: T, callback: (error?: Error | null) => void): void;
+            destroy?(this: T, error: Error | null, callback: (error: Error | null) => void): void;
+            autoDestroy?: boolean | undefined;
+        }
+        interface ReadableOptions extends StreamOptions<Readable> {
+            encoding?: BufferEncoding | undefined;
+            read?(this: Readable, size: number): void;
+        }
+        /**
+         * @since v0.9.4
+         */
+        class Readable extends Stream implements NodeJS.ReadableStream {
+            /**
+             * A utility method for creating Readable Streams out of iterators.
+             */
+            static from(iterable: Iterable<any> | AsyncIterable<any>, options?: ReadableOptions): Readable;
+            /**
+             * Returns whether the stream has been read from or cancelled.
+             * @since v16.8.0
+             */
+            static isDisturbed(stream: Readable | NodeJS.ReadableStream): boolean;
+            /**
+             * Returns whether the stream was destroyed or errored before emitting `'end'`.
+             * @since v16.8.0
+             * @experimental
+             */
+            readonly readableAborted: boolean;
+            /**
+             * Is `true` if it is safe to call `readable.read()`, which means
+             * the stream has not been destroyed or emitted `'error'` or `'end'`.
+             * @since v11.4.0
+             */
+            readable: boolean;
+            /**
+             * Returns whether `'data'` has been emitted.
+             * @since v16.7.0, v14.18.0
+             * @experimental
+             */
+            readonly readableDidRead: boolean;
+            /**
+             * Getter for the property `encoding` of a given `Readable` stream. The `encoding`property can be set using the `readable.setEncoding()` method.
+             * @since v12.7.0
+             */
+            readonly readableEncoding: BufferEncoding | null;
+            /**
+             * Becomes `true` when `'end'` event is emitted.
+             * @since v12.9.0
+             */
+            readonly readableEnded: boolean;
+            /**
+             * This property reflects the current state of a `Readable` stream as described
+             * in the `Three states` section.
+             * @since v9.4.0
+             */
+            readonly readableFlowing: boolean | null;
+            /**
+             * Returns the value of `highWaterMark` passed when creating this `Readable`.
+             * @since v9.3.0
+             */
+            readonly readableHighWaterMark: number;
+            /**
+             * This property contains the number of bytes (or objects) in the queue
+             * ready to be read. The value provides introspection data regarding
+             * the status of the `highWaterMark`.
+             * @since v9.4.0
+             */
+            readonly readableLength: number;
+            /**
+             * Getter for the property `objectMode` of a given `Readable` stream.
+             * @since v12.3.0
+             */
+            readonly readableObjectMode: boolean;
+            /**
+             * Is `true` after `readable.destroy()` has been called.
+             * @since v8.0.0
+             */
+            destroyed: boolean;
+            constructor(opts?: ReadableOptions);
+            _construct?(callback: (error?: Error | null) => void): void;
+            _read(size: number): void;
+            /**
+             * The `readable.read()` method pulls some data out of the internal buffer and
+             * returns it. If no data available to be read, `null` is returned. By default,
+             * the data will be returned as a `Buffer` object unless an encoding has been
+             * specified using the `readable.setEncoding()` method or the stream is operating
+             * in object mode.
+             *
+             * The optional `size` argument specifies a specific number of bytes to read. If`size` bytes are not available to be read, `null` will be returned _unless_the stream has ended, in which
+             * case all of the data remaining in the internal
+             * buffer will be returned.
+             *
+             * If the `size` argument is not specified, all of the data contained in the
+             * internal buffer will be returned.
+             *
+             * The `size` argument must be less than or equal to 1 GiB.
+             *
+             * The `readable.read()` method should only be called on `Readable` streams
+             * operating in paused mode. In flowing mode, `readable.read()` is called
+             * automatically until the internal buffer is fully drained.
+             *
+             * ```js
+             * const readable = getReadableStreamSomehow();
+             *
+             * // 'readable' may be triggered multiple times as data is buffered in
+             * readable.on('readable', () => {
+             *   let chunk;
+             *   console.log('Stream is readable (new data received in buffer)');
+             *   // Use a loop to make sure we read all currently available data
+             *   while (null !== (chunk = readable.read())) {
+             *     console.log(`Read ${chunk.length} bytes of data...`);
+             *   }
+             * });
+             *
+             * // 'end' will be triggered once when there is no more data available
+             * readable.on('end', () => {
+             *   console.log('Reached end of stream.');
+             * });
+             * ```
+             *
+             * Each call to `readable.read()` returns a chunk of data, or `null`. The chunks
+             * are not concatenated. A `while` loop is necessary to consume all data
+             * currently in the buffer. When reading a large file `.read()` may return `null`,
+             * having consumed all buffered content so far, but there is still more data to
+             * come not yet buffered. In this case a new `'readable'` event will be emitted
+             * when there is more data in the buffer. Finally the `'end'` event will be
+             * emitted when there is no more data to come.
+             *
+             * Therefore to read a file's whole contents from a `readable`, it is necessary
+             * to collect chunks across multiple `'readable'` events:
+             *
+             * ```js
+             * const chunks = [];
+             *
+             * readable.on('readable', () => {
+             *   let chunk;
+             *   while (null !== (chunk = readable.read())) {
+             *     chunks.push(chunk);
+             *   }
+             * });
+             *
+             * readable.on('end', () => {
+             *   const content = chunks.join('');
+             * });
+             * ```
+             *
+             * A `Readable` stream in object mode will always return a single item from
+             * a call to `readable.read(size)`, regardless of the value of the`size` argument.
+             *
+             * If the `readable.read()` method returns a chunk of data, a `'data'` event will
+             * also be emitted.
+             *
+             * Calling {@link read} after the `'end'` event has
+             * been emitted will return `null`. No runtime error will be raised.
+             * @since v0.9.4
+             * @param size Optional argument to specify how much data to read.
+             */
+            read(size?: number): any;
+            /**
+             * The `readable.setEncoding()` method sets the character encoding for
+             * data read from the `Readable` stream.
+             *
+             * By default, no encoding is assigned and stream data will be returned as`Buffer` objects. Setting an encoding causes the stream data
+             * to be returned as strings of the specified encoding rather than as `Buffer`objects. For instance, calling `readable.setEncoding('utf8')` will cause the
+             * output data to be interpreted as UTF-8 data, and passed as strings. Calling`readable.setEncoding('hex')` will cause the data to be encoded in hexadecimal
+             * string format.
+             *
+             * The `Readable` stream will properly handle multi-byte characters delivered
+             * through the stream that would otherwise become improperly decoded if simply
+             * pulled from the stream as `Buffer` objects.
+             *
+             * ```js
+             * const readable = getReadableStreamSomehow();
+             * readable.setEncoding('utf8');
+             * readable.on('data', (chunk) => {
+             *   assert.equal(typeof chunk, 'string');
+             *   console.log('Got %d characters of string data:', chunk.length);
+             * });
+             * ```
+             * @since v0.9.4
+             * @param encoding The encoding to use.
+             */
+            setEncoding(encoding: BufferEncoding): this;
+            /**
+             * The `readable.pause()` method will cause a stream in flowing mode to stop
+             * emitting `'data'` events, switching out of flowing mode. Any data that
+             * becomes available will remain in the internal buffer.
+             *
+             * ```js
+             * const readable = getReadableStreamSomehow();
+             * readable.on('data', (chunk) => {
+             *   console.log(`Received ${chunk.length} bytes of data.`);
+             *   readable.pause();
+             *   console.log('There will be no additional data for 1 second.');
+             *   setTimeout(() => {
+             *     console.log('Now data will start flowing again.');
+             *     readable.resume();
+             *   }, 1000);
+             * });
+             * ```
+             *
+             * The `readable.pause()` method has no effect if there is a `'readable'`event listener.
+             * @since v0.9.4
+             */
+            pause(): this;
+            /**
+             * The `readable.resume()` method causes an explicitly paused `Readable` stream to
+             * resume emitting `'data'` events, switching the stream into flowing mode.
+             *
+             * The `readable.resume()` method can be used to fully consume the data from a
+             * stream without actually processing any of that data:
+             *
+             * ```js
+             * getReadableStreamSomehow()
+             *   .resume()
+             *   .on('end', () => {
+             *     console.log('Reached the end, but did not read anything.');
+             *   });
+             * ```
+             *
+             * The `readable.resume()` method has no effect if there is a `'readable'`event listener.
+             * @since v0.9.4
+             */
+            resume(): this;
+            /**
+             * The `readable.isPaused()` method returns the current operating state of the`Readable`. This is used primarily by the mechanism that underlies the`readable.pipe()` method. In most
+             * typical cases, there will be no reason to
+             * use this method directly.
+             *
+             * ```js
+             * const readable = new stream.Readable();
+             *
+             * readable.isPaused(); // === false
+             * readable.pause();
+             * readable.isPaused(); // === true
+             * readable.resume();
+             * readable.isPaused(); // === false
+             * ```
+             * @since v0.11.14
+             */
+            isPaused(): boolean;
+            /**
+             * The `readable.unpipe()` method detaches a `Writable` stream previously attached
+             * using the {@link pipe} method.
+             *
+             * If the `destination` is not specified, then _all_ pipes are detached.
+             *
+             * If the `destination` is specified, but no pipe is set up for it, then
+             * the method does nothing.
+             *
+             * ```js
+             * const fs = require('fs');
+             * const readable = getReadableStreamSomehow();
+             * const writable = fs.createWriteStream('file.txt');
+             * // All the data from readable goes into 'file.txt',
+             * // but only for the first second.
+             * readable.pipe(writable);
+             * setTimeout(() => {
+             *   console.log('Stop writing to file.txt.');
+             *   readable.unpipe(writable);
+             *   console.log('Manually close the file stream.');
+             *   writable.end();
+             * }, 1000);
+             * ```
+             * @since v0.9.4
+             * @param destination Optional specific stream to unpipe
+             */
+            unpipe(destination?: NodeJS.WritableStream): this;
+            /**
+             * Passing `chunk` as `null` signals the end of the stream (EOF) and behaves the
+             * same as `readable.push(null)`, after which no more data can be written. The EOF
+             * signal is put at the end of the buffer and any buffered data will still be
+             * flushed.
+             *
+             * The `readable.unshift()` method pushes a chunk of data back into the internal
+             * buffer. This is useful in certain situations where a stream is being consumed by
+             * code that needs to "un-consume" some amount of data that it has optimistically
+             * pulled out of the source, so that the data can be passed on to some other party.
+             *
+             * The `stream.unshift(chunk)` method cannot be called after the `'end'` event
+             * has been emitted or a runtime error will be thrown.
+             *
+             * Developers using `stream.unshift()` often should consider switching to
+             * use of a `Transform` stream instead. See the `API for stream implementers` section for more information.
+             *
+             * ```js
+             * // Pull off a header delimited by \n\n.
+             * // Use unshift() if we get too much.
+             * // Call the callback with (error, header, stream).
+             * const { StringDecoder } = require('string_decoder');
+             * function parseHeader(stream, callback) {
+             *   stream.on('error', callback);
+             *   stream.on('readable', onReadable);
+             *   const decoder = new StringDecoder('utf8');
+             *   let header = '';
+             *   function onReadable() {
+             *     let chunk;
+             *     while (null !== (chunk = stream.read())) {
+             *       const str = decoder.write(chunk);
+             *       if (str.match(/\n\n/)) {
+             *         // Found the header boundary.
+             *         const split = str.split(/\n\n/);
+             *         header += split.shift();
+             *         const remaining = split.join('\n\n');
+             *         const buf = Buffer.from(remaining, 'utf8');
+             *         stream.removeListener('error', callback);
+             *         // Remove the 'readable' listener before unshifting.
+             *         stream.removeListener('readable', onReadable);
+             *         if (buf.length)
+             *           stream.unshift(buf);
+             *         // Now the body of the message can be read from the stream.
+             *         callback(null, header, stream);
+             *       } else {
+             *         // Still reading the header.
+             *         header += str;
+             *       }
+             *     }
+             *   }
+             * }
+             * ```
+             *
+             * Unlike {@link push}, `stream.unshift(chunk)` will not
+             * end the reading process by resetting the internal reading state of the stream.
+             * This can cause unexpected results if `readable.unshift()` is called during a
+             * read (i.e. from within a {@link _read} implementation on a
+             * custom stream). Following the call to `readable.unshift()` with an immediate {@link push} will reset the reading state appropriately,
+             * however it is best to simply avoid calling `readable.unshift()` while in the
+             * process of performing a read.
+             * @since v0.9.11
+             * @param chunk Chunk of data to unshift onto the read queue. For streams not operating in object mode, `chunk` must be a string, `Buffer`, `Uint8Array` or `null`. For object mode
+             * streams, `chunk` may be any JavaScript value.
+             * @param encoding Encoding of string chunks. Must be a valid `Buffer` encoding, such as `'utf8'` or `'ascii'`.
+             */
+            unshift(chunk: any, encoding?: BufferEncoding): void;
+            /**
+             * Prior to Node.js 0.10, streams did not implement the entire `stream` module API
+             * as it is currently defined. (See `Compatibility` for more information.)
+             *
+             * When using an older Node.js library that emits `'data'` events and has a {@link pause} method that is advisory only, the`readable.wrap()` method can be used to create a `Readable`
+             * stream that uses
+             * the old stream as its data source.
+             *
+             * It will rarely be necessary to use `readable.wrap()` but the method has been
+             * provided as a convenience for interacting with older Node.js applications and
+             * libraries.
+             *
+             * ```js
+             * const { OldReader } = require('./old-api-module.js');
+             * const { Readable } = require('stream');
+             * const oreader = new OldReader();
+             * const myReader = new Readable().wrap(oreader);
+             *
+             * myReader.on('readable', () => {
+             *   myReader.read(); // etc.
+             * });
+             * ```
+             * @since v0.9.4
+             * @param stream An "old style" readable stream
+             */
+            wrap(stream: NodeJS.ReadableStream): this;
+            push(chunk: any, encoding?: BufferEncoding): boolean;
+            _destroy(error: Error | null, callback: (error?: Error | null) => void): void;
+            /**
+             * Destroy the stream. Optionally emit an `'error'` event, and emit a `'close'`event (unless `emitClose` is set to `false`). After this call, the readable
+             * stream will release any internal resources and subsequent calls to `push()`will be ignored.
+             *
+             * Once `destroy()` has been called any further calls will be a no-op and no
+             * further errors except from `_destroy()` may be emitted as `'error'`.
+             *
+             * Implementors should not override this method, but instead implement `readable._destroy()`.
+             * @since v8.0.0
+             * @param error Error which will be passed as payload in `'error'` event
+             */
+            destroy(error?: Error): this;
+            /**
+             * Event emitter
+             * The defined events on documents including:
+             * 1. close
+             * 2. data
+             * 3. end
+             * 4. error
+             * 5. pause
+             * 6. readable
+             * 7. resume
+             */
+            addListener(event: 'close', listener: () => void): this;
+            addListener(event: 'data', listener: (chunk: any) => void): this;
+            addListener(event: 'end', listener: () => void): this;
+            addListener(event: 'error', listener: (err: Error) => void): this;
+            addListener(event: 'pause', listener: () => void): this;
+            addListener(event: 'readable', listener: () => void): this;
+            addListener(event: 'resume', listener: () => void): this;
+            addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+            emit(event: 'close'): boolean;
+            emit(event: 'data', chunk: any): boolean;
+            emit(event: 'end'): boolean;
+            emit(event: 'error', err: Error): boolean;
+            emit(event: 'pause'): boolean;
+            emit(event: 'readable'): boolean;
+            emit(event: 'resume'): boolean;
+            emit(event: string | symbol, ...args: any[]): boolean;
+            on(event: 'close', listener: () => void): this;
+            on(event: 'data', listener: (chunk: any) => void): this;
+            on(event: 'end', listener: () => void): this;
+            on(event: 'error', listener: (err: Error) => void): this;
+            on(event: 'pause', listener: () => void): this;
+            on(event: 'readable', listener: () => void): this;
+            on(event: 'resume', listener: () => void): this;
+            on(event: string | symbol, listener: (...args: any[]) => void): this;
+            once(event: 'close', listener: () => void): this;
+            once(event: 'data', listener: (chunk: any) => void): this;
+            once(event: 'end', listener: () => void): this;
+            once(event: 'error', listener: (err: Error) => void): this;
+            once(event: 'pause', listener: () => void): this;
+            once(event: 'readable', listener: () => void): this;
+            once(event: 'resume', listener: () => void): this;
+            once(event: string | symbol, listener: (...args: any[]) => void): this;
+            prependListener(event: 'close', listener: () => void): this;
+            prependListener(event: 'data', listener: (chunk: any) => void): this;
+            prependListener(event: 'end', listener: () => void): this;
+            prependListener(event: 'error', listener: (err: Error) => void): this;
+            prependListener(event: 'pause', listener: () => void): this;
+            prependListener(event: 'readable', listener: () => void): this;
+            prependListener(event: 'resume', listener: () => void): this;
+            prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+            prependOnceListener(event: 'close', listener: () => void): this;
+            prependOnceListener(event: 'data', listener: (chunk: any) => void): this;
+            prependOnceListener(event: 'end', listener: () => void): this;
+            prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+            prependOnceListener(event: 'pause', listener: () => void): this;
+            prependOnceListener(event: 'readable', listener: () => void): this;
+            prependOnceListener(event: 'resume', listener: () => void): this;
+            prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+            removeListener(event: 'close', listener: () => void): this;
+            removeListener(event: 'data', listener: (chunk: any) => void): this;
+            removeListener(event: 'end', listener: () => void): this;
+            removeListener(event: 'error', listener: (err: Error) => void): this;
+            removeListener(event: 'pause', listener: () => void): this;
+            removeListener(event: 'readable', listener: () => void): this;
+            removeListener(event: 'resume', listener: () => void): this;
+            removeListener(event: string | symbol, listener: (...args: any[]) => void): this;
+            [Symbol.asyncIterator](): AsyncIterableIterator<any>;
+        }
+        interface WritableOptions extends StreamOptions<Writable> {
+            decodeStrings?: boolean | undefined;
+            defaultEncoding?: BufferEncoding | undefined;
+            write?(this: Writable, chunk: any, encoding: BufferEncoding, callback: (error?: Error | null) => void): void;
+            writev?(
+                this: Writable,
+                chunks: Array<{
+                    chunk: any;
+                    encoding: BufferEncoding;
+                }>,
+                callback: (error?: Error | null) => void
+            ): void;
+            final?(this: Writable, callback: (error?: Error | null) => void): void;
+        }
+        /**
+         * @since v0.9.4
+         */
+        class Writable extends Stream implements NodeJS.WritableStream {
+            /**
+             * Is `true` if it is safe to call `writable.write()`, which means
+             * the stream has not been destroyed, errored or ended.
+             * @since v11.4.0
+             */
+            readonly writable: boolean;
+            /**
+             * Is `true` after `writable.end()` has been called. This property
+             * does not indicate whether the data has been flushed, for this use `writable.writableFinished` instead.
+             * @since v12.9.0
+             */
+            readonly writableEnded: boolean;
+            /**
+             * Is set to `true` immediately before the `'finish'` event is emitted.
+             * @since v12.6.0
+             */
+            readonly writableFinished: boolean;
+            /**
+             * Return the value of `highWaterMark` passed when creating this `Writable`.
+             * @since v9.3.0
+             */
+            readonly writableHighWaterMark: number;
+            /**
+             * This property contains the number of bytes (or objects) in the queue
+             * ready to be written. The value provides introspection data regarding
+             * the status of the `highWaterMark`.
+             * @since v9.4.0
+             */
+            readonly writableLength: number;
+            /**
+             * Getter for the property `objectMode` of a given `Writable` stream.
+             * @since v12.3.0
+             */
+            readonly writableObjectMode: boolean;
+            /**
+             * Number of times `writable.uncork()` needs to be
+             * called in order to fully uncork the stream.
+             * @since v13.2.0, v12.16.0
+             */
+            readonly writableCorked: number;
+            /**
+             * Is `true` after `writable.destroy()` has been called.
+             * @since v8.0.0
+             */
+            destroyed: boolean;
+            constructor(opts?: WritableOptions);
+            _write(chunk: any, encoding: BufferEncoding, callback: (error?: Error | null) => void): void;
+            _writev?(
+                chunks: Array<{
+                    chunk: any;
+                    encoding: BufferEncoding;
+                }>,
+                callback: (error?: Error | null) => void
+            ): void;
+            _construct?(callback: (error?: Error | null) => void): void;
+            _destroy(error: Error | null, callback: (error?: Error | null) => void): void;
+            _final(callback: (error?: Error | null) => void): void;
+            /**
+             * The `writable.write()` method writes some data to the stream, and calls the
+             * supplied `callback` once the data has been fully handled. If an error
+             * occurs, the `callback` will be called with the error as its
+             * first argument. The `callback` is called asynchronously and before `'error'` is
+             * emitted.
+             *
+             * The return value is `true` if the internal buffer is less than the`highWaterMark` configured when the stream was created after admitting `chunk`.
+             * If `false` is returned, further attempts to write data to the stream should
+             * stop until the `'drain'` event is emitted.
+             *
+             * While a stream is not draining, calls to `write()` will buffer `chunk`, and
+             * return false. Once all currently buffered chunks are drained (accepted for
+             * delivery by the operating system), the `'drain'` event will be emitted.
+             * It is recommended that once `write()` returns false, no more chunks be written
+             * until the `'drain'` event is emitted. While calling `write()` on a stream that
+             * is not draining is allowed, Node.js will buffer all written chunks until
+             * maximum memory usage occurs, at which point it will abort unconditionally.
+             * Even before it aborts, high memory usage will cause poor garbage collector
+             * performance and high RSS (which is not typically released back to the system,
+             * even after the memory is no longer required). Since TCP sockets may never
+             * drain if the remote peer does not read the data, writing a socket that is
+             * not draining may lead to a remotely exploitable vulnerability.
+             *
+             * Writing data while the stream is not draining is particularly
+             * problematic for a `Transform`, because the `Transform` streams are paused
+             * by default until they are piped or a `'data'` or `'readable'` event handler
+             * is added.
+             *
+             * If the data to be written can be generated or fetched on demand, it is
+             * recommended to encapsulate the logic into a `Readable` and use {@link pipe}. However, if calling `write()` is preferred, it is
+             * possible to respect backpressure and avoid memory issues using the `'drain'` event:
+             *
+             * ```js
+             * function write(data, cb) {
+             *   if (!stream.write(data)) {
+             *     stream.once('drain', cb);
+             *   } else {
+             *     process.nextTick(cb);
+             *   }
+             * }
+             *
+             * // Wait for cb to be called before doing any other write.
+             * write('hello', () => {
+             *   console.log('Write completed, do more writes now.');
+             * });
+             * ```
+             *
+             * A `Writable` stream in object mode will always ignore the `encoding` argument.
+             * @since v0.9.4
+             * @param chunk Optional data to write. For streams not operating in object mode, `chunk` must be a string, `Buffer` or `Uint8Array`. For object mode streams, `chunk` may be any
+             * JavaScript value other than `null`.
+             * @param [encoding='utf8'] The encoding, if `chunk` is a string.
+             * @param callback Callback for when this chunk of data is flushed.
+             * @return `false` if the stream wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+             */
+            write(chunk: any, callback?: (error: Error | null | undefined) => void): boolean;
+            write(chunk: any, encoding: BufferEncoding, callback?: (error: Error | null | undefined) => void): boolean;
+            /**
+             * The `writable.setDefaultEncoding()` method sets the default `encoding` for a `Writable` stream.
+             * @since v0.11.15
+             * @param encoding The new default encoding
+             */
+            setDefaultEncoding(encoding: BufferEncoding): this;
+            /**
+             * Calling the `writable.end()` method signals that no more data will be written
+             * to the `Writable`. The optional `chunk` and `encoding` arguments allow one
+             * final additional chunk of data to be written immediately before closing the
+             * stream.
+             *
+             * Calling the {@link write} method after calling {@link end} will raise an error.
+             *
+             * ```js
+             * // Write 'hello, ' and then end with 'world!'.
+             * const fs = require('fs');
+             * const file = fs.createWriteStream('example.txt');
+             * file.write('hello, ');
+             * file.end('world!');
+             * // Writing more now is not allowed!
+             * ```
+             * @since v0.9.4
+             * @param chunk Optional data to write. For streams not operating in object mode, `chunk` must be a string, `Buffer` or `Uint8Array`. For object mode streams, `chunk` may be any
+             * JavaScript value other than `null`.
+             * @param encoding The encoding if `chunk` is a string
+             * @param callback Callback for when the stream is finished.
+             */
+            end(cb?: () => void): this;
+            end(chunk: any, cb?: () => void): this;
+            end(chunk: any, encoding: BufferEncoding, cb?: () => void): this;
+            /**
+             * The `writable.cork()` method forces all written data to be buffered in memory.
+             * The buffered data will be flushed when either the {@link uncork} or {@link end} methods are called.
+             *
+             * The primary intent of `writable.cork()` is to accommodate a situation in which
+             * several small chunks are written to the stream in rapid succession. Instead of
+             * immediately forwarding them to the underlying destination, `writable.cork()`buffers all the chunks until `writable.uncork()` is called, which will pass them
+             * all to `writable._writev()`, if present. This prevents a head-of-line blocking
+             * situation where data is being buffered while waiting for the first small chunk
+             * to be processed. However, use of `writable.cork()` without implementing`writable._writev()` may have an adverse effect on throughput.
+             *
+             * See also: `writable.uncork()`, `writable._writev()`.
+             * @since v0.11.2
+             */
+            cork(): void;
+            /**
+             * The `writable.uncork()` method flushes all data buffered since {@link cork} was called.
+             *
+             * When using `writable.cork()` and `writable.uncork()` to manage the buffering
+             * of writes to a stream, it is recommended that calls to `writable.uncork()` be
+             * deferred using `process.nextTick()`. Doing so allows batching of all`writable.write()` calls that occur within a given Node.js event loop phase.
+             *
+             * ```js
+             * stream.cork();
+             * stream.write('some ');
+             * stream.write('data ');
+             * process.nextTick(() => stream.uncork());
+             * ```
+             *
+             * If the `writable.cork()` method is called multiple times on a stream, the
+             * same number of calls to `writable.uncork()` must be called to flush the buffered
+             * data.
+             *
+             * ```js
+             * stream.cork();
+             * stream.write('some ');
+             * stream.cork();
+             * stream.write('data ');
+             * process.nextTick(() => {
+             *   stream.uncork();
+             *   // The data will not be flushed until uncork() is called a second time.
+             *   stream.uncork();
+             * });
+             * ```
+             *
+             * See also: `writable.cork()`.
+             * @since v0.11.2
+             */
+            uncork(): void;
+            /**
+             * Destroy the stream. Optionally emit an `'error'` event, and emit a `'close'`event (unless `emitClose` is set to `false`). After this call, the writable
+             * stream has ended and subsequent calls to `write()` or `end()` will result in
+             * an `ERR_STREAM_DESTROYED` error.
+             * This is a destructive and immediate way to destroy a stream. Previous calls to`write()` may not have drained, and may trigger an `ERR_STREAM_DESTROYED` error.
+             * Use `end()` instead of destroy if data should flush before close, or wait for
+             * the `'drain'` event before destroying the stream.
+             *
+             * Once `destroy()` has been called any further calls will be a no-op and no
+             * further errors except from `_destroy()` may be emitted as `'error'`.
+             *
+             * Implementors should not override this method,
+             * but instead implement `writable._destroy()`.
+             * @since v8.0.0
+             * @param error Optional, an error to emit with `'error'` event.
+             */
+            destroy(error?: Error): this;
+            /**
+             * Event emitter
+             * The defined events on documents including:
+             * 1. close
+             * 2. drain
+             * 3. error
+             * 4. finish
+             * 5. pipe
+             * 6. unpipe
+             */
+            addListener(event: 'close', listener: () => void): this;
+            addListener(event: 'drain', listener: () => void): this;
+            addListener(event: 'error', listener: (err: Error) => void): this;
+            addListener(event: 'finish', listener: () => void): this;
+            addListener(event: 'pipe', listener: (src: Readable) => void): this;
+            addListener(event: 'unpipe', listener: (src: Readable) => void): this;
+            addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+            emit(event: 'close'): boolean;
+            emit(event: 'drain'): boolean;
+            emit(event: 'error', err: Error): boolean;
+            emit(event: 'finish'): boolean;
+            emit(event: 'pipe', src: Readable): boolean;
+            emit(event: 'unpipe', src: Readable): boolean;
+            emit(event: string | symbol, ...args: any[]): boolean;
+            on(event: 'close', listener: () => void): this;
+            on(event: 'drain', listener: () => void): this;
+            on(event: 'error', listener: (err: Error) => void): this;
+            on(event: 'finish', listener: () => void): this;
+            on(event: 'pipe', listener: (src: Readable) => void): this;
+            on(event: 'unpipe', listener: (src: Readable) => void): this;
+            on(event: string | symbol, listener: (...args: any[]) => void): this;
+            once(event: 'close', listener: () => void): this;
+            once(event: 'drain', listener: () => void): this;
+            once(event: 'error', listener: (err: Error) => void): this;
+            once(event: 'finish', listener: () => void): this;
+            once(event: 'pipe', listener: (src: Readable) => void): this;
+            once(event: 'unpipe', listener: (src: Readable) => void): this;
+            once(event: string | symbol, listener: (...args: any[]) => void): this;
+            prependListener(event: 'close', listener: () => void): this;
+            prependListener(event: 'drain', listener: () => void): this;
+            prependListener(event: 'error', listener: (err: Error) => void): this;
+            prependListener(event: 'finish', listener: () => void): this;
+            prependListener(event: 'pipe', listener: (src: Readable) => void): this;
+            prependListener(event: 'unpipe', listener: (src: Readable) => void): this;
+            prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+            prependOnceListener(event: 'close', listener: () => void): this;
+            prependOnceListener(event: 'drain', listener: () => void): this;
+            prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+            prependOnceListener(event: 'finish', listener: () => void): this;
+            prependOnceListener(event: 'pipe', listener: (src: Readable) => void): this;
+            prependOnceListener(event: 'unpipe', listener: (src: Readable) => void): this;
+            prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+            removeListener(event: 'close', listener: () => void): this;
+            removeListener(event: 'drain', listener: () => void): this;
+            removeListener(event: 'error', listener: (err: Error) => void): this;
+            removeListener(event: 'finish', listener: () => void): this;
+            removeListener(event: 'pipe', listener: (src: Readable) => void): this;
+            removeListener(event: 'unpipe', listener: (src: Readable) => void): this;
+            removeListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        }
+        interface DuplexOptions extends ReadableOptions, WritableOptions {
+            allowHalfOpen?: boolean | undefined;
+            readableObjectMode?: boolean | undefined;
+            writableObjectMode?: boolean | undefined;
+            readableHighWaterMark?: number | undefined;
+            writableHighWaterMark?: number | undefined;
+            writableCorked?: number | undefined;
+            construct?(this: Duplex, callback: (error?: Error | null) => void): void;
+            read?(this: Duplex, size: number): void;
+            write?(this: Duplex, chunk: any, encoding: BufferEncoding, callback: (error?: Error | null) => void): void;
+            writev?(
+                this: Duplex,
+                chunks: Array<{
+                    chunk: any;
+                    encoding: BufferEncoding;
+                }>,
+                callback: (error?: Error | null) => void
+            ): void;
+            final?(this: Duplex, callback: (error?: Error | null) => void): void;
+            destroy?(this: Duplex, error: Error | null, callback: (error: Error | null) => void): void;
+        }
+        /**
+         * Duplex streams are streams that implement both the `Readable` and `Writable` interfaces.
+         *
+         * Examples of `Duplex` streams include:
+         *
+         * * `TCP sockets`
+         * * `zlib streams`
+         * * `crypto streams`
+         * @since v0.9.4
+         */
+        class Duplex extends Readable implements Writable {
+            readonly writable: boolean;
+            readonly writableEnded: boolean;
+            readonly writableFinished: boolean;
+            readonly writableHighWaterMark: number;
+            readonly writableLength: number;
+            readonly writableObjectMode: boolean;
+            readonly writableCorked: number;
+            /**
+             * If `false` then the stream will automatically end the writable side when the
+             * readable side ends. Set initially by the `allowHalfOpen` constructor option,
+             * which defaults to `false`.
+             *
+             * This can be changed manually to change the half-open behavior of an existing`Duplex` stream instance, but must be changed before the `'end'` event is
+             * emitted.
+             * @since v0.9.4
+             */
+            allowHalfOpen: boolean;
+            constructor(opts?: DuplexOptions);
+            /**
+             * A utility method for creating duplex streams.
+             *
+             * - `Stream` converts writable stream into writable `Duplex` and readable stream
+             *   to `Duplex`.
+             * - `Blob` converts into readable `Duplex`.
+             * - `string` converts into readable `Duplex`.
+             * - `ArrayBuffer` converts into readable `Duplex`.
+             * - `AsyncIterable` converts into a readable `Duplex`. Cannot yield `null`.
+             * - `AsyncGeneratorFunction` converts into a readable/writable transform
+             *   `Duplex`. Must take a source `AsyncIterable` as first parameter. Cannot yield
+             *   `null`.
+             * - `AsyncFunction` converts into a writable `Duplex`. Must return
+             *   either `null` or `undefined`
+             * - `Object ({ writable, readable })` converts `readable` and
+             *   `writable` into `Stream` and then combines them into `Duplex` where the
+             *   `Duplex` will write to the `writable` and read from the `readable`.
+             * - `Promise` converts into readable `Duplex`. Value `null` is ignored.
+             *
+             * @since v16.8.0
+             */
+            static from(src: Stream | Blob | ArrayBuffer | string | Iterable<any> | AsyncIterable<any> | AsyncGeneratorFunction | Promise<any> | Object): Duplex;
+            _write(chunk: any, encoding: BufferEncoding, callback: (error?: Error | null) => void): void;
+            _writev?(
+                chunks: Array<{
+                    chunk: any;
+                    encoding: BufferEncoding;
+                }>,
+                callback: (error?: Error | null) => void
+            ): void;
+            _destroy(error: Error | null, callback: (error: Error | null) => void): void;
+            _final(callback: (error?: Error | null) => void): void;
+            write(chunk: any, encoding?: BufferEncoding, cb?: (error: Error | null | undefined) => void): boolean;
+            write(chunk: any, cb?: (error: Error | null | undefined) => void): boolean;
+            setDefaultEncoding(encoding: BufferEncoding): this;
+            end(cb?: () => void): this;
+            end(chunk: any, cb?: () => void): this;
+            end(chunk: any, encoding?: BufferEncoding, cb?: () => void): this;
+            cork(): void;
+            uncork(): void;
+        }
+        type TransformCallback = (error?: Error | null, data?: any) => void;
+        interface TransformOptions extends DuplexOptions {
+            construct?(this: Transform, callback: (error?: Error | null) => void): void;
+            read?(this: Transform, size: number): void;
+            write?(this: Transform, chunk: any, encoding: BufferEncoding, callback: (error?: Error | null) => void): void;
+            writev?(
+                this: Transform,
+                chunks: Array<{
+                    chunk: any;
+                    encoding: BufferEncoding;
+                }>,
+                callback: (error?: Error | null) => void
+            ): void;
+            final?(this: Transform, callback: (error?: Error | null) => void): void;
+            destroy?(this: Transform, error: Error | null, callback: (error: Error | null) => void): void;
+            transform?(this: Transform, chunk: any, encoding: BufferEncoding, callback: TransformCallback): void;
+            flush?(this: Transform, callback: TransformCallback): void;
+        }
+        /**
+         * Transform streams are `Duplex` streams where the output is in some way
+         * related to the input. Like all `Duplex` streams, `Transform` streams
+         * implement both the `Readable` and `Writable` interfaces.
+         *
+         * Examples of `Transform` streams include:
+         *
+         * * `zlib streams`
+         * * `crypto streams`
+         * @since v0.9.4
+         */
+        class Transform extends Duplex {
+            constructor(opts?: TransformOptions);
+            _transform(chunk: any, encoding: BufferEncoding, callback: TransformCallback): void;
+            _flush(callback: TransformCallback): void;
+        }
+        /**
+         * The `stream.PassThrough` class is a trivial implementation of a `Transform` stream that simply passes the input bytes across to the output. Its purpose is
+         * primarily for examples and testing, but there are some use cases where`stream.PassThrough` is useful as a building block for novel sorts of streams.
+         */
+        class PassThrough extends Transform {}
+        /**
+         * Attaches an AbortSignal to a readable or writeable stream. This lets code
+         * control stream destruction using an `AbortController`.
+         *
+         * Calling `abort` on the `AbortController` corresponding to the passed`AbortSignal` will behave the same way as calling `.destroy(new AbortError())`on the stream.
+         *
+         * ```js
+         * const fs = require('fs');
+         *
+         * const controller = new AbortController();
+         * const read = addAbortSignal(
+         *   controller.signal,
+         *   fs.createReadStream(('object.json'))
+         * );
+         * // Later, abort the operation closing the stream
+         * controller.abort();
+         * ```
+         *
+         * Or using an `AbortSignal` with a readable stream as an async iterable:
+         *
+         * ```js
+         * const controller = new AbortController();
+         * setTimeout(() => controller.abort(), 10_000); // set a timeout
+         * const stream = addAbortSignal(
+         *   controller.signal,
+         *   fs.createReadStream(('object.json'))
+         * );
+         * (async () => {
+         *   try {
+         *     for await (const chunk of stream) {
+         *       await process(chunk);
+         *     }
+         *   } catch (e) {
+         *     if (e.name === 'AbortError') {
+         *       // The operation was cancelled
+         *     } else {
+         *       throw e;
+         *     }
+         *   }
+         * })();
+         * ```
+         * @since v15.4.0
+         * @param signal A signal representing possible cancellation
+         * @param stream a stream to attach a signal to
+         */
+        function addAbortSignal<T extends Stream>(signal: AbortSignal, stream: T): T;
+        interface FinishedOptions extends Abortable {
+            error?: boolean | undefined;
+            readable?: boolean | undefined;
+            writable?: boolean | undefined;
+        }
+        /**
+         * A function to get notified when a stream is no longer readable, writable
+         * or has experienced an error or a premature close event.
+         *
+         * ```js
+         * const { finished } = require('stream');
+         *
+         * const rs = fs.createReadStream('archive.tar');
+         *
+         * finished(rs, (err) => {
+         *   if (err) {
+         *     console.error('Stream failed.', err);
+         *   } else {
+         *     console.log('Stream is done reading.');
+         *   }
+         * });
+         *
+         * rs.resume(); // Drain the stream.
+         * ```
+         *
+         * Especially useful in error handling scenarios where a stream is destroyed
+         * prematurely (like an aborted HTTP request), and will not emit `'end'`or `'finish'`.
+         *
+         * The `finished` API provides promise version:
+         *
+         * ```js
+         * const { finished } = require('stream/promises');
+         *
+         * const rs = fs.createReadStream('archive.tar');
+         *
+         * async function run() {
+         *   await finished(rs);
+         *   console.log('Stream is done reading.');
+         * }
+         *
+         * run().catch(console.error);
+         * rs.resume(); // Drain the stream.
+         * ```
+         *
+         * `stream.finished()` leaves dangling event listeners (in particular`'error'`, `'end'`, `'finish'` and `'close'`) after `callback` has been
+         * invoked. The reason for this is so that unexpected `'error'` events (due to
+         * incorrect stream implementations) do not cause unexpected crashes.
+         * If this is unwanted behavior then the returned cleanup function needs to be
+         * invoked in the callback:
+         *
+         * ```js
+         * const cleanup = finished(rs, (err) => {
+         *   cleanup();
+         *   // ...
+         * });
+         * ```
+         * @since v10.0.0
+         * @param stream A readable and/or writable stream.
+         * @param callback A callback function that takes an optional error argument.
+         * @return A cleanup function which removes all registered listeners.
+         */
+        function finished(stream: NodeJS.ReadableStream | NodeJS.WritableStream | NodeJS.ReadWriteStream, options: FinishedOptions, callback: (err?: NodeJS.ErrnoException | null) => void): () => void;
+        function finished(stream: NodeJS.ReadableStream | NodeJS.WritableStream | NodeJS.ReadWriteStream, callback: (err?: NodeJS.ErrnoException | null) => void): () => void;
+        namespace finished {
+            function __promisify__(stream: NodeJS.ReadableStream | NodeJS.WritableStream | NodeJS.ReadWriteStream, options?: FinishedOptions): Promise<void>;
+        }
+        type PipelineSourceFunction<T> = () => Iterable<T> | AsyncIterable<T>;
+        type PipelineSource<T> = Iterable<T> | AsyncIterable<T> | NodeJS.ReadableStream | PipelineSourceFunction<T>;
+        type PipelineTransform<S extends PipelineTransformSource<any>, U> =
+            | NodeJS.ReadWriteStream
+            | ((source: S extends (...args: any[]) => Iterable<infer ST> | AsyncIterable<infer ST> ? AsyncIterable<ST> : S) => AsyncIterable<U>);
+        type PipelineTransformSource<T> = PipelineSource<T> | PipelineTransform<any, T>;
+        type PipelineDestinationIterableFunction<T> = (source: AsyncIterable<T>) => AsyncIterable<any>;
+        type PipelineDestinationPromiseFunction<T, P> = (source: AsyncIterable<T>) => Promise<P>;
+        type PipelineDestination<S extends PipelineTransformSource<any>, P> = S extends PipelineTransformSource<infer ST>
+            ? NodeJS.WritableStream | PipelineDestinationIterableFunction<ST> | PipelineDestinationPromiseFunction<ST, P>
+            : never;
+        type PipelineCallback<S extends PipelineDestination<any, any>> = S extends PipelineDestinationPromiseFunction<any, infer P>
+            ? (err: NodeJS.ErrnoException | null, value: P) => void
+            : (err: NodeJS.ErrnoException | null) => void;
+        type PipelinePromise<S extends PipelineDestination<any, any>> = S extends PipelineDestinationPromiseFunction<any, infer P> ? Promise<P> : Promise<void>;
+        interface PipelineOptions {
+            signal: AbortSignal;
+        }
+        /**
+         * A module method to pipe between streams and generators forwarding errors and
+         * properly cleaning up and provide a callback when the pipeline is complete.
+         *
+         * ```js
+         * const { pipeline } = require('stream');
+         * const fs = require('fs');
+         * const zlib = require('zlib');
+         *
+         * // Use the pipeline API to easily pipe a series of streams
+         * // together and get notified when the pipeline is fully done.
+         *
+         * // A pipeline to gzip a potentially huge tar file efficiently:
+         *
+         * pipeline(
+         *   fs.createReadStream('archive.tar'),
+         *   zlib.createGzip(),
+         *   fs.createWriteStream('archive.tar.gz'),
+         *   (err) => {
+         *     if (err) {
+         *       console.error('Pipeline failed.', err);
+         *     } else {
+         *       console.log('Pipeline succeeded.');
+         *     }
+         *   }
+         * );
+         * ```
+         *
+         * The `pipeline` API provides a promise version, which can also
+         * receive an options argument as the last parameter with a`signal` `AbortSignal` property. When the signal is aborted,`destroy` will be called on the underlying pipeline, with
+         * an`AbortError`.
+         *
+         * ```js
+         * const { pipeline } = require('stream/promises');
+         *
+         * async function run() {
+         *   await pipeline(
+         *     fs.createReadStream('archive.tar'),
+         *     zlib.createGzip(),
+         *     fs.createWriteStream('archive.tar.gz')
+         *   );
+         *   console.log('Pipeline succeeded.');
+         * }
+         *
+         * run().catch(console.error);
+         * ```
+         *
+         * To use an `AbortSignal`, pass it inside an options object,
+         * as the last argument:
+         *
+         * ```js
+         * const { pipeline } = require('stream/promises');
+         *
+         * async function run() {
+         *   const ac = new AbortController();
+         *   const signal = ac.signal;
+         *
+         *   setTimeout(() => ac.abort(), 1);
+         *   await pipeline(
+         *     fs.createReadStream('archive.tar'),
+         *     zlib.createGzip(),
+         *     fs.createWriteStream('archive.tar.gz'),
+         *     { signal },
+         *   );
+         * }
+         *
+         * run().catch(console.error); // AbortError
+         * ```
+         *
+         * The `pipeline` API also supports async generators:
+         *
+         * ```js
+         * const { pipeline } = require('stream/promises');
+         * const fs = require('fs');
+         *
+         * async function run() {
+         *   await pipeline(
+         *     fs.createReadStream('lowercase.txt'),
+         *     async function* (source, signal) {
+         *       source.setEncoding('utf8');  // Work with strings rather than `Buffer`s.
+         *       for await (const chunk of source) {
+         *         yield await processChunk(chunk, { signal });
+         *       }
+         *     },
+         *     fs.createWriteStream('uppercase.txt')
+         *   );
+         *   console.log('Pipeline succeeded.');
+         * }
+         *
+         * run().catch(console.error);
+         * ```
+         *
+         * Remember to handle the `signal` argument passed into the async generator.
+         * Especially in the case where the async generator is the source for the
+         * pipeline (i.e. first argument) or the pipeline will never complete.
+         *
+         * ```js
+         * const { pipeline } = require('stream/promises');
+         * const fs = require('fs');
+         *
+         * async function run() {
+         *   await pipeline(
+         *     async function * (signal) {
+         *       await someLongRunningfn({ signal });
+         *       yield 'asd';
+         *     },
+         *     fs.createWriteStream('uppercase.txt')
+         *   );
+         *   console.log('Pipeline succeeded.');
+         * }
+         *
+         * run().catch(console.error);
+         * ```
+         *
+         * `stream.pipeline()` will call `stream.destroy(err)` on all streams except:
+         *
+         * * `Readable` streams which have emitted `'end'` or `'close'`.
+         * * `Writable` streams which have emitted `'finish'` or `'close'`.
+         *
+         * `stream.pipeline()` leaves dangling event listeners on the streams
+         * after the `callback` has been invoked. In the case of reuse of streams after
+         * failure, this can cause event listener leaks and swallowed errors.
+         * @since v10.0.0
+         * @param callback Called when the pipeline is fully done.
+         */
+        function pipeline<A extends PipelineSource<any>, B extends PipelineDestination<A, any>>(
+            source: A,
+            destination: B,
+            callback?: PipelineCallback<B>
+        ): B extends NodeJS.WritableStream ? B : NodeJS.WritableStream;
+        function pipeline<A extends PipelineSource<any>, T1 extends PipelineTransform<A, any>, B extends PipelineDestination<T1, any>>(
+            source: A,
+            transform1: T1,
+            destination: B,
+            callback?: PipelineCallback<B>
+        ): B extends NodeJS.WritableStream ? B : NodeJS.WritableStream;
+        function pipeline<A extends PipelineSource<any>, T1 extends PipelineTransform<A, any>, T2 extends PipelineTransform<T1, any>, B extends PipelineDestination<T2, any>>(
+            source: A,
+            transform1: T1,
+            transform2: T2,
+            destination: B,
+            callback?: PipelineCallback<B>
+        ): B extends NodeJS.WritableStream ? B : NodeJS.WritableStream;
+        function pipeline<
+            A extends PipelineSource<any>,
+            T1 extends PipelineTransform<A, any>,
+            T2 extends PipelineTransform<T1, any>,
+            T3 extends PipelineTransform<T2, any>,
+            B extends PipelineDestination<T3, any>
+        >(source: A, transform1: T1, transform2: T2, transform3: T3, destination: B, callback?: PipelineCallback<B>): B extends NodeJS.WritableStream ? B : NodeJS.WritableStream;
+        function pipeline<
+            A extends PipelineSource<any>,
+            T1 extends PipelineTransform<A, any>,
+            T2 extends PipelineTransform<T1, any>,
+            T3 extends PipelineTransform<T2, any>,
+            T4 extends PipelineTransform<T3, any>,
+            B extends PipelineDestination<T4, any>
+        >(source: A, transform1: T1, transform2: T2, transform3: T3, transform4: T4, destination: B, callback?: PipelineCallback<B>): B extends NodeJS.WritableStream ? B : NodeJS.WritableStream;
+        function pipeline(
+            streams: ReadonlyArray<NodeJS.ReadableStream | NodeJS.WritableStream | NodeJS.ReadWriteStream>,
+            callback?: (err: NodeJS.ErrnoException | null) => void
+        ): NodeJS.WritableStream;
+        function pipeline(
+            stream1: NodeJS.ReadableStream,
+            stream2: NodeJS.ReadWriteStream | NodeJS.WritableStream,
+            ...streams: Array<NodeJS.ReadWriteStream | NodeJS.WritableStream | ((err: NodeJS.ErrnoException | null) => void)>
+        ): NodeJS.WritableStream;
+        namespace pipeline {
+            function __promisify__<A extends PipelineSource<any>, B extends PipelineDestination<A, any>>(source: A, destination: B, options?: PipelineOptions): PipelinePromise<B>;
+            function __promisify__<A extends PipelineSource<any>, T1 extends PipelineTransform<A, any>, B extends PipelineDestination<T1, any>>(
+                source: A,
+                transform1: T1,
+                destination: B,
+                options?: PipelineOptions
+            ): PipelinePromise<B>;
+            function __promisify__<A extends PipelineSource<any>, T1 extends PipelineTransform<A, any>, T2 extends PipelineTransform<T1, any>, B extends PipelineDestination<T2, any>>(
+                source: A,
+                transform1: T1,
+                transform2: T2,
+                destination: B,
+                options?: PipelineOptions
+            ): PipelinePromise<B>;
+            function __promisify__<
+                A extends PipelineSource<any>,
+                T1 extends PipelineTransform<A, any>,
+                T2 extends PipelineTransform<T1, any>,
+                T3 extends PipelineTransform<T2, any>,
+                B extends PipelineDestination<T3, any>
+            >(source: A, transform1: T1, transform2: T2, transform3: T3, destination: B, options?: PipelineOptions): PipelinePromise<B>;
+            function __promisify__<
+                A extends PipelineSource<any>,
+                T1 extends PipelineTransform<A, any>,
+                T2 extends PipelineTransform<T1, any>,
+                T3 extends PipelineTransform<T2, any>,
+                T4 extends PipelineTransform<T3, any>,
+                B extends PipelineDestination<T4, any>
+            >(source: A, transform1: T1, transform2: T2, transform3: T3, transform4: T4, destination: B, options?: PipelineOptions): PipelinePromise<B>;
+            function __promisify__(streams: ReadonlyArray<NodeJS.ReadableStream | NodeJS.WritableStream | NodeJS.ReadWriteStream>, options?: PipelineOptions): Promise<void>;
+            function __promisify__(
+                stream1: NodeJS.ReadableStream,
+                stream2: NodeJS.ReadWriteStream | NodeJS.WritableStream,
+                ...streams: Array<NodeJS.ReadWriteStream | NodeJS.WritableStream | PipelineOptions>
+            ): Promise<void>;
+        }
+        interface Pipe {
+            close(): void;
+            hasRef(): boolean;
+            ref(): void;
+            unref(): void;
+        }
+        const promises: typeof streamPromises;
+        const consumers: typeof streamConsumers;
+    }
+    export = internal;
+}
+declare module 'node:stream' {
+    import stream = require('stream');
+    export = stream;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/stream/consumers.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/stream/consumers.d.ts
new file mode 100644
index 0000000..ce6c9bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/stream/consumers.d.ts
@@ -0,0 +1,24 @@
+// Duplicates of interface in lib.dom.ts.
+// Duplicated here rather than referencing lib.dom.ts because doing so causes lib.dom.ts to be loaded for "test-all"
+// Which in turn causes tests to pass that shouldn't pass.
+//
+// This interface is not, and should not be, exported.
+interface Blob {
+    readonly size: number;
+    readonly type: string;
+    arrayBuffer(): Promise<ArrayBuffer>;
+    slice(start?: number, end?: number, contentType?: string): Blob;
+    stream(): NodeJS.ReadableStream;
+    text(): Promise<string>;
+}
+declare module 'stream/consumers' {
+    import { Readable } from 'node:stream';
+    function buffer(stream: NodeJS.ReadableStream | Readable | AsyncIterator<any>): Promise<Buffer>;
+    function text(stream: NodeJS.ReadableStream | Readable | AsyncIterator<any>): Promise<string>;
+    function arrayBuffer(stream: NodeJS.ReadableStream | Readable | AsyncIterator<any>): Promise<ArrayBuffer>;
+    function blob(stream: NodeJS.ReadableStream | Readable | AsyncIterator<any>): Promise<Blob>;
+    function json(stream: NodeJS.ReadableStream | Readable | AsyncIterator<any>): Promise<unknown>;
+}
+declare module 'node:stream/consumers' {
+    export * from 'stream/consumers';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/stream/promises.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/stream/promises.d.ts
new file mode 100644
index 0000000..b427073
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/stream/promises.d.ts
@@ -0,0 +1,42 @@
+declare module 'stream/promises' {
+    import { FinishedOptions, PipelineSource, PipelineTransform, PipelineDestination, PipelinePromise, PipelineOptions } from 'node:stream';
+    function finished(stream: NodeJS.ReadableStream | NodeJS.WritableStream | NodeJS.ReadWriteStream, options?: FinishedOptions): Promise<void>;
+    function pipeline<A extends PipelineSource<any>, B extends PipelineDestination<A, any>>(source: A, destination: B, options?: PipelineOptions): PipelinePromise<B>;
+    function pipeline<A extends PipelineSource<any>, T1 extends PipelineTransform<A, any>, B extends PipelineDestination<T1, any>>(
+        source: A,
+        transform1: T1,
+        destination: B,
+        options?: PipelineOptions
+    ): PipelinePromise<B>;
+    function pipeline<A extends PipelineSource<any>, T1 extends PipelineTransform<A, any>, T2 extends PipelineTransform<T1, any>, B extends PipelineDestination<T2, any>>(
+        source: A,
+        transform1: T1,
+        transform2: T2,
+        destination: B,
+        options?: PipelineOptions
+    ): PipelinePromise<B>;
+    function pipeline<
+        A extends PipelineSource<any>,
+        T1 extends PipelineTransform<A, any>,
+        T2 extends PipelineTransform<T1, any>,
+        T3 extends PipelineTransform<T2, any>,
+        B extends PipelineDestination<T3, any>
+    >(source: A, transform1: T1, transform2: T2, transform3: T3, destination: B, options?: PipelineOptions): PipelinePromise<B>;
+    function pipeline<
+        A extends PipelineSource<any>,
+        T1 extends PipelineTransform<A, any>,
+        T2 extends PipelineTransform<T1, any>,
+        T3 extends PipelineTransform<T2, any>,
+        T4 extends PipelineTransform<T3, any>,
+        B extends PipelineDestination<T4, any>
+    >(source: A, transform1: T1, transform2: T2, transform3: T3, transform4: T4, destination: B, options?: PipelineOptions): PipelinePromise<B>;
+    function pipeline(streams: ReadonlyArray<NodeJS.ReadableStream | NodeJS.WritableStream | NodeJS.ReadWriteStream>, options?: PipelineOptions): Promise<void>;
+    function pipeline(
+        stream1: NodeJS.ReadableStream,
+        stream2: NodeJS.ReadWriteStream | NodeJS.WritableStream,
+        ...streams: Array<NodeJS.ReadWriteStream | NodeJS.WritableStream | PipelineOptions>
+    ): Promise<void>;
+}
+declare module 'node:stream/promises' {
+    export * from 'stream/promises';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/stream/web.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/stream/web.d.ts
new file mode 100644
index 0000000..f9ef057
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/stream/web.d.ts
@@ -0,0 +1,330 @@
+declare module 'stream/web' {
+    // stub module, pending copy&paste from .d.ts or manual impl
+    // copy from lib.dom.d.ts
+    interface ReadableWritablePair<R = any, W = any> {
+        readable: ReadableStream<R>;
+        /**
+         * Provides a convenient, chainable way of piping this readable stream
+         * through a transform stream (or any other { writable, readable }
+         * pair). It simply pipes the stream into the writable side of the
+         * supplied pair, and returns the readable side for further use.
+         *
+         * Piping a stream will lock it for the duration of the pipe, preventing
+         * any other consumer from acquiring a reader.
+         */
+        writable: WritableStream<W>;
+    }
+    interface StreamPipeOptions {
+        preventAbort?: boolean;
+        preventCancel?: boolean;
+        /**
+         * Pipes this readable stream to a given writable stream destination.
+         * The way in which the piping process behaves under various error
+         * conditions can be customized with a number of passed options. It
+         * returns a promise that fulfills when the piping process completes
+         * successfully, or rejects if any errors were encountered.
+         *
+         * Piping a stream will lock it for the duration of the pipe, preventing
+         * any other consumer from acquiring a reader.
+         *
+         * Errors and closures of the source and destination streams propagate
+         * as follows:
+         *
+         * An error in this source readable stream will abort destination,
+         * unless preventAbort is truthy. The returned promise will be rejected
+         * with the source's error, or with any error that occurs during
+         * aborting the destination.
+         *
+         * An error in destination will cancel this source readable stream,
+         * unless preventCancel is truthy. The returned promise will be rejected
+         * with the destination's error, or with any error that occurs during
+         * canceling the source.
+         *
+         * When this source readable stream closes, destination will be closed,
+         * unless preventClose is truthy. The returned promise will be fulfilled
+         * once this process completes, unless an error is encountered while
+         * closing the destination, in which case it will be rejected with that
+         * error.
+         *
+         * If destination starts out closed or closing, this source readable
+         * stream will be canceled, unless preventCancel is true. The returned
+         * promise will be rejected with an error indicating piping to a closed
+         * stream failed, or with any error that occurs during canceling the
+         * source.
+         *
+         * The signal option can be set to an AbortSignal to allow aborting an
+         * ongoing pipe operation via the corresponding AbortController. In this
+         * case, this source readable stream will be canceled, and destination
+         * aborted, unless the respective options preventCancel or preventAbort
+         * are set.
+         */
+        preventClose?: boolean;
+        signal?: AbortSignal;
+    }
+    interface ReadableStreamGenericReader {
+        readonly closed: Promise<undefined>;
+        cancel(reason?: any): Promise<void>;
+    }
+    interface ReadableStreamDefaultReadValueResult<T> {
+        done: false;
+        value: T;
+    }
+    interface ReadableStreamDefaultReadDoneResult {
+        done: true;
+        value?: undefined;
+    }
+    type ReadableStreamController<T> = ReadableStreamDefaultController<T>;
+    type ReadableStreamDefaultReadResult<T> = ReadableStreamDefaultReadValueResult<T> | ReadableStreamDefaultReadDoneResult;
+    interface ReadableByteStreamControllerCallback {
+        (controller: ReadableByteStreamController): void | PromiseLike<void>;
+    }
+    interface UnderlyingSinkAbortCallback {
+        (reason?: any): void | PromiseLike<void>;
+    }
+    interface UnderlyingSinkCloseCallback {
+        (): void | PromiseLike<void>;
+    }
+    interface UnderlyingSinkStartCallback {
+        (controller: WritableStreamDefaultController): any;
+    }
+    interface UnderlyingSinkWriteCallback<W> {
+        (chunk: W, controller: WritableStreamDefaultController): void | PromiseLike<void>;
+    }
+    interface UnderlyingSourceCancelCallback {
+        (reason?: any): void | PromiseLike<void>;
+    }
+    interface UnderlyingSourcePullCallback<R> {
+        (controller: ReadableStreamController<R>): void | PromiseLike<void>;
+    }
+    interface UnderlyingSourceStartCallback<R> {
+        (controller: ReadableStreamController<R>): any;
+    }
+    interface TransformerFlushCallback<O> {
+        (controller: TransformStreamDefaultController<O>): void | PromiseLike<void>;
+    }
+    interface TransformerStartCallback<O> {
+        (controller: TransformStreamDefaultController<O>): any;
+    }
+    interface TransformerTransformCallback<I, O> {
+        (chunk: I, controller: TransformStreamDefaultController<O>): void | PromiseLike<void>;
+    }
+    interface UnderlyingByteSource {
+        autoAllocateChunkSize?: number;
+        cancel?: ReadableStreamErrorCallback;
+        pull?: ReadableByteStreamControllerCallback;
+        start?: ReadableByteStreamControllerCallback;
+        type: 'bytes';
+    }
+    interface UnderlyingSource<R = any> {
+        cancel?: UnderlyingSourceCancelCallback;
+        pull?: UnderlyingSourcePullCallback<R>;
+        start?: UnderlyingSourceStartCallback<R>;
+        type?: undefined;
+    }
+    interface UnderlyingSink<W = any> {
+        abort?: UnderlyingSinkAbortCallback;
+        close?: UnderlyingSinkCloseCallback;
+        start?: UnderlyingSinkStartCallback;
+        type?: undefined;
+        write?: UnderlyingSinkWriteCallback<W>;
+    }
+    interface ReadableStreamErrorCallback {
+        (reason: any): void | PromiseLike<void>;
+    }
+    /** This Streams API interface represents a readable stream of byte data. */
+    interface ReadableStream<R = any> {
+        readonly locked: boolean;
+        cancel(reason?: any): Promise<void>;
+        getReader(): ReadableStreamDefaultReader<R>;
+        pipeThrough<T>(transform: ReadableWritablePair<T, R>, options?: StreamPipeOptions): ReadableStream<T>;
+        pipeTo(destination: WritableStream<R>, options?: StreamPipeOptions): Promise<void>;
+        tee(): [ReadableStream<R>, ReadableStream<R>];
+        values(options?: { preventCancel?: boolean }): AsyncIterableIterator<R>;
+        [Symbol.asyncIterator](): AsyncIterableIterator<R>;
+    }
+    const ReadableStream: {
+        prototype: ReadableStream;
+        new (underlyingSource: UnderlyingByteSource, strategy?: QueuingStrategy<Uint8Array>): ReadableStream<Uint8Array>;
+        new <R = any>(underlyingSource?: UnderlyingSource<R>, strategy?: QueuingStrategy<R>): ReadableStream<R>;
+    };
+    interface ReadableStreamDefaultReader<R = any> extends ReadableStreamGenericReader {
+        read(): Promise<ReadableStreamDefaultReadResult<R>>;
+        releaseLock(): void;
+    }
+    const ReadableStreamDefaultReader: {
+        prototype: ReadableStreamDefaultReader;
+        new <R = any>(stream: ReadableStream<R>): ReadableStreamDefaultReader<R>;
+    };
+    const ReadableStreamBYOBReader: any;
+    const ReadableStreamBYOBRequest: any;
+    interface ReadableByteStreamController {
+        readonly byobRequest: undefined;
+        readonly desiredSize: number | null;
+        close(): void;
+        enqueue(chunk: ArrayBufferView): void;
+        error(error?: any): void;
+    }
+    const ReadableByteStreamController: {
+        prototype: ReadableByteStreamController;
+        new (): ReadableByteStreamController;
+    };
+    interface ReadableStreamDefaultController<R = any> {
+        readonly desiredSize: number | null;
+        close(): void;
+        enqueue(chunk?: R): void;
+        error(e?: any): void;
+    }
+    const ReadableStreamDefaultController: {
+        prototype: ReadableStreamDefaultController;
+        new (): ReadableStreamDefaultController;
+    };
+    interface Transformer<I = any, O = any> {
+        flush?: TransformerFlushCallback<O>;
+        readableType?: undefined;
+        start?: TransformerStartCallback<O>;
+        transform?: TransformerTransformCallback<I, O>;
+        writableType?: undefined;
+    }
+    interface TransformStream<I = any, O = any> {
+        readonly readable: ReadableStream<O>;
+        readonly writable: WritableStream<I>;
+    }
+    const TransformStream: {
+        prototype: TransformStream;
+        new <I = any, O = any>(transformer?: Transformer<I, O>, writableStrategy?: QueuingStrategy<I>, readableStrategy?: QueuingStrategy<O>): TransformStream<I, O>;
+    };
+    interface TransformStreamDefaultController<O = any> {
+        readonly desiredSize: number | null;
+        enqueue(chunk?: O): void;
+        error(reason?: any): void;
+        terminate(): void;
+    }
+    const TransformStreamDefaultController: {
+        prototype: TransformStreamDefaultController;
+        new (): TransformStreamDefaultController;
+    };
+    /**
+     * This Streams API interface provides a standard abstraction for writing
+     * streaming data to a destination, known as a sink. This object comes with
+     * built-in back pressure and queuing.
+     */
+    interface WritableStream<W = any> {
+        readonly locked: boolean;
+        abort(reason?: any): Promise<void>;
+        close(): Promise<void>;
+        getWriter(): WritableStreamDefaultWriter<W>;
+    }
+    const WritableStream: {
+        prototype: WritableStream;
+        new <W = any>(underlyingSink?: UnderlyingSink<W>, strategy?: QueuingStrategy<W>): WritableStream<W>;
+    };
+    /**
+     * This Streams API interface is the object returned by
+     * WritableStream.getWriter() and once created locks the < writer to the
+     * WritableStream ensuring that no other streams can write to the underlying
+     * sink.
+     */
+    interface WritableStreamDefaultWriter<W = any> {
+        readonly closed: Promise<undefined>;
+        readonly desiredSize: number | null;
+        readonly ready: Promise<undefined>;
+        abort(reason?: any): Promise<void>;
+        close(): Promise<void>;
+        releaseLock(): void;
+        write(chunk?: W): Promise<void>;
+    }
+    const WritableStreamDefaultWriter: {
+        prototype: WritableStreamDefaultWriter;
+        new <W = any>(stream: WritableStream<W>): WritableStreamDefaultWriter<W>;
+    };
+    /**
+     * This Streams API interface represents a controller allowing control of a
+     * WritableStream's state. When constructing a WritableStream, the
+     * underlying sink is given a corresponding WritableStreamDefaultController
+     * instance to manipulate.
+     */
+    interface WritableStreamDefaultController {
+        error(e?: any): void;
+    }
+    const WritableStreamDefaultController: {
+        prototype: WritableStreamDefaultController;
+        new (): WritableStreamDefaultController;
+    };
+    interface QueuingStrategy<T = any> {
+        highWaterMark?: number;
+        size?: QueuingStrategySize<T>;
+    }
+    interface QueuingStrategySize<T = any> {
+        (chunk?: T): number;
+    }
+    interface QueuingStrategyInit {
+        /**
+         * Creates a new ByteLengthQueuingStrategy with the provided high water
+         * mark.
+         *
+         * Note that the provided high water mark will not be validated ahead of
+         * time. Instead, if it is negative, NaN, or not a number, the resulting
+         * ByteLengthQueuingStrategy will cause the corresponding stream
+         * constructor to throw.
+         */
+        highWaterMark: number;
+    }
+    /**
+     * This Streams API interface provides a built-in byte length queuing
+     * strategy that can be used when constructing streams.
+     */
+    interface ByteLengthQueuingStrategy extends QueuingStrategy<ArrayBufferView> {
+        readonly highWaterMark: number;
+        readonly size: QueuingStrategySize<ArrayBufferView>;
+    }
+    const ByteLengthQueuingStrategy: {
+        prototype: ByteLengthQueuingStrategy;
+        new (init: QueuingStrategyInit): ByteLengthQueuingStrategy;
+    };
+    /**
+     * This Streams API interface provides a built-in byte length queuing
+     * strategy that can be used when constructing streams.
+     */
+    interface CountQueuingStrategy extends QueuingStrategy {
+        readonly highWaterMark: number;
+        readonly size: QueuingStrategySize;
+    }
+    const CountQueuingStrategy: {
+        prototype: CountQueuingStrategy;
+        new (init: QueuingStrategyInit): CountQueuingStrategy;
+    };
+    interface TextEncoderStream {
+        /** Returns "utf-8". */
+        readonly encoding: 'utf-8';
+        readonly readable: ReadableStream<Uint8Array>;
+        readonly writable: WritableStream<string>;
+        readonly [Symbol.toStringTag]: string;
+    }
+    const TextEncoderStream: {
+        prototype: TextEncoderStream;
+        new (): TextEncoderStream;
+    };
+    interface TextDecoderOptions {
+        fatal?: boolean;
+        ignoreBOM?: boolean;
+    }
+    type BufferSource = ArrayBufferView | ArrayBuffer;
+    interface TextDecoderStream {
+        /** Returns encoding's name, lower cased. */
+        readonly encoding: string;
+        /** Returns `true` if error mode is "fatal", and `false` otherwise. */
+        readonly fatal: boolean;
+        /** Returns `true` if ignore BOM flag is set, and `false` otherwise. */
+        readonly ignoreBOM: boolean;
+        readonly readable: ReadableStream<string>;
+        readonly writable: WritableStream<BufferSource>;
+        readonly [Symbol.toStringTag]: string;
+    }
+    const TextDecoderStream: {
+        prototype: TextDecoderStream;
+        new (label?: string, options?: TextDecoderOptions): TextDecoderStream;
+    };
+}
+declare module 'node:stream/web' {
+    export * from 'stream/web';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/string_decoder.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/string_decoder.d.ts
new file mode 100644
index 0000000..da712b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/string_decoder.d.ts
@@ -0,0 +1,67 @@
+/**
+ * The `string_decoder` module provides an API for decoding `Buffer` objects into
+ * strings in a manner that preserves encoded multi-byte UTF-8 and UTF-16
+ * characters. It can be accessed using:
+ *
+ * ```js
+ * const { StringDecoder } = require('string_decoder');
+ * ```
+ *
+ * The following example shows the basic use of the `StringDecoder` class.
+ *
+ * ```js
+ * const { StringDecoder } = require('string_decoder');
+ * const decoder = new StringDecoder('utf8');
+ *
+ * const cent = Buffer.from([0xC2, 0xA2]);
+ * console.log(decoder.write(cent));
+ *
+ * const euro = Buffer.from([0xE2, 0x82, 0xAC]);
+ * console.log(decoder.write(euro));
+ * ```
+ *
+ * When a `Buffer` instance is written to the `StringDecoder` instance, an
+ * internal buffer is used to ensure that the decoded string does not contain
+ * any incomplete multibyte characters. These are held in the buffer until the
+ * next call to `stringDecoder.write()` or until `stringDecoder.end()` is called.
+ *
+ * In the following example, the three UTF-8 encoded bytes of the European Euro
+ * symbol (`€`) are written over three separate operations:
+ *
+ * ```js
+ * const { StringDecoder } = require('string_decoder');
+ * const decoder = new StringDecoder('utf8');
+ *
+ * decoder.write(Buffer.from([0xE2]));
+ * decoder.write(Buffer.from([0x82]));
+ * console.log(decoder.end(Buffer.from([0xAC])));
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/string_decoder.js)
+ */
+declare module 'string_decoder' {
+    class StringDecoder {
+        constructor(encoding?: BufferEncoding);
+        /**
+         * Returns a decoded string, ensuring that any incomplete multibyte characters at
+         * the end of the `Buffer`, or `TypedArray`, or `DataView` are omitted from the
+         * returned string and stored in an internal buffer for the next call to`stringDecoder.write()` or `stringDecoder.end()`.
+         * @since v0.1.99
+         * @param buffer A `Buffer`, or `TypedArray`, or `DataView` containing the bytes to decode.
+         */
+        write(buffer: Buffer): string;
+        /**
+         * Returns any remaining input stored in the internal buffer as a string. Bytes
+         * representing incomplete UTF-8 and UTF-16 characters will be replaced with
+         * substitution characters appropriate for the character encoding.
+         *
+         * If the `buffer` argument is provided, one final call to `stringDecoder.write()`is performed before returning the remaining input.
+         * After `end()` is called, the `stringDecoder` object can be reused for new input.
+         * @since v0.9.3
+         * @param buffer A `Buffer`, or `TypedArray`, or `DataView` containing the bytes to decode.
+         */
+        end(buffer?: Buffer): string;
+    }
+}
+declare module 'node:string_decoder' {
+    export * from 'string_decoder';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/timers.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/timers.d.ts
new file mode 100644
index 0000000..59f44c1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/timers.d.ts
@@ -0,0 +1,94 @@
+/**
+ * The `timer` module exposes a global API for scheduling functions to
+ * be called at some future period of time. Because the timer functions are
+ * globals, there is no need to call `require('timers')` to use the API.
+ *
+ * The timer functions within Node.js implement a similar API as the timers API
+ * provided by Web Browsers but use a different internal implementation that is
+ * built around the Node.js [Event Loop](https://nodejs.org/en/docs/guides/event-loop-timers-and-nexttick/#setimmediate-vs-settimeout).
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/timers.js)
+ */
+declare module 'timers' {
+    import { Abortable } from 'node:events';
+    import { setTimeout as setTimeoutPromise, setImmediate as setImmediatePromise, setInterval as setIntervalPromise } from 'node:timers/promises';
+    interface TimerOptions extends Abortable {
+        /**
+         * Set to `false` to indicate that the scheduled `Timeout`
+         * should not require the Node.js event loop to remain active.
+         * @default true
+         */
+        ref?: boolean | undefined;
+    }
+    let setTimeout: typeof global.setTimeout;
+    let clearTimeout: typeof global.clearTimeout;
+    let setInterval: typeof global.setInterval;
+    let clearInterval: typeof global.clearInterval;
+    let setImmediate: typeof global.setImmediate;
+    let clearImmediate: typeof global.clearImmediate;
+    global {
+        namespace NodeJS {
+            // compatibility with older typings
+            interface Timer extends RefCounted {
+                hasRef(): boolean;
+                refresh(): this;
+                [Symbol.toPrimitive](): number;
+            }
+            interface Immediate extends RefCounted {
+                /**
+                 * If true, the `Immediate` object will keep the Node.js event loop active.
+                 * @since v11.0.0
+                 */
+                hasRef(): boolean;
+                _onImmediate: Function; // to distinguish it from the Timeout class
+            }
+            interface Timeout extends Timer {
+                /**
+                 * If true, the `Timeout` object will keep the Node.js event loop active.
+                 * @since v11.0.0
+                 */
+                hasRef(): boolean;
+                /**
+                 * Sets the timer's start time to the current time, and reschedules the timer to
+                 * call its callback at the previously specified duration adjusted to the current
+                 * time. This is useful for refreshing a timer without allocating a new
+                 * JavaScript object.
+                 *
+                 * Using this on a timer that has already called its callback will reactivate the
+                 * timer.
+                 * @since v10.2.0
+                 * @return a reference to `timeout`
+                 */
+                refresh(): this;
+                [Symbol.toPrimitive](): number;
+            }
+        }
+        function setTimeout<TArgs extends any[]>(callback: (...args: TArgs) => void, ms?: number, ...args: TArgs): NodeJS.Timeout;
+        // util.promisify no rest args compability
+        // tslint:disable-next-line void-return
+        function setTimeout(callback: (args: void) => void, ms?: number): NodeJS.Timeout;
+        namespace setTimeout {
+            const __promisify__: typeof setTimeoutPromise;
+        }
+        function clearTimeout(timeoutId: NodeJS.Timeout): void;
+        function setInterval<TArgs extends any[]>(callback: (...args: TArgs) => void, ms?: number, ...args: TArgs): NodeJS.Timer;
+        // util.promisify no rest args compability
+        // tslint:disable-next-line void-return
+        function setInterval(callback: (args: void) => void, ms?: number): NodeJS.Timer;
+        namespace setInterval {
+            const __promisify__: typeof setIntervalPromise;
+        }
+        function clearInterval(intervalId: NodeJS.Timeout): void;
+        function setImmediate<TArgs extends any[]>(callback: (...args: TArgs) => void, ...args: TArgs): NodeJS.Immediate;
+        // util.promisify no rest args compability
+        // tslint:disable-next-line void-return
+        function setImmediate(callback: (args: void) => void): NodeJS.Immediate;
+        namespace setImmediate {
+            const __promisify__: typeof setImmediatePromise;
+        }
+        function clearImmediate(immediateId: NodeJS.Immediate): void;
+        function queueMicrotask(callback: () => void): void;
+    }
+}
+declare module 'node:timers' {
+    export * from 'timers';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/timers/promises.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/timers/promises.d.ts
new file mode 100644
index 0000000..fd77888
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/timers/promises.d.ts
@@ -0,0 +1,68 @@
+/**
+ * The `timers/promises` API provides an alternative set of timer functions
+ * that return `Promise` objects. The API is accessible via`require('timers/promises')`.
+ *
+ * ```js
+ * import {
+ *   setTimeout,
+ *   setImmediate,
+ *   setInterval,
+ * } from 'timers/promises';
+ * ```
+ * @since v15.0.0
+ */
+declare module 'timers/promises' {
+    import { TimerOptions } from 'node:timers';
+    /**
+     * ```js
+     * import {
+     *   setTimeout,
+     * } from 'timers/promises';
+     *
+     * const res = await setTimeout(100, 'result');
+     *
+     * console.log(res);  // Prints 'result'
+     * ```
+     * @since v15.0.0
+     * @param [delay=1] The number of milliseconds to wait before fulfilling the promise.
+     * @param value A value with which the promise is fulfilled.
+     */
+    function setTimeout<T = void>(delay?: number, value?: T, options?: TimerOptions): Promise<T>;
+    /**
+     * ```js
+     * import {
+     *   setImmediate,
+     * } from 'timers/promises';
+     *
+     * const res = await setImmediate('result');
+     *
+     * console.log(res);  // Prints 'result'
+     * ```
+     * @since v15.0.0
+     * @param value A value with which the promise is fulfilled.
+     */
+    function setImmediate<T = void>(value?: T, options?: TimerOptions): Promise<T>;
+    /**
+     * Returns an async iterator that generates values in an interval of `delay` ms.
+     *
+     * ```js
+     * import {
+     *   setInterval,
+     * } from 'timers/promises';
+     *
+     * const interval = 100;
+     * for await (const startTime of setInterval(interval, Date.now())) {
+     *   const now = Date.now();
+     *   console.log(now);
+     *   if ((now - startTime) > 1000)
+     *     break;
+     * }
+     * console.log(Date.now());
+     * ```
+     * @since v15.9.0
+     */
+    function setInterval<T = void>(delay?: number, value?: T, options?: TimerOptions): AsyncIterable<T>;
+}
+declare module 'node:timers/promises' {
+    export * from 'timers/promises';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/tls.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/tls.d.ts
new file mode 100644
index 0000000..661f0f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/tls.d.ts
@@ -0,0 +1,1020 @@
+/**
+ * The `tls` module provides an implementation of the Transport Layer Security
+ * (TLS) and Secure Socket Layer (SSL) protocols that is built on top of OpenSSL.
+ * The module can be accessed using:
+ *
+ * ```js
+ * const tls = require('tls');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/tls.js)
+ */
+declare module 'tls' {
+    import { X509Certificate } from 'node:crypto';
+    import * as net from 'node:net';
+    import * as stream from 'stream';
+    const CLIENT_RENEG_LIMIT: number;
+    const CLIENT_RENEG_WINDOW: number;
+    interface Certificate {
+        /**
+         * Country code.
+         */
+        C: string;
+        /**
+         * Street.
+         */
+        ST: string;
+        /**
+         * Locality.
+         */
+        L: string;
+        /**
+         * Organization.
+         */
+        O: string;
+        /**
+         * Organizational unit.
+         */
+        OU: string;
+        /**
+         * Common name.
+         */
+        CN: string;
+    }
+    interface PeerCertificate {
+        subject: Certificate;
+        issuer: Certificate;
+        subjectaltname: string;
+        infoAccess: NodeJS.Dict<string[]>;
+        modulus: string;
+        exponent: string;
+        valid_from: string;
+        valid_to: string;
+        fingerprint: string;
+        fingerprint256: string;
+        ext_key_usage: string[];
+        serialNumber: string;
+        raw: Buffer;
+    }
+    interface DetailedPeerCertificate extends PeerCertificate {
+        issuerCertificate: DetailedPeerCertificate;
+    }
+    interface CipherNameAndProtocol {
+        /**
+         * The cipher name.
+         */
+        name: string;
+        /**
+         * SSL/TLS protocol version.
+         */
+        version: string;
+        /**
+         * IETF name for the cipher suite.
+         */
+        standardName: string;
+    }
+    interface EphemeralKeyInfo {
+        /**
+         * The supported types are 'DH' and 'ECDH'.
+         */
+        type: string;
+        /**
+         * The name property is available only when type is 'ECDH'.
+         */
+        name?: string | undefined;
+        /**
+         * The size of parameter of an ephemeral key exchange.
+         */
+        size: number;
+    }
+    interface KeyObject {
+        /**
+         * Private keys in PEM format.
+         */
+        pem: string | Buffer;
+        /**
+         * Optional passphrase.
+         */
+        passphrase?: string | undefined;
+    }
+    interface PxfObject {
+        /**
+         * PFX or PKCS12 encoded private key and certificate chain.
+         */
+        buf: string | Buffer;
+        /**
+         * Optional passphrase.
+         */
+        passphrase?: string | undefined;
+    }
+    interface TLSSocketOptions extends SecureContextOptions, CommonConnectionOptions {
+        /**
+         * If true the TLS socket will be instantiated in server-mode.
+         * Defaults to false.
+         */
+        isServer?: boolean | undefined;
+        /**
+         * An optional net.Server instance.
+         */
+        server?: net.Server | undefined;
+        /**
+         * An optional Buffer instance containing a TLS session.
+         */
+        session?: Buffer | undefined;
+        /**
+         * If true, specifies that the OCSP status request extension will be
+         * added to the client hello and an 'OCSPResponse' event will be
+         * emitted on the socket before establishing a secure communication
+         */
+        requestOCSP?: boolean | undefined;
+    }
+    /**
+     * Performs transparent encryption of written data and all required TLS
+     * negotiation.
+     *
+     * Instances of `tls.TLSSocket` implement the duplex `Stream` interface.
+     *
+     * Methods that return TLS connection metadata (e.g.{@link TLSSocket.getPeerCertificate} will only return data while the
+     * connection is open.
+     * @since v0.11.4
+     */
+    class TLSSocket extends net.Socket {
+        /**
+         * Construct a new tls.TLSSocket object from an existing TCP socket.
+         */
+        constructor(socket: net.Socket, options?: TLSSocketOptions);
+        /**
+         * Returns `true` if the peer certificate was signed by one of the CAs specified
+         * when creating the `tls.TLSSocket` instance, otherwise `false`.
+         * @since v0.11.4
+         */
+        authorized: boolean;
+        /**
+         * Returns the reason why the peer's certificate was not been verified. This
+         * property is set only when `tlsSocket.authorized === false`.
+         * @since v0.11.4
+         */
+        authorizationError: Error;
+        /**
+         * Always returns `true`. This may be used to distinguish TLS sockets from regular`net.Socket` instances.
+         * @since v0.11.4
+         */
+        encrypted: boolean;
+        /**
+         * String containing the selected ALPN protocol.
+         * Before a handshake has completed, this value is always null.
+         * When a handshake is completed but not ALPN protocol was selected, tlsSocket.alpnProtocol equals false.
+         */
+        alpnProtocol: string | false | null;
+        /**
+         * Returns an object representing the local certificate. The returned object has
+         * some properties corresponding to the fields of the certificate.
+         *
+         * See {@link TLSSocket.getPeerCertificate} for an example of the certificate
+         * structure.
+         *
+         * If there is no local certificate, an empty object will be returned. If the
+         * socket has been destroyed, `null` will be returned.
+         * @since v11.2.0
+         */
+        getCertificate(): PeerCertificate | object | null;
+        /**
+         * Returns an object containing information on the negotiated cipher suite.
+         *
+         * For example:
+         *
+         * ```json
+         * {
+         *     "name": "AES128-SHA256",
+         *     "standardName": "TLS_RSA_WITH_AES_128_CBC_SHA256",
+         *     "version": "TLSv1.2"
+         * }
+         * ```
+         *
+         * See [SSL\_CIPHER\_get\_name](https://www.openssl.org/docs/man1.1.1/man3/SSL_CIPHER_get_name.html) for more information.
+         * @since v0.11.4
+         */
+        getCipher(): CipherNameAndProtocol;
+        /**
+         * Returns an object representing the type, name, and size of parameter of
+         * an ephemeral key exchange in `perfect forward secrecy` on a client
+         * connection. It returns an empty object when the key exchange is not
+         * ephemeral. As this is only supported on a client socket; `null` is returned
+         * if called on a server socket. The supported types are `'DH'` and `'ECDH'`. The`name` property is available only when type is `'ECDH'`.
+         *
+         * For example: `{ type: 'ECDH', name: 'prime256v1', size: 256 }`.
+         * @since v5.0.0
+         */
+        getEphemeralKeyInfo(): EphemeralKeyInfo | object | null;
+        /**
+         * As the `Finished` messages are message digests of the complete handshake
+         * (with a total of 192 bits for TLS 1.0 and more for SSL 3.0), they can
+         * be used for external authentication procedures when the authentication
+         * provided by SSL/TLS is not desired or is not enough.
+         *
+         * Corresponds to the `SSL_get_finished` routine in OpenSSL and may be used
+         * to implement the `tls-unique` channel binding from [RFC 5929](https://tools.ietf.org/html/rfc5929).
+         * @since v9.9.0
+         * @return The latest `Finished` message that has been sent to the socket as part of a SSL/TLS handshake, or `undefined` if no `Finished` message has been sent yet.
+         */
+        getFinished(): Buffer | undefined;
+        /**
+         * Returns an object representing the peer's certificate. If the peer does not
+         * provide a certificate, an empty object will be returned. If the socket has been
+         * destroyed, `null` will be returned.
+         *
+         * If the full certificate chain was requested, each certificate will include an`issuerCertificate` property containing an object representing its issuer's
+         * certificate.
+         * @since v0.11.4
+         * @param detailed Include the full certificate chain if `true`, otherwise include just the peer's certificate.
+         * @return A certificate object.
+         */
+        getPeerCertificate(detailed: true): DetailedPeerCertificate;
+        getPeerCertificate(detailed?: false): PeerCertificate;
+        getPeerCertificate(detailed?: boolean): PeerCertificate | DetailedPeerCertificate;
+        /**
+         * As the `Finished` messages are message digests of the complete handshake
+         * (with a total of 192 bits for TLS 1.0 and more for SSL 3.0), they can
+         * be used for external authentication procedures when the authentication
+         * provided by SSL/TLS is not desired or is not enough.
+         *
+         * Corresponds to the `SSL_get_peer_finished` routine in OpenSSL and may be used
+         * to implement the `tls-unique` channel binding from [RFC 5929](https://tools.ietf.org/html/rfc5929).
+         * @since v9.9.0
+         * @return The latest `Finished` message that is expected or has actually been received from the socket as part of a SSL/TLS handshake, or `undefined` if there is no `Finished` message so
+         * far.
+         */
+        getPeerFinished(): Buffer | undefined;
+        /**
+         * Returns a string containing the negotiated SSL/TLS protocol version of the
+         * current connection. The value `'unknown'` will be returned for connected
+         * sockets that have not completed the handshaking process. The value `null` will
+         * be returned for server sockets or disconnected client sockets.
+         *
+         * Protocol versions are:
+         *
+         * * `'SSLv3'`
+         * * `'TLSv1'`
+         * * `'TLSv1.1'`
+         * * `'TLSv1.2'`
+         * * `'TLSv1.3'`
+         *
+         * See the OpenSSL [`SSL_get_version`](https://www.openssl.org/docs/man1.1.1/man3/SSL_get_version.html) documentation for more information.
+         * @since v5.7.0
+         */
+        getProtocol(): string | null;
+        /**
+         * Returns the TLS session data or `undefined` if no session was
+         * negotiated. On the client, the data can be provided to the `session` option of {@link connect} to resume the connection. On the server, it may be useful
+         * for debugging.
+         *
+         * See `Session Resumption` for more information.
+         *
+         * Note: `getSession()` works only for TLSv1.2 and below. For TLSv1.3, applications
+         * must use the `'session'` event (it also works for TLSv1.2 and below).
+         * @since v0.11.4
+         */
+        getSession(): Buffer | undefined;
+        /**
+         * See [SSL\_get\_shared\_sigalgs](https://www.openssl.org/docs/man1.1.1/man3/SSL_get_shared_sigalgs.html) for more information.
+         * @since v12.11.0
+         * @return List of signature algorithms shared between the server and the client in the order of decreasing preference.
+         */
+        getSharedSigalgs(): string[];
+        /**
+         * For a client, returns the TLS session ticket if one is available, or`undefined`. For a server, always returns `undefined`.
+         *
+         * It may be useful for debugging.
+         *
+         * See `Session Resumption` for more information.
+         * @since v0.11.4
+         */
+        getTLSTicket(): Buffer | undefined;
+        /**
+         * See `Session Resumption` for more information.
+         * @since v0.5.6
+         * @return `true` if the session was reused, `false` otherwise.
+         */
+        isSessionReused(): boolean;
+        /**
+         * The `tlsSocket.renegotiate()` method initiates a TLS renegotiation process.
+         * Upon completion, the `callback` function will be passed a single argument
+         * that is either an `Error` (if the request failed) or `null`.
+         *
+         * This method can be used to request a peer's certificate after the secure
+         * connection has been established.
+         *
+         * When running as the server, the socket will be destroyed with an error after`handshakeTimeout` timeout.
+         *
+         * For TLSv1.3, renegotiation cannot be initiated, it is not supported by the
+         * protocol.
+         * @since v0.11.8
+         * @param callback If `renegotiate()` returned `true`, callback is attached once to the `'secure'` event. If `renegotiate()` returned `false`, `callback` will be called in the next tick with
+         * an error, unless the `tlsSocket` has been destroyed, in which case `callback` will not be called at all.
+         * @return `true` if renegotiation was initiated, `false` otherwise.
+         */
+        renegotiate(
+            options: {
+                rejectUnauthorized?: boolean | undefined;
+                requestCert?: boolean | undefined;
+            },
+            callback: (err: Error | null) => void
+        ): undefined | boolean;
+        /**
+         * The `tlsSocket.setMaxSendFragment()` method sets the maximum TLS fragment size.
+         * Returns `true` if setting the limit succeeded; `false` otherwise.
+         *
+         * Smaller fragment sizes decrease the buffering latency on the client: larger
+         * fragments are buffered by the TLS layer until the entire fragment is received
+         * and its integrity is verified; large fragments can span multiple roundtrips
+         * and their processing can be delayed due to packet loss or reordering. However,
+         * smaller fragments add extra TLS framing bytes and CPU overhead, which may
+         * decrease overall server throughput.
+         * @since v0.11.11
+         * @param [size=16384] The maximum TLS fragment size. The maximum value is `16384`.
+         */
+        setMaxSendFragment(size: number): boolean;
+        /**
+         * Disables TLS renegotiation for this `TLSSocket` instance. Once called, attempts
+         * to renegotiate will trigger an `'error'` event on the `TLSSocket`.
+         * @since v8.4.0
+         */
+        disableRenegotiation(): void;
+        /**
+         * When enabled, TLS packet trace information is written to `stderr`. This can be
+         * used to debug TLS connection problems.
+         *
+         * Note: The format of the output is identical to the output of `openssl s_client -trace` or `openssl s_server -trace`. While it is produced by OpenSSL's`SSL_trace()` function, the format is
+         * undocumented, can change without notice,
+         * and should not be relied on.
+         * @since v12.2.0
+         */
+        enableTrace(): void;
+        /**
+         * Returns the peer certificate as an `X509Certificate` object.
+         *
+         * If there is no peer certificate, or the socket has been destroyed,`undefined` will be returned.
+         * @since v15.9.0
+         */
+        getPeerX509Certificate(): X509Certificate | undefined;
+        /**
+         * Returns the local certificate as an `X509Certificate` object.
+         *
+         * If there is no local certificate, or the socket has been destroyed,`undefined` will be returned.
+         * @since v15.9.0
+         */
+        getX509Certificate(): X509Certificate | undefined;
+        /**
+         * Keying material is used for validations to prevent different kind of attacks in
+         * network protocols, for example in the specifications of IEEE 802.1X.
+         *
+         * Example
+         *
+         * ```js
+         * const keyingMaterial = tlsSocket.exportKeyingMaterial(
+         *   128,
+         *   'client finished');
+         *
+         *
+         *  Example return value of keyingMaterial:
+         *  <Buffer 76 26 af 99 c5 56 8e 42 09 91 ef 9f 93 cb ad 6c 7b 65 f8 53 f1 d8 d9
+         *     12 5a 33 b8 b5 25 df 7b 37 9f e0 e2 4f b8 67 83 a3 2f cd 5d 41 42 4c 91
+         *     74 ef 2c ... 78 more bytes>
+         *
+         * ```
+         *
+         * See the OpenSSL [`SSL_export_keying_material`](https://www.openssl.org/docs/man1.1.1/man3/SSL_export_keying_material.html) documentation for more
+         * information.
+         * @since v13.10.0, v12.17.0
+         * @param length number of bytes to retrieve from keying material
+         * @param label an application specific label, typically this will be a value from the [IANA Exporter Label
+         * Registry](https://www.iana.org/assignments/tls-parameters/tls-parameters.xhtml#exporter-labels).
+         * @param context Optionally provide a context.
+         * @return requested bytes of the keying material
+         */
+        exportKeyingMaterial(length: number, label: string, context: Buffer): Buffer;
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'OCSPResponse', listener: (response: Buffer) => void): this;
+        addListener(event: 'secureConnect', listener: () => void): this;
+        addListener(event: 'session', listener: (session: Buffer) => void): this;
+        addListener(event: 'keylog', listener: (line: Buffer) => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'OCSPResponse', response: Buffer): boolean;
+        emit(event: 'secureConnect'): boolean;
+        emit(event: 'session', session: Buffer): boolean;
+        emit(event: 'keylog', line: Buffer): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'OCSPResponse', listener: (response: Buffer) => void): this;
+        on(event: 'secureConnect', listener: () => void): this;
+        on(event: 'session', listener: (session: Buffer) => void): this;
+        on(event: 'keylog', listener: (line: Buffer) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'OCSPResponse', listener: (response: Buffer) => void): this;
+        once(event: 'secureConnect', listener: () => void): this;
+        once(event: 'session', listener: (session: Buffer) => void): this;
+        once(event: 'keylog', listener: (line: Buffer) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'OCSPResponse', listener: (response: Buffer) => void): this;
+        prependListener(event: 'secureConnect', listener: () => void): this;
+        prependListener(event: 'session', listener: (session: Buffer) => void): this;
+        prependListener(event: 'keylog', listener: (line: Buffer) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'OCSPResponse', listener: (response: Buffer) => void): this;
+        prependOnceListener(event: 'secureConnect', listener: () => void): this;
+        prependOnceListener(event: 'session', listener: (session: Buffer) => void): this;
+        prependOnceListener(event: 'keylog', listener: (line: Buffer) => void): this;
+    }
+    interface CommonConnectionOptions {
+        /**
+         * An optional TLS context object from tls.createSecureContext()
+         */
+        secureContext?: SecureContext | undefined;
+        /**
+         * When enabled, TLS packet trace information is written to `stderr`. This can be
+         * used to debug TLS connection problems.
+         * @default false
+         */
+        enableTrace?: boolean | undefined;
+        /**
+         * If true the server will request a certificate from clients that
+         * connect and attempt to verify that certificate. Defaults to
+         * false.
+         */
+        requestCert?: boolean | undefined;
+        /**
+         * An array of strings or a Buffer naming possible ALPN protocols.
+         * (Protocols should be ordered by their priority.)
+         */
+        ALPNProtocols?: string[] | Uint8Array[] | Uint8Array | undefined;
+        /**
+         * SNICallback(servername, cb) <Function> A function that will be
+         * called if the client supports SNI TLS extension. Two arguments
+         * will be passed when called: servername and cb. SNICallback should
+         * invoke cb(null, ctx), where ctx is a SecureContext instance.
+         * (tls.createSecureContext(...) can be used to get a proper
+         * SecureContext.) If SNICallback wasn't provided the default callback
+         * with high-level API will be used (see below).
+         */
+        SNICallback?: ((servername: string, cb: (err: Error | null, ctx?: SecureContext) => void) => void) | undefined;
+        /**
+         * If true the server will reject any connection which is not
+         * authorized with the list of supplied CAs. This option only has an
+         * effect if requestCert is true.
+         * @default true
+         */
+        rejectUnauthorized?: boolean | undefined;
+    }
+    interface TlsOptions extends SecureContextOptions, CommonConnectionOptions, net.ServerOpts {
+        /**
+         * Abort the connection if the SSL/TLS handshake does not finish in the
+         * specified number of milliseconds. A 'tlsClientError' is emitted on
+         * the tls.Server object whenever a handshake times out. Default:
+         * 120000 (120 seconds).
+         */
+        handshakeTimeout?: number | undefined;
+        /**
+         * The number of seconds after which a TLS session created by the
+         * server will no longer be resumable. See Session Resumption for more
+         * information. Default: 300.
+         */
+        sessionTimeout?: number | undefined;
+        /**
+         * 48-bytes of cryptographically strong pseudo-random data.
+         */
+        ticketKeys?: Buffer | undefined;
+        /**
+         *
+         * @param socket
+         * @param identity identity parameter sent from the client.
+         * @return pre-shared key that must either be
+         * a buffer or `null` to stop the negotiation process. Returned PSK must be
+         * compatible with the selected cipher's digest.
+         *
+         * When negotiating TLS-PSK (pre-shared keys), this function is called
+         * with the identity provided by the client.
+         * If the return value is `null` the negotiation process will stop and an
+         * "unknown_psk_identity" alert message will be sent to the other party.
+         * If the server wishes to hide the fact that the PSK identity was not known,
+         * the callback must provide some random data as `psk` to make the connection
+         * fail with "decrypt_error" before negotiation is finished.
+         * PSK ciphers are disabled by default, and using TLS-PSK thus
+         * requires explicitly specifying a cipher suite with the `ciphers` option.
+         * More information can be found in the RFC 4279.
+         */
+        pskCallback?(socket: TLSSocket, identity: string): DataView | NodeJS.TypedArray | null;
+        /**
+         * hint to send to a client to help
+         * with selecting the identity during TLS-PSK negotiation. Will be ignored
+         * in TLS 1.3. Upon failing to set pskIdentityHint `tlsClientError` will be
+         * emitted with `ERR_TLS_PSK_SET_IDENTIY_HINT_FAILED` code.
+         */
+        pskIdentityHint?: string | undefined;
+    }
+    interface PSKCallbackNegotation {
+        psk: DataView | NodeJS.TypedArray;
+        identity: string;
+    }
+    interface ConnectionOptions extends SecureContextOptions, CommonConnectionOptions {
+        host?: string | undefined;
+        port?: number | undefined;
+        path?: string | undefined; // Creates unix socket connection to path. If this option is specified, `host` and `port` are ignored.
+        socket?: stream.Duplex | undefined; // Establish secure connection on a given socket rather than creating a new socket
+        checkServerIdentity?: typeof checkServerIdentity | undefined;
+        servername?: string | undefined; // SNI TLS Extension
+        session?: Buffer | undefined;
+        minDHSize?: number | undefined;
+        lookup?: net.LookupFunction | undefined;
+        timeout?: number | undefined;
+        /**
+         * When negotiating TLS-PSK (pre-shared keys), this function is called
+         * with optional identity `hint` provided by the server or `null`
+         * in case of TLS 1.3 where `hint` was removed.
+         * It will be necessary to provide a custom `tls.checkServerIdentity()`
+         * for the connection as the default one will try to check hostname/IP
+         * of the server against the certificate but that's not applicable for PSK
+         * because there won't be a certificate present.
+         * More information can be found in the RFC 4279.
+         *
+         * @param hint message sent from the server to help client
+         * decide which identity to use during negotiation.
+         * Always `null` if TLS 1.3 is used.
+         * @returns Return `null` to stop the negotiation process. `psk` must be
+         * compatible with the selected cipher's digest.
+         * `identity` must use UTF-8 encoding.
+         */
+        pskCallback?(hint: string | null): PSKCallbackNegotation | null;
+    }
+    /**
+     * Accepts encrypted connections using TLS or SSL.
+     * @since v0.3.2
+     */
+    class Server extends net.Server {
+        constructor(secureConnectionListener?: (socket: TLSSocket) => void);
+        constructor(options: TlsOptions, secureConnectionListener?: (socket: TLSSocket) => void);
+        /**
+         * The `server.addContext()` method adds a secure context that will be used if
+         * the client request's SNI name matches the supplied `hostname` (or wildcard).
+         *
+         * When there are multiple matching contexts, the most recently added one is
+         * used.
+         * @since v0.5.3
+         * @param hostname A SNI host name or wildcard (e.g. `'*'`)
+         * @param context An object containing any of the possible properties from the {@link createSecureContext} `options` arguments (e.g. `key`, `cert`, `ca`, etc).
+         */
+        addContext(hostname: string, context: SecureContextOptions): void;
+        /**
+         * Returns the session ticket keys.
+         *
+         * See `Session Resumption` for more information.
+         * @since v3.0.0
+         * @return A 48-byte buffer containing the session ticket keys.
+         */
+        getTicketKeys(): Buffer;
+        /**
+         * The `server.setSecureContext()` method replaces the secure context of an
+         * existing server. Existing connections to the server are not interrupted.
+         * @since v11.0.0
+         * @param options An object containing any of the possible properties from the {@link createSecureContext} `options` arguments (e.g. `key`, `cert`, `ca`, etc).
+         */
+        setSecureContext(options: SecureContextOptions): void;
+        /**
+         * Sets the session ticket keys.
+         *
+         * Changes to the ticket keys are effective only for future server connections.
+         * Existing or currently pending server connections will use the previous keys.
+         *
+         * See `Session Resumption` for more information.
+         * @since v3.0.0
+         * @param keys A 48-byte buffer containing the session ticket keys.
+         */
+        setTicketKeys(keys: Buffer): void;
+        /**
+         * events.EventEmitter
+         * 1. tlsClientError
+         * 2. newSession
+         * 3. OCSPRequest
+         * 4. resumeSession
+         * 5. secureConnection
+         * 6. keylog
+         */
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'tlsClientError', listener: (err: Error, tlsSocket: TLSSocket) => void): this;
+        addListener(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        addListener(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        addListener(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        addListener(event: 'secureConnection', listener: (tlsSocket: TLSSocket) => void): this;
+        addListener(event: 'keylog', listener: (line: Buffer, tlsSocket: TLSSocket) => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'tlsClientError', err: Error, tlsSocket: TLSSocket): boolean;
+        emit(event: 'newSession', sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void): boolean;
+        emit(event: 'OCSPRequest', certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void): boolean;
+        emit(event: 'resumeSession', sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void): boolean;
+        emit(event: 'secureConnection', tlsSocket: TLSSocket): boolean;
+        emit(event: 'keylog', line: Buffer, tlsSocket: TLSSocket): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'tlsClientError', listener: (err: Error, tlsSocket: TLSSocket) => void): this;
+        on(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        on(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        on(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        on(event: 'secureConnection', listener: (tlsSocket: TLSSocket) => void): this;
+        on(event: 'keylog', listener: (line: Buffer, tlsSocket: TLSSocket) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'tlsClientError', listener: (err: Error, tlsSocket: TLSSocket) => void): this;
+        once(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        once(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        once(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        once(event: 'secureConnection', listener: (tlsSocket: TLSSocket) => void): this;
+        once(event: 'keylog', listener: (line: Buffer, tlsSocket: TLSSocket) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'tlsClientError', listener: (err: Error, tlsSocket: TLSSocket) => void): this;
+        prependListener(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        prependListener(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        prependListener(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        prependListener(event: 'secureConnection', listener: (tlsSocket: TLSSocket) => void): this;
+        prependListener(event: 'keylog', listener: (line: Buffer, tlsSocket: TLSSocket) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'tlsClientError', listener: (err: Error, tlsSocket: TLSSocket) => void): this;
+        prependOnceListener(event: 'newSession', listener: (sessionId: Buffer, sessionData: Buffer, callback: (err: Error, resp: Buffer) => void) => void): this;
+        prependOnceListener(event: 'OCSPRequest', listener: (certificate: Buffer, issuer: Buffer, callback: (err: Error | null, resp: Buffer) => void) => void): this;
+        prependOnceListener(event: 'resumeSession', listener: (sessionId: Buffer, callback: (err: Error, sessionData: Buffer) => void) => void): this;
+        prependOnceListener(event: 'secureConnection', listener: (tlsSocket: TLSSocket) => void): this;
+        prependOnceListener(event: 'keylog', listener: (line: Buffer, tlsSocket: TLSSocket) => void): this;
+    }
+    /**
+     * @deprecated since v0.11.3 Use `tls.TLSSocket` instead.
+     */
+    interface SecurePair {
+        encrypted: TLSSocket;
+        cleartext: TLSSocket;
+    }
+    type SecureVersion = 'TLSv1.3' | 'TLSv1.2' | 'TLSv1.1' | 'TLSv1';
+    interface SecureContextOptions {
+        /**
+         * Optionally override the trusted CA certificates. Default is to trust
+         * the well-known CAs curated by Mozilla. Mozilla's CAs are completely
+         * replaced when CAs are explicitly specified using this option.
+         */
+        ca?: string | Buffer | Array<string | Buffer> | undefined;
+        /**
+         *  Cert chains in PEM format. One cert chain should be provided per
+         *  private key. Each cert chain should consist of the PEM formatted
+         *  certificate for a provided private key, followed by the PEM
+         *  formatted intermediate certificates (if any), in order, and not
+         *  including the root CA (the root CA must be pre-known to the peer,
+         *  see ca). When providing multiple cert chains, they do not have to
+         *  be in the same order as their private keys in key. If the
+         *  intermediate certificates are not provided, the peer will not be
+         *  able to validate the certificate, and the handshake will fail.
+         */
+        cert?: string | Buffer | Array<string | Buffer> | undefined;
+        /**
+         *  Colon-separated list of supported signature algorithms. The list
+         *  can contain digest algorithms (SHA256, MD5 etc.), public key
+         *  algorithms (RSA-PSS, ECDSA etc.), combination of both (e.g
+         *  'RSA+SHA384') or TLS v1.3 scheme names (e.g. rsa_pss_pss_sha512).
+         */
+        sigalgs?: string | undefined;
+        /**
+         * Cipher suite specification, replacing the default. For more
+         * information, see modifying the default cipher suite. Permitted
+         * ciphers can be obtained via tls.getCiphers(). Cipher names must be
+         * uppercased in order for OpenSSL to accept them.
+         */
+        ciphers?: string | undefined;
+        /**
+         * Name of an OpenSSL engine which can provide the client certificate.
+         */
+        clientCertEngine?: string | undefined;
+        /**
+         * PEM formatted CRLs (Certificate Revocation Lists).
+         */
+        crl?: string | Buffer | Array<string | Buffer> | undefined;
+        /**
+         * Diffie Hellman parameters, required for Perfect Forward Secrecy. Use
+         * openssl dhparam to create the parameters. The key length must be
+         * greater than or equal to 1024 bits or else an error will be thrown.
+         * Although 1024 bits is permissible, use 2048 bits or larger for
+         * stronger security. If omitted or invalid, the parameters are
+         * silently discarded and DHE ciphers will not be available.
+         */
+        dhparam?: string | Buffer | undefined;
+        /**
+         * A string describing a named curve or a colon separated list of curve
+         * NIDs or names, for example P-521:P-384:P-256, to use for ECDH key
+         * agreement. Set to auto to select the curve automatically. Use
+         * crypto.getCurves() to obtain a list of available curve names. On
+         * recent releases, openssl ecparam -list_curves will also display the
+         * name and description of each available elliptic curve. Default:
+         * tls.DEFAULT_ECDH_CURVE.
+         */
+        ecdhCurve?: string | undefined;
+        /**
+         * Attempt to use the server's cipher suite preferences instead of the
+         * client's. When true, causes SSL_OP_CIPHER_SERVER_PREFERENCE to be
+         * set in secureOptions
+         */
+        honorCipherOrder?: boolean | undefined;
+        /**
+         * Private keys in PEM format. PEM allows the option of private keys
+         * being encrypted. Encrypted keys will be decrypted with
+         * options.passphrase. Multiple keys using different algorithms can be
+         * provided either as an array of unencrypted key strings or buffers,
+         * or an array of objects in the form {pem: <string|buffer>[,
+         * passphrase: <string>]}. The object form can only occur in an array.
+         * object.passphrase is optional. Encrypted keys will be decrypted with
+         * object.passphrase if provided, or options.passphrase if it is not.
+         */
+        key?: string | Buffer | Array<string | Buffer | KeyObject> | undefined;
+        /**
+         * Name of an OpenSSL engine to get private key from. Should be used
+         * together with privateKeyIdentifier.
+         */
+        privateKeyEngine?: string | undefined;
+        /**
+         * Identifier of a private key managed by an OpenSSL engine. Should be
+         * used together with privateKeyEngine. Should not be set together with
+         * key, because both options define a private key in different ways.
+         */
+        privateKeyIdentifier?: string | undefined;
+        /**
+         * Optionally set the maximum TLS version to allow. One
+         * of `'TLSv1.3'`, `'TLSv1.2'`, `'TLSv1.1'`, or `'TLSv1'`. Cannot be specified along with the
+         * `secureProtocol` option, use one or the other.
+         * **Default:** `'TLSv1.3'`, unless changed using CLI options. Using
+         * `--tls-max-v1.2` sets the default to `'TLSv1.2'`. Using `--tls-max-v1.3` sets the default to
+         * `'TLSv1.3'`. If multiple of the options are provided, the highest maximum is used.
+         */
+        maxVersion?: SecureVersion | undefined;
+        /**
+         * Optionally set the minimum TLS version to allow. One
+         * of `'TLSv1.3'`, `'TLSv1.2'`, `'TLSv1.1'`, or `'TLSv1'`. Cannot be specified along with the
+         * `secureProtocol` option, use one or the other.  It is not recommended to use
+         * less than TLSv1.2, but it may be required for interoperability.
+         * **Default:** `'TLSv1.2'`, unless changed using CLI options. Using
+         * `--tls-v1.0` sets the default to `'TLSv1'`. Using `--tls-v1.1` sets the default to
+         * `'TLSv1.1'`. Using `--tls-min-v1.3` sets the default to
+         * 'TLSv1.3'. If multiple of the options are provided, the lowest minimum is used.
+         */
+        minVersion?: SecureVersion | undefined;
+        /**
+         * Shared passphrase used for a single private key and/or a PFX.
+         */
+        passphrase?: string | undefined;
+        /**
+         * PFX or PKCS12 encoded private key and certificate chain. pfx is an
+         * alternative to providing key and cert individually. PFX is usually
+         * encrypted, if it is, passphrase will be used to decrypt it. Multiple
+         * PFX can be provided either as an array of unencrypted PFX buffers,
+         * or an array of objects in the form {buf: <string|buffer>[,
+         * passphrase: <string>]}. The object form can only occur in an array.
+         * object.passphrase is optional. Encrypted PFX will be decrypted with
+         * object.passphrase if provided, or options.passphrase if it is not.
+         */
+        pfx?: string | Buffer | Array<string | Buffer | PxfObject> | undefined;
+        /**
+         * Optionally affect the OpenSSL protocol behavior, which is not
+         * usually necessary. This should be used carefully if at all! Value is
+         * a numeric bitmask of the SSL_OP_* options from OpenSSL Options
+         */
+        secureOptions?: number | undefined; // Value is a numeric bitmask of the `SSL_OP_*` options
+        /**
+         * Legacy mechanism to select the TLS protocol version to use, it does
+         * not support independent control of the minimum and maximum version,
+         * and does not support limiting the protocol to TLSv1.3. Use
+         * minVersion and maxVersion instead. The possible values are listed as
+         * SSL_METHODS, use the function names as strings. For example, use
+         * 'TLSv1_1_method' to force TLS version 1.1, or 'TLS_method' to allow
+         * any TLS protocol version up to TLSv1.3. It is not recommended to use
+         * TLS versions less than 1.2, but it may be required for
+         * interoperability. Default: none, see minVersion.
+         */
+        secureProtocol?: string | undefined;
+        /**
+         * Opaque identifier used by servers to ensure session state is not
+         * shared between applications. Unused by clients.
+         */
+        sessionIdContext?: string | undefined;
+        /**
+         * 48-bytes of cryptographically strong pseudo-random data.
+         * See Session Resumption for more information.
+         */
+        ticketKeys?: Buffer | undefined;
+        /**
+         * The number of seconds after which a TLS session created by the
+         * server will no longer be resumable. See Session Resumption for more
+         * information. Default: 300.
+         */
+        sessionTimeout?: number | undefined;
+    }
+    interface SecureContext {
+        context: any;
+    }
+    /**
+     * Verifies the certificate `cert` is issued to `hostname`.
+     *
+     * Returns [Error](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error) object, populating it with `reason`, `host`, and `cert` on
+     * failure. On success, returns [undefined](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures#Undefined_type).
+     *
+     * This function can be overwritten by providing alternative function as part of
+     * the `options.checkServerIdentity` option passed to `tls.connect()`. The
+     * overwriting function can call `tls.checkServerIdentity()` of course, to augment
+     * the checks done with additional verification.
+     *
+     * This function is only called if the certificate passed all other checks, such as
+     * being issued by trusted CA (`options.ca`).
+     * @since v0.8.4
+     * @param hostname The host name or IP address to verify the certificate against.
+     * @param cert A `certificate object` representing the peer's certificate.
+     */
+    function checkServerIdentity(hostname: string, cert: PeerCertificate): Error | undefined;
+    /**
+     * Creates a new {@link Server}. The `secureConnectionListener`, if provided, is
+     * automatically set as a listener for the `'secureConnection'` event.
+     *
+     * The `ticketKeys` options is automatically shared between `cluster` module
+     * workers.
+     *
+     * The following illustrates a simple echo server:
+     *
+     * ```js
+     * const tls = require('tls');
+     * const fs = require('fs');
+     *
+     * const options = {
+     *   key: fs.readFileSync('server-key.pem'),
+     *   cert: fs.readFileSync('server-cert.pem'),
+     *
+     *   // This is necessary only if using client certificate authentication.
+     *   requestCert: true,
+     *
+     *   // This is necessary only if the client uses a self-signed certificate.
+     *   ca: [ fs.readFileSync('client-cert.pem') ]
+     * };
+     *
+     * const server = tls.createServer(options, (socket) => {
+     *   console.log('server connected',
+     *               socket.authorized ? 'authorized' : 'unauthorized');
+     *   socket.write('welcome!\n');
+     *   socket.setEncoding('utf8');
+     *   socket.pipe(socket);
+     * });
+     * server.listen(8000, () => {
+     *   console.log('server bound');
+     * });
+     * ```
+     *
+     * The server can be tested by connecting to it using the example client from {@link connect}.
+     * @since v0.3.2
+     */
+    function createServer(secureConnectionListener?: (socket: TLSSocket) => void): Server;
+    function createServer(options: TlsOptions, secureConnectionListener?: (socket: TLSSocket) => void): Server;
+    /**
+     * The `callback` function, if specified, will be added as a listener for the `'secureConnect'` event.
+     *
+     * `tls.connect()` returns a {@link TLSSocket} object.
+     *
+     * Unlike the `https` API, `tls.connect()` does not enable the
+     * SNI (Server Name Indication) extension by default, which may cause some
+     * servers to return an incorrect certificate or reject the connection
+     * altogether. To enable SNI, set the `servername` option in addition
+     * to `host`.
+     *
+     * The following illustrates a client for the echo server example from {@link createServer}:
+     *
+     * ```js
+     * // Assumes an echo server that is listening on port 8000.
+     * const tls = require('tls');
+     * const fs = require('fs');
+     *
+     * const options = {
+     *   // Necessary only if the server requires client certificate authentication.
+     *   key: fs.readFileSync('client-key.pem'),
+     *   cert: fs.readFileSync('client-cert.pem'),
+     *
+     *   // Necessary only if the server uses a self-signed certificate.
+     *   ca: [ fs.readFileSync('server-cert.pem') ],
+     *
+     *   // Necessary only if the server's cert isn't for "localhost".
+     *   checkServerIdentity: () => { return null; },
+     * };
+     *
+     * const socket = tls.connect(8000, options, () => {
+     *   console.log('client connected',
+     *               socket.authorized ? 'authorized' : 'unauthorized');
+     *   process.stdin.pipe(socket);
+     *   process.stdin.resume();
+     * });
+     * socket.setEncoding('utf8');
+     * socket.on('data', (data) => {
+     *   console.log(data);
+     * });
+     * socket.on('end', () => {
+     *   console.log('server ends connection');
+     * });
+     * ```
+     * @since v0.11.3
+     */
+    function connect(options: ConnectionOptions, secureConnectListener?: () => void): TLSSocket;
+    function connect(port: number, host?: string, options?: ConnectionOptions, secureConnectListener?: () => void): TLSSocket;
+    function connect(port: number, options?: ConnectionOptions, secureConnectListener?: () => void): TLSSocket;
+    /**
+     * Creates a new secure pair object with two streams, one of which reads and writes
+     * the encrypted data and the other of which reads and writes the cleartext data.
+     * Generally, the encrypted stream is piped to/from an incoming encrypted data
+     * stream and the cleartext one is used as a replacement for the initial encrypted
+     * stream.
+     *
+     * `tls.createSecurePair()` returns a `tls.SecurePair` object with `cleartext` and`encrypted` stream properties.
+     *
+     * Using `cleartext` has the same API as {@link TLSSocket}.
+     *
+     * The `tls.createSecurePair()` method is now deprecated in favor of`tls.TLSSocket()`. For example, the code:
+     *
+     * ```js
+     * pair = tls.createSecurePair(// ... );
+     * pair.encrypted.pipe(socket);
+     * socket.pipe(pair.encrypted);
+     * ```
+     *
+     * can be replaced by:
+     *
+     * ```js
+     * secureSocket = tls.TLSSocket(socket, options);
+     * ```
+     *
+     * where `secureSocket` has the same API as `pair.cleartext`.
+     * @since v0.3.2
+     * @deprecated Since v0.11.3 - Use {@link TLSSocket} instead.
+     * @param context A secure context object as returned by `tls.createSecureContext()`
+     * @param isServer `true` to specify that this TLS connection should be opened as a server.
+     * @param requestCert `true` to specify whether a server should request a certificate from a connecting client. Only applies when `isServer` is `true`.
+     * @param rejectUnauthorized If not `false` a server automatically reject clients with invalid certificates. Only applies when `isServer` is `true`.
+     */
+    function createSecurePair(context?: SecureContext, isServer?: boolean, requestCert?: boolean, rejectUnauthorized?: boolean): SecurePair;
+    /**
+     * {@link createServer} sets the default value of the `honorCipherOrder` option
+     * to `true`, other APIs that create secure contexts leave it unset.
+     *
+     * {@link createServer} uses a 128 bit truncated SHA1 hash value generated
+     * from `process.argv` as the default value of the `sessionIdContext` option, other
+     * APIs that create secure contexts have no default value.
+     *
+     * The `tls.createSecureContext()` method creates a `SecureContext` object. It is
+     * usable as an argument to several `tls` APIs, such as {@link createServer} and `server.addContext()`, but has no public methods.
+     *
+     * A key is _required_ for ciphers that use certificates. Either `key` or`pfx` can be used to provide it.
+     *
+     * If the `ca` option is not given, then Node.js will default to using [Mozilla's publicly trusted list of
+     * CAs](https://hg.mozilla.org/mozilla-central/raw-file/tip/security/nss/lib/ckfw/builtins/certdata.txt).
+     * @since v0.11.13
+     */
+    function createSecureContext(options?: SecureContextOptions): SecureContext;
+    /**
+     * Returns an array with the names of the supported TLS ciphers. The names are
+     * lower-case for historical reasons, but must be uppercased to be used in
+     * the `ciphers` option of {@link createSecureContext}.
+     *
+     * Cipher names that start with `'tls_'` are for TLSv1.3, all the others are for
+     * TLSv1.2 and below.
+     *
+     * ```js
+     * console.log(tls.getCiphers()); // ['aes128-gcm-sha256', 'aes128-sha', ...]
+     * ```
+     * @since v0.10.2
+     */
+    function getCiphers(): string[];
+    /**
+     * The default curve name to use for ECDH key agreement in a tls server.
+     * The default value is 'auto'. See tls.createSecureContext() for further
+     * information.
+     */
+    let DEFAULT_ECDH_CURVE: string;
+    /**
+     * The default value of the maxVersion option of
+     * tls.createSecureContext(). It can be assigned any of the supported TLS
+     * protocol versions, 'TLSv1.3', 'TLSv1.2', 'TLSv1.1', or 'TLSv1'. Default:
+     * 'TLSv1.3', unless changed using CLI options. Using --tls-max-v1.2 sets
+     * the default to 'TLSv1.2'. Using --tls-max-v1.3 sets the default to
+     * 'TLSv1.3'. If multiple of the options are provided, the highest maximum
+     * is used.
+     */
+    let DEFAULT_MAX_VERSION: SecureVersion;
+    /**
+     * The default value of the minVersion option of tls.createSecureContext().
+     * It can be assigned any of the supported TLS protocol versions,
+     * 'TLSv1.3', 'TLSv1.2', 'TLSv1.1', or 'TLSv1'. Default: 'TLSv1.2', unless
+     * changed using CLI options. Using --tls-min-v1.0 sets the default to
+     * 'TLSv1'. Using --tls-min-v1.1 sets the default to 'TLSv1.1'. Using
+     * --tls-min-v1.3 sets the default to 'TLSv1.3'. If multiple of the options
+     * are provided, the lowest minimum is used.
+     */
+    let DEFAULT_MIN_VERSION: SecureVersion;
+    /**
+     * An immutable array of strings representing the root certificates (in PEM
+     * format) used for verifying peer certificates. This is the default value
+     * of the ca option to tls.createSecureContext().
+     */
+    const rootCertificates: ReadonlyArray<string>;
+}
+declare module 'node:tls' {
+    export * from 'tls';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/trace_events.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/trace_events.d.ts
new file mode 100644
index 0000000..cb4e375
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/trace_events.d.ts
@@ -0,0 +1,161 @@
+/**
+ * The `trace_events` module provides a mechanism to centralize tracing information
+ * generated by V8, Node.js core, and userspace code.
+ *
+ * Tracing can be enabled with the `--trace-event-categories` command-line flag
+ * or by using the `trace_events` module. The `--trace-event-categories` flag
+ * accepts a list of comma-separated category names.
+ *
+ * The available categories are:
+ *
+ * * `node`: An empty placeholder.
+ * * `node.async_hooks`: Enables capture of detailed `async_hooks` trace data.
+ * The `async_hooks` events have a unique `asyncId` and a special `triggerId` `triggerAsyncId` property.
+ * * `node.bootstrap`: Enables capture of Node.js bootstrap milestones.
+ * * `node.console`: Enables capture of `console.time()` and `console.count()`output.
+ * * `node.dns.native`: Enables capture of trace data for DNS queries.
+ * * `node.environment`: Enables capture of Node.js Environment milestones.
+ * * `node.fs.sync`: Enables capture of trace data for file system sync methods.
+ * * `node.perf`: Enables capture of `Performance API` measurements.
+ *    * `node.perf.usertiming`: Enables capture of only Performance API User Timing
+ *    measures and marks.
+ *    * `node.perf.timerify`: Enables capture of only Performance API timerify
+ *    measurements.
+ * * `node.promises.rejections`: Enables capture of trace data tracking the number
+ * of unhandled Promise rejections and handled-after-rejections.
+ * * `node.vm.script`: Enables capture of trace data for the `vm` module's`runInNewContext()`, `runInContext()`, and `runInThisContext()` methods.
+ * * `v8`: The `V8` events are GC, compiling, and execution related.
+ *
+ * By default the `node`, `node.async_hooks`, and `v8` categories are enabled.
+ *
+ * ```bash
+ * node --trace-event-categories v8,node,node.async_hooks server.js
+ * ```
+ *
+ * Prior versions of Node.js required the use of the `--trace-events-enabled`flag to enable trace events. This requirement has been removed. However, the`--trace-events-enabled` flag _may_ still be
+ * used and will enable the`node`, `node.async_hooks`, and `v8` trace event categories by default.
+ *
+ * ```bash
+ * node --trace-events-enabled
+ *
+ * # is equivalent to
+ *
+ * node --trace-event-categories v8,node,node.async_hooks
+ * ```
+ *
+ * Alternatively, trace events may be enabled using the `trace_events` module:
+ *
+ * ```js
+ * const trace_events = require('trace_events');
+ * const tracing = trace_events.createTracing({ categories: ['node.perf'] });
+ * tracing.enable();  // Enable trace event capture for the 'node.perf' category
+ *
+ * // do work
+ *
+ * tracing.disable();  // Disable trace event capture for the 'node.perf' category
+ * ```
+ *
+ * Running Node.js with tracing enabled will produce log files that can be opened
+ * in the [`chrome://tracing`](https://www.chromium.org/developers/how-tos/trace-event-profiling-tool) tab of Chrome.
+ *
+ * The logging file is by default called `node_trace.${rotation}.log`, where`${rotation}` is an incrementing log-rotation id. The filepath pattern can
+ * be specified with `--trace-event-file-pattern` that accepts a template
+ * string that supports `${rotation}` and `${pid}`:
+ *
+ * ```bash
+ * node --trace-event-categories v8 --trace-event-file-pattern '${pid}-${rotation}.log' server.js
+ * ```
+ *
+ * The tracing system uses the same time source
+ * as the one used by `process.hrtime()`.
+ * However the trace-event timestamps are expressed in microseconds,
+ * unlike `process.hrtime()` which returns nanoseconds.
+ *
+ * The features from this module are not available in `Worker` threads.
+ * @experimental
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/trace_events.js)
+ */
+declare module 'trace_events' {
+    /**
+     * The `Tracing` object is used to enable or disable tracing for sets of
+     * categories. Instances are created using the
+     * `trace_events.createTracing()` method.
+     *
+     * When created, the `Tracing` object is disabled. Calling the
+     * `tracing.enable()` method adds the categories to the set of enabled trace
+     * event categories. Calling `tracing.disable()` will remove the categories
+     * from the set of enabled trace event categories.
+     */
+    interface Tracing {
+        /**
+         * A comma-separated list of the trace event categories covered by this
+         * `Tracing` object.
+         */
+        readonly categories: string;
+        /**
+         * Disables this `Tracing` object.
+         *
+         * Only trace event categories _not_ covered by other enabled `Tracing`
+         * objects and _not_ specified by the `--trace-event-categories` flag
+         * will be disabled.
+         */
+        disable(): void;
+        /**
+         * Enables this `Tracing` object for the set of categories covered by
+         * the `Tracing` object.
+         */
+        enable(): void;
+        /**
+         * `true` only if the `Tracing` object has been enabled.
+         */
+        readonly enabled: boolean;
+    }
+    interface CreateTracingOptions {
+        /**
+         * An array of trace category names. Values included in the array are
+         * coerced to a string when possible. An error will be thrown if the
+         * value cannot be coerced.
+         */
+        categories: string[];
+    }
+    /**
+     * Creates and returns a `Tracing` object for the given set of `categories`.
+     *
+     * ```js
+     * const trace_events = require('trace_events');
+     * const categories = ['node.perf', 'node.async_hooks'];
+     * const tracing = trace_events.createTracing({ categories });
+     * tracing.enable();
+     * // do stuff
+     * tracing.disable();
+     * ```
+     * @since v10.0.0
+     * @return .
+     */
+    function createTracing(options: CreateTracingOptions): Tracing;
+    /**
+     * Returns a comma-separated list of all currently-enabled trace event
+     * categories. The current set of enabled trace event categories is determined
+     * by the _union_ of all currently-enabled `Tracing` objects and any categories
+     * enabled using the `--trace-event-categories` flag.
+     *
+     * Given the file `test.js` below, the command`node --trace-event-categories node.perf test.js` will print`'node.async_hooks,node.perf'` to the console.
+     *
+     * ```js
+     * const trace_events = require('trace_events');
+     * const t1 = trace_events.createTracing({ categories: ['node.async_hooks'] });
+     * const t2 = trace_events.createTracing({ categories: ['node.perf'] });
+     * const t3 = trace_events.createTracing({ categories: ['v8'] });
+     *
+     * t1.enable();
+     * t2.enable();
+     *
+     * console.log(trace_events.getEnabledCategories());
+     * ```
+     * @since v10.0.0
+     */
+    function getEnabledCategories(): string | undefined;
+}
+declare module 'node:trace_events' {
+    export * from 'trace_events';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/tty.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/tty.d.ts
new file mode 100644
index 0000000..72fdf2e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/tty.d.ts
@@ -0,0 +1,204 @@
+/**
+ * The `tty` module provides the `tty.ReadStream` and `tty.WriteStream` classes.
+ * In most cases, it will not be necessary or possible to use this module directly.
+ * However, it can be accessed using:
+ *
+ * ```js
+ * const tty = require('tty');
+ * ```
+ *
+ * When Node.js detects that it is being run with a text terminal ("TTY")
+ * attached, `process.stdin` will, by default, be initialized as an instance of`tty.ReadStream` and both `process.stdout` and `process.stderr` will, by
+ * default, be instances of `tty.WriteStream`. The preferred method of determining
+ * whether Node.js is being run within a TTY context is to check that the value of
+ * the `process.stdout.isTTY` property is `true`:
+ *
+ * ```console
+ * $ node -p -e "Boolean(process.stdout.isTTY)"
+ * true
+ * $ node -p -e "Boolean(process.stdout.isTTY)" | cat
+ * false
+ * ```
+ *
+ * In most cases, there should be little to no reason for an application to
+ * manually create instances of the `tty.ReadStream` and `tty.WriteStream`classes.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/tty.js)
+ */
+declare module 'tty' {
+    import * as net from 'node:net';
+    /**
+     * The `tty.isatty()` method returns `true` if the given `fd` is associated with
+     * a TTY and `false` if it is not, including whenever `fd` is not a non-negative
+     * integer.
+     * @since v0.5.8
+     * @param fd A numeric file descriptor
+     */
+    function isatty(fd: number): boolean;
+    /**
+     * Represents the readable side of a TTY. In normal circumstances `process.stdin` will be the only `tty.ReadStream` instance in a Node.js
+     * process and there should be no reason to create additional instances.
+     * @since v0.5.8
+     */
+    class ReadStream extends net.Socket {
+        constructor(fd: number, options?: net.SocketConstructorOpts);
+        /**
+         * A `boolean` that is `true` if the TTY is currently configured to operate as a
+         * raw device. Defaults to `false`.
+         * @since v0.7.7
+         */
+        isRaw: boolean;
+        /**
+         * Allows configuration of `tty.ReadStream` so that it operates as a raw device.
+         *
+         * When in raw mode, input is always available character-by-character, not
+         * including modifiers. Additionally, all special processing of characters by the
+         * terminal is disabled, including echoing input characters.Ctrl+C will no longer cause a `SIGINT` when in this mode.
+         * @since v0.7.7
+         * @param mode If `true`, configures the `tty.ReadStream` to operate as a raw device. If `false`, configures the `tty.ReadStream` to operate in its default mode. The `readStream.isRaw`
+         * property will be set to the resulting mode.
+         * @return The read stream instance.
+         */
+        setRawMode(mode: boolean): this;
+        /**
+         * A `boolean` that is always `true` for `tty.ReadStream` instances.
+         * @since v0.5.8
+         */
+        isTTY: boolean;
+    }
+    /**
+     * -1 - to the left from cursor
+     *  0 - the entire line
+     *  1 - to the right from cursor
+     */
+    type Direction = -1 | 0 | 1;
+    /**
+     * Represents the writable side of a TTY. In normal circumstances,`process.stdout` and `process.stderr` will be the only`tty.WriteStream` instances created for a Node.js process and there
+     * should be no reason to create additional instances.
+     * @since v0.5.8
+     */
+    class WriteStream extends net.Socket {
+        constructor(fd: number);
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        addListener(event: 'resize', listener: () => void): this;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        emit(event: 'resize'): boolean;
+        on(event: string, listener: (...args: any[]) => void): this;
+        on(event: 'resize', listener: () => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        once(event: 'resize', listener: () => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: 'resize', listener: () => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'resize', listener: () => void): this;
+        /**
+         * `writeStream.clearLine()` clears the current line of this `WriteStream` in a
+         * direction identified by `dir`.
+         * @since v0.7.7
+         * @param callback Invoked once the operation completes.
+         * @return `false` if the stream wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+         */
+        clearLine(dir: Direction, callback?: () => void): boolean;
+        /**
+         * `writeStream.clearScreenDown()` clears this `WriteStream` from the current
+         * cursor down.
+         * @since v0.7.7
+         * @param callback Invoked once the operation completes.
+         * @return `false` if the stream wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+         */
+        clearScreenDown(callback?: () => void): boolean;
+        /**
+         * `writeStream.cursorTo()` moves this `WriteStream`'s cursor to the specified
+         * position.
+         * @since v0.7.7
+         * @param callback Invoked once the operation completes.
+         * @return `false` if the stream wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+         */
+        cursorTo(x: number, y?: number, callback?: () => void): boolean;
+        cursorTo(x: number, callback: () => void): boolean;
+        /**
+         * `writeStream.moveCursor()` moves this `WriteStream`'s cursor _relative_ to its
+         * current position.
+         * @since v0.7.7
+         * @param callback Invoked once the operation completes.
+         * @return `false` if the stream wishes for the calling code to wait for the `'drain'` event to be emitted before continuing to write additional data; otherwise `true`.
+         */
+        moveCursor(dx: number, dy: number, callback?: () => void): boolean;
+        /**
+         * Returns:
+         *
+         * * `1` for 2,
+         * * `4` for 16,
+         * * `8` for 256,
+         * * `24` for 16,777,216 colors supported.
+         *
+         * Use this to determine what colors the terminal supports. Due to the nature of
+         * colors in terminals it is possible to either have false positives or false
+         * negatives. It depends on process information and the environment variables that
+         * may lie about what terminal is used.
+         * It is possible to pass in an `env` object to simulate the usage of a specific
+         * terminal. This can be useful to check how specific environment settings behave.
+         *
+         * To enforce a specific color support, use one of the below environment settings.
+         *
+         * * 2 colors: `FORCE_COLOR = 0` (Disables colors)
+         * * 16 colors: `FORCE_COLOR = 1`
+         * * 256 colors: `FORCE_COLOR = 2`
+         * * 16,777,216 colors: `FORCE_COLOR = 3`
+         *
+         * Disabling color support is also possible by using the `NO_COLOR` and`NODE_DISABLE_COLORS` environment variables.
+         * @since v9.9.0
+         * @param [env=process.env] An object containing the environment variables to check. This enables simulating the usage of a specific terminal.
+         */
+        getColorDepth(env?: object): number;
+        /**
+         * Returns `true` if the `writeStream` supports at least as many colors as provided
+         * in `count`. Minimum support is 2 (black and white).
+         *
+         * This has the same false positives and negatives as described in `writeStream.getColorDepth()`.
+         *
+         * ```js
+         * process.stdout.hasColors();
+         * // Returns true or false depending on if `stdout` supports at least 16 colors.
+         * process.stdout.hasColors(256);
+         * // Returns true or false depending on if `stdout` supports at least 256 colors.
+         * process.stdout.hasColors({ TMUX: '1' });
+         * // Returns true.
+         * process.stdout.hasColors(2 ** 24, { TMUX: '1' });
+         * // Returns false (the environment setting pretends to support 2 ** 8 colors).
+         * ```
+         * @since v11.13.0, v10.16.0
+         * @param [count=16] The number of colors that are requested (minimum 2).
+         * @param [env=process.env] An object containing the environment variables to check. This enables simulating the usage of a specific terminal.
+         */
+        hasColors(count?: number): boolean;
+        hasColors(env?: object): boolean;
+        hasColors(count: number, env?: object): boolean;
+        /**
+         * `writeStream.getWindowSize()` returns the size of the TTY
+         * corresponding to this `WriteStream`. The array is of the type`[numColumns, numRows]` where `numColumns` and `numRows` represent the number
+         * of columns and rows in the corresponding TTY.
+         * @since v0.7.7
+         */
+        getWindowSize(): [number, number];
+        /**
+         * A `number` specifying the number of columns the TTY currently has. This property
+         * is updated whenever the `'resize'` event is emitted.
+         * @since v0.7.7
+         */
+        columns: number;
+        /**
+         * A `number` specifying the number of rows the TTY currently has. This property
+         * is updated whenever the `'resize'` event is emitted.
+         * @since v0.7.7
+         */
+        rows: number;
+        /**
+         * A `boolean` that is always `true`.
+         * @since v0.5.8
+         */
+        isTTY: boolean;
+    }
+}
+declare module 'node:tty' {
+    export * from 'tty';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/url.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/url.d.ts
new file mode 100644
index 0000000..0ec6bd1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/url.d.ts
@@ -0,0 +1,891 @@
+/**
+ * The `url` module provides utilities for URL resolution and parsing. It can be
+ * accessed using:
+ *
+ * ```js
+ * import url from 'url';
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/url.js)
+ */
+declare module 'url' {
+    import { Blob } from 'node:buffer';
+    import { ClientRequestArgs } from 'node:http';
+    import { ParsedUrlQuery, ParsedUrlQueryInput } from 'node:querystring';
+    // Input to `url.format`
+    interface UrlObject {
+        auth?: string | null | undefined;
+        hash?: string | null | undefined;
+        host?: string | null | undefined;
+        hostname?: string | null | undefined;
+        href?: string | null | undefined;
+        pathname?: string | null | undefined;
+        protocol?: string | null | undefined;
+        search?: string | null | undefined;
+        slashes?: boolean | null | undefined;
+        port?: string | number | null | undefined;
+        query?: string | null | ParsedUrlQueryInput | undefined;
+    }
+    // Output of `url.parse`
+    interface Url {
+        auth: string | null;
+        hash: string | null;
+        host: string | null;
+        hostname: string | null;
+        href: string;
+        path: string | null;
+        pathname: string | null;
+        protocol: string | null;
+        search: string | null;
+        slashes: boolean | null;
+        port: string | null;
+        query: string | null | ParsedUrlQuery;
+    }
+    interface UrlWithParsedQuery extends Url {
+        query: ParsedUrlQuery;
+    }
+    interface UrlWithStringQuery extends Url {
+        query: string | null;
+    }
+    /**
+     * The `url.parse()` method takes a URL string, parses it, and returns a URL
+     * object.
+     *
+     * A `TypeError` is thrown if `urlString` is not a string.
+     *
+     * A `URIError` is thrown if the `auth` property is present but cannot be decoded.
+     *
+     * Use of the legacy `url.parse()` method is discouraged. Users should
+     * use the WHATWG `URL` API. Because the `url.parse()` method uses a
+     * lenient, non-standard algorithm for parsing URL strings, security
+     * issues can be introduced. Specifically, issues with [host name spoofing](https://hackerone.com/reports/678487) and
+     * incorrect handling of usernames and passwords have been identified.
+     * @since v0.1.25
+     * @deprecated Legacy: Use the WHATWG URL API instead.
+     * @param urlString The URL string to parse.
+     * @param [parseQueryString=false] If `true`, the `query` property will always be set to an object returned by the {@link querystring} module's `parse()` method. If `false`, the `query` property
+     * on the returned URL object will be an unparsed, undecoded string.
+     * @param [slashesDenoteHost=false] If `true`, the first token after the literal string `//` and preceding the next `/` will be interpreted as the `host`. For instance, given `//foo/bar`, the
+     * result would be `{host: 'foo', pathname: '/bar'}` rather than `{pathname: '//foo/bar'}`.
+     */
+    function parse(urlString: string): UrlWithStringQuery;
+    function parse(urlString: string, parseQueryString: false | undefined, slashesDenoteHost?: boolean): UrlWithStringQuery;
+    function parse(urlString: string, parseQueryString: true, slashesDenoteHost?: boolean): UrlWithParsedQuery;
+    function parse(urlString: string, parseQueryString: boolean, slashesDenoteHost?: boolean): Url;
+    /**
+     * The `url.format()` method returns a formatted URL string derived from`urlObject`.
+     *
+     * ```js
+     * const url = require('url');
+     * url.format({
+     *   protocol: 'https',
+     *   hostname: 'example.com',
+     *   pathname: '/some/path',
+     *   query: {
+     *     page: 1,
+     *     format: 'json'
+     *   }
+     * });
+     *
+     * // => 'https://example.com/some/path?page=1&#x26;format=json'
+     * ```
+     *
+     * If `urlObject` is not an object or a string, `url.format()` will throw a `TypeError`.
+     *
+     * The formatting process operates as follows:
+     *
+     * * A new empty string `result` is created.
+     * * If `urlObject.protocol` is a string, it is appended as-is to `result`.
+     * * Otherwise, if `urlObject.protocol` is not `undefined` and is not a string, an `Error` is thrown.
+     * * For all string values of `urlObject.protocol` that _do not end_ with an ASCII
+     * colon (`:`) character, the literal string `:` will be appended to `result`.
+     * * If either of the following conditions is true, then the literal string `//`will be appended to `result`:
+     *    * `urlObject.slashes` property is true;
+     *    * `urlObject.protocol` begins with `http`, `https`, `ftp`, `gopher`, or`file`;
+     * * If the value of the `urlObject.auth` property is truthy, and either`urlObject.host` or `urlObject.hostname` are not `undefined`, the value of`urlObject.auth` will be coerced into a string
+     * and appended to `result`followed by the literal string `@`.
+     * * If the `urlObject.host` property is `undefined` then:
+     *    * If the `urlObject.hostname` is a string, it is appended to `result`.
+     *    * Otherwise, if `urlObject.hostname` is not `undefined` and is not a string,
+     *    an `Error` is thrown.
+     *    * If the `urlObject.port` property value is truthy, and `urlObject.hostname`is not `undefined`:
+     *          * The literal string `:` is appended to `result`, and
+     *          * The value of `urlObject.port` is coerced to a string and appended to`result`.
+     * * Otherwise, if the `urlObject.host` property value is truthy, the value of`urlObject.host` is coerced to a string and appended to `result`.
+     * * If the `urlObject.pathname` property is a string that is not an empty string:
+     *    * If the `urlObject.pathname`_does not start_ with an ASCII forward slash
+     *    (`/`), then the literal string `'/'` is appended to `result`.
+     *    * The value of `urlObject.pathname` is appended to `result`.
+     * * Otherwise, if `urlObject.pathname` is not `undefined` and is not a string, an `Error` is thrown.
+     * * If the `urlObject.search` property is `undefined` and if the `urlObject.query`property is an `Object`, the literal string `?` is appended to `result`followed by the output of calling the
+     * `querystring` module's `stringify()`method passing the value of `urlObject.query`.
+     * * Otherwise, if `urlObject.search` is a string:
+     *    * If the value of `urlObject.search`_does not start_ with the ASCII question
+     *    mark (`?`) character, the literal string `?` is appended to `result`.
+     *    * The value of `urlObject.search` is appended to `result`.
+     * * Otherwise, if `urlObject.search` is not `undefined` and is not a string, an `Error` is thrown.
+     * * If the `urlObject.hash` property is a string:
+     *    * If the value of `urlObject.hash`_does not start_ with the ASCII hash (`#`)
+     *    character, the literal string `#` is appended to `result`.
+     *    * The value of `urlObject.hash` is appended to `result`.
+     * * Otherwise, if the `urlObject.hash` property is not `undefined` and is not a
+     * string, an `Error` is thrown.
+     * * `result` is returned.
+     * @since v0.1.25
+     * @deprecated Legacy: Use the WHATWG URL API instead.
+     * @param urlObject A URL object (as returned by `url.parse()` or constructed otherwise). If a string, it is converted to an object by passing it to `url.parse()`.
+     */
+    function format(urlObject: URL, options?: URLFormatOptions): string;
+    /**
+     * The `url.format()` method returns a formatted URL string derived from`urlObject`.
+     *
+     * ```js
+     * const url = require('url');
+     * url.format({
+     *   protocol: 'https',
+     *   hostname: 'example.com',
+     *   pathname: '/some/path',
+     *   query: {
+     *     page: 1,
+     *     format: 'json'
+     *   }
+     * });
+     *
+     * // => 'https://example.com/some/path?page=1&#x26;format=json'
+     * ```
+     *
+     * If `urlObject` is not an object or a string, `url.format()` will throw a `TypeError`.
+     *
+     * The formatting process operates as follows:
+     *
+     * * A new empty string `result` is created.
+     * * If `urlObject.protocol` is a string, it is appended as-is to `result`.
+     * * Otherwise, if `urlObject.protocol` is not `undefined` and is not a string, an `Error` is thrown.
+     * * For all string values of `urlObject.protocol` that _do not end_ with an ASCII
+     * colon (`:`) character, the literal string `:` will be appended to `result`.
+     * * If either of the following conditions is true, then the literal string `//`will be appended to `result`:
+     *    * `urlObject.slashes` property is true;
+     *    * `urlObject.protocol` begins with `http`, `https`, `ftp`, `gopher`, or`file`;
+     * * If the value of the `urlObject.auth` property is truthy, and either`urlObject.host` or `urlObject.hostname` are not `undefined`, the value of`urlObject.auth` will be coerced into a string
+     * and appended to `result`followed by the literal string `@`.
+     * * If the `urlObject.host` property is `undefined` then:
+     *    * If the `urlObject.hostname` is a string, it is appended to `result`.
+     *    * Otherwise, if `urlObject.hostname` is not `undefined` and is not a string,
+     *    an `Error` is thrown.
+     *    * If the `urlObject.port` property value is truthy, and `urlObject.hostname`is not `undefined`:
+     *          * The literal string `:` is appended to `result`, and
+     *          * The value of `urlObject.port` is coerced to a string and appended to`result`.
+     * * Otherwise, if the `urlObject.host` property value is truthy, the value of`urlObject.host` is coerced to a string and appended to `result`.
+     * * If the `urlObject.pathname` property is a string that is not an empty string:
+     *    * If the `urlObject.pathname`_does not start_ with an ASCII forward slash
+     *    (`/`), then the literal string `'/'` is appended to `result`.
+     *    * The value of `urlObject.pathname` is appended to `result`.
+     * * Otherwise, if `urlObject.pathname` is not `undefined` and is not a string, an `Error` is thrown.
+     * * If the `urlObject.search` property is `undefined` and if the `urlObject.query`property is an `Object`, the literal string `?` is appended to `result`followed by the output of calling the
+     * `querystring` module's `stringify()`method passing the value of `urlObject.query`.
+     * * Otherwise, if `urlObject.search` is a string:
+     *    * If the value of `urlObject.search`_does not start_ with the ASCII question
+     *    mark (`?`) character, the literal string `?` is appended to `result`.
+     *    * The value of `urlObject.search` is appended to `result`.
+     * * Otherwise, if `urlObject.search` is not `undefined` and is not a string, an `Error` is thrown.
+     * * If the `urlObject.hash` property is a string:
+     *    * If the value of `urlObject.hash`_does not start_ with the ASCII hash (`#`)
+     *    character, the literal string `#` is appended to `result`.
+     *    * The value of `urlObject.hash` is appended to `result`.
+     * * Otherwise, if the `urlObject.hash` property is not `undefined` and is not a
+     * string, an `Error` is thrown.
+     * * `result` is returned.
+     * @since v0.1.25
+     * @deprecated Legacy: Use the WHATWG URL API instead.
+     * @param urlObject A URL object (as returned by `url.parse()` or constructed otherwise). If a string, it is converted to an object by passing it to `url.parse()`.
+     */
+    function format(urlObject: UrlObject | string): string;
+    /**
+     * The `url.resolve()` method resolves a target URL relative to a base URL in a
+     * manner similar to that of a Web browser resolving an anchor tag HREF.
+     *
+     * ```js
+     * const url = require('url');
+     * url.resolve('/one/two/three', 'four');         // '/one/two/four'
+     * url.resolve('http://example.com/', '/one');    // 'http://example.com/one'
+     * url.resolve('http://example.com/one', '/two'); // 'http://example.com/two'
+     * ```
+     *
+     * You can achieve the same result using the WHATWG URL API:
+     *
+     * ```js
+     * function resolve(from, to) {
+     *   const resolvedUrl = new URL(to, new URL(from, 'resolve://'));
+     *   if (resolvedUrl.protocol === 'resolve:') {
+     *     // `from` is a relative URL.
+     *     const { pathname, search, hash } = resolvedUrl;
+     *     return pathname + search + hash;
+     *   }
+     *   return resolvedUrl.toString();
+     * }
+     *
+     * resolve('/one/two/three', 'four');         // '/one/two/four'
+     * resolve('http://example.com/', '/one');    // 'http://example.com/one'
+     * resolve('http://example.com/one', '/two'); // 'http://example.com/two'
+     * ```
+     * @since v0.1.25
+     * @deprecated Legacy: Use the WHATWG URL API instead.
+     * @param from The Base URL being resolved against.
+     * @param to The HREF URL being resolved.
+     */
+    function resolve(from: string, to: string): string;
+    /**
+     * Returns the [Punycode](https://tools.ietf.org/html/rfc5891#section-4.4) ASCII serialization of the `domain`. If `domain` is an
+     * invalid domain, the empty string is returned.
+     *
+     * It performs the inverse operation to {@link domainToUnicode}.
+     *
+     * This feature is only available if the `node` executable was compiled with `ICU` enabled. If not, the domain names are passed through unchanged.
+     *
+     * ```js
+     * import url from 'url';
+     *
+     * console.log(url.domainToASCII('español.com'));
+     * // Prints xn--espaol-zwa.com
+     * console.log(url.domainToASCII('中文.com'));
+     * // Prints xn--fiq228c.com
+     * console.log(url.domainToASCII('xn--iñvalid.com'));
+     * // Prints an empty string
+     * ```
+     * @since v7.4.0, v6.13.0
+     */
+    function domainToASCII(domain: string): string;
+    /**
+     * Returns the Unicode serialization of the `domain`. If `domain` is an invalid
+     * domain, the empty string is returned.
+     *
+     * It performs the inverse operation to {@link domainToASCII}.
+     *
+     * This feature is only available if the `node` executable was compiled with `ICU` enabled. If not, the domain names are passed through unchanged.
+     *
+     * ```js
+     * import url from 'url';
+     *
+     * console.log(url.domainToUnicode('xn--espaol-zwa.com'));
+     * // Prints español.com
+     * console.log(url.domainToUnicode('xn--fiq228c.com'));
+     * // Prints 中文.com
+     * console.log(url.domainToUnicode('xn--iñvalid.com'));
+     * // Prints an empty string
+     * ```
+     * @since v7.4.0, v6.13.0
+     */
+    function domainToUnicode(domain: string): string;
+    /**
+     * This function ensures the correct decodings of percent-encoded characters as
+     * well as ensuring a cross-platform valid absolute path string.
+     *
+     * ```js
+     * import { fileURLToPath } from 'url';
+     *
+     * const __filename = fileURLToPath(import.meta.url);
+     *
+     * new URL('file:///C:/path/').pathname;      // Incorrect: /C:/path/
+     * fileURLToPath('file:///C:/path/');         // Correct:   C:\path\ (Windows)
+     *
+     * new URL('file://nas/foo.txt').pathname;    // Incorrect: /foo.txt
+     * fileURLToPath('file://nas/foo.txt');       // Correct:   \\nas\foo.txt (Windows)
+     *
+     * new URL('file:///你好.txt').pathname;      // Incorrect: /%E4%BD%A0%E5%A5%BD.txt
+     * fileURLToPath('file:///你好.txt');         // Correct:   /你好.txt (POSIX)
+     *
+     * new URL('file:///hello world').pathname;   // Incorrect: /hello%20world
+     * fileURLToPath('file:///hello world');      // Correct:   /hello world (POSIX)
+     * ```
+     * @since v10.12.0
+     * @param url The file URL string or URL object to convert to a path.
+     * @return The fully-resolved platform-specific Node.js file path.
+     */
+    function fileURLToPath(url: string | URL): string;
+    /**
+     * This function ensures that `path` is resolved absolutely, and that the URL
+     * control characters are correctly encoded when converting into a File URL.
+     *
+     * ```js
+     * import { pathToFileURL } from 'url';
+     *
+     * new URL('/foo#1', 'file:');           // Incorrect: file:///foo#1
+     * pathToFileURL('/foo#1');              // Correct:   file:///foo%231 (POSIX)
+     *
+     * new URL('/some/path%.c', 'file:');    // Incorrect: file:///some/path%.c
+     * pathToFileURL('/some/path%.c');       // Correct:   file:///some/path%25.c (POSIX)
+     * ```
+     * @since v10.12.0
+     * @param path The path to convert to a File URL.
+     * @return The file URL object.
+     */
+    function pathToFileURL(path: string): URL;
+    /**
+     * This utility function converts a URL object into an ordinary options object as
+     * expected by the `http.request()` and `https.request()` APIs.
+     *
+     * ```js
+     * import { urlToHttpOptions } from 'url';
+     * const myURL = new URL('https://a:b@測試?abc#foo');
+     *
+     * console.log(urlToHttpOptions(myURL));
+     *
+     * {
+     *   protocol: 'https:',
+     *   hostname: 'xn--g6w251d',
+     *   hash: '#foo',
+     *   search: '?abc',
+     *   pathname: '/',
+     *   path: '/?abc',
+     *   href: 'https://a:b@xn--g6w251d/?abc#foo',
+     *   auth: 'a:b'
+     * }
+     *
+     * ```
+     * @since v15.7.0, v14.18.0
+     * @param url The `WHATWG URL` object to convert to an options object.
+     * @return Options object
+     */
+    function urlToHttpOptions(url: URL): ClientRequestArgs;
+    interface URLFormatOptions {
+        auth?: boolean | undefined;
+        fragment?: boolean | undefined;
+        search?: boolean | undefined;
+        unicode?: boolean | undefined;
+    }
+    /**
+     * Browser-compatible `URL` class, implemented by following the WHATWG URL
+     * Standard. [Examples of parsed URLs](https://url.spec.whatwg.org/#example-url-parsing) may be found in the Standard itself.
+     * The `URL` class is also available on the global object.
+     *
+     * In accordance with browser conventions, all properties of `URL` objects
+     * are implemented as getters and setters on the class prototype, rather than as
+     * data properties on the object itself. Thus, unlike `legacy urlObject` s,
+     * using the `delete` keyword on any properties of `URL` objects (e.g. `delete myURL.protocol`, `delete myURL.pathname`, etc) has no effect but will still
+     * return `true`.
+     * @since v7.0.0, v6.13.0
+     */
+    class URL {
+        /**
+         * Creates a `'blob:nodedata:...'` URL string that represents the given `Blob` object and can be used to retrieve the `Blob` later.
+         *
+         * ```js
+         * const {
+         *   Blob,
+         *   resolveObjectURL,
+         * } = require('buffer');
+         *
+         * const blob = new Blob(['hello']);
+         * const id = URL.createObjectURL(blob);
+         *
+         * // later...
+         *
+         * const otherBlob = resolveObjectURL(id);
+         * console.log(otherBlob.size);
+         * ```
+         *
+         * The data stored by the registered `Blob` will be retained in memory until`URL.revokeObjectURL()` is called to remove it.
+         *
+         * `Blob` objects are registered within the current thread. If using Worker
+         * Threads, `Blob` objects registered within one Worker will not be available
+         * to other workers or the main thread.
+         * @since v16.7.0
+         * @experimental
+         */
+        static createObjectURL(blob: Blob): string;
+        /**
+         * Removes the stored `Blob` identified by the given ID.
+         * @since v16.7.0
+         * @experimental
+         * @param id A `'blob:nodedata:...` URL string returned by a prior call to `URL.createObjectURL()`.
+         */
+        static revokeObjectURL(objectUrl: string): void;
+        constructor(input: string, base?: string | URL);
+        /**
+         * Gets and sets the fragment portion of the URL.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org/foo#bar');
+         * console.log(myURL.hash);
+         * // Prints #bar
+         *
+         * myURL.hash = 'baz';
+         * console.log(myURL.href);
+         * // Prints https://example.org/foo#baz
+         * ```
+         *
+         * Invalid URL characters included in the value assigned to the `hash` property
+         * are `percent-encoded`. The selection of which characters to
+         * percent-encode may vary somewhat from what the {@link parse} and {@link format} methods would produce.
+         */
+        hash: string;
+        /**
+         * Gets and sets the host portion of the URL.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org:81/foo');
+         * console.log(myURL.host);
+         * // Prints example.org:81
+         *
+         * myURL.host = 'example.com:82';
+         * console.log(myURL.href);
+         * // Prints https://example.com:82/foo
+         * ```
+         *
+         * Invalid host values assigned to the `host` property are ignored.
+         */
+        host: string;
+        /**
+         * Gets and sets the host name portion of the URL. The key difference between`url.host` and `url.hostname` is that `url.hostname` does _not_ include the
+         * port.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org:81/foo');
+         * console.log(myURL.hostname);
+         * // Prints example.org
+         *
+         * // Setting the hostname does not change the port
+         * myURL.hostname = 'example.com:82';
+         * console.log(myURL.href);
+         * // Prints https://example.com:81/foo
+         *
+         * // Use myURL.host to change the hostname and port
+         * myURL.host = 'example.org:82';
+         * console.log(myURL.href);
+         * // Prints https://example.org:82/foo
+         * ```
+         *
+         * Invalid host name values assigned to the `hostname` property are ignored.
+         */
+        hostname: string;
+        /**
+         * Gets and sets the serialized URL.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org/foo');
+         * console.log(myURL.href);
+         * // Prints https://example.org/foo
+         *
+         * myURL.href = 'https://example.com/bar';
+         * console.log(myURL.href);
+         * // Prints https://example.com/bar
+         * ```
+         *
+         * Getting the value of the `href` property is equivalent to calling {@link toString}.
+         *
+         * Setting the value of this property to a new value is equivalent to creating a
+         * new `URL` object using `new URL(value)`. Each of the `URL`object's properties will be modified.
+         *
+         * If the value assigned to the `href` property is not a valid URL, a `TypeError`will be thrown.
+         */
+        href: string;
+        /**
+         * Gets the read-only serialization of the URL's origin.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org/foo/bar?baz');
+         * console.log(myURL.origin);
+         * // Prints https://example.org
+         * ```
+         *
+         * ```js
+         * const idnURL = new URL('https://測試');
+         * console.log(idnURL.origin);
+         * // Prints https://xn--g6w251d
+         *
+         * console.log(idnURL.hostname);
+         * // Prints xn--g6w251d
+         * ```
+         */
+        readonly origin: string;
+        /**
+         * Gets and sets the password portion of the URL.
+         *
+         * ```js
+         * const myURL = new URL('https://abc:xyz@example.com');
+         * console.log(myURL.password);
+         * // Prints xyz
+         *
+         * myURL.password = '123';
+         * console.log(myURL.href);
+         * // Prints https://abc:123@example.com
+         * ```
+         *
+         * Invalid URL characters included in the value assigned to the `password` property
+         * are `percent-encoded`. The selection of which characters to
+         * percent-encode may vary somewhat from what the {@link parse} and {@link format} methods would produce.
+         */
+        password: string;
+        /**
+         * Gets and sets the path portion of the URL.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org/abc/xyz?123');
+         * console.log(myURL.pathname);
+         * // Prints /abc/xyz
+         *
+         * myURL.pathname = '/abcdef';
+         * console.log(myURL.href);
+         * // Prints https://example.org/abcdef?123
+         * ```
+         *
+         * Invalid URL characters included in the value assigned to the `pathname`property are `percent-encoded`. The selection of which characters
+         * to percent-encode may vary somewhat from what the {@link parse} and {@link format} methods would produce.
+         */
+        pathname: string;
+        /**
+         * Gets and sets the port portion of the URL.
+         *
+         * The port value may be a number or a string containing a number in the range`0` to `65535` (inclusive). Setting the value to the default port of the`URL` objects given `protocol` will
+         * result in the `port` value becoming
+         * the empty string (`''`).
+         *
+         * The port value can be an empty string in which case the port depends on
+         * the protocol/scheme:
+         *
+         * <omitted>
+         *
+         * Upon assigning a value to the port, the value will first be converted to a
+         * string using `.toString()`.
+         *
+         * If that string is invalid but it begins with a number, the leading number is
+         * assigned to `port`.
+         * If the number lies outside the range denoted above, it is ignored.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org:8888');
+         * console.log(myURL.port);
+         * // Prints 8888
+         *
+         * // Default ports are automatically transformed to the empty string
+         * // (HTTPS protocol's default port is 443)
+         * myURL.port = '443';
+         * console.log(myURL.port);
+         * // Prints the empty string
+         * console.log(myURL.href);
+         * // Prints https://example.org/
+         *
+         * myURL.port = 1234;
+         * console.log(myURL.port);
+         * // Prints 1234
+         * console.log(myURL.href);
+         * // Prints https://example.org:1234/
+         *
+         * // Completely invalid port strings are ignored
+         * myURL.port = 'abcd';
+         * console.log(myURL.port);
+         * // Prints 1234
+         *
+         * // Leading numbers are treated as a port number
+         * myURL.port = '5678abcd';
+         * console.log(myURL.port);
+         * // Prints 5678
+         *
+         * // Non-integers are truncated
+         * myURL.port = 1234.5678;
+         * console.log(myURL.port);
+         * // Prints 1234
+         *
+         * // Out-of-range numbers which are not represented in scientific notation
+         * // will be ignored.
+         * myURL.port = 1e10; // 10000000000, will be range-checked as described below
+         * console.log(myURL.port);
+         * // Prints 1234
+         * ```
+         *
+         * Numbers which contain a decimal point,
+         * such as floating-point numbers or numbers in scientific notation,
+         * are not an exception to this rule.
+         * Leading numbers up to the decimal point will be set as the URL's port,
+         * assuming they are valid:
+         *
+         * ```js
+         * myURL.port = 4.567e21;
+         * console.log(myURL.port);
+         * // Prints 4 (because it is the leading number in the string '4.567e21')
+         * ```
+         */
+        port: string;
+        /**
+         * Gets and sets the protocol portion of the URL.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org');
+         * console.log(myURL.protocol);
+         * // Prints https:
+         *
+         * myURL.protocol = 'ftp';
+         * console.log(myURL.href);
+         * // Prints ftp://example.org/
+         * ```
+         *
+         * Invalid URL protocol values assigned to the `protocol` property are ignored.
+         */
+        protocol: string;
+        /**
+         * Gets and sets the serialized query portion of the URL.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org/abc?123');
+         * console.log(myURL.search);
+         * // Prints ?123
+         *
+         * myURL.search = 'abc=xyz';
+         * console.log(myURL.href);
+         * // Prints https://example.org/abc?abc=xyz
+         * ```
+         *
+         * Any invalid URL characters appearing in the value assigned the `search`property will be `percent-encoded`. The selection of which
+         * characters to percent-encode may vary somewhat from what the {@link parse} and {@link format} methods would produce.
+         */
+        search: string;
+        /**
+         * Gets the `URLSearchParams` object representing the query parameters of the
+         * URL. This property is read-only but the `URLSearchParams` object it provides
+         * can be used to mutate the URL instance; to replace the entirety of query
+         * parameters of the URL, use the {@link search} setter. See `URLSearchParams` documentation for details.
+         *
+         * Use care when using `.searchParams` to modify the `URL` because,
+         * per the WHATWG specification, the `URLSearchParams` object uses
+         * different rules to determine which characters to percent-encode. For
+         * instance, the `URL` object will not percent encode the ASCII tilde (`~`)
+         * character, while `URLSearchParams` will always encode it:
+         *
+         * ```js
+         * const myUrl = new URL('https://example.org/abc?foo=~bar');
+         *
+         * console.log(myUrl.search);  // prints ?foo=~bar
+         *
+         * // Modify the URL via searchParams...
+         * myUrl.searchParams.sort();
+         *
+         * console.log(myUrl.search);  // prints ?foo=%7Ebar
+         * ```
+         */
+        readonly searchParams: URLSearchParams;
+        /**
+         * Gets and sets the username portion of the URL.
+         *
+         * ```js
+         * const myURL = new URL('https://abc:xyz@example.com');
+         * console.log(myURL.username);
+         * // Prints abc
+         *
+         * myURL.username = '123';
+         * console.log(myURL.href);
+         * // Prints https://123:xyz@example.com/
+         * ```
+         *
+         * Any invalid URL characters appearing in the value assigned the `username`property will be `percent-encoded`. The selection of which
+         * characters to percent-encode may vary somewhat from what the {@link parse} and {@link format} methods would produce.
+         */
+        username: string;
+        /**
+         * The `toString()` method on the `URL` object returns the serialized URL. The
+         * value returned is equivalent to that of {@link href} and {@link toJSON}.
+         */
+        toString(): string;
+        /**
+         * The `toJSON()` method on the `URL` object returns the serialized URL. The
+         * value returned is equivalent to that of {@link href} and {@link toString}.
+         *
+         * This method is automatically called when an `URL` object is serialized
+         * with [`JSON.stringify()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify).
+         *
+         * ```js
+         * const myURLs = [
+         *   new URL('https://www.example.com'),
+         *   new URL('https://test.example.org'),
+         * ];
+         * console.log(JSON.stringify(myURLs));
+         * // Prints ["https://www.example.com/","https://test.example.org/"]
+         * ```
+         */
+        toJSON(): string;
+    }
+    /**
+     * The `URLSearchParams` API provides read and write access to the query of a`URL`. The `URLSearchParams` class can also be used standalone with one of the
+     * four following constructors.
+     * The `URLSearchParams` class is also available on the global object.
+     *
+     * The WHATWG `URLSearchParams` interface and the `querystring` module have
+     * similar purpose, but the purpose of the `querystring` module is more
+     * general, as it allows the customization of delimiter characters (`&#x26;` and `=`).
+     * On the other hand, this API is designed purely for URL query strings.
+     *
+     * ```js
+     * const myURL = new URL('https://example.org/?abc=123');
+     * console.log(myURL.searchParams.get('abc'));
+     * // Prints 123
+     *
+     * myURL.searchParams.append('abc', 'xyz');
+     * console.log(myURL.href);
+     * // Prints https://example.org/?abc=123&#x26;abc=xyz
+     *
+     * myURL.searchParams.delete('abc');
+     * myURL.searchParams.set('a', 'b');
+     * console.log(myURL.href);
+     * // Prints https://example.org/?a=b
+     *
+     * const newSearchParams = new URLSearchParams(myURL.searchParams);
+     * // The above is equivalent to
+     * // const newSearchParams = new URLSearchParams(myURL.search);
+     *
+     * newSearchParams.append('a', 'c');
+     * console.log(myURL.href);
+     * // Prints https://example.org/?a=b
+     * console.log(newSearchParams.toString());
+     * // Prints a=b&#x26;a=c
+     *
+     * // newSearchParams.toString() is implicitly called
+     * myURL.search = newSearchParams;
+     * console.log(myURL.href);
+     * // Prints https://example.org/?a=b&#x26;a=c
+     * newSearchParams.delete('a');
+     * console.log(myURL.href);
+     * // Prints https://example.org/?a=b&#x26;a=c
+     * ```
+     * @since v7.5.0, v6.13.0
+     */
+    class URLSearchParams implements Iterable<[string, string]> {
+        constructor(init?: URLSearchParams | string | Record<string, string | ReadonlyArray<string>> | Iterable<[string, string]> | ReadonlyArray<[string, string]>);
+        /**
+         * Append a new name-value pair to the query string.
+         */
+        append(name: string, value: string): void;
+        /**
+         * Remove all name-value pairs whose name is `name`.
+         */
+        delete(name: string): void;
+        /**
+         * Returns an ES6 `Iterator` over each of the name-value pairs in the query.
+         * Each item of the iterator is a JavaScript `Array`. The first item of the `Array`is the `name`, the second item of the `Array` is the `value`.
+         *
+         * Alias for `urlSearchParams[@@iterator]()`.
+         */
+        entries(): IterableIterator<[string, string]>;
+        /**
+         * Iterates over each name-value pair in the query and invokes the given function.
+         *
+         * ```js
+         * const myURL = new URL('https://example.org/?a=b&#x26;c=d');
+         * myURL.searchParams.forEach((value, name, searchParams) => {
+         *   console.log(name, value, myURL.searchParams === searchParams);
+         * });
+         * // Prints:
+         * //   a b true
+         * //   c d true
+         * ```
+         * @param fn Invoked for each name-value pair in the query
+         * @param thisArg To be used as `this` value for when `fn` is called
+         */
+        forEach<TThis = this>(callback: (this: TThis, value: string, name: string, searchParams: URLSearchParams) => void, thisArg?: TThis): void;
+        /**
+         * Returns the value of the first name-value pair whose name is `name`. If there
+         * are no such pairs, `null` is returned.
+         * @return or `null` if there is no name-value pair with the given `name`.
+         */
+        get(name: string): string | null;
+        /**
+         * Returns the values of all name-value pairs whose name is `name`. If there are
+         * no such pairs, an empty array is returned.
+         */
+        getAll(name: string): string[];
+        /**
+         * Returns `true` if there is at least one name-value pair whose name is `name`.
+         */
+        has(name: string): boolean;
+        /**
+         * Returns an ES6 `Iterator` over the names of each name-value pair.
+         *
+         * ```js
+         * const params = new URLSearchParams('foo=bar&#x26;foo=baz');
+         * for (const name of params.keys()) {
+         *   console.log(name);
+         * }
+         * // Prints:
+         * //   foo
+         * //   foo
+         * ```
+         */
+        keys(): IterableIterator<string>;
+        /**
+         * Sets the value in the `URLSearchParams` object associated with `name` to`value`. If there are any pre-existing name-value pairs whose names are `name`,
+         * set the first such pair's value to `value` and remove all others. If not,
+         * append the name-value pair to the query string.
+         *
+         * ```js
+         * const params = new URLSearchParams();
+         * params.append('foo', 'bar');
+         * params.append('foo', 'baz');
+         * params.append('abc', 'def');
+         * console.log(params.toString());
+         * // Prints foo=bar&#x26;foo=baz&#x26;abc=def
+         *
+         * params.set('foo', 'def');
+         * params.set('xyz', 'opq');
+         * console.log(params.toString());
+         * // Prints foo=def&#x26;abc=def&#x26;xyz=opq
+         * ```
+         */
+        set(name: string, value: string): void;
+        /**
+         * Sort all existing name-value pairs in-place by their names. Sorting is done
+         * with a [stable sorting algorithm](https://en.wikipedia.org/wiki/Sorting_algorithm#Stability), so relative order between name-value pairs
+         * with the same name is preserved.
+         *
+         * This method can be used, in particular, to increase cache hits.
+         *
+         * ```js
+         * const params = new URLSearchParams('query[]=abc&#x26;type=search&#x26;query[]=123');
+         * params.sort();
+         * console.log(params.toString());
+         * // Prints query%5B%5D=abc&#x26;query%5B%5D=123&#x26;type=search
+         * ```
+         * @since v7.7.0, v6.13.0
+         */
+        sort(): void;
+        /**
+         * Returns the search parameters serialized as a string, with characters
+         * percent-encoded where necessary.
+         */
+        toString(): string;
+        /**
+         * Returns an ES6 `Iterator` over the values of each name-value pair.
+         */
+        values(): IterableIterator<string>;
+        [Symbol.iterator](): IterableIterator<[string, string]>;
+    }
+
+    import { URL as _URL, URLSearchParams as _URLSearchParams } from 'url';
+    global {
+        interface URLSearchParams extends _URLSearchParams {}
+        interface URL extends _URL {}
+        interface Global {
+            URL: typeof _URL;
+            URLSearchParams: typeof _URLSearchParams;
+        }
+        /**
+         * `URL` class is a global reference for `require('url').URL`
+         * https://nodejs.org/api/url.html#the-whatwg-url-api
+         * @since v10.0.0
+         */
+        var URL:
+            // For compatibility with "dom" and "webworker" URL declarations
+            typeof globalThis extends { onmessage: any, URL: infer URL }
+                ? URL
+                : typeof _URL;
+        /**
+         * `URLSearchParams` class is a global reference for `require('url').URLSearchParams`
+         * https://nodejs.org/api/url.html#class-urlsearchparams
+         * @since v10.0.0
+         */
+        var URLSearchParams:
+            // For compatibility with "dom" and "webworker" URLSearchParams declarations
+            typeof globalThis extends { onmessage: any, URLSearchParams: infer URLSearchParams }
+                ? URLSearchParams
+                : typeof _URLSearchParams;
+    }
+}
+declare module 'node:url' {
+    export * from 'url';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/util.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/util.d.ts
new file mode 100644
index 0000000..575391e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/util.d.ts
@@ -0,0 +1,1594 @@
+/**
+ * The `util` module supports the needs of Node.js internal APIs. Many of the
+ * utilities are useful for application and module developers as well. To access
+ * it:
+ *
+ * ```js
+ * const util = require('util');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/util.js)
+ */
+declare module 'util' {
+    import * as types from 'node:util/types';
+    export interface InspectOptions {
+        /**
+         * If set to `true`, getters are going to be
+         * inspected as well. If set to `'get'` only getters without setter are going
+         * to be inspected. If set to `'set'` only getters having a corresponding
+         * setter are going to be inspected. This might cause side effects depending on
+         * the getter function.
+         * @default `false`
+         */
+        getters?: 'get' | 'set' | boolean | undefined;
+        showHidden?: boolean | undefined;
+        /**
+         * @default 2
+         */
+        depth?: number | null | undefined;
+        colors?: boolean | undefined;
+        customInspect?: boolean | undefined;
+        showProxy?: boolean | undefined;
+        maxArrayLength?: number | null | undefined;
+        /**
+         * Specifies the maximum number of characters to
+         * include when formatting. Set to `null` or `Infinity` to show all elements.
+         * Set to `0` or negative to show no characters.
+         * @default 10000
+         */
+        maxStringLength?: number | null | undefined;
+        breakLength?: number | undefined;
+        /**
+         * Setting this to `false` causes each object key
+         * to be displayed on a new line. It will also add new lines to text that is
+         * longer than `breakLength`. If set to a number, the most `n` inner elements
+         * are united on a single line as long as all properties fit into
+         * `breakLength`. Short array elements are also grouped together. Note that no
+         * text will be reduced below 16 characters, no matter the `breakLength` size.
+         * For more information, see the example below.
+         * @default `true`
+         */
+        compact?: boolean | number | undefined;
+        sorted?: boolean | ((a: string, b: string) => number) | undefined;
+    }
+    export type Style = 'special' | 'number' | 'bigint' | 'boolean' | 'undefined' | 'null' | 'string' | 'symbol' | 'date' | 'regexp' | 'module';
+    export type CustomInspectFunction = (depth: number, options: InspectOptionsStylized) => string;
+    export interface InspectOptionsStylized extends InspectOptions {
+        stylize(text: string, styleType: Style): string;
+    }
+    /**
+     * The `util.format()` method returns a formatted string using the first argument
+     * as a `printf`\-like format string which can contain zero or more format
+     * specifiers. Each specifier is replaced with the converted value from the
+     * corresponding argument. Supported specifiers are:
+     *
+     * If a specifier does not have a corresponding argument, it is not replaced:
+     *
+     * ```js
+     * util.format('%s:%s', 'foo');
+     * // Returns: 'foo:%s'
+     * ```
+     *
+     * Values that are not part of the format string are formatted using`util.inspect()` if their type is not `string`.
+     *
+     * If there are more arguments passed to the `util.format()` method than the
+     * number of specifiers, the extra arguments are concatenated to the returned
+     * string, separated by spaces:
+     *
+     * ```js
+     * util.format('%s:%s', 'foo', 'bar', 'baz');
+     * // Returns: 'foo:bar baz'
+     * ```
+     *
+     * If the first argument does not contain a valid format specifier, `util.format()`returns a string that is the concatenation of all arguments separated by spaces:
+     *
+     * ```js
+     * util.format(1, 2, 3);
+     * // Returns: '1 2 3'
+     * ```
+     *
+     * If only one argument is passed to `util.format()`, it is returned as it is
+     * without any formatting:
+     *
+     * ```js
+     * util.format('%% %s');
+     * // Returns: '%% %s'
+     * ```
+     *
+     * `util.format()` is a synchronous method that is intended as a debugging tool.
+     * Some input values can have a significant performance overhead that can block the
+     * event loop. Use this function with care and never in a hot code path.
+     * @since v0.5.3
+     * @param format A `printf`-like format string.
+     */
+    export function format(format?: any, ...param: any[]): string;
+    /**
+     * This function is identical to {@link format}, except in that it takes
+     * an `inspectOptions` argument which specifies options that are passed along to {@link inspect}.
+     *
+     * ```js
+     * util.formatWithOptions({ colors: true }, 'See object %O', { foo: 42 });
+     * // Returns 'See object { foo: 42 }', where `42` is colored as a number
+     * // when printed to a terminal.
+     * ```
+     * @since v10.0.0
+     */
+    export function formatWithOptions(inspectOptions: InspectOptions, format?: any, ...param: any[]): string;
+    /**
+     * Returns the string name for a numeric error code that comes from a Node.js API.
+     * The mapping between error codes and error names is platform-dependent.
+     * See `Common System Errors` for the names of common errors.
+     *
+     * ```js
+     * fs.access('file/that/does/not/exist', (err) => {
+     *   const name = util.getSystemErrorName(err.errno);
+     *   console.error(name);  // ENOENT
+     * });
+     * ```
+     * @since v9.7.0
+     */
+    export function getSystemErrorName(err: number): string;
+    /**
+     * Returns a Map of all system error codes available from the Node.js API.
+     * The mapping between error codes and error names is platform-dependent.
+     * See `Common System Errors` for the names of common errors.
+     *
+     * ```js
+     * fs.access('file/that/does/not/exist', (err) => {
+     *   const errorMap = util.getSystemErrorMap();
+     *   const name = errorMap.get(err.errno);
+     *   console.error(name);  // ENOENT
+     * });
+     * ```
+     * @since v16.0.0, v14.17.0
+     */
+    export function getSystemErrorMap(): Map<number, [string, string]>;
+    /**
+     * The `util.log()` method prints the given `string` to `stdout` with an included
+     * timestamp.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.log('Timestamped message.');
+     * ```
+     * @since v0.3.0
+     * @deprecated Since v6.0.0 - Use a third party module instead.
+     */
+    export function log(string: string): void;
+    /**
+     * Returns the `string` after replacing any surrogate code points
+     * (or equivalently, any unpaired surrogate code units) with the
+     * Unicode "replacement character" U+FFFD.
+     * @since v16.8.0, v14.18.0
+     */
+    export function toUSVString(string: string): string;
+    /**
+     * The `util.inspect()` method returns a string representation of `object` that is
+     * intended for debugging. The output of `util.inspect` may change at any time
+     * and should not be depended upon programmatically. Additional `options` may be
+     * passed that alter the result.`util.inspect()` will use the constructor's name and/or `@@toStringTag` to make
+     * an identifiable tag for an inspected value.
+     *
+     * ```js
+     * class Foo {
+     *   get [Symbol.toStringTag]() {
+     *     return 'bar';
+     *   }
+     * }
+     *
+     * class Bar {}
+     *
+     * const baz = Object.create(null, { [Symbol.toStringTag]: { value: 'foo' } });
+     *
+     * util.inspect(new Foo()); // 'Foo [bar] {}'
+     * util.inspect(new Bar()); // 'Bar {}'
+     * util.inspect(baz);       // '[foo] {}'
+     * ```
+     *
+     * Circular references point to their anchor by using a reference index:
+     *
+     * ```js
+     * const { inspect } = require('util');
+     *
+     * const obj = {};
+     * obj.a = [obj];
+     * obj.b = {};
+     * obj.b.inner = obj.b;
+     * obj.b.obj = obj;
+     *
+     * console.log(inspect(obj));
+     * // <ref *1> {
+     * //   a: [ [Circular *1] ],
+     * //   b: <ref *2> { inner: [Circular *2], obj: [Circular *1] }
+     * // }
+     * ```
+     *
+     * The following example inspects all properties of the `util` object:
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * console.log(util.inspect(util, { showHidden: true, depth: null }));
+     * ```
+     *
+     * The following example highlights the effect of the `compact` option:
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * const o = {
+     *   a: [1, 2, [[
+     *     'Lorem ipsum dolor sit amet,\nconsectetur adipiscing elit, sed do ' +
+     *       'eiusmod \ntempor incididunt ut labore et dolore magna aliqua.',
+     *     'test',
+     *     'foo']], 4],
+     *   b: new Map([['za', 1], ['zb', 'test']])
+     * };
+     * console.log(util.inspect(o, { compact: true, depth: 5, breakLength: 80 }));
+     *
+     * // { a:
+     * //   [ 1,
+     * //     2,
+     * //     [ [ 'Lorem ipsum dolor sit amet,\nconsectetur [...]', // A long line
+     * //           'test',
+     * //           'foo' ] ],
+     * //     4 ],
+     * //   b: Map(2) { 'za' => 1, 'zb' => 'test' } }
+     *
+     * // Setting `compact` to false or an integer creates more reader friendly output.
+     * console.log(util.inspect(o, { compact: false, depth: 5, breakLength: 80 }));
+     *
+     * // {
+     * //   a: [
+     * //     1,
+     * //     2,
+     * //     [
+     * //       [
+     * //         'Lorem ipsum dolor sit amet,\n' +
+     * //           'consectetur adipiscing elit, sed do eiusmod \n' +
+     * //           'tempor incididunt ut labore et dolore magna aliqua.',
+     * //         'test',
+     * //         'foo'
+     * //       ]
+     * //     ],
+     * //     4
+     * //   ],
+     * //   b: Map(2) {
+     * //     'za' => 1,
+     * //     'zb' => 'test'
+     * //   }
+     * // }
+     *
+     * // Setting `breakLength` to e.g. 150 will print the "Lorem ipsum" text in a
+     * // single line.
+     * ```
+     *
+     * The `showHidden` option allows [`WeakMap`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WeakMap) and
+     * [`WeakSet`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WeakSet) entries to be
+     * inspected. If there are more entries than `maxArrayLength`, there is no
+     * guarantee which entries are displayed. That means retrieving the same [`WeakSet`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WeakSet) entries twice may
+     * result in different output. Furthermore, entries
+     * with no remaining strong references may be garbage collected at any time.
+     *
+     * ```js
+     * const { inspect } = require('util');
+     *
+     * const obj = { a: 1 };
+     * const obj2 = { b: 2 };
+     * const weakSet = new WeakSet([obj, obj2]);
+     *
+     * console.log(inspect(weakSet, { showHidden: true }));
+     * // WeakSet { { a: 1 }, { b: 2 } }
+     * ```
+     *
+     * The `sorted` option ensures that an object's property insertion order does not
+     * impact the result of `util.inspect()`.
+     *
+     * ```js
+     * const { inspect } = require('util');
+     * const assert = require('assert');
+     *
+     * const o1 = {
+     *   b: [2, 3, 1],
+     *   a: '`a` comes before `b`',
+     *   c: new Set([2, 3, 1])
+     * };
+     * console.log(inspect(o1, { sorted: true }));
+     * // { a: '`a` comes before `b`', b: [ 2, 3, 1 ], c: Set(3) { 1, 2, 3 } }
+     * console.log(inspect(o1, { sorted: (a, b) => b.localeCompare(a) }));
+     * // { c: Set(3) { 3, 2, 1 }, b: [ 2, 3, 1 ], a: '`a` comes before `b`' }
+     *
+     * const o2 = {
+     *   c: new Set([2, 1, 3]),
+     *   a: '`a` comes before `b`',
+     *   b: [2, 3, 1]
+     * };
+     * assert.strict.equal(
+     *   inspect(o1, { sorted: true }),
+     *   inspect(o2, { sorted: true })
+     * );
+     * ```
+     *
+     * `util.inspect()` is a synchronous method intended for debugging. Its maximum
+     * output length is approximately 128 MB. Inputs that result in longer output will
+     * be truncated.
+     * @since v0.3.0
+     * @param object Any JavaScript primitive or `Object`.
+     * @return The representation of `object`.
+     */
+    export function inspect(object: any, showHidden?: boolean, depth?: number | null, color?: boolean): string;
+    export function inspect(object: any, options?: InspectOptions): string;
+    export namespace inspect {
+        let colors: NodeJS.Dict<[number, number]>;
+        let styles: {
+            [K in Style]: string;
+        };
+        let defaultOptions: InspectOptions;
+        /**
+         * Allows changing inspect settings from the repl.
+         */
+        let replDefaults: InspectOptions;
+        /**
+         * That can be used to declare custom inspect functions.
+         */
+        const custom: unique symbol;
+    }
+    /**
+     * Alias for [`Array.isArray()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/isArray).
+     *
+     * Returns `true` if the given `object` is an `Array`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isArray([]);
+     * // Returns: true
+     * util.isArray(new Array());
+     * // Returns: true
+     * util.isArray({});
+     * // Returns: false
+     * ```
+     * @since v0.6.0
+     * @deprecated Since v4.0.0 - Use `isArray` instead.
+     */
+    export function isArray(object: unknown): object is unknown[];
+    /**
+     * Returns `true` if the given `object` is a `RegExp`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isRegExp(/some regexp/);
+     * // Returns: true
+     * util.isRegExp(new RegExp('another regexp'));
+     * // Returns: true
+     * util.isRegExp({});
+     * // Returns: false
+     * ```
+     * @since v0.6.0
+     * @deprecated Since v4.0.0 - Deprecated
+     */
+    export function isRegExp(object: unknown): object is RegExp;
+    /**
+     * Returns `true` if the given `object` is a `Date`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isDate(new Date());
+     * // Returns: true
+     * util.isDate(Date());
+     * // false (without 'new' returns a String)
+     * util.isDate({});
+     * // Returns: false
+     * ```
+     * @since v0.6.0
+     * @deprecated Since v4.0.0 - Use {@link types.isDate} instead.
+     */
+    export function isDate(object: unknown): object is Date;
+    /**
+     * Returns `true` if the given `object` is an `Error`. Otherwise, returns`false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isError(new Error());
+     * // Returns: true
+     * util.isError(new TypeError());
+     * // Returns: true
+     * util.isError({ name: 'Error', message: 'an error occurred' });
+     * // Returns: false
+     * ```
+     *
+     * This method relies on `Object.prototype.toString()` behavior. It is
+     * possible to obtain an incorrect result when the `object` argument manipulates`@@toStringTag`.
+     *
+     * ```js
+     * const util = require('util');
+     * const obj = { name: 'Error', message: 'an error occurred' };
+     *
+     * util.isError(obj);
+     * // Returns: false
+     * obj[Symbol.toStringTag] = 'Error';
+     * util.isError(obj);
+     * // Returns: true
+     * ```
+     * @since v0.6.0
+     * @deprecated Since v4.0.0 - Use {@link types.isNativeError} instead.
+     */
+    export function isError(object: unknown): object is Error;
+    /**
+     * Usage of `util.inherits()` is discouraged. Please use the ES6 `class` and`extends` keywords to get language level inheritance support. Also note
+     * that the two styles are [semantically incompatible](https://github.com/nodejs/node/issues/4179).
+     *
+     * Inherit the prototype methods from one [constructor](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/constructor) into another. The
+     * prototype of `constructor` will be set to a new object created from`superConstructor`.
+     *
+     * This mainly adds some input validation on top of`Object.setPrototypeOf(constructor.prototype, superConstructor.prototype)`.
+     * As an additional convenience, `superConstructor` will be accessible
+     * through the `constructor.super_` property.
+     *
+     * ```js
+     * const util = require('util');
+     * const EventEmitter = require('events');
+     *
+     * function MyStream() {
+     *   EventEmitter.call(this);
+     * }
+     *
+     * util.inherits(MyStream, EventEmitter);
+     *
+     * MyStream.prototype.write = function(data) {
+     *   this.emit('data', data);
+     * };
+     *
+     * const stream = new MyStream();
+     *
+     * console.log(stream instanceof EventEmitter); // true
+     * console.log(MyStream.super_ === EventEmitter); // true
+     *
+     * stream.on('data', (data) => {
+     *   console.log(`Received data: "${data}"`);
+     * });
+     * stream.write('It works!'); // Received data: "It works!"
+     * ```
+     *
+     * ES6 example using `class` and `extends`:
+     *
+     * ```js
+     * const EventEmitter = require('events');
+     *
+     * class MyStream extends EventEmitter {
+     *   write(data) {
+     *     this.emit('data', data);
+     *   }
+     * }
+     *
+     * const stream = new MyStream();
+     *
+     * stream.on('data', (data) => {
+     *   console.log(`Received data: "${data}"`);
+     * });
+     * stream.write('With ES6');
+     * ```
+     * @since v0.3.0
+     * @deprecated Legacy: Use ES2015 class syntax and `extends` keyword instead.
+     */
+    export function inherits(constructor: unknown, superConstructor: unknown): void;
+    export type DebugLoggerFunction = (msg: string, ...param: unknown[]) => void;
+    export interface DebugLogger extends DebugLoggerFunction {
+        enabled: boolean;
+    }
+    /**
+     * The `util.debuglog()` method is used to create a function that conditionally
+     * writes debug messages to `stderr` based on the existence of the `NODE_DEBUG`environment variable. If the `section` name appears within the value of that
+     * environment variable, then the returned function operates similar to `console.error()`. If not, then the returned function is a no-op.
+     *
+     * ```js
+     * const util = require('util');
+     * const debuglog = util.debuglog('foo');
+     *
+     * debuglog('hello from foo [%d]', 123);
+     * ```
+     *
+     * If this program is run with `NODE_DEBUG=foo` in the environment, then
+     * it will output something like:
+     *
+     * ```console
+     * FOO 3245: hello from foo [123]
+     * ```
+     *
+     * where `3245` is the process id. If it is not run with that
+     * environment variable set, then it will not print anything.
+     *
+     * The `section` supports wildcard also:
+     *
+     * ```js
+     * const util = require('util');
+     * const debuglog = util.debuglog('foo-bar');
+     *
+     * debuglog('hi there, it\'s foo-bar [%d]', 2333);
+     * ```
+     *
+     * if it is run with `NODE_DEBUG=foo*` in the environment, then it will output
+     * something like:
+     *
+     * ```console
+     * FOO-BAR 3257: hi there, it's foo-bar [2333]
+     * ```
+     *
+     * Multiple comma-separated `section` names may be specified in the `NODE_DEBUG`environment variable: `NODE_DEBUG=fs,net,tls`.
+     *
+     * The optional `callback` argument can be used to replace the logging function
+     * with a different function that doesn't have any initialization or
+     * unnecessary wrapping.
+     *
+     * ```js
+     * const util = require('util');
+     * let debuglog = util.debuglog('internals', (debug) => {
+     *   // Replace with a logging function that optimizes out
+     *   // testing if the section is enabled
+     *   debuglog = debug;
+     * });
+     * ```
+     * @since v0.11.3
+     * @param section A string identifying the portion of the application for which the `debuglog` function is being created.
+     * @param callback A callback invoked the first time the logging function is called with a function argument that is a more optimized logging function.
+     * @return The logging function
+     */
+    export function debuglog(section: string, callback?: (fn: DebugLoggerFunction) => void): DebugLogger;
+    export const debug: typeof debuglog;
+    /**
+     * Returns `true` if the given `object` is a `Boolean`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isBoolean(1);
+     * // Returns: false
+     * util.isBoolean(0);
+     * // Returns: false
+     * util.isBoolean(false);
+     * // Returns: true
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `typeof value === 'boolean'` instead.
+     */
+    export function isBoolean(object: unknown): object is boolean;
+    /**
+     * Returns `true` if the given `object` is a `Buffer`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isBuffer({ length: 0 });
+     * // Returns: false
+     * util.isBuffer([]);
+     * // Returns: false
+     * util.isBuffer(Buffer.from('hello world'));
+     * // Returns: true
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `isBuffer` instead.
+     */
+    export function isBuffer(object: unknown): object is Buffer;
+    /**
+     * Returns `true` if the given `object` is a `Function`. Otherwise, returns`false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * function Foo() {}
+     * const Bar = () => {};
+     *
+     * util.isFunction({});
+     * // Returns: false
+     * util.isFunction(Foo);
+     * // Returns: true
+     * util.isFunction(Bar);
+     * // Returns: true
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `typeof value === 'function'` instead.
+     */
+    export function isFunction(object: unknown): boolean;
+    /**
+     * Returns `true` if the given `object` is strictly `null`. Otherwise, returns`false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isNull(0);
+     * // Returns: false
+     * util.isNull(undefined);
+     * // Returns: false
+     * util.isNull(null);
+     * // Returns: true
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `value === null` instead.
+     */
+    export function isNull(object: unknown): object is null;
+    /**
+     * Returns `true` if the given `object` is `null` or `undefined`. Otherwise,
+     * returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isNullOrUndefined(0);
+     * // Returns: false
+     * util.isNullOrUndefined(undefined);
+     * // Returns: true
+     * util.isNullOrUndefined(null);
+     * // Returns: true
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `value === undefined || value === null` instead.
+     */
+    export function isNullOrUndefined(object: unknown): object is null | undefined;
+    /**
+     * Returns `true` if the given `object` is a `Number`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isNumber(false);
+     * // Returns: false
+     * util.isNumber(Infinity);
+     * // Returns: true
+     * util.isNumber(0);
+     * // Returns: true
+     * util.isNumber(NaN);
+     * // Returns: true
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `typeof value === 'number'` instead.
+     */
+    export function isNumber(object: unknown): object is number;
+    /**
+     * Returns `true` if the given `object` is strictly an `Object`**and** not a`Function` (even though functions are objects in JavaScript).
+     * Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isObject(5);
+     * // Returns: false
+     * util.isObject(null);
+     * // Returns: false
+     * util.isObject({});
+     * // Returns: true
+     * util.isObject(() => {});
+     * // Returns: false
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Deprecated: Use `value !== null && typeof value === 'object'` instead.
+     */
+    export function isObject(object: unknown): boolean;
+    /**
+     * Returns `true` if the given `object` is a primitive type. Otherwise, returns`false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isPrimitive(5);
+     * // Returns: true
+     * util.isPrimitive('foo');
+     * // Returns: true
+     * util.isPrimitive(false);
+     * // Returns: true
+     * util.isPrimitive(null);
+     * // Returns: true
+     * util.isPrimitive(undefined);
+     * // Returns: true
+     * util.isPrimitive({});
+     * // Returns: false
+     * util.isPrimitive(() => {});
+     * // Returns: false
+     * util.isPrimitive(/^$/);
+     * // Returns: false
+     * util.isPrimitive(new Date());
+     * // Returns: false
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `(typeof value !== 'object' && typeof value !== 'function') || value === null` instead.
+     */
+    export function isPrimitive(object: unknown): boolean;
+    /**
+     * Returns `true` if the given `object` is a `string`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isString('');
+     * // Returns: true
+     * util.isString('foo');
+     * // Returns: true
+     * util.isString(String('foo'));
+     * // Returns: true
+     * util.isString(5);
+     * // Returns: false
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `typeof value === 'string'` instead.
+     */
+    export function isString(object: unknown): object is string;
+    /**
+     * Returns `true` if the given `object` is a `Symbol`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * util.isSymbol(5);
+     * // Returns: false
+     * util.isSymbol('foo');
+     * // Returns: false
+     * util.isSymbol(Symbol('foo'));
+     * // Returns: true
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `typeof value === 'symbol'` instead.
+     */
+    export function isSymbol(object: unknown): object is symbol;
+    /**
+     * Returns `true` if the given `object` is `undefined`. Otherwise, returns `false`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * const foo = undefined;
+     * util.isUndefined(5);
+     * // Returns: false
+     * util.isUndefined(foo);
+     * // Returns: true
+     * util.isUndefined(null);
+     * // Returns: false
+     * ```
+     * @since v0.11.5
+     * @deprecated Since v4.0.0 - Use `value === undefined` instead.
+     */
+    export function isUndefined(object: unknown): object is undefined;
+    /**
+     * The `util.deprecate()` method wraps `fn` (which may be a function or class) in
+     * such a way that it is marked as deprecated.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * exports.obsoleteFunction = util.deprecate(() => {
+     *   // Do something here.
+     * }, 'obsoleteFunction() is deprecated. Use newShinyFunction() instead.');
+     * ```
+     *
+     * When called, `util.deprecate()` will return a function that will emit a`DeprecationWarning` using the `'warning'` event. The warning will
+     * be emitted and printed to `stderr` the first time the returned function is
+     * called. After the warning is emitted, the wrapped function is called without
+     * emitting a warning.
+     *
+     * If the same optional `code` is supplied in multiple calls to `util.deprecate()`,
+     * the warning will be emitted only once for that `code`.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * const fn1 = util.deprecate(someFunction, someMessage, 'DEP0001');
+     * const fn2 = util.deprecate(someOtherFunction, someOtherMessage, 'DEP0001');
+     * fn1(); // Emits a deprecation warning with code DEP0001
+     * fn2(); // Does not emit a deprecation warning because it has the same code
+     * ```
+     *
+     * If either the `--no-deprecation` or `--no-warnings` command-line flags are
+     * used, or if the `process.noDeprecation` property is set to `true`_prior_ to
+     * the first deprecation warning, the `util.deprecate()` method does nothing.
+     *
+     * If the `--trace-deprecation` or `--trace-warnings` command-line flags are set,
+     * or the `process.traceDeprecation` property is set to `true`, a warning and a
+     * stack trace are printed to `stderr` the first time the deprecated function is
+     * called.
+     *
+     * If the `--throw-deprecation` command-line flag is set, or the`process.throwDeprecation` property is set to `true`, then an exception will be
+     * thrown when the deprecated function is called.
+     *
+     * The `--throw-deprecation` command-line flag and `process.throwDeprecation`property take precedence over `--trace-deprecation` and`process.traceDeprecation`.
+     * @since v0.8.0
+     * @param fn The function that is being deprecated.
+     * @param msg A warning message to display when the deprecated function is invoked.
+     * @param code A deprecation code. See the `list of deprecated APIs` for a list of codes.
+     * @return The deprecated function wrapped to emit a warning.
+     */
+    export function deprecate<T extends Function>(fn: T, msg: string, code?: string): T;
+    /**
+     * Returns `true` if there is deep strict equality between `val1` and `val2`.
+     * Otherwise, returns `false`.
+     *
+     * See `assert.deepStrictEqual()` for more information about deep strict
+     * equality.
+     * @since v9.0.0
+     */
+    export function isDeepStrictEqual(val1: unknown, val2: unknown): boolean;
+    /**
+     * Returns `str` with any ANSI escape codes removed.
+     *
+     * ```js
+     * console.log(util.stripVTControlCharacters('\u001B[4mvalue\u001B[0m'));
+     * // Prints "value"
+     * ```
+     * @since v16.11.0
+     */
+    export function stripVTControlCharacters(str: string): string;
+    /**
+     * Takes an `async` function (or a function that returns a `Promise`) and returns a
+     * function following the error-first callback style, i.e. taking
+     * an `(err, value) => ...` callback as the last argument. In the callback, the
+     * first argument will be the rejection reason (or `null` if the `Promise`resolved), and the second argument will be the resolved value.
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * async function fn() {
+     *   return 'hello world';
+     * }
+     * const callbackFunction = util.callbackify(fn);
+     *
+     * callbackFunction((err, ret) => {
+     *   if (err) throw err;
+     *   console.log(ret);
+     * });
+     * ```
+     *
+     * Will print:
+     *
+     * ```text
+     * hello world
+     * ```
+     *
+     * The callback is executed asynchronously, and will have a limited stack trace.
+     * If the callback throws, the process will emit an `'uncaughtException'` event, and if not handled will exit.
+     *
+     * Since `null` has a special meaning as the first argument to a callback, if a
+     * wrapped function rejects a `Promise` with a falsy value as a reason, the value
+     * is wrapped in an `Error` with the original value stored in a field named`reason`.
+     *
+     * ```js
+     * function fn() {
+     *   return Promise.reject(null);
+     * }
+     * const callbackFunction = util.callbackify(fn);
+     *
+     * callbackFunction((err, ret) => {
+     *   // When the Promise was rejected with `null` it is wrapped with an Error and
+     *   // the original value is stored in `reason`.
+     *   err &#x26;&#x26; err.hasOwnProperty('reason') &#x26;&#x26; err.reason === null;  // true
+     * });
+     * ```
+     * @since v8.2.0
+     * @param original An `async` function
+     * @return a callback style function
+     */
+    export function callbackify(fn: () => Promise<void>): (callback: (err: NodeJS.ErrnoException) => void) => void;
+    export function callbackify<TResult>(fn: () => Promise<TResult>): (callback: (err: NodeJS.ErrnoException, result: TResult) => void) => void;
+    export function callbackify<T1>(fn: (arg1: T1) => Promise<void>): (arg1: T1, callback: (err: NodeJS.ErrnoException) => void) => void;
+    export function callbackify<T1, TResult>(fn: (arg1: T1) => Promise<TResult>): (arg1: T1, callback: (err: NodeJS.ErrnoException, result: TResult) => void) => void;
+    export function callbackify<T1, T2>(fn: (arg1: T1, arg2: T2) => Promise<void>): (arg1: T1, arg2: T2, callback: (err: NodeJS.ErrnoException) => void) => void;
+    export function callbackify<T1, T2, TResult>(fn: (arg1: T1, arg2: T2) => Promise<TResult>): (arg1: T1, arg2: T2, callback: (err: NodeJS.ErrnoException | null, result: TResult) => void) => void;
+    export function callbackify<T1, T2, T3>(fn: (arg1: T1, arg2: T2, arg3: T3) => Promise<void>): (arg1: T1, arg2: T2, arg3: T3, callback: (err: NodeJS.ErrnoException) => void) => void;
+    export function callbackify<T1, T2, T3, TResult>(
+        fn: (arg1: T1, arg2: T2, arg3: T3) => Promise<TResult>
+    ): (arg1: T1, arg2: T2, arg3: T3, callback: (err: NodeJS.ErrnoException | null, result: TResult) => void) => void;
+    export function callbackify<T1, T2, T3, T4>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4) => Promise<void>
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, callback: (err: NodeJS.ErrnoException) => void) => void;
+    export function callbackify<T1, T2, T3, T4, TResult>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4) => Promise<TResult>
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, callback: (err: NodeJS.ErrnoException | null, result: TResult) => void) => void;
+    export function callbackify<T1, T2, T3, T4, T5>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5) => Promise<void>
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, callback: (err: NodeJS.ErrnoException) => void) => void;
+    export function callbackify<T1, T2, T3, T4, T5, TResult>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5) => Promise<TResult>
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, callback: (err: NodeJS.ErrnoException | null, result: TResult) => void) => void;
+    export function callbackify<T1, T2, T3, T4, T5, T6>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, arg6: T6) => Promise<void>
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, arg6: T6, callback: (err: NodeJS.ErrnoException) => void) => void;
+    export function callbackify<T1, T2, T3, T4, T5, T6, TResult>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, arg6: T6) => Promise<TResult>
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, arg6: T6, callback: (err: NodeJS.ErrnoException | null, result: TResult) => void) => void;
+    export interface CustomPromisifyLegacy<TCustom extends Function> extends Function {
+        __promisify__: TCustom;
+    }
+    export interface CustomPromisifySymbol<TCustom extends Function> extends Function {
+        [promisify.custom]: TCustom;
+    }
+    export type CustomPromisify<TCustom extends Function> = CustomPromisifySymbol<TCustom> | CustomPromisifyLegacy<TCustom>;
+    /**
+     * Takes a function following the common error-first callback style, i.e. taking
+     * an `(err, value) => ...` callback as the last argument, and returns a version
+     * that returns promises.
+     *
+     * ```js
+     * const util = require('util');
+     * const fs = require('fs');
+     *
+     * const stat = util.promisify(fs.stat);
+     * stat('.').then((stats) => {
+     *   // Do something with `stats`
+     * }).catch((error) => {
+     *   // Handle the error.
+     * });
+     * ```
+     *
+     * Or, equivalently using `async function`s:
+     *
+     * ```js
+     * const util = require('util');
+     * const fs = require('fs');
+     *
+     * const stat = util.promisify(fs.stat);
+     *
+     * async function callStat() {
+     *   const stats = await stat('.');
+     *   console.log(`This directory is owned by ${stats.uid}`);
+     * }
+     * ```
+     *
+     * If there is an `original[util.promisify.custom]` property present, `promisify`will return its value, see `Custom promisified functions`.
+     *
+     * `promisify()` assumes that `original` is a function taking a callback as its
+     * final argument in all cases. If `original` is not a function, `promisify()`will throw an error. If `original` is a function but its last argument is not
+     * an error-first callback, it will still be passed an error-first
+     * callback as its last argument.
+     *
+     * Using `promisify()` on class methods or other methods that use `this` may not
+     * work as expected unless handled specially:
+     *
+     * ```js
+     * const util = require('util');
+     *
+     * class Foo {
+     *   constructor() {
+     *     this.a = 42;
+     *   }
+     *
+     *   bar(callback) {
+     *     callback(null, this.a);
+     *   }
+     * }
+     *
+     * const foo = new Foo();
+     *
+     * const naiveBar = util.promisify(foo.bar);
+     * // TypeError: Cannot read property 'a' of undefined
+     * // naiveBar().then(a => console.log(a));
+     *
+     * naiveBar.call(foo).then((a) => console.log(a)); // '42'
+     *
+     * const bindBar = naiveBar.bind(foo);
+     * bindBar().then((a) => console.log(a)); // '42'
+     * ```
+     * @since v8.0.0
+     */
+    export function promisify<TCustom extends Function>(fn: CustomPromisify<TCustom>): TCustom;
+    export function promisify<TResult>(fn: (callback: (err: any, result: TResult) => void) => void): () => Promise<TResult>;
+    export function promisify(fn: (callback: (err?: any) => void) => void): () => Promise<void>;
+    export function promisify<T1, TResult>(fn: (arg1: T1, callback: (err: any, result: TResult) => void) => void): (arg1: T1) => Promise<TResult>;
+    export function promisify<T1>(fn: (arg1: T1, callback: (err?: any) => void) => void): (arg1: T1) => Promise<void>;
+    export function promisify<T1, T2, TResult>(fn: (arg1: T1, arg2: T2, callback: (err: any, result: TResult) => void) => void): (arg1: T1, arg2: T2) => Promise<TResult>;
+    export function promisify<T1, T2>(fn: (arg1: T1, arg2: T2, callback: (err?: any) => void) => void): (arg1: T1, arg2: T2) => Promise<void>;
+    export function promisify<T1, T2, T3, TResult>(fn: (arg1: T1, arg2: T2, arg3: T3, callback: (err: any, result: TResult) => void) => void): (arg1: T1, arg2: T2, arg3: T3) => Promise<TResult>;
+    export function promisify<T1, T2, T3>(fn: (arg1: T1, arg2: T2, arg3: T3, callback: (err?: any) => void) => void): (arg1: T1, arg2: T2, arg3: T3) => Promise<void>;
+    export function promisify<T1, T2, T3, T4, TResult>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, callback: (err: any, result: TResult) => void) => void
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4) => Promise<TResult>;
+    export function promisify<T1, T2, T3, T4>(fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, callback: (err?: any) => void) => void): (arg1: T1, arg2: T2, arg3: T3, arg4: T4) => Promise<void>;
+    export function promisify<T1, T2, T3, T4, T5, TResult>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, callback: (err: any, result: TResult) => void) => void
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5) => Promise<TResult>;
+    export function promisify<T1, T2, T3, T4, T5>(
+        fn: (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5, callback: (err?: any) => void) => void
+    ): (arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5) => Promise<void>;
+    export function promisify(fn: Function): Function;
+    export namespace promisify {
+        /**
+         * That can be used to declare custom promisified variants of functions.
+         */
+        const custom: unique symbol;
+    }
+    /**
+     * An implementation of the [WHATWG Encoding Standard](https://encoding.spec.whatwg.org/) `TextDecoder` API.
+     *
+     * ```js
+     * const decoder = new TextDecoder('shift_jis');
+     * let string = '';
+     * let buffer;
+     * while (buffer = getNextChunkSomehow()) {
+     *   string += decoder.decode(buffer, { stream: true });
+     * }
+     * string += decoder.decode(); // end-of-stream
+     * ```
+     * @since v8.3.0
+     */
+    export class TextDecoder {
+        /**
+         * The encoding supported by the `TextDecoder` instance.
+         */
+        readonly encoding: string;
+        /**
+         * The value will be `true` if decoding errors result in a `TypeError` being
+         * thrown.
+         */
+        readonly fatal: boolean;
+        /**
+         * The value will be `true` if the decoding result will include the byte order
+         * mark.
+         */
+        readonly ignoreBOM: boolean;
+        constructor(
+            encoding?: string,
+            options?: {
+                fatal?: boolean | undefined;
+                ignoreBOM?: boolean | undefined;
+            }
+        );
+        /**
+         * Decodes the `input` and returns a string. If `options.stream` is `true`, any
+         * incomplete byte sequences occurring at the end of the `input` are buffered
+         * internally and emitted after the next call to `textDecoder.decode()`.
+         *
+         * If `textDecoder.fatal` is `true`, decoding errors that occur will result in a`TypeError` being thrown.
+         * @param input An `ArrayBuffer`, `DataView` or `TypedArray` instance containing the encoded data.
+         */
+        decode(
+            input?: NodeJS.ArrayBufferView | ArrayBuffer | null,
+            options?: {
+                stream?: boolean | undefined;
+            }
+        ): string;
+    }
+    export interface EncodeIntoResult {
+        /**
+         * The read Unicode code units of input.
+         */
+        read: number;
+        /**
+         * The written UTF-8 bytes of output.
+         */
+        written: number;
+    }
+    export { types };
+    /**
+     * An implementation of the [WHATWG Encoding Standard](https://encoding.spec.whatwg.org/) `TextEncoder` API. All
+     * instances of `TextEncoder` only support UTF-8 encoding.
+     *
+     * ```js
+     * const encoder = new TextEncoder();
+     * const uint8array = encoder.encode('this is some data');
+     * ```
+     *
+     * The `TextEncoder` class is also available on the global object.
+     * @since v8.3.0
+     */
+    export class TextEncoder {
+        /**
+         * The encoding supported by the `TextEncoder` instance. Always set to `'utf-8'`.
+         */
+        readonly encoding: string;
+        /**
+         * UTF-8 encodes the `input` string and returns a `Uint8Array` containing the
+         * encoded bytes.
+         * @param [input='an empty string'] The text to encode.
+         */
+        encode(input?: string): Uint8Array;
+        /**
+         * UTF-8 encodes the `src` string to the `dest` Uint8Array and returns an object
+         * containing the read Unicode code units and written UTF-8 bytes.
+         *
+         * ```js
+         * const encoder = new TextEncoder();
+         * const src = 'this is some data';
+         * const dest = new Uint8Array(10);
+         * const { read, written } = encoder.encodeInto(src, dest);
+         * ```
+         * @param src The text to encode.
+         * @param dest The array to hold the encode result.
+         */
+        encodeInto(src: string, dest: Uint8Array): EncodeIntoResult;
+    }
+}
+declare module 'util/types' {
+    export * from 'util/types';
+}
+declare module 'util/types' {
+    import { KeyObject, webcrypto } from 'node:crypto';
+    /**
+     * Returns `true` if the value is a built-in [`ArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer) or
+     * [`SharedArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer) instance.
+     *
+     * See also `util.types.isArrayBuffer()` and `util.types.isSharedArrayBuffer()`.
+     *
+     * ```js
+     * util.types.isAnyArrayBuffer(new ArrayBuffer());  // Returns true
+     * util.types.isAnyArrayBuffer(new SharedArrayBuffer());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isAnyArrayBuffer(object: unknown): object is ArrayBufferLike;
+    /**
+     * Returns `true` if the value is an `arguments` object.
+     *
+     * ```js
+     * function foo() {
+     *   util.types.isArgumentsObject(arguments);  // Returns true
+     * }
+     * ```
+     * @since v10.0.0
+     */
+    function isArgumentsObject(object: unknown): object is IArguments;
+    /**
+     * Returns `true` if the value is a built-in [`ArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer) instance.
+     * This does _not_ include [`SharedArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer) instances. Usually, it is
+     * desirable to test for both; See `util.types.isAnyArrayBuffer()` for that.
+     *
+     * ```js
+     * util.types.isArrayBuffer(new ArrayBuffer());  // Returns true
+     * util.types.isArrayBuffer(new SharedArrayBuffer());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isArrayBuffer(object: unknown): object is ArrayBuffer;
+    /**
+     * Returns `true` if the value is an instance of one of the [`ArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer) views, such as typed
+     * array objects or [`DataView`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView). Equivalent to
+     * [`ArrayBuffer.isView()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/isView).
+     *
+     * ```js
+     * util.types.isArrayBufferView(new Int8Array());  // true
+     * util.types.isArrayBufferView(Buffer.from('hello world')); // true
+     * util.types.isArrayBufferView(new DataView(new ArrayBuffer(16)));  // true
+     * util.types.isArrayBufferView(new ArrayBuffer());  // false
+     * ```
+     * @since v10.0.0
+     */
+    function isArrayBufferView(object: unknown): object is NodeJS.ArrayBufferView;
+    /**
+     * Returns `true` if the value is an [async function](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function).
+     * This only reports back what the JavaScript engine is seeing;
+     * in particular, the return value may not match the original source code if
+     * a transpilation tool was used.
+     *
+     * ```js
+     * util.types.isAsyncFunction(function foo() {});  // Returns false
+     * util.types.isAsyncFunction(async function foo() {});  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isAsyncFunction(object: unknown): boolean;
+    /**
+     * Returns `true` if the value is a `BigInt64Array` instance.
+     *
+     * ```js
+     * util.types.isBigInt64Array(new BigInt64Array());   // Returns true
+     * util.types.isBigInt64Array(new BigUint64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isBigInt64Array(value: unknown): value is BigInt64Array;
+    /**
+     * Returns `true` if the value is a `BigUint64Array` instance.
+     *
+     * ```js
+     * util.types.isBigUint64Array(new BigInt64Array());   // Returns false
+     * util.types.isBigUint64Array(new BigUint64Array());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isBigUint64Array(value: unknown): value is BigUint64Array;
+    /**
+     * Returns `true` if the value is a boolean object, e.g. created
+     * by `new Boolean()`.
+     *
+     * ```js
+     * util.types.isBooleanObject(false);  // Returns false
+     * util.types.isBooleanObject(true);   // Returns false
+     * util.types.isBooleanObject(new Boolean(false)); // Returns true
+     * util.types.isBooleanObject(new Boolean(true));  // Returns true
+     * util.types.isBooleanObject(Boolean(false)); // Returns false
+     * util.types.isBooleanObject(Boolean(true));  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isBooleanObject(object: unknown): object is Boolean;
+    /**
+     * Returns `true` if the value is any boxed primitive object, e.g. created
+     * by `new Boolean()`, `new String()` or `Object(Symbol())`.
+     *
+     * For example:
+     *
+     * ```js
+     * util.types.isBoxedPrimitive(false); // Returns false
+     * util.types.isBoxedPrimitive(new Boolean(false)); // Returns true
+     * util.types.isBoxedPrimitive(Symbol('foo')); // Returns false
+     * util.types.isBoxedPrimitive(Object(Symbol('foo'))); // Returns true
+     * util.types.isBoxedPrimitive(Object(BigInt(5))); // Returns true
+     * ```
+     * @since v10.11.0
+     */
+    function isBoxedPrimitive(object: unknown): object is String | Number | BigInt | Boolean | Symbol;
+    /**
+     * Returns `true` if the value is a built-in [`DataView`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView) instance.
+     *
+     * ```js
+     * const ab = new ArrayBuffer(20);
+     * util.types.isDataView(new DataView(ab));  // Returns true
+     * util.types.isDataView(new Float64Array());  // Returns false
+     * ```
+     *
+     * See also [`ArrayBuffer.isView()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/isView).
+     * @since v10.0.0
+     */
+    function isDataView(object: unknown): object is DataView;
+    /**
+     * Returns `true` if the value is a built-in [`Date`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date) instance.
+     *
+     * ```js
+     * util.types.isDate(new Date());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isDate(object: unknown): object is Date;
+    /**
+     * Returns `true` if the value is a native `External` value.
+     *
+     * A native `External` value is a special type of object that contains a
+     * raw C++ pointer (`void*`) for access from native code, and has no other
+     * properties. Such objects are created either by Node.js internals or native
+     * addons. In JavaScript, they are [frozen](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/freeze) objects with a`null` prototype.
+     *
+     * ```c
+     * #include <js_native_api.h>
+     * #include <stdlib.h>
+     * napi_value result;
+     * static napi_value MyNapi(napi_env env, napi_callback_info info) {
+     *   int* raw = (int*) malloc(1024);
+     *   napi_status status = napi_create_external(env, (void*) raw, NULL, NULL, &#x26;result);
+     *   if (status != napi_ok) {
+     *     napi_throw_error(env, NULL, "napi_create_external failed");
+     *     return NULL;
+     *   }
+     *   return result;
+     * }
+     * ...
+     * DECLARE_NAPI_PROPERTY("myNapi", MyNapi)
+     * ...
+     * ```
+     *
+     * ```js
+     * const native = require('napi_addon.node');
+     * const data = native.myNapi();
+     * util.types.isExternal(data); // returns true
+     * util.types.isExternal(0); // returns false
+     * util.types.isExternal(new String('foo')); // returns false
+     * ```
+     *
+     * For further information on `napi_create_external`, refer to `napi_create_external()`.
+     * @since v10.0.0
+     */
+    function isExternal(object: unknown): boolean;
+    /**
+     * Returns `true` if the value is a built-in [`Float32Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Float32Array) instance.
+     *
+     * ```js
+     * util.types.isFloat32Array(new ArrayBuffer());  // Returns false
+     * util.types.isFloat32Array(new Float32Array());  // Returns true
+     * util.types.isFloat32Array(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isFloat32Array(object: unknown): object is Float32Array;
+    /**
+     * Returns `true` if the value is a built-in [`Float64Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Float64Array) instance.
+     *
+     * ```js
+     * util.types.isFloat64Array(new ArrayBuffer());  // Returns false
+     * util.types.isFloat64Array(new Uint8Array());  // Returns false
+     * util.types.isFloat64Array(new Float64Array());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isFloat64Array(object: unknown): object is Float64Array;
+    /**
+     * Returns `true` if the value is a generator function.
+     * This only reports back what the JavaScript engine is seeing;
+     * in particular, the return value may not match the original source code if
+     * a transpilation tool was used.
+     *
+     * ```js
+     * util.types.isGeneratorFunction(function foo() {});  // Returns false
+     * util.types.isGeneratorFunction(function* foo() {});  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isGeneratorFunction(object: unknown): object is GeneratorFunction;
+    /**
+     * Returns `true` if the value is a generator object as returned from a
+     * built-in generator function.
+     * This only reports back what the JavaScript engine is seeing;
+     * in particular, the return value may not match the original source code if
+     * a transpilation tool was used.
+     *
+     * ```js
+     * function* foo() {}
+     * const generator = foo();
+     * util.types.isGeneratorObject(generator);  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isGeneratorObject(object: unknown): object is Generator;
+    /**
+     * Returns `true` if the value is a built-in [`Int8Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Int8Array) instance.
+     *
+     * ```js
+     * util.types.isInt8Array(new ArrayBuffer());  // Returns false
+     * util.types.isInt8Array(new Int8Array());  // Returns true
+     * util.types.isInt8Array(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isInt8Array(object: unknown): object is Int8Array;
+    /**
+     * Returns `true` if the value is a built-in [`Int16Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Int16Array) instance.
+     *
+     * ```js
+     * util.types.isInt16Array(new ArrayBuffer());  // Returns false
+     * util.types.isInt16Array(new Int16Array());  // Returns true
+     * util.types.isInt16Array(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isInt16Array(object: unknown): object is Int16Array;
+    /**
+     * Returns `true` if the value is a built-in [`Int32Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Int32Array) instance.
+     *
+     * ```js
+     * util.types.isInt32Array(new ArrayBuffer());  // Returns false
+     * util.types.isInt32Array(new Int32Array());  // Returns true
+     * util.types.isInt32Array(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isInt32Array(object: unknown): object is Int32Array;
+    /**
+     * Returns `true` if the value is a built-in [`Map`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map) instance.
+     *
+     * ```js
+     * util.types.isMap(new Map());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isMap<T>(object: T | {}): object is T extends ReadonlyMap<any, any> ? (unknown extends T ? never : ReadonlyMap<any, any>) : Map<unknown, unknown>;
+    /**
+     * Returns `true` if the value is an iterator returned for a built-in [`Map`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map) instance.
+     *
+     * ```js
+     * const map = new Map();
+     * util.types.isMapIterator(map.keys());  // Returns true
+     * util.types.isMapIterator(map.values());  // Returns true
+     * util.types.isMapIterator(map.entries());  // Returns true
+     * util.types.isMapIterator(map[Symbol.iterator]());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isMapIterator(object: unknown): boolean;
+    /**
+     * Returns `true` if the value is an instance of a [Module Namespace Object](https://tc39.github.io/ecma262/#sec-module-namespace-exotic-objects).
+     *
+     * ```js
+     * import * as ns from './a.js';
+     *
+     * util.types.isModuleNamespaceObject(ns);  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isModuleNamespaceObject(value: unknown): boolean;
+    /**
+     * Returns `true` if the value is an instance of a built-in `Error` type.
+     *
+     * ```js
+     * util.types.isNativeError(new Error());  // Returns true
+     * util.types.isNativeError(new TypeError());  // Returns true
+     * util.types.isNativeError(new RangeError());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isNativeError(object: unknown): object is Error;
+    /**
+     * Returns `true` if the value is a number object, e.g. created
+     * by `new Number()`.
+     *
+     * ```js
+     * util.types.isNumberObject(0);  // Returns false
+     * util.types.isNumberObject(new Number(0));   // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isNumberObject(object: unknown): object is Number;
+    /**
+     * Returns `true` if the value is a built-in [`Promise`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise).
+     *
+     * ```js
+     * util.types.isPromise(Promise.resolve(42));  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isPromise(object: unknown): object is Promise<unknown>;
+    /**
+     * Returns `true` if the value is a [`Proxy`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Proxy) instance.
+     *
+     * ```js
+     * const target = {};
+     * const proxy = new Proxy(target, {});
+     * util.types.isProxy(target);  // Returns false
+     * util.types.isProxy(proxy);  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isProxy(object: unknown): boolean;
+    /**
+     * Returns `true` if the value is a regular expression object.
+     *
+     * ```js
+     * util.types.isRegExp(/abc/);  // Returns true
+     * util.types.isRegExp(new RegExp('abc'));  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isRegExp(object: unknown): object is RegExp;
+    /**
+     * Returns `true` if the value is a built-in [`Set`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set) instance.
+     *
+     * ```js
+     * util.types.isSet(new Set());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isSet<T>(object: T | {}): object is T extends ReadonlySet<any> ? (unknown extends T ? never : ReadonlySet<any>) : Set<unknown>;
+    /**
+     * Returns `true` if the value is an iterator returned for a built-in [`Set`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set) instance.
+     *
+     * ```js
+     * const set = new Set();
+     * util.types.isSetIterator(set.keys());  // Returns true
+     * util.types.isSetIterator(set.values());  // Returns true
+     * util.types.isSetIterator(set.entries());  // Returns true
+     * util.types.isSetIterator(set[Symbol.iterator]());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isSetIterator(object: unknown): boolean;
+    /**
+     * Returns `true` if the value is a built-in [`SharedArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer) instance.
+     * This does _not_ include [`ArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer) instances. Usually, it is
+     * desirable to test for both; See `util.types.isAnyArrayBuffer()` for that.
+     *
+     * ```js
+     * util.types.isSharedArrayBuffer(new ArrayBuffer());  // Returns false
+     * util.types.isSharedArrayBuffer(new SharedArrayBuffer());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isSharedArrayBuffer(object: unknown): object is SharedArrayBuffer;
+    /**
+     * Returns `true` if the value is a string object, e.g. created
+     * by `new String()`.
+     *
+     * ```js
+     * util.types.isStringObject('foo');  // Returns false
+     * util.types.isStringObject(new String('foo'));   // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isStringObject(object: unknown): object is String;
+    /**
+     * Returns `true` if the value is a symbol object, created
+     * by calling `Object()` on a `Symbol` primitive.
+     *
+     * ```js
+     * const symbol = Symbol('foo');
+     * util.types.isSymbolObject(symbol);  // Returns false
+     * util.types.isSymbolObject(Object(symbol));   // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isSymbolObject(object: unknown): object is Symbol;
+    /**
+     * Returns `true` if the value is a built-in [`TypedArray`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray) instance.
+     *
+     * ```js
+     * util.types.isTypedArray(new ArrayBuffer());  // Returns false
+     * util.types.isTypedArray(new Uint8Array());  // Returns true
+     * util.types.isTypedArray(new Float64Array());  // Returns true
+     * ```
+     *
+     * See also [`ArrayBuffer.isView()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/isView).
+     * @since v10.0.0
+     */
+    function isTypedArray(object: unknown): object is NodeJS.TypedArray;
+    /**
+     * Returns `true` if the value is a built-in [`Uint8Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint8Array) instance.
+     *
+     * ```js
+     * util.types.isUint8Array(new ArrayBuffer());  // Returns false
+     * util.types.isUint8Array(new Uint8Array());  // Returns true
+     * util.types.isUint8Array(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isUint8Array(object: unknown): object is Uint8Array;
+    /**
+     * Returns `true` if the value is a built-in [`Uint8ClampedArray`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint8ClampedArray) instance.
+     *
+     * ```js
+     * util.types.isUint8ClampedArray(new ArrayBuffer());  // Returns false
+     * util.types.isUint8ClampedArray(new Uint8ClampedArray());  // Returns true
+     * util.types.isUint8ClampedArray(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isUint8ClampedArray(object: unknown): object is Uint8ClampedArray;
+    /**
+     * Returns `true` if the value is a built-in [`Uint16Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint16Array) instance.
+     *
+     * ```js
+     * util.types.isUint16Array(new ArrayBuffer());  // Returns false
+     * util.types.isUint16Array(new Uint16Array());  // Returns true
+     * util.types.isUint16Array(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isUint16Array(object: unknown): object is Uint16Array;
+    /**
+     * Returns `true` if the value is a built-in [`Uint32Array`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint32Array) instance.
+     *
+     * ```js
+     * util.types.isUint32Array(new ArrayBuffer());  // Returns false
+     * util.types.isUint32Array(new Uint32Array());  // Returns true
+     * util.types.isUint32Array(new Float64Array());  // Returns false
+     * ```
+     * @since v10.0.0
+     */
+    function isUint32Array(object: unknown): object is Uint32Array;
+    /**
+     * Returns `true` if the value is a built-in [`WeakMap`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WeakMap) instance.
+     *
+     * ```js
+     * util.types.isWeakMap(new WeakMap());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isWeakMap(object: unknown): object is WeakMap<object, unknown>;
+    /**
+     * Returns `true` if the value is a built-in [`WeakSet`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WeakSet) instance.
+     *
+     * ```js
+     * util.types.isWeakSet(new WeakSet());  // Returns true
+     * ```
+     * @since v10.0.0
+     */
+    function isWeakSet(object: unknown): object is WeakSet<object>;
+    /**
+     * Returns `true` if `value` is a `KeyObject`, `false` otherwise.
+     * @since v16.2.0
+     */
+    function isKeyObject(object: unknown): object is KeyObject;
+    /**
+     * Returns `true` if `value` is a `CryptoKey`, `false` otherwise.
+     * @since v16.2.0
+     */
+    function isCryptoKey(object: unknown): object is webcrypto.CryptoKey;
+}
+declare module 'node:util' {
+    export * from 'util';
+}
+declare module 'node:util/types' {
+    export * from 'util/types';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/v8.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/v8.d.ts
new file mode 100644
index 0000000..59c8302
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/v8.d.ts
@@ -0,0 +1,378 @@
+/**
+ * The `v8` module exposes APIs that are specific to the version of [V8](https://developers.google.com/v8/) built into the Node.js binary. It can be accessed using:
+ *
+ * ```js
+ * const v8 = require('v8');
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/v8.js)
+ */
+declare module 'v8' {
+    import { Readable } from 'node:stream';
+    interface HeapSpaceInfo {
+        space_name: string;
+        space_size: number;
+        space_used_size: number;
+        space_available_size: number;
+        physical_space_size: number;
+    }
+    // ** Signifies if the --zap_code_space option is enabled or not.  1 == enabled, 0 == disabled. */
+    type DoesZapCodeSpaceFlag = 0 | 1;
+    interface HeapInfo {
+        total_heap_size: number;
+        total_heap_size_executable: number;
+        total_physical_size: number;
+        total_available_size: number;
+        used_heap_size: number;
+        heap_size_limit: number;
+        malloced_memory: number;
+        peak_malloced_memory: number;
+        does_zap_garbage: DoesZapCodeSpaceFlag;
+        number_of_native_contexts: number;
+        number_of_detached_contexts: number;
+    }
+    interface HeapCodeStatistics {
+        code_and_metadata_size: number;
+        bytecode_and_metadata_size: number;
+        external_script_source_size: number;
+    }
+    /**
+     * Returns an integer representing a version tag derived from the V8 version,
+     * command-line flags, and detected CPU features. This is useful for determining
+     * whether a `vm.Script` `cachedData` buffer is compatible with this instance
+     * of V8.
+     *
+     * ```js
+     * console.log(v8.cachedDataVersionTag()); // 3947234607
+     * // The value returned by v8.cachedDataVersionTag() is derived from the V8
+     * // version, command-line flags, and detected CPU features. Test that the value
+     * // does indeed update when flags are toggled.
+     * v8.setFlagsFromString('--allow_natives_syntax');
+     * console.log(v8.cachedDataVersionTag()); // 183726201
+     * ```
+     * @since v8.0.0
+     */
+    function cachedDataVersionTag(): number;
+    /**
+     * Returns an object with the following properties:
+     *
+     * `does_zap_garbage` is a 0/1 boolean, which signifies whether the`--zap_code_space` option is enabled or not. This makes V8 overwrite heap
+     * garbage with a bit pattern. The RSS footprint (resident set size) gets bigger
+     * because it continuously touches all heap pages and that makes them less likely
+     * to get swapped out by the operating system.
+     *
+     * `number_of_native_contexts` The value of native\_context is the number of the
+     * top-level contexts currently active. Increase of this number over time indicates
+     * a memory leak.
+     *
+     * `number_of_detached_contexts` The value of detached\_context is the number
+     * of contexts that were detached and not yet garbage collected. This number
+     * being non-zero indicates a potential memory leak.
+     *
+     * ```js
+     * {
+     *   total_heap_size: 7326976,
+     *   total_heap_size_executable: 4194304,
+     *   total_physical_size: 7326976,
+     *   total_available_size: 1152656,
+     *   used_heap_size: 3476208,
+     *   heap_size_limit: 1535115264,
+     *   malloced_memory: 16384,
+     *   peak_malloced_memory: 1127496,
+     *   does_zap_garbage: 0,
+     *   number_of_native_contexts: 1,
+     *   number_of_detached_contexts: 0
+     * }
+     * ```
+     * @since v1.0.0
+     */
+    function getHeapStatistics(): HeapInfo;
+    /**
+     * Returns statistics about the V8 heap spaces, i.e. the segments which make up
+     * the V8 heap. Neither the ordering of heap spaces, nor the availability of a
+     * heap space can be guaranteed as the statistics are provided via the
+     * V8[`GetHeapSpaceStatistics`](https://v8docs.nodesource.com/node-13.2/d5/dda/classv8_1_1_isolate.html#ac673576f24fdc7a33378f8f57e1d13a4) function and may change from one V8 version to the
+     * next.
+     *
+     * The value returned is an array of objects containing the following properties:
+     *
+     * ```json
+     * [
+     *   {
+     *     "space_name": "new_space",
+     *     "space_size": 2063872,
+     *     "space_used_size": 951112,
+     *     "space_available_size": 80824,
+     *     "physical_space_size": 2063872
+     *   },
+     *   {
+     *     "space_name": "old_space",
+     *     "space_size": 3090560,
+     *     "space_used_size": 2493792,
+     *     "space_available_size": 0,
+     *     "physical_space_size": 3090560
+     *   },
+     *   {
+     *     "space_name": "code_space",
+     *     "space_size": 1260160,
+     *     "space_used_size": 644256,
+     *     "space_available_size": 960,
+     *     "physical_space_size": 1260160
+     *   },
+     *   {
+     *     "space_name": "map_space",
+     *     "space_size": 1094160,
+     *     "space_used_size": 201608,
+     *     "space_available_size": 0,
+     *     "physical_space_size": 1094160
+     *   },
+     *   {
+     *     "space_name": "large_object_space",
+     *     "space_size": 0,
+     *     "space_used_size": 0,
+     *     "space_available_size": 1490980608,
+     *     "physical_space_size": 0
+     *   }
+     * ]
+     * ```
+     * @since v6.0.0
+     */
+    function getHeapSpaceStatistics(): HeapSpaceInfo[];
+    /**
+     * The `v8.setFlagsFromString()` method can be used to programmatically set
+     * V8 command-line flags. This method should be used with care. Changing settings
+     * after the VM has started may result in unpredictable behavior, including
+     * crashes and data loss; or it may simply do nothing.
+     *
+     * The V8 options available for a version of Node.js may be determined by running`node --v8-options`.
+     *
+     * Usage:
+     *
+     * ```js
+     * // Print GC events to stdout for one minute.
+     * const v8 = require('v8');
+     * v8.setFlagsFromString('--trace_gc');
+     * setTimeout(() => { v8.setFlagsFromString('--notrace_gc'); }, 60e3);
+     * ```
+     * @since v1.0.0
+     */
+    function setFlagsFromString(flags: string): void;
+    /**
+     * Generates a snapshot of the current V8 heap and returns a Readable
+     * Stream that may be used to read the JSON serialized representation.
+     * This JSON stream format is intended to be used with tools such as
+     * Chrome DevTools. The JSON schema is undocumented and specific to the
+     * V8 engine. Therefore, the schema may change from one version of V8 to the next.
+     *
+     * ```js
+     * // Print heap snapshot to the console
+     * const v8 = require('v8');
+     * const stream = v8.getHeapSnapshot();
+     * stream.pipe(process.stdout);
+     * ```
+     * @since v11.13.0
+     * @return A Readable Stream containing the V8 heap snapshot
+     */
+    function getHeapSnapshot(): Readable;
+    /**
+     * Generates a snapshot of the current V8 heap and writes it to a JSON
+     * file. This file is intended to be used with tools such as Chrome
+     * DevTools. The JSON schema is undocumented and specific to the V8
+     * engine, and may change from one version of V8 to the next.
+     *
+     * A heap snapshot is specific to a single V8 isolate. When using `worker threads`, a heap snapshot generated from the main thread will
+     * not contain any information about the workers, and vice versa.
+     *
+     * ```js
+     * const { writeHeapSnapshot } = require('v8');
+     * const {
+     *   Worker,
+     *   isMainThread,
+     *   parentPort
+     * } = require('worker_threads');
+     *
+     * if (isMainThread) {
+     *   const worker = new Worker(__filename);
+     *
+     *   worker.once('message', (filename) => {
+     *     console.log(`worker heapdump: ${filename}`);
+     *     // Now get a heapdump for the main thread.
+     *     console.log(`main thread heapdump: ${writeHeapSnapshot()}`);
+     *   });
+     *
+     *   // Tell the worker to create a heapdump.
+     *   worker.postMessage('heapdump');
+     * } else {
+     *   parentPort.once('message', (message) => {
+     *     if (message === 'heapdump') {
+     *       // Generate a heapdump for the worker
+     *       // and return the filename to the parent.
+     *       parentPort.postMessage(writeHeapSnapshot());
+     *     }
+     *   });
+     * }
+     * ```
+     * @since v11.13.0
+     * @param filename The file path where the V8 heap snapshot is to be saved. If not specified, a file name with the pattern `'Heap-${yyyymmdd}-${hhmmss}-${pid}-${thread_id}.heapsnapshot'` will be
+     * generated, where `{pid}` will be the PID of the Node.js process, `{thread_id}` will be `0` when `writeHeapSnapshot()` is called from the main Node.js thread or the id of a
+     * worker thread.
+     * @return The filename where the snapshot was saved.
+     */
+    function writeHeapSnapshot(filename?: string): string;
+    /**
+     * Returns an object with the following properties:
+     *
+     * ```js
+     * {
+     *   code_and_metadata_size: 212208,
+     *   bytecode_and_metadata_size: 161368,
+     *   external_script_source_size: 1410794
+     * }
+     * ```
+     * @since v12.8.0
+     */
+    function getHeapCodeStatistics(): HeapCodeStatistics;
+    /**
+     * @since v8.0.0
+     */
+    class Serializer {
+        /**
+         * Writes out a header, which includes the serialization format version.
+         */
+        writeHeader(): void;
+        /**
+         * Serializes a JavaScript value and adds the serialized representation to the
+         * internal buffer.
+         *
+         * This throws an error if `value` cannot be serialized.
+         */
+        writeValue(val: any): boolean;
+        /**
+         * Returns the stored internal buffer. This serializer should not be used once
+         * the buffer is released. Calling this method results in undefined behavior
+         * if a previous write has failed.
+         */
+        releaseBuffer(): Buffer;
+        /**
+         * Marks an `ArrayBuffer` as having its contents transferred out of band.
+         * Pass the corresponding `ArrayBuffer` in the deserializing context to `deserializer.transferArrayBuffer()`.
+         * @param id A 32-bit unsigned integer.
+         * @param arrayBuffer An `ArrayBuffer` instance.
+         */
+        transferArrayBuffer(id: number, arrayBuffer: ArrayBuffer): void;
+        /**
+         * Write a raw 32-bit unsigned integer.
+         * For use inside of a custom `serializer._writeHostObject()`.
+         */
+        writeUint32(value: number): void;
+        /**
+         * Write a raw 64-bit unsigned integer, split into high and low 32-bit parts.
+         * For use inside of a custom `serializer._writeHostObject()`.
+         */
+        writeUint64(hi: number, lo: number): void;
+        /**
+         * Write a JS `number` value.
+         * For use inside of a custom `serializer._writeHostObject()`.
+         */
+        writeDouble(value: number): void;
+        /**
+         * Write raw bytes into the serializer’s internal buffer. The deserializer
+         * will require a way to compute the length of the buffer.
+         * For use inside of a custom `serializer._writeHostObject()`.
+         */
+        writeRawBytes(buffer: NodeJS.TypedArray): void;
+    }
+    /**
+     * A subclass of `Serializer` that serializes `TypedArray`(in particular `Buffer`) and `DataView` objects as host objects, and only
+     * stores the part of their underlying `ArrayBuffer`s that they are referring to.
+     * @since v8.0.0
+     */
+    class DefaultSerializer extends Serializer {}
+    /**
+     * @since v8.0.0
+     */
+    class Deserializer {
+        constructor(data: NodeJS.TypedArray);
+        /**
+         * Reads and validates a header (including the format version).
+         * May, for example, reject an invalid or unsupported wire format. In that case,
+         * an `Error` is thrown.
+         */
+        readHeader(): boolean;
+        /**
+         * Deserializes a JavaScript value from the buffer and returns it.
+         */
+        readValue(): any;
+        /**
+         * Marks an `ArrayBuffer` as having its contents transferred out of band.
+         * Pass the corresponding `ArrayBuffer` in the serializing context to `serializer.transferArrayBuffer()` (or return the `id` from `serializer._getSharedArrayBufferId()` in the case of
+         * `SharedArrayBuffer`s).
+         * @param id A 32-bit unsigned integer.
+         * @param arrayBuffer An `ArrayBuffer` instance.
+         */
+        transferArrayBuffer(id: number, arrayBuffer: ArrayBuffer): void;
+        /**
+         * Reads the underlying wire format version. Likely mostly to be useful to
+         * legacy code reading old wire format versions. May not be called before`.readHeader()`.
+         */
+        getWireFormatVersion(): number;
+        /**
+         * Read a raw 32-bit unsigned integer and return it.
+         * For use inside of a custom `deserializer._readHostObject()`.
+         */
+        readUint32(): number;
+        /**
+         * Read a raw 64-bit unsigned integer and return it as an array `[hi, lo]`with two 32-bit unsigned integer entries.
+         * For use inside of a custom `deserializer._readHostObject()`.
+         */
+        readUint64(): [number, number];
+        /**
+         * Read a JS `number` value.
+         * For use inside of a custom `deserializer._readHostObject()`.
+         */
+        readDouble(): number;
+        /**
+         * Read raw bytes from the deserializer’s internal buffer. The `length` parameter
+         * must correspond to the length of the buffer that was passed to `serializer.writeRawBytes()`.
+         * For use inside of a custom `deserializer._readHostObject()`.
+         */
+        readRawBytes(length: number): Buffer;
+    }
+    /**
+     * A subclass of `Deserializer` corresponding to the format written by `DefaultSerializer`.
+     * @since v8.0.0
+     */
+    class DefaultDeserializer extends Deserializer {}
+    /**
+     * Uses a `DefaultSerializer` to serialize `value` into a buffer.
+     * @since v8.0.0
+     */
+    function serialize(value: any): Buffer;
+    /**
+     * Uses a `DefaultDeserializer` with default options to read a JS value
+     * from a buffer.
+     * @since v8.0.0
+     * @param buffer A buffer returned by {@link serialize}.
+     */
+    function deserialize(buffer: NodeJS.TypedArray): any;
+    /**
+     * The `v8.takeCoverage()` method allows the user to write the coverage started by `NODE_V8_COVERAGE` to disk on demand. This method can be invoked multiple
+     * times during the lifetime of the process. Each time the execution counter will
+     * be reset and a new coverage report will be written to the directory specified
+     * by `NODE_V8_COVERAGE`.
+     *
+     * When the process is about to exit, one last coverage will still be written to
+     * disk unless {@link stopCoverage} is invoked before the process exits.
+     * @since v15.1.0, v14.18.0, v12.22.0
+     */
+    function takeCoverage(): void;
+    /**
+     * The `v8.stopCoverage()` method allows the user to stop the coverage collection
+     * started by `NODE_V8_COVERAGE`, so that V8 can release the execution count
+     * records and optimize code. This can be used in conjunction with {@link takeCoverage} if the user wants to collect the coverage on demand.
+     * @since v15.1.0, v14.18.0, v12.22.0
+     */
+    function stopCoverage(): void;
+}
+declare module 'node:v8' {
+    export * from 'v8';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/vm.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/vm.d.ts
new file mode 100644
index 0000000..860b7ac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/vm.d.ts
@@ -0,0 +1,507 @@
+/**
+ * The `vm` module enables compiling and running code within V8 Virtual
+ * Machine contexts. **The `vm` module is not a security mechanism. Do**
+ * **not use it to run untrusted code.**
+ *
+ * JavaScript code can be compiled and run immediately or
+ * compiled, saved, and run later.
+ *
+ * A common use case is to run the code in a different V8 Context. This means
+ * invoked code has a different global object than the invoking code.
+ *
+ * One can provide the context by `contextifying` an
+ * object. The invoked code treats any property in the context like a
+ * global variable. Any changes to global variables caused by the invoked
+ * code are reflected in the context object.
+ *
+ * ```js
+ * const vm = require('vm');
+ *
+ * const x = 1;
+ *
+ * const context = { x: 2 };
+ * vm.createContext(context); // Contextify the object.
+ *
+ * const code = 'x += 40; var y = 17;';
+ * // `x` and `y` are global variables in the context.
+ * // Initially, x has the value 2 because that is the value of context.x.
+ * vm.runInContext(code, context);
+ *
+ * console.log(context.x); // 42
+ * console.log(context.y); // 17
+ *
+ * console.log(x); // 1; y is not defined.
+ * ```
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/vm.js)
+ */
+declare module 'vm' {
+    interface Context extends NodeJS.Dict<any> {}
+    interface BaseOptions {
+        /**
+         * Specifies the filename used in stack traces produced by this script.
+         * Default: `''`.
+         */
+        filename?: string | undefined;
+        /**
+         * Specifies the line number offset that is displayed in stack traces produced by this script.
+         * Default: `0`.
+         */
+        lineOffset?: number | undefined;
+        /**
+         * Specifies the column number offset that is displayed in stack traces produced by this script.
+         * @default 0
+         */
+        columnOffset?: number | undefined;
+    }
+    interface ScriptOptions extends BaseOptions {
+        displayErrors?: boolean | undefined;
+        timeout?: number | undefined;
+        cachedData?: Buffer | undefined;
+        /** @deprecated in favor of `script.createCachedData()` */
+        produceCachedData?: boolean | undefined;
+    }
+    interface RunningScriptOptions extends BaseOptions {
+        /**
+         * When `true`, if an `Error` occurs while compiling the `code`, the line of code causing the error is attached to the stack trace.
+         * Default: `true`.
+         */
+        displayErrors?: boolean | undefined;
+        /**
+         * Specifies the number of milliseconds to execute code before terminating execution.
+         * If execution is terminated, an `Error` will be thrown. This value must be a strictly positive integer.
+         */
+        timeout?: number | undefined;
+        /**
+         * If `true`, the execution will be terminated when `SIGINT` (Ctrl+C) is received.
+         * Existing handlers for the event that have been attached via `process.on('SIGINT')` will be disabled during script execution, but will continue to work after that.
+         * If execution is terminated, an `Error` will be thrown.
+         * Default: `false`.
+         */
+        breakOnSigint?: boolean | undefined;
+        /**
+         * If set to `afterEvaluate`, microtasks will be run immediately after the script has run.
+         */
+        microtaskMode?: 'afterEvaluate' | undefined;
+    }
+    interface CompileFunctionOptions extends BaseOptions {
+        /**
+         * Provides an optional data with V8's code cache data for the supplied source.
+         */
+        cachedData?: Buffer | undefined;
+        /**
+         * Specifies whether to produce new cache data.
+         * Default: `false`,
+         */
+        produceCachedData?: boolean | undefined;
+        /**
+         * The sandbox/context in which the said function should be compiled in.
+         */
+        parsingContext?: Context | undefined;
+        /**
+         * An array containing a collection of context extensions (objects wrapping the current scope) to be applied while compiling
+         */
+        contextExtensions?: Object[] | undefined;
+    }
+    interface CreateContextOptions {
+        /**
+         * Human-readable name of the newly created context.
+         * @default 'VM Context i' Where i is an ascending numerical index of the created context.
+         */
+        name?: string | undefined;
+        /**
+         * Corresponds to the newly created context for display purposes.
+         * The origin should be formatted like a `URL`, but with only the scheme, host, and port (if necessary),
+         * like the value of the `url.origin` property of a URL object.
+         * Most notably, this string should omit the trailing slash, as that denotes a path.
+         * @default ''
+         */
+        origin?: string | undefined;
+        codeGeneration?:
+            | {
+                  /**
+                   * If set to false any calls to eval or function constructors (Function, GeneratorFunction, etc)
+                   * will throw an EvalError.
+                   * @default true
+                   */
+                  strings?: boolean | undefined;
+                  /**
+                   * If set to false any attempt to compile a WebAssembly module will throw a WebAssembly.CompileError.
+                   * @default true
+                   */
+                  wasm?: boolean | undefined;
+              }
+            | undefined;
+        /**
+         * If set to `afterEvaluate`, microtasks will be run immediately after the script has run.
+         */
+        microtaskMode?: 'afterEvaluate' | undefined;
+    }
+    type MeasureMemoryMode = 'summary' | 'detailed';
+    interface MeasureMemoryOptions {
+        /**
+         * @default 'summary'
+         */
+        mode?: MeasureMemoryMode | undefined;
+        context?: Context | undefined;
+    }
+    interface MemoryMeasurement {
+        total: {
+            jsMemoryEstimate: number;
+            jsMemoryRange: [number, number];
+        };
+    }
+    /**
+     * Instances of the `vm.Script` class contain precompiled scripts that can be
+     * executed in specific contexts.
+     * @since v0.3.1
+     */
+    class Script {
+        constructor(code: string, options?: ScriptOptions);
+        /**
+         * Runs the compiled code contained by the `vm.Script` object within the given`contextifiedObject` and returns the result. Running code does not have access
+         * to local scope.
+         *
+         * The following example compiles code that increments a global variable, sets
+         * the value of another global variable, then execute the code multiple times.
+         * The globals are contained in the `context` object.
+         *
+         * ```js
+         * const vm = require('vm');
+         *
+         * const context = {
+         *   animal: 'cat',
+         *   count: 2
+         * };
+         *
+         * const script = new vm.Script('count += 1; name = "kitty";');
+         *
+         * vm.createContext(context);
+         * for (let i = 0; i < 10; ++i) {
+         *   script.runInContext(context);
+         * }
+         *
+         * console.log(context);
+         * // Prints: { animal: 'cat', count: 12, name: 'kitty' }
+         * ```
+         *
+         * Using the `timeout` or `breakOnSigint` options will result in new event loops
+         * and corresponding threads being started, which have a non-zero performance
+         * overhead.
+         * @since v0.3.1
+         * @param contextifiedObject A `contextified` object as returned by the `vm.createContext()` method.
+         * @return the result of the very last statement executed in the script.
+         */
+        runInContext(contextifiedObject: Context, options?: RunningScriptOptions): any;
+        /**
+         * First contextifies the given `contextObject`, runs the compiled code contained
+         * by the `vm.Script` object within the created context, and returns the result.
+         * Running code does not have access to local scope.
+         *
+         * The following example compiles code that sets a global variable, then executes
+         * the code multiple times in different contexts. The globals are set on and
+         * contained within each individual `context`.
+         *
+         * ```js
+         * const vm = require('vm');
+         *
+         * const script = new vm.Script('globalVar = "set"');
+         *
+         * const contexts = [{}, {}, {}];
+         * contexts.forEach((context) => {
+         *   script.runInNewContext(context);
+         * });
+         *
+         * console.log(contexts);
+         * // Prints: [{ globalVar: 'set' }, { globalVar: 'set' }, { globalVar: 'set' }]
+         * ```
+         * @since v0.3.1
+         * @param contextObject An object that will be `contextified`. If `undefined`, a new object will be created.
+         * @return the result of the very last statement executed in the script.
+         */
+        runInNewContext(contextObject?: Context, options?: RunningScriptOptions): any;
+        /**
+         * Runs the compiled code contained by the `vm.Script` within the context of the
+         * current `global` object. Running code does not have access to local scope, but_does_ have access to the current `global` object.
+         *
+         * The following example compiles code that increments a `global` variable then
+         * executes that code multiple times:
+         *
+         * ```js
+         * const vm = require('vm');
+         *
+         * global.globalVar = 0;
+         *
+         * const script = new vm.Script('globalVar += 1', { filename: 'myfile.vm' });
+         *
+         * for (let i = 0; i < 1000; ++i) {
+         *   script.runInThisContext();
+         * }
+         *
+         * console.log(globalVar);
+         *
+         * // 1000
+         * ```
+         * @since v0.3.1
+         * @return the result of the very last statement executed in the script.
+         */
+        runInThisContext(options?: RunningScriptOptions): any;
+        /**
+         * Creates a code cache that can be used with the `Script` constructor's`cachedData` option. Returns a `Buffer`. This method may be called at any
+         * time and any number of times.
+         *
+         * ```js
+         * const script = new vm.Script(`
+         * function add(a, b) {
+         *   return a + b;
+         * }
+         *
+         * const x = add(1, 2);
+         * `);
+         *
+         * const cacheWithoutX = script.createCachedData();
+         *
+         * script.runInThisContext();
+         *
+         * const cacheWithX = script.createCachedData();
+         * ```
+         * @since v10.6.0
+         */
+        createCachedData(): Buffer;
+        /** @deprecated in favor of `script.createCachedData()` */
+        cachedDataProduced?: boolean | undefined;
+        cachedDataRejected?: boolean | undefined;
+        cachedData?: Buffer | undefined;
+    }
+    /**
+     * If given a `contextObject`, the `vm.createContext()` method will `prepare
+     * that object` so that it can be used in calls to {@link runInContext} or `script.runInContext()`. Inside such scripts,
+     * the `contextObject` will be the global object, retaining all of its existing
+     * properties but also having the built-in objects and functions any standard [global object](https://es5.github.io/#x15.1) has. Outside of scripts run by the vm module, global variables
+     * will remain unchanged.
+     *
+     * ```js
+     * const vm = require('vm');
+     *
+     * global.globalVar = 3;
+     *
+     * const context = { globalVar: 1 };
+     * vm.createContext(context);
+     *
+     * vm.runInContext('globalVar *= 2;', context);
+     *
+     * console.log(context);
+     * // Prints: { globalVar: 2 }
+     *
+     * console.log(global.globalVar);
+     * // Prints: 3
+     * ```
+     *
+     * If `contextObject` is omitted (or passed explicitly as `undefined`), a new,
+     * empty `contextified` object will be returned.
+     *
+     * The `vm.createContext()` method is primarily useful for creating a single
+     * context that can be used to run multiple scripts. For instance, if emulating a
+     * web browser, the method can be used to create a single context representing a
+     * window's global object, then run all `<script>` tags together within that
+     * context.
+     *
+     * The provided `name` and `origin` of the context are made visible through the
+     * Inspector API.
+     * @since v0.3.1
+     * @return contextified object.
+     */
+    function createContext(sandbox?: Context, options?: CreateContextOptions): Context;
+    /**
+     * Returns `true` if the given `object` object has been `contextified` using {@link createContext}.
+     * @since v0.11.7
+     */
+    function isContext(sandbox: Context): boolean;
+    /**
+     * The `vm.runInContext()` method compiles `code`, runs it within the context of
+     * the `contextifiedObject`, then returns the result. Running code does not have
+     * access to the local scope. The `contextifiedObject` object _must_ have been
+     * previously `contextified` using the {@link createContext} method.
+     *
+     * If `options` is a string, then it specifies the filename.
+     *
+     * The following example compiles and executes different scripts using a single `contextified` object:
+     *
+     * ```js
+     * const vm = require('vm');
+     *
+     * const contextObject = { globalVar: 1 };
+     * vm.createContext(contextObject);
+     *
+     * for (let i = 0; i < 10; ++i) {
+     *   vm.runInContext('globalVar *= 2;', contextObject);
+     * }
+     * console.log(contextObject);
+     * // Prints: { globalVar: 1024 }
+     * ```
+     * @since v0.3.1
+     * @param code The JavaScript code to compile and run.
+     * @param contextifiedObject The `contextified` object that will be used as the `global` when the `code` is compiled and run.
+     * @return the result of the very last statement executed in the script.
+     */
+    function runInContext(code: string, contextifiedObject: Context, options?: RunningScriptOptions | string): any;
+    /**
+     * The `vm.runInNewContext()` first contextifies the given `contextObject` (or
+     * creates a new `contextObject` if passed as `undefined`), compiles the `code`,
+     * runs it within the created context, then returns the result. Running code
+     * does not have access to the local scope.
+     *
+     * If `options` is a string, then it specifies the filename.
+     *
+     * The following example compiles and executes code that increments a global
+     * variable and sets a new one. These globals are contained in the `contextObject`.
+     *
+     * ```js
+     * const vm = require('vm');
+     *
+     * const contextObject = {
+     *   animal: 'cat',
+     *   count: 2
+     * };
+     *
+     * vm.runInNewContext('count += 1; name = "kitty"', contextObject);
+     * console.log(contextObject);
+     * // Prints: { animal: 'cat', count: 3, name: 'kitty' }
+     * ```
+     * @since v0.3.1
+     * @param code The JavaScript code to compile and run.
+     * @param contextObject An object that will be `contextified`. If `undefined`, a new object will be created.
+     * @return the result of the very last statement executed in the script.
+     */
+    function runInNewContext(code: string, contextObject?: Context, options?: RunningScriptOptions | string): any;
+    /**
+     * `vm.runInThisContext()` compiles `code`, runs it within the context of the
+     * current `global` and returns the result. Running code does not have access to
+     * local scope, but does have access to the current `global` object.
+     *
+     * If `options` is a string, then it specifies the filename.
+     *
+     * The following example illustrates using both `vm.runInThisContext()` and
+     * the JavaScript [`eval()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/eval) function to run the same code:
+     *
+     * ```js
+     * const vm = require('vm');
+     * let localVar = 'initial value';
+     *
+     * const vmResult = vm.runInThisContext('localVar = "vm";');
+     * console.log(`vmResult: '${vmResult}', localVar: '${localVar}'`);
+     * // Prints: vmResult: 'vm', localVar: 'initial value'
+     *
+     * const evalResult = eval('localVar = "eval";');
+     * console.log(`evalResult: '${evalResult}', localVar: '${localVar}'`);
+     * // Prints: evalResult: 'eval', localVar: 'eval'
+     * ```
+     *
+     * Because `vm.runInThisContext()` does not have access to the local scope,`localVar` is unchanged. In contrast,
+     * [`eval()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/eval) _does_ have access to the
+     * local scope, so the value `localVar` is changed. In this way`vm.runInThisContext()` is much like an [indirect `eval()` call](https://es5.github.io/#x10.4.2), e.g.`(0,eval)('code')`.
+     *
+     * ## Example: Running an HTTP server within a VM
+     *
+     * When using either `script.runInThisContext()` or {@link runInThisContext}, the code is executed within the current V8 global
+     * context. The code passed to this VM context will have its own isolated scope.
+     *
+     * In order to run a simple web server using the `http` module the code passed to
+     * the context must either call `require('http')` on its own, or have a reference
+     * to the `http` module passed to it. For instance:
+     *
+     * ```js
+     * 'use strict';
+     * const vm = require('vm');
+     *
+     * const code = `
+     * ((require) => {
+     *   const http = require('http');
+     *
+     *   http.createServer((request, response) => {
+     *     response.writeHead(200, { 'Content-Type': 'text/plain' });
+     *     response.end('Hello World\\n');
+     *   }).listen(8124);
+     *
+     *   console.log('Server running at http://127.0.0.1:8124/');
+     * })`;
+     *
+     * vm.runInThisContext(code)(require);
+     * ```
+     *
+     * The `require()` in the above case shares the state with the context it is
+     * passed from. This may introduce risks when untrusted code is executed, e.g.
+     * altering objects in the context in unwanted ways.
+     * @since v0.3.1
+     * @param code The JavaScript code to compile and run.
+     * @return the result of the very last statement executed in the script.
+     */
+    function runInThisContext(code: string, options?: RunningScriptOptions | string): any;
+    /**
+     * Compiles the given code into the provided context (if no context is
+     * supplied, the current context is used), and returns it wrapped inside a
+     * function with the given `params`.
+     * @since v10.10.0
+     * @param code The body of the function to compile.
+     * @param params An array of strings containing all parameters for the function.
+     */
+    function compileFunction(code: string, params?: ReadonlyArray<string>, options?: CompileFunctionOptions): Function;
+    /**
+     * Measure the memory known to V8 and used by all contexts known to the
+     * current V8 isolate, or the main context.
+     *
+     * The format of the object that the returned Promise may resolve with is
+     * specific to the V8 engine and may change from one version of V8 to the next.
+     *
+     * The returned result is different from the statistics returned by`v8.getHeapSpaceStatistics()` in that `vm.measureMemory()` measure the
+     * memory reachable by each V8 specific contexts in the current instance of
+     * the V8 engine, while the result of `v8.getHeapSpaceStatistics()` measure
+     * the memory occupied by each heap space in the current V8 instance.
+     *
+     * ```js
+     * const vm = require('vm');
+     * // Measure the memory used by the main context.
+     * vm.measureMemory({ mode: 'summary' })
+     *   // This is the same as vm.measureMemory()
+     *   .then((result) => {
+     *     // The current format is:
+     *     // {
+     *     //   total: {
+     *     //      jsMemoryEstimate: 2418479, jsMemoryRange: [ 2418479, 2745799 ]
+     *     //    }
+     *     // }
+     *     console.log(result);
+     *   });
+     *
+     * const context = vm.createContext({ a: 1 });
+     * vm.measureMemory({ mode: 'detailed', execution: 'eager' })
+     *   .then((result) => {
+     *     // Reference the context here so that it won't be GC'ed
+     *     // until the measurement is complete.
+     *     console.log(context.a);
+     *     // {
+     *     //   total: {
+     *     //     jsMemoryEstimate: 2574732,
+     *     //     jsMemoryRange: [ 2574732, 2904372 ]
+     *     //   },
+     *     //   current: {
+     *     //     jsMemoryEstimate: 2438996,
+     *     //     jsMemoryRange: [ 2438996, 2768636 ]
+     *     //   },
+     *     //   other: [
+     *     //     {
+     *     //       jsMemoryEstimate: 135736,
+     *     //       jsMemoryRange: [ 135736, 465376 ]
+     *     //     }
+     *     //   ]
+     *     // }
+     *     console.log(result);
+     *   });
+     * ```
+     * @since v13.10.0
+     * @experimental
+     */
+    function measureMemory(options?: MeasureMemoryOptions): Promise<MemoryMeasurement>;
+}
+declare module 'node:vm' {
+    export * from 'vm';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/wasi.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/wasi.d.ts
new file mode 100644
index 0000000..4810be8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/wasi.d.ts
@@ -0,0 +1,158 @@
+/**
+ * The WASI API provides an implementation of the [WebAssembly System Interface](https://wasi.dev/) specification. WASI gives sandboxed WebAssembly applications access to the
+ * underlying operating system via a collection of POSIX-like functions.
+ *
+ * ```js
+ * import { readFile } from 'fs/promises';
+ * import { WASI } from 'wasi';
+ * import { argv, env } from 'process';
+ *
+ * const wasi = new WASI({
+ *   args: argv,
+ *   env,
+ *   preopens: {
+ *     '/sandbox': '/some/real/path/that/wasm/can/access'
+ *   }
+ * });
+ *
+ * // Some WASI binaries require:
+ * //   const importObject = { wasi_unstable: wasi.wasiImport };
+ * const importObject = { wasi_snapshot_preview1: wasi.wasiImport };
+ *
+ * const wasm = await WebAssembly.compile(
+ *   await readFile(new URL('./demo.wasm', import.meta.url))
+ * );
+ * const instance = await WebAssembly.instantiate(wasm, importObject);
+ *
+ * wasi.start(instance);
+ * ```
+ *
+ * To run the above example, create a new WebAssembly text format file named`demo.wat`:
+ *
+ * ```text
+ * (module
+ *     ;; Import the required fd_write WASI function which will write the given io vectors to stdout
+ *     ;; The function signature for fd_write is:
+ *     ;; (File Descriptor, *iovs, iovs_len, nwritten) -> Returns number of bytes written
+ *     (import "wasi_snapshot_preview1" "fd_write" (func $fd_write (param i32 i32 i32 i32) (result i32)))
+ *
+ *     (memory 1)
+ *     (export "memory" (memory 0))
+ *
+ *     ;; Write 'hello world\n' to memory at an offset of 8 bytes
+ *     ;; Note the trailing newline which is required for the text to appear
+ *     (data (i32.const 8) "hello world\n")
+ *
+ *     (func $main (export "_start")
+ *         ;; Creating a new io vector within linear memory
+ *         (i32.store (i32.const 0) (i32.const 8))  ;; iov.iov_base - This is a pointer to the start of the 'hello world\n' string
+ *         (i32.store (i32.const 4) (i32.const 12))  ;; iov.iov_len - The length of the 'hello world\n' string
+ *
+ *         (call $fd_write
+ *             (i32.const 1) ;; file_descriptor - 1 for stdout
+ *             (i32.const 0) ;; *iovs - The pointer to the iov array, which is stored at memory location 0
+ *             (i32.const 1) ;; iovs_len - We're printing 1 string stored in an iov - so one.
+ *             (i32.const 20) ;; nwritten - A place in memory to store the number of bytes written
+ *         )
+ *         drop ;; Discard the number of bytes written from the top of the stack
+ *     )
+ * )
+ * ```
+ *
+ * Use [wabt](https://github.com/WebAssembly/wabt) to compile `.wat` to `.wasm`
+ *
+ * ```console
+ * $ wat2wasm demo.wat
+ * ```
+ *
+ * The `--experimental-wasi-unstable-preview1` CLI argument is needed for this
+ * example to run.
+ * @experimental
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/wasi.js)
+ */
+declare module 'wasi' {
+    interface WASIOptions {
+        /**
+         * An array of strings that the WebAssembly application will
+         * see as command line arguments. The first argument is the virtual path to the
+         * WASI command itself.
+         */
+        args?: string[] | undefined;
+        /**
+         * An object similar to `process.env` that the WebAssembly
+         * application will see as its environment.
+         */
+        env?: object | undefined;
+        /**
+         * This object represents the WebAssembly application's
+         * sandbox directory structure. The string keys of `preopens` are treated as
+         * directories within the sandbox. The corresponding values in `preopens` are
+         * the real paths to those directories on the host machine.
+         */
+        preopens?: NodeJS.Dict<string> | undefined;
+        /**
+         * By default, WASI applications terminate the Node.js
+         * process via the `__wasi_proc_exit()` function. Setting this option to `true`
+         * causes `wasi.start()` to return the exit code rather than terminate the
+         * process.
+         * @default false
+         */
+        returnOnExit?: boolean | undefined;
+        /**
+         * The file descriptor used as standard input in the WebAssembly application.
+         * @default 0
+         */
+        stdin?: number | undefined;
+        /**
+         * The file descriptor used as standard output in the WebAssembly application.
+         * @default 1
+         */
+        stdout?: number | undefined;
+        /**
+         * The file descriptor used as standard error in the WebAssembly application.
+         * @default 2
+         */
+        stderr?: number | undefined;
+    }
+    /**
+     * The `WASI` class provides the WASI system call API and additional convenience
+     * methods for working with WASI-based applications. Each `WASI` instance
+     * represents a distinct sandbox environment. For security purposes, each `WASI`instance must have its command-line arguments, environment variables, and
+     * sandbox directory structure configured explicitly.
+     * @since v13.3.0, v12.16.0
+     */
+    class WASI {
+        constructor(options?: WASIOptions);
+        /**
+         * Attempt to begin execution of `instance` as a WASI command by invoking its`_start()` export. If `instance` does not contain a `_start()` export, or if`instance` contains an `_initialize()`
+         * export, then an exception is thrown.
+         *
+         * `start()` requires that `instance` exports a [`WebAssembly.Memory`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WebAssembly/Memory) named`memory`. If
+         * `instance` does not have a `memory` export an exception is thrown.
+         *
+         * If `start()` is called more than once, an exception is thrown.
+         * @since v13.3.0, v12.16.0
+         */
+        start(instance: object): void; // TODO: avoid DOM dependency until WASM moved to own lib.
+        /**
+         * Attempt to initialize `instance` as a WASI reactor by invoking its`_initialize()` export, if it is present. If `instance` contains a `_start()`export, then an exception is thrown.
+         *
+         * `initialize()` requires that `instance` exports a [`WebAssembly.Memory`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WebAssembly/Memory) named`memory`.
+         * If `instance` does not have a `memory` export an exception is thrown.
+         *
+         * If `initialize()` is called more than once, an exception is thrown.
+         * @since v14.6.0, v12.19.0
+         */
+        initialize(instance: object): void; // TODO: avoid DOM dependency until WASM moved to own lib.
+        /**
+         * `wasiImport` is an object that implements the WASI system call API. This object
+         * should be passed as the `wasi_snapshot_preview1` import during the instantiation
+         * of a [`WebAssembly.Instance`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WebAssembly/Instance).
+         * @since v13.3.0, v12.16.0
+         */
+        readonly wasiImport: NodeJS.Dict<any>; // TODO: Narrow to DOM types
+    }
+}
+declare module 'node:wasi' {
+    export * from 'wasi';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/worker_threads.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/worker_threads.d.ts
new file mode 100644
index 0000000..b508986
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/worker_threads.d.ts
@@ -0,0 +1,649 @@
+/**
+ * The `worker_threads` module enables the use of threads that execute JavaScript
+ * in parallel. To access it:
+ *
+ * ```js
+ * const worker = require('worker_threads');
+ * ```
+ *
+ * Workers (threads) are useful for performing CPU-intensive JavaScript operations.
+ * They do not help much with I/O-intensive work. The Node.js built-in
+ * asynchronous I/O operations are more efficient than Workers can be.
+ *
+ * Unlike `child_process` or `cluster`, `worker_threads` can share memory. They do
+ * so by transferring `ArrayBuffer` instances or sharing `SharedArrayBuffer`instances.
+ *
+ * ```js
+ * const {
+ *   Worker, isMainThread, parentPort, workerData
+ * } = require('worker_threads');
+ *
+ * if (isMainThread) {
+ *   module.exports = function parseJSAsync(script) {
+ *     return new Promise((resolve, reject) => {
+ *       const worker = new Worker(__filename, {
+ *         workerData: script
+ *       });
+ *       worker.on('message', resolve);
+ *       worker.on('error', reject);
+ *       worker.on('exit', (code) => {
+ *         if (code !== 0)
+ *           reject(new Error(`Worker stopped with exit code ${code}`));
+ *       });
+ *     });
+ *   };
+ * } else {
+ *   const { parse } = require('some-js-parsing-library');
+ *   const script = workerData;
+ *   parentPort.postMessage(parse(script));
+ * }
+ * ```
+ *
+ * The above example spawns a Worker thread for each `parse()` call. In actual
+ * practice, use a pool of Workers for these kinds of tasks. Otherwise, the
+ * overhead of creating Workers would likely exceed their benefit.
+ *
+ * When implementing a worker pool, use the `AsyncResource` API to inform
+ * diagnostic tools (e.g. to provide asynchronous stack traces) about the
+ * correlation between tasks and their outcomes. See `"Using AsyncResource for a Worker thread pool"` in the `async_hooks` documentation for an example implementation.
+ *
+ * Worker threads inherit non-process-specific options by default. Refer to `Worker constructor options` to know how to customize worker thread options,
+ * specifically `argv` and `execArgv` options.
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/worker_threads.js)
+ */
+declare module 'worker_threads' {
+    import { Blob } from 'node:buffer';
+    import { Context } from 'node:vm';
+    import { EventEmitter } from 'node:events';
+    import { EventLoopUtilityFunction } from 'node:perf_hooks';
+    import { FileHandle } from 'node:fs/promises';
+    import { Readable, Writable } from 'node:stream';
+    import { URL } from 'node:url';
+    import { X509Certificate } from 'node:crypto';
+    const isMainThread: boolean;
+    const parentPort: null | MessagePort;
+    const resourceLimits: ResourceLimits;
+    const SHARE_ENV: unique symbol;
+    const threadId: number;
+    const workerData: any;
+    /**
+     * Instances of the `worker.MessageChannel` class represent an asynchronous,
+     * two-way communications channel.
+     * The `MessageChannel` has no methods of its own. `new MessageChannel()`yields an object with `port1` and `port2` properties, which refer to linked `MessagePort` instances.
+     *
+     * ```js
+     * const { MessageChannel } = require('worker_threads');
+     *
+     * const { port1, port2 } = new MessageChannel();
+     * port1.on('message', (message) => console.log('received', message));
+     * port2.postMessage({ foo: 'bar' });
+     * // Prints: received { foo: 'bar' } from the `port1.on('message')` listener
+     * ```
+     * @since v10.5.0
+     */
+    class MessageChannel {
+        readonly port1: MessagePort;
+        readonly port2: MessagePort;
+    }
+    interface WorkerPerformance {
+        eventLoopUtilization: EventLoopUtilityFunction;
+    }
+    type TransferListItem = ArrayBuffer | MessagePort | FileHandle | X509Certificate | Blob;
+    /**
+     * Instances of the `worker.MessagePort` class represent one end of an
+     * asynchronous, two-way communications channel. It can be used to transfer
+     * structured data, memory regions and other `MessagePort`s between different `Worker` s.
+     *
+     * This implementation matches [browser `MessagePort`](https://developer.mozilla.org/en-US/docs/Web/API/MessagePort) s.
+     * @since v10.5.0
+     */
+    class MessagePort extends EventEmitter {
+        /**
+         * Disables further sending of messages on either side of the connection.
+         * This method can be called when no further communication will happen over this`MessagePort`.
+         *
+         * The `'close' event` is emitted on both `MessagePort` instances that
+         * are part of the channel.
+         * @since v10.5.0
+         */
+        close(): void;
+        /**
+         * Sends a JavaScript value to the receiving side of this channel.`value` is transferred in a way which is compatible with
+         * the [HTML structured clone algorithm](https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API/Structured_clone_algorithm).
+         *
+         * In particular, the significant differences to `JSON` are:
+         *
+         * * `value` may contain circular references.
+         * * `value` may contain instances of builtin JS types such as `RegExp`s,`BigInt`s, `Map`s, `Set`s, etc.
+         * * `value` may contain typed arrays, both using `ArrayBuffer`s
+         * and `SharedArrayBuffer`s.
+         * * `value` may contain [`WebAssembly.Module`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WebAssembly/Module) instances.
+         * * `value` may not contain native (C++-backed) objects other than:
+         *
+         * ```js
+         * const { MessageChannel } = require('worker_threads');
+         * const { port1, port2 } = new MessageChannel();
+         *
+         * port1.on('message', (message) => console.log(message));
+         *
+         * const circularData = {};
+         * circularData.foo = circularData;
+         * // Prints: { foo: [Circular] }
+         * port2.postMessage(circularData);
+         * ```
+         *
+         * `transferList` may be a list of [`ArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer), `MessagePort` and `FileHandle` objects.
+         * After transferring, they are not usable on the sending side of the channel
+         * anymore (even if they are not contained in `value`). Unlike with `child processes`, transferring handles such as network sockets is currently
+         * not supported.
+         *
+         * If `value` contains [`SharedArrayBuffer`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer) instances, those are accessible
+         * from either thread. They cannot be listed in `transferList`.
+         *
+         * `value` may still contain `ArrayBuffer` instances that are not in`transferList`; in that case, the underlying memory is copied rather than moved.
+         *
+         * ```js
+         * const { MessageChannel } = require('worker_threads');
+         * const { port1, port2 } = new MessageChannel();
+         *
+         * port1.on('message', (message) => console.log(message));
+         *
+         * const uint8Array = new Uint8Array([ 1, 2, 3, 4 ]);
+         * // This posts a copy of `uint8Array`:
+         * port2.postMessage(uint8Array);
+         * // This does not copy data, but renders `uint8Array` unusable:
+         * port2.postMessage(uint8Array, [ uint8Array.buffer ]);
+         *
+         * // The memory for the `sharedUint8Array` is accessible from both the
+         * // original and the copy received by `.on('message')`:
+         * const sharedUint8Array = new Uint8Array(new SharedArrayBuffer(4));
+         * port2.postMessage(sharedUint8Array);
+         *
+         * // This transfers a freshly created message port to the receiver.
+         * // This can be used, for example, to create communication channels between
+         * // multiple `Worker` threads that are children of the same parent thread.
+         * const otherChannel = new MessageChannel();
+         * port2.postMessage({ port: otherChannel.port1 }, [ otherChannel.port1 ]);
+         * ```
+         *
+         * The message object is cloned immediately, and can be modified after
+         * posting without having side effects.
+         *
+         * For more information on the serialization and deserialization mechanisms
+         * behind this API, see the `serialization API of the v8 module`.
+         * @since v10.5.0
+         */
+        postMessage(value: any, transferList?: ReadonlyArray<TransferListItem>): void;
+        /**
+         * Opposite of `unref()`. Calling `ref()` on a previously `unref()`ed port does_not_ let the program exit if it's the only active handle left (the default
+         * behavior). If the port is `ref()`ed, calling `ref()` again has no effect.
+         *
+         * If listeners are attached or removed using `.on('message')`, the port
+         * is `ref()`ed and `unref()`ed automatically depending on whether
+         * listeners for the event exist.
+         * @since v10.5.0
+         */
+        ref(): void;
+        /**
+         * Calling `unref()` on a port allows the thread to exit if this is the only
+         * active handle in the event system. If the port is already `unref()`ed calling`unref()` again has no effect.
+         *
+         * If listeners are attached or removed using `.on('message')`, the port is`ref()`ed and `unref()`ed automatically depending on whether
+         * listeners for the event exist.
+         * @since v10.5.0
+         */
+        unref(): void;
+        /**
+         * Starts receiving messages on this `MessagePort`. When using this port
+         * as an event emitter, this is called automatically once `'message'`listeners are attached.
+         *
+         * This method exists for parity with the Web `MessagePort` API. In Node.js,
+         * it is only useful for ignoring messages when no event listener is present.
+         * Node.js also diverges in its handling of `.onmessage`. Setting it
+         * automatically calls `.start()`, but unsetting it lets messages queue up
+         * until a new handler is set or the port is discarded.
+         * @since v10.5.0
+         */
+        start(): void;
+        addListener(event: 'close', listener: () => void): this;
+        addListener(event: 'message', listener: (value: any) => void): this;
+        addListener(event: 'messageerror', listener: (error: Error) => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'close'): boolean;
+        emit(event: 'message', value: any): boolean;
+        emit(event: 'messageerror', error: Error): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'close', listener: () => void): this;
+        on(event: 'message', listener: (value: any) => void): this;
+        on(event: 'messageerror', listener: (error: Error) => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'close', listener: () => void): this;
+        once(event: 'message', listener: (value: any) => void): this;
+        once(event: 'messageerror', listener: (error: Error) => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'close', listener: () => void): this;
+        prependListener(event: 'message', listener: (value: any) => void): this;
+        prependListener(event: 'messageerror', listener: (error: Error) => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'close', listener: () => void): this;
+        prependOnceListener(event: 'message', listener: (value: any) => void): this;
+        prependOnceListener(event: 'messageerror', listener: (error: Error) => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        removeListener(event: 'close', listener: () => void): this;
+        removeListener(event: 'message', listener: (value: any) => void): this;
+        removeListener(event: 'messageerror', listener: (error: Error) => void): this;
+        removeListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        off(event: 'close', listener: () => void): this;
+        off(event: 'message', listener: (value: any) => void): this;
+        off(event: 'messageerror', listener: (error: Error) => void): this;
+        off(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    interface WorkerOptions {
+        /**
+         * List of arguments which would be stringified and appended to
+         * `process.argv` in the worker. This is mostly similar to the `workerData`
+         * but the values will be available on the global `process.argv` as if they
+         * were passed as CLI options to the script.
+         */
+        argv?: any[] | undefined;
+        env?: NodeJS.Dict<string> | typeof SHARE_ENV | undefined;
+        eval?: boolean | undefined;
+        workerData?: any;
+        stdin?: boolean | undefined;
+        stdout?: boolean | undefined;
+        stderr?: boolean | undefined;
+        execArgv?: string[] | undefined;
+        resourceLimits?: ResourceLimits | undefined;
+        /**
+         * Additional data to send in the first worker message.
+         */
+        transferList?: TransferListItem[] | undefined;
+        /**
+         * @default true
+         */
+        trackUnmanagedFds?: boolean | undefined;
+    }
+    interface ResourceLimits {
+        /**
+         * The maximum size of a heap space for recently created objects.
+         */
+        maxYoungGenerationSizeMb?: number | undefined;
+        /**
+         * The maximum size of the main heap in MB.
+         */
+        maxOldGenerationSizeMb?: number | undefined;
+        /**
+         * The size of a pre-allocated memory range used for generated code.
+         */
+        codeRangeSizeMb?: number | undefined;
+        /**
+         * The default maximum stack size for the thread. Small values may lead to unusable Worker instances.
+         * @default 4
+         */
+        stackSizeMb?: number | undefined;
+    }
+    /**
+     * The `Worker` class represents an independent JavaScript execution thread.
+     * Most Node.js APIs are available inside of it.
+     *
+     * Notable differences inside a Worker environment are:
+     *
+     * * The `process.stdin`, `process.stdout` and `process.stderr` may be redirected by the parent thread.
+     * * The `require('worker_threads').isMainThread` property is set to `false`.
+     * * The `require('worker_threads').parentPort` message port is available.
+     * * `process.exit()` does not stop the whole program, just the single thread,
+     * and `process.abort()` is not available.
+     * * `process.chdir()` and `process` methods that set group or user ids
+     * are not available.
+     * * `process.env` is a copy of the parent thread's environment variables,
+     * unless otherwise specified. Changes to one copy are not visible in other
+     * threads, and are not visible to native add-ons (unless `worker.SHARE_ENV` is passed as the `env` option to the `Worker` constructor).
+     * * `process.title` cannot be modified.
+     * * Signals are not delivered through `process.on('...')`.
+     * * Execution may stop at any point as a result of `worker.terminate()` being invoked.
+     * * IPC channels from parent processes are not accessible.
+     * * The `trace_events` module is not supported.
+     * * Native add-ons can only be loaded from multiple threads if they fulfill `certain conditions`.
+     *
+     * Creating `Worker` instances inside of other `Worker`s is possible.
+     *
+     * Like [Web Workers](https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API) and the `cluster module`, two-way communication can be
+     * achieved through inter-thread message passing. Internally, a `Worker` has a
+     * built-in pair of `MessagePort` s that are already associated with each other
+     * when the `Worker` is created. While the `MessagePort` object on the parent side
+     * is not directly exposed, its functionalities are exposed through `worker.postMessage()` and the `worker.on('message')` event
+     * on the `Worker` object for the parent thread.
+     *
+     * To create custom messaging channels (which is encouraged over using the default
+     * global channel because it facilitates separation of concerns), users can create
+     * a `MessageChannel` object on either thread and pass one of the`MessagePort`s on that `MessageChannel` to the other thread through a
+     * pre-existing channel, such as the global one.
+     *
+     * See `port.postMessage()` for more information on how messages are passed,
+     * and what kind of JavaScript values can be successfully transported through
+     * the thread barrier.
+     *
+     * ```js
+     * const assert = require('assert');
+     * const {
+     *   Worker, MessageChannel, MessagePort, isMainThread, parentPort
+     * } = require('worker_threads');
+     * if (isMainThread) {
+     *   const worker = new Worker(__filename);
+     *   const subChannel = new MessageChannel();
+     *   worker.postMessage({ hereIsYourPort: subChannel.port1 }, [subChannel.port1]);
+     *   subChannel.port2.on('message', (value) => {
+     *     console.log('received:', value);
+     *   });
+     * } else {
+     *   parentPort.once('message', (value) => {
+     *     assert(value.hereIsYourPort instanceof MessagePort);
+     *     value.hereIsYourPort.postMessage('the worker is sending this');
+     *     value.hereIsYourPort.close();
+     *   });
+     * }
+     * ```
+     * @since v10.5.0
+     */
+    class Worker extends EventEmitter {
+        /**
+         * If `stdin: true` was passed to the `Worker` constructor, this is a
+         * writable stream. The data written to this stream will be made available in
+         * the worker thread as `process.stdin`.
+         * @since v10.5.0
+         */
+        readonly stdin: Writable | null;
+        /**
+         * This is a readable stream which contains data written to `process.stdout` inside the worker thread. If `stdout: true` was not passed to the `Worker` constructor, then data is piped to the
+         * parent thread's `process.stdout` stream.
+         * @since v10.5.0
+         */
+        readonly stdout: Readable;
+        /**
+         * This is a readable stream which contains data written to `process.stderr` inside the worker thread. If `stderr: true` was not passed to the `Worker` constructor, then data is piped to the
+         * parent thread's `process.stderr` stream.
+         * @since v10.5.0
+         */
+        readonly stderr: Readable;
+        /**
+         * An integer identifier for the referenced thread. Inside the worker thread,
+         * it is available as `require('worker_threads').threadId`.
+         * This value is unique for each `Worker` instance inside a single process.
+         * @since v10.5.0
+         */
+        readonly threadId: number;
+        /**
+         * Provides the set of JS engine resource constraints for this Worker thread.
+         * If the `resourceLimits` option was passed to the `Worker` constructor,
+         * this matches its values.
+         *
+         * If the worker has stopped, the return value is an empty object.
+         * @since v13.2.0, v12.16.0
+         */
+        readonly resourceLimits?: ResourceLimits | undefined;
+        /**
+         * An object that can be used to query performance information from a worker
+         * instance. Similar to `perf_hooks.performance`.
+         * @since v15.1.0, v14.17.0, v12.22.0
+         */
+        readonly performance: WorkerPerformance;
+        /**
+         * @param filename  The path to the Worker’s main script or module.
+         *                  Must be either an absolute path or a relative path (i.e. relative to the current working directory) starting with ./ or ../,
+         *                  or a WHATWG URL object using file: protocol. If options.eval is true, this is a string containing JavaScript code rather than a path.
+         */
+        constructor(filename: string | URL, options?: WorkerOptions);
+        /**
+         * Send a message to the worker that is received via `require('worker_threads').parentPort.on('message')`.
+         * See `port.postMessage()` for more details.
+         * @since v10.5.0
+         */
+        postMessage(value: any, transferList?: ReadonlyArray<TransferListItem>): void;
+        /**
+         * Opposite of `unref()`, calling `ref()` on a previously `unref()`ed worker does_not_ let the program exit if it's the only active handle left (the default
+         * behavior). If the worker is `ref()`ed, calling `ref()` again has
+         * no effect.
+         * @since v10.5.0
+         */
+        ref(): void;
+        /**
+         * Calling `unref()` on a worker allows the thread to exit if this is the only
+         * active handle in the event system. If the worker is already `unref()`ed calling`unref()` again has no effect.
+         * @since v10.5.0
+         */
+        unref(): void;
+        /**
+         * Stop all JavaScript execution in the worker thread as soon as possible.
+         * Returns a Promise for the exit code that is fulfilled when the `'exit' event` is emitted.
+         * @since v10.5.0
+         */
+        terminate(): Promise<number>;
+        /**
+         * Returns a readable stream for a V8 snapshot of the current state of the Worker.
+         * See `v8.getHeapSnapshot()` for more details.
+         *
+         * If the Worker thread is no longer running, which may occur before the `'exit' event` is emitted, the returned `Promise` is rejected
+         * immediately with an `ERR_WORKER_NOT_RUNNING` error.
+         * @since v13.9.0, v12.17.0
+         * @return A promise for a Readable Stream containing a V8 heap snapshot
+         */
+        getHeapSnapshot(): Promise<Readable>;
+        addListener(event: 'error', listener: (err: Error) => void): this;
+        addListener(event: 'exit', listener: (exitCode: number) => void): this;
+        addListener(event: 'message', listener: (value: any) => void): this;
+        addListener(event: 'messageerror', listener: (error: Error) => void): this;
+        addListener(event: 'online', listener: () => void): this;
+        addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        emit(event: 'error', err: Error): boolean;
+        emit(event: 'exit', exitCode: number): boolean;
+        emit(event: 'message', value: any): boolean;
+        emit(event: 'messageerror', error: Error): boolean;
+        emit(event: 'online'): boolean;
+        emit(event: string | symbol, ...args: any[]): boolean;
+        on(event: 'error', listener: (err: Error) => void): this;
+        on(event: 'exit', listener: (exitCode: number) => void): this;
+        on(event: 'message', listener: (value: any) => void): this;
+        on(event: 'messageerror', listener: (error: Error) => void): this;
+        on(event: 'online', listener: () => void): this;
+        on(event: string | symbol, listener: (...args: any[]) => void): this;
+        once(event: 'error', listener: (err: Error) => void): this;
+        once(event: 'exit', listener: (exitCode: number) => void): this;
+        once(event: 'message', listener: (value: any) => void): this;
+        once(event: 'messageerror', listener: (error: Error) => void): this;
+        once(event: 'online', listener: () => void): this;
+        once(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependListener(event: 'error', listener: (err: Error) => void): this;
+        prependListener(event: 'exit', listener: (exitCode: number) => void): this;
+        prependListener(event: 'message', listener: (value: any) => void): this;
+        prependListener(event: 'messageerror', listener: (error: Error) => void): this;
+        prependListener(event: 'online', listener: () => void): this;
+        prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: 'error', listener: (err: Error) => void): this;
+        prependOnceListener(event: 'exit', listener: (exitCode: number) => void): this;
+        prependOnceListener(event: 'message', listener: (value: any) => void): this;
+        prependOnceListener(event: 'messageerror', listener: (error: Error) => void): this;
+        prependOnceListener(event: 'online', listener: () => void): this;
+        prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        removeListener(event: 'error', listener: (err: Error) => void): this;
+        removeListener(event: 'exit', listener: (exitCode: number) => void): this;
+        removeListener(event: 'message', listener: (value: any) => void): this;
+        removeListener(event: 'messageerror', listener: (error: Error) => void): this;
+        removeListener(event: 'online', listener: () => void): this;
+        removeListener(event: string | symbol, listener: (...args: any[]) => void): this;
+        off(event: 'error', listener: (err: Error) => void): this;
+        off(event: 'exit', listener: (exitCode: number) => void): this;
+        off(event: 'message', listener: (value: any) => void): this;
+        off(event: 'messageerror', listener: (error: Error) => void): this;
+        off(event: 'online', listener: () => void): this;
+        off(event: string | symbol, listener: (...args: any[]) => void): this;
+    }
+    interface BroadcastChannel extends NodeJS.RefCounted {}
+    /**
+     * Instances of `BroadcastChannel` allow asynchronous one-to-many communication
+     * with all other `BroadcastChannel` instances bound to the same channel name.
+     *
+     * ```js
+     * 'use strict';
+     *
+     * const {
+     *   isMainThread,
+     *   BroadcastChannel,
+     *   Worker
+     * } = require('worker_threads');
+     *
+     * const bc = new BroadcastChannel('hello');
+     *
+     * if (isMainThread) {
+     *   let c = 0;
+     *   bc.onmessage = (event) => {
+     *     console.log(event.data);
+     *     if (++c === 10) bc.close();
+     *   };
+     *   for (let n = 0; n < 10; n++)
+     *     new Worker(__filename);
+     * } else {
+     *   bc.postMessage('hello from every worker');
+     *   bc.close();
+     * }
+     * ```
+     * @since v15.4.0
+     * @experimental
+     */
+    class BroadcastChannel {
+        readonly name: string;
+        /**
+         * Invoked with a single \`MessageEvent\` argument when a message is received.
+         * @since v15.4.0
+         */
+        onmessage: (message: unknown) => void;
+        /**
+         * Invoked with a received message cannot be deserialized.
+         * @since v15.4.0
+         */
+        onmessageerror: (message: unknown) => void;
+        constructor(name: string);
+        /**
+         * Closes the `BroadcastChannel` connection.
+         * @since v15.4.0
+         */
+        close(): void;
+        /**
+         * @since v15.4.0
+         * @param message Any cloneable JavaScript value.
+         */
+        postMessage(message: unknown): void;
+    }
+    /**
+     * Mark an object as not transferable. If `object` occurs in the transfer list of
+     * a `port.postMessage()` call, it is ignored.
+     *
+     * In particular, this makes sense for objects that can be cloned, rather than
+     * transferred, and which are used by other objects on the sending side.
+     * For example, Node.js marks the `ArrayBuffer`s it uses for its `Buffer pool` with this.
+     *
+     * This operation cannot be undone.
+     *
+     * ```js
+     * const { MessageChannel, markAsUntransferable } = require('worker_threads');
+     *
+     * const pooledBuffer = new ArrayBuffer(8);
+     * const typedArray1 = new Uint8Array(pooledBuffer);
+     * const typedArray2 = new Float64Array(pooledBuffer);
+     *
+     * markAsUntransferable(pooledBuffer);
+     *
+     * const { port1 } = new MessageChannel();
+     * port1.postMessage(typedArray1, [ typedArray1.buffer ]);
+     *
+     * // The following line prints the contents of typedArray1 -- it still owns
+     * // its memory and has been cloned, not transferred. Without
+     * // `markAsUntransferable()`, this would print an empty Uint8Array.
+     * // typedArray2 is intact as well.
+     * console.log(typedArray1);
+     * console.log(typedArray2);
+     * ```
+     *
+     * There is no equivalent to this API in browsers.
+     * @since v14.5.0, v12.19.0
+     */
+    function markAsUntransferable(object: object): void;
+    /**
+     * Transfer a `MessagePort` to a different `vm` Context. The original `port`object is rendered unusable, and the returned `MessagePort` instance
+     * takes its place.
+     *
+     * The returned `MessagePort` is an object in the target context and
+     * inherits from its global `Object` class. Objects passed to the [`port.onmessage()`](https://developer.mozilla.org/en-US/docs/Web/API/MessagePort/onmessage) listener are also created in the
+     * target context
+     * and inherit from its global `Object` class.
+     *
+     * However, the created `MessagePort` no longer inherits from [`EventTarget`](https://developer.mozilla.org/en-US/docs/Web/API/EventTarget), and only
+     * [`port.onmessage()`](https://developer.mozilla.org/en-US/docs/Web/API/MessagePort/onmessage) can be used to receive
+     * events using it.
+     * @since v11.13.0
+     * @param port The message port to transfer.
+     * @param contextifiedSandbox A `contextified` object as returned by the `vm.createContext()` method.
+     */
+    function moveMessagePortToContext(port: MessagePort, contextifiedSandbox: Context): MessagePort;
+    /**
+     * Receive a single message from a given `MessagePort`. If no message is available,`undefined` is returned, otherwise an object with a single `message` property
+     * that contains the message payload, corresponding to the oldest message in the`MessagePort`’s queue.
+     *
+     * ```js
+     * const { MessageChannel, receiveMessageOnPort } = require('worker_threads');
+     * const { port1, port2 } = new MessageChannel();
+     * port1.postMessage({ hello: 'world' });
+     *
+     * console.log(receiveMessageOnPort(port2));
+     * // Prints: { message: { hello: 'world' } }
+     * console.log(receiveMessageOnPort(port2));
+     * // Prints: undefined
+     * ```
+     *
+     * When this function is used, no `'message'` event is emitted and the`onmessage` listener is not invoked.
+     * @since v12.3.0
+     */
+    function receiveMessageOnPort(port: MessagePort):
+        | {
+              message: any;
+          }
+        | undefined;
+    type Serializable = string | object | number | boolean | bigint;
+    /**
+     * Within a worker thread, `worker.getEnvironmentData()` returns a clone
+     * of data passed to the spawning thread's `worker.setEnvironmentData()`.
+     * Every new `Worker` receives its own copy of the environment data
+     * automatically.
+     *
+     * ```js
+     * const {
+     *   Worker,
+     *   isMainThread,
+     *   setEnvironmentData,
+     *   getEnvironmentData,
+     * } = require('worker_threads');
+     *
+     * if (isMainThread) {
+     *   setEnvironmentData('Hello', 'World!');
+     *   const worker = new Worker(__filename);
+     * } else {
+     *   console.log(getEnvironmentData('Hello'));  // Prints 'World!'.
+     * }
+     * ```
+     * @since v15.12.0, v14.18.0
+     * @experimental
+     * @param key Any arbitrary, cloneable JavaScript value that can be used as a {Map} key.
+     */
+    function getEnvironmentData(key: Serializable): Serializable;
+    /**
+     * The `worker.setEnvironmentData()` API sets the content of`worker.getEnvironmentData()` in the current thread and all new `Worker`instances spawned from the current context.
+     * @since v15.12.0, v14.18.0
+     * @experimental
+     * @param key Any arbitrary, cloneable JavaScript value that can be used as a {Map} key.
+     * @param value Any arbitrary, cloneable JavaScript value that will be cloned and passed automatically to all new `Worker` instances. If `value` is passed as `undefined`, any previously set value
+     * for the `key` will be deleted.
+     */
+    function setEnvironmentData(key: Serializable, value: Serializable): void;
+}
+declare module 'node:worker_threads' {
+    export * from 'worker_threads';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@types/node/zlib.d.ts b/node_modules/mathjs/examples/node_modules/@types/node/zlib.d.ts
new file mode 100644
index 0000000..b313083
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@types/node/zlib.d.ts
@@ -0,0 +1,517 @@
+/**
+ * The `zlib` module provides compression functionality implemented using Gzip,
+ * Deflate/Inflate, and Brotli.
+ *
+ * To access it:
+ *
+ * ```js
+ * const zlib = require('zlib');
+ * ```
+ *
+ * Compression and decompression are built around the Node.js `Streams API`.
+ *
+ * Compressing or decompressing a stream (such as a file) can be accomplished by
+ * piping the source stream through a `zlib` `Transform` stream into a destination
+ * stream:
+ *
+ * ```js
+ * const { createGzip } = require('zlib');
+ * const { pipeline } = require('stream');
+ * const {
+ *   createReadStream,
+ *   createWriteStream
+ * } = require('fs');
+ *
+ * const gzip = createGzip();
+ * const source = createReadStream('input.txt');
+ * const destination = createWriteStream('input.txt.gz');
+ *
+ * pipeline(source, gzip, destination, (err) => {
+ *   if (err) {
+ *     console.error('An error occurred:', err);
+ *     process.exitCode = 1;
+ *   }
+ * });
+ *
+ * // Or, Promisified
+ *
+ * const { promisify } = require('util');
+ * const pipe = promisify(pipeline);
+ *
+ * async function do_gzip(input, output) {
+ *   const gzip = createGzip();
+ *   const source = createReadStream(input);
+ *   const destination = createWriteStream(output);
+ *   await pipe(source, gzip, destination);
+ * }
+ *
+ * do_gzip('input.txt', 'input.txt.gz')
+ *   .catch((err) => {
+ *     console.error('An error occurred:', err);
+ *     process.exitCode = 1;
+ *   });
+ * ```
+ *
+ * It is also possible to compress or decompress data in a single step:
+ *
+ * ```js
+ * const { deflate, unzip } = require('zlib');
+ *
+ * const input = '.................................';
+ * deflate(input, (err, buffer) => {
+ *   if (err) {
+ *     console.error('An error occurred:', err);
+ *     process.exitCode = 1;
+ *   }
+ *   console.log(buffer.toString('base64'));
+ * });
+ *
+ * const buffer = Buffer.from('eJzT0yMAAGTvBe8=', 'base64');
+ * unzip(buffer, (err, buffer) => {
+ *   if (err) {
+ *     console.error('An error occurred:', err);
+ *     process.exitCode = 1;
+ *   }
+ *   console.log(buffer.toString());
+ * });
+ *
+ * // Or, Promisified
+ *
+ * const { promisify } = require('util');
+ * const do_unzip = promisify(unzip);
+ *
+ * do_unzip(buffer)
+ *   .then((buf) => console.log(buf.toString()))
+ *   .catch((err) => {
+ *     console.error('An error occurred:', err);
+ *     process.exitCode = 1;
+ *   });
+ * ```
+ * @since v0.5.8
+ * @see [source](https://github.com/nodejs/node/blob/v17.0.0/lib/zlib.js)
+ */
+declare module 'zlib' {
+    import * as stream from 'node:stream';
+    interface ZlibOptions {
+        /**
+         * @default constants.Z_NO_FLUSH
+         */
+        flush?: number | undefined;
+        /**
+         * @default constants.Z_FINISH
+         */
+        finishFlush?: number | undefined;
+        /**
+         * @default 16*1024
+         */
+        chunkSize?: number | undefined;
+        windowBits?: number | undefined;
+        level?: number | undefined; // compression only
+        memLevel?: number | undefined; // compression only
+        strategy?: number | undefined; // compression only
+        dictionary?: NodeJS.ArrayBufferView | ArrayBuffer | undefined; // deflate/inflate only, empty dictionary by default
+        info?: boolean | undefined;
+        maxOutputLength?: number | undefined;
+    }
+    interface BrotliOptions {
+        /**
+         * @default constants.BROTLI_OPERATION_PROCESS
+         */
+        flush?: number | undefined;
+        /**
+         * @default constants.BROTLI_OPERATION_FINISH
+         */
+        finishFlush?: number | undefined;
+        /**
+         * @default 16*1024
+         */
+        chunkSize?: number | undefined;
+        params?:
+            | {
+                  /**
+                   * Each key is a `constants.BROTLI_*` constant.
+                   */
+                  [key: number]: boolean | number;
+              }
+            | undefined;
+        maxOutputLength?: number | undefined;
+    }
+    interface Zlib {
+        /** @deprecated Use bytesWritten instead. */
+        readonly bytesRead: number;
+        readonly bytesWritten: number;
+        shell?: boolean | string | undefined;
+        close(callback?: () => void): void;
+        flush(kind?: number, callback?: () => void): void;
+        flush(callback?: () => void): void;
+    }
+    interface ZlibParams {
+        params(level: number, strategy: number, callback: () => void): void;
+    }
+    interface ZlibReset {
+        reset(): void;
+    }
+    interface BrotliCompress extends stream.Transform, Zlib {}
+    interface BrotliDecompress extends stream.Transform, Zlib {}
+    interface Gzip extends stream.Transform, Zlib {}
+    interface Gunzip extends stream.Transform, Zlib {}
+    interface Deflate extends stream.Transform, Zlib, ZlibReset, ZlibParams {}
+    interface Inflate extends stream.Transform, Zlib, ZlibReset {}
+    interface DeflateRaw extends stream.Transform, Zlib, ZlibReset, ZlibParams {}
+    interface InflateRaw extends stream.Transform, Zlib, ZlibReset {}
+    interface Unzip extends stream.Transform, Zlib {}
+    /**
+     * Creates and returns a new `BrotliCompress` object.
+     * @since v11.7.0, v10.16.0
+     */
+    function createBrotliCompress(options?: BrotliOptions): BrotliCompress;
+    /**
+     * Creates and returns a new `BrotliDecompress` object.
+     * @since v11.7.0, v10.16.0
+     */
+    function createBrotliDecompress(options?: BrotliOptions): BrotliDecompress;
+    /**
+     * Creates and returns a new `Gzip` object.
+     * See `example`.
+     * @since v0.5.8
+     */
+    function createGzip(options?: ZlibOptions): Gzip;
+    /**
+     * Creates and returns a new `Gunzip` object.
+     * @since v0.5.8
+     */
+    function createGunzip(options?: ZlibOptions): Gunzip;
+    /**
+     * Creates and returns a new `Deflate` object.
+     * @since v0.5.8
+     */
+    function createDeflate(options?: ZlibOptions): Deflate;
+    /**
+     * Creates and returns a new `Inflate` object.
+     * @since v0.5.8
+     */
+    function createInflate(options?: ZlibOptions): Inflate;
+    /**
+     * Creates and returns a new `DeflateRaw` object.
+     *
+     * An upgrade of zlib from 1.2.8 to 1.2.11 changed behavior when `windowBits`is set to 8 for raw deflate streams. zlib would automatically set `windowBits`to 9 if was initially set to 8\. Newer
+     * versions of zlib will throw an exception,
+     * so Node.js restored the original behavior of upgrading a value of 8 to 9,
+     * since passing `windowBits = 9` to zlib actually results in a compressed stream
+     * that effectively uses an 8-bit window only.
+     * @since v0.5.8
+     */
+    function createDeflateRaw(options?: ZlibOptions): DeflateRaw;
+    /**
+     * Creates and returns a new `InflateRaw` object.
+     * @since v0.5.8
+     */
+    function createInflateRaw(options?: ZlibOptions): InflateRaw;
+    /**
+     * Creates and returns a new `Unzip` object.
+     * @since v0.5.8
+     */
+    function createUnzip(options?: ZlibOptions): Unzip;
+    type InputType = string | ArrayBuffer | NodeJS.ArrayBufferView;
+    type CompressCallback = (error: Error | null, result: Buffer) => void;
+    /**
+     * @since v11.7.0, v10.16.0
+     */
+    function brotliCompress(buf: InputType, options: BrotliOptions, callback: CompressCallback): void;
+    function brotliCompress(buf: InputType, callback: CompressCallback): void;
+    namespace brotliCompress {
+        function __promisify__(buffer: InputType, options?: BrotliOptions): Promise<Buffer>;
+    }
+    /**
+     * Compress a chunk of data with `BrotliCompress`.
+     * @since v11.7.0, v10.16.0
+     */
+    function brotliCompressSync(buf: InputType, options?: BrotliOptions): Buffer;
+    /**
+     * @since v11.7.0, v10.16.0
+     */
+    function brotliDecompress(buf: InputType, options: BrotliOptions, callback: CompressCallback): void;
+    function brotliDecompress(buf: InputType, callback: CompressCallback): void;
+    namespace brotliDecompress {
+        function __promisify__(buffer: InputType, options?: BrotliOptions): Promise<Buffer>;
+    }
+    /**
+     * Decompress a chunk of data with `BrotliDecompress`.
+     * @since v11.7.0, v10.16.0
+     */
+    function brotliDecompressSync(buf: InputType, options?: BrotliOptions): Buffer;
+    /**
+     * @since v0.6.0
+     */
+    function deflate(buf: InputType, callback: CompressCallback): void;
+    function deflate(buf: InputType, options: ZlibOptions, callback: CompressCallback): void;
+    namespace deflate {
+        function __promisify__(buffer: InputType, options?: ZlibOptions): Promise<Buffer>;
+    }
+    /**
+     * Compress a chunk of data with `Deflate`.
+     * @since v0.11.12
+     */
+    function deflateSync(buf: InputType, options?: ZlibOptions): Buffer;
+    /**
+     * @since v0.6.0
+     */
+    function deflateRaw(buf: InputType, callback: CompressCallback): void;
+    function deflateRaw(buf: InputType, options: ZlibOptions, callback: CompressCallback): void;
+    namespace deflateRaw {
+        function __promisify__(buffer: InputType, options?: ZlibOptions): Promise<Buffer>;
+    }
+    /**
+     * Compress a chunk of data with `DeflateRaw`.
+     * @since v0.11.12
+     */
+    function deflateRawSync(buf: InputType, options?: ZlibOptions): Buffer;
+    /**
+     * @since v0.6.0
+     */
+    function gzip(buf: InputType, callback: CompressCallback): void;
+    function gzip(buf: InputType, options: ZlibOptions, callback: CompressCallback): void;
+    namespace gzip {
+        function __promisify__(buffer: InputType, options?: ZlibOptions): Promise<Buffer>;
+    }
+    /**
+     * Compress a chunk of data with `Gzip`.
+     * @since v0.11.12
+     */
+    function gzipSync(buf: InputType, options?: ZlibOptions): Buffer;
+    /**
+     * @since v0.6.0
+     */
+    function gunzip(buf: InputType, callback: CompressCallback): void;
+    function gunzip(buf: InputType, options: ZlibOptions, callback: CompressCallback): void;
+    namespace gunzip {
+        function __promisify__(buffer: InputType, options?: ZlibOptions): Promise<Buffer>;
+    }
+    /**
+     * Decompress a chunk of data with `Gunzip`.
+     * @since v0.11.12
+     */
+    function gunzipSync(buf: InputType, options?: ZlibOptions): Buffer;
+    /**
+     * @since v0.6.0
+     */
+    function inflate(buf: InputType, callback: CompressCallback): void;
+    function inflate(buf: InputType, options: ZlibOptions, callback: CompressCallback): void;
+    namespace inflate {
+        function __promisify__(buffer: InputType, options?: ZlibOptions): Promise<Buffer>;
+    }
+    /**
+     * Decompress a chunk of data with `Inflate`.
+     * @since v0.11.12
+     */
+    function inflateSync(buf: InputType, options?: ZlibOptions): Buffer;
+    /**
+     * @since v0.6.0
+     */
+    function inflateRaw(buf: InputType, callback: CompressCallback): void;
+    function inflateRaw(buf: InputType, options: ZlibOptions, callback: CompressCallback): void;
+    namespace inflateRaw {
+        function __promisify__(buffer: InputType, options?: ZlibOptions): Promise<Buffer>;
+    }
+    /**
+     * Decompress a chunk of data with `InflateRaw`.
+     * @since v0.11.12
+     */
+    function inflateRawSync(buf: InputType, options?: ZlibOptions): Buffer;
+    /**
+     * @since v0.6.0
+     */
+    function unzip(buf: InputType, callback: CompressCallback): void;
+    function unzip(buf: InputType, options: ZlibOptions, callback: CompressCallback): void;
+    namespace unzip {
+        function __promisify__(buffer: InputType, options?: ZlibOptions): Promise<Buffer>;
+    }
+    /**
+     * Decompress a chunk of data with `Unzip`.
+     * @since v0.11.12
+     */
+    function unzipSync(buf: InputType, options?: ZlibOptions): Buffer;
+    namespace constants {
+        const BROTLI_DECODE: number;
+        const BROTLI_DECODER_ERROR_ALLOC_BLOCK_TYPE_TREES: number;
+        const BROTLI_DECODER_ERROR_ALLOC_CONTEXT_MAP: number;
+        const BROTLI_DECODER_ERROR_ALLOC_CONTEXT_MODES: number;
+        const BROTLI_DECODER_ERROR_ALLOC_RING_BUFFER_1: number;
+        const BROTLI_DECODER_ERROR_ALLOC_RING_BUFFER_2: number;
+        const BROTLI_DECODER_ERROR_ALLOC_TREE_GROUPS: number;
+        const BROTLI_DECODER_ERROR_DICTIONARY_NOT_SET: number;
+        const BROTLI_DECODER_ERROR_FORMAT_BLOCK_LENGTH_1: number;
+        const BROTLI_DECODER_ERROR_FORMAT_BLOCK_LENGTH_2: number;
+        const BROTLI_DECODER_ERROR_FORMAT_CL_SPACE: number;
+        const BROTLI_DECODER_ERROR_FORMAT_CONTEXT_MAP_REPEAT: number;
+        const BROTLI_DECODER_ERROR_FORMAT_DICTIONARY: number;
+        const BROTLI_DECODER_ERROR_FORMAT_DISTANCE: number;
+        const BROTLI_DECODER_ERROR_FORMAT_EXUBERANT_META_NIBBLE: number;
+        const BROTLI_DECODER_ERROR_FORMAT_EXUBERANT_NIBBLE: number;
+        const BROTLI_DECODER_ERROR_FORMAT_HUFFMAN_SPACE: number;
+        const BROTLI_DECODER_ERROR_FORMAT_PADDING_1: number;
+        const BROTLI_DECODER_ERROR_FORMAT_PADDING_2: number;
+        const BROTLI_DECODER_ERROR_FORMAT_RESERVED: number;
+        const BROTLI_DECODER_ERROR_FORMAT_SIMPLE_HUFFMAN_ALPHABET: number;
+        const BROTLI_DECODER_ERROR_FORMAT_SIMPLE_HUFFMAN_SAME: number;
+        const BROTLI_DECODER_ERROR_FORMAT_TRANSFORM: number;
+        const BROTLI_DECODER_ERROR_FORMAT_WINDOW_BITS: number;
+        const BROTLI_DECODER_ERROR_INVALID_ARGUMENTS: number;
+        const BROTLI_DECODER_ERROR_UNREACHABLE: number;
+        const BROTLI_DECODER_NEEDS_MORE_INPUT: number;
+        const BROTLI_DECODER_NEEDS_MORE_OUTPUT: number;
+        const BROTLI_DECODER_NO_ERROR: number;
+        const BROTLI_DECODER_PARAM_DISABLE_RING_BUFFER_REALLOCATION: number;
+        const BROTLI_DECODER_PARAM_LARGE_WINDOW: number;
+        const BROTLI_DECODER_RESULT_ERROR: number;
+        const BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT: number;
+        const BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT: number;
+        const BROTLI_DECODER_RESULT_SUCCESS: number;
+        const BROTLI_DECODER_SUCCESS: number;
+        const BROTLI_DEFAULT_MODE: number;
+        const BROTLI_DEFAULT_QUALITY: number;
+        const BROTLI_DEFAULT_WINDOW: number;
+        const BROTLI_ENCODE: number;
+        const BROTLI_LARGE_MAX_WINDOW_BITS: number;
+        const BROTLI_MAX_INPUT_BLOCK_BITS: number;
+        const BROTLI_MAX_QUALITY: number;
+        const BROTLI_MAX_WINDOW_BITS: number;
+        const BROTLI_MIN_INPUT_BLOCK_BITS: number;
+        const BROTLI_MIN_QUALITY: number;
+        const BROTLI_MIN_WINDOW_BITS: number;
+        const BROTLI_MODE_FONT: number;
+        const BROTLI_MODE_GENERIC: number;
+        const BROTLI_MODE_TEXT: number;
+        const BROTLI_OPERATION_EMIT_METADATA: number;
+        const BROTLI_OPERATION_FINISH: number;
+        const BROTLI_OPERATION_FLUSH: number;
+        const BROTLI_OPERATION_PROCESS: number;
+        const BROTLI_PARAM_DISABLE_LITERAL_CONTEXT_MODELING: number;
+        const BROTLI_PARAM_LARGE_WINDOW: number;
+        const BROTLI_PARAM_LGBLOCK: number;
+        const BROTLI_PARAM_LGWIN: number;
+        const BROTLI_PARAM_MODE: number;
+        const BROTLI_PARAM_NDIRECT: number;
+        const BROTLI_PARAM_NPOSTFIX: number;
+        const BROTLI_PARAM_QUALITY: number;
+        const BROTLI_PARAM_SIZE_HINT: number;
+        const DEFLATE: number;
+        const DEFLATERAW: number;
+        const GUNZIP: number;
+        const GZIP: number;
+        const INFLATE: number;
+        const INFLATERAW: number;
+        const UNZIP: number;
+        // Allowed flush values.
+        const Z_NO_FLUSH: number;
+        const Z_PARTIAL_FLUSH: number;
+        const Z_SYNC_FLUSH: number;
+        const Z_FULL_FLUSH: number;
+        const Z_FINISH: number;
+        const Z_BLOCK: number;
+        const Z_TREES: number;
+        // Return codes for the compression/decompression functions.
+        // Negative values are errors, positive values are used for special but normal events.
+        const Z_OK: number;
+        const Z_STREAM_END: number;
+        const Z_NEED_DICT: number;
+        const Z_ERRNO: number;
+        const Z_STREAM_ERROR: number;
+        const Z_DATA_ERROR: number;
+        const Z_MEM_ERROR: number;
+        const Z_BUF_ERROR: number;
+        const Z_VERSION_ERROR: number;
+        // Compression levels.
+        const Z_NO_COMPRESSION: number;
+        const Z_BEST_SPEED: number;
+        const Z_BEST_COMPRESSION: number;
+        const Z_DEFAULT_COMPRESSION: number;
+        // Compression strategy.
+        const Z_FILTERED: number;
+        const Z_HUFFMAN_ONLY: number;
+        const Z_RLE: number;
+        const Z_FIXED: number;
+        const Z_DEFAULT_STRATEGY: number;
+        const Z_DEFAULT_WINDOWBITS: number;
+        const Z_MIN_WINDOWBITS: number;
+        const Z_MAX_WINDOWBITS: number;
+        const Z_MIN_CHUNK: number;
+        const Z_MAX_CHUNK: number;
+        const Z_DEFAULT_CHUNK: number;
+        const Z_MIN_MEMLEVEL: number;
+        const Z_MAX_MEMLEVEL: number;
+        const Z_DEFAULT_MEMLEVEL: number;
+        const Z_MIN_LEVEL: number;
+        const Z_MAX_LEVEL: number;
+        const Z_DEFAULT_LEVEL: number;
+        const ZLIB_VERNUM: number;
+    }
+    // Allowed flush values.
+    /** @deprecated Use `constants.Z_NO_FLUSH` */
+    const Z_NO_FLUSH: number;
+    /** @deprecated Use `constants.Z_PARTIAL_FLUSH` */
+    const Z_PARTIAL_FLUSH: number;
+    /** @deprecated Use `constants.Z_SYNC_FLUSH` */
+    const Z_SYNC_FLUSH: number;
+    /** @deprecated Use `constants.Z_FULL_FLUSH` */
+    const Z_FULL_FLUSH: number;
+    /** @deprecated Use `constants.Z_FINISH` */
+    const Z_FINISH: number;
+    /** @deprecated Use `constants.Z_BLOCK` */
+    const Z_BLOCK: number;
+    /** @deprecated Use `constants.Z_TREES` */
+    const Z_TREES: number;
+    // Return codes for the compression/decompression functions.
+    // Negative values are errors, positive values are used for special but normal events.
+    /** @deprecated Use `constants.Z_OK` */
+    const Z_OK: number;
+    /** @deprecated Use `constants.Z_STREAM_END` */
+    const Z_STREAM_END: number;
+    /** @deprecated Use `constants.Z_NEED_DICT` */
+    const Z_NEED_DICT: number;
+    /** @deprecated Use `constants.Z_ERRNO` */
+    const Z_ERRNO: number;
+    /** @deprecated Use `constants.Z_STREAM_ERROR` */
+    const Z_STREAM_ERROR: number;
+    /** @deprecated Use `constants.Z_DATA_ERROR` */
+    const Z_DATA_ERROR: number;
+    /** @deprecated Use `constants.Z_MEM_ERROR` */
+    const Z_MEM_ERROR: number;
+    /** @deprecated Use `constants.Z_BUF_ERROR` */
+    const Z_BUF_ERROR: number;
+    /** @deprecated Use `constants.Z_VERSION_ERROR` */
+    const Z_VERSION_ERROR: number;
+    // Compression levels.
+    /** @deprecated Use `constants.Z_NO_COMPRESSION` */
+    const Z_NO_COMPRESSION: number;
+    /** @deprecated Use `constants.Z_BEST_SPEED` */
+    const Z_BEST_SPEED: number;
+    /** @deprecated Use `constants.Z_BEST_COMPRESSION` */
+    const Z_BEST_COMPRESSION: number;
+    /** @deprecated Use `constants.Z_DEFAULT_COMPRESSION` */
+    const Z_DEFAULT_COMPRESSION: number;
+    // Compression strategy.
+    /** @deprecated Use `constants.Z_FILTERED` */
+    const Z_FILTERED: number;
+    /** @deprecated Use `constants.Z_HUFFMAN_ONLY` */
+    const Z_HUFFMAN_ONLY: number;
+    /** @deprecated Use `constants.Z_RLE` */
+    const Z_RLE: number;
+    /** @deprecated Use `constants.Z_FIXED` */
+    const Z_FIXED: number;
+    /** @deprecated Use `constants.Z_DEFAULT_STRATEGY` */
+    const Z_DEFAULT_STRATEGY: number;
+    /** @deprecated */
+    const Z_BINARY: number;
+    /** @deprecated */
+    const Z_TEXT: number;
+    /** @deprecated */
+    const Z_ASCII: number;
+    /** @deprecated  */
+    const Z_UNKNOWN: number;
+    /** @deprecated */
+    const Z_DEFLATED: number;
+}
+declare module 'node:zlib' {
+    export * from 'zlib';
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/README.md b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/README.md
new file mode 100644
index 0000000..7560244
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/README.md
@@ -0,0 +1,167 @@
+# @webassemblyjs/ast
+
+> AST utils for webassemblyjs
+
+## Installation
+
+```sh
+yarn add @webassemblyjs/ast
+```
+
+## Usage
+
+### Traverse
+
+```js
+import { traverse } from "@webassemblyjs/ast";
+
+traverse(ast, {
+  Module(path) {
+    console.log(path.node);
+  }
+});
+```
+
+### Instruction signatures
+
+```js
+import { signatures } from "@webassemblyjs/ast";
+
+console.log(signatures);
+```
+
+### Path methods
+
+- `findParent: NodeLocator`
+- `replaceWith: Node => void`
+- `remove: () => void`
+- `insertBefore: Node => void`
+- `insertAfter: Node => void`
+- `stop: () => void`
+
+### AST utils
+
+- function `module(id, fields, metadata)`
+- function `moduleMetadata(sections, functionNames, localNames)`
+- function `moduleNameMetadata(value)`
+- function `functionNameMetadata(value, index)`
+- function `localNameMetadata(value, localIndex, functionIndex)`
+- function `binaryModule(id, blob)`
+- function `quoteModule(id, string)`
+- function `sectionMetadata(section, startOffset, size, vectorOfSize)`
+- function `loopInstruction(label, resulttype, instr)`
+- function `instruction(id, args, namedArgs)`
+- function `objectInstruction(id, object, args, namedArgs)`
+- function `ifInstruction(testLabel, test, result, consequent, alternate)`
+- function `stringLiteral(value)`
+- function `numberLiteralFromRaw(value, raw)`
+- function `longNumberLiteral(value, raw)`
+- function `floatLiteral(value, nan, inf, raw)`
+- function `elem(table, offset, funcs)`
+- function `indexInFuncSection(index)`
+- function `valtypeLiteral(name)`
+- function `typeInstruction(id, functype)`
+- function `start(index)`
+- function `globalType(valtype, mutability)`
+- function `leadingComment(value)`
+- function `blockComment(value)`
+- function `data(memoryIndex, offset, init)`
+- function `global(globalType, init, name)`
+- function `table(elementType, limits, name, elements)`
+- function `memory(limits, id)`
+- function `funcImportDescr(id, signature)`
+- function `moduleImport(module, name, descr)`
+- function `moduleExportDescr(exportType, id)`
+- function `moduleExport(name, descr)`
+- function `limit(min, max)`
+- function `signature(params, results)`
+- function `program(body)`
+- function `identifier(value, raw)`
+- function `blockInstruction(label, instr, result)`
+- function `callInstruction(index, instrArgs)`
+- function `callIndirectInstruction(signature, intrs)`
+- function `byteArray(values)`
+- function `func(name, signature, body, isExternal, metadata)`
+- Constant`isModule`
+- Constant`isModuleMetadata`
+- Constant`isModuleNameMetadata`
+- Constant`isFunctionNameMetadata`
+- Constant`isLocalNameMetadata`
+- Constant`isBinaryModule`
+- Constant`isQuoteModule`
+- Constant`isSectionMetadata`
+- Constant`isLoopInstruction`
+- Constant`isInstruction`
+- Constant`isObjectInstruction`
+- Constant`isIfInstruction`
+- Constant`isStringLiteral`
+- Constant`isNumberLiteral`
+- Constant`isLongNumberLiteral`
+- Constant`isFloatLiteral`
+- Constant`isElem`
+- Constant`isIndexInFuncSection`
+- Constant`isValtypeLiteral`
+- Constant`isTypeInstruction`
+- Constant`isStart`
+- Constant`isGlobalType`
+- Constant`isLeadingComment`
+- Constant`isBlockComment`
+- Constant`isData`
+- Constant`isGlobal`
+- Constant`isTable`
+- Constant`isMemory`
+- Constant`isFuncImportDescr`
+- Constant`isModuleImport`
+- Constant`isModuleExportDescr`
+- Constant`isModuleExport`
+- Constant`isLimit`
+- Constant`isSignature`
+- Constant`isProgram`
+- Constant`isIdentifier`
+- Constant`isBlockInstruction`
+- Constant`isCallInstruction`
+- Constant`isCallIndirectInstruction`
+- Constant`isByteArray`
+- Constant`isFunc`
+- Constant`assertModule`
+- Constant`assertModuleMetadata`
+- Constant`assertModuleNameMetadata`
+- Constant`assertFunctionNameMetadata`
+- Constant`assertLocalNameMetadata`
+- Constant`assertBinaryModule`
+- Constant`assertQuoteModule`
+- Constant`assertSectionMetadata`
+- Constant`assertLoopInstruction`
+- Constant`assertInstruction`
+- Constant`assertObjectInstruction`
+- Constant`assertIfInstruction`
+- Constant`assertStringLiteral`
+- Constant`assertNumberLiteral`
+- Constant`assertLongNumberLiteral`
+- Constant`assertFloatLiteral`
+- Constant`assertElem`
+- Constant`assertIndexInFuncSection`
+- Constant`assertValtypeLiteral`
+- Constant`assertTypeInstruction`
+- Constant`assertStart`
+- Constant`assertGlobalType`
+- Constant`assertLeadingComment`
+- Constant`assertBlockComment`
+- Constant`assertData`
+- Constant`assertGlobal`
+- Constant`assertTable`
+- Constant`assertMemory`
+- Constant`assertFuncImportDescr`
+- Constant`assertModuleImport`
+- Constant`assertModuleExportDescr`
+- Constant`assertModuleExport`
+- Constant`assertLimit`
+- Constant`assertSignature`
+- Constant`assertProgram`
+- Constant`assertIdentifier`
+- Constant`assertBlockInstruction`
+- Constant`assertCallInstruction`
+- Constant`assertCallIndirectInstruction`
+- Constant`assertByteArray`
+- Constant`assertFunc`
+
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/clone.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/clone.js
new file mode 100644
index 0000000..7018fee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/clone.js
@@ -0,0 +1,3 @@
+export function cloneNode(n) {
+  return Object.assign({}, n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/definitions.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/definitions.js
new file mode 100644
index 0000000..c5053c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/definitions.js
@@ -0,0 +1,668 @@
+var definitions = {};
+
+function defineType(typeName, metadata) {
+  definitions[typeName] = metadata;
+}
+
+defineType("Module", {
+  spec: {
+    wasm: "https://webassembly.github.io/spec/core/binary/modules.html#binary-module",
+    wat: "https://webassembly.github.io/spec/core/text/modules.html#text-module"
+  },
+  doc: "A module consists of a sequence of sections (termed fields in the text format).",
+  unionType: ["Node"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "string"
+    },
+    fields: {
+      array: true,
+      type: "Node"
+    },
+    metadata: {
+      optional: true,
+      type: "ModuleMetadata"
+    }
+  }
+});
+defineType("ModuleMetadata", {
+  unionType: ["Node"],
+  fields: {
+    sections: {
+      array: true,
+      type: "SectionMetadata"
+    },
+    functionNames: {
+      optional: true,
+      array: true,
+      type: "FunctionNameMetadata"
+    },
+    localNames: {
+      optional: true,
+      array: true,
+      type: "ModuleMetadata"
+    },
+    producers: {
+      optional: true,
+      array: true,
+      type: "ProducersSectionMetadata"
+    }
+  }
+});
+defineType("ModuleNameMetadata", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("FunctionNameMetadata", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    },
+    index: {
+      type: "number"
+    }
+  }
+});
+defineType("LocalNameMetadata", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    },
+    localIndex: {
+      type: "number"
+    },
+    functionIndex: {
+      type: "number"
+    }
+  }
+});
+defineType("BinaryModule", {
+  unionType: ["Node"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "string"
+    },
+    blob: {
+      array: true,
+      type: "string"
+    }
+  }
+});
+defineType("QuoteModule", {
+  unionType: ["Node"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "string"
+    },
+    string: {
+      array: true,
+      type: "string"
+    }
+  }
+});
+defineType("SectionMetadata", {
+  unionType: ["Node"],
+  fields: {
+    section: {
+      type: "SectionName"
+    },
+    startOffset: {
+      type: "number"
+    },
+    size: {
+      type: "NumberLiteral"
+    },
+    vectorOfSize: {
+      comment: "Size of the vector in the section (if any)",
+      type: "NumberLiteral"
+    }
+  }
+});
+defineType("ProducersSectionMetadata", {
+  unionType: ["Node"],
+  fields: {
+    producers: {
+      array: true,
+      type: "ProducerMetadata"
+    }
+  }
+});
+defineType("ProducerMetadata", {
+  unionType: ["Node"],
+  fields: {
+    language: {
+      type: "ProducerMetadataVersionedName",
+      array: true
+    },
+    processedBy: {
+      type: "ProducerMetadataVersionedName",
+      array: true
+    },
+    sdk: {
+      type: "ProducerMetadataVersionedName",
+      array: true
+    }
+  }
+});
+defineType("ProducerMetadataVersionedName", {
+  unionType: ["Node"],
+  fields: {
+    name: {
+      type: "string"
+    },
+    version: {
+      type: "string"
+    }
+  }
+});
+/*
+Instructions
+*/
+
+defineType("LoopInstruction", {
+  unionType: ["Node", "Block", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "loop"
+    },
+    label: {
+      maybe: true,
+      type: "Identifier"
+    },
+    resulttype: {
+      maybe: true,
+      type: "Valtype"
+    },
+    instr: {
+      array: true,
+      type: "Instruction"
+    }
+  }
+});
+defineType("Instr", {
+  unionType: ["Node", "Expression", "Instruction"],
+  fields: {
+    id: {
+      type: "string"
+    },
+    object: {
+      optional: true,
+      type: "Valtype"
+    },
+    args: {
+      array: true,
+      type: "Expression"
+    },
+    namedArgs: {
+      optional: true,
+      type: "Object"
+    }
+  }
+});
+defineType("IfInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "if"
+    },
+    testLabel: {
+      comment: "only for WAST",
+      type: "Identifier"
+    },
+    test: {
+      array: true,
+      type: "Instruction"
+    },
+    result: {
+      maybe: true,
+      type: "Valtype"
+    },
+    consequent: {
+      array: true,
+      type: "Instruction"
+    },
+    alternate: {
+      array: true,
+      type: "Instruction"
+    }
+  }
+});
+/* 
+Concrete value types
+*/
+
+defineType("StringLiteral", {
+  unionType: ["Node", "Expression"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("NumberLiteral", {
+  unionType: ["Node", "NumericLiteral", "Expression"],
+  fields: {
+    value: {
+      type: "number"
+    },
+    raw: {
+      type: "string"
+    }
+  }
+});
+defineType("LongNumberLiteral", {
+  unionType: ["Node", "NumericLiteral", "Expression"],
+  fields: {
+    value: {
+      type: "LongNumber"
+    },
+    raw: {
+      type: "string"
+    }
+  }
+});
+defineType("FloatLiteral", {
+  unionType: ["Node", "NumericLiteral", "Expression"],
+  fields: {
+    value: {
+      type: "number"
+    },
+    nan: {
+      optional: true,
+      type: "boolean"
+    },
+    inf: {
+      optional: true,
+      type: "boolean"
+    },
+    raw: {
+      type: "string"
+    }
+  }
+});
+defineType("Elem", {
+  unionType: ["Node"],
+  fields: {
+    table: {
+      type: "Index"
+    },
+    offset: {
+      array: true,
+      type: "Instruction"
+    },
+    funcs: {
+      array: true,
+      type: "Index"
+    }
+  }
+});
+defineType("IndexInFuncSection", {
+  unionType: ["Node"],
+  fields: {
+    index: {
+      type: "Index"
+    }
+  }
+});
+defineType("ValtypeLiteral", {
+  unionType: ["Node", "Expression"],
+  fields: {
+    name: {
+      type: "Valtype"
+    }
+  }
+});
+defineType("TypeInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "Index"
+    },
+    functype: {
+      type: "Signature"
+    }
+  }
+});
+defineType("Start", {
+  unionType: ["Node"],
+  fields: {
+    index: {
+      type: "Index"
+    }
+  }
+});
+defineType("GlobalType", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    valtype: {
+      type: "Valtype"
+    },
+    mutability: {
+      type: "Mutability"
+    }
+  }
+});
+defineType("LeadingComment", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("BlockComment", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("Data", {
+  unionType: ["Node"],
+  fields: {
+    memoryIndex: {
+      type: "Memidx"
+    },
+    offset: {
+      type: "Instruction"
+    },
+    init: {
+      type: "ByteArray"
+    }
+  }
+});
+defineType("Global", {
+  unionType: ["Node"],
+  fields: {
+    globalType: {
+      type: "GlobalType"
+    },
+    init: {
+      array: true,
+      type: "Instruction"
+    },
+    name: {
+      maybe: true,
+      type: "Identifier"
+    }
+  }
+});
+defineType("Table", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    elementType: {
+      type: "TableElementType"
+    },
+    limits: {
+      assertNodeType: true,
+      type: "Limit"
+    },
+    name: {
+      maybe: true,
+      type: "Identifier"
+    },
+    elements: {
+      array: true,
+      optional: true,
+      type: "Index"
+    }
+  }
+});
+defineType("Memory", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    limits: {
+      type: "Limit"
+    },
+    id: {
+      maybe: true,
+      type: "Index"
+    }
+  }
+});
+defineType("FuncImportDescr", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    id: {
+      type: "Identifier"
+    },
+    signature: {
+      type: "Signature"
+    }
+  }
+});
+defineType("ModuleImport", {
+  unionType: ["Node"],
+  fields: {
+    module: {
+      type: "string"
+    },
+    name: {
+      type: "string"
+    },
+    descr: {
+      type: "ImportDescr"
+    }
+  }
+});
+defineType("ModuleExportDescr", {
+  unionType: ["Node"],
+  fields: {
+    exportType: {
+      type: "ExportDescrType"
+    },
+    id: {
+      type: "Index"
+    }
+  }
+});
+defineType("ModuleExport", {
+  unionType: ["Node"],
+  fields: {
+    name: {
+      type: "string"
+    },
+    descr: {
+      type: "ModuleExportDescr"
+    }
+  }
+});
+defineType("Limit", {
+  unionType: ["Node"],
+  fields: {
+    min: {
+      type: "number"
+    },
+    max: {
+      optional: true,
+      type: "number"
+    },
+    // Threads proposal, shared memory
+    shared: {
+      optional: true,
+      type: "boolean"
+    }
+  }
+});
+defineType("Signature", {
+  unionType: ["Node"],
+  fields: {
+    params: {
+      array: true,
+      type: "FuncParam"
+    },
+    results: {
+      array: true,
+      type: "Valtype"
+    }
+  }
+});
+defineType("Program", {
+  unionType: ["Node"],
+  fields: {
+    body: {
+      array: true,
+      type: "Node"
+    }
+  }
+});
+defineType("Identifier", {
+  unionType: ["Node", "Expression"],
+  fields: {
+    value: {
+      type: "string"
+    },
+    raw: {
+      optional: true,
+      type: "string"
+    }
+  }
+});
+defineType("BlockInstruction", {
+  unionType: ["Node", "Block", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "block"
+    },
+    label: {
+      maybe: true,
+      type: "Identifier"
+    },
+    instr: {
+      array: true,
+      type: "Instruction"
+    },
+    result: {
+      maybe: true,
+      type: "Valtype"
+    }
+  }
+});
+defineType("CallInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "call"
+    },
+    index: {
+      type: "Index"
+    },
+    instrArgs: {
+      array: true,
+      optional: true,
+      type: "Expression"
+    },
+    numeric: {
+      type: "Index",
+      optional: true
+    }
+  }
+});
+defineType("CallIndirectInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "call_indirect"
+    },
+    signature: {
+      type: "SignatureOrTypeRef"
+    },
+    intrs: {
+      array: true,
+      optional: true,
+      type: "Expression"
+    }
+  }
+});
+defineType("ByteArray", {
+  unionType: ["Node"],
+  fields: {
+    values: {
+      array: true,
+      type: "Byte"
+    }
+  }
+});
+defineType("Func", {
+  unionType: ["Node", "Block"],
+  fields: {
+    name: {
+      maybe: true,
+      type: "Index"
+    },
+    signature: {
+      type: "SignatureOrTypeRef"
+    },
+    body: {
+      array: true,
+      type: "Instruction"
+    },
+    isExternal: {
+      comment: "means that it has been imported from the outside js",
+      optional: true,
+      type: "boolean"
+    },
+    metadata: {
+      optional: true,
+      type: "FuncMetadata"
+    }
+  }
+});
+/**
+ * Intrinsics
+ */
+
+defineType("InternalBrUnless", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {
+    target: {
+      type: "number"
+    }
+  }
+});
+defineType("InternalGoto", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {
+    target: {
+      type: "number"
+    }
+  }
+});
+defineType("InternalCallExtern", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {
+    target: {
+      type: "number"
+    }
+  }
+}); // function bodies are terminated by an `end` instruction but are missing a
+// return instruction
+//
+// Since we can't inject a new instruction we are injecting a new instruction.
+
+defineType("InternalEndAndReturn", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {}
+});
+module.exports = definitions;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/index.js
new file mode 100644
index 0000000..17ba19b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/index.js
@@ -0,0 +1,7 @@
+export * from "./nodes";
+export { numberLiteralFromRaw, withLoc, withRaw, funcParam, indexLiteral, memIndexLiteral, instruction, objectInstruction } from "./node-helpers.js";
+export { traverse } from "./traverse";
+export { signatures } from "./signatures";
+export * from "./utils";
+export { cloneNode } from "./clone";
+export { moduleContextFromModuleAST } from "./transform/ast-module-to-module-context";
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/node-helpers.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/node-helpers.js
new file mode 100644
index 0000000..37ceda6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/node-helpers.js
@@ -0,0 +1,84 @@
+import { parse32F, parse64F, parse32I, parse64I, parseU32, isNanLiteral, isInfLiteral } from "@webassemblyjs/helper-numbers";
+import { longNumberLiteral, floatLiteral, numberLiteral, instr } from "./nodes";
+export function numberLiteralFromRaw(rawValue) {
+  var instructionType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "i32";
+  var original = rawValue; // Remove numeric separators _
+
+  if (typeof rawValue === "string") {
+    rawValue = rawValue.replace(/_/g, "");
+  }
+
+  if (typeof rawValue === "number") {
+    return numberLiteral(rawValue, String(original));
+  } else {
+    switch (instructionType) {
+      case "i32":
+        {
+          return numberLiteral(parse32I(rawValue), String(original));
+        }
+
+      case "u32":
+        {
+          return numberLiteral(parseU32(rawValue), String(original));
+        }
+
+      case "i64":
+        {
+          return longNumberLiteral(parse64I(rawValue), String(original));
+        }
+
+      case "f32":
+        {
+          return floatLiteral(parse32F(rawValue), isNanLiteral(rawValue), isInfLiteral(rawValue), String(original));
+        }
+      // f64
+
+      default:
+        {
+          return floatLiteral(parse64F(rawValue), isNanLiteral(rawValue), isInfLiteral(rawValue), String(original));
+        }
+    }
+  }
+}
+export function instruction(id) {
+  var args = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+  var namedArgs = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+  return instr(id, undefined, args, namedArgs);
+}
+export function objectInstruction(id, object) {
+  var args = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  var namedArgs = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
+  return instr(id, object, args, namedArgs);
+}
+/**
+ * Decorators
+ */
+
+export function withLoc(n, end, start) {
+  var loc = {
+    start: start,
+    end: end
+  };
+  n.loc = loc;
+  return n;
+}
+export function withRaw(n, raw) {
+  n.raw = raw;
+  return n;
+}
+export function funcParam(valtype, id) {
+  return {
+    id: id,
+    valtype: valtype
+  };
+}
+export function indexLiteral(value) {
+  // $FlowIgnore
+  var x = numberLiteralFromRaw(value, "u32");
+  return x;
+}
+export function memIndexLiteral(value) {
+  // $FlowIgnore
+  var x = numberLiteralFromRaw(value, "u32");
+  return x;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/node-path.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/node-path.js
new file mode 100644
index 0000000..99909ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/node-path.js
@@ -0,0 +1,137 @@
+function _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
+
+function findParent(_ref, cb) {
+  var parentPath = _ref.parentPath;
+
+  if (parentPath == null) {
+    throw new Error("node is root");
+  }
+
+  var currentPath = parentPath;
+
+  while (cb(currentPath) !== false) {
+    // Hit the root node, stop
+    // $FlowIgnore
+    if (currentPath.parentPath == null) {
+      return null;
+    } // $FlowIgnore
+
+
+    currentPath = currentPath.parentPath;
+  }
+
+  return currentPath.node;
+}
+
+function insertBefore(context, newNode) {
+  return insert(context, newNode);
+}
+
+function insertAfter(context, newNode) {
+  return insert(context, newNode, 1);
+}
+
+function insert(_ref2, newNode) {
+  var node = _ref2.node,
+      inList = _ref2.inList,
+      parentPath = _ref2.parentPath,
+      parentKey = _ref2.parentKey;
+  var indexOffset = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+
+  if (!inList) {
+    throw new Error('inList' + " error: " + ("insert can only be used for nodes that are within lists" || "unknown"));
+  }
+
+  if (!(parentPath != null)) {
+    throw new Error('parentPath != null' + " error: " + ("Can not remove root node" || "unknown"));
+  }
+
+  // $FlowIgnore
+  var parentList = parentPath.node[parentKey];
+  var indexInList = parentList.findIndex(function (n) {
+    return n === node;
+  });
+  parentList.splice(indexInList + indexOffset, 0, newNode);
+}
+
+function remove(_ref3) {
+  var node = _ref3.node,
+      parentKey = _ref3.parentKey,
+      parentPath = _ref3.parentPath;
+
+  if (!(parentPath != null)) {
+    throw new Error('parentPath != null' + " error: " + ("Can not remove root node" || "unknown"));
+  }
+
+  // $FlowIgnore
+  var parentNode = parentPath.node; // $FlowIgnore
+
+  var parentProperty = parentNode[parentKey];
+
+  if (Array.isArray(parentProperty)) {
+    // $FlowIgnore
+    parentNode[parentKey] = parentProperty.filter(function (n) {
+      return n !== node;
+    });
+  } else {
+    // $FlowIgnore
+    delete parentNode[parentKey];
+  }
+
+  node._deleted = true;
+}
+
+function stop(context) {
+  context.shouldStop = true;
+}
+
+function replaceWith(context, newNode) {
+  // $FlowIgnore
+  var parentNode = context.parentPath.node; // $FlowIgnore
+
+  var parentProperty = parentNode[context.parentKey];
+
+  if (Array.isArray(parentProperty)) {
+    var indexInList = parentProperty.findIndex(function (n) {
+      return n === context.node;
+    });
+    parentProperty.splice(indexInList, 1, newNode);
+  } else {
+    // $FlowIgnore
+    parentNode[context.parentKey] = newNode;
+  }
+
+  context.node._deleted = true;
+  context.node = newNode;
+} // bind the context to the first argument of node operations
+
+
+function bindNodeOperations(operations, context) {
+  var keys = Object.keys(operations);
+  var boundOperations = {};
+  keys.forEach(function (key) {
+    boundOperations[key] = operations[key].bind(null, context);
+  });
+  return boundOperations;
+}
+
+function createPathOperations(context) {
+  // $FlowIgnore
+  return bindNodeOperations({
+    findParent: findParent,
+    replaceWith: replaceWith,
+    remove: remove,
+    insertBefore: insertBefore,
+    insertAfter: insertAfter,
+    stop: stop
+  }, context);
+}
+
+export function createPath(context) {
+  var path = _extends({}, context); // $FlowIgnore
+
+
+  Object.assign(path, createPathOperations(path)); // $FlowIgnore
+
+  return path;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/nodes.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/nodes.js
new file mode 100644
index 0000000..66c8f62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/nodes.js
@@ -0,0 +1,925 @@
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+// THIS FILE IS AUTOGENERATED
+// see scripts/generateNodeUtils.js
+function isTypeOf(t) {
+  return function (n) {
+    return n.type === t;
+  };
+}
+
+function assertTypeOf(t) {
+  return function (n) {
+    return function () {
+      if (!(n.type === t)) {
+        throw new Error('n.type === t' + " error: " + (undefined || "unknown"));
+      }
+    }();
+  };
+}
+
+export function module(id, fields, metadata) {
+  if (id !== null && id !== undefined) {
+    if (!(typeof id === "string")) {
+      throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+    }
+  }
+
+  if (!(_typeof(fields) === "object" && typeof fields.length !== "undefined")) {
+    throw new Error('typeof fields === "object" && typeof fields.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Module",
+    id: id,
+    fields: fields
+  };
+
+  if (typeof metadata !== "undefined") {
+    node.metadata = metadata;
+  }
+
+  return node;
+}
+export function moduleMetadata(sections, functionNames, localNames, producers) {
+  if (!(_typeof(sections) === "object" && typeof sections.length !== "undefined")) {
+    throw new Error('typeof sections === "object" && typeof sections.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (functionNames !== null && functionNames !== undefined) {
+    if (!(_typeof(functionNames) === "object" && typeof functionNames.length !== "undefined")) {
+      throw new Error('typeof functionNames === "object" && typeof functionNames.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  if (localNames !== null && localNames !== undefined) {
+    if (!(_typeof(localNames) === "object" && typeof localNames.length !== "undefined")) {
+      throw new Error('typeof localNames === "object" && typeof localNames.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  if (producers !== null && producers !== undefined) {
+    if (!(_typeof(producers) === "object" && typeof producers.length !== "undefined")) {
+      throw new Error('typeof producers === "object" && typeof producers.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "ModuleMetadata",
+    sections: sections
+  };
+
+  if (typeof functionNames !== "undefined" && functionNames.length > 0) {
+    node.functionNames = functionNames;
+  }
+
+  if (typeof localNames !== "undefined" && localNames.length > 0) {
+    node.localNames = localNames;
+  }
+
+  if (typeof producers !== "undefined" && producers.length > 0) {
+    node.producers = producers;
+  }
+
+  return node;
+}
+export function moduleNameMetadata(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "ModuleNameMetadata",
+    value: value
+  };
+  return node;
+}
+export function functionNameMetadata(value, index) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (!(typeof index === "number")) {
+    throw new Error('typeof index === "number"' + " error: " + ("Argument index must be of type number, given: " + _typeof(index) || "unknown"));
+  }
+
+  var node = {
+    type: "FunctionNameMetadata",
+    value: value,
+    index: index
+  };
+  return node;
+}
+export function localNameMetadata(value, localIndex, functionIndex) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (!(typeof localIndex === "number")) {
+    throw new Error('typeof localIndex === "number"' + " error: " + ("Argument localIndex must be of type number, given: " + _typeof(localIndex) || "unknown"));
+  }
+
+  if (!(typeof functionIndex === "number")) {
+    throw new Error('typeof functionIndex === "number"' + " error: " + ("Argument functionIndex must be of type number, given: " + _typeof(functionIndex) || "unknown"));
+  }
+
+  var node = {
+    type: "LocalNameMetadata",
+    value: value,
+    localIndex: localIndex,
+    functionIndex: functionIndex
+  };
+  return node;
+}
+export function binaryModule(id, blob) {
+  if (id !== null && id !== undefined) {
+    if (!(typeof id === "string")) {
+      throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+    }
+  }
+
+  if (!(_typeof(blob) === "object" && typeof blob.length !== "undefined")) {
+    throw new Error('typeof blob === "object" && typeof blob.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "BinaryModule",
+    id: id,
+    blob: blob
+  };
+  return node;
+}
+export function quoteModule(id, string) {
+  if (id !== null && id !== undefined) {
+    if (!(typeof id === "string")) {
+      throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+    }
+  }
+
+  if (!(_typeof(string) === "object" && typeof string.length !== "undefined")) {
+    throw new Error('typeof string === "object" && typeof string.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "QuoteModule",
+    id: id,
+    string: string
+  };
+  return node;
+}
+export function sectionMetadata(section, startOffset, size, vectorOfSize) {
+  if (!(typeof startOffset === "number")) {
+    throw new Error('typeof startOffset === "number"' + " error: " + ("Argument startOffset must be of type number, given: " + _typeof(startOffset) || "unknown"));
+  }
+
+  var node = {
+    type: "SectionMetadata",
+    section: section,
+    startOffset: startOffset,
+    size: size,
+    vectorOfSize: vectorOfSize
+  };
+  return node;
+}
+export function producersSectionMetadata(producers) {
+  if (!(_typeof(producers) === "object" && typeof producers.length !== "undefined")) {
+    throw new Error('typeof producers === "object" && typeof producers.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "ProducersSectionMetadata",
+    producers: producers
+  };
+  return node;
+}
+export function producerMetadata(language, processedBy, sdk) {
+  if (!(_typeof(language) === "object" && typeof language.length !== "undefined")) {
+    throw new Error('typeof language === "object" && typeof language.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(processedBy) === "object" && typeof processedBy.length !== "undefined")) {
+    throw new Error('typeof processedBy === "object" && typeof processedBy.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(sdk) === "object" && typeof sdk.length !== "undefined")) {
+    throw new Error('typeof sdk === "object" && typeof sdk.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "ProducerMetadata",
+    language: language,
+    processedBy: processedBy,
+    sdk: sdk
+  };
+  return node;
+}
+export function producerMetadataVersionedName(name, version) {
+  if (!(typeof name === "string")) {
+    throw new Error('typeof name === "string"' + " error: " + ("Argument name must be of type string, given: " + _typeof(name) || "unknown"));
+  }
+
+  if (!(typeof version === "string")) {
+    throw new Error('typeof version === "string"' + " error: " + ("Argument version must be of type string, given: " + _typeof(version) || "unknown"));
+  }
+
+  var node = {
+    type: "ProducerMetadataVersionedName",
+    name: name,
+    version: version
+  };
+  return node;
+}
+export function loopInstruction(label, resulttype, instr) {
+  if (!(_typeof(instr) === "object" && typeof instr.length !== "undefined")) {
+    throw new Error('typeof instr === "object" && typeof instr.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "LoopInstruction",
+    id: "loop",
+    label: label,
+    resulttype: resulttype,
+    instr: instr
+  };
+  return node;
+}
+export function instr(id, object, args, namedArgs) {
+  if (!(typeof id === "string")) {
+    throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+  }
+
+  if (!(_typeof(args) === "object" && typeof args.length !== "undefined")) {
+    throw new Error('typeof args === "object" && typeof args.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Instr",
+    id: id,
+    args: args
+  };
+
+  if (typeof object !== "undefined") {
+    node.object = object;
+  }
+
+  if (typeof namedArgs !== "undefined" && Object.keys(namedArgs).length !== 0) {
+    node.namedArgs = namedArgs;
+  }
+
+  return node;
+}
+export function ifInstruction(testLabel, test, result, consequent, alternate) {
+  if (!(_typeof(test) === "object" && typeof test.length !== "undefined")) {
+    throw new Error('typeof test === "object" && typeof test.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(consequent) === "object" && typeof consequent.length !== "undefined")) {
+    throw new Error('typeof consequent === "object" && typeof consequent.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(alternate) === "object" && typeof alternate.length !== "undefined")) {
+    throw new Error('typeof alternate === "object" && typeof alternate.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "IfInstruction",
+    id: "if",
+    testLabel: testLabel,
+    test: test,
+    result: result,
+    consequent: consequent,
+    alternate: alternate
+  };
+  return node;
+}
+export function stringLiteral(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "StringLiteral",
+    value: value
+  };
+  return node;
+}
+export function numberLiteral(value, raw) {
+  if (!(typeof value === "number")) {
+    throw new Error('typeof value === "number"' + " error: " + ("Argument value must be of type number, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (!(typeof raw === "string")) {
+    throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+  }
+
+  var node = {
+    type: "NumberLiteral",
+    value: value,
+    raw: raw
+  };
+  return node;
+}
+export function longNumberLiteral(value, raw) {
+  if (!(typeof raw === "string")) {
+    throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+  }
+
+  var node = {
+    type: "LongNumberLiteral",
+    value: value,
+    raw: raw
+  };
+  return node;
+}
+export function floatLiteral(value, nan, inf, raw) {
+  if (!(typeof value === "number")) {
+    throw new Error('typeof value === "number"' + " error: " + ("Argument value must be of type number, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (nan !== null && nan !== undefined) {
+    if (!(typeof nan === "boolean")) {
+      throw new Error('typeof nan === "boolean"' + " error: " + ("Argument nan must be of type boolean, given: " + _typeof(nan) || "unknown"));
+    }
+  }
+
+  if (inf !== null && inf !== undefined) {
+    if (!(typeof inf === "boolean")) {
+      throw new Error('typeof inf === "boolean"' + " error: " + ("Argument inf must be of type boolean, given: " + _typeof(inf) || "unknown"));
+    }
+  }
+
+  if (!(typeof raw === "string")) {
+    throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+  }
+
+  var node = {
+    type: "FloatLiteral",
+    value: value,
+    raw: raw
+  };
+
+  if (nan === true) {
+    node.nan = true;
+  }
+
+  if (inf === true) {
+    node.inf = true;
+  }
+
+  return node;
+}
+export function elem(table, offset, funcs) {
+  if (!(_typeof(offset) === "object" && typeof offset.length !== "undefined")) {
+    throw new Error('typeof offset === "object" && typeof offset.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(funcs) === "object" && typeof funcs.length !== "undefined")) {
+    throw new Error('typeof funcs === "object" && typeof funcs.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Elem",
+    table: table,
+    offset: offset,
+    funcs: funcs
+  };
+  return node;
+}
+export function indexInFuncSection(index) {
+  var node = {
+    type: "IndexInFuncSection",
+    index: index
+  };
+  return node;
+}
+export function valtypeLiteral(name) {
+  var node = {
+    type: "ValtypeLiteral",
+    name: name
+  };
+  return node;
+}
+export function typeInstruction(id, functype) {
+  var node = {
+    type: "TypeInstruction",
+    id: id,
+    functype: functype
+  };
+  return node;
+}
+export function start(index) {
+  var node = {
+    type: "Start",
+    index: index
+  };
+  return node;
+}
+export function globalType(valtype, mutability) {
+  var node = {
+    type: "GlobalType",
+    valtype: valtype,
+    mutability: mutability
+  };
+  return node;
+}
+export function leadingComment(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "LeadingComment",
+    value: value
+  };
+  return node;
+}
+export function blockComment(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "BlockComment",
+    value: value
+  };
+  return node;
+}
+export function data(memoryIndex, offset, init) {
+  var node = {
+    type: "Data",
+    memoryIndex: memoryIndex,
+    offset: offset,
+    init: init
+  };
+  return node;
+}
+export function global(globalType, init, name) {
+  if (!(_typeof(init) === "object" && typeof init.length !== "undefined")) {
+    throw new Error('typeof init === "object" && typeof init.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Global",
+    globalType: globalType,
+    init: init,
+    name: name
+  };
+  return node;
+}
+export function table(elementType, limits, name, elements) {
+  if (!(limits.type === "Limit")) {
+    throw new Error('limits.type === "Limit"' + " error: " + ("Argument limits must be of type Limit, given: " + limits.type || "unknown"));
+  }
+
+  if (elements !== null && elements !== undefined) {
+    if (!(_typeof(elements) === "object" && typeof elements.length !== "undefined")) {
+      throw new Error('typeof elements === "object" && typeof elements.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Table",
+    elementType: elementType,
+    limits: limits,
+    name: name
+  };
+
+  if (typeof elements !== "undefined" && elements.length > 0) {
+    node.elements = elements;
+  }
+
+  return node;
+}
+export function memory(limits, id) {
+  var node = {
+    type: "Memory",
+    limits: limits,
+    id: id
+  };
+  return node;
+}
+export function funcImportDescr(id, signature) {
+  var node = {
+    type: "FuncImportDescr",
+    id: id,
+    signature: signature
+  };
+  return node;
+}
+export function moduleImport(module, name, descr) {
+  if (!(typeof module === "string")) {
+    throw new Error('typeof module === "string"' + " error: " + ("Argument module must be of type string, given: " + _typeof(module) || "unknown"));
+  }
+
+  if (!(typeof name === "string")) {
+    throw new Error('typeof name === "string"' + " error: " + ("Argument name must be of type string, given: " + _typeof(name) || "unknown"));
+  }
+
+  var node = {
+    type: "ModuleImport",
+    module: module,
+    name: name,
+    descr: descr
+  };
+  return node;
+}
+export function moduleExportDescr(exportType, id) {
+  var node = {
+    type: "ModuleExportDescr",
+    exportType: exportType,
+    id: id
+  };
+  return node;
+}
+export function moduleExport(name, descr) {
+  if (!(typeof name === "string")) {
+    throw new Error('typeof name === "string"' + " error: " + ("Argument name must be of type string, given: " + _typeof(name) || "unknown"));
+  }
+
+  var node = {
+    type: "ModuleExport",
+    name: name,
+    descr: descr
+  };
+  return node;
+}
+export function limit(min, max, shared) {
+  if (!(typeof min === "number")) {
+    throw new Error('typeof min === "number"' + " error: " + ("Argument min must be of type number, given: " + _typeof(min) || "unknown"));
+  }
+
+  if (max !== null && max !== undefined) {
+    if (!(typeof max === "number")) {
+      throw new Error('typeof max === "number"' + " error: " + ("Argument max must be of type number, given: " + _typeof(max) || "unknown"));
+    }
+  }
+
+  if (shared !== null && shared !== undefined) {
+    if (!(typeof shared === "boolean")) {
+      throw new Error('typeof shared === "boolean"' + " error: " + ("Argument shared must be of type boolean, given: " + _typeof(shared) || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Limit",
+    min: min
+  };
+
+  if (typeof max !== "undefined") {
+    node.max = max;
+  }
+
+  if (shared === true) {
+    node.shared = true;
+  }
+
+  return node;
+}
+export function signature(params, results) {
+  if (!(_typeof(params) === "object" && typeof params.length !== "undefined")) {
+    throw new Error('typeof params === "object" && typeof params.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(results) === "object" && typeof results.length !== "undefined")) {
+    throw new Error('typeof results === "object" && typeof results.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Signature",
+    params: params,
+    results: results
+  };
+  return node;
+}
+export function program(body) {
+  if (!(_typeof(body) === "object" && typeof body.length !== "undefined")) {
+    throw new Error('typeof body === "object" && typeof body.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Program",
+    body: body
+  };
+  return node;
+}
+export function identifier(value, raw) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (raw !== null && raw !== undefined) {
+    if (!(typeof raw === "string")) {
+      throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Identifier",
+    value: value
+  };
+
+  if (typeof raw !== "undefined") {
+    node.raw = raw;
+  }
+
+  return node;
+}
+export function blockInstruction(label, instr, result) {
+  if (!(_typeof(instr) === "object" && typeof instr.length !== "undefined")) {
+    throw new Error('typeof instr === "object" && typeof instr.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "BlockInstruction",
+    id: "block",
+    label: label,
+    instr: instr,
+    result: result
+  };
+  return node;
+}
+export function callInstruction(index, instrArgs, numeric) {
+  if (instrArgs !== null && instrArgs !== undefined) {
+    if (!(_typeof(instrArgs) === "object" && typeof instrArgs.length !== "undefined")) {
+      throw new Error('typeof instrArgs === "object" && typeof instrArgs.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "CallInstruction",
+    id: "call",
+    index: index
+  };
+
+  if (typeof instrArgs !== "undefined" && instrArgs.length > 0) {
+    node.instrArgs = instrArgs;
+  }
+
+  if (typeof numeric !== "undefined") {
+    node.numeric = numeric;
+  }
+
+  return node;
+}
+export function callIndirectInstruction(signature, intrs) {
+  if (intrs !== null && intrs !== undefined) {
+    if (!(_typeof(intrs) === "object" && typeof intrs.length !== "undefined")) {
+      throw new Error('typeof intrs === "object" && typeof intrs.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "CallIndirectInstruction",
+    id: "call_indirect",
+    signature: signature
+  };
+
+  if (typeof intrs !== "undefined" && intrs.length > 0) {
+    node.intrs = intrs;
+  }
+
+  return node;
+}
+export function byteArray(values) {
+  if (!(_typeof(values) === "object" && typeof values.length !== "undefined")) {
+    throw new Error('typeof values === "object" && typeof values.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "ByteArray",
+    values: values
+  };
+  return node;
+}
+export function func(name, signature, body, isExternal, metadata) {
+  if (!(_typeof(body) === "object" && typeof body.length !== "undefined")) {
+    throw new Error('typeof body === "object" && typeof body.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (isExternal !== null && isExternal !== undefined) {
+    if (!(typeof isExternal === "boolean")) {
+      throw new Error('typeof isExternal === "boolean"' + " error: " + ("Argument isExternal must be of type boolean, given: " + _typeof(isExternal) || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Func",
+    name: name,
+    signature: signature,
+    body: body
+  };
+
+  if (isExternal === true) {
+    node.isExternal = true;
+  }
+
+  if (typeof metadata !== "undefined") {
+    node.metadata = metadata;
+  }
+
+  return node;
+}
+export function internalBrUnless(target) {
+  if (!(typeof target === "number")) {
+    throw new Error('typeof target === "number"' + " error: " + ("Argument target must be of type number, given: " + _typeof(target) || "unknown"));
+  }
+
+  var node = {
+    type: "InternalBrUnless",
+    target: target
+  };
+  return node;
+}
+export function internalGoto(target) {
+  if (!(typeof target === "number")) {
+    throw new Error('typeof target === "number"' + " error: " + ("Argument target must be of type number, given: " + _typeof(target) || "unknown"));
+  }
+
+  var node = {
+    type: "InternalGoto",
+    target: target
+  };
+  return node;
+}
+export function internalCallExtern(target) {
+  if (!(typeof target === "number")) {
+    throw new Error('typeof target === "number"' + " error: " + ("Argument target must be of type number, given: " + _typeof(target) || "unknown"));
+  }
+
+  var node = {
+    type: "InternalCallExtern",
+    target: target
+  };
+  return node;
+}
+export function internalEndAndReturn() {
+  var node = {
+    type: "InternalEndAndReturn"
+  };
+  return node;
+}
+export var isModule = isTypeOf("Module");
+export var isModuleMetadata = isTypeOf("ModuleMetadata");
+export var isModuleNameMetadata = isTypeOf("ModuleNameMetadata");
+export var isFunctionNameMetadata = isTypeOf("FunctionNameMetadata");
+export var isLocalNameMetadata = isTypeOf("LocalNameMetadata");
+export var isBinaryModule = isTypeOf("BinaryModule");
+export var isQuoteModule = isTypeOf("QuoteModule");
+export var isSectionMetadata = isTypeOf("SectionMetadata");
+export var isProducersSectionMetadata = isTypeOf("ProducersSectionMetadata");
+export var isProducerMetadata = isTypeOf("ProducerMetadata");
+export var isProducerMetadataVersionedName = isTypeOf("ProducerMetadataVersionedName");
+export var isLoopInstruction = isTypeOf("LoopInstruction");
+export var isInstr = isTypeOf("Instr");
+export var isIfInstruction = isTypeOf("IfInstruction");
+export var isStringLiteral = isTypeOf("StringLiteral");
+export var isNumberLiteral = isTypeOf("NumberLiteral");
+export var isLongNumberLiteral = isTypeOf("LongNumberLiteral");
+export var isFloatLiteral = isTypeOf("FloatLiteral");
+export var isElem = isTypeOf("Elem");
+export var isIndexInFuncSection = isTypeOf("IndexInFuncSection");
+export var isValtypeLiteral = isTypeOf("ValtypeLiteral");
+export var isTypeInstruction = isTypeOf("TypeInstruction");
+export var isStart = isTypeOf("Start");
+export var isGlobalType = isTypeOf("GlobalType");
+export var isLeadingComment = isTypeOf("LeadingComment");
+export var isBlockComment = isTypeOf("BlockComment");
+export var isData = isTypeOf("Data");
+export var isGlobal = isTypeOf("Global");
+export var isTable = isTypeOf("Table");
+export var isMemory = isTypeOf("Memory");
+export var isFuncImportDescr = isTypeOf("FuncImportDescr");
+export var isModuleImport = isTypeOf("ModuleImport");
+export var isModuleExportDescr = isTypeOf("ModuleExportDescr");
+export var isModuleExport = isTypeOf("ModuleExport");
+export var isLimit = isTypeOf("Limit");
+export var isSignature = isTypeOf("Signature");
+export var isProgram = isTypeOf("Program");
+export var isIdentifier = isTypeOf("Identifier");
+export var isBlockInstruction = isTypeOf("BlockInstruction");
+export var isCallInstruction = isTypeOf("CallInstruction");
+export var isCallIndirectInstruction = isTypeOf("CallIndirectInstruction");
+export var isByteArray = isTypeOf("ByteArray");
+export var isFunc = isTypeOf("Func");
+export var isInternalBrUnless = isTypeOf("InternalBrUnless");
+export var isInternalGoto = isTypeOf("InternalGoto");
+export var isInternalCallExtern = isTypeOf("InternalCallExtern");
+export var isInternalEndAndReturn = isTypeOf("InternalEndAndReturn");
+export var isNode = function isNode(node) {
+  return isModule(node) || isModuleMetadata(node) || isModuleNameMetadata(node) || isFunctionNameMetadata(node) || isLocalNameMetadata(node) || isBinaryModule(node) || isQuoteModule(node) || isSectionMetadata(node) || isProducersSectionMetadata(node) || isProducerMetadata(node) || isProducerMetadataVersionedName(node) || isLoopInstruction(node) || isInstr(node) || isIfInstruction(node) || isStringLiteral(node) || isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node) || isElem(node) || isIndexInFuncSection(node) || isValtypeLiteral(node) || isTypeInstruction(node) || isStart(node) || isGlobalType(node) || isLeadingComment(node) || isBlockComment(node) || isData(node) || isGlobal(node) || isTable(node) || isMemory(node) || isFuncImportDescr(node) || isModuleImport(node) || isModuleExportDescr(node) || isModuleExport(node) || isLimit(node) || isSignature(node) || isProgram(node) || isIdentifier(node) || isBlockInstruction(node) || isCallInstruction(node) || isCallIndirectInstruction(node) || isByteArray(node) || isFunc(node) || isInternalBrUnless(node) || isInternalGoto(node) || isInternalCallExtern(node) || isInternalEndAndReturn(node);
+};
+export var isBlock = function isBlock(node) {
+  return isLoopInstruction(node) || isBlockInstruction(node) || isFunc(node);
+};
+export var isInstruction = function isInstruction(node) {
+  return isLoopInstruction(node) || isInstr(node) || isIfInstruction(node) || isTypeInstruction(node) || isBlockInstruction(node) || isCallInstruction(node) || isCallIndirectInstruction(node);
+};
+export var isExpression = function isExpression(node) {
+  return isInstr(node) || isStringLiteral(node) || isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node) || isValtypeLiteral(node) || isIdentifier(node);
+};
+export var isNumericLiteral = function isNumericLiteral(node) {
+  return isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node);
+};
+export var isImportDescr = function isImportDescr(node) {
+  return isGlobalType(node) || isTable(node) || isMemory(node) || isFuncImportDescr(node);
+};
+export var isIntrinsic = function isIntrinsic(node) {
+  return isInternalBrUnless(node) || isInternalGoto(node) || isInternalCallExtern(node) || isInternalEndAndReturn(node);
+};
+export var assertModule = assertTypeOf("Module");
+export var assertModuleMetadata = assertTypeOf("ModuleMetadata");
+export var assertModuleNameMetadata = assertTypeOf("ModuleNameMetadata");
+export var assertFunctionNameMetadata = assertTypeOf("FunctionNameMetadata");
+export var assertLocalNameMetadata = assertTypeOf("LocalNameMetadata");
+export var assertBinaryModule = assertTypeOf("BinaryModule");
+export var assertQuoteModule = assertTypeOf("QuoteModule");
+export var assertSectionMetadata = assertTypeOf("SectionMetadata");
+export var assertProducersSectionMetadata = assertTypeOf("ProducersSectionMetadata");
+export var assertProducerMetadata = assertTypeOf("ProducerMetadata");
+export var assertProducerMetadataVersionedName = assertTypeOf("ProducerMetadataVersionedName");
+export var assertLoopInstruction = assertTypeOf("LoopInstruction");
+export var assertInstr = assertTypeOf("Instr");
+export var assertIfInstruction = assertTypeOf("IfInstruction");
+export var assertStringLiteral = assertTypeOf("StringLiteral");
+export var assertNumberLiteral = assertTypeOf("NumberLiteral");
+export var assertLongNumberLiteral = assertTypeOf("LongNumberLiteral");
+export var assertFloatLiteral = assertTypeOf("FloatLiteral");
+export var assertElem = assertTypeOf("Elem");
+export var assertIndexInFuncSection = assertTypeOf("IndexInFuncSection");
+export var assertValtypeLiteral = assertTypeOf("ValtypeLiteral");
+export var assertTypeInstruction = assertTypeOf("TypeInstruction");
+export var assertStart = assertTypeOf("Start");
+export var assertGlobalType = assertTypeOf("GlobalType");
+export var assertLeadingComment = assertTypeOf("LeadingComment");
+export var assertBlockComment = assertTypeOf("BlockComment");
+export var assertData = assertTypeOf("Data");
+export var assertGlobal = assertTypeOf("Global");
+export var assertTable = assertTypeOf("Table");
+export var assertMemory = assertTypeOf("Memory");
+export var assertFuncImportDescr = assertTypeOf("FuncImportDescr");
+export var assertModuleImport = assertTypeOf("ModuleImport");
+export var assertModuleExportDescr = assertTypeOf("ModuleExportDescr");
+export var assertModuleExport = assertTypeOf("ModuleExport");
+export var assertLimit = assertTypeOf("Limit");
+export var assertSignature = assertTypeOf("Signature");
+export var assertProgram = assertTypeOf("Program");
+export var assertIdentifier = assertTypeOf("Identifier");
+export var assertBlockInstruction = assertTypeOf("BlockInstruction");
+export var assertCallInstruction = assertTypeOf("CallInstruction");
+export var assertCallIndirectInstruction = assertTypeOf("CallIndirectInstruction");
+export var assertByteArray = assertTypeOf("ByteArray");
+export var assertFunc = assertTypeOf("Func");
+export var assertInternalBrUnless = assertTypeOf("InternalBrUnless");
+export var assertInternalGoto = assertTypeOf("InternalGoto");
+export var assertInternalCallExtern = assertTypeOf("InternalCallExtern");
+export var assertInternalEndAndReturn = assertTypeOf("InternalEndAndReturn");
+export var unionTypesMap = {
+  Module: ["Node"],
+  ModuleMetadata: ["Node"],
+  ModuleNameMetadata: ["Node"],
+  FunctionNameMetadata: ["Node"],
+  LocalNameMetadata: ["Node"],
+  BinaryModule: ["Node"],
+  QuoteModule: ["Node"],
+  SectionMetadata: ["Node"],
+  ProducersSectionMetadata: ["Node"],
+  ProducerMetadata: ["Node"],
+  ProducerMetadataVersionedName: ["Node"],
+  LoopInstruction: ["Node", "Block", "Instruction"],
+  Instr: ["Node", "Expression", "Instruction"],
+  IfInstruction: ["Node", "Instruction"],
+  StringLiteral: ["Node", "Expression"],
+  NumberLiteral: ["Node", "NumericLiteral", "Expression"],
+  LongNumberLiteral: ["Node", "NumericLiteral", "Expression"],
+  FloatLiteral: ["Node", "NumericLiteral", "Expression"],
+  Elem: ["Node"],
+  IndexInFuncSection: ["Node"],
+  ValtypeLiteral: ["Node", "Expression"],
+  TypeInstruction: ["Node", "Instruction"],
+  Start: ["Node"],
+  GlobalType: ["Node", "ImportDescr"],
+  LeadingComment: ["Node"],
+  BlockComment: ["Node"],
+  Data: ["Node"],
+  Global: ["Node"],
+  Table: ["Node", "ImportDescr"],
+  Memory: ["Node", "ImportDescr"],
+  FuncImportDescr: ["Node", "ImportDescr"],
+  ModuleImport: ["Node"],
+  ModuleExportDescr: ["Node"],
+  ModuleExport: ["Node"],
+  Limit: ["Node"],
+  Signature: ["Node"],
+  Program: ["Node"],
+  Identifier: ["Node", "Expression"],
+  BlockInstruction: ["Node", "Block", "Instruction"],
+  CallInstruction: ["Node", "Instruction"],
+  CallIndirectInstruction: ["Node", "Instruction"],
+  ByteArray: ["Node"],
+  Func: ["Node", "Block"],
+  InternalBrUnless: ["Node", "Intrinsic"],
+  InternalGoto: ["Node", "Intrinsic"],
+  InternalCallExtern: ["Node", "Intrinsic"],
+  InternalEndAndReturn: ["Node", "Intrinsic"]
+};
+export var nodeAndUnionTypes = ["Module", "ModuleMetadata", "ModuleNameMetadata", "FunctionNameMetadata", "LocalNameMetadata", "BinaryModule", "QuoteModule", "SectionMetadata", "ProducersSectionMetadata", "ProducerMetadata", "ProducerMetadataVersionedName", "LoopInstruction", "Instr", "IfInstruction", "StringLiteral", "NumberLiteral", "LongNumberLiteral", "FloatLiteral", "Elem", "IndexInFuncSection", "ValtypeLiteral", "TypeInstruction", "Start", "GlobalType", "LeadingComment", "BlockComment", "Data", "Global", "Table", "Memory", "FuncImportDescr", "ModuleImport", "ModuleExportDescr", "ModuleExport", "Limit", "Signature", "Program", "Identifier", "BlockInstruction", "CallInstruction", "CallIndirectInstruction", "ByteArray", "Func", "InternalBrUnless", "InternalGoto", "InternalCallExtern", "InternalEndAndReturn", "Node", "Block", "Instruction", "Expression", "NumericLiteral", "ImportDescr", "Intrinsic"];
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/signatures.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/signatures.js
new file mode 100644
index 0000000..2f2750b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/signatures.js
@@ -0,0 +1,199 @@
+function sign(input, output) {
+  return [input, output];
+}
+
+var u32 = "u32";
+var i32 = "i32";
+var i64 = "i64";
+var f32 = "f32";
+var f64 = "f64";
+
+var vector = function vector(t) {
+  var vecType = [t]; // $FlowIgnore
+
+  vecType.vector = true;
+  return vecType;
+};
+
+var controlInstructions = {
+  unreachable: sign([], []),
+  nop: sign([], []),
+  // block ?
+  // loop ?
+  // if ?
+  // if else ?
+  br: sign([u32], []),
+  br_if: sign([u32], []),
+  br_table: sign(vector(u32), []),
+  return: sign([], []),
+  call: sign([u32], []),
+  call_indirect: sign([u32], [])
+};
+var parametricInstructions = {
+  drop: sign([], []),
+  select: sign([], [])
+};
+var variableInstructions = {
+  get_local: sign([u32], []),
+  set_local: sign([u32], []),
+  tee_local: sign([u32], []),
+  get_global: sign([u32], []),
+  set_global: sign([u32], [])
+};
+var memoryInstructions = {
+  "i32.load": sign([u32, u32], [i32]),
+  "i64.load": sign([u32, u32], []),
+  "f32.load": sign([u32, u32], []),
+  "f64.load": sign([u32, u32], []),
+  "i32.load8_s": sign([u32, u32], [i32]),
+  "i32.load8_u": sign([u32, u32], [i32]),
+  "i32.load16_s": sign([u32, u32], [i32]),
+  "i32.load16_u": sign([u32, u32], [i32]),
+  "i64.load8_s": sign([u32, u32], [i64]),
+  "i64.load8_u": sign([u32, u32], [i64]),
+  "i64.load16_s": sign([u32, u32], [i64]),
+  "i64.load16_u": sign([u32, u32], [i64]),
+  "i64.load32_s": sign([u32, u32], [i64]),
+  "i64.load32_u": sign([u32, u32], [i64]),
+  "i32.store": sign([u32, u32], []),
+  "i64.store": sign([u32, u32], []),
+  "f32.store": sign([u32, u32], []),
+  "f64.store": sign([u32, u32], []),
+  "i32.store8": sign([u32, u32], []),
+  "i32.store16": sign([u32, u32], []),
+  "i64.store8": sign([u32, u32], []),
+  "i64.store16": sign([u32, u32], []),
+  "i64.store32": sign([u32, u32], []),
+  current_memory: sign([], []),
+  grow_memory: sign([], [])
+};
+var numericInstructions = {
+  "i32.const": sign([i32], [i32]),
+  "i64.const": sign([i64], [i64]),
+  "f32.const": sign([f32], [f32]),
+  "f64.const": sign([f64], [f64]),
+  "i32.eqz": sign([i32], [i32]),
+  "i32.eq": sign([i32, i32], [i32]),
+  "i32.ne": sign([i32, i32], [i32]),
+  "i32.lt_s": sign([i32, i32], [i32]),
+  "i32.lt_u": sign([i32, i32], [i32]),
+  "i32.gt_s": sign([i32, i32], [i32]),
+  "i32.gt_u": sign([i32, i32], [i32]),
+  "i32.le_s": sign([i32, i32], [i32]),
+  "i32.le_u": sign([i32, i32], [i32]),
+  "i32.ge_s": sign([i32, i32], [i32]),
+  "i32.ge_u": sign([i32, i32], [i32]),
+  "i64.eqz": sign([i64], [i64]),
+  "i64.eq": sign([i64, i64], [i32]),
+  "i64.ne": sign([i64, i64], [i32]),
+  "i64.lt_s": sign([i64, i64], [i32]),
+  "i64.lt_u": sign([i64, i64], [i32]),
+  "i64.gt_s": sign([i64, i64], [i32]),
+  "i64.gt_u": sign([i64, i64], [i32]),
+  "i64.le_s": sign([i64, i64], [i32]),
+  "i64.le_u": sign([i64, i64], [i32]),
+  "i64.ge_s": sign([i64, i64], [i32]),
+  "i64.ge_u": sign([i64, i64], [i32]),
+  "f32.eq": sign([f32, f32], [i32]),
+  "f32.ne": sign([f32, f32], [i32]),
+  "f32.lt": sign([f32, f32], [i32]),
+  "f32.gt": sign([f32, f32], [i32]),
+  "f32.le": sign([f32, f32], [i32]),
+  "f32.ge": sign([f32, f32], [i32]),
+  "f64.eq": sign([f64, f64], [i32]),
+  "f64.ne": sign([f64, f64], [i32]),
+  "f64.lt": sign([f64, f64], [i32]),
+  "f64.gt": sign([f64, f64], [i32]),
+  "f64.le": sign([f64, f64], [i32]),
+  "f64.ge": sign([f64, f64], [i32]),
+  "i32.clz": sign([i32], [i32]),
+  "i32.ctz": sign([i32], [i32]),
+  "i32.popcnt": sign([i32], [i32]),
+  "i32.add": sign([i32, i32], [i32]),
+  "i32.sub": sign([i32, i32], [i32]),
+  "i32.mul": sign([i32, i32], [i32]),
+  "i32.div_s": sign([i32, i32], [i32]),
+  "i32.div_u": sign([i32, i32], [i32]),
+  "i32.rem_s": sign([i32, i32], [i32]),
+  "i32.rem_u": sign([i32, i32], [i32]),
+  "i32.and": sign([i32, i32], [i32]),
+  "i32.or": sign([i32, i32], [i32]),
+  "i32.xor": sign([i32, i32], [i32]),
+  "i32.shl": sign([i32, i32], [i32]),
+  "i32.shr_s": sign([i32, i32], [i32]),
+  "i32.shr_u": sign([i32, i32], [i32]),
+  "i32.rotl": sign([i32, i32], [i32]),
+  "i32.rotr": sign([i32, i32], [i32]),
+  "i64.clz": sign([i64], [i64]),
+  "i64.ctz": sign([i64], [i64]),
+  "i64.popcnt": sign([i64], [i64]),
+  "i64.add": sign([i64, i64], [i64]),
+  "i64.sub": sign([i64, i64], [i64]),
+  "i64.mul": sign([i64, i64], [i64]),
+  "i64.div_s": sign([i64, i64], [i64]),
+  "i64.div_u": sign([i64, i64], [i64]),
+  "i64.rem_s": sign([i64, i64], [i64]),
+  "i64.rem_u": sign([i64, i64], [i64]),
+  "i64.and": sign([i64, i64], [i64]),
+  "i64.or": sign([i64, i64], [i64]),
+  "i64.xor": sign([i64, i64], [i64]),
+  "i64.shl": sign([i64, i64], [i64]),
+  "i64.shr_s": sign([i64, i64], [i64]),
+  "i64.shr_u": sign([i64, i64], [i64]),
+  "i64.rotl": sign([i64, i64], [i64]),
+  "i64.rotr": sign([i64, i64], [i64]),
+  "f32.abs": sign([f32], [f32]),
+  "f32.neg": sign([f32], [f32]),
+  "f32.ceil": sign([f32], [f32]),
+  "f32.floor": sign([f32], [f32]),
+  "f32.trunc": sign([f32], [f32]),
+  "f32.nearest": sign([f32], [f32]),
+  "f32.sqrt": sign([f32], [f32]),
+  "f32.add": sign([f32, f32], [f32]),
+  "f32.sub": sign([f32, f32], [f32]),
+  "f32.mul": sign([f32, f32], [f32]),
+  "f32.div": sign([f32, f32], [f32]),
+  "f32.min": sign([f32, f32], [f32]),
+  "f32.max": sign([f32, f32], [f32]),
+  "f32.copysign": sign([f32, f32], [f32]),
+  "f64.abs": sign([f64], [f64]),
+  "f64.neg": sign([f64], [f64]),
+  "f64.ceil": sign([f64], [f64]),
+  "f64.floor": sign([f64], [f64]),
+  "f64.trunc": sign([f64], [f64]),
+  "f64.nearest": sign([f64], [f64]),
+  "f64.sqrt": sign([f64], [f64]),
+  "f64.add": sign([f64, f64], [f64]),
+  "f64.sub": sign([f64, f64], [f64]),
+  "f64.mul": sign([f64, f64], [f64]),
+  "f64.div": sign([f64, f64], [f64]),
+  "f64.min": sign([f64, f64], [f64]),
+  "f64.max": sign([f64, f64], [f64]),
+  "f64.copysign": sign([f64, f64], [f64]),
+  "i32.wrap/i64": sign([i64], [i32]),
+  "i32.trunc_s/f32": sign([f32], [i32]),
+  "i32.trunc_u/f32": sign([f32], [i32]),
+  "i32.trunc_s/f64": sign([f32], [i32]),
+  "i32.trunc_u/f64": sign([f64], [i32]),
+  "i64.extend_s/i32": sign([i32], [i64]),
+  "i64.extend_u/i32": sign([i32], [i64]),
+  "i64.trunc_s/f32": sign([f32], [i64]),
+  "i64.trunc_u/f32": sign([f32], [i64]),
+  "i64.trunc_s/f64": sign([f64], [i64]),
+  "i64.trunc_u/f64": sign([f64], [i64]),
+  "f32.convert_s/i32": sign([i32], [f32]),
+  "f32.convert_u/i32": sign([i32], [f32]),
+  "f32.convert_s/i64": sign([i64], [f32]),
+  "f32.convert_u/i64": sign([i64], [f32]),
+  "f32.demote/f64": sign([f64], [f32]),
+  "f64.convert_s/i32": sign([i32], [f64]),
+  "f64.convert_u/i32": sign([i32], [f64]),
+  "f64.convert_s/i64": sign([i64], [f64]),
+  "f64.convert_u/i64": sign([i64], [f64]),
+  "f64.promote/f32": sign([f32], [f64]),
+  "i32.reinterpret/f32": sign([f32], [i32]),
+  "i64.reinterpret/f64": sign([f64], [i64]),
+  "f32.reinterpret/i32": sign([i32], [f32]),
+  "f64.reinterpret/i64": sign([i64], [f64])
+};
+export var signatures = Object.assign({}, controlInstructions, parametricInstructions, variableInstructions, memoryInstructions, numericInstructions);
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/ast-module-to-module-context/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/ast-module-to-module-context/index.js
new file mode 100644
index 0000000..8501df6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/ast-module-to-module-context/index.js
@@ -0,0 +1,378 @@
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }
+
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }
+
+// TODO(sven): add flow in here
+import { isSignature, isNumberLiteral } from "../../nodes.js";
+export function moduleContextFromModuleAST(m) {
+  var moduleContext = new ModuleContext();
+
+  if (!(m.type === "Module")) {
+    throw new Error('m.type === "Module"' + " error: " + (undefined || "unknown"));
+  }
+
+  m.fields.forEach(function (field) {
+    switch (field.type) {
+      case "Start":
+        {
+          moduleContext.setStart(field.index);
+          break;
+        }
+
+      case "TypeInstruction":
+        {
+          moduleContext.addType(field);
+          break;
+        }
+
+      case "Func":
+        {
+          moduleContext.addFunction(field);
+          break;
+        }
+
+      case "Global":
+        {
+          moduleContext.defineGlobal(field);
+          break;
+        }
+
+      case "ModuleImport":
+        {
+          switch (field.descr.type) {
+            case "GlobalType":
+              {
+                moduleContext.importGlobal(field.descr.valtype, field.descr.mutability);
+                break;
+              }
+
+            case "Memory":
+              {
+                moduleContext.addMemory(field.descr.limits.min, field.descr.limits.max);
+                break;
+              }
+
+            case "FuncImportDescr":
+              {
+                moduleContext.importFunction(field.descr);
+                break;
+              }
+
+            case "Table":
+              {
+                // FIXME(sven): not implemented yet
+                break;
+              }
+
+            default:
+              throw new Error("Unsupported ModuleImport of type " + JSON.stringify(field.descr.type));
+          }
+
+          break;
+        }
+
+      case "Memory":
+        {
+          moduleContext.addMemory(field.limits.min, field.limits.max);
+          break;
+        }
+    }
+  });
+  return moduleContext;
+}
+/**
+ * Module context for type checking
+ */
+
+export var ModuleContext =
+/*#__PURE__*/
+function () {
+  function ModuleContext() {
+    _classCallCheck(this, ModuleContext);
+
+    this.funcs = [];
+    this.funcsOffsetByIdentifier = [];
+    this.types = [];
+    this.globals = [];
+    this.globalsOffsetByIdentifier = [];
+    this.mems = []; // Current stack frame
+
+    this.locals = [];
+    this.labels = [];
+    this.return = [];
+    this.debugName = "unknown";
+    this.start = null;
+  }
+  /**
+   * Set start segment
+   */
+
+
+  _createClass(ModuleContext, [{
+    key: "setStart",
+    value: function setStart(index) {
+      this.start = index.value;
+    }
+    /**
+     * Get start function
+     */
+
+  }, {
+    key: "getStart",
+    value: function getStart() {
+      return this.start;
+    }
+    /**
+     * Reset the active stack frame
+     */
+
+  }, {
+    key: "newContext",
+    value: function newContext(debugName, expectedResult) {
+      this.locals = [];
+      this.labels = [expectedResult];
+      this.return = expectedResult;
+      this.debugName = debugName;
+    }
+    /**
+     * Functions
+     */
+
+  }, {
+    key: "addFunction",
+    value: function addFunction(func
+    /*: Func*/
+    ) {
+      // eslint-disable-next-line prefer-const
+      var _ref = func.signature || {},
+          _ref$params = _ref.params,
+          args = _ref$params === void 0 ? [] : _ref$params,
+          _ref$results = _ref.results,
+          result = _ref$results === void 0 ? [] : _ref$results;
+
+      args = args.map(function (arg) {
+        return arg.valtype;
+      });
+      this.funcs.push({
+        args: args,
+        result: result
+      });
+
+      if (typeof func.name !== "undefined") {
+        this.funcsOffsetByIdentifier[func.name.value] = this.funcs.length - 1;
+      }
+    }
+  }, {
+    key: "importFunction",
+    value: function importFunction(funcimport) {
+      if (isSignature(funcimport.signature)) {
+        // eslint-disable-next-line prefer-const
+        var _funcimport$signature = funcimport.signature,
+            args = _funcimport$signature.params,
+            result = _funcimport$signature.results;
+        args = args.map(function (arg) {
+          return arg.valtype;
+        });
+        this.funcs.push({
+          args: args,
+          result: result
+        });
+      } else {
+        if (!isNumberLiteral(funcimport.signature)) {
+          throw new Error('isNumberLiteral(funcimport.signature)' + " error: " + (undefined || "unknown"));
+        }
+
+        var typeId = funcimport.signature.value;
+
+        if (!this.hasType(typeId)) {
+          throw new Error('this.hasType(typeId)' + " error: " + (undefined || "unknown"));
+        }
+
+        var signature = this.getType(typeId);
+        this.funcs.push({
+          args: signature.params.map(function (arg) {
+            return arg.valtype;
+          }),
+          result: signature.results
+        });
+      }
+
+      if (typeof funcimport.id !== "undefined") {
+        // imports are first, we can assume their index in the array
+        this.funcsOffsetByIdentifier[funcimport.id.value] = this.funcs.length - 1;
+      }
+    }
+  }, {
+    key: "hasFunction",
+    value: function hasFunction(index) {
+      return typeof this.getFunction(index) !== "undefined";
+    }
+  }, {
+    key: "getFunction",
+    value: function getFunction(index) {
+      if (typeof index !== "number") {
+        throw new Error("getFunction only supported for number index");
+      }
+
+      return this.funcs[index];
+    }
+  }, {
+    key: "getFunctionOffsetByIdentifier",
+    value: function getFunctionOffsetByIdentifier(name) {
+      if (!(typeof name === "string")) {
+        throw new Error('typeof name === "string"' + " error: " + (undefined || "unknown"));
+      }
+
+      return this.funcsOffsetByIdentifier[name];
+    }
+    /**
+     * Labels
+     */
+
+  }, {
+    key: "addLabel",
+    value: function addLabel(result) {
+      this.labels.unshift(result);
+    }
+  }, {
+    key: "hasLabel",
+    value: function hasLabel(index) {
+      return this.labels.length > index && index >= 0;
+    }
+  }, {
+    key: "getLabel",
+    value: function getLabel(index) {
+      return this.labels[index];
+    }
+  }, {
+    key: "popLabel",
+    value: function popLabel() {
+      this.labels.shift();
+    }
+    /**
+     * Locals
+     */
+
+  }, {
+    key: "hasLocal",
+    value: function hasLocal(index) {
+      return typeof this.getLocal(index) !== "undefined";
+    }
+  }, {
+    key: "getLocal",
+    value: function getLocal(index) {
+      return this.locals[index];
+    }
+  }, {
+    key: "addLocal",
+    value: function addLocal(type) {
+      this.locals.push(type);
+    }
+    /**
+     * Types
+     */
+
+  }, {
+    key: "addType",
+    value: function addType(type) {
+      if (!(type.functype.type === "Signature")) {
+        throw new Error('type.functype.type === "Signature"' + " error: " + (undefined || "unknown"));
+      }
+
+      this.types.push(type.functype);
+    }
+  }, {
+    key: "hasType",
+    value: function hasType(index) {
+      return this.types[index] !== undefined;
+    }
+  }, {
+    key: "getType",
+    value: function getType(index) {
+      return this.types[index];
+    }
+    /**
+     * Globals
+     */
+
+  }, {
+    key: "hasGlobal",
+    value: function hasGlobal(index) {
+      return this.globals.length > index && index >= 0;
+    }
+  }, {
+    key: "getGlobal",
+    value: function getGlobal(index) {
+      return this.globals[index].type;
+    }
+  }, {
+    key: "getGlobalOffsetByIdentifier",
+    value: function getGlobalOffsetByIdentifier(name) {
+      if (!(typeof name === "string")) {
+        throw new Error('typeof name === "string"' + " error: " + (undefined || "unknown"));
+      }
+
+      return this.globalsOffsetByIdentifier[name];
+    }
+  }, {
+    key: "defineGlobal",
+    value: function defineGlobal(global
+    /*: Global*/
+    ) {
+      var type = global.globalType.valtype;
+      var mutability = global.globalType.mutability;
+      this.globals.push({
+        type: type,
+        mutability: mutability
+      });
+
+      if (typeof global.name !== "undefined") {
+        this.globalsOffsetByIdentifier[global.name.value] = this.globals.length - 1;
+      }
+    }
+  }, {
+    key: "importGlobal",
+    value: function importGlobal(type, mutability) {
+      this.globals.push({
+        type: type,
+        mutability: mutability
+      });
+    }
+  }, {
+    key: "isMutableGlobal",
+    value: function isMutableGlobal(index) {
+      return this.globals[index].mutability === "var";
+    }
+  }, {
+    key: "isImmutableGlobal",
+    value: function isImmutableGlobal(index) {
+      return this.globals[index].mutability === "const";
+    }
+    /**
+     * Memories
+     */
+
+  }, {
+    key: "hasMemory",
+    value: function hasMemory(index) {
+      return this.mems.length > index && index >= 0;
+    }
+  }, {
+    key: "addMemory",
+    value: function addMemory(min, max) {
+      this.mems.push({
+        min: min,
+        max: max
+      });
+    }
+  }, {
+    key: "getMemory",
+    value: function getMemory(index) {
+      return this.mems[index];
+    }
+  }]);
+
+  return ModuleContext;
+}();
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/denormalize-type-references/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/denormalize-type-references/index.js
new file mode 100644
index 0000000..26891f9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/denormalize-type-references/index.js
@@ -0,0 +1,76 @@
+var t = require("../../index"); // func and call_indirect instructions can either define a signature inline, or
+// reference a signature, e.g.
+//
+// ;; inline signature
+// (func (result i64)
+//   (i64.const 2)
+// )
+// ;; signature reference
+// (type (func (result i64)))
+// (func (type 0)
+//   (i64.const 2))
+// )
+//
+// this AST transform denormalises the type references, making all signatures within the module
+// inline.
+
+
+export function transform(ast) {
+  var typeInstructions = [];
+  t.traverse(ast, {
+    TypeInstruction: function TypeInstruction(_ref) {
+      var node = _ref.node;
+      typeInstructions.push(node);
+    }
+  });
+
+  if (!typeInstructions.length) {
+    return;
+  }
+
+  function denormalizeSignature(signature) {
+    // signature referenced by identifier
+    if (signature.type === "Identifier") {
+      var identifier = signature;
+      var typeInstruction = typeInstructions.find(function (t) {
+        return t.id.type === identifier.type && t.id.value === identifier.value;
+      });
+
+      if (!typeInstruction) {
+        throw new Error("A type instruction reference was not found ".concat(JSON.stringify(signature)));
+      }
+
+      return typeInstruction.functype;
+    } // signature referenced by index
+
+
+    if (signature.type === "NumberLiteral") {
+      var signatureRef = signature;
+      var _typeInstruction = typeInstructions[signatureRef.value];
+      return _typeInstruction.functype;
+    }
+
+    return signature;
+  }
+
+  t.traverse(ast, {
+    Func: function (_Func) {
+      function Func(_x) {
+        return _Func.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func.toString();
+      };
+
+      return Func;
+    }(function (_ref2) {
+      var node = _ref2.node;
+      node.signature = denormalizeSignature(node.signature);
+    }),
+    CallIndirectInstruction: function CallIndirectInstruction(_ref3) {
+      var node = _ref3.node;
+      node.signature = denormalizeSignature(node.signature);
+    }
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/wast-identifier-to-index/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/wast-identifier-to-index/index.js
new file mode 100644
index 0000000..e4b2ec5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/transform/wast-identifier-to-index/index.js
@@ -0,0 +1,216 @@
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+import { isBlock, isFunc, isIdentifier, numberLiteralFromRaw, traverse } from "../../index";
+import { moduleContextFromModuleAST } from "../ast-module-to-module-context"; // FIXME(sven): do the same with all block instructions, must be more generic here
+
+function newUnexpectedFunction(i) {
+  return new Error("unknown function at offset: " + i);
+}
+
+export function transform(ast) {
+  var module;
+  traverse(ast, {
+    Module: function (_Module) {
+      function Module(_x) {
+        return _Module.apply(this, arguments);
+      }
+
+      Module.toString = function () {
+        return _Module.toString();
+      };
+
+      return Module;
+    }(function (path) {
+      module = path.node;
+    })
+  });
+  var moduleContext = moduleContextFromModuleAST(module); // Transform the actual instruction in function bodies
+
+  traverse(ast, {
+    Func: function (_Func) {
+      function Func(_x2) {
+        return _Func.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func.toString();
+      };
+
+      return Func;
+    }(function (path) {
+      transformFuncPath(path, moduleContext);
+    }),
+    Start: function (_Start) {
+      function Start(_x3) {
+        return _Start.apply(this, arguments);
+      }
+
+      Start.toString = function () {
+        return _Start.toString();
+      };
+
+      return Start;
+    }(function (path) {
+      var index = path.node.index;
+
+      if (isIdentifier(index) === true) {
+        var offsetInModule = moduleContext.getFunctionOffsetByIdentifier(index.value);
+
+        if (typeof offsetInModule === "undefined") {
+          throw newUnexpectedFunction(index.value);
+        } // Replace the index Identifier
+        // $FlowIgnore: reference?
+
+
+        path.node.index = numberLiteralFromRaw(offsetInModule);
+      }
+    })
+  });
+}
+
+function transformFuncPath(funcPath, moduleContext) {
+  var funcNode = funcPath.node;
+  var signature = funcNode.signature;
+
+  if (signature.type !== "Signature") {
+    throw new Error("Function signatures must be denormalised before execution");
+  }
+
+  var params = signature.params; // Add func locals in the context
+
+  params.forEach(function (p) {
+    return moduleContext.addLocal(p.valtype);
+  });
+  traverse(funcNode, {
+    Instr: function (_Instr) {
+      function Instr(_x4) {
+        return _Instr.apply(this, arguments);
+      }
+
+      Instr.toString = function () {
+        return _Instr.toString();
+      };
+
+      return Instr;
+    }(function (instrPath) {
+      var instrNode = instrPath.node;
+      /**
+       * Local access
+       */
+
+      if (instrNode.id === "get_local" || instrNode.id === "set_local" || instrNode.id === "tee_local") {
+        var _instrNode$args = _slicedToArray(instrNode.args, 1),
+            firstArg = _instrNode$args[0];
+
+        if (firstArg.type === "Identifier") {
+          var offsetInParams = params.findIndex(function (_ref) {
+            var id = _ref.id;
+            return id === firstArg.value;
+          });
+
+          if (offsetInParams === -1) {
+            throw new Error("".concat(firstArg.value, " not found in ").concat(instrNode.id, ": not declared in func params"));
+          } // Replace the Identifer node by our new NumberLiteral node
+
+
+          instrNode.args[0] = numberLiteralFromRaw(offsetInParams);
+        }
+      }
+      /**
+       * Global access
+       */
+
+
+      if (instrNode.id === "get_global" || instrNode.id === "set_global") {
+        var _instrNode$args2 = _slicedToArray(instrNode.args, 1),
+            _firstArg = _instrNode$args2[0];
+
+        if (isIdentifier(_firstArg) === true) {
+          var globalOffset = moduleContext.getGlobalOffsetByIdentifier( // $FlowIgnore: reference?
+          _firstArg.value);
+
+          if (typeof globalOffset === "undefined") {
+            // $FlowIgnore: reference?
+            throw new Error("global ".concat(_firstArg.value, " not found in module"));
+          } // Replace the Identifer node by our new NumberLiteral node
+
+
+          instrNode.args[0] = numberLiteralFromRaw(globalOffset);
+        }
+      }
+      /**
+       * Labels lookup
+       */
+
+
+      if (instrNode.id === "br") {
+        var _instrNode$args3 = _slicedToArray(instrNode.args, 1),
+            _firstArg2 = _instrNode$args3[0];
+
+        if (isIdentifier(_firstArg2) === true) {
+          // if the labels is not found it is going to be replaced with -1
+          // which is invalid.
+          var relativeBlockCount = -1; // $FlowIgnore: reference?
+
+          instrPath.findParent(function (_ref2) {
+            var node = _ref2.node;
+
+            if (isBlock(node)) {
+              relativeBlockCount++; // $FlowIgnore: reference?
+
+              var name = node.label || node.name;
+
+              if (_typeof(name) === "object") {
+                // $FlowIgnore: isIdentifier ensures that
+                if (name.value === _firstArg2.value) {
+                  // Found it
+                  return false;
+                }
+              }
+            }
+
+            if (isFunc(node)) {
+              return false;
+            }
+          }); // Replace the Identifer node by our new NumberLiteral node
+
+          instrNode.args[0] = numberLiteralFromRaw(relativeBlockCount);
+        }
+      }
+    }),
+
+    /**
+     * Func lookup
+     */
+    CallInstruction: function (_CallInstruction) {
+      function CallInstruction(_x5) {
+        return _CallInstruction.apply(this, arguments);
+      }
+
+      CallInstruction.toString = function () {
+        return _CallInstruction.toString();
+      };
+
+      return CallInstruction;
+    }(function (_ref3) {
+      var node = _ref3.node;
+      var index = node.index;
+
+      if (isIdentifier(index) === true) {
+        var offsetInModule = moduleContext.getFunctionOffsetByIdentifier(index.value);
+
+        if (typeof offsetInModule === "undefined") {
+          throw newUnexpectedFunction(index.value);
+        } // Replace the index Identifier
+        // $FlowIgnore: reference?
+
+
+        node.index = numberLiteralFromRaw(offsetInModule);
+      }
+    })
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/traverse.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/traverse.js
new file mode 100644
index 0000000..328dc09
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/traverse.js
@@ -0,0 +1,96 @@
+import { createPath } from "./node-path";
+import { unionTypesMap, nodeAndUnionTypes } from "./nodes"; // recursively walks the AST starting at the given node. The callback is invoked for
+// and object that has a 'type' property.
+
+function walk(context, callback) {
+  var stop = false;
+
+  function innerWalk(context, callback) {
+    if (stop) {
+      return;
+    }
+
+    var node = context.node;
+
+    if (node === undefined) {
+      console.warn("traversing with an empty context");
+      return;
+    }
+
+    if (node._deleted === true) {
+      return;
+    }
+
+    var path = createPath(context);
+    callback(node.type, path);
+
+    if (path.shouldStop) {
+      stop = true;
+      return;
+    }
+
+    Object.keys(node).forEach(function (prop) {
+      var value = node[prop];
+
+      if (value === null || value === undefined) {
+        return;
+      }
+
+      var valueAsArray = Array.isArray(value) ? value : [value];
+      valueAsArray.forEach(function (childNode) {
+        if (typeof childNode.type === "string") {
+          var childContext = {
+            node: childNode,
+            parentKey: prop,
+            parentPath: path,
+            shouldStop: false,
+            inList: Array.isArray(value)
+          };
+          innerWalk(childContext, callback);
+        }
+      });
+    });
+  }
+
+  innerWalk(context, callback);
+}
+
+var noop = function noop() {};
+
+export function traverse(node, visitors) {
+  var before = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : noop;
+  var after = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : noop;
+  Object.keys(visitors).forEach(function (visitor) {
+    if (!nodeAndUnionTypes.includes(visitor)) {
+      throw new Error("Unexpected visitor ".concat(visitor));
+    }
+  });
+  var context = {
+    node: node,
+    inList: false,
+    shouldStop: false,
+    parentPath: null,
+    parentKey: null
+  };
+  walk(context, function (type, path) {
+    if (typeof visitors[type] === "function") {
+      before(type, path);
+      visitors[type](path);
+      after(type, path);
+    }
+
+    var unionTypes = unionTypesMap[type];
+
+    if (!unionTypes) {
+      throw new Error("Unexpected node type ".concat(type));
+    }
+
+    unionTypes.forEach(function (unionType) {
+      if (typeof visitors[unionType] === "function") {
+        before(unionType, path);
+        visitors[unionType](path);
+        after(unionType, path);
+      }
+    });
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/types/basic.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/types/basic.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/types/nodes.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/types/nodes.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/types/traverse.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/types/traverse.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/utils.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/utils.js
new file mode 100644
index 0000000..850410e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/esm/utils.js
@@ -0,0 +1,265 @@
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+import { signatures } from "./signatures";
+import { traverse } from "./traverse";
+import constants from "@webassemblyjs/helper-wasm-bytecode";
+import { getSectionForNode } from "@webassemblyjs/helper-wasm-bytecode";
+export function isAnonymous(ident) {
+  return ident.raw === "";
+}
+export function getSectionMetadata(ast, name) {
+  var section;
+  traverse(ast, {
+    SectionMetadata: function (_SectionMetadata) {
+      function SectionMetadata(_x) {
+        return _SectionMetadata.apply(this, arguments);
+      }
+
+      SectionMetadata.toString = function () {
+        return _SectionMetadata.toString();
+      };
+
+      return SectionMetadata;
+    }(function (_ref) {
+      var node = _ref.node;
+
+      if (node.section === name) {
+        section = node;
+      }
+    })
+  });
+  return section;
+}
+export function getSectionMetadatas(ast, name) {
+  var sections = [];
+  traverse(ast, {
+    SectionMetadata: function (_SectionMetadata2) {
+      function SectionMetadata(_x2) {
+        return _SectionMetadata2.apply(this, arguments);
+      }
+
+      SectionMetadata.toString = function () {
+        return _SectionMetadata2.toString();
+      };
+
+      return SectionMetadata;
+    }(function (_ref2) {
+      var node = _ref2.node;
+
+      if (node.section === name) {
+        sections.push(node);
+      }
+    })
+  });
+  return sections;
+}
+export function sortSectionMetadata(m) {
+  if (m.metadata == null) {
+    console.warn("sortSectionMetadata: no metadata to sort");
+    return;
+  } // $FlowIgnore
+
+
+  m.metadata.sections.sort(function (a, b) {
+    var aId = constants.sections[a.section];
+    var bId = constants.sections[b.section];
+
+    if (typeof aId !== "number" || typeof bId !== "number") {
+      throw new Error("Section id not found");
+    }
+
+    return aId - bId;
+  });
+}
+export function orderedInsertNode(m, n) {
+  assertHasLoc(n);
+  var didInsert = false;
+
+  if (n.type === "ModuleExport") {
+    m.fields.push(n);
+    return;
+  }
+
+  m.fields = m.fields.reduce(function (acc, field) {
+    var fieldEndCol = Infinity;
+
+    if (field.loc != null) {
+      // $FlowIgnore
+      fieldEndCol = field.loc.end.column;
+    } // $FlowIgnore: assertHasLoc ensures that
+
+
+    if (didInsert === false && n.loc.start.column < fieldEndCol) {
+      didInsert = true;
+      acc.push(n);
+    }
+
+    acc.push(field);
+    return acc;
+  }, []); // Handles empty modules or n is the last element
+
+  if (didInsert === false) {
+    m.fields.push(n);
+  }
+}
+export function assertHasLoc(n) {
+  if (n.loc == null || n.loc.start == null || n.loc.end == null) {
+    throw new Error("Internal failure: node (".concat(JSON.stringify(n.type), ") has no location information"));
+  }
+}
+export function getEndOfSection(s) {
+  assertHasLoc(s.size);
+  return s.startOffset + s.size.value + ( // $FlowIgnore
+  s.size.loc.end.column - s.size.loc.start.column);
+}
+export function shiftLoc(node, delta) {
+  // $FlowIgnore
+  node.loc.start.column += delta; // $FlowIgnore
+
+  node.loc.end.column += delta;
+}
+export function shiftSection(ast, node, delta) {
+  if (node.type !== "SectionMetadata") {
+    throw new Error("Can not shift node " + JSON.stringify(node.type));
+  }
+
+  node.startOffset += delta;
+
+  if (_typeof(node.size.loc) === "object") {
+    shiftLoc(node.size, delta);
+  } // Custom sections doesn't have vectorOfSize
+
+
+  if (_typeof(node.vectorOfSize) === "object" && _typeof(node.vectorOfSize.loc) === "object") {
+    shiftLoc(node.vectorOfSize, delta);
+  }
+
+  var sectionName = node.section; // shift node locations within that section
+
+  traverse(ast, {
+    Node: function Node(_ref3) {
+      var node = _ref3.node;
+      var section = getSectionForNode(node);
+
+      if (section === sectionName && _typeof(node.loc) === "object") {
+        shiftLoc(node, delta);
+      }
+    }
+  });
+}
+export function signatureForOpcode(object, name) {
+  var opcodeName = name;
+
+  if (object !== undefined && object !== "") {
+    opcodeName = object + "." + name;
+  }
+
+  var sign = signatures[opcodeName];
+
+  if (sign == undefined) {
+    // TODO: Uncomment this when br_table and others has been done
+    //throw new Error("Invalid opcode: "+opcodeName);
+    return [object, object];
+  }
+
+  return sign[0];
+}
+export function getUniqueNameGenerator() {
+  var inc = {};
+  return function () {
+    var prefix = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : "temp";
+
+    if (!(prefix in inc)) {
+      inc[prefix] = 0;
+    } else {
+      inc[prefix] = inc[prefix] + 1;
+    }
+
+    return prefix + "_" + inc[prefix];
+  };
+}
+export function getStartByteOffset(n) {
+  // $FlowIgnore
+  if (typeof n.loc === "undefined" || typeof n.loc.start === "undefined") {
+    throw new Error( // $FlowIgnore
+    "Can not get byte offset without loc informations, node: " + String(n.id));
+  }
+
+  return n.loc.start.column;
+}
+export function getEndByteOffset(n) {
+  // $FlowIgnore
+  if (typeof n.loc === "undefined" || typeof n.loc.end === "undefined") {
+    throw new Error("Can not get byte offset without loc informations, node: " + n.type);
+  }
+
+  return n.loc.end.column;
+}
+export function getFunctionBeginingByteOffset(n) {
+  if (!(n.body.length > 0)) {
+    throw new Error('n.body.length > 0' + " error: " + (undefined || "unknown"));
+  }
+
+  var _n$body = _slicedToArray(n.body, 1),
+      firstInstruction = _n$body[0];
+
+  return getStartByteOffset(firstInstruction);
+}
+export function getEndBlockByteOffset(n) {
+  // $FlowIgnore
+  if (!(n.instr.length > 0 || n.body.length > 0)) {
+    throw new Error('n.instr.length > 0 || n.body.length > 0' + " error: " + (undefined || "unknown"));
+  }
+
+  var lastInstruction;
+
+  if (n.instr) {
+    // $FlowIgnore
+    lastInstruction = n.instr[n.instr.length - 1];
+  }
+
+  if (n.body) {
+    // $FlowIgnore
+    lastInstruction = n.body[n.body.length - 1];
+  }
+
+  if (!(_typeof(lastInstruction) === "object")) {
+    throw new Error('typeof lastInstruction === "object"' + " error: " + (undefined || "unknown"));
+  }
+
+  // $FlowIgnore
+  return getStartByteOffset(lastInstruction);
+}
+export function getStartBlockByteOffset(n) {
+  // $FlowIgnore
+  if (!(n.instr.length > 0 || n.body.length > 0)) {
+    throw new Error('n.instr.length > 0 || n.body.length > 0' + " error: " + (undefined || "unknown"));
+  }
+
+  var fistInstruction;
+
+  if (n.instr) {
+    // $FlowIgnore
+    var _n$instr = _slicedToArray(n.instr, 1);
+
+    fistInstruction = _n$instr[0];
+  }
+
+  if (n.body) {
+    // $FlowIgnore
+    var _n$body2 = _slicedToArray(n.body, 1);
+
+    fistInstruction = _n$body2[0];
+  }
+
+  if (!(_typeof(fistInstruction) === "object")) {
+    throw new Error('typeof fistInstruction === "object"' + " error: " + (undefined || "unknown"));
+  }
+
+  // $FlowIgnore
+  return getStartByteOffset(fistInstruction);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/clone.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/clone.js
new file mode 100644
index 0000000..06fe876
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/clone.js
@@ -0,0 +1,10 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cloneNode = cloneNode;
+
+function cloneNode(n) {
+  return Object.assign({}, n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/definitions.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/definitions.js
new file mode 100644
index 0000000..c5053c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/definitions.js
@@ -0,0 +1,668 @@
+var definitions = {};
+
+function defineType(typeName, metadata) {
+  definitions[typeName] = metadata;
+}
+
+defineType("Module", {
+  spec: {
+    wasm: "https://webassembly.github.io/spec/core/binary/modules.html#binary-module",
+    wat: "https://webassembly.github.io/spec/core/text/modules.html#text-module"
+  },
+  doc: "A module consists of a sequence of sections (termed fields in the text format).",
+  unionType: ["Node"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "string"
+    },
+    fields: {
+      array: true,
+      type: "Node"
+    },
+    metadata: {
+      optional: true,
+      type: "ModuleMetadata"
+    }
+  }
+});
+defineType("ModuleMetadata", {
+  unionType: ["Node"],
+  fields: {
+    sections: {
+      array: true,
+      type: "SectionMetadata"
+    },
+    functionNames: {
+      optional: true,
+      array: true,
+      type: "FunctionNameMetadata"
+    },
+    localNames: {
+      optional: true,
+      array: true,
+      type: "ModuleMetadata"
+    },
+    producers: {
+      optional: true,
+      array: true,
+      type: "ProducersSectionMetadata"
+    }
+  }
+});
+defineType("ModuleNameMetadata", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("FunctionNameMetadata", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    },
+    index: {
+      type: "number"
+    }
+  }
+});
+defineType("LocalNameMetadata", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    },
+    localIndex: {
+      type: "number"
+    },
+    functionIndex: {
+      type: "number"
+    }
+  }
+});
+defineType("BinaryModule", {
+  unionType: ["Node"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "string"
+    },
+    blob: {
+      array: true,
+      type: "string"
+    }
+  }
+});
+defineType("QuoteModule", {
+  unionType: ["Node"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "string"
+    },
+    string: {
+      array: true,
+      type: "string"
+    }
+  }
+});
+defineType("SectionMetadata", {
+  unionType: ["Node"],
+  fields: {
+    section: {
+      type: "SectionName"
+    },
+    startOffset: {
+      type: "number"
+    },
+    size: {
+      type: "NumberLiteral"
+    },
+    vectorOfSize: {
+      comment: "Size of the vector in the section (if any)",
+      type: "NumberLiteral"
+    }
+  }
+});
+defineType("ProducersSectionMetadata", {
+  unionType: ["Node"],
+  fields: {
+    producers: {
+      array: true,
+      type: "ProducerMetadata"
+    }
+  }
+});
+defineType("ProducerMetadata", {
+  unionType: ["Node"],
+  fields: {
+    language: {
+      type: "ProducerMetadataVersionedName",
+      array: true
+    },
+    processedBy: {
+      type: "ProducerMetadataVersionedName",
+      array: true
+    },
+    sdk: {
+      type: "ProducerMetadataVersionedName",
+      array: true
+    }
+  }
+});
+defineType("ProducerMetadataVersionedName", {
+  unionType: ["Node"],
+  fields: {
+    name: {
+      type: "string"
+    },
+    version: {
+      type: "string"
+    }
+  }
+});
+/*
+Instructions
+*/
+
+defineType("LoopInstruction", {
+  unionType: ["Node", "Block", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "loop"
+    },
+    label: {
+      maybe: true,
+      type: "Identifier"
+    },
+    resulttype: {
+      maybe: true,
+      type: "Valtype"
+    },
+    instr: {
+      array: true,
+      type: "Instruction"
+    }
+  }
+});
+defineType("Instr", {
+  unionType: ["Node", "Expression", "Instruction"],
+  fields: {
+    id: {
+      type: "string"
+    },
+    object: {
+      optional: true,
+      type: "Valtype"
+    },
+    args: {
+      array: true,
+      type: "Expression"
+    },
+    namedArgs: {
+      optional: true,
+      type: "Object"
+    }
+  }
+});
+defineType("IfInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "if"
+    },
+    testLabel: {
+      comment: "only for WAST",
+      type: "Identifier"
+    },
+    test: {
+      array: true,
+      type: "Instruction"
+    },
+    result: {
+      maybe: true,
+      type: "Valtype"
+    },
+    consequent: {
+      array: true,
+      type: "Instruction"
+    },
+    alternate: {
+      array: true,
+      type: "Instruction"
+    }
+  }
+});
+/* 
+Concrete value types
+*/
+
+defineType("StringLiteral", {
+  unionType: ["Node", "Expression"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("NumberLiteral", {
+  unionType: ["Node", "NumericLiteral", "Expression"],
+  fields: {
+    value: {
+      type: "number"
+    },
+    raw: {
+      type: "string"
+    }
+  }
+});
+defineType("LongNumberLiteral", {
+  unionType: ["Node", "NumericLiteral", "Expression"],
+  fields: {
+    value: {
+      type: "LongNumber"
+    },
+    raw: {
+      type: "string"
+    }
+  }
+});
+defineType("FloatLiteral", {
+  unionType: ["Node", "NumericLiteral", "Expression"],
+  fields: {
+    value: {
+      type: "number"
+    },
+    nan: {
+      optional: true,
+      type: "boolean"
+    },
+    inf: {
+      optional: true,
+      type: "boolean"
+    },
+    raw: {
+      type: "string"
+    }
+  }
+});
+defineType("Elem", {
+  unionType: ["Node"],
+  fields: {
+    table: {
+      type: "Index"
+    },
+    offset: {
+      array: true,
+      type: "Instruction"
+    },
+    funcs: {
+      array: true,
+      type: "Index"
+    }
+  }
+});
+defineType("IndexInFuncSection", {
+  unionType: ["Node"],
+  fields: {
+    index: {
+      type: "Index"
+    }
+  }
+});
+defineType("ValtypeLiteral", {
+  unionType: ["Node", "Expression"],
+  fields: {
+    name: {
+      type: "Valtype"
+    }
+  }
+});
+defineType("TypeInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      maybe: true,
+      type: "Index"
+    },
+    functype: {
+      type: "Signature"
+    }
+  }
+});
+defineType("Start", {
+  unionType: ["Node"],
+  fields: {
+    index: {
+      type: "Index"
+    }
+  }
+});
+defineType("GlobalType", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    valtype: {
+      type: "Valtype"
+    },
+    mutability: {
+      type: "Mutability"
+    }
+  }
+});
+defineType("LeadingComment", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("BlockComment", {
+  unionType: ["Node"],
+  fields: {
+    value: {
+      type: "string"
+    }
+  }
+});
+defineType("Data", {
+  unionType: ["Node"],
+  fields: {
+    memoryIndex: {
+      type: "Memidx"
+    },
+    offset: {
+      type: "Instruction"
+    },
+    init: {
+      type: "ByteArray"
+    }
+  }
+});
+defineType("Global", {
+  unionType: ["Node"],
+  fields: {
+    globalType: {
+      type: "GlobalType"
+    },
+    init: {
+      array: true,
+      type: "Instruction"
+    },
+    name: {
+      maybe: true,
+      type: "Identifier"
+    }
+  }
+});
+defineType("Table", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    elementType: {
+      type: "TableElementType"
+    },
+    limits: {
+      assertNodeType: true,
+      type: "Limit"
+    },
+    name: {
+      maybe: true,
+      type: "Identifier"
+    },
+    elements: {
+      array: true,
+      optional: true,
+      type: "Index"
+    }
+  }
+});
+defineType("Memory", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    limits: {
+      type: "Limit"
+    },
+    id: {
+      maybe: true,
+      type: "Index"
+    }
+  }
+});
+defineType("FuncImportDescr", {
+  unionType: ["Node", "ImportDescr"],
+  fields: {
+    id: {
+      type: "Identifier"
+    },
+    signature: {
+      type: "Signature"
+    }
+  }
+});
+defineType("ModuleImport", {
+  unionType: ["Node"],
+  fields: {
+    module: {
+      type: "string"
+    },
+    name: {
+      type: "string"
+    },
+    descr: {
+      type: "ImportDescr"
+    }
+  }
+});
+defineType("ModuleExportDescr", {
+  unionType: ["Node"],
+  fields: {
+    exportType: {
+      type: "ExportDescrType"
+    },
+    id: {
+      type: "Index"
+    }
+  }
+});
+defineType("ModuleExport", {
+  unionType: ["Node"],
+  fields: {
+    name: {
+      type: "string"
+    },
+    descr: {
+      type: "ModuleExportDescr"
+    }
+  }
+});
+defineType("Limit", {
+  unionType: ["Node"],
+  fields: {
+    min: {
+      type: "number"
+    },
+    max: {
+      optional: true,
+      type: "number"
+    },
+    // Threads proposal, shared memory
+    shared: {
+      optional: true,
+      type: "boolean"
+    }
+  }
+});
+defineType("Signature", {
+  unionType: ["Node"],
+  fields: {
+    params: {
+      array: true,
+      type: "FuncParam"
+    },
+    results: {
+      array: true,
+      type: "Valtype"
+    }
+  }
+});
+defineType("Program", {
+  unionType: ["Node"],
+  fields: {
+    body: {
+      array: true,
+      type: "Node"
+    }
+  }
+});
+defineType("Identifier", {
+  unionType: ["Node", "Expression"],
+  fields: {
+    value: {
+      type: "string"
+    },
+    raw: {
+      optional: true,
+      type: "string"
+    }
+  }
+});
+defineType("BlockInstruction", {
+  unionType: ["Node", "Block", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "block"
+    },
+    label: {
+      maybe: true,
+      type: "Identifier"
+    },
+    instr: {
+      array: true,
+      type: "Instruction"
+    },
+    result: {
+      maybe: true,
+      type: "Valtype"
+    }
+  }
+});
+defineType("CallInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "call"
+    },
+    index: {
+      type: "Index"
+    },
+    instrArgs: {
+      array: true,
+      optional: true,
+      type: "Expression"
+    },
+    numeric: {
+      type: "Index",
+      optional: true
+    }
+  }
+});
+defineType("CallIndirectInstruction", {
+  unionType: ["Node", "Instruction"],
+  fields: {
+    id: {
+      constant: true,
+      type: "string",
+      value: "call_indirect"
+    },
+    signature: {
+      type: "SignatureOrTypeRef"
+    },
+    intrs: {
+      array: true,
+      optional: true,
+      type: "Expression"
+    }
+  }
+});
+defineType("ByteArray", {
+  unionType: ["Node"],
+  fields: {
+    values: {
+      array: true,
+      type: "Byte"
+    }
+  }
+});
+defineType("Func", {
+  unionType: ["Node", "Block"],
+  fields: {
+    name: {
+      maybe: true,
+      type: "Index"
+    },
+    signature: {
+      type: "SignatureOrTypeRef"
+    },
+    body: {
+      array: true,
+      type: "Instruction"
+    },
+    isExternal: {
+      comment: "means that it has been imported from the outside js",
+      optional: true,
+      type: "boolean"
+    },
+    metadata: {
+      optional: true,
+      type: "FuncMetadata"
+    }
+  }
+});
+/**
+ * Intrinsics
+ */
+
+defineType("InternalBrUnless", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {
+    target: {
+      type: "number"
+    }
+  }
+});
+defineType("InternalGoto", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {
+    target: {
+      type: "number"
+    }
+  }
+});
+defineType("InternalCallExtern", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {
+    target: {
+      type: "number"
+    }
+  }
+}); // function bodies are terminated by an `end` instruction but are missing a
+// return instruction
+//
+// Since we can't inject a new instruction we are injecting a new instruction.
+
+defineType("InternalEndAndReturn", {
+  unionType: ["Node", "Intrinsic"],
+  fields: {}
+});
+module.exports = definitions;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/index.js
new file mode 100644
index 0000000..9009e4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/index.js
@@ -0,0 +1,127 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _exportNames = {
+  numberLiteralFromRaw: true,
+  withLoc: true,
+  withRaw: true,
+  funcParam: true,
+  indexLiteral: true,
+  memIndexLiteral: true,
+  instruction: true,
+  objectInstruction: true,
+  traverse: true,
+  signatures: true,
+  cloneNode: true,
+  moduleContextFromModuleAST: true
+};
+Object.defineProperty(exports, "numberLiteralFromRaw", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.numberLiteralFromRaw;
+  }
+});
+Object.defineProperty(exports, "withLoc", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.withLoc;
+  }
+});
+Object.defineProperty(exports, "withRaw", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.withRaw;
+  }
+});
+Object.defineProperty(exports, "funcParam", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.funcParam;
+  }
+});
+Object.defineProperty(exports, "indexLiteral", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.indexLiteral;
+  }
+});
+Object.defineProperty(exports, "memIndexLiteral", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.memIndexLiteral;
+  }
+});
+Object.defineProperty(exports, "instruction", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.instruction;
+  }
+});
+Object.defineProperty(exports, "objectInstruction", {
+  enumerable: true,
+  get: function get() {
+    return _nodeHelpers.objectInstruction;
+  }
+});
+Object.defineProperty(exports, "traverse", {
+  enumerable: true,
+  get: function get() {
+    return _traverse.traverse;
+  }
+});
+Object.defineProperty(exports, "signatures", {
+  enumerable: true,
+  get: function get() {
+    return _signatures.signatures;
+  }
+});
+Object.defineProperty(exports, "cloneNode", {
+  enumerable: true,
+  get: function get() {
+    return _clone.cloneNode;
+  }
+});
+Object.defineProperty(exports, "moduleContextFromModuleAST", {
+  enumerable: true,
+  get: function get() {
+    return _astModuleToModuleContext.moduleContextFromModuleAST;
+  }
+});
+
+var _nodes = require("./nodes");
+
+Object.keys(_nodes).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _nodes[key];
+    }
+  });
+});
+
+var _nodeHelpers = require("./node-helpers.js");
+
+var _traverse = require("./traverse");
+
+var _signatures = require("./signatures");
+
+var _utils = require("./utils");
+
+Object.keys(_utils).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _utils[key];
+    }
+  });
+});
+
+var _clone = require("./clone");
+
+var _astModuleToModuleContext = require("./transform/ast-module-to-module-context");
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/node-helpers.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/node-helpers.js
new file mode 100644
index 0000000..73c5959
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/node-helpers.js
@@ -0,0 +1,107 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numberLiteralFromRaw = numberLiteralFromRaw;
+exports.instruction = instruction;
+exports.objectInstruction = objectInstruction;
+exports.withLoc = withLoc;
+exports.withRaw = withRaw;
+exports.funcParam = funcParam;
+exports.indexLiteral = indexLiteral;
+exports.memIndexLiteral = memIndexLiteral;
+
+var _helperNumbers = require("@webassemblyjs/helper-numbers");
+
+var _nodes = require("./nodes");
+
+function numberLiteralFromRaw(rawValue) {
+  var instructionType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "i32";
+  var original = rawValue; // Remove numeric separators _
+
+  if (typeof rawValue === "string") {
+    rawValue = rawValue.replace(/_/g, "");
+  }
+
+  if (typeof rawValue === "number") {
+    return (0, _nodes.numberLiteral)(rawValue, String(original));
+  } else {
+    switch (instructionType) {
+      case "i32":
+        {
+          return (0, _nodes.numberLiteral)((0, _helperNumbers.parse32I)(rawValue), String(original));
+        }
+
+      case "u32":
+        {
+          return (0, _nodes.numberLiteral)((0, _helperNumbers.parseU32)(rawValue), String(original));
+        }
+
+      case "i64":
+        {
+          return (0, _nodes.longNumberLiteral)((0, _helperNumbers.parse64I)(rawValue), String(original));
+        }
+
+      case "f32":
+        {
+          return (0, _nodes.floatLiteral)((0, _helperNumbers.parse32F)(rawValue), (0, _helperNumbers.isNanLiteral)(rawValue), (0, _helperNumbers.isInfLiteral)(rawValue), String(original));
+        }
+      // f64
+
+      default:
+        {
+          return (0, _nodes.floatLiteral)((0, _helperNumbers.parse64F)(rawValue), (0, _helperNumbers.isNanLiteral)(rawValue), (0, _helperNumbers.isInfLiteral)(rawValue), String(original));
+        }
+    }
+  }
+}
+
+function instruction(id) {
+  var args = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+  var namedArgs = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+  return (0, _nodes.instr)(id, undefined, args, namedArgs);
+}
+
+function objectInstruction(id, object) {
+  var args = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  var namedArgs = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
+  return (0, _nodes.instr)(id, object, args, namedArgs);
+}
+/**
+ * Decorators
+ */
+
+
+function withLoc(n, end, start) {
+  var loc = {
+    start: start,
+    end: end
+  };
+  n.loc = loc;
+  return n;
+}
+
+function withRaw(n, raw) {
+  n.raw = raw;
+  return n;
+}
+
+function funcParam(valtype, id) {
+  return {
+    id: id,
+    valtype: valtype
+  };
+}
+
+function indexLiteral(value) {
+  // $FlowIgnore
+  var x = numberLiteralFromRaw(value, "u32");
+  return x;
+}
+
+function memIndexLiteral(value) {
+  // $FlowIgnore
+  var x = numberLiteralFromRaw(value, "u32");
+  return x;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/node-path.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/node-path.js
new file mode 100644
index 0000000..cf85534
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/node-path.js
@@ -0,0 +1,144 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPath = createPath;
+
+function _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
+
+function findParent(_ref, cb) {
+  var parentPath = _ref.parentPath;
+
+  if (parentPath == null) {
+    throw new Error("node is root");
+  }
+
+  var currentPath = parentPath;
+
+  while (cb(currentPath) !== false) {
+    // Hit the root node, stop
+    // $FlowIgnore
+    if (currentPath.parentPath == null) {
+      return null;
+    } // $FlowIgnore
+
+
+    currentPath = currentPath.parentPath;
+  }
+
+  return currentPath.node;
+}
+
+function insertBefore(context, newNode) {
+  return insert(context, newNode);
+}
+
+function insertAfter(context, newNode) {
+  return insert(context, newNode, 1);
+}
+
+function insert(_ref2, newNode) {
+  var node = _ref2.node,
+      inList = _ref2.inList,
+      parentPath = _ref2.parentPath,
+      parentKey = _ref2.parentKey;
+  var indexOffset = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+
+  if (!inList) {
+    throw new Error('inList' + " error: " + ("insert can only be used for nodes that are within lists" || "unknown"));
+  }
+
+  if (!(parentPath != null)) {
+    throw new Error('parentPath != null' + " error: " + ("Can not remove root node" || "unknown"));
+  }
+
+  // $FlowIgnore
+  var parentList = parentPath.node[parentKey];
+  var indexInList = parentList.findIndex(function (n) {
+    return n === node;
+  });
+  parentList.splice(indexInList + indexOffset, 0, newNode);
+}
+
+function remove(_ref3) {
+  var node = _ref3.node,
+      parentKey = _ref3.parentKey,
+      parentPath = _ref3.parentPath;
+
+  if (!(parentPath != null)) {
+    throw new Error('parentPath != null' + " error: " + ("Can not remove root node" || "unknown"));
+  }
+
+  // $FlowIgnore
+  var parentNode = parentPath.node; // $FlowIgnore
+
+  var parentProperty = parentNode[parentKey];
+
+  if (Array.isArray(parentProperty)) {
+    // $FlowIgnore
+    parentNode[parentKey] = parentProperty.filter(function (n) {
+      return n !== node;
+    });
+  } else {
+    // $FlowIgnore
+    delete parentNode[parentKey];
+  }
+
+  node._deleted = true;
+}
+
+function stop(context) {
+  context.shouldStop = true;
+}
+
+function replaceWith(context, newNode) {
+  // $FlowIgnore
+  var parentNode = context.parentPath.node; // $FlowIgnore
+
+  var parentProperty = parentNode[context.parentKey];
+
+  if (Array.isArray(parentProperty)) {
+    var indexInList = parentProperty.findIndex(function (n) {
+      return n === context.node;
+    });
+    parentProperty.splice(indexInList, 1, newNode);
+  } else {
+    // $FlowIgnore
+    parentNode[context.parentKey] = newNode;
+  }
+
+  context.node._deleted = true;
+  context.node = newNode;
+} // bind the context to the first argument of node operations
+
+
+function bindNodeOperations(operations, context) {
+  var keys = Object.keys(operations);
+  var boundOperations = {};
+  keys.forEach(function (key) {
+    boundOperations[key] = operations[key].bind(null, context);
+  });
+  return boundOperations;
+}
+
+function createPathOperations(context) {
+  // $FlowIgnore
+  return bindNodeOperations({
+    findParent: findParent,
+    replaceWith: replaceWith,
+    remove: remove,
+    insertBefore: insertBefore,
+    insertAfter: insertAfter,
+    stop: stop
+  }, context);
+}
+
+function createPath(context) {
+  var path = _extends({}, context); // $FlowIgnore
+
+
+  Object.assign(path, createPathOperations(path)); // $FlowIgnore
+
+  return path;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/nodes.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/nodes.js
new file mode 100644
index 0000000..9f62482
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/nodes.js
@@ -0,0 +1,1144 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.module = _module;
+exports.moduleMetadata = moduleMetadata;
+exports.moduleNameMetadata = moduleNameMetadata;
+exports.functionNameMetadata = functionNameMetadata;
+exports.localNameMetadata = localNameMetadata;
+exports.binaryModule = binaryModule;
+exports.quoteModule = quoteModule;
+exports.sectionMetadata = sectionMetadata;
+exports.producersSectionMetadata = producersSectionMetadata;
+exports.producerMetadata = producerMetadata;
+exports.producerMetadataVersionedName = producerMetadataVersionedName;
+exports.loopInstruction = loopInstruction;
+exports.instr = instr;
+exports.ifInstruction = ifInstruction;
+exports.stringLiteral = stringLiteral;
+exports.numberLiteral = numberLiteral;
+exports.longNumberLiteral = longNumberLiteral;
+exports.floatLiteral = floatLiteral;
+exports.elem = elem;
+exports.indexInFuncSection = indexInFuncSection;
+exports.valtypeLiteral = valtypeLiteral;
+exports.typeInstruction = typeInstruction;
+exports.start = start;
+exports.globalType = globalType;
+exports.leadingComment = leadingComment;
+exports.blockComment = blockComment;
+exports.data = data;
+exports.global = global;
+exports.table = table;
+exports.memory = memory;
+exports.funcImportDescr = funcImportDescr;
+exports.moduleImport = moduleImport;
+exports.moduleExportDescr = moduleExportDescr;
+exports.moduleExport = moduleExport;
+exports.limit = limit;
+exports.signature = signature;
+exports.program = program;
+exports.identifier = identifier;
+exports.blockInstruction = blockInstruction;
+exports.callInstruction = callInstruction;
+exports.callIndirectInstruction = callIndirectInstruction;
+exports.byteArray = byteArray;
+exports.func = func;
+exports.internalBrUnless = internalBrUnless;
+exports.internalGoto = internalGoto;
+exports.internalCallExtern = internalCallExtern;
+exports.internalEndAndReturn = internalEndAndReturn;
+exports.assertInternalCallExtern = exports.assertInternalGoto = exports.assertInternalBrUnless = exports.assertFunc = exports.assertByteArray = exports.assertCallIndirectInstruction = exports.assertCallInstruction = exports.assertBlockInstruction = exports.assertIdentifier = exports.assertProgram = exports.assertSignature = exports.assertLimit = exports.assertModuleExport = exports.assertModuleExportDescr = exports.assertModuleImport = exports.assertFuncImportDescr = exports.assertMemory = exports.assertTable = exports.assertGlobal = exports.assertData = exports.assertBlockComment = exports.assertLeadingComment = exports.assertGlobalType = exports.assertStart = exports.assertTypeInstruction = exports.assertValtypeLiteral = exports.assertIndexInFuncSection = exports.assertElem = exports.assertFloatLiteral = exports.assertLongNumberLiteral = exports.assertNumberLiteral = exports.assertStringLiteral = exports.assertIfInstruction = exports.assertInstr = exports.assertLoopInstruction = exports.assertProducerMetadataVersionedName = exports.assertProducerMetadata = exports.assertProducersSectionMetadata = exports.assertSectionMetadata = exports.assertQuoteModule = exports.assertBinaryModule = exports.assertLocalNameMetadata = exports.assertFunctionNameMetadata = exports.assertModuleNameMetadata = exports.assertModuleMetadata = exports.assertModule = exports.isIntrinsic = exports.isImportDescr = exports.isNumericLiteral = exports.isExpression = exports.isInstruction = exports.isBlock = exports.isNode = exports.isInternalEndAndReturn = exports.isInternalCallExtern = exports.isInternalGoto = exports.isInternalBrUnless = exports.isFunc = exports.isByteArray = exports.isCallIndirectInstruction = exports.isCallInstruction = exports.isBlockInstruction = exports.isIdentifier = exports.isProgram = exports.isSignature = exports.isLimit = exports.isModuleExport = exports.isModuleExportDescr = exports.isModuleImport = exports.isFuncImportDescr = exports.isMemory = exports.isTable = exports.isGlobal = exports.isData = exports.isBlockComment = exports.isLeadingComment = exports.isGlobalType = exports.isStart = exports.isTypeInstruction = exports.isValtypeLiteral = exports.isIndexInFuncSection = exports.isElem = exports.isFloatLiteral = exports.isLongNumberLiteral = exports.isNumberLiteral = exports.isStringLiteral = exports.isIfInstruction = exports.isInstr = exports.isLoopInstruction = exports.isProducerMetadataVersionedName = exports.isProducerMetadata = exports.isProducersSectionMetadata = exports.isSectionMetadata = exports.isQuoteModule = exports.isBinaryModule = exports.isLocalNameMetadata = exports.isFunctionNameMetadata = exports.isModuleNameMetadata = exports.isModuleMetadata = exports.isModule = void 0;
+exports.nodeAndUnionTypes = exports.unionTypesMap = exports.assertInternalEndAndReturn = void 0;
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+// THIS FILE IS AUTOGENERATED
+// see scripts/generateNodeUtils.js
+function isTypeOf(t) {
+  return function (n) {
+    return n.type === t;
+  };
+}
+
+function assertTypeOf(t) {
+  return function (n) {
+    return function () {
+      if (!(n.type === t)) {
+        throw new Error('n.type === t' + " error: " + (undefined || "unknown"));
+      }
+    }();
+  };
+}
+
+function _module(id, fields, metadata) {
+  if (id !== null && id !== undefined) {
+    if (!(typeof id === "string")) {
+      throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+    }
+  }
+
+  if (!(_typeof(fields) === "object" && typeof fields.length !== "undefined")) {
+    throw new Error('typeof fields === "object" && typeof fields.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Module",
+    id: id,
+    fields: fields
+  };
+
+  if (typeof metadata !== "undefined") {
+    node.metadata = metadata;
+  }
+
+  return node;
+}
+
+function moduleMetadata(sections, functionNames, localNames, producers) {
+  if (!(_typeof(sections) === "object" && typeof sections.length !== "undefined")) {
+    throw new Error('typeof sections === "object" && typeof sections.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (functionNames !== null && functionNames !== undefined) {
+    if (!(_typeof(functionNames) === "object" && typeof functionNames.length !== "undefined")) {
+      throw new Error('typeof functionNames === "object" && typeof functionNames.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  if (localNames !== null && localNames !== undefined) {
+    if (!(_typeof(localNames) === "object" && typeof localNames.length !== "undefined")) {
+      throw new Error('typeof localNames === "object" && typeof localNames.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  if (producers !== null && producers !== undefined) {
+    if (!(_typeof(producers) === "object" && typeof producers.length !== "undefined")) {
+      throw new Error('typeof producers === "object" && typeof producers.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "ModuleMetadata",
+    sections: sections
+  };
+
+  if (typeof functionNames !== "undefined" && functionNames.length > 0) {
+    node.functionNames = functionNames;
+  }
+
+  if (typeof localNames !== "undefined" && localNames.length > 0) {
+    node.localNames = localNames;
+  }
+
+  if (typeof producers !== "undefined" && producers.length > 0) {
+    node.producers = producers;
+  }
+
+  return node;
+}
+
+function moduleNameMetadata(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "ModuleNameMetadata",
+    value: value
+  };
+  return node;
+}
+
+function functionNameMetadata(value, index) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (!(typeof index === "number")) {
+    throw new Error('typeof index === "number"' + " error: " + ("Argument index must be of type number, given: " + _typeof(index) || "unknown"));
+  }
+
+  var node = {
+    type: "FunctionNameMetadata",
+    value: value,
+    index: index
+  };
+  return node;
+}
+
+function localNameMetadata(value, localIndex, functionIndex) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (!(typeof localIndex === "number")) {
+    throw new Error('typeof localIndex === "number"' + " error: " + ("Argument localIndex must be of type number, given: " + _typeof(localIndex) || "unknown"));
+  }
+
+  if (!(typeof functionIndex === "number")) {
+    throw new Error('typeof functionIndex === "number"' + " error: " + ("Argument functionIndex must be of type number, given: " + _typeof(functionIndex) || "unknown"));
+  }
+
+  var node = {
+    type: "LocalNameMetadata",
+    value: value,
+    localIndex: localIndex,
+    functionIndex: functionIndex
+  };
+  return node;
+}
+
+function binaryModule(id, blob) {
+  if (id !== null && id !== undefined) {
+    if (!(typeof id === "string")) {
+      throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+    }
+  }
+
+  if (!(_typeof(blob) === "object" && typeof blob.length !== "undefined")) {
+    throw new Error('typeof blob === "object" && typeof blob.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "BinaryModule",
+    id: id,
+    blob: blob
+  };
+  return node;
+}
+
+function quoteModule(id, string) {
+  if (id !== null && id !== undefined) {
+    if (!(typeof id === "string")) {
+      throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+    }
+  }
+
+  if (!(_typeof(string) === "object" && typeof string.length !== "undefined")) {
+    throw new Error('typeof string === "object" && typeof string.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "QuoteModule",
+    id: id,
+    string: string
+  };
+  return node;
+}
+
+function sectionMetadata(section, startOffset, size, vectorOfSize) {
+  if (!(typeof startOffset === "number")) {
+    throw new Error('typeof startOffset === "number"' + " error: " + ("Argument startOffset must be of type number, given: " + _typeof(startOffset) || "unknown"));
+  }
+
+  var node = {
+    type: "SectionMetadata",
+    section: section,
+    startOffset: startOffset,
+    size: size,
+    vectorOfSize: vectorOfSize
+  };
+  return node;
+}
+
+function producersSectionMetadata(producers) {
+  if (!(_typeof(producers) === "object" && typeof producers.length !== "undefined")) {
+    throw new Error('typeof producers === "object" && typeof producers.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "ProducersSectionMetadata",
+    producers: producers
+  };
+  return node;
+}
+
+function producerMetadata(language, processedBy, sdk) {
+  if (!(_typeof(language) === "object" && typeof language.length !== "undefined")) {
+    throw new Error('typeof language === "object" && typeof language.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(processedBy) === "object" && typeof processedBy.length !== "undefined")) {
+    throw new Error('typeof processedBy === "object" && typeof processedBy.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(sdk) === "object" && typeof sdk.length !== "undefined")) {
+    throw new Error('typeof sdk === "object" && typeof sdk.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "ProducerMetadata",
+    language: language,
+    processedBy: processedBy,
+    sdk: sdk
+  };
+  return node;
+}
+
+function producerMetadataVersionedName(name, version) {
+  if (!(typeof name === "string")) {
+    throw new Error('typeof name === "string"' + " error: " + ("Argument name must be of type string, given: " + _typeof(name) || "unknown"));
+  }
+
+  if (!(typeof version === "string")) {
+    throw new Error('typeof version === "string"' + " error: " + ("Argument version must be of type string, given: " + _typeof(version) || "unknown"));
+  }
+
+  var node = {
+    type: "ProducerMetadataVersionedName",
+    name: name,
+    version: version
+  };
+  return node;
+}
+
+function loopInstruction(label, resulttype, instr) {
+  if (!(_typeof(instr) === "object" && typeof instr.length !== "undefined")) {
+    throw new Error('typeof instr === "object" && typeof instr.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "LoopInstruction",
+    id: "loop",
+    label: label,
+    resulttype: resulttype,
+    instr: instr
+  };
+  return node;
+}
+
+function instr(id, object, args, namedArgs) {
+  if (!(typeof id === "string")) {
+    throw new Error('typeof id === "string"' + " error: " + ("Argument id must be of type string, given: " + _typeof(id) || "unknown"));
+  }
+
+  if (!(_typeof(args) === "object" && typeof args.length !== "undefined")) {
+    throw new Error('typeof args === "object" && typeof args.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Instr",
+    id: id,
+    args: args
+  };
+
+  if (typeof object !== "undefined") {
+    node.object = object;
+  }
+
+  if (typeof namedArgs !== "undefined" && Object.keys(namedArgs).length !== 0) {
+    node.namedArgs = namedArgs;
+  }
+
+  return node;
+}
+
+function ifInstruction(testLabel, test, result, consequent, alternate) {
+  if (!(_typeof(test) === "object" && typeof test.length !== "undefined")) {
+    throw new Error('typeof test === "object" && typeof test.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(consequent) === "object" && typeof consequent.length !== "undefined")) {
+    throw new Error('typeof consequent === "object" && typeof consequent.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(alternate) === "object" && typeof alternate.length !== "undefined")) {
+    throw new Error('typeof alternate === "object" && typeof alternate.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "IfInstruction",
+    id: "if",
+    testLabel: testLabel,
+    test: test,
+    result: result,
+    consequent: consequent,
+    alternate: alternate
+  };
+  return node;
+}
+
+function stringLiteral(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "StringLiteral",
+    value: value
+  };
+  return node;
+}
+
+function numberLiteral(value, raw) {
+  if (!(typeof value === "number")) {
+    throw new Error('typeof value === "number"' + " error: " + ("Argument value must be of type number, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (!(typeof raw === "string")) {
+    throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+  }
+
+  var node = {
+    type: "NumberLiteral",
+    value: value,
+    raw: raw
+  };
+  return node;
+}
+
+function longNumberLiteral(value, raw) {
+  if (!(typeof raw === "string")) {
+    throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+  }
+
+  var node = {
+    type: "LongNumberLiteral",
+    value: value,
+    raw: raw
+  };
+  return node;
+}
+
+function floatLiteral(value, nan, inf, raw) {
+  if (!(typeof value === "number")) {
+    throw new Error('typeof value === "number"' + " error: " + ("Argument value must be of type number, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (nan !== null && nan !== undefined) {
+    if (!(typeof nan === "boolean")) {
+      throw new Error('typeof nan === "boolean"' + " error: " + ("Argument nan must be of type boolean, given: " + _typeof(nan) || "unknown"));
+    }
+  }
+
+  if (inf !== null && inf !== undefined) {
+    if (!(typeof inf === "boolean")) {
+      throw new Error('typeof inf === "boolean"' + " error: " + ("Argument inf must be of type boolean, given: " + _typeof(inf) || "unknown"));
+    }
+  }
+
+  if (!(typeof raw === "string")) {
+    throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+  }
+
+  var node = {
+    type: "FloatLiteral",
+    value: value,
+    raw: raw
+  };
+
+  if (nan === true) {
+    node.nan = true;
+  }
+
+  if (inf === true) {
+    node.inf = true;
+  }
+
+  return node;
+}
+
+function elem(table, offset, funcs) {
+  if (!(_typeof(offset) === "object" && typeof offset.length !== "undefined")) {
+    throw new Error('typeof offset === "object" && typeof offset.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(funcs) === "object" && typeof funcs.length !== "undefined")) {
+    throw new Error('typeof funcs === "object" && typeof funcs.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Elem",
+    table: table,
+    offset: offset,
+    funcs: funcs
+  };
+  return node;
+}
+
+function indexInFuncSection(index) {
+  var node = {
+    type: "IndexInFuncSection",
+    index: index
+  };
+  return node;
+}
+
+function valtypeLiteral(name) {
+  var node = {
+    type: "ValtypeLiteral",
+    name: name
+  };
+  return node;
+}
+
+function typeInstruction(id, functype) {
+  var node = {
+    type: "TypeInstruction",
+    id: id,
+    functype: functype
+  };
+  return node;
+}
+
+function start(index) {
+  var node = {
+    type: "Start",
+    index: index
+  };
+  return node;
+}
+
+function globalType(valtype, mutability) {
+  var node = {
+    type: "GlobalType",
+    valtype: valtype,
+    mutability: mutability
+  };
+  return node;
+}
+
+function leadingComment(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "LeadingComment",
+    value: value
+  };
+  return node;
+}
+
+function blockComment(value) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  var node = {
+    type: "BlockComment",
+    value: value
+  };
+  return node;
+}
+
+function data(memoryIndex, offset, init) {
+  var node = {
+    type: "Data",
+    memoryIndex: memoryIndex,
+    offset: offset,
+    init: init
+  };
+  return node;
+}
+
+function global(globalType, init, name) {
+  if (!(_typeof(init) === "object" && typeof init.length !== "undefined")) {
+    throw new Error('typeof init === "object" && typeof init.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Global",
+    globalType: globalType,
+    init: init,
+    name: name
+  };
+  return node;
+}
+
+function table(elementType, limits, name, elements) {
+  if (!(limits.type === "Limit")) {
+    throw new Error('limits.type === "Limit"' + " error: " + ("Argument limits must be of type Limit, given: " + limits.type || "unknown"));
+  }
+
+  if (elements !== null && elements !== undefined) {
+    if (!(_typeof(elements) === "object" && typeof elements.length !== "undefined")) {
+      throw new Error('typeof elements === "object" && typeof elements.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Table",
+    elementType: elementType,
+    limits: limits,
+    name: name
+  };
+
+  if (typeof elements !== "undefined" && elements.length > 0) {
+    node.elements = elements;
+  }
+
+  return node;
+}
+
+function memory(limits, id) {
+  var node = {
+    type: "Memory",
+    limits: limits,
+    id: id
+  };
+  return node;
+}
+
+function funcImportDescr(id, signature) {
+  var node = {
+    type: "FuncImportDescr",
+    id: id,
+    signature: signature
+  };
+  return node;
+}
+
+function moduleImport(module, name, descr) {
+  if (!(typeof module === "string")) {
+    throw new Error('typeof module === "string"' + " error: " + ("Argument module must be of type string, given: " + _typeof(module) || "unknown"));
+  }
+
+  if (!(typeof name === "string")) {
+    throw new Error('typeof name === "string"' + " error: " + ("Argument name must be of type string, given: " + _typeof(name) || "unknown"));
+  }
+
+  var node = {
+    type: "ModuleImport",
+    module: module,
+    name: name,
+    descr: descr
+  };
+  return node;
+}
+
+function moduleExportDescr(exportType, id) {
+  var node = {
+    type: "ModuleExportDescr",
+    exportType: exportType,
+    id: id
+  };
+  return node;
+}
+
+function moduleExport(name, descr) {
+  if (!(typeof name === "string")) {
+    throw new Error('typeof name === "string"' + " error: " + ("Argument name must be of type string, given: " + _typeof(name) || "unknown"));
+  }
+
+  var node = {
+    type: "ModuleExport",
+    name: name,
+    descr: descr
+  };
+  return node;
+}
+
+function limit(min, max, shared) {
+  if (!(typeof min === "number")) {
+    throw new Error('typeof min === "number"' + " error: " + ("Argument min must be of type number, given: " + _typeof(min) || "unknown"));
+  }
+
+  if (max !== null && max !== undefined) {
+    if (!(typeof max === "number")) {
+      throw new Error('typeof max === "number"' + " error: " + ("Argument max must be of type number, given: " + _typeof(max) || "unknown"));
+    }
+  }
+
+  if (shared !== null && shared !== undefined) {
+    if (!(typeof shared === "boolean")) {
+      throw new Error('typeof shared === "boolean"' + " error: " + ("Argument shared must be of type boolean, given: " + _typeof(shared) || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Limit",
+    min: min
+  };
+
+  if (typeof max !== "undefined") {
+    node.max = max;
+  }
+
+  if (shared === true) {
+    node.shared = true;
+  }
+
+  return node;
+}
+
+function signature(params, results) {
+  if (!(_typeof(params) === "object" && typeof params.length !== "undefined")) {
+    throw new Error('typeof params === "object" && typeof params.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (!(_typeof(results) === "object" && typeof results.length !== "undefined")) {
+    throw new Error('typeof results === "object" && typeof results.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Signature",
+    params: params,
+    results: results
+  };
+  return node;
+}
+
+function program(body) {
+  if (!(_typeof(body) === "object" && typeof body.length !== "undefined")) {
+    throw new Error('typeof body === "object" && typeof body.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "Program",
+    body: body
+  };
+  return node;
+}
+
+function identifier(value, raw) {
+  if (!(typeof value === "string")) {
+    throw new Error('typeof value === "string"' + " error: " + ("Argument value must be of type string, given: " + _typeof(value) || "unknown"));
+  }
+
+  if (raw !== null && raw !== undefined) {
+    if (!(typeof raw === "string")) {
+      throw new Error('typeof raw === "string"' + " error: " + ("Argument raw must be of type string, given: " + _typeof(raw) || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Identifier",
+    value: value
+  };
+
+  if (typeof raw !== "undefined") {
+    node.raw = raw;
+  }
+
+  return node;
+}
+
+function blockInstruction(label, instr, result) {
+  if (!(_typeof(instr) === "object" && typeof instr.length !== "undefined")) {
+    throw new Error('typeof instr === "object" && typeof instr.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "BlockInstruction",
+    id: "block",
+    label: label,
+    instr: instr,
+    result: result
+  };
+  return node;
+}
+
+function callInstruction(index, instrArgs, numeric) {
+  if (instrArgs !== null && instrArgs !== undefined) {
+    if (!(_typeof(instrArgs) === "object" && typeof instrArgs.length !== "undefined")) {
+      throw new Error('typeof instrArgs === "object" && typeof instrArgs.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "CallInstruction",
+    id: "call",
+    index: index
+  };
+
+  if (typeof instrArgs !== "undefined" && instrArgs.length > 0) {
+    node.instrArgs = instrArgs;
+  }
+
+  if (typeof numeric !== "undefined") {
+    node.numeric = numeric;
+  }
+
+  return node;
+}
+
+function callIndirectInstruction(signature, intrs) {
+  if (intrs !== null && intrs !== undefined) {
+    if (!(_typeof(intrs) === "object" && typeof intrs.length !== "undefined")) {
+      throw new Error('typeof intrs === "object" && typeof intrs.length !== "undefined"' + " error: " + (undefined || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "CallIndirectInstruction",
+    id: "call_indirect",
+    signature: signature
+  };
+
+  if (typeof intrs !== "undefined" && intrs.length > 0) {
+    node.intrs = intrs;
+  }
+
+  return node;
+}
+
+function byteArray(values) {
+  if (!(_typeof(values) === "object" && typeof values.length !== "undefined")) {
+    throw new Error('typeof values === "object" && typeof values.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  var node = {
+    type: "ByteArray",
+    values: values
+  };
+  return node;
+}
+
+function func(name, signature, body, isExternal, metadata) {
+  if (!(_typeof(body) === "object" && typeof body.length !== "undefined")) {
+    throw new Error('typeof body === "object" && typeof body.length !== "undefined"' + " error: " + (undefined || "unknown"));
+  }
+
+  if (isExternal !== null && isExternal !== undefined) {
+    if (!(typeof isExternal === "boolean")) {
+      throw new Error('typeof isExternal === "boolean"' + " error: " + ("Argument isExternal must be of type boolean, given: " + _typeof(isExternal) || "unknown"));
+    }
+  }
+
+  var node = {
+    type: "Func",
+    name: name,
+    signature: signature,
+    body: body
+  };
+
+  if (isExternal === true) {
+    node.isExternal = true;
+  }
+
+  if (typeof metadata !== "undefined") {
+    node.metadata = metadata;
+  }
+
+  return node;
+}
+
+function internalBrUnless(target) {
+  if (!(typeof target === "number")) {
+    throw new Error('typeof target === "number"' + " error: " + ("Argument target must be of type number, given: " + _typeof(target) || "unknown"));
+  }
+
+  var node = {
+    type: "InternalBrUnless",
+    target: target
+  };
+  return node;
+}
+
+function internalGoto(target) {
+  if (!(typeof target === "number")) {
+    throw new Error('typeof target === "number"' + " error: " + ("Argument target must be of type number, given: " + _typeof(target) || "unknown"));
+  }
+
+  var node = {
+    type: "InternalGoto",
+    target: target
+  };
+  return node;
+}
+
+function internalCallExtern(target) {
+  if (!(typeof target === "number")) {
+    throw new Error('typeof target === "number"' + " error: " + ("Argument target must be of type number, given: " + _typeof(target) || "unknown"));
+  }
+
+  var node = {
+    type: "InternalCallExtern",
+    target: target
+  };
+  return node;
+}
+
+function internalEndAndReturn() {
+  var node = {
+    type: "InternalEndAndReturn"
+  };
+  return node;
+}
+
+var isModule = isTypeOf("Module");
+exports.isModule = isModule;
+var isModuleMetadata = isTypeOf("ModuleMetadata");
+exports.isModuleMetadata = isModuleMetadata;
+var isModuleNameMetadata = isTypeOf("ModuleNameMetadata");
+exports.isModuleNameMetadata = isModuleNameMetadata;
+var isFunctionNameMetadata = isTypeOf("FunctionNameMetadata");
+exports.isFunctionNameMetadata = isFunctionNameMetadata;
+var isLocalNameMetadata = isTypeOf("LocalNameMetadata");
+exports.isLocalNameMetadata = isLocalNameMetadata;
+var isBinaryModule = isTypeOf("BinaryModule");
+exports.isBinaryModule = isBinaryModule;
+var isQuoteModule = isTypeOf("QuoteModule");
+exports.isQuoteModule = isQuoteModule;
+var isSectionMetadata = isTypeOf("SectionMetadata");
+exports.isSectionMetadata = isSectionMetadata;
+var isProducersSectionMetadata = isTypeOf("ProducersSectionMetadata");
+exports.isProducersSectionMetadata = isProducersSectionMetadata;
+var isProducerMetadata = isTypeOf("ProducerMetadata");
+exports.isProducerMetadata = isProducerMetadata;
+var isProducerMetadataVersionedName = isTypeOf("ProducerMetadataVersionedName");
+exports.isProducerMetadataVersionedName = isProducerMetadataVersionedName;
+var isLoopInstruction = isTypeOf("LoopInstruction");
+exports.isLoopInstruction = isLoopInstruction;
+var isInstr = isTypeOf("Instr");
+exports.isInstr = isInstr;
+var isIfInstruction = isTypeOf("IfInstruction");
+exports.isIfInstruction = isIfInstruction;
+var isStringLiteral = isTypeOf("StringLiteral");
+exports.isStringLiteral = isStringLiteral;
+var isNumberLiteral = isTypeOf("NumberLiteral");
+exports.isNumberLiteral = isNumberLiteral;
+var isLongNumberLiteral = isTypeOf("LongNumberLiteral");
+exports.isLongNumberLiteral = isLongNumberLiteral;
+var isFloatLiteral = isTypeOf("FloatLiteral");
+exports.isFloatLiteral = isFloatLiteral;
+var isElem = isTypeOf("Elem");
+exports.isElem = isElem;
+var isIndexInFuncSection = isTypeOf("IndexInFuncSection");
+exports.isIndexInFuncSection = isIndexInFuncSection;
+var isValtypeLiteral = isTypeOf("ValtypeLiteral");
+exports.isValtypeLiteral = isValtypeLiteral;
+var isTypeInstruction = isTypeOf("TypeInstruction");
+exports.isTypeInstruction = isTypeInstruction;
+var isStart = isTypeOf("Start");
+exports.isStart = isStart;
+var isGlobalType = isTypeOf("GlobalType");
+exports.isGlobalType = isGlobalType;
+var isLeadingComment = isTypeOf("LeadingComment");
+exports.isLeadingComment = isLeadingComment;
+var isBlockComment = isTypeOf("BlockComment");
+exports.isBlockComment = isBlockComment;
+var isData = isTypeOf("Data");
+exports.isData = isData;
+var isGlobal = isTypeOf("Global");
+exports.isGlobal = isGlobal;
+var isTable = isTypeOf("Table");
+exports.isTable = isTable;
+var isMemory = isTypeOf("Memory");
+exports.isMemory = isMemory;
+var isFuncImportDescr = isTypeOf("FuncImportDescr");
+exports.isFuncImportDescr = isFuncImportDescr;
+var isModuleImport = isTypeOf("ModuleImport");
+exports.isModuleImport = isModuleImport;
+var isModuleExportDescr = isTypeOf("ModuleExportDescr");
+exports.isModuleExportDescr = isModuleExportDescr;
+var isModuleExport = isTypeOf("ModuleExport");
+exports.isModuleExport = isModuleExport;
+var isLimit = isTypeOf("Limit");
+exports.isLimit = isLimit;
+var isSignature = isTypeOf("Signature");
+exports.isSignature = isSignature;
+var isProgram = isTypeOf("Program");
+exports.isProgram = isProgram;
+var isIdentifier = isTypeOf("Identifier");
+exports.isIdentifier = isIdentifier;
+var isBlockInstruction = isTypeOf("BlockInstruction");
+exports.isBlockInstruction = isBlockInstruction;
+var isCallInstruction = isTypeOf("CallInstruction");
+exports.isCallInstruction = isCallInstruction;
+var isCallIndirectInstruction = isTypeOf("CallIndirectInstruction");
+exports.isCallIndirectInstruction = isCallIndirectInstruction;
+var isByteArray = isTypeOf("ByteArray");
+exports.isByteArray = isByteArray;
+var isFunc = isTypeOf("Func");
+exports.isFunc = isFunc;
+var isInternalBrUnless = isTypeOf("InternalBrUnless");
+exports.isInternalBrUnless = isInternalBrUnless;
+var isInternalGoto = isTypeOf("InternalGoto");
+exports.isInternalGoto = isInternalGoto;
+var isInternalCallExtern = isTypeOf("InternalCallExtern");
+exports.isInternalCallExtern = isInternalCallExtern;
+var isInternalEndAndReturn = isTypeOf("InternalEndAndReturn");
+exports.isInternalEndAndReturn = isInternalEndAndReturn;
+
+var isNode = function isNode(node) {
+  return isModule(node) || isModuleMetadata(node) || isModuleNameMetadata(node) || isFunctionNameMetadata(node) || isLocalNameMetadata(node) || isBinaryModule(node) || isQuoteModule(node) || isSectionMetadata(node) || isProducersSectionMetadata(node) || isProducerMetadata(node) || isProducerMetadataVersionedName(node) || isLoopInstruction(node) || isInstr(node) || isIfInstruction(node) || isStringLiteral(node) || isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node) || isElem(node) || isIndexInFuncSection(node) || isValtypeLiteral(node) || isTypeInstruction(node) || isStart(node) || isGlobalType(node) || isLeadingComment(node) || isBlockComment(node) || isData(node) || isGlobal(node) || isTable(node) || isMemory(node) || isFuncImportDescr(node) || isModuleImport(node) || isModuleExportDescr(node) || isModuleExport(node) || isLimit(node) || isSignature(node) || isProgram(node) || isIdentifier(node) || isBlockInstruction(node) || isCallInstruction(node) || isCallIndirectInstruction(node) || isByteArray(node) || isFunc(node) || isInternalBrUnless(node) || isInternalGoto(node) || isInternalCallExtern(node) || isInternalEndAndReturn(node);
+};
+
+exports.isNode = isNode;
+
+var isBlock = function isBlock(node) {
+  return isLoopInstruction(node) || isBlockInstruction(node) || isFunc(node);
+};
+
+exports.isBlock = isBlock;
+
+var isInstruction = function isInstruction(node) {
+  return isLoopInstruction(node) || isInstr(node) || isIfInstruction(node) || isTypeInstruction(node) || isBlockInstruction(node) || isCallInstruction(node) || isCallIndirectInstruction(node);
+};
+
+exports.isInstruction = isInstruction;
+
+var isExpression = function isExpression(node) {
+  return isInstr(node) || isStringLiteral(node) || isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node) || isValtypeLiteral(node) || isIdentifier(node);
+};
+
+exports.isExpression = isExpression;
+
+var isNumericLiteral = function isNumericLiteral(node) {
+  return isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node);
+};
+
+exports.isNumericLiteral = isNumericLiteral;
+
+var isImportDescr = function isImportDescr(node) {
+  return isGlobalType(node) || isTable(node) || isMemory(node) || isFuncImportDescr(node);
+};
+
+exports.isImportDescr = isImportDescr;
+
+var isIntrinsic = function isIntrinsic(node) {
+  return isInternalBrUnless(node) || isInternalGoto(node) || isInternalCallExtern(node) || isInternalEndAndReturn(node);
+};
+
+exports.isIntrinsic = isIntrinsic;
+var assertModule = assertTypeOf("Module");
+exports.assertModule = assertModule;
+var assertModuleMetadata = assertTypeOf("ModuleMetadata");
+exports.assertModuleMetadata = assertModuleMetadata;
+var assertModuleNameMetadata = assertTypeOf("ModuleNameMetadata");
+exports.assertModuleNameMetadata = assertModuleNameMetadata;
+var assertFunctionNameMetadata = assertTypeOf("FunctionNameMetadata");
+exports.assertFunctionNameMetadata = assertFunctionNameMetadata;
+var assertLocalNameMetadata = assertTypeOf("LocalNameMetadata");
+exports.assertLocalNameMetadata = assertLocalNameMetadata;
+var assertBinaryModule = assertTypeOf("BinaryModule");
+exports.assertBinaryModule = assertBinaryModule;
+var assertQuoteModule = assertTypeOf("QuoteModule");
+exports.assertQuoteModule = assertQuoteModule;
+var assertSectionMetadata = assertTypeOf("SectionMetadata");
+exports.assertSectionMetadata = assertSectionMetadata;
+var assertProducersSectionMetadata = assertTypeOf("ProducersSectionMetadata");
+exports.assertProducersSectionMetadata = assertProducersSectionMetadata;
+var assertProducerMetadata = assertTypeOf("ProducerMetadata");
+exports.assertProducerMetadata = assertProducerMetadata;
+var assertProducerMetadataVersionedName = assertTypeOf("ProducerMetadataVersionedName");
+exports.assertProducerMetadataVersionedName = assertProducerMetadataVersionedName;
+var assertLoopInstruction = assertTypeOf("LoopInstruction");
+exports.assertLoopInstruction = assertLoopInstruction;
+var assertInstr = assertTypeOf("Instr");
+exports.assertInstr = assertInstr;
+var assertIfInstruction = assertTypeOf("IfInstruction");
+exports.assertIfInstruction = assertIfInstruction;
+var assertStringLiteral = assertTypeOf("StringLiteral");
+exports.assertStringLiteral = assertStringLiteral;
+var assertNumberLiteral = assertTypeOf("NumberLiteral");
+exports.assertNumberLiteral = assertNumberLiteral;
+var assertLongNumberLiteral = assertTypeOf("LongNumberLiteral");
+exports.assertLongNumberLiteral = assertLongNumberLiteral;
+var assertFloatLiteral = assertTypeOf("FloatLiteral");
+exports.assertFloatLiteral = assertFloatLiteral;
+var assertElem = assertTypeOf("Elem");
+exports.assertElem = assertElem;
+var assertIndexInFuncSection = assertTypeOf("IndexInFuncSection");
+exports.assertIndexInFuncSection = assertIndexInFuncSection;
+var assertValtypeLiteral = assertTypeOf("ValtypeLiteral");
+exports.assertValtypeLiteral = assertValtypeLiteral;
+var assertTypeInstruction = assertTypeOf("TypeInstruction");
+exports.assertTypeInstruction = assertTypeInstruction;
+var assertStart = assertTypeOf("Start");
+exports.assertStart = assertStart;
+var assertGlobalType = assertTypeOf("GlobalType");
+exports.assertGlobalType = assertGlobalType;
+var assertLeadingComment = assertTypeOf("LeadingComment");
+exports.assertLeadingComment = assertLeadingComment;
+var assertBlockComment = assertTypeOf("BlockComment");
+exports.assertBlockComment = assertBlockComment;
+var assertData = assertTypeOf("Data");
+exports.assertData = assertData;
+var assertGlobal = assertTypeOf("Global");
+exports.assertGlobal = assertGlobal;
+var assertTable = assertTypeOf("Table");
+exports.assertTable = assertTable;
+var assertMemory = assertTypeOf("Memory");
+exports.assertMemory = assertMemory;
+var assertFuncImportDescr = assertTypeOf("FuncImportDescr");
+exports.assertFuncImportDescr = assertFuncImportDescr;
+var assertModuleImport = assertTypeOf("ModuleImport");
+exports.assertModuleImport = assertModuleImport;
+var assertModuleExportDescr = assertTypeOf("ModuleExportDescr");
+exports.assertModuleExportDescr = assertModuleExportDescr;
+var assertModuleExport = assertTypeOf("ModuleExport");
+exports.assertModuleExport = assertModuleExport;
+var assertLimit = assertTypeOf("Limit");
+exports.assertLimit = assertLimit;
+var assertSignature = assertTypeOf("Signature");
+exports.assertSignature = assertSignature;
+var assertProgram = assertTypeOf("Program");
+exports.assertProgram = assertProgram;
+var assertIdentifier = assertTypeOf("Identifier");
+exports.assertIdentifier = assertIdentifier;
+var assertBlockInstruction = assertTypeOf("BlockInstruction");
+exports.assertBlockInstruction = assertBlockInstruction;
+var assertCallInstruction = assertTypeOf("CallInstruction");
+exports.assertCallInstruction = assertCallInstruction;
+var assertCallIndirectInstruction = assertTypeOf("CallIndirectInstruction");
+exports.assertCallIndirectInstruction = assertCallIndirectInstruction;
+var assertByteArray = assertTypeOf("ByteArray");
+exports.assertByteArray = assertByteArray;
+var assertFunc = assertTypeOf("Func");
+exports.assertFunc = assertFunc;
+var assertInternalBrUnless = assertTypeOf("InternalBrUnless");
+exports.assertInternalBrUnless = assertInternalBrUnless;
+var assertInternalGoto = assertTypeOf("InternalGoto");
+exports.assertInternalGoto = assertInternalGoto;
+var assertInternalCallExtern = assertTypeOf("InternalCallExtern");
+exports.assertInternalCallExtern = assertInternalCallExtern;
+var assertInternalEndAndReturn = assertTypeOf("InternalEndAndReturn");
+exports.assertInternalEndAndReturn = assertInternalEndAndReturn;
+var unionTypesMap = {
+  Module: ["Node"],
+  ModuleMetadata: ["Node"],
+  ModuleNameMetadata: ["Node"],
+  FunctionNameMetadata: ["Node"],
+  LocalNameMetadata: ["Node"],
+  BinaryModule: ["Node"],
+  QuoteModule: ["Node"],
+  SectionMetadata: ["Node"],
+  ProducersSectionMetadata: ["Node"],
+  ProducerMetadata: ["Node"],
+  ProducerMetadataVersionedName: ["Node"],
+  LoopInstruction: ["Node", "Block", "Instruction"],
+  Instr: ["Node", "Expression", "Instruction"],
+  IfInstruction: ["Node", "Instruction"],
+  StringLiteral: ["Node", "Expression"],
+  NumberLiteral: ["Node", "NumericLiteral", "Expression"],
+  LongNumberLiteral: ["Node", "NumericLiteral", "Expression"],
+  FloatLiteral: ["Node", "NumericLiteral", "Expression"],
+  Elem: ["Node"],
+  IndexInFuncSection: ["Node"],
+  ValtypeLiteral: ["Node", "Expression"],
+  TypeInstruction: ["Node", "Instruction"],
+  Start: ["Node"],
+  GlobalType: ["Node", "ImportDescr"],
+  LeadingComment: ["Node"],
+  BlockComment: ["Node"],
+  Data: ["Node"],
+  Global: ["Node"],
+  Table: ["Node", "ImportDescr"],
+  Memory: ["Node", "ImportDescr"],
+  FuncImportDescr: ["Node", "ImportDescr"],
+  ModuleImport: ["Node"],
+  ModuleExportDescr: ["Node"],
+  ModuleExport: ["Node"],
+  Limit: ["Node"],
+  Signature: ["Node"],
+  Program: ["Node"],
+  Identifier: ["Node", "Expression"],
+  BlockInstruction: ["Node", "Block", "Instruction"],
+  CallInstruction: ["Node", "Instruction"],
+  CallIndirectInstruction: ["Node", "Instruction"],
+  ByteArray: ["Node"],
+  Func: ["Node", "Block"],
+  InternalBrUnless: ["Node", "Intrinsic"],
+  InternalGoto: ["Node", "Intrinsic"],
+  InternalCallExtern: ["Node", "Intrinsic"],
+  InternalEndAndReturn: ["Node", "Intrinsic"]
+};
+exports.unionTypesMap = unionTypesMap;
+var nodeAndUnionTypes = ["Module", "ModuleMetadata", "ModuleNameMetadata", "FunctionNameMetadata", "LocalNameMetadata", "BinaryModule", "QuoteModule", "SectionMetadata", "ProducersSectionMetadata", "ProducerMetadata", "ProducerMetadataVersionedName", "LoopInstruction", "Instr", "IfInstruction", "StringLiteral", "NumberLiteral", "LongNumberLiteral", "FloatLiteral", "Elem", "IndexInFuncSection", "ValtypeLiteral", "TypeInstruction", "Start", "GlobalType", "LeadingComment", "BlockComment", "Data", "Global", "Table", "Memory", "FuncImportDescr", "ModuleImport", "ModuleExportDescr", "ModuleExport", "Limit", "Signature", "Program", "Identifier", "BlockInstruction", "CallInstruction", "CallIndirectInstruction", "ByteArray", "Func", "InternalBrUnless", "InternalGoto", "InternalCallExtern", "InternalEndAndReturn", "Node", "Block", "Instruction", "Expression", "NumericLiteral", "ImportDescr", "Intrinsic"];
+exports.nodeAndUnionTypes = nodeAndUnionTypes;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/signatures.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/signatures.js
new file mode 100644
index 0000000..0efc766
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/signatures.js
@@ -0,0 +1,207 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.signatures = void 0;
+
+function sign(input, output) {
+  return [input, output];
+}
+
+var u32 = "u32";
+var i32 = "i32";
+var i64 = "i64";
+var f32 = "f32";
+var f64 = "f64";
+
+var vector = function vector(t) {
+  var vecType = [t]; // $FlowIgnore
+
+  vecType.vector = true;
+  return vecType;
+};
+
+var controlInstructions = {
+  unreachable: sign([], []),
+  nop: sign([], []),
+  // block ?
+  // loop ?
+  // if ?
+  // if else ?
+  br: sign([u32], []),
+  br_if: sign([u32], []),
+  br_table: sign(vector(u32), []),
+  return: sign([], []),
+  call: sign([u32], []),
+  call_indirect: sign([u32], [])
+};
+var parametricInstructions = {
+  drop: sign([], []),
+  select: sign([], [])
+};
+var variableInstructions = {
+  get_local: sign([u32], []),
+  set_local: sign([u32], []),
+  tee_local: sign([u32], []),
+  get_global: sign([u32], []),
+  set_global: sign([u32], [])
+};
+var memoryInstructions = {
+  "i32.load": sign([u32, u32], [i32]),
+  "i64.load": sign([u32, u32], []),
+  "f32.load": sign([u32, u32], []),
+  "f64.load": sign([u32, u32], []),
+  "i32.load8_s": sign([u32, u32], [i32]),
+  "i32.load8_u": sign([u32, u32], [i32]),
+  "i32.load16_s": sign([u32, u32], [i32]),
+  "i32.load16_u": sign([u32, u32], [i32]),
+  "i64.load8_s": sign([u32, u32], [i64]),
+  "i64.load8_u": sign([u32, u32], [i64]),
+  "i64.load16_s": sign([u32, u32], [i64]),
+  "i64.load16_u": sign([u32, u32], [i64]),
+  "i64.load32_s": sign([u32, u32], [i64]),
+  "i64.load32_u": sign([u32, u32], [i64]),
+  "i32.store": sign([u32, u32], []),
+  "i64.store": sign([u32, u32], []),
+  "f32.store": sign([u32, u32], []),
+  "f64.store": sign([u32, u32], []),
+  "i32.store8": sign([u32, u32], []),
+  "i32.store16": sign([u32, u32], []),
+  "i64.store8": sign([u32, u32], []),
+  "i64.store16": sign([u32, u32], []),
+  "i64.store32": sign([u32, u32], []),
+  current_memory: sign([], []),
+  grow_memory: sign([], [])
+};
+var numericInstructions = {
+  "i32.const": sign([i32], [i32]),
+  "i64.const": sign([i64], [i64]),
+  "f32.const": sign([f32], [f32]),
+  "f64.const": sign([f64], [f64]),
+  "i32.eqz": sign([i32], [i32]),
+  "i32.eq": sign([i32, i32], [i32]),
+  "i32.ne": sign([i32, i32], [i32]),
+  "i32.lt_s": sign([i32, i32], [i32]),
+  "i32.lt_u": sign([i32, i32], [i32]),
+  "i32.gt_s": sign([i32, i32], [i32]),
+  "i32.gt_u": sign([i32, i32], [i32]),
+  "i32.le_s": sign([i32, i32], [i32]),
+  "i32.le_u": sign([i32, i32], [i32]),
+  "i32.ge_s": sign([i32, i32], [i32]),
+  "i32.ge_u": sign([i32, i32], [i32]),
+  "i64.eqz": sign([i64], [i64]),
+  "i64.eq": sign([i64, i64], [i32]),
+  "i64.ne": sign([i64, i64], [i32]),
+  "i64.lt_s": sign([i64, i64], [i32]),
+  "i64.lt_u": sign([i64, i64], [i32]),
+  "i64.gt_s": sign([i64, i64], [i32]),
+  "i64.gt_u": sign([i64, i64], [i32]),
+  "i64.le_s": sign([i64, i64], [i32]),
+  "i64.le_u": sign([i64, i64], [i32]),
+  "i64.ge_s": sign([i64, i64], [i32]),
+  "i64.ge_u": sign([i64, i64], [i32]),
+  "f32.eq": sign([f32, f32], [i32]),
+  "f32.ne": sign([f32, f32], [i32]),
+  "f32.lt": sign([f32, f32], [i32]),
+  "f32.gt": sign([f32, f32], [i32]),
+  "f32.le": sign([f32, f32], [i32]),
+  "f32.ge": sign([f32, f32], [i32]),
+  "f64.eq": sign([f64, f64], [i32]),
+  "f64.ne": sign([f64, f64], [i32]),
+  "f64.lt": sign([f64, f64], [i32]),
+  "f64.gt": sign([f64, f64], [i32]),
+  "f64.le": sign([f64, f64], [i32]),
+  "f64.ge": sign([f64, f64], [i32]),
+  "i32.clz": sign([i32], [i32]),
+  "i32.ctz": sign([i32], [i32]),
+  "i32.popcnt": sign([i32], [i32]),
+  "i32.add": sign([i32, i32], [i32]),
+  "i32.sub": sign([i32, i32], [i32]),
+  "i32.mul": sign([i32, i32], [i32]),
+  "i32.div_s": sign([i32, i32], [i32]),
+  "i32.div_u": sign([i32, i32], [i32]),
+  "i32.rem_s": sign([i32, i32], [i32]),
+  "i32.rem_u": sign([i32, i32], [i32]),
+  "i32.and": sign([i32, i32], [i32]),
+  "i32.or": sign([i32, i32], [i32]),
+  "i32.xor": sign([i32, i32], [i32]),
+  "i32.shl": sign([i32, i32], [i32]),
+  "i32.shr_s": sign([i32, i32], [i32]),
+  "i32.shr_u": sign([i32, i32], [i32]),
+  "i32.rotl": sign([i32, i32], [i32]),
+  "i32.rotr": sign([i32, i32], [i32]),
+  "i64.clz": sign([i64], [i64]),
+  "i64.ctz": sign([i64], [i64]),
+  "i64.popcnt": sign([i64], [i64]),
+  "i64.add": sign([i64, i64], [i64]),
+  "i64.sub": sign([i64, i64], [i64]),
+  "i64.mul": sign([i64, i64], [i64]),
+  "i64.div_s": sign([i64, i64], [i64]),
+  "i64.div_u": sign([i64, i64], [i64]),
+  "i64.rem_s": sign([i64, i64], [i64]),
+  "i64.rem_u": sign([i64, i64], [i64]),
+  "i64.and": sign([i64, i64], [i64]),
+  "i64.or": sign([i64, i64], [i64]),
+  "i64.xor": sign([i64, i64], [i64]),
+  "i64.shl": sign([i64, i64], [i64]),
+  "i64.shr_s": sign([i64, i64], [i64]),
+  "i64.shr_u": sign([i64, i64], [i64]),
+  "i64.rotl": sign([i64, i64], [i64]),
+  "i64.rotr": sign([i64, i64], [i64]),
+  "f32.abs": sign([f32], [f32]),
+  "f32.neg": sign([f32], [f32]),
+  "f32.ceil": sign([f32], [f32]),
+  "f32.floor": sign([f32], [f32]),
+  "f32.trunc": sign([f32], [f32]),
+  "f32.nearest": sign([f32], [f32]),
+  "f32.sqrt": sign([f32], [f32]),
+  "f32.add": sign([f32, f32], [f32]),
+  "f32.sub": sign([f32, f32], [f32]),
+  "f32.mul": sign([f32, f32], [f32]),
+  "f32.div": sign([f32, f32], [f32]),
+  "f32.min": sign([f32, f32], [f32]),
+  "f32.max": sign([f32, f32], [f32]),
+  "f32.copysign": sign([f32, f32], [f32]),
+  "f64.abs": sign([f64], [f64]),
+  "f64.neg": sign([f64], [f64]),
+  "f64.ceil": sign([f64], [f64]),
+  "f64.floor": sign([f64], [f64]),
+  "f64.trunc": sign([f64], [f64]),
+  "f64.nearest": sign([f64], [f64]),
+  "f64.sqrt": sign([f64], [f64]),
+  "f64.add": sign([f64, f64], [f64]),
+  "f64.sub": sign([f64, f64], [f64]),
+  "f64.mul": sign([f64, f64], [f64]),
+  "f64.div": sign([f64, f64], [f64]),
+  "f64.min": sign([f64, f64], [f64]),
+  "f64.max": sign([f64, f64], [f64]),
+  "f64.copysign": sign([f64, f64], [f64]),
+  "i32.wrap/i64": sign([i64], [i32]),
+  "i32.trunc_s/f32": sign([f32], [i32]),
+  "i32.trunc_u/f32": sign([f32], [i32]),
+  "i32.trunc_s/f64": sign([f32], [i32]),
+  "i32.trunc_u/f64": sign([f64], [i32]),
+  "i64.extend_s/i32": sign([i32], [i64]),
+  "i64.extend_u/i32": sign([i32], [i64]),
+  "i64.trunc_s/f32": sign([f32], [i64]),
+  "i64.trunc_u/f32": sign([f32], [i64]),
+  "i64.trunc_s/f64": sign([f64], [i64]),
+  "i64.trunc_u/f64": sign([f64], [i64]),
+  "f32.convert_s/i32": sign([i32], [f32]),
+  "f32.convert_u/i32": sign([i32], [f32]),
+  "f32.convert_s/i64": sign([i64], [f32]),
+  "f32.convert_u/i64": sign([i64], [f32]),
+  "f32.demote/f64": sign([f64], [f32]),
+  "f64.convert_s/i32": sign([i32], [f64]),
+  "f64.convert_u/i32": sign([i32], [f64]),
+  "f64.convert_s/i64": sign([i64], [f64]),
+  "f64.convert_u/i64": sign([i64], [f64]),
+  "f64.promote/f32": sign([f32], [f64]),
+  "i32.reinterpret/f32": sign([f32], [i32]),
+  "i64.reinterpret/f64": sign([f64], [i64]),
+  "f32.reinterpret/i32": sign([i32], [f32]),
+  "f64.reinterpret/i64": sign([i64], [f64])
+};
+var signatures = Object.assign({}, controlInstructions, parametricInstructions, variableInstructions, memoryInstructions, numericInstructions);
+exports.signatures = signatures;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/ast-module-to-module-context/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/ast-module-to-module-context/index.js
new file mode 100644
index 0000000..20519e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/ast-module-to-module-context/index.js
@@ -0,0 +1,389 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.moduleContextFromModuleAST = moduleContextFromModuleAST;
+exports.ModuleContext = void 0;
+
+var _nodes = require("../../nodes.js");
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }
+
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }
+
+function moduleContextFromModuleAST(m) {
+  var moduleContext = new ModuleContext();
+
+  if (!(m.type === "Module")) {
+    throw new Error('m.type === "Module"' + " error: " + (undefined || "unknown"));
+  }
+
+  m.fields.forEach(function (field) {
+    switch (field.type) {
+      case "Start":
+        {
+          moduleContext.setStart(field.index);
+          break;
+        }
+
+      case "TypeInstruction":
+        {
+          moduleContext.addType(field);
+          break;
+        }
+
+      case "Func":
+        {
+          moduleContext.addFunction(field);
+          break;
+        }
+
+      case "Global":
+        {
+          moduleContext.defineGlobal(field);
+          break;
+        }
+
+      case "ModuleImport":
+        {
+          switch (field.descr.type) {
+            case "GlobalType":
+              {
+                moduleContext.importGlobal(field.descr.valtype, field.descr.mutability);
+                break;
+              }
+
+            case "Memory":
+              {
+                moduleContext.addMemory(field.descr.limits.min, field.descr.limits.max);
+                break;
+              }
+
+            case "FuncImportDescr":
+              {
+                moduleContext.importFunction(field.descr);
+                break;
+              }
+
+            case "Table":
+              {
+                // FIXME(sven): not implemented yet
+                break;
+              }
+
+            default:
+              throw new Error("Unsupported ModuleImport of type " + JSON.stringify(field.descr.type));
+          }
+
+          break;
+        }
+
+      case "Memory":
+        {
+          moduleContext.addMemory(field.limits.min, field.limits.max);
+          break;
+        }
+    }
+  });
+  return moduleContext;
+}
+/**
+ * Module context for type checking
+ */
+
+
+var ModuleContext =
+/*#__PURE__*/
+function () {
+  function ModuleContext() {
+    _classCallCheck(this, ModuleContext);
+
+    this.funcs = [];
+    this.funcsOffsetByIdentifier = [];
+    this.types = [];
+    this.globals = [];
+    this.globalsOffsetByIdentifier = [];
+    this.mems = []; // Current stack frame
+
+    this.locals = [];
+    this.labels = [];
+    this.return = [];
+    this.debugName = "unknown";
+    this.start = null;
+  }
+  /**
+   * Set start segment
+   */
+
+
+  _createClass(ModuleContext, [{
+    key: "setStart",
+    value: function setStart(index) {
+      this.start = index.value;
+    }
+    /**
+     * Get start function
+     */
+
+  }, {
+    key: "getStart",
+    value: function getStart() {
+      return this.start;
+    }
+    /**
+     * Reset the active stack frame
+     */
+
+  }, {
+    key: "newContext",
+    value: function newContext(debugName, expectedResult) {
+      this.locals = [];
+      this.labels = [expectedResult];
+      this.return = expectedResult;
+      this.debugName = debugName;
+    }
+    /**
+     * Functions
+     */
+
+  }, {
+    key: "addFunction",
+    value: function addFunction(func
+    /*: Func*/
+    ) {
+      // eslint-disable-next-line prefer-const
+      var _ref = func.signature || {},
+          _ref$params = _ref.params,
+          args = _ref$params === void 0 ? [] : _ref$params,
+          _ref$results = _ref.results,
+          result = _ref$results === void 0 ? [] : _ref$results;
+
+      args = args.map(function (arg) {
+        return arg.valtype;
+      });
+      this.funcs.push({
+        args: args,
+        result: result
+      });
+
+      if (typeof func.name !== "undefined") {
+        this.funcsOffsetByIdentifier[func.name.value] = this.funcs.length - 1;
+      }
+    }
+  }, {
+    key: "importFunction",
+    value: function importFunction(funcimport) {
+      if ((0, _nodes.isSignature)(funcimport.signature)) {
+        // eslint-disable-next-line prefer-const
+        var _funcimport$signature = funcimport.signature,
+            args = _funcimport$signature.params,
+            result = _funcimport$signature.results;
+        args = args.map(function (arg) {
+          return arg.valtype;
+        });
+        this.funcs.push({
+          args: args,
+          result: result
+        });
+      } else {
+        if (!(0, _nodes.isNumberLiteral)(funcimport.signature)) {
+          throw new Error('isNumberLiteral(funcimport.signature)' + " error: " + (undefined || "unknown"));
+        }
+
+        var typeId = funcimport.signature.value;
+
+        if (!this.hasType(typeId)) {
+          throw new Error('this.hasType(typeId)' + " error: " + (undefined || "unknown"));
+        }
+
+        var signature = this.getType(typeId);
+        this.funcs.push({
+          args: signature.params.map(function (arg) {
+            return arg.valtype;
+          }),
+          result: signature.results
+        });
+      }
+
+      if (typeof funcimport.id !== "undefined") {
+        // imports are first, we can assume their index in the array
+        this.funcsOffsetByIdentifier[funcimport.id.value] = this.funcs.length - 1;
+      }
+    }
+  }, {
+    key: "hasFunction",
+    value: function hasFunction(index) {
+      return typeof this.getFunction(index) !== "undefined";
+    }
+  }, {
+    key: "getFunction",
+    value: function getFunction(index) {
+      if (typeof index !== "number") {
+        throw new Error("getFunction only supported for number index");
+      }
+
+      return this.funcs[index];
+    }
+  }, {
+    key: "getFunctionOffsetByIdentifier",
+    value: function getFunctionOffsetByIdentifier(name) {
+      if (!(typeof name === "string")) {
+        throw new Error('typeof name === "string"' + " error: " + (undefined || "unknown"));
+      }
+
+      return this.funcsOffsetByIdentifier[name];
+    }
+    /**
+     * Labels
+     */
+
+  }, {
+    key: "addLabel",
+    value: function addLabel(result) {
+      this.labels.unshift(result);
+    }
+  }, {
+    key: "hasLabel",
+    value: function hasLabel(index) {
+      return this.labels.length > index && index >= 0;
+    }
+  }, {
+    key: "getLabel",
+    value: function getLabel(index) {
+      return this.labels[index];
+    }
+  }, {
+    key: "popLabel",
+    value: function popLabel() {
+      this.labels.shift();
+    }
+    /**
+     * Locals
+     */
+
+  }, {
+    key: "hasLocal",
+    value: function hasLocal(index) {
+      return typeof this.getLocal(index) !== "undefined";
+    }
+  }, {
+    key: "getLocal",
+    value: function getLocal(index) {
+      return this.locals[index];
+    }
+  }, {
+    key: "addLocal",
+    value: function addLocal(type) {
+      this.locals.push(type);
+    }
+    /**
+     * Types
+     */
+
+  }, {
+    key: "addType",
+    value: function addType(type) {
+      if (!(type.functype.type === "Signature")) {
+        throw new Error('type.functype.type === "Signature"' + " error: " + (undefined || "unknown"));
+      }
+
+      this.types.push(type.functype);
+    }
+  }, {
+    key: "hasType",
+    value: function hasType(index) {
+      return this.types[index] !== undefined;
+    }
+  }, {
+    key: "getType",
+    value: function getType(index) {
+      return this.types[index];
+    }
+    /**
+     * Globals
+     */
+
+  }, {
+    key: "hasGlobal",
+    value: function hasGlobal(index) {
+      return this.globals.length > index && index >= 0;
+    }
+  }, {
+    key: "getGlobal",
+    value: function getGlobal(index) {
+      return this.globals[index].type;
+    }
+  }, {
+    key: "getGlobalOffsetByIdentifier",
+    value: function getGlobalOffsetByIdentifier(name) {
+      if (!(typeof name === "string")) {
+        throw new Error('typeof name === "string"' + " error: " + (undefined || "unknown"));
+      }
+
+      return this.globalsOffsetByIdentifier[name];
+    }
+  }, {
+    key: "defineGlobal",
+    value: function defineGlobal(global
+    /*: Global*/
+    ) {
+      var type = global.globalType.valtype;
+      var mutability = global.globalType.mutability;
+      this.globals.push({
+        type: type,
+        mutability: mutability
+      });
+
+      if (typeof global.name !== "undefined") {
+        this.globalsOffsetByIdentifier[global.name.value] = this.globals.length - 1;
+      }
+    }
+  }, {
+    key: "importGlobal",
+    value: function importGlobal(type, mutability) {
+      this.globals.push({
+        type: type,
+        mutability: mutability
+      });
+    }
+  }, {
+    key: "isMutableGlobal",
+    value: function isMutableGlobal(index) {
+      return this.globals[index].mutability === "var";
+    }
+  }, {
+    key: "isImmutableGlobal",
+    value: function isImmutableGlobal(index) {
+      return this.globals[index].mutability === "const";
+    }
+    /**
+     * Memories
+     */
+
+  }, {
+    key: "hasMemory",
+    value: function hasMemory(index) {
+      return this.mems.length > index && index >= 0;
+    }
+  }, {
+    key: "addMemory",
+    value: function addMemory(min, max) {
+      this.mems.push({
+        min: min,
+        max: max
+      });
+    }
+  }, {
+    key: "getMemory",
+    value: function getMemory(index) {
+      return this.mems[index];
+    }
+  }]);
+
+  return ModuleContext;
+}();
+
+exports.ModuleContext = ModuleContext;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/denormalize-type-references/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/denormalize-type-references/index.js
new file mode 100644
index 0000000..3258f84
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/denormalize-type-references/index.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.transform = transform;
+
+var t = require("../../index"); // func and call_indirect instructions can either define a signature inline, or
+// reference a signature, e.g.
+//
+// ;; inline signature
+// (func (result i64)
+//   (i64.const 2)
+// )
+// ;; signature reference
+// (type (func (result i64)))
+// (func (type 0)
+//   (i64.const 2))
+// )
+//
+// this AST transform denormalises the type references, making all signatures within the module
+// inline.
+
+
+function transform(ast) {
+  var typeInstructions = [];
+  t.traverse(ast, {
+    TypeInstruction: function TypeInstruction(_ref) {
+      var node = _ref.node;
+      typeInstructions.push(node);
+    }
+  });
+
+  if (!typeInstructions.length) {
+    return;
+  }
+
+  function denormalizeSignature(signature) {
+    // signature referenced by identifier
+    if (signature.type === "Identifier") {
+      var identifier = signature;
+      var typeInstruction = typeInstructions.find(function (t) {
+        return t.id.type === identifier.type && t.id.value === identifier.value;
+      });
+
+      if (!typeInstruction) {
+        throw new Error("A type instruction reference was not found ".concat(JSON.stringify(signature)));
+      }
+
+      return typeInstruction.functype;
+    } // signature referenced by index
+
+
+    if (signature.type === "NumberLiteral") {
+      var signatureRef = signature;
+      var _typeInstruction = typeInstructions[signatureRef.value];
+      return _typeInstruction.functype;
+    }
+
+    return signature;
+  }
+
+  t.traverse(ast, {
+    Func: function (_Func) {
+      function Func(_x) {
+        return _Func.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func.toString();
+      };
+
+      return Func;
+    }(function (_ref2) {
+      var node = _ref2.node;
+      node.signature = denormalizeSignature(node.signature);
+    }),
+    CallIndirectInstruction: function CallIndirectInstruction(_ref3) {
+      var node = _ref3.node;
+      node.signature = denormalizeSignature(node.signature);
+    }
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/wast-identifier-to-index/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/wast-identifier-to-index/index.js
new file mode 100644
index 0000000..5f6394f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/transform/wast-identifier-to-index/index.js
@@ -0,0 +1,225 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.transform = transform;
+
+var _index = require("../../index");
+
+var _astModuleToModuleContext = require("../ast-module-to-module-context");
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+// FIXME(sven): do the same with all block instructions, must be more generic here
+function newUnexpectedFunction(i) {
+  return new Error("unknown function at offset: " + i);
+}
+
+function transform(ast) {
+  var module;
+  (0, _index.traverse)(ast, {
+    Module: function (_Module) {
+      function Module(_x) {
+        return _Module.apply(this, arguments);
+      }
+
+      Module.toString = function () {
+        return _Module.toString();
+      };
+
+      return Module;
+    }(function (path) {
+      module = path.node;
+    })
+  });
+  var moduleContext = (0, _astModuleToModuleContext.moduleContextFromModuleAST)(module); // Transform the actual instruction in function bodies
+
+  (0, _index.traverse)(ast, {
+    Func: function (_Func) {
+      function Func(_x2) {
+        return _Func.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func.toString();
+      };
+
+      return Func;
+    }(function (path) {
+      transformFuncPath(path, moduleContext);
+    }),
+    Start: function (_Start) {
+      function Start(_x3) {
+        return _Start.apply(this, arguments);
+      }
+
+      Start.toString = function () {
+        return _Start.toString();
+      };
+
+      return Start;
+    }(function (path) {
+      var index = path.node.index;
+
+      if ((0, _index.isIdentifier)(index) === true) {
+        var offsetInModule = moduleContext.getFunctionOffsetByIdentifier(index.value);
+
+        if (typeof offsetInModule === "undefined") {
+          throw newUnexpectedFunction(index.value);
+        } // Replace the index Identifier
+        // $FlowIgnore: reference?
+
+
+        path.node.index = (0, _index.numberLiteralFromRaw)(offsetInModule);
+      }
+    })
+  });
+}
+
+function transformFuncPath(funcPath, moduleContext) {
+  var funcNode = funcPath.node;
+  var signature = funcNode.signature;
+
+  if (signature.type !== "Signature") {
+    throw new Error("Function signatures must be denormalised before execution");
+  }
+
+  var params = signature.params; // Add func locals in the context
+
+  params.forEach(function (p) {
+    return moduleContext.addLocal(p.valtype);
+  });
+  (0, _index.traverse)(funcNode, {
+    Instr: function (_Instr) {
+      function Instr(_x4) {
+        return _Instr.apply(this, arguments);
+      }
+
+      Instr.toString = function () {
+        return _Instr.toString();
+      };
+
+      return Instr;
+    }(function (instrPath) {
+      var instrNode = instrPath.node;
+      /**
+       * Local access
+       */
+
+      if (instrNode.id === "get_local" || instrNode.id === "set_local" || instrNode.id === "tee_local") {
+        var _instrNode$args = _slicedToArray(instrNode.args, 1),
+            firstArg = _instrNode$args[0];
+
+        if (firstArg.type === "Identifier") {
+          var offsetInParams = params.findIndex(function (_ref) {
+            var id = _ref.id;
+            return id === firstArg.value;
+          });
+
+          if (offsetInParams === -1) {
+            throw new Error("".concat(firstArg.value, " not found in ").concat(instrNode.id, ": not declared in func params"));
+          } // Replace the Identifer node by our new NumberLiteral node
+
+
+          instrNode.args[0] = (0, _index.numberLiteralFromRaw)(offsetInParams);
+        }
+      }
+      /**
+       * Global access
+       */
+
+
+      if (instrNode.id === "get_global" || instrNode.id === "set_global") {
+        var _instrNode$args2 = _slicedToArray(instrNode.args, 1),
+            _firstArg = _instrNode$args2[0];
+
+        if ((0, _index.isIdentifier)(_firstArg) === true) {
+          var globalOffset = moduleContext.getGlobalOffsetByIdentifier( // $FlowIgnore: reference?
+          _firstArg.value);
+
+          if (typeof globalOffset === "undefined") {
+            // $FlowIgnore: reference?
+            throw new Error("global ".concat(_firstArg.value, " not found in module"));
+          } // Replace the Identifer node by our new NumberLiteral node
+
+
+          instrNode.args[0] = (0, _index.numberLiteralFromRaw)(globalOffset);
+        }
+      }
+      /**
+       * Labels lookup
+       */
+
+
+      if (instrNode.id === "br") {
+        var _instrNode$args3 = _slicedToArray(instrNode.args, 1),
+            _firstArg2 = _instrNode$args3[0];
+
+        if ((0, _index.isIdentifier)(_firstArg2) === true) {
+          // if the labels is not found it is going to be replaced with -1
+          // which is invalid.
+          var relativeBlockCount = -1; // $FlowIgnore: reference?
+
+          instrPath.findParent(function (_ref2) {
+            var node = _ref2.node;
+
+            if ((0, _index.isBlock)(node)) {
+              relativeBlockCount++; // $FlowIgnore: reference?
+
+              var name = node.label || node.name;
+
+              if (_typeof(name) === "object") {
+                // $FlowIgnore: isIdentifier ensures that
+                if (name.value === _firstArg2.value) {
+                  // Found it
+                  return false;
+                }
+              }
+            }
+
+            if ((0, _index.isFunc)(node)) {
+              return false;
+            }
+          }); // Replace the Identifer node by our new NumberLiteral node
+
+          instrNode.args[0] = (0, _index.numberLiteralFromRaw)(relativeBlockCount);
+        }
+      }
+    }),
+
+    /**
+     * Func lookup
+     */
+    CallInstruction: function (_CallInstruction) {
+      function CallInstruction(_x5) {
+        return _CallInstruction.apply(this, arguments);
+      }
+
+      CallInstruction.toString = function () {
+        return _CallInstruction.toString();
+      };
+
+      return CallInstruction;
+    }(function (_ref3) {
+      var node = _ref3.node;
+      var index = node.index;
+
+      if ((0, _index.isIdentifier)(index) === true) {
+        var offsetInModule = moduleContext.getFunctionOffsetByIdentifier(index.value);
+
+        if (typeof offsetInModule === "undefined") {
+          throw newUnexpectedFunction(index.value);
+        } // Replace the index Identifier
+        // $FlowIgnore: reference?
+
+
+        node.index = (0, _index.numberLiteralFromRaw)(offsetInModule);
+      }
+    })
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/traverse.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/traverse.js
new file mode 100644
index 0000000..86803ce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/traverse.js
@@ -0,0 +1,105 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.traverse = traverse;
+
+var _nodePath = require("./node-path");
+
+var _nodes = require("./nodes");
+
+// recursively walks the AST starting at the given node. The callback is invoked for
+// and object that has a 'type' property.
+function walk(context, callback) {
+  var stop = false;
+
+  function innerWalk(context, callback) {
+    if (stop) {
+      return;
+    }
+
+    var node = context.node;
+
+    if (node === undefined) {
+      console.warn("traversing with an empty context");
+      return;
+    }
+
+    if (node._deleted === true) {
+      return;
+    }
+
+    var path = (0, _nodePath.createPath)(context);
+    callback(node.type, path);
+
+    if (path.shouldStop) {
+      stop = true;
+      return;
+    }
+
+    Object.keys(node).forEach(function (prop) {
+      var value = node[prop];
+
+      if (value === null || value === undefined) {
+        return;
+      }
+
+      var valueAsArray = Array.isArray(value) ? value : [value];
+      valueAsArray.forEach(function (childNode) {
+        if (typeof childNode.type === "string") {
+          var childContext = {
+            node: childNode,
+            parentKey: prop,
+            parentPath: path,
+            shouldStop: false,
+            inList: Array.isArray(value)
+          };
+          innerWalk(childContext, callback);
+        }
+      });
+    });
+  }
+
+  innerWalk(context, callback);
+}
+
+var noop = function noop() {};
+
+function traverse(node, visitors) {
+  var before = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : noop;
+  var after = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : noop;
+  Object.keys(visitors).forEach(function (visitor) {
+    if (!_nodes.nodeAndUnionTypes.includes(visitor)) {
+      throw new Error("Unexpected visitor ".concat(visitor));
+    }
+  });
+  var context = {
+    node: node,
+    inList: false,
+    shouldStop: false,
+    parentPath: null,
+    parentKey: null
+  };
+  walk(context, function (type, path) {
+    if (typeof visitors[type] === "function") {
+      before(type, path);
+      visitors[type](path);
+      after(type, path);
+    }
+
+    var unionTypes = _nodes.unionTypesMap[type];
+
+    if (!unionTypes) {
+      throw new Error("Unexpected node type ".concat(type));
+    }
+
+    unionTypes.forEach(function (unionType) {
+      if (typeof visitors[unionType] === "function") {
+        before(unionType, path);
+        visitors[unionType](path);
+        after(unionType, path);
+      }
+    });
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/types/basic.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/types/basic.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/types/nodes.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/types/nodes.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/types/traverse.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/types/traverse.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/utils.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/utils.js
new file mode 100644
index 0000000..d8330fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/lib/utils.js
@@ -0,0 +1,306 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isAnonymous = isAnonymous;
+exports.getSectionMetadata = getSectionMetadata;
+exports.getSectionMetadatas = getSectionMetadatas;
+exports.sortSectionMetadata = sortSectionMetadata;
+exports.orderedInsertNode = orderedInsertNode;
+exports.assertHasLoc = assertHasLoc;
+exports.getEndOfSection = getEndOfSection;
+exports.shiftLoc = shiftLoc;
+exports.shiftSection = shiftSection;
+exports.signatureForOpcode = signatureForOpcode;
+exports.getUniqueNameGenerator = getUniqueNameGenerator;
+exports.getStartByteOffset = getStartByteOffset;
+exports.getEndByteOffset = getEndByteOffset;
+exports.getFunctionBeginingByteOffset = getFunctionBeginingByteOffset;
+exports.getEndBlockByteOffset = getEndBlockByteOffset;
+exports.getStartBlockByteOffset = getStartBlockByteOffset;
+
+var _signatures = require("./signatures");
+
+var _traverse = require("./traverse");
+
+var _helperWasmBytecode = _interopRequireWildcard(require("@webassemblyjs/helper-wasm-bytecode"));
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function isAnonymous(ident) {
+  return ident.raw === "";
+}
+
+function getSectionMetadata(ast, name) {
+  var section;
+  (0, _traverse.traverse)(ast, {
+    SectionMetadata: function (_SectionMetadata) {
+      function SectionMetadata(_x) {
+        return _SectionMetadata.apply(this, arguments);
+      }
+
+      SectionMetadata.toString = function () {
+        return _SectionMetadata.toString();
+      };
+
+      return SectionMetadata;
+    }(function (_ref) {
+      var node = _ref.node;
+
+      if (node.section === name) {
+        section = node;
+      }
+    })
+  });
+  return section;
+}
+
+function getSectionMetadatas(ast, name) {
+  var sections = [];
+  (0, _traverse.traverse)(ast, {
+    SectionMetadata: function (_SectionMetadata2) {
+      function SectionMetadata(_x2) {
+        return _SectionMetadata2.apply(this, arguments);
+      }
+
+      SectionMetadata.toString = function () {
+        return _SectionMetadata2.toString();
+      };
+
+      return SectionMetadata;
+    }(function (_ref2) {
+      var node = _ref2.node;
+
+      if (node.section === name) {
+        sections.push(node);
+      }
+    })
+  });
+  return sections;
+}
+
+function sortSectionMetadata(m) {
+  if (m.metadata == null) {
+    console.warn("sortSectionMetadata: no metadata to sort");
+    return;
+  } // $FlowIgnore
+
+
+  m.metadata.sections.sort(function (a, b) {
+    var aId = _helperWasmBytecode.default.sections[a.section];
+    var bId = _helperWasmBytecode.default.sections[b.section];
+
+    if (typeof aId !== "number" || typeof bId !== "number") {
+      throw new Error("Section id not found");
+    }
+
+    return aId - bId;
+  });
+}
+
+function orderedInsertNode(m, n) {
+  assertHasLoc(n);
+  var didInsert = false;
+
+  if (n.type === "ModuleExport") {
+    m.fields.push(n);
+    return;
+  }
+
+  m.fields = m.fields.reduce(function (acc, field) {
+    var fieldEndCol = Infinity;
+
+    if (field.loc != null) {
+      // $FlowIgnore
+      fieldEndCol = field.loc.end.column;
+    } // $FlowIgnore: assertHasLoc ensures that
+
+
+    if (didInsert === false && n.loc.start.column < fieldEndCol) {
+      didInsert = true;
+      acc.push(n);
+    }
+
+    acc.push(field);
+    return acc;
+  }, []); // Handles empty modules or n is the last element
+
+  if (didInsert === false) {
+    m.fields.push(n);
+  }
+}
+
+function assertHasLoc(n) {
+  if (n.loc == null || n.loc.start == null || n.loc.end == null) {
+    throw new Error("Internal failure: node (".concat(JSON.stringify(n.type), ") has no location information"));
+  }
+}
+
+function getEndOfSection(s) {
+  assertHasLoc(s.size);
+  return s.startOffset + s.size.value + ( // $FlowIgnore
+  s.size.loc.end.column - s.size.loc.start.column);
+}
+
+function shiftLoc(node, delta) {
+  // $FlowIgnore
+  node.loc.start.column += delta; // $FlowIgnore
+
+  node.loc.end.column += delta;
+}
+
+function shiftSection(ast, node, delta) {
+  if (node.type !== "SectionMetadata") {
+    throw new Error("Can not shift node " + JSON.stringify(node.type));
+  }
+
+  node.startOffset += delta;
+
+  if (_typeof(node.size.loc) === "object") {
+    shiftLoc(node.size, delta);
+  } // Custom sections doesn't have vectorOfSize
+
+
+  if (_typeof(node.vectorOfSize) === "object" && _typeof(node.vectorOfSize.loc) === "object") {
+    shiftLoc(node.vectorOfSize, delta);
+  }
+
+  var sectionName = node.section; // shift node locations within that section
+
+  (0, _traverse.traverse)(ast, {
+    Node: function Node(_ref3) {
+      var node = _ref3.node;
+      var section = (0, _helperWasmBytecode.getSectionForNode)(node);
+
+      if (section === sectionName && _typeof(node.loc) === "object") {
+        shiftLoc(node, delta);
+      }
+    }
+  });
+}
+
+function signatureForOpcode(object, name) {
+  var opcodeName = name;
+
+  if (object !== undefined && object !== "") {
+    opcodeName = object + "." + name;
+  }
+
+  var sign = _signatures.signatures[opcodeName];
+
+  if (sign == undefined) {
+    // TODO: Uncomment this when br_table and others has been done
+    //throw new Error("Invalid opcode: "+opcodeName);
+    return [object, object];
+  }
+
+  return sign[0];
+}
+
+function getUniqueNameGenerator() {
+  var inc = {};
+  return function () {
+    var prefix = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : "temp";
+
+    if (!(prefix in inc)) {
+      inc[prefix] = 0;
+    } else {
+      inc[prefix] = inc[prefix] + 1;
+    }
+
+    return prefix + "_" + inc[prefix];
+  };
+}
+
+function getStartByteOffset(n) {
+  // $FlowIgnore
+  if (typeof n.loc === "undefined" || typeof n.loc.start === "undefined") {
+    throw new Error( // $FlowIgnore
+    "Can not get byte offset without loc informations, node: " + String(n.id));
+  }
+
+  return n.loc.start.column;
+}
+
+function getEndByteOffset(n) {
+  // $FlowIgnore
+  if (typeof n.loc === "undefined" || typeof n.loc.end === "undefined") {
+    throw new Error("Can not get byte offset without loc informations, node: " + n.type);
+  }
+
+  return n.loc.end.column;
+}
+
+function getFunctionBeginingByteOffset(n) {
+  if (!(n.body.length > 0)) {
+    throw new Error('n.body.length > 0' + " error: " + (undefined || "unknown"));
+  }
+
+  var _n$body = _slicedToArray(n.body, 1),
+      firstInstruction = _n$body[0];
+
+  return getStartByteOffset(firstInstruction);
+}
+
+function getEndBlockByteOffset(n) {
+  // $FlowIgnore
+  if (!(n.instr.length > 0 || n.body.length > 0)) {
+    throw new Error('n.instr.length > 0 || n.body.length > 0' + " error: " + (undefined || "unknown"));
+  }
+
+  var lastInstruction;
+
+  if (n.instr) {
+    // $FlowIgnore
+    lastInstruction = n.instr[n.instr.length - 1];
+  }
+
+  if (n.body) {
+    // $FlowIgnore
+    lastInstruction = n.body[n.body.length - 1];
+  }
+
+  if (!(_typeof(lastInstruction) === "object")) {
+    throw new Error('typeof lastInstruction === "object"' + " error: " + (undefined || "unknown"));
+  }
+
+  // $FlowIgnore
+  return getStartByteOffset(lastInstruction);
+}
+
+function getStartBlockByteOffset(n) {
+  // $FlowIgnore
+  if (!(n.instr.length > 0 || n.body.length > 0)) {
+    throw new Error('n.instr.length > 0 || n.body.length > 0' + " error: " + (undefined || "unknown"));
+  }
+
+  var fistInstruction;
+
+  if (n.instr) {
+    // $FlowIgnore
+    var _n$instr = _slicedToArray(n.instr, 1);
+
+    fistInstruction = _n$instr[0];
+  }
+
+  if (n.body) {
+    // $FlowIgnore
+    var _n$body2 = _slicedToArray(n.body, 1);
+
+    fistInstruction = _n$body2[0];
+  }
+
+  if (!(_typeof(fistInstruction) === "object")) {
+    throw new Error('typeof fistInstruction === "object"' + " error: " + (undefined || "unknown"));
+  }
+
+  // $FlowIgnore
+  return getStartByteOffset(fistInstruction);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/package.json
new file mode 100644
index 0000000..6b09100
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/package.json
@@ -0,0 +1,32 @@
+{
+  "name": "@webassemblyjs/ast",
+  "version": "1.11.1",
+  "description": "AST utils for webassemblyjs",
+  "keywords": [
+    "webassembly",
+    "javascript",
+    "ast"
+  ],
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "dependencies": {
+    "@webassemblyjs/helper-numbers": "1.11.1",
+    "@webassemblyjs/helper-wasm-bytecode": "1.11.1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "devDependencies": {
+    "@webassemblyjs/helper-test-framework": "1.11.1",
+    "array.prototype.flatmap": "^1.2.1",
+    "dump-exports": "^0.1.0",
+    "mamacro": "^0.0.7"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/generateNodeUtils.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/generateNodeUtils.js
new file mode 100644
index 0000000..46178a9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/generateNodeUtils.js
@@ -0,0 +1,219 @@
+const definitions = require("../src/definitions");
+const flatMap = require("array.prototype.flatmap");
+const {
+  typeSignature,
+  iterateProps,
+  mapProps,
+  filterProps,
+  unique
+} = require("./util");
+
+const stdout = process.stdout;
+
+const jsTypes = ["string", "number", "boolean"];
+
+const quote = value => `"${value}"`;
+
+function params(fields) {
+  const optionalDefault = field => (field.default ? ` = ${field.default}` : "");
+  return mapProps(fields)
+    .map(field => `${typeSignature(field)}${optionalDefault(field)}`)
+    .join(",");
+}
+
+function assertParamType({ assertNodeType, array, name, type }) {
+  if (array) {
+    // TODO - assert contents of array?
+    return `assert(typeof ${name} === "object" && typeof ${name}.length !== "undefined")\n`;
+  } else {
+    if (jsTypes.includes(type)) {
+      return `assert(
+          typeof ${name} === "${type}",
+          "Argument ${name} must be of type ${type}, given: " + typeof ${name}
+      )`;
+    }
+
+    if (assertNodeType === true) {
+      return `assert(
+        ${name}.type === "${type}",
+        "Argument ${name} must be of type ${type}, given: " + ${name}.type
+      )`;
+    }
+
+    return "";
+  }
+}
+
+function assertParam(meta) {
+  const paramAssertion = assertParamType(meta);
+
+  if (paramAssertion === "") {
+    return "";
+  }
+
+  if (meta.maybe || meta.optional) {
+    return `
+      if (${meta.name} !== null && ${meta.name} !== undefined) {
+        ${paramAssertion};
+      }
+    `;
+  } else {
+    return paramAssertion;
+  }
+}
+
+function assertParams(fields) {
+  return mapProps(fields)
+    .map(assertParam)
+    .join("\n");
+}
+
+function buildObject(typeDef) {
+  const optionalField = meta => {
+    if (meta.array) {
+      // omit optional array properties if the constructor function was supplied
+      // with an empty array
+      return `
+        if (typeof ${meta.name} !== "undefined" && ${meta.name}.length > 0) {
+          node.${meta.name} = ${meta.name};
+        }
+      `;
+    } else if (meta.type === "Object") {
+      // omit optional object properties if they have no keys
+      return `
+        if (typeof ${meta.name} !== "undefined" && Object.keys(${
+        meta.name
+      }).length !== 0) {
+          node.${meta.name} = ${meta.name};
+        }
+      `;
+    } else if (meta.type === "boolean") {
+      // omit optional boolean properties if they are not true
+      return `
+        if (${meta.name} === true) {
+          node.${meta.name} = true;
+        }
+      `;
+    } else {
+      return `
+        if (typeof ${meta.name} !== "undefined") {
+          node.${meta.name} = ${meta.name};
+        }
+      `;
+    }
+  };
+
+  const fields = mapProps(typeDef.fields)
+    .filter(f => !f.optional && !f.constant)
+    .map(f => f.name);
+
+  const constants = mapProps(typeDef.fields)
+    .filter(f => f.constant)
+    .map(f => `${f.name}: "${f.value}"`);
+
+  return `
+    const node: ${typeDef.flowTypeName || typeDef.name} = {
+      type: "${typeDef.name}",
+      ${constants.concat(fields).join(",")}
+    }
+
+    ${mapProps(typeDef.fields)
+      .filter(f => f.optional)
+      .map(optionalField)
+      .join("")}
+  `;
+}
+
+function lowerCamelCase(name) {
+  return name.substring(0, 1).toLowerCase() + name.substring(1);
+}
+
+function generate() {
+  stdout.write(`
+    // @flow
+
+    // THIS FILE IS AUTOGENERATED
+    // see scripts/generateNodeUtils.js
+
+    import { assert } from "mamacro";
+
+    function isTypeOf(t: string) {
+      return (n: Node) => n.type === t;
+    }
+
+    function assertTypeOf(t: string) {
+      return (n: Node) => assert(n.type === t);
+    }
+  `);
+
+  // Node builders
+  iterateProps(definitions, typeDefinition => {
+    stdout.write(`
+      export function ${lowerCamelCase(typeDefinition.name)} (
+        ${params(filterProps(typeDefinition.fields, f => !f.constant))}
+      ): ${typeDefinition.name} {
+
+        ${assertParams(filterProps(typeDefinition.fields, f => !f.constant))}
+        ${buildObject(typeDefinition)} 
+
+        return node;
+      }
+    `);
+  });
+
+  // Node testers
+  iterateProps(definitions, typeDefinition => {
+    stdout.write(`
+      export const is${typeDefinition.name} =
+        isTypeOf("${typeDefinition.name}");
+    `);
+  });
+
+  // Node union type testers
+  const unionTypes = unique(
+    flatMap(mapProps(definitions).filter(d => d.unionType), d => d.unionType)
+  );
+  unionTypes.forEach(unionType => {
+    stdout.write(
+      `
+      export const is${unionType} = (node: Node) => ` +
+        mapProps(definitions)
+          .filter(d => d.unionType && d.unionType.includes(unionType))
+          .map(d => `is${d.name}(node) `)
+          .join("||") +
+        ";\n\n"
+    );
+  });
+
+  // Node assertion
+  iterateProps(definitions, typeDefinition => {
+    stdout.write(`
+      export const assert${typeDefinition.name} =
+        assertTypeOf("${typeDefinition.name}");
+    `);
+  });
+
+  // a map from node type to its set of union types
+  stdout.write(
+    `
+    export const unionTypesMap = {` +
+      mapProps(definitions)
+        .filter(d => d.unionType)
+        .map(t => `"${t.name}": [${t.unionType.map(quote).join(",")}]\n`) +
+      `};
+      `
+  );
+
+  // an array of all node and union types
+  stdout.write(
+    `
+    export const nodeAndUnionTypes = [` +
+      mapProps(definitions)
+        .map(t => `"${t.name}"`)
+        .concat(unionTypes.map(quote))
+        .join(",") +
+      `];`
+  );
+}
+
+generate();
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/generateTypeDefinitions.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/generateTypeDefinitions.js
new file mode 100644
index 0000000..99ba0ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/generateTypeDefinitions.js
@@ -0,0 +1,47 @@
+const definitions = require("../src/definitions");
+const flatMap = require("array.prototype.flatmap");
+const { typeSignature, mapProps, iterateProps, unique } = require("./util");
+
+const stdout = process.stdout;
+
+function params(fields) {
+  return mapProps(fields)
+    .map(typeSignature)
+    .join(",");
+}
+
+function generate() {
+  stdout.write(`
+    // @flow
+    /* eslint no-unused-vars: off */
+
+    // THIS FILE IS AUTOGENERATED
+    // see scripts/generateTypeDefinitions.js
+  `);
+
+  // generate union types
+  const unionTypes = unique(
+    flatMap(mapProps(definitions).filter(d => d.unionType), d => d.unionType)
+  );
+  unionTypes.forEach(unionType => {
+    stdout.write(
+      `type ${unionType} = ` +
+        mapProps(definitions)
+          .filter(d => d.unionType && d.unionType.includes(unionType))
+          .map(d => d.name)
+          .join("|") +
+        ";\n\n"
+    );
+  });
+
+  // generate the type definitions
+  iterateProps(definitions, typeDef => {
+    stdout.write(`type ${typeDef.name} = {
+        ...BaseNode,
+        type: "${typeDef.name}",
+        ${params(typeDef.fields)}
+      };\n\n`);
+  });
+}
+
+generate();
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/util.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/util.js
new file mode 100644
index 0000000..c2ccfa0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ast/scripts/util.js
@@ -0,0 +1,38 @@
+function iterateProps(obj, iterator) {
+  Object.keys(obj).forEach(key => iterator({ ...obj[key], name: key }));
+}
+
+function mapProps(obj) {
+  return Object.keys(obj).map(key => ({ ...obj[key], name: key }));
+}
+
+function filterProps(obj, filter) {
+  const ret = {};
+  Object.keys(obj).forEach(key => {
+    if (filter(obj[key])) {
+      ret[key] = obj[key];
+    }
+  });
+  return ret;
+}
+
+function typeSignature(meta) {
+  const type = meta.array ? `Array<${meta.type}>` : meta.type;
+  if (meta.optional) {
+    return `${meta.name}?: ${type}`;
+  } else if (meta.maybe) {
+    return `${meta.name}: ?${type}`;
+  } else {
+    return `${meta.name}: ${type}`;
+  }
+}
+
+const unique = items => Array.from(new Set(items));
+
+module.exports = {
+  iterateProps,
+  mapProps,
+  filterProps,
+  typeSignature,
+  unique
+};
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/LICENSE
new file mode 100644
index 0000000..d5471f8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 Mauro Bringolf
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/README.md b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/README.md
new file mode 100644
index 0000000..648e09b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/README.md
@@ -0,0 +1,34 @@
+# Parser function for floating point hexadecimals
+
+[![license](https://img.shields.io/github/license/maurobringolf/@webassemblyjs/floating-point-hex-parser.svg)]()
+[![GitHub last commit](https://img.shields.io/github/last-commit/maurobringolf/@webassemblyjs/floating-point-hex-parser.svg)]()
+[![npm](https://img.shields.io/npm/v/@webassemblyjs/floating-point-hex-parser.svg)]()
+
+> A JavaScript function to parse floating point hexadecimals as defined by the [WebAssembly specification](https://webassembly.github.io/spec/core/text/values.html#text-hexfloat).
+
+## Usage
+
+```javascript
+import parseHexFloat from '@webassemblyjs/floating-point-hex-parser'
+
+parseHexFloat('0x1p-1')               // 0.5
+parseHexFloat('0x1.921fb54442d18p+2') // 6.283185307179586
+```
+
+## Tests
+
+This module is tested in two ways. The first one is through a small set of test cases that can be found in [test/regular.test.js](https://github.com/maurobringolf/@webassemblyjs/floating-point-hex-parser/blob/master/test/regular.test.js). The second one is non-deterministic (sometimes called *fuzzing*):
+
+1. Generate a random IEEE754 double precision value `x`.
+1. Compute its representation `y` in floating point hexadecimal format using the C standard library function `printf` since C supports this format.
+1. Give both values to JS testcase and see if `parseHexFloat(y) === x`.
+
+By default one `npm test` run tests 100 random samples. If you want to do more, you can set the environment variable `FUZZ_AMOUNT` to whatever number of runs you'd like. Because it uses one child process for each sample, it is really slow though. For more details about the randomized tests see [the source](https://github.com/maurobringolf/@webassemblyjs/floating-point-hex-parser/tree/master/test/fuzzing).
+
+## Links
+
+* [maurobringolf.ch/2017/12/hexadecimal-floating-point-notation/](https://maurobringolf.ch/2017/12/hexadecimal-floating-point-notation/)
+
+* [github.com/xtuc/js-webassembly-interpreter/issues/32](https://github.com/xtuc/js-webassembly-interpreter/issues/32)
+
+* [github.com/WebAssembly/design/issues/292](https://github.com/WebAssembly/design/issues/292)
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/esm/index.js
new file mode 100644
index 0000000..d8d858d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/esm/index.js
@@ -0,0 +1,42 @@
+export default function parse(input) {
+  input = input.toUpperCase();
+  var splitIndex = input.indexOf("P");
+  var mantissa, exponent;
+
+  if (splitIndex !== -1) {
+    mantissa = input.substring(0, splitIndex);
+    exponent = parseInt(input.substring(splitIndex + 1));
+  } else {
+    mantissa = input;
+    exponent = 0;
+  }
+
+  var dotIndex = mantissa.indexOf(".");
+
+  if (dotIndex !== -1) {
+    var integerPart = parseInt(mantissa.substring(0, dotIndex), 16);
+    var sign = Math.sign(integerPart);
+    integerPart = sign * integerPart;
+    var fractionLength = mantissa.length - dotIndex - 1;
+    var fractionalPart = parseInt(mantissa.substring(dotIndex + 1), 16);
+    var fraction = fractionLength > 0 ? fractionalPart / Math.pow(16, fractionLength) : 0;
+
+    if (sign === 0) {
+      if (fraction === 0) {
+        mantissa = sign;
+      } else {
+        if (Object.is(sign, -0)) {
+          mantissa = -fraction;
+        } else {
+          mantissa = fraction;
+        }
+      }
+    } else {
+      mantissa = sign * (integerPart + fraction);
+    }
+  } else {
+    mantissa = parseInt(mantissa, 16);
+  }
+
+  return mantissa * (splitIndex !== -1 ? Math.pow(2, exponent) : 1);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/lib/index.js
new file mode 100644
index 0000000..a867699
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/lib/index.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = parse;
+
+function parse(input) {
+  input = input.toUpperCase();
+  var splitIndex = input.indexOf("P");
+  var mantissa, exponent;
+
+  if (splitIndex !== -1) {
+    mantissa = input.substring(0, splitIndex);
+    exponent = parseInt(input.substring(splitIndex + 1));
+  } else {
+    mantissa = input;
+    exponent = 0;
+  }
+
+  var dotIndex = mantissa.indexOf(".");
+
+  if (dotIndex !== -1) {
+    var integerPart = parseInt(mantissa.substring(0, dotIndex), 16);
+    var sign = Math.sign(integerPart);
+    integerPart = sign * integerPart;
+    var fractionLength = mantissa.length - dotIndex - 1;
+    var fractionalPart = parseInt(mantissa.substring(dotIndex + 1), 16);
+    var fraction = fractionLength > 0 ? fractionalPart / Math.pow(16, fractionLength) : 0;
+
+    if (sign === 0) {
+      if (fraction === 0) {
+        mantissa = sign;
+      } else {
+        if (Object.is(sign, -0)) {
+          mantissa = -fraction;
+        } else {
+          mantissa = fraction;
+        }
+      }
+    } else {
+      mantissa = sign * (integerPart + fraction);
+    }
+  } else {
+    mantissa = parseInt(mantissa, 16);
+  }
+
+  return mantissa * (splitIndex !== -1 ? Math.pow(2, exponent) : 1);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/package.json
new file mode 100644
index 0000000..ca1ff7e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/floating-point-hex-parser/package.json
@@ -0,0 +1,24 @@
+{
+  "name": "@webassemblyjs/floating-point-hex-parser",
+  "scripts": {
+    "build-fuzzer": "[ -f ./test/fuzzing/parse.out ] || gcc ./test/fuzzing/parse.c -o ./test/fuzzing/parse.out -lm -Wall"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "version": "1.11.1",
+  "description": "A function to parse floating point hexadecimal strings as defined by the WebAssembly specification",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "keywords": [
+    "webassembly",
+    "floating-point"
+  ],
+  "author": "Mauro Bringolf",
+  "license": "MIT",
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/esm/index.js
new file mode 100644
index 0000000..869d480
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/esm/index.js
@@ -0,0 +1,47 @@
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
+
+function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }
+
+export var RuntimeError =
+/*#__PURE__*/
+function (_Error) {
+  _inherits(RuntimeError, _Error);
+
+  function RuntimeError() {
+    _classCallCheck(this, RuntimeError);
+
+    return _possibleConstructorReturn(this, (RuntimeError.__proto__ || Object.getPrototypeOf(RuntimeError)).apply(this, arguments));
+  }
+
+  return RuntimeError;
+}(Error);
+export var CompileError =
+/*#__PURE__*/
+function (_Error2) {
+  _inherits(CompileError, _Error2);
+
+  function CompileError() {
+    _classCallCheck(this, CompileError);
+
+    return _possibleConstructorReturn(this, (CompileError.__proto__ || Object.getPrototypeOf(CompileError)).apply(this, arguments));
+  }
+
+  return CompileError;
+}(Error);
+export var LinkError =
+/*#__PURE__*/
+function (_Error3) {
+  _inherits(LinkError, _Error3);
+
+  function LinkError() {
+    _classCallCheck(this, LinkError);
+
+    return _possibleConstructorReturn(this, (LinkError.__proto__ || Object.getPrototypeOf(LinkError)).apply(this, arguments));
+  }
+
+  return LinkError;
+}(Error);
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/lib/index.js
new file mode 100644
index 0000000..926ec47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/lib/index.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LinkError = exports.CompileError = exports.RuntimeError = void 0;
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
+
+function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }
+
+var RuntimeError =
+/*#__PURE__*/
+function (_Error) {
+  _inherits(RuntimeError, _Error);
+
+  function RuntimeError() {
+    _classCallCheck(this, RuntimeError);
+
+    return _possibleConstructorReturn(this, (RuntimeError.__proto__ || Object.getPrototypeOf(RuntimeError)).apply(this, arguments));
+  }
+
+  return RuntimeError;
+}(Error);
+
+exports.RuntimeError = RuntimeError;
+
+var CompileError =
+/*#__PURE__*/
+function (_Error2) {
+  _inherits(CompileError, _Error2);
+
+  function CompileError() {
+    _classCallCheck(this, CompileError);
+
+    return _possibleConstructorReturn(this, (CompileError.__proto__ || Object.getPrototypeOf(CompileError)).apply(this, arguments));
+  }
+
+  return CompileError;
+}(Error);
+
+exports.CompileError = CompileError;
+
+var LinkError =
+/*#__PURE__*/
+function (_Error3) {
+  _inherits(LinkError, _Error3);
+
+  function LinkError() {
+    _classCallCheck(this, LinkError);
+
+    return _possibleConstructorReturn(this, (LinkError.__proto__ || Object.getPrototypeOf(LinkError)).apply(this, arguments));
+  }
+
+  return LinkError;
+}(Error);
+
+exports.LinkError = LinkError;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/package.json
new file mode 100644
index 0000000..d239044
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-api-error/package.json
@@ -0,0 +1,18 @@
+{
+  "name": "@webassemblyjs/helper-api-error",
+  "version": "1.11.1",
+  "description": "Common API errors",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git",
+    "directory": "packages/helper-api-error"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/esm/compare.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/esm/compare.js
new file mode 100644
index 0000000..8cea6b3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/esm/compare.js
@@ -0,0 +1,65 @@
+// this are dev dependencies
+var diff = require("jest-diff");
+
+var _require = require("jest-diff/build/constants"),
+    NO_DIFF_MESSAGE = _require.NO_DIFF_MESSAGE;
+
+var _require2 = require("@webassemblyjs/wasm-parser"),
+    decode = _require2.decode;
+
+var oldConsoleLog = console.log;
+export function compareArrayBuffers(l, r) {
+  /**
+   * Decode left
+   */
+  var bufferL = "";
+
+  console.log = function () {
+    for (var _len = arguments.length, texts = new Array(_len), _key = 0; _key < _len; _key++) {
+      texts[_key] = arguments[_key];
+    }
+
+    return bufferL += texts.join("") + "\n";
+  };
+
+  try {
+    decode(l, {
+      dump: true
+    });
+  } catch (e) {
+    console.error(bufferL);
+    console.error(e);
+    throw e;
+  }
+  /**
+   * Decode right
+   */
+
+
+  var bufferR = "";
+
+  console.log = function () {
+    for (var _len2 = arguments.length, texts = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      texts[_key2] = arguments[_key2];
+    }
+
+    return bufferR += texts.join("") + "\n";
+  };
+
+  try {
+    decode(r, {
+      dump: true
+    });
+  } catch (e) {
+    console.error(bufferR);
+    console.error(e);
+    throw e;
+  }
+
+  console.log = oldConsoleLog;
+  var out = diff(bufferL, bufferR);
+
+  if (out !== null && out !== NO_DIFF_MESSAGE) {
+    throw new Error("\n" + out);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/esm/index.js
new file mode 100644
index 0000000..2c35b9e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/esm/index.js
@@ -0,0 +1,67 @@
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function concatUint8Arrays() {
+  for (var _len = arguments.length, arrays = new Array(_len), _key = 0; _key < _len; _key++) {
+    arrays[_key] = arguments[_key];
+  }
+
+  var totalLength = arrays.reduce(function (a, b) {
+    return a + b.length;
+  }, 0);
+  var result = new Uint8Array(totalLength);
+  var offset = 0;
+
+  for (var _i = 0; _i < arrays.length; _i++) {
+    var arr = arrays[_i];
+
+    if (arr instanceof Uint8Array === false) {
+      throw new Error("arr must be of type Uint8Array");
+    }
+
+    result.set(arr, offset);
+    offset += arr.length;
+  }
+
+  return result;
+}
+
+export function overrideBytesInBuffer(buffer, startLoc, endLoc, newBytes) {
+  var beforeBytes = buffer.slice(0, startLoc);
+  var afterBytes = buffer.slice(endLoc, buffer.length); // replacement is empty, we can omit it
+
+  if (newBytes.length === 0) {
+    return concatUint8Arrays(beforeBytes, afterBytes);
+  }
+
+  var replacement = Uint8Array.from(newBytes);
+  return concatUint8Arrays(beforeBytes, replacement, afterBytes);
+}
+export function makeBuffer() {
+  for (var _len2 = arguments.length, splitedBytes = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+    splitedBytes[_key2] = arguments[_key2];
+  }
+
+  var bytes = [].concat.apply([], splitedBytes);
+  return new Uint8Array(bytes).buffer;
+}
+export function fromHexdump(str) {
+  var lines = str.split("\n"); // remove any leading left whitespace
+
+  lines = lines.map(function (line) {
+    return line.trim();
+  });
+  var bytes = lines.reduce(function (acc, line) {
+    var cols = line.split(" "); // remove the offset, left column
+
+    cols.shift();
+    cols = cols.filter(function (x) {
+      return x !== "";
+    });
+    var bytes = cols.map(function (x) {
+      return parseInt(x, 16);
+    });
+    acc.push.apply(acc, _toConsumableArray(bytes));
+    return acc;
+  }, []);
+  return Buffer.from(bytes);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/lib/compare.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/lib/compare.js
new file mode 100644
index 0000000..b30dc07
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/lib/compare.js
@@ -0,0 +1,73 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareArrayBuffers = compareArrayBuffers;
+
+// this are dev dependencies
+var diff = require("jest-diff");
+
+var _require = require("jest-diff/build/constants"),
+    NO_DIFF_MESSAGE = _require.NO_DIFF_MESSAGE;
+
+var _require2 = require("@webassemblyjs/wasm-parser"),
+    decode = _require2.decode;
+
+var oldConsoleLog = console.log;
+
+function compareArrayBuffers(l, r) {
+  /**
+   * Decode left
+   */
+  var bufferL = "";
+
+  console.log = function () {
+    for (var _len = arguments.length, texts = new Array(_len), _key = 0; _key < _len; _key++) {
+      texts[_key] = arguments[_key];
+    }
+
+    return bufferL += texts.join("") + "\n";
+  };
+
+  try {
+    decode(l, {
+      dump: true
+    });
+  } catch (e) {
+    console.error(bufferL);
+    console.error(e);
+    throw e;
+  }
+  /**
+   * Decode right
+   */
+
+
+  var bufferR = "";
+
+  console.log = function () {
+    for (var _len2 = arguments.length, texts = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      texts[_key2] = arguments[_key2];
+    }
+
+    return bufferR += texts.join("") + "\n";
+  };
+
+  try {
+    decode(r, {
+      dump: true
+    });
+  } catch (e) {
+    console.error(bufferR);
+    console.error(e);
+    throw e;
+  }
+
+  console.log = oldConsoleLog;
+  var out = diff(bufferL, bufferR);
+
+  if (out !== null && out !== NO_DIFF_MESSAGE) {
+    throw new Error("\n" + out);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/lib/index.js
new file mode 100644
index 0000000..b735b1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/lib/index.js
@@ -0,0 +1,78 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.overrideBytesInBuffer = overrideBytesInBuffer;
+exports.makeBuffer = makeBuffer;
+exports.fromHexdump = fromHexdump;
+
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function concatUint8Arrays() {
+  for (var _len = arguments.length, arrays = new Array(_len), _key = 0; _key < _len; _key++) {
+    arrays[_key] = arguments[_key];
+  }
+
+  var totalLength = arrays.reduce(function (a, b) {
+    return a + b.length;
+  }, 0);
+  var result = new Uint8Array(totalLength);
+  var offset = 0;
+
+  for (var _i = 0; _i < arrays.length; _i++) {
+    var arr = arrays[_i];
+
+    if (arr instanceof Uint8Array === false) {
+      throw new Error("arr must be of type Uint8Array");
+    }
+
+    result.set(arr, offset);
+    offset += arr.length;
+  }
+
+  return result;
+}
+
+function overrideBytesInBuffer(buffer, startLoc, endLoc, newBytes) {
+  var beforeBytes = buffer.slice(0, startLoc);
+  var afterBytes = buffer.slice(endLoc, buffer.length); // replacement is empty, we can omit it
+
+  if (newBytes.length === 0) {
+    return concatUint8Arrays(beforeBytes, afterBytes);
+  }
+
+  var replacement = Uint8Array.from(newBytes);
+  return concatUint8Arrays(beforeBytes, replacement, afterBytes);
+}
+
+function makeBuffer() {
+  for (var _len2 = arguments.length, splitedBytes = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+    splitedBytes[_key2] = arguments[_key2];
+  }
+
+  var bytes = [].concat.apply([], splitedBytes);
+  return new Uint8Array(bytes).buffer;
+}
+
+function fromHexdump(str) {
+  var lines = str.split("\n"); // remove any leading left whitespace
+
+  lines = lines.map(function (line) {
+    return line.trim();
+  });
+  var bytes = lines.reduce(function (acc, line) {
+    var cols = line.split(" "); // remove the offset, left column
+
+    cols.shift();
+    cols = cols.filter(function (x) {
+      return x !== "";
+    });
+    var bytes = cols.map(function (x) {
+      return parseInt(x, 16);
+    });
+    acc.push.apply(acc, _toConsumableArray(bytes));
+    return acc;
+  }, []);
+  return Buffer.from(bytes);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/package.json
new file mode 100644
index 0000000..55ba646
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-buffer/package.json
@@ -0,0 +1,24 @@
+{
+  "name": "@webassemblyjs/helper-buffer",
+  "version": "1.11.1",
+  "description": "Buffer manipulation utility",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "devDependencies": {
+    "@webassemblyjs/wasm-parser": "1.11.1",
+    "jest-diff": "^24.0.0"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/esm/index.js
new file mode 100644
index 0000000..98b8996
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/esm/index.js
@@ -0,0 +1,91 @@
+import Long from "@xtuc/long";
+import parseHexFloat from "@webassemblyjs/floating-point-hex-parser";
+import { CompileError } from "@webassemblyjs/helper-api-error";
+export function parse32F(sourceString) {
+  if (isHexLiteral(sourceString)) {
+    return parseHexFloat(sourceString);
+  }
+
+  if (isInfLiteral(sourceString)) {
+    return sourceString[0] === "-" ? -1 : 1;
+  }
+
+  if (isNanLiteral(sourceString)) {
+    return (sourceString[0] === "-" ? -1 : 1) * (sourceString.includes(":") ? parseInt(sourceString.substring(sourceString.indexOf(":") + 1), 16) : 0x400000);
+  }
+
+  return parseFloat(sourceString);
+}
+export function parse64F(sourceString) {
+  if (isHexLiteral(sourceString)) {
+    return parseHexFloat(sourceString);
+  }
+
+  if (isInfLiteral(sourceString)) {
+    return sourceString[0] === "-" ? -1 : 1;
+  }
+
+  if (isNanLiteral(sourceString)) {
+    return (sourceString[0] === "-" ? -1 : 1) * (sourceString.includes(":") ? parseInt(sourceString.substring(sourceString.indexOf(":") + 1), 16) : 0x8000000000000);
+  }
+
+  if (isHexLiteral(sourceString)) {
+    return parseHexFloat(sourceString);
+  }
+
+  return parseFloat(sourceString);
+}
+export function parse32I(sourceString) {
+  var value = 0;
+
+  if (isHexLiteral(sourceString)) {
+    value = ~~parseInt(sourceString, 16);
+  } else if (isDecimalExponentLiteral(sourceString)) {
+    throw new Error("This number literal format is yet to be implemented.");
+  } else {
+    value = parseInt(sourceString, 10);
+  }
+
+  return value;
+}
+export function parseU32(sourceString) {
+  var value = parse32I(sourceString);
+
+  if (value < 0) {
+    throw new CompileError("Illegal value for u32: " + sourceString);
+  }
+
+  return value;
+}
+export function parse64I(sourceString) {
+  var long;
+
+  if (isHexLiteral(sourceString)) {
+    long = Long.fromString(sourceString, false, 16);
+  } else if (isDecimalExponentLiteral(sourceString)) {
+    throw new Error("This number literal format is yet to be implemented.");
+  } else {
+    long = Long.fromString(sourceString);
+  }
+
+  return {
+    high: long.high,
+    low: long.low
+  };
+}
+var NAN_WORD = /^\+?-?nan/;
+var INF_WORD = /^\+?-?inf/;
+export function isInfLiteral(sourceString) {
+  return INF_WORD.test(sourceString.toLowerCase());
+}
+export function isNanLiteral(sourceString) {
+  return NAN_WORD.test(sourceString.toLowerCase());
+}
+
+function isDecimalExponentLiteral(sourceString) {
+  return !isHexLiteral(sourceString) && sourceString.toUpperCase().includes("E");
+}
+
+function isHexLiteral(sourceString) {
+  return sourceString.substring(0, 2).toUpperCase() === "0X" || sourceString.substring(0, 3).toUpperCase() === "-0X";
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/lib/index.js
new file mode 100644
index 0000000..fea08f9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/lib/index.js
@@ -0,0 +1,116 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parse32F = parse32F;
+exports.parse64F = parse64F;
+exports.parse32I = parse32I;
+exports.parseU32 = parseU32;
+exports.parse64I = parse64I;
+exports.isInfLiteral = isInfLiteral;
+exports.isNanLiteral = isNanLiteral;
+
+var _long = _interopRequireDefault(require("@xtuc/long"));
+
+var _floatingPointHexParser = _interopRequireDefault(require("@webassemblyjs/floating-point-hex-parser"));
+
+var _helperApiError = require("@webassemblyjs/helper-api-error");
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+function parse32F(sourceString) {
+  if (isHexLiteral(sourceString)) {
+    return (0, _floatingPointHexParser.default)(sourceString);
+  }
+
+  if (isInfLiteral(sourceString)) {
+    return sourceString[0] === "-" ? -1 : 1;
+  }
+
+  if (isNanLiteral(sourceString)) {
+    return (sourceString[0] === "-" ? -1 : 1) * (sourceString.includes(":") ? parseInt(sourceString.substring(sourceString.indexOf(":") + 1), 16) : 0x400000);
+  }
+
+  return parseFloat(sourceString);
+}
+
+function parse64F(sourceString) {
+  if (isHexLiteral(sourceString)) {
+    return (0, _floatingPointHexParser.default)(sourceString);
+  }
+
+  if (isInfLiteral(sourceString)) {
+    return sourceString[0] === "-" ? -1 : 1;
+  }
+
+  if (isNanLiteral(sourceString)) {
+    return (sourceString[0] === "-" ? -1 : 1) * (sourceString.includes(":") ? parseInt(sourceString.substring(sourceString.indexOf(":") + 1), 16) : 0x8000000000000);
+  }
+
+  if (isHexLiteral(sourceString)) {
+    return (0, _floatingPointHexParser.default)(sourceString);
+  }
+
+  return parseFloat(sourceString);
+}
+
+function parse32I(sourceString) {
+  var value = 0;
+
+  if (isHexLiteral(sourceString)) {
+    value = ~~parseInt(sourceString, 16);
+  } else if (isDecimalExponentLiteral(sourceString)) {
+    throw new Error("This number literal format is yet to be implemented.");
+  } else {
+    value = parseInt(sourceString, 10);
+  }
+
+  return value;
+}
+
+function parseU32(sourceString) {
+  var value = parse32I(sourceString);
+
+  if (value < 0) {
+    throw new _helperApiError.CompileError("Illegal value for u32: " + sourceString);
+  }
+
+  return value;
+}
+
+function parse64I(sourceString) {
+  var long;
+
+  if (isHexLiteral(sourceString)) {
+    long = _long.default.fromString(sourceString, false, 16);
+  } else if (isDecimalExponentLiteral(sourceString)) {
+    throw new Error("This number literal format is yet to be implemented.");
+  } else {
+    long = _long.default.fromString(sourceString);
+  }
+
+  return {
+    high: long.high,
+    low: long.low
+  };
+}
+
+var NAN_WORD = /^\+?-?nan/;
+var INF_WORD = /^\+?-?inf/;
+
+function isInfLiteral(sourceString) {
+  return INF_WORD.test(sourceString.toLowerCase());
+}
+
+function isNanLiteral(sourceString) {
+  return NAN_WORD.test(sourceString.toLowerCase());
+}
+
+function isDecimalExponentLiteral(sourceString) {
+  return !isHexLiteral(sourceString) && sourceString.toUpperCase().includes("E");
+}
+
+function isHexLiteral(sourceString) {
+  return sourceString.substring(0, 2).toUpperCase() === "0X" || sourceString.substring(0, 3).toUpperCase() === "-0X";
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/package.json
new file mode 100644
index 0000000..3f9c6f6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "@webassemblyjs/helper-numbers",
+  "version": "1.11.1",
+  "description": "Number parsing utility",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "dependencies": {
+    "@webassemblyjs/floating-point-hex-parser": "1.11.1",
+    "@webassemblyjs/helper-api-error": "1.11.1",
+    "@xtuc/long": "4.2.2"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/src/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/src/index.js
new file mode 100644
index 0000000..48d448e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-numbers/src/index.js
@@ -0,0 +1,105 @@
+// @flow
+
+import Long from "@xtuc/long";
+import parseHexFloat from "@webassemblyjs/floating-point-hex-parser";
+import { CompileError } from "@webassemblyjs/helper-api-error";
+
+export function parse32F(sourceString: string): number {
+  if (isHexLiteral(sourceString)) {
+    return parseHexFloat(sourceString);
+  }
+  if (isInfLiteral(sourceString)) {
+    return sourceString[0] === "-" ? -1 : 1;
+  }
+  if (isNanLiteral(sourceString)) {
+    return (
+      (sourceString[0] === "-" ? -1 : 1) *
+      (sourceString.includes(":")
+        ? parseInt(sourceString.substring(sourceString.indexOf(":") + 1), 16)
+        : 0x400000)
+    );
+  }
+  return parseFloat(sourceString);
+}
+
+export function parse64F(sourceString: string): number {
+  if (isHexLiteral(sourceString)) {
+    return parseHexFloat(sourceString);
+  }
+  if (isInfLiteral(sourceString)) {
+    return sourceString[0] === "-" ? -1 : 1;
+  }
+  if (isNanLiteral(sourceString)) {
+    return (
+      (sourceString[0] === "-" ? -1 : 1) *
+      (sourceString.includes(":")
+        ? parseInt(sourceString.substring(sourceString.indexOf(":") + 1), 16)
+        : 0x8000000000000)
+    );
+  }
+  if (isHexLiteral(sourceString)) {
+    return parseHexFloat(sourceString);
+  }
+  return parseFloat(sourceString);
+}
+
+export function parse32I(sourceString: string): number {
+  let value = 0;
+  if (isHexLiteral(sourceString)) {
+    value = ~~parseInt(sourceString, 16);
+  } else if (isDecimalExponentLiteral(sourceString)) {
+    throw new Error("This number literal format is yet to be implemented.");
+  } else {
+    value = parseInt(sourceString, 10);
+  }
+
+  return value;
+}
+
+export function parseU32(sourceString: string): number {
+  const value = parse32I(sourceString);
+  if (value < 0) {
+    throw new CompileError("Illegal value for u32: " + sourceString);
+  }
+  return value;
+}
+
+export function parse64I(sourceString: string): LongNumber {
+  let long: Long;
+  if (isHexLiteral(sourceString)) {
+    long = Long.fromString(sourceString, false, 16);
+  } else if (isDecimalExponentLiteral(sourceString)) {
+    throw new Error("This number literal format is yet to be implemented.");
+  } else {
+    long = Long.fromString(sourceString);
+  }
+
+  return {
+    high: long.high,
+    low: long.low
+  };
+}
+
+const NAN_WORD = /^\+?-?nan/;
+const INF_WORD = /^\+?-?inf/;
+
+export function isInfLiteral(sourceString: string): boolean {
+  return INF_WORD.test(sourceString.toLowerCase());
+}
+
+export function isNanLiteral(sourceString: string): boolean {
+  return NAN_WORD.test(sourceString.toLowerCase());
+}
+
+function isDecimalExponentLiteral(sourceString: string): boolean {
+  return (
+    !isHexLiteral(sourceString) && sourceString.toUpperCase().includes("E")
+  );
+}
+
+function isHexLiteral(sourceString: string): boolean {
+  return (
+    sourceString.substring(0, 2).toUpperCase() === "0X" ||
+    sourceString.substring(0, 3).toUpperCase() === "-0X"
+  );
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js
new file mode 100644
index 0000000..ee9d837
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js
@@ -0,0 +1,391 @@
+var illegalop = "illegal";
+var magicModuleHeader = [0x00, 0x61, 0x73, 0x6d];
+var moduleVersion = [0x01, 0x00, 0x00, 0x00];
+
+function invertMap(obj) {
+  var keyModifierFn = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : function (k) {
+    return k;
+  };
+  var result = {};
+  var keys = Object.keys(obj);
+
+  for (var i = 0, length = keys.length; i < length; i++) {
+    result[keyModifierFn(obj[keys[i]])] = keys[i];
+  }
+
+  return result;
+}
+
+function createSymbolObject(name
+/*: string */
+, object
+/*: string */
+)
+/*: Symbol*/
+{
+  var numberOfArgs
+  /*: number*/
+  = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+  return {
+    name: name,
+    object: object,
+    numberOfArgs: numberOfArgs
+  };
+}
+
+function createSymbol(name
+/*: string */
+)
+/*: Symbol*/
+{
+  var numberOfArgs
+  /*: number*/
+  = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  return {
+    name: name,
+    numberOfArgs: numberOfArgs
+  };
+}
+
+var types = {
+  func: 0x60,
+  result: 0x40
+};
+var exportTypes = {
+  0x00: "Func",
+  0x01: "Table",
+  0x02: "Mem",
+  0x03: "Global"
+};
+var exportTypesByName = invertMap(exportTypes);
+var valtypes = {
+  0x7f: "i32",
+  0x7e: "i64",
+  0x7d: "f32",
+  0x7c: "f64",
+  0x7b: "v128"
+};
+var valtypesByString = invertMap(valtypes);
+var tableTypes = {
+  0x70: "anyfunc"
+};
+var blockTypes = Object.assign({}, valtypes, {
+  // https://webassembly.github.io/spec/core/binary/types.html#binary-blocktype
+  0x40: null,
+  // https://webassembly.github.io/spec/core/binary/types.html#binary-valtype
+  0x7f: "i32",
+  0x7e: "i64",
+  0x7d: "f32",
+  0x7c: "f64"
+});
+var globalTypes = {
+  0x00: "const",
+  0x01: "var"
+};
+var globalTypesByString = invertMap(globalTypes);
+var importTypes = {
+  0x00: "func",
+  0x01: "table",
+  0x02: "mem",
+  0x03: "global"
+};
+var sections = {
+  custom: 0,
+  type: 1,
+  import: 2,
+  func: 3,
+  table: 4,
+  memory: 5,
+  global: 6,
+  export: 7,
+  start: 8,
+  element: 9,
+  code: 10,
+  data: 11
+};
+var symbolsByByte = {
+  0x00: createSymbol("unreachable"),
+  0x01: createSymbol("nop"),
+  0x02: createSymbol("block"),
+  0x03: createSymbol("loop"),
+  0x04: createSymbol("if"),
+  0x05: createSymbol("else"),
+  0x06: illegalop,
+  0x07: illegalop,
+  0x08: illegalop,
+  0x09: illegalop,
+  0x0a: illegalop,
+  0x0b: createSymbol("end"),
+  0x0c: createSymbol("br", 1),
+  0x0d: createSymbol("br_if", 1),
+  0x0e: createSymbol("br_table"),
+  0x0f: createSymbol("return"),
+  0x10: createSymbol("call", 1),
+  0x11: createSymbol("call_indirect", 2),
+  0x12: illegalop,
+  0x13: illegalop,
+  0x14: illegalop,
+  0x15: illegalop,
+  0x16: illegalop,
+  0x17: illegalop,
+  0x18: illegalop,
+  0x19: illegalop,
+  0x1a: createSymbol("drop"),
+  0x1b: createSymbol("select"),
+  0x1c: illegalop,
+  0x1d: illegalop,
+  0x1e: illegalop,
+  0x1f: illegalop,
+  0x20: createSymbol("get_local", 1),
+  0x21: createSymbol("set_local", 1),
+  0x22: createSymbol("tee_local", 1),
+  0x23: createSymbol("get_global", 1),
+  0x24: createSymbol("set_global", 1),
+  0x25: illegalop,
+  0x26: illegalop,
+  0x27: illegalop,
+  0x28: createSymbolObject("load", "u32", 1),
+  0x29: createSymbolObject("load", "u64", 1),
+  0x2a: createSymbolObject("load", "f32", 1),
+  0x2b: createSymbolObject("load", "f64", 1),
+  0x2c: createSymbolObject("load8_s", "u32", 1),
+  0x2d: createSymbolObject("load8_u", "u32", 1),
+  0x2e: createSymbolObject("load16_s", "u32", 1),
+  0x2f: createSymbolObject("load16_u", "u32", 1),
+  0x30: createSymbolObject("load8_s", "u64", 1),
+  0x31: createSymbolObject("load8_u", "u64", 1),
+  0x32: createSymbolObject("load16_s", "u64", 1),
+  0x33: createSymbolObject("load16_u", "u64", 1),
+  0x34: createSymbolObject("load32_s", "u64", 1),
+  0x35: createSymbolObject("load32_u", "u64", 1),
+  0x36: createSymbolObject("store", "u32", 1),
+  0x37: createSymbolObject("store", "u64", 1),
+  0x38: createSymbolObject("store", "f32", 1),
+  0x39: createSymbolObject("store", "f64", 1),
+  0x3a: createSymbolObject("store8", "u32", 1),
+  0x3b: createSymbolObject("store16", "u32", 1),
+  0x3c: createSymbolObject("store8", "u64", 1),
+  0x3d: createSymbolObject("store16", "u64", 1),
+  0x3e: createSymbolObject("store32", "u64", 1),
+  0x3f: createSymbolObject("current_memory"),
+  0x40: createSymbolObject("grow_memory"),
+  0x41: createSymbolObject("const", "i32", 1),
+  0x42: createSymbolObject("const", "i64", 1),
+  0x43: createSymbolObject("const", "f32", 1),
+  0x44: createSymbolObject("const", "f64", 1),
+  0x45: createSymbolObject("eqz", "i32"),
+  0x46: createSymbolObject("eq", "i32"),
+  0x47: createSymbolObject("ne", "i32"),
+  0x48: createSymbolObject("lt_s", "i32"),
+  0x49: createSymbolObject("lt_u", "i32"),
+  0x4a: createSymbolObject("gt_s", "i32"),
+  0x4b: createSymbolObject("gt_u", "i32"),
+  0x4c: createSymbolObject("le_s", "i32"),
+  0x4d: createSymbolObject("le_u", "i32"),
+  0x4e: createSymbolObject("ge_s", "i32"),
+  0x4f: createSymbolObject("ge_u", "i32"),
+  0x50: createSymbolObject("eqz", "i64"),
+  0x51: createSymbolObject("eq", "i64"),
+  0x52: createSymbolObject("ne", "i64"),
+  0x53: createSymbolObject("lt_s", "i64"),
+  0x54: createSymbolObject("lt_u", "i64"),
+  0x55: createSymbolObject("gt_s", "i64"),
+  0x56: createSymbolObject("gt_u", "i64"),
+  0x57: createSymbolObject("le_s", "i64"),
+  0x58: createSymbolObject("le_u", "i64"),
+  0x59: createSymbolObject("ge_s", "i64"),
+  0x5a: createSymbolObject("ge_u", "i64"),
+  0x5b: createSymbolObject("eq", "f32"),
+  0x5c: createSymbolObject("ne", "f32"),
+  0x5d: createSymbolObject("lt", "f32"),
+  0x5e: createSymbolObject("gt", "f32"),
+  0x5f: createSymbolObject("le", "f32"),
+  0x60: createSymbolObject("ge", "f32"),
+  0x61: createSymbolObject("eq", "f64"),
+  0x62: createSymbolObject("ne", "f64"),
+  0x63: createSymbolObject("lt", "f64"),
+  0x64: createSymbolObject("gt", "f64"),
+  0x65: createSymbolObject("le", "f64"),
+  0x66: createSymbolObject("ge", "f64"),
+  0x67: createSymbolObject("clz", "i32"),
+  0x68: createSymbolObject("ctz", "i32"),
+  0x69: createSymbolObject("popcnt", "i32"),
+  0x6a: createSymbolObject("add", "i32"),
+  0x6b: createSymbolObject("sub", "i32"),
+  0x6c: createSymbolObject("mul", "i32"),
+  0x6d: createSymbolObject("div_s", "i32"),
+  0x6e: createSymbolObject("div_u", "i32"),
+  0x6f: createSymbolObject("rem_s", "i32"),
+  0x70: createSymbolObject("rem_u", "i32"),
+  0x71: createSymbolObject("and", "i32"),
+  0x72: createSymbolObject("or", "i32"),
+  0x73: createSymbolObject("xor", "i32"),
+  0x74: createSymbolObject("shl", "i32"),
+  0x75: createSymbolObject("shr_s", "i32"),
+  0x76: createSymbolObject("shr_u", "i32"),
+  0x77: createSymbolObject("rotl", "i32"),
+  0x78: createSymbolObject("rotr", "i32"),
+  0x79: createSymbolObject("clz", "i64"),
+  0x7a: createSymbolObject("ctz", "i64"),
+  0x7b: createSymbolObject("popcnt", "i64"),
+  0x7c: createSymbolObject("add", "i64"),
+  0x7d: createSymbolObject("sub", "i64"),
+  0x7e: createSymbolObject("mul", "i64"),
+  0x7f: createSymbolObject("div_s", "i64"),
+  0x80: createSymbolObject("div_u", "i64"),
+  0x81: createSymbolObject("rem_s", "i64"),
+  0x82: createSymbolObject("rem_u", "i64"),
+  0x83: createSymbolObject("and", "i64"),
+  0x84: createSymbolObject("or", "i64"),
+  0x85: createSymbolObject("xor", "i64"),
+  0x86: createSymbolObject("shl", "i64"),
+  0x87: createSymbolObject("shr_s", "i64"),
+  0x88: createSymbolObject("shr_u", "i64"),
+  0x89: createSymbolObject("rotl", "i64"),
+  0x8a: createSymbolObject("rotr", "i64"),
+  0x8b: createSymbolObject("abs", "f32"),
+  0x8c: createSymbolObject("neg", "f32"),
+  0x8d: createSymbolObject("ceil", "f32"),
+  0x8e: createSymbolObject("floor", "f32"),
+  0x8f: createSymbolObject("trunc", "f32"),
+  0x90: createSymbolObject("nearest", "f32"),
+  0x91: createSymbolObject("sqrt", "f32"),
+  0x92: createSymbolObject("add", "f32"),
+  0x93: createSymbolObject("sub", "f32"),
+  0x94: createSymbolObject("mul", "f32"),
+  0x95: createSymbolObject("div", "f32"),
+  0x96: createSymbolObject("min", "f32"),
+  0x97: createSymbolObject("max", "f32"),
+  0x98: createSymbolObject("copysign", "f32"),
+  0x99: createSymbolObject("abs", "f64"),
+  0x9a: createSymbolObject("neg", "f64"),
+  0x9b: createSymbolObject("ceil", "f64"),
+  0x9c: createSymbolObject("floor", "f64"),
+  0x9d: createSymbolObject("trunc", "f64"),
+  0x9e: createSymbolObject("nearest", "f64"),
+  0x9f: createSymbolObject("sqrt", "f64"),
+  0xa0: createSymbolObject("add", "f64"),
+  0xa1: createSymbolObject("sub", "f64"),
+  0xa2: createSymbolObject("mul", "f64"),
+  0xa3: createSymbolObject("div", "f64"),
+  0xa4: createSymbolObject("min", "f64"),
+  0xa5: createSymbolObject("max", "f64"),
+  0xa6: createSymbolObject("copysign", "f64"),
+  0xa7: createSymbolObject("wrap/i64", "i32"),
+  0xa8: createSymbolObject("trunc_s/f32", "i32"),
+  0xa9: createSymbolObject("trunc_u/f32", "i32"),
+  0xaa: createSymbolObject("trunc_s/f64", "i32"),
+  0xab: createSymbolObject("trunc_u/f64", "i32"),
+  0xac: createSymbolObject("extend_s/i32", "i64"),
+  0xad: createSymbolObject("extend_u/i32", "i64"),
+  0xae: createSymbolObject("trunc_s/f32", "i64"),
+  0xaf: createSymbolObject("trunc_u/f32", "i64"),
+  0xb0: createSymbolObject("trunc_s/f64", "i64"),
+  0xb1: createSymbolObject("trunc_u/f64", "i64"),
+  0xb2: createSymbolObject("convert_s/i32", "f32"),
+  0xb3: createSymbolObject("convert_u/i32", "f32"),
+  0xb4: createSymbolObject("convert_s/i64", "f32"),
+  0xb5: createSymbolObject("convert_u/i64", "f32"),
+  0xb6: createSymbolObject("demote/f64", "f32"),
+  0xb7: createSymbolObject("convert_s/i32", "f64"),
+  0xb8: createSymbolObject("convert_u/i32", "f64"),
+  0xb9: createSymbolObject("convert_s/i64", "f64"),
+  0xba: createSymbolObject("convert_u/i64", "f64"),
+  0xbb: createSymbolObject("promote/f32", "f64"),
+  0xbc: createSymbolObject("reinterpret/f32", "i32"),
+  0xbd: createSymbolObject("reinterpret/f64", "i64"),
+  0xbe: createSymbolObject("reinterpret/i32", "f32"),
+  0xbf: createSymbolObject("reinterpret/i64", "f64"),
+  // Atomic Memory Instructions
+  0xfe00: createSymbol("memory.atomic.notify", 1),
+  0xfe01: createSymbol("memory.atomic.wait32", 1),
+  0xfe02: createSymbol("memory.atomic.wait64", 1),
+  0xfe10: createSymbolObject("atomic.load", "i32", 1),
+  0xfe11: createSymbolObject("atomic.load", "i64", 1),
+  0xfe12: createSymbolObject("atomic.load8_u", "i32", 1),
+  0xfe13: createSymbolObject("atomic.load16_u", "i32", 1),
+  0xfe14: createSymbolObject("atomic.load8_u", "i64", 1),
+  0xfe15: createSymbolObject("atomic.load16_u", "i64", 1),
+  0xfe16: createSymbolObject("atomic.load32_u", "i64", 1),
+  0xfe17: createSymbolObject("atomic.store", "i32", 1),
+  0xfe18: createSymbolObject("atomic.store", "i64", 1),
+  0xfe19: createSymbolObject("atomic.store8_u", "i32", 1),
+  0xfe1a: createSymbolObject("atomic.store16_u", "i32", 1),
+  0xfe1b: createSymbolObject("atomic.store8_u", "i64", 1),
+  0xfe1c: createSymbolObject("atomic.store16_u", "i64", 1),
+  0xfe1d: createSymbolObject("atomic.store32_u", "i64", 1),
+  0xfe1e: createSymbolObject("atomic.rmw.add", "i32", 1),
+  0xfe1f: createSymbolObject("atomic.rmw.add", "i64", 1),
+  0xfe20: createSymbolObject("atomic.rmw8_u.add_u", "i32", 1),
+  0xfe21: createSymbolObject("atomic.rmw16_u.add_u", "i32", 1),
+  0xfe22: createSymbolObject("atomic.rmw8_u.add_u", "i64", 1),
+  0xfe23: createSymbolObject("atomic.rmw16_u.add_u", "i64", 1),
+  0xfe24: createSymbolObject("atomic.rmw32_u.add_u", "i64", 1),
+  0xfe25: createSymbolObject("atomic.rmw.sub", "i32", 1),
+  0xfe26: createSymbolObject("atomic.rmw.sub", "i64", 1),
+  0xfe27: createSymbolObject("atomic.rmw8_u.sub_u", "i32", 1),
+  0xfe28: createSymbolObject("atomic.rmw16_u.sub_u", "i32", 1),
+  0xfe29: createSymbolObject("atomic.rmw8_u.sub_u", "i64", 1),
+  0xfe2a: createSymbolObject("atomic.rmw16_u.sub_u", "i64", 1),
+  0xfe2b: createSymbolObject("atomic.rmw32_u.sub_u", "i64", 1),
+  0xfe2c: createSymbolObject("atomic.rmw.and", "i32", 1),
+  0xfe2d: createSymbolObject("atomic.rmw.and", "i64", 1),
+  0xfe2e: createSymbolObject("atomic.rmw8_u.and_u", "i32", 1),
+  0xfe2f: createSymbolObject("atomic.rmw16_u.and_u", "i32", 1),
+  0xfe30: createSymbolObject("atomic.rmw8_u.and_u", "i64", 1),
+  0xfe31: createSymbolObject("atomic.rmw16_u.and_u", "i64", 1),
+  0xfe32: createSymbolObject("atomic.rmw32_u.and_u", "i64", 1),
+  0xfe33: createSymbolObject("atomic.rmw.or", "i32", 1),
+  0xfe34: createSymbolObject("atomic.rmw.or", "i64", 1),
+  0xfe35: createSymbolObject("atomic.rmw8_u.or_u", "i32", 1),
+  0xfe36: createSymbolObject("atomic.rmw16_u.or_u", "i32", 1),
+  0xfe37: createSymbolObject("atomic.rmw8_u.or_u", "i64", 1),
+  0xfe38: createSymbolObject("atomic.rmw16_u.or_u", "i64", 1),
+  0xfe39: createSymbolObject("atomic.rmw32_u.or_u", "i64", 1),
+  0xfe3a: createSymbolObject("atomic.rmw.xor", "i32", 1),
+  0xfe3b: createSymbolObject("atomic.rmw.xor", "i64", 1),
+  0xfe3c: createSymbolObject("atomic.rmw8_u.xor_u", "i32", 1),
+  0xfe3d: createSymbolObject("atomic.rmw16_u.xor_u", "i32", 1),
+  0xfe3e: createSymbolObject("atomic.rmw8_u.xor_u", "i64", 1),
+  0xfe3f: createSymbolObject("atomic.rmw16_u.xor_u", "i64", 1),
+  0xfe40: createSymbolObject("atomic.rmw32_u.xor_u", "i64", 1),
+  0xfe41: createSymbolObject("atomic.rmw.xchg", "i32", 1),
+  0xfe42: createSymbolObject("atomic.rmw.xchg", "i64", 1),
+  0xfe43: createSymbolObject("atomic.rmw8_u.xchg_u", "i32", 1),
+  0xfe44: createSymbolObject("atomic.rmw16_u.xchg_u", "i32", 1),
+  0xfe45: createSymbolObject("atomic.rmw8_u.xchg_u", "i64", 1),
+  0xfe46: createSymbolObject("atomic.rmw16_u.xchg_u", "i64", 1),
+  0xfe47: createSymbolObject("atomic.rmw32_u.xchg_u", "i64", 1),
+  0xfe48: createSymbolObject("atomic.rmw.cmpxchg", "i32", 1),
+  0xfe49: createSymbolObject("atomic.rmw.cmpxchg", "i64", 1),
+  0xfe4a: createSymbolObject("atomic.rmw8_u.cmpxchg_u", "i32", 1),
+  0xfe4b: createSymbolObject("atomic.rmw16_u.cmpxchg_u", "i32", 1),
+  0xfe4c: createSymbolObject("atomic.rmw8_u.cmpxchg_u", "i64", 1),
+  0xfe4d: createSymbolObject("atomic.rmw16_u.cmpxchg_u", "i64", 1),
+  0xfe4e: createSymbolObject("atomic.rmw32_u.cmpxchg_u", "i64", 1)
+};
+var symbolsByName = invertMap(symbolsByByte, function (obj) {
+  if (typeof obj.object === "string") {
+    return "".concat(obj.object, ".").concat(obj.name);
+  }
+
+  return obj.name;
+});
+export default {
+  symbolsByByte: symbolsByByte,
+  sections: sections,
+  magicModuleHeader: magicModuleHeader,
+  moduleVersion: moduleVersion,
+  types: types,
+  valtypes: valtypes,
+  exportTypes: exportTypes,
+  blockTypes: blockTypes,
+  tableTypes: tableTypes,
+  globalTypes: globalTypes,
+  importTypes: importTypes,
+  valtypesByString: valtypesByString,
+  globalTypesByString: globalTypesByString,
+  exportTypesByName: exportTypesByName,
+  symbolsByName: symbolsByName
+};
+export { getSectionForNode } from "./section";
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/esm/section.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/esm/section.js
new file mode 100644
index 0000000..abdc4cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/esm/section.js
@@ -0,0 +1,31 @@
+export function getSectionForNode(n) {
+  switch (n.type) {
+    case "ModuleImport":
+      return "import";
+
+    case "CallInstruction":
+    case "CallIndirectInstruction":
+    case "Func":
+    case "Instr":
+      return "code";
+
+    case "ModuleExport":
+      return "export";
+
+    case "Start":
+      return "start";
+
+    case "TypeInstruction":
+      return "type";
+
+    case "IndexInFuncSection":
+      return "func";
+
+    case "Global":
+      return "global";
+    // No section
+
+    default:
+      return;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/lib/index.js
new file mode 100644
index 0000000..a54e5f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/lib/index.js
@@ -0,0 +1,406 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "getSectionForNode", {
+  enumerable: true,
+  get: function get() {
+    return _section.getSectionForNode;
+  }
+});
+exports.default = void 0;
+
+var _section = require("./section");
+
+var illegalop = "illegal";
+var magicModuleHeader = [0x00, 0x61, 0x73, 0x6d];
+var moduleVersion = [0x01, 0x00, 0x00, 0x00];
+
+function invertMap(obj) {
+  var keyModifierFn = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : function (k) {
+    return k;
+  };
+  var result = {};
+  var keys = Object.keys(obj);
+
+  for (var i = 0, length = keys.length; i < length; i++) {
+    result[keyModifierFn(obj[keys[i]])] = keys[i];
+  }
+
+  return result;
+}
+
+function createSymbolObject(name
+/*: string */
+, object
+/*: string */
+)
+/*: Symbol*/
+{
+  var numberOfArgs
+  /*: number*/
+  = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+  return {
+    name: name,
+    object: object,
+    numberOfArgs: numberOfArgs
+  };
+}
+
+function createSymbol(name
+/*: string */
+)
+/*: Symbol*/
+{
+  var numberOfArgs
+  /*: number*/
+  = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  return {
+    name: name,
+    numberOfArgs: numberOfArgs
+  };
+}
+
+var types = {
+  func: 0x60,
+  result: 0x40
+};
+var exportTypes = {
+  0x00: "Func",
+  0x01: "Table",
+  0x02: "Mem",
+  0x03: "Global"
+};
+var exportTypesByName = invertMap(exportTypes);
+var valtypes = {
+  0x7f: "i32",
+  0x7e: "i64",
+  0x7d: "f32",
+  0x7c: "f64",
+  0x7b: "v128"
+};
+var valtypesByString = invertMap(valtypes);
+var tableTypes = {
+  0x70: "anyfunc"
+};
+var blockTypes = Object.assign({}, valtypes, {
+  // https://webassembly.github.io/spec/core/binary/types.html#binary-blocktype
+  0x40: null,
+  // https://webassembly.github.io/spec/core/binary/types.html#binary-valtype
+  0x7f: "i32",
+  0x7e: "i64",
+  0x7d: "f32",
+  0x7c: "f64"
+});
+var globalTypes = {
+  0x00: "const",
+  0x01: "var"
+};
+var globalTypesByString = invertMap(globalTypes);
+var importTypes = {
+  0x00: "func",
+  0x01: "table",
+  0x02: "mem",
+  0x03: "global"
+};
+var sections = {
+  custom: 0,
+  type: 1,
+  import: 2,
+  func: 3,
+  table: 4,
+  memory: 5,
+  global: 6,
+  export: 7,
+  start: 8,
+  element: 9,
+  code: 10,
+  data: 11
+};
+var symbolsByByte = {
+  0x00: createSymbol("unreachable"),
+  0x01: createSymbol("nop"),
+  0x02: createSymbol("block"),
+  0x03: createSymbol("loop"),
+  0x04: createSymbol("if"),
+  0x05: createSymbol("else"),
+  0x06: illegalop,
+  0x07: illegalop,
+  0x08: illegalop,
+  0x09: illegalop,
+  0x0a: illegalop,
+  0x0b: createSymbol("end"),
+  0x0c: createSymbol("br", 1),
+  0x0d: createSymbol("br_if", 1),
+  0x0e: createSymbol("br_table"),
+  0x0f: createSymbol("return"),
+  0x10: createSymbol("call", 1),
+  0x11: createSymbol("call_indirect", 2),
+  0x12: illegalop,
+  0x13: illegalop,
+  0x14: illegalop,
+  0x15: illegalop,
+  0x16: illegalop,
+  0x17: illegalop,
+  0x18: illegalop,
+  0x19: illegalop,
+  0x1a: createSymbol("drop"),
+  0x1b: createSymbol("select"),
+  0x1c: illegalop,
+  0x1d: illegalop,
+  0x1e: illegalop,
+  0x1f: illegalop,
+  0x20: createSymbol("get_local", 1),
+  0x21: createSymbol("set_local", 1),
+  0x22: createSymbol("tee_local", 1),
+  0x23: createSymbol("get_global", 1),
+  0x24: createSymbol("set_global", 1),
+  0x25: illegalop,
+  0x26: illegalop,
+  0x27: illegalop,
+  0x28: createSymbolObject("load", "u32", 1),
+  0x29: createSymbolObject("load", "u64", 1),
+  0x2a: createSymbolObject("load", "f32", 1),
+  0x2b: createSymbolObject("load", "f64", 1),
+  0x2c: createSymbolObject("load8_s", "u32", 1),
+  0x2d: createSymbolObject("load8_u", "u32", 1),
+  0x2e: createSymbolObject("load16_s", "u32", 1),
+  0x2f: createSymbolObject("load16_u", "u32", 1),
+  0x30: createSymbolObject("load8_s", "u64", 1),
+  0x31: createSymbolObject("load8_u", "u64", 1),
+  0x32: createSymbolObject("load16_s", "u64", 1),
+  0x33: createSymbolObject("load16_u", "u64", 1),
+  0x34: createSymbolObject("load32_s", "u64", 1),
+  0x35: createSymbolObject("load32_u", "u64", 1),
+  0x36: createSymbolObject("store", "u32", 1),
+  0x37: createSymbolObject("store", "u64", 1),
+  0x38: createSymbolObject("store", "f32", 1),
+  0x39: createSymbolObject("store", "f64", 1),
+  0x3a: createSymbolObject("store8", "u32", 1),
+  0x3b: createSymbolObject("store16", "u32", 1),
+  0x3c: createSymbolObject("store8", "u64", 1),
+  0x3d: createSymbolObject("store16", "u64", 1),
+  0x3e: createSymbolObject("store32", "u64", 1),
+  0x3f: createSymbolObject("current_memory"),
+  0x40: createSymbolObject("grow_memory"),
+  0x41: createSymbolObject("const", "i32", 1),
+  0x42: createSymbolObject("const", "i64", 1),
+  0x43: createSymbolObject("const", "f32", 1),
+  0x44: createSymbolObject("const", "f64", 1),
+  0x45: createSymbolObject("eqz", "i32"),
+  0x46: createSymbolObject("eq", "i32"),
+  0x47: createSymbolObject("ne", "i32"),
+  0x48: createSymbolObject("lt_s", "i32"),
+  0x49: createSymbolObject("lt_u", "i32"),
+  0x4a: createSymbolObject("gt_s", "i32"),
+  0x4b: createSymbolObject("gt_u", "i32"),
+  0x4c: createSymbolObject("le_s", "i32"),
+  0x4d: createSymbolObject("le_u", "i32"),
+  0x4e: createSymbolObject("ge_s", "i32"),
+  0x4f: createSymbolObject("ge_u", "i32"),
+  0x50: createSymbolObject("eqz", "i64"),
+  0x51: createSymbolObject("eq", "i64"),
+  0x52: createSymbolObject("ne", "i64"),
+  0x53: createSymbolObject("lt_s", "i64"),
+  0x54: createSymbolObject("lt_u", "i64"),
+  0x55: createSymbolObject("gt_s", "i64"),
+  0x56: createSymbolObject("gt_u", "i64"),
+  0x57: createSymbolObject("le_s", "i64"),
+  0x58: createSymbolObject("le_u", "i64"),
+  0x59: createSymbolObject("ge_s", "i64"),
+  0x5a: createSymbolObject("ge_u", "i64"),
+  0x5b: createSymbolObject("eq", "f32"),
+  0x5c: createSymbolObject("ne", "f32"),
+  0x5d: createSymbolObject("lt", "f32"),
+  0x5e: createSymbolObject("gt", "f32"),
+  0x5f: createSymbolObject("le", "f32"),
+  0x60: createSymbolObject("ge", "f32"),
+  0x61: createSymbolObject("eq", "f64"),
+  0x62: createSymbolObject("ne", "f64"),
+  0x63: createSymbolObject("lt", "f64"),
+  0x64: createSymbolObject("gt", "f64"),
+  0x65: createSymbolObject("le", "f64"),
+  0x66: createSymbolObject("ge", "f64"),
+  0x67: createSymbolObject("clz", "i32"),
+  0x68: createSymbolObject("ctz", "i32"),
+  0x69: createSymbolObject("popcnt", "i32"),
+  0x6a: createSymbolObject("add", "i32"),
+  0x6b: createSymbolObject("sub", "i32"),
+  0x6c: createSymbolObject("mul", "i32"),
+  0x6d: createSymbolObject("div_s", "i32"),
+  0x6e: createSymbolObject("div_u", "i32"),
+  0x6f: createSymbolObject("rem_s", "i32"),
+  0x70: createSymbolObject("rem_u", "i32"),
+  0x71: createSymbolObject("and", "i32"),
+  0x72: createSymbolObject("or", "i32"),
+  0x73: createSymbolObject("xor", "i32"),
+  0x74: createSymbolObject("shl", "i32"),
+  0x75: createSymbolObject("shr_s", "i32"),
+  0x76: createSymbolObject("shr_u", "i32"),
+  0x77: createSymbolObject("rotl", "i32"),
+  0x78: createSymbolObject("rotr", "i32"),
+  0x79: createSymbolObject("clz", "i64"),
+  0x7a: createSymbolObject("ctz", "i64"),
+  0x7b: createSymbolObject("popcnt", "i64"),
+  0x7c: createSymbolObject("add", "i64"),
+  0x7d: createSymbolObject("sub", "i64"),
+  0x7e: createSymbolObject("mul", "i64"),
+  0x7f: createSymbolObject("div_s", "i64"),
+  0x80: createSymbolObject("div_u", "i64"),
+  0x81: createSymbolObject("rem_s", "i64"),
+  0x82: createSymbolObject("rem_u", "i64"),
+  0x83: createSymbolObject("and", "i64"),
+  0x84: createSymbolObject("or", "i64"),
+  0x85: createSymbolObject("xor", "i64"),
+  0x86: createSymbolObject("shl", "i64"),
+  0x87: createSymbolObject("shr_s", "i64"),
+  0x88: createSymbolObject("shr_u", "i64"),
+  0x89: createSymbolObject("rotl", "i64"),
+  0x8a: createSymbolObject("rotr", "i64"),
+  0x8b: createSymbolObject("abs", "f32"),
+  0x8c: createSymbolObject("neg", "f32"),
+  0x8d: createSymbolObject("ceil", "f32"),
+  0x8e: createSymbolObject("floor", "f32"),
+  0x8f: createSymbolObject("trunc", "f32"),
+  0x90: createSymbolObject("nearest", "f32"),
+  0x91: createSymbolObject("sqrt", "f32"),
+  0x92: createSymbolObject("add", "f32"),
+  0x93: createSymbolObject("sub", "f32"),
+  0x94: createSymbolObject("mul", "f32"),
+  0x95: createSymbolObject("div", "f32"),
+  0x96: createSymbolObject("min", "f32"),
+  0x97: createSymbolObject("max", "f32"),
+  0x98: createSymbolObject("copysign", "f32"),
+  0x99: createSymbolObject("abs", "f64"),
+  0x9a: createSymbolObject("neg", "f64"),
+  0x9b: createSymbolObject("ceil", "f64"),
+  0x9c: createSymbolObject("floor", "f64"),
+  0x9d: createSymbolObject("trunc", "f64"),
+  0x9e: createSymbolObject("nearest", "f64"),
+  0x9f: createSymbolObject("sqrt", "f64"),
+  0xa0: createSymbolObject("add", "f64"),
+  0xa1: createSymbolObject("sub", "f64"),
+  0xa2: createSymbolObject("mul", "f64"),
+  0xa3: createSymbolObject("div", "f64"),
+  0xa4: createSymbolObject("min", "f64"),
+  0xa5: createSymbolObject("max", "f64"),
+  0xa6: createSymbolObject("copysign", "f64"),
+  0xa7: createSymbolObject("wrap/i64", "i32"),
+  0xa8: createSymbolObject("trunc_s/f32", "i32"),
+  0xa9: createSymbolObject("trunc_u/f32", "i32"),
+  0xaa: createSymbolObject("trunc_s/f64", "i32"),
+  0xab: createSymbolObject("trunc_u/f64", "i32"),
+  0xac: createSymbolObject("extend_s/i32", "i64"),
+  0xad: createSymbolObject("extend_u/i32", "i64"),
+  0xae: createSymbolObject("trunc_s/f32", "i64"),
+  0xaf: createSymbolObject("trunc_u/f32", "i64"),
+  0xb0: createSymbolObject("trunc_s/f64", "i64"),
+  0xb1: createSymbolObject("trunc_u/f64", "i64"),
+  0xb2: createSymbolObject("convert_s/i32", "f32"),
+  0xb3: createSymbolObject("convert_u/i32", "f32"),
+  0xb4: createSymbolObject("convert_s/i64", "f32"),
+  0xb5: createSymbolObject("convert_u/i64", "f32"),
+  0xb6: createSymbolObject("demote/f64", "f32"),
+  0xb7: createSymbolObject("convert_s/i32", "f64"),
+  0xb8: createSymbolObject("convert_u/i32", "f64"),
+  0xb9: createSymbolObject("convert_s/i64", "f64"),
+  0xba: createSymbolObject("convert_u/i64", "f64"),
+  0xbb: createSymbolObject("promote/f32", "f64"),
+  0xbc: createSymbolObject("reinterpret/f32", "i32"),
+  0xbd: createSymbolObject("reinterpret/f64", "i64"),
+  0xbe: createSymbolObject("reinterpret/i32", "f32"),
+  0xbf: createSymbolObject("reinterpret/i64", "f64"),
+  // Atomic Memory Instructions
+  0xfe00: createSymbol("memory.atomic.notify", 1),
+  0xfe01: createSymbol("memory.atomic.wait32", 1),
+  0xfe02: createSymbol("memory.atomic.wait64", 1),
+  0xfe10: createSymbolObject("atomic.load", "i32", 1),
+  0xfe11: createSymbolObject("atomic.load", "i64", 1),
+  0xfe12: createSymbolObject("atomic.load8_u", "i32", 1),
+  0xfe13: createSymbolObject("atomic.load16_u", "i32", 1),
+  0xfe14: createSymbolObject("atomic.load8_u", "i64", 1),
+  0xfe15: createSymbolObject("atomic.load16_u", "i64", 1),
+  0xfe16: createSymbolObject("atomic.load32_u", "i64", 1),
+  0xfe17: createSymbolObject("atomic.store", "i32", 1),
+  0xfe18: createSymbolObject("atomic.store", "i64", 1),
+  0xfe19: createSymbolObject("atomic.store8_u", "i32", 1),
+  0xfe1a: createSymbolObject("atomic.store16_u", "i32", 1),
+  0xfe1b: createSymbolObject("atomic.store8_u", "i64", 1),
+  0xfe1c: createSymbolObject("atomic.store16_u", "i64", 1),
+  0xfe1d: createSymbolObject("atomic.store32_u", "i64", 1),
+  0xfe1e: createSymbolObject("atomic.rmw.add", "i32", 1),
+  0xfe1f: createSymbolObject("atomic.rmw.add", "i64", 1),
+  0xfe20: createSymbolObject("atomic.rmw8_u.add_u", "i32", 1),
+  0xfe21: createSymbolObject("atomic.rmw16_u.add_u", "i32", 1),
+  0xfe22: createSymbolObject("atomic.rmw8_u.add_u", "i64", 1),
+  0xfe23: createSymbolObject("atomic.rmw16_u.add_u", "i64", 1),
+  0xfe24: createSymbolObject("atomic.rmw32_u.add_u", "i64", 1),
+  0xfe25: createSymbolObject("atomic.rmw.sub", "i32", 1),
+  0xfe26: createSymbolObject("atomic.rmw.sub", "i64", 1),
+  0xfe27: createSymbolObject("atomic.rmw8_u.sub_u", "i32", 1),
+  0xfe28: createSymbolObject("atomic.rmw16_u.sub_u", "i32", 1),
+  0xfe29: createSymbolObject("atomic.rmw8_u.sub_u", "i64", 1),
+  0xfe2a: createSymbolObject("atomic.rmw16_u.sub_u", "i64", 1),
+  0xfe2b: createSymbolObject("atomic.rmw32_u.sub_u", "i64", 1),
+  0xfe2c: createSymbolObject("atomic.rmw.and", "i32", 1),
+  0xfe2d: createSymbolObject("atomic.rmw.and", "i64", 1),
+  0xfe2e: createSymbolObject("atomic.rmw8_u.and_u", "i32", 1),
+  0xfe2f: createSymbolObject("atomic.rmw16_u.and_u", "i32", 1),
+  0xfe30: createSymbolObject("atomic.rmw8_u.and_u", "i64", 1),
+  0xfe31: createSymbolObject("atomic.rmw16_u.and_u", "i64", 1),
+  0xfe32: createSymbolObject("atomic.rmw32_u.and_u", "i64", 1),
+  0xfe33: createSymbolObject("atomic.rmw.or", "i32", 1),
+  0xfe34: createSymbolObject("atomic.rmw.or", "i64", 1),
+  0xfe35: createSymbolObject("atomic.rmw8_u.or_u", "i32", 1),
+  0xfe36: createSymbolObject("atomic.rmw16_u.or_u", "i32", 1),
+  0xfe37: createSymbolObject("atomic.rmw8_u.or_u", "i64", 1),
+  0xfe38: createSymbolObject("atomic.rmw16_u.or_u", "i64", 1),
+  0xfe39: createSymbolObject("atomic.rmw32_u.or_u", "i64", 1),
+  0xfe3a: createSymbolObject("atomic.rmw.xor", "i32", 1),
+  0xfe3b: createSymbolObject("atomic.rmw.xor", "i64", 1),
+  0xfe3c: createSymbolObject("atomic.rmw8_u.xor_u", "i32", 1),
+  0xfe3d: createSymbolObject("atomic.rmw16_u.xor_u", "i32", 1),
+  0xfe3e: createSymbolObject("atomic.rmw8_u.xor_u", "i64", 1),
+  0xfe3f: createSymbolObject("atomic.rmw16_u.xor_u", "i64", 1),
+  0xfe40: createSymbolObject("atomic.rmw32_u.xor_u", "i64", 1),
+  0xfe41: createSymbolObject("atomic.rmw.xchg", "i32", 1),
+  0xfe42: createSymbolObject("atomic.rmw.xchg", "i64", 1),
+  0xfe43: createSymbolObject("atomic.rmw8_u.xchg_u", "i32", 1),
+  0xfe44: createSymbolObject("atomic.rmw16_u.xchg_u", "i32", 1),
+  0xfe45: createSymbolObject("atomic.rmw8_u.xchg_u", "i64", 1),
+  0xfe46: createSymbolObject("atomic.rmw16_u.xchg_u", "i64", 1),
+  0xfe47: createSymbolObject("atomic.rmw32_u.xchg_u", "i64", 1),
+  0xfe48: createSymbolObject("atomic.rmw.cmpxchg", "i32", 1),
+  0xfe49: createSymbolObject("atomic.rmw.cmpxchg", "i64", 1),
+  0xfe4a: createSymbolObject("atomic.rmw8_u.cmpxchg_u", "i32", 1),
+  0xfe4b: createSymbolObject("atomic.rmw16_u.cmpxchg_u", "i32", 1),
+  0xfe4c: createSymbolObject("atomic.rmw8_u.cmpxchg_u", "i64", 1),
+  0xfe4d: createSymbolObject("atomic.rmw16_u.cmpxchg_u", "i64", 1),
+  0xfe4e: createSymbolObject("atomic.rmw32_u.cmpxchg_u", "i64", 1)
+};
+var symbolsByName = invertMap(symbolsByByte, function (obj) {
+  if (typeof obj.object === "string") {
+    return "".concat(obj.object, ".").concat(obj.name);
+  }
+
+  return obj.name;
+});
+var _default = {
+  symbolsByByte: symbolsByByte,
+  sections: sections,
+  magicModuleHeader: magicModuleHeader,
+  moduleVersion: moduleVersion,
+  types: types,
+  valtypes: valtypes,
+  exportTypes: exportTypes,
+  blockTypes: blockTypes,
+  tableTypes: tableTypes,
+  globalTypes: globalTypes,
+  importTypes: importTypes,
+  valtypesByString: valtypesByString,
+  globalTypesByString: globalTypesByString,
+  exportTypesByName: exportTypesByName,
+  symbolsByName: symbolsByName
+};
+exports.default = _default;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/lib/section.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/lib/section.js
new file mode 100644
index 0000000..23f6b2b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/lib/section.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getSectionForNode = getSectionForNode;
+
+function getSectionForNode(n) {
+  switch (n.type) {
+    case "ModuleImport":
+      return "import";
+
+    case "CallInstruction":
+    case "CallIndirectInstruction":
+    case "Func":
+    case "Instr":
+      return "code";
+
+    case "ModuleExport":
+      return "export";
+
+    case "Start":
+      return "start";
+
+    case "TypeInstruction":
+      return "type";
+
+    case "IndexInFuncSection":
+      return "func";
+
+    case "Global":
+      return "global";
+    // No section
+
+    default:
+      return;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/package.json
new file mode 100644
index 0000000..83249b8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-bytecode/package.json
@@ -0,0 +1,20 @@
+{
+  "name": "@webassemblyjs/helper-wasm-bytecode",
+  "version": "1.11.1",
+  "description": "WASM's Bytecode constants",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/create.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/create.js
new file mode 100644
index 0000000..3797978
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/create.js
@@ -0,0 +1,107 @@
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+import { encodeNode } from "@webassemblyjs/wasm-gen";
+import { overrideBytesInBuffer } from "@webassemblyjs/helper-buffer";
+import constants from "@webassemblyjs/helper-wasm-bytecode";
+import * as t from "@webassemblyjs/ast";
+
+function findLastSection(ast, forSection) {
+  var targetSectionId = constants.sections[forSection]; // $FlowIgnore: metadata can not be empty
+
+  var moduleSections = ast.body[0].metadata.sections;
+  var lastSection;
+  var lastId = 0;
+
+  for (var i = 0, len = moduleSections.length; i < len; i++) {
+    var section = moduleSections[i]; // Ignore custom section since they can actually occur everywhere
+
+    if (section.section === "custom") {
+      continue;
+    }
+
+    var sectionId = constants.sections[section.section];
+
+    if (targetSectionId > lastId && targetSectionId < sectionId) {
+      return lastSection;
+    }
+
+    lastId = sectionId;
+    lastSection = section;
+  }
+
+  return lastSection;
+}
+
+export function createEmptySection(ast, uint8Buffer, section) {
+  // previous section after which we are going to insert our section
+  var lastSection = findLastSection(ast, section);
+  var start, end;
+  /**
+   * It's the first section
+   */
+
+  if (lastSection == null || lastSection.section === "custom") {
+    start = 8
+    /* wasm header size */
+    ;
+    end = start;
+  } else {
+    start = lastSection.startOffset + lastSection.size.value + 1;
+    end = start;
+  } // section id
+
+
+  start += 1;
+  var sizeStartLoc = {
+    line: -1,
+    column: start
+  };
+  var sizeEndLoc = {
+    line: -1,
+    column: start + 1
+  }; // 1 byte for the empty vector
+
+  var size = t.withLoc(t.numberLiteralFromRaw(1), sizeEndLoc, sizeStartLoc);
+  var vectorOfSizeStartLoc = {
+    line: -1,
+    column: sizeEndLoc.column
+  };
+  var vectorOfSizeEndLoc = {
+    line: -1,
+    column: sizeEndLoc.column + 1
+  };
+  var vectorOfSize = t.withLoc(t.numberLiteralFromRaw(0), vectorOfSizeEndLoc, vectorOfSizeStartLoc);
+  var sectionMetadata = t.sectionMetadata(section, start, size, vectorOfSize);
+  var sectionBytes = encodeNode(sectionMetadata);
+  uint8Buffer = overrideBytesInBuffer(uint8Buffer, start - 1, end, sectionBytes); // Add section into the AST for later lookups
+
+  if (_typeof(ast.body[0].metadata) === "object") {
+    // $FlowIgnore: metadata can not be empty
+    ast.body[0].metadata.sections.push(sectionMetadata);
+    t.sortSectionMetadata(ast.body[0]);
+  }
+  /**
+   * Update AST
+   */
+  // Once we hit our section every that is after needs to be shifted by the delta
+
+
+  var deltaBytes = +sectionBytes.length;
+  var encounteredSection = false;
+  t.traverse(ast, {
+    SectionMetadata: function SectionMetadata(path) {
+      if (path.node.section === section) {
+        encounteredSection = true;
+        return;
+      }
+
+      if (encounteredSection === true) {
+        t.shiftSection(ast, path.node, deltaBytes);
+      }
+    }
+  });
+  return {
+    uint8Buffer: uint8Buffer,
+    sectionMetadata: sectionMetadata
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/index.js
new file mode 100644
index 0000000..91afb0a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/index.js
@@ -0,0 +1,3 @@
+export { resizeSectionByteSize, resizeSectionVecSize } from "./resize";
+export { createEmptySection } from "./create";
+export { removeSections } from "./remove";
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/remove.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/remove.js
new file mode 100644
index 0000000..3ed85a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/remove.js
@@ -0,0 +1,36 @@
+import { traverse, getSectionMetadatas, shiftSection } from "@webassemblyjs/ast";
+import { overrideBytesInBuffer } from "@webassemblyjs/helper-buffer";
+export function removeSections(ast, uint8Buffer, section) {
+  var sectionMetadatas = getSectionMetadatas(ast, section);
+
+  if (sectionMetadatas.length === 0) {
+    throw new Error("Section metadata not found");
+  }
+
+  return sectionMetadatas.reverse().reduce(function (uint8Buffer, sectionMetadata) {
+    var startsIncludingId = sectionMetadata.startOffset - 1;
+    var ends = section === "start" ? sectionMetadata.size.loc.end.column + 1 : sectionMetadata.startOffset + sectionMetadata.size.value + 1;
+    var delta = -(ends - startsIncludingId);
+    /**
+     * update AST
+     */
+    // Once we hit our section every that is after needs to be shifted by the delta
+
+    var encounteredSection = false;
+    traverse(ast, {
+      SectionMetadata: function SectionMetadata(path) {
+        if (path.node.section === section) {
+          encounteredSection = true;
+          return path.remove();
+        }
+
+        if (encounteredSection === true) {
+          shiftSection(ast, path.node, delta);
+        }
+      }
+    }); // replacement is nothing
+
+    var replacement = [];
+    return overrideBytesInBuffer(uint8Buffer, startsIncludingId, ends, replacement);
+  }, uint8Buffer);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/resize.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/resize.js
new file mode 100644
index 0000000..9792078
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/esm/resize.js
@@ -0,0 +1,78 @@
+import { encodeU32 } from "@webassemblyjs/wasm-gen";
+import { getSectionMetadata, traverse, shiftSection } from "@webassemblyjs/ast";
+import { overrideBytesInBuffer } from "@webassemblyjs/helper-buffer";
+export function resizeSectionByteSize(ast, uint8Buffer, section, deltaBytes) {
+  var sectionMetadata = getSectionMetadata(ast, section);
+
+  if (typeof sectionMetadata === "undefined") {
+    throw new Error("Section metadata not found");
+  }
+
+  if (typeof sectionMetadata.size.loc === "undefined") {
+    throw new Error("SectionMetadata " + section + " has no loc");
+  } // keep old node location to be overriden
+
+
+  var start = sectionMetadata.size.loc.start.column;
+  var end = sectionMetadata.size.loc.end.column;
+  var newSectionSize = sectionMetadata.size.value + deltaBytes;
+  var newBytes = encodeU32(newSectionSize);
+  /**
+   * update AST
+   */
+
+  sectionMetadata.size.value = newSectionSize;
+  var oldu32EncodedLen = end - start;
+  var newu32EncodedLen = newBytes.length; // the new u32 has a different encoded length
+
+  if (newu32EncodedLen !== oldu32EncodedLen) {
+    var deltaInSizeEncoding = newu32EncodedLen - oldu32EncodedLen;
+    sectionMetadata.size.loc.end.column = start + newu32EncodedLen;
+    deltaBytes += deltaInSizeEncoding; // move the vec size pointer size the section size is now smaller
+
+    sectionMetadata.vectorOfSize.loc.start.column += deltaInSizeEncoding;
+    sectionMetadata.vectorOfSize.loc.end.column += deltaInSizeEncoding;
+  } // Once we hit our section every that is after needs to be shifted by the delta
+
+
+  var encounteredSection = false;
+  traverse(ast, {
+    SectionMetadata: function SectionMetadata(path) {
+      if (path.node.section === section) {
+        encounteredSection = true;
+        return;
+      }
+
+      if (encounteredSection === true) {
+        shiftSection(ast, path.node, deltaBytes);
+      }
+    }
+  });
+  return overrideBytesInBuffer(uint8Buffer, start, end, newBytes);
+}
+export function resizeSectionVecSize(ast, uint8Buffer, section, deltaElements) {
+  var sectionMetadata = getSectionMetadata(ast, section);
+
+  if (typeof sectionMetadata === "undefined") {
+    throw new Error("Section metadata not found");
+  }
+
+  if (typeof sectionMetadata.vectorOfSize.loc === "undefined") {
+    throw new Error("SectionMetadata " + section + " has no loc");
+  } // Section has no vector
+
+
+  if (sectionMetadata.vectorOfSize.value === -1) {
+    return uint8Buffer;
+  } // keep old node location to be overriden
+
+
+  var start = sectionMetadata.vectorOfSize.loc.start.column;
+  var end = sectionMetadata.vectorOfSize.loc.end.column;
+  var newValue = sectionMetadata.vectorOfSize.value + deltaElements;
+  var newBytes = encodeU32(newValue); // Update AST
+
+  sectionMetadata.vectorOfSize.value = newValue;
+  sectionMetadata.vectorOfSize.loc.end.column = start + newBytes.length;
+  return overrideBytesInBuffer(uint8Buffer, start, end, newBytes);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/create.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/create.js
new file mode 100644
index 0000000..9506eac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/create.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEmptySection = createEmptySection;
+
+var _wasmGen = require("@webassemblyjs/wasm-gen");
+
+var _helperBuffer = require("@webassemblyjs/helper-buffer");
+
+var _helperWasmBytecode = _interopRequireDefault(require("@webassemblyjs/helper-wasm-bytecode"));
+
+var t = _interopRequireWildcard(require("@webassemblyjs/ast"));
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function findLastSection(ast, forSection) {
+  var targetSectionId = _helperWasmBytecode.default.sections[forSection]; // $FlowIgnore: metadata can not be empty
+
+  var moduleSections = ast.body[0].metadata.sections;
+  var lastSection;
+  var lastId = 0;
+
+  for (var i = 0, len = moduleSections.length; i < len; i++) {
+    var section = moduleSections[i]; // Ignore custom section since they can actually occur everywhere
+
+    if (section.section === "custom") {
+      continue;
+    }
+
+    var sectionId = _helperWasmBytecode.default.sections[section.section];
+
+    if (targetSectionId > lastId && targetSectionId < sectionId) {
+      return lastSection;
+    }
+
+    lastId = sectionId;
+    lastSection = section;
+  }
+
+  return lastSection;
+}
+
+function createEmptySection(ast, uint8Buffer, section) {
+  // previous section after which we are going to insert our section
+  var lastSection = findLastSection(ast, section);
+  var start, end;
+  /**
+   * It's the first section
+   */
+
+  if (lastSection == null || lastSection.section === "custom") {
+    start = 8
+    /* wasm header size */
+    ;
+    end = start;
+  } else {
+    start = lastSection.startOffset + lastSection.size.value + 1;
+    end = start;
+  } // section id
+
+
+  start += 1;
+  var sizeStartLoc = {
+    line: -1,
+    column: start
+  };
+  var sizeEndLoc = {
+    line: -1,
+    column: start + 1
+  }; // 1 byte for the empty vector
+
+  var size = t.withLoc(t.numberLiteralFromRaw(1), sizeEndLoc, sizeStartLoc);
+  var vectorOfSizeStartLoc = {
+    line: -1,
+    column: sizeEndLoc.column
+  };
+  var vectorOfSizeEndLoc = {
+    line: -1,
+    column: sizeEndLoc.column + 1
+  };
+  var vectorOfSize = t.withLoc(t.numberLiteralFromRaw(0), vectorOfSizeEndLoc, vectorOfSizeStartLoc);
+  var sectionMetadata = t.sectionMetadata(section, start, size, vectorOfSize);
+  var sectionBytes = (0, _wasmGen.encodeNode)(sectionMetadata);
+  uint8Buffer = (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, start - 1, end, sectionBytes); // Add section into the AST for later lookups
+
+  if (_typeof(ast.body[0].metadata) === "object") {
+    // $FlowIgnore: metadata can not be empty
+    ast.body[0].metadata.sections.push(sectionMetadata);
+    t.sortSectionMetadata(ast.body[0]);
+  }
+  /**
+   * Update AST
+   */
+  // Once we hit our section every that is after needs to be shifted by the delta
+
+
+  var deltaBytes = +sectionBytes.length;
+  var encounteredSection = false;
+  t.traverse(ast, {
+    SectionMetadata: function SectionMetadata(path) {
+      if (path.node.section === section) {
+        encounteredSection = true;
+        return;
+      }
+
+      if (encounteredSection === true) {
+        t.shiftSection(ast, path.node, deltaBytes);
+      }
+    }
+  });
+  return {
+    uint8Buffer: uint8Buffer,
+    sectionMetadata: sectionMetadata
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/index.js
new file mode 100644
index 0000000..3c7963c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/index.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "resizeSectionByteSize", {
+  enumerable: true,
+  get: function get() {
+    return _resize.resizeSectionByteSize;
+  }
+});
+Object.defineProperty(exports, "resizeSectionVecSize", {
+  enumerable: true,
+  get: function get() {
+    return _resize.resizeSectionVecSize;
+  }
+});
+Object.defineProperty(exports, "createEmptySection", {
+  enumerable: true,
+  get: function get() {
+    return _create.createEmptySection;
+  }
+});
+Object.defineProperty(exports, "removeSections", {
+  enumerable: true,
+  get: function get() {
+    return _remove.removeSections;
+  }
+});
+
+var _resize = require("./resize");
+
+var _create = require("./create");
+
+var _remove = require("./remove");
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/remove.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/remove.js
new file mode 100644
index 0000000..008f5d6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/remove.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.removeSections = removeSections;
+
+var _ast = require("@webassemblyjs/ast");
+
+var _helperBuffer = require("@webassemblyjs/helper-buffer");
+
+function removeSections(ast, uint8Buffer, section) {
+  var sectionMetadatas = (0, _ast.getSectionMetadatas)(ast, section);
+
+  if (sectionMetadatas.length === 0) {
+    throw new Error("Section metadata not found");
+  }
+
+  return sectionMetadatas.reverse().reduce(function (uint8Buffer, sectionMetadata) {
+    var startsIncludingId = sectionMetadata.startOffset - 1;
+    var ends = section === "start" ? sectionMetadata.size.loc.end.column + 1 : sectionMetadata.startOffset + sectionMetadata.size.value + 1;
+    var delta = -(ends - startsIncludingId);
+    /**
+     * update AST
+     */
+    // Once we hit our section every that is after needs to be shifted by the delta
+
+    var encounteredSection = false;
+    (0, _ast.traverse)(ast, {
+      SectionMetadata: function SectionMetadata(path) {
+        if (path.node.section === section) {
+          encounteredSection = true;
+          return path.remove();
+        }
+
+        if (encounteredSection === true) {
+          (0, _ast.shiftSection)(ast, path.node, delta);
+        }
+      }
+    }); // replacement is nothing
+
+    var replacement = [];
+    return (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, startsIncludingId, ends, replacement);
+  }, uint8Buffer);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/resize.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/resize.js
new file mode 100644
index 0000000..524cacb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/lib/resize.js
@@ -0,0 +1,90 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resizeSectionByteSize = resizeSectionByteSize;
+exports.resizeSectionVecSize = resizeSectionVecSize;
+
+var _wasmGen = require("@webassemblyjs/wasm-gen");
+
+var _ast = require("@webassemblyjs/ast");
+
+var _helperBuffer = require("@webassemblyjs/helper-buffer");
+
+function resizeSectionByteSize(ast, uint8Buffer, section, deltaBytes) {
+  var sectionMetadata = (0, _ast.getSectionMetadata)(ast, section);
+
+  if (typeof sectionMetadata === "undefined") {
+    throw new Error("Section metadata not found");
+  }
+
+  if (typeof sectionMetadata.size.loc === "undefined") {
+    throw new Error("SectionMetadata " + section + " has no loc");
+  } // keep old node location to be overriden
+
+
+  var start = sectionMetadata.size.loc.start.column;
+  var end = sectionMetadata.size.loc.end.column;
+  var newSectionSize = sectionMetadata.size.value + deltaBytes;
+  var newBytes = (0, _wasmGen.encodeU32)(newSectionSize);
+  /**
+   * update AST
+   */
+
+  sectionMetadata.size.value = newSectionSize;
+  var oldu32EncodedLen = end - start;
+  var newu32EncodedLen = newBytes.length; // the new u32 has a different encoded length
+
+  if (newu32EncodedLen !== oldu32EncodedLen) {
+    var deltaInSizeEncoding = newu32EncodedLen - oldu32EncodedLen;
+    sectionMetadata.size.loc.end.column = start + newu32EncodedLen;
+    deltaBytes += deltaInSizeEncoding; // move the vec size pointer size the section size is now smaller
+
+    sectionMetadata.vectorOfSize.loc.start.column += deltaInSizeEncoding;
+    sectionMetadata.vectorOfSize.loc.end.column += deltaInSizeEncoding;
+  } // Once we hit our section every that is after needs to be shifted by the delta
+
+
+  var encounteredSection = false;
+  (0, _ast.traverse)(ast, {
+    SectionMetadata: function SectionMetadata(path) {
+      if (path.node.section === section) {
+        encounteredSection = true;
+        return;
+      }
+
+      if (encounteredSection === true) {
+        (0, _ast.shiftSection)(ast, path.node, deltaBytes);
+      }
+    }
+  });
+  return (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, start, end, newBytes);
+}
+
+function resizeSectionVecSize(ast, uint8Buffer, section, deltaElements) {
+  var sectionMetadata = (0, _ast.getSectionMetadata)(ast, section);
+
+  if (typeof sectionMetadata === "undefined") {
+    throw new Error("Section metadata not found");
+  }
+
+  if (typeof sectionMetadata.vectorOfSize.loc === "undefined") {
+    throw new Error("SectionMetadata " + section + " has no loc");
+  } // Section has no vector
+
+
+  if (sectionMetadata.vectorOfSize.value === -1) {
+    return uint8Buffer;
+  } // keep old node location to be overriden
+
+
+  var start = sectionMetadata.vectorOfSize.loc.start.column;
+  var end = sectionMetadata.vectorOfSize.loc.end.column;
+  var newValue = sectionMetadata.vectorOfSize.value + deltaElements;
+  var newBytes = (0, _wasmGen.encodeU32)(newValue); // Update AST
+
+  sectionMetadata.vectorOfSize.value = newValue;
+  sectionMetadata.vectorOfSize.loc.end.column = start + newBytes.length;
+  return (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, start, end, newBytes);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/package.json
new file mode 100644
index 0000000..1202f90
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/helper-wasm-section/package.json
@@ -0,0 +1,29 @@
+{
+  "name": "@webassemblyjs/helper-wasm-section",
+  "version": "1.11.1",
+  "description": "",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "dependencies": {
+    "@webassemblyjs/ast": "1.11.1",
+    "@webassemblyjs/helper-buffer": "1.11.1",
+    "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+    "@webassemblyjs/wasm-gen": "1.11.1"
+  },
+  "devDependencies": {
+    "@webassemblyjs/wasm-parser": "1.11.1"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/esm/index.js
new file mode 100644
index 0000000..88d9d4c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/esm/index.js
@@ -0,0 +1,33 @@
+import { write, read } from "@xtuc/ieee754";
+/**
+ * According to https://webassembly.github.io/spec/binary/values.html#binary-float
+ * n = 32/8
+ */
+
+export var NUMBER_OF_BYTE_F32 = 4;
+/**
+ * According to https://webassembly.github.io/spec/binary/values.html#binary-float
+ * n = 64/8
+ */
+
+export var NUMBER_OF_BYTE_F64 = 8;
+export var SINGLE_PRECISION_MANTISSA = 23;
+export var DOUBLE_PRECISION_MANTISSA = 52;
+export function encodeF32(v) {
+  var buffer = [];
+  write(buffer, v, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);
+  return buffer;
+}
+export function encodeF64(v) {
+  var buffer = [];
+  write(buffer, v, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);
+  return buffer;
+}
+export function decodeF32(bytes) {
+  var buffer = Buffer.from(bytes);
+  return read(buffer, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);
+}
+export function decodeF64(bytes) {
+  var buffer = Buffer.from(bytes);
+  return read(buffer, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/lib/index.js
new file mode 100644
index 0000000..27b9e22
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/lib/index.js
@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.encodeF32 = encodeF32;
+exports.encodeF64 = encodeF64;
+exports.decodeF32 = decodeF32;
+exports.decodeF64 = decodeF64;
+exports.DOUBLE_PRECISION_MANTISSA = exports.SINGLE_PRECISION_MANTISSA = exports.NUMBER_OF_BYTE_F64 = exports.NUMBER_OF_BYTE_F32 = void 0;
+
+var _ieee = require("@xtuc/ieee754");
+
+/**
+ * According to https://webassembly.github.io/spec/binary/values.html#binary-float
+ * n = 32/8
+ */
+var NUMBER_OF_BYTE_F32 = 4;
+/**
+ * According to https://webassembly.github.io/spec/binary/values.html#binary-float
+ * n = 64/8
+ */
+
+exports.NUMBER_OF_BYTE_F32 = NUMBER_OF_BYTE_F32;
+var NUMBER_OF_BYTE_F64 = 8;
+exports.NUMBER_OF_BYTE_F64 = NUMBER_OF_BYTE_F64;
+var SINGLE_PRECISION_MANTISSA = 23;
+exports.SINGLE_PRECISION_MANTISSA = SINGLE_PRECISION_MANTISSA;
+var DOUBLE_PRECISION_MANTISSA = 52;
+exports.DOUBLE_PRECISION_MANTISSA = DOUBLE_PRECISION_MANTISSA;
+
+function encodeF32(v) {
+  var buffer = [];
+  (0, _ieee.write)(buffer, v, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);
+  return buffer;
+}
+
+function encodeF64(v) {
+  var buffer = [];
+  (0, _ieee.write)(buffer, v, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);
+  return buffer;
+}
+
+function decodeF32(bytes) {
+  var buffer = Buffer.from(bytes);
+  return (0, _ieee.read)(buffer, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);
+}
+
+function decodeF64(bytes) {
+  var buffer = Buffer.from(bytes);
+  return (0, _ieee.read)(buffer, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/package.json
new file mode 100644
index 0000000..9eff2e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/package.json
@@ -0,0 +1,23 @@
+{
+  "name": "@webassemblyjs/ieee754",
+  "version": "1.11.1",
+  "description": "IEEE754 decoder and encoder",
+  "license": "MIT",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git",
+    "directory": "packages/ieee754"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "dependencies": {
+    "@xtuc/ieee754": "^1.2.0"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/src/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/src/index.js
new file mode 100644
index 0000000..c8540a5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/ieee754/src/index.js
@@ -0,0 +1,47 @@
+// @flow
+
+import { write, read } from "@xtuc/ieee754";
+
+/**
+ * According to https://webassembly.github.io/spec/binary/values.html#binary-float
+ * n = 32/8
+ */
+export const NUMBER_OF_BYTE_F32 = 4;
+
+/**
+ * According to https://webassembly.github.io/spec/binary/values.html#binary-float
+ * n = 64/8
+ */
+export const NUMBER_OF_BYTE_F64 = 8;
+
+export const SINGLE_PRECISION_MANTISSA = 23;
+
+export const DOUBLE_PRECISION_MANTISSA = 52;
+
+export function encodeF32(v: number): Array<number> {
+  const buffer = [];
+
+  write(buffer, v, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);
+
+  return buffer;
+}
+
+export function encodeF64(v: number): Array<number> {
+  const buffer = [];
+
+  write(buffer, v, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);
+
+  return buffer;
+}
+
+export function decodeF32(bytes: Array<Byte>): number {
+  const buffer = Buffer.from(bytes);
+
+  return read(buffer, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);
+}
+
+export function decodeF64(bytes: Array<Byte>): number {
+  const buffer = Buffer.from(bytes);
+
+  return read(buffer, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/LICENSE.txt b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/LICENSE.txt
new file mode 100644
index 0000000..55e332a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/LICENSE.txt
@@ -0,0 +1,194 @@
+Copyright 2012 The Obvious Corporation.
+http://obvious.com/
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+
+-------------------------------------------------------------------------
+                              Apache License
+                        Version 2.0, January 2004
+                     http://www.apache.org/licenses/
+
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+       Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+       stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+       that You distribute, all copyright, patent, trademark, and
+       attribution notices from the Source form of the Work,
+       excluding those notices that do not pertain to any part of
+       the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+       distribution, then any Derivative Works that You distribute must
+       include a readable copy of the attribution notices contained
+       within such NOTICE file, excluding those notices that do not
+       pertain to any part of the Derivative Works, in at least one
+       of the following places: within a NOTICE text file distributed
+       as part of the Derivative Works; within the Source form or
+       documentation, if provided along with the Derivative Works; or,
+       within a display generated by the Derivative Works, if and
+       wherever such third-party notices normally appear. The contents
+       of the NOTICE file are for informational purposes only and
+       do not modify the License. You may add Your own attribution
+       notices within Derivative Works that You distribute, alongside
+       or as an addendum to the NOTICE text from the Work, provided
+       that such additional attribution notices cannot be construed
+       as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/bits.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/bits.js
new file mode 100644
index 0000000..4c763cd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/bits.js
@@ -0,0 +1,145 @@
+// Copyright 2012 The Obvious Corporation.
+
+/*
+ * bits: Bitwise buffer utilities. The utilities here treat a buffer
+ * as a little-endian bigint, so the lowest-order bit is bit #0 of
+ * `buffer[0]`, and the highest-order bit is bit #7 of
+ * `buffer[buffer.length - 1]`.
+ */
+
+/*
+ * Modules used
+ */
+"use strict";
+/*
+ * Exported bindings
+ */
+
+/**
+ * Extracts the given number of bits from the buffer at the indicated
+ * index, returning a simple number as the result. If bits are requested
+ * that aren't covered by the buffer, the `defaultBit` is used as their
+ * value.
+ *
+ * The `bitLength` must be no more than 32. The `defaultBit` if not
+ * specified is taken to be `0`.
+ */
+
+export function extract(buffer, bitIndex, bitLength, defaultBit) {
+  if (bitLength < 0 || bitLength > 32) {
+    throw new Error("Bad value for bitLength.");
+  }
+
+  if (defaultBit === undefined) {
+    defaultBit = 0;
+  } else if (defaultBit !== 0 && defaultBit !== 1) {
+    throw new Error("Bad value for defaultBit.");
+  }
+
+  var defaultByte = defaultBit * 0xff;
+  var result = 0; // All starts are inclusive. The {endByte, endBit} pair is exclusive, but
+  // if endBit !== 0, then endByte is inclusive.
+
+  var lastBit = bitIndex + bitLength;
+  var startByte = Math.floor(bitIndex / 8);
+  var startBit = bitIndex % 8;
+  var endByte = Math.floor(lastBit / 8);
+  var endBit = lastBit % 8;
+
+  if (endBit !== 0) {
+    // `(1 << endBit) - 1` is the mask of all bits up to but not including
+    // the endBit.
+    result = get(endByte) & (1 << endBit) - 1;
+  }
+
+  while (endByte > startByte) {
+    endByte--;
+    result = result << 8 | get(endByte);
+  }
+
+  result >>>= startBit;
+  return result;
+
+  function get(index) {
+    var result = buffer[index];
+    return result === undefined ? defaultByte : result;
+  }
+}
+/**
+ * Injects the given bits into the given buffer at the given index. Any
+ * bits in the value beyond the length to set are ignored.
+ */
+
+export function inject(buffer, bitIndex, bitLength, value) {
+  if (bitLength < 0 || bitLength > 32) {
+    throw new Error("Bad value for bitLength.");
+  }
+
+  var lastByte = Math.floor((bitIndex + bitLength - 1) / 8);
+
+  if (bitIndex < 0 || lastByte >= buffer.length) {
+    throw new Error("Index out of range.");
+  } // Just keeping it simple, until / unless profiling shows that this
+  // is a problem.
+
+
+  var atByte = Math.floor(bitIndex / 8);
+  var atBit = bitIndex % 8;
+
+  while (bitLength > 0) {
+    if (value & 1) {
+      buffer[atByte] |= 1 << atBit;
+    } else {
+      buffer[atByte] &= ~(1 << atBit);
+    }
+
+    value >>= 1;
+    bitLength--;
+    atBit = (atBit + 1) % 8;
+
+    if (atBit === 0) {
+      atByte++;
+    }
+  }
+}
+/**
+ * Gets the sign bit of the given buffer.
+ */
+
+export function getSign(buffer) {
+  return buffer[buffer.length - 1] >>> 7;
+}
+/**
+ * Gets the zero-based bit number of the highest-order bit with the
+ * given value in the given buffer.
+ *
+ * If the buffer consists entirely of the other bit value, then this returns
+ * `-1`.
+ */
+
+export function highOrder(bit, buffer) {
+  var length = buffer.length;
+  var fullyWrongByte = (bit ^ 1) * 0xff; // the other-bit extended to a full byte
+
+  while (length > 0 && buffer[length - 1] === fullyWrongByte) {
+    length--;
+  }
+
+  if (length === 0) {
+    // Degenerate case. The buffer consists entirely of ~bit.
+    return -1;
+  }
+
+  var byteToCheck = buffer[length - 1];
+  var result = length * 8 - 1;
+
+  for (var i = 7; i > 0; i--) {
+    if ((byteToCheck >> i & 1) === bit) {
+      break;
+    }
+
+    result--;
+  }
+
+  return result;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/bufs.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/bufs.js
new file mode 100644
index 0000000..7e2a2bf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/bufs.js
@@ -0,0 +1,218 @@
+// Copyright 2012 The Obvious Corporation.
+
+/*
+ * bufs: Buffer utilities.
+ */
+
+/*
+ * Module variables
+ */
+
+/** Pool of buffers, where `bufPool[x].length === x`. */
+var bufPool = [];
+/** Maximum length of kept temporary buffers. */
+
+var TEMP_BUF_MAXIMUM_LENGTH = 20;
+/** Minimum exactly-representable 64-bit int. */
+
+var MIN_EXACT_INT64 = -0x8000000000000000;
+/** Maximum exactly-representable 64-bit int. */
+
+var MAX_EXACT_INT64 = 0x7ffffffffffffc00;
+/** Maximum exactly-representable 64-bit uint. */
+
+var MAX_EXACT_UINT64 = 0xfffffffffffff800;
+/**
+ * The int value consisting just of a 1 in bit #32 (that is, one more
+ * than the maximum 32-bit unsigned value).
+ */
+
+var BIT_32 = 0x100000000;
+/**
+ * The int value consisting just of a 1 in bit #64 (that is, one more
+ * than the maximum 64-bit unsigned value).
+ */
+
+var BIT_64 = 0x10000000000000000;
+/*
+ * Helper functions
+ */
+
+/**
+ * Masks off all but the lowest bit set of the given number.
+ */
+
+function lowestBit(num) {
+  return num & -num;
+}
+/**
+ * Gets whether trying to add the second number to the first is lossy
+ * (inexact). The first number is meant to be an accumulated result.
+ */
+
+
+function isLossyToAdd(accum, num) {
+  if (num === 0) {
+    return false;
+  }
+
+  var lowBit = lowestBit(num);
+  var added = accum + lowBit;
+
+  if (added === accum) {
+    return true;
+  }
+
+  if (added - lowBit !== accum) {
+    return true;
+  }
+
+  return false;
+}
+/*
+ * Exported functions
+ */
+
+/**
+ * Allocates a buffer of the given length, which is initialized
+ * with all zeroes. This returns a buffer from the pool if it is
+ * available, or a freshly-allocated buffer if not.
+ */
+
+
+export function alloc(length) {
+  var result = bufPool[length];
+
+  if (result) {
+    bufPool[length] = undefined;
+  } else {
+    result = new Buffer(length);
+  }
+
+  result.fill(0);
+  return result;
+}
+/**
+ * Releases a buffer back to the pool.
+ */
+
+export function free(buffer) {
+  var length = buffer.length;
+
+  if (length < TEMP_BUF_MAXIMUM_LENGTH) {
+    bufPool[length] = buffer;
+  }
+}
+/**
+ * Resizes a buffer, returning a new buffer. Returns the argument if
+ * the length wouldn't actually change. This function is only safe to
+ * use if the given buffer was allocated within this module (since
+ * otherwise the buffer might possibly be shared externally).
+ */
+
+export function resize(buffer, length) {
+  if (length === buffer.length) {
+    return buffer;
+  }
+
+  var newBuf = alloc(length);
+  buffer.copy(newBuf);
+  free(buffer);
+  return newBuf;
+}
+/**
+ * Reads an arbitrary signed int from a buffer.
+ */
+
+export function readInt(buffer) {
+  var length = buffer.length;
+  var positive = buffer[length - 1] < 0x80;
+  var result = positive ? 0 : -1;
+  var lossy = false; // Note: We can't use bit manipulation here, since that stops
+  // working if the result won't fit in a 32-bit int.
+
+  if (length < 7) {
+    // Common case which can't possibly be lossy (because the result has
+    // no more than 48 bits, and loss only happens with 54 or more).
+    for (var i = length - 1; i >= 0; i--) {
+      result = result * 0x100 + buffer[i];
+    }
+  } else {
+    for (var _i = length - 1; _i >= 0; _i--) {
+      var one = buffer[_i];
+      result *= 0x100;
+
+      if (isLossyToAdd(result, one)) {
+        lossy = true;
+      }
+
+      result += one;
+    }
+  }
+
+  return {
+    value: result,
+    lossy: lossy
+  };
+}
+/**
+ * Reads an arbitrary unsigned int from a buffer.
+ */
+
+export function readUInt(buffer) {
+  var length = buffer.length;
+  var result = 0;
+  var lossy = false; // Note: See above in re bit manipulation.
+
+  if (length < 7) {
+    // Common case which can't possibly be lossy (see above).
+    for (var i = length - 1; i >= 0; i--) {
+      result = result * 0x100 + buffer[i];
+    }
+  } else {
+    for (var _i2 = length - 1; _i2 >= 0; _i2--) {
+      var one = buffer[_i2];
+      result *= 0x100;
+
+      if (isLossyToAdd(result, one)) {
+        lossy = true;
+      }
+
+      result += one;
+    }
+  }
+
+  return {
+    value: result,
+    lossy: lossy
+  };
+}
+/**
+ * Writes a little-endian 64-bit signed int into a buffer.
+ */
+
+export function writeInt64(value, buffer) {
+  if (value < MIN_EXACT_INT64 || value > MAX_EXACT_INT64) {
+    throw new Error("Value out of range.");
+  }
+
+  if (value < 0) {
+    value += BIT_64;
+  }
+
+  writeUInt64(value, buffer);
+}
+/**
+ * Writes a little-endian 64-bit unsigned int into a buffer.
+ */
+
+export function writeUInt64(value, buffer) {
+  if (value < 0 || value > MAX_EXACT_UINT64) {
+    throw new Error("Value out of range.");
+  }
+
+  var lowWord = value % BIT_32;
+  var highWord = Math.floor(value / BIT_32);
+  buffer.writeUInt32LE(lowWord, 0);
+  buffer.writeUInt32LE(highWord, 4);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/index.js
new file mode 100644
index 0000000..7ee23fa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/index.js
@@ -0,0 +1,34 @@
+import leb from "./leb";
+/**
+ * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
+ * max = ceil(32/7)
+ */
+
+export var MAX_NUMBER_OF_BYTE_U32 = 5;
+/**
+ * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
+ * max = ceil(64/7)
+ */
+
+export var MAX_NUMBER_OF_BYTE_U64 = 10;
+export function decodeInt64(encodedBuffer, index) {
+  return leb.decodeInt64(encodedBuffer, index);
+}
+export function decodeUInt64(encodedBuffer, index) {
+  return leb.decodeUInt64(encodedBuffer, index);
+}
+export function decodeInt32(encodedBuffer, index) {
+  return leb.decodeInt32(encodedBuffer, index);
+}
+export function decodeUInt32(encodedBuffer, index) {
+  return leb.decodeUInt32(encodedBuffer, index);
+}
+export function encodeU32(v) {
+  return leb.encodeUInt32(v);
+}
+export function encodeI32(v) {
+  return leb.encodeInt32(v);
+}
+export function encodeI64(v) {
+  return leb.encodeInt64(v);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/leb.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/leb.js
new file mode 100644
index 0000000..1b6ee09
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/esm/leb.js
@@ -0,0 +1,316 @@
+// Copyright 2012 The Obvious Corporation.
+
+/*
+ * leb: LEB128 utilities.
+ */
+
+/*
+ * Modules used
+ */
+"use strict";
+
+import Long from "@xtuc/long";
+import * as bits from "./bits";
+import * as bufs from "./bufs";
+/*
+ * Module variables
+ */
+
+/** The minimum possible 32-bit signed int. */
+
+var MIN_INT32 = -0x80000000;
+/** The maximum possible 32-bit signed int. */
+
+var MAX_INT32 = 0x7fffffff;
+/** The maximum possible 32-bit unsigned int. */
+
+var MAX_UINT32 = 0xffffffff;
+/** The minimum possible 64-bit signed int. */
+// const MIN_INT64 = -0x8000000000000000;
+
+/**
+ * The maximum possible 64-bit signed int that is representable as a
+ * JavaScript number.
+ */
+// const MAX_INT64 = 0x7ffffffffffffc00;
+
+/**
+ * The maximum possible 64-bit unsigned int that is representable as a
+ * JavaScript number.
+ */
+// const MAX_UINT64 = 0xfffffffffffff800;
+
+/*
+ * Helper functions
+ */
+
+/**
+ * Determines the number of bits required to encode the number
+ * represented in the given buffer as a signed value. The buffer is
+ * taken to represent a signed number in little-endian form.
+ *
+ * The number of bits to encode is the (zero-based) bit number of the
+ * highest-order non-sign-matching bit, plus two. For example:
+ *
+ *   11111011 01110101
+ *   high          low
+ *
+ * The sign bit here is 1 (that is, it's a negative number). The highest
+ * bit number that doesn't match the sign is bit #10 (where the lowest-order
+ * bit is bit #0). So, we have to encode at least 12 bits total.
+ *
+ * As a special degenerate case, the numbers 0 and -1 each require just one bit.
+ */
+
+function signedBitCount(buffer) {
+  return bits.highOrder(bits.getSign(buffer) ^ 1, buffer) + 2;
+}
+/**
+ * Determines the number of bits required to encode the number
+ * represented in the given buffer as an unsigned value. The buffer is
+ * taken to represent an unsigned number in little-endian form.
+ *
+ * The number of bits to encode is the (zero-based) bit number of the
+ * highest-order 1 bit, plus one. For example:
+ *
+ *   00011000 01010011
+ *   high          low
+ *
+ * The highest-order 1 bit here is bit #12 (where the lowest-order bit
+ * is bit #0). So, we have to encode at least 13 bits total.
+ *
+ * As a special degenerate case, the number 0 requires 1 bit.
+ */
+
+
+function unsignedBitCount(buffer) {
+  var result = bits.highOrder(1, buffer) + 1;
+  return result ? result : 1;
+}
+/**
+ * Common encoder for both signed and unsigned ints. This takes a
+ * bigint-ish buffer, returning an LEB128-encoded buffer.
+ */
+
+
+function encodeBufferCommon(buffer, signed) {
+  var signBit;
+  var bitCount;
+
+  if (signed) {
+    signBit = bits.getSign(buffer);
+    bitCount = signedBitCount(buffer);
+  } else {
+    signBit = 0;
+    bitCount = unsignedBitCount(buffer);
+  }
+
+  var byteCount = Math.ceil(bitCount / 7);
+  var result = bufs.alloc(byteCount);
+
+  for (var i = 0; i < byteCount; i++) {
+    var payload = bits.extract(buffer, i * 7, 7, signBit);
+    result[i] = payload | 0x80;
+  } // Mask off the top bit of the last byte, to indicate the end of the
+  // encoding.
+
+
+  result[byteCount - 1] &= 0x7f;
+  return result;
+}
+/**
+ * Gets the byte-length of the value encoded in the given buffer at
+ * the given index.
+ */
+
+
+function encodedLength(encodedBuffer, index) {
+  var result = 0;
+
+  while (encodedBuffer[index + result] >= 0x80) {
+    result++;
+  }
+
+  result++; // to account for the last byte
+
+  if (index + result > encodedBuffer.length) {// FIXME(sven): seems to cause false positives
+    // throw new Error("integer representation too long");
+  }
+
+  return result;
+}
+/**
+ * Common decoder for both signed and unsigned ints. This takes an
+ * LEB128-encoded buffer, returning a bigint-ish buffer.
+ */
+
+
+function decodeBufferCommon(encodedBuffer, index, signed) {
+  index = index === undefined ? 0 : index;
+  var length = encodedLength(encodedBuffer, index);
+  var bitLength = length * 7;
+  var byteLength = Math.ceil(bitLength / 8);
+  var result = bufs.alloc(byteLength);
+  var outIndex = 0;
+
+  while (length > 0) {
+    bits.inject(result, outIndex, 7, encodedBuffer[index]);
+    outIndex += 7;
+    index++;
+    length--;
+  }
+
+  var signBit;
+  var signByte;
+
+  if (signed) {
+    // Sign-extend the last byte.
+    var lastByte = result[byteLength - 1];
+    var endBit = outIndex % 8;
+
+    if (endBit !== 0) {
+      var shift = 32 - endBit; // 32 because JS bit ops work on 32-bit ints.
+
+      lastByte = result[byteLength - 1] = lastByte << shift >> shift & 0xff;
+    }
+
+    signBit = lastByte >> 7;
+    signByte = signBit * 0xff;
+  } else {
+    signBit = 0;
+    signByte = 0;
+  } // Slice off any superfluous bytes, that is, ones that add no meaningful
+  // bits (because the value would be the same if they were removed).
+
+
+  while (byteLength > 1 && result[byteLength - 1] === signByte && (!signed || result[byteLength - 2] >> 7 === signBit)) {
+    byteLength--;
+  }
+
+  result = bufs.resize(result, byteLength);
+  return {
+    value: result,
+    nextIndex: index
+  };
+}
+/*
+ * Exported bindings
+ */
+
+
+function encodeIntBuffer(buffer) {
+  return encodeBufferCommon(buffer, true);
+}
+
+function decodeIntBuffer(encodedBuffer, index) {
+  return decodeBufferCommon(encodedBuffer, index, true);
+}
+
+function encodeInt32(num) {
+  var buf = bufs.alloc(4);
+  buf.writeInt32LE(num, 0);
+  var result = encodeIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeInt32(encodedBuffer, index) {
+  var result = decodeIntBuffer(encodedBuffer, index);
+  var parsed = bufs.readInt(result.value);
+  var value = parsed.value;
+  bufs.free(result.value);
+
+  if (value < MIN_INT32 || value > MAX_INT32) {
+    throw new Error("integer too large");
+  }
+
+  return {
+    value: value,
+    nextIndex: result.nextIndex
+  };
+}
+
+function encodeInt64(num) {
+  var buf = bufs.alloc(8);
+  bufs.writeInt64(num, buf);
+  var result = encodeIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeInt64(encodedBuffer, index) {
+  var result = decodeIntBuffer(encodedBuffer, index);
+  var value = Long.fromBytesLE(result.value, false);
+  bufs.free(result.value);
+  return {
+    value: value,
+    nextIndex: result.nextIndex,
+    lossy: false
+  };
+}
+
+function encodeUIntBuffer(buffer) {
+  return encodeBufferCommon(buffer, false);
+}
+
+function decodeUIntBuffer(encodedBuffer, index) {
+  return decodeBufferCommon(encodedBuffer, index, false);
+}
+
+function encodeUInt32(num) {
+  var buf = bufs.alloc(4);
+  buf.writeUInt32LE(num, 0);
+  var result = encodeUIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeUInt32(encodedBuffer, index) {
+  var result = decodeUIntBuffer(encodedBuffer, index);
+  var parsed = bufs.readUInt(result.value);
+  var value = parsed.value;
+  bufs.free(result.value);
+
+  if (value > MAX_UINT32) {
+    throw new Error("integer too large");
+  }
+
+  return {
+    value: value,
+    nextIndex: result.nextIndex
+  };
+}
+
+function encodeUInt64(num) {
+  var buf = bufs.alloc(8);
+  bufs.writeUInt64(num, buf);
+  var result = encodeUIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeUInt64(encodedBuffer, index) {
+  var result = decodeUIntBuffer(encodedBuffer, index);
+  var value = Long.fromBytesLE(result.value, true);
+  bufs.free(result.value);
+  return {
+    value: value,
+    nextIndex: result.nextIndex,
+    lossy: false
+  };
+}
+
+export default {
+  decodeInt32: decodeInt32,
+  decodeInt64: decodeInt64,
+  decodeIntBuffer: decodeIntBuffer,
+  decodeUInt32: decodeUInt32,
+  decodeUInt64: decodeUInt64,
+  decodeUIntBuffer: decodeUIntBuffer,
+  encodeInt32: encodeInt32,
+  encodeInt64: encodeInt64,
+  encodeIntBuffer: encodeIntBuffer,
+  encodeUInt32: encodeUInt32,
+  encodeUInt64: encodeUInt64,
+  encodeUIntBuffer: encodeUIntBuffer
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/bits.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/bits.js
new file mode 100644
index 0000000..5acf246
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/bits.js
@@ -0,0 +1,156 @@
+// Copyright 2012 The Obvious Corporation.
+
+/*
+ * bits: Bitwise buffer utilities. The utilities here treat a buffer
+ * as a little-endian bigint, so the lowest-order bit is bit #0 of
+ * `buffer[0]`, and the highest-order bit is bit #7 of
+ * `buffer[buffer.length - 1]`.
+ */
+
+/*
+ * Modules used
+ */
+"use strict";
+/*
+ * Exported bindings
+ */
+
+/**
+ * Extracts the given number of bits from the buffer at the indicated
+ * index, returning a simple number as the result. If bits are requested
+ * that aren't covered by the buffer, the `defaultBit` is used as their
+ * value.
+ *
+ * The `bitLength` must be no more than 32. The `defaultBit` if not
+ * specified is taken to be `0`.
+ */
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.extract = extract;
+exports.inject = inject;
+exports.getSign = getSign;
+exports.highOrder = highOrder;
+
+function extract(buffer, bitIndex, bitLength, defaultBit) {
+  if (bitLength < 0 || bitLength > 32) {
+    throw new Error("Bad value for bitLength.");
+  }
+
+  if (defaultBit === undefined) {
+    defaultBit = 0;
+  } else if (defaultBit !== 0 && defaultBit !== 1) {
+    throw new Error("Bad value for defaultBit.");
+  }
+
+  var defaultByte = defaultBit * 0xff;
+  var result = 0; // All starts are inclusive. The {endByte, endBit} pair is exclusive, but
+  // if endBit !== 0, then endByte is inclusive.
+
+  var lastBit = bitIndex + bitLength;
+  var startByte = Math.floor(bitIndex / 8);
+  var startBit = bitIndex % 8;
+  var endByte = Math.floor(lastBit / 8);
+  var endBit = lastBit % 8;
+
+  if (endBit !== 0) {
+    // `(1 << endBit) - 1` is the mask of all bits up to but not including
+    // the endBit.
+    result = get(endByte) & (1 << endBit) - 1;
+  }
+
+  while (endByte > startByte) {
+    endByte--;
+    result = result << 8 | get(endByte);
+  }
+
+  result >>>= startBit;
+  return result;
+
+  function get(index) {
+    var result = buffer[index];
+    return result === undefined ? defaultByte : result;
+  }
+}
+/**
+ * Injects the given bits into the given buffer at the given index. Any
+ * bits in the value beyond the length to set are ignored.
+ */
+
+
+function inject(buffer, bitIndex, bitLength, value) {
+  if (bitLength < 0 || bitLength > 32) {
+    throw new Error("Bad value for bitLength.");
+  }
+
+  var lastByte = Math.floor((bitIndex + bitLength - 1) / 8);
+
+  if (bitIndex < 0 || lastByte >= buffer.length) {
+    throw new Error("Index out of range.");
+  } // Just keeping it simple, until / unless profiling shows that this
+  // is a problem.
+
+
+  var atByte = Math.floor(bitIndex / 8);
+  var atBit = bitIndex % 8;
+
+  while (bitLength > 0) {
+    if (value & 1) {
+      buffer[atByte] |= 1 << atBit;
+    } else {
+      buffer[atByte] &= ~(1 << atBit);
+    }
+
+    value >>= 1;
+    bitLength--;
+    atBit = (atBit + 1) % 8;
+
+    if (atBit === 0) {
+      atByte++;
+    }
+  }
+}
+/**
+ * Gets the sign bit of the given buffer.
+ */
+
+
+function getSign(buffer) {
+  return buffer[buffer.length - 1] >>> 7;
+}
+/**
+ * Gets the zero-based bit number of the highest-order bit with the
+ * given value in the given buffer.
+ *
+ * If the buffer consists entirely of the other bit value, then this returns
+ * `-1`.
+ */
+
+
+function highOrder(bit, buffer) {
+  var length = buffer.length;
+  var fullyWrongByte = (bit ^ 1) * 0xff; // the other-bit extended to a full byte
+
+  while (length > 0 && buffer[length - 1] === fullyWrongByte) {
+    length--;
+  }
+
+  if (length === 0) {
+    // Degenerate case. The buffer consists entirely of ~bit.
+    return -1;
+  }
+
+  var byteToCheck = buffer[length - 1];
+  var result = length * 8 - 1;
+
+  for (var i = 7; i > 0; i--) {
+    if ((byteToCheck >> i & 1) === bit) {
+      break;
+    }
+
+    result--;
+  }
+
+  return result;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/bufs.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/bufs.js
new file mode 100644
index 0000000..f9a176e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/bufs.js
@@ -0,0 +1,236 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.alloc = alloc;
+exports.free = free;
+exports.resize = resize;
+exports.readInt = readInt;
+exports.readUInt = readUInt;
+exports.writeInt64 = writeInt64;
+exports.writeUInt64 = writeUInt64;
+// Copyright 2012 The Obvious Corporation.
+
+/*
+ * bufs: Buffer utilities.
+ */
+
+/*
+ * Module variables
+ */
+
+/** Pool of buffers, where `bufPool[x].length === x`. */
+var bufPool = [];
+/** Maximum length of kept temporary buffers. */
+
+var TEMP_BUF_MAXIMUM_LENGTH = 20;
+/** Minimum exactly-representable 64-bit int. */
+
+var MIN_EXACT_INT64 = -0x8000000000000000;
+/** Maximum exactly-representable 64-bit int. */
+
+var MAX_EXACT_INT64 = 0x7ffffffffffffc00;
+/** Maximum exactly-representable 64-bit uint. */
+
+var MAX_EXACT_UINT64 = 0xfffffffffffff800;
+/**
+ * The int value consisting just of a 1 in bit #32 (that is, one more
+ * than the maximum 32-bit unsigned value).
+ */
+
+var BIT_32 = 0x100000000;
+/**
+ * The int value consisting just of a 1 in bit #64 (that is, one more
+ * than the maximum 64-bit unsigned value).
+ */
+
+var BIT_64 = 0x10000000000000000;
+/*
+ * Helper functions
+ */
+
+/**
+ * Masks off all but the lowest bit set of the given number.
+ */
+
+function lowestBit(num) {
+  return num & -num;
+}
+/**
+ * Gets whether trying to add the second number to the first is lossy
+ * (inexact). The first number is meant to be an accumulated result.
+ */
+
+
+function isLossyToAdd(accum, num) {
+  if (num === 0) {
+    return false;
+  }
+
+  var lowBit = lowestBit(num);
+  var added = accum + lowBit;
+
+  if (added === accum) {
+    return true;
+  }
+
+  if (added - lowBit !== accum) {
+    return true;
+  }
+
+  return false;
+}
+/*
+ * Exported functions
+ */
+
+/**
+ * Allocates a buffer of the given length, which is initialized
+ * with all zeroes. This returns a buffer from the pool if it is
+ * available, or a freshly-allocated buffer if not.
+ */
+
+
+function alloc(length) {
+  var result = bufPool[length];
+
+  if (result) {
+    bufPool[length] = undefined;
+  } else {
+    result = new Buffer(length);
+  }
+
+  result.fill(0);
+  return result;
+}
+/**
+ * Releases a buffer back to the pool.
+ */
+
+
+function free(buffer) {
+  var length = buffer.length;
+
+  if (length < TEMP_BUF_MAXIMUM_LENGTH) {
+    bufPool[length] = buffer;
+  }
+}
+/**
+ * Resizes a buffer, returning a new buffer. Returns the argument if
+ * the length wouldn't actually change. This function is only safe to
+ * use if the given buffer was allocated within this module (since
+ * otherwise the buffer might possibly be shared externally).
+ */
+
+
+function resize(buffer, length) {
+  if (length === buffer.length) {
+    return buffer;
+  }
+
+  var newBuf = alloc(length);
+  buffer.copy(newBuf);
+  free(buffer);
+  return newBuf;
+}
+/**
+ * Reads an arbitrary signed int from a buffer.
+ */
+
+
+function readInt(buffer) {
+  var length = buffer.length;
+  var positive = buffer[length - 1] < 0x80;
+  var result = positive ? 0 : -1;
+  var lossy = false; // Note: We can't use bit manipulation here, since that stops
+  // working if the result won't fit in a 32-bit int.
+
+  if (length < 7) {
+    // Common case which can't possibly be lossy (because the result has
+    // no more than 48 bits, and loss only happens with 54 or more).
+    for (var i = length - 1; i >= 0; i--) {
+      result = result * 0x100 + buffer[i];
+    }
+  } else {
+    for (var _i = length - 1; _i >= 0; _i--) {
+      var one = buffer[_i];
+      result *= 0x100;
+
+      if (isLossyToAdd(result, one)) {
+        lossy = true;
+      }
+
+      result += one;
+    }
+  }
+
+  return {
+    value: result,
+    lossy: lossy
+  };
+}
+/**
+ * Reads an arbitrary unsigned int from a buffer.
+ */
+
+
+function readUInt(buffer) {
+  var length = buffer.length;
+  var result = 0;
+  var lossy = false; // Note: See above in re bit manipulation.
+
+  if (length < 7) {
+    // Common case which can't possibly be lossy (see above).
+    for (var i = length - 1; i >= 0; i--) {
+      result = result * 0x100 + buffer[i];
+    }
+  } else {
+    for (var _i2 = length - 1; _i2 >= 0; _i2--) {
+      var one = buffer[_i2];
+      result *= 0x100;
+
+      if (isLossyToAdd(result, one)) {
+        lossy = true;
+      }
+
+      result += one;
+    }
+  }
+
+  return {
+    value: result,
+    lossy: lossy
+  };
+}
+/**
+ * Writes a little-endian 64-bit signed int into a buffer.
+ */
+
+
+function writeInt64(value, buffer) {
+  if (value < MIN_EXACT_INT64 || value > MAX_EXACT_INT64) {
+    throw new Error("Value out of range.");
+  }
+
+  if (value < 0) {
+    value += BIT_64;
+  }
+
+  writeUInt64(value, buffer);
+}
+/**
+ * Writes a little-endian 64-bit unsigned int into a buffer.
+ */
+
+
+function writeUInt64(value, buffer) {
+  if (value < 0 || value > MAX_EXACT_UINT64) {
+    throw new Error("Value out of range.");
+  }
+
+  var lowWord = value % BIT_32;
+  var highWord = Math.floor(value / BIT_32);
+  buffer.writeUInt32LE(lowWord, 0);
+  buffer.writeUInt32LE(highWord, 4);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/index.js
new file mode 100644
index 0000000..6687537
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/index.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.decodeInt64 = decodeInt64;
+exports.decodeUInt64 = decodeUInt64;
+exports.decodeInt32 = decodeInt32;
+exports.decodeUInt32 = decodeUInt32;
+exports.encodeU32 = encodeU32;
+exports.encodeI32 = encodeI32;
+exports.encodeI64 = encodeI64;
+exports.MAX_NUMBER_OF_BYTE_U64 = exports.MAX_NUMBER_OF_BYTE_U32 = void 0;
+
+var _leb = _interopRequireDefault(require("./leb"));
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/**
+ * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
+ * max = ceil(32/7)
+ */
+var MAX_NUMBER_OF_BYTE_U32 = 5;
+/**
+ * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
+ * max = ceil(64/7)
+ */
+
+exports.MAX_NUMBER_OF_BYTE_U32 = MAX_NUMBER_OF_BYTE_U32;
+var MAX_NUMBER_OF_BYTE_U64 = 10;
+exports.MAX_NUMBER_OF_BYTE_U64 = MAX_NUMBER_OF_BYTE_U64;
+
+function decodeInt64(encodedBuffer, index) {
+  return _leb.default.decodeInt64(encodedBuffer, index);
+}
+
+function decodeUInt64(encodedBuffer, index) {
+  return _leb.default.decodeUInt64(encodedBuffer, index);
+}
+
+function decodeInt32(encodedBuffer, index) {
+  return _leb.default.decodeInt32(encodedBuffer, index);
+}
+
+function decodeUInt32(encodedBuffer, index) {
+  return _leb.default.decodeUInt32(encodedBuffer, index);
+}
+
+function encodeU32(v) {
+  return _leb.default.encodeUInt32(v);
+}
+
+function encodeI32(v) {
+  return _leb.default.encodeInt32(v);
+}
+
+function encodeI64(v) {
+  return _leb.default.encodeInt64(v);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/leb.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/leb.js
new file mode 100644
index 0000000..3c1d4aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/lib/leb.js
@@ -0,0 +1,332 @@
+// Copyright 2012 The Obvious Corporation.
+
+/*
+ * leb: LEB128 utilities.
+ */
+
+/*
+ * Modules used
+ */
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var _long = _interopRequireDefault(require("@xtuc/long"));
+
+var bits = _interopRequireWildcard(require("./bits"));
+
+var bufs = _interopRequireWildcard(require("./bufs"));
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/*
+ * Module variables
+ */
+
+/** The minimum possible 32-bit signed int. */
+var MIN_INT32 = -0x80000000;
+/** The maximum possible 32-bit signed int. */
+
+var MAX_INT32 = 0x7fffffff;
+/** The maximum possible 32-bit unsigned int. */
+
+var MAX_UINT32 = 0xffffffff;
+/** The minimum possible 64-bit signed int. */
+// const MIN_INT64 = -0x8000000000000000;
+
+/**
+ * The maximum possible 64-bit signed int that is representable as a
+ * JavaScript number.
+ */
+// const MAX_INT64 = 0x7ffffffffffffc00;
+
+/**
+ * The maximum possible 64-bit unsigned int that is representable as a
+ * JavaScript number.
+ */
+// const MAX_UINT64 = 0xfffffffffffff800;
+
+/*
+ * Helper functions
+ */
+
+/**
+ * Determines the number of bits required to encode the number
+ * represented in the given buffer as a signed value. The buffer is
+ * taken to represent a signed number in little-endian form.
+ *
+ * The number of bits to encode is the (zero-based) bit number of the
+ * highest-order non-sign-matching bit, plus two. For example:
+ *
+ *   11111011 01110101
+ *   high          low
+ *
+ * The sign bit here is 1 (that is, it's a negative number). The highest
+ * bit number that doesn't match the sign is bit #10 (where the lowest-order
+ * bit is bit #0). So, we have to encode at least 12 bits total.
+ *
+ * As a special degenerate case, the numbers 0 and -1 each require just one bit.
+ */
+
+function signedBitCount(buffer) {
+  return bits.highOrder(bits.getSign(buffer) ^ 1, buffer) + 2;
+}
+/**
+ * Determines the number of bits required to encode the number
+ * represented in the given buffer as an unsigned value. The buffer is
+ * taken to represent an unsigned number in little-endian form.
+ *
+ * The number of bits to encode is the (zero-based) bit number of the
+ * highest-order 1 bit, plus one. For example:
+ *
+ *   00011000 01010011
+ *   high          low
+ *
+ * The highest-order 1 bit here is bit #12 (where the lowest-order bit
+ * is bit #0). So, we have to encode at least 13 bits total.
+ *
+ * As a special degenerate case, the number 0 requires 1 bit.
+ */
+
+
+function unsignedBitCount(buffer) {
+  var result = bits.highOrder(1, buffer) + 1;
+  return result ? result : 1;
+}
+/**
+ * Common encoder for both signed and unsigned ints. This takes a
+ * bigint-ish buffer, returning an LEB128-encoded buffer.
+ */
+
+
+function encodeBufferCommon(buffer, signed) {
+  var signBit;
+  var bitCount;
+
+  if (signed) {
+    signBit = bits.getSign(buffer);
+    bitCount = signedBitCount(buffer);
+  } else {
+    signBit = 0;
+    bitCount = unsignedBitCount(buffer);
+  }
+
+  var byteCount = Math.ceil(bitCount / 7);
+  var result = bufs.alloc(byteCount);
+
+  for (var i = 0; i < byteCount; i++) {
+    var payload = bits.extract(buffer, i * 7, 7, signBit);
+    result[i] = payload | 0x80;
+  } // Mask off the top bit of the last byte, to indicate the end of the
+  // encoding.
+
+
+  result[byteCount - 1] &= 0x7f;
+  return result;
+}
+/**
+ * Gets the byte-length of the value encoded in the given buffer at
+ * the given index.
+ */
+
+
+function encodedLength(encodedBuffer, index) {
+  var result = 0;
+
+  while (encodedBuffer[index + result] >= 0x80) {
+    result++;
+  }
+
+  result++; // to account for the last byte
+
+  if (index + result > encodedBuffer.length) {// FIXME(sven): seems to cause false positives
+    // throw new Error("integer representation too long");
+  }
+
+  return result;
+}
+/**
+ * Common decoder for both signed and unsigned ints. This takes an
+ * LEB128-encoded buffer, returning a bigint-ish buffer.
+ */
+
+
+function decodeBufferCommon(encodedBuffer, index, signed) {
+  index = index === undefined ? 0 : index;
+  var length = encodedLength(encodedBuffer, index);
+  var bitLength = length * 7;
+  var byteLength = Math.ceil(bitLength / 8);
+  var result = bufs.alloc(byteLength);
+  var outIndex = 0;
+
+  while (length > 0) {
+    bits.inject(result, outIndex, 7, encodedBuffer[index]);
+    outIndex += 7;
+    index++;
+    length--;
+  }
+
+  var signBit;
+  var signByte;
+
+  if (signed) {
+    // Sign-extend the last byte.
+    var lastByte = result[byteLength - 1];
+    var endBit = outIndex % 8;
+
+    if (endBit !== 0) {
+      var shift = 32 - endBit; // 32 because JS bit ops work on 32-bit ints.
+
+      lastByte = result[byteLength - 1] = lastByte << shift >> shift & 0xff;
+    }
+
+    signBit = lastByte >> 7;
+    signByte = signBit * 0xff;
+  } else {
+    signBit = 0;
+    signByte = 0;
+  } // Slice off any superfluous bytes, that is, ones that add no meaningful
+  // bits (because the value would be the same if they were removed).
+
+
+  while (byteLength > 1 && result[byteLength - 1] === signByte && (!signed || result[byteLength - 2] >> 7 === signBit)) {
+    byteLength--;
+  }
+
+  result = bufs.resize(result, byteLength);
+  return {
+    value: result,
+    nextIndex: index
+  };
+}
+/*
+ * Exported bindings
+ */
+
+
+function encodeIntBuffer(buffer) {
+  return encodeBufferCommon(buffer, true);
+}
+
+function decodeIntBuffer(encodedBuffer, index) {
+  return decodeBufferCommon(encodedBuffer, index, true);
+}
+
+function encodeInt32(num) {
+  var buf = bufs.alloc(4);
+  buf.writeInt32LE(num, 0);
+  var result = encodeIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeInt32(encodedBuffer, index) {
+  var result = decodeIntBuffer(encodedBuffer, index);
+  var parsed = bufs.readInt(result.value);
+  var value = parsed.value;
+  bufs.free(result.value);
+
+  if (value < MIN_INT32 || value > MAX_INT32) {
+    throw new Error("integer too large");
+  }
+
+  return {
+    value: value,
+    nextIndex: result.nextIndex
+  };
+}
+
+function encodeInt64(num) {
+  var buf = bufs.alloc(8);
+  bufs.writeInt64(num, buf);
+  var result = encodeIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeInt64(encodedBuffer, index) {
+  var result = decodeIntBuffer(encodedBuffer, index);
+
+  var value = _long.default.fromBytesLE(result.value, false);
+
+  bufs.free(result.value);
+  return {
+    value: value,
+    nextIndex: result.nextIndex,
+    lossy: false
+  };
+}
+
+function encodeUIntBuffer(buffer) {
+  return encodeBufferCommon(buffer, false);
+}
+
+function decodeUIntBuffer(encodedBuffer, index) {
+  return decodeBufferCommon(encodedBuffer, index, false);
+}
+
+function encodeUInt32(num) {
+  var buf = bufs.alloc(4);
+  buf.writeUInt32LE(num, 0);
+  var result = encodeUIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeUInt32(encodedBuffer, index) {
+  var result = decodeUIntBuffer(encodedBuffer, index);
+  var parsed = bufs.readUInt(result.value);
+  var value = parsed.value;
+  bufs.free(result.value);
+
+  if (value > MAX_UINT32) {
+    throw new Error("integer too large");
+  }
+
+  return {
+    value: value,
+    nextIndex: result.nextIndex
+  };
+}
+
+function encodeUInt64(num) {
+  var buf = bufs.alloc(8);
+  bufs.writeUInt64(num, buf);
+  var result = encodeUIntBuffer(buf);
+  bufs.free(buf);
+  return result;
+}
+
+function decodeUInt64(encodedBuffer, index) {
+  var result = decodeUIntBuffer(encodedBuffer, index);
+
+  var value = _long.default.fromBytesLE(result.value, true);
+
+  bufs.free(result.value);
+  return {
+    value: value,
+    nextIndex: result.nextIndex,
+    lossy: false
+  };
+}
+
+var _default = {
+  decodeInt32: decodeInt32,
+  decodeInt64: decodeInt64,
+  decodeIntBuffer: decodeIntBuffer,
+  decodeUInt32: decodeUInt32,
+  decodeUInt64: decodeUInt64,
+  decodeUIntBuffer: decodeUIntBuffer,
+  encodeInt32: encodeInt32,
+  encodeInt64: encodeInt64,
+  encodeIntBuffer: encodeIntBuffer,
+  encodeUInt32: encodeUInt32,
+  encodeUInt64: encodeUInt64,
+  encodeUIntBuffer: encodeUIntBuffer
+};
+exports.default = _default;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/package.json
new file mode 100644
index 0000000..e1eeb5b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/leb128/package.json
@@ -0,0 +1,23 @@
+{
+  "name": "@webassemblyjs/leb128",
+  "version": "1.11.1",
+  "description": "LEB128 decoder and encoder",
+  "license": "Apache-2.0",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git",
+    "directory": "packages/leb128"
+  },
+  "dependencies": {
+    "@xtuc/long": "4.2.2"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/decoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/decoder.js
new file mode 100644
index 0000000..12d88eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/decoder.js
@@ -0,0 +1,95 @@
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function _toArray(arr) { return Array.isArray(arr) ? arr : Array.from(arr); }
+
+function con(b) {
+  if ((b & 0xc0) === 0x80) {
+    return b & 0x3f;
+  } else {
+    throw new Error("invalid UTF-8 encoding");
+  }
+}
+
+function code(min, n) {
+  if (n < min || 0xd800 <= n && n < 0xe000 || n >= 0x10000) {
+    throw new Error("invalid UTF-8 encoding");
+  } else {
+    return n;
+  }
+}
+
+export function decode(bytes) {
+  return _decode(bytes).map(function (x) {
+    return String.fromCharCode(x);
+  }).join("");
+}
+
+function _decode(bytes) {
+  if (bytes.length === 0) {
+    return [];
+  }
+  /**
+   * 1 byte
+   */
+
+
+  {
+    var _bytes = _toArray(bytes),
+        b1 = _bytes[0],
+        bs = _bytes.slice(1);
+
+    if (b1 < 0x80) {
+      return [code(0x0, b1)].concat(_toConsumableArray(_decode(bs)));
+    }
+
+    if (b1 < 0xc0) {
+      throw new Error("invalid UTF-8 encoding");
+    }
+  }
+  /**
+   * 2 bytes
+   */
+
+  {
+    var _bytes2 = _toArray(bytes),
+        _b = _bytes2[0],
+        b2 = _bytes2[1],
+        _bs = _bytes2.slice(2);
+
+    if (_b < 0xe0) {
+      return [code(0x80, ((_b & 0x1f) << 6) + con(b2))].concat(_toConsumableArray(_decode(_bs)));
+    }
+  }
+  /**
+   * 3 bytes
+   */
+
+  {
+    var _bytes3 = _toArray(bytes),
+        _b2 = _bytes3[0],
+        _b3 = _bytes3[1],
+        b3 = _bytes3[2],
+        _bs2 = _bytes3.slice(3);
+
+    if (_b2 < 0xf0) {
+      return [code(0x800, ((_b2 & 0x0f) << 12) + (con(_b3) << 6) + con(b3))].concat(_toConsumableArray(_decode(_bs2)));
+    }
+  }
+  /**
+   * 4 bytes
+   */
+
+  {
+    var _bytes4 = _toArray(bytes),
+        _b4 = _bytes4[0],
+        _b5 = _bytes4[1],
+        _b6 = _bytes4[2],
+        b4 = _bytes4[3],
+        _bs3 = _bytes4.slice(4);
+
+    if (_b4 < 0xf8) {
+      return [code(0x10000, (((_b4 & 0x07) << 18) + con(_b5) << 12) + (con(_b6) << 6) + con(b4))].concat(_toConsumableArray(_decode(_bs3)));
+    }
+  }
+  throw new Error("invalid UTF-8 encoding");
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/encoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/encoder.js
new file mode 100644
index 0000000..6d5e4de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/encoder.js
@@ -0,0 +1,46 @@
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function _toArray(arr) { return Array.isArray(arr) ? arr : Array.from(arr); }
+
+function con(n) {
+  return 0x80 | n & 0x3f;
+}
+
+export function encode(str) {
+  var arr = str.split("").map(function (x) {
+    return x.charCodeAt(0);
+  });
+  return _encode(arr);
+}
+
+function _encode(arr) {
+  if (arr.length === 0) {
+    return [];
+  }
+
+  var _arr = _toArray(arr),
+      n = _arr[0],
+      ns = _arr.slice(1);
+
+  if (n < 0) {
+    throw new Error("utf8");
+  }
+
+  if (n < 0x80) {
+    return [n].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  if (n < 0x800) {
+    return [0xc0 | n >>> 6, con(n)].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  if (n < 0x10000) {
+    return [0xe0 | n >>> 12, con(n >>> 6), con(n)].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  if (n < 0x110000) {
+    return [0xf0 | n >>> 18, con(n >>> 12), con(n >>> 6), con(n)].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  throw new Error("utf8");
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/index.js
new file mode 100644
index 0000000..2e31357
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/esm/index.js
@@ -0,0 +1,2 @@
+export { decode } from "./decoder";
+export { encode } from "./encoder";
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/decoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/decoder.js
new file mode 100644
index 0000000..824c843
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/decoder.js
@@ -0,0 +1,102 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.decode = decode;
+
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function _toArray(arr) { return Array.isArray(arr) ? arr : Array.from(arr); }
+
+function con(b) {
+  if ((b & 0xc0) === 0x80) {
+    return b & 0x3f;
+  } else {
+    throw new Error("invalid UTF-8 encoding");
+  }
+}
+
+function code(min, n) {
+  if (n < min || 0xd800 <= n && n < 0xe000 || n >= 0x10000) {
+    throw new Error("invalid UTF-8 encoding");
+  } else {
+    return n;
+  }
+}
+
+function decode(bytes) {
+  return _decode(bytes).map(function (x) {
+    return String.fromCharCode(x);
+  }).join("");
+}
+
+function _decode(bytes) {
+  if (bytes.length === 0) {
+    return [];
+  }
+  /**
+   * 1 byte
+   */
+
+
+  {
+    var _bytes = _toArray(bytes),
+        b1 = _bytes[0],
+        bs = _bytes.slice(1);
+
+    if (b1 < 0x80) {
+      return [code(0x0, b1)].concat(_toConsumableArray(_decode(bs)));
+    }
+
+    if (b1 < 0xc0) {
+      throw new Error("invalid UTF-8 encoding");
+    }
+  }
+  /**
+   * 2 bytes
+   */
+
+  {
+    var _bytes2 = _toArray(bytes),
+        _b = _bytes2[0],
+        b2 = _bytes2[1],
+        _bs = _bytes2.slice(2);
+
+    if (_b < 0xe0) {
+      return [code(0x80, ((_b & 0x1f) << 6) + con(b2))].concat(_toConsumableArray(_decode(_bs)));
+    }
+  }
+  /**
+   * 3 bytes
+   */
+
+  {
+    var _bytes3 = _toArray(bytes),
+        _b2 = _bytes3[0],
+        _b3 = _bytes3[1],
+        b3 = _bytes3[2],
+        _bs2 = _bytes3.slice(3);
+
+    if (_b2 < 0xf0) {
+      return [code(0x800, ((_b2 & 0x0f) << 12) + (con(_b3) << 6) + con(b3))].concat(_toConsumableArray(_decode(_bs2)));
+    }
+  }
+  /**
+   * 4 bytes
+   */
+
+  {
+    var _bytes4 = _toArray(bytes),
+        _b4 = _bytes4[0],
+        _b5 = _bytes4[1],
+        _b6 = _bytes4[2],
+        b4 = _bytes4[3],
+        _bs3 = _bytes4.slice(4);
+
+    if (_b4 < 0xf8) {
+      return [code(0x10000, (((_b4 & 0x07) << 18) + con(_b5) << 12) + (con(_b6) << 6) + con(b4))].concat(_toConsumableArray(_decode(_bs3)));
+    }
+  }
+  throw new Error("invalid UTF-8 encoding");
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/encoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/encoder.js
new file mode 100644
index 0000000..0606b56
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/encoder.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.encode = encode;
+
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function _toArray(arr) { return Array.isArray(arr) ? arr : Array.from(arr); }
+
+function con(n) {
+  return 0x80 | n & 0x3f;
+}
+
+function encode(str) {
+  var arr = str.split("").map(function (x) {
+    return x.charCodeAt(0);
+  });
+  return _encode(arr);
+}
+
+function _encode(arr) {
+  if (arr.length === 0) {
+    return [];
+  }
+
+  var _arr = _toArray(arr),
+      n = _arr[0],
+      ns = _arr.slice(1);
+
+  if (n < 0) {
+    throw new Error("utf8");
+  }
+
+  if (n < 0x80) {
+    return [n].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  if (n < 0x800) {
+    return [0xc0 | n >>> 6, con(n)].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  if (n < 0x10000) {
+    return [0xe0 | n >>> 12, con(n >>> 6), con(n)].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  if (n < 0x110000) {
+    return [0xf0 | n >>> 18, con(n >>> 12), con(n >>> 6), con(n)].concat(_toConsumableArray(_encode(ns)));
+  }
+
+  throw new Error("utf8");
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/index.js
new file mode 100644
index 0000000..fef9470
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/lib/index.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "decode", {
+  enumerable: true,
+  get: function get() {
+    return _decoder.decode;
+  }
+});
+Object.defineProperty(exports, "encode", {
+  enumerable: true,
+  get: function get() {
+    return _encoder.encode;
+  }
+});
+
+var _decoder = require("./decoder");
+
+var _encoder = require("./encoder");
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/package.json
new file mode 100644
index 0000000..d935e18
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/package.json
@@ -0,0 +1,20 @@
+{
+  "name": "@webassemblyjs/utf8",
+  "version": "1.11.1",
+  "description": "UTF8 encoder/decoder for WASM",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/decoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/decoder.js
new file mode 100644
index 0000000..227ba3a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/decoder.js
@@ -0,0 +1,86 @@
+function con(b) {
+  if ((b & 0xc0) === 0x80) {
+    return b & 0x3f;
+  } else {
+    throw new Error("invalid UTF-8 encoding");
+  }
+}
+
+function code(min, n) {
+  if (n < min || (0xd800 <= n && n < 0xe000) || n >= 0x10000) {
+    throw new Error("invalid UTF-8 encoding");
+  } else {
+    return n;
+  }
+}
+
+export function decode(bytes) {
+  return _decode(bytes)
+    .map(x => String.fromCharCode(x))
+    .join("");
+}
+
+function _decode(bytes) {
+  if (bytes.length === 0) {
+    return [];
+  }
+
+  /**
+   * 1 byte
+   */
+  {
+    const [b1, ...bs] = bytes;
+
+    if (b1 < 0x80) {
+      return [code(0x0, b1), ..._decode(bs)];
+    }
+
+    if (b1 < 0xc0) {
+      throw new Error("invalid UTF-8 encoding");
+    }
+  }
+
+  /**
+   * 2 bytes
+   */
+  {
+    const [b1, b2, ...bs] = bytes;
+
+    if (b1 < 0xe0) {
+      return [code(0x80, ((b1 & 0x1f) << 6) + con(b2)), ..._decode(bs)];
+    }
+  }
+
+  /**
+   * 3 bytes
+   */
+  {
+    const [b1, b2, b3, ...bs] = bytes;
+
+    if (b1 < 0xf0) {
+      return [
+        code(0x800, ((b1 & 0x0f) << 12) + (con(b2) << 6) + con(b3)),
+        ..._decode(bs)
+      ];
+    }
+  }
+
+  /**
+   * 4 bytes
+   */
+  {
+    const [b1, b2, b3, b4, ...bs] = bytes;
+
+    if (b1 < 0xf8) {
+      return [
+        code(
+          0x10000,
+          ((((b1 & 0x07) << 18) + con(b2)) << 12) + (con(b3) << 6) + con(b4)
+        ),
+        ..._decode(bs)
+      ];
+    }
+  }
+
+  throw new Error("invalid UTF-8 encoding");
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/encoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/encoder.js
new file mode 100644
index 0000000..1c482f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/encoder.js
@@ -0,0 +1,44 @@
+function con(n) {
+  return 0x80 | (n & 0x3f);
+}
+
+export function encode(str) {
+  const arr = str.split("").map(x => x.charCodeAt(0));
+  return _encode(arr);
+}
+
+function _encode(arr) {
+  if (arr.length === 0) {
+    return [];
+  }
+
+  const [n, ...ns] = arr;
+
+  if (n < 0) {
+    throw new Error("utf8");
+  }
+
+  if (n < 0x80) {
+    return [n, ..._encode(ns)];
+  }
+
+  if (n < 0x800) {
+    return [0xc0 | (n >>> 6), con(n), ..._encode(ns)];
+  }
+
+  if (n < 0x10000) {
+    return [0xe0 | (n >>> 12), con(n >>> 6), con(n), ..._encode(ns)];
+  }
+
+  if (n < 0x110000) {
+    return [
+      0xf0 | (n >>> 18),
+      con(n >>> 12),
+      con(n >>> 6),
+      con(n),
+      ..._encode(ns)
+    ];
+  }
+
+  throw new Error("utf8");
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/index.js
new file mode 100644
index 0000000..82cf9a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/src/index.js
@@ -0,0 +1,4 @@
+// @flow
+
+export { decode } from "./decoder";
+export { encode } from "./encoder";
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/test/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/test/index.js
new file mode 100644
index 0000000..dabdc6c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/utf8/test/index.js
@@ -0,0 +1,13 @@
+const { assert } = require("chai");
+
+const { decode, encode } = require("../lib");
+
+describe("UTF8", () => {
+  it("should f-1(f(x)) = x", () => {
+    assert.equal(decode(encode("foo")), "foo");
+    assert.equal(decode(encode("éé")), "éé");
+
+    // TODO(sven): utf8 encoder fails here
+    // assert.equal(decode(encode("🤣见見")), "🤣见見");
+  });
+});
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/README.md b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/README.md
new file mode 100644
index 0000000..f03462f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/README.md
@@ -0,0 +1,86 @@
+# @webassemblyjs/wasm-edit
+
+> Rewrite a WASM binary
+
+Replace in-place an AST node in the binary.
+
+## Installation
+
+```sh
+yarn add @webassemblyjs/wasm-edit
+```
+
+## Usage
+
+Update:
+
+```js
+import { edit } from "@webassemblyjs/wasm-edit";
+
+const binary = [/*...*/];
+
+const visitors = {
+  ModuleImport({ node }) {
+    node.module = "foo";
+    node.name = "bar";
+  }
+};
+
+const newBinary = edit(binary, visitors);
+```
+
+Replace:
+
+```js
+import { edit } from "@webassemblyjs/wasm-edit";
+
+const binary = [/*...*/];
+
+const visitors = {
+  Instr(path) {
+    const newNode = t.callInstruction(t.indexLiteral(0));
+    path.replaceWith(newNode);
+  }
+};
+
+const newBinary = edit(binary, visitors);
+```
+
+Remove:
+
+```js
+import { edit } from "@webassemblyjs/wasm-edit";
+
+const binary = [/*...*/];
+
+const visitors = {
+  ModuleExport({ node }) {
+    path.remove()
+  }
+};
+
+const newBinary = edit(binary, visitors);
+```
+
+Insert:
+
+```js
+import { add } from "@webassemblyjs/wasm-edit";
+
+const binary = [/*...*/];
+
+const newBinary = add(actualBinary, [
+  t.moduleImport("env", "mem", t.memory(t.limit(1)))
+]);
+```
+
+## Providing the AST
+
+Providing an AST allows you to handle the decoding yourself, here is the API:
+
+```js
+addWithAST(Program, ArrayBuffer, Array<Node>): ArrayBuffer;
+editWithAST(Program, ArrayBuffer, visitors): ArrayBuffer;
+```
+
+Note that the AST will be updated in-place.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/esm/apply.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/esm/apply.js
new file mode 100644
index 0000000..4c21569
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/esm/apply.js
@@ -0,0 +1,299 @@
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+import { encodeNode } from "@webassemblyjs/wasm-gen";
+import { encodeU32 } from "@webassemblyjs/wasm-gen/lib/encoder";
+import { isFunc, isGlobal, assertHasLoc, orderedInsertNode, getSectionMetadata, traverse, getEndOfSection } from "@webassemblyjs/ast";
+import { resizeSectionByteSize, resizeSectionVecSize, createEmptySection, removeSections } from "@webassemblyjs/helper-wasm-section";
+import { overrideBytesInBuffer } from "@webassemblyjs/helper-buffer";
+import { getSectionForNode } from "@webassemblyjs/helper-wasm-bytecode";
+
+function shiftLocNodeByDelta(node, delta) {
+  assertHasLoc(node); // $FlowIgnore: assertHasLoc ensures that
+
+  node.loc.start.column += delta; // $FlowIgnore: assertHasLoc ensures that
+
+  node.loc.end.column += delta;
+}
+
+function applyUpdate(ast, uint8Buffer, _ref) {
+  var _ref2 = _slicedToArray(_ref, 2),
+      oldNode = _ref2[0],
+      newNode = _ref2[1];
+
+  var deltaElements = 0;
+  assertHasLoc(oldNode);
+  var sectionName = getSectionForNode(newNode);
+  var replacementByteArray = encodeNode(newNode);
+  /**
+   * Replace new node as bytes
+   */
+
+  uint8Buffer = overrideBytesInBuffer(uint8Buffer, // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.start.column, // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.end.column, replacementByteArray);
+  /**
+   * Update function body size if needed
+   */
+
+  if (sectionName === "code") {
+    // Find the parent func
+    traverse(ast, {
+      Func: function Func(_ref3) {
+        var node = _ref3.node;
+        var funcHasThisIntr = node.body.find(function (n) {
+          return n === newNode;
+        }) !== undefined; // Update func's body size if needed
+
+        if (funcHasThisIntr === true) {
+          // These are the old functions locations informations
+          assertHasLoc(node);
+          var oldNodeSize = encodeNode(oldNode).length;
+          var bodySizeDeltaBytes = replacementByteArray.length - oldNodeSize;
+
+          if (bodySizeDeltaBytes !== 0) {
+            var newValue = node.metadata.bodySize + bodySizeDeltaBytes;
+            var newByteArray = encodeU32(newValue); // function body size byte
+            // FIXME(sven): only handles one byte u32
+
+            var start = node.loc.start.column;
+            var end = start + 1;
+            uint8Buffer = overrideBytesInBuffer(uint8Buffer, start, end, newByteArray);
+          }
+        }
+      }
+    });
+  }
+  /**
+   * Update section size
+   */
+
+
+  var deltaBytes = replacementByteArray.length - ( // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.end.column - oldNode.loc.start.column); // Init location informations
+
+  newNode.loc = {
+    start: {
+      line: -1,
+      column: -1
+    },
+    end: {
+      line: -1,
+      column: -1
+    }
+  }; // Update new node end position
+  // $FlowIgnore: assertHasLoc ensures that
+
+  newNode.loc.start.column = oldNode.loc.start.column; // $FlowIgnore: assertHasLoc ensures that
+
+  newNode.loc.end.column = // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.start.column + replacementByteArray.length;
+  return {
+    uint8Buffer: uint8Buffer,
+    deltaBytes: deltaBytes,
+    deltaElements: deltaElements
+  };
+}
+
+function applyDelete(ast, uint8Buffer, node) {
+  var deltaElements = -1; // since we removed an element
+
+  assertHasLoc(node);
+  var sectionName = getSectionForNode(node);
+
+  if (sectionName === "start") {
+    var sectionMetadata = getSectionMetadata(ast, "start");
+    /**
+     * The start section only contains one element,
+     * we need to remove the whole section
+     */
+
+    uint8Buffer = removeSections(ast, uint8Buffer, "start");
+
+    var _deltaBytes = -(sectionMetadata.size.value + 1);
+    /* section id */
+
+
+    return {
+      uint8Buffer: uint8Buffer,
+      deltaBytes: _deltaBytes,
+      deltaElements: deltaElements
+    };
+  } // replacement is nothing
+
+
+  var replacement = [];
+  uint8Buffer = overrideBytesInBuffer(uint8Buffer, // $FlowIgnore: assertHasLoc ensures that
+  node.loc.start.column, // $FlowIgnore: assertHasLoc ensures that
+  node.loc.end.column, replacement);
+  /**
+   * Update section
+   */
+  // $FlowIgnore: assertHasLoc ensures that
+
+  var deltaBytes = -(node.loc.end.column - node.loc.start.column);
+  return {
+    uint8Buffer: uint8Buffer,
+    deltaBytes: deltaBytes,
+    deltaElements: deltaElements
+  };
+}
+
+function applyAdd(ast, uint8Buffer, node) {
+  var deltaElements = +1; // since we added an element
+
+  var sectionName = getSectionForNode(node);
+  var sectionMetadata = getSectionMetadata(ast, sectionName); // Section doesn't exists, we create an empty one
+
+  if (typeof sectionMetadata === "undefined") {
+    var res = createEmptySection(ast, uint8Buffer, sectionName);
+    uint8Buffer = res.uint8Buffer;
+    sectionMetadata = res.sectionMetadata;
+  }
+  /**
+   * check that the expressions were ended
+   */
+
+
+  if (isFunc(node)) {
+    // $FlowIgnore
+    var body = node.body;
+
+    if (body.length === 0 || body[body.length - 1].id !== "end") {
+      throw new Error("expressions must be ended");
+    }
+  }
+
+  if (isGlobal(node)) {
+    // $FlowIgnore
+    var body = node.init;
+
+    if (body.length === 0 || body[body.length - 1].id !== "end") {
+      throw new Error("expressions must be ended");
+    }
+  }
+  /**
+   * Add nodes
+   */
+
+
+  var newByteArray = encodeNode(node); // The size of the section doesn't include the storage of the size itself
+  // we need to manually add it here
+
+  var start = getEndOfSection(sectionMetadata);
+  var end = start;
+  /**
+   * Update section
+   */
+
+  var deltaBytes = newByteArray.length;
+  uint8Buffer = overrideBytesInBuffer(uint8Buffer, start, end, newByteArray);
+  node.loc = {
+    start: {
+      line: -1,
+      column: start
+    },
+    end: {
+      line: -1,
+      column: start + deltaBytes
+    }
+  }; // for func add the additional metadata in the AST
+
+  if (node.type === "Func") {
+    // the size is the first byte
+    // FIXME(sven): handle LEB128 correctly here
+    var bodySize = newByteArray[0];
+    node.metadata = {
+      bodySize: bodySize
+    };
+  }
+
+  if (node.type !== "IndexInFuncSection") {
+    orderedInsertNode(ast.body[0], node);
+  }
+
+  return {
+    uint8Buffer: uint8Buffer,
+    deltaBytes: deltaBytes,
+    deltaElements: deltaElements
+  };
+}
+
+export function applyOperations(ast, uint8Buffer, ops) {
+  ops.forEach(function (op) {
+    var state;
+    var sectionName;
+
+    switch (op.kind) {
+      case "update":
+        state = applyUpdate(ast, uint8Buffer, [op.oldNode, op.node]);
+        sectionName = getSectionForNode(op.node);
+        break;
+
+      case "delete":
+        state = applyDelete(ast, uint8Buffer, op.node);
+        sectionName = getSectionForNode(op.node);
+        break;
+
+      case "add":
+        state = applyAdd(ast, uint8Buffer, op.node);
+        sectionName = getSectionForNode(op.node);
+        break;
+
+      default:
+        throw new Error("Unknown operation");
+    }
+    /**
+     * Resize section vec size.
+     * If the length of the LEB-encoded size changes, this can change
+     * the byte length of the section and the offset for nodes in the
+     * section. So we do this first before resizing section byte size
+     * or shifting following operations' nodes.
+     */
+
+
+    if (state.deltaElements !== 0 && sectionName !== "start") {
+      var oldBufferLength = state.uint8Buffer.length;
+      state.uint8Buffer = resizeSectionVecSize(ast, state.uint8Buffer, sectionName, state.deltaElements); // Infer bytes added/removed by comparing buffer lengths
+
+      state.deltaBytes += state.uint8Buffer.length - oldBufferLength;
+    }
+    /**
+     * Resize section byte size.
+     * If the length of the LEB-encoded size changes, this can change
+     * the offset for nodes in the section. So we do this before
+     * shifting following operations' nodes.
+     */
+
+
+    if (state.deltaBytes !== 0 && sectionName !== "start") {
+      var _oldBufferLength = state.uint8Buffer.length;
+      state.uint8Buffer = resizeSectionByteSize(ast, state.uint8Buffer, sectionName, state.deltaBytes); // Infer bytes added/removed by comparing buffer lengths
+
+      state.deltaBytes += state.uint8Buffer.length - _oldBufferLength;
+    }
+    /**
+     * Shift following operation's nodes
+     */
+
+
+    if (state.deltaBytes !== 0) {
+      ops.forEach(function (op) {
+        // We don't need to handle add ops, they are positioning independent
+        switch (op.kind) {
+          case "update":
+            shiftLocNodeByDelta(op.oldNode, state.deltaBytes);
+            break;
+
+          case "delete":
+            shiftLocNodeByDelta(op.node, state.deltaBytes);
+            break;
+        }
+      });
+    }
+
+    uint8Buffer = state.uint8Buffer;
+  });
+  return uint8Buffer;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/esm/index.js
new file mode 100644
index 0000000..6ed9d53
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/esm/index.js
@@ -0,0 +1,114 @@
+import { decode } from "@webassemblyjs/wasm-parser";
+import { traverse } from "@webassemblyjs/ast";
+import { cloneNode } from "@webassemblyjs/ast/lib/clone";
+import { shrinkPaddedLEB128 } from "@webassemblyjs/wasm-opt";
+import { getSectionForNode } from "@webassemblyjs/helper-wasm-bytecode";
+import constants from "@webassemblyjs/helper-wasm-bytecode";
+import { applyOperations } from "./apply";
+
+function hashNode(node) {
+  return JSON.stringify(node);
+}
+
+function preprocess(ab) {
+  var optBin = shrinkPaddedLEB128(new Uint8Array(ab));
+  return optBin.buffer;
+}
+
+function sortBySectionOrder(nodes) {
+  var originalOrder = new Map();
+  var _iteratorNormalCompletion = true;
+  var _didIteratorError = false;
+  var _iteratorError = undefined;
+
+  try {
+    for (var _iterator = nodes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+      var _node = _step.value;
+      originalOrder.set(_node, originalOrder.size);
+    }
+  } catch (err) {
+    _didIteratorError = true;
+    _iteratorError = err;
+  } finally {
+    try {
+      if (!_iteratorNormalCompletion && _iterator.return != null) {
+        _iterator.return();
+      }
+    } finally {
+      if (_didIteratorError) {
+        throw _iteratorError;
+      }
+    }
+  }
+
+  nodes.sort(function (a, b) {
+    var sectionA = getSectionForNode(a);
+    var sectionB = getSectionForNode(b);
+    var aId = constants.sections[sectionA];
+    var bId = constants.sections[sectionB];
+
+    if (typeof aId !== "number" || typeof bId !== "number") {
+      throw new Error("Section id not found");
+    }
+
+    if (aId === bId) {
+      // $FlowIgnore originalOrder is filled for all nodes
+      return originalOrder.get(a) - originalOrder.get(b);
+    }
+
+    return aId - bId;
+  });
+}
+
+export function edit(ab, visitors) {
+  ab = preprocess(ab);
+  var ast = decode(ab);
+  return editWithAST(ast, ab, visitors);
+}
+export function editWithAST(ast, ab, visitors) {
+  var operations = [];
+  var uint8Buffer = new Uint8Array(ab);
+  var nodeBefore;
+
+  function before(type, path) {
+    nodeBefore = cloneNode(path.node);
+  }
+
+  function after(type, path) {
+    if (path.node._deleted === true) {
+      operations.push({
+        kind: "delete",
+        node: path.node
+      }); // $FlowIgnore
+    } else if (hashNode(nodeBefore) !== hashNode(path.node)) {
+      operations.push({
+        kind: "update",
+        oldNode: nodeBefore,
+        node: path.node
+      });
+    }
+  }
+
+  traverse(ast, visitors, before, after);
+  uint8Buffer = applyOperations(ast, uint8Buffer, operations);
+  return uint8Buffer.buffer;
+}
+export function add(ab, newNodes) {
+  ab = preprocess(ab);
+  var ast = decode(ab);
+  return addWithAST(ast, ab, newNodes);
+}
+export function addWithAST(ast, ab, newNodes) {
+  // Sort nodes by insertion order
+  sortBySectionOrder(newNodes);
+  var uint8Buffer = new Uint8Array(ab); // Map node into operations
+
+  var operations = newNodes.map(function (n) {
+    return {
+      kind: "add",
+      node: n
+    };
+  });
+  uint8Buffer = applyOperations(ast, uint8Buffer, operations);
+  return uint8Buffer.buffer;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/lib/apply.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/lib/apply.js
new file mode 100644
index 0000000..e9cb38f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/lib/apply.js
@@ -0,0 +1,311 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.applyOperations = applyOperations;
+
+var _wasmGen = require("@webassemblyjs/wasm-gen");
+
+var _encoder = require("@webassemblyjs/wasm-gen/lib/encoder");
+
+var _ast = require("@webassemblyjs/ast");
+
+var _helperWasmSection = require("@webassemblyjs/helper-wasm-section");
+
+var _helperBuffer = require("@webassemblyjs/helper-buffer");
+
+var _helperWasmBytecode = require("@webassemblyjs/helper-wasm-bytecode");
+
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+function shiftLocNodeByDelta(node, delta) {
+  (0, _ast.assertHasLoc)(node); // $FlowIgnore: assertHasLoc ensures that
+
+  node.loc.start.column += delta; // $FlowIgnore: assertHasLoc ensures that
+
+  node.loc.end.column += delta;
+}
+
+function applyUpdate(ast, uint8Buffer, _ref) {
+  var _ref2 = _slicedToArray(_ref, 2),
+      oldNode = _ref2[0],
+      newNode = _ref2[1];
+
+  var deltaElements = 0;
+  (0, _ast.assertHasLoc)(oldNode);
+  var sectionName = (0, _helperWasmBytecode.getSectionForNode)(newNode);
+  var replacementByteArray = (0, _wasmGen.encodeNode)(newNode);
+  /**
+   * Replace new node as bytes
+   */
+
+  uint8Buffer = (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.start.column, // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.end.column, replacementByteArray);
+  /**
+   * Update function body size if needed
+   */
+
+  if (sectionName === "code") {
+    // Find the parent func
+    (0, _ast.traverse)(ast, {
+      Func: function Func(_ref3) {
+        var node = _ref3.node;
+        var funcHasThisIntr = node.body.find(function (n) {
+          return n === newNode;
+        }) !== undefined; // Update func's body size if needed
+
+        if (funcHasThisIntr === true) {
+          // These are the old functions locations informations
+          (0, _ast.assertHasLoc)(node);
+          var oldNodeSize = (0, _wasmGen.encodeNode)(oldNode).length;
+          var bodySizeDeltaBytes = replacementByteArray.length - oldNodeSize;
+
+          if (bodySizeDeltaBytes !== 0) {
+            var newValue = node.metadata.bodySize + bodySizeDeltaBytes;
+            var newByteArray = (0, _encoder.encodeU32)(newValue); // function body size byte
+            // FIXME(sven): only handles one byte u32
+
+            var start = node.loc.start.column;
+            var end = start + 1;
+            uint8Buffer = (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, start, end, newByteArray);
+          }
+        }
+      }
+    });
+  }
+  /**
+   * Update section size
+   */
+
+
+  var deltaBytes = replacementByteArray.length - ( // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.end.column - oldNode.loc.start.column); // Init location informations
+
+  newNode.loc = {
+    start: {
+      line: -1,
+      column: -1
+    },
+    end: {
+      line: -1,
+      column: -1
+    }
+  }; // Update new node end position
+  // $FlowIgnore: assertHasLoc ensures that
+
+  newNode.loc.start.column = oldNode.loc.start.column; // $FlowIgnore: assertHasLoc ensures that
+
+  newNode.loc.end.column = // $FlowIgnore: assertHasLoc ensures that
+  oldNode.loc.start.column + replacementByteArray.length;
+  return {
+    uint8Buffer: uint8Buffer,
+    deltaBytes: deltaBytes,
+    deltaElements: deltaElements
+  };
+}
+
+function applyDelete(ast, uint8Buffer, node) {
+  var deltaElements = -1; // since we removed an element
+
+  (0, _ast.assertHasLoc)(node);
+  var sectionName = (0, _helperWasmBytecode.getSectionForNode)(node);
+
+  if (sectionName === "start") {
+    var sectionMetadata = (0, _ast.getSectionMetadata)(ast, "start");
+    /**
+     * The start section only contains one element,
+     * we need to remove the whole section
+     */
+
+    uint8Buffer = (0, _helperWasmSection.removeSections)(ast, uint8Buffer, "start");
+
+    var _deltaBytes = -(sectionMetadata.size.value + 1);
+    /* section id */
+
+
+    return {
+      uint8Buffer: uint8Buffer,
+      deltaBytes: _deltaBytes,
+      deltaElements: deltaElements
+    };
+  } // replacement is nothing
+
+
+  var replacement = [];
+  uint8Buffer = (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, // $FlowIgnore: assertHasLoc ensures that
+  node.loc.start.column, // $FlowIgnore: assertHasLoc ensures that
+  node.loc.end.column, replacement);
+  /**
+   * Update section
+   */
+  // $FlowIgnore: assertHasLoc ensures that
+
+  var deltaBytes = -(node.loc.end.column - node.loc.start.column);
+  return {
+    uint8Buffer: uint8Buffer,
+    deltaBytes: deltaBytes,
+    deltaElements: deltaElements
+  };
+}
+
+function applyAdd(ast, uint8Buffer, node) {
+  var deltaElements = +1; // since we added an element
+
+  var sectionName = (0, _helperWasmBytecode.getSectionForNode)(node);
+  var sectionMetadata = (0, _ast.getSectionMetadata)(ast, sectionName); // Section doesn't exists, we create an empty one
+
+  if (typeof sectionMetadata === "undefined") {
+    var res = (0, _helperWasmSection.createEmptySection)(ast, uint8Buffer, sectionName);
+    uint8Buffer = res.uint8Buffer;
+    sectionMetadata = res.sectionMetadata;
+  }
+  /**
+   * check that the expressions were ended
+   */
+
+
+  if ((0, _ast.isFunc)(node)) {
+    // $FlowIgnore
+    var body = node.body;
+
+    if (body.length === 0 || body[body.length - 1].id !== "end") {
+      throw new Error("expressions must be ended");
+    }
+  }
+
+  if ((0, _ast.isGlobal)(node)) {
+    // $FlowIgnore
+    var body = node.init;
+
+    if (body.length === 0 || body[body.length - 1].id !== "end") {
+      throw new Error("expressions must be ended");
+    }
+  }
+  /**
+   * Add nodes
+   */
+
+
+  var newByteArray = (0, _wasmGen.encodeNode)(node); // The size of the section doesn't include the storage of the size itself
+  // we need to manually add it here
+
+  var start = (0, _ast.getEndOfSection)(sectionMetadata);
+  var end = start;
+  /**
+   * Update section
+   */
+
+  var deltaBytes = newByteArray.length;
+  uint8Buffer = (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, start, end, newByteArray);
+  node.loc = {
+    start: {
+      line: -1,
+      column: start
+    },
+    end: {
+      line: -1,
+      column: start + deltaBytes
+    }
+  }; // for func add the additional metadata in the AST
+
+  if (node.type === "Func") {
+    // the size is the first byte
+    // FIXME(sven): handle LEB128 correctly here
+    var bodySize = newByteArray[0];
+    node.metadata = {
+      bodySize: bodySize
+    };
+  }
+
+  if (node.type !== "IndexInFuncSection") {
+    (0, _ast.orderedInsertNode)(ast.body[0], node);
+  }
+
+  return {
+    uint8Buffer: uint8Buffer,
+    deltaBytes: deltaBytes,
+    deltaElements: deltaElements
+  };
+}
+
+function applyOperations(ast, uint8Buffer, ops) {
+  ops.forEach(function (op) {
+    var state;
+    var sectionName;
+
+    switch (op.kind) {
+      case "update":
+        state = applyUpdate(ast, uint8Buffer, [op.oldNode, op.node]);
+        sectionName = (0, _helperWasmBytecode.getSectionForNode)(op.node);
+        break;
+
+      case "delete":
+        state = applyDelete(ast, uint8Buffer, op.node);
+        sectionName = (0, _helperWasmBytecode.getSectionForNode)(op.node);
+        break;
+
+      case "add":
+        state = applyAdd(ast, uint8Buffer, op.node);
+        sectionName = (0, _helperWasmBytecode.getSectionForNode)(op.node);
+        break;
+
+      default:
+        throw new Error("Unknown operation");
+    }
+    /**
+     * Resize section vec size.
+     * If the length of the LEB-encoded size changes, this can change
+     * the byte length of the section and the offset for nodes in the
+     * section. So we do this first before resizing section byte size
+     * or shifting following operations' nodes.
+     */
+
+
+    if (state.deltaElements !== 0 && sectionName !== "start") {
+      var oldBufferLength = state.uint8Buffer.length;
+      state.uint8Buffer = (0, _helperWasmSection.resizeSectionVecSize)(ast, state.uint8Buffer, sectionName, state.deltaElements); // Infer bytes added/removed by comparing buffer lengths
+
+      state.deltaBytes += state.uint8Buffer.length - oldBufferLength;
+    }
+    /**
+     * Resize section byte size.
+     * If the length of the LEB-encoded size changes, this can change
+     * the offset for nodes in the section. So we do this before
+     * shifting following operations' nodes.
+     */
+
+
+    if (state.deltaBytes !== 0 && sectionName !== "start") {
+      var _oldBufferLength = state.uint8Buffer.length;
+      state.uint8Buffer = (0, _helperWasmSection.resizeSectionByteSize)(ast, state.uint8Buffer, sectionName, state.deltaBytes); // Infer bytes added/removed by comparing buffer lengths
+
+      state.deltaBytes += state.uint8Buffer.length - _oldBufferLength;
+    }
+    /**
+     * Shift following operation's nodes
+     */
+
+
+    if (state.deltaBytes !== 0) {
+      ops.forEach(function (op) {
+        // We don't need to handle add ops, they are positioning independent
+        switch (op.kind) {
+          case "update":
+            shiftLocNodeByDelta(op.oldNode, state.deltaBytes);
+            break;
+
+          case "delete":
+            shiftLocNodeByDelta(op.node, state.deltaBytes);
+            break;
+        }
+      });
+    }
+
+    uint8Buffer = state.uint8Buffer;
+  });
+  return uint8Buffer;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/lib/index.js
new file mode 100644
index 0000000..3f9b295
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/lib/index.js
@@ -0,0 +1,133 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.edit = edit;
+exports.editWithAST = editWithAST;
+exports.add = add;
+exports.addWithAST = addWithAST;
+
+var _wasmParser = require("@webassemblyjs/wasm-parser");
+
+var _ast = require("@webassemblyjs/ast");
+
+var _clone = require("@webassemblyjs/ast/lib/clone");
+
+var _wasmOpt = require("@webassemblyjs/wasm-opt");
+
+var _helperWasmBytecode = _interopRequireWildcard(require("@webassemblyjs/helper-wasm-bytecode"));
+
+var _apply = require("./apply");
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+function hashNode(node) {
+  return JSON.stringify(node);
+}
+
+function preprocess(ab) {
+  var optBin = (0, _wasmOpt.shrinkPaddedLEB128)(new Uint8Array(ab));
+  return optBin.buffer;
+}
+
+function sortBySectionOrder(nodes) {
+  var originalOrder = new Map();
+  var _iteratorNormalCompletion = true;
+  var _didIteratorError = false;
+  var _iteratorError = undefined;
+
+  try {
+    for (var _iterator = nodes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+      var _node = _step.value;
+      originalOrder.set(_node, originalOrder.size);
+    }
+  } catch (err) {
+    _didIteratorError = true;
+    _iteratorError = err;
+  } finally {
+    try {
+      if (!_iteratorNormalCompletion && _iterator.return != null) {
+        _iterator.return();
+      }
+    } finally {
+      if (_didIteratorError) {
+        throw _iteratorError;
+      }
+    }
+  }
+
+  nodes.sort(function (a, b) {
+    var sectionA = (0, _helperWasmBytecode.getSectionForNode)(a);
+    var sectionB = (0, _helperWasmBytecode.getSectionForNode)(b);
+    var aId = _helperWasmBytecode.default.sections[sectionA];
+    var bId = _helperWasmBytecode.default.sections[sectionB];
+
+    if (typeof aId !== "number" || typeof bId !== "number") {
+      throw new Error("Section id not found");
+    }
+
+    if (aId === bId) {
+      // $FlowIgnore originalOrder is filled for all nodes
+      return originalOrder.get(a) - originalOrder.get(b);
+    }
+
+    return aId - bId;
+  });
+}
+
+function edit(ab, visitors) {
+  ab = preprocess(ab);
+  var ast = (0, _wasmParser.decode)(ab);
+  return editWithAST(ast, ab, visitors);
+}
+
+function editWithAST(ast, ab, visitors) {
+  var operations = [];
+  var uint8Buffer = new Uint8Array(ab);
+  var nodeBefore;
+
+  function before(type, path) {
+    nodeBefore = (0, _clone.cloneNode)(path.node);
+  }
+
+  function after(type, path) {
+    if (path.node._deleted === true) {
+      operations.push({
+        kind: "delete",
+        node: path.node
+      }); // $FlowIgnore
+    } else if (hashNode(nodeBefore) !== hashNode(path.node)) {
+      operations.push({
+        kind: "update",
+        oldNode: nodeBefore,
+        node: path.node
+      });
+    }
+  }
+
+  (0, _ast.traverse)(ast, visitors, before, after);
+  uint8Buffer = (0, _apply.applyOperations)(ast, uint8Buffer, operations);
+  return uint8Buffer.buffer;
+}
+
+function add(ab, newNodes) {
+  ab = preprocess(ab);
+  var ast = (0, _wasmParser.decode)(ab);
+  return addWithAST(ast, ab, newNodes);
+}
+
+function addWithAST(ast, ab, newNodes) {
+  // Sort nodes by insertion order
+  sortBySectionOrder(newNodes);
+  var uint8Buffer = new Uint8Array(ab); // Map node into operations
+
+  var operations = newNodes.map(function (n) {
+    return {
+      kind: "add",
+      node: n
+    };
+  });
+  uint8Buffer = (0, _apply.applyOperations)(ast, uint8Buffer, operations);
+  return uint8Buffer.buffer;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/package.json
new file mode 100644
index 0000000..a4e04fe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-edit/package.json
@@ -0,0 +1,33 @@
+{
+  "name": "@webassemblyjs/wasm-edit",
+  "version": "1.11.1",
+  "description": "",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "dependencies": {
+    "@webassemblyjs/ast": "1.11.1",
+    "@webassemblyjs/helper-buffer": "1.11.1",
+    "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+    "@webassemblyjs/helper-wasm-section": "1.11.1",
+    "@webassemblyjs/wasm-gen": "1.11.1",
+    "@webassemblyjs/wasm-opt": "1.11.1",
+    "@webassemblyjs/wasm-parser": "1.11.1",
+    "@webassemblyjs/wast-printer": "1.11.1"
+  },
+  "devDependencies": {
+    "@webassemblyjs/helper-test-framework": "1.11.1"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/esm/encoder/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/esm/encoder/index.js
new file mode 100644
index 0000000..ec31249
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/esm/encoder/index.js
@@ -0,0 +1,301 @@
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+import * as leb from "@webassemblyjs/leb128";
+import * as ieee754 from "@webassemblyjs/ieee754";
+import * as utf8 from "@webassemblyjs/utf8";
+import constants from "@webassemblyjs/helper-wasm-bytecode";
+import { encodeNode } from "../index";
+
+function assertNotIdentifierNode(n) {
+  if (n.type === "Identifier") {
+    throw new Error("Unsupported node Identifier");
+  }
+}
+
+export function encodeVersion(v) {
+  var bytes = constants.moduleVersion;
+  bytes[0] = v;
+  return bytes;
+}
+export function encodeHeader() {
+  return constants.magicModuleHeader;
+}
+export function encodeU32(v) {
+  var uint8view = new Uint8Array(leb.encodeU32(v));
+
+  var array = _toConsumableArray(uint8view);
+
+  return array;
+}
+export function encodeI32(v) {
+  var uint8view = new Uint8Array(leb.encodeI32(v));
+
+  var array = _toConsumableArray(uint8view);
+
+  return array;
+}
+export function encodeI64(v) {
+  var uint8view = new Uint8Array(leb.encodeI64(v));
+
+  var array = _toConsumableArray(uint8view);
+
+  return array;
+}
+export function encodeVec(elements) {
+  var size = encodeU32(elements.length);
+  return _toConsumableArray(size).concat(_toConsumableArray(elements));
+}
+export function encodeValtype(v) {
+  var byte = constants.valtypesByString[v];
+
+  if (typeof byte === "undefined") {
+    throw new Error("Unknown valtype: " + v);
+  }
+
+  return parseInt(byte, 10);
+}
+export function encodeMutability(v) {
+  var byte = constants.globalTypesByString[v];
+
+  if (typeof byte === "undefined") {
+    throw new Error("Unknown mutability: " + v);
+  }
+
+  return parseInt(byte, 10);
+}
+export function encodeUTF8Vec(str) {
+  return encodeVec(utf8.encode(str));
+}
+export function encodeLimits(n) {
+  var out = [];
+
+  if (typeof n.max === "number") {
+    out.push(0x01);
+    out.push.apply(out, _toConsumableArray(encodeU32(n.min))); // $FlowIgnore: ensured by the typeof
+
+    out.push.apply(out, _toConsumableArray(encodeU32(n.max)));
+  } else {
+    out.push(0x00);
+    out.push.apply(out, _toConsumableArray(encodeU32(n.min)));
+  }
+
+  return out;
+}
+export function encodeModuleImport(n) {
+  var out = [];
+  out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.module)));
+  out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));
+
+  switch (n.descr.type) {
+    case "GlobalType":
+      {
+        out.push(0x03); // $FlowIgnore: GlobalType ensure that these props exists
+
+        out.push(encodeValtype(n.descr.valtype)); // $FlowIgnore: GlobalType ensure that these props exists
+
+        out.push(encodeMutability(n.descr.mutability));
+        break;
+      }
+
+    case "Memory":
+      {
+        out.push(0x02); // $FlowIgnore
+
+        out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));
+        break;
+      }
+
+    case "Table":
+      {
+        out.push(0x01);
+        out.push(0x70); // element type
+        // $FlowIgnore
+
+        out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));
+        break;
+      }
+
+    case "FuncImportDescr":
+      {
+        out.push(0x00); // $FlowIgnore
+
+        assertNotIdentifierNode(n.descr.id); // $FlowIgnore
+
+        out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));
+        break;
+      }
+
+    default:
+      throw new Error("Unsupport operation: encode module import of type: " + n.descr.type);
+  }
+
+  return out;
+}
+export function encodeSectionMetadata(n) {
+  var out = [];
+  var sectionId = constants.sections[n.section];
+
+  if (typeof sectionId === "undefined") {
+    throw new Error("Unknown section: " + n.section);
+  }
+
+  if (n.section === "start") {
+    /**
+     * This is not implemented yet because it's a special case which
+     * doesn't have a vector in its section.
+     */
+    throw new Error("Unsupported section encoding of type start");
+  }
+
+  out.push(sectionId);
+  out.push.apply(out, _toConsumableArray(encodeU32(n.size.value)));
+  out.push.apply(out, _toConsumableArray(encodeU32(n.vectorOfSize.value)));
+  return out;
+}
+export function encodeCallInstruction(n) {
+  var out = [];
+  assertNotIdentifierNode(n.index);
+  out.push(0x10); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.index.value)));
+  return out;
+}
+export function encodeCallIndirectInstruction(n) {
+  var out = []; // $FlowIgnore
+
+  assertNotIdentifierNode(n.index);
+  out.push(0x11); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.index.value))); // add a reserved byte
+
+  out.push(0x00);
+  return out;
+}
+export function encodeModuleExport(n) {
+  var out = [];
+  assertNotIdentifierNode(n.descr.id);
+  var exportTypeByteString = constants.exportTypesByName[n.descr.exportType];
+
+  if (typeof exportTypeByteString === "undefined") {
+    throw new Error("Unknown export of type: " + n.descr.exportType);
+  }
+
+  var exportTypeByte = parseInt(exportTypeByteString, 10);
+  out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));
+  out.push(exportTypeByte); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));
+  return out;
+}
+export function encodeTypeInstruction(n) {
+  var out = [0x60];
+  var params = n.functype.params.map(function (x) {
+    return x.valtype;
+  }).map(encodeValtype);
+  var results = n.functype.results.map(encodeValtype);
+  out.push.apply(out, _toConsumableArray(encodeVec(params)));
+  out.push.apply(out, _toConsumableArray(encodeVec(results)));
+  return out;
+}
+export function encodeInstr(n) {
+  var out = [];
+  var instructionName = n.id;
+
+  if (typeof n.object === "string") {
+    instructionName = "".concat(n.object, ".").concat(String(n.id));
+  }
+
+  var byteString = constants.symbolsByName[instructionName];
+
+  if (typeof byteString === "undefined") {
+    throw new Error("encodeInstr: unknown instruction " + JSON.stringify(instructionName));
+  }
+
+  var byte = parseInt(byteString, 10);
+  out.push(byte);
+
+  if (n.args) {
+    n.args.forEach(function (arg) {
+      var encoder = encodeU32; // find correct encoder
+
+      if (n.object === "i32") {
+        encoder = encodeI32;
+      }
+
+      if (n.object === "i64") {
+        encoder = encodeI64;
+      }
+
+      if (n.object === "f32") {
+        encoder = ieee754.encodeF32;
+      }
+
+      if (n.object === "f64") {
+        encoder = ieee754.encodeF64;
+      }
+
+      if (arg.type === "NumberLiteral" || arg.type === "FloatLiteral" || arg.type === "LongNumberLiteral") {
+        // $FlowIgnore
+        out.push.apply(out, _toConsumableArray(encoder(arg.value)));
+      } else {
+        throw new Error("Unsupported instruction argument encoding " + JSON.stringify(arg.type));
+      }
+    });
+  }
+
+  return out;
+}
+
+function encodeExpr(instrs) {
+  var out = [];
+  instrs.forEach(function (instr) {
+    // $FlowIgnore
+    var n = encodeNode(instr);
+    out.push.apply(out, _toConsumableArray(n));
+  });
+  return out;
+}
+
+export function encodeStringLiteral(n) {
+  return encodeUTF8Vec(n.value);
+}
+export function encodeGlobal(n) {
+  var out = [];
+  var _n$globalType = n.globalType,
+      valtype = _n$globalType.valtype,
+      mutability = _n$globalType.mutability;
+  out.push(encodeValtype(valtype));
+  out.push(encodeMutability(mutability));
+  out.push.apply(out, _toConsumableArray(encodeExpr(n.init)));
+  return out;
+}
+export function encodeFuncBody(n) {
+  var out = [];
+  out.push(-1); // temporary function body size
+  // FIXME(sven): get the func locals?
+
+  var localBytes = encodeVec([]);
+  out.push.apply(out, _toConsumableArray(localBytes));
+  var funcBodyBytes = encodeExpr(n.body);
+  out[0] = funcBodyBytes.length + localBytes.length;
+  out.push.apply(out, _toConsumableArray(funcBodyBytes));
+  return out;
+}
+export function encodeIndexInFuncSection(n) {
+  assertNotIdentifierNode(n.index); // $FlowIgnore
+
+  return encodeU32(n.index.value);
+}
+export function encodeElem(n) {
+  var out = [];
+  assertNotIdentifierNode(n.table); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.table.value)));
+  out.push.apply(out, _toConsumableArray(encodeExpr(n.offset))); // $FlowIgnore
+
+  var funcs = n.funcs.reduce(function (acc, x) {
+    return _toConsumableArray(acc).concat(_toConsumableArray(encodeU32(x.value)));
+  }, []);
+  out.push.apply(out, _toConsumableArray(encodeVec(funcs)));
+  return out;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/esm/index.js
new file mode 100644
index 0000000..83bc19f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/esm/index.js
@@ -0,0 +1,51 @@
+import * as encoder from "./encoder";
+export function encodeNode(n) {
+  switch (n.type) {
+    case "ModuleImport":
+      // $FlowIgnore: ModuleImport ensure that the node is well formated
+      return encoder.encodeModuleImport(n);
+
+    case "SectionMetadata":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeSectionMetadata(n);
+
+    case "CallInstruction":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeCallInstruction(n);
+
+    case "CallIndirectInstruction":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeCallIndirectInstruction(n);
+
+    case "TypeInstruction":
+      return encoder.encodeTypeInstruction(n);
+
+    case "Instr":
+      // $FlowIgnore
+      return encoder.encodeInstr(n);
+
+    case "ModuleExport":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeModuleExport(n);
+
+    case "Global":
+      // $FlowIgnore
+      return encoder.encodeGlobal(n);
+
+    case "Func":
+      return encoder.encodeFuncBody(n);
+
+    case "IndexInFuncSection":
+      return encoder.encodeIndexInFuncSection(n);
+
+    case "StringLiteral":
+      return encoder.encodeStringLiteral(n);
+
+    case "Elem":
+      return encoder.encodeElem(n);
+
+    default:
+      throw new Error("Unsupported encoding for node of type: " + JSON.stringify(n.type));
+  }
+}
+export var encodeU32 = encoder.encodeU32;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js
new file mode 100644
index 0000000..a77bff7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js
@@ -0,0 +1,357 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.encodeVersion = encodeVersion;
+exports.encodeHeader = encodeHeader;
+exports.encodeU32 = encodeU32;
+exports.encodeI32 = encodeI32;
+exports.encodeI64 = encodeI64;
+exports.encodeVec = encodeVec;
+exports.encodeValtype = encodeValtype;
+exports.encodeMutability = encodeMutability;
+exports.encodeUTF8Vec = encodeUTF8Vec;
+exports.encodeLimits = encodeLimits;
+exports.encodeModuleImport = encodeModuleImport;
+exports.encodeSectionMetadata = encodeSectionMetadata;
+exports.encodeCallInstruction = encodeCallInstruction;
+exports.encodeCallIndirectInstruction = encodeCallIndirectInstruction;
+exports.encodeModuleExport = encodeModuleExport;
+exports.encodeTypeInstruction = encodeTypeInstruction;
+exports.encodeInstr = encodeInstr;
+exports.encodeStringLiteral = encodeStringLiteral;
+exports.encodeGlobal = encodeGlobal;
+exports.encodeFuncBody = encodeFuncBody;
+exports.encodeIndexInFuncSection = encodeIndexInFuncSection;
+exports.encodeElem = encodeElem;
+
+var leb = _interopRequireWildcard(require("@webassemblyjs/leb128"));
+
+var ieee754 = _interopRequireWildcard(require("@webassemblyjs/ieee754"));
+
+var utf8 = _interopRequireWildcard(require("@webassemblyjs/utf8"));
+
+var _helperWasmBytecode = _interopRequireDefault(require("@webassemblyjs/helper-wasm-bytecode"));
+
+var _index = require("../index");
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function assertNotIdentifierNode(n) {
+  if (n.type === "Identifier") {
+    throw new Error("Unsupported node Identifier");
+  }
+}
+
+function encodeVersion(v) {
+  var bytes = _helperWasmBytecode.default.moduleVersion;
+  bytes[0] = v;
+  return bytes;
+}
+
+function encodeHeader() {
+  return _helperWasmBytecode.default.magicModuleHeader;
+}
+
+function encodeU32(v) {
+  var uint8view = new Uint8Array(leb.encodeU32(v));
+
+  var array = _toConsumableArray(uint8view);
+
+  return array;
+}
+
+function encodeI32(v) {
+  var uint8view = new Uint8Array(leb.encodeI32(v));
+
+  var array = _toConsumableArray(uint8view);
+
+  return array;
+}
+
+function encodeI64(v) {
+  var uint8view = new Uint8Array(leb.encodeI64(v));
+
+  var array = _toConsumableArray(uint8view);
+
+  return array;
+}
+
+function encodeVec(elements) {
+  var size = encodeU32(elements.length);
+  return _toConsumableArray(size).concat(_toConsumableArray(elements));
+}
+
+function encodeValtype(v) {
+  var byte = _helperWasmBytecode.default.valtypesByString[v];
+
+  if (typeof byte === "undefined") {
+    throw new Error("Unknown valtype: " + v);
+  }
+
+  return parseInt(byte, 10);
+}
+
+function encodeMutability(v) {
+  var byte = _helperWasmBytecode.default.globalTypesByString[v];
+
+  if (typeof byte === "undefined") {
+    throw new Error("Unknown mutability: " + v);
+  }
+
+  return parseInt(byte, 10);
+}
+
+function encodeUTF8Vec(str) {
+  return encodeVec(utf8.encode(str));
+}
+
+function encodeLimits(n) {
+  var out = [];
+
+  if (typeof n.max === "number") {
+    out.push(0x01);
+    out.push.apply(out, _toConsumableArray(encodeU32(n.min))); // $FlowIgnore: ensured by the typeof
+
+    out.push.apply(out, _toConsumableArray(encodeU32(n.max)));
+  } else {
+    out.push(0x00);
+    out.push.apply(out, _toConsumableArray(encodeU32(n.min)));
+  }
+
+  return out;
+}
+
+function encodeModuleImport(n) {
+  var out = [];
+  out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.module)));
+  out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));
+
+  switch (n.descr.type) {
+    case "GlobalType":
+      {
+        out.push(0x03); // $FlowIgnore: GlobalType ensure that these props exists
+
+        out.push(encodeValtype(n.descr.valtype)); // $FlowIgnore: GlobalType ensure that these props exists
+
+        out.push(encodeMutability(n.descr.mutability));
+        break;
+      }
+
+    case "Memory":
+      {
+        out.push(0x02); // $FlowIgnore
+
+        out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));
+        break;
+      }
+
+    case "Table":
+      {
+        out.push(0x01);
+        out.push(0x70); // element type
+        // $FlowIgnore
+
+        out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));
+        break;
+      }
+
+    case "FuncImportDescr":
+      {
+        out.push(0x00); // $FlowIgnore
+
+        assertNotIdentifierNode(n.descr.id); // $FlowIgnore
+
+        out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));
+        break;
+      }
+
+    default:
+      throw new Error("Unsupport operation: encode module import of type: " + n.descr.type);
+  }
+
+  return out;
+}
+
+function encodeSectionMetadata(n) {
+  var out = [];
+  var sectionId = _helperWasmBytecode.default.sections[n.section];
+
+  if (typeof sectionId === "undefined") {
+    throw new Error("Unknown section: " + n.section);
+  }
+
+  if (n.section === "start") {
+    /**
+     * This is not implemented yet because it's a special case which
+     * doesn't have a vector in its section.
+     */
+    throw new Error("Unsupported section encoding of type start");
+  }
+
+  out.push(sectionId);
+  out.push.apply(out, _toConsumableArray(encodeU32(n.size.value)));
+  out.push.apply(out, _toConsumableArray(encodeU32(n.vectorOfSize.value)));
+  return out;
+}
+
+function encodeCallInstruction(n) {
+  var out = [];
+  assertNotIdentifierNode(n.index);
+  out.push(0x10); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.index.value)));
+  return out;
+}
+
+function encodeCallIndirectInstruction(n) {
+  var out = []; // $FlowIgnore
+
+  assertNotIdentifierNode(n.index);
+  out.push(0x11); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.index.value))); // add a reserved byte
+
+  out.push(0x00);
+  return out;
+}
+
+function encodeModuleExport(n) {
+  var out = [];
+  assertNotIdentifierNode(n.descr.id);
+  var exportTypeByteString = _helperWasmBytecode.default.exportTypesByName[n.descr.exportType];
+
+  if (typeof exportTypeByteString === "undefined") {
+    throw new Error("Unknown export of type: " + n.descr.exportType);
+  }
+
+  var exportTypeByte = parseInt(exportTypeByteString, 10);
+  out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));
+  out.push(exportTypeByte); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));
+  return out;
+}
+
+function encodeTypeInstruction(n) {
+  var out = [0x60];
+  var params = n.functype.params.map(function (x) {
+    return x.valtype;
+  }).map(encodeValtype);
+  var results = n.functype.results.map(encodeValtype);
+  out.push.apply(out, _toConsumableArray(encodeVec(params)));
+  out.push.apply(out, _toConsumableArray(encodeVec(results)));
+  return out;
+}
+
+function encodeInstr(n) {
+  var out = [];
+  var instructionName = n.id;
+
+  if (typeof n.object === "string") {
+    instructionName = "".concat(n.object, ".").concat(String(n.id));
+  }
+
+  var byteString = _helperWasmBytecode.default.symbolsByName[instructionName];
+
+  if (typeof byteString === "undefined") {
+    throw new Error("encodeInstr: unknown instruction " + JSON.stringify(instructionName));
+  }
+
+  var byte = parseInt(byteString, 10);
+  out.push(byte);
+
+  if (n.args) {
+    n.args.forEach(function (arg) {
+      var encoder = encodeU32; // find correct encoder
+
+      if (n.object === "i32") {
+        encoder = encodeI32;
+      }
+
+      if (n.object === "i64") {
+        encoder = encodeI64;
+      }
+
+      if (n.object === "f32") {
+        encoder = ieee754.encodeF32;
+      }
+
+      if (n.object === "f64") {
+        encoder = ieee754.encodeF64;
+      }
+
+      if (arg.type === "NumberLiteral" || arg.type === "FloatLiteral" || arg.type === "LongNumberLiteral") {
+        // $FlowIgnore
+        out.push.apply(out, _toConsumableArray(encoder(arg.value)));
+      } else {
+        throw new Error("Unsupported instruction argument encoding " + JSON.stringify(arg.type));
+      }
+    });
+  }
+
+  return out;
+}
+
+function encodeExpr(instrs) {
+  var out = [];
+  instrs.forEach(function (instr) {
+    // $FlowIgnore
+    var n = (0, _index.encodeNode)(instr);
+    out.push.apply(out, _toConsumableArray(n));
+  });
+  return out;
+}
+
+function encodeStringLiteral(n) {
+  return encodeUTF8Vec(n.value);
+}
+
+function encodeGlobal(n) {
+  var out = [];
+  var _n$globalType = n.globalType,
+      valtype = _n$globalType.valtype,
+      mutability = _n$globalType.mutability;
+  out.push(encodeValtype(valtype));
+  out.push(encodeMutability(mutability));
+  out.push.apply(out, _toConsumableArray(encodeExpr(n.init)));
+  return out;
+}
+
+function encodeFuncBody(n) {
+  var out = [];
+  out.push(-1); // temporary function body size
+  // FIXME(sven): get the func locals?
+
+  var localBytes = encodeVec([]);
+  out.push.apply(out, _toConsumableArray(localBytes));
+  var funcBodyBytes = encodeExpr(n.body);
+  out[0] = funcBodyBytes.length + localBytes.length;
+  out.push.apply(out, _toConsumableArray(funcBodyBytes));
+  return out;
+}
+
+function encodeIndexInFuncSection(n) {
+  assertNotIdentifierNode(n.index); // $FlowIgnore
+
+  return encodeU32(n.index.value);
+}
+
+function encodeElem(n) {
+  var out = [];
+  assertNotIdentifierNode(n.table); // $FlowIgnore
+
+  out.push.apply(out, _toConsumableArray(encodeU32(n.table.value)));
+  out.push.apply(out, _toConsumableArray(encodeExpr(n.offset))); // $FlowIgnore
+
+  var funcs = n.funcs.reduce(function (acc, x) {
+    return _toConsumableArray(acc).concat(_toConsumableArray(encodeU32(x.value)));
+  }, []);
+  out.push.apply(out, _toConsumableArray(encodeVec(funcs)));
+  return out;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/lib/index.js
new file mode 100644
index 0000000..f5095b1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/lib/index.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.encodeNode = encodeNode;
+exports.encodeU32 = void 0;
+
+var encoder = _interopRequireWildcard(require("./encoder"));
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+function encodeNode(n) {
+  switch (n.type) {
+    case "ModuleImport":
+      // $FlowIgnore: ModuleImport ensure that the node is well formated
+      return encoder.encodeModuleImport(n);
+
+    case "SectionMetadata":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeSectionMetadata(n);
+
+    case "CallInstruction":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeCallInstruction(n);
+
+    case "CallIndirectInstruction":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeCallIndirectInstruction(n);
+
+    case "TypeInstruction":
+      return encoder.encodeTypeInstruction(n);
+
+    case "Instr":
+      // $FlowIgnore
+      return encoder.encodeInstr(n);
+
+    case "ModuleExport":
+      // $FlowIgnore: SectionMetadata ensure that the node is well formated
+      return encoder.encodeModuleExport(n);
+
+    case "Global":
+      // $FlowIgnore
+      return encoder.encodeGlobal(n);
+
+    case "Func":
+      return encoder.encodeFuncBody(n);
+
+    case "IndexInFuncSection":
+      return encoder.encodeIndexInFuncSection(n);
+
+    case "StringLiteral":
+      return encoder.encodeStringLiteral(n);
+
+    case "Elem":
+      return encoder.encodeElem(n);
+
+    default:
+      throw new Error("Unsupported encoding for node of type: " + JSON.stringify(n.type));
+  }
+}
+
+var encodeU32 = encoder.encodeU32;
+exports.encodeU32 = encodeU32;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/package.json
new file mode 100644
index 0000000..a0e43f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-gen/package.json
@@ -0,0 +1,27 @@
+{
+  "name": "@webassemblyjs/wasm-gen",
+  "version": "1.11.1",
+  "description": "WebAssembly binary format printer",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "dependencies": {
+    "@webassemblyjs/ast": "1.11.1",
+    "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+    "@webassemblyjs/ieee754": "1.11.1",
+    "@webassemblyjs/leb128": "1.11.1",
+    "@webassemblyjs/utf8": "1.11.1"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/esm/index.js
new file mode 100644
index 0000000..f9d9232
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/esm/index.js
@@ -0,0 +1,41 @@
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
+
+function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }
+
+import { decode } from "@webassemblyjs/wasm-parser";
+import { shrinkPaddedLEB128 as makeShrinkPaddedLEB128 } from "./leb128.js";
+
+var OptimizerError =
+/*#__PURE__*/
+function (_Error) {
+  _inherits(OptimizerError, _Error);
+
+  function OptimizerError(name, initalError) {
+    var _this;
+
+    _classCallCheck(this, OptimizerError);
+
+    _this = _possibleConstructorReturn(this, (OptimizerError.__proto__ || Object.getPrototypeOf(OptimizerError)).call(this, "Error while optimizing: " + name + ": " + initalError.message));
+    _this.stack = initalError.stack;
+    return _this;
+  }
+
+  return OptimizerError;
+}(Error);
+
+var decoderOpts = {
+  ignoreCodeSection: true,
+  ignoreDataSection: true
+};
+export function shrinkPaddedLEB128(uint8Buffer) {
+  try {
+    var ast = decode(uint8Buffer.buffer, decoderOpts);
+    return makeShrinkPaddedLEB128(ast, uint8Buffer);
+  } catch (e) {
+    throw new OptimizerError("shrinkPaddedLEB128", e);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/esm/leb128.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/esm/leb128.js
new file mode 100644
index 0000000..3150c9e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/esm/leb128.js
@@ -0,0 +1,47 @@
+import { traverse, shiftSection } from "@webassemblyjs/ast";
+import { encodeU32 } from "@webassemblyjs/wasm-gen/lib/encoder";
+import { overrideBytesInBuffer } from "@webassemblyjs/helper-buffer";
+
+function shiftFollowingSections(ast, _ref, deltaInSizeEncoding) {
+  var section = _ref.section;
+  // Once we hit our section every that is after needs to be shifted by the delta
+  var encounteredSection = false;
+  traverse(ast, {
+    SectionMetadata: function SectionMetadata(path) {
+      if (path.node.section === section) {
+        encounteredSection = true;
+        return;
+      }
+
+      if (encounteredSection === true) {
+        shiftSection(ast, path.node, deltaInSizeEncoding);
+      }
+    }
+  });
+}
+
+export function shrinkPaddedLEB128(ast, uint8Buffer) {
+  traverse(ast, {
+    SectionMetadata: function SectionMetadata(_ref2) {
+      var node = _ref2.node;
+
+      /**
+       * Section size
+       */
+      {
+        var newu32Encoded = encodeU32(node.size.value);
+        var newu32EncodedLen = newu32Encoded.length;
+        var start = node.size.loc.start.column;
+        var end = node.size.loc.end.column;
+        var oldu32EncodedLen = end - start;
+
+        if (newu32EncodedLen !== oldu32EncodedLen) {
+          var deltaInSizeEncoding = oldu32EncodedLen - newu32EncodedLen;
+          uint8Buffer = overrideBytesInBuffer(uint8Buffer, start, end, newu32Encoded);
+          shiftFollowingSections(ast, node, -deltaInSizeEncoding);
+        }
+      }
+    }
+  });
+  return uint8Buffer;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/lib/index.js
new file mode 100644
index 0000000..4355961
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/lib/index.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.shrinkPaddedLEB128 = shrinkPaddedLEB128;
+
+var _wasmParser = require("@webassemblyjs/wasm-parser");
+
+var _leb = require("./leb128.js");
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
+
+function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }
+
+var OptimizerError =
+/*#__PURE__*/
+function (_Error) {
+  _inherits(OptimizerError, _Error);
+
+  function OptimizerError(name, initalError) {
+    var _this;
+
+    _classCallCheck(this, OptimizerError);
+
+    _this = _possibleConstructorReturn(this, (OptimizerError.__proto__ || Object.getPrototypeOf(OptimizerError)).call(this, "Error while optimizing: " + name + ": " + initalError.message));
+    _this.stack = initalError.stack;
+    return _this;
+  }
+
+  return OptimizerError;
+}(Error);
+
+var decoderOpts = {
+  ignoreCodeSection: true,
+  ignoreDataSection: true
+};
+
+function shrinkPaddedLEB128(uint8Buffer) {
+  try {
+    var ast = (0, _wasmParser.decode)(uint8Buffer.buffer, decoderOpts);
+    return (0, _leb.shrinkPaddedLEB128)(ast, uint8Buffer);
+  } catch (e) {
+    throw new OptimizerError("shrinkPaddedLEB128", e);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/lib/leb128.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/lib/leb128.js
new file mode 100644
index 0000000..e4a0e85
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/lib/leb128.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.shrinkPaddedLEB128 = shrinkPaddedLEB128;
+
+var _ast = require("@webassemblyjs/ast");
+
+var _encoder = require("@webassemblyjs/wasm-gen/lib/encoder");
+
+var _helperBuffer = require("@webassemblyjs/helper-buffer");
+
+function shiftFollowingSections(ast, _ref, deltaInSizeEncoding) {
+  var section = _ref.section;
+  // Once we hit our section every that is after needs to be shifted by the delta
+  var encounteredSection = false;
+  (0, _ast.traverse)(ast, {
+    SectionMetadata: function SectionMetadata(path) {
+      if (path.node.section === section) {
+        encounteredSection = true;
+        return;
+      }
+
+      if (encounteredSection === true) {
+        (0, _ast.shiftSection)(ast, path.node, deltaInSizeEncoding);
+      }
+    }
+  });
+}
+
+function shrinkPaddedLEB128(ast, uint8Buffer) {
+  (0, _ast.traverse)(ast, {
+    SectionMetadata: function SectionMetadata(_ref2) {
+      var node = _ref2.node;
+
+      /**
+       * Section size
+       */
+      {
+        var newu32Encoded = (0, _encoder.encodeU32)(node.size.value);
+        var newu32EncodedLen = newu32Encoded.length;
+        var start = node.size.loc.start.column;
+        var end = node.size.loc.end.column;
+        var oldu32EncodedLen = end - start;
+
+        if (newu32EncodedLen !== oldu32EncodedLen) {
+          var deltaInSizeEncoding = oldu32EncodedLen - newu32EncodedLen;
+          uint8Buffer = (0, _helperBuffer.overrideBytesInBuffer)(uint8Buffer, start, end, newu32Encoded);
+          shiftFollowingSections(ast, node, -deltaInSizeEncoding);
+        }
+      }
+    }
+  });
+  return uint8Buffer;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/package.json
new file mode 100644
index 0000000..396e650
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-opt/package.json
@@ -0,0 +1,26 @@
+{
+  "name": "@webassemblyjs/wasm-opt",
+  "version": "1.11.1",
+  "description": "",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "dependencies": {
+    "@webassemblyjs/ast": "1.11.1",
+    "@webassemblyjs/helper-buffer": "1.11.1",
+    "@webassemblyjs/wasm-gen": "1.11.1",
+    "@webassemblyjs/wasm-parser": "1.11.1"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/README.md b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/README.md
new file mode 100644
index 0000000..98add5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/README.md
@@ -0,0 +1,28 @@
+# @webassemblyjs/wasm-parser
+
+> WebAssembly binary format parser
+
+## Installation
+
+```sh
+yarn add @webassemblyjs/wasm-parser
+```
+
+## Usage
+
+```js
+import { decode } from "@webassemblyjs/wasm-parser";
+import { readFileSync } from "fs";
+
+const binary = readFileSync("/path/to/module.wasm");
+
+const decoderOpts = {};
+const ast = decode(binary, decoderOpts);
+```
+
+### Decoder options
+
+- `dump`: print dump information while decoding (default `false`)
+- `ignoreCodeSection`: ignore the code section (default `false`)
+- `ignoreDataSection`: ignore the data section (default `false`)
+
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/decoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/decoder.js
new file mode 100644
index 0000000..2b36795
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/decoder.js
@@ -0,0 +1,1776 @@
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+import { CompileError } from "@webassemblyjs/helper-api-error";
+import * as ieee754 from "@webassemblyjs/ieee754";
+import * as utf8 from "@webassemblyjs/utf8";
+import * as t from "@webassemblyjs/ast";
+import { decodeInt32, decodeUInt32, MAX_NUMBER_OF_BYTE_U32, decodeInt64, decodeUInt64, MAX_NUMBER_OF_BYTE_U64 } from "@webassemblyjs/leb128";
+import constants from "@webassemblyjs/helper-wasm-bytecode";
+
+function toHex(n) {
+  return "0x" + Number(n).toString(16);
+}
+
+function byteArrayEq(l, r) {
+  if (l.length !== r.length) {
+    return false;
+  }
+
+  for (var i = 0; i < l.length; i++) {
+    if (l[i] !== r[i]) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+export function decode(ab, opts) {
+  var buf = new Uint8Array(ab);
+  var getUniqueName = t.getUniqueNameGenerator();
+  var offset = 0;
+
+  function getPosition() {
+    return {
+      line: -1,
+      column: offset
+    };
+  }
+
+  function dump(b, msg) {
+    if (opts.dump === false) return;
+    var pad = "\t\t\t\t\t\t\t\t\t\t";
+    var str = "";
+
+    if (b.length < 5) {
+      str = b.map(toHex).join(" ");
+    } else {
+      str = "...";
+    }
+
+    console.log(toHex(offset) + ":\t", str, pad, ";", msg);
+  }
+
+  function dumpSep(msg) {
+    if (opts.dump === false) return;
+    console.log(";", msg);
+  }
+  /**
+   * TODO(sven): we can atually use a same structure
+   * we are adding incrementally new features
+   */
+
+
+  var state = {
+    elementsInFuncSection: [],
+    elementsInExportSection: [],
+    elementsInCodeSection: [],
+
+    /**
+     * Decode memory from:
+     * - Memory section
+     */
+    memoriesInModule: [],
+
+    /**
+     * Decoded types from:
+     * - Type section
+     */
+    typesInModule: [],
+
+    /**
+     * Decoded functions from:
+     * - Function section
+     * - Import section
+     */
+    functionsInModule: [],
+
+    /**
+     * Decoded tables from:
+     * - Table section
+     */
+    tablesInModule: [],
+
+    /**
+     * Decoded globals from:
+     * - Global section
+     */
+    globalsInModule: []
+  };
+
+  function isEOF() {
+    return offset >= buf.length;
+  }
+
+  function eatBytes(n) {
+    offset = offset + n;
+  }
+
+  function readBytesAtOffset(_offset, numberOfBytes) {
+    var arr = [];
+
+    for (var i = 0; i < numberOfBytes; i++) {
+      arr.push(buf[_offset + i]);
+    }
+
+    return arr;
+  }
+
+  function readBytes(numberOfBytes) {
+    return readBytesAtOffset(offset, numberOfBytes);
+  }
+
+  function readF64() {
+    var bytes = readBytes(ieee754.NUMBER_OF_BYTE_F64);
+    var value = ieee754.decodeF64(bytes);
+
+    if (Math.sign(value) * value === Infinity) {
+      return {
+        value: Math.sign(value),
+        inf: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F64
+      };
+    }
+
+    if (isNaN(value)) {
+      var sign = bytes[bytes.length - 1] >> 7 ? -1 : 1;
+      var mantissa = 0;
+
+      for (var i = 0; i < bytes.length - 2; ++i) {
+        mantissa += bytes[i] * Math.pow(256, i);
+      }
+
+      mantissa += bytes[bytes.length - 2] % 16 * Math.pow(256, bytes.length - 2);
+      return {
+        value: sign * mantissa,
+        nan: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F64
+      };
+    }
+
+    return {
+      value: value,
+      nextIndex: ieee754.NUMBER_OF_BYTE_F64
+    };
+  }
+
+  function readF32() {
+    var bytes = readBytes(ieee754.NUMBER_OF_BYTE_F32);
+    var value = ieee754.decodeF32(bytes);
+
+    if (Math.sign(value) * value === Infinity) {
+      return {
+        value: Math.sign(value),
+        inf: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F32
+      };
+    }
+
+    if (isNaN(value)) {
+      var sign = bytes[bytes.length - 1] >> 7 ? -1 : 1;
+      var mantissa = 0;
+
+      for (var i = 0; i < bytes.length - 2; ++i) {
+        mantissa += bytes[i] * Math.pow(256, i);
+      }
+
+      mantissa += bytes[bytes.length - 2] % 128 * Math.pow(256, bytes.length - 2);
+      return {
+        value: sign * mantissa,
+        nan: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F32
+      };
+    }
+
+    return {
+      value: value,
+      nextIndex: ieee754.NUMBER_OF_BYTE_F32
+    };
+  }
+
+  function readUTF8String() {
+    var lenu32 = readU32(); // Don't eat any bytes. Instead, peek ahead of the current offset using
+    // readBytesAtOffset below. This keeps readUTF8String neutral with respect
+    // to the current offset, just like the other readX functions.
+
+    var strlen = lenu32.value;
+    dump([strlen], "string length");
+    var bytes = readBytesAtOffset(offset + lenu32.nextIndex, strlen);
+    var value = utf8.decode(bytes);
+    return {
+      value: value,
+      nextIndex: strlen + lenu32.nextIndex
+    };
+  }
+  /**
+   * Decode an unsigned 32bits integer
+   *
+   * The length will be handled by the leb librairy, we pass the max number of
+   * byte.
+   */
+
+
+  function readU32() {
+    var bytes = readBytes(MAX_NUMBER_OF_BYTE_U32);
+    var buffer = Buffer.from(bytes);
+    return decodeUInt32(buffer);
+  }
+
+  function readVaruint32() {
+    // where 32 bits = max 4 bytes
+    var bytes = readBytes(4);
+    var buffer = Buffer.from(bytes);
+    return decodeUInt32(buffer);
+  }
+
+  function readVaruint7() {
+    // where 7 bits = max 1 bytes
+    var bytes = readBytes(1);
+    var buffer = Buffer.from(bytes);
+    return decodeUInt32(buffer);
+  }
+  /**
+   * Decode a signed 32bits interger
+   */
+
+
+  function read32() {
+    var bytes = readBytes(MAX_NUMBER_OF_BYTE_U32);
+    var buffer = Buffer.from(bytes);
+    return decodeInt32(buffer);
+  }
+  /**
+   * Decode a signed 64bits integer
+   */
+
+
+  function read64() {
+    var bytes = readBytes(MAX_NUMBER_OF_BYTE_U64);
+    var buffer = Buffer.from(bytes);
+    return decodeInt64(buffer);
+  }
+
+  function readU64() {
+    var bytes = readBytes(MAX_NUMBER_OF_BYTE_U64);
+    var buffer = Buffer.from(bytes);
+    return decodeUInt64(buffer);
+  }
+
+  function readByte() {
+    return readBytes(1)[0];
+  }
+
+  function parseModuleHeader() {
+    if (isEOF() === true || offset + 4 > buf.length) {
+      throw new Error("unexpected end");
+    }
+
+    var header = readBytes(4);
+
+    if (byteArrayEq(constants.magicModuleHeader, header) === false) {
+      throw new CompileError("magic header not detected");
+    }
+
+    dump(header, "wasm magic header");
+    eatBytes(4);
+  }
+
+  function parseVersion() {
+    if (isEOF() === true || offset + 4 > buf.length) {
+      throw new Error("unexpected end");
+    }
+
+    var version = readBytes(4);
+
+    if (byteArrayEq(constants.moduleVersion, version) === false) {
+      throw new CompileError("unknown binary version");
+    }
+
+    dump(version, "wasm version");
+    eatBytes(4);
+  }
+
+  function parseVec(cast) {
+    var u32 = readU32();
+    var length = u32.value;
+    eatBytes(u32.nextIndex);
+    dump([length], "number");
+
+    if (length === 0) {
+      return [];
+    }
+
+    var elements = [];
+
+    for (var i = 0; i < length; i++) {
+      var byte = readByte();
+      eatBytes(1);
+      var value = cast(byte);
+      dump([byte], value);
+
+      if (typeof value === "undefined") {
+        throw new CompileError("Internal failure: parseVec could not cast the value");
+      }
+
+      elements.push(value);
+    }
+
+    return elements;
+  } // Type section
+  // https://webassembly.github.io/spec/binary/modules.html#binary-typesec
+
+
+  function parseTypeSection(numberOfTypes) {
+    var typeInstructionNodes = [];
+    dump([numberOfTypes], "num types");
+
+    for (var i = 0; i < numberOfTypes; i++) {
+      var _startLoc = getPosition();
+
+      dumpSep("type " + i);
+      var type = readByte();
+      eatBytes(1);
+
+      if (type == constants.types.func) {
+        dump([type], "func");
+        var paramValtypes = parseVec(function (b) {
+          return constants.valtypes[b];
+        });
+        var params = paramValtypes.map(function (v) {
+          return t.funcParam(
+          /*valtype*/
+          v);
+        });
+        var result = parseVec(function (b) {
+          return constants.valtypes[b];
+        });
+        typeInstructionNodes.push(function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.typeInstruction(undefined, t.signature(params, result)), endLoc, _startLoc);
+        }());
+        state.typesInModule.push({
+          params: params,
+          result: result
+        });
+      } else {
+        throw new Error("Unsupported type: " + toHex(type));
+      }
+    }
+
+    return typeInstructionNodes;
+  } // Import section
+  // https://webassembly.github.io/spec/binary/modules.html#binary-importsec
+
+
+  function parseImportSection(numberOfImports) {
+    var imports = [];
+
+    for (var i = 0; i < numberOfImports; i++) {
+      dumpSep("import header " + i);
+
+      var _startLoc2 = getPosition();
+      /**
+       * Module name
+       */
+
+
+      var moduleName = readUTF8String();
+      eatBytes(moduleName.nextIndex);
+      dump([], "module name (".concat(moduleName.value, ")"));
+      /**
+       * Name
+       */
+
+      var name = readUTF8String();
+      eatBytes(name.nextIndex);
+      dump([], "name (".concat(name.value, ")"));
+      /**
+       * Import descr
+       */
+
+      var descrTypeByte = readByte();
+      eatBytes(1);
+      var descrType = constants.importTypes[descrTypeByte];
+      dump([descrTypeByte], "import kind");
+
+      if (typeof descrType === "undefined") {
+        throw new CompileError("Unknown import description type: " + toHex(descrTypeByte));
+      }
+
+      var importDescr = void 0;
+
+      if (descrType === "func") {
+        var indexU32 = readU32();
+        var typeindex = indexU32.value;
+        eatBytes(indexU32.nextIndex);
+        dump([typeindex], "type index");
+        var signature = state.typesInModule[typeindex];
+
+        if (typeof signature === "undefined") {
+          throw new CompileError("function signature not found (".concat(typeindex, ")"));
+        }
+
+        var id = getUniqueName("func");
+        importDescr = t.funcImportDescr(id, t.signature(signature.params, signature.result));
+        state.functionsInModule.push({
+          id: t.identifier(name.value),
+          signature: signature,
+          isExternal: true
+        });
+      } else if (descrType === "global") {
+        importDescr = parseGlobalType();
+        var globalNode = t.global(importDescr, []);
+        state.globalsInModule.push(globalNode);
+      } else if (descrType === "table") {
+        importDescr = parseTableType(i);
+      } else if (descrType === "mem") {
+        var memoryNode = parseMemoryType(0);
+        state.memoriesInModule.push(memoryNode);
+        importDescr = memoryNode;
+      } else {
+        throw new CompileError("Unsupported import of type: " + descrType);
+      }
+
+      imports.push(function () {
+        var endLoc = getPosition();
+        return t.withLoc(t.moduleImport(moduleName.value, name.value, importDescr), endLoc, _startLoc2);
+      }());
+    }
+
+    return imports;
+  } // Function section
+  // https://webassembly.github.io/spec/binary/modules.html#function-section
+
+
+  function parseFuncSection(numberOfFunctions) {
+    dump([numberOfFunctions], "num funcs");
+
+    for (var i = 0; i < numberOfFunctions; i++) {
+      var indexU32 = readU32();
+      var typeindex = indexU32.value;
+      eatBytes(indexU32.nextIndex);
+      dump([typeindex], "type index");
+      var signature = state.typesInModule[typeindex];
+
+      if (typeof signature === "undefined") {
+        throw new CompileError("function signature not found (".concat(typeindex, ")"));
+      } // preserve anonymous, a name might be resolved later
+
+
+      var id = t.withRaw(t.identifier(getUniqueName("func")), "");
+      state.functionsInModule.push({
+        id: id,
+        signature: signature,
+        isExternal: false
+      });
+    }
+  } // Export section
+  // https://webassembly.github.io/spec/binary/modules.html#export-section
+
+
+  function parseExportSection(numberOfExport) {
+    dump([numberOfExport], "num exports"); // Parse vector of exports
+
+    for (var i = 0; i < numberOfExport; i++) {
+      var _startLoc3 = getPosition();
+      /**
+       * Name
+       */
+
+
+      var name = readUTF8String();
+      eatBytes(name.nextIndex);
+      dump([], "export name (".concat(name.value, ")"));
+      /**
+       * exportdescr
+       */
+
+      var typeIndex = readByte();
+      eatBytes(1);
+      dump([typeIndex], "export kind");
+      var indexu32 = readU32();
+      var index = indexu32.value;
+      eatBytes(indexu32.nextIndex);
+      dump([index], "export index");
+      var id = void 0,
+          signature = void 0;
+
+      if (constants.exportTypes[typeIndex] === "Func") {
+        var func = state.functionsInModule[index];
+
+        if (typeof func === "undefined") {
+          throw new CompileError("unknown function (".concat(index, ")"));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = func.signature;
+      } else if (constants.exportTypes[typeIndex] === "Table") {
+        var table = state.tablesInModule[index];
+
+        if (typeof table === "undefined") {
+          throw new CompileError("unknown table ".concat(index));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = null;
+      } else if (constants.exportTypes[typeIndex] === "Mem") {
+        var memNode = state.memoriesInModule[index];
+
+        if (typeof memNode === "undefined") {
+          throw new CompileError("unknown memory ".concat(index));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = null;
+      } else if (constants.exportTypes[typeIndex] === "Global") {
+        var global = state.globalsInModule[index];
+
+        if (typeof global === "undefined") {
+          throw new CompileError("unknown global ".concat(index));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = null;
+      } else {
+        console.warn("Unsupported export type: " + toHex(typeIndex));
+        return;
+      }
+
+      var endLoc = getPosition();
+      state.elementsInExportSection.push({
+        name: name.value,
+        type: constants.exportTypes[typeIndex],
+        signature: signature,
+        id: id,
+        index: index,
+        endLoc: endLoc,
+        startLoc: _startLoc3
+      });
+    }
+  } // Code section
+  // https://webassembly.github.io/spec/binary/modules.html#code-section
+
+
+  function parseCodeSection(numberOfFuncs) {
+    dump([numberOfFuncs], "number functions"); // Parse vector of function
+
+    for (var i = 0; i < numberOfFuncs; i++) {
+      var _startLoc4 = getPosition();
+
+      dumpSep("function body " + i); // the u32 size of the function code in bytes
+      // Ignore it for now
+
+      var bodySizeU32 = readU32();
+      eatBytes(bodySizeU32.nextIndex);
+      dump([bodySizeU32.value], "function body size");
+      var code = [];
+      /**
+       * Parse locals
+       */
+
+      var funcLocalNumU32 = readU32();
+      var funcLocalNum = funcLocalNumU32.value;
+      eatBytes(funcLocalNumU32.nextIndex);
+      dump([funcLocalNum], "num locals");
+      var locals = [];
+
+      for (var _i = 0; _i < funcLocalNum; _i++) {
+        var _startLoc5 = getPosition();
+
+        var localCountU32 = readU32();
+        var localCount = localCountU32.value;
+        eatBytes(localCountU32.nextIndex);
+        dump([localCount], "num local");
+        var valtypeByte = readByte();
+        eatBytes(1);
+        var type = constants.valtypes[valtypeByte];
+        var args = [];
+
+        for (var _i2 = 0; _i2 < localCount; _i2++) {
+          args.push(t.valtypeLiteral(type));
+        }
+
+        var localNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.instruction("local", args), endLoc, _startLoc5);
+        }();
+
+        locals.push(localNode);
+        dump([valtypeByte], type);
+
+        if (typeof type === "undefined") {
+          throw new CompileError("Unexpected valtype: " + toHex(valtypeByte));
+        }
+      }
+
+      code.push.apply(code, locals); // Decode instructions until the end
+
+      parseInstructionBlock(code);
+      var endLoc = getPosition();
+      state.elementsInCodeSection.push({
+        code: code,
+        locals: locals,
+        endLoc: endLoc,
+        startLoc: _startLoc4,
+        bodySize: bodySizeU32.value
+      });
+    }
+  }
+
+  function parseInstructionBlock(code) {
+    while (true) {
+      var _startLoc6 = getPosition();
+
+      var instructionAlreadyCreated = false;
+      var instructionByte = readByte();
+      eatBytes(1);
+
+      if (instructionByte === 0xfe) {
+        instructionByte = 0xfe00 + readByte();
+        eatBytes(1);
+      }
+
+      var instruction = constants.symbolsByByte[instructionByte];
+
+      if (typeof instruction === "undefined") {
+        throw new CompileError("Unexpected instruction: " + toHex(instructionByte));
+      }
+
+      if (typeof instruction.object === "string") {
+        dump([instructionByte], "".concat(instruction.object, ".").concat(instruction.name));
+      } else {
+        dump([instructionByte], instruction.name);
+      }
+      /**
+       * End of the function
+       */
+
+
+      if (instruction.name === "end") {
+        var node = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.instruction(instruction.name), endLoc, _startLoc6);
+        }();
+
+        code.push(node);
+        break;
+      }
+
+      var args = [];
+
+      if (instruction.name === "loop") {
+        var _startLoc7 = getPosition();
+
+        var blocktypeByte = readByte();
+        eatBytes(1);
+        var blocktype = constants.blockTypes[blocktypeByte];
+        dump([blocktypeByte], "blocktype");
+
+        if (typeof blocktype === "undefined") {
+          throw new CompileError("Unexpected blocktype: " + toHex(blocktypeByte));
+        }
+
+        var instr = [];
+        parseInstructionBlock(instr); // preserve anonymous
+
+        var label = t.withRaw(t.identifier(getUniqueName("loop")), "");
+
+        var loopNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.loopInstruction(label, blocktype, instr), endLoc, _startLoc7);
+        }();
+
+        code.push(loopNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "if") {
+        var _startLoc8 = getPosition();
+
+        var _blocktypeByte = readByte();
+
+        eatBytes(1);
+        var _blocktype = constants.blockTypes[_blocktypeByte];
+        dump([_blocktypeByte], "blocktype");
+
+        if (typeof _blocktype === "undefined") {
+          throw new CompileError("Unexpected blocktype: " + toHex(_blocktypeByte));
+        }
+
+        var testIndex = t.withRaw(t.identifier(getUniqueName("if")), "");
+        var ifBody = [];
+        parseInstructionBlock(ifBody); // Defaults to no alternate
+
+        var elseIndex = 0;
+
+        for (elseIndex = 0; elseIndex < ifBody.length; ++elseIndex) {
+          var _instr = ifBody[elseIndex];
+
+          if (_instr.type === "Instr" && _instr.id === "else") {
+            break;
+          }
+        }
+
+        var consequentInstr = ifBody.slice(0, elseIndex);
+        var alternate = ifBody.slice(elseIndex + 1); // wast sugar
+
+        var testInstrs = [];
+
+        var ifNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.ifInstruction(testIndex, testInstrs, _blocktype, consequentInstr, alternate), endLoc, _startLoc8);
+        }();
+
+        code.push(ifNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "block") {
+        var _startLoc9 = getPosition();
+
+        var _blocktypeByte2 = readByte();
+
+        eatBytes(1);
+        var _blocktype2 = constants.blockTypes[_blocktypeByte2];
+        dump([_blocktypeByte2], "blocktype");
+
+        if (typeof _blocktype2 === "undefined") {
+          throw new CompileError("Unexpected blocktype: " + toHex(_blocktypeByte2));
+        }
+
+        var _instr2 = [];
+        parseInstructionBlock(_instr2); // preserve anonymous
+
+        var _label = t.withRaw(t.identifier(getUniqueName("block")), "");
+
+        var blockNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.blockInstruction(_label, _instr2, _blocktype2), endLoc, _startLoc9);
+        }();
+
+        code.push(blockNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "call") {
+        var indexu32 = readU32();
+        var index = indexu32.value;
+        eatBytes(indexu32.nextIndex);
+        dump([index], "index");
+
+        var callNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.callInstruction(t.indexLiteral(index)), endLoc, _startLoc6);
+        }();
+
+        code.push(callNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "call_indirect") {
+        var _startLoc10 = getPosition();
+
+        var indexU32 = readU32();
+        var typeindex = indexU32.value;
+        eatBytes(indexU32.nextIndex);
+        dump([typeindex], "type index");
+        var signature = state.typesInModule[typeindex];
+
+        if (typeof signature === "undefined") {
+          throw new CompileError("call_indirect signature not found (".concat(typeindex, ")"));
+        }
+
+        var _callNode = t.callIndirectInstruction(t.signature(signature.params, signature.result), []);
+
+        var flagU32 = readU32();
+        var flag = flagU32.value; // 0x00 - reserved byte
+
+        eatBytes(flagU32.nextIndex);
+
+        if (flag !== 0) {
+          throw new CompileError("zero flag expected");
+        }
+
+        code.push(function () {
+          var endLoc = getPosition();
+          return t.withLoc(_callNode, endLoc, _startLoc10);
+        }());
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "br_table") {
+        var indicesu32 = readU32();
+        var indices = indicesu32.value;
+        eatBytes(indicesu32.nextIndex);
+        dump([indices], "num indices");
+
+        for (var i = 0; i <= indices; i++) {
+          var _indexu = readU32();
+
+          var _index = _indexu.value;
+          eatBytes(_indexu.nextIndex);
+          dump([_index], "index");
+          args.push(t.numberLiteralFromRaw(_indexu.value.toString(), "u32"));
+        }
+      } else if (instructionByte >= 0x28 && instructionByte <= 0x40) {
+        /**
+         * Memory instructions
+         */
+        if (instruction.name === "grow_memory" || instruction.name === "current_memory") {
+          var _indexU = readU32();
+
+          var _index2 = _indexU.value;
+          eatBytes(_indexU.nextIndex);
+
+          if (_index2 !== 0) {
+            throw new Error("zero flag expected");
+          }
+
+          dump([_index2], "index");
+        } else {
+          var aligun32 = readU32();
+          var align = aligun32.value;
+          eatBytes(aligun32.nextIndex);
+          dump([align], "align");
+          var offsetu32 = readU32();
+          var _offset2 = offsetu32.value;
+          eatBytes(offsetu32.nextIndex);
+          dump([_offset2], "offset");
+        }
+      } else if (instructionByte >= 0x41 && instructionByte <= 0x44) {
+        /**
+         * Numeric instructions
+         */
+        if (instruction.object === "i32") {
+          var value32 = read32();
+          var value = value32.value;
+          eatBytes(value32.nextIndex);
+          dump([value], "i32 value");
+          args.push(t.numberLiteralFromRaw(value));
+        }
+
+        if (instruction.object === "u32") {
+          var valueu32 = readU32();
+          var _value = valueu32.value;
+          eatBytes(valueu32.nextIndex);
+          dump([_value], "u32 value");
+          args.push(t.numberLiteralFromRaw(_value));
+        }
+
+        if (instruction.object === "i64") {
+          var value64 = read64();
+          var _value2 = value64.value;
+          eatBytes(value64.nextIndex);
+          dump([Number(_value2.toString())], "i64 value");
+          var high = _value2.high,
+              low = _value2.low;
+          var _node = {
+            type: "LongNumberLiteral",
+            value: {
+              high: high,
+              low: low
+            }
+          };
+          args.push(_node);
+        }
+
+        if (instruction.object === "u64") {
+          var valueu64 = readU64();
+          var _value3 = valueu64.value;
+          eatBytes(valueu64.nextIndex);
+          dump([Number(_value3.toString())], "u64 value");
+          var _high = _value3.high,
+              _low = _value3.low;
+          var _node2 = {
+            type: "LongNumberLiteral",
+            value: {
+              high: _high,
+              low: _low
+            }
+          };
+          args.push(_node2);
+        }
+
+        if (instruction.object === "f32") {
+          var valuef32 = readF32();
+          var _value4 = valuef32.value;
+          eatBytes(valuef32.nextIndex);
+          dump([_value4], "f32 value");
+          args.push( // $FlowIgnore
+          t.floatLiteral(_value4, valuef32.nan, valuef32.inf, String(_value4)));
+        }
+
+        if (instruction.object === "f64") {
+          var valuef64 = readF64();
+          var _value5 = valuef64.value;
+          eatBytes(valuef64.nextIndex);
+          dump([_value5], "f64 value");
+          args.push( // $FlowIgnore
+          t.floatLiteral(_value5, valuef64.nan, valuef64.inf, String(_value5)));
+        }
+      } else if (instructionByte >= 0xfe00 && instructionByte <= 0xfeff) {
+        /**
+         * Atomic memory instructions
+         */
+        var align32 = readU32();
+        var _align = align32.value;
+        eatBytes(align32.nextIndex);
+        dump([_align], "align");
+
+        var _offsetu = readU32();
+
+        var _offset3 = _offsetu.value;
+        eatBytes(_offsetu.nextIndex);
+        dump([_offset3], "offset");
+      } else {
+        for (var _i3 = 0; _i3 < instruction.numberOfArgs; _i3++) {
+          var u32 = readU32();
+          eatBytes(u32.nextIndex);
+          dump([u32.value], "argument " + _i3);
+          args.push(t.numberLiteralFromRaw(u32.value));
+        }
+      }
+
+      if (instructionAlreadyCreated === false) {
+        if (typeof instruction.object === "string") {
+          var _node3 = function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.objectInstruction(instruction.name, instruction.object, args), endLoc, _startLoc6);
+          }();
+
+          code.push(_node3);
+        } else {
+          var _node4 = function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.instruction(instruction.name, args), endLoc, _startLoc6);
+          }();
+
+          code.push(_node4);
+        }
+      }
+    }
+  } // https://webassembly.github.io/spec/core/binary/types.html#limits
+
+
+  function parseLimits() {
+    var limitType = readByte();
+    eatBytes(1);
+    var shared = limitType === 0x03;
+    dump([limitType], "limit type" + (shared ? " (shared)" : ""));
+    var min, max;
+
+    if (limitType === 0x01 || limitType === 0x03 // shared limits
+    ) {
+        var u32min = readU32();
+        min = parseInt(u32min.value);
+        eatBytes(u32min.nextIndex);
+        dump([min], "min");
+        var u32max = readU32();
+        max = parseInt(u32max.value);
+        eatBytes(u32max.nextIndex);
+        dump([max], "max");
+      }
+
+    if (limitType === 0x00) {
+      var _u32min = readU32();
+
+      min = parseInt(_u32min.value);
+      eatBytes(_u32min.nextIndex);
+      dump([min], "min");
+    }
+
+    return t.limit(min, max, shared);
+  } // https://webassembly.github.io/spec/core/binary/types.html#binary-tabletype
+
+
+  function parseTableType(index) {
+    var name = t.withRaw(t.identifier(getUniqueName("table")), String(index));
+    var elementTypeByte = readByte();
+    eatBytes(1);
+    dump([elementTypeByte], "element type");
+    var elementType = constants.tableTypes[elementTypeByte];
+
+    if (typeof elementType === "undefined") {
+      throw new CompileError("Unknown element type in table: " + toHex(elementType));
+    }
+
+    var limits = parseLimits();
+    return t.table(elementType, limits, name);
+  } // https://webassembly.github.io/spec/binary/types.html#global-types
+
+
+  function parseGlobalType() {
+    var valtypeByte = readByte();
+    eatBytes(1);
+    var type = constants.valtypes[valtypeByte];
+    dump([valtypeByte], type);
+
+    if (typeof type === "undefined") {
+      throw new CompileError("Unknown valtype: " + toHex(valtypeByte));
+    }
+
+    var globalTypeByte = readByte();
+    eatBytes(1);
+    var globalType = constants.globalTypes[globalTypeByte];
+    dump([globalTypeByte], "global type (".concat(globalType, ")"));
+
+    if (typeof globalType === "undefined") {
+      throw new CompileError("Invalid mutability: " + toHex(globalTypeByte));
+    }
+
+    return t.globalType(type, globalType);
+  } // function parseNameModule() {
+  //   const lenu32 = readVaruint32();
+  //   eatBytes(lenu32.nextIndex);
+  //   console.log("len", lenu32);
+  //   const strlen = lenu32.value;
+  //   dump([strlen], "string length");
+  //   const bytes = readBytes(strlen);
+  //   eatBytes(strlen);
+  //   const value = utf8.decode(bytes);
+  //   return [t.moduleNameMetadata(value)];
+  // }
+  // this section contains an array of function names and indices
+
+
+  function parseNameSectionFunctions() {
+    var functionNames = [];
+    var numberOfFunctionsu32 = readU32();
+    var numbeOfFunctions = numberOfFunctionsu32.value;
+    eatBytes(numberOfFunctionsu32.nextIndex);
+
+    for (var i = 0; i < numbeOfFunctions; i++) {
+      var indexu32 = readU32();
+      var index = indexu32.value;
+      eatBytes(indexu32.nextIndex);
+      var name = readUTF8String();
+      eatBytes(name.nextIndex);
+      functionNames.push(t.functionNameMetadata(name.value, index));
+    }
+
+    return functionNames;
+  }
+
+  function parseNameSectionLocals() {
+    var localNames = [];
+    var numbeOfFunctionsu32 = readU32();
+    var numbeOfFunctions = numbeOfFunctionsu32.value;
+    eatBytes(numbeOfFunctionsu32.nextIndex);
+
+    for (var i = 0; i < numbeOfFunctions; i++) {
+      var functionIndexu32 = readU32();
+      var functionIndex = functionIndexu32.value;
+      eatBytes(functionIndexu32.nextIndex);
+      var numLocalsu32 = readU32();
+      var numLocals = numLocalsu32.value;
+      eatBytes(numLocalsu32.nextIndex);
+
+      for (var _i4 = 0; _i4 < numLocals; _i4++) {
+        var localIndexu32 = readU32();
+        var localIndex = localIndexu32.value;
+        eatBytes(localIndexu32.nextIndex);
+        var name = readUTF8String();
+        eatBytes(name.nextIndex);
+        localNames.push(t.localNameMetadata(name.value, localIndex, functionIndex));
+      }
+    }
+
+    return localNames;
+  } // this is a custom section used for name resolution
+  // https://github.com/WebAssembly/design/blob/master/BinaryEncoding.md#name-section
+
+
+  function parseNameSection(remainingBytes) {
+    var nameMetadata = [];
+    var initialOffset = offset;
+
+    while (offset - initialOffset < remainingBytes) {
+      // name_type
+      var sectionTypeByte = readVaruint7();
+      eatBytes(sectionTypeByte.nextIndex); // name_payload_len
+
+      var subSectionSizeInBytesu32 = readVaruint32();
+      eatBytes(subSectionSizeInBytesu32.nextIndex);
+
+      switch (sectionTypeByte.value) {
+        // case 0: {
+        // TODO(sven): re-enable that
+        // Current status: it seems that when we decode the module's name
+        // no name_payload_len is used.
+        //
+        // See https://github.com/WebAssembly/design/blob/master/BinaryEncoding.md#name-section
+        //
+        // nameMetadata.push(...parseNameModule());
+        // break;
+        // }
+        case 1:
+          {
+            nameMetadata.push.apply(nameMetadata, _toConsumableArray(parseNameSectionFunctions()));
+            break;
+          }
+
+        case 2:
+          {
+            nameMetadata.push.apply(nameMetadata, _toConsumableArray(parseNameSectionLocals()));
+            break;
+          }
+
+        default:
+          {
+            // skip unknown subsection
+            eatBytes(subSectionSizeInBytesu32.value);
+          }
+      }
+    }
+
+    return nameMetadata;
+  } // this is a custom section used for information about the producers
+  // https://github.com/WebAssembly/tool-conventions/blob/master/ProducersSection.md
+
+
+  function parseProducersSection() {
+    var metadata = t.producersSectionMetadata([]); // field_count
+
+    var sectionTypeByte = readVaruint32();
+    eatBytes(sectionTypeByte.nextIndex);
+    dump([sectionTypeByte.value], "num of producers");
+    var fields = {
+      language: [],
+      "processed-by": [],
+      sdk: []
+    }; // fields
+
+    for (var fieldI = 0; fieldI < sectionTypeByte.value; fieldI++) {
+      // field_name
+      var fieldName = readUTF8String();
+      eatBytes(fieldName.nextIndex); // field_value_count
+
+      var valueCount = readVaruint32();
+      eatBytes(valueCount.nextIndex); // field_values
+
+      for (var producerI = 0; producerI < valueCount.value; producerI++) {
+        var producerName = readUTF8String();
+        eatBytes(producerName.nextIndex);
+        var producerVersion = readUTF8String();
+        eatBytes(producerVersion.nextIndex);
+        fields[fieldName.value].push(t.producerMetadataVersionedName(producerName.value, producerVersion.value));
+      }
+
+      metadata.producers.push(fields[fieldName.value]);
+    }
+
+    return metadata;
+  }
+
+  function parseGlobalSection(numberOfGlobals) {
+    var globals = [];
+    dump([numberOfGlobals], "num globals");
+
+    for (var i = 0; i < numberOfGlobals; i++) {
+      var _startLoc11 = getPosition();
+
+      var globalType = parseGlobalType();
+      /**
+       * Global expressions
+       */
+
+      var init = [];
+      parseInstructionBlock(init);
+
+      var node = function () {
+        var endLoc = getPosition();
+        return t.withLoc(t.global(globalType, init), endLoc, _startLoc11);
+      }();
+
+      globals.push(node);
+      state.globalsInModule.push(node);
+    }
+
+    return globals;
+  }
+
+  function parseElemSection(numberOfElements) {
+    var elems = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var _startLoc12 = getPosition();
+
+      var tableindexu32 = readU32();
+      var tableindex = tableindexu32.value;
+      eatBytes(tableindexu32.nextIndex);
+      dump([tableindex], "table index");
+      /**
+       * Parse instructions
+       */
+
+      var instr = [];
+      parseInstructionBlock(instr);
+      /**
+       * Parse ( vector function index ) *
+       */
+
+      var indicesu32 = readU32();
+      var indices = indicesu32.value;
+      eatBytes(indicesu32.nextIndex);
+      dump([indices], "num indices");
+      var indexValues = [];
+
+      for (var _i5 = 0; _i5 < indices; _i5++) {
+        var indexu32 = readU32();
+        var index = indexu32.value;
+        eatBytes(indexu32.nextIndex);
+        dump([index], "index");
+        indexValues.push(t.indexLiteral(index));
+      }
+
+      var elemNode = function () {
+        var endLoc = getPosition();
+        return t.withLoc(t.elem(t.indexLiteral(tableindex), instr, indexValues), endLoc, _startLoc12);
+      }();
+
+      elems.push(elemNode);
+    }
+
+    return elems;
+  } // https://webassembly.github.io/spec/core/binary/types.html#memory-types
+
+
+  function parseMemoryType(i) {
+    var limits = parseLimits();
+    return t.memory(limits, t.indexLiteral(i));
+  } // https://webassembly.github.io/spec/binary/modules.html#table-section
+
+
+  function parseTableSection(numberOfElements) {
+    var tables = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var tablesNode = parseTableType(i);
+      state.tablesInModule.push(tablesNode);
+      tables.push(tablesNode);
+    }
+
+    return tables;
+  } // https://webassembly.github.io/spec/binary/modules.html#memory-section
+
+
+  function parseMemorySection(numberOfElements) {
+    var memories = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var memoryNode = parseMemoryType(i);
+      state.memoriesInModule.push(memoryNode);
+      memories.push(memoryNode);
+    }
+
+    return memories;
+  } // https://webassembly.github.io/spec/binary/modules.html#binary-startsec
+
+
+  function parseStartSection() {
+    var startLoc = getPosition();
+    var u32 = readU32();
+    var startFuncIndex = u32.value;
+    eatBytes(u32.nextIndex);
+    dump([startFuncIndex], "index");
+    return function () {
+      var endLoc = getPosition();
+      return t.withLoc(t.start(t.indexLiteral(startFuncIndex)), endLoc, startLoc);
+    }();
+  } // https://webassembly.github.io/spec/binary/modules.html#data-section
+
+
+  function parseDataSection(numberOfElements) {
+    var dataEntries = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var memoryIndexu32 = readU32();
+      var memoryIndex = memoryIndexu32.value;
+      eatBytes(memoryIndexu32.nextIndex);
+      dump([memoryIndex], "memory index");
+      var instrs = [];
+      parseInstructionBlock(instrs);
+      var hasExtraInstrs = instrs.filter(function (i) {
+        return i.id !== "end";
+      }).length !== 1;
+
+      if (hasExtraInstrs) {
+        throw new CompileError("data section offset must be a single instruction");
+      }
+
+      var bytes = parseVec(function (b) {
+        return b;
+      });
+      dump([], "init");
+      dataEntries.push(t.data(t.memIndexLiteral(memoryIndex), instrs[0], t.byteArray(bytes)));
+    }
+
+    return dataEntries;
+  } // https://webassembly.github.io/spec/binary/modules.html#binary-section
+
+
+  function parseSection(sectionIndex) {
+    var sectionId = readByte();
+    eatBytes(1);
+
+    if (sectionId >= sectionIndex || sectionIndex === constants.sections.custom) {
+      sectionIndex = sectionId + 1;
+    } else {
+      if (sectionId !== constants.sections.custom) throw new CompileError("Unexpected section: " + toHex(sectionId));
+    }
+
+    var nextSectionIndex = sectionIndex;
+    var startOffset = offset;
+    var startLoc = getPosition();
+    var u32 = readU32();
+    var sectionSizeInBytes = u32.value;
+    eatBytes(u32.nextIndex);
+
+    var sectionSizeInBytesNode = function () {
+      var endLoc = getPosition();
+      return t.withLoc(t.numberLiteralFromRaw(sectionSizeInBytes), endLoc, startLoc);
+    }();
+
+    switch (sectionId) {
+      case constants.sections.type:
+        {
+          dumpSep("section Type");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc13 = getPosition();
+
+          var _u = readU32();
+
+          var numberOfTypes = _u.value;
+          eatBytes(_u.nextIndex);
+
+          var _metadata = t.sectionMetadata("type", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfTypes), endLoc, _startLoc13);
+          }());
+
+          var _nodes = parseTypeSection(numberOfTypes);
+
+          return {
+            nodes: _nodes,
+            metadata: _metadata,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.table:
+        {
+          dumpSep("section Table");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc14 = getPosition();
+
+          var _u2 = readU32();
+
+          var numberOfTable = _u2.value;
+          eatBytes(_u2.nextIndex);
+          dump([numberOfTable], "num tables");
+
+          var _metadata2 = t.sectionMetadata("table", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfTable), endLoc, _startLoc14);
+          }());
+
+          var _nodes2 = parseTableSection(numberOfTable);
+
+          return {
+            nodes: _nodes2,
+            metadata: _metadata2,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.import:
+        {
+          dumpSep("section Import");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc15 = getPosition();
+
+          var numberOfImportsu32 = readU32();
+          var numberOfImports = numberOfImportsu32.value;
+          eatBytes(numberOfImportsu32.nextIndex);
+          dump([numberOfImports], "number of imports");
+
+          var _metadata3 = t.sectionMetadata("import", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfImports), endLoc, _startLoc15);
+          }());
+
+          var _nodes3 = parseImportSection(numberOfImports);
+
+          return {
+            nodes: _nodes3,
+            metadata: _metadata3,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.func:
+        {
+          dumpSep("section Function");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc16 = getPosition();
+
+          var numberOfFunctionsu32 = readU32();
+          var numberOfFunctions = numberOfFunctionsu32.value;
+          eatBytes(numberOfFunctionsu32.nextIndex);
+
+          var _metadata4 = t.sectionMetadata("func", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfFunctions), endLoc, _startLoc16);
+          }());
+
+          parseFuncSection(numberOfFunctions);
+          var _nodes4 = [];
+          return {
+            nodes: _nodes4,
+            metadata: _metadata4,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.export:
+        {
+          dumpSep("section Export");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc17 = getPosition();
+
+          var _u3 = readU32();
+
+          var numberOfExport = _u3.value;
+          eatBytes(_u3.nextIndex);
+
+          var _metadata5 = t.sectionMetadata("export", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfExport), endLoc, _startLoc17);
+          }());
+
+          parseExportSection(numberOfExport);
+          var _nodes5 = [];
+          return {
+            nodes: _nodes5,
+            metadata: _metadata5,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.code:
+        {
+          dumpSep("section Code");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc18 = getPosition();
+
+          var _u4 = readU32();
+
+          var numberOfFuncs = _u4.value;
+          eatBytes(_u4.nextIndex);
+
+          var _metadata6 = t.sectionMetadata("code", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfFuncs), endLoc, _startLoc18);
+          }());
+
+          if (opts.ignoreCodeSection === true) {
+            var remainingBytes = sectionSizeInBytes - _u4.nextIndex;
+            eatBytes(remainingBytes); // eat the entire section
+          } else {
+            parseCodeSection(numberOfFuncs);
+          }
+
+          var _nodes6 = [];
+          return {
+            nodes: _nodes6,
+            metadata: _metadata6,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.start:
+        {
+          dumpSep("section Start");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _metadata7 = t.sectionMetadata("start", startOffset, sectionSizeInBytesNode);
+
+          var _nodes7 = [parseStartSection()];
+          return {
+            nodes: _nodes7,
+            metadata: _metadata7,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.element:
+        {
+          dumpSep("section Element");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc19 = getPosition();
+
+          var numberOfElementsu32 = readU32();
+          var numberOfElements = numberOfElementsu32.value;
+          eatBytes(numberOfElementsu32.nextIndex);
+
+          var _metadata8 = t.sectionMetadata("element", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfElements), endLoc, _startLoc19);
+          }());
+
+          var _nodes8 = parseElemSection(numberOfElements);
+
+          return {
+            nodes: _nodes8,
+            metadata: _metadata8,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.global:
+        {
+          dumpSep("section Global");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc20 = getPosition();
+
+          var numberOfGlobalsu32 = readU32();
+          var numberOfGlobals = numberOfGlobalsu32.value;
+          eatBytes(numberOfGlobalsu32.nextIndex);
+
+          var _metadata9 = t.sectionMetadata("global", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfGlobals), endLoc, _startLoc20);
+          }());
+
+          var _nodes9 = parseGlobalSection(numberOfGlobals);
+
+          return {
+            nodes: _nodes9,
+            metadata: _metadata9,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.memory:
+        {
+          dumpSep("section Memory");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc21 = getPosition();
+
+          var _numberOfElementsu = readU32();
+
+          var _numberOfElements = _numberOfElementsu.value;
+          eatBytes(_numberOfElementsu.nextIndex);
+
+          var _metadata10 = t.sectionMetadata("memory", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(_numberOfElements), endLoc, _startLoc21);
+          }());
+
+          var _nodes10 = parseMemorySection(_numberOfElements);
+
+          return {
+            nodes: _nodes10,
+            metadata: _metadata10,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case constants.sections.data:
+        {
+          dumpSep("section Data");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _metadata11 = t.sectionMetadata("data", startOffset, sectionSizeInBytesNode);
+
+          var _startLoc22 = getPosition();
+
+          var _numberOfElementsu2 = readU32();
+
+          var _numberOfElements2 = _numberOfElementsu2.value;
+          eatBytes(_numberOfElementsu2.nextIndex);
+
+          _metadata11.vectorOfSize = function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(_numberOfElements2), endLoc, _startLoc22);
+          }();
+
+          if (opts.ignoreDataSection === true) {
+            var _remainingBytes = sectionSizeInBytes - _numberOfElementsu2.nextIndex;
+
+            eatBytes(_remainingBytes); // eat the entire section
+
+            dumpSep("ignore data (" + sectionSizeInBytes + " bytes)");
+            return {
+              nodes: [],
+              metadata: _metadata11,
+              nextSectionIndex: nextSectionIndex
+            };
+          } else {
+            var _nodes11 = parseDataSection(_numberOfElements2);
+
+            return {
+              nodes: _nodes11,
+              metadata: _metadata11,
+              nextSectionIndex: nextSectionIndex
+            };
+          }
+        }
+
+      case constants.sections.custom:
+        {
+          dumpSep("section Custom");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+          var _metadata12 = [t.sectionMetadata("custom", startOffset, sectionSizeInBytesNode)];
+          var sectionName = readUTF8String();
+          eatBytes(sectionName.nextIndex);
+          dump([], "section name (".concat(sectionName.value, ")"));
+
+          var _remainingBytes2 = sectionSizeInBytes - sectionName.nextIndex;
+
+          if (sectionName.value === "name") {
+            var initialOffset = offset;
+
+            try {
+              _metadata12.push.apply(_metadata12, _toConsumableArray(parseNameSection(_remainingBytes2)));
+            } catch (e) {
+              console.warn("Failed to decode custom \"name\" section @".concat(offset, "; ignoring (").concat(e.message, ")."));
+              eatBytes(offset - (initialOffset + _remainingBytes2));
+            }
+          } else if (sectionName.value === "producers") {
+            var _initialOffset = offset;
+
+            try {
+              _metadata12.push(parseProducersSection());
+            } catch (e) {
+              console.warn("Failed to decode custom \"producers\" section @".concat(offset, "; ignoring (").concat(e.message, ")."));
+              eatBytes(offset - (_initialOffset + _remainingBytes2));
+            }
+          } else {
+            // We don't parse the custom section
+            eatBytes(_remainingBytes2);
+            dumpSep("ignore custom " + JSON.stringify(sectionName.value) + " section (" + _remainingBytes2 + " bytes)");
+          }
+
+          return {
+            nodes: [],
+            metadata: _metadata12,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+    }
+
+    throw new CompileError("Unexpected section: " + toHex(sectionId));
+  }
+
+  parseModuleHeader();
+  parseVersion();
+  var moduleFields = [];
+  var sectionIndex = 0;
+  var moduleMetadata = {
+    sections: [],
+    functionNames: [],
+    localNames: [],
+    producers: []
+  };
+  /**
+   * All the generate declaration are going to be stored in our state
+   */
+
+  while (offset < buf.length) {
+    var _parseSection = parseSection(sectionIndex),
+        _nodes12 = _parseSection.nodes,
+        _metadata13 = _parseSection.metadata,
+        nextSectionIndex = _parseSection.nextSectionIndex;
+
+    moduleFields.push.apply(moduleFields, _toConsumableArray(_nodes12));
+    var metadataArray = Array.isArray(_metadata13) ? _metadata13 : [_metadata13];
+    metadataArray.forEach(function (metadataItem) {
+      if (metadataItem.type === "FunctionNameMetadata") {
+        moduleMetadata.functionNames.push(metadataItem);
+      } else if (metadataItem.type === "LocalNameMetadata") {
+        moduleMetadata.localNames.push(metadataItem);
+      } else if (metadataItem.type === "ProducersSectionMetadata") {
+        moduleMetadata.producers.push(metadataItem);
+      } else {
+        moduleMetadata.sections.push(metadataItem);
+      }
+    }); // Ignore custom section
+
+    if (nextSectionIndex) {
+      sectionIndex = nextSectionIndex;
+    }
+  }
+  /**
+   * Transform the state into AST nodes
+   */
+
+
+  var funcIndex = 0;
+  state.functionsInModule.forEach(function (func) {
+    var params = func.signature.params;
+    var result = func.signature.result;
+    var body = []; // External functions doesn't provide any code, can skip it here
+
+    if (func.isExternal === true) {
+      return;
+    }
+
+    var decodedElementInCodeSection = state.elementsInCodeSection[funcIndex];
+
+    if (opts.ignoreCodeSection === false) {
+      if (typeof decodedElementInCodeSection === "undefined") {
+        throw new CompileError("func " + toHex(funcIndex) + " code not found");
+      }
+
+      body = decodedElementInCodeSection.code;
+    }
+
+    funcIndex++;
+    var funcNode = t.func(func.id, t.signature(params, result), body);
+
+    if (func.isExternal === true) {
+      funcNode.isExternal = func.isExternal;
+    } // Add function position in the binary if possible
+
+
+    if (opts.ignoreCodeSection === false) {
+      var _startLoc23 = decodedElementInCodeSection.startLoc,
+          endLoc = decodedElementInCodeSection.endLoc,
+          bodySize = decodedElementInCodeSection.bodySize;
+      funcNode = t.withLoc(funcNode, endLoc, _startLoc23);
+      funcNode.metadata = {
+        bodySize: bodySize
+      };
+    }
+
+    moduleFields.push(funcNode);
+  });
+  state.elementsInExportSection.forEach(function (moduleExport) {
+    /**
+     * If the export has no id, we won't be able to call it from the outside
+     * so we can omit it
+     */
+    if (moduleExport.id != null) {
+      moduleFields.push(t.withLoc(t.moduleExport(moduleExport.name, t.moduleExportDescr(moduleExport.type, moduleExport.id)), moduleExport.endLoc, moduleExport.startLoc));
+    }
+  });
+  dumpSep("end of program");
+  var module = t.module(null, moduleFields, t.moduleMetadata(moduleMetadata.sections, moduleMetadata.functionNames, moduleMetadata.localNames, moduleMetadata.producers));
+  return t.program([module]);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/index.js
new file mode 100644
index 0000000..a5844d6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/index.js
@@ -0,0 +1,247 @@
+import * as decoder from "./decoder";
+import * as t from "@webassemblyjs/ast";
+/**
+ * TODO(sven): I added initial props, but we should rather fix
+ * https://github.com/xtuc/webassemblyjs/issues/405
+ */
+
+var defaultDecoderOpts = {
+  dump: false,
+  ignoreCodeSection: false,
+  ignoreDataSection: false,
+  ignoreCustomNameSection: false
+}; // traverses the AST, locating function name metadata, which is then
+// used to update index-based identifiers with function names
+
+function restoreFunctionNames(ast) {
+  var functionNames = [];
+  t.traverse(ast, {
+    FunctionNameMetadata: function FunctionNameMetadata(_ref) {
+      var node = _ref.node;
+      functionNames.push({
+        name: node.value,
+        index: node.index
+      });
+    }
+  });
+
+  if (functionNames.length === 0) {
+    return;
+  }
+
+  t.traverse(ast, {
+    Func: function (_Func) {
+      function Func(_x) {
+        return _Func.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func.toString();
+      };
+
+      return Func;
+    }(function (_ref2) {
+      var node = _ref2.node;
+      // $FlowIgnore
+      var nodeName = node.name;
+      var indexBasedFunctionName = nodeName.value;
+      var index = Number(indexBasedFunctionName.replace("func_", ""));
+      var functionName = functionNames.find(function (f) {
+        return f.index === index;
+      });
+
+      if (functionName) {
+        var oldValue = nodeName.value;
+        nodeName.value = functionName.name;
+        nodeName.numeric = oldValue; // $FlowIgnore
+
+        delete nodeName.raw;
+      }
+    }),
+    // Also update the reference in the export
+    ModuleExport: function (_ModuleExport) {
+      function ModuleExport(_x2) {
+        return _ModuleExport.apply(this, arguments);
+      }
+
+      ModuleExport.toString = function () {
+        return _ModuleExport.toString();
+      };
+
+      return ModuleExport;
+    }(function (_ref3) {
+      var node = _ref3.node;
+
+      if (node.descr.exportType === "Func") {
+        // $FlowIgnore
+        var nodeName = node.descr.id;
+        var index = nodeName.value;
+        var functionName = functionNames.find(function (f) {
+          return f.index === index;
+        });
+
+        if (functionName) {
+          node.descr.id = t.identifier(functionName.name);
+        }
+      }
+    }),
+    ModuleImport: function (_ModuleImport) {
+      function ModuleImport(_x3) {
+        return _ModuleImport.apply(this, arguments);
+      }
+
+      ModuleImport.toString = function () {
+        return _ModuleImport.toString();
+      };
+
+      return ModuleImport;
+    }(function (_ref4) {
+      var node = _ref4.node;
+
+      if (node.descr.type === "FuncImportDescr") {
+        // $FlowIgnore
+        var indexBasedFunctionName = node.descr.id;
+        var index = Number(indexBasedFunctionName.replace("func_", ""));
+        var functionName = functionNames.find(function (f) {
+          return f.index === index;
+        });
+
+        if (functionName) {
+          // $FlowIgnore
+          node.descr.id = t.identifier(functionName.name);
+        }
+      }
+    }),
+    CallInstruction: function (_CallInstruction) {
+      function CallInstruction(_x4) {
+        return _CallInstruction.apply(this, arguments);
+      }
+
+      CallInstruction.toString = function () {
+        return _CallInstruction.toString();
+      };
+
+      return CallInstruction;
+    }(function (nodePath) {
+      var node = nodePath.node;
+      var index = node.index.value;
+      var functionName = functionNames.find(function (f) {
+        return f.index === index;
+      });
+
+      if (functionName) {
+        var oldValue = node.index;
+        node.index = t.identifier(functionName.name);
+        node.numeric = oldValue; // $FlowIgnore
+
+        delete node.raw;
+      }
+    })
+  });
+}
+
+function restoreLocalNames(ast) {
+  var localNames = [];
+  t.traverse(ast, {
+    LocalNameMetadata: function LocalNameMetadata(_ref5) {
+      var node = _ref5.node;
+      localNames.push({
+        name: node.value,
+        localIndex: node.localIndex,
+        functionIndex: node.functionIndex
+      });
+    }
+  });
+
+  if (localNames.length === 0) {
+    return;
+  }
+
+  t.traverse(ast, {
+    Func: function (_Func2) {
+      function Func(_x5) {
+        return _Func2.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func2.toString();
+      };
+
+      return Func;
+    }(function (_ref6) {
+      var node = _ref6.node;
+      var signature = node.signature;
+
+      if (signature.type !== "Signature") {
+        return;
+      } // $FlowIgnore
+
+
+      var nodeName = node.name;
+      var indexBasedFunctionName = nodeName.value;
+      var functionIndex = Number(indexBasedFunctionName.replace("func_", ""));
+      signature.params.forEach(function (param, paramIndex) {
+        var paramName = localNames.find(function (f) {
+          return f.localIndex === paramIndex && f.functionIndex === functionIndex;
+        });
+
+        if (paramName && paramName.name !== "") {
+          param.id = paramName.name;
+        }
+      });
+    })
+  });
+}
+
+function restoreModuleName(ast) {
+  t.traverse(ast, {
+    ModuleNameMetadata: function (_ModuleNameMetadata) {
+      function ModuleNameMetadata(_x6) {
+        return _ModuleNameMetadata.apply(this, arguments);
+      }
+
+      ModuleNameMetadata.toString = function () {
+        return _ModuleNameMetadata.toString();
+      };
+
+      return ModuleNameMetadata;
+    }(function (moduleNameMetadataPath) {
+      // update module
+      t.traverse(ast, {
+        Module: function (_Module) {
+          function Module(_x7) {
+            return _Module.apply(this, arguments);
+          }
+
+          Module.toString = function () {
+            return _Module.toString();
+          };
+
+          return Module;
+        }(function (_ref7) {
+          var node = _ref7.node;
+          var name = moduleNameMetadataPath.node.value; // compatiblity with wast-parser
+
+          if (name === "") {
+            name = null;
+          }
+
+          node.id = name;
+        })
+      });
+    })
+  });
+}
+
+export function decode(buf, customOpts) {
+  var opts = Object.assign({}, defaultDecoderOpts, customOpts);
+  var ast = decoder.decode(buf, opts);
+
+  if (opts.ignoreCustomNameSection === false) {
+    restoreFunctionNames(ast);
+    restoreLocalNames(ast);
+    restoreModuleName(ast);
+  }
+
+  return ast;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/types/decoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/esm/types/decoder.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/decoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/decoder.js
new file mode 100644
index 0000000..2a8770f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/decoder.js
@@ -0,0 +1,1792 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.decode = decode;
+
+var _helperApiError = require("@webassemblyjs/helper-api-error");
+
+var ieee754 = _interopRequireWildcard(require("@webassemblyjs/ieee754"));
+
+var utf8 = _interopRequireWildcard(require("@webassemblyjs/utf8"));
+
+var t = _interopRequireWildcard(require("@webassemblyjs/ast"));
+
+var _leb = require("@webassemblyjs/leb128");
+
+var _helperWasmBytecode = _interopRequireDefault(require("@webassemblyjs/helper-wasm-bytecode"));
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+function toHex(n) {
+  return "0x" + Number(n).toString(16);
+}
+
+function byteArrayEq(l, r) {
+  if (l.length !== r.length) {
+    return false;
+  }
+
+  for (var i = 0; i < l.length; i++) {
+    if (l[i] !== r[i]) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+function decode(ab, opts) {
+  var buf = new Uint8Array(ab);
+  var getUniqueName = t.getUniqueNameGenerator();
+  var offset = 0;
+
+  function getPosition() {
+    return {
+      line: -1,
+      column: offset
+    };
+  }
+
+  function dump(b, msg) {
+    if (opts.dump === false) return;
+    var pad = "\t\t\t\t\t\t\t\t\t\t";
+    var str = "";
+
+    if (b.length < 5) {
+      str = b.map(toHex).join(" ");
+    } else {
+      str = "...";
+    }
+
+    console.log(toHex(offset) + ":\t", str, pad, ";", msg);
+  }
+
+  function dumpSep(msg) {
+    if (opts.dump === false) return;
+    console.log(";", msg);
+  }
+  /**
+   * TODO(sven): we can atually use a same structure
+   * we are adding incrementally new features
+   */
+
+
+  var state = {
+    elementsInFuncSection: [],
+    elementsInExportSection: [],
+    elementsInCodeSection: [],
+
+    /**
+     * Decode memory from:
+     * - Memory section
+     */
+    memoriesInModule: [],
+
+    /**
+     * Decoded types from:
+     * - Type section
+     */
+    typesInModule: [],
+
+    /**
+     * Decoded functions from:
+     * - Function section
+     * - Import section
+     */
+    functionsInModule: [],
+
+    /**
+     * Decoded tables from:
+     * - Table section
+     */
+    tablesInModule: [],
+
+    /**
+     * Decoded globals from:
+     * - Global section
+     */
+    globalsInModule: []
+  };
+
+  function isEOF() {
+    return offset >= buf.length;
+  }
+
+  function eatBytes(n) {
+    offset = offset + n;
+  }
+
+  function readBytesAtOffset(_offset, numberOfBytes) {
+    var arr = [];
+
+    for (var i = 0; i < numberOfBytes; i++) {
+      arr.push(buf[_offset + i]);
+    }
+
+    return arr;
+  }
+
+  function readBytes(numberOfBytes) {
+    return readBytesAtOffset(offset, numberOfBytes);
+  }
+
+  function readF64() {
+    var bytes = readBytes(ieee754.NUMBER_OF_BYTE_F64);
+    var value = ieee754.decodeF64(bytes);
+
+    if (Math.sign(value) * value === Infinity) {
+      return {
+        value: Math.sign(value),
+        inf: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F64
+      };
+    }
+
+    if (isNaN(value)) {
+      var sign = bytes[bytes.length - 1] >> 7 ? -1 : 1;
+      var mantissa = 0;
+
+      for (var i = 0; i < bytes.length - 2; ++i) {
+        mantissa += bytes[i] * Math.pow(256, i);
+      }
+
+      mantissa += bytes[bytes.length - 2] % 16 * Math.pow(256, bytes.length - 2);
+      return {
+        value: sign * mantissa,
+        nan: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F64
+      };
+    }
+
+    return {
+      value: value,
+      nextIndex: ieee754.NUMBER_OF_BYTE_F64
+    };
+  }
+
+  function readF32() {
+    var bytes = readBytes(ieee754.NUMBER_OF_BYTE_F32);
+    var value = ieee754.decodeF32(bytes);
+
+    if (Math.sign(value) * value === Infinity) {
+      return {
+        value: Math.sign(value),
+        inf: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F32
+      };
+    }
+
+    if (isNaN(value)) {
+      var sign = bytes[bytes.length - 1] >> 7 ? -1 : 1;
+      var mantissa = 0;
+
+      for (var i = 0; i < bytes.length - 2; ++i) {
+        mantissa += bytes[i] * Math.pow(256, i);
+      }
+
+      mantissa += bytes[bytes.length - 2] % 128 * Math.pow(256, bytes.length - 2);
+      return {
+        value: sign * mantissa,
+        nan: true,
+        nextIndex: ieee754.NUMBER_OF_BYTE_F32
+      };
+    }
+
+    return {
+      value: value,
+      nextIndex: ieee754.NUMBER_OF_BYTE_F32
+    };
+  }
+
+  function readUTF8String() {
+    var lenu32 = readU32(); // Don't eat any bytes. Instead, peek ahead of the current offset using
+    // readBytesAtOffset below. This keeps readUTF8String neutral with respect
+    // to the current offset, just like the other readX functions.
+
+    var strlen = lenu32.value;
+    dump([strlen], "string length");
+    var bytes = readBytesAtOffset(offset + lenu32.nextIndex, strlen);
+    var value = utf8.decode(bytes);
+    return {
+      value: value,
+      nextIndex: strlen + lenu32.nextIndex
+    };
+  }
+  /**
+   * Decode an unsigned 32bits integer
+   *
+   * The length will be handled by the leb librairy, we pass the max number of
+   * byte.
+   */
+
+
+  function readU32() {
+    var bytes = readBytes(_leb.MAX_NUMBER_OF_BYTE_U32);
+    var buffer = Buffer.from(bytes);
+    return (0, _leb.decodeUInt32)(buffer);
+  }
+
+  function readVaruint32() {
+    // where 32 bits = max 4 bytes
+    var bytes = readBytes(4);
+    var buffer = Buffer.from(bytes);
+    return (0, _leb.decodeUInt32)(buffer);
+  }
+
+  function readVaruint7() {
+    // where 7 bits = max 1 bytes
+    var bytes = readBytes(1);
+    var buffer = Buffer.from(bytes);
+    return (0, _leb.decodeUInt32)(buffer);
+  }
+  /**
+   * Decode a signed 32bits interger
+   */
+
+
+  function read32() {
+    var bytes = readBytes(_leb.MAX_NUMBER_OF_BYTE_U32);
+    var buffer = Buffer.from(bytes);
+    return (0, _leb.decodeInt32)(buffer);
+  }
+  /**
+   * Decode a signed 64bits integer
+   */
+
+
+  function read64() {
+    var bytes = readBytes(_leb.MAX_NUMBER_OF_BYTE_U64);
+    var buffer = Buffer.from(bytes);
+    return (0, _leb.decodeInt64)(buffer);
+  }
+
+  function readU64() {
+    var bytes = readBytes(_leb.MAX_NUMBER_OF_BYTE_U64);
+    var buffer = Buffer.from(bytes);
+    return (0, _leb.decodeUInt64)(buffer);
+  }
+
+  function readByte() {
+    return readBytes(1)[0];
+  }
+
+  function parseModuleHeader() {
+    if (isEOF() === true || offset + 4 > buf.length) {
+      throw new Error("unexpected end");
+    }
+
+    var header = readBytes(4);
+
+    if (byteArrayEq(_helperWasmBytecode.default.magicModuleHeader, header) === false) {
+      throw new _helperApiError.CompileError("magic header not detected");
+    }
+
+    dump(header, "wasm magic header");
+    eatBytes(4);
+  }
+
+  function parseVersion() {
+    if (isEOF() === true || offset + 4 > buf.length) {
+      throw new Error("unexpected end");
+    }
+
+    var version = readBytes(4);
+
+    if (byteArrayEq(_helperWasmBytecode.default.moduleVersion, version) === false) {
+      throw new _helperApiError.CompileError("unknown binary version");
+    }
+
+    dump(version, "wasm version");
+    eatBytes(4);
+  }
+
+  function parseVec(cast) {
+    var u32 = readU32();
+    var length = u32.value;
+    eatBytes(u32.nextIndex);
+    dump([length], "number");
+
+    if (length === 0) {
+      return [];
+    }
+
+    var elements = [];
+
+    for (var i = 0; i < length; i++) {
+      var byte = readByte();
+      eatBytes(1);
+      var value = cast(byte);
+      dump([byte], value);
+
+      if (typeof value === "undefined") {
+        throw new _helperApiError.CompileError("Internal failure: parseVec could not cast the value");
+      }
+
+      elements.push(value);
+    }
+
+    return elements;
+  } // Type section
+  // https://webassembly.github.io/spec/binary/modules.html#binary-typesec
+
+
+  function parseTypeSection(numberOfTypes) {
+    var typeInstructionNodes = [];
+    dump([numberOfTypes], "num types");
+
+    for (var i = 0; i < numberOfTypes; i++) {
+      var _startLoc = getPosition();
+
+      dumpSep("type " + i);
+      var type = readByte();
+      eatBytes(1);
+
+      if (type == _helperWasmBytecode.default.types.func) {
+        dump([type], "func");
+        var paramValtypes = parseVec(function (b) {
+          return _helperWasmBytecode.default.valtypes[b];
+        });
+        var params = paramValtypes.map(function (v) {
+          return t.funcParam(
+          /*valtype*/
+          v);
+        });
+        var result = parseVec(function (b) {
+          return _helperWasmBytecode.default.valtypes[b];
+        });
+        typeInstructionNodes.push(function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.typeInstruction(undefined, t.signature(params, result)), endLoc, _startLoc);
+        }());
+        state.typesInModule.push({
+          params: params,
+          result: result
+        });
+      } else {
+        throw new Error("Unsupported type: " + toHex(type));
+      }
+    }
+
+    return typeInstructionNodes;
+  } // Import section
+  // https://webassembly.github.io/spec/binary/modules.html#binary-importsec
+
+
+  function parseImportSection(numberOfImports) {
+    var imports = [];
+
+    for (var i = 0; i < numberOfImports; i++) {
+      dumpSep("import header " + i);
+
+      var _startLoc2 = getPosition();
+      /**
+       * Module name
+       */
+
+
+      var moduleName = readUTF8String();
+      eatBytes(moduleName.nextIndex);
+      dump([], "module name (".concat(moduleName.value, ")"));
+      /**
+       * Name
+       */
+
+      var name = readUTF8String();
+      eatBytes(name.nextIndex);
+      dump([], "name (".concat(name.value, ")"));
+      /**
+       * Import descr
+       */
+
+      var descrTypeByte = readByte();
+      eatBytes(1);
+      var descrType = _helperWasmBytecode.default.importTypes[descrTypeByte];
+      dump([descrTypeByte], "import kind");
+
+      if (typeof descrType === "undefined") {
+        throw new _helperApiError.CompileError("Unknown import description type: " + toHex(descrTypeByte));
+      }
+
+      var importDescr = void 0;
+
+      if (descrType === "func") {
+        var indexU32 = readU32();
+        var typeindex = indexU32.value;
+        eatBytes(indexU32.nextIndex);
+        dump([typeindex], "type index");
+        var signature = state.typesInModule[typeindex];
+
+        if (typeof signature === "undefined") {
+          throw new _helperApiError.CompileError("function signature not found (".concat(typeindex, ")"));
+        }
+
+        var id = getUniqueName("func");
+        importDescr = t.funcImportDescr(id, t.signature(signature.params, signature.result));
+        state.functionsInModule.push({
+          id: t.identifier(name.value),
+          signature: signature,
+          isExternal: true
+        });
+      } else if (descrType === "global") {
+        importDescr = parseGlobalType();
+        var globalNode = t.global(importDescr, []);
+        state.globalsInModule.push(globalNode);
+      } else if (descrType === "table") {
+        importDescr = parseTableType(i);
+      } else if (descrType === "mem") {
+        var memoryNode = parseMemoryType(0);
+        state.memoriesInModule.push(memoryNode);
+        importDescr = memoryNode;
+      } else {
+        throw new _helperApiError.CompileError("Unsupported import of type: " + descrType);
+      }
+
+      imports.push(function () {
+        var endLoc = getPosition();
+        return t.withLoc(t.moduleImport(moduleName.value, name.value, importDescr), endLoc, _startLoc2);
+      }());
+    }
+
+    return imports;
+  } // Function section
+  // https://webassembly.github.io/spec/binary/modules.html#function-section
+
+
+  function parseFuncSection(numberOfFunctions) {
+    dump([numberOfFunctions], "num funcs");
+
+    for (var i = 0; i < numberOfFunctions; i++) {
+      var indexU32 = readU32();
+      var typeindex = indexU32.value;
+      eatBytes(indexU32.nextIndex);
+      dump([typeindex], "type index");
+      var signature = state.typesInModule[typeindex];
+
+      if (typeof signature === "undefined") {
+        throw new _helperApiError.CompileError("function signature not found (".concat(typeindex, ")"));
+      } // preserve anonymous, a name might be resolved later
+
+
+      var id = t.withRaw(t.identifier(getUniqueName("func")), "");
+      state.functionsInModule.push({
+        id: id,
+        signature: signature,
+        isExternal: false
+      });
+    }
+  } // Export section
+  // https://webassembly.github.io/spec/binary/modules.html#export-section
+
+
+  function parseExportSection(numberOfExport) {
+    dump([numberOfExport], "num exports"); // Parse vector of exports
+
+    for (var i = 0; i < numberOfExport; i++) {
+      var _startLoc3 = getPosition();
+      /**
+       * Name
+       */
+
+
+      var name = readUTF8String();
+      eatBytes(name.nextIndex);
+      dump([], "export name (".concat(name.value, ")"));
+      /**
+       * exportdescr
+       */
+
+      var typeIndex = readByte();
+      eatBytes(1);
+      dump([typeIndex], "export kind");
+      var indexu32 = readU32();
+      var index = indexu32.value;
+      eatBytes(indexu32.nextIndex);
+      dump([index], "export index");
+      var id = void 0,
+          signature = void 0;
+
+      if (_helperWasmBytecode.default.exportTypes[typeIndex] === "Func") {
+        var func = state.functionsInModule[index];
+
+        if (typeof func === "undefined") {
+          throw new _helperApiError.CompileError("unknown function (".concat(index, ")"));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = func.signature;
+      } else if (_helperWasmBytecode.default.exportTypes[typeIndex] === "Table") {
+        var table = state.tablesInModule[index];
+
+        if (typeof table === "undefined") {
+          throw new _helperApiError.CompileError("unknown table ".concat(index));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = null;
+      } else if (_helperWasmBytecode.default.exportTypes[typeIndex] === "Mem") {
+        var memNode = state.memoriesInModule[index];
+
+        if (typeof memNode === "undefined") {
+          throw new _helperApiError.CompileError("unknown memory ".concat(index));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = null;
+      } else if (_helperWasmBytecode.default.exportTypes[typeIndex] === "Global") {
+        var global = state.globalsInModule[index];
+
+        if (typeof global === "undefined") {
+          throw new _helperApiError.CompileError("unknown global ".concat(index));
+        }
+
+        id = t.numberLiteralFromRaw(index, String(index));
+        signature = null;
+      } else {
+        console.warn("Unsupported export type: " + toHex(typeIndex));
+        return;
+      }
+
+      var endLoc = getPosition();
+      state.elementsInExportSection.push({
+        name: name.value,
+        type: _helperWasmBytecode.default.exportTypes[typeIndex],
+        signature: signature,
+        id: id,
+        index: index,
+        endLoc: endLoc,
+        startLoc: _startLoc3
+      });
+    }
+  } // Code section
+  // https://webassembly.github.io/spec/binary/modules.html#code-section
+
+
+  function parseCodeSection(numberOfFuncs) {
+    dump([numberOfFuncs], "number functions"); // Parse vector of function
+
+    for (var i = 0; i < numberOfFuncs; i++) {
+      var _startLoc4 = getPosition();
+
+      dumpSep("function body " + i); // the u32 size of the function code in bytes
+      // Ignore it for now
+
+      var bodySizeU32 = readU32();
+      eatBytes(bodySizeU32.nextIndex);
+      dump([bodySizeU32.value], "function body size");
+      var code = [];
+      /**
+       * Parse locals
+       */
+
+      var funcLocalNumU32 = readU32();
+      var funcLocalNum = funcLocalNumU32.value;
+      eatBytes(funcLocalNumU32.nextIndex);
+      dump([funcLocalNum], "num locals");
+      var locals = [];
+
+      for (var _i = 0; _i < funcLocalNum; _i++) {
+        var _startLoc5 = getPosition();
+
+        var localCountU32 = readU32();
+        var localCount = localCountU32.value;
+        eatBytes(localCountU32.nextIndex);
+        dump([localCount], "num local");
+        var valtypeByte = readByte();
+        eatBytes(1);
+        var type = _helperWasmBytecode.default.valtypes[valtypeByte];
+        var args = [];
+
+        for (var _i2 = 0; _i2 < localCount; _i2++) {
+          args.push(t.valtypeLiteral(type));
+        }
+
+        var localNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.instruction("local", args), endLoc, _startLoc5);
+        }();
+
+        locals.push(localNode);
+        dump([valtypeByte], type);
+
+        if (typeof type === "undefined") {
+          throw new _helperApiError.CompileError("Unexpected valtype: " + toHex(valtypeByte));
+        }
+      }
+
+      code.push.apply(code, locals); // Decode instructions until the end
+
+      parseInstructionBlock(code);
+      var endLoc = getPosition();
+      state.elementsInCodeSection.push({
+        code: code,
+        locals: locals,
+        endLoc: endLoc,
+        startLoc: _startLoc4,
+        bodySize: bodySizeU32.value
+      });
+    }
+  }
+
+  function parseInstructionBlock(code) {
+    while (true) {
+      var _startLoc6 = getPosition();
+
+      var instructionAlreadyCreated = false;
+      var instructionByte = readByte();
+      eatBytes(1);
+
+      if (instructionByte === 0xfe) {
+        instructionByte = 0xfe00 + readByte();
+        eatBytes(1);
+      }
+
+      var instruction = _helperWasmBytecode.default.symbolsByByte[instructionByte];
+
+      if (typeof instruction === "undefined") {
+        throw new _helperApiError.CompileError("Unexpected instruction: " + toHex(instructionByte));
+      }
+
+      if (typeof instruction.object === "string") {
+        dump([instructionByte], "".concat(instruction.object, ".").concat(instruction.name));
+      } else {
+        dump([instructionByte], instruction.name);
+      }
+      /**
+       * End of the function
+       */
+
+
+      if (instruction.name === "end") {
+        var node = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.instruction(instruction.name), endLoc, _startLoc6);
+        }();
+
+        code.push(node);
+        break;
+      }
+
+      var args = [];
+
+      if (instruction.name === "loop") {
+        var _startLoc7 = getPosition();
+
+        var blocktypeByte = readByte();
+        eatBytes(1);
+        var blocktype = _helperWasmBytecode.default.blockTypes[blocktypeByte];
+        dump([blocktypeByte], "blocktype");
+
+        if (typeof blocktype === "undefined") {
+          throw new _helperApiError.CompileError("Unexpected blocktype: " + toHex(blocktypeByte));
+        }
+
+        var instr = [];
+        parseInstructionBlock(instr); // preserve anonymous
+
+        var label = t.withRaw(t.identifier(getUniqueName("loop")), "");
+
+        var loopNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.loopInstruction(label, blocktype, instr), endLoc, _startLoc7);
+        }();
+
+        code.push(loopNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "if") {
+        var _startLoc8 = getPosition();
+
+        var _blocktypeByte = readByte();
+
+        eatBytes(1);
+        var _blocktype = _helperWasmBytecode.default.blockTypes[_blocktypeByte];
+        dump([_blocktypeByte], "blocktype");
+
+        if (typeof _blocktype === "undefined") {
+          throw new _helperApiError.CompileError("Unexpected blocktype: " + toHex(_blocktypeByte));
+        }
+
+        var testIndex = t.withRaw(t.identifier(getUniqueName("if")), "");
+        var ifBody = [];
+        parseInstructionBlock(ifBody); // Defaults to no alternate
+
+        var elseIndex = 0;
+
+        for (elseIndex = 0; elseIndex < ifBody.length; ++elseIndex) {
+          var _instr = ifBody[elseIndex];
+
+          if (_instr.type === "Instr" && _instr.id === "else") {
+            break;
+          }
+        }
+
+        var consequentInstr = ifBody.slice(0, elseIndex);
+        var alternate = ifBody.slice(elseIndex + 1); // wast sugar
+
+        var testInstrs = [];
+
+        var ifNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.ifInstruction(testIndex, testInstrs, _blocktype, consequentInstr, alternate), endLoc, _startLoc8);
+        }();
+
+        code.push(ifNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "block") {
+        var _startLoc9 = getPosition();
+
+        var _blocktypeByte2 = readByte();
+
+        eatBytes(1);
+        var _blocktype2 = _helperWasmBytecode.default.blockTypes[_blocktypeByte2];
+        dump([_blocktypeByte2], "blocktype");
+
+        if (typeof _blocktype2 === "undefined") {
+          throw new _helperApiError.CompileError("Unexpected blocktype: " + toHex(_blocktypeByte2));
+        }
+
+        var _instr2 = [];
+        parseInstructionBlock(_instr2); // preserve anonymous
+
+        var _label = t.withRaw(t.identifier(getUniqueName("block")), "");
+
+        var blockNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.blockInstruction(_label, _instr2, _blocktype2), endLoc, _startLoc9);
+        }();
+
+        code.push(blockNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "call") {
+        var indexu32 = readU32();
+        var index = indexu32.value;
+        eatBytes(indexu32.nextIndex);
+        dump([index], "index");
+
+        var callNode = function () {
+          var endLoc = getPosition();
+          return t.withLoc(t.callInstruction(t.indexLiteral(index)), endLoc, _startLoc6);
+        }();
+
+        code.push(callNode);
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "call_indirect") {
+        var _startLoc10 = getPosition();
+
+        var indexU32 = readU32();
+        var typeindex = indexU32.value;
+        eatBytes(indexU32.nextIndex);
+        dump([typeindex], "type index");
+        var signature = state.typesInModule[typeindex];
+
+        if (typeof signature === "undefined") {
+          throw new _helperApiError.CompileError("call_indirect signature not found (".concat(typeindex, ")"));
+        }
+
+        var _callNode = t.callIndirectInstruction(t.signature(signature.params, signature.result), []);
+
+        var flagU32 = readU32();
+        var flag = flagU32.value; // 0x00 - reserved byte
+
+        eatBytes(flagU32.nextIndex);
+
+        if (flag !== 0) {
+          throw new _helperApiError.CompileError("zero flag expected");
+        }
+
+        code.push(function () {
+          var endLoc = getPosition();
+          return t.withLoc(_callNode, endLoc, _startLoc10);
+        }());
+        instructionAlreadyCreated = true;
+      } else if (instruction.name === "br_table") {
+        var indicesu32 = readU32();
+        var indices = indicesu32.value;
+        eatBytes(indicesu32.nextIndex);
+        dump([indices], "num indices");
+
+        for (var i = 0; i <= indices; i++) {
+          var _indexu = readU32();
+
+          var _index = _indexu.value;
+          eatBytes(_indexu.nextIndex);
+          dump([_index], "index");
+          args.push(t.numberLiteralFromRaw(_indexu.value.toString(), "u32"));
+        }
+      } else if (instructionByte >= 0x28 && instructionByte <= 0x40) {
+        /**
+         * Memory instructions
+         */
+        if (instruction.name === "grow_memory" || instruction.name === "current_memory") {
+          var _indexU = readU32();
+
+          var _index2 = _indexU.value;
+          eatBytes(_indexU.nextIndex);
+
+          if (_index2 !== 0) {
+            throw new Error("zero flag expected");
+          }
+
+          dump([_index2], "index");
+        } else {
+          var aligun32 = readU32();
+          var align = aligun32.value;
+          eatBytes(aligun32.nextIndex);
+          dump([align], "align");
+          var offsetu32 = readU32();
+          var _offset2 = offsetu32.value;
+          eatBytes(offsetu32.nextIndex);
+          dump([_offset2], "offset");
+        }
+      } else if (instructionByte >= 0x41 && instructionByte <= 0x44) {
+        /**
+         * Numeric instructions
+         */
+        if (instruction.object === "i32") {
+          var value32 = read32();
+          var value = value32.value;
+          eatBytes(value32.nextIndex);
+          dump([value], "i32 value");
+          args.push(t.numberLiteralFromRaw(value));
+        }
+
+        if (instruction.object === "u32") {
+          var valueu32 = readU32();
+          var _value = valueu32.value;
+          eatBytes(valueu32.nextIndex);
+          dump([_value], "u32 value");
+          args.push(t.numberLiteralFromRaw(_value));
+        }
+
+        if (instruction.object === "i64") {
+          var value64 = read64();
+          var _value2 = value64.value;
+          eatBytes(value64.nextIndex);
+          dump([Number(_value2.toString())], "i64 value");
+          var high = _value2.high,
+              low = _value2.low;
+          var _node = {
+            type: "LongNumberLiteral",
+            value: {
+              high: high,
+              low: low
+            }
+          };
+          args.push(_node);
+        }
+
+        if (instruction.object === "u64") {
+          var valueu64 = readU64();
+          var _value3 = valueu64.value;
+          eatBytes(valueu64.nextIndex);
+          dump([Number(_value3.toString())], "u64 value");
+          var _high = _value3.high,
+              _low = _value3.low;
+          var _node2 = {
+            type: "LongNumberLiteral",
+            value: {
+              high: _high,
+              low: _low
+            }
+          };
+          args.push(_node2);
+        }
+
+        if (instruction.object === "f32") {
+          var valuef32 = readF32();
+          var _value4 = valuef32.value;
+          eatBytes(valuef32.nextIndex);
+          dump([_value4], "f32 value");
+          args.push( // $FlowIgnore
+          t.floatLiteral(_value4, valuef32.nan, valuef32.inf, String(_value4)));
+        }
+
+        if (instruction.object === "f64") {
+          var valuef64 = readF64();
+          var _value5 = valuef64.value;
+          eatBytes(valuef64.nextIndex);
+          dump([_value5], "f64 value");
+          args.push( // $FlowIgnore
+          t.floatLiteral(_value5, valuef64.nan, valuef64.inf, String(_value5)));
+        }
+      } else if (instructionByte >= 0xfe00 && instructionByte <= 0xfeff) {
+        /**
+         * Atomic memory instructions
+         */
+        var align32 = readU32();
+        var _align = align32.value;
+        eatBytes(align32.nextIndex);
+        dump([_align], "align");
+
+        var _offsetu = readU32();
+
+        var _offset3 = _offsetu.value;
+        eatBytes(_offsetu.nextIndex);
+        dump([_offset3], "offset");
+      } else {
+        for (var _i3 = 0; _i3 < instruction.numberOfArgs; _i3++) {
+          var u32 = readU32();
+          eatBytes(u32.nextIndex);
+          dump([u32.value], "argument " + _i3);
+          args.push(t.numberLiteralFromRaw(u32.value));
+        }
+      }
+
+      if (instructionAlreadyCreated === false) {
+        if (typeof instruction.object === "string") {
+          var _node3 = function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.objectInstruction(instruction.name, instruction.object, args), endLoc, _startLoc6);
+          }();
+
+          code.push(_node3);
+        } else {
+          var _node4 = function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.instruction(instruction.name, args), endLoc, _startLoc6);
+          }();
+
+          code.push(_node4);
+        }
+      }
+    }
+  } // https://webassembly.github.io/spec/core/binary/types.html#limits
+
+
+  function parseLimits() {
+    var limitType = readByte();
+    eatBytes(1);
+    var shared = limitType === 0x03;
+    dump([limitType], "limit type" + (shared ? " (shared)" : ""));
+    var min, max;
+
+    if (limitType === 0x01 || limitType === 0x03 // shared limits
+    ) {
+        var u32min = readU32();
+        min = parseInt(u32min.value);
+        eatBytes(u32min.nextIndex);
+        dump([min], "min");
+        var u32max = readU32();
+        max = parseInt(u32max.value);
+        eatBytes(u32max.nextIndex);
+        dump([max], "max");
+      }
+
+    if (limitType === 0x00) {
+      var _u32min = readU32();
+
+      min = parseInt(_u32min.value);
+      eatBytes(_u32min.nextIndex);
+      dump([min], "min");
+    }
+
+    return t.limit(min, max, shared);
+  } // https://webassembly.github.io/spec/core/binary/types.html#binary-tabletype
+
+
+  function parseTableType(index) {
+    var name = t.withRaw(t.identifier(getUniqueName("table")), String(index));
+    var elementTypeByte = readByte();
+    eatBytes(1);
+    dump([elementTypeByte], "element type");
+    var elementType = _helperWasmBytecode.default.tableTypes[elementTypeByte];
+
+    if (typeof elementType === "undefined") {
+      throw new _helperApiError.CompileError("Unknown element type in table: " + toHex(elementType));
+    }
+
+    var limits = parseLimits();
+    return t.table(elementType, limits, name);
+  } // https://webassembly.github.io/spec/binary/types.html#global-types
+
+
+  function parseGlobalType() {
+    var valtypeByte = readByte();
+    eatBytes(1);
+    var type = _helperWasmBytecode.default.valtypes[valtypeByte];
+    dump([valtypeByte], type);
+
+    if (typeof type === "undefined") {
+      throw new _helperApiError.CompileError("Unknown valtype: " + toHex(valtypeByte));
+    }
+
+    var globalTypeByte = readByte();
+    eatBytes(1);
+    var globalType = _helperWasmBytecode.default.globalTypes[globalTypeByte];
+    dump([globalTypeByte], "global type (".concat(globalType, ")"));
+
+    if (typeof globalType === "undefined") {
+      throw new _helperApiError.CompileError("Invalid mutability: " + toHex(globalTypeByte));
+    }
+
+    return t.globalType(type, globalType);
+  } // function parseNameModule() {
+  //   const lenu32 = readVaruint32();
+  //   eatBytes(lenu32.nextIndex);
+  //   console.log("len", lenu32);
+  //   const strlen = lenu32.value;
+  //   dump([strlen], "string length");
+  //   const bytes = readBytes(strlen);
+  //   eatBytes(strlen);
+  //   const value = utf8.decode(bytes);
+  //   return [t.moduleNameMetadata(value)];
+  // }
+  // this section contains an array of function names and indices
+
+
+  function parseNameSectionFunctions() {
+    var functionNames = [];
+    var numberOfFunctionsu32 = readU32();
+    var numbeOfFunctions = numberOfFunctionsu32.value;
+    eatBytes(numberOfFunctionsu32.nextIndex);
+
+    for (var i = 0; i < numbeOfFunctions; i++) {
+      var indexu32 = readU32();
+      var index = indexu32.value;
+      eatBytes(indexu32.nextIndex);
+      var name = readUTF8String();
+      eatBytes(name.nextIndex);
+      functionNames.push(t.functionNameMetadata(name.value, index));
+    }
+
+    return functionNames;
+  }
+
+  function parseNameSectionLocals() {
+    var localNames = [];
+    var numbeOfFunctionsu32 = readU32();
+    var numbeOfFunctions = numbeOfFunctionsu32.value;
+    eatBytes(numbeOfFunctionsu32.nextIndex);
+
+    for (var i = 0; i < numbeOfFunctions; i++) {
+      var functionIndexu32 = readU32();
+      var functionIndex = functionIndexu32.value;
+      eatBytes(functionIndexu32.nextIndex);
+      var numLocalsu32 = readU32();
+      var numLocals = numLocalsu32.value;
+      eatBytes(numLocalsu32.nextIndex);
+
+      for (var _i4 = 0; _i4 < numLocals; _i4++) {
+        var localIndexu32 = readU32();
+        var localIndex = localIndexu32.value;
+        eatBytes(localIndexu32.nextIndex);
+        var name = readUTF8String();
+        eatBytes(name.nextIndex);
+        localNames.push(t.localNameMetadata(name.value, localIndex, functionIndex));
+      }
+    }
+
+    return localNames;
+  } // this is a custom section used for name resolution
+  // https://github.com/WebAssembly/design/blob/master/BinaryEncoding.md#name-section
+
+
+  function parseNameSection(remainingBytes) {
+    var nameMetadata = [];
+    var initialOffset = offset;
+
+    while (offset - initialOffset < remainingBytes) {
+      // name_type
+      var sectionTypeByte = readVaruint7();
+      eatBytes(sectionTypeByte.nextIndex); // name_payload_len
+
+      var subSectionSizeInBytesu32 = readVaruint32();
+      eatBytes(subSectionSizeInBytesu32.nextIndex);
+
+      switch (sectionTypeByte.value) {
+        // case 0: {
+        // TODO(sven): re-enable that
+        // Current status: it seems that when we decode the module's name
+        // no name_payload_len is used.
+        //
+        // See https://github.com/WebAssembly/design/blob/master/BinaryEncoding.md#name-section
+        //
+        // nameMetadata.push(...parseNameModule());
+        // break;
+        // }
+        case 1:
+          {
+            nameMetadata.push.apply(nameMetadata, _toConsumableArray(parseNameSectionFunctions()));
+            break;
+          }
+
+        case 2:
+          {
+            nameMetadata.push.apply(nameMetadata, _toConsumableArray(parseNameSectionLocals()));
+            break;
+          }
+
+        default:
+          {
+            // skip unknown subsection
+            eatBytes(subSectionSizeInBytesu32.value);
+          }
+      }
+    }
+
+    return nameMetadata;
+  } // this is a custom section used for information about the producers
+  // https://github.com/WebAssembly/tool-conventions/blob/master/ProducersSection.md
+
+
+  function parseProducersSection() {
+    var metadata = t.producersSectionMetadata([]); // field_count
+
+    var sectionTypeByte = readVaruint32();
+    eatBytes(sectionTypeByte.nextIndex);
+    dump([sectionTypeByte.value], "num of producers");
+    var fields = {
+      language: [],
+      "processed-by": [],
+      sdk: []
+    }; // fields
+
+    for (var fieldI = 0; fieldI < sectionTypeByte.value; fieldI++) {
+      // field_name
+      var fieldName = readUTF8String();
+      eatBytes(fieldName.nextIndex); // field_value_count
+
+      var valueCount = readVaruint32();
+      eatBytes(valueCount.nextIndex); // field_values
+
+      for (var producerI = 0; producerI < valueCount.value; producerI++) {
+        var producerName = readUTF8String();
+        eatBytes(producerName.nextIndex);
+        var producerVersion = readUTF8String();
+        eatBytes(producerVersion.nextIndex);
+        fields[fieldName.value].push(t.producerMetadataVersionedName(producerName.value, producerVersion.value));
+      }
+
+      metadata.producers.push(fields[fieldName.value]);
+    }
+
+    return metadata;
+  }
+
+  function parseGlobalSection(numberOfGlobals) {
+    var globals = [];
+    dump([numberOfGlobals], "num globals");
+
+    for (var i = 0; i < numberOfGlobals; i++) {
+      var _startLoc11 = getPosition();
+
+      var globalType = parseGlobalType();
+      /**
+       * Global expressions
+       */
+
+      var init = [];
+      parseInstructionBlock(init);
+
+      var node = function () {
+        var endLoc = getPosition();
+        return t.withLoc(t.global(globalType, init), endLoc, _startLoc11);
+      }();
+
+      globals.push(node);
+      state.globalsInModule.push(node);
+    }
+
+    return globals;
+  }
+
+  function parseElemSection(numberOfElements) {
+    var elems = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var _startLoc12 = getPosition();
+
+      var tableindexu32 = readU32();
+      var tableindex = tableindexu32.value;
+      eatBytes(tableindexu32.nextIndex);
+      dump([tableindex], "table index");
+      /**
+       * Parse instructions
+       */
+
+      var instr = [];
+      parseInstructionBlock(instr);
+      /**
+       * Parse ( vector function index ) *
+       */
+
+      var indicesu32 = readU32();
+      var indices = indicesu32.value;
+      eatBytes(indicesu32.nextIndex);
+      dump([indices], "num indices");
+      var indexValues = [];
+
+      for (var _i5 = 0; _i5 < indices; _i5++) {
+        var indexu32 = readU32();
+        var index = indexu32.value;
+        eatBytes(indexu32.nextIndex);
+        dump([index], "index");
+        indexValues.push(t.indexLiteral(index));
+      }
+
+      var elemNode = function () {
+        var endLoc = getPosition();
+        return t.withLoc(t.elem(t.indexLiteral(tableindex), instr, indexValues), endLoc, _startLoc12);
+      }();
+
+      elems.push(elemNode);
+    }
+
+    return elems;
+  } // https://webassembly.github.io/spec/core/binary/types.html#memory-types
+
+
+  function parseMemoryType(i) {
+    var limits = parseLimits();
+    return t.memory(limits, t.indexLiteral(i));
+  } // https://webassembly.github.io/spec/binary/modules.html#table-section
+
+
+  function parseTableSection(numberOfElements) {
+    var tables = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var tablesNode = parseTableType(i);
+      state.tablesInModule.push(tablesNode);
+      tables.push(tablesNode);
+    }
+
+    return tables;
+  } // https://webassembly.github.io/spec/binary/modules.html#memory-section
+
+
+  function parseMemorySection(numberOfElements) {
+    var memories = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var memoryNode = parseMemoryType(i);
+      state.memoriesInModule.push(memoryNode);
+      memories.push(memoryNode);
+    }
+
+    return memories;
+  } // https://webassembly.github.io/spec/binary/modules.html#binary-startsec
+
+
+  function parseStartSection() {
+    var startLoc = getPosition();
+    var u32 = readU32();
+    var startFuncIndex = u32.value;
+    eatBytes(u32.nextIndex);
+    dump([startFuncIndex], "index");
+    return function () {
+      var endLoc = getPosition();
+      return t.withLoc(t.start(t.indexLiteral(startFuncIndex)), endLoc, startLoc);
+    }();
+  } // https://webassembly.github.io/spec/binary/modules.html#data-section
+
+
+  function parseDataSection(numberOfElements) {
+    var dataEntries = [];
+    dump([numberOfElements], "num elements");
+
+    for (var i = 0; i < numberOfElements; i++) {
+      var memoryIndexu32 = readU32();
+      var memoryIndex = memoryIndexu32.value;
+      eatBytes(memoryIndexu32.nextIndex);
+      dump([memoryIndex], "memory index");
+      var instrs = [];
+      parseInstructionBlock(instrs);
+      var hasExtraInstrs = instrs.filter(function (i) {
+        return i.id !== "end";
+      }).length !== 1;
+
+      if (hasExtraInstrs) {
+        throw new _helperApiError.CompileError("data section offset must be a single instruction");
+      }
+
+      var bytes = parseVec(function (b) {
+        return b;
+      });
+      dump([], "init");
+      dataEntries.push(t.data(t.memIndexLiteral(memoryIndex), instrs[0], t.byteArray(bytes)));
+    }
+
+    return dataEntries;
+  } // https://webassembly.github.io/spec/binary/modules.html#binary-section
+
+
+  function parseSection(sectionIndex) {
+    var sectionId = readByte();
+    eatBytes(1);
+
+    if (sectionId >= sectionIndex || sectionIndex === _helperWasmBytecode.default.sections.custom) {
+      sectionIndex = sectionId + 1;
+    } else {
+      if (sectionId !== _helperWasmBytecode.default.sections.custom) throw new _helperApiError.CompileError("Unexpected section: " + toHex(sectionId));
+    }
+
+    var nextSectionIndex = sectionIndex;
+    var startOffset = offset;
+    var startLoc = getPosition();
+    var u32 = readU32();
+    var sectionSizeInBytes = u32.value;
+    eatBytes(u32.nextIndex);
+
+    var sectionSizeInBytesNode = function () {
+      var endLoc = getPosition();
+      return t.withLoc(t.numberLiteralFromRaw(sectionSizeInBytes), endLoc, startLoc);
+    }();
+
+    switch (sectionId) {
+      case _helperWasmBytecode.default.sections.type:
+        {
+          dumpSep("section Type");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc13 = getPosition();
+
+          var _u = readU32();
+
+          var numberOfTypes = _u.value;
+          eatBytes(_u.nextIndex);
+
+          var _metadata = t.sectionMetadata("type", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfTypes), endLoc, _startLoc13);
+          }());
+
+          var _nodes = parseTypeSection(numberOfTypes);
+
+          return {
+            nodes: _nodes,
+            metadata: _metadata,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.table:
+        {
+          dumpSep("section Table");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc14 = getPosition();
+
+          var _u2 = readU32();
+
+          var numberOfTable = _u2.value;
+          eatBytes(_u2.nextIndex);
+          dump([numberOfTable], "num tables");
+
+          var _metadata2 = t.sectionMetadata("table", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfTable), endLoc, _startLoc14);
+          }());
+
+          var _nodes2 = parseTableSection(numberOfTable);
+
+          return {
+            nodes: _nodes2,
+            metadata: _metadata2,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.import:
+        {
+          dumpSep("section Import");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc15 = getPosition();
+
+          var numberOfImportsu32 = readU32();
+          var numberOfImports = numberOfImportsu32.value;
+          eatBytes(numberOfImportsu32.nextIndex);
+          dump([numberOfImports], "number of imports");
+
+          var _metadata3 = t.sectionMetadata("import", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfImports), endLoc, _startLoc15);
+          }());
+
+          var _nodes3 = parseImportSection(numberOfImports);
+
+          return {
+            nodes: _nodes3,
+            metadata: _metadata3,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.func:
+        {
+          dumpSep("section Function");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc16 = getPosition();
+
+          var numberOfFunctionsu32 = readU32();
+          var numberOfFunctions = numberOfFunctionsu32.value;
+          eatBytes(numberOfFunctionsu32.nextIndex);
+
+          var _metadata4 = t.sectionMetadata("func", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfFunctions), endLoc, _startLoc16);
+          }());
+
+          parseFuncSection(numberOfFunctions);
+          var _nodes4 = [];
+          return {
+            nodes: _nodes4,
+            metadata: _metadata4,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.export:
+        {
+          dumpSep("section Export");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc17 = getPosition();
+
+          var _u3 = readU32();
+
+          var numberOfExport = _u3.value;
+          eatBytes(_u3.nextIndex);
+
+          var _metadata5 = t.sectionMetadata("export", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfExport), endLoc, _startLoc17);
+          }());
+
+          parseExportSection(numberOfExport);
+          var _nodes5 = [];
+          return {
+            nodes: _nodes5,
+            metadata: _metadata5,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.code:
+        {
+          dumpSep("section Code");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc18 = getPosition();
+
+          var _u4 = readU32();
+
+          var numberOfFuncs = _u4.value;
+          eatBytes(_u4.nextIndex);
+
+          var _metadata6 = t.sectionMetadata("code", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfFuncs), endLoc, _startLoc18);
+          }());
+
+          if (opts.ignoreCodeSection === true) {
+            var remainingBytes = sectionSizeInBytes - _u4.nextIndex;
+            eatBytes(remainingBytes); // eat the entire section
+          } else {
+            parseCodeSection(numberOfFuncs);
+          }
+
+          var _nodes6 = [];
+          return {
+            nodes: _nodes6,
+            metadata: _metadata6,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.start:
+        {
+          dumpSep("section Start");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _metadata7 = t.sectionMetadata("start", startOffset, sectionSizeInBytesNode);
+
+          var _nodes7 = [parseStartSection()];
+          return {
+            nodes: _nodes7,
+            metadata: _metadata7,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.element:
+        {
+          dumpSep("section Element");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc19 = getPosition();
+
+          var numberOfElementsu32 = readU32();
+          var numberOfElements = numberOfElementsu32.value;
+          eatBytes(numberOfElementsu32.nextIndex);
+
+          var _metadata8 = t.sectionMetadata("element", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfElements), endLoc, _startLoc19);
+          }());
+
+          var _nodes8 = parseElemSection(numberOfElements);
+
+          return {
+            nodes: _nodes8,
+            metadata: _metadata8,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.global:
+        {
+          dumpSep("section Global");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc20 = getPosition();
+
+          var numberOfGlobalsu32 = readU32();
+          var numberOfGlobals = numberOfGlobalsu32.value;
+          eatBytes(numberOfGlobalsu32.nextIndex);
+
+          var _metadata9 = t.sectionMetadata("global", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(numberOfGlobals), endLoc, _startLoc20);
+          }());
+
+          var _nodes9 = parseGlobalSection(numberOfGlobals);
+
+          return {
+            nodes: _nodes9,
+            metadata: _metadata9,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.memory:
+        {
+          dumpSep("section Memory");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _startLoc21 = getPosition();
+
+          var _numberOfElementsu = readU32();
+
+          var _numberOfElements = _numberOfElementsu.value;
+          eatBytes(_numberOfElementsu.nextIndex);
+
+          var _metadata10 = t.sectionMetadata("memory", startOffset, sectionSizeInBytesNode, function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(_numberOfElements), endLoc, _startLoc21);
+          }());
+
+          var _nodes10 = parseMemorySection(_numberOfElements);
+
+          return {
+            nodes: _nodes10,
+            metadata: _metadata10,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+
+      case _helperWasmBytecode.default.sections.data:
+        {
+          dumpSep("section Data");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+
+          var _metadata11 = t.sectionMetadata("data", startOffset, sectionSizeInBytesNode);
+
+          var _startLoc22 = getPosition();
+
+          var _numberOfElementsu2 = readU32();
+
+          var _numberOfElements2 = _numberOfElementsu2.value;
+          eatBytes(_numberOfElementsu2.nextIndex);
+
+          _metadata11.vectorOfSize = function () {
+            var endLoc = getPosition();
+            return t.withLoc(t.numberLiteralFromRaw(_numberOfElements2), endLoc, _startLoc22);
+          }();
+
+          if (opts.ignoreDataSection === true) {
+            var _remainingBytes = sectionSizeInBytes - _numberOfElementsu2.nextIndex;
+
+            eatBytes(_remainingBytes); // eat the entire section
+
+            dumpSep("ignore data (" + sectionSizeInBytes + " bytes)");
+            return {
+              nodes: [],
+              metadata: _metadata11,
+              nextSectionIndex: nextSectionIndex
+            };
+          } else {
+            var _nodes11 = parseDataSection(_numberOfElements2);
+
+            return {
+              nodes: _nodes11,
+              metadata: _metadata11,
+              nextSectionIndex: nextSectionIndex
+            };
+          }
+        }
+
+      case _helperWasmBytecode.default.sections.custom:
+        {
+          dumpSep("section Custom");
+          dump([sectionId], "section code");
+          dump([sectionSizeInBytes], "section size");
+          var _metadata12 = [t.sectionMetadata("custom", startOffset, sectionSizeInBytesNode)];
+          var sectionName = readUTF8String();
+          eatBytes(sectionName.nextIndex);
+          dump([], "section name (".concat(sectionName.value, ")"));
+
+          var _remainingBytes2 = sectionSizeInBytes - sectionName.nextIndex;
+
+          if (sectionName.value === "name") {
+            var initialOffset = offset;
+
+            try {
+              _metadata12.push.apply(_metadata12, _toConsumableArray(parseNameSection(_remainingBytes2)));
+            } catch (e) {
+              console.warn("Failed to decode custom \"name\" section @".concat(offset, "; ignoring (").concat(e.message, ")."));
+              eatBytes(offset - (initialOffset + _remainingBytes2));
+            }
+          } else if (sectionName.value === "producers") {
+            var _initialOffset = offset;
+
+            try {
+              _metadata12.push(parseProducersSection());
+            } catch (e) {
+              console.warn("Failed to decode custom \"producers\" section @".concat(offset, "; ignoring (").concat(e.message, ")."));
+              eatBytes(offset - (_initialOffset + _remainingBytes2));
+            }
+          } else {
+            // We don't parse the custom section
+            eatBytes(_remainingBytes2);
+            dumpSep("ignore custom " + JSON.stringify(sectionName.value) + " section (" + _remainingBytes2 + " bytes)");
+          }
+
+          return {
+            nodes: [],
+            metadata: _metadata12,
+            nextSectionIndex: nextSectionIndex
+          };
+        }
+    }
+
+    throw new _helperApiError.CompileError("Unexpected section: " + toHex(sectionId));
+  }
+
+  parseModuleHeader();
+  parseVersion();
+  var moduleFields = [];
+  var sectionIndex = 0;
+  var moduleMetadata = {
+    sections: [],
+    functionNames: [],
+    localNames: [],
+    producers: []
+  };
+  /**
+   * All the generate declaration are going to be stored in our state
+   */
+
+  while (offset < buf.length) {
+    var _parseSection = parseSection(sectionIndex),
+        _nodes12 = _parseSection.nodes,
+        _metadata13 = _parseSection.metadata,
+        nextSectionIndex = _parseSection.nextSectionIndex;
+
+    moduleFields.push.apply(moduleFields, _toConsumableArray(_nodes12));
+    var metadataArray = Array.isArray(_metadata13) ? _metadata13 : [_metadata13];
+    metadataArray.forEach(function (metadataItem) {
+      if (metadataItem.type === "FunctionNameMetadata") {
+        moduleMetadata.functionNames.push(metadataItem);
+      } else if (metadataItem.type === "LocalNameMetadata") {
+        moduleMetadata.localNames.push(metadataItem);
+      } else if (metadataItem.type === "ProducersSectionMetadata") {
+        moduleMetadata.producers.push(metadataItem);
+      } else {
+        moduleMetadata.sections.push(metadataItem);
+      }
+    }); // Ignore custom section
+
+    if (nextSectionIndex) {
+      sectionIndex = nextSectionIndex;
+    }
+  }
+  /**
+   * Transform the state into AST nodes
+   */
+
+
+  var funcIndex = 0;
+  state.functionsInModule.forEach(function (func) {
+    var params = func.signature.params;
+    var result = func.signature.result;
+    var body = []; // External functions doesn't provide any code, can skip it here
+
+    if (func.isExternal === true) {
+      return;
+    }
+
+    var decodedElementInCodeSection = state.elementsInCodeSection[funcIndex];
+
+    if (opts.ignoreCodeSection === false) {
+      if (typeof decodedElementInCodeSection === "undefined") {
+        throw new _helperApiError.CompileError("func " + toHex(funcIndex) + " code not found");
+      }
+
+      body = decodedElementInCodeSection.code;
+    }
+
+    funcIndex++;
+    var funcNode = t.func(func.id, t.signature(params, result), body);
+
+    if (func.isExternal === true) {
+      funcNode.isExternal = func.isExternal;
+    } // Add function position in the binary if possible
+
+
+    if (opts.ignoreCodeSection === false) {
+      var _startLoc23 = decodedElementInCodeSection.startLoc,
+          endLoc = decodedElementInCodeSection.endLoc,
+          bodySize = decodedElementInCodeSection.bodySize;
+      funcNode = t.withLoc(funcNode, endLoc, _startLoc23);
+      funcNode.metadata = {
+        bodySize: bodySize
+      };
+    }
+
+    moduleFields.push(funcNode);
+  });
+  state.elementsInExportSection.forEach(function (moduleExport) {
+    /**
+     * If the export has no id, we won't be able to call it from the outside
+     * so we can omit it
+     */
+    if (moduleExport.id != null) {
+      moduleFields.push(t.withLoc(t.moduleExport(moduleExport.name, t.moduleExportDescr(moduleExport.type, moduleExport.id)), moduleExport.endLoc, moduleExport.startLoc));
+    }
+  });
+  dumpSep("end of program");
+  var module = t.module(null, moduleFields, t.moduleMetadata(moduleMetadata.sections, moduleMetadata.functionNames, moduleMetadata.localNames, moduleMetadata.producers));
+  return t.program([module]);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/index.js
new file mode 100644
index 0000000..abd442a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/index.js
@@ -0,0 +1,257 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.decode = decode;
+
+var decoder = _interopRequireWildcard(require("./decoder"));
+
+var t = _interopRequireWildcard(require("@webassemblyjs/ast"));
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+
+/**
+ * TODO(sven): I added initial props, but we should rather fix
+ * https://github.com/xtuc/webassemblyjs/issues/405
+ */
+var defaultDecoderOpts = {
+  dump: false,
+  ignoreCodeSection: false,
+  ignoreDataSection: false,
+  ignoreCustomNameSection: false
+}; // traverses the AST, locating function name metadata, which is then
+// used to update index-based identifiers with function names
+
+function restoreFunctionNames(ast) {
+  var functionNames = [];
+  t.traverse(ast, {
+    FunctionNameMetadata: function FunctionNameMetadata(_ref) {
+      var node = _ref.node;
+      functionNames.push({
+        name: node.value,
+        index: node.index
+      });
+    }
+  });
+
+  if (functionNames.length === 0) {
+    return;
+  }
+
+  t.traverse(ast, {
+    Func: function (_Func) {
+      function Func(_x) {
+        return _Func.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func.toString();
+      };
+
+      return Func;
+    }(function (_ref2) {
+      var node = _ref2.node;
+      // $FlowIgnore
+      var nodeName = node.name;
+      var indexBasedFunctionName = nodeName.value;
+      var index = Number(indexBasedFunctionName.replace("func_", ""));
+      var functionName = functionNames.find(function (f) {
+        return f.index === index;
+      });
+
+      if (functionName) {
+        var oldValue = nodeName.value;
+        nodeName.value = functionName.name;
+        nodeName.numeric = oldValue; // $FlowIgnore
+
+        delete nodeName.raw;
+      }
+    }),
+    // Also update the reference in the export
+    ModuleExport: function (_ModuleExport) {
+      function ModuleExport(_x2) {
+        return _ModuleExport.apply(this, arguments);
+      }
+
+      ModuleExport.toString = function () {
+        return _ModuleExport.toString();
+      };
+
+      return ModuleExport;
+    }(function (_ref3) {
+      var node = _ref3.node;
+
+      if (node.descr.exportType === "Func") {
+        // $FlowIgnore
+        var nodeName = node.descr.id;
+        var index = nodeName.value;
+        var functionName = functionNames.find(function (f) {
+          return f.index === index;
+        });
+
+        if (functionName) {
+          node.descr.id = t.identifier(functionName.name);
+        }
+      }
+    }),
+    ModuleImport: function (_ModuleImport) {
+      function ModuleImport(_x3) {
+        return _ModuleImport.apply(this, arguments);
+      }
+
+      ModuleImport.toString = function () {
+        return _ModuleImport.toString();
+      };
+
+      return ModuleImport;
+    }(function (_ref4) {
+      var node = _ref4.node;
+
+      if (node.descr.type === "FuncImportDescr") {
+        // $FlowIgnore
+        var indexBasedFunctionName = node.descr.id;
+        var index = Number(indexBasedFunctionName.replace("func_", ""));
+        var functionName = functionNames.find(function (f) {
+          return f.index === index;
+        });
+
+        if (functionName) {
+          // $FlowIgnore
+          node.descr.id = t.identifier(functionName.name);
+        }
+      }
+    }),
+    CallInstruction: function (_CallInstruction) {
+      function CallInstruction(_x4) {
+        return _CallInstruction.apply(this, arguments);
+      }
+
+      CallInstruction.toString = function () {
+        return _CallInstruction.toString();
+      };
+
+      return CallInstruction;
+    }(function (nodePath) {
+      var node = nodePath.node;
+      var index = node.index.value;
+      var functionName = functionNames.find(function (f) {
+        return f.index === index;
+      });
+
+      if (functionName) {
+        var oldValue = node.index;
+        node.index = t.identifier(functionName.name);
+        node.numeric = oldValue; // $FlowIgnore
+
+        delete node.raw;
+      }
+    })
+  });
+}
+
+function restoreLocalNames(ast) {
+  var localNames = [];
+  t.traverse(ast, {
+    LocalNameMetadata: function LocalNameMetadata(_ref5) {
+      var node = _ref5.node;
+      localNames.push({
+        name: node.value,
+        localIndex: node.localIndex,
+        functionIndex: node.functionIndex
+      });
+    }
+  });
+
+  if (localNames.length === 0) {
+    return;
+  }
+
+  t.traverse(ast, {
+    Func: function (_Func2) {
+      function Func(_x5) {
+        return _Func2.apply(this, arguments);
+      }
+
+      Func.toString = function () {
+        return _Func2.toString();
+      };
+
+      return Func;
+    }(function (_ref6) {
+      var node = _ref6.node;
+      var signature = node.signature;
+
+      if (signature.type !== "Signature") {
+        return;
+      } // $FlowIgnore
+
+
+      var nodeName = node.name;
+      var indexBasedFunctionName = nodeName.value;
+      var functionIndex = Number(indexBasedFunctionName.replace("func_", ""));
+      signature.params.forEach(function (param, paramIndex) {
+        var paramName = localNames.find(function (f) {
+          return f.localIndex === paramIndex && f.functionIndex === functionIndex;
+        });
+
+        if (paramName && paramName.name !== "") {
+          param.id = paramName.name;
+        }
+      });
+    })
+  });
+}
+
+function restoreModuleName(ast) {
+  t.traverse(ast, {
+    ModuleNameMetadata: function (_ModuleNameMetadata) {
+      function ModuleNameMetadata(_x6) {
+        return _ModuleNameMetadata.apply(this, arguments);
+      }
+
+      ModuleNameMetadata.toString = function () {
+        return _ModuleNameMetadata.toString();
+      };
+
+      return ModuleNameMetadata;
+    }(function (moduleNameMetadataPath) {
+      // update module
+      t.traverse(ast, {
+        Module: function (_Module) {
+          function Module(_x7) {
+            return _Module.apply(this, arguments);
+          }
+
+          Module.toString = function () {
+            return _Module.toString();
+          };
+
+          return Module;
+        }(function (_ref7) {
+          var node = _ref7.node;
+          var name = moduleNameMetadataPath.node.value; // compatiblity with wast-parser
+
+          if (name === "") {
+            name = null;
+          }
+
+          node.id = name;
+        })
+      });
+    })
+  });
+}
+
+function decode(buf, customOpts) {
+  var opts = Object.assign({}, defaultDecoderOpts, customOpts);
+  var ast = decoder.decode(buf, opts);
+
+  if (opts.ignoreCustomNameSection === false) {
+    restoreFunctionNames(ast);
+    restoreLocalNames(ast);
+    restoreModuleName(ast);
+  }
+
+  return ast;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/types/decoder.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/lib/types/decoder.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/package.json
new file mode 100644
index 0000000..a4fd8ed
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wasm-parser/package.json
@@ -0,0 +1,44 @@
+{
+  "name": "@webassemblyjs/wasm-parser",
+  "version": "1.11.1",
+  "keywords": [
+    "webassembly",
+    "javascript",
+    "ast",
+    "parser",
+    "wasm"
+  ],
+  "description": "WebAssembly binary format parser",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "scripts": {
+    "test": "mocha"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "dependencies": {
+    "@webassemblyjs/ast": "1.11.1",
+    "@webassemblyjs/helper-api-error": "1.11.1",
+    "@webassemblyjs/helper-wasm-bytecode": "1.11.1",
+    "@webassemblyjs/ieee754": "1.11.1",
+    "@webassemblyjs/leb128": "1.11.1",
+    "@webassemblyjs/utf8": "1.11.1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "devDependencies": {
+    "@webassemblyjs/helper-buffer": "1.11.1",
+    "@webassemblyjs/helper-test-framework": "1.11.1",
+    "@webassemblyjs/helper-wasm-bytecode": "1.7.7",
+    "@webassemblyjs/wasm-gen": "1.11.1",
+    "@webassemblyjs/wast-parser": "1.11.1",
+    "mamacro": "^0.0.7",
+    "wabt": "1.0.12"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/LICENSE b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/LICENSE
new file mode 100644
index 0000000..87e7e1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/README.md b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/README.md
new file mode 100644
index 0000000..ed4cd4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/README.md
@@ -0,0 +1,17 @@
+# @webassemblyjs/wast-parser
+
+> WebAssembly text format printer
+
+## Installation
+
+```sh
+yarn add @webassemblyjs/wast-printer
+```
+
+## Usage
+
+```js
+import { print } from "@webassemblyjs/wast-printer"
+
+console.log(print(ast));
+```
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/esm/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/esm/index.js
new file mode 100644
index 0000000..10a05f6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/esm/index.js
@@ -0,0 +1,904 @@
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+import { isAnonymous, isInstruction } from "@webassemblyjs/ast";
+import Long from "@xtuc/long";
+var compact = false;
+var space = " ";
+
+var quote = function quote(str) {
+  return "\"".concat(str, "\"");
+};
+
+function indent(nb) {
+  return Array(nb).fill(space + space).join("");
+} // TODO(sven): allow arbitrary ast nodes
+
+
+export function print(n) {
+  if (n.type === "Program") {
+    return printProgram(n, 0);
+  } else {
+    throw new Error("Unsupported node in print of type: " + String(n.type));
+  }
+}
+
+function printProgram(n, depth) {
+  return n.body.reduce(function (acc, child) {
+    if (child.type === "Module") {
+      acc += printModule(child, depth + 1);
+    }
+
+    if (child.type === "Func") {
+      acc += printFunc(child, depth + 1);
+    }
+
+    if (child.type === "BlockComment") {
+      acc += printBlockComment(child);
+    }
+
+    if (child.type === "LeadingComment") {
+      acc += printLeadingComment(child);
+    }
+
+    if (compact === false) {
+      acc += "\n";
+    }
+
+    return acc;
+  }, "");
+}
+
+function printTypeInstruction(n) {
+  var out = "";
+  out += "(";
+  out += "type";
+  out += space;
+
+  if (n.id != null) {
+    out += printIndex(n.id);
+    out += space;
+  }
+
+  out += "(";
+  out += "func";
+  n.functype.params.forEach(function (param) {
+    out += space;
+    out += "(";
+    out += "param";
+    out += space;
+    out += printFuncParam(param);
+    out += ")";
+  });
+  n.functype.results.forEach(function (result) {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += result;
+    out += ")";
+  });
+  out += ")"; // func
+
+  out += ")";
+  return out;
+}
+
+function printModule(n, depth) {
+  var out = "(";
+  out += "module";
+
+  if (typeof n.id === "string") {
+    out += space;
+    out += n.id;
+  }
+
+  if (compact === false) {
+    out += "\n";
+  } else {
+    out += space;
+  }
+
+  n.fields.forEach(function (field) {
+    if (compact === false) {
+      out += indent(depth);
+    }
+
+    switch (field.type) {
+      case "Func":
+        {
+          out += printFunc(field, depth + 1);
+          break;
+        }
+
+      case "TypeInstruction":
+        {
+          out += printTypeInstruction(field);
+          break;
+        }
+
+      case "Table":
+        {
+          out += printTable(field);
+          break;
+        }
+
+      case "Global":
+        {
+          out += printGlobal(field, depth + 1);
+          break;
+        }
+
+      case "ModuleExport":
+        {
+          out += printModuleExport(field);
+          break;
+        }
+
+      case "ModuleImport":
+        {
+          out += printModuleImport(field);
+          break;
+        }
+
+      case "Memory":
+        {
+          out += printMemory(field);
+          break;
+        }
+
+      case "BlockComment":
+        {
+          out += printBlockComment(field);
+          break;
+        }
+
+      case "LeadingComment":
+        {
+          out += printLeadingComment(field);
+          break;
+        }
+
+      case "Start":
+        {
+          out += printStart(field);
+          break;
+        }
+
+      case "Elem":
+        {
+          out += printElem(field, depth);
+          break;
+        }
+
+      case "Data":
+        {
+          out += printData(field, depth);
+          break;
+        }
+
+      default:
+        throw new Error("Unsupported node in printModule: " + String(field.type));
+    }
+
+    if (compact === false) {
+      out += "\n";
+    }
+  });
+  out += ")";
+  return out;
+}
+
+function printData(n, depth) {
+  var out = "";
+  out += "(";
+  out += "data";
+  out += space;
+  out += printIndex(n.memoryIndex);
+  out += space;
+  out += printInstruction(n.offset, depth);
+  out += space;
+  out += '"';
+  n.init.values.forEach(function (byte) {
+    // Avoid non-displayable characters
+    if (byte <= 31 || byte == 34 || byte == 92 || byte >= 127) {
+      out += "\\";
+      out += ("00" + byte.toString(16)).substr(-2);
+    } else if (byte > 255) {
+      throw new Error("Unsupported byte in data segment: " + byte);
+    } else {
+      out += String.fromCharCode(byte);
+    }
+  });
+  out += '"';
+  out += ")";
+  return out;
+}
+
+function printElem(n, depth) {
+  var out = "";
+  out += "(";
+  out += "elem";
+  out += space;
+  out += printIndex(n.table);
+
+  var _n$offset = _slicedToArray(n.offset, 1),
+      firstOffset = _n$offset[0];
+
+  out += space;
+  out += "(";
+  out += "offset";
+  out += space;
+  out += printInstruction(firstOffset, depth);
+  out += ")";
+  n.funcs.forEach(function (func) {
+    out += space;
+    out += printIndex(func);
+  });
+  out += ")";
+  return out;
+}
+
+function printStart(n) {
+  var out = "";
+  out += "(";
+  out += "start";
+  out += space;
+  out += printIndex(n.index);
+  out += ")";
+  return out;
+}
+
+function printLeadingComment(n) {
+  // Don't print leading comments in compact mode
+  if (compact === true) {
+    return "";
+  }
+
+  var out = "";
+  out += ";;";
+  out += n.value;
+  out += "\n";
+  return out;
+}
+
+function printBlockComment(n) {
+  // Don't print block comments in compact mode
+  if (compact === true) {
+    return "";
+  }
+
+  var out = "";
+  out += "(;";
+  out += n.value;
+  out += ";)";
+  out += "\n";
+  return out;
+}
+
+function printSignature(n) {
+  var out = "";
+  n.params.forEach(function (param) {
+    out += space;
+    out += "(";
+    out += "param";
+    out += space;
+    out += printFuncParam(param);
+    out += ")";
+  });
+  n.results.forEach(function (result) {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += result;
+    out += ")";
+  });
+  return out;
+}
+
+function printModuleImportDescr(n) {
+  var out = "";
+
+  if (n.type === "FuncImportDescr") {
+    out += "(";
+    out += "func";
+
+    if (isAnonymous(n.id) === false) {
+      out += space;
+      out += printIdentifier(n.id);
+    }
+
+    out += printSignature(n.signature);
+    out += ")";
+  }
+
+  if (n.type === "GlobalType") {
+    out += "(";
+    out += "global";
+    out += space;
+    out += printGlobalType(n);
+    out += ")";
+  }
+
+  if (n.type === "Table") {
+    out += printTable(n);
+  }
+
+  return out;
+}
+
+function printModuleImport(n) {
+  var out = "";
+  out += "(";
+  out += "import";
+  out += space;
+  out += quote(n.module);
+  out += space;
+  out += quote(n.name);
+  out += space;
+  out += printModuleImportDescr(n.descr);
+  out += ")";
+  return out;
+}
+
+function printGlobalType(n) {
+  var out = "";
+
+  if (n.mutability === "var") {
+    out += "(";
+    out += "mut";
+    out += space;
+    out += n.valtype;
+    out += ")";
+  } else {
+    out += n.valtype;
+  }
+
+  return out;
+}
+
+function printGlobal(n, depth) {
+  var out = "";
+  out += "(";
+  out += "global";
+  out += space;
+
+  if (n.name != null && isAnonymous(n.name) === false) {
+    out += printIdentifier(n.name);
+    out += space;
+  }
+
+  out += printGlobalType(n.globalType);
+  out += space;
+  n.init.forEach(function (i) {
+    out += printInstruction(i, depth + 1);
+  });
+  out += ")";
+  return out;
+}
+
+function printTable(n) {
+  var out = "";
+  out += "(";
+  out += "table";
+  out += space;
+
+  if (n.name != null && isAnonymous(n.name) === false) {
+    out += printIdentifier(n.name);
+    out += space;
+  }
+
+  out += printLimit(n.limits);
+  out += space;
+  out += n.elementType;
+  out += ")";
+  return out;
+}
+
+function printFuncParam(n) {
+  var out = "";
+
+  if (typeof n.id === "string") {
+    out += "$" + n.id;
+    out += space;
+  }
+
+  out += n.valtype;
+  return out;
+}
+
+function printFunc(n, depth) {
+  var out = "";
+  out += "(";
+  out += "func";
+
+  if (n.name != null) {
+    if (n.name.type === "Identifier" && isAnonymous(n.name) === false) {
+      out += space;
+      out += printIdentifier(n.name);
+    }
+  }
+
+  if (n.signature.type === "Signature") {
+    out += printSignature(n.signature);
+  } else {
+    var index = n.signature;
+    out += space;
+    out += "(";
+    out += "type";
+    out += space;
+    out += printIndex(index);
+    out += ")";
+  }
+
+  if (n.body.length > 0) {
+    // func is empty since we ignore the default end instruction
+    if (n.body.length === 1 && n.body[0].id === "end") {
+      out += ")";
+      return out;
+    }
+
+    if (compact === false) {
+      out += "\n";
+    }
+
+    n.body.forEach(function (i) {
+      if (i.id !== "end") {
+        out += indent(depth);
+        out += printInstruction(i, depth);
+
+        if (compact === false) {
+          out += "\n";
+        }
+      }
+    });
+    out += indent(depth - 1) + ")";
+  } else {
+    out += ")";
+  }
+
+  return out;
+}
+
+function printInstruction(n, depth) {
+  switch (n.type) {
+    case "Instr":
+      // $FlowIgnore
+      return printGenericInstruction(n, depth + 1);
+
+    case "BlockInstruction":
+      // $FlowIgnore
+      return printBlockInstruction(n, depth + 1);
+
+    case "IfInstruction":
+      // $FlowIgnore
+      return printIfInstruction(n, depth + 1);
+
+    case "CallInstruction":
+      // $FlowIgnore
+      return printCallInstruction(n, depth + 1);
+
+    case "CallIndirectInstruction":
+      // $FlowIgnore
+      return printCallIndirectIntruction(n, depth + 1);
+
+    case "LoopInstruction":
+      // $FlowIgnore
+      return printLoopInstruction(n, depth + 1);
+
+    default:
+      throw new Error("Unsupported instruction: " + JSON.stringify(n.type));
+  }
+}
+
+function printCallIndirectIntruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "call_indirect";
+
+  if (n.signature.type === "Signature") {
+    out += printSignature(n.signature);
+  } else if (n.signature.type === "Identifier") {
+    out += space;
+    out += "(";
+    out += "type";
+    out += space;
+    out += printIdentifier(n.signature);
+    out += ")";
+  } else {
+    throw new Error("CallIndirectInstruction: unsupported signature " + JSON.stringify(n.signature.type));
+  }
+
+  out += space;
+
+  if (n.intrs != null) {
+    // $FlowIgnore
+    n.intrs.forEach(function (i, index) {
+      // $FlowIgnore
+      out += printInstruction(i, depth + 1); // $FlowIgnore
+
+      if (index !== n.intrs.length - 1) {
+        out += space;
+      }
+    });
+  }
+
+  out += ")";
+  return out;
+}
+
+function printLoopInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "loop";
+
+  if (n.label != null && isAnonymous(n.label) === false) {
+    out += space;
+    out += printIdentifier(n.label);
+  }
+
+  if (typeof n.resulttype === "string") {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += n.resulttype;
+    out += ")";
+  }
+
+  if (n.instr.length > 0) {
+    n.instr.forEach(function (e) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(e, depth + 1);
+    });
+
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth - 1);
+    }
+  }
+
+  out += ")";
+  return out;
+}
+
+function printCallInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "call";
+  out += space;
+  out += printIndex(n.index);
+
+  if (_typeof(n.instrArgs) === "object") {
+    // $FlowIgnore
+    n.instrArgs.forEach(function (arg) {
+      out += space;
+      out += printFuncInstructionArg(arg, depth + 1);
+    });
+  }
+
+  out += ")";
+  return out;
+}
+
+function printIfInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "if";
+
+  if (n.testLabel != null && isAnonymous(n.testLabel) === false) {
+    out += space;
+    out += printIdentifier(n.testLabel);
+  }
+
+  if (typeof n.result === "string") {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += n.result;
+    out += ")";
+  }
+
+  if (n.test.length > 0) {
+    out += space;
+    n.test.forEach(function (i) {
+      out += printInstruction(i, depth + 1);
+    });
+  }
+
+  if (n.consequent.length > 0) {
+    if (compact === false) {
+      out += "\n";
+    }
+
+    out += indent(depth);
+    out += "(";
+    out += "then";
+    depth++;
+    n.consequent.forEach(function (i) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(i, depth + 1);
+    });
+    depth--;
+
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += ")";
+  } else {
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += "(";
+    out += "then";
+    out += ")";
+  }
+
+  if (n.alternate.length > 0) {
+    if (compact === false) {
+      out += "\n";
+    }
+
+    out += indent(depth);
+    out += "(";
+    out += "else";
+    depth++;
+    n.alternate.forEach(function (i) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(i, depth + 1);
+    });
+    depth--;
+
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += ")";
+  } else {
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += "(";
+    out += "else";
+    out += ")";
+  }
+
+  if (compact === false) {
+    out += "\n";
+    out += indent(depth - 1);
+  }
+
+  out += ")";
+  return out;
+}
+
+function printBlockInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "block";
+
+  if (n.label != null && isAnonymous(n.label) === false) {
+    out += space;
+    out += printIdentifier(n.label);
+  }
+
+  if (typeof n.result === "string") {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += n.result;
+    out += ")";
+  }
+
+  if (n.instr.length > 0) {
+    n.instr.forEach(function (i) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(i, depth + 1);
+    });
+
+    if (compact === false) {
+      out += "\n";
+    }
+
+    out += indent(depth - 1);
+    out += ")";
+  } else {
+    out += ")";
+  }
+
+  return out;
+}
+
+function printGenericInstruction(n, depth) {
+  var out = "";
+  out += "(";
+
+  if (typeof n.object === "string") {
+    out += n.object;
+    out += ".";
+  }
+
+  out += n.id;
+  n.args.forEach(function (arg) {
+    out += space;
+    out += printFuncInstructionArg(arg, depth + 1);
+  });
+  out += ")";
+  return out;
+}
+
+function printLongNumberLiteral(n) {
+  if (typeof n.raw === "string") {
+    return n.raw;
+  }
+
+  var _n$value = n.value,
+      low = _n$value.low,
+      high = _n$value.high;
+  var v = new Long(low, high);
+  return v.toString();
+}
+
+function printFloatLiteral(n) {
+  if (typeof n.raw === "string") {
+    return n.raw;
+  }
+
+  return String(n.value);
+}
+
+function printFuncInstructionArg(n, depth) {
+  var out = "";
+
+  if (n.type === "NumberLiteral") {
+    out += printNumberLiteral(n);
+  }
+
+  if (n.type === "LongNumberLiteral") {
+    out += printLongNumberLiteral(n);
+  }
+
+  if (n.type === "Identifier" && isAnonymous(n) === false) {
+    out += printIdentifier(n);
+  }
+
+  if (n.type === "ValtypeLiteral") {
+    out += n.name;
+  }
+
+  if (n.type === "FloatLiteral") {
+    out += printFloatLiteral(n);
+  }
+
+  if (isInstruction(n)) {
+    out += printInstruction(n, depth + 1);
+  }
+
+  return out;
+}
+
+function printNumberLiteral(n) {
+  if (typeof n.raw === "string") {
+    return n.raw;
+  }
+
+  return String(n.value);
+}
+
+function printModuleExport(n) {
+  var out = "";
+  out += "(";
+  out += "export";
+  out += space;
+  out += quote(n.name);
+
+  if (n.descr.exportType === "Func") {
+    out += space;
+    out += "(";
+    out += "func";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else if (n.descr.exportType === "Global") {
+    out += space;
+    out += "(";
+    out += "global";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else if (n.descr.exportType === "Memory" || n.descr.exportType === "Mem") {
+    out += space;
+    out += "(";
+    out += "memory";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else if (n.descr.exportType === "Table") {
+    out += space;
+    out += "(";
+    out += "table";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else {
+    throw new Error("printModuleExport: unknown type: " + n.descr.exportType);
+  }
+
+  out += ")";
+  return out;
+}
+
+function printIdentifier(n) {
+  return "$" + n.value;
+}
+
+function printIndex(n) {
+  if (n.type === "Identifier") {
+    return printIdentifier(n);
+  } else if (n.type === "NumberLiteral") {
+    return printNumberLiteral(n);
+  } else {
+    throw new Error("Unsupported index: " + n.type);
+  }
+}
+
+function printMemory(n) {
+  var out = "";
+  out += "(";
+  out += "memory";
+
+  if (n.id != null) {
+    out += space;
+    out += printIndex(n.id);
+    out += space;
+  }
+
+  out += printLimit(n.limits);
+  out += ")";
+  return out;
+}
+
+function printLimit(n) {
+  var out = "";
+  out += n.min + "";
+
+  if (n.max != null) {
+    out += space;
+    out += String(n.max);
+
+    if (n.shared === true) {
+      out += ' shared';
+    }
+  }
+
+  return out;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/lib/index.js b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/lib/index.js
new file mode 100644
index 0000000..d661b2c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/lib/index.js
@@ -0,0 +1,915 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.print = print;
+
+var _ast = require("@webassemblyjs/ast");
+
+var _long = _interopRequireDefault(require("@xtuc/long"));
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }
+
+var compact = false;
+var space = " ";
+
+var quote = function quote(str) {
+  return "\"".concat(str, "\"");
+};
+
+function indent(nb) {
+  return Array(nb).fill(space + space).join("");
+} // TODO(sven): allow arbitrary ast nodes
+
+
+function print(n) {
+  if (n.type === "Program") {
+    return printProgram(n, 0);
+  } else {
+    throw new Error("Unsupported node in print of type: " + String(n.type));
+  }
+}
+
+function printProgram(n, depth) {
+  return n.body.reduce(function (acc, child) {
+    if (child.type === "Module") {
+      acc += printModule(child, depth + 1);
+    }
+
+    if (child.type === "Func") {
+      acc += printFunc(child, depth + 1);
+    }
+
+    if (child.type === "BlockComment") {
+      acc += printBlockComment(child);
+    }
+
+    if (child.type === "LeadingComment") {
+      acc += printLeadingComment(child);
+    }
+
+    if (compact === false) {
+      acc += "\n";
+    }
+
+    return acc;
+  }, "");
+}
+
+function printTypeInstruction(n) {
+  var out = "";
+  out += "(";
+  out += "type";
+  out += space;
+
+  if (n.id != null) {
+    out += printIndex(n.id);
+    out += space;
+  }
+
+  out += "(";
+  out += "func";
+  n.functype.params.forEach(function (param) {
+    out += space;
+    out += "(";
+    out += "param";
+    out += space;
+    out += printFuncParam(param);
+    out += ")";
+  });
+  n.functype.results.forEach(function (result) {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += result;
+    out += ")";
+  });
+  out += ")"; // func
+
+  out += ")";
+  return out;
+}
+
+function printModule(n, depth) {
+  var out = "(";
+  out += "module";
+
+  if (typeof n.id === "string") {
+    out += space;
+    out += n.id;
+  }
+
+  if (compact === false) {
+    out += "\n";
+  } else {
+    out += space;
+  }
+
+  n.fields.forEach(function (field) {
+    if (compact === false) {
+      out += indent(depth);
+    }
+
+    switch (field.type) {
+      case "Func":
+        {
+          out += printFunc(field, depth + 1);
+          break;
+        }
+
+      case "TypeInstruction":
+        {
+          out += printTypeInstruction(field);
+          break;
+        }
+
+      case "Table":
+        {
+          out += printTable(field);
+          break;
+        }
+
+      case "Global":
+        {
+          out += printGlobal(field, depth + 1);
+          break;
+        }
+
+      case "ModuleExport":
+        {
+          out += printModuleExport(field);
+          break;
+        }
+
+      case "ModuleImport":
+        {
+          out += printModuleImport(field);
+          break;
+        }
+
+      case "Memory":
+        {
+          out += printMemory(field);
+          break;
+        }
+
+      case "BlockComment":
+        {
+          out += printBlockComment(field);
+          break;
+        }
+
+      case "LeadingComment":
+        {
+          out += printLeadingComment(field);
+          break;
+        }
+
+      case "Start":
+        {
+          out += printStart(field);
+          break;
+        }
+
+      case "Elem":
+        {
+          out += printElem(field, depth);
+          break;
+        }
+
+      case "Data":
+        {
+          out += printData(field, depth);
+          break;
+        }
+
+      default:
+        throw new Error("Unsupported node in printModule: " + String(field.type));
+    }
+
+    if (compact === false) {
+      out += "\n";
+    }
+  });
+  out += ")";
+  return out;
+}
+
+function printData(n, depth) {
+  var out = "";
+  out += "(";
+  out += "data";
+  out += space;
+  out += printIndex(n.memoryIndex);
+  out += space;
+  out += printInstruction(n.offset, depth);
+  out += space;
+  out += '"';
+  n.init.values.forEach(function (byte) {
+    // Avoid non-displayable characters
+    if (byte <= 31 || byte == 34 || byte == 92 || byte >= 127) {
+      out += "\\";
+      out += ("00" + byte.toString(16)).substr(-2);
+    } else if (byte > 255) {
+      throw new Error("Unsupported byte in data segment: " + byte);
+    } else {
+      out += String.fromCharCode(byte);
+    }
+  });
+  out += '"';
+  out += ")";
+  return out;
+}
+
+function printElem(n, depth) {
+  var out = "";
+  out += "(";
+  out += "elem";
+  out += space;
+  out += printIndex(n.table);
+
+  var _n$offset = _slicedToArray(n.offset, 1),
+      firstOffset = _n$offset[0];
+
+  out += space;
+  out += "(";
+  out += "offset";
+  out += space;
+  out += printInstruction(firstOffset, depth);
+  out += ")";
+  n.funcs.forEach(function (func) {
+    out += space;
+    out += printIndex(func);
+  });
+  out += ")";
+  return out;
+}
+
+function printStart(n) {
+  var out = "";
+  out += "(";
+  out += "start";
+  out += space;
+  out += printIndex(n.index);
+  out += ")";
+  return out;
+}
+
+function printLeadingComment(n) {
+  // Don't print leading comments in compact mode
+  if (compact === true) {
+    return "";
+  }
+
+  var out = "";
+  out += ";;";
+  out += n.value;
+  out += "\n";
+  return out;
+}
+
+function printBlockComment(n) {
+  // Don't print block comments in compact mode
+  if (compact === true) {
+    return "";
+  }
+
+  var out = "";
+  out += "(;";
+  out += n.value;
+  out += ";)";
+  out += "\n";
+  return out;
+}
+
+function printSignature(n) {
+  var out = "";
+  n.params.forEach(function (param) {
+    out += space;
+    out += "(";
+    out += "param";
+    out += space;
+    out += printFuncParam(param);
+    out += ")";
+  });
+  n.results.forEach(function (result) {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += result;
+    out += ")";
+  });
+  return out;
+}
+
+function printModuleImportDescr(n) {
+  var out = "";
+
+  if (n.type === "FuncImportDescr") {
+    out += "(";
+    out += "func";
+
+    if ((0, _ast.isAnonymous)(n.id) === false) {
+      out += space;
+      out += printIdentifier(n.id);
+    }
+
+    out += printSignature(n.signature);
+    out += ")";
+  }
+
+  if (n.type === "GlobalType") {
+    out += "(";
+    out += "global";
+    out += space;
+    out += printGlobalType(n);
+    out += ")";
+  }
+
+  if (n.type === "Table") {
+    out += printTable(n);
+  }
+
+  return out;
+}
+
+function printModuleImport(n) {
+  var out = "";
+  out += "(";
+  out += "import";
+  out += space;
+  out += quote(n.module);
+  out += space;
+  out += quote(n.name);
+  out += space;
+  out += printModuleImportDescr(n.descr);
+  out += ")";
+  return out;
+}
+
+function printGlobalType(n) {
+  var out = "";
+
+  if (n.mutability === "var") {
+    out += "(";
+    out += "mut";
+    out += space;
+    out += n.valtype;
+    out += ")";
+  } else {
+    out += n.valtype;
+  }
+
+  return out;
+}
+
+function printGlobal(n, depth) {
+  var out = "";
+  out += "(";
+  out += "global";
+  out += space;
+
+  if (n.name != null && (0, _ast.isAnonymous)(n.name) === false) {
+    out += printIdentifier(n.name);
+    out += space;
+  }
+
+  out += printGlobalType(n.globalType);
+  out += space;
+  n.init.forEach(function (i) {
+    out += printInstruction(i, depth + 1);
+  });
+  out += ")";
+  return out;
+}
+
+function printTable(n) {
+  var out = "";
+  out += "(";
+  out += "table";
+  out += space;
+
+  if (n.name != null && (0, _ast.isAnonymous)(n.name) === false) {
+    out += printIdentifier(n.name);
+    out += space;
+  }
+
+  out += printLimit(n.limits);
+  out += space;
+  out += n.elementType;
+  out += ")";
+  return out;
+}
+
+function printFuncParam(n) {
+  var out = "";
+
+  if (typeof n.id === "string") {
+    out += "$" + n.id;
+    out += space;
+  }
+
+  out += n.valtype;
+  return out;
+}
+
+function printFunc(n, depth) {
+  var out = "";
+  out += "(";
+  out += "func";
+
+  if (n.name != null) {
+    if (n.name.type === "Identifier" && (0, _ast.isAnonymous)(n.name) === false) {
+      out += space;
+      out += printIdentifier(n.name);
+    }
+  }
+
+  if (n.signature.type === "Signature") {
+    out += printSignature(n.signature);
+  } else {
+    var index = n.signature;
+    out += space;
+    out += "(";
+    out += "type";
+    out += space;
+    out += printIndex(index);
+    out += ")";
+  }
+
+  if (n.body.length > 0) {
+    // func is empty since we ignore the default end instruction
+    if (n.body.length === 1 && n.body[0].id === "end") {
+      out += ")";
+      return out;
+    }
+
+    if (compact === false) {
+      out += "\n";
+    }
+
+    n.body.forEach(function (i) {
+      if (i.id !== "end") {
+        out += indent(depth);
+        out += printInstruction(i, depth);
+
+        if (compact === false) {
+          out += "\n";
+        }
+      }
+    });
+    out += indent(depth - 1) + ")";
+  } else {
+    out += ")";
+  }
+
+  return out;
+}
+
+function printInstruction(n, depth) {
+  switch (n.type) {
+    case "Instr":
+      // $FlowIgnore
+      return printGenericInstruction(n, depth + 1);
+
+    case "BlockInstruction":
+      // $FlowIgnore
+      return printBlockInstruction(n, depth + 1);
+
+    case "IfInstruction":
+      // $FlowIgnore
+      return printIfInstruction(n, depth + 1);
+
+    case "CallInstruction":
+      // $FlowIgnore
+      return printCallInstruction(n, depth + 1);
+
+    case "CallIndirectInstruction":
+      // $FlowIgnore
+      return printCallIndirectIntruction(n, depth + 1);
+
+    case "LoopInstruction":
+      // $FlowIgnore
+      return printLoopInstruction(n, depth + 1);
+
+    default:
+      throw new Error("Unsupported instruction: " + JSON.stringify(n.type));
+  }
+}
+
+function printCallIndirectIntruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "call_indirect";
+
+  if (n.signature.type === "Signature") {
+    out += printSignature(n.signature);
+  } else if (n.signature.type === "Identifier") {
+    out += space;
+    out += "(";
+    out += "type";
+    out += space;
+    out += printIdentifier(n.signature);
+    out += ")";
+  } else {
+    throw new Error("CallIndirectInstruction: unsupported signature " + JSON.stringify(n.signature.type));
+  }
+
+  out += space;
+
+  if (n.intrs != null) {
+    // $FlowIgnore
+    n.intrs.forEach(function (i, index) {
+      // $FlowIgnore
+      out += printInstruction(i, depth + 1); // $FlowIgnore
+
+      if (index !== n.intrs.length - 1) {
+        out += space;
+      }
+    });
+  }
+
+  out += ")";
+  return out;
+}
+
+function printLoopInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "loop";
+
+  if (n.label != null && (0, _ast.isAnonymous)(n.label) === false) {
+    out += space;
+    out += printIdentifier(n.label);
+  }
+
+  if (typeof n.resulttype === "string") {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += n.resulttype;
+    out += ")";
+  }
+
+  if (n.instr.length > 0) {
+    n.instr.forEach(function (e) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(e, depth + 1);
+    });
+
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth - 1);
+    }
+  }
+
+  out += ")";
+  return out;
+}
+
+function printCallInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "call";
+  out += space;
+  out += printIndex(n.index);
+
+  if (_typeof(n.instrArgs) === "object") {
+    // $FlowIgnore
+    n.instrArgs.forEach(function (arg) {
+      out += space;
+      out += printFuncInstructionArg(arg, depth + 1);
+    });
+  }
+
+  out += ")";
+  return out;
+}
+
+function printIfInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "if";
+
+  if (n.testLabel != null && (0, _ast.isAnonymous)(n.testLabel) === false) {
+    out += space;
+    out += printIdentifier(n.testLabel);
+  }
+
+  if (typeof n.result === "string") {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += n.result;
+    out += ")";
+  }
+
+  if (n.test.length > 0) {
+    out += space;
+    n.test.forEach(function (i) {
+      out += printInstruction(i, depth + 1);
+    });
+  }
+
+  if (n.consequent.length > 0) {
+    if (compact === false) {
+      out += "\n";
+    }
+
+    out += indent(depth);
+    out += "(";
+    out += "then";
+    depth++;
+    n.consequent.forEach(function (i) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(i, depth + 1);
+    });
+    depth--;
+
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += ")";
+  } else {
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += "(";
+    out += "then";
+    out += ")";
+  }
+
+  if (n.alternate.length > 0) {
+    if (compact === false) {
+      out += "\n";
+    }
+
+    out += indent(depth);
+    out += "(";
+    out += "else";
+    depth++;
+    n.alternate.forEach(function (i) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(i, depth + 1);
+    });
+    depth--;
+
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += ")";
+  } else {
+    if (compact === false) {
+      out += "\n";
+      out += indent(depth);
+    }
+
+    out += "(";
+    out += "else";
+    out += ")";
+  }
+
+  if (compact === false) {
+    out += "\n";
+    out += indent(depth - 1);
+  }
+
+  out += ")";
+  return out;
+}
+
+function printBlockInstruction(n, depth) {
+  var out = "";
+  out += "(";
+  out += "block";
+
+  if (n.label != null && (0, _ast.isAnonymous)(n.label) === false) {
+    out += space;
+    out += printIdentifier(n.label);
+  }
+
+  if (typeof n.result === "string") {
+    out += space;
+    out += "(";
+    out += "result";
+    out += space;
+    out += n.result;
+    out += ")";
+  }
+
+  if (n.instr.length > 0) {
+    n.instr.forEach(function (i) {
+      if (compact === false) {
+        out += "\n";
+      }
+
+      out += indent(depth);
+      out += printInstruction(i, depth + 1);
+    });
+
+    if (compact === false) {
+      out += "\n";
+    }
+
+    out += indent(depth - 1);
+    out += ")";
+  } else {
+    out += ")";
+  }
+
+  return out;
+}
+
+function printGenericInstruction(n, depth) {
+  var out = "";
+  out += "(";
+
+  if (typeof n.object === "string") {
+    out += n.object;
+    out += ".";
+  }
+
+  out += n.id;
+  n.args.forEach(function (arg) {
+    out += space;
+    out += printFuncInstructionArg(arg, depth + 1);
+  });
+  out += ")";
+  return out;
+}
+
+function printLongNumberLiteral(n) {
+  if (typeof n.raw === "string") {
+    return n.raw;
+  }
+
+  var _n$value = n.value,
+      low = _n$value.low,
+      high = _n$value.high;
+  var v = new _long.default(low, high);
+  return v.toString();
+}
+
+function printFloatLiteral(n) {
+  if (typeof n.raw === "string") {
+    return n.raw;
+  }
+
+  return String(n.value);
+}
+
+function printFuncInstructionArg(n, depth) {
+  var out = "";
+
+  if (n.type === "NumberLiteral") {
+    out += printNumberLiteral(n);
+  }
+
+  if (n.type === "LongNumberLiteral") {
+    out += printLongNumberLiteral(n);
+  }
+
+  if (n.type === "Identifier" && (0, _ast.isAnonymous)(n) === false) {
+    out += printIdentifier(n);
+  }
+
+  if (n.type === "ValtypeLiteral") {
+    out += n.name;
+  }
+
+  if (n.type === "FloatLiteral") {
+    out += printFloatLiteral(n);
+  }
+
+  if ((0, _ast.isInstruction)(n)) {
+    out += printInstruction(n, depth + 1);
+  }
+
+  return out;
+}
+
+function printNumberLiteral(n) {
+  if (typeof n.raw === "string") {
+    return n.raw;
+  }
+
+  return String(n.value);
+}
+
+function printModuleExport(n) {
+  var out = "";
+  out += "(";
+  out += "export";
+  out += space;
+  out += quote(n.name);
+
+  if (n.descr.exportType === "Func") {
+    out += space;
+    out += "(";
+    out += "func";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else if (n.descr.exportType === "Global") {
+    out += space;
+    out += "(";
+    out += "global";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else if (n.descr.exportType === "Memory" || n.descr.exportType === "Mem") {
+    out += space;
+    out += "(";
+    out += "memory";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else if (n.descr.exportType === "Table") {
+    out += space;
+    out += "(";
+    out += "table";
+    out += space;
+    out += printIndex(n.descr.id);
+    out += ")";
+  } else {
+    throw new Error("printModuleExport: unknown type: " + n.descr.exportType);
+  }
+
+  out += ")";
+  return out;
+}
+
+function printIdentifier(n) {
+  return "$" + n.value;
+}
+
+function printIndex(n) {
+  if (n.type === "Identifier") {
+    return printIdentifier(n);
+  } else if (n.type === "NumberLiteral") {
+    return printNumberLiteral(n);
+  } else {
+    throw new Error("Unsupported index: " + n.type);
+  }
+}
+
+function printMemory(n) {
+  var out = "";
+  out += "(";
+  out += "memory";
+
+  if (n.id != null) {
+    out += space;
+    out += printIndex(n.id);
+    out += space;
+  }
+
+  out += printLimit(n.limits);
+  out += ")";
+  return out;
+}
+
+function printLimit(n) {
+  var out = "";
+  out += n.min + "";
+
+  if (n.max != null) {
+    out += space;
+    out += String(n.max);
+
+    if (n.shared === true) {
+      out += ' shared';
+    }
+  }
+
+  return out;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/package.json b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/package.json
new file mode 100644
index 0000000..1d48c18
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webassemblyjs/wast-printer/package.json
@@ -0,0 +1,36 @@
+{
+  "name": "@webassemblyjs/wast-printer",
+  "version": "1.11.1",
+  "description": "WebAssembly text format printer",
+  "main": "lib/index.js",
+  "module": "esm/index.js",
+  "keywords": [
+    "webassembly",
+    "javascript",
+    "ast",
+    "compiler",
+    "printer",
+    "wast"
+  ],
+  "scripts": {
+    "test": "mocha"
+  },
+  "author": "Sven Sauleau",
+  "license": "MIT",
+  "dependencies": {
+    "@webassemblyjs/ast": "1.11.1",
+    "@xtuc/long": "4.2.2"
+  },
+  "devDependencies": {
+    "@webassemblyjs/helper-test-framework": "1.11.1",
+    "@webassemblyjs/wast-parser": "1.11.1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/webassemblyjs.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "3f07e2db2031afe0ce686630418c542938c1674b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/README.md b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/README.md
new file mode 100644
index 0000000..07f991f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/README.md
@@ -0,0 +1,27 @@
+# webpack-cli configtest
+
+[![NPM Downloads][downloads]][downloads-url]
+
+## Description
+
+This package validates a webpack configuration.
+
+## Installation
+
+```bash
+#npm
+npm i -D @webpack-cli/configtest
+
+#yarn
+yarn add -D @webpack-cli/configtest
+
+```
+
+## Usage
+
+```bash
+npx webpack configtest [config-path]
+```
+
+[downloads]: https://img.shields.io/npm/dm/@webpack-cli/configtest.svg
+[downloads-url]: https://www.npmjs.com/package/@webpack-cli/configtest
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/lib/index.d.ts b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/lib/index.d.ts
new file mode 100644
index 0000000..524543f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/lib/index.d.ts
@@ -0,0 +1,4 @@
+declare class ConfigTestCommand {
+    apply(cli: any): Promise<void>;
+}
+export default ConfigTestCommand;
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/lib/index.js b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/lib/index.js
new file mode 100644
index 0000000..590be3d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/lib/index.js
@@ -0,0 +1,55 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const WEBPACK_PACKAGE = process.env.WEBPACK_PACKAGE || "webpack";
+class ConfigTestCommand {
+    // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types, @typescript-eslint/no-explicit-any
+    async apply(cli) {
+        await cli.makeCommand({
+            name: "configtest [config-path]",
+            alias: "t",
+            description: "Validate a webpack configuration.",
+            pkg: "@webpack-cli/configtest",
+            dependencies: [WEBPACK_PACKAGE],
+        }, [], async (configPath) => {
+            cli.webpack = await cli.loadWebpack();
+            const config = await cli.loadConfig(configPath ? { config: [configPath] } : {});
+            const configPaths = new Set();
+            if (Array.isArray(config.options)) {
+                // eslint-disable-next-line @typescript-eslint/no-explicit-any
+                config.options.forEach((options) => {
+                    if (config.path.get(options)) {
+                        configPaths.add(config.path.get(options));
+                    }
+                });
+            }
+            else {
+                if (config.path.get(config.options)) {
+                    configPaths.add(config.path.get(config.options));
+                }
+            }
+            if (configPaths.size === 0) {
+                cli.logger.error("No configuration found.");
+                process.exit(2);
+            }
+            cli.logger.info(`Validate '${Array.from(configPaths).join(" ,")}'.`);
+            try {
+                const error = cli.webpack.validate(config.options);
+                // TODO remove this after drop webpack@4
+                if (error && error.length > 0) {
+                    throw new cli.webpack.WebpackOptionsValidationError(error);
+                }
+            }
+            catch (error) {
+                if (cli.isValidationError(error)) {
+                    cli.logger.error(error.message);
+                }
+                else {
+                    cli.logger.error(error);
+                }
+                process.exit(2);
+            }
+            cli.logger.success("There are no validation errors in the given webpack configuration.");
+        });
+    }
+}
+exports.default = ConfigTestCommand;
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/package.json b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/package.json
new file mode 100644
index 0000000..517b565
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/configtest/package.json
@@ -0,0 +1,23 @@
+{
+  "name": "@webpack-cli/configtest",
+  "version": "1.1.1",
+  "description": "Validate a webpack configuration.",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "license": "MIT",
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/webpack/webpack-cli.git"
+  },
+  "homepage": "https://github.com/webpack/webpack-cli/tree/master/packages/configtest",
+  "files": [
+    "lib"
+  ],
+  "peerDependencies": {
+    "webpack": "4.x.x || 5.x.x",
+    "webpack-cli": "4.x.x"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/info/README.md b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/README.md
new file mode 100644
index 0000000..aa99d37
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/README.md
@@ -0,0 +1,50 @@
+# webpack-cli info
+
+[![NPM Downloads][downloads]][downloads-url]
+
+## Description
+
+This package returns a set of information related to the local environment.
+
+## Installation
+
+```bash
+#npm
+npm i -D @webpack-cli/info
+
+#yarn
+yarn add -D @webpack-cli/info
+
+```
+
+## Usage
+
+```bash
+#npx
+npx webpack info [options]
+
+#global installation
+webpack info [options]
+
+```
+
+### Args / Flags
+
+#### Output format
+
+| Flag                                  | Description                             | Type   |
+| ------------------------------------- | --------------------------------------- | ------ |
+| `-o, --output < json or markdown >`   | To get the output in a specified format | string |
+| `-a, --additional-package <value...>` | Adds additional packages to the output  | string |
+
+_Not supported for config_
+
+#### Options
+
+| Flag        | Description                                | Type    |
+| ----------- | ------------------------------------------ | ------- |
+| `--help`    | Show help                                  | boolean |
+| `--version` | Show version number of `@webpack-cli/info` | boolean |
+
+[downloads]: https://img.shields.io/npm/dm/@webpack-cli/info.svg
+[downloads-url]: https://www.npmjs.com/package/@webpack-cli/info
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/info/lib/index.d.ts b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/lib/index.d.ts
new file mode 100644
index 0000000..0d76246
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/lib/index.d.ts
@@ -0,0 +1,4 @@
+declare class InfoCommand {
+    apply(cli: any): Promise<void>;
+}
+export default InfoCommand;
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/info/lib/index.js b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/lib/index.js
new file mode 100644
index 0000000..1b03674
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/lib/index.js
@@ -0,0 +1,85 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const envinfo_1 = __importDefault(require("envinfo"));
+class InfoCommand {
+    // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types, @typescript-eslint/no-explicit-any
+    async apply(cli) {
+        await cli.makeCommand({
+            name: "info",
+            alias: "i",
+            description: "Outputs information about your system.",
+            usage: "[options]",
+            pkg: "@webpack-cli/info",
+        }, [
+            {
+                name: "output",
+                alias: "o",
+                configs: [
+                    {
+                        type: "string",
+                    },
+                ],
+                description: "To get the output in a specified format ( accept json or markdown )",
+            },
+            {
+                name: "additional-package",
+                alias: "a",
+                configs: [{ type: "string" }],
+                multiple: true,
+                description: "Adds additional packages to the output",
+            },
+        ], async (options) => {
+            let { output } = options;
+            const envinfoConfig = {};
+            if (output) {
+                // Remove quotes if exist
+                output = output.replace(/['"]+/g, "");
+                switch (output) {
+                    case "markdown":
+                        envinfoConfig["markdown"] = true;
+                        break;
+                    case "json":
+                        envinfoConfig["json"] = true;
+                        break;
+                    default:
+                        cli.logger.error(`'${output}' is not a valid value for output`);
+                        process.exit(2);
+                }
+            }
+            const defaultInformation = {
+                Binaries: ["Node", "Yarn", "npm"],
+                Browsers: [
+                    "Brave Browser",
+                    "Chrome",
+                    "Chrome Canary",
+                    "Edge",
+                    "Firefox",
+                    "Firefox Developer Edition",
+                    "Firefox Nightly",
+                    "Internet Explorer",
+                    "Safari",
+                    "Safari Technology Preview",
+                ],
+                Monorepos: ["Yarn Workspaces", "Lerna"],
+                System: ["OS", "CPU", "Memory"],
+                npmGlobalPackages: ["webpack", "webpack-cli", "webpack-dev-server"],
+                npmPackages: "{*webpack*,*loader*}",
+            };
+            let defaultPackages = ["webpack", "loader"];
+            if (typeof options.additionalPackage !== "undefined") {
+                defaultPackages = [...defaultPackages, ...options.additionalPackage];
+            }
+            defaultInformation.npmPackages = `{${defaultPackages
+                .map((item) => `*${item}*`)
+                .join(",")}}`;
+            let info = await envinfo_1.default.run(defaultInformation, envinfoConfig);
+            info = info.replace(/npmPackages/g, "Packages");
+            info = info.replace(/npmGlobalPackages/g, "Global Packages");
+            cli.logger.raw(info);
+        });
+    }
+}
+exports.default = InfoCommand;
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/info/package.json b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/package.json
new file mode 100644
index 0000000..49bd811
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/info/package.json
@@ -0,0 +1,29 @@
+{
+  "name": "@webpack-cli/info",
+  "version": "1.4.1",
+  "description": "Outputs info about system and webpack config",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "license": "MIT",
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/webpack/webpack-cli.git"
+  },
+  "homepage": "https://github.com/webpack/webpack-cli/tree/master/packages/info",
+  "files": [
+    "lib"
+  ],
+  "dependencies": {
+    "envinfo": "^7.7.3"
+  },
+  "gitHead": "fb50f766851f500ca12867a2aa9de81fa6e368f9",
+  "peerDependencies": {
+    "webpack-cli": "4.x.x"
+  },
+  "devDependencies": {
+    "@types/envinfo": "^7.8.1"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/README.md b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/README.md
new file mode 100644
index 0000000..4475746
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/README.md
@@ -0,0 +1,30 @@
+# webpack-cli serve
+
+[![NPM Downloads][downloads]][downloads-url]
+
+**This package is used by webpack-cli under-the-hood and is not intended for installation as of v0.2.0**
+
+## Description
+
+This package contains the logic to run [webpack-dev-server](https://github.com/webpack/webpack-dev-server) to serve your webpack app and provide live reloading.
+
+## Installation
+
+```bash
+npm i -D webpack-cli @webpack-cli/serve
+```
+
+## Usage
+
+### CLI (via `webpack-cli`)
+
+```bash
+npx webpack-cli serve
+```
+
+### Options
+
+Checkout [`SERVE-OPTIONS-v3.md`](https://github.com/webpack/webpack-cli/blob/master/SERVE-OPTIONS-v3.md) or [`SERVE-OPTIONS-v4.md`](https://github.com/webpack/webpack-cli/blob/master/SERVE-OPTIONS-v4.md) to see list of all available options for `serve` command for respective [`webpack-dev-server`](https://github.com/webpack/webpack-dev-server) version.
+
+[downloads]: https://img.shields.io/npm/dm/@webpack-cli/serve.svg
+[downloads-url]: https://www.npmjs.com/package/@webpack-cli/serve
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/index.d.ts b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/index.d.ts
new file mode 100644
index 0000000..021c429
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/index.d.ts
@@ -0,0 +1,4 @@
+declare class ServeCommand {
+    apply(cli: any): Promise<void>;
+}
+export default ServeCommand;
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/index.js b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/index.js
new file mode 100644
index 0000000..dec01c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/index.js
@@ -0,0 +1,280 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const WEBPACK_PACKAGE = process.env.WEBPACK_PACKAGE || "webpack";
+const WEBPACK_DEV_SERVER_PACKAGE = process.env.WEBPACK_DEV_SERVER_PACKAGE || "webpack-dev-server";
+class ServeCommand {
+    // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types, @typescript-eslint/no-explicit-any
+    async apply(cli) {
+        const loadDevServerOptions = () => {
+            // TODO simplify this after drop webpack v4 and webpack-dev-server v3
+            // eslint-disable-next-line @typescript-eslint/no-var-requires
+            const devServer = require(WEBPACK_DEV_SERVER_PACKAGE);
+            const isNewDevServerCLIAPI = typeof devServer.schema !== "undefined";
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            let options = {};
+            if (isNewDevServerCLIAPI) {
+                if (cli.webpack.cli && typeof cli.webpack.cli.getArguments === "function") {
+                    options = cli.webpack.cli.getArguments(devServer.schema);
+                }
+                else {
+                    options = devServer.cli.getArguments();
+                }
+            }
+            else {
+                options = require(`${WEBPACK_DEV_SERVER_PACKAGE}/bin/cli-flags`);
+            }
+            // Old options format
+            // { devServer: [{...}, {}...] }
+            // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+            // @ts-ignore
+            if (options.devServer) {
+                // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+                // @ts-ignore
+                return options.devServer;
+            }
+            // New options format
+            // { flag1: {}, flag2: {} }
+            return Object.keys(options).map((key) => {
+                options[key].name = key;
+                return options[key];
+            });
+        };
+        await cli.makeCommand({
+            name: "serve [entries...]",
+            alias: ["server", "s"],
+            description: "Run the webpack dev server.",
+            usage: "[entries...] [options]",
+            pkg: "@webpack-cli/serve",
+            dependencies: [WEBPACK_PACKAGE, WEBPACK_DEV_SERVER_PACKAGE],
+        }, async () => {
+            let devServerFlags = [];
+            cli.webpack = await cli.loadWebpack();
+            try {
+                devServerFlags = loadDevServerOptions();
+            }
+            catch (error) {
+                cli.logger.error(`You need to install 'webpack-dev-server' for running 'webpack serve'.\n${error}`);
+                process.exit(2);
+            }
+            const builtInOptions = cli.getBuiltInOptions().filter(
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            (option) => option.name !== "watch");
+            return [...builtInOptions, ...devServerFlags];
+        }, 
+        // eslint-disable-next-line @typescript-eslint/no-explicit-any
+        async (entries, options) => {
+            const builtInOptions = cli.getBuiltInOptions();
+            let devServerFlags = [];
+            try {
+                devServerFlags = loadDevServerOptions();
+            }
+            catch (error) {
+                // Nothing, to prevent future updates
+            }
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            const webpackCLIOptions = {};
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            const devServerCLIOptions = {};
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            const processors = [];
+            for (const optionName in options) {
+                const kebabedOption = cli.toKebabCase(optionName);
+                // `webpack-dev-server` has own logic for the `--hot` option
+                const isBuiltInOption = kebabedOption !== "hot" &&
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+                    builtInOptions.find((builtInOption) => builtInOption.name === kebabedOption);
+                if (isBuiltInOption) {
+                    webpackCLIOptions[optionName] = options[optionName];
+                }
+                else {
+                    const needToProcess = devServerFlags.find(
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+                    (devServerOption) => devServerOption.name === kebabedOption && devServerOption.processor);
+                    if (needToProcess) {
+                        processors.push(needToProcess.processor);
+                    }
+                    devServerCLIOptions[optionName] = options[optionName];
+                }
+            }
+            for (const processor of processors) {
+                processor(devServerCLIOptions);
+            }
+            if (entries.length > 0) {
+                webpackCLIOptions.entry = [...entries, ...(webpackCLIOptions.entry || [])];
+            }
+            webpackCLIOptions.argv = Object.assign(Object.assign({}, options), { env: Object.assign({ WEBPACK_SERVE: true }, options.env) });
+            const compiler = await cli.createCompiler(webpackCLIOptions);
+            if (!compiler) {
+                return;
+            }
+            const servers = [];
+            if (cli.needWatchStdin(compiler) || devServerCLIOptions.stdin) {
+                // TODO remove in the next major release
+                // Compatibility with old `stdin` option for `webpack-dev-server`
+                // Should be removed for the next major release on both sides
+                if (devServerCLIOptions.stdin) {
+                    delete devServerCLIOptions.stdin;
+                }
+                process.stdin.on("end", () => {
+                    Promise.all(servers.map((server) => {
+                        if (typeof server.stop === "function") {
+                            return server.stop();
+                        }
+                        // TODO remove in the next major release
+                        return new Promise((resolve) => {
+                            server.close(() => {
+                                resolve();
+                            });
+                        });
+                    })).then(() => {
+                        process.exit(0);
+                    });
+                });
+                process.stdin.resume();
+            }
+            // eslint-disable-next-line @typescript-eslint/no-var-requires
+            const DevServer = require(WEBPACK_DEV_SERVER_PACKAGE);
+            const isNewDevServerCLIAPI = typeof DevServer.schema !== "undefined";
+            let devServerVersion;
+            try {
+                // eslint-disable-next-line @typescript-eslint/no-var-requires
+                devServerVersion = require(`${WEBPACK_DEV_SERVER_PACKAGE}/package.json`).version;
+            }
+            catch (err) {
+                cli.logger.error(`You need to install 'webpack-dev-server' for running 'webpack serve'.\n${err}`);
+                process.exit(2);
+            }
+            const compilers = typeof compiler.compilers !== "undefined" ? compiler.compilers : [compiler];
+            const possibleCompilers = compilers.filter((compiler) => compiler.options.devServer);
+            const compilersForDevServer = possibleCompilers.length > 0 ? possibleCompilers : [compilers[0]];
+            const isDevServer4 = devServerVersion.startsWith("4");
+            const usedPorts = [];
+            for (const compilerForDevServer of compilersForDevServer) {
+                let devServerOptions;
+                if (isNewDevServerCLIAPI) {
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+                    const args = devServerFlags.reduce((accumulator, flag) => {
+                        accumulator[flag.name] = flag;
+                        return accumulator;
+                    }, {});
+                    const values = Object.keys(devServerCLIOptions).reduce(
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+                    (accumulator, name) => {
+                        const kebabName = cli.toKebabCase(name);
+                        if (args[kebabName]) {
+                            accumulator[kebabName] = options[name];
+                        }
+                        return accumulator;
+                    }, {});
+                    const result = Object.assign({}, (compilerForDevServer.options.devServer || {}));
+                    const problems = (cli.webpack.cli && typeof cli.webpack.cli.processArguments === "function"
+                        ? cli.webpack.cli
+                        : DevServer.cli).processArguments(args, result, values);
+                    if (problems) {
+                        const groupBy = (xs, key) => {
+                            return xs.reduce((rv, x) => {
+                                (rv[x[key]] = rv[x[key]] || []).push(x);
+                                return rv;
+                            }, {});
+                        };
+                        const problemsByPath = groupBy(problems, "path");
+                        for (const path in problemsByPath) {
+                            const problems = problemsByPath[path];
+                            problems.forEach((problem) => {
+                                cli.logger.error(`${cli.capitalizeFirstLetter(problem.type.replace(/-/g, " "))}${problem.value ? ` '${problem.value}'` : ""} for the '--${problem.argument}' option${problem.index ? ` by index '${problem.index}'` : ""}`);
+                                if (problem.expected) {
+                                    cli.logger.error(`Expected: '${problem.expected}'`);
+                                }
+                            });
+                        }
+                        process.exit(2);
+                    }
+                    devServerOptions = result;
+                }
+                else {
+                    // TODO remove in the next major release
+                    const mergeOptions = (devServerOptions, devServerCliOptions) => {
+                        // CLI options should take precedence over devServer options,
+                        // and CLI options should have no default values included
+                        const options = Object.assign(Object.assign({}, devServerOptions), devServerCliOptions);
+                        if (devServerOptions.client && devServerCliOptions.client) {
+                            // the user could set some client options in their devServer config,
+                            // then also specify client options on the CLI
+                            options.client = Object.assign(Object.assign({}, devServerOptions.client), devServerCliOptions.client);
+                        }
+                        return options;
+                    };
+                    devServerOptions = mergeOptions(compilerForDevServer.options.devServer || {}, devServerCLIOptions);
+                }
+                // TODO remove in the next major release
+                if (!isDevServer4) {
+                    const getPublicPathOption = () => {
+                        const normalizePublicPath = (publicPath) => typeof publicPath === "undefined" || publicPath === "auto" ? "/" : publicPath;
+                        if (options.outputPublicPath) {
+                            return normalizePublicPath(compilerForDevServer.options.output.publicPath);
+                        }
+                        if (devServerOptions.publicPath) {
+                            // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+                            // @ts-ignore
+                            return normalizePublicPath(devServerOptions.publicPath);
+                        }
+                        return normalizePublicPath(compilerForDevServer.options.output.publicPath);
+                    };
+                    const getStatsOption = () => {
+                        if (options.stats) {
+                            return options.stats;
+                        }
+                        if (devServerOptions.stats) {
+                            return devServerOptions.stats;
+                        }
+                        return compilerForDevServer.options.stats;
+                    };
+                    devServerOptions.host = devServerOptions.host || "localhost";
+                    devServerOptions.port =
+                        typeof devServerOptions.port !== "undefined" ? devServerOptions.port : 8080;
+                    devServerOptions.stats = getStatsOption();
+                    devServerOptions.publicPath = getPublicPathOption();
+                }
+                if (devServerOptions.port) {
+                    const portNumber = Number(devServerOptions.port);
+                    if (usedPorts.find((port) => portNumber === port)) {
+                        throw new Error("Unique ports must be specified for each devServer option in your webpack configuration. Alternatively, run only 1 devServer config using the --config-name flag to specify your desired config.");
+                    }
+                    usedPorts.push(portNumber);
+                }
+                try {
+                    let server;
+                    // TODO: remove after dropping webpack-dev-server@v3
+                    if (isDevServer4) {
+                        server = new DevServer(devServerOptions, compiler);
+                    }
+                    else {
+                        server = new DevServer(compiler, devServerOptions);
+                    }
+                    if (typeof server.start === "function") {
+                        await server.start();
+                    }
+                    else {
+                        // TODO remove in the next major release
+                        server.listen(devServerOptions.port, devServerOptions.host, (error) => {
+                            if (error) {
+                                throw error;
+                            }
+                        });
+                    }
+                    servers.push(server);
+                }
+                catch (error) {
+                    if (cli.isValidationError(error)) {
+                        cli.logger.error(error.message);
+                    }
+                    else {
+                        cli.logger.error(error);
+                    }
+                    process.exit(2);
+                }
+            }
+        });
+    }
+}
+exports.default = ServeCommand;
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/types.d.ts b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/types.d.ts
new file mode 100644
index 0000000..c004023
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/types.d.ts
@@ -0,0 +1,91 @@
+export declare type devServerOptionsType = {
+    allowedHosts?: string[] | allowedHostsEnum;
+    bonjour?: boolean | Record<string, any>;
+    client?: false | devServerClientOptions;
+    compress?: boolean;
+    dev?: Record<string, any>;
+    devMiddleware?: Record<string, any>;
+    firewall?: boolean | string[];
+    headers?: Record<string, unknown> | ((request: any, response: any, middlewareContext: any) => Record<string, any>);
+    historyApiFallback?: boolean | Record<string, unknown>;
+    host?: string | null | hostEnum;
+    hot?: boolean | hotOptionEnum;
+    http2?: boolean;
+    https?: boolean | Record<string, unknown>;
+    injectClient?: boolean | (() => void);
+    injectHot?: boolean | (() => void);
+    ipc?: string | true;
+    liveReload?: boolean;
+    onAfterSetupMiddleware?: () => void;
+    onBeforeSetupMiddleware?: () => void;
+    onListening?: () => void;
+    open?: string | boolean | openOptionObject;
+    openPage?: string | string[];
+    overlay?: boolean | Record<string, unknown>;
+    port?: number | string | null;
+    profile?: boolean;
+    progress?: boolean;
+    proxy?: Record<string, unknown> | (Record<string, unknown> | (() => void))[];
+    public?: string;
+    setupExitSignals?: boolean;
+    static?: boolean | string | Record<string, unknown> | (string | Record<string, unknown>)[];
+    transportMode?: Record<string, unknown> | string;
+    useLocalIp?: boolean;
+    publicPath?: string | (() => void);
+    stats?: string | boolean;
+    watchFiles?: string | Record<string, unknown>;
+    webSocketServer?: false | string | transportModeEnum | (() => any) | Record<string, unknown> | (Record<string, unknown> | (() => void))[];
+};
+declare enum hotOptionEnum {
+    only = "only"
+}
+declare enum hostEnum {
+    LocalIp = "local-ip",
+    LocalIpv4 = "local-ipv4",
+    LocalIpv6 = "local-ipv6"
+}
+declare enum allowedHostsEnum {
+    Auto = "auto",
+    All = "all"
+}
+declare enum transportModeEnum {
+    SockJS = "sockjs",
+    Ws = "ws"
+}
+declare type devServerClientOptions = {
+    host?: string;
+    path?: string;
+    port?: string | number | null;
+    needClientEntry?: boolean | (() => void);
+    needHotEntry?: boolean | (() => void);
+    logging?: devServerClientLogging;
+    overlay?: boolean | clientOverlay;
+    progress?: boolean;
+    webSocketTransport?: string | transportModeEnum;
+    webSocketURL?: string | webSocketURLOptions;
+};
+declare type webSocketURLOptions = {
+    hostname?: string;
+    pathname?: string;
+    port?: string | number;
+    password?: string;
+    protocol?: string | "auto";
+    username?: string;
+};
+declare type openOptionObject = {
+    target?: string;
+    app?: string;
+};
+declare type clientOverlay = {
+    errors?: boolean;
+    warnings?: boolean;
+};
+declare enum devServerClientLogging {
+    none = "none",
+    error = "error",
+    warn = "warn",
+    info = "info",
+    log = "log",
+    verbose = "verbose"
+}
+export {};
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/types.js b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/types.js
new file mode 100644
index 0000000..d7aa322
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/lib/types.js
@@ -0,0 +1,31 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var hotOptionEnum;
+(function (hotOptionEnum) {
+    hotOptionEnum["only"] = "only";
+})(hotOptionEnum || (hotOptionEnum = {}));
+var hostEnum;
+(function (hostEnum) {
+    hostEnum["LocalIp"] = "local-ip";
+    hostEnum["LocalIpv4"] = "local-ipv4";
+    hostEnum["LocalIpv6"] = "local-ipv6";
+})(hostEnum || (hostEnum = {}));
+var allowedHostsEnum;
+(function (allowedHostsEnum) {
+    allowedHostsEnum["Auto"] = "auto";
+    allowedHostsEnum["All"] = "all";
+})(allowedHostsEnum || (allowedHostsEnum = {}));
+var transportModeEnum;
+(function (transportModeEnum) {
+    transportModeEnum["SockJS"] = "sockjs";
+    transportModeEnum["Ws"] = "ws";
+})(transportModeEnum || (transportModeEnum = {}));
+var devServerClientLogging;
+(function (devServerClientLogging) {
+    devServerClientLogging["none"] = "none";
+    devServerClientLogging["error"] = "error";
+    devServerClientLogging["warn"] = "warn";
+    devServerClientLogging["info"] = "info";
+    devServerClientLogging["log"] = "log";
+    devServerClientLogging["verbose"] = "verbose";
+})(devServerClientLogging || (devServerClientLogging = {}));
diff --git a/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/package.json b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/package.json
new file mode 100644
index 0000000..93c532d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@webpack-cli/serve/package.json
@@ -0,0 +1,29 @@
+{
+  "name": "@webpack-cli/serve",
+  "version": "1.6.1",
+  "description": "",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "keywords": [],
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/webpack/webpack-cli.git"
+  },
+  "homepage": "https://github.com/webpack/webpack-cli/tree/master/packages/serve",
+  "license": "MIT",
+  "files": [
+    "lib"
+  ],
+  "peerDependencies": {
+    "webpack-cli": "4.x.x"
+  },
+  "peerDependenciesMeta": {
+    "webpack-dev-server": {
+      "optional": true
+    }
+  },
+  "gitHead": "fb50f766851f500ca12867a2aa9de81fa6e368f9"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/LICENSE b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/LICENSE
new file mode 100644
index 0000000..f37a2eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/LICENSE
@@ -0,0 +1,28 @@
+Copyright (c) 2008, Fair Oaks Labs, Inc.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+   this list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+ * Neither the name of Fair Oaks Labs, Inc. nor the names of its contributors
+   may be used to endorse or promote products derived from this software
+   without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/README.md b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/README.md
new file mode 100644
index 0000000..cb7527b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/README.md
@@ -0,0 +1,51 @@
+# ieee754 [![travis][travis-image]][travis-url] [![npm][npm-image]][npm-url] [![downloads][downloads-image]][downloads-url] [![javascript style guide][standard-image]][standard-url]
+
+[travis-image]: https://img.shields.io/travis/feross/ieee754/master.svg
+[travis-url]: https://travis-ci.org/feross/ieee754
+[npm-image]: https://img.shields.io/npm/v/ieee754.svg
+[npm-url]: https://npmjs.org/package/ieee754
+[downloads-image]: https://img.shields.io/npm/dm/ieee754.svg
+[downloads-url]: https://npmjs.org/package/ieee754
+[standard-image]: https://img.shields.io/badge/code_style-standard-brightgreen.svg
+[standard-url]: https://standardjs.com
+
+[![saucelabs][saucelabs-image]][saucelabs-url]
+
+[saucelabs-image]: https://saucelabs.com/browser-matrix/ieee754.svg
+[saucelabs-url]: https://saucelabs.com/u/ieee754
+
+### Read/write IEEE754 floating point numbers from/to a Buffer or array-like object.
+
+## install
+
+```
+npm install ieee754
+```
+
+## methods
+
+`var ieee754 = require('ieee754')`
+
+The `ieee754` object has the following functions:
+
+```
+ieee754.read = function (buffer, offset, isLE, mLen, nBytes)
+ieee754.write = function (buffer, value, offset, isLE, mLen, nBytes)
+```
+
+The arguments mean the following:
+
+- buffer = the buffer
+- offset = offset into the buffer
+- value = value to set (only for `write`)
+- isLe = is little endian?
+- mLen = mantissa length
+- nBytes = number of bytes
+
+## what is ieee754?
+
+The IEEE Standard for Floating-Point Arithmetic (IEEE 754) is a technical standard for floating-point computation. [Read more](http://en.wikipedia.org/wiki/IEEE_floating_point).
+
+## license
+
+BSD 3 Clause. Copyright (c) 2008, Fair Oaks Labs, Inc.
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/dist/.gitkeep b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/dist/.gitkeep
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/dist/index.cjs.js b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/dist/index.cjs.js
new file mode 100644
index 0000000..46b7381
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/dist/index.cjs.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.read = read;
+exports.write = write;
+
+function read(buffer, offset, isLE, mLen, nBytes) {
+  var e, m;
+  var eLen = nBytes * 8 - mLen - 1;
+  var eMax = (1 << eLen) - 1;
+  var eBias = eMax >> 1;
+  var nBits = -7;
+  var i = isLE ? nBytes - 1 : 0;
+  var d = isLE ? -1 : 1;
+  var s = buffer[offset + i];
+  i += d;
+  e = s & (1 << -nBits) - 1;
+  s >>= -nBits;
+  nBits += eLen;
+
+  for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {}
+
+  m = e & (1 << -nBits) - 1;
+  e >>= -nBits;
+  nBits += mLen;
+
+  for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {}
+
+  if (e === 0) {
+    e = 1 - eBias;
+  } else if (e === eMax) {
+    return m ? NaN : (s ? -1 : 1) * Infinity;
+  } else {
+    m = m + Math.pow(2, mLen);
+    e = e - eBias;
+  }
+
+  return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
+}
+
+function write(buffer, value, offset, isLE, mLen, nBytes) {
+  var e, m, c;
+  var eLen = nBytes * 8 - mLen - 1;
+  var eMax = (1 << eLen) - 1;
+  var eBias = eMax >> 1;
+  var rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
+  var i = isLE ? 0 : nBytes - 1;
+  var d = isLE ? 1 : -1;
+  var s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0;
+  value = Math.abs(value);
+
+  if (isNaN(value) || value === Infinity) {
+    m = isNaN(value) ? 1 : 0;
+    e = eMax;
+  } else {
+    e = Math.floor(Math.log(value) / Math.LN2);
+
+    if (value * (c = Math.pow(2, -e)) < 1) {
+      e--;
+      c *= 2;
+    }
+
+    if (e + eBias >= 1) {
+      value += rt / c;
+    } else {
+      value += rt * Math.pow(2, 1 - eBias);
+    }
+
+    if (value * c >= 2) {
+      e++;
+      c /= 2;
+    }
+
+    if (e + eBias >= eMax) {
+      m = 0;
+      e = eMax;
+    } else if (e + eBias >= 1) {
+      m = (value * c - 1) * Math.pow(2, mLen);
+      e = e + eBias;
+    } else {
+      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
+      e = 0;
+    }
+  }
+
+  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
+
+  e = e << mLen | m;
+  eLen += mLen;
+
+  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
+
+  buffer[offset + i - d] |= s * 128;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/index.js b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/index.js
new file mode 100644
index 0000000..f294ac0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/index.js
@@ -0,0 +1,84 @@
+export function read(buffer, offset, isLE, mLen, nBytes) {
+  var e, m
+  var eLen = (nBytes * 8) - mLen - 1
+  var eMax = (1 << eLen) - 1
+  var eBias = eMax >> 1
+  var nBits = -7
+  var i = isLE ? (nBytes - 1) : 0
+  var d = isLE ? -1 : 1
+  var s = buffer[offset + i]
+
+  i += d
+
+  e = s & ((1 << (-nBits)) - 1)
+  s >>= (-nBits)
+  nBits += eLen
+  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}
+
+  m = e & ((1 << (-nBits)) - 1)
+  e >>= (-nBits)
+  nBits += mLen
+  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}
+
+  if (e === 0) {
+    e = 1 - eBias
+  } else if (e === eMax) {
+    return m ? NaN : ((s ? -1 : 1) * Infinity)
+  } else {
+    m = m + Math.pow(2, mLen)
+    e = e - eBias
+  }
+  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
+}
+
+export function write(buffer, value, offset, isLE, mLen, nBytes) {
+  var e, m, c
+  var eLen = (nBytes * 8) - mLen - 1
+  var eMax = (1 << eLen) - 1
+  var eBias = eMax >> 1
+  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)
+  var i = isLE ? 0 : (nBytes - 1)
+  var d = isLE ? 1 : -1
+  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0
+
+  value = Math.abs(value)
+
+  if (isNaN(value) || value === Infinity) {
+    m = isNaN(value) ? 1 : 0
+    e = eMax
+  } else {
+    e = Math.floor(Math.log(value) / Math.LN2)
+    if (value * (c = Math.pow(2, -e)) < 1) {
+      e--
+      c *= 2
+    }
+    if (e + eBias >= 1) {
+      value += rt / c
+    } else {
+      value += rt * Math.pow(2, 1 - eBias)
+    }
+    if (value * c >= 2) {
+      e++
+      c /= 2
+    }
+
+    if (e + eBias >= eMax) {
+      m = 0
+      e = eMax
+    } else if (e + eBias >= 1) {
+      m = ((value * c) - 1) * Math.pow(2, mLen)
+      e = e + eBias
+    } else {
+      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
+      e = 0
+    }
+  }
+
+  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
+
+  e = (e << mLen) | m
+  eLen += mLen
+  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
+
+  buffer[offset + i - d] |= s * 128
+}
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/package.json b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/package.json
new file mode 100644
index 0000000..f4e33ac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/ieee754/package.json
@@ -0,0 +1,42 @@
+{
+  "name": "@xtuc/ieee754",
+  "description": "Read/write IEEE754 floating point numbers from/to a Buffer or array-like object",
+  "version": "1.2.0",
+  "author": {
+    "name": "Feross Aboukhadijeh",
+    "email": "feross@feross.org",
+    "url": "http://feross.org"
+  },
+  "contributors": [
+    "Romain Beauxis <toots@rastageeks.org>"
+  ],
+  "devDependencies": {
+    "airtap": "0.0.7",
+    "standard": "*",
+    "tape": "^4.0.0",
+    "@babel/cli": "^7.0.0-beta.54",
+    "@babel/core": "^7.0.0-beta.54",
+    "@babel/plugin-transform-modules-commonjs": "^7.0.0-beta.54"
+  },
+  "keywords": [
+    "IEEE 754",
+    "buffer",
+    "convert",
+    "floating point",
+    "ieee754"
+  ],
+  "license": "BSD-3-Clause",
+  "main": "dist/index.cjs.js",
+  "module": "index.js",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/feross/ieee754.git"
+  },
+  "scripts": {
+    "test": "standard && npm run test-node && npm run test-browser",
+    "test-browser": "airtap -- test/*.js",
+    "test-browser-local": "airtap --local -- test/*.js",
+    "test-node": "tape test/*.js"
+  },
+  "prepublish": "babel --plugins @babel/plugin-transform-modules-commonjs index.js -o dist/index.cjs.js"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/LICENSE b/node_modules/mathjs/examples/node_modules/@xtuc/long/LICENSE
new file mode 100644
index 0000000..d645695
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/LICENSE
@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/README.md b/node_modules/mathjs/examples/node_modules/@xtuc/long/README.md
new file mode 100644
index 0000000..dd96ae6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/README.md
@@ -0,0 +1,257 @@
+long.js
+=======
+
+A Long class for representing a 64 bit two's-complement integer value derived from the [Closure Library](https://github.com/google/closure-library)
+for stand-alone use and extended with unsigned support.
+
+[![npm](https://img.shields.io/npm/v/long.svg)](https://www.npmjs.com/package/long) [![Build Status](https://travis-ci.org/dcodeIO/long.js.svg)](https://travis-ci.org/dcodeIO/long.js)
+
+Background
+----------
+
+As of [ECMA-262 5th Edition](http://ecma262-5.com/ELS5_HTML.htm#Section_8.5), "all the positive and negative integers
+whose magnitude is no greater than 2<sup>53</sup> are representable in the Number type", which is "representing the
+doubleprecision 64-bit format IEEE 754 values as specified in the IEEE Standard for Binary Floating-Point Arithmetic".
+The [maximum safe integer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/MAX_SAFE_INTEGER)
+in JavaScript is 2<sup>53</sup>-1.
+
+Example: 2<sup>64</sup>-1 is 1844674407370955**1615** but in JavaScript it evaluates to 1844674407370955**2000**.
+
+Furthermore, bitwise operators in JavaScript "deal only with integers in the range −2<sup>31</sup> through
+2<sup>31</sup>−1, inclusive, or in the range 0 through 2<sup>32</sup>−1, inclusive. These operators accept any value of
+the Number type but first convert each such value to one of 2<sup>32</sup> integer values."
+
+In some use cases, however, it is required to be able to reliably work with and perform bitwise operations on the full
+64 bits. This is where long.js comes into play.
+
+Usage
+-----
+
+The class is compatible with CommonJS and AMD loaders and is exposed globally as `Long` if neither is available.
+
+```javascript
+var Long = require("long");
+
+var longVal = new Long(0xFFFFFFFF, 0x7FFFFFFF);
+
+console.log(longVal.toString());
+...
+```
+
+API
+---
+
+### Constructor
+
+* new **Long**(low: `number`, high: `number`, unsigned?: `boolean`)<br />
+  Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers. See the from* functions below for more convenient ways of constructing Longs.
+
+### Fields
+
+* Long#**low**: `number`<br />
+  The low 32 bits as a signed value.
+
+* Long#**high**: `number`<br />
+  The high 32 bits as a signed value.
+
+* Long#**unsigned**: `boolean`<br />
+  Whether unsigned or not.
+
+### Constants
+
+* Long.**ZERO**: `Long`<br />
+  Signed zero.
+
+* Long.**ONE**: `Long`<br />
+  Signed one.
+
+* Long.**NEG_ONE**: `Long`<br />
+  Signed negative one.
+
+* Long.**UZERO**: `Long`<br />
+  Unsigned zero.
+
+* Long.**UONE**: `Long`<br />
+  Unsigned one.
+
+* Long.**MAX_VALUE**: `Long`<br />
+  Maximum signed value.
+
+* Long.**MIN_VALUE**: `Long`<br />
+  Minimum signed value.
+
+* Long.**MAX_UNSIGNED_VALUE**: `Long`<br />
+  Maximum unsigned value.
+
+### Utility
+
+* Long.**isLong**(obj: `*`): `boolean`<br />
+  Tests if the specified object is a Long.
+
+* Long.**fromBits**(lowBits: `number`, highBits: `number`, unsigned?: `boolean`): `Long`<br />
+  Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is assumed to use 32 bits.
+
+* Long.**fromBytes**(bytes: `number[]`, unsigned?: `boolean`, le?: `boolean`): `Long`<br />
+  Creates a Long from its byte representation.
+
+* Long.**fromBytesLE**(bytes: `number[]`, unsigned?: `boolean`): `Long`<br />
+  Creates a Long from its little endian byte representation.
+
+* Long.**fromBytesBE**(bytes: `number[]`, unsigned?: `boolean`): `Long`<br />
+  Creates a Long from its big endian byte representation.
+
+* Long.**fromInt**(value: `number`, unsigned?: `boolean`): `Long`<br />
+  Returns a Long representing the given 32 bit integer value.
+
+* Long.**fromNumber**(value: `number`, unsigned?: `boolean`): `Long`<br />
+  Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+
+* Long.**fromString**(str: `string`, unsigned?: `boolean`, radix?: `number`)<br />
+  Long.**fromString**(str: `string`, radix: `number`)<br />
+  Returns a Long representation of the given string, written using the specified radix.
+
+* Long.**fromValue**(val: `*`, unsigned?: `boolean`): `Long`<br />
+  Converts the specified value to a Long using the appropriate from* function for its type.
+
+### Methods
+
+* Long#**add**(addend: `Long | number | string`): `Long`<br />
+  Returns the sum of this and the specified Long.
+
+* Long#**and**(other: `Long | number | string`): `Long`<br />
+  Returns the bitwise AND of this Long and the specified.
+
+* Long#**compare**/**comp**(other: `Long | number | string`): `number`<br />
+  Compares this Long's value with the specified's. Returns `0` if they are the same, `1` if the this is greater and `-1` if the given one is greater.
+
+* Long#**divide**/**div**(divisor: `Long | number | string`): `Long`<br />
+  Returns this Long divided by the specified.
+
+* Long#**equals**/**eq**(other: `Long | number | string`): `boolean`<br />
+  Tests if this Long's value equals the specified's.
+
+* Long#**getHighBits**(): `number`<br />
+  Gets the high 32 bits as a signed integer.
+
+* Long#**getHighBitsUnsigned**(): `number`<br />
+  Gets the high 32 bits as an unsigned integer.
+
+* Long#**getLowBits**(): `number`<br />
+  Gets the low 32 bits as a signed integer.
+
+* Long#**getLowBitsUnsigned**(): `number`<br />
+  Gets the low 32 bits as an unsigned integer.
+
+* Long#**getNumBitsAbs**(): `number`<br />
+  Gets the number of bits needed to represent the absolute value of this Long.
+
+* Long#**greaterThan**/**gt**(other: `Long | number | string`): `boolean`<br />
+  Tests if this Long's value is greater than the specified's.
+
+* Long#**greaterThanOrEqual**/**gte**/**ge**(other: `Long | number | string`): `boolean`<br />
+  Tests if this Long's value is greater than or equal the specified's.
+
+* Long#**isEven**(): `boolean`<br />
+  Tests if this Long's value is even.
+
+* Long#**isNegative**(): `boolean`<br />
+  Tests if this Long's value is negative.
+
+* Long#**isOdd**(): `boolean`<br />
+  Tests if this Long's value is odd.
+
+* Long#**isPositive**(): `boolean`<br />
+  Tests if this Long's value is positive.
+
+* Long#**isZero**/**eqz**(): `boolean`<br />
+  Tests if this Long's value equals zero.
+
+* Long#**lessThan**/**lt**(other: `Long | number | string`): `boolean`<br />
+  Tests if this Long's value is less than the specified's.
+
+* Long#**lessThanOrEqual**/**lte**/**le**(other: `Long | number | string`): `boolean`<br />
+  Tests if this Long's value is less than or equal the specified's.
+
+* Long#**modulo**/**mod**/**rem**(divisor: `Long | number | string`): `Long`<br />
+  Returns this Long modulo the specified.
+
+* Long#**multiply**/**mul**(multiplier: `Long | number | string`): `Long`<br />
+  Returns the product of this and the specified Long.
+
+* Long#**negate**/**neg**(): `Long`<br />
+  Negates this Long's value.
+
+* Long#**not**(): `Long`<br />
+  Returns the bitwise NOT of this Long.
+
+* Long#**notEquals**/**neq**/**ne**(other: `Long | number | string`): `boolean`<br />
+  Tests if this Long's value differs from the specified's.
+
+* Long#**or**(other: `Long | number | string`): `Long`<br />
+  Returns the bitwise OR of this Long and the specified.
+
+* Long#**shiftLeft**/**shl**(numBits: `Long | number | string`): `Long`<br />
+  Returns this Long with bits shifted to the left by the given amount.
+
+* Long#**shiftRight**/**shr**(numBits: `Long | number | string`): `Long`<br />
+  Returns this Long with bits arithmetically shifted to the right by the given amount.
+
+* Long#**shiftRightUnsigned**/**shru**/**shr_u**(numBits: `Long | number | string`): `Long`<br />
+  Returns this Long with bits logically shifted to the right by the given amount.
+
+* Long#**rotateLeft**/**rotl**(numBits: `Long | number | string`): `Long`<br />
+  Returns this Long with bits rotated to the left by the given amount.
+
+* Long#**rotateRight**/**rotr**(numBits: `Long | number | string`): `Long`<br />
+  Returns this Long with bits rotated to the right by the given amount.
+
+* Long#**subtract**/**sub**(subtrahend: `Long | number | string`): `Long`<br />
+  Returns the difference of this and the specified Long.
+
+* Long#**toBytes**(le?: `boolean`): `number[]`<br />
+  Converts this Long to its byte representation.
+
+* Long#**toBytesLE**(): `number[]`<br />
+  Converts this Long to its little endian byte representation.
+
+* Long#**toBytesBE**(): `number[]`<br />
+  Converts this Long to its big endian byte representation.
+
+* Long#**toInt**(): `number`<br />
+  Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.
+
+* Long#**toNumber**(): `number`<br />
+  Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).
+
+* Long#**toSigned**(): `Long`<br />
+  Converts this Long to signed.
+
+* Long#**toString**(radix?: `number`): `string`<br />
+  Converts the Long to a string written in the specified radix.
+
+* Long#**toUnsigned**(): `Long`<br />
+  Converts this Long to unsigned.
+
+* Long#**xor**(other: `Long | number | string`): `Long`<br />
+  Returns the bitwise XOR of this Long and the given one.
+
+WebAssembly support
+-------------------
+
+[WebAssembly](http://webassembly.org) supports 64-bit integer arithmetic out of the box, hence a [tiny WebAssembly module](./src/wasm.wat) is used to compute operations like multiplication, division and remainder more efficiently (slow operations like division are around twice as fast), falling back to floating point based computations in JavaScript where WebAssembly is not yet supported, e.g., in older versions of node.
+
+Building
+--------
+
+To build an UMD bundle to `dist/long.js`, run:
+
+```
+$> npm install
+$> npm run build
+```
+
+Running the [tests](./tests):
+
+```
+$> npm test
+```
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/dist/long.js b/node_modules/mathjs/examples/node_modules/@xtuc/long/dist/long.js
new file mode 100644
index 0000000..71370a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/dist/long.js
@@ -0,0 +1,2 @@
+!function(t,i){"object"==typeof exports&&"object"==typeof module?module.exports=i():"function"==typeof define&&define.amd?define([],i):"object"==typeof exports?exports.Long=i():t.Long=i()}("undefined"!=typeof self?self:this,function(){return function(t){function i(h){if(n[h])return n[h].exports;var e=n[h]={i:h,l:!1,exports:{}};return t[h].call(e.exports,e,e.exports,i),e.l=!0,e.exports}var n={};return i.m=t,i.c=n,i.d=function(t,n,h){i.o(t,n)||Object.defineProperty(t,n,{configurable:!1,enumerable:!0,get:h})},i.n=function(t){var n=t&&t.__esModule?function(){return t.default}:function(){return t};return i.d(n,"a",n),n},i.o=function(t,i){return Object.prototype.hasOwnProperty.call(t,i)},i.p="",i(i.s=0)}([function(t,i){function n(t,i,n){this.low=0|t,this.high=0|i,this.unsigned=!!n}function h(t){return!0===(t&&t.__isLong__)}function e(t,i){var n,h,e;return i?(t>>>=0,(e=0<=t&&t<256)&&(h=l[t])?h:(n=r(t,(0|t)<0?-1:0,!0),e&&(l[t]=n),n)):(t|=0,(e=-128<=t&&t<128)&&(h=f[t])?h:(n=r(t,t<0?-1:0,!1),e&&(f[t]=n),n))}function s(t,i){if(isNaN(t))return i?p:m;if(i){if(t<0)return p;if(t>=c)return q}else{if(t<=-w)return _;if(t+1>=w)return E}return t<0?s(-t,i).neg():r(t%d|0,t/d|0,i)}function r(t,i,h){return new n(t,i,h)}function o(t,i,n){if(0===t.length)throw Error("empty string");if("NaN"===t||"Infinity"===t||"+Infinity"===t||"-Infinity"===t)return m;if("number"==typeof i?(n=i,i=!1):i=!!i,(n=n||10)<2||36<n)throw RangeError("radix");var h;if((h=t.indexOf("-"))>0)throw Error("interior hyphen");if(0===h)return o(t.substring(1),i,n).neg();for(var e=s(a(n,8)),r=m,u=0;u<t.length;u+=8){var g=Math.min(8,t.length-u),f=parseInt(t.substring(u,u+g),n);if(g<8){var l=s(a(n,g));r=r.mul(l).add(s(f))}else r=r.mul(e),r=r.add(s(f))}return r.unsigned=i,r}function u(t,i){return"number"==typeof t?s(t,i):"string"==typeof t?o(t,i):r(t.low,t.high,"boolean"==typeof i?i:t.unsigned)}t.exports=n;var g=null;try{g=new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([0,97,115,109,1,0,0,0,1,13,2,96,0,1,127,96,4,127,127,127,127,1,127,3,7,6,0,1,1,1,1,1,6,6,1,127,1,65,0,11,7,50,6,3,109,117,108,0,1,5,100,105,118,95,115,0,2,5,100,105,118,95,117,0,3,5,114,101,109,95,115,0,4,5,114,101,109,95,117,0,5,8,103,101,116,95,104,105,103,104,0,0,10,191,1,6,4,0,35,0,11,36,1,1,126,32,0,173,32,1,173,66,32,134,132,32,2,173,32,3,173,66,32,134,132,126,34,4,66,32,135,167,36,0,32,4,167,11,36,1,1,126,32,0,173,32,1,173,66,32,134,132,32,2,173,32,3,173,66,32,134,132,127,34,4,66,32,135,167,36,0,32,4,167,11,36,1,1,126,32,0,173,32,1,173,66,32,134,132,32,2,173,32,3,173,66,32,134,132,128,34,4,66,32,135,167,36,0,32,4,167,11,36,1,1,126,32,0,173,32,1,173,66,32,134,132,32,2,173,32,3,173,66,32,134,132,129,34,4,66,32,135,167,36,0,32,4,167,11,36,1,1,126,32,0,173,32,1,173,66,32,134,132,32,2,173,32,3,173,66,32,134,132,130,34,4,66,32,135,167,36,0,32,4,167,11])),{}).exports}catch(t){}n.prototype.__isLong__,Object.defineProperty(n.prototype,"__isLong__",{value:!0}),n.isLong=h;var f={},l={};n.fromInt=e,n.fromNumber=s,n.fromBits=r;var a=Math.pow;n.fromString=o,n.fromValue=u;var d=4294967296,c=d*d,w=c/2,v=e(1<<24),m=e(0);n.ZERO=m;var p=e(0,!0);n.UZERO=p;var y=e(1);n.ONE=y;var b=e(1,!0);n.UONE=b;var N=e(-1);n.NEG_ONE=N;var E=r(-1,2147483647,!1);n.MAX_VALUE=E;var q=r(-1,-1,!0);n.MAX_UNSIGNED_VALUE=q;var _=r(0,-2147483648,!1);n.MIN_VALUE=_;var B=n.prototype;B.toInt=function(){return this.unsigned?this.low>>>0:this.low},B.toNumber=function(){return this.unsigned?(this.high>>>0)*d+(this.low>>>0):this.high*d+(this.low>>>0)},B.toString=function(t){if((t=t||10)<2||36<t)throw RangeError("radix");if(this.isZero())return"0";if(this.isNegative()){if(this.eq(_)){var i=s(t),n=this.div(i),h=n.mul(i).sub(this);return n.toString(t)+h.toInt().toString(t)}return"-"+this.neg().toString(t)}for(var e=s(a(t,6),this.unsigned),r=this,o="";;){var u=r.div(e),g=r.sub(u.mul(e)).toInt()>>>0,f=g.toString(t);if(r=u,r.isZero())return f+o;for(;f.length<6;)f="0"+f;o=""+f+o}},B.getHighBits=function(){return this.high},B.getHighBitsUnsigned=function(){return this.high>>>0},B.getLowBits=function(){return this.low},B.getLowBitsUnsigned=function(){return this.low>>>0},B.getNumBitsAbs=function(){if(this.isNegative())return this.eq(_)?64:this.neg().getNumBitsAbs();for(var t=0!=this.high?this.high:this.low,i=31;i>0&&0==(t&1<<i);i--);return 0!=this.high?i+33:i+1},B.isZero=function(){return 0===this.high&&0===this.low},B.eqz=B.isZero,B.isNegative=function(){return!this.unsigned&&this.high<0},B.isPositive=function(){return this.unsigned||this.high>=0},B.isOdd=function(){return 1==(1&this.low)},B.isEven=function(){return 0==(1&this.low)},B.equals=function(t){return h(t)||(t=u(t)),(this.unsigned===t.unsigned||this.high>>>31!=1||t.high>>>31!=1)&&(this.high===t.high&&this.low===t.low)},B.eq=B.equals,B.notEquals=function(t){return!this.eq(t)},B.neq=B.notEquals,B.ne=B.notEquals,B.lessThan=function(t){return this.comp(t)<0},B.lt=B.lessThan,B.lessThanOrEqual=function(t){return this.comp(t)<=0},B.lte=B.lessThanOrEqual,B.le=B.lessThanOrEqual,B.greaterThan=function(t){return this.comp(t)>0},B.gt=B.greaterThan,B.greaterThanOrEqual=function(t){return this.comp(t)>=0},B.gte=B.greaterThanOrEqual,B.ge=B.greaterThanOrEqual,B.compare=function(t){if(h(t)||(t=u(t)),this.eq(t))return 0;var i=this.isNegative(),n=t.isNegative();return i&&!n?-1:!i&&n?1:this.unsigned?t.high>>>0>this.high>>>0||t.high===this.high&&t.low>>>0>this.low>>>0?-1:1:this.sub(t).isNegative()?-1:1},B.comp=B.compare,B.negate=function(){return!this.unsigned&&this.eq(_)?_:this.not().add(y)},B.neg=B.negate,B.add=function(t){h(t)||(t=u(t));var i=this.high>>>16,n=65535&this.high,e=this.low>>>16,s=65535&this.low,o=t.high>>>16,g=65535&t.high,f=t.low>>>16,l=65535&t.low,a=0,d=0,c=0,w=0;return w+=s+l,c+=w>>>16,w&=65535,c+=e+f,d+=c>>>16,c&=65535,d+=n+g,a+=d>>>16,d&=65535,a+=i+o,a&=65535,r(c<<16|w,a<<16|d,this.unsigned)},B.subtract=function(t){return h(t)||(t=u(t)),this.add(t.neg())},B.sub=B.subtract,B.multiply=function(t){if(this.isZero())return m;if(h(t)||(t=u(t)),g){return r(g.mul(this.low,this.high,t.low,t.high),g.get_high(),this.unsigned)}if(t.isZero())return m;if(this.eq(_))return t.isOdd()?_:m;if(t.eq(_))return this.isOdd()?_:m;if(this.isNegative())return t.isNegative()?this.neg().mul(t.neg()):this.neg().mul(t).neg();if(t.isNegative())return this.mul(t.neg()).neg();if(this.lt(v)&&t.lt(v))return s(this.toNumber()*t.toNumber(),this.unsigned);var i=this.high>>>16,n=65535&this.high,e=this.low>>>16,o=65535&this.low,f=t.high>>>16,l=65535&t.high,a=t.low>>>16,d=65535&t.low,c=0,w=0,p=0,y=0;return y+=o*d,p+=y>>>16,y&=65535,p+=e*d,w+=p>>>16,p&=65535,p+=o*a,w+=p>>>16,p&=65535,w+=n*d,c+=w>>>16,w&=65535,w+=e*a,c+=w>>>16,w&=65535,w+=o*l,c+=w>>>16,w&=65535,c+=i*d+n*a+e*l+o*f,c&=65535,r(p<<16|y,c<<16|w,this.unsigned)},B.mul=B.multiply,B.divide=function(t){if(h(t)||(t=u(t)),t.isZero())throw Error("division by zero");if(g){if(!this.unsigned&&-2147483648===this.high&&-1===t.low&&-1===t.high)return this;return r((this.unsigned?g.div_u:g.div_s)(this.low,this.high,t.low,t.high),g.get_high(),this.unsigned)}if(this.isZero())return this.unsigned?p:m;var i,n,e;if(this.unsigned){if(t.unsigned||(t=t.toUnsigned()),t.gt(this))return p;if(t.gt(this.shru(1)))return b;e=p}else{if(this.eq(_)){if(t.eq(y)||t.eq(N))return _;if(t.eq(_))return y;return i=this.shr(1).div(t).shl(1),i.eq(m)?t.isNegative()?y:N:(n=this.sub(t.mul(i)),e=i.add(n.div(t)))}if(t.eq(_))return this.unsigned?p:m;if(this.isNegative())return t.isNegative()?this.neg().div(t.neg()):this.neg().div(t).neg();if(t.isNegative())return this.div(t.neg()).neg();e=m}for(n=this;n.gte(t);){i=Math.max(1,Math.floor(n.toNumber()/t.toNumber()));for(var o=Math.ceil(Math.log(i)/Math.LN2),f=o<=48?1:a(2,o-48),l=s(i),d=l.mul(t);d.isNegative()||d.gt(n);)i-=f,l=s(i,this.unsigned),d=l.mul(t);l.isZero()&&(l=y),e=e.add(l),n=n.sub(d)}return e},B.div=B.divide,B.modulo=function(t){if(h(t)||(t=u(t)),g){return r((this.unsigned?g.rem_u:g.rem_s)(this.low,this.high,t.low,t.high),g.get_high(),this.unsigned)}return this.sub(this.div(t).mul(t))},B.mod=B.modulo,B.rem=B.modulo,B.not=function(){return r(~this.low,~this.high,this.unsigned)},B.and=function(t){return h(t)||(t=u(t)),r(this.low&t.low,this.high&t.high,this.unsigned)},B.or=function(t){return h(t)||(t=u(t)),r(this.low|t.low,this.high|t.high,this.unsigned)},B.xor=function(t){return h(t)||(t=u(t)),r(this.low^t.low,this.high^t.high,this.unsigned)},B.shiftLeft=function(t){return h(t)&&(t=t.toInt()),0==(t&=63)?this:t<32?r(this.low<<t,this.high<<t|this.low>>>32-t,this.unsigned):r(0,this.low<<t-32,this.unsigned)},B.shl=B.shiftLeft,B.shiftRight=function(t){return h(t)&&(t=t.toInt()),0==(t&=63)?this:t<32?r(this.low>>>t|this.high<<32-t,this.high>>t,this.unsigned):r(this.high>>t-32,this.high>=0?0:-1,this.unsigned)},B.shr=B.shiftRight,B.shiftRightUnsigned=function(t){return h(t)&&(t=t.toInt()),0==(t&=63)?this:t<32?r(this.low>>>t|this.high<<32-t,this.high>>>t,this.unsigned):32===t?r(this.high,0,this.unsigned):r(this.high>>>t-32,0,this.unsigned)},B.shru=B.shiftRightUnsigned,B.shr_u=B.shiftRightUnsigned,B.rotateLeft=function(t){var i;return h(t)&&(t=t.toInt()),0==(t&=63)?this:32===t?r(this.high,this.low,this.unsigned):t<32?(i=32-t,r(this.low<<t|this.high>>>i,this.high<<t|this.low>>>i,this.unsigned)):(t-=32,i=32-t,r(this.high<<t|this.low>>>i,this.low<<t|this.high>>>i,this.unsigned))},B.rotl=B.rotateLeft,B.rotateRight=function(t){var i;return h(t)&&(t=t.toInt()),0==(t&=63)?this:32===t?r(this.high,this.low,this.unsigned):t<32?(i=32-t,r(this.high<<i|this.low>>>t,this.low<<i|this.high>>>t,this.unsigned)):(t-=32,i=32-t,r(this.low<<i|this.high>>>t,this.high<<i|this.low>>>t,this.unsigned))},B.rotr=B.rotateRight,B.toSigned=function(){return this.unsigned?r(this.low,this.high,!1):this},B.toUnsigned=function(){return this.unsigned?this:r(this.low,this.high,!0)},B.toBytes=function(t){return t?this.toBytesLE():this.toBytesBE()},B.toBytesLE=function(){var t=this.high,i=this.low;return[255&i,i>>>8&255,i>>>16&255,i>>>24,255&t,t>>>8&255,t>>>16&255,t>>>24]},B.toBytesBE=function(){var t=this.high,i=this.low;return[t>>>24,t>>>16&255,t>>>8&255,255&t,i>>>24,i>>>16&255,i>>>8&255,255&i]},n.fromBytes=function(t,i,h){return h?n.fromBytesLE(t,i):n.fromBytesBE(t,i)},n.fromBytesLE=function(t,i){return new n(t[0]|t[1]<<8|t[2]<<16|t[3]<<24,t[4]|t[5]<<8|t[6]<<16|t[7]<<24,i)},n.fromBytesBE=function(t,i){return new n(t[4]<<24|t[5]<<16|t[6]<<8|t[7],t[0]<<24|t[1]<<16|t[2]<<8|t[3],i)}}])});
+//# sourceMappingURL=long.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/dist/long.js.map b/node_modules/mathjs/examples/node_modules/@xtuc/long/dist/long.js.map
new file mode 100644
index 0000000..6a3d702
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/dist/long.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///long.js","webpack:///webpack/bootstrap f96e8d1360c0487f2545","webpack:///./src/long.js"],"names":["root","factory","exports","module","define","amd","self","this","modules","__webpack_require__","moduleId","installedModules","i","l","call","m","c","d","name","getter","o","Object","defineProperty","configurable","enumerable","get","n","__esModule","object","property","prototype","hasOwnProperty","p","s","Long","low","high","unsigned","isLong","obj","fromInt","value","cachedObj","cache","UINT_CACHE","fromBits","INT_CACHE","fromNumber","isNaN","UZERO","ZERO","TWO_PWR_64_DBL","MAX_UNSIGNED_VALUE","TWO_PWR_63_DBL","MIN_VALUE","MAX_VALUE","neg","TWO_PWR_32_DBL","lowBits","highBits","fromString","str","radix","length","Error","RangeError","indexOf","substring","radixToPower","pow_dbl","result","size","Math","min","parseInt","power","mul","add","fromValue","val","wasm","WebAssembly","Instance","Module","Uint8Array","e","__isLong__","pow","TWO_PWR_16_DBL","TWO_PWR_24","ONE","UONE","NEG_ONE","LongPrototype","toInt","toNumber","toString","isZero","isNegative","eq","radixLong","div","rem1","sub","rem","remDiv","intval","digits","getHighBits","getHighBitsUnsigned","getLowBits","getLowBitsUnsigned","getNumBitsAbs","bit","eqz","isPositive","isOdd","isEven","equals","other","notEquals","neq","ne","lessThan","comp","lt","lessThanOrEqual","lte","le","greaterThan","gt","greaterThanOrEqual","gte","ge","compare","thisNeg","otherNeg","negate","not","addend","a48","a32","a16","a00","b48","b32","b16","b00","c48","c32","c16","c00","subtract","subtrahend","multiply","multiplier","divide","divisor","approx","res","toUnsigned","shru","shr","shl","max","floor","log2","ceil","log","LN2","delta","approxRes","approxRem","modulo","mod","and","or","xor","shiftLeft","numBits","shiftRight","shiftRightUnsigned","shr_u","rotateLeft","b","rotl","rotateRight","rotr","toSigned","toBytes","toBytesLE","toBytesBE","hi","lo","fromBytes","bytes","fromBytesLE","fromBytesBE"],"mappings":"CAAA,SAAAA,EAAAC,GACA,gBAAAC,UAAA,gBAAAC,QACAA,OAAAD,QAAAD,IACA,kBAAAG,gBAAAC,IACAD,UAAAH,GACA,gBAAAC,SACAA,QAAA,KAAAD,IAEAD,EAAA,KAAAC,KACC,mBAAAK,WAAAC,KAAA,WACD,MCAgB,UAAUC,GCN1B,QAAAC,GAAAC,GAGA,GAAAC,EAAAD,GACA,MAAAC,GAAAD,GAAAR,OAGA,IAAAC,GAAAQ,EAAAD,IACAE,EAAAF,EACAG,GAAA,EACAX,WAUA,OANAM,GAAAE,GAAAI,KAAAX,EAAAD,QAAAC,IAAAD,QAAAO,GAGAN,EAAAU,GAAA,EAGAV,EAAAD,QAvBA,GAAAS,KA4DA,OAhCAF,GAAAM,EAAAP,EAGAC,EAAAO,EAAAL,EAGAF,EAAAQ,EAAA,SAAAf,EAAAgB,EAAAC,GACAV,EAAAW,EAAAlB,EAAAgB,IACAG,OAAAC,eAAApB,EAAAgB,GACAK,cAAA,EACAC,YAAA,EACAC,IAAAN,KAMAV,EAAAiB,EAAA,SAAAvB,GACA,GAAAgB,GAAAhB,KAAAwB,WACA,WAA2B,MAAAxB,GAAA,SAC3B,WAAiC,MAAAA,GAEjC,OADAM,GAAAQ,EAAAE,EAAA,IAAAA,GACAA,GAIAV,EAAAW,EAAA,SAAAQ,EAAAC,GAAsD,MAAAR,QAAAS,UAAAC,eAAAjB,KAAAc,EAAAC,IAGtDpB,EAAAuB,EAAA,GAGAvB,IAAAwB,EAAA,KDgBM,SAAU9B,EAAQD,GEpDxB,QAAAgC,GAAAC,EAAAC,EAAAC,GAMA9B,KAAA4B,IAAA,EAAAA,EAMA5B,KAAA6B,KAAA,EAAAA,EAMA7B,KAAA8B,aAoCA,QAAAC,GAAAC,GACA,YAAAA,KAAA,YA+BA,QAAAC,GAAAC,EAAAJ,GACA,GAAAE,GAAAG,EAAAC,CACA,OAAAN,IACAI,KAAA,GACAE,EAAA,GAAAF,KAAA,OACAC,EAAAE,EAAAH,IAEAC,GAEAH,EAAAM,EAAAJ,GAAA,EAAAA,GAAA,WACAE,IACAC,EAAAH,GAAAF,GACAA,KAEAE,GAAA,GACAE,GAAA,KAAAF,KAAA,OACAC,EAAAI,EAAAL,IAEAC,GAEAH,EAAAM,EAAAJ,IAAA,WACAE,IACAG,EAAAL,GAAAF,GACAA,IAmBA,QAAAQ,GAAAN,EAAAJ,GACA,GAAAW,MAAAP,GACA,MAAAJ,GAAAY,EAAAC,CACA,IAAAb,EAAA,CACA,GAAAI,EAAA,EACA,MAAAQ,EACA,IAAAR,GAAAU,EACA,MAAAC,OACK,CACL,GAAAX,IAAAY,EACA,MAAAC,EACA,IAAAb,EAAA,GAAAY,EACA,MAAAE,GAEA,MAAAd,GAAA,EACAM,GAAAN,EAAAJ,GAAAmB,MACAX,EAAAJ,EAAAgB,EAAA,EAAAhB,EAAAgB,EAAA,EAAApB,GAmBA,QAAAQ,GAAAa,EAAAC,EAAAtB,GACA,UAAAH,GAAAwB,EAAAC,EAAAtB,GA8BA,QAAAuB,GAAAC,EAAAxB,EAAAyB,GACA,OAAAD,EAAAE,OACA,KAAAC,OAAA,eACA,YAAAH,GAAA,aAAAA,GAAA,cAAAA,GAAA,cAAAA,EACA,MAAAX,EASA,IARA,gBAAAb,IAEAyB,EAAAzB,EACAA,GAAA,GAEAA,OAEAyB,KAAA,IACA,MAAAA,EACA,KAAAG,YAAA,QAEA,IAAAjC,EACA,KAAAA,EAAA6B,EAAAK,QAAA,QACA,KAAAF,OAAA,kBACA,QAAAhC,EACA,MAAA4B,GAAAC,EAAAM,UAAA,GAAA9B,EAAAyB,GAAAN,KAQA,QAHAY,GAAArB,EAAAsB,EAAAP,EAAA,IAEAQ,EAAApB,EACAtC,EAAA,EAAmBA,EAAAiD,EAAAE,OAAgBnD,GAAA,GACnC,GAAA2D,GAAAC,KAAAC,IAAA,EAAAZ,EAAAE,OAAAnD,GACA6B,EAAAiC,SAAAb,EAAAM,UAAAvD,IAAA2D,GAAAT,EACA,IAAAS,EAAA,GACA,GAAAI,GAAA5B,EAAAsB,EAAAP,EAAAS,GACAD,KAAAM,IAAAD,GAAAE,IAAA9B,EAAAN,QAEA6B,KAAAM,IAAAR,GACAE,IAAAO,IAAA9B,EAAAN,IAIA,MADA6B,GAAAjC,WACAiC,EAoBA,QAAAQ,GAAAC,EAAA1C,GACA,sBAAA0C,GACAhC,EAAAgC,EAAA1C,GACA,gBAAA0C,GACAnB,EAAAmB,EAAA1C,GAEAQ,EAAAkC,EAAA5C,IAAA4C,EAAA3C,KAAA,iBAAAC,KAAA0C,EAAA1C,UA7RAlC,EAAAD,QAAAgC,CAKA,IAAA8C,GAAA,IAEA,KACAA,EAAA,GAAAC,aAAAC,SAAA,GAAAD,aAAAE,OAAA,GAAAC,aACA,u2BACSlF,QACR,MAAAmF,IA0DDnD,EAAAJ,UAAAwD,WAEAjE,OAAAC,eAAAY,EAAAJ,UAAA,cAAqDW,OAAA,IAkBrDP,EAAAI,QAOA,IAAAQ,MAOAF,IA0CAV,GAAAM,UAkCAN,EAAAa,aAsBAb,EAAAW,UASA,IAAAwB,GAAAG,KAAAe,GA4DArD,GAAA0B,aAyBA1B,EAAA4C,WAUA,IAcArB,GAAA+B,WAOArC,EAAAM,IAOAJ,EAAAF,EAAA,EAOAsC,EAAAjD,EA5BA,OAkCAU,EAAAV,EAAA,EAMAN,GAAAgB,MAMA,IAAAD,GAAAT,EAAA,KAMAN,GAAAe,OAMA,IAAAyC,GAAAlD,EAAA,EAMAN,GAAAwD,KAMA,IAAAC,GAAAnD,EAAA,KAMAN,GAAAyD,MAMA,IAAAC,GAAApD,GAAA,EAMAN,GAAA0D,SAMA,IAAArC,GAAAV,GAAA,gBAMAX,GAAAqB,WAMA,IAAAH,GAAAP,GAAA,QAMAX,GAAAkB,oBAMA,IAAAE,GAAAT,EAAA,iBAMAX,GAAAoB,WAMA,IAAAuC,GAAA3D,EAAAJ,SAOA+D,GAAAC,MAAA,WACA,MAAAvF,MAAA8B,SAAA9B,KAAA4B,MAAA,EAAA5B,KAAA4B,KAQA0D,EAAAE,SAAA,WACA,MAAAxF,MAAA8B,UACA9B,KAAA6B,OAAA,GAAAqB,GAAAlD,KAAA4B,MAAA,GACA5B,KAAA6B,KAAAqB,GAAAlD,KAAA4B,MAAA,IAWA0D,EAAAG,SAAA,SAAAlC,GAEA,IADAA,KAAA,IACA,MAAAA,EACA,KAAAG,YAAA,QACA,IAAA1D,KAAA0F,SACA,SACA,IAAA1F,KAAA2F,aAAA,CACA,GAAA3F,KAAA4F,GAAA7C,GAAA,CAGA,GAAA8C,GAAArD,EAAAe,GACAuC,EAAA9F,KAAA8F,IAAAD,GACAE,EAAAD,EAAAzB,IAAAwB,GAAAG,IAAAhG,KACA,OAAA8F,GAAAL,SAAAlC,GAAAwC,EAAAR,QAAAE,SAAAlC,GAEA,UAAAvD,KAAAiD,MAAAwC,SAAAlC,GAQA,IAHA,GAAAM,GAAArB,EAAAsB,EAAAP,EAAA,GAAAvD,KAAA8B,UACAmE,EAAAjG,KACA+D,EAAA,KACA,CACA,GAAAmC,GAAAD,EAAAH,IAAAjC,GACAsC,EAAAF,EAAAD,IAAAE,EAAA7B,IAAAR,IAAA0B,UAAA,EACAa,EAAAD,EAAAV,SAAAlC,EAEA,IADA0C,EAAAC,EACAD,EAAAP,SACA,MAAAU,GAAArC,CAEA,MAAAqC,EAAA5C,OAAA,GACA4C,EAAA,IAAAA,CACArC,GAAA,GAAAqC,EAAArC,IAUAuB,EAAAe,YAAA,WACA,MAAArG,MAAA6B,MAQAyD,EAAAgB,oBAAA,WACA,MAAAtG,MAAA6B,OAAA,GAQAyD,EAAAiB,WAAA,WACA,MAAAvG,MAAA4B,KAQA0D,EAAAkB,mBAAA,WACA,MAAAxG,MAAA4B,MAAA,GAQA0D,EAAAmB,cAAA,WACA,GAAAzG,KAAA2F,aACA,MAAA3F,MAAA4F,GAAA7C,GAAA,GAAA/C,KAAAiD,MAAAwD,eAEA,QADAjC,GAAA,GAAAxE,KAAA6B,KAAA7B,KAAA6B,KAAA7B,KAAA4B,IACA8E,EAAA,GAAsBA,EAAA,GACtB,IAAAlC,EAAA,GAAAkC,GAD+BA,KAG/B,UAAA1G,KAAA6B,KAAA6E,EAAA,GAAAA,EAAA,GAQApB,EAAAI,OAAA,WACA,WAAA1F,KAAA6B,MAAA,IAAA7B,KAAA4B,KAOA0D,EAAAqB,IAAArB,EAAAI,OAOAJ,EAAAK,WAAA,WACA,OAAA3F,KAAA8B,UAAA9B,KAAA6B,KAAA,GAQAyD,EAAAsB,WAAA,WACA,MAAA5G,MAAA8B,UAAA9B,KAAA6B,MAAA,GAQAyD,EAAAuB,MAAA,WACA,aAAA7G,KAAA4B,MAQA0D,EAAAwB,OAAA,WACA,aAAA9G,KAAA4B,MASA0D,EAAAyB,OAAA,SAAAC,GAGA,MAFAjF,GAAAiF,KACAA,EAAAzC,EAAAyC,KACAhH,KAAA8B,WAAAkF,EAAAlF,UAAA9B,KAAA6B,OAAA,OAAAmF,EAAAnF,OAAA,SAEA7B,KAAA6B,OAAAmF,EAAAnF,MAAA7B,KAAA4B,MAAAoF,EAAApF,MASA0D,EAAAM,GAAAN,EAAAyB,OAQAzB,EAAA2B,UAAA,SAAAD,GACA,OAAAhH,KAAA4F,GAAAoB,IASA1B,EAAA4B,IAAA5B,EAAA2B,UAQA3B,EAAA6B,GAAA7B,EAAA2B,UAQA3B,EAAA8B,SAAA,SAAAJ,GACA,MAAAhH,MAAAqH,KAAAL,GAAA,GASA1B,EAAAgC,GAAAhC,EAAA8B,SAQA9B,EAAAiC,gBAAA,SAAAP,GACA,MAAAhH,MAAAqH,KAAAL,IAAA,GASA1B,EAAAkC,IAAAlC,EAAAiC,gBAQAjC,EAAAmC,GAAAnC,EAAAiC,gBAQAjC,EAAAoC,YAAA,SAAAV,GACA,MAAAhH,MAAAqH,KAAAL,GAAA,GASA1B,EAAAqC,GAAArC,EAAAoC,YAQApC,EAAAsC,mBAAA,SAAAZ,GACA,MAAAhH,MAAAqH,KAAAL,IAAA,GASA1B,EAAAuC,IAAAvC,EAAAsC,mBAQAtC,EAAAwC,GAAAxC,EAAAsC,mBASAtC,EAAAyC,QAAA,SAAAf,GAGA,GAFAjF,EAAAiF,KACAA,EAAAzC,EAAAyC,IACAhH,KAAA4F,GAAAoB,GACA,QACA,IAAAgB,GAAAhI,KAAA2F,aACAsC,EAAAjB,EAAArB,YACA,OAAAqC,KAAAC,GACA,GACAD,GAAAC,EACA,EAEAjI,KAAA8B,SAGAkF,EAAAnF,OAAA,EAAA7B,KAAA6B,OAAA,GAAAmF,EAAAnF,OAAA7B,KAAA6B,MAAAmF,EAAApF,MAAA,EAAA5B,KAAA4B,MAAA,OAFA5B,KAAAgG,IAAAgB,GAAArB,cAAA,KAYAL,EAAA+B,KAAA/B,EAAAyC,QAOAzC,EAAA4C,OAAA,WACA,OAAAlI,KAAA8B,UAAA9B,KAAA4F,GAAA7C,GACAA,EACA/C,KAAAmI,MAAA7D,IAAAa,IAQAG,EAAArC,IAAAqC,EAAA4C,OAQA5C,EAAAhB,IAAA,SAAA8D,GACArG,EAAAqG,KACAA,EAAA7D,EAAA6D,GAIA,IAAAC,GAAArI,KAAA6B,OAAA,GACAyG,EAAA,MAAAtI,KAAA6B,KACA0G,EAAAvI,KAAA4B,MAAA,GACA4G,EAAA,MAAAxI,KAAA4B,IAEA6G,EAAAL,EAAAvG,OAAA,GACA6G,EAAA,MAAAN,EAAAvG,KACA8G,EAAAP,EAAAxG,MAAA,GACAgH,EAAA,MAAAR,EAAAxG,IAEAiH,EAAA,EAAAC,EAAA,EAAAC,EAAA,EAAAC,EAAA,CAYA,OAXAA,IAAAR,EAAAI,EACAG,GAAAC,IAAA,GACAA,GAAA,MACAD,GAAAR,EAAAI,EACAG,GAAAC,IAAA,GACAA,GAAA,MACAD,GAAAR,EAAAI,EACAG,GAAAC,IAAA,GACAA,GAAA,MACAD,GAAAR,EAAAI,EACAI,GAAA,MACAvG,EAAAyG,GAAA,GAAAC,EAAAH,GAAA,GAAAC,EAAA9I,KAAA8B,WASAwD,EAAA2D,SAAA,SAAAC,GAGA,MAFAnH,GAAAmH,KACAA,EAAA3E,EAAA2E,IACAlJ,KAAAsE,IAAA4E,EAAAjG,QASAqC,EAAAU,IAAAV,EAAA2D,SAQA3D,EAAA6D,SAAA,SAAAC,GACA,GAAApJ,KAAA0F,SACA,MAAA/C,EAKA,IAJAZ,EAAAqH,KACAA,EAAA7E,EAAA6E,IAGA3E,EAAA,CAKA,MAAAnC,GAJAmC,EAAA,IAAAzE,KAAA4B,IACA5B,KAAA6B,KACAuH,EAAAxH,IACAwH,EAAAvH,MACA4C,EAAA,WAAAzE,KAAA8B,UAGA,GAAAsH,EAAA1D,SACA,MAAA/C,EACA,IAAA3C,KAAA4F,GAAA7C,GACA,MAAAqG,GAAAvC,QAAA9D,EAAAJ,CACA,IAAAyG,EAAAxD,GAAA7C,GACA,MAAA/C,MAAA6G,QAAA9D,EAAAJ,CAEA,IAAA3C,KAAA2F,aACA,MAAAyD,GAAAzD,aACA3F,KAAAiD,MAAAoB,IAAA+E,EAAAnG,OAEAjD,KAAAiD,MAAAoB,IAAA+E,GAAAnG,KACK,IAAAmG,EAAAzD,aACL,MAAA3F,MAAAqE,IAAA+E,EAAAnG,YAGA,IAAAjD,KAAAsH,GAAApC,IAAAkE,EAAA9B,GAAApC,GACA,MAAA1C,GAAAxC,KAAAwF,WAAA4D,EAAA5D,WAAAxF,KAAA8B,SAKA,IAAAuG,GAAArI,KAAA6B,OAAA,GACAyG,EAAA,MAAAtI,KAAA6B,KACA0G,EAAAvI,KAAA4B,MAAA,GACA4G,EAAA,MAAAxI,KAAA4B,IAEA6G,EAAAW,EAAAvH,OAAA,GACA6G,EAAA,MAAAU,EAAAvH,KACA8G,EAAAS,EAAAxH,MAAA,GACAgH,EAAA,MAAAQ,EAAAxH,IAEAiH,EAAA,EAAAC,EAAA,EAAAC,EAAA,EAAAC,EAAA,CAqBA,OApBAA,IAAAR,EAAAI,EACAG,GAAAC,IAAA,GACAA,GAAA,MACAD,GAAAR,EAAAK,EACAE,GAAAC,IAAA,GACAA,GAAA,MACAA,GAAAP,EAAAG,EACAG,GAAAC,IAAA,GACAA,GAAA,MACAD,GAAAR,EAAAM,EACAC,GAAAC,IAAA,GACAA,GAAA,MACAA,GAAAP,EAAAI,EACAE,GAAAC,IAAA,GACAA,GAAA,MACAA,GAAAN,EAAAE,EACAG,GAAAC,IAAA,GACAA,GAAA,MACAD,GAAAR,EAAAO,EAAAN,EAAAK,EAAAJ,EAAAG,EAAAF,EAAAC,EACAI,GAAA,MACAvG,EAAAyG,GAAA,GAAAC,EAAAH,GAAA,GAAAC,EAAA9I,KAAA8B,WASAwD,EAAAjB,IAAAiB,EAAA6D,SASA7D,EAAA+D,OAAA,SAAAC,GAGA,GAFAvH,EAAAuH,KACAA,EAAA/E,EAAA+E,IACAA,EAAA5D,SACA,KAAAjC,OAAA,mBAGA,IAAAgB,EAAA,CAIA,IAAAzE,KAAA8B,WACA,aAAA9B,KAAA6B,OACA,IAAAyH,EAAA1H,MAAA,IAAA0H,EAAAzH,KAEA,MAAA7B,KAQA,OAAAsC,IANAtC,KAAA8B,SAAA2C,EAAA,MAAAA,EAAA,OACAzE,KAAA4B,IACA5B,KAAA6B,KACAyH,EAAA1H,IACA0H,EAAAzH,MAEA4C,EAAA,WAAAzE,KAAA8B,UAGA,GAAA9B,KAAA0F,SACA,MAAA1F,MAAA8B,SAAAY,EAAAC,CACA,IAAA4G,GAAAtD,EAAAuD,CACA,IAAAxJ,KAAA8B,SA6BK,CAKL,GAFAwH,EAAAxH,WACAwH,IAAAG,cACAH,EAAA3B,GAAA3H,MACA,MAAA0C,EACA,IAAA4G,EAAA3B,GAAA3H,KAAA0J,KAAA,IACA,MAAAtE,EACAoE,GAAA9G,MAtCA,CAGA,GAAA1C,KAAA4F,GAAA7C,GAAA,CACA,GAAAuG,EAAA1D,GAAAT,IAAAmE,EAAA1D,GAAAP,GACA,MAAAtC,EACA,IAAAuG,EAAA1D,GAAA7C,GACA,MAAAoC,EAKA,OADAoE,GADAvJ,KAAA2J,IAAA,GACA7D,IAAAwD,GAAAM,IAAA,GACAL,EAAA3D,GAAAjD,GACA2G,EAAA3D,aAAAR,EAAAE,GAEAY,EAAAjG,KAAAgG,IAAAsD,EAAAjF,IAAAkF,IACAC,EAAAD,EAAAjF,IAAA2B,EAAAH,IAAAwD,KAIS,GAAAA,EAAA1D,GAAA7C,GACT,MAAA/C,MAAA8B,SAAAY,EAAAC,CACA,IAAA3C,KAAA2F,aACA,MAAA2D,GAAA3D,aACA3F,KAAAiD,MAAA6C,IAAAwD,EAAArG,OACAjD,KAAAiD,MAAA6C,IAAAwD,GAAArG,KACS,IAAAqG,EAAA3D,aACT,MAAA3F,MAAA8F,IAAAwD,EAAArG,YACAuG,GAAA7G,EAmBA,IADAsD,EAAAjG,KACAiG,EAAA4B,IAAAyB,IAAA,CAGAC,EAAAtF,KAAA4F,IAAA,EAAA5F,KAAA6F,MAAA7D,EAAAT,WAAA8D,EAAA9D,YAWA,KAPA,GAAAuE,GAAA9F,KAAA+F,KAAA/F,KAAAgG,IAAAV,GAAAtF,KAAAiG,KACAC,EAAAJ,GAAA,KAAAjG,EAAA,EAAAiG,EAAA,IAIAK,EAAA5H,EAAA+G,GACAc,EAAAD,EAAA/F,IAAAiF,GACAe,EAAA1E,cAAA0E,EAAA1C,GAAA1B,IACAsD,GAAAY,EACAC,EAAA5H,EAAA+G,EAAAvJ,KAAA8B,UACAuI,EAAAD,EAAA/F,IAAAiF,EAKAc,GAAA1E,WACA0E,EAAAjF,GAEAqE,IAAAlF,IAAA8F,GACAnE,IAAAD,IAAAqE,GAEA,MAAAb,IASAlE,EAAAQ,IAAAR,EAAA+D,OAQA/D,EAAAgF,OAAA,SAAAhB,GAKA,GAJAvH,EAAAuH,KACAA,EAAA/E,EAAA+E,IAGA7E,EAAA,CAOA,MAAAnC,IANAtC,KAAA8B,SAAA2C,EAAA,MAAAA,EAAA,OACAzE,KAAA4B,IACA5B,KAAA6B,KACAyH,EAAA1H,IACA0H,EAAAzH,MAEA4C,EAAA,WAAAzE,KAAA8B,UAGA,MAAA9B,MAAAgG,IAAAhG,KAAA8F,IAAAwD,GAAAjF,IAAAiF,KASAhE,EAAAiF,IAAAjF,EAAAgF,OAQAhF,EAAAW,IAAAX,EAAAgF,OAOAhF,EAAA6C,IAAA,WACA,MAAA7F,IAAAtC,KAAA4B,KAAA5B,KAAA6B,KAAA7B,KAAA8B,WASAwD,EAAAkF,IAAA,SAAAxD,GAGA,MAFAjF,GAAAiF,KACAA,EAAAzC,EAAAyC,IACA1E,EAAAtC,KAAA4B,IAAAoF,EAAApF,IAAA5B,KAAA6B,KAAAmF,EAAAnF,KAAA7B,KAAA8B,WASAwD,EAAAmF,GAAA,SAAAzD,GAGA,MAFAjF,GAAAiF,KACAA,EAAAzC,EAAAyC,IACA1E,EAAAtC,KAAA4B,IAAAoF,EAAApF,IAAA5B,KAAA6B,KAAAmF,EAAAnF,KAAA7B,KAAA8B,WASAwD,EAAAoF,IAAA,SAAA1D,GAGA,MAFAjF,GAAAiF,KACAA,EAAAzC,EAAAyC,IACA1E,EAAAtC,KAAA4B,IAAAoF,EAAApF,IAAA5B,KAAA6B,KAAAmF,EAAAnF,KAAA7B,KAAA8B,WASAwD,EAAAqF,UAAA,SAAAC,GAGA,MAFA7I,GAAA6I,KACAA,IAAArF,SACA,IAAAqF,GAAA,IACA5K,KACA4K,EAAA,GACAtI,EAAAtC,KAAA4B,KAAAgJ,EAAA5K,KAAA6B,MAAA+I,EAAA5K,KAAA4B,MAAA,GAAAgJ,EAAA5K,KAAA8B,UAEAQ,EAAA,EAAAtC,KAAA4B,KAAAgJ,EAAA,GAAA5K,KAAA8B,WASAwD,EAAAsE,IAAAtE,EAAAqF,UAQArF,EAAAuF,WAAA,SAAAD,GAGA,MAFA7I,GAAA6I,KACAA,IAAArF,SACA,IAAAqF,GAAA,IACA5K,KACA4K,EAAA,GACAtI,EAAAtC,KAAA4B,MAAAgJ,EAAA5K,KAAA6B,MAAA,GAAA+I,EAAA5K,KAAA6B,MAAA+I,EAAA5K,KAAA8B,UAEAQ,EAAAtC,KAAA6B,MAAA+I,EAAA,GAAA5K,KAAA6B,MAAA,OAAA7B,KAAA8B,WASAwD,EAAAqE,IAAArE,EAAAuF,WAQAvF,EAAAwF,mBAAA,SAAAF,GAEA,MADA7I,GAAA6I,SAAArF,SACA,IAAAqF,GAAA,IAAA5K,KACA4K,EAAA,GAAAtI,EAAAtC,KAAA4B,MAAAgJ,EAAA5K,KAAA6B,MAAA,GAAA+I,EAAA5K,KAAA6B,OAAA+I,EAAA5K,KAAA8B,UACA,KAAA8I,EAAAtI,EAAAtC,KAAA6B,KAAA,EAAA7B,KAAA8B,UACAQ,EAAAtC,KAAA6B,OAAA+I,EAAA,KAAA5K,KAAA8B,WASAwD,EAAAoE,KAAApE,EAAAwF,mBAQAxF,EAAAyF,MAAAzF,EAAAwF,mBAQAxF,EAAA0F,WAAA,SAAAJ,GACA,GAAAK,EAEA,OADAlJ,GAAA6I,SAAArF,SACA,IAAAqF,GAAA,IAAA5K,KACA,KAAA4K,EAAAtI,EAAAtC,KAAA6B,KAAA7B,KAAA4B,IAAA5B,KAAA8B,UACA8I,EAAA,IACAK,EAAA,GAAAL,EACAtI,EAAAtC,KAAA4B,KAAAgJ,EAAA5K,KAAA6B,OAAAoJ,EAAAjL,KAAA6B,MAAA+I,EAAA5K,KAAA4B,MAAAqJ,EAAAjL,KAAA8B,YAEA8I,GAAA,GACAK,EAAA,GAAAL,EACAtI,EAAAtC,KAAA6B,MAAA+I,EAAA5K,KAAA4B,MAAAqJ,EAAAjL,KAAA4B,KAAAgJ,EAAA5K,KAAA6B,OAAAoJ,EAAAjL,KAAA8B,YAQAwD,EAAA4F,KAAA5F,EAAA0F,WAQA1F,EAAA6F,YAAA,SAAAP,GACA,GAAAK,EAEA,OADAlJ,GAAA6I,SAAArF,SACA,IAAAqF,GAAA,IAAA5K,KACA,KAAA4K,EAAAtI,EAAAtC,KAAA6B,KAAA7B,KAAA4B,IAAA5B,KAAA8B,UACA8I,EAAA,IACAK,EAAA,GAAAL,EACAtI,EAAAtC,KAAA6B,MAAAoJ,EAAAjL,KAAA4B,MAAAgJ,EAAA5K,KAAA4B,KAAAqJ,EAAAjL,KAAA6B,OAAA+I,EAAA5K,KAAA8B,YAEA8I,GAAA,GACAK,EAAA,GAAAL,EACAtI,EAAAtC,KAAA4B,KAAAqJ,EAAAjL,KAAA6B,OAAA+I,EAAA5K,KAAA6B,MAAAoJ,EAAAjL,KAAA4B,MAAAgJ,EAAA5K,KAAA8B,YAQAwD,EAAA8F,KAAA9F,EAAA6F,YAOA7F,EAAA+F,SAAA,WACA,MAAArL,MAAA8B,SAEAQ,EAAAtC,KAAA4B,IAAA5B,KAAA6B,MAAA,GADA7B,MASAsF,EAAAmE,WAAA,WACA,MAAAzJ,MAAA8B,SACA9B,KACAsC,EAAAtC,KAAA4B,IAAA5B,KAAA6B,MAAA,IASAyD,EAAAgG,QAAA,SAAA7D,GACA,MAAAA,GAAAzH,KAAAuL,YAAAvL,KAAAwL,aAQAlG,EAAAiG,UAAA,WACA,GAAAE,GAAAzL,KAAA6B,KACA6J,EAAA1L,KAAA4B,GACA,QACA,IAAA8J,EACAA,IAAA,MACAA,IAAA,OACAA,IAAA,GACA,IAAAD,EACAA,IAAA,MACAA,IAAA,OACAA,IAAA,KASAnG,EAAAkG,UAAA,WACA,GAAAC,GAAAzL,KAAA6B,KACA6J,EAAA1L,KAAA4B,GACA,QACA6J,IAAA,GACAA,IAAA,OACAA,IAAA,MACA,IAAAA,EACAC,IAAA,GACAA,IAAA,OACAA,IAAA,MACA,IAAAA,IAWA/J,EAAAgK,UAAA,SAAAC,EAAA9J,EAAA2F,GACA,MAAAA,GAAA9F,EAAAkK,YAAAD,EAAA9J,GAAAH,EAAAmK,YAAAF,EAAA9J,IASAH,EAAAkK,YAAA,SAAAD,EAAA9J,GACA,UAAAH,GACAiK,EAAA,GACAA,EAAA,MACAA,EAAA,OACAA,EAAA,OACAA,EAAA,GACAA,EAAA,MACAA,EAAA,OACAA,EAAA,OACA9J,IAUAH,EAAAmK,YAAA,SAAAF,EAAA9J,GACA,UAAAH,GACAiK,EAAA,OACAA,EAAA,OACAA,EAAA,MACAA,EAAA,GACAA,EAAA,OACAA,EAAA,OACAA,EAAA,MACAA,EAAA,GACA9J","file":"long.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Long\"] = factory();\n\telse\n\t\troot[\"Long\"] = factory();\n})(typeof self !== 'undefined' ? self : this, function() {\nreturn \n\n\n// WEBPACK FOOTER //\n// webpack/universalModuleDefinition","(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Long\"] = factory();\n\telse\n\t\troot[\"Long\"] = factory();\n})(typeof self !== 'undefined' ? self : this, function() {\nreturn /******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId]) {\n/******/ \t\t\treturn installedModules[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\ti: moduleId,\n/******/ \t\t\tl: false,\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.l = true;\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/******/\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n/******/\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n/******/\n/******/ \t// define getter function for harmony exports\n/******/ \t__webpack_require__.d = function(exports, name, getter) {\n/******/ \t\tif(!__webpack_require__.o(exports, name)) {\n/******/ \t\t\tObject.defineProperty(exports, name, {\n/******/ \t\t\t\tconfigurable: false,\n/******/ \t\t\t\tenumerable: true,\n/******/ \t\t\t\tget: getter\n/******/ \t\t\t});\n/******/ \t\t}\n/******/ \t};\n/******/\n/******/ \t// getDefaultExport function for compatibility with non-harmony modules\n/******/ \t__webpack_require__.n = function(module) {\n/******/ \t\tvar getter = module && module.__esModule ?\n/******/ \t\t\tfunction getDefault() { return module['default']; } :\n/******/ \t\t\tfunction getModuleExports() { return module; };\n/******/ \t\t__webpack_require__.d(getter, 'a', getter);\n/******/ \t\treturn getter;\n/******/ \t};\n/******/\n/******/ \t// Object.prototype.hasOwnProperty.call\n/******/ \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n/******/\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"\";\n/******/\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(__webpack_require__.s = 0);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ (function(module, exports) {\n\nmodule.exports = Long;\n\n/**\n * wasm optimizations, to do native i64 multiplication and divide\n */\nvar wasm = null;\n\ntry {\n  wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([\n    0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11\n  ])), {}).exports;\n} catch (e) {\n  // no wasm support :(\n}\n\n/**\n * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.\n *  See the from* functions below for more convenient ways of constructing Longs.\n * @exports Long\n * @class A Long class for representing a 64 bit two's-complement integer value.\n * @param {number} low The low (signed) 32 bits of the long\n * @param {number} high The high (signed) 32 bits of the long\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @constructor\n */\nfunction Long(low, high, unsigned) {\n\n    /**\n     * The low 32 bits as a signed value.\n     * @type {number}\n     */\n    this.low = low | 0;\n\n    /**\n     * The high 32 bits as a signed value.\n     * @type {number}\n     */\n    this.high = high | 0;\n\n    /**\n     * Whether unsigned or not.\n     * @type {boolean}\n     */\n    this.unsigned = !!unsigned;\n}\n\n// The internal representation of a long is the two given signed, 32-bit values.\n// We use 32-bit pieces because these are the size of integers on which\n// Javascript performs bit-operations.  For operations like addition and\n// multiplication, we split each number into 16 bit pieces, which can easily be\n// multiplied within Javascript's floating-point representation without overflow\n// or change in sign.\n//\n// In the algorithms below, we frequently reduce the negative case to the\n// positive case by negating the input(s) and then post-processing the result.\n// Note that we must ALWAYS check specially whether those values are MIN_VALUE\n// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as\n// a positive number, it overflows back into a negative).  Not handling this\n// case would often result in infinite recursion.\n//\n// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*\n// methods on which they depend.\n\n/**\n * An indicator used to reliably determine if an object is a Long or not.\n * @type {boolean}\n * @const\n * @private\n */\nLong.prototype.__isLong__;\n\nObject.defineProperty(Long.prototype, \"__isLong__\", { value: true });\n\n/**\n * @function\n * @param {*} obj Object\n * @returns {boolean}\n * @inner\n */\nfunction isLong(obj) {\n    return (obj && obj[\"__isLong__\"]) === true;\n}\n\n/**\n * Tests if the specified object is a Long.\n * @function\n * @param {*} obj Object\n * @returns {boolean}\n */\nLong.isLong = isLong;\n\n/**\n * A cache of the Long representations of small integer values.\n * @type {!Object}\n * @inner\n */\nvar INT_CACHE = {};\n\n/**\n * A cache of the Long representations of small unsigned integer values.\n * @type {!Object}\n * @inner\n */\nvar UINT_CACHE = {};\n\n/**\n * @param {number} value\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromInt(value, unsigned) {\n    var obj, cachedObj, cache;\n    if (unsigned) {\n        value >>>= 0;\n        if (cache = (0 <= value && value < 256)) {\n            cachedObj = UINT_CACHE[value];\n            if (cachedObj)\n                return cachedObj;\n        }\n        obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);\n        if (cache)\n            UINT_CACHE[value] = obj;\n        return obj;\n    } else {\n        value |= 0;\n        if (cache = (-128 <= value && value < 128)) {\n            cachedObj = INT_CACHE[value];\n            if (cachedObj)\n                return cachedObj;\n        }\n        obj = fromBits(value, value < 0 ? -1 : 0, false);\n        if (cache)\n            INT_CACHE[value] = obj;\n        return obj;\n    }\n}\n\n/**\n * Returns a Long representing the given 32 bit integer value.\n * @function\n * @param {number} value The 32 bit integer in question\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\nLong.fromInt = fromInt;\n\n/**\n * @param {number} value\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromNumber(value, unsigned) {\n    if (isNaN(value))\n        return unsigned ? UZERO : ZERO;\n    if (unsigned) {\n        if (value < 0)\n            return UZERO;\n        if (value >= TWO_PWR_64_DBL)\n            return MAX_UNSIGNED_VALUE;\n    } else {\n        if (value <= -TWO_PWR_63_DBL)\n            return MIN_VALUE;\n        if (value + 1 >= TWO_PWR_63_DBL)\n            return MAX_VALUE;\n    }\n    if (value < 0)\n        return fromNumber(-value, unsigned).neg();\n    return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);\n}\n\n/**\n * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.\n * @function\n * @param {number} value The number in question\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\nLong.fromNumber = fromNumber;\n\n/**\n * @param {number} lowBits\n * @param {number} highBits\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromBits(lowBits, highBits, unsigned) {\n    return new Long(lowBits, highBits, unsigned);\n}\n\n/**\n * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is\n *  assumed to use 32 bits.\n * @function\n * @param {number} lowBits The low 32 bits\n * @param {number} highBits The high 32 bits\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\nLong.fromBits = fromBits;\n\n/**\n * @function\n * @param {number} base\n * @param {number} exponent\n * @returns {number}\n * @inner\n */\nvar pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)\n\n/**\n * @param {string} str\n * @param {(boolean|number)=} unsigned\n * @param {number=} radix\n * @returns {!Long}\n * @inner\n */\nfunction fromString(str, unsigned, radix) {\n    if (str.length === 0)\n        throw Error('empty string');\n    if (str === \"NaN\" || str === \"Infinity\" || str === \"+Infinity\" || str === \"-Infinity\")\n        return ZERO;\n    if (typeof unsigned === 'number') {\n        // For goog.math.long compatibility\n        radix = unsigned,\n        unsigned = false;\n    } else {\n        unsigned = !! unsigned;\n    }\n    radix = radix || 10;\n    if (radix < 2 || 36 < radix)\n        throw RangeError('radix');\n\n    var p;\n    if ((p = str.indexOf('-')) > 0)\n        throw Error('interior hyphen');\n    else if (p === 0) {\n        return fromString(str.substring(1), unsigned, radix).neg();\n    }\n\n    // Do several (8) digits each time through the loop, so as to\n    // minimize the calls to the very expensive emulated div.\n    var radixToPower = fromNumber(pow_dbl(radix, 8));\n\n    var result = ZERO;\n    for (var i = 0; i < str.length; i += 8) {\n        var size = Math.min(8, str.length - i),\n            value = parseInt(str.substring(i, i + size), radix);\n        if (size < 8) {\n            var power = fromNumber(pow_dbl(radix, size));\n            result = result.mul(power).add(fromNumber(value));\n        } else {\n            result = result.mul(radixToPower);\n            result = result.add(fromNumber(value));\n        }\n    }\n    result.unsigned = unsigned;\n    return result;\n}\n\n/**\n * Returns a Long representation of the given string, written using the specified radix.\n * @function\n * @param {string} str The textual representation of the Long\n * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed\n * @param {number=} radix The radix in which the text is written (2-36), defaults to 10\n * @returns {!Long} The corresponding Long value\n */\nLong.fromString = fromString;\n\n/**\n * @function\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromValue(val, unsigned) {\n    if (typeof val === 'number')\n        return fromNumber(val, unsigned);\n    if (typeof val === 'string')\n        return fromString(val, unsigned);\n    // Throws for non-objects, converts non-instanceof Long:\n    return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);\n}\n\n/**\n * Converts the specified value to a Long using the appropriate from* function for its type.\n * @function\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long}\n */\nLong.fromValue = fromValue;\n\n// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be\n// no runtime penalty for these.\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_16_DBL = 1 << 16;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_24_DBL = 1 << 24;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;\n\n/**\n * @type {!Long}\n * @const\n * @inner\n */\nvar TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);\n\n/**\n * @type {!Long}\n * @inner\n */\nvar ZERO = fromInt(0);\n\n/**\n * Signed zero.\n * @type {!Long}\n */\nLong.ZERO = ZERO;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar UZERO = fromInt(0, true);\n\n/**\n * Unsigned zero.\n * @type {!Long}\n */\nLong.UZERO = UZERO;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar ONE = fromInt(1);\n\n/**\n * Signed one.\n * @type {!Long}\n */\nLong.ONE = ONE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar UONE = fromInt(1, true);\n\n/**\n * Unsigned one.\n * @type {!Long}\n */\nLong.UONE = UONE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar NEG_ONE = fromInt(-1);\n\n/**\n * Signed negative one.\n * @type {!Long}\n */\nLong.NEG_ONE = NEG_ONE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar MAX_VALUE = fromBits(0xFFFFFFFF|0, 0x7FFFFFFF|0, false);\n\n/**\n * Maximum signed value.\n * @type {!Long}\n */\nLong.MAX_VALUE = MAX_VALUE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF|0, 0xFFFFFFFF|0, true);\n\n/**\n * Maximum unsigned value.\n * @type {!Long}\n */\nLong.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar MIN_VALUE = fromBits(0, 0x80000000|0, false);\n\n/**\n * Minimum signed value.\n * @type {!Long}\n */\nLong.MIN_VALUE = MIN_VALUE;\n\n/**\n * @alias Long.prototype\n * @inner\n */\nvar LongPrototype = Long.prototype;\n\n/**\n * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.\n * @this {!Long}\n * @returns {number}\n */\nLongPrototype.toInt = function toInt() {\n    return this.unsigned ? this.low >>> 0 : this.low;\n};\n\n/**\n * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).\n * @this {!Long}\n * @returns {number}\n */\nLongPrototype.toNumber = function toNumber() {\n    if (this.unsigned)\n        return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);\n    return this.high * TWO_PWR_32_DBL + (this.low >>> 0);\n};\n\n/**\n * Converts the Long to a string written in the specified radix.\n * @this {!Long}\n * @param {number=} radix Radix (2-36), defaults to 10\n * @returns {string}\n * @override\n * @throws {RangeError} If `radix` is out of range\n */\nLongPrototype.toString = function toString(radix) {\n    radix = radix || 10;\n    if (radix < 2 || 36 < radix)\n        throw RangeError('radix');\n    if (this.isZero())\n        return '0';\n    if (this.isNegative()) { // Unsigned Longs are never negative\n        if (this.eq(MIN_VALUE)) {\n            // We need to change the Long value before it can be negated, so we remove\n            // the bottom-most digit in this base and then recurse to do the rest.\n            var radixLong = fromNumber(radix),\n                div = this.div(radixLong),\n                rem1 = div.mul(radixLong).sub(this);\n            return div.toString(radix) + rem1.toInt().toString(radix);\n        } else\n            return '-' + this.neg().toString(radix);\n    }\n\n    // Do several (6) digits each time through the loop, so as to\n    // minimize the calls to the very expensive emulated div.\n    var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),\n        rem = this;\n    var result = '';\n    while (true) {\n        var remDiv = rem.div(radixToPower),\n            intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,\n            digits = intval.toString(radix);\n        rem = remDiv;\n        if (rem.isZero())\n            return digits + result;\n        else {\n            while (digits.length < 6)\n                digits = '0' + digits;\n            result = '' + digits + result;\n        }\n    }\n};\n\n/**\n * Gets the high 32 bits as a signed integer.\n * @this {!Long}\n * @returns {number} Signed high bits\n */\nLongPrototype.getHighBits = function getHighBits() {\n    return this.high;\n};\n\n/**\n * Gets the high 32 bits as an unsigned integer.\n * @this {!Long}\n * @returns {number} Unsigned high bits\n */\nLongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {\n    return this.high >>> 0;\n};\n\n/**\n * Gets the low 32 bits as a signed integer.\n * @this {!Long}\n * @returns {number} Signed low bits\n */\nLongPrototype.getLowBits = function getLowBits() {\n    return this.low;\n};\n\n/**\n * Gets the low 32 bits as an unsigned integer.\n * @this {!Long}\n * @returns {number} Unsigned low bits\n */\nLongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {\n    return this.low >>> 0;\n};\n\n/**\n * Gets the number of bits needed to represent the absolute value of this Long.\n * @this {!Long}\n * @returns {number}\n */\nLongPrototype.getNumBitsAbs = function getNumBitsAbs() {\n    if (this.isNegative()) // Unsigned Longs are never negative\n        return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();\n    var val = this.high != 0 ? this.high : this.low;\n    for (var bit = 31; bit > 0; bit--)\n        if ((val & (1 << bit)) != 0)\n            break;\n    return this.high != 0 ? bit + 33 : bit + 1;\n};\n\n/**\n * Tests if this Long's value equals zero.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isZero = function isZero() {\n    return this.high === 0 && this.low === 0;\n};\n\n/**\n * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.\n * @returns {boolean}\n */\nLongPrototype.eqz = LongPrototype.isZero;\n\n/**\n * Tests if this Long's value is negative.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isNegative = function isNegative() {\n    return !this.unsigned && this.high < 0;\n};\n\n/**\n * Tests if this Long's value is positive.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isPositive = function isPositive() {\n    return this.unsigned || this.high >= 0;\n};\n\n/**\n * Tests if this Long's value is odd.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isOdd = function isOdd() {\n    return (this.low & 1) === 1;\n};\n\n/**\n * Tests if this Long's value is even.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isEven = function isEven() {\n    return (this.low & 1) === 0;\n};\n\n/**\n * Tests if this Long's value equals the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.equals = function equals(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)\n        return false;\n    return this.high === other.high && this.low === other.low;\n};\n\n/**\n * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.eq = LongPrototype.equals;\n\n/**\n * Tests if this Long's value differs from the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.notEquals = function notEquals(other) {\n    return !this.eq(/* validates */ other);\n};\n\n/**\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.neq = LongPrototype.notEquals;\n\n/**\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.ne = LongPrototype.notEquals;\n\n/**\n * Tests if this Long's value is less than the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lessThan = function lessThan(other) {\n    return this.comp(/* validates */ other) < 0;\n};\n\n/**\n * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lt = LongPrototype.lessThan;\n\n/**\n * Tests if this Long's value is less than or equal the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {\n    return this.comp(/* validates */ other) <= 0;\n};\n\n/**\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lte = LongPrototype.lessThanOrEqual;\n\n/**\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.le = LongPrototype.lessThanOrEqual;\n\n/**\n * Tests if this Long's value is greater than the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.greaterThan = function greaterThan(other) {\n    return this.comp(/* validates */ other) > 0;\n};\n\n/**\n * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.gt = LongPrototype.greaterThan;\n\n/**\n * Tests if this Long's value is greater than or equal the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {\n    return this.comp(/* validates */ other) >= 0;\n};\n\n/**\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.gte = LongPrototype.greaterThanOrEqual;\n\n/**\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.ge = LongPrototype.greaterThanOrEqual;\n\n/**\n * Compares this Long's value with the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n *  if the given one is greater\n */\nLongPrototype.compare = function compare(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    if (this.eq(other))\n        return 0;\n    var thisNeg = this.isNegative(),\n        otherNeg = other.isNegative();\n    if (thisNeg && !otherNeg)\n        return -1;\n    if (!thisNeg && otherNeg)\n        return 1;\n    // At this point the sign bits are the same\n    if (!this.unsigned)\n        return this.sub(other).isNegative() ? -1 : 1;\n    // Both are positive if at least one is unsigned\n    return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;\n};\n\n/**\n * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n *  if the given one is greater\n */\nLongPrototype.comp = LongPrototype.compare;\n\n/**\n * Negates this Long's value.\n * @this {!Long}\n * @returns {!Long} Negated Long\n */\nLongPrototype.negate = function negate() {\n    if (!this.unsigned && this.eq(MIN_VALUE))\n        return MIN_VALUE;\n    return this.not().add(ONE);\n};\n\n/**\n * Negates this Long's value. This is an alias of {@link Long#negate}.\n * @function\n * @returns {!Long} Negated Long\n */\nLongPrototype.neg = LongPrototype.negate;\n\n/**\n * Returns the sum of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} addend Addend\n * @returns {!Long} Sum\n */\nLongPrototype.add = function add(addend) {\n    if (!isLong(addend))\n        addend = fromValue(addend);\n\n    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\n\n    var a48 = this.high >>> 16;\n    var a32 = this.high & 0xFFFF;\n    var a16 = this.low >>> 16;\n    var a00 = this.low & 0xFFFF;\n\n    var b48 = addend.high >>> 16;\n    var b32 = addend.high & 0xFFFF;\n    var b16 = addend.low >>> 16;\n    var b00 = addend.low & 0xFFFF;\n\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\n    c00 += a00 + b00;\n    c16 += c00 >>> 16;\n    c00 &= 0xFFFF;\n    c16 += a16 + b16;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c32 += a32 + b32;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c48 += a48 + b48;\n    c48 &= 0xFFFF;\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\n};\n\n/**\n * Returns the difference of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} subtrahend Subtrahend\n * @returns {!Long} Difference\n */\nLongPrototype.subtract = function subtract(subtrahend) {\n    if (!isLong(subtrahend))\n        subtrahend = fromValue(subtrahend);\n    return this.add(subtrahend.neg());\n};\n\n/**\n * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.\n * @function\n * @param {!Long|number|string} subtrahend Subtrahend\n * @returns {!Long} Difference\n */\nLongPrototype.sub = LongPrototype.subtract;\n\n/**\n * Returns the product of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} multiplier Multiplier\n * @returns {!Long} Product\n */\nLongPrototype.multiply = function multiply(multiplier) {\n    if (this.isZero())\n        return ZERO;\n    if (!isLong(multiplier))\n        multiplier = fromValue(multiplier);\n\n    // use wasm support if present\n    if (wasm) {\n        var low = wasm[\"mul\"](this.low,\n                              this.high,\n                              multiplier.low,\n                              multiplier.high);\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n    }\n\n    if (multiplier.isZero())\n        return ZERO;\n    if (this.eq(MIN_VALUE))\n        return multiplier.isOdd() ? MIN_VALUE : ZERO;\n    if (multiplier.eq(MIN_VALUE))\n        return this.isOdd() ? MIN_VALUE : ZERO;\n\n    if (this.isNegative()) {\n        if (multiplier.isNegative())\n            return this.neg().mul(multiplier.neg());\n        else\n            return this.neg().mul(multiplier).neg();\n    } else if (multiplier.isNegative())\n        return this.mul(multiplier.neg()).neg();\n\n    // If both longs are small, use float multiplication\n    if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))\n        return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);\n\n    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.\n    // We can skip products that would overflow.\n\n    var a48 = this.high >>> 16;\n    var a32 = this.high & 0xFFFF;\n    var a16 = this.low >>> 16;\n    var a00 = this.low & 0xFFFF;\n\n    var b48 = multiplier.high >>> 16;\n    var b32 = multiplier.high & 0xFFFF;\n    var b16 = multiplier.low >>> 16;\n    var b00 = multiplier.low & 0xFFFF;\n\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\n    c00 += a00 * b00;\n    c16 += c00 >>> 16;\n    c00 &= 0xFFFF;\n    c16 += a16 * b00;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c16 += a00 * b16;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c32 += a32 * b00;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c32 += a16 * b16;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c32 += a00 * b32;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;\n    c48 &= 0xFFFF;\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\n};\n\n/**\n * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.\n * @function\n * @param {!Long|number|string} multiplier Multiplier\n * @returns {!Long} Product\n */\nLongPrototype.mul = LongPrototype.multiply;\n\n/**\n * Returns this Long divided by the specified. The result is signed if this Long is signed or\n *  unsigned if this Long is unsigned.\n * @this {!Long}\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Quotient\n */\nLongPrototype.divide = function divide(divisor) {\n    if (!isLong(divisor))\n        divisor = fromValue(divisor);\n    if (divisor.isZero())\n        throw Error('division by zero');\n\n    // use wasm support if present\n    if (wasm) {\n        // guard against signed division overflow: the largest\n        // negative number / -1 would be 1 larger than the largest\n        // positive number, due to two's complement.\n        if (!this.unsigned &&\n            this.high === -0x80000000 &&\n            divisor.low === -1 && divisor.high === -1) {\n            // be consistent with non-wasm code path\n            return this;\n        }\n        var low = (this.unsigned ? wasm[\"div_u\"] : wasm[\"div_s\"])(\n            this.low,\n            this.high,\n            divisor.low,\n            divisor.high\n        );\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n    }\n\n    if (this.isZero())\n        return this.unsigned ? UZERO : ZERO;\n    var approx, rem, res;\n    if (!this.unsigned) {\n        // This section is only relevant for signed longs and is derived from the\n        // closure library as a whole.\n        if (this.eq(MIN_VALUE)) {\n            if (divisor.eq(ONE) || divisor.eq(NEG_ONE))\n                return MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE\n            else if (divisor.eq(MIN_VALUE))\n                return ONE;\n            else {\n                // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.\n                var halfThis = this.shr(1);\n                approx = halfThis.div(divisor).shl(1);\n                if (approx.eq(ZERO)) {\n                    return divisor.isNegative() ? ONE : NEG_ONE;\n                } else {\n                    rem = this.sub(divisor.mul(approx));\n                    res = approx.add(rem.div(divisor));\n                    return res;\n                }\n            }\n        } else if (divisor.eq(MIN_VALUE))\n            return this.unsigned ? UZERO : ZERO;\n        if (this.isNegative()) {\n            if (divisor.isNegative())\n                return this.neg().div(divisor.neg());\n            return this.neg().div(divisor).neg();\n        } else if (divisor.isNegative())\n            return this.div(divisor.neg()).neg();\n        res = ZERO;\n    } else {\n        // The algorithm below has not been made for unsigned longs. It's therefore\n        // required to take special care of the MSB prior to running it.\n        if (!divisor.unsigned)\n            divisor = divisor.toUnsigned();\n        if (divisor.gt(this))\n            return UZERO;\n        if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true\n            return UONE;\n        res = UZERO;\n    }\n\n    // Repeat the following until the remainder is less than other:  find a\n    // floating-point that approximates remainder / other *from below*, add this\n    // into the result, and subtract it from the remainder.  It is critical that\n    // the approximate value is less than or equal to the real value so that the\n    // remainder never becomes negative.\n    rem = this;\n    while (rem.gte(divisor)) {\n        // Approximate the result of division. This may be a little greater or\n        // smaller than the actual value.\n        approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));\n\n        // We will tweak the approximate result by changing it in the 48-th digit or\n        // the smallest non-fractional digit, whichever is larger.\n        var log2 = Math.ceil(Math.log(approx) / Math.LN2),\n            delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),\n\n        // Decrease the approximation until it is smaller than the remainder.  Note\n        // that if it is too large, the product overflows and is negative.\n            approxRes = fromNumber(approx),\n            approxRem = approxRes.mul(divisor);\n        while (approxRem.isNegative() || approxRem.gt(rem)) {\n            approx -= delta;\n            approxRes = fromNumber(approx, this.unsigned);\n            approxRem = approxRes.mul(divisor);\n        }\n\n        // We know the answer can't be zero... and actually, zero would cause\n        // infinite recursion since we would make no progress.\n        if (approxRes.isZero())\n            approxRes = ONE;\n\n        res = res.add(approxRes);\n        rem = rem.sub(approxRem);\n    }\n    return res;\n};\n\n/**\n * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Quotient\n */\nLongPrototype.div = LongPrototype.divide;\n\n/**\n * Returns this Long modulo the specified.\n * @this {!Long}\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\nLongPrototype.modulo = function modulo(divisor) {\n    if (!isLong(divisor))\n        divisor = fromValue(divisor);\n\n    // use wasm support if present\n    if (wasm) {\n        var low = (this.unsigned ? wasm[\"rem_u\"] : wasm[\"rem_s\"])(\n            this.low,\n            this.high,\n            divisor.low,\n            divisor.high\n        );\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n    }\n\n    return this.sub(this.div(divisor).mul(divisor));\n};\n\n/**\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\nLongPrototype.mod = LongPrototype.modulo;\n\n/**\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\nLongPrototype.rem = LongPrototype.modulo;\n\n/**\n * Returns the bitwise NOT of this Long.\n * @this {!Long}\n * @returns {!Long}\n */\nLongPrototype.not = function not() {\n    return fromBits(~this.low, ~this.high, this.unsigned);\n};\n\n/**\n * Returns the bitwise AND of this Long and the specified.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nLongPrototype.and = function and(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits(this.low & other.low, this.high & other.high, this.unsigned);\n};\n\n/**\n * Returns the bitwise OR of this Long and the specified.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nLongPrototype.or = function or(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits(this.low | other.low, this.high | other.high, this.unsigned);\n};\n\n/**\n * Returns the bitwise XOR of this Long and the given one.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nLongPrototype.xor = function xor(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);\n};\n\n/**\n * Returns this Long with bits shifted to the left by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shiftLeft = function shiftLeft(numBits) {\n    if (isLong(numBits))\n        numBits = numBits.toInt();\n    if ((numBits &= 63) === 0)\n        return this;\n    else if (numBits < 32)\n        return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);\n    else\n        return fromBits(0, this.low << (numBits - 32), this.unsigned);\n};\n\n/**\n * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shl = LongPrototype.shiftLeft;\n\n/**\n * Returns this Long with bits arithmetically shifted to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shiftRight = function shiftRight(numBits) {\n    if (isLong(numBits))\n        numBits = numBits.toInt();\n    if ((numBits &= 63) === 0)\n        return this;\n    else if (numBits < 32)\n        return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);\n    else\n        return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);\n};\n\n/**\n * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shr = LongPrototype.shiftRight;\n\n/**\n * Returns this Long with bits logically shifted to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {\n    if (isLong(numBits)) numBits = numBits.toInt();\n    if ((numBits &= 63) === 0) return this;\n    if (numBits < 32) return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >>> numBits, this.unsigned);\n    if (numBits === 32) return fromBits(this.high, 0, this.unsigned);\n    return fromBits(this.high >>> (numBits - 32), 0, this.unsigned);\n};\n\n/**\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shru = LongPrototype.shiftRightUnsigned;\n\n/**\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shr_u = LongPrototype.shiftRightUnsigned;\n\n/**\n * Returns this Long with bits rotated to the left by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotateLeft = function rotateLeft(numBits) {\n    var b;\n    if (isLong(numBits)) numBits = numBits.toInt();\n    if ((numBits &= 63) === 0) return this;\n    if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);\n    if (numBits < 32) {\n        b = (32 - numBits);\n        return fromBits(((this.low << numBits) | (this.high >>> b)), ((this.high << numBits) | (this.low >>> b)), this.unsigned);\n    }\n    numBits -= 32;\n    b = (32 - numBits);\n    return fromBits(((this.high << numBits) | (this.low >>> b)), ((this.low << numBits) | (this.high >>> b)), this.unsigned);\n}\n/**\n * Returns this Long with bits rotated to the left by the given amount. This is an alias of {@link Long#rotateLeft}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotl = LongPrototype.rotateLeft;\n\n/**\n * Returns this Long with bits rotated to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotateRight = function rotateRight(numBits) {\n    var b;\n    if (isLong(numBits)) numBits = numBits.toInt();\n    if ((numBits &= 63) === 0) return this;\n    if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);\n    if (numBits < 32) {\n        b = (32 - numBits);\n        return fromBits(((this.high << b) | (this.low >>> numBits)), ((this.low << b) | (this.high >>> numBits)), this.unsigned);\n    }\n    numBits -= 32;\n    b = (32 - numBits);\n    return fromBits(((this.low << b) | (this.high >>> numBits)), ((this.high << b) | (this.low >>> numBits)), this.unsigned);\n}\n/**\n * Returns this Long with bits rotated to the right by the given amount. This is an alias of {@link Long#rotateRight}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotr = LongPrototype.rotateRight;\n\n/**\n * Converts this Long to signed.\n * @this {!Long}\n * @returns {!Long} Signed long\n */\nLongPrototype.toSigned = function toSigned() {\n    if (!this.unsigned)\n        return this;\n    return fromBits(this.low, this.high, false);\n};\n\n/**\n * Converts this Long to unsigned.\n * @this {!Long}\n * @returns {!Long} Unsigned long\n */\nLongPrototype.toUnsigned = function toUnsigned() {\n    if (this.unsigned)\n        return this;\n    return fromBits(this.low, this.high, true);\n};\n\n/**\n * Converts this Long to its byte representation.\n * @param {boolean=} le Whether little or big endian, defaults to big endian\n * @this {!Long}\n * @returns {!Array.<number>} Byte representation\n */\nLongPrototype.toBytes = function toBytes(le) {\n    return le ? this.toBytesLE() : this.toBytesBE();\n};\n\n/**\n * Converts this Long to its little endian byte representation.\n * @this {!Long}\n * @returns {!Array.<number>} Little endian byte representation\n */\nLongPrototype.toBytesLE = function toBytesLE() {\n    var hi = this.high,\n        lo = this.low;\n    return [\n        lo        & 0xff,\n        lo >>>  8 & 0xff,\n        lo >>> 16 & 0xff,\n        lo >>> 24       ,\n        hi        & 0xff,\n        hi >>>  8 & 0xff,\n        hi >>> 16 & 0xff,\n        hi >>> 24\n    ];\n};\n\n/**\n * Converts this Long to its big endian byte representation.\n * @this {!Long}\n * @returns {!Array.<number>} Big endian byte representation\n */\nLongPrototype.toBytesBE = function toBytesBE() {\n    var hi = this.high,\n        lo = this.low;\n    return [\n        hi >>> 24       ,\n        hi >>> 16 & 0xff,\n        hi >>>  8 & 0xff,\n        hi        & 0xff,\n        lo >>> 24       ,\n        lo >>> 16 & 0xff,\n        lo >>>  8 & 0xff,\n        lo        & 0xff\n    ];\n};\n\n/**\n * Creates a Long from its byte representation.\n * @param {!Array.<number>} bytes Byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @param {boolean=} le Whether little or big endian, defaults to big endian\n * @returns {Long} The corresponding Long value\n */\nLong.fromBytes = function fromBytes(bytes, unsigned, le) {\n    return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);\n};\n\n/**\n * Creates a Long from its little endian byte representation.\n * @param {!Array.<number>} bytes Little endian byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {Long} The corresponding Long value\n */\nLong.fromBytesLE = function fromBytesLE(bytes, unsigned) {\n    return new Long(\n        bytes[0]       |\n        bytes[1] <<  8 |\n        bytes[2] << 16 |\n        bytes[3] << 24,\n        bytes[4]       |\n        bytes[5] <<  8 |\n        bytes[6] << 16 |\n        bytes[7] << 24,\n        unsigned\n    );\n};\n\n/**\n * Creates a Long from its big endian byte representation.\n * @param {!Array.<number>} bytes Big endian byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {Long} The corresponding Long value\n */\nLong.fromBytesBE = function fromBytesBE(bytes, unsigned) {\n    return new Long(\n        bytes[4] << 24 |\n        bytes[5] << 16 |\n        bytes[6] <<  8 |\n        bytes[7],\n        bytes[0] << 24 |\n        bytes[1] << 16 |\n        bytes[2] <<  8 |\n        bytes[3],\n        unsigned\n    );\n};\n\n\n/***/ })\n/******/ ]);\n});\n\n\n// WEBPACK FOOTER //\n// long.js"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, {\n \t\t\t\tconfigurable: false,\n \t\t\t\tenumerable: true,\n \t\t\t\tget: getter\n \t\t\t});\n \t\t}\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 0);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap f96e8d1360c0487f2545","module.exports = Long;\n\n/**\n * wasm optimizations, to do native i64 multiplication and divide\n */\nvar wasm = null;\n\ntry {\n  wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([\n    0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11\n  ])), {}).exports;\n} catch (e) {\n  // no wasm support :(\n}\n\n/**\n * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.\n *  See the from* functions below for more convenient ways of constructing Longs.\n * @exports Long\n * @class A Long class for representing a 64 bit two's-complement integer value.\n * @param {number} low The low (signed) 32 bits of the long\n * @param {number} high The high (signed) 32 bits of the long\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @constructor\n */\nfunction Long(low, high, unsigned) {\n\n    /**\n     * The low 32 bits as a signed value.\n     * @type {number}\n     */\n    this.low = low | 0;\n\n    /**\n     * The high 32 bits as a signed value.\n     * @type {number}\n     */\n    this.high = high | 0;\n\n    /**\n     * Whether unsigned or not.\n     * @type {boolean}\n     */\n    this.unsigned = !!unsigned;\n}\n\n// The internal representation of a long is the two given signed, 32-bit values.\n// We use 32-bit pieces because these are the size of integers on which\n// Javascript performs bit-operations.  For operations like addition and\n// multiplication, we split each number into 16 bit pieces, which can easily be\n// multiplied within Javascript's floating-point representation without overflow\n// or change in sign.\n//\n// In the algorithms below, we frequently reduce the negative case to the\n// positive case by negating the input(s) and then post-processing the result.\n// Note that we must ALWAYS check specially whether those values are MIN_VALUE\n// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as\n// a positive number, it overflows back into a negative).  Not handling this\n// case would often result in infinite recursion.\n//\n// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*\n// methods on which they depend.\n\n/**\n * An indicator used to reliably determine if an object is a Long or not.\n * @type {boolean}\n * @const\n * @private\n */\nLong.prototype.__isLong__;\n\nObject.defineProperty(Long.prototype, \"__isLong__\", { value: true });\n\n/**\n * @function\n * @param {*} obj Object\n * @returns {boolean}\n * @inner\n */\nfunction isLong(obj) {\n    return (obj && obj[\"__isLong__\"]) === true;\n}\n\n/**\n * Tests if the specified object is a Long.\n * @function\n * @param {*} obj Object\n * @returns {boolean}\n */\nLong.isLong = isLong;\n\n/**\n * A cache of the Long representations of small integer values.\n * @type {!Object}\n * @inner\n */\nvar INT_CACHE = {};\n\n/**\n * A cache of the Long representations of small unsigned integer values.\n * @type {!Object}\n * @inner\n */\nvar UINT_CACHE = {};\n\n/**\n * @param {number} value\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromInt(value, unsigned) {\n    var obj, cachedObj, cache;\n    if (unsigned) {\n        value >>>= 0;\n        if (cache = (0 <= value && value < 256)) {\n            cachedObj = UINT_CACHE[value];\n            if (cachedObj)\n                return cachedObj;\n        }\n        obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);\n        if (cache)\n            UINT_CACHE[value] = obj;\n        return obj;\n    } else {\n        value |= 0;\n        if (cache = (-128 <= value && value < 128)) {\n            cachedObj = INT_CACHE[value];\n            if (cachedObj)\n                return cachedObj;\n        }\n        obj = fromBits(value, value < 0 ? -1 : 0, false);\n        if (cache)\n            INT_CACHE[value] = obj;\n        return obj;\n    }\n}\n\n/**\n * Returns a Long representing the given 32 bit integer value.\n * @function\n * @param {number} value The 32 bit integer in question\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\nLong.fromInt = fromInt;\n\n/**\n * @param {number} value\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromNumber(value, unsigned) {\n    if (isNaN(value))\n        return unsigned ? UZERO : ZERO;\n    if (unsigned) {\n        if (value < 0)\n            return UZERO;\n        if (value >= TWO_PWR_64_DBL)\n            return MAX_UNSIGNED_VALUE;\n    } else {\n        if (value <= -TWO_PWR_63_DBL)\n            return MIN_VALUE;\n        if (value + 1 >= TWO_PWR_63_DBL)\n            return MAX_VALUE;\n    }\n    if (value < 0)\n        return fromNumber(-value, unsigned).neg();\n    return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);\n}\n\n/**\n * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.\n * @function\n * @param {number} value The number in question\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\nLong.fromNumber = fromNumber;\n\n/**\n * @param {number} lowBits\n * @param {number} highBits\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromBits(lowBits, highBits, unsigned) {\n    return new Long(lowBits, highBits, unsigned);\n}\n\n/**\n * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is\n *  assumed to use 32 bits.\n * @function\n * @param {number} lowBits The low 32 bits\n * @param {number} highBits The high 32 bits\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\nLong.fromBits = fromBits;\n\n/**\n * @function\n * @param {number} base\n * @param {number} exponent\n * @returns {number}\n * @inner\n */\nvar pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)\n\n/**\n * @param {string} str\n * @param {(boolean|number)=} unsigned\n * @param {number=} radix\n * @returns {!Long}\n * @inner\n */\nfunction fromString(str, unsigned, radix) {\n    if (str.length === 0)\n        throw Error('empty string');\n    if (str === \"NaN\" || str === \"Infinity\" || str === \"+Infinity\" || str === \"-Infinity\")\n        return ZERO;\n    if (typeof unsigned === 'number') {\n        // For goog.math.long compatibility\n        radix = unsigned,\n        unsigned = false;\n    } else {\n        unsigned = !! unsigned;\n    }\n    radix = radix || 10;\n    if (radix < 2 || 36 < radix)\n        throw RangeError('radix');\n\n    var p;\n    if ((p = str.indexOf('-')) > 0)\n        throw Error('interior hyphen');\n    else if (p === 0) {\n        return fromString(str.substring(1), unsigned, radix).neg();\n    }\n\n    // Do several (8) digits each time through the loop, so as to\n    // minimize the calls to the very expensive emulated div.\n    var radixToPower = fromNumber(pow_dbl(radix, 8));\n\n    var result = ZERO;\n    for (var i = 0; i < str.length; i += 8) {\n        var size = Math.min(8, str.length - i),\n            value = parseInt(str.substring(i, i + size), radix);\n        if (size < 8) {\n            var power = fromNumber(pow_dbl(radix, size));\n            result = result.mul(power).add(fromNumber(value));\n        } else {\n            result = result.mul(radixToPower);\n            result = result.add(fromNumber(value));\n        }\n    }\n    result.unsigned = unsigned;\n    return result;\n}\n\n/**\n * Returns a Long representation of the given string, written using the specified radix.\n * @function\n * @param {string} str The textual representation of the Long\n * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed\n * @param {number=} radix The radix in which the text is written (2-36), defaults to 10\n * @returns {!Long} The corresponding Long value\n */\nLong.fromString = fromString;\n\n/**\n * @function\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nfunction fromValue(val, unsigned) {\n    if (typeof val === 'number')\n        return fromNumber(val, unsigned);\n    if (typeof val === 'string')\n        return fromString(val, unsigned);\n    // Throws for non-objects, converts non-instanceof Long:\n    return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);\n}\n\n/**\n * Converts the specified value to a Long using the appropriate from* function for its type.\n * @function\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long}\n */\nLong.fromValue = fromValue;\n\n// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be\n// no runtime penalty for these.\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_16_DBL = 1 << 16;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_24_DBL = 1 << 24;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;\n\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;\n\n/**\n * @type {!Long}\n * @const\n * @inner\n */\nvar TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);\n\n/**\n * @type {!Long}\n * @inner\n */\nvar ZERO = fromInt(0);\n\n/**\n * Signed zero.\n * @type {!Long}\n */\nLong.ZERO = ZERO;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar UZERO = fromInt(0, true);\n\n/**\n * Unsigned zero.\n * @type {!Long}\n */\nLong.UZERO = UZERO;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar ONE = fromInt(1);\n\n/**\n * Signed one.\n * @type {!Long}\n */\nLong.ONE = ONE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar UONE = fromInt(1, true);\n\n/**\n * Unsigned one.\n * @type {!Long}\n */\nLong.UONE = UONE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar NEG_ONE = fromInt(-1);\n\n/**\n * Signed negative one.\n * @type {!Long}\n */\nLong.NEG_ONE = NEG_ONE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar MAX_VALUE = fromBits(0xFFFFFFFF|0, 0x7FFFFFFF|0, false);\n\n/**\n * Maximum signed value.\n * @type {!Long}\n */\nLong.MAX_VALUE = MAX_VALUE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF|0, 0xFFFFFFFF|0, true);\n\n/**\n * Maximum unsigned value.\n * @type {!Long}\n */\nLong.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;\n\n/**\n * @type {!Long}\n * @inner\n */\nvar MIN_VALUE = fromBits(0, 0x80000000|0, false);\n\n/**\n * Minimum signed value.\n * @type {!Long}\n */\nLong.MIN_VALUE = MIN_VALUE;\n\n/**\n * @alias Long.prototype\n * @inner\n */\nvar LongPrototype = Long.prototype;\n\n/**\n * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.\n * @this {!Long}\n * @returns {number}\n */\nLongPrototype.toInt = function toInt() {\n    return this.unsigned ? this.low >>> 0 : this.low;\n};\n\n/**\n * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).\n * @this {!Long}\n * @returns {number}\n */\nLongPrototype.toNumber = function toNumber() {\n    if (this.unsigned)\n        return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);\n    return this.high * TWO_PWR_32_DBL + (this.low >>> 0);\n};\n\n/**\n * Converts the Long to a string written in the specified radix.\n * @this {!Long}\n * @param {number=} radix Radix (2-36), defaults to 10\n * @returns {string}\n * @override\n * @throws {RangeError} If `radix` is out of range\n */\nLongPrototype.toString = function toString(radix) {\n    radix = radix || 10;\n    if (radix < 2 || 36 < radix)\n        throw RangeError('radix');\n    if (this.isZero())\n        return '0';\n    if (this.isNegative()) { // Unsigned Longs are never negative\n        if (this.eq(MIN_VALUE)) {\n            // We need to change the Long value before it can be negated, so we remove\n            // the bottom-most digit in this base and then recurse to do the rest.\n            var radixLong = fromNumber(radix),\n                div = this.div(radixLong),\n                rem1 = div.mul(radixLong).sub(this);\n            return div.toString(radix) + rem1.toInt().toString(radix);\n        } else\n            return '-' + this.neg().toString(radix);\n    }\n\n    // Do several (6) digits each time through the loop, so as to\n    // minimize the calls to the very expensive emulated div.\n    var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),\n        rem = this;\n    var result = '';\n    while (true) {\n        var remDiv = rem.div(radixToPower),\n            intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,\n            digits = intval.toString(radix);\n        rem = remDiv;\n        if (rem.isZero())\n            return digits + result;\n        else {\n            while (digits.length < 6)\n                digits = '0' + digits;\n            result = '' + digits + result;\n        }\n    }\n};\n\n/**\n * Gets the high 32 bits as a signed integer.\n * @this {!Long}\n * @returns {number} Signed high bits\n */\nLongPrototype.getHighBits = function getHighBits() {\n    return this.high;\n};\n\n/**\n * Gets the high 32 bits as an unsigned integer.\n * @this {!Long}\n * @returns {number} Unsigned high bits\n */\nLongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {\n    return this.high >>> 0;\n};\n\n/**\n * Gets the low 32 bits as a signed integer.\n * @this {!Long}\n * @returns {number} Signed low bits\n */\nLongPrototype.getLowBits = function getLowBits() {\n    return this.low;\n};\n\n/**\n * Gets the low 32 bits as an unsigned integer.\n * @this {!Long}\n * @returns {number} Unsigned low bits\n */\nLongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {\n    return this.low >>> 0;\n};\n\n/**\n * Gets the number of bits needed to represent the absolute value of this Long.\n * @this {!Long}\n * @returns {number}\n */\nLongPrototype.getNumBitsAbs = function getNumBitsAbs() {\n    if (this.isNegative()) // Unsigned Longs are never negative\n        return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();\n    var val = this.high != 0 ? this.high : this.low;\n    for (var bit = 31; bit > 0; bit--)\n        if ((val & (1 << bit)) != 0)\n            break;\n    return this.high != 0 ? bit + 33 : bit + 1;\n};\n\n/**\n * Tests if this Long's value equals zero.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isZero = function isZero() {\n    return this.high === 0 && this.low === 0;\n};\n\n/**\n * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.\n * @returns {boolean}\n */\nLongPrototype.eqz = LongPrototype.isZero;\n\n/**\n * Tests if this Long's value is negative.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isNegative = function isNegative() {\n    return !this.unsigned && this.high < 0;\n};\n\n/**\n * Tests if this Long's value is positive.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isPositive = function isPositive() {\n    return this.unsigned || this.high >= 0;\n};\n\n/**\n * Tests if this Long's value is odd.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isOdd = function isOdd() {\n    return (this.low & 1) === 1;\n};\n\n/**\n * Tests if this Long's value is even.\n * @this {!Long}\n * @returns {boolean}\n */\nLongPrototype.isEven = function isEven() {\n    return (this.low & 1) === 0;\n};\n\n/**\n * Tests if this Long's value equals the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.equals = function equals(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)\n        return false;\n    return this.high === other.high && this.low === other.low;\n};\n\n/**\n * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.eq = LongPrototype.equals;\n\n/**\n * Tests if this Long's value differs from the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.notEquals = function notEquals(other) {\n    return !this.eq(/* validates */ other);\n};\n\n/**\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.neq = LongPrototype.notEquals;\n\n/**\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.ne = LongPrototype.notEquals;\n\n/**\n * Tests if this Long's value is less than the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lessThan = function lessThan(other) {\n    return this.comp(/* validates */ other) < 0;\n};\n\n/**\n * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lt = LongPrototype.lessThan;\n\n/**\n * Tests if this Long's value is less than or equal the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {\n    return this.comp(/* validates */ other) <= 0;\n};\n\n/**\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.lte = LongPrototype.lessThanOrEqual;\n\n/**\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.le = LongPrototype.lessThanOrEqual;\n\n/**\n * Tests if this Long's value is greater than the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.greaterThan = function greaterThan(other) {\n    return this.comp(/* validates */ other) > 0;\n};\n\n/**\n * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.gt = LongPrototype.greaterThan;\n\n/**\n * Tests if this Long's value is greater than or equal the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {\n    return this.comp(/* validates */ other) >= 0;\n};\n\n/**\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.gte = LongPrototype.greaterThanOrEqual;\n\n/**\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nLongPrototype.ge = LongPrototype.greaterThanOrEqual;\n\n/**\n * Compares this Long's value with the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n *  if the given one is greater\n */\nLongPrototype.compare = function compare(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    if (this.eq(other))\n        return 0;\n    var thisNeg = this.isNegative(),\n        otherNeg = other.isNegative();\n    if (thisNeg && !otherNeg)\n        return -1;\n    if (!thisNeg && otherNeg)\n        return 1;\n    // At this point the sign bits are the same\n    if (!this.unsigned)\n        return this.sub(other).isNegative() ? -1 : 1;\n    // Both are positive if at least one is unsigned\n    return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;\n};\n\n/**\n * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n *  if the given one is greater\n */\nLongPrototype.comp = LongPrototype.compare;\n\n/**\n * Negates this Long's value.\n * @this {!Long}\n * @returns {!Long} Negated Long\n */\nLongPrototype.negate = function negate() {\n    if (!this.unsigned && this.eq(MIN_VALUE))\n        return MIN_VALUE;\n    return this.not().add(ONE);\n};\n\n/**\n * Negates this Long's value. This is an alias of {@link Long#negate}.\n * @function\n * @returns {!Long} Negated Long\n */\nLongPrototype.neg = LongPrototype.negate;\n\n/**\n * Returns the sum of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} addend Addend\n * @returns {!Long} Sum\n */\nLongPrototype.add = function add(addend) {\n    if (!isLong(addend))\n        addend = fromValue(addend);\n\n    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\n\n    var a48 = this.high >>> 16;\n    var a32 = this.high & 0xFFFF;\n    var a16 = this.low >>> 16;\n    var a00 = this.low & 0xFFFF;\n\n    var b48 = addend.high >>> 16;\n    var b32 = addend.high & 0xFFFF;\n    var b16 = addend.low >>> 16;\n    var b00 = addend.low & 0xFFFF;\n\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\n    c00 += a00 + b00;\n    c16 += c00 >>> 16;\n    c00 &= 0xFFFF;\n    c16 += a16 + b16;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c32 += a32 + b32;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c48 += a48 + b48;\n    c48 &= 0xFFFF;\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\n};\n\n/**\n * Returns the difference of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} subtrahend Subtrahend\n * @returns {!Long} Difference\n */\nLongPrototype.subtract = function subtract(subtrahend) {\n    if (!isLong(subtrahend))\n        subtrahend = fromValue(subtrahend);\n    return this.add(subtrahend.neg());\n};\n\n/**\n * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.\n * @function\n * @param {!Long|number|string} subtrahend Subtrahend\n * @returns {!Long} Difference\n */\nLongPrototype.sub = LongPrototype.subtract;\n\n/**\n * Returns the product of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} multiplier Multiplier\n * @returns {!Long} Product\n */\nLongPrototype.multiply = function multiply(multiplier) {\n    if (this.isZero())\n        return ZERO;\n    if (!isLong(multiplier))\n        multiplier = fromValue(multiplier);\n\n    // use wasm support if present\n    if (wasm) {\n        var low = wasm[\"mul\"](this.low,\n                              this.high,\n                              multiplier.low,\n                              multiplier.high);\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n    }\n\n    if (multiplier.isZero())\n        return ZERO;\n    if (this.eq(MIN_VALUE))\n        return multiplier.isOdd() ? MIN_VALUE : ZERO;\n    if (multiplier.eq(MIN_VALUE))\n        return this.isOdd() ? MIN_VALUE : ZERO;\n\n    if (this.isNegative()) {\n        if (multiplier.isNegative())\n            return this.neg().mul(multiplier.neg());\n        else\n            return this.neg().mul(multiplier).neg();\n    } else if (multiplier.isNegative())\n        return this.mul(multiplier.neg()).neg();\n\n    // If both longs are small, use float multiplication\n    if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))\n        return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);\n\n    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.\n    // We can skip products that would overflow.\n\n    var a48 = this.high >>> 16;\n    var a32 = this.high & 0xFFFF;\n    var a16 = this.low >>> 16;\n    var a00 = this.low & 0xFFFF;\n\n    var b48 = multiplier.high >>> 16;\n    var b32 = multiplier.high & 0xFFFF;\n    var b16 = multiplier.low >>> 16;\n    var b00 = multiplier.low & 0xFFFF;\n\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\n    c00 += a00 * b00;\n    c16 += c00 >>> 16;\n    c00 &= 0xFFFF;\n    c16 += a16 * b00;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c16 += a00 * b16;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c32 += a32 * b00;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c32 += a16 * b16;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c32 += a00 * b32;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;\n    c48 &= 0xFFFF;\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\n};\n\n/**\n * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.\n * @function\n * @param {!Long|number|string} multiplier Multiplier\n * @returns {!Long} Product\n */\nLongPrototype.mul = LongPrototype.multiply;\n\n/**\n * Returns this Long divided by the specified. The result is signed if this Long is signed or\n *  unsigned if this Long is unsigned.\n * @this {!Long}\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Quotient\n */\nLongPrototype.divide = function divide(divisor) {\n    if (!isLong(divisor))\n        divisor = fromValue(divisor);\n    if (divisor.isZero())\n        throw Error('division by zero');\n\n    // use wasm support if present\n    if (wasm) {\n        // guard against signed division overflow: the largest\n        // negative number / -1 would be 1 larger than the largest\n        // positive number, due to two's complement.\n        if (!this.unsigned &&\n            this.high === -0x80000000 &&\n            divisor.low === -1 && divisor.high === -1) {\n            // be consistent with non-wasm code path\n            return this;\n        }\n        var low = (this.unsigned ? wasm[\"div_u\"] : wasm[\"div_s\"])(\n            this.low,\n            this.high,\n            divisor.low,\n            divisor.high\n        );\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n    }\n\n    if (this.isZero())\n        return this.unsigned ? UZERO : ZERO;\n    var approx, rem, res;\n    if (!this.unsigned) {\n        // This section is only relevant for signed longs and is derived from the\n        // closure library as a whole.\n        if (this.eq(MIN_VALUE)) {\n            if (divisor.eq(ONE) || divisor.eq(NEG_ONE))\n                return MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE\n            else if (divisor.eq(MIN_VALUE))\n                return ONE;\n            else {\n                // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.\n                var halfThis = this.shr(1);\n                approx = halfThis.div(divisor).shl(1);\n                if (approx.eq(ZERO)) {\n                    return divisor.isNegative() ? ONE : NEG_ONE;\n                } else {\n                    rem = this.sub(divisor.mul(approx));\n                    res = approx.add(rem.div(divisor));\n                    return res;\n                }\n            }\n        } else if (divisor.eq(MIN_VALUE))\n            return this.unsigned ? UZERO : ZERO;\n        if (this.isNegative()) {\n            if (divisor.isNegative())\n                return this.neg().div(divisor.neg());\n            return this.neg().div(divisor).neg();\n        } else if (divisor.isNegative())\n            return this.div(divisor.neg()).neg();\n        res = ZERO;\n    } else {\n        // The algorithm below has not been made for unsigned longs. It's therefore\n        // required to take special care of the MSB prior to running it.\n        if (!divisor.unsigned)\n            divisor = divisor.toUnsigned();\n        if (divisor.gt(this))\n            return UZERO;\n        if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true\n            return UONE;\n        res = UZERO;\n    }\n\n    // Repeat the following until the remainder is less than other:  find a\n    // floating-point that approximates remainder / other *from below*, add this\n    // into the result, and subtract it from the remainder.  It is critical that\n    // the approximate value is less than or equal to the real value so that the\n    // remainder never becomes negative.\n    rem = this;\n    while (rem.gte(divisor)) {\n        // Approximate the result of division. This may be a little greater or\n        // smaller than the actual value.\n        approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));\n\n        // We will tweak the approximate result by changing it in the 48-th digit or\n        // the smallest non-fractional digit, whichever is larger.\n        var log2 = Math.ceil(Math.log(approx) / Math.LN2),\n            delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),\n\n        // Decrease the approximation until it is smaller than the remainder.  Note\n        // that if it is too large, the product overflows and is negative.\n            approxRes = fromNumber(approx),\n            approxRem = approxRes.mul(divisor);\n        while (approxRem.isNegative() || approxRem.gt(rem)) {\n            approx -= delta;\n            approxRes = fromNumber(approx, this.unsigned);\n            approxRem = approxRes.mul(divisor);\n        }\n\n        // We know the answer can't be zero... and actually, zero would cause\n        // infinite recursion since we would make no progress.\n        if (approxRes.isZero())\n            approxRes = ONE;\n\n        res = res.add(approxRes);\n        rem = rem.sub(approxRem);\n    }\n    return res;\n};\n\n/**\n * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Quotient\n */\nLongPrototype.div = LongPrototype.divide;\n\n/**\n * Returns this Long modulo the specified.\n * @this {!Long}\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\nLongPrototype.modulo = function modulo(divisor) {\n    if (!isLong(divisor))\n        divisor = fromValue(divisor);\n\n    // use wasm support if present\n    if (wasm) {\n        var low = (this.unsigned ? wasm[\"rem_u\"] : wasm[\"rem_s\"])(\n            this.low,\n            this.high,\n            divisor.low,\n            divisor.high\n        );\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n    }\n\n    return this.sub(this.div(divisor).mul(divisor));\n};\n\n/**\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\nLongPrototype.mod = LongPrototype.modulo;\n\n/**\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\nLongPrototype.rem = LongPrototype.modulo;\n\n/**\n * Returns the bitwise NOT of this Long.\n * @this {!Long}\n * @returns {!Long}\n */\nLongPrototype.not = function not() {\n    return fromBits(~this.low, ~this.high, this.unsigned);\n};\n\n/**\n * Returns the bitwise AND of this Long and the specified.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nLongPrototype.and = function and(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits(this.low & other.low, this.high & other.high, this.unsigned);\n};\n\n/**\n * Returns the bitwise OR of this Long and the specified.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nLongPrototype.or = function or(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits(this.low | other.low, this.high | other.high, this.unsigned);\n};\n\n/**\n * Returns the bitwise XOR of this Long and the given one.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nLongPrototype.xor = function xor(other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);\n};\n\n/**\n * Returns this Long with bits shifted to the left by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shiftLeft = function shiftLeft(numBits) {\n    if (isLong(numBits))\n        numBits = numBits.toInt();\n    if ((numBits &= 63) === 0)\n        return this;\n    else if (numBits < 32)\n        return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);\n    else\n        return fromBits(0, this.low << (numBits - 32), this.unsigned);\n};\n\n/**\n * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shl = LongPrototype.shiftLeft;\n\n/**\n * Returns this Long with bits arithmetically shifted to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shiftRight = function shiftRight(numBits) {\n    if (isLong(numBits))\n        numBits = numBits.toInt();\n    if ((numBits &= 63) === 0)\n        return this;\n    else if (numBits < 32)\n        return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);\n    else\n        return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);\n};\n\n/**\n * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shr = LongPrototype.shiftRight;\n\n/**\n * Returns this Long with bits logically shifted to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {\n    if (isLong(numBits)) numBits = numBits.toInt();\n    if ((numBits &= 63) === 0) return this;\n    if (numBits < 32) return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >>> numBits, this.unsigned);\n    if (numBits === 32) return fromBits(this.high, 0, this.unsigned);\n    return fromBits(this.high >>> (numBits - 32), 0, this.unsigned);\n};\n\n/**\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shru = LongPrototype.shiftRightUnsigned;\n\n/**\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nLongPrototype.shr_u = LongPrototype.shiftRightUnsigned;\n\n/**\n * Returns this Long with bits rotated to the left by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotateLeft = function rotateLeft(numBits) {\n    var b;\n    if (isLong(numBits)) numBits = numBits.toInt();\n    if ((numBits &= 63) === 0) return this;\n    if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);\n    if (numBits < 32) {\n        b = (32 - numBits);\n        return fromBits(((this.low << numBits) | (this.high >>> b)), ((this.high << numBits) | (this.low >>> b)), this.unsigned);\n    }\n    numBits -= 32;\n    b = (32 - numBits);\n    return fromBits(((this.high << numBits) | (this.low >>> b)), ((this.low << numBits) | (this.high >>> b)), this.unsigned);\n}\n/**\n * Returns this Long with bits rotated to the left by the given amount. This is an alias of {@link Long#rotateLeft}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotl = LongPrototype.rotateLeft;\n\n/**\n * Returns this Long with bits rotated to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotateRight = function rotateRight(numBits) {\n    var b;\n    if (isLong(numBits)) numBits = numBits.toInt();\n    if ((numBits &= 63) === 0) return this;\n    if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);\n    if (numBits < 32) {\n        b = (32 - numBits);\n        return fromBits(((this.high << b) | (this.low >>> numBits)), ((this.low << b) | (this.high >>> numBits)), this.unsigned);\n    }\n    numBits -= 32;\n    b = (32 - numBits);\n    return fromBits(((this.low << b) | (this.high >>> numBits)), ((this.high << b) | (this.low >>> numBits)), this.unsigned);\n}\n/**\n * Returns this Long with bits rotated to the right by the given amount. This is an alias of {@link Long#rotateRight}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nLongPrototype.rotr = LongPrototype.rotateRight;\n\n/**\n * Converts this Long to signed.\n * @this {!Long}\n * @returns {!Long} Signed long\n */\nLongPrototype.toSigned = function toSigned() {\n    if (!this.unsigned)\n        return this;\n    return fromBits(this.low, this.high, false);\n};\n\n/**\n * Converts this Long to unsigned.\n * @this {!Long}\n * @returns {!Long} Unsigned long\n */\nLongPrototype.toUnsigned = function toUnsigned() {\n    if (this.unsigned)\n        return this;\n    return fromBits(this.low, this.high, true);\n};\n\n/**\n * Converts this Long to its byte representation.\n * @param {boolean=} le Whether little or big endian, defaults to big endian\n * @this {!Long}\n * @returns {!Array.<number>} Byte representation\n */\nLongPrototype.toBytes = function toBytes(le) {\n    return le ? this.toBytesLE() : this.toBytesBE();\n};\n\n/**\n * Converts this Long to its little endian byte representation.\n * @this {!Long}\n * @returns {!Array.<number>} Little endian byte representation\n */\nLongPrototype.toBytesLE = function toBytesLE() {\n    var hi = this.high,\n        lo = this.low;\n    return [\n        lo        & 0xff,\n        lo >>>  8 & 0xff,\n        lo >>> 16 & 0xff,\n        lo >>> 24       ,\n        hi        & 0xff,\n        hi >>>  8 & 0xff,\n        hi >>> 16 & 0xff,\n        hi >>> 24\n    ];\n};\n\n/**\n * Converts this Long to its big endian byte representation.\n * @this {!Long}\n * @returns {!Array.<number>} Big endian byte representation\n */\nLongPrototype.toBytesBE = function toBytesBE() {\n    var hi = this.high,\n        lo = this.low;\n    return [\n        hi >>> 24       ,\n        hi >>> 16 & 0xff,\n        hi >>>  8 & 0xff,\n        hi        & 0xff,\n        lo >>> 24       ,\n        lo >>> 16 & 0xff,\n        lo >>>  8 & 0xff,\n        lo        & 0xff\n    ];\n};\n\n/**\n * Creates a Long from its byte representation.\n * @param {!Array.<number>} bytes Byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @param {boolean=} le Whether little or big endian, defaults to big endian\n * @returns {Long} The corresponding Long value\n */\nLong.fromBytes = function fromBytes(bytes, unsigned, le) {\n    return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);\n};\n\n/**\n * Creates a Long from its little endian byte representation.\n * @param {!Array.<number>} bytes Little endian byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {Long} The corresponding Long value\n */\nLong.fromBytesLE = function fromBytesLE(bytes, unsigned) {\n    return new Long(\n        bytes[0]       |\n        bytes[1] <<  8 |\n        bytes[2] << 16 |\n        bytes[3] << 24,\n        bytes[4]       |\n        bytes[5] <<  8 |\n        bytes[6] << 16 |\n        bytes[7] << 24,\n        unsigned\n    );\n};\n\n/**\n * Creates a Long from its big endian byte representation.\n * @param {!Array.<number>} bytes Big endian byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {Long} The corresponding Long value\n */\nLong.fromBytesBE = function fromBytesBE(bytes, unsigned) {\n    return new Long(\n        bytes[4] << 24 |\n        bytes[5] << 16 |\n        bytes[6] <<  8 |\n        bytes[7],\n        bytes[0] << 24 |\n        bytes[1] << 16 |\n        bytes[2] <<  8 |\n        bytes[3],\n        unsigned\n    );\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/long.js\n// module id = 0\n// module chunks = 0"],"sourceRoot":""}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/index.d.ts b/node_modules/mathjs/examples/node_modules/@xtuc/long/index.d.ts
new file mode 100644
index 0000000..04dfea6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/index.d.ts
@@ -0,0 +1,429 @@
+export = Long;
+export as namespace Long;
+
+declare namespace Long { }
+
+declare class Long {
+    /**
+     * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as signed integers. See the from* functions below for more convenient ways of constructing Longs.
+     */
+    constructor(low: number, high?: number, unsigned?: boolean);
+
+    /**
+     * Maximum unsigned value.
+     */
+    static MAX_UNSIGNED_VALUE: Long;
+
+    /**
+     * Maximum signed value.
+     */
+    static MAX_VALUE: Long;
+
+    /**
+     * Minimum signed value.
+     */
+    static MIN_VALUE: Long;
+
+    /**
+     * Signed negative one.
+     */
+    static NEG_ONE: Long;
+
+    /**
+     * Signed one.
+     */
+    static ONE: Long;
+
+    /**
+     * Unsigned one.
+     */
+    static UONE: Long;
+
+    /**
+     * Unsigned zero.
+     */
+    static UZERO: Long;
+
+    /**
+     * Signed zero
+     */
+    static ZERO: Long;
+
+    /**
+     * The high 32 bits as a signed value.
+     */
+    high: number;
+
+    /**
+     * The low 32 bits as a signed value.
+     */
+    low: number;
+
+    /**
+     * Whether unsigned or not.
+     */
+    unsigned: boolean;
+
+    /**
+     * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is assumed to use 32 bits.
+     */
+    static fromBits(lowBits: number, highBits: number, unsigned?: boolean): Long;
+
+    /**
+     * Returns a Long representing the given 32 bit integer value.
+     */
+    static fromInt(value: number, unsigned?: boolean): Long;
+
+    /**
+     * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+     */
+    static fromNumber(value: number, unsigned?: boolean): Long;
+
+    /**
+     * Returns a Long representation of the given string, written using the specified radix.
+     */
+    static fromString(str: string, unsigned?: boolean | number, radix?: number): Long;
+
+    /**
+     * Creates a Long from its byte representation.
+     */
+    static fromBytes(bytes: number[], unsigned?: boolean, le?: boolean): Long;
+
+    /**
+     * Creates a Long from its little endian byte representation.
+     */
+    static fromBytesLE(bytes: number[], unsigned?: boolean): Long;
+
+    /**
+     * Creates a Long from its big endian byte representation.
+     */
+    static fromBytesBE(bytes: number[], unsigned?: boolean): Long;
+
+    /**
+     * Tests if the specified object is a Long.
+     */
+    static isLong(obj: any): obj is Long;
+
+    /**
+     * Converts the specified value to a Long.
+     */
+    static fromValue(val: Long | number | string | {low: number, high: number, unsigned: boolean}, unsigned?: boolean): Long;
+
+    /**
+     * Returns the sum of this and the specified Long.
+     */
+    add(addend: number | Long | string): Long;
+
+    /**
+     * Returns the bitwise AND of this Long and the specified.
+     */
+    and(other: Long | number | string): Long;
+
+    /**
+     * Compares this Long's value with the specified's.
+     */
+    compare(other: Long | number | string): number;
+
+    /**
+     * Compares this Long's value with the specified's.
+     */
+    comp(other: Long | number | string): number;
+
+    /**
+     * Returns this Long divided by the specified.
+     */
+    divide(divisor: Long | number | string): Long;
+
+    /**
+     * Returns this Long divided by the specified.
+     */
+    div(divisor: Long | number | string): Long;
+
+    /**
+     * Tests if this Long's value equals the specified's.
+     */
+    equals(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value equals the specified's.
+     */
+    eq(other: Long | number | string): boolean;
+
+    /**
+     * Gets the high 32 bits as a signed integer.
+     */
+    getHighBits(): number;
+
+    /**
+     * Gets the high 32 bits as an unsigned integer.
+     */
+    getHighBitsUnsigned(): number;
+
+    /**
+     * Gets the low 32 bits as a signed integer.
+     */
+    getLowBits(): number;
+
+    /**
+     * Gets the low 32 bits as an unsigned integer.
+     */
+    getLowBitsUnsigned(): number;
+
+    /**
+     * Gets the number of bits needed to represent the absolute value of this Long.
+     */
+    getNumBitsAbs(): number;
+
+    /**
+     * Tests if this Long's value is greater than the specified's.
+     */
+    greaterThan(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is greater than the specified's.
+     */
+    gt(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is greater than or equal the specified's.
+     */
+    greaterThanOrEqual(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is greater than or equal the specified's.
+     */
+    gte(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is greater than or equal the specified's.
+     */
+    ge(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is even.
+     */
+    isEven(): boolean;
+
+    /**
+     * Tests if this Long's value is negative.
+     */
+    isNegative(): boolean;
+
+    /**
+     * Tests if this Long's value is odd.
+     */
+    isOdd(): boolean;
+
+    /**
+     * Tests if this Long's value is positive.
+     */
+    isPositive(): boolean;
+
+    /**
+     * Tests if this Long's value equals zero.
+     */
+    isZero(): boolean;
+
+    /**
+     * Tests if this Long's value equals zero.
+     */
+    eqz(): boolean;
+
+    /**
+     * Tests if this Long's value is less than the specified's.
+     */
+    lessThan(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is less than the specified's.
+     */
+    lt(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is less than or equal the specified's.
+     */
+    lessThanOrEqual(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is less than or equal the specified's.
+     */
+    lte(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value is less than or equal the specified's.
+     */
+    le(other: Long | number | string): boolean;
+
+    /**
+     * Returns this Long modulo the specified.
+     */
+    modulo(other: Long | number | string): Long;
+
+    /**
+     * Returns this Long modulo the specified.
+     */
+    mod(other: Long | number | string): Long;
+
+    /**
+     * Returns this Long modulo the specified.
+     */
+    rem(other: Long | number | string): Long;
+
+    /**
+     * Returns the product of this and the specified Long.
+     */
+    multiply(multiplier: Long | number | string): Long;
+
+    /**
+     * Returns the product of this and the specified Long.
+     */
+    mul(multiplier: Long | number | string): Long;
+
+    /**
+     * Negates this Long's value.
+     */
+    negate(): Long;
+
+    /**
+     * Negates this Long's value.
+     */
+    neg(): Long;
+
+    /**
+     * Returns the bitwise NOT of this Long.
+     */
+    not(): Long;
+
+    /**
+     * Tests if this Long's value differs from the specified's.
+     */
+    notEquals(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value differs from the specified's.
+     */
+    neq(other: Long | number | string): boolean;
+
+    /**
+     * Tests if this Long's value differs from the specified's.
+     */
+    ne(other: Long | number | string): boolean;
+
+    /**
+     * Returns the bitwise OR of this Long and the specified.
+     */
+    or(other: Long | number | string): Long;
+
+    /**
+     * Returns this Long with bits shifted to the left by the given amount.
+     */
+    shiftLeft(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits shifted to the left by the given amount.
+     */
+    shl(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits arithmetically shifted to the right by the given amount.
+     */
+    shiftRight(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits arithmetically shifted to the right by the given amount.
+     */
+    shr(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits logically shifted to the right by the given amount.
+     */
+    shiftRightUnsigned(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits logically shifted to the right by the given amount.
+     */
+    shru(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits logically shifted to the right by the given amount.
+     */
+    shr_u(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits rotated to the left by the given amount.
+     */
+    rotateLeft(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits rotated to the left by the given amount.
+     */
+    rotl(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits rotated to the right by the given amount.
+     */
+    rotateRight(numBits: number | Long): Long;
+
+    /**
+     * Returns this Long with bits rotated to the right by the given amount.
+     */
+    rotr(numBits: number | Long): Long;
+
+    /**
+     * Returns the difference of this and the specified Long.
+     */
+    subtract(subtrahend: number | Long | string): Long;
+
+    /**
+     * Returns the difference of this and the specified Long.
+     */
+    sub(subtrahend: number | Long |string): Long;
+
+    /**
+     * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.
+     */
+    toInt(): number;
+
+    /**
+     * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).
+     */
+    toNumber(): number;
+
+    /**
+     * Converts this Long to its byte representation.
+     */
+
+    toBytes(le?: boolean): number[];
+
+    /**
+     * Converts this Long to its little endian byte representation.
+     */
+
+    toBytesLE(): number[];
+
+    /**
+     * Converts this Long to its big endian byte representation.
+     */
+
+    toBytesBE(): number[];
+
+    /**
+     * Converts this Long to signed.
+     */
+    toSigned(): Long;
+
+    /**
+     * Converts the Long to a string written in the specified radix.
+     */
+    toString(radix?: number): string;
+
+    /**
+     * Converts this Long to unsigned.
+     */
+    toUnsigned(): Long;
+
+    /**
+     * Returns the bitwise XOR of this Long and the given one.
+     */
+    xor(other: Long | number | string): Long;
+}
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/index.js b/node_modules/mathjs/examples/node_modules/@xtuc/long/index.js
new file mode 100644
index 0000000..e16857a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/index.js
@@ -0,0 +1 @@
+module.exports = require("./src/long");
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/package.json b/node_modules/mathjs/examples/node_modules/@xtuc/long/package.json
new file mode 100644
index 0000000..648a5bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/package.json
@@ -0,0 +1,36 @@
+{
+    "name": "@xtuc/long",
+    "version": "4.2.2",
+    "author": "Daniel Wirtz <dcode@dcode.io>",
+    "description": "A Long class for representing a 64-bit two's-complement integer value.",
+    "main": "src/long.js",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/dcodeIO/long.js.git"
+    },
+    "bugs": {
+        "url": "https://github.com/dcodeIO/long.js/issues"
+    },
+    "keywords": [
+        "math"
+    ],
+    "dependencies": {},
+    "devDependencies": {
+        "webpack": "^3.10.0"
+    },
+    "license": "Apache-2.0",
+    "scripts": {
+        "build": "webpack",
+        "test": "node tests"
+    },
+    "files": [
+        "index.js",
+        "LICENSE",
+        "README.md",
+        "src/long.js",
+        "dist/long.js",
+        "dist/long.js.map",
+        "index.d.ts"
+    ],
+    "types": "index.d.ts"
+}
diff --git a/node_modules/mathjs/examples/node_modules/@xtuc/long/src/long.js b/node_modules/mathjs/examples/node_modules/@xtuc/long/src/long.js
new file mode 100644
index 0000000..e1dfd57
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/@xtuc/long/src/long.js
@@ -0,0 +1,1405 @@
+module.exports = Long;
+
+/**
+ * wasm optimizations, to do native i64 multiplication and divide
+ */
+var wasm = null;
+
+try {
+  wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
+    0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11
+  ])), {}).exports;
+} catch (e) {
+  // no wasm support :(
+}
+
+/**
+ * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.
+ *  See the from* functions below for more convenient ways of constructing Longs.
+ * @exports Long
+ * @class A Long class for representing a 64 bit two's-complement integer value.
+ * @param {number} low The low (signed) 32 bits of the long
+ * @param {number} high The high (signed) 32 bits of the long
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @constructor
+ */
+function Long(low, high, unsigned) {
+
+    /**
+     * The low 32 bits as a signed value.
+     * @type {number}
+     */
+    this.low = low | 0;
+
+    /**
+     * The high 32 bits as a signed value.
+     * @type {number}
+     */
+    this.high = high | 0;
+
+    /**
+     * Whether unsigned or not.
+     * @type {boolean}
+     */
+    this.unsigned = !!unsigned;
+}
+
+// The internal representation of a long is the two given signed, 32-bit values.
+// We use 32-bit pieces because these are the size of integers on which
+// Javascript performs bit-operations.  For operations like addition and
+// multiplication, we split each number into 16 bit pieces, which can easily be
+// multiplied within Javascript's floating-point representation without overflow
+// or change in sign.
+//
+// In the algorithms below, we frequently reduce the negative case to the
+// positive case by negating the input(s) and then post-processing the result.
+// Note that we must ALWAYS check specially whether those values are MIN_VALUE
+// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+// a positive number, it overflows back into a negative).  Not handling this
+// case would often result in infinite recursion.
+//
+// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*
+// methods on which they depend.
+
+/**
+ * An indicator used to reliably determine if an object is a Long or not.
+ * @type {boolean}
+ * @const
+ * @private
+ */
+Long.prototype.__isLong__;
+
+Object.defineProperty(Long.prototype, "__isLong__", { value: true });
+
+/**
+ * @function
+ * @param {*} obj Object
+ * @returns {boolean}
+ * @inner
+ */
+function isLong(obj) {
+    return (obj && obj["__isLong__"]) === true;
+}
+
+/**
+ * Tests if the specified object is a Long.
+ * @function
+ * @param {*} obj Object
+ * @returns {boolean}
+ */
+Long.isLong = isLong;
+
+/**
+ * A cache of the Long representations of small integer values.
+ * @type {!Object}
+ * @inner
+ */
+var INT_CACHE = {};
+
+/**
+ * A cache of the Long representations of small unsigned integer values.
+ * @type {!Object}
+ * @inner
+ */
+var UINT_CACHE = {};
+
+/**
+ * @param {number} value
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromInt(value, unsigned) {
+    var obj, cachedObj, cache;
+    if (unsigned) {
+        value >>>= 0;
+        if (cache = (0 <= value && value < 256)) {
+            cachedObj = UINT_CACHE[value];
+            if (cachedObj)
+                return cachedObj;
+        }
+        obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);
+        if (cache)
+            UINT_CACHE[value] = obj;
+        return obj;
+    } else {
+        value |= 0;
+        if (cache = (-128 <= value && value < 128)) {
+            cachedObj = INT_CACHE[value];
+            if (cachedObj)
+                return cachedObj;
+        }
+        obj = fromBits(value, value < 0 ? -1 : 0, false);
+        if (cache)
+            INT_CACHE[value] = obj;
+        return obj;
+    }
+}
+
+/**
+ * Returns a Long representing the given 32 bit integer value.
+ * @function
+ * @param {number} value The 32 bit integer in question
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromInt = fromInt;
+
+/**
+ * @param {number} value
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromNumber(value, unsigned) {
+    if (isNaN(value))
+        return unsigned ? UZERO : ZERO;
+    if (unsigned) {
+        if (value < 0)
+            return UZERO;
+        if (value >= TWO_PWR_64_DBL)
+            return MAX_UNSIGNED_VALUE;
+    } else {
+        if (value <= -TWO_PWR_63_DBL)
+            return MIN_VALUE;
+        if (value + 1 >= TWO_PWR_63_DBL)
+            return MAX_VALUE;
+    }
+    if (value < 0)
+        return fromNumber(-value, unsigned).neg();
+    return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);
+}
+
+/**
+ * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+ * @function
+ * @param {number} value The number in question
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromNumber = fromNumber;
+
+/**
+ * @param {number} lowBits
+ * @param {number} highBits
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromBits(lowBits, highBits, unsigned) {
+    return new Long(lowBits, highBits, unsigned);
+}
+
+/**
+ * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is
+ *  assumed to use 32 bits.
+ * @function
+ * @param {number} lowBits The low 32 bits
+ * @param {number} highBits The high 32 bits
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromBits = fromBits;
+
+/**
+ * @function
+ * @param {number} base
+ * @param {number} exponent
+ * @returns {number}
+ * @inner
+ */
+var pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)
+
+/**
+ * @param {string} str
+ * @param {(boolean|number)=} unsigned
+ * @param {number=} radix
+ * @returns {!Long}
+ * @inner
+ */
+function fromString(str, unsigned, radix) {
+    if (str.length === 0)
+        throw Error('empty string');
+    if (str === "NaN" || str === "Infinity" || str === "+Infinity" || str === "-Infinity")
+        return ZERO;
+    if (typeof unsigned === 'number') {
+        // For goog.math.long compatibility
+        radix = unsigned,
+        unsigned = false;
+    } else {
+        unsigned = !! unsigned;
+    }
+    radix = radix || 10;
+    if (radix < 2 || 36 < radix)
+        throw RangeError('radix');
+
+    var p;
+    if ((p = str.indexOf('-')) > 0)
+        throw Error('interior hyphen');
+    else if (p === 0) {
+        return fromString(str.substring(1), unsigned, radix).neg();
+    }
+
+    // Do several (8) digits each time through the loop, so as to
+    // minimize the calls to the very expensive emulated div.
+    var radixToPower = fromNumber(pow_dbl(radix, 8));
+
+    var result = ZERO;
+    for (var i = 0; i < str.length; i += 8) {
+        var size = Math.min(8, str.length - i),
+            value = parseInt(str.substring(i, i + size), radix);
+        if (size < 8) {
+            var power = fromNumber(pow_dbl(radix, size));
+            result = result.mul(power).add(fromNumber(value));
+        } else {
+            result = result.mul(radixToPower);
+            result = result.add(fromNumber(value));
+        }
+    }
+    result.unsigned = unsigned;
+    return result;
+}
+
+/**
+ * Returns a Long representation of the given string, written using the specified radix.
+ * @function
+ * @param {string} str The textual representation of the Long
+ * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed
+ * @param {number=} radix The radix in which the text is written (2-36), defaults to 10
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromString = fromString;
+
+/**
+ * @function
+ * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromValue(val, unsigned) {
+    if (typeof val === 'number')
+        return fromNumber(val, unsigned);
+    if (typeof val === 'string')
+        return fromString(val, unsigned);
+    // Throws for non-objects, converts non-instanceof Long:
+    return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);
+}
+
+/**
+ * Converts the specified value to a Long using the appropriate from* function for its type.
+ * @function
+ * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long}
+ */
+Long.fromValue = fromValue;
+
+// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be
+// no runtime penalty for these.
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_16_DBL = 1 << 16;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_24_DBL = 1 << 24;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;
+
+/**
+ * @type {!Long}
+ * @const
+ * @inner
+ */
+var TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var ZERO = fromInt(0);
+
+/**
+ * Signed zero.
+ * @type {!Long}
+ */
+Long.ZERO = ZERO;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var UZERO = fromInt(0, true);
+
+/**
+ * Unsigned zero.
+ * @type {!Long}
+ */
+Long.UZERO = UZERO;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var ONE = fromInt(1);
+
+/**
+ * Signed one.
+ * @type {!Long}
+ */
+Long.ONE = ONE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var UONE = fromInt(1, true);
+
+/**
+ * Unsigned one.
+ * @type {!Long}
+ */
+Long.UONE = UONE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var NEG_ONE = fromInt(-1);
+
+/**
+ * Signed negative one.
+ * @type {!Long}
+ */
+Long.NEG_ONE = NEG_ONE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var MAX_VALUE = fromBits(0xFFFFFFFF|0, 0x7FFFFFFF|0, false);
+
+/**
+ * Maximum signed value.
+ * @type {!Long}
+ */
+Long.MAX_VALUE = MAX_VALUE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF|0, 0xFFFFFFFF|0, true);
+
+/**
+ * Maximum unsigned value.
+ * @type {!Long}
+ */
+Long.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var MIN_VALUE = fromBits(0, 0x80000000|0, false);
+
+/**
+ * Minimum signed value.
+ * @type {!Long}
+ */
+Long.MIN_VALUE = MIN_VALUE;
+
+/**
+ * @alias Long.prototype
+ * @inner
+ */
+var LongPrototype = Long.prototype;
+
+/**
+ * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.
+ * @this {!Long}
+ * @returns {number}
+ */
+LongPrototype.toInt = function toInt() {
+    return this.unsigned ? this.low >>> 0 : this.low;
+};
+
+/**
+ * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).
+ * @this {!Long}
+ * @returns {number}
+ */
+LongPrototype.toNumber = function toNumber() {
+    if (this.unsigned)
+        return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);
+    return this.high * TWO_PWR_32_DBL + (this.low >>> 0);
+};
+
+/**
+ * Converts the Long to a string written in the specified radix.
+ * @this {!Long}
+ * @param {number=} radix Radix (2-36), defaults to 10
+ * @returns {string}
+ * @override
+ * @throws {RangeError} If `radix` is out of range
+ */
+LongPrototype.toString = function toString(radix) {
+    radix = radix || 10;
+    if (radix < 2 || 36 < radix)
+        throw RangeError('radix');
+    if (this.isZero())
+        return '0';
+    if (this.isNegative()) { // Unsigned Longs are never negative
+        if (this.eq(MIN_VALUE)) {
+            // We need to change the Long value before it can be negated, so we remove
+            // the bottom-most digit in this base and then recurse to do the rest.
+            var radixLong = fromNumber(radix),
+                div = this.div(radixLong),
+                rem1 = div.mul(radixLong).sub(this);
+            return div.toString(radix) + rem1.toInt().toString(radix);
+        } else
+            return '-' + this.neg().toString(radix);
+    }
+
+    // Do several (6) digits each time through the loop, so as to
+    // minimize the calls to the very expensive emulated div.
+    var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),
+        rem = this;
+    var result = '';
+    while (true) {
+        var remDiv = rem.div(radixToPower),
+            intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,
+            digits = intval.toString(radix);
+        rem = remDiv;
+        if (rem.isZero())
+            return digits + result;
+        else {
+            while (digits.length < 6)
+                digits = '0' + digits;
+            result = '' + digits + result;
+        }
+    }
+};
+
+/**
+ * Gets the high 32 bits as a signed integer.
+ * @this {!Long}
+ * @returns {number} Signed high bits
+ */
+LongPrototype.getHighBits = function getHighBits() {
+    return this.high;
+};
+
+/**
+ * Gets the high 32 bits as an unsigned integer.
+ * @this {!Long}
+ * @returns {number} Unsigned high bits
+ */
+LongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {
+    return this.high >>> 0;
+};
+
+/**
+ * Gets the low 32 bits as a signed integer.
+ * @this {!Long}
+ * @returns {number} Signed low bits
+ */
+LongPrototype.getLowBits = function getLowBits() {
+    return this.low;
+};
+
+/**
+ * Gets the low 32 bits as an unsigned integer.
+ * @this {!Long}
+ * @returns {number} Unsigned low bits
+ */
+LongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {
+    return this.low >>> 0;
+};
+
+/**
+ * Gets the number of bits needed to represent the absolute value of this Long.
+ * @this {!Long}
+ * @returns {number}
+ */
+LongPrototype.getNumBitsAbs = function getNumBitsAbs() {
+    if (this.isNegative()) // Unsigned Longs are never negative
+        return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();
+    var val = this.high != 0 ? this.high : this.low;
+    for (var bit = 31; bit > 0; bit--)
+        if ((val & (1 << bit)) != 0)
+            break;
+    return this.high != 0 ? bit + 33 : bit + 1;
+};
+
+/**
+ * Tests if this Long's value equals zero.
+ * @this {!Long}
+ * @returns {boolean}
+ */
+LongPrototype.isZero = function isZero() {
+    return this.high === 0 && this.low === 0;
+};
+
+/**
+ * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.
+ * @returns {boolean}
+ */
+LongPrototype.eqz = LongPrototype.isZero;
+
+/**
+ * Tests if this Long's value is negative.
+ * @this {!Long}
+ * @returns {boolean}
+ */
+LongPrototype.isNegative = function isNegative() {
+    return !this.unsigned && this.high < 0;
+};
+
+/**
+ * Tests if this Long's value is positive.
+ * @this {!Long}
+ * @returns {boolean}
+ */
+LongPrototype.isPositive = function isPositive() {
+    return this.unsigned || this.high >= 0;
+};
+
+/**
+ * Tests if this Long's value is odd.
+ * @this {!Long}
+ * @returns {boolean}
+ */
+LongPrototype.isOdd = function isOdd() {
+    return (this.low & 1) === 1;
+};
+
+/**
+ * Tests if this Long's value is even.
+ * @this {!Long}
+ * @returns {boolean}
+ */
+LongPrototype.isEven = function isEven() {
+    return (this.low & 1) === 0;
+};
+
+/**
+ * Tests if this Long's value equals the specified's.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.equals = function equals(other) {
+    if (!isLong(other))
+        other = fromValue(other);
+    if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)
+        return false;
+    return this.high === other.high && this.low === other.low;
+};
+
+/**
+ * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.eq = LongPrototype.equals;
+
+/**
+ * Tests if this Long's value differs from the specified's.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.notEquals = function notEquals(other) {
+    return !this.eq(/* validates */ other);
+};
+
+/**
+ * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.neq = LongPrototype.notEquals;
+
+/**
+ * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.ne = LongPrototype.notEquals;
+
+/**
+ * Tests if this Long's value is less than the specified's.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lessThan = function lessThan(other) {
+    return this.comp(/* validates */ other) < 0;
+};
+
+/**
+ * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lt = LongPrototype.lessThan;
+
+/**
+ * Tests if this Long's value is less than or equal the specified's.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {
+    return this.comp(/* validates */ other) <= 0;
+};
+
+/**
+ * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lte = LongPrototype.lessThanOrEqual;
+
+/**
+ * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.le = LongPrototype.lessThanOrEqual;
+
+/**
+ * Tests if this Long's value is greater than the specified's.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.greaterThan = function greaterThan(other) {
+    return this.comp(/* validates */ other) > 0;
+};
+
+/**
+ * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.gt = LongPrototype.greaterThan;
+
+/**
+ * Tests if this Long's value is greater than or equal the specified's.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {
+    return this.comp(/* validates */ other) >= 0;
+};
+
+/**
+ * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.gte = LongPrototype.greaterThanOrEqual;
+
+/**
+ * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.ge = LongPrototype.greaterThanOrEqual;
+
+/**
+ * Compares this Long's value with the specified's.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other value
+ * @returns {number} 0 if they are the same, 1 if the this is greater and -1
+ *  if the given one is greater
+ */
+LongPrototype.compare = function compare(other) {
+    if (!isLong(other))
+        other = fromValue(other);
+    if (this.eq(other))
+        return 0;
+    var thisNeg = this.isNegative(),
+        otherNeg = other.isNegative();
+    if (thisNeg && !otherNeg)
+        return -1;
+    if (!thisNeg && otherNeg)
+        return 1;
+    // At this point the sign bits are the same
+    if (!this.unsigned)
+        return this.sub(other).isNegative() ? -1 : 1;
+    // Both are positive if at least one is unsigned
+    return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;
+};
+
+/**
+ * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {number} 0 if they are the same, 1 if the this is greater and -1
+ *  if the given one is greater
+ */
+LongPrototype.comp = LongPrototype.compare;
+
+/**
+ * Negates this Long's value.
+ * @this {!Long}
+ * @returns {!Long} Negated Long
+ */
+LongPrototype.negate = function negate() {
+    if (!this.unsigned && this.eq(MIN_VALUE))
+        return MIN_VALUE;
+    return this.not().add(ONE);
+};
+
+/**
+ * Negates this Long's value. This is an alias of {@link Long#negate}.
+ * @function
+ * @returns {!Long} Negated Long
+ */
+LongPrototype.neg = LongPrototype.negate;
+
+/**
+ * Returns the sum of this and the specified Long.
+ * @this {!Long}
+ * @param {!Long|number|string} addend Addend
+ * @returns {!Long} Sum
+ */
+LongPrototype.add = function add(addend) {
+    if (!isLong(addend))
+        addend = fromValue(addend);
+
+    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+    var a48 = this.high >>> 16;
+    var a32 = this.high & 0xFFFF;
+    var a16 = this.low >>> 16;
+    var a00 = this.low & 0xFFFF;
+
+    var b48 = addend.high >>> 16;
+    var b32 = addend.high & 0xFFFF;
+    var b16 = addend.low >>> 16;
+    var b00 = addend.low & 0xFFFF;
+
+    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+    c00 += a00 + b00;
+    c16 += c00 >>> 16;
+    c00 &= 0xFFFF;
+    c16 += a16 + b16;
+    c32 += c16 >>> 16;
+    c16 &= 0xFFFF;
+    c32 += a32 + b32;
+    c48 += c32 >>> 16;
+    c32 &= 0xFFFF;
+    c48 += a48 + b48;
+    c48 &= 0xFFFF;
+    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
+};
+
+/**
+ * Returns the difference of this and the specified Long.
+ * @this {!Long}
+ * @param {!Long|number|string} subtrahend Subtrahend
+ * @returns {!Long} Difference
+ */
+LongPrototype.subtract = function subtract(subtrahend) {
+    if (!isLong(subtrahend))
+        subtrahend = fromValue(subtrahend);
+    return this.add(subtrahend.neg());
+};
+
+/**
+ * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.
+ * @function
+ * @param {!Long|number|string} subtrahend Subtrahend
+ * @returns {!Long} Difference
+ */
+LongPrototype.sub = LongPrototype.subtract;
+
+/**
+ * Returns the product of this and the specified Long.
+ * @this {!Long}
+ * @param {!Long|number|string} multiplier Multiplier
+ * @returns {!Long} Product
+ */
+LongPrototype.multiply = function multiply(multiplier) {
+    if (this.isZero())
+        return ZERO;
+    if (!isLong(multiplier))
+        multiplier = fromValue(multiplier);
+
+    // use wasm support if present
+    if (wasm) {
+        var low = wasm["mul"](this.low,
+                              this.high,
+                              multiplier.low,
+                              multiplier.high);
+        return fromBits(low, wasm["get_high"](), this.unsigned);
+    }
+
+    if (multiplier.isZero())
+        return ZERO;
+    if (this.eq(MIN_VALUE))
+        return multiplier.isOdd() ? MIN_VALUE : ZERO;
+    if (multiplier.eq(MIN_VALUE))
+        return this.isOdd() ? MIN_VALUE : ZERO;
+
+    if (this.isNegative()) {
+        if (multiplier.isNegative())
+            return this.neg().mul(multiplier.neg());
+        else
+            return this.neg().mul(multiplier).neg();
+    } else if (multiplier.isNegative())
+        return this.mul(multiplier.neg()).neg();
+
+    // If both longs are small, use float multiplication
+    if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))
+        return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);
+
+    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.
+    // We can skip products that would overflow.
+
+    var a48 = this.high >>> 16;
+    var a32 = this.high & 0xFFFF;
+    var a16 = this.low >>> 16;
+    var a00 = this.low & 0xFFFF;
+
+    var b48 = multiplier.high >>> 16;
+    var b32 = multiplier.high & 0xFFFF;
+    var b16 = multiplier.low >>> 16;
+    var b00 = multiplier.low & 0xFFFF;
+
+    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+    c00 += a00 * b00;
+    c16 += c00 >>> 16;
+    c00 &= 0xFFFF;
+    c16 += a16 * b00;
+    c32 += c16 >>> 16;
+    c16 &= 0xFFFF;
+    c16 += a00 * b16;
+    c32 += c16 >>> 16;
+    c16 &= 0xFFFF;
+    c32 += a32 * b00;
+    c48 += c32 >>> 16;
+    c32 &= 0xFFFF;
+    c32 += a16 * b16;
+    c48 += c32 >>> 16;
+    c32 &= 0xFFFF;
+    c32 += a00 * b32;
+    c48 += c32 >>> 16;
+    c32 &= 0xFFFF;
+    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+    c48 &= 0xFFFF;
+    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
+};
+
+/**
+ * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.
+ * @function
+ * @param {!Long|number|string} multiplier Multiplier
+ * @returns {!Long} Product
+ */
+LongPrototype.mul = LongPrototype.multiply;
+
+/**
+ * Returns this Long divided by the specified. The result is signed if this Long is signed or
+ *  unsigned if this Long is unsigned.
+ * @this {!Long}
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Quotient
+ */
+LongPrototype.divide = function divide(divisor) {
+    if (!isLong(divisor))
+        divisor = fromValue(divisor);
+    if (divisor.isZero())
+        throw Error('division by zero');
+
+    // use wasm support if present
+    if (wasm) {
+        // guard against signed division overflow: the largest
+        // negative number / -1 would be 1 larger than the largest
+        // positive number, due to two's complement.
+        if (!this.unsigned &&
+            this.high === -0x80000000 &&
+            divisor.low === -1 && divisor.high === -1) {
+            // be consistent with non-wasm code path
+            return this;
+        }
+        var low = (this.unsigned ? wasm["div_u"] : wasm["div_s"])(
+            this.low,
+            this.high,
+            divisor.low,
+            divisor.high
+        );
+        return fromBits(low, wasm["get_high"](), this.unsigned);
+    }
+
+    if (this.isZero())
+        return this.unsigned ? UZERO : ZERO;
+    var approx, rem, res;
+    if (!this.unsigned) {
+        // This section is only relevant for signed longs and is derived from the
+        // closure library as a whole.
+        if (this.eq(MIN_VALUE)) {
+            if (divisor.eq(ONE) || divisor.eq(NEG_ONE))
+                return MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
+            else if (divisor.eq(MIN_VALUE))
+                return ONE;
+            else {
+                // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+                var halfThis = this.shr(1);
+                approx = halfThis.div(divisor).shl(1);
+                if (approx.eq(ZERO)) {
+                    return divisor.isNegative() ? ONE : NEG_ONE;
+                } else {
+                    rem = this.sub(divisor.mul(approx));
+                    res = approx.add(rem.div(divisor));
+                    return res;
+                }
+            }
+        } else if (divisor.eq(MIN_VALUE))
+            return this.unsigned ? UZERO : ZERO;
+        if (this.isNegative()) {
+            if (divisor.isNegative())
+                return this.neg().div(divisor.neg());
+            return this.neg().div(divisor).neg();
+        } else if (divisor.isNegative())
+            return this.div(divisor.neg()).neg();
+        res = ZERO;
+    } else {
+        // The algorithm below has not been made for unsigned longs. It's therefore
+        // required to take special care of the MSB prior to running it.
+        if (!divisor.unsigned)
+            divisor = divisor.toUnsigned();
+        if (divisor.gt(this))
+            return UZERO;
+        if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true
+            return UONE;
+        res = UZERO;
+    }
+
+    // Repeat the following until the remainder is less than other:  find a
+    // floating-point that approximates remainder / other *from below*, add this
+    // into the result, and subtract it from the remainder.  It is critical that
+    // the approximate value is less than or equal to the real value so that the
+    // remainder never becomes negative.
+    rem = this;
+    while (rem.gte(divisor)) {
+        // Approximate the result of division. This may be a little greater or
+        // smaller than the actual value.
+        approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));
+
+        // We will tweak the approximate result by changing it in the 48-th digit or
+        // the smallest non-fractional digit, whichever is larger.
+        var log2 = Math.ceil(Math.log(approx) / Math.LN2),
+            delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),
+
+        // Decrease the approximation until it is smaller than the remainder.  Note
+        // that if it is too large, the product overflows and is negative.
+            approxRes = fromNumber(approx),
+            approxRem = approxRes.mul(divisor);
+        while (approxRem.isNegative() || approxRem.gt(rem)) {
+            approx -= delta;
+            approxRes = fromNumber(approx, this.unsigned);
+            approxRem = approxRes.mul(divisor);
+        }
+
+        // We know the answer can't be zero... and actually, zero would cause
+        // infinite recursion since we would make no progress.
+        if (approxRes.isZero())
+            approxRes = ONE;
+
+        res = res.add(approxRes);
+        rem = rem.sub(approxRem);
+    }
+    return res;
+};
+
+/**
+ * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.
+ * @function
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Quotient
+ */
+LongPrototype.div = LongPrototype.divide;
+
+/**
+ * Returns this Long modulo the specified.
+ * @this {!Long}
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Remainder
+ */
+LongPrototype.modulo = function modulo(divisor) {
+    if (!isLong(divisor))
+        divisor = fromValue(divisor);
+
+    // use wasm support if present
+    if (wasm) {
+        var low = (this.unsigned ? wasm["rem_u"] : wasm["rem_s"])(
+            this.low,
+            this.high,
+            divisor.low,
+            divisor.high
+        );
+        return fromBits(low, wasm["get_high"](), this.unsigned);
+    }
+
+    return this.sub(this.div(divisor).mul(divisor));
+};
+
+/**
+ * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.
+ * @function
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Remainder
+ */
+LongPrototype.mod = LongPrototype.modulo;
+
+/**
+ * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.
+ * @function
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Remainder
+ */
+LongPrototype.rem = LongPrototype.modulo;
+
+/**
+ * Returns the bitwise NOT of this Long.
+ * @this {!Long}
+ * @returns {!Long}
+ */
+LongPrototype.not = function not() {
+    return fromBits(~this.low, ~this.high, this.unsigned);
+};
+
+/**
+ * Returns the bitwise AND of this Long and the specified.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other Long
+ * @returns {!Long}
+ */
+LongPrototype.and = function and(other) {
+    if (!isLong(other))
+        other = fromValue(other);
+    return fromBits(this.low & other.low, this.high & other.high, this.unsigned);
+};
+
+/**
+ * Returns the bitwise OR of this Long and the specified.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other Long
+ * @returns {!Long}
+ */
+LongPrototype.or = function or(other) {
+    if (!isLong(other))
+        other = fromValue(other);
+    return fromBits(this.low | other.low, this.high | other.high, this.unsigned);
+};
+
+/**
+ * Returns the bitwise XOR of this Long and the given one.
+ * @this {!Long}
+ * @param {!Long|number|string} other Other Long
+ * @returns {!Long}
+ */
+LongPrototype.xor = function xor(other) {
+    if (!isLong(other))
+        other = fromValue(other);
+    return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);
+};
+
+/**
+ * Returns this Long with bits shifted to the left by the given amount.
+ * @this {!Long}
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shiftLeft = function shiftLeft(numBits) {
+    if (isLong(numBits))
+        numBits = numBits.toInt();
+    if ((numBits &= 63) === 0)
+        return this;
+    else if (numBits < 32)
+        return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);
+    else
+        return fromBits(0, this.low << (numBits - 32), this.unsigned);
+};
+
+/**
+ * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shl = LongPrototype.shiftLeft;
+
+/**
+ * Returns this Long with bits arithmetically shifted to the right by the given amount.
+ * @this {!Long}
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shiftRight = function shiftRight(numBits) {
+    if (isLong(numBits))
+        numBits = numBits.toInt();
+    if ((numBits &= 63) === 0)
+        return this;
+    else if (numBits < 32)
+        return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);
+    else
+        return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);
+};
+
+/**
+ * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shr = LongPrototype.shiftRight;
+
+/**
+ * Returns this Long with bits logically shifted to the right by the given amount.
+ * @this {!Long}
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {
+    if (isLong(numBits)) numBits = numBits.toInt();
+    if ((numBits &= 63) === 0) return this;
+    if (numBits < 32) return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >>> numBits, this.unsigned);
+    if (numBits === 32) return fromBits(this.high, 0, this.unsigned);
+    return fromBits(this.high >>> (numBits - 32), 0, this.unsigned);
+};
+
+/**
+ * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shru = LongPrototype.shiftRightUnsigned;
+
+/**
+ * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shr_u = LongPrototype.shiftRightUnsigned;
+
+/**
+ * Returns this Long with bits rotated to the left by the given amount.
+ * @this {!Long}
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Rotated Long
+ */
+LongPrototype.rotateLeft = function rotateLeft(numBits) {
+    var b;
+    if (isLong(numBits)) numBits = numBits.toInt();
+    if ((numBits &= 63) === 0) return this;
+    if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);
+    if (numBits < 32) {
+        b = (32 - numBits);
+        return fromBits(((this.low << numBits) | (this.high >>> b)), ((this.high << numBits) | (this.low >>> b)), this.unsigned);
+    }
+    numBits -= 32;
+    b = (32 - numBits);
+    return fromBits(((this.high << numBits) | (this.low >>> b)), ((this.low << numBits) | (this.high >>> b)), this.unsigned);
+}
+/**
+ * Returns this Long with bits rotated to the left by the given amount. This is an alias of {@link Long#rotateLeft}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Rotated Long
+ */
+LongPrototype.rotl = LongPrototype.rotateLeft;
+
+/**
+ * Returns this Long with bits rotated to the right by the given amount.
+ * @this {!Long}
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Rotated Long
+ */
+LongPrototype.rotateRight = function rotateRight(numBits) {
+    var b;
+    if (isLong(numBits)) numBits = numBits.toInt();
+    if ((numBits &= 63) === 0) return this;
+    if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);
+    if (numBits < 32) {
+        b = (32 - numBits);
+        return fromBits(((this.high << b) | (this.low >>> numBits)), ((this.low << b) | (this.high >>> numBits)), this.unsigned);
+    }
+    numBits -= 32;
+    b = (32 - numBits);
+    return fromBits(((this.low << b) | (this.high >>> numBits)), ((this.high << b) | (this.low >>> numBits)), this.unsigned);
+}
+/**
+ * Returns this Long with bits rotated to the right by the given amount. This is an alias of {@link Long#rotateRight}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Rotated Long
+ */
+LongPrototype.rotr = LongPrototype.rotateRight;
+
+/**
+ * Converts this Long to signed.
+ * @this {!Long}
+ * @returns {!Long} Signed long
+ */
+LongPrototype.toSigned = function toSigned() {
+    if (!this.unsigned)
+        return this;
+    return fromBits(this.low, this.high, false);
+};
+
+/**
+ * Converts this Long to unsigned.
+ * @this {!Long}
+ * @returns {!Long} Unsigned long
+ */
+LongPrototype.toUnsigned = function toUnsigned() {
+    if (this.unsigned)
+        return this;
+    return fromBits(this.low, this.high, true);
+};
+
+/**
+ * Converts this Long to its byte representation.
+ * @param {boolean=} le Whether little or big endian, defaults to big endian
+ * @this {!Long}
+ * @returns {!Array.<number>} Byte representation
+ */
+LongPrototype.toBytes = function toBytes(le) {
+    return le ? this.toBytesLE() : this.toBytesBE();
+};
+
+/**
+ * Converts this Long to its little endian byte representation.
+ * @this {!Long}
+ * @returns {!Array.<number>} Little endian byte representation
+ */
+LongPrototype.toBytesLE = function toBytesLE() {
+    var hi = this.high,
+        lo = this.low;
+    return [
+        lo        & 0xff,
+        lo >>>  8 & 0xff,
+        lo >>> 16 & 0xff,
+        lo >>> 24       ,
+        hi        & 0xff,
+        hi >>>  8 & 0xff,
+        hi >>> 16 & 0xff,
+        hi >>> 24
+    ];
+};
+
+/**
+ * Converts this Long to its big endian byte representation.
+ * @this {!Long}
+ * @returns {!Array.<number>} Big endian byte representation
+ */
+LongPrototype.toBytesBE = function toBytesBE() {
+    var hi = this.high,
+        lo = this.low;
+    return [
+        hi >>> 24       ,
+        hi >>> 16 & 0xff,
+        hi >>>  8 & 0xff,
+        hi        & 0xff,
+        lo >>> 24       ,
+        lo >>> 16 & 0xff,
+        lo >>>  8 & 0xff,
+        lo        & 0xff
+    ];
+};
+
+/**
+ * Creates a Long from its byte representation.
+ * @param {!Array.<number>} bytes Byte representation
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @param {boolean=} le Whether little or big endian, defaults to big endian
+ * @returns {Long} The corresponding Long value
+ */
+Long.fromBytes = function fromBytes(bytes, unsigned, le) {
+    return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);
+};
+
+/**
+ * Creates a Long from its little endian byte representation.
+ * @param {!Array.<number>} bytes Little endian byte representation
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {Long} The corresponding Long value
+ */
+Long.fromBytesLE = function fromBytesLE(bytes, unsigned) {
+    return new Long(
+        bytes[0]       |
+        bytes[1] <<  8 |
+        bytes[2] << 16 |
+        bytes[3] << 24,
+        bytes[4]       |
+        bytes[5] <<  8 |
+        bytes[6] << 16 |
+        bytes[7] << 24,
+        unsigned
+    );
+};
+
+/**
+ * Creates a Long from its big endian byte representation.
+ * @param {!Array.<number>} bytes Big endian byte representation
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {Long} The corresponding Long value
+ */
+Long.fromBytesBE = function fromBytesBE(bytes, unsigned) {
+    return new Long(
+        bytes[4] << 24 |
+        bytes[5] << 16 |
+        bytes[6] <<  8 |
+        bytes[7],
+        bytes[0] << 24 |
+        bytes[1] << 16 |
+        bytes[2] <<  8 |
+        bytes[3],
+        unsigned
+    );
+};
diff --git a/node_modules/mathjs/examples/node_modules/acorn-import-assertions/README.md b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/README.md
new file mode 100644
index 0000000..4b9b3ad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/README.md
@@ -0,0 +1,15 @@
+# Support for import assertions in acorn
+
+## Usage
+
+This module provides a plugin that can be used to extend the Acorn Parser class:
+
+```js
+const {Parser} = require('acorn');
+const {importAssertions} = require('acorn-import-assertions');
+Parser.extend(importAssertions).parse('...');
+```
+
+## License
+
+This plugin is released under an MIT License.
diff --git a/node_modules/mathjs/examples/node_modules/acorn-import-assertions/lib/index.js b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/lib/index.js
new file mode 100644
index 0000000..3625903
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/lib/index.js
@@ -0,0 +1,287 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.importAssertions = importAssertions;
+
+var _acorn = _interopRequireWildcard(require("acorn"));
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+const leftCurlyBrace = "{".charCodeAt(0);
+const space = " ".charCodeAt(0);
+const keyword = "assert";
+const FUNC_STATEMENT = 1,
+      FUNC_HANGING_STATEMENT = 2,
+      FUNC_NULLABLE_ID = 4;
+
+function importAssertions(Parser) {
+  // Use supplied version acorn version if present, to avoid
+  // reference mismatches due to different acorn versions. This
+  // allows this plugin to be used with Rollup which supplies
+  // its own internal version of acorn and thereby sidesteps
+  // the package manager.
+  const acorn = Parser.acorn || _acorn;
+  const {
+    tokTypes: tt,
+    TokenType
+  } = acorn;
+  return class extends Parser {
+    constructor(...args) {
+      super(...args);
+      this.assertToken = new TokenType(keyword);
+    }
+
+    _codeAt(i) {
+      return this.input.charCodeAt(i);
+    }
+
+    _eat(t) {
+      if (this.type !== t) {
+        this.unexpected();
+      }
+
+      this.next();
+    }
+
+    readToken(code) {
+      let i = 0;
+
+      for (; i < keyword.length; i++) {
+        if (this._codeAt(this.pos + i) !== keyword.charCodeAt(i)) {
+          return super.readToken(code);
+        }
+      } // ensure that the keyword is at the correct location
+      // ie `assert{...` or `assert {...`
+
+
+      for (;; i++) {
+        if (this._codeAt(this.pos + i) === leftCurlyBrace) {
+          // Found '{'
+          break;
+        } else if (this._codeAt(this.pos + i) === space) {
+          // white space is allowed between `assert` and `{`, so continue.
+          continue;
+        } else {
+          return super.readToken(code);
+        }
+      } // If we're inside a dynamic import expression we'll parse
+      // the `assert` keyword as a standard object property name
+      // ie `import(""./foo.json", { assert: { type: "json" } })`
+
+
+      if (this.type.label === "{") {
+        return super.readToken(code);
+      }
+
+      this.pos += keyword.length;
+      return this.finishToken(this.assertToken);
+    }
+
+    parseDynamicImport(node) {
+      this.next(); // skip `(`
+      // Parse node.source.
+
+      node.source = this.parseMaybeAssign();
+
+      if (this.eat(tt.comma)) {
+        const obj = this.parseObj(false);
+        node.arguments = [obj];
+      }
+
+      this._eat(tt.parenR);
+
+      return this.finishNode(node, "ImportExpression");
+    } // ported from acorn/src/statement.js pp.parseExport
+
+
+    parseExport(node, exports) {
+      this.next(); // export * from '...'
+
+      if (this.eat(tt.star)) {
+        if (this.options.ecmaVersion >= 11) {
+          if (this.eatContextual("as")) {
+            node.exported = this.parseIdent(true);
+            this.checkExport(exports, node.exported.name, this.lastTokStart);
+          } else {
+            node.exported = null;
+          }
+        }
+
+        this.expectContextual("from");
+
+        if (this.type !== tt.string) {
+          this.unexpected();
+        }
+
+        node.source = this.parseExprAtom();
+
+        if (this.type === this.assertToken) {
+          this.next();
+          const assertions = this.parseImportAssertions();
+
+          if (assertions) {
+            node.assertions = assertions;
+          }
+        }
+
+        this.semicolon();
+        return this.finishNode(node, "ExportAllDeclaration");
+      }
+
+      if (this.eat(tt._default)) {
+        // export default ...
+        this.checkExport(exports, "default", this.lastTokStart);
+        var isAsync;
+
+        if (this.type === tt._function || (isAsync = this.isAsyncFunction())) {
+          var fNode = this.startNode();
+          this.next();
+
+          if (isAsync) {
+            this.next();
+          }
+
+          node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+        } else if (this.type === tt._class) {
+          var cNode = this.startNode();
+          node.declaration = this.parseClass(cNode, "nullableID");
+        } else {
+          node.declaration = this.parseMaybeAssign();
+          this.semicolon();
+        }
+
+        return this.finishNode(node, "ExportDefaultDeclaration");
+      } // export var|const|let|function|class ...
+
+
+      if (this.shouldParseExportStatement()) {
+        node.declaration = this.parseStatement(null);
+
+        if (node.declaration.type === "VariableDeclaration") {
+          this.checkVariableExport(exports, node.declaration.declarations);
+        } else {
+          this.checkExport(exports, node.declaration.id.name, node.declaration.id.start);
+        }
+
+        node.specifiers = [];
+        node.source = null;
+      } else {
+        // export { x, y as z } [from '...']
+        node.declaration = null;
+        node.specifiers = this.parseExportSpecifiers(exports);
+
+        if (this.eatContextual("from")) {
+          if (this.type !== tt.string) {
+            this.unexpected();
+          }
+
+          node.source = this.parseExprAtom();
+
+          if (this.type === this.assertToken) {
+            this.next();
+            const assertions = this.parseImportAssertions();
+
+            if (assertions) {
+              node.assertions = assertions;
+            }
+          }
+        } else {
+          for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+            // check for keywords used as local names
+            var spec = list[i];
+            this.checkUnreserved(spec.local); // check if export is defined
+
+            this.checkLocalExport(spec.local);
+          }
+
+          node.source = null;
+        }
+
+        this.semicolon();
+      }
+
+      return this.finishNode(node, "ExportNamedDeclaration");
+    }
+
+    parseImport(node) {
+      this.next(); // import '...'
+
+      if (this.type === tt.string) {
+        node.specifiers = [];
+        node.source = this.parseExprAtom();
+      } else {
+        node.specifiers = this.parseImportSpecifiers();
+        this.expectContextual("from");
+        node.source = this.type === tt.string ? this.parseExprAtom() : this.unexpected();
+      }
+
+      if (this.type === this.assertToken) {
+        this.next();
+        const assertions = this.parseImportAssertions();
+
+        if (assertions) {
+          node.assertions = assertions;
+        }
+      }
+
+      this.semicolon();
+      return this.finishNode(node, "ImportDeclaration");
+    }
+
+    parseImportAssertions() {
+      this._eat(tt.braceL);
+
+      const attrs = this.parseAssertEntries();
+
+      this._eat(tt.braceR);
+
+      return attrs;
+    }
+
+    parseAssertEntries() {
+      const attrs = [];
+      const attrNames = new Set();
+
+      do {
+        if (this.type === tt.braceR) {
+          break;
+        }
+
+        const node = this.startNode(); // parse AssertionKey : IdentifierName, StringLiteral
+
+        let assertionKeyNode;
+
+        if (this.type === tt.string) {
+          assertionKeyNode = this.parseLiteral(this.value);
+        } else {
+          assertionKeyNode = this.parseIdent(true);
+        }
+
+        this.next();
+        node.key = assertionKeyNode; // check if we already have an entry for an attribute
+        // if a duplicate entry is found, throw an error
+        // for now this logic will come into play only when someone declares `type` twice
+
+        if (attrNames.has(node.key.name)) {
+          this.raise(this.pos, "Duplicated key in assertions");
+        }
+
+        attrNames.add(node.key.name);
+
+        if (this.type !== tt.string) {
+          this.raise(this.pos, "Only string is supported as an assertion value");
+        }
+
+        node.value = this.parseLiteral(this.value);
+        attrs.push(this.finishNode(node, "ImportAttribute"));
+      } while (this.eat(tt.comma));
+
+      return attrs;
+    }
+
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/acorn-import-assertions/lib/index.mjs b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/lib/index.mjs
new file mode 100644
index 0000000..09cf691
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/lib/index.mjs
@@ -0,0 +1,242 @@
+import * as _acorn from "acorn";
+
+const leftCurlyBrace = "{".charCodeAt(0);
+const space = " ".charCodeAt(0);
+
+const keyword = "assert";
+const FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4
+
+export function importAssertions(Parser) {
+  // Use supplied version acorn version if present, to avoid
+  // reference mismatches due to different acorn versions. This
+  // allows this plugin to be used with Rollup which supplies
+  // its own internal version of acorn and thereby sidesteps
+  // the package manager.
+  const acorn = Parser.acorn || _acorn;
+  const { tokTypes: tt, TokenType } = acorn;
+
+  return class extends Parser {
+    constructor(...args) {
+      super(...args);
+      this.assertToken = new TokenType(keyword);
+    }
+
+    _codeAt(i) {
+      return this.input.charCodeAt(i);
+    }
+
+    _eat(t) {
+      if (this.type !== t) {
+        this.unexpected();
+      }
+      this.next();
+    }
+
+    readToken(code) {
+      let i = 0;
+      for (; i < keyword.length; i++) {
+        if (this._codeAt(this.pos + i) !== keyword.charCodeAt(i)) {
+          return super.readToken(code);
+        }
+      }
+
+      // ensure that the keyword is at the correct location
+      // ie `assert{...` or `assert {...`
+      for (;; i++) {
+        if (this._codeAt(this.pos + i) === leftCurlyBrace) {
+          // Found '{'
+          break;
+        } else if (this._codeAt(this.pos + i) === space) {
+          // white space is allowed between `assert` and `{`, so continue.
+          continue;
+        } else {
+          return super.readToken(code);
+        }
+      }
+
+      // If we're inside a dynamic import expression we'll parse
+      // the `assert` keyword as a standard object property name
+      // ie `import(""./foo.json", { assert: { type: "json" } })`
+      if (this.type.label === "{") {
+        return super.readToken(code);
+      }
+
+      this.pos += keyword.length;
+      return this.finishToken(this.assertToken);
+    }
+
+    parseDynamicImport(node) {
+      this.next(); // skip `(`
+
+      // Parse node.source.
+      node.source = this.parseMaybeAssign();
+
+      if (this.eat(tt.comma)) {
+        const obj = this.parseObj(false);
+        node.arguments = [obj];
+      }
+      this._eat(tt.parenR);
+      return this.finishNode(node, "ImportExpression");
+    }
+
+    // ported from acorn/src/statement.js pp.parseExport
+    parseExport(node, exports) {
+      this.next();
+      // export * from '...'
+      if (this.eat(tt.star)) {
+        if (this.options.ecmaVersion >= 11) {
+          if (this.eatContextual("as")) {
+            node.exported = this.parseIdent(true);
+            this.checkExport(exports, node.exported.name, this.lastTokStart);
+          } else {
+            node.exported = null;
+          }
+        }
+        this.expectContextual("from");
+        if (this.type !== tt.string) { this.unexpected(); }
+        node.source = this.parseExprAtom();
+
+        if (this.type === this.assertToken) {
+          this.next();
+          const assertions = this.parseImportAssertions();
+          if (assertions) {
+            node.assertions = assertions;
+          }
+        }
+
+        this.semicolon();
+        return this.finishNode(node, "ExportAllDeclaration")
+      }
+      if (this.eat(tt._default)) { // export default ...
+        this.checkExport(exports, "default", this.lastTokStart);
+        var isAsync;
+        if (this.type === tt._function || (isAsync = this.isAsyncFunction())) {
+          var fNode = this.startNode();
+          this.next();
+          if (isAsync) { this.next(); }
+          node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+        } else if (this.type === tt._class) {
+          var cNode = this.startNode();
+          node.declaration = this.parseClass(cNode, "nullableID");
+        } else {
+          node.declaration = this.parseMaybeAssign();
+          this.semicolon();
+        }
+        return this.finishNode(node, "ExportDefaultDeclaration")
+      }
+      // export var|const|let|function|class ...
+      if (this.shouldParseExportStatement()) {
+        node.declaration = this.parseStatement(null);
+        if (node.declaration.type === "VariableDeclaration")
+          { this.checkVariableExport(exports, node.declaration.declarations); }
+        else
+          { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }
+        node.specifiers = [];
+        node.source = null;
+      } else { // export { x, y as z } [from '...']
+        node.declaration = null;
+        node.specifiers = this.parseExportSpecifiers(exports);
+        if (this.eatContextual("from")) {
+          if (this.type !== tt.string) { this.unexpected(); }
+          node.source = this.parseExprAtom();
+
+          if (this.type === this.assertToken) {
+            this.next();
+            const assertions = this.parseImportAssertions();
+            if (assertions) {
+              node.assertions = assertions;
+            }
+          }
+        } else {
+          for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+            // check for keywords used as local names
+            var spec = list[i];
+
+            this.checkUnreserved(spec.local);
+            // check if export is defined
+            this.checkLocalExport(spec.local);
+          }
+
+          node.source = null;
+        }
+        this.semicolon();
+      }
+      return this.finishNode(node, "ExportNamedDeclaration")
+    }
+
+    parseImport(node) {
+      this.next();
+      // import '...'
+      if (this.type === tt.string) {
+        node.specifiers = [];
+        node.source = this.parseExprAtom();
+      } else {
+        node.specifiers = this.parseImportSpecifiers();
+        this.expectContextual("from");
+        node.source =
+          this.type === tt.string ? this.parseExprAtom() : this.unexpected();
+      }
+
+      if (this.type === this.assertToken) {
+        this.next();
+        const assertions = this.parseImportAssertions();
+        if (assertions) {
+          node.assertions = assertions;
+        }
+      }
+      this.semicolon();
+      return this.finishNode(node, "ImportDeclaration");
+    }
+
+    parseImportAssertions() {
+      this._eat(tt.braceL);
+      const attrs = this.parseAssertEntries();
+      this._eat(tt.braceR);
+      return attrs;
+    }
+
+    parseAssertEntries() {
+      const attrs = [];
+      const attrNames = new Set();
+
+      do {
+        if (this.type === tt.braceR) {
+          break;
+        }
+
+        const node = this.startNode();
+
+        // parse AssertionKey : IdentifierName, StringLiteral
+        let assertionKeyNode;
+        if (this.type === tt.string) {
+          assertionKeyNode = this.parseLiteral(this.value);
+        } else {
+          assertionKeyNode = this.parseIdent(true);
+        }
+        this.next();
+        node.key = assertionKeyNode;
+
+        // check if we already have an entry for an attribute
+        // if a duplicate entry is found, throw an error
+        // for now this logic will come into play only when someone declares `type` twice
+        if (attrNames.has(node.key.name)) {
+          this.raise(this.pos, "Duplicated key in assertions");
+        }
+        attrNames.add(node.key.name);
+
+        if (this.type !== tt.string) {
+          this.raise(
+            this.pos,
+            "Only string is supported as an assertion value"
+          );
+        }
+
+        node.value = this.parseLiteral(this.value);
+
+        attrs.push(this.finishNode(node, "ImportAttribute"));
+      } while (this.eat(tt.comma));
+
+      return attrs;
+    }
+  };
+}
diff --git a/node_modules/mathjs/examples/node_modules/acorn-import-assertions/package.json b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/package.json
new file mode 100644
index 0000000..a0fc717
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/package.json
@@ -0,0 +1,49 @@
+{
+  "name": "acorn-import-assertions",
+  "version": "1.8.0",
+  "description": "Support for import assertions in acorn",
+  "main": "lib/index.js",
+  "module": "src/index.js",
+  "exports": {
+    ".": {
+      "import": "./lib/index.mjs",
+      "require": "./lib/index.js"
+    },
+    "./package.json": "./package.json",
+    "./": "./"
+  },
+  "scripts": {
+    "build": "babel ./src --out-dir ./lib && node post-build.js",
+    "prepublishOnly": "npm run build",
+    "test": "mocha ./test/index.js",
+    "test:test262": "node run_test262.js",
+    "watch": "babel ./src --out-dir ./lib --watch"
+  },
+  "author": "Sven Sauleau <sven@sauleau.com>",
+  "license": "MIT",
+  "devDependencies": {
+    "@babel/cli": "^7.14.8",
+    "@babel/core": "^7.15.0",
+    "@babel/preset-env": "^7.15.0",
+    "@babel/register": "^7.15.3",
+    "acorn": "^8.4.1",
+    "chai": "^4.3.4",
+    "mocha": "^9.1.0",
+    "test262": "tc39/test262#47ab262658cd97ae35c9a537808cac18fa4ab567",
+    "test262-parser-runner": "^0.5.0"
+  },
+  "peerDependencies": {
+    "acorn": "^8"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/xtuc/acorn-import-assertions"
+  },
+  "browserslist": [
+    "maintained node versions"
+  ],
+  "files": [
+    "lib",
+    "src"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/acorn-import-assertions/src/index.js b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/src/index.js
new file mode 100644
index 0000000..09cf691
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn-import-assertions/src/index.js
@@ -0,0 +1,242 @@
+import * as _acorn from "acorn";
+
+const leftCurlyBrace = "{".charCodeAt(0);
+const space = " ".charCodeAt(0);
+
+const keyword = "assert";
+const FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4
+
+export function importAssertions(Parser) {
+  // Use supplied version acorn version if present, to avoid
+  // reference mismatches due to different acorn versions. This
+  // allows this plugin to be used with Rollup which supplies
+  // its own internal version of acorn and thereby sidesteps
+  // the package manager.
+  const acorn = Parser.acorn || _acorn;
+  const { tokTypes: tt, TokenType } = acorn;
+
+  return class extends Parser {
+    constructor(...args) {
+      super(...args);
+      this.assertToken = new TokenType(keyword);
+    }
+
+    _codeAt(i) {
+      return this.input.charCodeAt(i);
+    }
+
+    _eat(t) {
+      if (this.type !== t) {
+        this.unexpected();
+      }
+      this.next();
+    }
+
+    readToken(code) {
+      let i = 0;
+      for (; i < keyword.length; i++) {
+        if (this._codeAt(this.pos + i) !== keyword.charCodeAt(i)) {
+          return super.readToken(code);
+        }
+      }
+
+      // ensure that the keyword is at the correct location
+      // ie `assert{...` or `assert {...`
+      for (;; i++) {
+        if (this._codeAt(this.pos + i) === leftCurlyBrace) {
+          // Found '{'
+          break;
+        } else if (this._codeAt(this.pos + i) === space) {
+          // white space is allowed between `assert` and `{`, so continue.
+          continue;
+        } else {
+          return super.readToken(code);
+        }
+      }
+
+      // If we're inside a dynamic import expression we'll parse
+      // the `assert` keyword as a standard object property name
+      // ie `import(""./foo.json", { assert: { type: "json" } })`
+      if (this.type.label === "{") {
+        return super.readToken(code);
+      }
+
+      this.pos += keyword.length;
+      return this.finishToken(this.assertToken);
+    }
+
+    parseDynamicImport(node) {
+      this.next(); // skip `(`
+
+      // Parse node.source.
+      node.source = this.parseMaybeAssign();
+
+      if (this.eat(tt.comma)) {
+        const obj = this.parseObj(false);
+        node.arguments = [obj];
+      }
+      this._eat(tt.parenR);
+      return this.finishNode(node, "ImportExpression");
+    }
+
+    // ported from acorn/src/statement.js pp.parseExport
+    parseExport(node, exports) {
+      this.next();
+      // export * from '...'
+      if (this.eat(tt.star)) {
+        if (this.options.ecmaVersion >= 11) {
+          if (this.eatContextual("as")) {
+            node.exported = this.parseIdent(true);
+            this.checkExport(exports, node.exported.name, this.lastTokStart);
+          } else {
+            node.exported = null;
+          }
+        }
+        this.expectContextual("from");
+        if (this.type !== tt.string) { this.unexpected(); }
+        node.source = this.parseExprAtom();
+
+        if (this.type === this.assertToken) {
+          this.next();
+          const assertions = this.parseImportAssertions();
+          if (assertions) {
+            node.assertions = assertions;
+          }
+        }
+
+        this.semicolon();
+        return this.finishNode(node, "ExportAllDeclaration")
+      }
+      if (this.eat(tt._default)) { // export default ...
+        this.checkExport(exports, "default", this.lastTokStart);
+        var isAsync;
+        if (this.type === tt._function || (isAsync = this.isAsyncFunction())) {
+          var fNode = this.startNode();
+          this.next();
+          if (isAsync) { this.next(); }
+          node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+        } else if (this.type === tt._class) {
+          var cNode = this.startNode();
+          node.declaration = this.parseClass(cNode, "nullableID");
+        } else {
+          node.declaration = this.parseMaybeAssign();
+          this.semicolon();
+        }
+        return this.finishNode(node, "ExportDefaultDeclaration")
+      }
+      // export var|const|let|function|class ...
+      if (this.shouldParseExportStatement()) {
+        node.declaration = this.parseStatement(null);
+        if (node.declaration.type === "VariableDeclaration")
+          { this.checkVariableExport(exports, node.declaration.declarations); }
+        else
+          { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }
+        node.specifiers = [];
+        node.source = null;
+      } else { // export { x, y as z } [from '...']
+        node.declaration = null;
+        node.specifiers = this.parseExportSpecifiers(exports);
+        if (this.eatContextual("from")) {
+          if (this.type !== tt.string) { this.unexpected(); }
+          node.source = this.parseExprAtom();
+
+          if (this.type === this.assertToken) {
+            this.next();
+            const assertions = this.parseImportAssertions();
+            if (assertions) {
+              node.assertions = assertions;
+            }
+          }
+        } else {
+          for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+            // check for keywords used as local names
+            var spec = list[i];
+
+            this.checkUnreserved(spec.local);
+            // check if export is defined
+            this.checkLocalExport(spec.local);
+          }
+
+          node.source = null;
+        }
+        this.semicolon();
+      }
+      return this.finishNode(node, "ExportNamedDeclaration")
+    }
+
+    parseImport(node) {
+      this.next();
+      // import '...'
+      if (this.type === tt.string) {
+        node.specifiers = [];
+        node.source = this.parseExprAtom();
+      } else {
+        node.specifiers = this.parseImportSpecifiers();
+        this.expectContextual("from");
+        node.source =
+          this.type === tt.string ? this.parseExprAtom() : this.unexpected();
+      }
+
+      if (this.type === this.assertToken) {
+        this.next();
+        const assertions = this.parseImportAssertions();
+        if (assertions) {
+          node.assertions = assertions;
+        }
+      }
+      this.semicolon();
+      return this.finishNode(node, "ImportDeclaration");
+    }
+
+    parseImportAssertions() {
+      this._eat(tt.braceL);
+      const attrs = this.parseAssertEntries();
+      this._eat(tt.braceR);
+      return attrs;
+    }
+
+    parseAssertEntries() {
+      const attrs = [];
+      const attrNames = new Set();
+
+      do {
+        if (this.type === tt.braceR) {
+          break;
+        }
+
+        const node = this.startNode();
+
+        // parse AssertionKey : IdentifierName, StringLiteral
+        let assertionKeyNode;
+        if (this.type === tt.string) {
+          assertionKeyNode = this.parseLiteral(this.value);
+        } else {
+          assertionKeyNode = this.parseIdent(true);
+        }
+        this.next();
+        node.key = assertionKeyNode;
+
+        // check if we already have an entry for an attribute
+        // if a duplicate entry is found, throw an error
+        // for now this logic will come into play only when someone declares `type` twice
+        if (attrNames.has(node.key.name)) {
+          this.raise(this.pos, "Duplicated key in assertions");
+        }
+        attrNames.add(node.key.name);
+
+        if (this.type !== tt.string) {
+          this.raise(
+            this.pos,
+            "Only string is supported as an assertion value"
+          );
+        }
+
+        node.value = this.parseLiteral(this.value);
+
+        attrs.push(this.finishNode(node, "ImportAttribute"));
+      } while (this.eat(tt.comma));
+
+      return attrs;
+    }
+  };
+}
diff --git a/node_modules/mathjs/examples/node_modules/acorn/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/acorn/CHANGELOG.md
new file mode 100644
index 0000000..d19b5f1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/CHANGELOG.md
@@ -0,0 +1,788 @@
+## 8.7.0 (2021-12-27)
+
+### New features
+
+Support quoted export names.
+
+Upgrade to Unicode 14.
+
+Add support for Unicode 13 properties in regular expressions.
+
+### Bug fixes
+
+Use a loop to find line breaks, because the existing regexp search would overrun the end of the searched range and waste a lot of time in minified code.
+
+## 8.6.0 (2021-11-18)
+
+### Bug fixes
+
+Fix a bug where an object literal with multiple `__proto__` properties would incorrectly be accepted if a later property value held an assigment.
+
+### New features
+
+Support class private fields with the `in` operator.
+
+## 8.5.0 (2021-09-06)
+
+### Bug fixes
+
+Improve context-dependent tokenization in a number of corner cases.
+
+Fix location tracking after a 0x2028 or 0x2029 character in a string literal (which before did not increase the line number).
+
+Fix an issue where arrow function bodies in for loop context would inappropriately consume `in` operators.
+
+Fix wrong end locations stored on SequenceExpression nodes.
+
+Implement restriction that `for`/`of` loop LHS can't start with `let`.
+
+### New features
+
+Add support for ES2022 class static blocks.
+
+Allow multiple input files to be passed to the CLI tool.
+
+## 8.4.1 (2021-06-24)
+
+### Bug fixes
+
+Fix a bug where `allowAwaitOutsideFunction` would allow `await` in class field initializers, and setting `ecmaVersion` to 13 or higher would allow top-level await in non-module sources.
+
+## 8.4.0 (2021-06-11)
+
+### New features
+
+A new option, `allowSuperOutsideMethod`, can be used to suppress the error when `super` is used in the wrong context.
+
+## 8.3.0 (2021-05-31)
+
+### New features
+
+Default `allowAwaitOutsideFunction` to true for ECMAScript 2022 an higher.
+
+Add support for the `d` ([indices](https://github.com/tc39/proposal-regexp-match-indices)) regexp flag.
+
+## 8.2.4 (2021-05-04)
+
+### Bug fixes
+
+Fix spec conformity in corner case 'for await (async of ...)'.
+
+## 8.2.3 (2021-05-04)
+
+### Bug fixes
+
+Fix an issue where the library couldn't parse 'for (async of ...)'.
+
+Fix a bug in UTF-16 decoding that would read characters incorrectly in some circumstances.
+
+## 8.2.2 (2021-04-29)
+
+### Bug fixes
+
+Fix a bug where a class field initialized to an async arrow function wouldn't allow await inside it. Same issue existed for generator arrow functions with yield.
+
+## 8.2.1 (2021-04-24)
+
+### Bug fixes
+
+Fix a regression introduced in 8.2.0 where static or async class methods with keyword names fail to parse.
+
+## 8.2.0 (2021-04-24)
+
+### New features
+
+Add support for ES2022 class fields and private methods.
+
+## 8.1.1 (2021-04-12)
+
+### Various
+
+Stop shipping source maps in the NPM package.
+
+## 8.1.0 (2021-03-09)
+
+### Bug fixes
+
+Fix a spurious error in nested destructuring arrays.
+
+### New features
+
+Expose `allowAwaitOutsideFunction` in CLI interface.
+
+Make `allowImportExportAnywhere` also apply to `import.meta`.
+
+## 8.0.5 (2021-01-25)
+
+### Bug fixes
+
+Adjust package.json to work with Node 12.16.0 and 13.0-13.6.
+
+## 8.0.4 (2020-10-05)
+
+### Bug fixes
+
+Make `await x ** y` an error, following the spec.
+
+Fix potentially exponential regular expression.
+
+## 8.0.3 (2020-10-02)
+
+### Bug fixes
+
+Fix a wasteful loop during `Parser` creation when setting `ecmaVersion` to `"latest"`.
+
+## 8.0.2 (2020-09-30)
+
+### Bug fixes
+
+Make the TypeScript types reflect the current allowed values for `ecmaVersion`.
+
+Fix another regexp/division tokenizer issue.
+
+## 8.0.1 (2020-08-12)
+
+### Bug fixes
+
+Provide the correct value in the `version` export.
+
+## 8.0.0 (2020-08-12)
+
+### Bug fixes
+
+Disallow expressions like `(a = b) = c`.
+
+Make non-octal escape sequences a syntax error in strict mode.
+
+### New features
+
+The package can now be loaded directly as an ECMAScript module in node 13+.
+
+Update to the set of Unicode properties from ES2021.
+
+### Breaking changes
+
+The `ecmaVersion` option is now required. For the moment, omitting it will still work with a warning, but that will change in a future release.
+
+Some changes to method signatures that may be used by plugins.
+
+## 7.4.0 (2020-08-03)
+
+### New features
+
+Add support for logical assignment operators.
+
+Add support for numeric separators.
+
+## 7.3.1 (2020-06-11)
+
+### Bug fixes
+
+Make the string in the `version` export match the actual library version.
+
+## 7.3.0 (2020-06-11)
+
+### Bug fixes
+
+Fix a bug that caused parsing of object patterns with a property named `set` that had a default value to fail.
+
+### New features
+
+Add support for optional chaining (`?.`).
+
+## 7.2.0 (2020-05-09)
+
+### Bug fixes
+
+Fix precedence issue in parsing of async arrow functions.
+
+### New features
+
+Add support for nullish coalescing.
+
+Add support for `import.meta`.
+
+Support `export * as ...` syntax.
+
+Upgrade to Unicode 13.
+
+## 6.4.1 (2020-03-09)
+
+### Bug fixes
+
+More carefully check for valid UTF16 surrogate pairs in regexp validator.
+
+## 7.1.1 (2020-03-01)
+
+### Bug fixes
+
+Treat `\8` and `\9` as invalid escapes in template strings.
+
+Allow unicode escapes in property names that are keywords.
+
+Don't error on an exponential operator expression as argument to `await`.
+
+More carefully check for valid UTF16 surrogate pairs in regexp validator.
+
+## 7.1.0 (2019-09-24)
+
+### Bug fixes
+
+Disallow trailing object literal commas when ecmaVersion is less than 5.
+
+### New features
+
+Add a static `acorn` property to the `Parser` class that contains the entire module interface, to allow plugins to access the instance of the library that they are acting on.
+
+## 7.0.0 (2019-08-13)
+
+### Breaking changes
+
+Changes the node format for dynamic imports to use the `ImportExpression` node type, as defined in [ESTree](https://github.com/estree/estree/blob/master/es2020.md#importexpression).
+
+Makes 10 (ES2019) the default value for the `ecmaVersion` option.
+
+## 6.3.0 (2019-08-12)
+
+### New features
+
+`sourceType: "module"` can now be used even when `ecmaVersion` is less than 6, to parse module-style code that otherwise conforms to an older standard.
+
+## 6.2.1 (2019-07-21)
+
+### Bug fixes
+
+Fix bug causing Acorn to treat some characters as identifier characters that shouldn't be treated as such.
+
+Fix issue where setting the `allowReserved` option to `"never"` allowed reserved words in some circumstances.
+
+## 6.2.0 (2019-07-04)
+
+### Bug fixes
+
+Improve valid assignment checking in `for`/`in` and `for`/`of` loops.
+
+Disallow binding `let` in patterns.
+
+### New features
+
+Support bigint syntax with `ecmaVersion` >= 11.
+
+Support dynamic `import` syntax with `ecmaVersion` >= 11.
+
+Upgrade to Unicode version 12.
+
+## 6.1.1 (2019-02-27)
+
+### Bug fixes
+
+Fix bug that caused parsing default exports of with names to fail.
+
+## 6.1.0 (2019-02-08)
+
+### Bug fixes
+
+Fix scope checking when redefining a `var` as a lexical binding.
+
+### New features
+
+Split up `parseSubscripts` to use an internal `parseSubscript` method to make it easier to extend with plugins.
+
+## 6.0.7 (2019-02-04)
+
+### Bug fixes
+
+Check that exported bindings are defined.
+
+Don't treat `\u180e` as a whitespace character.
+
+Check for duplicate parameter names in methods.
+
+Don't allow shorthand properties when they are generators or async methods.
+
+Forbid binding `await` in async arrow function's parameter list.
+
+## 6.0.6 (2019-01-30)
+
+### Bug fixes
+
+The content of class declarations and expressions is now always parsed in strict mode.
+
+Don't allow `let` or `const` to bind the variable name `let`.
+
+Treat class declarations as lexical.
+
+Don't allow a generator function declaration as the sole body of an `if` or `else`.
+
+Ignore `"use strict"` when after an empty statement.
+
+Allow string line continuations with special line terminator characters.
+
+Treat `for` bodies as part of the `for` scope when checking for conflicting bindings.
+
+Fix bug with parsing `yield` in a `for` loop initializer.
+
+Implement special cases around scope checking for functions.
+
+## 6.0.5 (2019-01-02)
+
+### Bug fixes
+
+Fix TypeScript type for `Parser.extend` and add `allowAwaitOutsideFunction` to options type.
+
+Don't treat `let` as a keyword when the next token is `{` on the next line.
+
+Fix bug that broke checking for parentheses around an object pattern in a destructuring assignment when `preserveParens` was on.
+
+## 6.0.4 (2018-11-05)
+
+### Bug fixes
+
+Further improvements to tokenizing regular expressions in corner cases.
+
+## 6.0.3 (2018-11-04)
+
+### Bug fixes
+
+Fix bug in tokenizing an expression-less return followed by a function followed by a regular expression.
+
+Remove stray symlink in the package tarball.
+
+## 6.0.2 (2018-09-26)
+
+### Bug fixes
+
+Fix bug where default expressions could fail to parse inside an object destructuring assignment expression.
+
+## 6.0.1 (2018-09-14)
+
+### Bug fixes
+
+Fix wrong value in `version` export.
+
+## 6.0.0 (2018-09-14)
+
+### Bug fixes
+
+Better handle variable-redefinition checks for catch bindings and functions directly under if statements.
+
+Forbid `new.target` in top-level arrow functions.
+
+Fix issue with parsing a regexp after `yield` in some contexts.
+
+### New features
+
+The package now comes with TypeScript definitions.
+
+### Breaking changes
+
+The default value of the `ecmaVersion` option is now 9 (2018).
+
+Plugins work differently, and will have to be rewritten to work with this version.
+
+The loose parser and walker have been moved into separate packages (`acorn-loose` and `acorn-walk`).
+
+## 5.7.3 (2018-09-10)
+
+### Bug fixes
+
+Fix failure to tokenize regexps after expressions like `x.of`.
+
+Better error message for unterminated template literals.
+
+## 5.7.2 (2018-08-24)
+
+### Bug fixes
+
+Properly handle `allowAwaitOutsideFunction` in for statements.
+
+Treat function declarations at the top level of modules like let bindings.
+
+Don't allow async function declarations as the only statement under a label.
+
+## 5.7.0 (2018-06-15)
+
+### New features
+
+Upgraded to Unicode 11.
+
+## 5.6.0 (2018-05-31)
+
+### New features
+
+Allow U+2028 and U+2029 in string when ECMAVersion >= 10.
+
+Allow binding-less catch statements when ECMAVersion >= 10.
+
+Add `allowAwaitOutsideFunction` option for parsing top-level `await`.
+
+## 5.5.3 (2018-03-08)
+
+### Bug fixes
+
+A _second_ republish of the code in 5.5.1, this time with yarn, to hopefully get valid timestamps.
+
+## 5.5.2 (2018-03-08)
+
+### Bug fixes
+
+A republish of the code in 5.5.1 in an attempt to solve an issue with the file timestamps in the npm package being 0.
+
+## 5.5.1 (2018-03-06)
+
+### Bug fixes
+
+Fix misleading error message for octal escapes in template strings.
+
+## 5.5.0 (2018-02-27)
+
+### New features
+
+The identifier character categorization is now based on Unicode version 10.
+
+Acorn will now validate the content of regular expressions, including new ES9 features.
+
+## 5.4.0 (2018-02-01)
+
+### Bug fixes
+
+Disallow duplicate or escaped flags on regular expressions.
+
+Disallow octal escapes in strings in strict mode.
+
+### New features
+
+Add support for async iteration.
+
+Add support for object spread and rest.
+
+## 5.3.0 (2017-12-28)
+
+### Bug fixes
+
+Fix parsing of floating point literals with leading zeroes in loose mode.
+
+Allow duplicate property names in object patterns.
+
+Don't allow static class methods named `prototype`.
+
+Disallow async functions directly under `if` or `else`.
+
+Parse right-hand-side of `for`/`of` as an assignment expression.
+
+Stricter parsing of `for`/`in`.
+
+Don't allow unicode escapes in contextual keywords.
+
+### New features
+
+Parsing class members was factored into smaller methods to allow plugins to hook into it.
+
+## 5.2.1 (2017-10-30)
+
+### Bug fixes
+
+Fix a token context corruption bug.
+
+## 5.2.0 (2017-10-30)
+
+### Bug fixes
+
+Fix token context tracking for `class` and `function` in property-name position.
+
+Make sure `%*` isn't parsed as a valid operator.
+
+Allow shorthand properties `get` and `set` to be followed by default values.
+
+Disallow `super` when not in callee or object position.
+
+### New features
+
+Support [`directive` property](https://github.com/estree/estree/compare/b3de58c9997504d6fba04b72f76e6dd1619ee4eb...1da8e603237144f44710360f8feb7a9977e905e0) on directive expression statements.
+
+## 5.1.2 (2017-09-04)
+
+### Bug fixes
+
+Disable parsing of legacy HTML-style comments in modules.
+
+Fix parsing of async methods whose names are keywords.
+
+## 5.1.1 (2017-07-06)
+
+### Bug fixes
+
+Fix problem with disambiguating regexp and division after a class.
+
+## 5.1.0 (2017-07-05)
+
+### Bug fixes
+
+Fix tokenizing of regexps in an object-desctructuring `for`/`of` loop and after `yield`.
+
+Parse zero-prefixed numbers with non-octal digits as decimal.
+
+Allow object/array patterns in rest parameters.
+
+Don't error when `yield` is used as a property name.
+
+Allow `async` as a shorthand object property.
+
+### New features
+
+Implement the [template literal revision proposal](https://github.com/tc39/proposal-template-literal-revision) for ES9.
+
+## 5.0.3 (2017-04-01)
+
+### Bug fixes
+
+Fix spurious duplicate variable definition errors for named functions.
+
+## 5.0.2 (2017-03-30)
+
+### Bug fixes
+
+A binary operator after a parenthesized arrow expression is no longer incorrectly treated as an error.
+
+## 5.0.0 (2017-03-28)
+
+### Bug fixes
+
+Raise an error for duplicated lexical bindings.
+
+Fix spurious error when an assignement expression occurred after a spread expression.
+
+Accept regular expressions after `of` (in `for`/`of`), `yield` (in a generator), and braced arrow functions.
+
+Allow labels in front or `var` declarations, even in strict mode.
+
+### Breaking changes
+
+Parse declarations following `export default` as declaration nodes, not expressions. This means that class and function declarations nodes can now have `null` as their `id`.
+
+## 4.0.11 (2017-02-07)
+
+### Bug fixes
+
+Allow all forms of member expressions to be parenthesized as lvalue.
+
+## 4.0.10 (2017-02-07)
+
+### Bug fixes
+
+Don't expect semicolons after default-exported functions or classes, even when they are expressions.
+
+Check for use of `'use strict'` directives in non-simple parameter functions, even when already in strict mode.
+
+## 4.0.9 (2017-02-06)
+
+### Bug fixes
+
+Fix incorrect error raised for parenthesized simple assignment targets, so that `(x) = 1` parses again.
+
+## 4.0.8 (2017-02-03)
+
+### Bug fixes
+
+Solve spurious parenthesized pattern errors by temporarily erring on the side of accepting programs that our delayed errors don't handle correctly yet.
+
+## 4.0.7 (2017-02-02)
+
+### Bug fixes
+
+Accept invalidly rejected code like `(x).y = 2` again.
+
+Don't raise an error when a function _inside_ strict code has a non-simple parameter list.
+
+## 4.0.6 (2017-02-02)
+
+### Bug fixes
+
+Fix exponential behavior (manifesting itself as a complete hang for even relatively small source files) introduced by the new 'use strict' check.
+
+## 4.0.5 (2017-02-02)
+
+### Bug fixes
+
+Disallow parenthesized pattern expressions.
+
+Allow keywords as export names.
+
+Don't allow the `async` keyword to be parenthesized.
+
+Properly raise an error when a keyword contains a character escape.
+
+Allow `"use strict"` to appear after other string literal expressions.
+
+Disallow labeled declarations.
+
+## 4.0.4 (2016-12-19)
+
+### Bug fixes
+
+Fix crash when `export` was followed by a keyword that can't be
+exported.
+
+## 4.0.3 (2016-08-16)
+
+### Bug fixes
+
+Allow regular function declarations inside single-statement `if` branches in loose mode. Forbid them entirely in strict mode.
+
+Properly parse properties named `async` in ES2017 mode.
+
+Fix bug where reserved words were broken in ES2017 mode.
+
+## 4.0.2 (2016-08-11)
+
+### Bug fixes
+
+Don't ignore period or 'e' characters after octal numbers.
+
+Fix broken parsing for call expressions in default parameter values of arrow functions.
+
+## 4.0.1 (2016-08-08)
+
+### Bug fixes
+
+Fix false positives in duplicated export name errors.
+
+## 4.0.0 (2016-08-07)
+
+### Breaking changes
+
+The default `ecmaVersion` option value is now 7.
+
+A number of internal method signatures changed, so plugins might need to be updated.
+
+### Bug fixes
+
+The parser now raises errors on duplicated export names.
+
+`arguments` and `eval` can now be used in shorthand properties.
+
+Duplicate parameter names in non-simple argument lists now always produce an error.
+
+### New features
+
+The `ecmaVersion` option now also accepts year-style version numbers
+(2015, etc).
+
+Support for `async`/`await` syntax when `ecmaVersion` is >= 8.
+
+Support for trailing commas in call expressions when `ecmaVersion` is >= 8.
+
+## 3.3.0 (2016-07-25)
+
+### Bug fixes
+
+Fix bug in tokenizing of regexp operator after a function declaration.
+
+Fix parser crash when parsing an array pattern with a hole.
+
+### New features
+
+Implement check against complex argument lists in functions that enable strict mode in ES7.
+
+## 3.2.0 (2016-06-07)
+
+### Bug fixes
+
+Improve handling of lack of unicode regexp support in host
+environment.
+
+Properly reject shorthand properties whose name is a keyword.
+
+### New features
+
+Visitors created with `visit.make` now have their base as _prototype_, rather than copying properties into a fresh object.
+
+## 3.1.0 (2016-04-18)
+
+### Bug fixes
+
+Properly tokenize the division operator directly after a function expression.
+
+Allow trailing comma in destructuring arrays.
+
+## 3.0.4 (2016-02-25)
+
+### Fixes
+
+Allow update expressions as left-hand-side of the ES7 exponential operator.
+
+## 3.0.2 (2016-02-10)
+
+### Fixes
+
+Fix bug that accidentally made `undefined` a reserved word when parsing ES7.
+
+## 3.0.0 (2016-02-10)
+
+### Breaking changes
+
+The default value of the `ecmaVersion` option is now 6 (used to be 5).
+
+Support for comprehension syntax (which was dropped from the draft spec) has been removed.
+
+### Fixes
+
+`let` and `yield` are now “contextual keywords”, meaning you can mostly use them as identifiers in ES5 non-strict code.
+
+A parenthesized class or function expression after `export default` is now parsed correctly.
+
+### New features
+
+When `ecmaVersion` is set to 7, Acorn will parse the exponentiation operator (`**`).
+
+The identifier character ranges are now based on Unicode 8.0.0.
+
+Plugins can now override the `raiseRecoverable` method to override the way non-critical errors are handled.
+
+## 2.7.0 (2016-01-04)
+
+### Fixes
+
+Stop allowing rest parameters in setters.
+
+Disallow `y` rexexp flag in ES5.
+
+Disallow `\00` and `\000` escapes in strict mode.
+
+Raise an error when an import name is a reserved word.
+
+## 2.6.2 (2015-11-10)
+
+### Fixes
+
+Don't crash when no options object is passed.
+
+## 2.6.0 (2015-11-09)
+
+### Fixes
+
+Add `await` as a reserved word in module sources.
+
+Disallow `yield` in a parameter default value for a generator.
+
+Forbid using a comma after a rest pattern in an array destructuring.
+
+### New features
+
+Support parsing stdin in command-line tool.
+
+## 2.5.0 (2015-10-27)
+
+### Fixes
+
+Fix tokenizer support in the command-line tool.
+
+Stop allowing `new.target` outside of functions.
+
+Remove legacy `guard` and `guardedHandler` properties from try nodes.
+
+Stop allowing multiple `__proto__` properties on an object literal in strict mode.
+
+Don't allow rest parameters to be non-identifier patterns.
+
+Check for duplicate paramter names in arrow functions.
diff --git a/node_modules/mathjs/examples/node_modules/acorn/LICENSE b/node_modules/mathjs/examples/node_modules/acorn/LICENSE
new file mode 100644
index 0000000..d6be6db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (C) 2012-2020 by various contributors (see AUTHORS)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/acorn/README.md b/node_modules/mathjs/examples/node_modules/acorn/README.md
new file mode 100644
index 0000000..601e86c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/README.md
@@ -0,0 +1,280 @@
+# Acorn
+
+A tiny, fast JavaScript parser written in JavaScript.
+
+## Community
+
+Acorn is open source software released under an
+[MIT license](https://github.com/acornjs/acorn/blob/master/acorn/LICENSE).
+
+You are welcome to
+[report bugs](https://github.com/acornjs/acorn/issues) or create pull
+requests on [github](https://github.com/acornjs/acorn). For questions
+and discussion, please use the
+[Tern discussion forum](https://discuss.ternjs.net).
+
+## Installation
+
+The easiest way to install acorn is from [`npm`](https://www.npmjs.com/):
+
+```sh
+npm install acorn
+```
+
+Alternately, you can download the source and build acorn yourself:
+
+```sh
+git clone https://github.com/acornjs/acorn.git
+cd acorn
+npm install
+```
+
+## Interface
+
+**parse**`(input, options)` is the main interface to the library. The
+`input` parameter is a string, `options` must be an object setting
+some of the options listed below. The return value will be an abstract
+syntax tree object as specified by the [ESTree
+spec](https://github.com/estree/estree).
+
+```javascript
+let acorn = require("acorn");
+console.log(acorn.parse("1 + 1", {ecmaVersion: 2020}));
+```
+
+When encountering a syntax error, the parser will raise a
+`SyntaxError` object with a meaningful message. The error object will
+have a `pos` property that indicates the string offset at which the
+error occurred, and a `loc` object that contains a `{line, column}`
+object referring to that same position.
+
+Options are provided by in a second argument, which should be an
+object containing any of these fields (only `ecmaVersion` is
+required):
+
+- **ecmaVersion**: Indicates the ECMAScript version to parse. Must be
+  either 3, 5, 6 (or 2015), 7 (2016), 8 (2017), 9 (2018), 10 (2019),
+  11 (2020), 12 (2021), 13 (2022, partial support)
+  or `"latest"` (the latest the library supports). This influences
+  support for strict mode, the set of reserved words, and support
+  for new syntax features.
+
+  **NOTE**: Only 'stage 4' (finalized) ECMAScript features are being
+  implemented by Acorn. Other proposed new features must be
+  implemented through plugins.
+
+- **sourceType**: Indicate the mode the code should be parsed in. Can be
+  either `"script"` or `"module"`. This influences global strict mode
+  and parsing of `import` and `export` declarations.
+
+  **NOTE**: If set to `"module"`, then static `import` / `export` syntax
+  will be valid, even if `ecmaVersion` is less than 6.
+
+- **onInsertedSemicolon**: If given a callback, that callback will be
+  called whenever a missing semicolon is inserted by the parser. The
+  callback will be given the character offset of the point where the
+  semicolon is inserted as argument, and if `locations` is on, also a
+  `{line, column}` object representing this position.
+
+- **onTrailingComma**: Like `onInsertedSemicolon`, but for trailing
+  commas.
+
+- **allowReserved**: If `false`, using a reserved word will generate
+  an error. Defaults to `true` for `ecmaVersion` 3, `false` for higher
+  versions. When given the value `"never"`, reserved words and
+  keywords can also not be used as property names (as in Internet
+  Explorer's old parser).
+
+- **allowReturnOutsideFunction**: By default, a return statement at
+  the top level raises an error. Set this to `true` to accept such
+  code.
+
+- **allowImportExportEverywhere**: By default, `import` and `export`
+  declarations can only appear at a program's top level. Setting this
+  option to `true` allows them anywhere where a statement is allowed,
+  and also allows `import.meta` expressions to appear in scripts
+  (when `sourceType` is not `"module"`).
+
+- **allowAwaitOutsideFunction**: If `false`, `await` expressions can
+  only appear inside `async` functions. Defaults to `true` for
+  `ecmaVersion` 2022 and later, `false` for lower versions. Setting this option to
+  `true` allows to have top-level `await` expressions. They are
+  still not allowed in non-`async` functions, though.
+
+- **allowSuperOutsideMethod**: By default, `super` outside a method
+  raises an error. Set this to `true` to accept such code.
+
+- **allowHashBang**: When this is enabled (off by default), if the
+  code starts with the characters `#!` (as in a shellscript), the
+  first line will be treated as a comment.
+
+- **locations**: When `true`, each node has a `loc` object attached
+  with `start` and `end` subobjects, each of which contains the
+  one-based line and zero-based column numbers in `{line, column}`
+  form. Default is `false`.
+
+- **onToken**: If a function is passed for this option, each found
+  token will be passed in same format as tokens returned from
+  `tokenizer().getToken()`.
+
+  If array is passed, each found token is pushed to it.
+
+  Note that you are not allowed to call the parser from the
+  callback—that will corrupt its internal state.
+
+- **onComment**: If a function is passed for this option, whenever a
+  comment is encountered the function will be called with the
+  following parameters:
+
+  - `block`: `true` if the comment is a block comment, false if it
+    is a line comment.
+  - `text`: The content of the comment.
+  - `start`: Character offset of the start of the comment.
+  - `end`: Character offset of the end of the comment.
+
+  When the `locations` options is on, the `{line, column}` locations
+  of the comment’s start and end are passed as two additional
+  parameters.
+
+  If array is passed for this option, each found comment is pushed
+  to it as object in Esprima format:
+
+  ```javascript
+  {
+    "type": "Line" | "Block",
+    "value": "comment text",
+    "start": Number,
+    "end": Number,
+    // If `locations` option is on:
+    "loc": {
+      "start": {line: Number, column: Number}
+      "end": {line: Number, column: Number}
+    },
+    // If `ranges` option is on:
+    "range": [Number, Number]
+  }
+  ```
+
+  Note that you are not allowed to call the parser from the
+  callback—that will corrupt its internal state.
+
+- **ranges**: Nodes have their start and end characters offsets
+  recorded in `start` and `end` properties (directly on the node,
+  rather than the `loc` object, which holds line/column data. To also
+  add a
+  [semi-standardized](https://bugzilla.mozilla.org/show_bug.cgi?id=745678)
+  `range` property holding a `[start, end]` array with the same
+  numbers, set the `ranges` option to `true`.
+
+- **program**: It is possible to parse multiple files into a single
+  AST by passing the tree produced by parsing the first file as the
+  `program` option in subsequent parses. This will add the toplevel
+  forms of the parsed file to the "Program" (top) node of an existing
+  parse tree.
+
+- **sourceFile**: When the `locations` option is `true`, you can pass
+  this option to add a `source` attribute in every node’s `loc`
+  object. Note that the contents of this option are not examined or
+  processed in any way; you are free to use whatever format you
+  choose.
+
+- **directSourceFile**: Like `sourceFile`, but a `sourceFile` property
+  will be added (regardless of the `location` option) directly to the
+  nodes, rather than the `loc` object.
+
+- **preserveParens**: If this option is `true`, parenthesized expressions
+  are represented by (non-standard) `ParenthesizedExpression` nodes
+  that have a single `expression` property containing the expression
+  inside parentheses.
+
+**parseExpressionAt**`(input, offset, options)` will parse a single
+expression in a string, and return its AST. It will not complain if
+there is more of the string left after the expression.
+
+**tokenizer**`(input, options)` returns an object with a `getToken`
+method that can be called repeatedly to get the next token, a `{start,
+end, type, value}` object (with added `loc` property when the
+`locations` option is enabled and `range` property when the `ranges`
+option is enabled). When the token's type is `tokTypes.eof`, you
+should stop calling the method, since it will keep returning that same
+token forever.
+
+In ES6 environment, returned result can be used as any other
+protocol-compliant iterable:
+
+```javascript
+for (let token of acorn.tokenizer(str)) {
+  // iterate over the tokens
+}
+
+// transform code to array of tokens:
+var tokens = [...acorn.tokenizer(str)];
+```
+
+**tokTypes** holds an object mapping names to the token type objects
+that end up in the `type` properties of tokens.
+
+**getLineInfo**`(input, offset)` can be used to get a `{line,
+column}` object for a given program string and offset.
+
+### The `Parser` class
+
+Instances of the **`Parser`** class contain all the state and logic
+that drives a parse. It has static methods `parse`,
+`parseExpressionAt`, and `tokenizer` that match the top-level
+functions by the same name.
+
+When extending the parser with plugins, you need to call these methods
+on the extended version of the class. To extend a parser with plugins,
+you can use its static `extend` method.
+
+```javascript
+var acorn = require("acorn");
+var jsx = require("acorn-jsx");
+var JSXParser = acorn.Parser.extend(jsx());
+JSXParser.parse("foo(<bar/>)", {ecmaVersion: 2020});
+```
+
+The `extend` method takes any number of plugin values, and returns a
+new `Parser` class that includes the extra parser logic provided by
+the plugins.
+
+## Command line interface
+
+The `bin/acorn` utility can be used to parse a file from the command
+line. It accepts as arguments its input file and the following
+options:
+
+- `--ecma3|--ecma5|--ecma6|--ecma7|--ecma8|--ecma9|--ecma10`: Sets the ECMAScript version
+  to parse. Default is version 9.
+
+- `--module`: Sets the parsing mode to `"module"`. Is set to `"script"` otherwise.
+
+- `--locations`: Attaches a "loc" object to each node with "start" and
+  "end" subobjects, each of which contains the one-based line and
+  zero-based column numbers in `{line, column}` form.
+
+- `--allow-hash-bang`: If the code starts with the characters #! (as
+  in a shellscript), the first line will be treated as a comment.
+
+- `--allow-await-outside-function`: Allows top-level `await` expressions.
+  See the `allowAwaitOutsideFunction` option for more information.
+
+- `--compact`: No whitespace is used in the AST output.
+
+- `--silent`: Do not output the AST, just return the exit status.
+
+- `--help`: Print the usage information and quit.
+
+The utility spits out the syntax tree as JSON data.
+
+## Existing plugins
+
+ - [`acorn-jsx`](https://github.com/RReverser/acorn-jsx): Parse [Facebook JSX syntax extensions](https://github.com/facebook/jsx)
+ 
+Plugins for ECMAScript proposals:
+ 
+ - [`acorn-stage3`](https://github.com/acornjs/acorn-stage3): Parse most stage 3 proposals, bundling:
+   - [`acorn-class-fields`](https://github.com/acornjs/acorn-class-fields): Parse [class fields proposal](https://github.com/tc39/proposal-class-fields)
+   - [`acorn-import-meta`](https://github.com/acornjs/acorn-import-meta): Parse [import.meta proposal](https://github.com/tc39/proposal-import-meta)
+   - [`acorn-private-methods`](https://github.com/acornjs/acorn-private-methods): parse [private methods, getters and setters proposal](https://github.com/tc39/proposal-private-methods)n
diff --git a/node_modules/mathjs/examples/node_modules/acorn/bin/acorn b/node_modules/mathjs/examples/node_modules/acorn/bin/acorn
new file mode 100644
index 0000000..cf7df46
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/bin/acorn
@@ -0,0 +1,4 @@
+#!/usr/bin/env node
+'use strict';
+
+require('../dist/bin.js');
diff --git a/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.d.ts b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.d.ts
new file mode 100644
index 0000000..861b357
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.d.ts
@@ -0,0 +1,214 @@
+export as namespace acorn
+export = acorn
+
+declare namespace acorn {
+  function parse(input: string, options: Options): Node
+
+  function parseExpressionAt(input: string, pos: number, options: Options): Node
+
+  function tokenizer(input: string, options: Options): {
+    getToken(): Token
+    [Symbol.iterator](): Iterator<Token>
+  }
+
+  interface Options {
+    ecmaVersion: 3 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 'latest'
+    sourceType?: 'script' | 'module'
+    onInsertedSemicolon?: (lastTokEnd: number, lastTokEndLoc?: Position) => void
+    onTrailingComma?: (lastTokEnd: number, lastTokEndLoc?: Position) => void
+    allowReserved?: boolean | 'never'
+    allowReturnOutsideFunction?: boolean
+    allowImportExportEverywhere?: boolean
+    allowAwaitOutsideFunction?: boolean
+    allowSuperOutsideMethod?: boolean
+    allowHashBang?: boolean
+    locations?: boolean
+    onToken?: ((token: Token) => any) | Token[]
+    onComment?: ((
+      isBlock: boolean, text: string, start: number, end: number, startLoc?: Position,
+      endLoc?: Position
+    ) => void) | Comment[]
+    ranges?: boolean
+    program?: Node
+    sourceFile?: string
+    directSourceFile?: string
+    preserveParens?: boolean
+  }
+
+  class Parser {
+    constructor(options: Options, input: string, startPos?: number)
+    parse(this: Parser): Node
+    static parse(this: typeof Parser, input: string, options: Options): Node
+    static parseExpressionAt(this: typeof Parser, input: string, pos: number, options: Options): Node
+    static tokenizer(this: typeof Parser, input: string, options: Options): {
+      getToken(): Token
+      [Symbol.iterator](): Iterator<Token>
+    }
+    static extend(this: typeof Parser, ...plugins: ((BaseParser: typeof Parser) => typeof Parser)[]): typeof Parser
+  }
+
+  interface Position { line: number; column: number; offset: number }
+
+  const defaultOptions: Options
+
+  function getLineInfo(input: string, offset: number): Position
+
+  class SourceLocation {
+    start: Position
+    end: Position
+    source?: string | null
+    constructor(p: Parser, start: Position, end: Position)
+  }
+
+  class Node {
+    type: string
+    start: number
+    end: number
+    loc?: SourceLocation
+    sourceFile?: string
+    range?: [number, number]
+    constructor(parser: Parser, pos: number, loc?: SourceLocation)
+  }
+
+  class TokenType {
+    label: string
+    keyword: string
+    beforeExpr: boolean
+    startsExpr: boolean
+    isLoop: boolean
+    isAssign: boolean
+    prefix: boolean
+    postfix: boolean
+    binop: number
+    updateContext?: (prevType: TokenType) => void
+    constructor(label: string, conf?: any)
+  }
+
+  const tokTypes: {
+    num: TokenType
+    regexp: TokenType
+    string: TokenType
+    name: TokenType
+    privateId: TokenType
+    eof: TokenType
+    bracketL: TokenType
+    bracketR: TokenType
+    braceL: TokenType
+    braceR: TokenType
+    parenL: TokenType
+    parenR: TokenType
+    comma: TokenType
+    semi: TokenType
+    colon: TokenType
+    dot: TokenType
+    question: TokenType
+    arrow: TokenType
+    template: TokenType
+    ellipsis: TokenType
+    backQuote: TokenType
+    dollarBraceL: TokenType
+    eq: TokenType
+    assign: TokenType
+    incDec: TokenType
+    prefix: TokenType
+    logicalOR: TokenType
+    logicalAND: TokenType
+    bitwiseOR: TokenType
+    bitwiseXOR: TokenType
+    bitwiseAND: TokenType
+    equality: TokenType
+    relational: TokenType
+    bitShift: TokenType
+    plusMin: TokenType
+    modulo: TokenType
+    star: TokenType
+    slash: TokenType
+    starstar: TokenType
+    _break: TokenType
+    _case: TokenType
+    _catch: TokenType
+    _continue: TokenType
+    _debugger: TokenType
+    _default: TokenType
+    _do: TokenType
+    _else: TokenType
+    _finally: TokenType
+    _for: TokenType
+    _function: TokenType
+    _if: TokenType
+    _return: TokenType
+    _switch: TokenType
+    _throw: TokenType
+    _try: TokenType
+    _var: TokenType
+    _const: TokenType
+    _while: TokenType
+    _with: TokenType
+    _new: TokenType
+    _this: TokenType
+    _super: TokenType
+    _class: TokenType
+    _extends: TokenType
+    _export: TokenType
+    _import: TokenType
+    _null: TokenType
+    _true: TokenType
+    _false: TokenType
+    _in: TokenType
+    _instanceof: TokenType
+    _typeof: TokenType
+    _void: TokenType
+    _delete: TokenType
+  }
+
+  class TokContext {
+    constructor(token: string, isExpr: boolean, preserveSpace: boolean, override?: (p: Parser) => void)
+  }
+
+  const tokContexts: {
+    b_stat: TokContext
+    b_expr: TokContext
+    b_tmpl: TokContext
+    p_stat: TokContext
+    p_expr: TokContext
+    q_tmpl: TokContext
+    f_expr: TokContext
+    f_stat: TokContext
+    f_expr_gen: TokContext
+    f_gen: TokContext
+  }
+
+  function isIdentifierStart(code: number, astral?: boolean): boolean
+
+  function isIdentifierChar(code: number, astral?: boolean): boolean
+
+  interface AbstractToken {
+  }
+
+  interface Comment extends AbstractToken {
+    type: string
+    value: string
+    start: number
+    end: number
+    loc?: SourceLocation
+    range?: [number, number]
+  }
+
+  class Token {
+    type: TokenType
+    value: any
+    start: number
+    end: number
+    loc?: SourceLocation
+    range?: [number, number]
+    constructor(p: Parser)
+  }
+
+  function isNewLine(code: number): boolean
+
+  const lineBreak: RegExp
+
+  const lineBreakG: RegExp
+
+  const version: string
+}
diff --git a/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.js b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.js
new file mode 100644
index 0000000..2d279e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.js
@@ -0,0 +1,5619 @@
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+  typeof define === 'function' && define.amd ? define(['exports'], factory) :
+  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.acorn = {}));
+})(this, (function (exports) { 'use strict';
+
+  // Reserved word lists for various dialects of the language
+
+  var reservedWords = {
+    3: "abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile",
+    5: "class enum extends super const export import",
+    6: "enum",
+    strict: "implements interface let package private protected public static yield",
+    strictBind: "eval arguments"
+  };
+
+  // And the keywords
+
+  var ecma5AndLessKeywords = "break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this";
+
+  var keywords$1 = {
+    5: ecma5AndLessKeywords,
+    "5module": ecma5AndLessKeywords + " export import",
+    6: ecma5AndLessKeywords + " const class extends export import super"
+  };
+
+  var keywordRelationalOperator = /^in(stanceof)?$/;
+
+  // ## Character categories
+
+  // Big ugly regular expressions that match characters in the
+  // whitespace, identifier, and identifier-start categories. These
+  // are only applied when a character is found to actually have a
+  // code point above 128.
+  // Generated by `bin/generate-identifier-regex.js`.
+  var nonASCIIidentifierStartChars = "\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\u16ee-\u16f8\u1700-\u1711\u171f-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\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\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\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\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\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-\ua6ef\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";
+  var nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u0898-\u089f\u08ca-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b55-\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3c\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d81-\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u180f-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1abf-\u1ace\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua82c\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
+
+  var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
+  var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
+
+  nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
+
+  // These are a run-length and offset encoded representation of the
+  // >0xffff code points that are a valid part of identifiers. The
+  // offset starts at 0x10000, and each pair of numbers represents an
+  // offset to the next range, and then a size of the range. They were
+  // generated by bin/generate-identifier-regex.js
+
+  // eslint-disable-next-line comma-spacing
+  var astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,13,10,2,14,2,6,2,1,2,10,2,14,2,6,2,1,68,310,10,21,11,7,25,5,2,41,2,8,70,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,349,41,7,1,79,28,11,0,9,21,43,17,47,20,28,22,13,52,58,1,3,0,14,44,33,24,27,35,30,0,3,0,9,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,2,31,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,38,6,186,43,117,63,32,7,3,0,3,7,2,1,2,23,16,0,2,0,95,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,19,72,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,190,0,80,921,103,110,18,195,2637,96,16,1070,4050,582,8634,568,8,30,18,78,18,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,1237,43,8,8936,3,2,6,2,1,2,290,46,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,1845,30,482,44,11,6,17,0,322,29,19,43,1269,6,2,3,2,1,2,14,2,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42719,33,4152,8,221,3,5761,15,7472,3104,541,1507,4938];
+
+  // eslint-disable-next-line comma-spacing
+  var astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,370,1,154,10,50,3,123,2,54,14,32,10,3,1,11,3,46,10,8,0,46,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,2,11,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,71,5,2,1,3,3,2,0,2,1,13,9,120,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,87,9,39,4,60,6,26,9,1014,0,2,54,8,3,82,0,12,1,19628,1,4706,45,3,22,543,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,357,0,62,13,1495,6,110,6,6,9,4759,9,787719,239];
+
+  // This has a complexity linear to the value of the code. The
+  // assumption is that looking up astral identifier characters is
+  // rare.
+  function isInAstralSet(code, set) {
+    var pos = 0x10000;
+    for (var i = 0; i < set.length; i += 2) {
+      pos += set[i];
+      if (pos > code) { return false }
+      pos += set[i + 1];
+      if (pos >= code) { return true }
+    }
+  }
+
+  // Test whether a given character code starts an identifier.
+
+  function isIdentifierStart(code, astral) {
+    if (code < 65) { return code === 36 }
+    if (code < 91) { return true }
+    if (code < 97) { return code === 95 }
+    if (code < 123) { return true }
+    if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }
+    if (astral === false) { return false }
+    return isInAstralSet(code, astralIdentifierStartCodes)
+  }
+
+  // Test whether a given character is part of an identifier.
+
+  function isIdentifierChar(code, astral) {
+    if (code < 48) { return code === 36 }
+    if (code < 58) { return true }
+    if (code < 65) { return false }
+    if (code < 91) { return true }
+    if (code < 97) { return code === 95 }
+    if (code < 123) { return true }
+    if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }
+    if (astral === false) { return false }
+    return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)
+  }
+
+  // ## Token types
+
+  // The assignment of fine-grained, information-carrying type objects
+  // allows the tokenizer to store the information it has about a
+  // token in a way that is very cheap for the parser to look up.
+
+  // All token type variables start with an underscore, to make them
+  // easy to recognize.
+
+  // The `beforeExpr` property is used to disambiguate between regular
+  // expressions and divisions. It is set on all token types that can
+  // be followed by an expression (thus, a slash after them would be a
+  // regular expression).
+  //
+  // The `startsExpr` property is used to check if the token ends a
+  // `yield` expression. It is set on all token types that either can
+  // directly start an expression (like a quotation mark) or can
+  // continue an expression (like the body of a string).
+  //
+  // `isLoop` marks a keyword as starting a loop, which is important
+  // to know when parsing a label, in order to allow or disallow
+  // continue jumps to that label.
+
+  var TokenType = function TokenType(label, conf) {
+    if ( conf === void 0 ) conf = {};
+
+    this.label = label;
+    this.keyword = conf.keyword;
+    this.beforeExpr = !!conf.beforeExpr;
+    this.startsExpr = !!conf.startsExpr;
+    this.isLoop = !!conf.isLoop;
+    this.isAssign = !!conf.isAssign;
+    this.prefix = !!conf.prefix;
+    this.postfix = !!conf.postfix;
+    this.binop = conf.binop || null;
+    this.updateContext = null;
+  };
+
+  function binop(name, prec) {
+    return new TokenType(name, {beforeExpr: true, binop: prec})
+  }
+  var beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};
+
+  // Map keyword names to token types.
+
+  var keywords = {};
+
+  // Succinct definitions of keyword token types
+  function kw(name, options) {
+    if ( options === void 0 ) options = {};
+
+    options.keyword = name;
+    return keywords[name] = new TokenType(name, options)
+  }
+
+  var types$1 = {
+    num: new TokenType("num", startsExpr),
+    regexp: new TokenType("regexp", startsExpr),
+    string: new TokenType("string", startsExpr),
+    name: new TokenType("name", startsExpr),
+    privateId: new TokenType("privateId", startsExpr),
+    eof: new TokenType("eof"),
+
+    // Punctuation token types.
+    bracketL: new TokenType("[", {beforeExpr: true, startsExpr: true}),
+    bracketR: new TokenType("]"),
+    braceL: new TokenType("{", {beforeExpr: true, startsExpr: true}),
+    braceR: new TokenType("}"),
+    parenL: new TokenType("(", {beforeExpr: true, startsExpr: true}),
+    parenR: new TokenType(")"),
+    comma: new TokenType(",", beforeExpr),
+    semi: new TokenType(";", beforeExpr),
+    colon: new TokenType(":", beforeExpr),
+    dot: new TokenType("."),
+    question: new TokenType("?", beforeExpr),
+    questionDot: new TokenType("?."),
+    arrow: new TokenType("=>", beforeExpr),
+    template: new TokenType("template"),
+    invalidTemplate: new TokenType("invalidTemplate"),
+    ellipsis: new TokenType("...", beforeExpr),
+    backQuote: new TokenType("`", startsExpr),
+    dollarBraceL: new TokenType("${", {beforeExpr: true, startsExpr: true}),
+
+    // Operators. These carry several kinds of properties to help the
+    // parser use them properly (the presence of these properties is
+    // what categorizes them as operators).
+    //
+    // `binop`, when present, specifies that this operator is a binary
+    // operator, and will refer to its precedence.
+    //
+    // `prefix` and `postfix` mark the operator as a prefix or postfix
+    // unary operator.
+    //
+    // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
+    // binary operators with a very low precedence, that should result
+    // in AssignmentExpression nodes.
+
+    eq: new TokenType("=", {beforeExpr: true, isAssign: true}),
+    assign: new TokenType("_=", {beforeExpr: true, isAssign: true}),
+    incDec: new TokenType("++/--", {prefix: true, postfix: true, startsExpr: true}),
+    prefix: new TokenType("!/~", {beforeExpr: true, prefix: true, startsExpr: true}),
+    logicalOR: binop("||", 1),
+    logicalAND: binop("&&", 2),
+    bitwiseOR: binop("|", 3),
+    bitwiseXOR: binop("^", 4),
+    bitwiseAND: binop("&", 5),
+    equality: binop("==/!=/===/!==", 6),
+    relational: binop("</>/<=/>=", 7),
+    bitShift: binop("<</>>/>>>", 8),
+    plusMin: new TokenType("+/-", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),
+    modulo: binop("%", 10),
+    star: binop("*", 10),
+    slash: binop("/", 10),
+    starstar: new TokenType("**", {beforeExpr: true}),
+    coalesce: binop("??", 1),
+
+    // Keyword token types.
+    _break: kw("break"),
+    _case: kw("case", beforeExpr),
+    _catch: kw("catch"),
+    _continue: kw("continue"),
+    _debugger: kw("debugger"),
+    _default: kw("default", beforeExpr),
+    _do: kw("do", {isLoop: true, beforeExpr: true}),
+    _else: kw("else", beforeExpr),
+    _finally: kw("finally"),
+    _for: kw("for", {isLoop: true}),
+    _function: kw("function", startsExpr),
+    _if: kw("if"),
+    _return: kw("return", beforeExpr),
+    _switch: kw("switch"),
+    _throw: kw("throw", beforeExpr),
+    _try: kw("try"),
+    _var: kw("var"),
+    _const: kw("const"),
+    _while: kw("while", {isLoop: true}),
+    _with: kw("with"),
+    _new: kw("new", {beforeExpr: true, startsExpr: true}),
+    _this: kw("this", startsExpr),
+    _super: kw("super", startsExpr),
+    _class: kw("class", startsExpr),
+    _extends: kw("extends", beforeExpr),
+    _export: kw("export"),
+    _import: kw("import", startsExpr),
+    _null: kw("null", startsExpr),
+    _true: kw("true", startsExpr),
+    _false: kw("false", startsExpr),
+    _in: kw("in", {beforeExpr: true, binop: 7}),
+    _instanceof: kw("instanceof", {beforeExpr: true, binop: 7}),
+    _typeof: kw("typeof", {beforeExpr: true, prefix: true, startsExpr: true}),
+    _void: kw("void", {beforeExpr: true, prefix: true, startsExpr: true}),
+    _delete: kw("delete", {beforeExpr: true, prefix: true, startsExpr: true})
+  };
+
+  // Matches a whole line break (where CRLF is considered a single
+  // line break). Used to count lines.
+
+  var lineBreak = /\r\n?|\n|\u2028|\u2029/;
+  var lineBreakG = new RegExp(lineBreak.source, "g");
+
+  function isNewLine(code) {
+    return code === 10 || code === 13 || code === 0x2028 || code === 0x2029
+  }
+
+  function nextLineBreak(code, from, end) {
+    if ( end === void 0 ) end = code.length;
+
+    for (var i = from; i < end; i++) {
+      var next = code.charCodeAt(i);
+      if (isNewLine(next))
+        { return i < end - 1 && next === 13 && code.charCodeAt(i + 1) === 10 ? i + 2 : i + 1 }
+    }
+    return -1
+  }
+
+  var nonASCIIwhitespace = /[\u1680\u2000-\u200a\u202f\u205f\u3000\ufeff]/;
+
+  var skipWhiteSpace = /(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;
+
+  var ref = Object.prototype;
+  var hasOwnProperty = ref.hasOwnProperty;
+  var toString = ref.toString;
+
+  var hasOwn = Object.hasOwn || (function (obj, propName) { return (
+    hasOwnProperty.call(obj, propName)
+  ); });
+
+  var isArray = Array.isArray || (function (obj) { return (
+    toString.call(obj) === "[object Array]"
+  ); });
+
+  function wordsRegexp(words) {
+    return new RegExp("^(?:" + words.replace(/ /g, "|") + ")$")
+  }
+
+  var loneSurrogate = /(?:[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])/;
+
+  // These are used when `options.locations` is on, for the
+  // `startLoc` and `endLoc` properties.
+
+  var Position = function Position(line, col) {
+    this.line = line;
+    this.column = col;
+  };
+
+  Position.prototype.offset = function offset (n) {
+    return new Position(this.line, this.column + n)
+  };
+
+  var SourceLocation = function SourceLocation(p, start, end) {
+    this.start = start;
+    this.end = end;
+    if (p.sourceFile !== null) { this.source = p.sourceFile; }
+  };
+
+  // The `getLineInfo` function is mostly useful when the
+  // `locations` option is off (for performance reasons) and you
+  // want to find the line/column position for a given character
+  // offset. `input` should be the code string that the offset refers
+  // into.
+
+  function getLineInfo(input, offset) {
+    for (var line = 1, cur = 0;;) {
+      var nextBreak = nextLineBreak(input, cur, offset);
+      if (nextBreak < 0) { return new Position(line, offset - cur) }
+      ++line;
+      cur = nextBreak;
+    }
+  }
+
+  // A second argument must be given to configure the parser process.
+  // These options are recognized (only `ecmaVersion` is required):
+
+  var defaultOptions = {
+    // `ecmaVersion` indicates the ECMAScript version to parse. Must be
+    // either 3, 5, 6 (or 2015), 7 (2016), 8 (2017), 9 (2018), 10
+    // (2019), 11 (2020), 12 (2021), 13 (2022), or `"latest"` (the
+    // latest version the library supports). This influences support
+    // for strict mode, the set of reserved words, and support for
+    // new syntax features.
+    ecmaVersion: null,
+    // `sourceType` indicates the mode the code should be parsed in.
+    // Can be either `"script"` or `"module"`. This influences global
+    // strict mode and parsing of `import` and `export` declarations.
+    sourceType: "script",
+    // `onInsertedSemicolon` can be a callback that will be called
+    // when a semicolon is automatically inserted. It will be passed
+    // the position of the comma as an offset, and if `locations` is
+    // enabled, it is given the location as a `{line, column}` object
+    // as second argument.
+    onInsertedSemicolon: null,
+    // `onTrailingComma` is similar to `onInsertedSemicolon`, but for
+    // trailing commas.
+    onTrailingComma: null,
+    // By default, reserved words are only enforced if ecmaVersion >= 5.
+    // Set `allowReserved` to a boolean value to explicitly turn this on
+    // an off. When this option has the value "never", reserved words
+    // and keywords can also not be used as property names.
+    allowReserved: null,
+    // When enabled, a return at the top level is not considered an
+    // error.
+    allowReturnOutsideFunction: false,
+    // When enabled, import/export statements are not constrained to
+    // appearing at the top of the program, and an import.meta expression
+    // in a script isn't considered an error.
+    allowImportExportEverywhere: false,
+    // By default, await identifiers are allowed to appear at the top-level scope only if ecmaVersion >= 2022.
+    // When enabled, await identifiers are allowed to appear at the top-level scope,
+    // but they are still not allowed in non-async functions.
+    allowAwaitOutsideFunction: null,
+    // When enabled, super identifiers are not constrained to
+    // appearing in methods and do not raise an error when they appear elsewhere.
+    allowSuperOutsideMethod: null,
+    // When enabled, hashbang directive in the beginning of file
+    // is allowed and treated as a line comment.
+    allowHashBang: false,
+    // When `locations` is on, `loc` properties holding objects with
+    // `start` and `end` properties in `{line, column}` form (with
+    // line being 1-based and column 0-based) will be attached to the
+    // nodes.
+    locations: false,
+    // A function can be passed as `onToken` option, which will
+    // cause Acorn to call that function with object in the same
+    // format as tokens returned from `tokenizer().getToken()`. Note
+    // that you are not allowed to call the parser from the
+    // callback—that will corrupt its internal state.
+    onToken: null,
+    // A function can be passed as `onComment` option, which will
+    // cause Acorn to call that function with `(block, text, start,
+    // end)` parameters whenever a comment is skipped. `block` is a
+    // boolean indicating whether this is a block (`/* */`) comment,
+    // `text` is the content of the comment, and `start` and `end` are
+    // character offsets that denote the start and end of the comment.
+    // When the `locations` option is on, two more parameters are
+    // passed, the full `{line, column}` locations of the start and
+    // end of the comments. Note that you are not allowed to call the
+    // parser from the callback—that will corrupt its internal state.
+    onComment: null,
+    // Nodes have their start and end characters offsets recorded in
+    // `start` and `end` properties (directly on the node, rather than
+    // the `loc` object, which holds line/column data. To also add a
+    // [semi-standardized][range] `range` property holding a `[start,
+    // end]` array with the same numbers, set the `ranges` option to
+    // `true`.
+    //
+    // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
+    ranges: false,
+    // It is possible to parse multiple files into a single AST by
+    // passing the tree produced by parsing the first file as
+    // `program` option in subsequent parses. This will add the
+    // toplevel forms of the parsed file to the `Program` (top) node
+    // of an existing parse tree.
+    program: null,
+    // When `locations` is on, you can pass this to record the source
+    // file in every node's `loc` object.
+    sourceFile: null,
+    // This value, if given, is stored in every node, whether
+    // `locations` is on or off.
+    directSourceFile: null,
+    // When enabled, parenthesized expressions are represented by
+    // (non-standard) ParenthesizedExpression nodes
+    preserveParens: false
+  };
+
+  // Interpret and default an options object
+
+  var warnedAboutEcmaVersion = false;
+
+  function getOptions(opts) {
+    var options = {};
+
+    for (var opt in defaultOptions)
+      { options[opt] = opts && hasOwn(opts, opt) ? opts[opt] : defaultOptions[opt]; }
+
+    if (options.ecmaVersion === "latest") {
+      options.ecmaVersion = 1e8;
+    } else if (options.ecmaVersion == null) {
+      if (!warnedAboutEcmaVersion && typeof console === "object" && console.warn) {
+        warnedAboutEcmaVersion = true;
+        console.warn("Since Acorn 8.0.0, options.ecmaVersion is required.\nDefaulting to 2020, but this will stop working in the future.");
+      }
+      options.ecmaVersion = 11;
+    } else if (options.ecmaVersion >= 2015) {
+      options.ecmaVersion -= 2009;
+    }
+
+    if (options.allowReserved == null)
+      { options.allowReserved = options.ecmaVersion < 5; }
+
+    if (isArray(options.onToken)) {
+      var tokens = options.onToken;
+      options.onToken = function (token) { return tokens.push(token); };
+    }
+    if (isArray(options.onComment))
+      { options.onComment = pushComment(options, options.onComment); }
+
+    return options
+  }
+
+  function pushComment(options, array) {
+    return function(block, text, start, end, startLoc, endLoc) {
+      var comment = {
+        type: block ? "Block" : "Line",
+        value: text,
+        start: start,
+        end: end
+      };
+      if (options.locations)
+        { comment.loc = new SourceLocation(this, startLoc, endLoc); }
+      if (options.ranges)
+        { comment.range = [start, end]; }
+      array.push(comment);
+    }
+  }
+
+  // Each scope gets a bitset that may contain these flags
+  var
+      SCOPE_TOP = 1,
+      SCOPE_FUNCTION = 2,
+      SCOPE_ASYNC = 4,
+      SCOPE_GENERATOR = 8,
+      SCOPE_ARROW = 16,
+      SCOPE_SIMPLE_CATCH = 32,
+      SCOPE_SUPER = 64,
+      SCOPE_DIRECT_SUPER = 128,
+      SCOPE_CLASS_STATIC_BLOCK = 256,
+      SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK;
+
+  function functionFlags(async, generator) {
+    return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)
+  }
+
+  // Used in checkLVal* and declareName to determine the type of a binding
+  var
+      BIND_NONE = 0, // Not a binding
+      BIND_VAR = 1, // Var-style binding
+      BIND_LEXICAL = 2, // Let- or const-style binding
+      BIND_FUNCTION = 3, // Function declaration
+      BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding
+      BIND_OUTSIDE = 5; // Special case for function names as bound inside the function
+
+  var Parser = function Parser(options, input, startPos) {
+    this.options = options = getOptions(options);
+    this.sourceFile = options.sourceFile;
+    this.keywords = wordsRegexp(keywords$1[options.ecmaVersion >= 6 ? 6 : options.sourceType === "module" ? "5module" : 5]);
+    var reserved = "";
+    if (options.allowReserved !== true) {
+      reserved = reservedWords[options.ecmaVersion >= 6 ? 6 : options.ecmaVersion === 5 ? 5 : 3];
+      if (options.sourceType === "module") { reserved += " await"; }
+    }
+    this.reservedWords = wordsRegexp(reserved);
+    var reservedStrict = (reserved ? reserved + " " : "") + reservedWords.strict;
+    this.reservedWordsStrict = wordsRegexp(reservedStrict);
+    this.reservedWordsStrictBind = wordsRegexp(reservedStrict + " " + reservedWords.strictBind);
+    this.input = String(input);
+
+    // Used to signal to callers of `readWord1` whether the word
+    // contained any escape sequences. This is needed because words with
+    // escape sequences must not be interpreted as keywords.
+    this.containsEsc = false;
+
+    // Set up token state
+
+    // The current position of the tokenizer in the input.
+    if (startPos) {
+      this.pos = startPos;
+      this.lineStart = this.input.lastIndexOf("\n", startPos - 1) + 1;
+      this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;
+    } else {
+      this.pos = this.lineStart = 0;
+      this.curLine = 1;
+    }
+
+    // Properties of the current token:
+    // Its type
+    this.type = types$1.eof;
+    // For tokens that include more information than their type, the value
+    this.value = null;
+    // Its start and end offset
+    this.start = this.end = this.pos;
+    // And, if locations are used, the {line, column} object
+    // corresponding to those offsets
+    this.startLoc = this.endLoc = this.curPosition();
+
+    // Position information for the previous token
+    this.lastTokEndLoc = this.lastTokStartLoc = null;
+    this.lastTokStart = this.lastTokEnd = this.pos;
+
+    // The context stack is used to superficially track syntactic
+    // context to predict whether a regular expression is allowed in a
+    // given position.
+    this.context = this.initialContext();
+    this.exprAllowed = true;
+
+    // Figure out if it's a module code.
+    this.inModule = options.sourceType === "module";
+    this.strict = this.inModule || this.strictDirective(this.pos);
+
+    // Used to signify the start of a potential arrow function
+    this.potentialArrowAt = -1;
+    this.potentialArrowInForAwait = false;
+
+    // Positions to delayed-check that yield/await does not exist in default parameters.
+    this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;
+    // Labels in scope.
+    this.labels = [];
+    // Thus-far undefined exports.
+    this.undefinedExports = Object.create(null);
+
+    // If enabled, skip leading hashbang line.
+    if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === "#!")
+      { this.skipLineComment(2); }
+
+    // Scope tracking for duplicate variable names (see scope.js)
+    this.scopeStack = [];
+    this.enterScope(SCOPE_TOP);
+
+    // For RegExp validation
+    this.regexpState = null;
+
+    // The stack of private names.
+    // Each element has two properties: 'declared' and 'used'.
+    // When it exited from the outermost class definition, all used private names must be declared.
+    this.privateNameStack = [];
+  };
+
+  var prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },canAwait: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true },allowNewDotTarget: { configurable: true },inClassStaticBlock: { configurable: true } };
+
+  Parser.prototype.parse = function parse () {
+    var node = this.options.program || this.startNode();
+    this.nextToken();
+    return this.parseTopLevel(node)
+  };
+
+  prototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };
+
+  prototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 && !this.currentVarScope().inClassFieldInit };
+
+  prototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 && !this.currentVarScope().inClassFieldInit };
+
+  prototypeAccessors.canAwait.get = function () {
+    for (var i = this.scopeStack.length - 1; i >= 0; i--) {
+      var scope = this.scopeStack[i];
+      if (scope.inClassFieldInit || scope.flags & SCOPE_CLASS_STATIC_BLOCK) { return false }
+      if (scope.flags & SCOPE_FUNCTION) { return (scope.flags & SCOPE_ASYNC) > 0 }
+    }
+    return (this.inModule && this.options.ecmaVersion >= 13) || this.options.allowAwaitOutsideFunction
+  };
+
+  prototypeAccessors.allowSuper.get = function () {
+    var ref = this.currentThisScope();
+      var flags = ref.flags;
+      var inClassFieldInit = ref.inClassFieldInit;
+    return (flags & SCOPE_SUPER) > 0 || inClassFieldInit || this.options.allowSuperOutsideMethod
+  };
+
+  prototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };
+
+  prototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };
+
+  prototypeAccessors.allowNewDotTarget.get = function () {
+    var ref = this.currentThisScope();
+      var flags = ref.flags;
+      var inClassFieldInit = ref.inClassFieldInit;
+    return (flags & (SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK)) > 0 || inClassFieldInit
+  };
+
+  prototypeAccessors.inClassStaticBlock.get = function () {
+    return (this.currentVarScope().flags & SCOPE_CLASS_STATIC_BLOCK) > 0
+  };
+
+  Parser.extend = function extend () {
+      var plugins = [], len = arguments.length;
+      while ( len-- ) plugins[ len ] = arguments[ len ];
+
+    var cls = this;
+    for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }
+    return cls
+  };
+
+  Parser.parse = function parse (input, options) {
+    return new this(options, input).parse()
+  };
+
+  Parser.parseExpressionAt = function parseExpressionAt (input, pos, options) {
+    var parser = new this(options, input, pos);
+    parser.nextToken();
+    return parser.parseExpression()
+  };
+
+  Parser.tokenizer = function tokenizer (input, options) {
+    return new this(options, input)
+  };
+
+  Object.defineProperties( Parser.prototype, prototypeAccessors );
+
+  var pp$9 = Parser.prototype;
+
+  // ## Parser utilities
+
+  var literal = /^(?:'((?:\\.|[^'\\])*?)'|"((?:\\.|[^"\\])*?)")/;
+  pp$9.strictDirective = function(start) {
+    for (;;) {
+      // Try to find string literal.
+      skipWhiteSpace.lastIndex = start;
+      start += skipWhiteSpace.exec(this.input)[0].length;
+      var match = literal.exec(this.input.slice(start));
+      if (!match) { return false }
+      if ((match[1] || match[2]) === "use strict") {
+        skipWhiteSpace.lastIndex = start + match[0].length;
+        var spaceAfter = skipWhiteSpace.exec(this.input), end = spaceAfter.index + spaceAfter[0].length;
+        var next = this.input.charAt(end);
+        return next === ";" || next === "}" ||
+          (lineBreak.test(spaceAfter[0]) &&
+           !(/[(`.[+\-/*%<>=,?^&]/.test(next) || next === "!" && this.input.charAt(end + 1) === "="))
+      }
+      start += match[0].length;
+
+      // Skip semicolon, if any.
+      skipWhiteSpace.lastIndex = start;
+      start += skipWhiteSpace.exec(this.input)[0].length;
+      if (this.input[start] === ";")
+        { start++; }
+    }
+  };
+
+  // Predicate that tests whether the next token is of the given
+  // type, and if yes, consumes it as a side effect.
+
+  pp$9.eat = function(type) {
+    if (this.type === type) {
+      this.next();
+      return true
+    } else {
+      return false
+    }
+  };
+
+  // Tests whether parsed token is a contextual keyword.
+
+  pp$9.isContextual = function(name) {
+    return this.type === types$1.name && this.value === name && !this.containsEsc
+  };
+
+  // Consumes contextual keyword if possible.
+
+  pp$9.eatContextual = function(name) {
+    if (!this.isContextual(name)) { return false }
+    this.next();
+    return true
+  };
+
+  // Asserts that following token is given contextual keyword.
+
+  pp$9.expectContextual = function(name) {
+    if (!this.eatContextual(name)) { this.unexpected(); }
+  };
+
+  // Test whether a semicolon can be inserted at the current position.
+
+  pp$9.canInsertSemicolon = function() {
+    return this.type === types$1.eof ||
+      this.type === types$1.braceR ||
+      lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+  };
+
+  pp$9.insertSemicolon = function() {
+    if (this.canInsertSemicolon()) {
+      if (this.options.onInsertedSemicolon)
+        { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }
+      return true
+    }
+  };
+
+  // Consume a semicolon, or, failing that, see if we are allowed to
+  // pretend that there is a semicolon at this position.
+
+  pp$9.semicolon = function() {
+    if (!this.eat(types$1.semi) && !this.insertSemicolon()) { this.unexpected(); }
+  };
+
+  pp$9.afterTrailingComma = function(tokType, notNext) {
+    if (this.type === tokType) {
+      if (this.options.onTrailingComma)
+        { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }
+      if (!notNext)
+        { this.next(); }
+      return true
+    }
+  };
+
+  // Expect a token of a given type. If found, consume it, otherwise,
+  // raise an unexpected token error.
+
+  pp$9.expect = function(type) {
+    this.eat(type) || this.unexpected();
+  };
+
+  // Raise an unexpected token error.
+
+  pp$9.unexpected = function(pos) {
+    this.raise(pos != null ? pos : this.start, "Unexpected token");
+  };
+
+  function DestructuringErrors() {
+    this.shorthandAssign =
+    this.trailingComma =
+    this.parenthesizedAssign =
+    this.parenthesizedBind =
+    this.doubleProto =
+      -1;
+  }
+
+  pp$9.checkPatternErrors = function(refDestructuringErrors, isAssign) {
+    if (!refDestructuringErrors) { return }
+    if (refDestructuringErrors.trailingComma > -1)
+      { this.raiseRecoverable(refDestructuringErrors.trailingComma, "Comma is not permitted after the rest element"); }
+    var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;
+    if (parens > -1) { this.raiseRecoverable(parens, "Parenthesized pattern"); }
+  };
+
+  pp$9.checkExpressionErrors = function(refDestructuringErrors, andThrow) {
+    if (!refDestructuringErrors) { return false }
+    var shorthandAssign = refDestructuringErrors.shorthandAssign;
+    var doubleProto = refDestructuringErrors.doubleProto;
+    if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }
+    if (shorthandAssign >= 0)
+      { this.raise(shorthandAssign, "Shorthand property assignments are valid only in destructuring patterns"); }
+    if (doubleProto >= 0)
+      { this.raiseRecoverable(doubleProto, "Redefinition of __proto__ property"); }
+  };
+
+  pp$9.checkYieldAwaitInDefaultParams = function() {
+    if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))
+      { this.raise(this.yieldPos, "Yield expression cannot be a default value"); }
+    if (this.awaitPos)
+      { this.raise(this.awaitPos, "Await expression cannot be a default value"); }
+  };
+
+  pp$9.isSimpleAssignTarget = function(expr) {
+    if (expr.type === "ParenthesizedExpression")
+      { return this.isSimpleAssignTarget(expr.expression) }
+    return expr.type === "Identifier" || expr.type === "MemberExpression"
+  };
+
+  var pp$8 = Parser.prototype;
+
+  // ### Statement parsing
+
+  // Parse a program. Initializes the parser, reads any number of
+  // statements, and wraps them in a Program node.  Optionally takes a
+  // `program` argument.  If present, the statements will be appended
+  // to its body instead of creating a new node.
+
+  pp$8.parseTopLevel = function(node) {
+    var exports = Object.create(null);
+    if (!node.body) { node.body = []; }
+    while (this.type !== types$1.eof) {
+      var stmt = this.parseStatement(null, true, exports);
+      node.body.push(stmt);
+    }
+    if (this.inModule)
+      { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)
+        {
+          var name = list[i];
+
+          this.raiseRecoverable(this.undefinedExports[name].start, ("Export '" + name + "' is not defined"));
+        } }
+    this.adaptDirectivePrologue(node.body);
+    this.next();
+    node.sourceType = this.options.sourceType;
+    return this.finishNode(node, "Program")
+  };
+
+  var loopLabel = {kind: "loop"}, switchLabel = {kind: "switch"};
+
+  pp$8.isLet = function(context) {
+    if (this.options.ecmaVersion < 6 || !this.isContextual("let")) { return false }
+    skipWhiteSpace.lastIndex = this.pos;
+    var skip = skipWhiteSpace.exec(this.input);
+    var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+    // For ambiguous cases, determine if a LexicalDeclaration (or only a
+    // Statement) is allowed here. If context is not empty then only a Statement
+    // is allowed. However, `let [` is an explicit negative lookahead for
+    // ExpressionStatement, so special-case it first.
+    if (nextCh === 91 || nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true } // '[', '/', astral
+    if (context) { return false }
+
+    if (nextCh === 123) { return true } // '{'
+    if (isIdentifierStart(nextCh, true)) {
+      var pos = next + 1;
+      while (isIdentifierChar(nextCh = this.input.charCodeAt(pos), true)) { ++pos; }
+      if (nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true }
+      var ident = this.input.slice(next, pos);
+      if (!keywordRelationalOperator.test(ident)) { return true }
+    }
+    return false
+  };
+
+  // check 'async [no LineTerminator here] function'
+  // - 'async /*foo*/ function' is OK.
+  // - 'async /*\n*/ function' is invalid.
+  pp$8.isAsyncFunction = function() {
+    if (this.options.ecmaVersion < 8 || !this.isContextual("async"))
+      { return false }
+
+    skipWhiteSpace.lastIndex = this.pos;
+    var skip = skipWhiteSpace.exec(this.input);
+    var next = this.pos + skip[0].length, after;
+    return !lineBreak.test(this.input.slice(this.pos, next)) &&
+      this.input.slice(next, next + 8) === "function" &&
+      (next + 8 === this.input.length ||
+       !(isIdentifierChar(after = this.input.charCodeAt(next + 8)) || after > 0xd7ff && after < 0xdc00))
+  };
+
+  // Parse a single statement.
+  //
+  // If expecting a statement and finding a slash operator, parse a
+  // regular expression literal. This is to handle cases like
+  // `if (foo) /blah/.exec(foo)`, where looking at the previous token
+  // does not help.
+
+  pp$8.parseStatement = function(context, topLevel, exports) {
+    var starttype = this.type, node = this.startNode(), kind;
+
+    if (this.isLet(context)) {
+      starttype = types$1._var;
+      kind = "let";
+    }
+
+    // Most types of statements are recognized by the keyword they
+    // start with. Many are trivial to parse, some require a bit of
+    // complexity.
+
+    switch (starttype) {
+    case types$1._break: case types$1._continue: return this.parseBreakContinueStatement(node, starttype.keyword)
+    case types$1._debugger: return this.parseDebuggerStatement(node)
+    case types$1._do: return this.parseDoStatement(node)
+    case types$1._for: return this.parseForStatement(node)
+    case types$1._function:
+      // Function as sole body of either an if statement or a labeled statement
+      // works, but not when it is part of a labeled statement that is the sole
+      // body of an if statement.
+      if ((context && (this.strict || context !== "if" && context !== "label")) && this.options.ecmaVersion >= 6) { this.unexpected(); }
+      return this.parseFunctionStatement(node, false, !context)
+    case types$1._class:
+      if (context) { this.unexpected(); }
+      return this.parseClass(node, true)
+    case types$1._if: return this.parseIfStatement(node)
+    case types$1._return: return this.parseReturnStatement(node)
+    case types$1._switch: return this.parseSwitchStatement(node)
+    case types$1._throw: return this.parseThrowStatement(node)
+    case types$1._try: return this.parseTryStatement(node)
+    case types$1._const: case types$1._var:
+      kind = kind || this.value;
+      if (context && kind !== "var") { this.unexpected(); }
+      return this.parseVarStatement(node, kind)
+    case types$1._while: return this.parseWhileStatement(node)
+    case types$1._with: return this.parseWithStatement(node)
+    case types$1.braceL: return this.parseBlock(true, node)
+    case types$1.semi: return this.parseEmptyStatement(node)
+    case types$1._export:
+    case types$1._import:
+      if (this.options.ecmaVersion > 10 && starttype === types$1._import) {
+        skipWhiteSpace.lastIndex = this.pos;
+        var skip = skipWhiteSpace.exec(this.input);
+        var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+        if (nextCh === 40 || nextCh === 46) // '(' or '.'
+          { return this.parseExpressionStatement(node, this.parseExpression()) }
+      }
+
+      if (!this.options.allowImportExportEverywhere) {
+        if (!topLevel)
+          { this.raise(this.start, "'import' and 'export' may only appear at the top level"); }
+        if (!this.inModule)
+          { this.raise(this.start, "'import' and 'export' may appear only with 'sourceType: module'"); }
+      }
+      return starttype === types$1._import ? this.parseImport(node) : this.parseExport(node, exports)
+
+      // If the statement does not start with a statement keyword or a
+      // brace, it's an ExpressionStatement or LabeledStatement. We
+      // simply start parsing an expression, and afterwards, if the
+      // next token is a colon and the expression was a simple
+      // Identifier node, we switch to interpreting it as a label.
+    default:
+      if (this.isAsyncFunction()) {
+        if (context) { this.unexpected(); }
+        this.next();
+        return this.parseFunctionStatement(node, true, !context)
+      }
+
+      var maybeName = this.value, expr = this.parseExpression();
+      if (starttype === types$1.name && expr.type === "Identifier" && this.eat(types$1.colon))
+        { return this.parseLabeledStatement(node, maybeName, expr, context) }
+      else { return this.parseExpressionStatement(node, expr) }
+    }
+  };
+
+  pp$8.parseBreakContinueStatement = function(node, keyword) {
+    var isBreak = keyword === "break";
+    this.next();
+    if (this.eat(types$1.semi) || this.insertSemicolon()) { node.label = null; }
+    else if (this.type !== types$1.name) { this.unexpected(); }
+    else {
+      node.label = this.parseIdent();
+      this.semicolon();
+    }
+
+    // Verify that there is an actual destination to break or
+    // continue to.
+    var i = 0;
+    for (; i < this.labels.length; ++i) {
+      var lab = this.labels[i];
+      if (node.label == null || lab.name === node.label.name) {
+        if (lab.kind != null && (isBreak || lab.kind === "loop")) { break }
+        if (node.label && isBreak) { break }
+      }
+    }
+    if (i === this.labels.length) { this.raise(node.start, "Unsyntactic " + keyword); }
+    return this.finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement")
+  };
+
+  pp$8.parseDebuggerStatement = function(node) {
+    this.next();
+    this.semicolon();
+    return this.finishNode(node, "DebuggerStatement")
+  };
+
+  pp$8.parseDoStatement = function(node) {
+    this.next();
+    this.labels.push(loopLabel);
+    node.body = this.parseStatement("do");
+    this.labels.pop();
+    this.expect(types$1._while);
+    node.test = this.parseParenExpression();
+    if (this.options.ecmaVersion >= 6)
+      { this.eat(types$1.semi); }
+    else
+      { this.semicolon(); }
+    return this.finishNode(node, "DoWhileStatement")
+  };
+
+  // Disambiguating between a `for` and a `for`/`in` or `for`/`of`
+  // loop is non-trivial. Basically, we have to parse the init `var`
+  // statement or expression, disallowing the `in` operator (see
+  // the second parameter to `parseExpression`), and then check
+  // whether the next token is `in` or `of`. When there is no init
+  // part (semicolon immediately after the opening parenthesis), it
+  // is a regular `for` loop.
+
+  pp$8.parseForStatement = function(node) {
+    this.next();
+    var awaitAt = (this.options.ecmaVersion >= 9 && this.canAwait && this.eatContextual("await")) ? this.lastTokStart : -1;
+    this.labels.push(loopLabel);
+    this.enterScope(0);
+    this.expect(types$1.parenL);
+    if (this.type === types$1.semi) {
+      if (awaitAt > -1) { this.unexpected(awaitAt); }
+      return this.parseFor(node, null)
+    }
+    var isLet = this.isLet();
+    if (this.type === types$1._var || this.type === types$1._const || isLet) {
+      var init$1 = this.startNode(), kind = isLet ? "let" : this.value;
+      this.next();
+      this.parseVar(init$1, true, kind);
+      this.finishNode(init$1, "VariableDeclaration");
+      if ((this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) && init$1.declarations.length === 1) {
+        if (this.options.ecmaVersion >= 9) {
+          if (this.type === types$1._in) {
+            if (awaitAt > -1) { this.unexpected(awaitAt); }
+          } else { node.await = awaitAt > -1; }
+        }
+        return this.parseForIn(node, init$1)
+      }
+      if (awaitAt > -1) { this.unexpected(awaitAt); }
+      return this.parseFor(node, init$1)
+    }
+    var startsWithLet = this.isContextual("let"), isForOf = false;
+    var refDestructuringErrors = new DestructuringErrors;
+    var init = this.parseExpression(awaitAt > -1 ? "await" : true, refDestructuringErrors);
+    if (this.type === types$1._in || (isForOf = this.options.ecmaVersion >= 6 && this.isContextual("of"))) {
+      if (this.options.ecmaVersion >= 9) {
+        if (this.type === types$1._in) {
+          if (awaitAt > -1) { this.unexpected(awaitAt); }
+        } else { node.await = awaitAt > -1; }
+      }
+      if (startsWithLet && isForOf) { this.raise(init.start, "The left-hand side of a for-of loop may not start with 'let'."); }
+      this.toAssignable(init, false, refDestructuringErrors);
+      this.checkLValPattern(init);
+      return this.parseForIn(node, init)
+    } else {
+      this.checkExpressionErrors(refDestructuringErrors, true);
+    }
+    if (awaitAt > -1) { this.unexpected(awaitAt); }
+    return this.parseFor(node, init)
+  };
+
+  pp$8.parseFunctionStatement = function(node, isAsync, declarationPosition) {
+    this.next();
+    return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)
+  };
+
+  pp$8.parseIfStatement = function(node) {
+    this.next();
+    node.test = this.parseParenExpression();
+    // allow function declarations in branches, but only in non-strict mode
+    node.consequent = this.parseStatement("if");
+    node.alternate = this.eat(types$1._else) ? this.parseStatement("if") : null;
+    return this.finishNode(node, "IfStatement")
+  };
+
+  pp$8.parseReturnStatement = function(node) {
+    if (!this.inFunction && !this.options.allowReturnOutsideFunction)
+      { this.raise(this.start, "'return' outside of function"); }
+    this.next();
+
+    // In `return` (and `break`/`continue`), the keywords with
+    // optional arguments, we eagerly look for a semicolon or the
+    // possibility to insert one.
+
+    if (this.eat(types$1.semi) || this.insertSemicolon()) { node.argument = null; }
+    else { node.argument = this.parseExpression(); this.semicolon(); }
+    return this.finishNode(node, "ReturnStatement")
+  };
+
+  pp$8.parseSwitchStatement = function(node) {
+    this.next();
+    node.discriminant = this.parseParenExpression();
+    node.cases = [];
+    this.expect(types$1.braceL);
+    this.labels.push(switchLabel);
+    this.enterScope(0);
+
+    // Statements under must be grouped (by label) in SwitchCase
+    // nodes. `cur` is used to keep the node that we are currently
+    // adding statements to.
+
+    var cur;
+    for (var sawDefault = false; this.type !== types$1.braceR;) {
+      if (this.type === types$1._case || this.type === types$1._default) {
+        var isCase = this.type === types$1._case;
+        if (cur) { this.finishNode(cur, "SwitchCase"); }
+        node.cases.push(cur = this.startNode());
+        cur.consequent = [];
+        this.next();
+        if (isCase) {
+          cur.test = this.parseExpression();
+        } else {
+          if (sawDefault) { this.raiseRecoverable(this.lastTokStart, "Multiple default clauses"); }
+          sawDefault = true;
+          cur.test = null;
+        }
+        this.expect(types$1.colon);
+      } else {
+        if (!cur) { this.unexpected(); }
+        cur.consequent.push(this.parseStatement(null));
+      }
+    }
+    this.exitScope();
+    if (cur) { this.finishNode(cur, "SwitchCase"); }
+    this.next(); // Closing brace
+    this.labels.pop();
+    return this.finishNode(node, "SwitchStatement")
+  };
+
+  pp$8.parseThrowStatement = function(node) {
+    this.next();
+    if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))
+      { this.raise(this.lastTokEnd, "Illegal newline after throw"); }
+    node.argument = this.parseExpression();
+    this.semicolon();
+    return this.finishNode(node, "ThrowStatement")
+  };
+
+  // Reused empty array added for node fields that are always empty.
+
+  var empty$1 = [];
+
+  pp$8.parseTryStatement = function(node) {
+    this.next();
+    node.block = this.parseBlock();
+    node.handler = null;
+    if (this.type === types$1._catch) {
+      var clause = this.startNode();
+      this.next();
+      if (this.eat(types$1.parenL)) {
+        clause.param = this.parseBindingAtom();
+        var simple = clause.param.type === "Identifier";
+        this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);
+        this.checkLValPattern(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);
+        this.expect(types$1.parenR);
+      } else {
+        if (this.options.ecmaVersion < 10) { this.unexpected(); }
+        clause.param = null;
+        this.enterScope(0);
+      }
+      clause.body = this.parseBlock(false);
+      this.exitScope();
+      node.handler = this.finishNode(clause, "CatchClause");
+    }
+    node.finalizer = this.eat(types$1._finally) ? this.parseBlock() : null;
+    if (!node.handler && !node.finalizer)
+      { this.raise(node.start, "Missing catch or finally clause"); }
+    return this.finishNode(node, "TryStatement")
+  };
+
+  pp$8.parseVarStatement = function(node, kind) {
+    this.next();
+    this.parseVar(node, false, kind);
+    this.semicolon();
+    return this.finishNode(node, "VariableDeclaration")
+  };
+
+  pp$8.parseWhileStatement = function(node) {
+    this.next();
+    node.test = this.parseParenExpression();
+    this.labels.push(loopLabel);
+    node.body = this.parseStatement("while");
+    this.labels.pop();
+    return this.finishNode(node, "WhileStatement")
+  };
+
+  pp$8.parseWithStatement = function(node) {
+    if (this.strict) { this.raise(this.start, "'with' in strict mode"); }
+    this.next();
+    node.object = this.parseParenExpression();
+    node.body = this.parseStatement("with");
+    return this.finishNode(node, "WithStatement")
+  };
+
+  pp$8.parseEmptyStatement = function(node) {
+    this.next();
+    return this.finishNode(node, "EmptyStatement")
+  };
+
+  pp$8.parseLabeledStatement = function(node, maybeName, expr, context) {
+    for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)
+      {
+      var label = list[i$1];
+
+      if (label.name === maybeName)
+        { this.raise(expr.start, "Label '" + maybeName + "' is already declared");
+    } }
+    var kind = this.type.isLoop ? "loop" : this.type === types$1._switch ? "switch" : null;
+    for (var i = this.labels.length - 1; i >= 0; i--) {
+      var label$1 = this.labels[i];
+      if (label$1.statementStart === node.start) {
+        // Update information about previous labels on this node
+        label$1.statementStart = this.start;
+        label$1.kind = kind;
+      } else { break }
+    }
+    this.labels.push({name: maybeName, kind: kind, statementStart: this.start});
+    node.body = this.parseStatement(context ? context.indexOf("label") === -1 ? context + "label" : context : "label");
+    this.labels.pop();
+    node.label = expr;
+    return this.finishNode(node, "LabeledStatement")
+  };
+
+  pp$8.parseExpressionStatement = function(node, expr) {
+    node.expression = expr;
+    this.semicolon();
+    return this.finishNode(node, "ExpressionStatement")
+  };
+
+  // Parse a semicolon-enclosed block of statements, handling `"use
+  // strict"` declarations when `allowStrict` is true (used for
+  // function bodies).
+
+  pp$8.parseBlock = function(createNewLexicalScope, node, exitStrict) {
+    if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;
+    if ( node === void 0 ) node = this.startNode();
+
+    node.body = [];
+    this.expect(types$1.braceL);
+    if (createNewLexicalScope) { this.enterScope(0); }
+    while (this.type !== types$1.braceR) {
+      var stmt = this.parseStatement(null);
+      node.body.push(stmt);
+    }
+    if (exitStrict) { this.strict = false; }
+    this.next();
+    if (createNewLexicalScope) { this.exitScope(); }
+    return this.finishNode(node, "BlockStatement")
+  };
+
+  // Parse a regular `for` loop. The disambiguation code in
+  // `parseStatement` will already have parsed the init statement or
+  // expression.
+
+  pp$8.parseFor = function(node, init) {
+    node.init = init;
+    this.expect(types$1.semi);
+    node.test = this.type === types$1.semi ? null : this.parseExpression();
+    this.expect(types$1.semi);
+    node.update = this.type === types$1.parenR ? null : this.parseExpression();
+    this.expect(types$1.parenR);
+    node.body = this.parseStatement("for");
+    this.exitScope();
+    this.labels.pop();
+    return this.finishNode(node, "ForStatement")
+  };
+
+  // Parse a `for`/`in` and `for`/`of` loop, which are almost
+  // same from parser's perspective.
+
+  pp$8.parseForIn = function(node, init) {
+    var isForIn = this.type === types$1._in;
+    this.next();
+
+    if (
+      init.type === "VariableDeclaration" &&
+      init.declarations[0].init != null &&
+      (
+        !isForIn ||
+        this.options.ecmaVersion < 8 ||
+        this.strict ||
+        init.kind !== "var" ||
+        init.declarations[0].id.type !== "Identifier"
+      )
+    ) {
+      this.raise(
+        init.start,
+        ((isForIn ? "for-in" : "for-of") + " loop variable declaration may not have an initializer")
+      );
+    }
+    node.left = init;
+    node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();
+    this.expect(types$1.parenR);
+    node.body = this.parseStatement("for");
+    this.exitScope();
+    this.labels.pop();
+    return this.finishNode(node, isForIn ? "ForInStatement" : "ForOfStatement")
+  };
+
+  // Parse a list of variable declarations.
+
+  pp$8.parseVar = function(node, isFor, kind) {
+    node.declarations = [];
+    node.kind = kind;
+    for (;;) {
+      var decl = this.startNode();
+      this.parseVarId(decl, kind);
+      if (this.eat(types$1.eq)) {
+        decl.init = this.parseMaybeAssign(isFor);
+      } else if (kind === "const" && !(this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual("of")))) {
+        this.unexpected();
+      } else if (decl.id.type !== "Identifier" && !(isFor && (this.type === types$1._in || this.isContextual("of")))) {
+        this.raise(this.lastTokEnd, "Complex binding patterns require an initialization value");
+      } else {
+        decl.init = null;
+      }
+      node.declarations.push(this.finishNode(decl, "VariableDeclarator"));
+      if (!this.eat(types$1.comma)) { break }
+    }
+    return node
+  };
+
+  pp$8.parseVarId = function(decl, kind) {
+    decl.id = this.parseBindingAtom();
+    this.checkLValPattern(decl.id, kind === "var" ? BIND_VAR : BIND_LEXICAL, false);
+  };
+
+  var FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;
+
+  // Parse a function declaration or literal (depending on the
+  // `statement & FUNC_STATEMENT`).
+
+  // Remove `allowExpressionBody` for 7.0.0, as it is only called with false
+  pp$8.parseFunction = function(node, statement, allowExpressionBody, isAsync, forInit) {
+    this.initFunction(node);
+    if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {
+      if (this.type === types$1.star && (statement & FUNC_HANGING_STATEMENT))
+        { this.unexpected(); }
+      node.generator = this.eat(types$1.star);
+    }
+    if (this.options.ecmaVersion >= 8)
+      { node.async = !!isAsync; }
+
+    if (statement & FUNC_STATEMENT) {
+      node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types$1.name ? null : this.parseIdent();
+      if (node.id && !(statement & FUNC_HANGING_STATEMENT))
+        // If it is a regular function declaration in sloppy mode, then it is
+        // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding
+        // mode depends on properties of the current scope (see
+        // treatFunctionsAsVar).
+        { this.checkLValSimple(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }
+    }
+
+    var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+    this.enterScope(functionFlags(node.async, node.generator));
+
+    if (!(statement & FUNC_STATEMENT))
+      { node.id = this.type === types$1.name ? this.parseIdent() : null; }
+
+    this.parseFunctionParams(node);
+    this.parseFunctionBody(node, allowExpressionBody, false, forInit);
+
+    this.yieldPos = oldYieldPos;
+    this.awaitPos = oldAwaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos;
+    return this.finishNode(node, (statement & FUNC_STATEMENT) ? "FunctionDeclaration" : "FunctionExpression")
+  };
+
+  pp$8.parseFunctionParams = function(node) {
+    this.expect(types$1.parenL);
+    node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);
+    this.checkYieldAwaitInDefaultParams();
+  };
+
+  // Parse a class declaration or literal (depending on the
+  // `isStatement` parameter).
+
+  pp$8.parseClass = function(node, isStatement) {
+    this.next();
+
+    // ecma-262 14.6 Class Definitions
+    // A class definition is always strict mode code.
+    var oldStrict = this.strict;
+    this.strict = true;
+
+    this.parseClassId(node, isStatement);
+    this.parseClassSuper(node);
+    var privateNameMap = this.enterClassBody();
+    var classBody = this.startNode();
+    var hadConstructor = false;
+    classBody.body = [];
+    this.expect(types$1.braceL);
+    while (this.type !== types$1.braceR) {
+      var element = this.parseClassElement(node.superClass !== null);
+      if (element) {
+        classBody.body.push(element);
+        if (element.type === "MethodDefinition" && element.kind === "constructor") {
+          if (hadConstructor) { this.raise(element.start, "Duplicate constructor in the same class"); }
+          hadConstructor = true;
+        } else if (element.key && element.key.type === "PrivateIdentifier" && isPrivateNameConflicted(privateNameMap, element)) {
+          this.raiseRecoverable(element.key.start, ("Identifier '#" + (element.key.name) + "' has already been declared"));
+        }
+      }
+    }
+    this.strict = oldStrict;
+    this.next();
+    node.body = this.finishNode(classBody, "ClassBody");
+    this.exitClassBody();
+    return this.finishNode(node, isStatement ? "ClassDeclaration" : "ClassExpression")
+  };
+
+  pp$8.parseClassElement = function(constructorAllowsSuper) {
+    if (this.eat(types$1.semi)) { return null }
+
+    var ecmaVersion = this.options.ecmaVersion;
+    var node = this.startNode();
+    var keyName = "";
+    var isGenerator = false;
+    var isAsync = false;
+    var kind = "method";
+    var isStatic = false;
+
+    if (this.eatContextual("static")) {
+      // Parse static init block
+      if (ecmaVersion >= 13 && this.eat(types$1.braceL)) {
+        this.parseClassStaticBlock(node);
+        return node
+      }
+      if (this.isClassElementNameStart() || this.type === types$1.star) {
+        isStatic = true;
+      } else {
+        keyName = "static";
+      }
+    }
+    node.static = isStatic;
+    if (!keyName && ecmaVersion >= 8 && this.eatContextual("async")) {
+      if ((this.isClassElementNameStart() || this.type === types$1.star) && !this.canInsertSemicolon()) {
+        isAsync = true;
+      } else {
+        keyName = "async";
+      }
+    }
+    if (!keyName && (ecmaVersion >= 9 || !isAsync) && this.eat(types$1.star)) {
+      isGenerator = true;
+    }
+    if (!keyName && !isAsync && !isGenerator) {
+      var lastValue = this.value;
+      if (this.eatContextual("get") || this.eatContextual("set")) {
+        if (this.isClassElementNameStart()) {
+          kind = lastValue;
+        } else {
+          keyName = lastValue;
+        }
+      }
+    }
+
+    // Parse element name
+    if (keyName) {
+      // 'async', 'get', 'set', or 'static' were not a keyword contextually.
+      // The last token is any of those. Make it the element name.
+      node.computed = false;
+      node.key = this.startNodeAt(this.lastTokStart, this.lastTokStartLoc);
+      node.key.name = keyName;
+      this.finishNode(node.key, "Identifier");
+    } else {
+      this.parseClassElementName(node);
+    }
+
+    // Parse element value
+    if (ecmaVersion < 13 || this.type === types$1.parenL || kind !== "method" || isGenerator || isAsync) {
+      var isConstructor = !node.static && checkKeyName(node, "constructor");
+      var allowsDirectSuper = isConstructor && constructorAllowsSuper;
+      // Couldn't move this check into the 'parseClassMethod' method for backward compatibility.
+      if (isConstructor && kind !== "method") { this.raise(node.key.start, "Constructor can't have get/set modifier"); }
+      node.kind = isConstructor ? "constructor" : kind;
+      this.parseClassMethod(node, isGenerator, isAsync, allowsDirectSuper);
+    } else {
+      this.parseClassField(node);
+    }
+
+    return node
+  };
+
+  pp$8.isClassElementNameStart = function() {
+    return (
+      this.type === types$1.name ||
+      this.type === types$1.privateId ||
+      this.type === types$1.num ||
+      this.type === types$1.string ||
+      this.type === types$1.bracketL ||
+      this.type.keyword
+    )
+  };
+
+  pp$8.parseClassElementName = function(element) {
+    if (this.type === types$1.privateId) {
+      if (this.value === "constructor") {
+        this.raise(this.start, "Classes can't have an element named '#constructor'");
+      }
+      element.computed = false;
+      element.key = this.parsePrivateIdent();
+    } else {
+      this.parsePropertyName(element);
+    }
+  };
+
+  pp$8.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {
+    // Check key and flags
+    var key = method.key;
+    if (method.kind === "constructor") {
+      if (isGenerator) { this.raise(key.start, "Constructor can't be a generator"); }
+      if (isAsync) { this.raise(key.start, "Constructor can't be an async method"); }
+    } else if (method.static && checkKeyName(method, "prototype")) {
+      this.raise(key.start, "Classes may not have a static property named prototype");
+    }
+
+    // Parse value
+    var value = method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);
+
+    // Check value
+    if (method.kind === "get" && value.params.length !== 0)
+      { this.raiseRecoverable(value.start, "getter should have no params"); }
+    if (method.kind === "set" && value.params.length !== 1)
+      { this.raiseRecoverable(value.start, "setter should have exactly one param"); }
+    if (method.kind === "set" && value.params[0].type === "RestElement")
+      { this.raiseRecoverable(value.params[0].start, "Setter cannot use rest params"); }
+
+    return this.finishNode(method, "MethodDefinition")
+  };
+
+  pp$8.parseClassField = function(field) {
+    if (checkKeyName(field, "constructor")) {
+      this.raise(field.key.start, "Classes can't have a field named 'constructor'");
+    } else if (field.static && checkKeyName(field, "prototype")) {
+      this.raise(field.key.start, "Classes can't have a static field named 'prototype'");
+    }
+
+    if (this.eat(types$1.eq)) {
+      // To raise SyntaxError if 'arguments' exists in the initializer.
+      var scope = this.currentThisScope();
+      var inClassFieldInit = scope.inClassFieldInit;
+      scope.inClassFieldInit = true;
+      field.value = this.parseMaybeAssign();
+      scope.inClassFieldInit = inClassFieldInit;
+    } else {
+      field.value = null;
+    }
+    this.semicolon();
+
+    return this.finishNode(field, "PropertyDefinition")
+  };
+
+  pp$8.parseClassStaticBlock = function(node) {
+    node.body = [];
+
+    var oldLabels = this.labels;
+    this.labels = [];
+    this.enterScope(SCOPE_CLASS_STATIC_BLOCK | SCOPE_SUPER);
+    while (this.type !== types$1.braceR) {
+      var stmt = this.parseStatement(null);
+      node.body.push(stmt);
+    }
+    this.next();
+    this.exitScope();
+    this.labels = oldLabels;
+
+    return this.finishNode(node, "StaticBlock")
+  };
+
+  pp$8.parseClassId = function(node, isStatement) {
+    if (this.type === types$1.name) {
+      node.id = this.parseIdent();
+      if (isStatement)
+        { this.checkLValSimple(node.id, BIND_LEXICAL, false); }
+    } else {
+      if (isStatement === true)
+        { this.unexpected(); }
+      node.id = null;
+    }
+  };
+
+  pp$8.parseClassSuper = function(node) {
+    node.superClass = this.eat(types$1._extends) ? this.parseExprSubscripts(false) : null;
+  };
+
+  pp$8.enterClassBody = function() {
+    var element = {declared: Object.create(null), used: []};
+    this.privateNameStack.push(element);
+    return element.declared
+  };
+
+  pp$8.exitClassBody = function() {
+    var ref = this.privateNameStack.pop();
+    var declared = ref.declared;
+    var used = ref.used;
+    var len = this.privateNameStack.length;
+    var parent = len === 0 ? null : this.privateNameStack[len - 1];
+    for (var i = 0; i < used.length; ++i) {
+      var id = used[i];
+      if (!hasOwn(declared, id.name)) {
+        if (parent) {
+          parent.used.push(id);
+        } else {
+          this.raiseRecoverable(id.start, ("Private field '#" + (id.name) + "' must be declared in an enclosing class"));
+        }
+      }
+    }
+  };
+
+  function isPrivateNameConflicted(privateNameMap, element) {
+    var name = element.key.name;
+    var curr = privateNameMap[name];
+
+    var next = "true";
+    if (element.type === "MethodDefinition" && (element.kind === "get" || element.kind === "set")) {
+      next = (element.static ? "s" : "i") + element.kind;
+    }
+
+    // `class { get #a(){}; static set #a(_){} }` is also conflict.
+    if (
+      curr === "iget" && next === "iset" ||
+      curr === "iset" && next === "iget" ||
+      curr === "sget" && next === "sset" ||
+      curr === "sset" && next === "sget"
+    ) {
+      privateNameMap[name] = "true";
+      return false
+    } else if (!curr) {
+      privateNameMap[name] = next;
+      return false
+    } else {
+      return true
+    }
+  }
+
+  function checkKeyName(node, name) {
+    var computed = node.computed;
+    var key = node.key;
+    return !computed && (
+      key.type === "Identifier" && key.name === name ||
+      key.type === "Literal" && key.value === name
+    )
+  }
+
+  // Parses module export declaration.
+
+  pp$8.parseExport = function(node, exports) {
+    this.next();
+    // export * from '...'
+    if (this.eat(types$1.star)) {
+      if (this.options.ecmaVersion >= 11) {
+        if (this.eatContextual("as")) {
+          node.exported = this.parseModuleExportName();
+          this.checkExport(exports, node.exported.name, this.lastTokStart);
+        } else {
+          node.exported = null;
+        }
+      }
+      this.expectContextual("from");
+      if (this.type !== types$1.string) { this.unexpected(); }
+      node.source = this.parseExprAtom();
+      this.semicolon();
+      return this.finishNode(node, "ExportAllDeclaration")
+    }
+    if (this.eat(types$1._default)) { // export default ...
+      this.checkExport(exports, "default", this.lastTokStart);
+      var isAsync;
+      if (this.type === types$1._function || (isAsync = this.isAsyncFunction())) {
+        var fNode = this.startNode();
+        this.next();
+        if (isAsync) { this.next(); }
+        node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+      } else if (this.type === types$1._class) {
+        var cNode = this.startNode();
+        node.declaration = this.parseClass(cNode, "nullableID");
+      } else {
+        node.declaration = this.parseMaybeAssign();
+        this.semicolon();
+      }
+      return this.finishNode(node, "ExportDefaultDeclaration")
+    }
+    // export var|const|let|function|class ...
+    if (this.shouldParseExportStatement()) {
+      node.declaration = this.parseStatement(null);
+      if (node.declaration.type === "VariableDeclaration")
+        { this.checkVariableExport(exports, node.declaration.declarations); }
+      else
+        { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }
+      node.specifiers = [];
+      node.source = null;
+    } else { // export { x, y as z } [from '...']
+      node.declaration = null;
+      node.specifiers = this.parseExportSpecifiers(exports);
+      if (this.eatContextual("from")) {
+        if (this.type !== types$1.string) { this.unexpected(); }
+        node.source = this.parseExprAtom();
+      } else {
+        for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+          // check for keywords used as local names
+          var spec = list[i];
+
+          this.checkUnreserved(spec.local);
+          // check if export is defined
+          this.checkLocalExport(spec.local);
+
+          if (spec.local.type === "Literal") {
+            this.raise(spec.local.start, "A string literal cannot be used as an exported binding without `from`.");
+          }
+        }
+
+        node.source = null;
+      }
+      this.semicolon();
+    }
+    return this.finishNode(node, "ExportNamedDeclaration")
+  };
+
+  pp$8.checkExport = function(exports, name, pos) {
+    if (!exports) { return }
+    if (hasOwn(exports, name))
+      { this.raiseRecoverable(pos, "Duplicate export '" + name + "'"); }
+    exports[name] = true;
+  };
+
+  pp$8.checkPatternExport = function(exports, pat) {
+    var type = pat.type;
+    if (type === "Identifier")
+      { this.checkExport(exports, pat.name, pat.start); }
+    else if (type === "ObjectPattern")
+      { for (var i = 0, list = pat.properties; i < list.length; i += 1)
+        {
+          var prop = list[i];
+
+          this.checkPatternExport(exports, prop);
+        } }
+    else if (type === "ArrayPattern")
+      { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {
+        var elt = list$1[i$1];
+
+          if (elt) { this.checkPatternExport(exports, elt); }
+      } }
+    else if (type === "Property")
+      { this.checkPatternExport(exports, pat.value); }
+    else if (type === "AssignmentPattern")
+      { this.checkPatternExport(exports, pat.left); }
+    else if (type === "RestElement")
+      { this.checkPatternExport(exports, pat.argument); }
+    else if (type === "ParenthesizedExpression")
+      { this.checkPatternExport(exports, pat.expression); }
+  };
+
+  pp$8.checkVariableExport = function(exports, decls) {
+    if (!exports) { return }
+    for (var i = 0, list = decls; i < list.length; i += 1)
+      {
+      var decl = list[i];
+
+      this.checkPatternExport(exports, decl.id);
+    }
+  };
+
+  pp$8.shouldParseExportStatement = function() {
+    return this.type.keyword === "var" ||
+      this.type.keyword === "const" ||
+      this.type.keyword === "class" ||
+      this.type.keyword === "function" ||
+      this.isLet() ||
+      this.isAsyncFunction()
+  };
+
+  // Parses a comma-separated list of module exports.
+
+  pp$8.parseExportSpecifiers = function(exports) {
+    var nodes = [], first = true;
+    // export { x, y as z } [from '...']
+    this.expect(types$1.braceL);
+    while (!this.eat(types$1.braceR)) {
+      if (!first) {
+        this.expect(types$1.comma);
+        if (this.afterTrailingComma(types$1.braceR)) { break }
+      } else { first = false; }
+
+      var node = this.startNode();
+      node.local = this.parseModuleExportName();
+      node.exported = this.eatContextual("as") ? this.parseModuleExportName() : node.local;
+      this.checkExport(
+        exports,
+        node.exported[node.exported.type === "Identifier" ? "name" : "value"],
+        node.exported.start
+      );
+      nodes.push(this.finishNode(node, "ExportSpecifier"));
+    }
+    return nodes
+  };
+
+  // Parses import declaration.
+
+  pp$8.parseImport = function(node) {
+    this.next();
+    // import '...'
+    if (this.type === types$1.string) {
+      node.specifiers = empty$1;
+      node.source = this.parseExprAtom();
+    } else {
+      node.specifiers = this.parseImportSpecifiers();
+      this.expectContextual("from");
+      node.source = this.type === types$1.string ? this.parseExprAtom() : this.unexpected();
+    }
+    this.semicolon();
+    return this.finishNode(node, "ImportDeclaration")
+  };
+
+  // Parses a comma-separated list of module imports.
+
+  pp$8.parseImportSpecifiers = function() {
+    var nodes = [], first = true;
+    if (this.type === types$1.name) {
+      // import defaultObj, { x, y as z } from '...'
+      var node = this.startNode();
+      node.local = this.parseIdent();
+      this.checkLValSimple(node.local, BIND_LEXICAL);
+      nodes.push(this.finishNode(node, "ImportDefaultSpecifier"));
+      if (!this.eat(types$1.comma)) { return nodes }
+    }
+    if (this.type === types$1.star) {
+      var node$1 = this.startNode();
+      this.next();
+      this.expectContextual("as");
+      node$1.local = this.parseIdent();
+      this.checkLValSimple(node$1.local, BIND_LEXICAL);
+      nodes.push(this.finishNode(node$1, "ImportNamespaceSpecifier"));
+      return nodes
+    }
+    this.expect(types$1.braceL);
+    while (!this.eat(types$1.braceR)) {
+      if (!first) {
+        this.expect(types$1.comma);
+        if (this.afterTrailingComma(types$1.braceR)) { break }
+      } else { first = false; }
+
+      var node$2 = this.startNode();
+      node$2.imported = this.parseModuleExportName();
+      if (this.eatContextual("as")) {
+        node$2.local = this.parseIdent();
+      } else {
+        this.checkUnreserved(node$2.imported);
+        node$2.local = node$2.imported;
+      }
+      this.checkLValSimple(node$2.local, BIND_LEXICAL);
+      nodes.push(this.finishNode(node$2, "ImportSpecifier"));
+    }
+    return nodes
+  };
+
+  pp$8.parseModuleExportName = function() {
+    if (this.options.ecmaVersion >= 13 && this.type === types$1.string) {
+      var stringLiteral = this.parseLiteral(this.value);
+      if (loneSurrogate.test(stringLiteral.value)) {
+        this.raise(stringLiteral.start, "An export name cannot include a lone surrogate.");
+      }
+      return stringLiteral
+    }
+    return this.parseIdent(true)
+  };
+
+  // Set `ExpressionStatement#directive` property for directive prologues.
+  pp$8.adaptDirectivePrologue = function(statements) {
+    for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {
+      statements[i].directive = statements[i].expression.raw.slice(1, -1);
+    }
+  };
+  pp$8.isDirectiveCandidate = function(statement) {
+    return (
+      statement.type === "ExpressionStatement" &&
+      statement.expression.type === "Literal" &&
+      typeof statement.expression.value === "string" &&
+      // Reject parenthesized strings.
+      (this.input[statement.start] === "\"" || this.input[statement.start] === "'")
+    )
+  };
+
+  var pp$7 = Parser.prototype;
+
+  // Convert existing expression atom to assignable pattern
+  // if possible.
+
+  pp$7.toAssignable = function(node, isBinding, refDestructuringErrors) {
+    if (this.options.ecmaVersion >= 6 && node) {
+      switch (node.type) {
+      case "Identifier":
+        if (this.inAsync && node.name === "await")
+          { this.raise(node.start, "Cannot use 'await' as identifier inside an async function"); }
+        break
+
+      case "ObjectPattern":
+      case "ArrayPattern":
+      case "AssignmentPattern":
+      case "RestElement":
+        break
+
+      case "ObjectExpression":
+        node.type = "ObjectPattern";
+        if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+        for (var i = 0, list = node.properties; i < list.length; i += 1) {
+          var prop = list[i];
+
+        this.toAssignable(prop, isBinding);
+          // Early error:
+          //   AssignmentRestProperty[Yield, Await] :
+          //     `...` DestructuringAssignmentTarget[Yield, Await]
+          //
+          //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.
+          if (
+            prop.type === "RestElement" &&
+            (prop.argument.type === "ArrayPattern" || prop.argument.type === "ObjectPattern")
+          ) {
+            this.raise(prop.argument.start, "Unexpected token");
+          }
+        }
+        break
+
+      case "Property":
+        // AssignmentProperty has type === "Property"
+        if (node.kind !== "init") { this.raise(node.key.start, "Object pattern can't contain getter or setter"); }
+        this.toAssignable(node.value, isBinding);
+        break
+
+      case "ArrayExpression":
+        node.type = "ArrayPattern";
+        if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+        this.toAssignableList(node.elements, isBinding);
+        break
+
+      case "SpreadElement":
+        node.type = "RestElement";
+        this.toAssignable(node.argument, isBinding);
+        if (node.argument.type === "AssignmentPattern")
+          { this.raise(node.argument.start, "Rest elements cannot have a default value"); }
+        break
+
+      case "AssignmentExpression":
+        if (node.operator !== "=") { this.raise(node.left.end, "Only '=' operator can be used for specifying default value."); }
+        node.type = "AssignmentPattern";
+        delete node.operator;
+        this.toAssignable(node.left, isBinding);
+        break
+
+      case "ParenthesizedExpression":
+        this.toAssignable(node.expression, isBinding, refDestructuringErrors);
+        break
+
+      case "ChainExpression":
+        this.raiseRecoverable(node.start, "Optional chaining cannot appear in left-hand side");
+        break
+
+      case "MemberExpression":
+        if (!isBinding) { break }
+
+      default:
+        this.raise(node.start, "Assigning to rvalue");
+      }
+    } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+    return node
+  };
+
+  // Convert list of expression atoms to binding list.
+
+  pp$7.toAssignableList = function(exprList, isBinding) {
+    var end = exprList.length;
+    for (var i = 0; i < end; i++) {
+      var elt = exprList[i];
+      if (elt) { this.toAssignable(elt, isBinding); }
+    }
+    if (end) {
+      var last = exprList[end - 1];
+      if (this.options.ecmaVersion === 6 && isBinding && last && last.type === "RestElement" && last.argument.type !== "Identifier")
+        { this.unexpected(last.argument.start); }
+    }
+    return exprList
+  };
+
+  // Parses spread element.
+
+  pp$7.parseSpread = function(refDestructuringErrors) {
+    var node = this.startNode();
+    this.next();
+    node.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+    return this.finishNode(node, "SpreadElement")
+  };
+
+  pp$7.parseRestBinding = function() {
+    var node = this.startNode();
+    this.next();
+
+    // RestElement inside of a function parameter must be an identifier
+    if (this.options.ecmaVersion === 6 && this.type !== types$1.name)
+      { this.unexpected(); }
+
+    node.argument = this.parseBindingAtom();
+
+    return this.finishNode(node, "RestElement")
+  };
+
+  // Parses lvalue (assignable) atom.
+
+  pp$7.parseBindingAtom = function() {
+    if (this.options.ecmaVersion >= 6) {
+      switch (this.type) {
+      case types$1.bracketL:
+        var node = this.startNode();
+        this.next();
+        node.elements = this.parseBindingList(types$1.bracketR, true, true);
+        return this.finishNode(node, "ArrayPattern")
+
+      case types$1.braceL:
+        return this.parseObj(true)
+      }
+    }
+    return this.parseIdent()
+  };
+
+  pp$7.parseBindingList = function(close, allowEmpty, allowTrailingComma) {
+    var elts = [], first = true;
+    while (!this.eat(close)) {
+      if (first) { first = false; }
+      else { this.expect(types$1.comma); }
+      if (allowEmpty && this.type === types$1.comma) {
+        elts.push(null);
+      } else if (allowTrailingComma && this.afterTrailingComma(close)) {
+        break
+      } else if (this.type === types$1.ellipsis) {
+        var rest = this.parseRestBinding();
+        this.parseBindingListItem(rest);
+        elts.push(rest);
+        if (this.type === types$1.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+        this.expect(close);
+        break
+      } else {
+        var elem = this.parseMaybeDefault(this.start, this.startLoc);
+        this.parseBindingListItem(elem);
+        elts.push(elem);
+      }
+    }
+    return elts
+  };
+
+  pp$7.parseBindingListItem = function(param) {
+    return param
+  };
+
+  // Parses assignment pattern around given atom if possible.
+
+  pp$7.parseMaybeDefault = function(startPos, startLoc, left) {
+    left = left || this.parseBindingAtom();
+    if (this.options.ecmaVersion < 6 || !this.eat(types$1.eq)) { return left }
+    var node = this.startNodeAt(startPos, startLoc);
+    node.left = left;
+    node.right = this.parseMaybeAssign();
+    return this.finishNode(node, "AssignmentPattern")
+  };
+
+  // The following three functions all verify that a node is an lvalue —
+  // something that can be bound, or assigned to. In order to do so, they perform
+  // a variety of checks:
+  //
+  // - Check that none of the bound/assigned-to identifiers are reserved words.
+  // - Record name declarations for bindings in the appropriate scope.
+  // - Check duplicate argument names, if checkClashes is set.
+  //
+  // If a complex binding pattern is encountered (e.g., object and array
+  // destructuring), the entire pattern is recursively checked.
+  //
+  // There are three versions of checkLVal*() appropriate for different
+  // circumstances:
+  //
+  // - checkLValSimple() shall be used if the syntactic construct supports
+  //   nothing other than identifiers and member expressions. Parenthesized
+  //   expressions are also correctly handled. This is generally appropriate for
+  //   constructs for which the spec says
+  //
+  //   > It is a Syntax Error if AssignmentTargetType of [the production] is not
+  //   > simple.
+  //
+  //   It is also appropriate for checking if an identifier is valid and not
+  //   defined elsewhere, like import declarations or function/class identifiers.
+  //
+  //   Examples where this is used include:
+  //     a += …;
+  //     import a from '…';
+  //   where a is the node to be checked.
+  //
+  // - checkLValPattern() shall be used if the syntactic construct supports
+  //   anything checkLValSimple() supports, as well as object and array
+  //   destructuring patterns. This is generally appropriate for constructs for
+  //   which the spec says
+  //
+  //   > It is a Syntax Error if [the production] is neither an ObjectLiteral nor
+  //   > an ArrayLiteral and AssignmentTargetType of [the production] is not
+  //   > simple.
+  //
+  //   Examples where this is used include:
+  //     (a = …);
+  //     const a = …;
+  //     try { … } catch (a) { … }
+  //   where a is the node to be checked.
+  //
+  // - checkLValInnerPattern() shall be used if the syntactic construct supports
+  //   anything checkLValPattern() supports, as well as default assignment
+  //   patterns, rest elements, and other constructs that may appear within an
+  //   object or array destructuring pattern.
+  //
+  //   As a special case, function parameters also use checkLValInnerPattern(),
+  //   as they also support defaults and rest constructs.
+  //
+  // These functions deliberately support both assignment and binding constructs,
+  // as the logic for both is exceedingly similar. If the node is the target of
+  // an assignment, then bindingType should be set to BIND_NONE. Otherwise, it
+  // should be set to the appropriate BIND_* constant, like BIND_VAR or
+  // BIND_LEXICAL.
+  //
+  // If the function is called with a non-BIND_NONE bindingType, then
+  // additionally a checkClashes object may be specified to allow checking for
+  // duplicate argument names. checkClashes is ignored if the provided construct
+  // is an assignment (i.e., bindingType is BIND_NONE).
+
+  pp$7.checkLValSimple = function(expr, bindingType, checkClashes) {
+    if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+    var isBind = bindingType !== BIND_NONE;
+
+    switch (expr.type) {
+    case "Identifier":
+      if (this.strict && this.reservedWordsStrictBind.test(expr.name))
+        { this.raiseRecoverable(expr.start, (isBind ? "Binding " : "Assigning to ") + expr.name + " in strict mode"); }
+      if (isBind) {
+        if (bindingType === BIND_LEXICAL && expr.name === "let")
+          { this.raiseRecoverable(expr.start, "let is disallowed as a lexically bound name"); }
+        if (checkClashes) {
+          if (hasOwn(checkClashes, expr.name))
+            { this.raiseRecoverable(expr.start, "Argument name clash"); }
+          checkClashes[expr.name] = true;
+        }
+        if (bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }
+      }
+      break
+
+    case "ChainExpression":
+      this.raiseRecoverable(expr.start, "Optional chaining cannot appear in left-hand side");
+      break
+
+    case "MemberExpression":
+      if (isBind) { this.raiseRecoverable(expr.start, "Binding member expression"); }
+      break
+
+    case "ParenthesizedExpression":
+      if (isBind) { this.raiseRecoverable(expr.start, "Binding parenthesized expression"); }
+      return this.checkLValSimple(expr.expression, bindingType, checkClashes)
+
+    default:
+      this.raise(expr.start, (isBind ? "Binding" : "Assigning to") + " rvalue");
+    }
+  };
+
+  pp$7.checkLValPattern = function(expr, bindingType, checkClashes) {
+    if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+    switch (expr.type) {
+    case "ObjectPattern":
+      for (var i = 0, list = expr.properties; i < list.length; i += 1) {
+        var prop = list[i];
+
+      this.checkLValInnerPattern(prop, bindingType, checkClashes);
+      }
+      break
+
+    case "ArrayPattern":
+      for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {
+        var elem = list$1[i$1];
+
+      if (elem) { this.checkLValInnerPattern(elem, bindingType, checkClashes); }
+      }
+      break
+
+    default:
+      this.checkLValSimple(expr, bindingType, checkClashes);
+    }
+  };
+
+  pp$7.checkLValInnerPattern = function(expr, bindingType, checkClashes) {
+    if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+    switch (expr.type) {
+    case "Property":
+      // AssignmentProperty has type === "Property"
+      this.checkLValInnerPattern(expr.value, bindingType, checkClashes);
+      break
+
+    case "AssignmentPattern":
+      this.checkLValPattern(expr.left, bindingType, checkClashes);
+      break
+
+    case "RestElement":
+      this.checkLValPattern(expr.argument, bindingType, checkClashes);
+      break
+
+    default:
+      this.checkLValPattern(expr, bindingType, checkClashes);
+    }
+  };
+
+  // The algorithm used to determine whether a regexp can appear at a
+
+  var TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {
+    this.token = token;
+    this.isExpr = !!isExpr;
+    this.preserveSpace = !!preserveSpace;
+    this.override = override;
+    this.generator = !!generator;
+  };
+
+  var types = {
+    b_stat: new TokContext("{", false),
+    b_expr: new TokContext("{", true),
+    b_tmpl: new TokContext("${", false),
+    p_stat: new TokContext("(", false),
+    p_expr: new TokContext("(", true),
+    q_tmpl: new TokContext("`", true, true, function (p) { return p.tryReadTemplateToken(); }),
+    f_stat: new TokContext("function", false),
+    f_expr: new TokContext("function", true),
+    f_expr_gen: new TokContext("function", true, false, null, true),
+    f_gen: new TokContext("function", false, false, null, true)
+  };
+
+  var pp$6 = Parser.prototype;
+
+  pp$6.initialContext = function() {
+    return [types.b_stat]
+  };
+
+  pp$6.curContext = function() {
+    return this.context[this.context.length - 1]
+  };
+
+  pp$6.braceIsBlock = function(prevType) {
+    var parent = this.curContext();
+    if (parent === types.f_expr || parent === types.f_stat)
+      { return true }
+    if (prevType === types$1.colon && (parent === types.b_stat || parent === types.b_expr))
+      { return !parent.isExpr }
+
+    // The check for `tt.name && exprAllowed` detects whether we are
+    // after a `yield` or `of` construct. See the `updateContext` for
+    // `tt.name`.
+    if (prevType === types$1._return || prevType === types$1.name && this.exprAllowed)
+      { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }
+    if (prevType === types$1._else || prevType === types$1.semi || prevType === types$1.eof || prevType === types$1.parenR || prevType === types$1.arrow)
+      { return true }
+    if (prevType === types$1.braceL)
+      { return parent === types.b_stat }
+    if (prevType === types$1._var || prevType === types$1._const || prevType === types$1.name)
+      { return false }
+    return !this.exprAllowed
+  };
+
+  pp$6.inGeneratorContext = function() {
+    for (var i = this.context.length - 1; i >= 1; i--) {
+      var context = this.context[i];
+      if (context.token === "function")
+        { return context.generator }
+    }
+    return false
+  };
+
+  pp$6.updateContext = function(prevType) {
+    var update, type = this.type;
+    if (type.keyword && prevType === types$1.dot)
+      { this.exprAllowed = false; }
+    else if (update = type.updateContext)
+      { update.call(this, prevType); }
+    else
+      { this.exprAllowed = type.beforeExpr; }
+  };
+
+  // Used to handle egde case when token context could not be inferred correctly in tokenize phase
+  pp$6.overrideContext = function(tokenCtx) {
+    if (this.curContext() !== tokenCtx) {
+      this.context[this.context.length - 1] = tokenCtx;
+    }
+  };
+
+  // Token-specific context update code
+
+  types$1.parenR.updateContext = types$1.braceR.updateContext = function() {
+    if (this.context.length === 1) {
+      this.exprAllowed = true;
+      return
+    }
+    var out = this.context.pop();
+    if (out === types.b_stat && this.curContext().token === "function") {
+      out = this.context.pop();
+    }
+    this.exprAllowed = !out.isExpr;
+  };
+
+  types$1.braceL.updateContext = function(prevType) {
+    this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr);
+    this.exprAllowed = true;
+  };
+
+  types$1.dollarBraceL.updateContext = function() {
+    this.context.push(types.b_tmpl);
+    this.exprAllowed = true;
+  };
+
+  types$1.parenL.updateContext = function(prevType) {
+    var statementParens = prevType === types$1._if || prevType === types$1._for || prevType === types$1._with || prevType === types$1._while;
+    this.context.push(statementParens ? types.p_stat : types.p_expr);
+    this.exprAllowed = true;
+  };
+
+  types$1.incDec.updateContext = function() {
+    // tokExprAllowed stays unchanged
+  };
+
+  types$1._function.updateContext = types$1._class.updateContext = function(prevType) {
+    if (prevType.beforeExpr && prevType !== types$1._else &&
+        !(prevType === types$1.semi && this.curContext() !== types.p_stat) &&
+        !(prevType === types$1._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&
+        !((prevType === types$1.colon || prevType === types$1.braceL) && this.curContext() === types.b_stat))
+      { this.context.push(types.f_expr); }
+    else
+      { this.context.push(types.f_stat); }
+    this.exprAllowed = false;
+  };
+
+  types$1.backQuote.updateContext = function() {
+    if (this.curContext() === types.q_tmpl)
+      { this.context.pop(); }
+    else
+      { this.context.push(types.q_tmpl); }
+    this.exprAllowed = false;
+  };
+
+  types$1.star.updateContext = function(prevType) {
+    if (prevType === types$1._function) {
+      var index = this.context.length - 1;
+      if (this.context[index] === types.f_expr)
+        { this.context[index] = types.f_expr_gen; }
+      else
+        { this.context[index] = types.f_gen; }
+    }
+    this.exprAllowed = true;
+  };
+
+  types$1.name.updateContext = function(prevType) {
+    var allowed = false;
+    if (this.options.ecmaVersion >= 6 && prevType !== types$1.dot) {
+      if (this.value === "of" && !this.exprAllowed ||
+          this.value === "yield" && this.inGeneratorContext())
+        { allowed = true; }
+    }
+    this.exprAllowed = allowed;
+  };
+
+  // A recursive descent parser operates by defining functions for all
+
+  var pp$5 = Parser.prototype;
+
+  // Check if property name clashes with already added.
+  // Object/class getters and setters are not allowed to clash —
+  // either with each other or with an init property — and in
+  // strict mode, init properties are also not allowed to be repeated.
+
+  pp$5.checkPropClash = function(prop, propHash, refDestructuringErrors) {
+    if (this.options.ecmaVersion >= 9 && prop.type === "SpreadElement")
+      { return }
+    if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))
+      { return }
+    var key = prop.key;
+    var name;
+    switch (key.type) {
+    case "Identifier": name = key.name; break
+    case "Literal": name = String(key.value); break
+    default: return
+    }
+    var kind = prop.kind;
+    if (this.options.ecmaVersion >= 6) {
+      if (name === "__proto__" && kind === "init") {
+        if (propHash.proto) {
+          if (refDestructuringErrors) {
+            if (refDestructuringErrors.doubleProto < 0) {
+              refDestructuringErrors.doubleProto = key.start;
+            }
+          } else {
+            this.raiseRecoverable(key.start, "Redefinition of __proto__ property");
+          }
+        }
+        propHash.proto = true;
+      }
+      return
+    }
+    name = "$" + name;
+    var other = propHash[name];
+    if (other) {
+      var redefinition;
+      if (kind === "init") {
+        redefinition = this.strict && other.init || other.get || other.set;
+      } else {
+        redefinition = other.init || other[kind];
+      }
+      if (redefinition)
+        { this.raiseRecoverable(key.start, "Redefinition of property"); }
+    } else {
+      other = propHash[name] = {
+        init: false,
+        get: false,
+        set: false
+      };
+    }
+    other[kind] = true;
+  };
+
+  // ### Expression parsing
+
+  // These nest, from the most general expression type at the top to
+  // 'atomic', nondivisible expression types at the bottom. Most of
+  // the functions will simply let the function(s) below them parse,
+  // and, *if* the syntactic construct they handle is present, wrap
+  // the AST node that the inner parser gave them in another node.
+
+  // Parse a full expression. The optional arguments are used to
+  // forbid the `in` operator (in for loops initalization expressions)
+  // and provide reference for storing '=' operator inside shorthand
+  // property assignment in contexts where both object expression
+  // and object pattern might appear (so it's possible to raise
+  // delayed syntax error at correct position).
+
+  pp$5.parseExpression = function(forInit, refDestructuringErrors) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseMaybeAssign(forInit, refDestructuringErrors);
+    if (this.type === types$1.comma) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.expressions = [expr];
+      while (this.eat(types$1.comma)) { node.expressions.push(this.parseMaybeAssign(forInit, refDestructuringErrors)); }
+      return this.finishNode(node, "SequenceExpression")
+    }
+    return expr
+  };
+
+  // Parse an assignment expression. This includes applications of
+  // operators like `+=`.
+
+  pp$5.parseMaybeAssign = function(forInit, refDestructuringErrors, afterLeftParse) {
+    if (this.isContextual("yield")) {
+      if (this.inGenerator) { return this.parseYield(forInit) }
+      // The tokenizer will assume an expression is allowed after
+      // `yield`, but this isn't that kind of yield
+      else { this.exprAllowed = false; }
+    }
+
+    var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldDoubleProto = -1;
+    if (refDestructuringErrors) {
+      oldParenAssign = refDestructuringErrors.parenthesizedAssign;
+      oldTrailingComma = refDestructuringErrors.trailingComma;
+      oldDoubleProto = refDestructuringErrors.doubleProto;
+      refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1;
+    } else {
+      refDestructuringErrors = new DestructuringErrors;
+      ownDestructuringErrors = true;
+    }
+
+    var startPos = this.start, startLoc = this.startLoc;
+    if (this.type === types$1.parenL || this.type === types$1.name) {
+      this.potentialArrowAt = this.start;
+      this.potentialArrowInForAwait = forInit === "await";
+    }
+    var left = this.parseMaybeConditional(forInit, refDestructuringErrors);
+    if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }
+    if (this.type.isAssign) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.operator = this.value;
+      if (this.type === types$1.eq)
+        { left = this.toAssignable(left, false, refDestructuringErrors); }
+      if (!ownDestructuringErrors) {
+        refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.doubleProto = -1;
+      }
+      if (refDestructuringErrors.shorthandAssign >= left.start)
+        { refDestructuringErrors.shorthandAssign = -1; } // reset because shorthand default was used correctly
+      if (this.type === types$1.eq)
+        { this.checkLValPattern(left); }
+      else
+        { this.checkLValSimple(left); }
+      node.left = left;
+      this.next();
+      node.right = this.parseMaybeAssign(forInit);
+      if (oldDoubleProto > -1) { refDestructuringErrors.doubleProto = oldDoubleProto; }
+      return this.finishNode(node, "AssignmentExpression")
+    } else {
+      if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }
+    }
+    if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }
+    if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }
+    return left
+  };
+
+  // Parse a ternary conditional (`?:`) operator.
+
+  pp$5.parseMaybeConditional = function(forInit, refDestructuringErrors) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseExprOps(forInit, refDestructuringErrors);
+    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+    if (this.eat(types$1.question)) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.test = expr;
+      node.consequent = this.parseMaybeAssign();
+      this.expect(types$1.colon);
+      node.alternate = this.parseMaybeAssign(forInit);
+      return this.finishNode(node, "ConditionalExpression")
+    }
+    return expr
+  };
+
+  // Start the precedence parser.
+
+  pp$5.parseExprOps = function(forInit, refDestructuringErrors) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseMaybeUnary(refDestructuringErrors, false, false, forInit);
+    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+    return expr.start === startPos && expr.type === "ArrowFunctionExpression" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, forInit)
+  };
+
+  // Parse binary operators with the operator precedence parsing
+  // algorithm. `left` is the left-hand side of the operator.
+  // `minPrec` provides context that allows the function to stop and
+  // defer further parser to one of its callers when it encounters an
+  // operator that has a lower precedence than the set it is parsing.
+
+  pp$5.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, forInit) {
+    var prec = this.type.binop;
+    if (prec != null && (!forInit || this.type !== types$1._in)) {
+      if (prec > minPrec) {
+        var logical = this.type === types$1.logicalOR || this.type === types$1.logicalAND;
+        var coalesce = this.type === types$1.coalesce;
+        if (coalesce) {
+          // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.
+          // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.
+          prec = types$1.logicalAND.binop;
+        }
+        var op = this.value;
+        this.next();
+        var startPos = this.start, startLoc = this.startLoc;
+        var right = this.parseExprOp(this.parseMaybeUnary(null, false, false, forInit), startPos, startLoc, prec, forInit);
+        var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical || coalesce);
+        if ((logical && this.type === types$1.coalesce) || (coalesce && (this.type === types$1.logicalOR || this.type === types$1.logicalAND))) {
+          this.raiseRecoverable(this.start, "Logical expressions and coalesce expressions cannot be mixed. Wrap either by parentheses");
+        }
+        return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, forInit)
+      }
+    }
+    return left
+  };
+
+  pp$5.buildBinary = function(startPos, startLoc, left, right, op, logical) {
+    if (right.type === "PrivateIdentifier") { this.raise(right.start, "Private identifier can only be left side of binary expression"); }
+    var node = this.startNodeAt(startPos, startLoc);
+    node.left = left;
+    node.operator = op;
+    node.right = right;
+    return this.finishNode(node, logical ? "LogicalExpression" : "BinaryExpression")
+  };
+
+  // Parse unary operators, both prefix and postfix.
+
+  pp$5.parseMaybeUnary = function(refDestructuringErrors, sawUnary, incDec, forInit) {
+    var startPos = this.start, startLoc = this.startLoc, expr;
+    if (this.isContextual("await") && this.canAwait) {
+      expr = this.parseAwait(forInit);
+      sawUnary = true;
+    } else if (this.type.prefix) {
+      var node = this.startNode(), update = this.type === types$1.incDec;
+      node.operator = this.value;
+      node.prefix = true;
+      this.next();
+      node.argument = this.parseMaybeUnary(null, true, update, forInit);
+      this.checkExpressionErrors(refDestructuringErrors, true);
+      if (update) { this.checkLValSimple(node.argument); }
+      else if (this.strict && node.operator === "delete" &&
+               node.argument.type === "Identifier")
+        { this.raiseRecoverable(node.start, "Deleting local variable in strict mode"); }
+      else if (node.operator === "delete" && isPrivateFieldAccess(node.argument))
+        { this.raiseRecoverable(node.start, "Private fields can not be deleted"); }
+      else { sawUnary = true; }
+      expr = this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
+    } else if (!sawUnary && this.type === types$1.privateId) {
+      if (forInit || this.privateNameStack.length === 0) { this.unexpected(); }
+      expr = this.parsePrivateIdent();
+      // only could be private fields in 'in', such as #x in obj
+      if (this.type !== types$1._in) { this.unexpected(); }
+    } else {
+      expr = this.parseExprSubscripts(refDestructuringErrors, forInit);
+      if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+      while (this.type.postfix && !this.canInsertSemicolon()) {
+        var node$1 = this.startNodeAt(startPos, startLoc);
+        node$1.operator = this.value;
+        node$1.prefix = false;
+        node$1.argument = expr;
+        this.checkLValSimple(expr);
+        this.next();
+        expr = this.finishNode(node$1, "UpdateExpression");
+      }
+    }
+
+    if (!incDec && this.eat(types$1.starstar)) {
+      if (sawUnary)
+        { this.unexpected(this.lastTokStart); }
+      else
+        { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false, false, forInit), "**", false) }
+    } else {
+      return expr
+    }
+  };
+
+  function isPrivateFieldAccess(node) {
+    return (
+      node.type === "MemberExpression" && node.property.type === "PrivateIdentifier" ||
+      node.type === "ChainExpression" && isPrivateFieldAccess(node.expression)
+    )
+  }
+
+  // Parse call, dot, and `[]`-subscript expressions.
+
+  pp$5.parseExprSubscripts = function(refDestructuringErrors, forInit) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseExprAtom(refDestructuringErrors, forInit);
+    if (expr.type === "ArrowFunctionExpression" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== ")")
+      { return expr }
+    var result = this.parseSubscripts(expr, startPos, startLoc, false, forInit);
+    if (refDestructuringErrors && result.type === "MemberExpression") {
+      if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }
+      if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }
+      if (refDestructuringErrors.trailingComma >= result.start) { refDestructuringErrors.trailingComma = -1; }
+    }
+    return result
+  };
+
+  pp$5.parseSubscripts = function(base, startPos, startLoc, noCalls, forInit) {
+    var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === "Identifier" && base.name === "async" &&
+        this.lastTokEnd === base.end && !this.canInsertSemicolon() && base.end - base.start === 5 &&
+        this.potentialArrowAt === base.start;
+    var optionalChained = false;
+
+    while (true) {
+      var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit);
+
+      if (element.optional) { optionalChained = true; }
+      if (element === base || element.type === "ArrowFunctionExpression") {
+        if (optionalChained) {
+          var chainNode = this.startNodeAt(startPos, startLoc);
+          chainNode.expression = element;
+          element = this.finishNode(chainNode, "ChainExpression");
+        }
+        return element
+      }
+
+      base = element;
+    }
+  };
+
+  pp$5.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit) {
+    var optionalSupported = this.options.ecmaVersion >= 11;
+    var optional = optionalSupported && this.eat(types$1.questionDot);
+    if (noCalls && optional) { this.raise(this.lastTokStart, "Optional chaining cannot appear in the callee of new expressions"); }
+
+    var computed = this.eat(types$1.bracketL);
+    if (computed || (optional && this.type !== types$1.parenL && this.type !== types$1.backQuote) || this.eat(types$1.dot)) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.object = base;
+      if (computed) {
+        node.property = this.parseExpression();
+        this.expect(types$1.bracketR);
+      } else if (this.type === types$1.privateId && base.type !== "Super") {
+        node.property = this.parsePrivateIdent();
+      } else {
+        node.property = this.parseIdent(this.options.allowReserved !== "never");
+      }
+      node.computed = !!computed;
+      if (optionalSupported) {
+        node.optional = optional;
+      }
+      base = this.finishNode(node, "MemberExpression");
+    } else if (!noCalls && this.eat(types$1.parenL)) {
+      var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+      this.yieldPos = 0;
+      this.awaitPos = 0;
+      this.awaitIdentPos = 0;
+      var exprList = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);
+      if (maybeAsyncArrow && !optional && !this.canInsertSemicolon() && this.eat(types$1.arrow)) {
+        this.checkPatternErrors(refDestructuringErrors, false);
+        this.checkYieldAwaitInDefaultParams();
+        if (this.awaitIdentPos > 0)
+          { this.raise(this.awaitIdentPos, "Cannot use 'await' as identifier inside an async function"); }
+        this.yieldPos = oldYieldPos;
+        this.awaitPos = oldAwaitPos;
+        this.awaitIdentPos = oldAwaitIdentPos;
+        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true, forInit)
+      }
+      this.checkExpressionErrors(refDestructuringErrors, true);
+      this.yieldPos = oldYieldPos || this.yieldPos;
+      this.awaitPos = oldAwaitPos || this.awaitPos;
+      this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;
+      var node$1 = this.startNodeAt(startPos, startLoc);
+      node$1.callee = base;
+      node$1.arguments = exprList;
+      if (optionalSupported) {
+        node$1.optional = optional;
+      }
+      base = this.finishNode(node$1, "CallExpression");
+    } else if (this.type === types$1.backQuote) {
+      if (optional || optionalChained) {
+        this.raise(this.start, "Optional chaining cannot appear in the tag of tagged template expressions");
+      }
+      var node$2 = this.startNodeAt(startPos, startLoc);
+      node$2.tag = base;
+      node$2.quasi = this.parseTemplate({isTagged: true});
+      base = this.finishNode(node$2, "TaggedTemplateExpression");
+    }
+    return base
+  };
+
+  // Parse an atomic expression — either a single token that is an
+  // expression, an expression started by a keyword like `function` or
+  // `new`, or an expression wrapped in punctuation like `()`, `[]`,
+  // or `{}`.
+
+  pp$5.parseExprAtom = function(refDestructuringErrors, forInit) {
+    // If a division operator appears in an expression position, the
+    // tokenizer got confused, and we force it to read a regexp instead.
+    if (this.type === types$1.slash) { this.readRegexp(); }
+
+    var node, canBeArrow = this.potentialArrowAt === this.start;
+    switch (this.type) {
+    case types$1._super:
+      if (!this.allowSuper)
+        { this.raise(this.start, "'super' keyword outside a method"); }
+      node = this.startNode();
+      this.next();
+      if (this.type === types$1.parenL && !this.allowDirectSuper)
+        { this.raise(node.start, "super() call outside constructor of a subclass"); }
+      // The `super` keyword can appear at below:
+      // SuperProperty:
+      //     super [ Expression ]
+      //     super . IdentifierName
+      // SuperCall:
+      //     super ( Arguments )
+      if (this.type !== types$1.dot && this.type !== types$1.bracketL && this.type !== types$1.parenL)
+        { this.unexpected(); }
+      return this.finishNode(node, "Super")
+
+    case types$1._this:
+      node = this.startNode();
+      this.next();
+      return this.finishNode(node, "ThisExpression")
+
+    case types$1.name:
+      var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;
+      var id = this.parseIdent(false);
+      if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === "async" && !this.canInsertSemicolon() && this.eat(types$1._function)) {
+        this.overrideContext(types.f_expr);
+        return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true, forInit)
+      }
+      if (canBeArrow && !this.canInsertSemicolon()) {
+        if (this.eat(types$1.arrow))
+          { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false, forInit) }
+        if (this.options.ecmaVersion >= 8 && id.name === "async" && this.type === types$1.name && !containsEsc &&
+            (!this.potentialArrowInForAwait || this.value !== "of" || this.containsEsc)) {
+          id = this.parseIdent(false);
+          if (this.canInsertSemicolon() || !this.eat(types$1.arrow))
+            { this.unexpected(); }
+          return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true, forInit)
+        }
+      }
+      return id
+
+    case types$1.regexp:
+      var value = this.value;
+      node = this.parseLiteral(value.value);
+      node.regex = {pattern: value.pattern, flags: value.flags};
+      return node
+
+    case types$1.num: case types$1.string:
+      return this.parseLiteral(this.value)
+
+    case types$1._null: case types$1._true: case types$1._false:
+      node = this.startNode();
+      node.value = this.type === types$1._null ? null : this.type === types$1._true;
+      node.raw = this.type.keyword;
+      this.next();
+      return this.finishNode(node, "Literal")
+
+    case types$1.parenL:
+      var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow, forInit);
+      if (refDestructuringErrors) {
+        if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))
+          { refDestructuringErrors.parenthesizedAssign = start; }
+        if (refDestructuringErrors.parenthesizedBind < 0)
+          { refDestructuringErrors.parenthesizedBind = start; }
+      }
+      return expr
+
+    case types$1.bracketL:
+      node = this.startNode();
+      this.next();
+      node.elements = this.parseExprList(types$1.bracketR, true, true, refDestructuringErrors);
+      return this.finishNode(node, "ArrayExpression")
+
+    case types$1.braceL:
+      this.overrideContext(types.b_expr);
+      return this.parseObj(false, refDestructuringErrors)
+
+    case types$1._function:
+      node = this.startNode();
+      this.next();
+      return this.parseFunction(node, 0)
+
+    case types$1._class:
+      return this.parseClass(this.startNode(), false)
+
+    case types$1._new:
+      return this.parseNew()
+
+    case types$1.backQuote:
+      return this.parseTemplate()
+
+    case types$1._import:
+      if (this.options.ecmaVersion >= 11) {
+        return this.parseExprImport()
+      } else {
+        return this.unexpected()
+      }
+
+    default:
+      this.unexpected();
+    }
+  };
+
+  pp$5.parseExprImport = function() {
+    var node = this.startNode();
+
+    // Consume `import` as an identifier for `import.meta`.
+    // Because `this.parseIdent(true)` doesn't check escape sequences, it needs the check of `this.containsEsc`.
+    if (this.containsEsc) { this.raiseRecoverable(this.start, "Escape sequence in keyword import"); }
+    var meta = this.parseIdent(true);
+
+    switch (this.type) {
+    case types$1.parenL:
+      return this.parseDynamicImport(node)
+    case types$1.dot:
+      node.meta = meta;
+      return this.parseImportMeta(node)
+    default:
+      this.unexpected();
+    }
+  };
+
+  pp$5.parseDynamicImport = function(node) {
+    this.next(); // skip `(`
+
+    // Parse node.source.
+    node.source = this.parseMaybeAssign();
+
+    // Verify ending.
+    if (!this.eat(types$1.parenR)) {
+      var errorPos = this.start;
+      if (this.eat(types$1.comma) && this.eat(types$1.parenR)) {
+        this.raiseRecoverable(errorPos, "Trailing comma is not allowed in import()");
+      } else {
+        this.unexpected(errorPos);
+      }
+    }
+
+    return this.finishNode(node, "ImportExpression")
+  };
+
+  pp$5.parseImportMeta = function(node) {
+    this.next(); // skip `.`
+
+    var containsEsc = this.containsEsc;
+    node.property = this.parseIdent(true);
+
+    if (node.property.name !== "meta")
+      { this.raiseRecoverable(node.property.start, "The only valid meta property for import is 'import.meta'"); }
+    if (containsEsc)
+      { this.raiseRecoverable(node.start, "'import.meta' must not contain escaped characters"); }
+    if (this.options.sourceType !== "module" && !this.options.allowImportExportEverywhere)
+      { this.raiseRecoverable(node.start, "Cannot use 'import.meta' outside a module"); }
+
+    return this.finishNode(node, "MetaProperty")
+  };
+
+  pp$5.parseLiteral = function(value) {
+    var node = this.startNode();
+    node.value = value;
+    node.raw = this.input.slice(this.start, this.end);
+    if (node.raw.charCodeAt(node.raw.length - 1) === 110) { node.bigint = node.raw.slice(0, -1).replace(/_/g, ""); }
+    this.next();
+    return this.finishNode(node, "Literal")
+  };
+
+  pp$5.parseParenExpression = function() {
+    this.expect(types$1.parenL);
+    var val = this.parseExpression();
+    this.expect(types$1.parenR);
+    return val
+  };
+
+  pp$5.parseParenAndDistinguishExpression = function(canBeArrow, forInit) {
+    var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;
+    if (this.options.ecmaVersion >= 6) {
+      this.next();
+
+      var innerStartPos = this.start, innerStartLoc = this.startLoc;
+      var exprList = [], first = true, lastIsComma = false;
+      var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;
+      this.yieldPos = 0;
+      this.awaitPos = 0;
+      // Do not save awaitIdentPos to allow checking awaits nested in parameters
+      while (this.type !== types$1.parenR) {
+        first ? first = false : this.expect(types$1.comma);
+        if (allowTrailingComma && this.afterTrailingComma(types$1.parenR, true)) {
+          lastIsComma = true;
+          break
+        } else if (this.type === types$1.ellipsis) {
+          spreadStart = this.start;
+          exprList.push(this.parseParenItem(this.parseRestBinding()));
+          if (this.type === types$1.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+          break
+        } else {
+          exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));
+        }
+      }
+      var innerEndPos = this.lastTokEnd, innerEndLoc = this.lastTokEndLoc;
+      this.expect(types$1.parenR);
+
+      if (canBeArrow && !this.canInsertSemicolon() && this.eat(types$1.arrow)) {
+        this.checkPatternErrors(refDestructuringErrors, false);
+        this.checkYieldAwaitInDefaultParams();
+        this.yieldPos = oldYieldPos;
+        this.awaitPos = oldAwaitPos;
+        return this.parseParenArrowList(startPos, startLoc, exprList, forInit)
+      }
+
+      if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }
+      if (spreadStart) { this.unexpected(spreadStart); }
+      this.checkExpressionErrors(refDestructuringErrors, true);
+      this.yieldPos = oldYieldPos || this.yieldPos;
+      this.awaitPos = oldAwaitPos || this.awaitPos;
+
+      if (exprList.length > 1) {
+        val = this.startNodeAt(innerStartPos, innerStartLoc);
+        val.expressions = exprList;
+        this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc);
+      } else {
+        val = exprList[0];
+      }
+    } else {
+      val = this.parseParenExpression();
+    }
+
+    if (this.options.preserveParens) {
+      var par = this.startNodeAt(startPos, startLoc);
+      par.expression = val;
+      return this.finishNode(par, "ParenthesizedExpression")
+    } else {
+      return val
+    }
+  };
+
+  pp$5.parseParenItem = function(item) {
+    return item
+  };
+
+  pp$5.parseParenArrowList = function(startPos, startLoc, exprList, forInit) {
+    return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, false, forInit)
+  };
+
+  // New's precedence is slightly tricky. It must allow its argument to
+  // be a `[]` or dot subscript expression, but not a call — at least,
+  // not without wrapping it in parentheses. Thus, it uses the noCalls
+  // argument to parseSubscripts to prevent it from consuming the
+  // argument list.
+
+  var empty = [];
+
+  pp$5.parseNew = function() {
+    if (this.containsEsc) { this.raiseRecoverable(this.start, "Escape sequence in keyword new"); }
+    var node = this.startNode();
+    var meta = this.parseIdent(true);
+    if (this.options.ecmaVersion >= 6 && this.eat(types$1.dot)) {
+      node.meta = meta;
+      var containsEsc = this.containsEsc;
+      node.property = this.parseIdent(true);
+      if (node.property.name !== "target")
+        { this.raiseRecoverable(node.property.start, "The only valid meta property for new is 'new.target'"); }
+      if (containsEsc)
+        { this.raiseRecoverable(node.start, "'new.target' must not contain escaped characters"); }
+      if (!this.allowNewDotTarget)
+        { this.raiseRecoverable(node.start, "'new.target' can only be used in functions and class static block"); }
+      return this.finishNode(node, "MetaProperty")
+    }
+    var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types$1._import;
+    node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true, false);
+    if (isImport && node.callee.type === "ImportExpression") {
+      this.raise(startPos, "Cannot use new with import()");
+    }
+    if (this.eat(types$1.parenL)) { node.arguments = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false); }
+    else { node.arguments = empty; }
+    return this.finishNode(node, "NewExpression")
+  };
+
+  // Parse template expression.
+
+  pp$5.parseTemplateElement = function(ref) {
+    var isTagged = ref.isTagged;
+
+    var elem = this.startNode();
+    if (this.type === types$1.invalidTemplate) {
+      if (!isTagged) {
+        this.raiseRecoverable(this.start, "Bad escape sequence in untagged template literal");
+      }
+      elem.value = {
+        raw: this.value,
+        cooked: null
+      };
+    } else {
+      elem.value = {
+        raw: this.input.slice(this.start, this.end).replace(/\r\n?/g, "\n"),
+        cooked: this.value
+      };
+    }
+    this.next();
+    elem.tail = this.type === types$1.backQuote;
+    return this.finishNode(elem, "TemplateElement")
+  };
+
+  pp$5.parseTemplate = function(ref) {
+    if ( ref === void 0 ) ref = {};
+    var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;
+
+    var node = this.startNode();
+    this.next();
+    node.expressions = [];
+    var curElt = this.parseTemplateElement({isTagged: isTagged});
+    node.quasis = [curElt];
+    while (!curElt.tail) {
+      if (this.type === types$1.eof) { this.raise(this.pos, "Unterminated template literal"); }
+      this.expect(types$1.dollarBraceL);
+      node.expressions.push(this.parseExpression());
+      this.expect(types$1.braceR);
+      node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));
+    }
+    this.next();
+    return this.finishNode(node, "TemplateLiteral")
+  };
+
+  pp$5.isAsyncProp = function(prop) {
+    return !prop.computed && prop.key.type === "Identifier" && prop.key.name === "async" &&
+      (this.type === types$1.name || this.type === types$1.num || this.type === types$1.string || this.type === types$1.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types$1.star)) &&
+      !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+  };
+
+  // Parse an object literal or binding pattern.
+
+  pp$5.parseObj = function(isPattern, refDestructuringErrors) {
+    var node = this.startNode(), first = true, propHash = {};
+    node.properties = [];
+    this.next();
+    while (!this.eat(types$1.braceR)) {
+      if (!first) {
+        this.expect(types$1.comma);
+        if (this.options.ecmaVersion >= 5 && this.afterTrailingComma(types$1.braceR)) { break }
+      } else { first = false; }
+
+      var prop = this.parseProperty(isPattern, refDestructuringErrors);
+      if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }
+      node.properties.push(prop);
+    }
+    return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression")
+  };
+
+  pp$5.parseProperty = function(isPattern, refDestructuringErrors) {
+    var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;
+    if (this.options.ecmaVersion >= 9 && this.eat(types$1.ellipsis)) {
+      if (isPattern) {
+        prop.argument = this.parseIdent(false);
+        if (this.type === types$1.comma) {
+          this.raise(this.start, "Comma is not permitted after the rest element");
+        }
+        return this.finishNode(prop, "RestElement")
+      }
+      // To disallow parenthesized identifier via `this.toAssignable()`.
+      if (this.type === types$1.parenL && refDestructuringErrors) {
+        if (refDestructuringErrors.parenthesizedAssign < 0) {
+          refDestructuringErrors.parenthesizedAssign = this.start;
+        }
+        if (refDestructuringErrors.parenthesizedBind < 0) {
+          refDestructuringErrors.parenthesizedBind = this.start;
+        }
+      }
+      // Parse argument.
+      prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+      // To disallow trailing comma via `this.toAssignable()`.
+      if (this.type === types$1.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {
+        refDestructuringErrors.trailingComma = this.start;
+      }
+      // Finish
+      return this.finishNode(prop, "SpreadElement")
+    }
+    if (this.options.ecmaVersion >= 6) {
+      prop.method = false;
+      prop.shorthand = false;
+      if (isPattern || refDestructuringErrors) {
+        startPos = this.start;
+        startLoc = this.startLoc;
+      }
+      if (!isPattern)
+        { isGenerator = this.eat(types$1.star); }
+    }
+    var containsEsc = this.containsEsc;
+    this.parsePropertyName(prop);
+    if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {
+      isAsync = true;
+      isGenerator = this.options.ecmaVersion >= 9 && this.eat(types$1.star);
+      this.parsePropertyName(prop, refDestructuringErrors);
+    } else {
+      isAsync = false;
+    }
+    this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);
+    return this.finishNode(prop, "Property")
+  };
+
+  pp$5.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {
+    if ((isGenerator || isAsync) && this.type === types$1.colon)
+      { this.unexpected(); }
+
+    if (this.eat(types$1.colon)) {
+      prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);
+      prop.kind = "init";
+    } else if (this.options.ecmaVersion >= 6 && this.type === types$1.parenL) {
+      if (isPattern) { this.unexpected(); }
+      prop.kind = "init";
+      prop.method = true;
+      prop.value = this.parseMethod(isGenerator, isAsync);
+    } else if (!isPattern && !containsEsc &&
+               this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === "Identifier" &&
+               (prop.key.name === "get" || prop.key.name === "set") &&
+               (this.type !== types$1.comma && this.type !== types$1.braceR && this.type !== types$1.eq)) {
+      if (isGenerator || isAsync) { this.unexpected(); }
+      prop.kind = prop.key.name;
+      this.parsePropertyName(prop);
+      prop.value = this.parseMethod(false);
+      var paramCount = prop.kind === "get" ? 0 : 1;
+      if (prop.value.params.length !== paramCount) {
+        var start = prop.value.start;
+        if (prop.kind === "get")
+          { this.raiseRecoverable(start, "getter should have no params"); }
+        else
+          { this.raiseRecoverable(start, "setter should have exactly one param"); }
+      } else {
+        if (prop.kind === "set" && prop.value.params[0].type === "RestElement")
+          { this.raiseRecoverable(prop.value.params[0].start, "Setter cannot use rest params"); }
+      }
+    } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === "Identifier") {
+      if (isGenerator || isAsync) { this.unexpected(); }
+      this.checkUnreserved(prop.key);
+      if (prop.key.name === "await" && !this.awaitIdentPos)
+        { this.awaitIdentPos = startPos; }
+      prop.kind = "init";
+      if (isPattern) {
+        prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));
+      } else if (this.type === types$1.eq && refDestructuringErrors) {
+        if (refDestructuringErrors.shorthandAssign < 0)
+          { refDestructuringErrors.shorthandAssign = this.start; }
+        prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));
+      } else {
+        prop.value = this.copyNode(prop.key);
+      }
+      prop.shorthand = true;
+    } else { this.unexpected(); }
+  };
+
+  pp$5.parsePropertyName = function(prop) {
+    if (this.options.ecmaVersion >= 6) {
+      if (this.eat(types$1.bracketL)) {
+        prop.computed = true;
+        prop.key = this.parseMaybeAssign();
+        this.expect(types$1.bracketR);
+        return prop.key
+      } else {
+        prop.computed = false;
+      }
+    }
+    return prop.key = this.type === types$1.num || this.type === types$1.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== "never")
+  };
+
+  // Initialize empty function node.
+
+  pp$5.initFunction = function(node) {
+    node.id = null;
+    if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }
+    if (this.options.ecmaVersion >= 8) { node.async = false; }
+  };
+
+  // Parse object or class method.
+
+  pp$5.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {
+    var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+    this.initFunction(node);
+    if (this.options.ecmaVersion >= 6)
+      { node.generator = isGenerator; }
+    if (this.options.ecmaVersion >= 8)
+      { node.async = !!isAsync; }
+
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+    this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));
+
+    this.expect(types$1.parenL);
+    node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);
+    this.checkYieldAwaitInDefaultParams();
+    this.parseFunctionBody(node, false, true, false);
+
+    this.yieldPos = oldYieldPos;
+    this.awaitPos = oldAwaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos;
+    return this.finishNode(node, "FunctionExpression")
+  };
+
+  // Parse arrow function expression with given parameters.
+
+  pp$5.parseArrowExpression = function(node, params, isAsync, forInit) {
+    var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+    this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);
+    this.initFunction(node);
+    if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }
+
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+
+    node.params = this.toAssignableList(params, true);
+    this.parseFunctionBody(node, true, false, forInit);
+
+    this.yieldPos = oldYieldPos;
+    this.awaitPos = oldAwaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos;
+    return this.finishNode(node, "ArrowFunctionExpression")
+  };
+
+  // Parse function body and check parameters.
+
+  pp$5.parseFunctionBody = function(node, isArrowFunction, isMethod, forInit) {
+    var isExpression = isArrowFunction && this.type !== types$1.braceL;
+    var oldStrict = this.strict, useStrict = false;
+
+    if (isExpression) {
+      node.body = this.parseMaybeAssign(forInit);
+      node.expression = true;
+      this.checkParams(node, false);
+    } else {
+      var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);
+      if (!oldStrict || nonSimple) {
+        useStrict = this.strictDirective(this.end);
+        // If this is a strict mode function, verify that argument names
+        // are not repeated, and it does not try to bind the words `eval`
+        // or `arguments`.
+        if (useStrict && nonSimple)
+          { this.raiseRecoverable(node.start, "Illegal 'use strict' directive in function with non-simple parameter list"); }
+      }
+      // Start a new scope with regard to labels and the `inFunction`
+      // flag (restore them to their old value afterwards).
+      var oldLabels = this.labels;
+      this.labels = [];
+      if (useStrict) { this.strict = true; }
+
+      // Add the params to varDeclaredNames to ensure that an error is thrown
+      // if a let/const declaration in the function clashes with one of the params.
+      this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));
+      // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'
+      if (this.strict && node.id) { this.checkLValSimple(node.id, BIND_OUTSIDE); }
+      node.body = this.parseBlock(false, undefined, useStrict && !oldStrict);
+      node.expression = false;
+      this.adaptDirectivePrologue(node.body.body);
+      this.labels = oldLabels;
+    }
+    this.exitScope();
+  };
+
+  pp$5.isSimpleParamList = function(params) {
+    for (var i = 0, list = params; i < list.length; i += 1)
+      {
+      var param = list[i];
+
+      if (param.type !== "Identifier") { return false
+    } }
+    return true
+  };
+
+  // Checks function params for various disallowed patterns such as using "eval"
+  // or "arguments" and duplicate parameters.
+
+  pp$5.checkParams = function(node, allowDuplicates) {
+    var nameHash = Object.create(null);
+    for (var i = 0, list = node.params; i < list.length; i += 1)
+      {
+      var param = list[i];
+
+      this.checkLValInnerPattern(param, BIND_VAR, allowDuplicates ? null : nameHash);
+    }
+  };
+
+  // Parses a comma-separated list of expressions, and returns them as
+  // an array. `close` is the token type that ends the list, and
+  // `allowEmpty` can be turned on to allow subsequent commas with
+  // nothing in between them to be parsed as `null` (which is needed
+  // for array literals).
+
+  pp$5.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {
+    var elts = [], first = true;
+    while (!this.eat(close)) {
+      if (!first) {
+        this.expect(types$1.comma);
+        if (allowTrailingComma && this.afterTrailingComma(close)) { break }
+      } else { first = false; }
+
+      var elt = (void 0);
+      if (allowEmpty && this.type === types$1.comma)
+        { elt = null; }
+      else if (this.type === types$1.ellipsis) {
+        elt = this.parseSpread(refDestructuringErrors);
+        if (refDestructuringErrors && this.type === types$1.comma && refDestructuringErrors.trailingComma < 0)
+          { refDestructuringErrors.trailingComma = this.start; }
+      } else {
+        elt = this.parseMaybeAssign(false, refDestructuringErrors);
+      }
+      elts.push(elt);
+    }
+    return elts
+  };
+
+  pp$5.checkUnreserved = function(ref) {
+    var start = ref.start;
+    var end = ref.end;
+    var name = ref.name;
+
+    if (this.inGenerator && name === "yield")
+      { this.raiseRecoverable(start, "Cannot use 'yield' as identifier inside a generator"); }
+    if (this.inAsync && name === "await")
+      { this.raiseRecoverable(start, "Cannot use 'await' as identifier inside an async function"); }
+    if (this.currentThisScope().inClassFieldInit && name === "arguments")
+      { this.raiseRecoverable(start, "Cannot use 'arguments' in class field initializer"); }
+    if (this.inClassStaticBlock && (name === "arguments" || name === "await"))
+      { this.raise(start, ("Cannot use " + name + " in class static initialization block")); }
+    if (this.keywords.test(name))
+      { this.raise(start, ("Unexpected keyword '" + name + "'")); }
+    if (this.options.ecmaVersion < 6 &&
+      this.input.slice(start, end).indexOf("\\") !== -1) { return }
+    var re = this.strict ? this.reservedWordsStrict : this.reservedWords;
+    if (re.test(name)) {
+      if (!this.inAsync && name === "await")
+        { this.raiseRecoverable(start, "Cannot use keyword 'await' outside an async function"); }
+      this.raiseRecoverable(start, ("The keyword '" + name + "' is reserved"));
+    }
+  };
+
+  // Parse the next token as an identifier. If `liberal` is true (used
+  // when parsing properties), it will also convert keywords into
+  // identifiers.
+
+  pp$5.parseIdent = function(liberal, isBinding) {
+    var node = this.startNode();
+    if (this.type === types$1.name) {
+      node.name = this.value;
+    } else if (this.type.keyword) {
+      node.name = this.type.keyword;
+
+      // To fix https://github.com/acornjs/acorn/issues/575
+      // `class` and `function` keywords push new context into this.context.
+      // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.
+      // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword
+      if ((node.name === "class" || node.name === "function") &&
+          (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {
+        this.context.pop();
+      }
+    } else {
+      this.unexpected();
+    }
+    this.next(!!liberal);
+    this.finishNode(node, "Identifier");
+    if (!liberal) {
+      this.checkUnreserved(node);
+      if (node.name === "await" && !this.awaitIdentPos)
+        { this.awaitIdentPos = node.start; }
+    }
+    return node
+  };
+
+  pp$5.parsePrivateIdent = function() {
+    var node = this.startNode();
+    if (this.type === types$1.privateId) {
+      node.name = this.value;
+    } else {
+      this.unexpected();
+    }
+    this.next();
+    this.finishNode(node, "PrivateIdentifier");
+
+    // For validating existence
+    if (this.privateNameStack.length === 0) {
+      this.raise(node.start, ("Private field '#" + (node.name) + "' must be declared in an enclosing class"));
+    } else {
+      this.privateNameStack[this.privateNameStack.length - 1].used.push(node);
+    }
+
+    return node
+  };
+
+  // Parses yield expression inside generator.
+
+  pp$5.parseYield = function(forInit) {
+    if (!this.yieldPos) { this.yieldPos = this.start; }
+
+    var node = this.startNode();
+    this.next();
+    if (this.type === types$1.semi || this.canInsertSemicolon() || (this.type !== types$1.star && !this.type.startsExpr)) {
+      node.delegate = false;
+      node.argument = null;
+    } else {
+      node.delegate = this.eat(types$1.star);
+      node.argument = this.parseMaybeAssign(forInit);
+    }
+    return this.finishNode(node, "YieldExpression")
+  };
+
+  pp$5.parseAwait = function(forInit) {
+    if (!this.awaitPos) { this.awaitPos = this.start; }
+
+    var node = this.startNode();
+    this.next();
+    node.argument = this.parseMaybeUnary(null, true, false, forInit);
+    return this.finishNode(node, "AwaitExpression")
+  };
+
+  var pp$4 = Parser.prototype;
+
+  // This function is used to raise exceptions on parse errors. It
+  // takes an offset integer (into the current `input`) to indicate
+  // the location of the error, attaches the position to the end
+  // of the error message, and then raises a `SyntaxError` with that
+  // message.
+
+  pp$4.raise = function(pos, message) {
+    var loc = getLineInfo(this.input, pos);
+    message += " (" + loc.line + ":" + loc.column + ")";
+    var err = new SyntaxError(message);
+    err.pos = pos; err.loc = loc; err.raisedAt = this.pos;
+    throw err
+  };
+
+  pp$4.raiseRecoverable = pp$4.raise;
+
+  pp$4.curPosition = function() {
+    if (this.options.locations) {
+      return new Position(this.curLine, this.pos - this.lineStart)
+    }
+  };
+
+  var pp$3 = Parser.prototype;
+
+  var Scope = function Scope(flags) {
+    this.flags = flags;
+    // A list of var-declared names in the current lexical scope
+    this.var = [];
+    // A list of lexically-declared names in the current lexical scope
+    this.lexical = [];
+    // A list of lexically-declared FunctionDeclaration names in the current lexical scope
+    this.functions = [];
+    // A switch to disallow the identifier reference 'arguments'
+    this.inClassFieldInit = false;
+  };
+
+  // The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.
+
+  pp$3.enterScope = function(flags) {
+    this.scopeStack.push(new Scope(flags));
+  };
+
+  pp$3.exitScope = function() {
+    this.scopeStack.pop();
+  };
+
+  // The spec says:
+  // > At the top level of a function, or script, function declarations are
+  // > treated like var declarations rather than like lexical declarations.
+  pp$3.treatFunctionsAsVarInScope = function(scope) {
+    return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)
+  };
+
+  pp$3.declareName = function(name, bindingType, pos) {
+    var redeclared = false;
+    if (bindingType === BIND_LEXICAL) {
+      var scope = this.currentScope();
+      redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;
+      scope.lexical.push(name);
+      if (this.inModule && (scope.flags & SCOPE_TOP))
+        { delete this.undefinedExports[name]; }
+    } else if (bindingType === BIND_SIMPLE_CATCH) {
+      var scope$1 = this.currentScope();
+      scope$1.lexical.push(name);
+    } else if (bindingType === BIND_FUNCTION) {
+      var scope$2 = this.currentScope();
+      if (this.treatFunctionsAsVar)
+        { redeclared = scope$2.lexical.indexOf(name) > -1; }
+      else
+        { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }
+      scope$2.functions.push(name);
+    } else {
+      for (var i = this.scopeStack.length - 1; i >= 0; --i) {
+        var scope$3 = this.scopeStack[i];
+        if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||
+            !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {
+          redeclared = true;
+          break
+        }
+        scope$3.var.push(name);
+        if (this.inModule && (scope$3.flags & SCOPE_TOP))
+          { delete this.undefinedExports[name]; }
+        if (scope$3.flags & SCOPE_VAR) { break }
+      }
+    }
+    if (redeclared) { this.raiseRecoverable(pos, ("Identifier '" + name + "' has already been declared")); }
+  };
+
+  pp$3.checkLocalExport = function(id) {
+    // scope.functions must be empty as Module code is always strict.
+    if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&
+        this.scopeStack[0].var.indexOf(id.name) === -1) {
+      this.undefinedExports[id.name] = id;
+    }
+  };
+
+  pp$3.currentScope = function() {
+    return this.scopeStack[this.scopeStack.length - 1]
+  };
+
+  pp$3.currentVarScope = function() {
+    for (var i = this.scopeStack.length - 1;; i--) {
+      var scope = this.scopeStack[i];
+      if (scope.flags & SCOPE_VAR) { return scope }
+    }
+  };
+
+  // Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.
+  pp$3.currentThisScope = function() {
+    for (var i = this.scopeStack.length - 1;; i--) {
+      var scope = this.scopeStack[i];
+      if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) { return scope }
+    }
+  };
+
+  var Node = function Node(parser, pos, loc) {
+    this.type = "";
+    this.start = pos;
+    this.end = 0;
+    if (parser.options.locations)
+      { this.loc = new SourceLocation(parser, loc); }
+    if (parser.options.directSourceFile)
+      { this.sourceFile = parser.options.directSourceFile; }
+    if (parser.options.ranges)
+      { this.range = [pos, 0]; }
+  };
+
+  // Start an AST node, attaching a start offset.
+
+  var pp$2 = Parser.prototype;
+
+  pp$2.startNode = function() {
+    return new Node(this, this.start, this.startLoc)
+  };
+
+  pp$2.startNodeAt = function(pos, loc) {
+    return new Node(this, pos, loc)
+  };
+
+  // Finish an AST node, adding `type` and `end` properties.
+
+  function finishNodeAt(node, type, pos, loc) {
+    node.type = type;
+    node.end = pos;
+    if (this.options.locations)
+      { node.loc.end = loc; }
+    if (this.options.ranges)
+      { node.range[1] = pos; }
+    return node
+  }
+
+  pp$2.finishNode = function(node, type) {
+    return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)
+  };
+
+  // Finish node at given position
+
+  pp$2.finishNodeAt = function(node, type, pos, loc) {
+    return finishNodeAt.call(this, node, type, pos, loc)
+  };
+
+  pp$2.copyNode = function(node) {
+    var newNode = new Node(this, node.start, this.startLoc);
+    for (var prop in node) { newNode[prop] = node[prop]; }
+    return newNode
+  };
+
+  // This file contains Unicode properties extracted from the ECMAScript
+  // specification. The lists are extracted like so:
+  // $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)
+
+  // #table-binary-unicode-properties
+  var ecma9BinaryProperties = "ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS";
+  var ecma10BinaryProperties = ecma9BinaryProperties + " Extended_Pictographic";
+  var ecma11BinaryProperties = ecma10BinaryProperties;
+  var ecma12BinaryProperties = ecma11BinaryProperties + " EBase EComp EMod EPres ExtPict";
+  var ecma13BinaryProperties = ecma12BinaryProperties;
+  var unicodeBinaryProperties = {
+    9: ecma9BinaryProperties,
+    10: ecma10BinaryProperties,
+    11: ecma11BinaryProperties,
+    12: ecma12BinaryProperties,
+    13: ecma13BinaryProperties
+  };
+
+  // #table-unicode-general-category-values
+  var unicodeGeneralCategoryValues = "Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu";
+
+  // #table-unicode-script-values
+  var ecma9ScriptValues = "Adlam Adlm Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb";
+  var ecma10ScriptValues = ecma9ScriptValues + " Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd";
+  var ecma11ScriptValues = ecma10ScriptValues + " Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho";
+  var ecma12ScriptValues = ecma11ScriptValues + " Chorasmian Chrs Diak Dives_Akuru Khitan_Small_Script Kits Yezi Yezidi";
+  var ecma13ScriptValues = ecma12ScriptValues + " Cypro_Minoan Cpmn Old_Uyghur Ougr Tangsa Tnsa Toto Vithkuqi Vith";
+  var unicodeScriptValues = {
+    9: ecma9ScriptValues,
+    10: ecma10ScriptValues,
+    11: ecma11ScriptValues,
+    12: ecma12ScriptValues,
+    13: ecma13ScriptValues
+  };
+
+  var data = {};
+  function buildUnicodeData(ecmaVersion) {
+    var d = data[ecmaVersion] = {
+      binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + " " + unicodeGeneralCategoryValues),
+      nonBinary: {
+        General_Category: wordsRegexp(unicodeGeneralCategoryValues),
+        Script: wordsRegexp(unicodeScriptValues[ecmaVersion])
+      }
+    };
+    d.nonBinary.Script_Extensions = d.nonBinary.Script;
+
+    d.nonBinary.gc = d.nonBinary.General_Category;
+    d.nonBinary.sc = d.nonBinary.Script;
+    d.nonBinary.scx = d.nonBinary.Script_Extensions;
+  }
+
+  for (var i = 0, list = [9, 10, 11, 12, 13]; i < list.length; i += 1) {
+    var ecmaVersion = list[i];
+
+    buildUnicodeData(ecmaVersion);
+  }
+
+  var pp$1 = Parser.prototype;
+
+  var RegExpValidationState = function RegExpValidationState(parser) {
+    this.parser = parser;
+    this.validFlags = "gim" + (parser.options.ecmaVersion >= 6 ? "uy" : "") + (parser.options.ecmaVersion >= 9 ? "s" : "") + (parser.options.ecmaVersion >= 13 ? "d" : "");
+    this.unicodeProperties = data[parser.options.ecmaVersion >= 13 ? 13 : parser.options.ecmaVersion];
+    this.source = "";
+    this.flags = "";
+    this.start = 0;
+    this.switchU = false;
+    this.switchN = false;
+    this.pos = 0;
+    this.lastIntValue = 0;
+    this.lastStringValue = "";
+    this.lastAssertionIsQuantifiable = false;
+    this.numCapturingParens = 0;
+    this.maxBackReference = 0;
+    this.groupNames = [];
+    this.backReferenceNames = [];
+  };
+
+  RegExpValidationState.prototype.reset = function reset (start, pattern, flags) {
+    var unicode = flags.indexOf("u") !== -1;
+    this.start = start | 0;
+    this.source = pattern + "";
+    this.flags = flags;
+    this.switchU = unicode && this.parser.options.ecmaVersion >= 6;
+    this.switchN = unicode && this.parser.options.ecmaVersion >= 9;
+  };
+
+  RegExpValidationState.prototype.raise = function raise (message) {
+    this.parser.raiseRecoverable(this.start, ("Invalid regular expression: /" + (this.source) + "/: " + message));
+  };
+
+  // If u flag is given, this returns the code point at the index (it combines a surrogate pair).
+  // Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).
+  RegExpValidationState.prototype.at = function at (i, forceU) {
+      if ( forceU === void 0 ) forceU = false;
+
+    var s = this.source;
+    var l = s.length;
+    if (i >= l) {
+      return -1
+    }
+    var c = s.charCodeAt(i);
+    if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+      return c
+    }
+    var next = s.charCodeAt(i + 1);
+    return next >= 0xDC00 && next <= 0xDFFF ? (c << 10) + next - 0x35FDC00 : c
+  };
+
+  RegExpValidationState.prototype.nextIndex = function nextIndex (i, forceU) {
+      if ( forceU === void 0 ) forceU = false;
+
+    var s = this.source;
+    var l = s.length;
+    if (i >= l) {
+      return l
+    }
+    var c = s.charCodeAt(i), next;
+    if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l ||
+        (next = s.charCodeAt(i + 1)) < 0xDC00 || next > 0xDFFF) {
+      return i + 1
+    }
+    return i + 2
+  };
+
+  RegExpValidationState.prototype.current = function current (forceU) {
+      if ( forceU === void 0 ) forceU = false;
+
+    return this.at(this.pos, forceU)
+  };
+
+  RegExpValidationState.prototype.lookahead = function lookahead (forceU) {
+      if ( forceU === void 0 ) forceU = false;
+
+    return this.at(this.nextIndex(this.pos, forceU), forceU)
+  };
+
+  RegExpValidationState.prototype.advance = function advance (forceU) {
+      if ( forceU === void 0 ) forceU = false;
+
+    this.pos = this.nextIndex(this.pos, forceU);
+  };
+
+  RegExpValidationState.prototype.eat = function eat (ch, forceU) {
+      if ( forceU === void 0 ) forceU = false;
+
+    if (this.current(forceU) === ch) {
+      this.advance(forceU);
+      return true
+    }
+    return false
+  };
+
+  function codePointToString$1(ch) {
+    if (ch <= 0xFFFF) { return String.fromCharCode(ch) }
+    ch -= 0x10000;
+    return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)
+  }
+
+  /**
+   * Validate the flags part of a given RegExpLiteral.
+   *
+   * @param {RegExpValidationState} state The state to validate RegExp.
+   * @returns {void}
+   */
+  pp$1.validateRegExpFlags = function(state) {
+    var validFlags = state.validFlags;
+    var flags = state.flags;
+
+    for (var i = 0; i < flags.length; i++) {
+      var flag = flags.charAt(i);
+      if (validFlags.indexOf(flag) === -1) {
+        this.raise(state.start, "Invalid regular expression flag");
+      }
+      if (flags.indexOf(flag, i + 1) > -1) {
+        this.raise(state.start, "Duplicate regular expression flag");
+      }
+    }
+  };
+
+  /**
+   * Validate the pattern part of a given RegExpLiteral.
+   *
+   * @param {RegExpValidationState} state The state to validate RegExp.
+   * @returns {void}
+   */
+  pp$1.validateRegExpPattern = function(state) {
+    this.regexp_pattern(state);
+
+    // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of
+    // parsing contains a |GroupName|, reparse with the goal symbol
+    // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*
+    // exception if _P_ did not conform to the grammar, if any elements of _P_
+    // were not matched by the parse, or if any Early Error conditions exist.
+    if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {
+      state.switchN = true;
+      this.regexp_pattern(state);
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern
+  pp$1.regexp_pattern = function(state) {
+    state.pos = 0;
+    state.lastIntValue = 0;
+    state.lastStringValue = "";
+    state.lastAssertionIsQuantifiable = false;
+    state.numCapturingParens = 0;
+    state.maxBackReference = 0;
+    state.groupNames.length = 0;
+    state.backReferenceNames.length = 0;
+
+    this.regexp_disjunction(state);
+
+    if (state.pos !== state.source.length) {
+      // Make the same messages as V8.
+      if (state.eat(0x29 /* ) */)) {
+        state.raise("Unmatched ')'");
+      }
+      if (state.eat(0x5D /* ] */) || state.eat(0x7D /* } */)) {
+        state.raise("Lone quantifier brackets");
+      }
+    }
+    if (state.maxBackReference > state.numCapturingParens) {
+      state.raise("Invalid escape");
+    }
+    for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {
+      var name = list[i];
+
+      if (state.groupNames.indexOf(name) === -1) {
+        state.raise("Invalid named capture referenced");
+      }
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction
+  pp$1.regexp_disjunction = function(state) {
+    this.regexp_alternative(state);
+    while (state.eat(0x7C /* | */)) {
+      this.regexp_alternative(state);
+    }
+
+    // Make the same message as V8.
+    if (this.regexp_eatQuantifier(state, true)) {
+      state.raise("Nothing to repeat");
+    }
+    if (state.eat(0x7B /* { */)) {
+      state.raise("Lone quantifier brackets");
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative
+  pp$1.regexp_alternative = function(state) {
+    while (state.pos < state.source.length && this.regexp_eatTerm(state))
+      { }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term
+  pp$1.regexp_eatTerm = function(state) {
+    if (this.regexp_eatAssertion(state)) {
+      // Handle `QuantifiableAssertion Quantifier` alternative.
+      // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion
+      // is a QuantifiableAssertion.
+      if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {
+        // Make the same message as V8.
+        if (state.switchU) {
+          state.raise("Invalid quantifier");
+        }
+      }
+      return true
+    }
+
+    if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {
+      this.regexp_eatQuantifier(state);
+      return true
+    }
+
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion
+  pp$1.regexp_eatAssertion = function(state) {
+    var start = state.pos;
+    state.lastAssertionIsQuantifiable = false;
+
+    // ^, $
+    if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {
+      return true
+    }
+
+    // \b \B
+    if (state.eat(0x5C /* \ */)) {
+      if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {
+        return true
+      }
+      state.pos = start;
+    }
+
+    // Lookahead / Lookbehind
+    if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {
+      var lookbehind = false;
+      if (this.options.ecmaVersion >= 9) {
+        lookbehind = state.eat(0x3C /* < */);
+      }
+      if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {
+        this.regexp_disjunction(state);
+        if (!state.eat(0x29 /* ) */)) {
+          state.raise("Unterminated group");
+        }
+        state.lastAssertionIsQuantifiable = !lookbehind;
+        return true
+      }
+    }
+
+    state.pos = start;
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier
+  pp$1.regexp_eatQuantifier = function(state, noError) {
+    if ( noError === void 0 ) noError = false;
+
+    if (this.regexp_eatQuantifierPrefix(state, noError)) {
+      state.eat(0x3F /* ? */);
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix
+  pp$1.regexp_eatQuantifierPrefix = function(state, noError) {
+    return (
+      state.eat(0x2A /* * */) ||
+      state.eat(0x2B /* + */) ||
+      state.eat(0x3F /* ? */) ||
+      this.regexp_eatBracedQuantifier(state, noError)
+    )
+  };
+  pp$1.regexp_eatBracedQuantifier = function(state, noError) {
+    var start = state.pos;
+    if (state.eat(0x7B /* { */)) {
+      var min = 0, max = -1;
+      if (this.regexp_eatDecimalDigits(state)) {
+        min = state.lastIntValue;
+        if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {
+          max = state.lastIntValue;
+        }
+        if (state.eat(0x7D /* } */)) {
+          // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term
+          if (max !== -1 && max < min && !noError) {
+            state.raise("numbers out of order in {} quantifier");
+          }
+          return true
+        }
+      }
+      if (state.switchU && !noError) {
+        state.raise("Incomplete quantifier");
+      }
+      state.pos = start;
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Atom
+  pp$1.regexp_eatAtom = function(state) {
+    return (
+      this.regexp_eatPatternCharacters(state) ||
+      state.eat(0x2E /* . */) ||
+      this.regexp_eatReverseSolidusAtomEscape(state) ||
+      this.regexp_eatCharacterClass(state) ||
+      this.regexp_eatUncapturingGroup(state) ||
+      this.regexp_eatCapturingGroup(state)
+    )
+  };
+  pp$1.regexp_eatReverseSolidusAtomEscape = function(state) {
+    var start = state.pos;
+    if (state.eat(0x5C /* \ */)) {
+      if (this.regexp_eatAtomEscape(state)) {
+        return true
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$1.regexp_eatUncapturingGroup = function(state) {
+    var start = state.pos;
+    if (state.eat(0x28 /* ( */)) {
+      if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {
+        this.regexp_disjunction(state);
+        if (state.eat(0x29 /* ) */)) {
+          return true
+        }
+        state.raise("Unterminated group");
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$1.regexp_eatCapturingGroup = function(state) {
+    if (state.eat(0x28 /* ( */)) {
+      if (this.options.ecmaVersion >= 9) {
+        this.regexp_groupSpecifier(state);
+      } else if (state.current() === 0x3F /* ? */) {
+        state.raise("Invalid group");
+      }
+      this.regexp_disjunction(state);
+      if (state.eat(0x29 /* ) */)) {
+        state.numCapturingParens += 1;
+        return true
+      }
+      state.raise("Unterminated group");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom
+  pp$1.regexp_eatExtendedAtom = function(state) {
+    return (
+      state.eat(0x2E /* . */) ||
+      this.regexp_eatReverseSolidusAtomEscape(state) ||
+      this.regexp_eatCharacterClass(state) ||
+      this.regexp_eatUncapturingGroup(state) ||
+      this.regexp_eatCapturingGroup(state) ||
+      this.regexp_eatInvalidBracedQuantifier(state) ||
+      this.regexp_eatExtendedPatternCharacter(state)
+    )
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier
+  pp$1.regexp_eatInvalidBracedQuantifier = function(state) {
+    if (this.regexp_eatBracedQuantifier(state, true)) {
+      state.raise("Nothing to repeat");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter
+  pp$1.regexp_eatSyntaxCharacter = function(state) {
+    var ch = state.current();
+    if (isSyntaxCharacter(ch)) {
+      state.lastIntValue = ch;
+      state.advance();
+      return true
+    }
+    return false
+  };
+  function isSyntaxCharacter(ch) {
+    return (
+      ch === 0x24 /* $ */ ||
+      ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||
+      ch === 0x2E /* . */ ||
+      ch === 0x3F /* ? */ ||
+      ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||
+      ch >= 0x7B /* { */ && ch <= 0x7D /* } */
+    )
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter
+  // But eat eager.
+  pp$1.regexp_eatPatternCharacters = function(state) {
+    var start = state.pos;
+    var ch = 0;
+    while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {
+      state.advance();
+    }
+    return state.pos !== start
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter
+  pp$1.regexp_eatExtendedPatternCharacter = function(state) {
+    var ch = state.current();
+    if (
+      ch !== -1 &&
+      ch !== 0x24 /* $ */ &&
+      !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&
+      ch !== 0x2E /* . */ &&
+      ch !== 0x3F /* ? */ &&
+      ch !== 0x5B /* [ */ &&
+      ch !== 0x5E /* ^ */ &&
+      ch !== 0x7C /* | */
+    ) {
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // GroupSpecifier ::
+  //   [empty]
+  //   `?` GroupName
+  pp$1.regexp_groupSpecifier = function(state) {
+    if (state.eat(0x3F /* ? */)) {
+      if (this.regexp_eatGroupName(state)) {
+        if (state.groupNames.indexOf(state.lastStringValue) !== -1) {
+          state.raise("Duplicate capture group name");
+        }
+        state.groupNames.push(state.lastStringValue);
+        return
+      }
+      state.raise("Invalid group");
+    }
+  };
+
+  // GroupName ::
+  //   `<` RegExpIdentifierName `>`
+  // Note: this updates `state.lastStringValue` property with the eaten name.
+  pp$1.regexp_eatGroupName = function(state) {
+    state.lastStringValue = "";
+    if (state.eat(0x3C /* < */)) {
+      if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {
+        return true
+      }
+      state.raise("Invalid capture group name");
+    }
+    return false
+  };
+
+  // RegExpIdentifierName ::
+  //   RegExpIdentifierStart
+  //   RegExpIdentifierName RegExpIdentifierPart
+  // Note: this updates `state.lastStringValue` property with the eaten name.
+  pp$1.regexp_eatRegExpIdentifierName = function(state) {
+    state.lastStringValue = "";
+    if (this.regexp_eatRegExpIdentifierStart(state)) {
+      state.lastStringValue += codePointToString$1(state.lastIntValue);
+      while (this.regexp_eatRegExpIdentifierPart(state)) {
+        state.lastStringValue += codePointToString$1(state.lastIntValue);
+      }
+      return true
+    }
+    return false
+  };
+
+  // RegExpIdentifierStart ::
+  //   UnicodeIDStart
+  //   `$`
+  //   `_`
+  //   `\` RegExpUnicodeEscapeSequence[+U]
+  pp$1.regexp_eatRegExpIdentifierStart = function(state) {
+    var start = state.pos;
+    var forceU = this.options.ecmaVersion >= 11;
+    var ch = state.current(forceU);
+    state.advance(forceU);
+
+    if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {
+      ch = state.lastIntValue;
+    }
+    if (isRegExpIdentifierStart(ch)) {
+      state.lastIntValue = ch;
+      return true
+    }
+
+    state.pos = start;
+    return false
+  };
+  function isRegExpIdentifierStart(ch) {
+    return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */
+  }
+
+  // RegExpIdentifierPart ::
+  //   UnicodeIDContinue
+  //   `$`
+  //   `_`
+  //   `\` RegExpUnicodeEscapeSequence[+U]
+  //   <ZWNJ>
+  //   <ZWJ>
+  pp$1.regexp_eatRegExpIdentifierPart = function(state) {
+    var start = state.pos;
+    var forceU = this.options.ecmaVersion >= 11;
+    var ch = state.current(forceU);
+    state.advance(forceU);
+
+    if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {
+      ch = state.lastIntValue;
+    }
+    if (isRegExpIdentifierPart(ch)) {
+      state.lastIntValue = ch;
+      return true
+    }
+
+    state.pos = start;
+    return false
+  };
+  function isRegExpIdentifierPart(ch) {
+    return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape
+  pp$1.regexp_eatAtomEscape = function(state) {
+    if (
+      this.regexp_eatBackReference(state) ||
+      this.regexp_eatCharacterClassEscape(state) ||
+      this.regexp_eatCharacterEscape(state) ||
+      (state.switchN && this.regexp_eatKGroupName(state))
+    ) {
+      return true
+    }
+    if (state.switchU) {
+      // Make the same message as V8.
+      if (state.current() === 0x63 /* c */) {
+        state.raise("Invalid unicode escape");
+      }
+      state.raise("Invalid escape");
+    }
+    return false
+  };
+  pp$1.regexp_eatBackReference = function(state) {
+    var start = state.pos;
+    if (this.regexp_eatDecimalEscape(state)) {
+      var n = state.lastIntValue;
+      if (state.switchU) {
+        // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape
+        if (n > state.maxBackReference) {
+          state.maxBackReference = n;
+        }
+        return true
+      }
+      if (n <= state.numCapturingParens) {
+        return true
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$1.regexp_eatKGroupName = function(state) {
+    if (state.eat(0x6B /* k */)) {
+      if (this.regexp_eatGroupName(state)) {
+        state.backReferenceNames.push(state.lastStringValue);
+        return true
+      }
+      state.raise("Invalid named reference");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape
+  pp$1.regexp_eatCharacterEscape = function(state) {
+    return (
+      this.regexp_eatControlEscape(state) ||
+      this.regexp_eatCControlLetter(state) ||
+      this.regexp_eatZero(state) ||
+      this.regexp_eatHexEscapeSequence(state) ||
+      this.regexp_eatRegExpUnicodeEscapeSequence(state, false) ||
+      (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||
+      this.regexp_eatIdentityEscape(state)
+    )
+  };
+  pp$1.regexp_eatCControlLetter = function(state) {
+    var start = state.pos;
+    if (state.eat(0x63 /* c */)) {
+      if (this.regexp_eatControlLetter(state)) {
+        return true
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$1.regexp_eatZero = function(state) {
+    if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {
+      state.lastIntValue = 0;
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape
+  pp$1.regexp_eatControlEscape = function(state) {
+    var ch = state.current();
+    if (ch === 0x74 /* t */) {
+      state.lastIntValue = 0x09; /* \t */
+      state.advance();
+      return true
+    }
+    if (ch === 0x6E /* n */) {
+      state.lastIntValue = 0x0A; /* \n */
+      state.advance();
+      return true
+    }
+    if (ch === 0x76 /* v */) {
+      state.lastIntValue = 0x0B; /* \v */
+      state.advance();
+      return true
+    }
+    if (ch === 0x66 /* f */) {
+      state.lastIntValue = 0x0C; /* \f */
+      state.advance();
+      return true
+    }
+    if (ch === 0x72 /* r */) {
+      state.lastIntValue = 0x0D; /* \r */
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter
+  pp$1.regexp_eatControlLetter = function(state) {
+    var ch = state.current();
+    if (isControlLetter(ch)) {
+      state.lastIntValue = ch % 0x20;
+      state.advance();
+      return true
+    }
+    return false
+  };
+  function isControlLetter(ch) {
+    return (
+      (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||
+      (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)
+    )
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence
+  pp$1.regexp_eatRegExpUnicodeEscapeSequence = function(state, forceU) {
+    if ( forceU === void 0 ) forceU = false;
+
+    var start = state.pos;
+    var switchU = forceU || state.switchU;
+
+    if (state.eat(0x75 /* u */)) {
+      if (this.regexp_eatFixedHexDigits(state, 4)) {
+        var lead = state.lastIntValue;
+        if (switchU && lead >= 0xD800 && lead <= 0xDBFF) {
+          var leadSurrogateEnd = state.pos;
+          if (state.eat(0x5C /* \ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {
+            var trail = state.lastIntValue;
+            if (trail >= 0xDC00 && trail <= 0xDFFF) {
+              state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;
+              return true
+            }
+          }
+          state.pos = leadSurrogateEnd;
+          state.lastIntValue = lead;
+        }
+        return true
+      }
+      if (
+        switchU &&
+        state.eat(0x7B /* { */) &&
+        this.regexp_eatHexDigits(state) &&
+        state.eat(0x7D /* } */) &&
+        isValidUnicode(state.lastIntValue)
+      ) {
+        return true
+      }
+      if (switchU) {
+        state.raise("Invalid unicode escape");
+      }
+      state.pos = start;
+    }
+
+    return false
+  };
+  function isValidUnicode(ch) {
+    return ch >= 0 && ch <= 0x10FFFF
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape
+  pp$1.regexp_eatIdentityEscape = function(state) {
+    if (state.switchU) {
+      if (this.regexp_eatSyntaxCharacter(state)) {
+        return true
+      }
+      if (state.eat(0x2F /* / */)) {
+        state.lastIntValue = 0x2F; /* / */
+        return true
+      }
+      return false
+    }
+
+    var ch = state.current();
+    if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {
+      state.lastIntValue = ch;
+      state.advance();
+      return true
+    }
+
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape
+  pp$1.regexp_eatDecimalEscape = function(state) {
+    state.lastIntValue = 0;
+    var ch = state.current();
+    if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {
+      do {
+        state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+        state.advance();
+      } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape
+  pp$1.regexp_eatCharacterClassEscape = function(state) {
+    var ch = state.current();
+
+    if (isCharacterClassEscape(ch)) {
+      state.lastIntValue = -1;
+      state.advance();
+      return true
+    }
+
+    if (
+      state.switchU &&
+      this.options.ecmaVersion >= 9 &&
+      (ch === 0x50 /* P */ || ch === 0x70 /* p */)
+    ) {
+      state.lastIntValue = -1;
+      state.advance();
+      if (
+        state.eat(0x7B /* { */) &&
+        this.regexp_eatUnicodePropertyValueExpression(state) &&
+        state.eat(0x7D /* } */)
+      ) {
+        return true
+      }
+      state.raise("Invalid property name");
+    }
+
+    return false
+  };
+  function isCharacterClassEscape(ch) {
+    return (
+      ch === 0x64 /* d */ ||
+      ch === 0x44 /* D */ ||
+      ch === 0x73 /* s */ ||
+      ch === 0x53 /* S */ ||
+      ch === 0x77 /* w */ ||
+      ch === 0x57 /* W */
+    )
+  }
+
+  // UnicodePropertyValueExpression ::
+  //   UnicodePropertyName `=` UnicodePropertyValue
+  //   LoneUnicodePropertyNameOrValue
+  pp$1.regexp_eatUnicodePropertyValueExpression = function(state) {
+    var start = state.pos;
+
+    // UnicodePropertyName `=` UnicodePropertyValue
+    if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {
+      var name = state.lastStringValue;
+      if (this.regexp_eatUnicodePropertyValue(state)) {
+        var value = state.lastStringValue;
+        this.regexp_validateUnicodePropertyNameAndValue(state, name, value);
+        return true
+      }
+    }
+    state.pos = start;
+
+    // LoneUnicodePropertyNameOrValue
+    if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {
+      var nameOrValue = state.lastStringValue;
+      this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);
+      return true
+    }
+    return false
+  };
+  pp$1.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {
+    if (!hasOwn(state.unicodeProperties.nonBinary, name))
+      { state.raise("Invalid property name"); }
+    if (!state.unicodeProperties.nonBinary[name].test(value))
+      { state.raise("Invalid property value"); }
+  };
+  pp$1.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {
+    if (!state.unicodeProperties.binary.test(nameOrValue))
+      { state.raise("Invalid property name"); }
+  };
+
+  // UnicodePropertyName ::
+  //   UnicodePropertyNameCharacters
+  pp$1.regexp_eatUnicodePropertyName = function(state) {
+    var ch = 0;
+    state.lastStringValue = "";
+    while (isUnicodePropertyNameCharacter(ch = state.current())) {
+      state.lastStringValue += codePointToString$1(ch);
+      state.advance();
+    }
+    return state.lastStringValue !== ""
+  };
+  function isUnicodePropertyNameCharacter(ch) {
+    return isControlLetter(ch) || ch === 0x5F /* _ */
+  }
+
+  // UnicodePropertyValue ::
+  //   UnicodePropertyValueCharacters
+  pp$1.regexp_eatUnicodePropertyValue = function(state) {
+    var ch = 0;
+    state.lastStringValue = "";
+    while (isUnicodePropertyValueCharacter(ch = state.current())) {
+      state.lastStringValue += codePointToString$1(ch);
+      state.advance();
+    }
+    return state.lastStringValue !== ""
+  };
+  function isUnicodePropertyValueCharacter(ch) {
+    return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)
+  }
+
+  // LoneUnicodePropertyNameOrValue ::
+  //   UnicodePropertyValueCharacters
+  pp$1.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {
+    return this.regexp_eatUnicodePropertyValue(state)
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass
+  pp$1.regexp_eatCharacterClass = function(state) {
+    if (state.eat(0x5B /* [ */)) {
+      state.eat(0x5E /* ^ */);
+      this.regexp_classRanges(state);
+      if (state.eat(0x5D /* ] */)) {
+        return true
+      }
+      // Unreachable since it threw "unterminated regular expression" error before.
+      state.raise("Unterminated character class");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash
+  pp$1.regexp_classRanges = function(state) {
+    while (this.regexp_eatClassAtom(state)) {
+      var left = state.lastIntValue;
+      if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {
+        var right = state.lastIntValue;
+        if (state.switchU && (left === -1 || right === -1)) {
+          state.raise("Invalid character class");
+        }
+        if (left !== -1 && right !== -1 && left > right) {
+          state.raise("Range out of order in character class");
+        }
+      }
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash
+  pp$1.regexp_eatClassAtom = function(state) {
+    var start = state.pos;
+
+    if (state.eat(0x5C /* \ */)) {
+      if (this.regexp_eatClassEscape(state)) {
+        return true
+      }
+      if (state.switchU) {
+        // Make the same message as V8.
+        var ch$1 = state.current();
+        if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {
+          state.raise("Invalid class escape");
+        }
+        state.raise("Invalid escape");
+      }
+      state.pos = start;
+    }
+
+    var ch = state.current();
+    if (ch !== 0x5D /* ] */) {
+      state.lastIntValue = ch;
+      state.advance();
+      return true
+    }
+
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape
+  pp$1.regexp_eatClassEscape = function(state) {
+    var start = state.pos;
+
+    if (state.eat(0x62 /* b */)) {
+      state.lastIntValue = 0x08; /* <BS> */
+      return true
+    }
+
+    if (state.switchU && state.eat(0x2D /* - */)) {
+      state.lastIntValue = 0x2D; /* - */
+      return true
+    }
+
+    if (!state.switchU && state.eat(0x63 /* c */)) {
+      if (this.regexp_eatClassControlLetter(state)) {
+        return true
+      }
+      state.pos = start;
+    }
+
+    return (
+      this.regexp_eatCharacterClassEscape(state) ||
+      this.regexp_eatCharacterEscape(state)
+    )
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter
+  pp$1.regexp_eatClassControlLetter = function(state) {
+    var ch = state.current();
+    if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {
+      state.lastIntValue = ch % 0x20;
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+  pp$1.regexp_eatHexEscapeSequence = function(state) {
+    var start = state.pos;
+    if (state.eat(0x78 /* x */)) {
+      if (this.regexp_eatFixedHexDigits(state, 2)) {
+        return true
+      }
+      if (state.switchU) {
+        state.raise("Invalid escape");
+      }
+      state.pos = start;
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits
+  pp$1.regexp_eatDecimalDigits = function(state) {
+    var start = state.pos;
+    var ch = 0;
+    state.lastIntValue = 0;
+    while (isDecimalDigit(ch = state.current())) {
+      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+      state.advance();
+    }
+    return state.pos !== start
+  };
+  function isDecimalDigit(ch) {
+    return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits
+  pp$1.regexp_eatHexDigits = function(state) {
+    var start = state.pos;
+    var ch = 0;
+    state.lastIntValue = 0;
+    while (isHexDigit(ch = state.current())) {
+      state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+      state.advance();
+    }
+    return state.pos !== start
+  };
+  function isHexDigit(ch) {
+    return (
+      (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||
+      (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||
+      (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)
+    )
+  }
+  function hexToInt(ch) {
+    if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {
+      return 10 + (ch - 0x41 /* A */)
+    }
+    if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {
+      return 10 + (ch - 0x61 /* a */)
+    }
+    return ch - 0x30 /* 0 */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence
+  // Allows only 0-377(octal) i.e. 0-255(decimal).
+  pp$1.regexp_eatLegacyOctalEscapeSequence = function(state) {
+    if (this.regexp_eatOctalDigit(state)) {
+      var n1 = state.lastIntValue;
+      if (this.regexp_eatOctalDigit(state)) {
+        var n2 = state.lastIntValue;
+        if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {
+          state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;
+        } else {
+          state.lastIntValue = n1 * 8 + n2;
+        }
+      } else {
+        state.lastIntValue = n1;
+      }
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit
+  pp$1.regexp_eatOctalDigit = function(state) {
+    var ch = state.current();
+    if (isOctalDigit(ch)) {
+      state.lastIntValue = ch - 0x30; /* 0 */
+      state.advance();
+      return true
+    }
+    state.lastIntValue = 0;
+    return false
+  };
+  function isOctalDigit(ch) {
+    return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit
+  // And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+  pp$1.regexp_eatFixedHexDigits = function(state, length) {
+    var start = state.pos;
+    state.lastIntValue = 0;
+    for (var i = 0; i < length; ++i) {
+      var ch = state.current();
+      if (!isHexDigit(ch)) {
+        state.pos = start;
+        return false
+      }
+      state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+      state.advance();
+    }
+    return true
+  };
+
+  // Object type used to represent tokens. Note that normally, tokens
+  // simply exist as properties on the parser object. This is only
+  // used for the onToken callback and the external tokenizer.
+
+  var Token = function Token(p) {
+    this.type = p.type;
+    this.value = p.value;
+    this.start = p.start;
+    this.end = p.end;
+    if (p.options.locations)
+      { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }
+    if (p.options.ranges)
+      { this.range = [p.start, p.end]; }
+  };
+
+  // ## Tokenizer
+
+  var pp = Parser.prototype;
+
+  // Move to the next token
+
+  pp.next = function(ignoreEscapeSequenceInKeyword) {
+    if (!ignoreEscapeSequenceInKeyword && this.type.keyword && this.containsEsc)
+      { this.raiseRecoverable(this.start, "Escape sequence in keyword " + this.type.keyword); }
+    if (this.options.onToken)
+      { this.options.onToken(new Token(this)); }
+
+    this.lastTokEnd = this.end;
+    this.lastTokStart = this.start;
+    this.lastTokEndLoc = this.endLoc;
+    this.lastTokStartLoc = this.startLoc;
+    this.nextToken();
+  };
+
+  pp.getToken = function() {
+    this.next();
+    return new Token(this)
+  };
+
+  // If we're in an ES6 environment, make parsers iterable
+  if (typeof Symbol !== "undefined")
+    { pp[Symbol.iterator] = function() {
+      var this$1$1 = this;
+
+      return {
+        next: function () {
+          var token = this$1$1.getToken();
+          return {
+            done: token.type === types$1.eof,
+            value: token
+          }
+        }
+      }
+    }; }
+
+  // Toggle strict mode. Re-reads the next number or string to please
+  // pedantic tests (`"use strict"; 010;` should fail).
+
+  // Read a single token, updating the parser object's token-related
+  // properties.
+
+  pp.nextToken = function() {
+    var curContext = this.curContext();
+    if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }
+
+    this.start = this.pos;
+    if (this.options.locations) { this.startLoc = this.curPosition(); }
+    if (this.pos >= this.input.length) { return this.finishToken(types$1.eof) }
+
+    if (curContext.override) { return curContext.override(this) }
+    else { this.readToken(this.fullCharCodeAtPos()); }
+  };
+
+  pp.readToken = function(code) {
+    // Identifier or keyword. '\uXXXX' sequences are allowed in
+    // identifiers, so '\' also dispatches to that.
+    if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\' */)
+      { return this.readWord() }
+
+    return this.getTokenFromCode(code)
+  };
+
+  pp.fullCharCodeAtPos = function() {
+    var code = this.input.charCodeAt(this.pos);
+    if (code <= 0xd7ff || code >= 0xdc00) { return code }
+    var next = this.input.charCodeAt(this.pos + 1);
+    return next <= 0xdbff || next >= 0xe000 ? code : (code << 10) + next - 0x35fdc00
+  };
+
+  pp.skipBlockComment = function() {
+    var startLoc = this.options.onComment && this.curPosition();
+    var start = this.pos, end = this.input.indexOf("*/", this.pos += 2);
+    if (end === -1) { this.raise(this.pos - 2, "Unterminated comment"); }
+    this.pos = end + 2;
+    if (this.options.locations) {
+      for (var nextBreak = (void 0), pos = start; (nextBreak = nextLineBreak(this.input, pos, this.pos)) > -1;) {
+        ++this.curLine;
+        pos = this.lineStart = nextBreak;
+      }
+    }
+    if (this.options.onComment)
+      { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,
+                             startLoc, this.curPosition()); }
+  };
+
+  pp.skipLineComment = function(startSkip) {
+    var start = this.pos;
+    var startLoc = this.options.onComment && this.curPosition();
+    var ch = this.input.charCodeAt(this.pos += startSkip);
+    while (this.pos < this.input.length && !isNewLine(ch)) {
+      ch = this.input.charCodeAt(++this.pos);
+    }
+    if (this.options.onComment)
+      { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,
+                             startLoc, this.curPosition()); }
+  };
+
+  // Called at the start of the parse and after every token. Skips
+  // whitespace and comments, and.
+
+  pp.skipSpace = function() {
+    loop: while (this.pos < this.input.length) {
+      var ch = this.input.charCodeAt(this.pos);
+      switch (ch) {
+      case 32: case 160: // ' '
+        ++this.pos;
+        break
+      case 13:
+        if (this.input.charCodeAt(this.pos + 1) === 10) {
+          ++this.pos;
+        }
+      case 10: case 8232: case 8233:
+        ++this.pos;
+        if (this.options.locations) {
+          ++this.curLine;
+          this.lineStart = this.pos;
+        }
+        break
+      case 47: // '/'
+        switch (this.input.charCodeAt(this.pos + 1)) {
+        case 42: // '*'
+          this.skipBlockComment();
+          break
+        case 47:
+          this.skipLineComment(2);
+          break
+        default:
+          break loop
+        }
+        break
+      default:
+        if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {
+          ++this.pos;
+        } else {
+          break loop
+        }
+      }
+    }
+  };
+
+  // Called at the end of every token. Sets `end`, `val`, and
+  // maintains `context` and `exprAllowed`, and skips the space after
+  // the token, so that the next one's `start` will point at the
+  // right position.
+
+  pp.finishToken = function(type, val) {
+    this.end = this.pos;
+    if (this.options.locations) { this.endLoc = this.curPosition(); }
+    var prevType = this.type;
+    this.type = type;
+    this.value = val;
+
+    this.updateContext(prevType);
+  };
+
+  // ### Token reading
+
+  // This is the function that is called to fetch the next token. It
+  // is somewhat obscure, because it works in character codes rather
+  // than characters, and because operator parsing has been inlined
+  // into it.
+  //
+  // All in the name of speed.
+  //
+  pp.readToken_dot = function() {
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next >= 48 && next <= 57) { return this.readNumber(true) }
+    var next2 = this.input.charCodeAt(this.pos + 2);
+    if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'
+      this.pos += 3;
+      return this.finishToken(types$1.ellipsis)
+    } else {
+      ++this.pos;
+      return this.finishToken(types$1.dot)
+    }
+  };
+
+  pp.readToken_slash = function() { // '/'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (this.exprAllowed) { ++this.pos; return this.readRegexp() }
+    if (next === 61) { return this.finishOp(types$1.assign, 2) }
+    return this.finishOp(types$1.slash, 1)
+  };
+
+  pp.readToken_mult_modulo_exp = function(code) { // '%*'
+    var next = this.input.charCodeAt(this.pos + 1);
+    var size = 1;
+    var tokentype = code === 42 ? types$1.star : types$1.modulo;
+
+    // exponentiation operator ** and **=
+    if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {
+      ++size;
+      tokentype = types$1.starstar;
+      next = this.input.charCodeAt(this.pos + 2);
+    }
+
+    if (next === 61) { return this.finishOp(types$1.assign, size + 1) }
+    return this.finishOp(tokentype, size)
+  };
+
+  pp.readToken_pipe_amp = function(code) { // '|&'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === code) {
+      if (this.options.ecmaVersion >= 12) {
+        var next2 = this.input.charCodeAt(this.pos + 2);
+        if (next2 === 61) { return this.finishOp(types$1.assign, 3) }
+      }
+      return this.finishOp(code === 124 ? types$1.logicalOR : types$1.logicalAND, 2)
+    }
+    if (next === 61) { return this.finishOp(types$1.assign, 2) }
+    return this.finishOp(code === 124 ? types$1.bitwiseOR : types$1.bitwiseAND, 1)
+  };
+
+  pp.readToken_caret = function() { // '^'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === 61) { return this.finishOp(types$1.assign, 2) }
+    return this.finishOp(types$1.bitwiseXOR, 1)
+  };
+
+  pp.readToken_plus_min = function(code) { // '+-'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === code) {
+      if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&
+          (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {
+        // A `-->` line comment
+        this.skipLineComment(3);
+        this.skipSpace();
+        return this.nextToken()
+      }
+      return this.finishOp(types$1.incDec, 2)
+    }
+    if (next === 61) { return this.finishOp(types$1.assign, 2) }
+    return this.finishOp(types$1.plusMin, 1)
+  };
+
+  pp.readToken_lt_gt = function(code) { // '<>'
+    var next = this.input.charCodeAt(this.pos + 1);
+    var size = 1;
+    if (next === code) {
+      size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;
+      if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types$1.assign, size + 1) }
+      return this.finishOp(types$1.bitShift, size)
+    }
+    if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&
+        this.input.charCodeAt(this.pos + 3) === 45) {
+      // `<!--`, an XML-style comment that should be interpreted as a line comment
+      this.skipLineComment(4);
+      this.skipSpace();
+      return this.nextToken()
+    }
+    if (next === 61) { size = 2; }
+    return this.finishOp(types$1.relational, size)
+  };
+
+  pp.readToken_eq_excl = function(code) { // '=!'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === 61) { return this.finishOp(types$1.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }
+    if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'
+      this.pos += 2;
+      return this.finishToken(types$1.arrow)
+    }
+    return this.finishOp(code === 61 ? types$1.eq : types$1.prefix, 1)
+  };
+
+  pp.readToken_question = function() { // '?'
+    var ecmaVersion = this.options.ecmaVersion;
+    if (ecmaVersion >= 11) {
+      var next = this.input.charCodeAt(this.pos + 1);
+      if (next === 46) {
+        var next2 = this.input.charCodeAt(this.pos + 2);
+        if (next2 < 48 || next2 > 57) { return this.finishOp(types$1.questionDot, 2) }
+      }
+      if (next === 63) {
+        if (ecmaVersion >= 12) {
+          var next2$1 = this.input.charCodeAt(this.pos + 2);
+          if (next2$1 === 61) { return this.finishOp(types$1.assign, 3) }
+        }
+        return this.finishOp(types$1.coalesce, 2)
+      }
+    }
+    return this.finishOp(types$1.question, 1)
+  };
+
+  pp.readToken_numberSign = function() { // '#'
+    var ecmaVersion = this.options.ecmaVersion;
+    var code = 35; // '#'
+    if (ecmaVersion >= 13) {
+      ++this.pos;
+      code = this.fullCharCodeAtPos();
+      if (isIdentifierStart(code, true) || code === 92 /* '\' */) {
+        return this.finishToken(types$1.privateId, this.readWord1())
+      }
+    }
+
+    this.raise(this.pos, "Unexpected character '" + codePointToString(code) + "'");
+  };
+
+  pp.getTokenFromCode = function(code) {
+    switch (code) {
+    // The interpretation of a dot depends on whether it is followed
+    // by a digit or another two dots.
+    case 46: // '.'
+      return this.readToken_dot()
+
+    // Punctuation tokens.
+    case 40: ++this.pos; return this.finishToken(types$1.parenL)
+    case 41: ++this.pos; return this.finishToken(types$1.parenR)
+    case 59: ++this.pos; return this.finishToken(types$1.semi)
+    case 44: ++this.pos; return this.finishToken(types$1.comma)
+    case 91: ++this.pos; return this.finishToken(types$1.bracketL)
+    case 93: ++this.pos; return this.finishToken(types$1.bracketR)
+    case 123: ++this.pos; return this.finishToken(types$1.braceL)
+    case 125: ++this.pos; return this.finishToken(types$1.braceR)
+    case 58: ++this.pos; return this.finishToken(types$1.colon)
+
+    case 96: // '`'
+      if (this.options.ecmaVersion < 6) { break }
+      ++this.pos;
+      return this.finishToken(types$1.backQuote)
+
+    case 48: // '0'
+      var next = this.input.charCodeAt(this.pos + 1);
+      if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number
+      if (this.options.ecmaVersion >= 6) {
+        if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number
+        if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number
+      }
+
+    // Anything else beginning with a digit is an integer, octal
+    // number, or float.
+    case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9
+      return this.readNumber(false)
+
+    // Quotes produce strings.
+    case 34: case 39: // '"', "'"
+      return this.readString(code)
+
+    // Operators are parsed inline in tiny state machines. '=' (61) is
+    // often referred to. `finishOp` simply skips the amount of
+    // characters it is given as second argument, and returns a token
+    // of the type given by its first argument.
+    case 47: // '/'
+      return this.readToken_slash()
+
+    case 37: case 42: // '%*'
+      return this.readToken_mult_modulo_exp(code)
+
+    case 124: case 38: // '|&'
+      return this.readToken_pipe_amp(code)
+
+    case 94: // '^'
+      return this.readToken_caret()
+
+    case 43: case 45: // '+-'
+      return this.readToken_plus_min(code)
+
+    case 60: case 62: // '<>'
+      return this.readToken_lt_gt(code)
+
+    case 61: case 33: // '=!'
+      return this.readToken_eq_excl(code)
+
+    case 63: // '?'
+      return this.readToken_question()
+
+    case 126: // '~'
+      return this.finishOp(types$1.prefix, 1)
+
+    case 35: // '#'
+      return this.readToken_numberSign()
+    }
+
+    this.raise(this.pos, "Unexpected character '" + codePointToString(code) + "'");
+  };
+
+  pp.finishOp = function(type, size) {
+    var str = this.input.slice(this.pos, this.pos + size);
+    this.pos += size;
+    return this.finishToken(type, str)
+  };
+
+  pp.readRegexp = function() {
+    var escaped, inClass, start = this.pos;
+    for (;;) {
+      if (this.pos >= this.input.length) { this.raise(start, "Unterminated regular expression"); }
+      var ch = this.input.charAt(this.pos);
+      if (lineBreak.test(ch)) { this.raise(start, "Unterminated regular expression"); }
+      if (!escaped) {
+        if (ch === "[") { inClass = true; }
+        else if (ch === "]" && inClass) { inClass = false; }
+        else if (ch === "/" && !inClass) { break }
+        escaped = ch === "\\";
+      } else { escaped = false; }
+      ++this.pos;
+    }
+    var pattern = this.input.slice(start, this.pos);
+    ++this.pos;
+    var flagsStart = this.pos;
+    var flags = this.readWord1();
+    if (this.containsEsc) { this.unexpected(flagsStart); }
+
+    // Validate pattern
+    var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));
+    state.reset(start, pattern, flags);
+    this.validateRegExpFlags(state);
+    this.validateRegExpPattern(state);
+
+    // Create Literal#value property value.
+    var value = null;
+    try {
+      value = new RegExp(pattern, flags);
+    } catch (e) {
+      // ESTree requires null if it failed to instantiate RegExp object.
+      // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral
+    }
+
+    return this.finishToken(types$1.regexp, {pattern: pattern, flags: flags, value: value})
+  };
+
+  // Read an integer in the given radix. Return null if zero digits
+  // were read, the integer value otherwise. When `len` is given, this
+  // will return `null` unless the integer has exactly `len` digits.
+
+  pp.readInt = function(radix, len, maybeLegacyOctalNumericLiteral) {
+    // `len` is used for character escape sequences. In that case, disallow separators.
+    var allowSeparators = this.options.ecmaVersion >= 12 && len === undefined;
+
+    // `maybeLegacyOctalNumericLiteral` is true if it doesn't have prefix (0x,0o,0b)
+    // and isn't fraction part nor exponent part. In that case, if the first digit
+    // is zero then disallow separators.
+    var isLegacyOctalNumericLiteral = maybeLegacyOctalNumericLiteral && this.input.charCodeAt(this.pos) === 48;
+
+    var start = this.pos, total = 0, lastCode = 0;
+    for (var i = 0, e = len == null ? Infinity : len; i < e; ++i, ++this.pos) {
+      var code = this.input.charCodeAt(this.pos), val = (void 0);
+
+      if (allowSeparators && code === 95) {
+        if (isLegacyOctalNumericLiteral) { this.raiseRecoverable(this.pos, "Numeric separator is not allowed in legacy octal numeric literals"); }
+        if (lastCode === 95) { this.raiseRecoverable(this.pos, "Numeric separator must be exactly one underscore"); }
+        if (i === 0) { this.raiseRecoverable(this.pos, "Numeric separator is not allowed at the first of digits"); }
+        lastCode = code;
+        continue
+      }
+
+      if (code >= 97) { val = code - 97 + 10; } // a
+      else if (code >= 65) { val = code - 65 + 10; } // A
+      else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9
+      else { val = Infinity; }
+      if (val >= radix) { break }
+      lastCode = code;
+      total = total * radix + val;
+    }
+
+    if (allowSeparators && lastCode === 95) { this.raiseRecoverable(this.pos - 1, "Numeric separator is not allowed at the last of digits"); }
+    if (this.pos === start || len != null && this.pos - start !== len) { return null }
+
+    return total
+  };
+
+  function stringToNumber(str, isLegacyOctalNumericLiteral) {
+    if (isLegacyOctalNumericLiteral) {
+      return parseInt(str, 8)
+    }
+
+    // `parseFloat(value)` stops parsing at the first numeric separator then returns a wrong value.
+    return parseFloat(str.replace(/_/g, ""))
+  }
+
+  function stringToBigInt(str) {
+    if (typeof BigInt !== "function") {
+      return null
+    }
+
+    // `BigInt(value)` throws syntax error if the string contains numeric separators.
+    return BigInt(str.replace(/_/g, ""))
+  }
+
+  pp.readRadixNumber = function(radix) {
+    var start = this.pos;
+    this.pos += 2; // 0x
+    var val = this.readInt(radix);
+    if (val == null) { this.raise(this.start + 2, "Expected number in radix " + radix); }
+    if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {
+      val = stringToBigInt(this.input.slice(start, this.pos));
+      ++this.pos;
+    } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+    return this.finishToken(types$1.num, val)
+  };
+
+  // Read an integer, octal integer, or floating-point number.
+
+  pp.readNumber = function(startsWithDot) {
+    var start = this.pos;
+    if (!startsWithDot && this.readInt(10, undefined, true) === null) { this.raise(start, "Invalid number"); }
+    var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;
+    if (octal && this.strict) { this.raise(start, "Invalid number"); }
+    var next = this.input.charCodeAt(this.pos);
+    if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {
+      var val$1 = stringToBigInt(this.input.slice(start, this.pos));
+      ++this.pos;
+      if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+      return this.finishToken(types$1.num, val$1)
+    }
+    if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }
+    if (next === 46 && !octal) { // '.'
+      ++this.pos;
+      this.readInt(10);
+      next = this.input.charCodeAt(this.pos);
+    }
+    if ((next === 69 || next === 101) && !octal) { // 'eE'
+      next = this.input.charCodeAt(++this.pos);
+      if (next === 43 || next === 45) { ++this.pos; } // '+-'
+      if (this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+    }
+    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+
+    var val = stringToNumber(this.input.slice(start, this.pos), octal);
+    return this.finishToken(types$1.num, val)
+  };
+
+  // Read a string value, interpreting backslash-escapes.
+
+  pp.readCodePoint = function() {
+    var ch = this.input.charCodeAt(this.pos), code;
+
+    if (ch === 123) { // '{'
+      if (this.options.ecmaVersion < 6) { this.unexpected(); }
+      var codePos = ++this.pos;
+      code = this.readHexChar(this.input.indexOf("}", this.pos) - this.pos);
+      ++this.pos;
+      if (code > 0x10FFFF) { this.invalidStringToken(codePos, "Code point out of bounds"); }
+    } else {
+      code = this.readHexChar(4);
+    }
+    return code
+  };
+
+  function codePointToString(code) {
+    // UTF-16 Decoding
+    if (code <= 0xFFFF) { return String.fromCharCode(code) }
+    code -= 0x10000;
+    return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)
+  }
+
+  pp.readString = function(quote) {
+    var out = "", chunkStart = ++this.pos;
+    for (;;) {
+      if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated string constant"); }
+      var ch = this.input.charCodeAt(this.pos);
+      if (ch === quote) { break }
+      if (ch === 92) { // '\'
+        out += this.input.slice(chunkStart, this.pos);
+        out += this.readEscapedChar(false);
+        chunkStart = this.pos;
+      } else if (ch === 0x2028 || ch === 0x2029) {
+        if (this.options.ecmaVersion < 10) { this.raise(this.start, "Unterminated string constant"); }
+        ++this.pos;
+        if (this.options.locations) {
+          this.curLine++;
+          this.lineStart = this.pos;
+        }
+      } else {
+        if (isNewLine(ch)) { this.raise(this.start, "Unterminated string constant"); }
+        ++this.pos;
+      }
+    }
+    out += this.input.slice(chunkStart, this.pos++);
+    return this.finishToken(types$1.string, out)
+  };
+
+  // Reads template string tokens.
+
+  var INVALID_TEMPLATE_ESCAPE_ERROR = {};
+
+  pp.tryReadTemplateToken = function() {
+    this.inTemplateElement = true;
+    try {
+      this.readTmplToken();
+    } catch (err) {
+      if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {
+        this.readInvalidTemplateToken();
+      } else {
+        throw err
+      }
+    }
+
+    this.inTemplateElement = false;
+  };
+
+  pp.invalidStringToken = function(position, message) {
+    if (this.inTemplateElement && this.options.ecmaVersion >= 9) {
+      throw INVALID_TEMPLATE_ESCAPE_ERROR
+    } else {
+      this.raise(position, message);
+    }
+  };
+
+  pp.readTmplToken = function() {
+    var out = "", chunkStart = this.pos;
+    for (;;) {
+      if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated template"); }
+      var ch = this.input.charCodeAt(this.pos);
+      if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'
+        if (this.pos === this.start && (this.type === types$1.template || this.type === types$1.invalidTemplate)) {
+          if (ch === 36) {
+            this.pos += 2;
+            return this.finishToken(types$1.dollarBraceL)
+          } else {
+            ++this.pos;
+            return this.finishToken(types$1.backQuote)
+          }
+        }
+        out += this.input.slice(chunkStart, this.pos);
+        return this.finishToken(types$1.template, out)
+      }
+      if (ch === 92) { // '\'
+        out += this.input.slice(chunkStart, this.pos);
+        out += this.readEscapedChar(true);
+        chunkStart = this.pos;
+      } else if (isNewLine(ch)) {
+        out += this.input.slice(chunkStart, this.pos);
+        ++this.pos;
+        switch (ch) {
+        case 13:
+          if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }
+        case 10:
+          out += "\n";
+          break
+        default:
+          out += String.fromCharCode(ch);
+          break
+        }
+        if (this.options.locations) {
+          ++this.curLine;
+          this.lineStart = this.pos;
+        }
+        chunkStart = this.pos;
+      } else {
+        ++this.pos;
+      }
+    }
+  };
+
+  // Reads a template token to search for the end, without validating any escape sequences
+  pp.readInvalidTemplateToken = function() {
+    for (; this.pos < this.input.length; this.pos++) {
+      switch (this.input[this.pos]) {
+      case "\\":
+        ++this.pos;
+        break
+
+      case "$":
+        if (this.input[this.pos + 1] !== "{") {
+          break
+        }
+
+      // falls through
+      case "`":
+        return this.finishToken(types$1.invalidTemplate, this.input.slice(this.start, this.pos))
+
+      // no default
+      }
+    }
+    this.raise(this.start, "Unterminated template");
+  };
+
+  // Used to read escaped characters
+
+  pp.readEscapedChar = function(inTemplate) {
+    var ch = this.input.charCodeAt(++this.pos);
+    ++this.pos;
+    switch (ch) {
+    case 110: return "\n" // 'n' -> '\n'
+    case 114: return "\r" // 'r' -> '\r'
+    case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'
+    case 117: return codePointToString(this.readCodePoint()) // 'u'
+    case 116: return "\t" // 't' -> '\t'
+    case 98: return "\b" // 'b' -> '\b'
+    case 118: return "\u000b" // 'v' -> '\u000b'
+    case 102: return "\f" // 'f' -> '\f'
+    case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\r\n'
+    case 10: // ' \n'
+      if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }
+      return ""
+    case 56:
+    case 57:
+      if (this.strict) {
+        this.invalidStringToken(
+          this.pos - 1,
+          "Invalid escape sequence"
+        );
+      }
+      if (inTemplate) {
+        var codePos = this.pos - 1;
+
+        this.invalidStringToken(
+          codePos,
+          "Invalid escape sequence in template string"
+        );
+
+        return null
+      }
+    default:
+      if (ch >= 48 && ch <= 55) {
+        var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];
+        var octal = parseInt(octalStr, 8);
+        if (octal > 255) {
+          octalStr = octalStr.slice(0, -1);
+          octal = parseInt(octalStr, 8);
+        }
+        this.pos += octalStr.length - 1;
+        ch = this.input.charCodeAt(this.pos);
+        if ((octalStr !== "0" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {
+          this.invalidStringToken(
+            this.pos - 1 - octalStr.length,
+            inTemplate
+              ? "Octal literal in template string"
+              : "Octal literal in strict mode"
+          );
+        }
+        return String.fromCharCode(octal)
+      }
+      if (isNewLine(ch)) {
+        // Unicode new line characters after \ get removed from output in both
+        // template literals and strings
+        return ""
+      }
+      return String.fromCharCode(ch)
+    }
+  };
+
+  // Used to read character escape sequences ('\x', '\u', '\U').
+
+  pp.readHexChar = function(len) {
+    var codePos = this.pos;
+    var n = this.readInt(16, len);
+    if (n === null) { this.invalidStringToken(codePos, "Bad character escape sequence"); }
+    return n
+  };
+
+  // Read an identifier, and return it as a string. Sets `this.containsEsc`
+  // to whether the word contained a '\u' escape.
+  //
+  // Incrementally adds only escaped chars, adding other chunks as-is
+  // as a micro-optimization.
+
+  pp.readWord1 = function() {
+    this.containsEsc = false;
+    var word = "", first = true, chunkStart = this.pos;
+    var astral = this.options.ecmaVersion >= 6;
+    while (this.pos < this.input.length) {
+      var ch = this.fullCharCodeAtPos();
+      if (isIdentifierChar(ch, astral)) {
+        this.pos += ch <= 0xffff ? 1 : 2;
+      } else if (ch === 92) { // "\"
+        this.containsEsc = true;
+        word += this.input.slice(chunkStart, this.pos);
+        var escStart = this.pos;
+        if (this.input.charCodeAt(++this.pos) !== 117) // "u"
+          { this.invalidStringToken(this.pos, "Expecting Unicode escape sequence \\uXXXX"); }
+        ++this.pos;
+        var esc = this.readCodePoint();
+        if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))
+          { this.invalidStringToken(escStart, "Invalid Unicode escape"); }
+        word += codePointToString(esc);
+        chunkStart = this.pos;
+      } else {
+        break
+      }
+      first = false;
+    }
+    return word + this.input.slice(chunkStart, this.pos)
+  };
+
+  // Read an identifier or keyword token. Will check for reserved
+  // words when necessary.
+
+  pp.readWord = function() {
+    var word = this.readWord1();
+    var type = types$1.name;
+    if (this.keywords.test(word)) {
+      type = keywords[word];
+    }
+    return this.finishToken(type, word)
+  };
+
+  // Acorn is a tiny, fast JavaScript parser written in JavaScript.
+
+  var version = "8.7.0";
+
+  Parser.acorn = {
+    Parser: Parser,
+    version: version,
+    defaultOptions: defaultOptions,
+    Position: Position,
+    SourceLocation: SourceLocation,
+    getLineInfo: getLineInfo,
+    Node: Node,
+    TokenType: TokenType,
+    tokTypes: types$1,
+    keywordTypes: keywords,
+    TokContext: TokContext,
+    tokContexts: types,
+    isIdentifierChar: isIdentifierChar,
+    isIdentifierStart: isIdentifierStart,
+    Token: Token,
+    isNewLine: isNewLine,
+    lineBreak: lineBreak,
+    lineBreakG: lineBreakG,
+    nonASCIIwhitespace: nonASCIIwhitespace
+  };
+
+  // The main exported interface (under `self.acorn` when in the
+  // browser) is a `parse` function that takes a code string and
+  // returns an abstract syntax tree as specified by [Mozilla parser
+  // API][api].
+  //
+  // [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API
+
+  function parse(input, options) {
+    return Parser.parse(input, options)
+  }
+
+  // This function tries to parse a single expression at a given
+  // offset in a string. Useful for parsing mixed-language formats
+  // that embed JavaScript expressions.
+
+  function parseExpressionAt(input, pos, options) {
+    return Parser.parseExpressionAt(input, pos, options)
+  }
+
+  // Acorn is organized as a tokenizer and a recursive-descent parser.
+  // The `tokenizer` export provides an interface to the tokenizer.
+
+  function tokenizer(input, options) {
+    return Parser.tokenizer(input, options)
+  }
+
+  exports.Node = Node;
+  exports.Parser = Parser;
+  exports.Position = Position;
+  exports.SourceLocation = SourceLocation;
+  exports.TokContext = TokContext;
+  exports.Token = Token;
+  exports.TokenType = TokenType;
+  exports.defaultOptions = defaultOptions;
+  exports.getLineInfo = getLineInfo;
+  exports.isIdentifierChar = isIdentifierChar;
+  exports.isIdentifierStart = isIdentifierStart;
+  exports.isNewLine = isNewLine;
+  exports.keywordTypes = keywords;
+  exports.lineBreak = lineBreak;
+  exports.lineBreakG = lineBreakG;
+  exports.nonASCIIwhitespace = nonASCIIwhitespace;
+  exports.parse = parse;
+  exports.parseExpressionAt = parseExpressionAt;
+  exports.tokContexts = types;
+  exports.tokTypes = types$1;
+  exports.tokenizer = tokenizer;
+  exports.version = version;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
diff --git a/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.mjs b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.mjs
new file mode 100644
index 0000000..e99e9b3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.mjs
@@ -0,0 +1,5588 @@
+// Reserved word lists for various dialects of the language
+
+var reservedWords = {
+  3: "abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile",
+  5: "class enum extends super const export import",
+  6: "enum",
+  strict: "implements interface let package private protected public static yield",
+  strictBind: "eval arguments"
+};
+
+// And the keywords
+
+var ecma5AndLessKeywords = "break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this";
+
+var keywords$1 = {
+  5: ecma5AndLessKeywords,
+  "5module": ecma5AndLessKeywords + " export import",
+  6: ecma5AndLessKeywords + " const class extends export import super"
+};
+
+var keywordRelationalOperator = /^in(stanceof)?$/;
+
+// ## Character categories
+
+// Big ugly regular expressions that match characters in the
+// whitespace, identifier, and identifier-start categories. These
+// are only applied when a character is found to actually have a
+// code point above 128.
+// Generated by `bin/generate-identifier-regex.js`.
+var nonASCIIidentifierStartChars = "\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\u16ee-\u16f8\u1700-\u1711\u171f-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\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\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\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\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\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-\ua6ef\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";
+var nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u0898-\u089f\u08ca-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b55-\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3c\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d81-\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u180f-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1abf-\u1ace\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua82c\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
+
+var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
+var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
+
+nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
+
+// These are a run-length and offset encoded representation of the
+// >0xffff code points that are a valid part of identifiers. The
+// offset starts at 0x10000, and each pair of numbers represents an
+// offset to the next range, and then a size of the range. They were
+// generated by bin/generate-identifier-regex.js
+
+// eslint-disable-next-line comma-spacing
+var astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,13,10,2,14,2,6,2,1,2,10,2,14,2,6,2,1,68,310,10,21,11,7,25,5,2,41,2,8,70,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,349,41,7,1,79,28,11,0,9,21,43,17,47,20,28,22,13,52,58,1,3,0,14,44,33,24,27,35,30,0,3,0,9,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,2,31,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,38,6,186,43,117,63,32,7,3,0,3,7,2,1,2,23,16,0,2,0,95,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,19,72,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,190,0,80,921,103,110,18,195,2637,96,16,1070,4050,582,8634,568,8,30,18,78,18,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,1237,43,8,8936,3,2,6,2,1,2,290,46,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,1845,30,482,44,11,6,17,0,322,29,19,43,1269,6,2,3,2,1,2,14,2,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42719,33,4152,8,221,3,5761,15,7472,3104,541,1507,4938];
+
+// eslint-disable-next-line comma-spacing
+var astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,370,1,154,10,50,3,123,2,54,14,32,10,3,1,11,3,46,10,8,0,46,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,2,11,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,71,5,2,1,3,3,2,0,2,1,13,9,120,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,87,9,39,4,60,6,26,9,1014,0,2,54,8,3,82,0,12,1,19628,1,4706,45,3,22,543,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,357,0,62,13,1495,6,110,6,6,9,4759,9,787719,239];
+
+// This has a complexity linear to the value of the code. The
+// assumption is that looking up astral identifier characters is
+// rare.
+function isInAstralSet(code, set) {
+  var pos = 0x10000;
+  for (var i = 0; i < set.length; i += 2) {
+    pos += set[i];
+    if (pos > code) { return false }
+    pos += set[i + 1];
+    if (pos >= code) { return true }
+  }
+}
+
+// Test whether a given character code starts an identifier.
+
+function isIdentifierStart(code, astral) {
+  if (code < 65) { return code === 36 }
+  if (code < 91) { return true }
+  if (code < 97) { return code === 95 }
+  if (code < 123) { return true }
+  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }
+  if (astral === false) { return false }
+  return isInAstralSet(code, astralIdentifierStartCodes)
+}
+
+// Test whether a given character is part of an identifier.
+
+function isIdentifierChar(code, astral) {
+  if (code < 48) { return code === 36 }
+  if (code < 58) { return true }
+  if (code < 65) { return false }
+  if (code < 91) { return true }
+  if (code < 97) { return code === 95 }
+  if (code < 123) { return true }
+  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }
+  if (astral === false) { return false }
+  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)
+}
+
+// ## Token types
+
+// The assignment of fine-grained, information-carrying type objects
+// allows the tokenizer to store the information it has about a
+// token in a way that is very cheap for the parser to look up.
+
+// All token type variables start with an underscore, to make them
+// easy to recognize.
+
+// The `beforeExpr` property is used to disambiguate between regular
+// expressions and divisions. It is set on all token types that can
+// be followed by an expression (thus, a slash after them would be a
+// regular expression).
+//
+// The `startsExpr` property is used to check if the token ends a
+// `yield` expression. It is set on all token types that either can
+// directly start an expression (like a quotation mark) or can
+// continue an expression (like the body of a string).
+//
+// `isLoop` marks a keyword as starting a loop, which is important
+// to know when parsing a label, in order to allow or disallow
+// continue jumps to that label.
+
+var TokenType = function TokenType(label, conf) {
+  if ( conf === void 0 ) conf = {};
+
+  this.label = label;
+  this.keyword = conf.keyword;
+  this.beforeExpr = !!conf.beforeExpr;
+  this.startsExpr = !!conf.startsExpr;
+  this.isLoop = !!conf.isLoop;
+  this.isAssign = !!conf.isAssign;
+  this.prefix = !!conf.prefix;
+  this.postfix = !!conf.postfix;
+  this.binop = conf.binop || null;
+  this.updateContext = null;
+};
+
+function binop(name, prec) {
+  return new TokenType(name, {beforeExpr: true, binop: prec})
+}
+var beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};
+
+// Map keyword names to token types.
+
+var keywords = {};
+
+// Succinct definitions of keyword token types
+function kw(name, options) {
+  if ( options === void 0 ) options = {};
+
+  options.keyword = name;
+  return keywords[name] = new TokenType(name, options)
+}
+
+var types$1 = {
+  num: new TokenType("num", startsExpr),
+  regexp: new TokenType("regexp", startsExpr),
+  string: new TokenType("string", startsExpr),
+  name: new TokenType("name", startsExpr),
+  privateId: new TokenType("privateId", startsExpr),
+  eof: new TokenType("eof"),
+
+  // Punctuation token types.
+  bracketL: new TokenType("[", {beforeExpr: true, startsExpr: true}),
+  bracketR: new TokenType("]"),
+  braceL: new TokenType("{", {beforeExpr: true, startsExpr: true}),
+  braceR: new TokenType("}"),
+  parenL: new TokenType("(", {beforeExpr: true, startsExpr: true}),
+  parenR: new TokenType(")"),
+  comma: new TokenType(",", beforeExpr),
+  semi: new TokenType(";", beforeExpr),
+  colon: new TokenType(":", beforeExpr),
+  dot: new TokenType("."),
+  question: new TokenType("?", beforeExpr),
+  questionDot: new TokenType("?."),
+  arrow: new TokenType("=>", beforeExpr),
+  template: new TokenType("template"),
+  invalidTemplate: new TokenType("invalidTemplate"),
+  ellipsis: new TokenType("...", beforeExpr),
+  backQuote: new TokenType("`", startsExpr),
+  dollarBraceL: new TokenType("${", {beforeExpr: true, startsExpr: true}),
+
+  // Operators. These carry several kinds of properties to help the
+  // parser use them properly (the presence of these properties is
+  // what categorizes them as operators).
+  //
+  // `binop`, when present, specifies that this operator is a binary
+  // operator, and will refer to its precedence.
+  //
+  // `prefix` and `postfix` mark the operator as a prefix or postfix
+  // unary operator.
+  //
+  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
+  // binary operators with a very low precedence, that should result
+  // in AssignmentExpression nodes.
+
+  eq: new TokenType("=", {beforeExpr: true, isAssign: true}),
+  assign: new TokenType("_=", {beforeExpr: true, isAssign: true}),
+  incDec: new TokenType("++/--", {prefix: true, postfix: true, startsExpr: true}),
+  prefix: new TokenType("!/~", {beforeExpr: true, prefix: true, startsExpr: true}),
+  logicalOR: binop("||", 1),
+  logicalAND: binop("&&", 2),
+  bitwiseOR: binop("|", 3),
+  bitwiseXOR: binop("^", 4),
+  bitwiseAND: binop("&", 5),
+  equality: binop("==/!=/===/!==", 6),
+  relational: binop("</>/<=/>=", 7),
+  bitShift: binop("<</>>/>>>", 8),
+  plusMin: new TokenType("+/-", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),
+  modulo: binop("%", 10),
+  star: binop("*", 10),
+  slash: binop("/", 10),
+  starstar: new TokenType("**", {beforeExpr: true}),
+  coalesce: binop("??", 1),
+
+  // Keyword token types.
+  _break: kw("break"),
+  _case: kw("case", beforeExpr),
+  _catch: kw("catch"),
+  _continue: kw("continue"),
+  _debugger: kw("debugger"),
+  _default: kw("default", beforeExpr),
+  _do: kw("do", {isLoop: true, beforeExpr: true}),
+  _else: kw("else", beforeExpr),
+  _finally: kw("finally"),
+  _for: kw("for", {isLoop: true}),
+  _function: kw("function", startsExpr),
+  _if: kw("if"),
+  _return: kw("return", beforeExpr),
+  _switch: kw("switch"),
+  _throw: kw("throw", beforeExpr),
+  _try: kw("try"),
+  _var: kw("var"),
+  _const: kw("const"),
+  _while: kw("while", {isLoop: true}),
+  _with: kw("with"),
+  _new: kw("new", {beforeExpr: true, startsExpr: true}),
+  _this: kw("this", startsExpr),
+  _super: kw("super", startsExpr),
+  _class: kw("class", startsExpr),
+  _extends: kw("extends", beforeExpr),
+  _export: kw("export"),
+  _import: kw("import", startsExpr),
+  _null: kw("null", startsExpr),
+  _true: kw("true", startsExpr),
+  _false: kw("false", startsExpr),
+  _in: kw("in", {beforeExpr: true, binop: 7}),
+  _instanceof: kw("instanceof", {beforeExpr: true, binop: 7}),
+  _typeof: kw("typeof", {beforeExpr: true, prefix: true, startsExpr: true}),
+  _void: kw("void", {beforeExpr: true, prefix: true, startsExpr: true}),
+  _delete: kw("delete", {beforeExpr: true, prefix: true, startsExpr: true})
+};
+
+// Matches a whole line break (where CRLF is considered a single
+// line break). Used to count lines.
+
+var lineBreak = /\r\n?|\n|\u2028|\u2029/;
+var lineBreakG = new RegExp(lineBreak.source, "g");
+
+function isNewLine(code) {
+  return code === 10 || code === 13 || code === 0x2028 || code === 0x2029
+}
+
+function nextLineBreak(code, from, end) {
+  if ( end === void 0 ) end = code.length;
+
+  for (var i = from; i < end; i++) {
+    var next = code.charCodeAt(i);
+    if (isNewLine(next))
+      { return i < end - 1 && next === 13 && code.charCodeAt(i + 1) === 10 ? i + 2 : i + 1 }
+  }
+  return -1
+}
+
+var nonASCIIwhitespace = /[\u1680\u2000-\u200a\u202f\u205f\u3000\ufeff]/;
+
+var skipWhiteSpace = /(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;
+
+var ref = Object.prototype;
+var hasOwnProperty = ref.hasOwnProperty;
+var toString = ref.toString;
+
+var hasOwn = Object.hasOwn || (function (obj, propName) { return (
+  hasOwnProperty.call(obj, propName)
+); });
+
+var isArray = Array.isArray || (function (obj) { return (
+  toString.call(obj) === "[object Array]"
+); });
+
+function wordsRegexp(words) {
+  return new RegExp("^(?:" + words.replace(/ /g, "|") + ")$")
+}
+
+var loneSurrogate = /(?:[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])/;
+
+// These are used when `options.locations` is on, for the
+// `startLoc` and `endLoc` properties.
+
+var Position = function Position(line, col) {
+  this.line = line;
+  this.column = col;
+};
+
+Position.prototype.offset = function offset (n) {
+  return new Position(this.line, this.column + n)
+};
+
+var SourceLocation = function SourceLocation(p, start, end) {
+  this.start = start;
+  this.end = end;
+  if (p.sourceFile !== null) { this.source = p.sourceFile; }
+};
+
+// The `getLineInfo` function is mostly useful when the
+// `locations` option is off (for performance reasons) and you
+// want to find the line/column position for a given character
+// offset. `input` should be the code string that the offset refers
+// into.
+
+function getLineInfo(input, offset) {
+  for (var line = 1, cur = 0;;) {
+    var nextBreak = nextLineBreak(input, cur, offset);
+    if (nextBreak < 0) { return new Position(line, offset - cur) }
+    ++line;
+    cur = nextBreak;
+  }
+}
+
+// A second argument must be given to configure the parser process.
+// These options are recognized (only `ecmaVersion` is required):
+
+var defaultOptions = {
+  // `ecmaVersion` indicates the ECMAScript version to parse. Must be
+  // either 3, 5, 6 (or 2015), 7 (2016), 8 (2017), 9 (2018), 10
+  // (2019), 11 (2020), 12 (2021), 13 (2022), or `"latest"` (the
+  // latest version the library supports). This influences support
+  // for strict mode, the set of reserved words, and support for
+  // new syntax features.
+  ecmaVersion: null,
+  // `sourceType` indicates the mode the code should be parsed in.
+  // Can be either `"script"` or `"module"`. This influences global
+  // strict mode and parsing of `import` and `export` declarations.
+  sourceType: "script",
+  // `onInsertedSemicolon` can be a callback that will be called
+  // when a semicolon is automatically inserted. It will be passed
+  // the position of the comma as an offset, and if `locations` is
+  // enabled, it is given the location as a `{line, column}` object
+  // as second argument.
+  onInsertedSemicolon: null,
+  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for
+  // trailing commas.
+  onTrailingComma: null,
+  // By default, reserved words are only enforced if ecmaVersion >= 5.
+  // Set `allowReserved` to a boolean value to explicitly turn this on
+  // an off. When this option has the value "never", reserved words
+  // and keywords can also not be used as property names.
+  allowReserved: null,
+  // When enabled, a return at the top level is not considered an
+  // error.
+  allowReturnOutsideFunction: false,
+  // When enabled, import/export statements are not constrained to
+  // appearing at the top of the program, and an import.meta expression
+  // in a script isn't considered an error.
+  allowImportExportEverywhere: false,
+  // By default, await identifiers are allowed to appear at the top-level scope only if ecmaVersion >= 2022.
+  // When enabled, await identifiers are allowed to appear at the top-level scope,
+  // but they are still not allowed in non-async functions.
+  allowAwaitOutsideFunction: null,
+  // When enabled, super identifiers are not constrained to
+  // appearing in methods and do not raise an error when they appear elsewhere.
+  allowSuperOutsideMethod: null,
+  // When enabled, hashbang directive in the beginning of file
+  // is allowed and treated as a line comment.
+  allowHashBang: false,
+  // When `locations` is on, `loc` properties holding objects with
+  // `start` and `end` properties in `{line, column}` form (with
+  // line being 1-based and column 0-based) will be attached to the
+  // nodes.
+  locations: false,
+  // A function can be passed as `onToken` option, which will
+  // cause Acorn to call that function with object in the same
+  // format as tokens returned from `tokenizer().getToken()`. Note
+  // that you are not allowed to call the parser from the
+  // callback—that will corrupt its internal state.
+  onToken: null,
+  // A function can be passed as `onComment` option, which will
+  // cause Acorn to call that function with `(block, text, start,
+  // end)` parameters whenever a comment is skipped. `block` is a
+  // boolean indicating whether this is a block (`/* */`) comment,
+  // `text` is the content of the comment, and `start` and `end` are
+  // character offsets that denote the start and end of the comment.
+  // When the `locations` option is on, two more parameters are
+  // passed, the full `{line, column}` locations of the start and
+  // end of the comments. Note that you are not allowed to call the
+  // parser from the callback—that will corrupt its internal state.
+  onComment: null,
+  // Nodes have their start and end characters offsets recorded in
+  // `start` and `end` properties (directly on the node, rather than
+  // the `loc` object, which holds line/column data. To also add a
+  // [semi-standardized][range] `range` property holding a `[start,
+  // end]` array with the same numbers, set the `ranges` option to
+  // `true`.
+  //
+  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
+  ranges: false,
+  // It is possible to parse multiple files into a single AST by
+  // passing the tree produced by parsing the first file as
+  // `program` option in subsequent parses. This will add the
+  // toplevel forms of the parsed file to the `Program` (top) node
+  // of an existing parse tree.
+  program: null,
+  // When `locations` is on, you can pass this to record the source
+  // file in every node's `loc` object.
+  sourceFile: null,
+  // This value, if given, is stored in every node, whether
+  // `locations` is on or off.
+  directSourceFile: null,
+  // When enabled, parenthesized expressions are represented by
+  // (non-standard) ParenthesizedExpression nodes
+  preserveParens: false
+};
+
+// Interpret and default an options object
+
+var warnedAboutEcmaVersion = false;
+
+function getOptions(opts) {
+  var options = {};
+
+  for (var opt in defaultOptions)
+    { options[opt] = opts && hasOwn(opts, opt) ? opts[opt] : defaultOptions[opt]; }
+
+  if (options.ecmaVersion === "latest") {
+    options.ecmaVersion = 1e8;
+  } else if (options.ecmaVersion == null) {
+    if (!warnedAboutEcmaVersion && typeof console === "object" && console.warn) {
+      warnedAboutEcmaVersion = true;
+      console.warn("Since Acorn 8.0.0, options.ecmaVersion is required.\nDefaulting to 2020, but this will stop working in the future.");
+    }
+    options.ecmaVersion = 11;
+  } else if (options.ecmaVersion >= 2015) {
+    options.ecmaVersion -= 2009;
+  }
+
+  if (options.allowReserved == null)
+    { options.allowReserved = options.ecmaVersion < 5; }
+
+  if (isArray(options.onToken)) {
+    var tokens = options.onToken;
+    options.onToken = function (token) { return tokens.push(token); };
+  }
+  if (isArray(options.onComment))
+    { options.onComment = pushComment(options, options.onComment); }
+
+  return options
+}
+
+function pushComment(options, array) {
+  return function(block, text, start, end, startLoc, endLoc) {
+    var comment = {
+      type: block ? "Block" : "Line",
+      value: text,
+      start: start,
+      end: end
+    };
+    if (options.locations)
+      { comment.loc = new SourceLocation(this, startLoc, endLoc); }
+    if (options.ranges)
+      { comment.range = [start, end]; }
+    array.push(comment);
+  }
+}
+
+// Each scope gets a bitset that may contain these flags
+var
+    SCOPE_TOP = 1,
+    SCOPE_FUNCTION = 2,
+    SCOPE_ASYNC = 4,
+    SCOPE_GENERATOR = 8,
+    SCOPE_ARROW = 16,
+    SCOPE_SIMPLE_CATCH = 32,
+    SCOPE_SUPER = 64,
+    SCOPE_DIRECT_SUPER = 128,
+    SCOPE_CLASS_STATIC_BLOCK = 256,
+    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK;
+
+function functionFlags(async, generator) {
+  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)
+}
+
+// Used in checkLVal* and declareName to determine the type of a binding
+var
+    BIND_NONE = 0, // Not a binding
+    BIND_VAR = 1, // Var-style binding
+    BIND_LEXICAL = 2, // Let- or const-style binding
+    BIND_FUNCTION = 3, // Function declaration
+    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding
+    BIND_OUTSIDE = 5; // Special case for function names as bound inside the function
+
+var Parser = function Parser(options, input, startPos) {
+  this.options = options = getOptions(options);
+  this.sourceFile = options.sourceFile;
+  this.keywords = wordsRegexp(keywords$1[options.ecmaVersion >= 6 ? 6 : options.sourceType === "module" ? "5module" : 5]);
+  var reserved = "";
+  if (options.allowReserved !== true) {
+    reserved = reservedWords[options.ecmaVersion >= 6 ? 6 : options.ecmaVersion === 5 ? 5 : 3];
+    if (options.sourceType === "module") { reserved += " await"; }
+  }
+  this.reservedWords = wordsRegexp(reserved);
+  var reservedStrict = (reserved ? reserved + " " : "") + reservedWords.strict;
+  this.reservedWordsStrict = wordsRegexp(reservedStrict);
+  this.reservedWordsStrictBind = wordsRegexp(reservedStrict + " " + reservedWords.strictBind);
+  this.input = String(input);
+
+  // Used to signal to callers of `readWord1` whether the word
+  // contained any escape sequences. This is needed because words with
+  // escape sequences must not be interpreted as keywords.
+  this.containsEsc = false;
+
+  // Set up token state
+
+  // The current position of the tokenizer in the input.
+  if (startPos) {
+    this.pos = startPos;
+    this.lineStart = this.input.lastIndexOf("\n", startPos - 1) + 1;
+    this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;
+  } else {
+    this.pos = this.lineStart = 0;
+    this.curLine = 1;
+  }
+
+  // Properties of the current token:
+  // Its type
+  this.type = types$1.eof;
+  // For tokens that include more information than their type, the value
+  this.value = null;
+  // Its start and end offset
+  this.start = this.end = this.pos;
+  // And, if locations are used, the {line, column} object
+  // corresponding to those offsets
+  this.startLoc = this.endLoc = this.curPosition();
+
+  // Position information for the previous token
+  this.lastTokEndLoc = this.lastTokStartLoc = null;
+  this.lastTokStart = this.lastTokEnd = this.pos;
+
+  // The context stack is used to superficially track syntactic
+  // context to predict whether a regular expression is allowed in a
+  // given position.
+  this.context = this.initialContext();
+  this.exprAllowed = true;
+
+  // Figure out if it's a module code.
+  this.inModule = options.sourceType === "module";
+  this.strict = this.inModule || this.strictDirective(this.pos);
+
+  // Used to signify the start of a potential arrow function
+  this.potentialArrowAt = -1;
+  this.potentialArrowInForAwait = false;
+
+  // Positions to delayed-check that yield/await does not exist in default parameters.
+  this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;
+  // Labels in scope.
+  this.labels = [];
+  // Thus-far undefined exports.
+  this.undefinedExports = Object.create(null);
+
+  // If enabled, skip leading hashbang line.
+  if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === "#!")
+    { this.skipLineComment(2); }
+
+  // Scope tracking for duplicate variable names (see scope.js)
+  this.scopeStack = [];
+  this.enterScope(SCOPE_TOP);
+
+  // For RegExp validation
+  this.regexpState = null;
+
+  // The stack of private names.
+  // Each element has two properties: 'declared' and 'used'.
+  // When it exited from the outermost class definition, all used private names must be declared.
+  this.privateNameStack = [];
+};
+
+var prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },canAwait: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true },allowNewDotTarget: { configurable: true },inClassStaticBlock: { configurable: true } };
+
+Parser.prototype.parse = function parse () {
+  var node = this.options.program || this.startNode();
+  this.nextToken();
+  return this.parseTopLevel(node)
+};
+
+prototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };
+
+prototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 && !this.currentVarScope().inClassFieldInit };
+
+prototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 && !this.currentVarScope().inClassFieldInit };
+
+prototypeAccessors.canAwait.get = function () {
+  for (var i = this.scopeStack.length - 1; i >= 0; i--) {
+    var scope = this.scopeStack[i];
+    if (scope.inClassFieldInit || scope.flags & SCOPE_CLASS_STATIC_BLOCK) { return false }
+    if (scope.flags & SCOPE_FUNCTION) { return (scope.flags & SCOPE_ASYNC) > 0 }
+  }
+  return (this.inModule && this.options.ecmaVersion >= 13) || this.options.allowAwaitOutsideFunction
+};
+
+prototypeAccessors.allowSuper.get = function () {
+  var ref = this.currentThisScope();
+    var flags = ref.flags;
+    var inClassFieldInit = ref.inClassFieldInit;
+  return (flags & SCOPE_SUPER) > 0 || inClassFieldInit || this.options.allowSuperOutsideMethod
+};
+
+prototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };
+
+prototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };
+
+prototypeAccessors.allowNewDotTarget.get = function () {
+  var ref = this.currentThisScope();
+    var flags = ref.flags;
+    var inClassFieldInit = ref.inClassFieldInit;
+  return (flags & (SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK)) > 0 || inClassFieldInit
+};
+
+prototypeAccessors.inClassStaticBlock.get = function () {
+  return (this.currentVarScope().flags & SCOPE_CLASS_STATIC_BLOCK) > 0
+};
+
+Parser.extend = function extend () {
+    var plugins = [], len = arguments.length;
+    while ( len-- ) plugins[ len ] = arguments[ len ];
+
+  var cls = this;
+  for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }
+  return cls
+};
+
+Parser.parse = function parse (input, options) {
+  return new this(options, input).parse()
+};
+
+Parser.parseExpressionAt = function parseExpressionAt (input, pos, options) {
+  var parser = new this(options, input, pos);
+  parser.nextToken();
+  return parser.parseExpression()
+};
+
+Parser.tokenizer = function tokenizer (input, options) {
+  return new this(options, input)
+};
+
+Object.defineProperties( Parser.prototype, prototypeAccessors );
+
+var pp$9 = Parser.prototype;
+
+// ## Parser utilities
+
+var literal = /^(?:'((?:\\.|[^'\\])*?)'|"((?:\\.|[^"\\])*?)")/;
+pp$9.strictDirective = function(start) {
+  for (;;) {
+    // Try to find string literal.
+    skipWhiteSpace.lastIndex = start;
+    start += skipWhiteSpace.exec(this.input)[0].length;
+    var match = literal.exec(this.input.slice(start));
+    if (!match) { return false }
+    if ((match[1] || match[2]) === "use strict") {
+      skipWhiteSpace.lastIndex = start + match[0].length;
+      var spaceAfter = skipWhiteSpace.exec(this.input), end = spaceAfter.index + spaceAfter[0].length;
+      var next = this.input.charAt(end);
+      return next === ";" || next === "}" ||
+        (lineBreak.test(spaceAfter[0]) &&
+         !(/[(`.[+\-/*%<>=,?^&]/.test(next) || next === "!" && this.input.charAt(end + 1) === "="))
+    }
+    start += match[0].length;
+
+    // Skip semicolon, if any.
+    skipWhiteSpace.lastIndex = start;
+    start += skipWhiteSpace.exec(this.input)[0].length;
+    if (this.input[start] === ";")
+      { start++; }
+  }
+};
+
+// Predicate that tests whether the next token is of the given
+// type, and if yes, consumes it as a side effect.
+
+pp$9.eat = function(type) {
+  if (this.type === type) {
+    this.next();
+    return true
+  } else {
+    return false
+  }
+};
+
+// Tests whether parsed token is a contextual keyword.
+
+pp$9.isContextual = function(name) {
+  return this.type === types$1.name && this.value === name && !this.containsEsc
+};
+
+// Consumes contextual keyword if possible.
+
+pp$9.eatContextual = function(name) {
+  if (!this.isContextual(name)) { return false }
+  this.next();
+  return true
+};
+
+// Asserts that following token is given contextual keyword.
+
+pp$9.expectContextual = function(name) {
+  if (!this.eatContextual(name)) { this.unexpected(); }
+};
+
+// Test whether a semicolon can be inserted at the current position.
+
+pp$9.canInsertSemicolon = function() {
+  return this.type === types$1.eof ||
+    this.type === types$1.braceR ||
+    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+};
+
+pp$9.insertSemicolon = function() {
+  if (this.canInsertSemicolon()) {
+    if (this.options.onInsertedSemicolon)
+      { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }
+    return true
+  }
+};
+
+// Consume a semicolon, or, failing that, see if we are allowed to
+// pretend that there is a semicolon at this position.
+
+pp$9.semicolon = function() {
+  if (!this.eat(types$1.semi) && !this.insertSemicolon()) { this.unexpected(); }
+};
+
+pp$9.afterTrailingComma = function(tokType, notNext) {
+  if (this.type === tokType) {
+    if (this.options.onTrailingComma)
+      { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }
+    if (!notNext)
+      { this.next(); }
+    return true
+  }
+};
+
+// Expect a token of a given type. If found, consume it, otherwise,
+// raise an unexpected token error.
+
+pp$9.expect = function(type) {
+  this.eat(type) || this.unexpected();
+};
+
+// Raise an unexpected token error.
+
+pp$9.unexpected = function(pos) {
+  this.raise(pos != null ? pos : this.start, "Unexpected token");
+};
+
+function DestructuringErrors() {
+  this.shorthandAssign =
+  this.trailingComma =
+  this.parenthesizedAssign =
+  this.parenthesizedBind =
+  this.doubleProto =
+    -1;
+}
+
+pp$9.checkPatternErrors = function(refDestructuringErrors, isAssign) {
+  if (!refDestructuringErrors) { return }
+  if (refDestructuringErrors.trailingComma > -1)
+    { this.raiseRecoverable(refDestructuringErrors.trailingComma, "Comma is not permitted after the rest element"); }
+  var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;
+  if (parens > -1) { this.raiseRecoverable(parens, "Parenthesized pattern"); }
+};
+
+pp$9.checkExpressionErrors = function(refDestructuringErrors, andThrow) {
+  if (!refDestructuringErrors) { return false }
+  var shorthandAssign = refDestructuringErrors.shorthandAssign;
+  var doubleProto = refDestructuringErrors.doubleProto;
+  if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }
+  if (shorthandAssign >= 0)
+    { this.raise(shorthandAssign, "Shorthand property assignments are valid only in destructuring patterns"); }
+  if (doubleProto >= 0)
+    { this.raiseRecoverable(doubleProto, "Redefinition of __proto__ property"); }
+};
+
+pp$9.checkYieldAwaitInDefaultParams = function() {
+  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))
+    { this.raise(this.yieldPos, "Yield expression cannot be a default value"); }
+  if (this.awaitPos)
+    { this.raise(this.awaitPos, "Await expression cannot be a default value"); }
+};
+
+pp$9.isSimpleAssignTarget = function(expr) {
+  if (expr.type === "ParenthesizedExpression")
+    { return this.isSimpleAssignTarget(expr.expression) }
+  return expr.type === "Identifier" || expr.type === "MemberExpression"
+};
+
+var pp$8 = Parser.prototype;
+
+// ### Statement parsing
+
+// Parse a program. Initializes the parser, reads any number of
+// statements, and wraps them in a Program node.  Optionally takes a
+// `program` argument.  If present, the statements will be appended
+// to its body instead of creating a new node.
+
+pp$8.parseTopLevel = function(node) {
+  var exports = Object.create(null);
+  if (!node.body) { node.body = []; }
+  while (this.type !== types$1.eof) {
+    var stmt = this.parseStatement(null, true, exports);
+    node.body.push(stmt);
+  }
+  if (this.inModule)
+    { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)
+      {
+        var name = list[i];
+
+        this.raiseRecoverable(this.undefinedExports[name].start, ("Export '" + name + "' is not defined"));
+      } }
+  this.adaptDirectivePrologue(node.body);
+  this.next();
+  node.sourceType = this.options.sourceType;
+  return this.finishNode(node, "Program")
+};
+
+var loopLabel = {kind: "loop"}, switchLabel = {kind: "switch"};
+
+pp$8.isLet = function(context) {
+  if (this.options.ecmaVersion < 6 || !this.isContextual("let")) { return false }
+  skipWhiteSpace.lastIndex = this.pos;
+  var skip = skipWhiteSpace.exec(this.input);
+  var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+  // For ambiguous cases, determine if a LexicalDeclaration (or only a
+  // Statement) is allowed here. If context is not empty then only a Statement
+  // is allowed. However, `let [` is an explicit negative lookahead for
+  // ExpressionStatement, so special-case it first.
+  if (nextCh === 91 || nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true } // '[', '/', astral
+  if (context) { return false }
+
+  if (nextCh === 123) { return true } // '{'
+  if (isIdentifierStart(nextCh, true)) {
+    var pos = next + 1;
+    while (isIdentifierChar(nextCh = this.input.charCodeAt(pos), true)) { ++pos; }
+    if (nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true }
+    var ident = this.input.slice(next, pos);
+    if (!keywordRelationalOperator.test(ident)) { return true }
+  }
+  return false
+};
+
+// check 'async [no LineTerminator here] function'
+// - 'async /*foo*/ function' is OK.
+// - 'async /*\n*/ function' is invalid.
+pp$8.isAsyncFunction = function() {
+  if (this.options.ecmaVersion < 8 || !this.isContextual("async"))
+    { return false }
+
+  skipWhiteSpace.lastIndex = this.pos;
+  var skip = skipWhiteSpace.exec(this.input);
+  var next = this.pos + skip[0].length, after;
+  return !lineBreak.test(this.input.slice(this.pos, next)) &&
+    this.input.slice(next, next + 8) === "function" &&
+    (next + 8 === this.input.length ||
+     !(isIdentifierChar(after = this.input.charCodeAt(next + 8)) || after > 0xd7ff && after < 0xdc00))
+};
+
+// Parse a single statement.
+//
+// If expecting a statement and finding a slash operator, parse a
+// regular expression literal. This is to handle cases like
+// `if (foo) /blah/.exec(foo)`, where looking at the previous token
+// does not help.
+
+pp$8.parseStatement = function(context, topLevel, exports) {
+  var starttype = this.type, node = this.startNode(), kind;
+
+  if (this.isLet(context)) {
+    starttype = types$1._var;
+    kind = "let";
+  }
+
+  // Most types of statements are recognized by the keyword they
+  // start with. Many are trivial to parse, some require a bit of
+  // complexity.
+
+  switch (starttype) {
+  case types$1._break: case types$1._continue: return this.parseBreakContinueStatement(node, starttype.keyword)
+  case types$1._debugger: return this.parseDebuggerStatement(node)
+  case types$1._do: return this.parseDoStatement(node)
+  case types$1._for: return this.parseForStatement(node)
+  case types$1._function:
+    // Function as sole body of either an if statement or a labeled statement
+    // works, but not when it is part of a labeled statement that is the sole
+    // body of an if statement.
+    if ((context && (this.strict || context !== "if" && context !== "label")) && this.options.ecmaVersion >= 6) { this.unexpected(); }
+    return this.parseFunctionStatement(node, false, !context)
+  case types$1._class:
+    if (context) { this.unexpected(); }
+    return this.parseClass(node, true)
+  case types$1._if: return this.parseIfStatement(node)
+  case types$1._return: return this.parseReturnStatement(node)
+  case types$1._switch: return this.parseSwitchStatement(node)
+  case types$1._throw: return this.parseThrowStatement(node)
+  case types$1._try: return this.parseTryStatement(node)
+  case types$1._const: case types$1._var:
+    kind = kind || this.value;
+    if (context && kind !== "var") { this.unexpected(); }
+    return this.parseVarStatement(node, kind)
+  case types$1._while: return this.parseWhileStatement(node)
+  case types$1._with: return this.parseWithStatement(node)
+  case types$1.braceL: return this.parseBlock(true, node)
+  case types$1.semi: return this.parseEmptyStatement(node)
+  case types$1._export:
+  case types$1._import:
+    if (this.options.ecmaVersion > 10 && starttype === types$1._import) {
+      skipWhiteSpace.lastIndex = this.pos;
+      var skip = skipWhiteSpace.exec(this.input);
+      var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+      if (nextCh === 40 || nextCh === 46) // '(' or '.'
+        { return this.parseExpressionStatement(node, this.parseExpression()) }
+    }
+
+    if (!this.options.allowImportExportEverywhere) {
+      if (!topLevel)
+        { this.raise(this.start, "'import' and 'export' may only appear at the top level"); }
+      if (!this.inModule)
+        { this.raise(this.start, "'import' and 'export' may appear only with 'sourceType: module'"); }
+    }
+    return starttype === types$1._import ? this.parseImport(node) : this.parseExport(node, exports)
+
+    // If the statement does not start with a statement keyword or a
+    // brace, it's an ExpressionStatement or LabeledStatement. We
+    // simply start parsing an expression, and afterwards, if the
+    // next token is a colon and the expression was a simple
+    // Identifier node, we switch to interpreting it as a label.
+  default:
+    if (this.isAsyncFunction()) {
+      if (context) { this.unexpected(); }
+      this.next();
+      return this.parseFunctionStatement(node, true, !context)
+    }
+
+    var maybeName = this.value, expr = this.parseExpression();
+    if (starttype === types$1.name && expr.type === "Identifier" && this.eat(types$1.colon))
+      { return this.parseLabeledStatement(node, maybeName, expr, context) }
+    else { return this.parseExpressionStatement(node, expr) }
+  }
+};
+
+pp$8.parseBreakContinueStatement = function(node, keyword) {
+  var isBreak = keyword === "break";
+  this.next();
+  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.label = null; }
+  else if (this.type !== types$1.name) { this.unexpected(); }
+  else {
+    node.label = this.parseIdent();
+    this.semicolon();
+  }
+
+  // Verify that there is an actual destination to break or
+  // continue to.
+  var i = 0;
+  for (; i < this.labels.length; ++i) {
+    var lab = this.labels[i];
+    if (node.label == null || lab.name === node.label.name) {
+      if (lab.kind != null && (isBreak || lab.kind === "loop")) { break }
+      if (node.label && isBreak) { break }
+    }
+  }
+  if (i === this.labels.length) { this.raise(node.start, "Unsyntactic " + keyword); }
+  return this.finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement")
+};
+
+pp$8.parseDebuggerStatement = function(node) {
+  this.next();
+  this.semicolon();
+  return this.finishNode(node, "DebuggerStatement")
+};
+
+pp$8.parseDoStatement = function(node) {
+  this.next();
+  this.labels.push(loopLabel);
+  node.body = this.parseStatement("do");
+  this.labels.pop();
+  this.expect(types$1._while);
+  node.test = this.parseParenExpression();
+  if (this.options.ecmaVersion >= 6)
+    { this.eat(types$1.semi); }
+  else
+    { this.semicolon(); }
+  return this.finishNode(node, "DoWhileStatement")
+};
+
+// Disambiguating between a `for` and a `for`/`in` or `for`/`of`
+// loop is non-trivial. Basically, we have to parse the init `var`
+// statement or expression, disallowing the `in` operator (see
+// the second parameter to `parseExpression`), and then check
+// whether the next token is `in` or `of`. When there is no init
+// part (semicolon immediately after the opening parenthesis), it
+// is a regular `for` loop.
+
+pp$8.parseForStatement = function(node) {
+  this.next();
+  var awaitAt = (this.options.ecmaVersion >= 9 && this.canAwait && this.eatContextual("await")) ? this.lastTokStart : -1;
+  this.labels.push(loopLabel);
+  this.enterScope(0);
+  this.expect(types$1.parenL);
+  if (this.type === types$1.semi) {
+    if (awaitAt > -1) { this.unexpected(awaitAt); }
+    return this.parseFor(node, null)
+  }
+  var isLet = this.isLet();
+  if (this.type === types$1._var || this.type === types$1._const || isLet) {
+    var init$1 = this.startNode(), kind = isLet ? "let" : this.value;
+    this.next();
+    this.parseVar(init$1, true, kind);
+    this.finishNode(init$1, "VariableDeclaration");
+    if ((this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) && init$1.declarations.length === 1) {
+      if (this.options.ecmaVersion >= 9) {
+        if (this.type === types$1._in) {
+          if (awaitAt > -1) { this.unexpected(awaitAt); }
+        } else { node.await = awaitAt > -1; }
+      }
+      return this.parseForIn(node, init$1)
+    }
+    if (awaitAt > -1) { this.unexpected(awaitAt); }
+    return this.parseFor(node, init$1)
+  }
+  var startsWithLet = this.isContextual("let"), isForOf = false;
+  var refDestructuringErrors = new DestructuringErrors;
+  var init = this.parseExpression(awaitAt > -1 ? "await" : true, refDestructuringErrors);
+  if (this.type === types$1._in || (isForOf = this.options.ecmaVersion >= 6 && this.isContextual("of"))) {
+    if (this.options.ecmaVersion >= 9) {
+      if (this.type === types$1._in) {
+        if (awaitAt > -1) { this.unexpected(awaitAt); }
+      } else { node.await = awaitAt > -1; }
+    }
+    if (startsWithLet && isForOf) { this.raise(init.start, "The left-hand side of a for-of loop may not start with 'let'."); }
+    this.toAssignable(init, false, refDestructuringErrors);
+    this.checkLValPattern(init);
+    return this.parseForIn(node, init)
+  } else {
+    this.checkExpressionErrors(refDestructuringErrors, true);
+  }
+  if (awaitAt > -1) { this.unexpected(awaitAt); }
+  return this.parseFor(node, init)
+};
+
+pp$8.parseFunctionStatement = function(node, isAsync, declarationPosition) {
+  this.next();
+  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)
+};
+
+pp$8.parseIfStatement = function(node) {
+  this.next();
+  node.test = this.parseParenExpression();
+  // allow function declarations in branches, but only in non-strict mode
+  node.consequent = this.parseStatement("if");
+  node.alternate = this.eat(types$1._else) ? this.parseStatement("if") : null;
+  return this.finishNode(node, "IfStatement")
+};
+
+pp$8.parseReturnStatement = function(node) {
+  if (!this.inFunction && !this.options.allowReturnOutsideFunction)
+    { this.raise(this.start, "'return' outside of function"); }
+  this.next();
+
+  // In `return` (and `break`/`continue`), the keywords with
+  // optional arguments, we eagerly look for a semicolon or the
+  // possibility to insert one.
+
+  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.argument = null; }
+  else { node.argument = this.parseExpression(); this.semicolon(); }
+  return this.finishNode(node, "ReturnStatement")
+};
+
+pp$8.parseSwitchStatement = function(node) {
+  this.next();
+  node.discriminant = this.parseParenExpression();
+  node.cases = [];
+  this.expect(types$1.braceL);
+  this.labels.push(switchLabel);
+  this.enterScope(0);
+
+  // Statements under must be grouped (by label) in SwitchCase
+  // nodes. `cur` is used to keep the node that we are currently
+  // adding statements to.
+
+  var cur;
+  for (var sawDefault = false; this.type !== types$1.braceR;) {
+    if (this.type === types$1._case || this.type === types$1._default) {
+      var isCase = this.type === types$1._case;
+      if (cur) { this.finishNode(cur, "SwitchCase"); }
+      node.cases.push(cur = this.startNode());
+      cur.consequent = [];
+      this.next();
+      if (isCase) {
+        cur.test = this.parseExpression();
+      } else {
+        if (sawDefault) { this.raiseRecoverable(this.lastTokStart, "Multiple default clauses"); }
+        sawDefault = true;
+        cur.test = null;
+      }
+      this.expect(types$1.colon);
+    } else {
+      if (!cur) { this.unexpected(); }
+      cur.consequent.push(this.parseStatement(null));
+    }
+  }
+  this.exitScope();
+  if (cur) { this.finishNode(cur, "SwitchCase"); }
+  this.next(); // Closing brace
+  this.labels.pop();
+  return this.finishNode(node, "SwitchStatement")
+};
+
+pp$8.parseThrowStatement = function(node) {
+  this.next();
+  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))
+    { this.raise(this.lastTokEnd, "Illegal newline after throw"); }
+  node.argument = this.parseExpression();
+  this.semicolon();
+  return this.finishNode(node, "ThrowStatement")
+};
+
+// Reused empty array added for node fields that are always empty.
+
+var empty$1 = [];
+
+pp$8.parseTryStatement = function(node) {
+  this.next();
+  node.block = this.parseBlock();
+  node.handler = null;
+  if (this.type === types$1._catch) {
+    var clause = this.startNode();
+    this.next();
+    if (this.eat(types$1.parenL)) {
+      clause.param = this.parseBindingAtom();
+      var simple = clause.param.type === "Identifier";
+      this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);
+      this.checkLValPattern(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);
+      this.expect(types$1.parenR);
+    } else {
+      if (this.options.ecmaVersion < 10) { this.unexpected(); }
+      clause.param = null;
+      this.enterScope(0);
+    }
+    clause.body = this.parseBlock(false);
+    this.exitScope();
+    node.handler = this.finishNode(clause, "CatchClause");
+  }
+  node.finalizer = this.eat(types$1._finally) ? this.parseBlock() : null;
+  if (!node.handler && !node.finalizer)
+    { this.raise(node.start, "Missing catch or finally clause"); }
+  return this.finishNode(node, "TryStatement")
+};
+
+pp$8.parseVarStatement = function(node, kind) {
+  this.next();
+  this.parseVar(node, false, kind);
+  this.semicolon();
+  return this.finishNode(node, "VariableDeclaration")
+};
+
+pp$8.parseWhileStatement = function(node) {
+  this.next();
+  node.test = this.parseParenExpression();
+  this.labels.push(loopLabel);
+  node.body = this.parseStatement("while");
+  this.labels.pop();
+  return this.finishNode(node, "WhileStatement")
+};
+
+pp$8.parseWithStatement = function(node) {
+  if (this.strict) { this.raise(this.start, "'with' in strict mode"); }
+  this.next();
+  node.object = this.parseParenExpression();
+  node.body = this.parseStatement("with");
+  return this.finishNode(node, "WithStatement")
+};
+
+pp$8.parseEmptyStatement = function(node) {
+  this.next();
+  return this.finishNode(node, "EmptyStatement")
+};
+
+pp$8.parseLabeledStatement = function(node, maybeName, expr, context) {
+  for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)
+    {
+    var label = list[i$1];
+
+    if (label.name === maybeName)
+      { this.raise(expr.start, "Label '" + maybeName + "' is already declared");
+  } }
+  var kind = this.type.isLoop ? "loop" : this.type === types$1._switch ? "switch" : null;
+  for (var i = this.labels.length - 1; i >= 0; i--) {
+    var label$1 = this.labels[i];
+    if (label$1.statementStart === node.start) {
+      // Update information about previous labels on this node
+      label$1.statementStart = this.start;
+      label$1.kind = kind;
+    } else { break }
+  }
+  this.labels.push({name: maybeName, kind: kind, statementStart: this.start});
+  node.body = this.parseStatement(context ? context.indexOf("label") === -1 ? context + "label" : context : "label");
+  this.labels.pop();
+  node.label = expr;
+  return this.finishNode(node, "LabeledStatement")
+};
+
+pp$8.parseExpressionStatement = function(node, expr) {
+  node.expression = expr;
+  this.semicolon();
+  return this.finishNode(node, "ExpressionStatement")
+};
+
+// Parse a semicolon-enclosed block of statements, handling `"use
+// strict"` declarations when `allowStrict` is true (used for
+// function bodies).
+
+pp$8.parseBlock = function(createNewLexicalScope, node, exitStrict) {
+  if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;
+  if ( node === void 0 ) node = this.startNode();
+
+  node.body = [];
+  this.expect(types$1.braceL);
+  if (createNewLexicalScope) { this.enterScope(0); }
+  while (this.type !== types$1.braceR) {
+    var stmt = this.parseStatement(null);
+    node.body.push(stmt);
+  }
+  if (exitStrict) { this.strict = false; }
+  this.next();
+  if (createNewLexicalScope) { this.exitScope(); }
+  return this.finishNode(node, "BlockStatement")
+};
+
+// Parse a regular `for` loop. The disambiguation code in
+// `parseStatement` will already have parsed the init statement or
+// expression.
+
+pp$8.parseFor = function(node, init) {
+  node.init = init;
+  this.expect(types$1.semi);
+  node.test = this.type === types$1.semi ? null : this.parseExpression();
+  this.expect(types$1.semi);
+  node.update = this.type === types$1.parenR ? null : this.parseExpression();
+  this.expect(types$1.parenR);
+  node.body = this.parseStatement("for");
+  this.exitScope();
+  this.labels.pop();
+  return this.finishNode(node, "ForStatement")
+};
+
+// Parse a `for`/`in` and `for`/`of` loop, which are almost
+// same from parser's perspective.
+
+pp$8.parseForIn = function(node, init) {
+  var isForIn = this.type === types$1._in;
+  this.next();
+
+  if (
+    init.type === "VariableDeclaration" &&
+    init.declarations[0].init != null &&
+    (
+      !isForIn ||
+      this.options.ecmaVersion < 8 ||
+      this.strict ||
+      init.kind !== "var" ||
+      init.declarations[0].id.type !== "Identifier"
+    )
+  ) {
+    this.raise(
+      init.start,
+      ((isForIn ? "for-in" : "for-of") + " loop variable declaration may not have an initializer")
+    );
+  }
+  node.left = init;
+  node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();
+  this.expect(types$1.parenR);
+  node.body = this.parseStatement("for");
+  this.exitScope();
+  this.labels.pop();
+  return this.finishNode(node, isForIn ? "ForInStatement" : "ForOfStatement")
+};
+
+// Parse a list of variable declarations.
+
+pp$8.parseVar = function(node, isFor, kind) {
+  node.declarations = [];
+  node.kind = kind;
+  for (;;) {
+    var decl = this.startNode();
+    this.parseVarId(decl, kind);
+    if (this.eat(types$1.eq)) {
+      decl.init = this.parseMaybeAssign(isFor);
+    } else if (kind === "const" && !(this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual("of")))) {
+      this.unexpected();
+    } else if (decl.id.type !== "Identifier" && !(isFor && (this.type === types$1._in || this.isContextual("of")))) {
+      this.raise(this.lastTokEnd, "Complex binding patterns require an initialization value");
+    } else {
+      decl.init = null;
+    }
+    node.declarations.push(this.finishNode(decl, "VariableDeclarator"));
+    if (!this.eat(types$1.comma)) { break }
+  }
+  return node
+};
+
+pp$8.parseVarId = function(decl, kind) {
+  decl.id = this.parseBindingAtom();
+  this.checkLValPattern(decl.id, kind === "var" ? BIND_VAR : BIND_LEXICAL, false);
+};
+
+var FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;
+
+// Parse a function declaration or literal (depending on the
+// `statement & FUNC_STATEMENT`).
+
+// Remove `allowExpressionBody` for 7.0.0, as it is only called with false
+pp$8.parseFunction = function(node, statement, allowExpressionBody, isAsync, forInit) {
+  this.initFunction(node);
+  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {
+    if (this.type === types$1.star && (statement & FUNC_HANGING_STATEMENT))
+      { this.unexpected(); }
+    node.generator = this.eat(types$1.star);
+  }
+  if (this.options.ecmaVersion >= 8)
+    { node.async = !!isAsync; }
+
+  if (statement & FUNC_STATEMENT) {
+    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types$1.name ? null : this.parseIdent();
+    if (node.id && !(statement & FUNC_HANGING_STATEMENT))
+      // If it is a regular function declaration in sloppy mode, then it is
+      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding
+      // mode depends on properties of the current scope (see
+      // treatFunctionsAsVar).
+      { this.checkLValSimple(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }
+  }
+
+  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+  this.yieldPos = 0;
+  this.awaitPos = 0;
+  this.awaitIdentPos = 0;
+  this.enterScope(functionFlags(node.async, node.generator));
+
+  if (!(statement & FUNC_STATEMENT))
+    { node.id = this.type === types$1.name ? this.parseIdent() : null; }
+
+  this.parseFunctionParams(node);
+  this.parseFunctionBody(node, allowExpressionBody, false, forInit);
+
+  this.yieldPos = oldYieldPos;
+  this.awaitPos = oldAwaitPos;
+  this.awaitIdentPos = oldAwaitIdentPos;
+  return this.finishNode(node, (statement & FUNC_STATEMENT) ? "FunctionDeclaration" : "FunctionExpression")
+};
+
+pp$8.parseFunctionParams = function(node) {
+  this.expect(types$1.parenL);
+  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);
+  this.checkYieldAwaitInDefaultParams();
+};
+
+// Parse a class declaration or literal (depending on the
+// `isStatement` parameter).
+
+pp$8.parseClass = function(node, isStatement) {
+  this.next();
+
+  // ecma-262 14.6 Class Definitions
+  // A class definition is always strict mode code.
+  var oldStrict = this.strict;
+  this.strict = true;
+
+  this.parseClassId(node, isStatement);
+  this.parseClassSuper(node);
+  var privateNameMap = this.enterClassBody();
+  var classBody = this.startNode();
+  var hadConstructor = false;
+  classBody.body = [];
+  this.expect(types$1.braceL);
+  while (this.type !== types$1.braceR) {
+    var element = this.parseClassElement(node.superClass !== null);
+    if (element) {
+      classBody.body.push(element);
+      if (element.type === "MethodDefinition" && element.kind === "constructor") {
+        if (hadConstructor) { this.raise(element.start, "Duplicate constructor in the same class"); }
+        hadConstructor = true;
+      } else if (element.key && element.key.type === "PrivateIdentifier" && isPrivateNameConflicted(privateNameMap, element)) {
+        this.raiseRecoverable(element.key.start, ("Identifier '#" + (element.key.name) + "' has already been declared"));
+      }
+    }
+  }
+  this.strict = oldStrict;
+  this.next();
+  node.body = this.finishNode(classBody, "ClassBody");
+  this.exitClassBody();
+  return this.finishNode(node, isStatement ? "ClassDeclaration" : "ClassExpression")
+};
+
+pp$8.parseClassElement = function(constructorAllowsSuper) {
+  if (this.eat(types$1.semi)) { return null }
+
+  var ecmaVersion = this.options.ecmaVersion;
+  var node = this.startNode();
+  var keyName = "";
+  var isGenerator = false;
+  var isAsync = false;
+  var kind = "method";
+  var isStatic = false;
+
+  if (this.eatContextual("static")) {
+    // Parse static init block
+    if (ecmaVersion >= 13 && this.eat(types$1.braceL)) {
+      this.parseClassStaticBlock(node);
+      return node
+    }
+    if (this.isClassElementNameStart() || this.type === types$1.star) {
+      isStatic = true;
+    } else {
+      keyName = "static";
+    }
+  }
+  node.static = isStatic;
+  if (!keyName && ecmaVersion >= 8 && this.eatContextual("async")) {
+    if ((this.isClassElementNameStart() || this.type === types$1.star) && !this.canInsertSemicolon()) {
+      isAsync = true;
+    } else {
+      keyName = "async";
+    }
+  }
+  if (!keyName && (ecmaVersion >= 9 || !isAsync) && this.eat(types$1.star)) {
+    isGenerator = true;
+  }
+  if (!keyName && !isAsync && !isGenerator) {
+    var lastValue = this.value;
+    if (this.eatContextual("get") || this.eatContextual("set")) {
+      if (this.isClassElementNameStart()) {
+        kind = lastValue;
+      } else {
+        keyName = lastValue;
+      }
+    }
+  }
+
+  // Parse element name
+  if (keyName) {
+    // 'async', 'get', 'set', or 'static' were not a keyword contextually.
+    // The last token is any of those. Make it the element name.
+    node.computed = false;
+    node.key = this.startNodeAt(this.lastTokStart, this.lastTokStartLoc);
+    node.key.name = keyName;
+    this.finishNode(node.key, "Identifier");
+  } else {
+    this.parseClassElementName(node);
+  }
+
+  // Parse element value
+  if (ecmaVersion < 13 || this.type === types$1.parenL || kind !== "method" || isGenerator || isAsync) {
+    var isConstructor = !node.static && checkKeyName(node, "constructor");
+    var allowsDirectSuper = isConstructor && constructorAllowsSuper;
+    // Couldn't move this check into the 'parseClassMethod' method for backward compatibility.
+    if (isConstructor && kind !== "method") { this.raise(node.key.start, "Constructor can't have get/set modifier"); }
+    node.kind = isConstructor ? "constructor" : kind;
+    this.parseClassMethod(node, isGenerator, isAsync, allowsDirectSuper);
+  } else {
+    this.parseClassField(node);
+  }
+
+  return node
+};
+
+pp$8.isClassElementNameStart = function() {
+  return (
+    this.type === types$1.name ||
+    this.type === types$1.privateId ||
+    this.type === types$1.num ||
+    this.type === types$1.string ||
+    this.type === types$1.bracketL ||
+    this.type.keyword
+  )
+};
+
+pp$8.parseClassElementName = function(element) {
+  if (this.type === types$1.privateId) {
+    if (this.value === "constructor") {
+      this.raise(this.start, "Classes can't have an element named '#constructor'");
+    }
+    element.computed = false;
+    element.key = this.parsePrivateIdent();
+  } else {
+    this.parsePropertyName(element);
+  }
+};
+
+pp$8.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {
+  // Check key and flags
+  var key = method.key;
+  if (method.kind === "constructor") {
+    if (isGenerator) { this.raise(key.start, "Constructor can't be a generator"); }
+    if (isAsync) { this.raise(key.start, "Constructor can't be an async method"); }
+  } else if (method.static && checkKeyName(method, "prototype")) {
+    this.raise(key.start, "Classes may not have a static property named prototype");
+  }
+
+  // Parse value
+  var value = method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);
+
+  // Check value
+  if (method.kind === "get" && value.params.length !== 0)
+    { this.raiseRecoverable(value.start, "getter should have no params"); }
+  if (method.kind === "set" && value.params.length !== 1)
+    { this.raiseRecoverable(value.start, "setter should have exactly one param"); }
+  if (method.kind === "set" && value.params[0].type === "RestElement")
+    { this.raiseRecoverable(value.params[0].start, "Setter cannot use rest params"); }
+
+  return this.finishNode(method, "MethodDefinition")
+};
+
+pp$8.parseClassField = function(field) {
+  if (checkKeyName(field, "constructor")) {
+    this.raise(field.key.start, "Classes can't have a field named 'constructor'");
+  } else if (field.static && checkKeyName(field, "prototype")) {
+    this.raise(field.key.start, "Classes can't have a static field named 'prototype'");
+  }
+
+  if (this.eat(types$1.eq)) {
+    // To raise SyntaxError if 'arguments' exists in the initializer.
+    var scope = this.currentThisScope();
+    var inClassFieldInit = scope.inClassFieldInit;
+    scope.inClassFieldInit = true;
+    field.value = this.parseMaybeAssign();
+    scope.inClassFieldInit = inClassFieldInit;
+  } else {
+    field.value = null;
+  }
+  this.semicolon();
+
+  return this.finishNode(field, "PropertyDefinition")
+};
+
+pp$8.parseClassStaticBlock = function(node) {
+  node.body = [];
+
+  var oldLabels = this.labels;
+  this.labels = [];
+  this.enterScope(SCOPE_CLASS_STATIC_BLOCK | SCOPE_SUPER);
+  while (this.type !== types$1.braceR) {
+    var stmt = this.parseStatement(null);
+    node.body.push(stmt);
+  }
+  this.next();
+  this.exitScope();
+  this.labels = oldLabels;
+
+  return this.finishNode(node, "StaticBlock")
+};
+
+pp$8.parseClassId = function(node, isStatement) {
+  if (this.type === types$1.name) {
+    node.id = this.parseIdent();
+    if (isStatement)
+      { this.checkLValSimple(node.id, BIND_LEXICAL, false); }
+  } else {
+    if (isStatement === true)
+      { this.unexpected(); }
+    node.id = null;
+  }
+};
+
+pp$8.parseClassSuper = function(node) {
+  node.superClass = this.eat(types$1._extends) ? this.parseExprSubscripts(false) : null;
+};
+
+pp$8.enterClassBody = function() {
+  var element = {declared: Object.create(null), used: []};
+  this.privateNameStack.push(element);
+  return element.declared
+};
+
+pp$8.exitClassBody = function() {
+  var ref = this.privateNameStack.pop();
+  var declared = ref.declared;
+  var used = ref.used;
+  var len = this.privateNameStack.length;
+  var parent = len === 0 ? null : this.privateNameStack[len - 1];
+  for (var i = 0; i < used.length; ++i) {
+    var id = used[i];
+    if (!hasOwn(declared, id.name)) {
+      if (parent) {
+        parent.used.push(id);
+      } else {
+        this.raiseRecoverable(id.start, ("Private field '#" + (id.name) + "' must be declared in an enclosing class"));
+      }
+    }
+  }
+};
+
+function isPrivateNameConflicted(privateNameMap, element) {
+  var name = element.key.name;
+  var curr = privateNameMap[name];
+
+  var next = "true";
+  if (element.type === "MethodDefinition" && (element.kind === "get" || element.kind === "set")) {
+    next = (element.static ? "s" : "i") + element.kind;
+  }
+
+  // `class { get #a(){}; static set #a(_){} }` is also conflict.
+  if (
+    curr === "iget" && next === "iset" ||
+    curr === "iset" && next === "iget" ||
+    curr === "sget" && next === "sset" ||
+    curr === "sset" && next === "sget"
+  ) {
+    privateNameMap[name] = "true";
+    return false
+  } else if (!curr) {
+    privateNameMap[name] = next;
+    return false
+  } else {
+    return true
+  }
+}
+
+function checkKeyName(node, name) {
+  var computed = node.computed;
+  var key = node.key;
+  return !computed && (
+    key.type === "Identifier" && key.name === name ||
+    key.type === "Literal" && key.value === name
+  )
+}
+
+// Parses module export declaration.
+
+pp$8.parseExport = function(node, exports) {
+  this.next();
+  // export * from '...'
+  if (this.eat(types$1.star)) {
+    if (this.options.ecmaVersion >= 11) {
+      if (this.eatContextual("as")) {
+        node.exported = this.parseModuleExportName();
+        this.checkExport(exports, node.exported.name, this.lastTokStart);
+      } else {
+        node.exported = null;
+      }
+    }
+    this.expectContextual("from");
+    if (this.type !== types$1.string) { this.unexpected(); }
+    node.source = this.parseExprAtom();
+    this.semicolon();
+    return this.finishNode(node, "ExportAllDeclaration")
+  }
+  if (this.eat(types$1._default)) { // export default ...
+    this.checkExport(exports, "default", this.lastTokStart);
+    var isAsync;
+    if (this.type === types$1._function || (isAsync = this.isAsyncFunction())) {
+      var fNode = this.startNode();
+      this.next();
+      if (isAsync) { this.next(); }
+      node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+    } else if (this.type === types$1._class) {
+      var cNode = this.startNode();
+      node.declaration = this.parseClass(cNode, "nullableID");
+    } else {
+      node.declaration = this.parseMaybeAssign();
+      this.semicolon();
+    }
+    return this.finishNode(node, "ExportDefaultDeclaration")
+  }
+  // export var|const|let|function|class ...
+  if (this.shouldParseExportStatement()) {
+    node.declaration = this.parseStatement(null);
+    if (node.declaration.type === "VariableDeclaration")
+      { this.checkVariableExport(exports, node.declaration.declarations); }
+    else
+      { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }
+    node.specifiers = [];
+    node.source = null;
+  } else { // export { x, y as z } [from '...']
+    node.declaration = null;
+    node.specifiers = this.parseExportSpecifiers(exports);
+    if (this.eatContextual("from")) {
+      if (this.type !== types$1.string) { this.unexpected(); }
+      node.source = this.parseExprAtom();
+    } else {
+      for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+        // check for keywords used as local names
+        var spec = list[i];
+
+        this.checkUnreserved(spec.local);
+        // check if export is defined
+        this.checkLocalExport(spec.local);
+
+        if (spec.local.type === "Literal") {
+          this.raise(spec.local.start, "A string literal cannot be used as an exported binding without `from`.");
+        }
+      }
+
+      node.source = null;
+    }
+    this.semicolon();
+  }
+  return this.finishNode(node, "ExportNamedDeclaration")
+};
+
+pp$8.checkExport = function(exports, name, pos) {
+  if (!exports) { return }
+  if (hasOwn(exports, name))
+    { this.raiseRecoverable(pos, "Duplicate export '" + name + "'"); }
+  exports[name] = true;
+};
+
+pp$8.checkPatternExport = function(exports, pat) {
+  var type = pat.type;
+  if (type === "Identifier")
+    { this.checkExport(exports, pat.name, pat.start); }
+  else if (type === "ObjectPattern")
+    { for (var i = 0, list = pat.properties; i < list.length; i += 1)
+      {
+        var prop = list[i];
+
+        this.checkPatternExport(exports, prop);
+      } }
+  else if (type === "ArrayPattern")
+    { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {
+      var elt = list$1[i$1];
+
+        if (elt) { this.checkPatternExport(exports, elt); }
+    } }
+  else if (type === "Property")
+    { this.checkPatternExport(exports, pat.value); }
+  else if (type === "AssignmentPattern")
+    { this.checkPatternExport(exports, pat.left); }
+  else if (type === "RestElement")
+    { this.checkPatternExport(exports, pat.argument); }
+  else if (type === "ParenthesizedExpression")
+    { this.checkPatternExport(exports, pat.expression); }
+};
+
+pp$8.checkVariableExport = function(exports, decls) {
+  if (!exports) { return }
+  for (var i = 0, list = decls; i < list.length; i += 1)
+    {
+    var decl = list[i];
+
+    this.checkPatternExport(exports, decl.id);
+  }
+};
+
+pp$8.shouldParseExportStatement = function() {
+  return this.type.keyword === "var" ||
+    this.type.keyword === "const" ||
+    this.type.keyword === "class" ||
+    this.type.keyword === "function" ||
+    this.isLet() ||
+    this.isAsyncFunction()
+};
+
+// Parses a comma-separated list of module exports.
+
+pp$8.parseExportSpecifiers = function(exports) {
+  var nodes = [], first = true;
+  // export { x, y as z } [from '...']
+  this.expect(types$1.braceL);
+  while (!this.eat(types$1.braceR)) {
+    if (!first) {
+      this.expect(types$1.comma);
+      if (this.afterTrailingComma(types$1.braceR)) { break }
+    } else { first = false; }
+
+    var node = this.startNode();
+    node.local = this.parseModuleExportName();
+    node.exported = this.eatContextual("as") ? this.parseModuleExportName() : node.local;
+    this.checkExport(
+      exports,
+      node.exported[node.exported.type === "Identifier" ? "name" : "value"],
+      node.exported.start
+    );
+    nodes.push(this.finishNode(node, "ExportSpecifier"));
+  }
+  return nodes
+};
+
+// Parses import declaration.
+
+pp$8.parseImport = function(node) {
+  this.next();
+  // import '...'
+  if (this.type === types$1.string) {
+    node.specifiers = empty$1;
+    node.source = this.parseExprAtom();
+  } else {
+    node.specifiers = this.parseImportSpecifiers();
+    this.expectContextual("from");
+    node.source = this.type === types$1.string ? this.parseExprAtom() : this.unexpected();
+  }
+  this.semicolon();
+  return this.finishNode(node, "ImportDeclaration")
+};
+
+// Parses a comma-separated list of module imports.
+
+pp$8.parseImportSpecifiers = function() {
+  var nodes = [], first = true;
+  if (this.type === types$1.name) {
+    // import defaultObj, { x, y as z } from '...'
+    var node = this.startNode();
+    node.local = this.parseIdent();
+    this.checkLValSimple(node.local, BIND_LEXICAL);
+    nodes.push(this.finishNode(node, "ImportDefaultSpecifier"));
+    if (!this.eat(types$1.comma)) { return nodes }
+  }
+  if (this.type === types$1.star) {
+    var node$1 = this.startNode();
+    this.next();
+    this.expectContextual("as");
+    node$1.local = this.parseIdent();
+    this.checkLValSimple(node$1.local, BIND_LEXICAL);
+    nodes.push(this.finishNode(node$1, "ImportNamespaceSpecifier"));
+    return nodes
+  }
+  this.expect(types$1.braceL);
+  while (!this.eat(types$1.braceR)) {
+    if (!first) {
+      this.expect(types$1.comma);
+      if (this.afterTrailingComma(types$1.braceR)) { break }
+    } else { first = false; }
+
+    var node$2 = this.startNode();
+    node$2.imported = this.parseModuleExportName();
+    if (this.eatContextual("as")) {
+      node$2.local = this.parseIdent();
+    } else {
+      this.checkUnreserved(node$2.imported);
+      node$2.local = node$2.imported;
+    }
+    this.checkLValSimple(node$2.local, BIND_LEXICAL);
+    nodes.push(this.finishNode(node$2, "ImportSpecifier"));
+  }
+  return nodes
+};
+
+pp$8.parseModuleExportName = function() {
+  if (this.options.ecmaVersion >= 13 && this.type === types$1.string) {
+    var stringLiteral = this.parseLiteral(this.value);
+    if (loneSurrogate.test(stringLiteral.value)) {
+      this.raise(stringLiteral.start, "An export name cannot include a lone surrogate.");
+    }
+    return stringLiteral
+  }
+  return this.parseIdent(true)
+};
+
+// Set `ExpressionStatement#directive` property for directive prologues.
+pp$8.adaptDirectivePrologue = function(statements) {
+  for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {
+    statements[i].directive = statements[i].expression.raw.slice(1, -1);
+  }
+};
+pp$8.isDirectiveCandidate = function(statement) {
+  return (
+    statement.type === "ExpressionStatement" &&
+    statement.expression.type === "Literal" &&
+    typeof statement.expression.value === "string" &&
+    // Reject parenthesized strings.
+    (this.input[statement.start] === "\"" || this.input[statement.start] === "'")
+  )
+};
+
+var pp$7 = Parser.prototype;
+
+// Convert existing expression atom to assignable pattern
+// if possible.
+
+pp$7.toAssignable = function(node, isBinding, refDestructuringErrors) {
+  if (this.options.ecmaVersion >= 6 && node) {
+    switch (node.type) {
+    case "Identifier":
+      if (this.inAsync && node.name === "await")
+        { this.raise(node.start, "Cannot use 'await' as identifier inside an async function"); }
+      break
+
+    case "ObjectPattern":
+    case "ArrayPattern":
+    case "AssignmentPattern":
+    case "RestElement":
+      break
+
+    case "ObjectExpression":
+      node.type = "ObjectPattern";
+      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+      for (var i = 0, list = node.properties; i < list.length; i += 1) {
+        var prop = list[i];
+
+      this.toAssignable(prop, isBinding);
+        // Early error:
+        //   AssignmentRestProperty[Yield, Await] :
+        //     `...` DestructuringAssignmentTarget[Yield, Await]
+        //
+        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.
+        if (
+          prop.type === "RestElement" &&
+          (prop.argument.type === "ArrayPattern" || prop.argument.type === "ObjectPattern")
+        ) {
+          this.raise(prop.argument.start, "Unexpected token");
+        }
+      }
+      break
+
+    case "Property":
+      // AssignmentProperty has type === "Property"
+      if (node.kind !== "init") { this.raise(node.key.start, "Object pattern can't contain getter or setter"); }
+      this.toAssignable(node.value, isBinding);
+      break
+
+    case "ArrayExpression":
+      node.type = "ArrayPattern";
+      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+      this.toAssignableList(node.elements, isBinding);
+      break
+
+    case "SpreadElement":
+      node.type = "RestElement";
+      this.toAssignable(node.argument, isBinding);
+      if (node.argument.type === "AssignmentPattern")
+        { this.raise(node.argument.start, "Rest elements cannot have a default value"); }
+      break
+
+    case "AssignmentExpression":
+      if (node.operator !== "=") { this.raise(node.left.end, "Only '=' operator can be used for specifying default value."); }
+      node.type = "AssignmentPattern";
+      delete node.operator;
+      this.toAssignable(node.left, isBinding);
+      break
+
+    case "ParenthesizedExpression":
+      this.toAssignable(node.expression, isBinding, refDestructuringErrors);
+      break
+
+    case "ChainExpression":
+      this.raiseRecoverable(node.start, "Optional chaining cannot appear in left-hand side");
+      break
+
+    case "MemberExpression":
+      if (!isBinding) { break }
+
+    default:
+      this.raise(node.start, "Assigning to rvalue");
+    }
+  } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+  return node
+};
+
+// Convert list of expression atoms to binding list.
+
+pp$7.toAssignableList = function(exprList, isBinding) {
+  var end = exprList.length;
+  for (var i = 0; i < end; i++) {
+    var elt = exprList[i];
+    if (elt) { this.toAssignable(elt, isBinding); }
+  }
+  if (end) {
+    var last = exprList[end - 1];
+    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === "RestElement" && last.argument.type !== "Identifier")
+      { this.unexpected(last.argument.start); }
+  }
+  return exprList
+};
+
+// Parses spread element.
+
+pp$7.parseSpread = function(refDestructuringErrors) {
+  var node = this.startNode();
+  this.next();
+  node.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+  return this.finishNode(node, "SpreadElement")
+};
+
+pp$7.parseRestBinding = function() {
+  var node = this.startNode();
+  this.next();
+
+  // RestElement inside of a function parameter must be an identifier
+  if (this.options.ecmaVersion === 6 && this.type !== types$1.name)
+    { this.unexpected(); }
+
+  node.argument = this.parseBindingAtom();
+
+  return this.finishNode(node, "RestElement")
+};
+
+// Parses lvalue (assignable) atom.
+
+pp$7.parseBindingAtom = function() {
+  if (this.options.ecmaVersion >= 6) {
+    switch (this.type) {
+    case types$1.bracketL:
+      var node = this.startNode();
+      this.next();
+      node.elements = this.parseBindingList(types$1.bracketR, true, true);
+      return this.finishNode(node, "ArrayPattern")
+
+    case types$1.braceL:
+      return this.parseObj(true)
+    }
+  }
+  return this.parseIdent()
+};
+
+pp$7.parseBindingList = function(close, allowEmpty, allowTrailingComma) {
+  var elts = [], first = true;
+  while (!this.eat(close)) {
+    if (first) { first = false; }
+    else { this.expect(types$1.comma); }
+    if (allowEmpty && this.type === types$1.comma) {
+      elts.push(null);
+    } else if (allowTrailingComma && this.afterTrailingComma(close)) {
+      break
+    } else if (this.type === types$1.ellipsis) {
+      var rest = this.parseRestBinding();
+      this.parseBindingListItem(rest);
+      elts.push(rest);
+      if (this.type === types$1.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+      this.expect(close);
+      break
+    } else {
+      var elem = this.parseMaybeDefault(this.start, this.startLoc);
+      this.parseBindingListItem(elem);
+      elts.push(elem);
+    }
+  }
+  return elts
+};
+
+pp$7.parseBindingListItem = function(param) {
+  return param
+};
+
+// Parses assignment pattern around given atom if possible.
+
+pp$7.parseMaybeDefault = function(startPos, startLoc, left) {
+  left = left || this.parseBindingAtom();
+  if (this.options.ecmaVersion < 6 || !this.eat(types$1.eq)) { return left }
+  var node = this.startNodeAt(startPos, startLoc);
+  node.left = left;
+  node.right = this.parseMaybeAssign();
+  return this.finishNode(node, "AssignmentPattern")
+};
+
+// The following three functions all verify that a node is an lvalue —
+// something that can be bound, or assigned to. In order to do so, they perform
+// a variety of checks:
+//
+// - Check that none of the bound/assigned-to identifiers are reserved words.
+// - Record name declarations for bindings in the appropriate scope.
+// - Check duplicate argument names, if checkClashes is set.
+//
+// If a complex binding pattern is encountered (e.g., object and array
+// destructuring), the entire pattern is recursively checked.
+//
+// There are three versions of checkLVal*() appropriate for different
+// circumstances:
+//
+// - checkLValSimple() shall be used if the syntactic construct supports
+//   nothing other than identifiers and member expressions. Parenthesized
+//   expressions are also correctly handled. This is generally appropriate for
+//   constructs for which the spec says
+//
+//   > It is a Syntax Error if AssignmentTargetType of [the production] is not
+//   > simple.
+//
+//   It is also appropriate for checking if an identifier is valid and not
+//   defined elsewhere, like import declarations or function/class identifiers.
+//
+//   Examples where this is used include:
+//     a += …;
+//     import a from '…';
+//   where a is the node to be checked.
+//
+// - checkLValPattern() shall be used if the syntactic construct supports
+//   anything checkLValSimple() supports, as well as object and array
+//   destructuring patterns. This is generally appropriate for constructs for
+//   which the spec says
+//
+//   > It is a Syntax Error if [the production] is neither an ObjectLiteral nor
+//   > an ArrayLiteral and AssignmentTargetType of [the production] is not
+//   > simple.
+//
+//   Examples where this is used include:
+//     (a = …);
+//     const a = …;
+//     try { … } catch (a) { … }
+//   where a is the node to be checked.
+//
+// - checkLValInnerPattern() shall be used if the syntactic construct supports
+//   anything checkLValPattern() supports, as well as default assignment
+//   patterns, rest elements, and other constructs that may appear within an
+//   object or array destructuring pattern.
+//
+//   As a special case, function parameters also use checkLValInnerPattern(),
+//   as they also support defaults and rest constructs.
+//
+// These functions deliberately support both assignment and binding constructs,
+// as the logic for both is exceedingly similar. If the node is the target of
+// an assignment, then bindingType should be set to BIND_NONE. Otherwise, it
+// should be set to the appropriate BIND_* constant, like BIND_VAR or
+// BIND_LEXICAL.
+//
+// If the function is called with a non-BIND_NONE bindingType, then
+// additionally a checkClashes object may be specified to allow checking for
+// duplicate argument names. checkClashes is ignored if the provided construct
+// is an assignment (i.e., bindingType is BIND_NONE).
+
+pp$7.checkLValSimple = function(expr, bindingType, checkClashes) {
+  if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+  var isBind = bindingType !== BIND_NONE;
+
+  switch (expr.type) {
+  case "Identifier":
+    if (this.strict && this.reservedWordsStrictBind.test(expr.name))
+      { this.raiseRecoverable(expr.start, (isBind ? "Binding " : "Assigning to ") + expr.name + " in strict mode"); }
+    if (isBind) {
+      if (bindingType === BIND_LEXICAL && expr.name === "let")
+        { this.raiseRecoverable(expr.start, "let is disallowed as a lexically bound name"); }
+      if (checkClashes) {
+        if (hasOwn(checkClashes, expr.name))
+          { this.raiseRecoverable(expr.start, "Argument name clash"); }
+        checkClashes[expr.name] = true;
+      }
+      if (bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }
+    }
+    break
+
+  case "ChainExpression":
+    this.raiseRecoverable(expr.start, "Optional chaining cannot appear in left-hand side");
+    break
+
+  case "MemberExpression":
+    if (isBind) { this.raiseRecoverable(expr.start, "Binding member expression"); }
+    break
+
+  case "ParenthesizedExpression":
+    if (isBind) { this.raiseRecoverable(expr.start, "Binding parenthesized expression"); }
+    return this.checkLValSimple(expr.expression, bindingType, checkClashes)
+
+  default:
+    this.raise(expr.start, (isBind ? "Binding" : "Assigning to") + " rvalue");
+  }
+};
+
+pp$7.checkLValPattern = function(expr, bindingType, checkClashes) {
+  if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+  switch (expr.type) {
+  case "ObjectPattern":
+    for (var i = 0, list = expr.properties; i < list.length; i += 1) {
+      var prop = list[i];
+
+    this.checkLValInnerPattern(prop, bindingType, checkClashes);
+    }
+    break
+
+  case "ArrayPattern":
+    for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {
+      var elem = list$1[i$1];
+
+    if (elem) { this.checkLValInnerPattern(elem, bindingType, checkClashes); }
+    }
+    break
+
+  default:
+    this.checkLValSimple(expr, bindingType, checkClashes);
+  }
+};
+
+pp$7.checkLValInnerPattern = function(expr, bindingType, checkClashes) {
+  if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+  switch (expr.type) {
+  case "Property":
+    // AssignmentProperty has type === "Property"
+    this.checkLValInnerPattern(expr.value, bindingType, checkClashes);
+    break
+
+  case "AssignmentPattern":
+    this.checkLValPattern(expr.left, bindingType, checkClashes);
+    break
+
+  case "RestElement":
+    this.checkLValPattern(expr.argument, bindingType, checkClashes);
+    break
+
+  default:
+    this.checkLValPattern(expr, bindingType, checkClashes);
+  }
+};
+
+// The algorithm used to determine whether a regexp can appear at a
+
+var TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {
+  this.token = token;
+  this.isExpr = !!isExpr;
+  this.preserveSpace = !!preserveSpace;
+  this.override = override;
+  this.generator = !!generator;
+};
+
+var types = {
+  b_stat: new TokContext("{", false),
+  b_expr: new TokContext("{", true),
+  b_tmpl: new TokContext("${", false),
+  p_stat: new TokContext("(", false),
+  p_expr: new TokContext("(", true),
+  q_tmpl: new TokContext("`", true, true, function (p) { return p.tryReadTemplateToken(); }),
+  f_stat: new TokContext("function", false),
+  f_expr: new TokContext("function", true),
+  f_expr_gen: new TokContext("function", true, false, null, true),
+  f_gen: new TokContext("function", false, false, null, true)
+};
+
+var pp$6 = Parser.prototype;
+
+pp$6.initialContext = function() {
+  return [types.b_stat]
+};
+
+pp$6.curContext = function() {
+  return this.context[this.context.length - 1]
+};
+
+pp$6.braceIsBlock = function(prevType) {
+  var parent = this.curContext();
+  if (parent === types.f_expr || parent === types.f_stat)
+    { return true }
+  if (prevType === types$1.colon && (parent === types.b_stat || parent === types.b_expr))
+    { return !parent.isExpr }
+
+  // The check for `tt.name && exprAllowed` detects whether we are
+  // after a `yield` or `of` construct. See the `updateContext` for
+  // `tt.name`.
+  if (prevType === types$1._return || prevType === types$1.name && this.exprAllowed)
+    { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }
+  if (prevType === types$1._else || prevType === types$1.semi || prevType === types$1.eof || prevType === types$1.parenR || prevType === types$1.arrow)
+    { return true }
+  if (prevType === types$1.braceL)
+    { return parent === types.b_stat }
+  if (prevType === types$1._var || prevType === types$1._const || prevType === types$1.name)
+    { return false }
+  return !this.exprAllowed
+};
+
+pp$6.inGeneratorContext = function() {
+  for (var i = this.context.length - 1; i >= 1; i--) {
+    var context = this.context[i];
+    if (context.token === "function")
+      { return context.generator }
+  }
+  return false
+};
+
+pp$6.updateContext = function(prevType) {
+  var update, type = this.type;
+  if (type.keyword && prevType === types$1.dot)
+    { this.exprAllowed = false; }
+  else if (update = type.updateContext)
+    { update.call(this, prevType); }
+  else
+    { this.exprAllowed = type.beforeExpr; }
+};
+
+// Used to handle egde case when token context could not be inferred correctly in tokenize phase
+pp$6.overrideContext = function(tokenCtx) {
+  if (this.curContext() !== tokenCtx) {
+    this.context[this.context.length - 1] = tokenCtx;
+  }
+};
+
+// Token-specific context update code
+
+types$1.parenR.updateContext = types$1.braceR.updateContext = function() {
+  if (this.context.length === 1) {
+    this.exprAllowed = true;
+    return
+  }
+  var out = this.context.pop();
+  if (out === types.b_stat && this.curContext().token === "function") {
+    out = this.context.pop();
+  }
+  this.exprAllowed = !out.isExpr;
+};
+
+types$1.braceL.updateContext = function(prevType) {
+  this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr);
+  this.exprAllowed = true;
+};
+
+types$1.dollarBraceL.updateContext = function() {
+  this.context.push(types.b_tmpl);
+  this.exprAllowed = true;
+};
+
+types$1.parenL.updateContext = function(prevType) {
+  var statementParens = prevType === types$1._if || prevType === types$1._for || prevType === types$1._with || prevType === types$1._while;
+  this.context.push(statementParens ? types.p_stat : types.p_expr);
+  this.exprAllowed = true;
+};
+
+types$1.incDec.updateContext = function() {
+  // tokExprAllowed stays unchanged
+};
+
+types$1._function.updateContext = types$1._class.updateContext = function(prevType) {
+  if (prevType.beforeExpr && prevType !== types$1._else &&
+      !(prevType === types$1.semi && this.curContext() !== types.p_stat) &&
+      !(prevType === types$1._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&
+      !((prevType === types$1.colon || prevType === types$1.braceL) && this.curContext() === types.b_stat))
+    { this.context.push(types.f_expr); }
+  else
+    { this.context.push(types.f_stat); }
+  this.exprAllowed = false;
+};
+
+types$1.backQuote.updateContext = function() {
+  if (this.curContext() === types.q_tmpl)
+    { this.context.pop(); }
+  else
+    { this.context.push(types.q_tmpl); }
+  this.exprAllowed = false;
+};
+
+types$1.star.updateContext = function(prevType) {
+  if (prevType === types$1._function) {
+    var index = this.context.length - 1;
+    if (this.context[index] === types.f_expr)
+      { this.context[index] = types.f_expr_gen; }
+    else
+      { this.context[index] = types.f_gen; }
+  }
+  this.exprAllowed = true;
+};
+
+types$1.name.updateContext = function(prevType) {
+  var allowed = false;
+  if (this.options.ecmaVersion >= 6 && prevType !== types$1.dot) {
+    if (this.value === "of" && !this.exprAllowed ||
+        this.value === "yield" && this.inGeneratorContext())
+      { allowed = true; }
+  }
+  this.exprAllowed = allowed;
+};
+
+// A recursive descent parser operates by defining functions for all
+
+var pp$5 = Parser.prototype;
+
+// Check if property name clashes with already added.
+// Object/class getters and setters are not allowed to clash —
+// either with each other or with an init property — and in
+// strict mode, init properties are also not allowed to be repeated.
+
+pp$5.checkPropClash = function(prop, propHash, refDestructuringErrors) {
+  if (this.options.ecmaVersion >= 9 && prop.type === "SpreadElement")
+    { return }
+  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))
+    { return }
+  var key = prop.key;
+  var name;
+  switch (key.type) {
+  case "Identifier": name = key.name; break
+  case "Literal": name = String(key.value); break
+  default: return
+  }
+  var kind = prop.kind;
+  if (this.options.ecmaVersion >= 6) {
+    if (name === "__proto__" && kind === "init") {
+      if (propHash.proto) {
+        if (refDestructuringErrors) {
+          if (refDestructuringErrors.doubleProto < 0) {
+            refDestructuringErrors.doubleProto = key.start;
+          }
+        } else {
+          this.raiseRecoverable(key.start, "Redefinition of __proto__ property");
+        }
+      }
+      propHash.proto = true;
+    }
+    return
+  }
+  name = "$" + name;
+  var other = propHash[name];
+  if (other) {
+    var redefinition;
+    if (kind === "init") {
+      redefinition = this.strict && other.init || other.get || other.set;
+    } else {
+      redefinition = other.init || other[kind];
+    }
+    if (redefinition)
+      { this.raiseRecoverable(key.start, "Redefinition of property"); }
+  } else {
+    other = propHash[name] = {
+      init: false,
+      get: false,
+      set: false
+    };
+  }
+  other[kind] = true;
+};
+
+// ### Expression parsing
+
+// These nest, from the most general expression type at the top to
+// 'atomic', nondivisible expression types at the bottom. Most of
+// the functions will simply let the function(s) below them parse,
+// and, *if* the syntactic construct they handle is present, wrap
+// the AST node that the inner parser gave them in another node.
+
+// Parse a full expression. The optional arguments are used to
+// forbid the `in` operator (in for loops initalization expressions)
+// and provide reference for storing '=' operator inside shorthand
+// property assignment in contexts where both object expression
+// and object pattern might appear (so it's possible to raise
+// delayed syntax error at correct position).
+
+pp$5.parseExpression = function(forInit, refDestructuringErrors) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseMaybeAssign(forInit, refDestructuringErrors);
+  if (this.type === types$1.comma) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.expressions = [expr];
+    while (this.eat(types$1.comma)) { node.expressions.push(this.parseMaybeAssign(forInit, refDestructuringErrors)); }
+    return this.finishNode(node, "SequenceExpression")
+  }
+  return expr
+};
+
+// Parse an assignment expression. This includes applications of
+// operators like `+=`.
+
+pp$5.parseMaybeAssign = function(forInit, refDestructuringErrors, afterLeftParse) {
+  if (this.isContextual("yield")) {
+    if (this.inGenerator) { return this.parseYield(forInit) }
+    // The tokenizer will assume an expression is allowed after
+    // `yield`, but this isn't that kind of yield
+    else { this.exprAllowed = false; }
+  }
+
+  var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldDoubleProto = -1;
+  if (refDestructuringErrors) {
+    oldParenAssign = refDestructuringErrors.parenthesizedAssign;
+    oldTrailingComma = refDestructuringErrors.trailingComma;
+    oldDoubleProto = refDestructuringErrors.doubleProto;
+    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1;
+  } else {
+    refDestructuringErrors = new DestructuringErrors;
+    ownDestructuringErrors = true;
+  }
+
+  var startPos = this.start, startLoc = this.startLoc;
+  if (this.type === types$1.parenL || this.type === types$1.name) {
+    this.potentialArrowAt = this.start;
+    this.potentialArrowInForAwait = forInit === "await";
+  }
+  var left = this.parseMaybeConditional(forInit, refDestructuringErrors);
+  if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }
+  if (this.type.isAssign) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.operator = this.value;
+    if (this.type === types$1.eq)
+      { left = this.toAssignable(left, false, refDestructuringErrors); }
+    if (!ownDestructuringErrors) {
+      refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.doubleProto = -1;
+    }
+    if (refDestructuringErrors.shorthandAssign >= left.start)
+      { refDestructuringErrors.shorthandAssign = -1; } // reset because shorthand default was used correctly
+    if (this.type === types$1.eq)
+      { this.checkLValPattern(left); }
+    else
+      { this.checkLValSimple(left); }
+    node.left = left;
+    this.next();
+    node.right = this.parseMaybeAssign(forInit);
+    if (oldDoubleProto > -1) { refDestructuringErrors.doubleProto = oldDoubleProto; }
+    return this.finishNode(node, "AssignmentExpression")
+  } else {
+    if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }
+  }
+  if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }
+  if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }
+  return left
+};
+
+// Parse a ternary conditional (`?:`) operator.
+
+pp$5.parseMaybeConditional = function(forInit, refDestructuringErrors) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseExprOps(forInit, refDestructuringErrors);
+  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+  if (this.eat(types$1.question)) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.test = expr;
+    node.consequent = this.parseMaybeAssign();
+    this.expect(types$1.colon);
+    node.alternate = this.parseMaybeAssign(forInit);
+    return this.finishNode(node, "ConditionalExpression")
+  }
+  return expr
+};
+
+// Start the precedence parser.
+
+pp$5.parseExprOps = function(forInit, refDestructuringErrors) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseMaybeUnary(refDestructuringErrors, false, false, forInit);
+  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+  return expr.start === startPos && expr.type === "ArrowFunctionExpression" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, forInit)
+};
+
+// Parse binary operators with the operator precedence parsing
+// algorithm. `left` is the left-hand side of the operator.
+// `minPrec` provides context that allows the function to stop and
+// defer further parser to one of its callers when it encounters an
+// operator that has a lower precedence than the set it is parsing.
+
+pp$5.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, forInit) {
+  var prec = this.type.binop;
+  if (prec != null && (!forInit || this.type !== types$1._in)) {
+    if (prec > minPrec) {
+      var logical = this.type === types$1.logicalOR || this.type === types$1.logicalAND;
+      var coalesce = this.type === types$1.coalesce;
+      if (coalesce) {
+        // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.
+        // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.
+        prec = types$1.logicalAND.binop;
+      }
+      var op = this.value;
+      this.next();
+      var startPos = this.start, startLoc = this.startLoc;
+      var right = this.parseExprOp(this.parseMaybeUnary(null, false, false, forInit), startPos, startLoc, prec, forInit);
+      var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical || coalesce);
+      if ((logical && this.type === types$1.coalesce) || (coalesce && (this.type === types$1.logicalOR || this.type === types$1.logicalAND))) {
+        this.raiseRecoverable(this.start, "Logical expressions and coalesce expressions cannot be mixed. Wrap either by parentheses");
+      }
+      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, forInit)
+    }
+  }
+  return left
+};
+
+pp$5.buildBinary = function(startPos, startLoc, left, right, op, logical) {
+  if (right.type === "PrivateIdentifier") { this.raise(right.start, "Private identifier can only be left side of binary expression"); }
+  var node = this.startNodeAt(startPos, startLoc);
+  node.left = left;
+  node.operator = op;
+  node.right = right;
+  return this.finishNode(node, logical ? "LogicalExpression" : "BinaryExpression")
+};
+
+// Parse unary operators, both prefix and postfix.
+
+pp$5.parseMaybeUnary = function(refDestructuringErrors, sawUnary, incDec, forInit) {
+  var startPos = this.start, startLoc = this.startLoc, expr;
+  if (this.isContextual("await") && this.canAwait) {
+    expr = this.parseAwait(forInit);
+    sawUnary = true;
+  } else if (this.type.prefix) {
+    var node = this.startNode(), update = this.type === types$1.incDec;
+    node.operator = this.value;
+    node.prefix = true;
+    this.next();
+    node.argument = this.parseMaybeUnary(null, true, update, forInit);
+    this.checkExpressionErrors(refDestructuringErrors, true);
+    if (update) { this.checkLValSimple(node.argument); }
+    else if (this.strict && node.operator === "delete" &&
+             node.argument.type === "Identifier")
+      { this.raiseRecoverable(node.start, "Deleting local variable in strict mode"); }
+    else if (node.operator === "delete" && isPrivateFieldAccess(node.argument))
+      { this.raiseRecoverable(node.start, "Private fields can not be deleted"); }
+    else { sawUnary = true; }
+    expr = this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
+  } else if (!sawUnary && this.type === types$1.privateId) {
+    if (forInit || this.privateNameStack.length === 0) { this.unexpected(); }
+    expr = this.parsePrivateIdent();
+    // only could be private fields in 'in', such as #x in obj
+    if (this.type !== types$1._in) { this.unexpected(); }
+  } else {
+    expr = this.parseExprSubscripts(refDestructuringErrors, forInit);
+    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+    while (this.type.postfix && !this.canInsertSemicolon()) {
+      var node$1 = this.startNodeAt(startPos, startLoc);
+      node$1.operator = this.value;
+      node$1.prefix = false;
+      node$1.argument = expr;
+      this.checkLValSimple(expr);
+      this.next();
+      expr = this.finishNode(node$1, "UpdateExpression");
+    }
+  }
+
+  if (!incDec && this.eat(types$1.starstar)) {
+    if (sawUnary)
+      { this.unexpected(this.lastTokStart); }
+    else
+      { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false, false, forInit), "**", false) }
+  } else {
+    return expr
+  }
+};
+
+function isPrivateFieldAccess(node) {
+  return (
+    node.type === "MemberExpression" && node.property.type === "PrivateIdentifier" ||
+    node.type === "ChainExpression" && isPrivateFieldAccess(node.expression)
+  )
+}
+
+// Parse call, dot, and `[]`-subscript expressions.
+
+pp$5.parseExprSubscripts = function(refDestructuringErrors, forInit) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseExprAtom(refDestructuringErrors, forInit);
+  if (expr.type === "ArrowFunctionExpression" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== ")")
+    { return expr }
+  var result = this.parseSubscripts(expr, startPos, startLoc, false, forInit);
+  if (refDestructuringErrors && result.type === "MemberExpression") {
+    if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }
+    if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }
+    if (refDestructuringErrors.trailingComma >= result.start) { refDestructuringErrors.trailingComma = -1; }
+  }
+  return result
+};
+
+pp$5.parseSubscripts = function(base, startPos, startLoc, noCalls, forInit) {
+  var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === "Identifier" && base.name === "async" &&
+      this.lastTokEnd === base.end && !this.canInsertSemicolon() && base.end - base.start === 5 &&
+      this.potentialArrowAt === base.start;
+  var optionalChained = false;
+
+  while (true) {
+    var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit);
+
+    if (element.optional) { optionalChained = true; }
+    if (element === base || element.type === "ArrowFunctionExpression") {
+      if (optionalChained) {
+        var chainNode = this.startNodeAt(startPos, startLoc);
+        chainNode.expression = element;
+        element = this.finishNode(chainNode, "ChainExpression");
+      }
+      return element
+    }
+
+    base = element;
+  }
+};
+
+pp$5.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit) {
+  var optionalSupported = this.options.ecmaVersion >= 11;
+  var optional = optionalSupported && this.eat(types$1.questionDot);
+  if (noCalls && optional) { this.raise(this.lastTokStart, "Optional chaining cannot appear in the callee of new expressions"); }
+
+  var computed = this.eat(types$1.bracketL);
+  if (computed || (optional && this.type !== types$1.parenL && this.type !== types$1.backQuote) || this.eat(types$1.dot)) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.object = base;
+    if (computed) {
+      node.property = this.parseExpression();
+      this.expect(types$1.bracketR);
+    } else if (this.type === types$1.privateId && base.type !== "Super") {
+      node.property = this.parsePrivateIdent();
+    } else {
+      node.property = this.parseIdent(this.options.allowReserved !== "never");
+    }
+    node.computed = !!computed;
+    if (optionalSupported) {
+      node.optional = optional;
+    }
+    base = this.finishNode(node, "MemberExpression");
+  } else if (!noCalls && this.eat(types$1.parenL)) {
+    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+    var exprList = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);
+    if (maybeAsyncArrow && !optional && !this.canInsertSemicolon() && this.eat(types$1.arrow)) {
+      this.checkPatternErrors(refDestructuringErrors, false);
+      this.checkYieldAwaitInDefaultParams();
+      if (this.awaitIdentPos > 0)
+        { this.raise(this.awaitIdentPos, "Cannot use 'await' as identifier inside an async function"); }
+      this.yieldPos = oldYieldPos;
+      this.awaitPos = oldAwaitPos;
+      this.awaitIdentPos = oldAwaitIdentPos;
+      return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true, forInit)
+    }
+    this.checkExpressionErrors(refDestructuringErrors, true);
+    this.yieldPos = oldYieldPos || this.yieldPos;
+    this.awaitPos = oldAwaitPos || this.awaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;
+    var node$1 = this.startNodeAt(startPos, startLoc);
+    node$1.callee = base;
+    node$1.arguments = exprList;
+    if (optionalSupported) {
+      node$1.optional = optional;
+    }
+    base = this.finishNode(node$1, "CallExpression");
+  } else if (this.type === types$1.backQuote) {
+    if (optional || optionalChained) {
+      this.raise(this.start, "Optional chaining cannot appear in the tag of tagged template expressions");
+    }
+    var node$2 = this.startNodeAt(startPos, startLoc);
+    node$2.tag = base;
+    node$2.quasi = this.parseTemplate({isTagged: true});
+    base = this.finishNode(node$2, "TaggedTemplateExpression");
+  }
+  return base
+};
+
+// Parse an atomic expression — either a single token that is an
+// expression, an expression started by a keyword like `function` or
+// `new`, or an expression wrapped in punctuation like `()`, `[]`,
+// or `{}`.
+
+pp$5.parseExprAtom = function(refDestructuringErrors, forInit) {
+  // If a division operator appears in an expression position, the
+  // tokenizer got confused, and we force it to read a regexp instead.
+  if (this.type === types$1.slash) { this.readRegexp(); }
+
+  var node, canBeArrow = this.potentialArrowAt === this.start;
+  switch (this.type) {
+  case types$1._super:
+    if (!this.allowSuper)
+      { this.raise(this.start, "'super' keyword outside a method"); }
+    node = this.startNode();
+    this.next();
+    if (this.type === types$1.parenL && !this.allowDirectSuper)
+      { this.raise(node.start, "super() call outside constructor of a subclass"); }
+    // The `super` keyword can appear at below:
+    // SuperProperty:
+    //     super [ Expression ]
+    //     super . IdentifierName
+    // SuperCall:
+    //     super ( Arguments )
+    if (this.type !== types$1.dot && this.type !== types$1.bracketL && this.type !== types$1.parenL)
+      { this.unexpected(); }
+    return this.finishNode(node, "Super")
+
+  case types$1._this:
+    node = this.startNode();
+    this.next();
+    return this.finishNode(node, "ThisExpression")
+
+  case types$1.name:
+    var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;
+    var id = this.parseIdent(false);
+    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === "async" && !this.canInsertSemicolon() && this.eat(types$1._function)) {
+      this.overrideContext(types.f_expr);
+      return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true, forInit)
+    }
+    if (canBeArrow && !this.canInsertSemicolon()) {
+      if (this.eat(types$1.arrow))
+        { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false, forInit) }
+      if (this.options.ecmaVersion >= 8 && id.name === "async" && this.type === types$1.name && !containsEsc &&
+          (!this.potentialArrowInForAwait || this.value !== "of" || this.containsEsc)) {
+        id = this.parseIdent(false);
+        if (this.canInsertSemicolon() || !this.eat(types$1.arrow))
+          { this.unexpected(); }
+        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true, forInit)
+      }
+    }
+    return id
+
+  case types$1.regexp:
+    var value = this.value;
+    node = this.parseLiteral(value.value);
+    node.regex = {pattern: value.pattern, flags: value.flags};
+    return node
+
+  case types$1.num: case types$1.string:
+    return this.parseLiteral(this.value)
+
+  case types$1._null: case types$1._true: case types$1._false:
+    node = this.startNode();
+    node.value = this.type === types$1._null ? null : this.type === types$1._true;
+    node.raw = this.type.keyword;
+    this.next();
+    return this.finishNode(node, "Literal")
+
+  case types$1.parenL:
+    var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow, forInit);
+    if (refDestructuringErrors) {
+      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))
+        { refDestructuringErrors.parenthesizedAssign = start; }
+      if (refDestructuringErrors.parenthesizedBind < 0)
+        { refDestructuringErrors.parenthesizedBind = start; }
+    }
+    return expr
+
+  case types$1.bracketL:
+    node = this.startNode();
+    this.next();
+    node.elements = this.parseExprList(types$1.bracketR, true, true, refDestructuringErrors);
+    return this.finishNode(node, "ArrayExpression")
+
+  case types$1.braceL:
+    this.overrideContext(types.b_expr);
+    return this.parseObj(false, refDestructuringErrors)
+
+  case types$1._function:
+    node = this.startNode();
+    this.next();
+    return this.parseFunction(node, 0)
+
+  case types$1._class:
+    return this.parseClass(this.startNode(), false)
+
+  case types$1._new:
+    return this.parseNew()
+
+  case types$1.backQuote:
+    return this.parseTemplate()
+
+  case types$1._import:
+    if (this.options.ecmaVersion >= 11) {
+      return this.parseExprImport()
+    } else {
+      return this.unexpected()
+    }
+
+  default:
+    this.unexpected();
+  }
+};
+
+pp$5.parseExprImport = function() {
+  var node = this.startNode();
+
+  // Consume `import` as an identifier for `import.meta`.
+  // Because `this.parseIdent(true)` doesn't check escape sequences, it needs the check of `this.containsEsc`.
+  if (this.containsEsc) { this.raiseRecoverable(this.start, "Escape sequence in keyword import"); }
+  var meta = this.parseIdent(true);
+
+  switch (this.type) {
+  case types$1.parenL:
+    return this.parseDynamicImport(node)
+  case types$1.dot:
+    node.meta = meta;
+    return this.parseImportMeta(node)
+  default:
+    this.unexpected();
+  }
+};
+
+pp$5.parseDynamicImport = function(node) {
+  this.next(); // skip `(`
+
+  // Parse node.source.
+  node.source = this.parseMaybeAssign();
+
+  // Verify ending.
+  if (!this.eat(types$1.parenR)) {
+    var errorPos = this.start;
+    if (this.eat(types$1.comma) && this.eat(types$1.parenR)) {
+      this.raiseRecoverable(errorPos, "Trailing comma is not allowed in import()");
+    } else {
+      this.unexpected(errorPos);
+    }
+  }
+
+  return this.finishNode(node, "ImportExpression")
+};
+
+pp$5.parseImportMeta = function(node) {
+  this.next(); // skip `.`
+
+  var containsEsc = this.containsEsc;
+  node.property = this.parseIdent(true);
+
+  if (node.property.name !== "meta")
+    { this.raiseRecoverable(node.property.start, "The only valid meta property for import is 'import.meta'"); }
+  if (containsEsc)
+    { this.raiseRecoverable(node.start, "'import.meta' must not contain escaped characters"); }
+  if (this.options.sourceType !== "module" && !this.options.allowImportExportEverywhere)
+    { this.raiseRecoverable(node.start, "Cannot use 'import.meta' outside a module"); }
+
+  return this.finishNode(node, "MetaProperty")
+};
+
+pp$5.parseLiteral = function(value) {
+  var node = this.startNode();
+  node.value = value;
+  node.raw = this.input.slice(this.start, this.end);
+  if (node.raw.charCodeAt(node.raw.length - 1) === 110) { node.bigint = node.raw.slice(0, -1).replace(/_/g, ""); }
+  this.next();
+  return this.finishNode(node, "Literal")
+};
+
+pp$5.parseParenExpression = function() {
+  this.expect(types$1.parenL);
+  var val = this.parseExpression();
+  this.expect(types$1.parenR);
+  return val
+};
+
+pp$5.parseParenAndDistinguishExpression = function(canBeArrow, forInit) {
+  var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;
+  if (this.options.ecmaVersion >= 6) {
+    this.next();
+
+    var innerStartPos = this.start, innerStartLoc = this.startLoc;
+    var exprList = [], first = true, lastIsComma = false;
+    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    // Do not save awaitIdentPos to allow checking awaits nested in parameters
+    while (this.type !== types$1.parenR) {
+      first ? first = false : this.expect(types$1.comma);
+      if (allowTrailingComma && this.afterTrailingComma(types$1.parenR, true)) {
+        lastIsComma = true;
+        break
+      } else if (this.type === types$1.ellipsis) {
+        spreadStart = this.start;
+        exprList.push(this.parseParenItem(this.parseRestBinding()));
+        if (this.type === types$1.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+        break
+      } else {
+        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));
+      }
+    }
+    var innerEndPos = this.lastTokEnd, innerEndLoc = this.lastTokEndLoc;
+    this.expect(types$1.parenR);
+
+    if (canBeArrow && !this.canInsertSemicolon() && this.eat(types$1.arrow)) {
+      this.checkPatternErrors(refDestructuringErrors, false);
+      this.checkYieldAwaitInDefaultParams();
+      this.yieldPos = oldYieldPos;
+      this.awaitPos = oldAwaitPos;
+      return this.parseParenArrowList(startPos, startLoc, exprList, forInit)
+    }
+
+    if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }
+    if (spreadStart) { this.unexpected(spreadStart); }
+    this.checkExpressionErrors(refDestructuringErrors, true);
+    this.yieldPos = oldYieldPos || this.yieldPos;
+    this.awaitPos = oldAwaitPos || this.awaitPos;
+
+    if (exprList.length > 1) {
+      val = this.startNodeAt(innerStartPos, innerStartLoc);
+      val.expressions = exprList;
+      this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc);
+    } else {
+      val = exprList[0];
+    }
+  } else {
+    val = this.parseParenExpression();
+  }
+
+  if (this.options.preserveParens) {
+    var par = this.startNodeAt(startPos, startLoc);
+    par.expression = val;
+    return this.finishNode(par, "ParenthesizedExpression")
+  } else {
+    return val
+  }
+};
+
+pp$5.parseParenItem = function(item) {
+  return item
+};
+
+pp$5.parseParenArrowList = function(startPos, startLoc, exprList, forInit) {
+  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, false, forInit)
+};
+
+// New's precedence is slightly tricky. It must allow its argument to
+// be a `[]` or dot subscript expression, but not a call — at least,
+// not without wrapping it in parentheses. Thus, it uses the noCalls
+// argument to parseSubscripts to prevent it from consuming the
+// argument list.
+
+var empty = [];
+
+pp$5.parseNew = function() {
+  if (this.containsEsc) { this.raiseRecoverable(this.start, "Escape sequence in keyword new"); }
+  var node = this.startNode();
+  var meta = this.parseIdent(true);
+  if (this.options.ecmaVersion >= 6 && this.eat(types$1.dot)) {
+    node.meta = meta;
+    var containsEsc = this.containsEsc;
+    node.property = this.parseIdent(true);
+    if (node.property.name !== "target")
+      { this.raiseRecoverable(node.property.start, "The only valid meta property for new is 'new.target'"); }
+    if (containsEsc)
+      { this.raiseRecoverable(node.start, "'new.target' must not contain escaped characters"); }
+    if (!this.allowNewDotTarget)
+      { this.raiseRecoverable(node.start, "'new.target' can only be used in functions and class static block"); }
+    return this.finishNode(node, "MetaProperty")
+  }
+  var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types$1._import;
+  node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true, false);
+  if (isImport && node.callee.type === "ImportExpression") {
+    this.raise(startPos, "Cannot use new with import()");
+  }
+  if (this.eat(types$1.parenL)) { node.arguments = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false); }
+  else { node.arguments = empty; }
+  return this.finishNode(node, "NewExpression")
+};
+
+// Parse template expression.
+
+pp$5.parseTemplateElement = function(ref) {
+  var isTagged = ref.isTagged;
+
+  var elem = this.startNode();
+  if (this.type === types$1.invalidTemplate) {
+    if (!isTagged) {
+      this.raiseRecoverable(this.start, "Bad escape sequence in untagged template literal");
+    }
+    elem.value = {
+      raw: this.value,
+      cooked: null
+    };
+  } else {
+    elem.value = {
+      raw: this.input.slice(this.start, this.end).replace(/\r\n?/g, "\n"),
+      cooked: this.value
+    };
+  }
+  this.next();
+  elem.tail = this.type === types$1.backQuote;
+  return this.finishNode(elem, "TemplateElement")
+};
+
+pp$5.parseTemplate = function(ref) {
+  if ( ref === void 0 ) ref = {};
+  var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;
+
+  var node = this.startNode();
+  this.next();
+  node.expressions = [];
+  var curElt = this.parseTemplateElement({isTagged: isTagged});
+  node.quasis = [curElt];
+  while (!curElt.tail) {
+    if (this.type === types$1.eof) { this.raise(this.pos, "Unterminated template literal"); }
+    this.expect(types$1.dollarBraceL);
+    node.expressions.push(this.parseExpression());
+    this.expect(types$1.braceR);
+    node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));
+  }
+  this.next();
+  return this.finishNode(node, "TemplateLiteral")
+};
+
+pp$5.isAsyncProp = function(prop) {
+  return !prop.computed && prop.key.type === "Identifier" && prop.key.name === "async" &&
+    (this.type === types$1.name || this.type === types$1.num || this.type === types$1.string || this.type === types$1.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types$1.star)) &&
+    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+};
+
+// Parse an object literal or binding pattern.
+
+pp$5.parseObj = function(isPattern, refDestructuringErrors) {
+  var node = this.startNode(), first = true, propHash = {};
+  node.properties = [];
+  this.next();
+  while (!this.eat(types$1.braceR)) {
+    if (!first) {
+      this.expect(types$1.comma);
+      if (this.options.ecmaVersion >= 5 && this.afterTrailingComma(types$1.braceR)) { break }
+    } else { first = false; }
+
+    var prop = this.parseProperty(isPattern, refDestructuringErrors);
+    if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }
+    node.properties.push(prop);
+  }
+  return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression")
+};
+
+pp$5.parseProperty = function(isPattern, refDestructuringErrors) {
+  var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;
+  if (this.options.ecmaVersion >= 9 && this.eat(types$1.ellipsis)) {
+    if (isPattern) {
+      prop.argument = this.parseIdent(false);
+      if (this.type === types$1.comma) {
+        this.raise(this.start, "Comma is not permitted after the rest element");
+      }
+      return this.finishNode(prop, "RestElement")
+    }
+    // To disallow parenthesized identifier via `this.toAssignable()`.
+    if (this.type === types$1.parenL && refDestructuringErrors) {
+      if (refDestructuringErrors.parenthesizedAssign < 0) {
+        refDestructuringErrors.parenthesizedAssign = this.start;
+      }
+      if (refDestructuringErrors.parenthesizedBind < 0) {
+        refDestructuringErrors.parenthesizedBind = this.start;
+      }
+    }
+    // Parse argument.
+    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+    // To disallow trailing comma via `this.toAssignable()`.
+    if (this.type === types$1.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {
+      refDestructuringErrors.trailingComma = this.start;
+    }
+    // Finish
+    return this.finishNode(prop, "SpreadElement")
+  }
+  if (this.options.ecmaVersion >= 6) {
+    prop.method = false;
+    prop.shorthand = false;
+    if (isPattern || refDestructuringErrors) {
+      startPos = this.start;
+      startLoc = this.startLoc;
+    }
+    if (!isPattern)
+      { isGenerator = this.eat(types$1.star); }
+  }
+  var containsEsc = this.containsEsc;
+  this.parsePropertyName(prop);
+  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {
+    isAsync = true;
+    isGenerator = this.options.ecmaVersion >= 9 && this.eat(types$1.star);
+    this.parsePropertyName(prop, refDestructuringErrors);
+  } else {
+    isAsync = false;
+  }
+  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);
+  return this.finishNode(prop, "Property")
+};
+
+pp$5.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {
+  if ((isGenerator || isAsync) && this.type === types$1.colon)
+    { this.unexpected(); }
+
+  if (this.eat(types$1.colon)) {
+    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);
+    prop.kind = "init";
+  } else if (this.options.ecmaVersion >= 6 && this.type === types$1.parenL) {
+    if (isPattern) { this.unexpected(); }
+    prop.kind = "init";
+    prop.method = true;
+    prop.value = this.parseMethod(isGenerator, isAsync);
+  } else if (!isPattern && !containsEsc &&
+             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === "Identifier" &&
+             (prop.key.name === "get" || prop.key.name === "set") &&
+             (this.type !== types$1.comma && this.type !== types$1.braceR && this.type !== types$1.eq)) {
+    if (isGenerator || isAsync) { this.unexpected(); }
+    prop.kind = prop.key.name;
+    this.parsePropertyName(prop);
+    prop.value = this.parseMethod(false);
+    var paramCount = prop.kind === "get" ? 0 : 1;
+    if (prop.value.params.length !== paramCount) {
+      var start = prop.value.start;
+      if (prop.kind === "get")
+        { this.raiseRecoverable(start, "getter should have no params"); }
+      else
+        { this.raiseRecoverable(start, "setter should have exactly one param"); }
+    } else {
+      if (prop.kind === "set" && prop.value.params[0].type === "RestElement")
+        { this.raiseRecoverable(prop.value.params[0].start, "Setter cannot use rest params"); }
+    }
+  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === "Identifier") {
+    if (isGenerator || isAsync) { this.unexpected(); }
+    this.checkUnreserved(prop.key);
+    if (prop.key.name === "await" && !this.awaitIdentPos)
+      { this.awaitIdentPos = startPos; }
+    prop.kind = "init";
+    if (isPattern) {
+      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));
+    } else if (this.type === types$1.eq && refDestructuringErrors) {
+      if (refDestructuringErrors.shorthandAssign < 0)
+        { refDestructuringErrors.shorthandAssign = this.start; }
+      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));
+    } else {
+      prop.value = this.copyNode(prop.key);
+    }
+    prop.shorthand = true;
+  } else { this.unexpected(); }
+};
+
+pp$5.parsePropertyName = function(prop) {
+  if (this.options.ecmaVersion >= 6) {
+    if (this.eat(types$1.bracketL)) {
+      prop.computed = true;
+      prop.key = this.parseMaybeAssign();
+      this.expect(types$1.bracketR);
+      return prop.key
+    } else {
+      prop.computed = false;
+    }
+  }
+  return prop.key = this.type === types$1.num || this.type === types$1.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== "never")
+};
+
+// Initialize empty function node.
+
+pp$5.initFunction = function(node) {
+  node.id = null;
+  if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }
+  if (this.options.ecmaVersion >= 8) { node.async = false; }
+};
+
+// Parse object or class method.
+
+pp$5.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {
+  var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+  this.initFunction(node);
+  if (this.options.ecmaVersion >= 6)
+    { node.generator = isGenerator; }
+  if (this.options.ecmaVersion >= 8)
+    { node.async = !!isAsync; }
+
+  this.yieldPos = 0;
+  this.awaitPos = 0;
+  this.awaitIdentPos = 0;
+  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));
+
+  this.expect(types$1.parenL);
+  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);
+  this.checkYieldAwaitInDefaultParams();
+  this.parseFunctionBody(node, false, true, false);
+
+  this.yieldPos = oldYieldPos;
+  this.awaitPos = oldAwaitPos;
+  this.awaitIdentPos = oldAwaitIdentPos;
+  return this.finishNode(node, "FunctionExpression")
+};
+
+// Parse arrow function expression with given parameters.
+
+pp$5.parseArrowExpression = function(node, params, isAsync, forInit) {
+  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);
+  this.initFunction(node);
+  if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }
+
+  this.yieldPos = 0;
+  this.awaitPos = 0;
+  this.awaitIdentPos = 0;
+
+  node.params = this.toAssignableList(params, true);
+  this.parseFunctionBody(node, true, false, forInit);
+
+  this.yieldPos = oldYieldPos;
+  this.awaitPos = oldAwaitPos;
+  this.awaitIdentPos = oldAwaitIdentPos;
+  return this.finishNode(node, "ArrowFunctionExpression")
+};
+
+// Parse function body and check parameters.
+
+pp$5.parseFunctionBody = function(node, isArrowFunction, isMethod, forInit) {
+  var isExpression = isArrowFunction && this.type !== types$1.braceL;
+  var oldStrict = this.strict, useStrict = false;
+
+  if (isExpression) {
+    node.body = this.parseMaybeAssign(forInit);
+    node.expression = true;
+    this.checkParams(node, false);
+  } else {
+    var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);
+    if (!oldStrict || nonSimple) {
+      useStrict = this.strictDirective(this.end);
+      // If this is a strict mode function, verify that argument names
+      // are not repeated, and it does not try to bind the words `eval`
+      // or `arguments`.
+      if (useStrict && nonSimple)
+        { this.raiseRecoverable(node.start, "Illegal 'use strict' directive in function with non-simple parameter list"); }
+    }
+    // Start a new scope with regard to labels and the `inFunction`
+    // flag (restore them to their old value afterwards).
+    var oldLabels = this.labels;
+    this.labels = [];
+    if (useStrict) { this.strict = true; }
+
+    // Add the params to varDeclaredNames to ensure that an error is thrown
+    // if a let/const declaration in the function clashes with one of the params.
+    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));
+    // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'
+    if (this.strict && node.id) { this.checkLValSimple(node.id, BIND_OUTSIDE); }
+    node.body = this.parseBlock(false, undefined, useStrict && !oldStrict);
+    node.expression = false;
+    this.adaptDirectivePrologue(node.body.body);
+    this.labels = oldLabels;
+  }
+  this.exitScope();
+};
+
+pp$5.isSimpleParamList = function(params) {
+  for (var i = 0, list = params; i < list.length; i += 1)
+    {
+    var param = list[i];
+
+    if (param.type !== "Identifier") { return false
+  } }
+  return true
+};
+
+// Checks function params for various disallowed patterns such as using "eval"
+// or "arguments" and duplicate parameters.
+
+pp$5.checkParams = function(node, allowDuplicates) {
+  var nameHash = Object.create(null);
+  for (var i = 0, list = node.params; i < list.length; i += 1)
+    {
+    var param = list[i];
+
+    this.checkLValInnerPattern(param, BIND_VAR, allowDuplicates ? null : nameHash);
+  }
+};
+
+// Parses a comma-separated list of expressions, and returns them as
+// an array. `close` is the token type that ends the list, and
+// `allowEmpty` can be turned on to allow subsequent commas with
+// nothing in between them to be parsed as `null` (which is needed
+// for array literals).
+
+pp$5.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {
+  var elts = [], first = true;
+  while (!this.eat(close)) {
+    if (!first) {
+      this.expect(types$1.comma);
+      if (allowTrailingComma && this.afterTrailingComma(close)) { break }
+    } else { first = false; }
+
+    var elt = (void 0);
+    if (allowEmpty && this.type === types$1.comma)
+      { elt = null; }
+    else if (this.type === types$1.ellipsis) {
+      elt = this.parseSpread(refDestructuringErrors);
+      if (refDestructuringErrors && this.type === types$1.comma && refDestructuringErrors.trailingComma < 0)
+        { refDestructuringErrors.trailingComma = this.start; }
+    } else {
+      elt = this.parseMaybeAssign(false, refDestructuringErrors);
+    }
+    elts.push(elt);
+  }
+  return elts
+};
+
+pp$5.checkUnreserved = function(ref) {
+  var start = ref.start;
+  var end = ref.end;
+  var name = ref.name;
+
+  if (this.inGenerator && name === "yield")
+    { this.raiseRecoverable(start, "Cannot use 'yield' as identifier inside a generator"); }
+  if (this.inAsync && name === "await")
+    { this.raiseRecoverable(start, "Cannot use 'await' as identifier inside an async function"); }
+  if (this.currentThisScope().inClassFieldInit && name === "arguments")
+    { this.raiseRecoverable(start, "Cannot use 'arguments' in class field initializer"); }
+  if (this.inClassStaticBlock && (name === "arguments" || name === "await"))
+    { this.raise(start, ("Cannot use " + name + " in class static initialization block")); }
+  if (this.keywords.test(name))
+    { this.raise(start, ("Unexpected keyword '" + name + "'")); }
+  if (this.options.ecmaVersion < 6 &&
+    this.input.slice(start, end).indexOf("\\") !== -1) { return }
+  var re = this.strict ? this.reservedWordsStrict : this.reservedWords;
+  if (re.test(name)) {
+    if (!this.inAsync && name === "await")
+      { this.raiseRecoverable(start, "Cannot use keyword 'await' outside an async function"); }
+    this.raiseRecoverable(start, ("The keyword '" + name + "' is reserved"));
+  }
+};
+
+// Parse the next token as an identifier. If `liberal` is true (used
+// when parsing properties), it will also convert keywords into
+// identifiers.
+
+pp$5.parseIdent = function(liberal, isBinding) {
+  var node = this.startNode();
+  if (this.type === types$1.name) {
+    node.name = this.value;
+  } else if (this.type.keyword) {
+    node.name = this.type.keyword;
+
+    // To fix https://github.com/acornjs/acorn/issues/575
+    // `class` and `function` keywords push new context into this.context.
+    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.
+    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword
+    if ((node.name === "class" || node.name === "function") &&
+        (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {
+      this.context.pop();
+    }
+  } else {
+    this.unexpected();
+  }
+  this.next(!!liberal);
+  this.finishNode(node, "Identifier");
+  if (!liberal) {
+    this.checkUnreserved(node);
+    if (node.name === "await" && !this.awaitIdentPos)
+      { this.awaitIdentPos = node.start; }
+  }
+  return node
+};
+
+pp$5.parsePrivateIdent = function() {
+  var node = this.startNode();
+  if (this.type === types$1.privateId) {
+    node.name = this.value;
+  } else {
+    this.unexpected();
+  }
+  this.next();
+  this.finishNode(node, "PrivateIdentifier");
+
+  // For validating existence
+  if (this.privateNameStack.length === 0) {
+    this.raise(node.start, ("Private field '#" + (node.name) + "' must be declared in an enclosing class"));
+  } else {
+    this.privateNameStack[this.privateNameStack.length - 1].used.push(node);
+  }
+
+  return node
+};
+
+// Parses yield expression inside generator.
+
+pp$5.parseYield = function(forInit) {
+  if (!this.yieldPos) { this.yieldPos = this.start; }
+
+  var node = this.startNode();
+  this.next();
+  if (this.type === types$1.semi || this.canInsertSemicolon() || (this.type !== types$1.star && !this.type.startsExpr)) {
+    node.delegate = false;
+    node.argument = null;
+  } else {
+    node.delegate = this.eat(types$1.star);
+    node.argument = this.parseMaybeAssign(forInit);
+  }
+  return this.finishNode(node, "YieldExpression")
+};
+
+pp$5.parseAwait = function(forInit) {
+  if (!this.awaitPos) { this.awaitPos = this.start; }
+
+  var node = this.startNode();
+  this.next();
+  node.argument = this.parseMaybeUnary(null, true, false, forInit);
+  return this.finishNode(node, "AwaitExpression")
+};
+
+var pp$4 = Parser.prototype;
+
+// This function is used to raise exceptions on parse errors. It
+// takes an offset integer (into the current `input`) to indicate
+// the location of the error, attaches the position to the end
+// of the error message, and then raises a `SyntaxError` with that
+// message.
+
+pp$4.raise = function(pos, message) {
+  var loc = getLineInfo(this.input, pos);
+  message += " (" + loc.line + ":" + loc.column + ")";
+  var err = new SyntaxError(message);
+  err.pos = pos; err.loc = loc; err.raisedAt = this.pos;
+  throw err
+};
+
+pp$4.raiseRecoverable = pp$4.raise;
+
+pp$4.curPosition = function() {
+  if (this.options.locations) {
+    return new Position(this.curLine, this.pos - this.lineStart)
+  }
+};
+
+var pp$3 = Parser.prototype;
+
+var Scope = function Scope(flags) {
+  this.flags = flags;
+  // A list of var-declared names in the current lexical scope
+  this.var = [];
+  // A list of lexically-declared names in the current lexical scope
+  this.lexical = [];
+  // A list of lexically-declared FunctionDeclaration names in the current lexical scope
+  this.functions = [];
+  // A switch to disallow the identifier reference 'arguments'
+  this.inClassFieldInit = false;
+};
+
+// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.
+
+pp$3.enterScope = function(flags) {
+  this.scopeStack.push(new Scope(flags));
+};
+
+pp$3.exitScope = function() {
+  this.scopeStack.pop();
+};
+
+// The spec says:
+// > At the top level of a function, or script, function declarations are
+// > treated like var declarations rather than like lexical declarations.
+pp$3.treatFunctionsAsVarInScope = function(scope) {
+  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)
+};
+
+pp$3.declareName = function(name, bindingType, pos) {
+  var redeclared = false;
+  if (bindingType === BIND_LEXICAL) {
+    var scope = this.currentScope();
+    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;
+    scope.lexical.push(name);
+    if (this.inModule && (scope.flags & SCOPE_TOP))
+      { delete this.undefinedExports[name]; }
+  } else if (bindingType === BIND_SIMPLE_CATCH) {
+    var scope$1 = this.currentScope();
+    scope$1.lexical.push(name);
+  } else if (bindingType === BIND_FUNCTION) {
+    var scope$2 = this.currentScope();
+    if (this.treatFunctionsAsVar)
+      { redeclared = scope$2.lexical.indexOf(name) > -1; }
+    else
+      { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }
+    scope$2.functions.push(name);
+  } else {
+    for (var i = this.scopeStack.length - 1; i >= 0; --i) {
+      var scope$3 = this.scopeStack[i];
+      if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||
+          !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {
+        redeclared = true;
+        break
+      }
+      scope$3.var.push(name);
+      if (this.inModule && (scope$3.flags & SCOPE_TOP))
+        { delete this.undefinedExports[name]; }
+      if (scope$3.flags & SCOPE_VAR) { break }
+    }
+  }
+  if (redeclared) { this.raiseRecoverable(pos, ("Identifier '" + name + "' has already been declared")); }
+};
+
+pp$3.checkLocalExport = function(id) {
+  // scope.functions must be empty as Module code is always strict.
+  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&
+      this.scopeStack[0].var.indexOf(id.name) === -1) {
+    this.undefinedExports[id.name] = id;
+  }
+};
+
+pp$3.currentScope = function() {
+  return this.scopeStack[this.scopeStack.length - 1]
+};
+
+pp$3.currentVarScope = function() {
+  for (var i = this.scopeStack.length - 1;; i--) {
+    var scope = this.scopeStack[i];
+    if (scope.flags & SCOPE_VAR) { return scope }
+  }
+};
+
+// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.
+pp$3.currentThisScope = function() {
+  for (var i = this.scopeStack.length - 1;; i--) {
+    var scope = this.scopeStack[i];
+    if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) { return scope }
+  }
+};
+
+var Node = function Node(parser, pos, loc) {
+  this.type = "";
+  this.start = pos;
+  this.end = 0;
+  if (parser.options.locations)
+    { this.loc = new SourceLocation(parser, loc); }
+  if (parser.options.directSourceFile)
+    { this.sourceFile = parser.options.directSourceFile; }
+  if (parser.options.ranges)
+    { this.range = [pos, 0]; }
+};
+
+// Start an AST node, attaching a start offset.
+
+var pp$2 = Parser.prototype;
+
+pp$2.startNode = function() {
+  return new Node(this, this.start, this.startLoc)
+};
+
+pp$2.startNodeAt = function(pos, loc) {
+  return new Node(this, pos, loc)
+};
+
+// Finish an AST node, adding `type` and `end` properties.
+
+function finishNodeAt(node, type, pos, loc) {
+  node.type = type;
+  node.end = pos;
+  if (this.options.locations)
+    { node.loc.end = loc; }
+  if (this.options.ranges)
+    { node.range[1] = pos; }
+  return node
+}
+
+pp$2.finishNode = function(node, type) {
+  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)
+};
+
+// Finish node at given position
+
+pp$2.finishNodeAt = function(node, type, pos, loc) {
+  return finishNodeAt.call(this, node, type, pos, loc)
+};
+
+pp$2.copyNode = function(node) {
+  var newNode = new Node(this, node.start, this.startLoc);
+  for (var prop in node) { newNode[prop] = node[prop]; }
+  return newNode
+};
+
+// This file contains Unicode properties extracted from the ECMAScript
+// specification. The lists are extracted like so:
+// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)
+
+// #table-binary-unicode-properties
+var ecma9BinaryProperties = "ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS";
+var ecma10BinaryProperties = ecma9BinaryProperties + " Extended_Pictographic";
+var ecma11BinaryProperties = ecma10BinaryProperties;
+var ecma12BinaryProperties = ecma11BinaryProperties + " EBase EComp EMod EPres ExtPict";
+var ecma13BinaryProperties = ecma12BinaryProperties;
+var unicodeBinaryProperties = {
+  9: ecma9BinaryProperties,
+  10: ecma10BinaryProperties,
+  11: ecma11BinaryProperties,
+  12: ecma12BinaryProperties,
+  13: ecma13BinaryProperties
+};
+
+// #table-unicode-general-category-values
+var unicodeGeneralCategoryValues = "Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu";
+
+// #table-unicode-script-values
+var ecma9ScriptValues = "Adlam Adlm Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb";
+var ecma10ScriptValues = ecma9ScriptValues + " Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd";
+var ecma11ScriptValues = ecma10ScriptValues + " Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho";
+var ecma12ScriptValues = ecma11ScriptValues + " Chorasmian Chrs Diak Dives_Akuru Khitan_Small_Script Kits Yezi Yezidi";
+var ecma13ScriptValues = ecma12ScriptValues + " Cypro_Minoan Cpmn Old_Uyghur Ougr Tangsa Tnsa Toto Vithkuqi Vith";
+var unicodeScriptValues = {
+  9: ecma9ScriptValues,
+  10: ecma10ScriptValues,
+  11: ecma11ScriptValues,
+  12: ecma12ScriptValues,
+  13: ecma13ScriptValues
+};
+
+var data = {};
+function buildUnicodeData(ecmaVersion) {
+  var d = data[ecmaVersion] = {
+    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + " " + unicodeGeneralCategoryValues),
+    nonBinary: {
+      General_Category: wordsRegexp(unicodeGeneralCategoryValues),
+      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])
+    }
+  };
+  d.nonBinary.Script_Extensions = d.nonBinary.Script;
+
+  d.nonBinary.gc = d.nonBinary.General_Category;
+  d.nonBinary.sc = d.nonBinary.Script;
+  d.nonBinary.scx = d.nonBinary.Script_Extensions;
+}
+
+for (var i = 0, list = [9, 10, 11, 12, 13]; i < list.length; i += 1) {
+  var ecmaVersion = list[i];
+
+  buildUnicodeData(ecmaVersion);
+}
+
+var pp$1 = Parser.prototype;
+
+var RegExpValidationState = function RegExpValidationState(parser) {
+  this.parser = parser;
+  this.validFlags = "gim" + (parser.options.ecmaVersion >= 6 ? "uy" : "") + (parser.options.ecmaVersion >= 9 ? "s" : "") + (parser.options.ecmaVersion >= 13 ? "d" : "");
+  this.unicodeProperties = data[parser.options.ecmaVersion >= 13 ? 13 : parser.options.ecmaVersion];
+  this.source = "";
+  this.flags = "";
+  this.start = 0;
+  this.switchU = false;
+  this.switchN = false;
+  this.pos = 0;
+  this.lastIntValue = 0;
+  this.lastStringValue = "";
+  this.lastAssertionIsQuantifiable = false;
+  this.numCapturingParens = 0;
+  this.maxBackReference = 0;
+  this.groupNames = [];
+  this.backReferenceNames = [];
+};
+
+RegExpValidationState.prototype.reset = function reset (start, pattern, flags) {
+  var unicode = flags.indexOf("u") !== -1;
+  this.start = start | 0;
+  this.source = pattern + "";
+  this.flags = flags;
+  this.switchU = unicode && this.parser.options.ecmaVersion >= 6;
+  this.switchN = unicode && this.parser.options.ecmaVersion >= 9;
+};
+
+RegExpValidationState.prototype.raise = function raise (message) {
+  this.parser.raiseRecoverable(this.start, ("Invalid regular expression: /" + (this.source) + "/: " + message));
+};
+
+// If u flag is given, this returns the code point at the index (it combines a surrogate pair).
+// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).
+RegExpValidationState.prototype.at = function at (i, forceU) {
+    if ( forceU === void 0 ) forceU = false;
+
+  var s = this.source;
+  var l = s.length;
+  if (i >= l) {
+    return -1
+  }
+  var c = s.charCodeAt(i);
+  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+    return c
+  }
+  var next = s.charCodeAt(i + 1);
+  return next >= 0xDC00 && next <= 0xDFFF ? (c << 10) + next - 0x35FDC00 : c
+};
+
+RegExpValidationState.prototype.nextIndex = function nextIndex (i, forceU) {
+    if ( forceU === void 0 ) forceU = false;
+
+  var s = this.source;
+  var l = s.length;
+  if (i >= l) {
+    return l
+  }
+  var c = s.charCodeAt(i), next;
+  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l ||
+      (next = s.charCodeAt(i + 1)) < 0xDC00 || next > 0xDFFF) {
+    return i + 1
+  }
+  return i + 2
+};
+
+RegExpValidationState.prototype.current = function current (forceU) {
+    if ( forceU === void 0 ) forceU = false;
+
+  return this.at(this.pos, forceU)
+};
+
+RegExpValidationState.prototype.lookahead = function lookahead (forceU) {
+    if ( forceU === void 0 ) forceU = false;
+
+  return this.at(this.nextIndex(this.pos, forceU), forceU)
+};
+
+RegExpValidationState.prototype.advance = function advance (forceU) {
+    if ( forceU === void 0 ) forceU = false;
+
+  this.pos = this.nextIndex(this.pos, forceU);
+};
+
+RegExpValidationState.prototype.eat = function eat (ch, forceU) {
+    if ( forceU === void 0 ) forceU = false;
+
+  if (this.current(forceU) === ch) {
+    this.advance(forceU);
+    return true
+  }
+  return false
+};
+
+function codePointToString$1(ch) {
+  if (ch <= 0xFFFF) { return String.fromCharCode(ch) }
+  ch -= 0x10000;
+  return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)
+}
+
+/**
+ * Validate the flags part of a given RegExpLiteral.
+ *
+ * @param {RegExpValidationState} state The state to validate RegExp.
+ * @returns {void}
+ */
+pp$1.validateRegExpFlags = function(state) {
+  var validFlags = state.validFlags;
+  var flags = state.flags;
+
+  for (var i = 0; i < flags.length; i++) {
+    var flag = flags.charAt(i);
+    if (validFlags.indexOf(flag) === -1) {
+      this.raise(state.start, "Invalid regular expression flag");
+    }
+    if (flags.indexOf(flag, i + 1) > -1) {
+      this.raise(state.start, "Duplicate regular expression flag");
+    }
+  }
+};
+
+/**
+ * Validate the pattern part of a given RegExpLiteral.
+ *
+ * @param {RegExpValidationState} state The state to validate RegExp.
+ * @returns {void}
+ */
+pp$1.validateRegExpPattern = function(state) {
+  this.regexp_pattern(state);
+
+  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of
+  // parsing contains a |GroupName|, reparse with the goal symbol
+  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*
+  // exception if _P_ did not conform to the grammar, if any elements of _P_
+  // were not matched by the parse, or if any Early Error conditions exist.
+  if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {
+    state.switchN = true;
+    this.regexp_pattern(state);
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern
+pp$1.regexp_pattern = function(state) {
+  state.pos = 0;
+  state.lastIntValue = 0;
+  state.lastStringValue = "";
+  state.lastAssertionIsQuantifiable = false;
+  state.numCapturingParens = 0;
+  state.maxBackReference = 0;
+  state.groupNames.length = 0;
+  state.backReferenceNames.length = 0;
+
+  this.regexp_disjunction(state);
+
+  if (state.pos !== state.source.length) {
+    // Make the same messages as V8.
+    if (state.eat(0x29 /* ) */)) {
+      state.raise("Unmatched ')'");
+    }
+    if (state.eat(0x5D /* ] */) || state.eat(0x7D /* } */)) {
+      state.raise("Lone quantifier brackets");
+    }
+  }
+  if (state.maxBackReference > state.numCapturingParens) {
+    state.raise("Invalid escape");
+  }
+  for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {
+    var name = list[i];
+
+    if (state.groupNames.indexOf(name) === -1) {
+      state.raise("Invalid named capture referenced");
+    }
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction
+pp$1.regexp_disjunction = function(state) {
+  this.regexp_alternative(state);
+  while (state.eat(0x7C /* | */)) {
+    this.regexp_alternative(state);
+  }
+
+  // Make the same message as V8.
+  if (this.regexp_eatQuantifier(state, true)) {
+    state.raise("Nothing to repeat");
+  }
+  if (state.eat(0x7B /* { */)) {
+    state.raise("Lone quantifier brackets");
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative
+pp$1.regexp_alternative = function(state) {
+  while (state.pos < state.source.length && this.regexp_eatTerm(state))
+    { }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term
+pp$1.regexp_eatTerm = function(state) {
+  if (this.regexp_eatAssertion(state)) {
+    // Handle `QuantifiableAssertion Quantifier` alternative.
+    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion
+    // is a QuantifiableAssertion.
+    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {
+      // Make the same message as V8.
+      if (state.switchU) {
+        state.raise("Invalid quantifier");
+      }
+    }
+    return true
+  }
+
+  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {
+    this.regexp_eatQuantifier(state);
+    return true
+  }
+
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion
+pp$1.regexp_eatAssertion = function(state) {
+  var start = state.pos;
+  state.lastAssertionIsQuantifiable = false;
+
+  // ^, $
+  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {
+    return true
+  }
+
+  // \b \B
+  if (state.eat(0x5C /* \ */)) {
+    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {
+      return true
+    }
+    state.pos = start;
+  }
+
+  // Lookahead / Lookbehind
+  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {
+    var lookbehind = false;
+    if (this.options.ecmaVersion >= 9) {
+      lookbehind = state.eat(0x3C /* < */);
+    }
+    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {
+      this.regexp_disjunction(state);
+      if (!state.eat(0x29 /* ) */)) {
+        state.raise("Unterminated group");
+      }
+      state.lastAssertionIsQuantifiable = !lookbehind;
+      return true
+    }
+  }
+
+  state.pos = start;
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier
+pp$1.regexp_eatQuantifier = function(state, noError) {
+  if ( noError === void 0 ) noError = false;
+
+  if (this.regexp_eatQuantifierPrefix(state, noError)) {
+    state.eat(0x3F /* ? */);
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix
+pp$1.regexp_eatQuantifierPrefix = function(state, noError) {
+  return (
+    state.eat(0x2A /* * */) ||
+    state.eat(0x2B /* + */) ||
+    state.eat(0x3F /* ? */) ||
+    this.regexp_eatBracedQuantifier(state, noError)
+  )
+};
+pp$1.regexp_eatBracedQuantifier = function(state, noError) {
+  var start = state.pos;
+  if (state.eat(0x7B /* { */)) {
+    var min = 0, max = -1;
+    if (this.regexp_eatDecimalDigits(state)) {
+      min = state.lastIntValue;
+      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {
+        max = state.lastIntValue;
+      }
+      if (state.eat(0x7D /* } */)) {
+        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term
+        if (max !== -1 && max < min && !noError) {
+          state.raise("numbers out of order in {} quantifier");
+        }
+        return true
+      }
+    }
+    if (state.switchU && !noError) {
+      state.raise("Incomplete quantifier");
+    }
+    state.pos = start;
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom
+pp$1.regexp_eatAtom = function(state) {
+  return (
+    this.regexp_eatPatternCharacters(state) ||
+    state.eat(0x2E /* . */) ||
+    this.regexp_eatReverseSolidusAtomEscape(state) ||
+    this.regexp_eatCharacterClass(state) ||
+    this.regexp_eatUncapturingGroup(state) ||
+    this.regexp_eatCapturingGroup(state)
+  )
+};
+pp$1.regexp_eatReverseSolidusAtomEscape = function(state) {
+  var start = state.pos;
+  if (state.eat(0x5C /* \ */)) {
+    if (this.regexp_eatAtomEscape(state)) {
+      return true
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$1.regexp_eatUncapturingGroup = function(state) {
+  var start = state.pos;
+  if (state.eat(0x28 /* ( */)) {
+    if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {
+      this.regexp_disjunction(state);
+      if (state.eat(0x29 /* ) */)) {
+        return true
+      }
+      state.raise("Unterminated group");
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$1.regexp_eatCapturingGroup = function(state) {
+  if (state.eat(0x28 /* ( */)) {
+    if (this.options.ecmaVersion >= 9) {
+      this.regexp_groupSpecifier(state);
+    } else if (state.current() === 0x3F /* ? */) {
+      state.raise("Invalid group");
+    }
+    this.regexp_disjunction(state);
+    if (state.eat(0x29 /* ) */)) {
+      state.numCapturingParens += 1;
+      return true
+    }
+    state.raise("Unterminated group");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom
+pp$1.regexp_eatExtendedAtom = function(state) {
+  return (
+    state.eat(0x2E /* . */) ||
+    this.regexp_eatReverseSolidusAtomEscape(state) ||
+    this.regexp_eatCharacterClass(state) ||
+    this.regexp_eatUncapturingGroup(state) ||
+    this.regexp_eatCapturingGroup(state) ||
+    this.regexp_eatInvalidBracedQuantifier(state) ||
+    this.regexp_eatExtendedPatternCharacter(state)
+  )
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier
+pp$1.regexp_eatInvalidBracedQuantifier = function(state) {
+  if (this.regexp_eatBracedQuantifier(state, true)) {
+    state.raise("Nothing to repeat");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter
+pp$1.regexp_eatSyntaxCharacter = function(state) {
+  var ch = state.current();
+  if (isSyntaxCharacter(ch)) {
+    state.lastIntValue = ch;
+    state.advance();
+    return true
+  }
+  return false
+};
+function isSyntaxCharacter(ch) {
+  return (
+    ch === 0x24 /* $ */ ||
+    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||
+    ch === 0x2E /* . */ ||
+    ch === 0x3F /* ? */ ||
+    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||
+    ch >= 0x7B /* { */ && ch <= 0x7D /* } */
+  )
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter
+// But eat eager.
+pp$1.regexp_eatPatternCharacters = function(state) {
+  var start = state.pos;
+  var ch = 0;
+  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {
+    state.advance();
+  }
+  return state.pos !== start
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter
+pp$1.regexp_eatExtendedPatternCharacter = function(state) {
+  var ch = state.current();
+  if (
+    ch !== -1 &&
+    ch !== 0x24 /* $ */ &&
+    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&
+    ch !== 0x2E /* . */ &&
+    ch !== 0x3F /* ? */ &&
+    ch !== 0x5B /* [ */ &&
+    ch !== 0x5E /* ^ */ &&
+    ch !== 0x7C /* | */
+  ) {
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// GroupSpecifier ::
+//   [empty]
+//   `?` GroupName
+pp$1.regexp_groupSpecifier = function(state) {
+  if (state.eat(0x3F /* ? */)) {
+    if (this.regexp_eatGroupName(state)) {
+      if (state.groupNames.indexOf(state.lastStringValue) !== -1) {
+        state.raise("Duplicate capture group name");
+      }
+      state.groupNames.push(state.lastStringValue);
+      return
+    }
+    state.raise("Invalid group");
+  }
+};
+
+// GroupName ::
+//   `<` RegExpIdentifierName `>`
+// Note: this updates `state.lastStringValue` property with the eaten name.
+pp$1.regexp_eatGroupName = function(state) {
+  state.lastStringValue = "";
+  if (state.eat(0x3C /* < */)) {
+    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {
+      return true
+    }
+    state.raise("Invalid capture group name");
+  }
+  return false
+};
+
+// RegExpIdentifierName ::
+//   RegExpIdentifierStart
+//   RegExpIdentifierName RegExpIdentifierPart
+// Note: this updates `state.lastStringValue` property with the eaten name.
+pp$1.regexp_eatRegExpIdentifierName = function(state) {
+  state.lastStringValue = "";
+  if (this.regexp_eatRegExpIdentifierStart(state)) {
+    state.lastStringValue += codePointToString$1(state.lastIntValue);
+    while (this.regexp_eatRegExpIdentifierPart(state)) {
+      state.lastStringValue += codePointToString$1(state.lastIntValue);
+    }
+    return true
+  }
+  return false
+};
+
+// RegExpIdentifierStart ::
+//   UnicodeIDStart
+//   `$`
+//   `_`
+//   `\` RegExpUnicodeEscapeSequence[+U]
+pp$1.regexp_eatRegExpIdentifierStart = function(state) {
+  var start = state.pos;
+  var forceU = this.options.ecmaVersion >= 11;
+  var ch = state.current(forceU);
+  state.advance(forceU);
+
+  if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {
+    ch = state.lastIntValue;
+  }
+  if (isRegExpIdentifierStart(ch)) {
+    state.lastIntValue = ch;
+    return true
+  }
+
+  state.pos = start;
+  return false
+};
+function isRegExpIdentifierStart(ch) {
+  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */
+}
+
+// RegExpIdentifierPart ::
+//   UnicodeIDContinue
+//   `$`
+//   `_`
+//   `\` RegExpUnicodeEscapeSequence[+U]
+//   <ZWNJ>
+//   <ZWJ>
+pp$1.regexp_eatRegExpIdentifierPart = function(state) {
+  var start = state.pos;
+  var forceU = this.options.ecmaVersion >= 11;
+  var ch = state.current(forceU);
+  state.advance(forceU);
+
+  if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {
+    ch = state.lastIntValue;
+  }
+  if (isRegExpIdentifierPart(ch)) {
+    state.lastIntValue = ch;
+    return true
+  }
+
+  state.pos = start;
+  return false
+};
+function isRegExpIdentifierPart(ch) {
+  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape
+pp$1.regexp_eatAtomEscape = function(state) {
+  if (
+    this.regexp_eatBackReference(state) ||
+    this.regexp_eatCharacterClassEscape(state) ||
+    this.regexp_eatCharacterEscape(state) ||
+    (state.switchN && this.regexp_eatKGroupName(state))
+  ) {
+    return true
+  }
+  if (state.switchU) {
+    // Make the same message as V8.
+    if (state.current() === 0x63 /* c */) {
+      state.raise("Invalid unicode escape");
+    }
+    state.raise("Invalid escape");
+  }
+  return false
+};
+pp$1.regexp_eatBackReference = function(state) {
+  var start = state.pos;
+  if (this.regexp_eatDecimalEscape(state)) {
+    var n = state.lastIntValue;
+    if (state.switchU) {
+      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape
+      if (n > state.maxBackReference) {
+        state.maxBackReference = n;
+      }
+      return true
+    }
+    if (n <= state.numCapturingParens) {
+      return true
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$1.regexp_eatKGroupName = function(state) {
+  if (state.eat(0x6B /* k */)) {
+    if (this.regexp_eatGroupName(state)) {
+      state.backReferenceNames.push(state.lastStringValue);
+      return true
+    }
+    state.raise("Invalid named reference");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape
+pp$1.regexp_eatCharacterEscape = function(state) {
+  return (
+    this.regexp_eatControlEscape(state) ||
+    this.regexp_eatCControlLetter(state) ||
+    this.regexp_eatZero(state) ||
+    this.regexp_eatHexEscapeSequence(state) ||
+    this.regexp_eatRegExpUnicodeEscapeSequence(state, false) ||
+    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||
+    this.regexp_eatIdentityEscape(state)
+  )
+};
+pp$1.regexp_eatCControlLetter = function(state) {
+  var start = state.pos;
+  if (state.eat(0x63 /* c */)) {
+    if (this.regexp_eatControlLetter(state)) {
+      return true
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$1.regexp_eatZero = function(state) {
+  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {
+    state.lastIntValue = 0;
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape
+pp$1.regexp_eatControlEscape = function(state) {
+  var ch = state.current();
+  if (ch === 0x74 /* t */) {
+    state.lastIntValue = 0x09; /* \t */
+    state.advance();
+    return true
+  }
+  if (ch === 0x6E /* n */) {
+    state.lastIntValue = 0x0A; /* \n */
+    state.advance();
+    return true
+  }
+  if (ch === 0x76 /* v */) {
+    state.lastIntValue = 0x0B; /* \v */
+    state.advance();
+    return true
+  }
+  if (ch === 0x66 /* f */) {
+    state.lastIntValue = 0x0C; /* \f */
+    state.advance();
+    return true
+  }
+  if (ch === 0x72 /* r */) {
+    state.lastIntValue = 0x0D; /* \r */
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter
+pp$1.regexp_eatControlLetter = function(state) {
+  var ch = state.current();
+  if (isControlLetter(ch)) {
+    state.lastIntValue = ch % 0x20;
+    state.advance();
+    return true
+  }
+  return false
+};
+function isControlLetter(ch) {
+  return (
+    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||
+    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)
+  )
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence
+pp$1.regexp_eatRegExpUnicodeEscapeSequence = function(state, forceU) {
+  if ( forceU === void 0 ) forceU = false;
+
+  var start = state.pos;
+  var switchU = forceU || state.switchU;
+
+  if (state.eat(0x75 /* u */)) {
+    if (this.regexp_eatFixedHexDigits(state, 4)) {
+      var lead = state.lastIntValue;
+      if (switchU && lead >= 0xD800 && lead <= 0xDBFF) {
+        var leadSurrogateEnd = state.pos;
+        if (state.eat(0x5C /* \ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {
+          var trail = state.lastIntValue;
+          if (trail >= 0xDC00 && trail <= 0xDFFF) {
+            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;
+            return true
+          }
+        }
+        state.pos = leadSurrogateEnd;
+        state.lastIntValue = lead;
+      }
+      return true
+    }
+    if (
+      switchU &&
+      state.eat(0x7B /* { */) &&
+      this.regexp_eatHexDigits(state) &&
+      state.eat(0x7D /* } */) &&
+      isValidUnicode(state.lastIntValue)
+    ) {
+      return true
+    }
+    if (switchU) {
+      state.raise("Invalid unicode escape");
+    }
+    state.pos = start;
+  }
+
+  return false
+};
+function isValidUnicode(ch) {
+  return ch >= 0 && ch <= 0x10FFFF
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape
+pp$1.regexp_eatIdentityEscape = function(state) {
+  if (state.switchU) {
+    if (this.regexp_eatSyntaxCharacter(state)) {
+      return true
+    }
+    if (state.eat(0x2F /* / */)) {
+      state.lastIntValue = 0x2F; /* / */
+      return true
+    }
+    return false
+  }
+
+  var ch = state.current();
+  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {
+    state.lastIntValue = ch;
+    state.advance();
+    return true
+  }
+
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape
+pp$1.regexp_eatDecimalEscape = function(state) {
+  state.lastIntValue = 0;
+  var ch = state.current();
+  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {
+    do {
+      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+      state.advance();
+    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape
+pp$1.regexp_eatCharacterClassEscape = function(state) {
+  var ch = state.current();
+
+  if (isCharacterClassEscape(ch)) {
+    state.lastIntValue = -1;
+    state.advance();
+    return true
+  }
+
+  if (
+    state.switchU &&
+    this.options.ecmaVersion >= 9 &&
+    (ch === 0x50 /* P */ || ch === 0x70 /* p */)
+  ) {
+    state.lastIntValue = -1;
+    state.advance();
+    if (
+      state.eat(0x7B /* { */) &&
+      this.regexp_eatUnicodePropertyValueExpression(state) &&
+      state.eat(0x7D /* } */)
+    ) {
+      return true
+    }
+    state.raise("Invalid property name");
+  }
+
+  return false
+};
+function isCharacterClassEscape(ch) {
+  return (
+    ch === 0x64 /* d */ ||
+    ch === 0x44 /* D */ ||
+    ch === 0x73 /* s */ ||
+    ch === 0x53 /* S */ ||
+    ch === 0x77 /* w */ ||
+    ch === 0x57 /* W */
+  )
+}
+
+// UnicodePropertyValueExpression ::
+//   UnicodePropertyName `=` UnicodePropertyValue
+//   LoneUnicodePropertyNameOrValue
+pp$1.regexp_eatUnicodePropertyValueExpression = function(state) {
+  var start = state.pos;
+
+  // UnicodePropertyName `=` UnicodePropertyValue
+  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {
+    var name = state.lastStringValue;
+    if (this.regexp_eatUnicodePropertyValue(state)) {
+      var value = state.lastStringValue;
+      this.regexp_validateUnicodePropertyNameAndValue(state, name, value);
+      return true
+    }
+  }
+  state.pos = start;
+
+  // LoneUnicodePropertyNameOrValue
+  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {
+    var nameOrValue = state.lastStringValue;
+    this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);
+    return true
+  }
+  return false
+};
+pp$1.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {
+  if (!hasOwn(state.unicodeProperties.nonBinary, name))
+    { state.raise("Invalid property name"); }
+  if (!state.unicodeProperties.nonBinary[name].test(value))
+    { state.raise("Invalid property value"); }
+};
+pp$1.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {
+  if (!state.unicodeProperties.binary.test(nameOrValue))
+    { state.raise("Invalid property name"); }
+};
+
+// UnicodePropertyName ::
+//   UnicodePropertyNameCharacters
+pp$1.regexp_eatUnicodePropertyName = function(state) {
+  var ch = 0;
+  state.lastStringValue = "";
+  while (isUnicodePropertyNameCharacter(ch = state.current())) {
+    state.lastStringValue += codePointToString$1(ch);
+    state.advance();
+  }
+  return state.lastStringValue !== ""
+};
+function isUnicodePropertyNameCharacter(ch) {
+  return isControlLetter(ch) || ch === 0x5F /* _ */
+}
+
+// UnicodePropertyValue ::
+//   UnicodePropertyValueCharacters
+pp$1.regexp_eatUnicodePropertyValue = function(state) {
+  var ch = 0;
+  state.lastStringValue = "";
+  while (isUnicodePropertyValueCharacter(ch = state.current())) {
+    state.lastStringValue += codePointToString$1(ch);
+    state.advance();
+  }
+  return state.lastStringValue !== ""
+};
+function isUnicodePropertyValueCharacter(ch) {
+  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)
+}
+
+// LoneUnicodePropertyNameOrValue ::
+//   UnicodePropertyValueCharacters
+pp$1.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {
+  return this.regexp_eatUnicodePropertyValue(state)
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass
+pp$1.regexp_eatCharacterClass = function(state) {
+  if (state.eat(0x5B /* [ */)) {
+    state.eat(0x5E /* ^ */);
+    this.regexp_classRanges(state);
+    if (state.eat(0x5D /* ] */)) {
+      return true
+    }
+    // Unreachable since it threw "unterminated regular expression" error before.
+    state.raise("Unterminated character class");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges
+// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges
+// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash
+pp$1.regexp_classRanges = function(state) {
+  while (this.regexp_eatClassAtom(state)) {
+    var left = state.lastIntValue;
+    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {
+      var right = state.lastIntValue;
+      if (state.switchU && (left === -1 || right === -1)) {
+        state.raise("Invalid character class");
+      }
+      if (left !== -1 && right !== -1 && left > right) {
+        state.raise("Range out of order in character class");
+      }
+    }
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash
+pp$1.regexp_eatClassAtom = function(state) {
+  var start = state.pos;
+
+  if (state.eat(0x5C /* \ */)) {
+    if (this.regexp_eatClassEscape(state)) {
+      return true
+    }
+    if (state.switchU) {
+      // Make the same message as V8.
+      var ch$1 = state.current();
+      if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {
+        state.raise("Invalid class escape");
+      }
+      state.raise("Invalid escape");
+    }
+    state.pos = start;
+  }
+
+  var ch = state.current();
+  if (ch !== 0x5D /* ] */) {
+    state.lastIntValue = ch;
+    state.advance();
+    return true
+  }
+
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape
+pp$1.regexp_eatClassEscape = function(state) {
+  var start = state.pos;
+
+  if (state.eat(0x62 /* b */)) {
+    state.lastIntValue = 0x08; /* <BS> */
+    return true
+  }
+
+  if (state.switchU && state.eat(0x2D /* - */)) {
+    state.lastIntValue = 0x2D; /* - */
+    return true
+  }
+
+  if (!state.switchU && state.eat(0x63 /* c */)) {
+    if (this.regexp_eatClassControlLetter(state)) {
+      return true
+    }
+    state.pos = start;
+  }
+
+  return (
+    this.regexp_eatCharacterClassEscape(state) ||
+    this.regexp_eatCharacterEscape(state)
+  )
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter
+pp$1.regexp_eatClassControlLetter = function(state) {
+  var ch = state.current();
+  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {
+    state.lastIntValue = ch % 0x20;
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+pp$1.regexp_eatHexEscapeSequence = function(state) {
+  var start = state.pos;
+  if (state.eat(0x78 /* x */)) {
+    if (this.regexp_eatFixedHexDigits(state, 2)) {
+      return true
+    }
+    if (state.switchU) {
+      state.raise("Invalid escape");
+    }
+    state.pos = start;
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits
+pp$1.regexp_eatDecimalDigits = function(state) {
+  var start = state.pos;
+  var ch = 0;
+  state.lastIntValue = 0;
+  while (isDecimalDigit(ch = state.current())) {
+    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+    state.advance();
+  }
+  return state.pos !== start
+};
+function isDecimalDigit(ch) {
+  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits
+pp$1.regexp_eatHexDigits = function(state) {
+  var start = state.pos;
+  var ch = 0;
+  state.lastIntValue = 0;
+  while (isHexDigit(ch = state.current())) {
+    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+    state.advance();
+  }
+  return state.pos !== start
+};
+function isHexDigit(ch) {
+  return (
+    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||
+    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||
+    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)
+  )
+}
+function hexToInt(ch) {
+  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {
+    return 10 + (ch - 0x41 /* A */)
+  }
+  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {
+    return 10 + (ch - 0x61 /* a */)
+  }
+  return ch - 0x30 /* 0 */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence
+// Allows only 0-377(octal) i.e. 0-255(decimal).
+pp$1.regexp_eatLegacyOctalEscapeSequence = function(state) {
+  if (this.regexp_eatOctalDigit(state)) {
+    var n1 = state.lastIntValue;
+    if (this.regexp_eatOctalDigit(state)) {
+      var n2 = state.lastIntValue;
+      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {
+        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;
+      } else {
+        state.lastIntValue = n1 * 8 + n2;
+      }
+    } else {
+      state.lastIntValue = n1;
+    }
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit
+pp$1.regexp_eatOctalDigit = function(state) {
+  var ch = state.current();
+  if (isOctalDigit(ch)) {
+    state.lastIntValue = ch - 0x30; /* 0 */
+    state.advance();
+    return true
+  }
+  state.lastIntValue = 0;
+  return false
+};
+function isOctalDigit(ch) {
+  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits
+// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit
+// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+pp$1.regexp_eatFixedHexDigits = function(state, length) {
+  var start = state.pos;
+  state.lastIntValue = 0;
+  for (var i = 0; i < length; ++i) {
+    var ch = state.current();
+    if (!isHexDigit(ch)) {
+      state.pos = start;
+      return false
+    }
+    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+    state.advance();
+  }
+  return true
+};
+
+// Object type used to represent tokens. Note that normally, tokens
+// simply exist as properties on the parser object. This is only
+// used for the onToken callback and the external tokenizer.
+
+var Token = function Token(p) {
+  this.type = p.type;
+  this.value = p.value;
+  this.start = p.start;
+  this.end = p.end;
+  if (p.options.locations)
+    { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }
+  if (p.options.ranges)
+    { this.range = [p.start, p.end]; }
+};
+
+// ## Tokenizer
+
+var pp = Parser.prototype;
+
+// Move to the next token
+
+pp.next = function(ignoreEscapeSequenceInKeyword) {
+  if (!ignoreEscapeSequenceInKeyword && this.type.keyword && this.containsEsc)
+    { this.raiseRecoverable(this.start, "Escape sequence in keyword " + this.type.keyword); }
+  if (this.options.onToken)
+    { this.options.onToken(new Token(this)); }
+
+  this.lastTokEnd = this.end;
+  this.lastTokStart = this.start;
+  this.lastTokEndLoc = this.endLoc;
+  this.lastTokStartLoc = this.startLoc;
+  this.nextToken();
+};
+
+pp.getToken = function() {
+  this.next();
+  return new Token(this)
+};
+
+// If we're in an ES6 environment, make parsers iterable
+if (typeof Symbol !== "undefined")
+  { pp[Symbol.iterator] = function() {
+    var this$1$1 = this;
+
+    return {
+      next: function () {
+        var token = this$1$1.getToken();
+        return {
+          done: token.type === types$1.eof,
+          value: token
+        }
+      }
+    }
+  }; }
+
+// Toggle strict mode. Re-reads the next number or string to please
+// pedantic tests (`"use strict"; 010;` should fail).
+
+// Read a single token, updating the parser object's token-related
+// properties.
+
+pp.nextToken = function() {
+  var curContext = this.curContext();
+  if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }
+
+  this.start = this.pos;
+  if (this.options.locations) { this.startLoc = this.curPosition(); }
+  if (this.pos >= this.input.length) { return this.finishToken(types$1.eof) }
+
+  if (curContext.override) { return curContext.override(this) }
+  else { this.readToken(this.fullCharCodeAtPos()); }
+};
+
+pp.readToken = function(code) {
+  // Identifier or keyword. '\uXXXX' sequences are allowed in
+  // identifiers, so '\' also dispatches to that.
+  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\' */)
+    { return this.readWord() }
+
+  return this.getTokenFromCode(code)
+};
+
+pp.fullCharCodeAtPos = function() {
+  var code = this.input.charCodeAt(this.pos);
+  if (code <= 0xd7ff || code >= 0xdc00) { return code }
+  var next = this.input.charCodeAt(this.pos + 1);
+  return next <= 0xdbff || next >= 0xe000 ? code : (code << 10) + next - 0x35fdc00
+};
+
+pp.skipBlockComment = function() {
+  var startLoc = this.options.onComment && this.curPosition();
+  var start = this.pos, end = this.input.indexOf("*/", this.pos += 2);
+  if (end === -1) { this.raise(this.pos - 2, "Unterminated comment"); }
+  this.pos = end + 2;
+  if (this.options.locations) {
+    for (var nextBreak = (void 0), pos = start; (nextBreak = nextLineBreak(this.input, pos, this.pos)) > -1;) {
+      ++this.curLine;
+      pos = this.lineStart = nextBreak;
+    }
+  }
+  if (this.options.onComment)
+    { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,
+                           startLoc, this.curPosition()); }
+};
+
+pp.skipLineComment = function(startSkip) {
+  var start = this.pos;
+  var startLoc = this.options.onComment && this.curPosition();
+  var ch = this.input.charCodeAt(this.pos += startSkip);
+  while (this.pos < this.input.length && !isNewLine(ch)) {
+    ch = this.input.charCodeAt(++this.pos);
+  }
+  if (this.options.onComment)
+    { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,
+                           startLoc, this.curPosition()); }
+};
+
+// Called at the start of the parse and after every token. Skips
+// whitespace and comments, and.
+
+pp.skipSpace = function() {
+  loop: while (this.pos < this.input.length) {
+    var ch = this.input.charCodeAt(this.pos);
+    switch (ch) {
+    case 32: case 160: // ' '
+      ++this.pos;
+      break
+    case 13:
+      if (this.input.charCodeAt(this.pos + 1) === 10) {
+        ++this.pos;
+      }
+    case 10: case 8232: case 8233:
+      ++this.pos;
+      if (this.options.locations) {
+        ++this.curLine;
+        this.lineStart = this.pos;
+      }
+      break
+    case 47: // '/'
+      switch (this.input.charCodeAt(this.pos + 1)) {
+      case 42: // '*'
+        this.skipBlockComment();
+        break
+      case 47:
+        this.skipLineComment(2);
+        break
+      default:
+        break loop
+      }
+      break
+    default:
+      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {
+        ++this.pos;
+      } else {
+        break loop
+      }
+    }
+  }
+};
+
+// Called at the end of every token. Sets `end`, `val`, and
+// maintains `context` and `exprAllowed`, and skips the space after
+// the token, so that the next one's `start` will point at the
+// right position.
+
+pp.finishToken = function(type, val) {
+  this.end = this.pos;
+  if (this.options.locations) { this.endLoc = this.curPosition(); }
+  var prevType = this.type;
+  this.type = type;
+  this.value = val;
+
+  this.updateContext(prevType);
+};
+
+// ### Token reading
+
+// This is the function that is called to fetch the next token. It
+// is somewhat obscure, because it works in character codes rather
+// than characters, and because operator parsing has been inlined
+// into it.
+//
+// All in the name of speed.
+//
+pp.readToken_dot = function() {
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next >= 48 && next <= 57) { return this.readNumber(true) }
+  var next2 = this.input.charCodeAt(this.pos + 2);
+  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'
+    this.pos += 3;
+    return this.finishToken(types$1.ellipsis)
+  } else {
+    ++this.pos;
+    return this.finishToken(types$1.dot)
+  }
+};
+
+pp.readToken_slash = function() { // '/'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }
+  if (next === 61) { return this.finishOp(types$1.assign, 2) }
+  return this.finishOp(types$1.slash, 1)
+};
+
+pp.readToken_mult_modulo_exp = function(code) { // '%*'
+  var next = this.input.charCodeAt(this.pos + 1);
+  var size = 1;
+  var tokentype = code === 42 ? types$1.star : types$1.modulo;
+
+  // exponentiation operator ** and **=
+  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {
+    ++size;
+    tokentype = types$1.starstar;
+    next = this.input.charCodeAt(this.pos + 2);
+  }
+
+  if (next === 61) { return this.finishOp(types$1.assign, size + 1) }
+  return this.finishOp(tokentype, size)
+};
+
+pp.readToken_pipe_amp = function(code) { // '|&'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === code) {
+    if (this.options.ecmaVersion >= 12) {
+      var next2 = this.input.charCodeAt(this.pos + 2);
+      if (next2 === 61) { return this.finishOp(types$1.assign, 3) }
+    }
+    return this.finishOp(code === 124 ? types$1.logicalOR : types$1.logicalAND, 2)
+  }
+  if (next === 61) { return this.finishOp(types$1.assign, 2) }
+  return this.finishOp(code === 124 ? types$1.bitwiseOR : types$1.bitwiseAND, 1)
+};
+
+pp.readToken_caret = function() { // '^'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === 61) { return this.finishOp(types$1.assign, 2) }
+  return this.finishOp(types$1.bitwiseXOR, 1)
+};
+
+pp.readToken_plus_min = function(code) { // '+-'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === code) {
+    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&
+        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {
+      // A `-->` line comment
+      this.skipLineComment(3);
+      this.skipSpace();
+      return this.nextToken()
+    }
+    return this.finishOp(types$1.incDec, 2)
+  }
+  if (next === 61) { return this.finishOp(types$1.assign, 2) }
+  return this.finishOp(types$1.plusMin, 1)
+};
+
+pp.readToken_lt_gt = function(code) { // '<>'
+  var next = this.input.charCodeAt(this.pos + 1);
+  var size = 1;
+  if (next === code) {
+    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;
+    if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types$1.assign, size + 1) }
+    return this.finishOp(types$1.bitShift, size)
+  }
+  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&
+      this.input.charCodeAt(this.pos + 3) === 45) {
+    // `<!--`, an XML-style comment that should be interpreted as a line comment
+    this.skipLineComment(4);
+    this.skipSpace();
+    return this.nextToken()
+  }
+  if (next === 61) { size = 2; }
+  return this.finishOp(types$1.relational, size)
+};
+
+pp.readToken_eq_excl = function(code) { // '=!'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === 61) { return this.finishOp(types$1.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }
+  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'
+    this.pos += 2;
+    return this.finishToken(types$1.arrow)
+  }
+  return this.finishOp(code === 61 ? types$1.eq : types$1.prefix, 1)
+};
+
+pp.readToken_question = function() { // '?'
+  var ecmaVersion = this.options.ecmaVersion;
+  if (ecmaVersion >= 11) {
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === 46) {
+      var next2 = this.input.charCodeAt(this.pos + 2);
+      if (next2 < 48 || next2 > 57) { return this.finishOp(types$1.questionDot, 2) }
+    }
+    if (next === 63) {
+      if (ecmaVersion >= 12) {
+        var next2$1 = this.input.charCodeAt(this.pos + 2);
+        if (next2$1 === 61) { return this.finishOp(types$1.assign, 3) }
+      }
+      return this.finishOp(types$1.coalesce, 2)
+    }
+  }
+  return this.finishOp(types$1.question, 1)
+};
+
+pp.readToken_numberSign = function() { // '#'
+  var ecmaVersion = this.options.ecmaVersion;
+  var code = 35; // '#'
+  if (ecmaVersion >= 13) {
+    ++this.pos;
+    code = this.fullCharCodeAtPos();
+    if (isIdentifierStart(code, true) || code === 92 /* '\' */) {
+      return this.finishToken(types$1.privateId, this.readWord1())
+    }
+  }
+
+  this.raise(this.pos, "Unexpected character '" + codePointToString(code) + "'");
+};
+
+pp.getTokenFromCode = function(code) {
+  switch (code) {
+  // The interpretation of a dot depends on whether it is followed
+  // by a digit or another two dots.
+  case 46: // '.'
+    return this.readToken_dot()
+
+  // Punctuation tokens.
+  case 40: ++this.pos; return this.finishToken(types$1.parenL)
+  case 41: ++this.pos; return this.finishToken(types$1.parenR)
+  case 59: ++this.pos; return this.finishToken(types$1.semi)
+  case 44: ++this.pos; return this.finishToken(types$1.comma)
+  case 91: ++this.pos; return this.finishToken(types$1.bracketL)
+  case 93: ++this.pos; return this.finishToken(types$1.bracketR)
+  case 123: ++this.pos; return this.finishToken(types$1.braceL)
+  case 125: ++this.pos; return this.finishToken(types$1.braceR)
+  case 58: ++this.pos; return this.finishToken(types$1.colon)
+
+  case 96: // '`'
+    if (this.options.ecmaVersion < 6) { break }
+    ++this.pos;
+    return this.finishToken(types$1.backQuote)
+
+  case 48: // '0'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number
+    if (this.options.ecmaVersion >= 6) {
+      if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number
+      if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number
+    }
+
+  // Anything else beginning with a digit is an integer, octal
+  // number, or float.
+  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9
+    return this.readNumber(false)
+
+  // Quotes produce strings.
+  case 34: case 39: // '"', "'"
+    return this.readString(code)
+
+  // Operators are parsed inline in tiny state machines. '=' (61) is
+  // often referred to. `finishOp` simply skips the amount of
+  // characters it is given as second argument, and returns a token
+  // of the type given by its first argument.
+  case 47: // '/'
+    return this.readToken_slash()
+
+  case 37: case 42: // '%*'
+    return this.readToken_mult_modulo_exp(code)
+
+  case 124: case 38: // '|&'
+    return this.readToken_pipe_amp(code)
+
+  case 94: // '^'
+    return this.readToken_caret()
+
+  case 43: case 45: // '+-'
+    return this.readToken_plus_min(code)
+
+  case 60: case 62: // '<>'
+    return this.readToken_lt_gt(code)
+
+  case 61: case 33: // '=!'
+    return this.readToken_eq_excl(code)
+
+  case 63: // '?'
+    return this.readToken_question()
+
+  case 126: // '~'
+    return this.finishOp(types$1.prefix, 1)
+
+  case 35: // '#'
+    return this.readToken_numberSign()
+  }
+
+  this.raise(this.pos, "Unexpected character '" + codePointToString(code) + "'");
+};
+
+pp.finishOp = function(type, size) {
+  var str = this.input.slice(this.pos, this.pos + size);
+  this.pos += size;
+  return this.finishToken(type, str)
+};
+
+pp.readRegexp = function() {
+  var escaped, inClass, start = this.pos;
+  for (;;) {
+    if (this.pos >= this.input.length) { this.raise(start, "Unterminated regular expression"); }
+    var ch = this.input.charAt(this.pos);
+    if (lineBreak.test(ch)) { this.raise(start, "Unterminated regular expression"); }
+    if (!escaped) {
+      if (ch === "[") { inClass = true; }
+      else if (ch === "]" && inClass) { inClass = false; }
+      else if (ch === "/" && !inClass) { break }
+      escaped = ch === "\\";
+    } else { escaped = false; }
+    ++this.pos;
+  }
+  var pattern = this.input.slice(start, this.pos);
+  ++this.pos;
+  var flagsStart = this.pos;
+  var flags = this.readWord1();
+  if (this.containsEsc) { this.unexpected(flagsStart); }
+
+  // Validate pattern
+  var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));
+  state.reset(start, pattern, flags);
+  this.validateRegExpFlags(state);
+  this.validateRegExpPattern(state);
+
+  // Create Literal#value property value.
+  var value = null;
+  try {
+    value = new RegExp(pattern, flags);
+  } catch (e) {
+    // ESTree requires null if it failed to instantiate RegExp object.
+    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral
+  }
+
+  return this.finishToken(types$1.regexp, {pattern: pattern, flags: flags, value: value})
+};
+
+// Read an integer in the given radix. Return null if zero digits
+// were read, the integer value otherwise. When `len` is given, this
+// will return `null` unless the integer has exactly `len` digits.
+
+pp.readInt = function(radix, len, maybeLegacyOctalNumericLiteral) {
+  // `len` is used for character escape sequences. In that case, disallow separators.
+  var allowSeparators = this.options.ecmaVersion >= 12 && len === undefined;
+
+  // `maybeLegacyOctalNumericLiteral` is true if it doesn't have prefix (0x,0o,0b)
+  // and isn't fraction part nor exponent part. In that case, if the first digit
+  // is zero then disallow separators.
+  var isLegacyOctalNumericLiteral = maybeLegacyOctalNumericLiteral && this.input.charCodeAt(this.pos) === 48;
+
+  var start = this.pos, total = 0, lastCode = 0;
+  for (var i = 0, e = len == null ? Infinity : len; i < e; ++i, ++this.pos) {
+    var code = this.input.charCodeAt(this.pos), val = (void 0);
+
+    if (allowSeparators && code === 95) {
+      if (isLegacyOctalNumericLiteral) { this.raiseRecoverable(this.pos, "Numeric separator is not allowed in legacy octal numeric literals"); }
+      if (lastCode === 95) { this.raiseRecoverable(this.pos, "Numeric separator must be exactly one underscore"); }
+      if (i === 0) { this.raiseRecoverable(this.pos, "Numeric separator is not allowed at the first of digits"); }
+      lastCode = code;
+      continue
+    }
+
+    if (code >= 97) { val = code - 97 + 10; } // a
+    else if (code >= 65) { val = code - 65 + 10; } // A
+    else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9
+    else { val = Infinity; }
+    if (val >= radix) { break }
+    lastCode = code;
+    total = total * radix + val;
+  }
+
+  if (allowSeparators && lastCode === 95) { this.raiseRecoverable(this.pos - 1, "Numeric separator is not allowed at the last of digits"); }
+  if (this.pos === start || len != null && this.pos - start !== len) { return null }
+
+  return total
+};
+
+function stringToNumber(str, isLegacyOctalNumericLiteral) {
+  if (isLegacyOctalNumericLiteral) {
+    return parseInt(str, 8)
+  }
+
+  // `parseFloat(value)` stops parsing at the first numeric separator then returns a wrong value.
+  return parseFloat(str.replace(/_/g, ""))
+}
+
+function stringToBigInt(str) {
+  if (typeof BigInt !== "function") {
+    return null
+  }
+
+  // `BigInt(value)` throws syntax error if the string contains numeric separators.
+  return BigInt(str.replace(/_/g, ""))
+}
+
+pp.readRadixNumber = function(radix) {
+  var start = this.pos;
+  this.pos += 2; // 0x
+  var val = this.readInt(radix);
+  if (val == null) { this.raise(this.start + 2, "Expected number in radix " + radix); }
+  if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {
+    val = stringToBigInt(this.input.slice(start, this.pos));
+    ++this.pos;
+  } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+  return this.finishToken(types$1.num, val)
+};
+
+// Read an integer, octal integer, or floating-point number.
+
+pp.readNumber = function(startsWithDot) {
+  var start = this.pos;
+  if (!startsWithDot && this.readInt(10, undefined, true) === null) { this.raise(start, "Invalid number"); }
+  var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;
+  if (octal && this.strict) { this.raise(start, "Invalid number"); }
+  var next = this.input.charCodeAt(this.pos);
+  if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {
+    var val$1 = stringToBigInt(this.input.slice(start, this.pos));
+    ++this.pos;
+    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+    return this.finishToken(types$1.num, val$1)
+  }
+  if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }
+  if (next === 46 && !octal) { // '.'
+    ++this.pos;
+    this.readInt(10);
+    next = this.input.charCodeAt(this.pos);
+  }
+  if ((next === 69 || next === 101) && !octal) { // 'eE'
+    next = this.input.charCodeAt(++this.pos);
+    if (next === 43 || next === 45) { ++this.pos; } // '+-'
+    if (this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+  }
+  if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+
+  var val = stringToNumber(this.input.slice(start, this.pos), octal);
+  return this.finishToken(types$1.num, val)
+};
+
+// Read a string value, interpreting backslash-escapes.
+
+pp.readCodePoint = function() {
+  var ch = this.input.charCodeAt(this.pos), code;
+
+  if (ch === 123) { // '{'
+    if (this.options.ecmaVersion < 6) { this.unexpected(); }
+    var codePos = ++this.pos;
+    code = this.readHexChar(this.input.indexOf("}", this.pos) - this.pos);
+    ++this.pos;
+    if (code > 0x10FFFF) { this.invalidStringToken(codePos, "Code point out of bounds"); }
+  } else {
+    code = this.readHexChar(4);
+  }
+  return code
+};
+
+function codePointToString(code) {
+  // UTF-16 Decoding
+  if (code <= 0xFFFF) { return String.fromCharCode(code) }
+  code -= 0x10000;
+  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)
+}
+
+pp.readString = function(quote) {
+  var out = "", chunkStart = ++this.pos;
+  for (;;) {
+    if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated string constant"); }
+    var ch = this.input.charCodeAt(this.pos);
+    if (ch === quote) { break }
+    if (ch === 92) { // '\'
+      out += this.input.slice(chunkStart, this.pos);
+      out += this.readEscapedChar(false);
+      chunkStart = this.pos;
+    } else if (ch === 0x2028 || ch === 0x2029) {
+      if (this.options.ecmaVersion < 10) { this.raise(this.start, "Unterminated string constant"); }
+      ++this.pos;
+      if (this.options.locations) {
+        this.curLine++;
+        this.lineStart = this.pos;
+      }
+    } else {
+      if (isNewLine(ch)) { this.raise(this.start, "Unterminated string constant"); }
+      ++this.pos;
+    }
+  }
+  out += this.input.slice(chunkStart, this.pos++);
+  return this.finishToken(types$1.string, out)
+};
+
+// Reads template string tokens.
+
+var INVALID_TEMPLATE_ESCAPE_ERROR = {};
+
+pp.tryReadTemplateToken = function() {
+  this.inTemplateElement = true;
+  try {
+    this.readTmplToken();
+  } catch (err) {
+    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {
+      this.readInvalidTemplateToken();
+    } else {
+      throw err
+    }
+  }
+
+  this.inTemplateElement = false;
+};
+
+pp.invalidStringToken = function(position, message) {
+  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {
+    throw INVALID_TEMPLATE_ESCAPE_ERROR
+  } else {
+    this.raise(position, message);
+  }
+};
+
+pp.readTmplToken = function() {
+  var out = "", chunkStart = this.pos;
+  for (;;) {
+    if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated template"); }
+    var ch = this.input.charCodeAt(this.pos);
+    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'
+      if (this.pos === this.start && (this.type === types$1.template || this.type === types$1.invalidTemplate)) {
+        if (ch === 36) {
+          this.pos += 2;
+          return this.finishToken(types$1.dollarBraceL)
+        } else {
+          ++this.pos;
+          return this.finishToken(types$1.backQuote)
+        }
+      }
+      out += this.input.slice(chunkStart, this.pos);
+      return this.finishToken(types$1.template, out)
+    }
+    if (ch === 92) { // '\'
+      out += this.input.slice(chunkStart, this.pos);
+      out += this.readEscapedChar(true);
+      chunkStart = this.pos;
+    } else if (isNewLine(ch)) {
+      out += this.input.slice(chunkStart, this.pos);
+      ++this.pos;
+      switch (ch) {
+      case 13:
+        if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }
+      case 10:
+        out += "\n";
+        break
+      default:
+        out += String.fromCharCode(ch);
+        break
+      }
+      if (this.options.locations) {
+        ++this.curLine;
+        this.lineStart = this.pos;
+      }
+      chunkStart = this.pos;
+    } else {
+      ++this.pos;
+    }
+  }
+};
+
+// Reads a template token to search for the end, without validating any escape sequences
+pp.readInvalidTemplateToken = function() {
+  for (; this.pos < this.input.length; this.pos++) {
+    switch (this.input[this.pos]) {
+    case "\\":
+      ++this.pos;
+      break
+
+    case "$":
+      if (this.input[this.pos + 1] !== "{") {
+        break
+      }
+
+    // falls through
+    case "`":
+      return this.finishToken(types$1.invalidTemplate, this.input.slice(this.start, this.pos))
+
+    // no default
+    }
+  }
+  this.raise(this.start, "Unterminated template");
+};
+
+// Used to read escaped characters
+
+pp.readEscapedChar = function(inTemplate) {
+  var ch = this.input.charCodeAt(++this.pos);
+  ++this.pos;
+  switch (ch) {
+  case 110: return "\n" // 'n' -> '\n'
+  case 114: return "\r" // 'r' -> '\r'
+  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'
+  case 117: return codePointToString(this.readCodePoint()) // 'u'
+  case 116: return "\t" // 't' -> '\t'
+  case 98: return "\b" // 'b' -> '\b'
+  case 118: return "\u000b" // 'v' -> '\u000b'
+  case 102: return "\f" // 'f' -> '\f'
+  case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\r\n'
+  case 10: // ' \n'
+    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }
+    return ""
+  case 56:
+  case 57:
+    if (this.strict) {
+      this.invalidStringToken(
+        this.pos - 1,
+        "Invalid escape sequence"
+      );
+    }
+    if (inTemplate) {
+      var codePos = this.pos - 1;
+
+      this.invalidStringToken(
+        codePos,
+        "Invalid escape sequence in template string"
+      );
+
+      return null
+    }
+  default:
+    if (ch >= 48 && ch <= 55) {
+      var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];
+      var octal = parseInt(octalStr, 8);
+      if (octal > 255) {
+        octalStr = octalStr.slice(0, -1);
+        octal = parseInt(octalStr, 8);
+      }
+      this.pos += octalStr.length - 1;
+      ch = this.input.charCodeAt(this.pos);
+      if ((octalStr !== "0" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {
+        this.invalidStringToken(
+          this.pos - 1 - octalStr.length,
+          inTemplate
+            ? "Octal literal in template string"
+            : "Octal literal in strict mode"
+        );
+      }
+      return String.fromCharCode(octal)
+    }
+    if (isNewLine(ch)) {
+      // Unicode new line characters after \ get removed from output in both
+      // template literals and strings
+      return ""
+    }
+    return String.fromCharCode(ch)
+  }
+};
+
+// Used to read character escape sequences ('\x', '\u', '\U').
+
+pp.readHexChar = function(len) {
+  var codePos = this.pos;
+  var n = this.readInt(16, len);
+  if (n === null) { this.invalidStringToken(codePos, "Bad character escape sequence"); }
+  return n
+};
+
+// Read an identifier, and return it as a string. Sets `this.containsEsc`
+// to whether the word contained a '\u' escape.
+//
+// Incrementally adds only escaped chars, adding other chunks as-is
+// as a micro-optimization.
+
+pp.readWord1 = function() {
+  this.containsEsc = false;
+  var word = "", first = true, chunkStart = this.pos;
+  var astral = this.options.ecmaVersion >= 6;
+  while (this.pos < this.input.length) {
+    var ch = this.fullCharCodeAtPos();
+    if (isIdentifierChar(ch, astral)) {
+      this.pos += ch <= 0xffff ? 1 : 2;
+    } else if (ch === 92) { // "\"
+      this.containsEsc = true;
+      word += this.input.slice(chunkStart, this.pos);
+      var escStart = this.pos;
+      if (this.input.charCodeAt(++this.pos) !== 117) // "u"
+        { this.invalidStringToken(this.pos, "Expecting Unicode escape sequence \\uXXXX"); }
+      ++this.pos;
+      var esc = this.readCodePoint();
+      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))
+        { this.invalidStringToken(escStart, "Invalid Unicode escape"); }
+      word += codePointToString(esc);
+      chunkStart = this.pos;
+    } else {
+      break
+    }
+    first = false;
+  }
+  return word + this.input.slice(chunkStart, this.pos)
+};
+
+// Read an identifier or keyword token. Will check for reserved
+// words when necessary.
+
+pp.readWord = function() {
+  var word = this.readWord1();
+  var type = types$1.name;
+  if (this.keywords.test(word)) {
+    type = keywords[word];
+  }
+  return this.finishToken(type, word)
+};
+
+// Acorn is a tiny, fast JavaScript parser written in JavaScript.
+
+var version = "8.7.0";
+
+Parser.acorn = {
+  Parser: Parser,
+  version: version,
+  defaultOptions: defaultOptions,
+  Position: Position,
+  SourceLocation: SourceLocation,
+  getLineInfo: getLineInfo,
+  Node: Node,
+  TokenType: TokenType,
+  tokTypes: types$1,
+  keywordTypes: keywords,
+  TokContext: TokContext,
+  tokContexts: types,
+  isIdentifierChar: isIdentifierChar,
+  isIdentifierStart: isIdentifierStart,
+  Token: Token,
+  isNewLine: isNewLine,
+  lineBreak: lineBreak,
+  lineBreakG: lineBreakG,
+  nonASCIIwhitespace: nonASCIIwhitespace
+};
+
+// The main exported interface (under `self.acorn` when in the
+// browser) is a `parse` function that takes a code string and
+// returns an abstract syntax tree as specified by [Mozilla parser
+// API][api].
+//
+// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API
+
+function parse(input, options) {
+  return Parser.parse(input, options)
+}
+
+// This function tries to parse a single expression at a given
+// offset in a string. Useful for parsing mixed-language formats
+// that embed JavaScript expressions.
+
+function parseExpressionAt(input, pos, options) {
+  return Parser.parseExpressionAt(input, pos, options)
+}
+
+// Acorn is organized as a tokenizer and a recursive-descent parser.
+// The `tokenizer` export provides an interface to the tokenizer.
+
+function tokenizer(input, options) {
+  return Parser.tokenizer(input, options)
+}
+
+export { Node, Parser, Position, SourceLocation, TokContext, Token, TokenType, defaultOptions, getLineInfo, isIdentifierChar, isIdentifierStart, isNewLine, keywords as keywordTypes, lineBreak, lineBreakG, nonASCIIwhitespace, parse, parseExpressionAt, types as tokContexts, types$1 as tokTypes, tokenizer, version };
diff --git a/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.mjs.d.ts b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.mjs.d.ts
new file mode 100644
index 0000000..5f63359
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/dist/acorn.mjs.d.ts
@@ -0,0 +1,2 @@
+import * as acorn from "./acorn";
+export = acorn;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/acorn/dist/bin.js b/node_modules/mathjs/examples/node_modules/acorn/dist/bin.js
new file mode 100644
index 0000000..8e64500
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/dist/bin.js
@@ -0,0 +1,91 @@
+'use strict';
+
+var path = require('path');
+var fs = require('fs');
+var acorn = require('./acorn.js');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n["default"] = e;
+  return Object.freeze(n);
+}
+
+var acorn__namespace = /*#__PURE__*/_interopNamespace(acorn);
+
+var inputFilePaths = [], forceFileName = false, fileMode = false, silent = false, compact = false, tokenize = false;
+var options = {};
+
+function help(status) {
+  var print = (status === 0) ? console.log : console.error;
+  print("usage: " + path.basename(process.argv[1]) + " [--ecma3|--ecma5|--ecma6|--ecma7|--ecma8|--ecma9|...|--ecma2015|--ecma2016|--ecma2017|--ecma2018|...]");
+  print("        [--tokenize] [--locations] [--allow-hash-bang] [--allow-await-outside-function] [--compact] [--silent] [--module] [--help] [--] [<infile>...]");
+  process.exit(status);
+}
+
+for (var i = 2; i < process.argv.length; ++i) {
+  var arg = process.argv[i];
+  if (arg[0] !== "-" || arg === "-") { inputFilePaths.push(arg); }
+  else if (arg === "--") {
+    inputFilePaths.push.apply(inputFilePaths, process.argv.slice(i + 1));
+    forceFileName = true;
+    break
+  } else if (arg === "--locations") { options.locations = true; }
+  else if (arg === "--allow-hash-bang") { options.allowHashBang = true; }
+  else if (arg === "--allow-await-outside-function") { options.allowAwaitOutsideFunction = true; }
+  else if (arg === "--silent") { silent = true; }
+  else if (arg === "--compact") { compact = true; }
+  else if (arg === "--help") { help(0); }
+  else if (arg === "--tokenize") { tokenize = true; }
+  else if (arg === "--module") { options.sourceType = "module"; }
+  else {
+    var match = arg.match(/^--ecma(\d+)$/);
+    if (match)
+      { options.ecmaVersion = +match[1]; }
+    else
+      { help(1); }
+  }
+}
+
+function run(codeList) {
+  var result = [], fileIdx = 0;
+  try {
+    codeList.forEach(function (code, idx) {
+      fileIdx = idx;
+      if (!tokenize) {
+        result = acorn__namespace.parse(code, options);
+        options.program = result;
+      } else {
+        var tokenizer = acorn__namespace.tokenizer(code, options), token;
+        do {
+          token = tokenizer.getToken();
+          result.push(token);
+        } while (token.type !== acorn__namespace.tokTypes.eof)
+      }
+    });
+  } catch (e) {
+    console.error(fileMode ? e.message.replace(/\(\d+:\d+\)$/, function (m) { return m.slice(0, 1) + inputFilePaths[fileIdx] + " " + m.slice(1); }) : e.message);
+    process.exit(1);
+  }
+  if (!silent) { console.log(JSON.stringify(result, null, compact ? null : 2)); }
+}
+
+if (fileMode = inputFilePaths.length && (forceFileName || !inputFilePaths.includes("-") || inputFilePaths.length !== 1)) {
+  run(inputFilePaths.map(function (path) { return fs.readFileSync(path, "utf8"); }));
+} else {
+  var code = "";
+  process.stdin.resume();
+  process.stdin.on("data", function (chunk) { return code += chunk; });
+  process.stdin.on("end", function () { return run([code]); });
+}
diff --git a/node_modules/mathjs/examples/node_modules/acorn/package.json b/node_modules/mathjs/examples/node_modules/acorn/package.json
new file mode 100644
index 0000000..8e2edc6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/acorn/package.json
@@ -0,0 +1,46 @@
+{
+  "name": "acorn",
+  "description": "ECMAScript parser",
+  "homepage": "https://github.com/acornjs/acorn",
+  "main": "dist/acorn.js",
+  "types": "dist/acorn.d.ts",
+  "module": "dist/acorn.mjs",
+  "exports": {
+    ".": [
+      {
+        "import": "./dist/acorn.mjs",
+        "require": "./dist/acorn.js",
+        "default": "./dist/acorn.js"
+      },
+      "./dist/acorn.js"
+    ],
+    "./package.json": "./package.json"
+  },
+  "version": "8.7.0",
+  "engines": {"node": ">=0.4.0"},
+  "maintainers": [
+    {
+      "name": "Marijn Haverbeke",
+      "email": "marijnh@gmail.com",
+      "web": "https://marijnhaverbeke.nl"
+    },
+    {
+      "name": "Ingvar Stepanyan",
+      "email": "me@rreverser.com",
+      "web": "https://rreverser.com/"
+    },
+    {
+      "name": "Adrian Heine",
+      "web": "http://adrianheine.de"
+    }
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/acornjs/acorn.git"
+  },
+  "license": "MIT",
+  "scripts": {
+    "prepare": "cd ..; npm run build:main"
+  },
+  "bin": {"acorn": "./bin/acorn"}
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/LICENSE b/node_modules/mathjs/examples/node_modules/ajv-keywords/LICENSE
new file mode 100644
index 0000000..90139aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Evgeny Poberezkin
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/README.md b/node_modules/mathjs/examples/node_modules/ajv-keywords/README.md
new file mode 100644
index 0000000..1964a22
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/README.md
@@ -0,0 +1,836 @@
+# ajv-keywords
+
+Custom JSON-Schema keywords for [Ajv](https://github.com/epoberezkin/ajv) validator
+
+[![Build Status](https://travis-ci.org/ajv-validator/ajv-keywords.svg?branch=master)](https://travis-ci.org/ajv-validator/ajv-keywords)
+[![npm](https://img.shields.io/npm/v/ajv-keywords.svg)](https://www.npmjs.com/package/ajv-keywords)
+[![npm downloads](https://img.shields.io/npm/dm/ajv-keywords.svg)](https://www.npmjs.com/package/ajv-keywords)
+[![Coverage Status](https://coveralls.io/repos/github/ajv-validator/ajv-keywords/badge.svg?branch=master)](https://coveralls.io/github/ajv-validator/ajv-keywords?branch=master)
+[![Dependabot](https://api.dependabot.com/badges/status?host=github&repo=ajv-validator/ajv-keywords)](https://app.dependabot.com/accounts/ajv-validator/repos/60477053)
+[![Gitter](https://img.shields.io/gitter/room/ajv-validator/ajv.svg)](https://gitter.im/ajv-validator/ajv)
+
+
+## Contents
+
+- [Install](#install)
+- [Usage](#usage)
+- [Keywords](#keywords)
+  - [Types](#types)
+    - [typeof](#typeof)
+    - [instanceof](#instanceof)
+  - [Keywords for numbers](#keywords-for-numbers)
+    - [range and exclusiveRange](#range-and-exclusiverange)
+  - [Keywords for strings](#keywords-for-strings)
+    - [regexp](#regexp)
+    - [formatMaximum / formatMinimum and formatExclusiveMaximum / formatExclusiveMinimum](#formatmaximum--formatminimum-and-formatexclusivemaximum--formatexclusiveminimum)
+    - [transform](#transform)<sup>\*</sup>
+  - [Keywords for arrays](#keywords-for-arrays)
+    - [uniqueItemProperties](#uniqueitemproperties)
+  - [Keywords for objects](#keywords-for-objects)
+    - [allRequired](#allrequired)
+    - [anyRequired](#anyrequired)
+    - [oneRequired](#onerequired)
+    - [patternRequired](#patternrequired)
+    - [prohibited](#prohibited)
+    - [deepProperties](#deepproperties)
+    - [deepRequired](#deeprequired)
+  - [Compound keywords](#compound-keywords)
+    - [switch](#switch) (deprecated)
+    - [select/selectCases/selectDefault](#selectselectcasesselectdefault) (BETA)
+  - [Keywords for all types](#keywords-for-all-types)
+    - [dynamicDefaults](#dynamicdefaults)<sup>\*</sup>
+- [Security contact](#security-contact)
+- [Open-source software support](#open-source-software-support)
+- [License](#license)
+
+<sup>\*</sup> - keywords that modify data
+
+
+## Install
+
+```
+npm install ajv-keywords
+```
+
+
+## Usage
+
+To add all available keywords:
+
+```javascript
+var Ajv = require('ajv');
+var ajv = new Ajv;
+require('ajv-keywords')(ajv);
+
+ajv.validate({ instanceof: 'RegExp' }, /.*/); // true
+ajv.validate({ instanceof: 'RegExp' }, '.*'); // false
+```
+
+To add a single keyword:
+
+```javascript
+require('ajv-keywords')(ajv, 'instanceof');
+```
+
+To add multiple keywords:
+
+```javascript
+require('ajv-keywords')(ajv, ['typeof', 'instanceof']);
+```
+
+To add a single keyword in browser (to avoid adding unused code):
+
+```javascript
+require('ajv-keywords/keywords/instanceof')(ajv);
+```
+
+
+## Keywords
+
+### Types
+
+#### `typeof`
+
+Based on JavaScript `typeof` operation.
+
+The value of the keyword should be a string (`"undefined"`, `"string"`, `"number"`, `"object"`, `"function"`, `"boolean"` or `"symbol"`) or array of strings.
+
+To pass validation the result of `typeof` operation on the value should be equal to the string (or one of the strings in the array).
+
+```
+ajv.validate({ typeof: 'undefined' }, undefined); // true
+ajv.validate({ typeof: 'undefined' }, null); // false
+ajv.validate({ typeof: ['undefined', 'object'] }, null); // true
+```
+
+
+#### `instanceof`
+
+Based on JavaScript `instanceof` operation.
+
+The value of the keyword should be a string (`"Object"`, `"Array"`, `"Function"`, `"Number"`, `"String"`, `"Date"`, `"RegExp"`, `"Promise"` or `"Buffer"`) or array of strings.
+
+To pass validation the result of `data instanceof ...` operation on the value should be true:
+
+```
+ajv.validate({ instanceof: 'Array' }, []); // true
+ajv.validate({ instanceof: 'Array' }, {}); // false
+ajv.validate({ instanceof: ['Array', 'Function'] }, function(){}); // true
+```
+
+You can add your own constructor function to be recognised by this keyword:
+
+```javascript
+function MyClass() {}
+var instanceofDefinition = require('ajv-keywords').get('instanceof').definition;
+// or require('ajv-keywords/keywords/instanceof').definition;
+instanceofDefinition.CONSTRUCTORS.MyClass = MyClass;
+
+ajv.validate({ instanceof: 'MyClass' }, new MyClass); // true
+```
+
+
+### Keywords for numbers
+
+#### `range` and `exclusiveRange`
+
+Syntax sugar for the combination of minimum and maximum keywords, also fails schema compilation if there are no numbers in the range.
+
+The value of this keyword must be the array consisting of two numbers, the second must be greater or equal than the first one.
+
+If the validated value is not a number the validation passes, otherwise to pass validation the value should be greater (or equal) than the first number and smaller (or equal) than the second number in the array. If `exclusiveRange` keyword is present in the same schema and its value is true, the validated value must not be equal to the range boundaries.
+
+```javascript
+var schema = { range: [1, 3] };
+ajv.validate(schema, 1); // true
+ajv.validate(schema, 2); // true
+ajv.validate(schema, 3); // true
+ajv.validate(schema, 0.99); // false
+ajv.validate(schema, 3.01); // false
+
+var schema = { range: [1, 3], exclusiveRange: true };
+ajv.validate(schema, 1.01); // true
+ajv.validate(schema, 2); // true
+ajv.validate(schema, 2.99); // true
+ajv.validate(schema, 1); // false
+ajv.validate(schema, 3); // false
+```
+
+
+### Keywords for strings
+
+#### `regexp`
+
+This keyword allows to use regular expressions with flags in schemas (the standard `pattern` keyword does not support flags).
+
+This keyword applies only to strings. If the data is not a string, the validation succeeds.
+
+The value of this keyword can be either a string (the result of `regexp.toString()`) or an object with the properties `pattern` and `flags` (the same strings that should be passed to RegExp constructor).
+
+```javascript
+var schema = {
+  type: 'object',
+  properties: {
+    foo: { regexp: '/foo/i' },
+    bar: { regexp: { pattern: 'bar', flags: 'i' } }
+  }
+};
+
+var validData = {
+  foo: 'Food',
+  bar: 'Barmen'
+};
+
+var invalidData = {
+  foo: 'fog',
+  bar: 'bad'
+};
+```
+
+
+#### `formatMaximum` / `formatMinimum` and `formatExclusiveMaximum` / `formatExclusiveMinimum`
+
+These keywords allow to define minimum/maximum constraints when the format keyword defines ordering.
+
+These keywords apply only to strings. If the data is not a string, the validation succeeds.
+
+The value of keyword `formatMaximum` (`formatMinimum`) should be a string. This value is the maximum (minimum) allowed value for the data to be valid as determined by `format` keyword. If `format` is not present schema compilation will throw exception.
+
+When this keyword is added, it defines comparison rules for formats `"date"`, `"time"` and `"date-time"`. Custom formats also can have comparison rules. See [addFormat](https://github.com/epoberezkin/ajv#api-addformat) method.
+
+The value of keyword `formatExclusiveMaximum` (`formatExclusiveMinimum`) should be a boolean value. These keyword cannot be used without `formatMaximum` (`formatMinimum`). If this keyword value is equal to `true`, the data to be valid should not be equal to the value in `formatMaximum` (`formatMinimum`) keyword.
+
+```javascript
+require('ajv-keywords')(ajv, ['formatMinimum', 'formatMaximum']);
+
+var schema = {
+  format: 'date',
+  formatMinimum: '2016-02-06',
+  formatMaximum: '2016-12-27',
+  formatExclusiveMaximum: true
+}
+
+var validDataList = ['2016-02-06', '2016-12-26', 1];
+
+var invalidDataList = ['2016-02-05', '2016-12-27', 'abc'];
+```
+
+
+#### `transform`
+
+This keyword allows a string to be modified before validation. 
+
+These keywords apply only to strings. If the data is not a string, the transform is skipped.
+
+There are limitation due to how ajv is written:
+- a stand alone string cannot be transformed. ie `data = 'a'; ajv.validate(schema, data);`
+- currently cannot work with `ajv-pack`
+
+**Supported options:**
+- `trim`: remove whitespace from start and end
+- `trimLeft`: remove whitespace from start
+- `trimRight`: remove whitespace from end
+- `toLowerCase`: case string to all lower case
+- `toUpperCase`: case string to all upper case
+- `toEnumCase`: case string to match case in schema
+
+Options are applied in the order they are listed.
+
+Note: `toEnumCase` requires that all allowed values are unique when case insensitive.
+
+**Example: multiple options**
+```javascript
+require('ajv-keywords')(ajv, ['transform']);
+
+var schema = {
+  type: 'array',
+  items: {
+    type:'string',
+    transform:['trim','toLowerCase']
+  }
+};
+
+var data = ['  MixCase  '];
+ajv.validate(schema, data);
+console.log(data); // ['mixcase']
+
+```
+
+**Example: `enumcase`**
+```javascript
+require('ajv-keywords')(ajv, ['transform']);
+
+var schema = {
+  type: 'array',
+  items: {
+    type:'string',
+    transform:['trim','toEnumCase'],
+    enum:['pH']
+  }
+};
+
+var data = ['ph',' Ph','PH','pH '];
+ajv.validate(schema, data);
+console.log(data); // ['pH','pH','pH','pH']
+```
+
+
+### Keywords for arrays
+
+#### `uniqueItemProperties`
+
+The keyword allows to check that some properties in array items are unique.
+
+This keyword applies only to arrays. If the data is not an array, the validation succeeds.
+
+The value of this keyword must be an array of strings - property names that should have unique values across all items.
+
+```javascript
+var schema = { uniqueItemProperties: [ "id", "name" ] };
+
+var validData = [
+  { id: 1 },
+  { id: 2 },
+  { id: 3 }
+];
+
+var invalidData1 = [
+  { id: 1 },
+  { id: 1 }, // duplicate "id"
+  { id: 3 }
+];
+
+var invalidData2 = [
+  { id: 1, name: "taco" },
+  { id: 2, name: "taco" }, // duplicate "name"
+  { id: 3, name: "salsa" }
+];
+```
+
+This keyword is contributed by [@blainesch](https://github.com/blainesch).
+
+
+### Keywords for objects
+
+#### `allRequired`
+
+This keyword allows to require the presence of all properties used in `properties` keyword in the same schema object.
+
+This keyword applies only to objects. If the data is not an object, the validation succeeds.
+
+The value of this keyword must be boolean.
+
+If the value of the keyword is `false`, the validation succeeds.
+
+If the value of the keyword is `true`, the validation succeeds if the data contains all properties defined in `properties` keyword (in the same schema object).
+
+If the `properties` keyword is not present in the same schema object, schema compilation will throw exception.
+
+```javascript
+var schema = {
+  properties: {
+    foo: {type: 'number'},
+    bar: {type: 'number'}
+  }
+  allRequired: true
+};
+
+var validData = { foo: 1, bar: 2 };
+var alsoValidData = { foo: 1, bar: 2, baz: 3 };
+
+var invalidDataList = [ {}, { foo: 1 }, { bar: 2 } ];
+```
+
+
+#### `anyRequired`
+
+This keyword allows to require the presence of any (at least one) property from the list.
+
+This keyword applies only to objects. If the data is not an object, the validation succeeds.
+
+The value of this keyword must be an array of strings, each string being a property name. For data object to be valid at least one of the properties in this array should be present in the object.
+
+```javascript
+var schema = {
+  anyRequired: ['foo', 'bar']
+};
+
+var validData = { foo: 1 };
+var alsoValidData = { foo: 1, bar: 2 };
+
+var invalidDataList = [ {}, { baz: 3 } ];
+```
+
+
+#### `oneRequired`
+
+This keyword allows to require the presence of only one property from the list.
+
+This keyword applies only to objects. If the data is not an object, the validation succeeds.
+
+The value of this keyword must be an array of strings, each string being a property name. For data object to be valid exactly one of the properties in this array should be present in the object.
+
+```javascript
+var schema = {
+  oneRequired: ['foo', 'bar']
+};
+
+var validData = { foo: 1 };
+var alsoValidData = { bar: 2, baz: 3 };
+
+var invalidDataList = [ {}, { baz: 3 }, { foo: 1, bar: 2 } ];
+```
+
+
+#### `patternRequired`
+
+This keyword allows to require the presence of properties that match some pattern(s).
+
+This keyword applies only to objects. If the data is not an object, the validation succeeds.
+
+The value of this keyword should be an array of strings, each string being a regular expression. For data object to be valid each regular expression in this array should match at least one property name in the data object.
+
+If the array contains multiple regular expressions, more than one expression can match the same property name.
+
+```javascript
+var schema = { patternRequired: [ 'f.*o', 'b.*r' ] };
+
+var validData = { foo: 1, bar: 2 };
+var alsoValidData = { foobar: 3 };
+
+var invalidDataList = [ {}, { foo: 1 }, { bar: 2 } ];
+```
+
+
+#### `prohibited`
+
+This keyword allows to prohibit that any of the properties in the list is present in the object.
+
+This keyword applies only to objects. If the data is not an object, the validation succeeds.
+
+The value of this keyword should be an array of strings, each string being a property name. For data object to be valid none of the properties in this array should be present in the object.
+
+```
+var schema = { prohibited: ['foo', 'bar']};
+
+var validData = { baz: 1 };
+var alsoValidData = {};
+
+var invalidDataList = [
+  { foo: 1 },
+  { bar: 2 },
+  { foo: 1, bar: 2}
+];
+```
+
+__Please note__: `{prohibited: ['foo', 'bar']}` is equivalent to `{not: {anyRequired: ['foo', 'bar']}}` (i.e. it has the same validation result for any data).
+
+
+#### `deepProperties`
+
+This keyword allows to validate deep properties (identified by JSON pointers).
+
+This keyword applies only to objects. If the data is not an object, the validation succeeds.
+
+The value should be an object, where keys are JSON pointers to the data, starting from the current position in data, and the values are JSON schemas. For data object to be valid the value of each JSON pointer should be valid according to the corresponding schema.
+
+```javascript
+var schema = {
+  type: 'object',
+  deepProperties: {
+    "/users/1/role": { "enum": ["admin"] }
+  }
+};
+
+var validData = {
+  users: [
+    {},
+    {
+      id: 123,
+      role: 'admin'
+    }
+  ]
+};
+
+var alsoValidData = {
+  users: {
+    "1": {
+      id: 123,
+      role: 'admin'
+    }
+  }
+};
+
+var invalidData = {
+  users: [
+    {},
+    {
+      id: 123,
+      role: 'user'
+    }
+  ]
+};
+
+var alsoInvalidData = {
+  users: {
+    "1": {
+      id: 123,
+      role: 'user'
+    }
+  }
+};
+```
+
+
+#### `deepRequired`
+
+This keyword allows to check that some deep properties (identified by JSON pointers) are available.
+
+This keyword applies only to objects. If the data is not an object, the validation succeeds.
+
+The value should be an array of JSON pointers to the data, starting from the current position in data. For data object to be valid each JSON pointer should be some existing part of the data.
+
+```javascript
+var schema = {
+  type: 'object',
+  deepRequired: ["/users/1/role"]
+};
+
+var validData = {
+  users: [
+    {},
+    {
+      id: 123,
+      role: 'admin'
+    }
+  ]
+};
+
+var invalidData = {
+  users: [
+    {},
+    {
+      id: 123
+    }
+  ]
+};
+```
+
+See [json-schema-org/json-schema-spec#203](https://github.com/json-schema-org/json-schema-spec/issues/203#issue-197211916) for an example of the equivalent schema without `deepRequired` keyword.
+
+
+### Compound keywords
+
+#### `switch` (deprecated)
+
+__Please note__: this keyword is provided to preserve backward compatibility with previous versions of Ajv. It is strongly recommended to use `if`/`then`/`else` keywords instead, as they have been added to the draft-07 of JSON Schema specification.
+
+This keyword allows to perform advanced conditional validation.
+
+The value of the keyword is the array of if/then clauses. Each clause is the object with the following properties:
+
+- `if` (optional) - the value is JSON-schema
+- `then` (required) - the value is JSON-schema or boolean
+- `continue` (optional) - the value is boolean
+
+The validation process is dynamic; all clauses are executed sequentially in the following way:
+
+1. `if`:
+    1.  `if` property is JSON-schema according to which the data is:
+        1.  valid => go to step 2.
+        2.  invalid => go to the NEXT clause, if this was the last clause the validation of `switch` SUCCEEDS.
+    2.  `if` property is absent => go to step 2.
+2. `then`:
+    1.  `then` property is `true` or it is JSON-schema according to which the data is valid => go to step 3.
+    2.  `then` property is `false` or it is JSON-schema according to which the data is invalid => the validation of `switch` FAILS.
+3. `continue`:
+    1.  `continue` property is `true` => go to the NEXT clause, if this was the last clause the validation of `switch` SUCCEEDS.
+    2.  `continue` property is `false` or absent => validation of `switch` SUCCEEDS.
+
+```javascript
+require('ajv-keywords')(ajv, 'switch');
+
+var schema = {
+  type: 'array',
+  items: {
+    type: 'integer',
+    'switch': [
+      { if: { not: { minimum: 1 } }, then: false },
+      { if: { maximum: 10 }, then: true },
+      { if: { maximum: 100 }, then: { multipleOf: 10 } },
+      { if: { maximum: 1000 }, then: { multipleOf: 100 } },
+      { then: false }
+    ]
+  }
+};
+
+var validItems = [1, 5, 10, 20, 50, 100, 200, 500, 1000];
+
+var invalidItems = [1, 0, 2000, 11, 57, 123, 'foo'];
+```
+
+The above schema is equivalent to (for example):
+
+```javascript
+{
+  type: 'array',
+  items: {
+    type: 'integer',
+    if: { minimum: 1, maximum: 10 },
+    then: true,
+    else: {
+      if: { maximum: 100 },
+      then: { multipleOf: 10 },
+      else: {
+        if: { maximum: 1000 },
+        then: { multipleOf: 100 },
+        else: false
+      }
+    }
+  }
+}
+```
+
+
+#### `select`/`selectCases`/`selectDefault`
+
+These keywords allow to choose the schema to validate the data based on the value of some property in the validated data.
+
+These keywords must be present in the same schema object (`selectDefault` is optional).
+
+The value of `select` keyword should be a [$data reference](https://github.com/epoberezkin/ajv/tree/5.0.2-beta.0#data-reference) that points to any primitive JSON type (string, number, boolean or null) in the data that is validated. You can also use a constant of primitive type as the value of this keyword (e.g., for debugging purposes).
+
+The value of `selectCases` keyword must be an object where each property name is a possible string representation of the value of `select` keyword and each property value is a corresponding schema (from draft-06 it can be boolean) that must be used to validate the data.
+
+The value of `selectDefault` keyword is a schema (from draft-06 it can be boolean) that must be used to validate the data in case `selectCases` has no key equal to the stringified value of `select` keyword.
+
+The validation succeeds in one of the following cases:
+- the validation of data using selected schema succeeds,
+- none of the schemas is selected for validation,
+- the value of select is undefined (no property in the data that the data reference points to).
+
+If `select` value (in data) is not a primitive type the validation fails.
+
+__Please note__: these keywords require Ajv `$data` option to support [$data reference](https://github.com/epoberezkin/ajv/tree/5.0.2-beta.0#data-reference).
+
+
+```javascript
+require('ajv-keywords')(ajv, 'select');
+
+var schema = {
+  type: object,
+  required: ['kind'],
+  properties: {
+    kind: { type: 'string' }
+  },
+  select: { $data: '0/kind' },
+  selectCases: {
+    foo: {
+      required: ['foo'],
+      properties: {
+        kind: {},
+        foo: { type: 'string' }
+      },
+      additionalProperties: false
+    },
+    bar: {
+      required: ['bar'],
+      properties: {
+        kind: {},
+        bar: { type: 'number' }
+      },
+      additionalProperties: false
+    }
+  },
+  selectDefault: {
+    propertyNames: {
+      not: { enum: ['foo', 'bar'] }
+    }
+  }
+};
+
+var validDataList = [
+  { kind: 'foo', foo: 'any' },
+  { kind: 'bar', bar: 1 },
+  { kind: 'anything_else', not_bar_or_foo: 'any value' }
+];
+
+var invalidDataList = [
+  { kind: 'foo' }, // no propery foo
+  { kind: 'bar' }, // no propery bar
+  { kind: 'foo', foo: 'any', another: 'any value' }, // additional property
+  { kind: 'bar', bar: 1, another: 'any value' }, // additional property
+  { kind: 'anything_else', foo: 'any' } // property foo not allowed
+  { kind: 'anything_else', bar: 1 } // property bar not allowed
+];
+```
+
+__Please note__: the current implementation is BETA. It does not allow using relative URIs in $ref keywords in schemas in `selectCases` and `selectDefault` that point outside of these schemas. The workaround is to use absolute URIs (that can point to any (sub-)schema added to Ajv, including those inside the current root schema where `select` is used). See [tests](https://github.com/epoberezkin/ajv-keywords/blob/v2.0.0/spec/tests/select.json#L314).
+
+
+### Keywords for all types
+
+#### `dynamicDefaults`
+
+This keyword allows to assign dynamic defaults to properties, such as timestamps, unique IDs etc.
+
+This keyword only works if `useDefaults` options is used and not inside `anyOf` keywords etc., in the same way as [default keyword treated by Ajv](https://github.com/epoberezkin/ajv#assigning-defaults).
+
+The keyword should be added on the object level. Its value should be an object with each property corresponding to a property name, in the same way as in standard `properties` keyword. The value of each property can be:
+
+- an identifier of default function (a string)
+- an object with properties `func` (an identifier) and `args` (an object with parameters that will be passed to this function during schema compilation - see examples).
+
+The properties used in `dynamicDefaults` should not be added to `required` keyword (or validation will fail), because unlike `default` this keyword is processed after validation.
+
+There are several predefined dynamic default functions:
+
+- `"timestamp"` - current timestamp in milliseconds
+- `"datetime"` - current date and time as string (ISO, valid according to `date-time` format)
+- `"date"` - current date as string (ISO, valid according to `date` format)
+- `"time"` - current time as string (ISO, valid according to `time` format)
+- `"random"` - pseudo-random number in [0, 1) interval
+- `"randomint"` - pseudo-random integer number. If string is used as a property value, the function will randomly return 0 or 1. If object `{ func: 'randomint', args: { max: N } }` is used then the default will be an integer number in [0, N) interval.
+- `"seq"` - sequential integer number starting from 0. If string is used as a property value, the default sequence will be used. If object `{ func: 'seq', args: { name: 'foo'} }` is used then the sequence with name `"foo"` will be used. Sequences are global, even if different ajv instances are used.
+
+```javascript
+var schema = {
+  type: 'object',
+  dynamicDefaults: {
+    ts: 'datetime',
+    r: { func: 'randomint', args: { max: 100 } },
+    id: { func: 'seq', args: { name: 'id' } }
+  },
+  properties: {
+    ts: {
+      type: 'string',
+      format: 'date-time'
+    },
+    r: {
+      type: 'integer',
+      minimum: 0,
+      exclusiveMaximum: 100
+    },
+    id: {
+      type: 'integer',
+      minimum: 0
+    }
+  }
+};
+
+var data = {};
+ajv.validate(data); // true
+data; // { ts: '2016-12-01T22:07:28.829Z', r: 25, id: 0 }
+
+var data1 = {};
+ajv.validate(data1); // true
+data1; // { ts: '2016-12-01T22:07:29.832Z', r: 68, id: 1 }
+
+ajv.validate(data1); // true
+data1; // didn't change, as all properties were defined
+```
+
+When using the `useDefaults` option value `"empty"`, properties and items equal to `null` or `""` (empty string) will be considered missing and assigned defaults.  Use the `allOf` [compound keyword](https://github.com/epoberezkin/ajv/blob/master/KEYWORDS.md#compound-keywords) to execute `dynamicDefaults` before validation.
+
+```javascript
+var schema = {
+  allOf: [
+    {
+      dynamicDefaults: {
+        ts: 'datetime',
+        r: { func: 'randomint', args: { min: 5, max: 100 } },
+        id: { func: 'seq', args: { name: 'id' } }
+      }
+    },
+    {
+      type: 'object',
+      properties: {
+        ts: {
+          type: 'string'
+        },
+        r: {
+          type: 'number',
+          minimum: 5,
+          exclusiveMaximum: 100
+        },
+        id: {
+          type: 'integer',
+          minimum: 0
+        }
+      }
+    }
+  ]
+};
+
+var data = { ts: '', r: null };
+ajv.validate(data); // true
+data; // { ts: '2016-12-01T22:07:28.829Z', r: 25, id: 0 }
+```
+
+You can add your own dynamic default function to be recognised by this keyword:
+
+```javascript
+var uuid = require('uuid');
+
+function uuidV4() { return uuid.v4(); }
+
+var definition = require('ajv-keywords').get('dynamicDefaults').definition;
+// or require('ajv-keywords/keywords/dynamicDefaults').definition;
+definition.DEFAULTS.uuid = uuidV4;
+
+var schema = {
+  dynamicDefaults: { id: 'uuid' },
+  properties: { id: { type: 'string', format: 'uuid' } }
+};
+
+var data = {};
+ajv.validate(schema, data); // true
+data; // { id: 'a1183fbe-697b-4030-9bcc-cfeb282a9150' };
+
+var data1 = {};
+ajv.validate(schema, data1); // true
+data1; // { id: '5b008de7-1669-467a-a5c6-70fa244d7209' }
+```
+
+You also can define dynamic default that accepts parameters, e.g. version of uuid:
+
+```javascript
+var uuid = require('uuid');
+
+function getUuid(args) {
+  var version = 'v' + (arvs && args.v || 4);
+  return function() {
+    return uuid[version]();
+  };
+}
+
+var definition = require('ajv-keywords').get('dynamicDefaults').definition;
+definition.DEFAULTS.uuid = getUuid;
+
+var schema = {
+  dynamicDefaults: {
+    id1: 'uuid', // v4
+    id2: { func: 'uuid', v: 4 }, // v4
+    id3: { func: 'uuid', v: 1 } // v1
+  }
+};
+```
+
+
+## Security contact
+
+To report a security vulnerability, please use the
+[Tidelift security contact](https://tidelift.com/security).
+Tidelift will coordinate the fix and disclosure.
+
+Please do NOT report security vulnerabilities via GitHub issues.
+
+
+## Open-source software support
+
+Ajv-keywords is a part of [Tidelift subscription](https://tidelift.com/subscription/pkg/npm-ajv-keywords?utm_source=npm-ajv-keywords&utm_medium=referral&utm_campaign=readme) - it provides a centralised support to open-source software users, in addition to the support provided by software maintainers.
+
+
+## License
+
+[MIT](https://github.com/epoberezkin/ajv-keywords/blob/master/LICENSE)
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/ajv-keywords.d.ts b/node_modules/mathjs/examples/node_modules/ajv-keywords/ajv-keywords.d.ts
new file mode 100644
index 0000000..2d562ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/ajv-keywords.d.ts
@@ -0,0 +1,7 @@
+declare module 'ajv-keywords' {
+  import { Ajv } from 'ajv';
+
+  function keywords(ajv: Ajv, include?: string | string[]): Ajv;
+
+  export = keywords;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/index.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/index.js
new file mode 100644
index 0000000..07a8eda
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/index.js
@@ -0,0 +1,35 @@
+'use strict';
+
+var KEYWORDS = require('./keywords');
+
+module.exports = defineKeywords;
+
+
+/**
+ * Defines one or several keywords in ajv instance
+ * @param  {Ajv} ajv validator instance
+ * @param  {String|Array<String>|undefined} keyword keyword(s) to define
+ * @return {Ajv} ajv instance (for chaining)
+ */
+function defineKeywords(ajv, keyword) {
+  if (Array.isArray(keyword)) {
+    for (var i=0; i<keyword.length; i++)
+      get(keyword[i])(ajv);
+    return ajv;
+  }
+  if (keyword) {
+    get(keyword)(ajv);
+    return ajv;
+  }
+  for (keyword in KEYWORDS) get(keyword)(ajv);
+  return ajv;
+}
+
+
+defineKeywords.get = get;
+
+function get(keyword) {
+  var defFunc = KEYWORDS[keyword];
+  if (!defFunc) throw new Error('Unknown keyword ' + keyword);
+  return defFunc;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/_formatLimit.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/_formatLimit.js
new file mode 100644
index 0000000..e731a8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/_formatLimit.js
@@ -0,0 +1,101 @@
+'use strict';
+
+var TIME = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d:\d\d)?$/i;
+var DATE_TIME_SEPARATOR = /t|\s/i;
+
+var COMPARE_FORMATS = {
+  date: compareDate,
+  time: compareTime,
+  'date-time': compareDateTime
+};
+
+var $dataMetaSchema = {
+  type: 'object',
+  required: [ '$data' ],
+  properties: {
+    $data: {
+      type: 'string',
+      anyOf: [
+        { format: 'relative-json-pointer' },
+        { format: 'json-pointer' }
+      ]
+    }
+  },
+  additionalProperties: false
+};
+
+module.exports = function (minMax) {
+  var keyword = 'format' + minMax;
+  return function defFunc(ajv) {
+    defFunc.definition = {
+      type: 'string',
+      inline: require('./dotjs/_formatLimit'),
+      statements: true,
+      errors: 'full',
+      dependencies: ['format'],
+      metaSchema: {
+        anyOf: [
+          {type: 'string'},
+          $dataMetaSchema
+        ]
+      }
+    };
+
+    ajv.addKeyword(keyword, defFunc.definition);
+    ajv.addKeyword('formatExclusive' + minMax, {
+      dependencies: ['format' + minMax],
+      metaSchema: {
+        anyOf: [
+          {type: 'boolean'},
+          $dataMetaSchema
+        ]
+      }
+    });
+    extendFormats(ajv);
+    return ajv;
+  };
+};
+
+
+function extendFormats(ajv) {
+  var formats = ajv._formats;
+  for (var name in COMPARE_FORMATS) {
+    var format = formats[name];
+    // the last condition is needed if it's RegExp from another window
+    if (typeof format != 'object' || format instanceof RegExp || !format.validate)
+      format = formats[name] = { validate: format };
+    if (!format.compare)
+      format.compare = COMPARE_FORMATS[name];
+  }
+}
+
+
+function compareDate(d1, d2) {
+  if (!(d1 && d2)) return;
+  if (d1 > d2) return 1;
+  if (d1 < d2) return -1;
+  if (d1 === d2) return 0;
+}
+
+
+function compareTime(t1, t2) {
+  if (!(t1 && t2)) return;
+  t1 = t1.match(TIME);
+  t2 = t2.match(TIME);
+  if (!(t1 && t2)) return;
+  t1 = t1[1] + t1[2] + t1[3] + (t1[4]||'');
+  t2 = t2[1] + t2[2] + t2[3] + (t2[4]||'');
+  if (t1 > t2) return 1;
+  if (t1 < t2) return -1;
+  if (t1 === t2) return 0;
+}
+
+
+function compareDateTime(dt1, dt2) {
+  if (!(dt1 && dt2)) return;
+  dt1 = dt1.split(DATE_TIME_SEPARATOR);
+  dt2 = dt2.split(DATE_TIME_SEPARATOR);
+  var res = compareDate(dt1[0], dt2[0]);
+  if (res === undefined) return;
+  return res || compareTime(dt1[1], dt2[1]);
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/_util.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/_util.js
new file mode 100644
index 0000000..dd52df7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/_util.js
@@ -0,0 +1,15 @@
+'use strict';
+
+module.exports = {
+  metaSchemaRef: metaSchemaRef
+};
+
+var META_SCHEMA_ID = 'http://json-schema.org/draft-07/schema';
+
+function metaSchemaRef(ajv) {
+  var defaultMeta = ajv._opts.defaultMeta;
+  if (typeof defaultMeta == 'string') return { $ref: defaultMeta };
+  if (ajv.getSchema(META_SCHEMA_ID)) return { $ref: META_SCHEMA_ID };
+  console.warn('meta schema not defined');
+  return {};
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/allRequired.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/allRequired.js
new file mode 100644
index 0000000..afc73eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/allRequired.js
@@ -0,0 +1,18 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'object',
+    macro: function (schema, parentSchema) {
+      if (!schema) return true;
+      var properties = Object.keys(parentSchema.properties);
+      if (properties.length == 0) return true;
+      return {required: properties};
+    },
+    metaSchema: {type: 'boolean'},
+    dependencies: ['properties']
+  };
+
+  ajv.addKeyword('allRequired', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/anyRequired.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/anyRequired.js
new file mode 100644
index 0000000..acc55a9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/anyRequired.js
@@ -0,0 +1,24 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'object',
+    macro: function (schema) {
+      if (schema.length == 0) return true;
+      if (schema.length == 1) return {required: schema};
+      var schemas = schema.map(function (prop) {
+        return {required: [prop]};
+      });
+      return {anyOf: schemas};
+    },
+    metaSchema: {
+      type: 'array',
+      items: {
+        type: 'string'
+      }
+    }
+  };
+
+  ajv.addKeyword('anyRequired', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/deepProperties.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/deepProperties.js
new file mode 100644
index 0000000..e5aff60
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/deepProperties.js
@@ -0,0 +1,54 @@
+'use strict';
+
+var util = require('./_util');
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'object',
+    macro: function (schema) {
+      var schemas = [];
+      for (var pointer in schema)
+        schemas.push(getSchema(pointer, schema[pointer]));
+      return {'allOf': schemas};
+    },
+    metaSchema: {
+      type: 'object',
+      propertyNames: {
+        type: 'string',
+        format: 'json-pointer'
+      },
+      additionalProperties: util.metaSchemaRef(ajv)
+    }
+  };
+
+  ajv.addKeyword('deepProperties', defFunc.definition);
+  return ajv;
+};
+
+
+function getSchema(jsonPointer, schema) {
+  var segments = jsonPointer.split('/');
+  var rootSchema = {};
+  var pointerSchema = rootSchema;
+  for (var i=1; i<segments.length; i++) {
+    var segment = segments[i];
+    var isLast = i == segments.length - 1;
+    segment = unescapeJsonPointer(segment);
+    var properties = pointerSchema.properties = {};
+    var items = undefined;
+    if (/[0-9]+/.test(segment)) {
+      var count = +segment;
+      items = pointerSchema.items = [];
+      while (count--) items.push({});
+    }
+    pointerSchema = isLast ? schema : {};
+    properties[segment] = pointerSchema;
+    if (items) items.push(pointerSchema);
+  }
+  return rootSchema;
+}
+
+
+function unescapeJsonPointer(str) {
+  return str.replace(/~1/g, '/').replace(/~0/g, '~');
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/deepRequired.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/deepRequired.js
new file mode 100644
index 0000000..29e8ab5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/deepRequired.js
@@ -0,0 +1,57 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'object',
+    inline: function (it, keyword, schema) {
+      var expr = '';
+      for (var i=0; i<schema.length; i++) {
+        if (i) expr += ' && ';
+        expr += '(' + getData(schema[i], it.dataLevel) + ' !== undefined)';
+      }
+      return expr;
+    },
+    metaSchema: {
+      type: 'array',
+      items: {
+        type: 'string',
+        format: 'json-pointer'
+      }
+    }
+  };
+
+  ajv.addKeyword('deepRequired', defFunc.definition);
+  return ajv;
+};
+
+
+function getData(jsonPointer, lvl) {
+  var data = 'data' + (lvl || '');
+  if (!jsonPointer) return data;
+
+  var expr = data;
+  var segments = jsonPointer.split('/');
+  for (var i=1; i<segments.length; i++) {
+    var segment = segments[i];
+    data += getProperty(unescapeJsonPointer(segment));
+    expr += ' && ' + data;
+  }
+  return expr;
+}
+
+
+var IDENTIFIER = /^[a-z$_][a-z$_0-9]*$/i;
+var INTEGER = /^[0-9]+$/;
+var SINGLE_QUOTE = /'|\\/g;
+function getProperty(key) {
+  return INTEGER.test(key)
+          ? '[' + key + ']'
+          : IDENTIFIER.test(key)
+            ? '.' + key
+            : "['" + key.replace(SINGLE_QUOTE, '\\$&') + "']";
+}
+
+
+function unescapeJsonPointer(str) {
+  return str.replace(/~1/g, '/').replace(/~0/g, '~');
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/_formatLimit.jst b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/_formatLimit.jst
new file mode 100644
index 0000000..f740965
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/_formatLimit.jst
@@ -0,0 +1,116 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+
+var {{=$valid}} = undefined;
+
+{{## def.skipFormatLimit:
+  {{=$valid}} = true;
+  {{ return out; }}
+#}}
+
+{{## def.compareFormat:
+  {{? $isData }}
+    if ({{=$schemaValue}} === undefined) {{=$valid}} = true;
+    else if (typeof {{=$schemaValue}} != 'string') {{=$valid}} = false;
+    else {
+    {{ $closingBraces += '}'; }}
+  {{?}}
+
+  {{? $isDataFormat }}
+    if (!{{=$compare}}) {{=$valid}} = true;
+    else {
+    {{ $closingBraces += '}'; }}
+  {{?}}
+
+  var {{=$result}} = {{=$compare}}({{=$data}}, {{# def.schemaValueQS }});
+
+  if ({{=$result}} === undefined) {{=$valid}} = false;
+#}}
+
+
+{{? it.opts.format === false }}{{# def.skipFormatLimit }}{{?}}
+
+{{
+  var $schemaFormat = it.schema.format
+    , $isDataFormat = it.opts.$data && $schemaFormat.$data
+    , $closingBraces = '';
+}}
+
+{{? $isDataFormat }}
+  {{
+    var $schemaValueFormat = it.util.getData($schemaFormat.$data, $dataLvl, it.dataPathArr)
+      , $format = 'format' + $lvl
+      , $compare = 'compare' + $lvl;
+  }}
+
+  var {{=$format}} = formats[{{=$schemaValueFormat}}]
+    , {{=$compare}} = {{=$format}} && {{=$format}}.compare;
+{{??}}
+  {{ var $format = it.formats[$schemaFormat]; }}
+  {{? !($format && $format.compare) }}
+    {{# def.skipFormatLimit }}
+  {{?}}
+  {{ var $compare = 'formats' + it.util.getProperty($schemaFormat) + '.compare'; }}
+{{?}}
+
+{{
+  var $isMax = $keyword == 'formatMaximum'
+    , $exclusiveKeyword = 'formatExclusive' + ($isMax ? 'Maximum' : 'Minimum')
+    , $schemaExcl = it.schema[$exclusiveKeyword]
+    , $isDataExcl = it.opts.$data && $schemaExcl && $schemaExcl.$data
+    , $op = $isMax ? '<' : '>'
+    , $result = 'result' + $lvl;
+}}
+
+{{# def.$data }}
+
+
+{{? $isDataExcl }}
+  {{
+    var $schemaValueExcl = it.util.getData($schemaExcl.$data, $dataLvl, it.dataPathArr)
+      , $exclusive = 'exclusive' + $lvl
+      , $opExpr = 'op' + $lvl
+      , $opStr = '\' + ' + $opExpr + ' + \'';
+  }}
+  var schemaExcl{{=$lvl}} = {{=$schemaValueExcl}};
+  {{ $schemaValueExcl = 'schemaExcl' + $lvl; }}
+
+  if (typeof {{=$schemaValueExcl}} != 'boolean' && {{=$schemaValueExcl}} !== undefined) {
+    {{=$valid}} = false;
+    {{ var $errorKeyword = $exclusiveKeyword; }}
+    {{# def.error:'_formatExclusiveLimit' }}
+  }
+
+  {{# def.elseIfValid }}
+
+  {{# def.compareFormat }}
+  var {{=$exclusive}} = {{=$schemaValueExcl}} === true;
+
+  if ({{=$valid}} === undefined) {
+    {{=$valid}} = {{=$exclusive}}
+                  ? {{=$result}} {{=$op}} 0
+                  : {{=$result}} {{=$op}}= 0;
+  }
+
+  if (!{{=$valid}}) var op{{=$lvl}} = {{=$exclusive}} ? '{{=$op}}' : '{{=$op}}=';
+{{??}}
+  {{
+    var $exclusive = $schemaExcl === true
+      , $opStr = $op;  /*used in error*/
+    if (!$exclusive) $opStr += '=';
+    var $opExpr = '\'' + $opStr + '\''; /*used in error*/
+  }}
+
+  {{# def.compareFormat }}
+
+  if ({{=$valid}} === undefined)
+    {{=$valid}} = {{=$result}} {{=$op}}{{?!$exclusive}}={{?}} 0;
+{{?}}
+
+{{= $closingBraces }}
+
+if (!{{=$valid}}) {
+  {{ var $errorKeyword = $keyword; }}
+  {{# def.error:'_formatLimit' }}
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/patternRequired.jst b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/patternRequired.jst
new file mode 100644
index 0000000..6f82f62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/patternRequired.jst
@@ -0,0 +1,33 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+
+{{
+  var $key = 'key' + $lvl
+    , $idx = 'idx' + $lvl
+    , $matched = 'patternMatched' + $lvl
+    , $dataProperties = 'dataProperties' + $lvl
+    , $closingBraces = ''
+    , $ownProperties = it.opts.ownProperties;
+}}
+
+var {{=$valid}} = true;
+{{? $ownProperties }}
+  var {{=$dataProperties}} = undefined;
+{{?}}
+
+{{~ $schema:$pProperty }}
+  var {{=$matched}} = false;
+  {{# def.iterateProperties }}
+    {{=$matched}} = {{= it.usePattern($pProperty) }}.test({{=$key}});
+    if ({{=$matched}}) break;
+  }
+
+  {{ var $missingPattern = it.util.escapeQuotes($pProperty); }}
+  if (!{{=$matched}}) {
+    {{=$valid}} = false;
+    {{# def.addError:'patternRequired' }}
+  } {{# def.elseIfValid }}
+{{~}}
+
+{{= $closingBraces }}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/switch.jst b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/switch.jst
new file mode 100644
index 0000000..24d68cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dot/switch.jst
@@ -0,0 +1,71 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+
+{{## def.validateIf:
+  {{# def.setCompositeRule }}
+  {{ $it.createErrors = false; }}
+  {{# def._validateSwitchRule:if }}
+  {{ $it.createErrors = true; }}
+  {{# def.resetCompositeRule }}
+  {{=$ifPassed}} = {{=$nextValid}};
+#}}
+
+{{## def.validateThen:
+  {{? typeof $sch.then == 'boolean' }}
+    {{? $sch.then === false }}
+      {{# def.error:'switch' }}
+    {{?}}
+    var {{=$nextValid}} = {{= $sch.then }};
+  {{??}}
+    {{# def._validateSwitchRule:then }}
+  {{?}}
+#}}
+
+{{## def._validateSwitchRule:_clause:
+  {{
+    $it.schema = $sch._clause;
+    $it.schemaPath = $schemaPath + '[' + $caseIndex + ']._clause';
+    $it.errSchemaPath = $errSchemaPath + '/' + $caseIndex + '/_clause';
+  }}
+  {{# def.insertSubschemaCode }}
+#}}
+
+{{## def.switchCase:
+  {{? $sch.if && {{# def.nonEmptySchema:$sch.if }} }}
+    var {{=$errs}} = errors;
+    {{# def.validateIf }}
+    if ({{=$ifPassed}}) {
+      {{# def.validateThen }}  
+    } else {
+      {{# def.resetErrors }}
+    }
+  {{??}}
+    {{=$ifPassed}} = true;
+    {{# def.validateThen }}
+  {{?}}
+#}}
+
+
+{{
+  var $ifPassed = 'ifPassed' + it.level
+    , $currentBaseId = $it.baseId
+    , $shouldContinue;
+}}
+var {{=$ifPassed}};
+
+{{~ $schema:$sch:$caseIndex }}
+  {{? $caseIndex && !$shouldContinue }}
+    if (!{{=$ifPassed}}) {
+    {{ $closingBraces+= '}'; }}
+  {{?}}
+
+  {{# def.switchCase }}
+  {{ $shouldContinue = $sch.continue }}
+{{~}}
+
+{{= $closingBraces }}
+
+var {{=$valid}} = {{=$nextValid}};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/README.md b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/README.md
new file mode 100644
index 0000000..e2846c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/README.md
@@ -0,0 +1,3 @@
+These files are compiled dot templates from dot folder.
+
+Do NOT edit them directly, edit the templates and run `npm run build` from main ajv-keywords folder.
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/_formatLimit.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/_formatLimit.js
new file mode 100644
index 0000000..d2af638
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/_formatLimit.js
@@ -0,0 +1,178 @@
+'use strict';
+module.exports = function generate__formatLimit(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  out += 'var ' + ($valid) + ' = undefined;';
+  if (it.opts.format === false) {
+    out += ' ' + ($valid) + ' = true; ';
+    return out;
+  }
+  var $schemaFormat = it.schema.format,
+    $isDataFormat = it.opts.$data && $schemaFormat.$data,
+    $closingBraces = '';
+  if ($isDataFormat) {
+    var $schemaValueFormat = it.util.getData($schemaFormat.$data, $dataLvl, it.dataPathArr),
+      $format = 'format' + $lvl,
+      $compare = 'compare' + $lvl;
+    out += ' var ' + ($format) + ' = formats[' + ($schemaValueFormat) + '] , ' + ($compare) + ' = ' + ($format) + ' && ' + ($format) + '.compare;';
+  } else {
+    var $format = it.formats[$schemaFormat];
+    if (!($format && $format.compare)) {
+      out += '  ' + ($valid) + ' = true; ';
+      return out;
+    }
+    var $compare = 'formats' + it.util.getProperty($schemaFormat) + '.compare';
+  }
+  var $isMax = $keyword == 'formatMaximum',
+    $exclusiveKeyword = 'formatExclusive' + ($isMax ? 'Maximum' : 'Minimum'),
+    $schemaExcl = it.schema[$exclusiveKeyword],
+    $isDataExcl = it.opts.$data && $schemaExcl && $schemaExcl.$data,
+    $op = $isMax ? '<' : '>',
+    $result = 'result' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if ($isDataExcl) {
+    var $schemaValueExcl = it.util.getData($schemaExcl.$data, $dataLvl, it.dataPathArr),
+      $exclusive = 'exclusive' + $lvl,
+      $opExpr = 'op' + $lvl,
+      $opStr = '\' + ' + $opExpr + ' + \'';
+    out += ' var schemaExcl' + ($lvl) + ' = ' + ($schemaValueExcl) + '; ';
+    $schemaValueExcl = 'schemaExcl' + $lvl;
+    out += ' if (typeof ' + ($schemaValueExcl) + ' != \'boolean\' && ' + ($schemaValueExcl) + ' !== undefined) { ' + ($valid) + ' = false; ';
+    var $errorKeyword = $exclusiveKeyword;
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ($errorKeyword || '_formatExclusiveLimit') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'' + ($exclusiveKeyword) + ' should be boolean\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    out += ' }  ';
+    if ($breakOnError) {
+      $closingBraces += '}';
+      out += ' else { ';
+    }
+    if ($isData) {
+      out += ' if (' + ($schemaValue) + ' === undefined) ' + ($valid) + ' = true; else if (typeof ' + ($schemaValue) + ' != \'string\') ' + ($valid) + ' = false; else { ';
+      $closingBraces += '}';
+    }
+    if ($isDataFormat) {
+      out += ' if (!' + ($compare) + ') ' + ($valid) + ' = true; else { ';
+      $closingBraces += '}';
+    }
+    out += ' var ' + ($result) + ' = ' + ($compare) + '(' + ($data) + ',  ';
+    if ($isData) {
+      out += '' + ($schemaValue);
+    } else {
+      out += '' + (it.util.toQuotedString($schema));
+    }
+    out += ' ); if (' + ($result) + ' === undefined) ' + ($valid) + ' = false; var ' + ($exclusive) + ' = ' + ($schemaValueExcl) + ' === true; if (' + ($valid) + ' === undefined) { ' + ($valid) + ' = ' + ($exclusive) + ' ? ' + ($result) + ' ' + ($op) + ' 0 : ' + ($result) + ' ' + ($op) + '= 0; } if (!' + ($valid) + ') var op' + ($lvl) + ' = ' + ($exclusive) + ' ? \'' + ($op) + '\' : \'' + ($op) + '=\';';
+  } else {
+    var $exclusive = $schemaExcl === true,
+      $opStr = $op;
+    if (!$exclusive) $opStr += '=';
+    var $opExpr = '\'' + $opStr + '\'';
+    if ($isData) {
+      out += ' if (' + ($schemaValue) + ' === undefined) ' + ($valid) + ' = true; else if (typeof ' + ($schemaValue) + ' != \'string\') ' + ($valid) + ' = false; else { ';
+      $closingBraces += '}';
+    }
+    if ($isDataFormat) {
+      out += ' if (!' + ($compare) + ') ' + ($valid) + ' = true; else { ';
+      $closingBraces += '}';
+    }
+    out += ' var ' + ($result) + ' = ' + ($compare) + '(' + ($data) + ',  ';
+    if ($isData) {
+      out += '' + ($schemaValue);
+    } else {
+      out += '' + (it.util.toQuotedString($schema));
+    }
+    out += ' ); if (' + ($result) + ' === undefined) ' + ($valid) + ' = false; if (' + ($valid) + ' === undefined) ' + ($valid) + ' = ' + ($result) + ' ' + ($op);
+    if (!$exclusive) {
+      out += '=';
+    }
+    out += ' 0;';
+  }
+  out += '' + ($closingBraces) + 'if (!' + ($valid) + ') { ';
+  var $errorKeyword = $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_formatLimit') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { comparison: ' + ($opExpr) + ', limit:  ';
+    if ($isData) {
+      out += '' + ($schemaValue);
+    } else {
+      out += '' + (it.util.toQuotedString($schema));
+    }
+    out += ' , exclusive: ' + ($exclusive) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be ' + ($opStr) + ' "';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + (it.util.escapeQuotes($schema));
+      }
+      out += '"\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + (it.util.toQuotedString($schema));
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '}';
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/patternRequired.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/patternRequired.js
new file mode 100644
index 0000000..31bd0b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/patternRequired.js
@@ -0,0 +1,58 @@
+'use strict';
+module.exports = function generate_patternRequired(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $key = 'key' + $lvl,
+    $idx = 'idx' + $lvl,
+    $matched = 'patternMatched' + $lvl,
+    $dataProperties = 'dataProperties' + $lvl,
+    $closingBraces = '',
+    $ownProperties = it.opts.ownProperties;
+  out += 'var ' + ($valid) + ' = true;';
+  if ($ownProperties) {
+    out += ' var ' + ($dataProperties) + ' = undefined;';
+  }
+  var arr1 = $schema;
+  if (arr1) {
+    var $pProperty, i1 = -1,
+      l1 = arr1.length - 1;
+    while (i1 < l1) {
+      $pProperty = arr1[i1 += 1];
+      out += ' var ' + ($matched) + ' = false;  ';
+      if ($ownProperties) {
+        out += ' ' + ($dataProperties) + ' = ' + ($dataProperties) + ' || Object.keys(' + ($data) + '); for (var ' + ($idx) + '=0; ' + ($idx) + '<' + ($dataProperties) + '.length; ' + ($idx) + '++) { var ' + ($key) + ' = ' + ($dataProperties) + '[' + ($idx) + ']; ';
+      } else {
+        out += ' for (var ' + ($key) + ' in ' + ($data) + ') { ';
+      }
+      out += ' ' + ($matched) + ' = ' + (it.usePattern($pProperty)) + '.test(' + ($key) + '); if (' + ($matched) + ') break; } ';
+      var $missingPattern = it.util.escapeQuotes($pProperty);
+      out += ' if (!' + ($matched) + ') { ' + ($valid) + ' = false;  var err =   '; /* istanbul ignore else */
+      if (it.createErrors !== false) {
+        out += ' { keyword: \'' + ('patternRequired') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingPattern: \'' + ($missingPattern) + '\' } ';
+        if (it.opts.messages !== false) {
+          out += ' , message: \'should have property matching pattern \\\'' + ($missingPattern) + '\\\'\' ';
+        }
+        if (it.opts.verbose) {
+          out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+        }
+        out += ' } ';
+      } else {
+        out += ' {} ';
+      }
+      out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; }   ';
+      if ($breakOnError) {
+        $closingBraces += '}';
+        out += ' else { ';
+      }
+    }
+  }
+  out += '' + ($closingBraces);
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/switch.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/switch.js
new file mode 100644
index 0000000..0a3fb80
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dotjs/switch.js
@@ -0,0 +1,129 @@
+'use strict';
+module.exports = function generate_switch(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $ifPassed = 'ifPassed' + it.level,
+    $currentBaseId = $it.baseId,
+    $shouldContinue;
+  out += 'var ' + ($ifPassed) + ';';
+  var arr1 = $schema;
+  if (arr1) {
+    var $sch, $caseIndex = -1,
+      l1 = arr1.length - 1;
+    while ($caseIndex < l1) {
+      $sch = arr1[$caseIndex += 1];
+      if ($caseIndex && !$shouldContinue) {
+        out += ' if (!' + ($ifPassed) + ') { ';
+        $closingBraces += '}';
+      }
+      if ($sch.if && (it.opts.strictKeywords ? typeof $sch.if == 'object' && Object.keys($sch.if).length > 0 : it.util.schemaHasRules($sch.if, it.RULES.all))) {
+        out += ' var ' + ($errs) + ' = errors;   ';
+        var $wasComposite = it.compositeRule;
+        it.compositeRule = $it.compositeRule = true;
+        $it.createErrors = false;
+        $it.schema = $sch.if;
+        $it.schemaPath = $schemaPath + '[' + $caseIndex + '].if';
+        $it.errSchemaPath = $errSchemaPath + '/' + $caseIndex + '/if';
+        out += '  ' + (it.validate($it)) + ' ';
+        $it.baseId = $currentBaseId;
+        $it.createErrors = true;
+        it.compositeRule = $it.compositeRule = $wasComposite;
+        out += ' ' + ($ifPassed) + ' = ' + ($nextValid) + '; if (' + ($ifPassed) + ') {  ';
+        if (typeof $sch.then == 'boolean') {
+          if ($sch.then === false) {
+            var $$outStack = $$outStack || [];
+            $$outStack.push(out);
+            out = ''; /* istanbul ignore else */
+            if (it.createErrors !== false) {
+              out += ' { keyword: \'' + ('switch') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { caseIndex: ' + ($caseIndex) + ' } ';
+              if (it.opts.messages !== false) {
+                out += ' , message: \'should pass "switch" keyword validation\' ';
+              }
+              if (it.opts.verbose) {
+                out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+              }
+              out += ' } ';
+            } else {
+              out += ' {} ';
+            }
+            var __err = out;
+            out = $$outStack.pop();
+            if (!it.compositeRule && $breakOnError) {
+              /* istanbul ignore if */
+              if (it.async) {
+                out += ' throw new ValidationError([' + (__err) + ']); ';
+              } else {
+                out += ' validate.errors = [' + (__err) + ']; return false; ';
+              }
+            } else {
+              out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+            }
+          }
+          out += ' var ' + ($nextValid) + ' = ' + ($sch.then) + '; ';
+        } else {
+          $it.schema = $sch.then;
+          $it.schemaPath = $schemaPath + '[' + $caseIndex + '].then';
+          $it.errSchemaPath = $errSchemaPath + '/' + $caseIndex + '/then';
+          out += '  ' + (it.validate($it)) + ' ';
+          $it.baseId = $currentBaseId;
+        }
+        out += '  } else {  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; } } ';
+      } else {
+        out += ' ' + ($ifPassed) + ' = true;  ';
+        if (typeof $sch.then == 'boolean') {
+          if ($sch.then === false) {
+            var $$outStack = $$outStack || [];
+            $$outStack.push(out);
+            out = ''; /* istanbul ignore else */
+            if (it.createErrors !== false) {
+              out += ' { keyword: \'' + ('switch') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { caseIndex: ' + ($caseIndex) + ' } ';
+              if (it.opts.messages !== false) {
+                out += ' , message: \'should pass "switch" keyword validation\' ';
+              }
+              if (it.opts.verbose) {
+                out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+              }
+              out += ' } ';
+            } else {
+              out += ' {} ';
+            }
+            var __err = out;
+            out = $$outStack.pop();
+            if (!it.compositeRule && $breakOnError) {
+              /* istanbul ignore if */
+              if (it.async) {
+                out += ' throw new ValidationError([' + (__err) + ']); ';
+              } else {
+                out += ' validate.errors = [' + (__err) + ']; return false; ';
+              }
+            } else {
+              out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+            }
+          }
+          out += ' var ' + ($nextValid) + ' = ' + ($sch.then) + '; ';
+        } else {
+          $it.schema = $sch.then;
+          $it.schemaPath = $schemaPath + '[' + $caseIndex + '].then';
+          $it.errSchemaPath = $errSchemaPath + '/' + $caseIndex + '/then';
+          out += '  ' + (it.validate($it)) + ' ';
+          $it.baseId = $currentBaseId;
+        }
+      }
+      $shouldContinue = $sch.continue
+    }
+  }
+  out += '' + ($closingBraces) + 'var ' + ($valid) + ' = ' + ($nextValid) + ';';
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dynamicDefaults.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dynamicDefaults.js
new file mode 100644
index 0000000..5323bb8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/dynamicDefaults.js
@@ -0,0 +1,72 @@
+'use strict';
+
+var sequences = {};
+
+var DEFAULTS = {
+  timestamp: function() { return Date.now(); },
+  datetime: function() { return (new Date).toISOString(); },
+  date: function() { return (new Date).toISOString().slice(0, 10); },
+  time: function() { return (new Date).toISOString().slice(11); },
+  random: function() { return Math.random(); },
+  randomint: function (args) {
+    var limit = args && args.max || 2;
+    return function() { return Math.floor(Math.random() * limit); };
+  },
+  seq: function (args) {
+    var name = args && args.name || '';
+    sequences[name] = sequences[name] || 0;
+    return function() { return sequences[name]++; };
+  }
+};
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    compile: function (schema, parentSchema, it) {
+      var funcs = {};
+
+      for (var key in schema) {
+        var d = schema[key];
+        var func = getDefault(typeof d == 'string' ? d : d.func);
+        funcs[key] = func.length ? func(d.args) : func;
+      }
+
+      return it.opts.useDefaults && !it.compositeRule
+              ? assignDefaults
+              : noop;
+
+      function assignDefaults(data) {
+        for (var prop in schema){
+          if (data[prop] === undefined
+            || (it.opts.useDefaults == 'empty'
+            && (data[prop] === null || data[prop] === '')))
+            data[prop] = funcs[prop]();
+        }
+        return true;
+      }
+
+      function noop() { return true; }
+    },
+    DEFAULTS: DEFAULTS,
+    metaSchema: {
+      type: 'object',
+      additionalProperties: {
+        type: ['string', 'object'],
+        additionalProperties: false,
+        required: ['func', 'args'],
+        properties: {
+          func: { type: 'string' },
+          args: { type: 'object' }
+        }
+      }
+    }
+  };
+
+  ajv.addKeyword('dynamicDefaults', defFunc.definition);
+  return ajv;
+
+  function getDefault(d) {
+    var def = DEFAULTS[d];
+    if (def) return def;
+    throw new Error('invalid "dynamicDefaults" keyword property value: ' + d);
+  }
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/formatMaximum.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/formatMaximum.js
new file mode 100644
index 0000000..e7daabf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/formatMaximum.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./_formatLimit')('Maximum');
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/formatMinimum.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/formatMinimum.js
new file mode 100644
index 0000000..eddd6e4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/formatMinimum.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./_formatLimit')('Minimum');
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/index.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/index.js
new file mode 100644
index 0000000..99534ec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/index.js
@@ -0,0 +1,22 @@
+'use strict';
+
+module.exports = {
+  'instanceof': require('./instanceof'),
+  range: require('./range'),
+  regexp: require('./regexp'),
+  'typeof': require('./typeof'),
+  dynamicDefaults: require('./dynamicDefaults'),
+  allRequired: require('./allRequired'),
+  anyRequired: require('./anyRequired'),
+  oneRequired: require('./oneRequired'),
+  prohibited: require('./prohibited'),
+  uniqueItemProperties: require('./uniqueItemProperties'),
+  deepProperties: require('./deepProperties'),
+  deepRequired: require('./deepRequired'),
+  formatMinimum: require('./formatMinimum'),
+  formatMaximum: require('./formatMaximum'),
+  patternRequired: require('./patternRequired'),
+  'switch': require('./switch'),
+  select: require('./select'),
+  transform: require('./transform')
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/instanceof.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/instanceof.js
new file mode 100644
index 0000000..ea88f5c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/instanceof.js
@@ -0,0 +1,58 @@
+'use strict';
+
+var CONSTRUCTORS = {
+  Object: Object,
+  Array: Array,
+  Function: Function,
+  Number: Number,
+  String: String,
+  Date: Date,
+  RegExp: RegExp
+};
+
+module.exports = function defFunc(ajv) {
+  /* istanbul ignore else */
+  if (typeof Buffer != 'undefined')
+    CONSTRUCTORS.Buffer = Buffer;
+
+  /* istanbul ignore else */
+  if (typeof Promise != 'undefined')
+    CONSTRUCTORS.Promise = Promise;
+
+  defFunc.definition = {
+    compile: function (schema) {
+      if (typeof schema == 'string') {
+        var Constructor = getConstructor(schema);
+        return function (data) {
+          return data instanceof Constructor;
+        };
+      }
+
+      var constructors = schema.map(getConstructor);
+      return function (data) {
+        for (var i=0; i<constructors.length; i++)
+          if (data instanceof constructors[i]) return true;
+        return false;
+      };
+    },
+    CONSTRUCTORS: CONSTRUCTORS,
+    metaSchema: {
+      anyOf: [
+        { type: 'string' },
+        {
+          type: 'array',
+          items: { type: 'string' }
+        }
+      ]
+    }
+  };
+
+  ajv.addKeyword('instanceof', defFunc.definition);
+  return ajv;
+
+  function getConstructor(c) {
+    var Constructor = CONSTRUCTORS[c];
+    if (Constructor) return Constructor;
+    throw new Error('invalid "instanceof" keyword value ' + c);
+  }
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/oneRequired.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/oneRequired.js
new file mode 100644
index 0000000..5468463
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/oneRequired.js
@@ -0,0 +1,24 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'object',
+    macro: function (schema) {
+      if (schema.length == 0) return true;
+      if (schema.length == 1) return {required: schema};
+      var schemas = schema.map(function (prop) {
+        return {required: [prop]};
+      });
+      return {oneOf: schemas};
+    },
+    metaSchema: {
+      type: 'array',
+      items: {
+        type: 'string'
+      }
+    }
+  };
+
+  ajv.addKeyword('oneRequired', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/patternRequired.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/patternRequired.js
new file mode 100644
index 0000000..046f313
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/patternRequired.js
@@ -0,0 +1,21 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'object',
+    inline: require('./dotjs/patternRequired'),
+    statements: true,
+    errors: 'full',
+    metaSchema: {
+      type: 'array',
+      items: {
+        type: 'string',
+        format: 'regex'
+      },
+      uniqueItems: true
+    }
+  };
+
+  ajv.addKeyword('patternRequired', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/prohibited.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/prohibited.js
new file mode 100644
index 0000000..775e138
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/prohibited.js
@@ -0,0 +1,24 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'object',
+    macro: function (schema) {
+      if (schema.length == 0) return true;
+      if (schema.length == 1) return {not: {required: schema}};
+      var schemas = schema.map(function (prop) {
+        return {required: [prop]};
+      });
+      return {not: {anyOf: schemas}};
+    },
+    metaSchema: {
+      type: 'array',
+      items: {
+        type: 'string'
+      }
+    }
+  };
+
+  ajv.addKeyword('prohibited', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/range.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/range.js
new file mode 100644
index 0000000..9c1fd3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/range.js
@@ -0,0 +1,36 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'number',
+    macro: function (schema, parentSchema) {
+      var min = schema[0]
+        , max = schema[1]
+        , exclusive = parentSchema.exclusiveRange;
+
+      validateRangeSchema(min, max, exclusive);
+
+      return exclusive === true
+              ? {exclusiveMinimum: min, exclusiveMaximum: max}
+              : {minimum: min, maximum: max};
+    },
+    metaSchema: {
+      type: 'array',
+      minItems: 2,
+      maxItems: 2,
+      items: { type: 'number' }
+    }
+  };
+
+  ajv.addKeyword('range', defFunc.definition);
+  ajv.addKeyword('exclusiveRange');
+  return ajv;
+
+  function validateRangeSchema(min, max, exclusive) {
+    if (exclusive !== undefined && typeof exclusive != 'boolean')
+      throw new Error('Invalid schema for exclusiveRange keyword, should be boolean');
+
+    if (min > max || (exclusive && min == max))
+      throw new Error('There are no numbers in range');
+  }
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/regexp.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/regexp.js
new file mode 100644
index 0000000..973628c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/regexp.js
@@ -0,0 +1,36 @@
+'use strict';
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'string',
+    inline: function (it, keyword, schema) {
+      return getRegExp() + '.test(data' + (it.dataLevel || '') + ')';
+
+      function getRegExp() {
+        try {
+          if (typeof schema == 'object')
+            return new RegExp(schema.pattern, schema.flags);
+
+          var rx = schema.match(/^\/(.*)\/([gimuy]*)$/);
+          if (rx) return new RegExp(rx[1], rx[2]);
+          throw new Error('cannot parse string into RegExp');
+        } catch(e) {
+          console.error('regular expression', schema, 'is invalid');
+          throw e;
+        }
+      }
+    },
+    metaSchema: {
+      type: ['string', 'object'],
+      properties: {
+        pattern: { type: 'string' },
+        flags: { type: 'string' }
+      },
+      required: ['pattern'],
+      additionalProperties: false
+    }
+  };
+
+  ajv.addKeyword('regexp', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/select.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/select.js
new file mode 100644
index 0000000..f79c6c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/select.js
@@ -0,0 +1,79 @@
+'use strict';
+
+var util = require('./_util');
+
+module.exports = function defFunc(ajv) {
+  if (!ajv._opts.$data) {
+    console.warn('keyword select requires $data option');
+    return ajv;
+  }
+  var metaSchemaRef = util.metaSchemaRef(ajv);
+  var compiledCaseSchemas = [];
+
+  defFunc.definition = {
+    validate: function v(schema, data, parentSchema) {
+      if (parentSchema.selectCases === undefined)
+        throw new Error('keyword "selectCases" is absent');
+      var compiled = getCompiledSchemas(parentSchema, false);
+      var validate = compiled.cases[schema];
+      if (validate === undefined) validate = compiled.default;
+      if (typeof validate == 'boolean') return validate;
+      var valid = validate(data);
+      if (!valid) v.errors = validate.errors;
+      return valid;
+    },
+    $data: true,
+    metaSchema: { type: ['string', 'number', 'boolean', 'null'] }
+  };
+
+  ajv.addKeyword('select', defFunc.definition);
+  ajv.addKeyword('selectCases', {
+    compile: function (schemas, parentSchema) {
+      var compiled = getCompiledSchemas(parentSchema);
+      for (var value in schemas)
+        compiled.cases[value] = compileOrBoolean(schemas[value]);
+      return function() { return true; };
+    },
+    valid: true,
+    metaSchema: {
+      type: 'object',
+      additionalProperties: metaSchemaRef
+    }
+  });
+  ajv.addKeyword('selectDefault', {
+    compile: function (schema, parentSchema) {
+      var compiled = getCompiledSchemas(parentSchema);
+      compiled.default = compileOrBoolean(schema);
+      return function() { return true; };
+    },
+    valid: true,
+    metaSchema: metaSchemaRef
+  });
+  return ajv;
+
+
+  function getCompiledSchemas(parentSchema, create) {
+    var compiled;
+    compiledCaseSchemas.some(function (c) {
+      if (c.parentSchema === parentSchema) {
+        compiled = c;
+        return true;
+      }
+    });
+    if (!compiled && create !== false) {
+      compiled = {
+        parentSchema: parentSchema,
+        cases: {},
+        default: true
+      };
+      compiledCaseSchemas.push(compiled);
+    }
+    return compiled;
+  }
+
+  function compileOrBoolean(schema) {
+    return typeof schema == 'boolean'
+            ? schema
+            : ajv.compile(schema);
+  }
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/switch.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/switch.js
new file mode 100644
index 0000000..5b0f3f8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/switch.js
@@ -0,0 +1,38 @@
+'use strict';
+
+var util = require('./_util');
+
+module.exports = function defFunc(ajv) {
+  if (ajv.RULES.keywords.switch && ajv.RULES.keywords.if) return;
+
+  var metaSchemaRef = util.metaSchemaRef(ajv);
+
+  defFunc.definition = {
+    inline: require('./dotjs/switch'),
+    statements: true,
+    errors: 'full',
+    metaSchema: {
+      type: 'array',
+      items: {
+        required: [ 'then' ],
+        properties: {
+          'if': metaSchemaRef,
+          'then': {
+            anyOf: [
+              { type: 'boolean' },
+              metaSchemaRef
+            ]
+          },
+          'continue': { type: 'boolean' }
+        },
+        additionalProperties: false,
+        dependencies: {
+          'continue': [ 'if' ]
+        }
+      }
+    }
+  };
+
+  ajv.addKeyword('switch', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/transform.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/transform.js
new file mode 100644
index 0000000..d715452
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/transform.js
@@ -0,0 +1,80 @@
+'use strict';
+
+module.exports = function defFunc (ajv) {
+  var transform = {
+    trimLeft: function (value) {
+      return value.replace(/^[\s]+/, '');
+    },
+    trimRight: function (value) {
+      return value.replace(/[\s]+$/, '');
+    },
+    trim: function (value) {
+      return value.trim();
+    },
+    toLowerCase: function (value) {
+      return value.toLowerCase();
+    },
+    toUpperCase: function (value) {
+      return value.toUpperCase();
+    },
+    toEnumCase: function (value, cfg) {
+      return cfg.hash[makeHashTableKey(value)] || value;
+    }
+  };
+
+  defFunc.definition = {
+    type: 'string',
+    errors: false,
+    modifying: true,
+    valid: true,
+    compile: function (schema, parentSchema) {
+      var cfg;
+
+      if (schema.indexOf('toEnumCase') !== -1) {
+        // build hash table to enum values
+        cfg = {hash: {}};
+
+        // requires `enum` in schema
+        if (!parentSchema.enum)
+          throw new Error('Missing enum. To use `transform:["toEnumCase"]`, `enum:[...]` is required.');
+        for (var i = parentSchema.enum.length; i--; i) {
+          var v = parentSchema.enum[i];
+          if (typeof v !== 'string') continue;
+          var k = makeHashTableKey(v);
+          // requires all `enum` values have unique keys
+          if (cfg.hash[k])
+            throw new Error('Invalid enum uniqueness. To use `transform:["toEnumCase"]`, all values must be unique when case insensitive.');
+          cfg.hash[k] = v;
+        }
+      }
+
+      return function (data, dataPath, object, key) {
+        // skip if value only
+        if (!object) return;
+
+        // apply transform in order provided
+        for (var j = 0, l = schema.length; j < l; j++)
+          data = transform[schema[j]](data, cfg);
+
+        object[key] = data;
+      };
+    },
+    metaSchema: {
+      type: 'array',
+      items: {
+        type: 'string',
+        enum: [
+          'trimLeft', 'trimRight', 'trim',
+          'toLowerCase', 'toUpperCase', 'toEnumCase'
+        ]
+      }
+    }
+  };
+
+  ajv.addKeyword('transform', defFunc.definition);
+  return ajv;
+
+  function makeHashTableKey (value) {
+    return value.toLowerCase();
+  }
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/typeof.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/typeof.js
new file mode 100644
index 0000000..3a3574d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/typeof.js
@@ -0,0 +1,32 @@
+'use strict';
+
+var KNOWN_TYPES = ['undefined', 'string', 'number', 'object', 'function', 'boolean', 'symbol'];
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    inline: function (it, keyword, schema) {
+      var data = 'data' + (it.dataLevel || '');
+      if (typeof schema == 'string') return 'typeof ' + data + ' == "' + schema + '"';
+      schema = 'validate.schema' + it.schemaPath + '.' + keyword;
+      return schema + '.indexOf(typeof ' + data + ') >= 0';
+    },
+    metaSchema: {
+      anyOf: [
+        {
+          type: 'string',
+          enum: KNOWN_TYPES
+        },
+        {
+          type: 'array',
+          items: {
+            type: 'string',
+            enum: KNOWN_TYPES
+          }
+        }
+      ]
+    }
+  };
+
+  ajv.addKeyword('typeof', defFunc.definition);
+  return ajv;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/uniqueItemProperties.js b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/uniqueItemProperties.js
new file mode 100644
index 0000000..cd670da
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/keywords/uniqueItemProperties.js
@@ -0,0 +1,59 @@
+'use strict';
+
+var SCALAR_TYPES = ['number', 'integer', 'string', 'boolean', 'null'];
+
+module.exports = function defFunc(ajv) {
+  defFunc.definition = {
+    type: 'array',
+    compile: function(keys, parentSchema, it) {
+      var equal = it.util.equal;
+      var scalar = getScalarKeys(keys, parentSchema);
+
+      return function(data) {
+        if (data.length > 1) {
+          for (var k=0; k < keys.length; k++) {
+            var i, key = keys[k];
+            if (scalar[k]) {
+              var hash = {};
+              for (i = data.length; i--;) {
+                if (!data[i] || typeof data[i] != 'object') continue;
+                var prop = data[i][key];
+                if (prop && typeof prop == 'object') continue;
+                if (typeof prop == 'string') prop = '"' + prop;
+                if (hash[prop]) return false;
+                hash[prop] = true;
+              }
+            } else {
+              for (i = data.length; i--;) {
+                if (!data[i] || typeof data[i] != 'object') continue;
+                for (var j = i; j--;) {
+                  if (data[j] && typeof data[j] == 'object' && equal(data[i][key], data[j][key]))
+                    return false;
+                }
+              }
+            }
+          }
+        }
+        return true;
+      };
+    },
+    metaSchema: {
+      type: 'array',
+      items: {type: 'string'}
+    }
+  };
+
+  ajv.addKeyword('uniqueItemProperties', defFunc.definition);
+  return ajv;
+};
+
+
+function getScalarKeys(keys, schema) {
+  return keys.map(function(key) {
+    var properties = schema.items && schema.items.properties;
+    var propType = properties && properties[key] && properties[key].type;
+    return Array.isArray(propType)
+            ? propType.indexOf('object') < 0 && propType.indexOf('array') < 0
+            : SCALAR_TYPES.indexOf(propType) >= 0;
+  });
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv-keywords/package.json b/node_modules/mathjs/examples/node_modules/ajv-keywords/package.json
new file mode 100644
index 0000000..fbd29d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv-keywords/package.json
@@ -0,0 +1,53 @@
+{
+  "name": "ajv-keywords",
+  "version": "3.5.2",
+  "description": "Custom JSON-Schema keywords for Ajv validator",
+  "main": "index.js",
+  "typings": "ajv-keywords.d.ts",
+  "scripts": {
+    "build": "node node_modules/ajv/scripts/compile-dots.js node_modules/ajv/lib keywords",
+    "prepublish": "npm run build",
+    "test": "npm run build && npm run eslint && npm run test-cov",
+    "eslint": "eslint index.js keywords/*.js spec",
+    "test-spec": "mocha spec/*.spec.js -R spec",
+    "test-cov": "istanbul cover -x 'spec/**' node_modules/mocha/bin/_mocha -- spec/*.spec.js -R spec"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/epoberezkin/ajv-keywords.git"
+  },
+  "keywords": [
+    "JSON-Schema",
+    "ajv",
+    "keywords"
+  ],
+  "files": [
+    "index.js",
+    "ajv-keywords.d.ts",
+    "keywords"
+  ],
+  "author": "Evgeny Poberezkin",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/epoberezkin/ajv-keywords/issues"
+  },
+  "homepage": "https://github.com/epoberezkin/ajv-keywords#readme",
+  "peerDependencies": {
+    "ajv": "^6.9.1"
+  },
+  "devDependencies": {
+    "ajv": "^6.9.1",
+    "ajv-pack": "^0.3.0",
+    "chai": "^4.2.0",
+    "coveralls": "^3.0.2",
+    "dot": "^1.1.1",
+    "eslint": "^7.2.0",
+    "glob": "^7.1.3",
+    "istanbul": "^0.4.3",
+    "js-beautify": "^1.8.9",
+    "json-schema-test": "^2.0.0",
+    "mocha": "^8.0.1",
+    "pre-commit": "^1.1.3",
+    "uuid": "^8.1.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/.tonic_example.js b/node_modules/mathjs/examples/node_modules/ajv/.tonic_example.js
new file mode 100644
index 0000000..aa11812
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/.tonic_example.js
@@ -0,0 +1,20 @@
+var Ajv = require('ajv');
+var ajv = new Ajv({allErrors: true});
+
+var schema = {
+  "properties": {
+    "foo": { "type": "string" },
+    "bar": { "type": "number", "maximum": 3 }
+  }
+};
+
+var validate = ajv.compile(schema);
+
+test({"foo": "abc", "bar": 2});
+test({"foo": 2, "bar": 4});
+
+function test(data) {
+  var valid = validate(data);
+  if (valid) console.log('Valid!');
+  else console.log('Invalid: ' + ajv.errorsText(validate.errors));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/ajv/LICENSE b/node_modules/mathjs/examples/node_modules/ajv/LICENSE
new file mode 100644
index 0000000..96ee719
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/LICENSE
@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2015-2017 Evgeny Poberezkin
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/mathjs/examples/node_modules/ajv/README.md b/node_modules/mathjs/examples/node_modules/ajv/README.md
new file mode 100644
index 0000000..5aa2078
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/README.md
@@ -0,0 +1,1497 @@
+<img align="right" alt="Ajv logo" width="160" src="https://ajv.js.org/images/ajv_logo.png">
+
+# Ajv: Another JSON Schema Validator
+
+The fastest JSON Schema validator for Node.js and browser. Supports draft-04/06/07.
+
+[![Build Status](https://travis-ci.org/ajv-validator/ajv.svg?branch=master)](https://travis-ci.org/ajv-validator/ajv)
+[![npm](https://img.shields.io/npm/v/ajv.svg)](https://www.npmjs.com/package/ajv)
+[![npm (beta)](https://img.shields.io/npm/v/ajv/beta)](https://www.npmjs.com/package/ajv/v/7.0.0-beta.0)
+[![npm downloads](https://img.shields.io/npm/dm/ajv.svg)](https://www.npmjs.com/package/ajv)
+[![Coverage Status](https://coveralls.io/repos/github/ajv-validator/ajv/badge.svg?branch=master)](https://coveralls.io/github/ajv-validator/ajv?branch=master)
+[![Gitter](https://img.shields.io/gitter/room/ajv-validator/ajv.svg)](https://gitter.im/ajv-validator/ajv)
+[![GitHub Sponsors](https://img.shields.io/badge/$-sponsors-brightgreen)](https://github.com/sponsors/epoberezkin)
+
+
+## Ajv v7 beta is released
+
+[Ajv version 7.0.0-beta.0](https://github.com/ajv-validator/ajv/tree/v7-beta) is released with these changes:
+
+- to reduce the mistakes in JSON schemas and unexpected validation results, [strict mode](./docs/strict-mode.md) is added - it prohibits ignored or ambiguous JSON Schema elements.
+- to make code injection from untrusted schemas impossible, [code generation](./docs/codegen.md) is fully re-written to be safe.
+- to simplify Ajv extensions, the new keyword API that is used by pre-defined keywords is available to user-defined keywords - it is much easier to define any keywords now, especially with subschemas.
+- schemas are compiled to ES6 code (ES5 code generation is supported with an option).
+- to improve reliability and maintainability the code is migrated to TypeScript.
+
+**Please note**:
+
+- the support for JSON-Schema draft-04 is removed - if you have schemas using "id" attributes you have to replace them with "\$id" (or continue using version 6 that will be supported until 02/28/2021).
+- all formats are separated to ajv-formats package - they have to be explicitely added if you use them.
+
+See [release notes](https://github.com/ajv-validator/ajv/releases/tag/v7.0.0-beta.0) for the details.
+
+To install the new version:
+
+```bash
+npm install ajv@beta
+```
+
+See [Getting started with v7](https://github.com/ajv-validator/ajv/tree/v7-beta#usage) for code example.
+
+
+## Mozilla MOSS grant and OpenJS Foundation
+
+[<img src="https://www.poberezkin.com/images/mozilla.png" width="240" height="68">](https://www.mozilla.org/en-US/moss/) &nbsp;&nbsp;&nbsp; [<img src="https://www.poberezkin.com/images/openjs.png" width="220" height="68">](https://openjsf.org/blog/2020/08/14/ajv-joins-openjs-foundation-as-an-incubation-project/)
+
+Ajv has been awarded a grant from Mozilla’s [Open Source Support (MOSS) program](https://www.mozilla.org/en-US/moss/) in the “Foundational Technology” track! It will sponsor the development of Ajv support of [JSON Schema version 2019-09](https://tools.ietf.org/html/draft-handrews-json-schema-02) and of [JSON Type Definition](https://tools.ietf.org/html/draft-ucarion-json-type-definition-04).
+
+Ajv also joined [OpenJS Foundation](https://openjsf.org/) – having this support will help ensure the longevity and stability of Ajv for all its users.
+
+This [blog post](https://www.poberezkin.com/posts/2020-08-14-ajv-json-validator-mozilla-open-source-grant-openjs-foundation.html) has more details.
+
+I am looking for the long term maintainers of Ajv – working with [ReadySet](https://www.thereadyset.co/), also sponsored by Mozilla, to establish clear guidelines for the role of a "maintainer" and the contribution standards, and to encourage a wider, more inclusive, contribution from the community.
+
+
+## Please [sponsor Ajv development](https://github.com/sponsors/epoberezkin)
+
+Since I asked to support Ajv development 40 people and 6 organizations contributed via GitHub and OpenCollective - this support helped receiving the MOSS grant!
+
+Your continuing support is very important - the funds will be used to develop and maintain Ajv once the next major version is released.
+
+Please sponsor Ajv via:
+- [GitHub sponsors page](https://github.com/sponsors/epoberezkin) (GitHub will match it)
+- [Ajv Open Collective️](https://opencollective.com/ajv)
+
+Thank you.
+
+
+#### Open Collective sponsors
+
+<a href="https://opencollective.com/ajv"><img src="https://opencollective.com/ajv/individuals.svg?width=890"></a>
+
+<a href="https://opencollective.com/ajv/organization/0/website"><img src="https://opencollective.com/ajv/organization/0/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/1/website"><img src="https://opencollective.com/ajv/organization/1/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/2/website"><img src="https://opencollective.com/ajv/organization/2/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/3/website"><img src="https://opencollective.com/ajv/organization/3/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/4/website"><img src="https://opencollective.com/ajv/organization/4/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/5/website"><img src="https://opencollective.com/ajv/organization/5/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/6/website"><img src="https://opencollective.com/ajv/organization/6/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/7/website"><img src="https://opencollective.com/ajv/organization/7/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/8/website"><img src="https://opencollective.com/ajv/organization/8/avatar.svg"></a>
+<a href="https://opencollective.com/ajv/organization/9/website"><img src="https://opencollective.com/ajv/organization/9/avatar.svg"></a>
+
+
+## Using version 6
+
+[JSON Schema draft-07](http://json-schema.org/latest/json-schema-validation.html) is published.
+
+[Ajv version 6.0.0](https://github.com/ajv-validator/ajv/releases/tag/v6.0.0) that supports draft-07 is released. It may require either migrating your schemas or updating your code (to continue using draft-04 and v5 schemas, draft-06 schemas will be supported without changes).
+
+__Please note__: To use Ajv with draft-06 schemas you need to explicitly add the meta-schema to the validator instance:
+
+```javascript
+ajv.addMetaSchema(require('ajv/lib/refs/json-schema-draft-06.json'));
+```
+
+To use Ajv with draft-04 schemas in addition to explicitly adding meta-schema you also need to use option schemaId:
+
+```javascript
+var ajv = new Ajv({schemaId: 'id'});
+// If you want to use both draft-04 and draft-06/07 schemas:
+// var ajv = new Ajv({schemaId: 'auto'});
+ajv.addMetaSchema(require('ajv/lib/refs/json-schema-draft-04.json'));
+```
+
+
+## Contents
+
+- [Performance](#performance)
+- [Features](#features)
+- [Getting started](#getting-started)
+- [Frequently Asked Questions](https://github.com/ajv-validator/ajv/blob/master/FAQ.md)
+- [Using in browser](#using-in-browser)
+  - [Ajv and Content Security Policies (CSP)](#ajv-and-content-security-policies-csp)
+- [Command line interface](#command-line-interface)
+- Validation
+  - [Keywords](#validation-keywords)
+  - [Annotation keywords](#annotation-keywords)
+  - [Formats](#formats)
+  - [Combining schemas with $ref](#ref)
+  - [$data reference](#data-reference)
+  - NEW: [$merge and $patch keywords](#merge-and-patch-keywords)
+  - [Defining custom keywords](#defining-custom-keywords)
+  - [Asynchronous schema compilation](#asynchronous-schema-compilation)
+  - [Asynchronous validation](#asynchronous-validation)
+- [Security considerations](#security-considerations)
+  - [Security contact](#security-contact)
+  - [Untrusted schemas](#untrusted-schemas)
+  - [Circular references in objects](#circular-references-in-javascript-objects)
+  - [Trusted schemas](#security-risks-of-trusted-schemas)
+  - [ReDoS attack](#redos-attack)
+- Modifying data during validation
+  - [Filtering data](#filtering-data)
+  - [Assigning defaults](#assigning-defaults)
+  - [Coercing data types](#coercing-data-types)
+- API
+  - [Methods](#api)
+  - [Options](#options)
+  - [Validation errors](#validation-errors)
+- [Plugins](#plugins)
+- [Related packages](#related-packages)
+- [Some packages using Ajv](#some-packages-using-ajv)
+- [Tests, Contributing, Changes history](#tests)
+- [Support, Code of conduct, License](#open-source-software-support)
+
+
+## Performance
+
+Ajv generates code using [doT templates](https://github.com/olado/doT) to turn JSON Schemas into super-fast validation functions that are efficient for v8 optimization.
+
+Currently Ajv is the fastest and the most standard compliant validator according to these benchmarks:
+
+- [json-schema-benchmark](https://github.com/ebdrup/json-schema-benchmark) - 50% faster than the second place
+- [jsck benchmark](https://github.com/pandastrike/jsck#benchmarks) - 20-190% faster
+- [z-schema benchmark](https://rawgit.com/zaggino/z-schema/master/benchmark/results.html)
+- [themis benchmark](https://cdn.rawgit.com/playlyfe/themis/master/benchmark/results.html)
+
+
+Performance of different validators by [json-schema-benchmark](https://github.com/ebdrup/json-schema-benchmark):
+
+[![performance](https://chart.googleapis.com/chart?chxt=x,y&cht=bhs&chco=76A4FB&chls=2.0&chbh=32,4,1&chs=600x416&chxl=-1:|djv|ajv|json-schema-validator-generator|jsen|is-my-json-valid|themis|z-schema|jsck|skeemas|json-schema-library|tv4&chd=t:100,98,72.1,66.8,50.1,15.1,6.1,3.8,1.2,0.7,0.2)](https://github.com/ebdrup/json-schema-benchmark/blob/master/README.md#performance)
+
+
+## Features
+
+- Ajv implements full JSON Schema [draft-06/07](http://json-schema.org/) and draft-04 standards:
+  - all validation keywords (see [JSON Schema validation keywords](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md))
+  - full support of remote refs (remote schemas have to be added with `addSchema` or compiled to be available)
+  - support of circular references between schemas
+  - correct string lengths for strings with unicode pairs (can be turned off)
+  - [formats](#formats) defined by JSON Schema draft-07 standard and custom formats (can be turned off)
+  - [validates schemas against meta-schema](#api-validateschema)
+- supports [browsers](#using-in-browser) and Node.js 0.10-14.x
+- [asynchronous loading](#asynchronous-schema-compilation) of referenced schemas during compilation
+- "All errors" validation mode with [option allErrors](#options)
+- [error messages with parameters](#validation-errors) describing error reasons to allow creating custom error messages
+- i18n error messages support with [ajv-i18n](https://github.com/ajv-validator/ajv-i18n) package
+- [filtering data](#filtering-data) from additional properties
+- [assigning defaults](#assigning-defaults) to missing properties and items
+- [coercing data](#coercing-data-types) to the types specified in `type` keywords
+- [custom keywords](#defining-custom-keywords)
+- draft-06/07 keywords `const`, `contains`, `propertyNames` and `if/then/else`
+- draft-06 boolean schemas (`true`/`false` as a schema to always pass/fail).
+- keywords `switch`, `patternRequired`, `formatMaximum` / `formatMinimum` and `formatExclusiveMaximum` / `formatExclusiveMinimum` from [JSON Schema extension proposals](https://github.com/json-schema/json-schema/wiki/v5-Proposals) with [ajv-keywords](https://github.com/ajv-validator/ajv-keywords) package
+- [$data reference](#data-reference) to use values from the validated data as values for the schema keywords
+- [asynchronous validation](#asynchronous-validation) of custom formats and keywords
+
+
+## Install
+
+```
+npm install ajv
+```
+
+
+## <a name="usage"></a>Getting started
+
+Try it in the Node.js REPL: https://tonicdev.com/npm/ajv
+
+
+The fastest validation call:
+
+```javascript
+// Node.js require:
+var Ajv = require('ajv');
+// or ESM/TypeScript import
+import Ajv from 'ajv';
+
+var ajv = new Ajv(); // options can be passed, e.g. {allErrors: true}
+var validate = ajv.compile(schema);
+var valid = validate(data);
+if (!valid) console.log(validate.errors);
+```
+
+or with less code
+
+```javascript
+// ...
+var valid = ajv.validate(schema, data);
+if (!valid) console.log(ajv.errors);
+// ...
+```
+
+or
+
+```javascript
+// ...
+var valid = ajv.addSchema(schema, 'mySchema')
+               .validate('mySchema', data);
+if (!valid) console.log(ajv.errorsText());
+// ...
+```
+
+See [API](#api) and [Options](#options) for more details.
+
+Ajv compiles schemas to functions and caches them in all cases (using schema serialized with [fast-json-stable-stringify](https://github.com/epoberezkin/fast-json-stable-stringify) or a custom function as a key), so that the next time the same schema is used (not necessarily the same object instance) it won't be compiled again.
+
+The best performance is achieved when using compiled functions returned by `compile` or `getSchema` methods (there is no additional function call).
+
+__Please note__: every time a validation function or `ajv.validate` are called `errors` property is overwritten. You need to copy `errors` array reference to another variable if you want to use it later (e.g., in the callback). See [Validation errors](#validation-errors)
+
+__Note for TypeScript users__: `ajv` provides its own TypeScript declarations
+out of the box, so you don't need to install the deprecated `@types/ajv`
+module.
+
+
+## Using in browser
+
+You can require Ajv directly from the code you browserify - in this case Ajv will be a part of your bundle.
+
+If you need to use Ajv in several bundles you can create a separate UMD bundle using `npm run bundle` script (thanks to [siddo420](https://github.com/siddo420)).
+
+Then you need to load Ajv in the browser:
+```html
+<script src="ajv.min.js"></script>
+```
+
+This bundle can be used with different module systems; it creates global `Ajv` if no module system is found.
+
+The browser bundle is available on [cdnjs](https://cdnjs.com/libraries/ajv).
+
+Ajv is tested with these browsers:
+
+[![Sauce Test Status](https://saucelabs.com/browser-matrix/epoberezkin.svg)](https://saucelabs.com/u/epoberezkin)
+
+__Please note__: some frameworks, e.g. Dojo, may redefine global require in such way that is not compatible with CommonJS module format. In such case Ajv bundle has to be loaded before the framework and then you can use global Ajv (see issue [#234](https://github.com/ajv-validator/ajv/issues/234)).
+
+
+### Ajv and Content Security Policies (CSP)
+
+If you're using Ajv to compile a schema (the typical use) in a browser document that is loaded with a Content Security Policy (CSP), that policy will require a `script-src` directive that includes the value `'unsafe-eval'`.
+:warning: NOTE, however, that `unsafe-eval` is NOT recommended in a secure CSP[[1]](https://developer.chrome.com/extensions/contentSecurityPolicy#relaxing-eval), as it has the potential to open the document to cross-site scripting (XSS) attacks.
+
+In order to make use of Ajv without easing your CSP, you can [pre-compile a schema using the CLI](https://github.com/ajv-validator/ajv-cli#compile-schemas). This will transpile the schema JSON into a JavaScript file that exports a `validate` function that works simlarly to a schema compiled at runtime.
+
+Note that pre-compilation of schemas is performed using [ajv-pack](https://github.com/ajv-validator/ajv-pack) and there are [some limitations to the schema features it can compile](https://github.com/ajv-validator/ajv-pack#limitations). A successfully pre-compiled schema is equivalent to the same schema compiled at runtime.
+
+
+## Command line interface
+
+CLI is available as a separate npm package [ajv-cli](https://github.com/ajv-validator/ajv-cli). It supports:
+
+- compiling JSON Schemas to test their validity
+- BETA: generating standalone module exporting a validation function to be used without Ajv (using [ajv-pack](https://github.com/ajv-validator/ajv-pack))
+- migrate schemas to draft-07 (using [json-schema-migrate](https://github.com/epoberezkin/json-schema-migrate))
+- validating data file(s) against JSON Schema
+- testing expected validity of data against JSON Schema
+- referenced schemas
+- custom meta-schemas
+- files in JSON, JSON5, YAML, and JavaScript format
+- all Ajv options
+- reporting changes in data after validation in [JSON-patch](https://tools.ietf.org/html/rfc6902) format
+
+
+## Validation keywords
+
+Ajv supports all validation keywords from draft-07 of JSON Schema standard:
+
+- [type](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#type)
+- [for numbers](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#keywords-for-numbers) - maximum, minimum, exclusiveMaximum, exclusiveMinimum, multipleOf
+- [for strings](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#keywords-for-strings) - maxLength, minLength, pattern, format
+- [for arrays](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#keywords-for-arrays) - maxItems, minItems, uniqueItems, items, additionalItems, [contains](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#contains)
+- [for objects](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#keywords-for-objects) - maxProperties, minProperties, required, properties, patternProperties, additionalProperties, dependencies, [propertyNames](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#propertynames)
+- [for all types](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#keywords-for-all-types) - enum, [const](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#const)
+- [compound keywords](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#compound-keywords) - not, oneOf, anyOf, allOf, [if/then/else](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#ifthenelse)
+
+With [ajv-keywords](https://github.com/ajv-validator/ajv-keywords) package Ajv also supports validation keywords from [JSON Schema extension proposals](https://github.com/json-schema/json-schema/wiki/v5-Proposals) for JSON Schema standard:
+
+- [patternRequired](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#patternrequired-proposed) - like `required` but with patterns that some property should match.
+- [formatMaximum, formatMinimum, formatExclusiveMaximum, formatExclusiveMinimum](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md#formatmaximum--formatminimum-and-exclusiveformatmaximum--exclusiveformatminimum-proposed) - setting limits for date, time, etc.
+
+See [JSON Schema validation keywords](https://github.com/ajv-validator/ajv/blob/master/KEYWORDS.md) for more details.
+
+
+## Annotation keywords
+
+JSON Schema specification defines several annotation keywords that describe schema itself but do not perform any validation.
+
+- `title` and `description`: information about the data represented by that schema
+- `$comment` (NEW in draft-07): information for developers. With option `$comment` Ajv logs or passes the comment string to the user-supplied function. See [Options](#options).
+- `default`: a default value of the data instance, see [Assigning defaults](#assigning-defaults).
+- `examples` (NEW in draft-06): an array of data instances. Ajv does not check the validity of these instances against the schema.
+- `readOnly` and `writeOnly` (NEW in draft-07): marks data-instance as read-only or write-only in relation to the source of the data (database, api, etc.).
+- `contentEncoding`: [RFC 2045](https://tools.ietf.org/html/rfc2045#section-6.1 ), e.g., "base64".
+- `contentMediaType`: [RFC 2046](https://tools.ietf.org/html/rfc2046), e.g., "image/png".
+
+__Please note__:  Ajv does not implement validation of the keywords `examples`, `contentEncoding` and `contentMediaType` but it reserves them. If you want to create a plugin that implements some of them, it should remove these keywords from the instance.
+
+
+## Formats
+
+Ajv implements formats defined by JSON Schema specification and several other formats. It is recommended NOT to use "format" keyword implementations with untrusted data, as they use potentially unsafe regular expressions - see [ReDoS attack](#redos-attack).
+
+__Please note__: if you need to use "format" keyword to validate untrusted data, you MUST assess their suitability and safety for your validation scenarios.
+
+The following formats are implemented for string validation with "format" keyword:
+
+- _date_: full-date according to [RFC3339](http://tools.ietf.org/html/rfc3339#section-5.6).
+- _time_: time with optional time-zone.
+- _date-time_: date-time from the same source (time-zone is mandatory). `date`, `time` and `date-time` validate ranges in `full` mode and only regexp in `fast` mode (see [options](#options)).
+- _uri_: full URI.
+- _uri-reference_: URI reference, including full and relative URIs.
+- _uri-template_: URI template according to [RFC6570](https://tools.ietf.org/html/rfc6570)
+- _url_ (deprecated): [URL record](https://url.spec.whatwg.org/#concept-url).
+- _email_: email address.
+- _hostname_: host name according to [RFC1034](http://tools.ietf.org/html/rfc1034#section-3.5).
+- _ipv4_: IP address v4.
+- _ipv6_: IP address v6.
+- _regex_: tests whether a string is a valid regular expression by passing it to RegExp constructor.
+- _uuid_: Universally Unique IDentifier according to [RFC4122](http://tools.ietf.org/html/rfc4122).
+- _json-pointer_: JSON-pointer according to [RFC6901](https://tools.ietf.org/html/rfc6901).
+- _relative-json-pointer_: relative JSON-pointer according to [this draft](http://tools.ietf.org/html/draft-luff-relative-json-pointer-00).
+
+__Please note__: JSON Schema draft-07 also defines formats `iri`, `iri-reference`, `idn-hostname` and `idn-email` for URLs, hostnames and emails with international characters. Ajv does not implement these formats. If you create Ajv plugin that implements them please make a PR to mention this plugin here.
+
+There are two modes of format validation: `fast` and `full`. This mode affects formats `date`, `time`, `date-time`, `uri`, `uri-reference`, and `email`. See [Options](#options) for details.
+
+You can add additional formats and replace any of the formats above using [addFormat](#api-addformat) method.
+
+The option `unknownFormats` allows changing the default behaviour when an unknown format is encountered. In this case Ajv can either fail schema compilation (default) or ignore it (default in versions before 5.0.0). You also can allow specific format(s) that will be ignored. See [Options](#options) for details.
+
+You can find regular expressions used for format validation and the sources that were used in [formats.js](https://github.com/ajv-validator/ajv/blob/master/lib/compile/formats.js).
+
+
+## <a name="ref"></a>Combining schemas with $ref
+
+You can structure your validation logic across multiple schema files and have schemas reference each other using `$ref` keyword.
+
+Example:
+
+```javascript
+var schema = {
+  "$id": "http://example.com/schemas/schema.json",
+  "type": "object",
+  "properties": {
+    "foo": { "$ref": "defs.json#/definitions/int" },
+    "bar": { "$ref": "defs.json#/definitions/str" }
+  }
+};
+
+var defsSchema = {
+  "$id": "http://example.com/schemas/defs.json",
+  "definitions": {
+    "int": { "type": "integer" },
+    "str": { "type": "string" }
+  }
+};
+```
+
+Now to compile your schema you can either pass all schemas to Ajv instance:
+
+```javascript
+var ajv = new Ajv({schemas: [schema, defsSchema]});
+var validate = ajv.getSchema('http://example.com/schemas/schema.json');
+```
+
+or use `addSchema` method:
+
+```javascript
+var ajv = new Ajv;
+var validate = ajv.addSchema(defsSchema)
+                  .compile(schema);
+```
+
+See [Options](#options) and [addSchema](#api) method.
+
+__Please note__:
+- `$ref` is resolved as the uri-reference using schema $id as the base URI (see the example).
+- References can be recursive (and mutually recursive) to implement the schemas for different data structures (such as linked lists, trees, graphs, etc.).
+- You don't have to host your schema files at the URIs that you use as schema $id. These URIs are only used to identify the schemas, and according to JSON Schema specification validators should not expect to be able to download the schemas from these URIs.
+- The actual location of the schema file in the file system is not used.
+- You can pass the identifier of the schema as the second parameter of `addSchema` method or as a property name in `schemas` option. This identifier can be used instead of (or in addition to) schema $id.
+- You cannot have the same $id (or the schema identifier) used for more than one schema - the exception will be thrown.
+- You can implement dynamic resolution of the referenced schemas using `compileAsync` method. In this way you can store schemas in any system (files, web, database, etc.) and reference them without explicitly adding to Ajv instance. See [Asynchronous schema compilation](#asynchronous-schema-compilation).
+
+
+## $data reference
+
+With `$data` option you can use values from the validated data as the values for the schema keywords. See [proposal](https://github.com/json-schema-org/json-schema-spec/issues/51) for more information about how it works.
+
+`$data` reference is supported in the keywords: const, enum, format, maximum/minimum, exclusiveMaximum / exclusiveMinimum, maxLength / minLength, maxItems / minItems, maxProperties / minProperties, formatMaximum / formatMinimum, formatExclusiveMaximum / formatExclusiveMinimum, multipleOf, pattern, required, uniqueItems.
+
+The value of "$data" should be a [JSON-pointer](https://tools.ietf.org/html/rfc6901) to the data (the root is always the top level data object, even if the $data reference is inside a referenced subschema) or a [relative JSON-pointer](http://tools.ietf.org/html/draft-luff-relative-json-pointer-00) (it is relative to the current point in data; if the $data reference is inside a referenced subschema it cannot point to the data outside of the root level for this subschema).
+
+Examples.
+
+This schema requires that the value in property `smaller` is less or equal than the value in the property larger:
+
+```javascript
+var ajv = new Ajv({$data: true});
+
+var schema = {
+  "properties": {
+    "smaller": {
+      "type": "number",
+      "maximum": { "$data": "1/larger" }
+    },
+    "larger": { "type": "number" }
+  }
+};
+
+var validData = {
+  smaller: 5,
+  larger: 7
+};
+
+ajv.validate(schema, validData); // true
+```
+
+This schema requires that the properties have the same format as their field names:
+
+```javascript
+var schema = {
+  "additionalProperties": {
+    "type": "string",
+    "format": { "$data": "0#" }
+  }
+};
+
+var validData = {
+  'date-time': '1963-06-19T08:30:06.283185Z',
+  email: 'joe.bloggs@example.com'
+}
+```
+
+`$data` reference is resolved safely - it won't throw even if some property is undefined. If `$data` resolves to `undefined` the validation succeeds (with the exclusion of `const` keyword). If `$data` resolves to incorrect type (e.g. not "number" for maximum keyword) the validation fails.
+
+
+## $merge and $patch keywords
+
+With the package [ajv-merge-patch](https://github.com/ajv-validator/ajv-merge-patch) you can use the keywords `$merge` and `$patch` that allow extending JSON Schemas with patches using formats [JSON Merge Patch (RFC 7396)](https://tools.ietf.org/html/rfc7396) and [JSON Patch (RFC 6902)](https://tools.ietf.org/html/rfc6902).
+
+To add keywords `$merge` and `$patch` to Ajv instance use this code:
+
+```javascript
+require('ajv-merge-patch')(ajv);
+```
+
+Examples.
+
+Using `$merge`:
+
+```json
+{
+  "$merge": {
+    "source": {
+      "type": "object",
+      "properties": { "p": { "type": "string" } },
+      "additionalProperties": false
+    },
+    "with": {
+      "properties": { "q": { "type": "number" } }
+    }
+  }
+}
+```
+
+Using `$patch`:
+
+```json
+{
+  "$patch": {
+    "source": {
+      "type": "object",
+      "properties": { "p": { "type": "string" } },
+      "additionalProperties": false
+    },
+    "with": [
+      { "op": "add", "path": "/properties/q", "value": { "type": "number" } }
+    ]
+  }
+}
+```
+
+The schemas above are equivalent to this schema:
+
+```json
+{
+  "type": "object",
+  "properties": {
+    "p": { "type": "string" },
+    "q": { "type": "number" }
+  },
+  "additionalProperties": false
+}
+```
+
+The properties `source` and `with` in the keywords `$merge` and `$patch` can use absolute or relative `$ref` to point to other schemas previously added to the Ajv instance or to the fragments of the current schema.
+
+See the package [ajv-merge-patch](https://github.com/ajv-validator/ajv-merge-patch) for more information.
+
+
+## Defining custom keywords
+
+The advantages of using custom keywords are:
+
+- allow creating validation scenarios that cannot be expressed using JSON Schema
+- simplify your schemas
+- help bringing a bigger part of the validation logic to your schemas
+- make your schemas more expressive, less verbose and closer to your application domain
+- implement custom data processors that modify your data (`modifying` option MUST be used in keyword definition) and/or create side effects while the data is being validated
+
+If a keyword is used only for side-effects and its validation result is pre-defined, use option `valid: true/false` in keyword definition to simplify both generated code (no error handling in case of `valid: true`) and your keyword functions (no need to return any validation result).
+
+The concerns you have to be aware of when extending JSON Schema standard with custom keywords are the portability and understanding of your schemas. You will have to support these custom keywords on other platforms and to properly document these keywords so that everybody can understand them in your schemas.
+
+You can define custom keywords with [addKeyword](#api-addkeyword) method. Keywords are defined on the `ajv` instance level - new instances will not have previously defined keywords.
+
+Ajv allows defining keywords with:
+- validation function
+- compilation function
+- macro function
+- inline compilation function that should return code (as string) that will be inlined in the currently compiled schema.
+
+Example. `range` and `exclusiveRange` keywords using compiled schema:
+
+```javascript
+ajv.addKeyword('range', {
+  type: 'number',
+  compile: function (sch, parentSchema) {
+    var min = sch[0];
+    var max = sch[1];
+
+    return parentSchema.exclusiveRange === true
+            ? function (data) { return data > min && data < max; }
+            : function (data) { return data >= min && data <= max; }
+  }
+});
+
+var schema = { "range": [2, 4], "exclusiveRange": true };
+var validate = ajv.compile(schema);
+console.log(validate(2.01)); // true
+console.log(validate(3.99)); // true
+console.log(validate(2)); // false
+console.log(validate(4)); // false
+```
+
+Several custom keywords (typeof, instanceof, range and propertyNames) are defined in [ajv-keywords](https://github.com/ajv-validator/ajv-keywords) package - they can be used for your schemas and as a starting point for your own custom keywords.
+
+See [Defining custom keywords](https://github.com/ajv-validator/ajv/blob/master/CUSTOM.md) for more details.
+
+
+## Asynchronous schema compilation
+
+During asynchronous compilation remote references are loaded using supplied function. See `compileAsync` [method](#api-compileAsync) and `loadSchema` [option](#options).
+
+Example:
+
+```javascript
+var ajv = new Ajv({ loadSchema: loadSchema });
+
+ajv.compileAsync(schema).then(function (validate) {
+  var valid = validate(data);
+  // ...
+});
+
+function loadSchema(uri) {
+  return request.json(uri).then(function (res) {
+    if (res.statusCode >= 400)
+      throw new Error('Loading error: ' + res.statusCode);
+    return res.body;
+  });
+}
+```
+
+__Please note__: [Option](#options) `missingRefs` should NOT be set to `"ignore"` or `"fail"` for asynchronous compilation to work.
+
+
+## Asynchronous validation
+
+Example in Node.js REPL: https://tonicdev.com/esp/ajv-asynchronous-validation
+
+You can define custom formats and keywords that perform validation asynchronously by accessing database or some other service. You should add `async: true` in the keyword or format definition (see [addFormat](#api-addformat), [addKeyword](#api-addkeyword) and [Defining custom keywords](#defining-custom-keywords)).
+
+If your schema uses asynchronous formats/keywords or refers to some schema that contains them it should have `"$async": true` keyword so that Ajv can compile it correctly. If asynchronous format/keyword or reference to asynchronous schema is used in the schema without `$async` keyword Ajv will throw an exception during schema compilation.
+
+__Please note__: all asynchronous subschemas that are referenced from the current or other schemas should have `"$async": true` keyword as well, otherwise the schema compilation will fail.
+
+Validation function for an asynchronous custom format/keyword should return a promise that resolves with `true` or `false` (or rejects with `new Ajv.ValidationError(errors)` if you want to return custom errors from the keyword function).
+
+Ajv compiles asynchronous schemas to [es7 async functions](http://tc39.github.io/ecmascript-asyncawait/) that can optionally be transpiled with [nodent](https://github.com/MatAtBread/nodent). Async functions are supported in Node.js 7+ and all modern browsers. You can also supply any other transpiler as a function via `processCode` option. See [Options](#options).
+
+The compiled validation function has `$async: true` property (if the schema is asynchronous), so you can differentiate these functions if you are using both synchronous and asynchronous schemas.
+
+Validation result will be a promise that resolves with validated data or rejects with an exception `Ajv.ValidationError` that contains the array of validation errors in `errors` property.
+
+
+Example:
+
+```javascript
+var ajv = new Ajv;
+// require('ajv-async')(ajv);
+
+ajv.addKeyword('idExists', {
+  async: true,
+  type: 'number',
+  validate: checkIdExists
+});
+
+
+function checkIdExists(schema, data) {
+  return knex(schema.table)
+  .select('id')
+  .where('id', data)
+  .then(function (rows) {
+    return !!rows.length; // true if record is found
+  });
+}
+
+var schema = {
+  "$async": true,
+  "properties": {
+    "userId": {
+      "type": "integer",
+      "idExists": { "table": "users" }
+    },
+    "postId": {
+      "type": "integer",
+      "idExists": { "table": "posts" }
+    }
+  }
+};
+
+var validate = ajv.compile(schema);
+
+validate({ userId: 1, postId: 19 })
+.then(function (data) {
+  console.log('Data is valid', data); // { userId: 1, postId: 19 }
+})
+.catch(function (err) {
+  if (!(err instanceof Ajv.ValidationError)) throw err;
+  // data is invalid
+  console.log('Validation errors:', err.errors);
+});
+```
+
+### Using transpilers with asynchronous validation functions.
+
+[ajv-async](https://github.com/ajv-validator/ajv-async) uses [nodent](https://github.com/MatAtBread/nodent) to transpile async functions. To use another transpiler you should separately install it (or load its bundle in the browser).
+
+
+#### Using nodent
+
+```javascript
+var ajv = new Ajv;
+require('ajv-async')(ajv);
+// in the browser if you want to load ajv-async bundle separately you can:
+// window.ajvAsync(ajv);
+var validate = ajv.compile(schema); // transpiled es7 async function
+validate(data).then(successFunc).catch(errorFunc);
+```
+
+
+#### Using other transpilers
+
+```javascript
+var ajv = new Ajv({ processCode: transpileFunc });
+var validate = ajv.compile(schema); // transpiled es7 async function
+validate(data).then(successFunc).catch(errorFunc);
+```
+
+See [Options](#options).
+
+
+## Security considerations
+
+JSON Schema, if properly used, can replace data sanitisation. It doesn't replace other API security considerations. It also introduces additional security aspects to consider.
+
+
+##### Security contact
+
+To report a security vulnerability, please use the
+[Tidelift security contact](https://tidelift.com/security).
+Tidelift will coordinate the fix and disclosure. Please do NOT report security vulnerabilities via GitHub issues.
+
+
+##### Untrusted schemas
+
+Ajv treats JSON schemas as trusted as your application code. This security model is based on the most common use case, when the schemas are static and bundled together with the application.
+
+If your schemas are received from untrusted sources (or generated from untrusted data) there are several scenarios you need to prevent:
+- compiling schemas can cause stack overflow (if they are too deep)
+- compiling schemas can be slow (e.g. [#557](https://github.com/ajv-validator/ajv/issues/557))
+- validating certain data can be slow
+
+It is difficult to predict all the scenarios, but at the very least it may help to limit the size of untrusted schemas (e.g. limit JSON string length) and also the maximum schema object depth (that can be high for relatively small JSON strings). You also may want to mitigate slow regular expressions in `pattern` and `patternProperties` keywords.
+
+Regardless the measures you take, using untrusted schemas increases security risks.
+
+
+##### Circular references in JavaScript objects
+
+Ajv does not support schemas and validated data that have circular references in objects. See [issue #802](https://github.com/ajv-validator/ajv/issues/802).
+
+An attempt to compile such schemas or validate such data would cause stack overflow (or will not complete in case of asynchronous validation). Depending on the parser you use, untrusted data can lead to circular references.
+
+
+##### Security risks of trusted schemas
+
+Some keywords in JSON Schemas can lead to very slow validation for certain data. These keywords include (but may be not limited to):
+
+- `pattern` and `format` for large strings - in some cases using `maxLength` can help mitigate it, but certain regular expressions can lead to exponential validation time even with relatively short strings (see [ReDoS attack](#redos-attack)).
+- `patternProperties` for large property names - use `propertyNames` to mitigate, but some regular expressions can have exponential evaluation time as well.
+- `uniqueItems` for large non-scalar arrays - use `maxItems` to mitigate
+
+__Please note__: The suggestions above to prevent slow validation would only work if you do NOT use `allErrors: true` in production code (using it would continue validation after validation errors).
+
+You can validate your JSON schemas against [this meta-schema](https://github.com/ajv-validator/ajv/blob/master/lib/refs/json-schema-secure.json) to check that these recommendations are followed:
+
+```javascript
+const isSchemaSecure = ajv.compile(require('ajv/lib/refs/json-schema-secure.json'));
+
+const schema1 = {format: 'email'};
+isSchemaSecure(schema1); // false
+
+const schema2 = {format: 'email', maxLength: MAX_LENGTH};
+isSchemaSecure(schema2); // true
+```
+
+__Please note__: following all these recommendation is not a guarantee that validation of untrusted data is safe - it can still lead to some undesirable results.
+
+
+##### Content Security Policies (CSP)
+See [Ajv and Content Security Policies (CSP)](#ajv-and-content-security-policies-csp)
+
+
+## ReDoS attack
+
+Certain regular expressions can lead to the exponential evaluation time even with relatively short strings.
+
+Please assess the regular expressions you use in the schemas on their vulnerability to this attack - see [safe-regex](https://github.com/substack/safe-regex), for example.
+
+__Please note__: some formats that Ajv implements use [regular expressions](https://github.com/ajv-validator/ajv/blob/master/lib/compile/formats.js) that can be vulnerable to ReDoS attack, so if you use Ajv to validate data from untrusted sources __it is strongly recommended__ to consider the following:
+
+- making assessment of "format" implementations in Ajv.
+- using `format: 'fast'` option that simplifies some of the regular expressions (although it does not guarantee that they are safe).
+- replacing format implementations provided by Ajv with your own implementations of "format" keyword that either uses different regular expressions or another approach to format validation. Please see [addFormat](#api-addformat) method.
+- disabling format validation by ignoring "format" keyword with option `format: false`
+
+Whatever mitigation you choose, please assume all formats provided by Ajv as potentially unsafe and make your own assessment of their suitability for your validation scenarios.
+
+
+## Filtering data
+
+With [option `removeAdditional`](#options) (added by [andyscott](https://github.com/andyscott)) you can filter data during the validation.
+
+This option modifies original data.
+
+Example:
+
+```javascript
+var ajv = new Ajv({ removeAdditional: true });
+var schema = {
+  "additionalProperties": false,
+  "properties": {
+    "foo": { "type": "number" },
+    "bar": {
+      "additionalProperties": { "type": "number" },
+      "properties": {
+        "baz": { "type": "string" }
+      }
+    }
+  }
+}
+
+var data = {
+  "foo": 0,
+  "additional1": 1, // will be removed; `additionalProperties` == false
+  "bar": {
+    "baz": "abc",
+    "additional2": 2 // will NOT be removed; `additionalProperties` != false
+  },
+}
+
+var validate = ajv.compile(schema);
+
+console.log(validate(data)); // true
+console.log(data); // { "foo": 0, "bar": { "baz": "abc", "additional2": 2 }
+```
+
+If `removeAdditional` option in the example above were `"all"` then both `additional1` and `additional2` properties would have been removed.
+
+If the option were `"failing"` then property `additional1` would have been removed regardless of its value and property `additional2` would have been removed only if its value were failing the schema in the inner `additionalProperties` (so in the example above it would have stayed because it passes the schema, but any non-number would have been removed).
+
+__Please note__: If you use `removeAdditional` option with `additionalProperties` keyword inside `anyOf`/`oneOf` keywords your validation can fail with this schema, for example:
+
+```json
+{
+  "type": "object",
+  "oneOf": [
+    {
+      "properties": {
+        "foo": { "type": "string" }
+      },
+      "required": [ "foo" ],
+      "additionalProperties": false
+    },
+    {
+      "properties": {
+        "bar": { "type": "integer" }
+      },
+      "required": [ "bar" ],
+      "additionalProperties": false
+    }
+  ]
+}
+```
+
+The intention of the schema above is to allow objects with either the string property "foo" or the integer property "bar", but not with both and not with any other properties.
+
+With the option `removeAdditional: true` the validation will pass for the object `{ "foo": "abc"}` but will fail for the object `{"bar": 1}`. It happens because while the first subschema in `oneOf` is validated, the property `bar` is removed because it is an additional property according to the standard (because it is not included in `properties` keyword in the same schema).
+
+While this behaviour is unexpected (issues [#129](https://github.com/ajv-validator/ajv/issues/129), [#134](https://github.com/ajv-validator/ajv/issues/134)), it is correct. To have the expected behaviour (both objects are allowed and additional properties are removed) the schema has to be refactored in this way:
+
+```json
+{
+  "type": "object",
+  "properties": {
+    "foo": { "type": "string" },
+    "bar": { "type": "integer" }
+  },
+  "additionalProperties": false,
+  "oneOf": [
+    { "required": [ "foo" ] },
+    { "required": [ "bar" ] }
+  ]
+}
+```
+
+The schema above is also more efficient - it will compile into a faster function.
+
+
+## Assigning defaults
+
+With [option `useDefaults`](#options) Ajv will assign values from `default` keyword in the schemas of `properties` and `items` (when it is the array of schemas) to the missing properties and items.
+
+With the option value `"empty"` properties and items equal to `null` or `""` (empty string) will be considered missing and assigned defaults.
+
+This option modifies original data.
+
+__Please note__: the default value is inserted in the generated validation code as a literal, so the value inserted in the data will be the deep clone of the default in the schema.
+
+
+Example 1 (`default` in `properties`):
+
+```javascript
+var ajv = new Ajv({ useDefaults: true });
+var schema = {
+  "type": "object",
+  "properties": {
+    "foo": { "type": "number" },
+    "bar": { "type": "string", "default": "baz" }
+  },
+  "required": [ "foo", "bar" ]
+};
+
+var data = { "foo": 1 };
+
+var validate = ajv.compile(schema);
+
+console.log(validate(data)); // true
+console.log(data); // { "foo": 1, "bar": "baz" }
+```
+
+Example 2 (`default` in `items`):
+
+```javascript
+var schema = {
+  "type": "array",
+  "items": [
+    { "type": "number" },
+    { "type": "string", "default": "foo" }
+  ]
+}
+
+var data = [ 1 ];
+
+var validate = ajv.compile(schema);
+
+console.log(validate(data)); // true
+console.log(data); // [ 1, "foo" ]
+```
+
+`default` keywords in other cases are ignored:
+
+- not in `properties` or `items` subschemas
+- in schemas inside `anyOf`, `oneOf` and `not` (see [#42](https://github.com/ajv-validator/ajv/issues/42))
+- in `if` subschema of `switch` keyword
+- in schemas generated by custom macro keywords
+
+The [`strictDefaults` option](#options) customizes Ajv's behavior for the defaults that Ajv ignores (`true` raises an error, and `"log"` outputs a warning).
+
+
+## Coercing data types
+
+When you are validating user inputs all your data properties are usually strings. The option `coerceTypes` allows you to have your data types coerced to the types specified in your schema `type` keywords, both to pass the validation and to use the correctly typed data afterwards.
+
+This option modifies original data.
+
+__Please note__: if you pass a scalar value to the validating function its type will be coerced and it will pass the validation, but the value of the variable you pass won't be updated because scalars are passed by value.
+
+
+Example 1:
+
+```javascript
+var ajv = new Ajv({ coerceTypes: true });
+var schema = {
+  "type": "object",
+  "properties": {
+    "foo": { "type": "number" },
+    "bar": { "type": "boolean" }
+  },
+  "required": [ "foo", "bar" ]
+};
+
+var data = { "foo": "1", "bar": "false" };
+
+var validate = ajv.compile(schema);
+
+console.log(validate(data)); // true
+console.log(data); // { "foo": 1, "bar": false }
+```
+
+Example 2 (array coercions):
+
+```javascript
+var ajv = new Ajv({ coerceTypes: 'array' });
+var schema = {
+  "properties": {
+    "foo": { "type": "array", "items": { "type": "number" } },
+    "bar": { "type": "boolean" }
+  }
+};
+
+var data = { "foo": "1", "bar": ["false"] };
+
+var validate = ajv.compile(schema);
+
+console.log(validate(data)); // true
+console.log(data); // { "foo": [1], "bar": false }
+```
+
+The coercion rules, as you can see from the example, are different from JavaScript both to validate user input as expected and to have the coercion reversible (to correctly validate cases where different types are defined in subschemas of "anyOf" and other compound keywords).
+
+See [Coercion rules](https://github.com/ajv-validator/ajv/blob/master/COERCION.md) for details.
+
+
+## API
+
+##### new Ajv(Object options) -&gt; Object
+
+Create Ajv instance.
+
+
+##### .compile(Object schema) -&gt; Function&lt;Object data&gt;
+
+Generate validating function and cache the compiled schema for future use.
+
+Validating function returns a boolean value. This function has properties `errors` and `schema`. Errors encountered during the last validation are assigned to `errors` property (it is assigned `null` if there was no errors). `schema` property contains the reference to the original schema.
+
+The schema passed to this method will be validated against meta-schema unless `validateSchema` option is false. If schema is invalid, an error will be thrown. See [options](#options).
+
+
+##### <a name="api-compileAsync"></a>.compileAsync(Object schema [, Boolean meta] [, Function callback]) -&gt; Promise
+
+Asynchronous version of `compile` method that loads missing remote schemas using asynchronous function in `options.loadSchema`. This function returns a Promise that resolves to a validation function. An optional callback passed to `compileAsync` will be called with 2 parameters: error (or null) and validating function. The returned promise will reject (and the callback will be called with an error) when:
+
+- missing schema can't be loaded (`loadSchema` returns a Promise that rejects).
+- a schema containing a missing reference is loaded, but the reference cannot be resolved.
+- schema (or some loaded/referenced schema) is invalid.
+
+The function compiles schema and loads the first missing schema (or meta-schema) until all missing schemas are loaded.
+
+You can asynchronously compile meta-schema by passing `true` as the second parameter.
+
+See example in [Asynchronous compilation](#asynchronous-schema-compilation).
+
+
+##### .validate(Object schema|String key|String ref, data) -&gt; Boolean
+
+Validate data using passed schema (it will be compiled and cached).
+
+Instead of the schema you can use the key that was previously passed to `addSchema`, the schema id if it was present in the schema or any previously resolved reference.
+
+Validation errors will be available in the `errors` property of Ajv instance (`null` if there were no errors).
+
+__Please note__: every time this method is called the errors are overwritten so you need to copy them to another variable if you want to use them later.
+
+If the schema is asynchronous (has `$async` keyword on the top level) this method returns a Promise. See [Asynchronous validation](#asynchronous-validation).
+
+
+##### .addSchema(Array&lt;Object&gt;|Object schema [, String key]) -&gt; Ajv
+
+Add schema(s) to validator instance. This method does not compile schemas (but it still validates them). Because of that dependencies can be added in any order and circular dependencies are supported. It also prevents unnecessary compilation of schemas that are containers for other schemas but not used as a whole.
+
+Array of schemas can be passed (schemas should have ids), the second parameter will be ignored.
+
+Key can be passed that can be used to reference the schema and will be used as the schema id if there is no id inside the schema. If the key is not passed, the schema id will be used as the key.
+
+
+Once the schema is added, it (and all the references inside it) can be referenced in other schemas and used to validate data.
+
+Although `addSchema` does not compile schemas, explicit compilation is not required - the schema will be compiled when it is used first time.
+
+By default the schema is validated against meta-schema before it is added, and if the schema does not pass validation the exception is thrown. This behaviour is controlled by `validateSchema` option.
+
+__Please note__: Ajv uses the [method chaining syntax](https://en.wikipedia.org/wiki/Method_chaining) for all methods with the prefix `add*` and `remove*`.
+This allows you to do nice things like the following.
+
+```javascript
+var validate = new Ajv().addSchema(schema).addFormat(name, regex).getSchema(uri);
+```
+
+##### .addMetaSchema(Array&lt;Object&gt;|Object schema [, String key]) -&gt; Ajv
+
+Adds meta schema(s) that can be used to validate other schemas. That function should be used instead of `addSchema` because there may be instance options that would compile a meta schema incorrectly (at the moment it is `removeAdditional` option).
+
+There is no need to explicitly add draft-07 meta schema (http://json-schema.org/draft-07/schema) - it is added by default, unless option `meta` is set to `false`. You only need to use it if you have a changed meta-schema that you want to use to validate your schemas. See `validateSchema`.
+
+
+##### <a name="api-validateschema"></a>.validateSchema(Object schema) -&gt; Boolean
+
+Validates schema. This method should be used to validate schemas rather than `validate` due to the inconsistency of `uri` format in JSON Schema standard.
+
+By default this method is called automatically when the schema is added, so you rarely need to use it directly.
+
+If schema doesn't have `$schema` property, it is validated against draft 6 meta-schema (option `meta` should not be false).
+
+If schema has `$schema` property, then the schema with this id (that should be previously added) is used to validate passed schema.
+
+Errors will be available at `ajv.errors`.
+
+
+##### .getSchema(String key) -&gt; Function&lt;Object data&gt;
+
+Retrieve compiled schema previously added with `addSchema` by the key passed to `addSchema` or by its full reference (id). The returned validating function has `schema` property with the reference to the original schema.
+
+
+##### .removeSchema([Object schema|String key|String ref|RegExp pattern]) -&gt; Ajv
+
+Remove added/cached schema. Even if schema is referenced by other schemas it can be safely removed as dependent schemas have local references.
+
+Schema can be removed using:
+- key passed to `addSchema`
+- it's full reference (id)
+- RegExp that should match schema id or key (meta-schemas won't be removed)
+- actual schema object that will be stable-stringified to remove schema from cache
+
+If no parameter is passed all schemas but meta-schemas will be removed and the cache will be cleared.
+
+
+##### <a name="api-addformat"></a>.addFormat(String name, String|RegExp|Function|Object format) -&gt; Ajv
+
+Add custom format to validate strings or numbers. It can also be used to replace pre-defined formats for Ajv instance.
+
+Strings are converted to RegExp.
+
+Function should return validation result as `true` or `false`.
+
+If object is passed it should have properties `validate`, `compare` and `async`:
+
+- _validate_: a string, RegExp or a function as described above.
+- _compare_: an optional comparison function that accepts two strings and compares them according to the format meaning. This function is used with keywords `formatMaximum`/`formatMinimum` (defined in [ajv-keywords](https://github.com/ajv-validator/ajv-keywords) package). It should return `1` if the first value is bigger than the second value, `-1` if it is smaller and `0` if it is equal.
+- _async_: an optional `true` value if `validate` is an asynchronous function; in this case it should return a promise that resolves with a value `true` or `false`.
+- _type_: an optional type of data that the format applies to. It can be `"string"` (default) or `"number"` (see https://github.com/ajv-validator/ajv/issues/291#issuecomment-259923858). If the type of data is different, the validation will pass.
+
+Custom formats can be also added via `formats` option.
+
+
+##### <a name="api-addkeyword"></a>.addKeyword(String keyword, Object definition) -&gt; Ajv
+
+Add custom validation keyword to Ajv instance.
+
+Keyword should be different from all standard JSON Schema keywords and different from previously defined keywords. There is no way to redefine keywords or to remove keyword definition from the instance.
+
+Keyword must start with a letter, `_` or `$`, and may continue with letters, numbers, `_`, `$`, or `-`.
+It is recommended to use an application-specific prefix for keywords to avoid current and future name collisions.
+
+Example Keywords:
+- `"xyz-example"`: valid, and uses prefix for the xyz project to avoid name collisions.
+- `"example"`: valid, but not recommended as it could collide with future versions of JSON Schema etc.
+- `"3-example"`: invalid as numbers are not allowed to be the first character in a keyword
+
+Keyword definition is an object with the following properties:
+
+- _type_: optional string or array of strings with data type(s) that the keyword applies to. If not present, the keyword will apply to all types.
+- _validate_: validating function
+- _compile_: compiling function
+- _macro_: macro function
+- _inline_: compiling function that returns code (as string)
+- _schema_: an optional `false` value used with "validate" keyword to not pass schema
+- _metaSchema_: an optional meta-schema for keyword schema
+- _dependencies_: an optional list of properties that must be present in the parent schema - it will be checked during schema compilation
+- _modifying_: `true` MUST be passed if keyword modifies data
+- _statements_: `true` can be passed in case inline keyword generates statements (as opposed to expression)
+- _valid_: pass `true`/`false` to pre-define validation result, the result returned from validation function will be ignored. This option cannot be used with macro keywords.
+- _$data_: an optional `true` value to support [$data reference](#data-reference) as the value of custom keyword. The reference will be resolved at validation time. If the keyword has meta-schema it would be extended to allow $data and it will be used to validate the resolved value. Supporting $data reference requires that keyword has validating function (as the only option or in addition to compile, macro or inline function).
+- _async_: an optional `true` value if the validation function is asynchronous (whether it is compiled or passed in _validate_ property); in this case it should return a promise that resolves with a value `true` or `false`. This option is ignored in case of "macro" and "inline" keywords.
+- _errors_: an optional boolean or string `"full"` indicating whether keyword returns errors. If this property is not set Ajv will determine if the errors were set in case of failed validation.
+
+_compile_, _macro_ and _inline_ are mutually exclusive, only one should be used at a time. _validate_ can be used separately or in addition to them to support $data reference.
+
+__Please note__: If the keyword is validating data type that is different from the type(s) in its definition, the validation function will not be called (and expanded macro will not be used), so there is no need to check for data type inside validation function or inside schema returned by macro function (unless you want to enforce a specific type and for some reason do not want to use a separate `type` keyword for that). In the same way as standard keywords work, if the keyword does not apply to the data type being validated, the validation of this keyword will succeed.
+
+See [Defining custom keywords](#defining-custom-keywords) for more details.
+
+
+##### .getKeyword(String keyword) -&gt; Object|Boolean
+
+Returns custom keyword definition, `true` for pre-defined keywords and `false` if the keyword is unknown.
+
+
+##### .removeKeyword(String keyword) -&gt; Ajv
+
+Removes custom or pre-defined keyword so you can redefine them.
+
+While this method can be used to extend pre-defined keywords, it can also be used to completely change their meaning - it may lead to unexpected results.
+
+__Please note__: schemas compiled before the keyword is removed will continue to work without changes. To recompile schemas use `removeSchema` method and compile them again.
+
+
+##### .errorsText([Array&lt;Object&gt; errors [, Object options]]) -&gt; String
+
+Returns the text with all errors in a String.
+
+Options can have properties `separator` (string used to separate errors, ", " by default) and `dataVar` (the variable name that dataPaths are prefixed with, "data" by default).
+
+
+## Options
+
+Defaults:
+
+```javascript
+{
+  // validation and reporting options:
+  $data:            false,
+  allErrors:        false,
+  verbose:          false,
+  $comment:         false, // NEW in Ajv version 6.0
+  jsonPointers:     false,
+  uniqueItems:      true,
+  unicode:          true,
+  nullable:         false,
+  format:           'fast',
+  formats:          {},
+  unknownFormats:   true,
+  schemas:          {},
+  logger:           undefined,
+  // referenced schema options:
+  schemaId:         '$id',
+  missingRefs:      true,
+  extendRefs:       'ignore', // recommended 'fail'
+  loadSchema:       undefined, // function(uri: string): Promise {}
+  // options to modify validated data:
+  removeAdditional: false,
+  useDefaults:      false,
+  coerceTypes:      false,
+  // strict mode options
+  strictDefaults:   false,
+  strictKeywords:   false,
+  strictNumbers:    false,
+  // asynchronous validation options:
+  transpile:        undefined, // requires ajv-async package
+  // advanced options:
+  meta:             true,
+  validateSchema:   true,
+  addUsedSchema:    true,
+  inlineRefs:       true,
+  passContext:      false,
+  loopRequired:     Infinity,
+  ownProperties:    false,
+  multipleOfPrecision: false,
+  errorDataPath:    'object', // deprecated
+  messages:         true,
+  sourceCode:       false,
+  processCode:      undefined, // function (str: string, schema: object): string {}
+  cache:            new Cache,
+  serialize:        undefined
+}
+```
+
+##### Validation and reporting options
+
+- _$data_: support [$data references](#data-reference). Draft 6 meta-schema that is added by default will be extended to allow them. If you want to use another meta-schema you need to use $dataMetaSchema method to add support for $data reference. See [API](#api).
+- _allErrors_: check all rules collecting all errors. Default is to return after the first error.
+- _verbose_: include the reference to the part of the schema (`schema` and `parentSchema`) and validated data in errors (false by default).
+- _$comment_ (NEW in Ajv version 6.0): log or pass the value of `$comment` keyword to a function. Option values:
+  - `false` (default): ignore $comment keyword.
+  - `true`: log the keyword value to console.
+  - function: pass the keyword value, its schema path and root schema to the specified function
+- _jsonPointers_: set `dataPath` property of errors using [JSON Pointers](https://tools.ietf.org/html/rfc6901) instead of JavaScript property access notation.
+- _uniqueItems_: validate `uniqueItems` keyword (true by default).
+- _unicode_: calculate correct length of strings with unicode pairs (true by default). Pass `false` to use `.length` of strings that is faster, but gives "incorrect" lengths of strings with unicode pairs - each unicode pair is counted as two characters.
+- _nullable_: support keyword "nullable" from [Open API 3 specification](https://swagger.io/docs/specification/data-models/data-types/).
+- _format_: formats validation mode. Option values:
+  - `"fast"` (default) - simplified and fast validation (see [Formats](#formats) for details of which formats are available and affected by this option).
+  - `"full"` - more restrictive and slow validation. E.g., 25:00:00 and 2015/14/33 will be invalid time and date in 'full' mode but it will be valid in 'fast' mode.
+  - `false` - ignore all format keywords.
+- _formats_: an object with custom formats. Keys and values will be passed to `addFormat` method.
+- _keywords_: an object with custom keywords. Keys and values will be passed to `addKeyword` method.
+- _unknownFormats_: handling of unknown formats. Option values:
+  - `true` (default) - if an unknown format is encountered the exception is thrown during schema compilation. If `format` keyword value is [$data reference](#data-reference) and it is unknown the validation will fail.
+  - `[String]` - an array of unknown format names that will be ignored. This option can be used to allow usage of third party schemas with format(s) for which you don't have definitions, but still fail if another unknown format is used. If `format` keyword value is [$data reference](#data-reference) and it is not in this array the validation will fail.
+  - `"ignore"` - to log warning during schema compilation and always pass validation (the default behaviour in versions before 5.0.0). This option is not recommended, as it allows to mistype format name and it won't be validated without any error message. This behaviour is required by JSON Schema specification.
+- _schemas_: an array or object of schemas that will be added to the instance. In case you pass the array the schemas must have IDs in them. When the object is passed the method `addSchema(value, key)` will be called for each schema in this object.
+- _logger_: sets the logging method. Default is the global `console` object that should have methods `log`, `warn` and `error`. See [Error logging](#error-logging). Option values:
+  - custom logger - it should have methods `log`, `warn` and `error`. If any of these methods is missing an exception will be thrown.
+  - `false` - logging is disabled.
+
+
+##### Referenced schema options
+
+- _schemaId_: this option defines which keywords are used as schema URI. Option value:
+  - `"$id"` (default) - only use `$id` keyword as schema URI (as specified in JSON Schema draft-06/07), ignore `id` keyword (if it is present a warning will be logged).
+  - `"id"` - only use `id` keyword as schema URI (as specified in JSON Schema draft-04), ignore `$id` keyword (if it is present a warning will be logged).
+  - `"auto"` - use both `$id` and `id` keywords as schema URI. If both are present (in the same schema object) and different the exception will be thrown during schema compilation.
+- _missingRefs_: handling of missing referenced schemas. Option values:
+  - `true` (default) - if the reference cannot be resolved during compilation the exception is thrown. The thrown error has properties `missingRef` (with hash fragment) and `missingSchema` (without it). Both properties are resolved relative to the current base id (usually schema id, unless it was substituted).
+  - `"ignore"` - to log error during compilation and always pass validation.
+  - `"fail"` - to log error and successfully compile schema but fail validation if this rule is checked.
+- _extendRefs_: validation of other keywords when `$ref` is present in the schema. Option values:
+  - `"ignore"` (default) - when `$ref` is used other keywords are ignored (as per [JSON Reference](https://tools.ietf.org/html/draft-pbryan-zyp-json-ref-03#section-3) standard). A warning will be logged during the schema compilation.
+  - `"fail"` (recommended) - if other validation keywords are used together with `$ref` the exception will be thrown when the schema is compiled. This option is recommended to make sure schema has no keywords that are ignored, which can be confusing.
+  - `true` - validate all keywords in the schemas with `$ref` (the default behaviour in versions before 5.0.0).
+- _loadSchema_: asynchronous function that will be used to load remote schemas when `compileAsync` [method](#api-compileAsync) is used and some reference is missing (option `missingRefs` should NOT be 'fail' or 'ignore'). This function should accept remote schema uri as a parameter and return a Promise that resolves to a schema. See example in [Asynchronous compilation](#asynchronous-schema-compilation).
+
+
+##### Options to modify validated data
+
+- _removeAdditional_: remove additional properties - see example in [Filtering data](#filtering-data). This option is not used if schema is added with `addMetaSchema` method. Option values:
+  - `false` (default) - not to remove additional properties
+  - `"all"` - all additional properties are removed, regardless of `additionalProperties` keyword in schema (and no validation is made for them).
+  - `true` - only additional properties with `additionalProperties` keyword equal to `false` are removed.
+  - `"failing"` - additional properties that fail schema validation will be removed (where `additionalProperties` keyword is `false` or schema).
+- _useDefaults_: replace missing or undefined properties and items with the values from corresponding `default` keywords. Default behaviour is to ignore `default` keywords. This option is not used if schema is added with `addMetaSchema` method. See examples in [Assigning defaults](#assigning-defaults). Option values:
+  - `false` (default) - do not use defaults
+  - `true` - insert defaults by value (object literal is used).
+  - `"empty"` - in addition to missing or undefined, use defaults for properties and items that are equal to `null` or `""` (an empty string).
+  - `"shared"` (deprecated) - insert defaults by reference. If the default is an object, it will be shared by all instances of validated data. If you modify the inserted default in the validated data, it will be modified in the schema as well.
+- _coerceTypes_: change data type of data to match `type` keyword. See the example in [Coercing data types](#coercing-data-types) and [coercion rules](https://github.com/ajv-validator/ajv/blob/master/COERCION.md). Option values:
+  - `false` (default) - no type coercion.
+  - `true` - coerce scalar data types.
+  - `"array"` - in addition to coercions between scalar types, coerce scalar data to an array with one element and vice versa (as required by the schema).
+
+
+##### Strict mode options
+
+- _strictDefaults_: report ignored `default` keywords in schemas. Option values:
+  - `false` (default) - ignored defaults are not reported
+  - `true` - if an ignored default is present, throw an error
+  - `"log"` - if an ignored default is present, log warning
+- _strictKeywords_: report unknown keywords in schemas. Option values:
+  - `false` (default) - unknown keywords are not reported
+  - `true` - if an unknown keyword is present, throw an error
+  - `"log"` - if an unknown keyword is present, log warning
+- _strictNumbers_: validate numbers strictly, failing validation for NaN and Infinity. Option values:
+  - `false` (default) - NaN or Infinity will pass validation for numeric types
+  - `true` - NaN or Infinity will not pass validation for numeric types
+
+##### Asynchronous validation options
+
+- _transpile_: Requires [ajv-async](https://github.com/ajv-validator/ajv-async) package. It determines whether Ajv transpiles compiled asynchronous validation function. Option values:
+  - `undefined` (default) - transpile with [nodent](https://github.com/MatAtBread/nodent) if async functions are not supported.
+  - `true` - always transpile with nodent.
+  - `false` - do not transpile; if async functions are not supported an exception will be thrown.
+
+
+##### Advanced options
+
+- _meta_: add [meta-schema](http://json-schema.org/documentation.html) so it can be used by other schemas (true by default). If an object is passed, it will be used as the default meta-schema for schemas that have no `$schema` keyword. This default meta-schema MUST have `$schema` keyword.
+- _validateSchema_: validate added/compiled schemas against meta-schema (true by default). `$schema` property in the schema can be http://json-schema.org/draft-07/schema or absent (draft-07 meta-schema will be used) or can be a reference to the schema previously added with `addMetaSchema` method. Option values:
+  - `true` (default) -  if the validation fails, throw the exception.
+  - `"log"` - if the validation fails, log error.
+  - `false` - skip schema validation.
+- _addUsedSchema_: by default methods `compile` and `validate` add schemas to the instance if they have `$id` (or `id`) property that doesn't start with "#". If `$id` is present and it is not unique the exception will be thrown. Set this option to `false` to skip adding schemas to the instance and the `$id` uniqueness check when these methods are used. This option does not affect `addSchema` method.
+- _inlineRefs_: Affects compilation of referenced schemas. Option values:
+  - `true` (default) - the referenced schemas that don't have refs in them are inlined, regardless of their size - that substantially improves performance at the cost of the bigger size of compiled schema functions.
+  - `false` - to not inline referenced schemas (they will be compiled as separate functions).
+  - integer number - to limit the maximum number of keywords of the schema that will be inlined.
+- _passContext_: pass validation context to custom keyword functions. If this option is `true` and you pass some context to the compiled validation function with `validate.call(context, data)`, the `context` will be available as `this` in your custom keywords. By default `this` is Ajv instance.
+- _loopRequired_: by default `required` keyword is compiled into a single expression (or a sequence of statements in `allErrors` mode). In case of a very large number of properties in this keyword it may result in a very big validation function. Pass integer to set the number of properties above which `required` keyword will be validated in a loop - smaller validation function size but also worse performance.
+- _ownProperties_: by default Ajv iterates over all enumerable object properties; when this option is `true` only own enumerable object properties (i.e. found directly on the object rather than on its prototype) are iterated. Contributed by @mbroadst.
+- _multipleOfPrecision_: by default `multipleOf` keyword is validated by comparing the result of division with parseInt() of that result. It works for dividers that are bigger than 1. For small dividers such as 0.01 the result of the division is usually not integer (even when it should be integer, see issue [#84](https://github.com/ajv-validator/ajv/issues/84)). If you need to use fractional dividers set this option to some positive integer N to have `multipleOf` validated using this formula: `Math.abs(Math.round(division) - division) < 1e-N` (it is slower but allows for float arithmetics deviations).
+- _errorDataPath_ (deprecated): set `dataPath` to point to 'object' (default) or to 'property' when validating keywords `required`, `additionalProperties` and `dependencies`.
+- _messages_: Include human-readable messages in errors. `true` by default. `false` can be passed when custom messages are used (e.g. with [ajv-i18n](https://github.com/ajv-validator/ajv-i18n)).
+- _sourceCode_: add `sourceCode` property to validating function (for debugging; this code can be different from the result of toString call).
+- _processCode_: an optional function to process generated code before it is passed to Function constructor. It can be used to either beautify (the validating function is generated without line-breaks) or to transpile code. Starting from version 5.0.0 this option replaced options:
+  - `beautify` that formatted the generated function using [js-beautify](https://github.com/beautify-web/js-beautify). If you want to beautify the generated code pass a function calling `require('js-beautify').js_beautify` as `processCode: code => js_beautify(code)`.
+  - `transpile` that transpiled asynchronous validation function. You can still use `transpile` option with [ajv-async](https://github.com/ajv-validator/ajv-async) package. See [Asynchronous validation](#asynchronous-validation) for more information.
+- _cache_: an optional instance of cache to store compiled schemas using stable-stringified schema as a key. For example, set-associative cache [sacjs](https://github.com/epoberezkin/sacjs) can be used. If not passed then a simple hash is used which is good enough for the common use case (a limited number of statically defined schemas). Cache should have methods `put(key, value)`, `get(key)`, `del(key)` and `clear()`.
+- _serialize_: an optional function to serialize schema to cache key. Pass `false` to use schema itself as a key (e.g., if WeakMap used as a cache). By default [fast-json-stable-stringify](https://github.com/epoberezkin/fast-json-stable-stringify) is used.
+
+
+## Validation errors
+
+In case of validation failure, Ajv assigns the array of errors to `errors` property of validation function (or to `errors` property of Ajv instance when `validate` or `validateSchema` methods were called). In case of [asynchronous validation](#asynchronous-validation), the returned promise is rejected with exception `Ajv.ValidationError` that has `errors` property.
+
+
+### Error objects
+
+Each error is an object with the following properties:
+
+- _keyword_: validation keyword.
+- _dataPath_: the path to the part of the data that was validated. By default `dataPath` uses JavaScript property access notation (e.g., `".prop[1].subProp"`). When the option `jsonPointers` is true (see [Options](#options)) `dataPath` will be set using JSON pointer standard (e.g., `"/prop/1/subProp"`).
+- _schemaPath_: the path (JSON-pointer as a URI fragment) to the schema of the keyword that failed validation.
+- _params_: the object with the additional information about error that can be used to create custom error messages (e.g., using [ajv-i18n](https://github.com/ajv-validator/ajv-i18n) package). See below for parameters set by all keywords.
+- _message_: the standard error message (can be excluded with option `messages` set to false).
+- _schema_: the schema of the keyword (added with `verbose` option).
+- _parentSchema_: the schema containing the keyword (added with `verbose` option)
+- _data_: the data validated by the keyword (added with `verbose` option).
+
+__Please note__: `propertyNames` keyword schema validation errors have an additional property `propertyName`, `dataPath` points to the object. After schema validation for each property name, if it is invalid an additional error is added with the property `keyword` equal to `"propertyNames"`.
+
+
+### Error parameters
+
+Properties of `params` object in errors depend on the keyword that failed validation.
+
+- `maxItems`, `minItems`, `maxLength`, `minLength`, `maxProperties`, `minProperties` - property `limit` (number, the schema of the keyword).
+- `additionalItems` - property `limit` (the maximum number of allowed items in case when `items` keyword is an array of schemas and `additionalItems` is false).
+- `additionalProperties` - property `additionalProperty` (the property not used in `properties` and `patternProperties` keywords).
+- `dependencies` - properties:
+  - `property` (dependent property),
+  - `missingProperty` (required missing dependency - only the first one is reported currently)
+  - `deps` (required dependencies, comma separated list as a string),
+  - `depsCount` (the number of required dependencies).
+- `format` - property `format` (the schema of the keyword).
+- `maximum`, `minimum` - properties:
+  - `limit` (number, the schema of the keyword),
+  - `exclusive` (boolean, the schema of `exclusiveMaximum` or `exclusiveMinimum`),
+  - `comparison` (string, comparison operation to compare the data to the limit, with the data on the left and the limit on the right; can be "<", "<=", ">", ">=")
+- `multipleOf` - property `multipleOf` (the schema of the keyword)
+- `pattern` - property `pattern` (the schema of the keyword)
+- `required` - property `missingProperty` (required property that is missing).
+- `propertyNames` - property `propertyName` (an invalid property name).
+- `patternRequired` (in ajv-keywords) - property `missingPattern` (required pattern that did not match any property).
+- `type` - property `type` (required type(s), a string, can be a comma-separated list)
+- `uniqueItems` - properties `i` and `j` (indices of duplicate items).
+- `const` - property `allowedValue` pointing to the value (the schema of the keyword).
+- `enum` - property `allowedValues` pointing to the array of values (the schema of the keyword).
+- `$ref` - property `ref` with the referenced schema URI.
+- `oneOf` - property `passingSchemas` (array of indices of passing schemas, null if no schema passes).
+- custom keywords (in case keyword definition doesn't create errors) - property `keyword` (the keyword name).
+
+
+### Error logging
+
+Using the `logger` option when initiallizing Ajv will allow you to define custom logging. Here you can build upon the exisiting logging. The use of other logging packages is supported as long as the package or its associated wrapper exposes the required methods. If any of the required methods are missing an exception will be thrown.
+- **Required Methods**: `log`, `warn`, `error`
+
+```javascript
+var otherLogger = new OtherLogger();
+var ajv = new Ajv({
+  logger: {
+    log: console.log.bind(console),
+    warn: function warn() {
+      otherLogger.logWarn.apply(otherLogger, arguments);
+    },
+    error: function error() {
+      otherLogger.logError.apply(otherLogger, arguments);
+      console.error.apply(console, arguments);
+    }
+  }
+});
+```
+
+
+## Plugins
+
+Ajv can be extended with plugins that add custom keywords, formats or functions to process generated code. When such plugin is published as npm package it is recommended that it follows these conventions:
+
+- it exports a function
+- this function accepts ajv instance as the first parameter and returns the same instance to allow chaining
+- this function can accept an optional configuration as the second parameter
+
+If you have published a useful plugin please submit a PR to add it to the next section.
+
+
+## Related packages
+
+- [ajv-async](https://github.com/ajv-validator/ajv-async) - plugin to configure async validation mode
+- [ajv-bsontype](https://github.com/BoLaMN/ajv-bsontype) - plugin to validate mongodb's bsonType formats
+- [ajv-cli](https://github.com/jessedc/ajv-cli) - command line interface
+- [ajv-errors](https://github.com/ajv-validator/ajv-errors) - plugin for custom error messages
+- [ajv-i18n](https://github.com/ajv-validator/ajv-i18n) - internationalised error messages
+- [ajv-istanbul](https://github.com/ajv-validator/ajv-istanbul) - plugin to instrument generated validation code to measure test coverage of your schemas
+- [ajv-keywords](https://github.com/ajv-validator/ajv-keywords) - plugin with custom validation keywords (select, typeof, etc.)
+- [ajv-merge-patch](https://github.com/ajv-validator/ajv-merge-patch) - plugin with keywords $merge and $patch
+- [ajv-pack](https://github.com/ajv-validator/ajv-pack) - produces a compact module exporting validation functions
+- [ajv-formats-draft2019](https://github.com/luzlab/ajv-formats-draft2019) - format validators for draft2019 that aren't already included in ajv (ie. `idn-hostname`, `idn-email`, `iri`, `iri-reference` and `duration`).
+
+## Some packages using Ajv
+
+- [webpack](https://github.com/webpack/webpack) - a module bundler. Its main purpose is to bundle JavaScript files for usage in a browser
+- [jsonscript-js](https://github.com/JSONScript/jsonscript-js) - the interpreter for [JSONScript](http://www.jsonscript.org) - scripted processing of existing endpoints and services
+- [osprey-method-handler](https://github.com/mulesoft-labs/osprey-method-handler) - Express middleware for validating requests and responses based on a RAML method object, used in [osprey](https://github.com/mulesoft/osprey) - validating API proxy generated from a RAML definition
+- [har-validator](https://github.com/ahmadnassri/har-validator) - HTTP Archive (HAR) validator
+- [jsoneditor](https://github.com/josdejong/jsoneditor) - a web-based tool to view, edit, format, and validate JSON http://jsoneditoronline.org
+- [JSON Schema Lint](https://github.com/nickcmaynard/jsonschemalint) - a web tool to validate JSON/YAML document against a single JSON Schema http://jsonschemalint.com
+- [objection](https://github.com/vincit/objection.js) - SQL-friendly ORM for Node.js
+- [table](https://github.com/gajus/table) - formats data into a string table
+- [ripple-lib](https://github.com/ripple/ripple-lib) - a JavaScript API for interacting with [Ripple](https://ripple.com) in Node.js and the browser
+- [restbase](https://github.com/wikimedia/restbase) - distributed storage with REST API & dispatcher for backend services built to provide a low-latency & high-throughput API for Wikipedia / Wikimedia content
+- [hippie-swagger](https://github.com/CacheControl/hippie-swagger) - [Hippie](https://github.com/vesln/hippie) wrapper that provides end to end API testing with swagger validation
+- [react-form-controlled](https://github.com/seeden/react-form-controlled) - React controlled form components with validation
+- [rabbitmq-schema](https://github.com/tjmehta/rabbitmq-schema) - a schema definition module for RabbitMQ graphs and messages
+- [@query/schema](https://www.npmjs.com/package/@query/schema) - stream filtering with a URI-safe query syntax parsing to JSON Schema
+- [chai-ajv-json-schema](https://github.com/peon374/chai-ajv-json-schema) - chai plugin to us JSON Schema with expect in mocha tests
+- [grunt-jsonschema-ajv](https://github.com/SignpostMarv/grunt-jsonschema-ajv) - Grunt plugin for validating files against JSON Schema
+- [extract-text-webpack-plugin](https://github.com/webpack-contrib/extract-text-webpack-plugin) - extract text from bundle into a file
+- [electron-builder](https://github.com/electron-userland/electron-builder) - a solution to package and build a ready for distribution Electron app
+- [addons-linter](https://github.com/mozilla/addons-linter) - Mozilla Add-ons Linter
+- [gh-pages-generator](https://github.com/epoberezkin/gh-pages-generator) - multi-page site generator converting markdown files to GitHub pages
+- [ESLint](https://github.com/eslint/eslint) - the pluggable linting utility for JavaScript and JSX
+
+
+## Tests
+
+```
+npm install
+git submodule update --init
+npm test
+```
+
+## Contributing
+
+All validation functions are generated using doT templates in [dot](https://github.com/ajv-validator/ajv/tree/master/lib/dot) folder. Templates are precompiled so doT is not a run-time dependency.
+
+`npm run build` - compiles templates to [dotjs](https://github.com/ajv-validator/ajv/tree/master/lib/dotjs) folder.
+
+`npm run watch` - automatically compiles templates when files in dot folder change
+
+Please see [Contributing guidelines](https://github.com/ajv-validator/ajv/blob/master/CONTRIBUTING.md)
+
+
+## Changes history
+
+See https://github.com/ajv-validator/ajv/releases
+
+__Please note__: [Changes in version 7.0.0-beta](https://github.com/ajv-validator/ajv/releases/tag/v7.0.0-beta.0)
+
+[Version 6.0.0](https://github.com/ajv-validator/ajv/releases/tag/v6.0.0).
+
+## Code of conduct
+
+Please review and follow the [Code of conduct](https://github.com/ajv-validator/ajv/blob/master/CODE_OF_CONDUCT.md).
+
+Please report any unacceptable behaviour to ajv.validator@gmail.com - it will be reviewed by the project team.
+
+
+## Open-source software support
+
+Ajv is a part of [Tidelift subscription](https://tidelift.com/subscription/pkg/npm-ajv?utm_source=npm-ajv&utm_medium=referral&utm_campaign=readme) - it provides a centralised support to open-source software users, in addition to the support provided by software maintainers.
+
+
+## License
+
+[MIT](https://github.com/ajv-validator/ajv/blob/master/LICENSE)
diff --git a/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.bundle.js b/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.bundle.js
new file mode 100644
index 0000000..e4d9d15
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.bundle.js
@@ -0,0 +1,7189 @@
+(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.Ajv = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
+'use strict';
+
+
+var Cache = module.exports = function Cache() {
+  this._cache = {};
+};
+
+
+Cache.prototype.put = function Cache_put(key, value) {
+  this._cache[key] = value;
+};
+
+
+Cache.prototype.get = function Cache_get(key) {
+  return this._cache[key];
+};
+
+
+Cache.prototype.del = function Cache_del(key) {
+  delete this._cache[key];
+};
+
+
+Cache.prototype.clear = function Cache_clear() {
+  this._cache = {};
+};
+
+},{}],2:[function(require,module,exports){
+'use strict';
+
+var MissingRefError = require('./error_classes').MissingRef;
+
+module.exports = compileAsync;
+
+
+/**
+ * Creates validating function for passed schema with asynchronous loading of missing schemas.
+ * `loadSchema` option should be a function that accepts schema uri and returns promise that resolves with the schema.
+ * @this  Ajv
+ * @param {Object}   schema schema object
+ * @param {Boolean}  meta optional true to compile meta-schema; this parameter can be skipped
+ * @param {Function} callback an optional node-style callback, it is called with 2 parameters: error (or null) and validating function.
+ * @return {Promise} promise that resolves with a validating function.
+ */
+function compileAsync(schema, meta, callback) {
+  /* eslint no-shadow: 0 */
+  /* global Promise */
+  /* jshint validthis: true */
+  var self = this;
+  if (typeof this._opts.loadSchema != 'function')
+    throw new Error('options.loadSchema should be a function');
+
+  if (typeof meta == 'function') {
+    callback = meta;
+    meta = undefined;
+  }
+
+  var p = loadMetaSchemaOf(schema).then(function () {
+    var schemaObj = self._addSchema(schema, undefined, meta);
+    return schemaObj.validate || _compileAsync(schemaObj);
+  });
+
+  if (callback) {
+    p.then(
+      function(v) { callback(null, v); },
+      callback
+    );
+  }
+
+  return p;
+
+
+  function loadMetaSchemaOf(sch) {
+    var $schema = sch.$schema;
+    return $schema && !self.getSchema($schema)
+            ? compileAsync.call(self, { $ref: $schema }, true)
+            : Promise.resolve();
+  }
+
+
+  function _compileAsync(schemaObj) {
+    try { return self._compile(schemaObj); }
+    catch(e) {
+      if (e instanceof MissingRefError) return loadMissingSchema(e);
+      throw e;
+    }
+
+
+    function loadMissingSchema(e) {
+      var ref = e.missingSchema;
+      if (added(ref)) throw new Error('Schema ' + ref + ' is loaded but ' + e.missingRef + ' cannot be resolved');
+
+      var schemaPromise = self._loadingSchemas[ref];
+      if (!schemaPromise) {
+        schemaPromise = self._loadingSchemas[ref] = self._opts.loadSchema(ref);
+        schemaPromise.then(removePromise, removePromise);
+      }
+
+      return schemaPromise.then(function (sch) {
+        if (!added(ref)) {
+          return loadMetaSchemaOf(sch).then(function () {
+            if (!added(ref)) self.addSchema(sch, ref, undefined, meta);
+          });
+        }
+      }).then(function() {
+        return _compileAsync(schemaObj);
+      });
+
+      function removePromise() {
+        delete self._loadingSchemas[ref];
+      }
+
+      function added(ref) {
+        return self._refs[ref] || self._schemas[ref];
+      }
+    }
+  }
+}
+
+},{"./error_classes":3}],3:[function(require,module,exports){
+'use strict';
+
+var resolve = require('./resolve');
+
+module.exports = {
+  Validation: errorSubclass(ValidationError),
+  MissingRef: errorSubclass(MissingRefError)
+};
+
+
+function ValidationError(errors) {
+  this.message = 'validation failed';
+  this.errors = errors;
+  this.ajv = this.validation = true;
+}
+
+
+MissingRefError.message = function (baseId, ref) {
+  return 'can\'t resolve reference ' + ref + ' from id ' + baseId;
+};
+
+
+function MissingRefError(baseId, ref, message) {
+  this.message = message || MissingRefError.message(baseId, ref);
+  this.missingRef = resolve.url(baseId, ref);
+  this.missingSchema = resolve.normalizeId(resolve.fullPath(this.missingRef));
+}
+
+
+function errorSubclass(Subclass) {
+  Subclass.prototype = Object.create(Error.prototype);
+  Subclass.prototype.constructor = Subclass;
+  return Subclass;
+}
+
+},{"./resolve":6}],4:[function(require,module,exports){
+'use strict';
+
+var util = require('./util');
+
+var DATE = /^(\d\d\d\d)-(\d\d)-(\d\d)$/;
+var DAYS = [0,31,28,31,30,31,30,31,31,30,31,30,31];
+var TIME = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i;
+var HOSTNAME = /^(?=.{1,253}\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\.?$/i;
+var URI = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
+var URIREF = /^(?:[a-z][a-z0-9+\-.]*:)?(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'"()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\?(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
+// uri-template: https://tools.ietf.org/html/rfc6570
+var URITEMPLATE = /^(?:(?:[^\x00-\x20"'<>%\\^`{|}]|%[0-9a-f]{2})|\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?)*\})*$/i;
+// For the source: https://gist.github.com/dperini/729294
+// For test cases: https://mathiasbynens.be/demo/url-regex
+// @todo Delete current URL in favour of the commented out URL rule when this issue is fixed https://github.com/eslint/eslint/issues/7983.
+// var URL = /^(?:(?:https?|ftp):\/\/)(?:\S+(?::\S*)?@)?(?:(?!10(?:\.\d{1,3}){3})(?!127(?:\.\d{1,3}){3})(?!169\.254(?:\.\d{1,3}){2})(?!192\.168(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\u{00a1}-\u{ffff}0-9]+-)*[a-z\u{00a1}-\u{ffff}0-9]+)(?:\.(?:[a-z\u{00a1}-\u{ffff}0-9]+-)*[a-z\u{00a1}-\u{ffff}0-9]+)*(?:\.(?:[a-z\u{00a1}-\u{ffff}]{2,})))(?::\d{2,5})?(?:\/[^\s]*)?$/iu;
+var URL = /^(?:(?:http[s\u017F]?|ftp):\/\/)(?:(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+(?::(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])*)?@)?(?:(?!10(?:\.[0-9]{1,3}){3})(?!127(?:\.[0-9]{1,3}){3})(?!169\.254(?:\.[0-9]{1,3}){2})(?!192\.168(?:\.[0-9]{1,3}){2})(?!172\.(?:1[6-9]|2[0-9]|3[01])(?:\.[0-9]{1,3}){2})(?:[1-9][0-9]?|1[0-9][0-9]|2[01][0-9]|22[0-3])(?:\.(?:1?[0-9]{1,2}|2[0-4][0-9]|25[0-5])){2}(?:\.(?:[1-9][0-9]?|1[0-9][0-9]|2[0-4][0-9]|25[0-4]))|(?:(?:(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+-)*(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+)(?:\.(?:(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+-)*(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+)*(?:\.(?:(?:[a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]){2,})))(?::[0-9]{2,5})?(?:\/(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])*)?$/i;
+var UUID = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i;
+var JSON_POINTER = /^(?:\/(?:[^~/]|~0|~1)*)*$/;
+var JSON_POINTER_URI_FRAGMENT = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i;
+var RELATIVE_JSON_POINTER = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/;
+
+
+module.exports = formats;
+
+function formats(mode) {
+  mode = mode == 'full' ? 'full' : 'fast';
+  return util.copy(formats[mode]);
+}
+
+
+formats.fast = {
+  // date: http://tools.ietf.org/html/rfc3339#section-5.6
+  date: /^\d\d\d\d-[0-1]\d-[0-3]\d$/,
+  // date-time: http://tools.ietf.org/html/rfc3339#section-5.6
+  time: /^(?:[0-2]\d:[0-5]\d:[0-5]\d|23:59:60)(?:\.\d+)?(?:z|[+-]\d\d(?::?\d\d)?)?$/i,
+  'date-time': /^\d\d\d\d-[0-1]\d-[0-3]\d[t\s](?:[0-2]\d:[0-5]\d:[0-5]\d|23:59:60)(?:\.\d+)?(?:z|[+-]\d\d(?::?\d\d)?)$/i,
+  // uri: https://github.com/mafintosh/is-my-json-valid/blob/master/formats.js
+  uri: /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/)?[^\s]*$/i,
+  'uri-reference': /^(?:(?:[a-z][a-z0-9+\-.]*:)?\/?\/)?(?:[^\\\s#][^\s#]*)?(?:#[^\\\s]*)?$/i,
+  'uri-template': URITEMPLATE,
+  url: URL,
+  // email (sources from jsen validator):
+  // http://stackoverflow.com/questions/201323/using-a-regular-expression-to-validate-an-email-address#answer-8829363
+  // http://www.w3.org/TR/html5/forms.html#valid-e-mail-address (search for 'willful violation')
+  email: /^[a-z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?)*$/i,
+  hostname: HOSTNAME,
+  // optimized https://www.safaribooksonline.com/library/view/regular-expressions-cookbook/9780596802837/ch07s16.html
+  ipv4: /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/,
+  // optimized http://stackoverflow.com/questions/53497/regular-expression-that-matches-valid-ipv6-addresses
+  ipv6: /^\s*(?:(?:(?:[0-9a-f]{1,4}:){7}(?:[0-9a-f]{1,4}|:))|(?:(?:[0-9a-f]{1,4}:){6}(?::[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){5}(?:(?:(?::[0-9a-f]{1,4}){1,2})|:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){4}(?:(?:(?::[0-9a-f]{1,4}){1,3})|(?:(?::[0-9a-f]{1,4})?:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){3}(?:(?:(?::[0-9a-f]{1,4}){1,4})|(?:(?::[0-9a-f]{1,4}){0,2}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){2}(?:(?:(?::[0-9a-f]{1,4}){1,5})|(?:(?::[0-9a-f]{1,4}){0,3}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){1}(?:(?:(?::[0-9a-f]{1,4}){1,6})|(?:(?::[0-9a-f]{1,4}){0,4}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?::(?:(?:(?::[0-9a-f]{1,4}){1,7})|(?:(?::[0-9a-f]{1,4}){0,5}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))(?:%.+)?\s*$/i,
+  regex: regex,
+  // uuid: http://tools.ietf.org/html/rfc4122
+  uuid: UUID,
+  // JSON-pointer: https://tools.ietf.org/html/rfc6901
+  // uri fragment: https://tools.ietf.org/html/rfc3986#appendix-A
+  'json-pointer': JSON_POINTER,
+  'json-pointer-uri-fragment': JSON_POINTER_URI_FRAGMENT,
+  // relative JSON-pointer: http://tools.ietf.org/html/draft-luff-relative-json-pointer-00
+  'relative-json-pointer': RELATIVE_JSON_POINTER
+};
+
+
+formats.full = {
+  date: date,
+  time: time,
+  'date-time': date_time,
+  uri: uri,
+  'uri-reference': URIREF,
+  'uri-template': URITEMPLATE,
+  url: URL,
+  email: /^[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*@(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?$/i,
+  hostname: HOSTNAME,
+  ipv4: /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/,
+  ipv6: /^\s*(?:(?:(?:[0-9a-f]{1,4}:){7}(?:[0-9a-f]{1,4}|:))|(?:(?:[0-9a-f]{1,4}:){6}(?::[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){5}(?:(?:(?::[0-9a-f]{1,4}){1,2})|:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){4}(?:(?:(?::[0-9a-f]{1,4}){1,3})|(?:(?::[0-9a-f]{1,4})?:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){3}(?:(?:(?::[0-9a-f]{1,4}){1,4})|(?:(?::[0-9a-f]{1,4}){0,2}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){2}(?:(?:(?::[0-9a-f]{1,4}){1,5})|(?:(?::[0-9a-f]{1,4}){0,3}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){1}(?:(?:(?::[0-9a-f]{1,4}){1,6})|(?:(?::[0-9a-f]{1,4}){0,4}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?::(?:(?:(?::[0-9a-f]{1,4}){1,7})|(?:(?::[0-9a-f]{1,4}){0,5}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))(?:%.+)?\s*$/i,
+  regex: regex,
+  uuid: UUID,
+  'json-pointer': JSON_POINTER,
+  'json-pointer-uri-fragment': JSON_POINTER_URI_FRAGMENT,
+  'relative-json-pointer': RELATIVE_JSON_POINTER
+};
+
+
+function isLeapYear(year) {
+  // https://tools.ietf.org/html/rfc3339#appendix-C
+  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+}
+
+
+function date(str) {
+  // full-date from http://tools.ietf.org/html/rfc3339#section-5.6
+  var matches = str.match(DATE);
+  if (!matches) return false;
+
+  var year = +matches[1];
+  var month = +matches[2];
+  var day = +matches[3];
+
+  return month >= 1 && month <= 12 && day >= 1 &&
+          day <= (month == 2 && isLeapYear(year) ? 29 : DAYS[month]);
+}
+
+
+function time(str, full) {
+  var matches = str.match(TIME);
+  if (!matches) return false;
+
+  var hour = matches[1];
+  var minute = matches[2];
+  var second = matches[3];
+  var timeZone = matches[5];
+  return ((hour <= 23 && minute <= 59 && second <= 59) ||
+          (hour == 23 && minute == 59 && second == 60)) &&
+         (!full || timeZone);
+}
+
+
+var DATE_TIME_SEPARATOR = /t|\s/i;
+function date_time(str) {
+  // http://tools.ietf.org/html/rfc3339#section-5.6
+  var dateTime = str.split(DATE_TIME_SEPARATOR);
+  return dateTime.length == 2 && date(dateTime[0]) && time(dateTime[1], true);
+}
+
+
+var NOT_URI_FRAGMENT = /\/|:/;
+function uri(str) {
+  // http://jmrware.com/articles/2009/uri_regexp/URI_regex.html + optional protocol + required "."
+  return NOT_URI_FRAGMENT.test(str) && URI.test(str);
+}
+
+
+var Z_ANCHOR = /[^\\]\\Z/;
+function regex(str) {
+  if (Z_ANCHOR.test(str)) return false;
+  try {
+    new RegExp(str);
+    return true;
+  } catch(e) {
+    return false;
+  }
+}
+
+},{"./util":10}],5:[function(require,module,exports){
+'use strict';
+
+var resolve = require('./resolve')
+  , util = require('./util')
+  , errorClasses = require('./error_classes')
+  , stableStringify = require('fast-json-stable-stringify');
+
+var validateGenerator = require('../dotjs/validate');
+
+/**
+ * Functions below are used inside compiled validations function
+ */
+
+var ucs2length = util.ucs2length;
+var equal = require('fast-deep-equal');
+
+// this error is thrown by async schemas to return validation errors via exception
+var ValidationError = errorClasses.Validation;
+
+module.exports = compile;
+
+
+/**
+ * Compiles schema to validation function
+ * @this   Ajv
+ * @param  {Object} schema schema object
+ * @param  {Object} root object with information about the root schema for this schema
+ * @param  {Object} localRefs the hash of local references inside the schema (created by resolve.id), used for inline resolution
+ * @param  {String} baseId base ID for IDs in the schema
+ * @return {Function} validation function
+ */
+function compile(schema, root, localRefs, baseId) {
+  /* jshint validthis: true, evil: true */
+  /* eslint no-shadow: 0 */
+  var self = this
+    , opts = this._opts
+    , refVal = [ undefined ]
+    , refs = {}
+    , patterns = []
+    , patternsHash = {}
+    , defaults = []
+    , defaultsHash = {}
+    , customRules = [];
+
+  root = root || { schema: schema, refVal: refVal, refs: refs };
+
+  var c = checkCompiling.call(this, schema, root, baseId);
+  var compilation = this._compilations[c.index];
+  if (c.compiling) return (compilation.callValidate = callValidate);
+
+  var formats = this._formats;
+  var RULES = this.RULES;
+
+  try {
+    var v = localCompile(schema, root, localRefs, baseId);
+    compilation.validate = v;
+    var cv = compilation.callValidate;
+    if (cv) {
+      cv.schema = v.schema;
+      cv.errors = null;
+      cv.refs = v.refs;
+      cv.refVal = v.refVal;
+      cv.root = v.root;
+      cv.$async = v.$async;
+      if (opts.sourceCode) cv.source = v.source;
+    }
+    return v;
+  } finally {
+    endCompiling.call(this, schema, root, baseId);
+  }
+
+  /* @this   {*} - custom context, see passContext option */
+  function callValidate() {
+    /* jshint validthis: true */
+    var validate = compilation.validate;
+    var result = validate.apply(this, arguments);
+    callValidate.errors = validate.errors;
+    return result;
+  }
+
+  function localCompile(_schema, _root, localRefs, baseId) {
+    var isRoot = !_root || (_root && _root.schema == _schema);
+    if (_root.schema != root.schema)
+      return compile.call(self, _schema, _root, localRefs, baseId);
+
+    var $async = _schema.$async === true;
+
+    var sourceCode = validateGenerator({
+      isTop: true,
+      schema: _schema,
+      isRoot: isRoot,
+      baseId: baseId,
+      root: _root,
+      schemaPath: '',
+      errSchemaPath: '#',
+      errorPath: '""',
+      MissingRefError: errorClasses.MissingRef,
+      RULES: RULES,
+      validate: validateGenerator,
+      util: util,
+      resolve: resolve,
+      resolveRef: resolveRef,
+      usePattern: usePattern,
+      useDefault: useDefault,
+      useCustomRule: useCustomRule,
+      opts: opts,
+      formats: formats,
+      logger: self.logger,
+      self: self
+    });
+
+    sourceCode = vars(refVal, refValCode) + vars(patterns, patternCode)
+                   + vars(defaults, defaultCode) + vars(customRules, customRuleCode)
+                   + sourceCode;
+
+    if (opts.processCode) sourceCode = opts.processCode(sourceCode, _schema);
+    // console.log('\n\n\n *** \n', JSON.stringify(sourceCode));
+    var validate;
+    try {
+      var makeValidate = new Function(
+        'self',
+        'RULES',
+        'formats',
+        'root',
+        'refVal',
+        'defaults',
+        'customRules',
+        'equal',
+        'ucs2length',
+        'ValidationError',
+        sourceCode
+      );
+
+      validate = makeValidate(
+        self,
+        RULES,
+        formats,
+        root,
+        refVal,
+        defaults,
+        customRules,
+        equal,
+        ucs2length,
+        ValidationError
+      );
+
+      refVal[0] = validate;
+    } catch(e) {
+      self.logger.error('Error compiling schema, function code:', sourceCode);
+      throw e;
+    }
+
+    validate.schema = _schema;
+    validate.errors = null;
+    validate.refs = refs;
+    validate.refVal = refVal;
+    validate.root = isRoot ? validate : _root;
+    if ($async) validate.$async = true;
+    if (opts.sourceCode === true) {
+      validate.source = {
+        code: sourceCode,
+        patterns: patterns,
+        defaults: defaults
+      };
+    }
+
+    return validate;
+  }
+
+  function resolveRef(baseId, ref, isRoot) {
+    ref = resolve.url(baseId, ref);
+    var refIndex = refs[ref];
+    var _refVal, refCode;
+    if (refIndex !== undefined) {
+      _refVal = refVal[refIndex];
+      refCode = 'refVal[' + refIndex + ']';
+      return resolvedRef(_refVal, refCode);
+    }
+    if (!isRoot && root.refs) {
+      var rootRefId = root.refs[ref];
+      if (rootRefId !== undefined) {
+        _refVal = root.refVal[rootRefId];
+        refCode = addLocalRef(ref, _refVal);
+        return resolvedRef(_refVal, refCode);
+      }
+    }
+
+    refCode = addLocalRef(ref);
+    var v = resolve.call(self, localCompile, root, ref);
+    if (v === undefined) {
+      var localSchema = localRefs && localRefs[ref];
+      if (localSchema) {
+        v = resolve.inlineRef(localSchema, opts.inlineRefs)
+            ? localSchema
+            : compile.call(self, localSchema, root, localRefs, baseId);
+      }
+    }
+
+    if (v === undefined) {
+      removeLocalRef(ref);
+    } else {
+      replaceLocalRef(ref, v);
+      return resolvedRef(v, refCode);
+    }
+  }
+
+  function addLocalRef(ref, v) {
+    var refId = refVal.length;
+    refVal[refId] = v;
+    refs[ref] = refId;
+    return 'refVal' + refId;
+  }
+
+  function removeLocalRef(ref) {
+    delete refs[ref];
+  }
+
+  function replaceLocalRef(ref, v) {
+    var refId = refs[ref];
+    refVal[refId] = v;
+  }
+
+  function resolvedRef(refVal, code) {
+    return typeof refVal == 'object' || typeof refVal == 'boolean'
+            ? { code: code, schema: refVal, inline: true }
+            : { code: code, $async: refVal && !!refVal.$async };
+  }
+
+  function usePattern(regexStr) {
+    var index = patternsHash[regexStr];
+    if (index === undefined) {
+      index = patternsHash[regexStr] = patterns.length;
+      patterns[index] = regexStr;
+    }
+    return 'pattern' + index;
+  }
+
+  function useDefault(value) {
+    switch (typeof value) {
+      case 'boolean':
+      case 'number':
+        return '' + value;
+      case 'string':
+        return util.toQuotedString(value);
+      case 'object':
+        if (value === null) return 'null';
+        var valueStr = stableStringify(value);
+        var index = defaultsHash[valueStr];
+        if (index === undefined) {
+          index = defaultsHash[valueStr] = defaults.length;
+          defaults[index] = value;
+        }
+        return 'default' + index;
+    }
+  }
+
+  function useCustomRule(rule, schema, parentSchema, it) {
+    if (self._opts.validateSchema !== false) {
+      var deps = rule.definition.dependencies;
+      if (deps && !deps.every(function(keyword) {
+        return Object.prototype.hasOwnProperty.call(parentSchema, keyword);
+      }))
+        throw new Error('parent schema must have all required keywords: ' + deps.join(','));
+
+      var validateSchema = rule.definition.validateSchema;
+      if (validateSchema) {
+        var valid = validateSchema(schema);
+        if (!valid) {
+          var message = 'keyword schema is invalid: ' + self.errorsText(validateSchema.errors);
+          if (self._opts.validateSchema == 'log') self.logger.error(message);
+          else throw new Error(message);
+        }
+      }
+    }
+
+    var compile = rule.definition.compile
+      , inline = rule.definition.inline
+      , macro = rule.definition.macro;
+
+    var validate;
+    if (compile) {
+      validate = compile.call(self, schema, parentSchema, it);
+    } else if (macro) {
+      validate = macro.call(self, schema, parentSchema, it);
+      if (opts.validateSchema !== false) self.validateSchema(validate, true);
+    } else if (inline) {
+      validate = inline.call(self, it, rule.keyword, schema, parentSchema);
+    } else {
+      validate = rule.definition.validate;
+      if (!validate) return;
+    }
+
+    if (validate === undefined)
+      throw new Error('custom keyword "' + rule.keyword + '"failed to compile');
+
+    var index = customRules.length;
+    customRules[index] = validate;
+
+    return {
+      code: 'customRule' + index,
+      validate: validate
+    };
+  }
+}
+
+
+/**
+ * Checks if the schema is currently compiled
+ * @this   Ajv
+ * @param  {Object} schema schema to compile
+ * @param  {Object} root root object
+ * @param  {String} baseId base schema ID
+ * @return {Object} object with properties "index" (compilation index) and "compiling" (boolean)
+ */
+function checkCompiling(schema, root, baseId) {
+  /* jshint validthis: true */
+  var index = compIndex.call(this, schema, root, baseId);
+  if (index >= 0) return { index: index, compiling: true };
+  index = this._compilations.length;
+  this._compilations[index] = {
+    schema: schema,
+    root: root,
+    baseId: baseId
+  };
+  return { index: index, compiling: false };
+}
+
+
+/**
+ * Removes the schema from the currently compiled list
+ * @this   Ajv
+ * @param  {Object} schema schema to compile
+ * @param  {Object} root root object
+ * @param  {String} baseId base schema ID
+ */
+function endCompiling(schema, root, baseId) {
+  /* jshint validthis: true */
+  var i = compIndex.call(this, schema, root, baseId);
+  if (i >= 0) this._compilations.splice(i, 1);
+}
+
+
+/**
+ * Index of schema compilation in the currently compiled list
+ * @this   Ajv
+ * @param  {Object} schema schema to compile
+ * @param  {Object} root root object
+ * @param  {String} baseId base schema ID
+ * @return {Integer} compilation index
+ */
+function compIndex(schema, root, baseId) {
+  /* jshint validthis: true */
+  for (var i=0; i<this._compilations.length; i++) {
+    var c = this._compilations[i];
+    if (c.schema == schema && c.root == root && c.baseId == baseId) return i;
+  }
+  return -1;
+}
+
+
+function patternCode(i, patterns) {
+  return 'var pattern' + i + ' = new RegExp(' + util.toQuotedString(patterns[i]) + ');';
+}
+
+
+function defaultCode(i) {
+  return 'var default' + i + ' = defaults[' + i + '];';
+}
+
+
+function refValCode(i, refVal) {
+  return refVal[i] === undefined ? '' : 'var refVal' + i + ' = refVal[' + i + '];';
+}
+
+
+function customRuleCode(i) {
+  return 'var customRule' + i + ' = customRules[' + i + '];';
+}
+
+
+function vars(arr, statement) {
+  if (!arr.length) return '';
+  var code = '';
+  for (var i=0; i<arr.length; i++)
+    code += statement(i, arr);
+  return code;
+}
+
+},{"../dotjs/validate":38,"./error_classes":3,"./resolve":6,"./util":10,"fast-deep-equal":42,"fast-json-stable-stringify":43}],6:[function(require,module,exports){
+'use strict';
+
+var URI = require('uri-js')
+  , equal = require('fast-deep-equal')
+  , util = require('./util')
+  , SchemaObject = require('./schema_obj')
+  , traverse = require('json-schema-traverse');
+
+module.exports = resolve;
+
+resolve.normalizeId = normalizeId;
+resolve.fullPath = getFullPath;
+resolve.url = resolveUrl;
+resolve.ids = resolveIds;
+resolve.inlineRef = inlineRef;
+resolve.schema = resolveSchema;
+
+/**
+ * [resolve and compile the references ($ref)]
+ * @this   Ajv
+ * @param  {Function} compile reference to schema compilation funciton (localCompile)
+ * @param  {Object} root object with information about the root schema for the current schema
+ * @param  {String} ref reference to resolve
+ * @return {Object|Function} schema object (if the schema can be inlined) or validation function
+ */
+function resolve(compile, root, ref) {
+  /* jshint validthis: true */
+  var refVal = this._refs[ref];
+  if (typeof refVal == 'string') {
+    if (this._refs[refVal]) refVal = this._refs[refVal];
+    else return resolve.call(this, compile, root, refVal);
+  }
+
+  refVal = refVal || this._schemas[ref];
+  if (refVal instanceof SchemaObject) {
+    return inlineRef(refVal.schema, this._opts.inlineRefs)
+            ? refVal.schema
+            : refVal.validate || this._compile(refVal);
+  }
+
+  var res = resolveSchema.call(this, root, ref);
+  var schema, v, baseId;
+  if (res) {
+    schema = res.schema;
+    root = res.root;
+    baseId = res.baseId;
+  }
+
+  if (schema instanceof SchemaObject) {
+    v = schema.validate || compile.call(this, schema.schema, root, undefined, baseId);
+  } else if (schema !== undefined) {
+    v = inlineRef(schema, this._opts.inlineRefs)
+        ? schema
+        : compile.call(this, schema, root, undefined, baseId);
+  }
+
+  return v;
+}
+
+
+/**
+ * Resolve schema, its root and baseId
+ * @this Ajv
+ * @param  {Object} root root object with properties schema, refVal, refs
+ * @param  {String} ref  reference to resolve
+ * @return {Object} object with properties schema, root, baseId
+ */
+function resolveSchema(root, ref) {
+  /* jshint validthis: true */
+  var p = URI.parse(ref)
+    , refPath = _getFullPath(p)
+    , baseId = getFullPath(this._getId(root.schema));
+  if (Object.keys(root.schema).length === 0 || refPath !== baseId) {
+    var id = normalizeId(refPath);
+    var refVal = this._refs[id];
+    if (typeof refVal == 'string') {
+      return resolveRecursive.call(this, root, refVal, p);
+    } else if (refVal instanceof SchemaObject) {
+      if (!refVal.validate) this._compile(refVal);
+      root = refVal;
+    } else {
+      refVal = this._schemas[id];
+      if (refVal instanceof SchemaObject) {
+        if (!refVal.validate) this._compile(refVal);
+        if (id == normalizeId(ref))
+          return { schema: refVal, root: root, baseId: baseId };
+        root = refVal;
+      } else {
+        return;
+      }
+    }
+    if (!root.schema) return;
+    baseId = getFullPath(this._getId(root.schema));
+  }
+  return getJsonPointer.call(this, p, baseId, root.schema, root);
+}
+
+
+/* @this Ajv */
+function resolveRecursive(root, ref, parsedRef) {
+  /* jshint validthis: true */
+  var res = resolveSchema.call(this, root, ref);
+  if (res) {
+    var schema = res.schema;
+    var baseId = res.baseId;
+    root = res.root;
+    var id = this._getId(schema);
+    if (id) baseId = resolveUrl(baseId, id);
+    return getJsonPointer.call(this, parsedRef, baseId, schema, root);
+  }
+}
+
+
+var PREVENT_SCOPE_CHANGE = util.toHash(['properties', 'patternProperties', 'enum', 'dependencies', 'definitions']);
+/* @this Ajv */
+function getJsonPointer(parsedRef, baseId, schema, root) {
+  /* jshint validthis: true */
+  parsedRef.fragment = parsedRef.fragment || '';
+  if (parsedRef.fragment.slice(0,1) != '/') return;
+  var parts = parsedRef.fragment.split('/');
+
+  for (var i = 1; i < parts.length; i++) {
+    var part = parts[i];
+    if (part) {
+      part = util.unescapeFragment(part);
+      schema = schema[part];
+      if (schema === undefined) break;
+      var id;
+      if (!PREVENT_SCOPE_CHANGE[part]) {
+        id = this._getId(schema);
+        if (id) baseId = resolveUrl(baseId, id);
+        if (schema.$ref) {
+          var $ref = resolveUrl(baseId, schema.$ref);
+          var res = resolveSchema.call(this, root, $ref);
+          if (res) {
+            schema = res.schema;
+            root = res.root;
+            baseId = res.baseId;
+          }
+        }
+      }
+    }
+  }
+  if (schema !== undefined && schema !== root.schema)
+    return { schema: schema, root: root, baseId: baseId };
+}
+
+
+var SIMPLE_INLINED = util.toHash([
+  'type', 'format', 'pattern',
+  'maxLength', 'minLength',
+  'maxProperties', 'minProperties',
+  'maxItems', 'minItems',
+  'maximum', 'minimum',
+  'uniqueItems', 'multipleOf',
+  'required', 'enum'
+]);
+function inlineRef(schema, limit) {
+  if (limit === false) return false;
+  if (limit === undefined || limit === true) return checkNoRef(schema);
+  else if (limit) return countKeys(schema) <= limit;
+}
+
+
+function checkNoRef(schema) {
+  var item;
+  if (Array.isArray(schema)) {
+    for (var i=0; i<schema.length; i++) {
+      item = schema[i];
+      if (typeof item == 'object' && !checkNoRef(item)) return false;
+    }
+  } else {
+    for (var key in schema) {
+      if (key == '$ref') return false;
+      item = schema[key];
+      if (typeof item == 'object' && !checkNoRef(item)) return false;
+    }
+  }
+  return true;
+}
+
+
+function countKeys(schema) {
+  var count = 0, item;
+  if (Array.isArray(schema)) {
+    for (var i=0; i<schema.length; i++) {
+      item = schema[i];
+      if (typeof item == 'object') count += countKeys(item);
+      if (count == Infinity) return Infinity;
+    }
+  } else {
+    for (var key in schema) {
+      if (key == '$ref') return Infinity;
+      if (SIMPLE_INLINED[key]) {
+        count++;
+      } else {
+        item = schema[key];
+        if (typeof item == 'object') count += countKeys(item) + 1;
+        if (count == Infinity) return Infinity;
+      }
+    }
+  }
+  return count;
+}
+
+
+function getFullPath(id, normalize) {
+  if (normalize !== false) id = normalizeId(id);
+  var p = URI.parse(id);
+  return _getFullPath(p);
+}
+
+
+function _getFullPath(p) {
+  return URI.serialize(p).split('#')[0] + '#';
+}
+
+
+var TRAILING_SLASH_HASH = /#\/?$/;
+function normalizeId(id) {
+  return id ? id.replace(TRAILING_SLASH_HASH, '') : '';
+}
+
+
+function resolveUrl(baseId, id) {
+  id = normalizeId(id);
+  return URI.resolve(baseId, id);
+}
+
+
+/* @this Ajv */
+function resolveIds(schema) {
+  var schemaId = normalizeId(this._getId(schema));
+  var baseIds = {'': schemaId};
+  var fullPaths = {'': getFullPath(schemaId, false)};
+  var localRefs = {};
+  var self = this;
+
+  traverse(schema, {allKeys: true}, function(sch, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex) {
+    if (jsonPtr === '') return;
+    var id = self._getId(sch);
+    var baseId = baseIds[parentJsonPtr];
+    var fullPath = fullPaths[parentJsonPtr] + '/' + parentKeyword;
+    if (keyIndex !== undefined)
+      fullPath += '/' + (typeof keyIndex == 'number' ? keyIndex : util.escapeFragment(keyIndex));
+
+    if (typeof id == 'string') {
+      id = baseId = normalizeId(baseId ? URI.resolve(baseId, id) : id);
+
+      var refVal = self._refs[id];
+      if (typeof refVal == 'string') refVal = self._refs[refVal];
+      if (refVal && refVal.schema) {
+        if (!equal(sch, refVal.schema))
+          throw new Error('id "' + id + '" resolves to more than one schema');
+      } else if (id != normalizeId(fullPath)) {
+        if (id[0] == '#') {
+          if (localRefs[id] && !equal(sch, localRefs[id]))
+            throw new Error('id "' + id + '" resolves to more than one schema');
+          localRefs[id] = sch;
+        } else {
+          self._refs[id] = fullPath;
+        }
+      }
+    }
+    baseIds[jsonPtr] = baseId;
+    fullPaths[jsonPtr] = fullPath;
+  });
+
+  return localRefs;
+}
+
+},{"./schema_obj":8,"./util":10,"fast-deep-equal":42,"json-schema-traverse":44,"uri-js":45}],7:[function(require,module,exports){
+'use strict';
+
+var ruleModules = require('../dotjs')
+  , toHash = require('./util').toHash;
+
+module.exports = function rules() {
+  var RULES = [
+    { type: 'number',
+      rules: [ { 'maximum': ['exclusiveMaximum'] },
+               { 'minimum': ['exclusiveMinimum'] }, 'multipleOf', 'format'] },
+    { type: 'string',
+      rules: [ 'maxLength', 'minLength', 'pattern', 'format' ] },
+    { type: 'array',
+      rules: [ 'maxItems', 'minItems', 'items', 'contains', 'uniqueItems' ] },
+    { type: 'object',
+      rules: [ 'maxProperties', 'minProperties', 'required', 'dependencies', 'propertyNames',
+               { 'properties': ['additionalProperties', 'patternProperties'] } ] },
+    { rules: [ '$ref', 'const', 'enum', 'not', 'anyOf', 'oneOf', 'allOf', 'if' ] }
+  ];
+
+  var ALL = [ 'type', '$comment' ];
+  var KEYWORDS = [
+    '$schema', '$id', 'id', '$data', '$async', 'title',
+    'description', 'default', 'definitions',
+    'examples', 'readOnly', 'writeOnly',
+    'contentMediaType', 'contentEncoding',
+    'additionalItems', 'then', 'else'
+  ];
+  var TYPES = [ 'number', 'integer', 'string', 'array', 'object', 'boolean', 'null' ];
+  RULES.all = toHash(ALL);
+  RULES.types = toHash(TYPES);
+
+  RULES.forEach(function (group) {
+    group.rules = group.rules.map(function (keyword) {
+      var implKeywords;
+      if (typeof keyword == 'object') {
+        var key = Object.keys(keyword)[0];
+        implKeywords = keyword[key];
+        keyword = key;
+        implKeywords.forEach(function (k) {
+          ALL.push(k);
+          RULES.all[k] = true;
+        });
+      }
+      ALL.push(keyword);
+      var rule = RULES.all[keyword] = {
+        keyword: keyword,
+        code: ruleModules[keyword],
+        implements: implKeywords
+      };
+      return rule;
+    });
+
+    RULES.all.$comment = {
+      keyword: '$comment',
+      code: ruleModules.$comment
+    };
+
+    if (group.type) RULES.types[group.type] = group;
+  });
+
+  RULES.keywords = toHash(ALL.concat(KEYWORDS));
+  RULES.custom = {};
+
+  return RULES;
+};
+
+},{"../dotjs":27,"./util":10}],8:[function(require,module,exports){
+'use strict';
+
+var util = require('./util');
+
+module.exports = SchemaObject;
+
+function SchemaObject(obj) {
+  util.copy(obj, this);
+}
+
+},{"./util":10}],9:[function(require,module,exports){
+'use strict';
+
+// https://mathiasbynens.be/notes/javascript-encoding
+// https://github.com/bestiejs/punycode.js - punycode.ucs2.decode
+module.exports = function ucs2length(str) {
+  var length = 0
+    , len = str.length
+    , pos = 0
+    , value;
+  while (pos < len) {
+    length++;
+    value = str.charCodeAt(pos++);
+    if (value >= 0xD800 && value <= 0xDBFF && pos < len) {
+      // high surrogate, and there is a next character
+      value = str.charCodeAt(pos);
+      if ((value & 0xFC00) == 0xDC00) pos++; // low surrogate
+    }
+  }
+  return length;
+};
+
+},{}],10:[function(require,module,exports){
+'use strict';
+
+
+module.exports = {
+  copy: copy,
+  checkDataType: checkDataType,
+  checkDataTypes: checkDataTypes,
+  coerceToTypes: coerceToTypes,
+  toHash: toHash,
+  getProperty: getProperty,
+  escapeQuotes: escapeQuotes,
+  equal: require('fast-deep-equal'),
+  ucs2length: require('./ucs2length'),
+  varOccurences: varOccurences,
+  varReplace: varReplace,
+  schemaHasRules: schemaHasRules,
+  schemaHasRulesExcept: schemaHasRulesExcept,
+  schemaUnknownRules: schemaUnknownRules,
+  toQuotedString: toQuotedString,
+  getPathExpr: getPathExpr,
+  getPath: getPath,
+  getData: getData,
+  unescapeFragment: unescapeFragment,
+  unescapeJsonPointer: unescapeJsonPointer,
+  escapeFragment: escapeFragment,
+  escapeJsonPointer: escapeJsonPointer
+};
+
+
+function copy(o, to) {
+  to = to || {};
+  for (var key in o) to[key] = o[key];
+  return to;
+}
+
+
+function checkDataType(dataType, data, strictNumbers, negate) {
+  var EQUAL = negate ? ' !== ' : ' === '
+    , AND = negate ? ' || ' : ' && '
+    , OK = negate ? '!' : ''
+    , NOT = negate ? '' : '!';
+  switch (dataType) {
+    case 'null': return data + EQUAL + 'null';
+    case 'array': return OK + 'Array.isArray(' + data + ')';
+    case 'object': return '(' + OK + data + AND +
+                          'typeof ' + data + EQUAL + '"object"' + AND +
+                          NOT + 'Array.isArray(' + data + '))';
+    case 'integer': return '(typeof ' + data + EQUAL + '"number"' + AND +
+                           NOT + '(' + data + ' % 1)' +
+                           AND + data + EQUAL + data +
+                           (strictNumbers ? (AND + OK + 'isFinite(' + data + ')') : '') + ')';
+    case 'number': return '(typeof ' + data + EQUAL + '"' + dataType + '"' +
+                          (strictNumbers ? (AND + OK + 'isFinite(' + data + ')') : '') + ')';
+    default: return 'typeof ' + data + EQUAL + '"' + dataType + '"';
+  }
+}
+
+
+function checkDataTypes(dataTypes, data, strictNumbers) {
+  switch (dataTypes.length) {
+    case 1: return checkDataType(dataTypes[0], data, strictNumbers, true);
+    default:
+      var code = '';
+      var types = toHash(dataTypes);
+      if (types.array && types.object) {
+        code = types.null ? '(': '(!' + data + ' || ';
+        code += 'typeof ' + data + ' !== "object")';
+        delete types.null;
+        delete types.array;
+        delete types.object;
+      }
+      if (types.number) delete types.integer;
+      for (var t in types)
+        code += (code ? ' && ' : '' ) + checkDataType(t, data, strictNumbers, true);
+
+      return code;
+  }
+}
+
+
+var COERCE_TO_TYPES = toHash([ 'string', 'number', 'integer', 'boolean', 'null' ]);
+function coerceToTypes(optionCoerceTypes, dataTypes) {
+  if (Array.isArray(dataTypes)) {
+    var types = [];
+    for (var i=0; i<dataTypes.length; i++) {
+      var t = dataTypes[i];
+      if (COERCE_TO_TYPES[t]) types[types.length] = t;
+      else if (optionCoerceTypes === 'array' && t === 'array') types[types.length] = t;
+    }
+    if (types.length) return types;
+  } else if (COERCE_TO_TYPES[dataTypes]) {
+    return [dataTypes];
+  } else if (optionCoerceTypes === 'array' && dataTypes === 'array') {
+    return ['array'];
+  }
+}
+
+
+function toHash(arr) {
+  var hash = {};
+  for (var i=0; i<arr.length; i++) hash[arr[i]] = true;
+  return hash;
+}
+
+
+var IDENTIFIER = /^[a-z$_][a-z$_0-9]*$/i;
+var SINGLE_QUOTE = /'|\\/g;
+function getProperty(key) {
+  return typeof key == 'number'
+          ? '[' + key + ']'
+          : IDENTIFIER.test(key)
+            ? '.' + key
+            : "['" + escapeQuotes(key) + "']";
+}
+
+
+function escapeQuotes(str) {
+  return str.replace(SINGLE_QUOTE, '\\$&')
+            .replace(/\n/g, '\\n')
+            .replace(/\r/g, '\\r')
+            .replace(/\f/g, '\\f')
+            .replace(/\t/g, '\\t');
+}
+
+
+function varOccurences(str, dataVar) {
+  dataVar += '[^0-9]';
+  var matches = str.match(new RegExp(dataVar, 'g'));
+  return matches ? matches.length : 0;
+}
+
+
+function varReplace(str, dataVar, expr) {
+  dataVar += '([^0-9])';
+  expr = expr.replace(/\$/g, '$$$$');
+  return str.replace(new RegExp(dataVar, 'g'), expr + '$1');
+}
+
+
+function schemaHasRules(schema, rules) {
+  if (typeof schema == 'boolean') return !schema;
+  for (var key in schema) if (rules[key]) return true;
+}
+
+
+function schemaHasRulesExcept(schema, rules, exceptKeyword) {
+  if (typeof schema == 'boolean') return !schema && exceptKeyword != 'not';
+  for (var key in schema) if (key != exceptKeyword && rules[key]) return true;
+}
+
+
+function schemaUnknownRules(schema, rules) {
+  if (typeof schema == 'boolean') return;
+  for (var key in schema) if (!rules[key]) return key;
+}
+
+
+function toQuotedString(str) {
+  return '\'' + escapeQuotes(str) + '\'';
+}
+
+
+function getPathExpr(currentPath, expr, jsonPointers, isNumber) {
+  var path = jsonPointers // false by default
+              ? '\'/\' + ' + expr + (isNumber ? '' : '.replace(/~/g, \'~0\').replace(/\\//g, \'~1\')')
+              : (isNumber ? '\'[\' + ' + expr + ' + \']\'' : '\'[\\\'\' + ' + expr + ' + \'\\\']\'');
+  return joinPaths(currentPath, path);
+}
+
+
+function getPath(currentPath, prop, jsonPointers) {
+  var path = jsonPointers // false by default
+              ? toQuotedString('/' + escapeJsonPointer(prop))
+              : toQuotedString(getProperty(prop));
+  return joinPaths(currentPath, path);
+}
+
+
+var JSON_POINTER = /^\/(?:[^~]|~0|~1)*$/;
+var RELATIVE_JSON_POINTER = /^([0-9]+)(#|\/(?:[^~]|~0|~1)*)?$/;
+function getData($data, lvl, paths) {
+  var up, jsonPointer, data, matches;
+  if ($data === '') return 'rootData';
+  if ($data[0] == '/') {
+    if (!JSON_POINTER.test($data)) throw new Error('Invalid JSON-pointer: ' + $data);
+    jsonPointer = $data;
+    data = 'rootData';
+  } else {
+    matches = $data.match(RELATIVE_JSON_POINTER);
+    if (!matches) throw new Error('Invalid JSON-pointer: ' + $data);
+    up = +matches[1];
+    jsonPointer = matches[2];
+    if (jsonPointer == '#') {
+      if (up >= lvl) throw new Error('Cannot access property/index ' + up + ' levels up, current level is ' + lvl);
+      return paths[lvl - up];
+    }
+
+    if (up > lvl) throw new Error('Cannot access data ' + up + ' levels up, current level is ' + lvl);
+    data = 'data' + ((lvl - up) || '');
+    if (!jsonPointer) return data;
+  }
+
+  var expr = data;
+  var segments = jsonPointer.split('/');
+  for (var i=0; i<segments.length; i++) {
+    var segment = segments[i];
+    if (segment) {
+      data += getProperty(unescapeJsonPointer(segment));
+      expr += ' && ' + data;
+    }
+  }
+  return expr;
+}
+
+
+function joinPaths (a, b) {
+  if (a == '""') return b;
+  return (a + ' + ' + b).replace(/([^\\])' \+ '/g, '$1');
+}
+
+
+function unescapeFragment(str) {
+  return unescapeJsonPointer(decodeURIComponent(str));
+}
+
+
+function escapeFragment(str) {
+  return encodeURIComponent(escapeJsonPointer(str));
+}
+
+
+function escapeJsonPointer(str) {
+  return str.replace(/~/g, '~0').replace(/\//g, '~1');
+}
+
+
+function unescapeJsonPointer(str) {
+  return str.replace(/~1/g, '/').replace(/~0/g, '~');
+}
+
+},{"./ucs2length":9,"fast-deep-equal":42}],11:[function(require,module,exports){
+'use strict';
+
+var KEYWORDS = [
+  'multipleOf',
+  'maximum',
+  'exclusiveMaximum',
+  'minimum',
+  'exclusiveMinimum',
+  'maxLength',
+  'minLength',
+  'pattern',
+  'additionalItems',
+  'maxItems',
+  'minItems',
+  'uniqueItems',
+  'maxProperties',
+  'minProperties',
+  'required',
+  'additionalProperties',
+  'enum',
+  'format',
+  'const'
+];
+
+module.exports = function (metaSchema, keywordsJsonPointers) {
+  for (var i=0; i<keywordsJsonPointers.length; i++) {
+    metaSchema = JSON.parse(JSON.stringify(metaSchema));
+    var segments = keywordsJsonPointers[i].split('/');
+    var keywords = metaSchema;
+    var j;
+    for (j=1; j<segments.length; j++)
+      keywords = keywords[segments[j]];
+
+    for (j=0; j<KEYWORDS.length; j++) {
+      var key = KEYWORDS[j];
+      var schema = keywords[key];
+      if (schema) {
+        keywords[key] = {
+          anyOf: [
+            schema,
+            { $ref: 'https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#' }
+          ]
+        };
+      }
+    }
+  }
+
+  return metaSchema;
+};
+
+},{}],12:[function(require,module,exports){
+'use strict';
+
+var metaSchema = require('./refs/json-schema-draft-07.json');
+
+module.exports = {
+  $id: 'https://github.com/ajv-validator/ajv/blob/master/lib/definition_schema.js',
+  definitions: {
+    simpleTypes: metaSchema.definitions.simpleTypes
+  },
+  type: 'object',
+  dependencies: {
+    schema: ['validate'],
+    $data: ['validate'],
+    statements: ['inline'],
+    valid: {not: {required: ['macro']}}
+  },
+  properties: {
+    type: metaSchema.properties.type,
+    schema: {type: 'boolean'},
+    statements: {type: 'boolean'},
+    dependencies: {
+      type: 'array',
+      items: {type: 'string'}
+    },
+    metaSchema: {type: 'object'},
+    modifying: {type: 'boolean'},
+    valid: {type: 'boolean'},
+    $data: {type: 'boolean'},
+    async: {type: 'boolean'},
+    errors: {
+      anyOf: [
+        {type: 'boolean'},
+        {const: 'full'}
+      ]
+    }
+  }
+};
+
+},{"./refs/json-schema-draft-07.json":41}],13:[function(require,module,exports){
+'use strict';
+module.exports = function generate__limit(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $isMax = $keyword == 'maximum',
+    $exclusiveKeyword = $isMax ? 'exclusiveMaximum' : 'exclusiveMinimum',
+    $schemaExcl = it.schema[$exclusiveKeyword],
+    $isDataExcl = it.opts.$data && $schemaExcl && $schemaExcl.$data,
+    $op = $isMax ? '<' : '>',
+    $notOp = $isMax ? '>' : '<',
+    $errorKeyword = undefined;
+  if (!($isData || typeof $schema == 'number' || $schema === undefined)) {
+    throw new Error($keyword + ' must be number');
+  }
+  if (!($isDataExcl || $schemaExcl === undefined || typeof $schemaExcl == 'number' || typeof $schemaExcl == 'boolean')) {
+    throw new Error($exclusiveKeyword + ' must be number or boolean');
+  }
+  if ($isDataExcl) {
+    var $schemaValueExcl = it.util.getData($schemaExcl.$data, $dataLvl, it.dataPathArr),
+      $exclusive = 'exclusive' + $lvl,
+      $exclType = 'exclType' + $lvl,
+      $exclIsNumber = 'exclIsNumber' + $lvl,
+      $opExpr = 'op' + $lvl,
+      $opStr = '\' + ' + $opExpr + ' + \'';
+    out += ' var schemaExcl' + ($lvl) + ' = ' + ($schemaValueExcl) + '; ';
+    $schemaValueExcl = 'schemaExcl' + $lvl;
+    out += ' var ' + ($exclusive) + '; var ' + ($exclType) + ' = typeof ' + ($schemaValueExcl) + '; if (' + ($exclType) + ' != \'boolean\' && ' + ($exclType) + ' != \'undefined\' && ' + ($exclType) + ' != \'number\') { ';
+    var $errorKeyword = $exclusiveKeyword;
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ($errorKeyword || '_exclusiveLimit') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'' + ($exclusiveKeyword) + ' should be boolean\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    out += ' } else if ( ';
+    if ($isData) {
+      out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+    }
+    out += ' ' + ($exclType) + ' == \'number\' ? ( (' + ($exclusive) + ' = ' + ($schemaValue) + ' === undefined || ' + ($schemaValueExcl) + ' ' + ($op) + '= ' + ($schemaValue) + ') ? ' + ($data) + ' ' + ($notOp) + '= ' + ($schemaValueExcl) + ' : ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' ) : ( (' + ($exclusive) + ' = ' + ($schemaValueExcl) + ' === true) ? ' + ($data) + ' ' + ($notOp) + '= ' + ($schemaValue) + ' : ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' ) || ' + ($data) + ' !== ' + ($data) + ') { var op' + ($lvl) + ' = ' + ($exclusive) + ' ? \'' + ($op) + '\' : \'' + ($op) + '=\'; ';
+    if ($schema === undefined) {
+      $errorKeyword = $exclusiveKeyword;
+      $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+      $schemaValue = $schemaValueExcl;
+      $isData = $isDataExcl;
+    }
+  } else {
+    var $exclIsNumber = typeof $schemaExcl == 'number',
+      $opStr = $op;
+    if ($exclIsNumber && $isData) {
+      var $opExpr = '\'' + $opStr + '\'';
+      out += ' if ( ';
+      if ($isData) {
+        out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+      }
+      out += ' ( ' + ($schemaValue) + ' === undefined || ' + ($schemaExcl) + ' ' + ($op) + '= ' + ($schemaValue) + ' ? ' + ($data) + ' ' + ($notOp) + '= ' + ($schemaExcl) + ' : ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' ) || ' + ($data) + ' !== ' + ($data) + ') { ';
+    } else {
+      if ($exclIsNumber && $schema === undefined) {
+        $exclusive = true;
+        $errorKeyword = $exclusiveKeyword;
+        $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+        $schemaValue = $schemaExcl;
+        $notOp += '=';
+      } else {
+        if ($exclIsNumber) $schemaValue = Math[$isMax ? 'min' : 'max']($schemaExcl, $schema);
+        if ($schemaExcl === ($exclIsNumber ? $schemaValue : true)) {
+          $exclusive = true;
+          $errorKeyword = $exclusiveKeyword;
+          $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+          $notOp += '=';
+        } else {
+          $exclusive = false;
+          $opStr += '=';
+        }
+      }
+      var $opExpr = '\'' + $opStr + '\'';
+      out += ' if ( ';
+      if ($isData) {
+        out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+      }
+      out += ' ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' || ' + ($data) + ' !== ' + ($data) + ') { ';
+    }
+  }
+  $errorKeyword = $errorKeyword || $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limit') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { comparison: ' + ($opExpr) + ', limit: ' + ($schemaValue) + ', exclusive: ' + ($exclusive) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be ' + ($opStr) + ' ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue);
+      } else {
+        out += '' + ($schemaValue) + '\'';
+      }
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' } ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],14:[function(require,module,exports){
+'use strict';
+module.exports = function generate__limitItems(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  var $op = $keyword == 'maxItems' ? '>' : '<';
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+  }
+  out += ' ' + ($data) + '.length ' + ($op) + ' ' + ($schemaValue) + ') { ';
+  var $errorKeyword = $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limitItems') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should NOT have ';
+      if ($keyword == 'maxItems') {
+        out += 'more';
+      } else {
+        out += 'fewer';
+      }
+      out += ' than ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + ($schema);
+      }
+      out += ' items\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],15:[function(require,module,exports){
+'use strict';
+module.exports = function generate__limitLength(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  var $op = $keyword == 'maxLength' ? '>' : '<';
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+  }
+  if (it.opts.unicode === false) {
+    out += ' ' + ($data) + '.length ';
+  } else {
+    out += ' ucs2length(' + ($data) + ') ';
+  }
+  out += ' ' + ($op) + ' ' + ($schemaValue) + ') { ';
+  var $errorKeyword = $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limitLength') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should NOT be ';
+      if ($keyword == 'maxLength') {
+        out += 'longer';
+      } else {
+        out += 'shorter';
+      }
+      out += ' than ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + ($schema);
+      }
+      out += ' characters\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],16:[function(require,module,exports){
+'use strict';
+module.exports = function generate__limitProperties(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  var $op = $keyword == 'maxProperties' ? '>' : '<';
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+  }
+  out += ' Object.keys(' + ($data) + ').length ' + ($op) + ' ' + ($schemaValue) + ') { ';
+  var $errorKeyword = $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limitProperties') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should NOT have ';
+      if ($keyword == 'maxProperties') {
+        out += 'more';
+      } else {
+        out += 'fewer';
+      }
+      out += ' than ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + ($schema);
+      }
+      out += ' properties\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],17:[function(require,module,exports){
+'use strict';
+module.exports = function generate_allOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $currentBaseId = $it.baseId,
+    $allSchemasEmpty = true;
+  var arr1 = $schema;
+  if (arr1) {
+    var $sch, $i = -1,
+      l1 = arr1.length - 1;
+    while ($i < l1) {
+      $sch = arr1[$i += 1];
+      if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+        $allSchemasEmpty = false;
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + '[' + $i + ']';
+        $it.errSchemaPath = $errSchemaPath + '/' + $i;
+        out += '  ' + (it.validate($it)) + ' ';
+        $it.baseId = $currentBaseId;
+        if ($breakOnError) {
+          out += ' if (' + ($nextValid) + ') { ';
+          $closingBraces += '}';
+        }
+      }
+    }
+  }
+  if ($breakOnError) {
+    if ($allSchemasEmpty) {
+      out += ' if (true) { ';
+    } else {
+      out += ' ' + ($closingBraces.slice(0, -1)) + ' ';
+    }
+  }
+  return out;
+}
+
+},{}],18:[function(require,module,exports){
+'use strict';
+module.exports = function generate_anyOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $noEmptySchema = $schema.every(function($sch) {
+    return (it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all));
+  });
+  if ($noEmptySchema) {
+    var $currentBaseId = $it.baseId;
+    out += ' var ' + ($errs) + ' = errors; var ' + ($valid) + ' = false;  ';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    var arr1 = $schema;
+    if (arr1) {
+      var $sch, $i = -1,
+        l1 = arr1.length - 1;
+      while ($i < l1) {
+        $sch = arr1[$i += 1];
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + '[' + $i + ']';
+        $it.errSchemaPath = $errSchemaPath + '/' + $i;
+        out += '  ' + (it.validate($it)) + ' ';
+        $it.baseId = $currentBaseId;
+        out += ' ' + ($valid) + ' = ' + ($valid) + ' || ' + ($nextValid) + '; if (!' + ($valid) + ') { ';
+        $closingBraces += '}';
+      }
+    }
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' ' + ($closingBraces) + ' if (!' + ($valid) + ') {   var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('anyOf') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should match some schema in anyOf\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError(vErrors); ';
+      } else {
+        out += ' validate.errors = vErrors; return false; ';
+      }
+    }
+    out += ' } else {  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; } ';
+    if (it.opts.allErrors) {
+      out += ' } ';
+    }
+  } else {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  }
+  return out;
+}
+
+},{}],19:[function(require,module,exports){
+'use strict';
+module.exports = function generate_comment(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $schema = it.schema[$keyword];
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $comment = it.util.toQuotedString($schema);
+  if (it.opts.$comment === true) {
+    out += ' console.log(' + ($comment) + ');';
+  } else if (typeof it.opts.$comment == 'function') {
+    out += ' self._opts.$comment(' + ($comment) + ', ' + (it.util.toQuotedString($errSchemaPath)) + ', validate.root.schema);';
+  }
+  return out;
+}
+
+},{}],20:[function(require,module,exports){
+'use strict';
+module.exports = function generate_const(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!$isData) {
+    out += ' var schema' + ($lvl) + ' = validate.schema' + ($schemaPath) + ';';
+  }
+  out += 'var ' + ($valid) + ' = equal(' + ($data) + ', schema' + ($lvl) + '); if (!' + ($valid) + ') {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('const') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { allowedValue: schema' + ($lvl) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be equal to constant\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' }';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],21:[function(require,module,exports){
+'use strict';
+module.exports = function generate_contains(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $idx = 'i' + $lvl,
+    $dataNxt = $it.dataLevel = it.dataLevel + 1,
+    $nextData = 'data' + $dataNxt,
+    $currentBaseId = it.baseId,
+    $nonEmptySchema = (it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all));
+  out += 'var ' + ($errs) + ' = errors;var ' + ($valid) + ';';
+  if ($nonEmptySchema) {
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += ' var ' + ($nextValid) + ' = false; for (var ' + ($idx) + ' = 0; ' + ($idx) + ' < ' + ($data) + '.length; ' + ($idx) + '++) { ';
+    $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+    var $passData = $data + '[' + $idx + ']';
+    $it.dataPathArr[$dataNxt] = $idx;
+    var $code = it.validate($it);
+    $it.baseId = $currentBaseId;
+    if (it.util.varOccurences($code, $nextData) < 2) {
+      out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+    } else {
+      out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+    }
+    out += ' if (' + ($nextValid) + ') break; }  ';
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' ' + ($closingBraces) + ' if (!' + ($nextValid) + ') {';
+  } else {
+    out += ' if (' + ($data) + '.length == 0) {';
+  }
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('contains') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should contain a valid item\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' } else { ';
+  if ($nonEmptySchema) {
+    out += '  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; } ';
+  }
+  if (it.opts.allErrors) {
+    out += ' } ';
+  }
+  return out;
+}
+
+},{}],22:[function(require,module,exports){
+'use strict';
+module.exports = function generate_custom(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $rule = this,
+    $definition = 'definition' + $lvl,
+    $rDef = $rule.definition,
+    $closingBraces = '';
+  var $compile, $inline, $macro, $ruleValidate, $validateCode;
+  if ($isData && $rDef.$data) {
+    $validateCode = 'keywordValidate' + $lvl;
+    var $validateSchema = $rDef.validateSchema;
+    out += ' var ' + ($definition) + ' = RULES.custom[\'' + ($keyword) + '\'].definition; var ' + ($validateCode) + ' = ' + ($definition) + '.validate;';
+  } else {
+    $ruleValidate = it.useCustomRule($rule, $schema, it.schema, it);
+    if (!$ruleValidate) return;
+    $schemaValue = 'validate.schema' + $schemaPath;
+    $validateCode = $ruleValidate.code;
+    $compile = $rDef.compile;
+    $inline = $rDef.inline;
+    $macro = $rDef.macro;
+  }
+  var $ruleErrs = $validateCode + '.errors',
+    $i = 'i' + $lvl,
+    $ruleErr = 'ruleErr' + $lvl,
+    $asyncKeyword = $rDef.async;
+  if ($asyncKeyword && !it.async) throw new Error('async keyword in sync schema');
+  if (!($inline || $macro)) {
+    out += '' + ($ruleErrs) + ' = null;';
+  }
+  out += 'var ' + ($errs) + ' = errors;var ' + ($valid) + ';';
+  if ($isData && $rDef.$data) {
+    $closingBraces += '}';
+    out += ' if (' + ($schemaValue) + ' === undefined) { ' + ($valid) + ' = true; } else { ';
+    if ($validateSchema) {
+      $closingBraces += '}';
+      out += ' ' + ($valid) + ' = ' + ($definition) + '.validateSchema(' + ($schemaValue) + '); if (' + ($valid) + ') { ';
+    }
+  }
+  if ($inline) {
+    if ($rDef.statements) {
+      out += ' ' + ($ruleValidate.validate) + ' ';
+    } else {
+      out += ' ' + ($valid) + ' = ' + ($ruleValidate.validate) + '; ';
+    }
+  } else if ($macro) {
+    var $it = it.util.copy(it);
+    var $closingBraces = '';
+    $it.level++;
+    var $nextValid = 'valid' + $it.level;
+    $it.schema = $ruleValidate.validate;
+    $it.schemaPath = '';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    var $code = it.validate($it).replace(/validate\.schema/g, $validateCode);
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' ' + ($code);
+  } else {
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = '';
+    out += '  ' + ($validateCode) + '.call( ';
+    if (it.opts.passContext) {
+      out += 'this';
+    } else {
+      out += 'self';
+    }
+    if ($compile || $rDef.schema === false) {
+      out += ' , ' + ($data) + ' ';
+    } else {
+      out += ' , ' + ($schemaValue) + ' , ' + ($data) + ' , validate.schema' + (it.schemaPath) + ' ';
+    }
+    out += ' , (dataPath || \'\')';
+    if (it.errorPath != '""') {
+      out += ' + ' + (it.errorPath);
+    }
+    var $parentData = $dataLvl ? 'data' + (($dataLvl - 1) || '') : 'parentData',
+      $parentDataProperty = $dataLvl ? it.dataPathArr[$dataLvl] : 'parentDataProperty';
+    out += ' , ' + ($parentData) + ' , ' + ($parentDataProperty) + ' , rootData )  ';
+    var def_callRuleValidate = out;
+    out = $$outStack.pop();
+    if ($rDef.errors === false) {
+      out += ' ' + ($valid) + ' = ';
+      if ($asyncKeyword) {
+        out += 'await ';
+      }
+      out += '' + (def_callRuleValidate) + '; ';
+    } else {
+      if ($asyncKeyword) {
+        $ruleErrs = 'customErrors' + $lvl;
+        out += ' var ' + ($ruleErrs) + ' = null; try { ' + ($valid) + ' = await ' + (def_callRuleValidate) + '; } catch (e) { ' + ($valid) + ' = false; if (e instanceof ValidationError) ' + ($ruleErrs) + ' = e.errors; else throw e; } ';
+      } else {
+        out += ' ' + ($ruleErrs) + ' = null; ' + ($valid) + ' = ' + (def_callRuleValidate) + '; ';
+      }
+    }
+  }
+  if ($rDef.modifying) {
+    out += ' if (' + ($parentData) + ') ' + ($data) + ' = ' + ($parentData) + '[' + ($parentDataProperty) + '];';
+  }
+  out += '' + ($closingBraces);
+  if ($rDef.valid) {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  } else {
+    out += ' if ( ';
+    if ($rDef.valid === undefined) {
+      out += ' !';
+      if ($macro) {
+        out += '' + ($nextValid);
+      } else {
+        out += '' + ($valid);
+      }
+    } else {
+      out += ' ' + (!$rDef.valid) + ' ';
+    }
+    out += ') { ';
+    $errorKeyword = $rule.keyword;
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = '';
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ($errorKeyword || 'custom') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { keyword: \'' + ($rule.keyword) + '\' } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should pass "' + ($rule.keyword) + '" keyword validation\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    var def_customError = out;
+    out = $$outStack.pop();
+    if ($inline) {
+      if ($rDef.errors) {
+        if ($rDef.errors != 'full') {
+          out += '  for (var ' + ($i) + '=' + ($errs) + '; ' + ($i) + '<errors; ' + ($i) + '++) { var ' + ($ruleErr) + ' = vErrors[' + ($i) + ']; if (' + ($ruleErr) + '.dataPath === undefined) ' + ($ruleErr) + '.dataPath = (dataPath || \'\') + ' + (it.errorPath) + '; if (' + ($ruleErr) + '.schemaPath === undefined) { ' + ($ruleErr) + '.schemaPath = "' + ($errSchemaPath) + '"; } ';
+          if (it.opts.verbose) {
+            out += ' ' + ($ruleErr) + '.schema = ' + ($schemaValue) + '; ' + ($ruleErr) + '.data = ' + ($data) + '; ';
+          }
+          out += ' } ';
+        }
+      } else {
+        if ($rDef.errors === false) {
+          out += ' ' + (def_customError) + ' ';
+        } else {
+          out += ' if (' + ($errs) + ' == errors) { ' + (def_customError) + ' } else {  for (var ' + ($i) + '=' + ($errs) + '; ' + ($i) + '<errors; ' + ($i) + '++) { var ' + ($ruleErr) + ' = vErrors[' + ($i) + ']; if (' + ($ruleErr) + '.dataPath === undefined) ' + ($ruleErr) + '.dataPath = (dataPath || \'\') + ' + (it.errorPath) + '; if (' + ($ruleErr) + '.schemaPath === undefined) { ' + ($ruleErr) + '.schemaPath = "' + ($errSchemaPath) + '"; } ';
+          if (it.opts.verbose) {
+            out += ' ' + ($ruleErr) + '.schema = ' + ($schemaValue) + '; ' + ($ruleErr) + '.data = ' + ($data) + '; ';
+          }
+          out += ' } } ';
+        }
+      }
+    } else if ($macro) {
+      out += '   var err =   '; /* istanbul ignore else */
+      if (it.createErrors !== false) {
+        out += ' { keyword: \'' + ($errorKeyword || 'custom') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { keyword: \'' + ($rule.keyword) + '\' } ';
+        if (it.opts.messages !== false) {
+          out += ' , message: \'should pass "' + ($rule.keyword) + '" keyword validation\' ';
+        }
+        if (it.opts.verbose) {
+          out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+        }
+        out += ' } ';
+      } else {
+        out += ' {} ';
+      }
+      out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+      if (!it.compositeRule && $breakOnError) {
+        /* istanbul ignore if */
+        if (it.async) {
+          out += ' throw new ValidationError(vErrors); ';
+        } else {
+          out += ' validate.errors = vErrors; return false; ';
+        }
+      }
+    } else {
+      if ($rDef.errors === false) {
+        out += ' ' + (def_customError) + ' ';
+      } else {
+        out += ' if (Array.isArray(' + ($ruleErrs) + ')) { if (vErrors === null) vErrors = ' + ($ruleErrs) + '; else vErrors = vErrors.concat(' + ($ruleErrs) + '); errors = vErrors.length;  for (var ' + ($i) + '=' + ($errs) + '; ' + ($i) + '<errors; ' + ($i) + '++) { var ' + ($ruleErr) + ' = vErrors[' + ($i) + ']; if (' + ($ruleErr) + '.dataPath === undefined) ' + ($ruleErr) + '.dataPath = (dataPath || \'\') + ' + (it.errorPath) + ';  ' + ($ruleErr) + '.schemaPath = "' + ($errSchemaPath) + '";  ';
+        if (it.opts.verbose) {
+          out += ' ' + ($ruleErr) + '.schema = ' + ($schemaValue) + '; ' + ($ruleErr) + '.data = ' + ($data) + '; ';
+        }
+        out += ' } } else { ' + (def_customError) + ' } ';
+      }
+    }
+    out += ' } ';
+    if ($breakOnError) {
+      out += ' else { ';
+    }
+  }
+  return out;
+}
+
+},{}],23:[function(require,module,exports){
+'use strict';
+module.exports = function generate_dependencies(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $schemaDeps = {},
+    $propertyDeps = {},
+    $ownProperties = it.opts.ownProperties;
+  for ($property in $schema) {
+    if ($property == '__proto__') continue;
+    var $sch = $schema[$property];
+    var $deps = Array.isArray($sch) ? $propertyDeps : $schemaDeps;
+    $deps[$property] = $sch;
+  }
+  out += 'var ' + ($errs) + ' = errors;';
+  var $currentErrorPath = it.errorPath;
+  out += 'var missing' + ($lvl) + ';';
+  for (var $property in $propertyDeps) {
+    $deps = $propertyDeps[$property];
+    if ($deps.length) {
+      out += ' if ( ' + ($data) + (it.util.getProperty($property)) + ' !== undefined ';
+      if ($ownProperties) {
+        out += ' && Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($property)) + '\') ';
+      }
+      if ($breakOnError) {
+        out += ' && ( ';
+        var arr1 = $deps;
+        if (arr1) {
+          var $propertyKey, $i = -1,
+            l1 = arr1.length - 1;
+          while ($i < l1) {
+            $propertyKey = arr1[$i += 1];
+            if ($i) {
+              out += ' || ';
+            }
+            var $prop = it.util.getProperty($propertyKey),
+              $useData = $data + $prop;
+            out += ' ( ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') && (missing' + ($lvl) + ' = ' + (it.util.toQuotedString(it.opts.jsonPointers ? $propertyKey : $prop)) + ') ) ';
+          }
+        }
+        out += ')) {  ';
+        var $propertyPath = 'missing' + $lvl,
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.opts.jsonPointers ? it.util.getPathExpr($currentErrorPath, $propertyPath, true) : $currentErrorPath + ' + ' + $propertyPath;
+        }
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('dependencies') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { property: \'' + (it.util.escapeQuotes($property)) + '\', missingProperty: \'' + ($missingProperty) + '\', depsCount: ' + ($deps.length) + ', deps: \'' + (it.util.escapeQuotes($deps.length == 1 ? $deps[0] : $deps.join(", "))) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'should have ';
+            if ($deps.length == 1) {
+              out += 'property ' + (it.util.escapeQuotes($deps[0]));
+            } else {
+              out += 'properties ' + (it.util.escapeQuotes($deps.join(", ")));
+            }
+            out += ' when property ' + (it.util.escapeQuotes($property)) + ' is present\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+      } else {
+        out += ' ) { ';
+        var arr2 = $deps;
+        if (arr2) {
+          var $propertyKey, i2 = -1,
+            l2 = arr2.length - 1;
+          while (i2 < l2) {
+            $propertyKey = arr2[i2 += 1];
+            var $prop = it.util.getProperty($propertyKey),
+              $missingProperty = it.util.escapeQuotes($propertyKey),
+              $useData = $data + $prop;
+            if (it.opts._errorDataPathProperty) {
+              it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+            }
+            out += ' if ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') {  var err =   '; /* istanbul ignore else */
+            if (it.createErrors !== false) {
+              out += ' { keyword: \'' + ('dependencies') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { property: \'' + (it.util.escapeQuotes($property)) + '\', missingProperty: \'' + ($missingProperty) + '\', depsCount: ' + ($deps.length) + ', deps: \'' + (it.util.escapeQuotes($deps.length == 1 ? $deps[0] : $deps.join(", "))) + '\' } ';
+              if (it.opts.messages !== false) {
+                out += ' , message: \'should have ';
+                if ($deps.length == 1) {
+                  out += 'property ' + (it.util.escapeQuotes($deps[0]));
+                } else {
+                  out += 'properties ' + (it.util.escapeQuotes($deps.join(", ")));
+                }
+                out += ' when property ' + (it.util.escapeQuotes($property)) + ' is present\' ';
+              }
+              if (it.opts.verbose) {
+                out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+              }
+              out += ' } ';
+            } else {
+              out += ' {} ';
+            }
+            out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } ';
+          }
+        }
+      }
+      out += ' }   ';
+      if ($breakOnError) {
+        $closingBraces += '}';
+        out += ' else { ';
+      }
+    }
+  }
+  it.errorPath = $currentErrorPath;
+  var $currentBaseId = $it.baseId;
+  for (var $property in $schemaDeps) {
+    var $sch = $schemaDeps[$property];
+    if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+      out += ' ' + ($nextValid) + ' = true; if ( ' + ($data) + (it.util.getProperty($property)) + ' !== undefined ';
+      if ($ownProperties) {
+        out += ' && Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($property)) + '\') ';
+      }
+      out += ') { ';
+      $it.schema = $sch;
+      $it.schemaPath = $schemaPath + it.util.getProperty($property);
+      $it.errSchemaPath = $errSchemaPath + '/' + it.util.escapeFragment($property);
+      out += '  ' + (it.validate($it)) + ' ';
+      $it.baseId = $currentBaseId;
+      out += ' }  ';
+      if ($breakOnError) {
+        out += ' if (' + ($nextValid) + ') { ';
+        $closingBraces += '}';
+      }
+    }
+  }
+  if ($breakOnError) {
+    out += '   ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
+
+},{}],24:[function(require,module,exports){
+'use strict';
+module.exports = function generate_enum(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $i = 'i' + $lvl,
+    $vSchema = 'schema' + $lvl;
+  if (!$isData) {
+    out += ' var ' + ($vSchema) + ' = validate.schema' + ($schemaPath) + ';';
+  }
+  out += 'var ' + ($valid) + ';';
+  if ($isData) {
+    out += ' if (schema' + ($lvl) + ' === undefined) ' + ($valid) + ' = true; else if (!Array.isArray(schema' + ($lvl) + ')) ' + ($valid) + ' = false; else {';
+  }
+  out += '' + ($valid) + ' = false;for (var ' + ($i) + '=0; ' + ($i) + '<' + ($vSchema) + '.length; ' + ($i) + '++) if (equal(' + ($data) + ', ' + ($vSchema) + '[' + ($i) + '])) { ' + ($valid) + ' = true; break; }';
+  if ($isData) {
+    out += '  }  ';
+  }
+  out += ' if (!' + ($valid) + ') {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('enum') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { allowedValues: schema' + ($lvl) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be equal to one of the allowed values\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' }';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],25:[function(require,module,exports){
+'use strict';
+module.exports = function generate_format(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  if (it.opts.format === false) {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+    return out;
+  }
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $unknownFormats = it.opts.unknownFormats,
+    $allowUnknown = Array.isArray($unknownFormats);
+  if ($isData) {
+    var $format = 'format' + $lvl,
+      $isObject = 'isObject' + $lvl,
+      $formatType = 'formatType' + $lvl;
+    out += ' var ' + ($format) + ' = formats[' + ($schemaValue) + ']; var ' + ($isObject) + ' = typeof ' + ($format) + ' == \'object\' && !(' + ($format) + ' instanceof RegExp) && ' + ($format) + '.validate; var ' + ($formatType) + ' = ' + ($isObject) + ' && ' + ($format) + '.type || \'string\'; if (' + ($isObject) + ') { ';
+    if (it.async) {
+      out += ' var async' + ($lvl) + ' = ' + ($format) + '.async; ';
+    }
+    out += ' ' + ($format) + ' = ' + ($format) + '.validate; } if (  ';
+    if ($isData) {
+      out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'string\') || ';
+    }
+    out += ' (';
+    if ($unknownFormats != 'ignore') {
+      out += ' (' + ($schemaValue) + ' && !' + ($format) + ' ';
+      if ($allowUnknown) {
+        out += ' && self._opts.unknownFormats.indexOf(' + ($schemaValue) + ') == -1 ';
+      }
+      out += ') || ';
+    }
+    out += ' (' + ($format) + ' && ' + ($formatType) + ' == \'' + ($ruleType) + '\' && !(typeof ' + ($format) + ' == \'function\' ? ';
+    if (it.async) {
+      out += ' (async' + ($lvl) + ' ? await ' + ($format) + '(' + ($data) + ') : ' + ($format) + '(' + ($data) + ')) ';
+    } else {
+      out += ' ' + ($format) + '(' + ($data) + ') ';
+    }
+    out += ' : ' + ($format) + '.test(' + ($data) + '))))) {';
+  } else {
+    var $format = it.formats[$schema];
+    if (!$format) {
+      if ($unknownFormats == 'ignore') {
+        it.logger.warn('unknown format "' + $schema + '" ignored in schema at path "' + it.errSchemaPath + '"');
+        if ($breakOnError) {
+          out += ' if (true) { ';
+        }
+        return out;
+      } else if ($allowUnknown && $unknownFormats.indexOf($schema) >= 0) {
+        if ($breakOnError) {
+          out += ' if (true) { ';
+        }
+        return out;
+      } else {
+        throw new Error('unknown format "' + $schema + '" is used in schema at path "' + it.errSchemaPath + '"');
+      }
+    }
+    var $isObject = typeof $format == 'object' && !($format instanceof RegExp) && $format.validate;
+    var $formatType = $isObject && $format.type || 'string';
+    if ($isObject) {
+      var $async = $format.async === true;
+      $format = $format.validate;
+    }
+    if ($formatType != $ruleType) {
+      if ($breakOnError) {
+        out += ' if (true) { ';
+      }
+      return out;
+    }
+    if ($async) {
+      if (!it.async) throw new Error('async format in sync schema');
+      var $formatRef = 'formats' + it.util.getProperty($schema) + '.validate';
+      out += ' if (!(await ' + ($formatRef) + '(' + ($data) + '))) { ';
+    } else {
+      out += ' if (! ';
+      var $formatRef = 'formats' + it.util.getProperty($schema);
+      if ($isObject) $formatRef += '.validate';
+      if (typeof $format == 'function') {
+        out += ' ' + ($formatRef) + '(' + ($data) + ') ';
+      } else {
+        out += ' ' + ($formatRef) + '.test(' + ($data) + ') ';
+      }
+      out += ') { ';
+    }
+  }
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('format') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { format:  ';
+    if ($isData) {
+      out += '' + ($schemaValue);
+    } else {
+      out += '' + (it.util.toQuotedString($schema));
+    }
+    out += '  } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should match format "';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + (it.util.escapeQuotes($schema));
+      }
+      out += '"\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + (it.util.toQuotedString($schema));
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' } ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],26:[function(require,module,exports){
+'use strict';
+module.exports = function generate_if(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $thenSch = it.schema['then'],
+    $elseSch = it.schema['else'],
+    $thenPresent = $thenSch !== undefined && (it.opts.strictKeywords ? (typeof $thenSch == 'object' && Object.keys($thenSch).length > 0) || $thenSch === false : it.util.schemaHasRules($thenSch, it.RULES.all)),
+    $elsePresent = $elseSch !== undefined && (it.opts.strictKeywords ? (typeof $elseSch == 'object' && Object.keys($elseSch).length > 0) || $elseSch === false : it.util.schemaHasRules($elseSch, it.RULES.all)),
+    $currentBaseId = $it.baseId;
+  if ($thenPresent || $elsePresent) {
+    var $ifClause;
+    $it.createErrors = false;
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += ' var ' + ($errs) + ' = errors; var ' + ($valid) + ' = true;  ';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    out += '  ' + (it.validate($it)) + ' ';
+    $it.baseId = $currentBaseId;
+    $it.createErrors = true;
+    out += '  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; }  ';
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    if ($thenPresent) {
+      out += ' if (' + ($nextValid) + ') {  ';
+      $it.schema = it.schema['then'];
+      $it.schemaPath = it.schemaPath + '.then';
+      $it.errSchemaPath = it.errSchemaPath + '/then';
+      out += '  ' + (it.validate($it)) + ' ';
+      $it.baseId = $currentBaseId;
+      out += ' ' + ($valid) + ' = ' + ($nextValid) + '; ';
+      if ($thenPresent && $elsePresent) {
+        $ifClause = 'ifClause' + $lvl;
+        out += ' var ' + ($ifClause) + ' = \'then\'; ';
+      } else {
+        $ifClause = '\'then\'';
+      }
+      out += ' } ';
+      if ($elsePresent) {
+        out += ' else { ';
+      }
+    } else {
+      out += ' if (!' + ($nextValid) + ') { ';
+    }
+    if ($elsePresent) {
+      $it.schema = it.schema['else'];
+      $it.schemaPath = it.schemaPath + '.else';
+      $it.errSchemaPath = it.errSchemaPath + '/else';
+      out += '  ' + (it.validate($it)) + ' ';
+      $it.baseId = $currentBaseId;
+      out += ' ' + ($valid) + ' = ' + ($nextValid) + '; ';
+      if ($thenPresent && $elsePresent) {
+        $ifClause = 'ifClause' + $lvl;
+        out += ' var ' + ($ifClause) + ' = \'else\'; ';
+      } else {
+        $ifClause = '\'else\'';
+      }
+      out += ' } ';
+    }
+    out += ' if (!' + ($valid) + ') {   var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('if') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { failingKeyword: ' + ($ifClause) + ' } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should match "\' + ' + ($ifClause) + ' + \'" schema\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError(vErrors); ';
+      } else {
+        out += ' validate.errors = vErrors; return false; ';
+      }
+    }
+    out += ' }   ';
+    if ($breakOnError) {
+      out += ' else { ';
+    }
+  } else {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  }
+  return out;
+}
+
+},{}],27:[function(require,module,exports){
+'use strict';
+
+//all requires must be explicit because browserify won't work with dynamic requires
+module.exports = {
+  '$ref': require('./ref'),
+  allOf: require('./allOf'),
+  anyOf: require('./anyOf'),
+  '$comment': require('./comment'),
+  const: require('./const'),
+  contains: require('./contains'),
+  dependencies: require('./dependencies'),
+  'enum': require('./enum'),
+  format: require('./format'),
+  'if': require('./if'),
+  items: require('./items'),
+  maximum: require('./_limit'),
+  minimum: require('./_limit'),
+  maxItems: require('./_limitItems'),
+  minItems: require('./_limitItems'),
+  maxLength: require('./_limitLength'),
+  minLength: require('./_limitLength'),
+  maxProperties: require('./_limitProperties'),
+  minProperties: require('./_limitProperties'),
+  multipleOf: require('./multipleOf'),
+  not: require('./not'),
+  oneOf: require('./oneOf'),
+  pattern: require('./pattern'),
+  properties: require('./properties'),
+  propertyNames: require('./propertyNames'),
+  required: require('./required'),
+  uniqueItems: require('./uniqueItems'),
+  validate: require('./validate')
+};
+
+},{"./_limit":13,"./_limitItems":14,"./_limitLength":15,"./_limitProperties":16,"./allOf":17,"./anyOf":18,"./comment":19,"./const":20,"./contains":21,"./dependencies":23,"./enum":24,"./format":25,"./if":26,"./items":28,"./multipleOf":29,"./not":30,"./oneOf":31,"./pattern":32,"./properties":33,"./propertyNames":34,"./ref":35,"./required":36,"./uniqueItems":37,"./validate":38}],28:[function(require,module,exports){
+'use strict';
+module.exports = function generate_items(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $idx = 'i' + $lvl,
+    $dataNxt = $it.dataLevel = it.dataLevel + 1,
+    $nextData = 'data' + $dataNxt,
+    $currentBaseId = it.baseId;
+  out += 'var ' + ($errs) + ' = errors;var ' + ($valid) + ';';
+  if (Array.isArray($schema)) {
+    var $additionalItems = it.schema.additionalItems;
+    if ($additionalItems === false) {
+      out += ' ' + ($valid) + ' = ' + ($data) + '.length <= ' + ($schema.length) + '; ';
+      var $currErrSchemaPath = $errSchemaPath;
+      $errSchemaPath = it.errSchemaPath + '/additionalItems';
+      out += '  if (!' + ($valid) + ') {   ';
+      var $$outStack = $$outStack || [];
+      $$outStack.push(out);
+      out = ''; /* istanbul ignore else */
+      if (it.createErrors !== false) {
+        out += ' { keyword: \'' + ('additionalItems') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schema.length) + ' } ';
+        if (it.opts.messages !== false) {
+          out += ' , message: \'should NOT have more than ' + ($schema.length) + ' items\' ';
+        }
+        if (it.opts.verbose) {
+          out += ' , schema: false , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+        }
+        out += ' } ';
+      } else {
+        out += ' {} ';
+      }
+      var __err = out;
+      out = $$outStack.pop();
+      if (!it.compositeRule && $breakOnError) {
+        /* istanbul ignore if */
+        if (it.async) {
+          out += ' throw new ValidationError([' + (__err) + ']); ';
+        } else {
+          out += ' validate.errors = [' + (__err) + ']; return false; ';
+        }
+      } else {
+        out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+      }
+      out += ' } ';
+      $errSchemaPath = $currErrSchemaPath;
+      if ($breakOnError) {
+        $closingBraces += '}';
+        out += ' else { ';
+      }
+    }
+    var arr1 = $schema;
+    if (arr1) {
+      var $sch, $i = -1,
+        l1 = arr1.length - 1;
+      while ($i < l1) {
+        $sch = arr1[$i += 1];
+        if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+          out += ' ' + ($nextValid) + ' = true; if (' + ($data) + '.length > ' + ($i) + ') { ';
+          var $passData = $data + '[' + $i + ']';
+          $it.schema = $sch;
+          $it.schemaPath = $schemaPath + '[' + $i + ']';
+          $it.errSchemaPath = $errSchemaPath + '/' + $i;
+          $it.errorPath = it.util.getPathExpr(it.errorPath, $i, it.opts.jsonPointers, true);
+          $it.dataPathArr[$dataNxt] = $i;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          out += ' }  ';
+          if ($breakOnError) {
+            out += ' if (' + ($nextValid) + ') { ';
+            $closingBraces += '}';
+          }
+        }
+      }
+    }
+    if (typeof $additionalItems == 'object' && (it.opts.strictKeywords ? (typeof $additionalItems == 'object' && Object.keys($additionalItems).length > 0) || $additionalItems === false : it.util.schemaHasRules($additionalItems, it.RULES.all))) {
+      $it.schema = $additionalItems;
+      $it.schemaPath = it.schemaPath + '.additionalItems';
+      $it.errSchemaPath = it.errSchemaPath + '/additionalItems';
+      out += ' ' + ($nextValid) + ' = true; if (' + ($data) + '.length > ' + ($schema.length) + ') {  for (var ' + ($idx) + ' = ' + ($schema.length) + '; ' + ($idx) + ' < ' + ($data) + '.length; ' + ($idx) + '++) { ';
+      $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+      var $passData = $data + '[' + $idx + ']';
+      $it.dataPathArr[$dataNxt] = $idx;
+      var $code = it.validate($it);
+      $it.baseId = $currentBaseId;
+      if (it.util.varOccurences($code, $nextData) < 2) {
+        out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+      } else {
+        out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+      }
+      if ($breakOnError) {
+        out += ' if (!' + ($nextValid) + ') break; ';
+      }
+      out += ' } }  ';
+      if ($breakOnError) {
+        out += ' if (' + ($nextValid) + ') { ';
+        $closingBraces += '}';
+      }
+    }
+  } else if ((it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all))) {
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += '  for (var ' + ($idx) + ' = ' + (0) + '; ' + ($idx) + ' < ' + ($data) + '.length; ' + ($idx) + '++) { ';
+    $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+    var $passData = $data + '[' + $idx + ']';
+    $it.dataPathArr[$dataNxt] = $idx;
+    var $code = it.validate($it);
+    $it.baseId = $currentBaseId;
+    if (it.util.varOccurences($code, $nextData) < 2) {
+      out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+    } else {
+      out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+    }
+    if ($breakOnError) {
+      out += ' if (!' + ($nextValid) + ') break; ';
+    }
+    out += ' }';
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
+
+},{}],29:[function(require,module,exports){
+'use strict';
+module.exports = function generate_multipleOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  out += 'var division' + ($lvl) + ';if (';
+  if ($isData) {
+    out += ' ' + ($schemaValue) + ' !== undefined && ( typeof ' + ($schemaValue) + ' != \'number\' || ';
+  }
+  out += ' (division' + ($lvl) + ' = ' + ($data) + ' / ' + ($schemaValue) + ', ';
+  if (it.opts.multipleOfPrecision) {
+    out += ' Math.abs(Math.round(division' + ($lvl) + ') - division' + ($lvl) + ') > 1e-' + (it.opts.multipleOfPrecision) + ' ';
+  } else {
+    out += ' division' + ($lvl) + ' !== parseInt(division' + ($lvl) + ') ';
+  }
+  out += ' ) ';
+  if ($isData) {
+    out += '  )  ';
+  }
+  out += ' ) {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('multipleOf') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { multipleOf: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be multiple of ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue);
+      } else {
+        out += '' + ($schemaValue) + '\'';
+      }
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],30:[function(require,module,exports){
+'use strict';
+module.exports = function generate_not(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  if ((it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all))) {
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += ' var ' + ($errs) + ' = errors;  ';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    $it.createErrors = false;
+    var $allErrorsOption;
+    if ($it.opts.allErrors) {
+      $allErrorsOption = $it.opts.allErrors;
+      $it.opts.allErrors = false;
+    }
+    out += ' ' + (it.validate($it)) + ' ';
+    $it.createErrors = true;
+    if ($allErrorsOption) $it.opts.allErrors = $allErrorsOption;
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' if (' + ($nextValid) + ') {   ';
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('not') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should NOT be valid\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    out += ' } else {  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; } ';
+    if (it.opts.allErrors) {
+      out += ' } ';
+    }
+  } else {
+    out += '  var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('not') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should NOT be valid\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if ($breakOnError) {
+      out += ' if (false) { ';
+    }
+  }
+  return out;
+}
+
+},{}],31:[function(require,module,exports){
+'use strict';
+module.exports = function generate_oneOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $currentBaseId = $it.baseId,
+    $prevValid = 'prevValid' + $lvl,
+    $passingSchemas = 'passingSchemas' + $lvl;
+  out += 'var ' + ($errs) + ' = errors , ' + ($prevValid) + ' = false , ' + ($valid) + ' = false , ' + ($passingSchemas) + ' = null; ';
+  var $wasComposite = it.compositeRule;
+  it.compositeRule = $it.compositeRule = true;
+  var arr1 = $schema;
+  if (arr1) {
+    var $sch, $i = -1,
+      l1 = arr1.length - 1;
+    while ($i < l1) {
+      $sch = arr1[$i += 1];
+      if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + '[' + $i + ']';
+        $it.errSchemaPath = $errSchemaPath + '/' + $i;
+        out += '  ' + (it.validate($it)) + ' ';
+        $it.baseId = $currentBaseId;
+      } else {
+        out += ' var ' + ($nextValid) + ' = true; ';
+      }
+      if ($i) {
+        out += ' if (' + ($nextValid) + ' && ' + ($prevValid) + ') { ' + ($valid) + ' = false; ' + ($passingSchemas) + ' = [' + ($passingSchemas) + ', ' + ($i) + ']; } else { ';
+        $closingBraces += '}';
+      }
+      out += ' if (' + ($nextValid) + ') { ' + ($valid) + ' = ' + ($prevValid) + ' = true; ' + ($passingSchemas) + ' = ' + ($i) + '; }';
+    }
+  }
+  it.compositeRule = $it.compositeRule = $wasComposite;
+  out += '' + ($closingBraces) + 'if (!' + ($valid) + ') {   var err =   '; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('oneOf') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { passingSchemas: ' + ($passingSchemas) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should match exactly one schema in oneOf\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError(vErrors); ';
+    } else {
+      out += ' validate.errors = vErrors; return false; ';
+    }
+  }
+  out += '} else {  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; }';
+  if (it.opts.allErrors) {
+    out += ' } ';
+  }
+  return out;
+}
+
+},{}],32:[function(require,module,exports){
+'use strict';
+module.exports = function generate_pattern(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $regexp = $isData ? '(new RegExp(' + $schemaValue + '))' : it.usePattern($schema);
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'string\') || ';
+  }
+  out += ' !' + ($regexp) + '.test(' + ($data) + ') ) {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('pattern') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { pattern:  ';
+    if ($isData) {
+      out += '' + ($schemaValue);
+    } else {
+      out += '' + (it.util.toQuotedString($schema));
+    }
+    out += '  } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should match pattern "';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + (it.util.escapeQuotes($schema));
+      }
+      out += '"\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + (it.util.toQuotedString($schema));
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
+
+},{}],33:[function(require,module,exports){
+'use strict';
+module.exports = function generate_properties(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $key = 'key' + $lvl,
+    $idx = 'idx' + $lvl,
+    $dataNxt = $it.dataLevel = it.dataLevel + 1,
+    $nextData = 'data' + $dataNxt,
+    $dataProperties = 'dataProperties' + $lvl;
+  var $schemaKeys = Object.keys($schema || {}).filter(notProto),
+    $pProperties = it.schema.patternProperties || {},
+    $pPropertyKeys = Object.keys($pProperties).filter(notProto),
+    $aProperties = it.schema.additionalProperties,
+    $someProperties = $schemaKeys.length || $pPropertyKeys.length,
+    $noAdditional = $aProperties === false,
+    $additionalIsSchema = typeof $aProperties == 'object' && Object.keys($aProperties).length,
+    $removeAdditional = it.opts.removeAdditional,
+    $checkAdditional = $noAdditional || $additionalIsSchema || $removeAdditional,
+    $ownProperties = it.opts.ownProperties,
+    $currentBaseId = it.baseId;
+  var $required = it.schema.required;
+  if ($required && !(it.opts.$data && $required.$data) && $required.length < it.opts.loopRequired) {
+    var $requiredHash = it.util.toHash($required);
+  }
+
+  function notProto(p) {
+    return p !== '__proto__';
+  }
+  out += 'var ' + ($errs) + ' = errors;var ' + ($nextValid) + ' = true;';
+  if ($ownProperties) {
+    out += ' var ' + ($dataProperties) + ' = undefined;';
+  }
+  if ($checkAdditional) {
+    if ($ownProperties) {
+      out += ' ' + ($dataProperties) + ' = ' + ($dataProperties) + ' || Object.keys(' + ($data) + '); for (var ' + ($idx) + '=0; ' + ($idx) + '<' + ($dataProperties) + '.length; ' + ($idx) + '++) { var ' + ($key) + ' = ' + ($dataProperties) + '[' + ($idx) + ']; ';
+    } else {
+      out += ' for (var ' + ($key) + ' in ' + ($data) + ') { ';
+    }
+    if ($someProperties) {
+      out += ' var isAdditional' + ($lvl) + ' = !(false ';
+      if ($schemaKeys.length) {
+        if ($schemaKeys.length > 8) {
+          out += ' || validate.schema' + ($schemaPath) + '.hasOwnProperty(' + ($key) + ') ';
+        } else {
+          var arr1 = $schemaKeys;
+          if (arr1) {
+            var $propertyKey, i1 = -1,
+              l1 = arr1.length - 1;
+            while (i1 < l1) {
+              $propertyKey = arr1[i1 += 1];
+              out += ' || ' + ($key) + ' == ' + (it.util.toQuotedString($propertyKey)) + ' ';
+            }
+          }
+        }
+      }
+      if ($pPropertyKeys.length) {
+        var arr2 = $pPropertyKeys;
+        if (arr2) {
+          var $pProperty, $i = -1,
+            l2 = arr2.length - 1;
+          while ($i < l2) {
+            $pProperty = arr2[$i += 1];
+            out += ' || ' + (it.usePattern($pProperty)) + '.test(' + ($key) + ') ';
+          }
+        }
+      }
+      out += ' ); if (isAdditional' + ($lvl) + ') { ';
+    }
+    if ($removeAdditional == 'all') {
+      out += ' delete ' + ($data) + '[' + ($key) + ']; ';
+    } else {
+      var $currentErrorPath = it.errorPath;
+      var $additionalProperty = '\' + ' + $key + ' + \'';
+      if (it.opts._errorDataPathProperty) {
+        it.errorPath = it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+      }
+      if ($noAdditional) {
+        if ($removeAdditional) {
+          out += ' delete ' + ($data) + '[' + ($key) + ']; ';
+        } else {
+          out += ' ' + ($nextValid) + ' = false; ';
+          var $currErrSchemaPath = $errSchemaPath;
+          $errSchemaPath = it.errSchemaPath + '/additionalProperties';
+          var $$outStack = $$outStack || [];
+          $$outStack.push(out);
+          out = ''; /* istanbul ignore else */
+          if (it.createErrors !== false) {
+            out += ' { keyword: \'' + ('additionalProperties') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { additionalProperty: \'' + ($additionalProperty) + '\' } ';
+            if (it.opts.messages !== false) {
+              out += ' , message: \'';
+              if (it.opts._errorDataPathProperty) {
+                out += 'is an invalid additional property';
+              } else {
+                out += 'should NOT have additional properties';
+              }
+              out += '\' ';
+            }
+            if (it.opts.verbose) {
+              out += ' , schema: false , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+            }
+            out += ' } ';
+          } else {
+            out += ' {} ';
+          }
+          var __err = out;
+          out = $$outStack.pop();
+          if (!it.compositeRule && $breakOnError) {
+            /* istanbul ignore if */
+            if (it.async) {
+              out += ' throw new ValidationError([' + (__err) + ']); ';
+            } else {
+              out += ' validate.errors = [' + (__err) + ']; return false; ';
+            }
+          } else {
+            out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+          }
+          $errSchemaPath = $currErrSchemaPath;
+          if ($breakOnError) {
+            out += ' break; ';
+          }
+        }
+      } else if ($additionalIsSchema) {
+        if ($removeAdditional == 'failing') {
+          out += ' var ' + ($errs) + ' = errors;  ';
+          var $wasComposite = it.compositeRule;
+          it.compositeRule = $it.compositeRule = true;
+          $it.schema = $aProperties;
+          $it.schemaPath = it.schemaPath + '.additionalProperties';
+          $it.errSchemaPath = it.errSchemaPath + '/additionalProperties';
+          $it.errorPath = it.opts._errorDataPathProperty ? it.errorPath : it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+          var $passData = $data + '[' + $key + ']';
+          $it.dataPathArr[$dataNxt] = $key;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          out += ' if (!' + ($nextValid) + ') { errors = ' + ($errs) + '; if (validate.errors !== null) { if (errors) validate.errors.length = errors; else validate.errors = null; } delete ' + ($data) + '[' + ($key) + ']; }  ';
+          it.compositeRule = $it.compositeRule = $wasComposite;
+        } else {
+          $it.schema = $aProperties;
+          $it.schemaPath = it.schemaPath + '.additionalProperties';
+          $it.errSchemaPath = it.errSchemaPath + '/additionalProperties';
+          $it.errorPath = it.opts._errorDataPathProperty ? it.errorPath : it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+          var $passData = $data + '[' + $key + ']';
+          $it.dataPathArr[$dataNxt] = $key;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          if ($breakOnError) {
+            out += ' if (!' + ($nextValid) + ') break; ';
+          }
+        }
+      }
+      it.errorPath = $currentErrorPath;
+    }
+    if ($someProperties) {
+      out += ' } ';
+    }
+    out += ' }  ';
+    if ($breakOnError) {
+      out += ' if (' + ($nextValid) + ') { ';
+      $closingBraces += '}';
+    }
+  }
+  var $useDefaults = it.opts.useDefaults && !it.compositeRule;
+  if ($schemaKeys.length) {
+    var arr3 = $schemaKeys;
+    if (arr3) {
+      var $propertyKey, i3 = -1,
+        l3 = arr3.length - 1;
+      while (i3 < l3) {
+        $propertyKey = arr3[i3 += 1];
+        var $sch = $schema[$propertyKey];
+        if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+          var $prop = it.util.getProperty($propertyKey),
+            $passData = $data + $prop,
+            $hasDefault = $useDefaults && $sch.default !== undefined;
+          $it.schema = $sch;
+          $it.schemaPath = $schemaPath + $prop;
+          $it.errSchemaPath = $errSchemaPath + '/' + it.util.escapeFragment($propertyKey);
+          $it.errorPath = it.util.getPath(it.errorPath, $propertyKey, it.opts.jsonPointers);
+          $it.dataPathArr[$dataNxt] = it.util.toQuotedString($propertyKey);
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            $code = it.util.varReplace($code, $nextData, $passData);
+            var $useData = $passData;
+          } else {
+            var $useData = $nextData;
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ';
+          }
+          if ($hasDefault) {
+            out += ' ' + ($code) + ' ';
+          } else {
+            if ($requiredHash && $requiredHash[$propertyKey]) {
+              out += ' if ( ' + ($useData) + ' === undefined ';
+              if ($ownProperties) {
+                out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+              }
+              out += ') { ' + ($nextValid) + ' = false; ';
+              var $currentErrorPath = it.errorPath,
+                $currErrSchemaPath = $errSchemaPath,
+                $missingProperty = it.util.escapeQuotes($propertyKey);
+              if (it.opts._errorDataPathProperty) {
+                it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+              }
+              $errSchemaPath = it.errSchemaPath + '/required';
+              var $$outStack = $$outStack || [];
+              $$outStack.push(out);
+              out = ''; /* istanbul ignore else */
+              if (it.createErrors !== false) {
+                out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+                if (it.opts.messages !== false) {
+                  out += ' , message: \'';
+                  if (it.opts._errorDataPathProperty) {
+                    out += 'is a required property';
+                  } else {
+                    out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+                  }
+                  out += '\' ';
+                }
+                if (it.opts.verbose) {
+                  out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+                }
+                out += ' } ';
+              } else {
+                out += ' {} ';
+              }
+              var __err = out;
+              out = $$outStack.pop();
+              if (!it.compositeRule && $breakOnError) {
+                /* istanbul ignore if */
+                if (it.async) {
+                  out += ' throw new ValidationError([' + (__err) + ']); ';
+                } else {
+                  out += ' validate.errors = [' + (__err) + ']; return false; ';
+                }
+              } else {
+                out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+              }
+              $errSchemaPath = $currErrSchemaPath;
+              it.errorPath = $currentErrorPath;
+              out += ' } else { ';
+            } else {
+              if ($breakOnError) {
+                out += ' if ( ' + ($useData) + ' === undefined ';
+                if ($ownProperties) {
+                  out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+                }
+                out += ') { ' + ($nextValid) + ' = true; } else { ';
+              } else {
+                out += ' if (' + ($useData) + ' !== undefined ';
+                if ($ownProperties) {
+                  out += ' &&   Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+                }
+                out += ' ) { ';
+              }
+            }
+            out += ' ' + ($code) + ' } ';
+          }
+        }
+        if ($breakOnError) {
+          out += ' if (' + ($nextValid) + ') { ';
+          $closingBraces += '}';
+        }
+      }
+    }
+  }
+  if ($pPropertyKeys.length) {
+    var arr4 = $pPropertyKeys;
+    if (arr4) {
+      var $pProperty, i4 = -1,
+        l4 = arr4.length - 1;
+      while (i4 < l4) {
+        $pProperty = arr4[i4 += 1];
+        var $sch = $pProperties[$pProperty];
+        if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+          $it.schema = $sch;
+          $it.schemaPath = it.schemaPath + '.patternProperties' + it.util.getProperty($pProperty);
+          $it.errSchemaPath = it.errSchemaPath + '/patternProperties/' + it.util.escapeFragment($pProperty);
+          if ($ownProperties) {
+            out += ' ' + ($dataProperties) + ' = ' + ($dataProperties) + ' || Object.keys(' + ($data) + '); for (var ' + ($idx) + '=0; ' + ($idx) + '<' + ($dataProperties) + '.length; ' + ($idx) + '++) { var ' + ($key) + ' = ' + ($dataProperties) + '[' + ($idx) + ']; ';
+          } else {
+            out += ' for (var ' + ($key) + ' in ' + ($data) + ') { ';
+          }
+          out += ' if (' + (it.usePattern($pProperty)) + '.test(' + ($key) + ')) { ';
+          $it.errorPath = it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+          var $passData = $data + '[' + $key + ']';
+          $it.dataPathArr[$dataNxt] = $key;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          if ($breakOnError) {
+            out += ' if (!' + ($nextValid) + ') break; ';
+          }
+          out += ' } ';
+          if ($breakOnError) {
+            out += ' else ' + ($nextValid) + ' = true; ';
+          }
+          out += ' }  ';
+          if ($breakOnError) {
+            out += ' if (' + ($nextValid) + ') { ';
+            $closingBraces += '}';
+          }
+        }
+      }
+    }
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
+
+},{}],34:[function(require,module,exports){
+'use strict';
+module.exports = function generate_propertyNames(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  out += 'var ' + ($errs) + ' = errors;';
+  if ((it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all))) {
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    var $key = 'key' + $lvl,
+      $idx = 'idx' + $lvl,
+      $i = 'i' + $lvl,
+      $invalidName = '\' + ' + $key + ' + \'',
+      $dataNxt = $it.dataLevel = it.dataLevel + 1,
+      $nextData = 'data' + $dataNxt,
+      $dataProperties = 'dataProperties' + $lvl,
+      $ownProperties = it.opts.ownProperties,
+      $currentBaseId = it.baseId;
+    if ($ownProperties) {
+      out += ' var ' + ($dataProperties) + ' = undefined; ';
+    }
+    if ($ownProperties) {
+      out += ' ' + ($dataProperties) + ' = ' + ($dataProperties) + ' || Object.keys(' + ($data) + '); for (var ' + ($idx) + '=0; ' + ($idx) + '<' + ($dataProperties) + '.length; ' + ($idx) + '++) { var ' + ($key) + ' = ' + ($dataProperties) + '[' + ($idx) + ']; ';
+    } else {
+      out += ' for (var ' + ($key) + ' in ' + ($data) + ') { ';
+    }
+    out += ' var startErrs' + ($lvl) + ' = errors; ';
+    var $passData = $key;
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    var $code = it.validate($it);
+    $it.baseId = $currentBaseId;
+    if (it.util.varOccurences($code, $nextData) < 2) {
+      out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+    } else {
+      out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+    }
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' if (!' + ($nextValid) + ') { for (var ' + ($i) + '=startErrs' + ($lvl) + '; ' + ($i) + '<errors; ' + ($i) + '++) { vErrors[' + ($i) + '].propertyName = ' + ($key) + '; }   var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('propertyNames') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { propertyName: \'' + ($invalidName) + '\' } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'property name \\\'' + ($invalidName) + '\\\' is invalid\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError(vErrors); ';
+      } else {
+        out += ' validate.errors = vErrors; return false; ';
+      }
+    }
+    if ($breakOnError) {
+      out += ' break; ';
+    }
+    out += ' } }';
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
+
+},{}],35:[function(require,module,exports){
+'use strict';
+module.exports = function generate_ref(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $async, $refCode;
+  if ($schema == '#' || $schema == '#/') {
+    if (it.isRoot) {
+      $async = it.async;
+      $refCode = 'validate';
+    } else {
+      $async = it.root.schema.$async === true;
+      $refCode = 'root.refVal[0]';
+    }
+  } else {
+    var $refVal = it.resolveRef(it.baseId, $schema, it.isRoot);
+    if ($refVal === undefined) {
+      var $message = it.MissingRefError.message(it.baseId, $schema);
+      if (it.opts.missingRefs == 'fail') {
+        it.logger.error($message);
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('$ref') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { ref: \'' + (it.util.escapeQuotes($schema)) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'can\\\'t resolve reference ' + (it.util.escapeQuotes($schema)) + '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: ' + (it.util.toQuotedString($schema)) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        if ($breakOnError) {
+          out += ' if (false) { ';
+        }
+      } else if (it.opts.missingRefs == 'ignore') {
+        it.logger.warn($message);
+        if ($breakOnError) {
+          out += ' if (true) { ';
+        }
+      } else {
+        throw new it.MissingRefError(it.baseId, $schema, $message);
+      }
+    } else if ($refVal.inline) {
+      var $it = it.util.copy(it);
+      $it.level++;
+      var $nextValid = 'valid' + $it.level;
+      $it.schema = $refVal.schema;
+      $it.schemaPath = '';
+      $it.errSchemaPath = $schema;
+      var $code = it.validate($it).replace(/validate\.schema/g, $refVal.code);
+      out += ' ' + ($code) + ' ';
+      if ($breakOnError) {
+        out += ' if (' + ($nextValid) + ') { ';
+      }
+    } else {
+      $async = $refVal.$async === true || (it.async && $refVal.$async !== false);
+      $refCode = $refVal.code;
+    }
+  }
+  if ($refCode) {
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = '';
+    if (it.opts.passContext) {
+      out += ' ' + ($refCode) + '.call(this, ';
+    } else {
+      out += ' ' + ($refCode) + '( ';
+    }
+    out += ' ' + ($data) + ', (dataPath || \'\')';
+    if (it.errorPath != '""') {
+      out += ' + ' + (it.errorPath);
+    }
+    var $parentData = $dataLvl ? 'data' + (($dataLvl - 1) || '') : 'parentData',
+      $parentDataProperty = $dataLvl ? it.dataPathArr[$dataLvl] : 'parentDataProperty';
+    out += ' , ' + ($parentData) + ' , ' + ($parentDataProperty) + ', rootData)  ';
+    var __callValidate = out;
+    out = $$outStack.pop();
+    if ($async) {
+      if (!it.async) throw new Error('async schema referenced by sync schema');
+      if ($breakOnError) {
+        out += ' var ' + ($valid) + '; ';
+      }
+      out += ' try { await ' + (__callValidate) + '; ';
+      if ($breakOnError) {
+        out += ' ' + ($valid) + ' = true; ';
+      }
+      out += ' } catch (e) { if (!(e instanceof ValidationError)) throw e; if (vErrors === null) vErrors = e.errors; else vErrors = vErrors.concat(e.errors); errors = vErrors.length; ';
+      if ($breakOnError) {
+        out += ' ' + ($valid) + ' = false; ';
+      }
+      out += ' } ';
+      if ($breakOnError) {
+        out += ' if (' + ($valid) + ') { ';
+      }
+    } else {
+      out += ' if (!' + (__callValidate) + ') { if (vErrors === null) vErrors = ' + ($refCode) + '.errors; else vErrors = vErrors.concat(' + ($refCode) + '.errors); errors = vErrors.length; } ';
+      if ($breakOnError) {
+        out += ' else { ';
+      }
+    }
+  }
+  return out;
+}
+
+},{}],36:[function(require,module,exports){
+'use strict';
+module.exports = function generate_required(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $vSchema = 'schema' + $lvl;
+  if (!$isData) {
+    if ($schema.length < it.opts.loopRequired && it.schema.properties && Object.keys(it.schema.properties).length) {
+      var $required = [];
+      var arr1 = $schema;
+      if (arr1) {
+        var $property, i1 = -1,
+          l1 = arr1.length - 1;
+        while (i1 < l1) {
+          $property = arr1[i1 += 1];
+          var $propertySch = it.schema.properties[$property];
+          if (!($propertySch && (it.opts.strictKeywords ? (typeof $propertySch == 'object' && Object.keys($propertySch).length > 0) || $propertySch === false : it.util.schemaHasRules($propertySch, it.RULES.all)))) {
+            $required[$required.length] = $property;
+          }
+        }
+      }
+    } else {
+      var $required = $schema;
+    }
+  }
+  if ($isData || $required.length) {
+    var $currentErrorPath = it.errorPath,
+      $loopRequired = $isData || $required.length >= it.opts.loopRequired,
+      $ownProperties = it.opts.ownProperties;
+    if ($breakOnError) {
+      out += ' var missing' + ($lvl) + '; ';
+      if ($loopRequired) {
+        if (!$isData) {
+          out += ' var ' + ($vSchema) + ' = validate.schema' + ($schemaPath) + '; ';
+        }
+        var $i = 'i' + $lvl,
+          $propertyPath = 'schema' + $lvl + '[' + $i + ']',
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.util.getPathExpr($currentErrorPath, $propertyPath, it.opts.jsonPointers);
+        }
+        out += ' var ' + ($valid) + ' = true; ';
+        if ($isData) {
+          out += ' if (schema' + ($lvl) + ' === undefined) ' + ($valid) + ' = true; else if (!Array.isArray(schema' + ($lvl) + ')) ' + ($valid) + ' = false; else {';
+        }
+        out += ' for (var ' + ($i) + ' = 0; ' + ($i) + ' < ' + ($vSchema) + '.length; ' + ($i) + '++) { ' + ($valid) + ' = ' + ($data) + '[' + ($vSchema) + '[' + ($i) + ']] !== undefined ';
+        if ($ownProperties) {
+          out += ' &&   Object.prototype.hasOwnProperty.call(' + ($data) + ', ' + ($vSchema) + '[' + ($i) + ']) ';
+        }
+        out += '; if (!' + ($valid) + ') break; } ';
+        if ($isData) {
+          out += '  }  ';
+        }
+        out += '  if (!' + ($valid) + ') {   ';
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'';
+            if (it.opts._errorDataPathProperty) {
+              out += 'is a required property';
+            } else {
+              out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        out += ' } else { ';
+      } else {
+        out += ' if ( ';
+        var arr2 = $required;
+        if (arr2) {
+          var $propertyKey, $i = -1,
+            l2 = arr2.length - 1;
+          while ($i < l2) {
+            $propertyKey = arr2[$i += 1];
+            if ($i) {
+              out += ' || ';
+            }
+            var $prop = it.util.getProperty($propertyKey),
+              $useData = $data + $prop;
+            out += ' ( ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') && (missing' + ($lvl) + ' = ' + (it.util.toQuotedString(it.opts.jsonPointers ? $propertyKey : $prop)) + ') ) ';
+          }
+        }
+        out += ') {  ';
+        var $propertyPath = 'missing' + $lvl,
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.opts.jsonPointers ? it.util.getPathExpr($currentErrorPath, $propertyPath, true) : $currentErrorPath + ' + ' + $propertyPath;
+        }
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'';
+            if (it.opts._errorDataPathProperty) {
+              out += 'is a required property';
+            } else {
+              out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        out += ' } else { ';
+      }
+    } else {
+      if ($loopRequired) {
+        if (!$isData) {
+          out += ' var ' + ($vSchema) + ' = validate.schema' + ($schemaPath) + '; ';
+        }
+        var $i = 'i' + $lvl,
+          $propertyPath = 'schema' + $lvl + '[' + $i + ']',
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.util.getPathExpr($currentErrorPath, $propertyPath, it.opts.jsonPointers);
+        }
+        if ($isData) {
+          out += ' if (' + ($vSchema) + ' && !Array.isArray(' + ($vSchema) + ')) {  var err =   '; /* istanbul ignore else */
+          if (it.createErrors !== false) {
+            out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+            if (it.opts.messages !== false) {
+              out += ' , message: \'';
+              if (it.opts._errorDataPathProperty) {
+                out += 'is a required property';
+              } else {
+                out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+              }
+              out += '\' ';
+            }
+            if (it.opts.verbose) {
+              out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+            }
+            out += ' } ';
+          } else {
+            out += ' {} ';
+          }
+          out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } else if (' + ($vSchema) + ' !== undefined) { ';
+        }
+        out += ' for (var ' + ($i) + ' = 0; ' + ($i) + ' < ' + ($vSchema) + '.length; ' + ($i) + '++) { if (' + ($data) + '[' + ($vSchema) + '[' + ($i) + ']] === undefined ';
+        if ($ownProperties) {
+          out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', ' + ($vSchema) + '[' + ($i) + ']) ';
+        }
+        out += ') {  var err =   '; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'';
+            if (it.opts._errorDataPathProperty) {
+              out += 'is a required property';
+            } else {
+              out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } } ';
+        if ($isData) {
+          out += '  }  ';
+        }
+      } else {
+        var arr3 = $required;
+        if (arr3) {
+          var $propertyKey, i3 = -1,
+            l3 = arr3.length - 1;
+          while (i3 < l3) {
+            $propertyKey = arr3[i3 += 1];
+            var $prop = it.util.getProperty($propertyKey),
+              $missingProperty = it.util.escapeQuotes($propertyKey),
+              $useData = $data + $prop;
+            if (it.opts._errorDataPathProperty) {
+              it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+            }
+            out += ' if ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') {  var err =   '; /* istanbul ignore else */
+            if (it.createErrors !== false) {
+              out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+              if (it.opts.messages !== false) {
+                out += ' , message: \'';
+                if (it.opts._errorDataPathProperty) {
+                  out += 'is a required property';
+                } else {
+                  out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+                }
+                out += '\' ';
+              }
+              if (it.opts.verbose) {
+                out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+              }
+              out += ' } ';
+            } else {
+              out += ' {} ';
+            }
+            out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } ';
+          }
+        }
+      }
+    }
+    it.errorPath = $currentErrorPath;
+  } else if ($breakOnError) {
+    out += ' if (true) {';
+  }
+  return out;
+}
+
+},{}],37:[function(require,module,exports){
+'use strict';
+module.exports = function generate_uniqueItems(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (($schema || $isData) && it.opts.uniqueItems !== false) {
+    if ($isData) {
+      out += ' var ' + ($valid) + '; if (' + ($schemaValue) + ' === false || ' + ($schemaValue) + ' === undefined) ' + ($valid) + ' = true; else if (typeof ' + ($schemaValue) + ' != \'boolean\') ' + ($valid) + ' = false; else { ';
+    }
+    out += ' var i = ' + ($data) + '.length , ' + ($valid) + ' = true , j; if (i > 1) { ';
+    var $itemType = it.schema.items && it.schema.items.type,
+      $typeIsArray = Array.isArray($itemType);
+    if (!$itemType || $itemType == 'object' || $itemType == 'array' || ($typeIsArray && ($itemType.indexOf('object') >= 0 || $itemType.indexOf('array') >= 0))) {
+      out += ' outer: for (;i--;) { for (j = i; j--;) { if (equal(' + ($data) + '[i], ' + ($data) + '[j])) { ' + ($valid) + ' = false; break outer; } } } ';
+    } else {
+      out += ' var itemIndices = {}, item; for (;i--;) { var item = ' + ($data) + '[i]; ';
+      var $method = 'checkDataType' + ($typeIsArray ? 's' : '');
+      out += ' if (' + (it.util[$method]($itemType, 'item', it.opts.strictNumbers, true)) + ') continue; ';
+      if ($typeIsArray) {
+        out += ' if (typeof item == \'string\') item = \'"\' + item; ';
+      }
+      out += ' if (typeof itemIndices[item] == \'number\') { ' + ($valid) + ' = false; j = itemIndices[item]; break; } itemIndices[item] = i; } ';
+    }
+    out += ' } ';
+    if ($isData) {
+      out += '  }  ';
+    }
+    out += ' if (!' + ($valid) + ') {   ';
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('uniqueItems') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { i: i, j: j } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should NOT have duplicate items (items ## \' + j + \' and \' + i + \' are identical)\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema:  ';
+        if ($isData) {
+          out += 'validate.schema' + ($schemaPath);
+        } else {
+          out += '' + ($schema);
+        }
+        out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    out += ' } ';
+    if ($breakOnError) {
+      out += ' else { ';
+    }
+  } else {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  }
+  return out;
+}
+
+},{}],38:[function(require,module,exports){
+'use strict';
+module.exports = function generate_validate(it, $keyword, $ruleType) {
+  var out = '';
+  var $async = it.schema.$async === true,
+    $refKeywords = it.util.schemaHasRulesExcept(it.schema, it.RULES.all, '$ref'),
+    $id = it.self._getId(it.schema);
+  if (it.opts.strictKeywords) {
+    var $unknownKwd = it.util.schemaUnknownRules(it.schema, it.RULES.keywords);
+    if ($unknownKwd) {
+      var $keywordsMsg = 'unknown keyword: ' + $unknownKwd;
+      if (it.opts.strictKeywords === 'log') it.logger.warn($keywordsMsg);
+      else throw new Error($keywordsMsg);
+    }
+  }
+  if (it.isTop) {
+    out += ' var validate = ';
+    if ($async) {
+      it.async = true;
+      out += 'async ';
+    }
+    out += 'function(data, dataPath, parentData, parentDataProperty, rootData) { \'use strict\'; ';
+    if ($id && (it.opts.sourceCode || it.opts.processCode)) {
+      out += ' ' + ('/\*# sourceURL=' + $id + ' */') + ' ';
+    }
+  }
+  if (typeof it.schema == 'boolean' || !($refKeywords || it.schema.$ref)) {
+    var $keyword = 'false schema';
+    var $lvl = it.level;
+    var $dataLvl = it.dataLevel;
+    var $schema = it.schema[$keyword];
+    var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+    var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+    var $breakOnError = !it.opts.allErrors;
+    var $errorKeyword;
+    var $data = 'data' + ($dataLvl || '');
+    var $valid = 'valid' + $lvl;
+    if (it.schema === false) {
+      if (it.isTop) {
+        $breakOnError = true;
+      } else {
+        out += ' var ' + ($valid) + ' = false; ';
+      }
+      var $$outStack = $$outStack || [];
+      $$outStack.push(out);
+      out = ''; /* istanbul ignore else */
+      if (it.createErrors !== false) {
+        out += ' { keyword: \'' + ($errorKeyword || 'false schema') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+        if (it.opts.messages !== false) {
+          out += ' , message: \'boolean schema is false\' ';
+        }
+        if (it.opts.verbose) {
+          out += ' , schema: false , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+        }
+        out += ' } ';
+      } else {
+        out += ' {} ';
+      }
+      var __err = out;
+      out = $$outStack.pop();
+      if (!it.compositeRule && $breakOnError) {
+        /* istanbul ignore if */
+        if (it.async) {
+          out += ' throw new ValidationError([' + (__err) + ']); ';
+        } else {
+          out += ' validate.errors = [' + (__err) + ']; return false; ';
+        }
+      } else {
+        out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+      }
+    } else {
+      if (it.isTop) {
+        if ($async) {
+          out += ' return data; ';
+        } else {
+          out += ' validate.errors = null; return true; ';
+        }
+      } else {
+        out += ' var ' + ($valid) + ' = true; ';
+      }
+    }
+    if (it.isTop) {
+      out += ' }; return validate; ';
+    }
+    return out;
+  }
+  if (it.isTop) {
+    var $top = it.isTop,
+      $lvl = it.level = 0,
+      $dataLvl = it.dataLevel = 0,
+      $data = 'data';
+    it.rootId = it.resolve.fullPath(it.self._getId(it.root.schema));
+    it.baseId = it.baseId || it.rootId;
+    delete it.isTop;
+    it.dataPathArr = [""];
+    if (it.schema.default !== undefined && it.opts.useDefaults && it.opts.strictDefaults) {
+      var $defaultMsg = 'default is ignored in the schema root';
+      if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+      else throw new Error($defaultMsg);
+    }
+    out += ' var vErrors = null; ';
+    out += ' var errors = 0;     ';
+    out += ' if (rootData === undefined) rootData = data; ';
+  } else {
+    var $lvl = it.level,
+      $dataLvl = it.dataLevel,
+      $data = 'data' + ($dataLvl || '');
+    if ($id) it.baseId = it.resolve.url(it.baseId, $id);
+    if ($async && !it.async) throw new Error('async schema in sync schema');
+    out += ' var errs_' + ($lvl) + ' = errors;';
+  }
+  var $valid = 'valid' + $lvl,
+    $breakOnError = !it.opts.allErrors,
+    $closingBraces1 = '',
+    $closingBraces2 = '';
+  var $errorKeyword;
+  var $typeSchema = it.schema.type,
+    $typeIsArray = Array.isArray($typeSchema);
+  if ($typeSchema && it.opts.nullable && it.schema.nullable === true) {
+    if ($typeIsArray) {
+      if ($typeSchema.indexOf('null') == -1) $typeSchema = $typeSchema.concat('null');
+    } else if ($typeSchema != 'null') {
+      $typeSchema = [$typeSchema, 'null'];
+      $typeIsArray = true;
+    }
+  }
+  if ($typeIsArray && $typeSchema.length == 1) {
+    $typeSchema = $typeSchema[0];
+    $typeIsArray = false;
+  }
+  if (it.schema.$ref && $refKeywords) {
+    if (it.opts.extendRefs == 'fail') {
+      throw new Error('$ref: validation keywords used in schema at path "' + it.errSchemaPath + '" (see option extendRefs)');
+    } else if (it.opts.extendRefs !== true) {
+      $refKeywords = false;
+      it.logger.warn('$ref: keywords ignored in schema at path "' + it.errSchemaPath + '"');
+    }
+  }
+  if (it.schema.$comment && it.opts.$comment) {
+    out += ' ' + (it.RULES.all.$comment.code(it, '$comment'));
+  }
+  if ($typeSchema) {
+    if (it.opts.coerceTypes) {
+      var $coerceToTypes = it.util.coerceToTypes(it.opts.coerceTypes, $typeSchema);
+    }
+    var $rulesGroup = it.RULES.types[$typeSchema];
+    if ($coerceToTypes || $typeIsArray || $rulesGroup === true || ($rulesGroup && !$shouldUseGroup($rulesGroup))) {
+      var $schemaPath = it.schemaPath + '.type',
+        $errSchemaPath = it.errSchemaPath + '/type';
+      var $schemaPath = it.schemaPath + '.type',
+        $errSchemaPath = it.errSchemaPath + '/type',
+        $method = $typeIsArray ? 'checkDataTypes' : 'checkDataType';
+      out += ' if (' + (it.util[$method]($typeSchema, $data, it.opts.strictNumbers, true)) + ') { ';
+      if ($coerceToTypes) {
+        var $dataType = 'dataType' + $lvl,
+          $coerced = 'coerced' + $lvl;
+        out += ' var ' + ($dataType) + ' = typeof ' + ($data) + '; var ' + ($coerced) + ' = undefined; ';
+        if (it.opts.coerceTypes == 'array') {
+          out += ' if (' + ($dataType) + ' == \'object\' && Array.isArray(' + ($data) + ') && ' + ($data) + '.length == 1) { ' + ($data) + ' = ' + ($data) + '[0]; ' + ($dataType) + ' = typeof ' + ($data) + '; if (' + (it.util.checkDataType(it.schema.type, $data, it.opts.strictNumbers)) + ') ' + ($coerced) + ' = ' + ($data) + '; } ';
+        }
+        out += ' if (' + ($coerced) + ' !== undefined) ; ';
+        var arr1 = $coerceToTypes;
+        if (arr1) {
+          var $type, $i = -1,
+            l1 = arr1.length - 1;
+          while ($i < l1) {
+            $type = arr1[$i += 1];
+            if ($type == 'string') {
+              out += ' else if (' + ($dataType) + ' == \'number\' || ' + ($dataType) + ' == \'boolean\') ' + ($coerced) + ' = \'\' + ' + ($data) + '; else if (' + ($data) + ' === null) ' + ($coerced) + ' = \'\'; ';
+            } else if ($type == 'number' || $type == 'integer') {
+              out += ' else if (' + ($dataType) + ' == \'boolean\' || ' + ($data) + ' === null || (' + ($dataType) + ' == \'string\' && ' + ($data) + ' && ' + ($data) + ' == +' + ($data) + ' ';
+              if ($type == 'integer') {
+                out += ' && !(' + ($data) + ' % 1)';
+              }
+              out += ')) ' + ($coerced) + ' = +' + ($data) + '; ';
+            } else if ($type == 'boolean') {
+              out += ' else if (' + ($data) + ' === \'false\' || ' + ($data) + ' === 0 || ' + ($data) + ' === null) ' + ($coerced) + ' = false; else if (' + ($data) + ' === \'true\' || ' + ($data) + ' === 1) ' + ($coerced) + ' = true; ';
+            } else if ($type == 'null') {
+              out += ' else if (' + ($data) + ' === \'\' || ' + ($data) + ' === 0 || ' + ($data) + ' === false) ' + ($coerced) + ' = null; ';
+            } else if (it.opts.coerceTypes == 'array' && $type == 'array') {
+              out += ' else if (' + ($dataType) + ' == \'string\' || ' + ($dataType) + ' == \'number\' || ' + ($dataType) + ' == \'boolean\' || ' + ($data) + ' == null) ' + ($coerced) + ' = [' + ($data) + ']; ';
+            }
+          }
+        }
+        out += ' else {   ';
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ($errorKeyword || 'type') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { type: \'';
+          if ($typeIsArray) {
+            out += '' + ($typeSchema.join(","));
+          } else {
+            out += '' + ($typeSchema);
+          }
+          out += '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'should be ';
+            if ($typeIsArray) {
+              out += '' + ($typeSchema.join(","));
+            } else {
+              out += '' + ($typeSchema);
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        out += ' } if (' + ($coerced) + ' !== undefined) {  ';
+        var $parentData = $dataLvl ? 'data' + (($dataLvl - 1) || '') : 'parentData',
+          $parentDataProperty = $dataLvl ? it.dataPathArr[$dataLvl] : 'parentDataProperty';
+        out += ' ' + ($data) + ' = ' + ($coerced) + '; ';
+        if (!$dataLvl) {
+          out += 'if (' + ($parentData) + ' !== undefined)';
+        }
+        out += ' ' + ($parentData) + '[' + ($parentDataProperty) + '] = ' + ($coerced) + '; } ';
+      } else {
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ($errorKeyword || 'type') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { type: \'';
+          if ($typeIsArray) {
+            out += '' + ($typeSchema.join(","));
+          } else {
+            out += '' + ($typeSchema);
+          }
+          out += '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'should be ';
+            if ($typeIsArray) {
+              out += '' + ($typeSchema.join(","));
+            } else {
+              out += '' + ($typeSchema);
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+      }
+      out += ' } ';
+    }
+  }
+  if (it.schema.$ref && !$refKeywords) {
+    out += ' ' + (it.RULES.all.$ref.code(it, '$ref')) + ' ';
+    if ($breakOnError) {
+      out += ' } if (errors === ';
+      if ($top) {
+        out += '0';
+      } else {
+        out += 'errs_' + ($lvl);
+      }
+      out += ') { ';
+      $closingBraces2 += '}';
+    }
+  } else {
+    var arr2 = it.RULES;
+    if (arr2) {
+      var $rulesGroup, i2 = -1,
+        l2 = arr2.length - 1;
+      while (i2 < l2) {
+        $rulesGroup = arr2[i2 += 1];
+        if ($shouldUseGroup($rulesGroup)) {
+          if ($rulesGroup.type) {
+            out += ' if (' + (it.util.checkDataType($rulesGroup.type, $data, it.opts.strictNumbers)) + ') { ';
+          }
+          if (it.opts.useDefaults) {
+            if ($rulesGroup.type == 'object' && it.schema.properties) {
+              var $schema = it.schema.properties,
+                $schemaKeys = Object.keys($schema);
+              var arr3 = $schemaKeys;
+              if (arr3) {
+                var $propertyKey, i3 = -1,
+                  l3 = arr3.length - 1;
+                while (i3 < l3) {
+                  $propertyKey = arr3[i3 += 1];
+                  var $sch = $schema[$propertyKey];
+                  if ($sch.default !== undefined) {
+                    var $passData = $data + it.util.getProperty($propertyKey);
+                    if (it.compositeRule) {
+                      if (it.opts.strictDefaults) {
+                        var $defaultMsg = 'default is ignored for: ' + $passData;
+                        if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+                        else throw new Error($defaultMsg);
+                      }
+                    } else {
+                      out += ' if (' + ($passData) + ' === undefined ';
+                      if (it.opts.useDefaults == 'empty') {
+                        out += ' || ' + ($passData) + ' === null || ' + ($passData) + ' === \'\' ';
+                      }
+                      out += ' ) ' + ($passData) + ' = ';
+                      if (it.opts.useDefaults == 'shared') {
+                        out += ' ' + (it.useDefault($sch.default)) + ' ';
+                      } else {
+                        out += ' ' + (JSON.stringify($sch.default)) + ' ';
+                      }
+                      out += '; ';
+                    }
+                  }
+                }
+              }
+            } else if ($rulesGroup.type == 'array' && Array.isArray(it.schema.items)) {
+              var arr4 = it.schema.items;
+              if (arr4) {
+                var $sch, $i = -1,
+                  l4 = arr4.length - 1;
+                while ($i < l4) {
+                  $sch = arr4[$i += 1];
+                  if ($sch.default !== undefined) {
+                    var $passData = $data + '[' + $i + ']';
+                    if (it.compositeRule) {
+                      if (it.opts.strictDefaults) {
+                        var $defaultMsg = 'default is ignored for: ' + $passData;
+                        if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+                        else throw new Error($defaultMsg);
+                      }
+                    } else {
+                      out += ' if (' + ($passData) + ' === undefined ';
+                      if (it.opts.useDefaults == 'empty') {
+                        out += ' || ' + ($passData) + ' === null || ' + ($passData) + ' === \'\' ';
+                      }
+                      out += ' ) ' + ($passData) + ' = ';
+                      if (it.opts.useDefaults == 'shared') {
+                        out += ' ' + (it.useDefault($sch.default)) + ' ';
+                      } else {
+                        out += ' ' + (JSON.stringify($sch.default)) + ' ';
+                      }
+                      out += '; ';
+                    }
+                  }
+                }
+              }
+            }
+          }
+          var arr5 = $rulesGroup.rules;
+          if (arr5) {
+            var $rule, i5 = -1,
+              l5 = arr5.length - 1;
+            while (i5 < l5) {
+              $rule = arr5[i5 += 1];
+              if ($shouldUseRule($rule)) {
+                var $code = $rule.code(it, $rule.keyword, $rulesGroup.type);
+                if ($code) {
+                  out += ' ' + ($code) + ' ';
+                  if ($breakOnError) {
+                    $closingBraces1 += '}';
+                  }
+                }
+              }
+            }
+          }
+          if ($breakOnError) {
+            out += ' ' + ($closingBraces1) + ' ';
+            $closingBraces1 = '';
+          }
+          if ($rulesGroup.type) {
+            out += ' } ';
+            if ($typeSchema && $typeSchema === $rulesGroup.type && !$coerceToTypes) {
+              out += ' else { ';
+              var $schemaPath = it.schemaPath + '.type',
+                $errSchemaPath = it.errSchemaPath + '/type';
+              var $$outStack = $$outStack || [];
+              $$outStack.push(out);
+              out = ''; /* istanbul ignore else */
+              if (it.createErrors !== false) {
+                out += ' { keyword: \'' + ($errorKeyword || 'type') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { type: \'';
+                if ($typeIsArray) {
+                  out += '' + ($typeSchema.join(","));
+                } else {
+                  out += '' + ($typeSchema);
+                }
+                out += '\' } ';
+                if (it.opts.messages !== false) {
+                  out += ' , message: \'should be ';
+                  if ($typeIsArray) {
+                    out += '' + ($typeSchema.join(","));
+                  } else {
+                    out += '' + ($typeSchema);
+                  }
+                  out += '\' ';
+                }
+                if (it.opts.verbose) {
+                  out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+                }
+                out += ' } ';
+              } else {
+                out += ' {} ';
+              }
+              var __err = out;
+              out = $$outStack.pop();
+              if (!it.compositeRule && $breakOnError) {
+                /* istanbul ignore if */
+                if (it.async) {
+                  out += ' throw new ValidationError([' + (__err) + ']); ';
+                } else {
+                  out += ' validate.errors = [' + (__err) + ']; return false; ';
+                }
+              } else {
+                out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+              }
+              out += ' } ';
+            }
+          }
+          if ($breakOnError) {
+            out += ' if (errors === ';
+            if ($top) {
+              out += '0';
+            } else {
+              out += 'errs_' + ($lvl);
+            }
+            out += ') { ';
+            $closingBraces2 += '}';
+          }
+        }
+      }
+    }
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces2) + ' ';
+  }
+  if ($top) {
+    if ($async) {
+      out += ' if (errors === 0) return data;           ';
+      out += ' else throw new ValidationError(vErrors); ';
+    } else {
+      out += ' validate.errors = vErrors; ';
+      out += ' return errors === 0;       ';
+    }
+    out += ' }; return validate;';
+  } else {
+    out += ' var ' + ($valid) + ' = errors === errs_' + ($lvl) + ';';
+  }
+
+  function $shouldUseGroup($rulesGroup) {
+    var rules = $rulesGroup.rules;
+    for (var i = 0; i < rules.length; i++)
+      if ($shouldUseRule(rules[i])) return true;
+  }
+
+  function $shouldUseRule($rule) {
+    return it.schema[$rule.keyword] !== undefined || ($rule.implements && $ruleImplementsSomeKeyword($rule));
+  }
+
+  function $ruleImplementsSomeKeyword($rule) {
+    var impl = $rule.implements;
+    for (var i = 0; i < impl.length; i++)
+      if (it.schema[impl[i]] !== undefined) return true;
+  }
+  return out;
+}
+
+},{}],39:[function(require,module,exports){
+'use strict';
+
+var IDENTIFIER = /^[a-z_$][a-z0-9_$-]*$/i;
+var customRuleCode = require('./dotjs/custom');
+var definitionSchema = require('./definition_schema');
+
+module.exports = {
+  add: addKeyword,
+  get: getKeyword,
+  remove: removeKeyword,
+  validate: validateKeyword
+};
+
+
+/**
+ * Define custom keyword
+ * @this  Ajv
+ * @param {String} keyword custom keyword, should be unique (including different from all standard, custom and macro keywords).
+ * @param {Object} definition keyword definition object with properties `type` (type(s) which the keyword applies to), `validate` or `compile`.
+ * @return {Ajv} this for method chaining
+ */
+function addKeyword(keyword, definition) {
+  /* jshint validthis: true */
+  /* eslint no-shadow: 0 */
+  var RULES = this.RULES;
+  if (RULES.keywords[keyword])
+    throw new Error('Keyword ' + keyword + ' is already defined');
+
+  if (!IDENTIFIER.test(keyword))
+    throw new Error('Keyword ' + keyword + ' is not a valid identifier');
+
+  if (definition) {
+    this.validateKeyword(definition, true);
+
+    var dataType = definition.type;
+    if (Array.isArray(dataType)) {
+      for (var i=0; i<dataType.length; i++)
+        _addRule(keyword, dataType[i], definition);
+    } else {
+      _addRule(keyword, dataType, definition);
+    }
+
+    var metaSchema = definition.metaSchema;
+    if (metaSchema) {
+      if (definition.$data && this._opts.$data) {
+        metaSchema = {
+          anyOf: [
+            metaSchema,
+            { '$ref': 'https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#' }
+          ]
+        };
+      }
+      definition.validateSchema = this.compile(metaSchema, true);
+    }
+  }
+
+  RULES.keywords[keyword] = RULES.all[keyword] = true;
+
+
+  function _addRule(keyword, dataType, definition) {
+    var ruleGroup;
+    for (var i=0; i<RULES.length; i++) {
+      var rg = RULES[i];
+      if (rg.type == dataType) {
+        ruleGroup = rg;
+        break;
+      }
+    }
+
+    if (!ruleGroup) {
+      ruleGroup = { type: dataType, rules: [] };
+      RULES.push(ruleGroup);
+    }
+
+    var rule = {
+      keyword: keyword,
+      definition: definition,
+      custom: true,
+      code: customRuleCode,
+      implements: definition.implements
+    };
+    ruleGroup.rules.push(rule);
+    RULES.custom[keyword] = rule;
+  }
+
+  return this;
+}
+
+
+/**
+ * Get keyword
+ * @this  Ajv
+ * @param {String} keyword pre-defined or custom keyword.
+ * @return {Object|Boolean} custom keyword definition, `true` if it is a predefined keyword, `false` otherwise.
+ */
+function getKeyword(keyword) {
+  /* jshint validthis: true */
+  var rule = this.RULES.custom[keyword];
+  return rule ? rule.definition : this.RULES.keywords[keyword] || false;
+}
+
+
+/**
+ * Remove keyword
+ * @this  Ajv
+ * @param {String} keyword pre-defined or custom keyword.
+ * @return {Ajv} this for method chaining
+ */
+function removeKeyword(keyword) {
+  /* jshint validthis: true */
+  var RULES = this.RULES;
+  delete RULES.keywords[keyword];
+  delete RULES.all[keyword];
+  delete RULES.custom[keyword];
+  for (var i=0; i<RULES.length; i++) {
+    var rules = RULES[i].rules;
+    for (var j=0; j<rules.length; j++) {
+      if (rules[j].keyword == keyword) {
+        rules.splice(j, 1);
+        break;
+      }
+    }
+  }
+  return this;
+}
+
+
+/**
+ * Validate keyword definition
+ * @this  Ajv
+ * @param {Object} definition keyword definition object.
+ * @param {Boolean} throwError true to throw exception if definition is invalid
+ * @return {boolean} validation result
+ */
+function validateKeyword(definition, throwError) {
+  validateKeyword.errors = null;
+  var v = this._validateKeyword = this._validateKeyword
+                                  || this.compile(definitionSchema, true);
+
+  if (v(definition)) return true;
+  validateKeyword.errors = v.errors;
+  if (throwError)
+    throw new Error('custom keyword definition is invalid: '  + this.errorsText(v.errors));
+  else
+    return false;
+}
+
+},{"./definition_schema":12,"./dotjs/custom":22}],40:[function(require,module,exports){
+module.exports={
+    "$schema": "http://json-schema.org/draft-07/schema#",
+    "$id": "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#",
+    "description": "Meta-schema for $data reference (JSON Schema extension proposal)",
+    "type": "object",
+    "required": [ "$data" ],
+    "properties": {
+        "$data": {
+            "type": "string",
+            "anyOf": [
+                { "format": "relative-json-pointer" }, 
+                { "format": "json-pointer" }
+            ]
+        }
+    },
+    "additionalProperties": false
+}
+
+},{}],41:[function(require,module,exports){
+module.exports={
+    "$schema": "http://json-schema.org/draft-07/schema#",
+    "$id": "http://json-schema.org/draft-07/schema#",
+    "title": "Core schema meta-schema",
+    "definitions": {
+        "schemaArray": {
+            "type": "array",
+            "minItems": 1,
+            "items": { "$ref": "#" }
+        },
+        "nonNegativeInteger": {
+            "type": "integer",
+            "minimum": 0
+        },
+        "nonNegativeIntegerDefault0": {
+            "allOf": [
+                { "$ref": "#/definitions/nonNegativeInteger" },
+                { "default": 0 }
+            ]
+        },
+        "simpleTypes": {
+            "enum": [
+                "array",
+                "boolean",
+                "integer",
+                "null",
+                "number",
+                "object",
+                "string"
+            ]
+        },
+        "stringArray": {
+            "type": "array",
+            "items": { "type": "string" },
+            "uniqueItems": true,
+            "default": []
+        }
+    },
+    "type": ["object", "boolean"],
+    "properties": {
+        "$id": {
+            "type": "string",
+            "format": "uri-reference"
+        },
+        "$schema": {
+            "type": "string",
+            "format": "uri"
+        },
+        "$ref": {
+            "type": "string",
+            "format": "uri-reference"
+        },
+        "$comment": {
+            "type": "string"
+        },
+        "title": {
+            "type": "string"
+        },
+        "description": {
+            "type": "string"
+        },
+        "default": true,
+        "readOnly": {
+            "type": "boolean",
+            "default": false
+        },
+        "examples": {
+            "type": "array",
+            "items": true
+        },
+        "multipleOf": {
+            "type": "number",
+            "exclusiveMinimum": 0
+        },
+        "maximum": {
+            "type": "number"
+        },
+        "exclusiveMaximum": {
+            "type": "number"
+        },
+        "minimum": {
+            "type": "number"
+        },
+        "exclusiveMinimum": {
+            "type": "number"
+        },
+        "maxLength": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minLength": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "pattern": {
+            "type": "string",
+            "format": "regex"
+        },
+        "additionalItems": { "$ref": "#" },
+        "items": {
+            "anyOf": [
+                { "$ref": "#" },
+                { "$ref": "#/definitions/schemaArray" }
+            ],
+            "default": true
+        },
+        "maxItems": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minItems": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "uniqueItems": {
+            "type": "boolean",
+            "default": false
+        },
+        "contains": { "$ref": "#" },
+        "maxProperties": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minProperties": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "required": { "$ref": "#/definitions/stringArray" },
+        "additionalProperties": { "$ref": "#" },
+        "definitions": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "properties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "patternProperties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "propertyNames": { "format": "regex" },
+            "default": {}
+        },
+        "dependencies": {
+            "type": "object",
+            "additionalProperties": {
+                "anyOf": [
+                    { "$ref": "#" },
+                    { "$ref": "#/definitions/stringArray" }
+                ]
+            }
+        },
+        "propertyNames": { "$ref": "#" },
+        "const": true,
+        "enum": {
+            "type": "array",
+            "items": true,
+            "minItems": 1,
+            "uniqueItems": true
+        },
+        "type": {
+            "anyOf": [
+                { "$ref": "#/definitions/simpleTypes" },
+                {
+                    "type": "array",
+                    "items": { "$ref": "#/definitions/simpleTypes" },
+                    "minItems": 1,
+                    "uniqueItems": true
+                }
+            ]
+        },
+        "format": { "type": "string" },
+        "contentMediaType": { "type": "string" },
+        "contentEncoding": { "type": "string" },
+        "if": {"$ref": "#"},
+        "then": {"$ref": "#"},
+        "else": {"$ref": "#"},
+        "allOf": { "$ref": "#/definitions/schemaArray" },
+        "anyOf": { "$ref": "#/definitions/schemaArray" },
+        "oneOf": { "$ref": "#/definitions/schemaArray" },
+        "not": { "$ref": "#" }
+    },
+    "default": true
+}
+
+},{}],42:[function(require,module,exports){
+'use strict';
+
+// do not edit .js files directly - edit src/index.jst
+
+
+
+module.exports = function equal(a, b) {
+  if (a === b) return true;
+
+  if (a && b && typeof a == 'object' && typeof b == 'object') {
+    if (a.constructor !== b.constructor) return false;
+
+    var length, i, keys;
+    if (Array.isArray(a)) {
+      length = a.length;
+      if (length != b.length) return false;
+      for (i = length; i-- !== 0;)
+        if (!equal(a[i], b[i])) return false;
+      return true;
+    }
+
+
+
+    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;
+    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();
+    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();
+
+    keys = Object.keys(a);
+    length = keys.length;
+    if (length !== Object.keys(b).length) return false;
+
+    for (i = length; i-- !== 0;)
+      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;
+
+    for (i = length; i-- !== 0;) {
+      var key = keys[i];
+
+      if (!equal(a[key], b[key])) return false;
+    }
+
+    return true;
+  }
+
+  // true if both NaN, false otherwise
+  return a!==a && b!==b;
+};
+
+},{}],43:[function(require,module,exports){
+'use strict';
+
+module.exports = function (data, opts) {
+    if (!opts) opts = {};
+    if (typeof opts === 'function') opts = { cmp: opts };
+    var cycles = (typeof opts.cycles === 'boolean') ? opts.cycles : false;
+
+    var cmp = opts.cmp && (function (f) {
+        return function (node) {
+            return function (a, b) {
+                var aobj = { key: a, value: node[a] };
+                var bobj = { key: b, value: node[b] };
+                return f(aobj, bobj);
+            };
+        };
+    })(opts.cmp);
+
+    var seen = [];
+    return (function stringify (node) {
+        if (node && node.toJSON && typeof node.toJSON === 'function') {
+            node = node.toJSON();
+        }
+
+        if (node === undefined) return;
+        if (typeof node == 'number') return isFinite(node) ? '' + node : 'null';
+        if (typeof node !== 'object') return JSON.stringify(node);
+
+        var i, out;
+        if (Array.isArray(node)) {
+            out = '[';
+            for (i = 0; i < node.length; i++) {
+                if (i) out += ',';
+                out += stringify(node[i]) || 'null';
+            }
+            return out + ']';
+        }
+
+        if (node === null) return 'null';
+
+        if (seen.indexOf(node) !== -1) {
+            if (cycles) return JSON.stringify('__cycle__');
+            throw new TypeError('Converting circular structure to JSON');
+        }
+
+        var seenIndex = seen.push(node) - 1;
+        var keys = Object.keys(node).sort(cmp && cmp(node));
+        out = '';
+        for (i = 0; i < keys.length; i++) {
+            var key = keys[i];
+            var value = stringify(node[key]);
+
+            if (!value) continue;
+            if (out) out += ',';
+            out += JSON.stringify(key) + ':' + value;
+        }
+        seen.splice(seenIndex, 1);
+        return '{' + out + '}';
+    })(data);
+};
+
+},{}],44:[function(require,module,exports){
+'use strict';
+
+var traverse = module.exports = function (schema, opts, cb) {
+  // Legacy support for v0.3.1 and earlier.
+  if (typeof opts == 'function') {
+    cb = opts;
+    opts = {};
+  }
+
+  cb = opts.cb || cb;
+  var pre = (typeof cb == 'function') ? cb : cb.pre || function() {};
+  var post = cb.post || function() {};
+
+  _traverse(opts, pre, post, schema, '', schema);
+};
+
+
+traverse.keywords = {
+  additionalItems: true,
+  items: true,
+  contains: true,
+  additionalProperties: true,
+  propertyNames: true,
+  not: true
+};
+
+traverse.arrayKeywords = {
+  items: true,
+  allOf: true,
+  anyOf: true,
+  oneOf: true
+};
+
+traverse.propsKeywords = {
+  definitions: true,
+  properties: true,
+  patternProperties: true,
+  dependencies: true
+};
+
+traverse.skipKeywords = {
+  default: true,
+  enum: true,
+  const: true,
+  required: true,
+  maximum: true,
+  minimum: true,
+  exclusiveMaximum: true,
+  exclusiveMinimum: true,
+  multipleOf: true,
+  maxLength: true,
+  minLength: true,
+  pattern: true,
+  format: true,
+  maxItems: true,
+  minItems: true,
+  uniqueItems: true,
+  maxProperties: true,
+  minProperties: true
+};
+
+
+function _traverse(opts, pre, post, schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex) {
+  if (schema && typeof schema == 'object' && !Array.isArray(schema)) {
+    pre(schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex);
+    for (var key in schema) {
+      var sch = schema[key];
+      if (Array.isArray(sch)) {
+        if (key in traverse.arrayKeywords) {
+          for (var i=0; i<sch.length; i++)
+            _traverse(opts, pre, post, sch[i], jsonPtr + '/' + key + '/' + i, rootSchema, jsonPtr, key, schema, i);
+        }
+      } else if (key in traverse.propsKeywords) {
+        if (sch && typeof sch == 'object') {
+          for (var prop in sch)
+            _traverse(opts, pre, post, sch[prop], jsonPtr + '/' + key + '/' + escapeJsonPtr(prop), rootSchema, jsonPtr, key, schema, prop);
+        }
+      } else if (key in traverse.keywords || (opts.allKeys && !(key in traverse.skipKeywords))) {
+        _traverse(opts, pre, post, sch, jsonPtr + '/' + key, rootSchema, jsonPtr, key, schema);
+      }
+    }
+    post(schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex);
+  }
+}
+
+
+function escapeJsonPtr(str) {
+  return str.replace(/~/g, '~0').replace(/\//g, '~1');
+}
+
+},{}],45:[function(require,module,exports){
+/** @license URI.js v4.4.0 (c) 2011 Gary Court. License: http://github.com/garycourt/uri-js */
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+	typeof define === 'function' && define.amd ? define(['exports'], factory) :
+	(factory((global.URI = global.URI || {})));
+}(this, (function (exports) { 'use strict';
+
+function merge() {
+    for (var _len = arguments.length, sets = Array(_len), _key = 0; _key < _len; _key++) {
+        sets[_key] = arguments[_key];
+    }
+
+    if (sets.length > 1) {
+        sets[0] = sets[0].slice(0, -1);
+        var xl = sets.length - 1;
+        for (var x = 1; x < xl; ++x) {
+            sets[x] = sets[x].slice(1, -1);
+        }
+        sets[xl] = sets[xl].slice(1);
+        return sets.join('');
+    } else {
+        return sets[0];
+    }
+}
+function subexp(str) {
+    return "(?:" + str + ")";
+}
+function typeOf(o) {
+    return o === undefined ? "undefined" : o === null ? "null" : Object.prototype.toString.call(o).split(" ").pop().split("]").shift().toLowerCase();
+}
+function toUpperCase(str) {
+    return str.toUpperCase();
+}
+function toArray(obj) {
+    return obj !== undefined && obj !== null ? obj instanceof Array ? obj : typeof obj.length !== "number" || obj.split || obj.setInterval || obj.call ? [obj] : Array.prototype.slice.call(obj) : [];
+}
+function assign(target, source) {
+    var obj = target;
+    if (source) {
+        for (var key in source) {
+            obj[key] = source[key];
+        }
+    }
+    return obj;
+}
+
+function buildExps(isIRI) {
+    var ALPHA$$ = "[A-Za-z]",
+        CR$ = "[\\x0D]",
+        DIGIT$$ = "[0-9]",
+        DQUOTE$$ = "[\\x22]",
+        HEXDIG$$ = merge(DIGIT$$, "[A-Fa-f]"),
+        //case-insensitive
+    LF$$ = "[\\x0A]",
+        SP$$ = "[\\x20]",
+        PCT_ENCODED$ = subexp(subexp("%[EFef]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%[89A-Fa-f]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%" + HEXDIG$$ + HEXDIG$$)),
+        //expanded
+    GEN_DELIMS$$ = "[\\:\\/\\?\\#\\[\\]\\@]",
+        SUB_DELIMS$$ = "[\\!\\$\\&\\'\\(\\)\\*\\+\\,\\;\\=]",
+        RESERVED$$ = merge(GEN_DELIMS$$, SUB_DELIMS$$),
+        UCSCHAR$$ = isIRI ? "[\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]" : "[]",
+        //subset, excludes bidi control characters
+    IPRIVATE$$ = isIRI ? "[\\uE000-\\uF8FF]" : "[]",
+        //subset
+    UNRESERVED$$ = merge(ALPHA$$, DIGIT$$, "[\\-\\.\\_\\~]", UCSCHAR$$),
+        SCHEME$ = subexp(ALPHA$$ + merge(ALPHA$$, DIGIT$$, "[\\+\\-\\.]") + "*"),
+        USERINFO$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:]")) + "*"),
+        DEC_OCTET$ = subexp(subexp("25[0-5]") + "|" + subexp("2[0-4]" + DIGIT$$) + "|" + subexp("1" + DIGIT$$ + DIGIT$$) + "|" + subexp("[1-9]" + DIGIT$$) + "|" + DIGIT$$),
+        DEC_OCTET_RELAXED$ = subexp(subexp("25[0-5]") + "|" + subexp("2[0-4]" + DIGIT$$) + "|" + subexp("1" + DIGIT$$ + DIGIT$$) + "|" + subexp("0?[1-9]" + DIGIT$$) + "|0?0?" + DIGIT$$),
+        //relaxed parsing rules
+    IPV4ADDRESS$ = subexp(DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$),
+        H16$ = subexp(HEXDIG$$ + "{1,4}"),
+        LS32$ = subexp(subexp(H16$ + "\\:" + H16$) + "|" + IPV4ADDRESS$),
+        IPV6ADDRESS1$ = subexp(subexp(H16$ + "\\:") + "{6}" + LS32$),
+        //                           6( h16 ":" ) ls32
+    IPV6ADDRESS2$ = subexp("\\:\\:" + subexp(H16$ + "\\:") + "{5}" + LS32$),
+        //                      "::" 5( h16 ":" ) ls32
+    IPV6ADDRESS3$ = subexp(subexp(H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{4}" + LS32$),
+        //[               h16 ] "::" 4( h16 ":" ) ls32
+    IPV6ADDRESS4$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,1}" + H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{3}" + LS32$),
+        //[ *1( h16 ":" ) h16 ] "::" 3( h16 ":" ) ls32
+    IPV6ADDRESS5$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,2}" + H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{2}" + LS32$),
+        //[ *2( h16 ":" ) h16 ] "::" 2( h16 ":" ) ls32
+    IPV6ADDRESS6$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,3}" + H16$) + "?\\:\\:" + H16$ + "\\:" + LS32$),
+        //[ *3( h16 ":" ) h16 ] "::"    h16 ":"   ls32
+    IPV6ADDRESS7$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,4}" + H16$) + "?\\:\\:" + LS32$),
+        //[ *4( h16 ":" ) h16 ] "::"              ls32
+    IPV6ADDRESS8$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,5}" + H16$) + "?\\:\\:" + H16$),
+        //[ *5( h16 ":" ) h16 ] "::"              h16
+    IPV6ADDRESS9$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,6}" + H16$) + "?\\:\\:"),
+        //[ *6( h16 ":" ) h16 ] "::"
+    IPV6ADDRESS$ = subexp([IPV6ADDRESS1$, IPV6ADDRESS2$, IPV6ADDRESS3$, IPV6ADDRESS4$, IPV6ADDRESS5$, IPV6ADDRESS6$, IPV6ADDRESS7$, IPV6ADDRESS8$, IPV6ADDRESS9$].join("|")),
+        ZONEID$ = subexp(subexp(UNRESERVED$$ + "|" + PCT_ENCODED$) + "+"),
+        //RFC 6874
+    IPV6ADDRZ$ = subexp(IPV6ADDRESS$ + "\\%25" + ZONEID$),
+        //RFC 6874
+    IPV6ADDRZ_RELAXED$ = subexp(IPV6ADDRESS$ + subexp("\\%25|\\%(?!" + HEXDIG$$ + "{2})") + ZONEID$),
+        //RFC 6874, with relaxed parsing rules
+    IPVFUTURE$ = subexp("[vV]" + HEXDIG$$ + "+\\." + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:]") + "+"),
+        IP_LITERAL$ = subexp("\\[" + subexp(IPV6ADDRZ_RELAXED$ + "|" + IPV6ADDRESS$ + "|" + IPVFUTURE$) + "\\]"),
+        //RFC 6874
+    REG_NAME$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$)) + "*"),
+        HOST$ = subexp(IP_LITERAL$ + "|" + IPV4ADDRESS$ + "(?!" + REG_NAME$ + ")" + "|" + REG_NAME$),
+        PORT$ = subexp(DIGIT$$ + "*"),
+        AUTHORITY$ = subexp(subexp(USERINFO$ + "@") + "?" + HOST$ + subexp("\\:" + PORT$) + "?"),
+        PCHAR$ = subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@]")),
+        SEGMENT$ = subexp(PCHAR$ + "*"),
+        SEGMENT_NZ$ = subexp(PCHAR$ + "+"),
+        SEGMENT_NZ_NC$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\@]")) + "+"),
+        PATH_ABEMPTY$ = subexp(subexp("\\/" + SEGMENT$) + "*"),
+        PATH_ABSOLUTE$ = subexp("\\/" + subexp(SEGMENT_NZ$ + PATH_ABEMPTY$) + "?"),
+        //simplified
+    PATH_NOSCHEME$ = subexp(SEGMENT_NZ_NC$ + PATH_ABEMPTY$),
+        //simplified
+    PATH_ROOTLESS$ = subexp(SEGMENT_NZ$ + PATH_ABEMPTY$),
+        //simplified
+    PATH_EMPTY$ = "(?!" + PCHAR$ + ")",
+        PATH$ = subexp(PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$),
+        QUERY$ = subexp(subexp(PCHAR$ + "|" + merge("[\\/\\?]", IPRIVATE$$)) + "*"),
+        FRAGMENT$ = subexp(subexp(PCHAR$ + "|[\\/\\?]") + "*"),
+        HIER_PART$ = subexp(subexp("\\/\\/" + AUTHORITY$ + PATH_ABEMPTY$) + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$),
+        URI$ = subexp(SCHEME$ + "\\:" + HIER_PART$ + subexp("\\?" + QUERY$) + "?" + subexp("\\#" + FRAGMENT$) + "?"),
+        RELATIVE_PART$ = subexp(subexp("\\/\\/" + AUTHORITY$ + PATH_ABEMPTY$) + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_EMPTY$),
+        RELATIVE$ = subexp(RELATIVE_PART$ + subexp("\\?" + QUERY$) + "?" + subexp("\\#" + FRAGMENT$) + "?"),
+        URI_REFERENCE$ = subexp(URI$ + "|" + RELATIVE$),
+        ABSOLUTE_URI$ = subexp(SCHEME$ + "\\:" + HIER_PART$ + subexp("\\?" + QUERY$) + "?"),
+        GENERIC_REF$ = "^(" + SCHEME$ + ")\\:" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?" + subexp("\\#(" + FRAGMENT$ + ")") + "?$",
+        RELATIVE_REF$ = "^(){0}" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?" + subexp("\\#(" + FRAGMENT$ + ")") + "?$",
+        ABSOLUTE_REF$ = "^(" + SCHEME$ + ")\\:" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?$",
+        SAMEDOC_REF$ = "^" + subexp("\\#(" + FRAGMENT$ + ")") + "?$",
+        AUTHORITY_REF$ = "^" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?$";
+    return {
+        NOT_SCHEME: new RegExp(merge("[^]", ALPHA$$, DIGIT$$, "[\\+\\-\\.]"), "g"),
+        NOT_USERINFO: new RegExp(merge("[^\\%\\:]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_HOST: new RegExp(merge("[^\\%\\[\\]\\:]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_PATH: new RegExp(merge("[^\\%\\/\\:\\@]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_PATH_NOSCHEME: new RegExp(merge("[^\\%\\/\\@]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_QUERY: new RegExp(merge("[^\\%]", UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@\\/\\?]", IPRIVATE$$), "g"),
+        NOT_FRAGMENT: new RegExp(merge("[^\\%]", UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@\\/\\?]"), "g"),
+        ESCAPE: new RegExp(merge("[^]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        UNRESERVED: new RegExp(UNRESERVED$$, "g"),
+        OTHER_CHARS: new RegExp(merge("[^\\%]", UNRESERVED$$, RESERVED$$), "g"),
+        PCT_ENCODED: new RegExp(PCT_ENCODED$, "g"),
+        IPV4ADDRESS: new RegExp("^(" + IPV4ADDRESS$ + ")$"),
+        IPV6ADDRESS: new RegExp("^\\[?(" + IPV6ADDRESS$ + ")" + subexp(subexp("\\%25|\\%(?!" + HEXDIG$$ + "{2})") + "(" + ZONEID$ + ")") + "?\\]?$") //RFC 6874, with relaxed parsing rules
+    };
+}
+var URI_PROTOCOL = buildExps(false);
+
+var IRI_PROTOCOL = buildExps(true);
+
+var slicedToArray = function () {
+  function sliceIterator(arr, i) {
+    var _arr = [];
+    var _n = true;
+    var _d = false;
+    var _e = undefined;
+
+    try {
+      for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {
+        _arr.push(_s.value);
+
+        if (i && _arr.length === i) break;
+      }
+    } catch (err) {
+      _d = true;
+      _e = err;
+    } finally {
+      try {
+        if (!_n && _i["return"]) _i["return"]();
+      } finally {
+        if (_d) throw _e;
+      }
+    }
+
+    return _arr;
+  }
+
+  return function (arr, i) {
+    if (Array.isArray(arr)) {
+      return arr;
+    } else if (Symbol.iterator in Object(arr)) {
+      return sliceIterator(arr, i);
+    } else {
+      throw new TypeError("Invalid attempt to destructure non-iterable instance");
+    }
+  };
+}();
+
+
+
+
+
+
+
+
+
+
+
+
+
+var toConsumableArray = function (arr) {
+  if (Array.isArray(arr)) {
+    for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) arr2[i] = arr[i];
+
+    return arr2;
+  } else {
+    return Array.from(arr);
+  }
+};
+
+/** Highest positive signed 32-bit float value */
+
+var maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1
+
+/** Bootstring parameters */
+var base = 36;
+var tMin = 1;
+var tMax = 26;
+var skew = 38;
+var damp = 700;
+var initialBias = 72;
+var initialN = 128; // 0x80
+var delimiter = '-'; // '\x2D'
+
+/** Regular expressions */
+var regexPunycode = /^xn--/;
+var regexNonASCII = /[^\0-\x7E]/; // non-ASCII chars
+var regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g; // RFC 3490 separators
+
+/** Error messages */
+var errors = {
+	'overflow': 'Overflow: input needs wider integers to process',
+	'not-basic': 'Illegal input >= 0x80 (not a basic code point)',
+	'invalid-input': 'Invalid input'
+};
+
+/** Convenience shortcuts */
+var baseMinusTMin = base - tMin;
+var floor = Math.floor;
+var stringFromCharCode = String.fromCharCode;
+
+/*--------------------------------------------------------------------------*/
+
+/**
+ * A generic error utility function.
+ * @private
+ * @param {String} type The error type.
+ * @returns {Error} Throws a `RangeError` with the applicable error message.
+ */
+function error$1(type) {
+	throw new RangeError(errors[type]);
+}
+
+/**
+ * A generic `Array#map` utility function.
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} callback The function that gets called for every array
+ * item.
+ * @returns {Array} A new array of values returned by the callback function.
+ */
+function map(array, fn) {
+	var result = [];
+	var length = array.length;
+	while (length--) {
+		result[length] = fn(array[length]);
+	}
+	return result;
+}
+
+/**
+ * A simple `Array#map`-like wrapper to work with domain name strings or email
+ * addresses.
+ * @private
+ * @param {String} domain The domain name or email address.
+ * @param {Function} callback The function that gets called for every
+ * character.
+ * @returns {Array} A new string of characters returned by the callback
+ * function.
+ */
+function mapDomain(string, fn) {
+	var parts = string.split('@');
+	var result = '';
+	if (parts.length > 1) {
+		// In email addresses, only the domain name should be punycoded. Leave
+		// the local part (i.e. everything up to `@`) intact.
+		result = parts[0] + '@';
+		string = parts[1];
+	}
+	// Avoid `split(regex)` for IE8 compatibility. See #17.
+	string = string.replace(regexSeparators, '\x2E');
+	var labels = string.split('.');
+	var encoded = map(labels, fn).join('.');
+	return result + encoded;
+}
+
+/**
+ * Creates an array containing the numeric code points of each Unicode
+ * character in the string. While JavaScript uses UCS-2 internally,
+ * this function will convert a pair of surrogate halves (each of which
+ * UCS-2 exposes as separate characters) into a single code point,
+ * matching UTF-16.
+ * @see `punycode.ucs2.encode`
+ * @see <https://mathiasbynens.be/notes/javascript-encoding>
+ * @memberOf punycode.ucs2
+ * @name decode
+ * @param {String} string The Unicode input string (UCS-2).
+ * @returns {Array} The new array of code points.
+ */
+function ucs2decode(string) {
+	var output = [];
+	var counter = 0;
+	var length = string.length;
+	while (counter < length) {
+		var value = string.charCodeAt(counter++);
+		if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
+			// It's a high surrogate, and there is a next character.
+			var extra = string.charCodeAt(counter++);
+			if ((extra & 0xFC00) == 0xDC00) {
+				// Low surrogate.
+				output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
+			} else {
+				// It's an unmatched surrogate; only append this code unit, in case the
+				// next code unit is the high surrogate of a surrogate pair.
+				output.push(value);
+				counter--;
+			}
+		} else {
+			output.push(value);
+		}
+	}
+	return output;
+}
+
+/**
+ * Creates a string based on an array of numeric code points.
+ * @see `punycode.ucs2.decode`
+ * @memberOf punycode.ucs2
+ * @name encode
+ * @param {Array} codePoints The array of numeric code points.
+ * @returns {String} The new Unicode string (UCS-2).
+ */
+var ucs2encode = function ucs2encode(array) {
+	return String.fromCodePoint.apply(String, toConsumableArray(array));
+};
+
+/**
+ * Converts a basic code point into a digit/integer.
+ * @see `digitToBasic()`
+ * @private
+ * @param {Number} codePoint The basic numeric code point value.
+ * @returns {Number} The numeric value of a basic code point (for use in
+ * representing integers) in the range `0` to `base - 1`, or `base` if
+ * the code point does not represent a value.
+ */
+var basicToDigit = function basicToDigit(codePoint) {
+	if (codePoint - 0x30 < 0x0A) {
+		return codePoint - 0x16;
+	}
+	if (codePoint - 0x41 < 0x1A) {
+		return codePoint - 0x41;
+	}
+	if (codePoint - 0x61 < 0x1A) {
+		return codePoint - 0x61;
+	}
+	return base;
+};
+
+/**
+ * Converts a digit/integer into a basic code point.
+ * @see `basicToDigit()`
+ * @private
+ * @param {Number} digit The numeric value of a basic code point.
+ * @returns {Number} The basic code point whose value (when used for
+ * representing integers) is `digit`, which needs to be in the range
+ * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is
+ * used; else, the lowercase form is used. The behavior is undefined
+ * if `flag` is non-zero and `digit` has no uppercase form.
+ */
+var digitToBasic = function digitToBasic(digit, flag) {
+	//  0..25 map to ASCII a..z or A..Z
+	// 26..35 map to ASCII 0..9
+	return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+};
+
+/**
+ * Bias adaptation function as per section 3.4 of RFC 3492.
+ * https://tools.ietf.org/html/rfc3492#section-3.4
+ * @private
+ */
+var adapt = function adapt(delta, numPoints, firstTime) {
+	var k = 0;
+	delta = firstTime ? floor(delta / damp) : delta >> 1;
+	delta += floor(delta / numPoints);
+	for (; /* no initialization */delta > baseMinusTMin * tMax >> 1; k += base) {
+		delta = floor(delta / baseMinusTMin);
+	}
+	return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
+};
+
+/**
+ * Converts a Punycode string of ASCII-only symbols to a string of Unicode
+ * symbols.
+ * @memberOf punycode
+ * @param {String} input The Punycode string of ASCII-only symbols.
+ * @returns {String} The resulting string of Unicode symbols.
+ */
+var decode = function decode(input) {
+	// Don't use UCS-2.
+	var output = [];
+	var inputLength = input.length;
+	var i = 0;
+	var n = initialN;
+	var bias = initialBias;
+
+	// Handle the basic code points: let `basic` be the number of input code
+	// points before the last delimiter, or `0` if there is none, then copy
+	// the first basic code points to the output.
+
+	var basic = input.lastIndexOf(delimiter);
+	if (basic < 0) {
+		basic = 0;
+	}
+
+	for (var j = 0; j < basic; ++j) {
+		// if it's not a basic code point
+		if (input.charCodeAt(j) >= 0x80) {
+			error$1('not-basic');
+		}
+		output.push(input.charCodeAt(j));
+	}
+
+	// Main decoding loop: start just after the last delimiter if any basic code
+	// points were copied; start at the beginning otherwise.
+
+	for (var index = basic > 0 ? basic + 1 : 0; index < inputLength;) /* no final expression */{
+
+		// `index` is the index of the next character to be consumed.
+		// Decode a generalized variable-length integer into `delta`,
+		// which gets added to `i`. The overflow checking is easier
+		// if we increase `i` as we go, then subtract off its starting
+		// value at the end to obtain `delta`.
+		var oldi = i;
+		for (var w = 1, k = base;; /* no condition */k += base) {
+
+			if (index >= inputLength) {
+				error$1('invalid-input');
+			}
+
+			var digit = basicToDigit(input.charCodeAt(index++));
+
+			if (digit >= base || digit > floor((maxInt - i) / w)) {
+				error$1('overflow');
+			}
+
+			i += digit * w;
+			var t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+
+			if (digit < t) {
+				break;
+			}
+
+			var baseMinusT = base - t;
+			if (w > floor(maxInt / baseMinusT)) {
+				error$1('overflow');
+			}
+
+			w *= baseMinusT;
+		}
+
+		var out = output.length + 1;
+		bias = adapt(i - oldi, out, oldi == 0);
+
+		// `i` was supposed to wrap around from `out` to `0`,
+		// incrementing `n` each time, so we'll fix that now:
+		if (floor(i / out) > maxInt - n) {
+			error$1('overflow');
+		}
+
+		n += floor(i / out);
+		i %= out;
+
+		// Insert `n` at position `i` of the output.
+		output.splice(i++, 0, n);
+	}
+
+	return String.fromCodePoint.apply(String, output);
+};
+
+/**
+ * Converts a string of Unicode symbols (e.g. a domain name label) to a
+ * Punycode string of ASCII-only symbols.
+ * @memberOf punycode
+ * @param {String} input The string of Unicode symbols.
+ * @returns {String} The resulting Punycode string of ASCII-only symbols.
+ */
+var encode = function encode(input) {
+	var output = [];
+
+	// Convert the input in UCS-2 to an array of Unicode code points.
+	input = ucs2decode(input);
+
+	// Cache the length.
+	var inputLength = input.length;
+
+	// Initialize the state.
+	var n = initialN;
+	var delta = 0;
+	var bias = initialBias;
+
+	// Handle the basic code points.
+	var _iteratorNormalCompletion = true;
+	var _didIteratorError = false;
+	var _iteratorError = undefined;
+
+	try {
+		for (var _iterator = input[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+			var _currentValue2 = _step.value;
+
+			if (_currentValue2 < 0x80) {
+				output.push(stringFromCharCode(_currentValue2));
+			}
+		}
+	} catch (err) {
+		_didIteratorError = true;
+		_iteratorError = err;
+	} finally {
+		try {
+			if (!_iteratorNormalCompletion && _iterator.return) {
+				_iterator.return();
+			}
+		} finally {
+			if (_didIteratorError) {
+				throw _iteratorError;
+			}
+		}
+	}
+
+	var basicLength = output.length;
+	var handledCPCount = basicLength;
+
+	// `handledCPCount` is the number of code points that have been handled;
+	// `basicLength` is the number of basic code points.
+
+	// Finish the basic string with a delimiter unless it's empty.
+	if (basicLength) {
+		output.push(delimiter);
+	}
+
+	// Main encoding loop:
+	while (handledCPCount < inputLength) {
+
+		// All non-basic code points < n have been handled already. Find the next
+		// larger one:
+		var m = maxInt;
+		var _iteratorNormalCompletion2 = true;
+		var _didIteratorError2 = false;
+		var _iteratorError2 = undefined;
+
+		try {
+			for (var _iterator2 = input[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
+				var currentValue = _step2.value;
+
+				if (currentValue >= n && currentValue < m) {
+					m = currentValue;
+				}
+			}
+
+			// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,
+			// but guard against overflow.
+		} catch (err) {
+			_didIteratorError2 = true;
+			_iteratorError2 = err;
+		} finally {
+			try {
+				if (!_iteratorNormalCompletion2 && _iterator2.return) {
+					_iterator2.return();
+				}
+			} finally {
+				if (_didIteratorError2) {
+					throw _iteratorError2;
+				}
+			}
+		}
+
+		var handledCPCountPlusOne = handledCPCount + 1;
+		if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
+			error$1('overflow');
+		}
+
+		delta += (m - n) * handledCPCountPlusOne;
+		n = m;
+
+		var _iteratorNormalCompletion3 = true;
+		var _didIteratorError3 = false;
+		var _iteratorError3 = undefined;
+
+		try {
+			for (var _iterator3 = input[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {
+				var _currentValue = _step3.value;
+
+				if (_currentValue < n && ++delta > maxInt) {
+					error$1('overflow');
+				}
+				if (_currentValue == n) {
+					// Represent delta as a generalized variable-length integer.
+					var q = delta;
+					for (var k = base;; /* no condition */k += base) {
+						var t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+						if (q < t) {
+							break;
+						}
+						var qMinusT = q - t;
+						var baseMinusT = base - t;
+						output.push(stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0)));
+						q = floor(qMinusT / baseMinusT);
+					}
+
+					output.push(stringFromCharCode(digitToBasic(q, 0)));
+					bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);
+					delta = 0;
+					++handledCPCount;
+				}
+			}
+		} catch (err) {
+			_didIteratorError3 = true;
+			_iteratorError3 = err;
+		} finally {
+			try {
+				if (!_iteratorNormalCompletion3 && _iterator3.return) {
+					_iterator3.return();
+				}
+			} finally {
+				if (_didIteratorError3) {
+					throw _iteratorError3;
+				}
+			}
+		}
+
+		++delta;
+		++n;
+	}
+	return output.join('');
+};
+
+/**
+ * Converts a Punycode string representing a domain name or an email address
+ * to Unicode. Only the Punycoded parts of the input will be converted, i.e.
+ * it doesn't matter if you call it on a string that has already been
+ * converted to Unicode.
+ * @memberOf punycode
+ * @param {String} input The Punycoded domain name or email address to
+ * convert to Unicode.
+ * @returns {String} The Unicode representation of the given Punycode
+ * string.
+ */
+var toUnicode = function toUnicode(input) {
+	return mapDomain(input, function (string) {
+		return regexPunycode.test(string) ? decode(string.slice(4).toLowerCase()) : string;
+	});
+};
+
+/**
+ * Converts a Unicode string representing a domain name or an email address to
+ * Punycode. Only the non-ASCII parts of the domain name will be converted,
+ * i.e. it doesn't matter if you call it with a domain that's already in
+ * ASCII.
+ * @memberOf punycode
+ * @param {String} input The domain name or email address to convert, as a
+ * Unicode string.
+ * @returns {String} The Punycode representation of the given domain name or
+ * email address.
+ */
+var toASCII = function toASCII(input) {
+	return mapDomain(input, function (string) {
+		return regexNonASCII.test(string) ? 'xn--' + encode(string) : string;
+	});
+};
+
+/*--------------------------------------------------------------------------*/
+
+/** Define the public API */
+var punycode = {
+	/**
+  * A string representing the current Punycode.js version number.
+  * @memberOf punycode
+  * @type String
+  */
+	'version': '2.1.0',
+	/**
+  * An object of methods to convert from JavaScript's internal character
+  * representation (UCS-2) to Unicode code points, and back.
+  * @see <https://mathiasbynens.be/notes/javascript-encoding>
+  * @memberOf punycode
+  * @type Object
+  */
+	'ucs2': {
+		'decode': ucs2decode,
+		'encode': ucs2encode
+	},
+	'decode': decode,
+	'encode': encode,
+	'toASCII': toASCII,
+	'toUnicode': toUnicode
+};
+
+/**
+ * URI.js
+ *
+ * @fileoverview An RFC 3986 compliant, scheme extendable URI parsing/validating/resolving library for JavaScript.
+ * @author <a href="mailto:gary.court@gmail.com">Gary Court</a>
+ * @see http://github.com/garycourt/uri-js
+ */
+/**
+ * Copyright 2011 Gary Court. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without modification, are
+ * permitted provided that the following conditions are met:
+ *
+ *    1. Redistributions of source code must retain the above copyright notice, this list of
+ *       conditions and the following disclaimer.
+ *
+ *    2. Redistributions in binary form must reproduce the above copyright notice, this list
+ *       of conditions and the following disclaimer in the documentation and/or other materials
+ *       provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY GARY COURT ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GARY COURT OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * The views and conclusions contained in the software and documentation are those of the
+ * authors and should not be interpreted as representing official policies, either expressed
+ * or implied, of Gary Court.
+ */
+var SCHEMES = {};
+function pctEncChar(chr) {
+    var c = chr.charCodeAt(0);
+    var e = void 0;
+    if (c < 16) e = "%0" + c.toString(16).toUpperCase();else if (c < 128) e = "%" + c.toString(16).toUpperCase();else if (c < 2048) e = "%" + (c >> 6 | 192).toString(16).toUpperCase() + "%" + (c & 63 | 128).toString(16).toUpperCase();else e = "%" + (c >> 12 | 224).toString(16).toUpperCase() + "%" + (c >> 6 & 63 | 128).toString(16).toUpperCase() + "%" + (c & 63 | 128).toString(16).toUpperCase();
+    return e;
+}
+function pctDecChars(str) {
+    var newStr = "";
+    var i = 0;
+    var il = str.length;
+    while (i < il) {
+        var c = parseInt(str.substr(i + 1, 2), 16);
+        if (c < 128) {
+            newStr += String.fromCharCode(c);
+            i += 3;
+        } else if (c >= 194 && c < 224) {
+            if (il - i >= 6) {
+                var c2 = parseInt(str.substr(i + 4, 2), 16);
+                newStr += String.fromCharCode((c & 31) << 6 | c2 & 63);
+            } else {
+                newStr += str.substr(i, 6);
+            }
+            i += 6;
+        } else if (c >= 224) {
+            if (il - i >= 9) {
+                var _c = parseInt(str.substr(i + 4, 2), 16);
+                var c3 = parseInt(str.substr(i + 7, 2), 16);
+                newStr += String.fromCharCode((c & 15) << 12 | (_c & 63) << 6 | c3 & 63);
+            } else {
+                newStr += str.substr(i, 9);
+            }
+            i += 9;
+        } else {
+            newStr += str.substr(i, 3);
+            i += 3;
+        }
+    }
+    return newStr;
+}
+function _normalizeComponentEncoding(components, protocol) {
+    function decodeUnreserved(str) {
+        var decStr = pctDecChars(str);
+        return !decStr.match(protocol.UNRESERVED) ? str : decStr;
+    }
+    if (components.scheme) components.scheme = String(components.scheme).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_SCHEME, "");
+    if (components.userinfo !== undefined) components.userinfo = String(components.userinfo).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_USERINFO, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.host !== undefined) components.host = String(components.host).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_HOST, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.path !== undefined) components.path = String(components.path).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(components.scheme ? protocol.NOT_PATH : protocol.NOT_PATH_NOSCHEME, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.query !== undefined) components.query = String(components.query).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_QUERY, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.fragment !== undefined) components.fragment = String(components.fragment).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_FRAGMENT, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    return components;
+}
+
+function _stripLeadingZeros(str) {
+    return str.replace(/^0*(.*)/, "$1") || "0";
+}
+function _normalizeIPv4(host, protocol) {
+    var matches = host.match(protocol.IPV4ADDRESS) || [];
+
+    var _matches = slicedToArray(matches, 2),
+        address = _matches[1];
+
+    if (address) {
+        return address.split(".").map(_stripLeadingZeros).join(".");
+    } else {
+        return host;
+    }
+}
+function _normalizeIPv6(host, protocol) {
+    var matches = host.match(protocol.IPV6ADDRESS) || [];
+
+    var _matches2 = slicedToArray(matches, 3),
+        address = _matches2[1],
+        zone = _matches2[2];
+
+    if (address) {
+        var _address$toLowerCase$ = address.toLowerCase().split('::').reverse(),
+            _address$toLowerCase$2 = slicedToArray(_address$toLowerCase$, 2),
+            last = _address$toLowerCase$2[0],
+            first = _address$toLowerCase$2[1];
+
+        var firstFields = first ? first.split(":").map(_stripLeadingZeros) : [];
+        var lastFields = last.split(":").map(_stripLeadingZeros);
+        var isLastFieldIPv4Address = protocol.IPV4ADDRESS.test(lastFields[lastFields.length - 1]);
+        var fieldCount = isLastFieldIPv4Address ? 7 : 8;
+        var lastFieldsStart = lastFields.length - fieldCount;
+        var fields = Array(fieldCount);
+        for (var x = 0; x < fieldCount; ++x) {
+            fields[x] = firstFields[x] || lastFields[lastFieldsStart + x] || '';
+        }
+        if (isLastFieldIPv4Address) {
+            fields[fieldCount - 1] = _normalizeIPv4(fields[fieldCount - 1], protocol);
+        }
+        var allZeroFields = fields.reduce(function (acc, field, index) {
+            if (!field || field === "0") {
+                var lastLongest = acc[acc.length - 1];
+                if (lastLongest && lastLongest.index + lastLongest.length === index) {
+                    lastLongest.length++;
+                } else {
+                    acc.push({ index: index, length: 1 });
+                }
+            }
+            return acc;
+        }, []);
+        var longestZeroFields = allZeroFields.sort(function (a, b) {
+            return b.length - a.length;
+        })[0];
+        var newHost = void 0;
+        if (longestZeroFields && longestZeroFields.length > 1) {
+            var newFirst = fields.slice(0, longestZeroFields.index);
+            var newLast = fields.slice(longestZeroFields.index + longestZeroFields.length);
+            newHost = newFirst.join(":") + "::" + newLast.join(":");
+        } else {
+            newHost = fields.join(":");
+        }
+        if (zone) {
+            newHost += "%" + zone;
+        }
+        return newHost;
+    } else {
+        return host;
+    }
+}
+var URI_PARSE = /^(?:([^:\/?#]+):)?(?:\/\/((?:([^\/?#@]*)@)?(\[[^\/?#\]]+\]|[^\/?#:]*)(?:\:(\d*))?))?([^?#]*)(?:\?([^#]*))?(?:#((?:.|\n|\r)*))?/i;
+var NO_MATCH_IS_UNDEFINED = "".match(/(){0}/)[1] === undefined;
+function parse(uriString) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+
+    var components = {};
+    var protocol = options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL;
+    if (options.reference === "suffix") uriString = (options.scheme ? options.scheme + ":" : "") + "//" + uriString;
+    var matches = uriString.match(URI_PARSE);
+    if (matches) {
+        if (NO_MATCH_IS_UNDEFINED) {
+            //store each component
+            components.scheme = matches[1];
+            components.userinfo = matches[3];
+            components.host = matches[4];
+            components.port = parseInt(matches[5], 10);
+            components.path = matches[6] || "";
+            components.query = matches[7];
+            components.fragment = matches[8];
+            //fix port number
+            if (isNaN(components.port)) {
+                components.port = matches[5];
+            }
+        } else {
+            //IE FIX for improper RegExp matching
+            //store each component
+            components.scheme = matches[1] || undefined;
+            components.userinfo = uriString.indexOf("@") !== -1 ? matches[3] : undefined;
+            components.host = uriString.indexOf("//") !== -1 ? matches[4] : undefined;
+            components.port = parseInt(matches[5], 10);
+            components.path = matches[6] || "";
+            components.query = uriString.indexOf("?") !== -1 ? matches[7] : undefined;
+            components.fragment = uriString.indexOf("#") !== -1 ? matches[8] : undefined;
+            //fix port number
+            if (isNaN(components.port)) {
+                components.port = uriString.match(/\/\/(?:.|\n)*\:(?:\/|\?|\#|$)/) ? matches[4] : undefined;
+            }
+        }
+        if (components.host) {
+            //normalize IP hosts
+            components.host = _normalizeIPv6(_normalizeIPv4(components.host, protocol), protocol);
+        }
+        //determine reference type
+        if (components.scheme === undefined && components.userinfo === undefined && components.host === undefined && components.port === undefined && !components.path && components.query === undefined) {
+            components.reference = "same-document";
+        } else if (components.scheme === undefined) {
+            components.reference = "relative";
+        } else if (components.fragment === undefined) {
+            components.reference = "absolute";
+        } else {
+            components.reference = "uri";
+        }
+        //check for reference errors
+        if (options.reference && options.reference !== "suffix" && options.reference !== components.reference) {
+            components.error = components.error || "URI is not a " + options.reference + " reference.";
+        }
+        //find scheme handler
+        var schemeHandler = SCHEMES[(options.scheme || components.scheme || "").toLowerCase()];
+        //check if scheme can't handle IRIs
+        if (!options.unicodeSupport && (!schemeHandler || !schemeHandler.unicodeSupport)) {
+            //if host component is a domain name
+            if (components.host && (options.domainHost || schemeHandler && schemeHandler.domainHost)) {
+                //convert Unicode IDN -> ASCII IDN
+                try {
+                    components.host = punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase());
+                } catch (e) {
+                    components.error = components.error || "Host's domain name can not be converted to ASCII via punycode: " + e;
+                }
+            }
+            //convert IRI -> URI
+            _normalizeComponentEncoding(components, URI_PROTOCOL);
+        } else {
+            //normalize encodings
+            _normalizeComponentEncoding(components, protocol);
+        }
+        //perform scheme specific parsing
+        if (schemeHandler && schemeHandler.parse) {
+            schemeHandler.parse(components, options);
+        }
+    } else {
+        components.error = components.error || "URI can not be parsed.";
+    }
+    return components;
+}
+
+function _recomposeAuthority(components, options) {
+    var protocol = options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL;
+    var uriTokens = [];
+    if (components.userinfo !== undefined) {
+        uriTokens.push(components.userinfo);
+        uriTokens.push("@");
+    }
+    if (components.host !== undefined) {
+        //normalize IP hosts, add brackets and escape zone separator for IPv6
+        uriTokens.push(_normalizeIPv6(_normalizeIPv4(String(components.host), protocol), protocol).replace(protocol.IPV6ADDRESS, function (_, $1, $2) {
+            return "[" + $1 + ($2 ? "%25" + $2 : "") + "]";
+        }));
+    }
+    if (typeof components.port === "number" || typeof components.port === "string") {
+        uriTokens.push(":");
+        uriTokens.push(String(components.port));
+    }
+    return uriTokens.length ? uriTokens.join("") : undefined;
+}
+
+var RDS1 = /^\.\.?\//;
+var RDS2 = /^\/\.(\/|$)/;
+var RDS3 = /^\/\.\.(\/|$)/;
+var RDS5 = /^\/?(?:.|\n)*?(?=\/|$)/;
+function removeDotSegments(input) {
+    var output = [];
+    while (input.length) {
+        if (input.match(RDS1)) {
+            input = input.replace(RDS1, "");
+        } else if (input.match(RDS2)) {
+            input = input.replace(RDS2, "/");
+        } else if (input.match(RDS3)) {
+            input = input.replace(RDS3, "/");
+            output.pop();
+        } else if (input === "." || input === "..") {
+            input = "";
+        } else {
+            var im = input.match(RDS5);
+            if (im) {
+                var s = im[0];
+                input = input.slice(s.length);
+                output.push(s);
+            } else {
+                throw new Error("Unexpected dot segment condition");
+            }
+        }
+    }
+    return output.join("");
+}
+
+function serialize(components) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+
+    var protocol = options.iri ? IRI_PROTOCOL : URI_PROTOCOL;
+    var uriTokens = [];
+    //find scheme handler
+    var schemeHandler = SCHEMES[(options.scheme || components.scheme || "").toLowerCase()];
+    //perform scheme specific serialization
+    if (schemeHandler && schemeHandler.serialize) schemeHandler.serialize(components, options);
+    if (components.host) {
+        //if host component is an IPv6 address
+        if (protocol.IPV6ADDRESS.test(components.host)) {}
+        //TODO: normalize IPv6 address as per RFC 5952
+
+        //if host component is a domain name
+        else if (options.domainHost || schemeHandler && schemeHandler.domainHost) {
+                //convert IDN via punycode
+                try {
+                    components.host = !options.iri ? punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase()) : punycode.toUnicode(components.host);
+                } catch (e) {
+                    components.error = components.error || "Host's domain name can not be converted to " + (!options.iri ? "ASCII" : "Unicode") + " via punycode: " + e;
+                }
+            }
+    }
+    //normalize encoding
+    _normalizeComponentEncoding(components, protocol);
+    if (options.reference !== "suffix" && components.scheme) {
+        uriTokens.push(components.scheme);
+        uriTokens.push(":");
+    }
+    var authority = _recomposeAuthority(components, options);
+    if (authority !== undefined) {
+        if (options.reference !== "suffix") {
+            uriTokens.push("//");
+        }
+        uriTokens.push(authority);
+        if (components.path && components.path.charAt(0) !== "/") {
+            uriTokens.push("/");
+        }
+    }
+    if (components.path !== undefined) {
+        var s = components.path;
+        if (!options.absolutePath && (!schemeHandler || !schemeHandler.absolutePath)) {
+            s = removeDotSegments(s);
+        }
+        if (authority === undefined) {
+            s = s.replace(/^\/\//, "/%2F"); //don't allow the path to start with "//"
+        }
+        uriTokens.push(s);
+    }
+    if (components.query !== undefined) {
+        uriTokens.push("?");
+        uriTokens.push(components.query);
+    }
+    if (components.fragment !== undefined) {
+        uriTokens.push("#");
+        uriTokens.push(components.fragment);
+    }
+    return uriTokens.join(""); //merge tokens into a string
+}
+
+function resolveComponents(base, relative) {
+    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+    var skipNormalization = arguments[3];
+
+    var target = {};
+    if (!skipNormalization) {
+        base = parse(serialize(base, options), options); //normalize base components
+        relative = parse(serialize(relative, options), options); //normalize relative components
+    }
+    options = options || {};
+    if (!options.tolerant && relative.scheme) {
+        target.scheme = relative.scheme;
+        //target.authority = relative.authority;
+        target.userinfo = relative.userinfo;
+        target.host = relative.host;
+        target.port = relative.port;
+        target.path = removeDotSegments(relative.path || "");
+        target.query = relative.query;
+    } else {
+        if (relative.userinfo !== undefined || relative.host !== undefined || relative.port !== undefined) {
+            //target.authority = relative.authority;
+            target.userinfo = relative.userinfo;
+            target.host = relative.host;
+            target.port = relative.port;
+            target.path = removeDotSegments(relative.path || "");
+            target.query = relative.query;
+        } else {
+            if (!relative.path) {
+                target.path = base.path;
+                if (relative.query !== undefined) {
+                    target.query = relative.query;
+                } else {
+                    target.query = base.query;
+                }
+            } else {
+                if (relative.path.charAt(0) === "/") {
+                    target.path = removeDotSegments(relative.path);
+                } else {
+                    if ((base.userinfo !== undefined || base.host !== undefined || base.port !== undefined) && !base.path) {
+                        target.path = "/" + relative.path;
+                    } else if (!base.path) {
+                        target.path = relative.path;
+                    } else {
+                        target.path = base.path.slice(0, base.path.lastIndexOf("/") + 1) + relative.path;
+                    }
+                    target.path = removeDotSegments(target.path);
+                }
+                target.query = relative.query;
+            }
+            //target.authority = base.authority;
+            target.userinfo = base.userinfo;
+            target.host = base.host;
+            target.port = base.port;
+        }
+        target.scheme = base.scheme;
+    }
+    target.fragment = relative.fragment;
+    return target;
+}
+
+function resolve(baseURI, relativeURI, options) {
+    var schemelessOptions = assign({ scheme: 'null' }, options);
+    return serialize(resolveComponents(parse(baseURI, schemelessOptions), parse(relativeURI, schemelessOptions), schemelessOptions, true), schemelessOptions);
+}
+
+function normalize(uri, options) {
+    if (typeof uri === "string") {
+        uri = serialize(parse(uri, options), options);
+    } else if (typeOf(uri) === "object") {
+        uri = parse(serialize(uri, options), options);
+    }
+    return uri;
+}
+
+function equal(uriA, uriB, options) {
+    if (typeof uriA === "string") {
+        uriA = serialize(parse(uriA, options), options);
+    } else if (typeOf(uriA) === "object") {
+        uriA = serialize(uriA, options);
+    }
+    if (typeof uriB === "string") {
+        uriB = serialize(parse(uriB, options), options);
+    } else if (typeOf(uriB) === "object") {
+        uriB = serialize(uriB, options);
+    }
+    return uriA === uriB;
+}
+
+function escapeComponent(str, options) {
+    return str && str.toString().replace(!options || !options.iri ? URI_PROTOCOL.ESCAPE : IRI_PROTOCOL.ESCAPE, pctEncChar);
+}
+
+function unescapeComponent(str, options) {
+    return str && str.toString().replace(!options || !options.iri ? URI_PROTOCOL.PCT_ENCODED : IRI_PROTOCOL.PCT_ENCODED, pctDecChars);
+}
+
+var handler = {
+    scheme: "http",
+    domainHost: true,
+    parse: function parse(components, options) {
+        //report missing host
+        if (!components.host) {
+            components.error = components.error || "HTTP URIs must have a host.";
+        }
+        return components;
+    },
+    serialize: function serialize(components, options) {
+        var secure = String(components.scheme).toLowerCase() === "https";
+        //normalize the default port
+        if (components.port === (secure ? 443 : 80) || components.port === "") {
+            components.port = undefined;
+        }
+        //normalize the empty path
+        if (!components.path) {
+            components.path = "/";
+        }
+        //NOTE: We do not parse query strings for HTTP URIs
+        //as WWW Form Url Encoded query strings are part of the HTML4+ spec,
+        //and not the HTTP spec.
+        return components;
+    }
+};
+
+var handler$1 = {
+    scheme: "https",
+    domainHost: handler.domainHost,
+    parse: handler.parse,
+    serialize: handler.serialize
+};
+
+function isSecure(wsComponents) {
+    return typeof wsComponents.secure === 'boolean' ? wsComponents.secure : String(wsComponents.scheme).toLowerCase() === "wss";
+}
+//RFC 6455
+var handler$2 = {
+    scheme: "ws",
+    domainHost: true,
+    parse: function parse(components, options) {
+        var wsComponents = components;
+        //indicate if the secure flag is set
+        wsComponents.secure = isSecure(wsComponents);
+        //construct resouce name
+        wsComponents.resourceName = (wsComponents.path || '/') + (wsComponents.query ? '?' + wsComponents.query : '');
+        wsComponents.path = undefined;
+        wsComponents.query = undefined;
+        return wsComponents;
+    },
+    serialize: function serialize(wsComponents, options) {
+        //normalize the default port
+        if (wsComponents.port === (isSecure(wsComponents) ? 443 : 80) || wsComponents.port === "") {
+            wsComponents.port = undefined;
+        }
+        //ensure scheme matches secure flag
+        if (typeof wsComponents.secure === 'boolean') {
+            wsComponents.scheme = wsComponents.secure ? 'wss' : 'ws';
+            wsComponents.secure = undefined;
+        }
+        //reconstruct path from resource name
+        if (wsComponents.resourceName) {
+            var _wsComponents$resourc = wsComponents.resourceName.split('?'),
+                _wsComponents$resourc2 = slicedToArray(_wsComponents$resourc, 2),
+                path = _wsComponents$resourc2[0],
+                query = _wsComponents$resourc2[1];
+
+            wsComponents.path = path && path !== '/' ? path : undefined;
+            wsComponents.query = query;
+            wsComponents.resourceName = undefined;
+        }
+        //forbid fragment component
+        wsComponents.fragment = undefined;
+        return wsComponents;
+    }
+};
+
+var handler$3 = {
+    scheme: "wss",
+    domainHost: handler$2.domainHost,
+    parse: handler$2.parse,
+    serialize: handler$2.serialize
+};
+
+var O = {};
+var isIRI = true;
+//RFC 3986
+var UNRESERVED$$ = "[A-Za-z0-9\\-\\.\\_\\~" + (isIRI ? "\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF" : "") + "]";
+var HEXDIG$$ = "[0-9A-Fa-f]"; //case-insensitive
+var PCT_ENCODED$ = subexp(subexp("%[EFef]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%[89A-Fa-f]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%" + HEXDIG$$ + HEXDIG$$)); //expanded
+//RFC 5322, except these symbols as per RFC 6068: @ : / ? # [ ] & ; =
+//const ATEXT$$ = "[A-Za-z0-9\\!\\#\\$\\%\\&\\'\\*\\+\\-\\/\\=\\?\\^\\_\\`\\{\\|\\}\\~]";
+//const WSP$$ = "[\\x20\\x09]";
+//const OBS_QTEXT$$ = "[\\x01-\\x08\\x0B\\x0C\\x0E-\\x1F\\x7F]";  //(%d1-8 / %d11-12 / %d14-31 / %d127)
+//const QTEXT$$ = merge("[\\x21\\x23-\\x5B\\x5D-\\x7E]", OBS_QTEXT$$);  //%d33 / %d35-91 / %d93-126 / obs-qtext
+//const VCHAR$$ = "[\\x21-\\x7E]";
+//const WSP$$ = "[\\x20\\x09]";
+//const OBS_QP$ = subexp("\\\\" + merge("[\\x00\\x0D\\x0A]", OBS_QTEXT$$));  //%d0 / CR / LF / obs-qtext
+//const FWS$ = subexp(subexp(WSP$$ + "*" + "\\x0D\\x0A") + "?" + WSP$$ + "+");
+//const QUOTED_PAIR$ = subexp(subexp("\\\\" + subexp(VCHAR$$ + "|" + WSP$$)) + "|" + OBS_QP$);
+//const QUOTED_STRING$ = subexp('\\"' + subexp(FWS$ + "?" + QCONTENT$) + "*" + FWS$ + "?" + '\\"');
+var ATEXT$$ = "[A-Za-z0-9\\!\\$\\%\\'\\*\\+\\-\\^\\_\\`\\{\\|\\}\\~]";
+var QTEXT$$ = "[\\!\\$\\%\\'\\(\\)\\*\\+\\,\\-\\.0-9\\<\\>A-Z\\x5E-\\x7E]";
+var VCHAR$$ = merge(QTEXT$$, "[\\\"\\\\]");
+var SOME_DELIMS$$ = "[\\!\\$\\'\\(\\)\\*\\+\\,\\;\\:\\@]";
+var UNRESERVED = new RegExp(UNRESERVED$$, "g");
+var PCT_ENCODED = new RegExp(PCT_ENCODED$, "g");
+var NOT_LOCAL_PART = new RegExp(merge("[^]", ATEXT$$, "[\\.]", '[\\"]', VCHAR$$), "g");
+var NOT_HFNAME = new RegExp(merge("[^]", UNRESERVED$$, SOME_DELIMS$$), "g");
+var NOT_HFVALUE = NOT_HFNAME;
+function decodeUnreserved(str) {
+    var decStr = pctDecChars(str);
+    return !decStr.match(UNRESERVED) ? str : decStr;
+}
+var handler$4 = {
+    scheme: "mailto",
+    parse: function parse$$1(components, options) {
+        var mailtoComponents = components;
+        var to = mailtoComponents.to = mailtoComponents.path ? mailtoComponents.path.split(",") : [];
+        mailtoComponents.path = undefined;
+        if (mailtoComponents.query) {
+            var unknownHeaders = false;
+            var headers = {};
+            var hfields = mailtoComponents.query.split("&");
+            for (var x = 0, xl = hfields.length; x < xl; ++x) {
+                var hfield = hfields[x].split("=");
+                switch (hfield[0]) {
+                    case "to":
+                        var toAddrs = hfield[1].split(",");
+                        for (var _x = 0, _xl = toAddrs.length; _x < _xl; ++_x) {
+                            to.push(toAddrs[_x]);
+                        }
+                        break;
+                    case "subject":
+                        mailtoComponents.subject = unescapeComponent(hfield[1], options);
+                        break;
+                    case "body":
+                        mailtoComponents.body = unescapeComponent(hfield[1], options);
+                        break;
+                    default:
+                        unknownHeaders = true;
+                        headers[unescapeComponent(hfield[0], options)] = unescapeComponent(hfield[1], options);
+                        break;
+                }
+            }
+            if (unknownHeaders) mailtoComponents.headers = headers;
+        }
+        mailtoComponents.query = undefined;
+        for (var _x2 = 0, _xl2 = to.length; _x2 < _xl2; ++_x2) {
+            var addr = to[_x2].split("@");
+            addr[0] = unescapeComponent(addr[0]);
+            if (!options.unicodeSupport) {
+                //convert Unicode IDN -> ASCII IDN
+                try {
+                    addr[1] = punycode.toASCII(unescapeComponent(addr[1], options).toLowerCase());
+                } catch (e) {
+                    mailtoComponents.error = mailtoComponents.error || "Email address's domain name can not be converted to ASCII via punycode: " + e;
+                }
+            } else {
+                addr[1] = unescapeComponent(addr[1], options).toLowerCase();
+            }
+            to[_x2] = addr.join("@");
+        }
+        return mailtoComponents;
+    },
+    serialize: function serialize$$1(mailtoComponents, options) {
+        var components = mailtoComponents;
+        var to = toArray(mailtoComponents.to);
+        if (to) {
+            for (var x = 0, xl = to.length; x < xl; ++x) {
+                var toAddr = String(to[x]);
+                var atIdx = toAddr.lastIndexOf("@");
+                var localPart = toAddr.slice(0, atIdx).replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_LOCAL_PART, pctEncChar);
+                var domain = toAddr.slice(atIdx + 1);
+                //convert IDN via punycode
+                try {
+                    domain = !options.iri ? punycode.toASCII(unescapeComponent(domain, options).toLowerCase()) : punycode.toUnicode(domain);
+                } catch (e) {
+                    components.error = components.error || "Email address's domain name can not be converted to " + (!options.iri ? "ASCII" : "Unicode") + " via punycode: " + e;
+                }
+                to[x] = localPart + "@" + domain;
+            }
+            components.path = to.join(",");
+        }
+        var headers = mailtoComponents.headers = mailtoComponents.headers || {};
+        if (mailtoComponents.subject) headers["subject"] = mailtoComponents.subject;
+        if (mailtoComponents.body) headers["body"] = mailtoComponents.body;
+        var fields = [];
+        for (var name in headers) {
+            if (headers[name] !== O[name]) {
+                fields.push(name.replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFNAME, pctEncChar) + "=" + headers[name].replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFVALUE, pctEncChar));
+            }
+        }
+        if (fields.length) {
+            components.query = fields.join("&");
+        }
+        return components;
+    }
+};
+
+var URN_PARSE = /^([^\:]+)\:(.*)/;
+//RFC 2141
+var handler$5 = {
+    scheme: "urn",
+    parse: function parse$$1(components, options) {
+        var matches = components.path && components.path.match(URN_PARSE);
+        var urnComponents = components;
+        if (matches) {
+            var scheme = options.scheme || urnComponents.scheme || "urn";
+            var nid = matches[1].toLowerCase();
+            var nss = matches[2];
+            var urnScheme = scheme + ":" + (options.nid || nid);
+            var schemeHandler = SCHEMES[urnScheme];
+            urnComponents.nid = nid;
+            urnComponents.nss = nss;
+            urnComponents.path = undefined;
+            if (schemeHandler) {
+                urnComponents = schemeHandler.parse(urnComponents, options);
+            }
+        } else {
+            urnComponents.error = urnComponents.error || "URN can not be parsed.";
+        }
+        return urnComponents;
+    },
+    serialize: function serialize$$1(urnComponents, options) {
+        var scheme = options.scheme || urnComponents.scheme || "urn";
+        var nid = urnComponents.nid;
+        var urnScheme = scheme + ":" + (options.nid || nid);
+        var schemeHandler = SCHEMES[urnScheme];
+        if (schemeHandler) {
+            urnComponents = schemeHandler.serialize(urnComponents, options);
+        }
+        var uriComponents = urnComponents;
+        var nss = urnComponents.nss;
+        uriComponents.path = (nid || options.nid) + ":" + nss;
+        return uriComponents;
+    }
+};
+
+var UUID = /^[0-9A-Fa-f]{8}(?:\-[0-9A-Fa-f]{4}){3}\-[0-9A-Fa-f]{12}$/;
+//RFC 4122
+var handler$6 = {
+    scheme: "urn:uuid",
+    parse: function parse(urnComponents, options) {
+        var uuidComponents = urnComponents;
+        uuidComponents.uuid = uuidComponents.nss;
+        uuidComponents.nss = undefined;
+        if (!options.tolerant && (!uuidComponents.uuid || !uuidComponents.uuid.match(UUID))) {
+            uuidComponents.error = uuidComponents.error || "UUID is not valid.";
+        }
+        return uuidComponents;
+    },
+    serialize: function serialize(uuidComponents, options) {
+        var urnComponents = uuidComponents;
+        //normalize UUID
+        urnComponents.nss = (uuidComponents.uuid || "").toLowerCase();
+        return urnComponents;
+    }
+};
+
+SCHEMES[handler.scheme] = handler;
+SCHEMES[handler$1.scheme] = handler$1;
+SCHEMES[handler$2.scheme] = handler$2;
+SCHEMES[handler$3.scheme] = handler$3;
+SCHEMES[handler$4.scheme] = handler$4;
+SCHEMES[handler$5.scheme] = handler$5;
+SCHEMES[handler$6.scheme] = handler$6;
+
+exports.SCHEMES = SCHEMES;
+exports.pctEncChar = pctEncChar;
+exports.pctDecChars = pctDecChars;
+exports.parse = parse;
+exports.removeDotSegments = removeDotSegments;
+exports.serialize = serialize;
+exports.resolveComponents = resolveComponents;
+exports.resolve = resolve;
+exports.normalize = normalize;
+exports.equal = equal;
+exports.escapeComponent = escapeComponent;
+exports.unescapeComponent = unescapeComponent;
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+})));
+
+
+},{}],"ajv":[function(require,module,exports){
+'use strict';
+
+var compileSchema = require('./compile')
+  , resolve = require('./compile/resolve')
+  , Cache = require('./cache')
+  , SchemaObject = require('./compile/schema_obj')
+  , stableStringify = require('fast-json-stable-stringify')
+  , formats = require('./compile/formats')
+  , rules = require('./compile/rules')
+  , $dataMetaSchema = require('./data')
+  , util = require('./compile/util');
+
+module.exports = Ajv;
+
+Ajv.prototype.validate = validate;
+Ajv.prototype.compile = compile;
+Ajv.prototype.addSchema = addSchema;
+Ajv.prototype.addMetaSchema = addMetaSchema;
+Ajv.prototype.validateSchema = validateSchema;
+Ajv.prototype.getSchema = getSchema;
+Ajv.prototype.removeSchema = removeSchema;
+Ajv.prototype.addFormat = addFormat;
+Ajv.prototype.errorsText = errorsText;
+
+Ajv.prototype._addSchema = _addSchema;
+Ajv.prototype._compile = _compile;
+
+Ajv.prototype.compileAsync = require('./compile/async');
+var customKeyword = require('./keyword');
+Ajv.prototype.addKeyword = customKeyword.add;
+Ajv.prototype.getKeyword = customKeyword.get;
+Ajv.prototype.removeKeyword = customKeyword.remove;
+Ajv.prototype.validateKeyword = customKeyword.validate;
+
+var errorClasses = require('./compile/error_classes');
+Ajv.ValidationError = errorClasses.Validation;
+Ajv.MissingRefError = errorClasses.MissingRef;
+Ajv.$dataMetaSchema = $dataMetaSchema;
+
+var META_SCHEMA_ID = 'http://json-schema.org/draft-07/schema';
+
+var META_IGNORE_OPTIONS = [ 'removeAdditional', 'useDefaults', 'coerceTypes', 'strictDefaults' ];
+var META_SUPPORT_DATA = ['/properties'];
+
+/**
+ * Creates validator instance.
+ * Usage: `Ajv(opts)`
+ * @param {Object} opts optional options
+ * @return {Object} ajv instance
+ */
+function Ajv(opts) {
+  if (!(this instanceof Ajv)) return new Ajv(opts);
+  opts = this._opts = util.copy(opts) || {};
+  setLogger(this);
+  this._schemas = {};
+  this._refs = {};
+  this._fragments = {};
+  this._formats = formats(opts.format);
+
+  this._cache = opts.cache || new Cache;
+  this._loadingSchemas = {};
+  this._compilations = [];
+  this.RULES = rules();
+  this._getId = chooseGetId(opts);
+
+  opts.loopRequired = opts.loopRequired || Infinity;
+  if (opts.errorDataPath == 'property') opts._errorDataPathProperty = true;
+  if (opts.serialize === undefined) opts.serialize = stableStringify;
+  this._metaOpts = getMetaSchemaOptions(this);
+
+  if (opts.formats) addInitialFormats(this);
+  if (opts.keywords) addInitialKeywords(this);
+  addDefaultMetaSchema(this);
+  if (typeof opts.meta == 'object') this.addMetaSchema(opts.meta);
+  if (opts.nullable) this.addKeyword('nullable', {metaSchema: {type: 'boolean'}});
+  addInitialSchemas(this);
+}
+
+
+
+/**
+ * Validate data using schema
+ * Schema will be compiled and cached (using serialized JSON as key. [fast-json-stable-stringify](https://github.com/epoberezkin/fast-json-stable-stringify) is used to serialize.
+ * @this   Ajv
+ * @param  {String|Object} schemaKeyRef key, ref or schema object
+ * @param  {Any} data to be validated
+ * @return {Boolean} validation result. Errors from the last validation will be available in `ajv.errors` (and also in compiled schema: `schema.errors`).
+ */
+function validate(schemaKeyRef, data) {
+  var v;
+  if (typeof schemaKeyRef == 'string') {
+    v = this.getSchema(schemaKeyRef);
+    if (!v) throw new Error('no schema with key or ref "' + schemaKeyRef + '"');
+  } else {
+    var schemaObj = this._addSchema(schemaKeyRef);
+    v = schemaObj.validate || this._compile(schemaObj);
+  }
+
+  var valid = v(data);
+  if (v.$async !== true) this.errors = v.errors;
+  return valid;
+}
+
+
+/**
+ * Create validating function for passed schema.
+ * @this   Ajv
+ * @param  {Object} schema schema object
+ * @param  {Boolean} _meta true if schema is a meta-schema. Used internally to compile meta schemas of custom keywords.
+ * @return {Function} validating function
+ */
+function compile(schema, _meta) {
+  var schemaObj = this._addSchema(schema, undefined, _meta);
+  return schemaObj.validate || this._compile(schemaObj);
+}
+
+
+/**
+ * Adds schema to the instance.
+ * @this   Ajv
+ * @param {Object|Array} schema schema or array of schemas. If array is passed, `key` and other parameters will be ignored.
+ * @param {String} key Optional schema key. Can be passed to `validate` method instead of schema object or id/ref. One schema per instance can have empty `id` and `key`.
+ * @param {Boolean} _skipValidation true to skip schema validation. Used internally, option validateSchema should be used instead.
+ * @param {Boolean} _meta true if schema is a meta-schema. Used internally, addMetaSchema should be used instead.
+ * @return {Ajv} this for method chaining
+ */
+function addSchema(schema, key, _skipValidation, _meta) {
+  if (Array.isArray(schema)){
+    for (var i=0; i<schema.length; i++) this.addSchema(schema[i], undefined, _skipValidation, _meta);
+    return this;
+  }
+  var id = this._getId(schema);
+  if (id !== undefined && typeof id != 'string')
+    throw new Error('schema id must be string');
+  key = resolve.normalizeId(key || id);
+  checkUnique(this, key);
+  this._schemas[key] = this._addSchema(schema, _skipValidation, _meta, true);
+  return this;
+}
+
+
+/**
+ * Add schema that will be used to validate other schemas
+ * options in META_IGNORE_OPTIONS are alway set to false
+ * @this   Ajv
+ * @param {Object} schema schema object
+ * @param {String} key optional schema key
+ * @param {Boolean} skipValidation true to skip schema validation, can be used to override validateSchema option for meta-schema
+ * @return {Ajv} this for method chaining
+ */
+function addMetaSchema(schema, key, skipValidation) {
+  this.addSchema(schema, key, skipValidation, true);
+  return this;
+}
+
+
+/**
+ * Validate schema
+ * @this   Ajv
+ * @param {Object} schema schema to validate
+ * @param {Boolean} throwOrLogError pass true to throw (or log) an error if invalid
+ * @return {Boolean} true if schema is valid
+ */
+function validateSchema(schema, throwOrLogError) {
+  var $schema = schema.$schema;
+  if ($schema !== undefined && typeof $schema != 'string')
+    throw new Error('$schema must be a string');
+  $schema = $schema || this._opts.defaultMeta || defaultMeta(this);
+  if (!$schema) {
+    this.logger.warn('meta-schema not available');
+    this.errors = null;
+    return true;
+  }
+  var valid = this.validate($schema, schema);
+  if (!valid && throwOrLogError) {
+    var message = 'schema is invalid: ' + this.errorsText();
+    if (this._opts.validateSchema == 'log') this.logger.error(message);
+    else throw new Error(message);
+  }
+  return valid;
+}
+
+
+function defaultMeta(self) {
+  var meta = self._opts.meta;
+  self._opts.defaultMeta = typeof meta == 'object'
+                            ? self._getId(meta) || meta
+                            : self.getSchema(META_SCHEMA_ID)
+                              ? META_SCHEMA_ID
+                              : undefined;
+  return self._opts.defaultMeta;
+}
+
+
+/**
+ * Get compiled schema from the instance by `key` or `ref`.
+ * @this   Ajv
+ * @param  {String} keyRef `key` that was passed to `addSchema` or full schema reference (`schema.id` or resolved id).
+ * @return {Function} schema validating function (with property `schema`).
+ */
+function getSchema(keyRef) {
+  var schemaObj = _getSchemaObj(this, keyRef);
+  switch (typeof schemaObj) {
+    case 'object': return schemaObj.validate || this._compile(schemaObj);
+    case 'string': return this.getSchema(schemaObj);
+    case 'undefined': return _getSchemaFragment(this, keyRef);
+  }
+}
+
+
+function _getSchemaFragment(self, ref) {
+  var res = resolve.schema.call(self, { schema: {} }, ref);
+  if (res) {
+    var schema = res.schema
+      , root = res.root
+      , baseId = res.baseId;
+    var v = compileSchema.call(self, schema, root, undefined, baseId);
+    self._fragments[ref] = new SchemaObject({
+      ref: ref,
+      fragment: true,
+      schema: schema,
+      root: root,
+      baseId: baseId,
+      validate: v
+    });
+    return v;
+  }
+}
+
+
+function _getSchemaObj(self, keyRef) {
+  keyRef = resolve.normalizeId(keyRef);
+  return self._schemas[keyRef] || self._refs[keyRef] || self._fragments[keyRef];
+}
+
+
+/**
+ * Remove cached schema(s).
+ * If no parameter is passed all schemas but meta-schemas are removed.
+ * If RegExp is passed all schemas with key/id matching pattern but meta-schemas are removed.
+ * Even if schema is referenced by other schemas it still can be removed as other schemas have local references.
+ * @this   Ajv
+ * @param  {String|Object|RegExp} schemaKeyRef key, ref, pattern to match key/ref or schema object
+ * @return {Ajv} this for method chaining
+ */
+function removeSchema(schemaKeyRef) {
+  if (schemaKeyRef instanceof RegExp) {
+    _removeAllSchemas(this, this._schemas, schemaKeyRef);
+    _removeAllSchemas(this, this._refs, schemaKeyRef);
+    return this;
+  }
+  switch (typeof schemaKeyRef) {
+    case 'undefined':
+      _removeAllSchemas(this, this._schemas);
+      _removeAllSchemas(this, this._refs);
+      this._cache.clear();
+      return this;
+    case 'string':
+      var schemaObj = _getSchemaObj(this, schemaKeyRef);
+      if (schemaObj) this._cache.del(schemaObj.cacheKey);
+      delete this._schemas[schemaKeyRef];
+      delete this._refs[schemaKeyRef];
+      return this;
+    case 'object':
+      var serialize = this._opts.serialize;
+      var cacheKey = serialize ? serialize(schemaKeyRef) : schemaKeyRef;
+      this._cache.del(cacheKey);
+      var id = this._getId(schemaKeyRef);
+      if (id) {
+        id = resolve.normalizeId(id);
+        delete this._schemas[id];
+        delete this._refs[id];
+      }
+  }
+  return this;
+}
+
+
+function _removeAllSchemas(self, schemas, regex) {
+  for (var keyRef in schemas) {
+    var schemaObj = schemas[keyRef];
+    if (!schemaObj.meta && (!regex || regex.test(keyRef))) {
+      self._cache.del(schemaObj.cacheKey);
+      delete schemas[keyRef];
+    }
+  }
+}
+
+
+/* @this   Ajv */
+function _addSchema(schema, skipValidation, meta, shouldAddSchema) {
+  if (typeof schema != 'object' && typeof schema != 'boolean')
+    throw new Error('schema should be object or boolean');
+  var serialize = this._opts.serialize;
+  var cacheKey = serialize ? serialize(schema) : schema;
+  var cached = this._cache.get(cacheKey);
+  if (cached) return cached;
+
+  shouldAddSchema = shouldAddSchema || this._opts.addUsedSchema !== false;
+
+  var id = resolve.normalizeId(this._getId(schema));
+  if (id && shouldAddSchema) checkUnique(this, id);
+
+  var willValidate = this._opts.validateSchema !== false && !skipValidation;
+  var recursiveMeta;
+  if (willValidate && !(recursiveMeta = id && id == resolve.normalizeId(schema.$schema)))
+    this.validateSchema(schema, true);
+
+  var localRefs = resolve.ids.call(this, schema);
+
+  var schemaObj = new SchemaObject({
+    id: id,
+    schema: schema,
+    localRefs: localRefs,
+    cacheKey: cacheKey,
+    meta: meta
+  });
+
+  if (id[0] != '#' && shouldAddSchema) this._refs[id] = schemaObj;
+  this._cache.put(cacheKey, schemaObj);
+
+  if (willValidate && recursiveMeta) this.validateSchema(schema, true);
+
+  return schemaObj;
+}
+
+
+/* @this   Ajv */
+function _compile(schemaObj, root) {
+  if (schemaObj.compiling) {
+    schemaObj.validate = callValidate;
+    callValidate.schema = schemaObj.schema;
+    callValidate.errors = null;
+    callValidate.root = root ? root : callValidate;
+    if (schemaObj.schema.$async === true)
+      callValidate.$async = true;
+    return callValidate;
+  }
+  schemaObj.compiling = true;
+
+  var currentOpts;
+  if (schemaObj.meta) {
+    currentOpts = this._opts;
+    this._opts = this._metaOpts;
+  }
+
+  var v;
+  try { v = compileSchema.call(this, schemaObj.schema, root, schemaObj.localRefs); }
+  catch(e) {
+    delete schemaObj.validate;
+    throw e;
+  }
+  finally {
+    schemaObj.compiling = false;
+    if (schemaObj.meta) this._opts = currentOpts;
+  }
+
+  schemaObj.validate = v;
+  schemaObj.refs = v.refs;
+  schemaObj.refVal = v.refVal;
+  schemaObj.root = v.root;
+  return v;
+
+
+  /* @this   {*} - custom context, see passContext option */
+  function callValidate() {
+    /* jshint validthis: true */
+    var _validate = schemaObj.validate;
+    var result = _validate.apply(this, arguments);
+    callValidate.errors = _validate.errors;
+    return result;
+  }
+}
+
+
+function chooseGetId(opts) {
+  switch (opts.schemaId) {
+    case 'auto': return _get$IdOrId;
+    case 'id': return _getId;
+    default: return _get$Id;
+  }
+}
+
+/* @this   Ajv */
+function _getId(schema) {
+  if (schema.$id) this.logger.warn('schema $id ignored', schema.$id);
+  return schema.id;
+}
+
+/* @this   Ajv */
+function _get$Id(schema) {
+  if (schema.id) this.logger.warn('schema id ignored', schema.id);
+  return schema.$id;
+}
+
+
+function _get$IdOrId(schema) {
+  if (schema.$id && schema.id && schema.$id != schema.id)
+    throw new Error('schema $id is different from id');
+  return schema.$id || schema.id;
+}
+
+
+/**
+ * Convert array of error message objects to string
+ * @this   Ajv
+ * @param  {Array<Object>} errors optional array of validation errors, if not passed errors from the instance are used.
+ * @param  {Object} options optional options with properties `separator` and `dataVar`.
+ * @return {String} human readable string with all errors descriptions
+ */
+function errorsText(errors, options) {
+  errors = errors || this.errors;
+  if (!errors) return 'No errors';
+  options = options || {};
+  var separator = options.separator === undefined ? ', ' : options.separator;
+  var dataVar = options.dataVar === undefined ? 'data' : options.dataVar;
+
+  var text = '';
+  for (var i=0; i<errors.length; i++) {
+    var e = errors[i];
+    if (e) text += dataVar + e.dataPath + ' ' + e.message + separator;
+  }
+  return text.slice(0, -separator.length);
+}
+
+
+/**
+ * Add custom format
+ * @this   Ajv
+ * @param {String} name format name
+ * @param {String|RegExp|Function} format string is converted to RegExp; function should return boolean (true when valid)
+ * @return {Ajv} this for method chaining
+ */
+function addFormat(name, format) {
+  if (typeof format == 'string') format = new RegExp(format);
+  this._formats[name] = format;
+  return this;
+}
+
+
+function addDefaultMetaSchema(self) {
+  var $dataSchema;
+  if (self._opts.$data) {
+    $dataSchema = require('./refs/data.json');
+    self.addMetaSchema($dataSchema, $dataSchema.$id, true);
+  }
+  if (self._opts.meta === false) return;
+  var metaSchema = require('./refs/json-schema-draft-07.json');
+  if (self._opts.$data) metaSchema = $dataMetaSchema(metaSchema, META_SUPPORT_DATA);
+  self.addMetaSchema(metaSchema, META_SCHEMA_ID, true);
+  self._refs['http://json-schema.org/schema'] = META_SCHEMA_ID;
+}
+
+
+function addInitialSchemas(self) {
+  var optsSchemas = self._opts.schemas;
+  if (!optsSchemas) return;
+  if (Array.isArray(optsSchemas)) self.addSchema(optsSchemas);
+  else for (var key in optsSchemas) self.addSchema(optsSchemas[key], key);
+}
+
+
+function addInitialFormats(self) {
+  for (var name in self._opts.formats) {
+    var format = self._opts.formats[name];
+    self.addFormat(name, format);
+  }
+}
+
+
+function addInitialKeywords(self) {
+  for (var name in self._opts.keywords) {
+    var keyword = self._opts.keywords[name];
+    self.addKeyword(name, keyword);
+  }
+}
+
+
+function checkUnique(self, id) {
+  if (self._schemas[id] || self._refs[id])
+    throw new Error('schema with key or id "' + id + '" already exists');
+}
+
+
+function getMetaSchemaOptions(self) {
+  var metaOpts = util.copy(self._opts);
+  for (var i=0; i<META_IGNORE_OPTIONS.length; i++)
+    delete metaOpts[META_IGNORE_OPTIONS[i]];
+  return metaOpts;
+}
+
+
+function setLogger(self) {
+  var logger = self._opts.logger;
+  if (logger === false) {
+    self.logger = {log: noop, warn: noop, error: noop};
+  } else {
+    if (logger === undefined) logger = console;
+    if (!(typeof logger == 'object' && logger.log && logger.warn && logger.error))
+      throw new Error('logger must implement log, warn and error methods');
+    self.logger = logger;
+  }
+}
+
+
+function noop() {}
+
+},{"./cache":1,"./compile":5,"./compile/async":2,"./compile/error_classes":3,"./compile/formats":4,"./compile/resolve":6,"./compile/rules":7,"./compile/schema_obj":8,"./compile/util":10,"./data":11,"./keyword":39,"./refs/data.json":40,"./refs/json-schema-draft-07.json":41,"fast-json-stable-stringify":43}]},{},[])("ajv")
+});
diff --git a/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.min.js b/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.min.js
new file mode 100644
index 0000000..7a60eb8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.min.js
@@ -0,0 +1,3 @@
+/* ajv 6.12.6: Another JSON Schema Validator */
+!function(e){"object"==typeof exports&&"undefined"!=typeof module?module.exports=e():"function"==typeof define&&define.amd?define([],e):("undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this).Ajv=e()}(function(){return function o(i,n,l){function c(r,e){if(!n[r]){if(!i[r]){var t="function"==typeof require&&require;if(!e&&t)return t(r,!0);if(u)return u(r,!0);var a=new Error("Cannot find module '"+r+"'");throw a.code="MODULE_NOT_FOUND",a}var s=n[r]={exports:{}};i[r][0].call(s.exports,function(e){return c(i[r][1][e]||e)},s,s.exports,o,i,n,l)}return n[r].exports}for(var u="function"==typeof require&&require,e=0;e<l.length;e++)c(l[e]);return c}({1:[function(e,r,t){"use strict";var a=r.exports=function(){this._cache={}};a.prototype.put=function(e,r){this._cache[e]=r},a.prototype.get=function(e){return this._cache[e]},a.prototype.del=function(e){delete this._cache[e]},a.prototype.clear=function(){this._cache={}}},{}],2:[function(e,r,t){"use strict";var a=e("./error_classes").MissingRef;function s(r,n,t){var l=this;if("function"!=typeof this._opts.loadSchema)throw new Error("options.loadSchema should be a function");"function"==typeof n&&(t=n,n=void 0);var e=c(r).then(function(){var e=l._addSchema(r,void 0,n);return e.validate||function o(i){try{return l._compile(i)}catch(e){if(e instanceof a)return r(e);throw e}function r(e){var r=e.missingSchema;if(s(r))throw new Error("Schema "+r+" is loaded but "+e.missingRef+" cannot be resolved");var t=l._loadingSchemas[r];return t||(t=l._loadingSchemas[r]=l._opts.loadSchema(r)).then(a,a),t.then(function(e){if(!s(r))return c(e).then(function(){s(r)||l.addSchema(e,r,void 0,n)})}).then(function(){return o(i)});function a(){delete l._loadingSchemas[r]}function s(e){return l._refs[e]||l._schemas[e]}}}(e)});return t&&e.then(function(e){t(null,e)},t),e;function c(e){var r=e.$schema;return r&&!l.getSchema(r)?s.call(l,{$ref:r},!0):Promise.resolve()}}r.exports=s},{"./error_classes":3}],3:[function(e,r,t){"use strict";var a=e("./resolve");function s(e,r,t){this.message=t||s.message(e,r),this.missingRef=a.url(e,r),this.missingSchema=a.normalizeId(a.fullPath(this.missingRef))}function o(e){return e.prototype=Object.create(Error.prototype),e.prototype.constructor=e}r.exports={Validation:o(function(e){this.message="validation failed",this.errors=e,this.ajv=this.validation=!0}),MissingRef:o(s)},s.message=function(e,r){return"can't resolve reference "+r+" from id "+e}},{"./resolve":6}],4:[function(e,r,t){"use strict";var a=e("./util"),o=/^(\d\d\d\d)-(\d\d)-(\d\d)$/,i=[0,31,28,31,30,31,30,31,31,30,31,30,31],n=/^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i,s=/^(?=.{1,253}\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\.?$/i,l=/^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i,c=/^(?:(?:[^\x00-\x20"'<>%\\^`{|}]|%[0-9a-f]{2})|\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?)*\})*$/i,u=/^(?:(?:http[s\u017F]?|ftp):\/\/)(?:(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+(?::(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])*)?@)?(?:(?!10(?:\.[0-9]{1,3}){3})(?!127(?:\.[0-9]{1,3}){3})(?!169\.254(?:\.[0-9]{1,3}){2})(?!192\.168(?:\.[0-9]{1,3}){2})(?!172\.(?:1[6-9]|2[0-9]|3[01])(?:\.[0-9]{1,3}){2})(?:[1-9][0-9]?|1[0-9][0-9]|2[01][0-9]|22[0-3])(?:\.(?:1?[0-9]{1,2}|2[0-4][0-9]|25[0-5])){2}(?:\.(?:[1-9][0-9]?|1[0-9][0-9]|2[0-4][0-9]|25[0-4]))|(?:(?:(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+-)*(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+)(?:\.(?:(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+-)*(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+)*(?:\.(?:(?:[a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]){2,})))(?::[0-9]{2,5})?(?:\/(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])*)?$/i,h=/^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i,d=/^(?:\/(?:[^~/]|~0|~1)*)*$/,p=/^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i,f=/^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/;function m(e){return a.copy(m[e="full"==e?"full":"fast"])}function v(e){var r=e.match(o);if(!r)return!1;var t,a=+r[2],s=+r[3];return 1<=a&&a<=12&&1<=s&&s<=(2!=a||((t=+r[1])%4!=0||t%100==0&&t%400!=0)?i[a]:29)}function y(e,r){var t=e.match(n);if(!t)return!1;var a=t[1],s=t[2],o=t[3];return(a<=23&&s<=59&&o<=59||23==a&&59==s&&60==o)&&(!r||t[5])}(r.exports=m).fast={date:/^\d\d\d\d-[0-1]\d-[0-3]\d$/,time:/^(?:[0-2]\d:[0-5]\d:[0-5]\d|23:59:60)(?:\.\d+)?(?:z|[+-]\d\d(?::?\d\d)?)?$/i,"date-time":/^\d\d\d\d-[0-1]\d-[0-3]\d[t\s](?:[0-2]\d:[0-5]\d:[0-5]\d|23:59:60)(?:\.\d+)?(?:z|[+-]\d\d(?::?\d\d)?)$/i,uri:/^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/)?[^\s]*$/i,"uri-reference":/^(?:(?:[a-z][a-z0-9+\-.]*:)?\/?\/)?(?:[^\\\s#][^\s#]*)?(?:#[^\\\s]*)?$/i,"uri-template":c,url:u,email:/^[a-z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?)*$/i,hostname:s,ipv4:/^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/,ipv6:/^\s*(?:(?:(?:[0-9a-f]{1,4}:){7}(?:[0-9a-f]{1,4}|:))|(?:(?:[0-9a-f]{1,4}:){6}(?::[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){5}(?:(?:(?::[0-9a-f]{1,4}){1,2})|:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){4}(?:(?:(?::[0-9a-f]{1,4}){1,3})|(?:(?::[0-9a-f]{1,4})?:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){3}(?:(?:(?::[0-9a-f]{1,4}){1,4})|(?:(?::[0-9a-f]{1,4}){0,2}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){2}(?:(?:(?::[0-9a-f]{1,4}){1,5})|(?:(?::[0-9a-f]{1,4}){0,3}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){1}(?:(?:(?::[0-9a-f]{1,4}){1,6})|(?:(?::[0-9a-f]{1,4}){0,4}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?::(?:(?:(?::[0-9a-f]{1,4}){1,7})|(?:(?::[0-9a-f]{1,4}){0,5}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))(?:%.+)?\s*$/i,regex:w,uuid:h,"json-pointer":d,"json-pointer-uri-fragment":p,"relative-json-pointer":f},m.full={date:v,time:y,"date-time":function(e){var r=e.split(g);return 2==r.length&&v(r[0])&&y(r[1],!0)},uri:function(e){return P.test(e)&&l.test(e)},"uri-reference":/^(?:[a-z][a-z0-9+\-.]*:)?(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'"()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\?(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i,"uri-template":c,url:u,email:/^[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*@(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?$/i,hostname:s,ipv4:/^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/,ipv6:/^\s*(?:(?:(?:[0-9a-f]{1,4}:){7}(?:[0-9a-f]{1,4}|:))|(?:(?:[0-9a-f]{1,4}:){6}(?::[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){5}(?:(?:(?::[0-9a-f]{1,4}){1,2})|:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){4}(?:(?:(?::[0-9a-f]{1,4}){1,3})|(?:(?::[0-9a-f]{1,4})?:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){3}(?:(?:(?::[0-9a-f]{1,4}){1,4})|(?:(?::[0-9a-f]{1,4}){0,2}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){2}(?:(?:(?::[0-9a-f]{1,4}){1,5})|(?:(?::[0-9a-f]{1,4}){0,3}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){1}(?:(?:(?::[0-9a-f]{1,4}){1,6})|(?:(?::[0-9a-f]{1,4}){0,4}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?::(?:(?:(?::[0-9a-f]{1,4}){1,7})|(?:(?::[0-9a-f]{1,4}){0,5}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))(?:%.+)?\s*$/i,regex:w,uuid:h,"json-pointer":d,"json-pointer-uri-fragment":p,"relative-json-pointer":f};var g=/t|\s/i;var P=/\/|:/;var E=/[^\\]\\Z/;function w(e){if(E.test(e))return!1;try{return new RegExp(e),!0}catch(e){return!1}}},{"./util":10}],5:[function(e,r,t){"use strict";var R=e("./resolve"),$=e("./util"),j=e("./error_classes"),D=e("fast-json-stable-stringify"),O=e("../dotjs/validate"),I=$.ucs2length,A=e("fast-deep-equal"),k=j.Validation;function C(e,c,u,r){var d=this,p=this._opts,h=[void 0],f={},l=[],t={},m=[],a={},v=[],s=function(e,r,t){var a=L.call(this,e,r,t);return 0<=a?{index:a,compiling:!0}:{index:a=this._compilations.length,compiling:!(this._compilations[a]={schema:e,root:r,baseId:t})}}.call(this,e,c=c||{schema:e,refVal:h,refs:f},r),o=this._compilations[s.index];if(s.compiling)return o.callValidate=P;var y=this._formats,g=this.RULES;try{var i=E(e,c,u,r);o.validate=i;var n=o.callValidate;return n&&(n.schema=i.schema,n.errors=null,n.refs=i.refs,n.refVal=i.refVal,n.root=i.root,n.$async=i.$async,p.sourceCode&&(n.source=i.source)),i}finally{(function(e,r,t){var a=L.call(this,e,r,t);0<=a&&this._compilations.splice(a,1)}).call(this,e,c,r)}function P(){var e=o.validate,r=e.apply(this,arguments);return P.errors=e.errors,r}function E(e,r,t,a){var s=!r||r&&r.schema==e;if(r.schema!=c.schema)return C.call(d,e,r,t,a);var o=!0===e.$async,i=O({isTop:!0,schema:e,isRoot:s,baseId:a,root:r,schemaPath:"",errSchemaPath:"#",errorPath:'""',MissingRefError:j.MissingRef,RULES:g,validate:O,util:$,resolve:R,resolveRef:w,usePattern:_,useDefault:F,useCustomRule:x,opts:p,formats:y,logger:d.logger,self:d}),i=Q(h,z)+Q(l,N)+Q(m,q)+Q(v,T)+i;p.processCode&&(i=p.processCode(i,e));try{var n=new Function("self","RULES","formats","root","refVal","defaults","customRules","equal","ucs2length","ValidationError",i)(d,g,y,c,h,m,v,A,I,k);h[0]=n}catch(e){throw d.logger.error("Error compiling schema, function code:",i),e}return n.schema=e,n.errors=null,n.refs=f,n.refVal=h,n.root=s?n:r,o&&(n.$async=!0),!0===p.sourceCode&&(n.source={code:i,patterns:l,defaults:m}),n}function w(e,r,t){r=R.url(e,r);var a,s,o=f[r];if(void 0!==o)return S(a=h[o],s="refVal["+o+"]");if(!t&&c.refs){var i=c.refs[r];if(void 0!==i)return S(a=c.refVal[i],s=b(r,a))}s=b(r);var n,l=R.call(d,E,c,r);if(void 0!==l||(n=u&&u[r])&&(l=R.inlineRef(n,p.inlineRefs)?n:C.call(d,n,c,u,e)),void 0!==l)return S(h[f[r]]=l,s);delete f[r]}function b(e,r){var t=h.length;return h[t]=r,"refVal"+(f[e]=t)}function S(e,r){return"object"==typeof e||"boolean"==typeof e?{code:r,schema:e,inline:!0}:{code:r,$async:e&&!!e.$async}}function _(e){var r=t[e];return void 0===r&&(r=t[e]=l.length,l[r]=e),"pattern"+r}function F(e){switch(typeof e){case"boolean":case"number":return""+e;case"string":return $.toQuotedString(e);case"object":if(null===e)return"null";var r=D(e),t=a[r];return void 0===t&&(t=a[r]=m.length,m[t]=e),"default"+t}}function x(e,r,t,a){if(!1!==d._opts.validateSchema){var s=e.definition.dependencies;if(s&&!s.every(function(e){return Object.prototype.hasOwnProperty.call(t,e)}))throw new Error("parent schema must have all required keywords: "+s.join(","));var o=e.definition.validateSchema;if(o)if(!o(r)){var i="keyword schema is invalid: "+d.errorsText(o.errors);if("log"!=d._opts.validateSchema)throw new Error(i);d.logger.error(i)}}var n,l=e.definition.compile,c=e.definition.inline,u=e.definition.macro;if(l)n=l.call(d,r,t,a);else if(u)n=u.call(d,r,t,a),!1!==p.validateSchema&&d.validateSchema(n,!0);else if(c)n=c.call(d,a,e.keyword,r,t);else if(!(n=e.definition.validate))return;if(void 0===n)throw new Error('custom keyword "'+e.keyword+'"failed to compile');var h=v.length;return{code:"customRule"+h,validate:v[h]=n}}}function L(e,r,t){for(var a=0;a<this._compilations.length;a++){var s=this._compilations[a];if(s.schema==e&&s.root==r&&s.baseId==t)return a}return-1}function N(e,r){return"var pattern"+e+" = new RegExp("+$.toQuotedString(r[e])+");"}function q(e){return"var default"+e+" = defaults["+e+"];"}function z(e,r){return void 0===r[e]?"":"var refVal"+e+" = refVal["+e+"];"}function T(e){return"var customRule"+e+" = customRules["+e+"];"}function Q(e,r){if(!e.length)return"";for(var t="",a=0;a<e.length;a++)t+=r(a,e);return t}r.exports=C},{"../dotjs/validate":38,"./error_classes":3,"./resolve":6,"./util":10,"fast-deep-equal":42,"fast-json-stable-stringify":43}],6:[function(e,r,t){"use strict";var m=e("uri-js"),v=e("fast-deep-equal"),y=e("./util"),l=e("./schema_obj"),a=e("json-schema-traverse");function c(e,r,t){var a=this._refs[t];if("string"==typeof a){if(!this._refs[a])return c.call(this,e,r,a);a=this._refs[a]}if((a=a||this._schemas[t])instanceof l)return d(a.schema,this._opts.inlineRefs)?a.schema:a.validate||this._compile(a);var s,o,i,n=u.call(this,r,t);return n&&(s=n.schema,r=n.root,i=n.baseId),s instanceof l?o=s.validate||e.call(this,s.schema,r,void 0,i):void 0!==s&&(o=d(s,this._opts.inlineRefs)?s:e.call(this,s,r,void 0,i)),o}function u(e,r){var t=m.parse(r),a=p(t),s=g(this._getId(e.schema));if(0===Object.keys(e.schema).length||a!==s){var o=P(a),i=this._refs[o];if("string"==typeof i)return function(e,r,t){var a=u.call(this,e,r);if(a){var s=a.schema,o=a.baseId;e=a.root;var i=this._getId(s);return i&&(o=f(o,i)),n.call(this,t,o,s,e)}}.call(this,e,i,t);if(i instanceof l)i.validate||this._compile(i),e=i;else{if(!((i=this._schemas[o])instanceof l))return;if(i.validate||this._compile(i),o==P(r))return{schema:i,root:e,baseId:s};e=i}if(!e.schema)return;s=g(this._getId(e.schema))}return n.call(this,t,s,e.schema,e)}(r.exports=c).normalizeId=P,c.fullPath=g,c.url=f,c.ids=function(e){var r=P(this._getId(e)),h={"":r},d={"":g(r,!1)},p={},f=this;return a(e,{allKeys:!0},function(e,r,t,a,s,o,i){if(""!==r){var n=f._getId(e),l=h[a],c=d[a]+"/"+s;if(void 0!==i&&(c+="/"+("number"==typeof i?i:y.escapeFragment(i))),"string"==typeof n){n=l=P(l?m.resolve(l,n):n);var u=f._refs[n];if("string"==typeof u&&(u=f._refs[u]),u&&u.schema){if(!v(e,u.schema))throw new Error('id "'+n+'" resolves to more than one schema')}else if(n!=P(c))if("#"==n[0]){if(p[n]&&!v(e,p[n]))throw new Error('id "'+n+'" resolves to more than one schema');p[n]=e}else f._refs[n]=c}h[r]=l,d[r]=c}}),p},c.inlineRef=d,c.schema=u;var h=y.toHash(["properties","patternProperties","enum","dependencies","definitions"]);function n(e,r,t,a){if(e.fragment=e.fragment||"","/"==e.fragment.slice(0,1)){for(var s=e.fragment.split("/"),o=1;o<s.length;o++){var i,n,l,c=s[o];if(c){if(void 0===(t=t[c=y.unescapeFragment(c)]))break;h[c]||((l=this._getId(t))&&(r=f(r,l)),t.$ref&&(i=f(r,t.$ref),(n=u.call(this,a,i))&&(t=n.schema,a=n.root,r=n.baseId)))}}return void 0!==t&&t!==a.schema?{schema:t,root:a,baseId:r}:void 0}}var i=y.toHash(["type","format","pattern","maxLength","minLength","maxProperties","minProperties","maxItems","minItems","maximum","minimum","uniqueItems","multipleOf","required","enum"]);function d(e,r){return!1!==r&&(void 0===r||!0===r?function e(r){var t;if(Array.isArray(r)){for(var a=0;a<r.length;a++)if("object"==typeof(t=r[a])&&!e(t))return!1}else for(var s in r){if("$ref"==s)return!1;if("object"==typeof(t=r[s])&&!e(t))return!1}return!0}(e):r?function e(r){var t,a=0;if(Array.isArray(r)){for(var s=0;s<r.length;s++)if("object"==typeof(t=r[s])&&(a+=e(t)),a==1/0)return 1/0}else for(var o in r){if("$ref"==o)return 1/0;if(i[o])a++;else if("object"==typeof(t=r[o])&&(a+=e(t)+1),a==1/0)return 1/0}return a}(e)<=r:void 0)}function g(e,r){return!1!==r&&(e=P(e)),p(m.parse(e))}function p(e){return m.serialize(e).split("#")[0]+"#"}var s=/#\/?$/;function P(e){return e?e.replace(s,""):""}function f(e,r){return r=P(r),m.resolve(e,r)}},{"./schema_obj":8,"./util":10,"fast-deep-equal":42,"json-schema-traverse":44,"uri-js":45}],7:[function(e,r,t){"use strict";var o=e("../dotjs"),i=e("./util").toHash;r.exports=function(){var a=[{type:"number",rules:[{maximum:["exclusiveMaximum"]},{minimum:["exclusiveMinimum"]},"multipleOf","format"]},{type:"string",rules:["maxLength","minLength","pattern","format"]},{type:"array",rules:["maxItems","minItems","items","contains","uniqueItems"]},{type:"object",rules:["maxProperties","minProperties","required","dependencies","propertyNames",{properties:["additionalProperties","patternProperties"]}]},{rules:["$ref","const","enum","not","anyOf","oneOf","allOf","if"]}],s=["type","$comment"];return a.all=i(s),a.types=i(["number","integer","string","array","object","boolean","null"]),a.forEach(function(e){e.rules=e.rules.map(function(e){var r,t;return"object"==typeof e&&(t=e[r=Object.keys(e)[0]],e=r,t.forEach(function(e){s.push(e),a.all[e]=!0})),s.push(e),a.all[e]={keyword:e,code:o[e],implements:t}}),a.all.$comment={keyword:"$comment",code:o.$comment},e.type&&(a.types[e.type]=e)}),a.keywords=i(s.concat(["$schema","$id","id","$data","$async","title","description","default","definitions","examples","readOnly","writeOnly","contentMediaType","contentEncoding","additionalItems","then","else"])),a.custom={},a}},{"../dotjs":27,"./util":10}],8:[function(e,r,t){"use strict";var a=e("./util");r.exports=function(e){a.copy(e,this)}},{"./util":10}],9:[function(e,r,t){"use strict";r.exports=function(e){for(var r,t=0,a=e.length,s=0;s<a;)t++,55296<=(r=e.charCodeAt(s++))&&r<=56319&&s<a&&56320==(64512&(r=e.charCodeAt(s)))&&s++;return t}},{}],10:[function(e,r,t){"use strict";function i(e,r,t,a){var s=a?" !== ":" === ",o=a?" || ":" && ",i=a?"!":"",n=a?"":"!";switch(e){case"null":return r+s+"null";case"array":return i+"Array.isArray("+r+")";case"object":return"("+i+r+o+"typeof "+r+s+'"object"'+o+n+"Array.isArray("+r+"))";case"integer":return"(typeof "+r+s+'"number"'+o+n+"("+r+" % 1)"+o+r+s+r+(t?o+i+"isFinite("+r+")":"")+")";case"number":return"(typeof "+r+s+'"'+e+'"'+(t?o+i+"isFinite("+r+")":"")+")";default:return"typeof "+r+s+'"'+e+'"'}}r.exports={copy:function(e,r){for(var t in r=r||{},e)r[t]=e[t];return r},checkDataType:i,checkDataTypes:function(e,r,t){{if(1===e.length)return i(e[0],r,t,!0);var a,s="",o=n(e);for(a in o.array&&o.object&&(s=o.null?"(":"(!"+r+" || ",s+="typeof "+r+' !== "object")',delete o.null,delete o.array,delete o.object),o.number&&delete o.integer,o)s+=(s?" && ":"")+i(a,r,t,!0);return s}},coerceToTypes:function(e,r){if(Array.isArray(r)){for(var t=[],a=0;a<r.length;a++){var s=r[a];(o[s]||"array"===e&&"array"===s)&&(t[t.length]=s)}if(t.length)return t}else{if(o[r])return[r];if("array"===e&&"array"===r)return["array"]}},toHash:n,getProperty:h,escapeQuotes:l,equal:e("fast-deep-equal"),ucs2length:e("./ucs2length"),varOccurences:function(e,r){r+="[^0-9]";var t=e.match(new RegExp(r,"g"));return t?t.length:0},varReplace:function(e,r,t){return r+="([^0-9])",t=t.replace(/\$/g,"$$$$"),e.replace(new RegExp(r,"g"),t+"$1")},schemaHasRules:function(e,r){if("boolean"==typeof e)return!e;for(var t in e)if(r[t])return!0},schemaHasRulesExcept:function(e,r,t){if("boolean"==typeof e)return!e&&"not"!=t;for(var a in e)if(a!=t&&r[a])return!0},schemaUnknownRules:function(e,r){if("boolean"==typeof e)return;for(var t in e)if(!r[t])return t},toQuotedString:c,getPathExpr:function(e,r,t,a){return u(e,t?"'/' + "+r+(a?"":".replace(/~/g, '~0').replace(/\\//g, '~1')"):a?"'[' + "+r+" + ']'":"'[\\'' + "+r+" + '\\']'")},getPath:function(e,r,t){var a=c(t?"/"+f(r):h(r));return u(e,a)},getData:function(e,r,t){var a,s,o,i;if(""===e)return"rootData";if("/"==e[0]){if(!d.test(e))throw new Error("Invalid JSON-pointer: "+e);s=e,o="rootData"}else{if(!(i=e.match(p)))throw new Error("Invalid JSON-pointer: "+e);if(a=+i[1],"#"==(s=i[2])){if(r<=a)throw new Error("Cannot access property/index "+a+" levels up, current level is "+r);return t[r-a]}if(r<a)throw new Error("Cannot access data "+a+" levels up, current level is "+r);if(o="data"+(r-a||""),!s)return o}for(var n=o,l=s.split("/"),c=0;c<l.length;c++){var u=l[c];u&&(o+=h(m(u)),n+=" && "+o)}return n},unescapeFragment:function(e){return m(decodeURIComponent(e))},unescapeJsonPointer:m,escapeFragment:function(e){return encodeURIComponent(f(e))},escapeJsonPointer:f};var o=n(["string","number","integer","boolean","null"]);function n(e){for(var r={},t=0;t<e.length;t++)r[e[t]]=!0;return r}var a=/^[a-z$_][a-z$_0-9]*$/i,s=/'|\\/g;function h(e){return"number"==typeof e?"["+e+"]":a.test(e)?"."+e:"['"+l(e)+"']"}function l(e){return e.replace(s,"\\$&").replace(/\n/g,"\\n").replace(/\r/g,"\\r").replace(/\f/g,"\\f").replace(/\t/g,"\\t")}function c(e){return"'"+l(e)+"'"}var d=/^\/(?:[^~]|~0|~1)*$/,p=/^([0-9]+)(#|\/(?:[^~]|~0|~1)*)?$/;function u(e,r){return'""'==e?r:(e+" + "+r).replace(/([^\\])' \+ '/g,"$1")}function f(e){return e.replace(/~/g,"~0").replace(/\//g,"~1")}function m(e){return e.replace(/~1/g,"/").replace(/~0/g,"~")}},{"./ucs2length":9,"fast-deep-equal":42}],11:[function(e,r,t){"use strict";var l=["multipleOf","maximum","exclusiveMaximum","minimum","exclusiveMinimum","maxLength","minLength","pattern","additionalItems","maxItems","minItems","uniqueItems","maxProperties","minProperties","required","additionalProperties","enum","format","const"];r.exports=function(e,r){for(var t=0;t<r.length;t++){e=JSON.parse(JSON.stringify(e));for(var a=r[t].split("/"),s=e,o=1;o<a.length;o++)s=s[a[o]];for(o=0;o<l.length;o++){var i=l[o],n=s[i];n&&(s[i]={anyOf:[n,{$ref:"https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#"}]})}}return e}},{}],12:[function(e,r,t){"use strict";var a=e("./refs/json-schema-draft-07.json");r.exports={$id:"https://github.com/ajv-validator/ajv/blob/master/lib/definition_schema.js",definitions:{simpleTypes:a.definitions.simpleTypes},type:"object",dependencies:{schema:["validate"],$data:["validate"],statements:["inline"],valid:{not:{required:["macro"]}}},properties:{type:a.properties.type,schema:{type:"boolean"},statements:{type:"boolean"},dependencies:{type:"array",items:{type:"string"}},metaSchema:{type:"object"},modifying:{type:"boolean"},valid:{type:"boolean"},$data:{type:"boolean"},async:{type:"boolean"},errors:{anyOf:[{type:"boolean"},{const:"full"}]}}}},{"./refs/json-schema-draft-07.json":41}],13:[function(e,r,t){"use strict";r.exports=function(e,r){var t,a,s,o,i,n,l,c=" ",u=e.level,h=e.dataLevel,d=e.schema[r],p=e.schemaPath+e.util.getProperty(r),f=e.errSchemaPath+"/"+r,m=!e.opts.allErrors,v="data"+(h||""),y=e.opts.$data&&d&&d.$data,g=y?(c+=" var schema"+u+" = "+e.util.getData(d.$data,h,e.dataPathArr)+"; ","schema"+u):d,P="maximum"==r,E=P?"exclusiveMaximum":"exclusiveMinimum",w=e.schema[E],b=e.opts.$data&&w&&w.$data,S=P?"<":">",_=P?">":"<",F=void 0;if(!y&&"number"!=typeof d&&void 0!==d)throw new Error(r+" must be number");if(!b&&void 0!==w&&"number"!=typeof w&&"boolean"!=typeof w)throw new Error(E+" must be number or boolean");b?(o="exclIsNumber"+u,i="' + "+(n="op"+u)+" + '",c+=" var schemaExcl"+u+" = "+(t=e.util.getData(w.$data,h,e.dataPathArr))+"; ",F=E,(l=l||[]).push(c+=" var "+(a="exclusive"+u)+"; var "+(s="exclType"+u)+" = typeof "+(t="schemaExcl"+u)+"; if ("+s+" != 'boolean' && "+s+" != 'undefined' && "+s+" != 'number') { "),c="",!1!==e.createErrors?(c+=" { keyword: '"+(F||"_exclusiveLimit")+"' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(f)+" , params: {} ",!1!==e.opts.messages&&(c+=" , message: '"+E+" should be boolean' "),e.opts.verbose&&(c+=" , schema: validate.schema"+p+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+v+" "),c+=" } "):c+=" {} ",x=c,c=l.pop(),c+=!e.compositeRule&&m?e.async?" throw new ValidationError(["+x+"]); ":" validate.errors = ["+x+"]; return false; ":" var err = "+x+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",c+=" } else if ( ",y&&(c+=" ("+g+" !== undefined && typeof "+g+" != 'number') || "),c+=" "+s+" == 'number' ? ( ("+a+" = "+g+" === undefined || "+t+" "+S+"= "+g+") ? "+v+" "+_+"= "+t+" : "+v+" "+_+" "+g+" ) : ( ("+a+" = "+t+" === true) ? "+v+" "+_+"= "+g+" : "+v+" "+_+" "+g+" ) || "+v+" !== "+v+") { var op"+u+" = "+a+" ? '"+S+"' : '"+S+"='; ",void 0===d&&(f=e.errSchemaPath+"/"+(F=E),g=t,y=b)):(i=S,(o="number"==typeof w)&&y?(n="'"+i+"'",c+=" if ( ",y&&(c+=" ("+g+" !== undefined && typeof "+g+" != 'number') || "),c+=" ( "+g+" === undefined || "+w+" "+S+"= "+g+" ? "+v+" "+_+"= "+w+" : "+v+" "+_+" "+g+" ) || "+v+" !== "+v+") { "):(o&&void 0===d?(a=!0,f=e.errSchemaPath+"/"+(F=E),g=w,_+="="):(o&&(g=Math[P?"min":"max"](w,d)),w===(!o||g)?(a=!0,f=e.errSchemaPath+"/"+(F=E),_+="="):(a=!1,i+="=")),n="'"+i+"'",c+=" if ( ",y&&(c+=" ("+g+" !== undefined && typeof "+g+" != 'number') || "),c+=" "+v+" "+_+" "+g+" || "+v+" !== "+v+") { ")),F=F||r,(l=l||[]).push(c),c="",!1!==e.createErrors?(c+=" { keyword: '"+(F||"_limit")+"' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(f)+" , params: { comparison: "+n+", limit: "+g+", exclusive: "+a+" } ",!1!==e.opts.messages&&(c+=" , message: 'should be "+i+" ",c+=y?"' + "+g:g+"'"),e.opts.verbose&&(c+=" , schema:  ",c+=y?"validate.schema"+p:""+d,c+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+v+" "),c+=" } "):c+=" {} ";var x=c;return c=l.pop(),c+=!e.compositeRule&&m?e.async?" throw new ValidationError(["+x+"]); ":" validate.errors = ["+x+"]; return false; ":" var err = "+x+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",c+=" } ",m&&(c+=" else { "),c}},{}],14:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u=e.opts.$data&&o&&o.$data,h=u?(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; ","schema"+a):o;if(!u&&"number"!=typeof o)throw new Error(r+" must be number");t+="if ( ",u&&(t+=" ("+h+" !== undefined && typeof "+h+" != 'number') || ");var d=r,p=p||[];p.push(t+=" "+c+".length "+("maxItems"==r?">":"<")+" "+h+") { "),t="",!1!==e.createErrors?(t+=" { keyword: '"+(d||"_limitItems")+"' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { limit: "+h+" } ",!1!==e.opts.messages&&(t+=" , message: 'should NOT have ",t+="maxItems"==r?"more":"fewer",t+=" than ",t+=u?"' + "+h+" + '":""+o,t+=" items' "),e.opts.verbose&&(t+=" , schema:  ",t+=u?"validate.schema"+i:""+o,t+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var f=t,t=p.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+f+"]); ":" validate.errors = ["+f+"]; return false; ":" var err = "+f+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+="} ",l&&(t+=" else { "),t}},{}],15:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u=e.opts.$data&&o&&o.$data,h=u?(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; ","schema"+a):o;if(!u&&"number"!=typeof o)throw new Error(r+" must be number");t+="if ( ",u&&(t+=" ("+h+" !== undefined && typeof "+h+" != 'number') || "),t+=!1===e.opts.unicode?" "+c+".length ":" ucs2length("+c+") ";var d=r,p=p||[];p.push(t+=" "+("maxLength"==r?">":"<")+" "+h+") { "),t="",!1!==e.createErrors?(t+=" { keyword: '"+(d||"_limitLength")+"' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { limit: "+h+" } ",!1!==e.opts.messages&&(t+=" , message: 'should NOT be ",t+="maxLength"==r?"longer":"shorter",t+=" than ",t+=u?"' + "+h+" + '":""+o,t+=" characters' "),e.opts.verbose&&(t+=" , schema:  ",t+=u?"validate.schema"+i:""+o,t+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var f=t,t=p.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+f+"]); ":" validate.errors = ["+f+"]; return false; ":" var err = "+f+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+="} ",l&&(t+=" else { "),t}},{}],16:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u=e.opts.$data&&o&&o.$data,h=u?(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; ","schema"+a):o;if(!u&&"number"!=typeof o)throw new Error(r+" must be number");t+="if ( ",u&&(t+=" ("+h+" !== undefined && typeof "+h+" != 'number') || ");var d=r,p=p||[];p.push(t+=" Object.keys("+c+").length "+("maxProperties"==r?">":"<")+" "+h+") { "),t="",!1!==e.createErrors?(t+=" { keyword: '"+(d||"_limitProperties")+"' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { limit: "+h+" } ",!1!==e.opts.messages&&(t+=" , message: 'should NOT have ",t+="maxProperties"==r?"more":"fewer",t+=" than ",t+=u?"' + "+h+" + '":""+o,t+=" properties' "),e.opts.verbose&&(t+=" , schema:  ",t+=u?"validate.schema"+i:""+o,t+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var f=t,t=p.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+f+"]); ":" validate.errors = ["+f+"]; return false; ":" var err = "+f+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+="} ",l&&(t+=" else { "),t}},{}],17:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.schema[r],s=e.schemaPath+e.util.getProperty(r),o=e.errSchemaPath+"/"+r,i=!e.opts.allErrors,n=e.util.copy(e),l="";n.level++;var c="valid"+n.level,u=n.baseId,h=!0,d=a;if(d)for(var p,f=-1,m=d.length-1;f<m;)p=d[f+=1],(e.opts.strictKeywords?"object"==typeof p&&0<Object.keys(p).length||!1===p:e.util.schemaHasRules(p,e.RULES.all))&&(h=!1,n.schema=p,n.schemaPath=s+"["+f+"]",n.errSchemaPath=o+"/"+f,t+="  "+e.validate(n)+" ",n.baseId=u,i&&(t+=" if ("+c+") { ",l+="}"));return i&&(t+=h?" if (true) { ":" "+l.slice(0,-1)+" "),t}},{}],18:[function(e,r,t){"use strict";r.exports=function(r,e){var t=" ",a=r.level,s=r.dataLevel,o=r.schema[e],i=r.schemaPath+r.util.getProperty(e),n=r.errSchemaPath+"/"+e,l=!r.opts.allErrors,c="data"+(s||""),u="valid"+a,h="errs__"+a,d=r.util.copy(r),p="";d.level++;var f="valid"+d.level;if(o.every(function(e){return r.opts.strictKeywords?"object"==typeof e&&0<Object.keys(e).length||!1===e:r.util.schemaHasRules(e,r.RULES.all)})){var m=d.baseId;t+=" var "+h+" = errors; var "+u+" = false;  ";var v=r.compositeRule;r.compositeRule=d.compositeRule=!0;var y=o;if(y)for(var g,P=-1,E=y.length-1;P<E;)g=y[P+=1],d.schema=g,d.schemaPath=i+"["+P+"]",d.errSchemaPath=n+"/"+P,t+="  "+r.validate(d)+" ",d.baseId=m,t+=" "+u+" = "+u+" || "+f+"; if (!"+u+") { ",p+="}";r.compositeRule=d.compositeRule=v,t+=" "+p+" if (!"+u+") {   var err =   ",!1!==r.createErrors?(t+=" { keyword: 'anyOf' , dataPath: (dataPath || '') + "+r.errorPath+" , schemaPath: "+r.util.toQuotedString(n)+" , params: {} ",!1!==r.opts.messages&&(t+=" , message: 'should match some schema in anyOf' "),r.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+r.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",!r.compositeRule&&l&&(t+=r.async?" throw new ValidationError(vErrors); ":" validate.errors = vErrors; return false; "),t+=" } else {  errors = "+h+"; if (vErrors !== null) { if ("+h+") vErrors.length = "+h+"; else vErrors = null; } ",r.opts.allErrors&&(t+=" } ")}else l&&(t+=" if (true) { ");return t}},{}],19:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.errSchemaPath+"/"+r,s=e.util.toQuotedString(e.schema[r]);return!0===e.opts.$comment?t+=" console.log("+s+");":"function"==typeof e.opts.$comment&&(t+=" self._opts.$comment("+s+", "+e.util.toQuotedString(a)+", validate.root.schema);"),t}},{}],20:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="valid"+a,h=e.opts.$data&&o&&o.$data;h&&(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; ");h||(t+=" var schema"+a+" = validate.schema"+i+";");var d=d||[];d.push(t+="var "+u+" = equal("+c+", schema"+a+"); if (!"+u+") {   "),t="",!1!==e.createErrors?(t+=" { keyword: 'const' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { allowedValue: schema"+a+" } ",!1!==e.opts.messages&&(t+=" , message: 'should be equal to constant' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var p=t,t=d.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+p+"]); ":" validate.errors = ["+p+"]; return false; ":" var err = "+p+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+=" }",l&&(t+=" else { "),t}},{}],21:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="valid"+a,h="errs__"+a,d=e.util.copy(e);d.level++;var p,f,m,v="valid"+d.level,y="i"+a,g=d.dataLevel=e.dataLevel+1,P="data"+g,E=e.baseId,w=e.opts.strictKeywords?"object"==typeof o&&0<Object.keys(o).length||!1===o:e.util.schemaHasRules(o,e.RULES.all);t+="var "+h+" = errors;var "+u+";",w?(p=e.compositeRule,e.compositeRule=d.compositeRule=!0,d.schema=o,d.schemaPath=i,d.errSchemaPath=n,t+=" var "+v+" = false; for (var "+y+" = 0; "+y+" < "+c+".length; "+y+"++) { ",d.errorPath=e.util.getPathExpr(e.errorPath,y,e.opts.jsonPointers,!0),f=c+"["+y+"]",d.dataPathArr[g]=y,m=e.validate(d),d.baseId=E,e.util.varOccurences(m,P)<2?t+=" "+e.util.varReplace(m,P,f)+" ":t+=" var "+P+" = "+f+"; "+m+" ",t+=" if ("+v+") break; }  ",e.compositeRule=d.compositeRule=p,t+="  if (!"+v+") {"):t+=" if ("+c+".length == 0) {";var b=b||[];b.push(t),t="",!1!==e.createErrors?(t+=" { keyword: 'contains' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: {} ",!1!==e.opts.messages&&(t+=" , message: 'should contain a valid item' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var S=t,t=b.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+S+"]); ":" validate.errors = ["+S+"]; return false; ":" var err = "+S+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+=" } else { ",w&&(t+="  errors = "+h+"; if (vErrors !== null) { if ("+h+") vErrors.length = "+h+"; else vErrors = null; } "),e.opts.allErrors&&(t+=" } "),t}},{}],22:[function(e,r,t){"use strict";r.exports=function(e,r){var t,a,s,o,i,n,l=" ",c=e.level,u=e.dataLevel,h=e.schema[r],d=e.schemaPath+e.util.getProperty(r),p=e.errSchemaPath+"/"+r,f=!e.opts.allErrors,m="data"+(u||""),v="valid"+c,y="errs__"+c,g=e.opts.$data&&h&&h.$data,P=g?(l+=" var schema"+c+" = "+e.util.getData(h.$data,u,e.dataPathArr)+"; ","schema"+c):h,E=this,w="definition"+c,b=E.definition,S="";if(g&&b.$data){var _=b.validateSchema;l+=" var "+w+" = RULES.custom['"+r+"'].definition; var "+(n="keywordValidate"+c)+" = "+w+".validate;"}else{if(!(i=e.useCustomRule(E,h,e.schema,e)))return;P="validate.schema"+d,n=i.code,a=b.compile,s=b.inline,o=b.macro}var F,x,R,$,j,D,O,I,A,k,C=n+".errors",L="i"+c,N="ruleErr"+c,q=b.async;if(q&&!e.async)throw new Error("async keyword in sync schema");return s||o||(l+=C+" = null;"),l+="var "+y+" = errors;var "+v+";",g&&b.$data&&(S+="}",l+=" if ("+P+" === undefined) { "+v+" = true; } else { ",_&&(S+="}",l+=" "+v+" = "+w+".validateSchema("+P+"); if ("+v+") { ")),s?l+=b.statements?" "+i.validate+" ":" "+v+" = "+i.validate+"; ":o?(S="",(F=e.util.copy(e)).level++,x="valid"+F.level,F.schema=i.validate,F.schemaPath="",R=e.compositeRule,e.compositeRule=F.compositeRule=!0,$=e.validate(F).replace(/validate\.schema/g,n),e.compositeRule=F.compositeRule=R,l+=" "+$):((I=I||[]).push(l),l="",l+="  "+n+".call( ",l+=e.opts.passContext?"this":"self",l+=a||!1===b.schema?" , "+m+" ":" , "+P+" , "+m+" , validate.schema"+e.schemaPath+" ",l+=" , (dataPath || '')",'""'!=e.errorPath&&(l+=" + "+e.errorPath),O=l+=" , "+(j=u?"data"+(u-1||""):"parentData")+" , "+(D=u?e.dataPathArr[u]:"parentDataProperty")+" , rootData )  ",l=I.pop(),!1===b.errors?(l+=" "+v+" = ",q&&(l+="await "),l+=O+"; "):l+=q?" var "+(C="customErrors"+c)+" = null; try { "+v+" = await "+O+"; } catch (e) { "+v+" = false; if (e instanceof ValidationError) "+C+" = e.errors; else throw e; } ":" "+C+" = null; "+v+" = "+O+"; "),b.modifying&&(l+=" if ("+j+") "+m+" = "+j+"["+D+"];"),l+=""+S,b.valid?f&&(l+=" if (true) { "):(l+=" if ( ",void 0===b.valid?(l+=" !",l+=o?""+x:v):l+=" "+!b.valid+" ",t=E.keyword,(I=I||[]).push(l+=") { "),(I=I||[]).push(l=""),l="",!1!==e.createErrors?(l+=" { keyword: '"+(t||"custom")+"' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(p)+" , params: { keyword: '"+E.keyword+"' } ",!1!==e.opts.messages&&(l+=" , message: 'should pass \""+E.keyword+"\" keyword validation' "),e.opts.verbose&&(l+=" , schema: validate.schema"+d+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+m+" "),l+=" } "):l+=" {} ",A=l,l=I.pop(),k=l+=!e.compositeRule&&f?e.async?" throw new ValidationError(["+A+"]); ":" validate.errors = ["+A+"]; return false; ":" var err = "+A+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",l=I.pop(),s?b.errors?"full"!=b.errors&&(l+="  for (var "+L+"="+y+"; "+L+"<errors; "+L+"++) { var "+N+" = vErrors["+L+"]; if ("+N+".dataPath === undefined) "+N+".dataPath = (dataPath || '') + "+e.errorPath+"; if ("+N+".schemaPath === undefined) { "+N+'.schemaPath = "'+p+'"; } ',e.opts.verbose&&(l+=" "+N+".schema = "+P+"; "+N+".data = "+m+"; "),l+=" } "):!1===b.errors?l+=" "+k+" ":(l+=" if ("+y+" == errors) { "+k+" } else {  for (var "+L+"="+y+"; "+L+"<errors; "+L+"++) { var "+N+" = vErrors["+L+"]; if ("+N+".dataPath === undefined) "+N+".dataPath = (dataPath || '') + "+e.errorPath+"; if ("+N+".schemaPath === undefined) { "+N+'.schemaPath = "'+p+'"; } ',e.opts.verbose&&(l+=" "+N+".schema = "+P+"; "+N+".data = "+m+"; "),l+=" } } "):o?(l+="   var err =   ",!1!==e.createErrors?(l+=" { keyword: '"+(t||"custom")+"' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(p)+" , params: { keyword: '"+E.keyword+"' } ",!1!==e.opts.messages&&(l+=" , message: 'should pass \""+E.keyword+"\" keyword validation' "),e.opts.verbose&&(l+=" , schema: validate.schema"+d+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+m+" "),l+=" } "):l+=" {} ",l+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",!e.compositeRule&&f&&(l+=e.async?" throw new ValidationError(vErrors); ":" validate.errors = vErrors; return false; ")):!1===b.errors?l+=" "+k+" ":(l+=" if (Array.isArray("+C+")) { if (vErrors === null) vErrors = "+C+"; else vErrors = vErrors.concat("+C+"); errors = vErrors.length;  for (var "+L+"="+y+"; "+L+"<errors; "+L+"++) { var "+N+" = vErrors["+L+"]; if ("+N+".dataPath === undefined) "+N+".dataPath = (dataPath || '') + "+e.errorPath+";  "+N+'.schemaPath = "'+p+'";  ',e.opts.verbose&&(l+=" "+N+".schema = "+P+"; "+N+".data = "+m+"; "),l+=" } } else { "+k+" } "),l+=" } ",f&&(l+=" else { ")),l}},{}],23:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="errs__"+a,h=e.util.copy(e),d="";h.level++;var p,f="valid"+h.level,m={},v={},y=e.opts.ownProperties;for(I in o){"__proto__"!=I&&(k=o[I],(p=Array.isArray(k)?v:m)[I]=k)}t+="var "+u+" = errors;";var g=e.errorPath;for(I in t+="var missing"+a+";",v)if((p=v[I]).length){if(t+=" if ( "+c+e.util.getProperty(I)+" !== undefined ",y&&(t+=" && Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(I)+"') "),l){t+=" && ( ";var P=p;if(P)for(var E=-1,w=P.length-1;E<w;){R=P[E+=1],E&&(t+=" || "),t+=" ( ( "+(O=c+(D=e.util.getProperty(R)))+" === undefined ",y&&(t+=" || ! Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(R)+"') "),t+=") && (missing"+a+" = "+e.util.toQuotedString(e.opts.jsonPointers?R:D)+") ) "}t+=")) {  ";var b="missing"+a,S="' + "+b+" + '";e.opts._errorDataPathProperty&&(e.errorPath=e.opts.jsonPointers?e.util.getPathExpr(g,b,!0):g+" + "+b);var _=_||[];_.push(t),t="",!1!==e.createErrors?(t+=" { keyword: 'dependencies' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { property: '"+e.util.escapeQuotes(I)+"', missingProperty: '"+S+"', depsCount: "+p.length+", deps: '"+e.util.escapeQuotes(1==p.length?p[0]:p.join(", "))+"' } ",!1!==e.opts.messages&&(t+=" , message: 'should have ",t+=1==p.length?"property "+e.util.escapeQuotes(p[0]):"properties "+e.util.escapeQuotes(p.join(", ")),t+=" when property "+e.util.escapeQuotes(I)+" is present' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var F=t,t=_.pop();t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+F+"]); ":" validate.errors = ["+F+"]; return false; ":" var err = "+F+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; "}else{t+=" ) { ";var x=p;if(x)for(var R,$=-1,j=x.length-1;$<j;){R=x[$+=1];var D=e.util.getProperty(R),S=e.util.escapeQuotes(R),O=c+D;e.opts._errorDataPathProperty&&(e.errorPath=e.util.getPath(g,R,e.opts.jsonPointers)),t+=" if ( "+O+" === undefined ",y&&(t+=" || ! Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(R)+"') "),t+=") {  var err =   ",!1!==e.createErrors?(t+=" { keyword: 'dependencies' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { property: '"+e.util.escapeQuotes(I)+"', missingProperty: '"+S+"', depsCount: "+p.length+", deps: '"+e.util.escapeQuotes(1==p.length?p[0]:p.join(", "))+"' } ",!1!==e.opts.messages&&(t+=" , message: 'should have ",t+=1==p.length?"property "+e.util.escapeQuotes(p[0]):"properties "+e.util.escapeQuotes(p.join(", ")),t+=" when property "+e.util.escapeQuotes(I)+" is present' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } "}}t+=" }   ",l&&(d+="}",t+=" else { ")}e.errorPath=g;var I,A=h.baseId;for(I in m){var k=m[I];(e.opts.strictKeywords?"object"==typeof k&&0<Object.keys(k).length||!1===k:e.util.schemaHasRules(k,e.RULES.all))&&(t+=" "+f+" = true; if ( "+c+e.util.getProperty(I)+" !== undefined ",y&&(t+=" && Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(I)+"') "),t+=") { ",h.schema=k,h.schemaPath=i+e.util.getProperty(I),h.errSchemaPath=n+"/"+e.util.escapeFragment(I),t+="  "+e.validate(h)+" ",h.baseId=A,t+=" }  ",l&&(t+=" if ("+f+") { ",d+="}"))}return l&&(t+="   "+d+" if ("+u+" == errors) {"),t}},{}],24:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="valid"+a,h=e.opts.$data&&o&&o.$data,d=(h&&(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; "),"i"+a),p="schema"+a;h||(t+=" var "+p+" = validate.schema"+i+";"),t+="var "+u+";",h&&(t+=" if (schema"+a+" === undefined) "+u+" = true; else if (!Array.isArray(schema"+a+")) "+u+" = false; else {"),t+=u+" = false;for (var "+d+"=0; "+d+"<"+p+".length; "+d+"++) if (equal("+c+", "+p+"["+d+"])) { "+u+" = true; break; }",h&&(t+="  }  ");var f=f||[];f.push(t+=" if (!"+u+") {   "),t="",!1!==e.createErrors?(t+=" { keyword: 'enum' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { allowedValues: schema"+a+" } ",!1!==e.opts.messages&&(t+=" , message: 'should be equal to one of the allowed values' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var m=t,t=f.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+m+"]); ":" validate.errors = ["+m+"]; return false; ":" var err = "+m+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+=" }",l&&(t+=" else { "),t}},{}],25:[function(e,r,t){"use strict";r.exports=function(e,r,t){var a=" ",s=e.level,o=e.dataLevel,i=e.schema[r],n=e.schemaPath+e.util.getProperty(r),l=e.errSchemaPath+"/"+r,c=!e.opts.allErrors,u="data"+(o||"");if(!1===e.opts.format)return c&&(a+=" if (true) { "),a;var h,d=e.opts.$data&&i&&i.$data,p=d?(a+=" var schema"+s+" = "+e.util.getData(i.$data,o,e.dataPathArr)+"; ","schema"+s):i,f=e.opts.unknownFormats,m=Array.isArray(f);if(d){a+=" var "+(h="format"+s)+" = formats["+p+"]; var "+(v="isObject"+s)+" = typeof "+h+" == 'object' && !("+h+" instanceof RegExp) && "+h+".validate; var "+(g="formatType"+s)+" = "+v+" && "+h+".type || 'string'; if ("+v+") { ",e.async&&(a+=" var async"+s+" = "+h+".async; "),a+=" "+h+" = "+h+".validate; } if (  ",d&&(a+=" ("+p+" !== undefined && typeof "+p+" != 'string') || "),a+=" (","ignore"!=f&&(a+=" ("+p+" && !"+h+" ",m&&(a+=" && self._opts.unknownFormats.indexOf("+p+") == -1 "),a+=") || "),a+=" ("+h+" && "+g+" == '"+t+"' && !(typeof "+h+" == 'function' ? ",a+=e.async?" (async"+s+" ? await "+h+"("+u+") : "+h+"("+u+")) ":" "+h+"("+u+") ",a+=" : "+h+".test("+u+"))))) {"}else{if(!(h=e.formats[i])){if("ignore"==f)return e.logger.warn('unknown format "'+i+'" ignored in schema at path "'+e.errSchemaPath+'"'),c&&(a+=" if (true) { "),a;if(m&&0<=f.indexOf(i))return c&&(a+=" if (true) { "),a;throw new Error('unknown format "'+i+'" is used in schema at path "'+e.errSchemaPath+'"')}var v,y,g=(v="object"==typeof h&&!(h instanceof RegExp)&&h.validate)&&h.type||"string";if(v&&(y=!0===h.async,h=h.validate),g!=t)return c&&(a+=" if (true) { "),a;if(y){if(!e.async)throw new Error("async format in sync schema");a+=" if (!(await "+(P="formats"+e.util.getProperty(i)+".validate")+"("+u+"))) { "}else{a+=" if (! ";var P="formats"+e.util.getProperty(i);v&&(P+=".validate"),a+="function"==typeof h?" "+P+"("+u+") ":" "+P+".test("+u+") ",a+=") { "}}var E=E||[];E.push(a),a="",!1!==e.createErrors?(a+=" { keyword: 'format' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(l)+" , params: { format:  ",a+=d?""+p:""+e.util.toQuotedString(i),a+="  } ",!1!==e.opts.messages&&(a+=" , message: 'should match format \"",a+=d?"' + "+p+" + '":""+e.util.escapeQuotes(i),a+="\"' "),e.opts.verbose&&(a+=" , schema:  ",a+=d?"validate.schema"+n:""+e.util.toQuotedString(i),a+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+u+" "),a+=" } "):a+=" {} ";var w=a,a=E.pop();return a+=!e.compositeRule&&c?e.async?" throw new ValidationError(["+w+"]); ":" validate.errors = ["+w+"]; return false; ":" var err = "+w+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",a+=" } ",c&&(a+=" else { "),a}},{}],26:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="valid"+a,h="errs__"+a,d=e.util.copy(e);d.level++;var p,f,m="valid"+d.level,v=e.schema.then,y=e.schema.else,g=void 0!==v&&(e.opts.strictKeywords?"object"==typeof v&&0<Object.keys(v).length||!1===v:e.util.schemaHasRules(v,e.RULES.all)),P=void 0!==y&&(e.opts.strictKeywords?"object"==typeof y&&0<Object.keys(y).length||!1===y:e.util.schemaHasRules(y,e.RULES.all)),E=d.baseId;return g||P?(d.createErrors=!1,d.schema=o,d.schemaPath=i,d.errSchemaPath=n,t+=" var "+h+" = errors; var "+u+" = true;  ",f=e.compositeRule,e.compositeRule=d.compositeRule=!0,t+="  "+e.validate(d)+" ",d.baseId=E,d.createErrors=!0,t+="  errors = "+h+"; if (vErrors !== null) { if ("+h+") vErrors.length = "+h+"; else vErrors = null; }  ",e.compositeRule=d.compositeRule=f,g?(t+=" if ("+m+") {  ",d.schema=e.schema.then,d.schemaPath=e.schemaPath+".then",d.errSchemaPath=e.errSchemaPath+"/then",t+="  "+e.validate(d)+" ",d.baseId=E,t+=" "+u+" = "+m+"; ",g&&P?t+=" var "+(p="ifClause"+a)+" = 'then'; ":p="'then'",t+=" } ",P&&(t+=" else { ")):t+=" if (!"+m+") { ",P&&(d.schema=e.schema.else,d.schemaPath=e.schemaPath+".else",d.errSchemaPath=e.errSchemaPath+"/else",t+="  "+e.validate(d)+" ",d.baseId=E,t+=" "+u+" = "+m+"; ",g&&P?t+=" var "+(p="ifClause"+a)+" = 'else'; ":p="'else'",t+=" } "),t+=" if (!"+u+") {   var err =   ",!1!==e.createErrors?(t+=" { keyword: 'if' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { failingKeyword: "+p+" } ",!1!==e.opts.messages&&(t+=" , message: 'should match \"' + "+p+" + '\" schema' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",!e.compositeRule&&l&&(t+=e.async?" throw new ValidationError(vErrors); ":" validate.errors = vErrors; return false; "),t+=" }   ",l&&(t+=" else { ")):l&&(t+=" if (true) { "),t}},{}],27:[function(e,r,t){"use strict";r.exports={$ref:e("./ref"),allOf:e("./allOf"),anyOf:e("./anyOf"),$comment:e("./comment"),const:e("./const"),contains:e("./contains"),dependencies:e("./dependencies"),enum:e("./enum"),format:e("./format"),if:e("./if"),items:e("./items"),maximum:e("./_limit"),minimum:e("./_limit"),maxItems:e("./_limitItems"),minItems:e("./_limitItems"),maxLength:e("./_limitLength"),minLength:e("./_limitLength"),maxProperties:e("./_limitProperties"),minProperties:e("./_limitProperties"),multipleOf:e("./multipleOf"),not:e("./not"),oneOf:e("./oneOf"),pattern:e("./pattern"),properties:e("./properties"),propertyNames:e("./propertyNames"),required:e("./required"),uniqueItems:e("./uniqueItems"),validate:e("./validate")}},{"./_limit":13,"./_limitItems":14,"./_limitLength":15,"./_limitProperties":16,"./allOf":17,"./anyOf":18,"./comment":19,"./const":20,"./contains":21,"./dependencies":23,"./enum":24,"./format":25,"./if":26,"./items":28,"./multipleOf":29,"./not":30,"./oneOf":31,"./pattern":32,"./properties":33,"./propertyNames":34,"./ref":35,"./required":36,"./uniqueItems":37,"./validate":38}],28:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="valid"+a,h="errs__"+a,d=e.util.copy(e),p="";d.level++;var f="valid"+d.level,m="i"+a,v=d.dataLevel=e.dataLevel+1,y="data"+v,g=e.baseId;if(t+="var "+h+" = errors;var "+u+";",Array.isArray(o)){var P,E,w,b=e.schema.additionalItems;!1===b&&(t+=" "+u+" = "+c+".length <= "+o.length+"; ",P=n,n=e.errSchemaPath+"/additionalItems",(E=E||[]).push(t+="  if (!"+u+") {   "),t="",!1!==e.createErrors?(t+=" { keyword: 'additionalItems' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { limit: "+o.length+" } ",!1!==e.opts.messages&&(t+=" , message: 'should NOT have more than "+o.length+" items' "),e.opts.verbose&&(t+=" , schema: false , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",w=t,t=E.pop(),t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+w+"]); ":" validate.errors = ["+w+"]; return false; ":" var err = "+w+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+=" } ",n=P,l&&(p+="}",t+=" else { "));var S=o;if(S)for(var _=-1,F=S.length-1;_<F;){var x,R,$=S[_+=1];(e.opts.strictKeywords?"object"==typeof $&&0<Object.keys($).length||!1===$:e.util.schemaHasRules($,e.RULES.all))&&(t+=" "+f+" = true; if ("+c+".length > "+_+") { ",x=c+"["+_+"]",d.schema=$,d.schemaPath=i+"["+_+"]",d.errSchemaPath=n+"/"+_,d.errorPath=e.util.getPathExpr(e.errorPath,_,e.opts.jsonPointers,!0),d.dataPathArr[v]=_,R=e.validate(d),d.baseId=g,e.util.varOccurences(R,y)<2?t+=" "+e.util.varReplace(R,y,x)+" ":t+=" var "+y+" = "+x+"; "+R+" ",t+=" }  ",l&&(t+=" if ("+f+") { ",p+="}"))}"object"==typeof b&&(e.opts.strictKeywords?"object"==typeof b&&0<Object.keys(b).length||!1===b:e.util.schemaHasRules(b,e.RULES.all))&&(d.schema=b,d.schemaPath=e.schemaPath+".additionalItems",d.errSchemaPath=e.errSchemaPath+"/additionalItems",t+=" "+f+" = true; if ("+c+".length > "+o.length+") {  for (var "+m+" = "+o.length+"; "+m+" < "+c+".length; "+m+"++) { ",d.errorPath=e.util.getPathExpr(e.errorPath,m,e.opts.jsonPointers,!0),x=c+"["+m+"]",d.dataPathArr[v]=m,R=e.validate(d),d.baseId=g,e.util.varOccurences(R,y)<2?t+=" "+e.util.varReplace(R,y,x)+" ":t+=" var "+y+" = "+x+"; "+R+" ",l&&(t+=" if (!"+f+") break; "),t+=" } }  ",l&&(t+=" if ("+f+") { ",p+="}"))}else{(e.opts.strictKeywords?"object"==typeof o&&0<Object.keys(o).length||!1===o:e.util.schemaHasRules(o,e.RULES.all))&&(d.schema=o,d.schemaPath=i,d.errSchemaPath=n,t+="  for (var "+m+" = 0; "+m+" < "+c+".length; "+m+"++) { ",d.errorPath=e.util.getPathExpr(e.errorPath,m,e.opts.jsonPointers,!0),x=c+"["+m+"]",d.dataPathArr[v]=m,R=e.validate(d),d.baseId=g,e.util.varOccurences(R,y)<2?t+=" "+e.util.varReplace(R,y,x)+" ":t+=" var "+y+" = "+x+"; "+R+" ",l&&(t+=" if (!"+f+") break; "),t+=" }")}return l&&(t+=" "+p+" if ("+h+" == errors) {"),t}},{}],29:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u=e.opts.$data&&o&&o.$data,h=u?(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; ","schema"+a):o;if(!u&&"number"!=typeof o)throw new Error(r+" must be number");t+="var division"+a+";if (",u&&(t+=" "+h+" !== undefined && ( typeof "+h+" != 'number' || "),t+=" (division"+a+" = "+c+" / "+h+", ",t+=e.opts.multipleOfPrecision?" Math.abs(Math.round(division"+a+") - division"+a+") > 1e-"+e.opts.multipleOfPrecision+" ":" division"+a+" !== parseInt(division"+a+") ",t+=" ) ",u&&(t+="  )  ");var d=d||[];d.push(t+=" ) {   "),t="",!1!==e.createErrors?(t+=" { keyword: 'multipleOf' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { multipleOf: "+h+" } ",!1!==e.opts.messages&&(t+=" , message: 'should be multiple of ",t+=u?"' + "+h:h+"'"),e.opts.verbose&&(t+=" , schema:  ",t+=u?"validate.schema"+i:""+o,t+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var p=t,t=d.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+p+"]); ":" validate.errors = ["+p+"]; return false; ":" var err = "+p+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+="} ",l&&(t+=" else { "),t}},{}],30:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="errs__"+a,h=e.util.copy(e);h.level++;var d,p,f,m,v="valid"+h.level;return(e.opts.strictKeywords?"object"==typeof o&&0<Object.keys(o).length||!1===o:e.util.schemaHasRules(o,e.RULES.all))?(h.schema=o,h.schemaPath=i,h.errSchemaPath=n,t+=" var "+u+" = errors;  ",d=e.compositeRule,e.compositeRule=h.compositeRule=!0,h.createErrors=!1,h.opts.allErrors&&(p=h.opts.allErrors,h.opts.allErrors=!1),t+=" "+e.validate(h)+" ",h.createErrors=!0,p&&(h.opts.allErrors=p),e.compositeRule=h.compositeRule=d,(f=f||[]).push(t+=" if ("+v+") {   "),t="",!1!==e.createErrors?(t+=" { keyword: 'not' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: {} ",!1!==e.opts.messages&&(t+=" , message: 'should NOT be valid' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",m=t,t=f.pop(),t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+m+"]); ":" validate.errors = ["+m+"]; return false; ":" var err = "+m+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+=" } else {  errors = "+u+"; if (vErrors !== null) { if ("+u+") vErrors.length = "+u+"; else vErrors = null; } ",e.opts.allErrors&&(t+=" } ")):(t+="  var err =   ",!1!==e.createErrors?(t+=" { keyword: 'not' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: {} ",!1!==e.opts.messages&&(t+=" , message: 'should NOT be valid' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",l&&(t+=" if (false) { ")),t}},{}],31:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="valid"+a,h="errs__"+a,d=e.util.copy(e),p="";d.level++;var f="valid"+d.level,m=d.baseId,v="prevValid"+a,y="passingSchemas"+a;t+="var "+h+" = errors , "+v+" = false , "+u+" = false , "+y+" = null; ";var g=e.compositeRule;e.compositeRule=d.compositeRule=!0;var P=o;if(P)for(var E,w=-1,b=P.length-1;w<b;)E=P[w+=1],(e.opts.strictKeywords?"object"==typeof E&&0<Object.keys(E).length||!1===E:e.util.schemaHasRules(E,e.RULES.all))?(d.schema=E,d.schemaPath=i+"["+w+"]",d.errSchemaPath=n+"/"+w,t+="  "+e.validate(d)+" ",d.baseId=m):t+=" var "+f+" = true; ",w&&(t+=" if ("+f+" && "+v+") { "+u+" = false; "+y+" = ["+y+", "+w+"]; } else { ",p+="}"),t+=" if ("+f+") { "+u+" = "+v+" = true; "+y+" = "+w+"; }";return e.compositeRule=d.compositeRule=g,t+=p+"if (!"+u+") {   var err =   ",!1!==e.createErrors?(t+=" { keyword: 'oneOf' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { passingSchemas: "+y+" } ",!1!==e.opts.messages&&(t+=" , message: 'should match exactly one schema in oneOf' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",!e.compositeRule&&l&&(t+=e.async?" throw new ValidationError(vErrors); ":" validate.errors = vErrors; return false; "),t+="} else {  errors = "+h+"; if (vErrors !== null) { if ("+h+") vErrors.length = "+h+"; else vErrors = null; }",e.opts.allErrors&&(t+=" } "),t}},{}],32:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u=e.opts.$data&&o&&o.$data,h=u?(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; ","schema"+a):o,d=u?"(new RegExp("+h+"))":e.usePattern(o);t+="if ( ",u&&(t+=" ("+h+" !== undefined && typeof "+h+" != 'string') || ");var p=p||[];p.push(t+=" !"+d+".test("+c+") ) {   "),t="",!1!==e.createErrors?(t+=" { keyword: 'pattern' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { pattern:  ",t+=u?""+h:""+e.util.toQuotedString(o),t+="  } ",!1!==e.opts.messages&&(t+=" , message: 'should match pattern \"",t+=u?"' + "+h+" + '":""+e.util.escapeQuotes(o),t+="\"' "),e.opts.verbose&&(t+=" , schema:  ",t+=u?"validate.schema"+i:""+e.util.toQuotedString(o),t+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var f=t,t=p.pop();return t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+f+"]); ":" validate.errors = ["+f+"]; return false; ":" var err = "+f+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+="} ",l&&(t+=" else { "),t}},{}],33:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="errs__"+a,h=e.util.copy(e),d="";h.level++;var p,f,m,v="valid"+h.level,y="key"+a,g="idx"+a,P=h.dataLevel=e.dataLevel+1,E="data"+P,w="dataProperties"+a,b=Object.keys(o||{}).filter(k),S=e.schema.patternProperties||{},_=Object.keys(S).filter(k),F=e.schema.additionalProperties,x=b.length||_.length,R=!1===F,$="object"==typeof F&&Object.keys(F).length,j=e.opts.removeAdditional,D=R||$||j,O=e.opts.ownProperties,I=e.baseId,A=e.schema.required;function k(e){return"__proto__"!==e}if(A&&(!e.opts.$data||!A.$data)&&A.length<e.opts.loopRequired&&(p=e.util.toHash(A)),t+="var "+u+" = errors;var "+v+" = true;",O&&(t+=" var "+w+" = undefined;"),D){if(t+=O?" "+w+" = "+w+" || Object.keys("+c+"); for (var "+g+"=0; "+g+"<"+w+".length; "+g+"++) { var "+y+" = "+w+"["+g+"]; ":" for (var "+y+" in "+c+") { ",x){if(t+=" var isAdditional"+a+" = !(false ",b.length)if(8<b.length)t+=" || validate.schema"+i+".hasOwnProperty("+y+") ";else{var C=b;if(C)for(var L=-1,N=C.length-1;L<N;)U=C[L+=1],t+=" || "+y+" == "+e.util.toQuotedString(U)+" "}if(_.length){var q=_;if(q)for(var z=-1,T=q.length-1;z<T;)te=q[z+=1],t+=" || "+e.usePattern(te)+".test("+y+") "}t+=" ); if (isAdditional"+a+") { "}"all"==j?t+=" delete "+c+"["+y+"]; ":(Z=e.errorPath,f="' + "+y+" + '",e.opts._errorDataPathProperty&&(e.errorPath=e.util.getPathExpr(e.errorPath,y,e.opts.jsonPointers)),R?j?t+=" delete "+c+"["+y+"]; ":(G=n,n=e.errSchemaPath+"/additionalProperties",(W=W||[]).push(t+=" "+v+" = false; "),t="",!1!==e.createErrors?(t+=" { keyword: 'additionalProperties' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { additionalProperty: '"+f+"' } ",!1!==e.opts.messages&&(t+=" , message: '",t+=e.opts._errorDataPathProperty?"is an invalid additional property":"should NOT have additional properties",t+="' "),e.opts.verbose&&(t+=" , schema: false , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",X=t,t=W.pop(),t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+X+"]); ":" validate.errors = ["+X+"]; return false; ":" var err = "+X+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",n=G,l&&(t+=" break; ")):$&&("failing"==j?(t+=" var "+u+" = errors;  ",m=e.compositeRule,e.compositeRule=h.compositeRule=!0,h.schema=F,h.schemaPath=e.schemaPath+".additionalProperties",h.errSchemaPath=e.errSchemaPath+"/additionalProperties",h.errorPath=e.opts._errorDataPathProperty?e.errorPath:e.util.getPathExpr(e.errorPath,y,e.opts.jsonPointers),oe=c+"["+y+"]",h.dataPathArr[P]=y,ie=e.validate(h),h.baseId=I,e.util.varOccurences(ie,E)<2?t+=" "+e.util.varReplace(ie,E,oe)+" ":t+=" var "+E+" = "+oe+"; "+ie+" ",t+=" if (!"+v+") { errors = "+u+"; if (validate.errors !== null) { if (errors) validate.errors.length = errors; else validate.errors = null; } delete "+c+"["+y+"]; }  ",e.compositeRule=h.compositeRule=m):(h.schema=F,h.schemaPath=e.schemaPath+".additionalProperties",h.errSchemaPath=e.errSchemaPath+"/additionalProperties",h.errorPath=e.opts._errorDataPathProperty?e.errorPath:e.util.getPathExpr(e.errorPath,y,e.opts.jsonPointers),oe=c+"["+y+"]",h.dataPathArr[P]=y,ie=e.validate(h),h.baseId=I,e.util.varOccurences(ie,E)<2?t+=" "+e.util.varReplace(ie,E,oe)+" ":t+=" var "+E+" = "+oe+"; "+ie+" ",l&&(t+=" if (!"+v+") break; "))),e.errorPath=Z),x&&(t+=" } "),t+=" }  ",l&&(t+=" if ("+v+") { ",d+="}")}var Q=e.opts.useDefaults&&!e.compositeRule;if(b.length){var V=b;if(V)for(var U,H=-1,M=V.length-1;H<M;){var K,B,J,Z,G,Y,W,X,ee=o[U=V[H+=1]];(e.opts.strictKeywords?"object"==typeof ee&&0<Object.keys(ee).length||!1===ee:e.util.schemaHasRules(ee,e.RULES.all))&&(oe=c+(K=e.util.getProperty(U)),B=Q&&void 0!==ee.default,h.schema=ee,h.schemaPath=i+K,h.errSchemaPath=n+"/"+e.util.escapeFragment(U),h.errorPath=e.util.getPath(e.errorPath,U,e.opts.jsonPointers),h.dataPathArr[P]=e.util.toQuotedString(U),ie=e.validate(h),h.baseId=I,e.util.varOccurences(ie,E)<2?(ie=e.util.varReplace(ie,E,oe),J=oe):t+=" var "+(J=E)+" = "+oe+"; ",B?t+=" "+ie+" ":(p&&p[U]?(t+=" if ( "+J+" === undefined ",O&&(t+=" || ! Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(U)+"') "),t+=") { "+v+" = false; ",Z=e.errorPath,G=n,Y=e.util.escapeQuotes(U),e.opts._errorDataPathProperty&&(e.errorPath=e.util.getPath(Z,U,e.opts.jsonPointers)),n=e.errSchemaPath+"/required",(W=W||[]).push(t),t="",!1!==e.createErrors?(t+=" { keyword: 'required' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { missingProperty: '"+Y+"' } ",!1!==e.opts.messages&&(t+=" , message: '",t+=e.opts._errorDataPathProperty?"is a required property":"should have required property \\'"+Y+"\\'",t+="' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",X=t,t=W.pop(),t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+X+"]); ":" validate.errors = ["+X+"]; return false; ":" var err = "+X+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",n=G,e.errorPath=Z,t+=" } else { "):l?(t+=" if ( "+J+" === undefined ",O&&(t+=" || ! Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(U)+"') "),t+=") { "+v+" = true; } else { "):(t+=" if ("+J+" !== undefined ",O&&(t+=" &&   Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(U)+"') "),t+=" ) { "),t+=" "+ie+" } ")),l&&(t+=" if ("+v+") { ",d+="}")}}if(_.length){var re=_;if(re)for(var te,ae=-1,se=re.length-1;ae<se;){var oe,ie,ee=S[te=re[ae+=1]];(e.opts.strictKeywords?"object"==typeof ee&&0<Object.keys(ee).length||!1===ee:e.util.schemaHasRules(ee,e.RULES.all))&&(h.schema=ee,h.schemaPath=e.schemaPath+".patternProperties"+e.util.getProperty(te),h.errSchemaPath=e.errSchemaPath+"/patternProperties/"+e.util.escapeFragment(te),t+=O?" "+w+" = "+w+" || Object.keys("+c+"); for (var "+g+"=0; "+g+"<"+w+".length; "+g+"++) { var "+y+" = "+w+"["+g+"]; ":" for (var "+y+" in "+c+") { ",t+=" if ("+e.usePattern(te)+".test("+y+")) { ",h.errorPath=e.util.getPathExpr(e.errorPath,y,e.opts.jsonPointers),oe=c+"["+y+"]",h.dataPathArr[P]=y,ie=e.validate(h),h.baseId=I,e.util.varOccurences(ie,E)<2?t+=" "+e.util.varReplace(ie,E,oe)+" ":t+=" var "+E+" = "+oe+"; "+ie+" ",l&&(t+=" if (!"+v+") break; "),t+=" } ",l&&(t+=" else "+v+" = true; "),t+=" }  ",l&&(t+=" if ("+v+") { ",d+="}"))}}return l&&(t+=" "+d+" if ("+u+" == errors) {"),t}},{}],34:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="errs__"+a,h=e.util.copy(e);h.level++;var d,p,f,m,v,y,g,P,E,w,b,S="valid"+h.level;return t+="var "+u+" = errors;",(e.opts.strictKeywords?"object"==typeof o&&0<Object.keys(o).length||!1===o:e.util.schemaHasRules(o,e.RULES.all))&&(h.schema=o,h.schemaPath=i,h.errSchemaPath=n,p="idx"+a,f="i"+a,m="' + "+(d="key"+a)+" + '",v="data"+(h.dataLevel=e.dataLevel+1),y="dataProperties"+a,P=e.baseId,(g=e.opts.ownProperties)&&(t+=" var "+y+" = undefined; "),t+=g?" "+y+" = "+y+" || Object.keys("+c+"); for (var "+p+"=0; "+p+"<"+y+".length; "+p+"++) { var "+d+" = "+y+"["+p+"]; ":" for (var "+d+" in "+c+") { ",t+=" var startErrs"+a+" = errors; ",E=d,w=e.compositeRule,e.compositeRule=h.compositeRule=!0,b=e.validate(h),h.baseId=P,e.util.varOccurences(b,v)<2?t+=" "+e.util.varReplace(b,v,E)+" ":t+=" var "+v+" = "+E+"; "+b+" ",e.compositeRule=h.compositeRule=w,t+=" if (!"+S+") { for (var "+f+"=startErrs"+a+"; "+f+"<errors; "+f+"++) { vErrors["+f+"].propertyName = "+d+"; }   var err =   ",!1!==e.createErrors?(t+=" { keyword: 'propertyNames' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { propertyName: '"+m+"' } ",!1!==e.opts.messages&&(t+=" , message: 'property name \\'"+m+"\\' is invalid' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",!e.compositeRule&&l&&(t+=e.async?" throw new ValidationError(vErrors); ":" validate.errors = vErrors; return false; "),l&&(t+=" break; "),t+=" } }"),l&&(t+="  if ("+u+" == errors) {"),t}},{}],35:[function(e,r,t){"use strict";r.exports=function(e,r){var t,a,s=" ",o=e.dataLevel,i=e.schema[r],n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(o||""),u="valid"+e.level;if("#"==i||"#/"==i)a=e.isRoot?(t=e.async,"validate"):(t=!0===e.root.schema.$async,"root.refVal[0]");else{var h,d,p=e.resolveRef(e.baseId,i,e.isRoot);if(void 0===p){var f,m=e.MissingRefError.message(e.baseId,i);if("fail"==e.opts.missingRefs){e.logger.error(m),(f=f||[]).push(s),s="",!1!==e.createErrors?(s+=" { keyword: '$ref' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { ref: '"+e.util.escapeQuotes(i)+"' } ",!1!==e.opts.messages&&(s+=" , message: 'can\\'t resolve reference "+e.util.escapeQuotes(i)+"' "),e.opts.verbose&&(s+=" , schema: "+e.util.toQuotedString(i)+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),s+=" } "):s+=" {} ";var v=s,s=f.pop();s+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+v+"]); ":" validate.errors = ["+v+"]; return false; ":" var err = "+v+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",l&&(s+=" if (false) { ")}else{if("ignore"!=e.opts.missingRefs)throw new e.MissingRefError(e.baseId,i,m);e.logger.warn(m),l&&(s+=" if (true) { ")}}else{p.inline?((h=e.util.copy(e)).level++,d="valid"+h.level,h.schema=p.schema,h.schemaPath="",h.errSchemaPath=i,s+=" "+e.validate(h).replace(/validate\.schema/g,p.code)+" ",l&&(s+=" if ("+d+") { ")):(t=!0===p.$async||e.async&&!1!==p.$async,a=p.code)}}if(a){(f=f||[]).push(s),s="",s+=e.opts.passContext?" "+a+".call(this, ":" "+a+"( ",s+=" "+c+", (dataPath || '')",'""'!=e.errorPath&&(s+=" + "+e.errorPath);var y=s+=" , "+(o?"data"+(o-1||""):"parentData")+" , "+(o?e.dataPathArr[o]:"parentDataProperty")+", rootData)  ";if(s=f.pop(),t){if(!e.async)throw new Error("async schema referenced by sync schema");l&&(s+=" var "+u+"; "),s+=" try { await "+y+"; ",l&&(s+=" "+u+" = true; "),s+=" } catch (e) { if (!(e instanceof ValidationError)) throw e; if (vErrors === null) vErrors = e.errors; else vErrors = vErrors.concat(e.errors); errors = vErrors.length; ",l&&(s+=" "+u+" = false; "),s+=" } ",l&&(s+=" if ("+u+") { ")}else s+=" if (!"+y+") { if (vErrors === null) vErrors = "+a+".errors; else vErrors = vErrors.concat("+a+".errors); errors = vErrors.length; } ",l&&(s+=" else { ")}return s}},{}],36:[function(e,r,t){"use strict";r.exports=function(e,r){var t=" ",a=e.level,s=e.dataLevel,o=e.schema[r],i=e.schemaPath+e.util.getProperty(r),n=e.errSchemaPath+"/"+r,l=!e.opts.allErrors,c="data"+(s||""),u="valid"+a,h=e.opts.$data&&o&&o.$data,d=(h&&(t+=" var schema"+a+" = "+e.util.getData(o.$data,s,e.dataPathArr)+"; "),"schema"+a);if(!h)if(o.length<e.opts.loopRequired&&e.schema.properties&&Object.keys(e.schema.properties).length){var p=[],f=o;if(f)for(var m,v=-1,y=f.length-1;v<y;){m=f[v+=1];var g=e.schema.properties[m];g&&(e.opts.strictKeywords?"object"==typeof g&&0<Object.keys(g).length||!1===g:e.util.schemaHasRules(g,e.RULES.all))||(p[p.length]=m)}}else p=o;if(h||p.length){var P=e.errorPath,E=h||e.opts.loopRequired<=p.length,w=e.opts.ownProperties;if(l)if(t+=" var missing"+a+"; ",E){h||(t+=" var "+d+" = validate.schema"+i+"; ");var b="' + "+($="schema"+a+"["+(F="i"+a)+"]")+" + '";e.opts._errorDataPathProperty&&(e.errorPath=e.util.getPathExpr(P,$,e.opts.jsonPointers)),t+=" var "+u+" = true; ",h&&(t+=" if (schema"+a+" === undefined) "+u+" = true; else if (!Array.isArray(schema"+a+")) "+u+" = false; else {"),t+=" for (var "+F+" = 0; "+F+" < "+d+".length; "+F+"++) { "+u+" = "+c+"["+d+"["+F+"]] !== undefined ",w&&(t+=" &&   Object.prototype.hasOwnProperty.call("+c+", "+d+"["+F+"]) "),t+="; if (!"+u+") break; } ",h&&(t+="  }  "),(R=R||[]).push(t+="  if (!"+u+") {   "),t="",!1!==e.createErrors?(t+=" { keyword: 'required' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { missingProperty: '"+b+"' } ",!1!==e.opts.messages&&(t+=" , message: '",t+=e.opts._errorDataPathProperty?"is a required property":"should have required property \\'"+b+"\\'",t+="' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";var S=t,t=R.pop();t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+S+"]); ":" validate.errors = ["+S+"]; return false; ":" var err = "+S+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+=" } else { "}else{t+=" if ( ";var _=p;if(_)for(var F=-1,x=_.length-1;F<x;){D=_[F+=1],F&&(t+=" || "),t+=" ( ( "+(k=c+(A=e.util.getProperty(D)))+" === undefined ",w&&(t+=" || ! Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(D)+"') "),t+=") && (missing"+a+" = "+e.util.toQuotedString(e.opts.jsonPointers?D:A)+") ) "}t+=") {  ";var R,b="' + "+($="missing"+a)+" + '";e.opts._errorDataPathProperty&&(e.errorPath=e.opts.jsonPointers?e.util.getPathExpr(P,$,!0):P+" + "+$),(R=R||[]).push(t),t="",!1!==e.createErrors?(t+=" { keyword: 'required' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { missingProperty: '"+b+"' } ",!1!==e.opts.messages&&(t+=" , message: '",t+=e.opts._errorDataPathProperty?"is a required property":"should have required property \\'"+b+"\\'",t+="' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ";S=t;t=R.pop(),t+=!e.compositeRule&&l?e.async?" throw new ValidationError(["+S+"]); ":" validate.errors = ["+S+"]; return false; ":" var err = "+S+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",t+=" } else { "}else if(E){h||(t+=" var "+d+" = validate.schema"+i+"; ");var $,b="' + "+($="schema"+a+"["+(F="i"+a)+"]")+" + '";e.opts._errorDataPathProperty&&(e.errorPath=e.util.getPathExpr(P,$,e.opts.jsonPointers)),h&&(t+=" if ("+d+" && !Array.isArray("+d+")) {  var err =   ",!1!==e.createErrors?(t+=" { keyword: 'required' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { missingProperty: '"+b+"' } ",!1!==e.opts.messages&&(t+=" , message: '",t+=e.opts._errorDataPathProperty?"is a required property":"should have required property \\'"+b+"\\'",t+="' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } else if ("+d+" !== undefined) { "),t+=" for (var "+F+" = 0; "+F+" < "+d+".length; "+F+"++) { if ("+c+"["+d+"["+F+"]] === undefined ",w&&(t+=" || ! Object.prototype.hasOwnProperty.call("+c+", "+d+"["+F+"]) "),t+=") {  var err =   ",!1!==e.createErrors?(t+=" { keyword: 'required' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { missingProperty: '"+b+"' } ",!1!==e.opts.messages&&(t+=" , message: '",t+=e.opts._errorDataPathProperty?"is a required property":"should have required property \\'"+b+"\\'",t+="' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } } ",h&&(t+="  }  ")}else{var j=p;if(j)for(var D,O=-1,I=j.length-1;O<I;){D=j[O+=1];var A=e.util.getProperty(D),b=e.util.escapeQuotes(D),k=c+A;e.opts._errorDataPathProperty&&(e.errorPath=e.util.getPath(P,D,e.opts.jsonPointers)),t+=" if ( "+k+" === undefined ",w&&(t+=" || ! Object.prototype.hasOwnProperty.call("+c+", '"+e.util.escapeQuotes(D)+"') "),t+=") {  var err =   ",!1!==e.createErrors?(t+=" { keyword: 'required' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(n)+" , params: { missingProperty: '"+b+"' } ",!1!==e.opts.messages&&(t+=" , message: '",t+=e.opts._errorDataPathProperty?"is a required property":"should have required property \\'"+b+"\\'",t+="' "),e.opts.verbose&&(t+=" , schema: validate.schema"+i+" , parentSchema: validate.schema"+e.schemaPath+" , data: "+c+" "),t+=" } "):t+=" {} ",t+=";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } "}}e.errorPath=P}else l&&(t+=" if (true) {");return t}},{}],37:[function(e,r,t){"use strict";r.exports=function(e,r){var t,a,s,o,i=" ",n=e.level,l=e.dataLevel,c=e.schema[r],u=e.schemaPath+e.util.getProperty(r),h=e.errSchemaPath+"/"+r,d=!e.opts.allErrors,p="data"+(l||""),f="valid"+n,m=e.opts.$data&&c&&c.$data,v=m?(i+=" var schema"+n+" = "+e.util.getData(c.$data,l,e.dataPathArr)+"; ","schema"+n):c;return(c||m)&&!1!==e.opts.uniqueItems?(m&&(i+=" var "+f+"; if ("+v+" === false || "+v+" === undefined) "+f+" = true; else if (typeof "+v+" != 'boolean') "+f+" = false; else { "),i+=" var i = "+p+".length , "+f+" = true , j; if (i > 1) { ",t=e.schema.items&&e.schema.items.type,a=Array.isArray(t),!t||"object"==t||"array"==t||a&&(0<=t.indexOf("object")||0<=t.indexOf("array"))?i+=" outer: for (;i--;) { for (j = i; j--;) { if (equal("+p+"[i], "+p+"[j])) { "+f+" = false; break outer; } } } ":(i+=" var itemIndices = {}, item; for (;i--;) { var item = "+p+"[i]; ",i+=" if ("+e.util["checkDataType"+(a?"s":"")](t,"item",e.opts.strictNumbers,!0)+") continue; ",a&&(i+=" if (typeof item == 'string') item = '\"' + item; "),i+=" if (typeof itemIndices[item] == 'number') { "+f+" = false; j = itemIndices[item]; break; } itemIndices[item] = i; } "),i+=" } ",m&&(i+="  }  "),(s=s||[]).push(i+=" if (!"+f+") {   "),i="",!1!==e.createErrors?(i+=" { keyword: 'uniqueItems' , dataPath: (dataPath || '') + "+e.errorPath+" , schemaPath: "+e.util.toQuotedString(h)+" , params: { i: i, j: j } ",!1!==e.opts.messages&&(i+=" , message: 'should NOT have duplicate items (items ## ' + j + ' and ' + i + ' are identical)' "),e.opts.verbose&&(i+=" , schema:  ",i+=m?"validate.schema"+u:""+c,i+="         , parentSchema: validate.schema"+e.schemaPath+" , data: "+p+" "),i+=" } "):i+=" {} ",o=i,i=s.pop(),i+=!e.compositeRule&&d?e.async?" throw new ValidationError(["+o+"]); ":" validate.errors = ["+o+"]; return false; ":" var err = "+o+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",i+=" } ",d&&(i+=" else { ")):d&&(i+=" if (true) { "),i}},{}],38:[function(e,r,t){"use strict";r.exports=function(a,e){var r="",t=!0===a.schema.$async,s=a.util.schemaHasRulesExcept(a.schema,a.RULES.all,"$ref"),o=a.self._getId(a.schema);if(a.opts.strictKeywords){var i=a.util.schemaUnknownRules(a.schema,a.RULES.keywords);if(i){var n="unknown keyword: "+i;if("log"!==a.opts.strictKeywords)throw new Error(n);a.logger.warn(n)}}if(a.isTop&&(r+=" var validate = ",t&&(a.async=!0,r+="async "),r+="function(data, dataPath, parentData, parentDataProperty, rootData) { 'use strict'; ",o&&(a.opts.sourceCode||a.opts.processCode)&&(r+=" /*# sourceURL="+o+" */ ")),"boolean"==typeof a.schema||!s&&!a.schema.$ref){var l=a.level,c=a.dataLevel,u=a.schema[e="false schema"],h=a.schemaPath+a.util.getProperty(e),d=a.errSchemaPath+"/"+e,p=!a.opts.allErrors,f="data"+(c||""),m="valid"+l;return!1===a.schema?(a.isTop?p=!0:r+=" var "+m+" = false; ",(U=U||[]).push(r),r="",!1!==a.createErrors?(r+=" { keyword: 'false schema' , dataPath: (dataPath || '') + "+a.errorPath+" , schemaPath: "+a.util.toQuotedString(d)+" , params: {} ",!1!==a.opts.messages&&(r+=" , message: 'boolean schema is false' "),a.opts.verbose&&(r+=" , schema: false , parentSchema: validate.schema"+a.schemaPath+" , data: "+f+" "),r+=" } "):r+=" {} ",D=r,r=U.pop(),r+=!a.compositeRule&&p?a.async?" throw new ValidationError(["+D+"]); ":" validate.errors = ["+D+"]; return false; ":" var err = "+D+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; "):r+=a.isTop?t?" return data; ":" validate.errors = null; return true; ":" var "+m+" = true; ",a.isTop&&(r+=" }; return validate; "),r}if(a.isTop){var v=a.isTop,l=a.level=0,c=a.dataLevel=0,f="data";if(a.rootId=a.resolve.fullPath(a.self._getId(a.root.schema)),a.baseId=a.baseId||a.rootId,delete a.isTop,a.dataPathArr=[""],void 0!==a.schema.default&&a.opts.useDefaults&&a.opts.strictDefaults){var y="default is ignored in the schema root";if("log"!==a.opts.strictDefaults)throw new Error(y);a.logger.warn(y)}r+=" var vErrors = null; ",r+=" var errors = 0;     ",r+=" if (rootData === undefined) rootData = data; "}else{l=a.level,f="data"+((c=a.dataLevel)||"");if(o&&(a.baseId=a.resolve.url(a.baseId,o)),t&&!a.async)throw new Error("async schema in sync schema");r+=" var errs_"+l+" = errors;"}var g,m="valid"+l,p=!a.opts.allErrors,P="",E="",w=a.schema.type,b=Array.isArray(w);if(w&&a.opts.nullable&&!0===a.schema.nullable&&(b?-1==w.indexOf("null")&&(w=w.concat("null")):"null"!=w&&(w=[w,"null"],b=!0)),b&&1==w.length&&(w=w[0],b=!1),a.schema.$ref&&s){if("fail"==a.opts.extendRefs)throw new Error('$ref: validation keywords used in schema at path "'+a.errSchemaPath+'" (see option extendRefs)');!0!==a.opts.extendRefs&&(s=!1,a.logger.warn('$ref: keywords ignored in schema at path "'+a.errSchemaPath+'"'))}if(a.schema.$comment&&a.opts.$comment&&(r+=" "+a.RULES.all.$comment.code(a,"$comment")),w){a.opts.coerceTypes&&(g=a.util.coerceToTypes(a.opts.coerceTypes,w));var S=a.RULES.types[w];if(g||b||!0===S||S&&!Z(S)){h=a.schemaPath+".type",d=a.errSchemaPath+"/type",h=a.schemaPath+".type",d=a.errSchemaPath+"/type";if(r+=" if ("+a.util[b?"checkDataTypes":"checkDataType"](w,f,a.opts.strictNumbers,!0)+") { ",g){var _="dataType"+l,F="coerced"+l;r+=" var "+_+" = typeof "+f+"; var "+F+" = undefined; ","array"==a.opts.coerceTypes&&(r+=" if ("+_+" == 'object' && Array.isArray("+f+") && "+f+".length == 1) { "+f+" = "+f+"[0]; "+_+" = typeof "+f+"; if ("+a.util.checkDataType(a.schema.type,f,a.opts.strictNumbers)+") "+F+" = "+f+"; } "),r+=" if ("+F+" !== undefined) ; ";var x=g;if(x)for(var R,$=-1,j=x.length-1;$<j;)"string"==(R=x[$+=1])?r+=" else if ("+_+" == 'number' || "+_+" == 'boolean') "+F+" = '' + "+f+"; else if ("+f+" === null) "+F+" = ''; ":"number"==R||"integer"==R?(r+=" else if ("+_+" == 'boolean' || "+f+" === null || ("+_+" == 'string' && "+f+" && "+f+" == +"+f+" ","integer"==R&&(r+=" && !("+f+" % 1)"),r+=")) "+F+" = +"+f+"; "):"boolean"==R?r+=" else if ("+f+" === 'false' || "+f+" === 0 || "+f+" === null) "+F+" = false; else if ("+f+" === 'true' || "+f+" === 1) "+F+" = true; ":"null"==R?r+=" else if ("+f+" === '' || "+f+" === 0 || "+f+" === false) "+F+" = null; ":"array"==a.opts.coerceTypes&&"array"==R&&(r+=" else if ("+_+" == 'string' || "+_+" == 'number' || "+_+" == 'boolean' || "+f+" == null) "+F+" = ["+f+"]; ");(U=U||[]).push(r+=" else {   "),r="",!1!==a.createErrors?(r+=" { keyword: 'type' , dataPath: (dataPath || '') + "+a.errorPath+" , schemaPath: "+a.util.toQuotedString(d)+" , params: { type: '",r+=b?""+w.join(","):""+w,r+="' } ",!1!==a.opts.messages&&(r+=" , message: 'should be ",r+=b?""+w.join(","):""+w,r+="' "),a.opts.verbose&&(r+=" , schema: validate.schema"+h+" , parentSchema: validate.schema"+a.schemaPath+" , data: "+f+" "),r+=" } "):r+=" {} ";var D=r;r=U.pop(),r+=!a.compositeRule&&p?a.async?" throw new ValidationError(["+D+"]); ":" validate.errors = ["+D+"]; return false; ":" var err = "+D+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",r+=" } if ("+F+" !== undefined) {  ";var O=c?"data"+(c-1||""):"parentData";r+=" "+f+" = "+F+"; ",c||(r+="if ("+O+" !== undefined)"),r+=" "+O+"["+(c?a.dataPathArr[c]:"parentDataProperty")+"] = "+F+"; } "}else{(U=U||[]).push(r),r="",!1!==a.createErrors?(r+=" { keyword: 'type' , dataPath: (dataPath || '') + "+a.errorPath+" , schemaPath: "+a.util.toQuotedString(d)+" , params: { type: '",r+=b?""+w.join(","):""+w,r+="' } ",!1!==a.opts.messages&&(r+=" , message: 'should be ",r+=b?""+w.join(","):""+w,r+="' "),a.opts.verbose&&(r+=" , schema: validate.schema"+h+" , parentSchema: validate.schema"+a.schemaPath+" , data: "+f+" "),r+=" } "):r+=" {} ";D=r;r=U.pop(),r+=!a.compositeRule&&p?a.async?" throw new ValidationError(["+D+"]); ":" validate.errors = ["+D+"]; return false; ":" var err = "+D+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; "}r+=" } "}}if(a.schema.$ref&&!s)r+=" "+a.RULES.all.$ref.code(a,"$ref")+" ",p&&(r+=" } if (errors === ",r+=v?"0":"errs_"+l,r+=") { ",E+="}");else{var I=a.RULES;if(I)for(var A=-1,k=I.length-1;A<k;)if(Z(S=I[A+=1])){if(S.type&&(r+=" if ("+a.util.checkDataType(S.type,f,a.opts.strictNumbers)+") { "),a.opts.useDefaults)if("object"==S.type&&a.schema.properties){var u=a.schema.properties,C=Object.keys(u);if(C)for(var L,N=-1,q=C.length-1;N<q;){if(void 0!==(Q=u[L=C[N+=1]]).default){var z=f+a.util.getProperty(L);if(a.compositeRule){if(a.opts.strictDefaults){y="default is ignored for: "+z;if("log"!==a.opts.strictDefaults)throw new Error(y);a.logger.warn(y)}}else r+=" if ("+z+" === undefined ","empty"==a.opts.useDefaults&&(r+=" || "+z+" === null || "+z+" === '' "),r+=" ) "+z+" = ",r+="shared"==a.opts.useDefaults?" "+a.useDefault(Q.default)+" ":" "+JSON.stringify(Q.default)+" ",r+="; "}}}else if("array"==S.type&&Array.isArray(a.schema.items)){var T=a.schema.items;if(T)for(var Q,$=-1,V=T.length-1;$<V;)if(void 0!==(Q=T[$+=1]).default){z=f+"["+$+"]";if(a.compositeRule){if(a.opts.strictDefaults){y="default is ignored for: "+z;if("log"!==a.opts.strictDefaults)throw new Error(y);a.logger.warn(y)}}else r+=" if ("+z+" === undefined ","empty"==a.opts.useDefaults&&(r+=" || "+z+" === null || "+z+" === '' "),r+=" ) "+z+" = ",r+="shared"==a.opts.useDefaults?" "+a.useDefault(Q.default)+" ":" "+JSON.stringify(Q.default)+" ",r+="; "}}var U,H=S.rules;if(H)for(var M,K,B=-1,J=H.length-1;B<J;){!G(K=H[B+=1])||(M=K.code(a,K.keyword,S.type))&&(r+=" "+M+" ",p&&(P+="}"))}p&&(r+=" "+P+" ",P=""),S.type&&(r+=" } ",w&&w===S.type&&!g&&(h=a.schemaPath+".type",d=a.errSchemaPath+"/type",(U=U||[]).push(r+=" else { "),r="",!1!==a.createErrors?(r+=" { keyword: 'type' , dataPath: (dataPath || '') + "+a.errorPath+" , schemaPath: "+a.util.toQuotedString(d)+" , params: { type: '",r+=b?""+w.join(","):""+w,r+="' } ",!1!==a.opts.messages&&(r+=" , message: 'should be ",r+=b?""+w.join(","):""+w,r+="' "),a.opts.verbose&&(r+=" , schema: validate.schema"+h+" , parentSchema: validate.schema"+a.schemaPath+" , data: "+f+" "),r+=" } "):r+=" {} ",D=r,r=U.pop(),r+=!a.compositeRule&&p?a.async?" throw new ValidationError(["+D+"]); ":" validate.errors = ["+D+"]; return false; ":" var err = "+D+";  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ",r+=" } ")),p&&(r+=" if (errors === ",r+=v?"0":"errs_"+l,r+=") { ",E+="}")}}function Z(e){for(var r=e.rules,t=0;t<r.length;t++)if(G(r[t]))return 1}function G(e){return void 0!==a.schema[e.keyword]||e.implements&&function(e){for(var r=e.implements,t=0;t<r.length;t++)if(void 0!==a.schema[r[t]])return 1}(e)}return p&&(r+=" "+E+" "),v?(t?(r+=" if (errors === 0) return data;           ",r+=" else throw new ValidationError(vErrors); "):(r+=" validate.errors = vErrors; ",r+=" return errors === 0;       "),r+=" }; return validate;"):r+=" var "+m+" = errors === errs_"+l+";",r}},{}],39:[function(e,r,t){"use strict";var i=/^[a-z_$][a-z0-9_$-]*$/i,l=e("./dotjs/custom"),a=e("./definition_schema");function s(e,r){s.errors=null;var t=this._validateKeyword=this._validateKeyword||this.compile(a,!0);if(t(e))return!0;if(s.errors=t.errors,r)throw new Error("custom keyword definition is invalid: "+this.errorsText(t.errors));return!1}r.exports={add:function(e,r){var n=this.RULES;if(n.keywords[e])throw new Error("Keyword "+e+" is already defined");if(!i.test(e))throw new Error("Keyword "+e+" is not a valid identifier");if(r){this.validateKeyword(r,!0);var t=r.type;if(Array.isArray(t))for(var a=0;a<t.length;a++)o(e,t[a],r);else o(e,t,r);var s=r.metaSchema;s&&(r.$data&&this._opts.$data&&(s={anyOf:[s,{$ref:"https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#"}]}),r.validateSchema=this.compile(s,!0))}function o(e,r,t){for(var a,s=0;s<n.length;s++){var o=n[s];if(o.type==r){a=o;break}}a||n.push(a={type:r,rules:[]});var i={keyword:e,definition:t,custom:!0,code:l,implements:t.implements};a.rules.push(i),n.custom[e]=i}return n.keywords[e]=n.all[e]=!0,this},get:function(e){var r=this.RULES.custom[e];return r?r.definition:this.RULES.keywords[e]||!1},remove:function(e){var r=this.RULES;delete r.keywords[e],delete r.all[e],delete r.custom[e];for(var t=0;t<r.length;t++)for(var a=r[t].rules,s=0;s<a.length;s++)if(a[s].keyword==e){a.splice(s,1);break}return this},validate:s}},{"./definition_schema":12,"./dotjs/custom":22}],40:[function(e,r,t){r.exports={$schema:"http://json-schema.org/draft-07/schema#",$id:"https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#",description:"Meta-schema for $data reference (JSON Schema extension proposal)",type:"object",required:["$data"],properties:{$data:{type:"string",anyOf:[{format:"relative-json-pointer"},{format:"json-pointer"}]}},additionalProperties:!1}},{}],41:[function(e,r,t){r.exports={$schema:"http://json-schema.org/draft-07/schema#",$id:"http://json-schema.org/draft-07/schema#",title:"Core schema meta-schema",definitions:{schemaArray:{type:"array",minItems:1,items:{$ref:"#"}},nonNegativeInteger:{type:"integer",minimum:0},nonNegativeIntegerDefault0:{allOf:[{$ref:"#/definitions/nonNegativeInteger"},{default:0}]},simpleTypes:{enum:["array","boolean","integer","null","number","object","string"]},stringArray:{type:"array",items:{type:"string"},uniqueItems:!0,default:[]}},type:["object","boolean"],properties:{$id:{type:"string",format:"uri-reference"},$schema:{type:"string",format:"uri"},$ref:{type:"string",format:"uri-reference"},$comment:{type:"string"},title:{type:"string"},description:{type:"string"},default:!0,readOnly:{type:"boolean",default:!1},examples:{type:"array",items:!0},multipleOf:{type:"number",exclusiveMinimum:0},maximum:{type:"number"},exclusiveMaximum:{type:"number"},minimum:{type:"number"},exclusiveMinimum:{type:"number"},maxLength:{$ref:"#/definitions/nonNegativeInteger"},minLength:{$ref:"#/definitions/nonNegativeIntegerDefault0"},pattern:{type:"string",format:"regex"},additionalItems:{$ref:"#"},items:{anyOf:[{$ref:"#"},{$ref:"#/definitions/schemaArray"}],default:!0},maxItems:{$ref:"#/definitions/nonNegativeInteger"},minItems:{$ref:"#/definitions/nonNegativeIntegerDefault0"},uniqueItems:{type:"boolean",default:!1},contains:{$ref:"#"},maxProperties:{$ref:"#/definitions/nonNegativeInteger"},minProperties:{$ref:"#/definitions/nonNegativeIntegerDefault0"},required:{$ref:"#/definitions/stringArray"},additionalProperties:{$ref:"#"},definitions:{type:"object",additionalProperties:{$ref:"#"},default:{}},properties:{type:"object",additionalProperties:{$ref:"#"},default:{}},patternProperties:{type:"object",additionalProperties:{$ref:"#"},propertyNames:{format:"regex"},default:{}},dependencies:{type:"object",additionalProperties:{anyOf:[{$ref:"#"},{$ref:"#/definitions/stringArray"}]}},propertyNames:{$ref:"#"},const:!0,enum:{type:"array",items:!0,minItems:1,uniqueItems:!0},type:{anyOf:[{$ref:"#/definitions/simpleTypes"},{type:"array",items:{$ref:"#/definitions/simpleTypes"},minItems:1,uniqueItems:!0}]},format:{type:"string"},contentMediaType:{type:"string"},contentEncoding:{type:"string"},if:{$ref:"#"},then:{$ref:"#"},else:{$ref:"#"},allOf:{$ref:"#/definitions/schemaArray"},anyOf:{$ref:"#/definitions/schemaArray"},oneOf:{$ref:"#/definitions/schemaArray"},not:{$ref:"#"}},default:!0}},{}],42:[function(e,r,t){"use strict";r.exports=function e(r,t){if(r===t)return!0;if(r&&t&&"object"==typeof r&&"object"==typeof t){if(r.constructor!==t.constructor)return!1;var a,s,o;if(Array.isArray(r)){if((a=r.length)!=t.length)return!1;for(s=a;0!=s--;)if(!e(r[s],t[s]))return!1;return!0}if(r.constructor===RegExp)return r.source===t.source&&r.flags===t.flags;if(r.valueOf!==Object.prototype.valueOf)return r.valueOf()===t.valueOf();if(r.toString!==Object.prototype.toString)return r.toString()===t.toString();if((a=(o=Object.keys(r)).length)!==Object.keys(t).length)return!1;for(s=a;0!=s--;)if(!Object.prototype.hasOwnProperty.call(t,o[s]))return!1;for(s=a;0!=s--;){var i=o[s];if(!e(r[i],t[i]))return!1}return!0}return r!=r&&t!=t}},{}],43:[function(e,r,t){"use strict";r.exports=function(e,r){"function"==typeof(r=r||{})&&(r={cmp:r});var a,l="boolean"==typeof r.cycles&&r.cycles,c=r.cmp&&(a=r.cmp,function(t){return function(e,r){return a({key:e,value:t[e]},{key:r,value:t[r]})}}),u=[];return function e(r){if(r&&r.toJSON&&"function"==typeof r.toJSON&&(r=r.toJSON()),void 0!==r){if("number"==typeof r)return isFinite(r)?""+r:"null";if("object"!=typeof r)return JSON.stringify(r);if(Array.isArray(r)){for(s="[",o=0;o<r.length;o++)o&&(s+=","),s+=e(r[o])||"null";return s+"]"}if(null===r)return"null";if(-1!==u.indexOf(r)){if(l)return JSON.stringify("__cycle__");throw new TypeError("Converting circular structure to JSON")}for(var t=u.push(r)-1,a=Object.keys(r).sort(c&&c(r)),s="",o=0;o<a.length;o++){var i=a[o],n=e(r[i]);n&&(s&&(s+=","),s+=JSON.stringify(i)+":"+n)}return u.splice(t,1),"{"+s+"}"}}(e)}},{}],44:[function(e,r,t){"use strict";var m=r.exports=function(e,r,t){"function"==typeof r&&(t=r,r={}),function e(r,t,a,s,o,i,n,l,c,u){if(s&&"object"==typeof s&&!Array.isArray(s)){for(var h in t(s,o,i,n,l,c,u),s){var d=s[h];if(Array.isArray(d)){if(h in m.arrayKeywords)for(var p=0;p<d.length;p++)e(r,t,a,d[p],o+"/"+h+"/"+p,i,o,h,s,p)}else if(h in m.propsKeywords){if(d&&"object"==typeof d)for(var f in d)e(r,t,a,d[f],o+"/"+h+"/"+f.replace(/~/g,"~0").replace(/\//g,"~1"),i,o,h,s,f)}else(h in m.keywords||r.allKeys&&!(h in m.skipKeywords))&&e(r,t,a,d,o+"/"+h,i,o,h,s)}a(s,o,i,n,l,c,u)}}(r,"function"==typeof(t=r.cb||t)?t:t.pre||function(){},t.post||function(){},e,"",e)};m.keywords={additionalItems:!0,items:!0,contains:!0,additionalProperties:!0,propertyNames:!0,not:!0},m.arrayKeywords={items:!0,allOf:!0,anyOf:!0,oneOf:!0},m.propsKeywords={definitions:!0,properties:!0,patternProperties:!0,dependencies:!0},m.skipKeywords={default:!0,enum:!0,const:!0,required:!0,maximum:!0,minimum:!0,exclusiveMaximum:!0,exclusiveMinimum:!0,multipleOf:!0,maxLength:!0,minLength:!0,pattern:!0,format:!0,maxItems:!0,minItems:!0,uniqueItems:!0,maxProperties:!0,minProperties:!0}},{}],45:[function(e,r,t){var a;a=this,function(e){"use strict";function J(){for(var e=arguments.length,r=Array(e),t=0;t<e;t++)r[t]=arguments[t];if(1<r.length){r[0]=r[0].slice(0,-1);for(var a=r.length-1,s=1;s<a;++s)r[s]=r[s].slice(1,-1);return r[a]=r[a].slice(1),r.join("")}return r[0]}function Z(e){return"(?:"+e+")"}function a(e){return void 0===e?"undefined":null===e?"null":Object.prototype.toString.call(e).split(" ").pop().split("]").shift().toLowerCase()}function f(e){return e.toUpperCase()}function r(e){var r="[A-Za-z]",t="[0-9]",a=J(t,"[A-Fa-f]"),s=Z(Z("%[EFef]"+a+"%"+a+a+"%"+a+a)+"|"+Z("%[89A-Fa-f]"+a+"%"+a+a)+"|"+Z("%"+a+a)),o="[\\!\\$\\&\\'\\(\\)\\*\\+\\,\\;\\=]",i=J("[\\:\\/\\?\\#\\[\\]\\@]",o),n=e?"[\\uE000-\\uF8FF]":"[]",l=J(r,t,"[\\-\\.\\_\\~]",e?"[\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]":"[]"),c=Z(r+J(r,t,"[\\+\\-\\.]")+"*"),u=Z(Z(s+"|"+J(l,o,"[\\:]"))+"*"),h=(Z("(?:25[0-5])|(?:2[0-4][0-9])|(?:1[0-9][0-9])|(?:[1-9][0-9])|"+t),Z("(?:25[0-5])|(?:2[0-4][0-9])|(?:1[0-9][0-9])|(?:0?[1-9][0-9])|0?0?"+t)),d=Z(h+"\\."+h+"\\."+h+"\\."+h),p=Z(a+"{1,4}"),f=Z(Z(p+"\\:"+p)+"|"+d),m=Z(Z(p+"\\:")+"{6}"+f),v=Z("\\:\\:"+Z(p+"\\:")+"{5}"+f),y=Z(Z(p)+"?\\:\\:"+Z(p+"\\:")+"{4}"+f),g=Z(Z(Z(p+"\\:")+"{0,1}"+p)+"?\\:\\:"+Z(p+"\\:")+"{3}"+f),P=Z(Z(Z(p+"\\:")+"{0,2}"+p)+"?\\:\\:"+Z(p+"\\:")+"{2}"+f),E=Z(Z(Z(p+"\\:")+"{0,3}"+p)+"?\\:\\:"+p+"\\:"+f),w=Z(Z(Z(p+"\\:")+"{0,4}"+p)+"?\\:\\:"+f),b=Z(Z(Z(p+"\\:")+"{0,5}"+p)+"?\\:\\:"+p),S=Z(Z(Z(p+"\\:")+"{0,6}"+p)+"?\\:\\:"),_=Z([m,v,y,g,P,E,w,b,S].join("|")),F=Z(Z(l+"|"+s)+"+"),x=(Z(_+"\\%25"+F),Z(_+Z("\\%25|\\%(?!"+a+"{2})")+F)),R=Z("[vV]"+a+"+\\."+J(l,o,"[\\:]")+"+"),$=Z("\\["+Z(x+"|"+_+"|"+R)+"\\]"),j=Z(Z(s+"|"+J(l,o))+"*"),D=Z($+"|"+d+"(?!"+j+")|"+j),O=Z(t+"*"),I=Z(Z(u+"@")+"?"+D+Z("\\:"+O)+"?"),A=Z(s+"|"+J(l,o,"[\\:\\@]")),k=Z(A+"*"),C=Z(A+"+"),L=Z(Z(s+"|"+J(l,o,"[\\@]"))+"+"),N=Z(Z("\\/"+k)+"*"),q=Z("\\/"+Z(C+N)+"?"),z=Z(L+N),T=Z(C+N),Q="(?!"+A+")",V=(Z(N+"|"+q+"|"+z+"|"+T+"|"+Q),Z(Z(A+"|"+J("[\\/\\?]",n))+"*")),U=Z(Z(A+"|[\\/\\?]")+"*"),H=Z(Z("\\/\\/"+I+N)+"|"+q+"|"+T+"|"+Q),M=Z(c+"\\:"+H+Z("\\?"+V)+"?"+Z("\\#"+U)+"?"),K=Z(Z("\\/\\/"+I+N)+"|"+q+"|"+z+"|"+Q),B=Z(K+Z("\\?"+V)+"?"+Z("\\#"+U)+"?");Z(M+"|"+B),Z(c+"\\:"+H+Z("\\?"+V)+"?"),Z(Z("\\/\\/("+Z("("+u+")@")+"?("+D+")"+Z("\\:("+O+")")+"?)")+"?("+N+"|"+q+"|"+T+"|"+Q+")"),Z("\\?("+V+")"),Z("\\#("+U+")"),Z(Z("\\/\\/("+Z("("+u+")@")+"?("+D+")"+Z("\\:("+O+")")+"?)")+"?("+N+"|"+q+"|"+z+"|"+Q+")"),Z("\\?("+V+")"),Z("\\#("+U+")"),Z(Z("\\/\\/("+Z("("+u+")@")+"?("+D+")"+Z("\\:("+O+")")+"?)")+"?("+N+"|"+q+"|"+T+"|"+Q+")"),Z("\\?("+V+")"),Z("\\#("+U+")"),Z("("+u+")@"),Z("\\:("+O+")");return{NOT_SCHEME:new RegExp(J("[^]",r,t,"[\\+\\-\\.]"),"g"),NOT_USERINFO:new RegExp(J("[^\\%\\:]",l,o),"g"),NOT_HOST:new RegExp(J("[^\\%\\[\\]\\:]",l,o),"g"),NOT_PATH:new RegExp(J("[^\\%\\/\\:\\@]",l,o),"g"),NOT_PATH_NOSCHEME:new RegExp(J("[^\\%\\/\\@]",l,o),"g"),NOT_QUERY:new RegExp(J("[^\\%]",l,o,"[\\:\\@\\/\\?]",n),"g"),NOT_FRAGMENT:new RegExp(J("[^\\%]",l,o,"[\\:\\@\\/\\?]"),"g"),ESCAPE:new RegExp(J("[^]",l,o),"g"),UNRESERVED:new RegExp(l,"g"),OTHER_CHARS:new RegExp(J("[^\\%]",l,i),"g"),PCT_ENCODED:new RegExp(s,"g"),IPV4ADDRESS:new RegExp("^("+d+")$"),IPV6ADDRESS:new RegExp("^\\[?("+_+")"+Z(Z("\\%25|\\%(?!"+a+"{2})")+"("+F+")")+"?\\]?$")}}var u=r(!1),h=r(!0),w=function(e,r){if(Array.isArray(e))return e;if(Symbol.iterator in Object(e))return function(e,r){var t=[],a=!0,s=!1,o=void 0;try{for(var i,n=e[Symbol.iterator]();!(a=(i=n.next()).done)&&(t.push(i.value),!r||t.length!==r);a=!0);}catch(e){s=!0,o=e}finally{try{!a&&n.return&&n.return()}finally{if(s)throw o}}return t}(e,r);throw new TypeError("Invalid attempt to destructure non-iterable instance")},A=2147483647,t=/^xn--/,s=/[^\0-\x7E]/,o=/[\x2E\u3002\uFF0E\uFF61]/g,i={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},k=Math.floor,C=String.fromCharCode;function L(e){throw new RangeError(i[e])}function n(e,r){var t=e.split("@"),a="";return 1<t.length&&(a=t[0]+"@",e=t[1]),a+function(e,r){for(var t=[],a=e.length;a--;)t[a]=r(e[a]);return t}((e=e.replace(o,".")).split("."),r).join(".")}function N(e){for(var r=[],t=0,a=e.length;t<a;){var s,o=e.charCodeAt(t++);55296<=o&&o<=56319&&t<a?56320==(64512&(s=e.charCodeAt(t++)))?r.push(((1023&o)<<10)+(1023&s)+65536):(r.push(o),t--):r.push(o)}return r}function q(e,r){return e+22+75*(e<26)-((0!=r)<<5)}function z(e,r,t){var a=0;for(e=t?k(e/700):e>>1,e+=k(e/r);455<e;a+=36)e=k(e/35);return k(a+36*e/(e+38))}function l(e){var r=[],t=e.length,a=0,s=128,o=72,i=e.lastIndexOf("-");i<0&&(i=0);for(var n=0;n<i;++n)128<=e.charCodeAt(n)&&L("not-basic"),r.push(e.charCodeAt(n));for(var l,c=0<i?i+1:0;c<t;){for(var u=a,h=1,d=36;;d+=36){t<=c&&L("invalid-input");var p=(l=e.charCodeAt(c++))-48<10?l-22:l-65<26?l-65:l-97<26?l-97:36;(36<=p||p>k((A-a)/h))&&L("overflow"),a+=p*h;var f=d<=o?1:o+26<=d?26:d-o;if(p<f)break;var m=36-f;h>k(A/m)&&L("overflow"),h*=m}var v=r.length+1,o=z(a-u,v,0==u);k(a/v)>A-s&&L("overflow"),s+=k(a/v),a%=v,r.splice(a++,0,s)}return String.fromCodePoint.apply(String,r)}function c(e){var r=[],t=(e=N(e)).length,a=128,s=0,o=72,i=!0,n=!1,l=void 0;try{for(var c,u=e[Symbol.iterator]();!(i=(c=u.next()).done);i=!0){var h=c.value;h<128&&r.push(C(h))}}catch(e){n=!0,l=e}finally{try{!i&&u.return&&u.return()}finally{if(n)throw l}}var d=r.length,p=d;for(d&&r.push("-");p<t;){var f=A,m=!0,v=!1,y=void 0;try{for(var g,P=e[Symbol.iterator]();!(m=(g=P.next()).done);m=!0){var E=g.value;a<=E&&E<f&&(f=E)}}catch(e){v=!0,y=e}finally{try{!m&&P.return&&P.return()}finally{if(v)throw y}}var w=p+1;f-a>k((A-s)/w)&&L("overflow"),s+=(f-a)*w,a=f;var b=!0,S=!1,_=void 0;try{for(var F,x=e[Symbol.iterator]();!(b=(F=x.next()).done);b=!0){var R=F.value;if(R<a&&++s>A&&L("overflow"),R==a){for(var $=s,j=36;;j+=36){var D=j<=o?1:o+26<=j?26:j-o;if($<D)break;var O=$-D,I=36-D;r.push(C(q(D+O%I,0))),$=k(O/I)}r.push(C(q($,0))),o=z(s,w,p==d),s=0,++p}}}catch(e){S=!0,_=e}finally{try{!b&&x.return&&x.return()}finally{if(S)throw _}}++s,++a}return r.join("")}var v={version:"2.1.0",ucs2:{decode:N,encode:function(e){return String.fromCodePoint.apply(String,function(e){if(Array.isArray(e)){for(var r=0,t=Array(e.length);r<e.length;r++)t[r]=e[r];return t}return Array.from(e)}(e))}},decode:l,encode:c,toASCII:function(e){return n(e,function(e){return s.test(e)?"xn--"+c(e):e})},toUnicode:function(e){return n(e,function(e){return t.test(e)?l(e.slice(4).toLowerCase()):e})}},d={};function m(e){var r=e.charCodeAt(0);return r<16?"%0"+r.toString(16).toUpperCase():r<128?"%"+r.toString(16).toUpperCase():r<2048?"%"+(r>>6|192).toString(16).toUpperCase()+"%"+(63&r|128).toString(16).toUpperCase():"%"+(r>>12|224).toString(16).toUpperCase()+"%"+(r>>6&63|128).toString(16).toUpperCase()+"%"+(63&r|128).toString(16).toUpperCase()}function p(e){for(var r="",t=0,a=e.length;t<a;){var s,o,i,n=parseInt(e.substr(t+1,2),16);n<128?(r+=String.fromCharCode(n),t+=3):194<=n&&n<224?(6<=a-t?(s=parseInt(e.substr(t+4,2),16),r+=String.fromCharCode((31&n)<<6|63&s)):r+=e.substr(t,6),t+=6):224<=n?(9<=a-t?(o=parseInt(e.substr(t+4,2),16),i=parseInt(e.substr(t+7,2),16),r+=String.fromCharCode((15&n)<<12|(63&o)<<6|63&i)):r+=e.substr(t,9),t+=9):(r+=e.substr(t,3),t+=3)}return r}function y(e,t){function r(e){var r=p(e);return r.match(t.UNRESERVED)?r:e}return e.scheme&&(e.scheme=String(e.scheme).replace(t.PCT_ENCODED,r).toLowerCase().replace(t.NOT_SCHEME,"")),void 0!==e.userinfo&&(e.userinfo=String(e.userinfo).replace(t.PCT_ENCODED,r).replace(t.NOT_USERINFO,m).replace(t.PCT_ENCODED,f)),void 0!==e.host&&(e.host=String(e.host).replace(t.PCT_ENCODED,r).toLowerCase().replace(t.NOT_HOST,m).replace(t.PCT_ENCODED,f)),void 0!==e.path&&(e.path=String(e.path).replace(t.PCT_ENCODED,r).replace(e.scheme?t.NOT_PATH:t.NOT_PATH_NOSCHEME,m).replace(t.PCT_ENCODED,f)),void 0!==e.query&&(e.query=String(e.query).replace(t.PCT_ENCODED,r).replace(t.NOT_QUERY,m).replace(t.PCT_ENCODED,f)),void 0!==e.fragment&&(e.fragment=String(e.fragment).replace(t.PCT_ENCODED,r).replace(t.NOT_FRAGMENT,m).replace(t.PCT_ENCODED,f)),e}function b(e){return e.replace(/^0*(.*)/,"$1")||"0"}function S(e,r){var t=e.match(r.IPV4ADDRESS)||[],a=w(t,2)[1];return a?a.split(".").map(b).join("."):e}function g(e,r){var t=e.match(r.IPV6ADDRESS)||[],a=w(t,3),s=a[1],o=a[2];if(s){for(var i=s.toLowerCase().split("::").reverse(),n=w(i,2),l=n[0],c=n[1],u=c?c.split(":").map(b):[],h=l.split(":").map(b),d=r.IPV4ADDRESS.test(h[h.length-1]),p=d?7:8,f=h.length-p,m=Array(p),v=0;v<p;++v)m[v]=u[v]||h[f+v]||"";d&&(m[p-1]=S(m[p-1],r));var y,g,P=m.reduce(function(e,r,t){var a;return r&&"0"!==r||((a=e[e.length-1])&&a.index+a.length===t?a.length++:e.push({index:t,length:1})),e},[]).sort(function(e,r){return r.length-e.length})[0],E=void 0;return E=P&&1<P.length?(y=m.slice(0,P.index),g=m.slice(P.index+P.length),y.join(":")+"::"+g.join(":")):m.join(":"),o&&(E+="%"+o),E}return e}var P=/^(?:([^:\/?#]+):)?(?:\/\/((?:([^\/?#@]*)@)?(\[[^\/?#\]]+\]|[^\/?#:]*)(?:\:(\d*))?))?([^?#]*)(?:\?([^#]*))?(?:#((?:.|\n|\r)*))?/i,E=void 0==="".match(/(){0}/)[1];function _(e){var r=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},t={},a=!1!==r.iri?h:u;"suffix"===r.reference&&(e=(r.scheme?r.scheme+":":"")+"//"+e);var s=e.match(P);if(s){E?(t.scheme=s[1],t.userinfo=s[3],t.host=s[4],t.port=parseInt(s[5],10),t.path=s[6]||"",t.query=s[7],t.fragment=s[8],isNaN(t.port)&&(t.port=s[5])):(t.scheme=s[1]||void 0,t.userinfo=-1!==e.indexOf("@")?s[3]:void 0,t.host=-1!==e.indexOf("//")?s[4]:void 0,t.port=parseInt(s[5],10),t.path=s[6]||"",t.query=-1!==e.indexOf("?")?s[7]:void 0,t.fragment=-1!==e.indexOf("#")?s[8]:void 0,isNaN(t.port)&&(t.port=e.match(/\/\/(?:.|\n)*\:(?:\/|\?|\#|$)/)?s[4]:void 0)),t.host&&(t.host=g(S(t.host,a),a)),t.reference=void 0!==t.scheme||void 0!==t.userinfo||void 0!==t.host||void 0!==t.port||t.path||void 0!==t.query?void 0===t.scheme?"relative":void 0===t.fragment?"absolute":"uri":"same-document",r.reference&&"suffix"!==r.reference&&r.reference!==t.reference&&(t.error=t.error||"URI is not a "+r.reference+" reference.");var o=d[(r.scheme||t.scheme||"").toLowerCase()];if(r.unicodeSupport||o&&o.unicodeSupport)y(t,a);else{if(t.host&&(r.domainHost||o&&o.domainHost))try{t.host=v.toASCII(t.host.replace(a.PCT_ENCODED,p).toLowerCase())}catch(e){t.error=t.error||"Host's domain name can not be converted to ASCII via punycode: "+e}y(t,u)}o&&o.parse&&o.parse(t,r)}else t.error=t.error||"URI can not be parsed.";return t}var F=/^\.\.?\//,x=/^\/\.(\/|$)/,R=/^\/\.\.(\/|$)/,$=/^\/?(?:.|\n)*?(?=\/|$)/;function j(e){for(var r=[];e.length;)if(e.match(F))e=e.replace(F,"");else if(e.match(x))e=e.replace(x,"/");else if(e.match(R))e=e.replace(R,"/"),r.pop();else if("."===e||".."===e)e="";else{var t=e.match($);if(!t)throw new Error("Unexpected dot segment condition");var a=t[0];e=e.slice(a.length),r.push(a)}return r.join("")}function D(r){var t=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},e=t.iri?h:u,a=[],s=d[(t.scheme||r.scheme||"").toLowerCase()];if(s&&s.serialize&&s.serialize(r,t),r.host&&!e.IPV6ADDRESS.test(r.host)&&(t.domainHost||s&&s.domainHost))try{r.host=t.iri?v.toUnicode(r.host):v.toASCII(r.host.replace(e.PCT_ENCODED,p).toLowerCase())}catch(e){r.error=r.error||"Host's domain name can not be converted to "+(t.iri?"Unicode":"ASCII")+" via punycode: "+e}y(r,e),"suffix"!==t.reference&&r.scheme&&(a.push(r.scheme),a.push(":"));var o,i,n,l,c=(i=!1!==t.iri?h:u,n=[],void 0!==(o=r).userinfo&&(n.push(o.userinfo),n.push("@")),void 0!==o.host&&n.push(g(S(String(o.host),i),i).replace(i.IPV6ADDRESS,function(e,r,t){return"["+r+(t?"%25"+t:"")+"]"})),"number"!=typeof o.port&&"string"!=typeof o.port||(n.push(":"),n.push(String(o.port))),n.length?n.join(""):void 0);return void 0!==c&&("suffix"!==t.reference&&a.push("//"),a.push(c),r.path&&"/"!==r.path.charAt(0)&&a.push("/")),void 0!==r.path&&(l=r.path,t.absolutePath||s&&s.absolutePath||(l=j(l)),void 0===c&&(l=l.replace(/^\/\//,"/%2F")),a.push(l)),void 0!==r.query&&(a.push("?"),a.push(r.query)),void 0!==r.fragment&&(a.push("#"),a.push(r.fragment)),a.join("")}function O(e,r){var t=2<arguments.length&&void 0!==arguments[2]?arguments[2]:{},a={};return arguments[3]||(e=_(D(e,t),t),r=_(D(r,t),t)),!(t=t||{}).tolerant&&r.scheme?(a.scheme=r.scheme,a.userinfo=r.userinfo,a.host=r.host,a.port=r.port,a.path=j(r.path||""),a.query=r.query):(void 0!==r.userinfo||void 0!==r.host||void 0!==r.port?(a.userinfo=r.userinfo,a.host=r.host,a.port=r.port,a.path=j(r.path||""),a.query=r.query):(r.path?("/"===r.path.charAt(0)?a.path=j(r.path):(a.path=void 0===e.userinfo&&void 0===e.host&&void 0===e.port||e.path?e.path?e.path.slice(0,e.path.lastIndexOf("/")+1)+r.path:r.path:"/"+r.path,a.path=j(a.path)),a.query=r.query):(a.path=e.path,a.query=void 0!==r.query?r.query:e.query),a.userinfo=e.userinfo,a.host=e.host,a.port=e.port),a.scheme=e.scheme),a.fragment=r.fragment,a}function I(e,r){return e&&e.toString().replace(r&&r.iri?h.PCT_ENCODED:u.PCT_ENCODED,p)}var T={scheme:"http",domainHost:!0,parse:function(e){return e.host||(e.error=e.error||"HTTP URIs must have a host."),e},serialize:function(e){var r="https"===String(e.scheme).toLowerCase();return e.port!==(r?443:80)&&""!==e.port||(e.port=void 0),e.path||(e.path="/"),e}},Q={scheme:"https",domainHost:T.domainHost,parse:T.parse,serialize:T.serialize};function V(e){return"boolean"==typeof e.secure?e.secure:"wss"===String(e.scheme).toLowerCase()}var U={scheme:"ws",domainHost:!0,parse:function(e){var r=e;return r.secure=V(r),r.resourceName=(r.path||"/")+(r.query?"?"+r.query:""),r.path=void 0,r.query=void 0,r},serialize:function(e){var r,t,a,s;return e.port!==(V(e)?443:80)&&""!==e.port||(e.port=void 0),"boolean"==typeof e.secure&&(e.scheme=e.secure?"wss":"ws",e.secure=void 0),e.resourceName&&(r=e.resourceName.split("?"),s=(t=w(r,2))[1],e.path=(a=t[0])&&"/"!==a?a:void 0,e.query=s,e.resourceName=void 0),e.fragment=void 0,e}},H={scheme:"wss",domainHost:U.domainHost,parse:U.parse,serialize:U.serialize},M={},K="[A-Za-z0-9\\-\\.\\_\\~\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]",B="[0-9A-Fa-f]",G=(Z(Z("%[EFef]"+B+"%"+B+B+"%"+B+B)+"|"+Z("%[89A-Fa-f]"+B+"%"+B+B)+"|"+Z("%"+B+B)),J("[\\!\\$\\%\\'\\(\\)\\*\\+\\,\\-\\.0-9\\<\\>A-Z\\x5E-\\x7E]",'[\\"\\\\]')),Y=new RegExp(K,"g"),W=new RegExp("(?:(?:%[EFef][0-9A-Fa-f]%[0-9A-Fa-f][0-9A-Fa-f]%[0-9A-Fa-f][0-9A-Fa-f])|(?:%[89A-Fa-f][0-9A-Fa-f]%[0-9A-Fa-f][0-9A-Fa-f])|(?:%[0-9A-Fa-f][0-9A-Fa-f]))","g"),X=new RegExp(J("[^]","[A-Za-z0-9\\!\\$\\%\\'\\*\\+\\-\\^\\_\\`\\{\\|\\}\\~]","[\\.]",'[\\"]',G),"g"),ee=new RegExp(J("[^]",K,"[\\!\\$\\'\\(\\)\\*\\+\\,\\;\\:\\@]"),"g"),re=ee;function te(e){var r=p(e);return r.match(Y)?r:e}var ae={scheme:"mailto",parse:function(e,r){var t=e,a=t.to=t.path?t.path.split(","):[];if(t.path=void 0,t.query){for(var s=!1,o={},i=t.query.split("&"),n=0,l=i.length;n<l;++n){var c=i[n].split("=");switch(c[0]){case"to":for(var u=c[1].split(","),h=0,d=u.length;h<d;++h)a.push(u[h]);break;case"subject":t.subject=I(c[1],r);break;case"body":t.body=I(c[1],r);break;default:s=!0,o[I(c[0],r)]=I(c[1],r)}}s&&(t.headers=o)}t.query=void 0;for(var p=0,f=a.length;p<f;++p){var m=a[p].split("@");if(m[0]=I(m[0]),r.unicodeSupport)m[1]=I(m[1],r).toLowerCase();else try{m[1]=v.toASCII(I(m[1],r).toLowerCase())}catch(e){t.error=t.error||"Email address's domain name can not be converted to ASCII via punycode: "+e}a[p]=m.join("@")}return t},serialize:function(e,r){var t,a=e,s=null!=(t=e.to)?t instanceof Array?t:"number"!=typeof t.length||t.split||t.setInterval||t.call?[t]:Array.prototype.slice.call(t):[];if(s){for(var o=0,i=s.length;o<i;++o){var n=String(s[o]),l=n.lastIndexOf("@"),c=n.slice(0,l).replace(W,te).replace(W,f).replace(X,m),u=n.slice(l+1);try{u=r.iri?v.toUnicode(u):v.toASCII(I(u,r).toLowerCase())}catch(e){a.error=a.error||"Email address's domain name can not be converted to "+(r.iri?"Unicode":"ASCII")+" via punycode: "+e}s[o]=c+"@"+u}a.path=s.join(",")}var h=e.headers=e.headers||{};e.subject&&(h.subject=e.subject),e.body&&(h.body=e.body);var d,p=[];for(d in h)h[d]!==M[d]&&p.push(d.replace(W,te).replace(W,f).replace(ee,m)+"="+h[d].replace(W,te).replace(W,f).replace(re,m));return p.length&&(a.query=p.join("&")),a}},se=/^([^\:]+)\:(.*)/,oe={scheme:"urn",parse:function(e,r){var t,a,s,o,i=e.path&&e.path.match(se),n=e;return i?(t=r.scheme||n.scheme||"urn",a=i[1].toLowerCase(),s=i[2],o=d[t+":"+(r.nid||a)],n.nid=a,n.nss=s,n.path=void 0,o&&(n=o.parse(n,r))):n.error=n.error||"URN can not be parsed.",n},serialize:function(e,r){var t=e.nid,a=d[(r.scheme||e.scheme||"urn")+":"+(r.nid||t)];a&&(e=a.serialize(e,r));var s=e;return s.path=(t||r.nid)+":"+e.nss,s}},ie=/^[0-9A-Fa-f]{8}(?:\-[0-9A-Fa-f]{4}){3}\-[0-9A-Fa-f]{12}$/,ne={scheme:"urn:uuid",parse:function(e,r){var t=e;return t.uuid=t.nss,t.nss=void 0,r.tolerant||t.uuid&&t.uuid.match(ie)||(t.error=t.error||"UUID is not valid."),t},serialize:function(e){var r=e;return r.nss=(e.uuid||"").toLowerCase(),r}};d[T.scheme]=T,d[Q.scheme]=Q,d[U.scheme]=U,d[H.scheme]=H,d[ae.scheme]=ae,d[oe.scheme]=oe,d[ne.scheme]=ne,e.SCHEMES=d,e.pctEncChar=m,e.pctDecChars=p,e.parse=_,e.removeDotSegments=j,e.serialize=D,e.resolveComponents=O,e.resolve=function(e,r,t){var a=function(e,r){var t=e;if(r)for(var a in r)t[a]=r[a];return t}({scheme:"null"},t);return D(O(_(e,a),_(r,a),a,!0),a)},e.normalize=function(e,r){return"string"==typeof e?e=D(_(e,r),r):"object"===a(e)&&(e=_(D(e,r),r)),e},e.equal=function(e,r,t){return"string"==typeof e?e=D(_(e,t),t):"object"===a(e)&&(e=D(e,t)),"string"==typeof r?r=D(_(r,t),t):"object"===a(r)&&(r=D(r,t)),e===r},e.escapeComponent=function(e,r){return e&&e.toString().replace(r&&r.iri?h.ESCAPE:u.ESCAPE,m)},e.unescapeComponent=I,Object.defineProperty(e,"__esModule",{value:!0})}("object"==typeof t&&void 0!==r?t:a.URI=a.URI||{})},{}],ajv:[function(a,e,r){"use strict";var n=a("./compile"),d=a("./compile/resolve"),t=a("./cache"),p=a("./compile/schema_obj"),s=a("fast-json-stable-stringify"),o=a("./compile/formats"),i=a("./compile/rules"),l=a("./data"),c=a("./compile/util");(e.exports=y).prototype.validate=function(e,r){var t;if("string"==typeof e){if(!(t=this.getSchema(e)))throw new Error('no schema with key or ref "'+e+'"')}else{var a=this._addSchema(e);t=a.validate||this._compile(a)}var s=t(r);!0!==t.$async&&(this.errors=t.errors);return s},y.prototype.compile=function(e,r){var t=this._addSchema(e,void 0,r);return t.validate||this._compile(t)},y.prototype.addSchema=function(e,r,t,a){if(Array.isArray(e)){for(var s=0;s<e.length;s++)this.addSchema(e[s],void 0,t,a);return this}var o=this._getId(e);if(void 0!==o&&"string"!=typeof o)throw new Error("schema id must be string");return S(this,r=d.normalizeId(r||o)),this._schemas[r]=this._addSchema(e,t,a,!0),this},y.prototype.addMetaSchema=function(e,r,t){return this.addSchema(e,r,t,!0),this},y.prototype.validateSchema=function(e,r){var t=e.$schema;if(void 0!==t&&"string"!=typeof t)throw new Error("$schema must be a string");if(!(t=t||this._opts.defaultMeta||function(e){var r=e._opts.meta;return e._opts.defaultMeta="object"==typeof r?e._getId(r)||r:e.getSchema(f)?f:void 0,e._opts.defaultMeta}(this)))return this.logger.warn("meta-schema not available"),!(this.errors=null);var a=this.validate(t,e);if(!a&&r){var s="schema is invalid: "+this.errorsText();if("log"!=this._opts.validateSchema)throw new Error(s);this.logger.error(s)}return a},y.prototype.getSchema=function(e){var r=g(this,e);switch(typeof r){case"object":return r.validate||this._compile(r);case"string":return this.getSchema(r);case"undefined":return function(e,r){var t=d.schema.call(e,{schema:{}},r);if(t){var a=t.schema,s=t.root,o=t.baseId,i=n.call(e,a,s,void 0,o);return e._fragments[r]=new p({ref:r,fragment:!0,schema:a,root:s,baseId:o,validate:i}),i}}(this,e)}},y.prototype.removeSchema=function(e){if(e instanceof RegExp)return P(this,this._schemas,e),P(this,this._refs,e),this;switch(typeof e){case"undefined":return P(this,this._schemas),P(this,this._refs),this._cache.clear(),this;case"string":var r=g(this,e);return r&&this._cache.del(r.cacheKey),delete this._schemas[e],delete this._refs[e],this;case"object":var t=this._opts.serialize,a=t?t(e):e;this._cache.del(a);var s=this._getId(e);s&&(s=d.normalizeId(s),delete this._schemas[s],delete this._refs[s])}return this},y.prototype.addFormat=function(e,r){"string"==typeof r&&(r=new RegExp(r));return this._formats[e]=r,this},y.prototype.errorsText=function(e,r){if(!(e=e||this.errors))return"No errors";for(var t=void 0===(r=r||{}).separator?", ":r.separator,a=void 0===r.dataVar?"data":r.dataVar,s="",o=0;o<e.length;o++){var i=e[o];i&&(s+=a+i.dataPath+" "+i.message+t)}return s.slice(0,-t.length)},y.prototype._addSchema=function(e,r,t,a){if("object"!=typeof e&&"boolean"!=typeof e)throw new Error("schema should be object or boolean");var s=this._opts.serialize,o=s?s(e):e,i=this._cache.get(o);if(i)return i;a=a||!1!==this._opts.addUsedSchema;var n=d.normalizeId(this._getId(e));n&&a&&S(this,n);var l,c=!1!==this._opts.validateSchema&&!r;c&&!(l=n&&n==d.normalizeId(e.$schema))&&this.validateSchema(e,!0);var u=d.ids.call(this,e),h=new p({id:n,schema:e,localRefs:u,cacheKey:o,meta:t});"#"!=n[0]&&a&&(this._refs[n]=h);this._cache.put(o,h),c&&l&&this.validateSchema(e,!0);return h},y.prototype._compile=function(t,e){if(t.compiling)return(t.validate=s).schema=t.schema,s.errors=null,s.root=e||s,!0===t.schema.$async&&(s.$async=!0),s;var r,a;t.compiling=!0,t.meta&&(r=this._opts,this._opts=this._metaOpts);try{a=n.call(this,t.schema,e,t.localRefs)}catch(e){throw delete t.validate,e}finally{t.compiling=!1,t.meta&&(this._opts=r)}return t.validate=a,t.refs=a.refs,t.refVal=a.refVal,t.root=a.root,a;function s(){var e=t.validate,r=e.apply(this,arguments);return s.errors=e.errors,r}},y.prototype.compileAsync=a("./compile/async");var u=a("./keyword");y.prototype.addKeyword=u.add,y.prototype.getKeyword=u.get,y.prototype.removeKeyword=u.remove,y.prototype.validateKeyword=u.validate;var h=a("./compile/error_classes");y.ValidationError=h.Validation,y.MissingRefError=h.MissingRef,y.$dataMetaSchema=l;var f="http://json-schema.org/draft-07/schema",m=["removeAdditional","useDefaults","coerceTypes","strictDefaults"],v=["/properties"];function y(e){if(!(this instanceof y))return new y(e);e=this._opts=c.copy(e)||{},function(e){var r=e._opts.logger;if(!1===r)e.logger={log:_,warn:_,error:_};else{if(void 0===r&&(r=console),!("object"==typeof r&&r.log&&r.warn&&r.error))throw new Error("logger must implement log, warn and error methods");e.logger=r}}(this),this._schemas={},this._refs={},this._fragments={},this._formats=o(e.format),this._cache=e.cache||new t,this._loadingSchemas={},this._compilations=[],this.RULES=i(),this._getId=function(e){switch(e.schemaId){case"auto":return b;case"id":return E;default:return w}}(e),e.loopRequired=e.loopRequired||1/0,"property"==e.errorDataPath&&(e._errorDataPathProperty=!0),void 0===e.serialize&&(e.serialize=s),this._metaOpts=function(e){for(var r=c.copy(e._opts),t=0;t<m.length;t++)delete r[m[t]];return r}(this),e.formats&&function(e){for(var r in e._opts.formats){e.addFormat(r,e._opts.formats[r])}}(this),e.keywords&&function(e){for(var r in e._opts.keywords){e.addKeyword(r,e._opts.keywords[r])}}(this),function(e){var r;e._opts.$data&&(r=a("./refs/data.json"),e.addMetaSchema(r,r.$id,!0));if(!1===e._opts.meta)return;var t=a("./refs/json-schema-draft-07.json");e._opts.$data&&(t=l(t,v));e.addMetaSchema(t,f,!0),e._refs["http://json-schema.org/schema"]=f}(this),"object"==typeof e.meta&&this.addMetaSchema(e.meta),e.nullable&&this.addKeyword("nullable",{metaSchema:{type:"boolean"}}),function(e){var r=e._opts.schemas;if(!r)return;if(Array.isArray(r))e.addSchema(r);else for(var t in r)e.addSchema(r[t],t)}(this)}function g(e,r){return r=d.normalizeId(r),e._schemas[r]||e._refs[r]||e._fragments[r]}function P(e,r,t){for(var a in r){var s=r[a];s.meta||t&&!t.test(a)||(e._cache.del(s.cacheKey),delete r[a])}}function E(e){return e.$id&&this.logger.warn("schema $id ignored",e.$id),e.id}function w(e){return e.id&&this.logger.warn("schema id ignored",e.id),e.$id}function b(e){if(e.$id&&e.id&&e.$id!=e.id)throw new Error("schema $id is different from id");return e.$id||e.id}function S(e,r){if(e._schemas[r]||e._refs[r])throw new Error('schema with key or id "'+r+'" already exists')}function _(){}},{"./cache":1,"./compile":5,"./compile/async":2,"./compile/error_classes":3,"./compile/formats":4,"./compile/resolve":6,"./compile/rules":7,"./compile/schema_obj":8,"./compile/util":10,"./data":11,"./keyword":39,"./refs/data.json":40,"./refs/json-schema-draft-07.json":41,"fast-json-stable-stringify":43}]},{},[])("ajv")});
+//# sourceMappingURL=ajv.min.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.min.js.map b/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.min.js.map
new file mode 100644
index 0000000..2d87595
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/dist/ajv.min.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"ajv.min.js","sources":["0"],"names":["f","exports","module","define","amd","window","global","self","this","Ajv","r","e","n","t","o","i","c","require","u","a","Error","code","p","call","length","1","Cache","_cache","prototype","put","key","value","get","del","clear","2","MissingRefError","MissingRef","compileAsync","schema","meta","callback","_opts","loadSchema","undefined","loadMetaSchemaOf","then","schemaObj","_addSchema","validate","_compileAsync","_compile","loadMissingSchema","ref","missingSchema","added","missingRef","schemaPromise","_loadingSchemas","removePromise","sch","addSchema","_refs","_schemas","v","$schema","getSchema","$ref","Promise","resolve","./error_classes","3","baseId","message","url","normalizeId","fullPath","errorSubclass","Subclass","Object","create","constructor","Validation","errors","ajv","validation","./resolve","4","util","DATE","DAYS","TIME","HOSTNAME","URI","URITEMPLATE","URL","UUID","JSON_POINTER","JSON_POINTER_URI_FRAGMENT","RELATIVE_JSON_POINTER","formats","mode","copy","date","str","matches","match","year","month","day","time","full","hour","minute","second","fast","date-time","uri","uri-reference","uri-template","email","hostname","ipv4","ipv6","regex","uuid","json-pointer","json-pointer-uri-fragment","relative-json-pointer","dateTime","split","DATE_TIME_SEPARATOR","NOT_URI_FRAGMENT","test","Z_ANCHOR","RegExp","./util","5","errorClasses","stableStringify","validateGenerator","ucs2length","equal","ValidationError","compile","root","localRefs","opts","refVal","refs","patterns","patternsHash","defaults","defaultsHash","customRules","index","compIndex","compiling","_compilations","compilation","callValidate","_formats","RULES","localCompile","cv","$async","sourceCode","source","splice","result","apply","arguments","_schema","_root","isRoot","isTop","schemaPath","errSchemaPath","errorPath","resolveRef","usePattern","useDefault","useCustomRule","logger","vars","refValCode","patternCode","defaultCode","customRuleCode","processCode","Function","makeValidate","error","_refVal","refCode","refIndex","resolvedRef","rootRefId","addLocalRef","localSchema","inlineRef","inlineRefs","refId","inline","regexStr","toQuotedString","valueStr","rule","parentSchema","it","validateSchema","deps","definition","dependencies","every","keyword","hasOwnProperty","join","errorsText","macro","arr","statement","../dotjs/validate","fast-deep-equal","fast-json-stable-stringify","6","SchemaObject","traverse","res","resolveSchema","parse","refPath","_getFullPath","getFullPath","_getId","keys","id","parsedRef","resolveUrl","getJsonPointer","ids","schemaId","baseIds","","fullPaths","allKeys","jsonPtr","rootSchema","parentJsonPtr","parentKeyword","keyIndex","escapeFragment","PREVENT_SCOPE_CHANGE","toHash","fragment","slice","parts","part","unescapeFragment","SIMPLE_INLINED","limit","checkNoRef","item","Array","isArray","countKeys","count","Infinity","normalize","serialize","TRAILING_SLASH_HASH","replace","./schema_obj","json-schema-traverse","uri-js","7","ruleModules","type","rules","maximum","minimum","properties","ALL","all","types","forEach","group","map","implKeywords","k","push","implements","$comment","keywords","concat","custom","../dotjs","8","obj","9","len","pos","charCodeAt","10","checkDataType","dataType","data","strictNumbers","negate","EQUAL","AND","OK","NOT","to","checkDataTypes","dataTypes","array","object","null","number","integer","coerceToTypes","optionCoerceTypes","COERCE_TO_TYPES","getProperty","escapeQuotes","varOccurences","dataVar","varReplace","expr","schemaHasRules","schemaHasRulesExcept","exceptKeyword","schemaUnknownRules","getPathExpr","currentPath","jsonPointers","isNumber","joinPaths","getPath","prop","path","escapeJsonPointer","getData","$data","lvl","paths","up","jsonPointer","segments","segment","unescapeJsonPointer","decodeURIComponent","encodeURIComponent","hash","IDENTIFIER","SINGLE_QUOTE","b","./ucs2length","11","KEYWORDS","metaSchema","keywordsJsonPointers","JSON","stringify","j","anyOf","12","$id","definitions","simpleTypes","statements","valid","not","required","items","modifying","async","const","./refs/json-schema-draft-07.json","13","$keyword","$schemaValueExcl","$exclusive","$exclType","$exclIsNumber","$opStr","$opExpr","$$outStack","out","$lvl","level","$dataLvl","dataLevel","$schemaPath","$errSchemaPath","$breakOnError","allErrors","$isData","$schemaValue","dataPathArr","$isMax","$exclusiveKeyword","$schemaExcl","$isDataExcl","$op","$notOp","$errorKeyword","createErrors","messages","verbose","__err","pop","compositeRule","Math","14","15","unicode","16","17","$it","$closingBraces","$nextValid","$currentBaseId","$allSchemasEmpty","arr1","$sch","$i","l1","strictKeywords","18","$valid","$errs","$wasComposite","19","20","21","$passData","$code","$idx","$dataNxt","$nextData","$nonEmptySchema","22","$compile","$inline","$macro","$ruleValidate","$validateCode","$rule","$definition","$rDef","$validateSchema","$parentData","$parentDataProperty","def_callRuleValidate","def_customError","$ruleErrs","$ruleErr","$asyncKeyword","passContext","23","$deps","$schemaDeps","$propertyDeps","$ownProperties","ownProperties","$property","$currentErrorPath","$propertyKey","$useData","$prop","$propertyPath","$missingProperty","_errorDataPathProperty","arr2","i2","l2","24","$vSchema","25","$ruleType","format","$format","$unknownFormats","unknownFormats","$allowUnknown","$isObject","$formatType","warn","indexOf","$formatRef","26","$ifClause","$thenSch","$elseSch","$thenPresent","$elsePresent","27","allOf","contains","enum","if","maxItems","minItems","maxLength","minLength","maxProperties","minProperties","multipleOf","oneOf","pattern","propertyNames","uniqueItems","./_limit","./_limitItems","./_limitLength","./_limitProperties","./allOf","./anyOf","./comment","./const","./contains","./dependencies","./enum","./format","./if","./items","./multipleOf","./not","./oneOf","./pattern","./properties","./propertyNames","./ref","./required","./uniqueItems","./validate","28","$currErrSchemaPath","$additionalItems","additionalItems","29","multipleOfPrecision","30","$allErrorsOption","31","$prevValid","$passingSchemas","32","$regexp","33","$requiredHash","$additionalProperty","$key","$dataProperties","$schemaKeys","filter","notProto","$pProperties","patternProperties","$pPropertyKeys","$aProperties","additionalProperties","$someProperties","$noAdditional","$additionalIsSchema","$removeAdditional","removeAdditional","$checkAdditional","$required","loopRequired","i1","$pProperty","$useDefaults","useDefaults","arr3","i3","l3","$hasDefault","default","arr4","i4","l4","34","$invalidName","35","$refCode","$refVal","$message","missingRefs","__callValidate","36","$propertySch","$loopRequired","37","$itemType","$typeIsArray","38","$refKeywords","$unknownKwd","$keywordsMsg","$top","rootId","strictDefaults","$defaultMsg","$coerceToTypes","$closingBraces1","$closingBraces2","$typeSchema","nullable","extendRefs","coerceTypes","$rulesGroup","$shouldUseGroup","$dataType","$coerced","$type","arr5","i5","l5","$shouldUseRule","impl","$ruleImplementsSomeKeyword","39","definitionSchema","validateKeyword","throwError","_validateKeyword","add","_addRule","ruleGroup","rg","remove","./definition_schema","./dotjs/custom","40","description","41","title","schemaArray","nonNegativeInteger","nonNegativeIntegerDefault0","stringArray","readOnly","examples","exclusiveMinimum","exclusiveMaximum","contentMediaType","contentEncoding","else","42","flags","valueOf","toString","43","cmp","cycles","node","seen","toJSON","isFinite","TypeError","seenIndex","sort","44","cb","_traverse","pre","post","arrayKeywords","propsKeywords","skipKeywords","45","merge","_len","sets","_key","xl","x","subexp","typeOf","shift","toLowerCase","toUpperCase","buildExps","isIRI","ALPHA$$","DIGIT$$","HEXDIG$$","PCT_ENCODED$","SUB_DELIMS$$","RESERVED$$","IPRIVATE$$","UNRESERVED$$","SCHEME$","USERINFO$","DEC_OCTET_RELAXED$","IPV4ADDRESS$","H16$","LS32$","IPV6ADDRESS1$","IPV6ADDRESS2$","IPV6ADDRESS3$","IPV6ADDRESS4$","IPV6ADDRESS5$","IPV6ADDRESS6$","IPV6ADDRESS7$","IPV6ADDRESS8$","IPV6ADDRESS9$","IPV6ADDRESS$","ZONEID$","IPV6ADDRZ_RELAXED$","IPVFUTURE$","IP_LITERAL$","REG_NAME$","HOST$","PORT$","AUTHORITY$","PCHAR$","SEGMENT$","SEGMENT_NZ$","SEGMENT_NZ_NC$","PATH_ABEMPTY$","PATH_ABSOLUTE$","PATH_NOSCHEME$","PATH_ROOTLESS$","PATH_EMPTY$","QUERY$","FRAGMENT$","HIER_PART$","URI$","RELATIVE_PART$","RELATIVE$","NOT_SCHEME","NOT_USERINFO","NOT_HOST","NOT_PATH","NOT_PATH_NOSCHEME","NOT_QUERY","NOT_FRAGMENT","ESCAPE","UNRESERVED","OTHER_CHARS","PCT_ENCODED","IPV4ADDRESS","IPV6ADDRESS","URI_PROTOCOL","IRI_PROTOCOL","slicedToArray","Symbol","iterator","_arr","_n","_d","_e","_s","_i","next","done","err","sliceIterator","maxInt","regexPunycode","regexNonASCII","regexSeparators","overflow","not-basic","invalid-input","floor","stringFromCharCode","String","fromCharCode","error$1","RangeError","mapDomain","string","fn","ucs2decode","output","counter","extra","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","baseMinusTMin","base","decode","input","inputLength","bias","basic","lastIndexOf","codePoint","oldi","w","baseMinusT","fromCodePoint","encode","_iteratorNormalCompletion","_didIteratorError","_iteratorError","_step","_iterator","_currentValue2","return","basicLength","handledCPCount","m","_iteratorNormalCompletion2","_didIteratorError2","_iteratorError2","_step2","_iterator2","currentValue","handledCPCountPlusOne","_iteratorNormalCompletion3","_didIteratorError3","_iteratorError3","_step3","_iterator3","_currentValue","q","qMinusT","punycode","version","ucs2","from","toConsumableArray","toASCII","toUnicode","SCHEMES","pctEncChar","chr","pctDecChars","newStr","il","c2","_c","c3","parseInt","substr","_normalizeComponentEncoding","components","protocol","decodeUnreserved","decStr","scheme","userinfo","host","query","_stripLeadingZeros","_normalizeIPv4","address","_normalizeIPv6","_matches2","zone","_address$toLowerCase$","reverse","_address$toLowerCase$2","last","first","firstFields","lastFields","isLastFieldIPv4Address","fieldCount","lastFieldsStart","fields","newFirst","newLast","longestZeroFields","reduce","acc","field","lastLongest","newHost","URI_PARSE","NO_MATCH_IS_UNDEFINED","uriString","options","iri","reference","port","isNaN","schemeHandler","unicodeSupport","domainHost","RDS1","RDS2","RDS3","RDS5","removeDotSegments","im","s","uriTokens","authority","_","$1","$2","charAt","absolutePath","resolveComponents","relative","target","tolerant","unescapeComponent","handler","secure","handler$1","isSecure","wsComponents","handler$2","resourceName","_wsComponents$resourc","_wsComponents$resourc2","handler$3","O","VCHAR$$","NOT_LOCAL_PART","NOT_HFNAME","NOT_HFVALUE","handler$4","mailtoComponents","unknownHeaders","headers","hfields","hfield","toAddrs","_x","_xl","subject","body","_x2","_xl2","addr","setInterval","toAddr","atIdx","localPart","domain","name","URN_PARSE","handler$5","nid","nss","urnComponents","uriComponents","handler$6","uuidComponents","baseURI","relativeURI","schemelessOptions","assign","uriA","uriB","escapeComponent","defineProperty","factory","compileSchema","$dataMetaSchema","schemaKeyRef","_meta","_skipValidation","checkUnique","addMetaSchema","skipValidation","throwOrLogError","defaultMeta","META_SCHEMA_ID","keyRef","_getSchemaObj","_fragments","_getSchemaFragment","removeSchema","_removeAllSchemas","cacheKey","addFormat","separator","text","dataPath","shouldAddSchema","cached","addUsedSchema","recursiveMeta","willValidate","currentOpts","_metaOpts","_validate","customKeyword","addKeyword","getKeyword","removeKeyword","META_IGNORE_OPTIONS","META_SUPPORT_DATA","log","noop","console","setLogger","cache","_get$IdOrId","_get$Id","chooseGetId","errorDataPath","metaOpts","getMetaSchemaOptions","addInitialFormats","addInitialKeywords","$dataSchema","addDefaultMetaSchema","optsSchemas","schemas","addInitialSchemas","./cache","./compile","./compile/async","./compile/error_classes","./compile/formats","./compile/resolve","./compile/rules","./compile/schema_obj","./compile/util","./data","./keyword","./refs/data.json"],"mappings":";CAAA,SAAUA,GAAuB,iBAAVC,SAAoC,oBAATC,OAAsBA,OAAOD,QAAQD,IAA4B,mBAATG,QAAqBA,OAAOC,IAAKD,OAAO,GAAGH,IAAiC,oBAATK,OAAwBA,OAA+B,oBAATC,OAAwBA,OAA6B,oBAAPC,KAAsBA,KAAYC,MAAOC,IAAMT,IAAxT,CAA+T,WAAqC,OAAmB,SAASU,EAAEC,EAAEC,EAAEC,GAAG,SAASC,EAAEC,EAAEf,GAAG,IAAIY,EAAEG,GAAG,CAAC,IAAIJ,EAAEI,GAAG,CAAC,IAAIC,EAAE,mBAAmBC,SAASA,QAAQ,IAAIjB,GAAGgB,EAAE,OAAOA,EAAED,GAAE,GAAI,GAAGG,EAAE,OAAOA,EAAEH,GAAE,GAAI,IAAII,EAAE,IAAIC,MAAM,uBAAuBL,EAAE,KAAK,MAAMI,EAAEE,KAAK,mBAAmBF,EAAE,IAAIG,EAAEV,EAAEG,GAAG,CAACd,QAAQ,IAAIU,EAAEI,GAAG,GAAGQ,KAAKD,EAAErB,QAAQ,SAASS,GAAoB,OAAOI,EAAlBH,EAAEI,GAAG,GAAGL,IAAeA,IAAIY,EAAEA,EAAErB,QAAQS,EAAEC,EAAEC,EAAEC,GAAG,OAAOD,EAAEG,GAAGd,QAAQ,IAAI,IAAIiB,EAAE,mBAAmBD,SAASA,QAAQF,EAAE,EAAEA,EAAEF,EAAEW,OAAOT,IAAID,EAAED,EAAEE,IAAI,OAAOD,EAA7b,CAA4c,CAACW,EAAE,CAAC,SAASR,EAAQf,EAAOD,gBAIn1B,IAAIyB,EAAQxB,EAAOD,QAAU,WAC3BO,KAAKmB,OAAS,IAIhBD,EAAME,UAAUC,IAAM,SAAmBC,EAAKC,GAC5CvB,KAAKmB,OAAOG,GAAOC,GAIrBL,EAAME,UAAUI,IAAM,SAAmBF,GACvC,OAAOtB,KAAKmB,OAAOG,IAIrBJ,EAAME,UAAUK,IAAM,SAAmBH,UAChCtB,KAAKmB,OAAOG,IAIrBJ,EAAME,UAAUM,MAAQ,WACtB1B,KAAKmB,OAAS,KAGd,IAAIQ,EAAE,CAAC,SAASlB,EAAQf,EAAOD,gBAGjC,IAAImC,EAAkBnB,EAAQ,mBAAmBoB,WAcjD,SAASC,EAAaC,EAAQC,EAAMC,GAIlC,IAAIlC,EAAOC,KACX,GAAoC,mBAAzBA,KAAKkC,MAAMC,WACpB,MAAM,IAAIvB,MAAM,2CAEC,mBAARoB,IACTC,EAAWD,EACXA,OAAOI,GAGT,IAAItB,EAAIuB,EAAiBN,GAAQO,KAAK,WACpC,IAAIC,EAAYxC,EAAKyC,WAAWT,OAAQK,EAAWJ,GACnD,OAAOO,EAAUE,UAqBnB,SAASC,EAAcH,GACrB,IAAM,OAAOxC,EAAK4C,SAASJ,GAC3B,MAAMpC,GACJ,GAAIA,aAAayB,EAAiB,OAAOgB,EAAkBzC,GAC3D,MAAMA,EAIR,SAASyC,EAAkBzC,GACzB,IAAI0C,EAAM1C,EAAE2C,cACZ,GAAIC,EAAMF,GAAM,MAAM,IAAIjC,MAAM,UAAYiC,EAAM,kBAAoB1C,EAAE6C,WAAa,uBAErF,IAAIC,EAAgBlD,EAAKmD,gBAAgBL,GAMzC,OALKI,IACHA,EAAgBlD,EAAKmD,gBAAgBL,GAAO9C,EAAKmC,MAAMC,WAAWU,IACpDP,KAAKa,EAAeA,GAG7BF,EAAcX,KAAK,SAAUc,GAClC,IAAKL,EAAMF,GACT,OAAOR,EAAiBe,GAAKd,KAAK,WAC3BS,EAAMF,IAAM9C,EAAKsD,UAAUD,EAAKP,OAAKT,EAAWJ,OAGxDM,KAAK,WACN,OAAOI,EAAcH,KAGvB,SAASY,WACApD,EAAKmD,gBAAgBL,GAG9B,SAASE,EAAMF,GACb,OAAO9C,EAAKuD,MAAMT,IAAQ9C,EAAKwD,SAASV,KAtDfH,CAAcH,KAU7C,OAPIN,GACFnB,EAAEwB,KACA,SAASkB,GAAKvB,EAAS,KAAMuB,IAC7BvB,GAIGnB,EAGP,SAASuB,EAAiBe,GACxB,IAAIK,EAAUL,EAAIK,QAClB,OAAOA,IAAY1D,EAAK2D,UAAUD,GACxB3B,EAAaf,KAAKhB,EAAM,CAAE4D,KAAMF,IAAW,GAC3CG,QAAQC,WA5CtBnE,EAAOD,QAAUqC,GAuFf,CAACgC,kBAAkB,IAAIC,EAAE,CAAC,SAAStD,EAAQf,EAAOD,gBAGpD,IAAIoE,EAAUpD,EAAQ,aAoBtB,SAASmB,EAAgBoC,EAAQnB,EAAKoB,GACpCjE,KAAKiE,QAAUA,GAAWrC,EAAgBqC,QAAQD,EAAQnB,GAC1D7C,KAAKgD,WAAaa,EAAQK,IAAIF,EAAQnB,GACtC7C,KAAK8C,cAAgBe,EAAQM,YAAYN,EAAQO,SAASpE,KAAKgD,aAIjE,SAASqB,EAAcC,GAGrB,OAFAA,EAASlD,UAAYmD,OAAOC,OAAO5D,MAAMQ,WACzCkD,EAASlD,UAAUqD,YAAcH,EA3BnC5E,EAAOD,QAAU,CACfiF,WAAYL,EAKd,SAAyBM,GACvB3E,KAAKiE,QAAU,oBACfjE,KAAK2E,OAASA,EACd3E,KAAK4E,IAAM5E,KAAK6E,YAAa,IAP7BhD,WAAYwC,EAAczC,IAW5BA,EAAgBqC,QAAU,SAAUD,EAAQnB,GAC1C,MAAO,2BAA8BA,EAAM,YAAcmB,IAiBzD,CAACc,YAAY,IAAIC,EAAE,CAAC,SAAStE,EAAQf,EAAOD,gBAG9C,IAAIuF,EAAOvE,EAAQ,UAEfwE,EAAO,6BACPC,EAAO,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAC3CC,EAAO,0DACPC,EAAW,wGACXC,EAAM,+nCAGNC,EAAc,oLAKdC,EAAM,grDACNC,EAAO,+DACPC,EAAe,4BACfC,EAA4B,+DAC5BC,EAAwB,mDAK5B,SAASC,EAAQC,GAEf,OAAOb,EAAKc,KAAKF,EADjBC,EAAe,QAARA,EAAiB,OAAS,SA+DnC,SAASE,EAAKC,GAEZ,IAAIC,EAAUD,EAAIE,MAAMjB,GACxB,IAAKgB,EAAS,OAAO,EAErB,IAXkBE,EAYdC,GAASH,EAAQ,GACjBI,GAAOJ,EAAQ,GAEnB,OAAgB,GAATG,GAAcA,GAAS,IAAa,GAAPC,GAC5BA,IAAiB,GAATD,KAhBED,GAWNF,EAAQ,IATN,GAAM,GAAME,EAAO,KAAQ,GAAKA,EAAO,KAAQ,GAcPjB,EAAKkB,GAAV,IAInD,SAASE,EAAKN,EAAKO,GACjB,IAAIN,EAAUD,EAAIE,MAAMf,GACxB,IAAKc,EAAS,OAAO,EAErB,IAAIO,EAAOP,EAAQ,GACfQ,EAASR,EAAQ,GACjBS,EAAST,EAAQ,GAErB,OAASO,GAAQ,IAAMC,GAAU,IAAMC,GAAU,IAChC,IAARF,GAAwB,IAAVC,GAA0B,IAAVC,MAC9BH,GAHMN,EAAQ,KAvFzBvG,EAAOD,QAAUmG,GAQTe,KAAO,CAEbZ,KAAM,6BAENO,KAAM,8EACNM,YAAa,0GAEbC,IAAK,6CACLC,gBAAiB,0EACjBC,eAAgBzB,EAChBpB,IAAKqB,EAILyB,MAAO,mHACPC,SAAU7B,EAEV8B,KAAM,4EAENC,KAAM,qpCACNC,MAAOA,EAEPC,KAAM7B,EAGN8B,eAAgB7B,EAChB8B,4BAA6B7B,EAE7B8B,wBAAyB7B,GAI3BC,EAAQW,KAAO,CACbR,KAAMA,EACNO,KAAMA,EACNM,YAoDF,SAAmBZ,GAEjB,IAAIyB,EAAWzB,EAAI0B,MAAMC,GACzB,OAA0B,GAAnBF,EAASzG,QAAe+E,EAAK0B,EAAS,KAAOnB,EAAKmB,EAAS,IAAI,IAtDtEZ,IA2DF,SAAab,GAEX,OAAO4B,EAAiBC,KAAK7B,IAAQX,EAAIwC,KAAK7B,IA5D9Cc,gBA3DW,yoCA4DXC,eAAgBzB,EAChBpB,IAAKqB,EACLyB,MAAO,2IACPC,SAAU7B,EACV8B,KAAM,4EACNC,KAAM,qpCACNC,MAAOA,EACPC,KAAM7B,EACN8B,eAAgB7B,EAChB8B,4BAA6B7B,EAC7B8B,wBAAyB7B,GAsC3B,IAAIgC,EAAsB,QAQ1B,IAAIC,EAAmB,OAOvB,IAAIE,EAAW,WACf,SAASV,EAAMpB,GACb,GAAI8B,EAASD,KAAK7B,GAAM,OAAO,EAC/B,IAEE,OADA,IAAI+B,OAAO/B,IACJ,EACP,MAAM7F,GACN,OAAO,KAIT,CAAC6H,SAAS,KAAKC,EAAE,CAAC,SAASxH,EAAQf,EAAOD,gBAG5C,IAAIoE,EAAUpD,EAAQ,aAClBuE,EAAOvE,EAAQ,UACfyH,EAAezH,EAAQ,mBACvB0H,EAAkB1H,EAAQ,8BAE1B2H,EAAoB3H,EAAQ,qBAM5B4H,EAAarD,EAAKqD,WAClBC,EAAQ7H,EAAQ,mBAGhB8H,EAAkBL,EAAaxD,WAcnC,SAAS8D,EAAQzG,EAAQ0G,EAAMC,EAAW1E,GAGxC,IAAIjE,EAAOC,KACP2I,EAAO3I,KAAKkC,MACZ0G,EAAS,MAAExG,GACXyG,EAAO,GACPC,EAAW,GACXC,EAAe,GACfC,EAAW,GACXC,EAAe,GACfC,EAAc,GAId1I,EA4QN,SAAwBuB,EAAQ0G,EAAMzE,GAEpC,IAAImF,EAAQC,EAAUrI,KAAKf,KAAM+B,EAAQ0G,EAAMzE,GAC/C,OAAa,GAATmF,EAAmB,CAAEA,MAAOA,EAAOE,WAAW,GAO3C,CAAEF,MANTA,EAAQnJ,KAAKsJ,cAActI,OAMJqI,YALvBrJ,KAAKsJ,cAAcH,GAAS,CAC1BpH,OAAQA,EACR0G,KAAMA,EACNzE,OAAQA,MApRajD,KAAKf,KAAM+B,EAFlC0G,EAAOA,GAAQ,CAAE1G,OAAQA,EAAQ6G,OAAQA,EAAQC,KAAMA,GAEP7E,GAC5CuF,EAAcvJ,KAAKsJ,cAAc9I,EAAE2I,OACvC,GAAI3I,EAAE6I,UAAW,OAAQE,EAAYC,aAAeA,EAEpD,IAAI5D,EAAU5F,KAAKyJ,SACfC,EAAQ1J,KAAK0J,MAEjB,IACE,IAAIlG,EAAImG,EAAa5H,EAAQ0G,EAAMC,EAAW1E,GAC9CuF,EAAY9G,SAAWe,EACvB,IAAIoG,EAAKL,EAAYC,aAUrB,OATII,IACFA,EAAG7H,OAASyB,EAAEzB,OACd6H,EAAGjF,OAAS,KACZiF,EAAGf,KAAOrF,EAAEqF,KACZe,EAAGhB,OAASpF,EAAEoF,OACdgB,EAAGnB,KAAOjF,EAAEiF,KACZmB,EAAGC,OAASrG,EAAEqG,OACVlB,EAAKmB,aAAYF,EAAGG,OAASvG,EAAEuG,SAE9BvG,EACP,SA4QJ,SAAsBzB,EAAQ0G,EAAMzE,GAElC,IAAIzD,EAAI6I,EAAUrI,KAAKf,KAAM+B,EAAQ0G,EAAMzE,GAClC,GAALzD,GAAQP,KAAKsJ,cAAcU,OAAOzJ,EAAG,KA9Q1BQ,KAAKf,KAAM+B,EAAQ0G,EAAMzE,GAIxC,SAASwF,IAEP,IAAI/G,EAAW8G,EAAY9G,SACvBwH,EAASxH,EAASyH,MAAMlK,KAAMmK,WAElC,OADAX,EAAa7E,OAASlC,EAASkC,OACxBsF,EAGT,SAASN,EAAaS,EAASC,EAAO3B,EAAW1E,GAC/C,IAAIsG,GAAUD,GAAUA,GAASA,EAAMtI,QAAUqI,EACjD,GAAIC,EAAMtI,QAAU0G,EAAK1G,OACvB,OAAOyG,EAAQzH,KAAKhB,EAAMqK,EAASC,EAAO3B,EAAW1E,GAEvD,IAAI6F,GAA4B,IAAnBO,EAAQP,OAEjBC,EAAa1B,EAAkB,CACjCmC,OAAO,EACPxI,OAAQqI,EACRE,OAAQA,EACRtG,OAAQA,EACRyE,KAAM4B,EACNG,WAAY,GACZC,cAAe,IACfC,UAAW,KACX9I,gBAAiBsG,EAAarG,WAC9B6H,MAAOA,EACPjH,SAAU2F,EACVpD,KAAMA,EACNnB,QAASA,EACT8G,WAAYA,EACZC,WAAYA,EACZC,WAAYA,EACZC,cAAeA,EACfnC,KAAMA,EACN/C,QAASA,EACTmF,OAAQhL,EAAKgL,OACbhL,KAAMA,IAGR+J,EAAakB,EAAKpC,EAAQqC,GAAcD,EAAKlC,EAAUoC,GACtCF,EAAKhC,EAAUmC,GAAeH,EAAK9B,EAAakC,GAChDtB,EAEbnB,EAAK0C,cAAavB,EAAanB,EAAK0C,YAAYvB,EAAYM,IAGhE,IACE,IAcA3H,EAdmB,IAAI6I,SACrB,OACA,QACA,UACA,OACA,SACA,WACA,cACA,QACA,aACA,kBACAxB,EAGSyB,CACTxL,EACA2J,EACA9D,EACA6C,EACAG,EACAI,EACAE,EACAZ,EACAD,EACAE,GAGFK,EAAO,GAAKnG,EACZ,MAAMtC,GAEN,MADAJ,EAAKgL,OAAOS,MAAM,yCAA0C1B,GACtD3J,EAiBR,OAdAsC,EAASV,OAASqI,EAClB3H,EAASkC,OAAS,KAClBlC,EAASoG,KAAOA,EAChBpG,EAASmG,OAASA,EAClBnG,EAASgG,KAAO6B,EAAS7H,EAAW4H,EAChCR,IAAQpH,EAASoH,QAAS,IACN,IAApBlB,EAAKmB,aACPrH,EAASsH,OAAS,CAChBlJ,KAAMiJ,EACNhB,SAAUA,EACVE,SAAUA,IAIPvG,EAGT,SAASkI,EAAW3G,EAAQnB,EAAKyH,GAC/BzH,EAAMgB,EAAQK,IAAIF,EAAQnB,GAC1B,IACI4I,EAASC,EADTC,EAAW9C,EAAKhG,GAEpB,QAAiBT,IAAbuJ,EAGF,OAAOC,EAFPH,EAAU7C,EAAO+C,GACjBD,EAAU,UAAYC,EAAW,KAGnC,IAAKrB,GAAU7B,EAAKI,KAAM,CACxB,IAAIgD,EAAYpD,EAAKI,KAAKhG,GAC1B,QAAkBT,IAAdyJ,EAGF,OAAOD,EAFPH,EAAUhD,EAAKG,OAAOiD,GACtBH,EAAUI,EAAYjJ,EAAK4I,IAK/BC,EAAUI,EAAYjJ,GACtB,IAEMkJ,EAFFvI,EAAIK,EAAQ9C,KAAKhB,EAAM4J,EAAclB,EAAM5F,GAU/C,QATUT,IAANoB,IACEuI,EAAcrD,GAAaA,EAAU7F,MAEvCW,EAAIK,EAAQmI,UAAUD,EAAapD,EAAKsD,YAClCF,EACAvD,EAAQzH,KAAKhB,EAAMgM,EAAatD,EAAMC,EAAW1E,SAIjD5B,IAANoB,EAIF,OAAOoI,EAiBThD,EADYC,EAjBMhG,IAAKW,EACCkI,UAYjB7C,EAfUhG,GAOnB,SAASiJ,EAAYjJ,EAAKW,GACxB,IAAI0I,EAAQtD,EAAO5H,OAGnB,OAFA4H,EAAOsD,GAAS1I,EAET,UADPqF,EAAKhG,GAAOqJ,GAad,SAASN,EAAYhD,EAAQ/H,GAC3B,MAAwB,iBAAV+H,GAAuC,kBAAVA,EACjC,CAAE/H,KAAMA,EAAMkB,OAAQ6G,EAAQuD,QAAQ,GACtC,CAAEtL,KAAMA,EAAMgJ,OAAQjB,KAAYA,EAAOiB,QAGrD,SAASe,EAAWwB,GAClB,IAAIjD,EAAQJ,EAAaqD,GAKzB,YAJchK,IAAV+G,IACFA,EAAQJ,EAAaqD,GAAYtD,EAAS9H,OAC1C8H,EAASK,GAASiD,GAEb,UAAYjD,EAGrB,SAAS0B,EAAWtJ,GAClB,cAAeA,GACb,IAAK,UACL,IAAK,SACH,MAAO,GAAKA,EACd,IAAK,SACH,OAAOyD,EAAKqH,eAAe9K,GAC7B,IAAK,SACH,GAAc,OAAVA,EAAgB,MAAO,OAC3B,IAAI+K,EAAWnE,EAAgB5G,GAC3B4H,EAAQF,EAAaqD,GAKzB,YAJclK,IAAV+G,IACFA,EAAQF,EAAaqD,GAAYtD,EAAShI,OAC1CgI,EAASG,GAAS5H,GAEb,UAAY4H,GAIzB,SAAS2B,EAAcyB,EAAMxK,EAAQyK,EAAcC,GACjD,IAAkC,IAA9B1M,EAAKmC,MAAMwK,eAA0B,CACvC,IAAIC,EAAOJ,EAAKK,WAAWC,aAC3B,GAAIF,IAASA,EAAKG,MAAM,SAASC,GAC/B,OAAOxI,OAAOnD,UAAU4L,eAAejM,KAAKyL,EAAcO,KAE1D,MAAM,IAAInM,MAAM,kDAAoD+L,EAAKM,KAAK,MAEhF,IAAIP,EAAiBH,EAAKK,WAAWF,eACrC,GAAIA,EAEF,IADYA,EAAe3K,GACf,CACV,IAAIkC,EAAU,8BAAgClE,EAAKmN,WAAWR,EAAe/H,QAC7E,GAAiC,OAA7B5E,EAAKmC,MAAMwK,eACV,MAAM,IAAI9L,MAAMqD,GADmBlE,EAAKgL,OAAOS,MAAMvH,IAMhE,IAIIxB,EAJA+F,EAAU+D,EAAKK,WAAWpE,QAC1B2D,EAASI,EAAKK,WAAWT,OACzBgB,EAAQZ,EAAKK,WAAWO,MAG5B,GAAI3E,EACF/F,EAAW+F,EAAQzH,KAAKhB,EAAMgC,EAAQyK,EAAcC,QAC/C,GAAIU,EACT1K,EAAW0K,EAAMpM,KAAKhB,EAAMgC,EAAQyK,EAAcC,IACtB,IAAxB9D,EAAK+D,gBAA0B3M,EAAK2M,eAAejK,GAAU,QAC5D,GAAI0J,EACT1J,EAAW0J,EAAOpL,KAAKhB,EAAM0M,EAAIF,EAAKQ,QAAShL,EAAQyK,QAGvD,KADA/J,EAAW8J,EAAKK,WAAWnK,UACZ,OAGjB,QAAiBL,IAAbK,EACF,MAAM,IAAI7B,MAAM,mBAAqB2L,EAAKQ,QAAU,sBAEtD,IAAI5D,EAAQD,EAAYlI,OAGxB,MAAO,CACLH,KAAM,aAAesI,EACrB1G,SAJFyG,EAAYC,GAAS1G,IAsDzB,SAAS2G,EAAUrH,EAAQ0G,EAAMzE,GAE/B,IAAK,IAAIzD,EAAE,EAAGA,EAAEP,KAAKsJ,cAActI,OAAQT,IAAK,CAC9C,IAAIC,EAAIR,KAAKsJ,cAAc/I,GAC3B,GAAIC,EAAEuB,QAAUA,GAAUvB,EAAEiI,MAAQA,GAAQjI,EAAEwD,QAAUA,EAAQ,OAAOzD,EAEzE,OAAQ,EAIV,SAAS2K,EAAY3K,EAAGuI,GACtB,MAAO,cAAgBvI,EAAI,iBAAmByE,EAAKqH,eAAevD,EAASvI,IAAM,KAInF,SAAS4K,EAAY5K,GACnB,MAAO,cAAgBA,EAAI,eAAiBA,EAAI,KAIlD,SAAS0K,EAAW1K,EAAGqI,GACrB,YAAqBxG,IAAdwG,EAAOrI,GAAmB,GAAK,aAAeA,EAAI,aAAeA,EAAI,KAI9E,SAAS6K,EAAe7K,GACtB,MAAO,iBAAmBA,EAAI,kBAAoBA,EAAI,KAIxD,SAASyK,EAAKoC,EAAKC,GACjB,IAAKD,EAAIpM,OAAQ,MAAO,GAExB,IADA,IAAIH,EAAO,GACFN,EAAE,EAAGA,EAAE6M,EAAIpM,OAAQT,IAC1BM,GAAQwM,EAAU9M,EAAG6M,GACvB,OAAOvM,EA9WTnB,EAAOD,QAAU+I,GAiXf,CAAC8E,oBAAoB,GAAGxJ,kBAAkB,EAAEgB,YAAY,EAAEkD,SAAS,GAAGuF,kBAAkB,GAAGC,6BAA6B,KAAKC,EAAE,CAAC,SAAShN,EAAQf,EAAOD,gBAG1J,IAAI4F,EAAM5E,EAAQ,UACd6H,EAAQ7H,EAAQ,mBAChBuE,EAAOvE,EAAQ,UACfiN,EAAejN,EAAQ,gBACvBkN,EAAWlN,EAAQ,wBAmBvB,SAASoD,EAAQ2E,EAASC,EAAM5F,GAE9B,IAAI+F,EAAS5I,KAAKsD,MAAMT,GACxB,GAAqB,iBAAV+F,EAAoB,CAC7B,IAAI5I,KAAKsD,MAAMsF,GACV,OAAO/E,EAAQ9C,KAAKf,KAAMwI,EAASC,EAAMG,GADtBA,EAAS5I,KAAKsD,MAAMsF,GAK9C,IADAA,EAASA,GAAU5I,KAAKuD,SAASV,cACX6K,EACpB,OAAO1B,EAAUpD,EAAO7G,OAAQ/B,KAAKkC,MAAM+J,YACjCrD,EAAO7G,OACP6G,EAAOnG,UAAYzC,KAAK2C,SAASiG,GAG7C,IACI7G,EAAQyB,EAAGQ,EADX4J,EAAMC,EAAc9M,KAAKf,KAAMyI,EAAM5F,GAgBzC,OAdI+K,IACF7L,EAAS6L,EAAI7L,OACb0G,EAAOmF,EAAInF,KACXzE,EAAS4J,EAAI5J,QAGXjC,aAAkB2L,EACpBlK,EAAIzB,EAAOU,UAAY+F,EAAQzH,KAAKf,KAAM+B,EAAOA,OAAQ0G,OAAMrG,EAAW4B,QACtD5B,IAAXL,IACTyB,EAAIwI,EAAUjK,EAAQ/B,KAAKkC,MAAM+J,YAC3BlK,EACAyG,EAAQzH,KAAKf,KAAM+B,EAAQ0G,OAAMrG,EAAW4B,IAG7CR,EAWT,SAASqK,EAAcpF,EAAM5F,GAE3B,IAAI/B,EAAIuE,EAAIyI,MAAMjL,GACdkL,EAAUC,EAAalN,GACvBkD,EAASiK,EAAYjO,KAAKkO,OAAOzF,EAAK1G,SAC1C,GAAwC,IAApCwC,OAAO4J,KAAK1F,EAAK1G,QAAQf,QAAgB+M,IAAY/J,EAAQ,CAC/D,IAAIoK,EAAKjK,EAAY4J,GACjBnF,EAAS5I,KAAKsD,MAAM8K,GACxB,GAAqB,iBAAVxF,EACT,OAuBN,SAA0BH,EAAM5F,EAAKwL,GAEnC,IAAIT,EAAMC,EAAc9M,KAAKf,KAAMyI,EAAM5F,GACzC,GAAI+K,EAAK,CACP,IAAI7L,EAAS6L,EAAI7L,OACbiC,EAAS4J,EAAI5J,OACjByE,EAAOmF,EAAInF,KACX,IAAI2F,EAAKpO,KAAKkO,OAAOnM,GAErB,OADIqM,IAAIpK,EAASsK,EAAWtK,EAAQoK,IAC7BG,EAAexN,KAAKf,KAAMqO,EAAWrK,EAAQjC,EAAQ0G,KAhClC1H,KAAKf,KAAMyI,EAAMG,EAAQ9H,GAC5C,GAAI8H,aAAkB8E,EACtB9E,EAAOnG,UAAUzC,KAAK2C,SAASiG,GACpCH,EAAOG,MACF,CAEL,MADAA,EAAS5I,KAAKuD,SAAS6K,cACDV,GAMpB,OAJA,GADK9E,EAAOnG,UAAUzC,KAAK2C,SAASiG,GAChCwF,GAAMjK,EAAYtB,GACpB,MAAO,CAAEd,OAAQ6G,EAAQH,KAAMA,EAAMzE,OAAQA,GAC/CyE,EAAOG,EAKX,IAAKH,EAAK1G,OAAQ,OAClBiC,EAASiK,EAAYjO,KAAKkO,OAAOzF,EAAK1G,SAExC,OAAOwM,EAAexN,KAAKf,KAAMc,EAAGkD,EAAQyE,EAAK1G,OAAQ0G,IAtF3D/I,EAAOD,QAAUoE,GAETM,YAAcA,EACtBN,EAAQO,SAAW6J,EACnBpK,EAAQK,IAAMoK,EACdzK,EAAQ2K,IA0NR,SAAoBzM,GAClB,IAAI0M,EAAWtK,EAAYnE,KAAKkO,OAAOnM,IACnC2M,EAAU,CAACC,GAAIF,GACfG,EAAY,CAACD,GAAIV,EAAYQ,GAAU,IACvC/F,EAAY,GACZ3I,EAAOC,KAgCX,OA9BA2N,EAAS5L,EAAQ,CAAC8M,SAAS,GAAO,SAASzL,EAAK0L,EAASC,EAAYC,EAAeC,EAAezC,EAAc0C,GAC/G,GAAgB,KAAZJ,EAAJ,CACA,IAAIV,EAAKrO,EAAKmO,OAAO9K,GACjBY,EAAS0K,EAAQM,GACjB5K,EAAWwK,EAAUI,GAAiB,IAAMC,EAIhD,QAHiB7M,IAAb8M,IACF9K,GAAY,KAA0B,iBAAZ8K,EAAuBA,EAAWlK,EAAKmK,eAAeD,KAEjE,iBAANd,EAAgB,CACzBA,EAAKpK,EAASG,EAAYH,EAASqB,EAAIxB,QAAQG,EAAQoK,GAAMA,GAE7D,IAAIxF,EAAS7I,EAAKuD,MAAM8K,GAExB,GADqB,iBAAVxF,IAAoBA,EAAS7I,EAAKuD,MAAMsF,IAC/CA,GAAUA,EAAO7G,QACnB,IAAKuG,EAAMlF,EAAKwF,EAAO7G,QACrB,MAAM,IAAInB,MAAM,OAASwN,EAAK,2CAC3B,GAAIA,GAAMjK,EAAYC,GAC3B,GAAa,KAATgK,EAAG,GAAW,CAChB,GAAI1F,EAAU0F,KAAQ9F,EAAMlF,EAAKsF,EAAU0F,IACzC,MAAM,IAAIxN,MAAM,OAASwN,EAAK,sCAChC1F,EAAU0F,GAAMhL,OAEhBrD,EAAKuD,MAAM8K,GAAMhK,EAIvBsK,EAAQI,GAAW9K,EACnB4K,EAAUE,GAAW1K,KAGhBsE,GA9PT7E,EAAQmI,UAAYA,EACpBnI,EAAQ9B,OAAS8L,EAkGjB,IAAIuB,EAAuBpK,EAAKqK,OAAO,CAAC,aAAc,oBAAqB,OAAQ,eAAgB,gBAEnG,SAASd,EAAeF,EAAWrK,EAAQjC,EAAQ0G,GAGjD,GADA4F,EAAUiB,SAAWjB,EAAUiB,UAAY,GACN,KAAjCjB,EAAUiB,SAASC,MAAM,EAAE,GAA/B,CAGA,IAFA,IAAIC,EAAQnB,EAAUiB,SAAS5H,MAAM,KAE5BnH,EAAI,EAAGA,EAAIiP,EAAMxO,OAAQT,IAAK,CACrC,IAUUoD,EACAiK,EAJNQ,EAPAqB,EAAOD,EAAMjP,GACjB,GAAIkP,EAAM,CAGR,QAAerN,KADfL,EAASA,EADT0N,EAAOzK,EAAK0K,iBAAiBD,KAEH,MAErBL,EAAqBK,MACxBrB,EAAKpO,KAAKkO,OAAOnM,MACTiC,EAASsK,EAAWtK,EAAQoK,IAChCrM,EAAO4B,OACLA,EAAO2K,EAAWtK,EAAQjC,EAAO4B,OACjCiK,EAAMC,EAAc9M,KAAKf,KAAMyI,EAAM9E,MAEvC5B,EAAS6L,EAAI7L,OACb0G,EAAOmF,EAAInF,KACXzE,EAAS4J,EAAI5J,WAMvB,YAAe5B,IAAXL,GAAwBA,IAAW0G,EAAK1G,OACnC,CAAEA,OAAQA,EAAQ0G,KAAMA,EAAMzE,OAAQA,QAD/C,GAKF,IAAI2L,EAAiB3K,EAAKqK,OAAO,CAC/B,OAAQ,SAAU,UAClB,YAAa,YACb,gBAAiB,gBACjB,WAAY,WACZ,UAAW,UACX,cAAe,aACf,WAAY,SAEd,SAASrD,EAAUjK,EAAQ6N,GACzB,OAAc,IAAVA,SACUxN,IAAVwN,IAAiC,IAAVA,EAK7B,SAASC,EAAW9N,GAClB,IAAI+N,EACJ,GAAIC,MAAMC,QAAQjO,IAChB,IAAK,IAAIxB,EAAE,EAAGA,EAAEwB,EAAOf,OAAQT,IAE7B,GAAmB,iBADnBuP,EAAO/N,EAAOxB,MACkBsP,EAAWC,GAAO,OAAO,OAG3D,IAAK,IAAIxO,KAAOS,EAAQ,CACtB,GAAW,QAAPT,EAAe,OAAO,EAE1B,GAAmB,iBADnBwO,EAAO/N,EAAOT,MACkBuO,EAAWC,GAAO,OAAO,EAG7D,OAAO,EAnB2CD,CAAW9N,GACpD6N,EAsBX,SAASK,EAAUlO,GACjB,IAAe+N,EAAXI,EAAQ,EACZ,GAAIH,MAAMC,QAAQjO,IAChB,IAAK,IAAIxB,EAAE,EAAGA,EAAEwB,EAAOf,OAAQT,IAG7B,GADmB,iBADnBuP,EAAO/N,EAAOxB,MACe2P,GAASD,EAAUH,IAC5CI,GAASC,EAAAA,EAAU,OAAOA,EAAAA,OAGhC,IAAK,IAAI7O,KAAOS,EAAQ,CACtB,GAAW,QAAPT,EAAe,OAAO6O,EAAAA,EAC1B,GAAIR,EAAerO,GACjB4O,SAIA,GADmB,iBADnBJ,EAAO/N,EAAOT,MACe4O,GAASD,EAAUH,GAAQ,GACpDI,GAASC,EAAAA,EAAU,OAAOA,EAAAA,EAIpC,OAAOD,EA1CgBD,CAAUlO,IAAW6N,OAAvC,GA8CP,SAAS3B,EAAYG,EAAIgC,GAGvB,OAFkB,IAAdA,IAAqBhC,EAAKjK,EAAYiK,IAEnCJ,EADC3I,EAAIyI,MAAMM,IAKpB,SAASJ,EAAalN,GACpB,OAAOuE,EAAIgL,UAAUvP,GAAG4G,MAAM,KAAK,GAAK,IAI1C,IAAI4I,EAAsB,QAC1B,SAASnM,EAAYiK,GACnB,OAAOA,EAAKA,EAAGmC,QAAQD,EAAqB,IAAM,GAIpD,SAAShC,EAAWtK,EAAQoK,GAE1B,OADAA,EAAKjK,EAAYiK,GACV/I,EAAIxB,QAAQG,EAAQoK,KA6C3B,CAACoC,eAAe,EAAExI,SAAS,GAAGuF,kBAAkB,GAAGkD,uBAAuB,GAAGC,SAAS,KAAKC,EAAE,CAAC,SAASlQ,EAAQf,EAAOD,gBAGxH,IAAImR,EAAcnQ,EAAQ,YACtB4O,EAAS5O,EAAQ,UAAU4O,OAE/B3P,EAAOD,QAAU,WACf,IAAIiK,EAAQ,CACV,CAAEmH,KAAM,SACNC,MAAO,CAAE,CAAEC,QAAW,CAAC,qBACd,CAAEC,QAAW,CAAC,qBAAuB,aAAc,WAC9D,CAAEH,KAAM,SACNC,MAAO,CAAE,YAAa,YAAa,UAAW,WAChD,CAAED,KAAM,QACNC,MAAO,CAAE,WAAY,WAAY,QAAS,WAAY,gBACxD,CAAED,KAAM,SACNC,MAAO,CAAE,gBAAiB,gBAAiB,WAAY,eAAgB,gBAC9D,CAAEG,WAAc,CAAC,uBAAwB,wBACpD,CAAEH,MAAO,CAAE,OAAQ,QAAS,OAAQ,MAAO,QAAS,QAAS,QAAS,QAGpEI,EAAM,CAAE,OAAQ,YA4CpB,OAnCAxH,EAAMyH,IAAM9B,EAAO6B,GACnBxH,EAAM0H,MAAQ/B,EAFF,CAAE,SAAU,UAAW,SAAU,QAAS,SAAU,UAAW,SAI3E3F,EAAM2H,QAAQ,SAAUC,GACtBA,EAAMR,MAAQQ,EAAMR,MAAMS,IAAI,SAAUxE,GACtC,IAEMzL,EACJkQ,EAaF,MAfsB,iBAAXzE,IAETyE,EAAezE,EADXzL,EAAMiD,OAAO4J,KAAKpB,GAAS,IAE/BA,EAAUzL,EACVkQ,EAAaH,QAAQ,SAAUI,GAC7BP,EAAIQ,KAAKD,GACT/H,EAAMyH,IAAIM,IAAK,KAGnBP,EAAIQ,KAAK3E,GACErD,EAAMyH,IAAIpE,GAAW,CAC9BA,QAASA,EACTlM,KAAM+P,EAAY7D,GAClB4E,WAAYH,KAKhB9H,EAAMyH,IAAIS,SAAW,CACnB7E,QAAS,WACTlM,KAAM+P,EAAYgB,UAGhBN,EAAMT,OAAMnH,EAAM0H,MAAME,EAAMT,MAAQS,KAG5C5H,EAAMmI,SAAWxC,EAAO6B,EAAIY,OAxCb,CACb,UAAW,MAAO,KAAM,QAAS,SAAU,QAC3C,cAAe,UAAW,cAC1B,WAAY,WAAY,YACxB,mBAAoB,kBACpB,kBAAmB,OAAQ,UAoC7BpI,EAAMqI,OAAS,GAERrI,IAGP,CAACsI,WAAW,GAAGhK,SAAS,KAAKiK,EAAE,CAAC,SAASxR,EAAQf,EAAOD,gBAG1D,IAAIuF,EAAOvE,EAAQ,UAEnBf,EAAOD,QAEP,SAAsByS,GACpBlN,EAAKc,KAAKoM,EAAKlS,QAGf,CAACgI,SAAS,KAAKmK,EAAE,CAAC,SAAS1R,EAAQf,EAAOD,gBAK5CC,EAAOD,QAAU,SAAoBuG,GAKnC,IAJA,IAGIzE,EAHAP,EAAS,EACToR,EAAMpM,EAAIhF,OACVqR,EAAM,EAEHA,EAAMD,GACXpR,IAEa,QADbO,EAAQyE,EAAIsM,WAAWD,OACA9Q,GAAS,OAAU8Q,EAAMD,GAGtB,QAAX,OADb7Q,EAAQyE,EAAIsM,WAAWD,MACSA,IAGpC,OAAOrR,IAGP,IAAIuR,GAAG,CAAC,SAAS9R,EAAQf,EAAOD,gBAqClC,SAAS+S,EAAcC,EAAUC,EAAMC,EAAeC,GACpD,IAAIC,EAAQD,EAAS,QAAU,QAC3BE,EAAMF,EAAS,OAAS,OACxBG,EAAKH,EAAS,IAAM,GACpBI,EAAMJ,EAAS,GAAK,IACxB,OAAQH,GACN,IAAK,OAAQ,OAAOC,EAAOG,EAAQ,OACnC,IAAK,QAAS,OAAOE,EAAK,iBAAmBL,EAAO,IACpD,IAAK,SAAU,MAAO,IAAMK,EAAKL,EAAOI,EAClB,UAAYJ,EAAOG,EAAQ,WAAaC,EACxCE,EAAM,iBAAmBN,EAAO,KACtD,IAAK,UAAW,MAAO,WAAaA,EAAOG,EAAQ,WAAaC,EACzCE,EAAM,IAAMN,EAAO,QACnBI,EAAMJ,EAAOG,EAAQH,GACpBC,EAAiBG,EAAMC,EAAK,YAAcL,EAAO,IAAO,IAAM,IACtF,IAAK,SAAU,MAAO,WAAaA,EAAOG,EAAQ,IAAMJ,EAAW,KAC5CE,EAAiBG,EAAMC,EAAK,YAAcL,EAAO,IAAO,IAAM,IACrF,QAAS,MAAO,UAAYA,EAAOG,EAAQ,IAAMJ,EAAW,KAlDhE/S,EAAOD,QAAU,CACfqG,KAyBF,SAAcxF,EAAG2S,GAEf,IAAK,IAAI3R,KADT2R,EAAKA,GAAM,GACK3S,EAAG2S,EAAG3R,GAAOhB,EAAEgB,GAC/B,OAAO2R,GA3BPT,cAAeA,EACfU,eAoDF,SAAwBC,EAAWT,EAAMC,GACvC,CAAA,GACO,IADCQ,EAAUnS,OACR,OAAOwR,EAAcW,EAAU,GAAIT,EAAMC,GAAe,GAE9D,IAUStS,EAVLQ,EAAO,GACPuQ,EAAQ/B,EAAO8D,GASnB,IAAS9S,KARL+Q,EAAMgC,OAAShC,EAAMiC,SACvBxS,EAAOuQ,EAAMkC,KAAO,IAAK,KAAOZ,EAAO,OACvC7R,GAAQ,UAAY6R,EAAO,wBACpBtB,EAAMkC,YACNlC,EAAMgC,aACNhC,EAAMiC,QAEXjC,EAAMmC,eAAenC,EAAMoC,QACjBpC,EACZvQ,IAASA,EAAO,OAAS,IAAO2R,EAAcnS,EAAGqS,EAAMC,GAAe,GAExE,OAAO9R,IApEX4S,cA0EF,SAAuBC,EAAmBP,GACxC,GAAIpD,MAAMC,QAAQmD,GAAY,CAE5B,IADA,IAAI/B,EAAQ,GACH7Q,EAAE,EAAGA,EAAE4S,EAAUnS,OAAQT,IAAK,CACrC,IAAIF,EAAI8S,EAAU5S,IACdoT,EAAgBtT,IACW,UAAtBqT,GAAuC,UAANrT,KADlB+Q,EAAMA,EAAMpQ,QAAUX,GAGhD,GAAI+Q,EAAMpQ,OAAQ,OAAOoQ,MACpB,CAAA,GAAIuC,EAAgBR,GACzB,MAAO,CAACA,GACH,GAA0B,UAAtBO,GAA+C,UAAdP,EAC1C,MAAO,CAAC,WArFV9D,OAAQA,EACRuE,YAAaA,EACbC,aAAcA,EACdvL,MAAO7H,EAAQ,mBACf4H,WAAY5H,EAAQ,gBACpBqT,cAgHF,SAAuB9N,EAAK+N,GAC1BA,GAAW,SACX,IAAI9N,EAAUD,EAAIE,MAAM,IAAI6B,OAAOgM,EAAS,MAC5C,OAAO9N,EAAUA,EAAQjF,OAAS,GAlHlCgT,WAsHF,SAAoBhO,EAAK+N,EAASE,GAGhC,OAFAF,GAAW,WACXE,EAAOA,EAAK1D,QAAQ,MAAO,QACpBvK,EAAIuK,QAAQ,IAAIxI,OAAOgM,EAAS,KAAME,EAAO,OAxHpDC,eA4HF,SAAwBnS,EAAQ+O,GAC9B,GAAqB,kBAAV/O,EAAqB,OAAQA,EACxC,IAAK,IAAIT,KAAOS,EAAQ,GAAI+O,EAAMxP,GAAM,OAAO,GA7H/C6S,qBAiIF,SAA8BpS,EAAQ+O,EAAOsD,GAC3C,GAAqB,kBAAVrS,EAAqB,OAAQA,GAA2B,OAAjBqS,EAClD,IAAK,IAAI9S,KAAOS,EAAQ,GAAIT,GAAO8S,GAAiBtD,EAAMxP,GAAM,OAAO,GAlIvE+S,mBAsIF,SAA4BtS,EAAQ+O,GAClC,GAAqB,kBAAV/O,EAAqB,OAChC,IAAK,IAAIT,KAAOS,EAAQ,IAAK+O,EAAMxP,GAAM,OAAOA,GAvIhD+K,eAAgBA,EAChBiI,YA+IF,SAAqBC,EAAaN,EAAMO,EAAcC,GAIpD,OAAOC,EAAUH,EAHNC,EACG,SAAaP,GAAQQ,EAAW,GAAK,8CACpCA,EAAW,SAAaR,EAAO,SAAa,YAAiBA,EAAO,cAjJnFU,QAsJF,SAAiBJ,EAAaK,EAAMJ,GAClC,IAAIK,EACUxI,EADHmI,EACkB,IAAMM,EAAkBF,GACxBhB,EAAYgB,IACzC,OAAOF,EAAUH,EAAaM,IAzJ9BE,QA+JF,SAAiBC,EAAOC,EAAKC,GAC3B,IAAIC,EAAIC,EAAa1C,EAAMzM,EAC3B,GAAc,KAAV+O,EAAc,MAAO,WACzB,GAAgB,KAAZA,EAAM,GAAW,CACnB,IAAKvP,EAAaoC,KAAKmN,GAAQ,MAAM,IAAIpU,MAAM,yBAA2BoU,GAC1EI,EAAcJ,EACdtC,EAAO,eACF,CAEL,KADAzM,EAAU+O,EAAM9O,MAAMP,IACR,MAAM,IAAI/E,MAAM,yBAA2BoU,GAGzD,GAFAG,GAAMlP,EAAQ,GAEK,MADnBmP,EAAcnP,EAAQ,IACE,CACtB,GAAUgP,GAANE,EAAW,MAAM,IAAIvU,MAAM,gCAAkCuU,EAAK,gCAAkCF,GACxG,OAAOC,EAAMD,EAAME,GAGrB,GAASF,EAALE,EAAU,MAAM,IAAIvU,MAAM,sBAAwBuU,EAAK,gCAAkCF,GAE7F,GADAvC,EAAO,QAAWuC,EAAME,GAAO,KAC1BC,EAAa,OAAO1C,EAK3B,IAFA,IAAIuB,EAAOvB,EACP2C,EAAWD,EAAY1N,MAAM,KACxBnH,EAAE,EAAGA,EAAE8U,EAASrU,OAAQT,IAAK,CACpC,IAAI+U,EAAUD,EAAS9U,GACnB+U,IACF5C,GAAQkB,EAAY2B,EAAoBD,IACxCrB,GAAQ,OAASvB,GAGrB,OAAOuB,GA7LPvE,iBAuMF,SAA0B1J,GACxB,OAAOuP,EAAoBC,mBAAmBxP,KAvM9CuP,oBAAqBA,EACrBpG,eA0MF,SAAwBnJ,GACtB,OAAOyP,mBAAmBX,EAAkB9O,KA1M5C8O,kBAAmBA,GAuDrB,IAAInB,EAAkBtE,EAAO,CAAE,SAAU,SAAU,UAAW,UAAW,SAkBzE,SAASA,EAAOjC,GAEd,IADA,IAAIsI,EAAO,GACFnV,EAAE,EAAGA,EAAE6M,EAAIpM,OAAQT,IAAKmV,EAAKtI,EAAI7M,KAAM,EAChD,OAAOmV,EAIT,IAAIC,EAAa,wBACbC,EAAe,QACnB,SAAShC,EAAYtS,GACnB,MAAqB,iBAAPA,EACJ,IAAMA,EAAM,IACZqU,EAAW9N,KAAKvG,GACd,IAAMA,EACN,KAAOuS,EAAavS,GAAO,KAIzC,SAASuS,EAAa7N,GACpB,OAAOA,EAAIuK,QAAQqF,EAAc,QACtBrF,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OAoC5B,SAASlE,EAAerG,GACtB,MAAO,IAAO6N,EAAa7N,GAAO,IAoBpC,IAAIP,EAAe,sBACfE,EAAwB,mCAoC5B,SAAS+O,EAAW/T,EAAGkV,GACrB,MAAS,MAALlV,EAAkBkV,GACdlV,EAAI,MAAQkV,GAAGtF,QAAQ,iBAAkB,MAcnD,SAASuE,EAAkB9O,GACzB,OAAOA,EAAIuK,QAAQ,KAAM,MAAMA,QAAQ,MAAO,MAIhD,SAASgF,EAAoBvP,GAC3B,OAAOA,EAAIuK,QAAQ,MAAO,KAAKA,QAAQ,MAAO,OAG9C,CAACuF,eAAe,EAAEvI,kBAAkB,KAAKwI,GAAG,CAAC,SAAStV,EAAQf,EAAOD,gBAGvE,IAAIuW,EAAW,CACb,aACA,UACA,mBACA,UACA,mBACA,YACA,YACA,UACA,kBACA,WACA,WACA,cACA,gBACA,gBACA,WACA,uBACA,OACA,SACA,SAGFtW,EAAOD,QAAU,SAAUwW,EAAYC,GACrC,IAAK,IAAI3V,EAAE,EAAGA,EAAE2V,EAAqBlV,OAAQT,IAAK,CAChD0V,EAAaE,KAAKrI,MAAMqI,KAAKC,UAAUH,IAIvC,IAHA,IAAIZ,EAAWa,EAAqB3V,GAAGmH,MAAM,KACzCmK,EAAWoE,EAEVI,EAAE,EAAGA,EAAEhB,EAASrU,OAAQqV,IAC3BxE,EAAWA,EAASwD,EAASgB,IAE/B,IAAKA,EAAE,EAAGA,EAAEL,EAAShV,OAAQqV,IAAK,CAChC,IAAI/U,EAAM0U,EAASK,GACftU,EAAS8P,EAASvQ,GAClBS,IACF8P,EAASvQ,GAAO,CACdgV,MAAO,CACLvU,EACA,CAAE4B,KAAM,sFAOlB,OAAOsS,IAGP,IAAIM,GAAG,CAAC,SAAS9V,EAAQf,EAAOD,gBAGlC,IAAIwW,EAAaxV,EAAQ,oCAEzBf,EAAOD,QAAU,CACf+W,IAAK,4EACLC,YAAa,CACXC,YAAaT,EAAWQ,YAAYC,aAEtC7F,KAAM,SACNhE,aAAc,CACZ9K,OAAQ,CAAC,YACTiT,MAAO,CAAC,YACR2B,WAAY,CAAC,UACbC,MAAO,CAACC,IAAK,CAACC,SAAU,CAAC,YAE3B7F,WAAY,CACVJ,KAAMoF,EAAWhF,WAAWJ,KAC5B9O,OAAQ,CAAC8O,KAAM,WACf8F,WAAY,CAAC9F,KAAM,WACnBhE,aAAc,CACZgE,KAAM,QACNkG,MAAO,CAAClG,KAAM,WAEhBoF,WAAY,CAACpF,KAAM,UACnBmG,UAAW,CAACnG,KAAM,WAClB+F,MAAO,CAAC/F,KAAM,WACdmE,MAAO,CAACnE,KAAM,WACdoG,MAAO,CAACpG,KAAM,WACdlM,OAAQ,CACN2R,MAAO,CACL,CAACzF,KAAM,WACP,CAACqG,MAAO,aAMd,CAACC,mCAAmC,KAAKC,GAAG,CAAC,SAAS3W,EAAQf,EAAOD,gBAEvEC,EAAOD,QAAU,SAAyBgN,EAAI4K,GAC5C,IA+BMC,EACFC,EACAC,EA+CEC,EACFC,EA2BIC,EASJC,EArHAC,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UAEzBrD,EAAQ,QAAUgD,GAAY,IAC9BM,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEbgV,EAAqB,WAAZpB,EACXqB,EAAoBD,EAAS,mBAAqB,mBAClDE,EAAclM,EAAG1K,OAAO2W,GACxBE,EAAcnM,EAAG9D,KAAKqM,OAAS2D,GAAeA,EAAY3D,MAC1D6D,EAAMJ,EAAS,IAAM,IACrBK,EAASL,EAAS,IAAM,IACxBM,OAAgB3W,EAClB,IAAMkW,GAA6B,iBAAX7U,QAAmCrB,IAAZqB,EAC7C,MAAM,IAAI7C,MAAMyW,EAAW,mBAE7B,IAAMuB,QAA+BxW,IAAhBuW,GAAmD,iBAAfA,GAAiD,kBAAfA,EACzF,MAAM,IAAI/X,MAAM8X,EAAoB,8BAElCE,GAIAnB,EAAgB,eAAiBK,EAEjCJ,EAAS,QADTC,EAAU,KAAOG,GACY,OAC/BD,GAAO,kBAAoB,EAAS,OANhCP,EAAmB7K,EAAGzH,KAAK+P,QAAQ4D,EAAY3D,MAAOgD,EAAUvL,EAAG+L,cAMN,KAG7DO,EAAgBL,GAChBd,EAAaA,GAAc,IACpBlG,KAHXmG,GAAO,SAPLN,EAAa,YAAcO,GAOG,UAN9BN,EAAY,WAAaM,GAM8B,cADzDR,EAAmB,aAAeQ,GAC2D,SAAW,EAAc,oBAAwB,EAAc,sBAA0B,EAAc,oBAIpMD,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,iBAAoBkB,GAAiB,mBAAqB,oCAA0CtM,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kBACjK,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAAmB,EAAsB,wBAE9CpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,gBACHS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAEhFA,GAAO,IAAM,EAAc,qBAAyB,EAAe,MAAQ,EAAiB,qBAAuB,EAAqB,IAAM,EAAQ,KAAO,EAAiB,OAAS,EAAU,IAAM,EAAW,KAAO,EAAqB,MAAQ,EAAU,IAAM,EAAW,IAAM,EAAiB,WAAa,EAAe,MAAQ,EAAqB,gBAAkB,EAAU,IAAM,EAAW,KAAO,EAAiB,MAAQ,EAAU,IAAM,EAAW,IAAM,EAAiB,SAAW,EAAU,QAAU,EAAU,aAAe,EAAS,MAAQ,EAAe,OAAU,EAAQ,QAAY,EAAQ,YAC9kBzV,IAAZqB,IAEF0U,EAAiB1L,EAAGhC,cAAgB,KADpCsO,EAAgBL,GAEhBH,EAAejB,EACfgB,EAAUM,KAIVlB,EAASmB,GADPpB,EAAsC,iBAAfkB,IAENL,GACfX,EAAU,IAAOD,EAAS,IAC9BG,GAAO,SACHS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAEhFA,GAAO,MAAQ,EAAiB,qBAAuB,EAAgB,IAAM,EAAQ,KAAO,EAAiB,MAAQ,EAAU,IAAM,EAAW,KAAO,EAAgB,MAAQ,EAAU,IAAM,EAAW,IAAM,EAAiB,SAAW,EAAU,QAAU,EAAU,SAEtQJ,QAA6BrV,IAAZqB,GACnB8T,GAAa,EAEbY,EAAiB1L,EAAGhC,cAAgB,KADpCsO,EAAgBL,GAEhBH,EAAeI,EACfG,GAAU,MAENrB,IAAec,EAAee,KAAKb,EAAS,MAAQ,OAAOE,EAAalV,IACxEkV,MAAiBlB,GAAgBc,IACnChB,GAAa,EAEbY,EAAiB1L,EAAGhC,cAAgB,KADpCsO,EAAgBL,GAEhBI,GAAU,MAEVvB,GAAa,EACbG,GAAU,MAGVC,EAAU,IAAOD,EAAS,IAC9BG,GAAO,SACHS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAEhFA,GAAO,IAAM,EAAU,IAAM,EAAW,IAAM,EAAiB,OAAS,EAAU,QAAU,EAAU,SAG1GkB,EAAgBA,GAAiB1B,GAC7BO,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,iBAAoBkB,GAAiB,UAAY,oCAA0CtM,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,4BAA8B,EAAY,YAAc,EAAiB,gBAAkB,EAAe,OAClQ,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,0BAA6B,EAAW,IAE7CA,GADES,EACK,OAAU,EAEL,EAAiB,KAG7B7L,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAK,EAEdT,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EAgBZ,OAfAA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,MACHO,IACFP,GAAO,YAEFA,IAGP,IAAI0B,GAAG,CAAC,SAAS9Y,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA8BgN,EAAI4K,GACjD,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UAEzBrD,EAAQ,QAAUgD,GAAY,IAC9BM,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEjB,IAAM6U,GAA6B,iBAAX7U,EACtB,MAAM,IAAI7C,MAAMyW,EAAW,mBAG7BQ,GAAO,QACHS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAGhF,IAAIkB,EAAgB1B,EAChBO,EAAaA,GAAc,GAC/BA,EAAWlG,KAHXmG,GAAO,IAAM,EAAU,YALD,YAAZR,EAAyB,IAAM,KAKG,IAAM,EAAiB,QAInEQ,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,iBAAoBkB,GAAiB,eAAiB,oCAA0CtM,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,uBAAyB,EAAiB,OACvM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gCAELA,GADc,YAAZR,EACK,OAEA,QAETQ,GAAO,SAELA,GADES,EACK,OAAU,EAAiB,OAE3B,GAAK,EAEdT,GAAO,YAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAK,EAEdT,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,KACHO,IACFP,GAAO,YAEFA,IAGP,IAAI2B,GAAG,CAAC,SAAS/Y,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA+BgN,EAAI4K,GAClD,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UAEzBrD,EAAQ,QAAUgD,GAAY,IAC9BM,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEjB,IAAM6U,GAA6B,iBAAX7U,EACtB,MAAM,IAAI7C,MAAMyW,EAAW,mBAG7BQ,GAAO,QACHS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAG9EA,IADsB,IAApBpL,EAAG9D,KAAK8Q,QACH,IAAM,EAAU,WAEhB,eAAiB,EAAU,KAGpC,IAAIV,EAAgB1B,EAChBO,EAAaA,GAAc,GAC/BA,EAAWlG,KAHXmG,GAAO,KAVe,aAAZR,EAA0B,IAAM,KAUrB,IAAM,EAAiB,QAI5CQ,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,iBAAoBkB,GAAiB,gBAAkB,oCAA0CtM,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,uBAAyB,EAAiB,OACxM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,8BAELA,GADc,aAAZR,EACK,SAEA,UAETQ,GAAO,SAELA,GADES,EACK,OAAU,EAAiB,OAE3B,GAAK,EAEdT,GAAO,iBAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAK,EAEdT,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,KACHO,IACFP,GAAO,YAEFA,IAGP,IAAI6B,GAAG,CAAC,SAASjZ,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAmCgN,EAAI4K,GACtD,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UAEzBrD,EAAQ,QAAUgD,GAAY,IAC9BM,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEjB,IAAM6U,GAA6B,iBAAX7U,EACtB,MAAM,IAAI7C,MAAMyW,EAAW,mBAG7BQ,GAAO,QACHS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAGhF,IAAIkB,EAAgB1B,EAChBO,EAAaA,GAAc,GAC/BA,EAAWlG,KAHXmG,GAAO,gBAAkB,EAAU,aALb,iBAAZR,EAA8B,IAAM,KAKW,IAAM,EAAiB,QAIhFQ,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,iBAAoBkB,GAAiB,oBAAsB,oCAA0CtM,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,uBAAyB,EAAiB,OAC5M,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gCAELA,GADc,iBAAZR,EACK,OAEA,QAETQ,GAAO,SAELA,GADES,EACK,OAAU,EAAiB,OAE3B,GAAK,EAEdT,GAAO,iBAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAK,EAEdT,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,KACHO,IACFP,GAAO,YAEFA,IAGP,IAAI8B,GAAG,CAAC,SAASlZ,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAwBgN,EAAI4K,GAC3C,IAAIQ,EAAM,IACNpU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBuB,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACnBoN,EAAiB,GACrBD,EAAI7B,QACJ,IAAI+B,EAAa,QAAUF,EAAI7B,MAC3BgC,EAAiBH,EAAI5V,OACvBgW,GAAmB,EACjBC,EAAOxW,EACX,GAAIwW,EAGF,IAFA,IAAIC,EAAMC,GAAM,EACdC,EAAKH,EAAKjZ,OAAS,EACdmZ,EAAKC,GACVF,EAAOD,EAAKE,GAAM,IACb1N,EAAG9D,KAAK0R,eAAiC,iBAARH,GAA+C,EAA3B3V,OAAO4J,KAAK+L,GAAMlZ,SAAwB,IAATkZ,EAAiBzN,EAAGzH,KAAKkP,eAAegG,EAAMzN,EAAG/C,MAAMyH,QAChJ6I,GAAmB,EACnBJ,EAAI7X,OAASmY,EACbN,EAAIpP,WAAa0N,EAAc,IAAMiC,EAAK,IAC1CP,EAAInP,cAAgB0N,EAAiB,IAAMgC,EAC3CtC,GAAO,KAAQpL,EAAGhK,SAASmX,GAAQ,IACnCA,EAAI5V,OAAS+V,EACT3B,IACFP,GAAO,QAAU,EAAe,OAChCgC,GAAkB,MAY1B,OAPIzB,IAEAP,GADEmC,EACK,gBAEA,IAAOH,EAAetK,MAAM,GAAI,GAAM,KAG1CsI,IAGP,IAAIyC,GAAG,CAAC,SAAS7Z,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAwBgN,EAAI4K,GAC3C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnB0C,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACnBoN,EAAiB,GACrBD,EAAI7B,QACJ,IAAI+B,EAAa,QAAUF,EAAI7B,MAI/B,GAHqBtU,EAAQqJ,MAAM,SAASoN,GAC1C,OAAQzN,EAAG9D,KAAK0R,eAAiC,iBAARH,GAA+C,EAA3B3V,OAAO4J,KAAK+L,GAAMlZ,SAAwB,IAATkZ,EAAiBzN,EAAGzH,KAAKkP,eAAegG,EAAMzN,EAAG/C,MAAMyH,OAEnI,CAClB,IAAI4I,EAAiBH,EAAI5V,OACzB6T,GAAO,QAAU,EAAU,kBAAoB,EAAW,cAC1D,IAAI4C,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACvC,IAAIY,EAAOxW,EACX,GAAIwW,EAGF,IAFA,IAAIC,EAAMC,GAAM,EACdC,EAAKH,EAAKjZ,OAAS,EACdmZ,EAAKC,GACVF,EAAOD,EAAKE,GAAM,GAClBP,EAAI7X,OAASmY,EACbN,EAAIpP,WAAa0N,EAAc,IAAMiC,EAAK,IAC1CP,EAAInP,cAAgB0N,EAAiB,IAAMgC,EAC3CtC,GAAO,KAAQpL,EAAGhK,SAASmX,GAAQ,IACnCA,EAAI5V,OAAS+V,EACblC,GAAO,IAAM,EAAW,MAAQ,EAAW,OAAS,EAAe,UAAY,EAAW,OAC1FgC,GAAkB,IAGtBpN,EAAG4M,cAAgBO,EAAIP,cAAgBoB,EACvC5C,GAAO,IAAM,EAAmB,SAAW,EAAW,sBAC9B,IAApBpL,EAAGuM,cACLnB,GAAO,sDAAyEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kBACtI,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,oDAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,gFACFpL,EAAG4M,eAAiBjB,IAGrBP,GADEpL,EAAGwK,MACE,wCAEA,8CAGXY,GAAO,uBAAyB,EAAU,iCAAmC,EAAU,sBAAwB,EAAU,4BACrHpL,EAAG9D,KAAK0P,YACVR,GAAO,YAGLO,IACFP,GAAO,iBAGX,OAAOA,IAGP,IAAI6C,GAAG,CAAC,SAASja,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA0BgN,EAAI4K,GAC7C,IAAIQ,EAAM,IAENM,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAE1CzF,EAAWnF,EAAGzH,KAAKqH,eAHTI,EAAG1K,OAAOsV,IASxB,OALyB,IAArB5K,EAAG9D,KAAKiJ,SACViG,GAAO,gBAAkB,EAAa,KACF,mBAApBpL,EAAG9D,KAAKiJ,WACxBiG,GAAO,wBAA0B,EAAa,KAAQpL,EAAGzH,KAAKqH,eAAe8L,GAAmB,4BAE3FN,IAGP,IAAI8C,GAAG,CAAC,SAASla,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAwBgN,EAAI4K,GAC3C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnBQ,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAE9CsD,IACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,MAKlGF,IACHT,GAAO,cAAgB,EAAS,qBAAuB,EAAgB,KAGzE,IAAID,EAAaA,GAAc,GAC/BA,EAAWlG,KAFXmG,GAAO,OAAS,EAAW,YAAc,EAAU,WAAa,EAAS,WAAa,EAAW,UAGjGA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,sDAAyEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,oCAAsC,EAAS,OACrL,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,8CAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,KACHO,IACFP,GAAO,YAEFA,IAGP,IAAI+C,GAAG,CAAC,SAASna,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA2BgN,EAAI4K,GAC9C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnB0C,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GAEvBmN,EAAI7B,QACJ,IAQM0C,EAOAI,EAEAC,EAjBFhB,EAAa,QAAUF,EAAI7B,MAC3BgD,EAAO,IAAMjD,EACfkD,EAAWpB,EAAI3B,UAAYxL,EAAGwL,UAAY,EAC1CgD,EAAY,OAASD,EACrBjB,EAAiBtN,EAAGzI,OACpBkX,EAAmBzO,EAAG9D,KAAK0R,eAAoC,iBAAX5W,GAAqD,EAA9Bc,OAAO4J,KAAK1K,GAASzC,SAA2B,IAAZyC,EAAoBgJ,EAAGzH,KAAKkP,eAAezQ,EAASgJ,EAAG/C,MAAMyH,KAC9K0G,GAAO,OAAS,EAAU,iBAAmB,EAAW,IACpDqD,GACET,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACvCO,EAAI7X,OAAS0B,EACbmW,EAAIpP,WAAa0N,EACjB0B,EAAInP,cAAgB0N,EACpBN,GAAO,QAAU,EAAe,sBAAwB,EAAS,SAAW,EAAS,MAAQ,EAAU,YAAc,EAAS,SAC9H+B,EAAIlP,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWqQ,EAAMtO,EAAG9D,KAAK6L,cAAc,GAC1EqG,EAAY7F,EAAQ,IAAM+F,EAAO,IACrCnB,EAAIpB,YAAYwC,GAAYD,EACxBD,EAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,EAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,EAAOG,EAAWJ,GAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,EAAc,KAAO,EAAU,IAExEA,GAAO,QAAU,EAAe,eAChCpL,EAAG4M,cAAgBO,EAAIP,cAAgBoB,EACvC5C,GAAO,UAAoC,EAAe,OAE1DA,GAAO,QAAU,EAAU,kBAE7B,IAAID,EAAaA,GAAc,GAC/BA,EAAWlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,yDAA4EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kBACzI,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,8CAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAkBjB,OAdIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,aACHqD,IACFrD,GAAO,cAAgB,EAAU,iCAAmC,EAAU,sBAAwB,EAAU,6BAE9GpL,EAAG9D,KAAK0P,YACVR,GAAO,OAEFA,IAGP,IAAIsD,GAAG,CAAC,SAAS1a,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAyBgN,EAAI4K,GAC5C,IAOI0B,EAgBAqC,EAAUC,EAASC,EAAQC,EAAeC,EAvB1C3D,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UAEzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnB0C,EAAQ,SAAW1C,EACnBQ,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEbgY,EAAQzb,KACV0b,EAAc,aAAe5D,EAC7B6D,EAAQF,EAAM7O,WACdiN,EAAiB,GAEnB,GAAIvB,GAAWqD,EAAM3G,MAAO,CAE1B,IAAI4G,EAAkBD,EAAMjP,eAC5BmL,GAAO,QAAU,EAAgB,oBAAuB,EAAa,uBAFrE2D,EAAgB,kBAAoB1D,GAE4E,MAAQ,EAAgB,iBACnI,CAEL,KADAyD,EAAgB9O,EAAG3B,cAAc2Q,EAAOhY,EAASgJ,EAAG1K,OAAQ0K,IACxC,OACpB8L,EAAe,kBAAoBL,EACnCsD,EAAgBD,EAAc1a,KAC9Bua,EAAWO,EAAMnT,QACjB6S,EAAUM,EAAMxP,OAChBmP,EAASK,EAAMxO,MAEjB,IAwBMyM,EAGAE,EAGAW,EAEAK,EAsBAe,EACFC,EAEEC,EA0CAnE,EAeAuB,EAYA6C,EA9HFC,EAAYT,EAAgB,UAC9BrB,EAAK,IAAMrC,EACXoE,EAAW,UAAYpE,EACvBqE,EAAgBR,EAAM1E,MACxB,GAAIkF,IAAkB1P,EAAGwK,MAAO,MAAM,IAAIrW,MAAM,gCAuLhD,OAtLMya,GAAWC,IACfzD,GAAY,EAAc,YAE5BA,GAAO,OAAS,EAAU,iBAAmB,EAAW,IACpDS,GAAWqD,EAAM3G,QACnB6E,GAAkB,IAClBhC,GAAO,QAAU,EAAiB,qBAAuB,EAAW,qBAChE+D,IACF/B,GAAkB,IAClBhC,GAAO,IAAM,EAAW,MAAQ,EAAgB,mBAAqB,EAAiB,UAAY,EAAW,SAG7GwD,EAEAxD,GADE8D,EAAMhF,WACD,IAAO4E,EAAsB,SAAI,IAEjC,IAAM,EAAW,MAASA,EAAsB,SAAI,KAEpDD,GAELzB,EAAiB,IADjBD,EAAMnN,EAAGzH,KAAKc,KAAK2G,IAEnBsL,QACA+B,EAAa,QAAUF,EAAI7B,MAC/B6B,EAAI7X,OAASwZ,EAAc9Y,SAC3BmX,EAAIpP,WAAa,GACbiQ,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACnCyB,EAAQrO,EAAGhK,SAASmX,GAAKrJ,QAAQ,oBAAqBiL,GAC1D/O,EAAG4M,cAAgBO,EAAIP,cAAgBoB,EACvC5C,GAAO,IAAM,KAETD,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,GACNA,GAAO,KAAO,EAAkB,UAE9BA,GADEpL,EAAG9D,KAAKyT,YACH,OAEA,OAGPvE,GADEuD,IAA6B,IAAjBO,EAAM5Z,OACb,MAAQ,EAAU,IAElB,MAAQ,EAAiB,MAAQ,EAAU,qBAAwB0K,EAAa,WAAI,IAE7FoL,GAAO,sBACa,MAAhBpL,EAAG/B,YACLmN,GAAO,MAASpL,EAAY,WAK1BsP,EADJlE,GAAO,OAFHgE,EAAc7D,EAAW,QAAWA,EAAW,GAAM,IAAM,cAEhC,OAD7B8D,EAAsB9D,EAAWvL,EAAG+L,YAAYR,GAAY,sBACC,kBAE/DH,EAAMD,EAAWwB,OACI,IAAjBuC,EAAMhX,QACRkT,GAAO,IAAM,EAAW,MACpBsE,IACFtE,GAAO,UAETA,GAAY,EAAyB,MAInCA,GAFEsE,EAEK,SADPF,EAAY,eAAiBnE,GACE,kBAAoB,EAAW,YAAc,EAAyB,mBAAqB,EAAW,+CAAiD,EAAc,gCAE7L,IAAM,EAAc,YAAc,EAAW,MAAQ,EAAyB,MAIvF6D,EAAM3E,YACRa,GAAO,QAAU,EAAgB,KAAO,EAAU,MAAQ,EAAgB,IAAM,EAAwB,MAE1GA,GAAO,GAAK,EACR8D,EAAM/E,MACJwB,IACFP,GAAO,kBAGTA,GAAO,cACazV,IAAhBuZ,EAAM/E,OACRiB,GAAO,KAELA,GADEyD,EACK,GAAK,EAEA,GAGdzD,GAAO,KAAQ8D,EAAM/E,MAAS,IAGhCmC,EAAgB0C,EAAM1O,SAClB6K,EAAaA,GAAc,IACpBlG,KAHXmG,GAAO,SAKHD,EAAaA,GAAc,IACpBlG,KAFXmG,EAAM,IAGNA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,iBAAoBkB,GAAiB,UAAY,oCAA0CtM,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,0BAA8BsD,EAAa,QAAI,QACvM,IAArBhP,EAAG9D,KAAKsQ,WACVpB,GAAO,8BAAiC4D,EAAa,QAAI,2BAEvDhP,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAWb4C,EAPAnE,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAGnCY,EAAMD,EAAWwB,MACbiC,EACEM,EAAMhX,OACY,QAAhBgX,EAAMhX,SACRkT,GAAO,cAAgB,EAAO,IAAM,EAAU,KAAO,EAAO,YAAc,EAAO,aAAe,EAAa,cAAgB,EAAO,UAAY,EAAa,4BAA8B,EAAa,kCAAuCpL,EAAY,UAAI,SAAW,EAAa,gCAAkC,EAAa,kBAAoB,EAAmB,QACzWA,EAAG9D,KAAKuQ,UACVrB,GAAO,IAAM,EAAa,aAAe,EAAiB,KAAO,EAAa,WAAa,EAAU,MAEvGA,GAAO,QAGY,IAAjB8D,EAAMhX,OACRkT,GAAO,IAAM,EAAoB,KAEjCA,GAAO,QAAU,EAAU,iBAAmB,EAAoB,uBAAyB,EAAO,IAAM,EAAU,KAAO,EAAO,YAAc,EAAO,aAAe,EAAa,cAAgB,EAAO,UAAY,EAAa,4BAA8B,EAAa,kCAAuCpL,EAAY,UAAI,SAAW,EAAa,gCAAkC,EAAa,kBAAoB,EAAmB,QAC7aA,EAAG9D,KAAKuQ,UACVrB,GAAO,IAAM,EAAa,aAAe,EAAiB,KAAO,EAAa,WAAa,EAAU,MAEvGA,GAAO,SAGFyD,GACTzD,GAAO,mBACiB,IAApBpL,EAAGuM,cACLnB,GAAO,iBAAoBkB,GAAiB,UAAY,oCAA0CtM,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,0BAA8BsD,EAAa,QAAI,QACvM,IAArBhP,EAAG9D,KAAKsQ,WACVpB,GAAO,8BAAiC4D,EAAa,QAAI,2BAEvDhP,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,gFACFpL,EAAG4M,eAAiBjB,IAGrBP,GADEpL,EAAGwK,MACE,wCAEA,gDAIU,IAAjB0E,EAAMhX,OACRkT,GAAO,IAAM,EAAoB,KAEjCA,GAAO,sBAAwB,EAAc,wCAA0C,EAAc,mCAAqC,EAAc,yCAA2C,EAAO,IAAM,EAAU,KAAO,EAAO,YAAc,EAAO,aAAe,EAAa,cAAgB,EAAO,UAAY,EAAa,4BAA8B,EAAa,kCAAuCpL,EAAY,UAAI,MAAQ,EAAa,kBAAoB,EAAmB,OACneA,EAAG9D,KAAKuQ,UACVrB,GAAO,IAAM,EAAa,aAAe,EAAiB,KAAO,EAAa,WAAa,EAAU,MAEvGA,GAAO,eAAiB,EAAoB,OAGhDA,GAAO,MACHO,IACFP,GAAO,aAGJA,IAGP,IAAIwE,GAAG,CAAC,SAAS5b,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA+BgN,EAAI4K,GAClD,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BwC,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACnBoN,EAAiB,GACrBD,EAAI7B,QACJ,IAOMuE,EAPFxC,EAAa,QAAUF,EAAI7B,MAC3BwE,EAAc,GAChBC,EAAgB,GAChBC,EAAiBhQ,EAAG9D,KAAK+T,cAC3B,IAAKC,KAAalZ,EAAS,CACR,aAAbkZ,IACAzC,EAAOzW,EAAQkZ,IACfL,EAAQvM,MAAMC,QAAQkK,GAAQsC,EAAgBD,GAC5CI,GAAazC,GAErBrC,GAAO,OAAS,EAAU,aAC1B,IAAI+E,EAAoBnQ,EAAG/B,UAE3B,IAASiS,KADT9E,GAAO,cAAgB,EAAS,IACV2E,EAEpB,IADAF,EAAQE,EAAcG,IACZ3b,OAAQ,CAKhB,GAJA6W,GAAO,SAAW,EAAWpL,EAAGzH,KAAK4O,YAAY+I,GAAc,kBAC3DF,IACF5E,GAAO,4CAA8C,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAa8I,GAAc,OAE1GvE,EAAe,CACjBP,GAAO,SACP,IAAIoC,EAAOqC,EACX,GAAIrC,EAGF,IAFA,IAAkBE,GAAM,EACtBC,EAAKH,EAAKjZ,OAAS,EACdmZ,EAAKC,GAAI,CACdyC,EAAe5C,EAAKE,GAAM,GACtBA,IACFtC,GAAO,QAITA,GAAO,SADLiF,EAAW9H,GADT+H,EAAQtQ,EAAGzH,KAAK4O,YAAYiJ,KAEF,kBAC1BJ,IACF5E,GAAO,8CAAgD,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAagJ,GAAiB,OAEnHhF,GAAO,gBAAkB,EAAS,MAASpL,EAAGzH,KAAKqH,eAAeI,EAAG9D,KAAK6L,aAAeqI,EAAeE,GAAU,OAGtHlF,GAAO,SACP,IAAImF,EAAgB,UAAYlF,EAC9BmF,EAAmB,OAAUD,EAAgB,OAC3CvQ,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAG9D,KAAK6L,aAAe/H,EAAGzH,KAAKsP,YAAYsI,EAAmBI,GAAe,GAAQJ,EAAoB,MAAQI,GAElI,IAAIpF,EAAaA,GAAc,GAC/BA,EAAWlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,6DAAgFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,2BAA+B1L,EAAGzH,KAAK6O,aAAa8I,GAAc,wBAA4B,EAAqB,iBAAqBL,EAAY,OAAI,YAAgB7P,EAAGzH,KAAK6O,aAA6B,GAAhByI,EAAMtb,OAAcsb,EAAM,GAAKA,EAAMrP,KAAK,OAAU,QAC9X,IAArBR,EAAG9D,KAAKsQ,WACVpB,GAAO,4BAELA,GADkB,GAAhByE,EAAMtb,OACD,YAAeyL,EAAGzH,KAAK6O,aAAayI,EAAM,IAE1C,cAAiB7P,EAAGzH,KAAK6O,aAAayI,EAAMrP,KAAK,OAE1D4K,GAAO,kBAAqBpL,EAAGzH,KAAK6O,aAAa8I,GAAc,iBAE7DlQ,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,mFAE9B,CACLY,GAAO,QACP,IAAIsF,EAAOb,EACX,GAAIa,EAGF,IAFA,IAAIN,EAAcO,GAAM,EACtBC,EAAKF,EAAKnc,OAAS,EACdoc,EAAKC,GAAI,CACdR,EAAeM,EAAKC,GAAM,GAC1B,IAAIL,EAAQtQ,EAAGzH,KAAK4O,YAAYiJ,GAC9BI,EAAmBxQ,EAAGzH,KAAK6O,aAAagJ,GACxCC,EAAW9H,EAAQ+H,EACjBtQ,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAGzH,KAAK2P,QAAQiI,EAAmBC,EAAcpQ,EAAG9D,KAAK6L,eAE1EqD,GAAO,SAAW,EAAa,kBAC3B4E,IACF5E,GAAO,8CAAgD,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAagJ,GAAiB,OAEnHhF,GAAO,qBACiB,IAApBpL,EAAGuM,cACLnB,GAAO,6DAAgFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,2BAA+B1L,EAAGzH,KAAK6O,aAAa8I,GAAc,wBAA4B,EAAqB,iBAAqBL,EAAY,OAAI,YAAgB7P,EAAGzH,KAAK6O,aAA6B,GAAhByI,EAAMtb,OAAcsb,EAAM,GAAKA,EAAMrP,KAAK,OAAU,QAC9X,IAArBR,EAAG9D,KAAKsQ,WACVpB,GAAO,4BAELA,GADkB,GAAhByE,EAAMtb,OACD,YAAeyL,EAAGzH,KAAK6O,aAAayI,EAAM,IAE1C,cAAiB7P,EAAGzH,KAAK6O,aAAayI,EAAMrP,KAAK,OAE1D4K,GAAO,kBAAqBpL,EAAGzH,KAAK6O,aAAa8I,GAAc,iBAE7DlQ,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,kFAIbA,GAAO,QACHO,IACFyB,GAAkB,IAClBhC,GAAO,YAIbpL,EAAG/B,UAAYkS,EACf,IACSD,EADL5C,EAAiBH,EAAI5V,OACzB,IAAS2Y,KAAaJ,EAAa,CACjC,IAAIrC,EAAOqC,EAAYI,IAClBlQ,EAAG9D,KAAK0R,eAAiC,iBAARH,GAA+C,EAA3B3V,OAAO4J,KAAK+L,GAAMlZ,SAAwB,IAATkZ,EAAiBzN,EAAGzH,KAAKkP,eAAegG,EAAMzN,EAAG/C,MAAMyH,QAChJ0G,GAAO,IAAM,EAAe,iBAAmB,EAAWpL,EAAGzH,KAAK4O,YAAY+I,GAAc,kBACxFF,IACF5E,GAAO,4CAA8C,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAa8I,GAAc,OAE9G9E,GAAO,OACP+B,EAAI7X,OAASmY,EACbN,EAAIpP,WAAa0N,EAAczL,EAAGzH,KAAK4O,YAAY+I,GACnD/C,EAAInP,cAAgB0N,EAAiB,IAAM1L,EAAGzH,KAAKmK,eAAewN,GAClE9E,GAAO,KAAQpL,EAAGhK,SAASmX,GAAQ,IACnCA,EAAI5V,OAAS+V,EACblC,GAAO,OACHO,IACFP,GAAO,QAAU,EAAe,OAChCgC,GAAkB,MAOxB,OAHIzB,IACFP,GAAO,MAAQ,EAAmB,QAAU,EAAU,iBAEjDA,IAGP,IAAIyF,GAAG,CAAC,SAAS7c,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAuBgN,EAAI4K,GAC1C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnBQ,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAQ9CmF,GANA7B,IACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,MAK9F,IAAMV,GACbyF,EAAW,SAAWzF,EACnBQ,IACHT,GAAO,QAAU,EAAa,qBAAuB,EAAgB,KAEvEA,GAAO,OAAS,EAAW,IACvBS,IACFT,GAAO,cAAgB,EAAS,mBAAqB,EAAW,0CAA4C,EAAS,MAAQ,EAAW,oBAE1IA,GAAY,EAAW,qBAAuB,EAAO,OAAS,EAAO,IAAM,EAAa,YAAc,EAAO,iBAAmB,EAAU,KAAO,EAAa,IAAM,EAAO,SAAW,EAAW,oBAC7LS,IACFT,GAAO,SAGT,IAAID,EAAaA,GAAc,GAC/BA,EAAWlG,KAFXmG,GAAO,SAAW,EAAW,UAG7BA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,qDAAwEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,qCAAuC,EAAS,OACrL,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,+DAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,KACHO,IACFP,GAAO,YAEFA,IAGP,IAAI2F,GAAG,CAAC,SAAS/c,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAyBgN,EAAI4K,EAAUoG,GACtD,IAAI5F,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAClC,IAAuB,IAAnBvL,EAAG9D,KAAK+U,OAIV,OAHItF,IACFP,GAAO,iBAEFA,EAET,IAsCM8F,EAtCFrF,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEbma,EAAkBnR,EAAG9D,KAAKkV,eAC5BC,EAAgB/N,MAAMC,QAAQ4N,GAChC,GAAItF,EAAS,CAIXT,GAAO,SAHH8F,EAAU,SAAW7F,GAGI,cAAgB,EAAiB,WAF5DiG,EAAY,WAAajG,GAE6D,aAAe,EAAY,qBAAyB,EAAY,0BAA4B,EAAY,mBAD9LkG,EAAc,aAAelG,GACqM,MAAQ,EAAc,OAAS,EAAY,0BAA8B,EAAc,OACvTrL,EAAGwK,QACLY,GAAO,aAAe,EAAS,MAAQ,EAAY,YAErDA,GAAO,IAAM,EAAY,MAAQ,EAAY,sBACzCS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAEhFA,GAAO,KACgB,UAAnB+F,IACF/F,GAAO,KAAO,EAAiB,QAAU,EAAY,IACjDiG,IACFjG,GAAO,yCAA2C,EAAiB,YAErEA,GAAO,SAETA,GAAO,KAAO,EAAY,OAAS,EAAgB,QAAW,EAAc,iBAAoB,EAAY,oBAE1GA,GADEpL,EAAGwK,MACE,UAAY,EAAS,YAAc,EAAY,IAAM,EAAU,OAAS,EAAY,IAAM,EAAU,MAEpG,IAAM,EAAY,IAAM,EAAU,KAE3CY,GAAO,MAAQ,EAAY,SAAW,EAAU,cAC3C,CAEL,KADI8F,EAAUlR,EAAG7G,QAAQnC,IACX,CACZ,GAAuB,UAAnBma,EAKF,OAJAnR,EAAG1B,OAAOkT,KAAK,mBAAqBxa,EAAU,gCAAkCgJ,EAAGhC,cAAgB,KAC/F2N,IACFP,GAAO,iBAEFA,EACF,GAAIiG,GAAqD,GAApCF,EAAgBM,QAAQza,GAIlD,OAHI2U,IACFP,GAAO,iBAEFA,EAEP,MAAM,IAAIjX,MAAM,mBAAqB6C,EAAU,gCAAkCgJ,EAAGhC,cAAgB,KAGxG,IAAIsT,EAGElU,EAFFmU,GADAD,EAA8B,iBAAXJ,KAAyBA,aAAmB5V,SAAW4V,EAAQlb,WACvDkb,EAAQ9M,MAAQ,SAK/C,GAJIkN,IACElU,GAA2B,IAAlB8T,EAAQ1G,MACrB0G,EAAUA,EAAQlb,UAEhBub,GAAeP,EAIjB,OAHIrF,IACFP,GAAO,iBAEFA,EAET,GAAIhO,EAAQ,CACV,IAAK4C,EAAGwK,MAAO,MAAM,IAAIrW,MAAM,+BAE/BiX,GAAO,iBADHsG,EAAa,UAAY1R,EAAGzH,KAAK4O,YAAYnQ,GAAW,aACpB,IAAM,EAAU,aACnD,CACLoU,GAAO,UACP,IAAIsG,EAAa,UAAY1R,EAAGzH,KAAK4O,YAAYnQ,GAC7Csa,IAAWI,GAAc,aAE3BtG,GADoB,mBAAX8F,EACF,IAAM,EAAe,IAAM,EAAU,KAErC,IAAM,EAAe,SAAW,EAAU,KAEnD9F,GAAO,QAGX,IAAID,EAAaA,GAAc,GAC/BA,EAAWlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,uDAA0EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,yBAE9JN,GADES,EACK,GAAK,EAEL,GAAM7L,EAAGzH,KAAKqH,eAAe5I,GAEtCoU,GAAO,QACkB,IAArBpL,EAAG9D,KAAKsQ,WACVpB,GAAO,sCAELA,GADES,EACK,OAAU,EAAiB,OAE3B,GAAM7L,EAAGzH,KAAK6O,aAAapQ,GAEpCoU,GAAO,QAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAM7L,EAAGzH,KAAKqH,eAAe5I,GAEtCoU,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,MACHO,IACFP,GAAO,YAEFA,IAGP,IAAIuG,GAAG,CAAC,SAAS3d,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAqBgN,EAAI4K,GACxC,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnB0C,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACvBmN,EAAI7B,QACJ,IAOMsG,EAMA5D,EAbFX,EAAa,QAAUF,EAAI7B,MAC3BuG,EAAW7R,EAAG1K,OAAa,KAC7Bwc,EAAW9R,EAAG1K,OAAa,KAC3Byc,OAA4Bpc,IAAbkc,IAA2B7R,EAAG9D,KAAK0R,eAAqC,iBAAZiE,GAAuD,EAA/B/Z,OAAO4J,KAAKmQ,GAAUtd,SAA4B,IAAbsd,EAAqB7R,EAAGzH,KAAKkP,eAAeoK,EAAU7R,EAAG/C,MAAMyH,MACvMsN,OAA4Brc,IAAbmc,IAA2B9R,EAAG9D,KAAK0R,eAAqC,iBAAZkE,GAAuD,EAA/Bha,OAAO4J,KAAKoQ,GAAUvd,SAA4B,IAAbud,EAAqB9R,EAAGzH,KAAKkP,eAAeqK,EAAU9R,EAAG/C,MAAMyH,MACvM4I,EAAiBH,EAAI5V,OAkFvB,OAjFIwa,GAAgBC,GAElB7E,EAAIZ,cAAe,EACnBY,EAAI7X,OAAS0B,EACbmW,EAAIpP,WAAa0N,EACjB0B,EAAInP,cAAgB0N,EACpBN,GAAO,QAAU,EAAU,kBAAoB,EAAW,aACtD4C,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACvCxB,GAAO,KAAQpL,EAAGhK,SAASmX,GAAQ,IACnCA,EAAI5V,OAAS+V,EACbH,EAAIZ,cAAe,EACnBnB,GAAO,cAAgB,EAAU,iCAAmC,EAAU,sBAAwB,EAAU,6BAChHpL,EAAG4M,cAAgBO,EAAIP,cAAgBoB,EACnC+D,GACF3G,GAAO,QAAU,EAAe,QAChC+B,EAAI7X,OAAS0K,EAAG1K,OAAa,KAC7B6X,EAAIpP,WAAaiC,EAAGjC,WAAa,QACjCoP,EAAInP,cAAgBgC,EAAGhC,cAAgB,QACvCoN,GAAO,KAAQpL,EAAGhK,SAASmX,GAAQ,IACnCA,EAAI5V,OAAS+V,EACblC,GAAO,IAAM,EAAW,MAAQ,EAAe,KAC3C2G,GAAgBC,EAElB5G,GAAO,SADPwG,EAAY,WAAavG,GACM,cAE/BuG,EAAY,SAEdxG,GAAO,MACH4G,IACF5G,GAAO,aAGTA,GAAO,SAAW,EAAe,OAE/B4G,IACF7E,EAAI7X,OAAS0K,EAAG1K,OAAa,KAC7B6X,EAAIpP,WAAaiC,EAAGjC,WAAa,QACjCoP,EAAInP,cAAgBgC,EAAGhC,cAAgB,QACvCoN,GAAO,KAAQpL,EAAGhK,SAASmX,GAAQ,IACnCA,EAAI5V,OAAS+V,EACblC,GAAO,IAAM,EAAW,MAAQ,EAAe,KAC3C2G,GAAgBC,EAElB5G,GAAO,SADPwG,EAAY,WAAavG,GACM,cAE/BuG,EAAY,SAEdxG,GAAO,OAETA,GAAO,SAAW,EAAW,sBACL,IAApBpL,EAAGuM,cACLnB,GAAO,mDAAsEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,gCAAkC,EAAc,OACnL,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,mCAAsC,EAAc,mBAEzDpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,gFACFpL,EAAG4M,eAAiBjB,IAGrBP,GADEpL,EAAGwK,MACE,wCAEA,8CAGXY,GAAO,QACHO,IACFP,GAAO,aAGLO,IACFP,GAAO,iBAGJA,IAGP,IAAI6G,GAAG,CAAC,SAASje,EAAQf,EAAOD,gBAIlCC,EAAOD,QAAU,CACfkE,KAAQlD,EAAQ,SAChBke,MAAOle,EAAQ,WACf6V,MAAO7V,EAAQ,WACfmR,SAAYnR,EAAQ,aACpByW,MAAOzW,EAAQ,WACfme,SAAUne,EAAQ,cAClBoM,aAAcpM,EAAQ,kBACtBoe,KAAQpe,EAAQ,UAChBid,OAAQjd,EAAQ,YAChBqe,GAAMre,EAAQ,QACdsW,MAAOtW,EAAQ,WACfsQ,QAAStQ,EAAQ,YACjBuQ,QAASvQ,EAAQ,YACjBse,SAAUte,EAAQ,iBAClBue,SAAUve,EAAQ,iBAClBwe,UAAWxe,EAAQ,kBACnBye,UAAWze,EAAQ,kBACnB0e,cAAe1e,EAAQ,sBACvB2e,cAAe3e,EAAQ,sBACvB4e,WAAY5e,EAAQ,gBACpBoW,IAAKpW,EAAQ,SACb6e,MAAO7e,EAAQ,WACf8e,QAAS9e,EAAQ,aACjBwQ,WAAYxQ,EAAQ,gBACpB+e,cAAe/e,EAAQ,mBACvBqW,SAAUrW,EAAQ,cAClBgf,YAAahf,EAAQ,iBACrBgC,SAAUhC,EAAQ,gBAGlB,CAACif,WAAW,GAAGC,gBAAgB,GAAGC,iBAAiB,GAAGC,qBAAqB,GAAGC,UAAU,GAAGC,UAAU,GAAGC,YAAY,GAAGC,UAAU,GAAGC,aAAa,GAAGC,iBAAiB,GAAGC,SAAS,GAAGC,WAAW,GAAGC,OAAO,GAAGC,UAAU,GAAGC,eAAe,GAAGC,QAAQ,GAAGC,UAAU,GAAGC,YAAY,GAAGC,eAAe,GAAGC,kBAAkB,GAAGC,QAAQ,GAAGC,aAAa,GAAGC,gBAAgB,GAAGC,aAAa,KAAKC,GAAG,CAAC,SAASzgB,EAAQf,EAAOD,gBAEvZC,EAAOD,QAAU,SAAwBgN,EAAI4K,GAC3C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnB0C,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACnBoN,EAAiB,GACrBD,EAAI7B,QACJ,IAAI+B,EAAa,QAAUF,EAAI7B,MAC3BgD,EAAO,IAAMjD,EACfkD,EAAWpB,EAAI3B,UAAYxL,EAAGwL,UAAY,EAC1CgD,EAAY,OAASD,EACrBjB,EAAiBtN,EAAGzI,OAEtB,GADA6T,GAAO,OAAS,EAAU,iBAAmB,EAAW,IACpD9H,MAAMC,QAAQvM,GAAU,CAC1B,IAGM0d,EAGAvJ,EAeAuB,EArBFiI,EAAmB3U,EAAG1K,OAAOsf,iBACR,IAArBD,IACFvJ,GAAO,IAAM,EAAW,MAAQ,EAAU,cAAiBpU,EAAc,OAAI,KACzE0d,EAAqBhJ,EACzBA,EAAiB1L,EAAGhC,cAAgB,oBAEhCmN,EAAaA,GAAc,IACpBlG,KAFXmG,GAAO,UAAY,EAAW,UAG9BA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,gEAAmFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,uBAA0B1U,EAAc,OAAI,OAC5L,IAArBgJ,EAAG9D,KAAKsQ,WACVpB,GAAO,0CAA8CpU,EAAc,OAAI,YAErEgJ,EAAG9D,KAAKuQ,UACVrB,GAAO,mDAAsDpL,EAAa,WAAI,YAAc,EAAU,KAExGoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,MACPM,EAAiBgJ,EACb/I,IACFyB,GAAkB,IAClBhC,GAAO,aAGX,IAAIoC,EAAOxW,EACX,GAAIwW,EAGF,IAFA,IAAUE,GAAM,EACdC,EAAKH,EAAKjZ,OAAS,EACdmZ,EAAKC,GAAI,CAEd,IAEMS,EAMAC,EATNZ,EAAOD,EAAKE,GAAM,IACb1N,EAAG9D,KAAK0R,eAAiC,iBAARH,GAA+C,EAA3B3V,OAAO4J,KAAK+L,GAAMlZ,SAAwB,IAATkZ,EAAiBzN,EAAGzH,KAAKkP,eAAegG,EAAMzN,EAAG/C,MAAMyH,QAChJ0G,GAAO,IAAM,EAAe,gBAAkB,EAAU,aAAe,EAAO,OAC1EgD,EAAY7F,EAAQ,IAAMmF,EAAK,IACnCP,EAAI7X,OAASmY,EACbN,EAAIpP,WAAa0N,EAAc,IAAMiC,EAAK,IAC1CP,EAAInP,cAAgB0N,EAAiB,IAAMgC,EAC3CP,EAAIlP,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWyP,EAAI1N,EAAG9D,KAAK6L,cAAc,GAC5EoF,EAAIpB,YAAYwC,GAAYb,EACxBW,EAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,EAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,EAAOG,EAAWJ,GAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,EAAc,KAAO,EAAU,IAExEA,GAAO,OACHO,IACFP,GAAO,QAAU,EAAe,OAChCgC,GAAkB,MAKK,iBAApBuH,IAAiC3U,EAAG9D,KAAK0R,eAA6C,iBAApB+G,GAAuE,EAAvC7c,OAAO4J,KAAKiT,GAAkBpgB,SAAoC,IAArBogB,EAA6B3U,EAAGzH,KAAKkP,eAAekN,EAAkB3U,EAAG/C,MAAMyH,QACvOyI,EAAI7X,OAASqf,EACbxH,EAAIpP,WAAaiC,EAAGjC,WAAa,mBACjCoP,EAAInP,cAAgBgC,EAAGhC,cAAgB,mBACvCoN,GAAO,IAAM,EAAe,gBAAkB,EAAU,aAAgBpU,EAAc,OAAI,iBAAmB,EAAS,MAASA,EAAc,OAAI,KAAO,EAAS,MAAQ,EAAU,YAAc,EAAS,SAC1MmW,EAAIlP,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWqQ,EAAMtO,EAAG9D,KAAK6L,cAAc,GAC1EqG,EAAY7F,EAAQ,IAAM+F,EAAO,IACrCnB,EAAIpB,YAAYwC,GAAYD,EACxBD,EAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,EAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,EAAOG,EAAWJ,GAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,EAAc,KAAO,EAAU,IAEpEO,IACFP,GAAO,SAAW,EAAe,aAEnCA,GAAO,SACHO,IACFP,GAAO,QAAU,EAAe,OAChCgC,GAAkB,UAGjB,EAAKpN,EAAG9D,KAAK0R,eAAoC,iBAAX5W,GAAqD,EAA9Bc,OAAO4J,KAAK1K,GAASzC,SAA2B,IAAZyC,EAAoBgJ,EAAGzH,KAAKkP,eAAezQ,EAASgJ,EAAG/C,MAAMyH,QACnKyI,EAAI7X,OAAS0B,EACbmW,EAAIpP,WAAa0N,EACjB0B,EAAInP,cAAgB0N,EACpBN,GAAO,cAAgB,EAAS,SAAqB,EAAS,MAAQ,EAAU,YAAc,EAAS,SACvG+B,EAAIlP,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWqQ,EAAMtO,EAAG9D,KAAK6L,cAAc,GAC1EqG,EAAY7F,EAAQ,IAAM+F,EAAO,IACrCnB,EAAIpB,YAAYwC,GAAYD,EACxBD,EAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,EAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,EAAOG,EAAWJ,GAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,EAAc,KAAO,EAAU,IAEpEO,IACFP,GAAO,SAAW,EAAe,aAEnCA,GAAO,MAKT,OAHIO,IACFP,GAAO,IAAM,EAAmB,QAAU,EAAU,iBAE/CA,IAGP,IAAIyJ,GAAG,CAAC,SAAS7gB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA6BgN,EAAI4K,GAChD,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BM,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEjB,IAAM6U,GAA6B,iBAAX7U,EACtB,MAAM,IAAI7C,MAAMyW,EAAW,mBAE7BQ,GAAO,eAAiB,EAAS,QAC7BS,IACFT,GAAO,IAAM,EAAiB,8BAAgC,EAAiB,oBAEjFA,GAAO,aAAe,EAAS,MAAQ,EAAU,MAAQ,EAAiB,KAExEA,GADEpL,EAAG9D,KAAK4Y,oBACH,gCAAkC,EAAS,eAAiB,EAAS,UAAa9U,EAAG9D,KAAwB,oBAAI,IAEjH,YAAc,EAAS,yBAA2B,EAAS,KAEpEkP,GAAO,MACHS,IACFT,GAAO,SAGT,IAAID,EAAaA,GAAc,GAC/BA,EAAWlG,KAFXmG,GAAO,WAGPA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,2DAA8EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,4BAA8B,EAAiB,OAC1L,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,sCAELA,GADES,EACK,OAAU,EAEL,EAAiB,KAG7B7L,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAK,EAEdT,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,KACHO,IACFP,GAAO,YAEFA,IAGP,IAAI2J,GAAG,CAAC,SAAS/gB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAsBgN,EAAI4K,GACzC,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BwC,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACvBmN,EAAI7B,QACJ,IAMM0C,EAGAgH,EAUA7J,EAeAuB,EAlCFW,EAAa,QAAUF,EAAI7B,MAqE/B,OApEKtL,EAAG9D,KAAK0R,eAAoC,iBAAX5W,GAAqD,EAA9Bc,OAAO4J,KAAK1K,GAASzC,SAA2B,IAAZyC,EAAoBgJ,EAAGzH,KAAKkP,eAAezQ,EAASgJ,EAAG/C,MAAMyH,OAC5JyI,EAAI7X,OAAS0B,EACbmW,EAAIpP,WAAa0N,EACjB0B,EAAInP,cAAgB0N,EACpBN,GAAO,QAAU,EAAU,eACvB4C,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACvCO,EAAIZ,cAAe,EAEfY,EAAIjR,KAAK0P,YACXoJ,EAAmB7H,EAAIjR,KAAK0P,UAC5BuB,EAAIjR,KAAK0P,WAAY,GAEvBR,GAAO,IAAOpL,EAAGhK,SAASmX,GAAQ,IAClCA,EAAIZ,cAAe,EACfyI,IAAkB7H,EAAIjR,KAAK0P,UAAYoJ,GAC3ChV,EAAG4M,cAAgBO,EAAIP,cAAgBoB,GAEnC7C,EAAaA,GAAc,IACpBlG,KAFXmG,GAAO,QAAU,EAAe,UAGhCA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,oDAAuEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kBACpI,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,sCAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,uBAAyB,EAAU,iCAAmC,EAAU,sBAAwB,EAAU,4BACrHpL,EAAG9D,KAAK0P,YACVR,GAAO,SAGTA,GAAO,kBACiB,IAApBpL,EAAGuM,cACLnB,GAAO,oDAAuEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kBACpI,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,sCAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,+EACHO,IACFP,GAAO,mBAGJA,IAGP,IAAI6J,GAAG,CAAC,SAASjhB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAwBgN,EAAI4K,GAC3C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnB0C,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACnBoN,EAAiB,GACrBD,EAAI7B,QACJ,IAAI+B,EAAa,QAAUF,EAAI7B,MAC3BgC,EAAiBH,EAAI5V,OACvB2d,EAAa,YAAc7J,EAC3B8J,EAAkB,iBAAmB9J,EACvCD,GAAO,OAAS,EAAU,eAAiB,EAAe,cAAgB,EAAW,cAAgB,EAAoB,YACzH,IAAI4C,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACvC,IAAIY,EAAOxW,EACX,GAAIwW,EAGF,IAFA,IAAIC,EAAMC,GAAM,EACdC,EAAKH,EAAKjZ,OAAS,EACdmZ,EAAKC,GACVF,EAAOD,EAAKE,GAAM,IACb1N,EAAG9D,KAAK0R,eAAiC,iBAARH,GAA+C,EAA3B3V,OAAO4J,KAAK+L,GAAMlZ,SAAwB,IAATkZ,EAAiBzN,EAAGzH,KAAKkP,eAAegG,EAAMzN,EAAG/C,MAAMyH,OAChJyI,EAAI7X,OAASmY,EACbN,EAAIpP,WAAa0N,EAAc,IAAMiC,EAAK,IAC1CP,EAAInP,cAAgB0N,EAAiB,IAAMgC,EAC3CtC,GAAO,KAAQpL,EAAGhK,SAASmX,GAAQ,IACnCA,EAAI5V,OAAS+V,GAEblC,GAAO,QAAU,EAAe,YAE9BsC,IACFtC,GAAO,QAAU,EAAe,OAAS,EAAe,OAAS,EAAW,aAAe,EAAoB,OAAS,EAAoB,KAAO,EAAO,eAC1JgC,GAAkB,KAEpBhC,GAAO,QAAU,EAAe,OAAS,EAAW,MAAQ,EAAe,YAAc,EAAoB,MAAQ,EAAO,MA8BhI,OA3BApL,EAAG4M,cAAgBO,EAAIP,cAAgBoB,EACvC5C,GAAY,EAAmB,QAAU,EAAW,sBAC5B,IAApBpL,EAAGuM,cACLnB,GAAO,sDAAyEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,gCAAkC,EAAoB,OAC5L,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,2DAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,gFACFpL,EAAG4M,eAAiBjB,IAGrBP,GADEpL,EAAGwK,MACE,wCAEA,8CAGXY,GAAO,sBAAwB,EAAU,iCAAmC,EAAU,sBAAwB,EAAU,2BACpHpL,EAAG9D,KAAK0P,YACVR,GAAO,OAEFA,IAGP,IAAIgK,GAAG,CAAC,SAASphB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA0BgN,EAAI4K,GAC7C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BM,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAEbqe,EAAUxJ,EAAU,eAAiBC,EAAe,KAAO9L,EAAG7B,WAAWnH,GAC7EoU,GAAO,QACHS,IACFT,GAAO,KAAO,EAAiB,4BAA8B,EAAiB,qBAGhF,IAAID,EAAaA,GAAc,GAC/BA,EAAWlG,KAFXmG,GAAO,KAAO,EAAY,SAAW,EAAU,YAG/CA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,wDAA2EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,0BAE/JN,GADES,EACK,GAAK,EAEL,GAAM7L,EAAGzH,KAAKqH,eAAe5I,GAEtCoU,GAAO,QACkB,IAArBpL,EAAG9D,KAAKsQ,WACVpB,GAAO,uCAELA,GADES,EACK,OAAU,EAAiB,OAE3B,GAAM7L,EAAGzH,KAAK6O,aAAapQ,GAEpCoU,GAAO,QAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAM7L,EAAGzH,KAAKqH,eAAe5I,GAEtCoU,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAejB,OAXIvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,KACHO,IACFP,GAAO,YAEFA,IAGP,IAAIkK,GAAG,CAAC,SAASthB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA6BgN,EAAI4K,GAChD,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BwC,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GACnBoN,EAAiB,GACrBD,EAAI7B,QACJ,IAmBMiK,EAkDEC,EAoDIxH,EAzHRX,EAAa,QAAUF,EAAI7B,MAC3BmK,EAAO,MAAQpK,EACjBiD,EAAO,MAAQjD,EACfkD,EAAWpB,EAAI3B,UAAYxL,EAAGwL,UAAY,EAC1CgD,EAAY,OAASD,EACrBmH,EAAkB,iBAAmBrK,EACnCsK,EAAc7d,OAAO4J,KAAK1K,GAAW,IAAI4e,OAAOC,GAClDC,EAAe9V,EAAG1K,OAAOygB,mBAAqB,GAC9CC,EAAiBle,OAAO4J,KAAKoU,GAAcF,OAAOC,GAClDI,EAAejW,EAAG1K,OAAO4gB,qBACzBC,EAAkBR,EAAYphB,QAAUyhB,EAAezhB,OACvD6hB,GAAiC,IAAjBH,EAChBI,EAA6C,iBAAhBJ,GAA4Bne,OAAO4J,KAAKuU,GAAc1hB,OACnF+hB,EAAoBtW,EAAG9D,KAAKqa,iBAC5BC,EAAmBJ,GAAiBC,GAAuBC,EAC3DtG,EAAiBhQ,EAAG9D,KAAK+T,cACzB3C,EAAiBtN,EAAGzI,OAClBkf,EAAYzW,EAAG1K,OAAO+U,SAK1B,SAASwL,EAASxhB,GAChB,MAAa,cAANA,EAMT,GAXIoiB,KAAezW,EAAG9D,KAAKqM,QAASkO,EAAUlO,QAAUkO,EAAUliB,OAASyL,EAAG9D,KAAKwa,eAC7EnB,EAAgBvV,EAAGzH,KAAKqK,OAAO6T,IAMrCrL,GAAO,OAAS,EAAU,iBAAmB,EAAe,WACxD4E,IACF5E,GAAO,QAAU,EAAoB,iBAEnCoL,EAAkB,CAMpB,GAJEpL,GADE4E,EACK,IAAM,EAAoB,MAAQ,EAAoB,mBAAqB,EAAU,eAAiB,EAAS,OAAS,EAAS,IAAM,EAAoB,YAAc,EAAS,aAAe,EAAS,MAAQ,EAAoB,IAAM,EAAS,MAErP,aAAe,EAAS,OAAS,EAAU,OAEhDmG,EAAiB,CAEnB,GADA/K,GAAO,oBAAsB,EAAS,cAClCuK,EAAYphB,OACd,GAAyB,EAArBohB,EAAYphB,OACd6W,GAAO,sBAAwB,EAAgB,mBAAqB,EAAS,SACxE,CACL,IAAIoC,EAAOmI,EACX,GAAInI,EAGF,IAFA,IAAkBmJ,GAAM,EACtBhJ,EAAKH,EAAKjZ,OAAS,EACdoiB,EAAKhJ,GACVyC,EAAe5C,EAAKmJ,GAAM,GAC1BvL,GAAO,OAAS,EAAS,OAAUpL,EAAGzH,KAAKqH,eAAewQ,GAAiB,IAKnF,GAAI4F,EAAezhB,OAAQ,CACzB,IAAImc,EAAOsF,EACX,GAAItF,EAGF,IAFA,IAAgBhD,GAAM,EACpBkD,EAAKF,EAAKnc,OAAS,EACdmZ,EAAKkD,GACVgG,GAAalG,EAAKhD,GAAM,GACxBtC,GAAO,OAAUpL,EAAG7B,WAAWyY,IAAe,SAAW,EAAS,KAIxExL,GAAO,uBAAyB,EAAS,OAElB,OAArBkL,EACFlL,GAAO,WAAa,EAAU,IAAM,EAAS,OAEzC+E,EAAoBnQ,EAAG/B,UACvBuX,EAAsB,OAAUC,EAAO,OACvCzV,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWwX,EAAMzV,EAAG9D,KAAK6L,eAE7DqO,EACEE,EACFlL,GAAO,WAAa,EAAU,IAAM,EAAS,OAGzCsJ,EAAqBhJ,EACzBA,EAAiB1L,EAAGhC,cAAgB,yBAChCmN,EAAaA,GAAc,IACpBlG,KAJXmG,GAAO,IAAM,EAAe,cAK5BA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,qEAAwFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,qCAAwC,EAAwB,QACrN,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAELA,GADEpL,EAAG9D,KAAKuU,uBACH,oCAEA,wCAETrF,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,mDAAsDpL,EAAa,WAAI,YAAc,EAAU,KAExGoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCkB,EAAiBgJ,EACb/I,IACFP,GAAO,aAGFiL,IACgB,WAArBC,GACFlL,GAAO,QAAU,EAAU,eACvB4C,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACvCO,EAAI7X,OAAS2gB,EACb9I,EAAIpP,WAAaiC,EAAGjC,WAAa,wBACjCoP,EAAInP,cAAgBgC,EAAGhC,cAAgB,wBACvCmP,EAAIlP,UAAY+B,EAAG9D,KAAKuU,uBAAyBzQ,EAAG/B,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWwX,EAAMzV,EAAG9D,KAAK6L,cAC5GqG,GAAY7F,EAAQ,IAAMkN,EAAO,IACrCtI,EAAIpB,YAAYwC,GAAYkH,EACxBpH,GAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,GAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,GAAOG,EAAWJ,IAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,GAAc,KAAO,GAAU,IAExEA,GAAO,SAAW,EAAe,gBAAkB,EAAU,wHAA0H,EAAU,IAAM,EAAS,SAChNpL,EAAG4M,cAAgBO,EAAIP,cAAgBoB,IAEvCb,EAAI7X,OAAS2gB,EACb9I,EAAIpP,WAAaiC,EAAGjC,WAAa,wBACjCoP,EAAInP,cAAgBgC,EAAGhC,cAAgB,wBACvCmP,EAAIlP,UAAY+B,EAAG9D,KAAKuU,uBAAyBzQ,EAAG/B,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWwX,EAAMzV,EAAG9D,KAAK6L,cAC5GqG,GAAY7F,EAAQ,IAAMkN,EAAO,IACrCtI,EAAIpB,YAAYwC,GAAYkH,EACxBpH,GAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,GAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,GAAOG,EAAWJ,IAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,GAAc,KAAO,GAAU,IAEpEO,IACFP,GAAO,SAAW,EAAe,eAIvCpL,EAAG/B,UAAYkS,GAEbgG,IACF/K,GAAO,OAETA,GAAO,OACHO,IACFP,GAAO,QAAU,EAAe,OAChCgC,GAAkB,KAGtB,IAAIyJ,EAAe7W,EAAG9D,KAAK4a,cAAgB9W,EAAG4M,cAC9C,GAAI+I,EAAYphB,OAAQ,CACtB,IAAIwiB,EAAOpB,EACX,GAAIoB,EAGF,IAFA,IAAI3G,EAAc4G,GAAM,EACtBC,EAAKF,EAAKxiB,OAAS,EACdyiB,EAAKC,GAAI,CAEd,IAEM3G,EAEF4G,EAYI7G,EAYEF,EACFuE,EACAlE,EAKErF,EAqBAuB,EAxDNe,GAAOzW,EADXoZ,EAAe2G,EAAKC,GAAM,KAErBhX,EAAG9D,KAAK0R,eAAiC,iBAARH,IAA+C,EAA3B3V,OAAO4J,KAAK+L,IAAMlZ,SAAwB,IAATkZ,GAAiBzN,EAAGzH,KAAKkP,eAAegG,GAAMzN,EAAG/C,MAAMyH,QAE9I0J,GAAY7F,GADV+H,EAAQtQ,EAAGzH,KAAK4O,YAAYiJ,IAE9B8G,EAAcL,QAAiClhB,IAAjB8X,GAAK0J,QACrChK,EAAI7X,OAASmY,GACbN,EAAIpP,WAAa0N,EAAc6E,EAC/BnD,EAAInP,cAAgB0N,EAAiB,IAAM1L,EAAGzH,KAAKmK,eAAe0N,GAClEjD,EAAIlP,UAAY+B,EAAGzH,KAAK2P,QAAQlI,EAAG/B,UAAWmS,EAAcpQ,EAAG9D,KAAK6L,cACpEoF,EAAIpB,YAAYwC,GAAYvO,EAAGzH,KAAKqH,eAAewQ,GAC/C/B,GAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,GAAOG,GAAa,GAC5CH,GAAQrO,EAAGzH,KAAKgP,WAAW8G,GAAOG,EAAWJ,IACzCiC,EAAWjC,IAGfhD,GAAO,SADHiF,EAAW7B,GACgB,MAAQ,GAAc,KAEnD0I,EACF9L,GAAO,IAAM,GAAU,KAEnBmK,GAAiBA,EAAcnF,IACjChF,GAAO,SAAW,EAAa,kBAC3B4E,IACF5E,GAAO,8CAAgD,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAagJ,GAAiB,OAEnHhF,GAAO,OAAS,EAAe,aAC3B+E,EAAoBnQ,EAAG/B,UACzByW,EAAqBhJ,EACrB8E,EAAmBxQ,EAAGzH,KAAK6O,aAAagJ,GACtCpQ,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAGzH,KAAK2P,QAAQiI,EAAmBC,EAAcpQ,EAAG9D,KAAK6L,eAE1E2D,EAAiB1L,EAAGhC,cAAgB,aAChCmN,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,yDAA4EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kCAAqC,EAAqB,QACnM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAELA,GADEpL,EAAG9D,KAAKuU,uBACH,yBAEA,oCAAuC,EAAqB,MAErErF,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCkB,EAAiBgJ,EACjB1U,EAAG/B,UAAYkS,EACf/E,GAAO,cAEHO,GACFP,GAAO,SAAW,EAAa,kBAC3B4E,IACF5E,GAAO,8CAAgD,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAagJ,GAAiB,OAEnHhF,GAAO,OAAS,EAAe,uBAE/BA,GAAO,QAAU,EAAa,kBAC1B4E,IACF5E,GAAO,8CAAgD,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAagJ,GAAiB,OAEnHhF,GAAO,SAGXA,GAAO,IAAM,GAAU,QAGvBO,IACFP,GAAO,QAAU,EAAe,OAChCgC,GAAkB,MAK1B,GAAI4I,EAAezhB,OAAQ,CACzB,IAAI6iB,GAAOpB,EACX,GAAIoB,GAGF,IAFA,IAAIR,GAAYS,IAAM,EACpBC,GAAKF,GAAK7iB,OAAS,EACd8iB,GAAKC,IAAI,CAEd,IAYMlJ,GAEAC,GAdFZ,GAAOqI,EADXc,GAAaQ,GAAKC,IAAM,KAEnBrX,EAAG9D,KAAK0R,eAAiC,iBAARH,IAA+C,EAA3B3V,OAAO4J,KAAK+L,IAAMlZ,SAAwB,IAATkZ,GAAiBzN,EAAGzH,KAAKkP,eAAegG,GAAMzN,EAAG/C,MAAMyH,QAChJyI,EAAI7X,OAASmY,GACbN,EAAIpP,WAAaiC,EAAGjC,WAAa,qBAAuBiC,EAAGzH,KAAK4O,YAAYyP,IAC5EzJ,EAAInP,cAAgBgC,EAAGhC,cAAgB,sBAAwBgC,EAAGzH,KAAKmK,eAAekU,IAEpFxL,GADE4E,EACK,IAAM,EAAoB,MAAQ,EAAoB,mBAAqB,EAAU,eAAiB,EAAS,OAAS,EAAS,IAAM,EAAoB,YAAc,EAAS,aAAe,EAAS,MAAQ,EAAoB,IAAM,EAAS,MAErP,aAAe,EAAS,OAAS,EAAU,OAEpD5E,GAAO,QAAWpL,EAAG7B,WAAWyY,IAAe,SAAW,EAAS,QACnEzJ,EAAIlP,UAAY+B,EAAGzH,KAAKsP,YAAY7H,EAAG/B,UAAWwX,EAAMzV,EAAG9D,KAAK6L,cAC5DqG,GAAY7F,EAAQ,IAAMkN,EAAO,IACrCtI,EAAIpB,YAAYwC,GAAYkH,EACxBpH,GAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,GAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,GAAOG,EAAWJ,IAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,GAAc,KAAO,GAAU,IAEpEO,IACFP,GAAO,SAAW,EAAe,aAEnCA,GAAO,MACHO,IACFP,GAAO,SAAW,EAAe,aAEnCA,GAAO,OACHO,IACFP,GAAO,QAAU,EAAe,OAChCgC,GAAkB,OAS5B,OAHIzB,IACFP,GAAO,IAAM,EAAmB,QAAU,EAAU,iBAE/CA,IAGP,IAAImM,GAAG,CAAC,SAASvjB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAgCgN,EAAI4K,GACnD,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BwC,EAAQ,SAAW1C,EACnB8B,EAAMnN,EAAGzH,KAAKc,KAAK2G,GAEvBmN,EAAI7B,QACJ,IAMMmK,EACFnH,EACAZ,EACA8J,EAEAhJ,EACAkH,EACA1F,EACA1C,EAUEc,EACAJ,EAEAK,EA3BFhB,EAAa,QAAUF,EAAI7B,MAiE/B,OAhEAF,GAAO,OAAS,EAAU,cACrBpL,EAAG9D,KAAK0R,eAAoC,iBAAX5W,GAAqD,EAA9Bc,OAAO4J,KAAK1K,GAASzC,SAA2B,IAAZyC,EAAoBgJ,EAAGzH,KAAKkP,eAAezQ,EAASgJ,EAAG/C,MAAMyH,QAC5JyI,EAAI7X,OAAS0B,EACbmW,EAAIpP,WAAa0N,EACjB0B,EAAInP,cAAgB0N,EAElB4C,EAAO,MAAQjD,EACfqC,EAAK,IAAMrC,EACXmM,EAAe,QAHb/B,EAAO,MAAQpK,GAGe,OAEhCmD,EAAY,QADDrB,EAAI3B,UAAYxL,EAAGwL,UAAY,GAE1CkK,EAAkB,iBAAmBrK,EAErCiC,EAAiBtN,EAAGzI,QADpByY,EAAiBhQ,EAAG9D,KAAK+T,iBAGzB7E,GAAO,QAAU,EAAoB,kBAGrCA,GADE4E,EACK,IAAM,EAAoB,MAAQ,EAAoB,mBAAqB,EAAU,eAAiB,EAAS,OAAS,EAAS,IAAM,EAAoB,YAAc,EAAS,aAAe,EAAS,MAAQ,EAAoB,IAAM,EAAS,MAErP,aAAe,EAAS,OAAS,EAAU,OAEpD5E,GAAO,iBAAmB,EAAS,cAC/BgD,EAAYqH,EACZzH,EAAgBhO,EAAG4M,cACvB5M,EAAG4M,cAAgBO,EAAIP,eAAgB,EACnCyB,EAAQrO,EAAGhK,SAASmX,GACxBA,EAAI5V,OAAS+V,EACTtN,EAAGzH,KAAK8O,cAAcgH,EAAOG,GAAa,EAC5CpD,GAAO,IAAOpL,EAAGzH,KAAKgP,WAAW8G,EAAOG,EAAWJ,GAAc,IAEjEhD,GAAO,QAAU,EAAc,MAAQ,EAAc,KAAO,EAAU,IAExEpL,EAAG4M,cAAgBO,EAAIP,cAAgBoB,EACvC5C,GAAO,SAAW,EAAe,gBAAkB,EAAO,aAAe,EAAS,KAAO,EAAO,YAAc,EAAO,iBAAmB,EAAO,oBAAsB,EAAS,sBACtJ,IAApBpL,EAAGuM,cACLnB,GAAO,8DAAiFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,+BAAkC,EAAiB,QACjM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,iCAAqC,EAAiB,oBAE3DpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,gFACFpL,EAAG4M,eAAiBjB,IAGrBP,GADEpL,EAAGwK,MACE,wCAEA,8CAGPmB,IACFP,GAAO,YAETA,GAAO,QAELO,IACFP,GAAO,SAAmC,EAAU,iBAE/CA,IAGP,IAAIqM,GAAG,CAAC,SAASzjB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAAsBgN,EAAI4K,GACzC,IAQIxN,EAAQsa,EARRtM,EAAM,IAENG,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QANF9N,EAAGsL,MAQd,GAAe,KAAXtU,GAA6B,MAAXA,EAGlB0gB,EAFE1X,EAAGnC,QACLT,EAAS4C,EAAGwK,MACD,aAEXpN,GAAmC,IAA1B4C,EAAGhE,KAAK1G,OAAO8H,OACb,sBAER,CACL,IA4CM+P,EAEAE,EA9CFsK,EAAU3X,EAAG9B,WAAW8B,EAAGzI,OAAQP,EAASgJ,EAAGnC,QACnD,QAAgBlI,IAAZgiB,EAAuB,CACzB,IAGMxM,EAHFyM,EAAW5X,EAAG7K,gBAAgBqC,QAAQwI,EAAGzI,OAAQP,GACrD,GAA2B,QAAvBgJ,EAAG9D,KAAK2b,YAAuB,CACjC7X,EAAG1B,OAAOS,MAAM6Y,IACZzM,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,qDAAwEpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,sBAA0B1L,EAAGzH,KAAK6O,aAAapQ,GAAY,QAChM,IAArBgJ,EAAG9D,KAAKsQ,WACVpB,GAAO,0CAA+CpL,EAAGzH,KAAK6O,aAAapQ,GAAY,MAErFgJ,EAAG9D,KAAKuQ,UACVrB,GAAO,cAAiBpL,EAAGzH,KAAKqH,eAAe5I,GAAY,mCAAsCgJ,EAAa,WAAI,YAAc,EAAU,KAE5IoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAE/BmB,IACFP,GAAO,sBAEJ,CAAA,GAA2B,UAAvBpL,EAAG9D,KAAK2b,YAMjB,MAAM,IAAI7X,EAAG7K,gBAAgB6K,EAAGzI,OAAQP,EAAS4gB,GALjD5X,EAAG1B,OAAOkT,KAAKoG,GACXjM,IACFP,GAAO,sBAKN,CAAIuM,EAAQjY,SACbyN,EAAMnN,EAAGzH,KAAKc,KAAK2G,IACnBsL,QACA+B,EAAa,QAAUF,EAAI7B,MAC/B6B,EAAI7X,OAASqiB,EAAQriB,OACrB6X,EAAIpP,WAAa,GACjBoP,EAAInP,cAAgBhH,EAEpBoU,GAAO,IADKpL,EAAGhK,SAASmX,GAAKrJ,QAAQ,oBAAqB6T,EAAQvjB,MAC3C,IACnBuX,IACFP,GAAO,QAAU,EAAe,UAGlChO,GAA4B,IAAnBua,EAAQva,QAAoB4C,EAAGwK,QAA4B,IAAnBmN,EAAQva,OACzDsa,EAAWC,EAAQvjB,OAGvB,GAAIsjB,EAAU,EACRvM,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,GAEJA,GADEpL,EAAG9D,KAAKyT,YACH,IAAM,EAAa,eAEnB,IAAM,EAAa,KAE5BvE,GAAO,IAAM,EAAU,qBACH,MAAhBpL,EAAG/B,YACLmN,GAAO,MAASpL,EAAY,WAK9B,IAAI8X,EADJ1M,GAAO,OAFWG,EAAW,QAAWA,EAAW,GAAM,IAAM,cAEhC,OADPA,EAAWvL,EAAG+L,YAAYR,GAAY,sBACC,gBAG/D,GADAH,EAAMD,EAAWwB,MACbvP,EAAQ,CACV,IAAK4C,EAAGwK,MAAO,MAAM,IAAIrW,MAAM,0CAC3BwX,IACFP,GAAO,QAAU,EAAW,MAE9BA,GAAO,gBAAkB,EAAmB,KACxCO,IACFP,GAAO,IAAM,EAAW,aAE1BA,GAAO,4KACHO,IACFP,GAAO,IAAM,EAAW,cAE1BA,GAAO,MACHO,IACFP,GAAO,QAAU,EAAW,aAG9BA,GAAO,SAAW,EAAmB,uCAAyC,EAAa,0CAA4C,EAAa,wCAChJO,IACFP,GAAO,YAIb,OAAOA,IAGP,IAAI2M,GAAG,CAAC,SAAS/jB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA2BgN,EAAI4K,GAC9C,IAAIQ,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnBQ,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAQ9CuI,GANAjF,IACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,MAKxF,SAAWV,GAC1B,IAAKQ,EACH,GAAI7U,EAAQzC,OAASyL,EAAG9D,KAAKwa,cAAgB1W,EAAG1K,OAAOkP,YAAc1M,OAAO4J,KAAK1B,EAAG1K,OAAOkP,YAAYjQ,OAAQ,CAC7G,IAAIkiB,EAAY,GACZjJ,EAAOxW,EACX,GAAIwW,EAGF,IAFA,IAAI0C,EAAWyG,GAAM,EACnBhJ,EAAKH,EAAKjZ,OAAS,EACdoiB,EAAKhJ,GAAI,CACduC,EAAY1C,EAAKmJ,GAAM,GACvB,IAAIqB,EAAehY,EAAG1K,OAAOkP,WAAW0L,GAClC8H,IAAiBhY,EAAG9D,KAAK0R,eAAyC,iBAAhBoK,GAA+D,EAAnClgB,OAAO4J,KAAKsW,GAAczjB,SAAgC,IAAjByjB,EAAyBhY,EAAGzH,KAAKkP,eAAeuQ,EAAchY,EAAG/C,MAAMyH,QAClM+R,EAAUA,EAAUliB,QAAU2b,SAKhCuG,EAAYzf,EAGpB,GAAI6U,GAAW4K,EAAUliB,OAAQ,CAC/B,IAAI4b,EAAoBnQ,EAAG/B,UACzBga,EAAgBpM,GAA+B7L,EAAG9D,KAAKwa,cAA5BD,EAAUliB,OACrCyb,EAAiBhQ,EAAG9D,KAAK+T,cAC3B,GAAItE,EAEF,GADAP,GAAO,eAAiB,EAAS,KAC7B6M,EAAe,CACZpM,IACHT,GAAO,QAAU,EAAa,qBAAuB,EAAgB,MAEvE,IAEEoF,EAAmB,QADnBD,EAAgB,SAAWlF,EAAO,KADhCqC,EAAK,IAAMrC,GACgC,KACA,OAC3CrL,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAGzH,KAAKsP,YAAYsI,EAAmBI,EAAevQ,EAAG9D,KAAK6L,eAE/EqD,GAAO,QAAU,EAAW,YACxBS,IACFT,GAAO,cAAgB,EAAS,mBAAqB,EAAW,0CAA4C,EAAS,MAAQ,EAAW,oBAE1IA,GAAO,aAAe,EAAO,SAAW,EAAO,MAAQ,EAAa,YAAc,EAAO,SAAW,EAAW,MAAQ,EAAU,IAAM,EAAa,IAAM,EAAO,oBAC7J4E,IACF5E,GAAO,8CAAgD,EAAU,KAAO,EAAa,IAAM,EAAO,OAEpGA,GAAO,UAAY,EAAW,cAC1BS,IACFT,GAAO,UAGLD,EAAaA,GAAc,IACpBlG,KAFXmG,GAAO,UAAY,EAAW,UAG9BA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,yDAA4EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kCAAqC,EAAqB,QACnM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAELA,GADEpL,EAAG9D,KAAKuU,uBACH,yBAEA,oCAAuC,EAAqB,MAErErF,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,iBACF,CACLA,GAAO,SACP,IAAIsF,EAAO+F,EACX,GAAI/F,EAGF,IAFA,IAAkBhD,GAAM,EACtBkD,EAAKF,EAAKnc,OAAS,EACdmZ,EAAKkD,GAAI,CACdR,EAAeM,EAAKhD,GAAM,GACtBA,IACFtC,GAAO,QAITA,GAAO,SADLiF,EAAW9H,GADT+H,EAAQtQ,EAAGzH,KAAK4O,YAAYiJ,KAEF,kBAC1BJ,IACF5E,GAAO,8CAAgD,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAagJ,GAAiB,OAEnHhF,GAAO,gBAAkB,EAAS,MAASpL,EAAGzH,KAAKqH,eAAeI,EAAG9D,KAAK6L,aAAeqI,EAAeE,GAAU,OAGtHlF,GAAO,QACP,IAKID,EAJFqF,EAAmB,QADjBD,EAAgB,UAAYlF,GACe,OAC3CrL,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAG9D,KAAK6L,aAAe/H,EAAGzH,KAAKsP,YAAYsI,EAAmBI,GAAe,GAAQJ,EAAoB,MAAQI,IAE9HpF,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,yDAA4EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kCAAqC,EAAqB,QACnM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAELA,GADEpL,EAAG9D,KAAKuU,uBACH,yBAEA,oCAAuC,EAAqB,MAErErF,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,kBAGT,GAAI6M,EAAe,CACZpM,IACHT,GAAO,QAAU,EAAa,qBAAuB,EAAgB,MAEvE,IACEmF,EACAC,EAAmB,QADnBD,EAAgB,SAAWlF,EAAO,KADhCqC,EAAK,IAAMrC,GACgC,KACA,OAC3CrL,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAGzH,KAAKsP,YAAYsI,EAAmBI,EAAevQ,EAAG9D,KAAK6L,eAE3E8D,IACFT,GAAO,QAAU,EAAa,sBAAwB,EAAa,sBAC3C,IAApBpL,EAAGuM,cACLnB,GAAO,yDAA4EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kCAAqC,EAAqB,QACnM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAELA,GADEpL,EAAG9D,KAAKuU,uBACH,yBAEA,oCAAuC,EAAqB,MAErErF,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,0FAA4F,EAAa,sBAElHA,GAAO,aAAe,EAAO,SAAW,EAAO,MAAQ,EAAa,YAAc,EAAO,aAAe,EAAU,IAAM,EAAa,IAAM,EAAO,oBAC9I4E,IACF5E,GAAO,8CAAgD,EAAU,KAAO,EAAa,IAAM,EAAO,OAEpGA,GAAO,qBACiB,IAApBpL,EAAGuM,cACLnB,GAAO,yDAA4EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kCAAqC,EAAqB,QACnM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAELA,GADEpL,EAAG9D,KAAKuU,uBACH,yBAEA,oCAAuC,EAAqB,MAErErF,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,mFACHS,IACFT,GAAO,aAEJ,CACL,IAAI2L,EAAON,EACX,GAAIM,EAGF,IAFA,IAAI3G,EAAc4G,GAAM,EACtBC,EAAKF,EAAKxiB,OAAS,EACdyiB,EAAKC,GAAI,CACd7G,EAAe2G,EAAKC,GAAM,GAC1B,IAAI1G,EAAQtQ,EAAGzH,KAAK4O,YAAYiJ,GAC9BI,EAAmBxQ,EAAGzH,KAAK6O,aAAagJ,GACxCC,EAAW9H,EAAQ+H,EACjBtQ,EAAG9D,KAAKuU,yBACVzQ,EAAG/B,UAAY+B,EAAGzH,KAAK2P,QAAQiI,EAAmBC,EAAcpQ,EAAG9D,KAAK6L,eAE1EqD,GAAO,SAAW,EAAa,kBAC3B4E,IACF5E,GAAO,8CAAgD,EAAU,MAAUpL,EAAGzH,KAAK6O,aAAagJ,GAAiB,OAEnHhF,GAAO,qBACiB,IAApBpL,EAAGuM,cACLnB,GAAO,yDAA4EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kCAAqC,EAAqB,QACnM,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,gBAELA,GADEpL,EAAG9D,KAAKuU,uBACH,yBAEA,oCAAuC,EAAqB,MAErErF,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAETA,GAAO,kFAKfpL,EAAG/B,UAAYkS,OACNxE,IACTP,GAAO,gBAET,OAAOA,IAGP,IAAI8M,GAAG,CAAC,SAASlkB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA8BgN,EAAI4K,GACjD,IAsBMuN,EACFC,EAiBEjN,EAqBAuB,EA7DFtB,EAAM,IACNC,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAAOsV,GACpBa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UACzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EACnBQ,EAAU7L,EAAG9D,KAAKqM,OAASvR,GAAWA,EAAQuR,MAIhDuD,EAFED,GACFT,GAAO,cAAgB,EAAS,MAASpL,EAAGzH,KAAK+P,QAAQtR,EAAQuR,MAAOgD,EAAUvL,EAAG+L,aAAgB,KACtF,SAAWV,GAEXrU,EAmEjB,OAjEKA,GAAW6U,KAAoC,IAAxB7L,EAAG9D,KAAK8W,aAC9BnH,IACFT,GAAO,QAAU,EAAW,SAAW,EAAiB,iBAAmB,EAAiB,mBAAqB,EAAW,4BAA8B,EAAiB,kBAAsB,EAAW,qBAE9MA,GAAO,YAAc,EAAU,aAAe,EAAW,6BACrD+M,EAAYnY,EAAG1K,OAAOgV,OAAStK,EAAG1K,OAAOgV,MAAMlG,KACjDgU,EAAe9U,MAAMC,QAAQ4U,IAC1BA,GAA0B,UAAbA,GAAsC,SAAbA,GAAyBC,IAAgD,GAA/BD,EAAU1G,QAAQ,WAAgD,GAA9B0G,EAAU1G,QAAQ,UACzIrG,GAAO,uDAAyD,EAAU,QAAU,EAAU,WAAa,EAAW,iCAEtHA,GAAO,yDAA2D,EAAU,QAE5EA,GAAO,QAAWpL,EAAGzH,KADP,iBAAmB6f,EAAe,IAAM,KACnBD,EAAW,OAAQnY,EAAG9D,KAAKgK,eAAe,GAAS,eAClFkS,IACFhN,GAAO,sDAETA,GAAO,gDAAoD,EAAW,uEAExEA,GAAO,MACHS,IACFT,GAAO,UAGLD,EAAaA,GAAc,IACpBlG,KAFXmG,GAAO,SAAW,EAAW,UAG7BA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,4DAA+EpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,8BAC5I,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,mGAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,eAELA,GADES,EACK,kBAAoB,EAEpB,GAAK,EAEdT,GAAO,2CAA8CpL,EAAa,WAAI,YAAc,EAAU,KAEhGoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,MACHO,IACFP,GAAO,aAGLO,IACFP,GAAO,iBAGJA,IAGP,IAAIiN,GAAG,CAAC,SAASrkB,EAAQf,EAAOD,gBAElCC,EAAOD,QAAU,SAA2BgN,EAAI4K,GAC9C,IAAIQ,EAAM,GACNhO,GAA8B,IAArB4C,EAAG1K,OAAO8H,OACrBkb,EAAetY,EAAGzH,KAAKmP,qBAAqB1H,EAAG1K,OAAQ0K,EAAG/C,MAAMyH,IAAK,QACrEqF,EAAM/J,EAAG1M,KAAKmO,OAAOzB,EAAG1K,QAC1B,GAAI0K,EAAG9D,KAAK0R,eAAgB,CAC1B,IAAI2K,EAAcvY,EAAGzH,KAAKqP,mBAAmB5H,EAAG1K,OAAQ0K,EAAG/C,MAAMmI,UACjE,GAAImT,EAAa,CACf,IAAIC,EAAe,oBAAsBD,EACzC,GAA+B,QAA3BvY,EAAG9D,KAAK0R,eACP,MAAM,IAAIzZ,MAAMqkB,GADiBxY,EAAG1B,OAAOkT,KAAKgH,IAezD,GAXIxY,EAAGlC,QACLsN,GAAO,mBACHhO,IACF4C,EAAGwK,OAAQ,EACXY,GAAO,UAETA,GAAO,sFACHrB,IAAQ/J,EAAG9D,KAAKmB,YAAc2C,EAAG9D,KAAK0C,eACxCwM,GAAO,kBAA2BrB,EAAM,SAGpB,kBAAb/J,EAAG1K,SAAyBgjB,IAAgBtY,EAAG1K,OAAO4B,KAAO,CACtE,IACImU,EAAOrL,EAAGsL,MACVC,EAAWvL,EAAGwL,UACdxU,EAAUgJ,EAAG1K,OAHbsV,EAAW,gBAIXa,EAAczL,EAAGjC,WAAaiC,EAAGzH,KAAK4O,YAAYyD,GAClDc,EAAiB1L,EAAGhC,cAAgB,IAAM4M,EAC1Ce,GAAiB3L,EAAG9D,KAAK0P,UAEzBrD,EAAQ,QAAUgD,GAAY,IAC9BuC,EAAS,QAAUzC,EAgDvB,OA/CkB,IAAdrL,EAAG1K,QACD0K,EAAGlC,MACL6N,GAAgB,EAEhBP,GAAO,QAAU,EAAW,cAE1BD,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,6DAAiGpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,kBAC9J,IAArB1L,EAAG9D,KAAKsQ,WACVpB,GAAO,0CAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,mDAAsDpL,EAAa,WAAI,YAAc,EAAU,KAExGoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,gFAK/BY,GAFApL,EAAGlC,MACDV,EACK,iBAEA,yCAGF,QAAU,EAAW,YAG5B4C,EAAGlC,QACLsN,GAAO,yBAEFA,EAET,GAAIpL,EAAGlC,MAAO,CACZ,IAAI2a,EAAOzY,EAAGlC,MACZuN,EAAOrL,EAAGsL,MAAQ,EAClBC,EAAWvL,EAAGwL,UAAY,EAC1BjD,EAAQ,OAKV,GAJAvI,EAAG0Y,OAAS1Y,EAAG5I,QAAQO,SAASqI,EAAG1M,KAAKmO,OAAOzB,EAAGhE,KAAK1G,SACvD0K,EAAGzI,OAASyI,EAAGzI,QAAUyI,EAAG0Y,cACrB1Y,EAAGlC,MACVkC,EAAG+L,YAAc,CAAC,SACQpW,IAAtBqK,EAAG1K,OAAO6hB,SAAyBnX,EAAG9D,KAAK4a,aAAe9W,EAAG9D,KAAKyc,eAAgB,CACpF,IAAIC,EAAc,wCAClB,GAA+B,QAA3B5Y,EAAG9D,KAAKyc,eACP,MAAM,IAAIxkB,MAAMykB,GADiB5Y,EAAG1B,OAAOkT,KAAKoH,GAGvDxN,GAAO,wBACPA,GAAO,wBACPA,GAAO,qDACF,CACDC,EAAOrL,EAAGsL,MAEZ/C,EAAQ,SADRgD,EAAWvL,EAAGwL,YACgB,IAEhC,GADIzB,IAAK/J,EAAGzI,OAASyI,EAAG5I,QAAQK,IAAIuI,EAAGzI,OAAQwS,IAC3C3M,IAAW4C,EAAGwK,MAAO,MAAM,IAAIrW,MAAM,+BACzCiX,GAAO,aAAe,EAAS,aAEjC,IAgCQyN,EAhCJ/K,EAAS,QAAUzC,EACrBM,GAAiB3L,EAAG9D,KAAK0P,UACzBkN,EAAkB,GAClBC,EAAkB,GAEhBC,EAAchZ,EAAG1K,OAAO8O,KAC1BgU,EAAe9U,MAAMC,QAAQyV,GAa/B,GAZIA,GAAehZ,EAAG9D,KAAK+c,WAAmC,IAAvBjZ,EAAG1K,OAAO2jB,WAC3Cb,GACkC,GAAhCY,EAAYvH,QAAQ,UAAeuH,EAAcA,EAAY3T,OAAO,SAChD,QAAf2T,IACTA,EAAc,CAACA,EAAa,QAC5BZ,GAAe,IAGfA,GAAsC,GAAtBY,EAAYzkB,SAC9BykB,EAAcA,EAAY,GAC1BZ,GAAe,GAEbpY,EAAG1K,OAAO4B,MAAQohB,EAAc,CAClC,GAA0B,QAAtBtY,EAAG9D,KAAKgd,WACV,MAAM,IAAI/kB,MAAM,qDAAuD6L,EAAGhC,cAAgB,8BAC1D,IAAvBgC,EAAG9D,KAAKgd,aACjBZ,GAAe,EACftY,EAAG1B,OAAOkT,KAAK,6CAA+CxR,EAAGhC,cAAgB,MAMrF,GAHIgC,EAAG1K,OAAO6P,UAAYnF,EAAG9D,KAAKiJ,WAChCiG,GAAO,IAAOpL,EAAG/C,MAAMyH,IAAIS,SAAS/Q,KAAK4L,EAAI,aAE3CgZ,EAAa,CACXhZ,EAAG9D,KAAKid,cACNN,EAAiB7Y,EAAGzH,KAAKyO,cAAchH,EAAG9D,KAAKid,YAAaH,IAElE,IAAII,EAAcpZ,EAAG/C,MAAM0H,MAAMqU,GACjC,GAAIH,GAAkBT,IAAgC,IAAhBgB,GAAyBA,IAAgBC,EAAgBD,GAAe,CACxG3N,EAAczL,EAAGjC,WAAa,QAChC2N,EAAiB1L,EAAGhC,cAAgB,QAClCyN,EAAczL,EAAGjC,WAAa,QAChC2N,EAAiB1L,EAAGhC,cAAgB,QAGtC,GADAoN,GAAO,QAAWpL,EAAGzH,KADT6f,EAAe,iBAAmB,iBACXY,EAAazQ,EAAOvI,EAAG9D,KAAKgK,eAAe,GAAS,OACnF2S,EAAgB,CAClB,IAAIS,EAAY,WAAajO,EAC3BkO,EAAW,UAAYlO,EACzBD,GAAO,QAAU,EAAc,aAAe,EAAU,SAAW,EAAa,iBACrD,SAAvBpL,EAAG9D,KAAKid,cACV/N,GAAO,QAAU,EAAc,iCAAqC,EAAU,QAAU,EAAU,mBAAqB,EAAU,MAAQ,EAAU,QAAU,EAAc,aAAe,EAAU,SAAYpL,EAAGzH,KAAKwN,cAAc/F,EAAG1K,OAAO8O,KAAMmE,EAAOvI,EAAG9D,KAAKgK,eAAkB,KAAO,EAAa,MAAQ,EAAU,QAE/TkF,GAAO,QAAU,EAAa,qBAC9B,IAAIoC,EAAOqL,EACX,GAAIrL,EAGF,IAFA,IAAIgM,EAAO9L,GAAM,EACfC,EAAKH,EAAKjZ,OAAS,EACdmZ,EAAKC,GAEG,WADb6L,EAAQhM,EAAKE,GAAM,IAEjBtC,GAAO,aAAe,EAAc,mBAAuB,EAAc,kBAAsB,EAAa,WAAe,EAAU,cAAgB,EAAU,cAAgB,EAAa,UAC1K,UAAToO,GAA8B,WAATA,GAC9BpO,GAAO,aAAe,EAAc,oBAAwB,EAAU,iBAAmB,EAAc,mBAAuB,EAAU,OAAS,EAAU,QAAU,EAAU,IAClK,WAAToO,IACFpO,GAAO,SAAW,EAAU,SAE9BA,GAAO,MAAQ,EAAa,OAAS,EAAU,MAC7B,WAAToO,EACTpO,GAAO,aAAe,EAAU,mBAAuB,EAAU,aAAe,EAAU,cAAgB,EAAa,sBAAwB,EAAU,kBAAsB,EAAU,WAAa,EAAa,YACjM,QAAToO,EACTpO,GAAO,aAAe,EAAU,cAAkB,EAAU,aAAe,EAAU,eAAiB,EAAa,YACnF,SAAvBpL,EAAG9D,KAAKid,aAAmC,SAATK,IAC3CpO,GAAO,aAAe,EAAc,mBAAuB,EAAc,mBAAuB,EAAc,oBAAwB,EAAU,aAAe,EAAa,OAAS,EAAU,QAKjMD,EAAaA,GAAc,IACpBlG,KAFXmG,GAAO,cAGPA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,qDAAyFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,uBAE7KN,GADEgN,EACK,GAAMY,EAAYxY,KAAK,KAEvB,GAAK,EAEd4K,GAAO,QACkB,IAArBpL,EAAG9D,KAAKsQ,WACVpB,GAAO,0BAELA,GADEgN,EACK,GAAMY,EAAYxY,KAAK,KAEvB,GAAK,EAEd4K,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAET,IAAIsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,UAAY,EAAa,sBAChC,IAAIgE,EAAc7D,EAAW,QAAWA,EAAW,GAAM,IAAM,aAE/DH,GAAO,IAAM,EAAU,MAAQ,EAAa,KACvCG,IACHH,GAAO,OAAS,EAAgB,mBAElCA,GAAO,IAAM,EAAgB,KALLG,EAAWvL,EAAG+L,YAAYR,GAAY,sBAKH,OAAS,EAAa,WAC5E,EACDJ,EAAaA,GAAc,IACpBlG,KAAKmG,GAChBA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,qDAAyFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,uBAE7KN,GADEgN,EACK,GAAMY,EAAYxY,KAAK,KAEvB,GAAK,EAEd4K,GAAO,QACkB,IAArBpL,EAAG9D,KAAKsQ,WACVpB,GAAO,0BAELA,GADEgN,EACK,GAAMY,EAAYxY,KAAK,KAEvB,GAAK,EAEd4K,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAGrCY,GAAO,OAGX,GAAIpL,EAAG1K,OAAO4B,OAASohB,EACrBlN,GAAO,IAAOpL,EAAG/C,MAAMyH,IAAIxN,KAAK9C,KAAK4L,EAAI,QAAW,IAChD2L,IACFP,GAAO,qBAELA,GADEqN,EACK,IAEA,QAAU,EAEnBrN,GAAO,OACP2N,GAAmB,SAEhB,CACL,IAAIrI,EAAO1Q,EAAG/C,MACd,GAAIyT,EAGF,IAFA,IAAiBC,GAAM,EACrBC,EAAKF,EAAKnc,OAAS,EACdoc,EAAKC,GAEV,GAAIyI,EADJD,EAAc1I,EAAKC,GAAM,IACS,CAIhC,GAHIyI,EAAYhV,OACdgH,GAAO,QAAWpL,EAAGzH,KAAKwN,cAAcqT,EAAYhV,KAAMmE,EAAOvI,EAAG9D,KAAKgK,eAAkB,QAEzFlG,EAAG9D,KAAK4a,YACV,GAAwB,UAApBsC,EAAYhV,MAAoBpE,EAAG1K,OAAOkP,WAAY,CACxD,IAAIxN,EAAUgJ,EAAG1K,OAAOkP,WAEpBuS,EADYjf,OAAO4J,KAAK1K,GAE5B,GAAI+f,EAGF,IAFA,IAAI3G,EAAc4G,GAAM,EACtBC,EAAKF,EAAKxiB,OAAS,EACdyiB,EAAKC,GAAI,CAGd,QAAqBthB,KADjB8X,EAAOzW,EADXoZ,EAAe2G,EAAKC,GAAM,KAEjBG,QAAuB,CAC9B,IAAI/I,EAAY7F,EAAQvI,EAAGzH,KAAK4O,YAAYiJ,GAC5C,GAAIpQ,EAAG4M,eACL,GAAI5M,EAAG9D,KAAKyc,eAAgB,CACtBC,EAAc,2BAA6BxK,EAC/C,GAA+B,QAA3BpO,EAAG9D,KAAKyc,eACP,MAAM,IAAIxkB,MAAMykB,GADiB5Y,EAAG1B,OAAOkT,KAAKoH,SAIvDxN,GAAO,QAAU,EAAc,kBACJ,SAAvBpL,EAAG9D,KAAK4a,cACV1L,GAAO,OAAS,EAAc,gBAAkB,EAAc,YAEhEA,GAAO,MAAQ,EAAc,MAE3BA,GADyB,UAAvBpL,EAAG9D,KAAK4a,YACH,IAAO9W,EAAG5B,WAAWqP,EAAK0J,SAAY,IAEtC,IAAOzN,KAAKC,UAAU8D,EAAK0J,SAAY,IAEhD/L,GAAO,YAKV,GAAwB,SAApBgO,EAAYhV,MAAmBd,MAAMC,QAAQvD,EAAG1K,OAAOgV,OAAQ,CACxE,IAAI8M,EAAOpX,EAAG1K,OAAOgV,MACrB,GAAI8M,EAGF,IAFA,IAAI3J,EAAMC,GAAM,EACd4J,EAAKF,EAAK7iB,OAAS,EACdmZ,EAAK4J,GAEV,QAAqB3hB,KADrB8X,EAAO2J,EAAK1J,GAAM,IACTyJ,QAAuB,CAC1B/I,EAAY7F,EAAQ,IAAMmF,EAAK,IACnC,GAAI1N,EAAG4M,eACL,GAAI5M,EAAG9D,KAAKyc,eAAgB,CACtBC,EAAc,2BAA6BxK,EAC/C,GAA+B,QAA3BpO,EAAG9D,KAAKyc,eACP,MAAM,IAAIxkB,MAAMykB,GADiB5Y,EAAG1B,OAAOkT,KAAKoH,SAIvDxN,GAAO,QAAU,EAAc,kBACJ,SAAvBpL,EAAG9D,KAAK4a,cACV1L,GAAO,OAAS,EAAc,gBAAkB,EAAc,YAEhEA,GAAO,MAAQ,EAAc,MAE3BA,GADyB,UAAvBpL,EAAG9D,KAAK4a,YACH,IAAO9W,EAAG5B,WAAWqP,EAAK0J,SAAY,IAEtC,IAAOzN,KAAKC,UAAU8D,EAAK0J,SAAY,IAEhD/L,GAAO,MAOnB,IA2BQD,EA3BJsO,EAAOL,EAAY/U,MACvB,GAAIoV,EAGF,IAFA,IAKQpL,EAFNW,EAHS0K,GAAM,EACfC,EAAKF,EAAKllB,OAAS,EACdmlB,EAAKC,GAAI,EAEVC,EADJ5K,EAAQyK,EAAKC,GAAM,MAEbrL,EAAQW,EAAM5a,KAAK4L,EAAIgP,EAAM1O,QAAS8Y,EAAYhV,SAEpDgH,GAAO,IAAM,EAAU,IACnBO,IACFmN,GAAmB,MAMzBnN,IACFP,GAAO,IAAM,EAAoB,IACjC0N,EAAkB,IAEhBM,EAAYhV,OACdgH,GAAO,MACH4N,GAAeA,IAAgBI,EAAYhV,OAASyU,IAElDpN,EAAczL,EAAGjC,WAAa,QAChC2N,EAAiB1L,EAAGhC,cAAgB,SAClCmN,EAAaA,GAAc,IACpBlG,KAJXmG,GAAO,YAKPA,EAAM,IACkB,IAApBpL,EAAGuM,cACLnB,GAAO,qDAAyFpL,EAAY,UAAI,kBAAqBA,EAAGzH,KAAKqH,eAAe8L,GAAmB,uBAE7KN,GADEgN,EACK,GAAMY,EAAYxY,KAAK,KAEvB,GAAK,EAEd4K,GAAO,QACkB,IAArBpL,EAAG9D,KAAKsQ,WACVpB,GAAO,0BAELA,GADEgN,EACK,GAAMY,EAAYxY,KAAK,KAEvB,GAAK,EAEd4K,GAAO,MAELpL,EAAG9D,KAAKuQ,UACVrB,GAAO,6BAA+B,EAAgB,mCAAsCpL,EAAa,WAAI,YAAc,EAAU,KAEvIoL,GAAO,OAEPA,GAAO,OAELsB,EAAQtB,EACZA,EAAMD,EAAWwB,MAIbvB,IAHCpL,EAAG4M,eAAiBjB,EAEnB3L,EAAGwK,MACE,+BAAiC,EAAU,OAE3C,uBAAyB,EAAU,oBAGrC,cAAgB,EAAU,+EAEnCY,GAAO,QAGPO,IACFP,GAAO,mBAELA,GADEqN,EACK,IAEA,QAAU,EAEnBrN,GAAO,OACP2N,GAAmB,MAsB7B,SAASM,EAAgBD,GAEvB,IADA,IAAI/U,EAAQ+U,EAAY/U,MACfvQ,EAAI,EAAGA,EAAIuQ,EAAM9P,OAAQT,IAChC,GAAI8lB,EAAevV,EAAMvQ,IAAK,OAAO,EAGzC,SAAS8lB,EAAe5K,GACtB,YAAoCrZ,IAA7BqK,EAAG1K,OAAO0Z,EAAM1O,UAA2B0O,EAAM9J,YAG1D,SAAoC8J,GAElC,IADA,IAAI6K,EAAO7K,EAAM9J,WACRpR,EAAI,EAAGA,EAAI+lB,EAAKtlB,OAAQT,IAC/B,QAA2B6B,IAAvBqK,EAAG1K,OAAOukB,EAAK/lB,IAAmB,OAAO,EANuBgmB,CAA2B9K,GAQnG,OA/BIrD,IACFP,GAAO,IAAM,EAAoB,KAE/BqN,GACErb,GACFgO,GAAO,6CACPA,GAAO,+CAEPA,GAAO,+BACPA,GAAO,gCAETA,GAAO,wBAEPA,GAAO,QAAU,EAAW,sBAAwB,EAAS,IAkBxDA,IAGP,IAAI2O,GAAG,CAAC,SAAS/lB,EAAQf,EAAOD,gBAGlC,IAAIkW,EAAa,yBACbvK,EAAiB3K,EAAQ,kBACzBgmB,EAAmBhmB,EAAQ,uBAkI/B,SAASimB,EAAgB9Z,EAAY+Z,GACnCD,EAAgB/hB,OAAS,KACzB,IAAInB,EAAIxD,KAAK4mB,iBAAmB5mB,KAAK4mB,kBACF5mB,KAAKwI,QAAQie,GAAkB,GAElE,GAAIjjB,EAAEoJ,GAAa,OAAO,EAE1B,GADA8Z,EAAgB/hB,OAASnB,EAAEmB,OACvBgiB,EACF,MAAM,IAAI/lB,MAAM,yCAA4CZ,KAAKkN,WAAW1J,EAAEmB,SAE9E,OAAO,EA1IXjF,EAAOD,QAAU,CACfonB,IAcF,SAAoB9Z,EAASH,GAG3B,IAAIlD,EAAQ1J,KAAK0J,MACjB,GAAIA,EAAMmI,SAAS9E,GACjB,MAAM,IAAInM,MAAM,WAAamM,EAAU,uBAEzC,IAAK4I,EAAW9N,KAAKkF,GACnB,MAAM,IAAInM,MAAM,WAAamM,EAAU,8BAEzC,GAAIH,EAAY,CACd5M,KAAK0mB,gBAAgB9Z,GAAY,GAEjC,IAAI6F,EAAW7F,EAAWiE,KAC1B,GAAId,MAAMC,QAAQyC,GAChB,IAAK,IAAIlS,EAAE,EAAGA,EAAEkS,EAASzR,OAAQT,IAC/BumB,EAAS/Z,EAAS0F,EAASlS,GAAIqM,QAEjCka,EAAS/Z,EAAS0F,EAAU7F,GAG9B,IAAIqJ,EAAarJ,EAAWqJ,WACxBA,IACErJ,EAAWoI,OAAShV,KAAKkC,MAAM8S,QACjCiB,EAAa,CACXK,MAAO,CACLL,EACA,CAAEtS,KAAQ,qFAIhBiJ,EAAWF,eAAiB1M,KAAKwI,QAAQyN,GAAY,IAOzD,SAAS6Q,EAAS/Z,EAAS0F,EAAU7F,GAEnC,IADA,IAAIma,EACKxmB,EAAE,EAAGA,EAAEmJ,EAAM1I,OAAQT,IAAK,CACjC,IAAIymB,EAAKtd,EAAMnJ,GACf,GAAIymB,EAAGnW,MAAQ4B,EAAU,CACvBsU,EAAYC,EACZ,OAICD,GAEHrd,EAAMgI,KADNqV,EAAY,CAAElW,KAAM4B,EAAU3B,MAAO,KAIvC,IAAIvE,EAAO,CACTQ,QAASA,EACTH,WAAYA,EACZmF,QAAQ,EACRlR,KAAMuK,EACNuG,WAAY/E,EAAW+E,YAEzBoV,EAAUjW,MAAMY,KAAKnF,GACrB7C,EAAMqI,OAAOhF,GAAWR,EAG1B,OA7BA7C,EAAMmI,SAAS9E,GAAWrD,EAAMyH,IAAIpE,IAAW,EA6BxC/M,MA7EPwB,IAuFF,SAAoBuL,GAElB,IAAIR,EAAOvM,KAAK0J,MAAMqI,OAAOhF,GAC7B,OAAOR,EAAOA,EAAKK,WAAa5M,KAAK0J,MAAMmI,SAAS9E,KAAY,GAzFhEka,OAmGF,SAAuBla,GAErB,IAAIrD,EAAQ1J,KAAK0J,aACVA,EAAMmI,SAAS9E,UACfrD,EAAMyH,IAAIpE,UACVrD,EAAMqI,OAAOhF,GACpB,IAAK,IAAIxM,EAAE,EAAGA,EAAEmJ,EAAM1I,OAAQT,IAE5B,IADA,IAAIuQ,EAAQpH,EAAMnJ,GAAGuQ,MACZuF,EAAE,EAAGA,EAAEvF,EAAM9P,OAAQqV,IAC5B,GAAIvF,EAAMuF,GAAGtJ,SAAWA,EAAS,CAC/B+D,EAAM9G,OAAOqM,EAAG,GAChB,MAIN,OAAOrW,MAjHPyC,SAAUikB,IAyIV,CAACQ,sBAAsB,GAAGC,iBAAiB,KAAKC,GAAG,CAAC,SAAS3mB,EAAQf,EAAOD,GAC9EC,EAAOD,QAAQ,CACXgE,QAAW,0CACX+S,IAAO,iFACP6Q,YAAe,mEACfxW,KAAQ,SACRiG,SAAY,CAAE,SACd7F,WAAc,CACV+D,MAAS,CACLnE,KAAQ,SACRyF,MAAS,CACL,CAAEoH,OAAU,yBACZ,CAAEA,OAAU,mBAIxBiF,sBAAwB,IAG1B,IAAI2E,GAAG,CAAC,SAAS7mB,EAAQf,EAAOD,GAClCC,EAAOD,QAAQ,CACXgE,QAAW,0CACX+S,IAAO,0CACP+Q,MAAS,0BACT9Q,YAAe,CACX+Q,YAAe,CACX3W,KAAQ,QACRmO,SAAY,EACZjI,MAAS,CAAEpT,KAAQ,MAEvB8jB,mBAAsB,CAClB5W,KAAQ,UACRG,QAAW,GAEf0W,2BAA8B,CAC1B/I,MAAS,CACL,CAAEhb,KAAQ,oCACV,CAAEigB,QAAW,KAGrBlN,YAAe,CACXmI,KAAQ,CACJ,QACA,UACA,UACA,OACA,SACA,SACA,WAGR8I,YAAe,CACX9W,KAAQ,QACRkG,MAAS,CAAElG,KAAQ,UACnB4O,aAAe,EACfmE,QAAW,KAGnB/S,KAAQ,CAAC,SAAU,WACnBI,WAAc,CACVuF,IAAO,CACH3F,KAAQ,SACR6M,OAAU,iBAEdja,QAAW,CACPoN,KAAQ,SACR6M,OAAU,OAEd/Z,KAAQ,CACJkN,KAAQ,SACR6M,OAAU,iBAEd9L,SAAY,CACRf,KAAQ,UAEZ0W,MAAS,CACL1W,KAAQ,UAEZwW,YAAe,CACXxW,KAAQ,UAEZ+S,SAAW,EACXgE,SAAY,CACR/W,KAAQ,UACR+S,SAAW,GAEfiE,SAAY,CACRhX,KAAQ,QACRkG,OAAS,GAEbsI,WAAc,CACVxO,KAAQ,SACRiX,iBAAoB,GAExB/W,QAAW,CACPF,KAAQ,UAEZkX,iBAAoB,CAChBlX,KAAQ,UAEZG,QAAW,CACPH,KAAQ,UAEZiX,iBAAoB,CAChBjX,KAAQ,UAEZoO,UAAa,CAAEtb,KAAQ,oCACvBub,UAAa,CAAEvb,KAAQ,4CACvB4b,QAAW,CACP1O,KAAQ,SACR6M,OAAU,SAEd2D,gBAAmB,CAAE1d,KAAQ,KAC7BoT,MAAS,CACLT,MAAS,CACL,CAAE3S,KAAQ,KACV,CAAEA,KAAQ,8BAEdigB,SAAW,GAEf7E,SAAY,CAAEpb,KAAQ,oCACtBqb,SAAY,CAAErb,KAAQ,4CACtB8b,YAAe,CACX5O,KAAQ,UACR+S,SAAW,GAEfhF,SAAY,CAAEjb,KAAQ,KACtBwb,cAAiB,CAAExb,KAAQ,oCAC3Byb,cAAiB,CAAEzb,KAAQ,4CAC3BmT,SAAY,CAAEnT,KAAQ,6BACtBgf,qBAAwB,CAAEhf,KAAQ,KAClC8S,YAAe,CACX5F,KAAQ,SACR8R,qBAAwB,CAAEhf,KAAQ,KAClCigB,QAAW,IAEf3S,WAAc,CACVJ,KAAQ,SACR8R,qBAAwB,CAAEhf,KAAQ,KAClCigB,QAAW,IAEfpB,kBAAqB,CACjB3R,KAAQ,SACR8R,qBAAwB,CAAEhf,KAAQ,KAClC6b,cAAiB,CAAE9B,OAAU,SAC7BkG,QAAW,IAEf/W,aAAgB,CACZgE,KAAQ,SACR8R,qBAAwB,CACpBrM,MAAS,CACL,CAAE3S,KAAQ,KACV,CAAEA,KAAQ,gCAItB6b,cAAiB,CAAE7b,KAAQ,KAC3BuT,OAAS,EACT2H,KAAQ,CACJhO,KAAQ,QACRkG,OAAS,EACTiI,SAAY,EACZS,aAAe,GAEnB5O,KAAQ,CACJyF,MAAS,CACL,CAAE3S,KAAQ,6BACV,CACIkN,KAAQ,QACRkG,MAAS,CAAEpT,KAAQ,6BACnBqb,SAAY,EACZS,aAAe,KAI3B/B,OAAU,CAAE7M,KAAQ,UACpBmX,iBAAoB,CAAEnX,KAAQ,UAC9BoX,gBAAmB,CAAEpX,KAAQ,UAC7BiO,GAAM,CAACnb,KAAQ,KACfrB,KAAQ,CAACqB,KAAQ,KACjBukB,KAAQ,CAACvkB,KAAQ,KACjBgb,MAAS,CAAEhb,KAAQ,6BACnB2S,MAAS,CAAE3S,KAAQ,6BACnB2b,MAAS,CAAE3b,KAAQ,6BACnBkT,IAAO,CAAElT,KAAQ,MAErBigB,SAAW,IAGb,IAAIuE,GAAG,CAAC,SAAS1nB,EAAQf,EAAOD,gBAOlCC,EAAOD,QAAU,SAAS6I,EAAM3H,EAAGkV,GACjC,GAAIlV,IAAMkV,EAAG,OAAO,EAEpB,GAAIlV,GAAKkV,GAAiB,iBAALlV,GAA6B,iBAALkV,EAAe,CAC1D,GAAIlV,EAAE8D,cAAgBoR,EAAEpR,YAAa,OAAO,EAE5C,IAAIzD,EAAQT,EAAG4N,EACf,GAAI4B,MAAMC,QAAQrP,GAAI,CAEpB,IADAK,EAASL,EAAEK,SACG6U,EAAE7U,OAAQ,OAAO,EAC/B,IAAKT,EAAIS,EAAgB,GAART,KACf,IAAK+H,EAAM3H,EAAEJ,GAAIsV,EAAEtV,IAAK,OAAO,EACjC,OAAO,EAKT,GAAII,EAAE8D,cAAgBsD,OAAQ,OAAOpH,EAAEoJ,SAAW8L,EAAE9L,QAAUpJ,EAAEynB,QAAUvS,EAAEuS,MAC5E,GAAIznB,EAAE0nB,UAAY9jB,OAAOnD,UAAUinB,QAAS,OAAO1nB,EAAE0nB,YAAcxS,EAAEwS,UACrE,GAAI1nB,EAAE2nB,WAAa/jB,OAAOnD,UAAUknB,SAAU,OAAO3nB,EAAE2nB,aAAezS,EAAEyS,WAIxE,IADAtnB,GADAmN,EAAO5J,OAAO4J,KAAKxN,IACLK,UACCuD,OAAO4J,KAAK0H,GAAG7U,OAAQ,OAAO,EAE7C,IAAKT,EAAIS,EAAgB,GAART,KACf,IAAKgE,OAAOnD,UAAU4L,eAAejM,KAAK8U,EAAG1H,EAAK5N,IAAK,OAAO,EAEhE,IAAKA,EAAIS,EAAgB,GAART,KAAY,CAC3B,IAAIe,EAAM6M,EAAK5N,GAEf,IAAK+H,EAAM3H,EAAEW,GAAMuU,EAAEvU,IAAO,OAAO,EAGrC,OAAO,EAIT,OAAOX,GAAIA,GAAKkV,GAAIA,IAGpB,IAAI0S,GAAG,CAAC,SAAS9nB,EAAQf,EAAOD,gBAGlCC,EAAOD,QAAU,SAAUiT,EAAM/J,GAET,mBADTA,EAANA,GAAa,MACcA,EAAO,CAAE6f,IAAK7f,IAC9C,IAEiCnJ,EAF7BipB,EAAiC,kBAAhB9f,EAAK8f,QAAwB9f,EAAK8f,OAEnDD,EAAM7f,EAAK6f,MAAkBhpB,EAQ9BmJ,EAAK6f,IAPG,SAAUE,GACb,OAAO,SAAU/nB,EAAGkV,GAGhB,OAAOrW,EAFI,CAAE8B,IAAKX,EAAGY,MAAOmnB,EAAK/nB,IACtB,CAAEW,IAAKuU,EAAGtU,MAAOmnB,EAAK7S,QAMzC8S,EAAO,GACX,OAAO,SAAUvS,EAAWsS,GAKxB,GAJIA,GAAQA,EAAKE,QAAiC,mBAAhBF,EAAKE,SACnCF,EAAOA,EAAKE,eAGHxmB,IAATsmB,EAAJ,CACA,GAAmB,iBAARA,EAAkB,OAAOG,SAASH,GAAQ,GAAKA,EAAO,OACjE,GAAoB,iBAATA,EAAmB,OAAOvS,KAAKC,UAAUsS,GAGpD,GAAI3Y,MAAMC,QAAQ0Y,GAAO,CAErB,IADA7Q,EAAM,IACDtX,EAAI,EAAGA,EAAImoB,EAAK1nB,OAAQT,IACrBA,IAAGsX,GAAO,KACdA,GAAOzB,EAAUsS,EAAKnoB,KAAO,OAEjC,OAAOsX,EAAM,IAGjB,GAAa,OAAT6Q,EAAe,MAAO,OAE1B,IAA4B,IAAxBC,EAAKzK,QAAQwK,GAAc,CAC3B,GAAID,EAAQ,OAAOtS,KAAKC,UAAU,aAClC,MAAM,IAAI0S,UAAU,yCAMxB,IAHA,IAAIC,EAAYJ,EAAKjX,KAAKgX,GAAQ,EAC9Bva,EAAO5J,OAAO4J,KAAKua,GAAMM,KAAKR,GAAOA,EAAIE,IAC7C7Q,EAAM,GACDtX,EAAI,EAAGA,EAAI4N,EAAKnN,OAAQT,IAAK,CAC9B,IAAIe,EAAM6M,EAAK5N,GACXgB,EAAQ6U,EAAUsS,EAAKpnB,IAEtBC,IACDsW,IAAKA,GAAO,KAChBA,GAAO1B,KAAKC,UAAU9U,GAAO,IAAMC,GAGvC,OADAonB,EAAK3e,OAAO+e,EAAW,GAChB,IAAMlR,EAAM,KAtChB,CAuCJnF,KAGL,IAAIuW,GAAG,CAAC,SAASxoB,EAAQf,EAAOD,gBAGlC,IAAIkO,EAAWjO,EAAOD,QAAU,SAAUsC,EAAQ4G,EAAMugB,GAEnC,mBAARvgB,IACTugB,EAAKvgB,EACLA,EAAO,IAwDX,SAASwgB,EAAUxgB,EAAMygB,EAAKC,EAAMtnB,EAAQ+M,EAASC,EAAYC,EAAeC,EAAezC,EAAc0C,GAC3G,GAAInN,GAA2B,iBAAVA,IAAuBgO,MAAMC,QAAQjO,GAAS,CAEjE,IAAK,IAAIT,KADT8nB,EAAIrnB,EAAQ+M,EAASC,EAAYC,EAAeC,EAAezC,EAAc0C,GAC7DnN,EAAQ,CACtB,IAAIqB,EAAMrB,EAAOT,GACjB,GAAIyO,MAAMC,QAAQ5M,IAChB,GAAI9B,KAAOqM,EAAS2b,cAClB,IAAK,IAAI/oB,EAAE,EAAGA,EAAE6C,EAAIpC,OAAQT,IAC1B4oB,EAAUxgB,EAAMygB,EAAKC,EAAMjmB,EAAI7C,GAAIuO,EAAU,IAAMxN,EAAM,IAAMf,EAAGwO,EAAYD,EAASxN,EAAKS,EAAQxB,QAEnG,GAAIe,KAAOqM,EAAS4b,eACzB,GAAInmB,GAAqB,iBAAPA,EAChB,IAAK,IAAIwR,KAAQxR,EACf+lB,EAAUxgB,EAAMygB,EAAKC,EAAMjmB,EAAIwR,GAAO9F,EAAU,IAAMxN,EAAM,IAAoBsT,EAY/ErE,QAAQ,KAAM,MAAMA,QAAQ,MAAO,MAZmDxB,EAAYD,EAASxN,EAAKS,EAAQ6S,QAEpHtT,KAAOqM,EAASkE,UAAalJ,EAAKkG,WAAavN,KAAOqM,EAAS6b,gBACxEL,EAAUxgB,EAAMygB,EAAKC,EAAMjmB,EAAK0L,EAAU,IAAMxN,EAAKyN,EAAYD,EAASxN,EAAKS,GAGnFsnB,EAAKtnB,EAAQ+M,EAASC,EAAYC,EAAeC,EAAezC,EAAc0C,IApEhFia,CAAUxgB,EAHc,mBADxBugB,EAAKvgB,EAAKugB,IAAMA,GACsBA,EAAKA,EAAGE,KAAO,aAC1CF,EAAGG,MAAQ,aAEKtnB,EAAQ,GAAIA,IAIzC4L,EAASkE,SAAW,CAClBwP,iBAAiB,EACjBtK,OAAO,EACP6H,UAAU,EACV+D,sBAAsB,EACtBnD,eAAe,EACf3I,KAAK,GAGPlJ,EAAS2b,cAAgB,CACvBvS,OAAO,EACP4H,OAAO,EACPrI,OAAO,EACPgJ,OAAO,GAGT3R,EAAS4b,cAAgB,CACvB9S,aAAa,EACbxF,YAAY,EACZuR,mBAAmB,EACnB3V,cAAc,GAGhBc,EAAS6b,aAAe,CACtB5F,SAAS,EACT/E,MAAM,EACN3H,OAAO,EACPJ,UAAU,EACV/F,SAAS,EACTC,SAAS,EACT+W,kBAAkB,EAClBD,kBAAkB,EAClBzI,YAAY,EACZJ,WAAW,EACXC,WAAW,EACXK,SAAS,EACT7B,QAAQ,EACRqB,UAAU,EACVC,UAAU,EACVS,aAAa,EACbN,eAAe,EACfC,eAAe,IAgCf,IAAIqK,GAAG,CAAC,SAAShpB,EAAQf,EAAOD,GAEjC,IAAUK,EAAAA,EAITE,KAAM,SAAWP,gBAEnB,SAASiqB,IACL,IAAK,IAAIC,EAAOxf,UAAUnJ,OAAQ4oB,EAAO7Z,MAAM4Z,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IACzED,EAAKC,GAAQ1f,UAAU0f,GAG3B,GAAkB,EAAdD,EAAK5oB,OAAY,CACjB4oB,EAAK,GAAKA,EAAK,GAAGra,MAAM,GAAI,GAE5B,IADA,IAAIua,EAAKF,EAAK5oB,OAAS,EACd+oB,EAAI,EAAGA,EAAID,IAAMC,EACtBH,EAAKG,GAAKH,EAAKG,GAAGxa,MAAM,GAAI,GAGhC,OADAqa,EAAKE,GAAMF,EAAKE,GAAIva,MAAM,GACnBqa,EAAK3c,KAAK,IAEjB,OAAO2c,EAAK,GAGpB,SAASI,EAAOhkB,GACZ,MAAO,MAAQA,EAAM,IAEzB,SAASikB,EAAO3pB,GACZ,YAAa8B,IAAN9B,EAAkB,YAAoB,OAANA,EAAa,OAASiE,OAAOnD,UAAUknB,SAASvnB,KAAKT,GAAGoH,MAAM,KAAK0R,MAAM1R,MAAM,KAAKwiB,QAAQC,cAEvI,SAASC,EAAYpkB,GACjB,OAAOA,EAAIokB,cAef,SAASC,EAAUC,GACf,IAAIC,EAAU,WAEVC,EAAU,QAEVC,EAAWf,EAAMc,EAAS,YAI1BE,EAAeV,EAAOA,EAAO,UAAYS,EAAW,IAAMA,EAAWA,EAAW,IAAMA,EAAWA,GAAY,IAAMT,EAAO,cAAgBS,EAAW,IAAMA,EAAWA,GAAY,IAAMT,EAAO,IAAMS,EAAWA,IAGhNE,EAAe,sCACfC,EAAalB,EAFF,0BAEsBiB,GAGrCE,EAAaP,EAAQ,oBAAsB,KAE3CQ,EAAepB,EAAMa,EAASC,EAAS,iBAJvBF,EAAQ,8EAAgF,MAKpGS,EAAUf,EAAOO,EAAUb,EAAMa,EAASC,EAAS,eAAiB,KACpEQ,EAAYhB,EAAOA,EAAOU,EAAe,IAAMhB,EAAMoB,EAAcH,EAAc,UAAY,KAE7FM,GADajB,EAAOA,8DAAuIQ,GACtIR,EAAOA,oEAA6IQ,IAE7KU,EAAelB,EAAOiB,EAAqB,MAAQA,EAAqB,MAAQA,EAAqB,MAAQA,GACzGE,EAAOnB,EAAOS,EAAW,SACzBW,EAAQpB,EAAOA,EAAOmB,EAAO,MAAQA,GAAQ,IAAMD,GACnDG,EAAgBrB,EAAOA,EAAOmB,EAAO,OAAS,MAAQC,GAE1DE,EAAgBtB,EAAO,SAAWA,EAAOmB,EAAO,OAAS,MAAQC,GAEjEG,EAAgBvB,EAAOA,EAAOmB,GAAQ,UAAYnB,EAAOmB,EAAO,OAAS,MAAQC,GAEjFI,EAAgBxB,EAAOA,EAAOA,EAAOmB,EAAO,OAAS,QAAUA,GAAQ,UAAYnB,EAAOmB,EAAO,OAAS,MAAQC,GAElHK,EAAgBzB,EAAOA,EAAOA,EAAOmB,EAAO,OAAS,QAAUA,GAAQ,UAAYnB,EAAOmB,EAAO,OAAS,MAAQC,GAElHM,EAAgB1B,EAAOA,EAAOA,EAAOmB,EAAO,OAAS,QAAUA,GAAQ,UAAYA,EAAO,MAAQC,GAElGO,EAAgB3B,EAAOA,EAAOA,EAAOmB,EAAO,OAAS,QAAUA,GAAQ,UAAYC,GAEnFQ,EAAgB5B,EAAOA,EAAOA,EAAOmB,EAAO,OAAS,QAAUA,GAAQ,UAAYA,GAEnFU,EAAgB7B,EAAOA,EAAOA,EAAOmB,EAAO,OAAS,QAAUA,GAAQ,WAEvEW,EAAe9B,EAAO,CAACqB,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,GAAe5e,KAAK,MAC/J8e,EAAU/B,EAAOA,EAAOc,EAAe,IAAMJ,GAAgB,KAIjEsB,GAFahC,EAAO8B,EAAe,QAAUC,GAExB/B,EAAO8B,EAAe9B,EAAO,eAAiBS,EAAW,QAAUsB,IAExFE,EAAajC,EAAO,OAASS,EAAW,OAASf,EAAMoB,EAAcH,EAAc,SAAW,KAC1FuB,EAAclC,EAAO,MAAQA,EAAOgC,EAAqB,IAAMF,EAAe,IAAMG,GAAc,OAEtGE,EAAYnC,EAAOA,EAAOU,EAAe,IAAMhB,EAAMoB,EAAcH,IAAiB,KAChFyB,EAAQpC,EAAOkC,EAAc,IAAMhB,EAAe,MAAQiB,EAAY,KAAYA,GAClFE,EAAQrC,EAAOQ,EAAU,KACzB8B,EAAatC,EAAOA,EAAOgB,EAAY,KAAO,IAAMoB,EAAQpC,EAAO,MAAQqC,GAAS,KACpFE,EAASvC,EAAOU,EAAe,IAAMhB,EAAMoB,EAAcH,EAAc,aACvE6B,EAAWxC,EAAOuC,EAAS,KAC3BE,EAAczC,EAAOuC,EAAS,KAC9BG,EAAiB1C,EAAOA,EAAOU,EAAe,IAAMhB,EAAMoB,EAAcH,EAAc,UAAY,KAClGgC,EAAgB3C,EAAOA,EAAO,MAAQwC,GAAY,KAClDI,EAAiB5C,EAAO,MAAQA,EAAOyC,EAAcE,GAAiB,KAE1EE,EAAiB7C,EAAO0C,EAAiBC,GAEzCG,EAAiB9C,EAAOyC,EAAcE,GAEtCI,EAAc,MAAQR,EAAS,IAE3BS,GADQhD,EAAO2C,EAAgB,IAAMC,EAAiB,IAAMC,EAAiB,IAAMC,EAAiB,IAAMC,GACjG/C,EAAOA,EAAOuC,EAAS,IAAM7C,EAAM,WAAYmB,IAAe,MACvEoC,EAAYjD,EAAOA,EAAOuC,EAAS,aAAe,KAClDW,EAAalD,EAAOA,EAAO,SAAWsC,EAAaK,GAAiB,IAAMC,EAAiB,IAAME,EAAiB,IAAMC,GACxHI,EAAOnD,EAAOe,EAAU,MAAQmC,EAAalD,EAAO,MAAQgD,GAAU,IAAMhD,EAAO,MAAQiD,GAAa,KACxGG,EAAiBpD,EAAOA,EAAO,SAAWsC,EAAaK,GAAiB,IAAMC,EAAiB,IAAMC,EAAiB,IAAME,GAC5HM,EAAYrD,EAAOoD,EAAiBpD,EAAO,MAAQgD,GAAU,IAAMhD,EAAO,MAAQiD,GAAa,KAC9EjD,EAAOmD,EAAO,IAAME,GACrBrD,EAAOe,EAAU,MAAQmC,EAAalD,EAAO,MAAQgD,GAAU,KACtChD,EAAOA,EAAO,UAAYA,EAAO,IAAMgB,EAAY,MAAQ,KAAOoB,EAAQ,IAAMpC,EAAO,OAASqC,EAAQ,KAAO,MAAQ,KAAOM,EAAgB,IAAMC,EAAiB,IAAME,EAAiB,IAAMC,EAAc,KAAO/C,EAAO,OAASgD,EAAS,KAAahD,EAAO,OAASiD,EAAY,KACvSjD,EAAOA,EAAO,UAAYA,EAAO,IAAMgB,EAAY,MAAQ,KAAOoB,EAAQ,IAAMpC,EAAO,OAASqC,EAAQ,KAAO,MAAQ,KAAOM,EAAgB,IAAMC,EAAiB,IAAMC,EAAiB,IAAME,EAAc,KAAO/C,EAAO,OAASgD,EAAS,KAAahD,EAAO,OAASiD,EAAY,KAC1QjD,EAAOA,EAAO,UAAYA,EAAO,IAAMgB,EAAY,MAAQ,KAAOoB,EAAQ,IAAMpC,EAAO,OAASqC,EAAQ,KAAO,MAAQ,KAAOM,EAAgB,IAAMC,EAAiB,IAAME,EAAiB,IAAMC,EAAc,KAAO/C,EAAO,OAASgD,EAAS,KACrQhD,EAAO,OAASiD,EAAY,KAC1BjD,EAAO,IAAMgB,EAAY,MAA6BhB,EAAO,OAASqC,EAAQ,KACzG,MAAO,CACHiB,WAAY,IAAIvlB,OAAO2hB,EAAM,MAAOa,EAASC,EAAS,eAAgB,KACtE+C,aAAc,IAAIxlB,OAAO2hB,EAAM,YAAaoB,EAAcH,GAAe,KACzE6C,SAAU,IAAIzlB,OAAO2hB,EAAM,kBAAmBoB,EAAcH,GAAe,KAC3E8C,SAAU,IAAI1lB,OAAO2hB,EAAM,kBAAmBoB,EAAcH,GAAe,KAC3E+C,kBAAmB,IAAI3lB,OAAO2hB,EAAM,eAAgBoB,EAAcH,GAAe,KACjFgD,UAAW,IAAI5lB,OAAO2hB,EAAM,SAAUoB,EAAcH,EAAc,iBAAkBE,GAAa,KACjG+C,aAAc,IAAI7lB,OAAO2hB,EAAM,SAAUoB,EAAcH,EAAc,kBAAmB,KACxFkD,OAAQ,IAAI9lB,OAAO2hB,EAAM,MAAOoB,EAAcH,GAAe,KAC7DmD,WAAY,IAAI/lB,OAAO+iB,EAAc,KACrCiD,YAAa,IAAIhmB,OAAO2hB,EAAM,SAAUoB,EAAcF,GAAa,KACnEoD,YAAa,IAAIjmB,OAAO2iB,EAAc,KACtCuD,YAAa,IAAIlmB,OAAO,KAAOmjB,EAAe,MAC9CgD,YAAa,IAAInmB,OAAO,SAAW+jB,EAAe,IAAM9B,EAAOA,EAAO,eAAiBS,EAAW,QAAU,IAAMsB,EAAU,KAAO,WAG3I,IAAIoC,EAAe9D,GAAU,GAEzB+D,EAAe/D,GAAU,GAEzBgE,EA2BK,SAAUjhB,EAAK7M,GACpB,GAAIwP,MAAMC,QAAQ5C,GAChB,OAAOA,EACF,GAAIkhB,OAAOC,YAAYhqB,OAAO6I,GACnC,OA9BJ,SAAuBA,EAAK7M,GAC1B,IAAIiuB,EAAO,GACPC,GAAK,EACLC,GAAK,EACLC,OAAKvsB,EAET,IACE,IAAK,IAAiCwsB,EAA7BC,EAAKzhB,EAAIkhB,OAAOC,cAAmBE,GAAMG,EAAKC,EAAGC,QAAQC,QAChEP,EAAK9c,KAAKkd,EAAGrtB,QAEThB,GAAKiuB,EAAKxtB,SAAWT,GAH8CkuB,GAAK,IAK9E,MAAOO,GACPN,GAAK,EACLC,EAAKK,EACL,QACA,KACOP,GAAMI,EAAW,QAAGA,EAAW,SACpC,QACA,GAAIH,EAAI,MAAMC,GAIlB,OAAOH,EAOES,CAAc7hB,EAAK7M,GAE1B,MAAM,IAAIuoB,UAAU,yDA6BtBoG,EAAS,WAaTC,EAAgB,QAChBC,EAAgB,aAChBC,EAAkB,4BAGlB1qB,EAAS,CACZ2qB,SAAY,kDACZC,YAAa,iDACbC,gBAAiB,iBAKdC,EAAQnW,KAAKmW,MACbC,EAAqBC,OAAOC,aAUhC,SAASC,EAAQhf,GAChB,MAAM,IAAIif,WAAWnrB,EAAOkM,IA8B7B,SAASkf,EAAUC,EAAQC,GAC1B,IAAIzgB,EAAQwgB,EAAOtoB,MAAM,KACrBuC,EAAS,GAWb,OAVmB,EAAfuF,EAAMxO,SAGTiJ,EAASuF,EAAM,GAAK,IACpBwgB,EAASxgB,EAAM,IAMTvF,EAhCR,SAAamJ,EAAO6c,GAGnB,IAFA,IAAIhmB,EAAS,GACTjJ,EAASoS,EAAMpS,OACZA,KACNiJ,EAAOjJ,GAAUivB,EAAG7c,EAAMpS,IAE3B,OAAOiJ,EAyBOsH,EAFdye,EAASA,EAAOzf,QAAQ8e,EAAiB,MACrB3nB,MAAM,KACAuoB,GAAIhjB,KAAK,KAiBpC,SAASijB,EAAWF,GAInB,IAHA,IAAIG,EAAS,GACTC,EAAU,EACVpvB,EAASgvB,EAAOhvB,OACbovB,EAAUpvB,GAAQ,CACxB,IAGKqvB,EAHD9uB,EAAQyuB,EAAO1d,WAAW8d,KACjB,OAAT7uB,GAAmBA,GAAS,OAAU6uB,EAAUpvB,EAG3B,QAAX,OADTqvB,EAAQL,EAAO1d,WAAW8d,OAG7BD,EAAOze,OAAe,KAARnQ,IAAkB,KAAe,KAAR8uB,GAAiB,QAIxDF,EAAOze,KAAKnQ,GACZ6uB,KAGDD,EAAOze,KAAKnQ,GAGd,OAAO4uB,EAgDW,SAAfG,EAAqCC,EAAOC,GAG/C,OAAOD,EAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARC,IAAc,GAQ7C,SAARC,EAAuBC,EAAOC,EAAWC,GAC5C,IAAInf,EAAI,EAGR,IAFAif,EAAQE,EAAYnB,EAAMiB,EA7KhB,KA6KgCA,GAAS,EACnDA,GAASjB,EAAMiB,EAAQC,GACeE,IAARH,EAAmCjf,GAnLvD,GAoLTif,EAAQjB,EAAMiB,EA9JII,IAgKnB,OAAOrB,EAAMhe,EAAI,GAAsBif,GAASA,EAnLtC,KA6LE,SAATK,EAAyBC,GAE5B,IAAIb,EAAS,GACTc,EAAcD,EAAMhwB,OACpBT,EAAI,EACJH,EA/LU,IAgMV8wB,EAjMa,GAuMbC,EAAQH,EAAMI,YArMH,KAsMXD,EAAQ,IACXA,EAAQ,GAGT,IAAK,IAAI9a,EAAI,EAAGA,EAAI8a,IAAS9a,EAED,KAAvB2a,EAAM1e,WAAW+D,IACpBwZ,EAAQ,aAETM,EAAOze,KAAKsf,EAAM1e,WAAW+D,IAM9B,IAAK,IAhFmCgb,EAgF/BloB,EAAgB,EAARgoB,EAAYA,EAAQ,EAAI,EAAGhoB,EAAQ8nB,GAAuC,CAQ1F,IADA,IAAIK,EAAO/wB,EACFgxB,EAAI,EAAG9f,EApOP,IAoOoCA,GApOpC,GAoO+C,CAE1Cwf,GAAT9nB,GACH0mB,EAAQ,iBAGT,IAAIU,GA9FkCc,EA8FbL,EAAM1e,WAAWnJ,MA7F5B,GAAO,GACfkoB,EAAY,GAEhBA,EAAY,GAAO,GACfA,EAAY,GAEhBA,EAAY,GAAO,GACfA,EAAY,GApJV,IAAA,IA4OJd,GAAiBA,EAAQd,GAAOP,EAAS3uB,GAAKgxB,KACjD1B,EAAQ,YAGTtvB,GAAKgwB,EAAQgB,EACb,IAAIlxB,EAAIoR,GAAKyf,EAhPL,EAgPwBA,EA/OxB,IA+OmBzf,EA/OnB,GA+O6CA,EAAIyf,EAEzD,GAAIX,EAAQlwB,EACX,MAGD,IAAImxB,EAvPI,GAuPgBnxB,EACpBkxB,EAAI9B,EAAMP,EAASsC,IACtB3B,EAAQ,YAGT0B,GAAKC,EAGN,IAAI3Z,EAAMsY,EAAOnvB,OAAS,EAC1BkwB,EAAOT,EAAMlwB,EAAI+wB,EAAMzZ,EAAa,GAARyZ,GAIxB7B,EAAMlvB,EAAIsX,GAAOqX,EAAS9uB,GAC7ByvB,EAAQ,YAGTzvB,GAAKqvB,EAAMlvB,EAAIsX,GACftX,GAAKsX,EAGLsY,EAAOnmB,OAAOzJ,IAAK,EAAGH,GAGvB,OAAOuvB,OAAO8B,cAAcvnB,MAAMylB,OAAQQ,GAU9B,SAATuB,EAAyBV,GAC5B,IAAIb,EAAS,GAMTc,GAHJD,EAAQd,EAAWc,IAGKhwB,OAGpBZ,EA7RU,IA8RVswB,EAAQ,EACRQ,EAhSa,GAmSbS,GAA4B,EAC5BC,GAAoB,EACpBC,OAAiBzvB,EAErB,IACC,IAAK,IAA0C0vB,EAAtCC,EAAYf,EAAM1C,OAAOC,cAAsBoD,GAA6BG,EAAQC,EAAUjD,QAAQC,MAAO4C,GAA4B,EAAM,CACvJ,IAAIK,EAAiBF,EAAMvwB,MAEvBywB,EAAiB,KACpB7B,EAAOze,KAAKge,EAAmBsC,KAGhC,MAAOhD,GACR4C,GAAoB,EACpBC,EAAiB7C,EAChB,QACD,KACM2C,GAA6BI,EAAUE,QAC3CF,EAAUE,SAEV,QACD,GAAIL,EACH,MAAMC,GAKT,IAAIK,EAAc/B,EAAOnvB,OACrBmxB,EAAiBD,EAWrB,IALIA,GACH/B,EAAOze,KApUO,KAwURygB,EAAiBlB,GAAa,CAIpC,IAAImB,EAAIlD,EACJmD,GAA6B,EAC7BC,GAAqB,EACrBC,OAAkBnwB,EAEtB,IACC,IAAK,IAA2CowB,EAAvCC,EAAazB,EAAM1C,OAAOC,cAAuB8D,GAA8BG,EAASC,EAAW3D,QAAQC,MAAOsD,GAA6B,EAAM,CAC7J,IAAIK,EAAeF,EAAOjxB,MAENnB,GAAhBsyB,GAAqBA,EAAeN,IACvCA,EAAIM,IAML,MAAO1D,GACRsD,GAAqB,EACrBC,EAAkBvD,EACjB,QACD,KACMqD,GAA8BI,EAAWR,QAC7CQ,EAAWR,SAEX,QACD,GAAIK,EACH,MAAMC,GAKT,IAAII,EAAwBR,EAAiB,EACzCC,EAAIhyB,EAAIqvB,GAAOP,EAASwB,GAASiC,IACpC9C,EAAQ,YAGTa,IAAU0B,EAAIhyB,GAAKuyB,EACnBvyB,EAAIgyB,EAEJ,IAAIQ,GAA6B,EAC7BC,GAAqB,EACrBC,OAAkB1wB,EAEtB,IACC,IAAK,IAA2C2wB,EAAvCC,EAAahC,EAAM1C,OAAOC,cAAuBqE,GAA8BG,EAASC,EAAWlE,QAAQC,MAAO6D,GAA6B,EAAM,CAC7J,IAAIK,EAAgBF,EAAOxxB,MAK3B,GAHI0xB,EAAgB7yB,KAAOswB,EAAQxB,GAClCW,EAAQ,YAELoD,GAAiB7yB,EAAG,CAGvB,IADA,IAAI8yB,EAAIxC,EACCjf,EAxYH,IAwYgCA,GAxYhC,GAwY2C,CAChD,IAAIpR,EAAIoR,GAAKyf,EAxYR,EAwY2BA,EAvY3B,IAuYsBzf,EAvYtB,GAuYgDA,EAAIyf,EACzD,GAAIgC,EAAI7yB,EACP,MAED,IAAI8yB,EAAUD,EAAI7yB,EACdmxB,EA9YC,GA8YmBnxB,EACxB8vB,EAAOze,KAAKge,EAAmBY,EAAajwB,EAAI8yB,EAAU3B,EAAY,KACtE0B,EAAIzD,EAAM0D,EAAU3B,GAGrBrB,EAAOze,KAAKge,EAAmBY,EAAa4C,EAAG,KAC/ChC,EAAOT,EAAMC,EAAOiC,EAAuBR,GAAkBD,GAC7DxB,EAAQ,IACNyB,IAGH,MAAOnD,GACR6D,GAAqB,EACrBC,EAAkB9D,EACjB,QACD,KACM4D,GAA8BI,EAAWf,QAC7Ce,EAAWf,SAEX,QACD,GAAIY,EACH,MAAMC,KAKPpC,IACAtwB,EAEH,OAAO+vB,EAAOljB,KAAK,IA5SpB,IAoVImmB,EAAW,CAMdC,QAAW,QAQXC,KAAQ,CACPvC,OAAUb,EACVwB,OApWe,SAAoBte,GACpC,OAAOuc,OAAO8B,cAAcvnB,MAAMylB,OA/IX,SAAUviB,GAChC,GAAI2C,MAAMC,QAAQ5C,GAAM,CACtB,IAAK,IAAI7M,EAAI,EAAG4c,EAAOpN,MAAM3C,EAAIpM,QAAST,EAAI6M,EAAIpM,OAAQT,IAAK4c,EAAK5c,GAAK6M,EAAI7M,GAE7E,OAAO4c,EAEP,OAAOpN,MAAMwjB,KAAKnmB,GAyIqBomB,CAAkBpgB,MAqW5D2d,OAAUA,EACVW,OAAUA,EACV+B,QA7Ba,SAAiBzC,GAC9B,OAAOjB,EAAUiB,EAAO,SAAUhB,GACjC,OAAOZ,EAAcvnB,KAAKmoB,GAAU,OAAS0B,EAAO1B,GAAUA,KA4B/D0D,UA/Ce,SAAmB1C,GAClC,OAAOjB,EAAUiB,EAAO,SAAUhB,GACjC,OAAOb,EAActnB,KAAKmoB,GAAUe,EAAOf,EAAOzgB,MAAM,GAAG4a,eAAiB6F,MAkF1E2D,EAAU,GACd,SAASC,EAAWC,GAChB,IAAIrzB,EAAIqzB,EAAIvhB,WAAW,GAGvB,OADI9R,EAAI,GAAQ,KAAOA,EAAE8nB,SAAS,IAAI8B,cAAuB5pB,EAAI,IAAS,IAAMA,EAAE8nB,SAAS,IAAI8B,cAAuB5pB,EAAI,KAAU,KAAOA,GAAK,EAAI,KAAK8nB,SAAS,IAAI8B,cAAgB,KAAW,GAAJ5pB,EAAS,KAAK8nB,SAAS,IAAI8B,cAAuB,KAAO5pB,GAAK,GAAK,KAAK8nB,SAAS,IAAI8B,cAAgB,KAAO5pB,GAAK,EAAI,GAAK,KAAK8nB,SAAS,IAAI8B,cAAgB,KAAW,GAAJ5pB,EAAS,KAAK8nB,SAAS,IAAI8B,cAG/X,SAAS0J,EAAY9tB,GAIjB,IAHA,IAAI+tB,EAAS,GACTxzB,EAAI,EACJyzB,EAAKhuB,EAAIhF,OACNT,EAAIyzB,GAAI,CACX,IAMYC,EAQAC,EACAC,EAfR3zB,EAAI4zB,SAASpuB,EAAIquB,OAAO9zB,EAAI,EAAG,GAAI,IACnCC,EAAI,KACJuzB,GAAUpE,OAAOC,aAAapvB,GAC9BD,GAAK,GACO,KAALC,GAAYA,EAAI,KACT,GAAVwzB,EAAKzzB,GACD0zB,EAAKG,SAASpuB,EAAIquB,OAAO9zB,EAAI,EAAG,GAAI,IACxCwzB,GAAUpE,OAAOC,cAAkB,GAAJpvB,IAAW,EAAS,GAALyzB,IAE9CF,GAAU/tB,EAAIquB,OAAO9zB,EAAG,GAE5BA,GAAK,GACO,KAALC,GACO,GAAVwzB,EAAKzzB,GACD2zB,EAAKE,SAASpuB,EAAIquB,OAAO9zB,EAAI,EAAG,GAAI,IACpC4zB,EAAKC,SAASpuB,EAAIquB,OAAO9zB,EAAI,EAAG,GAAI,IACxCwzB,GAAUpE,OAAOC,cAAkB,GAAJpvB,IAAW,IAAW,GAAL0zB,IAAY,EAAS,GAALC,IAEhEJ,GAAU/tB,EAAIquB,OAAO9zB,EAAG,GAE5BA,GAAK,IAELwzB,GAAU/tB,EAAIquB,OAAO9zB,EAAG,GACxBA,GAAK,GAGb,OAAOwzB,EAEX,SAASO,EAA4BC,EAAYC,GAC7C,SAASC,EAAiBzuB,GACtB,IAAI0uB,EAASZ,EAAY9tB,GACzB,OAAQ0uB,EAAOxuB,MAAMsuB,EAAS1G,YAAoB4G,EAAN1uB,EAQhD,OANIuuB,EAAWI,SAAQJ,EAAWI,OAAShF,OAAO4E,EAAWI,QAAQpkB,QAAQikB,EAASxG,YAAayG,GAAkBtK,cAAc5Z,QAAQikB,EAASlH,WAAY,UACpIlrB,IAAxBmyB,EAAWK,WAAwBL,EAAWK,SAAWjF,OAAO4E,EAAWK,UAAUrkB,QAAQikB,EAASxG,YAAayG,GAAkBlkB,QAAQikB,EAASjH,aAAcqG,GAAYrjB,QAAQikB,EAASxG,YAAa5D,SAC1LhoB,IAApBmyB,EAAWM,OAAoBN,EAAWM,KAAOlF,OAAO4E,EAAWM,MAAMtkB,QAAQikB,EAASxG,YAAayG,GAAkBtK,cAAc5Z,QAAQikB,EAAShH,SAAUoG,GAAYrjB,QAAQikB,EAASxG,YAAa5D,SACxLhoB,IAApBmyB,EAAW1f,OAAoB0f,EAAW1f,KAAO8a,OAAO4E,EAAW1f,MAAMtE,QAAQikB,EAASxG,YAAayG,GAAkBlkB,QAAQgkB,EAAWI,OAASH,EAAS/G,SAAW+G,EAAS9G,kBAAmBkG,GAAYrjB,QAAQikB,EAASxG,YAAa5D,SAC1NhoB,IAArBmyB,EAAWO,QAAqBP,EAAWO,MAAQnF,OAAO4E,EAAWO,OAAOvkB,QAAQikB,EAASxG,YAAayG,GAAkBlkB,QAAQikB,EAAS7G,UAAWiG,GAAYrjB,QAAQikB,EAASxG,YAAa5D,SAC1KhoB,IAAxBmyB,EAAWjlB,WAAwBilB,EAAWjlB,SAAWqgB,OAAO4E,EAAWjlB,UAAUiB,QAAQikB,EAASxG,YAAayG,GAAkBlkB,QAAQikB,EAAS5G,aAAcgG,GAAYrjB,QAAQikB,EAASxG,YAAa5D,IAC3MmK,EAGX,SAASQ,EAAmB/uB,GACxB,OAAOA,EAAIuK,QAAQ,UAAW,OAAS,IAE3C,SAASykB,EAAeH,EAAML,GAC1B,IAAIvuB,EAAU4uB,EAAK3uB,MAAMsuB,EAASvG,cAAgB,GAG9CgH,EADW5G,EAAcpoB,EAAS,GACf,GAEvB,OAAIgvB,EACOA,EAAQvtB,MAAM,KAAK6J,IAAIwjB,GAAoB9nB,KAAK,KAEhD4nB,EAGf,SAASK,EAAeL,EAAML,GAC1B,IAAIvuB,EAAU4uB,EAAK3uB,MAAMsuB,EAAStG,cAAgB,GAE9CiH,EAAY9G,EAAcpoB,EAAS,GACnCgvB,EAAUE,EAAU,GACpBC,EAAOD,EAAU,GAErB,GAAIF,EAAS,CAYT,IAXA,IAAII,EAAwBJ,EAAQ9K,cAAcziB,MAAM,MAAM4tB,UAC1DC,EAAyBlH,EAAcgH,EAAuB,GAC9DG,EAAOD,EAAuB,GAC9BE,EAAQF,EAAuB,GAE/BG,EAAcD,EAAQA,EAAM/tB,MAAM,KAAK6J,IAAIwjB,GAAsB,GACjEY,EAAaH,EAAK9tB,MAAM,KAAK6J,IAAIwjB,GACjCa,EAAyBpB,EAASvG,YAAYpmB,KAAK8tB,EAAWA,EAAW30B,OAAS,IAClF60B,EAAaD,EAAyB,EAAI,EAC1CE,EAAkBH,EAAW30B,OAAS60B,EACtCE,EAAShmB,MAAM8lB,GACV9L,EAAI,EAAGA,EAAI8L,IAAc9L,EAC9BgM,EAAOhM,GAAK2L,EAAY3L,IAAM4L,EAAWG,EAAkB/L,IAAM,GAEjE6L,IACAG,EAAOF,EAAa,GAAKb,EAAee,EAAOF,EAAa,GAAIrB,IAEpE,IAgBQwB,EACAC,EANJC,EAXgBH,EAAOI,OAAO,SAAUC,EAAKC,EAAOltB,GACpD,IACQmtB,EAOR,OARKD,GAAmB,MAAVA,KACNC,EAAcF,EAAIA,EAAIp1B,OAAS,KAChBs1B,EAAYntB,MAAQmtB,EAAYt1B,SAAWmI,EAC1DmtB,EAAYt1B,SAEZo1B,EAAI1kB,KAAK,CAAEvI,MAAOA,EAAOnI,OAAQ,KAGlCo1B,GACR,IACmCpN,KAAK,SAAUroB,EAAGkV,GACpD,OAAOA,EAAE7U,OAASL,EAAEK,SACrB,GACCu1B,OAAU,EAWd,OAPIA,EAHAL,GAAgD,EAA3BA,EAAkBl1B,QACnCg1B,EAAWD,EAAOxmB,MAAM,EAAG2mB,EAAkB/sB,OAC7C8sB,EAAUF,EAAOxmB,MAAM2mB,EAAkB/sB,MAAQ+sB,EAAkBl1B,QAC7Dg1B,EAAS/oB,KAAK,KAAO,KAAOgpB,EAAQhpB,KAAK,MAEzC8oB,EAAO9oB,KAAK,KAEtBmoB,IACAmB,GAAW,IAAMnB,GAEdmB,EAEP,OAAO1B,EAGf,IAAI2B,EAAY,kIACZC,OAAiDr0B,IAAzB,GAAG8D,MAAM,SAAS,GAC9C,SAAS4H,EAAM4oB,GACX,IAAIC,EAA6B,EAAnBxsB,UAAUnJ,aAA+BoB,IAAjB+H,UAAU,GAAmBA,UAAU,GAAK,GAE9EoqB,EAAa,GACbC,GAA2B,IAAhBmC,EAAQC,IAAgBxI,EAAeD,EAC5B,WAAtBwI,EAAQE,YAAwBH,GAAaC,EAAQhC,OAASgC,EAAQhC,OAAS,IAAM,IAAM,KAAO+B,GACtG,IAAIzwB,EAAUywB,EAAUxwB,MAAMswB,GAC9B,GAAIvwB,EAAS,CACLwwB,GAEAlC,EAAWI,OAAS1uB,EAAQ,GAC5BsuB,EAAWK,SAAW3uB,EAAQ,GAC9BsuB,EAAWM,KAAO5uB,EAAQ,GAC1BsuB,EAAWuC,KAAO1C,SAASnuB,EAAQ,GAAI,IACvCsuB,EAAW1f,KAAO5O,EAAQ,IAAM,GAChCsuB,EAAWO,MAAQ7uB,EAAQ,GAC3BsuB,EAAWjlB,SAAWrJ,EAAQ,GAE1B8wB,MAAMxC,EAAWuC,QACjBvC,EAAWuC,KAAO7wB,EAAQ,MAK9BsuB,EAAWI,OAAS1uB,EAAQ,SAAM7D,EAClCmyB,EAAWK,UAAuC,IAA5B8B,EAAUxY,QAAQ,KAAcjY,EAAQ,QAAK7D,EACnEmyB,EAAWM,MAAoC,IAA7B6B,EAAUxY,QAAQ,MAAejY,EAAQ,QAAK7D,EAChEmyB,EAAWuC,KAAO1C,SAASnuB,EAAQ,GAAI,IACvCsuB,EAAW1f,KAAO5O,EAAQ,IAAM,GAChCsuB,EAAWO,OAAoC,IAA5B4B,EAAUxY,QAAQ,KAAcjY,EAAQ,QAAK7D,EAChEmyB,EAAWjlB,UAAuC,IAA5BonB,EAAUxY,QAAQ,KAAcjY,EAAQ,QAAK7D,EAE/D20B,MAAMxC,EAAWuC,QACjBvC,EAAWuC,KAAOJ,EAAUxwB,MAAM,iCAAmCD,EAAQ,QAAK7D,IAGtFmyB,EAAWM,OAEXN,EAAWM,KAAOK,EAAeF,EAAeT,EAAWM,KAAML,GAAWA,IAM5ED,EAAWsC,eAHWz0B,IAAtBmyB,EAAWI,aAAgDvyB,IAAxBmyB,EAAWK,eAA8CxyB,IAApBmyB,EAAWM,WAA0CzyB,IAApBmyB,EAAWuC,MAAuBvC,EAAW1f,WAA6BzS,IAArBmyB,EAAWO,WAE5I1yB,IAAtBmyB,EAAWI,OACK,gBACQvyB,IAAxBmyB,EAAWjlB,SACK,WAEA,MANA,gBASvBqnB,EAAQE,WAAmC,WAAtBF,EAAQE,WAA0BF,EAAQE,YAActC,EAAWsC,YACxFtC,EAAW/oB,MAAQ+oB,EAAW/oB,OAAS,gBAAkBmrB,EAAQE,UAAY,eAGjF,IAAIG,EAAgBrD,GAASgD,EAAQhC,QAAUJ,EAAWI,QAAU,IAAIxK,eAExE,GAAKwM,EAAQM,gBAAoBD,GAAkBA,EAAcC,eAc7D3C,EAA4BC,EAAYC,OAdsC,CAE9E,GAAID,EAAWM,OAAS8B,EAAQO,YAAcF,GAAiBA,EAAcE,YAEzE,IACI3C,EAAWM,KAAOzB,EAASK,QAAQc,EAAWM,KAAKtkB,QAAQikB,EAASxG,YAAa8F,GAAa3J,eAChG,MAAOhqB,GACLo0B,EAAW/oB,MAAQ+oB,EAAW/oB,OAAS,kEAAoErL,EAInHm0B,EAA4BC,EAAYpG,GAMxC6I,GAAiBA,EAAclpB,OAC/BkpB,EAAclpB,MAAMymB,EAAYoC,QAGpCpC,EAAW/oB,MAAQ+oB,EAAW/oB,OAAS,yBAE3C,OAAO+oB,EAuBX,IAAI4C,EAAO,WACPC,EAAO,cACPC,EAAO,gBACPC,EAAO,yBACX,SAASC,EAAkBvG,GAEvB,IADA,IAAIb,EAAS,GACNa,EAAMhwB,QACT,GAAIgwB,EAAM9qB,MAAMixB,GACZnG,EAAQA,EAAMzgB,QAAQ4mB,EAAM,SACzB,GAAInG,EAAM9qB,MAAMkxB,GACnBpG,EAAQA,EAAMzgB,QAAQ6mB,EAAM,UACzB,GAAIpG,EAAM9qB,MAAMmxB,GACnBrG,EAAQA,EAAMzgB,QAAQ8mB,EAAM,KAC5BlH,EAAO/W,WACJ,GAAc,MAAV4X,GAA2B,OAAVA,EACxBA,EAAQ,OACL,CACH,IAAIwG,EAAKxG,EAAM9qB,MAAMoxB,GACrB,IAAIE,EAKA,MAAM,IAAI52B,MAAM,oCAJhB,IAAI62B,EAAID,EAAG,GACXxG,EAAQA,EAAMzhB,MAAMkoB,EAAEz2B,QACtBmvB,EAAOze,KAAK+lB,GAMxB,OAAOtH,EAAOljB,KAAK,IAGvB,SAASoD,EAAUkkB,GACf,IAAIoC,EAA6B,EAAnBxsB,UAAUnJ,aAA+BoB,IAAjB+H,UAAU,GAAmBA,UAAU,GAAK,GAE9EqqB,EAAWmC,EAAQC,IAAMxI,EAAeD,EACxCuJ,EAAY,GAEZV,EAAgBrD,GAASgD,EAAQhC,QAAUJ,EAAWI,QAAU,IAAIxK,eAGxE,GADI6M,GAAiBA,EAAc3mB,WAAW2mB,EAAc3mB,UAAUkkB,EAAYoC,GAC9EpC,EAAWM,OAEPL,EAAStG,YAAYrmB,KAAK0sB,EAAWM,QAIhC8B,EAAQO,YAAcF,GAAiBA,EAAcE,YAEtD,IACI3C,EAAWM,KAAQ8B,EAAQC,IAAmGxD,EAASM,UAAUa,EAAWM,MAA3HzB,EAASK,QAAQc,EAAWM,KAAKtkB,QAAQikB,EAASxG,YAAa8F,GAAa3J,eAC/G,MAAOhqB,GACLo0B,EAAW/oB,MAAQ+oB,EAAW/oB,OAAS,+CAAkDmrB,EAAQC,IAAgB,UAAV,SAAuB,kBAAoBz2B,EAKlKm0B,EAA4BC,EAAYC,GACd,WAAtBmC,EAAQE,WAA0BtC,EAAWI,SAC7C+C,EAAUhmB,KAAK6iB,EAAWI,QAC1B+C,EAAUhmB,KAAK,MAEnB,IAhFyB6iB,EACrBC,EACAkD,EAyFID,EAXJE,GA/EAnD,GAA2B,IA+EiBmC,EA/EzBC,IAAgBxI,EAAeD,EAClDuJ,EAAY,QACYt1B,KAHHmyB,EAgFWA,GA7ErBK,WACX8C,EAAUhmB,KAAK6iB,EAAWK,UAC1B8C,EAAUhmB,KAAK,WAEKtP,IAApBmyB,EAAWM,MAEX6C,EAAUhmB,KAAKwjB,EAAeF,EAAerF,OAAO4E,EAAWM,MAAOL,GAAWA,GAAUjkB,QAAQikB,EAAStG,YAAa,SAAU0J,EAAGC,EAAIC,GACtI,MAAO,IAAMD,GAAMC,EAAK,MAAQA,EAAK,IAAM,OAGpB,iBAApBvD,EAAWuC,MAAgD,iBAApBvC,EAAWuC,OACzDY,EAAUhmB,KAAK,KACfgmB,EAAUhmB,KAAKie,OAAO4E,EAAWuC,QAE9BY,EAAU12B,OAAS02B,EAAUzqB,KAAK,SAAM7K,GA2F/C,YA3BkBA,IAAdu1B,IAC0B,WAAtBhB,EAAQE,WACRa,EAAUhmB,KAAK,MAEnBgmB,EAAUhmB,KAAKimB,GACXpD,EAAW1f,MAAsC,MAA9B0f,EAAW1f,KAAKkjB,OAAO,IAC1CL,EAAUhmB,KAAK,WAGCtP,IAApBmyB,EAAW1f,OACP4iB,EAAIlD,EAAW1f,KACd8hB,EAAQqB,cAAkBhB,GAAkBA,EAAcgB,eAC3DP,EAAIF,EAAkBE,SAERr1B,IAAdu1B,IACAF,EAAIA,EAAElnB,QAAQ,QAAS,SAE3BmnB,EAAUhmB,KAAK+lB,SAEMr1B,IAArBmyB,EAAWO,QACX4C,EAAUhmB,KAAK,KACfgmB,EAAUhmB,KAAK6iB,EAAWO,aAEF1yB,IAAxBmyB,EAAWjlB,WACXooB,EAAUhmB,KAAK,KACfgmB,EAAUhmB,KAAK6iB,EAAWjlB,WAEvBooB,EAAUzqB,KAAK,IAG1B,SAASgrB,EAAkBnH,EAAMoH,GAC7B,IAAIvB,EAA6B,EAAnBxsB,UAAUnJ,aAA+BoB,IAAjB+H,UAAU,GAAmBA,UAAU,GAAK,GAG9EguB,EAAS,GAqDb,OAvDwBhuB,UAAU,KAI9B2mB,EAAOhjB,EAAMuC,EAAUygB,EAAM6F,GAAUA,GACvCuB,EAAWpqB,EAAMuC,EAAU6nB,EAAUvB,GAAUA,MAEnDA,EAAUA,GAAW,IACRyB,UAAYF,EAASvD,QAC9BwD,EAAOxD,OAASuD,EAASvD,OAEzBwD,EAAOvD,SAAWsD,EAAStD,SAC3BuD,EAAOtD,KAAOqD,EAASrD,KACvBsD,EAAOrB,KAAOoB,EAASpB,KACvBqB,EAAOtjB,KAAO0iB,EAAkBW,EAASrjB,MAAQ,IACjDsjB,EAAOrD,MAAQoD,EAASpD,aAEE1yB,IAAtB81B,EAAStD,eAA4CxyB,IAAlB81B,EAASrD,WAAwCzyB,IAAlB81B,EAASpB,MAE3EqB,EAAOvD,SAAWsD,EAAStD,SAC3BuD,EAAOtD,KAAOqD,EAASrD,KACvBsD,EAAOrB,KAAOoB,EAASpB,KACvBqB,EAAOtjB,KAAO0iB,EAAkBW,EAASrjB,MAAQ,IACjDsjB,EAAOrD,MAAQoD,EAASpD,QAEnBoD,EAASrjB,MAQsB,MAA5BqjB,EAASrjB,KAAKkjB,OAAO,GACrBI,EAAOtjB,KAAO0iB,EAAkBW,EAASrjB,OAOrCsjB,EAAOtjB,UALYzS,IAAlB0uB,EAAK8D,eAAwCxyB,IAAd0uB,EAAK+D,WAAoCzyB,IAAd0uB,EAAKgG,MAAwBhG,EAAKjc,KAErFic,EAAKjc,KAGCic,EAAKjc,KAAKtF,MAAM,EAAGuhB,EAAKjc,KAAKuc,YAAY,KAAO,GAAK8G,EAASrjB,KAF9DqjB,EAASrjB,KAFT,IAAMqjB,EAASrjB,KAMjCsjB,EAAOtjB,KAAO0iB,EAAkBY,EAAOtjB,OAE3CsjB,EAAOrD,MAAQoD,EAASpD,QAnBxBqD,EAAOtjB,KAAOic,EAAKjc,KAEfsjB,EAAOrD,WADY1yB,IAAnB81B,EAASpD,MACMoD,EAASpD,MAEThE,EAAKgE,OAkB5BqD,EAAOvD,SAAW9D,EAAK8D,SACvBuD,EAAOtD,KAAO/D,EAAK+D,KACnBsD,EAAOrB,KAAOhG,EAAKgG,MAEvBqB,EAAOxD,OAAS7D,EAAK6D,QAEzBwD,EAAO7oB,SAAW4oB,EAAS5oB,SACpB6oB,EAmCX,SAASE,EAAkBryB,EAAK2wB,GAC5B,OAAO3wB,GAAOA,EAAIsiB,WAAW/X,QAASomB,GAAYA,EAAQC,IAAiCxI,EAAaJ,YAAxCG,EAAaH,YAAwC8F,GAGzH,IAAIwE,EAAU,CACV3D,OAAQ,OACRuC,YAAY,EACZppB,MAAO,SAAeymB,GAKlB,OAHKA,EAAWM,OACZN,EAAW/oB,MAAQ+oB,EAAW/oB,OAAS,+BAEpC+oB,GAEXlkB,UAAW,SAAmBkkB,GAC1B,IAAIgE,EAAqD,UAA5C5I,OAAO4E,EAAWI,QAAQxK,cAYvC,OAVIoK,EAAWuC,QAAUyB,EAAS,IAAM,KAA2B,KAApBhE,EAAWuC,OACtDvC,EAAWuC,UAAO10B,GAGjBmyB,EAAW1f,OACZ0f,EAAW1f,KAAO,KAKf0f,IAIXiE,EAAY,CACZ7D,OAAQ,QACRuC,WAAYoB,EAAQpB,WACpBppB,MAAOwqB,EAAQxqB,MACfuC,UAAWioB,EAAQjoB,WAGvB,SAASooB,EAASC,GACd,MAAsC,kBAAxBA,EAAaH,OAAuBG,EAAaH,OAAuD,QAA9C5I,OAAO+I,EAAa/D,QAAQxK,cAGxG,IAAIwO,EAAY,CACZhE,OAAQ,KACRuC,YAAY,EACZppB,MAAO,SAAeymB,GAClB,IAAImE,EAAenE,EAOnB,OALAmE,EAAaH,OAASE,EAASC,GAE/BA,EAAaE,cAAgBF,EAAa7jB,MAAQ,MAAQ6jB,EAAa5D,MAAQ,IAAM4D,EAAa5D,MAAQ,IAC1G4D,EAAa7jB,UAAOzS,EACpBs2B,EAAa5D,WAAQ1yB,EACds2B,GAEXroB,UAAW,SAAmBqoB,GAW1B,IACQG,EACAC,EACAjkB,EACAigB,EAQR,OArBI4D,EAAa5B,QAAU2B,EAASC,GAAgB,IAAM,KAA6B,KAAtBA,EAAa5B,OAC1E4B,EAAa5B,UAAO10B,GAGW,kBAAxBs2B,EAAaH,SACpBG,EAAa/D,OAAS+D,EAAaH,OAAS,MAAQ,KACpDG,EAAaH,YAASn2B,GAGtBs2B,EAAaE,eACTC,EAAwBH,EAAaE,aAAalxB,MAAM,KAGxDotB,GAFAgE,EAAyBzK,EAAcwK,EAAuB,IAE/B,GAEnCH,EAAa7jB,MAHTA,EAAOikB,EAAuB,KAGG,MAATjkB,EAAeA,OAAOzS,EAClDs2B,EAAa5D,MAAQA,EACrB4D,EAAaE,kBAAex2B,GAGhCs2B,EAAappB,cAAWlN,EACjBs2B,IAIXK,EAAY,CACZpE,OAAQ,MACRuC,WAAYyB,EAAUzB,WACtBppB,MAAO6qB,EAAU7qB,MACjBuC,UAAWsoB,EAAUtoB,WAGrB2oB,EAAI,GAGJlO,EAAe,mGACfL,EAAW,cAeXwO,GAdejP,EAAOA,EAAO,UAAYS,EAAW,IAAMA,EAAWA,EAAW,IAAMA,EAAWA,GAAY,IAAMT,EAAO,cAAgBS,EAAW,IAAMA,EAAWA,GAAY,IAAMT,EAAO,IAAMS,EAAWA,IActMf,EADA,6DACe,cAEzBoE,EAAa,IAAI/lB,OAAO+iB,EAAc,KACtCkD,EAAc,IAAIjmB,OAjBHiiB,yJAiBwB,KACvCkP,EAAiB,IAAInxB,OAAO2hB,EAAM,MANxB,wDAMwC,QAAS,QAASuP,GAAU,KAC9EE,GAAa,IAAIpxB,OAAO2hB,EAAM,MAAOoB,EAJrB,uCAImD,KACnEsO,GAAcD,GAClB,SAAS1E,GAAiBzuB,GACtB,IAAI0uB,EAASZ,EAAY9tB,GACzB,OAAQ0uB,EAAOxuB,MAAM4nB,GAAoB4G,EAAN1uB,EAEvC,IAAIqzB,GAAY,CACZ1E,OAAQ,SACR7mB,MAAO,SAAkBymB,EAAYoC,GACjC,IAAI2C,EAAmB/E,EACnBthB,EAAKqmB,EAAiBrmB,GAAKqmB,EAAiBzkB,KAAOykB,EAAiBzkB,KAAKnN,MAAM,KAAO,GAE1F,GADA4xB,EAAiBzkB,UAAOzS,EACpBk3B,EAAiBxE,MAAO,CAIxB,IAHA,IAAIyE,GAAiB,EACjBC,EAAU,GACVC,EAAUH,EAAiBxE,MAAMptB,MAAM,KAClCqiB,EAAI,EAAGD,EAAK2P,EAAQz4B,OAAQ+oB,EAAID,IAAMC,EAAG,CAC9C,IAAI2P,EAASD,EAAQ1P,GAAGriB,MAAM,KAC9B,OAAQgyB,EAAO,IACX,IAAK,KAED,IADA,IAAIC,EAAUD,EAAO,GAAGhyB,MAAM,KACrBkyB,EAAK,EAAGC,EAAMF,EAAQ34B,OAAQ44B,EAAKC,IAAOD,EAC/C3mB,EAAGvB,KAAKioB,EAAQC,IAEpB,MACJ,IAAK,UACDN,EAAiBQ,QAAUzB,EAAkBqB,EAAO,GAAI/C,GACxD,MACJ,IAAK,OACD2C,EAAiBS,KAAO1B,EAAkBqB,EAAO,GAAI/C,GACrD,MACJ,QACI4C,GAAiB,EACjBC,EAAQnB,EAAkBqB,EAAO,GAAI/C,IAAY0B,EAAkBqB,EAAO,GAAI/C,IAItF4C,IAAgBD,EAAiBE,QAAUA,GAEnDF,EAAiBxE,WAAQ1yB,EACzB,IAAK,IAAI43B,EAAM,EAAGC,EAAOhnB,EAAGjS,OAAQg5B,EAAMC,IAAQD,EAAK,CACnD,IAAIE,EAAOjnB,EAAG+mB,GAAKtyB,MAAM,KAEzB,GADAwyB,EAAK,GAAK7B,EAAkB6B,EAAK,IAC5BvD,EAAQM,eAQTiD,EAAK,GAAK7B,EAAkB6B,EAAK,GAAIvD,GAASxM,mBAN9C,IACI+P,EAAK,GAAK9G,EAASK,QAAQ4E,EAAkB6B,EAAK,GAAIvD,GAASxM,eACjE,MAAOhqB,GACLm5B,EAAiB9tB,MAAQ8tB,EAAiB9tB,OAAS,2EAA6ErL,EAKxI8S,EAAG+mB,GAAOE,EAAKjtB,KAAK,KAExB,OAAOqsB,GAEXjpB,UAAW,SAAsBipB,EAAkB3C,GAC/C,IA3wCSzkB,EA2wCLqiB,EAAa+E,EACbrmB,EA3wCDf,OADMA,EA4wCQonB,EAAiBrmB,IA3wCKf,aAAenC,MAAQmC,EAA4B,iBAAfA,EAAIlR,QAAuBkR,EAAIxK,OAASwK,EAAIioB,aAAejoB,EAAInR,KAAO,CAACmR,GAAOnC,MAAM3O,UAAUmO,MAAMxO,KAAKmR,GAAO,GA4wC3L,GAAIe,EAAI,CACJ,IAAK,IAAI8W,EAAI,EAAGD,EAAK7W,EAAGjS,OAAQ+oB,EAAID,IAAMC,EAAG,CACzC,IAAIqQ,EAASzK,OAAO1c,EAAG8W,IACnBsQ,EAAQD,EAAOhJ,YAAY,KAC3BkJ,EAAYF,EAAO7qB,MAAM,EAAG8qB,GAAO9pB,QAAQyd,EAAayG,IAAkBlkB,QAAQyd,EAAa5D,GAAa7Z,QAAQ2oB,EAAgBtF,GACpI2G,EAASH,EAAO7qB,MAAM8qB,EAAQ,GAElC,IACIE,EAAU5D,EAAQC,IAA2ExD,EAASM,UAAU6G,GAAxFnH,EAASK,QAAQ4E,EAAkBkC,EAAQ5D,GAASxM,eAC9E,MAAOhqB,GACLo0B,EAAW/oB,MAAQ+oB,EAAW/oB,OAAS,wDAA2DmrB,EAAQC,IAAgB,UAAV,SAAuB,kBAAoBz2B,EAE/J8S,EAAG8W,GAAKuQ,EAAY,IAAMC,EAE9BhG,EAAW1f,KAAO5B,EAAGhG,KAAK,KAE9B,IAAIusB,EAAUF,EAAiBE,QAAUF,EAAiBE,SAAW,GACjEF,EAAiBQ,UAASN,EAAiB,QAAIF,EAAiBQ,SAChER,EAAiBS,OAAMP,EAAc,KAAIF,EAAiBS,MAC9D,IACSS,EADLzE,EAAS,GACb,IAASyE,KAAQhB,EACTA,EAAQgB,KAAUxB,EAAEwB,IACpBzE,EAAOrkB,KAAK8oB,EAAKjqB,QAAQyd,EAAayG,IAAkBlkB,QAAQyd,EAAa5D,GAAa7Z,QAAQ4oB,GAAYvF,GAAc,IAAM4F,EAAQgB,GAAMjqB,QAAQyd,EAAayG,IAAkBlkB,QAAQyd,EAAa5D,GAAa7Z,QAAQ6oB,GAAaxF,IAMtP,OAHImC,EAAO/0B,SACPuzB,EAAWO,MAAQiB,EAAO9oB,KAAK,MAE5BsnB,IAIXkG,GAAY,kBAEZC,GAAY,CACZ/F,OAAQ,MACR7mB,MAAO,SAAkBymB,EAAYoC,GACjC,IAGQhC,EACAgG,EACAC,EAEA5D,EAPJ/wB,EAAUsuB,EAAW1f,MAAQ0f,EAAW1f,KAAK3O,MAAMu0B,IACnDI,EAAgBtG,EAgBpB,OAfItuB,GACI0uB,EAASgC,EAAQhC,QAAUkG,EAAclG,QAAU,MACnDgG,EAAM10B,EAAQ,GAAGkkB,cACjByQ,EAAM30B,EAAQ,GAEd+wB,EAAgBrD,EADJgB,EAAS,KAAOgC,EAAQgE,KAAOA,IAE/CE,EAAcF,IAAMA,EACpBE,EAAcD,IAAMA,EACpBC,EAAchmB,UAAOzS,EACjB40B,IACA6D,EAAgB7D,EAAclpB,MAAM+sB,EAAelE,KAGvDkE,EAAcrvB,MAAQqvB,EAAcrvB,OAAS,yBAE1CqvB,GAEXxqB,UAAW,SAAsBwqB,EAAelE,GAC5C,IACIgE,EAAME,EAAcF,IAEpB3D,EAAgBrD,GAHPgD,EAAQhC,QAAUkG,EAAclG,QAAU,OAE9B,KAAOgC,EAAQgE,KAAOA,IAE3C3D,IACA6D,EAAgB7D,EAAc3mB,UAAUwqB,EAAelE,IAE3D,IAAImE,EAAgBD,EAGpB,OADAC,EAAcjmB,MAAQ8lB,GAAOhE,EAAQgE,KAAO,IADlCE,EAAcD,IAEjBE,IAIXt1B,GAAO,2DAEPu1B,GAAY,CACZpG,OAAQ,WACR7mB,MAAO,SAAe+sB,EAAelE,GACjC,IAAIqE,EAAiBH,EAMrB,OALAG,EAAe3zB,KAAO2zB,EAAeJ,IACrCI,EAAeJ,SAAMx4B,EAChBu0B,EAAQyB,UAAc4C,EAAe3zB,MAAS2zB,EAAe3zB,KAAKnB,MAAMV,MACzEw1B,EAAexvB,MAAQwvB,EAAexvB,OAAS,sBAE5CwvB,GAEX3qB,UAAW,SAAmB2qB,GAC1B,IAAIH,EAAgBG,EAGpB,OADAH,EAAcD,KAAOI,EAAe3zB,MAAQ,IAAI8iB,cACzC0Q,IAIflH,EAAQ2E,EAAQ3D,QAAU2D,EAC1B3E,EAAQ6E,EAAU7D,QAAU6D,EAC5B7E,EAAQgF,EAAUhE,QAAUgE,EAC5BhF,EAAQoF,EAAUpE,QAAUoE,EAC5BpF,EAAQ0F,GAAU1E,QAAU0E,GAC5B1F,EAAQ+G,GAAU/F,QAAU+F,GAC5B/G,EAAQoH,GAAUpG,QAAUoG,GAE5Bt7B,EAAQk0B,QAAUA,EAClBl0B,EAAQm0B,WAAaA,EACrBn0B,EAAQq0B,YAAcA,EACtBr0B,EAAQqO,MAAQA,EAChBrO,EAAQ83B,kBAAoBA,EAC5B93B,EAAQ4Q,UAAYA,EACpB5Q,EAAQw4B,kBAAoBA,EAC5Bx4B,EAAQoE,QAxTR,SAAiBo3B,EAASC,EAAavE,GACnC,IAAIwE,EA9jCR,SAAgBhD,EAAQpuB,GACpB,IAAImI,EAAMimB,EACV,GAAIpuB,EACA,IAAK,IAAIzI,KAAOyI,EACZmI,EAAI5Q,GAAOyI,EAAOzI,GAG1B,OAAO4Q,EAujCiBkpB,CAAO,CAAEzG,OAAQ,QAAUgC,GACnD,OAAOtmB,EAAU4nB,EAAkBnqB,EAAMmtB,EAASE,GAAoBrtB,EAAMotB,EAAaC,GAAoBA,GAAmB,GAAOA,IAuT3I17B,EAAQ2Q,UApTR,SAAmBvJ,EAAK8vB,GAMpB,MALmB,iBAAR9vB,EACPA,EAAMwJ,EAAUvC,EAAMjH,EAAK8vB,GAAUA,GACd,WAAhB1M,EAAOpjB,KACdA,EAAMiH,EAAMuC,EAAUxJ,EAAK8vB,GAAUA,IAElC9vB,GA+SXpH,EAAQ6I,MA5SR,SAAe+yB,EAAMC,EAAM3E,GAWvB,MAVoB,iBAAT0E,EACPA,EAAOhrB,EAAUvC,EAAMutB,EAAM1E,GAAUA,GACf,WAAjB1M,EAAOoR,KACdA,EAAOhrB,EAAUgrB,EAAM1E,IAEP,iBAAT2E,EACPA,EAAOjrB,EAAUvC,EAAMwtB,EAAM3E,GAAUA,GACf,WAAjB1M,EAAOqR,KACdA,EAAOjrB,EAAUirB,EAAM3E,IAEpB0E,IAASC,GAkSpB77B,EAAQ87B,gBA/RR,SAAyBv1B,EAAK2wB,GAC1B,OAAO3wB,GAAOA,EAAIsiB,WAAW/X,QAASomB,GAAYA,EAAQC,IAA4BxI,EAAaP,OAAnCM,EAAaN,OAA8B+F,IA+R/Gn0B,EAAQ44B,kBAAoBA,EAE5B9zB,OAAOi3B,eAAe/7B,EAAS,aAAc,CAAE8B,OAAO,IA75CUk6B,CAA5C,iBAAZh8B,QAA0C,IAAXC,EAAiCD,EAE7DK,EAAOuF,IAAMvF,EAAOuF,KAAO,KAg6CpC,IAAIT,IAAM,CAAC,SAASnE,EAAQf,EAAOD,gBAGrC,IAAIi8B,EAAgBj7B,EAAQ,aACxBoD,EAAUpD,EAAQ,qBAClBS,EAAQT,EAAQ,WAChBiN,EAAejN,EAAQ,wBACvB0H,EAAkB1H,EAAQ,8BAC1BmF,EAAUnF,EAAQ,qBAClBqQ,EAAQrQ,EAAQ,mBAChBk7B,EAAkBl7B,EAAQ,UAC1BuE,EAAOvE,EAAQ,mBAEnBf,EAAOD,QAAUQ,GAEbmB,UAAUqB,SA0Ed,SAAkBm5B,EAAclpB,GAC9B,IAAIlP,EACJ,GAA2B,iBAAhBo4B,GAET,KADAp4B,EAAIxD,KAAK0D,UAAUk4B,IACX,MAAM,IAAIh7B,MAAM,8BAAgCg7B,EAAe,SAClE,CACL,IAAIr5B,EAAYvC,KAAKwC,WAAWo5B,GAChCp4B,EAAIjB,EAAUE,UAAYzC,KAAK2C,SAASJ,GAG1C,IAAIqU,EAAQpT,EAAEkP,IACG,IAAblP,EAAEqG,SAAiB7J,KAAK2E,OAASnB,EAAEmB,QACvC,OAAOiS,GArFT3W,EAAImB,UAAUoH,QAgGd,SAAiBzG,EAAQ85B,GACvB,IAAIt5B,EAAYvC,KAAKwC,WAAWT,OAAQK,EAAWy5B,GACnD,OAAOt5B,EAAUE,UAAYzC,KAAK2C,SAASJ,IAjG7CtC,EAAImB,UAAUiC,UA8Gd,SAAmBtB,EAAQT,EAAKw6B,EAAiBD,GAC/C,GAAI9rB,MAAMC,QAAQjO,GAAQ,CACxB,IAAK,IAAIxB,EAAE,EAAGA,EAAEwB,EAAOf,OAAQT,IAAKP,KAAKqD,UAAUtB,EAAOxB,QAAI6B,EAAW05B,EAAiBD,GAC1F,OAAO77B,KAET,IAAIoO,EAAKpO,KAAKkO,OAAOnM,GACrB,QAAWK,IAAPgM,GAAiC,iBAANA,EAC7B,MAAM,IAAIxN,MAAM,4BAIlB,OAFAm7B,EAAY/7B,KADZsB,EAAMuC,EAAQM,YAAY7C,GAAO8M,IAEjCpO,KAAKuD,SAASjC,GAAOtB,KAAKwC,WAAWT,EAAQ+5B,EAAiBD,GAAO,GAC9D77B,MAxHTC,EAAImB,UAAU46B,cAqId,SAAuBj6B,EAAQT,EAAK26B,GAElC,OADAj8B,KAAKqD,UAAUtB,EAAQT,EAAK26B,GAAgB,GACrCj8B,MAtITC,EAAImB,UAAUsL,eAiJd,SAAwB3K,EAAQm6B,GAC9B,IAAIz4B,EAAU1B,EAAO0B,QACrB,QAAgBrB,IAAZqB,GAA2C,iBAAXA,EAClC,MAAM,IAAI7C,MAAM,4BAElB,KADA6C,EAAUA,GAAWzD,KAAKkC,MAAMi6B,aAgBlC,SAAqBp8B,GACnB,IAAIiC,EAAOjC,EAAKmC,MAAMF,KAMtB,OALAjC,EAAKmC,MAAMi6B,YAA6B,iBAARn6B,EACJjC,EAAKmO,OAAOlM,IAASA,EACrBjC,EAAK2D,UAAU04B,GACbA,OACAh6B,EACvBrC,EAAKmC,MAAMi6B,YAvB6BA,CAAYn8B,OAIzD,OAFAA,KAAK+K,OAAOkT,KAAK,+BACjBje,KAAK2E,OAAS,MAGhB,IAAIiS,EAAQ5W,KAAKyC,SAASgB,EAAS1B,GACnC,IAAK6U,GAASslB,EAAiB,CAC7B,IAAIj4B,EAAU,sBAAwBjE,KAAKkN,aAC3C,GAAiC,OAA7BlN,KAAKkC,MAAMwK,eACV,MAAM,IAAI9L,MAAMqD,GADmBjE,KAAK+K,OAAOS,MAAMvH,GAG5D,OAAO2S,GAhKT3W,EAAImB,UAAUsC,UAqLd,SAAmB24B,GACjB,IAAI95B,EAAY+5B,EAAct8B,KAAMq8B,GACpC,cAAe95B,GACb,IAAK,SAAU,OAAOA,EAAUE,UAAYzC,KAAK2C,SAASJ,GAC1D,IAAK,SAAU,OAAOvC,KAAK0D,UAAUnB,GACrC,IAAK,YAAa,OAKtB,SAA4BxC,EAAM8C,GAChC,IAAI+K,EAAM/J,EAAQ9B,OAAOhB,KAAKhB,EAAM,CAAEgC,OAAQ,IAAMc,GACpD,GAAI+K,EAAK,CACP,IAAI7L,EAAS6L,EAAI7L,OACb0G,EAAOmF,EAAInF,KACXzE,EAAS4J,EAAI5J,OACbR,EAAIk4B,EAAc36B,KAAKhB,EAAMgC,EAAQ0G,OAAMrG,EAAW4B,GAS1D,OARAjE,EAAKw8B,WAAW15B,GAAO,IAAI6K,EAAa,CACtC7K,IAAKA,EACLyM,UAAU,EACVvN,OAAQA,EACR0G,KAAMA,EACNzE,OAAQA,EACRvB,SAAUe,IAELA,GApBkBg5B,CAAmBx8B,KAAMq8B,KAzLtDp8B,EAAImB,UAAUq7B,aAiOd,SAAsBb,GACpB,GAAIA,aAAwB7zB,OAG1B,OAFA20B,EAAkB18B,KAAMA,KAAKuD,SAAUq4B,GACvCc,EAAkB18B,KAAMA,KAAKsD,MAAOs4B,GAC7B57B,KAET,cAAe47B,GACb,IAAK,YAIH,OAHAc,EAAkB18B,KAAMA,KAAKuD,UAC7Bm5B,EAAkB18B,KAAMA,KAAKsD,OAC7BtD,KAAKmB,OAAOO,QACL1B,KACT,IAAK,SACH,IAAIuC,EAAY+5B,EAAct8B,KAAM47B,GAIpC,OAHIr5B,GAAWvC,KAAKmB,OAAOM,IAAIc,EAAUo6B,iBAClC38B,KAAKuD,SAASq4B,UACd57B,KAAKsD,MAAMs4B,GACX57B,KACT,IAAK,SACH,IAAIqQ,EAAYrQ,KAAKkC,MAAMmO,UACvBssB,EAAWtsB,EAAYA,EAAUurB,GAAgBA,EACrD57B,KAAKmB,OAAOM,IAAIk7B,GAChB,IAAIvuB,EAAKpO,KAAKkO,OAAO0tB,GACjBxtB,IACFA,EAAKvK,EAAQM,YAAYiK,UAClBpO,KAAKuD,SAAS6K,UACdpO,KAAKsD,MAAM8K,IAGxB,OAAOpO,MA7PTC,EAAImB,UAAUw7B,UA4Zd,SAAmBpC,EAAM9c,GACF,iBAAVA,IAAoBA,EAAS,IAAI3V,OAAO2V,IAEnD,OADA1d,KAAKyJ,SAAS+wB,GAAQ9c,EACf1d,MA9ZTC,EAAImB,UAAU8L,WAoYd,SAAoBvI,EAAQgyB,GAE1B,KADAhyB,EAASA,GAAU3E,KAAK2E,QACX,MAAO,YAMpB,IAJA,IAAIk4B,OAAkCz6B,KADtCu0B,EAAUA,GAAW,IACGkG,UAA0B,KAAOlG,EAAQkG,UAC7D9oB,OAA8B3R,IAApBu0B,EAAQ5iB,QAAwB,OAAS4iB,EAAQ5iB,QAE3D+oB,EAAO,GACFv8B,EAAE,EAAGA,EAAEoE,EAAO3D,OAAQT,IAAK,CAClC,IAAIJ,EAAIwE,EAAOpE,GACXJ,IAAG28B,GAAQ/oB,EAAU5T,EAAE48B,SAAW,IAAM58B,EAAE8D,QAAU44B,GAE1D,OAAOC,EAAKvtB,MAAM,GAAIstB,EAAU77B,SA9YlCf,EAAImB,UAAUoB,WA0Qd,SAAoBT,EAAQk6B,EAAgBj6B,EAAMg7B,GAChD,GAAqB,iBAAVj7B,GAAuC,kBAAVA,EACtC,MAAM,IAAInB,MAAM,sCAClB,IAAIyP,EAAYrQ,KAAKkC,MAAMmO,UACvBssB,EAAWtsB,EAAYA,EAAUtO,GAAUA,EAC3Ck7B,EAASj9B,KAAKmB,OAAOK,IAAIm7B,GAC7B,GAAIM,EAAQ,OAAOA,EAEnBD,EAAkBA,IAAgD,IAA7Bh9B,KAAKkC,MAAMg7B,cAEhD,IAAI9uB,EAAKvK,EAAQM,YAAYnE,KAAKkO,OAAOnM,IACrCqM,GAAM4uB,GAAiBjB,EAAY/7B,KAAMoO,GAE7C,IACI+uB,EADAC,GAA6C,IAA9Bp9B,KAAKkC,MAAMwK,iBAA6BuvB,EAEvDmB,KAAkBD,EAAgB/uB,GAAMA,GAAMvK,EAAQM,YAAYpC,EAAO0B,WAC3EzD,KAAK0M,eAAe3K,GAAQ,GAE9B,IAAI2G,EAAY7E,EAAQ2K,IAAIzN,KAAKf,KAAM+B,GAEnCQ,EAAY,IAAImL,EAAa,CAC/BU,GAAIA,EACJrM,OAAQA,EACR2G,UAAWA,EACXi0B,SAAUA,EACV36B,KAAMA,IAGK,KAAToM,EAAG,IAAa4uB,IAAiBh9B,KAAKsD,MAAM8K,GAAM7L,GACtDvC,KAAKmB,OAAOE,IAAIs7B,EAAUp6B,GAEtB66B,GAAgBD,GAAen9B,KAAK0M,eAAe3K,GAAQ,GAE/D,OAAOQ,GA1STtC,EAAImB,UAAUuB,SA+Sd,SAAkBJ,EAAWkG,GAC3B,GAAIlG,EAAU8G,UAOZ,OANA9G,EAAUE,SAAW+G,GACRzH,OAASQ,EAAUR,OAChCyH,EAAa7E,OAAS,KACtB6E,EAAaf,KAAOA,GAAce,GACF,IAA5BjH,EAAUR,OAAO8H,SACnBL,EAAaK,QAAS,GACjBL,EAIT,IAAI6zB,EAMA75B,EARJjB,EAAU8G,WAAY,EAGlB9G,EAAUP,OACZq7B,EAAcr9B,KAAKkC,MACnBlC,KAAKkC,MAAQlC,KAAKs9B,WAIpB,IAAM95B,EAAIk4B,EAAc36B,KAAKf,KAAMuC,EAAUR,OAAQ0G,EAAMlG,EAAUmG,WACrE,MAAMvI,GAEJ,aADOoC,EAAUE,SACXtC,EAER,QACEoC,EAAU8G,WAAY,EAClB9G,EAAUP,OAAMhC,KAAKkC,MAAQm7B,GAOnC,OAJA96B,EAAUE,SAAWe,EACrBjB,EAAUsG,KAAOrF,EAAEqF,KACnBtG,EAAUqG,OAASpF,EAAEoF,OACrBrG,EAAUkG,KAAOjF,EAAEiF,KACZjF,EAIP,SAASgG,IAEP,IAAI+zB,EAAYh7B,EAAUE,SACtBwH,EAASszB,EAAUrzB,MAAMlK,KAAMmK,WAEnC,OADAX,EAAa7E,OAAS44B,EAAU54B,OACzBsF,IAvVXhK,EAAImB,UAAUU,aAAerB,EAAQ,mBACrC,IAAI+8B,EAAgB/8B,EAAQ,aAC5BR,EAAImB,UAAUq8B,WAAaD,EAAc3W,IACzC5mB,EAAImB,UAAUs8B,WAAaF,EAAch8B,IACzCvB,EAAImB,UAAUu8B,cAAgBH,EAAcvW,OAC5ChnB,EAAImB,UAAUslB,gBAAkB8W,EAAc/6B,SAE9C,IAAIyF,EAAezH,EAAQ,2BAC3BR,EAAIsI,gBAAkBL,EAAaxD,WACnCzE,EAAI2B,gBAAkBsG,EAAarG,WACnC5B,EAAI07B,gBAAkBA,EAEtB,IAAIS,EAAiB,yCAEjBwB,EAAsB,CAAE,mBAAoB,cAAe,cAAe,kBAC1EC,EAAoB,CAAC,eAQzB,SAAS59B,EAAI0I,GACX,KAAM3I,gBAAgBC,GAAM,OAAO,IAAIA,EAAI0I,GAC3CA,EAAO3I,KAAKkC,MAAQ8C,EAAKc,KAAK6C,IAAS,GAwbzC,SAAmB5I,GACjB,IAAIgL,EAAShL,EAAKmC,MAAM6I,OACxB,IAAe,IAAXA,EACFhL,EAAKgL,OAAS,CAAC+yB,IAAKC,EAAM9f,KAAM8f,EAAMvyB,MAAOuyB,OACxC,CAEL,QADe37B,IAAX2I,IAAsBA,EAASizB,WACZ,iBAAVjzB,GAAsBA,EAAO+yB,KAAO/yB,EAAOkT,MAAQlT,EAAOS,OACrE,MAAM,IAAI5K,MAAM,qDAClBb,EAAKgL,OAASA,GA/bhBkzB,CAAUj+B,MACVA,KAAKuD,SAAW,GAChBvD,KAAKsD,MAAQ,GACbtD,KAAKu8B,WAAa,GAClBv8B,KAAKyJ,SAAW7D,EAAQ+C,EAAK+U,QAE7B1d,KAAKmB,OAASwH,EAAKu1B,OAAS,IAAIh9B,EAChClB,KAAKkD,gBAAkB,GACvBlD,KAAKsJ,cAAgB,GACrBtJ,KAAK0J,MAAQoH,IACb9Q,KAAKkO,OAwTP,SAAqBvF,GACnB,OAAQA,EAAK8F,UACX,IAAK,OAAQ,OAAO0vB,EACpB,IAAK,KAAM,OAAOjwB,EAClB,QAAS,OAAOkwB,GA5TJC,CAAY11B,GAE1BA,EAAKwa,aAAexa,EAAKwa,cAAgBhT,EAAAA,EACf,YAAtBxH,EAAK21B,gBAA6B31B,EAAKuU,wBAAyB,QAC7C9a,IAAnBuG,EAAK0H,YAAyB1H,EAAK0H,UAAYlI,GACnDnI,KAAKs9B,UAgaP,SAA8Bv9B,GAE5B,IADA,IAAIw+B,EAAWv5B,EAAKc,KAAK/F,EAAKmC,OACrB3B,EAAE,EAAGA,EAAEq9B,EAAoB58B,OAAQT,WACnCg+B,EAASX,EAAoBr9B,IACtC,OAAOg+B,EApaUC,CAAqBx+B,MAElC2I,EAAK/C,SAwYX,SAA2B7F,GACzB,IAAK,IAAIy6B,KAAQz6B,EAAKmC,MAAM0D,QAAS,CAEnC7F,EAAK68B,UAAUpC,EADFz6B,EAAKmC,MAAM0D,QAAQ40B,KA1YhBiE,CAAkBz+B,MAChC2I,EAAKkJ,UA+YX,SAA4B9R,GAC1B,IAAK,IAAIy6B,KAAQz6B,EAAKmC,MAAM2P,SAAU,CAEpC9R,EAAK09B,WAAWjD,EADFz6B,EAAKmC,MAAM2P,SAAS2oB,KAjZjBkE,CAAmB1+B,MAiXxC,SAA8BD,GAC5B,IAAI4+B,EACA5+B,EAAKmC,MAAM8S,QACb2pB,EAAcl+B,EAAQ,oBACtBV,EAAKi8B,cAAc2C,EAAaA,EAAYnoB,KAAK,IAEnD,IAAwB,IAApBzW,EAAKmC,MAAMF,KAAgB,OAC/B,IAAIiU,EAAaxV,EAAQ,oCACrBV,EAAKmC,MAAM8S,QAAOiB,EAAa0lB,EAAgB1lB,EAAY4nB,IAC/D99B,EAAKi8B,cAAc/lB,EAAYmmB,GAAgB,GAC/Cr8B,EAAKuD,MAAM,iCAAmC84B,EA1X9CwC,CAAqB5+B,MACG,iBAAb2I,EAAK3G,MAAkBhC,KAAKg8B,cAAcrzB,EAAK3G,MACtD2G,EAAK+c,UAAU1lB,KAAKy9B,WAAW,WAAY,CAACxnB,WAAY,CAACpF,KAAM,aA4XrE,SAA2B9Q,GACzB,IAAI8+B,EAAc9+B,EAAKmC,MAAM48B,QAC7B,IAAKD,EAAa,OAClB,GAAI9uB,MAAMC,QAAQ6uB,GAAc9+B,EAAKsD,UAAUw7B,QAC1C,IAAK,IAAIv9B,KAAOu9B,EAAa9+B,EAAKsD,UAAUw7B,EAAYv9B,GAAMA,GA/XnEy9B,CAAkB/+B,MA2JpB,SAASs8B,EAAcv8B,EAAMs8B,GAE3B,OADAA,EAASx4B,EAAQM,YAAYk4B,GACtBt8B,EAAKwD,SAAS84B,IAAWt8B,EAAKuD,MAAM+4B,IAAWt8B,EAAKw8B,WAAWF,GA8CxE,SAASK,EAAkB38B,EAAM++B,EAAS13B,GACxC,IAAK,IAAIi1B,KAAUyC,EAAS,CAC1B,IAAIv8B,EAAYu8B,EAAQzC,GACnB95B,EAAUP,MAAUoF,IAASA,EAAMS,KAAKw0B,KAC3Ct8B,EAAKoB,OAAOM,IAAIc,EAAUo6B,iBACnBmC,EAAQzC,KAqGrB,SAASnuB,EAAOnM,GAEd,OADIA,EAAOyU,KAAKxW,KAAK+K,OAAOkT,KAAK,qBAAsBlc,EAAOyU,KACvDzU,EAAOqM,GAIhB,SAASgwB,EAAQr8B,GAEf,OADIA,EAAOqM,IAAIpO,KAAK+K,OAAOkT,KAAK,oBAAqBlc,EAAOqM,IACrDrM,EAAOyU,IAIhB,SAAS2nB,EAAYp8B,GACnB,GAAIA,EAAOyU,KAAOzU,EAAOqM,IAAMrM,EAAOyU,KAAOzU,EAAOqM,GAClD,MAAM,IAAIxN,MAAM,mCAClB,OAAOmB,EAAOyU,KAAOzU,EAAOqM,GA+E9B,SAAS2tB,EAAYh8B,EAAMqO,GACzB,GAAIrO,EAAKwD,SAAS6K,IAAOrO,EAAKuD,MAAM8K,GAClC,MAAM,IAAIxN,MAAM,0BAA4BwN,EAAK,oBAyBrD,SAAS2vB,OAEP,CAACiB,UAAU,EAAEC,YAAY,EAAEC,kBAAkB,EAAEC,0BAA0B,EAAEC,oBAAoB,EAAEC,oBAAoB,EAAEC,kBAAkB,EAAEC,uBAAuB,EAAEC,iBAAiB,GAAGC,SAAS,GAAGC,YAAY,GAAGC,mBAAmB,GAAGxoB,mCAAmC,GAAG3J,6BAA6B,MAAM,GAAG,GAnhOoD,CAmhOhD"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/ajv.d.ts b/node_modules/mathjs/examples/node_modules/ajv/lib/ajv.d.ts
new file mode 100644
index 0000000..078364d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/ajv.d.ts
@@ -0,0 +1,397 @@
+declare var ajv: {
+  (options?: ajv.Options): ajv.Ajv;
+  new(options?: ajv.Options): ajv.Ajv;
+  ValidationError: typeof AjvErrors.ValidationError;
+  MissingRefError: typeof AjvErrors.MissingRefError;
+  $dataMetaSchema: object;
+}
+
+declare namespace AjvErrors {
+  class ValidationError extends Error {
+    constructor(errors: Array<ajv.ErrorObject>);
+
+    message: string;
+    errors: Array<ajv.ErrorObject>;
+    ajv: true;
+    validation: true;
+  }
+
+  class MissingRefError extends Error {
+    constructor(baseId: string, ref: string, message?: string);
+    static message: (baseId: string, ref: string) => string;
+
+    message: string;
+    missingRef: string;
+    missingSchema: string;
+  }
+}
+
+declare namespace ajv {
+  type ValidationError = AjvErrors.ValidationError;
+
+  type MissingRefError = AjvErrors.MissingRefError;
+
+  interface Ajv {
+    /**
+    * Validate data using schema
+    * Schema will be compiled and cached (using serialized JSON as key, [fast-json-stable-stringify](https://github.com/epoberezkin/fast-json-stable-stringify) is used to serialize by default).
+    * @param  {string|object|Boolean} schemaKeyRef key, ref or schema object
+    * @param  {Any} data to be validated
+    * @return {Boolean} validation result. Errors from the last validation will be available in `ajv.errors` (and also in compiled schema: `schema.errors`).
+    */
+    validate(schemaKeyRef: object | string | boolean, data: any): boolean | PromiseLike<any>;
+    /**
+    * Create validating function for passed schema.
+    * @param  {object|Boolean} schema schema object
+    * @return {Function} validating function
+    */
+    compile(schema: object | boolean): ValidateFunction;
+    /**
+    * Creates validating function for passed schema with asynchronous loading of missing schemas.
+    * `loadSchema` option should be a function that accepts schema uri and node-style callback.
+    * @this  Ajv
+    * @param {object|Boolean} schema schema object
+    * @param {Boolean} meta optional true to compile meta-schema; this parameter can be skipped
+    * @param {Function} callback optional node-style callback, it is always called with 2 parameters: error (or null) and validating function.
+    * @return {PromiseLike<ValidateFunction>} validating function
+    */
+    compileAsync(schema: object | boolean, meta?: Boolean, callback?: (err: Error, validate: ValidateFunction) => any): PromiseLike<ValidateFunction>;
+    /**
+    * Adds schema to the instance.
+    * @param {object|Array} schema schema or array of schemas. If array is passed, `key` and other parameters will be ignored.
+    * @param {string} key Optional schema key. Can be passed to `validate` method instead of schema object or id/ref. One schema per instance can have empty `id` and `key`.
+    * @return {Ajv} this for method chaining
+    */
+    addSchema(schema: Array<object> | object, key?: string): Ajv;
+    /**
+    * Add schema that will be used to validate other schemas
+    * options in META_IGNORE_OPTIONS are alway set to false
+    * @param {object} schema schema object
+    * @param {string} key optional schema key
+    * @return {Ajv} this for method chaining
+    */
+    addMetaSchema(schema: object, key?: string): Ajv;
+    /**
+    * Validate schema
+    * @param {object|Boolean} schema schema to validate
+    * @return {Boolean} true if schema is valid
+    */
+    validateSchema(schema: object | boolean): boolean;
+    /**
+    * Get compiled schema from the instance by `key` or `ref`.
+    * @param  {string} keyRef `key` that was passed to `addSchema` or full schema reference (`schema.id` or resolved id).
+    * @return {Function} schema validating function (with property `schema`). Returns undefined if keyRef can't be resolved to an existing schema.
+    */
+    getSchema(keyRef: string): ValidateFunction | undefined;
+    /**
+    * Remove cached schema(s).
+    * If no parameter is passed all schemas but meta-schemas are removed.
+    * If RegExp is passed all schemas with key/id matching pattern but meta-schemas are removed.
+    * Even if schema is referenced by other schemas it still can be removed as other schemas have local references.
+    * @param  {string|object|RegExp|Boolean} schemaKeyRef key, ref, pattern to match key/ref or schema object
+    * @return {Ajv} this for method chaining
+    */
+    removeSchema(schemaKeyRef?: object | string | RegExp | boolean): Ajv;
+    /**
+    * Add custom format
+    * @param {string} name format name
+    * @param {string|RegExp|Function} format string is converted to RegExp; function should return boolean (true when valid)
+    * @return {Ajv} this for method chaining
+    */
+    addFormat(name: string, format: FormatValidator | FormatDefinition): Ajv;
+    /**
+    * Define custom keyword
+    * @this  Ajv
+    * @param {string} keyword custom keyword, should be a valid identifier, should be different from all standard, custom and macro keywords.
+    * @param {object} definition keyword definition object with properties `type` (type(s) which the keyword applies to), `validate` or `compile`.
+    * @return {Ajv} this for method chaining
+    */
+    addKeyword(keyword: string, definition: KeywordDefinition): Ajv;
+    /**
+    * Get keyword definition
+    * @this  Ajv
+    * @param {string} keyword pre-defined or custom keyword.
+    * @return {object|Boolean} custom keyword definition, `true` if it is a predefined keyword, `false` otherwise.
+    */
+    getKeyword(keyword: string): object | boolean;
+    /**
+    * Remove keyword
+    * @this  Ajv
+    * @param {string} keyword pre-defined or custom keyword.
+    * @return {Ajv} this for method chaining
+    */
+    removeKeyword(keyword: string): Ajv;
+    /**
+    * Validate keyword
+    * @this  Ajv
+    * @param {object} definition keyword definition object
+    * @param {boolean} throwError true to throw exception if definition is invalid
+    * @return {boolean} validation result
+    */
+    validateKeyword(definition: KeywordDefinition, throwError: boolean): boolean;
+    /**
+    * Convert array of error message objects to string
+    * @param  {Array<object>} errors optional array of validation errors, if not passed errors from the instance are used.
+    * @param  {object} options optional options with properties `separator` and `dataVar`.
+    * @return {string} human readable string with all errors descriptions
+    */
+    errorsText(errors?: Array<ErrorObject> | null, options?: ErrorsTextOptions): string;
+    errors?: Array<ErrorObject> | null;
+    _opts: Options;
+  }
+
+  interface CustomLogger {
+    log(...args: any[]): any;
+    warn(...args: any[]): any;
+    error(...args: any[]): any;
+  }
+
+  interface ValidateFunction {
+    (
+      data: any,
+      dataPath?: string,
+      parentData?: object | Array<any>,
+      parentDataProperty?: string | number,
+      rootData?: object | Array<any>
+    ): boolean | PromiseLike<any>;
+    schema?: object | boolean;
+    errors?: null | Array<ErrorObject>;
+    refs?: object;
+    refVal?: Array<any>;
+    root?: ValidateFunction | object;
+    $async?: true;
+    source?: object;
+  }
+
+  interface Options {
+    $data?: boolean;
+    allErrors?: boolean;
+    verbose?: boolean;
+    jsonPointers?: boolean;
+    uniqueItems?: boolean;
+    unicode?: boolean;
+    format?: false | string;
+    formats?: object;
+    keywords?: object;
+    unknownFormats?: true | string[] | 'ignore';
+    schemas?: Array<object> | object;
+    schemaId?: '$id' | 'id' | 'auto';
+    missingRefs?: true | 'ignore' | 'fail';
+    extendRefs?: true | 'ignore' | 'fail';
+    loadSchema?: (uri: string, cb?: (err: Error, schema: object) => void) => PromiseLike<object | boolean>;
+    removeAdditional?: boolean | 'all' | 'failing';
+    useDefaults?: boolean | 'empty' | 'shared';
+    coerceTypes?: boolean | 'array';
+    strictDefaults?: boolean | 'log';
+    strictKeywords?: boolean | 'log';
+    strictNumbers?: boolean;
+    async?: boolean | string;
+    transpile?: string | ((code: string) => string);
+    meta?: boolean | object;
+    validateSchema?: boolean | 'log';
+    addUsedSchema?: boolean;
+    inlineRefs?: boolean | number;
+    passContext?: boolean;
+    loopRequired?: number;
+    ownProperties?: boolean;
+    multipleOfPrecision?: boolean | number;
+    errorDataPath?: string,
+    messages?: boolean;
+    sourceCode?: boolean;
+    processCode?: (code: string, schema: object) => string;
+    cache?: object;
+    logger?: CustomLogger | false;
+    nullable?: boolean;
+    serialize?: ((schema: object | boolean) => any) | false;
+  }
+
+  type FormatValidator = string | RegExp | ((data: string) => boolean | PromiseLike<any>);
+  type NumberFormatValidator = ((data: number) => boolean | PromiseLike<any>);
+
+  interface NumberFormatDefinition {
+    type: "number",
+    validate: NumberFormatValidator;
+    compare?: (data1: number, data2: number) => number;
+    async?: boolean;
+  }
+
+  interface StringFormatDefinition {
+    type?: "string",
+    validate: FormatValidator;
+    compare?: (data1: string, data2: string) => number;
+    async?: boolean;
+  }
+
+  type FormatDefinition = NumberFormatDefinition | StringFormatDefinition;
+
+  interface KeywordDefinition {
+    type?: string | Array<string>;
+    async?: boolean;
+    $data?: boolean;
+    errors?: boolean | string;
+    metaSchema?: object;
+    // schema: false makes validate not to expect schema (ValidateFunction)
+    schema?: boolean;
+    statements?: boolean;
+    dependencies?: Array<string>;
+    modifying?: boolean;
+    valid?: boolean;
+    // one and only one of the following properties should be present
+    validate?: SchemaValidateFunction | ValidateFunction;
+    compile?: (schema: any, parentSchema: object, it: CompilationContext) => ValidateFunction;
+    macro?: (schema: any, parentSchema: object, it: CompilationContext) => object | boolean;
+    inline?: (it: CompilationContext, keyword: string, schema: any, parentSchema: object) => string;
+  }
+
+  interface CompilationContext {
+    level: number;
+    dataLevel: number;
+    dataPathArr: string[];
+    schema: any;
+    schemaPath: string;
+    baseId: string;
+    async: boolean;
+    opts: Options;
+    formats: {
+      [index: string]: FormatDefinition | undefined;
+    };
+    keywords: {
+      [index: string]: KeywordDefinition | undefined;
+    };
+    compositeRule: boolean;
+    validate: (schema: object) => boolean;
+    util: {
+      copy(obj: any, target?: any): any;
+      toHash(source: string[]): { [index: string]: true | undefined };
+      equal(obj: any, target: any): boolean;
+      getProperty(str: string): string;
+      schemaHasRules(schema: object, rules: any): string;
+      escapeQuotes(str: string): string;
+      toQuotedString(str: string): string;
+      getData(jsonPointer: string, dataLevel: number, paths: string[]): string;
+      escapeJsonPointer(str: string): string;
+      unescapeJsonPointer(str: string): string;
+      escapeFragment(str: string): string;
+      unescapeFragment(str: string): string;
+    };
+    self: Ajv;
+  }
+
+  interface SchemaValidateFunction {
+    (
+      schema: any,
+      data: any,
+      parentSchema?: object,
+      dataPath?: string,
+      parentData?: object | Array<any>,
+      parentDataProperty?: string | number,
+      rootData?: object | Array<any>
+    ): boolean | PromiseLike<any>;
+    errors?: Array<ErrorObject>;
+  }
+
+  interface ErrorsTextOptions {
+    separator?: string;
+    dataVar?: string;
+  }
+
+  interface ErrorObject {
+    keyword: string;
+    dataPath: string;
+    schemaPath: string;
+    params: ErrorParameters;
+    // Added to validation errors of propertyNames keyword schema
+    propertyName?: string;
+    // Excluded if messages set to false.
+    message?: string;
+    // These are added with the `verbose` option.
+    schema?: any;
+    parentSchema?: object;
+    data?: any;
+  }
+
+  type ErrorParameters = RefParams | LimitParams | AdditionalPropertiesParams |
+    DependenciesParams | FormatParams | ComparisonParams |
+    MultipleOfParams | PatternParams | RequiredParams |
+    TypeParams | UniqueItemsParams | CustomParams |
+    PatternRequiredParams | PropertyNamesParams |
+    IfParams | SwitchParams | NoParams | EnumParams;
+
+  interface RefParams {
+    ref: string;
+  }
+
+  interface LimitParams {
+    limit: number;
+  }
+
+  interface AdditionalPropertiesParams {
+    additionalProperty: string;
+  }
+
+  interface DependenciesParams {
+    property: string;
+    missingProperty: string;
+    depsCount: number;
+    deps: string;
+  }
+
+  interface FormatParams {
+    format: string
+  }
+
+  interface ComparisonParams {
+    comparison: string;
+    limit: number | string;
+    exclusive: boolean;
+  }
+
+  interface MultipleOfParams {
+    multipleOf: number;
+  }
+
+  interface PatternParams {
+    pattern: string;
+  }
+
+  interface RequiredParams {
+    missingProperty: string;
+  }
+
+  interface TypeParams {
+    type: string;
+  }
+
+  interface UniqueItemsParams {
+    i: number;
+    j: number;
+  }
+
+  interface CustomParams {
+    keyword: string;
+  }
+
+  interface PatternRequiredParams {
+    missingPattern: string;
+  }
+
+  interface PropertyNamesParams {
+    propertyName: string;
+  }
+
+  interface IfParams {
+    failingKeyword: string;
+  }
+
+  interface SwitchParams {
+    caseIndex: number;
+  }
+
+  interface NoParams { }
+
+  interface EnumParams {
+    allowedValues: Array<any>;
+  }
+}
+
+export = ajv;
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/ajv.js b/node_modules/mathjs/examples/node_modules/ajv/lib/ajv.js
new file mode 100644
index 0000000..06a45b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/ajv.js
@@ -0,0 +1,506 @@
+'use strict';
+
+var compileSchema = require('./compile')
+  , resolve = require('./compile/resolve')
+  , Cache = require('./cache')
+  , SchemaObject = require('./compile/schema_obj')
+  , stableStringify = require('fast-json-stable-stringify')
+  , formats = require('./compile/formats')
+  , rules = require('./compile/rules')
+  , $dataMetaSchema = require('./data')
+  , util = require('./compile/util');
+
+module.exports = Ajv;
+
+Ajv.prototype.validate = validate;
+Ajv.prototype.compile = compile;
+Ajv.prototype.addSchema = addSchema;
+Ajv.prototype.addMetaSchema = addMetaSchema;
+Ajv.prototype.validateSchema = validateSchema;
+Ajv.prototype.getSchema = getSchema;
+Ajv.prototype.removeSchema = removeSchema;
+Ajv.prototype.addFormat = addFormat;
+Ajv.prototype.errorsText = errorsText;
+
+Ajv.prototype._addSchema = _addSchema;
+Ajv.prototype._compile = _compile;
+
+Ajv.prototype.compileAsync = require('./compile/async');
+var customKeyword = require('./keyword');
+Ajv.prototype.addKeyword = customKeyword.add;
+Ajv.prototype.getKeyword = customKeyword.get;
+Ajv.prototype.removeKeyword = customKeyword.remove;
+Ajv.prototype.validateKeyword = customKeyword.validate;
+
+var errorClasses = require('./compile/error_classes');
+Ajv.ValidationError = errorClasses.Validation;
+Ajv.MissingRefError = errorClasses.MissingRef;
+Ajv.$dataMetaSchema = $dataMetaSchema;
+
+var META_SCHEMA_ID = 'http://json-schema.org/draft-07/schema';
+
+var META_IGNORE_OPTIONS = [ 'removeAdditional', 'useDefaults', 'coerceTypes', 'strictDefaults' ];
+var META_SUPPORT_DATA = ['/properties'];
+
+/**
+ * Creates validator instance.
+ * Usage: `Ajv(opts)`
+ * @param {Object} opts optional options
+ * @return {Object} ajv instance
+ */
+function Ajv(opts) {
+  if (!(this instanceof Ajv)) return new Ajv(opts);
+  opts = this._opts = util.copy(opts) || {};
+  setLogger(this);
+  this._schemas = {};
+  this._refs = {};
+  this._fragments = {};
+  this._formats = formats(opts.format);
+
+  this._cache = opts.cache || new Cache;
+  this._loadingSchemas = {};
+  this._compilations = [];
+  this.RULES = rules();
+  this._getId = chooseGetId(opts);
+
+  opts.loopRequired = opts.loopRequired || Infinity;
+  if (opts.errorDataPath == 'property') opts._errorDataPathProperty = true;
+  if (opts.serialize === undefined) opts.serialize = stableStringify;
+  this._metaOpts = getMetaSchemaOptions(this);
+
+  if (opts.formats) addInitialFormats(this);
+  if (opts.keywords) addInitialKeywords(this);
+  addDefaultMetaSchema(this);
+  if (typeof opts.meta == 'object') this.addMetaSchema(opts.meta);
+  if (opts.nullable) this.addKeyword('nullable', {metaSchema: {type: 'boolean'}});
+  addInitialSchemas(this);
+}
+
+
+
+/**
+ * Validate data using schema
+ * Schema will be compiled and cached (using serialized JSON as key. [fast-json-stable-stringify](https://github.com/epoberezkin/fast-json-stable-stringify) is used to serialize.
+ * @this   Ajv
+ * @param  {String|Object} schemaKeyRef key, ref or schema object
+ * @param  {Any} data to be validated
+ * @return {Boolean} validation result. Errors from the last validation will be available in `ajv.errors` (and also in compiled schema: `schema.errors`).
+ */
+function validate(schemaKeyRef, data) {
+  var v;
+  if (typeof schemaKeyRef == 'string') {
+    v = this.getSchema(schemaKeyRef);
+    if (!v) throw new Error('no schema with key or ref "' + schemaKeyRef + '"');
+  } else {
+    var schemaObj = this._addSchema(schemaKeyRef);
+    v = schemaObj.validate || this._compile(schemaObj);
+  }
+
+  var valid = v(data);
+  if (v.$async !== true) this.errors = v.errors;
+  return valid;
+}
+
+
+/**
+ * Create validating function for passed schema.
+ * @this   Ajv
+ * @param  {Object} schema schema object
+ * @param  {Boolean} _meta true if schema is a meta-schema. Used internally to compile meta schemas of custom keywords.
+ * @return {Function} validating function
+ */
+function compile(schema, _meta) {
+  var schemaObj = this._addSchema(schema, undefined, _meta);
+  return schemaObj.validate || this._compile(schemaObj);
+}
+
+
+/**
+ * Adds schema to the instance.
+ * @this   Ajv
+ * @param {Object|Array} schema schema or array of schemas. If array is passed, `key` and other parameters will be ignored.
+ * @param {String} key Optional schema key. Can be passed to `validate` method instead of schema object or id/ref. One schema per instance can have empty `id` and `key`.
+ * @param {Boolean} _skipValidation true to skip schema validation. Used internally, option validateSchema should be used instead.
+ * @param {Boolean} _meta true if schema is a meta-schema. Used internally, addMetaSchema should be used instead.
+ * @return {Ajv} this for method chaining
+ */
+function addSchema(schema, key, _skipValidation, _meta) {
+  if (Array.isArray(schema)){
+    for (var i=0; i<schema.length; i++) this.addSchema(schema[i], undefined, _skipValidation, _meta);
+    return this;
+  }
+  var id = this._getId(schema);
+  if (id !== undefined && typeof id != 'string')
+    throw new Error('schema id must be string');
+  key = resolve.normalizeId(key || id);
+  checkUnique(this, key);
+  this._schemas[key] = this._addSchema(schema, _skipValidation, _meta, true);
+  return this;
+}
+
+
+/**
+ * Add schema that will be used to validate other schemas
+ * options in META_IGNORE_OPTIONS are alway set to false
+ * @this   Ajv
+ * @param {Object} schema schema object
+ * @param {String} key optional schema key
+ * @param {Boolean} skipValidation true to skip schema validation, can be used to override validateSchema option for meta-schema
+ * @return {Ajv} this for method chaining
+ */
+function addMetaSchema(schema, key, skipValidation) {
+  this.addSchema(schema, key, skipValidation, true);
+  return this;
+}
+
+
+/**
+ * Validate schema
+ * @this   Ajv
+ * @param {Object} schema schema to validate
+ * @param {Boolean} throwOrLogError pass true to throw (or log) an error if invalid
+ * @return {Boolean} true if schema is valid
+ */
+function validateSchema(schema, throwOrLogError) {
+  var $schema = schema.$schema;
+  if ($schema !== undefined && typeof $schema != 'string')
+    throw new Error('$schema must be a string');
+  $schema = $schema || this._opts.defaultMeta || defaultMeta(this);
+  if (!$schema) {
+    this.logger.warn('meta-schema not available');
+    this.errors = null;
+    return true;
+  }
+  var valid = this.validate($schema, schema);
+  if (!valid && throwOrLogError) {
+    var message = 'schema is invalid: ' + this.errorsText();
+    if (this._opts.validateSchema == 'log') this.logger.error(message);
+    else throw new Error(message);
+  }
+  return valid;
+}
+
+
+function defaultMeta(self) {
+  var meta = self._opts.meta;
+  self._opts.defaultMeta = typeof meta == 'object'
+                            ? self._getId(meta) || meta
+                            : self.getSchema(META_SCHEMA_ID)
+                              ? META_SCHEMA_ID
+                              : undefined;
+  return self._opts.defaultMeta;
+}
+
+
+/**
+ * Get compiled schema from the instance by `key` or `ref`.
+ * @this   Ajv
+ * @param  {String} keyRef `key` that was passed to `addSchema` or full schema reference (`schema.id` or resolved id).
+ * @return {Function} schema validating function (with property `schema`).
+ */
+function getSchema(keyRef) {
+  var schemaObj = _getSchemaObj(this, keyRef);
+  switch (typeof schemaObj) {
+    case 'object': return schemaObj.validate || this._compile(schemaObj);
+    case 'string': return this.getSchema(schemaObj);
+    case 'undefined': return _getSchemaFragment(this, keyRef);
+  }
+}
+
+
+function _getSchemaFragment(self, ref) {
+  var res = resolve.schema.call(self, { schema: {} }, ref);
+  if (res) {
+    var schema = res.schema
+      , root = res.root
+      , baseId = res.baseId;
+    var v = compileSchema.call(self, schema, root, undefined, baseId);
+    self._fragments[ref] = new SchemaObject({
+      ref: ref,
+      fragment: true,
+      schema: schema,
+      root: root,
+      baseId: baseId,
+      validate: v
+    });
+    return v;
+  }
+}
+
+
+function _getSchemaObj(self, keyRef) {
+  keyRef = resolve.normalizeId(keyRef);
+  return self._schemas[keyRef] || self._refs[keyRef] || self._fragments[keyRef];
+}
+
+
+/**
+ * Remove cached schema(s).
+ * If no parameter is passed all schemas but meta-schemas are removed.
+ * If RegExp is passed all schemas with key/id matching pattern but meta-schemas are removed.
+ * Even if schema is referenced by other schemas it still can be removed as other schemas have local references.
+ * @this   Ajv
+ * @param  {String|Object|RegExp} schemaKeyRef key, ref, pattern to match key/ref or schema object
+ * @return {Ajv} this for method chaining
+ */
+function removeSchema(schemaKeyRef) {
+  if (schemaKeyRef instanceof RegExp) {
+    _removeAllSchemas(this, this._schemas, schemaKeyRef);
+    _removeAllSchemas(this, this._refs, schemaKeyRef);
+    return this;
+  }
+  switch (typeof schemaKeyRef) {
+    case 'undefined':
+      _removeAllSchemas(this, this._schemas);
+      _removeAllSchemas(this, this._refs);
+      this._cache.clear();
+      return this;
+    case 'string':
+      var schemaObj = _getSchemaObj(this, schemaKeyRef);
+      if (schemaObj) this._cache.del(schemaObj.cacheKey);
+      delete this._schemas[schemaKeyRef];
+      delete this._refs[schemaKeyRef];
+      return this;
+    case 'object':
+      var serialize = this._opts.serialize;
+      var cacheKey = serialize ? serialize(schemaKeyRef) : schemaKeyRef;
+      this._cache.del(cacheKey);
+      var id = this._getId(schemaKeyRef);
+      if (id) {
+        id = resolve.normalizeId(id);
+        delete this._schemas[id];
+        delete this._refs[id];
+      }
+  }
+  return this;
+}
+
+
+function _removeAllSchemas(self, schemas, regex) {
+  for (var keyRef in schemas) {
+    var schemaObj = schemas[keyRef];
+    if (!schemaObj.meta && (!regex || regex.test(keyRef))) {
+      self._cache.del(schemaObj.cacheKey);
+      delete schemas[keyRef];
+    }
+  }
+}
+
+
+/* @this   Ajv */
+function _addSchema(schema, skipValidation, meta, shouldAddSchema) {
+  if (typeof schema != 'object' && typeof schema != 'boolean')
+    throw new Error('schema should be object or boolean');
+  var serialize = this._opts.serialize;
+  var cacheKey = serialize ? serialize(schema) : schema;
+  var cached = this._cache.get(cacheKey);
+  if (cached) return cached;
+
+  shouldAddSchema = shouldAddSchema || this._opts.addUsedSchema !== false;
+
+  var id = resolve.normalizeId(this._getId(schema));
+  if (id && shouldAddSchema) checkUnique(this, id);
+
+  var willValidate = this._opts.validateSchema !== false && !skipValidation;
+  var recursiveMeta;
+  if (willValidate && !(recursiveMeta = id && id == resolve.normalizeId(schema.$schema)))
+    this.validateSchema(schema, true);
+
+  var localRefs = resolve.ids.call(this, schema);
+
+  var schemaObj = new SchemaObject({
+    id: id,
+    schema: schema,
+    localRefs: localRefs,
+    cacheKey: cacheKey,
+    meta: meta
+  });
+
+  if (id[0] != '#' && shouldAddSchema) this._refs[id] = schemaObj;
+  this._cache.put(cacheKey, schemaObj);
+
+  if (willValidate && recursiveMeta) this.validateSchema(schema, true);
+
+  return schemaObj;
+}
+
+
+/* @this   Ajv */
+function _compile(schemaObj, root) {
+  if (schemaObj.compiling) {
+    schemaObj.validate = callValidate;
+    callValidate.schema = schemaObj.schema;
+    callValidate.errors = null;
+    callValidate.root = root ? root : callValidate;
+    if (schemaObj.schema.$async === true)
+      callValidate.$async = true;
+    return callValidate;
+  }
+  schemaObj.compiling = true;
+
+  var currentOpts;
+  if (schemaObj.meta) {
+    currentOpts = this._opts;
+    this._opts = this._metaOpts;
+  }
+
+  var v;
+  try { v = compileSchema.call(this, schemaObj.schema, root, schemaObj.localRefs); }
+  catch(e) {
+    delete schemaObj.validate;
+    throw e;
+  }
+  finally {
+    schemaObj.compiling = false;
+    if (schemaObj.meta) this._opts = currentOpts;
+  }
+
+  schemaObj.validate = v;
+  schemaObj.refs = v.refs;
+  schemaObj.refVal = v.refVal;
+  schemaObj.root = v.root;
+  return v;
+
+
+  /* @this   {*} - custom context, see passContext option */
+  function callValidate() {
+    /* jshint validthis: true */
+    var _validate = schemaObj.validate;
+    var result = _validate.apply(this, arguments);
+    callValidate.errors = _validate.errors;
+    return result;
+  }
+}
+
+
+function chooseGetId(opts) {
+  switch (opts.schemaId) {
+    case 'auto': return _get$IdOrId;
+    case 'id': return _getId;
+    default: return _get$Id;
+  }
+}
+
+/* @this   Ajv */
+function _getId(schema) {
+  if (schema.$id) this.logger.warn('schema $id ignored', schema.$id);
+  return schema.id;
+}
+
+/* @this   Ajv */
+function _get$Id(schema) {
+  if (schema.id) this.logger.warn('schema id ignored', schema.id);
+  return schema.$id;
+}
+
+
+function _get$IdOrId(schema) {
+  if (schema.$id && schema.id && schema.$id != schema.id)
+    throw new Error('schema $id is different from id');
+  return schema.$id || schema.id;
+}
+
+
+/**
+ * Convert array of error message objects to string
+ * @this   Ajv
+ * @param  {Array<Object>} errors optional array of validation errors, if not passed errors from the instance are used.
+ * @param  {Object} options optional options with properties `separator` and `dataVar`.
+ * @return {String} human readable string with all errors descriptions
+ */
+function errorsText(errors, options) {
+  errors = errors || this.errors;
+  if (!errors) return 'No errors';
+  options = options || {};
+  var separator = options.separator === undefined ? ', ' : options.separator;
+  var dataVar = options.dataVar === undefined ? 'data' : options.dataVar;
+
+  var text = '';
+  for (var i=0; i<errors.length; i++) {
+    var e = errors[i];
+    if (e) text += dataVar + e.dataPath + ' ' + e.message + separator;
+  }
+  return text.slice(0, -separator.length);
+}
+
+
+/**
+ * Add custom format
+ * @this   Ajv
+ * @param {String} name format name
+ * @param {String|RegExp|Function} format string is converted to RegExp; function should return boolean (true when valid)
+ * @return {Ajv} this for method chaining
+ */
+function addFormat(name, format) {
+  if (typeof format == 'string') format = new RegExp(format);
+  this._formats[name] = format;
+  return this;
+}
+
+
+function addDefaultMetaSchema(self) {
+  var $dataSchema;
+  if (self._opts.$data) {
+    $dataSchema = require('./refs/data.json');
+    self.addMetaSchema($dataSchema, $dataSchema.$id, true);
+  }
+  if (self._opts.meta === false) return;
+  var metaSchema = require('./refs/json-schema-draft-07.json');
+  if (self._opts.$data) metaSchema = $dataMetaSchema(metaSchema, META_SUPPORT_DATA);
+  self.addMetaSchema(metaSchema, META_SCHEMA_ID, true);
+  self._refs['http://json-schema.org/schema'] = META_SCHEMA_ID;
+}
+
+
+function addInitialSchemas(self) {
+  var optsSchemas = self._opts.schemas;
+  if (!optsSchemas) return;
+  if (Array.isArray(optsSchemas)) self.addSchema(optsSchemas);
+  else for (var key in optsSchemas) self.addSchema(optsSchemas[key], key);
+}
+
+
+function addInitialFormats(self) {
+  for (var name in self._opts.formats) {
+    var format = self._opts.formats[name];
+    self.addFormat(name, format);
+  }
+}
+
+
+function addInitialKeywords(self) {
+  for (var name in self._opts.keywords) {
+    var keyword = self._opts.keywords[name];
+    self.addKeyword(name, keyword);
+  }
+}
+
+
+function checkUnique(self, id) {
+  if (self._schemas[id] || self._refs[id])
+    throw new Error('schema with key or id "' + id + '" already exists');
+}
+
+
+function getMetaSchemaOptions(self) {
+  var metaOpts = util.copy(self._opts);
+  for (var i=0; i<META_IGNORE_OPTIONS.length; i++)
+    delete metaOpts[META_IGNORE_OPTIONS[i]];
+  return metaOpts;
+}
+
+
+function setLogger(self) {
+  var logger = self._opts.logger;
+  if (logger === false) {
+    self.logger = {log: noop, warn: noop, error: noop};
+  } else {
+    if (logger === undefined) logger = console;
+    if (!(typeof logger == 'object' && logger.log && logger.warn && logger.error))
+      throw new Error('logger must implement log, warn and error methods');
+    self.logger = logger;
+  }
+}
+
+
+function noop() {}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/cache.js b/node_modules/mathjs/examples/node_modules/ajv/lib/cache.js
new file mode 100644
index 0000000..7558874
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/cache.js
@@ -0,0 +1,26 @@
+'use strict';
+
+
+var Cache = module.exports = function Cache() {
+  this._cache = {};
+};
+
+
+Cache.prototype.put = function Cache_put(key, value) {
+  this._cache[key] = value;
+};
+
+
+Cache.prototype.get = function Cache_get(key) {
+  return this._cache[key];
+};
+
+
+Cache.prototype.del = function Cache_del(key) {
+  delete this._cache[key];
+};
+
+
+Cache.prototype.clear = function Cache_clear() {
+  this._cache = {};
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/async.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/async.js
new file mode 100644
index 0000000..6a30b88
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/async.js
@@ -0,0 +1,90 @@
+'use strict';
+
+var MissingRefError = require('./error_classes').MissingRef;
+
+module.exports = compileAsync;
+
+
+/**
+ * Creates validating function for passed schema with asynchronous loading of missing schemas.
+ * `loadSchema` option should be a function that accepts schema uri and returns promise that resolves with the schema.
+ * @this  Ajv
+ * @param {Object}   schema schema object
+ * @param {Boolean}  meta optional true to compile meta-schema; this parameter can be skipped
+ * @param {Function} callback an optional node-style callback, it is called with 2 parameters: error (or null) and validating function.
+ * @return {Promise} promise that resolves with a validating function.
+ */
+function compileAsync(schema, meta, callback) {
+  /* eslint no-shadow: 0 */
+  /* global Promise */
+  /* jshint validthis: true */
+  var self = this;
+  if (typeof this._opts.loadSchema != 'function')
+    throw new Error('options.loadSchema should be a function');
+
+  if (typeof meta == 'function') {
+    callback = meta;
+    meta = undefined;
+  }
+
+  var p = loadMetaSchemaOf(schema).then(function () {
+    var schemaObj = self._addSchema(schema, undefined, meta);
+    return schemaObj.validate || _compileAsync(schemaObj);
+  });
+
+  if (callback) {
+    p.then(
+      function(v) { callback(null, v); },
+      callback
+    );
+  }
+
+  return p;
+
+
+  function loadMetaSchemaOf(sch) {
+    var $schema = sch.$schema;
+    return $schema && !self.getSchema($schema)
+            ? compileAsync.call(self, { $ref: $schema }, true)
+            : Promise.resolve();
+  }
+
+
+  function _compileAsync(schemaObj) {
+    try { return self._compile(schemaObj); }
+    catch(e) {
+      if (e instanceof MissingRefError) return loadMissingSchema(e);
+      throw e;
+    }
+
+
+    function loadMissingSchema(e) {
+      var ref = e.missingSchema;
+      if (added(ref)) throw new Error('Schema ' + ref + ' is loaded but ' + e.missingRef + ' cannot be resolved');
+
+      var schemaPromise = self._loadingSchemas[ref];
+      if (!schemaPromise) {
+        schemaPromise = self._loadingSchemas[ref] = self._opts.loadSchema(ref);
+        schemaPromise.then(removePromise, removePromise);
+      }
+
+      return schemaPromise.then(function (sch) {
+        if (!added(ref)) {
+          return loadMetaSchemaOf(sch).then(function () {
+            if (!added(ref)) self.addSchema(sch, ref, undefined, meta);
+          });
+        }
+      }).then(function() {
+        return _compileAsync(schemaObj);
+      });
+
+      function removePromise() {
+        delete self._loadingSchemas[ref];
+      }
+
+      function added(ref) {
+        return self._refs[ref] || self._schemas[ref];
+      }
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/equal.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/equal.js
new file mode 100644
index 0000000..d6c2ace
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/equal.js
@@ -0,0 +1,5 @@
+'use strict';
+
+// do NOT remove this file - it would break pre-compiled schemas
+// https://github.com/ajv-validator/ajv/issues/889
+module.exports = require('fast-deep-equal');
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/error_classes.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/error_classes.js
new file mode 100644
index 0000000..0b0ec4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/error_classes.js
@@ -0,0 +1,34 @@
+'use strict';
+
+var resolve = require('./resolve');
+
+module.exports = {
+  Validation: errorSubclass(ValidationError),
+  MissingRef: errorSubclass(MissingRefError)
+};
+
+
+function ValidationError(errors) {
+  this.message = 'validation failed';
+  this.errors = errors;
+  this.ajv = this.validation = true;
+}
+
+
+MissingRefError.message = function (baseId, ref) {
+  return 'can\'t resolve reference ' + ref + ' from id ' + baseId;
+};
+
+
+function MissingRefError(baseId, ref, message) {
+  this.message = message || MissingRefError.message(baseId, ref);
+  this.missingRef = resolve.url(baseId, ref);
+  this.missingSchema = resolve.normalizeId(resolve.fullPath(this.missingRef));
+}
+
+
+function errorSubclass(Subclass) {
+  Subclass.prototype = Object.create(Error.prototype);
+  Subclass.prototype.constructor = Subclass;
+  return Subclass;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/formats.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/formats.js
new file mode 100644
index 0000000..de94a63
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/formats.js
@@ -0,0 +1,142 @@
+'use strict';
+
+var util = require('./util');
+
+var DATE = /^(\d\d\d\d)-(\d\d)-(\d\d)$/;
+var DAYS = [0,31,28,31,30,31,30,31,31,30,31,30,31];
+var TIME = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i;
+var HOSTNAME = /^(?=.{1,253}\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\.?$/i;
+var URI = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
+var URIREF = /^(?:[a-z][a-z0-9+\-.]*:)?(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'"()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\?(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
+// uri-template: https://tools.ietf.org/html/rfc6570
+var URITEMPLATE = /^(?:(?:[^\x00-\x20"'<>%\\^`{|}]|%[0-9a-f]{2})|\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?)*\})*$/i;
+// For the source: https://gist.github.com/dperini/729294
+// For test cases: https://mathiasbynens.be/demo/url-regex
+// @todo Delete current URL in favour of the commented out URL rule when this issue is fixed https://github.com/eslint/eslint/issues/7983.
+// var URL = /^(?:(?:https?|ftp):\/\/)(?:\S+(?::\S*)?@)?(?:(?!10(?:\.\d{1,3}){3})(?!127(?:\.\d{1,3}){3})(?!169\.254(?:\.\d{1,3}){2})(?!192\.168(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\u{00a1}-\u{ffff}0-9]+-)*[a-z\u{00a1}-\u{ffff}0-9]+)(?:\.(?:[a-z\u{00a1}-\u{ffff}0-9]+-)*[a-z\u{00a1}-\u{ffff}0-9]+)*(?:\.(?:[a-z\u{00a1}-\u{ffff}]{2,})))(?::\d{2,5})?(?:\/[^\s]*)?$/iu;
+var URL = /^(?:(?:http[s\u017F]?|ftp):\/\/)(?:(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+(?::(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])*)?@)?(?:(?!10(?:\.[0-9]{1,3}){3})(?!127(?:\.[0-9]{1,3}){3})(?!169\.254(?:\.[0-9]{1,3}){2})(?!192\.168(?:\.[0-9]{1,3}){2})(?!172\.(?:1[6-9]|2[0-9]|3[01])(?:\.[0-9]{1,3}){2})(?:[1-9][0-9]?|1[0-9][0-9]|2[01][0-9]|22[0-3])(?:\.(?:1?[0-9]{1,2}|2[0-4][0-9]|25[0-5])){2}(?:\.(?:[1-9][0-9]?|1[0-9][0-9]|2[0-4][0-9]|25[0-4]))|(?:(?:(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+-)*(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+)(?:\.(?:(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+-)*(?:[0-9a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+)*(?:\.(?:(?:[a-z\xA1-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]){2,})))(?::[0-9]{2,5})?(?:\/(?:[\0-\x08\x0E-\x1F!-\x9F\xA1-\u167F\u1681-\u1FFF\u200B-\u2027\u202A-\u202E\u2030-\u205E\u2060-\u2FFF\u3001-\uD7FF\uE000-\uFEFE\uFF00-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])*)?$/i;
+var UUID = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i;
+var JSON_POINTER = /^(?:\/(?:[^~/]|~0|~1)*)*$/;
+var JSON_POINTER_URI_FRAGMENT = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i;
+var RELATIVE_JSON_POINTER = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/;
+
+
+module.exports = formats;
+
+function formats(mode) {
+  mode = mode == 'full' ? 'full' : 'fast';
+  return util.copy(formats[mode]);
+}
+
+
+formats.fast = {
+  // date: http://tools.ietf.org/html/rfc3339#section-5.6
+  date: /^\d\d\d\d-[0-1]\d-[0-3]\d$/,
+  // date-time: http://tools.ietf.org/html/rfc3339#section-5.6
+  time: /^(?:[0-2]\d:[0-5]\d:[0-5]\d|23:59:60)(?:\.\d+)?(?:z|[+-]\d\d(?::?\d\d)?)?$/i,
+  'date-time': /^\d\d\d\d-[0-1]\d-[0-3]\d[t\s](?:[0-2]\d:[0-5]\d:[0-5]\d|23:59:60)(?:\.\d+)?(?:z|[+-]\d\d(?::?\d\d)?)$/i,
+  // uri: https://github.com/mafintosh/is-my-json-valid/blob/master/formats.js
+  uri: /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/)?[^\s]*$/i,
+  'uri-reference': /^(?:(?:[a-z][a-z0-9+\-.]*:)?\/?\/)?(?:[^\\\s#][^\s#]*)?(?:#[^\\\s]*)?$/i,
+  'uri-template': URITEMPLATE,
+  url: URL,
+  // email (sources from jsen validator):
+  // http://stackoverflow.com/questions/201323/using-a-regular-expression-to-validate-an-email-address#answer-8829363
+  // http://www.w3.org/TR/html5/forms.html#valid-e-mail-address (search for 'willful violation')
+  email: /^[a-z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?)*$/i,
+  hostname: HOSTNAME,
+  // optimized https://www.safaribooksonline.com/library/view/regular-expressions-cookbook/9780596802837/ch07s16.html
+  ipv4: /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/,
+  // optimized http://stackoverflow.com/questions/53497/regular-expression-that-matches-valid-ipv6-addresses
+  ipv6: /^\s*(?:(?:(?:[0-9a-f]{1,4}:){7}(?:[0-9a-f]{1,4}|:))|(?:(?:[0-9a-f]{1,4}:){6}(?::[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){5}(?:(?:(?::[0-9a-f]{1,4}){1,2})|:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){4}(?:(?:(?::[0-9a-f]{1,4}){1,3})|(?:(?::[0-9a-f]{1,4})?:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){3}(?:(?:(?::[0-9a-f]{1,4}){1,4})|(?:(?::[0-9a-f]{1,4}){0,2}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){2}(?:(?:(?::[0-9a-f]{1,4}){1,5})|(?:(?::[0-9a-f]{1,4}){0,3}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){1}(?:(?:(?::[0-9a-f]{1,4}){1,6})|(?:(?::[0-9a-f]{1,4}){0,4}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?::(?:(?:(?::[0-9a-f]{1,4}){1,7})|(?:(?::[0-9a-f]{1,4}){0,5}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))(?:%.+)?\s*$/i,
+  regex: regex,
+  // uuid: http://tools.ietf.org/html/rfc4122
+  uuid: UUID,
+  // JSON-pointer: https://tools.ietf.org/html/rfc6901
+  // uri fragment: https://tools.ietf.org/html/rfc3986#appendix-A
+  'json-pointer': JSON_POINTER,
+  'json-pointer-uri-fragment': JSON_POINTER_URI_FRAGMENT,
+  // relative JSON-pointer: http://tools.ietf.org/html/draft-luff-relative-json-pointer-00
+  'relative-json-pointer': RELATIVE_JSON_POINTER
+};
+
+
+formats.full = {
+  date: date,
+  time: time,
+  'date-time': date_time,
+  uri: uri,
+  'uri-reference': URIREF,
+  'uri-template': URITEMPLATE,
+  url: URL,
+  email: /^[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*@(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?$/i,
+  hostname: HOSTNAME,
+  ipv4: /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/,
+  ipv6: /^\s*(?:(?:(?:[0-9a-f]{1,4}:){7}(?:[0-9a-f]{1,4}|:))|(?:(?:[0-9a-f]{1,4}:){6}(?::[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){5}(?:(?:(?::[0-9a-f]{1,4}){1,2})|:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(?:(?:[0-9a-f]{1,4}:){4}(?:(?:(?::[0-9a-f]{1,4}){1,3})|(?:(?::[0-9a-f]{1,4})?:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){3}(?:(?:(?::[0-9a-f]{1,4}){1,4})|(?:(?::[0-9a-f]{1,4}){0,2}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){2}(?:(?:(?::[0-9a-f]{1,4}){1,5})|(?:(?::[0-9a-f]{1,4}){0,3}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?:(?:[0-9a-f]{1,4}:){1}(?:(?:(?::[0-9a-f]{1,4}){1,6})|(?:(?::[0-9a-f]{1,4}){0,4}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(?::(?:(?:(?::[0-9a-f]{1,4}){1,7})|(?:(?::[0-9a-f]{1,4}){0,5}:(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(?:\.(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))(?:%.+)?\s*$/i,
+  regex: regex,
+  uuid: UUID,
+  'json-pointer': JSON_POINTER,
+  'json-pointer-uri-fragment': JSON_POINTER_URI_FRAGMENT,
+  'relative-json-pointer': RELATIVE_JSON_POINTER
+};
+
+
+function isLeapYear(year) {
+  // https://tools.ietf.org/html/rfc3339#appendix-C
+  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+}
+
+
+function date(str) {
+  // full-date from http://tools.ietf.org/html/rfc3339#section-5.6
+  var matches = str.match(DATE);
+  if (!matches) return false;
+
+  var year = +matches[1];
+  var month = +matches[2];
+  var day = +matches[3];
+
+  return month >= 1 && month <= 12 && day >= 1 &&
+          day <= (month == 2 && isLeapYear(year) ? 29 : DAYS[month]);
+}
+
+
+function time(str, full) {
+  var matches = str.match(TIME);
+  if (!matches) return false;
+
+  var hour = matches[1];
+  var minute = matches[2];
+  var second = matches[3];
+  var timeZone = matches[5];
+  return ((hour <= 23 && minute <= 59 && second <= 59) ||
+          (hour == 23 && minute == 59 && second == 60)) &&
+         (!full || timeZone);
+}
+
+
+var DATE_TIME_SEPARATOR = /t|\s/i;
+function date_time(str) {
+  // http://tools.ietf.org/html/rfc3339#section-5.6
+  var dateTime = str.split(DATE_TIME_SEPARATOR);
+  return dateTime.length == 2 && date(dateTime[0]) && time(dateTime[1], true);
+}
+
+
+var NOT_URI_FRAGMENT = /\/|:/;
+function uri(str) {
+  // http://jmrware.com/articles/2009/uri_regexp/URI_regex.html + optional protocol + required "."
+  return NOT_URI_FRAGMENT.test(str) && URI.test(str);
+}
+
+
+var Z_ANCHOR = /[^\\]\\Z/;
+function regex(str) {
+  if (Z_ANCHOR.test(str)) return false;
+  try {
+    new RegExp(str);
+    return true;
+  } catch(e) {
+    return false;
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/index.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/index.js
new file mode 100644
index 0000000..97518c4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/index.js
@@ -0,0 +1,387 @@
+'use strict';
+
+var resolve = require('./resolve')
+  , util = require('./util')
+  , errorClasses = require('./error_classes')
+  , stableStringify = require('fast-json-stable-stringify');
+
+var validateGenerator = require('../dotjs/validate');
+
+/**
+ * Functions below are used inside compiled validations function
+ */
+
+var ucs2length = util.ucs2length;
+var equal = require('fast-deep-equal');
+
+// this error is thrown by async schemas to return validation errors via exception
+var ValidationError = errorClasses.Validation;
+
+module.exports = compile;
+
+
+/**
+ * Compiles schema to validation function
+ * @this   Ajv
+ * @param  {Object} schema schema object
+ * @param  {Object} root object with information about the root schema for this schema
+ * @param  {Object} localRefs the hash of local references inside the schema (created by resolve.id), used for inline resolution
+ * @param  {String} baseId base ID for IDs in the schema
+ * @return {Function} validation function
+ */
+function compile(schema, root, localRefs, baseId) {
+  /* jshint validthis: true, evil: true */
+  /* eslint no-shadow: 0 */
+  var self = this
+    , opts = this._opts
+    , refVal = [ undefined ]
+    , refs = {}
+    , patterns = []
+    , patternsHash = {}
+    , defaults = []
+    , defaultsHash = {}
+    , customRules = [];
+
+  root = root || { schema: schema, refVal: refVal, refs: refs };
+
+  var c = checkCompiling.call(this, schema, root, baseId);
+  var compilation = this._compilations[c.index];
+  if (c.compiling) return (compilation.callValidate = callValidate);
+
+  var formats = this._formats;
+  var RULES = this.RULES;
+
+  try {
+    var v = localCompile(schema, root, localRefs, baseId);
+    compilation.validate = v;
+    var cv = compilation.callValidate;
+    if (cv) {
+      cv.schema = v.schema;
+      cv.errors = null;
+      cv.refs = v.refs;
+      cv.refVal = v.refVal;
+      cv.root = v.root;
+      cv.$async = v.$async;
+      if (opts.sourceCode) cv.source = v.source;
+    }
+    return v;
+  } finally {
+    endCompiling.call(this, schema, root, baseId);
+  }
+
+  /* @this   {*} - custom context, see passContext option */
+  function callValidate() {
+    /* jshint validthis: true */
+    var validate = compilation.validate;
+    var result = validate.apply(this, arguments);
+    callValidate.errors = validate.errors;
+    return result;
+  }
+
+  function localCompile(_schema, _root, localRefs, baseId) {
+    var isRoot = !_root || (_root && _root.schema == _schema);
+    if (_root.schema != root.schema)
+      return compile.call(self, _schema, _root, localRefs, baseId);
+
+    var $async = _schema.$async === true;
+
+    var sourceCode = validateGenerator({
+      isTop: true,
+      schema: _schema,
+      isRoot: isRoot,
+      baseId: baseId,
+      root: _root,
+      schemaPath: '',
+      errSchemaPath: '#',
+      errorPath: '""',
+      MissingRefError: errorClasses.MissingRef,
+      RULES: RULES,
+      validate: validateGenerator,
+      util: util,
+      resolve: resolve,
+      resolveRef: resolveRef,
+      usePattern: usePattern,
+      useDefault: useDefault,
+      useCustomRule: useCustomRule,
+      opts: opts,
+      formats: formats,
+      logger: self.logger,
+      self: self
+    });
+
+    sourceCode = vars(refVal, refValCode) + vars(patterns, patternCode)
+                   + vars(defaults, defaultCode) + vars(customRules, customRuleCode)
+                   + sourceCode;
+
+    if (opts.processCode) sourceCode = opts.processCode(sourceCode, _schema);
+    // console.log('\n\n\n *** \n', JSON.stringify(sourceCode));
+    var validate;
+    try {
+      var makeValidate = new Function(
+        'self',
+        'RULES',
+        'formats',
+        'root',
+        'refVal',
+        'defaults',
+        'customRules',
+        'equal',
+        'ucs2length',
+        'ValidationError',
+        sourceCode
+      );
+
+      validate = makeValidate(
+        self,
+        RULES,
+        formats,
+        root,
+        refVal,
+        defaults,
+        customRules,
+        equal,
+        ucs2length,
+        ValidationError
+      );
+
+      refVal[0] = validate;
+    } catch(e) {
+      self.logger.error('Error compiling schema, function code:', sourceCode);
+      throw e;
+    }
+
+    validate.schema = _schema;
+    validate.errors = null;
+    validate.refs = refs;
+    validate.refVal = refVal;
+    validate.root = isRoot ? validate : _root;
+    if ($async) validate.$async = true;
+    if (opts.sourceCode === true) {
+      validate.source = {
+        code: sourceCode,
+        patterns: patterns,
+        defaults: defaults
+      };
+    }
+
+    return validate;
+  }
+
+  function resolveRef(baseId, ref, isRoot) {
+    ref = resolve.url(baseId, ref);
+    var refIndex = refs[ref];
+    var _refVal, refCode;
+    if (refIndex !== undefined) {
+      _refVal = refVal[refIndex];
+      refCode = 'refVal[' + refIndex + ']';
+      return resolvedRef(_refVal, refCode);
+    }
+    if (!isRoot && root.refs) {
+      var rootRefId = root.refs[ref];
+      if (rootRefId !== undefined) {
+        _refVal = root.refVal[rootRefId];
+        refCode = addLocalRef(ref, _refVal);
+        return resolvedRef(_refVal, refCode);
+      }
+    }
+
+    refCode = addLocalRef(ref);
+    var v = resolve.call(self, localCompile, root, ref);
+    if (v === undefined) {
+      var localSchema = localRefs && localRefs[ref];
+      if (localSchema) {
+        v = resolve.inlineRef(localSchema, opts.inlineRefs)
+            ? localSchema
+            : compile.call(self, localSchema, root, localRefs, baseId);
+      }
+    }
+
+    if (v === undefined) {
+      removeLocalRef(ref);
+    } else {
+      replaceLocalRef(ref, v);
+      return resolvedRef(v, refCode);
+    }
+  }
+
+  function addLocalRef(ref, v) {
+    var refId = refVal.length;
+    refVal[refId] = v;
+    refs[ref] = refId;
+    return 'refVal' + refId;
+  }
+
+  function removeLocalRef(ref) {
+    delete refs[ref];
+  }
+
+  function replaceLocalRef(ref, v) {
+    var refId = refs[ref];
+    refVal[refId] = v;
+  }
+
+  function resolvedRef(refVal, code) {
+    return typeof refVal == 'object' || typeof refVal == 'boolean'
+            ? { code: code, schema: refVal, inline: true }
+            : { code: code, $async: refVal && !!refVal.$async };
+  }
+
+  function usePattern(regexStr) {
+    var index = patternsHash[regexStr];
+    if (index === undefined) {
+      index = patternsHash[regexStr] = patterns.length;
+      patterns[index] = regexStr;
+    }
+    return 'pattern' + index;
+  }
+
+  function useDefault(value) {
+    switch (typeof value) {
+      case 'boolean':
+      case 'number':
+        return '' + value;
+      case 'string':
+        return util.toQuotedString(value);
+      case 'object':
+        if (value === null) return 'null';
+        var valueStr = stableStringify(value);
+        var index = defaultsHash[valueStr];
+        if (index === undefined) {
+          index = defaultsHash[valueStr] = defaults.length;
+          defaults[index] = value;
+        }
+        return 'default' + index;
+    }
+  }
+
+  function useCustomRule(rule, schema, parentSchema, it) {
+    if (self._opts.validateSchema !== false) {
+      var deps = rule.definition.dependencies;
+      if (deps && !deps.every(function(keyword) {
+        return Object.prototype.hasOwnProperty.call(parentSchema, keyword);
+      }))
+        throw new Error('parent schema must have all required keywords: ' + deps.join(','));
+
+      var validateSchema = rule.definition.validateSchema;
+      if (validateSchema) {
+        var valid = validateSchema(schema);
+        if (!valid) {
+          var message = 'keyword schema is invalid: ' + self.errorsText(validateSchema.errors);
+          if (self._opts.validateSchema == 'log') self.logger.error(message);
+          else throw new Error(message);
+        }
+      }
+    }
+
+    var compile = rule.definition.compile
+      , inline = rule.definition.inline
+      , macro = rule.definition.macro;
+
+    var validate;
+    if (compile) {
+      validate = compile.call(self, schema, parentSchema, it);
+    } else if (macro) {
+      validate = macro.call(self, schema, parentSchema, it);
+      if (opts.validateSchema !== false) self.validateSchema(validate, true);
+    } else if (inline) {
+      validate = inline.call(self, it, rule.keyword, schema, parentSchema);
+    } else {
+      validate = rule.definition.validate;
+      if (!validate) return;
+    }
+
+    if (validate === undefined)
+      throw new Error('custom keyword "' + rule.keyword + '"failed to compile');
+
+    var index = customRules.length;
+    customRules[index] = validate;
+
+    return {
+      code: 'customRule' + index,
+      validate: validate
+    };
+  }
+}
+
+
+/**
+ * Checks if the schema is currently compiled
+ * @this   Ajv
+ * @param  {Object} schema schema to compile
+ * @param  {Object} root root object
+ * @param  {String} baseId base schema ID
+ * @return {Object} object with properties "index" (compilation index) and "compiling" (boolean)
+ */
+function checkCompiling(schema, root, baseId) {
+  /* jshint validthis: true */
+  var index = compIndex.call(this, schema, root, baseId);
+  if (index >= 0) return { index: index, compiling: true };
+  index = this._compilations.length;
+  this._compilations[index] = {
+    schema: schema,
+    root: root,
+    baseId: baseId
+  };
+  return { index: index, compiling: false };
+}
+
+
+/**
+ * Removes the schema from the currently compiled list
+ * @this   Ajv
+ * @param  {Object} schema schema to compile
+ * @param  {Object} root root object
+ * @param  {String} baseId base schema ID
+ */
+function endCompiling(schema, root, baseId) {
+  /* jshint validthis: true */
+  var i = compIndex.call(this, schema, root, baseId);
+  if (i >= 0) this._compilations.splice(i, 1);
+}
+
+
+/**
+ * Index of schema compilation in the currently compiled list
+ * @this   Ajv
+ * @param  {Object} schema schema to compile
+ * @param  {Object} root root object
+ * @param  {String} baseId base schema ID
+ * @return {Integer} compilation index
+ */
+function compIndex(schema, root, baseId) {
+  /* jshint validthis: true */
+  for (var i=0; i<this._compilations.length; i++) {
+    var c = this._compilations[i];
+    if (c.schema == schema && c.root == root && c.baseId == baseId) return i;
+  }
+  return -1;
+}
+
+
+function patternCode(i, patterns) {
+  return 'var pattern' + i + ' = new RegExp(' + util.toQuotedString(patterns[i]) + ');';
+}
+
+
+function defaultCode(i) {
+  return 'var default' + i + ' = defaults[' + i + '];';
+}
+
+
+function refValCode(i, refVal) {
+  return refVal[i] === undefined ? '' : 'var refVal' + i + ' = refVal[' + i + '];';
+}
+
+
+function customRuleCode(i) {
+  return 'var customRule' + i + ' = customRules[' + i + '];';
+}
+
+
+function vars(arr, statement) {
+  if (!arr.length) return '';
+  var code = '';
+  for (var i=0; i<arr.length; i++)
+    code += statement(i, arr);
+  return code;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/resolve.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/resolve.js
new file mode 100644
index 0000000..66f2aee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/resolve.js
@@ -0,0 +1,270 @@
+'use strict';
+
+var URI = require('uri-js')
+  , equal = require('fast-deep-equal')
+  , util = require('./util')
+  , SchemaObject = require('./schema_obj')
+  , traverse = require('json-schema-traverse');
+
+module.exports = resolve;
+
+resolve.normalizeId = normalizeId;
+resolve.fullPath = getFullPath;
+resolve.url = resolveUrl;
+resolve.ids = resolveIds;
+resolve.inlineRef = inlineRef;
+resolve.schema = resolveSchema;
+
+/**
+ * [resolve and compile the references ($ref)]
+ * @this   Ajv
+ * @param  {Function} compile reference to schema compilation funciton (localCompile)
+ * @param  {Object} root object with information about the root schema for the current schema
+ * @param  {String} ref reference to resolve
+ * @return {Object|Function} schema object (if the schema can be inlined) or validation function
+ */
+function resolve(compile, root, ref) {
+  /* jshint validthis: true */
+  var refVal = this._refs[ref];
+  if (typeof refVal == 'string') {
+    if (this._refs[refVal]) refVal = this._refs[refVal];
+    else return resolve.call(this, compile, root, refVal);
+  }
+
+  refVal = refVal || this._schemas[ref];
+  if (refVal instanceof SchemaObject) {
+    return inlineRef(refVal.schema, this._opts.inlineRefs)
+            ? refVal.schema
+            : refVal.validate || this._compile(refVal);
+  }
+
+  var res = resolveSchema.call(this, root, ref);
+  var schema, v, baseId;
+  if (res) {
+    schema = res.schema;
+    root = res.root;
+    baseId = res.baseId;
+  }
+
+  if (schema instanceof SchemaObject) {
+    v = schema.validate || compile.call(this, schema.schema, root, undefined, baseId);
+  } else if (schema !== undefined) {
+    v = inlineRef(schema, this._opts.inlineRefs)
+        ? schema
+        : compile.call(this, schema, root, undefined, baseId);
+  }
+
+  return v;
+}
+
+
+/**
+ * Resolve schema, its root and baseId
+ * @this Ajv
+ * @param  {Object} root root object with properties schema, refVal, refs
+ * @param  {String} ref  reference to resolve
+ * @return {Object} object with properties schema, root, baseId
+ */
+function resolveSchema(root, ref) {
+  /* jshint validthis: true */
+  var p = URI.parse(ref)
+    , refPath = _getFullPath(p)
+    , baseId = getFullPath(this._getId(root.schema));
+  if (Object.keys(root.schema).length === 0 || refPath !== baseId) {
+    var id = normalizeId(refPath);
+    var refVal = this._refs[id];
+    if (typeof refVal == 'string') {
+      return resolveRecursive.call(this, root, refVal, p);
+    } else if (refVal instanceof SchemaObject) {
+      if (!refVal.validate) this._compile(refVal);
+      root = refVal;
+    } else {
+      refVal = this._schemas[id];
+      if (refVal instanceof SchemaObject) {
+        if (!refVal.validate) this._compile(refVal);
+        if (id == normalizeId(ref))
+          return { schema: refVal, root: root, baseId: baseId };
+        root = refVal;
+      } else {
+        return;
+      }
+    }
+    if (!root.schema) return;
+    baseId = getFullPath(this._getId(root.schema));
+  }
+  return getJsonPointer.call(this, p, baseId, root.schema, root);
+}
+
+
+/* @this Ajv */
+function resolveRecursive(root, ref, parsedRef) {
+  /* jshint validthis: true */
+  var res = resolveSchema.call(this, root, ref);
+  if (res) {
+    var schema = res.schema;
+    var baseId = res.baseId;
+    root = res.root;
+    var id = this._getId(schema);
+    if (id) baseId = resolveUrl(baseId, id);
+    return getJsonPointer.call(this, parsedRef, baseId, schema, root);
+  }
+}
+
+
+var PREVENT_SCOPE_CHANGE = util.toHash(['properties', 'patternProperties', 'enum', 'dependencies', 'definitions']);
+/* @this Ajv */
+function getJsonPointer(parsedRef, baseId, schema, root) {
+  /* jshint validthis: true */
+  parsedRef.fragment = parsedRef.fragment || '';
+  if (parsedRef.fragment.slice(0,1) != '/') return;
+  var parts = parsedRef.fragment.split('/');
+
+  for (var i = 1; i < parts.length; i++) {
+    var part = parts[i];
+    if (part) {
+      part = util.unescapeFragment(part);
+      schema = schema[part];
+      if (schema === undefined) break;
+      var id;
+      if (!PREVENT_SCOPE_CHANGE[part]) {
+        id = this._getId(schema);
+        if (id) baseId = resolveUrl(baseId, id);
+        if (schema.$ref) {
+          var $ref = resolveUrl(baseId, schema.$ref);
+          var res = resolveSchema.call(this, root, $ref);
+          if (res) {
+            schema = res.schema;
+            root = res.root;
+            baseId = res.baseId;
+          }
+        }
+      }
+    }
+  }
+  if (schema !== undefined && schema !== root.schema)
+    return { schema: schema, root: root, baseId: baseId };
+}
+
+
+var SIMPLE_INLINED = util.toHash([
+  'type', 'format', 'pattern',
+  'maxLength', 'minLength',
+  'maxProperties', 'minProperties',
+  'maxItems', 'minItems',
+  'maximum', 'minimum',
+  'uniqueItems', 'multipleOf',
+  'required', 'enum'
+]);
+function inlineRef(schema, limit) {
+  if (limit === false) return false;
+  if (limit === undefined || limit === true) return checkNoRef(schema);
+  else if (limit) return countKeys(schema) <= limit;
+}
+
+
+function checkNoRef(schema) {
+  var item;
+  if (Array.isArray(schema)) {
+    for (var i=0; i<schema.length; i++) {
+      item = schema[i];
+      if (typeof item == 'object' && !checkNoRef(item)) return false;
+    }
+  } else {
+    for (var key in schema) {
+      if (key == '$ref') return false;
+      item = schema[key];
+      if (typeof item == 'object' && !checkNoRef(item)) return false;
+    }
+  }
+  return true;
+}
+
+
+function countKeys(schema) {
+  var count = 0, item;
+  if (Array.isArray(schema)) {
+    for (var i=0; i<schema.length; i++) {
+      item = schema[i];
+      if (typeof item == 'object') count += countKeys(item);
+      if (count == Infinity) return Infinity;
+    }
+  } else {
+    for (var key in schema) {
+      if (key == '$ref') return Infinity;
+      if (SIMPLE_INLINED[key]) {
+        count++;
+      } else {
+        item = schema[key];
+        if (typeof item == 'object') count += countKeys(item) + 1;
+        if (count == Infinity) return Infinity;
+      }
+    }
+  }
+  return count;
+}
+
+
+function getFullPath(id, normalize) {
+  if (normalize !== false) id = normalizeId(id);
+  var p = URI.parse(id);
+  return _getFullPath(p);
+}
+
+
+function _getFullPath(p) {
+  return URI.serialize(p).split('#')[0] + '#';
+}
+
+
+var TRAILING_SLASH_HASH = /#\/?$/;
+function normalizeId(id) {
+  return id ? id.replace(TRAILING_SLASH_HASH, '') : '';
+}
+
+
+function resolveUrl(baseId, id) {
+  id = normalizeId(id);
+  return URI.resolve(baseId, id);
+}
+
+
+/* @this Ajv */
+function resolveIds(schema) {
+  var schemaId = normalizeId(this._getId(schema));
+  var baseIds = {'': schemaId};
+  var fullPaths = {'': getFullPath(schemaId, false)};
+  var localRefs = {};
+  var self = this;
+
+  traverse(schema, {allKeys: true}, function(sch, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex) {
+    if (jsonPtr === '') return;
+    var id = self._getId(sch);
+    var baseId = baseIds[parentJsonPtr];
+    var fullPath = fullPaths[parentJsonPtr] + '/' + parentKeyword;
+    if (keyIndex !== undefined)
+      fullPath += '/' + (typeof keyIndex == 'number' ? keyIndex : util.escapeFragment(keyIndex));
+
+    if (typeof id == 'string') {
+      id = baseId = normalizeId(baseId ? URI.resolve(baseId, id) : id);
+
+      var refVal = self._refs[id];
+      if (typeof refVal == 'string') refVal = self._refs[refVal];
+      if (refVal && refVal.schema) {
+        if (!equal(sch, refVal.schema))
+          throw new Error('id "' + id + '" resolves to more than one schema');
+      } else if (id != normalizeId(fullPath)) {
+        if (id[0] == '#') {
+          if (localRefs[id] && !equal(sch, localRefs[id]))
+            throw new Error('id "' + id + '" resolves to more than one schema');
+          localRefs[id] = sch;
+        } else {
+          self._refs[id] = fullPath;
+        }
+      }
+    }
+    baseIds[jsonPtr] = baseId;
+    fullPaths[jsonPtr] = fullPath;
+  });
+
+  return localRefs;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/rules.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/rules.js
new file mode 100644
index 0000000..08b25ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/rules.js
@@ -0,0 +1,66 @@
+'use strict';
+
+var ruleModules = require('../dotjs')
+  , toHash = require('./util').toHash;
+
+module.exports = function rules() {
+  var RULES = [
+    { type: 'number',
+      rules: [ { 'maximum': ['exclusiveMaximum'] },
+               { 'minimum': ['exclusiveMinimum'] }, 'multipleOf', 'format'] },
+    { type: 'string',
+      rules: [ 'maxLength', 'minLength', 'pattern', 'format' ] },
+    { type: 'array',
+      rules: [ 'maxItems', 'minItems', 'items', 'contains', 'uniqueItems' ] },
+    { type: 'object',
+      rules: [ 'maxProperties', 'minProperties', 'required', 'dependencies', 'propertyNames',
+               { 'properties': ['additionalProperties', 'patternProperties'] } ] },
+    { rules: [ '$ref', 'const', 'enum', 'not', 'anyOf', 'oneOf', 'allOf', 'if' ] }
+  ];
+
+  var ALL = [ 'type', '$comment' ];
+  var KEYWORDS = [
+    '$schema', '$id', 'id', '$data', '$async', 'title',
+    'description', 'default', 'definitions',
+    'examples', 'readOnly', 'writeOnly',
+    'contentMediaType', 'contentEncoding',
+    'additionalItems', 'then', 'else'
+  ];
+  var TYPES = [ 'number', 'integer', 'string', 'array', 'object', 'boolean', 'null' ];
+  RULES.all = toHash(ALL);
+  RULES.types = toHash(TYPES);
+
+  RULES.forEach(function (group) {
+    group.rules = group.rules.map(function (keyword) {
+      var implKeywords;
+      if (typeof keyword == 'object') {
+        var key = Object.keys(keyword)[0];
+        implKeywords = keyword[key];
+        keyword = key;
+        implKeywords.forEach(function (k) {
+          ALL.push(k);
+          RULES.all[k] = true;
+        });
+      }
+      ALL.push(keyword);
+      var rule = RULES.all[keyword] = {
+        keyword: keyword,
+        code: ruleModules[keyword],
+        implements: implKeywords
+      };
+      return rule;
+    });
+
+    RULES.all.$comment = {
+      keyword: '$comment',
+      code: ruleModules.$comment
+    };
+
+    if (group.type) RULES.types[group.type] = group;
+  });
+
+  RULES.keywords = toHash(ALL.concat(KEYWORDS));
+  RULES.custom = {};
+
+  return RULES;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/schema_obj.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/schema_obj.js
new file mode 100644
index 0000000..e7903b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/schema_obj.js
@@ -0,0 +1,9 @@
+'use strict';
+
+var util = require('./util');
+
+module.exports = SchemaObject;
+
+function SchemaObject(obj) {
+  util.copy(obj, this);
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/ucs2length.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/ucs2length.js
new file mode 100644
index 0000000..d193fb1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/ucs2length.js
@@ -0,0 +1,20 @@
+'use strict';
+
+// https://mathiasbynens.be/notes/javascript-encoding
+// https://github.com/bestiejs/punycode.js - punycode.ucs2.decode
+module.exports = function ucs2length(str) {
+  var length = 0
+    , len = str.length
+    , pos = 0
+    , value;
+  while (pos < len) {
+    length++;
+    value = str.charCodeAt(pos++);
+    if (value >= 0xD800 && value <= 0xDBFF && pos < len) {
+      // high surrogate, and there is a next character
+      value = str.charCodeAt(pos);
+      if ((value & 0xFC00) == 0xDC00) pos++; // low surrogate
+    }
+  }
+  return length;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/compile/util.js b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/util.js
new file mode 100644
index 0000000..ef07b8c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/compile/util.js
@@ -0,0 +1,239 @@
+'use strict';
+
+
+module.exports = {
+  copy: copy,
+  checkDataType: checkDataType,
+  checkDataTypes: checkDataTypes,
+  coerceToTypes: coerceToTypes,
+  toHash: toHash,
+  getProperty: getProperty,
+  escapeQuotes: escapeQuotes,
+  equal: require('fast-deep-equal'),
+  ucs2length: require('./ucs2length'),
+  varOccurences: varOccurences,
+  varReplace: varReplace,
+  schemaHasRules: schemaHasRules,
+  schemaHasRulesExcept: schemaHasRulesExcept,
+  schemaUnknownRules: schemaUnknownRules,
+  toQuotedString: toQuotedString,
+  getPathExpr: getPathExpr,
+  getPath: getPath,
+  getData: getData,
+  unescapeFragment: unescapeFragment,
+  unescapeJsonPointer: unescapeJsonPointer,
+  escapeFragment: escapeFragment,
+  escapeJsonPointer: escapeJsonPointer
+};
+
+
+function copy(o, to) {
+  to = to || {};
+  for (var key in o) to[key] = o[key];
+  return to;
+}
+
+
+function checkDataType(dataType, data, strictNumbers, negate) {
+  var EQUAL = negate ? ' !== ' : ' === '
+    , AND = negate ? ' || ' : ' && '
+    , OK = negate ? '!' : ''
+    , NOT = negate ? '' : '!';
+  switch (dataType) {
+    case 'null': return data + EQUAL + 'null';
+    case 'array': return OK + 'Array.isArray(' + data + ')';
+    case 'object': return '(' + OK + data + AND +
+                          'typeof ' + data + EQUAL + '"object"' + AND +
+                          NOT + 'Array.isArray(' + data + '))';
+    case 'integer': return '(typeof ' + data + EQUAL + '"number"' + AND +
+                           NOT + '(' + data + ' % 1)' +
+                           AND + data + EQUAL + data +
+                           (strictNumbers ? (AND + OK + 'isFinite(' + data + ')') : '') + ')';
+    case 'number': return '(typeof ' + data + EQUAL + '"' + dataType + '"' +
+                          (strictNumbers ? (AND + OK + 'isFinite(' + data + ')') : '') + ')';
+    default: return 'typeof ' + data + EQUAL + '"' + dataType + '"';
+  }
+}
+
+
+function checkDataTypes(dataTypes, data, strictNumbers) {
+  switch (dataTypes.length) {
+    case 1: return checkDataType(dataTypes[0], data, strictNumbers, true);
+    default:
+      var code = '';
+      var types = toHash(dataTypes);
+      if (types.array && types.object) {
+        code = types.null ? '(': '(!' + data + ' || ';
+        code += 'typeof ' + data + ' !== "object")';
+        delete types.null;
+        delete types.array;
+        delete types.object;
+      }
+      if (types.number) delete types.integer;
+      for (var t in types)
+        code += (code ? ' && ' : '' ) + checkDataType(t, data, strictNumbers, true);
+
+      return code;
+  }
+}
+
+
+var COERCE_TO_TYPES = toHash([ 'string', 'number', 'integer', 'boolean', 'null' ]);
+function coerceToTypes(optionCoerceTypes, dataTypes) {
+  if (Array.isArray(dataTypes)) {
+    var types = [];
+    for (var i=0; i<dataTypes.length; i++) {
+      var t = dataTypes[i];
+      if (COERCE_TO_TYPES[t]) types[types.length] = t;
+      else if (optionCoerceTypes === 'array' && t === 'array') types[types.length] = t;
+    }
+    if (types.length) return types;
+  } else if (COERCE_TO_TYPES[dataTypes]) {
+    return [dataTypes];
+  } else if (optionCoerceTypes === 'array' && dataTypes === 'array') {
+    return ['array'];
+  }
+}
+
+
+function toHash(arr) {
+  var hash = {};
+  for (var i=0; i<arr.length; i++) hash[arr[i]] = true;
+  return hash;
+}
+
+
+var IDENTIFIER = /^[a-z$_][a-z$_0-9]*$/i;
+var SINGLE_QUOTE = /'|\\/g;
+function getProperty(key) {
+  return typeof key == 'number'
+          ? '[' + key + ']'
+          : IDENTIFIER.test(key)
+            ? '.' + key
+            : "['" + escapeQuotes(key) + "']";
+}
+
+
+function escapeQuotes(str) {
+  return str.replace(SINGLE_QUOTE, '\\$&')
+            .replace(/\n/g, '\\n')
+            .replace(/\r/g, '\\r')
+            .replace(/\f/g, '\\f')
+            .replace(/\t/g, '\\t');
+}
+
+
+function varOccurences(str, dataVar) {
+  dataVar += '[^0-9]';
+  var matches = str.match(new RegExp(dataVar, 'g'));
+  return matches ? matches.length : 0;
+}
+
+
+function varReplace(str, dataVar, expr) {
+  dataVar += '([^0-9])';
+  expr = expr.replace(/\$/g, '$$$$');
+  return str.replace(new RegExp(dataVar, 'g'), expr + '$1');
+}
+
+
+function schemaHasRules(schema, rules) {
+  if (typeof schema == 'boolean') return !schema;
+  for (var key in schema) if (rules[key]) return true;
+}
+
+
+function schemaHasRulesExcept(schema, rules, exceptKeyword) {
+  if (typeof schema == 'boolean') return !schema && exceptKeyword != 'not';
+  for (var key in schema) if (key != exceptKeyword && rules[key]) return true;
+}
+
+
+function schemaUnknownRules(schema, rules) {
+  if (typeof schema == 'boolean') return;
+  for (var key in schema) if (!rules[key]) return key;
+}
+
+
+function toQuotedString(str) {
+  return '\'' + escapeQuotes(str) + '\'';
+}
+
+
+function getPathExpr(currentPath, expr, jsonPointers, isNumber) {
+  var path = jsonPointers // false by default
+              ? '\'/\' + ' + expr + (isNumber ? '' : '.replace(/~/g, \'~0\').replace(/\\//g, \'~1\')')
+              : (isNumber ? '\'[\' + ' + expr + ' + \']\'' : '\'[\\\'\' + ' + expr + ' + \'\\\']\'');
+  return joinPaths(currentPath, path);
+}
+
+
+function getPath(currentPath, prop, jsonPointers) {
+  var path = jsonPointers // false by default
+              ? toQuotedString('/' + escapeJsonPointer(prop))
+              : toQuotedString(getProperty(prop));
+  return joinPaths(currentPath, path);
+}
+
+
+var JSON_POINTER = /^\/(?:[^~]|~0|~1)*$/;
+var RELATIVE_JSON_POINTER = /^([0-9]+)(#|\/(?:[^~]|~0|~1)*)?$/;
+function getData($data, lvl, paths) {
+  var up, jsonPointer, data, matches;
+  if ($data === '') return 'rootData';
+  if ($data[0] == '/') {
+    if (!JSON_POINTER.test($data)) throw new Error('Invalid JSON-pointer: ' + $data);
+    jsonPointer = $data;
+    data = 'rootData';
+  } else {
+    matches = $data.match(RELATIVE_JSON_POINTER);
+    if (!matches) throw new Error('Invalid JSON-pointer: ' + $data);
+    up = +matches[1];
+    jsonPointer = matches[2];
+    if (jsonPointer == '#') {
+      if (up >= lvl) throw new Error('Cannot access property/index ' + up + ' levels up, current level is ' + lvl);
+      return paths[lvl - up];
+    }
+
+    if (up > lvl) throw new Error('Cannot access data ' + up + ' levels up, current level is ' + lvl);
+    data = 'data' + ((lvl - up) || '');
+    if (!jsonPointer) return data;
+  }
+
+  var expr = data;
+  var segments = jsonPointer.split('/');
+  for (var i=0; i<segments.length; i++) {
+    var segment = segments[i];
+    if (segment) {
+      data += getProperty(unescapeJsonPointer(segment));
+      expr += ' && ' + data;
+    }
+  }
+  return expr;
+}
+
+
+function joinPaths (a, b) {
+  if (a == '""') return b;
+  return (a + ' + ' + b).replace(/([^\\])' \+ '/g, '$1');
+}
+
+
+function unescapeFragment(str) {
+  return unescapeJsonPointer(decodeURIComponent(str));
+}
+
+
+function escapeFragment(str) {
+  return encodeURIComponent(escapeJsonPointer(str));
+}
+
+
+function escapeJsonPointer(str) {
+  return str.replace(/~/g, '~0').replace(/\//g, '~1');
+}
+
+
+function unescapeJsonPointer(str) {
+  return str.replace(/~1/g, '/').replace(/~0/g, '~');
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/data.js b/node_modules/mathjs/examples/node_modules/ajv/lib/data.js
new file mode 100644
index 0000000..f11142b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/data.js
@@ -0,0 +1,49 @@
+'use strict';
+
+var KEYWORDS = [
+  'multipleOf',
+  'maximum',
+  'exclusiveMaximum',
+  'minimum',
+  'exclusiveMinimum',
+  'maxLength',
+  'minLength',
+  'pattern',
+  'additionalItems',
+  'maxItems',
+  'minItems',
+  'uniqueItems',
+  'maxProperties',
+  'minProperties',
+  'required',
+  'additionalProperties',
+  'enum',
+  'format',
+  'const'
+];
+
+module.exports = function (metaSchema, keywordsJsonPointers) {
+  for (var i=0; i<keywordsJsonPointers.length; i++) {
+    metaSchema = JSON.parse(JSON.stringify(metaSchema));
+    var segments = keywordsJsonPointers[i].split('/');
+    var keywords = metaSchema;
+    var j;
+    for (j=1; j<segments.length; j++)
+      keywords = keywords[segments[j]];
+
+    for (j=0; j<KEYWORDS.length; j++) {
+      var key = KEYWORDS[j];
+      var schema = keywords[key];
+      if (schema) {
+        keywords[key] = {
+          anyOf: [
+            schema,
+            { $ref: 'https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#' }
+          ]
+        };
+      }
+    }
+  }
+
+  return metaSchema;
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/definition_schema.js b/node_modules/mathjs/examples/node_modules/ajv/lib/definition_schema.js
new file mode 100644
index 0000000..ad86d4f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/definition_schema.js
@@ -0,0 +1,37 @@
+'use strict';
+
+var metaSchema = require('./refs/json-schema-draft-07.json');
+
+module.exports = {
+  $id: 'https://github.com/ajv-validator/ajv/blob/master/lib/definition_schema.js',
+  definitions: {
+    simpleTypes: metaSchema.definitions.simpleTypes
+  },
+  type: 'object',
+  dependencies: {
+    schema: ['validate'],
+    $data: ['validate'],
+    statements: ['inline'],
+    valid: {not: {required: ['macro']}}
+  },
+  properties: {
+    type: metaSchema.properties.type,
+    schema: {type: 'boolean'},
+    statements: {type: 'boolean'},
+    dependencies: {
+      type: 'array',
+      items: {type: 'string'}
+    },
+    metaSchema: {type: 'object'},
+    modifying: {type: 'boolean'},
+    valid: {type: 'boolean'},
+    $data: {type: 'boolean'},
+    async: {type: 'boolean'},
+    errors: {
+      anyOf: [
+        {type: 'boolean'},
+        {const: 'full'}
+      ]
+    }
+  }
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limit.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limit.jst
new file mode 100644
index 0000000..f152189
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limit.jst
@@ -0,0 +1,113 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{## def.setExclusiveLimit:
+  $exclusive = true;
+  $errorKeyword = $exclusiveKeyword;
+  $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+#}}
+
+{{
+  var $isMax = $keyword == 'maximum'
+    , $exclusiveKeyword = $isMax ? 'exclusiveMaximum' : 'exclusiveMinimum'
+    , $schemaExcl = it.schema[$exclusiveKeyword]
+    , $isDataExcl = it.opts.$data && $schemaExcl && $schemaExcl.$data
+    , $op = $isMax ? '<' : '>'
+    , $notOp = $isMax ? '>' : '<'
+    , $errorKeyword = undefined;
+
+  if (!($isData || typeof $schema == 'number' || $schema === undefined)) {
+    throw new Error($keyword + ' must be number');
+  }
+  if (!($isDataExcl || $schemaExcl === undefined
+                    || typeof $schemaExcl == 'number'
+                    || typeof $schemaExcl == 'boolean')) {
+    throw new Error($exclusiveKeyword + ' must be number or boolean');
+  }
+}}
+
+{{? $isDataExcl }}
+  {{
+    var $schemaValueExcl = it.util.getData($schemaExcl.$data, $dataLvl, it.dataPathArr)
+      , $exclusive = 'exclusive' + $lvl
+      , $exclType = 'exclType' + $lvl
+      , $exclIsNumber = 'exclIsNumber' + $lvl
+      , $opExpr = 'op' + $lvl
+      , $opStr = '\' + ' + $opExpr + ' + \'';
+  }}
+  var schemaExcl{{=$lvl}} = {{=$schemaValueExcl}};
+  {{ $schemaValueExcl = 'schemaExcl' + $lvl; }}
+
+  var {{=$exclusive}};
+  var {{=$exclType}} = typeof {{=$schemaValueExcl}};
+  if ({{=$exclType}} != 'boolean' && {{=$exclType}} != 'undefined' && {{=$exclType}} != 'number') {
+    {{ var $errorKeyword = $exclusiveKeyword; }}
+    {{# def.error:'_exclusiveLimit' }}
+  } else if ({{# def.$dataNotType:'number' }}
+            {{=$exclType}} == 'number'
+              ? (
+                  ({{=$exclusive}} = {{=$schemaValue}} === undefined || {{=$schemaValueExcl}} {{=$op}}= {{=$schemaValue}})
+                    ? {{=$data}} {{=$notOp}}= {{=$schemaValueExcl}}
+                    : {{=$data}} {{=$notOp}} {{=$schemaValue}}
+                )
+              : (
+                  ({{=$exclusive}} = {{=$schemaValueExcl}} === true)
+                    ? {{=$data}} {{=$notOp}}= {{=$schemaValue}}
+                    : {{=$data}} {{=$notOp}} {{=$schemaValue}}
+                )
+            || {{=$data}} !== {{=$data}}) {
+    var op{{=$lvl}} = {{=$exclusive}} ? '{{=$op}}' : '{{=$op}}=';
+    {{
+      if ($schema === undefined) {
+        $errorKeyword = $exclusiveKeyword;
+        $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+        $schemaValue = $schemaValueExcl;
+        $isData = $isDataExcl;
+      }
+    }}
+{{??}}
+  {{
+    var $exclIsNumber = typeof $schemaExcl == 'number'
+      , $opStr = $op;  /*used in error*/
+  }}
+
+  {{? $exclIsNumber && $isData }}
+    {{ var $opExpr = '\'' + $opStr + '\''; /*used in error*/ }}
+    if ({{# def.$dataNotType:'number' }}
+        ( {{=$schemaValue}} === undefined
+          || {{=$schemaExcl}} {{=$op}}= {{=$schemaValue}}
+            ? {{=$data}} {{=$notOp}}= {{=$schemaExcl}}
+            : {{=$data}} {{=$notOp}} {{=$schemaValue}} )
+        || {{=$data}} !== {{=$data}}) {
+  {{??}}
+    {{
+      if ($exclIsNumber && $schema === undefined) {
+          {{# def.setExclusiveLimit }}
+          $schemaValue = $schemaExcl;
+          $notOp += '=';
+      } else {
+        if ($exclIsNumber)
+          $schemaValue = Math[$isMax ? 'min' : 'max']($schemaExcl, $schema);
+
+        if ($schemaExcl === ($exclIsNumber ? $schemaValue : true)) {
+          {{# def.setExclusiveLimit }}
+          $notOp += '=';
+        } else {
+          $exclusive = false;
+          $opStr += '=';
+        }
+      }
+
+      var $opExpr = '\'' + $opStr + '\''; /*used in error*/
+    }}
+
+    if ({{# def.$dataNotType:'number' }}
+        {{=$data}} {{=$notOp}} {{=$schemaValue}}
+        || {{=$data}} !== {{=$data}}) {
+  {{?}}
+{{?}}
+    {{ $errorKeyword = $errorKeyword || $keyword; }}
+    {{# def.error:'_limit' }}
+  } {{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitItems.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitItems.jst
new file mode 100644
index 0000000..741329e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitItems.jst
@@ -0,0 +1,12 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{# def.numberKeyword }}
+
+{{ var $op = $keyword == 'maxItems' ? '>' : '<'; }}
+if ({{# def.$dataNotType:'number' }} {{=$data}}.length {{=$op}} {{=$schemaValue}}) {
+  {{ var $errorKeyword = $keyword; }}
+  {{# def.error:'_limitItems' }}
+} {{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitLength.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitLength.jst
new file mode 100644
index 0000000..285c66b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitLength.jst
@@ -0,0 +1,12 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{# def.numberKeyword }}
+
+{{ var $op = $keyword == 'maxLength' ? '>' : '<'; }}
+if ({{# def.$dataNotType:'number' }} {{# def.strLength }} {{=$op}} {{=$schemaValue}}) {
+  {{ var $errorKeyword = $keyword; }}
+  {{# def.error:'_limitLength' }}
+} {{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitProperties.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitProperties.jst
new file mode 100644
index 0000000..c4c2155
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/_limitProperties.jst
@@ -0,0 +1,12 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{# def.numberKeyword }}
+
+{{ var $op = $keyword == 'maxProperties' ? '>' : '<'; }}
+if ({{# def.$dataNotType:'number' }} Object.keys({{=$data}}).length {{=$op}} {{=$schemaValue}}) {
+  {{ var $errorKeyword = $keyword; }}
+  {{# def.error:'_limitProperties' }}
+} {{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/allOf.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/allOf.jst
new file mode 100644
index 0000000..0e782fe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/allOf.jst
@@ -0,0 +1,32 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+{{
+  var $currentBaseId = $it.baseId
+    , $allSchemasEmpty = true;
+}}
+
+{{~ $schema:$sch:$i }}
+  {{? {{# def.nonEmptySchema:$sch }} }}
+    {{
+      $allSchemasEmpty = false;
+      $it.schema = $sch;
+      $it.schemaPath = $schemaPath + '[' + $i + ']';
+      $it.errSchemaPath = $errSchemaPath + '/' + $i;
+    }}
+
+    {{# def.insertSubschemaCode }}
+
+    {{# def.ifResultValid }}
+  {{?}}
+{{~}}
+
+{{? $breakOnError }}
+  {{? $allSchemasEmpty }}
+    if (true) {
+  {{??}}
+    {{= $closingBraces.slice(0,-1) }}
+  {{?}}
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/anyOf.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/anyOf.jst
new file mode 100644
index 0000000..ea909ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/anyOf.jst
@@ -0,0 +1,46 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+{{
+  var $noEmptySchema = $schema.every(function($sch) {
+    return {{# def.nonEmptySchema:$sch }};
+  });
+}}
+{{? $noEmptySchema }}
+  {{ var $currentBaseId = $it.baseId; }}
+  var {{=$errs}} = errors;
+  var {{=$valid}} = false;
+
+  {{# def.setCompositeRule }}
+
+  {{~ $schema:$sch:$i }}
+    {{
+      $it.schema = $sch;
+      $it.schemaPath = $schemaPath + '[' + $i + ']';
+      $it.errSchemaPath = $errSchemaPath + '/' + $i;
+    }}
+
+    {{# def.insertSubschemaCode }}
+
+    {{=$valid}} = {{=$valid}} || {{=$nextValid}};
+
+    if (!{{=$valid}}) {
+    {{ $closingBraces += '}'; }}
+  {{~}}
+
+  {{# def.resetCompositeRule }}
+
+  {{= $closingBraces }}
+
+  if (!{{=$valid}}) {
+    {{# def.extraError:'anyOf' }}
+  } else {
+    {{# def.resetErrors }}
+  {{? it.opts.allErrors }} } {{?}}
+{{??}}
+  {{? $breakOnError }}
+    if (true) {
+  {{?}}
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/coerce.def b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/coerce.def
new file mode 100644
index 0000000..c947ed6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/coerce.def
@@ -0,0 +1,51 @@
+{{## def.coerceType:
+  {{
+    var $dataType = 'dataType' + $lvl
+      , $coerced = 'coerced' + $lvl;
+  }}
+  var {{=$dataType}} = typeof {{=$data}};
+  var {{=$coerced}} = undefined;
+
+  {{? it.opts.coerceTypes == 'array' }}
+    if ({{=$dataType}} == 'object' && Array.isArray({{=$data}}) && {{=$data}}.length == 1) {
+      {{=$data}} = {{=$data}}[0];
+      {{=$dataType}} = typeof {{=$data}};
+      if ({{=it.util.checkDataType(it.schema.type, $data, it.opts.strictNumbers)}}) {{=$coerced}} = {{=$data}};
+    }
+  {{?}}
+
+  if ({{=$coerced}} !== undefined) ;
+  {{~ $coerceToTypes:$type:$i }}
+    {{? $type == 'string' }}
+      else if ({{=$dataType}} == 'number' || {{=$dataType}} == 'boolean')
+        {{=$coerced}} = '' + {{=$data}};
+      else if ({{=$data}} === null) {{=$coerced}} = '';
+    {{?? $type == 'number' || $type == 'integer' }}
+      else if ({{=$dataType}} == 'boolean' || {{=$data}} === null
+          || ({{=$dataType}} == 'string' && {{=$data}} && {{=$data}} == +{{=$data}}
+          {{? $type == 'integer' }} && !({{=$data}} % 1){{?}}))
+        {{=$coerced}} = +{{=$data}};
+    {{?? $type == 'boolean' }}
+      else if ({{=$data}} === 'false' || {{=$data}} === 0 || {{=$data}} === null)
+        {{=$coerced}} = false;
+      else if ({{=$data}} === 'true' || {{=$data}} === 1)
+        {{=$coerced}} = true;
+    {{?? $type == 'null' }}
+      else if ({{=$data}} === '' || {{=$data}} === 0 || {{=$data}} === false)
+        {{=$coerced}} = null;
+    {{?? it.opts.coerceTypes == 'array' && $type == 'array' }}
+      else if ({{=$dataType}} == 'string' || {{=$dataType}} == 'number' || {{=$dataType}} == 'boolean' || {{=$data}} == null)
+        {{=$coerced}} = [{{=$data}}];
+    {{?}}
+  {{~}}
+  else {
+    {{# def.error:'type' }}
+  }
+
+  if ({{=$coerced}} !== undefined) {
+    {{# def.setParentData }}
+    {{=$data}} = {{=$coerced}};
+    {{? !$dataLvl }}if ({{=$parentData}} !== undefined){{?}}
+      {{=$parentData}}[{{=$parentDataProperty}}] = {{=$coerced}};
+  }
+#}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/comment.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/comment.jst
new file mode 100644
index 0000000..f959150
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/comment.jst
@@ -0,0 +1,9 @@
+{{# def.definitions }}
+{{# def.setupKeyword }}
+
+{{ var $comment = it.util.toQuotedString($schema); }}
+{{? it.opts.$comment === true }}
+  console.log({{=$comment}});
+{{?? typeof it.opts.$comment == 'function' }}
+  self._opts.$comment({{=$comment}}, {{=it.util.toQuotedString($errSchemaPath)}}, validate.root.schema);
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/const.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/const.jst
new file mode 100644
index 0000000..2aa2298
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/const.jst
@@ -0,0 +1,11 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{? !$isData }}
+  var schema{{=$lvl}} = validate.schema{{=$schemaPath}};
+{{?}}
+var {{=$valid}} = equal({{=$data}}, schema{{=$lvl}});
+{{# def.checkError:'const' }}
+{{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/contains.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/contains.jst
new file mode 100644
index 0000000..4dc9967
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/contains.jst
@@ -0,0 +1,55 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+
+{{
+  var $idx = 'i' + $lvl
+    , $dataNxt = $it.dataLevel = it.dataLevel + 1
+    , $nextData = 'data' + $dataNxt
+    , $currentBaseId = it.baseId
+    , $nonEmptySchema = {{# def.nonEmptySchema:$schema }};
+}}
+
+var {{=$errs}} = errors;
+var {{=$valid}};
+
+{{? $nonEmptySchema }}
+  {{# def.setCompositeRule }}
+
+  {{
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+  }}
+
+  var {{=$nextValid}} = false;
+
+  for (var {{=$idx}} = 0; {{=$idx}} < {{=$data}}.length; {{=$idx}}++) {
+    {{
+      $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+      var $passData = $data + '[' + $idx + ']';
+      $it.dataPathArr[$dataNxt] = $idx;
+    }}
+
+    {{# def.generateSubschemaCode }}
+    {{# def.optimizeValidate }}
+
+    if ({{=$nextValid}}) break;
+  }
+
+  {{# def.resetCompositeRule }}
+  {{= $closingBraces }}
+
+  if (!{{=$nextValid}}) {
+{{??}}
+  if ({{=$data}}.length == 0) {
+{{?}}
+
+    {{# def.error:'contains' }}
+  } else {
+    {{? $nonEmptySchema }}
+      {{# def.resetErrors }}
+    {{?}}
+  {{? it.opts.allErrors }} } {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/custom.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/custom.jst
new file mode 100644
index 0000000..d30588f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/custom.jst
@@ -0,0 +1,191 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{
+  var $rule = this
+    , $definition = 'definition' + $lvl
+    , $rDef = $rule.definition
+    , $closingBraces = '';
+  var $validate = $rDef.validate;
+  var $compile, $inline, $macro, $ruleValidate, $validateCode;
+}}
+
+{{? $isData && $rDef.$data }}
+  {{
+    $validateCode = 'keywordValidate' + $lvl;
+    var $validateSchema = $rDef.validateSchema;
+  }}
+  var {{=$definition}} = RULES.custom['{{=$keyword}}'].definition;
+  var {{=$validateCode}} = {{=$definition}}.validate;
+{{??}}
+  {{
+    $ruleValidate = it.useCustomRule($rule, $schema, it.schema, it);
+    if (!$ruleValidate) return;
+    $schemaValue = 'validate.schema' + $schemaPath;
+    $validateCode = $ruleValidate.code;
+    $compile = $rDef.compile;
+    $inline = $rDef.inline;
+    $macro = $rDef.macro;
+  }}
+{{?}}
+
+{{
+  var $ruleErrs = $validateCode + '.errors'
+    , $i = 'i' + $lvl
+    , $ruleErr = 'ruleErr' + $lvl
+    , $asyncKeyword = $rDef.async;
+
+  if ($asyncKeyword && !it.async)
+    throw new Error('async keyword in sync schema');
+}}
+
+
+{{? !($inline || $macro) }}{{=$ruleErrs}} = null;{{?}}
+var {{=$errs}} = errors;
+var {{=$valid}};
+
+{{## def.callRuleValidate:
+  {{=$validateCode}}.call(
+    {{? it.opts.passContext }}this{{??}}self{{?}}
+    {{? $compile || $rDef.schema === false }}
+      , {{=$data}}
+    {{??}}
+      , {{=$schemaValue}}
+      , {{=$data}}
+      , validate.schema{{=it.schemaPath}}
+    {{?}}
+    , {{# def.dataPath }}
+    {{# def.passParentData }}
+    , rootData
+  )
+#}}
+
+{{## def.extendErrors:_inline:
+  for (var {{=$i}}={{=$errs}}; {{=$i}}<errors; {{=$i}}++) {
+    var {{=$ruleErr}} = vErrors[{{=$i}}];
+    if ({{=$ruleErr}}.dataPath === undefined)
+      {{=$ruleErr}}.dataPath = (dataPath || '') + {{= it.errorPath }};
+    {{# _inline ? 'if (\{\{=$ruleErr\}\}.schemaPath === undefined) {' : '' }}
+      {{=$ruleErr}}.schemaPath = "{{=$errSchemaPath}}";
+    {{# _inline ? '}' : '' }}
+    {{? it.opts.verbose }}
+      {{=$ruleErr}}.schema = {{=$schemaValue}};
+      {{=$ruleErr}}.data = {{=$data}};
+    {{?}}
+  }
+#}}
+
+
+{{? $isData && $rDef.$data }}
+  {{ $closingBraces += '}'; }}
+  if ({{=$schemaValue}} === undefined) {
+    {{=$valid}} = true;
+  } else {
+  {{? $validateSchema }}
+    {{ $closingBraces += '}'; }}
+    {{=$valid}} = {{=$definition}}.validateSchema({{=$schemaValue}});
+    if ({{=$valid}}) {
+  {{?}}
+{{?}}
+
+{{? $inline }}
+  {{? $rDef.statements }}
+    {{= $ruleValidate.validate }}
+  {{??}}
+    {{=$valid}} = {{= $ruleValidate.validate }};
+  {{?}}
+{{?? $macro }}
+  {{# def.setupNextLevel }}
+  {{
+    $it.schema = $ruleValidate.validate;
+    $it.schemaPath = '';
+  }}
+  {{# def.setCompositeRule }}
+  {{ var $code = it.validate($it).replace(/validate\.schema/g, $validateCode); }}
+  {{# def.resetCompositeRule }}
+  {{= $code }}
+{{??}}
+  {{# def.beginDefOut}}
+    {{# def.callRuleValidate }}
+  {{# def.storeDefOut:def_callRuleValidate }}
+
+  {{? $rDef.errors === false }}
+    {{=$valid}} = {{? $asyncKeyword }}await {{?}}{{= def_callRuleValidate }};
+  {{??}}
+    {{? $asyncKeyword }}
+      {{ $ruleErrs = 'customErrors' + $lvl; }}
+      var {{=$ruleErrs}} = null;
+      try {
+        {{=$valid}} = await {{= def_callRuleValidate }};
+      } catch (e) {
+        {{=$valid}} = false;
+        if (e instanceof ValidationError) {{=$ruleErrs}} = e.errors;
+        else throw e;
+      }
+    {{??}}
+      {{=$ruleErrs}} = null;
+      {{=$valid}} = {{= def_callRuleValidate }};
+    {{?}}
+  {{?}}
+{{?}}
+
+{{? $rDef.modifying }}
+  if ({{=$parentData}}) {{=$data}} = {{=$parentData}}[{{=$parentDataProperty}}];
+{{?}}
+
+{{= $closingBraces }}
+
+{{## def.notValidationResult:
+  {{? $rDef.valid === undefined }}
+    !{{? $macro }}{{=$nextValid}}{{??}}{{=$valid}}{{?}}
+  {{??}}
+    {{= !$rDef.valid }}
+  {{?}}
+#}}
+
+{{? $rDef.valid }}
+  {{? $breakOnError }} if (true) { {{?}}
+{{??}}
+  if ({{# def.notValidationResult }}) {
+    {{ $errorKeyword = $rule.keyword; }}
+    {{# def.beginDefOut}}
+      {{# def.error:'custom' }}
+    {{# def.storeDefOut:def_customError }}
+
+    {{? $inline }}
+      {{? $rDef.errors }}
+        {{? $rDef.errors != 'full' }}
+          {{# def.extendErrors:true }}
+        {{?}}
+      {{??}}
+        {{? $rDef.errors === false}}
+          {{= def_customError }}
+        {{??}}
+          if ({{=$errs}} == errors) {
+            {{= def_customError }}
+          } else {
+            {{# def.extendErrors:true }}
+          }
+        {{?}}
+      {{?}}
+    {{?? $macro }}
+      {{# def.extraError:'custom' }}
+    {{??}}
+      {{? $rDef.errors === false}}
+        {{= def_customError }}
+      {{??}}
+        if (Array.isArray({{=$ruleErrs}})) {
+          if (vErrors === null) vErrors = {{=$ruleErrs}};
+          else vErrors = vErrors.concat({{=$ruleErrs}});
+          errors = vErrors.length;
+          {{# def.extendErrors:false }}
+        } else {
+          {{= def_customError }}
+        }
+      {{?}}
+    {{?}}
+
+  } {{? $breakOnError }} else { {{?}}
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/defaults.def b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/defaults.def
new file mode 100644
index 0000000..a844cf2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/defaults.def
@@ -0,0 +1,47 @@
+{{## def.assignDefault:
+  {{? it.compositeRule }}
+    {{
+      if (it.opts.strictDefaults) {
+        var $defaultMsg = 'default is ignored for: ' + $passData;
+        if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+        else throw new Error($defaultMsg);
+      }
+    }}
+  {{??}}
+    if ({{=$passData}} === undefined
+      {{? it.opts.useDefaults == 'empty' }}
+        || {{=$passData}} === null
+        || {{=$passData}} === ''
+      {{?}}
+    )
+      {{=$passData}} = {{? it.opts.useDefaults == 'shared' }}
+                         {{= it.useDefault($sch.default) }}
+                       {{??}}
+                         {{= JSON.stringify($sch.default) }}
+                       {{?}};
+  {{?}}
+#}}
+
+
+{{## def.defaultProperties:
+  {{
+    var $schema = it.schema.properties
+      , $schemaKeys = Object.keys($schema); }}
+  {{~ $schemaKeys:$propertyKey }}
+    {{ var $sch = $schema[$propertyKey]; }}
+    {{? $sch.default !== undefined }}
+      {{ var $passData = $data + it.util.getProperty($propertyKey); }}
+      {{# def.assignDefault }}
+    {{?}}
+  {{~}}
+#}}
+
+
+{{## def.defaultItems:
+  {{~ it.schema.items:$sch:$i }}
+    {{? $sch.default !== undefined }}
+      {{ var $passData = $data + '[' + $i + ']'; }}
+      {{# def.assignDefault }}
+    {{?}}
+  {{~}}
+#}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/definitions.def b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/definitions.def
new file mode 100644
index 0000000..709cce3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/definitions.def
@@ -0,0 +1,203 @@
+{{## def.setupKeyword:
+  {{
+    var $lvl = it.level;
+    var $dataLvl = it.dataLevel;
+    var $schema = it.schema[$keyword];
+    var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+    var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+    var $breakOnError = !it.opts.allErrors;
+    var $errorKeyword;
+
+    var $data = 'data' + ($dataLvl || '');
+    var $valid = 'valid' + $lvl;
+    var $errs = 'errs__' + $lvl;
+  }}
+#}}
+
+
+{{## def.setCompositeRule:
+  {{
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+  }}
+#}}
+
+
+{{## def.resetCompositeRule:
+  {{ it.compositeRule = $it.compositeRule = $wasComposite; }}
+#}}
+
+
+{{## def.setupNextLevel:
+  {{
+    var $it = it.util.copy(it);
+    var $closingBraces = '';
+    $it.level++;
+    var $nextValid = 'valid' + $it.level;
+  }}
+#}}
+
+
+{{## def.ifValid:
+  {{? $breakOnError }}
+    if ({{=$valid}}) {
+    {{ $closingBraces += '}'; }}
+  {{?}}
+#}}
+
+
+{{## def.ifResultValid:
+  {{? $breakOnError }}
+    if ({{=$nextValid}}) {
+    {{ $closingBraces += '}'; }}
+  {{?}}
+#}}
+
+
+{{## def.elseIfValid:
+  {{? $breakOnError }}
+    {{ $closingBraces += '}'; }}
+    else {
+  {{?}}
+#}}
+
+
+{{## def.nonEmptySchema:_schema:
+  (it.opts.strictKeywords
+    ? (typeof _schema == 'object' && Object.keys(_schema).length > 0)
+      || _schema === false
+    : it.util.schemaHasRules(_schema, it.RULES.all))
+#}}
+
+
+{{## def.strLength:
+  {{? it.opts.unicode === false }}
+    {{=$data}}.length
+  {{??}}
+    ucs2length({{=$data}})
+  {{?}}
+#}}
+
+
+{{## def.willOptimize:
+  it.util.varOccurences($code, $nextData) < 2
+#}}
+
+
+{{## def.generateSubschemaCode:
+  {{
+    var $code = it.validate($it);
+    $it.baseId = $currentBaseId;
+  }}
+#}}
+
+
+{{## def.insertSubschemaCode:
+  {{= it.validate($it) }}
+  {{ $it.baseId = $currentBaseId; }}
+#}}
+
+
+{{## def._optimizeValidate:
+  it.util.varReplace($code, $nextData, $passData)
+#}}
+
+
+{{## def.optimizeValidate:
+  {{? {{# def.willOptimize}} }}
+    {{= {{# def._optimizeValidate }} }}
+  {{??}}
+    var {{=$nextData}} = {{=$passData}};
+    {{= $code }}
+  {{?}}
+#}}
+
+
+{{## def.$data:
+  {{
+    var $isData = it.opts.$data && $schema && $schema.$data
+      , $schemaValue;
+  }}
+  {{? $isData }}
+    var schema{{=$lvl}} = {{= it.util.getData($schema.$data, $dataLvl, it.dataPathArr) }};
+    {{ $schemaValue = 'schema' + $lvl; }}
+  {{??}}
+    {{ $schemaValue = $schema; }}
+  {{?}}
+#}}
+
+
+{{## def.$dataNotType:_type:
+  {{?$isData}} ({{=$schemaValue}} !== undefined && typeof {{=$schemaValue}} != _type) || {{?}}
+#}}
+
+
+{{## def.check$dataIsArray:
+  if (schema{{=$lvl}} === undefined) {{=$valid}} = true;
+  else if (!Array.isArray(schema{{=$lvl}})) {{=$valid}} = false;
+  else {
+#}}
+
+
+{{## def.numberKeyword:
+  {{? !($isData || typeof $schema == 'number') }}
+    {{ throw new Error($keyword + ' must be number'); }}
+  {{?}}
+#}}
+
+
+{{## def.beginDefOut:
+  {{
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = '';
+  }}
+#}}
+
+
+{{## def.storeDefOut:_variable:
+  {{
+    var _variable = out;
+    out = $$outStack.pop();
+  }}
+#}}
+
+
+{{## def.dataPath:(dataPath || ''){{? it.errorPath != '""'}} + {{= it.errorPath }}{{?}}#}}
+
+{{## def.setParentData:
+  {{
+    var $parentData = $dataLvl ? 'data' + (($dataLvl-1)||'') : 'parentData'
+      , $parentDataProperty = $dataLvl ? it.dataPathArr[$dataLvl] : 'parentDataProperty';
+  }}
+#}}
+
+{{## def.passParentData:
+  {{# def.setParentData }}
+  , {{= $parentData }}
+  , {{= $parentDataProperty }}
+#}}
+
+
+{{## def.iterateProperties:
+  {{? $ownProperties }}
+    {{=$dataProperties}} = {{=$dataProperties}} || Object.keys({{=$data}});
+    for (var {{=$idx}}=0; {{=$idx}}<{{=$dataProperties}}.length; {{=$idx}}++) {
+      var {{=$key}} = {{=$dataProperties}}[{{=$idx}}];
+  {{??}}
+    for (var {{=$key}} in {{=$data}}) {
+  {{?}}
+#}}
+
+
+{{## def.noPropertyInData:
+  {{=$useData}} === undefined
+  {{? $ownProperties }}
+    || !{{# def.isOwnProperty }}
+  {{?}}
+#}}
+
+
+{{## def.isOwnProperty:
+  Object.prototype.hasOwnProperty.call({{=$data}}, '{{=it.util.escapeQuotes($propertyKey)}}')
+#}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/dependencies.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/dependencies.jst
new file mode 100644
index 0000000..e4bddde
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/dependencies.jst
@@ -0,0 +1,79 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.missing }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+
+{{## def.propertyInData:
+  {{=$data}}{{= it.util.getProperty($property) }} !== undefined
+  {{? $ownProperties }}
+    && Object.prototype.hasOwnProperty.call({{=$data}}, '{{=it.util.escapeQuotes($property)}}')
+  {{?}}
+#}}
+
+
+{{
+  var $schemaDeps = {}
+    , $propertyDeps = {}
+    , $ownProperties = it.opts.ownProperties;
+
+  for ($property in $schema) {
+    if ($property == '__proto__') continue;
+    var $sch = $schema[$property];
+    var $deps = Array.isArray($sch) ? $propertyDeps : $schemaDeps;
+    $deps[$property] = $sch;
+  }
+}}
+
+var {{=$errs}} = errors;
+
+{{ var $currentErrorPath = it.errorPath; }}
+
+var missing{{=$lvl}};
+{{ for (var $property in $propertyDeps) { }}
+  {{ $deps = $propertyDeps[$property]; }}
+  {{? $deps.length }}
+    if ({{# def.propertyInData }}
+      {{? $breakOnError }}
+          && ({{# def.checkMissingProperty:$deps }})) {
+          {{# def.errorMissingProperty:'dependencies' }}
+      {{??}}
+        ) {
+          {{~ $deps:$propertyKey }}
+            {{# def.allErrorsMissingProperty:'dependencies' }}
+          {{~}}
+      {{?}}
+    } {{# def.elseIfValid }}
+  {{?}}
+{{ } }}
+
+{{
+  it.errorPath = $currentErrorPath;
+  var $currentBaseId = $it.baseId;
+}}
+
+
+{{ for (var $property in $schemaDeps) { }}
+  {{ var $sch = $schemaDeps[$property]; }}
+  {{? {{# def.nonEmptySchema:$sch }} }}
+    {{=$nextValid}} = true;
+
+    if ({{# def.propertyInData }}) {
+      {{ 
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + it.util.getProperty($property);
+        $it.errSchemaPath = $errSchemaPath + '/' + it.util.escapeFragment($property);
+      }}
+
+      {{# def.insertSubschemaCode }}
+    }
+
+    {{# def.ifResultValid }}
+  {{?}}
+{{ } }}
+
+{{? $breakOnError }} 
+  {{= $closingBraces }}
+  if ({{=$errs}} == errors) {
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/enum.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/enum.jst
new file mode 100644
index 0000000..357c2e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/enum.jst
@@ -0,0 +1,30 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{
+  var $i = 'i' + $lvl
+    , $vSchema = 'schema' + $lvl;
+}}
+
+{{? !$isData }}
+  var {{=$vSchema}} = validate.schema{{=$schemaPath}};
+{{?}}
+var {{=$valid}};
+
+{{?$isData}}{{# def.check$dataIsArray }}{{?}}
+
+{{=$valid}} = false;
+
+for (var {{=$i}}=0; {{=$i}}<{{=$vSchema}}.length; {{=$i}}++)
+  if (equal({{=$data}}, {{=$vSchema}}[{{=$i}}])) {
+    {{=$valid}} = true;
+    break;
+  }
+
+{{? $isData }}  }  {{?}}
+
+{{# def.checkError:'enum' }}
+
+{{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/errors.def b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/errors.def
new file mode 100644
index 0000000..5c5752c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/errors.def
@@ -0,0 +1,194 @@
+{{# def.definitions }}
+
+{{## def._error:_rule:
+  {{ 'istanbul ignore else'; }}
+  {{? it.createErrors !== false }}
+    {
+      keyword: '{{= $errorKeyword || _rule }}'
+      , dataPath: (dataPath || '') + {{= it.errorPath }}
+      , schemaPath: {{=it.util.toQuotedString($errSchemaPath)}}
+      , params: {{# def._errorParams[_rule] }}
+      {{? it.opts.messages !== false }}
+        , message: {{# def._errorMessages[_rule] }}
+      {{?}}
+      {{? it.opts.verbose }}
+        , schema: {{# def._errorSchemas[_rule] }}
+        , parentSchema: validate.schema{{=it.schemaPath}}
+        , data: {{=$data}}
+      {{?}}
+    }
+  {{??}}
+    {}
+  {{?}}
+#}}
+
+
+{{## def._addError:_rule:
+  if (vErrors === null) vErrors = [err];
+  else vErrors.push(err);
+  errors++;
+#}}
+
+
+{{## def.addError:_rule:
+  var err = {{# def._error:_rule }};
+  {{# def._addError:_rule }}
+#}}
+
+
+{{## def.error:_rule:
+  {{# def.beginDefOut}}
+    {{# def._error:_rule }}
+  {{# def.storeDefOut:__err }}
+
+  {{? !it.compositeRule && $breakOnError }}
+    {{ 'istanbul ignore if'; }}
+    {{? it.async }}
+      throw new ValidationError([{{=__err}}]);
+    {{??}}
+      validate.errors = [{{=__err}}];
+      return false;
+    {{?}}
+  {{??}}
+    var err = {{=__err}};
+    {{# def._addError:_rule }}
+  {{?}}
+#}}
+
+
+{{## def.extraError:_rule:
+  {{# def.addError:_rule}}
+  {{? !it.compositeRule && $breakOnError }}
+    {{ 'istanbul ignore if'; }}
+    {{? it.async }}
+      throw new ValidationError(vErrors);
+    {{??}}
+      validate.errors = vErrors;
+      return false;
+    {{?}}
+  {{?}}
+#}}
+
+
+{{## def.checkError:_rule:
+  if (!{{=$valid}}) {
+    {{# def.error:_rule }}
+  }
+#}}
+
+
+{{## def.resetErrors:
+  errors = {{=$errs}};
+  if (vErrors !== null) {
+    if ({{=$errs}}) vErrors.length = {{=$errs}};
+    else vErrors = null;
+  }
+#}}
+
+
+{{## def.concatSchema:{{?$isData}}' + {{=$schemaValue}} + '{{??}}{{=$schema}}{{?}}#}}
+{{## def.appendSchema:{{?$isData}}' + {{=$schemaValue}}{{??}}{{=$schemaValue}}'{{?}}#}}
+{{## def.concatSchemaEQ:{{?$isData}}' + {{=$schemaValue}} + '{{??}}{{=it.util.escapeQuotes($schema)}}{{?}}#}}
+
+{{## def._errorMessages = {
+  'false schema':  "'boolean schema is false'",
+  $ref:            "'can\\\'t resolve reference {{=it.util.escapeQuotes($schema)}}'",
+  additionalItems: "'should NOT have more than {{=$schema.length}} items'",
+  additionalProperties: "'{{? it.opts._errorDataPathProperty }}is an invalid additional property{{??}}should NOT have additional properties{{?}}'",
+  anyOf:           "'should match some schema in anyOf'",
+  const:           "'should be equal to constant'",
+  contains:        "'should contain a valid item'",
+  dependencies:    "'should have {{? $deps.length == 1 }}property {{= it.util.escapeQuotes($deps[0]) }}{{??}}properties {{= it.util.escapeQuotes($deps.join(\", \")) }}{{?}} when property {{= it.util.escapeQuotes($property) }} is present'",
+  'enum':          "'should be equal to one of the allowed values'",
+  format:          "'should match format \"{{#def.concatSchemaEQ}}\"'",
+  'if':            "'should match \"' + {{=$ifClause}} + '\" schema'",
+  _limit:          "'should be {{=$opStr}} {{#def.appendSchema}}",
+  _exclusiveLimit: "'{{=$exclusiveKeyword}} should be boolean'",
+  _limitItems:     "'should NOT have {{?$keyword=='maxItems'}}more{{??}}fewer{{?}} than {{#def.concatSchema}} items'",
+  _limitLength:    "'should NOT be {{?$keyword=='maxLength'}}longer{{??}}shorter{{?}} than {{#def.concatSchema}} characters'",
+  _limitProperties:"'should NOT have {{?$keyword=='maxProperties'}}more{{??}}fewer{{?}} than {{#def.concatSchema}} properties'",
+  multipleOf:      "'should be multiple of {{#def.appendSchema}}",
+  not:             "'should NOT be valid'",
+  oneOf:           "'should match exactly one schema in oneOf'",
+  pattern:         "'should match pattern \"{{#def.concatSchemaEQ}}\"'",
+  propertyNames:   "'property name \\'{{=$invalidName}}\\' is invalid'",
+  required:        "'{{? it.opts._errorDataPathProperty }}is a required property{{??}}should have required property \\'{{=$missingProperty}}\\'{{?}}'",
+  type:            "'should be {{? $typeIsArray }}{{= $typeSchema.join(\",\") }}{{??}}{{=$typeSchema}}{{?}}'",
+  uniqueItems:     "'should NOT have duplicate items (items ## ' + j + ' and ' + i + ' are identical)'",
+  custom:          "'should pass \"{{=$rule.keyword}}\" keyword validation'",
+  patternRequired: "'should have property matching pattern \\'{{=$missingPattern}}\\''",
+  switch:          "'should pass \"switch\" keyword validation'",
+  _formatLimit:    "'should be {{=$opStr}} \"{{#def.concatSchemaEQ}}\"'",
+  _formatExclusiveLimit: "'{{=$exclusiveKeyword}} should be boolean'"
+} #}}
+
+
+{{## def.schemaRefOrVal: {{?$isData}}validate.schema{{=$schemaPath}}{{??}}{{=$schema}}{{?}} #}}
+{{## def.schemaRefOrQS: {{?$isData}}validate.schema{{=$schemaPath}}{{??}}{{=it.util.toQuotedString($schema)}}{{?}} #}}
+
+{{## def._errorSchemas = {
+  'false schema':  "false",
+  $ref:            "{{=it.util.toQuotedString($schema)}}",
+  additionalItems: "false",
+  additionalProperties: "false",
+  anyOf:           "validate.schema{{=$schemaPath}}",
+  const:           "validate.schema{{=$schemaPath}}",
+  contains:        "validate.schema{{=$schemaPath}}",
+  dependencies:    "validate.schema{{=$schemaPath}}",
+  'enum':          "validate.schema{{=$schemaPath}}",
+  format:          "{{#def.schemaRefOrQS}}",
+  'if':            "validate.schema{{=$schemaPath}}",
+  _limit:          "{{#def.schemaRefOrVal}}",
+  _exclusiveLimit: "validate.schema{{=$schemaPath}}",
+  _limitItems:     "{{#def.schemaRefOrVal}}",
+  _limitLength:    "{{#def.schemaRefOrVal}}",
+  _limitProperties:"{{#def.schemaRefOrVal}}",
+  multipleOf:      "{{#def.schemaRefOrVal}}",
+  not:             "validate.schema{{=$schemaPath}}",
+  oneOf:           "validate.schema{{=$schemaPath}}",
+  pattern:         "{{#def.schemaRefOrQS}}",
+  propertyNames:   "validate.schema{{=$schemaPath}}",
+  required:        "validate.schema{{=$schemaPath}}",
+  type:            "validate.schema{{=$schemaPath}}",
+  uniqueItems:     "{{#def.schemaRefOrVal}}",
+  custom:          "validate.schema{{=$schemaPath}}",
+  patternRequired: "validate.schema{{=$schemaPath}}",
+  switch:          "validate.schema{{=$schemaPath}}",
+  _formatLimit:    "{{#def.schemaRefOrQS}}",
+  _formatExclusiveLimit: "validate.schema{{=$schemaPath}}"
+} #}}
+
+
+{{## def.schemaValueQS: {{?$isData}}{{=$schemaValue}}{{??}}{{=it.util.toQuotedString($schema)}}{{?}} #}}
+
+{{## def._errorParams = {
+  'false schema':  "{}",
+  $ref:            "{ ref: '{{=it.util.escapeQuotes($schema)}}' }",
+  additionalItems: "{ limit: {{=$schema.length}} }",
+  additionalProperties: "{ additionalProperty: '{{=$additionalProperty}}' }",
+  anyOf:           "{}",
+  const:           "{ allowedValue: schema{{=$lvl}} }",
+  contains:        "{}",
+  dependencies:    "{ property: '{{= it.util.escapeQuotes($property) }}', missingProperty: '{{=$missingProperty}}', depsCount: {{=$deps.length}}, deps: '{{= it.util.escapeQuotes($deps.length==1 ? $deps[0] : $deps.join(\", \")) }}' }",
+  'enum':          "{ allowedValues: schema{{=$lvl}} }",
+  format:          "{ format: {{#def.schemaValueQS}} }",
+  'if':            "{ failingKeyword: {{=$ifClause}} }",
+  _limit:          "{ comparison: {{=$opExpr}}, limit: {{=$schemaValue}}, exclusive: {{=$exclusive}} }",
+  _exclusiveLimit: "{}",
+  _limitItems:     "{ limit: {{=$schemaValue}} }",
+  _limitLength:    "{ limit: {{=$schemaValue}} }",
+  _limitProperties:"{ limit: {{=$schemaValue}} }",
+  multipleOf:      "{ multipleOf: {{=$schemaValue}} }",
+  not:             "{}",
+  oneOf:           "{ passingSchemas: {{=$passingSchemas}} }",
+  pattern:         "{ pattern: {{#def.schemaValueQS}} }",
+  propertyNames:   "{ propertyName: '{{=$invalidName}}' }",
+  required:        "{ missingProperty: '{{=$missingProperty}}' }",
+  type:            "{ type: '{{? $typeIsArray }}{{= $typeSchema.join(\",\") }}{{??}}{{=$typeSchema}}{{?}}' }",
+  uniqueItems:     "{ i: i, j: j }",
+  custom:          "{ keyword: '{{=$rule.keyword}}' }",
+  patternRequired: "{ missingPattern: '{{=$missingPattern}}' }",
+  switch:          "{ caseIndex: {{=$caseIndex}} }",
+  _formatLimit:    "{ comparison: {{=$opExpr}}, limit: {{#def.schemaValueQS}}, exclusive: {{=$exclusive}} }",
+  _formatExclusiveLimit: "{}"
+} #}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/format.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/format.jst
new file mode 100644
index 0000000..37f14da
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/format.jst
@@ -0,0 +1,106 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+
+{{## def.skipFormat:
+  {{? $breakOnError }} if (true) { {{?}}
+  {{ return out; }}
+#}}
+
+{{? it.opts.format === false }}{{# def.skipFormat }}{{?}}
+
+
+{{# def.$data }}
+
+
+{{## def.$dataCheckFormat:
+  {{# def.$dataNotType:'string' }}
+  ({{? $unknownFormats != 'ignore' }}
+     ({{=$schemaValue}} && !{{=$format}}
+      {{? $allowUnknown }}
+        && self._opts.unknownFormats.indexOf({{=$schemaValue}}) == -1
+      {{?}}) ||
+   {{?}}
+   ({{=$format}} && {{=$formatType}} == '{{=$ruleType}}'
+                 && !(typeof {{=$format}} == 'function'
+                     ? {{? it.async}}
+                        (async{{=$lvl}} ? await {{=$format}}({{=$data}}) : {{=$format}}({{=$data}}))
+                       {{??}}
+                        {{=$format}}({{=$data}})
+                       {{?}}
+                     : {{=$format}}.test({{=$data}}))))
+#}}
+
+{{## def.checkFormat:
+  {{
+    var $formatRef = 'formats' + it.util.getProperty($schema);
+    if ($isObject) $formatRef += '.validate';
+  }}
+  {{? typeof $format == 'function' }}
+    {{=$formatRef}}({{=$data}})
+  {{??}}
+    {{=$formatRef}}.test({{=$data}})
+  {{?}}
+#}}
+
+
+{{
+  var $unknownFormats = it.opts.unknownFormats
+    , $allowUnknown = Array.isArray($unknownFormats);
+}}
+
+{{? $isData }}
+  {{
+    var $format = 'format' + $lvl
+      , $isObject = 'isObject' + $lvl
+      , $formatType = 'formatType' + $lvl;
+  }}
+  var {{=$format}} = formats[{{=$schemaValue}}];
+  var {{=$isObject}} = typeof {{=$format}} == 'object'
+                        && !({{=$format}} instanceof RegExp)
+                        && {{=$format}}.validate;
+  var {{=$formatType}} = {{=$isObject}} && {{=$format}}.type || 'string';
+  if ({{=$isObject}}) {
+    {{? it.async}}
+      var async{{=$lvl}} = {{=$format}}.async;
+    {{?}}
+    {{=$format}} = {{=$format}}.validate;
+  }
+  if ({{# def.$dataCheckFormat }}) {
+{{??}}
+  {{ var $format = it.formats[$schema]; }}
+  {{? !$format }}
+    {{? $unknownFormats == 'ignore' }}
+      {{ it.logger.warn('unknown format "' + $schema + '" ignored in schema at path "' + it.errSchemaPath + '"'); }}
+      {{# def.skipFormat }}
+    {{?? $allowUnknown && $unknownFormats.indexOf($schema) >= 0 }}
+      {{# def.skipFormat }}
+    {{??}}
+      {{ throw new Error('unknown format "' + $schema + '" is used in schema at path "' + it.errSchemaPath + '"'); }}
+    {{?}}
+  {{?}}
+  {{
+    var $isObject = typeof $format == 'object'
+                    && !($format instanceof RegExp)
+                    && $format.validate;
+    var $formatType = $isObject && $format.type || 'string';
+    if ($isObject) {
+      var $async = $format.async === true;
+      $format = $format.validate;
+    }
+  }}
+  {{? $formatType != $ruleType }}
+    {{# def.skipFormat }}
+  {{?}}
+  {{? $async }}
+    {{
+      if (!it.async) throw new Error('async format in sync schema');
+      var $formatRef = 'formats' + it.util.getProperty($schema) + '.validate';
+    }}
+    if (!(await {{=$formatRef}}({{=$data}}))) {
+  {{??}}
+    if (!{{# def.checkFormat }}) {
+  {{?}}
+{{?}}
+    {{# def.error:'format' }}
+  } {{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/if.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/if.jst
new file mode 100644
index 0000000..adb5036
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/if.jst
@@ -0,0 +1,73 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+
+{{## def.validateIfClause:_clause:
+  {{
+    $it.schema = it.schema['_clause'];
+    $it.schemaPath = it.schemaPath + '._clause';
+    $it.errSchemaPath = it.errSchemaPath + '/_clause';
+  }}
+  {{# def.insertSubschemaCode }}
+  {{=$valid}} = {{=$nextValid}};
+  {{? $thenPresent && $elsePresent }}
+    {{ $ifClause = 'ifClause' + $lvl; }}
+    var {{=$ifClause}} = '_clause';
+  {{??}}
+    {{ $ifClause = '\'_clause\''; }}
+  {{?}}
+#}}
+
+{{
+  var $thenSch = it.schema['then']
+    , $elseSch = it.schema['else']
+    , $thenPresent = $thenSch !== undefined && {{# def.nonEmptySchema:$thenSch }}
+    , $elsePresent = $elseSch !== undefined && {{# def.nonEmptySchema:$elseSch }}
+    , $currentBaseId = $it.baseId;
+}}
+
+{{? $thenPresent || $elsePresent }}
+  {{
+    var $ifClause;
+    $it.createErrors = false;
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+  }}
+  var {{=$errs}} = errors;
+  var {{=$valid}} = true;
+
+  {{# def.setCompositeRule }}
+  {{# def.insertSubschemaCode }}
+  {{ $it.createErrors = true; }}
+  {{# def.resetErrors }}
+  {{# def.resetCompositeRule }}
+
+  {{? $thenPresent }}
+    if ({{=$nextValid}}) {
+      {{# def.validateIfClause:then }}
+    }
+    {{? $elsePresent }}
+      else {
+    {{?}}
+  {{??}}
+    if (!{{=$nextValid}}) {
+  {{?}}
+
+  {{? $elsePresent }}
+      {{# def.validateIfClause:else }}
+    }
+  {{?}}
+
+  if (!{{=$valid}}) {
+    {{# def.extraError:'if' }}
+  } 
+  {{? $breakOnError }} else { {{?}}
+{{??}}
+  {{? $breakOnError }}
+    if (true) {
+  {{?}}
+{{?}}
+
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/items.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/items.jst
new file mode 100644
index 0000000..acc932a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/items.jst
@@ -0,0 +1,98 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+
+{{## def.validateItems:startFrom:
+  for (var {{=$idx}} = {{=startFrom}}; {{=$idx}} < {{=$data}}.length; {{=$idx}}++) {
+    {{
+      $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+      var $passData = $data + '[' + $idx + ']';
+      $it.dataPathArr[$dataNxt] = $idx;
+    }}
+
+    {{# def.generateSubschemaCode }}
+    {{# def.optimizeValidate }}
+
+    {{? $breakOnError }}
+      if (!{{=$nextValid}}) break;
+    {{?}}
+  }
+#}}
+
+{{
+  var $idx = 'i' + $lvl
+    , $dataNxt = $it.dataLevel = it.dataLevel + 1
+    , $nextData = 'data' + $dataNxt
+    , $currentBaseId = it.baseId;
+}}
+
+var {{=$errs}} = errors;
+var {{=$valid}};
+
+{{? Array.isArray($schema) }}
+  {{ /* 'items' is an array of schemas */}}
+  {{ var $additionalItems = it.schema.additionalItems; }}
+  {{? $additionalItems === false }}
+    {{=$valid}} = {{=$data}}.length <= {{= $schema.length }};
+    {{
+      var $currErrSchemaPath = $errSchemaPath;
+      $errSchemaPath = it.errSchemaPath + '/additionalItems';      
+    }}
+    {{# def.checkError:'additionalItems' }}
+    {{ $errSchemaPath = $currErrSchemaPath; }}
+    {{# def.elseIfValid}}
+  {{?}}
+
+  {{~ $schema:$sch:$i }}
+    {{? {{# def.nonEmptySchema:$sch }} }}
+      {{=$nextValid}} = true;
+
+      if ({{=$data}}.length > {{=$i}}) {
+        {{
+          var $passData = $data + '[' + $i + ']';
+          $it.schema = $sch;
+          $it.schemaPath = $schemaPath + '[' + $i + ']';
+          $it.errSchemaPath = $errSchemaPath + '/' + $i;
+          $it.errorPath = it.util.getPathExpr(it.errorPath, $i, it.opts.jsonPointers, true);
+          $it.dataPathArr[$dataNxt] = $i;
+        }}
+
+        {{# def.generateSubschemaCode }}
+        {{# def.optimizeValidate }}
+      }
+
+      {{# def.ifResultValid }}
+    {{?}}
+  {{~}}
+
+  {{? typeof $additionalItems == 'object' && {{# def.nonEmptySchema:$additionalItems }} }}
+    {{
+      $it.schema = $additionalItems;
+      $it.schemaPath = it.schemaPath + '.additionalItems';
+      $it.errSchemaPath = it.errSchemaPath + '/additionalItems';
+    }}
+    {{=$nextValid}} = true;
+
+    if ({{=$data}}.length > {{= $schema.length }}) {
+      {{# def.validateItems: $schema.length }}
+    }
+
+    {{# def.ifResultValid }}
+  {{?}}
+
+{{?? {{# def.nonEmptySchema:$schema }} }}
+  {{ /* 'items' is a single schema */}}
+  {{
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+  }}
+  {{# def.validateItems: 0 }}
+{{?}}
+
+{{? $breakOnError }}
+  {{= $closingBraces }}
+  if ({{=$errs}} == errors) {
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/missing.def b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/missing.def
new file mode 100644
index 0000000..a73b9f9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/missing.def
@@ -0,0 +1,39 @@
+{{## def.checkMissingProperty:_properties:
+  {{~ _properties:$propertyKey:$i }}
+    {{?$i}} || {{?}}
+    {{
+      var $prop = it.util.getProperty($propertyKey)
+        , $useData = $data + $prop;
+    }}
+    ( ({{# def.noPropertyInData }}) && (missing{{=$lvl}} = {{= it.util.toQuotedString(it.opts.jsonPointers ? $propertyKey : $prop) }}) )
+  {{~}}
+#}}
+
+
+{{## def.errorMissingProperty:_error:
+  {{
+    var $propertyPath = 'missing' + $lvl
+      , $missingProperty = '\' + ' + $propertyPath + ' + \'';
+    if (it.opts._errorDataPathProperty) {
+      it.errorPath = it.opts.jsonPointers
+                      ? it.util.getPathExpr($currentErrorPath,  $propertyPath, true)
+                      : $currentErrorPath + ' + ' + $propertyPath;
+    }
+  }}
+  {{# def.error:_error }}
+#}}
+
+
+{{## def.allErrorsMissingProperty:_error:
+  {{
+    var $prop = it.util.getProperty($propertyKey)
+      , $missingProperty = it.util.escapeQuotes($propertyKey)
+      , $useData = $data + $prop;
+    if (it.opts._errorDataPathProperty) {
+      it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+    }
+  }}
+  if ({{# def.noPropertyInData }}) {
+    {{# def.addError:_error }}
+  }
+#}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/multipleOf.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/multipleOf.jst
new file mode 100644
index 0000000..6d88a45
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/multipleOf.jst
@@ -0,0 +1,22 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{# def.numberKeyword }}
+
+var division{{=$lvl}};
+if ({{?$isData}}
+      {{=$schemaValue}} !== undefined && (
+      typeof {{=$schemaValue}} != 'number' ||
+    {{?}}
+      (division{{=$lvl}} = {{=$data}} / {{=$schemaValue}},
+      {{? it.opts.multipleOfPrecision }}
+        Math.abs(Math.round(division{{=$lvl}}) - division{{=$lvl}}) > 1e-{{=it.opts.multipleOfPrecision}}
+      {{??}}
+        division{{=$lvl}} !== parseInt(division{{=$lvl}})
+      {{?}}
+      )
+    {{?$isData}}  )  {{?}} ) {
+  {{# def.error:'multipleOf' }}
+} {{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/not.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/not.jst
new file mode 100644
index 0000000..e03185a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/not.jst
@@ -0,0 +1,43 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+{{? {{# def.nonEmptySchema:$schema }} }}
+  {{
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+  }}
+
+  var {{=$errs}} = errors;
+
+  {{# def.setCompositeRule }}
+
+  {{
+    $it.createErrors = false;
+    var $allErrorsOption;
+    if ($it.opts.allErrors) {
+      $allErrorsOption = $it.opts.allErrors;
+      $it.opts.allErrors = false;
+    }
+  }}
+  {{= it.validate($it) }}
+  {{
+    $it.createErrors = true;
+    if ($allErrorsOption) $it.opts.allErrors = $allErrorsOption;
+  }}
+
+  {{# def.resetCompositeRule }}
+
+  if ({{=$nextValid}}) {
+    {{# def.error:'not' }}
+  } else {
+    {{# def.resetErrors }}
+  {{? it.opts.allErrors }} } {{?}}
+{{??}}
+  {{# def.addError:'not' }}
+  {{? $breakOnError}}
+    if (false) {
+  {{?}}
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/oneOf.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/oneOf.jst
new file mode 100644
index 0000000..bcce2c6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/oneOf.jst
@@ -0,0 +1,54 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+{{
+  var $currentBaseId = $it.baseId
+    , $prevValid = 'prevValid' + $lvl
+    , $passingSchemas = 'passingSchemas' + $lvl;
+}}
+
+var {{=$errs}} = errors
+  , {{=$prevValid}} = false
+  , {{=$valid}} = false
+  , {{=$passingSchemas}} = null;
+
+{{# def.setCompositeRule }}
+
+{{~ $schema:$sch:$i }}
+  {{? {{# def.nonEmptySchema:$sch }} }}
+    {{
+      $it.schema = $sch;
+      $it.schemaPath = $schemaPath + '[' + $i + ']';
+      $it.errSchemaPath = $errSchemaPath + '/' + $i;
+    }}
+
+    {{# def.insertSubschemaCode }}
+  {{??}}
+    var {{=$nextValid}} = true;
+  {{?}}
+
+  {{? $i }}
+    if ({{=$nextValid}} && {{=$prevValid}}) {
+      {{=$valid}} = false;
+      {{=$passingSchemas}} = [{{=$passingSchemas}}, {{=$i}}];
+    } else {
+    {{ $closingBraces += '}'; }}
+  {{?}}
+
+    if ({{=$nextValid}}) {
+      {{=$valid}} = {{=$prevValid}} = true;
+      {{=$passingSchemas}} = {{=$i}};
+    }
+{{~}}
+
+{{# def.resetCompositeRule }}
+
+{{= $closingBraces }}
+
+if (!{{=$valid}}) {
+  {{# def.extraError:'oneOf' }}
+} else {
+  {{# def.resetErrors }}
+{{? it.opts.allErrors }} } {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/pattern.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/pattern.jst
new file mode 100644
index 0000000..3a37ef6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/pattern.jst
@@ -0,0 +1,14 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{
+  var $regexp = $isData
+                ? '(new RegExp(' + $schemaValue + '))'
+                : it.usePattern($schema);
+}}
+
+if ({{# def.$dataNotType:'string' }} !{{=$regexp}}.test({{=$data}}) ) {
+  {{# def.error:'pattern' }}
+} {{? $breakOnError }} else { {{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/properties.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/properties.jst
new file mode 100644
index 0000000..5cebb9b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/properties.jst
@@ -0,0 +1,245 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+
+{{## def.validateAdditional:
+  {{ /* additionalProperties is schema */
+    $it.schema = $aProperties;
+    $it.schemaPath = it.schemaPath + '.additionalProperties';
+    $it.errSchemaPath = it.errSchemaPath + '/additionalProperties';
+    $it.errorPath = it.opts._errorDataPathProperty
+                    ? it.errorPath
+                    : it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+    var $passData = $data + '[' + $key + ']';
+    $it.dataPathArr[$dataNxt] = $key;
+  }}
+
+  {{# def.generateSubschemaCode }}
+  {{# def.optimizeValidate }}
+#}}
+
+
+{{
+  var $key = 'key' + $lvl
+    , $idx = 'idx' + $lvl
+    , $dataNxt = $it.dataLevel = it.dataLevel + 1
+    , $nextData = 'data' + $dataNxt
+    , $dataProperties = 'dataProperties' + $lvl;
+
+  var $schemaKeys = Object.keys($schema || {}).filter(notProto)
+    , $pProperties = it.schema.patternProperties || {}
+    , $pPropertyKeys = Object.keys($pProperties).filter(notProto)
+    , $aProperties = it.schema.additionalProperties
+    , $someProperties = $schemaKeys.length || $pPropertyKeys.length
+    , $noAdditional = $aProperties === false
+    , $additionalIsSchema = typeof $aProperties == 'object'
+                              && Object.keys($aProperties).length
+    , $removeAdditional = it.opts.removeAdditional
+    , $checkAdditional = $noAdditional || $additionalIsSchema || $removeAdditional
+    , $ownProperties = it.opts.ownProperties
+    , $currentBaseId = it.baseId;
+
+  var $required = it.schema.required;
+  if ($required && !(it.opts.$data && $required.$data) && $required.length < it.opts.loopRequired) {
+    var $requiredHash = it.util.toHash($required);
+  }
+
+  function notProto(p) { return p !== '__proto__'; }
+}}
+
+
+var {{=$errs}} = errors;
+var {{=$nextValid}} = true;
+{{? $ownProperties }}
+  var {{=$dataProperties}} = undefined;
+{{?}}
+
+{{? $checkAdditional }}
+  {{# def.iterateProperties }}
+    {{? $someProperties }}
+      var isAdditional{{=$lvl}} = !(false
+        {{? $schemaKeys.length }}
+          {{? $schemaKeys.length > 8 }}
+            || validate.schema{{=$schemaPath}}.hasOwnProperty({{=$key}})
+          {{??}}
+            {{~ $schemaKeys:$propertyKey }}
+              || {{=$key}} == {{= it.util.toQuotedString($propertyKey) }}
+            {{~}}
+          {{?}}
+        {{?}}
+        {{? $pPropertyKeys.length }}
+          {{~ $pPropertyKeys:$pProperty:$i }}
+            || {{= it.usePattern($pProperty) }}.test({{=$key}})
+          {{~}}
+        {{?}}
+      );
+
+      if (isAdditional{{=$lvl}}) {
+    {{?}}
+    {{? $removeAdditional == 'all' }}
+      delete {{=$data}}[{{=$key}}];
+    {{??}}
+      {{
+        var $currentErrorPath = it.errorPath;
+        var $additionalProperty = '\' + ' + $key + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+        }
+      }}
+      {{? $noAdditional }}
+        {{? $removeAdditional }}
+          delete {{=$data}}[{{=$key}}];
+        {{??}}
+          {{=$nextValid}} = false;
+          {{
+            var $currErrSchemaPath = $errSchemaPath;
+            $errSchemaPath = it.errSchemaPath + '/additionalProperties';
+          }}
+          {{# def.error:'additionalProperties' }}
+          {{ $errSchemaPath = $currErrSchemaPath; }}
+          {{? $breakOnError }} break; {{?}}
+        {{?}}
+      {{?? $additionalIsSchema }}
+        {{? $removeAdditional == 'failing' }}
+          var {{=$errs}} = errors;
+          {{# def.setCompositeRule }}
+
+          {{# def.validateAdditional }}
+
+          if (!{{=$nextValid}}) {
+            errors = {{=$errs}};
+            if (validate.errors !== null) {
+              if (errors) validate.errors.length = errors;
+              else validate.errors = null;
+            }
+            delete {{=$data}}[{{=$key}}];
+          }
+
+          {{# def.resetCompositeRule }}
+        {{??}}
+          {{# def.validateAdditional }}
+          {{? $breakOnError }} if (!{{=$nextValid}}) break; {{?}}
+        {{?}}
+      {{?}}
+      {{ it.errorPath = $currentErrorPath; }}
+    {{?}}
+    {{? $someProperties }}
+      }
+    {{?}}
+  }
+
+  {{# def.ifResultValid }}
+{{?}}
+
+{{ var $useDefaults = it.opts.useDefaults && !it.compositeRule; }}
+
+{{? $schemaKeys.length }}
+  {{~ $schemaKeys:$propertyKey }}
+    {{ var $sch = $schema[$propertyKey]; }}
+
+    {{? {{# def.nonEmptySchema:$sch}} }}
+      {{
+        var $prop = it.util.getProperty($propertyKey)
+          , $passData = $data + $prop
+          , $hasDefault = $useDefaults && $sch.default !== undefined;
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + $prop;
+        $it.errSchemaPath = $errSchemaPath + '/' + it.util.escapeFragment($propertyKey);
+        $it.errorPath = it.util.getPath(it.errorPath, $propertyKey, it.opts.jsonPointers);
+        $it.dataPathArr[$dataNxt] = it.util.toQuotedString($propertyKey);
+      }}
+
+      {{# def.generateSubschemaCode }}
+
+      {{? {{# def.willOptimize }} }}
+        {{
+          $code = {{# def._optimizeValidate }};
+          var $useData = $passData;
+        }}
+      {{??}}
+        {{ var $useData = $nextData; }}
+        var {{=$nextData}} = {{=$passData}};
+      {{?}}
+
+      {{? $hasDefault }}
+        {{= $code }}
+      {{??}}
+        {{? $requiredHash && $requiredHash[$propertyKey] }}
+          if ({{# def.noPropertyInData }}) {
+            {{=$nextValid}} = false;
+            {{
+              var $currentErrorPath = it.errorPath
+                , $currErrSchemaPath = $errSchemaPath
+                , $missingProperty = it.util.escapeQuotes($propertyKey);
+              if (it.opts._errorDataPathProperty) {
+                it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+              }
+              $errSchemaPath = it.errSchemaPath + '/required';
+            }}
+            {{# def.error:'required' }}
+            {{ $errSchemaPath = $currErrSchemaPath; }}
+            {{ it.errorPath = $currentErrorPath; }}
+          } else {
+        {{??}}
+          {{? $breakOnError }}
+            if ({{# def.noPropertyInData }}) {
+              {{=$nextValid}} = true;
+            } else {
+          {{??}}
+            if ({{=$useData}} !== undefined
+              {{? $ownProperties }}
+                && {{# def.isOwnProperty }}
+              {{?}}
+            ) {
+          {{?}}
+        {{?}}
+
+          {{= $code }}
+        }
+      {{?}}  {{ /* $hasDefault */ }}
+    {{?}} {{ /* def.nonEmptySchema */ }}
+
+    {{# def.ifResultValid }}
+  {{~}}
+{{?}}
+
+{{? $pPropertyKeys.length }}
+  {{~ $pPropertyKeys:$pProperty }}
+    {{ var $sch = $pProperties[$pProperty]; }}
+
+    {{? {{# def.nonEmptySchema:$sch}} }}
+      {{
+        $it.schema = $sch;
+        $it.schemaPath = it.schemaPath + '.patternProperties' + it.util.getProperty($pProperty);
+        $it.errSchemaPath = it.errSchemaPath + '/patternProperties/'
+                                             + it.util.escapeFragment($pProperty);
+      }}
+
+      {{# def.iterateProperties }}
+        if ({{= it.usePattern($pProperty) }}.test({{=$key}})) {
+          {{
+            $it.errorPath = it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+            var $passData = $data + '[' + $key + ']';
+            $it.dataPathArr[$dataNxt] = $key;
+          }}
+
+          {{# def.generateSubschemaCode }}
+          {{# def.optimizeValidate }}
+
+          {{? $breakOnError }} if (!{{=$nextValid}}) break; {{?}}
+        }
+        {{? $breakOnError }} else {{=$nextValid}} = true; {{?}}
+      }
+
+      {{# def.ifResultValid }}
+    {{?}} {{ /* def.nonEmptySchema */ }}
+  {{~}}
+{{?}}
+
+
+{{? $breakOnError }}
+  {{= $closingBraces }}
+  if ({{=$errs}} == errors) {
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/propertyNames.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/propertyNames.jst
new file mode 100644
index 0000000..d456cca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/propertyNames.jst
@@ -0,0 +1,52 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.setupNextLevel }}
+
+var {{=$errs}} = errors;
+
+{{? {{# def.nonEmptySchema:$schema }} }}
+  {{
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+  }}
+
+  {{
+    var $key = 'key' + $lvl
+      , $idx = 'idx' + $lvl
+      , $i = 'i' + $lvl
+      , $invalidName = '\' + ' + $key + ' + \''
+      , $dataNxt = $it.dataLevel = it.dataLevel + 1
+      , $nextData = 'data' + $dataNxt
+      , $dataProperties = 'dataProperties' + $lvl
+      , $ownProperties = it.opts.ownProperties
+      , $currentBaseId = it.baseId;
+  }}
+
+  {{? $ownProperties }}
+    var {{=$dataProperties}} = undefined;
+  {{?}}
+  {{# def.iterateProperties }}
+    var startErrs{{=$lvl}} = errors;
+
+    {{ var $passData = $key; }}
+    {{# def.setCompositeRule }}
+    {{# def.generateSubschemaCode }}
+    {{# def.optimizeValidate }}
+    {{# def.resetCompositeRule }}
+
+    if (!{{=$nextValid}}) {
+      for (var {{=$i}}=startErrs{{=$lvl}}; {{=$i}}<errors; {{=$i}}++) {
+        vErrors[{{=$i}}].propertyName = {{=$key}};
+      }
+      {{# def.extraError:'propertyNames' }}
+      {{? $breakOnError }} break; {{?}}
+    }
+  }
+{{?}}
+
+{{? $breakOnError }}
+  {{= $closingBraces }}
+  if ({{=$errs}} == errors) {
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/ref.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/ref.jst
new file mode 100644
index 0000000..253e350
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/ref.jst
@@ -0,0 +1,85 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+
+{{## def._validateRef:_v:
+  {{? it.opts.passContext }}
+    {{=_v}}.call(this,
+  {{??}}
+    {{=_v}}(
+  {{?}}
+    {{=$data}}, {{# def.dataPath }}{{# def.passParentData }}, rootData)
+#}}
+
+{{ var $async, $refCode; }}
+{{? $schema == '#' || $schema == '#/' }}
+  {{
+    if (it.isRoot) {
+      $async = it.async;
+      $refCode = 'validate';
+    } else {
+      $async = it.root.schema.$async === true;
+      $refCode = 'root.refVal[0]';
+    }
+  }}
+{{??}}
+  {{ var $refVal = it.resolveRef(it.baseId, $schema, it.isRoot); }}
+  {{? $refVal === undefined }}
+    {{ var $message = it.MissingRefError.message(it.baseId, $schema); }}
+    {{? it.opts.missingRefs == 'fail' }}
+      {{ it.logger.error($message); }}
+      {{# def.error:'$ref' }}
+      {{? $breakOnError }} if (false) { {{?}}
+    {{?? it.opts.missingRefs == 'ignore' }}
+      {{ it.logger.warn($message); }}
+      {{? $breakOnError }} if (true) { {{?}}
+    {{??}}
+      {{ throw new it.MissingRefError(it.baseId, $schema, $message); }}
+    {{?}}
+  {{?? $refVal.inline }}
+    {{# def.setupNextLevel }}
+    {{
+      $it.schema = $refVal.schema;
+      $it.schemaPath = '';
+      $it.errSchemaPath = $schema;
+    }}
+    {{ var $code = it.validate($it).replace(/validate\.schema/g, $refVal.code); }}
+    {{= $code }}
+    {{? $breakOnError}}
+      if ({{=$nextValid}}) {
+    {{?}}
+  {{??}}
+    {{
+      $async = $refVal.$async === true || (it.async && $refVal.$async !== false);
+      $refCode = $refVal.code;
+    }}
+  {{?}}
+{{?}}
+
+{{? $refCode }}
+  {{# def.beginDefOut}}
+    {{# def._validateRef:$refCode }}
+  {{# def.storeDefOut:__callValidate }}
+
+  {{? $async }}
+    {{ if (!it.async) throw new Error('async schema referenced by sync schema'); }}
+    {{? $breakOnError }} var {{=$valid}}; {{?}}
+    try {
+      await {{=__callValidate}};
+      {{? $breakOnError }} {{=$valid}} = true; {{?}}
+    } catch (e) {
+      if (!(e instanceof ValidationError)) throw e;
+      if (vErrors === null) vErrors = e.errors;
+      else vErrors = vErrors.concat(e.errors);
+      errors = vErrors.length;
+      {{? $breakOnError }} {{=$valid}} = false; {{?}}
+    }
+    {{? $breakOnError }} if ({{=$valid}}) { {{?}}
+  {{??}}
+    if (!{{=__callValidate}}) {
+      if (vErrors === null) vErrors = {{=$refCode}}.errors;
+      else vErrors = vErrors.concat({{=$refCode}}.errors);
+      errors = vErrors.length;
+    } {{? $breakOnError }} else { {{?}}
+  {{?}}
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/required.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/required.jst
new file mode 100644
index 0000000..80fde35
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/required.jst
@@ -0,0 +1,108 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.missing }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+{{ var $vSchema = 'schema' + $lvl; }}
+
+{{## def.setupLoop:
+  {{? !$isData }}
+    var {{=$vSchema}} = validate.schema{{=$schemaPath}};
+  {{?}}
+
+  {{
+    var $i = 'i' + $lvl
+      , $propertyPath = 'schema' + $lvl + '[' + $i + ']'
+      , $missingProperty = '\' + ' + $propertyPath + ' + \'';
+    if (it.opts._errorDataPathProperty) {
+      it.errorPath = it.util.getPathExpr($currentErrorPath, $propertyPath, it.opts.jsonPointers);
+    }
+  }}
+#}}
+
+
+{{## def.isRequiredOwnProperty:
+  Object.prototype.hasOwnProperty.call({{=$data}}, {{=$vSchema}}[{{=$i}}])
+#}}
+
+
+{{? !$isData }}
+  {{? $schema.length < it.opts.loopRequired &&
+      it.schema.properties && Object.keys(it.schema.properties).length }}
+    {{ var $required = []; }}
+    {{~ $schema:$property }}
+      {{ var $propertySch = it.schema.properties[$property]; }}
+      {{? !($propertySch && {{# def.nonEmptySchema:$propertySch}}) }}
+        {{ $required[$required.length] = $property; }}
+      {{?}}
+    {{~}}
+  {{??}}
+    {{ var $required = $schema; }}
+  {{?}}
+{{?}}
+
+
+{{? $isData || $required.length }}
+  {{
+    var $currentErrorPath = it.errorPath
+      , $loopRequired = $isData || $required.length >= it.opts.loopRequired
+      , $ownProperties = it.opts.ownProperties;
+  }}
+
+  {{? $breakOnError }}
+    var missing{{=$lvl}};
+    {{? $loopRequired }}
+      {{# def.setupLoop }}
+      var {{=$valid}} = true;
+
+      {{?$isData}}{{# def.check$dataIsArray }}{{?}}
+
+      for (var {{=$i}} = 0; {{=$i}} < {{=$vSchema}}.length; {{=$i}}++) {
+        {{=$valid}} = {{=$data}}[{{=$vSchema}}[{{=$i}}]] !== undefined
+                      {{? $ownProperties }}
+                        && {{# def.isRequiredOwnProperty }}
+                      {{?}};
+        if (!{{=$valid}}) break;
+      }
+
+      {{? $isData }}  }  {{?}}
+
+      {{# def.checkError:'required' }}
+      else {
+    {{??}}
+      if ({{# def.checkMissingProperty:$required }}) {
+        {{# def.errorMissingProperty:'required' }}
+      } else {
+    {{?}}
+  {{??}}
+    {{? $loopRequired }}
+      {{# def.setupLoop }}
+      {{? $isData }}
+        if ({{=$vSchema}} && !Array.isArray({{=$vSchema}})) {
+          {{# def.addError:'required' }}
+        } else if ({{=$vSchema}} !== undefined) {
+      {{?}}
+
+      for (var {{=$i}} = 0; {{=$i}} < {{=$vSchema}}.length; {{=$i}}++) {
+        if ({{=$data}}[{{=$vSchema}}[{{=$i}}]] === undefined
+            {{? $ownProperties }}
+              || !{{# def.isRequiredOwnProperty }}
+            {{?}}) {
+          {{# def.addError:'required' }}
+        }
+      }
+
+      {{? $isData }}  }  {{?}}
+    {{??}}
+      {{~ $required:$propertyKey }}
+        {{# def.allErrorsMissingProperty:'required' }}
+      {{~}}
+    {{?}}
+  {{?}}
+
+  {{ it.errorPath = $currentErrorPath; }}
+
+{{?? $breakOnError }}
+  if (true) {
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/uniqueItems.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/uniqueItems.jst
new file mode 100644
index 0000000..e69b830
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/uniqueItems.jst
@@ -0,0 +1,62 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.setupKeyword }}
+{{# def.$data }}
+
+
+{{? ($schema || $isData) && it.opts.uniqueItems !== false }}
+  {{? $isData }}
+    var {{=$valid}};
+    if ({{=$schemaValue}} === false || {{=$schemaValue}} === undefined)
+      {{=$valid}} = true;
+    else if (typeof {{=$schemaValue}} != 'boolean')
+      {{=$valid}} = false;
+    else {
+  {{?}}
+
+  var i = {{=$data}}.length
+    , {{=$valid}} = true
+    , j;
+  if (i > 1) {
+    {{
+      var $itemType = it.schema.items && it.schema.items.type
+        , $typeIsArray = Array.isArray($itemType);
+    }}
+    {{? !$itemType || $itemType == 'object' || $itemType == 'array' ||
+        ($typeIsArray && ($itemType.indexOf('object') >= 0 || $itemType.indexOf('array') >= 0)) }}
+      outer:
+      for (;i--;) {
+        for (j = i; j--;) {
+          if (equal({{=$data}}[i], {{=$data}}[j])) {
+            {{=$valid}} = false;
+            break outer;
+          }
+        }
+      }
+    {{??}}
+      var itemIndices = {}, item;
+      for (;i--;) {
+        var item = {{=$data}}[i];
+        {{ var $method = 'checkDataType' + ($typeIsArray ? 's' : ''); }}
+        if ({{= it.util[$method]($itemType, 'item', it.opts.strictNumbers, true) }}) continue;
+        {{? $typeIsArray}}
+          if (typeof item == 'string') item = '"' + item;
+        {{?}}
+        if (typeof itemIndices[item] == 'number') {
+          {{=$valid}} = false;
+          j = itemIndices[item];
+          break;
+        }
+        itemIndices[item] = i;
+      }
+    {{?}}
+  }
+
+  {{? $isData }}  }  {{?}}
+
+  if (!{{=$valid}}) {
+    {{# def.error:'uniqueItems' }}
+  } {{? $breakOnError }} else { {{?}}
+{{??}}
+  {{? $breakOnError }} if (true) { {{?}}
+{{?}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dot/validate.jst b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/validate.jst
new file mode 100644
index 0000000..32087e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dot/validate.jst
@@ -0,0 +1,276 @@
+{{# def.definitions }}
+{{# def.errors }}
+{{# def.defaults }}
+{{# def.coerce }}
+
+{{ /**
+    * schema compilation (render) time:
+    * it = { schema, RULES, _validate, opts }
+    * it.validate - this template function,
+    *   it is used recursively to generate code for subschemas
+    *
+    * runtime:
+    * "validate" is a variable name to which this function will be assigned
+    * validateRef etc. are defined in the parent scope in index.js
+    */ }}
+
+{{
+  var $async = it.schema.$async === true
+    , $refKeywords = it.util.schemaHasRulesExcept(it.schema, it.RULES.all, '$ref')
+    , $id = it.self._getId(it.schema);
+}}
+
+{{
+  if (it.opts.strictKeywords) {
+    var $unknownKwd = it.util.schemaUnknownRules(it.schema, it.RULES.keywords);
+    if ($unknownKwd) {
+      var $keywordsMsg = 'unknown keyword: ' + $unknownKwd;
+      if (it.opts.strictKeywords === 'log') it.logger.warn($keywordsMsg);
+      else throw new Error($keywordsMsg);
+    }
+  }
+}}
+
+{{? it.isTop }}
+  var validate = {{?$async}}{{it.async = true;}}async {{?}}function(data, dataPath, parentData, parentDataProperty, rootData) {
+    'use strict';
+    {{? $id && (it.opts.sourceCode || it.opts.processCode) }}
+      {{= '/\*# sourceURL=' + $id + ' */' }}
+    {{?}}
+{{?}}
+
+{{? typeof it.schema == 'boolean' || !($refKeywords || it.schema.$ref) }}
+  {{ var $keyword = 'false schema'; }}
+  {{# def.setupKeyword }}
+  {{? it.schema === false}}
+    {{? it.isTop}}
+      {{ $breakOnError = true; }}
+    {{??}}
+      var {{=$valid}} = false;
+    {{?}}
+    {{# def.error:'false schema' }}
+  {{??}}
+    {{? it.isTop}}
+      {{? $async }}
+        return data;
+      {{??}}
+        validate.errors = null;
+        return true;
+      {{?}}
+    {{??}}
+      var {{=$valid}} = true;
+    {{?}}
+  {{?}}
+
+  {{? it.isTop}}
+    };
+    return validate;
+  {{?}}
+
+  {{ return out; }}
+{{?}}
+
+
+{{? it.isTop }}
+  {{
+    var $top = it.isTop
+      , $lvl = it.level = 0
+      , $dataLvl = it.dataLevel = 0
+      , $data = 'data';
+    it.rootId = it.resolve.fullPath(it.self._getId(it.root.schema));
+    it.baseId = it.baseId || it.rootId;
+    delete it.isTop;
+
+    it.dataPathArr = [""];
+
+    if (it.schema.default !== undefined && it.opts.useDefaults && it.opts.strictDefaults) {
+      var $defaultMsg = 'default is ignored in the schema root';
+      if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+      else throw new Error($defaultMsg);
+    }
+  }}
+
+  var vErrors = null; {{ /* don't edit, used in replace */ }}
+  var errors = 0;     {{ /* don't edit, used in replace */ }}
+  if (rootData === undefined) rootData = data; {{ /* don't edit, used in replace */ }}
+{{??}}
+  {{
+    var $lvl = it.level
+      , $dataLvl = it.dataLevel
+      , $data = 'data' + ($dataLvl || '');
+
+    if ($id) it.baseId = it.resolve.url(it.baseId, $id);
+
+    if ($async && !it.async) throw new Error('async schema in sync schema');
+  }}
+
+  var errs_{{=$lvl}} = errors;
+{{?}}
+
+{{
+  var $valid = 'valid' + $lvl
+    , $breakOnError = !it.opts.allErrors
+    , $closingBraces1 = ''
+    , $closingBraces2 = '';
+
+  var $errorKeyword;
+  var $typeSchema = it.schema.type
+    , $typeIsArray = Array.isArray($typeSchema);
+
+  if ($typeSchema && it.opts.nullable && it.schema.nullable === true) {
+    if ($typeIsArray) {
+      if ($typeSchema.indexOf('null') == -1)
+        $typeSchema = $typeSchema.concat('null');
+    } else if ($typeSchema != 'null') {
+      $typeSchema = [$typeSchema, 'null'];
+      $typeIsArray = true;
+    }
+  }
+
+  if ($typeIsArray && $typeSchema.length == 1) {
+    $typeSchema = $typeSchema[0];
+    $typeIsArray = false;
+  }
+}}
+
+{{## def.checkType:
+  {{
+    var $schemaPath = it.schemaPath + '.type'
+      , $errSchemaPath = it.errSchemaPath + '/type'
+      , $method = $typeIsArray ? 'checkDataTypes' : 'checkDataType';
+  }}
+
+  if ({{= it.util[$method]($typeSchema, $data, it.opts.strictNumbers, true) }}) {
+#}}
+
+{{? it.schema.$ref && $refKeywords }}
+  {{? it.opts.extendRefs == 'fail' }}
+    {{ throw new Error('$ref: validation keywords used in schema at path "' + it.errSchemaPath + '" (see option extendRefs)'); }}
+  {{?? it.opts.extendRefs !== true }}
+    {{
+      $refKeywords = false;
+      it.logger.warn('$ref: keywords ignored in schema at path "' + it.errSchemaPath + '"');
+    }}
+  {{?}}
+{{?}}
+
+{{? it.schema.$comment && it.opts.$comment }}
+  {{= it.RULES.all.$comment.code(it, '$comment') }}
+{{?}}
+
+{{? $typeSchema }}
+  {{? it.opts.coerceTypes }}
+    {{ var $coerceToTypes = it.util.coerceToTypes(it.opts.coerceTypes, $typeSchema); }}
+  {{?}}
+
+  {{ var $rulesGroup = it.RULES.types[$typeSchema]; }}
+  {{? $coerceToTypes || $typeIsArray || $rulesGroup === true ||
+    ($rulesGroup && !$shouldUseGroup($rulesGroup)) }}
+    {{
+      var $schemaPath = it.schemaPath + '.type'
+        , $errSchemaPath = it.errSchemaPath + '/type';
+    }}
+    {{# def.checkType }}
+      {{? $coerceToTypes }}
+        {{# def.coerceType }}
+      {{??}}
+        {{# def.error:'type' }}
+      {{?}}
+    }
+  {{?}}
+{{?}}
+
+
+{{? it.schema.$ref && !$refKeywords }}
+  {{= it.RULES.all.$ref.code(it, '$ref') }}
+  {{? $breakOnError }}
+    }
+    if (errors === {{?$top}}0{{??}}errs_{{=$lvl}}{{?}}) {
+    {{ $closingBraces2 += '}'; }}
+  {{?}}
+{{??}}
+  {{~ it.RULES:$rulesGroup }}
+    {{? $shouldUseGroup($rulesGroup) }}
+      {{? $rulesGroup.type }}
+        if ({{= it.util.checkDataType($rulesGroup.type, $data, it.opts.strictNumbers) }}) {
+      {{?}}
+        {{? it.opts.useDefaults }}
+          {{? $rulesGroup.type == 'object' && it.schema.properties }}
+            {{# def.defaultProperties }}
+          {{?? $rulesGroup.type == 'array' && Array.isArray(it.schema.items) }}
+            {{# def.defaultItems }}
+          {{?}}
+        {{?}}
+        {{~ $rulesGroup.rules:$rule }}
+          {{? $shouldUseRule($rule) }}
+            {{ var $code = $rule.code(it, $rule.keyword, $rulesGroup.type); }}
+            {{? $code }}
+              {{= $code }}
+              {{? $breakOnError }}
+                {{ $closingBraces1 += '}'; }}
+              {{?}}
+            {{?}}
+          {{?}}
+        {{~}}
+        {{? $breakOnError }}
+          {{= $closingBraces1 }}
+          {{ $closingBraces1 = ''; }}
+        {{?}}
+      {{? $rulesGroup.type }}
+        }
+        {{? $typeSchema && $typeSchema === $rulesGroup.type && !$coerceToTypes }}
+          else {
+            {{
+              var $schemaPath = it.schemaPath + '.type'
+                , $errSchemaPath = it.errSchemaPath + '/type';
+            }}
+            {{# def.error:'type' }}
+          }
+        {{?}}
+      {{?}}
+
+      {{? $breakOnError }}
+        if (errors === {{?$top}}0{{??}}errs_{{=$lvl}}{{?}}) {
+        {{ $closingBraces2 += '}'; }}
+      {{?}}
+    {{?}}
+  {{~}}
+{{?}}
+
+{{? $breakOnError }} {{= $closingBraces2 }} {{?}}
+
+{{? $top }}
+    {{? $async }}
+      if (errors === 0) return data;           {{ /* don't edit, used in replace */ }}
+      else throw new ValidationError(vErrors); {{ /* don't edit, used in replace */ }}
+    {{??}}
+      validate.errors = vErrors; {{ /* don't edit, used in replace */ }}
+      return errors === 0;       {{ /* don't edit, used in replace */ }}
+    {{?}}
+  };
+
+  return validate;
+{{??}}
+  var {{=$valid}} = errors === errs_{{=$lvl}};
+{{?}}
+
+{{
+  function $shouldUseGroup($rulesGroup) {
+    var rules = $rulesGroup.rules;
+    for (var i=0; i < rules.length; i++)
+      if ($shouldUseRule(rules[i]))
+        return true;
+  }
+
+  function $shouldUseRule($rule) {
+    return it.schema[$rule.keyword] !== undefined ||
+           ($rule.implements && $ruleImplementsSomeKeyword($rule));
+  }
+
+  function $ruleImplementsSomeKeyword($rule) {
+    var impl = $rule.implements;
+    for (var i=0; i < impl.length; i++)
+      if (it.schema[impl[i]] !== undefined)
+        return true;
+  }
+}}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/README.md b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/README.md
new file mode 100644
index 0000000..4d99484
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/README.md
@@ -0,0 +1,3 @@
+These files are compiled dot templates from dot folder.
+
+Do NOT edit them directly, edit the templates and run `npm run build` from main ajv folder.
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limit.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limit.js
new file mode 100644
index 0000000..05a1979
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limit.js
@@ -0,0 +1,163 @@
+'use strict';
+module.exports = function generate__limit(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $isMax = $keyword == 'maximum',
+    $exclusiveKeyword = $isMax ? 'exclusiveMaximum' : 'exclusiveMinimum',
+    $schemaExcl = it.schema[$exclusiveKeyword],
+    $isDataExcl = it.opts.$data && $schemaExcl && $schemaExcl.$data,
+    $op = $isMax ? '<' : '>',
+    $notOp = $isMax ? '>' : '<',
+    $errorKeyword = undefined;
+  if (!($isData || typeof $schema == 'number' || $schema === undefined)) {
+    throw new Error($keyword + ' must be number');
+  }
+  if (!($isDataExcl || $schemaExcl === undefined || typeof $schemaExcl == 'number' || typeof $schemaExcl == 'boolean')) {
+    throw new Error($exclusiveKeyword + ' must be number or boolean');
+  }
+  if ($isDataExcl) {
+    var $schemaValueExcl = it.util.getData($schemaExcl.$data, $dataLvl, it.dataPathArr),
+      $exclusive = 'exclusive' + $lvl,
+      $exclType = 'exclType' + $lvl,
+      $exclIsNumber = 'exclIsNumber' + $lvl,
+      $opExpr = 'op' + $lvl,
+      $opStr = '\' + ' + $opExpr + ' + \'';
+    out += ' var schemaExcl' + ($lvl) + ' = ' + ($schemaValueExcl) + '; ';
+    $schemaValueExcl = 'schemaExcl' + $lvl;
+    out += ' var ' + ($exclusive) + '; var ' + ($exclType) + ' = typeof ' + ($schemaValueExcl) + '; if (' + ($exclType) + ' != \'boolean\' && ' + ($exclType) + ' != \'undefined\' && ' + ($exclType) + ' != \'number\') { ';
+    var $errorKeyword = $exclusiveKeyword;
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ($errorKeyword || '_exclusiveLimit') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'' + ($exclusiveKeyword) + ' should be boolean\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    out += ' } else if ( ';
+    if ($isData) {
+      out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+    }
+    out += ' ' + ($exclType) + ' == \'number\' ? ( (' + ($exclusive) + ' = ' + ($schemaValue) + ' === undefined || ' + ($schemaValueExcl) + ' ' + ($op) + '= ' + ($schemaValue) + ') ? ' + ($data) + ' ' + ($notOp) + '= ' + ($schemaValueExcl) + ' : ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' ) : ( (' + ($exclusive) + ' = ' + ($schemaValueExcl) + ' === true) ? ' + ($data) + ' ' + ($notOp) + '= ' + ($schemaValue) + ' : ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' ) || ' + ($data) + ' !== ' + ($data) + ') { var op' + ($lvl) + ' = ' + ($exclusive) + ' ? \'' + ($op) + '\' : \'' + ($op) + '=\'; ';
+    if ($schema === undefined) {
+      $errorKeyword = $exclusiveKeyword;
+      $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+      $schemaValue = $schemaValueExcl;
+      $isData = $isDataExcl;
+    }
+  } else {
+    var $exclIsNumber = typeof $schemaExcl == 'number',
+      $opStr = $op;
+    if ($exclIsNumber && $isData) {
+      var $opExpr = '\'' + $opStr + '\'';
+      out += ' if ( ';
+      if ($isData) {
+        out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+      }
+      out += ' ( ' + ($schemaValue) + ' === undefined || ' + ($schemaExcl) + ' ' + ($op) + '= ' + ($schemaValue) + ' ? ' + ($data) + ' ' + ($notOp) + '= ' + ($schemaExcl) + ' : ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' ) || ' + ($data) + ' !== ' + ($data) + ') { ';
+    } else {
+      if ($exclIsNumber && $schema === undefined) {
+        $exclusive = true;
+        $errorKeyword = $exclusiveKeyword;
+        $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+        $schemaValue = $schemaExcl;
+        $notOp += '=';
+      } else {
+        if ($exclIsNumber) $schemaValue = Math[$isMax ? 'min' : 'max']($schemaExcl, $schema);
+        if ($schemaExcl === ($exclIsNumber ? $schemaValue : true)) {
+          $exclusive = true;
+          $errorKeyword = $exclusiveKeyword;
+          $errSchemaPath = it.errSchemaPath + '/' + $exclusiveKeyword;
+          $notOp += '=';
+        } else {
+          $exclusive = false;
+          $opStr += '=';
+        }
+      }
+      var $opExpr = '\'' + $opStr + '\'';
+      out += ' if ( ';
+      if ($isData) {
+        out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+      }
+      out += ' ' + ($data) + ' ' + ($notOp) + ' ' + ($schemaValue) + ' || ' + ($data) + ' !== ' + ($data) + ') { ';
+    }
+  }
+  $errorKeyword = $errorKeyword || $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limit') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { comparison: ' + ($opExpr) + ', limit: ' + ($schemaValue) + ', exclusive: ' + ($exclusive) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be ' + ($opStr) + ' ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue);
+      } else {
+        out += '' + ($schemaValue) + '\'';
+      }
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' } ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitItems.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitItems.js
new file mode 100644
index 0000000..e092a55
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitItems.js
@@ -0,0 +1,80 @@
+'use strict';
+module.exports = function generate__limitItems(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  var $op = $keyword == 'maxItems' ? '>' : '<';
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+  }
+  out += ' ' + ($data) + '.length ' + ($op) + ' ' + ($schemaValue) + ') { ';
+  var $errorKeyword = $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limitItems') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should NOT have ';
+      if ($keyword == 'maxItems') {
+        out += 'more';
+      } else {
+        out += 'fewer';
+      }
+      out += ' than ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + ($schema);
+      }
+      out += ' items\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitLength.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitLength.js
new file mode 100644
index 0000000..ecbd3fe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitLength.js
@@ -0,0 +1,85 @@
+'use strict';
+module.exports = function generate__limitLength(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  var $op = $keyword == 'maxLength' ? '>' : '<';
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+  }
+  if (it.opts.unicode === false) {
+    out += ' ' + ($data) + '.length ';
+  } else {
+    out += ' ucs2length(' + ($data) + ') ';
+  }
+  out += ' ' + ($op) + ' ' + ($schemaValue) + ') { ';
+  var $errorKeyword = $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limitLength') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should NOT be ';
+      if ($keyword == 'maxLength') {
+        out += 'longer';
+      } else {
+        out += 'shorter';
+      }
+      out += ' than ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + ($schema);
+      }
+      out += ' characters\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitProperties.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitProperties.js
new file mode 100644
index 0000000..d232755
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/_limitProperties.js
@@ -0,0 +1,80 @@
+'use strict';
+module.exports = function generate__limitProperties(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  var $op = $keyword == 'maxProperties' ? '>' : '<';
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'number\') || ';
+  }
+  out += ' Object.keys(' + ($data) + ').length ' + ($op) + ' ' + ($schemaValue) + ') { ';
+  var $errorKeyword = $keyword;
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ($errorKeyword || '_limitProperties') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should NOT have ';
+      if ($keyword == 'maxProperties') {
+        out += 'more';
+      } else {
+        out += 'fewer';
+      }
+      out += ' than ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + ($schema);
+      }
+      out += ' properties\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/allOf.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/allOf.js
new file mode 100644
index 0000000..fb8c2e4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/allOf.js
@@ -0,0 +1,42 @@
+'use strict';
+module.exports = function generate_allOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $currentBaseId = $it.baseId,
+    $allSchemasEmpty = true;
+  var arr1 = $schema;
+  if (arr1) {
+    var $sch, $i = -1,
+      l1 = arr1.length - 1;
+    while ($i < l1) {
+      $sch = arr1[$i += 1];
+      if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+        $allSchemasEmpty = false;
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + '[' + $i + ']';
+        $it.errSchemaPath = $errSchemaPath + '/' + $i;
+        out += '  ' + (it.validate($it)) + ' ';
+        $it.baseId = $currentBaseId;
+        if ($breakOnError) {
+          out += ' if (' + ($nextValid) + ') { ';
+          $closingBraces += '}';
+        }
+      }
+    }
+  }
+  if ($breakOnError) {
+    if ($allSchemasEmpty) {
+      out += ' if (true) { ';
+    } else {
+      out += ' ' + ($closingBraces.slice(0, -1)) + ' ';
+    }
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/anyOf.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/anyOf.js
new file mode 100644
index 0000000..0600a9d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/anyOf.js
@@ -0,0 +1,73 @@
+'use strict';
+module.exports = function generate_anyOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $noEmptySchema = $schema.every(function($sch) {
+    return (it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all));
+  });
+  if ($noEmptySchema) {
+    var $currentBaseId = $it.baseId;
+    out += ' var ' + ($errs) + ' = errors; var ' + ($valid) + ' = false;  ';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    var arr1 = $schema;
+    if (arr1) {
+      var $sch, $i = -1,
+        l1 = arr1.length - 1;
+      while ($i < l1) {
+        $sch = arr1[$i += 1];
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + '[' + $i + ']';
+        $it.errSchemaPath = $errSchemaPath + '/' + $i;
+        out += '  ' + (it.validate($it)) + ' ';
+        $it.baseId = $currentBaseId;
+        out += ' ' + ($valid) + ' = ' + ($valid) + ' || ' + ($nextValid) + '; if (!' + ($valid) + ') { ';
+        $closingBraces += '}';
+      }
+    }
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' ' + ($closingBraces) + ' if (!' + ($valid) + ') {   var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('anyOf') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should match some schema in anyOf\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError(vErrors); ';
+      } else {
+        out += ' validate.errors = vErrors; return false; ';
+      }
+    }
+    out += ' } else {  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; } ';
+    if (it.opts.allErrors) {
+      out += ' } ';
+    }
+  } else {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/comment.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/comment.js
new file mode 100644
index 0000000..dd66bb8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/comment.js
@@ -0,0 +1,14 @@
+'use strict';
+module.exports = function generate_comment(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $schema = it.schema[$keyword];
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $comment = it.util.toQuotedString($schema);
+  if (it.opts.$comment === true) {
+    out += ' console.log(' + ($comment) + ');';
+  } else if (typeof it.opts.$comment == 'function') {
+    out += ' self._opts.$comment(' + ($comment) + ', ' + (it.util.toQuotedString($errSchemaPath)) + ', validate.root.schema);';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/const.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/const.js
new file mode 100644
index 0000000..15b7c61
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/const.js
@@ -0,0 +1,56 @@
+'use strict';
+module.exports = function generate_const(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!$isData) {
+    out += ' var schema' + ($lvl) + ' = validate.schema' + ($schemaPath) + ';';
+  }
+  out += 'var ' + ($valid) + ' = equal(' + ($data) + ', schema' + ($lvl) + '); if (!' + ($valid) + ') {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('const') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { allowedValue: schema' + ($lvl) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be equal to constant\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' }';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/contains.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/contains.js
new file mode 100644
index 0000000..7d76300
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/contains.js
@@ -0,0 +1,81 @@
+'use strict';
+module.exports = function generate_contains(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $idx = 'i' + $lvl,
+    $dataNxt = $it.dataLevel = it.dataLevel + 1,
+    $nextData = 'data' + $dataNxt,
+    $currentBaseId = it.baseId,
+    $nonEmptySchema = (it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all));
+  out += 'var ' + ($errs) + ' = errors;var ' + ($valid) + ';';
+  if ($nonEmptySchema) {
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += ' var ' + ($nextValid) + ' = false; for (var ' + ($idx) + ' = 0; ' + ($idx) + ' < ' + ($data) + '.length; ' + ($idx) + '++) { ';
+    $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+    var $passData = $data + '[' + $idx + ']';
+    $it.dataPathArr[$dataNxt] = $idx;
+    var $code = it.validate($it);
+    $it.baseId = $currentBaseId;
+    if (it.util.varOccurences($code, $nextData) < 2) {
+      out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+    } else {
+      out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+    }
+    out += ' if (' + ($nextValid) + ') break; }  ';
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' ' + ($closingBraces) + ' if (!' + ($nextValid) + ') {';
+  } else {
+    out += ' if (' + ($data) + '.length == 0) {';
+  }
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('contains') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should contain a valid item\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' } else { ';
+  if ($nonEmptySchema) {
+    out += '  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; } ';
+  }
+  if (it.opts.allErrors) {
+    out += ' } ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/custom.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/custom.js
new file mode 100644
index 0000000..f3e641e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/custom.js
@@ -0,0 +1,228 @@
+'use strict';
+module.exports = function generate_custom(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $errorKeyword;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $rule = this,
+    $definition = 'definition' + $lvl,
+    $rDef = $rule.definition,
+    $closingBraces = '';
+  var $compile, $inline, $macro, $ruleValidate, $validateCode;
+  if ($isData && $rDef.$data) {
+    $validateCode = 'keywordValidate' + $lvl;
+    var $validateSchema = $rDef.validateSchema;
+    out += ' var ' + ($definition) + ' = RULES.custom[\'' + ($keyword) + '\'].definition; var ' + ($validateCode) + ' = ' + ($definition) + '.validate;';
+  } else {
+    $ruleValidate = it.useCustomRule($rule, $schema, it.schema, it);
+    if (!$ruleValidate) return;
+    $schemaValue = 'validate.schema' + $schemaPath;
+    $validateCode = $ruleValidate.code;
+    $compile = $rDef.compile;
+    $inline = $rDef.inline;
+    $macro = $rDef.macro;
+  }
+  var $ruleErrs = $validateCode + '.errors',
+    $i = 'i' + $lvl,
+    $ruleErr = 'ruleErr' + $lvl,
+    $asyncKeyword = $rDef.async;
+  if ($asyncKeyword && !it.async) throw new Error('async keyword in sync schema');
+  if (!($inline || $macro)) {
+    out += '' + ($ruleErrs) + ' = null;';
+  }
+  out += 'var ' + ($errs) + ' = errors;var ' + ($valid) + ';';
+  if ($isData && $rDef.$data) {
+    $closingBraces += '}';
+    out += ' if (' + ($schemaValue) + ' === undefined) { ' + ($valid) + ' = true; } else { ';
+    if ($validateSchema) {
+      $closingBraces += '}';
+      out += ' ' + ($valid) + ' = ' + ($definition) + '.validateSchema(' + ($schemaValue) + '); if (' + ($valid) + ') { ';
+    }
+  }
+  if ($inline) {
+    if ($rDef.statements) {
+      out += ' ' + ($ruleValidate.validate) + ' ';
+    } else {
+      out += ' ' + ($valid) + ' = ' + ($ruleValidate.validate) + '; ';
+    }
+  } else if ($macro) {
+    var $it = it.util.copy(it);
+    var $closingBraces = '';
+    $it.level++;
+    var $nextValid = 'valid' + $it.level;
+    $it.schema = $ruleValidate.validate;
+    $it.schemaPath = '';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    var $code = it.validate($it).replace(/validate\.schema/g, $validateCode);
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' ' + ($code);
+  } else {
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = '';
+    out += '  ' + ($validateCode) + '.call( ';
+    if (it.opts.passContext) {
+      out += 'this';
+    } else {
+      out += 'self';
+    }
+    if ($compile || $rDef.schema === false) {
+      out += ' , ' + ($data) + ' ';
+    } else {
+      out += ' , ' + ($schemaValue) + ' , ' + ($data) + ' , validate.schema' + (it.schemaPath) + ' ';
+    }
+    out += ' , (dataPath || \'\')';
+    if (it.errorPath != '""') {
+      out += ' + ' + (it.errorPath);
+    }
+    var $parentData = $dataLvl ? 'data' + (($dataLvl - 1) || '') : 'parentData',
+      $parentDataProperty = $dataLvl ? it.dataPathArr[$dataLvl] : 'parentDataProperty';
+    out += ' , ' + ($parentData) + ' , ' + ($parentDataProperty) + ' , rootData )  ';
+    var def_callRuleValidate = out;
+    out = $$outStack.pop();
+    if ($rDef.errors === false) {
+      out += ' ' + ($valid) + ' = ';
+      if ($asyncKeyword) {
+        out += 'await ';
+      }
+      out += '' + (def_callRuleValidate) + '; ';
+    } else {
+      if ($asyncKeyword) {
+        $ruleErrs = 'customErrors' + $lvl;
+        out += ' var ' + ($ruleErrs) + ' = null; try { ' + ($valid) + ' = await ' + (def_callRuleValidate) + '; } catch (e) { ' + ($valid) + ' = false; if (e instanceof ValidationError) ' + ($ruleErrs) + ' = e.errors; else throw e; } ';
+      } else {
+        out += ' ' + ($ruleErrs) + ' = null; ' + ($valid) + ' = ' + (def_callRuleValidate) + '; ';
+      }
+    }
+  }
+  if ($rDef.modifying) {
+    out += ' if (' + ($parentData) + ') ' + ($data) + ' = ' + ($parentData) + '[' + ($parentDataProperty) + '];';
+  }
+  out += '' + ($closingBraces);
+  if ($rDef.valid) {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  } else {
+    out += ' if ( ';
+    if ($rDef.valid === undefined) {
+      out += ' !';
+      if ($macro) {
+        out += '' + ($nextValid);
+      } else {
+        out += '' + ($valid);
+      }
+    } else {
+      out += ' ' + (!$rDef.valid) + ' ';
+    }
+    out += ') { ';
+    $errorKeyword = $rule.keyword;
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = '';
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ($errorKeyword || 'custom') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { keyword: \'' + ($rule.keyword) + '\' } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should pass "' + ($rule.keyword) + '" keyword validation\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    var def_customError = out;
+    out = $$outStack.pop();
+    if ($inline) {
+      if ($rDef.errors) {
+        if ($rDef.errors != 'full') {
+          out += '  for (var ' + ($i) + '=' + ($errs) + '; ' + ($i) + '<errors; ' + ($i) + '++) { var ' + ($ruleErr) + ' = vErrors[' + ($i) + ']; if (' + ($ruleErr) + '.dataPath === undefined) ' + ($ruleErr) + '.dataPath = (dataPath || \'\') + ' + (it.errorPath) + '; if (' + ($ruleErr) + '.schemaPath === undefined) { ' + ($ruleErr) + '.schemaPath = "' + ($errSchemaPath) + '"; } ';
+          if (it.opts.verbose) {
+            out += ' ' + ($ruleErr) + '.schema = ' + ($schemaValue) + '; ' + ($ruleErr) + '.data = ' + ($data) + '; ';
+          }
+          out += ' } ';
+        }
+      } else {
+        if ($rDef.errors === false) {
+          out += ' ' + (def_customError) + ' ';
+        } else {
+          out += ' if (' + ($errs) + ' == errors) { ' + (def_customError) + ' } else {  for (var ' + ($i) + '=' + ($errs) + '; ' + ($i) + '<errors; ' + ($i) + '++) { var ' + ($ruleErr) + ' = vErrors[' + ($i) + ']; if (' + ($ruleErr) + '.dataPath === undefined) ' + ($ruleErr) + '.dataPath = (dataPath || \'\') + ' + (it.errorPath) + '; if (' + ($ruleErr) + '.schemaPath === undefined) { ' + ($ruleErr) + '.schemaPath = "' + ($errSchemaPath) + '"; } ';
+          if (it.opts.verbose) {
+            out += ' ' + ($ruleErr) + '.schema = ' + ($schemaValue) + '; ' + ($ruleErr) + '.data = ' + ($data) + '; ';
+          }
+          out += ' } } ';
+        }
+      }
+    } else if ($macro) {
+      out += '   var err =   '; /* istanbul ignore else */
+      if (it.createErrors !== false) {
+        out += ' { keyword: \'' + ($errorKeyword || 'custom') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { keyword: \'' + ($rule.keyword) + '\' } ';
+        if (it.opts.messages !== false) {
+          out += ' , message: \'should pass "' + ($rule.keyword) + '" keyword validation\' ';
+        }
+        if (it.opts.verbose) {
+          out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+        }
+        out += ' } ';
+      } else {
+        out += ' {} ';
+      }
+      out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+      if (!it.compositeRule && $breakOnError) {
+        /* istanbul ignore if */
+        if (it.async) {
+          out += ' throw new ValidationError(vErrors); ';
+        } else {
+          out += ' validate.errors = vErrors; return false; ';
+        }
+      }
+    } else {
+      if ($rDef.errors === false) {
+        out += ' ' + (def_customError) + ' ';
+      } else {
+        out += ' if (Array.isArray(' + ($ruleErrs) + ')) { if (vErrors === null) vErrors = ' + ($ruleErrs) + '; else vErrors = vErrors.concat(' + ($ruleErrs) + '); errors = vErrors.length;  for (var ' + ($i) + '=' + ($errs) + '; ' + ($i) + '<errors; ' + ($i) + '++) { var ' + ($ruleErr) + ' = vErrors[' + ($i) + ']; if (' + ($ruleErr) + '.dataPath === undefined) ' + ($ruleErr) + '.dataPath = (dataPath || \'\') + ' + (it.errorPath) + ';  ' + ($ruleErr) + '.schemaPath = "' + ($errSchemaPath) + '";  ';
+        if (it.opts.verbose) {
+          out += ' ' + ($ruleErr) + '.schema = ' + ($schemaValue) + '; ' + ($ruleErr) + '.data = ' + ($data) + '; ';
+        }
+        out += ' } } else { ' + (def_customError) + ' } ';
+      }
+    }
+    out += ' } ';
+    if ($breakOnError) {
+      out += ' else { ';
+    }
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/dependencies.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/dependencies.js
new file mode 100644
index 0000000..e482949
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/dependencies.js
@@ -0,0 +1,168 @@
+'use strict';
+module.exports = function generate_dependencies(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $schemaDeps = {},
+    $propertyDeps = {},
+    $ownProperties = it.opts.ownProperties;
+  for ($property in $schema) {
+    if ($property == '__proto__') continue;
+    var $sch = $schema[$property];
+    var $deps = Array.isArray($sch) ? $propertyDeps : $schemaDeps;
+    $deps[$property] = $sch;
+  }
+  out += 'var ' + ($errs) + ' = errors;';
+  var $currentErrorPath = it.errorPath;
+  out += 'var missing' + ($lvl) + ';';
+  for (var $property in $propertyDeps) {
+    $deps = $propertyDeps[$property];
+    if ($deps.length) {
+      out += ' if ( ' + ($data) + (it.util.getProperty($property)) + ' !== undefined ';
+      if ($ownProperties) {
+        out += ' && Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($property)) + '\') ';
+      }
+      if ($breakOnError) {
+        out += ' && ( ';
+        var arr1 = $deps;
+        if (arr1) {
+          var $propertyKey, $i = -1,
+            l1 = arr1.length - 1;
+          while ($i < l1) {
+            $propertyKey = arr1[$i += 1];
+            if ($i) {
+              out += ' || ';
+            }
+            var $prop = it.util.getProperty($propertyKey),
+              $useData = $data + $prop;
+            out += ' ( ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') && (missing' + ($lvl) + ' = ' + (it.util.toQuotedString(it.opts.jsonPointers ? $propertyKey : $prop)) + ') ) ';
+          }
+        }
+        out += ')) {  ';
+        var $propertyPath = 'missing' + $lvl,
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.opts.jsonPointers ? it.util.getPathExpr($currentErrorPath, $propertyPath, true) : $currentErrorPath + ' + ' + $propertyPath;
+        }
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('dependencies') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { property: \'' + (it.util.escapeQuotes($property)) + '\', missingProperty: \'' + ($missingProperty) + '\', depsCount: ' + ($deps.length) + ', deps: \'' + (it.util.escapeQuotes($deps.length == 1 ? $deps[0] : $deps.join(", "))) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'should have ';
+            if ($deps.length == 1) {
+              out += 'property ' + (it.util.escapeQuotes($deps[0]));
+            } else {
+              out += 'properties ' + (it.util.escapeQuotes($deps.join(", ")));
+            }
+            out += ' when property ' + (it.util.escapeQuotes($property)) + ' is present\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+      } else {
+        out += ' ) { ';
+        var arr2 = $deps;
+        if (arr2) {
+          var $propertyKey, i2 = -1,
+            l2 = arr2.length - 1;
+          while (i2 < l2) {
+            $propertyKey = arr2[i2 += 1];
+            var $prop = it.util.getProperty($propertyKey),
+              $missingProperty = it.util.escapeQuotes($propertyKey),
+              $useData = $data + $prop;
+            if (it.opts._errorDataPathProperty) {
+              it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+            }
+            out += ' if ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') {  var err =   '; /* istanbul ignore else */
+            if (it.createErrors !== false) {
+              out += ' { keyword: \'' + ('dependencies') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { property: \'' + (it.util.escapeQuotes($property)) + '\', missingProperty: \'' + ($missingProperty) + '\', depsCount: ' + ($deps.length) + ', deps: \'' + (it.util.escapeQuotes($deps.length == 1 ? $deps[0] : $deps.join(", "))) + '\' } ';
+              if (it.opts.messages !== false) {
+                out += ' , message: \'should have ';
+                if ($deps.length == 1) {
+                  out += 'property ' + (it.util.escapeQuotes($deps[0]));
+                } else {
+                  out += 'properties ' + (it.util.escapeQuotes($deps.join(", ")));
+                }
+                out += ' when property ' + (it.util.escapeQuotes($property)) + ' is present\' ';
+              }
+              if (it.opts.verbose) {
+                out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+              }
+              out += ' } ';
+            } else {
+              out += ' {} ';
+            }
+            out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } ';
+          }
+        }
+      }
+      out += ' }   ';
+      if ($breakOnError) {
+        $closingBraces += '}';
+        out += ' else { ';
+      }
+    }
+  }
+  it.errorPath = $currentErrorPath;
+  var $currentBaseId = $it.baseId;
+  for (var $property in $schemaDeps) {
+    var $sch = $schemaDeps[$property];
+    if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+      out += ' ' + ($nextValid) + ' = true; if ( ' + ($data) + (it.util.getProperty($property)) + ' !== undefined ';
+      if ($ownProperties) {
+        out += ' && Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($property)) + '\') ';
+      }
+      out += ') { ';
+      $it.schema = $sch;
+      $it.schemaPath = $schemaPath + it.util.getProperty($property);
+      $it.errSchemaPath = $errSchemaPath + '/' + it.util.escapeFragment($property);
+      out += '  ' + (it.validate($it)) + ' ';
+      $it.baseId = $currentBaseId;
+      out += ' }  ';
+      if ($breakOnError) {
+        out += ' if (' + ($nextValid) + ') { ';
+        $closingBraces += '}';
+      }
+    }
+  }
+  if ($breakOnError) {
+    out += '   ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/enum.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/enum.js
new file mode 100644
index 0000000..90580b9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/enum.js
@@ -0,0 +1,66 @@
+'use strict';
+module.exports = function generate_enum(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $i = 'i' + $lvl,
+    $vSchema = 'schema' + $lvl;
+  if (!$isData) {
+    out += ' var ' + ($vSchema) + ' = validate.schema' + ($schemaPath) + ';';
+  }
+  out += 'var ' + ($valid) + ';';
+  if ($isData) {
+    out += ' if (schema' + ($lvl) + ' === undefined) ' + ($valid) + ' = true; else if (!Array.isArray(schema' + ($lvl) + ')) ' + ($valid) + ' = false; else {';
+  }
+  out += '' + ($valid) + ' = false;for (var ' + ($i) + '=0; ' + ($i) + '<' + ($vSchema) + '.length; ' + ($i) + '++) if (equal(' + ($data) + ', ' + ($vSchema) + '[' + ($i) + '])) { ' + ($valid) + ' = true; break; }';
+  if ($isData) {
+    out += '  }  ';
+  }
+  out += ' if (!' + ($valid) + ') {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('enum') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { allowedValues: schema' + ($lvl) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be equal to one of the allowed values\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' }';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/format.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/format.js
new file mode 100644
index 0000000..cd9a569
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/format.js
@@ -0,0 +1,150 @@
+'use strict';
+module.exports = function generate_format(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  if (it.opts.format === false) {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+    return out;
+  }
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $unknownFormats = it.opts.unknownFormats,
+    $allowUnknown = Array.isArray($unknownFormats);
+  if ($isData) {
+    var $format = 'format' + $lvl,
+      $isObject = 'isObject' + $lvl,
+      $formatType = 'formatType' + $lvl;
+    out += ' var ' + ($format) + ' = formats[' + ($schemaValue) + ']; var ' + ($isObject) + ' = typeof ' + ($format) + ' == \'object\' && !(' + ($format) + ' instanceof RegExp) && ' + ($format) + '.validate; var ' + ($formatType) + ' = ' + ($isObject) + ' && ' + ($format) + '.type || \'string\'; if (' + ($isObject) + ') { ';
+    if (it.async) {
+      out += ' var async' + ($lvl) + ' = ' + ($format) + '.async; ';
+    }
+    out += ' ' + ($format) + ' = ' + ($format) + '.validate; } if (  ';
+    if ($isData) {
+      out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'string\') || ';
+    }
+    out += ' (';
+    if ($unknownFormats != 'ignore') {
+      out += ' (' + ($schemaValue) + ' && !' + ($format) + ' ';
+      if ($allowUnknown) {
+        out += ' && self._opts.unknownFormats.indexOf(' + ($schemaValue) + ') == -1 ';
+      }
+      out += ') || ';
+    }
+    out += ' (' + ($format) + ' && ' + ($formatType) + ' == \'' + ($ruleType) + '\' && !(typeof ' + ($format) + ' == \'function\' ? ';
+    if (it.async) {
+      out += ' (async' + ($lvl) + ' ? await ' + ($format) + '(' + ($data) + ') : ' + ($format) + '(' + ($data) + ')) ';
+    } else {
+      out += ' ' + ($format) + '(' + ($data) + ') ';
+    }
+    out += ' : ' + ($format) + '.test(' + ($data) + '))))) {';
+  } else {
+    var $format = it.formats[$schema];
+    if (!$format) {
+      if ($unknownFormats == 'ignore') {
+        it.logger.warn('unknown format "' + $schema + '" ignored in schema at path "' + it.errSchemaPath + '"');
+        if ($breakOnError) {
+          out += ' if (true) { ';
+        }
+        return out;
+      } else if ($allowUnknown && $unknownFormats.indexOf($schema) >= 0) {
+        if ($breakOnError) {
+          out += ' if (true) { ';
+        }
+        return out;
+      } else {
+        throw new Error('unknown format "' + $schema + '" is used in schema at path "' + it.errSchemaPath + '"');
+      }
+    }
+    var $isObject = typeof $format == 'object' && !($format instanceof RegExp) && $format.validate;
+    var $formatType = $isObject && $format.type || 'string';
+    if ($isObject) {
+      var $async = $format.async === true;
+      $format = $format.validate;
+    }
+    if ($formatType != $ruleType) {
+      if ($breakOnError) {
+        out += ' if (true) { ';
+      }
+      return out;
+    }
+    if ($async) {
+      if (!it.async) throw new Error('async format in sync schema');
+      var $formatRef = 'formats' + it.util.getProperty($schema) + '.validate';
+      out += ' if (!(await ' + ($formatRef) + '(' + ($data) + '))) { ';
+    } else {
+      out += ' if (! ';
+      var $formatRef = 'formats' + it.util.getProperty($schema);
+      if ($isObject) $formatRef += '.validate';
+      if (typeof $format == 'function') {
+        out += ' ' + ($formatRef) + '(' + ($data) + ') ';
+      } else {
+        out += ' ' + ($formatRef) + '.test(' + ($data) + ') ';
+      }
+      out += ') { ';
+    }
+  }
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('format') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { format:  ';
+    if ($isData) {
+      out += '' + ($schemaValue);
+    } else {
+      out += '' + (it.util.toQuotedString($schema));
+    }
+    out += '  } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should match format "';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + (it.util.escapeQuotes($schema));
+      }
+      out += '"\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + (it.util.toQuotedString($schema));
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += ' } ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/if.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/if.js
new file mode 100644
index 0000000..94d27ad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/if.js
@@ -0,0 +1,103 @@
+'use strict';
+module.exports = function generate_if(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $thenSch = it.schema['then'],
+    $elseSch = it.schema['else'],
+    $thenPresent = $thenSch !== undefined && (it.opts.strictKeywords ? (typeof $thenSch == 'object' && Object.keys($thenSch).length > 0) || $thenSch === false : it.util.schemaHasRules($thenSch, it.RULES.all)),
+    $elsePresent = $elseSch !== undefined && (it.opts.strictKeywords ? (typeof $elseSch == 'object' && Object.keys($elseSch).length > 0) || $elseSch === false : it.util.schemaHasRules($elseSch, it.RULES.all)),
+    $currentBaseId = $it.baseId;
+  if ($thenPresent || $elsePresent) {
+    var $ifClause;
+    $it.createErrors = false;
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += ' var ' + ($errs) + ' = errors; var ' + ($valid) + ' = true;  ';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    out += '  ' + (it.validate($it)) + ' ';
+    $it.baseId = $currentBaseId;
+    $it.createErrors = true;
+    out += '  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; }  ';
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    if ($thenPresent) {
+      out += ' if (' + ($nextValid) + ') {  ';
+      $it.schema = it.schema['then'];
+      $it.schemaPath = it.schemaPath + '.then';
+      $it.errSchemaPath = it.errSchemaPath + '/then';
+      out += '  ' + (it.validate($it)) + ' ';
+      $it.baseId = $currentBaseId;
+      out += ' ' + ($valid) + ' = ' + ($nextValid) + '; ';
+      if ($thenPresent && $elsePresent) {
+        $ifClause = 'ifClause' + $lvl;
+        out += ' var ' + ($ifClause) + ' = \'then\'; ';
+      } else {
+        $ifClause = '\'then\'';
+      }
+      out += ' } ';
+      if ($elsePresent) {
+        out += ' else { ';
+      }
+    } else {
+      out += ' if (!' + ($nextValid) + ') { ';
+    }
+    if ($elsePresent) {
+      $it.schema = it.schema['else'];
+      $it.schemaPath = it.schemaPath + '.else';
+      $it.errSchemaPath = it.errSchemaPath + '/else';
+      out += '  ' + (it.validate($it)) + ' ';
+      $it.baseId = $currentBaseId;
+      out += ' ' + ($valid) + ' = ' + ($nextValid) + '; ';
+      if ($thenPresent && $elsePresent) {
+        $ifClause = 'ifClause' + $lvl;
+        out += ' var ' + ($ifClause) + ' = \'else\'; ';
+      } else {
+        $ifClause = '\'else\'';
+      }
+      out += ' } ';
+    }
+    out += ' if (!' + ($valid) + ') {   var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('if') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { failingKeyword: ' + ($ifClause) + ' } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should match "\' + ' + ($ifClause) + ' + \'" schema\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError(vErrors); ';
+      } else {
+        out += ' validate.errors = vErrors; return false; ';
+      }
+    }
+    out += ' }   ';
+    if ($breakOnError) {
+      out += ' else { ';
+    }
+  } else {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/index.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/index.js
new file mode 100644
index 0000000..2fb1b00
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/index.js
@@ -0,0 +1,33 @@
+'use strict';
+
+//all requires must be explicit because browserify won't work with dynamic requires
+module.exports = {
+  '$ref': require('./ref'),
+  allOf: require('./allOf'),
+  anyOf: require('./anyOf'),
+  '$comment': require('./comment'),
+  const: require('./const'),
+  contains: require('./contains'),
+  dependencies: require('./dependencies'),
+  'enum': require('./enum'),
+  format: require('./format'),
+  'if': require('./if'),
+  items: require('./items'),
+  maximum: require('./_limit'),
+  minimum: require('./_limit'),
+  maxItems: require('./_limitItems'),
+  minItems: require('./_limitItems'),
+  maxLength: require('./_limitLength'),
+  minLength: require('./_limitLength'),
+  maxProperties: require('./_limitProperties'),
+  minProperties: require('./_limitProperties'),
+  multipleOf: require('./multipleOf'),
+  not: require('./not'),
+  oneOf: require('./oneOf'),
+  pattern: require('./pattern'),
+  properties: require('./properties'),
+  propertyNames: require('./propertyNames'),
+  required: require('./required'),
+  uniqueItems: require('./uniqueItems'),
+  validate: require('./validate')
+};
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/items.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/items.js
new file mode 100644
index 0000000..bee5d67
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/items.js
@@ -0,0 +1,140 @@
+'use strict';
+module.exports = function generate_items(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $idx = 'i' + $lvl,
+    $dataNxt = $it.dataLevel = it.dataLevel + 1,
+    $nextData = 'data' + $dataNxt,
+    $currentBaseId = it.baseId;
+  out += 'var ' + ($errs) + ' = errors;var ' + ($valid) + ';';
+  if (Array.isArray($schema)) {
+    var $additionalItems = it.schema.additionalItems;
+    if ($additionalItems === false) {
+      out += ' ' + ($valid) + ' = ' + ($data) + '.length <= ' + ($schema.length) + '; ';
+      var $currErrSchemaPath = $errSchemaPath;
+      $errSchemaPath = it.errSchemaPath + '/additionalItems';
+      out += '  if (!' + ($valid) + ') {   ';
+      var $$outStack = $$outStack || [];
+      $$outStack.push(out);
+      out = ''; /* istanbul ignore else */
+      if (it.createErrors !== false) {
+        out += ' { keyword: \'' + ('additionalItems') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { limit: ' + ($schema.length) + ' } ';
+        if (it.opts.messages !== false) {
+          out += ' , message: \'should NOT have more than ' + ($schema.length) + ' items\' ';
+        }
+        if (it.opts.verbose) {
+          out += ' , schema: false , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+        }
+        out += ' } ';
+      } else {
+        out += ' {} ';
+      }
+      var __err = out;
+      out = $$outStack.pop();
+      if (!it.compositeRule && $breakOnError) {
+        /* istanbul ignore if */
+        if (it.async) {
+          out += ' throw new ValidationError([' + (__err) + ']); ';
+        } else {
+          out += ' validate.errors = [' + (__err) + ']; return false; ';
+        }
+      } else {
+        out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+      }
+      out += ' } ';
+      $errSchemaPath = $currErrSchemaPath;
+      if ($breakOnError) {
+        $closingBraces += '}';
+        out += ' else { ';
+      }
+    }
+    var arr1 = $schema;
+    if (arr1) {
+      var $sch, $i = -1,
+        l1 = arr1.length - 1;
+      while ($i < l1) {
+        $sch = arr1[$i += 1];
+        if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+          out += ' ' + ($nextValid) + ' = true; if (' + ($data) + '.length > ' + ($i) + ') { ';
+          var $passData = $data + '[' + $i + ']';
+          $it.schema = $sch;
+          $it.schemaPath = $schemaPath + '[' + $i + ']';
+          $it.errSchemaPath = $errSchemaPath + '/' + $i;
+          $it.errorPath = it.util.getPathExpr(it.errorPath, $i, it.opts.jsonPointers, true);
+          $it.dataPathArr[$dataNxt] = $i;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          out += ' }  ';
+          if ($breakOnError) {
+            out += ' if (' + ($nextValid) + ') { ';
+            $closingBraces += '}';
+          }
+        }
+      }
+    }
+    if (typeof $additionalItems == 'object' && (it.opts.strictKeywords ? (typeof $additionalItems == 'object' && Object.keys($additionalItems).length > 0) || $additionalItems === false : it.util.schemaHasRules($additionalItems, it.RULES.all))) {
+      $it.schema = $additionalItems;
+      $it.schemaPath = it.schemaPath + '.additionalItems';
+      $it.errSchemaPath = it.errSchemaPath + '/additionalItems';
+      out += ' ' + ($nextValid) + ' = true; if (' + ($data) + '.length > ' + ($schema.length) + ') {  for (var ' + ($idx) + ' = ' + ($schema.length) + '; ' + ($idx) + ' < ' + ($data) + '.length; ' + ($idx) + '++) { ';
+      $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+      var $passData = $data + '[' + $idx + ']';
+      $it.dataPathArr[$dataNxt] = $idx;
+      var $code = it.validate($it);
+      $it.baseId = $currentBaseId;
+      if (it.util.varOccurences($code, $nextData) < 2) {
+        out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+      } else {
+        out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+      }
+      if ($breakOnError) {
+        out += ' if (!' + ($nextValid) + ') break; ';
+      }
+      out += ' } }  ';
+      if ($breakOnError) {
+        out += ' if (' + ($nextValid) + ') { ';
+        $closingBraces += '}';
+      }
+    }
+  } else if ((it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all))) {
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += '  for (var ' + ($idx) + ' = ' + (0) + '; ' + ($idx) + ' < ' + ($data) + '.length; ' + ($idx) + '++) { ';
+    $it.errorPath = it.util.getPathExpr(it.errorPath, $idx, it.opts.jsonPointers, true);
+    var $passData = $data + '[' + $idx + ']';
+    $it.dataPathArr[$dataNxt] = $idx;
+    var $code = it.validate($it);
+    $it.baseId = $currentBaseId;
+    if (it.util.varOccurences($code, $nextData) < 2) {
+      out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+    } else {
+      out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+    }
+    if ($breakOnError) {
+      out += ' if (!' + ($nextValid) + ') break; ';
+    }
+    out += ' }';
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/multipleOf.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/multipleOf.js
new file mode 100644
index 0000000..9d6401b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/multipleOf.js
@@ -0,0 +1,80 @@
+'use strict';
+module.exports = function generate_multipleOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (!($isData || typeof $schema == 'number')) {
+    throw new Error($keyword + ' must be number');
+  }
+  out += 'var division' + ($lvl) + ';if (';
+  if ($isData) {
+    out += ' ' + ($schemaValue) + ' !== undefined && ( typeof ' + ($schemaValue) + ' != \'number\' || ';
+  }
+  out += ' (division' + ($lvl) + ' = ' + ($data) + ' / ' + ($schemaValue) + ', ';
+  if (it.opts.multipleOfPrecision) {
+    out += ' Math.abs(Math.round(division' + ($lvl) + ') - division' + ($lvl) + ') > 1e-' + (it.opts.multipleOfPrecision) + ' ';
+  } else {
+    out += ' division' + ($lvl) + ' !== parseInt(division' + ($lvl) + ') ';
+  }
+  out += ' ) ';
+  if ($isData) {
+    out += '  )  ';
+  }
+  out += ' ) {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('multipleOf') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { multipleOf: ' + ($schemaValue) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should be multiple of ';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue);
+      } else {
+        out += '' + ($schemaValue) + '\'';
+      }
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + ($schema);
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/not.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/not.js
new file mode 100644
index 0000000..f50c937
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/not.js
@@ -0,0 +1,84 @@
+'use strict';
+module.exports = function generate_not(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  if ((it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all))) {
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    out += ' var ' + ($errs) + ' = errors;  ';
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    $it.createErrors = false;
+    var $allErrorsOption;
+    if ($it.opts.allErrors) {
+      $allErrorsOption = $it.opts.allErrors;
+      $it.opts.allErrors = false;
+    }
+    out += ' ' + (it.validate($it)) + ' ';
+    $it.createErrors = true;
+    if ($allErrorsOption) $it.opts.allErrors = $allErrorsOption;
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' if (' + ($nextValid) + ') {   ';
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('not') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should NOT be valid\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    out += ' } else {  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; } ';
+    if (it.opts.allErrors) {
+      out += ' } ';
+    }
+  } else {
+    out += '  var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('not') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should NOT be valid\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if ($breakOnError) {
+      out += ' if (false) { ';
+    }
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/oneOf.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/oneOf.js
new file mode 100644
index 0000000..dfe2fd5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/oneOf.js
@@ -0,0 +1,73 @@
+'use strict';
+module.exports = function generate_oneOf(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $currentBaseId = $it.baseId,
+    $prevValid = 'prevValid' + $lvl,
+    $passingSchemas = 'passingSchemas' + $lvl;
+  out += 'var ' + ($errs) + ' = errors , ' + ($prevValid) + ' = false , ' + ($valid) + ' = false , ' + ($passingSchemas) + ' = null; ';
+  var $wasComposite = it.compositeRule;
+  it.compositeRule = $it.compositeRule = true;
+  var arr1 = $schema;
+  if (arr1) {
+    var $sch, $i = -1,
+      l1 = arr1.length - 1;
+    while ($i < l1) {
+      $sch = arr1[$i += 1];
+      if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+        $it.schema = $sch;
+        $it.schemaPath = $schemaPath + '[' + $i + ']';
+        $it.errSchemaPath = $errSchemaPath + '/' + $i;
+        out += '  ' + (it.validate($it)) + ' ';
+        $it.baseId = $currentBaseId;
+      } else {
+        out += ' var ' + ($nextValid) + ' = true; ';
+      }
+      if ($i) {
+        out += ' if (' + ($nextValid) + ' && ' + ($prevValid) + ') { ' + ($valid) + ' = false; ' + ($passingSchemas) + ' = [' + ($passingSchemas) + ', ' + ($i) + ']; } else { ';
+        $closingBraces += '}';
+      }
+      out += ' if (' + ($nextValid) + ') { ' + ($valid) + ' = ' + ($prevValid) + ' = true; ' + ($passingSchemas) + ' = ' + ($i) + '; }';
+    }
+  }
+  it.compositeRule = $it.compositeRule = $wasComposite;
+  out += '' + ($closingBraces) + 'if (!' + ($valid) + ') {   var err =   '; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('oneOf') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { passingSchemas: ' + ($passingSchemas) + ' } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should match exactly one schema in oneOf\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError(vErrors); ';
+    } else {
+      out += ' validate.errors = vErrors; return false; ';
+    }
+  }
+  out += '} else {  errors = ' + ($errs) + '; if (vErrors !== null) { if (' + ($errs) + ') vErrors.length = ' + ($errs) + '; else vErrors = null; }';
+  if (it.opts.allErrors) {
+    out += ' } ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/pattern.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/pattern.js
new file mode 100644
index 0000000..1d74d6b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/pattern.js
@@ -0,0 +1,75 @@
+'use strict';
+module.exports = function generate_pattern(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $regexp = $isData ? '(new RegExp(' + $schemaValue + '))' : it.usePattern($schema);
+  out += 'if ( ';
+  if ($isData) {
+    out += ' (' + ($schemaValue) + ' !== undefined && typeof ' + ($schemaValue) + ' != \'string\') || ';
+  }
+  out += ' !' + ($regexp) + '.test(' + ($data) + ') ) {   ';
+  var $$outStack = $$outStack || [];
+  $$outStack.push(out);
+  out = ''; /* istanbul ignore else */
+  if (it.createErrors !== false) {
+    out += ' { keyword: \'' + ('pattern') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { pattern:  ';
+    if ($isData) {
+      out += '' + ($schemaValue);
+    } else {
+      out += '' + (it.util.toQuotedString($schema));
+    }
+    out += '  } ';
+    if (it.opts.messages !== false) {
+      out += ' , message: \'should match pattern "';
+      if ($isData) {
+        out += '\' + ' + ($schemaValue) + ' + \'';
+      } else {
+        out += '' + (it.util.escapeQuotes($schema));
+      }
+      out += '"\' ';
+    }
+    if (it.opts.verbose) {
+      out += ' , schema:  ';
+      if ($isData) {
+        out += 'validate.schema' + ($schemaPath);
+      } else {
+        out += '' + (it.util.toQuotedString($schema));
+      }
+      out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+    }
+    out += ' } ';
+  } else {
+    out += ' {} ';
+  }
+  var __err = out;
+  out = $$outStack.pop();
+  if (!it.compositeRule && $breakOnError) {
+    /* istanbul ignore if */
+    if (it.async) {
+      out += ' throw new ValidationError([' + (__err) + ']); ';
+    } else {
+      out += ' validate.errors = [' + (__err) + ']; return false; ';
+    }
+  } else {
+    out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+  }
+  out += '} ';
+  if ($breakOnError) {
+    out += ' else { ';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/properties.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/properties.js
new file mode 100644
index 0000000..bc5ee55
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/properties.js
@@ -0,0 +1,335 @@
+'use strict';
+module.exports = function generate_properties(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  var $key = 'key' + $lvl,
+    $idx = 'idx' + $lvl,
+    $dataNxt = $it.dataLevel = it.dataLevel + 1,
+    $nextData = 'data' + $dataNxt,
+    $dataProperties = 'dataProperties' + $lvl;
+  var $schemaKeys = Object.keys($schema || {}).filter(notProto),
+    $pProperties = it.schema.patternProperties || {},
+    $pPropertyKeys = Object.keys($pProperties).filter(notProto),
+    $aProperties = it.schema.additionalProperties,
+    $someProperties = $schemaKeys.length || $pPropertyKeys.length,
+    $noAdditional = $aProperties === false,
+    $additionalIsSchema = typeof $aProperties == 'object' && Object.keys($aProperties).length,
+    $removeAdditional = it.opts.removeAdditional,
+    $checkAdditional = $noAdditional || $additionalIsSchema || $removeAdditional,
+    $ownProperties = it.opts.ownProperties,
+    $currentBaseId = it.baseId;
+  var $required = it.schema.required;
+  if ($required && !(it.opts.$data && $required.$data) && $required.length < it.opts.loopRequired) {
+    var $requiredHash = it.util.toHash($required);
+  }
+
+  function notProto(p) {
+    return p !== '__proto__';
+  }
+  out += 'var ' + ($errs) + ' = errors;var ' + ($nextValid) + ' = true;';
+  if ($ownProperties) {
+    out += ' var ' + ($dataProperties) + ' = undefined;';
+  }
+  if ($checkAdditional) {
+    if ($ownProperties) {
+      out += ' ' + ($dataProperties) + ' = ' + ($dataProperties) + ' || Object.keys(' + ($data) + '); for (var ' + ($idx) + '=0; ' + ($idx) + '<' + ($dataProperties) + '.length; ' + ($idx) + '++) { var ' + ($key) + ' = ' + ($dataProperties) + '[' + ($idx) + ']; ';
+    } else {
+      out += ' for (var ' + ($key) + ' in ' + ($data) + ') { ';
+    }
+    if ($someProperties) {
+      out += ' var isAdditional' + ($lvl) + ' = !(false ';
+      if ($schemaKeys.length) {
+        if ($schemaKeys.length > 8) {
+          out += ' || validate.schema' + ($schemaPath) + '.hasOwnProperty(' + ($key) + ') ';
+        } else {
+          var arr1 = $schemaKeys;
+          if (arr1) {
+            var $propertyKey, i1 = -1,
+              l1 = arr1.length - 1;
+            while (i1 < l1) {
+              $propertyKey = arr1[i1 += 1];
+              out += ' || ' + ($key) + ' == ' + (it.util.toQuotedString($propertyKey)) + ' ';
+            }
+          }
+        }
+      }
+      if ($pPropertyKeys.length) {
+        var arr2 = $pPropertyKeys;
+        if (arr2) {
+          var $pProperty, $i = -1,
+            l2 = arr2.length - 1;
+          while ($i < l2) {
+            $pProperty = arr2[$i += 1];
+            out += ' || ' + (it.usePattern($pProperty)) + '.test(' + ($key) + ') ';
+          }
+        }
+      }
+      out += ' ); if (isAdditional' + ($lvl) + ') { ';
+    }
+    if ($removeAdditional == 'all') {
+      out += ' delete ' + ($data) + '[' + ($key) + ']; ';
+    } else {
+      var $currentErrorPath = it.errorPath;
+      var $additionalProperty = '\' + ' + $key + ' + \'';
+      if (it.opts._errorDataPathProperty) {
+        it.errorPath = it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+      }
+      if ($noAdditional) {
+        if ($removeAdditional) {
+          out += ' delete ' + ($data) + '[' + ($key) + ']; ';
+        } else {
+          out += ' ' + ($nextValid) + ' = false; ';
+          var $currErrSchemaPath = $errSchemaPath;
+          $errSchemaPath = it.errSchemaPath + '/additionalProperties';
+          var $$outStack = $$outStack || [];
+          $$outStack.push(out);
+          out = ''; /* istanbul ignore else */
+          if (it.createErrors !== false) {
+            out += ' { keyword: \'' + ('additionalProperties') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { additionalProperty: \'' + ($additionalProperty) + '\' } ';
+            if (it.opts.messages !== false) {
+              out += ' , message: \'';
+              if (it.opts._errorDataPathProperty) {
+                out += 'is an invalid additional property';
+              } else {
+                out += 'should NOT have additional properties';
+              }
+              out += '\' ';
+            }
+            if (it.opts.verbose) {
+              out += ' , schema: false , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+            }
+            out += ' } ';
+          } else {
+            out += ' {} ';
+          }
+          var __err = out;
+          out = $$outStack.pop();
+          if (!it.compositeRule && $breakOnError) {
+            /* istanbul ignore if */
+            if (it.async) {
+              out += ' throw new ValidationError([' + (__err) + ']); ';
+            } else {
+              out += ' validate.errors = [' + (__err) + ']; return false; ';
+            }
+          } else {
+            out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+          }
+          $errSchemaPath = $currErrSchemaPath;
+          if ($breakOnError) {
+            out += ' break; ';
+          }
+        }
+      } else if ($additionalIsSchema) {
+        if ($removeAdditional == 'failing') {
+          out += ' var ' + ($errs) + ' = errors;  ';
+          var $wasComposite = it.compositeRule;
+          it.compositeRule = $it.compositeRule = true;
+          $it.schema = $aProperties;
+          $it.schemaPath = it.schemaPath + '.additionalProperties';
+          $it.errSchemaPath = it.errSchemaPath + '/additionalProperties';
+          $it.errorPath = it.opts._errorDataPathProperty ? it.errorPath : it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+          var $passData = $data + '[' + $key + ']';
+          $it.dataPathArr[$dataNxt] = $key;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          out += ' if (!' + ($nextValid) + ') { errors = ' + ($errs) + '; if (validate.errors !== null) { if (errors) validate.errors.length = errors; else validate.errors = null; } delete ' + ($data) + '[' + ($key) + ']; }  ';
+          it.compositeRule = $it.compositeRule = $wasComposite;
+        } else {
+          $it.schema = $aProperties;
+          $it.schemaPath = it.schemaPath + '.additionalProperties';
+          $it.errSchemaPath = it.errSchemaPath + '/additionalProperties';
+          $it.errorPath = it.opts._errorDataPathProperty ? it.errorPath : it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+          var $passData = $data + '[' + $key + ']';
+          $it.dataPathArr[$dataNxt] = $key;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          if ($breakOnError) {
+            out += ' if (!' + ($nextValid) + ') break; ';
+          }
+        }
+      }
+      it.errorPath = $currentErrorPath;
+    }
+    if ($someProperties) {
+      out += ' } ';
+    }
+    out += ' }  ';
+    if ($breakOnError) {
+      out += ' if (' + ($nextValid) + ') { ';
+      $closingBraces += '}';
+    }
+  }
+  var $useDefaults = it.opts.useDefaults && !it.compositeRule;
+  if ($schemaKeys.length) {
+    var arr3 = $schemaKeys;
+    if (arr3) {
+      var $propertyKey, i3 = -1,
+        l3 = arr3.length - 1;
+      while (i3 < l3) {
+        $propertyKey = arr3[i3 += 1];
+        var $sch = $schema[$propertyKey];
+        if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+          var $prop = it.util.getProperty($propertyKey),
+            $passData = $data + $prop,
+            $hasDefault = $useDefaults && $sch.default !== undefined;
+          $it.schema = $sch;
+          $it.schemaPath = $schemaPath + $prop;
+          $it.errSchemaPath = $errSchemaPath + '/' + it.util.escapeFragment($propertyKey);
+          $it.errorPath = it.util.getPath(it.errorPath, $propertyKey, it.opts.jsonPointers);
+          $it.dataPathArr[$dataNxt] = it.util.toQuotedString($propertyKey);
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            $code = it.util.varReplace($code, $nextData, $passData);
+            var $useData = $passData;
+          } else {
+            var $useData = $nextData;
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ';
+          }
+          if ($hasDefault) {
+            out += ' ' + ($code) + ' ';
+          } else {
+            if ($requiredHash && $requiredHash[$propertyKey]) {
+              out += ' if ( ' + ($useData) + ' === undefined ';
+              if ($ownProperties) {
+                out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+              }
+              out += ') { ' + ($nextValid) + ' = false; ';
+              var $currentErrorPath = it.errorPath,
+                $currErrSchemaPath = $errSchemaPath,
+                $missingProperty = it.util.escapeQuotes($propertyKey);
+              if (it.opts._errorDataPathProperty) {
+                it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+              }
+              $errSchemaPath = it.errSchemaPath + '/required';
+              var $$outStack = $$outStack || [];
+              $$outStack.push(out);
+              out = ''; /* istanbul ignore else */
+              if (it.createErrors !== false) {
+                out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+                if (it.opts.messages !== false) {
+                  out += ' , message: \'';
+                  if (it.opts._errorDataPathProperty) {
+                    out += 'is a required property';
+                  } else {
+                    out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+                  }
+                  out += '\' ';
+                }
+                if (it.opts.verbose) {
+                  out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+                }
+                out += ' } ';
+              } else {
+                out += ' {} ';
+              }
+              var __err = out;
+              out = $$outStack.pop();
+              if (!it.compositeRule && $breakOnError) {
+                /* istanbul ignore if */
+                if (it.async) {
+                  out += ' throw new ValidationError([' + (__err) + ']); ';
+                } else {
+                  out += ' validate.errors = [' + (__err) + ']; return false; ';
+                }
+              } else {
+                out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+              }
+              $errSchemaPath = $currErrSchemaPath;
+              it.errorPath = $currentErrorPath;
+              out += ' } else { ';
+            } else {
+              if ($breakOnError) {
+                out += ' if ( ' + ($useData) + ' === undefined ';
+                if ($ownProperties) {
+                  out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+                }
+                out += ') { ' + ($nextValid) + ' = true; } else { ';
+              } else {
+                out += ' if (' + ($useData) + ' !== undefined ';
+                if ($ownProperties) {
+                  out += ' &&   Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+                }
+                out += ' ) { ';
+              }
+            }
+            out += ' ' + ($code) + ' } ';
+          }
+        }
+        if ($breakOnError) {
+          out += ' if (' + ($nextValid) + ') { ';
+          $closingBraces += '}';
+        }
+      }
+    }
+  }
+  if ($pPropertyKeys.length) {
+    var arr4 = $pPropertyKeys;
+    if (arr4) {
+      var $pProperty, i4 = -1,
+        l4 = arr4.length - 1;
+      while (i4 < l4) {
+        $pProperty = arr4[i4 += 1];
+        var $sch = $pProperties[$pProperty];
+        if ((it.opts.strictKeywords ? (typeof $sch == 'object' && Object.keys($sch).length > 0) || $sch === false : it.util.schemaHasRules($sch, it.RULES.all))) {
+          $it.schema = $sch;
+          $it.schemaPath = it.schemaPath + '.patternProperties' + it.util.getProperty($pProperty);
+          $it.errSchemaPath = it.errSchemaPath + '/patternProperties/' + it.util.escapeFragment($pProperty);
+          if ($ownProperties) {
+            out += ' ' + ($dataProperties) + ' = ' + ($dataProperties) + ' || Object.keys(' + ($data) + '); for (var ' + ($idx) + '=0; ' + ($idx) + '<' + ($dataProperties) + '.length; ' + ($idx) + '++) { var ' + ($key) + ' = ' + ($dataProperties) + '[' + ($idx) + ']; ';
+          } else {
+            out += ' for (var ' + ($key) + ' in ' + ($data) + ') { ';
+          }
+          out += ' if (' + (it.usePattern($pProperty)) + '.test(' + ($key) + ')) { ';
+          $it.errorPath = it.util.getPathExpr(it.errorPath, $key, it.opts.jsonPointers);
+          var $passData = $data + '[' + $key + ']';
+          $it.dataPathArr[$dataNxt] = $key;
+          var $code = it.validate($it);
+          $it.baseId = $currentBaseId;
+          if (it.util.varOccurences($code, $nextData) < 2) {
+            out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+          } else {
+            out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+          }
+          if ($breakOnError) {
+            out += ' if (!' + ($nextValid) + ') break; ';
+          }
+          out += ' } ';
+          if ($breakOnError) {
+            out += ' else ' + ($nextValid) + ' = true; ';
+          }
+          out += ' }  ';
+          if ($breakOnError) {
+            out += ' if (' + ($nextValid) + ') { ';
+            $closingBraces += '}';
+          }
+        }
+      }
+    }
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/propertyNames.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/propertyNames.js
new file mode 100644
index 0000000..2a54a08
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/propertyNames.js
@@ -0,0 +1,81 @@
+'use strict';
+module.exports = function generate_propertyNames(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $errs = 'errs__' + $lvl;
+  var $it = it.util.copy(it);
+  var $closingBraces = '';
+  $it.level++;
+  var $nextValid = 'valid' + $it.level;
+  out += 'var ' + ($errs) + ' = errors;';
+  if ((it.opts.strictKeywords ? (typeof $schema == 'object' && Object.keys($schema).length > 0) || $schema === false : it.util.schemaHasRules($schema, it.RULES.all))) {
+    $it.schema = $schema;
+    $it.schemaPath = $schemaPath;
+    $it.errSchemaPath = $errSchemaPath;
+    var $key = 'key' + $lvl,
+      $idx = 'idx' + $lvl,
+      $i = 'i' + $lvl,
+      $invalidName = '\' + ' + $key + ' + \'',
+      $dataNxt = $it.dataLevel = it.dataLevel + 1,
+      $nextData = 'data' + $dataNxt,
+      $dataProperties = 'dataProperties' + $lvl,
+      $ownProperties = it.opts.ownProperties,
+      $currentBaseId = it.baseId;
+    if ($ownProperties) {
+      out += ' var ' + ($dataProperties) + ' = undefined; ';
+    }
+    if ($ownProperties) {
+      out += ' ' + ($dataProperties) + ' = ' + ($dataProperties) + ' || Object.keys(' + ($data) + '); for (var ' + ($idx) + '=0; ' + ($idx) + '<' + ($dataProperties) + '.length; ' + ($idx) + '++) { var ' + ($key) + ' = ' + ($dataProperties) + '[' + ($idx) + ']; ';
+    } else {
+      out += ' for (var ' + ($key) + ' in ' + ($data) + ') { ';
+    }
+    out += ' var startErrs' + ($lvl) + ' = errors; ';
+    var $passData = $key;
+    var $wasComposite = it.compositeRule;
+    it.compositeRule = $it.compositeRule = true;
+    var $code = it.validate($it);
+    $it.baseId = $currentBaseId;
+    if (it.util.varOccurences($code, $nextData) < 2) {
+      out += ' ' + (it.util.varReplace($code, $nextData, $passData)) + ' ';
+    } else {
+      out += ' var ' + ($nextData) + ' = ' + ($passData) + '; ' + ($code) + ' ';
+    }
+    it.compositeRule = $it.compositeRule = $wasComposite;
+    out += ' if (!' + ($nextValid) + ') { for (var ' + ($i) + '=startErrs' + ($lvl) + '; ' + ($i) + '<errors; ' + ($i) + '++) { vErrors[' + ($i) + '].propertyName = ' + ($key) + '; }   var err =   '; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('propertyNames') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { propertyName: \'' + ($invalidName) + '\' } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'property name \\\'' + ($invalidName) + '\\\' is invalid\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError(vErrors); ';
+      } else {
+        out += ' validate.errors = vErrors; return false; ';
+      }
+    }
+    if ($breakOnError) {
+      out += ' break; ';
+    }
+    out += ' } }';
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces) + ' if (' + ($errs) + ' == errors) {';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/ref.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/ref.js
new file mode 100644
index 0000000..8042a47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/ref.js
@@ -0,0 +1,124 @@
+'use strict';
+module.exports = function generate_ref(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $async, $refCode;
+  if ($schema == '#' || $schema == '#/') {
+    if (it.isRoot) {
+      $async = it.async;
+      $refCode = 'validate';
+    } else {
+      $async = it.root.schema.$async === true;
+      $refCode = 'root.refVal[0]';
+    }
+  } else {
+    var $refVal = it.resolveRef(it.baseId, $schema, it.isRoot);
+    if ($refVal === undefined) {
+      var $message = it.MissingRefError.message(it.baseId, $schema);
+      if (it.opts.missingRefs == 'fail') {
+        it.logger.error($message);
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('$ref') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { ref: \'' + (it.util.escapeQuotes($schema)) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'can\\\'t resolve reference ' + (it.util.escapeQuotes($schema)) + '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: ' + (it.util.toQuotedString($schema)) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        if ($breakOnError) {
+          out += ' if (false) { ';
+        }
+      } else if (it.opts.missingRefs == 'ignore') {
+        it.logger.warn($message);
+        if ($breakOnError) {
+          out += ' if (true) { ';
+        }
+      } else {
+        throw new it.MissingRefError(it.baseId, $schema, $message);
+      }
+    } else if ($refVal.inline) {
+      var $it = it.util.copy(it);
+      $it.level++;
+      var $nextValid = 'valid' + $it.level;
+      $it.schema = $refVal.schema;
+      $it.schemaPath = '';
+      $it.errSchemaPath = $schema;
+      var $code = it.validate($it).replace(/validate\.schema/g, $refVal.code);
+      out += ' ' + ($code) + ' ';
+      if ($breakOnError) {
+        out += ' if (' + ($nextValid) + ') { ';
+      }
+    } else {
+      $async = $refVal.$async === true || (it.async && $refVal.$async !== false);
+      $refCode = $refVal.code;
+    }
+  }
+  if ($refCode) {
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = '';
+    if (it.opts.passContext) {
+      out += ' ' + ($refCode) + '.call(this, ';
+    } else {
+      out += ' ' + ($refCode) + '( ';
+    }
+    out += ' ' + ($data) + ', (dataPath || \'\')';
+    if (it.errorPath != '""') {
+      out += ' + ' + (it.errorPath);
+    }
+    var $parentData = $dataLvl ? 'data' + (($dataLvl - 1) || '') : 'parentData',
+      $parentDataProperty = $dataLvl ? it.dataPathArr[$dataLvl] : 'parentDataProperty';
+    out += ' , ' + ($parentData) + ' , ' + ($parentDataProperty) + ', rootData)  ';
+    var __callValidate = out;
+    out = $$outStack.pop();
+    if ($async) {
+      if (!it.async) throw new Error('async schema referenced by sync schema');
+      if ($breakOnError) {
+        out += ' var ' + ($valid) + '; ';
+      }
+      out += ' try { await ' + (__callValidate) + '; ';
+      if ($breakOnError) {
+        out += ' ' + ($valid) + ' = true; ';
+      }
+      out += ' } catch (e) { if (!(e instanceof ValidationError)) throw e; if (vErrors === null) vErrors = e.errors; else vErrors = vErrors.concat(e.errors); errors = vErrors.length; ';
+      if ($breakOnError) {
+        out += ' ' + ($valid) + ' = false; ';
+      }
+      out += ' } ';
+      if ($breakOnError) {
+        out += ' if (' + ($valid) + ') { ';
+      }
+    } else {
+      out += ' if (!' + (__callValidate) + ') { if (vErrors === null) vErrors = ' + ($refCode) + '.errors; else vErrors = vErrors.concat(' + ($refCode) + '.errors); errors = vErrors.length; } ';
+      if ($breakOnError) {
+        out += ' else { ';
+      }
+    }
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/required.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/required.js
new file mode 100644
index 0000000..14873ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/required.js
@@ -0,0 +1,270 @@
+'use strict';
+module.exports = function generate_required(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  var $vSchema = 'schema' + $lvl;
+  if (!$isData) {
+    if ($schema.length < it.opts.loopRequired && it.schema.properties && Object.keys(it.schema.properties).length) {
+      var $required = [];
+      var arr1 = $schema;
+      if (arr1) {
+        var $property, i1 = -1,
+          l1 = arr1.length - 1;
+        while (i1 < l1) {
+          $property = arr1[i1 += 1];
+          var $propertySch = it.schema.properties[$property];
+          if (!($propertySch && (it.opts.strictKeywords ? (typeof $propertySch == 'object' && Object.keys($propertySch).length > 0) || $propertySch === false : it.util.schemaHasRules($propertySch, it.RULES.all)))) {
+            $required[$required.length] = $property;
+          }
+        }
+      }
+    } else {
+      var $required = $schema;
+    }
+  }
+  if ($isData || $required.length) {
+    var $currentErrorPath = it.errorPath,
+      $loopRequired = $isData || $required.length >= it.opts.loopRequired,
+      $ownProperties = it.opts.ownProperties;
+    if ($breakOnError) {
+      out += ' var missing' + ($lvl) + '; ';
+      if ($loopRequired) {
+        if (!$isData) {
+          out += ' var ' + ($vSchema) + ' = validate.schema' + ($schemaPath) + '; ';
+        }
+        var $i = 'i' + $lvl,
+          $propertyPath = 'schema' + $lvl + '[' + $i + ']',
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.util.getPathExpr($currentErrorPath, $propertyPath, it.opts.jsonPointers);
+        }
+        out += ' var ' + ($valid) + ' = true; ';
+        if ($isData) {
+          out += ' if (schema' + ($lvl) + ' === undefined) ' + ($valid) + ' = true; else if (!Array.isArray(schema' + ($lvl) + ')) ' + ($valid) + ' = false; else {';
+        }
+        out += ' for (var ' + ($i) + ' = 0; ' + ($i) + ' < ' + ($vSchema) + '.length; ' + ($i) + '++) { ' + ($valid) + ' = ' + ($data) + '[' + ($vSchema) + '[' + ($i) + ']] !== undefined ';
+        if ($ownProperties) {
+          out += ' &&   Object.prototype.hasOwnProperty.call(' + ($data) + ', ' + ($vSchema) + '[' + ($i) + ']) ';
+        }
+        out += '; if (!' + ($valid) + ') break; } ';
+        if ($isData) {
+          out += '  }  ';
+        }
+        out += '  if (!' + ($valid) + ') {   ';
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'';
+            if (it.opts._errorDataPathProperty) {
+              out += 'is a required property';
+            } else {
+              out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        out += ' } else { ';
+      } else {
+        out += ' if ( ';
+        var arr2 = $required;
+        if (arr2) {
+          var $propertyKey, $i = -1,
+            l2 = arr2.length - 1;
+          while ($i < l2) {
+            $propertyKey = arr2[$i += 1];
+            if ($i) {
+              out += ' || ';
+            }
+            var $prop = it.util.getProperty($propertyKey),
+              $useData = $data + $prop;
+            out += ' ( ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') && (missing' + ($lvl) + ' = ' + (it.util.toQuotedString(it.opts.jsonPointers ? $propertyKey : $prop)) + ') ) ';
+          }
+        }
+        out += ') {  ';
+        var $propertyPath = 'missing' + $lvl,
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.opts.jsonPointers ? it.util.getPathExpr($currentErrorPath, $propertyPath, true) : $currentErrorPath + ' + ' + $propertyPath;
+        }
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'';
+            if (it.opts._errorDataPathProperty) {
+              out += 'is a required property';
+            } else {
+              out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        out += ' } else { ';
+      }
+    } else {
+      if ($loopRequired) {
+        if (!$isData) {
+          out += ' var ' + ($vSchema) + ' = validate.schema' + ($schemaPath) + '; ';
+        }
+        var $i = 'i' + $lvl,
+          $propertyPath = 'schema' + $lvl + '[' + $i + ']',
+          $missingProperty = '\' + ' + $propertyPath + ' + \'';
+        if (it.opts._errorDataPathProperty) {
+          it.errorPath = it.util.getPathExpr($currentErrorPath, $propertyPath, it.opts.jsonPointers);
+        }
+        if ($isData) {
+          out += ' if (' + ($vSchema) + ' && !Array.isArray(' + ($vSchema) + ')) {  var err =   '; /* istanbul ignore else */
+          if (it.createErrors !== false) {
+            out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+            if (it.opts.messages !== false) {
+              out += ' , message: \'';
+              if (it.opts._errorDataPathProperty) {
+                out += 'is a required property';
+              } else {
+                out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+              }
+              out += '\' ';
+            }
+            if (it.opts.verbose) {
+              out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+            }
+            out += ' } ';
+          } else {
+            out += ' {} ';
+          }
+          out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } else if (' + ($vSchema) + ' !== undefined) { ';
+        }
+        out += ' for (var ' + ($i) + ' = 0; ' + ($i) + ' < ' + ($vSchema) + '.length; ' + ($i) + '++) { if (' + ($data) + '[' + ($vSchema) + '[' + ($i) + ']] === undefined ';
+        if ($ownProperties) {
+          out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', ' + ($vSchema) + '[' + ($i) + ']) ';
+        }
+        out += ') {  var err =   '; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'';
+            if (it.opts._errorDataPathProperty) {
+              out += 'is a required property';
+            } else {
+              out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } } ';
+        if ($isData) {
+          out += '  }  ';
+        }
+      } else {
+        var arr3 = $required;
+        if (arr3) {
+          var $propertyKey, i3 = -1,
+            l3 = arr3.length - 1;
+          while (i3 < l3) {
+            $propertyKey = arr3[i3 += 1];
+            var $prop = it.util.getProperty($propertyKey),
+              $missingProperty = it.util.escapeQuotes($propertyKey),
+              $useData = $data + $prop;
+            if (it.opts._errorDataPathProperty) {
+              it.errorPath = it.util.getPath($currentErrorPath, $propertyKey, it.opts.jsonPointers);
+            }
+            out += ' if ( ' + ($useData) + ' === undefined ';
+            if ($ownProperties) {
+              out += ' || ! Object.prototype.hasOwnProperty.call(' + ($data) + ', \'' + (it.util.escapeQuotes($propertyKey)) + '\') ';
+            }
+            out += ') {  var err =   '; /* istanbul ignore else */
+            if (it.createErrors !== false) {
+              out += ' { keyword: \'' + ('required') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { missingProperty: \'' + ($missingProperty) + '\' } ';
+              if (it.opts.messages !== false) {
+                out += ' , message: \'';
+                if (it.opts._errorDataPathProperty) {
+                  out += 'is a required property';
+                } else {
+                  out += 'should have required property \\\'' + ($missingProperty) + '\\\'';
+                }
+                out += '\' ';
+              }
+              if (it.opts.verbose) {
+                out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+              }
+              out += ' } ';
+            } else {
+              out += ' {} ';
+            }
+            out += ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; } ';
+          }
+        }
+      }
+    }
+    it.errorPath = $currentErrorPath;
+  } else if ($breakOnError) {
+    out += ' if (true) {';
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/uniqueItems.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/uniqueItems.js
new file mode 100644
index 0000000..0736a0e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/uniqueItems.js
@@ -0,0 +1,86 @@
+'use strict';
+module.exports = function generate_uniqueItems(it, $keyword, $ruleType) {
+  var out = ' ';
+  var $lvl = it.level;
+  var $dataLvl = it.dataLevel;
+  var $schema = it.schema[$keyword];
+  var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+  var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+  var $breakOnError = !it.opts.allErrors;
+  var $data = 'data' + ($dataLvl || '');
+  var $valid = 'valid' + $lvl;
+  var $isData = it.opts.$data && $schema && $schema.$data,
+    $schemaValue;
+  if ($isData) {
+    out += ' var schema' + ($lvl) + ' = ' + (it.util.getData($schema.$data, $dataLvl, it.dataPathArr)) + '; ';
+    $schemaValue = 'schema' + $lvl;
+  } else {
+    $schemaValue = $schema;
+  }
+  if (($schema || $isData) && it.opts.uniqueItems !== false) {
+    if ($isData) {
+      out += ' var ' + ($valid) + '; if (' + ($schemaValue) + ' === false || ' + ($schemaValue) + ' === undefined) ' + ($valid) + ' = true; else if (typeof ' + ($schemaValue) + ' != \'boolean\') ' + ($valid) + ' = false; else { ';
+    }
+    out += ' var i = ' + ($data) + '.length , ' + ($valid) + ' = true , j; if (i > 1) { ';
+    var $itemType = it.schema.items && it.schema.items.type,
+      $typeIsArray = Array.isArray($itemType);
+    if (!$itemType || $itemType == 'object' || $itemType == 'array' || ($typeIsArray && ($itemType.indexOf('object') >= 0 || $itemType.indexOf('array') >= 0))) {
+      out += ' outer: for (;i--;) { for (j = i; j--;) { if (equal(' + ($data) + '[i], ' + ($data) + '[j])) { ' + ($valid) + ' = false; break outer; } } } ';
+    } else {
+      out += ' var itemIndices = {}, item; for (;i--;) { var item = ' + ($data) + '[i]; ';
+      var $method = 'checkDataType' + ($typeIsArray ? 's' : '');
+      out += ' if (' + (it.util[$method]($itemType, 'item', it.opts.strictNumbers, true)) + ') continue; ';
+      if ($typeIsArray) {
+        out += ' if (typeof item == \'string\') item = \'"\' + item; ';
+      }
+      out += ' if (typeof itemIndices[item] == \'number\') { ' + ($valid) + ' = false; j = itemIndices[item]; break; } itemIndices[item] = i; } ';
+    }
+    out += ' } ';
+    if ($isData) {
+      out += '  }  ';
+    }
+    out += ' if (!' + ($valid) + ') {   ';
+    var $$outStack = $$outStack || [];
+    $$outStack.push(out);
+    out = ''; /* istanbul ignore else */
+    if (it.createErrors !== false) {
+      out += ' { keyword: \'' + ('uniqueItems') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { i: i, j: j } ';
+      if (it.opts.messages !== false) {
+        out += ' , message: \'should NOT have duplicate items (items ## \' + j + \' and \' + i + \' are identical)\' ';
+      }
+      if (it.opts.verbose) {
+        out += ' , schema:  ';
+        if ($isData) {
+          out += 'validate.schema' + ($schemaPath);
+        } else {
+          out += '' + ($schema);
+        }
+        out += '         , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+      }
+      out += ' } ';
+    } else {
+      out += ' {} ';
+    }
+    var __err = out;
+    out = $$outStack.pop();
+    if (!it.compositeRule && $breakOnError) {
+      /* istanbul ignore if */
+      if (it.async) {
+        out += ' throw new ValidationError([' + (__err) + ']); ';
+      } else {
+        out += ' validate.errors = [' + (__err) + ']; return false; ';
+      }
+    } else {
+      out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+    }
+    out += ' } ';
+    if ($breakOnError) {
+      out += ' else { ';
+    }
+  } else {
+    if ($breakOnError) {
+      out += ' if (true) { ';
+    }
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/validate.js b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/validate.js
new file mode 100644
index 0000000..f295824
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/dotjs/validate.js
@@ -0,0 +1,482 @@
+'use strict';
+module.exports = function generate_validate(it, $keyword, $ruleType) {
+  var out = '';
+  var $async = it.schema.$async === true,
+    $refKeywords = it.util.schemaHasRulesExcept(it.schema, it.RULES.all, '$ref'),
+    $id = it.self._getId(it.schema);
+  if (it.opts.strictKeywords) {
+    var $unknownKwd = it.util.schemaUnknownRules(it.schema, it.RULES.keywords);
+    if ($unknownKwd) {
+      var $keywordsMsg = 'unknown keyword: ' + $unknownKwd;
+      if (it.opts.strictKeywords === 'log') it.logger.warn($keywordsMsg);
+      else throw new Error($keywordsMsg);
+    }
+  }
+  if (it.isTop) {
+    out += ' var validate = ';
+    if ($async) {
+      it.async = true;
+      out += 'async ';
+    }
+    out += 'function(data, dataPath, parentData, parentDataProperty, rootData) { \'use strict\'; ';
+    if ($id && (it.opts.sourceCode || it.opts.processCode)) {
+      out += ' ' + ('/\*# sourceURL=' + $id + ' */') + ' ';
+    }
+  }
+  if (typeof it.schema == 'boolean' || !($refKeywords || it.schema.$ref)) {
+    var $keyword = 'false schema';
+    var $lvl = it.level;
+    var $dataLvl = it.dataLevel;
+    var $schema = it.schema[$keyword];
+    var $schemaPath = it.schemaPath + it.util.getProperty($keyword);
+    var $errSchemaPath = it.errSchemaPath + '/' + $keyword;
+    var $breakOnError = !it.opts.allErrors;
+    var $errorKeyword;
+    var $data = 'data' + ($dataLvl || '');
+    var $valid = 'valid' + $lvl;
+    if (it.schema === false) {
+      if (it.isTop) {
+        $breakOnError = true;
+      } else {
+        out += ' var ' + ($valid) + ' = false; ';
+      }
+      var $$outStack = $$outStack || [];
+      $$outStack.push(out);
+      out = ''; /* istanbul ignore else */
+      if (it.createErrors !== false) {
+        out += ' { keyword: \'' + ($errorKeyword || 'false schema') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: {} ';
+        if (it.opts.messages !== false) {
+          out += ' , message: \'boolean schema is false\' ';
+        }
+        if (it.opts.verbose) {
+          out += ' , schema: false , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+        }
+        out += ' } ';
+      } else {
+        out += ' {} ';
+      }
+      var __err = out;
+      out = $$outStack.pop();
+      if (!it.compositeRule && $breakOnError) {
+        /* istanbul ignore if */
+        if (it.async) {
+          out += ' throw new ValidationError([' + (__err) + ']); ';
+        } else {
+          out += ' validate.errors = [' + (__err) + ']; return false; ';
+        }
+      } else {
+        out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+      }
+    } else {
+      if (it.isTop) {
+        if ($async) {
+          out += ' return data; ';
+        } else {
+          out += ' validate.errors = null; return true; ';
+        }
+      } else {
+        out += ' var ' + ($valid) + ' = true; ';
+      }
+    }
+    if (it.isTop) {
+      out += ' }; return validate; ';
+    }
+    return out;
+  }
+  if (it.isTop) {
+    var $top = it.isTop,
+      $lvl = it.level = 0,
+      $dataLvl = it.dataLevel = 0,
+      $data = 'data';
+    it.rootId = it.resolve.fullPath(it.self._getId(it.root.schema));
+    it.baseId = it.baseId || it.rootId;
+    delete it.isTop;
+    it.dataPathArr = [""];
+    if (it.schema.default !== undefined && it.opts.useDefaults && it.opts.strictDefaults) {
+      var $defaultMsg = 'default is ignored in the schema root';
+      if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+      else throw new Error($defaultMsg);
+    }
+    out += ' var vErrors = null; ';
+    out += ' var errors = 0;     ';
+    out += ' if (rootData === undefined) rootData = data; ';
+  } else {
+    var $lvl = it.level,
+      $dataLvl = it.dataLevel,
+      $data = 'data' + ($dataLvl || '');
+    if ($id) it.baseId = it.resolve.url(it.baseId, $id);
+    if ($async && !it.async) throw new Error('async schema in sync schema');
+    out += ' var errs_' + ($lvl) + ' = errors;';
+  }
+  var $valid = 'valid' + $lvl,
+    $breakOnError = !it.opts.allErrors,
+    $closingBraces1 = '',
+    $closingBraces2 = '';
+  var $errorKeyword;
+  var $typeSchema = it.schema.type,
+    $typeIsArray = Array.isArray($typeSchema);
+  if ($typeSchema && it.opts.nullable && it.schema.nullable === true) {
+    if ($typeIsArray) {
+      if ($typeSchema.indexOf('null') == -1) $typeSchema = $typeSchema.concat('null');
+    } else if ($typeSchema != 'null') {
+      $typeSchema = [$typeSchema, 'null'];
+      $typeIsArray = true;
+    }
+  }
+  if ($typeIsArray && $typeSchema.length == 1) {
+    $typeSchema = $typeSchema[0];
+    $typeIsArray = false;
+  }
+  if (it.schema.$ref && $refKeywords) {
+    if (it.opts.extendRefs == 'fail') {
+      throw new Error('$ref: validation keywords used in schema at path "' + it.errSchemaPath + '" (see option extendRefs)');
+    } else if (it.opts.extendRefs !== true) {
+      $refKeywords = false;
+      it.logger.warn('$ref: keywords ignored in schema at path "' + it.errSchemaPath + '"');
+    }
+  }
+  if (it.schema.$comment && it.opts.$comment) {
+    out += ' ' + (it.RULES.all.$comment.code(it, '$comment'));
+  }
+  if ($typeSchema) {
+    if (it.opts.coerceTypes) {
+      var $coerceToTypes = it.util.coerceToTypes(it.opts.coerceTypes, $typeSchema);
+    }
+    var $rulesGroup = it.RULES.types[$typeSchema];
+    if ($coerceToTypes || $typeIsArray || $rulesGroup === true || ($rulesGroup && !$shouldUseGroup($rulesGroup))) {
+      var $schemaPath = it.schemaPath + '.type',
+        $errSchemaPath = it.errSchemaPath + '/type';
+      var $schemaPath = it.schemaPath + '.type',
+        $errSchemaPath = it.errSchemaPath + '/type',
+        $method = $typeIsArray ? 'checkDataTypes' : 'checkDataType';
+      out += ' if (' + (it.util[$method]($typeSchema, $data, it.opts.strictNumbers, true)) + ') { ';
+      if ($coerceToTypes) {
+        var $dataType = 'dataType' + $lvl,
+          $coerced = 'coerced' + $lvl;
+        out += ' var ' + ($dataType) + ' = typeof ' + ($data) + '; var ' + ($coerced) + ' = undefined; ';
+        if (it.opts.coerceTypes == 'array') {
+          out += ' if (' + ($dataType) + ' == \'object\' && Array.isArray(' + ($data) + ') && ' + ($data) + '.length == 1) { ' + ($data) + ' = ' + ($data) + '[0]; ' + ($dataType) + ' = typeof ' + ($data) + '; if (' + (it.util.checkDataType(it.schema.type, $data, it.opts.strictNumbers)) + ') ' + ($coerced) + ' = ' + ($data) + '; } ';
+        }
+        out += ' if (' + ($coerced) + ' !== undefined) ; ';
+        var arr1 = $coerceToTypes;
+        if (arr1) {
+          var $type, $i = -1,
+            l1 = arr1.length - 1;
+          while ($i < l1) {
+            $type = arr1[$i += 1];
+            if ($type == 'string') {
+              out += ' else if (' + ($dataType) + ' == \'number\' || ' + ($dataType) + ' == \'boolean\') ' + ($coerced) + ' = \'\' + ' + ($data) + '; else if (' + ($data) + ' === null) ' + ($coerced) + ' = \'\'; ';
+            } else if ($type == 'number' || $type == 'integer') {
+              out += ' else if (' + ($dataType) + ' == \'boolean\' || ' + ($data) + ' === null || (' + ($dataType) + ' == \'string\' && ' + ($data) + ' && ' + ($data) + ' == +' + ($data) + ' ';
+              if ($type == 'integer') {
+                out += ' && !(' + ($data) + ' % 1)';
+              }
+              out += ')) ' + ($coerced) + ' = +' + ($data) + '; ';
+            } else if ($type == 'boolean') {
+              out += ' else if (' + ($data) + ' === \'false\' || ' + ($data) + ' === 0 || ' + ($data) + ' === null) ' + ($coerced) + ' = false; else if (' + ($data) + ' === \'true\' || ' + ($data) + ' === 1) ' + ($coerced) + ' = true; ';
+            } else if ($type == 'null') {
+              out += ' else if (' + ($data) + ' === \'\' || ' + ($data) + ' === 0 || ' + ($data) + ' === false) ' + ($coerced) + ' = null; ';
+            } else if (it.opts.coerceTypes == 'array' && $type == 'array') {
+              out += ' else if (' + ($dataType) + ' == \'string\' || ' + ($dataType) + ' == \'number\' || ' + ($dataType) + ' == \'boolean\' || ' + ($data) + ' == null) ' + ($coerced) + ' = [' + ($data) + ']; ';
+            }
+          }
+        }
+        out += ' else {   ';
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ($errorKeyword || 'type') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { type: \'';
+          if ($typeIsArray) {
+            out += '' + ($typeSchema.join(","));
+          } else {
+            out += '' + ($typeSchema);
+          }
+          out += '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'should be ';
+            if ($typeIsArray) {
+              out += '' + ($typeSchema.join(","));
+            } else {
+              out += '' + ($typeSchema);
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+        out += ' } if (' + ($coerced) + ' !== undefined) {  ';
+        var $parentData = $dataLvl ? 'data' + (($dataLvl - 1) || '') : 'parentData',
+          $parentDataProperty = $dataLvl ? it.dataPathArr[$dataLvl] : 'parentDataProperty';
+        out += ' ' + ($data) + ' = ' + ($coerced) + '; ';
+        if (!$dataLvl) {
+          out += 'if (' + ($parentData) + ' !== undefined)';
+        }
+        out += ' ' + ($parentData) + '[' + ($parentDataProperty) + '] = ' + ($coerced) + '; } ';
+      } else {
+        var $$outStack = $$outStack || [];
+        $$outStack.push(out);
+        out = ''; /* istanbul ignore else */
+        if (it.createErrors !== false) {
+          out += ' { keyword: \'' + ($errorKeyword || 'type') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { type: \'';
+          if ($typeIsArray) {
+            out += '' + ($typeSchema.join(","));
+          } else {
+            out += '' + ($typeSchema);
+          }
+          out += '\' } ';
+          if (it.opts.messages !== false) {
+            out += ' , message: \'should be ';
+            if ($typeIsArray) {
+              out += '' + ($typeSchema.join(","));
+            } else {
+              out += '' + ($typeSchema);
+            }
+            out += '\' ';
+          }
+          if (it.opts.verbose) {
+            out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+          }
+          out += ' } ';
+        } else {
+          out += ' {} ';
+        }
+        var __err = out;
+        out = $$outStack.pop();
+        if (!it.compositeRule && $breakOnError) {
+          /* istanbul ignore if */
+          if (it.async) {
+            out += ' throw new ValidationError([' + (__err) + ']); ';
+          } else {
+            out += ' validate.errors = [' + (__err) + ']; return false; ';
+          }
+        } else {
+          out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+        }
+      }
+      out += ' } ';
+    }
+  }
+  if (it.schema.$ref && !$refKeywords) {
+    out += ' ' + (it.RULES.all.$ref.code(it, '$ref')) + ' ';
+    if ($breakOnError) {
+      out += ' } if (errors === ';
+      if ($top) {
+        out += '0';
+      } else {
+        out += 'errs_' + ($lvl);
+      }
+      out += ') { ';
+      $closingBraces2 += '}';
+    }
+  } else {
+    var arr2 = it.RULES;
+    if (arr2) {
+      var $rulesGroup, i2 = -1,
+        l2 = arr2.length - 1;
+      while (i2 < l2) {
+        $rulesGroup = arr2[i2 += 1];
+        if ($shouldUseGroup($rulesGroup)) {
+          if ($rulesGroup.type) {
+            out += ' if (' + (it.util.checkDataType($rulesGroup.type, $data, it.opts.strictNumbers)) + ') { ';
+          }
+          if (it.opts.useDefaults) {
+            if ($rulesGroup.type == 'object' && it.schema.properties) {
+              var $schema = it.schema.properties,
+                $schemaKeys = Object.keys($schema);
+              var arr3 = $schemaKeys;
+              if (arr3) {
+                var $propertyKey, i3 = -1,
+                  l3 = arr3.length - 1;
+                while (i3 < l3) {
+                  $propertyKey = arr3[i3 += 1];
+                  var $sch = $schema[$propertyKey];
+                  if ($sch.default !== undefined) {
+                    var $passData = $data + it.util.getProperty($propertyKey);
+                    if (it.compositeRule) {
+                      if (it.opts.strictDefaults) {
+                        var $defaultMsg = 'default is ignored for: ' + $passData;
+                        if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+                        else throw new Error($defaultMsg);
+                      }
+                    } else {
+                      out += ' if (' + ($passData) + ' === undefined ';
+                      if (it.opts.useDefaults == 'empty') {
+                        out += ' || ' + ($passData) + ' === null || ' + ($passData) + ' === \'\' ';
+                      }
+                      out += ' ) ' + ($passData) + ' = ';
+                      if (it.opts.useDefaults == 'shared') {
+                        out += ' ' + (it.useDefault($sch.default)) + ' ';
+                      } else {
+                        out += ' ' + (JSON.stringify($sch.default)) + ' ';
+                      }
+                      out += '; ';
+                    }
+                  }
+                }
+              }
+            } else if ($rulesGroup.type == 'array' && Array.isArray(it.schema.items)) {
+              var arr4 = it.schema.items;
+              if (arr4) {
+                var $sch, $i = -1,
+                  l4 = arr4.length - 1;
+                while ($i < l4) {
+                  $sch = arr4[$i += 1];
+                  if ($sch.default !== undefined) {
+                    var $passData = $data + '[' + $i + ']';
+                    if (it.compositeRule) {
+                      if (it.opts.strictDefaults) {
+                        var $defaultMsg = 'default is ignored for: ' + $passData;
+                        if (it.opts.strictDefaults === 'log') it.logger.warn($defaultMsg);
+                        else throw new Error($defaultMsg);
+                      }
+                    } else {
+                      out += ' if (' + ($passData) + ' === undefined ';
+                      if (it.opts.useDefaults == 'empty') {
+                        out += ' || ' + ($passData) + ' === null || ' + ($passData) + ' === \'\' ';
+                      }
+                      out += ' ) ' + ($passData) + ' = ';
+                      if (it.opts.useDefaults == 'shared') {
+                        out += ' ' + (it.useDefault($sch.default)) + ' ';
+                      } else {
+                        out += ' ' + (JSON.stringify($sch.default)) + ' ';
+                      }
+                      out += '; ';
+                    }
+                  }
+                }
+              }
+            }
+          }
+          var arr5 = $rulesGroup.rules;
+          if (arr5) {
+            var $rule, i5 = -1,
+              l5 = arr5.length - 1;
+            while (i5 < l5) {
+              $rule = arr5[i5 += 1];
+              if ($shouldUseRule($rule)) {
+                var $code = $rule.code(it, $rule.keyword, $rulesGroup.type);
+                if ($code) {
+                  out += ' ' + ($code) + ' ';
+                  if ($breakOnError) {
+                    $closingBraces1 += '}';
+                  }
+                }
+              }
+            }
+          }
+          if ($breakOnError) {
+            out += ' ' + ($closingBraces1) + ' ';
+            $closingBraces1 = '';
+          }
+          if ($rulesGroup.type) {
+            out += ' } ';
+            if ($typeSchema && $typeSchema === $rulesGroup.type && !$coerceToTypes) {
+              out += ' else { ';
+              var $schemaPath = it.schemaPath + '.type',
+                $errSchemaPath = it.errSchemaPath + '/type';
+              var $$outStack = $$outStack || [];
+              $$outStack.push(out);
+              out = ''; /* istanbul ignore else */
+              if (it.createErrors !== false) {
+                out += ' { keyword: \'' + ($errorKeyword || 'type') + '\' , dataPath: (dataPath || \'\') + ' + (it.errorPath) + ' , schemaPath: ' + (it.util.toQuotedString($errSchemaPath)) + ' , params: { type: \'';
+                if ($typeIsArray) {
+                  out += '' + ($typeSchema.join(","));
+                } else {
+                  out += '' + ($typeSchema);
+                }
+                out += '\' } ';
+                if (it.opts.messages !== false) {
+                  out += ' , message: \'should be ';
+                  if ($typeIsArray) {
+                    out += '' + ($typeSchema.join(","));
+                  } else {
+                    out += '' + ($typeSchema);
+                  }
+                  out += '\' ';
+                }
+                if (it.opts.verbose) {
+                  out += ' , schema: validate.schema' + ($schemaPath) + ' , parentSchema: validate.schema' + (it.schemaPath) + ' , data: ' + ($data) + ' ';
+                }
+                out += ' } ';
+              } else {
+                out += ' {} ';
+              }
+              var __err = out;
+              out = $$outStack.pop();
+              if (!it.compositeRule && $breakOnError) {
+                /* istanbul ignore if */
+                if (it.async) {
+                  out += ' throw new ValidationError([' + (__err) + ']); ';
+                } else {
+                  out += ' validate.errors = [' + (__err) + ']; return false; ';
+                }
+              } else {
+                out += ' var err = ' + (__err) + ';  if (vErrors === null) vErrors = [err]; else vErrors.push(err); errors++; ';
+              }
+              out += ' } ';
+            }
+          }
+          if ($breakOnError) {
+            out += ' if (errors === ';
+            if ($top) {
+              out += '0';
+            } else {
+              out += 'errs_' + ($lvl);
+            }
+            out += ') { ';
+            $closingBraces2 += '}';
+          }
+        }
+      }
+    }
+  }
+  if ($breakOnError) {
+    out += ' ' + ($closingBraces2) + ' ';
+  }
+  if ($top) {
+    if ($async) {
+      out += ' if (errors === 0) return data;           ';
+      out += ' else throw new ValidationError(vErrors); ';
+    } else {
+      out += ' validate.errors = vErrors; ';
+      out += ' return errors === 0;       ';
+    }
+    out += ' }; return validate;';
+  } else {
+    out += ' var ' + ($valid) + ' = errors === errs_' + ($lvl) + ';';
+  }
+
+  function $shouldUseGroup($rulesGroup) {
+    var rules = $rulesGroup.rules;
+    for (var i = 0; i < rules.length; i++)
+      if ($shouldUseRule(rules[i])) return true;
+  }
+
+  function $shouldUseRule($rule) {
+    return it.schema[$rule.keyword] !== undefined || ($rule.implements && $ruleImplementsSomeKeyword($rule));
+  }
+
+  function $ruleImplementsSomeKeyword($rule) {
+    var impl = $rule.implements;
+    for (var i = 0; i < impl.length; i++)
+      if (it.schema[impl[i]] !== undefined) return true;
+  }
+  return out;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/keyword.js b/node_modules/mathjs/examples/node_modules/ajv/lib/keyword.js
new file mode 100644
index 0000000..06da9a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/keyword.js
@@ -0,0 +1,146 @@
+'use strict';
+
+var IDENTIFIER = /^[a-z_$][a-z0-9_$-]*$/i;
+var customRuleCode = require('./dotjs/custom');
+var definitionSchema = require('./definition_schema');
+
+module.exports = {
+  add: addKeyword,
+  get: getKeyword,
+  remove: removeKeyword,
+  validate: validateKeyword
+};
+
+
+/**
+ * Define custom keyword
+ * @this  Ajv
+ * @param {String} keyword custom keyword, should be unique (including different from all standard, custom and macro keywords).
+ * @param {Object} definition keyword definition object with properties `type` (type(s) which the keyword applies to), `validate` or `compile`.
+ * @return {Ajv} this for method chaining
+ */
+function addKeyword(keyword, definition) {
+  /* jshint validthis: true */
+  /* eslint no-shadow: 0 */
+  var RULES = this.RULES;
+  if (RULES.keywords[keyword])
+    throw new Error('Keyword ' + keyword + ' is already defined');
+
+  if (!IDENTIFIER.test(keyword))
+    throw new Error('Keyword ' + keyword + ' is not a valid identifier');
+
+  if (definition) {
+    this.validateKeyword(definition, true);
+
+    var dataType = definition.type;
+    if (Array.isArray(dataType)) {
+      for (var i=0; i<dataType.length; i++)
+        _addRule(keyword, dataType[i], definition);
+    } else {
+      _addRule(keyword, dataType, definition);
+    }
+
+    var metaSchema = definition.metaSchema;
+    if (metaSchema) {
+      if (definition.$data && this._opts.$data) {
+        metaSchema = {
+          anyOf: [
+            metaSchema,
+            { '$ref': 'https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#' }
+          ]
+        };
+      }
+      definition.validateSchema = this.compile(metaSchema, true);
+    }
+  }
+
+  RULES.keywords[keyword] = RULES.all[keyword] = true;
+
+
+  function _addRule(keyword, dataType, definition) {
+    var ruleGroup;
+    for (var i=0; i<RULES.length; i++) {
+      var rg = RULES[i];
+      if (rg.type == dataType) {
+        ruleGroup = rg;
+        break;
+      }
+    }
+
+    if (!ruleGroup) {
+      ruleGroup = { type: dataType, rules: [] };
+      RULES.push(ruleGroup);
+    }
+
+    var rule = {
+      keyword: keyword,
+      definition: definition,
+      custom: true,
+      code: customRuleCode,
+      implements: definition.implements
+    };
+    ruleGroup.rules.push(rule);
+    RULES.custom[keyword] = rule;
+  }
+
+  return this;
+}
+
+
+/**
+ * Get keyword
+ * @this  Ajv
+ * @param {String} keyword pre-defined or custom keyword.
+ * @return {Object|Boolean} custom keyword definition, `true` if it is a predefined keyword, `false` otherwise.
+ */
+function getKeyword(keyword) {
+  /* jshint validthis: true */
+  var rule = this.RULES.custom[keyword];
+  return rule ? rule.definition : this.RULES.keywords[keyword] || false;
+}
+
+
+/**
+ * Remove keyword
+ * @this  Ajv
+ * @param {String} keyword pre-defined or custom keyword.
+ * @return {Ajv} this for method chaining
+ */
+function removeKeyword(keyword) {
+  /* jshint validthis: true */
+  var RULES = this.RULES;
+  delete RULES.keywords[keyword];
+  delete RULES.all[keyword];
+  delete RULES.custom[keyword];
+  for (var i=0; i<RULES.length; i++) {
+    var rules = RULES[i].rules;
+    for (var j=0; j<rules.length; j++) {
+      if (rules[j].keyword == keyword) {
+        rules.splice(j, 1);
+        break;
+      }
+    }
+  }
+  return this;
+}
+
+
+/**
+ * Validate keyword definition
+ * @this  Ajv
+ * @param {Object} definition keyword definition object.
+ * @param {Boolean} throwError true to throw exception if definition is invalid
+ * @return {boolean} validation result
+ */
+function validateKeyword(definition, throwError) {
+  validateKeyword.errors = null;
+  var v = this._validateKeyword = this._validateKeyword
+                                  || this.compile(definitionSchema, true);
+
+  if (v(definition)) return true;
+  validateKeyword.errors = v.errors;
+  if (throwError)
+    throw new Error('custom keyword definition is invalid: '  + this.errorsText(v.errors));
+  else
+    return false;
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/refs/data.json b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/data.json
new file mode 100644
index 0000000..64aac5b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/data.json
@@ -0,0 +1,17 @@
+{
+    "$schema": "http://json-schema.org/draft-07/schema#",
+    "$id": "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#",
+    "description": "Meta-schema for $data reference (JSON Schema extension proposal)",
+    "type": "object",
+    "required": [ "$data" ],
+    "properties": {
+        "$data": {
+            "type": "string",
+            "anyOf": [
+                { "format": "relative-json-pointer" }, 
+                { "format": "json-pointer" }
+            ]
+        }
+    },
+    "additionalProperties": false
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-04.json b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-04.json
new file mode 100644
index 0000000..bcbb847
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-04.json
@@ -0,0 +1,149 @@
+{
+    "id": "http://json-schema.org/draft-04/schema#",
+    "$schema": "http://json-schema.org/draft-04/schema#",
+    "description": "Core schema meta-schema",
+    "definitions": {
+        "schemaArray": {
+            "type": "array",
+            "minItems": 1,
+            "items": { "$ref": "#" }
+        },
+        "positiveInteger": {
+            "type": "integer",
+            "minimum": 0
+        },
+        "positiveIntegerDefault0": {
+            "allOf": [ { "$ref": "#/definitions/positiveInteger" }, { "default": 0 } ]
+        },
+        "simpleTypes": {
+            "enum": [ "array", "boolean", "integer", "null", "number", "object", "string" ]
+        },
+        "stringArray": {
+            "type": "array",
+            "items": { "type": "string" },
+            "minItems": 1,
+            "uniqueItems": true
+        }
+    },
+    "type": "object",
+    "properties": {
+        "id": {
+            "type": "string"
+        },
+        "$schema": {
+            "type": "string"
+        },
+        "title": {
+            "type": "string"
+        },
+        "description": {
+            "type": "string"
+        },
+        "default": {},
+        "multipleOf": {
+            "type": "number",
+            "minimum": 0,
+            "exclusiveMinimum": true
+        },
+        "maximum": {
+            "type": "number"
+        },
+        "exclusiveMaximum": {
+            "type": "boolean",
+            "default": false
+        },
+        "minimum": {
+            "type": "number"
+        },
+        "exclusiveMinimum": {
+            "type": "boolean",
+            "default": false
+        },
+        "maxLength": { "$ref": "#/definitions/positiveInteger" },
+        "minLength": { "$ref": "#/definitions/positiveIntegerDefault0" },
+        "pattern": {
+            "type": "string",
+            "format": "regex"
+        },
+        "additionalItems": {
+            "anyOf": [
+                { "type": "boolean" },
+                { "$ref": "#" }
+            ],
+            "default": {}
+        },
+        "items": {
+            "anyOf": [
+                { "$ref": "#" },
+                { "$ref": "#/definitions/schemaArray" }
+            ],
+            "default": {}
+        },
+        "maxItems": { "$ref": "#/definitions/positiveInteger" },
+        "minItems": { "$ref": "#/definitions/positiveIntegerDefault0" },
+        "uniqueItems": {
+            "type": "boolean",
+            "default": false
+        },
+        "maxProperties": { "$ref": "#/definitions/positiveInteger" },
+        "minProperties": { "$ref": "#/definitions/positiveIntegerDefault0" },
+        "required": { "$ref": "#/definitions/stringArray" },
+        "additionalProperties": {
+            "anyOf": [
+                { "type": "boolean" },
+                { "$ref": "#" }
+            ],
+            "default": {}
+        },
+        "definitions": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "properties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "patternProperties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "dependencies": {
+            "type": "object",
+            "additionalProperties": {
+                "anyOf": [
+                    { "$ref": "#" },
+                    { "$ref": "#/definitions/stringArray" }
+                ]
+            }
+        },
+        "enum": {
+            "type": "array",
+            "minItems": 1,
+            "uniqueItems": true
+        },
+        "type": {
+            "anyOf": [
+                { "$ref": "#/definitions/simpleTypes" },
+                {
+                    "type": "array",
+                    "items": { "$ref": "#/definitions/simpleTypes" },
+                    "minItems": 1,
+                    "uniqueItems": true
+                }
+            ]
+        },
+        "format": { "type": "string" },
+        "allOf": { "$ref": "#/definitions/schemaArray" },
+        "anyOf": { "$ref": "#/definitions/schemaArray" },
+        "oneOf": { "$ref": "#/definitions/schemaArray" },
+        "not": { "$ref": "#" }
+    },
+    "dependencies": {
+        "exclusiveMaximum": [ "maximum" ],
+        "exclusiveMinimum": [ "minimum" ]
+    },
+    "default": {}
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-06.json b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-06.json
new file mode 100644
index 0000000..5656240
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-06.json
@@ -0,0 +1,154 @@
+{
+    "$schema": "http://json-schema.org/draft-06/schema#",
+    "$id": "http://json-schema.org/draft-06/schema#",
+    "title": "Core schema meta-schema",
+    "definitions": {
+        "schemaArray": {
+            "type": "array",
+            "minItems": 1,
+            "items": { "$ref": "#" }
+        },
+        "nonNegativeInteger": {
+            "type": "integer",
+            "minimum": 0
+        },
+        "nonNegativeIntegerDefault0": {
+            "allOf": [
+                { "$ref": "#/definitions/nonNegativeInteger" },
+                { "default": 0 }
+            ]
+        },
+        "simpleTypes": {
+            "enum": [
+                "array",
+                "boolean",
+                "integer",
+                "null",
+                "number",
+                "object",
+                "string"
+            ]
+        },
+        "stringArray": {
+            "type": "array",
+            "items": { "type": "string" },
+            "uniqueItems": true,
+            "default": []
+        }
+    },
+    "type": ["object", "boolean"],
+    "properties": {
+        "$id": {
+            "type": "string",
+            "format": "uri-reference"
+        },
+        "$schema": {
+            "type": "string",
+            "format": "uri"
+        },
+        "$ref": {
+            "type": "string",
+            "format": "uri-reference"
+        },
+        "title": {
+            "type": "string"
+        },
+        "description": {
+            "type": "string"
+        },
+        "default": {},
+        "examples": {
+            "type": "array",
+            "items": {}
+        },
+        "multipleOf": {
+            "type": "number",
+            "exclusiveMinimum": 0
+        },
+        "maximum": {
+            "type": "number"
+        },
+        "exclusiveMaximum": {
+            "type": "number"
+        },
+        "minimum": {
+            "type": "number"
+        },
+        "exclusiveMinimum": {
+            "type": "number"
+        },
+        "maxLength": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minLength": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "pattern": {
+            "type": "string",
+            "format": "regex"
+        },
+        "additionalItems": { "$ref": "#" },
+        "items": {
+            "anyOf": [
+                { "$ref": "#" },
+                { "$ref": "#/definitions/schemaArray" }
+            ],
+            "default": {}
+        },
+        "maxItems": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minItems": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "uniqueItems": {
+            "type": "boolean",
+            "default": false
+        },
+        "contains": { "$ref": "#" },
+        "maxProperties": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minProperties": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "required": { "$ref": "#/definitions/stringArray" },
+        "additionalProperties": { "$ref": "#" },
+        "definitions": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "properties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "patternProperties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "dependencies": {
+            "type": "object",
+            "additionalProperties": {
+                "anyOf": [
+                    { "$ref": "#" },
+                    { "$ref": "#/definitions/stringArray" }
+                ]
+            }
+        },
+        "propertyNames": { "$ref": "#" },
+        "const": {},
+        "enum": {
+            "type": "array",
+            "minItems": 1,
+            "uniqueItems": true
+        },
+        "type": {
+            "anyOf": [
+                { "$ref": "#/definitions/simpleTypes" },
+                {
+                    "type": "array",
+                    "items": { "$ref": "#/definitions/simpleTypes" },
+                    "minItems": 1,
+                    "uniqueItems": true
+                }
+            ]
+        },
+        "format": { "type": "string" },
+        "allOf": { "$ref": "#/definitions/schemaArray" },
+        "anyOf": { "$ref": "#/definitions/schemaArray" },
+        "oneOf": { "$ref": "#/definitions/schemaArray" },
+        "not": { "$ref": "#" }
+    },
+    "default": {}
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-07.json b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-07.json
new file mode 100644
index 0000000..5bee90e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-draft-07.json
@@ -0,0 +1,168 @@
+{
+    "$schema": "http://json-schema.org/draft-07/schema#",
+    "$id": "http://json-schema.org/draft-07/schema#",
+    "title": "Core schema meta-schema",
+    "definitions": {
+        "schemaArray": {
+            "type": "array",
+            "minItems": 1,
+            "items": { "$ref": "#" }
+        },
+        "nonNegativeInteger": {
+            "type": "integer",
+            "minimum": 0
+        },
+        "nonNegativeIntegerDefault0": {
+            "allOf": [
+                { "$ref": "#/definitions/nonNegativeInteger" },
+                { "default": 0 }
+            ]
+        },
+        "simpleTypes": {
+            "enum": [
+                "array",
+                "boolean",
+                "integer",
+                "null",
+                "number",
+                "object",
+                "string"
+            ]
+        },
+        "stringArray": {
+            "type": "array",
+            "items": { "type": "string" },
+            "uniqueItems": true,
+            "default": []
+        }
+    },
+    "type": ["object", "boolean"],
+    "properties": {
+        "$id": {
+            "type": "string",
+            "format": "uri-reference"
+        },
+        "$schema": {
+            "type": "string",
+            "format": "uri"
+        },
+        "$ref": {
+            "type": "string",
+            "format": "uri-reference"
+        },
+        "$comment": {
+            "type": "string"
+        },
+        "title": {
+            "type": "string"
+        },
+        "description": {
+            "type": "string"
+        },
+        "default": true,
+        "readOnly": {
+            "type": "boolean",
+            "default": false
+        },
+        "examples": {
+            "type": "array",
+            "items": true
+        },
+        "multipleOf": {
+            "type": "number",
+            "exclusiveMinimum": 0
+        },
+        "maximum": {
+            "type": "number"
+        },
+        "exclusiveMaximum": {
+            "type": "number"
+        },
+        "minimum": {
+            "type": "number"
+        },
+        "exclusiveMinimum": {
+            "type": "number"
+        },
+        "maxLength": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minLength": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "pattern": {
+            "type": "string",
+            "format": "regex"
+        },
+        "additionalItems": { "$ref": "#" },
+        "items": {
+            "anyOf": [
+                { "$ref": "#" },
+                { "$ref": "#/definitions/schemaArray" }
+            ],
+            "default": true
+        },
+        "maxItems": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minItems": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "uniqueItems": {
+            "type": "boolean",
+            "default": false
+        },
+        "contains": { "$ref": "#" },
+        "maxProperties": { "$ref": "#/definitions/nonNegativeInteger" },
+        "minProperties": { "$ref": "#/definitions/nonNegativeIntegerDefault0" },
+        "required": { "$ref": "#/definitions/stringArray" },
+        "additionalProperties": { "$ref": "#" },
+        "definitions": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "properties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "default": {}
+        },
+        "patternProperties": {
+            "type": "object",
+            "additionalProperties": { "$ref": "#" },
+            "propertyNames": { "format": "regex" },
+            "default": {}
+        },
+        "dependencies": {
+            "type": "object",
+            "additionalProperties": {
+                "anyOf": [
+                    { "$ref": "#" },
+                    { "$ref": "#/definitions/stringArray" }
+                ]
+            }
+        },
+        "propertyNames": { "$ref": "#" },
+        "const": true,
+        "enum": {
+            "type": "array",
+            "items": true,
+            "minItems": 1,
+            "uniqueItems": true
+        },
+        "type": {
+            "anyOf": [
+                { "$ref": "#/definitions/simpleTypes" },
+                {
+                    "type": "array",
+                    "items": { "$ref": "#/definitions/simpleTypes" },
+                    "minItems": 1,
+                    "uniqueItems": true
+                }
+            ]
+        },
+        "format": { "type": "string" },
+        "contentMediaType": { "type": "string" },
+        "contentEncoding": { "type": "string" },
+        "if": {"$ref": "#"},
+        "then": {"$ref": "#"},
+        "else": {"$ref": "#"},
+        "allOf": { "$ref": "#/definitions/schemaArray" },
+        "anyOf": { "$ref": "#/definitions/schemaArray" },
+        "oneOf": { "$ref": "#/definitions/schemaArray" },
+        "not": { "$ref": "#" }
+    },
+    "default": true
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-secure.json b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-secure.json
new file mode 100644
index 0000000..0f7aad4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/lib/refs/json-schema-secure.json
@@ -0,0 +1,94 @@
+{
+  "$schema": "http://json-schema.org/draft-07/schema#",
+  "$id": "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/json-schema-secure.json#",
+  "title": "Meta-schema for the security assessment of JSON Schemas",
+  "description": "If a JSON Schema fails validation against this meta-schema, it may be unsafe to validate untrusted data",
+  "definitions": {
+    "schemaArray": {
+      "type": "array",
+      "minItems": 1,
+      "items": {"$ref": "#"}
+    }
+  },
+  "dependencies": {
+    "patternProperties": {
+      "description": "prevent slow validation of large property names",
+      "required": ["propertyNames"],
+      "properties": {
+        "propertyNames": {
+          "required": ["maxLength"]
+        }
+      }
+    },
+    "uniqueItems": {
+      "description": "prevent slow validation of large non-scalar arrays",
+      "if": {
+        "properties": {
+          "uniqueItems": {"const": true},
+          "items": {
+            "properties": {
+              "type": {
+                "anyOf": [
+                  {
+                    "enum": ["object", "array"]
+                  },
+                  {
+                    "type": "array",
+                    "contains": {"enum": ["object", "array"]}
+                  }
+                ]
+              }
+            }
+          }
+        }
+      },
+      "then": {
+        "required": ["maxItems"]
+      }
+    },
+    "pattern": {
+      "description": "prevent slow pattern matching of large strings",
+      "required": ["maxLength"]
+    },
+    "format": {
+      "description": "prevent slow format validation of large strings",
+      "required": ["maxLength"]
+    }
+  },
+  "properties": {
+    "additionalItems": {"$ref": "#"},
+    "additionalProperties": {"$ref": "#"},
+    "dependencies": {
+      "additionalProperties": {
+        "anyOf": [
+          {"type": "array"},
+          {"$ref": "#"}
+        ]
+      }
+    },
+    "items": {
+      "anyOf": [
+        {"$ref": "#"},
+        {"$ref": "#/definitions/schemaArray"}
+      ]
+    },
+    "definitions": {
+      "additionalProperties": {"$ref": "#"}
+    },
+    "patternProperties": {
+      "additionalProperties": {"$ref": "#"}
+    },
+    "properties": {
+      "additionalProperties": {"$ref": "#"}
+    },
+    "if": {"$ref": "#"},
+    "then": {"$ref": "#"},
+    "else": {"$ref": "#"},
+    "allOf": {"$ref": "#/definitions/schemaArray"},
+    "anyOf": {"$ref": "#/definitions/schemaArray"},
+    "oneOf": {"$ref": "#/definitions/schemaArray"},
+    "not": {"$ref": "#"},
+    "contains": {"$ref": "#"},
+    "propertyNames": {"$ref": "#"}
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/package.json b/node_modules/mathjs/examples/node_modules/ajv/package.json
new file mode 100644
index 0000000..559a933
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/package.json
@@ -0,0 +1,106 @@
+{
+  "name": "ajv",
+  "version": "6.12.6",
+  "description": "Another JSON Schema Validator",
+  "main": "lib/ajv.js",
+  "typings": "lib/ajv.d.ts",
+  "files": [
+    "lib/",
+    "dist/",
+    "scripts/",
+    "LICENSE",
+    ".tonic_example.js"
+  ],
+  "scripts": {
+    "eslint": "eslint lib/{compile/,}*.js spec/{**/,}*.js scripts --ignore-pattern spec/JSON-Schema-Test-Suite",
+    "jshint": "jshint lib/{compile/,}*.js",
+    "lint": "npm run jshint && npm run eslint",
+    "test-spec": "mocha spec/{**/,}*.spec.js -R spec",
+    "test-fast": "AJV_FAST_TEST=true npm run test-spec",
+    "test-debug": "npm run test-spec -- --inspect-brk",
+    "test-cov": "nyc npm run test-spec",
+    "test-ts": "tsc --target ES5 --noImplicitAny --noEmit spec/typescript/index.ts",
+    "bundle": "del-cli dist && node ./scripts/bundle.js . Ajv pure_getters",
+    "bundle-beautify": "node ./scripts/bundle.js js-beautify",
+    "build": "del-cli lib/dotjs/*.js \"!lib/dotjs/index.js\" && node scripts/compile-dots.js",
+    "test-karma": "karma start",
+    "test-browser": "del-cli .browser && npm run bundle && scripts/prepare-tests && npm run test-karma",
+    "test-all": "npm run test-cov && if-node-version 10 npm run test-browser",
+    "test": "npm run lint && npm run build && npm run test-all",
+    "prepublish": "npm run build && npm run bundle",
+    "watch": "watch \"npm run build\" ./lib/dot"
+  },
+  "nyc": {
+    "exclude": [
+      "**/spec/**",
+      "node_modules"
+    ],
+    "reporter": [
+      "lcov",
+      "text-summary"
+    ]
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/ajv-validator/ajv.git"
+  },
+  "keywords": [
+    "JSON",
+    "schema",
+    "validator",
+    "validation",
+    "jsonschema",
+    "json-schema",
+    "json-schema-validator",
+    "json-schema-validation"
+  ],
+  "author": "Evgeny Poberezkin",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/ajv-validator/ajv/issues"
+  },
+  "homepage": "https://github.com/ajv-validator/ajv",
+  "tonicExampleFilename": ".tonic_example.js",
+  "dependencies": {
+    "fast-deep-equal": "^3.1.1",
+    "fast-json-stable-stringify": "^2.0.0",
+    "json-schema-traverse": "^0.4.1",
+    "uri-js": "^4.2.2"
+  },
+  "devDependencies": {
+    "ajv-async": "^1.0.0",
+    "bluebird": "^3.5.3",
+    "brfs": "^2.0.0",
+    "browserify": "^16.2.0",
+    "chai": "^4.0.1",
+    "coveralls": "^3.0.1",
+    "del-cli": "^3.0.0",
+    "dot": "^1.0.3",
+    "eslint": "^7.3.1",
+    "gh-pages-generator": "^0.2.3",
+    "glob": "^7.0.0",
+    "if-node-version": "^1.0.0",
+    "js-beautify": "^1.7.3",
+    "jshint": "^2.10.2",
+    "json-schema-test": "^2.0.0",
+    "karma": "^5.0.0",
+    "karma-chrome-launcher": "^3.0.0",
+    "karma-mocha": "^2.0.0",
+    "karma-sauce-launcher": "^4.1.3",
+    "mocha": "^8.0.1",
+    "nyc": "^15.0.0",
+    "pre-commit": "^1.1.1",
+    "require-globify": "^1.3.0",
+    "typescript": "^3.9.5",
+    "uglify-js": "^3.6.9",
+    "watch": "^1.0.0"
+  },
+  "collective": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/ajv"
+  },
+  "funding": {
+    "type": "github",
+    "url": "https://github.com/sponsors/epoberezkin"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/ajv/scripts/.eslintrc.yml b/node_modules/mathjs/examples/node_modules/ajv/scripts/.eslintrc.yml
new file mode 100644
index 0000000..493d7d3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/scripts/.eslintrc.yml
@@ -0,0 +1,3 @@
+rules:
+  no-console: 0
+  no-empty: [2, allowEmptyCatch: true]
diff --git a/node_modules/mathjs/examples/node_modules/ajv/scripts/bundle.js b/node_modules/mathjs/examples/node_modules/ajv/scripts/bundle.js
new file mode 100644
index 0000000..e381a76
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/scripts/bundle.js
@@ -0,0 +1,61 @@
+'use strict';
+
+var fs = require('fs')
+  , path = require('path')
+  , browserify = require('browserify')
+  , uglify = require('uglify-js');
+
+var pkg = process.argv[2]
+  , standalone = process.argv[3]
+  , compress = process.argv[4];
+
+var packageDir = path.join(__dirname, '..');
+if (pkg != '.') packageDir = path.join(packageDir, 'node_modules', pkg);
+
+var json = require(path.join(packageDir, 'package.json'));
+
+var distDir = path.join(__dirname, '..', 'dist');
+if (!fs.existsSync(distDir)) fs.mkdirSync(distDir);
+
+var bOpts = {};
+if (standalone) bOpts.standalone = standalone;
+
+browserify(bOpts)
+.require(path.join(packageDir, json.main), {expose: json.name})
+.bundle(function (err, buf) {
+  if (err) {
+    console.error('browserify error:', err);
+    process.exit(1);
+  }
+
+  var outputFile = path.join(distDir, json.name);
+  var uglifyOpts = {
+    warnings: true,
+    compress: {},
+    output: {
+      preamble: '/* ' + json.name + ' ' + json.version + ': ' + json.description + ' */'
+    }
+  };
+  if (compress) {
+    var compressOpts = compress.split(',');
+    for (var i=0, il = compressOpts.length; i<il; ++i) {
+      var pair = compressOpts[i].split('=');
+      uglifyOpts.compress[pair[0]] = pair.length < 1 || pair[1] != 'false';
+    }
+  }
+  if (standalone) {
+    uglifyOpts.sourceMap = {
+      filename: json.name + '.min.js',
+      url: json.name + '.min.js.map'
+    };
+  }
+
+  var result = uglify.minify(buf.toString(), uglifyOpts);
+  fs.writeFileSync(outputFile + '.min.js', result.code);
+  if (result.map) fs.writeFileSync(outputFile + '.min.js.map', result.map);
+  if (standalone) fs.writeFileSync(outputFile + '.bundle.js', buf);
+  if (result.warnings) {
+    for (var j=0, jl = result.warnings.length; j<jl; ++j)
+      console.warn('UglifyJS warning:', result.warnings[j]);
+  }
+});
diff --git a/node_modules/mathjs/examples/node_modules/ajv/scripts/compile-dots.js b/node_modules/mathjs/examples/node_modules/ajv/scripts/compile-dots.js
new file mode 100644
index 0000000..5a21a7d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/scripts/compile-dots.js
@@ -0,0 +1,73 @@
+//compile doT templates to js functions
+'use strict';
+
+var glob = require('glob')
+  , fs = require('fs')
+  , path = require('path')
+  , doT = require('dot')
+  , beautify = require('js-beautify').js_beautify;
+
+var defsRootPath = process.argv[2] || path.join(__dirname, '../lib');
+
+var defs = {};
+var defFiles = glob.sync('./dot/**/*.def', { cwd: defsRootPath });
+defFiles.forEach(function (f) {
+  var name = path.basename(f, '.def');
+  defs[name] = fs.readFileSync(path.join(defsRootPath, f));
+});
+
+var filesRootPath = process.argv[3] || path.join(__dirname, '../lib');
+var files = glob.sync('./dot/**/*.jst', { cwd: filesRootPath });
+
+var dotjsPath = path.join(filesRootPath, './dotjs');
+try { fs.mkdirSync(dotjsPath); } catch(e) {}
+
+console.log('\n\nCompiling:');
+
+var FUNCTION_NAME = /function\s+anonymous\s*\(it[^)]*\)\s*{/;
+var OUT_EMPTY_STRING = /out\s*\+=\s*'\s*';/g;
+var ISTANBUL = /'(istanbul[^']+)';/g;
+var ERROR_KEYWORD = /\$errorKeyword/g;
+var ERROR_KEYWORD_OR = /\$errorKeyword\s+\|\|/g;
+var VARS = [
+  '$errs', '$valid', '$lvl', '$data', '$dataLvl',
+  '$errorKeyword', '$closingBraces', '$schemaPath',
+  '$validate'
+];
+
+files.forEach(function (f) {
+  var keyword = path.basename(f, '.jst');
+  var targetPath = path.join(dotjsPath, keyword + '.js');
+  var template = fs.readFileSync(path.join(filesRootPath, f));
+  var code = doT.compile(template, defs);
+  code = code.toString()
+             .replace(OUT_EMPTY_STRING, '')
+             .replace(FUNCTION_NAME, 'function generate_' + keyword + '(it, $keyword, $ruleType) {')
+             .replace(ISTANBUL, '/* $1 */');
+  removeAlwaysFalsyInOr();
+  VARS.forEach(removeUnusedVar);
+  code = "'use strict';\nmodule.exports = " + code;
+  code = beautify(code, { indent_size: 2 }) + '\n';
+  fs.writeFileSync(targetPath, code);
+  console.log('compiled', keyword);
+
+  function removeUnusedVar(v) {
+    v = v.replace(/\$/g, '\\$$');
+    var regexp = new RegExp(v + '[^A-Za-z0-9_$]', 'g');
+    var count = occurrences(regexp);
+    if (count == 1) {
+      regexp = new RegExp('var\\s+' + v + '\\s*=[^;]+;|var\\s+' + v + ';');
+      code = code.replace(regexp, '');
+    }
+  }
+
+  function removeAlwaysFalsyInOr() {
+    var countUsed = occurrences(ERROR_KEYWORD);
+    var countOr = occurrences(ERROR_KEYWORD_OR);
+    if (countUsed == countOr + 1) code = code.replace(ERROR_KEYWORD_OR, '');
+  }
+
+  function occurrences(regexp) {
+    return (code.match(regexp) || []).length;
+  }
+});
diff --git a/node_modules/mathjs/examples/node_modules/ajv/scripts/info b/node_modules/mathjs/examples/node_modules/ajv/scripts/info
new file mode 100644
index 0000000..77269ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/scripts/info
@@ -0,0 +1,10 @@
+#!/usr/bin/env node
+
+'use strict';
+
+var fs = require('fs');
+var name = process.argv[2] || '.';
+var property = process.argv[3] || 'version';
+if (name != '.') name = 'node_modules/' + name;
+var json = JSON.parse(fs.readFileSync(name + '/package.json', 'utf8'));
+console.log(json[property]);
diff --git a/node_modules/mathjs/examples/node_modules/ajv/scripts/prepare-tests b/node_modules/mathjs/examples/node_modules/ajv/scripts/prepare-tests
new file mode 100644
index 0000000..6847033
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/scripts/prepare-tests
@@ -0,0 +1,12 @@
+#!/usr/bin/env sh
+
+set -e
+
+mkdir -p .browser
+
+echo
+echo Preparing browser tests:
+
+find spec -type f -name '*.spec.js' | \
+xargs -I {} sh -c \
+'export f="{}"; echo $f; browserify $f -t require-globify -t brfs -x ajv -u buffer -o $(echo $f | sed -e "s/spec/.browser/");'
diff --git a/node_modules/mathjs/examples/node_modules/ajv/scripts/publish-built-version b/node_modules/mathjs/examples/node_modules/ajv/scripts/publish-built-version
new file mode 100644
index 0000000..1b57123
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/scripts/publish-built-version
@@ -0,0 +1,32 @@
+#!/usr/bin/env bash
+
+set -e
+
+if [[ -n $TRAVIS_TAG && $TRAVIS_JOB_NUMBER =~ ".3" ]]; then
+  echo "About to publish $TRAVIS_TAG to ajv-dist..."
+
+  git config user.email "$GIT_USER_EMAIL"
+  git config user.name "$GIT_USER_NAME"
+
+  git clone https://${GITHUB_TOKEN}@github.com/ajv-validator/ajv-dist.git ../ajv-dist
+
+  rm -rf ../ajv-dist/dist
+  mkdir ../ajv-dist/dist
+  cp ./dist/ajv.* ../ajv-dist/dist
+  cat bower.json | sed 's/"name": "ajv"/"name": "ajv-dist"/' > ../ajv-dist/bower.json
+  cd ../ajv-dist
+
+  if [[ `git status --porcelain` ]]; then
+    echo "Changes detected. Updating master branch..."
+    git add -A
+    git commit -m "updated by travis build #$TRAVIS_BUILD_NUMBER"
+    git push --quiet origin master > /dev/null 2>&1
+  fi
+
+  echo "Publishing tag..."
+
+  git tag $TRAVIS_TAG
+  git push --tags > /dev/null 2>&1
+
+  echo "Done"
+fi
diff --git a/node_modules/mathjs/examples/node_modules/ajv/scripts/travis-gh-pages b/node_modules/mathjs/examples/node_modules/ajv/scripts/travis-gh-pages
new file mode 100644
index 0000000..b3d4f3d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/ajv/scripts/travis-gh-pages
@@ -0,0 +1,23 @@
+#!/usr/bin/env bash
+
+set -e
+
+if [[ "$TRAVIS_BRANCH" == "master" && "$TRAVIS_PULL_REQUEST" == "false" && $TRAVIS_JOB_NUMBER =~ ".3" ]]; then
+  git diff --name-only $TRAVIS_COMMIT_RANGE | grep -qE '\.md$|^LICENSE$|travis-gh-pages$' && {
+    rm -rf ../gh-pages
+    git clone -b gh-pages --single-branch https://${GITHUB_TOKEN}@github.com/ajv-validator/ajv.git ../gh-pages
+    mkdir -p ../gh-pages/_source
+    cp *.md ../gh-pages/_source
+    cp LICENSE ../gh-pages/_source
+    currentDir=$(pwd)
+    cd ../gh-pages
+    $currentDir/node_modules/.bin/gh-pages-generator
+    # remove logo from README
+    sed -i -E "s/<img[^>]+ajv_logo[^>]+>//" index.md
+    git config user.email "$GIT_USER_EMAIL"
+    git config user.name "$GIT_USER_NAME"
+    git add .
+    git commit -am "updated by travis build #$TRAVIS_BUILD_NUMBER"
+    git push --quiet origin gh-pages > /dev/null 2>&1
+  }
+fi
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/LICENSE b/node_modules/mathjs/examples/node_modules/browserslist/LICENSE
new file mode 100644
index 0000000..90b6b91
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/LICENSE
@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright 2014 Andrey Sitnik <andrey@sitnik.ru> and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/README.md b/node_modules/mathjs/examples/node_modules/browserslist/README.md
new file mode 100644
index 0000000..b1cde15
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/README.md
@@ -0,0 +1,66 @@
+# Browserslist [![Cult Of Martians][cult-img]][cult]
+
+<img width="120" height="120" alt="Browserslist logo by Anton Lovchikov"
+     src="https://browserslist.github.io/browserslist/logo.svg" align="right">
+
+The config to share target browsers and Node.js versions between different
+front-end tools. It is used in:
+
+* [Autoprefixer]
+* [Babel]
+* [postcss-preset-env]
+* [eslint-plugin-compat]
+* [stylelint-no-unsupported-browser-features]
+* [postcss-normalize]
+* [obsolete-webpack-plugin]
+
+All tools will find target browsers automatically,
+when you add the following to `package.json`:
+
+```json
+  "browserslist": [
+    "defaults",
+    "not IE 11",
+    "maintained node versions"
+  ]
+```
+
+Or in `.browserslistrc` config:
+
+```yaml
+# Browsers that we support
+
+defaults
+not IE 11
+maintained node versions
+```
+
+Developers set their version lists using queries like `last 2 versions`
+to be free from updating versions manually.
+Browserslist will use [`caniuse-lite`] with [Can I Use] data for this queries.
+
+Browserslist will take queries from tool option,
+`browserslist` config, `.browserslistrc` config,
+`browserslist` section in `package.json` or environment variables.
+
+[cult-img]: https://cultofmartians.com/assets/badges/badge.svg
+[cult]: https://cultofmartians.com/done.html
+
+<a href="https://evilmartians.com/?utm_source=browserslist">
+  <img src="https://evilmartians.com/badges/sponsored-by-evil-martians.svg"
+       alt="Sponsored by Evil Martians" width="236" height="54">
+</a>
+
+[stylelint-no-unsupported-browser-features]: https://github.com/ismay/stylelint-no-unsupported-browser-features
+[eslint-plugin-compat]:                      https://github.com/amilajack/eslint-plugin-compat
+[Browserslist Example]:                      https://github.com/browserslist/browserslist-example
+[postcss-preset-env]:                        https://github.com/jonathantneal/postcss-preset-env
+[postcss-normalize]:                         https://github.com/jonathantneal/postcss-normalize
+[`caniuse-lite`]:                            https://github.com/ben-eb/caniuse-lite
+[Autoprefixer]:                              https://github.com/postcss/autoprefixer
+[Can I Use]:                                 https://caniuse.com/
+[Babel]:                                     https://github.com/babel/babel/tree/master/packages/babel-preset-env
+[obsolete-webpack-plugin]:                   https://github.com/ElemeFE/obsolete-webpack-plugin
+
+## Docs
+Read **[full docs](https://github.com/browserslist/browserslist#readme)** on GitHub.
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/browser.js b/node_modules/mathjs/examples/node_modules/browserslist/browser.js
new file mode 100644
index 0000000..4e9d8de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/browser.js
@@ -0,0 +1,50 @@
+var BrowserslistError = require('./error')
+
+function noop() {}
+
+module.exports = {
+  loadQueries: function loadQueries() {
+    throw new BrowserslistError(
+      'Sharable configs are not supported in client-side build of Browserslist'
+    )
+  },
+
+  getStat: function getStat(opts) {
+    return opts.stats
+  },
+
+  loadConfig: function loadConfig(opts) {
+    if (opts.config) {
+      throw new BrowserslistError(
+        'Browserslist config are not supported in client-side build'
+      )
+    }
+  },
+
+  loadCountry: function loadCountry() {
+    throw new BrowserslistError(
+      'Country statistics are not supported ' +
+        'in client-side build of Browserslist'
+    )
+  },
+
+  loadFeature: function loadFeature() {
+    throw new BrowserslistError(
+      'Supports queries are not available in client-side build of Browserslist'
+    )
+  },
+
+  currentNode: function currentNode(resolve, context) {
+    return resolve(['maintained node versions'], context)[0]
+  },
+
+  parseConfig: noop,
+
+  readConfig: noop,
+
+  findConfig: noop,
+
+  clearCaches: noop,
+
+  oldDataWarning: noop
+}
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/cli.js b/node_modules/mathjs/examples/node_modules/browserslist/cli.js
new file mode 100644
index 0000000..e4a7076
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/cli.js
@@ -0,0 +1,152 @@
+#!/usr/bin/env node
+
+var fs = require('fs')
+
+var browserslist = require('./')
+var updateDb = require('./update-db')
+var pkg = require('./package.json')
+
+var args = process.argv.slice(2)
+
+var USAGE =
+  'Usage:\n' +
+  '  npx browserslist\n' +
+  '  npx browserslist "QUERIES"\n' +
+  '  npx browserslist --json "QUERIES"\n' +
+  '  npx browserslist --config="path/to/browserlist/file"\n' +
+  '  npx browserslist --coverage "QUERIES"\n' +
+  '  npx browserslist --coverage=US "QUERIES"\n' +
+  '  npx browserslist --coverage=US,RU,global "QUERIES"\n' +
+  '  npx browserslist --env="environment name defined in config"\n' +
+  '  npx browserslist --stats="path/to/browserlist/stats/file"\n' +
+  '  npx browserslist --mobile-to-desktop\n' +
+  '  npx browserslist --ignore-unknown-versions\n' +
+  '  npx browserslist --update-db'
+
+function isArg(arg) {
+  return args.some(function (str) {
+    return str === arg || str.indexOf(arg + '=') === 0
+  })
+}
+
+function error(msg) {
+  process.stderr.write('browserslist: ' + msg + '\n')
+  process.exit(1)
+}
+
+if (isArg('--help') || isArg('-h')) {
+  process.stdout.write(pkg.description + '.\n\n' + USAGE + '\n')
+} else if (isArg('--version') || isArg('-v')) {
+  process.stdout.write('browserslist ' + pkg.version + '\n')
+} else if (isArg('--update-db')) {
+  /* c8 ignore next 3 */
+  updateDb(function (str) {
+    process.stdout.write(str)
+  })
+} else {
+  var mode = 'browsers'
+  var opts = {}
+  var queries
+  var areas
+
+  for (var i = 0; i < args.length; i++) {
+    if (args[i][0] !== '-') {
+      queries = args[i].replace(/^["']|["']$/g, '')
+      continue
+    }
+
+    var arg = args[i].split('=')
+    var name = arg[0]
+    var value = arg[1]
+
+    if (value) value = value.replace(/^["']|["']$/g, '')
+
+    if (name === '--config' || name === '-b') {
+      opts.config = value
+    } else if (name === '--env' || name === '-e') {
+      opts.env = value
+    } else if (name === '--stats' || name === '-s') {
+      opts.stats = value
+    } else if (name === '--coverage' || name === '-c') {
+      if (mode !== 'json') mode = 'coverage'
+      if (value) {
+        areas = value.split(',')
+      } else {
+        areas = ['global']
+      }
+    } else if (name === '--json') {
+      mode = 'json'
+    } else if (name === '--mobile-to-desktop') {
+      /* c8 ignore next */
+      opts.mobileToDesktop = true
+    } else if (name === '--ignore-unknown-versions') {
+      /* c8 ignore next */
+      opts.ignoreUnknownVersions = true
+    } else {
+      error('Unknown arguments ' + args[i] + '.\n\n' + USAGE)
+    }
+  }
+
+  var browsers
+  try {
+    browsers = browserslist(queries, opts)
+  } catch (e) {
+    if (e.name === 'BrowserslistError') {
+      error(e.message)
+    } else /* c8 ignore start */ {
+      throw e
+    } /* c8 ignore end */
+  }
+
+  var coverage
+  if (mode === 'browsers') {
+    browsers.forEach(function (browser) {
+      process.stdout.write(browser + '\n')
+    })
+  } else if (areas) {
+    coverage = areas.map(function (area) {
+      var stats
+      if (area !== 'global') {
+        stats = area
+      } else if (opts.stats) {
+        stats = JSON.parse(fs.readFileSync(opts.stats))
+      }
+      var result = browserslist.coverage(browsers, stats)
+      var round = Math.round(result * 100) / 100.0
+
+      return [area, round]
+    })
+
+    if (mode === 'coverage') {
+      var prefix = 'These browsers account for '
+      process.stdout.write(prefix)
+      coverage.forEach(function (data, index) {
+        var area = data[0]
+        var round = data[1]
+        var end = 'globally'
+        if (area && area !== 'global') {
+          end = 'in the ' + area.toUpperCase()
+        } else if (opts.stats) {
+          end = 'in custom statistics'
+        }
+
+        if (index !== 0) {
+          process.stdout.write(prefix.replace(/./g, ' '))
+        }
+
+        process.stdout.write(round + '% of all users ' + end + '\n')
+      })
+    }
+  }
+
+  if (mode === 'json') {
+    var data = { browsers: browsers }
+    if (coverage) {
+      data.coverage = coverage.reduce(function (object, j) {
+        object[j[0]] = j[1]
+        return object
+      }, {})
+    }
+    process.stdout.write(JSON.stringify(data, null, '  ') + '\n')
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/error.d.ts b/node_modules/mathjs/examples/node_modules/browserslist/error.d.ts
new file mode 100644
index 0000000..12ff921
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/error.d.ts
@@ -0,0 +1,7 @@
+declare class BrowserslistError extends Error {
+  constructor(message: any)
+  name: 'BrowserslistError'
+  browserslist: true
+}
+
+export = BrowserslistError
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/error.js b/node_modules/mathjs/examples/node_modules/browserslist/error.js
new file mode 100644
index 0000000..6e5da7a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/error.js
@@ -0,0 +1,12 @@
+function BrowserslistError(message) {
+  this.name = 'BrowserslistError'
+  this.message = message
+  this.browserslist = true
+  if (Error.captureStackTrace) {
+    Error.captureStackTrace(this, BrowserslistError)
+  }
+}
+
+BrowserslistError.prototype = Error.prototype
+
+module.exports = BrowserslistError
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/index.d.ts b/node_modules/mathjs/examples/node_modules/browserslist/index.d.ts
new file mode 100644
index 0000000..bea4270
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/index.d.ts
@@ -0,0 +1,178 @@
+/**
+ * Return array of browsers by selection queries.
+ *
+ * ```js
+ * browserslist('IE >= 10, IE 8') //=> ['ie 11', 'ie 10', 'ie 8']
+ * ```
+ *
+ * @param queries Browser queries.
+ * @returns Array with browser names in Can I Use.
+ */
+declare function browserslist(
+  queries?: string | readonly string[] | null,
+  opts?: browserslist.Options
+): string[]
+
+declare namespace browserslist {
+  interface Options {
+    /**
+     * Path to processed file. It will be used to find config files.
+     */
+    path?: string | false
+    /**
+     * Processing environment. It will be used to take right queries
+     * from config file.
+     */
+    env?: string
+    /**
+     * Custom browser usage statistics for "> 1% in my stats" query.
+     */
+    stats?: Stats | string
+    /**
+     * Path to config file with queries.
+     */
+    config?: string
+    /**
+     * Do not throw on unknown version in direct query.
+     */
+    ignoreUnknownVersions?: boolean
+    /**
+     * Throw a error if env is not found.
+     */
+    throwOnMissing?: boolean
+    /**
+     * Disable security checks for extend query.
+     */
+    dangerousExtend?: boolean
+    /**
+     * Alias mobile browsers to the desktop version when Can I Use
+     * doesn’t have data about the specified version.
+     */
+    mobileToDesktop?: boolean
+  }
+
+  type Config = {
+    defaults: string[]
+    [section: string]: string[] | undefined
+  }
+
+  interface Stats {
+    [browser: string]: {
+      [version: string]: number
+    }
+  }
+
+  /**
+   * Browser names aliases.
+   */
+  let aliases: {
+    [alias: string]: string | undefined
+  }
+
+  /**
+   * Aliases to work with joined versions like `ios_saf 7.0-7.1`.
+   */
+  let versionAliases: {
+    [browser: string]:
+      | {
+          [version: string]: string | undefined
+        }
+      | undefined
+  }
+
+  /**
+   * Can I Use only provides a few versions for some browsers (e.g. `and_chr`).
+   *
+   * Fallback to a similar browser for unknown versions.
+   */
+  let desktopNames: {
+    [browser: string]: string | undefined
+  }
+
+  let data: {
+    [browser: string]:
+      | {
+          name: string
+          versions: string[]
+          released: string[]
+          releaseDate: {
+            [version: string]: number | undefined | null
+          }
+        }
+      | undefined
+  }
+
+  let nodeVersions: string[]
+
+  interface Usage {
+    [version: string]: number
+  }
+
+  let usage: {
+    global?: Usage
+    custom?: Usage | null
+    [country: string]: Usage | undefined | null
+  }
+
+  let cache: {
+    [feature: string]: {
+      [name: string]: 'y' | 'n'
+    }
+  }
+
+  /**
+   * Default browsers query
+   */
+  let defaults: readonly string[]
+
+  /**
+   * Which statistics should be used. Country code or custom statistics.
+   * Pass `"my stats"` to load statistics from `Browserslist` files.
+   */
+  type StatsOptions = string | 'my stats' | Stats | { dataByBrowser: Stats }
+
+  /**
+   * Return browsers market coverage.
+   *
+   * ```js
+   * browserslist.coverage(browserslist('> 1% in US'), 'US') //=> 83.1
+   * ```
+   *
+   * @param browsers Browsers names in Can I Use.
+   * @param stats Which statistics should be used.
+   * @returns Total market coverage for all selected browsers.
+   */
+  function coverage(browsers: readonly string[], stats?: StatsOptions): number
+
+  function clearCaches(): void
+
+  function parseConfig(string: string): Config
+
+  function readConfig(file: string): Config
+
+  function findConfig(...pathSegments: string[]): Config | undefined
+
+  interface LoadConfigOptions {
+    config?: string
+    path?: string
+    env?: string
+  }
+
+  function loadConfig(options: LoadConfigOptions): string[] | undefined
+}
+
+declare global {
+  namespace NodeJS {
+    interface ProcessEnv {
+      BROWSERSLIST?: string
+      BROWSERSLIST_CONFIG?: string
+      BROWSERSLIST_DANGEROUS_EXTEND?: string
+      BROWSERSLIST_DISABLE_CACHE?: string
+      BROWSERSLIST_ENV?: string
+      BROWSERSLIST_IGNORE_OLD_DATA?: string
+      BROWSERSLIST_STATS?: string
+    }
+  }
+}
+
+export = browserslist
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/index.js b/node_modules/mathjs/examples/node_modules/browserslist/index.js
new file mode 100644
index 0000000..8c09141
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/index.js
@@ -0,0 +1,1235 @@
+var jsReleases = require('node-releases/data/processed/envs.json')
+var agents = require('caniuse-lite/dist/unpacker/agents').agents
+var jsEOL = require('node-releases/data/release-schedule/release-schedule.json')
+var path = require('path')
+var e2c = require('electron-to-chromium/versions')
+
+var BrowserslistError = require('./error')
+var env = require('./node') // Will load browser.js in webpack
+
+var YEAR = 365.259641 * 24 * 60 * 60 * 1000
+var ANDROID_EVERGREEN_FIRST = 37
+
+var QUERY_OR = 1
+var QUERY_AND = 2
+
+function isVersionsMatch(versionA, versionB) {
+  return (versionA + '.').indexOf(versionB + '.') === 0
+}
+
+function isEolReleased(name) {
+  var version = name.slice(1)
+  return browserslist.nodeVersions.some(function (i) {
+    return isVersionsMatch(i, version)
+  })
+}
+
+function normalize(versions) {
+  return versions.filter(function (version) {
+    return typeof version === 'string'
+  })
+}
+
+function normalizeElectron(version) {
+  var versionToUse = version
+  if (version.split('.').length === 3) {
+    versionToUse = version.split('.').slice(0, -1).join('.')
+  }
+  return versionToUse
+}
+
+function nameMapper(name) {
+  return function mapName(version) {
+    return name + ' ' + version
+  }
+}
+
+function getMajor(version) {
+  return parseInt(version.split('.')[0])
+}
+
+function getMajorVersions(released, number) {
+  if (released.length === 0) return []
+  var majorVersions = uniq(released.map(getMajor))
+  var minimum = majorVersions[majorVersions.length - number]
+  if (!minimum) {
+    return released
+  }
+  var selected = []
+  for (var i = released.length - 1; i >= 0; i--) {
+    if (minimum > getMajor(released[i])) break
+    selected.unshift(released[i])
+  }
+  return selected
+}
+
+function uniq(array) {
+  var filtered = []
+  for (var i = 0; i < array.length; i++) {
+    if (filtered.indexOf(array[i]) === -1) filtered.push(array[i])
+  }
+  return filtered
+}
+
+// Helpers
+
+function fillUsage(result, name, data) {
+  for (var i in data) {
+    result[name + ' ' + i] = data[i]
+  }
+}
+
+function generateFilter(sign, version) {
+  version = parseFloat(version)
+  if (sign === '>') {
+    return function (v) {
+      return parseFloat(v) > version
+    }
+  } else if (sign === '>=') {
+    return function (v) {
+      return parseFloat(v) >= version
+    }
+  } else if (sign === '<') {
+    return function (v) {
+      return parseFloat(v) < version
+    }
+  } else {
+    return function (v) {
+      return parseFloat(v) <= version
+    }
+  }
+}
+
+function generateSemverFilter(sign, version) {
+  version = version.split('.').map(parseSimpleInt)
+  version[1] = version[1] || 0
+  version[2] = version[2] || 0
+  if (sign === '>') {
+    return function (v) {
+      v = v.split('.').map(parseSimpleInt)
+      return compareSemver(v, version) > 0
+    }
+  } else if (sign === '>=') {
+    return function (v) {
+      v = v.split('.').map(parseSimpleInt)
+      return compareSemver(v, version) >= 0
+    }
+  } else if (sign === '<') {
+    return function (v) {
+      v = v.split('.').map(parseSimpleInt)
+      return compareSemver(version, v) > 0
+    }
+  } else {
+    return function (v) {
+      v = v.split('.').map(parseSimpleInt)
+      return compareSemver(version, v) >= 0
+    }
+  }
+}
+
+function parseSimpleInt(x) {
+  return parseInt(x)
+}
+
+function compare(a, b) {
+  if (a < b) return -1
+  if (a > b) return +1
+  return 0
+}
+
+function compareSemver(a, b) {
+  return (
+    compare(parseInt(a[0]), parseInt(b[0])) ||
+    compare(parseInt(a[1] || '0'), parseInt(b[1] || '0')) ||
+    compare(parseInt(a[2] || '0'), parseInt(b[2] || '0'))
+  )
+}
+
+// this follows the npm-like semver behavior
+function semverFilterLoose(operator, range) {
+  range = range.split('.').map(parseSimpleInt)
+  if (typeof range[1] === 'undefined') {
+    range[1] = 'x'
+  }
+  // ignore any patch version because we only return minor versions
+  // range[2] = 'x'
+  switch (operator) {
+    case '<=':
+      return function (version) {
+        version = version.split('.').map(parseSimpleInt)
+        return compareSemverLoose(version, range) <= 0
+      }
+    case '>=':
+    default:
+      return function (version) {
+        version = version.split('.').map(parseSimpleInt)
+        return compareSemverLoose(version, range) >= 0
+      }
+  }
+}
+
+// this follows the npm-like semver behavior
+function compareSemverLoose(version, range) {
+  if (version[0] !== range[0]) {
+    return version[0] < range[0] ? -1 : +1
+  }
+  if (range[1] === 'x') {
+    return 0
+  }
+  if (version[1] !== range[1]) {
+    return version[1] < range[1] ? -1 : +1
+  }
+  return 0
+}
+
+function resolveVersion(data, version) {
+  if (data.versions.indexOf(version) !== -1) {
+    return version
+  } else if (browserslist.versionAliases[data.name][version]) {
+    return browserslist.versionAliases[data.name][version]
+  } else {
+    return false
+  }
+}
+
+function normalizeVersion(data, version) {
+  var resolved = resolveVersion(data, version)
+  if (resolved) {
+    return resolved
+  } else if (data.versions.length === 1) {
+    return data.versions[0]
+  } else {
+    return false
+  }
+}
+
+function filterByYear(since, context) {
+  since = since / 1000
+  return Object.keys(agents).reduce(function (selected, name) {
+    var data = byName(name, context)
+    if (!data) return selected
+    var versions = Object.keys(data.releaseDate).filter(function (v) {
+      var date = data.releaseDate[v]
+      return date !== null && date >= since
+    })
+    return selected.concat(versions.map(nameMapper(data.name)))
+  }, [])
+}
+
+function cloneData(data) {
+  return {
+    name: data.name,
+    versions: data.versions,
+    released: data.released,
+    releaseDate: data.releaseDate
+  }
+}
+
+function mapVersions(data, map) {
+  data.versions = data.versions.map(function (i) {
+    return map[i] || i
+  })
+  data.released = data.versions.map(function (i) {
+    return map[i] || i
+  })
+  var fixedDate = {}
+  for (var i in data.releaseDate) {
+    fixedDate[map[i] || i] = data.releaseDate[i]
+  }
+  data.releaseDate = fixedDate
+  return data
+}
+
+function byName(name, context) {
+  name = name.toLowerCase()
+  name = browserslist.aliases[name] || name
+  if (context.mobileToDesktop && browserslist.desktopNames[name]) {
+    var desktop = browserslist.data[browserslist.desktopNames[name]]
+    if (name === 'android') {
+      return normalizeAndroidData(cloneData(browserslist.data[name]), desktop)
+    } else {
+      var cloned = cloneData(desktop)
+      cloned.name = name
+      if (name === 'op_mob') {
+        cloned = mapVersions(cloned, { '10.0-10.1': '10' })
+      }
+      return cloned
+    }
+  }
+  return browserslist.data[name]
+}
+
+function normalizeAndroidVersions(androidVersions, chromeVersions) {
+  var firstEvergreen = ANDROID_EVERGREEN_FIRST
+  var last = chromeVersions[chromeVersions.length - 1]
+  return androidVersions
+    .filter(function (version) {
+      return /^(?:[2-4]\.|[34]$)/.test(version)
+    })
+    .concat(chromeVersions.slice(firstEvergreen - last - 1))
+}
+
+function normalizeAndroidData(android, chrome) {
+  android.released = normalizeAndroidVersions(android.released, chrome.released)
+  android.versions = normalizeAndroidVersions(android.versions, chrome.versions)
+  return android
+}
+
+function checkName(name, context) {
+  var data = byName(name, context)
+  if (!data) throw new BrowserslistError('Unknown browser ' + name)
+  return data
+}
+
+function unknownQuery(query) {
+  return new BrowserslistError(
+    'Unknown browser query `' +
+      query +
+      '`. ' +
+      'Maybe you are using old Browserslist or made typo in query.'
+  )
+}
+
+function filterAndroid(list, versions, context) {
+  if (context.mobileToDesktop) return list
+  var released = browserslist.data.android.released
+  var last = released[released.length - 1]
+  var diff = last - ANDROID_EVERGREEN_FIRST - versions
+  if (diff > 0) {
+    return list.slice(-1)
+  } else {
+    return list.slice(diff - 1)
+  }
+}
+
+/**
+ * Resolves queries into a browser list.
+ * @param {string|string[]} queries Queries to combine.
+ * Either an array of queries or a long string of queries.
+ * @param {object} [context] Optional arguments to
+ * the select function in `queries`.
+ * @returns {string[]} A list of browsers
+ */
+function resolve(queries, context) {
+  if (Array.isArray(queries)) {
+    queries = flatten(queries.map(parse))
+  } else {
+    queries = parse(queries)
+  }
+
+  return queries.reduce(function (result, query, index) {
+    var selection = query.queryString
+
+    var isExclude = selection.indexOf('not ') === 0
+    if (isExclude) {
+      if (index === 0) {
+        throw new BrowserslistError(
+          'Write any browsers query (for instance, `defaults`) ' +
+            'before `' +
+            selection +
+            '`'
+        )
+      }
+      selection = selection.slice(4)
+    }
+
+    for (var i = 0; i < QUERIES.length; i++) {
+      var type = QUERIES[i]
+      var match = selection.match(type.regexp)
+      if (match) {
+        var args = [context].concat(match.slice(1))
+        var array = type.select.apply(browserslist, args).map(function (j) {
+          var parts = j.split(' ')
+          if (parts[1] === '0') {
+            return parts[0] + ' ' + byName(parts[0], context).versions[0]
+          } else {
+            return j
+          }
+        })
+
+        switch (query.type) {
+          case QUERY_AND:
+            if (isExclude) {
+              return result.filter(function (j) {
+                return array.indexOf(j) === -1
+              })
+            } else {
+              return result.filter(function (j) {
+                return array.indexOf(j) !== -1
+              })
+            }
+          case QUERY_OR:
+          default:
+            if (isExclude) {
+              var filter = {}
+              array.forEach(function (j) {
+                filter[j] = true
+              })
+              return result.filter(function (j) {
+                return !filter[j]
+              })
+            }
+            return result.concat(array)
+        }
+      }
+    }
+
+    throw unknownQuery(selection)
+  }, [])
+}
+
+var cache = {}
+
+/**
+ * Return array of browsers by selection queries.
+ *
+ * @param {(string|string[])} [queries=browserslist.defaults] Browser queries.
+ * @param {object} [opts] Options.
+ * @param {string} [opts.path="."] Path to processed file.
+ *                                 It will be used to find config files.
+ * @param {string} [opts.env="production"] Processing environment.
+ *                                         It will be used to take right
+ *                                         queries from config file.
+ * @param {string} [opts.config] Path to config file with queries.
+ * @param {object} [opts.stats] Custom browser usage statistics
+ *                              for "> 1% in my stats" query.
+ * @param {boolean} [opts.ignoreUnknownVersions=false] Do not throw on unknown
+ *                                                     version in direct query.
+ * @param {boolean} [opts.dangerousExtend] Disable security checks
+ *                                         for extend query.
+ * @param {boolean} [opts.throwOnMissing] Throw error on missing env.
+ * @param {boolean} [opts.mobileToDesktop] Alias mobile browsers to the desktop
+ *                                         version when Can I Use doesn't have
+ *                                         data about the specified version.
+ * @returns {string[]} Array with browser names in Can I Use.
+ *
+ * @example
+ * browserslist('IE >= 10, IE 8') //=> ['ie 11', 'ie 10', 'ie 8']
+ */
+function browserslist(queries, opts) {
+  if (typeof opts === 'undefined') opts = {}
+
+  if (typeof opts.path === 'undefined') {
+    opts.path = path.resolve ? path.resolve('.') : '.'
+  }
+
+  if (typeof queries === 'undefined' || queries === null) {
+    var config = browserslist.loadConfig(opts)
+    if (config) {
+      queries = config
+    } else {
+      queries = browserslist.defaults
+    }
+  }
+
+  if (!(typeof queries === 'string' || Array.isArray(queries))) {
+    throw new BrowserslistError(
+      'Browser queries must be an array or string. Got ' + typeof queries + '.'
+    )
+  }
+
+  var context = {
+    ignoreUnknownVersions: opts.ignoreUnknownVersions,
+    dangerousExtend: opts.dangerousExtend,
+    mobileToDesktop: opts.mobileToDesktop,
+    path: opts.path,
+    env: opts.env
+  }
+
+  env.oldDataWarning(browserslist.data)
+  var stats = env.getStat(opts, browserslist.data)
+  if (stats) {
+    context.customUsage = {}
+    for (var browser in stats) {
+      fillUsage(context.customUsage, browser, stats[browser])
+    }
+  }
+
+  var cacheKey = JSON.stringify([queries, context])
+  if (cache[cacheKey]) return cache[cacheKey]
+
+  var result = uniq(resolve(queries, context)).sort(function (name1, name2) {
+    name1 = name1.split(' ')
+    name2 = name2.split(' ')
+    if (name1[0] === name2[0]) {
+      // assumptions on caniuse data
+      // 1) version ranges never overlaps
+      // 2) if version is not a range, it never contains `-`
+      var version1 = name1[1].split('-')[0]
+      var version2 = name2[1].split('-')[0]
+      return compareSemver(version2.split('.'), version1.split('.'))
+    } else {
+      return compare(name1[0], name2[0])
+    }
+  })
+  if (!process.env.BROWSERSLIST_DISABLE_CACHE) {
+    cache[cacheKey] = result
+  }
+  return result
+}
+
+function parse(queries) {
+  var qs = []
+  do {
+    queries = doMatch(queries, qs)
+  } while (queries)
+  return qs
+}
+
+function doMatch(string, qs) {
+  var or = /^(?:,\s*|\s+or\s+)(.*)/i
+  var and = /^\s+and\s+(.*)/i
+
+  return find(string, function (parsed, n, max) {
+    if (and.test(parsed)) {
+      qs.unshift({ type: QUERY_AND, queryString: parsed.match(and)[1] })
+      return true
+    } else if (or.test(parsed)) {
+      qs.unshift({ type: QUERY_OR, queryString: parsed.match(or)[1] })
+      return true
+    } else if (n === max) {
+      qs.unshift({ type: QUERY_OR, queryString: parsed.trim() })
+      return true
+    }
+    return false
+  })
+}
+
+function find(string, predicate) {
+  for (var n = 1, max = string.length; n <= max; n++) {
+    var parsed = string.substr(-n, n)
+    if (predicate(parsed, n, max)) {
+      return string.slice(0, -n)
+    }
+  }
+  return ''
+}
+
+function flatten(array) {
+  if (!Array.isArray(array)) return [array]
+  return array.reduce(function (a, b) {
+    return a.concat(flatten(b))
+  }, [])
+}
+
+// Will be filled by Can I Use data below
+browserslist.cache = {}
+browserslist.data = {}
+browserslist.usage = {
+  global: {},
+  custom: null
+}
+
+// Default browsers query
+browserslist.defaults = ['> 0.5%', 'last 2 versions', 'Firefox ESR', 'not dead']
+
+// Browser names aliases
+browserslist.aliases = {
+  fx: 'firefox',
+  ff: 'firefox',
+  ios: 'ios_saf',
+  explorer: 'ie',
+  blackberry: 'bb',
+  explorermobile: 'ie_mob',
+  operamini: 'op_mini',
+  operamobile: 'op_mob',
+  chromeandroid: 'and_chr',
+  firefoxandroid: 'and_ff',
+  ucandroid: 'and_uc',
+  qqandroid: 'and_qq'
+}
+
+// Can I Use only provides a few versions for some browsers (e.g. and_chr).
+// Fallback to a similar browser for unknown versions
+browserslist.desktopNames = {
+  and_chr: 'chrome',
+  and_ff: 'firefox',
+  ie_mob: 'ie',
+  op_mob: 'opera',
+  android: 'chrome' // has extra processing logic
+}
+
+// Aliases to work with joined versions like `ios_saf 7.0-7.1`
+browserslist.versionAliases = {}
+
+browserslist.clearCaches = env.clearCaches
+browserslist.parseConfig = env.parseConfig
+browserslist.readConfig = env.readConfig
+browserslist.findConfig = env.findConfig
+browserslist.loadConfig = env.loadConfig
+
+/**
+ * Return browsers market coverage.
+ *
+ * @param {string[]} browsers Browsers names in Can I Use.
+ * @param {string|object} [stats="global"] Which statistics should be used.
+ *                                         Country code or custom statistics.
+ *                                         Pass `"my stats"` to load statistics
+ *                                         from Browserslist files.
+ *
+ * @return {number} Total market coverage for all selected browsers.
+ *
+ * @example
+ * browserslist.coverage(browserslist('> 1% in US'), 'US') //=> 83.1
+ */
+browserslist.coverage = function (browsers, stats) {
+  var data
+  if (typeof stats === 'undefined') {
+    data = browserslist.usage.global
+  } else if (stats === 'my stats') {
+    var opts = {}
+    opts.path = path.resolve ? path.resolve('.') : '.'
+    var customStats = env.getStat(opts)
+    if (!customStats) {
+      throw new BrowserslistError('Custom usage statistics was not provided')
+    }
+    data = {}
+    for (var browser in customStats) {
+      fillUsage(data, browser, customStats[browser])
+    }
+  } else if (typeof stats === 'string') {
+    if (stats.length > 2) {
+      stats = stats.toLowerCase()
+    } else {
+      stats = stats.toUpperCase()
+    }
+    env.loadCountry(browserslist.usage, stats, browserslist.data)
+    data = browserslist.usage[stats]
+  } else {
+    if ('dataByBrowser' in stats) {
+      stats = stats.dataByBrowser
+    }
+    data = {}
+    for (var name in stats) {
+      for (var version in stats[name]) {
+        data[name + ' ' + version] = stats[name][version]
+      }
+    }
+  }
+
+  return browsers.reduce(function (all, i) {
+    var usage = data[i]
+    if (usage === undefined) {
+      usage = data[i.replace(/ \S+$/, ' 0')]
+    }
+    return all + (usage || 0)
+  }, 0)
+}
+
+function nodeQuery(context, version) {
+  var matched = browserslist.nodeVersions.filter(function (i) {
+    return isVersionsMatch(i, version)
+  })
+  if (matched.length === 0) {
+    if (context.ignoreUnknownVersions) {
+      return []
+    } else {
+      throw new BrowserslistError('Unknown version ' + version + ' of Node.js')
+    }
+  }
+  return ['node ' + matched[matched.length - 1]]
+}
+
+function sinceQuery(context, year, month, date) {
+  year = parseInt(year)
+  month = parseInt(month || '01') - 1
+  date = parseInt(date || '01')
+  return filterByYear(Date.UTC(year, month, date, 0, 0, 0), context)
+}
+
+function coverQuery(context, coverage, statMode) {
+  coverage = parseFloat(coverage)
+  var usage = browserslist.usage.global
+  if (statMode) {
+    if (statMode.match(/^my\s+stats$/i)) {
+      if (!context.customUsage) {
+        throw new BrowserslistError('Custom usage statistics was not provided')
+      }
+      usage = context.customUsage
+    } else {
+      var place
+      if (statMode.length === 2) {
+        place = statMode.toUpperCase()
+      } else {
+        place = statMode.toLowerCase()
+      }
+      env.loadCountry(browserslist.usage, place, browserslist.data)
+      usage = browserslist.usage[place]
+    }
+  }
+  var versions = Object.keys(usage).sort(function (a, b) {
+    return usage[b] - usage[a]
+  })
+  var coveraged = 0
+  var result = []
+  var version
+  for (var i = 0; i < versions.length; i++) {
+    version = versions[i]
+    if (usage[version] === 0) break
+    coveraged += usage[version]
+    result.push(version)
+    if (coveraged >= coverage) break
+  }
+  return result
+}
+
+var QUERIES = [
+  {
+    regexp: /^last\s+(\d+)\s+major\s+versions?$/i,
+    select: function (context, versions) {
+      return Object.keys(agents).reduce(function (selected, name) {
+        var data = byName(name, context)
+        if (!data) return selected
+        var list = getMajorVersions(data.released, versions)
+        list = list.map(nameMapper(data.name))
+        if (data.name === 'android') {
+          list = filterAndroid(list, versions, context)
+        }
+        return selected.concat(list)
+      }, [])
+    }
+  },
+  {
+    regexp: /^last\s+(\d+)\s+versions?$/i,
+    select: function (context, versions) {
+      return Object.keys(agents).reduce(function (selected, name) {
+        var data = byName(name, context)
+        if (!data) return selected
+        var list = data.released.slice(-versions)
+        list = list.map(nameMapper(data.name))
+        if (data.name === 'android') {
+          list = filterAndroid(list, versions, context)
+        }
+        return selected.concat(list)
+      }, [])
+    }
+  },
+  {
+    regexp: /^last\s+(\d+)\s+electron\s+major\s+versions?$/i,
+    select: function (context, versions) {
+      var validVersions = getMajorVersions(Object.keys(e2c), versions)
+      return validVersions.map(function (i) {
+        return 'chrome ' + e2c[i]
+      })
+    }
+  },
+  {
+    regexp: /^last\s+(\d+)\s+node\s+major\s+versions?$/i,
+    select: function (context, versions) {
+      return getMajorVersions(browserslist.nodeVersions, versions).map(
+        function (version) {
+          return 'node ' + version
+        }
+      )
+    }
+  },
+  {
+    regexp: /^last\s+(\d+)\s+(\w+)\s+major\s+versions?$/i,
+    select: function (context, versions, name) {
+      var data = checkName(name, context)
+      var validVersions = getMajorVersions(data.released, versions)
+      var list = validVersions.map(nameMapper(data.name))
+      if (data.name === 'android') {
+        list = filterAndroid(list, versions, context)
+      }
+      return list
+    }
+  },
+  {
+    regexp: /^last\s+(\d+)\s+electron\s+versions?$/i,
+    select: function (context, versions) {
+      return Object.keys(e2c)
+        .slice(-versions)
+        .map(function (i) {
+          return 'chrome ' + e2c[i]
+        })
+    }
+  },
+  {
+    regexp: /^last\s+(\d+)\s+node\s+versions?$/i,
+    select: function (context, versions) {
+      return browserslist.nodeVersions.slice(-versions).map(function (version) {
+        return 'node ' + version
+      })
+    }
+  },
+  {
+    regexp: /^last\s+(\d+)\s+(\w+)\s+versions?$/i,
+    select: function (context, versions, name) {
+      var data = checkName(name, context)
+      var list = data.released.slice(-versions).map(nameMapper(data.name))
+      if (data.name === 'android') {
+        list = filterAndroid(list, versions, context)
+      }
+      return list
+    }
+  },
+  {
+    regexp: /^unreleased\s+versions$/i,
+    select: function (context) {
+      return Object.keys(agents).reduce(function (selected, name) {
+        var data = byName(name, context)
+        if (!data) return selected
+        var list = data.versions.filter(function (v) {
+          return data.released.indexOf(v) === -1
+        })
+        list = list.map(nameMapper(data.name))
+        return selected.concat(list)
+      }, [])
+    }
+  },
+  {
+    regexp: /^unreleased\s+electron\s+versions?$/i,
+    select: function () {
+      return []
+    }
+  },
+  {
+    regexp: /^unreleased\s+(\w+)\s+versions?$/i,
+    select: function (context, name) {
+      var data = checkName(name, context)
+      return data.versions
+        .filter(function (v) {
+          return data.released.indexOf(v) === -1
+        })
+        .map(nameMapper(data.name))
+    }
+  },
+  {
+    regexp: /^last\s+(\d*.?\d+)\s+years?$/i,
+    select: function (context, years) {
+      return filterByYear(Date.now() - YEAR * years, context)
+    }
+  },
+  {
+    regexp: /^since (\d+)$/i,
+    select: sinceQuery
+  },
+  {
+    regexp: /^since (\d+)-(\d+)$/i,
+    select: sinceQuery
+  },
+  {
+    regexp: /^since (\d+)-(\d+)-(\d+)$/i,
+    select: sinceQuery
+  },
+  {
+    regexp: /^(>=?|<=?)\s*(\d+|\d+\.\d+|\.\d+)%$/,
+    select: function (context, sign, popularity) {
+      popularity = parseFloat(popularity)
+      var usage = browserslist.usage.global
+      return Object.keys(usage).reduce(function (result, version) {
+        if (sign === '>') {
+          if (usage[version] > popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<') {
+          if (usage[version] < popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<=') {
+          if (usage[version] <= popularity) {
+            result.push(version)
+          }
+        } else if (usage[version] >= popularity) {
+          result.push(version)
+        }
+        return result
+      }, [])
+    }
+  },
+  {
+    regexp: /^(>=?|<=?)\s*(\d+|\d+\.\d+|\.\d+)%\s+in\s+my\s+stats$/,
+    select: function (context, sign, popularity) {
+      popularity = parseFloat(popularity)
+      if (!context.customUsage) {
+        throw new BrowserslistError('Custom usage statistics was not provided')
+      }
+      var usage = context.customUsage
+      return Object.keys(usage).reduce(function (result, version) {
+        var percentage = usage[version]
+        if (percentage == null) {
+          return result
+        }
+
+        if (sign === '>') {
+          if (percentage > popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<') {
+          if (percentage < popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<=') {
+          if (percentage <= popularity) {
+            result.push(version)
+          }
+        } else if (percentage >= popularity) {
+          result.push(version)
+        }
+        return result
+      }, [])
+    }
+  },
+  {
+    regexp: /^(>=?|<=?)\s*(\d+|\d+\.\d+|\.\d+)%\s+in\s+(\S+)\s+stats$/,
+    select: function (context, sign, popularity, name) {
+      popularity = parseFloat(popularity)
+      var stats = env.loadStat(context, name, browserslist.data)
+      if (stats) {
+        context.customUsage = {}
+        for (var browser in stats) {
+          fillUsage(context.customUsage, browser, stats[browser])
+        }
+      }
+      if (!context.customUsage) {
+        throw new BrowserslistError('Custom usage statistics was not provided')
+      }
+      var usage = context.customUsage
+      return Object.keys(usage).reduce(function (result, version) {
+        var percentage = usage[version]
+        if (percentage == null) {
+          return result
+        }
+
+        if (sign === '>') {
+          if (percentage > popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<') {
+          if (percentage < popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<=') {
+          if (percentage <= popularity) {
+            result.push(version)
+          }
+        } else if (percentage >= popularity) {
+          result.push(version)
+        }
+        return result
+      }, [])
+    }
+  },
+  {
+    regexp: /^(>=?|<=?)\s*(\d+|\d+\.\d+|\.\d+)%\s+in\s+((alt-)?\w\w)$/,
+    select: function (context, sign, popularity, place) {
+      popularity = parseFloat(popularity)
+      if (place.length === 2) {
+        place = place.toUpperCase()
+      } else {
+        place = place.toLowerCase()
+      }
+      env.loadCountry(browserslist.usage, place, browserslist.data)
+      var usage = browserslist.usage[place]
+      return Object.keys(usage).reduce(function (result, version) {
+        var percentage = usage[version]
+        if (percentage == null) {
+          return result
+        }
+
+        if (sign === '>') {
+          if (percentage > popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<') {
+          if (percentage < popularity) {
+            result.push(version)
+          }
+        } else if (sign === '<=') {
+          if (percentage <= popularity) {
+            result.push(version)
+          }
+        } else if (percentage >= popularity) {
+          result.push(version)
+        }
+        return result
+      }, [])
+    }
+  },
+  {
+    regexp: /^cover\s+(\d+|\d+\.\d+|\.\d+)%$/i,
+    select: coverQuery
+  },
+  {
+    regexp: /^cover\s+(\d+|\d+\.\d+|\.\d+)%\s+in\s+(my\s+stats|(alt-)?\w\w)$/i,
+    select: coverQuery
+  },
+  {
+    regexp: /^supports\s+([\w-]+)$/,
+    select: function (context, feature) {
+      env.loadFeature(browserslist.cache, feature)
+      var features = browserslist.cache[feature]
+      return Object.keys(features).reduce(function (result, version) {
+        var flags = features[version]
+        if (flags.indexOf('y') >= 0 || flags.indexOf('a') >= 0) {
+          result.push(version)
+        }
+        return result
+      }, [])
+    }
+  },
+  {
+    regexp: /^electron\s+([\d.]+)\s*-\s*([\d.]+)$/i,
+    select: function (context, from, to) {
+      var fromToUse = normalizeElectron(from)
+      var toToUse = normalizeElectron(to)
+      if (!e2c[fromToUse]) {
+        throw new BrowserslistError('Unknown version ' + from + ' of electron')
+      }
+      if (!e2c[toToUse]) {
+        throw new BrowserslistError('Unknown version ' + to + ' of electron')
+      }
+      from = parseFloat(from)
+      to = parseFloat(to)
+      return Object.keys(e2c)
+        .filter(function (i) {
+          var parsed = parseFloat(i)
+          return parsed >= from && parsed <= to
+        })
+        .map(function (i) {
+          return 'chrome ' + e2c[i]
+        })
+    }
+  },
+  {
+    regexp: /^node\s+([\d.]+)\s*-\s*([\d.]+)$/i,
+    select: function (context, from, to) {
+      return browserslist.nodeVersions
+        .filter(semverFilterLoose('>=', from))
+        .filter(semverFilterLoose('<=', to))
+        .map(function (v) {
+          return 'node ' + v
+        })
+    }
+  },
+  {
+    regexp: /^(\w+)\s+([\d.]+)\s*-\s*([\d.]+)$/i,
+    select: function (context, name, from, to) {
+      var data = checkName(name, context)
+      from = parseFloat(normalizeVersion(data, from) || from)
+      to = parseFloat(normalizeVersion(data, to) || to)
+      function filter(v) {
+        var parsed = parseFloat(v)
+        return parsed >= from && parsed <= to
+      }
+      return data.released.filter(filter).map(nameMapper(data.name))
+    }
+  },
+  {
+    regexp: /^electron\s*(>=?|<=?)\s*([\d.]+)$/i,
+    select: function (context, sign, version) {
+      var versionToUse = normalizeElectron(version)
+      return Object.keys(e2c)
+        .filter(generateFilter(sign, versionToUse))
+        .map(function (i) {
+          return 'chrome ' + e2c[i]
+        })
+    }
+  },
+  {
+    regexp: /^node\s*(>=?|<=?)\s*([\d.]+)$/i,
+    select: function (context, sign, version) {
+      return browserslist.nodeVersions
+        .filter(generateSemverFilter(sign, version))
+        .map(function (v) {
+          return 'node ' + v
+        })
+    }
+  },
+  {
+    regexp: /^(\w+)\s*(>=?|<=?)\s*([\d.]+)$/,
+    select: function (context, name, sign, version) {
+      var data = checkName(name, context)
+      var alias = browserslist.versionAliases[data.name][version]
+      if (alias) {
+        version = alias
+      }
+      return data.released
+        .filter(generateFilter(sign, version))
+        .map(function (v) {
+          return data.name + ' ' + v
+        })
+    }
+  },
+  {
+    regexp: /^(firefox|ff|fx)\s+esr$/i,
+    select: function () {
+      return ['firefox 91']
+    }
+  },
+  {
+    regexp: /(operamini|op_mini)\s+all/i,
+    select: function () {
+      return ['op_mini all']
+    }
+  },
+  {
+    regexp: /^electron\s+([\d.]+)$/i,
+    select: function (context, version) {
+      var versionToUse = normalizeElectron(version)
+      var chrome = e2c[versionToUse]
+      if (!chrome) {
+        throw new BrowserslistError(
+          'Unknown version ' + version + ' of electron'
+        )
+      }
+      return ['chrome ' + chrome]
+    }
+  },
+  {
+    regexp: /^node\s+(\d+)$/i,
+    select: nodeQuery
+  },
+  {
+    regexp: /^node\s+(\d+\.\d+)$/i,
+    select: nodeQuery
+  },
+  {
+    regexp: /^node\s+(\d+\.\d+\.\d+)$/i,
+    select: nodeQuery
+  },
+  {
+    regexp: /^current\s+node$/i,
+    select: function (context) {
+      return [env.currentNode(resolve, context)]
+    }
+  },
+  {
+    regexp: /^maintained\s+node\s+versions$/i,
+    select: function (context) {
+      var now = Date.now()
+      var queries = Object.keys(jsEOL)
+        .filter(function (key) {
+          return (
+            now < Date.parse(jsEOL[key].end) &&
+            now > Date.parse(jsEOL[key].start) &&
+            isEolReleased(key)
+          )
+        })
+        .map(function (key) {
+          return 'node ' + key.slice(1)
+        })
+      return resolve(queries, context)
+    }
+  },
+  {
+    regexp: /^phantomjs\s+1.9$/i,
+    select: function () {
+      return ['safari 5']
+    }
+  },
+  {
+    regexp: /^phantomjs\s+2.1$/i,
+    select: function () {
+      return ['safari 6']
+    }
+  },
+  {
+    regexp: /^(\w+)\s+(tp|[\d.]+)$/i,
+    select: function (context, name, version) {
+      if (/^tp$/i.test(version)) version = 'TP'
+      var data = checkName(name, context)
+      var alias = normalizeVersion(data, version)
+      if (alias) {
+        version = alias
+      } else {
+        if (version.indexOf('.') === -1) {
+          alias = version + '.0'
+        } else {
+          alias = version.replace(/\.0$/, '')
+        }
+        alias = normalizeVersion(data, alias)
+        if (alias) {
+          version = alias
+        } else if (context.ignoreUnknownVersions) {
+          return []
+        } else {
+          throw new BrowserslistError(
+            'Unknown version ' + version + ' of ' + name
+          )
+        }
+      }
+      return [data.name + ' ' + version]
+    }
+  },
+  {
+    regexp: /^browserslist config$/i,
+    select: function (context) {
+      return browserslist(undefined, context)
+    }
+  },
+  {
+    regexp: /^extends (.+)$/i,
+    select: function (context, name) {
+      return resolve(env.loadQueries(context, name), context)
+    }
+  },
+  {
+    regexp: /^defaults$/i,
+    select: function (context) {
+      return resolve(browserslist.defaults, context)
+    }
+  },
+  {
+    regexp: /^dead$/i,
+    select: function (context) {
+      var dead = [
+        'ie <= 10',
+        'ie_mob <= 11',
+        'bb <= 10',
+        'op_mob <= 12.1',
+        'samsung 4'
+      ]
+      return resolve(dead, context)
+    }
+  },
+  {
+    regexp: /^(\w+)$/i,
+    select: function (context, name) {
+      if (byName(name, context)) {
+        throw new BrowserslistError(
+          'Specify versions in Browserslist query for browser ' + name
+        )
+      } else {
+        throw unknownQuery(name)
+      }
+    }
+  }
+]
+
+// Get and convert Can I Use data
+
+;(function () {
+  for (var name in agents) {
+    var browser = agents[name]
+    browserslist.data[name] = {
+      name: name,
+      versions: normalize(agents[name].versions),
+      released: normalize(agents[name].versions.slice(0, -3)),
+      releaseDate: agents[name].release_date
+    }
+    fillUsage(browserslist.usage.global, name, browser.usage_global)
+
+    browserslist.versionAliases[name] = {}
+    for (var i = 0; i < browser.versions.length; i++) {
+      var full = browser.versions[i]
+      if (!full) continue
+
+      if (full.indexOf('-') !== -1) {
+        var interval = full.split('-')
+        for (var j = 0; j < interval.length; j++) {
+          browserslist.versionAliases[name][interval[j]] = full
+        }
+      }
+    }
+  }
+
+  browserslist.versionAliases.op_mob['59'] = '58'
+
+  browserslist.nodeVersions = jsReleases.map(function (release) {
+    return release.version
+  })
+})()
+
+module.exports = browserslist
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/node.js b/node_modules/mathjs/examples/node_modules/browserslist/node.js
new file mode 100644
index 0000000..8eb6b65
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/node.js
@@ -0,0 +1,393 @@
+var feature = require('caniuse-lite/dist/unpacker/feature').default
+var region = require('caniuse-lite/dist/unpacker/region').default
+var path = require('path')
+var fs = require('fs')
+
+var BrowserslistError = require('./error')
+
+var IS_SECTION = /^\s*\[(.+)]\s*$/
+var CONFIG_PATTERN = /^browserslist-config-/
+var SCOPED_CONFIG__PATTERN = /@[^/]+\/browserslist-config(-|$|\/)/
+var TIME_TO_UPDATE_CANIUSE = 6 * 30 * 24 * 60 * 60 * 1000
+var FORMAT =
+  'Browserslist config should be a string or an array ' +
+  'of strings with browser queries'
+
+var dataTimeChecked = false
+var filenessCache = {}
+var configCache = {}
+function checkExtend(name) {
+  var use = ' Use `dangerousExtend` option to disable.'
+  if (!CONFIG_PATTERN.test(name) && !SCOPED_CONFIG__PATTERN.test(name)) {
+    throw new BrowserslistError(
+      'Browserslist config needs `browserslist-config-` prefix. ' + use
+    )
+  }
+  if (name.replace(/^@[^/]+\//, '').indexOf('.') !== -1) {
+    throw new BrowserslistError(
+      '`.` not allowed in Browserslist config name. ' + use
+    )
+  }
+  if (name.indexOf('node_modules') !== -1) {
+    throw new BrowserslistError(
+      '`node_modules` not allowed in Browserslist config.' + use
+    )
+  }
+}
+
+function isFile(file) {
+  if (file in filenessCache) {
+    return filenessCache[file]
+  }
+  var result = fs.existsSync(file) && fs.statSync(file).isFile()
+  if (!process.env.BROWSERSLIST_DISABLE_CACHE) {
+    filenessCache[file] = result
+  }
+  return result
+}
+
+function eachParent(file, callback) {
+  var dir = isFile(file) ? path.dirname(file) : file
+  var loc = path.resolve(dir)
+  do {
+    var result = callback(loc)
+    if (typeof result !== 'undefined') return result
+  } while (loc !== (loc = path.dirname(loc)))
+  return undefined
+}
+
+function check(section) {
+  if (Array.isArray(section)) {
+    for (var i = 0; i < section.length; i++) {
+      if (typeof section[i] !== 'string') {
+        throw new BrowserslistError(FORMAT)
+      }
+    }
+  } else if (typeof section !== 'string') {
+    throw new BrowserslistError(FORMAT)
+  }
+}
+
+function pickEnv(config, opts) {
+  if (typeof config !== 'object') return config
+
+  var name
+  if (typeof opts.env === 'string') {
+    name = opts.env
+  } else if (process.env.BROWSERSLIST_ENV) {
+    name = process.env.BROWSERSLIST_ENV
+  } else if (process.env.NODE_ENV) {
+    name = process.env.NODE_ENV
+  } else {
+    name = 'production'
+  }
+
+  if (opts.throwOnMissing) {
+    if (name && name !== 'defaults' && !config[name]) {
+      throw new BrowserslistError(
+        'Missing config for Browserslist environment `' + name + '`'
+      )
+    }
+  }
+
+  return config[name] || config.defaults
+}
+
+function parsePackage(file) {
+  var config = JSON.parse(fs.readFileSync(file))
+  if (config.browserlist && !config.browserslist) {
+    throw new BrowserslistError(
+      '`browserlist` key instead of `browserslist` in ' + file
+    )
+  }
+  var list = config.browserslist
+  if (Array.isArray(list) || typeof list === 'string') {
+    list = { defaults: list }
+  }
+  for (var i in list) {
+    check(list[i])
+  }
+
+  return list
+}
+
+function latestReleaseTime(agents) {
+  var latest = 0
+  for (var name in agents) {
+    var dates = agents[name].releaseDate || {}
+    for (var key in dates) {
+      if (latest < dates[key]) {
+        latest = dates[key]
+      }
+    }
+  }
+  return latest * 1000
+}
+
+function normalizeStats(data, stats) {
+  if (!data) {
+    data = {}
+  }
+  if (stats && 'dataByBrowser' in stats) {
+    stats = stats.dataByBrowser
+  }
+
+  if (typeof stats !== 'object') return undefined
+
+  var normalized = {}
+  for (var i in stats) {
+    var versions = Object.keys(stats[i])
+    if (versions.length === 1 && data[i] && data[i].versions.length === 1) {
+      var normal = data[i].versions[0]
+      normalized[i] = {}
+      normalized[i][normal] = stats[i][versions[0]]
+    } else {
+      normalized[i] = stats[i]
+    }
+  }
+
+  return normalized
+}
+
+function normalizeUsageData(usageData, data) {
+  for (var browser in usageData) {
+    var browserUsage = usageData[browser]
+    // eslint-disable-next-line max-len
+    // https://github.com/browserslist/browserslist/issues/431#issuecomment-565230615
+    // caniuse-db returns { 0: "percentage" } for `and_*` regional stats
+    if ('0' in browserUsage) {
+      var versions = data[browser].versions
+      browserUsage[versions[versions.length - 1]] = browserUsage[0]
+      delete browserUsage[0]
+    }
+  }
+}
+
+module.exports = {
+  loadQueries: function loadQueries(ctx, name) {
+    if (!ctx.dangerousExtend && !process.env.BROWSERSLIST_DANGEROUS_EXTEND) {
+      checkExtend(name)
+    }
+    var queries = require(require.resolve(name, { paths: ['.', ctx.path] }))
+    if (queries) {
+      if (Array.isArray(queries)) {
+        return queries
+      } else if (typeof queries === 'object') {
+        if (!queries.defaults) queries.defaults = []
+        return pickEnv(queries, ctx, name)
+      }
+    }
+    throw new BrowserslistError(
+      '`' +
+        name +
+        '` config exports not an array of queries' +
+        ' or an object of envs'
+    )
+  },
+
+  loadStat: function loadStat(ctx, name, data) {
+    if (!ctx.dangerousExtend && !process.env.BROWSERSLIST_DANGEROUS_EXTEND) {
+      checkExtend(name)
+    }
+    var stats = require(require.resolve(
+      path.join(name, 'browserslist-stats.json'),
+      { paths: ['.'] }
+    ))
+    return normalizeStats(data, stats)
+  },
+
+  getStat: function getStat(opts, data) {
+    var stats
+    if (opts.stats) {
+      stats = opts.stats
+    } else if (process.env.BROWSERSLIST_STATS) {
+      stats = process.env.BROWSERSLIST_STATS
+    } else if (opts.path && path.resolve && fs.existsSync) {
+      stats = eachParent(opts.path, function (dir) {
+        var file = path.join(dir, 'browserslist-stats.json')
+        return isFile(file) ? file : undefined
+      })
+    }
+    if (typeof stats === 'string') {
+      try {
+        stats = JSON.parse(fs.readFileSync(stats))
+      } catch (e) {
+        throw new BrowserslistError("Can't read " + stats)
+      }
+    }
+    return normalizeStats(data, stats)
+  },
+
+  loadConfig: function loadConfig(opts) {
+    if (process.env.BROWSERSLIST) {
+      return process.env.BROWSERSLIST
+    } else if (opts.config || process.env.BROWSERSLIST_CONFIG) {
+      var file = opts.config || process.env.BROWSERSLIST_CONFIG
+      if (path.basename(file) === 'package.json') {
+        return pickEnv(parsePackage(file), opts)
+      } else {
+        return pickEnv(module.exports.readConfig(file), opts)
+      }
+    } else if (opts.path) {
+      return pickEnv(module.exports.findConfig(opts.path), opts)
+    } else {
+      return undefined
+    }
+  },
+
+  loadCountry: function loadCountry(usage, country, data) {
+    var code = country.replace(/[^\w-]/g, '')
+    if (!usage[code]) {
+      var compressed = require('caniuse-lite/data/regions/' + code + '.js')
+      var usageData = region(compressed)
+      normalizeUsageData(usageData, data)
+      usage[country] = {}
+      for (var i in usageData) {
+        for (var j in usageData[i]) {
+          usage[country][i + ' ' + j] = usageData[i][j]
+        }
+      }
+    }
+  },
+
+  loadFeature: function loadFeature(features, name) {
+    name = name.replace(/[^\w-]/g, '')
+    if (features[name]) return
+
+    var compressed = require('caniuse-lite/data/features/' + name + '.js')
+    var stats = feature(compressed).stats
+    features[name] = {}
+    for (var i in stats) {
+      for (var j in stats[i]) {
+        features[name][i + ' ' + j] = stats[i][j]
+      }
+    }
+  },
+
+  parseConfig: function parseConfig(string) {
+    var result = { defaults: [] }
+    var sections = ['defaults']
+
+    string
+      .toString()
+      .replace(/#[^\n]*/g, '')
+      .split(/\n|,/)
+      .map(function (line) {
+        return line.trim()
+      })
+      .filter(function (line) {
+        return line !== ''
+      })
+      .forEach(function (line) {
+        if (IS_SECTION.test(line)) {
+          sections = line.match(IS_SECTION)[1].trim().split(' ')
+          sections.forEach(function (section) {
+            if (result[section]) {
+              throw new BrowserslistError(
+                'Duplicate section ' + section + ' in Browserslist config'
+              )
+            }
+            result[section] = []
+          })
+        } else {
+          sections.forEach(function (section) {
+            result[section].push(line)
+          })
+        }
+      })
+
+    return result
+  },
+
+  readConfig: function readConfig(file) {
+    if (!isFile(file)) {
+      throw new BrowserslistError("Can't read " + file + ' config')
+    }
+    return module.exports.parseConfig(fs.readFileSync(file))
+  },
+
+  findConfig: function findConfig(from) {
+    from = path.resolve(from)
+
+    var passed = []
+    var resolved = eachParent(from, function (dir) {
+      if (dir in configCache) {
+        return configCache[dir]
+      }
+
+      passed.push(dir)
+
+      var config = path.join(dir, 'browserslist')
+      var pkg = path.join(dir, 'package.json')
+      var rc = path.join(dir, '.browserslistrc')
+
+      var pkgBrowserslist
+      if (isFile(pkg)) {
+        try {
+          pkgBrowserslist = parsePackage(pkg)
+        } catch (e) {
+          if (e.name === 'BrowserslistError') throw e
+          console.warn(
+            '[Browserslist] Could not parse ' + pkg + '. Ignoring it.'
+          )
+        }
+      }
+
+      if (isFile(config) && pkgBrowserslist) {
+        throw new BrowserslistError(
+          dir + ' contains both browserslist and package.json with browsers'
+        )
+      } else if (isFile(rc) && pkgBrowserslist) {
+        throw new BrowserslistError(
+          dir + ' contains both .browserslistrc and package.json with browsers'
+        )
+      } else if (isFile(config) && isFile(rc)) {
+        throw new BrowserslistError(
+          dir + ' contains both .browserslistrc and browserslist'
+        )
+      } else if (isFile(config)) {
+        return module.exports.readConfig(config)
+      } else if (isFile(rc)) {
+        return module.exports.readConfig(rc)
+      } else {
+        return pkgBrowserslist
+      }
+    })
+    if (!process.env.BROWSERSLIST_DISABLE_CACHE) {
+      passed.forEach(function (dir) {
+        configCache[dir] = resolved
+      })
+    }
+    return resolved
+  },
+
+  clearCaches: function clearCaches() {
+    dataTimeChecked = false
+    filenessCache = {}
+    configCache = {}
+
+    this.cache = {}
+  },
+
+  oldDataWarning: function oldDataWarning(agentsObj) {
+    if (dataTimeChecked) return
+    dataTimeChecked = true
+    if (process.env.BROWSERSLIST_IGNORE_OLD_DATA) return
+
+    var latest = latestReleaseTime(agentsObj)
+    var halfYearAgo = Date.now() - TIME_TO_UPDATE_CANIUSE
+
+    if (latest !== 0 && latest < halfYearAgo) {
+      console.warn(
+        'Browserslist: caniuse-lite is outdated. Please run:\n' +
+          '  npx browserslist@latest --update-db\n' +
+          '  Why you should do it regularly: ' +
+          'https://github.com/browserslist/browserslist#browsers-data-updating'
+      )
+    }
+  },
+
+  currentNode: function currentNode() {
+    return 'node ' + process.versions.node
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/package.json b/node_modules/mathjs/examples/node_modules/browserslist/package.json
new file mode 100644
index 0000000..483db2c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/package.json
@@ -0,0 +1,41 @@
+{
+  "name": "browserslist",
+  "version": "4.20.2",
+  "description": "Share target browsers between different front-end tools, like Autoprefixer, Stylelint and babel-env-preset",
+  "keywords": [
+    "caniuse",
+    "browsers",
+    "target"
+  ],
+  "funding": [
+    {
+      "type": "opencollective",
+      "url": "https://opencollective.com/browserslist"
+    },
+    {
+      "type": "tidelift",
+      "url": "https://tidelift.com/funding/github/npm/browserslist"
+    }
+  ],
+  "author": "Andrey Sitnik <andrey@sitnik.ru>",
+  "license": "MIT",
+  "repository": "browserslist/browserslist",
+  "dependencies": {
+    "caniuse-lite": "^1.0.30001317",
+    "electron-to-chromium": "^1.4.84",
+    "escalade": "^3.1.1",
+    "node-releases": "^2.0.2",
+    "picocolors": "^1.0.0"
+  },
+  "engines": {
+    "node": "^6 || ^7 || ^8 || ^9 || ^10 || ^11 || ^12 || >=13.7"
+  },
+  "bin": {
+    "browserslist": "cli.js"
+  },
+  "types": "./index.d.ts",
+  "browser": {
+    "./node.js": "./browser.js",
+    "path": false
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/browserslist/update-db.js b/node_modules/mathjs/examples/node_modules/browserslist/update-db.js
new file mode 100644
index 0000000..3e69e64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/browserslist/update-db.js
@@ -0,0 +1,317 @@
+var childProcess = require('child_process')
+var escalade = require('escalade/sync')
+var pico = require('picocolors')
+var path = require('path')
+var fs = require('fs')
+
+var BrowserslistError = require('./error')
+
+function detectLockfile() {
+  var packageDir = escalade('.', function (dir, names) {
+    return names.indexOf('package.json') !== -1 ? dir : ''
+  })
+
+  if (!packageDir) {
+    throw new BrowserslistError(
+      'Cannot find package.json. ' +
+        'Is this the right directory to run `npx browserslist --update-db` in?'
+    )
+  }
+
+  var lockfileNpm = path.join(packageDir, 'package-lock.json')
+  var lockfileShrinkwrap = path.join(packageDir, 'npm-shrinkwrap.json')
+  var lockfileYarn = path.join(packageDir, 'yarn.lock')
+  var lockfilePnpm = path.join(packageDir, 'pnpm-lock.yaml')
+
+  if (fs.existsSync(lockfilePnpm)) {
+    return { mode: 'pnpm', file: lockfilePnpm }
+  } else if (fs.existsSync(lockfileNpm)) {
+    return { mode: 'npm', file: lockfileNpm }
+  } else if (fs.existsSync(lockfileYarn)) {
+    var lock = { mode: 'yarn', file: lockfileYarn }
+    lock.content = fs.readFileSync(lock.file).toString()
+    lock.version = /# yarn lockfile v1/.test(lock.content) ? 1 : 2
+    return lock
+  } else if (fs.existsSync(lockfileShrinkwrap)) {
+    return { mode: 'npm', file: lockfileShrinkwrap }
+  }
+  throw new BrowserslistError(
+    'No lockfile found. Run "npm install", "yarn install" or "pnpm install"'
+  )
+}
+
+function getLatestInfo(lock) {
+  if (lock.mode === 'yarn') {
+    if (lock.version === 1) {
+      return JSON.parse(
+        childProcess.execSync('yarn info caniuse-lite --json').toString()
+      ).data
+    } else {
+      return JSON.parse(
+        childProcess.execSync('yarn npm info caniuse-lite --json').toString()
+      )
+    }
+  }
+  return JSON.parse(
+    childProcess.execSync('npm show caniuse-lite --json').toString()
+  )
+}
+
+function getBrowsersList() {
+  return childProcess
+    .execSync('npx browserslist')
+    .toString()
+    .trim()
+    .split('\n')
+    .map(function (line) {
+      return line.trim().split(' ')
+    })
+    .reduce(function (result, entry) {
+      if (!result[entry[0]]) {
+        result[entry[0]] = []
+      }
+      result[entry[0]].push(entry[1])
+      return result
+    }, {})
+}
+
+function diffBrowsersLists(old, current) {
+  var browsers = Object.keys(old).concat(
+    Object.keys(current).filter(function (browser) {
+      return old[browser] === undefined
+    })
+  )
+  return browsers
+    .map(function (browser) {
+      var oldVersions = old[browser] || []
+      var currentVersions = current[browser] || []
+      var intersection = oldVersions.filter(function (version) {
+        return currentVersions.indexOf(version) !== -1
+      })
+      var addedVersions = currentVersions.filter(function (version) {
+        return intersection.indexOf(version) === -1
+      })
+      var removedVersions = oldVersions.filter(function (version) {
+        return intersection.indexOf(version) === -1
+      })
+      return removedVersions
+        .map(function (version) {
+          return pico.red('- ' + browser + ' ' + version)
+        })
+        .concat(
+          addedVersions.map(function (version) {
+            return pico.green('+ ' + browser + ' ' + version)
+          })
+        )
+    })
+    .reduce(function (result, array) {
+      return result.concat(array)
+    }, [])
+    .join('\n')
+}
+
+function updateNpmLockfile(lock, latest) {
+  var metadata = { latest: latest, versions: [] }
+  var content = deletePackage(JSON.parse(lock.content), metadata)
+  metadata.content = JSON.stringify(content, null, '  ')
+  return metadata
+}
+
+function deletePackage(node, metadata) {
+  if (node.dependencies) {
+    if (node.dependencies['caniuse-lite']) {
+      var version = node.dependencies['caniuse-lite'].version
+      metadata.versions[version] = true
+      delete node.dependencies['caniuse-lite']
+    }
+    for (var i in node.dependencies) {
+      node.dependencies[i] = deletePackage(node.dependencies[i], metadata)
+    }
+  }
+  return node
+}
+
+var yarnVersionRe = /version "(.*?)"/
+
+function updateYarnLockfile(lock, latest) {
+  var blocks = lock.content.split(/(\n{2,})/).map(function (block) {
+    return block.split('\n')
+  })
+  var versions = {}
+  blocks.forEach(function (lines) {
+    if (lines[0].indexOf('caniuse-lite@') !== -1) {
+      var match = yarnVersionRe.exec(lines[1])
+      versions[match[1]] = true
+      if (match[1] !== latest.version) {
+        lines[1] = lines[1].replace(
+          /version "[^"]+"/,
+          'version "' + latest.version + '"'
+        )
+        lines[2] = lines[2].replace(
+          /resolved "[^"]+"/,
+          'resolved "' + latest.dist.tarball + '"'
+        )
+        if (lines.length === 4) {
+          lines[3] = latest.dist.integrity
+            ? lines[3].replace(
+                /integrity .+/,
+                'integrity ' + latest.dist.integrity
+              )
+            : ''
+        }
+      }
+    }
+  })
+  var content = blocks
+    .map(function (lines) {
+      return lines.join('\n')
+    })
+    .join('')
+  return { content: content, versions: versions }
+}
+
+function updateLockfile(lock, latest) {
+  if (!lock.content) lock.content = fs.readFileSync(lock.file).toString()
+
+  if (lock.mode === 'yarn') {
+    return updateYarnLockfile(lock, latest)
+  } else {
+    return updateNpmLockfile(lock, latest)
+  }
+}
+
+function updatePackageManually(print, lock, latest) {
+  var lockfileData = updateLockfile(lock, latest)
+  var caniuseVersions = Object.keys(lockfileData.versions).sort()
+  if (caniuseVersions.length === 1 && caniuseVersions[0] === latest.version) {
+    print(
+      'Installed version:  ' +
+        pico.bold(pico.green(latest.version)) +
+        '\n' +
+        pico.bold(pico.green('caniuse-lite is up to date')) +
+        '\n'
+    )
+    return
+  }
+
+  if (caniuseVersions.length === 0) {
+    caniuseVersions[0] = 'none'
+  }
+  print(
+    'Installed version' +
+      (caniuseVersions.length === 1 ? ':  ' : 's: ') +
+      pico.bold(pico.red(caniuseVersions.join(', '))) +
+      '\n' +
+      'Removing old caniuse-lite from lock file\n'
+  )
+  fs.writeFileSync(lock.file, lockfileData.content)
+
+  var install = lock.mode === 'yarn' ? 'yarn add -W' : lock.mode + ' install'
+  print(
+    'Installing new caniuse-lite version\n' +
+      pico.yellow('$ ' + install + ' caniuse-lite') +
+      '\n'
+  )
+  try {
+    childProcess.execSync(install + ' caniuse-lite')
+  } catch (e) /* c8 ignore start */ {
+    print(
+      pico.red(
+        '\n' +
+          e.stack +
+          '\n\n' +
+          'Problem with `' +
+          install +
+          ' caniuse-lite` call. ' +
+          'Run it manually.\n'
+      )
+    )
+    process.exit(1)
+  } /* c8 ignore end */
+
+  var del = lock.mode === 'yarn' ? 'yarn remove -W' : lock.mode + ' uninstall'
+  print(
+    'Cleaning package.json dependencies from caniuse-lite\n' +
+      pico.yellow('$ ' + del + ' caniuse-lite') +
+      '\n'
+  )
+  childProcess.execSync(del + ' caniuse-lite')
+}
+
+function updateWith(print, cmd) {
+  print('Updating caniuse-lite version\n' + pico.yellow('$ ' + cmd) + '\n')
+  try {
+    childProcess.execSync(cmd)
+  } catch (e) /* c8 ignore start */ {
+    print(pico.red(e.stdout.toString()))
+    print(
+      pico.red(
+        '\n' +
+          e.stack +
+          '\n\n' +
+          'Problem with `' +
+          cmd +
+          '` call. ' +
+          'Run it manually.\n'
+      )
+    )
+    process.exit(1)
+  } /* c8 ignore end */
+}
+
+module.exports = function updateDB(print) {
+  var lock = detectLockfile()
+  var latest = getLatestInfo(lock)
+
+  var browsersListRetrievalError
+  var oldBrowsersList
+  try {
+    oldBrowsersList = getBrowsersList()
+  } catch (e) {
+    browsersListRetrievalError = e
+  }
+
+  print('Latest version:     ' + pico.bold(pico.green(latest.version)) + '\n')
+
+  if (lock.mode === 'yarn' && lock.version !== 1) {
+    updateWith(print, 'yarn up -R caniuse-lite')
+  } else if (lock.mode === 'pnpm') {
+    updateWith(print, 'pnpm up caniuse-lite')
+  } else {
+    updatePackageManually(print, lock, latest)
+  }
+
+  print('caniuse-lite has been successfully updated\n')
+
+  var currentBrowsersList
+  if (!browsersListRetrievalError) {
+    try {
+      currentBrowsersList = getBrowsersList()
+    } catch (e) /* c8 ignore start */ {
+      browsersListRetrievalError = e
+    } /* c8 ignore end */
+  }
+
+  if (browsersListRetrievalError) {
+    print(
+      pico.red(
+        '\n' +
+          browsersListRetrievalError.stack +
+          '\n\n' +
+          'Problem with browser list retrieval.\n' +
+          'Target browser changes won’t be shown.\n'
+      )
+    )
+  } else {
+    var targetBrowserChanges = diffBrowsersLists(
+      oldBrowsersList,
+      currentBrowsersList
+    )
+    if (targetBrowserChanges) {
+      print('\nTarget browser changes:\n')
+      print(targetBrowserChanges + '\n')
+    } else {
+      print('\n' + pico.green('No target browser changes') + '\n')
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/buffer-from/LICENSE b/node_modules/mathjs/examples/node_modules/buffer-from/LICENSE
new file mode 100644
index 0000000..e4bf1d6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/buffer-from/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2016, 2018 Linus Unnebäck
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/buffer-from/index.js b/node_modules/mathjs/examples/node_modules/buffer-from/index.js
new file mode 100644
index 0000000..e1a58b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/buffer-from/index.js
@@ -0,0 +1,72 @@
+/* eslint-disable node/no-deprecated-api */
+
+var toString = Object.prototype.toString
+
+var isModern = (
+  typeof Buffer !== 'undefined' &&
+  typeof Buffer.alloc === 'function' &&
+  typeof Buffer.allocUnsafe === 'function' &&
+  typeof Buffer.from === 'function'
+)
+
+function isArrayBuffer (input) {
+  return toString.call(input).slice(8, -1) === 'ArrayBuffer'
+}
+
+function fromArrayBuffer (obj, byteOffset, length) {
+  byteOffset >>>= 0
+
+  var maxLength = obj.byteLength - byteOffset
+
+  if (maxLength < 0) {
+    throw new RangeError("'offset' is out of bounds")
+  }
+
+  if (length === undefined) {
+    length = maxLength
+  } else {
+    length >>>= 0
+
+    if (length > maxLength) {
+      throw new RangeError("'length' is out of bounds")
+    }
+  }
+
+  return isModern
+    ? Buffer.from(obj.slice(byteOffset, byteOffset + length))
+    : new Buffer(new Uint8Array(obj.slice(byteOffset, byteOffset + length)))
+}
+
+function fromString (string, encoding) {
+  if (typeof encoding !== 'string' || encoding === '') {
+    encoding = 'utf8'
+  }
+
+  if (!Buffer.isEncoding(encoding)) {
+    throw new TypeError('"encoding" must be a valid string encoding')
+  }
+
+  return isModern
+    ? Buffer.from(string, encoding)
+    : new Buffer(string, encoding)
+}
+
+function bufferFrom (value, encodingOrOffset, length) {
+  if (typeof value === 'number') {
+    throw new TypeError('"value" argument must not be a number')
+  }
+
+  if (isArrayBuffer(value)) {
+    return fromArrayBuffer(value, encodingOrOffset, length)
+  }
+
+  if (typeof value === 'string') {
+    return fromString(value, encodingOrOffset)
+  }
+
+  return isModern
+    ? Buffer.from(value)
+    : new Buffer(value)
+}
+
+module.exports = bufferFrom
diff --git a/node_modules/mathjs/examples/node_modules/buffer-from/package.json b/node_modules/mathjs/examples/node_modules/buffer-from/package.json
new file mode 100644
index 0000000..6ac5327
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/buffer-from/package.json
@@ -0,0 +1,19 @@
+{
+  "name": "buffer-from",
+  "version": "1.1.2",
+  "license": "MIT",
+  "repository": "LinusU/buffer-from",
+  "files": [
+    "index.js"
+  ],
+  "scripts": {
+    "test": "standard && node test"
+  },
+  "devDependencies": {
+    "standard": "^12.0.1"
+  },
+  "keywords": [
+    "buffer",
+    "buffer from"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/buffer-from/readme.md b/node_modules/mathjs/examples/node_modules/buffer-from/readme.md
new file mode 100644
index 0000000..9880a55
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/buffer-from/readme.md
@@ -0,0 +1,69 @@
+# Buffer From
+
+A [ponyfill](https://ponyfill.com) for `Buffer.from`, uses native implementation if available.
+
+## Installation
+
+```sh
+npm install --save buffer-from
+```
+
+## Usage
+
+```js
+const bufferFrom = require('buffer-from')
+
+console.log(bufferFrom([1, 2, 3, 4]))
+//=> <Buffer 01 02 03 04>
+
+const arr = new Uint8Array([1, 2, 3, 4])
+console.log(bufferFrom(arr.buffer, 1, 2))
+//=> <Buffer 02 03>
+
+console.log(bufferFrom('test', 'utf8'))
+//=> <Buffer 74 65 73 74>
+
+const buf = bufferFrom('test')
+console.log(bufferFrom(buf))
+//=> <Buffer 74 65 73 74>
+```
+
+## API
+
+### bufferFrom(array)
+
+- `array` &lt;Array&gt;
+
+Allocates a new `Buffer` using an `array` of octets.
+
+### bufferFrom(arrayBuffer[, byteOffset[, length]])
+
+- `arrayBuffer` &lt;ArrayBuffer&gt; The `.buffer` property of a TypedArray or ArrayBuffer
+- `byteOffset` &lt;Integer&gt; Where to start copying from `arrayBuffer`. **Default:** `0`
+- `length` &lt;Integer&gt; How many bytes to copy from `arrayBuffer`. **Default:** `arrayBuffer.length - byteOffset`
+
+When passed a reference to the `.buffer` property of a TypedArray instance, the
+newly created `Buffer` will share the same allocated memory as the TypedArray.
+
+The optional `byteOffset` and `length` arguments specify a memory range within
+the `arrayBuffer` that will be shared by the `Buffer`.
+
+### bufferFrom(buffer)
+
+- `buffer` &lt;Buffer&gt; An existing `Buffer` to copy data from
+
+Copies the passed `buffer` data onto a new `Buffer` instance.
+
+### bufferFrom(string[, encoding])
+
+- `string` &lt;String&gt; A string to encode.
+- `encoding` &lt;String&gt; The encoding of `string`. **Default:** `'utf8'`
+
+Creates a new `Buffer` containing the given JavaScript string `string`. If
+provided, the `encoding` parameter identifies the character encoding of
+`string`.
+
+## See also
+
+- [buffer-alloc](https://github.com/LinusU/buffer-alloc) A ponyfill for `Buffer.alloc`
+- [buffer-alloc-unsafe](https://github.com/LinusU/buffer-alloc-unsafe) A ponyfill for `Buffer.allocUnsafe`
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/LICENSE b/node_modules/mathjs/examples/node_modules/caniuse-lite/LICENSE
new file mode 100644
index 0000000..06c608d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/LICENSE
@@ -0,0 +1,395 @@
+Attribution 4.0 International
+
+=======================================================================
+
+Creative Commons Corporation ("Creative Commons") is not a law firm and
+does not provide legal services or legal advice. Distribution of
+Creative Commons public licenses does not create a lawyer-client or
+other relationship. Creative Commons makes its licenses and related
+information available on an "as-is" basis. Creative Commons gives no
+warranties regarding its licenses, any material licensed under their
+terms and conditions, or any related information. Creative Commons
+disclaims all liability for damages resulting from their use to the
+fullest extent possible.
+
+Using Creative Commons Public Licenses
+
+Creative Commons public licenses provide a standard set of terms and
+conditions that creators and other rights holders may use to share
+original works of authorship and other material subject to copyright
+and certain other rights specified in the public license below. The
+following considerations are for informational purposes only, are not
+exhaustive, and do not form part of our licenses.
+
+     Considerations for licensors: Our public licenses are
+     intended for use by those authorized to give the public
+     permission to use material in ways otherwise restricted by
+     copyright and certain other rights. Our licenses are
+     irrevocable. Licensors should read and understand the terms
+     and conditions of the license they choose before applying it.
+     Licensors should also secure all rights necessary before
+     applying our licenses so that the public can reuse the
+     material as expected. Licensors should clearly mark any
+     material not subject to the license. This includes other CC-
+     licensed material, or material used under an exception or
+     limitation to copyright. More considerations for licensors:
+	wiki.creativecommons.org/Considerations_for_licensors
+
+     Considerations for the public: By using one of our public
+     licenses, a licensor grants the public permission to use the
+     licensed material under specified terms and conditions. If
+     the licensor's permission is not necessary for any reason--for
+     example, because of any applicable exception or limitation to
+     copyright--then that use is not regulated by the license. Our
+     licenses grant only permissions under copyright and certain
+     other rights that a licensor has authority to grant. Use of
+     the licensed material may still be restricted for other
+     reasons, including because others have copyright or other
+     rights in the material. A licensor may make special requests,
+     such as asking that all changes be marked or described.
+     Although not required by our licenses, you are encouraged to
+     respect those requests where reasonable. More_considerations
+     for the public: 
+	wiki.creativecommons.org/Considerations_for_licensees
+
+=======================================================================
+
+Creative Commons Attribution 4.0 International Public License
+
+By exercising the Licensed Rights (defined below), You accept and agree
+to be bound by the terms and conditions of this Creative Commons
+Attribution 4.0 International Public License ("Public License"). To the
+extent this Public License may be interpreted as a contract, You are
+granted the Licensed Rights in consideration of Your acceptance of
+these terms and conditions, and the Licensor grants You such rights in
+consideration of benefits the Licensor receives from making the
+Licensed Material available under these terms and conditions.
+
+
+Section 1 -- Definitions.
+
+  a. Adapted Material means material subject to Copyright and Similar
+     Rights that is derived from or based upon the Licensed Material
+     and in which the Licensed Material is translated, altered,
+     arranged, transformed, or otherwise modified in a manner requiring
+     permission under the Copyright and Similar Rights held by the
+     Licensor. For purposes of this Public License, where the Licensed
+     Material is a musical work, performance, or sound recording,
+     Adapted Material is always produced where the Licensed Material is
+     synched in timed relation with a moving image.
+
+  b. Adapter's License means the license You apply to Your Copyright
+     and Similar Rights in Your contributions to Adapted Material in
+     accordance with the terms and conditions of this Public License.
+
+  c. Copyright and Similar Rights means copyright and/or similar rights
+     closely related to copyright including, without limitation,
+     performance, broadcast, sound recording, and Sui Generis Database
+     Rights, without regard to how the rights are labeled or
+     categorized. For purposes of this Public License, the rights
+     specified in Section 2(b)(1)-(2) are not Copyright and Similar
+     Rights.
+
+  d. Effective Technological Measures means those measures that, in the
+     absence of proper authority, may not be circumvented under laws
+     fulfilling obligations under Article 11 of the WIPO Copyright
+     Treaty adopted on December 20, 1996, and/or similar international
+     agreements.
+
+  e. Exceptions and Limitations means fair use, fair dealing, and/or
+     any other exception or limitation to Copyright and Similar Rights
+     that applies to Your use of the Licensed Material.
+
+  f. Licensed Material means the artistic or literary work, database,
+     or other material to which the Licensor applied this Public
+     License.
+
+  g. Licensed Rights means the rights granted to You subject to the
+     terms and conditions of this Public License, which are limited to
+     all Copyright and Similar Rights that apply to Your use of the
+     Licensed Material and that the Licensor has authority to license.
+
+  h. Licensor means the individual(s) or entity(ies) granting rights
+     under this Public License.
+
+  i. Share means to provide material to the public by any means or
+     process that requires permission under the Licensed Rights, such
+     as reproduction, public display, public performance, distribution,
+     dissemination, communication, or importation, and to make material
+     available to the public including in ways that members of the
+     public may access the material from a place and at a time
+     individually chosen by them.
+
+  j. Sui Generis Database Rights means rights other than copyright
+     resulting from Directive 96/9/EC of the European Parliament and of
+     the Council of 11 March 1996 on the legal protection of databases,
+     as amended and/or succeeded, as well as other essentially
+     equivalent rights anywhere in the world.
+
+  k. You means the individual or entity exercising the Licensed Rights
+     under this Public License. Your has a corresponding meaning.
+
+
+Section 2 -- Scope.
+
+  a. License grant.
+
+       1. Subject to the terms and conditions of this Public License,
+          the Licensor hereby grants You a worldwide, royalty-free,
+          non-sublicensable, non-exclusive, irrevocable license to
+          exercise the Licensed Rights in the Licensed Material to:
+
+            a. reproduce and Share the Licensed Material, in whole or
+               in part; and
+
+            b. produce, reproduce, and Share Adapted Material.
+
+       2. Exceptions and Limitations. For the avoidance of doubt, where
+          Exceptions and Limitations apply to Your use, this Public
+          License does not apply, and You do not need to comply with
+          its terms and conditions.
+
+       3. Term. The term of this Public License is specified in Section
+          6(a).
+
+       4. Media and formats; technical modifications allowed. The
+          Licensor authorizes You to exercise the Licensed Rights in
+          all media and formats whether now known or hereafter created,
+          and to make technical modifications necessary to do so. The
+          Licensor waives and/or agrees not to assert any right or
+          authority to forbid You from making technical modifications
+          necessary to exercise the Licensed Rights, including
+          technical modifications necessary to circumvent Effective
+          Technological Measures. For purposes of this Public License,
+          simply making modifications authorized by this Section 2(a)
+          (4) never produces Adapted Material.
+
+       5. Downstream recipients.
+
+            a. Offer from the Licensor -- Licensed Material. Every
+               recipient of the Licensed Material automatically
+               receives an offer from the Licensor to exercise the
+               Licensed Rights under the terms and conditions of this
+               Public License.
+
+            b. No downstream restrictions. You may not offer or impose
+               any additional or different terms or conditions on, or
+               apply any Effective Technological Measures to, the
+               Licensed Material if doing so restricts exercise of the
+               Licensed Rights by any recipient of the Licensed
+               Material.
+
+       6. No endorsement. Nothing in this Public License constitutes or
+          may be construed as permission to assert or imply that You
+          are, or that Your use of the Licensed Material is, connected
+          with, or sponsored, endorsed, or granted official status by,
+          the Licensor or others designated to receive attribution as
+          provided in Section 3(a)(1)(A)(i).
+
+  b. Other rights.
+
+       1. Moral rights, such as the right of integrity, are not
+          licensed under this Public License, nor are publicity,
+          privacy, and/or other similar personality rights; however, to
+          the extent possible, the Licensor waives and/or agrees not to
+          assert any such rights held by the Licensor to the limited
+          extent necessary to allow You to exercise the Licensed
+          Rights, but not otherwise.
+
+       2. Patent and trademark rights are not licensed under this
+          Public License.
+
+       3. To the extent possible, the Licensor waives any right to
+          collect royalties from You for the exercise of the Licensed
+          Rights, whether directly or through a collecting society
+          under any voluntary or waivable statutory or compulsory
+          licensing scheme. In all other cases the Licensor expressly
+          reserves any right to collect such royalties.
+
+
+Section 3 -- License Conditions.
+
+Your exercise of the Licensed Rights is expressly made subject to the
+following conditions.
+
+  a. Attribution.
+
+       1. If You Share the Licensed Material (including in modified
+          form), You must:
+
+            a. retain the following if it is supplied by the Licensor
+               with the Licensed Material:
+
+                 i. identification of the creator(s) of the Licensed
+                    Material and any others designated to receive
+                    attribution, in any reasonable manner requested by
+                    the Licensor (including by pseudonym if
+                    designated);
+
+                ii. a copyright notice;
+
+               iii. a notice that refers to this Public License;
+
+                iv. a notice that refers to the disclaimer of
+                    warranties;
+
+                 v. a URI or hyperlink to the Licensed Material to the
+                    extent reasonably practicable;
+
+            b. indicate if You modified the Licensed Material and
+               retain an indication of any previous modifications; and
+
+            c. indicate the Licensed Material is licensed under this
+               Public License, and include the text of, or the URI or
+               hyperlink to, this Public License.
+
+       2. You may satisfy the conditions in Section 3(a)(1) in any
+          reasonable manner based on the medium, means, and context in
+          which You Share the Licensed Material. For example, it may be
+          reasonable to satisfy the conditions by providing a URI or
+          hyperlink to a resource that includes the required
+          information.
+
+       3. If requested by the Licensor, You must remove any of the
+          information required by Section 3(a)(1)(A) to the extent
+          reasonably practicable.
+
+       4. If You Share Adapted Material You produce, the Adapter's
+          License You apply must not prevent recipients of the Adapted
+          Material from complying with this Public License.
+
+
+Section 4 -- Sui Generis Database Rights.
+
+Where the Licensed Rights include Sui Generis Database Rights that
+apply to Your use of the Licensed Material:
+
+  a. for the avoidance of doubt, Section 2(a)(1) grants You the right
+     to extract, reuse, reproduce, and Share all or a substantial
+     portion of the contents of the database;
+
+  b. if You include all or a substantial portion of the database
+     contents in a database in which You have Sui Generis Database
+     Rights, then the database in which You have Sui Generis Database
+     Rights (but not its individual contents) is Adapted Material; and
+
+  c. You must comply with the conditions in Section 3(a) if You Share
+     all or a substantial portion of the contents of the database.
+
+For the avoidance of doubt, this Section 4 supplements and does not
+replace Your obligations under this Public License where the Licensed
+Rights include other Copyright and Similar Rights.
+
+
+Section 5 -- Disclaimer of Warranties and Limitation of Liability.
+
+  a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE
+     EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS
+     AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF
+     ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,
+     IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,
+     WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR
+     PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,
+     ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT
+     KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT
+     ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.
+
+  b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE
+     TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,
+     NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,
+     INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,
+     COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR
+     USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN
+     ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR
+     DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR
+     IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.
+
+  c. The disclaimer of warranties and limitation of liability provided
+     above shall be interpreted in a manner that, to the extent
+     possible, most closely approximates an absolute disclaimer and
+     waiver of all liability.
+
+
+Section 6 -- Term and Termination.
+
+  a. This Public License applies for the term of the Copyright and
+     Similar Rights licensed here. However, if You fail to comply with
+     this Public License, then Your rights under this Public License
+     terminate automatically.
+
+  b. Where Your right to use the Licensed Material has terminated under
+     Section 6(a), it reinstates:
+
+       1. automatically as of the date the violation is cured, provided
+          it is cured within 30 days of Your discovery of the
+          violation; or
+
+       2. upon express reinstatement by the Licensor.
+
+     For the avoidance of doubt, this Section 6(b) does not affect any
+     right the Licensor may have to seek remedies for Your violations
+     of this Public License.
+
+  c. For the avoidance of doubt, the Licensor may also offer the
+     Licensed Material under separate terms or conditions or stop
+     distributing the Licensed Material at any time; however, doing so
+     will not terminate this Public License.
+
+  d. Sections 1, 5, 6, 7, and 8 survive termination of this Public
+     License.
+
+
+Section 7 -- Other Terms and Conditions.
+
+  a. The Licensor shall not be bound by any additional or different
+     terms or conditions communicated by You unless expressly agreed.
+
+  b. Any arrangements, understandings, or agreements regarding the
+     Licensed Material not stated herein are separate from and
+     independent of the terms and conditions of this Public License.
+
+
+Section 8 -- Interpretation.
+
+  a. For the avoidance of doubt, this Public License does not, and
+     shall not be interpreted to, reduce, limit, restrict, or impose
+     conditions on any use of the Licensed Material that could lawfully
+     be made without permission under this Public License.
+
+  b. To the extent possible, if any provision of this Public License is
+     deemed unenforceable, it shall be automatically reformed to the
+     minimum extent necessary to make it enforceable. If the provision
+     cannot be reformed, it shall be severed from this Public License
+     without affecting the enforceability of the remaining terms and
+     conditions.
+
+  c. No term or condition of this Public License will be waived and no
+     failure to comply consented to unless expressly agreed to by the
+     Licensor.
+
+  d. Nothing in this Public License constitutes or may be interpreted
+     as a limitation upon, or waiver of, any privileges and immunities
+     that apply to the Licensor or You, including from the legal
+     processes of any jurisdiction or authority.
+
+
+=======================================================================
+
+Creative Commons is not a party to its public
+licenses. Notwithstanding, Creative Commons may elect to apply one of
+its public licenses to material it publishes and in those instances
+will be considered the “Licensor.” The text of the Creative Commons
+public licenses is dedicated to the public domain under the CC0 Public
+Domain Dedication. Except for the limited purpose of indicating that
+material is shared under a Creative Commons public license or as
+otherwise permitted by the Creative Commons policies published at
+creativecommons.org/policies, Creative Commons does not authorize the
+use of the trademark "Creative Commons" or any other trademark or logo
+of Creative Commons without its prior written consent including,
+without limitation, in connection with any unauthorized modifications
+to any of its public licenses or any other arrangements,
+understandings, or agreements concerning use of licensed material. For
+the avoidance of doubt, this paragraph does not form part of the
+public licenses.
+
+Creative Commons may be contacted at creativecommons.org.
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/README.md b/node_modules/mathjs/examples/node_modules/caniuse-lite/README.md
new file mode 100644
index 0000000..f4878ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/README.md
@@ -0,0 +1,92 @@
+# caniuse-lite
+
+A smaller version of caniuse-db, with only the essentials!
+
+## Why?
+
+The full data behind [Can I use][1] is incredibly useful for any front end
+developer, and on the website all of the details from the database are displayed
+to the user. However in automated tools, [many of these fields go unused][2];
+it's not a problem for server side consumption but client side, the less
+JavaScript that we send to the end user the better.
+
+caniuse-lite then, is a smaller dataset that keeps essential parts of the data
+in a compact format. It does this in multiple ways, such as converting `null`
+array entries into empty strings, representing support data as an integer rather
+than a string, and using base62 references instead of longer human-readable
+keys.
+
+This packed data is then reassembled (via functions exposed by this module) into
+a larger format which is mostly compatible with caniuse-db, and so it can be
+used as an almost drop-in replacement for caniuse-db for contexts where size on
+disk is important; for example, usage in web browsers. The API differences are
+very small and are detailed in the section below.
+
+
+## API
+
+```js
+import * as lite from 'caniuse-lite';
+```
+
+
+### `lite.agents`
+
+caniuse-db provides a full `data.json` file which contains all of the features
+data. Instead of this large file, caniuse-lite provides this data subset
+instead, which has the `browser`, `prefix`, `prefix_exceptions`, `usage_global`
+and `versions` keys from the original.
+
+In addition, the subset contains the `release_date` key with release dates (as timestamps) for each version:
+```json
+{
+  "release_date": {
+    "6": 998870400,
+    "7": 1161129600,
+    "8": 1237420800,
+    "9": 1300060800,
+    "10": 1346716800,
+    "11": 1381968000,
+    "5.5": 962323200
+  }
+}
+```
+
+
+### `lite.feature(js)`
+
+The `feature` method takes a file from `data/features` and converts it into
+something that more closely represents the `caniuse-db` format. Note that only
+the `title`, `stats` and `status` keys are kept from the original data.
+
+
+### `lite.features`
+
+The `features` index is provided as a way to query all of the features that
+are listed in the `caniuse-db` dataset. Note that you will need to use the
+`feature` method on values from this index to get a human-readable format.
+
+
+### `lite.region(js)`
+
+The `region` method takes a file from `data/regions` and converts it into
+something that more closely represents the `caniuse-db` format. Note that *only*
+the usage data is exposed here (the `data` key in the original files).
+
+
+## License
+
+The data in this repo is available for use under a CC BY 4.0 license
+(http://creativecommons.org/licenses/by/4.0/). For attribution just mention
+somewhere that the source is caniuse.com. If you have any questions about using
+the data for your project please contact me here: http://a.deveria.com/contact
+
+[1]: http://caniuse.com/
+[2]: https://github.com/Fyrd/caniuse/issues/1827
+
+
+## Security contact information
+
+To report a security vulnerability, please use the
+[Tidelift security contact](https://tidelift.com/security).
+Tidelift will coordinate the fix and disclosure.
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/agents.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/agents.js
new file mode 100644
index 0000000..d5d119d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/agents.js
@@ -0,0 +1 @@
+module.exports={A:{A:{J:0.0131217,D:0.00621152,E:0.0395479,F:0.0593219,A:0.0263653,B:0.619584,sB:0.009298},B:"ms",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","sB","J","D","E","F","A","B","","",""],E:"IE",F:{sB:962323200,J:998870400,D:1161129600,E:1237420800,F:1300060800,A:1346716800,B:1381968000}},B:{A:{C:0.008322,K:0.004267,L:0.004268,G:0.012483,M:0.004161,N:0.012483,O:0.074898,P:0,Q:0.004298,R:0.00944,S:0.004043,V:0.004161,W:0.008322,X:0.004161,Y:0.008322,Z:0.004318,a:0.008322,b:0.004161,c:0.004161,d:0.012483,e:0.004161,f:0.008322,g:0.029127,T:0.049932,h:0.853005,i:2.98344,H:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","C","K","L","G","M","N","O","P","Q","R","S","V","W","X","Y","Z","a","b","c","d","e","f","g","T","h","i","H","","",""],E:"Edge",F:{C:1438128000,K:1447286400,L:1470096000,G:1491868800,M:1508198400,N:1525046400,O:1542067200,P:1579046400,Q:1581033600,R:1586736000,S:1590019200,V:1594857600,W:1598486400,X:1602201600,Y:1605830400,Z:1611360000,a:1614816000,b:1618358400,c:1622073600,d:1626912000,e:1630627200,f:1632441600,g:1634774400,T:1637539200,h:1641427200,i:1643932800,H:1646265600},D:{C:"ms",K:"ms",L:"ms",G:"ms",M:"ms",N:"ms",O:"ms"}},C:{A:{"0":0.009076,"1":0.004161,"2":0.004783,"3":0.004271,"4":0.004783,"5":0.00487,"6":0.005029,"7":0.0047,"8":0.04161,"9":0.008322,tB:0.008322,hB:0.004271,I:0.016644,j:0.004879,J:0.020136,D:0.005725,E:0.004525,F:0.00533,A:0.004283,B:0.004318,C:0.004471,K:0.004486,L:0.00453,G:0.008322,M:0.004417,N:0.004425,O:0.004161,k:0.004443,l:0.004283,m:0.008322,n:0.013698,o:0.004161,p:0.008786,q:0.012483,r:0.004317,s:0.004393,t:0.004418,u:0.008834,v:0.008322,w:0.008928,x:0.004471,y:0.009284,z:0.004707,AB:0.004356,BB:0.004525,CB:0.004293,DB:0.004161,EB:0.004538,FB:0.008282,GB:0.008322,HB:0.062415,IB:0.004335,JB:0.008586,KB:0.008322,LB:0.008322,MB:0.004425,NB:0.004356,iB:0.004161,OB:0.008322,jB:0.004356,PB:0.004425,QB:0.008322,U:0.00415,RB:0.004267,SB:0.008712,TB:0.004267,UB:0.008322,VB:0.00415,WB:0.004293,XB:0.004425,YB:0.008322,ZB:0.00415,aB:0.00415,bB:0.004318,cB:0.004356,dB:0.004161,eB:0.058254,P:0.008322,Q:0.004161,R:0.016644,kB:0.004161,S:0.004161,V:0.012483,W:0.004268,X:0.004161,Y:0.012483,Z:0.012483,a:0.012483,b:0.020805,c:0.099864,d:0.008322,e:0.012483,f:0.045771,g:0.045771,T:1.16508,h:2.02641,i:0.016644,H:0,lB:0,uB:0.008786,vB:0.00487},B:"moz",C:["tB","hB","uB","vB","I","j","J","D","E","F","A","B","C","K","L","G","M","N","O","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z","0","1","2","3","4","5","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","iB","OB","jB","PB","QB","U","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","P","Q","R","kB","S","V","W","X","Y","Z","a","b","c","d","e","f","g","T","h","i","H","lB",""],E:"Firefox",F:{"0":1421107200,"1":1424736000,"2":1428278400,"3":1431475200,"4":1435881600,"5":1439251200,"6":1442880000,"7":1446508800,"8":1450137600,"9":1453852800,tB:1161648000,hB:1213660800,uB:1246320000,vB:1264032000,I:1300752000,j:1308614400,J:1313452800,D:1317081600,E:1317081600,F:1320710400,A:1324339200,B:1327968000,C:1331596800,K:1335225600,L:1338854400,G:1342483200,M:1346112000,N:1349740800,O:1353628800,k:1357603200,l:1361232000,m:1364860800,n:1368489600,o:1372118400,p:1375747200,q:1379376000,r:1386633600,s:1391472000,t:1395100800,u:1398729600,v:1402358400,w:1405987200,x:1409616000,y:1413244800,z:1417392000,AB:1457395200,BB:1461628800,CB:1465257600,DB:1470096000,EB:1474329600,FB:1479168000,GB:1485216000,HB:1488844800,IB:1492560000,JB:1497312000,KB:1502150400,LB:1506556800,MB:1510617600,NB:1516665600,iB:1520985600,OB:1525824000,jB:1529971200,PB:1536105600,QB:1540252800,U:1544486400,RB:1548720000,SB:1552953600,TB:1558396800,UB:1562630400,VB:1567468800,WB:1571788800,XB:1575331200,YB:1578355200,ZB:1581379200,aB:1583798400,bB:1586304000,cB:1588636800,dB:1591056000,eB:1593475200,P:1595894400,Q:1598313600,R:1600732800,kB:1603152000,S:1605571200,V:1607990400,W:1611619200,X:1614038400,Y:1616457600,Z:1618790400,a:1622505600,b:1626134400,c:1628553600,d:1630972800,e:1633392000,f:1635811200,g:1638835200,T:1641859200,h:1644364800,i:1646697600,H:null,lB:null}},D:{A:{"0":0.016644,"1":0.004335,"2":0.004464,"3":0.020805,"4":0.004464,"5":0.012483,"6":0.0236,"7":0.004293,"8":0.008322,"9":0.004465,I:0.004706,j:0.004879,J:0.004879,D:0.005591,E:0.005591,F:0.005591,A:0.004534,B:0.004464,C:0.010424,K:0.0083,L:0.004706,G:0.015087,M:0.004393,N:0.004393,O:0.008652,k:0.008322,l:0.004393,m:0.004317,n:0.008322,o:0.008786,p:0.016644,q:0.004461,r:0.004141,s:0.004326,t:0.0047,u:0.004538,v:0.008322,w:0.008596,x:0.004566,y:0.008322,z:0.008322,AB:0.004642,BB:0.004891,CB:0.008322,DB:0.020805,EB:0.070737,FB:0.004293,GB:0.008322,HB:0.004161,IB:0.012483,JB:0.008322,KB:0.012483,LB:0.054093,MB:0.004161,NB:0.004161,iB:0.004161,OB:0.020805,jB:0.004161,PB:0.008322,QB:0.008322,U:0.020805,RB:0.012483,SB:0.020805,TB:0.012483,UB:0.008322,VB:0.054093,WB:0.049932,XB:0.016644,YB:0.091542,ZB:0.008322,aB:0.024966,bB:0.062415,cB:0.058254,dB:0.016644,eB:0.037449,P:0.212211,Q:0.058254,R:0.037449,S:0.104025,V:0.066576,W:0.070737,X:0.070737,Y:0.128991,Z:0.037449,a:0.062415,b:0.049932,c:0.112347,d:0.099864,e:0.262143,f:0.174762,g:0.099864,T:0.649116,h:7.14028,i:15.533,H:0.016644,lB:0.020805,wB:0.004161,xB:0},B:"webkit",C:["","","","","I","j","J","D","E","F","A","B","C","K","L","G","M","N","O","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z","0","1","2","3","4","5","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","iB","OB","jB","PB","QB","U","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","P","Q","R","S","V","W","X","Y","Z","a","b","c","d","e","f","g","T","h","i","H","lB","wB","xB"],E:"Chrome",F:{"0":1400544000,"1":1405468800,"2":1409011200,"3":1412640000,"4":1416268800,"5":1421798400,"6":1425513600,"7":1429401600,"8":1432080000,"9":1437523200,I:1264377600,j:1274745600,J:1283385600,D:1287619200,E:1291248000,F:1296777600,A:1299542400,B:1303862400,C:1307404800,K:1312243200,L:1316131200,G:1316131200,M:1319500800,N:1323734400,O:1328659200,k:1332892800,l:1337040000,m:1340668800,n:1343692800,o:1348531200,p:1352246400,q:1357862400,r:1361404800,s:1364428800,t:1369094400,u:1374105600,v:1376956800,w:1384214400,x:1389657600,y:1392940800,z:1397001600,AB:1441152000,BB:1444780800,CB:1449014400,DB:1453248000,EB:1456963200,FB:1460592000,GB:1464134400,HB:1469059200,IB:1472601600,JB:1476230400,KB:1480550400,LB:1485302400,MB:1489017600,NB:1492560000,iB:1496707200,OB:1500940800,jB:1504569600,PB:1508198400,QB:1512518400,U:1516752000,RB:1520294400,SB:1523923200,TB:1527552000,UB:1532390400,VB:1536019200,WB:1539648000,XB:1543968000,YB:1548720000,ZB:1552348800,aB:1555977600,bB:1559606400,cB:1564444800,dB:1568073600,eB:1571702400,P:1575936000,Q:1580860800,R:1586304000,S:1589846400,V:1594684800,W:1598313600,X:1601942400,Y:1605571200,Z:1611014400,a:1614556800,b:1618272000,c:1621987200,d:1626739200,e:1630368000,f:1632268800,g:1634601600,T:1637020800,h:1641340800,i:1643673600,H:1646092800,lB:null,wB:null,xB:null}},E:{A:{I:0,j:0.008322,J:0.004656,D:0.004465,E:0.004356,F:0.004891,A:0.004425,B:0.004318,C:0.004161,K:0.049932,L:0.237177,G:0.145635,yB:0,mB:0.008692,zB:0.012483,"0B":0.00456,"1B":0.004283,"2B":0.016644,nB:0.012483,fB:0.029127,gB:0.058254,"3B":0.478515,"4B":0.877971,"5B":0.420261,oB:0.936225,pB:0.012483,"6B":0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","yB","mB","I","j","zB","J","0B","D","1B","E","F","2B","A","nB","B","fB","C","gB","K","3B","L","4B","G","5B","oB","pB","6B","",""],E:"Safari",F:{yB:1205798400,mB:1226534400,I:1244419200,j:1275868800,zB:1311120000,J:1343174400,"0B":1382400000,D:1382400000,"1B":1410998400,E:1413417600,F:1443657600,"2B":1458518400,A:1474329600,nB:1490572800,B:1505779200,fB:1522281600,C:1537142400,gB:1553472000,K:1568851200,"3B":1585008000,L:1600214400,"4B":1619395200,G:1632096000,"5B":1635292800,oB:1639353600,pB:1647216000,"6B":null}},F:{A:{"0":0.004879,"1":0.004161,"2":0.004283,"3":0.004367,"4":0.004534,"5":0.008322,"6":0.004227,"7":0.004418,"8":0.004161,"9":0.004227,F:0.0082,B:0.016581,C:0.004317,G:0.00685,M:0.00685,N:0.00685,O:0.005014,k:0.006015,l:0.004879,m:0.006597,n:0.006597,o:0.013434,p:0.006702,q:0.006015,r:0.005595,s:0.004393,t:0.004161,u:0.004879,v:0.004879,w:0.004161,x:0.005152,y:0.005014,z:0.009758,AB:0.004725,BB:0.008322,CB:0.008942,DB:0.004707,EB:0.004827,FB:0.004707,GB:0.004707,HB:0.004326,IB:0.008922,JB:0.014349,KB:0.004425,LB:0.00472,MB:0.004425,NB:0.004425,OB:0.00472,PB:0.004532,QB:0.004566,U:0.02283,RB:0.00867,SB:0.004656,TB:0.004642,UB:0.004318,VB:0.00944,WB:0.004293,XB:0.004293,YB:0.004298,ZB:0.096692,aB:0.004201,bB:0.004141,cB:0.004257,dB:0.004161,eB:0.004356,P:0.004161,Q:0.004161,R:0.008514,kB:0.228855,S:0.786429,"7B":0.00685,"8B":0.004161,"9B":0.008392,AC:0.004706,fB:0.006229,qB:0.004879,BC:0.008786,gB:0.00472},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","F","7B","8B","9B","AC","B","fB","qB","BC","C","gB","G","M","N","O","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z","0","1","2","3","4","5","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","OB","PB","QB","U","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","P","Q","R","kB","S","","",""],E:"Opera",F:{"0":1454371200,"1":1457308800,"2":1462320000,"3":1465344000,"4":1470096000,"5":1474329600,"6":1477267200,"7":1481587200,"8":1486425600,"9":1490054400,F:1150761600,"7B":1223424000,"8B":1251763200,"9B":1267488000,AC:1277942400,B:1292457600,fB:1302566400,qB:1309219200,BC:1323129600,C:1323129600,gB:1352073600,G:1372723200,M:1377561600,N:1381104000,O:1386288000,k:1390867200,l:1393891200,m:1399334400,n:1401753600,o:1405987200,p:1409616000,q:1413331200,r:1417132800,s:1422316800,t:1425945600,u:1430179200,v:1433808000,w:1438646400,x:1442448000,y:1445904000,z:1449100800,AB:1494374400,BB:1498003200,CB:1502236800,DB:1506470400,EB:1510099200,FB:1515024000,GB:1517961600,HB:1521676800,IB:1525910400,JB:1530144000,KB:1534982400,LB:1537833600,MB:1543363200,NB:1548201600,OB:1554768000,PB:1561593600,QB:1566259200,U:1570406400,RB:1573689600,SB:1578441600,TB:1583971200,UB:1587513600,VB:1592956800,WB:1595894400,XB:1600128000,YB:1603238400,ZB:1613520000,aB:1612224000,bB:1616544000,cB:1619568000,dB:1623715200,eB:1627948800,P:1631577600,Q:1633392000,R:1635984000,kB:1638403200,S:1642550400},D:{F:"o",B:"o",C:"o","7B":"o","8B":"o","9B":"o",AC:"o",fB:"o",qB:"o",BC:"o",gB:"o"}},G:{A:{E:0,mB:0,CC:0,rB:0.00298579,DC:0.00447869,EC:0.122417,FC:0.0194077,GC:0.00746448,HC:0.0134361,IC:0.0836022,JC:0.0388153,KC:0.0955454,LC:0.0641945,MC:0.0373224,NC:0.0373224,OC:0.559836,PC:0.0373224,QC:0.0134361,RC:0.0761377,SC:0.244835,TC:0.777799,UC:2.77828,VC:2.12738,oB:7.74216,pB:0.0403082},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","mB","CC","rB","DC","EC","FC","E","GC","HC","IC","JC","KC","LC","MC","NC","OC","PC","QC","RC","SC","TC","UC","VC","oB","pB","","",""],E:"Safari on iOS",F:{mB:1270252800,CC:1283904000,rB:1299628800,DC:1331078400,EC:1359331200,FC:1394409600,E:1410912000,GC:1413763200,HC:1442361600,IC:1458518400,JC:1473724800,KC:1490572800,LC:1505779200,MC:1522281600,NC:1537142400,OC:1553472000,PC:1568851200,QC:1572220800,RC:1580169600,SC:1585008000,TC:1600214400,UC:1619395200,VC:1632096000,oB:1639353600,pB:1647216000}},H:{A:{WC:1.03373},B:"o",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","WC","","",""],E:"Opera Mini",F:{WC:1426464000}},I:{A:{hB:0,I:0.0133463,H:0,XC:0,YC:0,ZC:0,aC:0.0133463,rB:0.0633949,bC:0,cC:0.260253},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","XC","YC","ZC","hB","I","aC","rB","bC","cC","H","","",""],E:"Android Browser",F:{XC:1256515200,YC:1274313600,ZC:1291593600,hB:1298332800,I:1318896000,aC:1341792000,rB:1374624000,bC:1386547200,cC:1401667200,H:1646092800}},J:{A:{D:0,A:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","D","A","","",""],E:"Blackberry Browser",F:{D:1325376000,A:1359504000}},K:{A:{A:0,B:0,C:0,U:0.0111391,fB:0,qB:0,gB:0},B:"o",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A","B","fB","qB","C","gB","U","","",""],E:"Opera Mobile",F:{A:1287100800,B:1300752000,fB:1314835200,qB:1318291200,C:1330300800,gB:1349740800,U:1613433600},D:{U:"webkit"}},L:{A:{H:37.2095},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","H","","",""],E:"Chrome for Android",F:{H:1646092800}},M:{A:{T:0.280272},B:"moz",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","T","","",""],E:"Firefox for Android",F:{T:1641859200}},N:{A:{A:0.0115934,B:0.022664},B:"ms",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A","B","","",""],E:"IE Mobile",F:{A:1340150400,B:1353456000}},O:{A:{dC:0.864172},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","dC","","",""],E:"UC Browser for Android",F:{dC:1471392000},D:{dC:"webkit"}},P:{A:{I:0.218332,eC:0.0103543,fC:0.010304,gC:0.0727775,hC:0.0103584,iC:0.0311903,nB:0.0105043,jC:0.0727775,kC:0.0311903,lC:0.103968,mC:0.114365,nC:0.145555,oC:2.10015},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","I","eC","fC","gC","hC","iC","nB","jC","kC","lC","mC","nC","oC","","",""],E:"Samsung Internet",F:{I:1461024000,eC:1481846400,fC:1509408000,gC:1528329600,hC:1546128000,iC:1554163200,nB:1567900800,jC:1582588800,kC:1593475200,lC:1605657600,mC:1618531200,nC:1629072000,oC:1640736000}},Q:{A:{pC:0.169331},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","pC","","",""],E:"QQ Browser",F:{pC:1589846400}},R:{A:{qC:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","qC","","",""],E:"Baidu Browser",F:{qC:1491004800}},S:{A:{rC:0.099263},B:"moz",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","rC","","",""],E:"KaiOS Browser",F:{rC:1527811200}}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/browserVersions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/browserVersions.js
new file mode 100644
index 0000000..66b13af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/browserVersions.js
@@ -0,0 +1 @@
+module.exports={"0":"35","1":"36","2":"37","3":"38","4":"39","5":"40","6":"41","7":"42","8":"43","9":"44",A:"10",B:"11",C:"12",D:"7",E:"8",F:"9",G:"15",H:"99",I:"4",J:"6",K:"13",L:"14",M:"16",N:"17",O:"18",P:"79",Q:"80",R:"81",S:"83",T:"96",U:"64",V:"84",W:"85",X:"86",Y:"87",Z:"88",a:"89",b:"90",c:"91",d:"92",e:"93",f:"94",g:"95",h:"97",i:"98",j:"5",k:"19",l:"20",m:"21",n:"22",o:"23",p:"24",q:"25",r:"26",s:"27",t:"28",u:"29",v:"30",w:"31",x:"32",y:"33",z:"34",AB:"45",BB:"46",CB:"47",DB:"48",EB:"49",FB:"50",GB:"51",HB:"52",IB:"53",JB:"54",KB:"55",LB:"56",MB:"57",NB:"58",OB:"60",PB:"62",QB:"63",RB:"65",SB:"66",TB:"67",UB:"68",VB:"69",WB:"70",XB:"71",YB:"72",ZB:"73",aB:"74",bB:"75",cB:"76",dB:"77",eB:"78",fB:"11.1",gB:"12.1",hB:"3",iB:"59",jB:"61",kB:"82",lB:"100",mB:"3.2",nB:"10.1",oB:"15.2-15.3",pB:"15.4",qB:"11.5",rB:"4.2-4.3",sB:"5.5",tB:"2",uB:"3.5",vB:"3.6",wB:"101",xB:"102",yB:"3.1",zB:"5.1","0B":"6.1","1B":"7.1","2B":"9.1","3B":"13.1","4B":"14.1","5B":"15.1","6B":"TP","7B":"9.5-9.6","8B":"10.0-10.1","9B":"10.5",AC:"10.6",BC:"11.6",CC:"4.0-4.1",DC:"5.0-5.1",EC:"6.0-6.1",FC:"7.0-7.1",GC:"8.1-8.4",HC:"9.0-9.2",IC:"9.3",JC:"10.0-10.2",KC:"10.3",LC:"11.0-11.2",MC:"11.3-11.4",NC:"12.0-12.1",OC:"12.2-12.5",PC:"13.0-13.1",QC:"13.2",RC:"13.3",SC:"13.4-13.7",TC:"14.0-14.4",UC:"14.5-14.8",VC:"15.0-15.1",WC:"all",XC:"2.1",YC:"2.2",ZC:"2.3",aC:"4.1",bC:"4.4",cC:"4.4.3-4.4.4",dC:"12.12",eC:"5.0-5.4",fC:"6.2-6.4",gC:"7.2-7.4",hC:"8.2",iC:"9.2",jC:"11.1-11.2",kC:"12.0",lC:"13.0",mC:"14.0",nC:"15.0",oC:"16.0",pC:"10.4",qC:"7.12",rC:"2.5"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/browsers.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/browsers.js
new file mode 100644
index 0000000..04fbb50
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/browsers.js
@@ -0,0 +1 @@
+module.exports={A:"ie",B:"edge",C:"firefox",D:"chrome",E:"safari",F:"opera",G:"ios_saf",H:"op_mini",I:"android",J:"bb",K:"op_mob",L:"and_chr",M:"and_ff",N:"ie_mob",O:"and_uc",P:"samsung",Q:"and_qq",R:"baidu",S:"kaios"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features.js
new file mode 100644
index 0000000..9826090
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features.js
@@ -0,0 +1 @@
+module.exports={"aac":require("./features/aac"),"abortcontroller":require("./features/abortcontroller"),"ac3-ec3":require("./features/ac3-ec3"),"accelerometer":require("./features/accelerometer"),"addeventlistener":require("./features/addeventlistener"),"alternate-stylesheet":require("./features/alternate-stylesheet"),"ambient-light":require("./features/ambient-light"),"apng":require("./features/apng"),"array-find-index":require("./features/array-find-index"),"array-find":require("./features/array-find"),"array-flat":require("./features/array-flat"),"array-includes":require("./features/array-includes"),"arrow-functions":require("./features/arrow-functions"),"asmjs":require("./features/asmjs"),"async-clipboard":require("./features/async-clipboard"),"async-functions":require("./features/async-functions"),"atob-btoa":require("./features/atob-btoa"),"audio-api":require("./features/audio-api"),"audio":require("./features/audio"),"audiotracks":require("./features/audiotracks"),"autofocus":require("./features/autofocus"),"auxclick":require("./features/auxclick"),"av1":require("./features/av1"),"avif":require("./features/avif"),"background-attachment":require("./features/background-attachment"),"background-clip-text":require("./features/background-clip-text"),"background-img-opts":require("./features/background-img-opts"),"background-position-x-y":require("./features/background-position-x-y"),"background-repeat-round-space":require("./features/background-repeat-round-space"),"background-sync":require("./features/background-sync"),"battery-status":require("./features/battery-status"),"beacon":require("./features/beacon"),"beforeafterprint":require("./features/beforeafterprint"),"bigint":require("./features/bigint"),"blobbuilder":require("./features/blobbuilder"),"bloburls":require("./features/bloburls"),"border-image":require("./features/border-image"),"border-radius":require("./features/border-radius"),"broadcastchannel":require("./features/broadcastchannel"),"brotli":require("./features/brotli"),"calc":require("./features/calc"),"canvas-blending":require("./features/canvas-blending"),"canvas-text":require("./features/canvas-text"),"canvas":require("./features/canvas"),"ch-unit":require("./features/ch-unit"),"chacha20-poly1305":require("./features/chacha20-poly1305"),"channel-messaging":require("./features/channel-messaging"),"childnode-remove":require("./features/childnode-remove"),"classlist":require("./features/classlist"),"client-hints-dpr-width-viewport":require("./features/client-hints-dpr-width-viewport"),"clipboard":require("./features/clipboard"),"colr-v1":require("./features/colr-v1"),"colr":require("./features/colr"),"comparedocumentposition":require("./features/comparedocumentposition"),"console-basic":require("./features/console-basic"),"console-time":require("./features/console-time"),"const":require("./features/const"),"constraint-validation":require("./features/constraint-validation"),"contenteditable":require("./features/contenteditable"),"contentsecuritypolicy":require("./features/contentsecuritypolicy"),"contentsecuritypolicy2":require("./features/contentsecuritypolicy2"),"cookie-store-api":require("./features/cookie-store-api"),"cors":require("./features/cors"),"createimagebitmap":require("./features/createimagebitmap"),"credential-management":require("./features/credential-management"),"cryptography":require("./features/cryptography"),"css-all":require("./features/css-all"),"css-animation":require("./features/css-animation"),"css-any-link":require("./features/css-any-link"),"css-appearance":require("./features/css-appearance"),"css-at-counter-style":require("./features/css-at-counter-style"),"css-autofill":require("./features/css-autofill"),"css-backdrop-filter":require("./features/css-backdrop-filter"),"css-background-offsets":require("./features/css-background-offsets"),"css-backgroundblendmode":require("./features/css-backgroundblendmode"),"css-boxdecorationbreak":require("./features/css-boxdecorationbreak"),"css-boxshadow":require("./features/css-boxshadow"),"css-canvas":require("./features/css-canvas"),"css-caret-color":require("./features/css-caret-color"),"css-cascade-layers":require("./features/css-cascade-layers"),"css-case-insensitive":require("./features/css-case-insensitive"),"css-clip-path":require("./features/css-clip-path"),"css-color-adjust":require("./features/css-color-adjust"),"css-color-function":require("./features/css-color-function"),"css-conic-gradients":require("./features/css-conic-gradients"),"css-container-queries":require("./features/css-container-queries"),"css-containment":require("./features/css-containment"),"css-content-visibility":require("./features/css-content-visibility"),"css-counters":require("./features/css-counters"),"css-crisp-edges":require("./features/css-crisp-edges"),"css-cross-fade":require("./features/css-cross-fade"),"css-default-pseudo":require("./features/css-default-pseudo"),"css-descendant-gtgt":require("./features/css-descendant-gtgt"),"css-deviceadaptation":require("./features/css-deviceadaptation"),"css-dir-pseudo":require("./features/css-dir-pseudo"),"css-display-contents":require("./features/css-display-contents"),"css-element-function":require("./features/css-element-function"),"css-env-function":require("./features/css-env-function"),"css-exclusions":require("./features/css-exclusions"),"css-featurequeries":require("./features/css-featurequeries"),"css-file-selector-button":require("./features/css-file-selector-button"),"css-filter-function":require("./features/css-filter-function"),"css-filters":require("./features/css-filters"),"css-first-letter":require("./features/css-first-letter"),"css-first-line":require("./features/css-first-line"),"css-fixed":require("./features/css-fixed"),"css-focus-visible":require("./features/css-focus-visible"),"css-focus-within":require("./features/css-focus-within"),"css-font-palette":require("./features/css-font-palette"),"css-font-rendering-controls":require("./features/css-font-rendering-controls"),"css-font-stretch":require("./features/css-font-stretch"),"css-gencontent":require("./features/css-gencontent"),"css-gradients":require("./features/css-gradients"),"css-grid":require("./features/css-grid"),"css-hanging-punctuation":require("./features/css-hanging-punctuation"),"css-has":require("./features/css-has"),"css-hyphenate":require("./features/css-hyphenate"),"css-hyphens":require("./features/css-hyphens"),"css-image-orientation":require("./features/css-image-orientation"),"css-image-set":require("./features/css-image-set"),"css-in-out-of-range":require("./features/css-in-out-of-range"),"css-indeterminate-pseudo":require("./features/css-indeterminate-pseudo"),"css-initial-letter":require("./features/css-initial-letter"),"css-initial-value":require("./features/css-initial-value"),"css-lch-lab":require("./features/css-lch-lab"),"css-letter-spacing":require("./features/css-letter-spacing"),"css-line-clamp":require("./features/css-line-clamp"),"css-logical-props":require("./features/css-logical-props"),"css-marker-pseudo":require("./features/css-marker-pseudo"),"css-masks":require("./features/css-masks"),"css-matches-pseudo":require("./features/css-matches-pseudo"),"css-math-functions":require("./features/css-math-functions"),"css-media-interaction":require("./features/css-media-interaction"),"css-media-resolution":require("./features/css-media-resolution"),"css-media-scripting":require("./features/css-media-scripting"),"css-mediaqueries":require("./features/css-mediaqueries"),"css-mixblendmode":require("./features/css-mixblendmode"),"css-motion-paths":require("./features/css-motion-paths"),"css-namespaces":require("./features/css-namespaces"),"css-nesting":require("./features/css-nesting"),"css-not-sel-list":require("./features/css-not-sel-list"),"css-nth-child-of":require("./features/css-nth-child-of"),"css-opacity":require("./features/css-opacity"),"css-optional-pseudo":require("./features/css-optional-pseudo"),"css-overflow-anchor":require("./features/css-overflow-anchor"),"css-overflow-overlay":require("./features/css-overflow-overlay"),"css-overflow":require("./features/css-overflow"),"css-overscroll-behavior":require("./features/css-overscroll-behavior"),"css-page-break":require("./features/css-page-break"),"css-paged-media":require("./features/css-paged-media"),"css-paint-api":require("./features/css-paint-api"),"css-placeholder-shown":require("./features/css-placeholder-shown"),"css-placeholder":require("./features/css-placeholder"),"css-read-only-write":require("./features/css-read-only-write"),"css-rebeccapurple":require("./features/css-rebeccapurple"),"css-reflections":require("./features/css-reflections"),"css-regions":require("./features/css-regions"),"css-repeating-gradients":require("./features/css-repeating-gradients"),"css-resize":require("./features/css-resize"),"css-revert-value":require("./features/css-revert-value"),"css-rrggbbaa":require("./features/css-rrggbbaa"),"css-scroll-behavior":require("./features/css-scroll-behavior"),"css-scroll-timeline":require("./features/css-scroll-timeline"),"css-scrollbar":require("./features/css-scrollbar"),"css-sel2":require("./features/css-sel2"),"css-sel3":require("./features/css-sel3"),"css-selection":require("./features/css-selection"),"css-shapes":require("./features/css-shapes"),"css-snappoints":require("./features/css-snappoints"),"css-sticky":require("./features/css-sticky"),"css-subgrid":require("./features/css-subgrid"),"css-supports-api":require("./features/css-supports-api"),"css-table":require("./features/css-table"),"css-text-align-last":require("./features/css-text-align-last"),"css-text-indent":require("./features/css-text-indent"),"css-text-justify":require("./features/css-text-justify"),"css-text-orientation":require("./features/css-text-orientation"),"css-text-spacing":require("./features/css-text-spacing"),"css-textshadow":require("./features/css-textshadow"),"css-touch-action-2":require("./features/css-touch-action-2"),"css-touch-action":require("./features/css-touch-action"),"css-transitions":require("./features/css-transitions"),"css-unicode-bidi":require("./features/css-unicode-bidi"),"css-unset-value":require("./features/css-unset-value"),"css-variables":require("./features/css-variables"),"css-when-else":require("./features/css-when-else"),"css-widows-orphans":require("./features/css-widows-orphans"),"css-width-stretch":require("./features/css-width-stretch"),"css-writing-mode":require("./features/css-writing-mode"),"css-zoom":require("./features/css-zoom"),"css3-attr":require("./features/css3-attr"),"css3-boxsizing":require("./features/css3-boxsizing"),"css3-colors":require("./features/css3-colors"),"css3-cursors-grab":require("./features/css3-cursors-grab"),"css3-cursors-newer":require("./features/css3-cursors-newer"),"css3-cursors":require("./features/css3-cursors"),"css3-tabsize":require("./features/css3-tabsize"),"currentcolor":require("./features/currentcolor"),"custom-elements":require("./features/custom-elements"),"custom-elementsv1":require("./features/custom-elementsv1"),"customevent":require("./features/customevent"),"datalist":require("./features/datalist"),"dataset":require("./features/dataset"),"datauri":require("./features/datauri"),"date-tolocaledatestring":require("./features/date-tolocaledatestring"),"decorators":require("./features/decorators"),"details":require("./features/details"),"deviceorientation":require("./features/deviceorientation"),"devicepixelratio":require("./features/devicepixelratio"),"dialog":require("./features/dialog"),"dispatchevent":require("./features/dispatchevent"),"dnssec":require("./features/dnssec"),"do-not-track":require("./features/do-not-track"),"document-currentscript":require("./features/document-currentscript"),"document-evaluate-xpath":require("./features/document-evaluate-xpath"),"document-execcommand":require("./features/document-execcommand"),"document-policy":require("./features/document-policy"),"document-scrollingelement":require("./features/document-scrollingelement"),"documenthead":require("./features/documenthead"),"dom-manip-convenience":require("./features/dom-manip-convenience"),"dom-range":require("./features/dom-range"),"domcontentloaded":require("./features/domcontentloaded"),"domfocusin-domfocusout-events":require("./features/domfocusin-domfocusout-events"),"dommatrix":require("./features/dommatrix"),"download":require("./features/download"),"dragndrop":require("./features/dragndrop"),"element-closest":require("./features/element-closest"),"element-from-point":require("./features/element-from-point"),"element-scroll-methods":require("./features/element-scroll-methods"),"eme":require("./features/eme"),"eot":require("./features/eot"),"es5":require("./features/es5"),"es6-class":require("./features/es6-class"),"es6-generators":require("./features/es6-generators"),"es6-module-dynamic-import":require("./features/es6-module-dynamic-import"),"es6-module":require("./features/es6-module"),"es6-number":require("./features/es6-number"),"es6-string-includes":require("./features/es6-string-includes"),"es6":require("./features/es6"),"eventsource":require("./features/eventsource"),"extended-system-fonts":require("./features/extended-system-fonts"),"feature-policy":require("./features/feature-policy"),"fetch":require("./features/fetch"),"fieldset-disabled":require("./features/fieldset-disabled"),"fileapi":require("./features/fileapi"),"filereader":require("./features/filereader"),"filereadersync":require("./features/filereadersync"),"filesystem":require("./features/filesystem"),"flac":require("./features/flac"),"flexbox-gap":require("./features/flexbox-gap"),"flexbox":require("./features/flexbox"),"flow-root":require("./features/flow-root"),"focusin-focusout-events":require("./features/focusin-focusout-events"),"focusoptions-preventscroll":require("./features/focusoptions-preventscroll"),"font-family-system-ui":require("./features/font-family-system-ui"),"font-feature":require("./features/font-feature"),"font-kerning":require("./features/font-kerning"),"font-loading":require("./features/font-loading"),"font-metrics-overrides":require("./features/font-metrics-overrides"),"font-size-adjust":require("./features/font-size-adjust"),"font-smooth":require("./features/font-smooth"),"font-unicode-range":require("./features/font-unicode-range"),"font-variant-alternates":require("./features/font-variant-alternates"),"font-variant-east-asian":require("./features/font-variant-east-asian"),"font-variant-numeric":require("./features/font-variant-numeric"),"fontface":require("./features/fontface"),"form-attribute":require("./features/form-attribute"),"form-submit-attributes":require("./features/form-submit-attributes"),"form-validation":require("./features/form-validation"),"forms":require("./features/forms"),"fullscreen":require("./features/fullscreen"),"gamepad":require("./features/gamepad"),"geolocation":require("./features/geolocation"),"getboundingclientrect":require("./features/getboundingclientrect"),"getcomputedstyle":require("./features/getcomputedstyle"),"getelementsbyclassname":require("./features/getelementsbyclassname"),"getrandomvalues":require("./features/getrandomvalues"),"gyroscope":require("./features/gyroscope"),"hardwareconcurrency":require("./features/hardwareconcurrency"),"hashchange":require("./features/hashchange"),"heif":require("./features/heif"),"hevc":require("./features/hevc"),"hidden":require("./features/hidden"),"high-resolution-time":require("./features/high-resolution-time"),"history":require("./features/history"),"html-media-capture":require("./features/html-media-capture"),"html5semantic":require("./features/html5semantic"),"http-live-streaming":require("./features/http-live-streaming"),"http2":require("./features/http2"),"http3":require("./features/http3"),"iframe-sandbox":require("./features/iframe-sandbox"),"iframe-seamless":require("./features/iframe-seamless"),"iframe-srcdoc":require("./features/iframe-srcdoc"),"imagecapture":require("./features/imagecapture"),"ime":require("./features/ime"),"img-naturalwidth-naturalheight":require("./features/img-naturalwidth-naturalheight"),"import-maps":require("./features/import-maps"),"imports":require("./features/imports"),"indeterminate-checkbox":require("./features/indeterminate-checkbox"),"indexeddb":require("./features/indexeddb"),"indexeddb2":require("./features/indexeddb2"),"inline-block":require("./features/inline-block"),"innertext":require("./features/innertext"),"input-autocomplete-onoff":require("./features/input-autocomplete-onoff"),"input-color":require("./features/input-color"),"input-datetime":require("./features/input-datetime"),"input-email-tel-url":require("./features/input-email-tel-url"),"input-event":require("./features/input-event"),"input-file-accept":require("./features/input-file-accept"),"input-file-directory":require("./features/input-file-directory"),"input-file-multiple":require("./features/input-file-multiple"),"input-inputmode":require("./features/input-inputmode"),"input-minlength":require("./features/input-minlength"),"input-number":require("./features/input-number"),"input-pattern":require("./features/input-pattern"),"input-placeholder":require("./features/input-placeholder"),"input-range":require("./features/input-range"),"input-search":require("./features/input-search"),"input-selection":require("./features/input-selection"),"insert-adjacent":require("./features/insert-adjacent"),"insertadjacenthtml":require("./features/insertadjacenthtml"),"internationalization":require("./features/internationalization"),"intersectionobserver-v2":require("./features/intersectionobserver-v2"),"intersectionobserver":require("./features/intersectionobserver"),"intl-pluralrules":require("./features/intl-pluralrules"),"intrinsic-width":require("./features/intrinsic-width"),"jpeg2000":require("./features/jpeg2000"),"jpegxl":require("./features/jpegxl"),"jpegxr":require("./features/jpegxr"),"js-regexp-lookbehind":require("./features/js-regexp-lookbehind"),"json":require("./features/json"),"justify-content-space-evenly":require("./features/justify-content-space-evenly"),"kerning-pairs-ligatures":require("./features/kerning-pairs-ligatures"),"keyboardevent-charcode":require("./features/keyboardevent-charcode"),"keyboardevent-code":require("./features/keyboardevent-code"),"keyboardevent-getmodifierstate":require("./features/keyboardevent-getmodifierstate"),"keyboardevent-key":require("./features/keyboardevent-key"),"keyboardevent-location":require("./features/keyboardevent-location"),"keyboardevent-which":require("./features/keyboardevent-which"),"lazyload":require("./features/lazyload"),"let":require("./features/let"),"link-icon-png":require("./features/link-icon-png"),"link-icon-svg":require("./features/link-icon-svg"),"link-rel-dns-prefetch":require("./features/link-rel-dns-prefetch"),"link-rel-modulepreload":require("./features/link-rel-modulepreload"),"link-rel-preconnect":require("./features/link-rel-preconnect"),"link-rel-prefetch":require("./features/link-rel-prefetch"),"link-rel-preload":require("./features/link-rel-preload"),"link-rel-prerender":require("./features/link-rel-prerender"),"loading-lazy-attr":require("./features/loading-lazy-attr"),"localecompare":require("./features/localecompare"),"magnetometer":require("./features/magnetometer"),"matchesselector":require("./features/matchesselector"),"matchmedia":require("./features/matchmedia"),"mathml":require("./features/mathml"),"maxlength":require("./features/maxlength"),"media-attribute":require("./features/media-attribute"),"media-fragments":require("./features/media-fragments"),"media-session-api":require("./features/media-session-api"),"mediacapture-fromelement":require("./features/mediacapture-fromelement"),"mediarecorder":require("./features/mediarecorder"),"mediasource":require("./features/mediasource"),"menu":require("./features/menu"),"meta-theme-color":require("./features/meta-theme-color"),"meter":require("./features/meter"),"midi":require("./features/midi"),"minmaxwh":require("./features/minmaxwh"),"mp3":require("./features/mp3"),"mpeg-dash":require("./features/mpeg-dash"),"mpeg4":require("./features/mpeg4"),"multibackgrounds":require("./features/multibackgrounds"),"multicolumn":require("./features/multicolumn"),"mutation-events":require("./features/mutation-events"),"mutationobserver":require("./features/mutationobserver"),"namevalue-storage":require("./features/namevalue-storage"),"native-filesystem-api":require("./features/native-filesystem-api"),"nav-timing":require("./features/nav-timing"),"navigator-language":require("./features/navigator-language"),"netinfo":require("./features/netinfo"),"notifications":require("./features/notifications"),"object-entries":require("./features/object-entries"),"object-fit":require("./features/object-fit"),"object-observe":require("./features/object-observe"),"object-values":require("./features/object-values"),"objectrtc":require("./features/objectrtc"),"offline-apps":require("./features/offline-apps"),"offscreencanvas":require("./features/offscreencanvas"),"ogg-vorbis":require("./features/ogg-vorbis"),"ogv":require("./features/ogv"),"ol-reversed":require("./features/ol-reversed"),"once-event-listener":require("./features/once-event-listener"),"online-status":require("./features/online-status"),"opus":require("./features/opus"),"orientation-sensor":require("./features/orientation-sensor"),"outline":require("./features/outline"),"pad-start-end":require("./features/pad-start-end"),"page-transition-events":require("./features/page-transition-events"),"pagevisibility":require("./features/pagevisibility"),"passive-event-listener":require("./features/passive-event-listener"),"passwordrules":require("./features/passwordrules"),"path2d":require("./features/path2d"),"payment-request":require("./features/payment-request"),"pdf-viewer":require("./features/pdf-viewer"),"permissions-api":require("./features/permissions-api"),"permissions-policy":require("./features/permissions-policy"),"picture-in-picture":require("./features/picture-in-picture"),"picture":require("./features/picture"),"ping":require("./features/ping"),"png-alpha":require("./features/png-alpha"),"pointer-events":require("./features/pointer-events"),"pointer":require("./features/pointer"),"pointerlock":require("./features/pointerlock"),"portals":require("./features/portals"),"prefers-color-scheme":require("./features/prefers-color-scheme"),"prefers-reduced-motion":require("./features/prefers-reduced-motion"),"private-class-fields":require("./features/private-class-fields"),"private-methods-and-accessors":require("./features/private-methods-and-accessors"),"progress":require("./features/progress"),"promise-finally":require("./features/promise-finally"),"promises":require("./features/promises"),"proximity":require("./features/proximity"),"proxy":require("./features/proxy"),"public-class-fields":require("./features/public-class-fields"),"publickeypinning":require("./features/publickeypinning"),"push-api":require("./features/push-api"),"queryselector":require("./features/queryselector"),"readonly-attr":require("./features/readonly-attr"),"referrer-policy":require("./features/referrer-policy"),"registerprotocolhandler":require("./features/registerprotocolhandler"),"rel-noopener":require("./features/rel-noopener"),"rel-noreferrer":require("./features/rel-noreferrer"),"rellist":require("./features/rellist"),"rem":require("./features/rem"),"requestanimationframe":require("./features/requestanimationframe"),"requestidlecallback":require("./features/requestidlecallback"),"resizeobserver":require("./features/resizeobserver"),"resource-timing":require("./features/resource-timing"),"rest-parameters":require("./features/rest-parameters"),"rtcpeerconnection":require("./features/rtcpeerconnection"),"ruby":require("./features/ruby"),"run-in":require("./features/run-in"),"same-site-cookie-attribute":require("./features/same-site-cookie-attribute"),"screen-orientation":require("./features/screen-orientation"),"script-async":require("./features/script-async"),"script-defer":require("./features/script-defer"),"scrollintoview":require("./features/scrollintoview"),"scrollintoviewifneeded":require("./features/scrollintoviewifneeded"),"sdch":require("./features/sdch"),"selection-api":require("./features/selection-api"),"server-timing":require("./features/server-timing"),"serviceworkers":require("./features/serviceworkers"),"setimmediate":require("./features/setimmediate"),"sha-2":require("./features/sha-2"),"shadowdom":require("./features/shadowdom"),"shadowdomv1":require("./features/shadowdomv1"),"sharedarraybuffer":require("./features/sharedarraybuffer"),"sharedworkers":require("./features/sharedworkers"),"sni":require("./features/sni"),"spdy":require("./features/spdy"),"speech-recognition":require("./features/speech-recognition"),"speech-synthesis":require("./features/speech-synthesis"),"spellcheck-attribute":require("./features/spellcheck-attribute"),"sql-storage":require("./features/sql-storage"),"srcset":require("./features/srcset"),"stream":require("./features/stream"),"streams":require("./features/streams"),"stricttransportsecurity":require("./features/stricttransportsecurity"),"style-scoped":require("./features/style-scoped"),"subresource-integrity":require("./features/subresource-integrity"),"svg-css":require("./features/svg-css"),"svg-filters":require("./features/svg-filters"),"svg-fonts":require("./features/svg-fonts"),"svg-fragment":require("./features/svg-fragment"),"svg-html":require("./features/svg-html"),"svg-html5":require("./features/svg-html5"),"svg-img":require("./features/svg-img"),"svg-smil":require("./features/svg-smil"),"svg":require("./features/svg"),"sxg":require("./features/sxg"),"tabindex-attr":require("./features/tabindex-attr"),"template-literals":require("./features/template-literals"),"template":require("./features/template"),"temporal":require("./features/temporal"),"testfeat":require("./features/testfeat"),"text-decoration":require("./features/text-decoration"),"text-emphasis":require("./features/text-emphasis"),"text-overflow":require("./features/text-overflow"),"text-size-adjust":require("./features/text-size-adjust"),"text-stroke":require("./features/text-stroke"),"text-underline-offset":require("./features/text-underline-offset"),"textcontent":require("./features/textcontent"),"textencoder":require("./features/textencoder"),"tls1-1":require("./features/tls1-1"),"tls1-2":require("./features/tls1-2"),"tls1-3":require("./features/tls1-3"),"token-binding":require("./features/token-binding"),"touch":require("./features/touch"),"transforms2d":require("./features/transforms2d"),"transforms3d":require("./features/transforms3d"),"trusted-types":require("./features/trusted-types"),"ttf":require("./features/ttf"),"typedarrays":require("./features/typedarrays"),"u2f":require("./features/u2f"),"unhandledrejection":require("./features/unhandledrejection"),"upgradeinsecurerequests":require("./features/upgradeinsecurerequests"),"url-scroll-to-text-fragment":require("./features/url-scroll-to-text-fragment"),"url":require("./features/url"),"urlsearchparams":require("./features/urlsearchparams"),"use-strict":require("./features/use-strict"),"user-select-none":require("./features/user-select-none"),"user-timing":require("./features/user-timing"),"variable-fonts":require("./features/variable-fonts"),"vector-effect":require("./features/vector-effect"),"vibration":require("./features/vibration"),"video":require("./features/video"),"videotracks":require("./features/videotracks"),"viewport-unit-variants":require("./features/viewport-unit-variants"),"viewport-units":require("./features/viewport-units"),"wai-aria":require("./features/wai-aria"),"wake-lock":require("./features/wake-lock"),"wasm":require("./features/wasm"),"wav":require("./features/wav"),"wbr-element":require("./features/wbr-element"),"web-animation":require("./features/web-animation"),"web-app-manifest":require("./features/web-app-manifest"),"web-bluetooth":require("./features/web-bluetooth"),"web-serial":require("./features/web-serial"),"web-share":require("./features/web-share"),"webauthn":require("./features/webauthn"),"webgl":require("./features/webgl"),"webgl2":require("./features/webgl2"),"webgpu":require("./features/webgpu"),"webhid":require("./features/webhid"),"webkit-user-drag":require("./features/webkit-user-drag"),"webm":require("./features/webm"),"webnfc":require("./features/webnfc"),"webp":require("./features/webp"),"websockets":require("./features/websockets"),"webusb":require("./features/webusb"),"webvr":require("./features/webvr"),"webvtt":require("./features/webvtt"),"webworkers":require("./features/webworkers"),"webxr":require("./features/webxr"),"will-change":require("./features/will-change"),"woff":require("./features/woff"),"woff2":require("./features/woff2"),"word-break":require("./features/word-break"),"wordwrap":require("./features/wordwrap"),"x-doc-messaging":require("./features/x-doc-messaging"),"x-frame-options":require("./features/x-frame-options"),"xhr2":require("./features/xhr2"),"xhtml":require("./features/xhtml"),"xhtmlsmil":require("./features/xhtmlsmil"),"xml-serializer":require("./features/xml-serializer")};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/aac.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/aac.js
new file mode 100644
index 0000000..0af3141
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/aac.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m uB vB","132":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F","16":"A B"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"132":"T"},N:{"1":"A","2":"B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"132":"rC"}},B:6,C:"AAC audio file format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/abortcontroller.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/abortcontroller.js
new file mode 100644
index 0000000..b47d079
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/abortcontroller.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G"},C:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB uB vB"},D:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB","130":"C fB"},F:{"1":"IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","2":"I eC fC gC hC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"AbortController & AbortSignal"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ac3-ec3.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ac3-ec3.js
new file mode 100644
index 0000000..d145b9a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ac3-ec3.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O","2":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC","132":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D","132":"A"},K:{"2":"A B C U fB qB","132":"gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"132":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"AC-3 (Dolby Digital) and EC-3 (Dolby Digital Plus) codecs"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/accelerometer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/accelerometer.js
new file mode 100644
index 0000000..33a9249
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/accelerometer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","194":"NB iB OB jB PB QB U RB SB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"Accelerometer"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/addeventlistener.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/addeventlistener.js
new file mode 100644
index 0000000..e2dfa87
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/addeventlistener.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","130":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","257":"tB hB I j J uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"EventTarget.addEventListener()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/alternate-stylesheet.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/alternate-stylesheet.js
new file mode 100644
index 0000000..6f956d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/alternate-stylesheet.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","2":"J D sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"F B C 7B 8B 9B AC fB qB BC gB","16":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"2":"U","16":"A B C fB qB gB"},L:{"16":"H"},M:{"16":"T"},N:{"16":"A B"},O:{"16":"dC"},P:{"16":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"16":"qC"},S:{"1":"rC"}},B:1,C:"Alternate stylesheet"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ambient-light.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ambient-light.js
new file mode 100644
index 0000000..f0f4592
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ambient-light.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K","132":"L G M N O","322":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m uB vB","132":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB","194":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","322":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB 7B 8B 9B AC fB qB BC gB","322":"ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"132":"rC"}},B:4,C:"Ambient Light Sensor"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/apng.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/apng.js
new file mode 100644
index 0000000..00e5f3d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/apng.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB"},D:{"1":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"1":"E F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B 1B"},F:{"1":"B C BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"0 1 2 3 4 5 6 7 8 9 F G M N O k l m n o p q r s t u v w x y z AB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:7,C:"Animated PNG (APNG)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-find-index.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-find-index.js
new file mode 100644
index 0000000..e0f6a68
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-find-index.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p uB vB"},D:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w 7B 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","16":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Array.prototype.findIndex"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-find.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-find.js
new file mode 100644
index 0000000..76c1c7d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-find.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","16":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p uB vB"},D:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w 7B 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","16":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Array.prototype.find"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-flat.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-flat.js
new file mode 100644
index 0000000..755c364
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-flat.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB uB vB"},D:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB"},E:{"1":"C K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB fB"},F:{"1":"LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB 7B 8B 9B AC fB qB BC gB"},G:{"1":"NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nB jC kC lC mC nC oC","2":"I eC fC gC hC iC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"flat & flatMap array methods"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-includes.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-includes.js
new file mode 100644
index 0000000..1fabe1d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/array-includes.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Array.prototype.includes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/arrow-functions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/arrow-functions.js
new file mode 100644
index 0000000..4e718de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/arrow-functions.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m uB vB"},D:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Arrow functions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/asmjs.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/asmjs.js
new file mode 100644
index 0000000..bc4f66c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/asmjs.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O","132":"P Q R S V W X Y Z a b c d e f g T h i H","322":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m uB vB"},D:{"2":"I j J D E F A B C K L G M N O k l m n o p q r s","132":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","132":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","132":"U"},L:{"132":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I","132":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"132":"pC"},R:{"132":"qC"},S:{"1":"rC"}},B:6,C:"asm.js"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/async-clipboard.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/async-clipboard.js
new file mode 100644
index 0000000..f16fe8f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/async-clipboard.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB uB vB","132":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","66":"NB iB OB jB"},E:{"1":"L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC","260":"TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","260":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","260":"U"},L:{"1":"H"},M:{"132":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC","260":"iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Asynchronous Clipboard API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/async-functions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/async-functions.js
new file mode 100644
index 0000000..cfdcb94
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/async-functions.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K","194":"L"},C:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB"},D:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B","514":"nB"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC","514":"KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Async functions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/atob-btoa.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/atob-btoa.js
new file mode 100644
index 0000000..f9bd323
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/atob-btoa.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","2":"F 7B 8B","16":"9B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","16":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Base64 encoding and decoding"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audio-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audio-api.js
new file mode 100644
index 0000000..913123f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audio-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K","33":"L G M N O k l m n o p q r s t u v w x y"},E:{"1":"G 4B 5B oB pB 6B","2":"I j yB mB zB","33":"J D E F A B C K L 0B 1B 2B nB fB gB 3B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"G M N O k l m"},G:{"1":"UC VC oB pB","2":"mB CC rB DC","33":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Web Audio API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audio.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audio.js
new file mode 100644
index 0000000..4146f8d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audio.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","132":"I j J D E F A B C K L G M N O k uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F","4":"7B 8B"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","2":"XC YC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Audio element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audiotracks.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audiotracks.js
new file mode 100644
index 0000000..ab7a969
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/audiotracks.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O","322":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB","194":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","322":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB"},F:{"2":"F B C G M N O k l m n o p q r s t u v w 7B 8B 9B AC fB qB BC gB","322":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"322":"H"},M:{"2":"T"},N:{"1":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"194":"rC"}},B:1,C:"Audio Tracks"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/autofocus.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/autofocus.js
new file mode 100644
index 0000000..fbaf894
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/autofocus.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:1,C:"Autofocus attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/auxclick.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/auxclick.js
new file mode 100644
index 0000000..6d4c1be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/auxclick.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB","129":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"Auxclick"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/av1.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/av1.js
new file mode 100644
index 0000000..bf17ef3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/av1.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N","194":"O"},C:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB uB vB","66":"KB LB MB NB iB OB jB PB QB U","260":"RB","516":"SB"},D:{"1":"WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB","66":"TB UB VB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1090":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"kC lC mC nC oC","2":"I eC fC gC hC iC nB jC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"AV1 video format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/avif.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/avif.js
new file mode 100644
index 0000000..a1aa96e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/avif.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB uB vB","194":"dB eB P Q R kB S V W X Y Z a b c d","257":"e f g T h i H lB"},D:{"1":"W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"AVIF image format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-attachment.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-attachment.js
new file mode 100644
index 0000000..51c1ebc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-attachment.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","132":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","132":"tB hB I j J D E F A B C K L G M N O k l m n o p uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C zB 0B 1B 2B nB fB gB","132":"I K yB mB 3B","2050":"L G 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","132":"F 7B 8B"},G:{"2":"mB CC rB","772":"E DC EC FC GC HC IC JC KC LC MC NC OC","2050":"PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC bC cC","132":"aC rB"},J:{"260":"D A"},K:{"1":"B C fB qB gB","2":"U","132":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"2":"I","1028":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1028":"qC"},S:{"1":"rC"}},B:4,C:"CSS background-attachment"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-clip-text.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-clip-text.js
new file mode 100644
index 0000000..64aa2d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-clip-text.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O","33":"C K L P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB uB vB"},D:{"33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"L G 4B 5B oB pB 6B","16":"yB mB","33":"I j J D E F A B C K zB 0B 1B 2B nB fB gB 3B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"TC UC VC oB pB","16":"mB CC rB DC","33":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"16":"hB XC YC ZC","33":"I H aC rB bC cC"},J:{"33":"D A"},K:{"16":"A B C fB qB gB","33":"U"},L:{"33":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"33":"dC"},P:{"33":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"33":"qC"},S:{"1":"rC"}},B:7,C:"Background-clip: text"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-img-opts.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-img-opts.js
new file mode 100644
index 0000000..c08e10f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-img-opts.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB","36":"vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","516":"I j J D E F A B C K L"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","772":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B","36":"8B"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","4":"mB CC rB EC","516":"DC"},H:{"132":"WC"},I:{"1":"H bC cC","36":"XC","516":"hB I aC rB","548":"YC ZC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 Background-image options"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-position-x-y.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-position-x-y.js
new file mode 100644
index 0000000..d4738bc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-position-x-y.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:7,C:"background-position-x & background-position-y"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-repeat-round-space.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-repeat-round-space.js
new file mode 100644
index 0000000..bd51847
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-repeat-round-space.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E sB","132":"F"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F G M N O 7B 8B"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:4,C:"CSS background-repeat round and space"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-sync.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-sync.js
new file mode 100644
index 0000000..e6a2abc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/background-sync.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i uB vB","16":"H lB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Background Sync API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/battery-status.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/battery-status.js
new file mode 100644
index 0000000..01f8ca0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/battery-status.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"8 9 AB BB CB DB EB FB GB","2":"tB hB I j J D E F HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","132":"0 1 2 3 4 5 6 7 M N O k l m n o p q r s t u v w x y z","164":"A B C K L G"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","66":"2"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Battery Status API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/beacon.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/beacon.js
new file mode 100644
index 0000000..4fff5bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/beacon.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v uB vB"},D:{"1":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Beacon API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/beforeafterprint.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/beforeafterprint.js
new file mode 100644
index 0000000..6eb4f49
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/beforeafterprint.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","16":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB"},D:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB gB"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB 7B 8B 9B AC fB qB BC gB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"16":"A B"},O:{"16":"dC"},P:{"2":"eC fC gC hC iC nB jC kC lC mC nC oC","16":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:1,C:"Printing Events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/bigint.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/bigint.js
new file mode 100644
index 0000000..787dd29
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/bigint.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U uB vB","194":"RB SB TB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB"},E:{"1":"L G 4B 5B oB pB 6B","2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB 3B"},F:{"1":"JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB"},G:{"1":"TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","2":"I eC fC gC hC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"BigInt"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/blobbuilder.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/blobbuilder.js
new file mode 100644
index 0000000..cef293f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/blobbuilder.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB","36":"J D E F A B C"},D:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D","36":"E F A B C K L G M N O k"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B C 7B 8B 9B AC fB qB BC"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC"},H:{"2":"WC"},I:{"1":"H","2":"XC YC ZC","36":"hB I aC rB bC cC"},J:{"1":"A","2":"D"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Blob constructing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/bloburls.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/bloburls.js
new file mode 100644
index 0000000..db640f5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/bloburls.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","129":"A B"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","129":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D","33":"E F A B C K L G M N O k l m n"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","33":"J"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","33":"EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB XC YC ZC","33":"I aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Blob URLs"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/border-image.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/border-image.js
new file mode 100644
index 0000000..88c5cac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/border-image.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","129":"C K"},C:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","260":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB","804":"I j J D E F A B C K L uB vB"},D:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","260":"GB HB IB JB KB","388":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB","1412":"G M N O k l m n o p q r s t u","1956":"I j J D E F A B C K L"},E:{"129":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","1412":"J D E F 0B 1B","1956":"I j yB mB zB"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F 7B 8B","260":"3 4 5 6 7","388":"0 1 2 G M N O k l m n o p q r s t u v w x y z","1796":"9B AC","1828":"B C fB qB BC gB"},G:{"129":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","1412":"E EC FC GC HC","1956":"mB CC rB DC"},H:{"1828":"WC"},I:{"1":"H","388":"bC cC","1956":"hB I XC YC ZC aC rB"},J:{"1412":"A","1924":"D"},K:{"1":"U","2":"A","1828":"B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"388":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","260":"eC fC","388":"I"},Q:{"260":"pC"},R:{"260":"qC"},S:{"260":"rC"}},B:4,C:"CSS3 Border images"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/border-radius.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/border-radius.js
new file mode 100644
index 0000000..36742af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/border-radius.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","257":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB","289":"hB uB vB","292":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"I"},E:{"1":"j D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","33":"I yB mB","129":"J zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","33":"mB"},H:{"2":"WC"},I:{"1":"hB I H YC ZC aC rB bC cC","33":"XC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"257":"rC"}},B:4,C:"CSS3 Border-radius (rounded corners)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/broadcastchannel.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/broadcastchannel.js
new file mode 100644
index 0000000..e871d32
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/broadcastchannel.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB"},E:{"1":"pB 6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:1,C:"BroadcastChannel"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/brotli.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/brotli.js
new file mode 100644
index 0000000..5100c2f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/brotli.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L"},C:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB","194":"EB","257":"FB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","513":"B C fB gB"},F:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","194":"1 2"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:6,C:"Brotli Accept-Encoding/Content-Encoding"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/calc.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/calc.js
new file mode 100644
index 0000000..2d9829e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/calc.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","260":"F","516":"A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","33":"I j J D E F A B C K L G"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O","33":"k l m n o p q"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","33":"J"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","33":"EC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB","132":"bC cC"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"calc() as CSS unit value"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas-blending.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas-blending.js
new file mode 100644
index 0000000..a1c92ce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas-blending.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Canvas blend modes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas-text.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas-text.js
new file mode 100644
index 0000000..422444b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas-text.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"sB","8":"J D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","8":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","8":"F 7B 8B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","8":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Text API for Canvas"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas.js
new file mode 100644
index 0000000..51cd9a1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/canvas.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"sB","8":"J D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","132":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","132":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"260":"WC"},I:{"1":"hB I H aC rB bC cC","132":"XC YC ZC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Canvas (basic support)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ch-unit.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ch-unit.js
new file mode 100644
index 0000000..02eebf6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ch-unit.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","132":"F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"ch (character) unit"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/chacha20-poly1305.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/chacha20-poly1305.js
new file mode 100644
index 0000000..a1b1f7f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/chacha20-poly1305.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x","129":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC","16":"cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"ChaCha20-Poly1305 cipher suites for TLS"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/channel-messaging.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/channel-messaging.js
new file mode 100644
index 0000000..cac6675
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/channel-messaging.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q uB vB","194":"0 1 2 3 4 5 r s t u v w x y z"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","2":"F 7B 8B","16":"9B"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Channel messaging"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/childnode-remove.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/childnode-remove.js
new file mode 100644
index 0000000..592e111
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/childnode-remove.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","16":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","16":"J"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"ChildNode.remove()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/classlist.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/classlist.js
new file mode 100644
index 0000000..f09df4f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/classlist.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"8":"J D E F sB","1924":"A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"tB hB uB","516":"p q","772":"I j J D E F A B C K L G M N O k l m n o vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"I j J D","516":"p q r s","772":"o","900":"E F A B C K L G M N O k l m n"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"I j yB mB","900":"J zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","8":"F B 7B 8B 9B AC fB","900":"C qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","8":"mB CC rB","900":"DC EC"},H:{"900":"WC"},I:{"1":"H bC cC","8":"XC YC ZC","900":"hB I aC rB"},J:{"1":"A","900":"D"},K:{"1":"U","8":"A B","900":"C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"900":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"classList (DOMTokenList)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/client-hints-dpr-width-viewport.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/client-hints-dpr-width-viewport.js
new file mode 100644
index 0000000..5f0a845
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/client-hints-dpr-width-viewport.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:6,C:"Client Hints: DPR, Width, Viewport-Width"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/clipboard.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/clipboard.js
new file mode 100644
index 0000000..b24f710
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/clipboard.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2436":"J D E F A B sB"},B:{"260":"N O","2436":"C K L G M","8196":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m uB vB","772":"0 1 2 3 4 5 n o p q r s t u v w x y z","4100":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"I j J D E F A B C","2564":"0 1 2 3 4 5 6 7 K L G M N O k l m n o p q r s t u v w x y z","8196":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","10244":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"C K L G gB 3B 4B 5B oB pB 6B","16":"yB mB","2308":"A B nB fB","2820":"I j J D E F zB 0B 1B 2B"},F:{"2":"F B 7B 8B 9B AC fB qB BC","16":"C","516":"gB","2564":"G M N O k l m n o p q r s t u","8196":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","10244":"0 1 2 3 4 5 6 7 8 9 v w x y z"},G:{"1":"NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","2820":"E DC EC FC GC HC IC JC KC LC MC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","260":"H","2308":"bC cC"},J:{"2":"D","2308":"A"},K:{"2":"A B C fB qB","16":"gB","260":"U"},L:{"8196":"H"},M:{"1028":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2052":"eC fC","2308":"I","8196":"gC hC iC nB jC kC lC mC nC oC"},Q:{"10244":"pC"},R:{"2052":"qC"},S:{"4100":"rC"}},B:5,C:"Synchronous Clipboard API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/colr-v1.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/colr-v1.js
new file mode 100644
index 0000000..9f339df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/colr-v1.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"i H","2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h uB vB","258":"i H lB"},D:{"1":"i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a","194":"b c d e f g T h"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"16":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"COLR/CPAL(v1) Font Formats"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/colr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/colr.js
new file mode 100644
index 0000000..b2894c6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/colr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","257":"F A B"},B:{"1":"C K L G M N O","513":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB","513":"XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"L G 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","129":"B C K fB gB 3B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB 7B 8B 9B AC fB qB BC gB","513":"NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"16":"A B"},O:{"1":"dC"},P:{"1":"nB jC kC lC mC nC oC","2":"I eC fC gC hC iC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"COLR/CPAL(v0) Font Formats"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/comparedocumentposition.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/comparedocumentposition.js
new file mode 100644
index 0000000..0ba8c30
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/comparedocumentposition.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","132":"G M N O k l m n o p q r s t u"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","16":"I j J yB mB","132":"D E F 0B 1B 2B","260":"zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","16":"F B 7B 8B 9B AC fB qB","132":"G M"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB","132":"E CC rB DC EC FC GC HC IC"},H:{"1":"WC"},I:{"1":"H bC cC","16":"XC YC","132":"hB I ZC aC rB"},J:{"132":"D A"},K:{"1":"C U gB","16":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Node.compareDocumentPosition()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/console-basic.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/console-basic.js
new file mode 100644
index 0000000..a155a6c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/console-basic.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D sB","132":"E F"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F 7B 8B 9B AC"},G:{"1":"mB CC rB DC","513":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"4097":"WC"},I:{"1025":"hB I H XC YC ZC aC rB bC cC"},J:{"258":"D A"},K:{"2":"A","258":"B C fB qB gB","1025":"U"},L:{"1025":"H"},M:{"2049":"T"},N:{"258":"A B"},O:{"258":"dC"},P:{"1025":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1025":"qC"},S:{"1":"rC"}},B:1,C:"Basic console logging functions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/console-time.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/console-time.js
new file mode 100644
index 0000000..fbc2487
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/console-time.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F 7B 8B 9B AC","16":"B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"U","16":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"console.time and console.timeEnd"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/const.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/const.js
new file mode 100644
index 0000000..69f0561
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/const.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","2052":"B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","132":"tB hB I j J D E F A B C uB vB","260":"0 K L G M N O k l m n o p q r s t u v w x y z"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","260":"I j J D E F A B C K L G M N O k l","772":"0 1 2 3 4 5 m n o p q r s t u v w x y z","1028":"6 7 8 9 AB BB CB DB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","260":"I j A yB mB nB","772":"J D E F zB 0B 1B 2B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F 7B","132":"B 8B 9B AC fB qB","644":"C BC gB","772":"G M N O k l m n o p q r s","1028":"0 t u v w x y z"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","260":"mB CC rB JC KC","772":"E DC EC FC GC HC IC"},H:{"644":"WC"},I:{"1":"H","16":"XC YC","260":"ZC","772":"hB I aC rB bC cC"},J:{"772":"D A"},K:{"1":"U","132":"A B fB qB","644":"C gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","1028":"I"},Q:{"1":"pC"},R:{"1028":"qC"},S:{"1":"rC"}},B:6,C:"const"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/constraint-validation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/constraint-validation.js
new file mode 100644
index 0000000..9398d29
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/constraint-validation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","900":"A B"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","388":"L G M","900":"C K"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","260":"EB FB","388":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB","900":"I j J D E F A B C K L G M N O k l m n o p q r s t"},D:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","388":"0 1 2 3 4 q r s t u v w x y z","900":"G M N O k l m n o p"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB","388":"E F 1B 2B","900":"J D zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F B 7B 8B 9B AC fB qB","388":"G M N O k l m n o p q r","900":"C BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB","388":"E FC GC HC IC","900":"DC EC"},H:{"2":"WC"},I:{"1":"H","16":"hB XC YC ZC","388":"bC cC","900":"I aC rB"},J:{"16":"D","388":"A"},K:{"1":"U","16":"A B fB qB","900":"C gB"},L:{"1":"H"},M:{"1":"T"},N:{"900":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"388":"rC"}},B:1,C:"Constraint Validation API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contenteditable.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contenteditable.js
new file mode 100644
index 0000000..97d3c4b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contenteditable.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB","4":"hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"contenteditable attribute (basic support)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contentsecuritypolicy.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contentsecuritypolicy.js
new file mode 100644
index 0000000..261bdd7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contentsecuritypolicy.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","129":"I j J D E F A B C K L G M N O k l m n"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K","257":"L G M N O k l m n o p"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB","257":"J 0B","260":"zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","257":"EC","260":"DC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D","257":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"257":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Content Security Policy 1.0"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contentsecuritypolicy2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contentsecuritypolicy2.js
new file mode 100644
index 0000000..02ac8f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/contentsecuritypolicy2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L","32772":"G M N O"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v uB vB","132":"w x y z","260":"0","516":"1 2 3 4 5 6 7 8 9","8196":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","1028":"1 2 3","2052":"4"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n 7B 8B 9B AC fB qB BC gB","1028":"o p q","2052":"r"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"4100":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"8196":"rC"}},B:2,C:"Content Security Policy Level 2"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cookie-store-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cookie-store-api.js
new file mode 100644
index 0000000..76ba5a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cookie-store-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"Y Z a b c d e f g T h i H","2":"C K L G M N O","194":"P Q R S V W X"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB","194":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB 7B 8B 9B AC fB qB BC gB","194":"GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Cookie Store API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cors.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cors.js
new file mode 100644
index 0000000..bb4fd03
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cors.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D sB","132":"A","260":"E F"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB","1025":"jB PB QB U RB SB TB UB VB WB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C"},E:{"2":"yB mB","513":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","644":"I j zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC"},G:{"513":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","644":"mB CC rB DC"},H:{"2":"WC"},I:{"1":"H bC cC","132":"hB I XC YC ZC aC rB"},J:{"1":"A","132":"D"},K:{"1":"C U gB","2":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","132":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Cross-Origin Resource Sharing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/createimagebitmap.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/createimagebitmap.js
new file mode 100644
index 0000000..c8ec5ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/createimagebitmap.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","3076":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB","132":"FB GB","260":"HB IB","516":"JB KB LB MB NB"},E:{"2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B 4B","516":"G 5B oB pB 6B"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","132":"2 3","260":"4 5","516":"6 7 8 9 AB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC","516":"VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"3076":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","16":"I eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"3076":"rC"}},B:1,C:"createImageBitmap"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/credential-management.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/credential-management.js
new file mode 100644
index 0000000..12441fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/credential-management.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB","66":"DB EB FB","129":"GB HB IB JB KB LB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Credential Management API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cryptography.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cryptography.js
new file mode 100644
index 0000000..7984f68
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/cryptography.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E F A","164":"B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","513":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w uB vB","66":"x y"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","8":"I j J D yB mB zB 0B","289":"E F A 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","8":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","8":"mB CC rB DC EC FC","289":"E GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","8":"hB I XC YC ZC aC rB bC cC"},J:{"8":"D A"},K:{"1":"U","8":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A","164":"B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Web Cryptography"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-all.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-all.js
new file mode 100644
index 0000000..3505799
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-all.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r uB vB"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC"},H:{"2":"WC"},I:{"1":"H cC","2":"hB I XC YC ZC aC rB bC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS all property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-animation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-animation.js
new file mode 100644
index 0000000..41c708b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-animation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I uB vB","33":"j J D E F A B C K L G"},D:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB","33":"J D E zB 0B 1B","292":"I j"},F:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC","33":"C G M N O k l m n o p q r s t u"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","33":"E EC FC GC","164":"mB CC rB DC"},H:{"2":"WC"},I:{"1":"H","33":"I aC rB bC cC","164":"hB XC YC ZC"},J:{"33":"D A"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS Animation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-any-link.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-any-link.js
new file mode 100644
index 0000000..66b35d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-any-link.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB","33":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB uB vB"},D:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j J yB mB zB","33":"D E 0B 1B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB DC","33":"E EC FC GC"},H:{"2":"WC"},I:{"1":"H","16":"hB I XC YC ZC aC rB","33":"bC cC"},J:{"16":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"33":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","16":"I","33":"eC fC gC hC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"33":"rC"}},B:5,C:"CSS :any-link selector"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-appearance.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-appearance.js
new file mode 100644
index 0000000..3a3c9d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-appearance.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"V W X Y Z a b c d e f g T h i H","33":"S","164":"P Q R","388":"C K L G M N O"},C:{"1":"Q R kB S V W X Y Z a b c d e f g T h i H lB","164":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","676":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"V W X Y Z a b c d e f g T h i H lB wB xB","33":"S","164":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R"},E:{"1":"pB 6B","164":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"1":"ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"WB XB YB","164":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB"},G:{"1":"pB","164":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"1":"H","164":"hB I XC YC ZC aC rB bC cC"},J:{"164":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A","388":"B"},O:{"164":"dC"},P:{"164":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"164":"pC"},R:{"164":"qC"},S:{"164":"rC"}},B:5,C:"CSS Appearance"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-at-counter-style.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-at-counter-style.js
new file mode 100644
index 0000000..9b7b351
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-at-counter-style.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b","132":"c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB","132":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b","132":"c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB 7B 8B 9B AC fB qB BC gB","132":"dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","132":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","132":"U"},L:{"132":"H"},M:{"132":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC","132":"oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"132":"rC"}},B:4,C:"CSS Counter Styles"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-autofill.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-autofill.js
new file mode 100644
index 0000000..9def396
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-autofill.js
@@ -0,0 +1 @@
+module.exports={A:{D:{"1":"T h i H lB wB xB","33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g"},L:{"1":"H"},B:{"1":"T h i H","2":"C K L G M N O","33":"P Q R S V W X Y Z a b c d e f g"},C:{"1":"X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W uB vB"},M:{"1":"T"},A:{"2":"J D E F A B sB"},F:{"1":"kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R"},K:{"2":"A B C fB qB gB","33":"U"},E:{"1":"G 5B oB pB","2":"6B","33":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B 4B"},G:{"1":"VC oB pB","33":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC"},P:{"33":"I eC fC gC hC iC nB jC kC lC mC nC oC"},I:{"1":"H","33":"hB I XC YC ZC aC rB bC cC"}},B:6,C:":autofill CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-backdrop-filter.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-backdrop-filter.js
new file mode 100644
index 0000000..df111be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-backdrop-filter.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M","257":"N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB uB vB","578":"WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB","194":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB"},E:{"2":"I j J D E yB mB zB 0B 1B","33":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y 7B 8B 9B AC fB qB BC gB","194":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"2":"E mB CC rB DC EC FC GC","33":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"578":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"kC lC mC nC oC","2":"I","194":"eC fC gC hC iC nB jC"},Q:{"194":"pC"},R:{"194":"qC"},S:{"2":"rC"}},B:7,C:"CSS Backdrop Filter"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-background-offsets.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-background-offsets.js
new file mode 100644
index 0000000..afb54cd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-background-offsets.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS background-position edge offsets"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-backgroundblendmode.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-backgroundblendmode.js
new file mode 100644
index 0000000..20c5b0d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-backgroundblendmode.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 AB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","260":"BB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B","132":"E F A 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m 7B 8B 9B AC fB qB BC gB","260":"y"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC","132":"E GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS background-blend-mode"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-boxdecorationbreak.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-boxdecorationbreak.js
new file mode 100644
index 0000000..c3716d7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-boxdecorationbreak.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","164":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w uB vB"},D:{"2":"I j J D E F A B C K L G M N O k l m","164":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J yB mB zB","164":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F 7B 8B 9B AC","129":"B C fB qB BC gB","164":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC rB DC EC","164":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"132":"WC"},I:{"2":"hB I XC YC ZC aC rB","164":"H bC cC"},J:{"2":"D","164":"A"},K:{"2":"A","129":"B C fB qB gB","164":"U"},L:{"164":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"164":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"164":"pC"},R:{"164":"qC"},S:{"1":"rC"}},B:5,C:"CSS box-decoration-break"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-boxshadow.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-boxshadow.js
new file mode 100644
index 0000000..ae90927
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-boxshadow.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","33":"uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"I j J D E F"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","33":"j","164":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","33":"CC rB","164":"mB"},H:{"2":"WC"},I:{"1":"I H aC rB bC cC","164":"hB XC YC ZC"},J:{"1":"A","33":"D"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 Box-shadow"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-canvas.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-canvas.js
new file mode 100644
index 0000000..bd424af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-canvas.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB"},E:{"2":"yB mB","33":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","33":"G M N O k l m n o p q r s t u v w x y z"},G:{"33":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"H","33":"hB I XC YC ZC aC rB bC cC"},J:{"33":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"eC fC gC hC iC nB jC kC lC mC nC oC","33":"I"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"CSS Canvas Drawings"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-caret-color.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-caret-color.js
new file mode 100644
index 0000000..7663fb8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-caret-color.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB"},D:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"CSS caret-color"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-cascade-layers.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-cascade-layers.js
new file mode 100644
index 0000000..fd59b78
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-cascade-layers.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"H","2":"C K L G M N O P Q R S V W X Y Z a b c d e f g","322":"T h i"},C:{"1":"h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e uB vB","194":"f g T"},D:{"1":"H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g","322":"T h i"},E:{"1":"pB 6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Cascade Layers"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-case-insensitive.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-case-insensitive.js
new file mode 100644
index 0000000..67f4184
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-case-insensitive.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:5,C:"Case-insensitive CSS attribute selectors"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-clip-path.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-clip-path.js
new file mode 100644
index 0000000..77f510d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-clip-path.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N","260":"P Q R S V W X Y Z a b c d e f g T h i H","3138":"O"},C:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","132":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB","644":"CB DB EB FB GB HB IB"},D:{"2":"I j J D E F A B C K L G M N O k l m n o","260":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","292":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},E:{"2":"I j J yB mB zB 0B","260":"L G 3B 4B 5B oB pB 6B","292":"D E F A B C K 1B 2B nB fB gB"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","260":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","292":"0 1 2 3 4 5 6 G M N O k l m n o p q r s t u v w x y z"},G:{"2":"mB CC rB DC EC","260":"PC QC RC SC TC UC VC oB pB","292":"E FC GC HC IC JC KC LC MC NC OC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","260":"H","292":"bC cC"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","260":"U"},L:{"260":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"292":"dC"},P:{"292":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"292":"pC"},R:{"260":"qC"},S:{"644":"rC"}},B:4,C:"CSS clip-path property (for HTML)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-color-adjust.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-color-adjust.js
new file mode 100644
index 0000000..f164824
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-color-adjust.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","33":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB uB vB"},D:{"16":"I j J D E F A B C K L G M N O","33":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j yB mB zB","33":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"16":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"16":"hB I XC YC ZC aC rB bC cC","33":"H"},J:{"16":"D A"},K:{"2":"A B C fB qB gB","33":"U"},L:{"16":"H"},M:{"1":"T"},N:{"16":"A B"},O:{"16":"dC"},P:{"16":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"16":"qC"},S:{"1":"rC"}},B:5,C:"CSS color-adjust"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-color-function.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-color-function.js
new file mode 100644
index 0000000..2b81dc8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-color-function.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"G 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B","132":"B C K L nB fB gB 3B 4B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC","132":"KC LC MC NC OC PC QC RC SC TC UC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS color() function"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-conic-gradients.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-conic-gradients.js
new file mode 100644
index 0000000..78f2cf6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-conic-gradients.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB uB vB","578":"bB cB dB eB P Q R kB"},D:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB","194":"iB OB jB PB QB U RB SB TB UB"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB 7B 8B 9B AC fB qB BC gB","194":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"1":"OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nB jC kC lC mC nC oC","2":"I eC fC gC hC iC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Conical Gradients"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-container-queries.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-container-queries.js
new file mode 100644
index 0000000..009292f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-container-queries.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d","194":"e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c","194":"e f g T h i H lB wB xB","450":"d"},E:{"1":"6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 7B 8B 9B AC fB qB BC gB","194":"P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Container Queries"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-containment.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-containment.js
new file mode 100644
index 0000000..415d0af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-containment.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","194":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB"},D:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","66":"GB"},E:{"1":"pB 6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","66":"3 4"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"194":"rC"}},B:2,C:"CSS Containment"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-content-visibility.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-content-visibility.js
new file mode 100644
index 0000000..af04f6f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-content-visibility.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"W X Y Z a b c d e f g T h i H","2":"C K L G M N O P Q R S V"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS content-visibility"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-counters.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-counters.js
new file mode 100644
index 0000000..37ae3bf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-counters.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","2":"J D sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS Counters"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-crisp-edges.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-crisp-edges.js
new file mode 100644
index 0000000..c950387
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-crisp-edges.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J sB","2340":"D E F A B"},B:{"2":"C K L G M N O","1025":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"e f g T h i H lB","2":"tB hB uB","513":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d","545":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U vB"},D:{"2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","1025":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","164":"J","4644":"D E F 0B 1B 2B"},F:{"2":"F B G M N O k l m n o p q r s 7B 8B 9B AC fB qB","545":"C BC gB","1025":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","4260":"DC EC","4644":"E FC GC HC IC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","1025":"H"},J:{"2":"D","4260":"A"},K:{"2":"A B fB qB","545":"C gB","1025":"U"},L:{"1025":"H"},M:{"545":"T"},N:{"2340":"A B"},O:{"1":"dC"},P:{"1025":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1025":"pC"},R:{"1025":"qC"},S:{"4097":"rC"}},B:7,C:"Crisp edges/pixelated images"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-cross-fade.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-cross-fade.js
new file mode 100644
index 0000000..2fdd0d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-cross-fade.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","33":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"I j J D E F A B C K L G M","33":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB","33":"J D E F zB 0B 1B 2B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","33":"E DC EC FC GC HC IC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","33":"H bC cC"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","33":"U"},L:{"33":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"33":"dC"},P:{"33":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"33":"qC"},S:{"2":"rC"}},B:4,C:"CSS Cross-Fade Function"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-default-pseudo.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-default-pseudo.js
new file mode 100644
index 0000000..9143f22
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-default-pseudo.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB hB uB vB"},D:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB","132":"J D E F A zB 0B 1B 2B"},F:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F B 7B 8B 9B AC fB qB","132":"0 1 2 G M N O k l m n o p q r s t u v w x y z","260":"C BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB DC EC","132":"E FC GC HC IC JC"},H:{"260":"WC"},I:{"1":"H","16":"hB XC YC ZC","132":"I aC rB bC cC"},J:{"16":"D","132":"A"},K:{"1":"U","16":"A B C fB qB","260":"gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"132":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","132":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:7,C:":default CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-descendant-gtgt.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-descendant-gtgt.js
new file mode 100644
index 0000000..159de52
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-descendant-gtgt.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O Q R S V W X Y Z a b c d e f g T h i H","16":"P"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"B","2":"I j J D E F A C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Explicit descendant combinator >>"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-deviceadaptation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-deviceadaptation.js
new file mode 100644
index 0000000..a9b542d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-deviceadaptation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","164":"A B"},B:{"66":"P Q R S V W X Y Z a b c d e f g T h i H","164":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"I j J D E F A B C K L G M N O k l m n o p q r s t","66":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","66":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"292":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A U","292":"B C fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"164":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"66":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Device Adaptation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-dir-pseudo.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-dir-pseudo.js
new file mode 100644
index 0000000..56252e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-dir-pseudo.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M uB vB","33":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b","194":"c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"33":"rC"}},B:5,C:":dir() CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-display-contents.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-display-contents.js
new file mode 100644
index 0000000..8f9a56a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-display-contents.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"a b c d e f g T h i H","2":"C K L G M N O","260":"P Q R S V W X Y Z"},C:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","260":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB"},D:{"1":"a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","194":"NB iB OB jB PB QB U","260":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z"},E:{"2":"I j J D E F A B yB mB zB 0B 1B 2B nB","260":"L G 3B 4B 5B oB pB 6B","772":"C K fB gB"},F:{"1":"cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB 7B 8B 9B AC fB qB BC gB","260":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC","260":"SC TC UC VC oB pB","772":"MC NC OC PC QC RC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nC oC","2":"I eC fC gC hC","260":"iC nB jC kC lC mC"},Q:{"260":"pC"},R:{"2":"qC"},S:{"260":"rC"}},B:5,C:"CSS display: contents"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-element-function.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-element-function.js
new file mode 100644
index 0000000..88894a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-element-function.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","164":"tB hB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"33":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"33":"rC"}},B:5,C:"CSS element() function"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-env-function.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-env-function.js
new file mode 100644
index 0000000..4aacae7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-env-function.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U uB vB"},D:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","132":"B"},F:{"1":"LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC","132":"LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nB jC kC lC mC nC oC","2":"I eC fC gC hC iC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"CSS Environment Variables env()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-exclusions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-exclusions.js
new file mode 100644
index 0000000..7bb5b64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-exclusions.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","33":"A B"},B:{"2":"P Q R S V W X Y Z a b c d e f g T h i H","33":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"33":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Exclusions Level 1"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-featurequeries.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-featurequeries.js
new file mode 100644
index 0000000..c10a087
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-featurequeries.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B C 7B 8B 9B AC fB qB BC"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS Feature Queries"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-file-selector-button.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-file-selector-button.js
new file mode 100644
index 0000000..6fcb487
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-file-selector-button.js
@@ -0,0 +1 @@
+module.exports={A:{D:{"1":"a b c d e f g T h i H lB wB xB","33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z"},L:{"1":"H"},B:{"1":"a b c d e f g T h i H","33":"C K L G M N O P Q R S V W X Y Z"},C:{"1":"kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R uB vB"},M:{"1":"T"},A:{"2":"J D E F sB","33":"A B"},F:{"1":"bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB"},K:{"1":"U","2":"A B C fB qB gB"},E:{"1":"G 4B 5B oB pB","2":"6B","33":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B"},G:{"1":"UC VC oB pB","33":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC"},P:{"1":"nC oC","33":"I eC fC gC hC iC nB jC kC lC mC"},I:{"1":"H","33":"hB I XC YC ZC aC rB bC cC"}},B:6,C:"::file-selector-button CSS pseudo-element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-filter-function.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-filter-function.js
new file mode 100644
index 0000000..abc238b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-filter-function.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B","33":"F"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC","33":"HC IC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS filter() function"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-filters.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-filters.js
new file mode 100644
index 0000000..2ed34f9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-filters.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","1028":"K L G M N O","1346":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB","196":"z","516":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y vB"},D:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N","33":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","33":"J D E F 0B 1B"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 G M N O k l m n o p q r s t u v w x y z"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","33":"E EC FC GC HC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB","33":"bC cC"},J:{"2":"D","33":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","33":"I eC fC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS Filter Effects"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-first-letter.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-first-letter.js
new file mode 100644
index 0000000..8138d52
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-first-letter.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","16":"sB","516":"E","1540":"J D"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","132":"hB","260":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"j J D E","132":"I"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"j yB","132":"I mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","16":"F 7B","260":"B 8B 9B AC fB qB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"1":"WC"},I:{"1":"hB I H aC rB bC cC","16":"XC YC","132":"ZC"},J:{"1":"D A"},K:{"1":"C U gB","260":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"::first-letter CSS pseudo-element selector"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-first-line.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-first-line.js
new file mode 100644
index 0000000..a5523b2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-first-line.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","132":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS first-line pseudo-element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-fixed.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-fixed.js
new file mode 100644
index 0000000..c881301
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-fixed.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"D E F A B","2":"sB","8":"J"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B nB fB gB 3B 4B 5B oB pB 6B","1025":"2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","132":"DC EC FC"},H:{"2":"WC"},I:{"1":"hB H bC cC","260":"XC YC ZC","513":"I aC rB"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS position:fixed"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-focus-visible.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-focus-visible.js
new file mode 100644
index 0000000..2062bfd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-focus-visible.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"X Y Z a b c d e f g T h i H","2":"C K L G M N O","328":"P Q R S V W"},C:{"1":"W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","161":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V"},D:{"1":"X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB","328":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W"},E:{"1":"pB 6B","2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B 4B","578":"G 5B oB"},F:{"1":"YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB 7B 8B 9B AC fB qB BC gB","328":"SB TB UB VB WB XB"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC","578":"VC oB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"161":"rC"}},B:7,C:":focus-visible CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-focus-within.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-focus-within.js
new file mode 100644
index 0000000..53f2e78
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-focus-within.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB"},D:{"1":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB","194":"iB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB 7B 8B 9B AC fB qB BC gB","194":"BB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"16":"qC"},S:{"2":"rC"}},B:7,C:":focus-within CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-palette.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-palette.js
new file mode 100644
index 0000000..b61183e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-palette.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB"},E:{"1":"pB 6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS font-palette"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-rendering-controls.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-rendering-controls.js
new file mode 100644
index 0000000..872c3a4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-rendering-controls.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB uB vB","194":"BB CB DB EB FB GB HB IB JB KB LB MB"},D:{"1":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB","66":"EB FB GB HB IB JB KB LB MB NB iB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","66":"1 2 3 4 5 6 7 8 9 AB BB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I","66":"eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"194":"rC"}},B:5,C:"CSS font-display"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-stretch.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-stretch.js
new file mode 100644
index 0000000..863a1ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-font-stretch.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E uB vB"},D:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS font-stretch"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-gencontent.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-gencontent.js
new file mode 100644
index 0000000..14f839e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-gencontent.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D sB","132":"E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS Generated content for pseudo-elements"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-gradients.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-gradients.js
new file mode 100644
index 0000000..fa7f42d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-gradients.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB","260":"0 M N O k l m n o p q r s t u v w x y z","292":"I j J D E F A B C K L G vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"A B C K L G M N O k l m n o p q","548":"I j J D E F"},E:{"2":"yB mB","260":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","292":"J zB","804":"I j"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC","33":"C BC","164":"fB qB"},G:{"260":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","292":"DC EC","804":"mB CC rB"},H:{"2":"WC"},I:{"1":"H bC cC","33":"I aC rB","548":"hB XC YC ZC"},J:{"1":"A","548":"D"},K:{"1":"U gB","2":"A B","33":"C","164":"fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS Gradients"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-grid.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-grid.js
new file mode 100644
index 0000000..74b722c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-grid.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","8":"F","292":"A B"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","292":"C K L G"},C:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O uB vB","8":"0 1 2 3 4 k l m n o p q r s t u v w x y z","584":"5 6 7 8 9 AB BB CB DB EB FB GB","1025":"HB IB"},D:{"1":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p","8":"q r s t","200":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB","1025":"MB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","8":"J D E F A 0B 1B 2B"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s 7B 8B 9B AC fB qB BC gB","200":"0 1 2 3 4 5 6 7 8 t u v w x y z"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","8":"E EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC","8":"rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"292":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"eC","8":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:4,C:"CSS Grid Layout (level 1)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hanging-punctuation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hanging-punctuation.js
new file mode 100644
index 0000000..6828e67
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hanging-punctuation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS hanging-punctuation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-has.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-has.js
new file mode 100644
index 0000000..23eee43
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-has.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB","194":"wB xB"},E:{"1":"pB 6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:":has() CSS relational pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hyphenate.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hyphenate.js
new file mode 100644
index 0000000..463ac1e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hyphenate.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"16":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","16":"C K L G M N O"},C:{"16":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},E:{"16":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"16":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"16":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"16":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"16":"A B C U fB qB gB"},L:{"16":"H"},M:{"16":"T"},N:{"16":"A B"},O:{"16":"dC"},P:{"16":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"16":"pC"},R:{"16":"qC"},S:{"16":"rC"}},B:5,C:"CSS4 Hyphenation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hyphens.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hyphens.js
new file mode 100644
index 0000000..e8f201a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-hyphens.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","33":"A B"},B:{"33":"C K L G M N O","132":"P Q R S V W X Y","260":"Z a b c d e f g T h i H"},C:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB","33":"0 1 2 3 4 5 6 7 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},D:{"1":"Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB","132":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y"},E:{"2":"I j yB mB","33":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","132":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC","33":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"4":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I","132":"eC"},Q:{"2":"pC"},R:{"132":"qC"},S:{"1":"rC"}},B:5,C:"CSS Hyphenation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-image-orientation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-image-orientation.js
new file mode 100644
index 0000000..9d61421
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-image-orientation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"a b c d e f g T h i H","2":"C K L G M N O P Q","257":"R S V W X Y Z"},C:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q uB vB"},D:{"1":"a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q","257":"R S V W X Y Z"},E:{"1":"L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB"},F:{"1":"UB VB WB XB YB","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB 7B 8B 9B AC fB qB BC gB","257":"ZB aB bB cB dB eB P Q R kB S"},G:{"1":"TC UC VC oB pB","132":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"lC mC nC oC","2":"I eC fC gC hC iC nB jC kC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 image-orientation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-image-set.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-image-set.js
new file mode 100644
index 0000000..6d218f1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-image-set.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","164":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W uB vB","66":"X Y","257":"a b c d e f g T h i H lB","772":"Z"},D:{"2":"I j J D E F A B C K L G M N O k l","164":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j yB mB zB","132":"A B C K nB fB gB 3B","164":"J D E F 0B 1B 2B","516":"L G 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","164":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC rB DC","132":"JC KC LC MC NC OC PC QC RC SC","164":"E EC FC GC HC IC","516":"TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","164":"H bC cC"},J:{"2":"D","164":"A"},K:{"2":"A B C fB qB gB","164":"U"},L:{"164":"H"},M:{"257":"T"},N:{"2":"A B"},O:{"164":"dC"},P:{"164":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"164":"pC"},R:{"164":"qC"},S:{"2":"rC"}},B:5,C:"CSS image-set"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-in-out-of-range.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-in-out-of-range.js
new file mode 100644
index 0000000..86fba41
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-in-out-of-range.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C","260":"K L G M N O"},C:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB","516":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB"},D:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I","16":"j J D E F A B C K L","260":"HB","772":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j","772":"J D E F A zB 0B 1B 2B"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F 7B","260":"4 B C 8B 9B AC fB qB BC gB","772":"0 1 2 3 G M N O k l m n o p q r s t u v w x y z"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","772":"E DC EC FC GC HC IC JC"},H:{"132":"WC"},I:{"1":"H","2":"hB XC YC ZC","260":"I aC rB bC cC"},J:{"2":"D","260":"A"},K:{"1":"U","260":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","260":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"516":"rC"}},B:5,C:":in-range and :out-of-range CSS pseudo-classes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-indeterminate-pseudo.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-indeterminate-pseudo.js
new file mode 100644
index 0000000..f8683ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-indeterminate-pseudo.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","132":"A B","388":"F"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N O"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB hB uB vB","132":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","388":"I j"},D:{"1":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","132":"0 1 2 3 G M N O k l m n o p q r s t u v w x y z"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","16":"I j J yB mB","132":"D E F A 0B 1B 2B","388":"zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F B 7B 8B 9B AC fB qB","132":"G M N O k l m n o p q","516":"C BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB DC EC","132":"E FC GC HC IC JC"},H:{"516":"WC"},I:{"1":"H","16":"hB XC YC ZC cC","132":"bC","388":"I aC rB"},J:{"16":"D","132":"A"},K:{"1":"U","16":"A B C fB qB","516":"gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"132":"rC"}},B:7,C:":indeterminate CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-initial-letter.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-initial-letter.js
new file mode 100644
index 0000000..b59fe1a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-initial-letter.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E yB mB zB 0B 1B","4":"F","164":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC","164":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Initial Letter"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-initial-value.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-initial-value.js
new file mode 100644
index 0000000..fa2aa75
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-initial-value.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","33":"I j J D E F A B C K L G M N O uB vB","164":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS initial value"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-lch-lab.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-lch-lab.js
new file mode 100644
index 0000000..226de10
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-lch-lab.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"G 5B oB pB 6B","2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B 4B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"LCH and Lab color values"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-letter-spacing.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-letter-spacing.js
new file mode 100644
index 0000000..aea6d04
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-letter-spacing.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","16":"sB","132":"J D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L G M N O k l m n o p q r s t u"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB","132":"I j J mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F 7B","132":"B C G M 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"2":"WC"},I:{"1":"H bC cC","16":"XC YC","132":"hB I ZC aC rB"},J:{"132":"D A"},K:{"1":"U","132":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"letter-spacing CSS property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-line-clamp.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-line-clamp.js
new file mode 100644
index 0000000..d9da563
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-line-clamp.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M","33":"P Q R S V W X Y Z a b c d e f g T h i H","129":"N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB uB vB","33":"UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"16":"I j J D E F A B C K","33":"0 1 2 3 4 5 6 7 8 9 L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I yB mB","33":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC rB","33":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"16":"XC YC","33":"hB I H ZC aC rB bC cC"},J:{"33":"D A"},K:{"2":"A B C fB qB gB","33":"U"},L:{"33":"H"},M:{"33":"T"},N:{"2":"A B"},O:{"33":"dC"},P:{"33":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"33":"qC"},S:{"2":"rC"}},B:5,C:"CSS line-clamp"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-logical-props.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-logical-props.js
new file mode 100644
index 0000000..d889337
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-logical-props.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"a b c d e f g T h i H","2":"C K L G M N O","1028":"Y Z","1540":"P Q R S V W X"},C:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB","164":"0 1 2 3 4 5 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","1540":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB"},D:{"1":"a b c d e f g T h i H lB wB xB","292":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB","1028":"Y Z","1540":"VB WB XB YB ZB aB bB cB dB eB P Q R S V W X"},E:{"1":"G 5B oB pB 6B","292":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB","1028":"4B","1540":"K L gB 3B"},F:{"1":"cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","292":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB","1028":"aB bB","1540":"LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB"},G:{"1":"VC oB pB","292":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC","1028":"UC","1540":"OC PC QC RC SC TC"},H:{"2":"WC"},I:{"1":"H","292":"hB I XC YC ZC aC rB bC cC"},J:{"292":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"292":"dC"},P:{"1":"nC oC","292":"I eC fC gC hC iC","1540":"nB jC kC lC mC"},Q:{"1540":"pC"},R:{"1540":"qC"},S:{"1540":"rC"}},B:5,C:"CSS Logical Properties"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-marker-pseudo.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-marker-pseudo.js
new file mode 100644
index 0000000..68650c6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-marker-pseudo.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"X Y Z a b c d e f g T h i H","2":"C K L G M N O P Q R S V W"},C:{"1":"UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB uB vB"},D:{"1":"X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W"},E:{"1":"6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB","129":"C K L G fB gB 3B 4B 5B oB pB"},F:{"1":"YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS ::marker pseudo-element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-masks.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-masks.js
new file mode 100644
index 0000000..c26f0aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-masks.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M","164":"P Q R S V W X Y Z a b c d e f g T h i H","3138":"N","12292":"O"},C:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","260":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB"},D:{"164":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"yB mB","132":"6B","164":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","164":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"164":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"164":"H bC cC","676":"hB I XC YC ZC aC rB"},J:{"164":"D A"},K:{"2":"A B C fB qB gB","164":"U"},L:{"164":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"164":"dC"},P:{"164":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"164":"pC"},R:{"164":"qC"},S:{"260":"rC"}},B:4,C:"CSS Masks"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-matches-pseudo.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-matches-pseudo.js
new file mode 100644
index 0000000..70c1aa9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-matches-pseudo.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"Z a b c d e f g T h i H","2":"C K L G M N O","1220":"P Q R S V W X Y"},C:{"1":"eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB hB uB vB","548":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB"},D:{"1":"Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","164":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U","196":"RB SB TB","1220":"UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y"},E:{"1":"L G 4B 5B oB pB 6B","2":"I yB mB","16":"j","164":"J D E zB 0B 1B","260":"F A B C K 2B nB fB gB 3B"},F:{"1":"bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","164":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB","196":"HB IB JB","1220":"KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB"},G:{"1":"TC UC VC oB pB","16":"mB CC rB DC EC","164":"E FC GC","260":"HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"1":"H","16":"hB XC YC ZC","164":"I aC rB bC cC"},J:{"16":"D","164":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"164":"dC"},P:{"1":"nC oC","164":"I eC fC gC hC iC nB jC kC lC mC"},Q:{"1220":"pC"},R:{"164":"qC"},S:{"548":"rC"}},B:5,C:":is() CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-math-functions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-math-functions.js
new file mode 100644
index 0000000..ba9749e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-math-functions.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB uB vB"},D:{"1":"P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB"},E:{"1":"L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB","132":"C K fB gB"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB 7B 8B 9B AC fB qB BC gB"},G:{"1":"SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC","132":"MC NC OC PC QC RC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"kC lC mC nC oC","2":"I eC fC gC hC iC nB jC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS math functions min(), max() and clamp()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-interaction.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-interaction.js
new file mode 100644
index 0000000..774e493
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-interaction.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB uB vB"},D:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"Media Queries: interaction media features"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-resolution.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-resolution.js
new file mode 100644
index 0000000..5e4eda9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-resolution.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","132":"F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","260":"I j J D E F A B C K L G uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","548":"I j J D E F A B C K L G M N O k l m n o p q r s t"},E:{"1":"6B","2":"yB mB","548":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F","548":"B C 7B 8B 9B AC fB qB BC"},G:{"16":"mB","548":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"132":"WC"},I:{"1":"H bC cC","16":"XC YC","548":"hB I ZC aC rB"},J:{"548":"D A"},K:{"1":"U gB","548":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Media Queries: resolution feature"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-scripting.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-scripting.js
new file mode 100644
index 0000000..e9bccda
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-media-scripting.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"16":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB","16":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H","16":"lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Media Queries: scripting media feature"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-mediaqueries.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-mediaqueries.js
new file mode 100644
index 0000000..c0177a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-mediaqueries.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"8":"J D E sB","129":"F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","129":"I j J D E F A B C K L G M N O k l m n o p q"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","129":"I j J zB","388":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","129":"mB CC rB DC EC"},H:{"1":"WC"},I:{"1":"H bC cC","129":"hB I XC YC ZC aC rB"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"129":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS3 Media Queries"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-mixblendmode.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-mixblendmode.js
new file mode 100644
index 0000000..2e46364
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-mixblendmode.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w uB vB"},D:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t","194":"0 1 2 3 4 5 u v w x y z"},E:{"2":"I j J D yB mB zB 0B","260":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t 7B 8B 9B AC fB qB BC gB"},G:{"2":"mB CC rB DC EC FC","260":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Blending of HTML/SVG elements"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-motion-paths.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-motion-paths.js
new file mode 100644
index 0000000..8005465
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-motion-paths.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB uB vB"},D:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","194":"8 9 AB"},E:{"1":"6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u 7B 8B 9B AC fB qB BC gB","194":"v w x"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"CSS Motion Path"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-namespaces.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-namespaces.js
new file mode 100644
index 0000000..1eb275f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-namespaces.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS namespaces"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-nesting.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-nesting.js
new file mode 100644
index 0000000..3d7885a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-nesting.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Nesting"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-not-sel-list.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-not-sel-list.js
new file mode 100644
index 0000000..723fc48
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-not-sel-list.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"Z a b c d e f g T h i H","2":"C K L G M N O Q R S V W X Y","16":"P"},C:{"1":"V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S uB vB"},D:{"1":"Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nC oC","2":"I eC fC gC hC iC nB jC kC lC mC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"selector list argument of :not()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-nth-child-of.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-nth-child-of.js
new file mode 100644
index 0000000..ff5b04d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-nth-child-of.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"selector list argument of :nth-child and :nth-last-child CSS pseudo-classes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-opacity.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-opacity.js
new file mode 100644
index 0000000..bd1c077
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-opacity.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","4":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS3 Opacity"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-optional-pseudo.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-optional-pseudo.js
new file mode 100644
index 0000000..ac8fd2f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-optional-pseudo.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F 7B","132":"B C 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"132":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"U","132":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:":optional CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow-anchor.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow-anchor.js
new file mode 100644
index 0000000..37bc453
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow-anchor.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB uB vB"},D:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"CSS overflow-anchor (Scroll Anchoring)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow-overlay.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow-overlay.js
new file mode 100644
index 0000000..582e958
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow-overlay.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"I j J D E F A B zB 0B 1B 2B nB fB","16":"yB mB","130":"C K L G gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC","16":"mB","130":"NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:7,C:"CSS overflow: overlay"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow.js
new file mode 100644
index 0000000..857b871
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overflow.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"388":"J D E F A B sB"},B:{"1":"b c d e f g T h i H","260":"P Q R S V W X Y Z a","388":"C K L G M N O"},C:{"1":"R kB S V W X Y Z a b c d e f g T h i H lB","260":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q","388":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB uB vB"},D:{"1":"b c d e f g T h i H lB wB xB","260":"UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a","388":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB"},E:{"1":"6B","260":"L G 3B 4B 5B oB pB","388":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB"},F:{"260":"KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","388":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB 7B 8B 9B AC fB qB BC gB"},G:{"260":"SC TC UC VC oB pB","388":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC"},H:{"388":"WC"},I:{"1":"H","388":"hB I XC YC ZC aC rB bC cC"},J:{"388":"D A"},K:{"1":"U","388":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"388":"A B"},O:{"388":"dC"},P:{"1":"nC oC","388":"I eC fC gC hC iC nB jC kC lC mC"},Q:{"388":"pC"},R:{"388":"qC"},S:{"388":"rC"}},B:5,C:"CSS overflow property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overscroll-behavior.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overscroll-behavior.js
new file mode 100644
index 0000000..147346c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-overscroll-behavior.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N","516":"O"},C:{"1":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB uB vB"},D:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB","260":"QB U"},E:{"2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B","1090":"G 4B 5B oB pB 6B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB 7B 8B 9B AC fB qB BC gB","260":"FB GB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC","1090":"UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"CSS overscroll-behavior"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-page-break.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-page-break.js
new file mode 100644
index 0000000..9564bd5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-page-break.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"388":"A B","900":"J D E F sB"},B:{"388":"C K L G M N O","900":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"772":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","900":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U uB vB"},D:{"900":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"772":"A","900":"I j J D E F B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"16":"F 7B","129":"B C 8B 9B AC fB qB BC gB","900":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"900":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"129":"WC"},I:{"900":"hB I H XC YC ZC aC rB bC cC"},J:{"900":"D A"},K:{"129":"A B C fB qB gB","900":"U"},L:{"900":"H"},M:{"900":"T"},N:{"388":"A B"},O:{"900":"dC"},P:{"900":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"900":"pC"},R:{"900":"qC"},S:{"900":"rC"}},B:2,C:"CSS page-break properties"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-paged-media.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-paged-media.js
new file mode 100644
index 0000000..48ab398
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-paged-media.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D sB","132":"E F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N O"},C:{"2":"tB hB I j J D E F A B C K L G M N O uB vB","132":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","132":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"16":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"16":"A B C U fB qB gB"},L:{"1":"H"},M:{"132":"T"},N:{"258":"A B"},O:{"258":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"132":"rC"}},B:5,C:"CSS Paged Media (@page)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-paint-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-paint-api.js
new file mode 100644
index 0000000..c256989
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-paint-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U"},E:{"2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB","194":"K L G gB 3B 4B 5B oB pB 6B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Paint API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-placeholder-shown.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-placeholder-shown.js
new file mode 100644
index 0000000..fba9119
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-placeholder-shown.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","292":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","164":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB"},D:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"164":"rC"}},B:5,C:":placeholder-shown CSS pseudo-class"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-placeholder.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-placeholder.js
new file mode 100644
index 0000000..4d97022
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-placeholder.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","36":"C K L G M N O"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O uB vB","33":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB"},D:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","36":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","36":"j J D E F A zB 0B 1B 2B"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","36":"0 1 2 3 4 5 6 7 8 G M N O k l m n o p q r s t u v w x y z"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC","36":"E rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","36":"hB I XC YC ZC aC rB bC cC"},J:{"36":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"36":"A B"},O:{"1":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","36":"I eC fC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"33":"rC"}},B:5,C:"::placeholder CSS pseudo-element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-read-only-write.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-read-only-write.js
new file mode 100644
index 0000000..aa51f17
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-read-only-write.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB","33":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB uB vB"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","132":"0 G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB mB","132":"I j J D E zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F B 7B 8B 9B AC fB","132":"C G M N O k l m n qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC","132":"E rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","16":"XC YC","132":"hB I ZC aC rB bC cC"},J:{"1":"A","132":"D"},K:{"1":"U","2":"A B fB","132":"C qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"33":"rC"}},B:1,C:"CSS :read-only and :read-write selectors"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-rebeccapurple.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-rebeccapurple.js
new file mode 100644
index 0000000..bef904c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-rebeccapurple.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB","16":"0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Rebeccapurple color"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-reflections.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-reflections.js
new file mode 100644
index 0000000..6c2aabe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-reflections.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","33":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"yB mB","33":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"33":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"33":"hB I H XC YC ZC aC rB bC cC"},J:{"33":"D A"},K:{"2":"A B C fB qB gB","33":"U"},L:{"33":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"33":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"33":"qC"},S:{"2":"rC"}},B:7,C:"CSS Reflections"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-regions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-regions.js
new file mode 100644
index 0000000..c743fb7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-regions.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","420":"A B"},B:{"2":"P Q R S V W X Y Z a b c d e f g T h i H","420":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","36":"G M N O","66":"k l m n o p q r s t u v w x y z"},E:{"2":"I j J C K L G yB mB zB fB gB 3B 4B 5B oB pB 6B","33":"D E F A B 0B 1B 2B nB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"mB CC rB DC EC MC NC OC PC QC RC SC TC UC VC oB pB","33":"E FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"420":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Regions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-repeating-gradients.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-repeating-gradients.js
new file mode 100644
index 0000000..0ed1a3a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-repeating-gradients.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB","33":"I j J D E F A B C K L G vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F","33":"A B C K L G M N O k l m n o p q"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB","33":"J zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC","33":"C BC","36":"fB qB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","33":"DC EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB XC YC ZC","33":"I aC rB"},J:{"1":"A","2":"D"},K:{"1":"U gB","2":"A B","33":"C","36":"fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS Repeating Gradients"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-resize.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-resize.js
new file mode 100644
index 0000000..1248581
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-resize.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","33":"I"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC","132":"gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:4,C:"CSS resize property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-revert-value.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-revert-value.js
new file mode 100644
index 0000000..30e178a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-revert-value.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"V W X Y Z a b c d e f g T h i H","2":"C K L G M N O P Q R S"},C:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB uB vB"},D:{"1":"V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B"},F:{"1":"ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB 7B 8B 9B AC fB qB BC gB"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS revert value"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-rrggbbaa.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-rrggbbaa.js
new file mode 100644
index 0000000..9a6dcec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-rrggbbaa.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB uB vB"},D:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB","194":"HB IB JB KB LB MB NB iB OB jB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","194":"4 5 6 7 8 9 AB BB CB DB EB FB GB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I","194":"eC fC gC"},Q:{"2":"pC"},R:{"194":"qC"},S:{"2":"rC"}},B:7,C:"#rrggbbaa hex color notation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scroll-behavior.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scroll-behavior.js
new file mode 100644
index 0000000..ab8ac21
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scroll-behavior.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","129":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","129":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","450":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB"},E:{"1":"pB 6B","2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB 3B","578":"L G 4B 5B oB"},F:{"2":"F B C G M N O k l m n o p q r s 7B 8B 9B AC fB qB BC gB","129":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","450":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC","578":"UC VC oB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"129":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"129":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSSOM Scroll-behavior"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scroll-timeline.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scroll-timeline.js
new file mode 100644
index 0000000..cc938be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scroll-timeline.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a","194":"b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V","194":"Z a b c d e f g T h i H lB wB xB","322":"W X Y"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB 7B 8B 9B AC fB qB BC gB","194":"bB cB dB eB P Q R kB S","322":"ZB aB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"CSS @scroll-timeline"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scrollbar.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scrollbar.js
new file mode 100644
index 0000000..b69fc5d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-scrollbar.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"132":"J D E F A B sB"},B:{"2":"C K L G M N O","292":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB uB vB","3074":"QB","4100":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"292":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"16":"I j yB mB","292":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","292":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"TC UC VC oB pB","16":"mB CC rB DC EC","292":"FC","804":"E GC HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"16":"XC YC","292":"hB I H ZC aC rB bC cC"},J:{"292":"D A"},K:{"2":"A B C fB qB gB","292":"U"},L:{"292":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"292":"dC"},P:{"292":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"292":"pC"},R:{"292":"qC"},S:{"2":"rC"}},B:7,C:"CSS scrollbar styling"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sel2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sel2.js
new file mode 100644
index 0000000..70889e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sel2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"D E F A B","2":"sB","8":"J"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS 2.1 selectors"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sel3.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sel3.js
new file mode 100644
index 0000000..e3091e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sel3.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"sB","8":"J","132":"D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS3 selectors"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-selection.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-selection.js
new file mode 100644
index 0000000..75e6355
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-selection.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","33":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"C U qB gB","16":"A B fB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"33":"rC"}},B:5,C:"::selection CSS pseudo-element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-shapes.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-shapes.js
new file mode 100644
index 0000000..b6a0321
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-shapes.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB uB vB","322":"GB HB IB JB KB LB MB NB iB OB jB"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y","194":"0 1 z"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B","33":"E F A 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC","33":"E GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:4,C:"CSS Shapes Level 1"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-snappoints.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-snappoints.js
new file mode 100644
index 0000000..16f1377
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-snappoints.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","6308":"A","6436":"B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","6436":"C K L G M N O"},C:{"1":"UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","2052":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB"},D:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB","8258":"SB TB UB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B","3108":"F A 2B nB"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB","8258":"JB KB LB MB NB OB PB QB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC","3108":"HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nB jC kC lC mC nC oC","2":"I eC fC gC hC iC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2052":"rC"}},B:4,C:"CSS Scroll Snap"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sticky.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sticky.js
new file mode 100644
index 0000000..9f5acda
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-sticky.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"c d e f g T h i H","2":"C K L G","1028":"P Q R S V W X Y Z a b","4100":"M N O"},C:{"1":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q uB vB","194":"r s t u v w","516":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},D:{"1":"c d e f g T h i H lB wB xB","2":"2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n AB BB CB DB EB FB GB","322":"0 1 o p q r s t u v w x y z HB IB JB KB","1028":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J yB mB zB","33":"E F A B C 1B 2B nB fB gB","2084":"D 0B"},F:{"1":"eB P Q R kB S","2":"0 1 2 3 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","322":"4 5 6","1028":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","33":"E GC HC IC JC KC LC MC NC OC","2084":"EC FC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1028":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"1028":"pC"},R:{"2":"qC"},S:{"516":"rC"}},B:5,C:"CSS position:sticky"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-subgrid.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-subgrid.js
new file mode 100644
index 0000000..3499add
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-subgrid.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Subgrid"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-supports-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-supports-api.js
new file mode 100644
index 0000000..0131951
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-supports-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G M N O"},C:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k uB vB","66":"l m","260":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},D:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s","260":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC","132":"gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"132":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB","132":"gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS.supports() API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-table.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-table.js
new file mode 100644
index 0000000..72ca360
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-table.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","2":"J D sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","132":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS Table display"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-align-last.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-align-last.js
new file mode 100644
index 0000000..a31ef46
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-align-last.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"132":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","4":"C K L G M N O"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B uB vB","33":"0 1 2 3 4 5 6 7 8 9 C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB"},D:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","322":"0 1 2 3 4 5 6 7 8 9 AB BB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m 7B 8B 9B AC fB qB BC gB","578":"n o p q r s t u v w x y"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"1":"qC"},S:{"33":"rC"}},B:5,C:"CSS3 text-align-last"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-indent.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-indent.js
new file mode 100644
index 0000000..77cc96c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-indent.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"132":"J D E F A B sB"},B:{"132":"C K L G M N O","388":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"132":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"132":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","388":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"132":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"132":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB","388":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"132":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"132":"WC"},I:{"132":"hB I XC YC ZC aC rB bC cC","388":"H"},J:{"132":"D A"},K:{"132":"A B C fB qB gB","388":"U"},L:{"388":"H"},M:{"132":"T"},N:{"132":"A B"},O:{"132":"dC"},P:{"132":"I","388":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"388":"pC"},R:{"388":"qC"},S:{"132":"rC"}},B:5,C:"CSS text-indent"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-justify.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-justify.js
new file mode 100644
index 0000000..c3e7753
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-justify.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"16":"J D sB","132":"E F A B"},B:{"132":"C K L G M N O","322":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB uB vB","1025":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","1602":"JB"},D:{"2":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","322":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C G M N O k l m n o p q r s t u 7B 8B 9B AC fB qB BC gB","322":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","322":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","322":"U"},L:{"322":"H"},M:{"1025":"T"},N:{"132":"A B"},O:{"2":"dC"},P:{"2":"I","322":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"322":"pC"},R:{"322":"qC"},S:{"2":"rC"}},B:5,C:"CSS text-justify"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-orientation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-orientation.js
new file mode 100644
index 0000000..852a5cd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-orientation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","194":"3 4 5"},D:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB"},E:{"1":"L G 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B","16":"A","33":"B C K nB fB gB 3B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS text-orientation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-spacing.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-spacing.js
new file mode 100644
index 0000000..d9a3364
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-text-spacing.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D sB","161":"E F A B"},B:{"2":"P Q R S V W X Y Z a b c d e f g T h i H","161":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"16":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS Text 4 text-spacing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-textshadow.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-textshadow.js
new file mode 100644
index 0000000..d0e3493
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-textshadow.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","129":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","129":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","260":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"4":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"A","4":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"129":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 Text-shadow"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-touch-action-2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-touch-action-2.js
new file mode 100644
index 0000000..d5b6393
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-touch-action-2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"B","164":"A"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB","260":"KB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","260":"7"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"132":"B","164":"A"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","16":"I"},Q:{"2":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"CSS touch-action level 2 values"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-touch-action.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-touch-action.js
new file mode 100644
index 0000000..0da1176
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-touch-action.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F sB","289":"A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB","194":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB","1025":"HB IB JB KB LB"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n 7B 8B 9B AC fB qB BC gB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC","516":"IC JC KC LC MC NC OC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","289":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"194":"rC"}},B:2,C:"CSS touch-action property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-transitions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-transitions.js
new file mode 100644
index 0000000..78cae03
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-transitions.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","33":"j J D E F A B C K L G","164":"I"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"I j J D E F A B C K L G M N O k l m n o p q"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","33":"J zB","164":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F 7B 8B","33":"C","164":"B 9B AC fB qB BC"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","33":"EC","164":"mB CC rB DC"},H:{"2":"WC"},I:{"1":"H bC cC","33":"hB I XC YC ZC aC rB"},J:{"1":"A","33":"D"},K:{"1":"U gB","33":"C","164":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS3 Transitions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-unicode-bidi.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-unicode-bidi.js
new file mode 100644
index 0000000..5091caf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-unicode-bidi.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"132":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N O"},C:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","33":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB","132":"tB hB I j J D E F uB vB","292":"A B C K L G M"},D:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L G M","548":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB"},E:{"132":"I j J D E yB mB zB 0B 1B","548":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"132":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"132":"E mB CC rB DC EC FC GC","548":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"1":"H","16":"hB I XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"1":"U","16":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"16":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","16":"I"},Q:{"16":"pC"},R:{"16":"qC"},S:{"33":"rC"}},B:4,C:"CSS unicode-bidi property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-unset-value.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-unset-value.js
new file mode 100644
index 0000000..0371d10
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-unset-value.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r uB vB"},D:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s 7B 8B 9B AC fB qB BC gB"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS unset value"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-variables.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-variables.js
new file mode 100644
index 0000000..39db293
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-variables.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L","260":"G"},C:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB","194":"DB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B","260":"2B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","194":"0"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC","260":"IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:4,C:"CSS Variables (Custom Properties)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-when-else.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-when-else.js
new file mode 100644
index 0000000..dcf2bfa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-when-else.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"CSS @when / @else conditional rules"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-widows-orphans.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-widows-orphans.js
new file mode 100644
index 0000000..7c7d556
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-widows-orphans.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D sB","129":"E F"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","129":"F B 7B 8B 9B AC fB qB BC"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"2":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:2,C:"CSS widows & orphans"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-width-stretch.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-width-stretch.js
new file mode 100644
index 0000000..bc69b39
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-width-stretch.js
@@ -0,0 +1 @@
+module.exports={A:{D:{"2":"I j J D E F A B C K L G M N O k l m","33":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},L:{"33":"H"},B:{"2":"C K L G M N O","33":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB","33":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},M:{"33":"T"},A:{"2":"J D E F A B sB"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},K:{"2":"A B C fB qB gB","33":"U"},E:{"2":"I j J yB mB zB 0B 6B","33":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB"},G:{"2":"mB CC rB DC EC","33":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},P:{"2":"I","33":"eC fC gC hC iC nB jC kC lC mC nC oC"},I:{"2":"hB I XC YC ZC aC rB","33":"H bC cC"}},B:6,C:"width: stretch property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-writing-mode.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-writing-mode.js
new file mode 100644
index 0000000..4dbc9ac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-writing-mode.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"132":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","322":"1 2 3 4 5"},D:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J","16":"D","33":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j","33":"J D E F A zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"G M N O k l m n o p q r s t u v w x y z"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB","33":"E DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"XC YC ZC","33":"hB I aC rB bC cC"},J:{"33":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"36":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","33":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS writing-mode property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-zoom.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-zoom.js
new file mode 100644
index 0000000..bd54772
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css-zoom.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D sB","129":"E F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"129":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:7,C:"CSS zoom"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-attr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-attr.js
new file mode 100644
index 0000000..e53df28
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-attr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"CSS3 attr() function for all properties"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-boxsizing.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-boxsizing.js
new file mode 100644
index 0000000..19ba4b2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-boxsizing.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","8":"J D sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","33":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"I j J D E F"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","33":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","33":"mB CC rB"},H:{"1":"WC"},I:{"1":"I H aC rB bC cC","33":"hB XC YC ZC"},J:{"1":"A","33":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS3 Box-sizing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-colors.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-colors.js
new file mode 100644
index 0000000..699f510
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-colors.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","4":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","2":"F","4":"7B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS3 Colors"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors-grab.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors-grab.js
new file mode 100644
index 0000000..6d2cac1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors-grab.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","33":"tB hB I j J D E F A B C K L G M N O k l m n o p q r uB vB"},D:{"1":"UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","33":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"C KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"33":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:3,C:"CSS grab & grabbing cursors"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors-newer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors-newer.js
new file mode 100644
index 0000000..0e896ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors-newer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","33":"tB hB I j J D E F A B C K L G M N O k l m n o uB vB"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","33":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB","33":"G M N O k l m n o"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"33":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"CSS3 Cursors: zoom-in & zoom-out"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors.js
new file mode 100644
index 0000000..284fc5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-cursors.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","132":"J D E sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","260":"C K"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","4":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"I"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","4":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","260":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","16":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"CSS3 Cursors (original values)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-tabsize.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-tabsize.js
new file mode 100644
index 0000000..423424f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/css3-tabsize.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"c d e f g T h i H lB","2":"tB hB uB vB","33":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b","164":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB"},D:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l","132":"0 1 2 3 4 5 6 m n o p q r s t u v w x y z"},E:{"1":"L G 3B 4B 5B oB pB 6B","2":"I j J yB mB zB","132":"D E F A B C K 0B 1B 2B nB fB gB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F 7B 8B 9B","132":"G M N O k l m n o p q r s t","164":"B C AC fB qB BC gB"},G:{"1":"SC TC UC VC oB pB","2":"mB CC rB DC EC","132":"E FC GC HC IC JC KC LC MC NC OC PC QC RC"},H:{"164":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB","132":"bC cC"},J:{"132":"D A"},K:{"1":"U","2":"A","164":"B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"164":"rC"}},B:5,C:"CSS3 tab-size"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/currentcolor.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/currentcolor.js
new file mode 100644
index 0000000..9597222
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/currentcolor.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS currentColor value"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/custom-elements.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/custom-elements.js
new file mode 100644
index 0000000..0977fc2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/custom-elements.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","8":"A B"},B:{"1":"P","2":"Q R S V W X Y Z a b c d e f g T h i H","8":"C K L G M N O"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","66":"o p q r s t u","72":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","2":"I j J D E F A B C K L G M N O k l m n o p q r Q R S V W X Y Z a b c d e f g T h i H lB wB xB","66":"s t u v w x"},E:{"2":"I j yB mB zB","8":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB","2":"F B C TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","66":"G M N O k"},G:{"2":"mB CC rB DC EC","8":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"cC","2":"hB I H XC YC ZC aC rB bC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC","2":"lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"72":"rC"}},B:7,C:"Custom Elements (deprecated V0 spec)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/custom-elementsv1.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/custom-elementsv1.js
new file mode 100644
index 0000000..8036aaf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/custom-elementsv1.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","8":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","8":"C K L G M N O"},C:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u uB vB","8":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB","456":"FB GB HB IB JB KB LB MB NB","712":"iB OB jB PB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB","8":"HB IB","132":"JB KB LB MB NB iB OB jB PB QB U RB SB"},E:{"2":"I j J D yB mB zB 0B 1B","8":"E F A 2B","132":"B C K L G nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","132":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC","132":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I","132":"eC"},Q:{"132":"pC"},R:{"132":"qC"},S:{"8":"rC"}},B:1,C:"Custom Elements (V1)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/customevent.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/customevent.js
new file mode 100644
index 0000000..3f68c7a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/customevent.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","132":"F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB","132":"J D E F A"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I","16":"j J D E K L","388":"F A B C"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j J","388":"zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F 7B 8B 9B AC","132":"B fB qB"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"CC","16":"mB rB","388":"DC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"XC YC ZC","388":"hB I aC rB"},J:{"1":"A","388":"D"},K:{"1":"C U gB","2":"A","132":"B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"CustomEvent"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/datalist.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/datalist.js
new file mode 100644
index 0000000..6683d47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/datalist.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E F","260":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G","1284":"M N O"},C:{"8":"tB hB uB vB","4612":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"I j J D E F A B C K L G M N O k","132":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","8":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB"},F:{"1":"F B C U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"8":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC","2049":"OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H cC","8":"hB I XC YC ZC aC rB bC"},J:{"1":"A","8":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"516":"T"},N:{"8":"A B"},O:{"8":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"132":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:1,C:"Datalist element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dataset.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dataset.js
new file mode 100644
index 0000000..b178890
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dataset.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","4":"J D E F A sB"},B:{"1":"C K L G M","129":"N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","4":"tB hB I j uB vB","129":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"AB BB CB DB EB FB GB HB IB JB","4":"I j J","129":"0 1 2 3 4 5 6 7 8 9 D E F A B C K L G M N O k l m n o p q r s t u v w x y z KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"4":"I j yB mB","129":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 C x y z fB qB BC gB","4":"F B 7B 8B 9B AC","129":"7 8 9 G M N O k l m n o p q r s t u v w AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"4":"mB CC rB","129":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"4":"WC"},I:{"4":"XC YC ZC","129":"hB I H aC rB bC cC"},J:{"129":"D A"},K:{"1":"C fB qB gB","4":"A B","129":"U"},L:{"129":"H"},M:{"129":"T"},N:{"1":"B","4":"A"},O:{"129":"dC"},P:{"129":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"129":"qC"},S:{"1":"rC"}},B:1,C:"dataset & data-* attributes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/datauri.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/datauri.js
new file mode 100644
index 0000000..f6897a9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/datauri.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D sB","132":"E","260":"F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K G M N O","772":"L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"260":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Data URIs"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/date-tolocaledatestring.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/date-tolocaledatestring.js
new file mode 100644
index 0000000..337e812
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/date-tolocaledatestring.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"16":"sB","132":"J D E F A B"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N"},C:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","132":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB","260":"HB IB JB KB","772":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB"},D:{"1":"WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L G M N O k l m n o","260":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB","772":"0 1 2 p q r s t u v w x y z"},E:{"1":"C K L G gB 3B 4B 5B oB pB 6B","16":"I j yB mB","132":"J D E F A zB 0B 1B 2B","260":"B nB fB"},F:{"1":"MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F B C 7B 8B 9B AC fB qB BC","132":"gB","260":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB","772":"G M N O k l m n o p"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB DC","132":"E EC FC GC HC IC JC"},H:{"132":"WC"},I:{"1":"H","16":"hB XC YC ZC","132":"I aC rB","772":"bC cC"},J:{"132":"D A"},K:{"1":"U","16":"A B C fB qB","132":"gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"260":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","260":"I eC fC gC hC"},Q:{"260":"pC"},R:{"132":"qC"},S:{"132":"rC"}},B:6,C:"Date.prototype.toLocaleDateString"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/decorators.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/decorators.js
new file mode 100644
index 0000000..b49e52b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/decorators.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Decorators"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/details.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/details.js
new file mode 100644
index 0000000..67ea73e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/details.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"F A B sB","8":"J D E"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB","8":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB","194":"CB DB"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"I j J D E F A B","257":"0 k l m n o p q r s t u v w x y z","769":"C K L G M N O"},E:{"1":"C K L G gB 3B 4B 5B oB pB 6B","8":"I j yB mB zB","257":"J D E F A 0B 1B 2B","1025":"B nB fB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"C fB qB BC gB","8":"F B 7B 8B 9B AC"},G:{"1":"E EC FC GC HC IC MC NC OC PC QC RC SC TC UC VC oB pB","8":"mB CC rB DC","1025":"JC KC LC"},H:{"8":"WC"},I:{"1":"I H aC rB bC cC","8":"hB XC YC ZC"},J:{"1":"A","8":"D"},K:{"1":"U","8":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"769":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Details & Summary elements"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/deviceorientation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/deviceorientation.js
new file mode 100644
index 0000000..4ad4c3a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/deviceorientation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"1":"C K L G M N O","4":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB uB","4":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"I j vB"},D:{"2":"I j J","4":"0 1 2 3 4 5 6 7 8 9 D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","4":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC","4":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"XC YC ZC","4":"hB I H aC rB bC cC"},J:{"2":"D","4":"A"},K:{"1":"C gB","2":"A B fB qB","4":"U"},L:{"4":"H"},M:{"4":"T"},N:{"1":"B","2":"A"},O:{"4":"dC"},P:{"4":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"4":"pC"},R:{"4":"qC"},S:{"4":"rC"}},B:4,C:"DeviceOrientation & DeviceMotion events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/devicepixelratio.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/devicepixelratio.js
new file mode 100644
index 0000000..bca0480
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/devicepixelratio.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"C U gB","2":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Window.devicePixelRatio"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dialog.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dialog.js
new file mode 100644
index 0000000..934874e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dialog.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB","194":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","1218":"Q R kB S V W X Y Z a b c d e f g T h"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w","322":"0 1 x y z"},E:{"1":"pB 6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O 7B 8B 9B AC fB qB BC gB","578":"k l m n o"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"194":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:1,C:"Dialog element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dispatchevent.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dispatchevent.js
new file mode 100644
index 0000000..8cb1644
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dispatchevent.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","16":"sB","129":"F A","130":"J D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","16":"F"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","129":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"EventTarget.dispatchEvent"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dnssec.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dnssec.js
new file mode 100644
index 0000000..5b90dd2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dnssec.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"132":"J D E F A B sB"},B:{"132":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"132":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"132":"0 1 2 3 4 5 6 7 8 9 I j w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","388":"J D E F A B C K L G M N O k l m n o p q r s t u v"},E:{"132":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"132":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"132":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"132":"WC"},I:{"132":"hB I H XC YC ZC aC rB bC cC"},J:{"132":"D A"},K:{"132":"A B C U fB qB gB"},L:{"132":"H"},M:{"132":"T"},N:{"132":"A B"},O:{"132":"dC"},P:{"132":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"132":"pC"},R:{"132":"qC"},S:{"132":"rC"}},B:6,C:"DNSSEC and DANE"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/do-not-track.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/do-not-track.js
new file mode 100644
index 0000000..b916426
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/do-not-track.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","164":"F A","260":"B"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E uB vB","516":"F A B C K L G M N O k l m n o p q r s t u v w"},D:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n"},E:{"1":"J A B C zB 2B nB fB","2":"I j K L G yB mB gB 3B 4B 5B oB pB 6B","1028":"D E F 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC"},G:{"1":"HC IC JC KC LC MC NC","2":"mB CC rB DC EC OC PC QC RC SC TC UC VC oB pB","1028":"E FC GC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"16":"D","1028":"A"},K:{"1":"U gB","16":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"164":"A","260":"B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Do Not Track API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-currentscript.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-currentscript.js
new file mode 100644
index 0000000..d87aea9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-currentscript.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t"},E:{"1":"E F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G 7B 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"document.currentScript"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-evaluate-xpath.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-evaluate-xpath.js
new file mode 100644
index 0000000..052f312
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-evaluate-xpath.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","16":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","16":"F"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:"document.evaluate & XPath"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-execcommand.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-execcommand.js
new file mode 100644
index 0000000..9d21057
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-execcommand.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","16":"F 7B"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC","16":"rB DC EC"},H:{"2":"WC"},I:{"1":"H aC rB bC cC","2":"hB I XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:"Document.execCommand()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-policy.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-policy.js
new file mode 100644
index 0000000..a2614c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-policy.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V","132":"W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V","132":"W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB 7B 8B 9B AC fB qB BC gB","132":"XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","132":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","132":"U"},L:{"132":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Document Policy"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-scrollingelement.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-scrollingelement.js
new file mode 100644
index 0000000..021311a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/document-scrollingelement.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","16":"C K"},C:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB uB vB"},D:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"document.scrollingElement"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/documenthead.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/documenthead.js
new file mode 100644
index 0000000..6abf46f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/documenthead.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F 7B 8B 9B AC"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"document.head"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dom-manip-convenience.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dom-manip-convenience.js
new file mode 100644
index 0000000..52fe8e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dom-manip-convenience.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB uB vB"},D:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB","194":"HB IB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","194":"5"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"194":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"DOM manipulation convenience methods"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dom-range.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dom-range.js
new file mode 100644
index 0000000..1ee9ebc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dom-range.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"sB","8":"J D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Document Object Model Range"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/domcontentloaded.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/domcontentloaded.js
new file mode 100644
index 0000000..7743f2b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/domcontentloaded.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"DOMContentLoaded"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/domfocusin-domfocusout-events.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/domfocusin-domfocusout-events.js
new file mode 100644
index 0000000..eec9b23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/domfocusin-domfocusout-events.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L G M N O k l m n o p q"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","16":"F B 7B 8B 9B AC fB qB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB DC EC"},H:{"16":"WC"},I:{"1":"I H aC rB bC cC","16":"hB XC YC ZC"},J:{"16":"D A"},K:{"1":"U","16":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"16":"A B"},O:{"16":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"DOMFocusIn & DOMFocusOut events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dommatrix.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dommatrix.js
new file mode 100644
index 0000000..d145dde
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dommatrix.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"A B"},B:{"132":"C K L G M N O","1028":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB","1028":"VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2564":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB","3076":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB"},D:{"16":"I j J D","132":"0 1 2 3 4 5 6 7 8 9 F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB","388":"E","1028":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"16":"I yB mB","132":"j J D E F A zB 0B 1B 2B nB","1028":"B C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB","1028":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"16":"mB CC rB","132":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"132":"I aC rB bC cC","292":"hB XC YC ZC","1028":"H"},J:{"16":"D","132":"A"},K:{"2":"A B C fB qB gB","1028":"U"},L:{"1028":"H"},M:{"1028":"T"},N:{"132":"A B"},O:{"132":"dC"},P:{"132":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"132":"pC"},R:{"132":"qC"},S:{"2564":"rC"}},B:4,C:"DOMMatrix"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/download.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/download.js
new file mode 100644
index 0000000..367afa6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/download.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Download attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dragndrop.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dragndrop.js
new file mode 100644
index 0000000..d7a5874
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/dragndrop.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"644":"J D E F sB","772":"A B"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G M N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","8":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","8":"F B 7B 8B 9B AC fB qB BC"},G:{"1":"VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","1025":"H"},J:{"2":"D A"},K:{"1":"gB","8":"A B C fB qB","1025":"U"},L:{"1025":"H"},M:{"2":"T"},N:{"1":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"Drag and Drop"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-closest.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-closest.js
new file mode 100644
index 0000000..96d0514
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-closest.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Element.closest()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-from-point.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-from-point.js
new file mode 100644
index 0000000..1abebb0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-from-point.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","16":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","16":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","16":"F 7B 8B 9B AC"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"C U gB","16":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"document.elementFromPoint()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-scroll-methods.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-scroll-methods.js
new file mode 100644
index 0000000..a2b11bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/element-scroll-methods.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB"},E:{"1":"L G 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B","132":"A B C K nB fB gB 3B"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB 7B 8B 9B AC fB qB BC gB"},G:{"1":"UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC","132":"JC KC LC MC NC OC PC QC RC SC TC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:5,C:"Scroll methods on elements (scroll, scrollTo, scrollBy)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eme.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eme.js
new file mode 100644
index 0000000..cc620f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eme.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","164":"B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","132":"0 1 2 3 4 5 6"},E:{"1":"C K L G gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B","164":"D E F A B 1B 2B nB fB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m 7B 8B 9B AC fB qB BC gB","132":"n o p q r s t"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"16":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:2,C:"Encrypted Media Extensions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eot.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eot.js
new file mode 100644
index 0000000..891b452
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eot.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","2":"sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"EOT - Embedded OpenType fonts"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es5.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es5.js
new file mode 100644
index 0000000..4872e59
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es5.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D sB","260":"F","1026":"E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","4":"tB hB uB vB","132":"I j J D E F A B C K L G M N O k l"},D:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"I j J D E F A B C K L G M N O","132":"k l m n"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","4":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","4":"F B C 7B 8B 9B AC fB qB BC","132":"gB"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","4":"mB CC rB DC"},H:{"132":"WC"},I:{"1":"H bC cC","4":"hB XC YC ZC","132":"aC rB","900":"I"},J:{"1":"A","4":"D"},K:{"1":"U","4":"A B C fB qB","132":"gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"ECMAScript 5"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-class.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-class.js
new file mode 100644
index 0000000..614e212
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-class.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","132":"7 8 9 AB BB CB DB"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t 7B 8B 9B AC fB qB BC gB","132":"0 u v w x y z"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"ES6 classes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-generators.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-generators.js
new file mode 100644
index 0000000..7883f23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-generators.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q uB vB"},D:{"1":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"ES6 Generators"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-module-dynamic-import.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-module-dynamic-import.js
new file mode 100644
index 0000000..69bc57e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-module-dynamic-import.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB uB vB","194":"SB"},D:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"JavaScript modules: dynamic import()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-module.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-module.js
new file mode 100644
index 0000000..984a618
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-module.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L","4097":"M N O","4290":"G"},C:{"1":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB uB vB","322":"JB KB LB MB NB iB"},D:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB","194":"OB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B","3076":"nB"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB 7B 8B 9B AC fB qB BC gB","194":"CB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC","3076":"KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"JavaScript modules via script tag"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-number.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-number.js
new file mode 100644
index 0000000..992edcb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-number.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G uB vB","132":"M N O k l m n o p","260":"q r s t u v","516":"w"},D:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O","1028":"k l m n o p q r s t u v w x y"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","1028":"G M N O k l"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC","1028":"aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"ES6 Number"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-string-includes.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-string-includes.js
new file mode 100644
index 0000000..7bce766
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6-string-includes.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"String.prototype.includes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6.js
new file mode 100644
index 0000000..27e12eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/es6.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","388":"B"},B:{"257":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L","769":"G M N O"},C:{"2":"tB hB I j uB vB","4":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB","257":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"I j J D E F A B C K L G M N O k l","4":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB","257":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B","4":"E F 1B 2B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","4":"0 1 2 G M N O k l m n o p q r s t u v w x y z","257":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC","4":"E FC GC HC IC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","4":"bC cC","257":"H"},J:{"2":"D","4":"A"},K:{"2":"A B C fB qB gB","257":"U"},L:{"257":"H"},M:{"257":"T"},N:{"2":"A","388":"B"},O:{"257":"dC"},P:{"4":"I","257":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"257":"pC"},R:{"4":"qC"},S:{"4":"rC"}},B:6,C:"ECMAScript 2015 (ES6)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eventsource.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eventsource.js
new file mode 100644
index 0000000..d8095cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/eventsource.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","4":"F 7B 8B 9B AC"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"D A"},K:{"1":"C U fB qB gB","4":"A B"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Server-sent events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/extended-system-fonts.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/extended-system-fonts.js
new file mode 100644
index 0000000..6bd0323
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/extended-system-fonts.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"ui-serif, ui-sans-serif, ui-monospace and ui-rounded values for font-family"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/feature-policy.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/feature-policy.js
new file mode 100644
index 0000000..817502a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/feature-policy.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y","2":"C K L G M N O","1025":"Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB uB vB","260":"aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"aB bB cB dB eB P Q R S V W X Y","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB","132":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB","1025":"Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B yB mB zB 0B 1B 2B nB","772":"C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB 7B 8B 9B AC fB qB BC gB","132":"CB DB EB FB GB HB IB JB KB LB MB NB OB","1025":"bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC","772":"MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1025":"H"},M:{"260":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"jC kC lC mC nC oC","2":"I eC fC gC","132":"hC iC nB"},Q:{"132":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Feature Policy"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fetch.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fetch.js
new file mode 100644
index 0000000..d7a476f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fetch.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y uB vB","1025":"4","1218":"0 1 2 3 z"},D:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","260":"5","772":"6"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r 7B 8B 9B AC fB qB BC gB","260":"s","772":"t"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Fetch"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fieldset-disabled.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fieldset-disabled.js
new file mode 100644
index 0000000..f8e1081
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fieldset-disabled.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"16":"sB","132":"E F","388":"J D A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G","16":"M N O k"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","16":"F 7B"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC"},H:{"388":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A","260":"B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"disabled attribute of the fieldset element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fileapi.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fileapi.js
new file mode 100644
index 0000000..021652f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fileapi.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","260":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB","260":"I j J D E F A B C K L G M N O k l m n o p q r s vB"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j","260":"0 1 2 K L G M N O k l m n o p q r s t u v w x y z","388":"J D E F A B C"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB","260":"J D E F 0B 1B 2B","388":"zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B 7B 8B 9B AC","260":"C G M N O k l m n o p fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","260":"E EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H cC","2":"XC YC ZC","260":"bC","388":"hB I aC rB"},J:{"260":"A","388":"D"},K:{"1":"U","2":"A B","260":"C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A","260":"B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"File API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filereader.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filereader.js
new file mode 100644
index 0000000..95f1e9b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filereader.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F B 7B 8B 9B AC"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"C U fB qB gB","2":"A B"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"FileReader API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filereadersync.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filereadersync.js
new file mode 100644
index 0000000..50b19ad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filereadersync.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F 7B 8B","16":"B 9B AC fB qB"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"C U qB gB","2":"A","16":"B fB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"FileReaderSync"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filesystem.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filesystem.js
new file mode 100644
index 0000000..97e119d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/filesystem.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","33":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"I j J D","33":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","36":"E F A B C"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D","33":"A"},K:{"2":"A B C U fB qB gB"},L:{"33":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I","33":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Filesystem & FileWriter API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flac.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flac.js
new file mode 100644
index 0000000..17528a8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flac.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB uB vB"},D:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","16":"9 AB BB","388":"CB DB EB FB GB HB IB JB KB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","516":"B C fB gB"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"XC YC ZC","16":"hB I aC rB bC cC"},J:{"1":"A","2":"D"},K:{"1":"U gB","16":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","129":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:6,C:"FLAC audio format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flexbox-gap.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flexbox-gap.js
new file mode 100644
index 0000000..f0e8f35
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flexbox-gap.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"V W X Y Z a b c d e f g T h i H","2":"C K L G M N O P Q R S"},C:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB uB vB"},D:{"1":"V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S"},E:{"1":"G 4B 5B oB pB 6B","2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B"},F:{"1":"ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB 7B 8B 9B AC fB qB BC gB"},G:{"1":"UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"gap property for Flexbox"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flexbox.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flexbox.js
new file mode 100644
index 0000000..3125ad6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flexbox.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","1028":"B","1316":"A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","164":"tB hB I j J D E F A B C K L G M N O k l m uB vB","516":"n o p q r s"},D:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"m n o p q r s t","164":"I j J D E F A B C K L G M N O k l"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","33":"D E 0B 1B","164":"I j J yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B C 7B 8B 9B AC fB qB BC","33":"G M"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","33":"E FC GC","164":"mB CC rB DC EC"},H:{"1":"WC"},I:{"1":"H bC cC","164":"hB I XC YC ZC aC rB"},J:{"1":"A","164":"D"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","292":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS Flexible Box Layout Module"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flow-root.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flow-root.js
new file mode 100644
index 0000000..65b713d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/flow-root.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB"},D:{"1":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB gB"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"display: flow-root"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/focusin-focusout-events.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/focusin-focusout-events.js
new file mode 100644
index 0000000..ef502ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/focusin-focusout-events.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","2":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F 7B 8B 9B AC","16":"B fB qB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"I H aC rB bC cC","2":"XC YC ZC","16":"hB"},J:{"1":"D A"},K:{"1":"C U gB","2":"A","16":"B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"focusin & focusout events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/focusoptions-preventscroll.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/focusoptions-preventscroll.js
new file mode 100644
index 0000000..536ef89
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/focusoptions-preventscroll.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M","132":"N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"preventScroll support in focus"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-family-system-ui.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-family-system-ui.js
new file mode 100644
index 0000000..0aa9569
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-family-system-ui.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","132":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c"},D:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB","260":"IB JB KB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B","16":"F","132":"A 2B nB"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC","132":"HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"132":"rC"}},B:5,C:"system-ui value for font-family"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-feature.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-feature.js
new file mode 100644
index 0000000..f64f3fe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-feature.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","33":"G M N O k l m n o p q r s t u v w x y","164":"I j J D E F A B C K L"},D:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G","33":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB","292":"M N O k l"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"D E F yB mB 0B 1B","4":"I j J zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"G M N O k l m n o p q r s t u v w x y z"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E FC GC HC","4":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB","33":"bC cC"},J:{"2":"D","33":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","33":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS font-feature-settings"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-kerning.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-kerning.js
new file mode 100644
index 0000000..6871b4c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-kerning.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o uB vB","194":"p q r s t u v w x y"},D:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t","33":"u v w x"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B","33":"D E F 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G 7B 8B 9B AC fB qB BC gB","33":"M N O k"},G:{"1":"NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC","33":"E GC HC IC JC KC LC MC"},H:{"2":"WC"},I:{"1":"H cC","2":"hB I XC YC ZC aC rB","33":"bC"},J:{"2":"D","33":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 font-kerning"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-loading.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-loading.js
new file mode 100644
index 0000000..e9d3b7d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-loading.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","194":"0 1 2 3 4 5"},D:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS Font Loading"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-metrics-overrides.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-metrics-overrides.js
new file mode 100644
index 0000000..3f2d821
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-metrics-overrides.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W","194":"X"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"@font-face metrics overrides"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-size-adjust.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-size-adjust.js
new file mode 100644
index 0000000..f0ab9e4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-size-adjust.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","194":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB"},D:{"2":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","194":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C G M N O k l m n o p q r s t u 7B 8B 9B AC fB qB BC gB","194":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"258":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"194":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"CSS font-size-adjust"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-smooth.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-smooth.js
new file mode 100644
index 0000000..4b1963e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-smooth.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","676":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p uB vB","804":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"I","676":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"yB mB","676":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","676":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"804":"rC"}},B:7,C:"CSS font-smooth"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-unicode-range.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-unicode-range.js
new file mode 100644
index 0000000..0056c3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-unicode-range.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","4":"F A B"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","4":"C K L G M"},C:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","194":"1 2 3 4 5 6 7 8"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","4":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","4":"G M N O k l m n"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","4":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","4":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","4":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"4":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","4":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:4,C:"Font unicode-range subsetting"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-alternates.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-alternates.js
new file mode 100644
index 0000000..4191fe0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-alternates.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","130":"A B"},B:{"130":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","130":"I j J D E F A B C K L G M N O k l m n o","322":"p q r s t u v w x y"},D:{"2":"I j J D E F A B C K L G","130":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"D E F yB mB 0B 1B","130":"I j J zB"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","130":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB FC GC HC","130":"CC rB DC EC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","130":"H bC cC"},J:{"2":"D","130":"A"},K:{"2":"A B C fB qB gB","130":"U"},L:{"130":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"130":"dC"},P:{"130":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"130":"pC"},R:{"130":"qC"},S:{"1":"rC"}},B:5,C:"CSS font-variant-alternates"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-east-asian.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-east-asian.js
new file mode 100644
index 0000000..1999e5a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-east-asian.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o uB vB","132":"p q r s t u v w x y"},D:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"132":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:4,C:"CSS font-variant-east-asian "};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-numeric.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-numeric.js
new file mode 100644
index 0000000..8184b4f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/font-variant-numeric.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y uB vB"},D:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B"},F:{"1":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","16":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:2,C:"CSS font-variant-numeric"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fontface.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fontface.js
new file mode 100644
index 0000000..c13958d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fontface.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","132":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","2":"F 7B"},G:{"1":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","260":"mB CC"},H:{"2":"WC"},I:{"1":"I H aC rB bC cC","2":"XC","4":"hB YC ZC"},J:{"1":"A","4":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"@font-face Web fonts"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-attribute.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-attribute.js
new file mode 100644
index 0000000..120028b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-attribute.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"1":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Form attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-submit-attributes.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-submit-attributes.js
new file mode 100644
index 0000000..05848a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-submit-attributes.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","2":"F 7B","16":"8B 9B"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"1":"WC"},I:{"1":"I H aC rB bC cC","2":"XC YC ZC","16":"hB"},J:{"1":"A","2":"D"},K:{"1":"B C U fB qB gB","16":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Attributes for form submission"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-validation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-validation.js
new file mode 100644
index 0000000..b5134f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/form-validation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","132":"j J D E F A zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","2":"F 7B"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB","132":"E CC rB DC EC FC GC HC IC JC"},H:{"516":"WC"},I:{"1":"H cC","2":"hB XC YC ZC","132":"I aC rB bC"},J:{"1":"A","132":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"260":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"132":"rC"}},B:1,C:"Form validation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/forms.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/forms.js
new file mode 100644
index 0000000..227281d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/forms.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","4":"A B","8":"J D E F"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","4":"C K L G"},C:{"4":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"tB hB uB vB"},D:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB"},E:{"4":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"yB mB"},F:{"1":"F B C HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","4":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB"},G:{"2":"mB","4":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB","4":"bC cC"},J:{"2":"D","4":"A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"4":"T"},N:{"4":"A B"},O:{"1":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","4":"I eC fC gC"},Q:{"1":"pC"},R:{"4":"qC"},S:{"4":"rC"}},B:1,C:"HTML5 form features"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fullscreen.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fullscreen.js
new file mode 100644
index 0000000..91115d2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/fullscreen.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","548":"B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","516":"C K L G M N O"},C:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F uB vB","676":"0 1 2 3 4 5 6 7 8 9 A B C K L G M N O k l m n o p q r s t u v w x y z AB BB","1700":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB"},D:{"1":"XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L","676":"G M N O k","804":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB"},E:{"2":"I j yB mB","548":"pB 6B","676":"zB","804":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B C 7B 8B 9B AC fB qB BC","804":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC","2052":"NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D","292":"A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A","548":"B"},O:{"804":"dC"},P:{"1":"nB jC kC lC mC nC oC","804":"I eC fC gC hC iC"},Q:{"804":"pC"},R:{"804":"qC"},S:{"1":"rC"}},B:1,C:"Full Screen API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/gamepad.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/gamepad.js
new file mode 100644
index 0000000..b411e43
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/gamepad.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l","33":"m n o p"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"Gamepad API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/geolocation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/geolocation.js
new file mode 100644
index 0000000..407b884
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/geolocation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"sB","8":"J D E"},B:{"1":"C K L G M N O","129":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB uB vB","8":"tB hB","129":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB","4":"I","129":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"I yB mB","129":"A"},F:{"1":"0 1 2 3 B C M N O k l m n o p q r s t u v w x y z AC fB qB BC gB","2":"F G 7B","8":"8B 9B","129":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"E mB CC rB DC EC FC GC HC IC","129":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I XC YC ZC aC rB bC cC","129":"H"},J:{"1":"D A"},K:{"1":"B C fB qB gB","8":"A","129":"U"},L:{"129":"H"},M:{"129":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I","129":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"129":"pC"},R:{"129":"qC"},S:{"1":"rC"}},B:2,C:"Geolocation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getboundingclientrect.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getboundingclientrect.js
new file mode 100644
index 0000000..566b1d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getboundingclientrect.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"644":"J D sB","2049":"F A B","2692":"E"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2049":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB","260":"I j J D E F A B","1156":"hB","1284":"uB","1796":"vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","16":"F 7B","132":"8B 9B"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","132":"A"},L:{"1":"H"},M:{"1":"T"},N:{"2049":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Element.getBoundingClientRect()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getcomputedstyle.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getcomputedstyle.js
new file mode 100644
index 0000000..ad2b0ce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getcomputedstyle.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB","132":"hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","260":"I j J D E F A"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","260":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","260":"F 7B 8B 9B"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","260":"mB CC rB"},H:{"260":"WC"},I:{"1":"I H aC rB bC cC","260":"hB XC YC ZC"},J:{"1":"A","260":"D"},K:{"1":"B C U fB qB gB","260":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"getComputedStyle"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getelementsbyclassname.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getelementsbyclassname.js
new file mode 100644
index 0000000..0d5ffbd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getelementsbyclassname.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"sB","8":"J D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","8":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"getElementsByClassName"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getrandomvalues.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getrandomvalues.js
new file mode 100644
index 0000000..39aa002
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/getrandomvalues.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","33":"B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A","33":"B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"crypto.getRandomValues()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/gyroscope.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/gyroscope.js
new file mode 100644
index 0000000..aa3086e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/gyroscope.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","194":"NB iB OB jB PB QB U RB SB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"Gyroscope"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hardwareconcurrency.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hardwareconcurrency.js
new file mode 100644
index 0000000..d73c7fb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hardwareconcurrency.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L"},C:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB uB vB"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"2":"I j J D yB mB zB 0B 1B","129":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","194":"E F A 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB"},G:{"2":"mB CC rB DC EC FC","129":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","194":"E GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"navigator.hardwareConcurrency"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hashchange.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hashchange.js
new file mode 100644
index 0000000..d69b831
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hashchange.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","8":"J D sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","8":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"I"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","8":"F 7B 8B 9B"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"2":"WC"},I:{"1":"hB I H YC ZC aC rB bC cC","2":"XC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","8":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Hashchange event"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/heif.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/heif.js
new file mode 100644
index 0000000..cc964a3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/heif.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A yB mB zB 0B 1B 2B nB","130":"B C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC","130":"LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"HEIF/ISO Base Media File Format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hevc.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hevc.js
new file mode 100644
index 0000000..394eba3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hevc.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"2":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","516":"B C fB gB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","258":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","258":"U"},L:{"258":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I","258":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"HEVC/H.265 video format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hidden.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hidden.js
new file mode 100644
index 0000000..ce57435
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/hidden.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F B 7B 8B 9B AC"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"1":"WC"},I:{"1":"I H aC rB bC cC","2":"hB XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"C U fB qB gB","2":"A B"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"hidden attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/high-resolution-time.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/high-resolution-time.js
new file mode 100644
index 0000000..12819dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/high-resolution-time.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k","33":"l m n o"},E:{"1":"E F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"High Resolution Time API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/history.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/history.js
new file mode 100644
index 0000000..6c80fc1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/history.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","4":"j zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S qB BC gB","2":"F B 7B 8B 9B AC fB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC","4":"rB"},H:{"2":"WC"},I:{"1":"H YC ZC rB bC cC","2":"hB I XC aC"},J:{"1":"D A"},K:{"1":"C U fB qB gB","2":"A B"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Session history management"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/html-media-capture.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/html-media-capture.js
new file mode 100644
index 0000000..552e1ac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/html-media-capture.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"mB CC rB DC","129":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC","257":"YC ZC"},J:{"1":"A","16":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"516":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"16":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:4,C:"HTML Media Capture"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/html5semantic.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/html5semantic.js
new file mode 100644
index 0000000..8f221f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/html5semantic.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E","260":"F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB","132":"hB uB vB","260":"I j J D E F A B C K L G M N O k l"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j","260":"J D E F A B C K L G M N O k l m n o p q"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","132":"I yB mB","260":"j J zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","132":"F B 7B 8B 9B AC","260":"C fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","132":"mB","260":"CC rB DC EC"},H:{"132":"WC"},I:{"1":"H bC cC","132":"XC","260":"hB I YC ZC aC rB"},J:{"260":"D A"},K:{"1":"U","132":"A","260":"B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"260":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"HTML5 semantic elements"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http-live-streaming.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http-live-streaming.js
new file mode 100644
index 0000000..d7ecffa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http-live-streaming.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O","2":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:7,C:"HTTP Live Streaming (HLS)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http2.js
new file mode 100644
index 0000000..a4daeb2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"1":"C K L G M N O","513":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB","2":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","513":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"6 7 8 9 AB BB CB DB EB FB","2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","513":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B","260":"F A 2B nB"},F:{"1":"0 1 2 t u v w x y z","2":"F B C G M N O k l m n o p q r s 7B 8B 9B AC fB qB BC gB","513":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","513":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","513":"U"},L:{"513":"H"},M:{"513":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I","513":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"513":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"HTTP/2 protocol"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http3.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http3.js
new file mode 100644
index 0000000..2d60b69
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/http3.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"Y Z a b c d e f g T h i H","2":"C K L G M N O","322":"P Q R S V","578":"W X"},C:{"1":"Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB uB vB","194":"YB ZB aB bB cB dB eB P Q R kB S V W X Y"},D:{"1":"Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","322":"P Q R S V","578":"W X"},E:{"2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB 3B","1090":"L G 4B 5B oB pB 6B"},F:{"1":"aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB 7B 8B 9B AC fB qB BC gB","578":"ZB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC","66":"TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"194":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"HTTP/3 protocol"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-sandbox.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-sandbox.js
new file mode 100644
index 0000000..9c3b956
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-sandbox.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M uB vB","4":"N O k l m n o p q r s"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC"},H:{"2":"WC"},I:{"1":"hB I H YC ZC aC rB bC cC","2":"XC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"sandbox attribute for iframes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-seamless.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-seamless.js
new file mode 100644
index 0000000..11596a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-seamless.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","66":"l m n o p q r"},E:{"2":"I j J E F A B C K L G yB mB zB 0B 2B nB fB gB 3B 4B 5B oB pB 6B","130":"D 1B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","130":"FC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"seamless attribute for iframes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-srcdoc.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-srcdoc.js
new file mode 100644
index 0000000..0f4594f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/iframe-srcdoc.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","8":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB","8":"hB I j J D E F A B C K L G M N O k l m n o p uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K","8":"L G M N O k"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB","8":"I j zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B 7B 8B 9B AC","8":"C fB qB BC gB"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB","8":"CC rB DC"},H:{"2":"WC"},I:{"1":"H bC cC","8":"hB I XC YC ZC aC rB"},J:{"1":"A","8":"D"},K:{"1":"U","2":"A B","8":"C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"srcdoc attribute for iframes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/imagecapture.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/imagecapture.js
new file mode 100644
index 0000000..4b06695
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/imagecapture.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","322":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","194":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB","322":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","322":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"322":"pC"},R:{"1":"qC"},S:{"194":"rC"}},B:5,C:"ImageCapture API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ime.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ime.js
new file mode 100644
index 0000000..02e8d94
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ime.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","161":"B"},B:{"2":"P Q R S V W X Y Z a b c d e f g T h i H","161":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A","161":"B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Input Method Editor API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/img-naturalwidth-naturalheight.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/img-naturalwidth-naturalheight.js
new file mode 100644
index 0000000..c9652ce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/img-naturalwidth-naturalheight.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"naturalWidth & naturalHeight image properties"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/import-maps.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/import-maps.js
new file mode 100644
index 0000000..2fe72d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/import-maps.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"a b c d e f g T h i H","2":"C K L G M N O","194":"P Q R S V W X Y Z"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB","194":"aB bB cB dB eB P Q R S V W X Y Z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB 7B 8B 9B AC fB qB BC gB","194":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nC oC","2":"I eC fC gC hC iC nB jC kC lC mC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Import maps"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/imports.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/imports.js
new file mode 100644
index 0000000..13a2603
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/imports.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","8":"A B"},B:{"1":"P","2":"Q R S V W X Y Z a b c d e f g T h i H","8":"C K L G M N O"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u uB vB","8":"v w LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","72":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u Q R S V W X Y Z a b c d e f g T h i H lB wB xB","66":"v w x y z","72":"0"},E:{"2":"I j yB mB zB","8":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB","2":"F B C G M TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","66":"N O k l m","72":"n"},G:{"2":"mB CC rB DC EC","8":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"8":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC","2":"lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"HTML Imports"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indeterminate-checkbox.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indeterminate-checkbox.js
new file mode 100644
index 0000000..8ea9ac0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indeterminate-checkbox.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","16":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB","16":"uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB"},G:{"1":"OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"indeterminate checkbox"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indexeddb.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indexeddb.js
new file mode 100644
index 0000000..14f77f6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indexeddb.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","33":"A B C K L G","36":"I j J D E F"},D:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"A","8":"I j J D E F","33":"o","36":"B C K L G M N O k l m n"},E:{"1":"A B C K L G nB fB gB 3B 5B oB pB 6B","8":"I j J D yB mB zB 0B","260":"E F 1B 2B","516":"4B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F 7B 8B","8":"B C 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC VC oB pB","8":"mB CC rB DC EC FC","260":"E GC HC IC","516":"UC"},H:{"2":"WC"},I:{"1":"H bC cC","8":"hB I XC YC ZC aC rB"},J:{"1":"A","8":"D"},K:{"1":"U","2":"A","8":"B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"IndexedDB"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indexeddb2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indexeddb2.js
new file mode 100644
index 0000000..68aa652
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/indexeddb2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","132":"9 AB BB","260":"CB DB EB FB"},D:{"1":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB","132":"DB EB FB GB","260":"HB IB JB KB LB MB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","132":"0 1 2 3","260":"4 5 6 7 8 9"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC","16":"JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I","260":"eC fC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"260":"rC"}},B:4,C:"IndexedDB 2.0"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/inline-block.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/inline-block.js
new file mode 100644
index 0000000..86b6e0e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/inline-block.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","4":"sB","132":"J D"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","36":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS inline-block"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/innertext.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/innertext.js
new file mode 100644
index 0000000..060e132
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/innertext.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","16":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","16":"F"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"HTMLElement.innerText"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-autocomplete-onoff.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-autocomplete-onoff.js
new file mode 100644
index 0000000..7ccb2b4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-autocomplete-onoff.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A sB","132":"B"},B:{"132":"C K L G M N O","260":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u uB vB","516":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"N O k l m n o p q r","2":"I j J D E F A B C K L G M","132":"0 1 2 3 4 5 s t u v w x y z","260":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"J zB 0B","2":"I j yB mB","2052":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"mB CC rB","1025":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1025":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2052":"A B"},O:{"1025":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"260":"pC"},R:{"1":"qC"},S:{"516":"rC"}},B:1,C:"autocomplete attribute: on & off values"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-color.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-color.js
new file mode 100644
index 0000000..2a3b0ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-color.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F G M 7B 8B 9B AC"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC","129":"OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:1,C:"Color input type"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-datetime.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-datetime.js
new file mode 100644
index 0000000..ce367e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-datetime.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","132":"C"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB","1090":"IB JB KB LB","2052":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d","4100":"e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k","2052":"l m n o p"},E:{"2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B","4100":"G 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"mB CC rB","260":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB XC YC ZC","514":"I aC rB"},J:{"1":"A","2":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2052":"rC"}},B:1,C:"Date and time input types"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-email-tel-url.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-email-tel-url.js
new file mode 100644
index 0000000..fa697a8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-email-tel-url.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","132":"XC YC ZC"},J:{"1":"A","132":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Email, telephone & URL input types"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-event.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-event.js
new file mode 100644
index 0000000..0e45e3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-event.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","2561":"A B","2692":"F"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2561":"C K L G M N O"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB","1537":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB vB","1796":"hB uB"},D:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L","1025":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB","1537":"G M N O k l m n o p q r s t u v w x y z"},E:{"1":"L G 3B 4B 5B oB pB 6B","16":"I j J yB mB","1025":"D E F A B C 0B 1B 2B nB fB","1537":"zB","4097":"K gB"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","16":"F B C 7B 8B 9B AC fB qB","260":"BC","1025":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB","1537":"G M N O k l m"},G:{"16":"mB CC rB","1025":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","1537":"DC EC FC"},H:{"2":"WC"},I:{"16":"XC YC","1025":"H cC","1537":"hB I ZC aC rB bC"},J:{"1025":"A","1537":"D"},K:{"1":"A B C fB qB gB","1025":"U"},L:{"1":"H"},M:{"1537":"T"},N:{"2561":"A B"},O:{"1537":"dC"},P:{"1025":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1025":"pC"},R:{"1025":"qC"},S:{"1537":"rC"}},B:1,C:"input event"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-accept.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-accept.js
new file mode 100644
index 0000000..2f5615e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-accept.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","132":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I","16":"j J D E m n o p q","132":"F A B C K L G M N O k l"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","132":"J D E F A B 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"2":"EC FC","132":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","514":"mB CC rB DC"},H:{"2":"WC"},I:{"2":"XC YC ZC","260":"hB I aC rB","514":"H bC cC"},J:{"132":"A","260":"D"},K:{"2":"A B C fB qB gB","514":"U"},L:{"260":"H"},M:{"2":"T"},N:{"514":"A","1028":"B"},O:{"2":"dC"},P:{"260":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"260":"pC"},R:{"260":"qC"},S:{"1":"rC"}},B:1,C:"accept attribute for file input"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-directory.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-directory.js
new file mode 100644
index 0000000..fd641a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-directory.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Directory selection from file input"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-multiple.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-multiple.js
new file mode 100644
index 0000000..97d0895
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-file-multiple.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","2":"F 7B 8B 9B"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC"},H:{"130":"WC"},I:{"130":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"130":"A B C U fB qB gB"},L:{"132":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"130":"dC"},P:{"130":"I","132":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"132":"pC"},R:{"132":"qC"},S:{"2":"rC"}},B:1,C:"Multiple file selection"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-inputmode.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-inputmode.js
new file mode 100644
index 0000000..a0241fb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-inputmode.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"g T h i H lB","2":"tB hB I j J D E F A B C K L G M uB vB","4":"N O k l","194":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f"},D:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB","66":"LB MB NB iB OB jB PB QB U RB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","66":"8 9 AB BB CB DB EB FB GB HB"},G:{"1":"OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","2":"I eC fC gC hC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"194":"rC"}},B:1,C:"inputmode attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-minlength.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-minlength.js
new file mode 100644
index 0000000..63d980d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-minlength.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB uB vB"},D:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:1,C:"Minimum length attribute for input fields"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-number.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-number.js
new file mode 100644
index 0000000..4e7fad6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-number.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","129":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","129":"C K","1025":"L G M N O"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB","513":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"388":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB XC YC ZC","388":"I H aC rB bC cC"},J:{"2":"D","388":"A"},K:{"1":"A B C fB qB gB","388":"U"},L:{"388":"H"},M:{"641":"T"},N:{"388":"A B"},O:{"388":"dC"},P:{"388":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"388":"pC"},R:{"388":"qC"},S:{"513":"rC"}},B:1,C:"Number input type"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-pattern.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-pattern.js
new file mode 100644
index 0000000..68f7d47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-pattern.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j","388":"J D E F A zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB","388":"E DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H cC","2":"hB I XC YC ZC aC rB bC"},J:{"1":"A","2":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Pattern attribute for input fields"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-placeholder.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-placeholder.js
new file mode 100644
index 0000000..48098a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-placeholder.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","132":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S qB BC gB","2":"F 7B 8B 9B AC","132":"B fB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB H XC YC ZC rB bC cC","4":"I aC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"input placeholder attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-range.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-range.js
new file mode 100644
index 0000000..8ac40ed
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-range.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"H rB bC cC","4":"hB I XC YC ZC aC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Range input type"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-search.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-search.js
new file mode 100644
index 0000000..f629e91
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-search.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","129":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","129":"C K L G M N O"},C:{"2":"tB hB uB vB","129":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L m n o p q","129":"G M N O k l"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F 7B 8B 9B AC","16":"B fB qB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"129":"WC"},I:{"1":"H bC cC","16":"XC YC","129":"hB I ZC aC rB"},J:{"1":"D","129":"A"},K:{"1":"C U","2":"A","16":"B fB qB","129":"gB"},L:{"1":"H"},M:{"129":"T"},N:{"129":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"129":"rC"}},B:1,C:"Search input type"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-selection.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-selection.js
new file mode 100644
index 0000000..2af1199
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/input-selection.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","16":"F 7B 8B 9B"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Selection controls for input & textarea"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/insert-adjacent.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/insert-adjacent.js
new file mode 100644
index 0000000..ecef0eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/insert-adjacent.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","16":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","16":"F"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Element.insertAdjacentElement() & Element.insertAdjacentText()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/insertadjacenthtml.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/insertadjacenthtml.js
new file mode 100644
index 0000000..5b2e99e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/insertadjacenthtml.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","16":"sB","132":"J D E F"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","16":"F 7B"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Element.insertAdjacentHTML()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/internationalization.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/internationalization.js
new file mode 100644
index 0000000..7d91086
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/internationalization.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:6,C:"Internationalization API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intersectionobserver-v2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intersectionobserver-v2.js
new file mode 100644
index 0000000..7489d69
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intersectionobserver-v2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"jC kC lC mC nC oC","2":"I eC fC gC hC iC nB"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"IntersectionObserver V2"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intersectionobserver.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intersectionobserver.js
new file mode 100644
index 0000000..b540dc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intersectionobserver.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O","2":"C K L","516":"G","1025":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB","194":"HB IB JB"},D:{"1":"NB iB OB jB PB QB U","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","516":"GB HB IB JB KB LB MB","1025":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","2":"0 1 2 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","516":"3 4 5 6 7 8 9","1025":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","1025":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","1025":"U"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"516":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I","516":"eC fC"},Q:{"1025":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"IntersectionObserver"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intl-pluralrules.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intl-pluralrules.js
new file mode 100644
index 0000000..9a29fc6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intl-pluralrules.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N","130":"O"},C:{"1":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB uB vB"},D:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB gB"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB 7B 8B 9B AC fB qB BC gB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Intl.PluralRules API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intrinsic-width.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intrinsic-width.js
new file mode 100644
index 0000000..daad347
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/intrinsic-width.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","1537":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB","932":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB uB vB","2308":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"I j J D E F A B C K L G M N O k l m","545":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB","1537":"BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J yB mB zB","516":"B C K L G fB gB 3B 4B 5B oB pB 6B","548":"F A 2B nB","676":"D E 0B 1B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","513":"z","545":"G M N O k l m n o p q r s t u v w x","1537":"0 1 2 3 4 5 6 7 8 9 y AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC rB DC EC","516":"TC UC VC oB pB","548":"HC IC JC KC LC MC NC OC PC QC RC SC","676":"E FC GC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","545":"bC cC","1537":"H"},J:{"2":"D","545":"A"},K:{"2":"A B C fB qB gB","1537":"U"},L:{"1537":"H"},M:{"2308":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"545":"I","1537":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"545":"pC"},R:{"1537":"qC"},S:{"932":"rC"}},B:5,C:"Intrinsic & Extrinsic Sizing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpeg2000.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpeg2000.js
new file mode 100644
index 0000000..df99894
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpeg2000.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","129":"j zB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"JPEG 2000 image format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpegxl.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpegxl.js
new file mode 100644
index 0000000..20033c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpegxl.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b","578":"c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a uB vB","322":"b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b","194":"c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB 7B 8B 9B AC fB qB BC gB","194":"dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"JPEG XL image format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpegxr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpegxr.js
new file mode 100644
index 0000000..7596427
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/jpegxr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O","2":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"1":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"JPEG XR image format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/js-regexp-lookbehind.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/js-regexp-lookbehind.js
new file mode 100644
index 0000000..22f51a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/js-regexp-lookbehind.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB uB vB"},D:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Lookbehind in JS regular expressions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/json.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/json.js
new file mode 100644
index 0000000..006321b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/json.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D sB","129":"E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"JSON parsing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/justify-content-space-evenly.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/justify-content-space-evenly.js
new file mode 100644
index 0000000..035446f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/justify-content-space-evenly.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G","132":"M N O"},C:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB"},D:{"1":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB","132":"MB NB iB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B","132":"nB"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","132":"9 AB BB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC","132":"KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"132":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC","132":"gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"132":"rC"}},B:5,C:"CSS justify-content: space-evenly"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/kerning-pairs-ligatures.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/kerning-pairs-ligatures.js
new file mode 100644
index 0000000..6ff5574
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/kerning-pairs-ligatures.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"XC YC ZC","132":"hB I aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:"High-quality kerning pairs & ligatures"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-charcode.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-charcode.js
new file mode 100644
index 0000000..ad18dd8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-charcode.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","16":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC","16":"C"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"U gB","2":"A B fB qB","16":"C"},L:{"1":"H"},M:{"130":"T"},N:{"130":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:"KeyboardEvent.charCode"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-code.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-code.js
new file mode 100644
index 0000000..1202f61
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-code.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","194":"7 8 9 AB BB CB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t 7B 8B 9B AC fB qB BC gB","194":"u v w x y z"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"194":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I","194":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"194":"qC"},S:{"1":"rC"}},B:5,C:"KeyboardEvent.code"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-getmodifierstate.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-getmodifierstate.js
new file mode 100644
index 0000000..00ef74d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-getmodifierstate.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B G M 7B 8B 9B AC fB qB BC","16":"C"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U gB","2":"A B fB qB","16":"C"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"KeyboardEvent.getModifierState()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-key.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-key.js
new file mode 100644
index 0000000..61e576c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-key.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","260":"F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n uB vB","132":"o p q r s t"},D:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"0 1 2 F B G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC","16":"C"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"1":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U gB","2":"A B fB qB","16":"C"},L:{"1":"H"},M:{"1":"T"},N:{"260":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:5,C:"KeyboardEvent.key"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-location.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-location.js
new file mode 100644
index 0000000..952d18b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-location.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L G M N O k l m n o p q r s t u"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"J yB mB","132":"I j zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC","16":"C","132":"G M"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB","132":"DC EC FC"},H:{"2":"WC"},I:{"1":"H bC cC","16":"XC YC","132":"hB I ZC aC rB"},J:{"132":"D A"},K:{"1":"U gB","2":"A B fB qB","16":"C"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"KeyboardEvent.location"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-which.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-which.js
new file mode 100644
index 0000000..84890e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/keyboardevent-which.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","16":"j"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","16":"F 7B"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB","16":"XC YC","132":"bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"132":"H"},M:{"132":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"2":"I","132":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"132":"qC"},S:{"1":"rC"}},B:7,C:"KeyboardEvent.which"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/lazyload.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/lazyload.js
new file mode 100644
index 0000000..32277e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/lazyload.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O","2":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"1":"B","2":"A"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Resource Hints: Lazyload"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/let.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/let.js
new file mode 100644
index 0000000..c4de018
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/let.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","2052":"B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","194":"0 1 2 3 4 5 6 7 8 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O","322":"0 1 2 3 4 5 k l m n o p q r s t u v w x y z","516":"6 7 8 9 AB BB CB DB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B","1028":"A nB"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","322":"G M N O k l m n o p q r s","516":"0 t u v w x y z"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC","1028":"JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","516":"I"},Q:{"1":"pC"},R:{"516":"qC"},S:{"1":"rC"}},B:6,C:"let"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-icon-png.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-icon-png.js
new file mode 100644
index 0000000..8a167de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-icon-png.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"NC OC PC QC RC SC TC UC VC oB pB","130":"E mB CC rB DC EC FC GC HC IC JC KC LC MC"},H:{"130":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D","130":"A"},K:{"1":"U","130":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"130":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"PNG favicons"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-icon-svg.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-icon-svg.js
new file mode 100644
index 0000000..61f7ab3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-icon-svg.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P","1537":"Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB uB vB","260":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","513":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","1537":"Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"9 AB BB CB DB EB FB GB HB IB","2":"0 1 2 3 4 5 6 7 8 F B C G M N O k l m n o p q r s t u v w x y z JB KB LB MB NB OB PB QB U RB SB 7B 8B 9B AC fB qB BC gB","1537":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"NC OC PC QC RC SC TC UC VC oB pB","130":"E mB CC rB DC EC FC GC HC IC JC KC LC MC"},H:{"130":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D","130":"A"},K:{"2":"U","130":"A B C fB qB gB"},L:{"1537":"H"},M:{"2":"T"},N:{"130":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC","1537":"lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"513":"rC"}},B:1,C:"SVG favicons"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-dns-prefetch.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-dns-prefetch.js
new file mode 100644
index 0000000..b055512
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-dns-prefetch.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E sB","132":"F"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB","260":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"16":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"16":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"16":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"16":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","16":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Resource Hints: dns-prefetch"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-modulepreload.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-modulepreload.js
new file mode 100644
index 0000000..51f0ccd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-modulepreload.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","2":"I eC fC gC hC"},Q:{"16":"pC"},R:{"16":"qC"},S:{"2":"rC"}},B:1,C:"Resource Hints: modulepreload"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-preconnect.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-preconnect.js
new file mode 100644
index 0000000..763c0e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-preconnect.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L","260":"G M N O"},C:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB","2":"0 1 2 3 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","129":"4"},D:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"16":"T"},N:{"2":"A B"},O:{"16":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Resource Hints: preconnect"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-prefetch.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-prefetch.js
new file mode 100644
index 0000000..10193d4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-prefetch.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D"},E:{"2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB","194":"L G 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC","194":"SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"I H bC cC","2":"hB XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Resource Hints: prefetch"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-preload.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-preload.js
new file mode 100644
index 0000000..42ffe28
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-preload.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M","1028":"N O"},C:{"1":"W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB uB vB","132":"LB","578":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V"},D:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","322":"B"},F:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC","322":"LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"Resource Hints: preload"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-prerender.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-prerender.js
new file mode 100644
index 0000000..9c49dc5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/link-rel-prerender.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"1":"B","2":"A"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"Resource Hints: prerender"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/loading-lazy-attr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/loading-lazy-attr.js
new file mode 100644
index 0000000..2672a43
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/loading-lazy-attr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB uB vB","132":"bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB","66":"bB cB"},E:{"2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB","322":"L G 3B 4B 5B oB","580":"pB 6B"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB 7B 8B 9B AC fB qB BC gB","66":"PB QB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC","322":"SC TC UC VC oB","580":"pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"132":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"kC lC mC nC oC","2":"I eC fC gC hC iC nB jC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"Lazy loading via attribute for images & iframes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/localecompare.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/localecompare.js
new file mode 100644
index 0000000..cca1d88
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/localecompare.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","16":"sB","132":"J D E F A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","132":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L G M N O k l m n o"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","132":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F B C 7B 8B 9B AC fB qB BC","132":"gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","132":"E mB CC rB DC EC FC GC HC IC"},H:{"132":"WC"},I:{"1":"H bC cC","132":"hB I XC YC ZC aC rB"},J:{"132":"D A"},K:{"1":"U","16":"A B C fB qB","132":"gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","132":"A"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","132":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"4":"rC"}},B:6,C:"localeCompare()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/magnetometer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/magnetometer.js
new file mode 100644
index 0000000..963a3aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/magnetometer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","194":"NB iB OB jB PB QB U RB SB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"194":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"Magnetometer"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/matchesselector.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/matchesselector.js
new file mode 100644
index 0000000..ab510d7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/matchesselector.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","36":"F A B"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","36":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB","36":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","36":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","36":"j J D zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B 7B 8B 9B AC fB","36":"C G M N O k l qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB","36":"CC rB DC EC FC"},H:{"2":"WC"},I:{"1":"H","2":"XC","36":"hB I YC ZC aC rB bC cC"},J:{"36":"D A"},K:{"1":"U","2":"A B","36":"C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"36":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","36":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"matches() DOM method"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/matchmedia.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/matchmedia.js
new file mode 100644
index 0000000..eda0b1d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/matchmedia.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B C 7B 8B 9B AC fB qB BC"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"1":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"matchMedia"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mathml.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mathml.js
new file mode 100644
index 0000000..4098512
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mathml.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"F A B sB","8":"J D E"},B:{"2":"C K L G M N O","8":"P Q R S V W X Y Z a b c d e f g T","584":"h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","129":"tB hB uB vB"},D:{"1":"p","8":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T","584":"h i H lB wB xB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","260":"I j J D E F yB mB zB 0B 1B 2B"},F:{"2":"F","4":"B C 7B 8B 9B AC fB qB BC gB","8":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB","584":"S"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","8":"mB CC rB"},H:{"8":"WC"},I:{"8":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"A","8":"D"},K:{"8":"A B C U fB qB gB"},L:{"8":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"4":"dC"},P:{"8":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"8":"pC"},R:{"8":"qC"},S:{"1":"rC"}},B:2,C:"MathML"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/maxlength.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/maxlength.js
new file mode 100644
index 0000000..e8875be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/maxlength.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","16":"sB","900":"J D E F"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","1025":"C K L G M N O"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","900":"tB hB uB vB","1025":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"j yB","900":"I mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F","132":"B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"CC rB DC EC FC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB","2052":"E GC"},H:{"132":"WC"},I:{"1":"hB I ZC aC rB bC cC","16":"XC YC","4097":"H"},J:{"1":"D A"},K:{"132":"A B C fB qB gB","4097":"U"},L:{"4097":"H"},M:{"4097":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"4097":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1025":"rC"}},B:1,C:"maxlength attribute for input and textarea elements"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-attribute.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-attribute.js
new file mode 100644
index 0000000..03c0ee9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-attribute.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O","16":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y","2":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H","16":"lB wB xB"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB"},F:{"1":"B C G M N O k l m n o p 8B 9B AC fB qB BC gB","2":"0 1 2 3 4 5 6 7 8 9 F q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"16":"WC"},I:{"1":"I H aC rB bC cC","16":"hB XC YC ZC"},J:{"16":"D A"},K:{"1":"C U gB","16":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"16":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Media attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-fragments.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-fragments.js
new file mode 100644
index 0000000..06b01ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-fragments.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","132":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y uB vB","132":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"I j J D E F A B C K L G M N","132":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j yB mB zB","132":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC rB DC EC FC","132":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","132":"H bC cC"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","132":"U"},L:{"132":"H"},M:{"132":"T"},N:{"132":"A B"},O:{"2":"dC"},P:{"2":"I eC","132":"fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"132":"rC"}},B:2,C:"Media Fragments"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-session-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-session-api.js
new file mode 100644
index 0000000..8d9b05e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/media-session-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB","16":"L G 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Media Session API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediacapture-fromelement.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediacapture-fromelement.js
new file mode 100644
index 0000000..9efd3be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediacapture-fromelement.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","260":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","324":"GB HB IB JB KB LB MB NB iB OB jB"},E:{"2":"I j J D E F A yB mB zB 0B 1B 2B nB","132":"B C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","324":"1 2 3 4 5 6 7 8 9 AB BB CB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"260":"T"},N:{"2":"A B"},O:{"132":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I","132":"eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"260":"rC"}},B:5,C:"Media Capture from DOM Elements API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediarecorder.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediarecorder.js
new file mode 100644
index 0000000..050d451
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediarecorder.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB","194":"CB DB"},E:{"1":"G 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB","322":"K L gB 3B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y 7B 8B 9B AC fB qB BC gB","194":"0 z"},G:{"1":"UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC","578":"NC OC PC QC RC SC TC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:5,C:"MediaRecorder API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediasource.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediasource.js
new file mode 100644
index 0000000..7e3bbcc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mediasource.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p uB vB","66":"0 1 2 3 4 5 6 q r s t u v w x y z"},D:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M","33":"o p q r s t u v","66":"N O k l m n"},E:{"1":"E F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC","260":"PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H cC","2":"hB I XC YC ZC aC rB bC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","2":"I eC fC gC hC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Media Source Extensions"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/menu.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/menu.js
new file mode 100644
index 0000000..16fb97f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/menu.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D uB vB","132":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V","450":"W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","66":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C G M N O k l m n o p q r s t u v w x y z CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","66":"0 1 2 3 4 5 6 7 8 9 AB BB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"450":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Context menu item (menuitem element)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/meta-theme-color.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/meta-theme-color.js
new file mode 100644
index 0000000..c32c6d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/meta-theme-color.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","132":"ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","258":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB"},E:{"1":"G 5B oB pB 6B","2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B 4B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"513":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I","16":"eC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"theme-color Meta Tag"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/meter.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/meter.js
new file mode 100644
index 0000000..c6bbb15
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/meter.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F 7B 8B 9B AC"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"meter element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/midi.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/midi.js
new file mode 100644
index 0000000..3cf5e8b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/midi.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"Web MIDI API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/minmaxwh.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/minmaxwh.js
new file mode 100644
index 0000000..f9a66ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/minmaxwh.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","8":"J sB","129":"D","257":"E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"CSS min/max-width/height"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mp3.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mp3.js
new file mode 100644
index 0000000..f09cd35
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mp3.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","132":"I j J D E F A B C K L G M N O k l m uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","2":"XC YC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"MP3 audio format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mpeg-dash.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mpeg-dash.js
new file mode 100644
index 0000000..9c3e714
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mpeg-dash.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O","2":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","386":"m n"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Dynamic Adaptive Streaming over HTTP (MPEG-DASH)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mpeg4.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mpeg4.js
new file mode 100644
index 0000000..c8f0605
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mpeg4.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l uB vB","4":"m n o p q r s t u v w x y z"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H bC cC","4":"hB I XC YC aC rB","132":"ZC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"260":"T"},N:{"1":"A B"},O:{"4":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"MPEG-4/H.264 video format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/multibackgrounds.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/multibackgrounds.js
new file mode 100644
index 0000000..353dc9d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/multibackgrounds.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 Multiple backgrounds"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/multicolumn.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/multicolumn.js
new file mode 100644
index 0000000..426e89b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/multicolumn.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O","516":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"132":"HB IB JB KB LB MB NB iB OB jB PB QB U","164":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB","516":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c","1028":"d e f g T h i H lB"},D:{"420":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB","516":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","132":"F 2B","164":"D E 1B","420":"I j J yB mB zB 0B"},F:{"1":"C fB qB BC gB","2":"F B 7B 8B 9B AC","420":"0 1 G M N O k l m n o p q r s t u v w x y z","516":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","132":"HC IC","164":"E FC GC","420":"mB CC rB DC EC"},H:{"1":"WC"},I:{"420":"hB I XC YC ZC aC rB bC cC","516":"H"},J:{"420":"D A"},K:{"1":"C fB qB gB","2":"A B","516":"U"},L:{"516":"H"},M:{"516":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","420":"I"},Q:{"132":"pC"},R:{"132":"qC"},S:{"164":"rC"}},B:4,C:"CSS3 Multiple column layout"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mutation-events.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mutation-events.js
new file mode 100644
index 0000000..70559f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mutation-events.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","260":"F A B"},B:{"132":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G M N O"},C:{"2":"tB hB I j uB vB","260":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"16":"I j J D E F A B C K L","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"16":"yB mB","132":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"C BC gB","2":"F 7B 8B 9B AC","16":"B fB qB","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"16":"mB CC","132":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"16":"XC YC","132":"hB I H ZC aC rB bC cC"},J:{"132":"D A"},K:{"1":"C gB","2":"A","16":"B fB qB","132":"U"},L:{"132":"H"},M:{"260":"T"},N:{"260":"A B"},O:{"132":"dC"},P:{"132":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"132":"pC"},R:{"132":"qC"},S:{"260":"rC"}},B:5,C:"Mutation events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mutationobserver.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mutationobserver.js
new file mode 100644
index 0000000..fc0cf01
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/mutationobserver.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E sB","8":"F A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N","33":"O k l m n o p q r"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","33":"J"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","33":"EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB XC YC ZC","8":"I aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","8":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Mutation Observer"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/namevalue-storage.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/namevalue-storage.js
new file mode 100644
index 0000000..4134c99
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/namevalue-storage.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","2":"sB","8":"J D"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","4":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Web Storage - name/value pairs"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/native-filesystem-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/native-filesystem-api.js
new file mode 100644
index 0000000..5fbebf7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/native-filesystem-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","194":"P Q R S V W","260":"X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB","194":"aB bB cB dB eB P Q R S V W","260":"X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B","4":"oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB 7B 8B 9B AC fB qB BC gB","194":"PB QB U RB SB TB UB VB WB XB","260":"YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC","4":"oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"File System Access API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/nav-timing.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/nav-timing.js
new file mode 100644
index 0000000..e6b235b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/nav-timing.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j","33":"J D E F A B C"},E:{"1":"E F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"I H aC rB bC cC","2":"hB XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Navigation Timing API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/navigator-language.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/navigator-language.js
new file mode 100644
index 0000000..cfc424b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/navigator-language.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G"},C:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w uB vB"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"16":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"16":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"16":"pC"},R:{"16":"qC"},S:{"1":"rC"}},B:2,C:"Navigator Language API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/netinfo.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/netinfo.js
new file mode 100644
index 0000000..f048c75
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/netinfo.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","1028":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB","1028":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB 7B 8B 9B AC fB qB BC gB","1028":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"XC bC cC","132":"hB I YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","132":"I","516":"eC fC gC"},Q:{"1":"pC"},R:{"516":"qC"},S:{"260":"rC"}},B:7,C:"Network Information API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/notifications.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/notifications.js
new file mode 100644
index 0000000..e10c307
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/notifications.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I","36":"j J D E F A B C K L G M N O k l m"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","36":"H bC cC"},J:{"1":"A","2":"D"},K:{"2":"A B C fB qB gB","36":"U"},L:{"513":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"36":"I","258":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"258":"qC"},S:{"1":"rC"}},B:1,C:"Web Notifications"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-entries.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-entries.js
new file mode 100644
index 0000000..737248e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-entries.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB"},D:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","16":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:6,C:"Object.entries"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-fit.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-fit.js
new file mode 100644
index 0000000..d9bf88a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-fit.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G","260":"M N O"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B","132":"E F 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F G M N O 7B 8B 9B","33":"B C AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC","132":"E GC HC IC"},H:{"33":"WC"},I:{"1":"H cC","2":"hB I XC YC ZC aC rB bC"},J:{"2":"D A"},K:{"1":"U","2":"A","33":"B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 object-fit/object-position"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-observe.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-observe.js
new file mode 100644
index 0000000..0bab084
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-observe.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 o p q r s t u v w x y z","2":"2 3 4 5 6 7 8 9 F B C G M N O k l m n AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"I","2":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:7,C:"Object.observe data binding"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-values.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-values.js
new file mode 100644
index 0000000..4e820a4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/object-values.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"8":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB"},D:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","8":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","8":"0 1 2 3 4 5 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","8":"E mB CC rB DC EC FC GC HC IC JC"},H:{"8":"WC"},I:{"1":"H","8":"hB I XC YC ZC aC rB bC cC"},J:{"8":"D A"},K:{"1":"U","8":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","8":"I eC"},Q:{"1":"pC"},R:{"8":"qC"},S:{"1":"rC"}},B:6,C:"Object.values method"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/objectrtc.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/objectrtc.js
new file mode 100644
index 0000000..c3d7381
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/objectrtc.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O","2":"C P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D","130":"A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Object RTC (ORTC) API for WebRTC"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/offline-apps.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/offline-apps.js
new file mode 100644
index 0000000..a5a987d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/offline-apps.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"F sB","8":"J D E"},B:{"1":"C K L G M N O P Q R S V","2":"W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S uB vB","2":"V W X Y Z a b c d e f g T h i H lB","4":"hB","8":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V","2":"W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB AC fB qB BC gB","2":"F ZB aB bB cB dB eB P Q R kB S 7B","8":"8B 9B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I XC YC ZC aC rB bC cC","2":"H"},J:{"1":"D A"},K:{"1":"B C fB qB gB","2":"A U"},L:{"2":"H"},M:{"2":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:"Offline web applications"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/offscreencanvas.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/offscreencanvas.js
new file mode 100644
index 0000000..878f0b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/offscreencanvas.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","194":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","322":"NB iB OB jB PB QB U RB SB TB UB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","322":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"194":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nB jC kC lC mC nC oC","2":"I eC fC gC hC iC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"194":"rC"}},B:1,C:"OffscreenCanvas"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ogg-vorbis.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ogg-vorbis.js
new file mode 100644
index 0000000..31acce9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ogg-vorbis.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B","132":"G 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"A","2":"D"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Ogg Vorbis audio format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ogv.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ogv.js
new file mode 100644
index 0000000..8f6c78b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ogv.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","8":"F A B"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","8":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"1":"T"},N:{"8":"A B"},O:{"1":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:6,C:"Ogg/Theora video format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ol-reversed.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ol-reversed.js
new file mode 100644
index 0000000..87e6d16
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ol-reversed.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G","16":"M N O k"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","16":"J"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC","16":"C"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Reversed attribute of ordered lists"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/once-event-listener.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/once-event-listener.js
new file mode 100644
index 0000000..01c80e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/once-event-listener.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G"},C:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB uB vB"},D:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"\"once\" event listener option"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/online-status.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/online-status.js
new file mode 100644
index 0000000..0741c46
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/online-status.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D sB","260":"E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB","516":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},D:{"1":"0 1 2 3 4 5 6 7 8 9 L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC","4":"gB"},G:{"1":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"A","132":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Online/offline status"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/opus.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/opus.js
new file mode 100644
index 0000000..6b3d184
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/opus.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x"},E:{"2":"I j J D E F A yB mB zB 0B 1B 2B nB","132":"B C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC","132":"LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Opus"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/orientation-sensor.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/orientation-sensor.js
new file mode 100644
index 0000000..794cb23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/orientation-sensor.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB","194":"NB iB OB jB PB QB U RB SB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"Orientation Sensor"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/outline.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/outline.js
new file mode 100644
index 0000000..74071c4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/outline.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D sB","260":"E","388":"F A B"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","388":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC","129":"gB","260":"F B 7B 8B 9B AC fB qB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"C U gB","260":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"388":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS outline properties"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pad-start-end.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pad-start-end.js
new file mode 100644
index 0000000..8251953
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pad-start-end.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L"},C:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB uB vB"},D:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:6,C:"String.prototype.padStart(), String.prototype.padEnd()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/page-transition-events.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/page-transition-events.js
new file mode 100644
index 0000000..802bcf7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/page-transition-events.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"PageTransitionEvent"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pagevisibility.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pagevisibility.js
new file mode 100644
index 0000000..0e63016
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pagevisibility.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F uB vB","33":"A B C K L G M N"},D:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K","33":"L G M N O k l m n o p q r s t u v w x"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B C 7B 8B 9B AC fB qB BC","33":"G M N O k"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB","33":"bC cC"},J:{"1":"A","2":"D"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","33":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Page Visibility"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/passive-event-listener.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/passive-event-listener.js
new file mode 100644
index 0000000..4252e7c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/passive-event-listener.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB uB vB"},D:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"Passive event listeners"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/passwordrules.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/passwordrules.js
new file mode 100644
index 0000000..e84bbc5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/passwordrules.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","16":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i uB vB","16":"H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H","16":"lB wB xB"},E:{"1":"C K gB","2":"I j J D E F A B yB mB zB 0B 1B 2B nB fB","16":"L G 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB 7B 8B 9B AC fB qB BC gB","16":"IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","16":"H"},J:{"2":"D","16":"A"},K:{"2":"A B C fB qB gB","16":"U"},L:{"16":"H"},M:{"16":"T"},N:{"2":"A","16":"B"},O:{"16":"dC"},P:{"2":"I eC fC","16":"gC hC iC nB jC kC lC mC nC oC"},Q:{"16":"pC"},R:{"16":"qC"},S:{"2":"rC"}},B:1,C:"Password Rules"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/path2d.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/path2d.js
new file mode 100644
index 0000000..85b69ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/path2d.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K","132":"L G M N O"},C:{"1":"DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v uB vB","132":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB"},D:{"1":"UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","132":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B","132":"E F 1B"},F:{"1":"KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n 7B 8B 9B AC fB qB BC gB","132":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC","16":"E","132":"GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"132":"dC"},P:{"1":"nB jC kC lC mC nC oC","132":"I eC fC gC hC iC"},Q:{"132":"pC"},R:{"132":"qC"},S:{"1":"rC"}},B:1,C:"Path2D"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/payment-request.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/payment-request.js
new file mode 100644
index 0000000..d852e99
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/payment-request.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K","322":"L","8196":"G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB uB vB","4162":"KB LB MB NB iB OB jB PB QB U RB","16452":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB","194":"IB JB KB LB MB NB","1090":"iB OB","8196":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B","514":"A B nB","8196":"C fB"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","194":"5 6 7 8 9 AB BB CB","8196":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB"},G:{"1":"OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC","514":"JC KC LC","8196":"MC NC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"2049":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"kC lC mC nC oC","2":"I","8196":"eC fC gC hC iC nB jC"},Q:{"8196":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"Payment Request API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pdf-viewer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pdf-viewer.js
new file mode 100644
index 0000000..09b69ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pdf-viewer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","16":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"16":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Built-in PDF viewer"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/permissions-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/permissions-api.js
new file mode 100644
index 0000000..71290d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/permissions-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB uB vB"},D:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:7,C:"Permissions API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/permissions-policy.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/permissions-policy.js
new file mode 100644
index 0000000..2f8130e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/permissions-policy.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","258":"P Q R S V W","322":"X Y","388":"Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB uB vB","258":"aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB","258":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W","322":"X Y","388":"Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B yB mB zB 0B 1B 2B nB","258":"C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB 7B 8B 9B AC fB qB BC gB","258":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB","322":"YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC","258":"MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","258":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","258":"U"},L:{"388":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC","258":"hC iC nB jC kC lC mC nC oC"},Q:{"258":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Permissions Policy"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/picture-in-picture.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/picture-in-picture.js
new file mode 100644
index 0000000..269a4c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/picture-in-picture.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB uB vB","132":"YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","1090":"TB","1412":"XB","1668":"UB VB WB"},D:{"1":"WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB","2114":"VB"},E:{"1":"L G 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B","4100":"A B C K nB fB gB"},F:{"1":"ZB aB bB cB dB eB P Q R kB S","2":"0 1 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","8196":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB"},G:{"1":"TC UC VC oB pB","2":"E mB CC rB DC EC FC GC","4100":"HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"16388":"H"},M:{"16388":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Picture-in-Picture"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/picture.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/picture.js
new file mode 100644
index 0000000..b5eb2a8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/picture.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y uB vB","578":"0 1 2 z"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","194":"2"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB","322":"p"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Picture element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ping.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ping.js
new file mode 100644
index 0000000..09447d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ping.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"2":"tB","194":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"194":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"194":"rC"}},B:1,C:"Ping attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/png-alpha.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/png-alpha.js
new file mode 100644
index 0000000..90cd276
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/png-alpha.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"D E F A B","2":"sB","8":"J"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"PNG alpha transparency"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointer-events.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointer-events.js
new file mode 100644
index 0000000..bd4f533
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointer-events.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:"CSS pointer-events (for HTML)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointer.js
new file mode 100644
index 0000000..c0464dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F sB","164":"A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB","8":"0 1 2 3 4 5 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","328":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},D:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m","8":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB","584":"HB IB JB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J yB mB zB","8":"D E F A B C 0B 1B 2B nB fB","1096":"gB"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","8":"0 1 2 3 G M N O k l m n o p q r s t u v w x y z","584":"4 5 6"},G:{"1":"QC RC SC TC UC VC oB pB","8":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC","6148":"PC"},H:{"2":"WC"},I:{"1":"H","8":"hB I XC YC ZC aC rB bC cC"},J:{"8":"D A"},K:{"1":"U","2":"A","8":"B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","36":"A"},O:{"8":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"eC","8":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"328":"rC"}},B:2,C:"Pointer events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointerlock.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointerlock.js
new file mode 100644
index 0000000..f0f9c85
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/pointerlock.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C"},C:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K uB vB","33":"0 1 2 3 4 5 L G M N O k l m n o p q r s t u v w x y z"},D:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G","33":"0 1 n o p q r s t u v w x y z","66":"M N O k l m"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"G M N O k l m n o"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:2,C:"Pointer Lock API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/portals.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/portals.js
new file mode 100644
index 0000000..b20be3c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/portals.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V","322":"b c d e f g T h i H","450":"W X Y Z a"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB","194":"bB cB dB eB P Q R S V","322":"X Y Z a b c d e f g T h i H lB wB xB","450":"W"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB 7B 8B 9B AC fB qB BC gB","194":"PB QB U RB SB TB UB VB WB XB YB","322":"ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"450":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Portals"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/prefers-color-scheme.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/prefers-color-scheme.js
new file mode 100644
index 0000000..9b9b634
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/prefers-color-scheme.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB uB vB"},D:{"1":"cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB"},F:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB 7B 8B 9B AC fB qB BC gB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"kC lC mC nC oC","2":"I eC fC gC hC iC nB jC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"prefers-color-scheme media query"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/prefers-reduced-motion.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/prefers-reduced-motion.js
new file mode 100644
index 0000000..80b38f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/prefers-reduced-motion.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB uB vB"},D:{"1":"aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"jC kC lC mC nC oC","2":"I eC fC gC hC iC nB"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"prefers-reduced-motion media query"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/private-class-fields.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/private-class-fields.js
new file mode 100644
index 0000000..a2df3d2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/private-class-fields.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB"},E:{"1":"G 4B 5B oB pB 6B","2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B"},F:{"1":"PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB 7B 8B 9B AC fB qB BC gB"},G:{"1":"UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"jC kC lC mC nC oC","2":"I eC fC gC hC iC nB"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Private class fields"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/private-methods-and-accessors.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/private-methods-and-accessors.js
new file mode 100644
index 0000000..6e029e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/private-methods-and-accessors.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"V W X Y Z a b c d e f g T h i H","2":"C K L G M N O P Q R S"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S"},E:{"1":"G 4B 5B oB pB 6B","2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B"},F:{"1":"WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB 7B 8B 9B AC fB qB BC gB"},G:{"1":"UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Public class fields"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/progress.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/progress.js
new file mode 100644
index 0000000..84457bc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/progress.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F 7B 8B 9B AC"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC","132":"FC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"progress element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/promise-finally.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/promise-finally.js
new file mode 100644
index 0000000..29e6565
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/promise-finally.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N"},C:{"1":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB uB vB"},D:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Promise.prototype.finally"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/promises.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/promises.js
new file mode 100644
index 0000000..637c0c4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/promises.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"8":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","4":"s t","8":"tB hB I j J D E F A B C K L G M N O k l m n o p q r uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"x","8":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"I j J D yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","4":"k","8":"F B C G M N O 7B 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","8":"mB CC rB DC EC FC"},H:{"8":"WC"},I:{"1":"H cC","8":"hB I XC YC ZC aC rB bC"},J:{"8":"D A"},K:{"1":"U","8":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Promises"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/proximity.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/proximity.js
new file mode 100644
index 0000000..5b36c62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/proximity.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:4,C:"Proximity API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/proxy.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/proxy.js
new file mode 100644
index 0000000..dce80d7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/proxy.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"3 4 5 6 7 8 9 I j J D E F A B C K L G M N O AB BB CB DB","66":"0 1 2 k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","66":"G M N O k l m n o p"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:6,C:"Proxy object"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/public-class-fields.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/public-class-fields.js
new file mode 100644
index 0000000..3c3eb58
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/public-class-fields.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB uB vB","4":"WB XB YB ZB aB","132":"VB"},D:{"1":"YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB"},E:{"1":"G 4B 5B oB pB 6B","2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB 3B","260":"L"},F:{"1":"OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB 7B 8B 9B AC fB qB BC gB"},G:{"1":"TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"jC kC lC mC nC oC","2":"I eC fC gC hC iC nB"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Public class fields"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/publickeypinning.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/publickeypinning.js
new file mode 100644
index 0000000..116c937
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/publickeypinning.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB","2":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB","2":"F B C G M N O k SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","4":"o","16":"l m n p"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB","2":"jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"HTTP Public Key Pinning"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/push-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/push-api.js
new file mode 100644
index 0000000..d2e121e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/push-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O","2":"C K L G M","257":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","257":"9 BB CB DB EB FB GB IB JB KB LB MB NB iB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","1281":"AB HB OB"},D:{"2":"0 1 2 3 4 5 6 7 8 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","257":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","388":"9 AB BB CB DB EB"},E:{"2":"I j J D E F yB mB zB 0B 1B","514":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB","2114":"6B"},F:{"2":"0 1 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","16":"2 3 4 5 6","257":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"257":"rC"}},B:5,C:"Push API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/queryselector.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/queryselector.js
new file mode 100644
index 0000000..1ddb5d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/queryselector.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"sB","8":"J D","132":"E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","8":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","8":"F 7B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"querySelector/querySelectorAll"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/readonly-attr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/readonly-attr.js
new file mode 100644
index 0000000..08fee25
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/readonly-attr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","16":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L G M N O k l m n o p q"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F 7B","132":"B C 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB DC EC"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"U","132":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"257":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"readonly attribute of input and textarea elements"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/referrer-policy.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/referrer-policy.js
new file mode 100644
index 0000000..6c872a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/referrer-policy.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"1":"P Q R S","132":"C K L G M N O","513":"V W X Y Z a b c d e f g T h i H"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X","2":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","513":"Y Z a b c d e f g T h i H lB"},D:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V","2":"I j J D E F A B C K L G M N O k l","260":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB","513":"W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"C fB gB","2":"I j J D yB mB zB 0B","132":"E F A B 1B 2B nB","1025":"K L G 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB","2":"F B C 7B 8B 9B AC fB qB BC gB","513":"ZB aB bB cB dB eB P Q R kB S"},G:{"1":"NC OC PC QC","2":"mB CC rB DC EC FC","132":"E GC HC IC JC KC LC MC","1025":"RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"513":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Referrer Policy"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/registerprotocolhandler.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/registerprotocolhandler.js
new file mode 100644
index 0000000..9f23f96
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/registerprotocolhandler.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","129":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB"},D:{"2":"I j J D E F A B C","129":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B 7B 8B 9B AC fB qB","129":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D","129":"A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"Custom protocol handling"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rel-noopener.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rel-noopener.js
new file mode 100644
index 0000000..5b62337
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rel-noopener.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:1,C:"rel=noopener"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rel-noreferrer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rel-noreferrer.js
new file mode 100644
index 0000000..8c1ea1e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rel-noreferrer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","132":"B"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","16":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L G"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Link type \"noreferrer\""};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rellist.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rellist.js
new file mode 100644
index 0000000..d5d8b60
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rellist.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M","132":"N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u uB vB"},D:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB","132":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E yB mB zB 0B 1B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","132":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"132":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","2":"I","132":"eC fC gC hC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:1,C:"relList (DOMTokenList)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rem.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rem.js
new file mode 100644
index 0000000..4861c22
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rem.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E sB","132":"F A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB"},G:{"1":"E CC rB EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB","260":"DC"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"C U gB","2":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"rem (root em) units"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/requestanimationframe.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/requestanimationframe.js
new file mode 100644
index 0000000..53509bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/requestanimationframe.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","33":"B C K L G M N O k l m n","164":"I j J D E F A"},D:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F","33":"n o","164":"O k l m","420":"A B C K L G M N"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","33":"J"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","33":"EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"requestAnimationFrame"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/requestidlecallback.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/requestidlecallback.js
new file mode 100644
index 0000000..25c2ff0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/requestidlecallback.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB","194":"IB JB"},D:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB"},E:{"2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB","322":"L G 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w x y 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC","322":"SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"requestIdleCallback"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/resizeobserver.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/resizeobserver.js
new file mode 100644
index 0000000..c64cfcb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/resizeobserver.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB uB vB"},D:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB","194":"JB KB LB MB NB iB OB jB PB QB"},E:{"1":"L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB gB","66":"K"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","194":"6 7 8 9 AB BB CB DB EB FB GB"},G:{"1":"SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"iC nB jC kC lC mC nC oC","2":"I eC fC gC hC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Resize Observer"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/resource-timing.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/resource-timing.js
new file mode 100644
index 0000000..3c574b1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/resource-timing.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v uB vB","194":"w x y z"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","260":"B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Resource Timing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rest-parameters.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rest-parameters.js
new file mode 100644
index 0000000..da0fd96
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rest-parameters.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","194":"9 AB BB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v 7B 8B 9B AC fB qB BC gB","194":"w x y"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Rest parameters"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rtcpeerconnection.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rtcpeerconnection.js
new file mode 100644
index 0000000..0d029a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/rtcpeerconnection.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L","516":"G M N O"},C:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m uB vB","33":"0 1 2 3 4 5 6 7 8 n o p q r s t u v w x y z"},D:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n","33":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 O k l m n o p q r s t u v w x y z"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","130":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"33":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"33":"qC"},S:{"1":"rC"}},B:5,C:"WebRTC Peer-to-peer connections"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ruby.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ruby.js
new file mode 100644
index 0000000..4e47a07
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ruby.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"4":"J D E F A B sB"},B:{"4":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"0 1 2 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"4":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"I"},E:{"4":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"I yB mB"},F:{"4":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","8":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"4":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","8":"mB CC rB"},H:{"8":"WC"},I:{"4":"hB I H aC rB bC cC","8":"XC YC ZC"},J:{"4":"A","8":"D"},K:{"4":"U","8":"A B C fB qB gB"},L:{"4":"H"},M:{"1":"T"},N:{"4":"A B"},O:{"4":"dC"},P:{"4":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"4":"pC"},R:{"4":"qC"},S:{"1":"rC"}},B:1,C:"Ruby annotation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/run-in.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/run-in.js
new file mode 100644
index 0000000..3c5c609
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/run-in.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","2":"J D sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w","2":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J zB","2":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"0B","129":"I yB mB"},F:{"1":"F B C G M N O 7B 8B 9B AC fB qB BC gB","2":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"CC rB DC EC FC","2":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","129":"mB"},H:{"1":"WC"},I:{"1":"hB I XC YC ZC aC rB bC","2":"H cC"},J:{"1":"D A"},K:{"1":"A B C fB qB gB","2":"U"},L:{"2":"H"},M:{"2":"T"},N:{"1":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"display: run-in"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/same-site-cookie-attribute.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/same-site-cookie-attribute.js
new file mode 100644
index 0000000..db0f4bf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/same-site-cookie-attribute.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","388":"B"},B:{"1":"O P Q R S V W","2":"C K L G","129":"M N","513":"X Y Z a b c d e f g T h i H"},C:{"1":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB uB vB"},D:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","513":"Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"G 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB fB","2052":"L","3076":"C K gB 3B"},F:{"1":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB","2":"0 1 2 3 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","513":"XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC","2052":"NC OC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"513":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"16":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:6,C:"'SameSite' cookie attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/screen-orientation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/screen-orientation.js
new file mode 100644
index 0000000..f9c8221
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/screen-orientation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","164":"B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","36":"C K L G M N O"},C:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N uB vB","36":"0 1 2 3 4 5 6 7 8 O k l m n o p q r s t u v w x y z"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A","36":"B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","16":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"Screen Orientation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/script-async.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/script-async.js
new file mode 100644
index 0000000..c86be8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/script-async.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","132":"j"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"async attribute for external scripts"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/script-defer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/script-defer.js
new file mode 100644
index 0000000..d8d5006
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/script-defer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","132":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","257":"I j J D E F A B C K L G M N O k l m n o p q r s t u v uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"defer attribute for external scripts"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/scrollintoview.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/scrollintoview.js
new file mode 100644
index 0000000..c58416b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/scrollintoview.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D sB","132":"E F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","132":"C K L G M N O"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","132":"0 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB"},E:{"1":"6B","2":"I j yB mB","132":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F 7B 8B 9B AC","16":"B fB qB","132":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB BC gB"},G:{"16":"mB CC rB","132":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","16":"XC YC","132":"hB I ZC aC rB bC cC"},J:{"132":"D A"},K:{"1":"U","132":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"132":"dC"},P:{"132":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"132":"qC"},S:{"1":"rC"}},B:5,C:"scrollIntoView"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/scrollintoviewifneeded.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/scrollintoviewifneeded.js
new file mode 100644
index 0000000..f168bae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/scrollintoviewifneeded.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:7,C:"Element.scrollIntoViewIfNeeded()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sdch.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sdch.js
new file mode 100644
index 0000000..93faccb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sdch.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB","2":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB","2":"F B C ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"SDCH Accept-Encoding/Content-Encoding"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/selection-api.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/selection-api.js
new file mode 100644
index 0000000..0072dd5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/selection-api.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","16":"sB","260":"J D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","132":"0 1 2 3 4 5 6 7 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","2180":"8 9 AB BB CB DB EB FB GB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","132":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"16":"rB","132":"mB CC","516":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H bC cC","16":"hB I XC YC ZC aC","1025":"rB"},J:{"1":"A","16":"D"},K:{"1":"U","16":"A B C fB qB","132":"gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","16":"A"},O:{"1025":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2180":"rC"}},B:5,C:"Selection API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/server-timing.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/server-timing.js
new file mode 100644
index 0000000..bdd04b4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/server-timing.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB uB vB"},D:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB","196":"OB jB PB QB","324":"U"},E:{"2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB","516":"K L G gB 3B 4B 5B oB pB 6B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Server Timing"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/serviceworkers.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/serviceworkers.js
new file mode 100644
index 0000000..8ae5bdd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/serviceworkers.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L","322":"G M"},C:{"1":"9 BB CB DB EB FB GB IB JB KB LB MB NB iB jB PB QB U RB SB TB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB","194":"0 1 2 3 4 5 6 7 8 y z","513":"AB HB OB UB"},D:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","4":"5 6 7 8 9"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B yB mB zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r 7B 8B 9B AC fB qB BC gB","4":"s t u v w"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","4":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","4":"U"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"4":"qC"},S:{"2":"rC"}},B:4,C:"Service Workers"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/setimmediate.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/setimmediate.js
new file mode 100644
index 0000000..48d46a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/setimmediate.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O","2":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"1":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Efficient Script Yielding: setImmediate()"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sha-2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sha-2.js
new file mode 100644
index 0000000..695ab71
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sha-2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","2":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"1":"hB I H YC ZC aC rB bC cC","260":"XC"},J:{"1":"D A"},K:{"1":"U","16":"A B C fB qB gB"},L:{"1":"H"},M:{"16":"T"},N:{"16":"A B"},O:{"16":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","16":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"SHA-2 SSL certificates"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/shadowdom.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/shadowdom.js
new file mode 100644
index 0000000..b330e7c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/shadowdom.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P","2":"C K L G M N O Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","66":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","2":"I j J D E F A B C K L G M N O k l m n o p Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"q r s t u v w x y z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB","2":"F B C TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","33":"G M N O k l m"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB","33":"bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC","2":"lC mC nC oC","33":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:7,C:"Shadow DOM (deprecated V0 spec)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/shadowdomv1.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/shadowdomv1.js
new file mode 100644
index 0000000..af54438
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/shadowdomv1.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB uB vB","322":"NB","578":"iB OB jB PB"},D:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB"},E:{"1":"A B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC","132":"JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I","4":"eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Shadow DOM (V1)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sharedarraybuffer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sharedarraybuffer.js
new file mode 100644
index 0000000..66601e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sharedarraybuffer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b","2":"C K L G","194":"M N O","513":"c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB uB vB","194":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB","450":"aB bB cB dB eB","513":"P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB","194":"OB jB PB QB U RB SB TB","513":"c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A yB mB zB 0B 1B 2B","194":"B C K L G nB fB gB 3B 4B 5B","513":"oB pB 6B"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB 7B 8B 9B AC fB qB BC gB","194":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC","194":"KC LC MC NC OC PC QC RC SC TC UC VC","513":"oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"513":"H"},M:{"513":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Shared Array Buffer"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sharedworkers.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sharedworkers.js
new file mode 100644
index 0000000..53fd294
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sharedworkers.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"j J zB","2":"I D E F A B C K L G yB mB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","2":"F 7B 8B 9B"},G:{"1":"DC EC","2":"E mB CC rB FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"B C fB qB gB","2":"U","16":"A"},L:{"2":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"I","2":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:1,C:"Shared Web Workers"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sni.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sni.js
new file mode 100644
index 0000000..b8aa594
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sni.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J sB","132":"D E"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB"},H:{"1":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Server Name Indication"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/spdy.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/spdy.js
new file mode 100644
index 0000000..d87edb8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/spdy.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F A sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","2":"tB hB I j J D E F A B C GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","2":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"E F A B C 2B nB fB","2":"I j J D yB mB zB 0B 1B","129":"K L G gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 7 9 G M N O k l m n o p q r s t u v w x y z gB","2":"5 6 8 F B C AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC"},G:{"1":"E GC HC IC JC KC LC MC NC","2":"mB CC rB DC EC FC","257":"OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I aC rB bC cC","2":"H XC YC ZC"},J:{"2":"D A"},K:{"1":"gB","2":"A B C U fB qB"},L:{"2":"H"},M:{"2":"T"},N:{"1":"B","2":"A"},O:{"2":"dC"},P:{"1":"I","2":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"16":"qC"},S:{"1":"rC"}},B:7,C:"SPDY protocol"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/speech-recognition.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/speech-recognition.js
new file mode 100644
index 0000000..f5bd1d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/speech-recognition.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","1026":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m uB vB","322":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"I j J D E F A B C K L G M N O k l m n o p","164":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L yB mB zB 0B 1B 2B nB fB gB 3B","2084":"G 4B 5B oB pB 6B"},F:{"2":"F B C G M N O k l m n o p q r 7B 8B 9B AC fB qB BC gB","1026":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC","2084":"UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"164":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"164":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"164":"pC"},R:{"164":"qC"},S:{"322":"rC"}},B:7,C:"Speech Recognition API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/speech-synthesis.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/speech-synthesis.js
new file mode 100644
index 0000000..6a8e44b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/speech-synthesis.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O","2":"C K","257":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v uB vB","194":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x","257":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","2":"F B C G M N O k l m n o p q r 7B 8B 9B AC fB qB BC gB","257":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:7,C:"Speech Synthesis API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/spellcheck-attribute.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/spellcheck-attribute.js
new file mode 100644
index 0000000..9498e27
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/spellcheck-attribute.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"4":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"4":"WC"},I:{"4":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"A","4":"D"},K:{"4":"A B C U fB qB gB"},L:{"4":"H"},M:{"4":"T"},N:{"4":"A B"},O:{"4":"dC"},P:{"4":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"4":"qC"},S:{"2":"rC"}},B:1,C:"Spellcheck attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sql-storage.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sql-storage.js
new file mode 100644
index 0000000..3dd237e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sql-storage.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB gB","2":"K L G 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC","2":"PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:7,C:"Web SQL Database"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/srcset.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/srcset.js
new file mode 100644
index 0000000..01b4489
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/srcset.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","260":"C","514":"K L G"},C:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w uB vB","194":"0 1 2 x y z"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y","260":"0 1 2 z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB 0B","260":"E 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l 7B 8B 9B AC fB qB BC gB","260":"m n o p"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC","260":"E GC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Srcset and sizes attributes"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/stream.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/stream.js
new file mode 100644
index 0000000..900dfe7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/stream.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M uB vB","129":"1 2 3 4 5 6","420":"0 N O k l m n o p q r s t u v w x y z"},D:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l","420":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B G M N 7B 8B 9B AC fB qB BC","420":"0 1 2 3 4 C O k l m n o p q r s t u v w x y z gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC","513":"SC TC UC VC oB pB","1537":"LC MC NC OC PC QC RC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","420":"A"},K:{"1":"U","2":"A B fB qB","420":"C gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","420":"I eC"},Q:{"1":"pC"},R:{"420":"qC"},S:{"2":"rC"}},B:4,C:"getUserMedia/Stream API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/streams.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/streams.js
new file mode 100644
index 0000000..1fe40d2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/streams.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","130":"B"},B:{"1":"a b c d e f g T h i H","16":"C K","260":"L G","1028":"P Q R S V W X Y Z","5124":"M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB uB vB","6148":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","6722":"MB NB iB OB jB PB QB U"},D:{"1":"a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB","260":"HB IB JB KB LB MB NB","1028":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z"},E:{"2":"I j J D E F yB mB zB 0B 1B 2B","1028":"G 4B 5B oB pB 6B","3076":"A B C K L nB fB gB 3B"},F:{"1":"cB dB eB P Q R kB S","2":"0 1 2 3 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","260":"4 5 6 7 8 9 AB","1028":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB"},G:{"2":"E mB CC rB DC EC FC GC HC IC","16":"JC","1028":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"6148":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nC oC","2":"I eC fC","1028":"gC hC iC nB jC kC lC mC"},Q:{"1028":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"Streams"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/stricttransportsecurity.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/stricttransportsecurity.js
new file mode 100644
index 0000000..21ac3a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/stricttransportsecurity.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A sB","129":"B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Strict Transport Security"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/style-scoped.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/style-scoped.js
new file mode 100644
index 0000000..0680658
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/style-scoped.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB","2":"tB hB I j J D E F A B C K L G M N O k l jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","322":"KB LB MB NB iB OB"},D:{"2":"2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","194":"0 1 l m n o p q r s t u v w x y z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:7,C:"Scoped CSS"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/subresource-integrity.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/subresource-integrity.js
new file mode 100644
index 0000000..847a699
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/subresource-integrity.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u v w 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC","194":"LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Subresource Integrity"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-css.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-css.js
new file mode 100644
index 0000000..1a04b44
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-css.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","516":"C K L G"},C:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","260":"I j J D E F A B C K L G M N O k l m n o"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"I"},E:{"1":"j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB","132":"I mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","132":"mB CC"},H:{"260":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"U","260":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"SVG in CSS backgrounds"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-filters.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-filters.js
new file mode 100644
index 0000000..3b1053c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-filters.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I","4":"j J D"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"SVG filters"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-fonts.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-fonts.js
new file mode 100644
index 0000000..da73bbe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-fonts.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"F A B sB","8":"J D E"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","2":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","130":"3 4 5 6 7 8 9 AB BB CB DB EB FB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB"},F:{"1":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB","2":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","130":"0 1 q r s t u v w x y z"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"258":"WC"},I:{"1":"hB I aC rB bC cC","2":"H XC YC ZC"},J:{"1":"D A"},K:{"1":"A B C fB qB gB","2":"U"},L:{"130":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"I","130":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"130":"qC"},S:{"2":"rC"}},B:2,C:"SVG fonts"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-fragment.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-fragment.js
new file mode 100644
index 0000000..7c20446
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-fragment.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","260":"F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","132":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB"},E:{"1":"C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D F A B yB mB zB 0B 2B nB","132":"E 1B"},F:{"1":"2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"G M N O k l m n","4":"B C 8B 9B AC fB qB BC","16":"F 7B","132":"0 1 o p q r s t u v w x y z"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC HC IC JC KC LC","132":"E GC"},H:{"1":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D","132":"A"},K:{"1":"U gB","4":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","132":"I"},Q:{"1":"pC"},R:{"132":"qC"},S:{"1":"rC"}},B:4,C:"SVG fragment identifiers"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-html.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-html.js
new file mode 100644
index 0000000..f3a2043
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-html.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","388":"F A B"},B:{"4":"P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB","4":"hB"},D:{"4":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"yB mB","4":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"4":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"4":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB","4":"H bC cC"},J:{"1":"A","2":"D"},K:{"4":"A B C U fB qB gB"},L:{"4":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"4":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"4":"pC"},R:{"4":"qC"},S:{"1":"rC"}},B:2,C:"SVG effects for HTML"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-html5.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-html5.js
new file mode 100644
index 0000000..3bf940d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-html5.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E","129":"F A B"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","129":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","8":"I j J"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","8":"I j yB mB","129":"J D E zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"B AC fB qB","8":"F 7B 8B 9B"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","8":"mB CC rB","129":"E DC EC FC GC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"XC YC ZC","129":"hB I aC rB"},J:{"1":"A","129":"D"},K:{"1":"C U gB","8":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"129":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Inline SVG in HTML5"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-img.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-img.js
new file mode 100644
index 0000000..a47cd2d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-img.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L G M N O k l m n o p q r s"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB","4":"mB","132":"I j J D E zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","132":"E mB CC rB DC EC FC GC"},H:{"1":"WC"},I:{"1":"H bC cC","2":"XC YC ZC","132":"hB I aC rB"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"SVG in HTML img element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-smil.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-smil.js
new file mode 100644
index 0000000..9c7af42
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg-smil.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","8":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"I"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"yB mB","132":"I j zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","132":"mB CC rB DC"},H:{"2":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"SVG SMIL animation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg.js
new file mode 100644
index 0000000..3ca5a9e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/svg.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E","772":"F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","513":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","4":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","4":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"H bC cC","2":"XC YC ZC","132":"hB I aC rB"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"257":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"SVG (basic support)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sxg.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sxg.js
new file mode 100644
index 0000000..1925d11
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/sxg.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB","132":"XB YB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"16":"dC"},P:{"1":"jC kC lC mC nC oC","2":"I eC fC gC hC iC nB"},Q:{"16":"pC"},R:{"16":"qC"},S:{"2":"rC"}},B:6,C:"Signed HTTP Exchanges (SXG)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tabindex-attr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tabindex-attr.js
new file mode 100644
index 0000000..1346e85
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tabindex-attr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"D E F A B","16":"J sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"16":"tB hB uB vB","129":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"16":"I j yB mB","257":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","16":"F"},G:{"769":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"16":"hB I H XC YC ZC aC rB bC cC"},J:{"16":"D A"},K:{"16":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"16":"A B"},O:{"16":"dC"},P:{"16":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"16":"qC"},S:{"129":"rC"}},B:1,C:"tabindex global attribute"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/template-literals.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/template-literals.js
new file mode 100644
index 0000000..194df58
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/template-literals.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"K L G M N O P Q R S V W X Y Z a b c d e f g T h i H","16":"C"},C:{"1":"0 1 2 3 4 5 6 7 8 9 z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y uB vB"},D:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B","129":"C"},F:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t 7B 8B 9B AC fB qB BC gB"},G:{"1":"HC IC JC KC LC MC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC","129":"NC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"ES6 Template Literals (Template Strings)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/template.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/template.js
new file mode 100644
index 0000000..0b9bb7b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/template.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C","388":"K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q","132":"r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D yB mB zB","388":"E 1B","514":"0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","132":"G M N O k l m"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC","388":"E GC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"HTML templates"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/temporal.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/temporal.js
new file mode 100644
index 0000000..818328d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/temporal.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"Temporal"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/testfeat.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/testfeat.js
new file mode 100644
index 0000000..3b6dd81
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/testfeat.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E A B sB","16":"F"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","16":"I j"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"B C"},E:{"2":"I J yB mB zB","16":"j D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC qB BC gB","16":"fB"},G:{"2":"mB CC rB DC EC","16":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC aC rB bC cC","16":"ZC"},J:{"2":"A","16":"D"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Test feature - updated"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-decoration.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-decoration.js
new file mode 100644
index 0000000..213953c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-decoration.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","2052":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j uB vB","1028":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","1060":"0 J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},D:{"2":"I j J D E F A B C K L G M N O k l m n o p q","226":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB","2052":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D yB mB zB 0B","772":"K L G gB 3B 4B 5B oB pB 6B","804":"E F A B C 2B nB fB","1316":"1B"},F:{"2":"F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","226":"0 1 2 3 4 5 6 7 8","2052":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"mB CC rB DC EC FC","292":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"2052":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2052":"dC"},P:{"2":"I eC fC","2052":"gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"1":"qC"},S:{"1028":"rC"}},B:4,C:"text-decoration styling"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-emphasis.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-emphasis.js
new file mode 100644
index 0000000..33df28b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-emphasis.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"H","2":"C K L G M N O","164":"P Q R S V W X Y Z a b c d e f g T h i"},C:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB","322":"AB"},D:{"1":"H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p","164":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB","164":"D 0B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","164":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB","164":"bC cC"},J:{"2":"D","164":"A"},K:{"2":"A B C fB qB gB","164":"U"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"164":"dC"},P:{"164":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"164":"pC"},R:{"164":"qC"},S:{"1":"rC"}},B:4,C:"text-emphasis styling"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-overflow.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-overflow.js
new file mode 100644
index 0000000..e15a368
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-overflow.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B","2":"sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","8":"tB hB I j J uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","33":"F 7B 8B 9B AC"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"U gB","33":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 Text-overflow"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-size-adjust.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-size-adjust.js
new file mode 100644
index 0000000..57961e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-size-adjust.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","33":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q s t u v w x y z AB BB CB DB EB FB GB HB IB","258":"r"},E:{"2":"I j J D E F A B C K L G yB mB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","258":"zB"},F:{"1":"8 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 9 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"2":"mB CC rB","33":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"33":"T"},N:{"161":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"CSS text-size-adjust"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-stroke.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-stroke.js
new file mode 100644
index 0000000..bf219c0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-stroke.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L","33":"P Q R S V W X Y Z a b c d e f g T h i H","161":"G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB uB vB","161":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","450":"DB"},D:{"33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"33":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"33":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","36":"mB"},H:{"2":"WC"},I:{"2":"hB","33":"I H XC YC ZC aC rB bC cC"},J:{"33":"D A"},K:{"2":"A B C fB qB gB","33":"U"},L:{"33":"H"},M:{"161":"T"},N:{"2":"A B"},O:{"33":"dC"},P:{"33":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"33":"pC"},R:{"33":"qC"},S:{"161":"rC"}},B:7,C:"CSS text-stroke and text-fill"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-underline-offset.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-underline-offset.js
new file mode 100644
index 0000000..ed376cd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/text-underline-offset.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB uB vB","130":"VB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"text-underline-offset"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/textcontent.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/textcontent.js
new file mode 100644
index 0000000..e5991cb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/textcontent.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","16":"F"},G:{"1":"E CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Node.textContent"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/textencoder.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/textencoder.js
new file mode 100644
index 0000000..5f178e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/textencoder.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O uB vB","132":"k"},D:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"TextEncoder & TextDecoder"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-1.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-1.js
new file mode 100644
index 0000000..79f80ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-1.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D sB","66":"E F A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB","2":"tB hB I j J D E F A B C K L G M N O k l m n uB vB","66":"o","129":"UB VB WB XB YB ZB aB bB cB dB","388":"eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V","2":"I j J D E F A B C K L G M N O k l m","1540":"W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"D E F A B C K 1B 2B nB fB gB","2":"I j J yB mB zB 0B","513":"L G 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB gB","2":"F B C 7B 8B 9B AC fB qB BC","1540":"ZB aB bB cB dB eB P Q R kB S"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"1":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"1":"A","2":"D"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"129":"T"},N:{"1":"B","66":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"TLS 1.1"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-2.js
new file mode 100644
index 0000000..e1ee7d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D sB","66":"E F A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o uB vB","66":"p q r"},D:{"1":"0 1 2 3 4 5 6 7 8 9 u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F G 7B","66":"B C 8B 9B AC fB qB BC gB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"1":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"1":"A","2":"D"},K:{"1":"U gB","2":"A B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","66":"A"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"TLS 1.2"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-3.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-3.js
new file mode 100644
index 0000000..d72f82b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/tls1-3.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB uB vB","132":"OB jB PB","450":"GB HB IB JB KB LB MB NB iB"},D:{"1":"WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB","706":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB"},E:{"1":"L G 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB","1028":"K gB 3B"},F:{"1":"MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB","706":"JB KB LB"},G:{"1":"OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"nB jC kC lC mC nC oC","2":"I eC fC gC hC iC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:6,C:"TLS 1.3"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/token-binding.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/token-binding.js
new file mode 100644
index 0000000..36dae2b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/token-binding.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L","194":"P Q R S V W X Y Z a b c d e f g T h i H","257":"G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i uB vB","16":"H lB"},D:{"2":"0 1 2 3 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","16":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB","194":"NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E yB mB zB 0B 1B","16":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C G M N O k l m n o p q r s t u 7B 8B 9B AC fB qB BC gB","16":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC","16":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"16":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","16":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","16":"U"},L:{"16":"H"},M:{"16":"T"},N:{"2":"A","16":"B"},O:{"16":"dC"},P:{"16":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"16":"pC"},R:{"16":"qC"},S:{"2":"rC"}},B:6,C:"Token Binding"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/touch.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/touch.js
new file mode 100644
index 0000000..6e31f6c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/touch.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","8":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","578":"C K L G M N O"},C:{"1":"O k l m n o p HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","4":"I j J D E F A B C K L G M N","194":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A","260":"B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:2,C:"Touch events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/transforms2d.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/transforms2d.js
new file mode 100644
index 0000000..9a6b952
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/transforms2d.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E","129":"A B","161":"F"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","129":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","33":"I j J D E F A B C K L G uB vB"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","33":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F 7B 8B","33":"B C G M N O k l m n 9B AC fB qB BC"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","33":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","33":"hB I XC YC ZC aC rB bC cC"},J:{"33":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"CSS3 2D Transforms"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/transforms3d.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/transforms3d.js
new file mode 100644
index 0000000..9f9482a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/transforms3d.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F uB vB","33":"A B C K L G"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B","33":"0 C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"pB 6B","2":"yB mB","33":"I j J D E zB 0B 1B","257":"F A B C K L G 2B nB fB gB 3B 4B 5B oB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"G M N O k l m n"},G:{"1":"pB","33":"E mB CC rB DC EC FC GC","257":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"1":"H","2":"XC YC ZC","33":"hB I aC rB bC cC"},J:{"33":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS3 3D Transforms"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/trusted-types.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/trusted-types.js
new file mode 100644
index 0000000..d81fcad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/trusted-types.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O P Q R"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"lC mC nC oC","2":"I eC fC gC hC iC nB jC kC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Trusted Types for DOM manipulation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ttf.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ttf.js
new file mode 100644
index 0000000..6a4a8e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/ttf.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","132":"F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 8B 9B AC fB qB BC gB","2":"F 7B"},G:{"1":"E rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC"},H:{"2":"WC"},I:{"1":"hB I H YC ZC aC rB bC cC","2":"XC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"TTF/OTF - TrueType and OpenType font support"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/typedarrays.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/typedarrays.js
new file mode 100644
index 0000000..c2b0e80
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/typedarrays.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"B","2":"J D E F sB","132":"A"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB","260":"zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC","260":"rB"},H:{"1":"WC"},I:{"1":"I H aC rB bC cC","2":"hB XC YC ZC"},J:{"1":"A","2":"D"},K:{"1":"C U gB","2":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Typed Arrays"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/u2f.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/u2f.js
new file mode 100644
index 0000000..9ae4a30
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/u2f.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","513":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB","322":"CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB"},D:{"2":"0 1 2 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","130":"3 4 5","513":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB gB"},F:{"2":"0 1 2 3 4 6 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","513":"5 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"322":"rC"}},B:6,C:"FIDO U2F API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/unhandledrejection.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/unhandledrejection.js
new file mode 100644
index 0000000..588770f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/unhandledrejection.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB uB vB"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC","16":"LC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:1,C:"unhandledrejection/rejectionhandled events"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/upgradeinsecurerequests.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/upgradeinsecurerequests.js
new file mode 100644
index 0000000..52b8506
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/upgradeinsecurerequests.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o p q r s t u 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Upgrade Insecure Requests"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/url-scroll-to-text-fragment.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/url-scroll-to-text-fragment.js
new file mode 100644
index 0000000..a194ed4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/url-scroll-to-text-fragment.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O","66":"P Q R"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB","66":"aB bB cB dB eB P Q"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB 7B 8B 9B AC fB qB BC gB","66":"SB TB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"lC mC nC oC","2":"I eC fC gC hC iC nB jC kC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"URL Scroll-To-Text Fragment"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/url.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/url.js
new file mode 100644
index 0000000..a08e765
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/url.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n","130":"o p q r s t u v w"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB 0B","130":"D"},F:{"1":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","130":"G M N O"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC","130":"FC"},H:{"2":"WC"},I:{"1":"H cC","2":"hB I XC YC ZC aC rB","130":"bC"},J:{"2":"D","130":"A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"URL API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/urlsearchparams.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/urlsearchparams.js
new file mode 100644
index 0000000..d87f620
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/urlsearchparams.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB","132":"0 1 2 3 4 5 6 7 8 u v w x y z"},D:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB"},E:{"1":"B C K L G nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B"},F:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","2":"I"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:1,C:"URLSearchParams"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/use-strict.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/use-strict.js
new file mode 100644
index 0000000..fe983e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/use-strict.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","132":"j zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"1":"WC"},I:{"1":"hB I H aC rB bC cC","2":"XC YC ZC"},J:{"1":"D A"},K:{"1":"C U qB gB","2":"A B fB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"ECMAScript 5 Strict Mode"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/user-select-none.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/user-select-none.js
new file mode 100644
index 0000000..fd8a345
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/user-select-none.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","33":"A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","33":"C K L G M N O"},C:{"1":"VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","33":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB uB vB"},D:{"1":"JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","33":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB"},E:{"33":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","33":"0 1 2 3 4 5 G M N O k l m n o p q r s t u v w x y z"},G:{"33":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","33":"hB I XC YC ZC aC rB bC cC"},J:{"33":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"33":"A B"},O:{"2":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","33":"I eC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"33":"rC"}},B:5,C:"CSS user-select: none"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/user-timing.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/user-timing.js
new file mode 100644
index 0000000..4b987b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/user-timing.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"User Timing API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/variable-fonts.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/variable-fonts.js
new file mode 100644
index 0000000..043ae02
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/variable-fonts.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB uB vB","4609":"PB QB U RB SB TB UB VB WB","4674":"jB","5698":"OB","7490":"IB JB KB LB MB","7746":"NB iB","8705":"XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB","4097":"SB","4290":"iB OB jB","6148":"PB QB U RB"},E:{"1":"G 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","4609":"B C fB gB","8193":"K L 3B 4B"},F:{"1":"JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB 7B 8B 9B AC fB qB BC gB","4097":"IB","6148":"EB FB GB HB"},G:{"1":"PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC","4097":"LC MC NC OC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"4097":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC","4097":"hC iC nB jC kC lC mC nC oC"},Q:{"4097":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Variable fonts"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/vector-effect.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/vector-effect.js
new file mode 100644
index 0000000..8f34bd8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/vector-effect.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","2":"F B 7B 8B 9B AC fB qB"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"1":"WC"},I:{"1":"H bC cC","16":"hB I XC YC ZC aC rB"},J:{"16":"D A"},K:{"1":"C U gB","2":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"SVG vector-effect: non-scaling-stroke"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/vibration.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/vibration.js
new file mode 100644
index 0000000..ac90742
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/vibration.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A uB vB","33":"B C K L G"},D:{"1":"0 1 2 3 4 5 6 7 8 9 v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k l m n o p q r s t u"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"Vibration API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/video.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/video.js
new file mode 100644
index 0000000..71c2a04
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/video.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","260":"I j J D E F A B C K L G M N O k uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A zB 0B 1B 2B nB","2":"yB mB","513":"B C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC","513":"LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","132":"XC YC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Video element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/videotracks.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/videotracks.js
new file mode 100644
index 0000000..5bb4cab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/videotracks.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O","322":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB","194":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","322":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J yB mB zB"},F:{"2":"F B C G M N O k l m n o p q r s t u v w 7B 8B 9B AC fB qB BC gB","322":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"322":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"194":"rC"}},B:1,C:"Video Tracks"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/viewport-unit-variants.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/viewport-unit-variants.js
new file mode 100644
index 0000000..a4c2d6a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/viewport-unit-variants.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H","194":"lB wB xB"},E:{"1":"pB 6B","2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"Large, Small, and Dynamic viewport units"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/viewport-units.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/viewport-units.js
new file mode 100644
index 0000000..38c4c42
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/viewport-units.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","132":"F","260":"A B"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","260":"C K L G"},C:{"1":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N O k","260":"l m n o p q"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB","260":"J"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC","516":"FC","772":"EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"260":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"Viewport units: vw, vh, vmin, vmax"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wai-aria.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wai-aria.js
new file mode 100644
index 0000000..2fd17de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wai-aria.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D sB","4":"E F A B"},B:{"4":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"4":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"4":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"yB mB","4":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F","4":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"4":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"4":"WC"},I:{"2":"hB I XC YC ZC aC rB","4":"H bC cC"},J:{"2":"D A"},K:{"4":"A B C U fB qB gB"},L:{"4":"H"},M:{"4":"T"},N:{"4":"A B"},O:{"2":"dC"},P:{"4":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"4":"pC"},R:{"4":"qC"},S:{"4":"rC"}},B:2,C:"WAI-ARIA Accessibility features"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wake-lock.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wake-lock.js
new file mode 100644
index 0000000..e51e13c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wake-lock.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"b c d e f g T h i H","2":"C K L G M N O","194":"P Q R S V W X Y Z a"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB","194":"XB YB ZB aB bB cB dB eB P Q R S V"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB 7B 8B 9B AC fB qB BC gB","194":"NB OB PB QB U RB SB TB UB VB WB XB YB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"mC nC oC","2":"I eC fC gC hC iC nB jC kC lC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:4,C:"Screen Wake Lock API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wasm.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wasm.js
new file mode 100644
index 0000000..b33337f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wasm.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L","578":"G"},C:{"1":"IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB uB vB","194":"CB DB EB FB GB","1025":"HB"},D:{"1":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB","322":"GB HB IB JB KB LB"},E:{"1":"B C K L G fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","322":"3 4 5 6 7 8"},G:{"1":"LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"194":"rC"}},B:6,C:"WebAssembly"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wav.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wav.js
new file mode 100644
index 0000000..c140272
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wav.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 9B AC fB qB BC gB","2":"F 7B 8B"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","16":"A"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"Wav audio format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wbr-element.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wbr-element.js
new file mode 100644
index 0000000..2c2b649
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wbr-element.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D sB","2":"E F A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"yB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","16":"F"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB"},H:{"1":"WC"},I:{"1":"hB I H ZC aC rB bC cC","16":"XC YC"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"wbr (word break opportunity) element"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-animation.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-animation.js
new file mode 100644
index 0000000..6cc9418
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-animation.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"V W X Y Z a b c d e f g T h i H","2":"C K L G M N O","260":"P Q R S"},C:{"1":"R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x uB vB","260":"iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB","516":"CB DB EB FB GB HB IB JB KB LB MB NB","580":"0 1 2 3 4 5 6 7 8 9 y z AB BB","2049":"bB cB dB eB P Q"},D:{"1":"V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","132":"1 2 3","260":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S"},E:{"1":"G 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B nB","1090":"B C K fB gB","2049":"L 3B 4B"},F:{"1":"XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n 7B 8B 9B AC fB qB BC gB","132":"o p q","260":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC","1090":"LC MC NC OC PC QC RC","2049":"SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"260":"dC"},P:{"260":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"260":"pC"},R:{"260":"qC"},S:{"516":"rC"}},B:5,C:"Web Animations API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-app-manifest.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-app-manifest.js
new file mode 100644
index 0000000..fe2a914
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-app-manifest.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M","130":"N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB X Y Z a b c d e f g T h i H lB uB vB","578":"cB dB eB P Q R kB S V W"},D:{"1":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC","260":"MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"2":"rC"}},B:5,C:"Add to home screen (A2HS)"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-bluetooth.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-bluetooth.js
new file mode 100644
index 0000000..58375b9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-bluetooth.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","1025":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","194":"AB BB CB DB EB FB GB HB","706":"IB JB KB","1025":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","450":"1 2 3 4","706":"5 6 7","1025":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC cC","1025":"H"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","1025":"U"},L:{"1025":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"fC gC hC iC nB jC kC lC mC nC oC","2":"I eC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Web Bluetooth"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-serial.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-serial.js
new file mode 100644
index 0000000..acf1429
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-serial.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"a b c d e f g T h i H","2":"C K L G M N O","66":"P Q R S V W X Y Z"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB","66":"eB P Q R S V W X Y Z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U 7B 8B 9B AC fB qB BC gB","66":"RB SB TB UB VB WB XB YB ZB aB bB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Web Serial API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-share.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-share.js
new file mode 100644
index 0000000..973e0b7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/web-share.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P Q","516":"R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z","130":"O k l m n o p","1028":"a b c d e f g T h i H lB wB xB"},E:{"1":"L G 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB","2049":"K gB 3B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC","2049":"OC PC QC RC SC"},H:{"2":"WC"},I:{"2":"hB I XC YC ZC aC rB bC","258":"H cC"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","258":"U"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I","258":"eC fC gC"},Q:{"2":"pC"},R:{"16":"qC"},S:{"2":"rC"}},B:5,C:"Web Share API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webauthn.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webauthn.js
new file mode 100644
index 0000000..2142f13
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webauthn.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","2":"C","226":"K L G M N"},C:{"1":"OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB uB vB"},D:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB"},E:{"1":"K L G 3B 4B 5B oB pB 6B","2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB","322":"gB"},F:{"1":"JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB 7B 8B 9B AC fB qB BC gB"},G:{"1":"UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC","578":"QC","2052":"TC","3076":"RC SC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:2,C:"Web Authentication API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgl.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgl.js
new file mode 100644
index 0000000..f205065
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgl.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"sB","8":"J D E F A","129":"B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","129":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","129":"I j J D E F A B C K L G M N O k l m n o"},D:{"1":"0 1 2 3 4 5 6 7 8 9 y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D","129":"E F A B C K L G M N O k l m n o p q r s t u v w x"},E:{"1":"E F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB","129":"J D zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B 7B 8B 9B AC fB qB BC","129":"C G M N O gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC FC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"1":"A","2":"D"},K:{"1":"C U gB","2":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A","129":"B"},O:{"129":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"129":"rC"}},B:6,C:"WebGL - 3D Canvas graphics"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgl2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgl2.js
new file mode 100644
index 0000000..aafa714
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgl2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p uB vB","194":"7 8 9","450":"0 1 2 3 4 5 6 q r s t u v w x y z","2242":"AB BB CB DB EB FB"},D:{"1":"LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z","578":"8 9 AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"G 5B oB pB 6B","2":"I j J D E F A yB mB zB 0B 1B 2B","1090":"B C K L nB fB gB 3B 4B"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB"},G:{"1":"VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC","1090":"NC OC PC QC RC SC TC UC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"gC hC iC nB jC kC lC mC nC oC","2":"I eC fC"},Q:{"578":"pC"},R:{"2":"qC"},S:{"2242":"rC"}},B:6,C:"WebGL 2.0"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgpu.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgpu.js
new file mode 100644
index 0000000..9ac8d4a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webgpu.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P","578":"Q R S V W X Y Z a b c d e","1602":"f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB uB vB","194":"QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P","578":"Q R S V W X Y Z a b c d e","1602":"f g T h i H lB wB xB"},E:{"2":"I j J D E F A B yB mB zB 0B 1B 2B nB","322":"C K L G fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB 7B 8B 9B AC fB qB BC gB","578":"ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"194":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"WebGPU"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webhid.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webhid.js
new file mode 100644
index 0000000..d97a199
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webhid.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"a b c d e f g T h i H","2":"C K L G M N O","66":"P Q R S V W X Y Z"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB","66":"eB P Q R S V W X Y Z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"cB dB eB P Q R kB S","2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB 7B 8B 9B AC fB qB BC gB","66":"SB TB UB VB WB XB YB ZB aB bB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"WebHID API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webkit-user-drag.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webkit-user-drag.js
new file mode 100644
index 0000000..79adead
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webkit-user-drag.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","132":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"16":"I j J D E F A B C K L G","132":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"F B C 7B 8B 9B AC fB qB BC gB","132":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"CSS -webkit-user-drag property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webm.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webm.js
new file mode 100644
index 0000000..e8d210d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webm.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E sB","520":"F A B"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","8":"C K","388":"L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","132":"I j J D E F A B C K L G M N O k l m n o p q r s"},D:{"1":"0 1 2 3 4 5 6 7 8 9 q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j","132":"J D E F A B C K L G M N O k l m n o p"},E:{"2":"yB","8":"I j mB zB","520":"J D E F A B C 0B 1B 2B nB fB","1028":"K gB 3B","7172":"L","8196":"G 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F 7B 8B 9B","132":"B C G AC fB qB BC gB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC","1028":"OC PC QC RC SC","3076":"TC UC VC oB pB"},H:{"2":"WC"},I:{"1":"H","2":"XC YC","132":"hB I ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"8":"A B"},O:{"1":"dC"},P:{"1":"eC fC gC hC iC nB jC kC lC mC nC oC","132":"I"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:6,C:"WebM video format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webnfc.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webnfc.js
new file mode 100644
index 0000000..975dfae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webnfc.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O P a b c d e f g T h i H","450":"Q R S V W X Y Z"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P a b c d e f g T h i H lB wB xB","450":"Q R S V W X Y Z"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB 7B 8B 9B AC fB qB BC gB","450":"TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"257":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"Web NFC"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webp.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webp.js
new file mode 100644
index 0000000..b795d03
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webp.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N"},C:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","8":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U"},D:{"1":"0 1 2 3 4 5 6 7 8 9 x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j","8":"J D E","132":"F A B C K L G M N O k l m n","260":"o p q r s t u v w"},E:{"2":"I j J D E F A B C K yB mB zB 0B 1B 2B nB fB gB 3B","516":"L G 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F 7B 8B 9B","8":"B AC","132":"fB qB BC","260":"C G M N O gB"},G:{"1":"TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC"},H:{"1":"WC"},I:{"1":"H rB bC cC","2":"hB XC YC ZC","132":"I aC"},J:{"2":"D A"},K:{"1":"C U fB qB gB","2":"A","132":"B"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"8":"rC"}},B:7,C:"WebP image format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/websockets.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/websockets.js
new file mode 100644
index 0000000..a6fae84
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/websockets.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB uB vB","132":"I j","292":"J D E F A"},D:{"1":"0 1 2 3 4 5 6 7 8 9 M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L","260":"G"},E:{"1":"D E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","132":"j zB","260":"J 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F 7B 8B 9B AC","132":"B C fB qB BC"},G:{"1":"E EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC","132":"rB DC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","129":"D"},K:{"1":"U gB","2":"A","132":"B C fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Web Sockets"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webusb.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webusb.js
new file mode 100644
index 0000000..c7840c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webusb.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB","66":"JB KB LB MB NB iB OB"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"0 1 2 3 4 5 F B C G M N O k l m n o p q r s t u v w x y z 7B 8B 9B AC fB qB BC gB","66":"6 7 8 9 AB BB CB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"1":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"1":"hC iC nB jC kC lC mC nC oC","2":"I eC fC gC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:7,C:"WebUSB"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webvr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webvr.js
new file mode 100644
index 0000000..bc762b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webvr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L Q R S V W X Y Z a b c d e f g T h i H","66":"P","257":"G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB uB vB","129":"KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","194":"JB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB Q R S V W X Y Z a b c d e f g T h i H lB wB xB","66":"MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P"},E:{"2":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 F B C G M N O k l m n o p q r s t u v w x y z TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","66":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C U fB qB gB"},L:{"2":"H"},M:{"2":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"513":"I","516":"eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"2":"pC"},R:{"66":"qC"},S:{"2":"rC"}},B:7,C:"WebVR API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webvtt.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webvtt.js
new file mode 100644
index 0000000..f762cf7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webvtt.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"tB hB I j J D E F A B C K L G M N O k l m n o uB vB","66":"p q r s t u v","129":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I j J D E F A B C K L G M N"},E:{"1":"J D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB DC EC"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB I XC YC ZC aC rB"},J:{"1":"A","2":"D"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"B","2":"A"},O:{"2":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"129":"rC"}},B:5,C:"WebVTT - Web Video Text Tracks"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webworkers.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webworkers.js
new file mode 100644
index 0000000..1a5c8eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webworkers.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","2":"sB","8":"J D E F"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","8":"tB hB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","8":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S AC fB qB BC gB","2":"F 7B","8":"8B 9B"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"H XC bC cC","2":"hB I YC ZC aC rB"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","8":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Web Workers"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webxr.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webxr.js
new file mode 100644
index 0000000..22d262c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/webxr.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"2":"C K L G M N O","132":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB uB vB","322":"dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U","66":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","132":"P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"2":"I j J D E F A B C yB mB zB 0B 1B 2B nB fB gB","578":"K L G 3B 4B 5B oB pB 6B"},F:{"2":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB 7B 8B 9B AC fB qB BC gB","66":"HB IB JB KB LB MB NB OB PB QB U RB","132":"SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S"},G:{"2":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"2":"WC"},I:{"2":"hB I H XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"2":"A B C fB qB gB","132":"U"},L:{"132":"H"},M:{"322":"T"},N:{"2":"A B"},O:{"2":"dC"},P:{"2":"I eC fC gC hC iC nB jC","132":"kC lC mC nC oC"},Q:{"2":"pC"},R:{"2":"qC"},S:{"2":"rC"}},B:5,C:"WebXR Device API"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/will-change.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/will-change.js
new file mode 100644
index 0000000..5a6727b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/will-change.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"P Q R S V W X Y Z a b c d e f g T h i H","2":"C K L G M N O"},C:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L G M N O k l m n o p q r s t uB vB","194":"0 u v w x y z"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n o 7B 8B 9B AC fB qB BC gB"},G:{"1":"IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS will-change property"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/woff.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/woff.js
new file mode 100644
index 0000000..777f304
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/woff.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB vB","2":"tB hB uB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"I"},E:{"1":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I j yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S fB qB BC gB","2":"F B 7B 8B 9B AC"},G:{"1":"E DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB"},H:{"2":"WC"},I:{"1":"H bC cC","2":"hB XC YC ZC aC rB","130":"I"},J:{"1":"D A"},K:{"1":"B C U fB qB gB","2":"A"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:2,C:"WOFF - Web Open Font Format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/woff2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/woff2.js
new file mode 100644
index 0000000..208cca2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/woff2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F A B sB"},B:{"1":"L G M N O P Q R S V W X Y Z a b c d e f g T h i H","2":"C K"},C:{"1":"4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"0 1 2 3 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z uB vB"},D:{"1":"1 2 3 4 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","2":"0 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"C K L G gB 3B 4B 5B oB pB 6B","2":"I j J D E F yB mB zB 0B 1B 2B","132":"A B nB fB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C G M N O k l m n 7B 8B 9B AC fB qB BC gB"},G:{"1":"JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"E mB CC rB DC EC FC GC HC IC"},H:{"2":"WC"},I:{"1":"H","2":"hB I XC YC ZC aC rB bC cC"},J:{"2":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"2":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"WOFF 2.0 - Web Open Font Format"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/word-break.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/word-break.js
new file mode 100644
index 0000000..d50c0b9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/word-break.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"J D E F A B sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB I j J D E F A B C K L uB vB"},D:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"0 1 2 3 4 5 6 7 8 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z"},E:{"1":"F A B C K L G 2B nB fB gB 3B 4B 5B oB pB 6B","4":"I j J D E yB mB zB 0B 1B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","2":"F B C 7B 8B 9B AC fB qB BC gB","4":"G M N O k l m n o p q r s t u v"},G:{"1":"HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","4":"E mB CC rB DC EC FC GC"},H:{"2":"WC"},I:{"1":"H","4":"hB I XC YC ZC aC rB bC cC"},J:{"4":"D A"},K:{"1":"U","2":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"4":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"4":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:5,C:"CSS3 word-break"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wordwrap.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wordwrap.js
new file mode 100644
index 0000000..86fb99a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/wordwrap.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"4":"J D E F A B sB"},B:{"1":"O P Q R S V W X Y Z a b c d e f g T h i H","4":"C K L G M N"},C:{"1":"EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","4":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","4":"I j J D E F A B C K L G M N O k l m n"},E:{"1":"D E F A B C K L G 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","4":"I j J yB mB zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F 7B 8B","4":"B C 9B AC fB qB BC"},G:{"1":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","4":"mB CC rB DC EC"},H:{"4":"WC"},I:{"1":"H bC cC","4":"hB I XC YC ZC aC rB"},J:{"1":"A","4":"D"},K:{"1":"U","4":"A B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"4":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"4":"rC"}},B:5,C:"CSS3 Overflow-wrap"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/x-doc-messaging.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/x-doc-messaging.js
new file mode 100644
index 0000000..35c79cc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/x-doc-messaging.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D sB","132":"E F","260":"A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB","2":"tB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"yB mB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB","2":"F"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"4":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"Cross-document messaging"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/x-frame-options.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/x-frame-options.js
new file mode 100644
index 0000000..b1faa3c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/x-frame-options.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"E F A B","2":"J D sB"},B:{"1":"C K L G M N O","4":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB","4":"I j J D E F A B C K L G M N WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","16":"tB hB uB vB"},D:{"4":"0 1 2 3 4 5 6 7 8 9 r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J D E F A B C K L G M N O k l m n o p q"},E:{"4":"J D E F A B C K L G zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B","16":"I j yB mB"},F:{"4":"0 1 2 3 4 5 6 7 8 9 C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S BC gB","16":"F B 7B 8B 9B AC fB qB"},G:{"4":"E FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","16":"mB CC rB DC EC"},H:{"2":"WC"},I:{"4":"I H aC rB bC cC","16":"hB XC YC ZC"},J:{"4":"D A"},K:{"4":"U gB","16":"A B C fB qB"},L:{"4":"H"},M:{"4":"T"},N:{"1":"A B"},O:{"4":"dC"},P:{"4":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"4":"pC"},R:{"4":"qC"},S:{"1":"rC"}},B:6,C:"X-Frame-Options HTTP header"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhr2.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhr2.js
new file mode 100644
index 0000000..510e287
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhr2.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"J D E F sB","132":"A B"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","2":"tB hB","260":"A B","388":"J D E F","900":"I j uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","16":"I j J","132":"u v","388":"D E F A B C K L G M N O k l m n o p q r s t"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","2":"I yB mB","132":"D 0B","388":"j J zB"},F:{"1":"0 1 2 3 4 5 6 7 8 9 C O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S gB","2":"F B 7B 8B 9B AC fB qB BC","132":"G M N"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","2":"mB CC rB","132":"FC","388":"DC EC"},H:{"2":"WC"},I:{"1":"H cC","2":"XC YC ZC","388":"bC","900":"hB I aC rB"},J:{"132":"A","388":"D"},K:{"1":"C U gB","2":"A B fB qB"},L:{"1":"H"},M:{"1":"T"},N:{"132":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:1,C:"XMLHttpRequest advanced features"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhtml.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhtml.js
new file mode 100644
index 0000000..7b1bd81
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhtml.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"F A B","2":"J D E sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"1":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"1":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"1":"WC"},I:{"1":"hB I H XC YC ZC aC rB bC cC"},J:{"1":"D A"},K:{"1":"A B C U fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"2":"qC"},S:{"1":"rC"}},B:1,C:"XHTML served as application/xhtml+xml"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhtmlsmil.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhtmlsmil.js
new file mode 100644
index 0000000..c694b22
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xhtmlsmil.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"2":"F A B sB","4":"J D E"},B:{"2":"C K L G M N O","8":"P Q R S V W X Y Z a b c d e f g T h i H"},C:{"8":"0 1 2 3 4 5 6 7 8 9 tB hB I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB uB vB"},D:{"8":"0 1 2 3 4 5 6 7 8 9 I j J D E F A B C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB"},E:{"8":"I j J D E F A B C K L G yB mB zB 0B 1B 2B nB fB gB 3B 4B 5B oB pB 6B"},F:{"8":"0 1 2 3 4 5 6 7 8 9 F B C G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S 7B 8B 9B AC fB qB BC gB"},G:{"8":"E mB CC rB DC EC FC GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB"},H:{"8":"WC"},I:{"8":"hB I H XC YC ZC aC rB bC cC"},J:{"8":"D A"},K:{"8":"A B C U fB qB gB"},L:{"8":"H"},M:{"8":"T"},N:{"2":"A B"},O:{"8":"dC"},P:{"8":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"8":"pC"},R:{"8":"qC"},S:{"8":"rC"}},B:7,C:"XHTML+SMIL animation"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xml-serializer.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xml-serializer.js
new file mode 100644
index 0000000..10aa829
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/features/xml-serializer.js
@@ -0,0 +1 @@
+module.exports={A:{A:{"1":"A B","260":"J D E F sB"},B:{"1":"C K L G M N O P Q R S V W X Y Z a b c d e f g T h i H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 C K L G M N O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S V W X Y Z a b c d e f g T h i H lB","132":"B","260":"tB hB I j J D uB vB","516":"E F A"},D:{"1":"0 1 2 3 4 5 6 7 8 9 w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB iB OB jB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R S V W X Y Z a b c d e f g T h i H lB wB xB","132":"I j J D E F A B C K L G M N O k l m n o p q r s t u v"},E:{"1":"E F A B C K L G 1B 2B nB fB gB 3B 4B 5B oB pB 6B","132":"I j J D yB mB zB 0B"},F:{"1":"0 1 2 3 4 5 6 7 8 9 O k l m n o p q r s t u v w x y z AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB U RB SB TB UB VB WB XB YB ZB aB bB cB dB eB P Q R kB S","16":"F 7B","132":"B C G M N 8B 9B AC fB qB BC gB"},G:{"1":"E GC HC IC JC KC LC MC NC OC PC QC RC SC TC UC VC oB pB","132":"mB CC rB DC EC FC"},H:{"132":"WC"},I:{"1":"H bC cC","132":"hB I XC YC ZC aC rB"},J:{"132":"D A"},K:{"1":"U","16":"A","132":"B C fB qB gB"},L:{"1":"H"},M:{"1":"T"},N:{"1":"A B"},O:{"1":"dC"},P:{"1":"I eC fC gC hC iC nB jC kC lC mC nC oC"},Q:{"1":"pC"},R:{"1":"qC"},S:{"1":"rC"}},B:4,C:"DOM Parsing and Serialization"};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AD.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AD.js
new file mode 100644
index 0000000..bf8d330
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AD.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.02665,"68":0.00381,"72":0.03046,"77":0.00381,"78":0.07614,"88":0.01142,"90":0.02284,"91":0.02284,"92":0.01523,"94":0.01904,"95":0.03046,"96":0.68145,"97":0.9251,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 79 80 81 82 83 84 85 86 87 89 93 98 99 3.5 3.6"},D:{"39":0.00381,"40":0.00381,"49":0.25126,"56":0.00761,"61":0.00761,"67":0.00381,"68":0.01142,"69":0.00381,"70":0.01904,"75":0.00761,"77":0.01523,"79":0.12182,"80":0.03426,"81":0.01904,"83":0.00761,"85":0.03046,"86":0.01142,"87":0.01523,"88":0.00761,"89":0.03046,"90":0.01142,"91":0.20939,"92":0.06472,"94":0.04949,"95":0.01904,"96":0.23603,"97":5.36026,"98":12.37656,"99":0.06472,"101":0.01142,_:"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 41 42 43 44 45 46 47 48 50 51 52 53 54 55 57 58 59 60 62 63 64 65 66 71 72 73 74 76 78 84 93 100"},F:{"36":0.00381,"57":0.06091,"82":0.25507,"83":0.60151,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00381,"87":0.01142,"90":0.00381,"92":0.00381,"95":0.00761,"96":0.03426,"97":0.43019,"98":1.73219,_:"12 13 14 16 17 18 79 80 81 83 84 85 86 88 89 91 93 94"},E:{"4":0,"12":0.00761,"13":0.02665,"14":0.23603,"15":0.39974,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.01142,"11.1":0.01523,"12.1":0.1104,"13.1":0.3274,"14.1":1.43143,"15.1":1.86924,"15.2-15.3":4.71687,"15.4":0.11802},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.02988,"9.0-9.2":0,"9.3":0.05603,"10.0-10.2":0,"10.3":0.0747,"11.0-11.2":0,"11.3-11.4":0.01494,"12.0-12.1":0.00374,"12.2-12.5":0.33243,"13.0-13.1":0.01121,"13.2":0.00374,"13.3":0.04482,"13.4-13.7":0.24652,"14.0-14.4":0.34363,"14.5-14.8":2.84992,"15.0-15.1":6.7793,"15.2-15.3":26.34403,"15.4":0.19049},P:{"4":0.05226,"5.0-5.4":0.35318,"6.2-6.4":0.02066,"7.2-7.4":0.01067,"8.2":0.01248,"9.2":0.01067,"10.1":0.02066,"11.1-11.2":0.0209,"12.0":0.02135,"13.0":0.17768,"14.0":0.03136,"15.0":0.0209,"16.0":1.1706},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0014,"4.4":0,"4.4.3-4.4.4":0.02337},A:{"11":0.14467,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.17338},Q:{"10.4":0},O:{"0":0},H:{"0":0.10552},L:{"0":21.49973},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AE.js
new file mode 100644
index 0000000..ca70f79
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AE.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01711,"68":0.01711,"78":0.01141,"84":0.0057,"91":0.01141,"94":0.0057,"95":0.01141,"96":0.23386,"97":0.35365,"98":0.01711,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 88 89 90 92 93 99 3.5 3.6"},D:{"35":0.33083,"38":0.01711,"49":0.02282,"64":0.01141,"65":0.01711,"67":0.0057,"69":0.01141,"70":0.01141,"72":0.0057,"75":0.01711,"76":0.03422,"77":0.01141,"78":0.0057,"79":0.05704,"80":0.02282,"81":0.01141,"83":0.01141,"84":0.05134,"85":0.02852,"86":0.03422,"87":0.11408,"88":0.01141,"89":0.03993,"90":0.03422,"91":0.15401,"92":0.07415,"93":0.2852,"94":0.10838,"95":0.06845,"96":0.80997,"97":14.85322,"98":29.88326,"99":0.03422,"100":0.03993,_:"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 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 66 68 71 73 74 101"},F:{"28":0.0057,"82":0.1426,"83":0.4221,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01711,"84":0.0057,"92":0.02282,"93":0.0057,"94":0.0057,"95":0.01711,"96":0.07415,"97":1.32903,"98":3.33684,_:"12 13 14 15 16 17 79 80 81 83 85 86 87 88 89 90 91"},E:{"4":0,"12":0.0057,"13":0.03422,"14":0.18823,"15":0.17112,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.01141,"12.1":0.03993,"13.1":0.11978,"14.1":0.68448,"15.1":0.32513,"15.2-15.3":0.59892,"15.4":0.01141},G:{"8":0.00181,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00632,"6.0-6.1":0.0009,"7.0-7.1":0.01174,"8.1-8.4":0.00271,"9.0-9.2":0,"9.3":0.08577,"10.0-10.2":0.00271,"10.3":0.05236,"11.0-11.2":0.07313,"11.3-11.4":0.01174,"12.0-12.1":0.01174,"12.2-12.5":0.30785,"13.0-13.1":0.02438,"13.2":0.00451,"13.3":0.03521,"13.4-13.7":0.11556,"14.0-14.4":0.45862,"14.5-14.8":1.66926,"15.0-15.1":1.41197,"15.2-15.3":4.6873,"15.4":0.04604},P:{"4":0.04366,"5.0-5.4":0.0102,"6.2-6.4":0.01085,"7.2-7.4":0.03275,"8.2":0.02073,"9.2":0.0217,"10.1":0.11002,"11.1-11.2":0.03275,"12.0":0.01085,"13.0":0.03275,"14.0":0.06549,"15.0":0.04366,"16.0":1.48452},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00229,"4.4":0,"4.4.3-4.4.4":0.01489},A:{"11":0.12549,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.0043},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.07733},Q:{"10.4":0},O:{"0":2.93417},H:{"0":0.57347},L:{"0":27.90141},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AF.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AF.js
new file mode 100644
index 0000000..2587502
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AF.js
@@ -0,0 +1 @@
+module.exports={C:{"6":0.00238,"25":0.00475,"29":0.0095,"30":0.00238,"37":0.00238,"38":0.01188,"40":0.00713,"41":0.00238,"43":0.00238,"44":0.00475,"45":0.00238,"47":0.01663,"48":0.02138,"49":0.00475,"50":0.01188,"52":0.00713,"56":0.01901,"57":0.00238,"60":0.00238,"63":0.00475,"64":0.00238,"65":0.00238,"71":0.00238,"72":0.01663,"78":0.01901,"83":0.00238,"85":0.00475,"86":0.00238,"87":0.00475,"88":0.03326,"89":0.04039,"90":0.00475,"91":0.01901,"93":0.00713,"94":0.01663,"95":0.02138,"96":0.44194,"97":0.65102,"98":0.01663,_:"2 3 4 5 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 31 32 33 34 35 36 39 42 46 51 53 54 55 58 59 61 62 66 67 68 69 70 73 74 75 76 77 79 80 81 82 84 92 99 3.5 3.6"},D:{"18":0.00238,"23":0.00238,"24":0.00475,"25":0.00238,"26":0.00238,"29":0.00238,"30":0.0095,"34":0.00713,"36":0.00475,"37":0.00713,"38":0.00713,"39":0.00713,"42":0.00238,"43":0.05702,"44":0.00238,"45":0.00475,"46":0.00238,"47":0.01901,"48":0.00238,"49":0.00475,"50":0.00475,"51":0.01188,"52":0.01426,"53":0.00475,"55":0.0095,"56":0.00713,"57":0.00713,"58":0.00238,"59":0.00238,"60":0.00475,"62":0.02138,"63":0.02138,"64":0.01188,"65":0.01426,"66":0.0095,"67":0.01663,"68":0.00475,"69":0.00475,"70":0.01426,"71":0.01663,"72":0.03089,"73":0.01426,"74":0.01663,"75":0.00713,"76":0.01663,"77":0.10692,"78":0.02614,"79":0.02376,"80":0.03564,"81":0.06653,"83":0.07603,"84":0.03564,"85":0.02376,"86":0.05227,"87":0.06653,"88":0.02138,"89":0.02614,"90":0.02614,"91":0.04039,"92":0.07128,"93":0.39204,"94":0.11642,"95":0.06653,"96":0.4847,"97":3.7921,"98":9.57766,"99":0.03802,"100":0.02138,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 19 20 21 22 27 28 31 32 33 35 40 41 54 61 101"},F:{"38":0.00713,"74":0.00238,"79":0.00713,"82":0.04514,"83":0.81972,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.02376,"13":0.01901,"14":0.01426,"15":0.0095,"16":0.04277,"17":0.02138,"18":0.1093,"81":0.01426,"84":0.03089,"85":0.00713,"89":0.04277,"90":0.02614,"91":0.00713,"92":0.03089,"93":0.01901,"94":0.00475,"95":0.01426,"96":0.04277,"97":0.30413,"98":0.8411,_:"79 80 83 86 87 88"},E:{"4":0,"10":0.00238,"13":0.0095,"14":0.03802,"15":0.00475,_:"0 5 6 7 8 9 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1","5.1":0.00238,"12.1":0.0095,"13.1":0.00713,"14.1":0.03089,"15.1":0.21622,"15.2-15.3":0.44194,"15.4":0.07841},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00607,"7.0-7.1":0.08254,"8.1-8.4":0,"9.0-9.2":0.00243,"9.3":0.04855,"10.0-10.2":0.0085,"10.3":0.08011,"11.0-11.2":0.02913,"11.3-11.4":0.05098,"12.0-12.1":0.07526,"12.2-12.5":0.84725,"13.0-13.1":0.04248,"13.2":0.04491,"13.3":0.11895,"13.4-13.7":0.24883,"14.0-14.4":1.26845,"14.5-14.8":0.99898,"15.0-15.1":2.13633,"15.2-15.3":5.84335,"15.4":0.20271},P:{"4":1.2008,"5.0-5.4":0.35318,"6.2-6.4":0.35318,"7.2-7.4":0.59536,"8.2":0.03027,"9.2":0.29263,"10.1":0.02018,"11.1-11.2":0.25227,"12.0":0.10091,"13.0":0.28254,"14.0":0.30272,"15.0":0.37336,"16.0":1.79616},I:{"0":0,"3":0,"4":0.00023,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00114,"4.2-4.3":0.00916,"4.4":0,"4.4.3-4.4.4":0.0657},A:{"8":0.00238,"9":0.02138,"10":0.00238,"11":0.50846,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00762},N:{_:"10 11"},R:{_:"0"},M:{"0":0.0991},Q:{"10.4":0},O:{"0":2.07346},H:{"0":1.15471},L:{"0":55.2317},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AG.js
new file mode 100644
index 0000000..0d8206d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AG.js
@@ -0,0 +1 @@
+module.exports={C:{"30":0.00367,"47":0.00733,"52":0.01466,"78":0.00367,"82":0.00367,"91":0.00733,"93":0.00367,"94":0.00733,"95":0.01466,"96":0.35551,"97":0.75499,"98":0.00733,_:"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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 83 84 85 86 87 88 89 90 92 99 3.5 3.6"},D:{"11":0.00733,"49":0.01466,"58":0.00367,"67":0.01833,"69":0.011,"75":0.01466,"76":0.04398,"77":0.01833,"78":0.03299,"79":0.0733,"80":0.00733,"81":0.011,"83":0.011,"84":0.01833,"85":0.02932,"86":0.06231,"87":0.01466,"88":0.011,"89":0.02566,"90":0.03299,"91":0.01466,"92":0.02199,"93":0.04032,"94":0.02566,"95":0.06964,"96":0.29687,"97":6.14621,"98":14.02596,"99":0.01466,_:"4 5 6 7 8 9 10 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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 59 60 61 62 63 64 65 66 68 70 71 72 73 74 100 101"},F:{"82":0.1576,"83":0.63405,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00733,"15":0.01466,"16":0.00733,"17":0.011,"18":0.06964,"84":0.03299,"85":0.011,"90":0.00733,"92":0.011,"93":0.00733,"95":0.00733,"96":0.04398,"97":1.35239,"98":4.63623,_:"12 13 79 80 81 83 86 87 88 89 91 94"},E:{"4":0,"8":0.00367,"12":0.00367,"13":0.01466,"14":0.1576,"15":0.09529,_:"0 5 6 7 9 10 11 3.1 3.2 6.1 7.1 10.1","5.1":0.00367,"9.1":0.0733,"11.1":0.01833,"12.1":0.02932,"13.1":0.49478,"14.1":1.34139,"15.1":0.27488,"15.2-15.3":0.9529,"15.4":0.02566},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01072,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.01837,"9.0-9.2":0,"9.3":0.03062,"10.0-10.2":0.00306,"10.3":0.04134,"11.0-11.2":0.01531,"11.3-11.4":0.02756,"12.0-12.1":0.00766,"12.2-12.5":0.68288,"13.0-13.1":0.00612,"13.2":0.00306,"13.3":0.05359,"13.4-13.7":0.3246,"14.0-14.4":0.73494,"14.5-14.8":2.60598,"15.0-15.1":2.52636,"15.2-15.3":8.11191,"15.4":0.09493},P:{"4":0.13579,"5.0-5.4":0.04115,"6.2-6.4":0.02066,"7.2-7.4":0.27157,"8.2":0.01029,"9.2":0.03134,"10.1":0.06172,"11.1-11.2":0.4178,"12.0":0.02089,"13.0":0.1149,"14.0":0.26113,"15.0":0.19846,"16.0":4.58539},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00134,"4.4":0,"4.4.3-4.4.4":0.01766},A:{"11":0.07697,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.13937},Q:{"10.4":0},O:{"0":0.07602},H:{"0":0.17993},L:{"0":42.72577},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AI.js
new file mode 100644
index 0000000..fc69683
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AI.js
@@ -0,0 +1 @@
+module.exports={C:{"87":0.00771,"95":0.02697,"96":0.17724,"97":0.35448,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 88 89 90 91 92 93 94 98 99 3.5 3.6"},D:{"65":0.00771,"66":0.01541,"67":0.01156,"73":0.00385,"76":0.01541,"77":0.01541,"79":0.01541,"81":0.00385,"87":0.03082,"88":0.02697,"90":0.01156,"91":0.00771,"93":0.01541,"94":0.01541,"95":0.01541,"96":0.34292,"97":8.04506,"98":8.8619,"99":0.02697,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 68 69 70 71 72 74 75 78 80 83 84 85 86 89 92 100 101"},F:{"82":0.10788,"83":1.51423,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.02697,"92":0.00385,"95":0.0578,"96":0.01927,"97":2.35033,"98":4.98578,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,"11":0.01927,"13":0.13871,"14":0.16568,"15":0.39686,_:"0 5 6 7 8 9 10 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.03468,"12.1":0.04238,"13.1":1.28305,"14.1":1.3524,"15.1":1.46414,"15.2-15.3":3.1402,"15.4":0.02697},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0027,"8.1-8.4":0,"9.0-9.2":0.0027,"9.3":0.0081,"10.0-10.2":0,"10.3":0.02969,"11.0-11.2":0.0027,"11.3-11.4":0.01889,"12.0-12.1":0.0027,"12.2-12.5":0.35088,"13.0-13.1":0.0027,"13.2":0.06208,"13.3":0.18624,"13.4-13.7":0.04588,"14.0-14.4":0.64508,"14.5-14.8":2.76925,"15.0-15.1":3.93795,"15.2-15.3":18.81794,"15.4":0.09987},P:{"4":0.05188,"5.0-5.4":0.04115,"6.2-6.4":0.02066,"7.2-7.4":0.06226,"8.2":0.01029,"9.2":0.02057,"10.1":0.06172,"11.1-11.2":0.68483,"12.0":0.02057,"13.0":0.05188,"14.0":0.10376,"15.0":0.07263,"16.0":2.69783},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.03853,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.11679},Q:{"10.4":0},O:{"0":0},H:{"0":0.02328},L:{"0":28.89313},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AL.js
new file mode 100644
index 0000000..79b13aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AL.js
@@ -0,0 +1 @@
+module.exports={C:{"46":0.00186,"52":0.03155,"66":0.14662,"68":0.00371,"72":0.00186,"77":0.00928,"78":0.00742,"79":0.00371,"80":0.01114,"81":0.00557,"82":0.00371,"83":0.00186,"84":0.01299,"87":0.00186,"88":0.00557,"89":0.00928,"91":0.01114,"92":0.00371,"94":0.00371,"95":0.00742,"96":0.25798,"97":0.46586,"98":0.00557,_:"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 40 41 42 43 44 45 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 67 69 70 71 73 74 75 76 85 86 90 93 99 3.5 3.6"},D:{"38":0.01114,"47":0.00371,"49":0.05754,"53":0.00371,"55":0.00186,"56":0.00371,"60":0.00371,"62":0.01114,"63":0.00928,"64":0.00371,"65":0.01485,"66":0.00557,"67":0.00186,"68":0.0167,"69":0.01114,"70":0.00928,"71":0.0167,"72":0.00371,"73":0.00371,"74":0.02227,"75":0.00371,"76":0.01485,"77":0.00742,"78":0.00928,"79":0.09466,"80":0.02042,"81":0.01856,"83":0.03341,"84":0.0631,"85":0.10579,"86":0.06496,"87":0.10022,"88":0.0167,"89":0.02413,"90":0.0167,"91":0.0297,"92":0.02042,"93":0.25984,"94":0.02042,"95":0.05197,"96":0.21158,"97":3.83635,"98":8.71949,"99":0.00928,"100":0.00371,_:"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 39 40 41 42 43 44 45 46 48 50 51 52 54 57 58 59 61 101"},F:{"28":0.00742,"36":0.00742,"40":0.00371,"46":0.00557,"52":0.00371,"69":0.00186,"71":0.00371,"82":0.04826,"83":0.27654,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 53 54 55 56 57 58 60 62 63 64 65 66 67 68 70 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00186,"17":0.01299,"18":0.01299,"83":0.00742,"84":0.00186,"89":0.00928,"92":0.00371,"94":0.00186,"95":0.00371,"96":0.00928,"97":0.18931,"98":0.68115,_:"12 13 15 16 79 80 81 85 86 87 88 90 91 93"},E:{"4":0,"13":0.01299,"14":0.04826,"15":0.03526,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.00186,"10.1":0.00557,"11.1":0.00557,"12.1":0.01299,"13.1":0.05382,"14.1":0.22086,"15.1":0.16333,"15.2-15.3":0.36006,"15.4":0.01114},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.06117,"7.0-7.1":0.02719,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04758,"10.0-10.2":0.01699,"10.3":0.11894,"11.0-11.2":0.04418,"11.3-11.4":0.08156,"12.0-12.1":0.06117,"12.2-12.5":1.88261,"13.0-13.1":0.05097,"13.2":0.05097,"13.3":0.20729,"13.4-13.7":0.66945,"14.0-14.4":1.69571,"14.5-14.8":7.74795,"15.0-15.1":4.5876,"15.2-15.3":16.47798,"15.4":0.13933},P:{"4":0.21513,"5.0-5.4":0.35318,"6.2-6.4":0.35318,"7.2-7.4":0.10244,"8.2":0.01248,"9.2":0.03073,"10.1":0.02018,"11.1-11.2":0.16391,"12.0":0.05122,"13.0":0.20488,"14.0":0.16391,"15.0":0.16391,"16.0":2.47909},I:{"0":0,"3":0,"4":0.00233,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00349,"4.2-4.3":0.00524,"4.4":0,"4.4.3-4.4.4":0.03781},A:{"8":0.00371,"9":0.00557,"10":0.00186,"11":0.05011,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.16288},Q:{"10.4":0},O:{"0":0.02443},H:{"0":0.09252},L:{"0":42.25688},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AM.js
new file mode 100644
index 0000000..e0a1d4b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AM.js
@@ -0,0 +1 @@
+module.exports={C:{"11":0.01367,"51":0.0205,"52":37.23163,"56":0.00683,"78":0.02734,"82":0.00683,"83":0.00683,"91":0.01367,"95":0.02734,"96":0.32803,"97":0.62873,_:"2 3 4 5 6 7 8 9 10 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 40 41 42 43 44 45 46 47 48 49 50 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 84 85 86 87 88 89 90 92 93 94 98 99 3.5 3.6"},D:{"22":0.01367,"44":0.00683,"47":0.01367,"49":0.06834,"51":0.00683,"63":0.0205,"68":0.0205,"69":0.00683,"71":0.00683,"72":0.01367,"73":0.0205,"74":0.02734,"75":0.01367,"76":0.0205,"79":0.0205,"80":0.0205,"83":0.01367,"84":0.02734,"85":0.041,"86":0.07517,"87":0.08201,"88":0.02734,"89":0.07517,"90":0.03417,"91":0.03417,"92":0.06834,"93":0.0205,"94":0.041,"95":0.06834,"96":0.54672,"97":7.03902,"98":16.7638,"100":0.01367,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 45 46 48 50 52 53 54 55 56 57 58 59 60 61 62 64 65 66 67 70 77 78 81 99 101"},F:{"82":0.11618,"83":0.69023,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"96":0.01367,"97":0.19819,"98":0.6424,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95"},E:{"4":0,"14":0.08201,"15":0.13668,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.06834,"11.1":0.00683,"12.1":0.01367,"13.1":0.13668,"14.1":0.21869,"15.1":0.18452,"15.2-15.3":0.23236},G:{"8":0.00215,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00429,"6.0-6.1":0,"7.0-7.1":0.00572,"8.1-8.4":0.00072,"9.0-9.2":0.00215,"9.3":0.10304,"10.0-10.2":0.00572,"10.3":0.11019,"11.0-11.2":0.01574,"11.3-11.4":0.02147,"12.0-12.1":0.0186,"12.2-12.5":0.44221,"13.0-13.1":0.01216,"13.2":0.00787,"13.3":0.03578,"13.4-13.7":0.14526,"14.0-14.4":0.50732,"14.5-14.8":1.36955,"15.0-15.1":1.08047,"15.2-15.3":3.23427,"15.4":0.02504},P:{"4":0.05354,"5.0-5.4":0.04115,"6.2-6.4":0.02066,"7.2-7.4":0.07495,"8.2":0.01029,"9.2":0.01042,"10.1":0.06172,"11.1-11.2":0.05354,"12.0":0.01071,"13.0":0.05354,"14.0":0.08566,"15.0":0.05354,"16.0":1.12425},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00024,"4.2-4.3":0.00087,"4.4":0,"4.4.3-4.4.4":0.00839},A:{"11":0.07517,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.05697},Q:{"10.4":0},O:{"0":0.10445},H:{"0":0.11986},L:{"0":22.17812},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AO.js
new file mode 100644
index 0000000..fadd788
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AO.js
@@ -0,0 +1 @@
+module.exports={C:{"41":0.00903,"43":0.00452,"45":0.01355,"49":0.00452,"52":0.0903,"72":0.00452,"78":0.00903,"89":0.00903,"90":0.00452,"91":0.05418,"92":0.00452,"94":0.01355,"95":0.01806,"96":0.4199,"97":0.58695,_:"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 40 42 44 46 47 48 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 93 98 99 3.5 3.6"},D:{"11":0.03161,"26":0.00452,"29":0.00452,"33":0.00903,"34":0.00903,"38":0.00452,"40":0.01806,"42":0.01355,"43":0.14448,"46":0.01806,"47":0.00452,"49":0.01355,"55":0.00452,"58":0.01355,"59":0.04064,"63":0.05418,"65":0.01806,"67":0.00452,"69":0.04064,"70":0.00452,"71":0.00903,"72":0.00452,"74":0.01355,"75":0.04515,"76":0.00903,"77":0.00903,"78":0.01355,"79":0.13094,"80":0.06773,"81":0.07224,"83":0.01806,"84":0.03612,"85":0.01806,"86":0.17609,"87":0.19415,"88":0.02258,"89":0.0587,"90":0.02258,"91":0.19866,"92":0.11739,"93":0.18512,"94":0.04515,"95":0.0587,"96":0.37926,"97":6.33455,"98":15.45033,"99":0.11288,"100":0.00903,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 30 31 32 35 36 37 39 41 44 45 48 50 51 52 53 54 56 57 60 61 62 64 66 68 73 101"},F:{"34":0.00452,"71":0.01355,"79":0.03612,"82":0.17157,"83":1.61637,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.04967,"13":0.02258,"14":0.01806,"15":0.01355,"16":0.00903,"17":0.02258,"18":0.33411,"84":0.02709,"85":0.01355,"86":0.00903,"89":0.02258,"90":0.01806,"91":0.01355,"92":0.02258,"93":0.01806,"94":0.00903,"95":0.03161,"96":0.65016,"97":0.90752,"98":3.11084,_:"79 80 81 83 87 88"},E:{"4":0,"13":0.02709,"14":0.05418,"15":0.00903,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 9.1 11.1","7.1":0.03612,"10.1":0.00452,"12.1":0.01355,"13.1":0.05418,"14.1":0.13545,"15.1":0.04515,"15.2-15.3":0.15351,"15.4":0.01355},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00083,"6.0-6.1":0.00166,"7.0-7.1":0.06308,"8.1-8.4":0.01494,"9.0-9.2":0.01079,"9.3":0.14609,"10.0-10.2":0.01411,"10.3":0.28803,"11.0-11.2":0.07554,"11.3-11.4":0.05893,"12.0-12.1":0.03735,"12.2-12.5":2.25196,"13.0-13.1":0.00664,"13.2":0.00498,"13.3":0.10542,"13.4-13.7":0.23242,"14.0-14.4":0.635,"14.5-14.8":1.03343,"15.0-15.1":1.27082,"15.2-15.3":2.02784,"15.4":0.01743},P:{"4":1.55328,"5.0-5.4":0.04115,"6.2-6.4":0.02066,"7.2-7.4":0.22631,"8.2":0.01029,"9.2":0.02057,"10.1":0.06172,"11.1-11.2":0.07201,"12.0":0.02057,"13.0":0.19545,"14.0":0.17487,"15.0":0.17487,"16.0":0.84351},I:{"0":0,"3":0,"4":0.00221,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01485,"4.2-4.3":0.04603,"4.4":0,"4.4.3-4.4.4":0.13981},A:{"11":0.2393,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.02194},N:{_:"10 11"},R:{_:"0"},M:{"0":0.12065},Q:{"10.4":0},O:{"0":0.33452},H:{"0":1.77563},L:{"0":50.96663},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AR.js
new file mode 100644
index 0000000..5ad6d8d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AR.js
@@ -0,0 +1 @@
+module.exports={C:{"32":0.00392,"52":0.08234,"53":0.00392,"59":0.00784,"65":0.00392,"66":0.00784,"68":0.00784,"72":0.00392,"73":0.00392,"78":0.01961,"79":0.00392,"80":0.00784,"81":0.00392,"84":0.00784,"85":0.00392,"86":0.02745,"87":0.01176,"88":0.02745,"89":0.01176,"90":0.01568,"91":0.03921,"92":0.00392,"93":0.01176,"94":0.01176,"95":0.02745,"96":0.5411,"97":0.91751,"98":0.00784,_:"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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 54 55 56 57 58 60 61 62 63 64 67 69 70 71 74 75 76 77 82 83 99 3.5 3.6"},D:{"27":0.00392,"34":0.00784,"38":0.01961,"47":0.00784,"49":0.22742,"55":0.00784,"57":0.00392,"58":0.00784,"63":0.00784,"65":0.00392,"66":0.03529,"67":0.00392,"68":0.00392,"69":0.00392,"70":0.00784,"71":0.00784,"72":0.00392,"73":0.00784,"74":0.01176,"75":0.01176,"76":0.01176,"77":0.01176,"78":0.01176,"79":0.03529,"80":0.01568,"81":0.03529,"83":0.01961,"84":0.02353,"85":0.02353,"86":0.03921,"87":0.05097,"88":0.01961,"89":0.03921,"90":0.03137,"91":0.07842,"92":0.05097,"93":0.06274,"94":0.09018,"95":0.0745,"96":0.52541,"97":8.39486,"98":21.00872,"99":0.00784,"100":0.00784,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 48 50 51 52 53 54 56 59 60 61 62 64 101"},F:{"36":0.00784,"81":0.01176,"82":0.58031,"83":1.48998,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00784,"17":0.00784,"18":0.01176,"92":0.00784,"95":0.01176,"96":0.02353,"97":0.38818,"98":1.44685,_:"12 13 14 16 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,"13":0.01176,"14":0.03529,"15":0.02745,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.01176,"11.1":0.01568,"12.1":0.00784,"13.1":0.05489,"14.1":0.15684,"15.1":0.0745,"15.2-15.3":0.16076},G:{"8":0.00037,"3.2":0.0011,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01535,"6.0-6.1":0.00037,"7.0-7.1":0.00292,"8.1-8.4":0.00146,"9.0-9.2":0.0011,"9.3":0.02888,"10.0-10.2":0.00146,"10.3":0.02157,"11.0-11.2":0.00475,"11.3-11.4":0.03546,"12.0-12.1":0.00548,"12.2-12.5":0.19226,"13.0-13.1":0.00658,"13.2":0.00256,"13.3":0.01572,"13.4-13.7":0.06031,"14.0-14.4":0.13963,"14.5-14.8":0.67365,"15.0-15.1":0.53439,"15.2-15.3":1.90325,"15.4":0.00548},P:{"4":0.14583,"5.0-5.4":0.04115,"6.2-6.4":0.02066,"7.2-7.4":0.23957,"8.2":0.01029,"9.2":0.01042,"10.1":0.06172,"11.1-11.2":0.07291,"12.0":0.02083,"13.0":0.12499,"14.0":0.11458,"15.0":0.11458,"16.0":1.84365},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00285,"4.2-4.3":0.00456,"4.4":0,"4.4.3-4.4.4":0.04731},A:{"11":0.15684,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.1216},Q:{"10.4":0},O:{"0":0.0304},H:{"0":0.18995},L:{"0":49.10526},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AS.js
new file mode 100644
index 0000000..74572c1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AS.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01431,"78":0.01431,"82":0.00477,"96":0.17645,"97":0.24799,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 98 99 3.5 3.6"},D:{"75":0.02861,"76":0.02861,"77":0.00477,"79":0.41013,"83":0.04292,"84":0.01908,"85":0.02861,"86":0.00477,"87":0.03338,"88":0.03815,"90":0.01431,"91":0.17645,"92":0.06677,"93":0.04292,"94":0.04769,"95":0.01908,"96":1.43547,"97":6.91982,"98":8.89419,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 78 80 81 89 99 100 101"},F:{"82":0.02385,"83":0.01908,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.00477,"85":0.01431,"88":0.00954,"90":0.01431,"96":0.01431,"97":0.51505,"98":1.75976,_:"12 13 14 15 16 17 79 80 81 83 84 86 87 89 91 92 93 94 95"},E:{"4":0,"13":0.00954,"14":0.10015,"15":0.062,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.0763,"11.1":0.01431,"12.1":0.01908,"13.1":0.11923,"14.1":0.30522,"15.1":5.42235,"15.2-15.3":8.21222,"15.4":0.02385},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01252,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.04173,"9.0-9.2":0,"9.3":0.85959,"10.0-10.2":0,"10.3":0.00835,"11.0-11.2":0,"11.3-11.4":0.01252,"12.0-12.1":0.00417,"12.2-12.5":0.2295,"13.0-13.1":0,"13.2":0,"13.3":0.01669,"13.4-13.7":0.14605,"14.0-14.4":0.28792,"14.5-14.8":1.8694,"15.0-15.1":8.39143,"15.2-15.3":29.67669,"15.4":0.15022},P:{"4":0.0427,"5.0-5.4":0.35318,"6.2-6.4":0.02066,"7.2-7.4":0.01067,"8.2":0.01248,"9.2":0.01067,"10.1":0.02066,"11.1-11.2":0.12809,"12.0":0.02135,"13.0":0.18592,"14.0":0.01067,"15.0":0.29887,"16.0":1.05673},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.04292,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.01569},Q:{"10.4":0},O:{"0":0.01046},H:{"0":0.03467},L:{"0":10.26769},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AT.js
new file mode 100644
index 0000000..1ba1bd6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AT.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00578,"52":0.06355,"59":0.00578,"60":0.06932,"61":0.01733,"62":0.01733,"63":0.01155,"66":0.05777,"68":0.01155,"72":0.01155,"78":0.12709,"83":0.01155,"85":0.00578,"87":0.01155,"88":0.01733,"89":0.01733,"90":0.01733,"91":0.43905,"92":0.04622,"93":0.04044,"94":0.29463,"95":0.10976,"96":2.64009,"97":4.19988,"98":0.01155,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 64 65 67 69 70 71 73 74 75 76 77 79 80 81 82 84 86 99 3.5 3.6"},D:{"38":0.01733,"47":0.00578,"49":0.04622,"53":0.00578,"61":0.00578,"64":0.17909,"65":0.01155,"67":0.01155,"68":0.01155,"69":0.01155,"70":0.19642,"71":0.00578,"72":0.19064,"75":0.01155,"76":0.00578,"77":0.01155,"78":0.02889,"79":0.48527,"80":0.21375,"81":0.01733,"83":0.01733,"84":0.02889,"85":0.02889,"86":0.03466,"87":0.06932,"88":0.03466,"89":0.04044,"90":0.03466,"91":0.05199,"92":0.04622,"93":0.33507,"94":0.08088,"95":0.10976,"96":0.48527,"97":8.71749,"98":19.16809,"100":0.01155,_:"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 39 40 41 42 43 44 45 46 48 50 51 52 54 55 56 57 58 59 60 62 63 66 73 74 99 101"},F:{"46":0.00578,"80":0.00578,"82":0.67013,"83":1.92374,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00578,"18":0.03466,"84":0.01155,"85":0.00578,"88":0.01155,"89":0.00578,"90":0.01155,"91":0.00578,"92":0.02889,"93":0.00578,"94":0.04044,"95":0.06932,"96":0.14443,"97":2.02195,"98":6.73598,_:"12 13 14 15 16 79 80 81 83 86 87"},E:{"4":0,"8":0.00578,"12":0.00578,"13":0.04622,"14":0.36395,"15":0.2253,_:"0 5 6 7 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.01155,"11.1":0.05777,"12.1":0.06932,"13.1":0.33507,"14.1":1.14962,"15.1":0.68169,"15.2-15.3":1.27094,"15.4":0.01155},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00161,"6.0-6.1":0,"7.0-7.1":0.00484,"8.1-8.4":0.00484,"9.0-9.2":0.00323,"9.3":0.05811,"10.0-10.2":0.00161,"10.3":0.07103,"11.0-11.2":0.02744,"11.3-11.4":0.02099,"12.0-12.1":0.02583,"12.2-12.5":0.36159,"13.0-13.1":0.04036,"13.2":0.02099,"13.3":0.05004,"13.4-13.7":0.15658,"14.0-14.4":0.69251,"14.5-14.8":3.01058,"15.0-15.1":2.43914,"15.2-15.3":9.08341,"15.4":0.06134},P:{"4":0.15819,"5.0-5.4":0.01086,"6.2-6.4":0.02066,"7.2-7.4":0.23603,"8.2":0.01029,"9.2":0.01086,"10.1":0.06172,"11.1-11.2":0.04219,"12.0":0.02109,"13.0":0.12656,"14.0":0.08437,"15.0":0.08437,"16.0":3.44863},I:{"0":0,"3":0,"4":0.00106,"2.1":0,"2.2":0.00053,"2.3":0.00053,"4.1":0.00211,"4.2-4.3":0.00211,"4.4":0,"4.4.3-4.4.4":0.04434},A:{"11":0.38706,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.61656},Q:{"10.4":0},O:{"0":0.03801},H:{"0":0.38781},L:{"0":21.03817},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AU.js
new file mode 100644
index 0000000..e57e65d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AU.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.01736,"48":0.00579,"52":0.02894,"54":0.01736,"66":0.01157,"78":0.05787,"84":0.01157,"87":0.02315,"88":0.00579,"89":0.01157,"90":0.01157,"91":0.05208,"93":0.01736,"94":0.16204,"95":0.05208,"96":0.96064,"97":1.44096,"98":0.01157,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 55 56 57 58 59 60 61 62 63 64 65 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 92 99 3.5 3.6"},D:{"26":0.01157,"34":0.03472,"38":0.11574,"49":0.05787,"53":0.02894,"56":0.01157,"57":0.01157,"59":0.04051,"60":0.02894,"64":0.0463,"65":0.02315,"66":0.01157,"67":0.02315,"68":0.01736,"69":0.02315,"70":0.0463,"71":0.00579,"72":0.05208,"73":0.01157,"74":0.02894,"75":0.01736,"76":0.01736,"77":0.01157,"78":0.03472,"79":0.37037,"80":0.08681,"81":0.0463,"83":0.02894,"84":0.03472,"85":0.0463,"86":0.06944,"87":0.21412,"88":0.03472,"89":0.02894,"90":0.0463,"91":0.08102,"92":0.1794,"93":0.24305,"94":0.2662,"95":0.4456,"96":1.2037,"97":10.78697,"98":22.14685,"99":0.01157,"100":0.02315,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 58 61 62 63 101"},F:{"36":0.00579,"46":0.06366,"80":0.00579,"82":0.14468,"83":0.42245,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00579,"16":0.01157,"17":0.00579,"18":0.02315,"84":0.01157,"85":0.00579,"86":0.02315,"88":0.00579,"89":0.01736,"90":0.01157,"91":0.01157,"92":0.01736,"93":0.00579,"94":0.01157,"95":0.09838,"96":0.10417,"97":1.44096,"98":4.97103,_:"12 13 14 79 80 81 83 87"},E:{"4":0,"11":0.00579,"12":0.01736,"13":0.12731,"14":0.55555,"15":0.36458,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1","9.1":0.01157,"10.1":0.04051,"11.1":0.06366,"12.1":0.14468,"13.1":0.59027,"14.1":2.33795,"15.1":1.0706,"15.2-15.3":2.21642,"15.4":0.01157},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01973,"6.0-6.1":0.01315,"7.0-7.1":0.01315,"8.1-8.4":0.02192,"9.0-9.2":0.02631,"9.3":0.21483,"10.0-10.2":0.01973,"10.3":0.24113,"11.0-11.2":0.06796,"11.3-11.4":0.08549,"12.0-12.1":0.06357,"12.2-12.5":1.10701,"13.0-13.1":0.03727,"13.2":0.01754,"13.3":0.10961,"13.4-13.7":0.32005,"14.0-14.4":0.94699,"14.5-14.8":4.1935,"15.0-15.1":2.91112,"15.2-15.3":11.44718,"15.4":0.04823},P:{"4":0.78159,"5.0-5.4":0.01086,"6.2-6.4":0.02066,"7.2-7.4":0.23603,"8.2":0.01029,"9.2":0.01086,"10.1":0.06172,"11.1-11.2":0.03257,"12.0":0.02171,"13.0":0.08684,"14.0":0.0977,"15.0":0.10855,"16.0":2.56187},I:{"0":0,"3":0,"4":0.00291,"2.1":0,"2.2":0.00145,"2.3":0.00145,"4.1":0.00291,"4.2-4.3":0.00654,"4.4":0,"4.4.3-4.4.4":0.02688},A:{"8":0.01068,"9":0.01068,"11":0.3953,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.38347},Q:{"10.4":0.00843},O:{"0":0.08428},H:{"0":0.13165},L:{"0":16.1369},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AW.js
new file mode 100644
index 0000000..a445f9d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AW.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00728,"78":0.01821,"89":0.00364,"90":0.00728,"91":0.01457,"92":0.01093,"95":0.01093,"96":0.35692,"97":1.02704,"98":0.00728,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 93 94 99 3.5 3.6"},D:{"47":0.00728,"49":0.02185,"59":0.00364,"63":0.01093,"65":0.01093,"70":0.02549,"76":0.01093,"79":0.01093,"81":0.01093,"83":0.02549,"84":0.01093,"85":0.02185,"86":0.01457,"87":0.07284,"88":0.00728,"89":0.02185,"90":0.01093,"91":0.05827,"92":0.03642,"93":0.0437,"94":0.04735,"95":0.08377,"96":0.81217,"97":6.06393,"98":12.78342,"99":0.01093,_:"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 40 41 42 43 44 45 46 48 50 51 52 53 54 55 56 57 58 60 61 62 64 66 67 68 69 71 72 73 74 75 77 78 80 100 101"},F:{"63":0.00728,"82":0.08741,"83":0.36784,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.00728,"18":0.09105,"84":0.02549,"85":0.02549,"88":0.00728,"89":0.00728,"90":0.01457,"91":0.00728,"92":0.02549,"94":0.03278,"95":0.02549,"96":0.0437,"97":1.60248,"98":4.57435,_:"12 13 14 15 17 79 80 81 83 86 87 93"},E:{"4":0,"7":0.00364,"12":0.00364,"13":0.05099,"14":0.57908,"15":0.17117,_:"0 5 6 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.01457,"11.1":0.02914,"12.1":0.1384,"13.1":0.42976,"14.1":1.02704,"15.1":0.95785,"15.2-15.3":1.71174},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.06182,"10.0-10.2":0.00258,"10.3":0.10819,"11.0-11.2":0.00258,"11.3-11.4":0.03091,"12.0-12.1":0.04637,"12.2-12.5":0.45593,"13.0-13.1":0.00515,"13.2":0.00515,"13.3":0.04637,"13.4-13.7":0.22926,"14.0-14.4":0.92732,"14.5-14.8":4.37388,"15.0-15.1":3.85355,"15.2-15.3":15.50176,"15.4":0.09273},P:{"4":0.2463,"5.0-5.4":0.04115,"6.2-6.4":0.02066,"7.2-7.4":0.23603,"8.2":0.01029,"9.2":0.01026,"10.1":0.06172,"11.1-11.2":0.17446,"12.0":0.04105,"13.0":0.1642,"14.0":0.20525,"15.0":0.23603,"16.0":7.14256},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.15296,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.42599},Q:{"10.4":0},O:{"0":0.01272},H:{"0":0.13243},L:{"0":28.44422},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AX.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AX.js
new file mode 100644
index 0000000..e005f63
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AX.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.0186,"52":0.15503,"68":0.08681,"78":0.03101,"85":0.0062,"91":0.04341,"94":0.0186,"95":0.08681,"96":2.06493,"97":2.67263,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 86 87 88 89 90 92 93 98 99 3.5 3.6"},D:{"49":0.0186,"68":0.0124,"76":0.75032,"84":0.07441,"87":0.04961,"89":0.0124,"90":0.0124,"91":0.0062,"92":0.0124,"93":0.0062,"94":0.09922,"95":0.0124,"96":0.32245,"97":12.20977,"98":24.22731,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 77 78 79 80 81 83 85 86 88 99 100 101"},F:{"82":1.51304,"83":1.43243,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"96":0.03721,"97":2.38118,"98":5.71112,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95"},E:{"4":0,"13":0.03721,"14":0.32245,"15":0.6387,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.0186,"12.1":0.15503,"13.1":0.73172,"14.1":3.24932,"15.1":0.24184,"15.2-15.3":0.89294},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00108,"9.0-9.2":0.00216,"9.3":0.05624,"10.0-10.2":0.01947,"10.3":1.09559,"11.0-11.2":0.00649,"11.3-11.4":0.00108,"12.0-12.1":1.01123,"12.2-12.5":1.54767,"13.0-13.1":0.09085,"13.2":0.00649,"13.3":0.11356,"13.4-13.7":0.12546,"14.0-14.4":0.25416,"14.5-14.8":2.01273,"15.0-15.1":0.79925,"15.2-15.3":3.66423,"15.4":0.00324},P:{"4":1.2008,"5.0-5.4":0.35318,"6.2-6.4":0.35318,"7.2-7.4":0.03744,"8.2":0.01248,"9.2":0.29263,"10.1":0.02018,"11.1-11.2":0.25227,"12.0":0.02496,"13.0":0.07488,"14.0":0.03744,"15.0":0.04992,"16.0":3.05749},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.095},A:{"11":0.16123,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.3192},Q:{"10.4":0},O:{"0":0},H:{"0":0.05396},L:{"0":23.79411},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AZ.js
new file mode 100644
index 0000000..2e3d6d3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/AZ.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00983,"56":0.00328,"68":0.13432,"78":0.06552,"79":0.0131,"83":0.00655,"84":0.00655,"89":0.00983,"91":0.00983,"93":0.00655,"95":0.0131,"96":0.1638,"97":0.19984,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 80 81 82 85 86 87 88 90 92 94 98 99 3.5 3.6"},D:{"22":0.00655,"34":0.00328,"38":0.02948,"40":0.00328,"49":0.02621,"53":0.02948,"55":0.00328,"56":0.00655,"58":0.00328,"63":0.00655,"65":0.01638,"66":0.0131,"67":0.02621,"68":0.03604,"69":0.02621,"70":0.00983,"71":0.00655,"72":0.00983,"73":0.00328,"74":0.02621,"75":0.00328,"76":0.00328,"77":0.00983,"78":0.00983,"79":0.7502,"80":0.07207,"81":0.00655,"83":0.02293,"84":0.02621,"85":0.01966,"86":0.03931,"87":0.05897,"88":0.01966,"89":0.05569,"90":0.01638,"91":0.08845,"92":0.05897,"93":0.17363,"94":0.02948,"95":0.04914,"96":0.51761,"97":7.7805,"98":15.66911,"99":0.00655,"100":0.01638,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 41 42 43 44 45 46 47 48 50 51 52 54 57 59 60 61 62 64 101"},F:{"25":0.00655,"28":0.02621,"32":0.00328,"36":0.00655,"40":0.00655,"46":0.01966,"62":0.00655,"77":0.00328,"80":0.00983,"81":0.0131,"82":0.36691,"83":2.07043,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 26 27 29 30 31 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.02621,"84":0.00983,"92":0.00328,"94":0.00655,"95":0.00983,"96":0.00655,"97":0.2326,"98":0.74365,_:"12 13 14 15 16 17 79 80 81 83 85 86 87 88 89 90 91 93"},E:{"4":0,"13":0.00983,"14":0.10811,"15":0.04586,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1 15.4","5.1":0.04259,"12.1":0.03604,"13.1":0.07862,"14.1":0.27518,"15.1":0.13759,"15.2-15.3":0.20311},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00689,"6.0-6.1":0.00098,"7.0-7.1":0.03347,"8.1-8.4":0,"9.0-9.2":0.00394,"9.3":0.01181,"10.0-10.2":0.01378,"10.3":0.1073,"11.0-11.2":0.02461,"11.3-11.4":0.02953,"12.0-12.1":0.01181,"12.2-12.5":0.52272,"13.0-13.1":0.01969,"13.2":0.00788,"13.3":0.04824,"13.4-13.7":0.16833,"14.0-14.4":0.55816,"14.5-14.8":1.94027,"15.0-15.1":1.77292,"15.2-15.3":4.52829,"15.4":0.02658},P:{"4":0.62086,"5.0-5.4":0.01086,"6.2-6.4":0.02066,"7.2-7.4":0.08142,"8.2":0.01018,"9.2":0.01018,"10.1":0.01018,"11.1-11.2":0.12214,"12.0":0.04071,"13.0":0.19338,"14.0":0.25445,"15.0":0.21374,"16.0":3.27732},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00359,"4.2-4.3":0.00932,"4.4":0,"4.4.3-4.4.4":0.04088},A:{"11":0.05897,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.06052},Q:{"10.4":0},O:{"0":0.29586},H:{"0":0.55383},L:{"0":50.00176},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BA.js
new file mode 100644
index 0000000..bc1fecb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BA.js
@@ -0,0 +1 @@
+module.exports={C:{"36":0.007,"45":0.47264,"48":0.007,"52":0.62318,"66":0.007,"68":0.007,"71":0.0035,"72":0.007,"77":0.0035,"78":0.0105,"80":0.0035,"83":0.0035,"84":0.0035,"88":0.01751,"89":0.007,"91":0.01751,"92":0.0105,"93":0.014,"94":0.007,"95":0.04201,"96":1.07131,"97":1.68748,"98":0.007,_:"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 37 38 39 40 41 42 43 44 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 67 69 70 73 74 75 76 79 81 82 85 86 87 90 99 3.5 3.6"},D:{"38":0.014,"40":0.007,"42":0.0035,"43":0.007,"47":0.0105,"48":0.007,"49":0.15755,"51":0.0035,"53":0.03501,"55":0.0035,"63":0.0105,"65":0.007,"67":0.007,"68":0.0105,"70":0.02801,"71":0.0035,"72":0.0105,"73":0.007,"74":0.0105,"75":0.0035,"76":0.007,"77":0.014,"78":0.0105,"79":0.16455,"80":0.007,"81":0.02451,"83":0.01751,"84":0.04901,"85":0.02451,"86":0.03851,"87":0.09803,"88":0.01751,"89":0.04201,"90":0.03501,"91":0.04201,"92":0.04551,"93":0.55316,"94":0.14704,"95":0.04901,"96":0.40262,"97":6.79894,"98":16.19213,"99":0.01751,"100":0.0105,_:"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 39 41 44 45 46 50 52 54 56 57 58 59 60 61 62 64 66 69 101"},F:{"28":0.014,"36":0.007,"40":0.0105,"46":0.007,"67":0.007,"72":0.007,"82":0.29058,"83":1.28137,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.007,"17":0.0035,"18":0.0105,"84":0.007,"85":0.02801,"89":0.0035,"92":0.007,"95":0.014,"96":0.02101,"97":0.36761,"98":1.49843,_:"12 13 14 16 79 80 81 83 86 87 88 90 91 93 94"},E:{"4":0,"12":0.007,"13":0.0035,"14":0.04551,"15":0.01751,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 10.1 11.1 15.4","9.1":0.007,"12.1":0.02101,"13.1":0.04551,"14.1":0.15404,"15.1":0.08753,"15.2-15.3":0.12604},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00104,"6.0-6.1":0,"7.0-7.1":0.01509,"8.1-8.4":0,"9.0-9.2":0.00156,"9.3":0.07544,"10.0-10.2":0.00052,"10.3":0.04266,"11.0-11.2":0.00624,"11.3-11.4":0.00988,"12.0-12.1":0.00728,"12.2-12.5":0.27366,"13.0-13.1":0.00312,"13.2":0.00104,"13.3":0.01873,"13.4-13.7":0.06451,"14.0-14.4":0.20602,"14.5-14.8":1.11232,"15.0-15.1":0.68466,"15.2-15.3":2.65749,"15.4":0.01873},P:{"4":0.19504,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.06159,"8.2":0.02052,"9.2":0.02053,"10.1":0.01018,"11.1-11.2":0.09239,"12.0":0.02053,"13.0":0.10266,"14.0":0.09239,"15.0":0.08212,"16.0":2.30974},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00263,"4.2-4.3":0.01052,"4.4":0,"4.4.3-4.4.4":0.09735},A:{"11":0.06302,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.208},Q:{"10.4":0},O:{"0":0.026},H:{"0":0.20307},L:{"0":48.43978},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BB.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BB.js
new file mode 100644
index 0000000..eb29c49
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BB.js
@@ -0,0 +1 @@
+module.exports={C:{"45":0.0092,"52":0.0092,"78":0.0184,"80":0.0092,"87":0.0276,"89":0.0276,"91":0.0092,"95":0.0322,"96":0.7912,"97":1.2512,_:"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 40 41 42 43 44 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 81 82 83 84 85 86 88 90 92 93 94 98 99 3.5 3.6"},D:{"49":0.0138,"50":0.0138,"72":0.0046,"74":0.0092,"75":0.0092,"76":0.0368,"77":0.0092,"79":0.345,"80":0.0092,"81":0.0414,"83":0.0138,"85":0.0138,"86":0.0184,"87":0.1012,"88":0.0138,"89":0.0092,"90":0.0046,"91":0.046,"92":0.0322,"93":0.1288,"94":0.0874,"95":0.0368,"96":0.4094,"97":9.6968,"98":18.6484,"99":0.0138,"100":0.023,_:"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 40 41 42 43 44 45 46 47 48 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 78 84 101"},F:{"82":0.1518,"83":0.7038,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.0092,"17":0.0184,"18":0.023,"91":0.0046,"92":0.0046,"94":0.0138,"95":0.0092,"96":0.0782,"97":1.5962,"98":5.2394,_:"12 13 14 15 79 80 81 83 84 85 86 87 88 89 90 93"},E:{"4":0.0092,"13":0.0138,"14":0.1242,"15":0.0782,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.0598,"11.1":0.0138,"12.1":0.0322,"13.1":0.1518,"14.1":0.8648,"15.1":0.6762,"15.2-15.3":1.0488,"15.4":0.0138},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.05018,"6.0-6.1":0,"7.0-7.1":0.00878,"8.1-8.4":0,"9.0-9.2":0.00125,"9.3":0.0966,"10.0-10.2":0,"10.3":0.05269,"11.0-11.2":0.00502,"11.3-11.4":0.00878,"12.0-12.1":0.00753,"12.2-12.5":0.82045,"13.0-13.1":0.03136,"13.2":0.00251,"13.3":0.01882,"13.4-13.7":0.06273,"14.0-14.4":0.51184,"14.5-14.8":1.78516,"15.0-15.1":1.73624,"15.2-15.3":7.27991,"15.4":0.05896},P:{"4":0.2516,"5.0-5.4":0.01086,"6.2-6.4":0.02079,"7.2-7.4":0.26254,"8.2":0.02052,"9.2":0.0104,"10.1":0.01018,"11.1-11.2":0.12033,"12.0":0.01094,"13.0":0.07658,"14.0":0.21879,"15.0":0.28442,"16.0":4.2882},I:{"0":0,"3":0,"4":0.00085,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00057,"4.2-4.3":0.00114,"4.4":0,"4.4.3-4.4.4":0.02444},A:{"10":0.0368,"11":0.092,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.0216},N:{_:"10 11"},R:{_:"0"},M:{"0":0.5562},Q:{"10.4":0},O:{"0":0.0378},H:{"0":0.07157},L:{"0":33.1902},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BD.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BD.js
new file mode 100644
index 0000000..e0d5e1e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BD.js
@@ -0,0 +1 @@
+module.exports={C:{"11":0.00817,"40":0.01905,"41":0.00272,"43":0.00544,"47":0.01089,"48":0.00272,"49":0.00272,"50":0.00817,"52":0.049,"56":0.00817,"57":0.00272,"68":0.00544,"72":0.00817,"78":0.02722,"79":0.00544,"80":0.00544,"81":0.00544,"82":0.00544,"84":0.00544,"86":0.00272,"87":0.00272,"88":0.00817,"89":0.01361,"90":0.00272,"91":0.03266,"92":0.01361,"93":0.01089,"94":0.00817,"95":0.03266,"96":0.89009,"97":1.70669,"98":0.16876,_:"2 3 4 5 6 7 8 9 10 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 42 44 45 46 51 53 54 55 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 83 85 99 3.5 3.6"},D:{"38":0.00544,"39":0.00272,"43":0.00544,"47":0.00272,"49":0.00817,"50":0.00272,"53":0.00544,"55":0.00272,"56":0.00817,"62":0.00272,"63":0.00544,"64":0.01361,"65":0.00544,"66":0.00544,"67":0.00272,"69":0.00817,"70":0.00817,"71":0.00544,"72":0.00272,"73":0.00817,"74":0.00817,"75":0.00272,"76":0.00544,"77":0.00544,"78":0.00817,"79":0.02722,"80":0.01633,"81":0.02178,"83":0.02722,"84":0.04083,"85":0.02994,"86":0.06533,"87":0.07349,"88":0.01089,"89":0.03266,"90":0.02178,"91":0.02994,"92":0.05444,"93":0.16876,"94":0.03811,"95":0.049,"96":0.25042,"97":4.55118,"98":12.09112,"99":0.03539,"100":0.04083,_:"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 40 41 42 44 45 46 48 51 52 54 57 58 59 60 61 68 101"},F:{"28":0.00817,"29":0.00544,"36":0.00817,"46":0.00544,"67":0.00817,"71":0.00272,"80":0.00272,"82":0.06805,"83":0.51174,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00817,"16":0.00272,"18":0.01361,"84":0.00544,"85":0.00272,"89":0.00544,"92":0.01089,"95":0.00544,"96":0.01361,"97":0.22593,"98":0.84382,_:"13 14 15 17 79 80 81 83 86 87 88 90 91 93 94"},E:{"4":0,"13":0.00817,"14":0.01633,"15":0.01089,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 15.4","12.1":0.00272,"13.1":0.01089,"14.1":0.04627,"15.1":0.02994,"15.2-15.3":0.0871},G:{"8":0,"3.2":0.0008,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00723,"6.0-6.1":0.0002,"7.0-7.1":0.05405,"8.1-8.4":0.001,"9.0-9.2":0.00181,"9.3":0.02733,"10.0-10.2":0.001,"10.3":0.02934,"11.0-11.2":0.00442,"11.3-11.4":0.00342,"12.0-12.1":0.00482,"12.2-12.5":0.1704,"13.0-13.1":0.00422,"13.2":0.00141,"13.3":0.01186,"13.4-13.7":0.03597,"14.0-14.4":0.08641,"14.5-14.8":0.24998,"15.0-15.1":0.30624,"15.2-15.3":0.99528,"15.4":0.01125},P:{"4":0.33266,"5.0-5.4":0.01086,"6.2-6.4":0.02079,"7.2-7.4":0.10396,"8.2":0.02052,"9.2":0.0104,"10.1":0.01018,"11.1-11.2":0.03119,"12.0":0.02079,"13.0":0.08317,"14.0":0.07277,"15.0":0.05198,"16.0":0.65493},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00228,"4.2-4.3":0.00683,"4.4":0,"4.4.3-4.4.4":0.18738},A:{"8":0.01221,"9":0.0061,"11":0.0824,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.11643},Q:{"10.4":0},O:{"0":2.93263},H:{"0":2.31484},L:{"0":65.76212},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BE.js
new file mode 100644
index 0000000..25f4a1b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BE.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00665,"52":0.03988,"56":0.01994,"68":0.01329,"72":0.00665,"78":0.09304,"84":0.02658,"87":0.11963,"88":0.00665,"89":0.01329,"90":0.01994,"91":0.10634,"92":0.00665,"94":0.01994,"95":0.05981,"96":1.33585,"97":2.12007,"98":0.00665,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 79 80 81 82 83 85 86 93 99 3.5 3.6"},D:{"49":0.05981,"60":0.01329,"65":0.00665,"66":0.02658,"67":0.01994,"69":0.00665,"74":0.03323,"75":0.03988,"76":0.03323,"77":0.03988,"78":0.37218,"79":0.51839,"80":0.03988,"81":0.01329,"83":0.15286,"84":0.01994,"85":0.02658,"86":0.03988,"87":0.15286,"88":0.03323,"89":0.0864,"90":0.03988,"91":0.07975,"92":0.07311,"93":0.14621,"94":0.16615,"95":0.10634,"96":0.79087,"97":14.61455,"98":26.43114,"99":0.01329,"100":0.02658,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 61 62 63 64 68 70 71 72 73 101"},F:{"82":0.20603,"83":0.63137,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01994,"85":0.00665,"86":0.01994,"89":0.00665,"90":0.01329,"91":0.00665,"92":0.01994,"93":0.00665,"94":0.01994,"95":0.03323,"96":0.18609,"97":2.91095,"98":7.56979,_:"12 13 14 15 16 17 79 80 81 83 84 87 88"},E:{"4":0,"11":0.01329,"12":0.00665,"13":0.07311,"14":0.31901,"15":0.20603,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.01329,"11.1":0.03988,"12.1":0.09304,"13.1":0.39876,"14.1":1.12317,"15.1":0.65795,"15.2-15.3":1.46212,"15.4":0.01329},G:{"8":0.00135,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00135,"8.1-8.4":0.00812,"9.0-9.2":0,"9.3":0.05279,"10.0-10.2":0.00406,"10.3":0.11235,"11.0-11.2":0.0176,"11.3-11.4":0.03519,"12.0-12.1":0.01489,"12.2-12.5":0.40338,"13.0-13.1":0.02301,"13.2":0.00677,"13.3":0.04467,"13.4-13.7":0.14619,"14.0-14.4":0.53874,"14.5-14.8":2.4893,"15.0-15.1":2.11976,"15.2-15.3":7.47196,"15.4":0.03519},P:{"4":0.08548,"5.0-5.4":0.01086,"6.2-6.4":0.18286,"7.2-7.4":0.26254,"8.2":0.02052,"9.2":0.0104,"10.1":0.01018,"11.1-11.2":0.02137,"12.0":0.02137,"13.0":0.05342,"14.0":0.07479,"15.0":0.05342,"16.0":2.68191},I:{"0":0,"3":0,"4":0.00152,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00152,"4.2-4.3":0.0038,"4.4":0,"4.4.3-4.4.4":0.03341},A:{"11":0.31901,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.22136},Q:{"10.4":0},O:{"0":0.02012},H:{"0":0.09526},L:{"0":16.38523},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BF.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BF.js
new file mode 100644
index 0000000..a7dc5ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BF.js
@@ -0,0 +1 @@
+module.exports={C:{"32":0.00447,"39":0.00223,"40":0.00223,"41":0.00447,"43":0.0067,"47":0.0201,"48":0.0067,"49":0.00447,"50":0.00223,"52":0.0335,"56":0.00893,"60":0.0067,"66":0.00223,"68":0.00447,"72":0.02233,"75":0.01563,"76":0.0067,"78":0.01563,"81":0.00223,"82":0.00223,"84":0.0067,"86":0.00223,"88":0.00223,"89":0.0067,"90":0.0067,"91":0.25903,"92":0.00893,"93":0.0067,"94":0.29699,"95":0.04019,"96":1.12543,"97":1.96504,"98":0.01786,_:"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 33 34 35 36 37 38 42 44 45 46 51 53 54 55 57 58 59 61 62 63 64 65 67 69 70 71 73 74 77 79 80 83 85 87 99 3.5 3.6"},D:{"25":0.00447,"33":0.00893,"37":0.00223,"39":0.14291,"47":0.00223,"49":0.0201,"50":0.05583,"53":0.00223,"55":0.0067,"57":0.00447,"59":0.00893,"60":0.0201,"62":0.01117,"63":0.01117,"64":0.00893,"68":0.00223,"69":0.01117,"74":0.02233,"75":0.0067,"76":0.0268,"77":0.0201,"78":0.00447,"79":0.02233,"80":0.00893,"81":0.02903,"83":0.01117,"84":0.00893,"85":0.00893,"86":0.02233,"87":0.04689,"88":0.02233,"89":0.01117,"90":0.00893,"91":0.03573,"92":0.04243,"93":0.03126,"94":0.01786,"95":0.03126,"96":0.36398,"97":2.52106,"98":5.96211,"99":0.03573,"100":0.00447,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 32 34 35 36 38 40 41 42 43 44 45 46 48 51 52 54 56 58 61 65 66 67 70 71 72 73 101"},F:{"78":0.01117,"79":0.00893,"80":0.0067,"82":0.04466,"83":0.52476,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.02233,"13":0.01117,"14":0.0067,"15":0.00447,"16":0.0067,"17":0.01117,"18":0.07146,"84":0.01786,"85":0.01117,"89":0.0067,"90":0.00447,"91":0.00223,"92":0.02233,"93":0.01117,"94":0.0067,"95":0.01117,"96":0.02903,"97":0.49573,"98":1.52514,_:"79 80 81 83 86 87 88"},E:{"4":0,"13":0.00447,"14":0.0201,_:"0 5 6 7 8 9 10 11 12 15 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.00893,"11.1":0.00447,"12.1":0.00447,"13.1":0.0134,"14.1":0.04019,"15.1":0.40864,"15.2-15.3":0.04019},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00548,"8.1-8.4":0.00398,"9.0-9.2":0,"9.3":0.03685,"10.0-10.2":0.00548,"10.3":0.03984,"11.0-11.2":0.05329,"11.3-11.4":0.01693,"12.0-12.1":0.0239,"12.2-12.5":0.65489,"13.0-13.1":0.01743,"13.2":0.00349,"13.3":0.06275,"13.4-13.7":0.13845,"14.0-14.4":0.73855,"14.5-14.8":0.6021,"15.0-15.1":0.51694,"15.2-15.3":2.04734,"15.4":0.01096},P:{"4":0.05347,"5.0-5.4":0.1009,"6.2-6.4":0.01048,"7.2-7.4":0.07486,"8.2":0.02052,"9.2":0.11763,"10.1":0.07486,"11.1-11.2":0.43844,"12.0":0.03144,"13.0":0.03208,"14.0":0.02139,"15.0":0.08555,"16.0":0.57746},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00223,"4.2-4.3":0.00614,"4.4":0,"4.4.3-4.4.4":0.15473},A:{"11":0.13175,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00777},N:{_:"10 11"},R:{_:"0"},M:{"0":0.08544},Q:{"10.4":0.06214},O:{"0":0.83884},H:{"0":4.08843},L:{"0":69.51414},S:{"2.5":0.00777}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BG.js
new file mode 100644
index 0000000..30dd0b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BG.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00435,"51":0.00435,"52":0.19987,"56":0.00869,"60":0.00869,"63":0.01304,"66":0.01738,"67":0.01304,"68":0.0869,"72":0.01304,"78":0.04345,"79":0.00869,"80":0.02607,"81":0.00869,"83":0.00869,"84":0.01738,"85":0.01304,"86":0.00869,"87":0.03042,"88":0.02607,"89":0.0478,"90":0.00869,"91":0.13035,"92":0.00869,"93":0.01304,"94":0.05214,"95":0.0869,"96":2.08995,"97":3.37172,"98":0.02173,_:"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 40 41 42 43 44 45 46 47 49 50 53 54 55 57 58 59 61 62 64 65 69 70 71 73 74 75 76 77 82 99 3.5 3.6"},D:{"38":0.00869,"48":0.01738,"49":0.21291,"50":0.00435,"51":0.25636,"56":0.00869,"58":0.00435,"63":0.00869,"66":0.00435,"67":0.00869,"68":0.00435,"69":0.03042,"70":0.00869,"71":0.01304,"73":0.01304,"74":0.00869,"75":0.00869,"76":0.00435,"77":0.01304,"78":0.00869,"79":0.3085,"80":0.01738,"81":0.03911,"83":0.01738,"84":0.02173,"85":0.02173,"86":0.02607,"87":0.05214,"88":0.01738,"89":0.03042,"90":0.02173,"91":0.07387,"92":0.06083,"93":0.5214,"94":0.03911,"95":0.06518,"96":0.37367,"97":8.38151,"98":19.03979,"99":0.01304,"100":0.01738,_:"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 39 40 41 42 43 44 45 46 47 52 53 54 55 57 59 60 61 62 64 65 72 101"},F:{"28":0.00869,"36":0.00869,"46":0.01738,"78":0.00869,"79":0.00435,"80":0.00869,"82":0.33022,"83":1.31219,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00435,"17":0.01304,"18":0.02607,"84":0.00869,"90":0.00435,"92":0.00435,"94":0.00435,"95":0.01304,"96":0.02607,"97":0.60396,"98":2.15078,_:"12 13 14 16 79 80 81 83 85 86 87 88 89 91 93"},E:{"4":0,"13":0.01304,"14":0.05649,"15":0.03911,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00869,"12.1":0.02607,"13.1":0.05214,"14.1":0.16946,"15.1":0.09125,"15.2-15.3":0.19553},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00223,"6.0-6.1":0.00074,"7.0-7.1":0.0052,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02004,"10.0-10.2":0.00297,"10.3":0.05642,"11.0-11.2":0.01336,"11.3-11.4":0.01262,"12.0-12.1":0.01262,"12.2-12.5":0.24422,"13.0-13.1":0.00965,"13.2":0.00371,"13.3":0.03415,"13.4-13.7":0.1106,"14.0-14.4":0.29915,"14.5-14.8":1.39628,"15.0-15.1":1.06595,"15.2-15.3":4.1057,"15.4":0.02375},P:{"4":0.09432,"5.0-5.4":0.1009,"6.2-6.4":0.01048,"7.2-7.4":0.07394,"8.2":0.02052,"9.2":0.01025,"10.1":0.02113,"11.1-11.2":0.07336,"12.0":0.03144,"13.0":0.09432,"14.0":0.13624,"15.0":0.1048,"16.0":2.09594},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00393,"4.2-4.3":0.01702,"4.4":0,"4.4.3-4.4.4":0.10346},A:{"11":0.42581,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.18662},Q:{"10.4":0},O:{"0":0.02828},H:{"0":0.25163},L:{"0":46.22418},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BH.js
new file mode 100644
index 0000000..3d30f51
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BH.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00399,"36":0.00798,"52":0.01595,"60":0.00399,"78":0.00798,"79":0.00798,"83":0.03589,"91":0.01196,"95":0.01595,"96":0.34696,"97":0.65004,"98":0.00798,_:"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 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 80 81 82 84 85 86 87 88 89 90 92 93 94 99 3.5 3.6"},D:{"38":0.00798,"39":0.00399,"49":0.02393,"50":0.00399,"55":0.00399,"56":0.00798,"60":0.03988,"62":0.00399,"63":0.00399,"64":0.00399,"65":0.02393,"66":0.01994,"67":0.01994,"68":0.00399,"69":0.00798,"70":0.01196,"71":0.01196,"73":0.01994,"74":0.00798,"75":0.00399,"76":0.00399,"77":0.00798,"78":0.00798,"79":0.07178,"80":0.00798,"81":0.00798,"83":0.01196,"84":0.01994,"85":0.00798,"86":0.03589,"87":0.06381,"88":0.01196,"89":0.01595,"90":0.05583,"91":0.02792,"92":0.0319,"93":0.42672,"94":0.04786,"95":0.03988,"96":0.48255,"97":8.09963,"98":20.29892,"99":0.01196,"100":0.00798,_:"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 40 41 42 43 44 45 46 47 48 51 52 53 54 57 58 59 61 72 101"},F:{"28":0.00399,"36":0.01595,"46":0.00798,"53":0.00798,"54":0.00798,"70":0.01595,"77":0.00798,"78":0.0319,"79":0.02393,"81":0.0678,"82":0.21934,"83":0.2313,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 55 56 57 58 60 62 63 64 65 66 67 68 69 71 72 73 74 75 76 80 10.5 10.6 11.1 11.5 11.6 12.1","9.5-9.6":0.00399,"10.0-10.1":0},B:{"15":0.00798,"16":0.00798,"17":0.00399,"18":0.02393,"84":0.00399,"89":0.00798,"92":0.00798,"94":0.00399,"95":0.01595,"96":0.02792,"97":0.83349,"98":2.84743,_:"12 13 14 79 80 81 83 85 86 87 88 90 91 93"},E:{"4":0,"11":0.00399,"13":0.03988,"14":0.25922,"15":0.17148,_:"0 5 6 7 8 9 10 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00798,"11.1":0.01595,"12.1":0.05583,"13.1":0.17547,"14.1":0.80159,"15.1":0.41874,"15.2-15.3":0.67796,"15.4":0.00798},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0056,"6.0-6.1":0,"7.0-7.1":0.0112,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.09523,"10.0-10.2":0,"10.3":0.05975,"11.0-11.2":0.03174,"11.3-11.4":0.07095,"12.0-12.1":0.04108,"12.2-12.5":0.38837,"13.0-13.1":0.03921,"13.2":0.0112,"13.3":0.07282,"13.4-13.7":0.25767,"14.0-14.4":0.76554,"14.5-14.8":3.26197,"15.0-15.1":3.67461,"15.2-15.3":9.7859,"15.4":0.09149},P:{"4":0.16415,"5.0-5.4":0.01086,"6.2-6.4":0.02066,"7.2-7.4":0.0513,"8.2":0.02052,"9.2":0.02052,"10.1":0.01018,"11.1-11.2":0.22571,"12.0":0.03078,"13.0":0.12311,"14.0":0.14363,"15.0":0.15389,"16.0":2.87263},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0022,"4.4":0,"4.4.3-4.4.4":0.01584},A:{"11":0.15952,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.22849},Q:{"10.4":0},O:{"0":2.47736},H:{"0":0.60343},L:{"0":34.31125},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BI.js
new file mode 100644
index 0000000..ab17815
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BI.js
@@ -0,0 +1 @@
+module.exports={C:{"7":0.00542,"28":0.00542,"31":0.05416,"43":0.00542,"44":0.00271,"47":0.05145,"49":0.00271,"52":0.01083,"56":0.00542,"68":0.00542,"71":0.00812,"72":0.00542,"77":0.00271,"78":0.00542,"84":0.01354,"88":0.02979,"89":0.00542,"91":0.04604,"92":0.00542,"93":0.00271,"94":0.01896,"95":0.02979,"96":1.10486,"97":1.66813,"98":0.06499,_:"2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 32 33 34 35 36 37 38 39 40 41 42 45 46 48 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 69 70 73 74 75 76 79 80 81 82 83 85 86 87 90 99 3.5 3.6"},D:{"26":0.00812,"36":0.00812,"40":0.01625,"43":0.00542,"49":0.03791,"52":0.00542,"56":0.02437,"63":0.00812,"64":0.05958,"70":0.00812,"73":0.01625,"74":0.01083,"76":0.00542,"77":0.00542,"80":0.07853,"81":0.53077,"83":0.01354,"84":0.01354,"85":0.00542,"86":0.02708,"87":0.03791,"88":0.0352,"89":0.01625,"90":0.01896,"91":0.02708,"92":0.1029,"93":0.02708,"94":0.04333,"95":0.08124,"96":0.37641,"97":4.93939,"98":9.25594,"99":0.01083,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 34 35 37 38 39 41 42 44 45 46 47 48 50 51 53 54 55 57 58 59 60 61 62 65 66 67 68 69 71 72 75 78 79 100 101"},F:{"31":0.00271,"37":0.00542,"42":0.00812,"64":0.00542,"67":0.00542,"82":0.14894,"83":0.97759,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 36 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 65 66 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.07582,"13":0.02166,"14":0.01083,"15":0.00542,"16":0.00812,"17":0.02979,"18":0.11374,"84":0.01896,"85":0.00542,"89":0.01083,"91":0.00271,"92":0.04874,"93":0.00542,"94":0.05958,"95":0.0352,"96":0.02437,"97":0.75553,"98":1.24568,_:"79 80 81 83 86 87 88 90"},E:{"4":0,"12":0.00542,"13":0.01354,"14":0.01625,"15":0.00542,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.02437,"12.1":0.01625,"13.1":0.05145,"14.1":0.07312,"15.1":0.04333,"15.2-15.3":0.04062,"15.4":0.01083},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00072,"6.0-6.1":0,"7.0-7.1":0.00072,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01805,"10.0-10.2":0.00072,"10.3":0.36673,"11.0-11.2":0.01444,"11.3-11.4":0.00433,"12.0-12.1":0.0231,"12.2-12.5":0.7266,"13.0-13.1":0.00758,"13.2":0.01011,"13.3":0.08374,"13.4-13.7":0.07941,"14.0-14.4":0.73454,"14.5-14.8":0.76631,"15.0-15.1":0.30248,"15.2-15.3":0.46888,"15.4":0.00108},P:{"4":1.47807,"5.0-5.4":0.04049,"6.2-6.4":0.01048,"7.2-7.4":0.09111,"8.2":0.02052,"9.2":0.22272,"10.1":0.06074,"11.1-11.2":0.06074,"12.0":0.30371,"13.0":0.01012,"14.0":0.02025,"15.0":3.53319,"16.0":1.29584},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00133,"4.1":0.00267,"4.2-4.3":0.01932,"4.4":0,"4.4.3-4.4.4":0.10794},A:{"11":0.11374,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00729},N:{_:"10 11"},R:{_:"0"},M:{"0":0.08021},Q:{"10.4":0.01458},O:{"0":0.17501},H:{"0":14.33877},L:{"0":50.0552},S:{"2.5":0.02188}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BJ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BJ.js
new file mode 100644
index 0000000..338a049
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BJ.js
@@ -0,0 +1 @@
+module.exports={C:{"35":0.00291,"43":0.00291,"45":0.00582,"49":0.00582,"52":0.01745,"56":0.00291,"60":0.00291,"66":0.00291,"72":0.01455,"75":0.01455,"78":0.02327,"79":0.00873,"80":0.00582,"84":0.00582,"85":0.06982,"86":0.00873,"87":0.00291,"88":0.00873,"89":0.01164,"90":0.00582,"91":0.07273,"92":0.00873,"93":0.00582,"94":0.02036,"95":0.05236,"96":0.72725,"97":1.06179,"98":0.03491,_:"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 36 37 38 39 40 41 42 44 46 47 48 50 51 53 54 55 57 58 59 61 62 63 64 65 67 68 69 70 71 73 74 76 77 81 82 83 99 3.5 3.6"},D:{"31":0.00291,"32":0.01164,"33":0.00582,"44":0.00582,"45":0.00291,"47":0.00873,"49":0.05527,"50":0.00291,"53":0.00873,"57":0.00582,"58":0.00582,"59":0.00291,"60":0.00291,"61":0.00291,"62":0.02036,"63":0.18327,"64":0.05236,"65":0.00582,"67":0.00873,"68":0.00582,"69":0.00582,"70":0.01455,"71":0.00582,"72":0.01164,"74":0.02327,"75":0.01455,"76":0.01745,"77":0.032,"78":0.01745,"79":0.01455,"80":0.04654,"81":0.02036,"83":0.02327,"84":0.01164,"85":0.02036,"86":0.08436,"87":0.05527,"88":0.05527,"89":0.02909,"90":0.04073,"91":0.10182,"92":0.23272,"93":0.07854,"94":0.19781,"95":0.32581,"96":0.50035,"97":4.31987,"98":11.0222,"99":0.01745,"100":0.02618,_:"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 34 35 36 37 38 39 40 41 42 43 46 48 51 52 54 55 56 66 73 101"},F:{"15":0.00291,"57":0.04654,"71":0.01164,"79":0.01455,"80":0.00582,"81":0.00582,"82":0.08145,"83":0.7447,_:"9 11 12 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 58 60 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01745,"13":0.00582,"14":0.00582,"15":0.00582,"16":0.00582,"17":0.00873,"18":0.04654,"84":0.00873,"85":0.00873,"89":0.01745,"90":0.01164,"91":0.01455,"92":0.02618,"94":0.00291,"95":0.00582,"96":0.03491,"97":0.34617,"98":0.94252,_:"79 80 81 83 86 87 88 93"},E:{"4":0,"14":0.02909,"15":0.00873,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 6.1 7.1 9.1 10.1 11.1","5.1":0.02327,"12.1":0.01164,"13.1":0.05527,"14.1":0.04073,"15.1":0.064,"15.2-15.3":0.06109,"15.4":0.00582},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00131,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00916,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01308,"10.0-10.2":0,"10.3":0.00916,"11.0-11.2":0.03139,"11.3-11.4":0.00327,"12.0-12.1":0.19033,"12.2-12.5":1.80911,"13.0-13.1":0.02485,"13.2":0.00262,"13.3":0.55791,"13.4-13.7":0.15174,"14.0-14.4":0.51539,"14.5-14.8":0.91763,"15.0-15.1":0.88101,"15.2-15.3":1.41341,"15.4":0.00654},P:{"4":0.03363,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.01121,"8.2":0.02052,"9.2":0.04485,"10.1":0.01018,"11.1-11.2":0.21994,"12.0":0.02137,"13.0":0.23544,"14.0":0.01121,"15.0":0.02242,"16.0":0.36998},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00046,"4.2-4.3":0.00161,"4.4":0,"4.4.3-4.4.4":0.02629},A:{"9":0.01473,"11":0.06382,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.19146},Q:{"10.4":0.13473},O:{"0":0.65237},H:{"0":4.06826},L:{"0":62.8251},S:{"2.5":0.04255}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BM.js
new file mode 100644
index 0000000..c1fc94d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BM.js
@@ -0,0 +1 @@
+module.exports={C:{"78":0.06489,"88":0.00433,"92":0.00433,"95":0.0173,"96":0.34608,"97":0.51479,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 89 90 91 93 94 98 99 3.5 3.6"},D:{"49":0.0173,"63":0.00865,"67":0.00865,"71":0.00865,"76":0.00433,"77":0.06056,"78":0.03461,"79":0.01298,"80":0.00433,"83":0.02163,"85":0.0173,"86":0.01298,"87":0.05624,"88":0.0173,"89":0.00865,"90":0.02163,"91":0.8479,"92":0.02163,"93":0.06922,"94":0.20332,"95":0.03893,"96":0.57968,"97":6.46304,"98":11.18704,"99":0.01298,"100":0.00865,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 65 66 68 69 70 72 73 74 75 81 84 101"},F:{"82":0.42395,"83":0.73542,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01298,"91":0.01298,"92":0.00865,"95":0.05191,"96":0.05191,"97":1.15504,"98":4.04914,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 93 94"},E:{"4":0,"13":0.05624,"14":0.199,"15":0.20765,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.42827,"11.1":0.00865,"12.1":0.04759,"13.1":0.59266,"14.1":1.37134,"15.1":1.9467,"15.2-15.3":6.10399,"15.4":0.07354},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.12849,"10.0-10.2":0,"10.3":0.08719,"11.0-11.2":0,"11.3-11.4":0.00459,"12.0-12.1":0.02295,"12.2-12.5":0.73884,"13.0-13.1":0.00918,"13.2":0,"13.3":0.01377,"13.4-13.7":0.35795,"14.0-14.4":0.69295,"14.5-14.8":2.8911,"15.0-15.1":6.52563,"15.2-15.3":34.22971,"15.4":0.16062},P:{"4":0.1356,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.01121,"8.2":0.02052,"9.2":0.04485,"10.1":0.01018,"11.1-11.2":0.03129,"12.0":0.02137,"13.0":0.02086,"14.0":0.08344,"15.0":0.04172,"16.0":2.13825},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.29417,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.04539},Q:{"10.4":0},O:{"0":0.03972},H:{"0":0.02149},L:{"0":8.30905},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BN.js
new file mode 100644
index 0000000..66628cb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BN.js
@@ -0,0 +1 @@
+module.exports={C:{"29":0.01254,"32":0.00418,"48":0.01672,"52":0.02926,"72":0.00836,"78":0.01254,"84":0.0209,"89":0.01254,"91":0.00418,"93":0.00418,"94":0.01254,"95":0.0209,"96":0.79838,"97":1.55496,"98":0.06688,_:"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 30 31 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 85 86 87 88 90 92 99 3.5 3.6"},D:{"22":0.0209,"26":0.00836,"33":0.00836,"38":0.1045,"47":0.11704,"49":0.21736,"53":0.04598,"55":0.03344,"62":0.05434,"65":0.06688,"67":0.00836,"68":0.00836,"70":0.00836,"72":0.02926,"73":0.03344,"74":0.00836,"75":0.0209,"76":0.00418,"77":0.00836,"78":0.02508,"79":0.16302,"80":0.02508,"81":0.04598,"83":0.0209,"84":0.01672,"85":0.00836,"86":0.00418,"87":0.15884,"88":0.00836,"89":0.02508,"90":0.01254,"91":0.02926,"92":0.07942,"93":0.01672,"94":0.01672,"95":0.07524,"96":0.3553,"97":7.86258,"98":19.06916,"99":0.03344,"100":0.04598,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 34 35 36 37 39 40 41 42 43 44 45 46 48 50 51 52 54 56 57 58 59 60 61 63 64 66 69 71 101"},F:{"28":0.02926,"36":0.00836,"46":0.03344,"80":0.00418,"82":0.23408,"83":0.65208,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00836,"18":0.01672,"92":0.01672,"96":0.03344,"97":0.50578,"98":2.16942,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95"},E:{"4":0,"11":0.00836,"12":0.00836,"13":0.10868,"14":0.25498,"15":0.24662,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1","9.1":0.10868,"10.1":0.02926,"11.1":0.05434,"12.1":0.04598,"13.1":0.28842,"14.1":1.01574,"15.1":0.86108,"15.2-15.3":1.2749,"15.4":0.0209},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.0046,"7.0-7.1":0.07206,"8.1-8.4":0,"9.0-9.2":0.04447,"9.3":0.33272,"10.0-10.2":0.0092,"10.3":0.37566,"11.0-11.2":0.03373,"11.3-11.4":0.04447,"12.0-12.1":0.0276,"12.2-12.5":0.89851,"13.0-13.1":0.02453,"13.2":0.0138,"13.3":0.0552,"13.4-13.7":0.19013,"14.0-14.4":0.51365,"14.5-14.8":1.69736,"15.0-15.1":2.82433,"15.2-15.3":7.9946,"15.4":0.17326},P:{"4":0.47534,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.07394,"8.2":0.02052,"9.2":0.01025,"10.1":0.02113,"11.1-11.2":0.04225,"12.0":0.01056,"13.0":0.10563,"14.0":0.03169,"15.0":0.07394,"16.0":1.56335},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00189,"4.4":0,"4.4.3-4.4.4":0.00975},A:{"11":0.04598,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.24444},Q:{"10.4":0},O:{"0":1.9497},H:{"0":1.79626},L:{"0":36.5219},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BO.js
new file mode 100644
index 0000000..fa28b17
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BO.js
@@ -0,0 +1 @@
+module.exports={C:{"43":0.00342,"48":0.00342,"52":0.06506,"56":0.00685,"67":0.00342,"68":0.00342,"69":0.01027,"72":0.01027,"73":0.00685,"78":0.02054,"81":0.00342,"82":0.00685,"83":0.01027,"85":0.01712,"86":0.00342,"88":0.01027,"89":0.0137,"91":0.02739,"92":0.01027,"93":0.00685,"94":0.0137,"95":0.03424,"96":0.83888,"97":1.27373,"98":0.0137,_:"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 40 41 42 44 45 46 47 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 70 71 74 75 76 77 79 80 84 87 90 99 3.5 3.6"},D:{"22":0.00342,"26":0.00685,"34":0.00342,"38":0.02739,"43":0.00342,"47":0.00685,"49":0.04794,"53":0.01027,"56":0.00342,"58":0.00685,"62":0.01027,"63":0.01027,"65":0.00342,"66":0.00685,"67":0.0137,"68":0.00685,"69":0.01027,"70":0.03082,"71":0.01027,"72":0.01027,"73":0.00342,"74":0.0137,"75":0.00685,"76":0.0137,"77":0.00685,"78":0.00685,"79":0.12326,"80":0.01712,"81":0.02054,"83":0.05821,"84":0.04794,"85":0.03424,"86":0.05136,"87":0.06848,"88":0.03424,"89":0.03082,"90":0.03424,"91":0.85942,"92":0.06848,"93":0.17462,"94":0.04451,"95":0.0719,"96":0.41773,"97":6.68022,"98":16.89402,"99":0.00342,"100":0.00685,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 33 35 36 37 39 40 41 42 44 45 46 48 50 51 52 54 55 57 59 60 61 64 101"},F:{"36":0.00685,"68":0.00685,"77":0.00342,"82":0.3287,"83":1.19498,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 71 72 73 74 75 76 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.00685,"17":0.00685,"18":0.02054,"84":0.00685,"89":0.00685,"92":0.01027,"94":0.00685,"95":0.00685,"96":0.01712,"97":0.29789,"98":1.2703,_:"12 14 15 16 79 80 81 83 85 86 87 88 90 91 93"},E:{"4":0,"14":0.03082,"15":0.02739,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.03766,"11.1":0.00685,"12.1":0.00342,"13.1":0.04794,"14.1":0.0993,"15.1":0.05136,"15.2-15.3":0.13011},G:{"8":0,"3.2":0.00046,"4.0-4.1":0,"4.2-4.3":0.00023,"5.0-5.1":0.00459,"6.0-6.1":0.00138,"7.0-7.1":0.00781,"8.1-8.4":0.00069,"9.0-9.2":0.00299,"9.3":0.01722,"10.0-10.2":0.00207,"10.3":0.00964,"11.0-11.2":0.0039,"11.3-11.4":0.00459,"12.0-12.1":0.00161,"12.2-12.5":0.12468,"13.0-13.1":0.0023,"13.2":0.00276,"13.3":0.00781,"13.4-13.7":0.05258,"14.0-14.4":0.1341,"14.5-14.8":0.37496,"15.0-15.1":0.33616,"15.2-15.3":1.19654,"15.4":0.00597},P:{"4":0.55693,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.46411,"8.2":0.02052,"9.2":0.04125,"10.1":0.01018,"11.1-11.2":0.17533,"12.0":0.06188,"13.0":0.16502,"14.0":0.18564,"15.0":0.2269,"16.0":1.96989},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00216,"4.2-4.3":0.00757,"4.4":0,"4.4.3-4.4.4":0.06918},A:{"8":0.00685,"11":0.07875,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01973},N:{_:"10 11"},R:{_:"0"},M:{"0":0.13152},Q:{"10.4":0},O:{"0":0.18413},H:{"0":0.37977},L:{"0":46.09357},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BR.js
new file mode 100644
index 0000000..15c6e16
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BR.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.00335,"52":0.01676,"60":0.0067,"67":0.00335,"68":0.01006,"72":0.00335,"78":0.02346,"79":0.00335,"80":0.00335,"81":0.0067,"82":0.00335,"84":0.0067,"88":0.01006,"89":0.0067,"90":0.0067,"91":0.03687,"92":0.0067,"93":0.01006,"94":0.04693,"95":0.02346,"96":0.51956,"97":0.80113,"98":0.0067,_:"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 40 41 42 43 44 45 46 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 69 70 71 73 74 75 76 77 83 85 86 87 99 3.5 3.6"},D:{"38":0.00335,"47":0.0067,"49":0.02346,"51":0.01006,"54":0.01341,"55":0.00335,"58":0.0067,"63":0.0067,"65":0.0067,"66":0.01341,"67":0.0067,"68":0.0067,"69":0.00335,"70":0.0067,"71":0.00335,"72":0.0067,"73":0.00335,"74":0.01341,"75":0.06369,"76":0.01006,"77":0.0067,"78":0.01006,"79":0.06369,"80":0.02346,"81":0.02682,"83":0.02682,"84":0.05698,"85":0.03352,"86":0.05028,"87":0.0905,"88":0.02011,"89":0.03687,"90":0.04358,"91":0.73074,"92":0.05028,"93":0.21118,"94":0.05028,"95":0.07374,"96":0.32514,"97":6.86825,"98":16.05273,"99":0.03352,"100":0.02011,_:"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 39 40 41 42 43 44 45 46 48 50 52 53 56 57 59 60 61 62 64 101"},F:{"36":0.01006,"73":0.01341,"78":0.00335,"82":0.82124,"83":1.85366,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01676,"16":0.00335,"18":0.01341,"84":0.00335,"89":0.00335,"90":0.0067,"91":0.01006,"92":0.0067,"94":0.00335,"95":0.02346,"96":0.01676,"97":0.50615,"98":1.74304,_:"12 13 14 17 79 80 81 83 85 86 87 88 93"},E:{"4":0,"13":0.01341,"14":0.02682,"15":0.02346,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1 15.4","9.1":0.00335,"11.1":0.0067,"12.1":0.01006,"13.1":0.04358,"14.1":0.10056,"15.1":0.06034,"15.2-15.3":0.10391},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00108,"6.0-6.1":0,"7.0-7.1":0.00108,"8.1-8.4":0,"9.0-9.2":0.00054,"9.3":0.02107,"10.0-10.2":0,"10.3":0.02755,"11.0-11.2":0.00432,"11.3-11.4":0.01189,"12.0-12.1":0.00594,"12.2-12.5":0.19719,"13.0-13.1":0.0054,"13.2":0.0027,"13.3":0.02107,"13.4-13.7":0.08968,"14.0-14.4":0.21934,"14.5-14.8":1.18963,"15.0-15.1":0.86494,"15.2-15.3":2.7234,"15.4":0.01135},P:{"4":0.07168,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.24576,"8.2":0.02052,"9.2":0.02048,"10.1":0.01018,"11.1-11.2":0.09216,"12.0":0.02048,"13.0":0.1024,"14.0":0.09216,"15.0":0.1024,"16.0":1.79201},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00197,"4.2-4.3":0.00295,"4.4":0,"4.4.3-4.4.4":0.02167},A:{"8":0.00705,"9":0.00705,"11":0.12334,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.09307},Q:{"10.4":0},O:{"0":0.06648},H:{"0":0.14476},L:{"0":40.25477},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BS.js
new file mode 100644
index 0000000..f8b1fca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BS.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.04687,"52":0.01875,"78":0.01406,"88":0.02812,"91":0.04687,"94":0.06562,"95":0.38433,"96":0.50151,"97":0.77336,"98":0.00937,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 89 90 92 93 99 3.5 3.6"},D:{"49":0.14998,"55":0.00937,"56":0.01406,"65":0.03281,"67":0.01406,"70":0.01406,"71":0.00937,"74":0.00937,"75":0.0375,"76":0.22498,"77":0.00937,"78":0.03281,"79":0.02344,"80":0.00469,"81":0.01406,"83":0.01875,"84":0.01406,"86":0.00469,"87":0.04687,"88":0.00937,"89":0.00937,"90":0.05156,"91":0.07031,"92":0.04687,"93":0.15467,"94":0.05156,"95":0.03281,"96":0.45464,"97":7.61638,"98":13.96257,"99":0.01406,"100":0.03281,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 57 58 59 60 61 62 63 64 66 68 69 72 73 85 101"},F:{"74":0.00469,"82":0.09374,"83":0.30466,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.01406,"14":0.01875,"15":0.00937,"16":0.04687,"17":0.02344,"18":0.07031,"92":0.00469,"93":0.01406,"94":0.01875,"95":0.04218,"96":0.07968,"97":1.83262,"98":6.04154,_:"12 79 80 81 83 84 85 86 87 88 89 90 91"},E:{"4":0,"12":0.00469,"13":0.04218,"14":0.40308,"15":0.22498,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.01875,"11.1":0.06562,"12.1":0.10311,"13.1":0.4312,"14.1":1.75294,"15.1":1.11551,"15.2-15.3":2.25445,"15.4":0.01875},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.11597,"10.0-10.2":0.00455,"10.3":0.1228,"11.0-11.2":0.03184,"11.3-11.4":0.02274,"12.0-12.1":0.02729,"12.2-12.5":0.53212,"13.0-13.1":0.04321,"13.2":0.00227,"13.3":0.1046,"13.4-13.7":0.17282,"14.0-14.4":0.72768,"14.5-14.8":4.16371,"15.0-15.1":3.65661,"15.2-15.3":12.96641,"15.4":0.03866},P:{"4":0.04186,"5.0-5.4":0.01086,"6.2-6.4":0.02066,"7.2-7.4":0.30349,"8.2":0.01018,"9.2":0.05233,"10.1":0.01018,"11.1-11.2":0.8372,"12.0":0.05233,"13.0":0.2407,"14.0":0.27209,"15.0":0.13605,"16.0":4.20695},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.03188},A:{"11":0.26716,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.13285},Q:{"10.4":0},O:{"0":0.02657},H:{"0":0.08553},L:{"0":28.3337},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BT.js
new file mode 100644
index 0000000..f6c6077
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BT.js
@@ -0,0 +1 @@
+module.exports={C:{"18":0.00186,"39":0.00186,"41":0.00743,"52":0.00557,"68":0.00186,"72":0.00186,"78":0.00929,"81":0.00186,"82":0.00372,"84":0.00186,"87":0.03159,"88":0.01858,"89":0.00186,"91":0.00557,"92":0.00186,"94":0.00372,"95":0.04088,"96":0.19323,"97":0.29914,"98":0.02601,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 40 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 79 80 83 85 86 90 93 99 3.5 3.6"},D:{"33":0.00557,"43":0.00372,"49":0.00372,"53":0.00557,"63":0.00372,"65":0.01301,"66":0.01858,"67":0.05946,"69":0.00372,"71":0.00557,"73":0.00929,"74":0.00186,"76":0.00372,"78":0.02044,"79":0.02601,"80":0.02044,"81":0.10591,"83":0.01301,"84":0.00929,"85":0.00557,"86":0.00557,"87":0.03902,"88":0.00372,"89":0.00557,"90":0.01301,"91":0.03159,"92":0.06689,"93":0.0353,"94":0.01672,"95":0.07618,"96":0.41248,"97":4.38116,"98":9.26956,"99":0.01301,"100":0.03159,_:"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 34 35 36 37 38 39 40 41 42 44 45 46 47 48 50 51 52 54 55 56 57 58 59 60 61 62 64 68 70 72 75 77 101"},F:{"36":0.00186,"80":0.00372,"82":0.01115,"83":0.13749,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00557,"13":0.00372,"16":0.00186,"18":0.01115,"84":0.00743,"85":0.01115,"87":0.01858,"90":0.00186,"91":0.00557,"92":0.01672,"93":0.00743,"94":0.00929,"95":0.01858,"96":0.10962,"97":0.36045,"98":0.72648,_:"14 15 17 79 80 81 83 86 88 89"},E:{"4":0,"13":0.02973,"14":0.05388,"15":0.11148,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.01672,"11.1":0.00929,"12.1":0.02973,"13.1":0.10219,"14.1":0.22296,"15.1":0.10776,"15.2-15.3":0.13749},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01296,"8.1-8.4":0.00086,"9.0-9.2":0.00086,"9.3":0.04925,"10.0-10.2":0.00346,"10.3":0.01123,"11.0-11.2":0.04925,"11.3-11.4":0.01123,"12.0-12.1":0.03801,"12.2-12.5":0.48036,"13.0-13.1":0.01814,"13.2":0.00864,"13.3":0.1486,"13.4-13.7":0.254,"14.0-14.4":1.11104,"14.5-14.8":1.86355,"15.0-15.1":1.72618,"15.2-15.3":2.845,"15.4":0.00605},P:{"4":0.33912,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.16442,"8.2":0.02052,"9.2":0.03083,"10.1":0.01018,"11.1-11.2":0.12332,"12.0":0.03083,"13.0":0.19525,"14.0":0.14387,"15.0":0.11304,"16.0":0.97625},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.01672,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.02443},Q:{"10.4":0},O:{"0":4.28269},H:{"0":0.37},L:{"0":66.43858},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BW.js
new file mode 100644
index 0000000..8210359
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BW.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.05446,"40":0.00908,"41":0.00454,"43":0.00908,"47":0.00908,"50":0.00454,"52":0.04084,"60":0.00908,"69":0.00908,"70":0.00908,"72":0.00908,"78":0.04992,"81":0.00908,"88":0.00908,"89":0.01361,"91":0.1316,"92":0.00908,"93":0.00908,"94":0.02723,"95":0.04538,"96":1.07097,"97":1.42039,"98":0.08622,_:"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 35 36 37 38 39 42 44 45 46 48 49 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 71 73 74 75 76 77 79 80 82 83 84 85 86 87 90 99 3.5 3.6"},D:{"38":0.00908,"41":0.01361,"43":0.02723,"49":0.0363,"56":0.00454,"58":0.00454,"59":0.00454,"63":0.01815,"64":0.00454,"66":0.01361,"68":0.00454,"69":0.02269,"70":0.00908,"72":0.01361,"73":0.00908,"74":0.01815,"75":0.01361,"76":0.01361,"78":0.01361,"79":0.08168,"80":0.04084,"81":0.02723,"83":0.05899,"84":0.01361,"85":0.01815,"86":0.04084,"87":0.08168,"88":0.03177,"89":0.02723,"90":0.04538,"91":0.04084,"92":0.08168,"93":0.1316,"94":0.07715,"95":0.13614,"96":0.57179,"97":8.80826,"98":19.20028,"99":0.00454,"100":0.00908,_:"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 39 40 42 44 45 46 47 48 50 51 52 53 54 55 57 60 61 62 65 67 71 77 101"},F:{"28":0.01361,"79":0.01361,"81":0.00454,"82":0.09076,"83":0.84861,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.03177,"13":0.02269,"14":0.05446,"15":0.06807,"16":0.0363,"17":0.02723,"18":0.11799,"80":0.00908,"84":0.02723,"85":0.01361,"89":0.02269,"90":0.00454,"91":0.00908,"92":0.02269,"93":0.01361,"94":0.02269,"95":0.02723,"96":0.1316,"97":1.39317,"98":4.30202,_:"79 81 83 86 87 88"},E:{"4":0,"12":0.01361,"14":0.09984,"15":0.06807,_:"0 5 6 7 8 9 10 11 13 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00454,"11.1":0.00908,"12.1":0.00908,"13.1":0.09076,"14.1":0.20875,"15.1":0.18606,"15.2-15.3":0.29497},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01874,"6.0-6.1":0.00312,"7.0-7.1":0.03257,"8.1-8.4":0,"9.0-9.2":0.00268,"9.3":0.03703,"10.0-10.2":0,"10.3":0.02811,"11.0-11.2":0.01338,"11.3-11.4":0.0058,"12.0-12.1":0.00758,"12.2-12.5":0.43233,"13.0-13.1":0.00446,"13.2":0,"13.3":0.01472,"13.4-13.7":0.05131,"14.0-14.4":0.22977,"14.5-14.8":0.88294,"15.0-15.1":0.85796,"15.2-15.3":1.7815,"15.4":0.05845},P:{"4":0.25574,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.39895,"8.2":0.02052,"9.2":0.01023,"10.1":0.01018,"11.1-11.2":0.10229,"12.0":0.03069,"13.0":0.15344,"14.0":0.42964,"15.0":0.11252,"16.0":2.04588},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00192,"4.2-4.3":0.005,"4.4":0,"4.4.3-4.4.4":0.07501},A:{"9":0.00919,"10":0.0046,"11":0.34925,_:"6 7 8 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01639},N:{_:"10 11"},R:{_:"0"},M:{"0":0.10924},Q:{"10.4":0.00546},O:{"0":1.17433},H:{"0":0.76015},L:{"0":46.92915},S:{"2.5":0.01639}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BY.js
new file mode 100644
index 0000000..73e6e6d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BY.js
@@ -0,0 +1 @@
+module.exports={C:{"39":0.01059,"48":0.01059,"50":0.02649,"52":0.24366,"55":0.27544,"72":0.01059,"78":0.04238,"79":0.03178,"80":0.02119,"81":0.02649,"82":0.01589,"84":0.02119,"86":0.01059,"88":0.02119,"89":0.02119,"91":0.09005,"92":0.01059,"93":0.01059,"94":0.02649,"95":0.06886,"96":1.08059,"97":1.53083,"98":0.01059,_:"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 40 41 42 43 44 45 46 47 49 51 53 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 83 85 87 90 99 3.5 3.6"},D:{"22":0.0053,"38":0.01059,"49":0.14832,"51":0.01059,"53":0.10064,"59":0.01589,"63":0.0053,"65":0.01059,"66":0.01059,"67":0.02119,"68":0.02119,"69":0.23307,"70":0.01059,"71":0.01059,"72":0.01589,"73":0.03708,"74":0.06886,"75":0.03178,"76":0.01059,"77":0.01059,"78":0.02119,"79":0.10064,"80":0.07946,"81":0.01059,"83":0.04238,"84":0.09535,"85":0.12183,"86":0.27015,"87":0.14832,"88":0.11653,"89":0.07416,"90":0.05827,"91":0.08475,"92":0.24896,"93":0.28074,"94":0.10064,"95":0.06886,"96":0.85811,"97":9.22208,"98":18.15282,"99":0.06356,"100":0.02649,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 47 48 50 52 54 55 56 57 58 60 61 62 64 101"},F:{"36":0.10064,"41":0.01059,"68":0.01059,"71":0.01059,"72":0.0053,"73":0.0053,"74":0.0053,"75":0.01059,"77":0.06356,"78":0.02649,"79":0.05827,"80":0.03178,"81":0.03178,"82":0.72569,"83":5.2917,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 76 9.5-9.6 10.5 11.1 11.5 11.6","10.0-10.1":0,"10.6":0.02649,"12.1":0.12183},B:{"18":0.04238,"79":0.0053,"85":0.0053,"86":0.0053,"95":0.01059,"96":0.0053,"97":0.39728,"98":1.34014,_:"12 13 14 15 16 17 80 81 83 84 87 88 89 90 91 92 93 94"},E:{"4":0,"13":0.01059,"14":0.19599,"15":0.12183,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1","5.1":0.14302,"9.1":0.0053,"10.1":0.0053,"11.1":0.02649,"12.1":0.02119,"13.1":0.10594,"14.1":0.42376,"15.1":0.39728,"15.2-15.3":0.81044,"15.4":0.0053},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0018,"6.0-6.1":0.0018,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.0009,"9.3":0.02706,"10.0-10.2":0.03517,"10.3":0.03337,"11.0-11.2":0.02345,"11.3-11.4":0.01082,"12.0-12.1":0.02525,"12.2-12.5":0.26516,"13.0-13.1":0.00722,"13.2":0.00812,"13.3":0.04149,"13.4-13.7":0.1407,"14.0-14.4":0.46178,"14.5-14.8":1.16257,"15.0-15.1":1.56121,"15.2-15.3":5.19232,"15.4":0.01353},P:{"4":0.03227,"5.0-5.4":0.01086,"6.2-6.4":0.18286,"7.2-7.4":0.26254,"8.2":0.02052,"9.2":0.0104,"10.1":0.01018,"11.1-11.2":0.02151,"12.0":0.07529,"13.0":0.05378,"14.0":0.05378,"15.0":0.06454,"16.0":1.16167},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00391,"4.2-4.3":0.00684,"4.4":0,"4.4.3-4.4.4":0.02687},A:{"8":0.02649,"9":0.01059,"11":0.19069,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.11755},Q:{"10.4":0.0047},O:{"0":0.15046},H:{"0":1.07282},L:{"0":32.66327},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BZ.js
new file mode 100644
index 0000000..d611edd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/BZ.js
@@ -0,0 +1 @@
+module.exports={C:{"64":0.00807,"72":0.00807,"75":0.00807,"78":0.07259,"81":0.39523,"87":0.00807,"88":0.00403,"90":0.0121,"91":0.03226,"92":0.00403,"93":0.04033,"95":0.01613,"96":0.52429,"97":0.83886,"98":0.00807,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 65 66 67 68 69 70 71 73 74 76 77 79 80 82 83 84 85 86 89 94 99 3.5 3.6"},D:{"49":0.0242,"61":0.00807,"65":0.00807,"72":0.00403,"74":0.00403,"75":0.08066,"76":0.09679,"77":0.0484,"79":0.02017,"80":0.00403,"81":0.00807,"84":0.03226,"85":0.00807,"86":0.00403,"87":0.02017,"88":0.00807,"89":0.01613,"90":0.02017,"91":0.06856,"92":0.93969,"93":0.12906,"94":0.05243,"95":0.0484,"96":0.7824,"97":5.47278,"98":12.9056,"99":0.01613,"100":0.0484,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 62 63 64 66 67 68 69 70 71 73 78 83 101"},F:{"28":0.01613,"80":0.00807,"81":0.00403,"82":0.14922,"83":1.29863,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00807,"17":0.00403,"18":0.00807,"93":0.05646,"94":0.00807,"95":0.01613,"96":0.02823,"97":1.12521,"98":3.6176,_:"13 14 15 16 79 80 81 83 84 85 86 87 88 89 90 91 92"},E:{"4":0,"12":0.02017,"13":0.00403,"14":0.06856,"15":0.08469,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00807,"11.1":0.00403,"12.1":0.0121,"13.1":0.11696,"14.1":0.60092,"15.1":1.10908,"15.2-15.3":3.77489,"15.4":0.05243},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00625,"6.0-6.1":0,"7.0-7.1":0.02186,"8.1-8.4":0,"9.0-9.2":0.04372,"9.3":0.24049,"10.0-10.2":0,"10.3":0.07808,"11.0-11.2":0.00625,"11.3-11.4":0.28734,"12.0-12.1":0.00937,"12.2-12.5":0.35605,"13.0-13.1":0,"13.2":0,"13.3":0.04997,"13.4-13.7":0.07808,"14.0-14.4":0.46848,"14.5-14.8":2.14877,"15.0-15.1":4.32252,"15.2-15.3":22.98996,"15.4":0.10619},P:{"4":0.1571,"5.0-5.4":0.01086,"6.2-6.4":0.18286,"7.2-7.4":0.13615,"8.2":0.02052,"9.2":0.02095,"10.1":0.01018,"11.1-11.2":0.21994,"12.0":0.02137,"13.0":0.14662,"14.0":0.09426,"15.0":0.05237,"16.0":1.69666},I:{"0":0,"3":0,"4":0.0011,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0011,"4.2-4.3":0.00037,"4.4":0,"4.4.3-4.4.4":0.0213},A:{"11":0.08469,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.0716},Q:{"10.4":0.00597},O:{"0":0.39382},H:{"0":0.0339},L:{"0":26.13127},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CA.js
new file mode 100644
index 0000000..2aa6066
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CA.js
@@ -0,0 +1 @@
+module.exports={C:{"24":0.00566,"38":0.01699,"43":0.01699,"44":0.0623,"45":0.01699,"48":0.01133,"50":0.01133,"52":0.04531,"55":0.10762,"56":0.00566,"57":0.01699,"63":0.19824,"66":0.01133,"68":0.00566,"72":0.00566,"77":0.01699,"78":0.09062,"79":0.01133,"80":0.01133,"81":0.01133,"82":0.01699,"83":0.00566,"84":0.01133,"87":0.03398,"88":0.01699,"89":0.01699,"90":0.01699,"91":0.07363,"92":0.00566,"93":0.00566,"94":0.02832,"95":0.0623,"96":1.17245,"97":1.83514,"98":0.01133,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 46 47 49 51 53 54 58 59 60 61 62 64 65 67 69 70 71 73 74 75 76 85 86 99 3.5 3.6"},D:{"38":0.01133,"47":0.01699,"48":0.17558,"49":0.13027,"60":0.02832,"64":0.02266,"65":0.02266,"66":0.01133,"67":0.02832,"68":0.01133,"69":0.08496,"70":0.22656,"71":0.00566,"72":0.04531,"73":0.01133,"74":0.02832,"75":0.01133,"76":0.03965,"77":0.01133,"78":0.02266,"79":0.11894,"80":0.07363,"81":0.03965,"83":0.36816,"84":0.11894,"85":0.11894,"86":0.16992,"87":0.2039,"88":0.03965,"89":0.03965,"90":0.05098,"91":0.08496,"92":0.06797,"93":0.29453,"94":0.23222,"95":0.11894,"96":0.88358,"97":10.63133,"98":19.89763,"99":0.02832,"100":0.01699,_:"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 39 40 41 42 43 44 45 46 50 51 52 53 54 55 56 57 58 59 61 62 63 101"},F:{"52":0.01133,"82":0.1416,"83":0.49277,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00566,"13":0.00566,"14":0.00566,"15":0.01133,"16":0.01133,"17":0.19824,"18":0.02832,"84":0.00566,"85":0.01699,"86":0.01133,"89":0.01133,"90":0.00566,"92":0.01133,"94":0.01133,"95":0.04531,"96":0.07363,"97":1.63123,"98":5.35248,_:"79 80 81 83 87 88 91 93"},E:{"4":0,"8":0.00566,"9":0.02832,"12":0.01133,"13":0.08496,"14":0.43613,"15":0.26621,_:"0 5 6 7 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.02832,"10.1":0.03398,"11.1":0.09062,"12.1":0.16426,"13.1":0.61171,"14.1":1.81248,"15.1":0.8496,"15.2-15.3":2.21462,"15.4":0.02266},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00225,"6.0-6.1":0.00451,"7.0-7.1":0.01127,"8.1-8.4":0.01353,"9.0-9.2":0.00676,"9.3":0.20516,"10.0-10.2":0.01353,"10.3":0.20291,"11.0-11.2":0.08793,"11.3-11.4":0.05636,"12.0-12.1":0.04058,"12.2-12.5":0.992,"13.0-13.1":0.0496,"13.2":0.02029,"13.3":0.10145,"13.4-13.7":0.34269,"14.0-14.4":0.82742,"14.5-14.8":4.29717,"15.0-15.1":2.95346,"15.2-15.3":12.23768,"15.4":0.06764},P:{"4":0.12016,"5.0-5.4":0.03103,"6.2-6.4":0.01048,"7.2-7.4":0.09308,"8.2":0.01077,"9.2":0.08273,"10.1":0.02185,"11.1-11.2":0.01092,"12.0":0.02185,"13.0":0.05462,"14.0":0.04369,"15.0":0.05462,"16.0":3.08039},I:{"0":0,"3":0,"4":0.00132,"2.1":0,"2.2":0,"2.3":0.0022,"4.1":0.00044,"4.2-4.3":0.00396,"4.4":0,"4.4.3-4.4.4":0.02243},A:{"8":0.01799,"9":0.04798,"10":0.006,"11":0.43779,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.3859},Q:{"10.4":0.00867},O:{"0":0.14309},H:{"0":0.1642},L:{"0":16.81277},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CD.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CD.js
new file mode 100644
index 0000000..0954ed7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CD.js
@@ -0,0 +1 @@
+module.exports={C:{"29":0.00143,"30":0.00286,"33":0.00571,"35":0.00143,"43":0.00286,"45":0.00286,"47":0.00428,"49":0.00143,"52":0.00428,"56":0.00857,"59":0.00143,"68":0.00286,"72":0.01999,"78":0.01714,"80":0.00143,"88":0.00428,"89":0.00714,"90":0.00714,"91":0.01571,"93":0.00571,"94":0.00286,"95":0.01142,"96":0.33272,"97":0.49837,"98":0.00714,_:"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 31 32 34 36 37 38 39 40 41 42 44 46 48 50 51 53 54 55 57 58 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 79 81 82 83 84 85 86 87 92 99 3.5 3.6"},D:{"11":0.00428,"18":0.00143,"25":0.0714,"26":0.00286,"28":0.00143,"33":0.00143,"34":0.00286,"38":0.00428,"42":0.01142,"43":0.00286,"47":0.00428,"49":0.00428,"55":0.00143,"62":0.00143,"63":0.00286,"64":0.00714,"65":0.00143,"68":0.00428,"69":0.00143,"70":0.00143,"71":0.00286,"72":0.00286,"74":0.01285,"76":0.01856,"77":0.00714,"78":0.00143,"79":0.01,"80":0.01,"81":0.0257,"83":0.00571,"84":0.01,"85":0.01,"86":0.2856,"87":0.02999,"88":0.0257,"89":0.01571,"90":0.00714,"91":0.01714,"92":0.02142,"93":0.0257,"94":0.02142,"95":0.01571,"96":0.0971,"97":1.32518,"98":3.04307,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 19 20 21 22 23 24 27 29 30 31 32 35 36 37 39 40 41 44 45 46 48 50 51 52 53 54 56 57 58 59 60 61 66 67 73 75 99 100 101"},F:{"15":0.00286,"18":0.00714,"34":0.00428,"36":0.00286,"42":0.00428,"66":0.00857,"67":0.00143,"74":0.00286,"78":0.00143,"79":0.01571,"80":0.00571,"81":0.00143,"82":0.1071,"83":0.58548,_:"9 11 12 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 37 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 68 69 70 71 72 73 75 76 77 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.04284,"13":0.00857,"14":0.0257,"15":0.02142,"16":0.01571,"17":0.13566,"18":0.06997,"84":0.01142,"85":0.01,"89":0.01285,"90":0.00571,"91":0.00143,"92":0.02713,"93":0.00571,"94":0.00143,"95":0.01856,"96":0.05284,"97":0.39698,"98":0.8668,_:"79 80 81 83 86 87 88"},E:{"4":0,"12":0.00571,"13":0.00571,"14":0.01428,"15":0.01285,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00428,"11.1":0.01285,"12.1":0.02142,"13.1":0.02856,"14.1":0.08425,"15.1":0.02856,"15.2-15.3":0.03142},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00169,"5.0-5.1":0.00084,"6.0-6.1":0,"7.0-7.1":0.00844,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02616,"10.0-10.2":0.00084,"10.3":0.14934,"11.0-11.2":0.03375,"11.3-11.4":0.02869,"12.0-12.1":0.17212,"12.2-12.5":2.38858,"13.0-13.1":0.01941,"13.2":0.45477,"13.3":0.06159,"13.4-13.7":0.35943,"14.0-14.4":0.88338,"14.5-14.8":1.43855,"15.0-15.1":0.95088,"15.2-15.3":1.44783,"15.4":0.00759},P:{"4":0.29722,"5.0-5.4":0.02123,"6.2-6.4":0.04033,"7.2-7.4":0.13799,"8.2":0.01049,"9.2":0.05307,"10.1":2.25855,"11.1-11.2":0.04246,"12.0":0.18045,"13.0":0.03184,"14.0":0.10615,"15.0":0.12738,"16.0":0.38213},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00257,"4.2-4.3":0.02086,"4.4":0,"4.4.3-4.4.4":0.07085},A:{"11":0.15708,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.23999},Q:{"10.4":0.03428},O:{"0":0.6514},H:{"0":25.88516},L:{"0":52.08426},S:{"2.5":0.05143}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CF.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CF.js
new file mode 100644
index 0000000..90736d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CF.js
@@ -0,0 +1 @@
+module.exports={C:{"22":0.0018,"30":0.00719,"35":0.0018,"45":0.05034,"50":0.0018,"52":0.00719,"56":0.00719,"58":0.02158,"59":0.00719,"66":0.0018,"68":0.00539,"72":0.0018,"91":0.46928,"92":0.0018,"94":0.00899,"95":0.03416,"96":0.38297,"97":0.46748,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 31 32 33 34 36 37 38 39 40 41 42 43 44 46 47 48 49 51 53 54 55 57 60 61 62 63 64 65 67 69 70 71 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 93 98 99 3.5 3.6"},D:{"43":0.0018,"51":0.00719,"55":0.0018,"57":0.01259,"60":0.0018,"63":0.0018,"77":0.01438,"80":0.01259,"81":0.00539,"83":0.01618,"85":0.00719,"86":0.02697,"89":0.00539,"91":0.00539,"92":0.02877,"93":0.00539,"94":0.02158,"95":0.0018,"96":0.05754,"97":1.90588,"98":3.00446,_:"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 40 41 42 44 45 46 47 48 49 50 52 53 54 56 58 59 61 62 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 84 87 88 90 99 100 101"},F:{"81":0.01618,"82":0.02697,"83":0.12586,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6","10.0-10.1":0,"12.1":0.08451},B:{"12":0.05754,"13":0.02697,"15":0.0018,"17":0.00539,"18":0.04675,"83":0.00539,"84":0.00899,"90":0.02337,"91":0.01259,"92":0.00539,"93":0.03596,"94":0.0018,"95":0.01259,"96":0.04315,"97":0.18879,"98":0.55918,_:"14 16 79 80 81 85 86 87 88 89"},E:{"4":0,"13":0.00539,_:"0 5 6 7 8 9 10 11 12 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 15.4","13.1":0.11148,"14.1":0.10608,"15.1":0.00899,"15.2-15.3":0.02697},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0151,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04165,"10.0-10.2":0,"10.3":0.03483,"11.0-11.2":0.13493,"11.3-11.4":0.00341,"12.0-12.1":0.09328,"12.2-12.5":0.12129,"13.0-13.1":0.00511,"13.2":0,"13.3":0.00487,"13.4-13.7":0.04822,"14.0-14.4":0.34414,"14.5-14.8":0.26961,"15.0-15.1":0.6174,"15.2-15.3":0.70216,"15.4":0},P:{"4":0.04075,"5.0-5.4":0.02063,"6.2-6.4":0.03056,"7.2-7.4":0.05243,"8.2":0.01049,"9.2":0.05094,"10.1":1.21237,"11.1-11.2":0.02038,"12.0":0.03056,"13.0":0.20973,"14.0":0.03056,"15.0":0.0815,"16.0":1.74215},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00185,"4.2-4.3":0.00648,"4.4":0,"4.4.3-4.4.4":0.04908},A:{"11":0.14564,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.07382},Q:{"10.4":0},O:{"0":0.26246},H:{"0":8.73576},L:{"0":75.95695},S:{"2.5":0.13943}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CG.js
new file mode 100644
index 0000000..5b728e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CG.js
@@ -0,0 +1 @@
+module.exports={C:{"32":0.01813,"39":0.00725,"43":0.00363,"47":0.00725,"48":0.00725,"52":0.0145,"72":0.01088,"78":0.00725,"89":0.09425,"91":0.0725,"92":0.00363,"93":0.00363,"94":0.00363,"95":0.01813,"96":1.17813,"97":1.73275,"98":0.01088,_:"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 33 34 35 36 37 38 40 41 42 44 45 46 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 90 99 3.5 3.6"},D:{"42":0.01813,"49":0.00725,"55":0.00363,"60":0.00363,"66":0.00363,"67":0.0145,"69":0.05438,"75":0.03988,"79":0.01813,"81":0.03625,"83":0.00363,"84":0.0145,"86":0.09425,"87":0.09425,"88":0.01088,"89":0.02175,"90":0.0145,"91":0.07975,"92":0.0145,"93":0.01088,"94":0.02175,"95":0.02175,"96":0.41325,"97":3.567,"98":8.76163,_:"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 40 41 43 44 45 46 47 48 50 51 52 53 54 56 57 58 59 61 62 63 64 65 68 70 71 72 73 74 76 77 78 80 85 99 100 101"},F:{"36":0.00363,"79":0.01813,"82":0.19213,"83":2.001,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.02175,"14":0.01813,"15":0.00363,"16":0.10875,"17":0.0145,"18":0.145,"84":0.01088,"89":0.03988,"90":0.00725,"92":0.0145,"94":0.01088,"95":0.00725,"96":0.03988,"97":0.90625,"98":3.07038,_:"13 79 80 81 83 85 86 87 88 91 93"},E:{"4":0,"15":0.00725,_:"0 5 6 7 8 9 10 11 12 13 14 3.1 3.2 5.1 6.1 11.1 12.1 15.4","7.1":0.01813,"9.1":0.00363,"10.1":0.00363,"13.1":0.1885,"14.1":0.03263,"15.1":0.02175,"15.2-15.3":0.05438},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.04029,"8.1-8.4":0.00413,"9.0-9.2":0,"9.3":0.0155,"10.0-10.2":0.00207,"10.3":0.16529,"11.0-11.2":0.11364,"11.3-11.4":0.03926,"12.0-12.1":0.00413,"12.2-12.5":3.97108,"13.0-13.1":0.0093,"13.2":0.00413,"13.3":0.01446,"13.4-13.7":0.76343,"14.0-14.4":0.54959,"14.5-14.8":0.88017,"15.0-15.1":0.59504,"15.2-15.3":3.14154,"15.4":0.01446},P:{"4":0.22481,"5.0-5.4":0.02123,"6.2-6.4":0.04033,"7.2-7.4":0.05353,"8.2":0.01049,"9.2":0.03212,"10.1":2.25855,"11.1-11.2":0.07494,"12.0":0.02141,"13.0":0.03212,"14.0":0.01071,"15.0":0.14987,"16.0":0.53526},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00044,"4.1":0.01403,"4.2-4.3":0.01564,"4.4":0,"4.4.3-4.4.4":0.11651},A:{"11":0.07613,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.06375},N:{_:"10 11"},R:{_:"0"},M:{"0":0.08288},Q:{"10.4":0.08925},O:{"0":0.68213},H:{"0":1.84081},L:{"0":57.93513},S:{"2.5":0.24225}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CH.js
new file mode 100644
index 0000000..2c10984
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CH.js
@@ -0,0 +1 @@
+module.exports={C:{"24":0.01204,"48":0.01806,"50":0.01204,"52":0.04215,"55":0.00602,"57":0.01806,"60":0.01806,"66":0.01204,"68":0.01204,"78":0.16859,"79":0.00602,"80":0.00602,"81":0.00602,"84":0.02408,"85":0.03011,"86":0.00602,"87":0.00602,"88":0.07225,"89":0.01204,"90":0.02408,"91":0.39739,"92":0.01806,"93":0.00602,"94":0.51179,"95":0.09032,"96":2.36023,"97":3.73302,"98":0.01204,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 49 51 53 54 56 58 59 61 62 63 64 65 67 69 70 71 72 73 74 75 76 77 82 83 99 3.5 3.6"},D:{"38":0.01204,"49":0.04817,"52":0.1445,"60":0.03011,"63":0.00602,"64":0.01204,"65":0.02408,"66":0.04817,"67":0.02408,"68":0.02408,"69":0.00602,"70":0.01806,"71":0.00602,"72":0.03011,"73":0.01806,"74":0.01806,"75":0.01204,"76":0.01204,"77":0.01204,"78":0.03613,"79":0.12042,"80":0.07827,"81":0.03011,"83":0.04215,"84":0.09634,"85":0.07225,"86":0.06623,"87":0.18665,"88":0.05419,"89":0.06021,"90":0.04817,"91":0.09032,"92":0.07225,"93":0.22278,"94":0.10236,"95":0.1144,"96":1.01153,"97":7.16499,"98":15.7991,"99":0.01204,"100":0.01204,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 53 54 55 56 57 58 59 61 62 101"},F:{"77":0.01204,"82":0.30105,"83":0.95132,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01806,"16":0.01806,"18":0.03613,"84":0.04817,"85":0.01204,"86":0.01806,"88":0.01204,"89":0.01806,"90":0.01806,"91":0.03613,"92":0.03011,"93":0.01204,"94":0.04817,"95":0.06021,"96":0.20471,"97":3.25134,"98":10.4645,_:"12 13 14 17 79 80 81 83 87"},E:{"4":0,"10":0.03011,"11":0.00602,"12":0.01204,"13":0.13246,"14":0.572,"15":0.3733,_:"0 5 6 7 8 9 3.1 3.2 5.1 6.1 7.1","9.1":0.02408,"10.1":0.04215,"11.1":0.09032,"12.1":0.23482,"13.1":0.85498,"14.1":2.0351,"15.1":0.93928,"15.2-15.3":2.25185,"15.4":0.02408},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00638,"8.1-8.4":0.00425,"9.0-9.2":0.08075,"9.3":0.14451,"10.0-10.2":0.00213,"10.3":0.11688,"11.0-11.2":0.02125,"11.3-11.4":0.08713,"12.0-12.1":0.03188,"12.2-12.5":0.53977,"13.0-13.1":0.034,"13.2":0.01488,"13.3":0.07863,"13.4-13.7":0.34214,"14.0-14.4":1.03066,"14.5-14.8":4.27991,"15.0-15.1":3.211,"15.2-15.3":11.15667,"15.4":0.05313},P:{"4":0.0847,_:"5.0-5.4 6.2-6.4 7.2-7.4 8.2 10.1 11.1-11.2","9.2":0.02117,"12.0":0.02117,"13.0":0.06352,"14.0":0.09528,"15.0":0.11646,"16.0":3.15492},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00519,"4.2-4.3":0.00519,"4.4":0,"4.4.3-4.4.4":0.03338},A:{"9":0.03011,"11":0.43953,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.5491},Q:{"10.4":0.00796},O:{"0":0.11141},H:{"0":0.22602},L:{"0":13.91426},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CI.js
new file mode 100644
index 0000000..db8ee21
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CI.js
@@ -0,0 +1 @@
+module.exports={C:{"38":0.00303,"41":0.00606,"43":0.00303,"47":0.00606,"52":0.04239,"56":0.00303,"60":0.00908,"67":0.00303,"68":0.01211,"70":0.00908,"71":0.00303,"72":0.0212,"75":0.00303,"78":0.01514,"81":0.00303,"82":0.00303,"83":0.00303,"84":0.00606,"88":0.00303,"89":0.01211,"91":0.04542,"92":0.00303,"93":0.00908,"94":0.01514,"95":0.03331,"96":0.84178,"97":1.62301,"98":0.01817,_:"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 39 40 42 44 45 46 48 49 50 51 53 54 55 57 58 59 61 62 63 64 65 66 69 73 74 76 77 79 80 85 86 87 90 99 3.5 3.6"},D:{"11":0.07267,"38":0.00606,"40":0.01514,"42":0.00303,"49":0.02422,"50":0.00303,"56":0.00303,"58":0.00303,"61":0.00303,"62":0.00303,"63":0.00908,"65":0.00606,"66":0.05148,"67":0.01211,"69":0.00908,"70":0.03331,"71":0.00606,"72":0.00908,"73":0.00908,"74":0.0757,"75":0.03028,"76":0.0212,"77":0.0212,"78":0.05753,"79":0.05148,"80":0.04542,"81":0.04239,"83":0.03028,"84":0.05148,"85":0.03634,"86":0.07267,"87":0.14534,"88":0.03634,"89":0.08781,"90":0.07873,"91":0.09387,"92":0.20893,"93":0.10901,"94":0.12112,"95":0.17865,"96":0.69947,"97":5.18091,"98":11.83342,"99":0.03634,"100":0.03331,"101":0.00606,_:"4 5 6 7 8 9 10 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 39 41 43 44 45 46 47 48 51 52 53 54 55 57 59 60 64 68"},F:{"70":0.01514,"79":0.00303,"80":0.01211,"81":0.00908,"82":0.08478,"83":0.62074,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.06056,"13":0.00606,"14":0.00606,"15":0.00606,"17":0.00606,"18":0.03028,"84":0.00606,"85":0.00606,"89":0.01211,"90":0.00303,"92":0.01514,"93":0.00606,"94":0.00606,"95":0.01211,"96":0.02725,"97":0.44814,"98":1.53217,_:"16 79 80 81 83 86 87 88 91"},E:{"4":0,"13":0.00606,"14":0.06359,"15":0.02422,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.00606,"10.1":0.00303,"11.1":0.00908,"12.1":0.01211,"13.1":0.03634,"14.1":0.08781,"15.1":0.06056,"15.2-15.3":0.08781,"15.4":0.00303},G:{"8":0.00142,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00142,"6.0-6.1":0,"7.0-7.1":0.01705,"8.1-8.4":0,"9.0-9.2":0.00142,"9.3":0.15486,"10.0-10.2":0,"10.3":0.19322,"11.0-11.2":0.50295,"11.3-11.4":0.11224,"12.0-12.1":0.05825,"12.2-12.5":4.07049,"13.0-13.1":0.03268,"13.2":0.01279,"13.3":0.12361,"13.4-13.7":0.37224,"14.0-14.4":1.43923,"14.5-14.8":1.86688,"15.0-15.1":1.87115,"15.2-15.3":3.28765,"15.4":0.0824},P:{"4":0.14791,"5.0-5.4":0.01056,"6.2-6.4":0.01056,"7.2-7.4":0.16904,"8.2":0.01049,"9.2":0.09508,"10.1":0.02035,"11.1-11.2":0.10565,"12.0":0.02113,"13.0":0.04226,"14.0":0.1796,"15.0":0.16904,"16.0":0.77124},I:{"0":0,"3":0,"4":0.00338,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00725,"4.2-4.3":0.00145,"4.4":0,"4.4.3-4.4.4":0.03672},A:{"11":0.06056,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01394},N:{_:"10 11"},R:{_:"0"},M:{"0":0.1255},Q:{"10.4":0.01394},O:{"0":0.2231},H:{"0":1.27392},L:{"0":55.51518},S:{"2.5":0.01394}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CK.js
new file mode 100644
index 0000000..d4aee64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CK.js
@@ -0,0 +1 @@
+module.exports={C:{"65":0.11824,"78":0.02056,"84":0.00514,"89":0.02571,"94":0.00514,"96":1.48061,"97":1.2544,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 88 90 91 92 93 95 98 99 3.5 3.6"},D:{"49":1.63998,"77":0.02056,"79":3.69124,"81":0.01542,"86":0.00514,"89":0.05141,"92":0.27761,"94":0.06169,"95":0.30846,"96":0.21078,"97":6.40055,"98":30.59923,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 80 83 84 85 87 88 90 91 93 99 100 101"},F:{"82":0.00514,"83":0.22106,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00514,"18":0.09254,"85":0.01028,"94":0.60664,"95":0.00514,"97":0.42156,"98":1.52688,_:"12 13 15 16 17 79 80 81 83 84 86 87 88 89 90 91 92 93 96"},E:{"4":0,"13":0.04113,"14":0.37015,"15":0.02056,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.01028,"12.1":0.01028,"13.1":0.15423,"14.1":0.32388,"15.1":0.18508,"15.2-15.3":0.22106},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00176,"10.0-10.2":0,"10.3":0.03524,"11.0-11.2":0.00529,"11.3-11.4":0.00176,"12.0-12.1":0.01938,"12.2-12.5":0.53561,"13.0-13.1":0.04405,"13.2":0.01938,"13.3":0.08633,"13.4-13.7":0.30304,"14.0-14.4":1.52225,"14.5-14.8":3.65939,"15.0-15.1":3.64882,"15.2-15.3":7.70639,"15.4":0.02643},P:{"4":0.03052,"5.0-5.4":0.02123,"6.2-6.4":0.04033,"7.2-7.4":0.28489,"8.2":0.01049,"9.2":0.03212,"10.1":0.02035,"11.1-11.2":0.18314,"12.0":0.02141,"13.0":0.16279,"14.0":0.17297,"15.0":0.0814,"16.0":3.05236},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.05344},A:{"10":0.17479,"11":0.10796,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.14088},Q:{"10.4":0},O:{"0":0.08744},H:{"0":0.0138},L:{"0":26.72829},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CL.js
new file mode 100644
index 0000000..6645e24
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CL.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01973,"67":0.00395,"73":0.00395,"78":0.01973,"81":0.00395,"84":0.00789,"88":0.00395,"90":0.01184,"91":0.01578,"94":0.00789,"95":0.01973,"96":0.5168,"97":0.85212,"98":0.00789,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 68 69 70 71 72 74 75 76 77 79 80 82 83 85 86 87 89 92 93 99 3.5 3.6"},D:{"22":0.00395,"38":0.03551,"39":0.00395,"47":0.01184,"48":0.00789,"49":0.05523,"53":0.01184,"56":0.01184,"63":0.00395,"65":0.00395,"67":0.00789,"68":0.00789,"69":0.13019,"70":0.00395,"72":0.00789,"74":0.00789,"75":0.00789,"76":0.00789,"77":0.01578,"78":0.00789,"79":0.13808,"80":0.01578,"81":0.00789,"83":0.01973,"84":0.02762,"85":0.03156,"86":0.02762,"87":0.08679,"88":0.01184,"89":0.11046,"90":0.01973,"91":0.08679,"92":0.06707,"93":0.0789,"94":0.03945,"95":0.05523,"96":0.47735,"97":7.92156,"98":18.89655,"99":0.00789,"100":0.00789,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 40 41 42 43 44 45 46 50 51 52 54 55 57 58 59 60 61 62 64 66 71 73 101"},F:{"36":0.00789,"80":0.00395,"81":0.00789,"82":1.20717,"83":2.9627,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01184,"84":0.00395,"90":0.01184,"92":0.00789,"94":0.00395,"95":0.01578,"96":0.03156,"97":0.54441,"98":1.93305,_:"12 13 14 15 16 17 79 80 81 83 85 86 87 88 89 91 93"},E:{"4":0,"13":0.0434,"14":0.07101,"15":0.06707,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00789,"12.1":0.01973,"13.1":0.1223,"14.1":0.33138,"15.1":0.14202,"15.2-15.3":0.29588},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00553,"6.0-6.1":0.00158,"7.0-7.1":0.00079,"8.1-8.4":0.00158,"9.0-9.2":0,"9.3":0.03869,"10.0-10.2":0.00079,"10.3":0.01816,"11.0-11.2":0.00474,"11.3-11.4":0.01184,"12.0-12.1":0.01184,"12.2-12.5":0.30242,"13.0-13.1":0.01184,"13.2":0.00553,"13.3":0.04027,"13.4-13.7":0.13344,"14.0-14.4":0.38611,"14.5-14.8":1.82081,"15.0-15.1":1.20256,"15.2-15.3":3.86587,"15.4":0.02527},P:{"4":0.1951,"5.0-5.4":0.0504,"6.2-6.4":0.04032,"7.2-7.4":0.07188,"8.2":0.01049,"9.2":0.03081,"10.1":0.04032,"11.1-11.2":0.12322,"12.0":0.02054,"13.0":0.11295,"14.0":0.16429,"15.0":0.11295,"16.0":1.3965},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00227,"4.2-4.3":0.00303,"4.4":0,"4.4.3-4.4.4":0.02498},A:{"8":0.01616,"9":0.00404,"10":0.00404,"11":0.1454,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.1756},Q:{"10.4":0},O:{"0":0.02422},H:{"0":0.18917},L:{"0":47.94809},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CM.js
new file mode 100644
index 0000000..f363752
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CM.js
@@ -0,0 +1 @@
+module.exports={C:{"4":0.00705,"28":0.00235,"31":0.00235,"32":0.00235,"33":0.00235,"34":0.0047,"35":0.00235,"36":0.00235,"37":0.0047,"38":0.00705,"39":0.0047,"40":0.0094,"41":0.0047,"42":0.0047,"43":0.0094,"47":0.00705,"48":0.00235,"49":0.00235,"50":0.0094,"51":0.0094,"52":0.11515,"56":0.00705,"58":0.0047,"60":0.0047,"62":0.01175,"64":0.0047,"66":0.00705,"67":0.0047,"68":0.00235,"69":0.0047,"70":0.00235,"72":0.01645,"73":0.00235,"78":0.0235,"79":0.0047,"80":0.00235,"81":0.0047,"82":0.00235,"84":0.01175,"85":0.00235,"86":0.00235,"87":0.00235,"88":0.0094,"89":0.0141,"90":0.00705,"91":0.0376,"92":0.0047,"93":0.0047,"94":0.0235,"95":0.0564,"96":0.9353,"97":1.37005,"98":0.0282,_:"2 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 44 45 46 53 54 55 57 59 61 63 65 71 74 75 76 77 83 99 3.5 3.6"},D:{"31":0.0047,"33":0.0047,"34":0.00235,"36":0.00235,"37":0.0047,"38":0.01175,"39":0.0047,"40":0.00705,"41":0.0047,"42":0.0094,"43":0.02585,"44":0.02585,"45":0.01175,"46":0.0047,"47":0.00235,"49":0.0141,"50":0.00235,"53":0.0329,"55":0.00235,"56":0.0564,"57":0.0047,"58":0.00705,"61":0.0047,"63":0.00705,"64":0.00235,"65":0.0047,"66":0.00235,"68":0.0611,"69":0.00705,"70":0.0094,"71":0.00235,"74":0.00705,"75":0.01645,"76":0.02585,"77":0.00705,"78":0.0047,"79":0.03995,"80":0.0141,"81":0.01645,"83":0.03995,"84":0.00705,"85":0.0094,"86":0.0846,"87":0.0423,"88":0.0376,"89":0.0282,"90":0.0705,"91":0.0658,"92":0.04465,"93":0.05405,"94":0.0376,"95":0.06815,"96":0.4183,"97":2.9845,"98":5.8186,"99":0.0047,"100":0.01175,_:"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 32 35 48 51 52 54 59 60 62 67 72 73 101"},F:{"38":0.0047,"42":0.00235,"44":0.00235,"67":0.00705,"79":0.0141,"80":0.00235,"82":0.1269,"83":0.79665,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 43 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.03055,"13":0.0141,"14":0.0329,"15":0.02115,"16":0.0141,"17":0.0141,"18":0.0517,"81":0.00235,"84":0.0329,"85":0.0141,"88":0.0141,"89":0.02115,"90":0.0141,"91":0.0047,"92":0.02115,"93":0.0094,"94":0.0047,"95":0.0188,"96":0.0376,"97":0.3713,"98":0.83425,_:"79 80 83 86 87"},E:{"4":0,"8":0.0047,"10":0.0094,"13":0.00705,"14":0.03055,"15":0.0047,_:"0 5 6 7 9 11 12 3.1 3.2 6.1 9.1 10.1 12.1 15.4","5.1":0.00705,"7.1":0.00705,"11.1":0.00705,"13.1":0.01175,"14.1":0.03055,"15.1":0.01645,"15.2-15.3":0.03055},G:{"8":0.00158,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00079,"6.0-6.1":0.00317,"7.0-7.1":0.01109,"8.1-8.4":0.01426,"9.0-9.2":0.00079,"9.3":0.03564,"10.0-10.2":0.01663,"10.3":0.07763,"11.0-11.2":0.25822,"11.3-11.4":0.04594,"12.0-12.1":0.39288,"12.2-12.5":1.9636,"13.0-13.1":0.07446,"13.2":0.05069,"13.3":0.19802,"13.4-13.7":0.49664,"14.0-14.4":1.39646,"14.5-14.8":1.21903,"15.0-15.1":0.91803,"15.2-15.3":0.73744,"15.4":0.00475},P:{"4":0.42401,"5.0-5.4":0.03103,"6.2-6.4":0.01048,"7.2-7.4":0.09308,"8.2":0.01077,"9.2":0.08273,"10.1":0.06074,"11.1-11.2":0.06205,"12.0":0.01034,"13.0":0.07239,"14.0":0.14478,"15.0":0.18615,"16.0":0.56879},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00163,"4.2-4.3":0.00476,"4.4":0,"4.4.3-4.4.4":0.04716},A:{"8":0.00961,"9":0.0024,"10":0.00721,"11":0.30744,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.0153},N:{_:"10 11"},R:{_:"0"},M:{"0":0.8262},Q:{"10.4":0.00765},O:{"0":0.80325},H:{"0":3.75163},L:{"0":67.96},S:{"2.5":0.0459}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CN.js
new file mode 100644
index 0000000..98f224a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CN.js
@@ -0,0 +1 @@
+module.exports={C:{"4":0.00328,"36":0.03609,"43":1.34521,"52":0.02625,"53":0.00328,"54":0.00328,"55":0.00328,"56":0.00656,"57":0.00656,"59":0.00328,"63":0.01312,"68":0.00328,"72":0.00984,"75":0.05578,"78":0.01641,"80":0.00656,"81":0.00656,"82":0.00984,"83":0.00656,"84":0.00656,"86":0.00328,"87":0.00984,"88":0.00328,"89":0.01312,"90":0.01641,"91":0.01969,"92":0.00328,"93":0.00328,"94":0.01641,"95":0.02625,"96":0.34122,"97":0.52496,_:"2 3 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 37 38 39 40 41 42 44 45 46 47 48 49 50 51 58 60 61 62 64 65 66 67 69 70 71 73 74 76 77 79 85 98 99 3.5 3.6"},D:{"11":0.00984,"17":0.00656,"31":0.00656,"39":0.00984,"40":0.00984,"41":0.00984,"42":0.00984,"43":0.00984,"44":0.00656,"45":0.01641,"46":0.00656,"47":0.01969,"48":0.08859,"49":0.09187,"50":0.00984,"51":0.00656,"52":0.00656,"53":0.01969,"54":0.01969,"55":0.05578,"56":0.01641,"57":0.11155,"58":0.01641,"59":0.01641,"60":0.00656,"61":0.00656,"62":0.13452,"63":0.04593,"64":0.00656,"65":0.04593,"66":0.00656,"67":0.02297,"68":0.01969,"69":1.02367,"70":0.60699,"71":0.01969,"72":0.58402,"73":0.04265,"74":0.32482,"75":0.29201,"76":0.01969,"77":0.01312,"78":0.23623,"79":0.22967,"80":0.11812,"81":0.08203,"83":0.21327,"84":0.18374,"85":0.10499,"86":0.26576,"87":0.14436,"88":0.10171,"89":0.03609,"90":0.0525,"91":0.06562,"92":0.34779,"93":0.03609,"94":0.11155,"95":0.19686,"96":0.60699,"97":1.68643,"98":2.63792,"100":0.00984,_:"4 5 6 7 8 9 10 12 13 14 15 16 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 36 37 38 99 101"},F:{"48":0.00328,"82":0.00656,"83":0.05906,_:"9 11 12 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 40 41 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.00656,"14":0.00656,"16":0.01312,"17":0.02297,"18":0.11484,"83":0.00328,"84":0.00328,"85":0.00656,"86":0.00984,"87":0.00656,"89":0.01641,"90":0.00328,"92":0.01969,"93":0.00984,"94":0.00984,"95":0.01641,"96":0.05906,"97":0.7776,"98":3.23507,_:"12 15 79 80 81 88 91"},E:{"4":0,"9":0.00984,"10":0.00328,"11":0.00656,"12":0.00656,"13":0.03281,"14":0.10827,"15":0.04265,_:"0 5 6 7 8 3.1 3.2 5.1 6.1 7.1","9.1":0.00328,"10.1":0.00656,"11.1":0.01312,"12.1":0.02297,"13.1":0.13124,"14.1":0.18702,"15.1":0.09187,"15.2-15.3":0.20342,"15.4":0.00656},G:{"8":0.00097,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.05456,"5.0-5.1":0.01754,"6.0-6.1":0.03313,"7.0-7.1":0.01072,"8.1-8.4":0.01754,"9.0-9.2":0.08184,"9.3":0.04774,"10.0-10.2":0.39654,"10.3":0.15102,"11.0-11.2":0.7015,"11.3-11.4":0.07794,"12.0-12.1":0.10815,"12.2-12.5":0.37121,"13.0-13.1":0.04384,"13.2":0.02533,"13.3":0.13348,"13.4-13.7":0.80478,"14.0-14.4":1.15358,"14.5-14.8":1.3991,"15.0-15.1":1.14286,"15.2-15.3":2.92486,"15.4":0.04287},P:{_:"4 5.0-5.4 6.2-6.4 7.2-7.4 8.2 9.2 10.1 11.1-11.2 12.0 13.0","14.0":0.01137,"15.0":0.02274,"16.0":0.40928},I:{"0":0,"3":0,"4":0.11157,"2.1":0,"2.2":0,"2.3":0,"4.1":0.04057,"4.2-4.3":0.071,"4.4":0,"4.4.3-4.4.4":0.29414},A:{"6":0.08023,"8":0.48139,"9":0.48139,"10":0.16046,"11":8.70514,_:"7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.1881},Q:{"10.4":5.74389},O:{"0":11.73635},H:{"0":0.12084},L:{"0":38.69867},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CO.js
new file mode 100644
index 0000000..71cbc20
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CO.js
@@ -0,0 +1 @@
+module.exports={C:{"50":0.00817,"52":0.01226,"78":0.01635,"84":0.00409,"88":0.01226,"89":0.00409,"90":0.02044,"91":0.02452,"93":0.00409,"94":0.00817,"95":0.02044,"96":0.39235,"97":0.64983,"98":0.00817,_:"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 40 41 42 43 44 45 46 47 48 49 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 92 99 3.5 3.6"},D:{"22":0.00409,"26":0.00409,"38":0.01635,"39":0.00409,"47":0.00817,"49":0.0327,"53":0.00409,"58":0.00817,"62":0.00817,"63":0.00409,"65":0.00817,"67":0.00817,"68":0.00409,"69":0.01226,"70":0.00817,"71":0.00817,"72":0.00817,"73":0.00409,"74":0.00817,"75":0.00817,"76":0.01635,"77":0.00817,"78":0.00817,"79":0.11852,"80":0.02452,"81":0.02044,"83":0.02861,"84":0.02861,"85":0.02044,"86":0.04496,"87":0.13487,"88":0.03678,"89":0.04904,"90":0.02861,"91":0.1267,"92":0.08583,"93":0.11852,"94":0.06131,"95":0.07765,"96":0.47818,"97":8.56635,"98":21.62023,"99":0.00817,"100":0.01226,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 33 34 35 36 37 40 41 42 43 44 45 46 48 50 51 52 54 55 56 57 59 60 61 64 66 101"},F:{"81":0.00409,"82":0.47818,"83":1.21384,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01226,"84":0.00409,"89":0.00409,"92":0.01226,"94":0.00817,"95":0.01226,"96":0.02452,"97":0.42914,"98":1.68384,_:"12 13 14 15 16 17 79 80 81 83 85 86 87 88 90 91 93"},E:{"4":0,"13":0.02044,"14":0.08583,"15":0.06131,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00409,"11.1":0.00817,"12.1":0.02044,"13.1":0.094,"14.1":0.22887,"15.1":0.13078,"15.2-15.3":0.24522},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00226,"6.0-6.1":0.00226,"7.0-7.1":0.00767,"8.1-8.4":0.0009,"9.0-9.2":0,"9.3":0.04062,"10.0-10.2":0.00045,"10.3":0.02392,"11.0-11.2":0.00271,"11.3-11.4":0.00812,"12.0-12.1":0.00451,"12.2-12.5":0.24373,"13.0-13.1":0.00587,"13.2":0.00181,"13.3":0.01896,"13.4-13.7":0.0677,"14.0-14.4":0.18686,"14.5-14.8":0.82959,"15.0-15.1":0.6987,"15.2-15.3":2.35382,"15.4":0.01038},P:{"4":0.1819,"5.0-5.4":0.0504,"6.2-6.4":0.0107,"7.2-7.4":0.0749,"8.2":0.01049,"9.2":0.03081,"10.1":0.04032,"11.1-11.2":0.0321,"12.0":0.02054,"13.0":0.0428,"14.0":0.0642,"15.0":0.0535,"16.0":0.83462},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00271,"4.2-4.3":0.00721,"4.4":0,"4.4.3-4.4.4":0.04329},A:{"11":0.11852,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.14189},Q:{"10.4":0},O:{"0":0.02365},H:{"0":0.11194},L:{"0":42.60527},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CR.js
new file mode 100644
index 0000000..e0f4e2e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CR.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01258,"73":0.04612,"78":0.02516,"82":0.00419,"83":0.02935,"88":0.20126,"89":0.00419,"90":0.03774,"91":0.04193,"94":0.00839,"95":0.02516,"96":0.85957,"97":1.39208,"98":0.01677,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 79 80 81 84 85 86 87 92 93 99 3.5 3.6"},D:{"38":0.00419,"47":0.00839,"49":0.02097,"52":0.00839,"63":0.00419,"65":0.02097,"67":0.05451,"68":0.00839,"69":0.00839,"73":0.00839,"75":0.00839,"77":0.01258,"78":0.00839,"79":0.03774,"80":0.01258,"81":0.02097,"83":0.01677,"84":0.00839,"85":0.00839,"86":0.05451,"87":0.06709,"88":0.01677,"89":0.02516,"90":0.01677,"91":0.0629,"92":0.0629,"93":0.85957,"94":0.03774,"95":0.10063,"96":0.77571,"97":7.32098,"98":18.84754,"99":0.01258,"100":0.00419,_:"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 39 40 41 42 43 44 45 46 48 50 51 53 54 55 56 57 58 59 60 61 62 64 66 70 71 72 74 76 101"},F:{"36":0.00419,"72":0.00839,"82":0.47381,"83":1.03148,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.02097,"18":0.00839,"84":0.00419,"89":0.00839,"91":0.00419,"92":0.01258,"94":0.00839,"95":0.02097,"96":0.02935,"97":0.80506,"98":2.74642,_:"12 13 14 15 16 79 80 81 83 85 86 87 88 90 93"},E:{"4":0,"13":0.05451,"14":0.18869,"15":0.1216,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1","5.1":0.00419,"10.1":0.00419,"11.1":0.03774,"12.1":0.03354,"13.1":0.239,"14.1":0.67088,"15.1":0.52832,"15.2-15.3":0.68765,"15.4":0.01677},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00612,"6.0-6.1":0,"7.0-7.1":0.01427,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.052,"10.0-10.2":0,"10.3":0.03772,"11.0-11.2":0.00408,"11.3-11.4":0.01427,"12.0-12.1":0.00918,"12.2-12.5":0.3385,"13.0-13.1":0.0051,"13.2":0.00306,"13.3":0.05506,"13.4-13.7":0.09074,"14.0-14.4":0.39355,"14.5-14.8":1.71695,"15.0-15.1":1.54158,"15.2-15.3":5.86046,"15.4":0.0469},P:{"4":0.14404,"5.0-5.4":0.02123,"6.2-6.4":0.04033,"7.2-7.4":0.11318,"8.2":0.01049,"9.2":0.01029,"10.1":0.02035,"11.1-11.2":0.07202,"12.0":0.02058,"13.0":0.11318,"14.0":0.11318,"15.0":0.13376,"16.0":2.30471},I:{"0":0,"3":0,"4":0.00849,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00243,"4.2-4.3":0.00728,"4.4":0,"4.4.3-4.4.4":0.06309},A:{"11":0.14676,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.31933},Q:{"10.4":0},O:{"0":0.05806},H:{"0":0.21437},L:{"0":40.84578},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CU.js
new file mode 100644
index 0000000..2918dc4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CU.js
@@ -0,0 +1 @@
+module.exports={C:{"17":0.00271,"23":0.00541,"24":0.02705,"26":0.00541,"34":0.02976,"35":0.00541,"37":0.00271,"38":0.00812,"40":0.02435,"41":0.00541,"42":0.00541,"43":0.01353,"44":0.00271,"45":0.01082,"46":0.00541,"47":0.02435,"48":0.01082,"49":0.00812,"50":0.02705,"51":0.00541,"52":0.18665,"53":0.00541,"54":0.21099,"55":0.00541,"56":0.03517,"57":0.09197,"58":0.01623,"59":0.01353,"60":0.0514,"61":0.02164,"62":0.02164,"63":0.01353,"64":0.02976,"65":0.06492,"66":0.05681,"67":0.04328,"68":0.03787,"69":0.01623,"70":0.02705,"71":0.0514,"72":0.14878,"73":0.02164,"74":0.01353,"75":0.01353,"76":0.01082,"77":0.03787,"78":0.08927,"79":0.03246,"80":0.02435,"81":0.04058,"82":0.04328,"83":0.02705,"84":0.05681,"85":0.03246,"86":0.02705,"87":0.02705,"88":0.11632,"89":0.11632,"90":0.06763,"91":0.23534,"92":0.11632,"93":0.12714,"94":0.21099,"95":0.38682,"96":3.23789,"97":4.20087,"98":0.07574,"99":0.00271,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 18 19 20 21 22 25 27 28 29 30 31 32 33 36 39 3.5 3.6"},D:{"22":0.00541,"38":0.00271,"45":0.00541,"48":0.00541,"49":0.00541,"53":0.00271,"54":0.00271,"56":0.00541,"59":0.00271,"60":0.00271,"62":0.01623,"63":0.01353,"64":0.00271,"65":0.00271,"66":0.00541,"67":0.00812,"68":0.03246,"69":0.00271,"70":0.00812,"71":0.01623,"72":0.01623,"73":0.00271,"74":0.01894,"75":0.02435,"76":0.00541,"77":0.01894,"78":0.00541,"79":0.05681,"80":0.04599,"81":0.04869,"83":0.02705,"84":0.02705,"85":0.08386,"86":0.11361,"87":0.12714,"88":0.21099,"89":0.04328,"90":0.12443,"91":0.08115,"92":0.06492,"93":0.02705,"94":0.08656,"95":0.08656,"96":0.78445,"97":2.17482,"98":4.04668,"99":0.00541,"100":0.00541,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 46 47 50 51 52 55 57 58 61 101"},F:{"40":0.00271,"42":0.00541,"52":0.00271,"64":0.00812,"71":0.01623,"74":0.00541,"75":0.01082,"77":0.00541,"79":0.01082,"80":0.01623,"81":0.02164,"82":0.15148,"83":0.71953,_:"9 11 12 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 41 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 60 62 63 65 66 67 68 69 70 72 73 76 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01082,"13":0.01623,"14":0.01623,"15":0.01353,"16":0.01353,"17":0.01894,"18":0.09197,"84":0.02976,"85":0.01353,"86":0.00541,"87":0.00271,"89":0.02435,"90":0.07845,"91":0.02435,"92":0.03246,"93":0.00541,"94":0.00541,"95":0.02435,"96":0.04328,"97":0.38411,"98":0.73847,_:"79 80 81 83 88"},E:{"4":0,"13":0.01894,"14":0.01623,"15":0.01082,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.03517,"11.1":0.00271,"12.1":0.00812,"13.1":0.01082,"14.1":0.03246,"15.1":0.02435,"15.2-15.3":0.02705},G:{"8":0.00117,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00117,"6.0-6.1":0,"7.0-7.1":0.02643,"8.1-8.4":0.03466,"9.0-9.2":0.00294,"9.3":0.13158,"10.0-10.2":0.0094,"10.3":0.06696,"11.0-11.2":0.06873,"11.3-11.4":0.03231,"12.0-12.1":0.03524,"12.2-12.5":0.90695,"13.0-13.1":0.03524,"13.2":0.03759,"13.3":0.16271,"13.4-13.7":0.39826,"14.0-14.4":1.06907,"14.5-14.8":0.67258,"15.0-15.1":0.88639,"15.2-15.3":1.28935,"15.4":0.00294},P:{"4":0.35891,"5.0-5.4":0.05127,"6.2-6.4":0.03076,"7.2-7.4":0.28713,"8.2":0.02051,"9.2":0.1128,"10.1":0.06153,"11.1-11.2":0.15382,"12.0":0.05127,"13.0":0.16407,"14.0":0.28713,"15.0":0.19484,"16.0":1.00496},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00537,"4.2-4.3":0.04836,"4.4":0,"4.4.3-4.4.4":0.21614},A:{"8":0.00271,"9":0.01082,"11":0.08656,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.88987},Q:{"10.4":0.00729},O:{"0":0.17506},H:{"0":1.19465},L:{"0":65.90979},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CV.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CV.js
new file mode 100644
index 0000000..cb723f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CV.js
@@ -0,0 +1 @@
+module.exports={C:{"29":0.0083,"35":0.00415,"48":0.00415,"52":0.0747,"61":0.0332,"72":0.02905,"78":0.0166,"88":0.0083,"91":0.0166,"94":0.0332,"95":0.01245,"96":0.8798,"97":1.6849,_:"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 30 31 32 33 34 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 59 60 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 89 90 92 93 98 99 3.5 3.6"},D:{"38":0.0166,"42":0.0083,"43":0.0498,"49":0.07055,"50":0.0083,"55":0.00415,"62":0.00415,"63":0.0083,"65":0.0166,"67":0.0083,"70":0.0166,"71":0.0249,"73":0.0083,"74":0.00415,"75":0.00415,"76":0.01245,"77":0.0166,"78":0.0166,"79":0.0498,"80":0.03735,"81":0.02905,"83":0.0249,"84":0.00415,"85":0.0083,"86":0.01245,"87":0.05395,"88":0.02905,"89":0.07055,"90":0.0498,"91":0.2158,"92":0.02075,"93":0.0498,"94":0.0415,"95":0.0415,"96":0.6059,"97":8.5324,"98":18.3513,"99":0.0166,_:"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 39 40 41 44 45 46 47 48 51 52 53 54 56 57 58 59 60 61 64 66 68 69 72 100 101"},F:{"82":0.12035,"83":2.39455,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.0166,"16":0.00415,"17":0.00415,"18":0.0249,"85":0.0083,"89":0.01245,"92":0.0498,"94":0.04565,"96":0.166,"97":0.6889,"98":2.85105,_:"12 13 14 79 80 81 83 84 86 87 88 90 91 93 95"},E:{"4":0,"13":0.0083,"14":0.03735,"15":0.0913,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.0581,"11.1":0.0581,"12.1":0.00415,"13.1":0.083,"14.1":0.1743,"15.1":0.1328,"15.2-15.3":0.4067,"15.4":0.01245},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00173,"7.0-7.1":0.05029,"8.1-8.4":0.00347,"9.0-9.2":0,"9.3":0.04422,"10.0-10.2":0.0026,"10.3":0.11532,"11.0-11.2":0.11792,"11.3-11.4":0.01214,"12.0-12.1":0.02428,"12.2-12.5":1.35347,"13.0-13.1":0.00434,"13.2":0.0104,"13.3":0.21069,"13.4-13.7":0.26965,"14.0-14.4":0.97283,"14.5-14.8":1.22775,"15.0-15.1":0.91041,"15.2-15.3":3.32255,"15.4":0.01127},P:{"4":0.25791,"5.0-5.4":0.02063,"6.2-6.4":0.01048,"7.2-7.4":0.13411,"8.2":0.01077,"9.2":0.03095,"10.1":0.02185,"11.1-11.2":0.23727,"12.0":0.71182,"13.0":0.13411,"14.0":0.17538,"15.0":0.21664,"16.0":1.21732},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00068,"4.2-4.3":0.00406,"4.4":0,"4.4.3-4.4.4":0.05962},A:{"11":0.1245,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.24574},Q:{"10.4":0},O:{"0":0.14042},H:{"0":0.37668},L:{"0":46.15481},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CX.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CX.js
new file mode 100644
index 0000000..71ebfd2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CX.js
@@ -0,0 +1 @@
+module.exports={C:{_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 3.5 3.6"},D:{"97":38.46,"98":46.152,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 99 100 101"},F:{_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98"},E:{"4":0,"13":11.538,_:"0 5 6 7 8 9 10 11 12 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1 15.1 15.2-15.3 15.4"},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":3.85,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0},P:{"4":0.1951,"5.0-5.4":0.0504,"6.2-6.4":0.04032,"7.2-7.4":0.07188,"8.2":0.01049,"9.2":0.03081,"10.1":0.04032,"11.1-11.2":0.12322,"12.0":0.02054,"13.0":0.11295,"14.0":0.16429,"15.0":0.11295,"16.0":1.3965},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{_:"6 7 8 9 10 11 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0},H:{"0":0},L:{"0":0},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CY.js
new file mode 100644
index 0000000..23a9dd0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CY.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.29724,"78":0.03468,"80":0.00495,"83":0.01982,"84":0.00495,"88":0.02972,"91":0.02972,"92":0.00495,"94":0.00991,"95":0.02477,"96":0.63411,"97":1.11465,"98":0.00495,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 81 82 85 86 87 89 90 93 99 3.5 3.6"},D:{"38":0.02972,"42":1.4862,"47":0.01486,"49":0.05449,"53":0.02477,"54":0.00991,"56":0.00495,"57":0.00991,"62":0.00991,"65":0.01486,"69":0.00991,"70":1.48125,"71":0.01486,"73":0.00991,"74":0.01486,"76":0.00991,"77":0.03468,"79":0.16348,"80":0.00495,"81":0.02477,"83":0.01982,"84":0.01982,"85":0.02972,"86":0.03963,"87":0.1288,"88":0.01486,"89":0.06936,"90":0.01982,"91":0.04459,"92":0.03468,"93":0.05449,"94":0.02477,"95":0.04459,"96":0.70842,"97":9.95754,"98":21.55981,_:"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 39 40 41 43 44 45 46 48 50 51 52 55 58 59 60 61 63 64 66 67 68 72 75 78 99 100 101"},F:{"28":0.01982,"46":0.00495,"82":0.34678,"83":1.09483,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00991,"16":0.00495,"18":0.01982,"83":0.00495,"90":0.00991,"91":0.00991,"94":0.00495,"96":0.01982,"97":1.01557,"98":4.13164,_:"12 13 14 17 79 80 81 84 85 86 87 88 89 92 93 95"},E:{"4":0,"13":0.02972,"14":0.25265,"15":0.1189,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.00495,"11.1":0.00991,"12.1":0.02477,"13.1":0.8719,"14.1":0.59943,"15.1":0.29229,"15.2-15.3":0.60439,"15.4":0.00495},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00121,"6.0-6.1":0,"7.0-7.1":0.00969,"8.1-8.4":0,"9.0-9.2":0.00606,"9.3":0.06058,"10.0-10.2":0.00485,"10.3":0.10299,"11.0-11.2":0.09572,"11.3-11.4":0.01575,"12.0-12.1":0.01817,"12.2-12.5":0.4895,"13.0-13.1":0.03998,"13.2":0.00969,"13.3":0.04483,"13.4-13.7":0.20356,"14.0-14.4":0.57432,"14.5-14.8":2.31061,"15.0-15.1":1.8308,"15.2-15.3":6.263,"15.4":0.02908},P:{"4":0.20749,"5.0-5.4":0.05127,"6.2-6.4":0.03076,"7.2-7.4":0.01037,"8.2":0.02051,"9.2":0.1128,"10.1":0.06153,"11.1-11.2":0.06225,"12.0":0.03112,"13.0":0.07262,"14.0":0.07262,"15.0":0.10375,"16.0":3.14353},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00128,"4.2-4.3":0.00514,"4.4":0,"4.4.3-4.4.4":0.0289},A:{"9":0.01486,"11":0.22293,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.1867},Q:{"10.4":0},O:{"0":0.79727},H:{"0":0.39651},L:{"0":32.4087},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CZ.js
new file mode 100644
index 0000000..2b38b96
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/CZ.js
@@ -0,0 +1 @@
+module.exports={C:{"50":0.01181,"52":0.17119,"56":0.02361,"66":0.01181,"68":0.01181,"78":0.05313,"80":0.0059,"82":0.0059,"84":0.0059,"86":0.01181,"87":0.0059,"88":0.02952,"89":0.01771,"90":0.01181,"91":0.21251,"92":0.02952,"93":0.05313,"94":0.25383,"95":0.11806,"96":2.5501,"97":4.1262,"98":0.01771,_:"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 40 41 42 43 44 45 46 47 48 49 51 53 54 55 57 58 59 60 61 62 63 64 65 67 69 70 71 72 73 74 75 76 77 79 81 83 85 99 3.5 3.6"},D:{"38":0.01181,"42":0.0059,"49":0.07674,"53":0.0059,"58":0.01181,"60":0.01181,"63":0.0059,"65":0.0059,"67":0.01181,"68":0.0059,"70":0.0059,"72":0.01771,"73":0.0059,"74":0.0059,"76":0.01181,"77":0.01181,"78":0.01771,"79":0.08855,"80":0.02952,"81":0.05313,"83":0.02952,"84":0.04132,"85":0.03542,"86":0.05313,"87":0.08264,"88":0.02361,"89":0.08264,"90":0.08855,"91":0.09445,"92":0.04722,"93":0.43682,"94":0.04722,"95":0.07674,"96":0.64933,"97":10.74346,"98":22.68523,"99":0.0059,"100":0.01181,_:"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 39 40 41 43 44 45 46 47 48 50 51 52 54 55 56 57 59 61 62 64 66 69 71 75 101"},F:{"46":0.01181,"77":0.0059,"79":0.0059,"80":0.0059,"82":0.61391,"83":2.56781,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6","10.0-10.1":0,"12.1":0.02952},B:{"15":0.01181,"16":0.01181,"17":0.01181,"18":0.02361,"89":0.0059,"90":0.02361,"91":0.01181,"92":0.01181,"93":0.0059,"94":0.0059,"95":0.02361,"96":0.07674,"97":1.62923,"98":5.66098,_:"12 13 14 79 80 81 83 84 85 86 87 88"},E:{"4":0,"13":0.01771,"14":0.17709,"15":0.11216,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.01181,"11.1":0.01181,"12.1":0.02952,"13.1":0.17709,"14.1":0.56669,"15.1":0.34828,"15.2-15.3":0.74968,"15.4":0.01181},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00185,"5.0-5.1":0.00278,"6.0-6.1":0,"7.0-7.1":0.00093,"8.1-8.4":0.00648,"9.0-9.2":0,"9.3":0.03797,"10.0-10.2":0.00093,"10.3":0.05279,"11.0-11.2":0.01019,"11.3-11.4":0.01111,"12.0-12.1":0.01204,"12.2-12.5":0.24912,"13.0-13.1":0.00648,"13.2":0.00648,"13.3":0.025,"13.4-13.7":0.10095,"14.0-14.4":0.27598,"14.5-14.8":1.42343,"15.0-15.1":1.36971,"15.2-15.3":5.57794,"15.4":0.08705},P:{"4":0.12663,"5.0-5.4":0.05127,"6.2-6.4":0.03076,"7.2-7.4":0.01037,"8.2":0.02051,"9.2":0.1128,"10.1":0.06153,"11.1-11.2":0.04221,"12.0":0.03112,"13.0":0.03166,"14.0":0.06331,"15.0":0.06331,"16.0":1.8361},I:{"0":0,"3":0,"4":0.00456,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00456,"4.2-4.3":0.01141,"4.4":0,"4.4.3-4.4.4":0.0696},A:{"8":0.01192,"9":0.01192,"10":0.0417,"11":0.57789,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.32776},Q:{"10.4":0},O:{"0":0.15159},H:{"0":0.512},L:{"0":27.81883},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DE.js
new file mode 100644
index 0000000..b935a04
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DE.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.01089,"50":0.00545,"51":0.01089,"52":0.13615,"56":0.00545,"59":0.02178,"60":0.01089,"65":0.00545,"66":0.01089,"68":0.02723,"69":0.00545,"70":0.01089,"72":0.01089,"76":0.00545,"77":0.11437,"78":0.20695,"79":0.07624,"80":0.02723,"81":0.08169,"82":0.02178,"83":0.02178,"84":0.02178,"85":0.01089,"86":0.04901,"87":0.01634,"88":0.03812,"89":0.03268,"90":0.28319,"91":0.38122,"92":0.02723,"93":0.02723,"94":0.12526,"95":0.1416,"96":3.79586,"97":5.79454,"98":0.01634,_:"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 40 41 42 43 44 45 46 47 49 53 54 55 57 58 61 62 63 64 67 71 73 74 75 99 3.5 3.6"},D:{"35":0.01089,"38":0.00545,"49":0.04901,"51":0.03812,"52":0.02723,"56":0.00545,"60":0.01089,"63":0.00545,"65":0.11437,"66":0.09803,"67":0.01089,"68":0.00545,"69":0.0708,"70":0.02723,"71":0.02178,"72":0.03268,"73":0.00545,"74":0.01089,"75":1.54666,"76":0.01634,"77":0.01089,"78":0.03268,"79":0.08714,"80":0.38667,"81":0.04357,"83":0.08714,"84":0.19606,"85":0.18516,"86":0.22329,"87":0.17427,"88":0.03812,"89":0.05446,"90":0.07624,"91":0.06535,"92":0.0708,"93":0.31042,"94":0.31042,"95":0.07624,"96":0.36488,"97":5.9906,"98":12.61294,"99":0.01089,"100":0.01089,_:"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 36 37 39 40 41 42 43 44 45 46 47 48 50 53 54 55 57 58 59 61 62 64 101"},F:{"36":0.00545,"46":0.00545,"68":0.00545,"69":0.00545,"70":0.00545,"71":0.01089,"77":0.01089,"78":0.00545,"79":0.01634,"80":0.01089,"81":0.00545,"82":0.94216,"83":2.73389,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 72 73 74 75 76 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05991,"15":0.00545,"16":0.00545,"17":0.01634,"18":0.04357,"84":0.01089,"85":0.01634,"86":0.01634,"87":0.00545,"89":0.01089,"90":0.01089,"91":0.01634,"92":0.01634,"93":0.01089,"94":0.02178,"95":0.03812,"96":0.11981,"97":1.59023,"98":5.30985,_:"13 14 79 80 81 83 88"},E:{"4":0,"7":0.00545,"12":0.00545,"13":0.04901,"14":0.35944,"15":0.23962,_:"0 5 6 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.02178,"10.1":0.00545,"11.1":0.05446,"12.1":0.06535,"13.1":0.3431,"14.1":1.17634,"15.1":0.83868,"15.2-15.3":1.75906,"15.4":0.02178},G:{"8":0.00322,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00322,"6.0-6.1":0,"7.0-7.1":0.00483,"8.1-8.4":0.00161,"9.0-9.2":0.01608,"9.3":0.08524,"10.0-10.2":0.00483,"10.3":0.08685,"11.0-11.2":0.0193,"11.3-11.4":0.08203,"12.0-12.1":0.01608,"12.2-12.5":0.41657,"13.0-13.1":0.01608,"13.2":0.00643,"13.3":0.04343,"13.4-13.7":0.16566,"14.0-14.4":0.53559,"14.5-14.8":2.62164,"15.0-15.1":2.28549,"15.2-15.3":9.60355,"15.4":0.0579},P:{"4":0.11566,"5.0-5.4":0.01051,_:"6.2-6.4 7.2-7.4 8.2 9.2 10.1","11.1-11.2":0.04206,"12.0":0.02103,"13.0":0.10515,"14.0":0.09463,"15.0":1.21974,"16.0":4.14291},I:{"0":0,"3":0,"4":0.00121,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00241,"4.2-4.3":0.00603,"4.4":0,"4.4.3-4.4.4":0.03134},A:{"6":0.01135,"7":0.00567,"8":0.02836,"9":0.02269,"10":0.01135,"11":0.46518,_:"5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.84249},Q:{"10.4":0},O:{"0":0.14117},H:{"0":0.43114},L:{"0":22.11709},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DJ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DJ.js
new file mode 100644
index 0000000..7529b54
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DJ.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00939,"71":0.00939,"78":0.00626,"81":0.00626,"91":0.04068,"95":0.01877,"96":0.87299,"97":1.10454,"98":0.01877,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 79 80 82 83 84 85 86 87 88 89 90 92 93 94 99 3.5 3.6"},D:{"11":0.00313,"37":0.0219,"43":0.00313,"46":0.05006,"47":0.00939,"49":0.06258,"50":0.00313,"53":0.01252,"55":0.04068,"58":0.00939,"59":0.13455,"65":0.00626,"67":0.00313,"68":0.00939,"69":0.00626,"72":0.00626,"78":0.01565,"79":0.00939,"80":0.00626,"81":0.01252,"83":0.03755,"84":0.00626,"85":0.00939,"86":0.02816,"87":0.03755,"88":0.00626,"90":0.00626,"91":0.23468,"92":0.25971,"93":0.01252,"94":0.03442,"95":0.02503,"96":0.2378,"97":5.93884,"98":13.20438,"100":0.04068,_:"4 5 6 7 8 9 10 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 38 39 40 41 42 44 45 48 51 52 54 56 57 60 61 62 63 64 66 70 71 73 74 75 76 77 89 99 101"},F:{"74":0.56635,"82":0.05006,"83":0.28474,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01252,"13":0.00313,"14":0.00626,"15":0.01252,"17":0.04694,"18":0.07823,"84":0.00313,"85":0.01565,"89":0.01565,"90":0.06571,"91":0.00626,"92":0.01565,"93":0.00626,"94":0.00626,"95":0.00626,"96":0.03755,"97":0.75409,"98":3.22913,_:"16 79 80 81 83 86 87 88"},E:{"4":0,"13":0.00626,"14":0.15019,"15":0.06571,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 15.4","12.1":0.01877,"13.1":0.18774,"14.1":0.1189,"15.1":0.24093,"15.2-15.3":0.22216},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00417,"8.1-8.4":0.0025,"9.0-9.2":0.00334,"9.3":0.00667,"10.0-10.2":0,"10.3":0.02169,"11.0-11.2":0.01001,"11.3-11.4":0.04672,"12.0-12.1":0.02336,"12.2-12.5":0.29782,"13.0-13.1":0.04338,"13.2":0.00834,"13.3":0.40043,"13.4-13.7":0.22023,"14.0-14.4":0.69157,"14.5-14.8":2.26325,"15.0-15.1":1.6526,"15.2-15.3":2.63614,"15.4":0.00918},P:{"4":0.36466,"5.0-5.4":0.01013,"6.2-6.4":0.04052,"7.2-7.4":0.75971,"8.2":0.02051,"9.2":0.08104,"10.1":0.06153,"11.1-11.2":0.27349,"12.0":0.13168,"13.0":0.24311,"14.0":0.25324,"15.0":0.40518,"16.0":3.33258},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00907,"4.4":0,"4.4.3-4.4.4":0.06651},A:{"11":0.18148,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.09619},Q:{"10.4":0.28858},O:{"0":2.31553},H:{"0":0.34477},L:{"0":52.00312},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DK.js
new file mode 100644
index 0000000..d6464df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DK.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.04172,"70":0.01391,"78":0.05563,"84":0.01391,"87":0.04868,"89":0.01391,"90":0.01391,"91":0.07649,"92":0.00695,"93":0.00695,"94":0.02086,"95":0.02086,"96":0.80666,"97":1.24477,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 79 80 81 82 83 85 86 88 98 99 3.5 3.6"},D:{"38":0.00695,"49":0.04868,"52":0.01391,"59":0.01391,"66":0.01391,"67":0.00695,"69":0.22948,"70":0.01391,"72":0.00695,"73":0.00695,"75":0.02086,"76":0.14603,"77":0.01391,"78":0.02086,"79":0.06954,"80":0.09736,"81":0.01391,"83":0.02086,"84":0.02782,"85":0.02086,"86":0.02782,"87":0.15299,"88":0.03477,"89":0.10431,"90":0.04868,"91":0.15299,"92":0.13213,"93":0.42419,"94":0.14603,"95":0.25034,"96":1.53683,"97":17.2181,"98":28.50445,"99":0.00695,"100":0.00695,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 53 54 55 56 57 58 60 61 62 63 64 65 68 71 74 101"},F:{"82":0.33379,"83":0.86925,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01391,"86":0.01391,"88":0.00695,"89":0.00695,"90":0.01391,"92":0.01391,"94":0.01391,"95":0.02782,"96":0.0904,"97":1.25867,"98":4.47838,_:"12 13 14 15 16 17 79 80 81 83 84 85 87 91 93"},E:{"4":0,"5":0.00695,"8":0.00695,"12":0.00695,"13":0.0904,"14":0.79971,"15":0.48678,_:"0 6 7 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.03477,"12.1":0.09736,"13.1":0.53546,"14.1":2.65643,"15.1":1.12655,"15.2-15.3":2.09315,"15.4":0.01391},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.0037,"9.0-9.2":0.03333,"9.3":0.06111,"10.0-10.2":0.00185,"10.3":0.11481,"11.0-11.2":0.02407,"11.3-11.4":0.02407,"12.0-12.1":0.02222,"12.2-12.5":0.47961,"13.0-13.1":0.01667,"13.2":0.00556,"13.3":0.04815,"13.4-13.7":0.2074,"14.0-14.4":0.60924,"14.5-14.8":4.0795,"15.0-15.1":2.57399,"15.2-15.3":10.17006,"15.4":0.03518},P:{"4":0.01101,"5.0-5.4":0.05127,"6.2-6.4":0.03076,"7.2-7.4":0.01037,"8.2":0.02051,"9.2":0.1128,"10.1":0.06153,"11.1-11.2":0.04221,"12.0":0.03112,"13.0":0.02202,"14.0":0.02202,"15.0":0.03303,"16.0":1.39836},I:{"0":0,"3":0.00075,"4":0.00527,"2.1":0.00226,"2.2":0.00301,"2.3":0.00301,"4.1":0.00226,"4.2-4.3":0.00904,"4.4":0,"4.4.3-4.4.4":0.04141},A:{"8":0.00695,"10":0.06259,"11":0.37552,_:"6 7 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.28937},Q:{"10.4":0},O:{"0":0.01523},H:{"0":0.08363},L:{"0":9.99421},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DM.js
new file mode 100644
index 0000000..8dcd7e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DM.js
@@ -0,0 +1 @@
+module.exports={C:{"68":0.01016,"77":0.0762,"79":0.02032,"88":0.00508,"95":0.00508,"96":0.30988,"97":0.42164,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 78 80 81 82 83 84 85 86 87 89 90 91 92 93 94 98 99 3.5 3.6"},D:{"38":0.1016,"49":0.01016,"58":0.01016,"63":0.01016,"65":0.01016,"69":0.51816,"74":0.00508,"75":0.14732,"76":1.78816,"77":0.18796,"78":0.01524,"79":0.06604,"81":0.13208,"83":0.03556,"85":0.01524,"87":0.01524,"88":0.06096,"89":0.00508,"90":0.51816,"91":0.03556,"92":0.04064,"93":0.11176,"94":0.06096,"95":0.03048,"96":0.41656,"97":8.68172,"98":19.15668,"99":0.26924,"100":0.02032,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 59 60 61 62 64 66 67 68 70 71 72 73 80 84 86 101"},F:{"82":0.05588,"83":0.22352,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.0254,"18":0.02032,"92":1.45288,"94":0.01016,"95":0.01016,"96":0.09144,"97":1.38176,"98":4.54152,_:"12 13 14 15 17 79 80 81 83 84 85 86 87 88 89 90 91 93"},E:{"4":0,"14":0.10668,"15":0.03556,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1 11.1","10.1":0.00508,"12.1":0.01524,"13.1":0.1016,"14.1":0.42672,"15.1":0.23368,"15.2-15.3":1.18872,"15.4":0.01016},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00124,"6.0-6.1":0.00124,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07302,"10.0-10.2":0,"10.3":0.0328,"11.0-11.2":0.013,"11.3-11.4":0.0099,"12.0-12.1":0.00124,"12.2-12.5":0.2271,"13.0-13.1":0.00186,"13.2":0.00309,"13.3":0.03651,"13.4-13.7":0.02228,"14.0-14.4":0.11943,"14.5-14.8":0.99258,"15.0-15.1":1.34654,"15.2-15.3":3.30261,"15.4":0.00619},P:{"4":0.08541,"5.0-5.4":0.01013,"6.2-6.4":0.04052,"7.2-7.4":0.10676,"8.2":0.02051,"9.2":0.01068,"10.1":0.06153,"11.1-11.2":0.03203,"12.0":0.13168,"13.0":0.10676,"14.0":0.03203,"15.0":0.04271,"16.0":3.92887},I:{"0":0,"3":0,"4":0.02104,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01403,"4.4":0,"4.4.3-4.4.4":0.11748},A:{"11":0.12192,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.14763},Q:{"10.4":0},O:{"0":0.21652},H:{"0":0.06522},L:{"0":37.02149},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DO.js
new file mode 100644
index 0000000..ebe58ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DO.js
@@ -0,0 +1 @@
+module.exports={C:{"44":0.00789,"52":0.01184,"66":0.00395,"73":0.02368,"78":0.01184,"79":0.00789,"80":0.01184,"81":0.01974,"84":0.00789,"87":0.00789,"88":0.01579,"89":0.00789,"90":0.01184,"91":0.01184,"92":0.00789,"93":0.00395,"94":0.00789,"95":0.01974,"96":0.41838,"97":0.68678,"98":0.00789,_:"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 40 41 42 43 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 67 68 69 70 71 72 74 75 76 77 82 83 85 86 99 3.5 3.6"},D:{"38":0.01974,"39":0.00395,"47":0.01184,"48":0.01579,"49":0.1342,"55":0.00395,"63":0.00789,"65":0.02368,"67":0.00395,"70":0.00789,"72":0.01184,"74":0.00789,"75":0.01184,"76":0.03158,"77":0.00789,"78":0.01184,"79":0.04736,"80":0.03552,"81":0.01974,"83":0.07105,"84":0.0671,"85":0.08289,"86":0.09473,"87":0.16183,"88":0.03947,"89":0.0671,"90":0.0671,"91":0.07894,"92":0.05921,"93":0.50522,"94":0.05131,"95":0.08289,"96":0.48548,"97":7.7006,"98":17.8878,"99":0.00395,"100":0.01184,_:"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 40 41 42 43 44 45 46 50 51 52 53 54 56 57 58 59 60 61 62 64 66 68 69 71 73 101"},F:{"69":0.00789,"71":0.00395,"82":0.34734,"83":1.01833,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 70 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00395,"17":0.00789,"18":0.15788,"84":0.00395,"87":0.01184,"89":0.01579,"90":0.01184,"92":0.01579,"93":0.00395,"94":0.00395,"95":0.01579,"96":0.03158,"97":0.59994,"98":2.22611,_:"12 13 14 16 79 80 81 83 85 86 88 91"},E:{"4":0,"12":0.00395,"13":0.01579,"14":0.21709,"15":0.13025,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1","5.1":0.03158,"10.1":0.00789,"11.1":0.01184,"12.1":0.03552,"13.1":0.15393,"14.1":0.42628,"15.1":0.22893,"15.2-15.3":0.43812,"15.4":0.00789},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00282,"6.0-6.1":0.00282,"7.0-7.1":0.04231,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05642,"10.0-10.2":0.00564,"10.3":0.05642,"11.0-11.2":0.01692,"11.3-11.4":0.02398,"12.0-12.1":0.02116,"12.2-12.5":0.60788,"13.0-13.1":0.02962,"13.2":0.00846,"13.3":0.08039,"13.4-13.7":0.23836,"14.0-14.4":0.90407,"14.5-14.8":3.23827,"15.0-15.1":2.14239,"15.2-15.3":6.55694,"15.4":0.06629},P:{"4":0.14025,"5.0-5.4":0.01013,"6.2-6.4":0.04052,"7.2-7.4":0.0971,"8.2":0.02051,"9.2":0.01079,"10.1":0.06153,"11.1-11.2":0.19419,"12.0":0.13168,"13.0":0.05394,"14.0":0.05394,"15.0":0.07552,"16.0":1.1112},I:{"0":0,"3":0,"4":0.0009,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00269,"4.2-4.3":0.00359,"4.4":0,"4.4.3-4.4.4":0.04124},A:{"6":0.00448,"7":0.00448,"8":0.03136,"9":0.01344,"10":0.01792,"11":0.09409,_:"5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.28444},Q:{"10.4":0},O:{"0":0.06657},H:{"0":0.22346},L:{"0":34.93743},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DZ.js
new file mode 100644
index 0000000..4b5928d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/DZ.js
@@ -0,0 +1 @@
+module.exports={C:{"15":0.01468,"29":0.00367,"30":0.00734,"32":0.00367,"33":0.00367,"34":0.00367,"35":0.00367,"36":0.00367,"37":0.00367,"38":0.01101,"39":0.00734,"40":0.00367,"41":0.00367,"43":0.01101,"47":0.01836,"48":0.00734,"52":0.18355,"56":0.00734,"68":0.00367,"72":0.02203,"77":0.00367,"78":0.01468,"79":0.00734,"80":0.00367,"81":0.00367,"83":0.00734,"84":0.07709,"86":0.00367,"87":0.00734,"88":0.01468,"89":0.02937,"90":0.00367,"91":0.05139,"92":0.00734,"93":0.00734,"94":0.02203,"95":0.04405,"96":0.88471,"97":1.68866,"98":0.0257,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 16 17 18 19 20 21 22 23 24 25 26 27 28 31 42 44 45 46 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 82 85 99 3.5 3.6"},D:{"11":0.00367,"18":0.00734,"22":0.00734,"25":0.00367,"26":0.01101,"30":0.00734,"31":0.01101,"32":0.00734,"33":0.03304,"34":0.00734,"37":0.00367,"38":0.01468,"39":0.02203,"40":0.02937,"42":0.01101,"43":0.24596,"46":0.00367,"47":0.01101,"48":0.00367,"49":0.20191,"50":0.02937,"51":0.01101,"52":0.01468,"53":0.00734,"54":0.00734,"55":0.00734,"56":0.04405,"57":0.00367,"58":0.02203,"60":0.01101,"61":0.02937,"62":0.01101,"63":0.04772,"64":0.01468,"65":0.01101,"66":0.00734,"67":0.01836,"68":0.01468,"69":0.03304,"70":0.02203,"71":0.01468,"72":0.01836,"73":0.01101,"74":0.01468,"75":0.01101,"76":0.01468,"77":0.01468,"78":0.02203,"79":0.08443,"80":0.02937,"81":0.09912,"83":0.04405,"84":0.11747,"85":0.04405,"86":0.12114,"87":0.26431,"88":0.05139,"89":0.06975,"90":0.04405,"91":0.0881,"92":0.09912,"93":0.57268,"94":0.07342,"95":0.18722,"96":0.54331,"97":5.83322,"98":15.70454,"99":0.00734,"100":0.02203,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 19 20 21 23 24 27 28 29 35 36 41 44 45 59 101"},F:{"25":0.00734,"28":0.01468,"77":0.00367,"79":0.00734,"80":0.00734,"81":0.00367,"82":0.20191,"83":1.33257,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00734,"13":0.00734,"14":0.00367,"15":0.00734,"16":0.00734,"17":0.00734,"18":0.01836,"84":0.00734,"85":0.00734,"89":0.00734,"90":0.00367,"92":0.01101,"93":0.00367,"94":0.00734,"95":0.02203,"96":0.02937,"97":0.28634,"98":1.03522,_:"79 80 81 83 86 87 88 91"},E:{"4":0,"11":0.01836,"13":0.03671,"14":0.01836,"15":0.01101,_:"0 5 6 7 8 9 10 12 3.1 3.2 6.1 7.1 9.1 11.1 15.4","5.1":0.01101,"10.1":0.00367,"12.1":0.00367,"13.1":0.02203,"14.1":0.04038,"15.1":0.04772,"15.2-15.3":0.0881},G:{"8":0.00044,"3.2":0.00067,"4.0-4.1":0.00044,"4.2-4.3":0.002,"5.0-5.1":0.00933,"6.0-6.1":0.00244,"7.0-7.1":0.06443,"8.1-8.4":0.004,"9.0-9.2":0.00222,"9.3":0.07887,"10.0-10.2":0.00156,"10.3":0.04732,"11.0-11.2":0.00889,"11.3-11.4":0.00955,"12.0-12.1":0.00689,"12.2-12.5":0.1744,"13.0-13.1":0.00533,"13.2":0.00289,"13.3":0.02488,"13.4-13.7":0.09531,"14.0-14.4":0.15685,"14.5-14.8":0.33814,"15.0-15.1":0.35303,"15.2-15.3":0.82336,"15.4":0.00822},P:{"4":0.25823,"5.0-5.4":0.35318,"6.2-6.4":0.02066,"7.2-7.4":0.15494,"8.2":0.01248,"9.2":0.0723,"10.1":0.02066,"11.1-11.2":0.14461,"12.0":0.05165,"13.0":0.18592,"14.0":0.15494,"15.0":0.15494,"16.0":1.16719},I:{"0":0,"3":0,"4":0.00112,"2.1":0,"2.2":0,"2.3":0.00084,"4.1":0.00224,"4.2-4.3":0.00813,"4.4":0,"4.4.3-4.4.4":0.06362},A:{"8":0.01496,"9":0.01496,"11":0.16831,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.10759},Q:{"10.4":0.01899},O:{"0":0.37974},H:{"0":0.5153},L:{"0":60.21848},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EC.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EC.js
new file mode 100644
index 0000000..78789ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EC.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.02281,"56":0.00456,"58":0.00456,"60":0.00456,"61":0.00456,"66":0.00912,"70":0.00912,"72":0.01369,"73":0.01369,"78":0.05474,"80":0.00456,"81":0.00912,"82":0.00456,"83":0.00456,"84":0.01369,"87":0.00456,"88":0.04106,"89":0.01825,"90":0.01369,"91":0.04106,"92":0.01825,"93":0.00912,"94":0.01825,"95":0.04562,"96":1.0447,"97":1.76093,"98":0.00456,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 59 62 63 64 65 67 68 69 71 74 75 76 77 79 85 86 99 3.5 3.6"},D:{"22":0.00912,"26":0.00456,"38":0.04562,"42":0.01825,"47":0.03193,"49":0.02737,"53":0.01825,"55":0.01825,"56":0.00456,"63":0.00912,"65":0.01369,"66":0.00912,"67":0.00912,"68":0.00456,"70":0.00912,"71":0.00912,"72":0.00456,"74":0.01369,"75":0.01369,"76":0.01825,"77":0.00912,"78":0.01369,"79":0.14598,"80":0.01825,"81":0.01369,"83":0.01825,"84":0.02281,"85":0.02281,"86":0.04106,"87":0.05931,"88":0.01825,"89":0.02737,"90":0.02737,"91":0.52007,"92":0.05018,"93":0.22354,"94":0.04106,"95":0.05474,"96":0.45164,"97":9.34754,"98":23.09284,"99":0.00912,"100":0.01369,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 33 34 35 36 37 39 40 41 43 44 45 46 48 50 51 52 54 57 58 59 60 61 62 64 69 73 101"},F:{"29":0.00912,"80":0.00456,"82":0.44708,"83":1.44159,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00456,"18":0.01825,"89":0.00456,"92":0.01369,"93":0.00456,"95":0.00456,"96":0.01825,"97":0.59306,"98":2.12589,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88 90 91 94"},E:{"4":0,"13":0.01369,"14":0.05931,"15":0.09124,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.0365,"11.1":0.00912,"12.1":0.01825,"13.1":0.10036,"14.1":0.23722,"15.1":0.12774,"15.2-15.3":0.26003},G:{"8":0.00041,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01641,"6.0-6.1":0.00615,"7.0-7.1":0.0041,"8.1-8.4":0,"9.0-9.2":0.00082,"9.3":0.02092,"10.0-10.2":0,"10.3":0.02215,"11.0-11.2":0.0041,"11.3-11.4":0.03077,"12.0-12.1":0.00369,"12.2-12.5":0.21291,"13.0-13.1":0.00574,"13.2":0.00287,"13.3":0.01231,"13.4-13.7":0.04923,"14.0-14.4":0.1522,"14.5-14.8":0.72775,"15.0-15.1":0.58417,"15.2-15.3":2.22878,"15.4":0.01477},P:{"4":0.22618,"5.0-5.4":0.01013,"6.2-6.4":0.04052,"7.2-7.4":0.10281,"8.2":0.02051,"9.2":0.01079,"10.1":0.06153,"11.1-11.2":0.06168,"12.0":0.03084,"13.0":0.09253,"14.0":0.08225,"15.0":0.10281,"16.0":1.36735},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00564,"4.2-4.3":0.00423,"4.4":0,"4.4.3-4.4.4":0.06626},A:{"11":0.06843,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.11964},Q:{"10.4":0},O:{"0":0.02719},H:{"0":0.08752},L:{"0":32.09561},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EE.js
new file mode 100644
index 0000000..bafa995
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EE.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.04458,"55":0.00637,"68":0.08915,"72":0.0191,"78":0.02547,"81":0.03821,"87":0.26746,"88":0.01274,"89":0.00637,"90":0.00637,"91":0.10826,"92":0.00637,"93":0.02547,"94":0.03821,"95":0.07005,"96":1.66842,"97":2.49626,"98":0.0191,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 79 80 82 83 84 85 86 99 3.5 3.6"},D:{"34":0.00637,"49":0.04458,"60":0.02547,"64":0.00637,"69":0.9552,"74":0.01274,"75":0.01274,"76":0.01274,"78":0.00637,"79":0.04458,"80":0.0191,"81":0.00637,"83":0.04458,"84":0.04458,"85":0.0191,"86":0.05731,"87":0.03821,"88":0.06368,"89":0.03821,"90":0.03184,"91":2.89107,"92":0.07642,"93":0.44576,"94":0.08278,"95":0.24835,"96":0.63043,"97":11.85722,"98":25.31917,"99":0.01274,"100":0.00637,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 61 62 63 65 66 67 68 70 71 72 73 77 101"},F:{"36":0.03184,"46":0.00637,"72":0.01274,"77":0.01274,"78":0.00637,"79":0.01274,"80":0.01274,"81":0.01274,"82":0.73869,"83":4.58496,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 73 74 75 76 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.00637,"85":0.01274,"88":0.01274,"89":0.01274,"90":0.00637,"92":0.01274,"93":0.00637,"94":0.00637,"95":0.01274,"96":0.03821,"97":0.98067,"98":3.30499,_:"12 13 14 15 16 17 79 80 81 83 84 86 87 91"},E:{"4":0,"13":0.05731,"14":0.35661,"15":0.24198,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.0191,"12.1":0.06368,"13.1":0.32477,"14.1":0.85968,"15.1":0.50307,"15.2-15.3":0.98704,"15.4":0.0191},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00118,"6.0-6.1":0,"7.0-7.1":0.00118,"8.1-8.4":0.00236,"9.0-9.2":0,"9.3":0.0165,"10.0-10.2":0.0106,"10.3":0.15082,"11.0-11.2":0.00707,"11.3-11.4":0.00589,"12.0-12.1":0.00825,"12.2-12.5":0.22034,"13.0-13.1":0.00943,"13.2":0.00353,"13.3":0.02239,"13.4-13.7":0.11547,"14.0-14.4":0.5267,"14.5-14.8":1.88526,"15.0-15.1":1.92886,"15.2-15.3":6.77752,"15.4":0.08484},P:{"4":0.03326,"5.0-5.4":0.0307,"6.2-6.4":0.05116,"7.2-7.4":0.29673,"8.2":0.0104,"9.2":0.06139,"10.1":0.01109,"11.1-11.2":0.03326,"12.0":0.02217,"13.0":0.06652,"14.0":0.11086,"15.0":0.08869,"16.0":2.42793},I:{"0":0,"3":0,"4":0.00119,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00079,"4.2-4.3":0.00278,"4.4":0,"4.4.3-4.4.4":0.02066},A:{"8":0.01987,"11":0.31127,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.3197},Q:{"10.4":0},O:{"0":0.03633},H:{"0":0.25796},L:{"0":20.91212},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EG.js
new file mode 100644
index 0000000..7d90922
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/EG.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.03787,"84":0.01082,"91":0.01623,"95":0.01082,"96":14.65028,"97":31.03176,"98":0.01082,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 85 86 87 88 89 90 92 93 94 99 3.5 3.6"},D:{"33":0.00541,"40":0.01082,"43":0.1082,"49":0.02164,"79":0.06492,"80":0.01082,"81":0.00541,"83":0.00541,"84":0.00541,"85":0.00541,"86":0.02705,"87":0.01623,"88":0.01082,"89":0.02164,"90":0.01082,"91":0.01623,"92":0.03246,"93":0.01623,"94":0.01623,"95":0.02164,"96":0.12443,"97":1.68251,"98":4.4903,"100":0.00541,_:"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 34 35 36 37 38 39 41 42 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 99 101"},F:{"64":0.01082,"72":0.01082,"73":0.01082,"79":0.01623,"80":0.01082,"81":0.01623,"82":0.03246,"83":0.01623,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 65 66 67 68 69 70 71 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.00541,"96":0.01082,"97":0.1082,"98":0.43821,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95"},E:{"4":0,"14":0.01623,"15":0.01082,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 6.1 7.1 9.1 10.1 11.1 12.1 15.4","5.1":0.00541,"13.1":0.01623,"14.1":0.03787,"15.1":0.02164,"15.2-15.3":0.02705},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00098,"6.0-6.1":0.00293,"7.0-7.1":0.01027,"8.1-8.4":0.00147,"9.0-9.2":0.00293,"9.3":0.05133,"10.0-10.2":0.01467,"10.3":0.1315,"11.0-11.2":0.01662,"11.3-11.4":0.04106,"12.0-12.1":0.02786,"12.2-12.5":1.35456,"13.0-13.1":0.01467,"13.2":0.00831,"13.3":0.06648,"13.4-13.7":0.20189,"14.0-14.4":0.76649,"14.5-14.8":0.45462,"15.0-15.1":0.42871,"15.2-15.3":1.28564,"15.4":0.00538},P:{"4":0.18696,"5.0-5.4":0.01013,"6.2-6.4":0.04052,"7.2-7.4":0.09348,"8.2":0.02051,"9.2":0.02077,"10.1":0.06153,"11.1-11.2":0.10387,"12.0":0.02077,"13.0":0.11425,"14.0":0.11425,"15.0":0.10387,"16.0":1.05942},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00292,"4.2-4.3":0.00876,"4.4":0,"4.4.3-4.4.4":0.22241},A:{"11":0.03787,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.07344},Q:{"10.4":0},O:{"0":0.15606},H:{"0":0.21728},L:{"0":37.45262},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ER.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ER.js
new file mode 100644
index 0000000..b83d2f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ER.js
@@ -0,0 +1 @@
+module.exports={C:{"31":0.00252,"34":0.00504,"37":0.00755,"39":0.00252,"42":0.00504,"43":0.00755,"44":0.00504,"45":0.00504,"46":0.00504,"47":0.01007,"48":0.00504,"50":0.0277,"52":0.02518,"53":0.01007,"55":0.00252,"57":0.02014,"59":0.06043,"60":0.01007,"61":0.00755,"69":0.00504,"70":0.00504,"72":0.03273,"78":0.01007,"82":0.02014,"84":0.09568,"85":0.00252,"88":0.01511,"89":0.02266,"91":0.05288,"94":0.00755,"95":0.01511,"96":1.36476,"97":1.03238,"98":0.0705,_:"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 32 33 35 36 38 40 41 49 51 54 56 58 62 63 64 65 66 67 68 71 73 74 75 76 77 79 80 81 83 86 87 90 92 93 99 3.5 3.6"},D:{"11":0.01007,"30":0.08058,"33":0.01007,"34":0.00504,"35":0.05036,"36":0.00252,"38":0.00252,"39":0.00755,"40":0.11835,"43":0.08058,"49":0.00755,"50":0.02014,"52":0.06295,"54":0.00252,"55":0.00755,"56":0.03273,"58":0.00755,"59":0.00252,"60":0.00504,"63":0.00755,"64":0.00504,"65":0.0277,"67":0.00504,"68":0.00252,"69":0.01259,"71":0.00504,"72":0.00252,"74":0.0277,"75":0.00504,"76":0.00252,"77":0.00252,"79":0.02266,"80":0.01763,"81":0.00504,"83":0.01511,"85":0.01259,"86":0.01259,"87":0.02014,"88":0.00504,"89":0.00504,"90":0.01763,"91":0.04281,"92":0.04281,"93":0.01259,"94":0.02518,"95":0.01511,"96":0.25684,"97":3.78959,"98":7.20652,"99":0.04281,"100":0.01259,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 37 41 42 44 45 46 47 48 51 53 57 61 62 66 70 73 78 84 101"},F:{"28":0.00252,"34":0.00252,"38":0.00252,"69":0.00504,"70":0.00252,"79":0.00504,"80":0.02266,"82":0.09568,"83":0.7,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 11.1 11.5 11.6 12.1","10.0-10.1":0,"10.6":0.00755},B:{"12":0.05791,"13":0.0277,"14":0.01511,"15":0.00755,"16":0.01511,"17":0.01259,"18":0.02266,"84":0.00504,"85":0.00504,"89":0.00755,"90":0.01511,"92":0.02518,"93":0.00252,"94":0.00504,"95":0.01511,"96":0.03273,"97":0.31979,"98":0.79065,_:"79 80 81 83 86 87 88 91"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 15.4","14.1":0.01259,"15.1":0.03273,"15.2-15.3":0.03777},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00131,"6.0-6.1":0,"7.0-7.1":0.08736,"8.1-8.4":0,"9.0-9.2":0.00879,"9.3":0.00636,"10.0-10.2":0.00037,"10.3":0.02114,"11.0-11.2":0.00299,"11.3-11.4":0.01328,"12.0-12.1":0.07539,"12.2-12.5":0.44167,"13.0-13.1":0.00711,"13.2":0.00037,"13.3":0.1375,"13.4-13.7":0.00673,"14.0-14.4":0.13469,"14.5-14.8":0.72527,"15.0-15.1":0.06098,"15.2-15.3":0.13824,"15.4":0.00094},P:{"4":0.32743,"5.0-5.4":0.0307,"6.2-6.4":0.05116,"7.2-7.4":0.29673,"8.2":0.0104,"9.2":0.06139,"10.1":0.01023,"11.1-11.2":0.12279,"12.0":0.03121,"13.0":0.05116,"14.0":0.08186,"15.0":0.10232,"16.0":0.75718},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00104,"4.2-4.3":0.02501,"4.4":0,"4.4.3-4.4.4":0.04128},A:{"11":0.0982,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.07482},Q:{"10.4":0},O:{"0":2.28201},H:{"0":9.48477},L:{"0":63.88741},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ES.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ES.js
new file mode 100644
index 0000000..8f61154
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ES.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00455,"52":0.0773,"55":0.00909,"59":0.00455,"60":0.01364,"64":0.00455,"66":0.00455,"67":0.01819,"68":0.01819,"69":0.00455,"72":0.00909,"78":0.09094,"79":0.00455,"82":0.00455,"83":0.00455,"84":0.00909,"85":0.00909,"86":0.00909,"87":0.00455,"88":0.04092,"89":0.00909,"90":0.00909,"91":0.10913,"92":0.00909,"93":0.09094,"94":0.18643,"95":0.07275,"96":1.06855,"97":1.63237,"98":0.00909,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 56 57 58 61 62 63 65 70 71 73 74 75 76 77 80 81 99 3.5 3.6"},D:{"38":0.01364,"49":0.12277,"53":0.00455,"60":0.00455,"61":0.00455,"63":0.00909,"64":0.00455,"65":0.01364,"66":0.02274,"67":0.01819,"68":0.01364,"69":0.02274,"70":0.00909,"71":0.00909,"72":0.00909,"73":0.00909,"74":0.01364,"75":0.0773,"76":0.01364,"77":0.01364,"78":0.01819,"79":0.13641,"80":0.03183,"81":0.02728,"83":0.03183,"84":0.05002,"85":0.04092,"86":0.05456,"87":0.10458,"88":0.03183,"89":0.06821,"90":0.05911,"91":0.09549,"92":0.06366,"93":0.26373,"94":0.17279,"95":0.10003,"96":0.48653,"97":9.43048,"98":19.54301,"99":0.00909,"100":0.00909,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 59 62 101"},F:{"36":0.00455,"46":0.00455,"82":0.41378,"83":1.0549,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.00455,"17":0.00909,"18":0.01364,"86":0.00455,"87":0.00455,"90":0.00455,"91":0.00909,"92":0.01819,"93":0.00455,"94":0.00909,"95":0.02274,"96":0.03638,"97":0.74571,"98":2.76912,_:"12 13 14 15 79 80 81 83 84 85 88 89"},E:{"4":0,"12":0.00455,"13":0.04547,"14":0.28646,"15":0.20007,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.00909,"10.1":0.00909,"11.1":0.03638,"12.1":0.07275,"13.1":0.27282,"14.1":0.91395,"15.1":0.52291,"15.2-15.3":1.03217,"15.4":0.00455},G:{"8":0.00102,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00205,"6.0-6.1":0.00102,"7.0-7.1":0.00512,"8.1-8.4":0.00512,"9.0-9.2":0.00205,"9.3":0.07471,"10.0-10.2":0.00307,"10.3":0.08393,"11.0-11.2":0.01433,"11.3-11.4":0.02866,"12.0-12.1":0.0174,"12.2-12.5":0.39916,"13.0-13.1":0.02456,"13.2":0.00614,"13.3":0.05424,"13.4-13.7":0.15045,"14.0-14.4":0.47182,"14.5-14.8":1.85147,"15.0-15.1":1.53317,"15.2-15.3":5.4797,"15.4":0.02252},P:{"4":0.13775,"5.0-5.4":0.05095,"6.2-6.4":0.01009,"7.2-7.4":0.55497,"8.2":0.01009,"9.2":0.05045,"10.1":0.05045,"11.1-11.2":0.07417,"12.0":0.03179,"13.0":0.10596,"14.0":0.10596,"15.0":0.09537,"16.0":2.04509},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00273,"4.2-4.3":0.00818,"4.4":0,"4.4.3-4.4.4":0.05454},A:{"9":0.00924,"11":0.27722,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.22907},Q:{"10.4":0},O:{"0":0.03818},H:{"0":0.20138},L:{"0":41.19799},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ET.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ET.js
new file mode 100644
index 0000000..7c9b798
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ET.js
@@ -0,0 +1 @@
+module.exports={C:{"28":0.00724,"29":0.01448,"30":0.00724,"34":0.01086,"35":0.01086,"36":0.00362,"37":0.00362,"38":0.00724,"39":0.02895,"41":0.00362,"43":0.00724,"44":0.00724,"47":0.01448,"48":0.00724,"52":0.24609,"56":0.00362,"60":0.03257,"61":0.00724,"64":0.01086,"65":0.00362,"67":0.03257,"68":0.02171,"72":0.03619,"77":0.05067,"78":0.02533,"79":0.01086,"81":0.01086,"84":0.19905,"85":0.00724,"86":0.01448,"87":0.00724,"88":0.04343,"89":0.02895,"90":0.01448,"91":0.09048,"92":0.0181,"93":0.00724,"94":0.01448,"95":0.0579,"96":1.76245,"97":2.79025,"98":0.39085,_:"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 31 32 33 40 42 45 46 49 50 51 53 54 55 57 58 59 62 63 66 69 70 71 73 74 75 76 80 82 83 99 3.5 3.6"},D:{"11":0.01086,"30":0.00362,"33":0.01448,"37":0.00362,"38":0.01448,"40":0.09771,"42":0.00724,"43":0.12305,"44":0.02171,"45":0.00724,"46":0.02895,"49":0.01086,"50":0.00724,"53":0.00362,"55":0.00362,"56":0.02533,"57":0.01448,"58":0.00724,"60":0.00724,"63":0.02171,"64":0.02171,"65":0.01448,"66":0.00724,"67":0.00362,"68":0.01086,"69":0.00724,"70":0.0181,"71":0.01086,"72":0.00362,"73":0.00362,"74":0.01086,"75":0.00724,"76":0.00724,"77":0.01086,"78":0.0181,"79":0.36552,"80":0.03257,"81":0.04705,"83":0.01448,"84":0.0181,"85":0.02171,"86":0.09409,"87":0.06514,"88":0.04343,"89":0.03257,"90":0.06514,"91":0.05429,"92":0.19543,"93":0.04705,"94":0.06152,"95":0.08686,"96":0.33657,"97":5.13898,"98":13.32154,"99":0.04343,"100":0.20266,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 34 35 36 39 41 47 48 51 52 54 59 61 62 101"},F:{"28":0.00724,"77":0.00724,"79":0.01086,"80":0.00724,"81":0.00362,"82":0.17733,"83":1.76969,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05429,"13":0.03257,"14":0.01448,"15":0.01448,"16":0.02171,"17":0.02171,"18":0.09771,"84":0.03257,"85":0.02895,"89":0.01448,"90":0.00362,"91":0.00362,"92":0.04705,"93":0.00362,"94":0.00724,"95":0.01086,"96":0.11219,"97":0.6478,"98":2.16054,_:"79 80 81 83 86 87 88"},E:{"4":0,"7":0.00724,"8":0.00724,"13":0.01086,"14":0.01448,"15":0.00724,_:"0 5 6 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00362,"12.1":0.01086,"13.1":0.01086,"14.1":0.03981,"15.1":0.02171,"15.2-15.3":0.0181},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00085,"5.0-5.1":0.00057,"6.0-6.1":0.00085,"7.0-7.1":0.15777,"8.1-8.4":0.03025,"9.0-9.2":0.01216,"9.3":0.04043,"10.0-10.2":0.00226,"10.3":0.17954,"11.0-11.2":0.02403,"11.3-11.4":0.07719,"12.0-12.1":0.04213,"12.2-12.5":0.60364,"13.0-13.1":0.01329,"13.2":0.15777,"13.3":0.06248,"13.4-13.7":0.09019,"14.0-14.4":0.23128,"14.5-14.8":0.46566,"15.0-15.1":0.2375,"15.2-15.3":0.39017,"15.4":0.00679},P:{"4":0.47103,"5.0-5.4":0.02093,"6.2-6.4":0.02093,"7.2-7.4":0.20935,"8.2":0.0104,"9.2":0.12561,"10.1":0.01109,"11.1-11.2":0.13608,"12.0":0.01047,"13.0":0.11514,"14.0":0.08374,"15.0":0.10467,"16.0":0.82692},I:{"0":0,"3":0,"4":0.00032,"2.1":0,"2.2":0,"2.3":0.00032,"4.1":0.00546,"4.2-4.3":0.04638,"4.4":0,"4.4.3-4.4.4":0.15809},A:{"11":0.076,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.12762},Q:{"10.4":0},O:{"0":1.04648},H:{"0":4.79665},L:{"0":50.27251},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FI.js
new file mode 100644
index 0000000..07b1a3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FI.js
@@ -0,0 +1 @@
+module.exports={C:{"3":0.01277,"52":0.03192,"54":0.00638,"55":0.02553,"59":0.01277,"60":0.00638,"63":0.01277,"74":0.00638,"78":0.45319,"79":0.02553,"80":0.01915,"81":0.02553,"82":0.01915,"83":0.01915,"84":0.05106,"85":0.00638,"88":0.01915,"89":0.01277,"91":0.22341,"92":0.01915,"93":0.00638,"94":0.02553,"95":0.11489,"96":1.65958,"97":2.65533,"98":0.01277,_:"2 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 40 41 42 43 44 45 46 47 48 49 50 51 53 56 57 58 61 62 64 65 66 67 68 69 70 71 72 73 75 76 77 86 87 90 99 3.5 3.6"},D:{"38":0.00638,"42":0.01277,"48":0.15958,"49":0.01915,"52":0.07021,"56":0.01277,"58":0.00638,"59":0.01277,"60":0.06383,"61":0.07021,"64":0.81064,"66":0.07021,"67":0.01277,"69":0.21064,"70":0.46596,"72":0.45319,"73":0.01915,"75":0.01915,"76":0.02553,"77":0.01277,"78":0.01277,"79":1.14256,"80":0.51702,"81":0.0383,"83":0.08936,"84":0.15958,"85":0.14681,"86":0.19149,"87":0.37021,"88":0.02553,"89":0.0383,"90":0.09575,"91":0.04468,"92":0.10213,"93":1.22554,"94":2.71278,"95":0.06383,"96":1.86384,"97":10.23833,"98":23.48944,"99":0.00638,"100":0.01915,_:"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 39 40 41 43 44 45 46 47 50 51 53 54 55 57 62 63 65 68 71 74 101"},F:{"28":0.00638,"68":0.00638,"69":0.00638,"71":0.00638,"80":0.00638,"82":0.30638,"83":0.98298,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 70 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.04468,"81":0.01277,"84":0.01277,"85":0.00638,"86":0.00638,"89":0.00638,"90":0.00638,"92":0.01277,"93":0.00638,"94":0.01277,"95":0.03192,"96":0.0766,"97":1.09149,"98":4.34682,_:"12 13 14 15 16 17 79 80 83 87 88 91"},E:{"4":0.01915,"13":0.10213,"14":0.27447,"15":0.17872,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.01277,"10.1":0.01277,"11.1":0.02553,"12.1":0.04468,"13.1":0.27447,"14.1":0.83617,"15.1":0.45319,"15.2-15.3":1.06596,"15.4":0.01277},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00124,"6.0-6.1":0.00248,"7.0-7.1":0.00496,"8.1-8.4":0.00744,"9.0-9.2":0.08189,"9.3":0.04839,"10.0-10.2":0.01117,"10.3":0.06452,"11.0-11.2":0.02978,"11.3-11.4":0.07072,"12.0-12.1":0.03846,"12.2-12.5":0.335,"13.0-13.1":0.02233,"13.2":0.01737,"13.3":0.05211,"13.4-13.7":0.28786,"14.0-14.4":0.75562,"14.5-14.8":2.39218,"15.0-15.1":1.96536,"15.2-15.3":6.19633,"15.4":0.02109},P:{"4":0.04375,"5.0-5.4":0.02093,"6.2-6.4":0.04074,"7.2-7.4":2.52569,"8.2":0.0104,"9.2":0.01094,"10.1":0.04074,"11.1-11.2":0.04375,"12.0":0.03281,"13.0":0.0875,"14.0":0.14218,"15.0":0.14218,"16.0":1.79369},I:{"0":0,"3":0,"4":0.00214,"2.1":0,"2.2":0.00071,"2.3":0.00071,"4.1":0.00214,"4.2-4.3":0.00641,"4.4":0,"4.4.3-4.4.4":0.03491},A:{"6":0.01675,"7":0.01675,"8":0.38521,"9":0.09211,"10":0.15911,"11":0.24285,_:"5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.4883},Q:{"10.4":0},O:{"0":0.10489},H:{"0":0.32189},L:{"0":20.65605},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FJ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FJ.js
new file mode 100644
index 0000000..6241502
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FJ.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.01532,"35":0.00613,"44":0.00613,"47":0.01838,"48":0.00306,"52":0.0245,"54":0.16234,"65":0.07351,"66":0.00306,"72":0.00613,"78":0.00919,"88":0.01838,"89":0.00613,"90":0.00306,"91":0.00613,"94":0.02757,"95":0.06126,"96":0.69224,"97":1.01385,"98":0.02757,_:"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 36 37 38 39 40 41 42 43 45 46 49 50 51 53 55 56 57 58 59 60 61 62 63 64 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 92 93 99 3.5 3.6"},D:{"39":0.16847,"45":0.0245,"49":0.05513,"50":0.00919,"53":0.01225,"56":0.00306,"58":0.00613,"63":0.00613,"65":0.03063,"69":0.04595,"71":0.00306,"74":0.00919,"75":0.0245,"76":0.00613,"77":0.04901,"79":0.06126,"80":0.01225,"81":0.01225,"83":0.01225,"84":0.00613,"85":0.01225,"86":0.00613,"87":0.07658,"88":0.01225,"89":0.04288,"90":0.01225,"91":0.00919,"92":0.12252,"93":0.02144,"94":0.10108,"95":0.04288,"96":0.47477,"97":6.23627,"98":12.17236,"99":0.0582,"100":0.00613,_:"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 40 41 42 43 44 46 47 48 51 52 54 55 57 59 60 61 62 64 66 67 68 70 72 73 78 101"},F:{"40":0.00613,"82":0.12865,"83":0.70755,_:"9 11 12 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 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.00613,"14":0.00613,"15":0.01838,"16":0.00919,"17":0.02144,"18":0.03369,"80":0.00306,"81":0.00306,"84":0.03369,"85":0.00919,"87":0.76269,"89":0.03369,"91":0.00919,"92":0.02757,"93":0.00919,"94":0.02144,"95":0.02144,"96":0.07658,"97":0.85151,"98":2.16248,_:"12 79 83 86 88 90"},E:{"4":0,"13":0.02144,"14":0.06126,"15":0.03369,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00306,"11.1":0.00919,"12.1":0.01225,"13.1":0.1991,"14.1":0.22054,"15.1":0.24198,"15.2-15.3":0.15928},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01588,"6.0-6.1":0.00318,"7.0-7.1":0.23765,"8.1-8.4":0.00159,"9.0-9.2":0,"9.3":0.18366,"10.0-10.2":0.00847,"10.3":0.26253,"11.0-11.2":0.00423,"11.3-11.4":0.00529,"12.0-12.1":0.03017,"12.2-12.5":0.51183,"13.0-13.1":0.02064,"13.2":0.00106,"13.3":0.09316,"13.4-13.7":0.0614,"14.0-14.4":0.37897,"14.5-14.8":0.93844,"15.0-15.1":0.86963,"15.2-15.3":1.64134,"15.4":0.02382},P:{"4":0.56013,"5.0-5.4":0.02093,"6.2-6.4":0.04074,"7.2-7.4":2.52569,"8.2":0.0104,"9.2":0.10184,"10.1":0.04074,"11.1-11.2":1.55819,"12.0":0.11203,"13.0":0.73326,"14.0":1.18137,"15.0":0.774,"16.0":5.14303},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.08883,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.10406},Q:{"10.4":0},O:{"0":1.5192},H:{"0":0.36778},L:{"0":50.82157},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FK.js
new file mode 100644
index 0000000..36e7421
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FK.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01672,"61":0.29253,"63":0.01672,"69":0.01672,"78":0.94445,"84":0.01672,"87":0.02507,"89":0.00836,"92":0.02507,"94":0.04179,"95":0.06686,"96":2.35278,"97":3.88229,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 62 64 65 66 67 68 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 88 90 91 93 98 99 3.5 3.6"},D:{"33":0.00836,"49":0.45969,"77":0.01672,"81":0.00836,"86":0.00836,"87":0.00836,"91":0.00836,"93":0.00836,"95":0.00836,"96":0.1003,"97":7.81473,"98":14.68501,_:"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 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 83 84 85 88 89 90 92 94 99 100 101"},F:{"73":0.01672,"81":0.00836,"82":0.00836,"83":0.88595,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00836,"16":0.00836,"18":0.22567,"83":0.00836,"84":0.01672,"91":0.00836,"92":0.16716,"93":0.00836,"95":0.04179,"96":0.29253,"97":0.75222,"98":2.41964,_:"12 13 15 17 79 80 81 85 86 87 88 89 90 94"},E:{"4":0,"13":0.05851,"14":0.07522,"15":0.1003,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00836,"11.1":0.09194,"12.1":0.05015,"13.1":0.16716,"14.1":0.50148,"15.1":0.08358,"15.2-15.3":0.84416},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00598,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02291,"10.0-10.2":0.14043,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.03486,"12.0-12.1":0,"12.2-12.5":1.73001,"13.0-13.1":0,"13.2":0,"13.3":0.01793,"13.4-13.7":0.00598,"14.0-14.4":0.26891,"14.5-14.8":1.42623,"15.0-15.1":2.05668,"15.2-15.3":4.24982,"15.4":0},P:{"4":0.47103,"5.0-5.4":0.02093,"6.2-6.4":0.02093,"7.2-7.4":0.20935,"8.2":0.0104,"9.2":0.12561,"10.1":0.01109,"11.1-11.2":0.04208,"12.0":0.04208,"13.0":0.2209,"14.0":0.09467,"15.0":0.03165,"16.0":4.94395},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.78565,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.50643},Q:{"10.4":0},O:{"0":12.5559},H:{"0":0},L:{"0":32.58584},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FM.js
new file mode 100644
index 0000000..9ed2ac0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FM.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.0106,"78":0.02121,"88":0.0106,"89":0.02651,"96":2.07308,"97":1.89281,"98":0.08483,_:"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 40 41 42 43 44 45 46 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 90 91 92 93 94 95 99 3.5 3.6"},D:{"33":0.30221,"49":0.02651,"65":0.0106,"78":0.0106,"79":0.18557,"80":0.36054,"81":0.01591,"83":0.0106,"87":0.02121,"90":0.01591,"91":0.29161,"92":0.04242,"93":0.49309,"94":0.07953,"95":0.02651,"96":0.95966,"97":8.35595,"98":18.27069,"99":0.02121,_:"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 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 66 67 68 69 70 71 72 73 74 75 76 77 84 85 86 88 89 100 101"},F:{"83":0.22799,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.02121,"14":0.02121,"16":0.0106,"18":0.01591,"84":0.0106,"86":0.15906,"96":0.04772,"97":1.60651,"98":11.38339,_:"12 15 17 79 80 81 83 85 87 88 89 90 91 92 93 94 95"},E:{"4":0,"14":0.5302,"15":0.05832,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.0106,"12.1":0.86953,"13.1":0.90134,"14.1":0.16436,"15.1":0.08483,"15.2-15.3":0.42416},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01836,"10.0-10.2":0,"10.3":0.01836,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.03672,"12.2-12.5":2.16039,"13.0-13.1":0.00773,"13.2":0,"13.3":0.00386,"13.4-13.7":0.98068,"14.0-14.4":0.64251,"14.5-14.8":2.41836,"15.0-15.1":2.05701,"15.2-15.3":1.2058,"15.4":0.11401},P:{"4":0.02192,"5.0-5.4":0.01024,"6.2-6.4":0.02048,"7.2-7.4":0.10962,"8.2":0.01015,"9.2":0.12286,"10.1":0.02048,"11.1-11.2":0.53714,"12.0":0.01078,"13.0":0.19732,"14.0":0.05481,"15.0":0.04314,"16.0":1.01947},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.07953,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.06577},Q:{"10.4":0},O:{"0":0.0094},H:{"0":0.0934},L:{"0":31.24196},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FO.js
new file mode 100644
index 0000000..7aba38e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FO.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00441,"60":0.00441,"78":0.0397,"91":0.11469,"93":0.00441,"95":0.05293,"96":0.49403,"97":0.66165,_:"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 40 41 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 92 94 98 99 3.5 3.6"},D:{"49":0.01764,"67":0.00882,"68":0.03529,"71":0.03529,"74":0.00441,"79":0.00882,"80":0.00882,"83":0.02206,"86":0.01764,"87":0.02206,"88":0.05293,"90":0.01764,"91":0.04852,"92":0.11028,"93":0.04852,"94":0.06617,"95":0.01764,"96":0.50727,"97":6.67384,"98":8.92786,"99":0.00882,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 69 70 72 73 75 76 77 78 81 84 85 89 100 101"},F:{"82":0.09704,"83":0.37494,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01323,"18":0.00882,"84":0.00882,"89":0.02647,"94":0.00882,"95":0.00882,"96":0.03088,"97":0.79398,"98":2.31136,_:"12 13 14 16 17 79 80 81 83 85 86 87 88 90 91 92 93"},E:{"4":0,"12":0.00441,"13":0.00882,"14":1.16009,"15":0.21173,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00441,"11.1":0.0397,"12.1":0.02206,"13.1":0.23378,"14.1":0.83368,"15.1":4.21692,"15.2-15.3":9.144,"15.4":0.0397},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02501,"10.0-10.2":0.015,"10.3":0.11003,"11.0-11.2":0.02001,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.24507,"13.0-13.1":0,"13.2":0,"13.3":0.01,"13.4-13.7":0.05001,"14.0-14.4":1.06029,"14.5-14.8":3.38092,"15.0-15.1":9.02246,"15.2-15.3":35.95478,"15.4":0.10003},P:{"4":0.47103,"5.0-5.4":0.02093,"6.2-6.4":0.02093,"7.2-7.4":0.20935,"8.2":0.0104,"9.2":0.12561,"10.1":0.01109,"11.1-11.2":0.03165,"12.0":0.01047,"13.0":0.11514,"14.0":0.01055,"15.0":0.03165,"16.0":0.77009},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.22937,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.16208},Q:{"10.4":0},O:{"0":0},H:{"0":0.1217},L:{"0":4.8021},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FR.js
new file mode 100644
index 0000000..3afeea4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/FR.js
@@ -0,0 +1 @@
+module.exports={C:{"11":0.00487,"45":0.00974,"47":0.00974,"48":0.01949,"50":0.00487,"52":0.09744,"56":0.01462,"59":0.01462,"60":0.01462,"66":0.00487,"68":0.02923,"72":0.00974,"75":0.00487,"77":0.00487,"78":0.21924,"79":0.00974,"80":0.01462,"81":0.44822,"82":0.01462,"83":0.00974,"84":0.02436,"85":0.00974,"86":0.00974,"87":0.01462,"88":0.02436,"89":0.0341,"90":0.03898,"91":0.33617,"92":0.01462,"93":0.01462,"94":0.04872,"95":0.12667,"96":2.31907,"97":3.52733,"98":0.00974,_:"2 3 4 5 6 7 8 9 10 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 40 41 42 43 44 46 49 51 53 54 55 57 58 61 62 63 64 65 67 69 70 71 73 74 76 99 3.5 3.6"},D:{"38":0.00974,"48":0.00487,"49":0.11206,"50":0.00487,"51":0.00487,"52":0.02436,"53":0.00974,"54":0.06334,"56":0.01462,"58":0.00974,"60":0.07308,"63":0.00974,"64":0.07308,"65":0.01462,"66":0.06334,"67":0.01949,"69":0.02436,"70":0.03898,"71":0.01949,"72":0.03898,"73":0.00487,"74":0.01462,"75":0.01949,"76":0.01949,"77":0.01462,"78":0.02436,"79":0.18514,"80":0.07795,"81":0.0341,"83":0.06821,"84":0.1218,"85":0.14129,"86":0.1559,"87":0.30694,"88":0.05359,"89":0.06334,"90":0.03898,"91":0.05846,"92":0.05359,"93":0.90132,"94":0.53592,"95":0.11206,"96":0.53592,"97":7.56622,"98":15.3468,"99":0.01462,"100":0.00974,_:"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 39 40 41 42 43 44 45 46 47 55 57 59 61 62 68 101"},F:{"71":0.00974,"82":0.33617,"83":0.93542,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.01949,"18":0.03898,"83":0.00487,"84":0.00974,"85":0.01462,"86":0.00974,"87":0.00487,"89":0.00974,"90":0.00974,"91":0.00974,"92":0.00974,"93":0.00487,"94":0.01462,"95":0.03898,"96":0.07308,"97":1.23749,"98":4.13146,_:"12 13 14 15 16 79 80 81 88"},E:{"4":0,"8":0.00487,"12":0.01462,"13":0.0877,"14":0.42386,"15":0.25822,_:"0 5 6 7 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.01949,"10.1":0.02436,"11.1":0.08282,"12.1":0.14616,"13.1":0.4872,"14.1":1.2521,"15.1":0.61874,"15.2-15.3":1.15954,"15.4":0.00974},G:{"8":0.00677,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00169,"7.0-7.1":0.01016,"8.1-8.4":0.00339,"9.0-9.2":0.01863,"9.3":0.10161,"10.0-10.2":0.02371,"10.3":0.10838,"11.0-11.2":0.04742,"11.3-11.4":0.04064,"12.0-12.1":0.03387,"12.2-12.5":0.63504,"13.0-13.1":0.06266,"13.2":0.01524,"13.3":0.11346,"13.4-13.7":0.3082,"14.0-14.4":0.84841,"14.5-14.8":3.3513,"15.0-15.1":2.7061,"15.2-15.3":8.4282,"15.4":0.06266},P:{"4":0.08493,"5.0-5.4":0.01062,_:"6.2-6.4 7.2-7.4","8.2":0.01062,"9.2":0.03185,"10.1":0.01062,"11.1-11.2":0.10616,"12.0":0.03185,"13.0":0.10616,"14.0":0.10616,"15.0":0.12739,"16.0":2.54788},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00299,"4.2-4.3":0.00598,"4.4":0,"4.4.3-4.4.4":0.06282},A:{"8":0.01519,"9":0.02026,"10":0.01013,"11":0.33931,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.51793},Q:{"10.4":0},O:{"0":0.43075},H:{"0":0.35926},L:{"0":30.1504},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GA.js
new file mode 100644
index 0000000..bd5e8ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GA.js
@@ -0,0 +1 @@
+module.exports={C:{"30":0.00287,"31":0.00287,"35":0.00575,"39":0.00287,"48":0.00287,"52":0.01724,"54":0.02298,"68":0.01149,"72":0.00862,"78":0.02586,"85":0.00287,"88":0.05459,"89":0.00575,"91":0.06608,"92":0.00287,"93":0.01724,"94":0.04597,"95":0.03448,"96":0.77284,"97":1.54567,_:"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 32 33 34 36 37 38 40 41 42 43 44 45 46 47 49 50 51 53 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 79 80 81 82 83 84 86 87 90 98 99 3.5 3.6"},D:{"29":0.03735,"38":0.00862,"48":0.00575,"49":0.00862,"53":0.00287,"56":0.00575,"58":0.01437,"63":0.00287,"65":0.01149,"66":0.00287,"69":0.02011,"70":0.00575,"71":0.00575,"73":0.02586,"74":0.00862,"75":0.01437,"76":0.02873,"77":0.01149,"79":0.75847,"80":0.01149,"81":0.0316,"83":0.01437,"84":0.00862,"85":0.01724,"86":0.01724,"87":0.22984,"88":0.01437,"89":0.01149,"90":0.00575,"91":0.00862,"92":0.09768,"93":0.02011,"94":0.03735,"95":0.12354,"96":0.34189,"97":4.02795,"98":10.83696,"99":0.0316,"100":0.05171,_:"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 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 47 50 51 52 54 55 57 59 60 61 62 64 67 68 72 78 101"},F:{"28":0.27006,"46":0.00862,"68":0.01437,"74":0.02586,"79":0.00287,"80":0.01724,"82":0.05459,"83":1.50545,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 71 72 73 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00862,"13":0.00862,"14":0.01149,"15":0.00575,"16":0.01149,"17":0.01149,"18":0.06608,"80":0.00287,"84":0.00862,"85":0.00287,"89":0.00862,"90":0.01149,"91":0.00287,"92":0.01149,"94":0.00575,"95":0.01149,"96":0.0316,"97":0.64355,"98":2.18635,_:"79 81 83 86 87 88 93"},E:{"4":0,"14":0.01724,"15":0.01437,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.01149,"12.1":0.01437,"13.1":0.09481,"14.1":0.04884,"15.1":0.0316,"15.2-15.3":0.15802},G:{"8":0.00219,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01531,"6.0-6.1":0.00146,"7.0-7.1":0.02042,"8.1-8.4":0.00219,"9.0-9.2":0,"9.3":0.02771,"10.0-10.2":0.00146,"10.3":0.02916,"11.0-11.2":0.24936,"11.3-11.4":0.01094,"12.0-12.1":0.10062,"12.2-12.5":2.13046,"13.0-13.1":0.01239,"13.2":0.00073,"13.3":0.00875,"13.4-13.7":0.10208,"14.0-14.4":0.34706,"14.5-14.8":0.84431,"15.0-15.1":0.63651,"15.2-15.3":2.71374,"15.4":0.02698},P:{"4":0.4495,"5.0-5.4":0.02093,"6.2-6.4":0.02043,"7.2-7.4":1.39958,"8.2":0.02094,"9.2":0.01022,"10.1":0.02043,"11.1-11.2":0.24518,"12.0":0.05108,"13.0":0.54144,"14.0":0.18389,"15.0":0.15324,"16.0":1.14419},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00052,"4.2-4.3":0.00207,"4.4":0,"4.4.3-4.4.4":0.06868},A:{"11":0.11722,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.91226},Q:{"10.4":0},O:{"0":0.3706},H:{"0":2.09844},L:{"0":51.6867},S:{"2.5":0.01425}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GB.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GB.js
new file mode 100644
index 0000000..d849070
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GB.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00503,"52":0.0302,"59":0.0151,"78":0.05537,"84":0.02014,"87":0.02517,"88":0.00503,"89":0.02014,"90":0.07551,"91":0.04027,"92":0.00503,"93":0.01007,"94":0.0151,"95":0.03524,"96":0.82054,"97":1.2736,"98":0.00503,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 99 3.5 3.6"},D:{"35":0.00503,"38":0.00503,"40":0.18626,"43":0.01007,"49":0.06041,"56":0.0302,"60":0.0151,"63":0.00503,"64":0.0151,"65":0.0151,"66":0.05537,"67":0.0151,"69":0.04531,"70":0.0151,"72":0.0151,"73":0.00503,"74":0.01007,"75":0.02014,"76":0.04027,"77":0.02517,"78":0.0151,"79":0.07048,"80":0.05537,"81":0.02014,"83":0.03524,"84":0.08054,"85":0.03524,"86":0.03524,"87":0.16109,"88":0.02517,"89":0.06041,"90":0.04027,"91":0.08558,"92":0.08558,"93":0.58898,"94":0.14095,"95":0.12082,"96":0.72993,"97":9.44882,"98":17.87573,"99":0.0151,"100":0.0151,_:"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 36 37 39 41 42 44 45 46 47 48 50 51 52 53 54 55 57 58 59 61 62 68 71 101"},F:{"46":0.00503,"82":0.18626,"83":0.58394,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00503,"16":0.00503,"17":0.01007,"18":0.06041,"85":0.01007,"89":0.00503,"90":0.00503,"91":0.01007,"92":0.02014,"93":0.0151,"94":0.01007,"95":0.07551,"96":0.08054,"97":1.84244,"98":6.0408,_:"12 13 14 79 80 81 83 84 86 87 88"},E:{"4":0,"12":0.01007,"13":0.07551,"14":0.4732,"15":0.25673,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.00503,"10.1":0.01007,"11.1":0.06041,"12.1":0.09565,"13.1":0.41782,"14.1":1.777,"15.1":0.85578,"15.2-15.3":1.95319,"15.4":0.0151},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00499,"7.0-7.1":0.01248,"8.1-8.4":0.01248,"9.0-9.2":0.0025,"9.3":0.24959,"10.0-10.2":0.00749,"10.3":0.2421,"11.0-11.2":0.02995,"11.3-11.4":0.05741,"12.0-12.1":0.02995,"12.2-12.5":1.11318,"13.0-13.1":0.02746,"13.2":0.00749,"13.3":0.06989,"13.4-13.7":0.25209,"14.0-14.4":0.89853,"14.5-14.8":5.04175,"15.0-15.1":3.30709,"15.2-15.3":13.53785,"15.4":0.04493},P:{"4":0.04325,_:"5.0-5.4 6.2-6.4 7.2-7.4 8.2 9.2 10.1","11.1-11.2":0.04325,"12.0":0.02162,"13.0":0.09731,"14.0":0.09731,"15.0":0.09731,"16.0":3.38406},I:{"0":0,"3":0,"4":0.01457,"2.1":0,"2.2":0.00089,"2.3":0,"4.1":0.00119,"4.2-4.3":0.00387,"4.4":0,"4.4.3-4.4.4":0.02914},A:{"9":0.01023,"11":0.30691,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.2781},Q:{"10.4":0},O:{"0":0.11422},H:{"0":0.17866},L:{"0":20.43488},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GD.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GD.js
new file mode 100644
index 0000000..e72dbf3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GD.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.00909,"52":0.00454,"60":0.01817,"72":0.00454,"78":0.01363,"86":0.19989,"89":0.00454,"91":0.02726,"95":0.00454,"96":0.99037,"97":1.17209,_:"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 40 41 42 43 44 45 46 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 87 88 90 92 93 94 98 99 3.5 3.6"},D:{"38":0.01817,"49":0.00454,"63":0.01363,"65":0.00454,"71":0.02272,"73":0.05452,"76":0.10903,"77":0.04997,"79":0.01363,"80":0.00454,"81":0.02726,"83":0.26804,"84":0.00454,"85":0.00909,"86":0.02726,"87":0.10449,"88":0.01363,"89":0.02272,"90":0.00909,"91":0.04543,"92":0.09086,"93":0.07269,"94":0.02726,"95":0.02726,"96":0.26349,"97":8.08654,"98":16.7455,"99":0.01817,"100":0.00454,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 66 67 68 69 70 72 74 75 78 101"},F:{"67":0.24532,"82":0.16355,"83":0.62693,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.09086,"18":0.01363,"92":0.03634,"96":0.04997,"97":2.21698,"98":7.60044,_:"12 13 14 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95"},E:{"4":0,"13":0.00909,"14":0.14538,"15":0.19535,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1 11.1 15.4","5.1":0.01363,"9.1":0.01817,"12.1":0.04089,"13.1":0.18626,"14.1":0.59513,"15.1":0.77231,"15.2-15.3":0.82683},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00619,"6.0-6.1":0,"7.0-7.1":0.09704,"8.1-8.4":0,"9.0-9.2":0.03097,"9.3":0.0702,"10.0-10.2":0,"10.3":0.26324,"11.0-11.2":0.01032,"11.3-11.4":0.02581,"12.0-12.1":0.00619,"12.2-12.5":0.49242,"13.0-13.1":0.00206,"13.2":0,"13.3":0.01961,"13.4-13.7":0.05471,"14.0-14.4":0.23434,"14.5-14.8":1.51856,"15.0-15.1":2.12454,"15.2-15.3":5.34645,"15.4":0.01652},P:{"4":0.07596,"5.0-5.4":0.04073,"6.2-6.4":0.01071,"7.2-7.4":0.21703,"8.2":0.01071,"9.2":0.0632,"10.1":0.02096,"11.1-11.2":0.13022,"12.0":0.02107,"13.0":0.04341,"14.0":0.04341,"15.0":0.11937,"16.0":3.16868},I:{"0":0,"3":0,"4":0.00084,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00127,"4.4":0,"4.4.3-4.4.4":0.09066},A:{"11":0.06815,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.10368},Q:{"10.4":0},O:{"0":0.07094},H:{"0":0.19115},L:{"0":37.10759},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GE.js
new file mode 100644
index 0000000..64078ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GE.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00428,"48":0.00428,"52":0.00855,"68":0.02139,"78":0.03849,"83":0.00428,"84":0.00855,"88":0.01283,"89":0.00855,"90":0.00428,"91":0.01283,"94":0.00428,"95":0.01711,"96":0.41487,"97":0.71426,"98":0.00855,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 85 86 87 92 93 99 3.5 3.6"},D:{"38":0.00855,"47":0.02566,"49":0.05988,"50":0.01283,"53":0.00855,"56":0.01283,"59":0.01711,"62":0.02566,"63":0.00855,"64":0.00855,"66":0.02139,"67":0.00855,"68":0.02566,"69":0.01711,"70":0.00855,"71":0.01711,"72":0.00855,"73":0.01283,"74":0.01711,"75":0.02139,"76":0.06843,"77":0.00855,"78":0.04705,"79":0.19247,"80":0.01711,"81":0.02566,"83":0.04705,"84":0.02994,"85":0.02994,"86":0.07699,"87":0.08554,"88":0.07271,"89":0.03422,"90":0.11976,"91":0.05132,"92":0.07699,"93":0.10265,"94":0.08126,"95":0.10693,"96":0.44053,"97":8.09208,"98":20.24304,"99":0.03422,"100":0.1112,_:"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 39 40 41 42 43 44 45 46 48 51 52 54 55 57 58 60 61 65 101"},F:{"28":0.04705,"36":0.00428,"40":0.00428,"46":0.01711,"49":0.00428,"67":0.00855,"72":0.01283,"73":0.00855,"77":0.03849,"79":0.00855,"80":0.00855,"81":0.01711,"82":0.41487,"83":2.7715,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 74 75 76 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00855,"13":0.08554,"14":0.23096,"15":0.00428,"16":0.10265,"17":0.02139,"18":0.15825,"84":0.02994,"88":0.00855,"89":0.00855,"91":0.00428,"92":0.01283,"93":0.00428,"94":0.00855,"95":0.02139,"96":0.09837,"97":0.77414,"98":3.06233,_:"79 80 81 83 85 86 87 90"},E:{"4":0,"13":0.02566,"14":0.06843,"15":0.02994,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.00855,"12.1":0.02139,"13.1":0.07271,"14.1":0.19674,"15.1":0.13259,"15.2-15.3":0.23524,"15.4":0.04277},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.03446,"6.0-6.1":0.0053,"7.0-7.1":0.22133,"8.1-8.4":0.00133,"9.0-9.2":0.00265,"9.3":0.09277,"10.0-10.2":0.00398,"10.3":0.12856,"11.0-11.2":0.05964,"11.3-11.4":0.02916,"12.0-12.1":0.03048,"12.2-12.5":0.95823,"13.0-13.1":0.02518,"13.2":0.01325,"13.3":0.09145,"13.4-13.7":0.277,"14.0-14.4":0.88003,"14.5-14.8":2.61624,"15.0-15.1":2.22128,"15.2-15.3":5.50815,"15.4":0.05169},P:{"4":0.58696,"5.0-5.4":0.04073,"6.2-6.4":0.01018,"7.2-7.4":0.1153,"8.2":0.02094,"9.2":0.07127,"10.1":0.02096,"11.1-11.2":0.08385,"12.0":0.01048,"13.0":0.1153,"14.0":0.15722,"15.0":0.06289,"16.0":1.09007},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00465,"4.2-4.3":0.02944,"4.4":0,"4.4.3-4.4.4":0.11468},A:{"11":0.11548,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.06866},Q:{"10.4":0},O:{"0":0.08583},H:{"0":0.20585},L:{"0":41.13343},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GF.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GF.js
new file mode 100644
index 0000000..2e90429
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GF.js
@@ -0,0 +1 @@
+module.exports={C:{"35":0.00844,"52":0.0211,"60":0.03376,"68":0.00422,"71":0.00844,"73":0.00422,"76":0.07174,"77":0.00422,"78":0.1055,"81":0.01688,"83":0.00422,"85":0.01266,"86":0.00844,"88":0.02954,"89":0.01266,"91":0.1055,"92":0.01266,"94":0.01266,"95":0.05064,"96":2.28302,"97":3.87818,_:"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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 69 70 72 74 75 79 80 82 84 87 90 93 98 99 3.5 3.6"},D:{"38":0.00844,"39":0.02954,"47":0.00422,"49":0.1055,"51":0.00422,"63":0.01688,"66":0.00422,"67":0.01266,"76":0.02532,"78":0.00422,"79":0.02532,"87":0.0211,"88":0.01266,"89":0.04642,"90":0.01688,"91":0.02954,"92":0.0422,"93":0.02954,"94":0.04642,"95":0.0211,"96":0.2743,"97":5.4016,"98":12.5334,"100":0.01266,_:"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 40 41 42 43 44 45 46 48 50 52 53 54 55 56 57 58 59 60 61 62 64 65 68 69 70 71 72 73 74 75 77 80 81 83 84 85 86 99 101"},F:{"46":0.01266,"79":0.01266,"82":0.20678,"83":0.59502,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.06752,"15":0.00422,"16":0.01266,"17":0.00422,"18":0.03376,"88":0.00422,"89":0.00422,"90":0.00422,"92":0.00844,"94":0.00844,"95":0.00844,"96":0.08018,"97":2.15642,"98":7.10648,_:"13 14 79 80 81 83 84 85 86 87 91 93"},E:{"4":0,"11":0.00844,"13":0.34182,"14":0.32494,"15":0.211,_:"0 5 6 7 8 9 10 12 3.1 3.2 5.1 6.1 7.1 15.4","9.1":0.00422,"10.1":0.05064,"11.1":0.03376,"12.1":0.03798,"13.1":0.29962,"14.1":1.25756,"15.1":0.47686,"15.2-15.3":0.76804},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00736,"9.3":0.03236,"10.0-10.2":0,"10.3":0.04119,"11.0-11.2":0.15593,"11.3-11.4":0.00441,"12.0-12.1":0.0103,"12.2-12.5":0.33686,"13.0-13.1":0.05296,"13.2":0,"13.3":0.01765,"13.4-13.7":0.22654,"14.0-14.4":0.59871,"14.5-14.8":2.68903,"15.0-15.1":2.26243,"15.2-15.3":8.23036,"15.4":0.03825},P:{"4":0.08228,"5.0-5.4":0.02093,"6.2-6.4":0.04074,"7.2-7.4":0.10285,"8.2":0.0104,"9.2":0.01094,"10.1":0.04074,"11.1-11.2":0.10285,"12.0":0.02057,"13.0":0.40113,"14.0":0.16457,"15.0":0.08228,"16.0":3.05477},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00189,"4.2-4.3":0.00236,"4.4":0,"4.4.3-4.4.4":0.01887},A:{"11":0.1055,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.48552},Q:{"10.4":0},O:{"0":0.02312},H:{"0":0.17511},L:{"0":37.47044},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GG.js
new file mode 100644
index 0000000..ac00dae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GG.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.37455,"70":0.01998,"78":0.01498,"87":0.05993,"94":0.00999,"95":0.01998,"96":0.58929,"97":0.98881,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 88 89 90 91 92 93 98 99 3.5 3.6"},D:{"38":0.00999,"49":0.00999,"65":0.01498,"66":0.00499,"67":0.00499,"76":0.37954,"77":0.06992,"78":0.00499,"79":0.00499,"81":0.01998,"83":0.01498,"84":0.01498,"86":0.00999,"87":0.07491,"88":0.00499,"90":0.04994,"91":0.05493,"92":0.03496,"93":0.31962,"94":0.00999,"95":0.02497,"96":0.54435,"97":7.72572,"98":14.50258,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 68 69 70 71 72 73 74 75 80 85 89 99 100 101"},F:{"82":0.05493,"83":0.43448,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.03496,"18":0.00999,"87":0.00499,"90":0.00999,"91":0.01998,"95":0.00999,"96":0.02996,"97":1.7479,"98":6.35736,_:"12 13 14 15 16 79 80 81 83 84 85 86 88 89 92 93 94"},E:{"4":0,"11":0.00499,"13":0.06492,"14":0.70415,"15":0.38454,_:"0 5 6 7 8 9 10 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.15981,"12.1":0.07491,"13.1":0.87395,"14.1":2.46704,"15.1":1.67798,"15.2-15.3":4.3298},G:{"8":0.03144,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":2.77303,"10.0-10.2":0,"10.3":0.55335,"11.0-11.2":0.07231,"11.3-11.4":0.01572,"12.0-12.1":0.01886,"12.2-12.5":1.41481,"13.0-13.1":0.00314,"13.2":0,"13.3":0.03458,"13.4-13.7":0.33955,"14.0-14.4":1.12871,"14.5-14.8":5.33541,"15.0-15.1":4.41421,"15.2-15.3":15.27368,"15.4":0.01258},P:{"4":0.13335,"5.0-5.4":0.04073,"6.2-6.4":0.01071,"7.2-7.4":0.18464,"8.2":0.01071,"9.2":0.03077,"10.1":0.02096,"11.1-11.2":0.0561,"12.0":0.02052,"13.0":0.03366,"14.0":0.21317,"15.0":0.15707,"16.0":4.22969},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.93388,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.17518},Q:{"10.4":0},O:{"0":0},H:{"0":0},L:{"0":14.1478},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GH.js
new file mode 100644
index 0000000..807daf2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GH.js
@@ -0,0 +1 @@
+module.exports={C:{"30":0.00231,"31":0.00231,"35":0.00461,"40":0.00231,"41":0.00231,"42":0.00231,"43":0.00461,"44":0.00231,"45":0.00231,"47":0.00692,"48":0.00692,"49":0.00692,"50":0.00461,"52":0.01614,"56":0.00692,"64":0.00231,"66":0.00461,"68":0.00461,"69":0.00231,"72":0.01153,"73":0.00231,"74":0.00231,"78":0.01153,"81":0.00461,"83":0.00231,"84":0.00692,"85":0.00692,"86":0.00461,"87":0.00692,"88":0.01153,"89":0.01153,"90":0.00231,"91":0.01614,"92":0.00922,"93":0.01153,"94":0.01384,"95":0.04843,"96":0.77943,"97":1.01695,"98":0.0761,_:"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 32 33 34 36 37 38 39 46 51 53 54 55 57 58 59 60 61 62 63 65 67 70 71 75 76 77 79 80 82 99 3.5 3.6"},D:{"11":0.00231,"33":0.00231,"38":0.00461,"39":0.00231,"43":0.00461,"47":0.00461,"49":0.02075,"50":0.00692,"55":0.00461,"56":0.00461,"57":0.00461,"58":0.00692,"60":0.00461,"63":0.00922,"64":0.00231,"65":0.00922,"66":0.00231,"67":0.01153,"68":0.02075,"69":0.01153,"70":0.00922,"71":0.00461,"72":0.00922,"73":0.00231,"74":0.00922,"75":0.01614,"76":0.01384,"77":0.04843,"78":0.01384,"79":0.03459,"80":0.02998,"81":0.02998,"83":0.02537,"84":0.01153,"85":0.01614,"86":0.03228,"87":0.06457,"88":0.06457,"89":0.03228,"90":0.02075,"91":0.05073,"92":0.05304,"93":0.04151,"94":0.05996,"95":0.07149,"96":0.33668,"97":3.67576,"98":7.97876,"99":0.01153,"100":0.02075,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 40 41 42 44 45 46 48 51 52 53 54 59 61 62 101"},F:{"36":0.00231,"42":0.00692,"67":0.00692,"73":0.00461,"79":0.00922,"80":0.00461,"82":0.11069,"83":0.90856,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.02998,"13":0.00922,"14":0.00922,"15":0.01153,"16":0.02075,"17":0.01845,"18":0.0761,"84":0.0369,"85":0.01384,"89":0.06687,"90":0.02075,"91":0.00461,"92":0.05073,"93":0.01153,"94":0.01384,"95":0.02306,"96":0.08532,"97":0.55113,"98":1.51735,_:"79 80 81 83 86 87 88"},E:{"4":0,"11":0.00231,"12":0.00231,"13":0.01153,"14":0.05996,"15":0.05073,_:"0 5 6 7 8 9 10 3.1 3.2 6.1 7.1 15.4","5.1":0.00692,"9.1":0.00461,"10.1":0.00692,"11.1":0.01614,"12.1":0.02537,"13.1":0.09224,"14.1":0.15911,"15.1":0.11069,"15.2-15.3":0.18448},G:{"8":0.00571,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00143,"7.0-7.1":0.02282,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04422,"10.0-10.2":0.00285,"10.3":0.13552,"11.0-11.2":0.50785,"11.3-11.4":0.03566,"12.0-12.1":0.04993,"12.2-12.5":1.46079,"13.0-13.1":0.06847,"13.2":0.04422,"13.3":0.15977,"13.4-13.7":0.3652,"14.0-14.4":2.22114,"14.5-14.8":2.85739,"15.0-15.1":2.77037,"15.2-15.3":3.47794,"15.4":0.02568},P:{"4":0.1264,"5.0-5.4":0.04073,"6.2-6.4":0.01018,"7.2-7.4":0.13693,"8.2":0.02094,"9.2":0.0632,"10.1":0.02096,"11.1-11.2":0.13693,"12.0":0.02107,"13.0":0.08427,"14.0":0.21067,"15.0":0.16854,"16.0":0.82161},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00196,"4.2-4.3":0.00476,"4.4":0,"4.4.3-4.4.4":0.03945},A:{"10":0.00461,"11":0.08763,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.02308},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.31545},Q:{"10.4":0},O:{"0":2.03122},H:{"0":13.00955},L:{"0":46.8191},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GI.js
new file mode 100644
index 0000000..8a22d3b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GI.js
@@ -0,0 +1 @@
+module.exports={C:{"78":0.07764,"89":0.04658,"90":0.06729,"91":0.01035,"95":0.01035,"96":0.47102,"97":0.71946,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 92 93 94 98 99 3.5 3.6"},D:{"49":0.01035,"60":0.05176,"74":0.00518,"78":0.01035,"79":0.03623,"80":0.02588,"81":0.07246,"83":0.01035,"84":0.15528,"86":0.02588,"87":0.02588,"89":0.07764,"90":0.04141,"91":0.01553,"92":0.02588,"93":0.69876,"94":0.06211,"95":0.17081,"96":0.27433,"97":9.79299,"98":21.29924,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 72 73 75 76 77 85 88 99 100 101"},F:{"36":0.02588,"82":0.11905,"83":0.40373,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.08799,"92":0.03106,"95":0.06729,"96":0.03623,"97":1.30953,"98":4.7878,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,"9":0.01035,"13":0.47619,"14":0.61077,"15":0.46066,_:"0 5 6 7 8 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.03623,"11.1":0.03106,"12.1":0.24845,"13.1":0.34162,"14.1":2.14286,"15.1":0.97309,"15.2-15.3":2.24638,"15.4":0.01035},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01613,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.19966,"9.3":0.12706,"10.0-10.2":0,"10.3":0.09882,"11.0-11.2":0.11697,"11.3-11.4":0.02017,"12.0-12.1":0.02622,"12.2-12.5":0.44167,"13.0-13.1":0.00403,"13.2":0.00403,"13.3":0.07059,"13.4-13.7":0.13311,"14.0-14.4":0.6857,"14.5-14.8":4.43081,"15.0-15.1":3.53941,"15.2-15.3":10.20075,"15.4":0.04437},P:{"4":0.12606,"5.0-5.4":0.04073,"6.2-6.4":0.01018,"7.2-7.4":0.13693,"8.2":0.02094,"9.2":0.0632,"10.1":0.02096,"11.1-11.2":0.04202,"12.0":0.02107,"13.0":0.04202,"14.0":0.06303,"15.0":0.02101,"16.0":4.20184},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.14493,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":3.89779},Q:{"10.4":0},O:{"0":0.06271},H:{"0":0.70789},L:{"0":19.50756},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GL.js
new file mode 100644
index 0000000..ffc2e15
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GL.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00454,"78":0.04996,"87":0.00908,"89":0.00908,"90":0.00454,"91":0.01363,"94":0.14989,"95":0.02725,"96":0.77668,"97":1.32626,_:"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 40 41 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 88 92 93 98 99 3.5 3.6"},D:{"38":0.01817,"49":0.03634,"52":0.00908,"53":0.01363,"58":0.01363,"65":0.04996,"67":0.00454,"68":0.02725,"73":0.02271,"79":0.01817,"80":0.08176,"81":0.01817,"84":0.01817,"86":0.01817,"88":0.09992,"89":0.24073,"90":0.06813,"91":0.01363,"92":0.01817,"93":0.06813,"94":0.07721,"95":0.1408,"96":0.29523,"97":5.3959,"98":14.41631,"99":0.01817,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 54 55 56 57 59 60 61 62 63 64 66 69 70 71 72 74 75 76 77 78 83 85 87 100 101"},F:{"31":0.00454,"36":0.02725,"80":0.01817,"82":0.40878,"83":0.45874,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00908,"15":0.00908,"16":0.00454,"18":0.04088,"84":0.01363,"85":0.02725,"88":0.00454,"91":0.00908,"92":0.00454,"95":0.01817,"96":0.02271,"97":1.11733,"98":3.22028,_:"12 13 17 79 80 81 83 86 87 89 90 93 94"},E:{"4":0,"12":0.08176,"13":0.46328,"14":0.52687,"15":0.21802,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.01817,"11.1":0.04088,"12.1":0.13172,"13.1":0.50416,"14.1":4.65101,"15.1":2.62528,"15.2-15.3":3.57001,"15.4":0.03179},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.10064,"9.3":0.12199,"10.0-10.2":0,"10.3":0.05795,"11.0-11.2":0,"11.3-11.4":0.00305,"12.0-12.1":0.0061,"12.2-12.5":0.20128,"13.0-13.1":0.05795,"13.2":0.00915,"13.3":0,"13.4-13.7":0.0488,"14.0-14.4":0.48491,"14.5-14.8":2.56789,"15.0-15.1":3.7024,"15.2-15.3":23.01954,"15.4":0.10674},P:{"4":0.23569,"5.0-5.4":0.04073,"6.2-6.4":0.01071,"7.2-7.4":0.01071,"8.2":0.01071,"9.2":0.0632,"10.1":0.02096,"11.1-11.2":0.07499,"12.0":0.02107,"13.0":0.03214,"14.0":0.04285,"15.0":0.20355,"16.0":2.26046},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00504,"4.4":0,"4.4.3-4.4.4":0.01134},A:{"11":0.38607,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.28382},Q:{"10.4":0},O:{"0":0.04912},H:{"0":3.73594},L:{"0":16.05057},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GM.js
new file mode 100644
index 0000000..fd8b9f6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GM.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00923,"43":0.00923,"47":0.00369,"49":0.00554,"52":0.00185,"56":0.01107,"65":0.00369,"69":0.00185,"72":0.01845,"78":0.00369,"85":0.00185,"88":0.00554,"91":0.00923,"93":0.00369,"94":0.00738,"95":0.00738,"96":0.64206,"97":0.98708,"98":0.1476,_:"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 35 36 37 38 39 40 41 42 44 45 46 48 50 51 53 54 55 57 58 59 60 61 62 63 64 66 67 68 70 71 73 74 75 76 77 79 80 81 82 83 84 86 87 89 90 92 99 3.5 3.6"},D:{"31":0.00369,"33":0.00554,"34":0.00554,"38":0.01292,"40":0.00369,"47":0.00369,"49":0.01292,"53":0.00369,"55":0.01476,"57":0.01107,"58":0.01661,"60":0.00554,"64":0.00738,"65":0.01107,"67":0.00185,"68":0.00369,"69":0.00185,"70":0.00369,"72":0.00369,"74":0.00369,"75":0.01107,"77":0.00738,"78":0.00369,"79":0.03137,"80":0.00923,"81":0.00923,"84":0.00923,"85":0.00369,"86":0.00185,"87":0.07011,"88":0.00738,"89":0.00738,"90":0.00923,"91":0.01476,"92":0.01107,"93":0.15129,"94":0.02583,"95":0.01661,"96":0.12546,"97":1.85054,"98":5.97596,"99":0.03137,"100":0.0572,_:"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 32 35 36 37 39 41 42 43 44 45 46 48 50 51 52 54 56 59 61 62 63 66 71 73 76 83 101"},F:{"21":0.00369,"79":0.00369,"82":0.05166,"83":1.01844,_:"9 11 12 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01845,"13":0.00369,"15":0.00738,"16":0.01476,"17":0.00185,"18":0.04797,"80":0.00185,"84":0.00369,"85":0.00554,"89":0.00923,"90":0.01292,"92":0.02214,"93":0.00369,"94":0.01845,"95":0.00923,"96":0.02768,"97":0.49815,"98":1.22508,_:"14 79 81 83 86 87 88 91"},E:{"4":0,"12":0.00185,"13":0.00738,"14":0.06089,"15":0.00554,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 15.4","9.1":0.00738,"10.1":0.00185,"11.1":0.00185,"12.1":0.01292,"13.1":0.04797,"14.1":0.12731,"15.1":0.07011,"15.2-15.3":0.12915},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01021,"6.0-6.1":0,"7.0-7.1":0.02918,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.17505,"10.0-10.2":0.00875,"10.3":0.20131,"11.0-11.2":0.02918,"11.3-11.4":0.09044,"12.0-12.1":0.11816,"12.2-12.5":3.98102,"13.0-13.1":0.06127,"13.2":0.01021,"13.3":0.33552,"13.4-13.7":0.43618,"14.0-14.4":2.33843,"14.5-14.8":2.90152,"15.0-15.1":1.46608,"15.2-15.3":2.37928,"15.4":0.01751},P:{"4":0.34619,"5.0-5.4":0.04073,"6.2-6.4":0.01018,"7.2-7.4":0.93674,"8.2":0.02094,"9.2":0.07127,"10.1":0.02043,"11.1-11.2":0.07127,"12.0":0.04073,"13.0":0.224,"14.0":0.72292,"15.0":0.08146,"16.0":0.97747},I:{"0":0,"3":0,"4":0.00042,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00017,"4.2-4.3":0.01475,"4.4":0,"4.4.3-4.4.4":0.02544},A:{"11":0.0572,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.95414},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.05709},Q:{"10.4":0},O:{"0":0.83997},H:{"0":2.42428},L:{"0":61.63072},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GN.js
new file mode 100644
index 0000000..d13224b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GN.js
@@ -0,0 +1 @@
+module.exports={C:{"5":0.00088,"33":0.00529,"35":0.00088,"37":0.00176,"38":0.00176,"44":0.00176,"45":0.00176,"47":0.00265,"65":0.00176,"72":0.00176,"78":0.00088,"80":0.00441,"82":0.00529,"88":0.00088,"91":0.00441,"92":0.2108,"93":0.00088,"95":0.02822,"96":0.20021,"97":0.3431,_:"2 3 4 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 34 36 39 40 41 42 43 46 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 66 67 68 69 70 71 73 74 75 76 77 79 81 83 84 85 86 87 89 90 94 98 99 3.5 3.6"},D:{"19":0.00176,"28":0.00529,"29":0.00176,"36":0.00353,"38":0.00441,"43":0.01411,"49":0.0097,"56":0.00176,"57":0.00088,"58":0.00176,"59":0.00088,"60":0.00088,"62":0.00441,"63":0.01499,"64":0.00176,"65":0.00529,"66":0.26901,"67":0.00265,"69":0.00353,"70":0.00176,"72":0.00441,"75":0.00529,"76":0.01147,"78":0.00088,"79":0.00353,"80":0.00265,"81":0.00529,"83":0.00353,"84":0.0097,"86":0.00706,"87":0.00794,"88":0.00088,"89":0.00529,"90":0.00529,"91":0.0247,"92":0.10937,"93":0.01852,"94":0.00441,"95":0.02558,"96":0.11995,"97":0.94903,"98":1.74195,"100":0.00882,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 23 24 25 26 27 30 31 32 33 34 35 37 39 40 41 42 44 45 46 47 48 50 51 52 53 54 55 61 68 71 73 74 77 85 99 101"},F:{"15":0.00353,"35":0.00176,"42":0.00176,"48":0.00176,"73":0.00088,"75":0.00265,"79":0.00353,"81":0.00265,"82":0.00617,"83":0.20198,_:"9 11 12 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 36 37 38 39 40 41 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 74 76 77 78 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01676,"13":0.00617,"14":0.00176,"15":0.00176,"16":0.00176,"17":0.00794,"18":0.03352,"84":0.01764,"85":0.00441,"89":0.00441,"90":0.00617,"91":0.00176,"92":0.05292,"93":0.01588,"94":0.06439,"95":0.00176,"96":0.01058,"97":0.17816,"98":0.32017,_:"79 80 81 83 86 87 88"},E:{"4":0,"11":0.00353,"12":0.00794,"13":0.0097,"14":0.02029,"15":0.00706,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1 15.4","9.1":0.00176,"10.1":0.01764,"11.1":0.00176,"12.1":0.00529,"13.1":0.0247,"14.1":0.0194,"15.1":0.01588,"15.2-15.3":0.07321},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.03288,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03145,"10.0-10.2":0.13294,"10.3":0.20013,"11.0-11.2":0.3245,"11.3-11.4":1.23938,"12.0-12.1":0.47031,"12.2-12.5":5.98105,"13.0-13.1":0.41885,"13.2":0.12866,"13.3":0.5232,"13.4-13.7":0.19727,"14.0-14.4":1.35946,"14.5-14.8":1.36089,"15.0-15.1":0.92918,"15.2-15.3":0.95777,"15.4":0},P:{"4":1.46776,"5.0-5.4":0.28149,"6.2-6.4":0.04021,"7.2-7.4":0.41218,"8.2":0.01071,"9.2":0.1709,"10.1":0.02096,"11.1-11.2":0.24128,"12.0":0.03016,"13.0":0.09048,"14.0":0.56298,"15.0":0.65346,"16.0":0.75399},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00114,"4.2-4.3":0.003,"4.4":0,"4.4.3-4.4.4":0.05057},A:{"11":0.0247,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.03647},Q:{"10.4":0.00912},O:{"0":0.23707},H:{"0":6.33613},L:{"0":68.25973},S:{"2.5":0.1003}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GP.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GP.js
new file mode 100644
index 0000000..fbe7b64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GP.js
@@ -0,0 +1 @@
+module.exports={C:{"38":0.01265,"50":0.01265,"52":0.00843,"56":0.01265,"60":0.01686,"64":0.00422,"78":0.06324,"84":0.00843,"85":0.00422,"89":0.00843,"91":0.05059,"92":0.01265,"93":0.00422,"94":0.00843,"95":0.04638,"96":1.36177,"97":1.72013,_:"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 39 40 41 42 43 44 45 46 47 48 49 51 53 54 55 57 58 59 61 62 63 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 86 87 88 90 98 99 3.5 3.6"},D:{"49":0.06324,"58":0.01265,"63":0.04216,"65":0.01265,"67":0.01686,"74":0.00422,"76":0.00843,"77":0.01686,"78":0.00422,"79":0.02951,"80":0.00843,"81":0.00422,"83":0.02951,"84":0.05481,"85":0.02108,"86":0.00843,"87":0.02951,"88":0.00422,"89":0.01686,"90":0.01265,"91":0.0253,"92":0.02951,"93":0.04216,"94":0.04638,"95":0.05059,"96":0.72515,"97":6.5348,"98":14.65903,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 59 60 61 62 64 66 68 69 70 71 72 73 75 99 100 101"},F:{"82":0.14756,"83":0.66613,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.00843,"17":0.00843,"18":0.02108,"86":0.00422,"90":0.00843,"91":0.00422,"92":0.01265,"93":0.00843,"94":0.01265,"95":0.00843,"96":0.06746,"97":1.48403,"98":5.09293,_:"12 13 14 15 79 80 81 83 84 85 87 88 89"},E:{"4":0,"12":0.00843,"13":0.06324,"14":0.56916,"15":0.28247,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.02108,"10.1":0.00843,"11.1":0.05059,"12.1":0.18972,"13.1":0.62397,"14.1":1.58522,"15.1":1.35755,"15.2-15.3":1.21842,"15.4":0.01686},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.0086,"9.0-9.2":0.00516,"9.3":0.03269,"10.0-10.2":0.00688,"10.3":0.08432,"11.0-11.2":0.01549,"11.3-11.4":0.01205,"12.0-12.1":0.03786,"12.2-12.5":0.61947,"13.0-13.1":0.01721,"13.2":0.0086,"13.3":0.07571,"13.4-13.7":0.2409,"14.0-14.4":0.86725,"14.5-14.8":3.47934,"15.0-15.1":3.10077,"15.2-15.3":8.52455,"15.4":0.07055},P:{"4":0.07195,"5.0-5.4":0.04073,"6.2-6.4":0.01071,"7.2-7.4":0.14391,"8.2":0.01071,"9.2":0.04112,"10.1":0.02096,"11.1-11.2":0.18502,"12.0":0.05139,"13.0":0.21586,"14.0":0.27753,"15.0":0.17474,"16.0":4.23495},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00168,"4.2-4.3":0.00168,"4.4":0,"4.4.3-4.4.4":0.03135},A:{"11":0.1054,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.26606},Q:{"10.4":0},O:{"0":0.01157},H:{"0":0.10952},L:{"0":33.08468},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GQ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GQ.js
new file mode 100644
index 0000000..6c4fde9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GQ.js
@@ -0,0 +1 @@
+module.exports={C:{"39":0.00497,"43":0.0149,"45":0.00993,"52":0.09435,"56":0.00497,"57":0.00497,"60":0.00993,"62":0.04966,"64":0.00993,"71":0.05959,"72":0.00497,"78":0.00497,"79":0.00993,"83":0.0149,"85":0.01986,"87":0.00993,"89":0.01986,"91":0.0149,"93":0.02483,"94":0.02483,"95":0.05959,"96":2.67667,"97":1.95164,_:"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 40 41 42 44 46 47 48 49 50 51 53 54 55 58 59 61 63 65 66 67 68 69 70 73 74 75 76 77 80 81 82 84 86 88 90 92 98 99 3.5 3.6"},D:{"18":0.08442,"39":0.00497,"43":0.03476,"46":0.00993,"47":0.00497,"49":0.00497,"50":0.00497,"54":0.04469,"55":0.05959,"57":0.00497,"58":0.85912,"60":0.09435,"63":0.28803,"64":0.11422,"66":0.02483,"69":0.01986,"70":0.00993,"71":0.00497,"74":0.06456,"75":0.09435,"76":0.00993,"78":0.00993,"79":0.12912,"80":0.01986,"81":0.01986,"83":0.07946,"84":0.00993,"86":0.02483,"87":0.0298,"88":0.03476,"89":0.02483,"91":0.0149,"92":0.14401,"93":0.0298,"94":0.02483,"95":0.02483,"96":0.47177,"97":7.33975,"98":13.1599,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 40 41 42 44 45 48 51 52 53 56 59 61 62 65 67 68 72 73 77 85 90 99 100 101"},F:{"15":0.00497,"46":0.00497,"49":0.00497,"51":0.00497,"64":0.20361,"70":0.00497,"76":0.0149,"77":0.03973,"78":0.00993,"80":0.00497,"81":0.00993,"82":0.4966,"83":0.10925,_:"9 11 12 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 50 52 53 54 55 56 57 58 60 62 63 65 66 67 68 69 71 72 73 74 75 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05959,"13":0.00497,"14":0.01986,"15":0.00993,"16":0.05463,"17":0.00497,"18":0.15891,"84":0.0149,"85":0.00497,"86":0.02483,"88":0.00993,"89":0.01986,"90":0.09435,"92":0.0149,"93":0.0149,"94":0.01986,"95":0.00497,"96":0.12912,"97":0.79953,"98":14.70929,_:"79 80 81 83 87 91"},E:{"4":0,"11":0.00497,"12":0.03973,"14":0.02483,"15":0.11918,_:"0 5 6 7 8 9 10 13 3.1 3.2 6.1 7.1","5.1":0.00993,"9.1":0.0149,"10.1":0.00993,"11.1":0.00993,"12.1":0.00497,"13.1":0.01986,"14.1":0.05959,"15.1":0.12415,"15.2-15.3":0.58599,"15.4":0.00993},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.09474,"8.1-8.4":0,"9.0-9.2":0.01373,"9.3":0.02883,"10.0-10.2":0,"10.3":0.10572,"11.0-11.2":3.38456,"11.3-11.4":0.00824,"12.0-12.1":0.02334,"12.2-12.5":1.47053,"13.0-13.1":0.02334,"13.2":0.02334,"13.3":0.01648,"13.4-13.7":0.15241,"14.0-14.4":1.82478,"14.5-14.8":1.18082,"15.0-15.1":1.94835,"15.2-15.3":3.41751,"15.4":0.01098},P:{"4":1.74544,"5.0-5.4":0.02066,"6.2-6.4":0.04052,"7.2-7.4":0.04131,"8.2":0.0104,"9.2":0.02066,"10.1":0.06153,"11.1-11.2":0.04131,"12.0":0.03121,"13.0":0.02066,"14.0":0.04131,"15.0":0.04131,"16.0":0.82624},I:{"0":0,"3":0,"4":0.00157,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00067,"4.2-4.3":0.03112,"4.4":0,"4.4.3-4.4.4":0.14283},A:{"11":0.35755,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.49333},N:{_:"10 11"},R:{_:"0"},M:{"0":0.06544},Q:{"10.4":0.10571},O:{"0":0.30204},H:{"0":0.27165},L:{"0":31.11591},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GR.js
new file mode 100644
index 0000000..25f59c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GR.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.69463,"60":0.01187,"68":0.14249,"77":0.01781,"78":0.04156,"81":0.03562,"83":0.01187,"84":0.01187,"85":0.00594,"86":0.01187,"87":0.03562,"88":0.0475,"89":0.01187,"90":0.00594,"91":0.08312,"92":0.01781,"93":0.00594,"94":0.08906,"95":0.03562,"96":2.60041,"97":4.28651,"98":0.01187,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 79 80 82 99 3.5 3.6"},D:{"22":0.42746,"34":0.04156,"38":0.22561,"39":0.07718,"41":0.01187,"47":0.27904,"49":0.48683,"53":0.01187,"56":0.00594,"62":0.41559,"65":0.00594,"67":0.00594,"69":0.25529,"71":0.01781,"72":0.02375,"74":0.01187,"76":0.00594,"77":0.08906,"78":0.01781,"79":0.18405,"80":0.02969,"81":0.01781,"83":0.02969,"84":0.01781,"85":0.02375,"86":0.02969,"87":0.11874,"88":0.10687,"89":0.08312,"90":0.01187,"91":0.33247,"92":0.02969,"93":0.06531,"94":0.03562,"95":0.0475,"96":0.31466,"97":10.74597,"98":24.85822,"99":0.00594,"100":0.00594,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 35 36 37 40 42 43 44 45 46 48 50 51 52 54 55 57 58 59 60 61 63 64 66 68 70 73 75 101"},F:{"12":0.08906,"25":0.0475,"31":0.84305,"40":0.58776,"46":0.00594,"67":0.01781,"82":0.2078,"83":1.12803,_:"9 11 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 32 33 34 35 36 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.13655,"18":0.00594,"92":0.04156,"95":0.01187,"96":0.01781,"97":0.84899,"98":2.49354,_:"12 13 14 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,"13":0.02969,"14":0.08312,"15":0.05343,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.04156,"12.1":0.04156,"13.1":0.10093,"14.1":0.32654,"15.1":0.14843,"15.2-15.3":0.29685},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00124,"6.0-6.1":0.00062,"7.0-7.1":0.24598,"8.1-8.4":0.00496,"9.0-9.2":0,"9.3":0.05205,"10.0-10.2":0.00248,"10.3":0.05638,"11.0-11.2":0.00867,"11.3-11.4":0.01425,"12.0-12.1":0.00929,"12.2-12.5":0.30113,"13.0-13.1":0.00496,"13.2":0.01053,"13.3":0.02107,"13.4-13.7":0.11215,"14.0-14.4":0.24226,"14.5-14.8":0.99012,"15.0-15.1":0.8154,"15.2-15.3":3.28761,"15.4":0.01239},P:{"4":0.59228,"5.0-5.4":0.04073,"6.2-6.4":0.01018,"7.2-7.4":0.13693,"8.2":0.02094,"9.2":0.0632,"10.1":0.02096,"11.1-11.2":0.06461,"12.0":0.02107,"13.0":0.09692,"14.0":0.05384,"15.0":0.08615,"16.0":1.443},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00468,"4.2-4.3":0.23867,"4.4":0,"4.4.3-4.4.4":0.29716},A:{"11":0.4809,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.19101},Q:{"10.4":0},O:{"0":0.08941},H:{"0":0.24239},L:{"0":30.41749},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GT.js
new file mode 100644
index 0000000..cfabd39
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GT.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01948,"72":0.00779,"73":0.13636,"78":0.01558,"88":0.0039,"89":0.0039,"90":0.01169,"91":0.02727,"92":0.0039,"94":0.00779,"95":0.01558,"96":0.5844,"97":1.05582,"98":0.00779,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 74 75 76 77 79 80 81 82 83 84 85 86 87 93 99 3.5 3.6"},D:{"38":0.01169,"49":0.03506,"50":0.01558,"53":0.00779,"59":0.01558,"65":0.00779,"69":0.01169,"70":0.0039,"72":0.00779,"74":0.0039,"75":0.00779,"76":0.04675,"78":0.02727,"79":0.10519,"80":0.01169,"81":0.01558,"83":0.01948,"84":0.00779,"85":0.0039,"86":0.06623,"87":0.06623,"88":0.01558,"89":0.02338,"90":0.01948,"91":0.07013,"92":0.06623,"93":0.05454,"94":0.03506,"95":0.04286,"96":0.2922,"97":7.35565,"98":19.3826,"99":0.01169,"100":0.01558,_:"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 39 40 41 42 43 44 45 46 47 48 51 52 54 55 56 57 58 60 61 62 63 64 66 67 68 71 73 77 101"},F:{"46":0.00779,"82":0.45973,"83":1.40646,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00779,"17":0.0039,"18":0.01558,"84":0.00779,"85":0.01558,"89":0.00779,"90":0.01169,"92":0.01558,"94":0.00779,"95":0.00779,"96":0.02338,"97":0.57661,"98":2.2441,_:"12 13 14 16 79 80 81 83 86 87 88 91 93"},E:{"4":0,"13":0.01169,"14":0.10909,"15":0.1013,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 7.1 9.1","6.1":0.0039,"10.1":0.0039,"11.1":0.01169,"12.1":0.01948,"13.1":0.14805,"14.1":0.33116,"15.1":0.20649,"15.2-15.3":0.50648,"15.4":0.00779},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00077,"6.0-6.1":0.0069,"7.0-7.1":0.00614,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01687,"10.0-10.2":0.00153,"10.3":0.01764,"11.0-11.2":0.0046,"11.3-11.4":0.0115,"12.0-12.1":0.01611,"12.2-12.5":0.25847,"13.0-13.1":0.01304,"13.2":0.0046,"13.3":0.02761,"13.4-13.7":0.07516,"14.0-14.4":0.27457,"14.5-14.8":1.11134,"15.0-15.1":1.11517,"15.2-15.3":4.65474,"15.4":0.04985},P:{"4":0.13335,"5.0-5.4":0.04073,"6.2-6.4":0.01071,"7.2-7.4":0.18464,"8.2":0.01071,"9.2":0.03077,"10.1":0.02096,"11.1-11.2":0.18464,"12.0":0.02052,"13.0":0.17438,"14.0":0.17438,"15.0":0.21541,"16.0":2.0926},I:{"0":0,"3":0,"4":0.00523,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00349,"4.4":0,"4.4.3-4.4.4":0.05232},A:{"11":0.08571,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.20143},Q:{"10.4":0},O:{"0":0.06714},H:{"0":0.23693},L:{"0":47.24267},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GU.js
new file mode 100644
index 0000000..9b62e83
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GU.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00415,"78":0.01246,"84":0.00415,"93":0.00415,"94":0.00831,"95":0.00831,"96":0.72695,"97":1.22128,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 88 89 90 91 92 98 99 3.5 3.6"},D:{"49":0.03323,"67":0.00415,"75":0.01662,"76":0.08723,"77":0.03739,"79":0.05816,"80":0.00831,"83":0.02077,"84":0.02492,"85":0.00831,"86":0.00831,"87":0.2077,"88":0.04154,"89":0.01246,"90":0.00831,"91":0.0997,"92":0.08308,"93":0.04154,"94":0.0997,"95":0.02908,"96":0.73941,"97":7.9466,"98":16.16737,"99":0.00831,"100":0.01246,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 68 69 70 71 72 73 74 78 81 101"},F:{"74":0.00415,"82":0.12462,"83":0.6231,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00831,"18":0.00415,"92":0.00831,"95":0.04569,"96":0.02077,"97":1.1922,"98":3.05319,_:"12 13 14 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,"10":0.00415,"12":0.00415,"13":0.11631,"14":0.46109,"15":0.32817,_:"0 5 6 7 8 9 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00831,"11.1":0.01246,"12.1":0.17862,"13.1":0.38217,"14.1":1.40821,"15.1":0.95127,"15.2-15.3":2.17254,"15.4":0.02077},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01249,"7.0-7.1":0,"8.1-8.4":0.01874,"9.0-9.2":0,"9.3":0.39345,"10.0-10.2":0.0281,"10.3":0.05933,"11.0-11.2":0.01874,"11.3-11.4":0.04372,"12.0-12.1":0.0281,"12.2-12.5":0.74631,"13.0-13.1":0.03435,"13.2":0.00625,"13.3":0.04684,"13.4-13.7":0.32476,"14.0-14.4":1.1991,"14.5-14.8":4.57468,"15.0-15.1":5.26167,"15.2-15.3":18.38304,"15.4":0.03747},P:{"4":0.2393,"5.0-5.4":0.04073,"6.2-6.4":0.01071,"7.2-7.4":0.02081,"8.2":0.01071,"9.2":0.0104,"10.1":0.02096,"11.1-11.2":0.13525,"12.0":0.02081,"13.0":0.05202,"14.0":0.11445,"15.0":0.08323,"16.0":4.27613},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00675,"4.4":0,"4.4.3-4.4.4":0.01079},A:{"11":0.11216,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.2865},Q:{"10.4":0},O:{"0":0.19295},H:{"0":0.13285},L:{"0":22.02727},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GW.js
new file mode 100644
index 0000000..0d59662
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GW.js
@@ -0,0 +1 @@
+module.exports={C:{"27":0.00474,"29":0.00474,"91":0.10907,"96":0.0901,"97":0.1636,_:"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 28 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 92 93 94 95 98 99 3.5 3.6"},D:{"33":0.00711,"38":0.00474,"48":0.00711,"54":0.00474,"60":0.00237,"71":0.01897,"72":0.00237,"75":0.01423,"83":0.00948,"86":0.00948,"87":0.00711,"88":0.03557,"89":0.03082,"90":0.04742,"91":0.03082,"92":0.00948,"93":0.0166,"94":0.00474,"95":0.22287,"96":0.03082,"97":2.83572,"98":12.50228,_:"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 34 35 36 37 39 40 41 42 43 44 45 46 47 49 50 51 52 53 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 73 74 76 77 78 79 80 81 84 85 99 100 101"},F:{"76":0.06876,"82":0.01423,"83":0.36988,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05453,"13":0.00237,"15":0.00237,"16":0.00474,"84":0.01423,"85":0.01186,"90":0.00474,"91":0.01423,"93":0.01423,"95":0.01186,"96":0.01186,"97":0.40544,"98":1.5862,_:"14 17 18 79 80 81 83 86 87 88 89 92 94"},E:{"4":0,"15":0.00237,_:"0 5 6 7 8 9 10 11 12 13 14 3.1 3.2 6.1 7.1 9.1 10.1 11.1 12.1 13.1 15.2-15.3 15.4","5.1":0.00237,"14.1":0.01423,"15.1":0.00474},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.041,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02303,"10.0-10.2":0.00842,"10.3":0.01348,"11.0-11.2":0.0146,"11.3-11.4":0.00281,"12.0-12.1":1.13568,"12.2-12.5":0.92674,"13.0-13.1":0.04044,"13.2":0.00112,"13.3":0,"13.4-13.7":1.32889,"14.0-14.4":0.35329,"14.5-14.8":0.45439,"15.0-15.1":1.04076,"15.2-15.3":0.23028,"15.4":0},P:{"4":1.45239,"5.0-5.4":0.19571,"6.2-6.4":0.04021,"7.2-7.4":0.13391,"8.2":0.01071,"9.2":0.0515,"10.1":0.02096,"11.1-11.2":0.10301,"12.0":0.09271,"13.0":0.23691,"14.0":0.0412,"15.0":0.09271,"16.0":0.24722},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.02608,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0.04577},H:{"0":1.74788},L:{"0":69.65273},S:{"2.5":0.2365}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GY.js
new file mode 100644
index 0000000..71c1b5e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/GY.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01091,"65":0.01091,"88":0.00364,"91":0.02545,"94":0.00364,"95":0.01091,"96":0.44347,"97":0.62522,"98":0.02181,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 89 90 92 93 99 3.5 3.6"},D:{"47":0.00727,"49":0.01454,"50":0.00364,"55":0.00727,"56":0.00364,"60":0.00364,"63":0.01091,"65":0.03272,"66":0.00364,"68":0.01091,"69":0.01091,"70":0.01091,"75":0.02545,"76":0.07997,"77":0.09451,"79":0.13086,"80":0.04726,"81":0.02545,"83":0.00727,"84":0.01454,"86":0.01818,"87":0.08724,"88":0.04362,"89":0.01454,"90":0.03635,"91":0.05089,"92":0.05816,"93":0.15994,"94":0.04726,"95":0.10178,"96":0.27626,"97":6.88469,"98":13.99112,"99":0.06543,"100":0.04362,_:"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 40 41 42 43 44 45 46 48 51 52 53 54 57 58 59 61 62 64 67 71 72 73 74 78 85 101"},F:{"28":0.01454,"80":0.00727,"81":0.00364,"82":0.07634,"83":0.5089,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01454,"16":0.02908,"17":0.01091,"18":0.02545,"84":0.01454,"85":0.00727,"88":0.00364,"89":0.00727,"90":0.00727,"91":0.00364,"92":0.01091,"95":0.03999,"96":0.05453,"97":1.33405,"98":4.90362,_:"12 13 14 79 80 81 83 86 87 93 94"},E:{"4":0,"14":0.04362,"15":0.04726,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1 11.1 15.4","10.1":0.00727,"12.1":0.01091,"13.1":0.02908,"14.1":0.20356,"15.1":0.12723,"15.2-15.3":0.35623},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01445,"6.0-6.1":0.00085,"7.0-7.1":0.0765,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0952,"10.0-10.2":0,"10.3":0.0595,"11.0-11.2":0.06205,"11.3-11.4":0.00765,"12.0-12.1":0.00425,"12.2-12.5":0.41736,"13.0-13.1":0.00765,"13.2":0.00425,"13.3":0.01955,"13.4-13.7":0.18615,"14.0-14.4":0.32981,"14.5-14.8":1.46288,"15.0-15.1":1.24613,"15.2-15.3":4.466,"15.4":0.0357},P:{"4":0.29837,"5.0-5.4":0.19571,"6.2-6.4":0.04021,"7.2-7.4":0.22378,"8.2":0.01071,"9.2":0.04262,"10.1":0.07459,"11.1-11.2":0.39427,"12.0":0.03197,"13.0":0.20246,"14.0":0.11722,"15.0":0.1705,"16.0":3.48451},I:{"0":0,"3":0,"4":0.01856,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00247,"4.4":0,"4.4.3-4.4.4":0.06806},A:{"10":0.01818,"11":0.04726,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.14001},Q:{"10.4":0.01909},O:{"0":0.59822},H:{"0":0.1928},L:{"0":44.96927},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HK.js
new file mode 100644
index 0000000..60590c5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HK.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.02236,"52":0.0149,"56":0.00373,"72":0.00373,"78":0.03726,"88":0.00373,"89":0.01863,"90":0.02981,"91":0.01863,"94":0.0149,"95":0.02236,"96":0.40241,"97":0.59616,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 92 93 98 99 3.5 3.6"},D:{"19":0.00745,"22":0.02236,"26":0.01118,"30":0.00745,"34":0.05962,"38":0.14531,"48":0.00373,"49":0.06707,"53":0.04844,"55":0.01863,"56":0.01863,"57":0.00373,"61":0.02981,"62":0.01118,"63":0.01863,"64":0.00373,"65":0.0149,"67":0.02236,"68":0.01863,"69":0.01863,"70":0.01118,"71":0.01118,"72":0.01863,"73":0.0149,"74":0.02236,"75":0.02608,"76":0.01118,"77":0.00745,"78":0.03726,"79":0.54772,"80":0.03726,"81":0.03726,"83":0.04471,"84":0.02608,"85":0.01863,"86":0.04471,"87":0.09688,"88":0.02236,"89":0.08942,"90":0.02981,"91":0.09688,"92":0.24592,"93":0.07452,"94":0.19375,"95":0.12668,"96":0.66323,"97":6.22242,"98":14.46061,"99":0.01863,"100":0.0149,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 23 24 25 27 28 29 31 32 33 35 36 37 39 40 41 42 43 44 45 46 47 50 51 52 54 58 59 60 66 101"},F:{"28":0.02236,"36":0.03726,"40":0.00745,"46":0.06707,"82":0.02236,"83":0.11923,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00745,"17":0.00373,"18":0.0149,"92":0.00373,"94":0.00745,"95":0.01118,"96":0.02236,"97":0.6446,"98":2.49642,_:"13 14 15 16 79 80 81 83 84 85 86 87 88 89 90 91 93"},E:{"4":0,"8":0.01118,"11":0.00745,"12":0.01118,"13":0.11551,"14":0.56263,"15":0.27572,_:"0 5 6 7 9 10 3.1 3.2 5.1 6.1 7.1","9.1":0.00745,"10.1":0.02236,"11.1":0.04471,"12.1":0.06707,"13.1":0.38378,"14.1":1.93379,"15.1":0.78619,"15.2-15.3":1.79593,"15.4":0.01118},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01697,"6.0-6.1":0.01132,"7.0-7.1":0.0198,"8.1-8.4":0.02546,"9.0-9.2":0.00849,"9.3":0.20651,"10.0-10.2":0.01132,"10.3":0.13579,"11.0-11.2":0.04809,"11.3-11.4":0.05375,"12.0-12.1":0.06224,"12.2-12.5":0.82603,"13.0-13.1":0.07355,"13.2":0.02263,"13.3":0.14427,"13.4-13.7":0.42716,"14.0-14.4":1.47102,"14.5-14.8":5.17403,"15.0-15.1":4.10471,"15.2-15.3":15.34104,"15.4":0.09901},P:{"4":0.80478,"5.0-5.4":0.08172,"6.2-6.4":0.04086,"7.2-7.4":0.01045,"8.2":0.01045,"9.2":0.04181,"10.1":0.0209,"11.1-11.2":0.09407,"12.0":0.06271,"13.0":0.17768,"14.0":0.18813,"15.0":0.22994,"16.0":7.24306},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00167,"4.2-4.3":0.00335,"4.4":0,"4.4.3-4.4.4":0.02008},A:{"11":0.40241,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.19449},Q:{"10.4":0.07529},O:{"0":0.30115},H:{"0":0.08316},L:{"0":25.51358},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HN.js
new file mode 100644
index 0000000..e4b6a4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HN.js
@@ -0,0 +1 @@
+module.exports={C:{"44":0.01174,"45":0.00391,"52":0.02348,"56":0.00391,"73":0.04305,"78":0.00783,"89":0.00391,"91":0.01174,"93":0.01174,"94":0.02348,"95":0.02348,"96":0.43054,"97":0.74366,"98":0.01174,_:"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 40 41 42 43 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 79 80 81 82 83 84 85 86 87 88 90 92 99 3.5 3.6"},D:{"38":0.01174,"41":0.01174,"47":0.00783,"49":0.01957,"53":0.03914,"58":0.00391,"63":0.00783,"65":0.01566,"66":0.00783,"68":0.07828,"69":0.01174,"70":0.00783,"71":0.00783,"72":0.00783,"73":0.00783,"74":0.00783,"75":0.03131,"76":0.03523,"77":0.00783,"78":0.03131,"79":0.23875,"80":0.09785,"81":0.0274,"83":0.03523,"84":0.06654,"85":0.03523,"86":0.0274,"87":0.06654,"88":0.03523,"89":0.05871,"90":0.02348,"91":0.06654,"92":0.07045,"93":0.09002,"94":0.10176,"95":0.08611,"96":0.49708,"97":7.03737,"98":17.55038,"99":0.03131,"100":0.01566,_:"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 39 40 42 43 44 45 46 48 50 51 52 54 55 56 57 59 60 61 62 64 67 101"},F:{"46":0.00391,"81":0.00391,"82":0.51273,"83":1.75739,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00783,"15":0.01957,"16":0.00391,"17":0.00783,"18":0.03914,"84":0.00783,"89":0.00783,"90":0.00391,"91":0.00783,"92":0.01957,"93":0.00391,"94":0.00783,"95":0.01957,"96":0.03131,"97":0.73583,"98":2.64586,_:"13 14 79 80 81 83 85 86 87 88"},E:{"4":0,"13":0.02348,"14":0.11351,"15":0.07045,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 15.4","5.1":0.04305,"9.1":0.01174,"10.1":0.00391,"11.1":0.03131,"12.1":0.01174,"13.1":0.10568,"14.1":0.3914,"15.1":0.17613,"15.2-15.3":0.52839},G:{"8":0,"3.2":0.00248,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01157,"7.0-7.1":0.02479,"8.1-8.4":0.00165,"9.0-9.2":0.00331,"9.3":0.05288,"10.0-10.2":0.00661,"10.3":0.08345,"11.0-11.2":0.01239,"11.3-11.4":0.01074,"12.0-12.1":0.01074,"12.2-12.5":0.33134,"13.0-13.1":0.0157,"13.2":0.00413,"13.3":0.03223,"13.4-13.7":0.08924,"14.0-14.4":0.45941,"14.5-14.8":1.45426,"15.0-15.1":1.28157,"15.2-15.3":4.33551,"15.4":0.0347},P:{"4":0.29919,"5.0-5.4":0.08172,"6.2-6.4":0.04086,"7.2-7.4":0.14444,"8.2":0.04086,"9.2":0.03095,"10.1":0.07459,"11.1-11.2":0.14444,"12.0":0.04127,"13.0":0.11348,"14.0":0.15475,"15.0":0.11348,"16.0":1.73322},I:{"0":0,"3":0,"4":0.00277,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00277,"4.2-4.3":0.00369,"4.4":0,"4.4.3-4.4.4":0.05164},A:{"11":0.10568,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.09738},Q:{"10.4":0},O:{"0":0.0852},H:{"0":0.20166},L:{"0":39.39483},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HR.js
new file mode 100644
index 0000000..7aacf60
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HR.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00468,"52":0.08886,"56":0.00935,"63":0.02806,"68":0.00468,"72":0.00468,"75":0.00468,"78":0.03274,"84":0.01871,"88":0.02806,"89":0.05145,"90":0.00468,"91":0.08419,"92":0.05145,"93":0.00468,"94":0.02806,"95":0.0608,"96":2.06256,"97":3.20842,"98":0.00935,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 57 58 59 60 61 62 64 65 66 67 69 70 71 73 74 76 77 79 80 81 82 83 85 86 87 99 3.5 3.6"},D:{"38":0.00935,"41":0.00468,"43":0.00935,"47":0.00468,"49":0.09822,"53":0.03274,"59":0.00468,"63":0.00935,"65":0.00468,"66":0.00468,"68":0.00468,"69":0.01403,"70":0.00468,"71":0.01403,"74":0.01403,"75":0.02339,"76":0.02339,"77":0.1637,"78":0.00468,"79":0.13096,"80":0.01871,"81":0.25256,"83":0.01403,"84":0.03274,"85":0.01871,"86":0.04677,"87":0.0608,"88":0.02806,"89":0.04209,"90":0.02806,"91":0.05612,"92":0.04209,"93":0.11693,"94":0.05612,"95":0.06548,"96":0.49109,"97":9.41948,"98":21.04182,"99":0.00935,"100":0.00468,_:"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 39 40 42 44 45 46 48 50 51 52 54 55 56 57 58 60 61 62 64 67 72 73 101"},F:{"36":0.00468,"46":0.01403,"68":0.00468,"72":0.00935,"82":0.35545,"83":1.75388,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 71 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.01871,"18":0.01403,"86":0.00468,"88":0.01871,"89":0.00935,"92":0.00935,"94":0.00468,"95":0.00935,"96":0.03742,"97":0.65946,"98":2.58638,_:"12 13 14 15 16 79 80 81 83 84 85 87 90 91 93"},E:{"4":0,"13":0.00935,"14":0.07951,"15":0.03742,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00935,"12.1":0.02339,"13.1":0.14031,"14.1":0.31336,"15.1":0.14966,"15.2-15.3":0.35078},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00668,"6.0-6.1":0,"7.0-7.1":0.00445,"8.1-8.4":0.00223,"9.0-9.2":0.00148,"9.3":0.06163,"10.0-10.2":0.00074,"10.3":0.02747,"11.0-11.2":0.01114,"11.3-11.4":0.02227,"12.0-12.1":0.01336,"12.2-12.5":0.24205,"13.0-13.1":0.01782,"13.2":0.00891,"13.3":0.0297,"13.4-13.7":0.11286,"14.0-14.4":0.3705,"14.5-14.8":1.41889,"15.0-15.1":1.2741,"15.2-15.3":3.78444,"15.4":0.01485},P:{"4":0.13398,"5.0-5.4":0.01056,"6.2-6.4":0.01056,"7.2-7.4":0.01031,"8.2":0.01049,"9.2":0.09508,"10.1":0.01031,"11.1-11.2":0.12367,"12.0":0.04122,"13.0":0.11337,"14.0":0.15459,"15.0":0.1649,"16.0":3.12279},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00192,"4.2-4.3":0.00447,"4.4":0,"4.4.3-4.4.4":0.02555},A:{"11":0.28997,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.26083},Q:{"10.4":0},O:{"0":0.08517},H:{"0":0.44851},L:{"0":40.42433},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HT.js
new file mode 100644
index 0000000..3c05298
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HT.js
@@ -0,0 +1 @@
+module.exports={C:{"46":0.00146,"52":0.00731,"68":0.00146,"78":0.00146,"84":0.00292,"87":0.00439,"88":0.00146,"89":0.00439,"91":0.00731,"94":0.00146,"95":0.01901,"96":0.17398,"97":0.30556,"98":0.00585,_:"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 40 41 42 43 44 45 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 90 92 93 99 3.5 3.6"},D:{"11":0.00292,"26":0.00146,"33":0.00585,"38":0.00439,"39":0.00292,"42":0.00439,"43":0.00585,"46":0.00146,"49":0.01023,"50":0.00585,"54":0.00146,"55":0.00439,"56":0.00731,"58":0.00146,"59":0.00146,"60":0.05556,"63":0.01462,"64":0.00731,"65":0.00292,"66":0.00292,"67":0.00439,"68":0.00731,"69":0.00292,"70":0.01316,"71":0.00731,"72":0.00585,"73":0.01023,"74":0.01023,"75":0.03363,"76":0.04678,"77":0.04386,"78":0.00146,"79":0.03363,"80":0.01023,"81":0.02193,"83":0.00585,"84":0.01462,"85":0.01023,"86":0.0307,"87":0.02193,"88":0.0307,"89":0.09211,"90":0.02339,"91":0.02485,"92":0.11404,"93":0.05263,"94":0.09503,"95":0.02193,"96":0.1579,"97":2.10236,"98":4.1784,"99":0.00439,"100":0.00439,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 34 35 36 37 40 41 44 45 47 48 51 52 53 57 61 62 101"},F:{"33":0.00146,"77":0.00439,"79":0.00146,"80":0.00439,"82":0.02778,"83":0.33626,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.04532,"13":0.02047,"14":0.01023,"15":0.01023,"16":0.0117,"17":0.0117,"18":0.0424,"80":0.00292,"84":0.01608,"85":0.00585,"86":0.02778,"87":0.00292,"88":0.00146,"89":0.02193,"90":0.00439,"91":0.00292,"92":0.01462,"93":0.00731,"94":0.00731,"95":0.00877,"96":0.0424,"97":0.41959,"98":1.38013,_:"79 81 83"},E:{"4":0,"12":0.00146,"13":0.03509,"14":0.04825,"15":0.02339,_:"0 5 6 7 8 9 10 11 3.1 3.2 7.1 9.1","5.1":0.0117,"6.1":0.00439,"10.1":0.09942,"11.1":0.00731,"12.1":0.01316,"13.1":0.02047,"14.1":0.16374,"15.1":0.36989,"15.2-15.3":0.09795,"15.4":0.00146},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00104,"7.0-7.1":0.01351,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04262,"10.0-10.2":0.00208,"10.3":0.11538,"11.0-11.2":0.02495,"11.3-11.4":0.4449,"12.0-12.1":0.09251,"12.2-12.5":2.5613,"13.0-13.1":0.05925,"13.2":0.02079,"13.3":0.27962,"13.4-13.7":0.57588,"14.0-14.4":1.71204,"14.5-14.8":1.74426,"15.0-15.1":1.38564,"15.2-15.3":1.3004,"15.4":0.01455},P:{"4":0.35753,"5.0-5.4":0.08172,"6.2-6.4":0.04086,"7.2-7.4":0.2043,"8.2":0.04086,"9.2":0.23495,"10.1":0.07459,"11.1-11.2":0.4086,"12.0":0.07151,"13.0":0.09194,"14.0":0.30645,"15.0":0.26559,"16.0":0.75592},I:{"0":0,"3":0,"4":0.00033,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00154,"4.2-4.3":0.00065,"4.4":0,"4.4.3-4.4.4":0.01456},A:{"10":0.00146,"11":0.07749,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.02561},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.16222},Q:{"10.4":0},O:{"0":0.21345},H:{"0":0.86491},L:{"0":72.20151},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HU.js
new file mode 100644
index 0000000..7e54804
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/HU.js
@@ -0,0 +1 @@
+module.exports={C:{"50":0.01385,"52":0.15233,"60":0.00462,"68":0.01385,"72":0.01385,"74":0.00923,"76":0.00462,"78":0.03693,"80":0.00462,"81":0.00923,"82":0.00462,"83":0.00462,"84":0.44314,"86":0.00462,"88":0.03231,"89":0.02308,"90":0.00462,"91":0.10617,"92":0.00923,"93":0.00462,"94":0.0277,"95":0.11078,"96":2.88038,"97":3.88667,"98":0.00923,_:"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 40 41 42 43 44 45 46 47 48 49 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 69 70 71 73 75 77 79 85 87 99 3.5 3.6"},D:{"24":0.01385,"33":0.01385,"34":0.00923,"37":0.01385,"38":0.0277,"49":0.36466,"53":0.01846,"66":0.01846,"68":0.00462,"69":0.00462,"70":0.00462,"71":0.00462,"73":0.00462,"74":0.0277,"75":0.00462,"76":0.00923,"77":0.00923,"78":0.01385,"79":0.26311,"80":0.01385,"81":0.01846,"83":0.05539,"84":0.01846,"85":0.01846,"86":0.0277,"87":0.48468,"88":0.02308,"89":0.04154,"90":0.0277,"91":0.03231,"92":0.04154,"93":0.15233,"94":0.03231,"95":0.06462,"96":0.38313,"97":8.06877,"98":19.11024,"99":0.00923,"100":0.00923,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 30 31 32 35 36 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 59 60 61 62 63 64 65 67 72 101"},F:{"36":0.00923,"46":0.00462,"80":0.00462,"81":0.00462,"82":0.36928,"83":1.66638,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00923,"18":0.00923,"87":0.00923,"89":0.00462,"92":0.00923,"95":0.01385,"96":0.02308,"97":0.7801,"98":2.52495,_:"12 13 14 15 16 79 80 81 83 84 85 86 88 90 91 93 94"},E:{"4":0,"13":0.12463,"14":0.11078,"15":0.06001,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.01385,"11.1":0.01385,"12.1":0.03231,"13.1":0.10617,"14.1":0.29081,"15.1":0.18464,"15.2-15.3":0.42467,"15.4":0.00462},G:{"8":0.00105,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00105,"6.0-6.1":0.00211,"7.0-7.1":0.00633,"8.1-8.4":0,"9.0-9.2":0.00316,"9.3":0.02637,"10.0-10.2":0.00211,"10.3":0.03375,"11.0-11.2":0.01898,"11.3-11.4":0.0116,"12.0-12.1":0.01793,"12.2-12.5":0.26051,"13.0-13.1":0.01688,"13.2":0.00422,"13.3":0.04113,"13.4-13.7":0.27212,"14.0-14.4":0.44403,"14.5-14.8":1.64535,"15.0-15.1":1.40277,"15.2-15.3":6.29137,"15.4":0.03902},P:{"4":0.21756,"5.0-5.4":0.08172,"6.2-6.4":0.04086,"7.2-7.4":0.01045,"8.2":0.01045,"9.2":0.04181,"10.1":0.0209,"11.1-11.2":0.03108,"12.0":0.02072,"13.0":0.07252,"14.0":0.13468,"15.0":0.09324,"16.0":2.29988},I:{"0":0,"3":0,"4":0,"2.1":0.00383,"2.2":0,"2.3":0,"4.1":0.00383,"4.2-4.3":0.0153,"4.4":0,"4.4.3-4.4.4":0.07396},A:{"11":0.18926,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0.27997},Q:{"10.4":0},O:{"0":0.03769},H:{"0":0.44346},L:{"0":40.30563},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ID.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ID.js
new file mode 100644
index 0000000..c2cd637
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ID.js
@@ -0,0 +1 @@
+module.exports={C:{"36":0.12877,"45":0.00307,"47":0.00307,"48":0.00307,"52":0.02453,"56":0.01533,"60":0.00613,"62":0.00613,"66":0.00307,"68":0.00307,"69":0.00307,"70":0.00307,"72":0.01533,"77":0.00307,"78":0.01226,"80":0.00613,"81":0.00613,"82":0.00307,"83":0.00307,"84":0.0092,"85":0.00613,"86":0.00307,"87":0.00307,"88":0.02146,"89":0.01533,"90":0.00613,"91":0.02453,"92":0.01226,"93":0.01533,"94":0.02146,"95":0.04599,"96":1.01485,"97":1.65257,"98":0.05825,_:"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 37 38 39 40 41 42 43 44 46 49 50 51 53 54 55 57 58 59 61 63 64 65 67 71 73 74 75 76 79 99 3.5 3.6"},D:{"25":0.00613,"49":0.01533,"58":0.00613,"63":0.01533,"65":0.00307,"66":0.00307,"67":0.00613,"68":0.00307,"69":0.00613,"70":0.0092,"71":0.0184,"72":0.00613,"73":0.00613,"74":0.01226,"75":0.0092,"76":0.0092,"77":0.0092,"78":0.0092,"79":0.04292,"80":0.02453,"81":0.01226,"83":0.02453,"84":0.03066,"85":0.03679,"86":0.04599,"87":0.08891,"88":0.02146,"89":0.09198,"90":0.02146,"91":0.03679,"92":0.05519,"93":0.09198,"94":0.05519,"95":0.05825,"96":0.33726,"97":5.70276,"98":14.99581,"99":0.0092,"100":0.0092,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 59 60 61 62 64 101"},F:{"82":0.06745,"83":0.43537,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00613,"14":0.00307,"15":0.00307,"17":0.00307,"18":0.01533,"84":0.00307,"92":0.0092,"94":0.00307,"95":0.00613,"96":0.02759,"97":0.37405,"98":1.48701,_:"13 16 79 80 81 83 85 86 87 88 89 90 91 93"},E:{"4":0,"12":0.00613,"13":0.0184,"14":0.07665,"15":0.03986,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 10.1 15.4","5.1":0.11957,"9.1":0.00613,"11.1":0.0092,"12.1":0.0184,"13.1":0.08585,"14.1":0.1717,"15.1":0.09198,"15.2-15.3":0.1349},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00052,"5.0-5.1":0.00052,"6.0-6.1":0.00104,"7.0-7.1":0.00052,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00993,"10.0-10.2":0.00157,"10.3":0.01567,"11.0-11.2":0.01045,"11.3-11.4":0.00836,"12.0-12.1":0.01515,"12.2-12.5":0.28633,"13.0-13.1":0.0162,"13.2":0.00731,"13.3":0.04493,"13.4-13.7":0.11599,"14.0-14.4":0.43106,"14.5-14.8":1.00528,"15.0-15.1":0.98752,"15.2-15.3":2.25614,"15.4":0.00679},P:{"4":0.20201,"5.0-5.4":0.08172,"6.2-6.4":0.02146,"7.2-7.4":0.08506,"8.2":0.01045,"9.2":0.0319,"10.1":0.02126,"11.1-11.2":0.10632,"12.0":0.04253,"13.0":0.11695,"14.0":0.15948,"15.0":0.13822,"16.0":1.16953},I:{"0":0,"3":0.00109,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00109,"4.2-4.3":0.00082,"4.4":0,"4.4.3-4.4.4":0.01088},A:{"8":0.00624,"9":0.00312,"11":0.17461,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.12481},Q:{"10.4":0},O:{"0":1.14411},H:{"0":1.05035},L:{"0":60.07681},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IE.js
new file mode 100644
index 0000000..5b6c6ec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IE.js
@@ -0,0 +1 @@
+module.exports={C:{"11":0.0088,"24":0.01321,"38":0.02201,"43":0.01761,"44":0.07483,"45":0.01761,"50":0.01321,"52":0.02201,"66":0.01321,"70":0.0088,"78":0.04842,"79":0.01761,"80":0.01321,"81":0.0088,"82":0.01321,"83":0.0088,"84":0.0088,"87":0.17168,"88":0.0088,"91":0.16728,"94":0.4358,"95":0.01321,"96":0.51944,"97":0.70432,"98":0.0044,_:"2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 46 47 48 49 51 53 54 55 56 57 58 59 60 61 62 63 64 65 67 68 69 71 72 73 74 75 76 77 85 86 89 90 92 93 99 3.5 3.6"},D:{"28":0.0044,"37":0.0088,"38":0.0088,"43":0.0088,"47":0.01761,"48":0.2157,"49":0.07924,"60":0.02201,"63":0.0088,"65":0.03522,"67":0.01761,"68":0.01761,"69":0.01321,"70":0.0088,"71":0.0088,"72":0.01761,"74":0.01761,"75":0.0044,"76":0.02201,"77":0.01321,"78":0.17608,"79":0.07483,"80":0.03522,"81":0.09244,"83":0.05282,"84":0.09244,"85":0.10125,"86":0.11885,"87":0.12766,"88":0.02641,"89":0.03962,"90":0.02201,"91":0.04842,"92":0.04402,"93":0.16728,"94":0.36977,"95":0.06603,"96":0.34776,"97":9.0241,"98":19.45244,"99":0.0088,"100":0.01321,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 39 40 41 42 44 45 46 50 51 52 53 54 55 56 57 58 59 61 62 64 66 73 101"},F:{"82":0.11885,"83":0.38297,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.0088,"13":0.0088,"15":0.01761,"16":0.02201,"18":0.03081,"84":0.0088,"85":0.0044,"86":0.0088,"88":0.0044,"92":0.0088,"94":0.0088,"95":0.04402,"96":0.03962,"97":0.81437,"98":2.28464,_:"14 17 79 80 81 83 87 89 90 91 93"},E:{"4":0,"8":0.0088,"9":0.03081,"13":0.08364,"14":0.73954,"15":0.16728,_:"0 5 6 7 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.0088,"11.1":0.01761,"12.1":0.07483,"13.1":0.28173,"14.1":1.5407,"15.1":0.71753,"15.2-15.3":1.3162,"15.4":0.0044},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.0154,"7.0-7.1":0.05389,"8.1-8.4":0.0077,"9.0-9.2":0.00513,"9.3":0.11804,"10.0-10.2":0,"10.3":0.1668,"11.0-11.2":0.03593,"11.3-11.4":0.03593,"12.0-12.1":0.04106,"12.2-12.5":1.05209,"13.0-13.1":0.02309,"13.2":0.02053,"13.3":0.11547,"13.4-13.7":0.37978,"14.0-14.4":1.17783,"14.5-14.8":6.4614,"15.0-15.1":3.5335,"15.2-15.3":12.37366,"15.4":0.02823},P:{"4":0.021,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.0315,"8.2":0.08049,"9.2":0.05112,"10.1":0.12073,"11.1-11.2":0.09449,"12.0":0.0315,"13.0":0.11548,"14.0":0.18897,"15.0":0.13648,"16.0":3.01305},I:{"0":0,"3":0,"4":0.00292,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00195,"4.2-4.3":0.00584,"4.4":0,"4.4.3-4.4.4":0.03407},A:{"8":0.00446,"9":0.1203,"11":0.24061,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.40298},Q:{"10.4":0},O:{"0":0.02799},H:{"0":0.10598},L:{"0":25.91888},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IL.js
new file mode 100644
index 0000000..12989b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IL.js
@@ -0,0 +1 @@
+module.exports={C:{"24":0.00399,"25":0.01197,"26":0.03192,"27":0.00399,"36":0.00399,"52":0.02793,"56":0.00399,"66":0.00399,"72":0.00399,"78":0.01995,"79":0.1197,"80":0.02793,"84":0.01197,"88":0.01995,"89":0.00399,"91":0.01596,"94":0.00798,"95":0.02793,"96":0.50274,"97":0.85386,"98":0.00798,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 67 68 69 70 71 73 74 75 76 77 81 82 83 85 86 87 90 92 93 99 3.5 3.6"},D:{"31":0.04389,"32":0.00798,"38":0.02394,"49":0.0399,"53":0.00798,"55":0.00399,"56":0.00399,"63":0.03192,"65":0.00798,"67":0.00399,"68":0.00798,"69":0.00399,"70":0.00798,"71":0.00798,"72":0.00399,"73":0.03192,"74":0.01197,"75":0.01596,"76":0.01197,"77":0.00798,"78":0.01197,"79":0.07581,"80":0.26733,"81":0.01995,"83":0.01596,"84":0.01197,"85":0.02394,"86":0.03591,"87":0.11172,"88":0.01995,"89":0.0798,"90":0.03192,"91":0.04389,"92":0.04389,"93":0.10773,"94":0.04788,"95":0.05985,"96":0.58254,"97":9.3366,"98":20.66022,"99":0.01197,"100":0.00798,_:"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 33 34 35 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 54 57 58 59 60 61 62 64 66 101"},F:{"28":0.00399,"77":0.00399,"82":0.14364,"83":0.56259,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01995,"91":0.00798,"92":0.00798,"93":0.00399,"94":0.00798,"95":0.01596,"96":0.06384,"97":0.54264,"98":1.89924,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90"},E:{"4":0,"7":0.00399,"8":0.12768,"13":0.03591,"14":0.09177,"15":0.04389,_:"0 5 6 9 10 11 12 3.1 3.2 5.1 7.1 9.1 10.1","6.1":0.00798,"11.1":0.00798,"12.1":0.01197,"13.1":0.07581,"14.1":0.40698,"15.1":0.17955,"15.2-15.3":0.34713,"15.4":0.00798},G:{"8":0.00267,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00401,"6.0-6.1":0.00134,"7.0-7.1":0.0294,"8.1-8.4":0.01203,"9.0-9.2":0.00134,"9.3":0.06548,"10.0-10.2":0.00535,"10.3":0.07216,"11.0-11.2":0.03742,"11.3-11.4":0.02806,"12.0-12.1":0.04009,"12.2-12.5":0.37016,"13.0-13.1":0.03474,"13.2":0.00935,"13.3":0.06682,"13.4-13.7":0.19778,"14.0-14.4":0.68554,"14.5-14.8":3.06823,"15.0-15.1":1.77599,"15.2-15.3":6.81397,"15.4":0.03608},P:{"4":0.05112,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.02045,"8.2":0.08049,"9.2":0.08179,"10.1":0.03067,"11.1-11.2":0.28625,"12.0":0.10223,"13.0":0.23513,"14.0":0.35781,"15.0":0.27603,"16.0":5.53076},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.002,"4.2-4.3":0.00334,"4.4":0,"4.4.3-4.4.4":0.01869},A:{"9":0.00798,"10":0.00798,"11":0.29925,_:"6 7 8 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.16825},Q:{"10.4":0.00601},O:{"0":0.05408},H:{"0":0.3072},L:{"0":39.21334},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IM.js
new file mode 100644
index 0000000..d0075df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IM.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.27833,"63":0.01953,"70":0.02442,"78":0.00977,"83":0.05371,"84":0.03418,"87":0.15626,"89":0.00977,"91":0.00488,"92":0.0293,"93":0.01465,"95":0.0293,"96":0.95707,"97":1.51861,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 64 65 66 67 68 69 71 72 73 74 75 76 77 79 80 81 82 85 86 88 90 94 98 99 3.5 3.6"},D:{"38":0.02442,"49":0.06836,"65":0.01953,"67":0.00977,"76":0.03418,"77":0.01465,"78":0.0293,"79":0.03906,"81":0.00488,"84":0.01465,"85":0.2002,"86":0.11231,"87":0.08301,"88":0.05371,"89":0.00977,"90":0.03418,"91":0.13184,"92":0.0293,"93":0.0293,"94":0.10743,"95":0.06348,"96":0.85453,"97":6.65065,"98":13.38919,"99":0.00977,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 66 68 69 70 71 72 73 74 75 80 83 100 101"},F:{"76":0.01953,"82":0.23927,"83":0.57619,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.01465,"18":0.02442,"87":0.00977,"90":0.01953,"92":0.01465,"93":0.01953,"94":0.00488,"95":0.03906,"96":0.18067,"97":2.53428,"98":6.70436,_:"12 13 14 15 17 79 80 81 83 84 85 86 88 89 91"},E:{"4":0,"11":0.01953,"12":0.01953,"13":0.12696,"14":0.46389,"15":0.25392,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.0293,"11.1":0.20509,"12.1":0.26368,"13.1":1.20122,"14.1":1.79206,"15.1":1.11332,"15.2-15.3":3.22278},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.38148,"10.0-10.2":0,"10.3":0.34333,"11.0-11.2":0.0088,"11.3-11.4":0.27877,"12.0-12.1":0.04695,"12.2-12.5":1.61689,"13.0-13.1":0.01467,"13.2":0.0088,"13.3":0.05282,"13.4-13.7":0.48125,"14.0-14.4":1.36159,"14.5-14.8":5.23507,"15.0-15.1":3.77665,"15.2-15.3":15.70521,"15.4":0.02348},P:{"4":0.0768,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.0315,"8.2":0.08049,"9.2":0.05112,"10.1":0.02194,"11.1-11.2":0.01097,"12.0":0.02194,"13.0":0.03291,"14.0":0.04389,"15.0":0.40594,"16.0":4.33374},I:{"0":0,"3":0,"4":0.01944,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00273,"4.4":0,"4.4.3-4.4.4":0.01365},A:{"9":0.00488,"11":0.26857,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.60892},Q:{"10.4":0},O:{"0":0},H:{"0":0.0872},L:{"0":16.28872},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IN.js
new file mode 100644
index 0000000..f4bb292
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IN.js
@@ -0,0 +1 @@
+module.exports={C:{"42":0.00474,"47":0.00711,"48":0.00237,"52":0.02843,"56":0.00474,"60":0.00237,"66":0.00474,"68":0.00237,"72":0.00711,"78":0.00711,"83":0.00237,"87":0.00237,"88":0.01421,"89":0.00711,"90":0.00711,"91":0.02369,"92":0.00711,"93":0.00474,"94":0.01185,"95":0.02606,"96":0.46906,"97":0.76282,"98":0.05686,_:"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 40 41 43 44 45 46 49 50 51 53 54 55 57 58 59 61 62 63 64 65 67 69 70 71 73 74 75 76 77 79 80 81 82 84 85 86 99 3.5 3.6"},D:{"49":0.02369,"55":0.00237,"56":0.00237,"58":0.00474,"63":0.01421,"64":0.00711,"66":0.00237,"67":0.00474,"68":0.00237,"69":0.00474,"70":0.01658,"71":0.03317,"72":0.00711,"73":0.00474,"74":0.01185,"75":0.00474,"76":0.00474,"77":0.00474,"78":0.00948,"79":0.14925,"80":0.0308,"81":0.01421,"83":0.03554,"84":0.01658,"85":0.01895,"86":0.02606,"87":0.06633,"88":0.01895,"89":0.02606,"90":0.04027,"91":0.04738,"92":0.0687,"93":0.06159,"94":0.07581,"95":0.05923,"96":0.34351,"97":5.42975,"98":12.07716,"99":0.02132,"100":0.01895,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 57 59 60 61 62 65 101"},F:{"80":0.00237,"82":0.04027,"83":0.24164,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00711,"17":0.00237,"18":0.00948,"84":0.00237,"89":0.00237,"92":0.00711,"94":0.00237,"95":0.00474,"96":0.01658,"97":0.23927,"98":0.73202,_:"13 14 15 16 79 80 81 83 85 86 87 88 90 91 93"},E:{"4":0,"13":0.00474,"14":0.02369,"15":0.01658,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1 15.4","5.1":0.00711,"12.1":0.00474,"13.1":0.02132,"14.1":0.0687,"15.1":0.04738,"15.2-15.3":0.09239},G:{"8":0.00096,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00048,"5.0-5.1":0.00024,"6.0-6.1":0.00024,"7.0-7.1":0.00746,"8.1-8.4":0,"9.0-9.2":0.00072,"9.3":0.00721,"10.0-10.2":0.0012,"10.3":0.00818,"11.0-11.2":0.05772,"11.3-11.4":0.00433,"12.0-12.1":0.00649,"12.2-12.5":0.12386,"13.0-13.1":0.02092,"13.2":0.00265,"13.3":0.0113,"13.4-13.7":0.03463,"14.0-14.4":0.15199,"14.5-14.8":0.33092,"15.0-15.1":0.39441,"15.2-15.3":1.22509,"15.4":0.01275},P:{"4":0.22532,"5.0-5.4":0.08172,"6.2-6.4":0.02146,"7.2-7.4":0.12875,"8.2":0.01045,"9.2":0.04292,"10.1":0.0209,"11.1-11.2":0.04292,"12.0":0.02146,"13.0":0.09656,"14.0":0.12875,"15.0":0.10729,"16.0":0.61157},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00416,"4.4":0,"4.4.3-4.4.4":0.01873},A:{"11":0.04264,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.15262},Q:{"10.4":0},O:{"0":1.99932},H:{"0":2.44189},L:{"0":68.05766},S:{"2.5":0.81652}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IQ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IQ.js
new file mode 100644
index 0000000..83fed84
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IQ.js
@@ -0,0 +1 @@
+module.exports={C:{"30":0.00216,"34":0.00216,"35":0.00216,"43":0.00433,"47":0.00649,"50":0.00216,"52":0.0303,"56":0.00216,"59":0.00216,"68":0.00649,"69":0.01298,"72":0.00433,"78":0.01082,"81":0.00216,"82":0.00216,"84":0.00216,"87":0.00216,"88":0.00649,"89":0.00433,"91":0.00866,"92":0.00649,"93":0.00433,"94":0.00433,"95":0.01082,"96":0.27266,"97":0.46742,"98":0.01082,_:"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 31 32 33 36 37 38 39 40 41 42 44 45 46 48 49 51 53 54 55 57 58 60 61 62 63 64 65 66 67 70 71 73 74 75 76 77 79 80 83 85 86 90 99 3.5 3.6"},D:{"11":0.00433,"31":0.00433,"33":0.00866,"34":0.00216,"37":0.00216,"38":0.04112,"40":0.00433,"41":0.00433,"43":0.06492,"45":0.00433,"46":0.00216,"47":0.00649,"49":0.0303,"50":0.00433,"51":0.00216,"53":0.00866,"55":0.00649,"56":0.00866,"57":0.00216,"58":0.00216,"60":0.00866,"63":0.01731,"64":0.00649,"65":0.00866,"66":0.00649,"67":0.00649,"68":0.01082,"69":0.01298,"70":0.00866,"71":0.00866,"72":0.01082,"73":0.00649,"74":0.00866,"75":0.00649,"76":0.00649,"77":0.00649,"78":0.00649,"79":0.10604,"80":0.01731,"81":0.02164,"83":0.02164,"84":0.00866,"85":0.01082,"86":0.07141,"87":0.03679,"88":0.0238,"89":0.04544,"90":0.01515,"91":0.0303,"92":0.06059,"93":0.26617,"94":0.03246,"95":0.04544,"96":0.3787,"97":3.68746,"98":9.09962,"99":0.00433,"100":0.02164,"101":0.00216,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 35 36 39 42 44 48 52 54 59 61 62"},F:{"28":0.00216,"82":0.09522,"83":0.53018,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00649,"13":0.00216,"14":0.00433,"15":0.00433,"16":0.00649,"17":0.01082,"18":0.0238,"84":0.00866,"85":0.00433,"89":0.00866,"90":0.00216,"91":0.00433,"92":0.01515,"94":0.00433,"95":0.02597,"96":0.01731,"97":0.40467,"98":1.1902,_:"79 80 81 83 86 87 88 93"},E:{"4":0,"13":0.01515,"14":0.11902,"15":0.09522,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1","5.1":0.03462,"9.1":0.00649,"10.1":0.03679,"11.1":0.00216,"12.1":0.00649,"13.1":0.06276,"14.1":0.38303,"15.1":0.2164,"15.2-15.3":0.35706,"15.4":0.00433},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00169,"6.0-6.1":0.00169,"7.0-7.1":0.04574,"8.1-8.4":0,"9.0-9.2":0.02372,"9.3":0.05591,"10.0-10.2":0.01016,"10.3":0.05929,"11.0-11.2":0.0288,"11.3-11.4":0.02202,"12.0-12.1":0.03049,"12.2-12.5":0.84197,"13.0-13.1":0.01694,"13.2":0.00847,"13.3":0.08809,"13.4-13.7":0.25581,"14.0-14.4":0.93006,"14.5-14.8":3.32891,"15.0-15.1":3.03413,"15.2-15.3":8.08594,"15.4":0.05591},P:{"4":0.17381,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.19426,"8.2":0.08049,"9.2":0.05112,"10.1":0.12073,"11.1-11.2":0.17381,"12.0":0.05112,"13.0":0.26583,"14.0":0.23515,"15.0":0.22493,"16.0":2.90365},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00073,"4.2-4.3":0.00331,"4.4":0,"4.4.3-4.4.4":0.04298},A:{"8":0.00234,"11":0.08205,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.09403},Q:{"10.4":0},O:{"0":0.70524},H:{"0":0.29674},L:{"0":49.84278},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IR.js
new file mode 100644
index 0000000..24f2909
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IR.js
@@ -0,0 +1 @@
+module.exports={C:{"3":0.0057,"24":0.00285,"29":0.0057,"30":0.00285,"31":0.00285,"32":0.00285,"33":0.00855,"38":0.00285,"39":0.00285,"40":0.00285,"41":0.00855,"43":0.00855,"47":0.01426,"48":0.0057,"49":0.0057,"50":0.00285,"52":0.08838,"56":0.0114,"60":0.0057,"65":0.00285,"68":0.0057,"72":0.02566,"77":0.0057,"78":0.01426,"79":0.0057,"80":0.00855,"81":0.0114,"82":0.0057,"83":0.0057,"84":0.00855,"85":0.0057,"86":0.0057,"87":0.0057,"88":0.01426,"89":0.01711,"90":0.00855,"91":0.11119,"92":0.01426,"93":0.01711,"94":0.03706,"95":0.09123,"96":1.62507,"97":2.73126,"98":0.02566,_:"2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 34 35 36 37 42 44 45 46 51 53 54 55 57 58 59 61 62 63 64 66 67 69 70 71 73 74 75 76 99 3.5 3.6"},D:{"29":0.0057,"34":0.03136,"38":0.0114,"48":0.04277,"49":0.02566,"51":0.00285,"56":0.00285,"58":0.0057,"60":0.00285,"62":0.00855,"63":0.01426,"64":0.0057,"66":0.00285,"67":0.0057,"68":0.0057,"69":0.00855,"70":0.00855,"71":0.01711,"72":0.0057,"73":0.0057,"74":0.00855,"75":0.0057,"76":0.0057,"77":0.0057,"78":0.01711,"79":0.02566,"80":0.02566,"81":0.02281,"83":0.03421,"84":0.04562,"85":0.05702,"86":0.09123,"87":0.08553,"88":0.02566,"89":0.04562,"90":0.02566,"91":0.07128,"92":0.06557,"93":0.11404,"94":0.05987,"95":0.05987,"96":0.36208,"97":4.62717,"98":11.73472,"99":0.00855,"100":0.00855,_:"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 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 47 50 52 53 54 55 57 59 61 65 101"},F:{"64":0.0057,"70":0.00285,"77":0.00855,"78":0.0057,"79":0.01426,"80":0.0057,"81":0.00285,"82":0.07128,"83":0.45046,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 65 66 67 68 69 71 72 73 74 75 76 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01426,"13":0.0057,"14":0.0057,"15":0.0057,"16":0.0057,"17":0.0057,"18":0.03421,"81":0.00285,"84":0.00855,"85":0.00285,"86":0.00285,"89":0.01426,"90":0.00855,"91":0.00285,"92":0.01996,"94":0.00285,"95":0.0057,"96":0.02281,"97":0.17106,"98":0.63862,_:"79 80 83 87 88 93"},E:{"4":0.0057,"13":0.00855,"14":0.01426,"15":0.00855,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1 15.4","5.1":0.23378,"12.1":0.00285,"13.1":0.01711,"14.1":0.03706,"15.1":0.02281,"15.2-15.3":0.03136},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0004,"6.0-6.1":0,"7.0-7.1":0.00316,"8.1-8.4":0,"9.0-9.2":0.00158,"9.3":0.01067,"10.0-10.2":0.00633,"10.3":0.02965,"11.0-11.2":0.02135,"11.3-11.4":0.02214,"12.0-12.1":0.02372,"12.2-12.5":0.41632,"13.0-13.1":0.02174,"13.2":0.01107,"13.3":0.06089,"13.4-13.7":0.12533,"14.0-14.4":0.43332,"14.5-14.8":0.74486,"15.0-15.1":0.82671,"15.2-15.3":1.19083,"15.4":0.00277},P:{"4":0.71431,"5.0-5.4":0.07043,"6.2-6.4":0.07043,"7.2-7.4":0.5634,"8.2":0.08049,"9.2":0.2817,"10.1":0.12073,"11.1-11.2":0.54328,"12.0":0.26158,"13.0":0.7948,"14.0":0.89541,"15.0":0.8451,"16.0":3.8935},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00267,"4.2-4.3":0.02006,"4.4":0,"4.4.3-4.4.4":0.07019},A:{"6":0.01171,"7":0.01464,"8":0.08784,"9":0.02635,"10":0.03807,"11":2.63532,_:"5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.8935},Q:{"10.4":0},O:{"0":0.13581},H:{"0":0.45341},L:{"0":57.08514},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IS.js
new file mode 100644
index 0000000..5525986
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IS.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.04215,"76":0.00602,"78":0.12044,"91":0.12646,"92":0.00602,"93":0.00602,"94":0.01807,"95":0.04215,"96":1.47539,"97":2.74001,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 79 80 81 82 83 84 85 86 87 88 89 90 98 99 3.5 3.6"},D:{"44":0.00602,"45":0.00602,"49":0.01807,"51":0.01807,"65":0.03011,"66":0.02409,"67":0.01807,"70":0.01204,"77":0.01204,"78":0.01807,"79":0.1084,"80":0.00602,"81":0.00602,"83":0.01204,"84":0.01204,"85":0.0542,"86":0.04818,"87":0.25292,"88":0.03011,"89":0.10237,"90":0.03613,"91":0.03011,"92":0.03613,"93":0.08431,"94":0.04215,"95":0.20475,"96":0.98761,"97":12.11626,"98":22.46206,"99":0.01807,"100":0.00602,_:"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 40 41 42 43 46 47 48 50 52 53 54 55 56 57 58 59 60 61 62 63 64 68 69 71 72 73 74 75 76 101"},F:{"28":0.00602,"82":0.4095,"83":1.18031,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.01204,"18":0.00602,"89":0.01204,"91":0.00602,"92":0.01204,"95":0.01807,"96":0.04818,"97":1.07794,"98":4.01667,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88 90 93 94"},E:{"4":0,"9":0.02409,"12":0.01807,"13":0.07226,"14":0.62629,"15":0.73468,_:"0 5 6 7 8 10 11 3.1 3.2 6.1 7.1 9.1","5.1":0.00602,"10.1":0.01204,"11.1":0.25292,"12.1":0.18668,"13.1":0.76479,"14.1":2.52924,"15.1":1.16225,"15.2-15.3":2.52322,"15.4":0.01204},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00782,"8.1-8.4":0.00586,"9.0-9.2":0.00782,"9.3":0.02931,"10.0-10.2":0.00195,"10.3":0.08011,"11.0-11.2":0.07816,"11.3-11.4":0.00977,"12.0-12.1":0.05862,"12.2-12.5":0.34976,"13.0-13.1":0.00391,"13.2":0.00391,"13.3":0.03322,"13.4-13.7":0.17586,"14.0-14.4":0.65849,"14.5-14.8":4.22449,"15.0-15.1":2.70821,"15.2-15.3":11.02627,"15.4":0.06448},P:{"4":0.05314,"5.0-5.4":0.08172,"6.2-6.4":0.01063,"7.2-7.4":0.01045,"8.2":0.01045,"9.2":0.04181,"10.1":0.0209,"11.1-11.2":0.02126,"12.0":0.02072,"13.0":0.03189,"14.0":0.04251,"15.0":0.11691,"16.0":3.15667},I:{"0":0,"3":0.0019,"4":0.01395,"2.1":0.0019,"2.2":0.00888,"2.3":0.00888,"4.1":0.00634,"4.2-4.3":0.01585,"4.4":0,"4.4.3-4.4.4":0.07356},A:{"8":0.03011,"9":0.01204,"10":0.00602,"11":0.13851,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00796},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.36598},Q:{"10.4":0},O:{"0":0.01591},H:{"0":0.12428},L:{"0":16.34459},S:{"2.5":0.01989}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IT.js
new file mode 100644
index 0000000..76cf0d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/IT.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00983,"52":0.10317,"56":0.00983,"59":0.00983,"66":0.00491,"68":0.00983,"72":0.00491,"78":0.09335,"82":0.00491,"84":0.00491,"87":0.02948,"88":0.01965,"89":0.00983,"91":0.07861,"92":0.00983,"93":0.01474,"94":0.08843,"95":0.05896,"96":1.46899,"97":2.37789,"98":0.01474,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 57 58 60 61 62 63 64 65 67 69 70 71 73 74 75 76 77 79 80 81 83 85 86 90 99 3.5 3.6"},D:{"38":0.00983,"49":0.12774,"60":0.01474,"63":0.01474,"65":0.01474,"66":0.0737,"67":0.01965,"68":0.00491,"69":0.25056,"70":0.00491,"71":0.00983,"72":0.00491,"74":0.02948,"75":0.00983,"76":0.00983,"77":0.01965,"78":0.00983,"79":0.05896,"80":0.03439,"81":0.02948,"83":0.01965,"84":0.03439,"85":0.03439,"86":0.0737,"87":0.113,"88":0.03439,"89":0.06387,"90":0.03439,"91":0.04422,"92":0.07861,"93":0.2653,"94":0.08843,"95":0.06387,"96":0.45691,"97":9.68352,"98":21.29786,"99":0.00983,"100":0.00983,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 61 62 64 73 101"},F:{"46":0.00491,"80":0.00491,"82":0.23091,"83":0.89417,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.00491,"16":0.00491,"17":0.00983,"18":0.01965,"90":0.00491,"91":0.00491,"92":0.00983,"94":0.00983,"95":0.02457,"96":0.04913,"97":0.88434,"98":3.1001,_:"12 14 15 79 80 81 83 84 85 86 87 88 89 93"},E:{"4":0,"11":0.00491,"12":0.00983,"13":0.04913,"14":0.38321,"15":0.21617,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1","9.1":0.00983,"10.1":0.00983,"11.1":0.06387,"12.1":0.08843,"13.1":0.3783,"14.1":0.85978,"15.1":0.54534,"15.2-15.3":1.15456,"15.4":0.01474},G:{"8":0.00411,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00411,"7.0-7.1":0.00548,"8.1-8.4":0.00685,"9.0-9.2":0.00685,"9.3":0.08499,"10.0-10.2":0.00274,"10.3":0.08362,"11.0-11.2":0.04798,"11.3-11.4":0.0425,"12.0-12.1":0.02605,"12.2-12.5":0.41537,"13.0-13.1":0.0329,"13.2":0.01371,"13.3":0.05895,"13.4-13.7":0.19192,"14.0-14.4":0.68817,"14.5-14.8":2.38254,"15.0-15.1":2.17005,"15.2-15.3":7.38202,"15.4":0.05346},P:{"4":0.09425,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.02045,"8.2":0.08049,"9.2":0.03142,"10.1":0.03067,"11.1-11.2":0.12567,"12.0":0.03142,"13.0":0.13614,"14.0":0.1885,"15.0":0.17803,"16.0":2.78565},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00199,"4.2-4.3":0.00498,"4.4":0,"4.4.3-4.4.4":0.03882},A:{"9":0.00497,"11":0.40281,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.30013},Q:{"10.4":0},O:{"0":0.12718},H:{"0":0.22635},L:{"0":33.17532},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JE.js
new file mode 100644
index 0000000..ca33e7f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JE.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00965,"60":0.00482,"66":0.0193,"78":0.00965,"83":0.00482,"91":0.01447,"96":0.78631,"97":1.10952,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 84 85 86 87 88 89 90 92 93 94 95 98 99 3.5 3.6"},D:{"49":0.05306,"65":0.03859,"67":0.0193,"72":0.1013,"78":0.03859,"79":0.01447,"80":0.06754,"83":0.00965,"87":0.08683,"88":0.00965,"89":0.02412,"90":0.02412,"91":0.01447,"92":0.04342,"93":0.0193,"94":0.06271,"95":0.05306,"96":0.2605,"97":6.51722,"98":14.86274,"101":0.00482,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 66 68 69 70 71 73 74 75 76 77 81 84 85 86 99 100"},F:{"82":0.19778,"83":0.21226,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00482,"18":0.01447,"83":0.00482,"92":0.01447,"94":0.00965,"95":0.03859,"96":0.11095,"97":1.87171,"98":6.20849,_:"12 13 14 16 17 79 80 81 84 85 86 87 88 89 90 91 93"},E:{"4":0,"11":0.03859,"12":0.00965,"13":0.1206,"14":1.35072,"15":0.43898,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1","9.1":0.01447,"10.1":0.00965,"11.1":0.04342,"12.1":0.35215,"13.1":0.91656,"14.1":3.32374,"15.1":1.31695,"15.2-15.3":3.24655,"15.4":0.00965},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.29374,"10.0-10.2":0,"10.3":0.60164,"11.0-11.2":0.00708,"11.3-11.4":0.05663,"12.0-12.1":0.01062,"12.2-12.5":1.27407,"13.0-13.1":0,"13.2":0,"13.3":0.08848,"13.4-13.7":0.2442,"14.0-14.4":0.78921,"14.5-14.8":7.65502,"15.0-15.1":5.06795,"15.2-15.3":19.23841,"15.4":0.03539},P:{"4":0.26968,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.21819,"8.2":0.08049,"9.2":0.03236,"10.1":0.03067,"11.1-11.2":0.02157,"12.0":0.01113,"13.0":0.38834,"14.0":0.04315,"15.0":0.09708,"16.0":2.86936},I:{"0":0,"3":0,"4":0.00269,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0009,"4.4":0,"4.4.3-4.4.4":0.01194},A:{"11":1.45202,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.18116},Q:{"10.4":0},O:{"0":0},H:{"0":0.0049},L:{"0":12.51737},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JM.js
new file mode 100644
index 0000000..b92ee57
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JM.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.02066,"57":0.00344,"73":0.06197,"78":0.04132,"86":0.00344,"87":0.01033,"88":0.00689,"89":0.00689,"91":0.00689,"94":0.00689,"95":0.01033,"96":0.36496,"97":0.57842,"98":0.00689,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 79 80 81 82 83 84 85 90 92 93 99 3.5 3.6"},D:{"11":0.00344,"47":0.01033,"49":0.01722,"53":0.00689,"55":0.00344,"60":0.00344,"61":0.00344,"63":0.00689,"65":0.00689,"68":0.00689,"69":0.01722,"70":0.00344,"73":0.01722,"74":0.01377,"75":0.03099,"76":0.0723,"77":0.02066,"78":0.00344,"79":0.0482,"80":0.02754,"81":0.03443,"83":0.04132,"84":0.0241,"85":0.01377,"86":0.0241,"87":0.05853,"88":0.0241,"89":0.01377,"90":0.02066,"91":0.05853,"92":0.03443,"93":0.20314,"94":0.0723,"95":0.07919,"96":0.3202,"97":7.2062,"98":14.38141,"99":0.03787,"100":0.04132,_:"4 5 6 7 8 9 10 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 40 41 42 43 44 45 46 48 50 51 52 54 56 57 58 59 62 64 66 67 71 72 101"},F:{"28":0.00344,"82":0.14116,"83":0.68516,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01377,"13":0.00689,"15":0.00689,"16":0.00689,"17":0.00689,"18":0.02066,"84":0.00689,"85":0.00344,"87":0.00689,"89":0.01377,"90":0.00344,"92":0.01377,"94":0.00689,"95":0.02754,"96":0.06886,"97":1.07422,"98":3.26741,_:"14 79 80 81 83 86 88 91 93"},E:{"4":0,"12":0.00689,"13":0.01377,"14":0.07919,"15":0.0723,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1","5.1":0.00689,"10.1":0.02066,"11.1":0.00689,"12.1":0.01377,"13.1":0.12739,"14.1":0.36496,"15.1":0.19281,"15.2-15.3":0.44759,"15.4":0.00689},G:{"8":0.01007,"3.2":0.00604,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00302,"6.0-6.1":0.00101,"7.0-7.1":0.09868,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07955,"10.0-10.2":0,"10.3":0.04733,"11.0-11.2":0.04229,"11.3-11.4":0.01007,"12.0-12.1":0.01813,"12.2-12.5":0.37459,"13.0-13.1":0.02215,"13.2":0.00503,"13.3":0.03927,"13.4-13.7":0.1158,"14.0-14.4":0.38768,"14.5-14.8":1.70477,"15.0-15.1":1.77929,"15.2-15.3":5.25026,"15.4":0.07149},P:{"4":0.18702,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.21819,"8.2":0.08049,"9.2":0.03117,"10.1":0.03067,"11.1-11.2":0.13507,"12.0":0.02078,"13.0":0.13507,"14.0":0.15585,"15.0":0.17663,"16.0":2.51434},I:{"0":0,"3":0,"4":0.00131,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00079,"4.4":0,"4.4.3-4.4.4":0.01102},A:{"8":0.01906,"10":0.00762,"11":0.08005,_:"6 7 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01312},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.09837},Q:{"10.4":0},O:{"0":0.37381},H:{"0":0.22351},L:{"0":30.19569},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JO.js
new file mode 100644
index 0000000..d2051cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JO.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.01065,"47":0.00799,"52":0.01065,"63":0.00799,"78":0.01597,"84":0.01065,"88":0.00532,"89":0.00532,"90":0.00266,"91":0.01065,"92":0.00532,"94":0.02396,"95":0.01065,"96":0.49247,"97":0.64154,"98":0.00532,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 48 49 50 51 53 54 55 56 57 58 59 60 61 62 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 93 99 3.5 3.6"},D:{"11":0.01065,"32":0.00266,"38":0.00532,"43":0.00266,"49":0.02662,"51":0.00266,"55":0.00799,"63":0.00532,"65":0.0213,"67":0.00266,"69":0.01065,"70":0.00799,"71":0.01331,"73":0.00266,"74":0.00532,"75":0.00532,"76":0.00532,"77":0.00266,"78":0.01863,"79":0.04525,"80":0.01863,"81":0.01331,"83":0.01863,"84":0.01065,"85":0.01065,"86":0.03461,"87":0.05058,"88":0.03727,"89":0.04259,"90":0.01863,"91":0.04792,"92":0.06655,"93":0.04525,"94":0.04259,"95":0.04792,"96":0.33275,"97":5.70999,"98":12.91336,"99":0.01597,"100":0.01597,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 33 34 35 36 37 39 40 41 42 44 45 46 47 48 50 52 53 54 56 57 58 59 60 61 62 64 66 68 72 101"},F:{"28":0.00266,"78":0.00266,"82":0.27152,"83":0.61758,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00532,"14":0.00266,"18":0.01597,"85":0.00266,"89":0.00266,"90":0.00266,"91":0.00266,"92":0.01065,"95":0.00799,"96":0.01331,"97":0.38333,"98":1.54928,_:"13 15 16 17 79 80 81 83 84 86 87 88 93 94"},E:{"4":0,"13":0.01065,"14":0.12511,"15":0.09051,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.01065,"12.1":0.01597,"13.1":0.10914,"14.1":0.34074,"15.1":0.16238,"15.2-15.3":0.22893,"15.4":0.00266},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00126,"6.0-6.1":0.00126,"7.0-7.1":0.01885,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05153,"10.0-10.2":0.00377,"10.3":0.03896,"11.0-11.2":0.00754,"11.3-11.4":0.02262,"12.0-12.1":0.02137,"12.2-12.5":0.55178,"13.0-13.1":0.01885,"13.2":0.01006,"13.3":0.04525,"13.4-13.7":0.22624,"14.0-14.4":0.74408,"14.5-14.8":2.67844,"15.0-15.1":2.14552,"15.2-15.3":5.94637,"15.4":0.02891},P:{"4":0.09181,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.09181,"8.2":0.08049,"9.2":0.0306,"10.1":0.03067,"11.1-11.2":0.14281,"12.0":0.0408,"13.0":0.14281,"14.0":0.17342,"15.0":0.15302,"16.0":2.24423},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.24782,"4.2-4.3":0.30978,"4.4":0,"4.4.3-4.4.4":4.33685},A:{"11":0.07986,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.19079},Q:{"10.4":0},O:{"0":0.29352},H:{"0":0.24315},L:{"0":52.07698},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JP.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JP.js
new file mode 100644
index 0000000..0fa3117
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/JP.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00618,"52":0.06175,"55":0.01853,"56":0.0247,"60":0.00618,"66":0.01235,"67":0.01235,"72":0.01235,"78":0.03705,"84":0.01235,"85":0.0247,"88":0.00618,"89":0.04323,"90":0.00618,"91":0.0494,"92":0.00618,"93":0.01235,"94":0.01235,"95":0.05558,"96":1.14238,"97":1.8525,"98":0.01235,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 57 58 59 61 62 63 64 65 68 69 70 71 73 74 75 76 77 79 80 81 82 83 86 87 99 3.5 3.6"},D:{"34":0.01853,"49":0.1235,"52":0.00618,"61":0.01235,"62":0.00618,"63":0.0247,"64":0.01235,"65":0.01235,"67":0.01235,"69":0.03088,"70":0.01235,"71":0.00618,"72":0.01853,"73":0.01235,"74":0.0247,"75":0.01853,"76":0.01235,"78":0.01235,"79":0.03705,"80":0.06175,"81":0.08645,"83":0.03088,"84":0.03088,"85":0.03088,"86":0.04323,"87":0.12968,"88":0.03088,"89":0.08645,"90":0.0494,"91":0.0741,"92":0.06175,"93":0.36433,"94":0.1482,"95":0.11115,"96":0.58045,"97":7.37295,"98":26.17583,"99":0.01853,"100":0.0247,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 53 54 55 56 57 58 59 60 66 68 77 101"},F:{"80":0.00618,"82":0.03088,"83":0.21613,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00618,"18":0.0247,"84":0.00618,"85":0.00618,"89":0.01235,"90":0.01235,"91":0.00618,"92":0.01235,"94":0.01853,"95":0.01235,"96":0.0741,"97":1.9266,"98":7.28033,_:"12 13 14 15 16 79 80 81 83 86 87 88 93"},E:{"4":0,"12":0.00618,"13":0.06175,"14":0.23465,"15":0.11115,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.01235,"10.1":0.01235,"11.1":0.03088,"12.1":0.05558,"13.1":0.20995,"14.1":0.7904,"15.1":0.33345,"15.2-15.3":0.77188,"15.4":0.00618},G:{"8":0.00243,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02673,"8.1-8.4":0.01944,"9.0-9.2":0.17252,"9.3":0.10934,"10.0-10.2":0.01701,"10.3":0.10205,"11.0-11.2":0.07532,"11.3-11.4":0.03645,"12.0-12.1":0.04617,"12.2-12.5":0.42522,"13.0-13.1":0.03159,"13.2":0.01944,"13.3":0.09719,"13.4-13.7":0.33045,"14.0-14.4":1.0351,"14.5-14.8":5.42091,"15.0-15.1":2.85989,"15.2-15.3":13.42228,"15.4":0.03159},P:{"4":0.18702,"5.0-5.4":0.01022,"6.2-6.4":0.01022,"7.2-7.4":0.21819,"8.2":0.08049,"9.2":0.03117,"10.1":0.03067,"11.1-11.2":0.13507,"12.0":0.01113,"13.0":0.02225,"14.0":0.01113,"15.0":0.03338,"16.0":0.90131},I:{"0":0,"3":0,"4":0.00491,"2.1":0,"2.2":0.03927,"2.3":0.02781,"4.1":0.01145,"4.2-4.3":0.07853,"4.4":0,"4.4.3-4.4.4":0.12107},A:{"11":1.729,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.27158},Q:{"10.4":0.03443},O:{"0":0.19125},H:{"0":0.09415},L:{"0":18.28825},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KE.js
new file mode 100644
index 0000000..06270a8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KE.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00733,"43":0.00244,"47":0.00977,"52":0.19788,"57":0.00489,"65":0.00244,"68":0.00244,"72":0.02443,"73":0.00977,"78":0.01954,"82":0.00977,"84":0.00733,"87":0.02199,"88":0.01954,"89":0.01222,"90":0.00489,"91":0.02932,"92":0.00489,"93":0.00733,"94":0.01466,"95":0.04642,"96":0.70114,"97":1.17753,"98":0.07329,_:"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 35 36 37 38 39 40 41 42 44 45 46 48 49 50 51 53 54 55 56 58 59 60 61 62 63 64 66 67 69 70 71 74 75 76 77 79 80 81 83 85 86 99 3.5 3.6"},D:{"11":0.00244,"22":0.00244,"38":0.00489,"39":0.00977,"47":0.00489,"49":0.0171,"50":0.00244,"54":0.00733,"55":0.00244,"56":0.00733,"58":0.00244,"63":0.00489,"64":0.00733,"65":0.00733,"66":0.00733,"67":0.00977,"68":0.00977,"69":0.16612,"70":0.01466,"71":0.00489,"72":0.00489,"73":0.00977,"74":0.00733,"75":0.00733,"76":0.01222,"77":0.01222,"78":0.00733,"79":0.03909,"80":0.01466,"81":0.00977,"83":0.01466,"84":0.01466,"85":0.01222,"86":0.04397,"87":0.0513,"88":0.0171,"89":0.0171,"90":0.01954,"91":0.04397,"92":0.06108,"93":0.05619,"94":0.0342,"95":0.05619,"96":0.30538,"97":4.18975,"98":9.75001,"99":0.02932,"100":0.01222,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 40 41 42 43 44 45 46 48 51 52 53 57 59 60 61 62 101"},F:{"28":0.01222,"65":0.01954,"66":0.00489,"67":0.0171,"79":0.01466,"80":0.02199,"82":0.08551,"83":0.55212,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 68 69 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00977,"13":0.00733,"14":0.00489,"15":0.00489,"16":0.00733,"17":0.01222,"18":0.03909,"84":0.00489,"85":0.00489,"89":0.00733,"90":0.00244,"91":0.00244,"92":0.02199,"93":0.00244,"94":0.00489,"95":0.00733,"96":0.03176,"97":0.32003,"98":1.05538,_:"79 80 81 83 86 87 88"},E:{"4":0,"12":0.00244,"13":0.00733,"14":0.03176,"15":0.02687,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1 10.1","5.1":0.00733,"11.1":0.00244,"12.1":0.00977,"13.1":0.04153,"14.1":0.12704,"15.1":0.0513,"15.2-15.3":0.09772,"15.4":0.01466},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00572,"5.0-5.1":0.00445,"6.0-6.1":0.00021,"7.0-7.1":0.02541,"8.1-8.4":0.00042,"9.0-9.2":0.00106,"9.3":0.02286,"10.0-10.2":0.00148,"10.3":0.02562,"11.0-11.2":0.01059,"11.3-11.4":0.00445,"12.0-12.1":0.01143,"12.2-12.5":0.14862,"13.0-13.1":0.00635,"13.2":0.00318,"13.3":0.01334,"13.4-13.7":0.05145,"14.0-14.4":0.13422,"14.5-14.8":0.41643,"15.0-15.1":0.37769,"15.2-15.3":0.84472,"15.4":0.00656},P:{"4":0.1499,"5.0-5.4":0.01022,"6.2-6.4":0.01034,"7.2-7.4":0.05354,"8.2":0.08049,"9.2":0.04136,"10.1":0.03067,"11.1-11.2":0.03212,"12.0":0.0517,"13.0":0.03212,"14.0":0.06424,"15.0":0.06424,"16.0":0.50324},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00058,"4.2-4.3":0.00407,"4.4":0,"4.4.3-4.4.4":0.02558},A:{"8":0.00513,"10":0.00513,"11":0.14365,_:"6 7 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.12093},Q:{"10.4":0},O:{"0":0.30232},H:{"0":35.96317},L:{"0":37.07781},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KG.js
new file mode 100644
index 0000000..96b0f57
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KG.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.0158,"72":0.0079,"78":0.00395,"87":0.00395,"91":0.03555,"93":0.0079,"95":0.01185,"96":0.20935,"97":0.2923,"98":0.0079,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 88 89 90 92 94 99 3.5 3.6"},D:{"42":0.00395,"49":0.0395,"57":0.00395,"59":0.05925,"60":0.00395,"63":0.00395,"66":0.0079,"67":0.0079,"71":0.0237,"72":0.01975,"74":0.0316,"77":0.01975,"78":0.0079,"79":0.03555,"80":0.0237,"81":0.00395,"83":0.01185,"84":0.00395,"85":0.01185,"86":0.0395,"87":0.02765,"88":0.04345,"89":0.0869,"90":0.01975,"91":0.01975,"92":0.0316,"93":0.01185,"94":0.1185,"95":0.03555,"96":0.56485,"97":14.60315,"98":17.80265,"100":0.00395,_:"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 40 41 43 44 45 46 47 48 50 51 52 53 54 55 56 58 61 62 64 65 68 69 70 73 75 76 99 101"},F:{"42":0.01975,"77":0.0079,"79":0.00395,"81":0.00395,"82":0.16195,"83":1.14155,_:"9 11 12 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 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00395,"18":0.0079,"96":0.00395,"97":0.1106,"98":0.38315,_:"13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95"},E:{"4":0,"13":0.00395,"14":0.16195,"15":0.02765,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1","5.1":0.4503,"12.1":0.00395,"13.1":0.0553,"14.1":0.17775,"15.1":0.079,"15.2-15.3":0.1817,"15.4":0.01185},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00054,"6.0-6.1":0,"7.0-7.1":0.00326,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0174,"10.0-10.2":0.00109,"10.3":0.01142,"11.0-11.2":0.01251,"11.3-11.4":0.00761,"12.0-12.1":0.01794,"12.2-12.5":0.27784,"13.0-13.1":0.01196,"13.2":0.00598,"13.3":0.12179,"13.4-13.7":0.09189,"14.0-14.4":0.53557,"14.5-14.8":1.11518,"15.0-15.1":1.20218,"15.2-15.3":1.98568,"15.4":0.01305},P:{"4":0.31645,"5.0-5.4":0.01021,"6.2-6.4":0.07146,"7.2-7.4":0.32666,"8.2":0.08049,"9.2":0.08166,"10.1":0.02042,"11.1-11.2":0.1327,"12.0":0.10208,"13.0":0.21437,"14.0":0.2552,"15.0":0.30624,"16.0":1.1331},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00016,"4.2-4.3":0.00033,"4.4":0,"4.4.3-4.4.4":0.00556},A:{"11":0.0237,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.03025},Q:{"10.4":0},O:{"0":0.5566},H:{"0":0.35512},L:{"0":50.3731},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KH.js
new file mode 100644
index 0000000..75c1593
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KH.js
@@ -0,0 +1 @@
+module.exports={C:{"4":0.00822,"5":0.00411,"15":0.00411,"17":0.00822,"44":0.00822,"47":0.00822,"50":0.00822,"51":0.00411,"52":0.01644,"56":0.00411,"57":0.00411,"60":0.00411,"61":0.02876,"67":0.00822,"68":0.00411,"70":0.00822,"72":0.00411,"78":0.04109,"79":0.01233,"80":0.03287,"81":0.05753,"82":0.03287,"83":0.01233,"84":0.00822,"86":0.00411,"88":0.01644,"89":0.01644,"90":0.00822,"91":0.01233,"92":0.00822,"93":0.00822,"94":0.01233,"95":0.02876,"96":0.65744,"97":1.28612,"98":0.05342,_:"2 3 6 7 8 9 10 11 12 13 14 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 45 46 48 49 53 54 55 58 59 62 63 64 65 66 69 71 73 74 75 76 77 85 87 99 3.5 3.6"},D:{"24":0.00822,"28":0.01233,"38":0.02465,"40":0.01644,"41":0.00411,"43":0.00411,"47":0.00822,"49":0.01644,"53":0.05753,"56":0.02876,"57":0.00411,"58":0.00411,"61":0.00822,"63":0.00411,"65":0.01233,"67":0.00822,"69":0.00822,"71":0.05342,"72":0.01233,"74":0.00822,"75":0.00411,"76":0.01233,"77":0.00411,"78":0.02055,"79":0.10683,"80":0.03698,"81":0.02055,"83":0.15614,"84":0.1808,"85":0.27119,"86":0.23421,"87":0.32461,"88":0.01644,"89":0.02876,"90":0.08629,"91":0.07396,"92":0.09451,"93":1.85316,"94":0.03287,"95":0.0452,"96":0.53828,"97":6.09776,"98":17.3482,"99":0.02876,"100":0.06574,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 29 30 31 32 33 34 35 36 37 39 42 44 45 46 48 50 51 52 54 55 59 60 62 64 66 68 70 73 101"},F:{"36":0.01233,"52":0.00822,"70":0.00822,"72":0.00411,"75":0.00411,"82":0.12327,"83":0.76017,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 71 73 74 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00411,"13":0.00822,"18":0.07396,"84":0.02055,"85":0.03698,"86":0.01233,"89":0.00822,"90":0.00822,"92":0.03698,"93":0.00411,"95":0.01233,"96":0.03287,"97":0.40679,"98":1.56964,_:"14 15 16 17 79 80 81 83 87 88 91 94"},E:{"4":0,"10":0.00411,"11":0.00822,"12":0.01233,"13":0.0452,"14":0.29585,"15":0.1808,_:"0 5 6 7 8 9 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00411,"11.1":0.01233,"12.1":0.03698,"13.1":0.21778,"14.1":0.95329,"15.1":0.42323,"15.2-15.3":0.80126,"15.4":0.01233},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00229,"6.0-6.1":0.00458,"7.0-7.1":0.03209,"8.1-8.4":0.04355,"9.0-9.2":0.01146,"9.3":0.08251,"10.0-10.2":0.01604,"10.3":0.11689,"11.0-11.2":0.04813,"11.3-11.4":0.09855,"12.0-12.1":0.0848,"12.2-12.5":1.56999,"13.0-13.1":0.09168,"13.2":0.0275,"13.3":0.24524,"13.4-13.7":0.63487,"14.0-14.4":2.1384,"14.5-14.8":5.42736,"15.0-15.1":3.74277,"15.2-15.3":8.40461,"15.4":0.09855},P:{"4":0.25853,"5.0-5.4":0.01077,"6.2-6.4":0.01048,"7.2-7.4":0.01077,"8.2":0.01077,"9.2":0.22272,"10.1":0.06074,"11.1-11.2":0.01077,"12.0":0.03232,"13.0":0.06463,"14.0":0.05386,"15.0":0.0754,"16.0":1.35729},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00333,"4.2-4.3":0.002,"4.4":0,"4.4.3-4.4.4":0.03001},A:{"8":0.04003,"9":0.02502,"10":0.01501,"11":0.42534,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.15906},Q:{"10.4":0.03535},O:{"0":0.78939},H:{"0":0.50753},L:{"0":31.87965},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KI.js
new file mode 100644
index 0000000..b6779b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KI.js
@@ -0,0 +1 @@
+module.exports={C:{"54":0.01027,"56":0.07447,"75":0.05136,"89":0.03082,"94":0.03082,"95":0.02054,"96":0.24139,"97":7.73995,"98":0.02054,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 76 77 78 79 80 81 82 83 84 85 86 87 88 90 91 92 93 99 3.5 3.6"},D:{"56":0.01027,"57":0.42115,"71":0.01027,"72":0.05136,"81":0.01027,"87":0.03082,"88":0.02054,"89":0.28505,"92":0.14638,"95":0.28505,"96":0.61118,"97":2.21875,"98":7.47802,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 58 59 60 61 62 63 64 65 66 67 68 69 70 73 74 75 76 77 78 79 80 83 84 85 86 90 91 93 94 99 100 101"},F:{"82":0.01027,"83":0.22085,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.04109,"15":0.01027,"16":0.08474,"18":0.2003,"80":0.0642,"84":0.0642,"87":0.01027,"89":0.03082,"90":0.04109,"92":0.01027,"95":0.0642,"96":0.10529,"97":1.48174,"98":1.20953,_:"13 14 17 79 81 83 85 86 88 91 93 94"},E:{"4":0,"13":0.03082,_:"0 5 6 7 8 9 10 11 12 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1 15.4","15.1":0.03082,"15.2-15.3":0.19003},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00689,"7.0-7.1":0.0411,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0.00689,"11.3-11.4":0.04119,"12.0-12.1":0.00689,"12.2-12.5":0.23299,"13.0-13.1":0.00689,"13.2":0.00689,"13.3":0.03429,"13.4-13.7":0.06169,"14.0-14.4":0.2398,"14.5-14.8":0.04808,"15.0-15.1":0.06169,"15.2-15.3":0.08909,"15.4":0},P:{"4":0.09071,"5.0-5.4":0.09071,"6.2-6.4":0.11087,"7.2-7.4":2.20723,"8.2":0.08049,"9.2":0.01008,"10.1":0.03067,"11.1-11.2":1.64283,"12.0":0.06047,"13.0":0.37291,"14.0":0.20157,"15.0":0.08063,"16.0":1.47149},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.03082,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":4.03558},H:{"0":0.28145},L:{"0":64.2664},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KM.js
new file mode 100644
index 0000000..cc4d0c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KM.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.04297,"78":0.00992,"84":0.00331,"91":0.03636,"94":0.00661,"96":2.68366,"97":3.24882,_:"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 40 41 42 43 44 45 46 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 88 89 90 92 93 95 98 99 3.5 3.6"},D:{"32":0.00331,"38":0.00331,"54":0.00661,"58":0.00992,"63":0.00992,"65":0.01322,"74":0.03636,"76":0.01322,"81":0.17186,"83":0.00331,"86":2.23088,"87":0.01322,"88":0.01653,"89":0.02314,"91":0.01322,"92":0.03636,"93":0.03305,"94":0.00661,"95":0.02975,"96":0.16856,"97":2.01936,"98":8.16005,_:"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 33 34 35 36 37 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 55 56 57 59 60 61 62 64 66 67 68 69 70 71 72 73 75 77 78 79 80 84 85 90 99 100 101"},F:{"43":0.02975,"67":0.00331,"79":0.00331,"82":0.00992,"83":0.36686,_:"9 11 12 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 40 41 42 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00661,"13":0.00992,"17":0.00992,"18":0.01653,"80":0.00331,"81":0.00661,"84":0.01983,"85":0.00331,"89":0.00331,"92":0.02644,"94":0.02314,"95":0.03305,"96":0.0661,"97":0.18508,"98":0.54533,_:"14 15 16 79 83 86 87 88 90 91 93"},E:{"4":0,"12":0.00331,"13":0.00661,"14":0.07271,_:"0 5 6 7 8 9 10 11 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00992,"12.1":0.05619,"13.1":0.01322,"14.1":0.08263,"15.1":0.00331,"15.2-15.3":0.01322},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.08002,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00418,"10.0-10.2":0,"10.3":0.00209,"11.0-11.2":0.06956,"11.3-11.4":0.15951,"12.0-12.1":0.01046,"12.2-12.5":1.00727,"13.0-13.1":0.03138,"13.2":0.00418,"13.3":0.01883,"13.4-13.7":0.08159,"14.0-14.4":1.51561,"14.5-14.8":0.79494,"15.0-15.1":0.64589,"15.2-15.3":0.80121,"15.4":0.00209},P:{"4":0.56464,"5.0-5.4":0.02017,"6.2-6.4":0.04033,"7.2-7.4":0.61505,"8.2":0.01049,"9.2":0.07058,"10.1":2.25855,"11.1-11.2":0.92762,"12.0":0.02017,"13.0":0.02017,"14.0":0.09075,"15.0":0.04033,"16.0":0.3529},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00217,"4.2-4.3":0.01517,"4.4":0,"4.4.3-4.4.4":0.08309},A:{"9":0.18864,"11":0.51202,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.30128},Q:{"10.4":0},O:{"0":0.29458},H:{"0":0.7099},L:{"0":66.53176},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KN.js
new file mode 100644
index 0000000..990f603
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KN.js
@@ -0,0 +1 @@
+module.exports={C:{"69":0.0085,"78":0.0085,"94":0.00425,"95":0.01276,"96":0.19559,"97":0.31465,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 98 99 3.5 3.6"},D:{"23":0.0085,"49":0.02551,"63":0.01276,"66":0.00425,"70":0.01276,"76":0.05102,"77":0.03827,"78":0.01276,"79":0.03827,"81":0.02976,"83":0.04252,"85":0.3104,"86":0.01701,"87":0.02126,"89":0.04252,"91":0.02551,"92":0.02976,"93":0.01276,"94":0.03402,"95":0.04677,"96":0.66756,"97":6.85422,"98":16.42973,"99":0.0085,"100":0.00425,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 65 67 68 69 71 72 73 74 75 80 84 88 90 101"},F:{"82":0.25512,"83":0.2126,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.0085,"15":0.00425,"17":0.00425,"18":0.02551,"85":0.18709,"89":0.00425,"90":0.08079,"95":0.08504,"96":0.02976,"97":2.0112,"98":5.97831,_:"13 14 16 79 80 81 83 84 86 87 88 91 92 93 94"},E:{"4":0,"12":0.04677,"13":0.0085,"14":0.13181,"15":0.13181,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 10.1 15.4","9.1":0.0085,"11.1":0.01276,"12.1":0.07228,"13.1":0.25512,"14.1":0.59103,"15.1":0.34866,"15.2-15.3":1.34363},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00642,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01124,"10.0-10.2":0.01124,"10.3":0.265,"11.0-11.2":0.00642,"11.3-11.4":0.00964,"12.0-12.1":0.00482,"12.2-12.5":0.94597,"13.0-13.1":0.01285,"13.2":0,"13.3":0.01767,"13.4-13.7":0.09315,"14.0-14.4":0.49788,"14.5-14.8":2.61948,"15.0-15.1":1.79236,"15.2-15.3":9.21557,"15.4":0.54445},P:{"4":0.25173,"5.0-5.4":0.01121,"6.2-6.4":0.01012,"7.2-7.4":0.15733,"8.2":0.03083,"9.2":0.07359,"10.1":0.03037,"11.1-11.2":0.14684,"12.0":0.05244,"13.0":0.02098,"14.0":0.03147,"15.0":0.0944,"16.0":3.734},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00366,"4.2-4.3":0.00274,"4.4":0,"4.4.3-4.4.4":0.03383},A:{"11":0.17858,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.52307},Q:{"10.4":0},O:{"0":0.0115},H:{"0":2.04069},L:{"0":36.60142},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KP.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KP.js
new file mode 100644
index 0000000..3810de0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KP.js
@@ -0,0 +1 @@
+module.exports={C:{"97":0.01755,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 98 99 3.5 3.6"},D:{"78":0.00878,"83":0.00878,"86":0.00878,"92":0.05265,"96":0.2184,"97":0.07898,"98":0.4719,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 84 85 87 88 89 90 91 93 94 95 99 100 101"},F:{"56":0.0351,"83":0.12285,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"92":0.49823,"97":0.0351,"98":0.11408,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95 96"},E:{"4":0,"9":0.01755,_:"0 5 6 7 8 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1","15.1":0.92723,"15.2-15.3":3.27893,"15.4":0.19208},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01804,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.01804,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":22.95271,"15.2-15.3":66.8191,"15.4":0.406},P:{"4":0.09071,"5.0-5.4":0.09071,"6.2-6.4":0.11087,"7.2-7.4":2.20723,"8.2":0.08049,"9.2":0.02708,"10.1":0.03067,"11.1-11.2":1.64283,"12.0":0.06047,"13.0":0.37291,"14.0":0.20157,"15.0":0.08063,"16.0":1.47149},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{_:"6 7 8 9 10 11 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0},H:{"0":0},L:{"0":0.56843},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KR.js
new file mode 100644
index 0000000..96800a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KR.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01419,"78":0.01892,"80":0.00473,"91":0.05202,"95":0.00946,"96":0.25537,"97":0.53911,"98":0.01419,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 81 82 83 84 85 86 87 88 89 90 92 93 94 99 3.5 3.6"},D:{"42":0.0331,"49":0.02365,"56":0.00473,"64":0.02837,"67":0.00473,"68":0.00946,"69":0.00473,"70":0.0331,"72":0.0331,"77":0.18443,"78":0.00473,"79":0.07094,"80":0.05202,"81":0.02837,"83":0.0331,"84":0.04256,"85":0.04729,"86":0.06621,"87":0.06621,"88":0.00473,"89":0.04729,"90":0.08512,"91":0.03783,"92":0.04256,"93":0.5864,"94":0.04256,"95":0.03783,"96":0.30266,"97":8.50747,"98":21.94256,"99":0.01419,"100":0.00946,_:"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 40 41 43 44 45 46 47 48 50 51 52 53 54 55 57 58 59 60 61 62 63 65 66 71 73 74 75 76 101"},F:{"82":0.01892,"83":0.21281,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00473,"17":0.00946,"18":0.02365,"84":0.00473,"85":0.00473,"86":0.02837,"87":0.00473,"89":0.00946,"90":0.00946,"91":0.01419,"92":0.01892,"93":0.00473,"94":0.01419,"95":0.02365,"96":0.07094,"97":1.43762,"98":5.77411,_:"12 13 15 16 79 80 81 83 88"},E:{"4":0,"8":0.00473,"13":0.00946,"14":0.06148,"15":0.05675,_:"0 5 6 7 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1","12.1":0.00946,"13.1":0.05675,"14.1":0.18916,"15.1":0.14187,"15.2-15.3":0.36413,"15.4":0.01419},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00243,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.14835,"9.3":0.01216,"10.0-10.2":0,"10.3":0.00973,"11.0-11.2":0.00973,"11.3-11.4":0.00608,"12.0-12.1":0.01094,"12.2-12.5":0.08633,"13.0-13.1":0.15443,"13.2":0.00365,"13.3":0.02675,"13.4-13.7":0.07904,"14.0-14.4":0.39884,"14.5-14.8":1.8641,"15.0-15.1":2.28118,"15.2-15.3":7.0089,"15.4":0.05229},P:{_:"4 5.0-5.4 6.2-6.4 7.2-7.4 8.2 10.1","9.2":0.02028,"11.1-11.2":0.07099,"12.0":0.08113,"13.0":0.20282,"14.0":0.30423,"15.0":0.38536,"16.0":12.40259},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.05798},A:{"8":0.00971,"9":0.00971,"11":0.89328,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.13705},Q:{"10.4":0.01054},O:{"0":0.10542},H:{"0":0.1547},L:{"0":20.0349},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KW.js
new file mode 100644
index 0000000..17e4b15
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KW.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00878,"52":0.12298,"78":0.05856,"84":0.06149,"88":0.01464,"91":0.05563,"95":0.01464,"96":0.24888,"97":0.36307,"98":0.00586,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 89 90 92 93 94 99 3.5 3.6"},D:{"38":0.0527,"43":0.00586,"47":0.01757,"49":0.0205,"56":0.01171,"63":0.00586,"64":0.00878,"65":0.00293,"66":0.00293,"67":0.02342,"69":0.00586,"70":0.00586,"71":0.00878,"73":0.00586,"74":0.00586,"75":0.00586,"76":0.01464,"78":0.01464,"79":0.03221,"80":0.00878,"81":0.00586,"83":0.00878,"84":0.00586,"85":0.01171,"86":0.0205,"87":0.19032,"88":0.01171,"89":0.0205,"90":0.02635,"91":0.04685,"92":0.11126,"93":0.02635,"94":0.02635,"95":0.06442,"96":0.42749,"97":5.6569,"98":12.67531,"99":0.00293,"100":0.01464,_:"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 39 40 41 42 44 45 46 48 50 51 52 53 54 55 57 58 59 60 61 62 68 72 77 101"},F:{"28":0.01757,"46":0.01757,"82":0.25474,"83":0.68222,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00293,"16":0.00293,"17":0.00586,"18":0.01464,"84":0.00586,"85":0.00293,"89":0.00586,"90":0.00586,"92":0.01464,"93":0.00293,"94":0.00586,"95":0.03806,"96":0.07613,"97":0.67637,"98":2.09059,_:"12 13 14 79 80 81 83 86 87 88 91"},E:{"4":0,"13":0.0732,"14":0.35136,"15":0.20203,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.02635,"12.1":0.04099,"13.1":0.15811,"14.1":1.06286,"15.1":0.34843,"15.2-15.3":0.68808,"15.4":0.00878},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00336,"6.0-6.1":0,"7.0-7.1":0.01678,"8.1-8.4":0,"9.0-9.2":0.01678,"9.3":0.14765,"10.0-10.2":0.01342,"10.3":0.08389,"11.0-11.2":0.04027,"11.3-11.4":0.05033,"12.0-12.1":0.08054,"12.2-12.5":0.91944,"13.0-13.1":0.10738,"13.2":0.07382,"13.3":0.28858,"13.4-13.7":0.60737,"14.0-14.4":2.96973,"14.5-14.8":8.09713,"15.0-15.1":6.32536,"15.2-15.3":13.61043,"15.4":0.09731},P:{"4":0.16429,"5.0-5.4":0.09071,"6.2-6.4":0.11087,"7.2-7.4":0.08214,"8.2":0.08049,"9.2":0.04107,"10.1":0.02054,"11.1-11.2":0.12322,"12.0":0.05134,"13.0":0.15402,"14.0":0.24643,"15.0":0.30804,"16.0":3.0804},I:{"0":0,"3":0,"4":0.00381,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00508,"4.2-4.3":0.00127,"4.4":0,"4.4.3-4.4.4":0.03935},A:{"11":0.13762,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.10608},Q:{"10.4":0.0495},O:{"0":1.74678},H:{"0":0.83691},L:{"0":30.27026},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KY.js
new file mode 100644
index 0000000..6f94b76
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KY.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01037,"53":0.01037,"78":0.01037,"91":0.02593,"95":0.0726,"96":0.46155,"97":1.13055,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 92 93 94 98 99 3.5 3.6"},D:{"26":0.00519,"49":0.01037,"63":0.04667,"66":0.00519,"67":0.01037,"75":0.01037,"76":0.02593,"79":0.04149,"80":0.01037,"83":0.02593,"84":0.02593,"85":0.05705,"87":0.03112,"88":0.01037,"89":0.01556,"90":0.01037,"91":0.09335,"92":0.08816,"93":0.01556,"94":0.08298,"95":0.04149,"96":0.47711,"97":9.68226,"98":19.05336,"99":0.11928,"100":0.05186,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 65 68 69 70 71 72 73 74 77 78 81 86 101"},F:{"82":0.67937,"83":0.63788,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.01037,"18":0.08816,"89":0.01556,"95":0.01037,"96":0.02593,"97":2.24554,"98":5.79795,_:"12 13 14 15 17 79 80 81 83 84 85 86 87 88 90 91 92 93 94"},E:{"4":0,"12":0.01037,"13":0.16595,"14":0.15039,"15":0.47193,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.01556,"11.1":0.01037,"12.1":0.05186,"13.1":1.05794,"14.1":2.42705,"15.1":0.84013,"15.2-15.3":2.63967,"15.4":0.01037},G:{"8":0.00762,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04571,"10.0-10.2":0,"10.3":0.17521,"11.0-11.2":0,"11.3-11.4":0.20822,"12.0-12.1":0.01777,"12.2-12.5":0.35549,"13.0-13.1":0.16759,"13.2":0.0127,"13.3":0.03809,"13.4-13.7":0.22599,"14.0-14.4":0.32756,"14.5-14.8":3.73772,"15.0-15.1":5.8021,"15.2-15.3":14.20434,"15.4":0.05332},P:{"4":0.0734,"5.0-5.4":0.02063,"6.2-6.4":0.01048,"7.2-7.4":0.05243,"8.2":0.01049,"9.2":0.03095,"10.1":0.02185,"11.1-11.2":0.08389,"12.0":0.01049,"13.0":0.20973,"14.0":0.04195,"15.0":0.02097,"16.0":3.55486},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00172,"4.2-4.3":0.00069,"4.4":0,"4.4.3-4.4.4":0.00241},A:{"11":0.14002,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.08665},Q:{"10.4":0},O:{"0":0.0674},H:{"0":0.02279},L:{"0":18.01079},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KZ.js
new file mode 100644
index 0000000..8e87d05
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/KZ.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00384,"51":0.00384,"52":0.28823,"55":0.03459,"57":0.02306,"75":0.00384,"78":0.02306,"80":0.00384,"81":0.00384,"82":0.00769,"88":0.00769,"89":0.02306,"91":0.03074,"93":0.00384,"94":0.00769,"95":0.03074,"96":0.44579,"97":0.82625,"98":0.01537,_:"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 40 41 42 43 44 45 46 47 49 50 53 54 56 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 76 77 79 83 84 85 86 87 90 92 99 3.5 3.6"},D:{"22":0.00769,"40":0.00384,"49":0.04996,"57":0.00384,"60":0.00384,"61":0.00769,"63":0.01153,"64":0.00769,"65":0.01537,"66":0.00769,"67":0.00769,"68":0.01153,"69":0.00769,"70":0.00769,"71":0.03459,"72":0.01537,"73":0.01537,"74":0.04227,"75":0.00384,"76":0.01153,"77":0.00384,"78":0.00769,"79":0.69943,"80":0.05765,"81":0.01537,"83":0.03074,"84":0.06149,"85":0.02306,"86":0.14603,"87":0.06533,"88":0.04612,"89":0.0269,"90":0.0269,"91":0.09223,"92":0.05765,"93":0.4112,"94":0.0538,"95":0.06917,"96":0.60335,"97":6.79827,"98":14.69948,"99":0.00769,"100":0.0269,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 58 59 62 101"},F:{"46":0.00769,"68":0.00384,"74":0.01153,"77":0.00769,"78":0.00384,"79":0.01537,"81":0.01153,"82":0.50728,"83":2.11365,_:"9 11 12 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 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 71 72 73 75 76 80 9.5-9.6 10.5 10.6 11.1 11.5","10.0-10.1":0,"11.6":0.37661,"12.1":0.00769},B:{"16":0.00384,"18":0.01537,"83":0.00384,"84":0.00769,"85":0.00384,"86":0.00384,"88":0.00384,"89":0.01153,"90":0.00769,"91":0.00769,"92":0.00769,"93":0.00384,"94":0.00384,"95":0.00769,"96":0.01922,"97":0.34971,"98":1.37579,_:"12 13 14 15 17 79 80 81 87"},E:{"4":0,"13":0.01922,"14":0.12298,"15":0.07686,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1","5.1":0.23827,"12.1":0.01153,"13.1":0.0807,"14.1":0.39583,"15.1":0.19984,"15.2-15.3":0.27285,"15.4":0.0269},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00254,"8.1-8.4":0.0038,"9.0-9.2":0.00127,"9.3":0.01648,"10.0-10.2":0.01014,"10.3":0.02282,"11.0-11.2":0.01648,"11.3-11.4":0.02029,"12.0-12.1":0.03043,"12.2-12.5":0.60859,"13.0-13.1":0.03677,"13.2":0.02409,"13.3":0.12425,"13.4-13.7":0.3119,"14.0-14.4":1.15506,"14.5-14.8":2.96182,"15.0-15.1":2.75388,"15.2-15.3":4.54669,"15.4":0.02789},P:{"4":0.08272,"5.0-5.4":0.01022,"6.2-6.4":0.01034,"7.2-7.4":0.21713,"8.2":0.08049,"9.2":0.04136,"10.1":0.03067,"11.1-11.2":0.14475,"12.0":0.0517,"13.0":0.15509,"14.0":0.22747,"15.0":0.16543,"16.0":1.84043},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00112,"4.2-4.3":0.00336,"4.4":0,"4.4.3-4.4.4":0.01399},A:{"9":0.00392,"11":0.18054,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01591,_:"11"},R:{_:"0"},M:{"0":0.08618},Q:{"10.4":0.00616},O:{"0":0.31396},H:{"0":0.22147},L:{"0":39.32082},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LA.js
new file mode 100644
index 0000000..3364e8f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LA.js
@@ -0,0 +1 @@
+module.exports={C:{"43":0.00583,"44":0.00291,"48":0.00291,"52":0.04371,"66":0.00291,"69":0.00291,"71":0.20107,"72":0.00583,"78":0.03205,"81":0.00874,"84":0.01166,"91":0.01748,"92":0.00291,"93":0.00291,"94":0.05828,"95":0.02914,"96":0.56823,"97":1.57356,"98":0.04371,_:"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 40 41 42 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 67 68 70 73 74 75 76 77 79 80 82 83 85 86 87 88 89 90 99 3.5 3.6"},D:{"26":0.00291,"33":0.00583,"37":0.00874,"43":0.03788,"47":0.00291,"49":0.02331,"53":0.00291,"56":0.01166,"58":0.00291,"63":0.03497,"65":0.01166,"66":0.00291,"68":0.00291,"69":0.0204,"70":0.00874,"71":0.00583,"72":0.00874,"73":0.00583,"74":0.01166,"75":0.01457,"76":0.00874,"77":0.00291,"78":0.03788,"79":0.02331,"80":0.04662,"81":0.01748,"83":0.02623,"84":0.00874,"85":0.00583,"86":0.05245,"87":0.05245,"88":0.02331,"89":0.01457,"90":0.02331,"91":0.02914,"92":0.10782,"93":0.02331,"94":0.04371,"95":0.0408,"96":0.46624,"97":5.44918,"98":13.20916,"99":0.01748,"100":0.01457,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 34 35 36 38 39 40 41 42 44 45 46 48 50 51 52 54 55 57 59 60 61 62 64 67 101"},F:{"82":0.02331,"83":0.3963,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00291,"13":0.03205,"14":0.00583,"15":0.00583,"16":0.01457,"17":0.01166,"18":0.02914,"84":0.00583,"85":0.00291,"86":0.00583,"89":0.01166,"91":0.01166,"92":0.01748,"94":0.00583,"95":0.00874,"96":0.0204,"97":0.50995,"98":1.88244,_:"79 80 81 83 87 88 90 93"},E:{"4":0,"12":0.03788,"13":0.01166,"14":0.11656,"15":0.0408,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 15.4","9.1":0.00583,"10.1":0.03788,"11.1":0.00874,"12.1":0.04371,"13.1":0.09033,"14.1":0.20981,"15.1":0.11656,"15.2-15.3":0.23603},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00491,"7.0-7.1":0.00491,"8.1-8.4":0,"9.0-9.2":0.00123,"9.3":0.0785,"10.0-10.2":0.01717,"10.3":0.06624,"11.0-11.2":0.06869,"11.3-11.4":0.10058,"12.0-12.1":0.06256,"12.2-12.5":1.52468,"13.0-13.1":0.05152,"13.2":0.01104,"13.3":0.14474,"13.4-13.7":0.52008,"14.0-14.4":1.29408,"14.5-14.8":2.99784,"15.0-15.1":1.96013,"15.2-15.3":3.32412,"15.4":0.02576},P:{"4":0.39876,"5.0-5.4":0.03067,"6.2-6.4":0.03067,"7.2-7.4":0.23517,"8.2":0.01022,"9.2":0.07157,"10.1":0.02045,"11.1-11.2":0.17382,"12.0":0.11247,"13.0":0.15337,"14.0":0.38854,"15.0":0.28629,"16.0":1.85066},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00394,"4.2-4.3":0.00262,"4.4":0,"4.4.3-4.4.4":0.02887},A:{"10":0.01153,"11":0.25947,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.20549},Q:{"10.4":0.12755},O:{"0":1.60144},H:{"0":0.30189},L:{"0":50.6704},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LB.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LB.js
new file mode 100644
index 0000000..eefe483
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LB.js
@@ -0,0 +1 @@
+module.exports={C:{"2":0.00325,"43":0.00325,"47":0.00325,"48":0.00325,"52":0.04868,"58":0.00649,"67":0.00325,"72":0.00974,"78":0.02596,"79":0.00325,"84":0.00325,"88":0.00649,"89":0.00325,"91":0.03245,"94":0.01947,"95":0.01623,"96":0.76258,"97":0.98973,"98":0.01623,_:"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 40 41 42 44 45 46 49 50 51 53 54 55 56 57 59 60 61 62 63 64 65 66 68 69 70 71 73 74 75 76 77 80 81 82 83 85 86 87 90 92 93 99 3.5","3.6":0.00649},D:{"4":0.01298,"5":0.00325,"6":0.00325,"11":0.00325,"34":0.00325,"38":0.00649,"43":0.00325,"49":0.06166,"55":0.00325,"58":0.00325,"60":0.00649,"63":0.00325,"65":0.01623,"66":0.00325,"67":0.00974,"68":0.00649,"69":0.00649,"70":0.00649,"72":0.00649,"73":0.00974,"74":0.00649,"75":0.00649,"76":0.00325,"77":0.00649,"78":0.00649,"79":0.04219,"80":0.02596,"81":0.02272,"83":0.01947,"84":0.01623,"85":0.04543,"86":0.02596,"87":0.04868,"88":0.01947,"89":0.01947,"90":0.02596,"91":0.08762,"92":0.05517,"93":0.01623,"94":0.03245,"95":0.06166,"96":0.45106,"97":6.02272,"98":14.39807,"99":0.00974,"100":0.01623,_:"7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 44 45 46 47 48 50 51 52 53 54 56 57 59 61 62 64 71 101"},F:{"9":0.00325,"69":0.00974,"79":0.00649,"82":0.13629,"83":0.52245,_:"11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 70 71 72 73 74 75 76 77 78 80 81 10.5 10.6 11.1 11.5 11.6 12.1","9.5-9.6":0.00649,"10.0-10.1":0},B:{"12":0.00649,"13":0.00649,"14":0.00649,"15":0.00974,"16":0.00325,"17":0.00974,"18":0.04219,"84":0.00325,"89":0.00649,"90":0.00974,"92":0.01623,"94":0.00649,"95":0.00974,"96":0.02921,"97":0.62304,"98":2.35263,_:"79 80 81 83 85 86 87 88 91 93"},E:{"4":0.00649,"5":0.00649,"10":0.00325,"11":0.00325,"12":0.00649,"13":0.03894,"14":0.21093,"15":0.1006,_:"0 6 7 8 9 3.2 6.1 7.1","3.1":0.00649,"5.1":0.00974,"9.1":0.00325,"10.1":0.00974,"11.1":0.0357,"12.1":0.08762,"13.1":0.17523,"14.1":0.66198,"15.1":0.25311,"15.2-15.3":0.45755,"15.4":0.00649},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.03905,"6.0-6.1":0.00434,"7.0-7.1":0.03761,"8.1-8.4":0.00434,"9.0-9.2":0.00289,"9.3":0.07088,"10.0-10.2":0.01013,"10.3":0.07955,"11.0-11.2":0.02604,"11.3-11.4":0.06654,"12.0-12.1":0.05496,"12.2-12.5":0.94163,"13.0-13.1":0.02025,"13.2":0.00723,"13.3":0.06075,"13.4-13.7":0.23577,"14.0-14.4":0.86497,"14.5-14.8":2.84514,"15.0-15.1":2.43869,"15.2-15.3":6.60877,"15.4":0.03616},P:{"4":0.18507,"5.0-5.4":0.03067,"6.2-6.4":0.03067,"7.2-7.4":0.2776,"8.2":0.01022,"9.2":0.05141,"10.1":0.01028,"11.1-11.2":0.19535,"12.0":0.07197,"13.0":0.24675,"14.0":0.28788,"15.0":0.23647,"16.0":4.26679},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00162,"4.2-4.3":0.00648,"4.4":0,"4.4.3-4.4.4":0.05269},A:{"6":0.00649,"7":0.00649,"8":0.00974,"9":0.00649,"11":0.21742,_:"10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.10808},Q:{"10.4":0},O:{"0":0.16888},H:{"0":0.23023},L:{"0":44.43901},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LC.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LC.js
new file mode 100644
index 0000000..42322a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LC.js
@@ -0,0 +1 @@
+module.exports={C:{"56":0.00788,"87":0.24816,"89":0.00394,"91":0.00788,"95":0.05515,"96":0.4136,"97":0.59873,"98":0.03939,"99":0.05515,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 88 90 92 93 94 3.5 3.6"},D:{"34":0.01576,"49":0.01182,"51":0.00394,"63":0.00394,"69":0.06302,"71":0.00394,"75":0.01182,"76":0.33482,"77":0.0197,"78":0.01182,"79":0.19695,"80":0.01576,"81":0.11423,"83":0.01576,"84":0.02363,"85":0.01182,"86":0.02757,"87":0.00394,"88":0.03939,"89":0.0197,"90":0.01182,"91":0.03545,"92":0.02757,"93":0.1615,"94":0.15362,"95":0.07878,"96":0.59873,"97":7.05081,"98":15.15727,"99":0.08272,"100":0.03151,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 52 53 54 55 56 57 58 59 60 61 62 64 65 66 67 68 70 72 73 74 101"},F:{"28":0.02757,"82":0.06696,"83":0.74447,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.00394,"14":0.00788,"16":0.00788,"17":0.0197,"18":0.14968,"87":0.00394,"89":0.00394,"92":0.01576,"95":0.02363,"96":0.03151,"97":1.25654,"98":4.28563,_:"12 15 79 80 81 83 84 85 86 88 90 91 93 94"},E:{"4":0,"13":0.01182,"14":0.11817,"15":0.08272,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 15.4","5.1":0.00394,"10.1":0.02363,"11.1":0.00394,"12.1":0.0197,"13.1":0.18907,"14.1":0.62236,"15.1":0.19695,"15.2-15.3":0.90203},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00354,"6.0-6.1":0,"7.0-7.1":0.00236,"8.1-8.4":0,"9.0-9.2":0.0059,"9.3":0.15332,"10.0-10.2":0,"10.3":0.02713,"11.0-11.2":0.00472,"11.3-11.4":0.03184,"12.0-12.1":0.01415,"12.2-12.5":0.51304,"13.0-13.1":0.00118,"13.2":0.00354,"13.3":0.02948,"13.4-13.7":0.18752,"14.0-14.4":0.68287,"14.5-14.8":1.50727,"15.0-15.1":1.96251,"15.2-15.3":6.63527,"15.4":0.02713},P:{"4":0.16724,"5.0-5.4":0.01121,"6.2-6.4":0.01012,"7.2-7.4":0.68986,"8.2":0.03083,"9.2":0.03136,"10.1":0.03037,"11.1-11.2":0.20905,"12.0":0.0209,"13.0":0.14633,"14.0":0.20905,"15.0":0.36584,"16.0":5.94746},I:{"0":0,"3":0,"4":0.00155,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00052,"4.4":0,"4.4.3-4.4.4":0.04035},A:{"11":0.07484,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.2424},Q:{"10.4":0},O:{"0":0.24846},H:{"0":0.23523},L:{"0":41.07256},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LI.js
new file mode 100644
index 0000000..8424519
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LI.js
@@ -0,0 +1 @@
+module.exports={C:{"54":0.17758,"77":0.41857,"78":0.06976,"89":0.01903,"91":0.06976,"93":0.00634,"94":0.11416,"95":0.09513,"96":2.35288,"97":4.49648,"98":0.01903,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 79 80 81 82 83 84 85 86 87 88 90 92 99 3.5 3.6"},D:{"49":0.83714,"56":0.01903,"65":0.00634,"72":0.18392,"73":0.06342,"79":0.1205,"81":0.01903,"83":0.00634,"84":0.05708,"87":0.00634,"89":0.06342,"90":0.02537,"91":0.10147,"92":0.11416,"93":0.22831,"94":0.05708,"95":0.02537,"96":0.69762,"97":8.82806,"98":20.62418,"99":0.01903,"100":0.13318,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 57 58 59 60 61 62 63 64 66 67 68 69 70 71 74 75 76 77 78 80 85 86 88 101"},F:{"81":0.04439,"82":0.38052,"83":1.54745,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.10147,"83":0.00634,"90":0.00634,"92":0.40589,"93":0.04439,"94":0.01268,"95":0.13318,"96":0.06342,"97":2.16262,"98":8.33339,_:"12 14 15 16 17 18 79 80 81 84 85 86 87 88 89 91"},E:{"4":0,"13":0.03171,"14":0.53907,"15":0.16489,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.27271,"12.1":0.03171,"13.1":1.14156,"14.1":1.3889,"15.1":0.93227,"15.2-15.3":2.6573,"15.4":0.01268},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02527,"10.0-10.2":0,"10.3":0.01608,"11.0-11.2":0.05743,"11.3-11.4":0.0023,"12.0-12.1":0.01149,"12.2-12.5":0.23892,"13.0-13.1":0.00689,"13.2":0,"13.3":0.06662,"13.4-13.7":0.07351,"14.0-14.4":0.86379,"14.5-14.8":4.51193,"15.0-15.1":3.27368,"15.2-15.3":13.6185,"15.4":0.20216},P:{"4":0.03167,"5.0-5.4":0.89089,"6.2-6.4":0.05053,"7.2-7.4":0.56594,"8.2":0.01022,"9.2":0.11117,"10.1":0.05053,"11.1-11.2":0.27286,"12.0":0.09095,"13.0":0.12667,"14.0":0.03167,"15.0":0.32339,"16.0":2.3962},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00216,"4.4":0,"4.4.3-4.4.4":0.04174},A:{"11":0.241,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.25606},Q:{"10.4":0},O:{"0":0},H:{"0":0.52986},L:{"0":10.09171},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LK.js
new file mode 100644
index 0000000..64df55c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LK.js
@@ -0,0 +1 @@
+module.exports={C:{"41":0.0038,"52":0.02663,"56":0.0038,"78":0.00761,"88":0.00761,"89":0.01141,"90":0.0038,"91":0.0989,"92":0.00761,"93":0.06847,"94":0.01141,"95":0.02282,"96":0.61625,"97":0.97763,"98":0.04945,_:"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 40 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 99 3.5 3.6"},D:{"22":0.0038,"38":0.00761,"49":0.01522,"63":0.01141,"65":0.01141,"67":0.00761,"68":0.00761,"70":0.00761,"71":0.0038,"74":0.01141,"75":0.00761,"76":0.0038,"77":0.00761,"78":0.00761,"79":0.02282,"80":0.01522,"81":0.04945,"83":0.02282,"84":0.01141,"85":0.01902,"86":0.03043,"87":0.04184,"88":0.01902,"89":0.01902,"90":0.02663,"91":0.03424,"92":0.05326,"93":0.07228,"94":0.03804,"95":0.04565,"96":0.34997,"97":6.4706,"98":16.02245,"99":0.01902,"100":0.00761,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 66 69 72 73 101"},F:{"72":0.0038,"79":0.00761,"80":0.01141,"82":0.11412,"83":1.01947,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00761,"13":0.0038,"14":0.0038,"15":0.0038,"16":0.00761,"17":0.0038,"18":0.03043,"84":0.01141,"85":0.0038,"88":0.0038,"89":0.00761,"90":0.0038,"91":0.00761,"92":0.01902,"93":0.0038,"94":0.00761,"95":0.01522,"96":0.05706,"97":2.1873,"98":7.33031,_:"79 80 81 83 86 87"},E:{"4":0,"13":0.03043,"14":0.04945,"15":0.03804,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.0038,"11.1":0.0038,"12.1":0.01141,"13.1":0.03804,"14.1":0.14836,"15.1":0.07608,"15.2-15.3":0.13694},G:{"8":0.00053,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00053,"5.0-5.1":0,"6.0-6.1":0.00212,"7.0-7.1":0.00582,"8.1-8.4":0.00371,"9.0-9.2":0.00265,"9.3":0.036,"10.0-10.2":0.00794,"10.3":0.03811,"11.0-11.2":0.03282,"11.3-11.4":0.02858,"12.0-12.1":0.02964,"12.2-12.5":0.47853,"13.0-13.1":0.02806,"13.2":0.01535,"13.3":0.07093,"13.4-13.7":0.17045,"14.0-14.4":0.55688,"14.5-14.8":0.90466,"15.0-15.1":0.96289,"15.2-15.3":1.90354,"15.4":0.01165},P:{"4":0.64575,"5.0-5.4":0.05095,"6.2-6.4":0.03075,"7.2-7.4":0.9635,"8.2":0.01009,"9.2":0.082,"10.1":0.03075,"11.1-11.2":0.31775,"12.0":0.07175,"13.0":0.25625,"14.0":0.369,"15.0":0.287,"16.0":1.36325},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00123,"4.2-4.3":0.00339,"4.4":0,"4.4.3-4.4.4":0.04495},A:{"11":0.03424,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.13631},Q:{"10.4":0},O:{"0":1.73488},H:{"0":1.59554},L:{"0":49.28983},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LR.js
new file mode 100644
index 0000000..9358bb6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LR.js
@@ -0,0 +1 @@
+module.exports={C:{"24":0.00888,"31":0.00222,"43":0.00222,"47":0.00888,"49":0.00222,"51":0.04886,"60":0.00444,"66":0.00444,"68":0.00888,"72":0.00666,"78":0.00666,"88":0.00444,"91":0.01333,"94":0.02221,"95":0.01999,"96":0.45975,"97":0.55081,"98":0.02443,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 30 32 33 34 35 36 37 38 39 40 41 42 44 45 46 48 50 52 53 54 55 56 57 58 59 61 62 63 64 65 67 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 89 90 92 93 99 3.5 3.6"},D:{"11":0.01333,"30":0.00888,"33":0.00444,"38":0.00222,"39":0.00444,"43":0.00444,"45":0.00222,"47":0.00222,"49":0.00444,"51":0.00888,"52":0.00444,"57":0.00666,"58":0.00444,"60":0.00444,"61":0.02443,"63":0.00666,"64":0.03332,"67":0.00444,"68":0.00444,"69":0.00888,"71":0.00888,"72":0.00666,"73":0.00222,"74":0.03109,"75":0.02221,"76":0.03332,"77":0.01333,"78":0.02443,"79":0.01777,"80":0.01333,"81":0.01999,"85":0.01777,"86":0.01777,"87":0.06441,"88":0.02221,"89":0.01333,"90":0.02887,"91":0.01999,"92":0.05775,"93":0.01555,"94":0.03554,"95":0.02221,"96":0.21544,"97":3.16048,"98":5.33484,"99":0.00222,"100":0.00666,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 34 35 36 37 40 41 42 44 46 48 50 53 54 55 56 59 62 65 66 70 83 84 101"},F:{"18":0.00222,"46":0.00444,"63":0.00444,"68":0.00888,"72":0.01111,"79":0.01777,"82":0.02665,"83":0.39756,_:"9 11 12 15 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 64 65 66 67 69 70 71 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.09995,"13":0.03109,"14":0.02665,"15":0.03554,"16":0.0422,"17":0.01333,"18":0.15103,"80":0.00444,"83":0.00666,"84":0.01111,"85":0.01333,"88":0.00666,"89":0.03776,"90":0.01555,"91":0.01777,"92":0.04664,"93":0.01333,"94":0.05553,"95":0.01777,"96":0.07551,"97":0.63965,"98":1.53693,_:"79 81 86 87"},E:{"4":0,"10":0.00222,"13":0.01333,"14":0.03109,"15":0.03998,_:"0 5 6 7 8 9 11 12 3.1 3.2 5.1 6.1 7.1 10.1 15.4","9.1":0.00666,"11.1":0.00666,"12.1":0.00888,"13.1":0.01111,"14.1":0.08218,"15.1":0.02221,"15.2-15.3":0.02221},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00742,"6.0-6.1":0,"7.0-7.1":0.00834,"8.1-8.4":0,"9.0-9.2":0.00185,"9.3":0.13534,"10.0-10.2":0.01205,"10.3":0.02595,"11.0-11.2":0.03893,"11.3-11.4":0.01576,"12.0-12.1":0.08713,"12.2-12.5":1.01779,"13.0-13.1":0.05098,"13.2":0.02225,"13.3":0.33463,"13.4-13.7":0.2957,"14.0-14.4":1.6991,"14.5-14.8":2.81608,"15.0-15.1":1.05858,"15.2-15.3":1.63792,"15.4":0.00556},P:{"4":0.08287,"5.0-5.4":0.89089,"6.2-6.4":0.01036,"7.2-7.4":0.14503,"8.2":0.01022,"9.2":0.0518,"10.1":0.02072,"11.1-11.2":0.10359,"12.0":0.05073,"13.0":0.04144,"14.0":0.07251,"15.0":0.09323,"16.0":0.82874},I:{"0":0,"3":0,"4":0.00255,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00102,"4.4":0,"4.4.3-4.4.4":0.02754},A:{"8":0.00222,"11":0.14214,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.14778},Q:{"10.4":0},O:{"0":1.29893},H:{"0":6.75252},L:{"0":64.39758},S:{"2.5":0.24112}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LS.js
new file mode 100644
index 0000000..119e5fa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LS.js
@@ -0,0 +1 @@
+module.exports={C:{"29":0.01582,"45":0.01582,"52":0.01266,"56":0.00316,"85":0.00633,"88":0.03797,"90":0.02215,"91":0.01266,"93":0.00316,"95":0.03797,"96":0.43347,"97":0.62014,"98":0.01898,_:"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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 86 87 89 92 94 99 3.5 3.6"},D:{"34":0.00316,"43":0.00633,"49":0.06012,"56":0.00633,"58":0.00949,"63":0.01582,"69":0.00633,"70":0.03797,"71":0.01898,"72":0.00316,"74":0.06961,"75":0.03797,"78":0.00633,"79":0.04113,"80":0.02215,"81":0.04746,"83":0.00949,"85":0.00949,"86":0.09176,"87":0.2373,"88":0.02215,"89":0.01898,"90":0.03164,"91":0.07277,"92":0.04746,"93":0.03164,"94":0.05379,"95":0.02848,"96":0.3512,"97":4.04043,"98":8.51749,"99":0.00949,"100":0.01898,_:"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 35 36 37 38 39 40 41 42 44 45 46 47 48 50 51 52 53 54 55 57 59 60 61 62 64 65 66 67 68 73 76 77 84 101"},F:{"79":0.01582,"82":0.06328,"83":0.63913,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05695,"13":0.01582,"14":0.00949,"15":0.02848,"16":0.06012,"17":0.02531,"18":0.1139,"80":0.00316,"84":0.01898,"85":0.01898,"89":0.0443,"90":0.00633,"91":0.00633,"92":0.03164,"93":0.02215,"94":0.01582,"95":0.0348,"96":0.07277,"97":0.91756,"98":3.00896,_:"79 81 83 86 87 88"},E:{"4":0,"6":0.00316,"14":0.01582,"15":0.02531,_:"0 5 7 8 9 10 11 12 13 3.1 3.2 6.1 7.1 9.1 10.1 11.1 12.1 15.4","5.1":0.00316,"13.1":0.02531,"14.1":0.04113,"15.1":0.06012,"15.2-15.3":0.08226},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.0025,"5.0-5.1":0,"6.0-6.1":0.0025,"7.0-7.1":0.00136,"8.1-8.4":0,"9.0-9.2":0.00136,"9.3":0.03992,"10.0-10.2":0.00159,"10.3":0.01996,"11.0-11.2":0.02994,"11.3-11.4":0.022,"12.0-12.1":0.01157,"12.2-12.5":0.235,"13.0-13.1":0.02041,"13.2":0.0025,"13.3":0.05421,"13.4-13.7":0.07032,"14.0-14.4":0.24089,"14.5-14.8":0.49154,"15.0-15.1":0.26517,"15.2-15.3":0.75331,"15.4":0.00318},P:{"4":0.66965,"5.0-5.4":0.03067,"6.2-6.4":0.02029,"7.2-7.4":1.25813,"8.2":0.01022,"9.2":0.04058,"10.1":0.15219,"11.1-11.2":0.18263,"12.0":0.05073,"13.0":0.2638,"14.0":0.50731,"15.0":0.18263,"16.0":1.23783},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00126,"4.2-4.3":0.00306,"4.4":0,"4.4.3-4.4.4":0.03669},A:{"8":0.00316,"11":0.22464,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00684},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.57414},Q:{"10.4":0},O:{"0":0.99791},H:{"0":6.83331},L:{"0":62.6305},S:{"2.5":0.01367}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LT.js
new file mode 100644
index 0000000..e3ced5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LT.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.03575,"51":0.00596,"52":0.11322,"57":0.01192,"60":0.01192,"66":0.00596,"72":0.01192,"77":0.01192,"78":0.04171,"79":0.00596,"80":0.00596,"82":0.00596,"84":0.01788,"85":0.00596,"88":0.02384,"89":0.01192,"90":0.0298,"91":0.10726,"92":0.06555,"93":0.01192,"94":0.04767,"95":0.1311,"96":2.02606,"97":3.18211,"98":0.02384,_:"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 40 41 42 43 44 45 46 47 49 50 53 54 55 56 58 59 61 62 63 64 65 67 68 69 70 71 73 74 75 76 81 83 86 87 99 3.5 3.6"},D:{"33":0.01192,"34":0.01192,"38":0.00596,"41":0.01788,"49":0.05363,"56":0.01788,"63":0.01192,"64":0.01192,"65":0.00596,"66":0.01192,"67":0.00596,"68":0.01192,"70":0.01192,"71":0.01192,"73":0.02384,"74":0.00596,"75":0.00596,"76":0.01192,"77":0.01192,"78":0.01788,"79":0.07151,"80":0.02384,"81":0.03575,"83":0.07151,"84":0.07151,"85":0.04767,"86":0.07747,"87":0.1013,"88":0.06555,"89":0.05959,"90":0.05363,"91":0.07151,"92":0.07747,"93":0.75083,"94":0.1311,"95":0.15493,"96":0.70912,"97":11.85245,"98":25.27808,"99":0.01192,"100":0.01788,_:"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 35 36 37 39 40 42 43 44 45 46 47 48 50 51 52 53 54 55 57 58 59 60 61 62 69 72 101"},F:{"28":0.00596,"36":0.01788,"64":0.01192,"79":0.01192,"80":0.01192,"82":1.00111,"83":3.46814,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 65 66 67 68 69 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01192,"85":0.01192,"89":0.01192,"91":0.00596,"92":0.02384,"94":0.01192,"95":0.01788,"96":0.04171,"97":1.13817,"98":3.76013,_:"12 13 14 15 16 17 79 80 81 83 84 86 87 88 90 93"},E:{"4":0,"13":0.04171,"14":0.20261,"15":0.1311,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.01192,"11.1":0.01788,"12.1":0.04171,"13.1":0.23836,"14.1":0.47672,"15.1":0.29795,"15.2-15.3":0.50056,"15.4":0.01788},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00286,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02862,"10.0-10.2":0.00382,"10.3":0.08683,"11.0-11.2":0.00763,"11.3-11.4":0.01908,"12.0-12.1":0.00954,"12.2-12.5":0.15266,"13.0-13.1":0.01717,"13.2":0.02004,"13.3":0.0229,"13.4-13.7":0.15075,"14.0-14.4":0.50664,"14.5-14.8":1.66019,"15.0-15.1":1.63443,"15.2-15.3":5.1504,"15.4":0.05916},P:{"4":0.08398,"5.0-5.4":0.89089,"6.2-6.4":0.05053,"7.2-7.4":0.56594,"8.2":0.01022,"9.2":0.11117,"10.1":0.05053,"11.1-11.2":0.03149,"12.0":0.0105,"13.0":0.07349,"14.0":0.09448,"15.0":0.09448,"16.0":2.61403},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00128,"4.2-4.3":0.00638,"4.4":0,"4.4.3-4.4.4":0.02871},A:{"8":0.00596,"11":0.3635,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.25862},Q:{"10.4":0},O:{"0":0.0687},H:{"0":0.3864},L:{"0":26.79061},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LU.js
new file mode 100644
index 0000000..13dd4ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LU.js
@@ -0,0 +1 @@
+module.exports={C:{"24":0.03173,"38":0.00529,"45":0.00529,"48":0.02115,"50":0.03702,"51":0.03173,"52":0.0899,"59":0.02644,"60":0.0423,"61":0.03173,"62":0.02644,"63":0.02115,"66":0.0423,"68":0.03173,"77":0.01586,"78":0.17979,"79":0.01586,"87":0.00529,"88":0.02115,"89":0.04759,"91":0.86723,"92":0.01058,"93":0.01586,"94":1.33258,"95":0.13749,"96":2.19452,"97":3.5271,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 46 47 49 53 54 55 56 57 58 64 65 67 69 70 71 72 73 74 75 76 80 81 82 83 84 85 86 90 98 99 3.5 3.6"},D:{"49":0.0423,"53":0.01586,"56":0.00529,"60":0.06874,"65":0.0423,"66":0.01586,"67":0.04759,"68":0.06346,"69":0.03173,"70":0.02644,"71":0.03173,"72":0.20623,"74":0.04759,"75":0.00529,"76":0.00529,"77":0.15335,"78":0.15864,"79":0.15335,"80":0.05288,"81":0.0423,"83":0.04759,"84":0.08461,"85":0.15864,"86":0.55524,"87":0.06874,"88":0.0423,"89":0.03173,"90":0.04759,"91":0.08461,"92":0.0899,"93":0.54466,"94":0.0423,"95":0.11105,"96":0.67686,"97":6.22398,"98":12.84984,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 54 55 57 58 59 61 62 63 64 73 99 100 101"},F:{"53":0.01058,"69":0.01058,"79":0.01058,"82":0.48121,"83":1.34315,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 54 55 56 57 58 60 62 63 64 65 66 67 68 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.03173,"16":0.03702,"17":0.01058,"18":0.01058,"89":0.02115,"90":0.01058,"91":0.01586,"92":0.01058,"94":0.02115,"95":0.18508,"96":0.20623,"97":1.39603,"98":4.93899,_:"12 13 14 79 80 81 83 84 85 86 87 88 93"},E:{"4":0,"8":0.01058,"12":0.01058,"13":0.07403,"14":0.54466,"15":0.46534,_:"0 5 6 7 9 10 11 3.1 3.2 6.1 7.1","5.1":0.01058,"9.1":0.01058,"10.1":0.02115,"11.1":0.0423,"12.1":0.25382,"13.1":0.83022,"14.1":2.21567,"15.1":1.33786,"15.2-15.3":2.54882,"15.4":0.01058},G:{"8":0,"3.2":0.00781,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00195,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.0039,"9.3":0.10929,"10.0-10.2":0.00195,"10.3":0.08392,"11.0-11.2":0.02342,"11.3-11.4":0.05659,"12.0-12.1":0.01366,"12.2-12.5":0.39812,"13.0-13.1":0.05269,"13.2":0.0039,"13.3":0.04098,"13.4-13.7":0.27712,"14.0-14.4":0.71622,"14.5-14.8":3.35471,"15.0-15.1":2.9039,"15.2-15.3":11.39119,"15.4":0.06635},P:{"4":0.15575,"5.0-5.4":0.89089,"6.2-6.4":0.05053,"7.2-7.4":0.03115,"8.2":0.01022,"9.2":0.02077,"10.1":0.05053,"11.1-11.2":0.02077,"12.0":0.05192,"13.0":0.0623,"14.0":0.11422,"15.0":0.07269,"16.0":4.00809},I:{"0":0,"3":0,"4":0.00048,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00192,"4.2-4.3":0.00361,"4.4":0,"4.4.3-4.4.4":0.01755},A:{"9":0.07699,"11":0.47296,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.81046},Q:{"10.4":0.00942},O:{"0":0.61256},H:{"0":0.6067},L:{"0":20.55799},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LV.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LV.js
new file mode 100644
index 0000000..66ec630
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LV.js
@@ -0,0 +1 @@
+module.exports={C:{"42":0.00654,"52":0.08498,"55":0.03269,"56":0.01307,"68":0.00654,"72":0.03269,"78":0.06537,"79":0.01961,"81":0.00654,"83":0.00654,"84":0.01961,"85":0.00654,"86":0.00654,"87":0.01961,"88":0.03922,"89":0.01307,"90":0.01307,"91":0.20918,"92":0.01961,"93":0.01961,"94":0.01307,"95":0.09806,"96":1.98725,"97":3.19006,"98":0.01961,_:"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 40 41 43 44 45 46 47 48 49 50 51 53 54 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 80 82 99 3.5 3.6"},D:{"38":0.00654,"49":0.14381,"57":0.00654,"68":0.01307,"69":0.01307,"70":0.00654,"71":0.00654,"72":0.01307,"74":0.01307,"76":0.00654,"77":0.00654,"78":0.03922,"79":0.18957,"80":0.02615,"81":0.01307,"83":0.03269,"84":0.05883,"85":0.04576,"86":0.07191,"87":0.10459,"88":0.03269,"89":0.09152,"90":0.11113,"91":0.1242,"92":0.11767,"93":0.706,"94":0.07191,"95":0.07191,"96":0.7779,"97":13.1263,"98":30.99192,"99":0.02615,"100":0.0523,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 58 59 60 61 62 63 64 65 66 67 73 75 101"},F:{"36":0.01961,"68":0.01307,"82":0.51642,"83":1.98725,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"84":0.00654,"85":0.02615,"89":0.01961,"92":0.01961,"94":0.00654,"95":0.02615,"96":0.05883,"97":1.3074,"98":4.5759,_:"12 13 14 15 16 17 18 79 80 81 83 86 87 88 90 91 93"},E:{"4":0,"13":0.01961,"14":0.20918,"15":0.11113,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.01307,"10.1":0.01307,"11.1":0.01307,"12.1":0.03269,"13.1":0.21572,"14.1":0.41837,"15.1":0.28763,"15.2-15.3":0.51642,"15.4":0.00654},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.0009,"5.0-5.1":0.0009,"6.0-6.1":0.0009,"7.0-7.1":0.0009,"8.1-8.4":0.0009,"9.0-9.2":0.00449,"9.3":0.01795,"10.0-10.2":0.00538,"10.3":0.04398,"11.0-11.2":0.01346,"11.3-11.4":0.01167,"12.0-12.1":0.02513,"12.2-12.5":0.16872,"13.0-13.1":0.01256,"13.2":0.00538,"13.3":0.04487,"13.4-13.7":0.1059,"14.0-14.4":0.52142,"14.5-14.8":1.62529,"15.0-15.1":1.58401,"15.2-15.3":4.72151,"15.4":0.05295},P:{"4":0.06305,"5.0-5.4":0.03067,"6.2-6.4":0.03067,"7.2-7.4":0.23517,"8.2":0.01022,"9.2":0.07157,"10.1":0.01051,"11.1-11.2":0.08407,"12.0":0.02102,"13.0":0.07356,"14.0":0.07356,"15.0":0.15763,"16.0":2.85839},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00395,"4.2-4.3":0.01448,"4.4":0,"4.4.3-4.4.4":0.04737},A:{"11":0.16996,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.26319},Q:{"10.4":0},O:{"0":0.07965},H:{"0":0.34425},L:{"0":20.9847},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LY.js
new file mode 100644
index 0000000..93f68c6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/LY.js
@@ -0,0 +1 @@
+module.exports={C:{"4":0.00353,"5":0.00176,"15":0.00176,"17":0.00529,"23":0.00353,"26":0.00176,"28":0.00176,"30":0.00176,"33":0.00882,"34":0.00353,"36":0.00176,"38":0.00353,"39":0.00353,"43":0.00529,"47":0.00882,"48":0.00529,"52":0.01058,"56":0.00176,"61":0.00176,"70":0.01235,"72":0.00706,"78":0.00706,"84":0.00353,"85":0.00176,"88":0.00353,"89":0.00176,"90":0.00353,"91":0.01058,"92":0.00176,"93":0.00353,"94":0.01058,"95":0.02999,"96":0.33163,"97":0.60505,"98":0.01411,_:"2 3 6 7 8 9 10 11 12 13 14 16 18 19 20 21 22 24 25 27 29 31 32 35 37 40 41 42 44 45 46 49 50 51 53 54 55 57 58 59 60 62 63 64 65 66 67 68 69 71 73 74 75 76 77 79 80 81 82 83 86 87 99 3.5 3.6"},D:{"11":0.00353,"19":0.00176,"23":0.00353,"24":0.00529,"25":0.00529,"26":0.00176,"28":0.00353,"31":0.00176,"32":0.00706,"33":0.01235,"37":0.00353,"38":0.00529,"40":0.00706,"43":0.01764,"44":0.00176,"49":0.02293,"50":0.00176,"53":0.00353,"54":0.00353,"55":0.00529,"56":0.01058,"57":0.00353,"58":0.00529,"60":0.00529,"63":0.01764,"64":0.00353,"65":0.01058,"66":0.00882,"67":0.00706,"68":0.00353,"69":0.01235,"70":0.00882,"71":0.02646,"72":0.00176,"73":0.00529,"74":0.00706,"75":0.00529,"76":0.00706,"77":0.00529,"78":0.01058,"79":0.02822,"80":0.01764,"81":0.00882,"83":0.02822,"84":0.00882,"85":0.01588,"86":0.03528,"87":0.05468,"88":0.03352,"89":0.03528,"90":0.02117,"91":0.02999,"92":0.06174,"93":0.03704,"94":0.02822,"95":0.05116,"96":0.34927,"97":3.38159,"98":8.00856,"99":0.00353,"100":0.01058,"101":0.00353,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 20 21 22 27 29 30 34 35 36 39 41 42 45 46 47 48 51 52 59 61 62"},F:{"67":0.01235,"68":0.00176,"69":0.00353,"79":0.00706,"80":0.00529,"82":0.10408,"83":0.53449,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00353,"14":0.00706,"16":0.00529,"17":0.0194,"18":0.02646,"83":0.00353,"84":0.01411,"85":0.02822,"89":0.01235,"90":0.00529,"92":0.01058,"93":0.00353,"94":0.00176,"95":0.05645,"96":0.02646,"97":0.34927,"98":0.74088,_:"13 15 79 80 81 86 87 88 91"},E:{"4":0,"13":0.0688,"14":0.07056,"15":0.05292,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 15.4","9.1":0.00176,"10.1":0.01058,"11.1":0.00353,"12.1":0.00529,"13.1":0.0441,"14.1":0.11995,"15.1":0.07938,"15.2-15.3":0.09878},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00177,"6.0-6.1":0.0062,"7.0-7.1":0.01418,"8.1-8.4":0.04076,"9.0-9.2":0.00443,"9.3":0.07531,"10.0-10.2":0.00443,"10.3":0.06734,"11.0-11.2":0.02126,"11.3-11.4":0.04164,"12.0-12.1":0.05936,"12.2-12.5":0.83194,"13.0-13.1":0.03101,"13.2":0.01949,"13.3":0.11695,"13.4-13.7":0.24099,"14.0-14.4":1.00648,"14.5-14.8":1.77464,"15.0-15.1":1.56909,"15.2-15.3":2.89807,"15.4":0.02835},P:{"4":0.29307,"5.0-5.4":0.89089,"6.2-6.4":0.05053,"7.2-7.4":0.56594,"8.2":0.01022,"9.2":0.11117,"10.1":0.05053,"11.1-11.2":0.27286,"12.0":0.09095,"13.0":0.25265,"14.0":0.3436,"15.0":0.32339,"16.0":1.82919},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00092,"4.2-4.3":0.00423,"4.4":0,"4.4.3-4.4.4":0.03603},A:{"8":0.00529,"9":0.00353,"10":0.00353,"11":0.07232,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.09883},Q:{"10.4":0},O:{"0":0.45298},H:{"0":3.29047},L:{"0":63.59095},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MA.js
new file mode 100644
index 0000000..7e9ab93
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MA.js
@@ -0,0 +1 @@
+module.exports={C:{"2":0.72585,"15":0.74612,"18":0.74207,"21":0.73801,"23":0.74207,"25":1.48413,"30":0.7299,"51":0.74612,"52":0.04461,"60":0.00406,"64":0.00406,"65":0.01622,"78":0.01622,"81":0.00811,"84":0.02433,"88":0.00406,"89":0.00406,"91":0.02028,"93":0.00406,"94":0.00811,"95":0.01622,"96":0.31224,"97":0.49066,"98":0.01217,_:"3 4 5 6 7 8 9 10 11 12 13 14 16 17 19 20 22 24 26 27 28 29 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 53 54 55 56 57 58 59 61 62 63 66 67 68 69 70 71 72 73 74 75 76 77 79 80 82 83 85 86 87 90 92 99 3.5 3.6"},D:{"19":0.73801,"24":2.21809,"30":0.73801,"33":0.74612,"35":1.48008,"38":0.00406,"43":0.00406,"49":0.04461,"53":0.01217,"54":0.74207,"55":0.74612,"56":3.69816,"58":0.00406,"62":0.00406,"63":0.00811,"64":0.00406,"65":0.01217,"66":0.01622,"67":0.06083,"68":0.01217,"69":0.00811,"70":0.06894,"71":0.00811,"72":0.01622,"74":0.00406,"75":0.01622,"77":0.00406,"78":0.00406,"79":0.04461,"80":0.00811,"81":0.02028,"83":0.03244,"84":0.04461,"85":0.04055,"86":0.05272,"87":0.13787,"88":0.03244,"89":0.0365,"90":0.02839,"91":0.04055,"92":0.0365,"93":0.1987,"94":0.0811,"95":0.03244,"96":0.1987,"97":2.48166,"98":5.70133,"100":0.00406,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 23 25 26 27 28 29 31 32 34 36 37 39 40 41 42 44 45 46 47 48 50 51 52 57 59 60 61 73 76 99 101"},F:{"43":0.73801,"82":0.10949,"83":0.49066,_:"9 11 12 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 40 41 42 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0.74207},B:{"18":0.00811,"84":0.00811,"85":0.00811,"86":0.00406,"87":0.00406,"88":0.00406,"89":0.00811,"90":0.00406,"91":0.00811,"92":0.01217,"94":0.00406,"95":0.00811,"96":0.01622,"97":0.17437,"98":0.61231,_:"12 13 14 15 16 17 79 80 81 83 93"},E:{"4":0,"5":0.73396,"13":0.0365,"14":0.04055,"15":0.02839,_:"0 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00811,"12.1":0.01217,"13.1":0.05272,"14.1":0.08516,"15.1":0.03244,"15.2-15.3":0.04866},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00383,"6.0-6.1":14.55397,"7.0-7.1":0.0249,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04597,"10.0-10.2":1.97079,"10.3":0.04405,"11.0-11.2":0.06129,"11.3-11.4":0.04405,"12.0-12.1":0.06703,"12.2-12.5":0.452,"13.0-13.1":0.00766,"13.2":0.00383,"13.3":0.01915,"13.4-13.7":0.08427,"14.0-14.4":0.18195,"14.5-14.8":0.452,"15.0-15.1":0.36581,"15.2-15.3":0.75461,"15.4":0.00575},P:{"4":0.37587,"5.0-5.4":0.07136,"6.2-6.4":0.02048,"7.2-7.4":0.12161,"8.2":0.01015,"9.2":0.03317,"10.1":0.02048,"11.1-11.2":0.05528,"12.0":0.02211,"13.0":0.12161,"14.0":0.07739,"15.0":0.0995,"16.0":1.06128},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0133,"4.2-4.3":0.63155,"4.4":0,"4.4.3-4.4.4":1.07919},A:{"8":1.48008,"9":1.48008,"10":1.48413,"11":0.05677,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.05945},Q:{"10.4":0},O:{"0":0.05351},H:{"0":0.16322},L:{"0":35.78282},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MC.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MC.js
new file mode 100644
index 0000000..04db73a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MC.js
@@ -0,0 +1 @@
+module.exports={C:{"68":0.01917,"75":0.02556,"78":0.65817,"79":0.01278,"80":0.03834,"81":0.03195,"84":0.02556,"91":0.10224,"92":0.00639,"93":0.01278,"94":0.01278,"95":0.10224,"96":1.42497,"97":2.67741,"98":0.01278,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 76 77 82 83 85 86 87 88 89 90 99 3.5 3.6"},D:{"18":3.24612,"49":0.00639,"56":0.01278,"66":0.01278,"71":0.00639,"75":0.00639,"76":0.00639,"77":0.60705,"78":0.01278,"79":0.01917,"80":0.00639,"81":0.02556,"83":0.01278,"84":0.05751,"85":0.24282,"86":0.00639,"87":0.68373,"88":0.01917,"89":0.23643,"90":0.08307,"91":0.01917,"92":0.05112,"93":0.02556,"94":0.79875,"95":0.04473,"96":0.69012,"97":8.67123,"98":17.09325,"99":0.01917,"100":0.01917,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 57 58 59 60 61 62 63 64 65 67 68 69 70 72 73 74 101"},F:{"70":0.01278,"71":0.00639,"82":0.10224,"83":0.7668,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.03195,"84":0.01278,"85":0.01278,"94":0.00639,"95":0.02556,"96":0.15975,"97":1.29078,"98":4.33242,_:"12 13 14 15 16 17 79 80 81 83 86 87 88 89 90 91 92 93"},E:{"4":0,"13":0.20448,"14":0.84348,"15":0.56871,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.00639,"10.1":0.01278,"11.1":0.04473,"12.1":0.11502,"13.1":1.3419,"14.1":3.84039,"15.1":1.7892,"15.2-15.3":4.54968,"15.4":0.01278},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00956,"9.0-9.2":0,"9.3":0.04542,"10.0-10.2":0.04064,"10.3":0.06694,"11.0-11.2":0,"11.3-11.4":0.24385,"12.0-12.1":0.04781,"12.2-12.5":0.38011,"13.0-13.1":0.02152,"13.2":0.01673,"13.3":0.01913,"13.4-13.7":0.60723,"14.0-14.4":2.24722,"14.5-14.8":5.7065,"15.0-15.1":2.58669,"15.2-15.3":11.81225,"15.4":0.0502},P:{"4":0.06258,"5.0-5.4":0.01024,"6.2-6.4":0.02048,"7.2-7.4":0.04172,"8.2":0.01015,"9.2":0.03129,"10.1":0.02048,"11.1-11.2":0.04348,"12.0":0.02174,"13.0":0.11472,"14.0":0.03261,"15.0":0.13558,"16.0":0.90215},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.17253,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00722},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.1083},Q:{"10.4":0},O:{"0":0.00722},H:{"0":0.00342},L:{"0":11.45817},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MD.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MD.js
new file mode 100644
index 0000000..3cb7e1a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MD.js
@@ -0,0 +1 @@
+module.exports={C:{"16":0.00426,"52":0.06389,"55":0.00852,"68":0.00426,"77":0.00426,"78":0.03833,"80":0.00426,"84":0.00426,"85":0.00426,"87":0.24276,"88":0.00852,"89":0.00852,"90":0.00426,"91":0.11073,"92":0.00426,"93":0.01278,"94":0.04259,"95":0.07666,"96":0.79217,"97":0.9242,"98":0.00852,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 79 81 82 83 86 99 3.5 3.6"},D:{"34":0.00426,"38":0.00426,"48":0.0213,"49":0.11073,"53":0.00426,"57":0.00426,"58":0.00852,"59":0.01704,"63":0.00852,"64":0.00852,"67":0.04685,"68":0.00852,"69":0.01704,"70":0.01278,"71":0.02555,"72":0.00852,"73":0.0213,"74":0.03407,"75":0.00426,"76":0.04259,"77":0.02555,"78":0.00852,"79":0.03407,"80":0.07666,"81":0.01278,"83":0.05963,"84":0.09796,"85":0.04685,"86":0.08518,"87":0.05537,"88":0.02981,"89":0.03833,"90":0.07666,"91":0.05111,"92":0.05111,"93":2.71724,"94":0.07666,"95":0.04685,"96":0.86884,"97":9.702,"98":18.10501,"99":0.01278,"100":0.00426,_:"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 35 36 37 39 40 41 42 43 44 45 46 47 50 51 52 54 55 56 60 61 62 65 66 101"},F:{"70":0.02555,"82":0.41738,"83":1.53324,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01704,"85":0.01704,"91":0.00852,"92":0.00852,"96":0.01278,"97":0.33646,"98":1.07753,_:"12 13 14 15 16 17 79 80 81 83 84 86 87 88 89 90 93 94 95"},E:{"4":0,"13":0.04259,"14":0.10648,"15":0.05111,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1 15.4","5.1":0.05537,"9.1":0.00852,"11.1":0.00426,"12.1":0.01278,"13.1":0.10648,"14.1":0.26832,"15.1":0.12777,"15.2-15.3":0.24702},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00093,"6.0-6.1":0,"7.0-7.1":0.00371,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0167,"10.0-10.2":0.00371,"10.3":0.0334,"11.0-11.2":0.01392,"11.3-11.4":0.01113,"12.0-12.1":0.01021,"12.2-12.5":0.30157,"13.0-13.1":0.01485,"13.2":0.00557,"13.3":0.04176,"13.4-13.7":0.16517,"14.0-14.4":0.50479,"14.5-14.8":1.90222,"15.0-15.1":1.56261,"15.2-15.3":4.63771,"15.4":0.04176},P:{"4":0.06258,"5.0-5.4":0.01024,"6.2-6.4":0.02048,"7.2-7.4":0.04172,"8.2":0.01015,"9.2":0.03129,"10.1":0.02048,"11.1-11.2":0.07301,"12.0":0.02086,"13.0":0.11472,"14.0":0.12515,"15.0":0.13558,"16.0":1.89817},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00197,"4.2-4.3":0.00492,"4.4":0,"4.4.3-4.4.4":0.02756},A:{"6":0.0047,"7":0.0047,"8":0.04232,"9":0.01411,"10":0.01411,"11":0.14578,_:"5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.06315},Q:{"10.4":0},O:{"0":0.08037},H:{"0":0.20654},L:{"0":41.25343},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ME.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ME.js
new file mode 100644
index 0000000..cd33024
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ME.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00341,"48":0.04091,"49":0.00341,"52":0.92043,"56":0.00341,"84":0.01705,"88":0.01705,"89":0.00341,"91":0.01705,"92":0.00682,"93":0.01364,"94":0.01023,"95":0.02045,"96":0.61703,"97":1.28519,"98":0.01364,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 85 86 87 90 99 3.5 3.6"},D:{"11":0.00341,"34":0.00682,"38":0.01364,"49":0.075,"53":0.075,"56":0.00341,"62":0.00341,"63":0.00341,"66":0.05795,"68":0.02727,"75":0.00341,"77":0.00682,"78":0.03068,"79":0.10568,"80":0.02386,"81":0.01023,"83":0.01023,"84":0.03409,"85":0.04773,"86":0.01364,"87":0.08182,"88":0.05795,"89":0.02386,"90":0.01023,"91":0.02727,"92":0.05454,"93":0.075,"94":0.03068,"95":0.04773,"96":0.32045,"97":5.7578,"98":12.30308,"99":0.00682,"100":0.01023,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 57 58 59 60 61 64 65 67 69 70 71 72 73 74 76 101"},F:{"28":0.00682,"40":0.01023,"42":0.01364,"46":0.01705,"68":7.9532,"74":0.00341,"82":0.16022,"83":0.78407,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 41 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 71 72 73 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.00682,"91":0.00682,"92":0.02045,"96":0.00341,"97":0.22159,"98":0.8693,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 93 94 95"},E:{"4":0,"12":0.00682,"13":0.02045,"14":0.06818,"15":0.02386,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00341,"12.1":0.03068,"13.1":0.05454,"14.1":0.17386,"15.1":0.08523,"15.2-15.3":0.15681},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01388,"8.1-8.4":0.00185,"9.0-9.2":0,"9.3":0.03793,"10.0-10.2":0.00185,"10.3":0.11378,"11.0-11.2":0.0111,"11.3-11.4":0.02313,"12.0-12.1":0.02128,"12.2-12.5":0.49397,"13.0-13.1":0.01573,"13.2":0.00463,"13.3":0.0555,"13.4-13.7":0.18963,"14.0-14.4":0.51155,"14.5-14.8":2.40048,"15.0-15.1":1.20625,"15.2-15.3":4.1192,"15.4":0.02405},P:{"4":0.12465,"5.0-5.4":0.07136,"6.2-6.4":0.02048,"7.2-7.4":0.04155,"8.2":0.01015,"9.2":0.08155,"10.1":0.02048,"11.1-11.2":0.05194,"12.0":0.01039,"13.0":0.07271,"14.0":0.10387,"15.0":0.11426,"16.0":2.2748},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00081,"4.2-4.3":0.00244,"4.4":0,"4.4.3-4.4.4":0.01652},A:{"11":0.08863,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.11203},Q:{"10.4":0},O:{"0":0.01318},H:{"0":0.18093},L:{"0":42.12832},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MG.js
new file mode 100644
index 0000000..88395a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MG.js
@@ -0,0 +1 @@
+module.exports={C:{"16":0.00964,"28":0.00964,"36":0.00482,"39":0.00964,"40":0.01447,"41":0.00964,"42":0.00482,"47":0.02411,"48":0.02411,"52":0.13019,"56":0.02411,"59":0.00482,"60":0.01929,"61":0.00964,"66":0.01929,"68":0.01929,"69":0.01447,"70":0.01929,"72":0.18324,"75":0.00482,"78":0.05786,"79":0.02411,"80":0.00482,"81":0.00964,"82":0.00964,"83":0.00964,"84":0.01447,"85":0.00964,"86":0.00964,"87":0.01447,"88":0.05304,"89":0.10126,"90":0.00482,"91":0.1543,"92":0.0434,"93":0.0868,"94":0.04822,"95":0.1543,"96":2.02042,"97":3.18734,"98":0.04822,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 43 44 45 46 49 50 51 53 54 55 57 58 62 63 64 65 67 71 73 74 76 77 99 3.5 3.6"},D:{"11":0.07715,"29":0.00482,"38":0.00482,"40":0.05786,"42":0.06269,"43":0.05304,"49":0.09162,"55":0.00964,"57":0.02893,"58":0.00964,"60":0.02411,"61":0.01447,"63":0.01447,"64":0.01447,"65":0.00964,"67":0.03858,"68":0.00482,"69":0.00482,"70":0.00482,"71":0.02893,"72":0.00964,"73":0.01447,"74":0.02893,"75":0.00482,"76":0.07715,"77":0.00964,"78":0.06269,"79":0.03858,"80":0.04822,"81":0.13984,"83":0.0434,"84":0.01929,"85":0.03858,"86":0.20252,"87":0.16877,"88":0.03858,"89":0.18324,"90":0.07233,"91":0.13502,"92":0.10608,"93":0.44845,"94":0.08197,"95":0.19288,"96":1.21032,"97":6.82795,"98":15.09768,"99":0.01447,"100":0.02893,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 30 31 32 33 34 35 36 37 39 41 44 45 46 47 48 50 51 52 53 54 56 59 62 66 101"},F:{"37":0.00964,"53":0.08197,"66":0.03375,"68":0.06751,"79":0.01447,"82":0.13019,"83":0.88243,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 54 55 56 57 58 60 62 63 64 65 67 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00964,"13":0.00482,"14":0.00964,"15":0.00964,"17":0.00964,"18":0.03375,"84":0.01447,"85":0.01929,"89":0.01447,"90":0.01929,"92":0.01929,"93":0.02893,"94":0.00964,"95":0.02893,"96":0.03858,"97":0.57382,"98":1.7745,_:"16 79 80 81 83 86 87 88 91"},E:{"4":0,"14":0.01447,"15":0.01447,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.07715,"12.1":0.06751,"13.1":0.09644,"14.1":0.13019,"15.1":0.06751,"15.2-15.3":0.05304},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.01522,"5.0-5.1":0.00098,"6.0-6.1":0.00074,"7.0-7.1":0.02356,"8.1-8.4":0.00123,"9.0-9.2":0.00123,"9.3":0.03878,"10.0-10.2":0.04467,"10.3":0.06209,"11.0-11.2":0.01301,"11.3-11.4":0.01031,"12.0-12.1":0.01203,"12.2-12.5":0.27904,"13.0-13.1":0.04172,"13.2":0.00442,"13.3":0.03755,"13.4-13.7":0.07976,"14.0-14.4":0.24051,"14.5-14.8":0.33597,"15.0-15.1":0.29057,"15.2-15.3":0.90852,"15.4":0.01203},P:{"4":0.08639,"5.0-5.4":0.0216,"6.2-6.4":0.05053,"7.2-7.4":0.0108,"8.2":0.01057,"9.2":0.07569,"10.1":0.05053,"11.1-11.2":0.0216,"12.0":0.0432,"13.0":0.0648,"14.0":0.21599,"15.0":0.0756,"16.0":0.46437},I:{"0":0,"3":0,"4":0.00043,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00534,"4.2-4.3":0.01025,"4.4":0,"4.4.3-4.4.4":0.06681},A:{"9":0.01232,"11":0.09858,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.37792},Q:{"10.4":0.01035},O:{"0":1.07682},H:{"0":4.3229},L:{"0":51.88882},S:{"2.5":0.06212}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MH.js
new file mode 100644
index 0000000..0fedaea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MH.js
@@ -0,0 +1 @@
+module.exports={C:{"78":0.00723,"85":0.00241,"91":0.00723,"95":0.01205,"96":0.20236,"97":0.72029,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 86 87 88 89 90 92 93 94 98 99 3.5 3.6"},D:{"36":0.00241,"60":0.00241,"73":0.15418,"75":0.01686,"80":0.00723,"81":0.01205,"84":0.01927,"87":0.02168,"90":0.00241,"92":0.07468,"93":0.11081,"94":0.00482,"95":0.00482,"96":0.10359,"97":5.90205,"98":11.89564,_:"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 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 72 74 76 77 78 79 83 85 86 88 89 91 99 100 101"},F:{"82":0.00723,"83":0.03614,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.00241,"80":0.01205,"84":0.02168,"89":0.00723,"90":0.00241,"92":0.00964,"95":0.01205,"97":0.20717,"98":0.84797,_:"12 13 14 15 16 17 79 81 83 85 86 87 88 91 93 94 96"},E:{"4":0,"13":0.00482,"14":0.01205,"15":0.00241,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 15.4","12.1":0.053,"13.1":0.40471,"14.1":0.67934,"15.1":0.06023,"15.2-15.3":0.01686},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00388,"9.0-9.2":0,"9.3":0.00388,"10.0-10.2":0,"10.3":0.02286,"11.0-11.2":0.16603,"11.3-11.4":0.00776,"12.0-12.1":0.00388,"12.2-12.5":0.06296,"13.0-13.1":0.00173,"13.2":0.00388,"13.3":0.00561,"13.4-13.7":0.02458,"14.0-14.4":0.68483,"14.5-14.8":1.30023,"15.0-15.1":0.95997,"15.2-15.3":1.05959,"15.4":0},P:{"4":0.02189,"5.0-5.4":0.01033,"6.2-6.4":0.02087,"7.2-7.4":0.03284,"8.2":0.01057,"9.2":0.02066,"10.1":0.01052,"11.1-11.2":0.02189,"12.0":0.01095,"13.0":0.03284,"14.0":0.08588,"15.0":0.09661,"16.0":0.35025},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.05782,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.03036},Q:{"10.4":0},O:{"0":0.90333},H:{"0":0.02156},L:{"0":12.69557},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MK.js
new file mode 100644
index 0000000..44d3fec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MK.js
@@ -0,0 +1 @@
+module.exports={C:{"40":0.02095,"44":0.00698,"47":0.01047,"48":0.00349,"50":0.00698,"51":0.01396,"52":0.2723,"56":0.01047,"65":0.00349,"66":0.00698,"68":0.01047,"71":0.00349,"72":0.01746,"78":0.02095,"79":0.02793,"80":0.02095,"81":0.01047,"82":0.04538,"83":0.00349,"84":0.00698,"85":0.00698,"87":0.00349,"88":0.01047,"91":0.04189,"92":0.00349,"93":0.00698,"94":0.04538,"95":0.09077,"96":0.78897,"97":1.47669,"98":0.01047,_:"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 41 42 43 45 46 49 53 54 55 57 58 59 60 61 62 63 64 67 69 70 73 74 75 76 77 86 89 90 99 3.5 3.6"},D:{"22":0.00349,"26":0.00698,"34":0.00698,"38":0.01047,"47":0.05237,"48":0.01396,"49":0.15011,"53":0.03491,"56":0.01396,"58":0.00698,"63":0.01047,"64":0.01047,"66":0.01396,"68":0.01047,"69":0.02095,"70":0.00349,"71":0.01746,"72":0.01396,"73":0.00349,"74":0.00698,"76":0.00698,"77":0.01396,"78":0.02793,"79":0.10124,"80":0.01746,"81":0.01047,"83":0.05935,"84":0.13615,"85":0.12568,"86":0.17106,"87":0.2339,"88":0.02793,"89":0.02444,"90":0.03142,"91":0.06633,"92":0.05935,"93":0.02793,"94":0.0384,"95":0.11869,"96":0.40845,"97":7.2543,"98":17.09892,"99":0.01047,"100":0.00698,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 50 51 52 54 55 57 59 60 61 62 65 67 75 101"},F:{"28":0.00349,"31":0.01047,"36":0.00698,"46":0.00698,"52":0.01396,"68":0.01396,"69":0.01396,"70":0.00698,"71":0.01746,"72":0.00349,"73":0.01047,"80":0.00349,"82":0.26881,"83":1.1625,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 53 54 55 56 57 58 60 62 63 64 65 66 67 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.03491,"18":0.03142,"84":0.01047,"85":0.00698,"87":0.00698,"92":0.01746,"94":0.00698,"95":0.00349,"96":0.03491,"97":0.30721,"98":1.21836,_:"12 13 14 15 17 79 80 81 83 86 88 89 90 91 93"},E:{"4":0,"11":0.00349,"13":0.00698,"14":0.04538,"15":0.05586,_:"0 5 6 7 8 9 10 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.00698,"12.1":0.00349,"13.1":0.03142,"14.1":0.11171,"15.1":0.07331,"15.2-15.3":0.09077,"15.4":0.01746},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00232,"6.0-6.1":0,"7.0-7.1":0.01275,"8.1-8.4":0,"9.0-9.2":0.00464,"9.3":0.0313,"10.0-10.2":0.00464,"10.3":0.04406,"11.0-11.2":0.01739,"11.3-11.4":0.04058,"12.0-12.1":0.02087,"12.2-12.5":0.49739,"13.0-13.1":0.01159,"13.2":0.01043,"13.3":0.0858,"13.4-13.7":0.22493,"14.0-14.4":0.57855,"14.5-14.8":2.65738,"15.0-15.1":1.77506,"15.2-15.3":5.5362,"15.4":0.03014},P:{"4":0.07399,"5.0-5.4":0.89089,"6.2-6.4":0.05053,"7.2-7.4":0.03115,"8.2":0.01057,"9.2":0.07569,"10.1":0.05053,"11.1-11.2":0.13741,"12.0":0.02114,"13.0":0.09513,"14.0":0.11627,"15.0":0.09513,"16.0":1.92377},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00393,"4.2-4.3":0.00393,"4.4":0,"4.4.3-4.4.4":0.02469},A:{"8":0.02095,"9":0.02095,"10":0.00349,"11":0.10822,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.11716},Q:{"10.4":0},O:{"0":0.01302},H:{"0":0.15406},L:{"0":45.88336},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ML.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ML.js
new file mode 100644
index 0000000..b14ac46
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ML.js
@@ -0,0 +1 @@
+module.exports={C:{"41":0.00228,"43":0.00228,"47":0.00685,"48":0.00685,"52":0.00228,"56":0.00457,"57":0.00228,"72":0.02741,"78":0.00685,"87":0.00457,"88":0.00457,"89":0.00914,"91":0.02512,"93":0.00457,"94":0.00457,"95":0.01142,"96":1.20824,"97":1.39096,"98":0.00457,_:"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 40 42 44 45 46 49 50 51 53 54 55 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 90 92 99 3.5 3.6"},D:{"11":0.00685,"30":0.00228,"38":0.00228,"43":0.00914,"49":0.00457,"50":0.00228,"57":0.00685,"60":0.00457,"63":0.00685,"65":0.00228,"68":0.01142,"76":0.01142,"77":0.01142,"78":0.00228,"79":0.02741,"80":0.01142,"81":0.00685,"83":0.00228,"84":0.00228,"85":0.00228,"86":0.00457,"87":0.02284,"88":0.00457,"89":0.00685,"90":0.01142,"91":0.01142,"92":0.02512,"93":0.07309,"94":0.00685,"95":0.01827,"96":2.18122,"97":3.7686,"98":6.64644,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 33 34 35 36 37 39 40 41 42 44 45 46 47 48 51 52 53 54 55 56 58 59 61 62 64 66 67 69 70 71 72 73 74 75 99 100 101"},F:{"51":0.00914,"60":0.00228,"79":0.00228,"80":0.00228,"82":0.08222,"83":0.4431,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 52 53 54 55 56 57 58 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01142,"13":0.01142,"14":0.00685,"15":0.00228,"16":0.00914,"17":0.00914,"18":0.27865,"84":0.00685,"85":0.00685,"89":0.02741,"90":0.00457,"92":0.01142,"93":0.00228,"95":0.00457,"96":0.02284,"97":0.47964,"98":1.41151,_:"79 80 81 83 86 87 88 91 94"},E:{"4":0,"14":0.02969,"15":0.00685,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 6.1 9.1 10.1 15.4","5.1":0.00228,"7.1":0.00914,"11.1":0.00228,"12.1":0.00685,"13.1":0.03654,"14.1":0.04111,"15.1":0.01827,"15.2-15.3":0.02969},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02516,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03972,"10.0-10.2":0,"10.3":0.14961,"11.0-11.2":0.08209,"11.3-11.4":0.04501,"12.0-12.1":0.03177,"12.2-12.5":4.76359,"13.0-13.1":0.00662,"13.2":0.04369,"13.3":0.05296,"13.4-13.7":0.38924,"14.0-14.4":1.69996,"14.5-14.8":1.6801,"15.0-15.1":1.81382,"15.2-15.3":2.38842,"15.4":0.02118},P:{"4":0.30992,"5.0-5.4":0.01033,"6.2-6.4":0.02087,"7.2-7.4":0.24793,"8.2":0.01057,"9.2":0.02066,"10.1":0.01052,"11.1-11.2":0.09297,"12.0":0.42355,"13.0":0.10331,"14.0":0.2376,"15.0":0.21694,"16.0":0.83677},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00631,"4.2-4.3":0.00253,"4.4":0,"4.4.3-4.4.4":0.19949},A:{"9":0.00228,"11":0.05938,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.24691},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.03086},Q:{"10.4":0.00772},O:{"0":0.93364},H:{"0":0.54057},L:{"0":61.78002},S:{"2.5":0.02315}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MM.js
new file mode 100644
index 0000000..0ae6a96
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MM.js
@@ -0,0 +1 @@
+module.exports={C:{"29":0.00227,"30":0.00454,"34":0.00227,"35":0.00681,"36":0.00681,"37":0.00227,"39":0.00454,"41":0.00908,"43":0.00908,"44":0.00454,"45":0.00454,"46":0.00227,"47":0.00681,"48":0.00681,"52":0.00908,"54":0.00454,"56":0.01135,"57":0.00681,"58":0.00227,"60":0.14975,"61":0.00454,"62":0.00454,"66":0.02269,"67":0.00227,"68":0.00227,"69":0.00908,"71":0.00227,"72":0.02042,"73":0.00227,"76":0.00227,"77":0.00227,"78":0.09984,"79":0.00227,"81":0.00454,"82":0.00227,"84":0.00908,"85":0.00454,"87":0.00681,"88":0.02042,"89":0.01361,"90":0.00681,"91":0.02723,"92":0.00908,"93":0.01588,"94":0.02723,"95":0.05219,"96":0.8418,"97":1.36594,"98":0.08849,_:"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 31 32 33 38 40 42 49 50 51 53 55 59 63 64 65 70 74 75 80 83 86 99 3.5 3.6"},D:{"11":0.00454,"22":0.00227,"31":0.00227,"32":0.00681,"37":0.00681,"38":0.00681,"40":0.00227,"49":0.00908,"53":0.02723,"54":0.00227,"56":0.00454,"57":0.00227,"61":0.00454,"62":0.00454,"63":0.01135,"65":0.00681,"66":0.00227,"67":0.00454,"70":0.00454,"71":0.01361,"74":0.00681,"76":0.00454,"78":0.00681,"79":0.04311,"80":0.01361,"81":0.01361,"83":0.01361,"84":0.00908,"85":0.00908,"86":0.01588,"87":0.04765,"88":0.01588,"89":0.02042,"90":0.01361,"91":0.0295,"92":0.05673,"93":0.02269,"94":0.02496,"95":0.04765,"96":0.2927,"97":3.57821,"98":9.12819,"99":0.00454,"100":0.00454,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 33 34 35 36 39 41 42 43 44 45 46 47 48 50 51 52 55 58 59 60 64 68 69 72 73 75 77 101"},F:{"36":0.00681,"46":0.00454,"54":0.01135,"77":0.00227,"79":0.00227,"80":0.01815,"81":0.00227,"82":0.0953,"83":0.33808,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00908,"14":0.00227,"15":0.00454,"16":0.00454,"17":0.00681,"18":0.03404,"84":0.00681,"85":0.00454,"89":0.00908,"90":0.00227,"91":0.00227,"92":0.02042,"93":0.00227,"94":0.00454,"95":0.00454,"96":0.02496,"97":0.36758,"98":1.40678,_:"13 79 80 81 83 86 87 88"},E:{"4":0,"12":0.00454,"13":0.02269,"14":0.14068,"15":0.08168,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00908,"11.1":0.01135,"12.1":0.02042,"13.1":0.11118,"14.1":0.34035,"15.1":0.21102,"15.2-15.3":0.39708,"15.4":0.00454},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00233,"5.0-5.1":0.0035,"6.0-6.1":0.00233,"7.0-7.1":0.0251,"8.1-8.4":0.0035,"9.0-9.2":0.007,"9.3":0.06713,"10.0-10.2":0.00292,"10.3":0.08114,"11.0-11.2":0.01634,"11.3-11.4":0.01051,"12.0-12.1":0.00992,"12.2-12.5":0.3088,"13.0-13.1":0.01518,"13.2":0.00584,"13.3":0.03327,"13.4-13.7":0.10799,"14.0-14.4":0.31581,"14.5-14.8":0.85869,"15.0-15.1":1.16108,"15.2-15.3":2.76288,"15.4":0.03561},P:{"4":0.16332,"5.0-5.4":0.03097,"6.2-6.4":0.02048,"7.2-7.4":0.02178,"8.2":0.11355,"9.2":0.08258,"10.1":0.02048,"11.1-11.2":0.02178,"12.0":0.01089,"13.0":0.11977,"14.0":0.07621,"15.0":0.04355,"16.0":0.84925},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00394,"4.2-4.3":0.00507,"4.4":0,"4.4.3-4.4.4":0.23838},A:{"11":0.06807,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.17781},Q:{"10.4":0.03092},O:{"0":1.71628},H:{"0":0.44647},L:{"0":41.94551},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MN.js
new file mode 100644
index 0000000..b72bd3b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MN.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.04244,"72":0.00386,"78":0.01543,"81":0.01543,"84":0.00772,"87":0.00772,"88":0.01929,"89":0.01929,"90":0.00386,"91":0.01929,"92":0.00386,"94":0.00772,"95":0.01929,"96":0.58256,"97":1.19984,"98":0.05015,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 82 83 85 86 93 99 3.5 3.6"},D:{"38":0.00386,"49":0.04244,"53":0.03086,"63":0.01543,"65":0.00386,"66":0.00386,"67":0.00772,"69":0.00772,"70":0.01543,"71":0.00772,"72":0.00386,"73":0.01543,"74":0.02315,"76":0.01157,"78":0.02701,"79":0.03858,"80":0.01157,"81":0.01157,"83":0.01157,"84":0.02701,"85":0.01929,"86":0.06173,"87":0.09259,"88":0.02315,"89":0.03086,"90":0.03086,"91":0.07716,"92":0.09259,"93":0.08488,"94":0.05015,"95":0.06559,"96":0.73688,"97":6.4853,"98":19.69895,"99":0.02315,"100":0.01929,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 59 60 61 62 64 68 75 77 101"},F:{"28":0.00386,"46":0.00772,"82":0.21991,"83":0.90277,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00772,"16":0.00772,"17":0.00386,"18":0.05015,"84":0.01157,"89":0.01157,"90":0.01157,"91":0.01929,"92":0.01929,"93":0.01543,"94":0.00772,"95":0.01929,"96":0.03472,"97":0.34722,"98":2.09489,_:"13 14 15 79 80 81 83 85 86 87 88"},E:{"4":0,"13":0.01543,"14":0.20062,"15":0.09259,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1","5.1":0.00772,"10.1":0.00772,"11.1":0.02315,"12.1":0.03086,"13.1":0.06559,"14.1":0.54398,"15.1":0.28549,"15.2-15.3":0.41281,"15.4":0.01543},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00602,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.09636,"10.0-10.2":0.00201,"10.3":0.05019,"11.0-11.2":0.01606,"11.3-11.4":0.03814,"12.0-12.1":0.01606,"12.2-12.5":0.95758,"13.0-13.1":0.03212,"13.2":0.02208,"13.3":0.20075,"13.4-13.7":0.267,"14.0-14.4":1.45344,"14.5-14.8":3.27425,"15.0-15.1":4.18365,"15.2-15.3":9.34495,"15.4":0.10238},P:{"4":0.30583,"5.0-5.4":0.07136,"6.2-6.4":0.02048,"7.2-7.4":0.24466,"8.2":0.01015,"9.2":0.08155,"10.1":0.02048,"11.1-11.2":0.09175,"12.0":0.03058,"13.0":0.21408,"14.0":0.36699,"15.0":0.25486,"16.0":4.02675},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00101,"4.2-4.3":0.0037,"4.4":0,"4.4.3-4.4.4":0.01986},A:{"8":0.00817,"10":0.00408,"11":0.05719,_:"6 7 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.23958},Q:{"10.4":0.01229},O:{"0":0.11672},H:{"0":0.16284},L:{"0":37.06002},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MO.js
new file mode 100644
index 0000000..9fabf4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MO.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.07637,"52":0.03394,"75":0.00849,"77":0.00424,"81":0.00849,"84":0.00849,"87":0.00424,"88":0.00849,"91":0.01273,"93":0.01697,"94":0.05516,"95":0.02546,"96":0.35641,"97":0.68737,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 76 78 79 80 82 83 85 86 89 90 92 98 99 3.5 3.6"},D:{"22":0.05092,"26":0.05516,"30":0.01273,"34":0.09335,"38":0.16123,"45":0.00424,"47":0.02546,"49":0.08062,"53":0.09335,"55":0.04243,"57":0.00424,"58":0.02122,"61":0.09759,"62":0.02122,"63":0.00424,"65":0.02546,"66":0.00849,"67":0.03819,"68":0.07213,"69":0.0297,"70":0.02546,"71":0.06365,"72":0.02546,"73":0.03394,"74":0.04243,"75":0.02122,"76":0.03394,"77":0.02546,"78":0.0297,"79":0.44552,"80":0.06789,"81":0.04667,"83":0.02546,"84":0.01697,"85":0.00849,"86":0.0297,"87":0.13153,"88":0.00849,"89":0.0594,"90":0.01697,"91":0.05516,"92":0.21215,"93":0.0594,"94":0.11032,"95":0.13153,"96":0.7892,"97":6.61059,"98":15.20267,"99":0.00424,"100":0.01697,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 31 32 33 35 36 37 39 40 41 42 43 44 46 48 50 51 52 54 56 59 60 64 101"},F:{"28":0.00849,"36":0.03819,"46":0.08062,"70":0.01697,"82":0.02546,"83":0.17396,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00849,"18":0.06365,"95":0.01273,"96":0.01697,"97":0.53038,"98":2.34638,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94"},E:{"4":0,"11":0.00424,"12":0.00849,"13":0.17821,"14":0.82739,"15":0.35641,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.01697,"11.1":0.04243,"12.1":0.13153,"13.1":0.43703,"14.1":3.62777,"15.1":1.2432,"15.2-15.3":2.62217,"15.4":0.01273},G:{"8":0.00327,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00327,"6.0-6.1":0.06204,"7.0-7.1":0.0653,"8.1-8.4":0.05877,"9.0-9.2":0.13714,"9.3":0.30366,"10.0-10.2":0.06204,"10.3":0.35264,"11.0-11.2":0.17959,"11.3-11.4":0.20244,"12.0-12.1":0.23183,"12.2-12.5":1.69464,"13.0-13.1":0.09469,"13.2":0.03918,"13.3":0.25469,"13.4-13.7":0.67263,"14.0-14.4":1.89382,"14.5-14.8":7.16711,"15.0-15.1":3.89212,"15.2-15.3":15.1995,"15.4":0.07183},P:{"4":0.82174,"5.0-5.4":0.89089,"6.2-6.4":0.05053,"7.2-7.4":0.03115,"8.2":0.01022,"9.2":0.07569,"10.1":0.05053,"11.1-11.2":0.02077,"12.0":0.05192,"13.0":0.04325,"14.0":0.0865,"15.0":0.04325,"16.0":1.94624},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00018,"4.2-4.3":0.00053,"4.4":0,"4.4.3-4.4.4":0.01657},A:{"11":0.47522,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.17271},Q:{"10.4":0.11514},O:{"0":0.59873},H:{"0":0.0763},L:{"0":21.63894},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MP.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MP.js
new file mode 100644
index 0000000..cd0e5ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MP.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.23072,"78":0.0355,"85":0.00592,"93":0.00592,"94":0.01183,"95":0.01183,"96":0.34313,"97":0.50878,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 86 87 88 89 90 91 92 98 99 3.5 3.6"},D:{"23":0.00592,"65":0.0355,"67":0.01775,"76":0.01183,"77":0.00592,"78":0.01775,"79":0.10057,"83":0.09466,"86":0.00592,"87":0.11832,"90":0.01775,"91":0.04141,"92":0.19523,"93":0.05324,"94":0.10057,"95":0.16565,"96":1.56182,"97":11.9444,"98":24.16686,"99":0.02958,"100":0.01775,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 66 68 69 70 71 72 73 74 75 80 81 84 85 88 89 101"},F:{"82":0.34904,"83":2.63854,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01183,"96":0.0355,"97":1.04122,"98":4.48433,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95"},E:{"4":0,"12":0.00592,"13":0.11832,"14":1.26602,"15":0.19523,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 15.4","13.1":0.40229,"14.1":4.41334,"15.1":1.11812,"15.2-15.3":1.37843},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05048,"10.0-10.2":0.00235,"10.3":0.30403,"11.0-11.2":0.11621,"11.3-11.4":0.01996,"12.0-12.1":0.00939,"12.2-12.5":1.46263,"13.0-13.1":0.00822,"13.2":0.00704,"13.3":0.09273,"13.4-13.7":0.08569,"14.0-14.4":1.06469,"14.5-14.8":1.8817,"15.0-15.1":2.44515,"15.2-15.3":4.17659,"15.4":0.01056},P:{"4":0.16235,"5.0-5.4":0.01015,"6.2-6.4":0.04189,"7.2-7.4":0.15152,"8.2":0.11355,"9.2":0.0112,"10.1":0.02048,"11.1-11.2":0.02165,"12.0":0.0112,"13.0":0.02165,"14.0":0.03247,"15.0":0.03247,"16.0":4.37252},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0147,"4.4":0,"4.4.3-4.4.4":0.03431},A:{"11":0.06508,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.90256},Q:{"10.4":0},O:{"0":0.00817},H:{"0":0.07346},L:{"0":23.78834},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MQ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MQ.js
new file mode 100644
index 0000000..8f7a6a3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MQ.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00833,"60":0.02083,"78":0.04999,"82":0.12915,"83":0.00417,"84":0.00417,"89":0.01666,"91":0.04583,"92":0.00833,"94":0.03333,"95":0.03333,"96":1.82054,"97":2.51626,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 85 86 87 88 90 93 98 99 3.5 3.6"},D:{"49":0.0125,"58":0.00417,"65":0.00833,"67":0.02083,"74":0.00417,"75":0.00833,"76":0.0125,"77":0.00833,"79":0.0125,"80":0.0125,"83":0.02083,"84":0.0125,"86":0.025,"87":0.04999,"88":0.01666,"89":0.01666,"90":0.00833,"91":0.0125,"92":0.01666,"93":0.06249,"94":0.02916,"95":0.02083,"96":0.44993,"97":7.01971,"98":15.0226,"99":0.0125,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 59 60 61 62 63 64 66 68 69 70 71 72 73 78 81 85 100 101"},F:{"40":0.04999,"77":0.0125,"80":0.00833,"82":0.29162,"83":0.79571,_:"9 11 12 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 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00833,"17":0.0125,"18":0.0125,"80":0.00833,"86":0.00833,"89":0.01666,"90":0.00417,"91":0.00417,"92":0.02083,"93":0.00417,"95":0.00833,"96":0.04166,"97":1.29979,"98":4.62426,_:"13 14 15 16 79 81 83 84 85 87 88 94"},E:{"4":0,"12":0.00833,"13":0.14164,"14":0.47076,"15":0.32911,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00833,"11.1":0.01666,"12.1":0.10832,"13.1":0.42493,"14.1":1.61641,"15.1":0.65823,"15.2-15.3":0.90402,"15.4":0.0125},G:{"8":0.00319,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.0016,"9.3":0.11645,"10.0-10.2":0,"10.3":0.03828,"11.0-11.2":0.01595,"11.3-11.4":0.00798,"12.0-12.1":0.01117,"12.2-12.5":0.40518,"13.0-13.1":0.0319,"13.2":0.01117,"13.3":0.04626,"13.4-13.7":0.14835,"14.0-14.4":0.87576,"14.5-14.8":2.87771,"15.0-15.1":2.56506,"15.2-15.3":8.7448,"15.4":0.04626},P:{"4":0.07293,"5.0-5.4":0.01033,"6.2-6.4":0.02087,"7.2-7.4":0.08335,"8.2":0.01057,"9.2":0.01042,"10.1":0.01052,"11.1-11.2":0.14586,"12.0":0.06251,"13.0":0.47927,"14.0":0.47927,"15.0":0.20838,"16.0":4.53223},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.03016,"4.4":0,"4.4.3-4.4.4":0.12155},A:{"11":0.14581,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.46097},Q:{"10.4":0},O:{"0":0.01751},H:{"0":0.07734},L:{"0":35.70815},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MR.js
new file mode 100644
index 0000000..481363e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MR.js
@@ -0,0 +1 @@
+module.exports={C:{"24":0.00552,"30":0.00552,"34":0.00414,"35":0.00276,"36":0.00414,"38":0.01241,"42":0.00552,"43":0.00827,"45":0.00138,"47":0.00276,"49":0.01103,"52":0.03448,"56":0.00552,"57":0.00414,"68":0.01793,"69":0.00965,"71":0.00276,"72":0.00827,"73":0.00276,"78":0.00552,"80":0.00276,"81":0.00552,"87":0.00276,"89":0.00138,"90":0.00138,"91":0.00965,"93":0.00276,"94":0.00552,"95":0.02344,"96":0.44128,"97":0.52126,"98":0.00414,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 31 32 33 37 39 40 41 44 46 48 50 51 53 54 55 58 59 60 61 62 63 64 65 66 67 70 74 75 76 77 79 82 83 84 85 86 88 92 99 3.5 3.6"},D:{"11":0.00414,"19":0.00138,"22":0.00276,"25":0.00138,"31":0.00276,"33":0.02206,"37":0.00414,"39":0.0069,"40":0.00414,"43":0.0262,"47":0.00827,"48":0.00276,"49":0.01655,"53":0.00276,"54":0.00276,"57":0.00276,"60":0.00414,"63":0.02206,"65":0.00827,"67":0.00552,"68":0.00276,"69":0.01103,"70":0.00965,"71":0.00414,"72":0.01103,"73":0.00276,"75":0.00414,"76":0.00552,"77":0.00414,"78":0.00965,"79":0.02896,"80":0.01517,"81":0.02206,"83":0.02758,"84":0.01103,"85":0.0069,"86":0.02206,"87":0.04413,"88":0.01793,"89":0.01793,"90":0.01793,"91":0.06343,"92":0.01517,"93":0.01517,"94":0.01931,"95":0.03861,"96":0.22202,"97":2.85453,"98":5.02921,"99":0.00552,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 20 21 23 24 26 27 28 29 30 32 34 35 36 38 41 42 44 45 46 50 51 52 55 56 58 59 61 62 64 66 74 100 101"},F:{"28":0.00276,"30":0.00276,"46":0.01103,"82":0.0524,"83":0.20823,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00827,"13":0.0069,"14":0.00552,"15":0.00414,"16":0.0069,"17":0.00414,"18":0.05516,"83":0.00276,"84":0.01379,"85":0.0069,"89":0.00827,"90":0.00414,"91":0.01241,"92":0.01103,"93":0.00276,"94":0.00552,"95":0.00552,"96":0.0331,"97":0.33648,"98":1.04528,_:"79 80 81 86 87 88"},E:{"4":0,"12":0.00138,"13":0.01103,"14":0.03172,"15":0.01103,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 10.1 11.1 15.4","9.1":0.00414,"12.1":0.00414,"13.1":0.09929,"14.1":0.07309,"15.1":0.13376,"15.2-15.3":0.06757},G:{"8":0.00278,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.03062,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03758,"10.0-10.2":0.00278,"10.3":0.04175,"11.0-11.2":0.22824,"11.3-11.4":0.22129,"12.0-12.1":0.09464,"12.2-12.5":2.49537,"13.0-13.1":0.04175,"13.2":0.01809,"13.3":0.17118,"13.4-13.7":0.32706,"14.0-14.4":1.84683,"14.5-14.8":2.53573,"15.0-15.1":2.35898,"15.2-15.3":3.44314,"15.4":0.01809},P:{"4":1.124,"5.0-5.4":0.0405,"6.2-6.4":0.12151,"7.2-7.4":1.16451,"8.2":0.01057,"9.2":0.17214,"10.1":0.01052,"11.1-11.2":0.54681,"12.0":0.09114,"13.0":0.28353,"14.0":0.62782,"15.0":0.53669,"16.0":1.79233},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00031,"4.2-4.3":0.00282,"4.4":0,"4.4.3-4.4.4":0.02274},A:{"8":0.00772,"10":0.00309,"11":0.05092,_:"6 7 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.10346},Q:{"10.4":0},O:{"0":0.68114},H:{"0":0.702},L:{"0":59.89872},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MS.js
new file mode 100644
index 0000000..b093cc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MS.js
@@ -0,0 +1 @@
+module.exports={C:{"95":0.05202,"96":0.41619,"97":0.20159,"98":0.05202,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 99 3.5 3.6"},D:{"49":0.02601,"67":0.01301,"75":0.31865,"79":0.01301,"86":0.03902,"88":0.01301,"89":0.03902,"95":0.01301,"96":0.69582,"97":9.42285,"98":38.40022,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 68 69 70 71 72 73 74 76 77 78 80 81 83 84 85 87 90 91 92 93 94 99 100 101"},F:{"83":0.17558,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.03902,"89":0.07804,"93":0.01301,"96":0.05202,"97":1.073,"98":5.15688,_:"12 14 15 16 17 18 79 80 81 83 84 85 86 87 88 90 91 92 94 95"},E:{"4":0,"13":0.02601,"14":0.41619,"15":0.03902,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 12.1 13.1 15.4","11.1":0.10405,"14.1":1.073,"15.1":2.25004,"15.2-15.3":2.67924},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.01965,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.058,"10.0-10.2":0,"10.3":0.00936,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.20301,"13.0-13.1":0,"13.2":0.00936,"13.3":0.01965,"13.4-13.7":2.30704,"14.0-14.4":0.03836,"14.5-14.8":0.53045,"15.0-15.1":1.56422,"15.2-15.3":4.58602,"15.4":0.00936},P:{"4":0.01234,"5.0-5.4":0.07136,"6.2-6.4":0.02048,"7.2-7.4":0.07403,"8.2":0.01015,"9.2":0.08155,"10.1":0.02048,"11.1-11.2":0.05194,"12.0":0.01039,"13.0":0.11105,"14.0":0.08637,"15.0":0.01234,"16.0":1.66569},I:{"0":0,"3":0,"4":0.00244,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.01505},A:{_:"6 7 8 9 10 11 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.03497},Q:{"10.4":0},O:{"0":0},H:{"0":0.03311},L:{"0":23.67829},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MT.js
new file mode 100644
index 0000000..a42e809
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MT.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.03023,"68":0.03628,"76":0.00605,"78":0.01814,"82":0.00605,"89":0.04232,"91":0.01814,"94":0.01209,"95":0.03023,"96":0.57437,"97":1.17292,"98":0.01209,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 77 79 80 81 83 84 85 86 87 88 90 92 93 99 3.5 3.6"},D:{"26":0.01209,"49":0.04837,"67":0.03023,"69":0.23579,"70":0.01814,"72":0.03023,"74":0.00605,"76":0.01814,"77":0.18743,"78":0.02418,"79":0.01814,"80":0.06046,"81":0.01814,"83":0.02418,"84":0.03023,"85":0.00605,"86":0.02418,"87":0.05441,"88":0.01209,"89":0.01814,"90":0.01209,"91":0.04232,"92":0.03628,"93":0.85249,"94":0.06046,"95":0.28416,"96":0.526,"97":13.38584,"98":27.733,"99":0.01814,"100":0.01209,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 68 71 73 75 101"},F:{"28":0.00605,"37":0.01814,"46":0.00605,"67":0.27812,"82":0.40508,"83":1.15479,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01209,"18":0.01814,"92":0.01209,"95":0.01209,"96":0.03628,"97":1.39058,"98":5.30839,_:"12 13 14 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,"12":0.00605,"13":0.04837,"14":0.27207,"15":0.17533,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.06651,"12.1":0.07255,"13.1":0.31439,"14.1":1.29384,"15.1":0.91295,"15.2-15.3":1.11851},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00124,"7.0-7.1":0.00868,"8.1-8.4":0.01116,"9.0-9.2":0.0062,"9.3":0.04218,"10.0-10.2":0.00248,"10.3":0.36594,"11.0-11.2":0.00992,"11.3-11.4":0.00868,"12.0-12.1":0.02233,"12.2-12.5":0.25554,"13.0-13.1":0.00744,"13.2":0.00248,"13.3":0.01861,"13.4-13.7":0.05954,"14.0-14.4":0.67358,"14.5-14.8":2.20308,"15.0-15.1":2.06414,"15.2-15.3":6.59682,"15.4":0.0397},P:{"4":0.05367,"5.0-5.4":0.01033,"6.2-6.4":0.02087,"7.2-7.4":0.02147,"8.2":0.01057,"9.2":0.02066,"10.1":0.01052,"11.1-11.2":0.04294,"12.0":0.42355,"13.0":0.04294,"14.0":0.08588,"15.0":0.09661,"16.0":2.40453},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0041,"4.4":0,"4.4.3-4.4.4":0.06312},A:{"11":0.24789,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.18979},Q:{"10.4":0},O:{"0":0.11071},H:{"0":0.09733},L:{"0":23.75954},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MU.js
new file mode 100644
index 0000000..04ff7a5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MU.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.01427,"51":0.00357,"52":0.17126,"69":0.00357,"72":0.00714,"78":0.01784,"89":0.00357,"91":0.04995,"92":0.00714,"94":0.00714,"95":0.02141,"96":0.92054,"97":1.43077,"98":0.01784,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 90 93 99 3.5 3.6"},D:{"26":0.00714,"31":0.00357,"38":0.10704,"39":0.01427,"43":0.00357,"49":0.03211,"50":0.00714,"53":0.01784,"55":0.00714,"58":0.02141,"59":0.00357,"65":0.03211,"67":0.00357,"69":0.0107,"71":0.0107,"73":0.0107,"74":0.00357,"75":0.00714,"76":0.0107,"77":0.00714,"78":0.00714,"79":0.11774,"80":0.01427,"81":0.01784,"83":0.02141,"84":0.01427,"85":0.04282,"86":0.02141,"87":0.03925,"88":0.0107,"89":0.02141,"90":0.03925,"91":0.03925,"92":0.08206,"93":0.02498,"94":0.04638,"95":0.03211,"96":0.38534,"97":6.65075,"98":16.02389,"99":0.02498,"100":0.03925,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 32 33 34 35 36 37 40 41 42 44 45 46 47 48 51 52 54 56 57 60 61 62 63 64 66 68 70 72 101"},F:{"28":0.06779,"82":0.12488,"83":0.59942,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00357,"16":0.00714,"17":0.0107,"18":0.02854,"84":0.00357,"92":0.00714,"95":0.00714,"96":0.04282,"97":0.7243,"98":2.52258,_:"13 14 15 79 80 81 83 85 86 87 88 89 90 91 93 94"},E:{"4":0,"11":0.00714,"12":0.02498,"13":0.0107,"14":0.21051,"15":0.0999,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00714,"11.1":0.02498,"12.1":0.02498,"13.1":0.19624,"14.1":0.5352,"15.1":0.25333,"15.2-15.3":0.71717},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01444,"6.0-6.1":0.00138,"7.0-7.1":0.04332,"8.1-8.4":0.00206,"9.0-9.2":0,"9.3":0.07082,"10.0-10.2":0.00275,"10.3":0.08114,"11.0-11.2":0.00344,"11.3-11.4":0.00756,"12.0-12.1":0.011,"12.2-12.5":0.31493,"13.0-13.1":0.00825,"13.2":0.00413,"13.3":0.03369,"13.4-13.7":0.11414,"14.0-14.4":0.2056,"14.5-14.8":1.0321,"15.0-15.1":1.16756,"15.2-15.3":3.72823,"15.4":0.02819},P:{"4":0.24351,"5.0-5.4":0.0405,"6.2-6.4":0.12151,"7.2-7.4":0.23337,"8.2":0.01015,"9.2":0.03044,"10.1":0.02029,"11.1-11.2":0.14205,"12.0":0.05073,"13.0":0.23337,"14.0":0.39571,"15.0":0.20293,"16.0":4.63693},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00181,"4.2-4.3":0.00289,"4.4":0,"4.4.3-4.4.4":0.05318},A:{"8":0.00771,"10":0.00386,"11":0.22749,_:"6 7 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.23152},Q:{"10.4":0},O:{"0":0.77172},H:{"0":0.49925},L:{"0":49.25859},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MV.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MV.js
new file mode 100644
index 0000000..3c32ee1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MV.js
@@ -0,0 +1 @@
+module.exports={C:{"3":0.00288,"5":0.00288,"17":0.00576,"34":0.00576,"40":0.00288,"68":0.02879,"72":0.00576,"77":0.00576,"78":0.01152,"85":0.00576,"87":0.00288,"89":0.02591,"90":0.01152,"91":0.02015,"93":0.00576,"95":0.02015,"96":0.40594,"97":0.68808,"98":0.02015,_:"2 4 6 7 8 9 10 11 12 13 14 15 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 79 80 81 82 83 84 86 88 92 94 99 3.5","3.6":0.00576},D:{"18":0.00576,"39":0.01727,"42":0.00288,"43":0.00864,"44":0.00864,"45":0.00864,"46":0.01152,"47":0.00576,"49":0.00288,"51":0.02303,"67":0.00864,"69":0.00288,"70":0.00576,"73":0.01727,"74":0.00576,"76":0.02303,"77":0.02015,"79":0.02015,"80":0.01727,"83":0.0547,"84":0.00288,"85":0.00576,"86":0.05182,"87":0.05758,"88":0.00288,"89":0.02879,"90":0.00864,"91":0.04031,"92":0.04606,"93":0.01152,"94":0.04031,"95":0.04606,"96":0.29366,"97":6.25319,"98":13.11672,"99":0.00288,"100":0.01152,"101":0.00576,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 40 41 48 50 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 68 71 72 75 78 81"},F:{"28":0.00864,"81":0.0144,"82":0.1094,"83":0.25623,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00288,"15":0.00576,"16":0.00576,"17":0.00288,"18":0.02015,"84":0.00576,"89":0.00288,"90":0.00576,"91":0.01152,"92":0.00576,"93":0.02015,"95":0.00864,"96":0.02015,"97":0.3973,"98":1.06235,_:"13 14 79 80 81 83 85 86 87 88 94"},E:{"4":0,"9":0.04606,"13":0.01727,"14":0.10364,"15":0.09501,_:"0 5 6 7 8 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.00864,"12.1":0.02303,"13.1":0.08925,"14.1":0.38867,"15.1":0.27063,"15.2-15.3":0.39442,"15.4":0.00576},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01626,"8.1-8.4":0.00813,"9.0-9.2":0,"9.3":0.0305,"10.0-10.2":0.00203,"10.3":0.04473,"11.0-11.2":0.10572,"11.3-11.4":0.01017,"12.0-12.1":0.04676,"12.2-12.5":0.38425,"13.0-13.1":0.0244,"13.2":0.0061,"13.3":0.07116,"13.4-13.7":0.13418,"14.0-14.4":0.81932,"14.5-14.8":3.22034,"15.0-15.1":3.72657,"15.2-15.3":11.61275,"15.4":0.05286},P:{"4":0.04174,"5.0-5.4":0.0216,"6.2-6.4":0.02087,"7.2-7.4":0.06261,"8.2":0.01057,"9.2":0.01045,"10.1":0.01052,"11.1-11.2":0.04174,"12.0":0.02087,"13.0":0.05217,"14.0":0.05217,"15.0":0.09391,"16.0":1.72173},I:{"0":0,"3":0.00729,"4":0.04008,"2.1":0.00729,"2.2":0.02915,"2.3":0.0255,"4.1":0.01457,"4.2-4.3":0.04736,"4.4":0,"4.4.3-4.4.4":0.29875},A:{"7":0.00576,"8":0.05182,"9":0.01152,"10":0.00864,"11":0.06046,_:"6 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01424},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.68362},Q:{"10.4":0},O:{"0":0.86876},H:{"0":0.51911},L:{"0":46.41095},S:{"2.5":0.00712}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MW.js
new file mode 100644
index 0000000..c6b2306
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MW.js
@@ -0,0 +1 @@
+module.exports={C:{"29":0.01012,"34":0.00337,"39":0.00675,"40":0.00337,"47":0.00337,"48":0.00337,"52":0.01687,"56":0.00337,"59":0.01687,"60":0.00337,"61":0.02024,"63":0.04385,"68":0.01012,"69":0.02024,"72":0.01012,"76":0.00675,"77":0.00337,"78":0.07758,"80":0.02024,"81":0.03373,"84":0.01012,"87":0.00337,"88":0.04048,"89":0.03373,"90":0.00337,"91":0.04385,"92":0.00675,"93":0.01012,"94":0.07083,"95":0.05734,"96":1.35257,"97":2.09126,"98":0.08095,_:"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 30 31 32 33 35 36 37 38 41 42 43 44 45 46 49 50 51 53 54 55 57 58 62 64 65 66 67 70 71 73 74 75 79 82 83 85 86 99 3.5 3.6"},D:{"31":0.00337,"33":0.00337,"43":0.00675,"49":0.01349,"50":0.14504,"52":0.00337,"55":0.00675,"56":0.00675,"60":0.00675,"62":0.00337,"63":0.00675,"65":0.00675,"66":0.00675,"69":0.02361,"70":0.01012,"71":0.01012,"72":0.01687,"74":0.02698,"75":0.02361,"76":0.01012,"77":0.00675,"78":0.05734,"79":0.05734,"80":0.01687,"81":0.01349,"83":0.03036,"84":0.02024,"85":0.01012,"86":0.0506,"87":0.17877,"88":0.03373,"89":0.0371,"90":0.0371,"91":0.03373,"92":0.13829,"93":0.04385,"94":0.04385,"95":0.10794,"96":0.61726,"97":4.62438,"98":10.97574,"99":0.01012,"100":0.00337,_:"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 32 34 35 36 37 38 39 40 41 42 44 45 46 47 48 51 53 54 57 58 59 61 64 67 68 73 101"},F:{"34":0.00675,"36":0.00675,"42":0.02024,"54":0.02024,"64":0.21925,"67":0.01012,"74":0.00675,"79":0.03036,"80":0.01349,"81":0.00675,"82":0.13492,"83":0.94107,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 37 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 55 56 57 58 60 62 63 65 66 68 69 70 71 72 73 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.07083,"13":0.04048,"14":0.02698,"15":0.04048,"16":0.0506,"17":0.06071,"18":0.27659,"84":0.03036,"85":0.06071,"89":0.09444,"90":0.06071,"91":0.00675,"92":0.09782,"93":0.01012,"94":0.03373,"95":0.0506,"96":0.1754,"97":0.84662,"98":2.45892,_:"79 80 81 83 86 87 88"},E:{"4":0,"13":0.01349,"14":0.02361,"15":0.0506,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1 15.4","5.1":0.05734,"9.1":0.00337,"11.1":0.00675,"12.1":0.01349,"13.1":0.04722,"14.1":0.0877,"15.1":0.0371,"15.2-15.3":0.03036},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00023,"5.0-5.1":0.00045,"6.0-6.1":0,"7.0-7.1":0.00499,"8.1-8.4":0,"9.0-9.2":0.00385,"9.3":0.04988,"10.0-10.2":0.00068,"10.3":0.04671,"11.0-11.2":0.01088,"11.3-11.4":0.0068,"12.0-12.1":0.0093,"12.2-12.5":0.28638,"13.0-13.1":0.00612,"13.2":0.00499,"13.3":0.02154,"13.4-13.7":0.07505,"14.0-14.4":0.33332,"14.5-14.8":0.4349,"15.0-15.1":0.44805,"15.2-15.3":0.51403,"15.4":0.00794},P:{"4":0.27352,"5.0-5.4":0.0216,"6.2-6.4":0.02104,"7.2-7.4":0.11572,"8.2":0.01057,"9.2":0.07569,"10.1":0.01052,"11.1-11.2":0.07364,"12.0":0.02104,"13.0":0.18936,"14.0":0.19988,"15.0":0.263,"16.0":1.052},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00519,"4.2-4.3":0.00778,"4.4":0,"4.4.3-4.4.4":0.1063},A:{"9":0.00675,"10":0.00337,"11":0.14167,_:"6 7 8 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01988},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.21866},Q:{"10.4":0},O:{"0":6.77177},H:{"0":7.77233},L:{"0":50.43139},S:{"2.5":0.03976}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MX.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MX.js
new file mode 100644
index 0000000..1020539
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MX.js
@@ -0,0 +1 @@
+module.exports={C:{"4":0.69904,"34":0.00874,"52":0.02185,"56":0.00437,"72":0.00437,"73":0.00437,"78":0.04369,"84":0.00437,"88":0.00874,"89":0.00437,"90":0.01311,"91":0.02185,"92":0.00437,"93":0.00437,"94":0.0699,"95":0.03058,"96":0.5636,"97":0.93497,"98":0.00874,_:"2 3 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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 74 75 76 77 79 80 81 82 83 85 86 87 99 3.5 3.6"},D:{"22":0.00874,"34":0.00437,"38":0.01311,"39":0.00874,"47":0.00437,"48":0.00437,"49":0.07427,"52":0.01311,"53":0.00437,"58":0.00437,"60":0.00437,"63":0.00437,"65":0.01311,"66":0.02185,"67":0.01748,"69":0.00437,"70":0.00874,"71":0.00437,"72":0.00437,"73":0.00437,"74":0.00874,"75":0.01311,"76":0.02185,"77":0.01311,"78":0.00874,"79":0.16602,"80":0.01748,"81":0.02185,"83":0.01748,"84":0.02185,"85":0.01748,"86":0.02621,"87":0.09612,"88":0.03058,"89":0.02185,"90":0.03495,"91":0.07427,"92":0.07427,"93":0.14418,"94":0.0699,"95":0.0699,"96":0.42379,"97":8.14819,"98":21.37315,"99":0.01748,"100":0.00874,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 35 36 37 40 41 42 43 44 45 46 50 51 54 55 56 57 59 61 62 64 68 101"},F:{"82":0.3102,"83":0.93934,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01311,"15":0.00874,"16":0.00874,"17":0.00874,"18":0.02621,"85":0.00874,"89":0.00437,"90":0.00874,"91":0.00437,"92":0.00874,"94":0.00874,"95":0.0568,"96":0.03495,"97":0.88254,"98":2.60392,_:"13 14 79 80 81 83 84 86 87 88 93"},E:{"4":0,"13":0.02185,"14":0.14855,"15":0.10923,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1","5.1":0.02185,"10.1":0.00437,"11.1":0.01748,"12.1":0.03932,"13.1":0.17913,"14.1":0.5068,"15.1":0.26214,"15.2-15.3":0.55049,"15.4":0.00437},G:{"8":0.00175,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00614,"6.0-6.1":0.00175,"7.0-7.1":0.01052,"8.1-8.4":0.00263,"9.0-9.2":0.01315,"9.3":0.06925,"10.0-10.2":0.00175,"10.3":0.05435,"11.0-11.2":0.01052,"11.3-11.4":0.03506,"12.0-12.1":0.01052,"12.2-12.5":0.43305,"13.0-13.1":0.01578,"13.2":0.00438,"13.3":0.03068,"13.4-13.7":0.10695,"14.0-14.4":0.3375,"14.5-14.8":1.62087,"15.0-15.1":1.2676,"15.2-15.3":4.69782,"15.4":0.02981},P:{"4":0.12942,"5.0-5.4":0.01024,"6.2-6.4":0.02048,"7.2-7.4":0.07549,"8.2":0.01015,"9.2":0.12286,"10.1":0.02048,"11.1-11.2":0.04314,"12.0":0.01078,"13.0":0.03235,"14.0":0.04314,"15.0":0.04314,"16.0":0.89514},I:{"0":0,"3":0,"4":0.00116,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00174,"4.2-4.3":0.00348,"4.4":0,"4.4.3-4.4.4":0.03304},A:{"8":0.01885,"9":0.00942,"10":0.00942,"11":0.2026,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.17456},Q:{"10.4":0},O:{"0":0.05068},H:{"0":0.19192},L:{"0":41.32315},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MY.js
new file mode 100644
index 0000000..0bb186a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MY.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.01996,"39":0.01198,"52":0.02395,"60":0.02395,"63":0.00399,"71":0.00399,"78":0.02395,"81":0.00399,"88":0.00399,"89":0.00399,"91":0.03593,"92":0.00399,"93":0.00399,"94":0.01597,"95":0.02395,"96":0.54291,"97":0.97804,"98":0.02395,_:"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 35 36 37 38 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 64 65 66 67 68 69 70 72 73 74 75 76 77 79 80 82 83 84 85 86 87 90 99 3.5 3.6"},D:{"22":0.00798,"34":0.02395,"38":0.08782,"47":0.01198,"49":0.07186,"53":0.07585,"55":0.07186,"56":0.03194,"58":0.00399,"62":0.00798,"63":0.00399,"65":0.01198,"66":0.00399,"67":0.01198,"68":0.00798,"69":0.01597,"70":0.02794,"71":0.01198,"72":0.01597,"73":0.01597,"74":0.01597,"75":0.03194,"76":0.01198,"77":0.00798,"78":0.01996,"79":0.31138,"80":0.02395,"81":0.0519,"83":0.03992,"84":0.03593,"85":0.04391,"86":0.0519,"87":0.07984,"88":0.04391,"89":0.03992,"90":0.02395,"91":0.07984,"92":0.18363,"93":0.07186,"94":0.07585,"95":0.06387,"96":0.47904,"97":7.52492,"98":20.61469,"99":0.01198,"100":0.02395,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 48 50 51 52 54 57 59 60 61 64 101"},F:{"28":0.03194,"36":0.05589,"40":0.01198,"46":0.05589,"82":0.09581,"83":0.37924,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01198,"84":0.00399,"92":0.00399,"95":0.00399,"96":0.02395,"97":0.35529,"98":1.74051,_:"12 13 14 15 16 17 79 80 81 83 85 86 87 88 89 90 91 93 94"},E:{"4":0,"13":0.03593,"14":0.21956,"15":0.18762,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00798,"11.1":0.01597,"12.1":0.02794,"13.1":0.1477,"14.1":0.87026,"15.1":0.50698,"15.2-15.3":0.79042,"15.4":0.00399},G:{"8":0.00133,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00265,"5.0-5.1":0.0053,"6.0-6.1":0.01061,"7.0-7.1":0.02652,"8.1-8.4":0.03448,"9.0-9.2":0.02652,"9.3":0.23872,"10.0-10.2":0.02255,"10.3":0.17241,"11.0-11.2":0.02122,"11.3-11.4":0.02785,"12.0-12.1":0.03713,"12.2-12.5":0.65781,"13.0-13.1":0.03448,"13.2":0.01194,"13.3":0.07825,"13.4-13.7":0.19496,"14.0-14.4":0.70423,"14.5-14.8":2.07688,"15.0-15.1":2.5636,"15.2-15.3":6.27572,"15.4":0.03448},P:{"4":0.76275,"5.0-5.4":0.0216,"6.2-6.4":0.02104,"7.2-7.4":0.06269,"8.2":0.01057,"9.2":0.01045,"10.1":0.01052,"11.1-11.2":0.05224,"12.0":0.0209,"13.0":0.06269,"14.0":0.08359,"15.0":0.08359,"16.0":1.50461},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00698,"4.4":0,"4.4.3-4.4.4":0.02907},A:{"9":0.00577,"11":0.14992,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.01512,_:"11"},R:{_:"0"},M:{"0":0.13818},Q:{"10.4":0.00601},O:{"0":1.03938},H:{"0":0.59724},L:{"0":43.04182},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MZ.js
new file mode 100644
index 0000000..9fb039d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/MZ.js
@@ -0,0 +1 @@
+module.exports={C:{"35":0.00863,"45":0.00431,"52":0.00431,"65":0.00431,"66":0.00431,"78":0.00863,"88":0.01725,"89":0.00863,"91":0.01294,"92":0.00431,"93":0.00863,"94":0.01294,"95":0.02588,"96":0.77634,"97":1.46642,"98":0.00863,_:"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 36 37 38 39 40 41 42 43 44 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 90 99 3.5 3.6"},D:{"11":0.00431,"33":0.01725,"39":0.02157,"40":0.00863,"42":0.00431,"43":0.04744,"49":0.01294,"53":0.00431,"56":0.03882,"60":0.18115,"62":0.00431,"63":0.02157,"65":0.00431,"68":0.00431,"69":0.00863,"70":0.01725,"72":0.00431,"73":0.00431,"74":0.04744,"77":0.00863,"79":0.01725,"80":0.01725,"81":0.38817,"83":0.01294,"84":0.00431,"85":0.00431,"86":0.06901,"87":0.05176,"88":0.02157,"89":0.02157,"90":0.01725,"91":0.03882,"92":0.03019,"93":0.1984,"94":0.04744,"95":0.08626,"96":0.29328,"97":5.09365,"98":12.09797,"99":0.01294,"100":0.00431,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 41 44 45 46 47 48 50 51 52 54 55 57 58 59 61 64 66 67 71 75 76 78 101"},F:{"20":0.01725,"53":0.00863,"65":0.01294,"79":0.00863,"80":0.02157,"82":0.18115,"83":1.60012,_:"9 11 12 15 16 17 18 19 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 54 55 56 57 58 60 62 63 64 66 67 68 69 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01725,"13":0.00431,"14":0.00431,"15":0.00863,"16":0.03019,"17":0.01294,"18":0.18115,"84":0.01725,"85":0.00431,"89":0.12939,"90":0.00431,"91":0.00863,"92":0.0345,"93":0.00863,"94":0.01725,"95":0.01725,"96":0.04313,"97":0.59519,"98":1.626,_:"79 80 81 83 86 87 88"},E:{"4":0,"13":0.01294,"14":0.02588,"15":0.00863,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00863,"11.1":0.00863,"12.1":0.01294,"13.1":0.07763,"14.1":0.06901,"15.1":0.02588,"15.2-15.3":0.03882},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00176,"6.0-6.1":0.00059,"7.0-7.1":0.03515,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02753,"10.0-10.2":0.00234,"10.3":0.11423,"11.0-11.2":0.01172,"11.3-11.4":0.06326,"12.0-12.1":0.02929,"12.2-12.5":1.80829,"13.0-13.1":0.13707,"13.2":0.06444,"13.3":0.05213,"13.4-13.7":0.18042,"14.0-14.4":0.5395,"14.5-14.8":0.71816,"15.0-15.1":0.62971,"15.2-15.3":1.43749,"15.4":0.00351},P:{"4":1.32129,"5.0-5.4":0.03097,"6.2-6.4":0.02048,"7.2-7.4":0.20645,"8.2":0.11355,"9.2":0.08258,"10.1":0.02048,"11.1-11.2":0.17548,"12.0":0.12387,"13.0":0.07226,"14.0":0.19613,"15.0":0.08258,"16.0":0.67097},I:{"0":0,"3":0,"4":0.00023,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00085,"4.2-4.3":0.00271,"4.4":0,"4.4.3-4.4.4":0.03032},A:{"11":0.1984,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.03412},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.07392},Q:{"10.4":0.00569},O:{"0":0.21038},H:{"0":5.0117},L:{"0":58.17232},S:{"2.5":0.03412}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NA.js
new file mode 100644
index 0000000..60a3ff3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NA.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.01641,"37":0.0041,"47":0.00821,"49":0.00821,"52":0.09847,"56":0.0041,"60":0.0041,"72":0.0041,"78":0.02872,"82":0.01231,"83":0.01231,"84":0.01231,"86":0.0041,"87":0.01231,"89":0.0041,"91":0.02462,"94":0.00821,"95":0.02462,"96":0.86573,"97":1.45246,"98":0.02052,_:"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 35 36 38 39 40 41 42 43 44 45 46 48 50 51 53 54 55 57 58 59 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 85 88 90 92 93 99 3.5 3.6"},D:{"36":0.00821,"37":0.0041,"38":0.01231,"39":0.0041,"40":0.0041,"48":0.01641,"49":0.04924,"55":0.01231,"63":0.01231,"69":0.02462,"70":0.00821,"71":0.02872,"72":0.00821,"73":0.0041,"75":0.01641,"76":0.01231,"78":0.0041,"79":0.01641,"80":0.01231,"81":0.02462,"83":0.01641,"84":0.02462,"85":0.01231,"86":0.04103,"87":0.02462,"88":0.02462,"89":0.01641,"90":0.03282,"91":0.03693,"92":0.05334,"93":0.04103,"94":0.09437,"95":0.07796,"96":0.2749,"97":6.63455,"98":16.28481,"99":0.0041,"100":0.0041,_:"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 41 42 43 44 45 46 47 50 51 52 53 54 56 57 58 59 60 61 62 64 65 66 67 68 74 77 101"},F:{"79":0.01231,"81":0.0041,"82":0.09847,"83":0.84932,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.03282,"13":0.02052,"14":0.01231,"15":0.02462,"16":0.02462,"17":0.04924,"18":0.09847,"80":0.00821,"81":0.01641,"84":0.02872,"85":0.00821,"88":0.0041,"89":0.01641,"90":0.00821,"91":0.0041,"92":0.04103,"93":0.01231,"94":0.01641,"95":0.03282,"96":0.4062,"97":1.02985,"98":3.37677,_:"79 83 86 87"},E:{"4":0,"12":0.01641,"13":0.01231,"14":0.08206,"15":0.11078,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.00821,"11.1":0.02052,"12.1":0.02462,"13.1":0.10668,"14.1":0.31593,"15.1":0.22156,"15.2-15.3":0.51698},G:{"8":0,"3.2":0,"4.0-4.1":0.00067,"4.2-4.3":0,"5.0-5.1":0.00399,"6.0-6.1":0.01332,"7.0-7.1":0.01864,"8.1-8.4":0.01531,"9.0-9.2":0.00067,"9.3":0.0526,"10.0-10.2":0,"10.3":0.07057,"11.0-11.2":0.01065,"11.3-11.4":0.00266,"12.0-12.1":0.01332,"12.2-12.5":0.47536,"13.0-13.1":0.01465,"13.2":0.00466,"13.3":0.06192,"13.4-13.7":0.08855,"14.0-14.4":0.5446,"14.5-14.8":1.14313,"15.0-15.1":1.44805,"15.2-15.3":2.66641,"15.4":0.00799},P:{"4":0.48383,"5.0-5.4":0.03097,"6.2-6.4":0.02048,"7.2-7.4":0.7309,"8.2":0.11355,"9.2":0.08258,"10.1":0.02048,"11.1-11.2":0.21618,"12.0":0.02059,"13.0":0.15441,"14.0":0.26765,"15.0":0.23677,"16.0":2.66623},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00077,"4.2-4.3":0.00294,"4.4":0,"4.4.3-4.4.4":0.02578},A:{"9":0.00843,"11":0.76293,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.56611},Q:{"10.4":0},O:{"0":0.65457},H:{"0":1.7642},L:{"0":49.09273},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NC.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NC.js
new file mode 100644
index 0000000..0b74bd3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NC.js
@@ -0,0 +1 @@
+module.exports={C:{"45":0.02514,"48":0.00359,"52":0.14368,"56":0.26222,"60":0.01078,"68":0.01796,"78":0.25503,"80":0.00718,"84":0.00359,"87":0.02155,"88":0.00718,"89":0.01078,"91":0.10417,"92":0.00359,"93":0.00359,"94":0.02155,"95":0.03951,"96":2.18034,"97":3.10349,"98":0.00359,_:"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 40 41 42 43 44 46 47 49 50 51 53 54 55 57 58 59 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 81 82 83 85 86 90 99 3.5 3.6"},D:{"49":0.10776,"63":0.12213,"65":0.01078,"67":0.00359,"70":0.00359,"71":0.00359,"74":0.03592,"75":0.00359,"76":0.19397,"77":0.00359,"78":0.00718,"79":0.03233,"80":0.01078,"81":0.00359,"83":0.00718,"85":0.01796,"86":0.0431,"87":0.05388,"89":0.01078,"90":0.02155,"91":0.00718,"92":0.02514,"93":0.05747,"94":0.05029,"95":0.25503,"96":0.21193,"97":5.26587,"98":12.11222,"99":0.00359,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 66 68 69 72 73 84 88 100 101"},F:{"36":0.00359,"82":0.32328,"83":0.34124,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00718,"15":0.01796,"17":0.00718,"18":0.02514,"84":0.00718,"85":0.02155,"89":0.00718,"91":0.02514,"94":0.00359,"95":0.00718,"96":0.05029,"97":0.84412,"98":2.81972,_:"12 13 16 79 80 81 83 86 87 88 90 92 93"},E:{"4":0,"12":0.0467,"13":0.06825,"14":0.16882,"15":0.10417,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.02874,"11.1":0.12931,"12.1":0.10417,"13.1":0.33765,"14.1":1.52301,"15.1":0.44182,"15.2-15.3":1.0776,"15.4":0.01078},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00223,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03683,"10.0-10.2":0.00446,"10.3":0.13281,"11.0-11.2":0.01228,"11.3-11.4":0.125,"12.0-12.1":0.02009,"12.2-12.5":0.99103,"13.0-13.1":0.02009,"13.2":0.00112,"13.3":0.14508,"13.4-13.7":0.24553,"14.0-14.4":0.39396,"14.5-14.8":1.73096,"15.0-15.1":1.3783,"15.2-15.3":5.90157,"15.4":0.01674},P:{"4":0.1143,"5.0-5.4":0.01015,"6.2-6.4":0.02048,"7.2-7.4":0.99755,"8.2":0.11355,"9.2":0.02078,"10.1":0.02048,"11.1-11.2":0.4676,"12.0":0.04156,"13.0":0.239,"14.0":0.22861,"15.0":0.24939,"16.0":3.67848},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00034,"4.4":0,"4.4.3-4.4.4":0.0253},A:{"9":0.00718,"11":0.21552,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.44222},Q:{"10.4":0},O:{"0":0.0705},H:{"0":0.03034},L:{"0":27.45535},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NE.js
new file mode 100644
index 0000000..d83a475
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NE.js
@@ -0,0 +1 @@
+module.exports={C:{"33":0.00316,"34":0.00316,"35":0.00316,"37":0.00316,"45":0.00316,"47":0.00475,"49":0.01107,"52":0.00475,"56":0.00475,"57":0.00316,"60":0.00316,"63":0.00316,"67":0.00633,"68":0.00316,"72":0.00791,"75":0.00475,"77":0.00158,"78":0.00475,"80":0.00158,"84":0.00158,"85":0.00316,"88":0.00475,"89":0.02689,"91":0.02215,"92":0.00158,"93":0.0174,"94":0.03639,"95":0.04113,"96":0.97768,"97":1.32413,"98":0.02689,_:"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 36 38 39 40 41 42 43 44 46 48 50 51 53 54 55 58 59 61 62 64 65 66 69 70 71 73 74 76 79 81 82 83 86 87 90 99 3.5 3.6"},D:{"33":0.00475,"37":0.00949,"43":0.00316,"48":0.00316,"49":0.01107,"57":0.00158,"58":0.02531,"59":0.00316,"60":0.00316,"63":0.00791,"65":0.00316,"66":0.00633,"67":0.02848,"69":0.02848,"70":0.01898,"71":0.01424,"75":0.00633,"78":0.00475,"79":0.27052,"80":0.00475,"81":0.06486,"83":0.00949,"84":0.00316,"86":0.00475,"87":0.0174,"88":0.01424,"89":0.01424,"90":0.01266,"91":0.0174,"92":0.03006,"93":0.01266,"94":0.01424,"95":0.01582,"96":0.09492,"97":2.07084,"98":3.762,"99":0.00475,"100":0.01424,_:"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 34 35 36 38 39 40 41 42 44 45 46 47 50 51 52 53 54 55 56 61 62 64 68 72 73 74 76 77 85 101"},F:{"12":0.00633,"40":0.00475,"42":0.00158,"45":0.00949,"47":0.00158,"79":0.00158,"80":0.00158,"81":0.01266,"82":0.04904,"83":0.24205,_:"9 11 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 41 43 44 46 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.08543,"13":0.01582,"14":0.01107,"15":0.00475,"16":0.01898,"17":0.01266,"18":0.11865,"84":0.02689,"85":0.01107,"87":0.00158,"89":0.00475,"90":0.00791,"91":0.01107,"92":0.02689,"93":0.04588,"94":0.00158,"95":0.02215,"96":0.64229,"97":0.45562,"98":1.03621,_:"79 80 81 83 86 88"},E:{"4":0,"8":0.00633,"13":0.00949,"14":0.02531,"15":0.00791,_:"0 5 6 7 9 10 11 12 3.1 3.2 6.1 7.1 15.4","5.1":0.00316,"9.1":0.00316,"10.1":0.00158,"11.1":0.01582,"12.1":0.00791,"13.1":0.0174,"14.1":0.04746,"15.1":0.03955,"15.2-15.3":0.04746},G:{"8":0.00071,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00707,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01202,"10.0-10.2":0,"10.3":0.03252,"11.0-11.2":0.04242,"11.3-11.4":0.09968,"12.0-12.1":0.07635,"12.2-12.5":0.7013,"13.0-13.1":0.01485,"13.2":0.01202,"13.3":0.03464,"13.4-13.7":0.21704,"14.0-14.4":1.26899,"14.5-14.8":1.74194,"15.0-15.1":1.53693,"15.2-15.3":1.26899,"15.4":0.00283},P:{"4":0.29325,"5.0-5.4":0.01015,"6.2-6.4":0.04189,"7.2-7.4":0.07331,"8.2":0.11355,"9.2":0.07331,"10.1":0.02048,"11.1-11.2":0.02095,"12.0":0.06167,"13.0":0.04189,"14.0":0.05237,"15.0":0.14662,"16.0":0.62838},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02221,"4.2-4.3":0.01428,"4.4":0,"4.4.3-4.4.4":0.56954},A:{"9":0.02774,"11":0.3203,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00842},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.0505},Q:{"10.4":0.14309},O:{"0":1.81807},H:{"0":3.80106},L:{"0":71.13845},S:{"2.5":0.00842}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NF.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NF.js
new file mode 100644
index 0000000..14cb7ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NF.js
@@ -0,0 +1 @@
+module.exports={C:{"95":0.52157,"96":4.16053,"97":7.80549,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 98 99 3.5 3.6"},D:{"81":0.25779,"95":0.13189,"96":1.04313,"97":9.2323,"98":21.588,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 83 84 85 86 87 88 89 90 91 92 93 94 99 100 101"},F:{_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.25779,"97":0.77935,"98":2.60183,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96"},E:{"4":0,"13":0.25779,"14":0.38968,"15":0.77935,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 15.4","13.1":2.46994,"14.1":1.04313,"15.1":0.77935,"15.2-15.3":0.64746},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.12026,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.72155,"14.5-14.8":1.80231,"15.0-15.1":3.12359,"15.2-15.3":9.8518,"15.4":0},P:{"4":0.29325,"5.0-5.4":0.01015,"6.2-6.4":0.04189,"7.2-7.4":0.03361,"8.2":0.11355,"9.2":0.0112,"10.1":0.02048,"11.1-11.2":0.03361,"12.0":0.0112,"13.0":0.05602,"14.0":0.26539,"15.0":0.08963,"16.0":1.20445},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.52157,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0},H:{"0":0.12513},L:{"0":25.03011},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NG.js
new file mode 100644
index 0000000..6433a07
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NG.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00252,"43":0.02644,"47":0.01007,"48":0.00126,"52":0.01259,"56":0.00252,"57":0.00252,"58":0.00252,"61":0.00126,"65":0.00504,"68":0.00252,"72":0.01007,"77":0.00504,"78":0.01007,"79":0.00252,"80":0.00252,"81":0.00252,"82":0.00504,"83":0.00126,"84":0.00378,"85":0.00378,"86":0.00378,"87":0.00252,"88":0.00504,"89":0.0063,"90":0.00378,"91":0.01511,"92":0.00755,"93":0.00504,"94":0.01259,"95":0.03022,"96":0.45576,"97":0.73652,"98":0.05917,_:"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 35 36 37 38 39 40 41 42 44 45 46 49 50 51 53 54 55 59 60 62 63 64 66 67 69 70 71 73 74 75 76 99 3.5 3.6"},D:{"38":0.00378,"39":0.00126,"47":0.01385,"49":0.00378,"50":0.00252,"53":0.00252,"55":0.0063,"56":0.00378,"57":0.00252,"58":0.01007,"62":0.00755,"63":0.00378,"64":0.00881,"65":0.00126,"66":0.00126,"68":0.00378,"69":0.05917,"70":0.01007,"71":0.00378,"72":0.00252,"73":0.00252,"74":0.00755,"75":0.00755,"76":0.00881,"77":0.01259,"78":0.00378,"79":0.0214,"80":0.03022,"81":0.01637,"83":0.01385,"84":0.01007,"85":0.00881,"86":0.03525,"87":0.03651,"88":0.01637,"89":0.01889,"90":0.01889,"91":0.08561,"92":0.03148,"93":0.03273,"94":0.03148,"95":0.04281,"96":0.19515,"97":1.86836,"98":3.74301,"99":0.00755,"100":0.0063,_:"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 40 41 42 43 44 45 46 48 51 52 54 59 60 61 67 101"},F:{"36":0.01133,"65":0.00504,"66":0.00252,"67":0.00378,"79":0.00881,"80":0.02518,"81":0.00126,"82":0.04407,"83":0.26187,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 68 69 70 71 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01385,"13":0.00252,"14":0.00126,"15":0.00378,"16":0.00378,"17":0.00378,"18":0.03022,"84":0.0063,"85":0.00504,"88":0.0063,"89":0.00504,"90":0.00378,"91":0.00252,"92":0.00881,"93":0.00252,"94":0.00378,"95":0.00755,"96":0.02644,"97":0.22536,"98":0.57159,_:"79 80 81 83 86 87"},E:{"4":0,"11":0.00126,"12":0.00378,"13":0.01133,"14":0.03777,"15":0.01133,_:"0 5 6 7 8 9 10 3.1 3.2 6.1 7.1 9.1 15.4","5.1":0.01259,"10.1":0.00252,"11.1":0.00378,"12.1":0.00504,"13.1":0.02392,"14.1":0.06925,"15.1":0.03148,"15.2-15.3":0.0491},G:{"8":0.00061,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00122,"6.0-6.1":0,"7.0-7.1":0.00367,"8.1-8.4":0,"9.0-9.2":0.00122,"9.3":0.0165,"10.0-10.2":0.00244,"10.3":0.04521,"11.0-11.2":0.10081,"11.3-11.4":0.03177,"12.0-12.1":0.03727,"12.2-12.5":0.71792,"13.0-13.1":0.07637,"13.2":0.02383,"13.3":0.13564,"13.4-13.7":0.2609,"14.0-14.4":1.17617,"14.5-14.8":1.20916,"15.0-15.1":1.06313,"15.2-15.3":1.20122,"15.4":0.00489},P:{"4":0.29325,"5.0-5.4":0.01015,"6.2-6.4":0.04189,"7.2-7.4":0.03361,"8.2":0.11355,"9.2":0.0112,"10.1":0.02048,"11.1-11.2":0.03361,"12.0":0.0112,"13.0":0.05602,"14.0":0.10083,"15.0":0.08963,"16.0":0.45933},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00082,"4.2-4.3":0.00082,"4.4":0,"4.4.3-4.4.4":0.03333},A:{"8":0.00278,"9":0.00278,"10":0.00139,"11":0.03334,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00874},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.27097},Q:{"10.4":0},O:{"0":1.07514},H:{"0":41.55913},L:{"0":37.70243},S:{"2.5":0.00874}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NI.js
new file mode 100644
index 0000000..07f2d0e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NI.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.03156,"69":0.00395,"72":0.00395,"78":0.00395,"84":0.00395,"85":0.01184,"87":0.00395,"88":0.0434,"89":0.02367,"90":0.01973,"91":0.03156,"92":0.03156,"93":0.00789,"94":0.01973,"95":0.25643,"96":1.72002,"97":2.1303,"98":0.00789,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 70 71 73 74 75 76 77 79 80 81 82 83 86 99 3.5 3.6"},D:{"38":0.01184,"42":0.00789,"49":0.02762,"56":0.00395,"58":0.01184,"63":0.00789,"65":0.00395,"66":0.00789,"69":0.00789,"70":0.01184,"71":0.00395,"72":0.01184,"73":0.00395,"74":0.01973,"75":0.05129,"76":0.02367,"77":0.00395,"78":0.00789,"79":0.10257,"80":0.03156,"81":0.02367,"83":0.01578,"84":0.01184,"85":0.01184,"86":0.01973,"87":0.0434,"88":0.03551,"89":0.20909,"90":0.05129,"91":0.05918,"92":0.04734,"93":0.03156,"94":0.05918,"95":0.06707,"96":0.40239,"97":7.74009,"98":17.98131,"99":0.01578,"100":0.00789,_:"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 39 40 41 43 44 45 46 47 48 50 51 52 53 54 55 57 59 60 61 62 64 67 68 101"},F:{"36":0.00395,"79":0.00789,"82":0.27615,"83":0.89157,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00395,"18":0.02762,"84":0.00789,"85":0.00395,"89":0.01184,"90":0.01578,"92":0.01973,"94":0.00395,"95":0.01578,"96":0.03551,"97":0.48524,"98":1.64507,_:"13 14 15 16 17 79 80 81 83 86 87 88 91 93"},E:{"4":0,"12":0.01184,"13":0.03551,"14":0.05918,"15":0.03945,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1 10.1 11.1 15.4","5.1":0.0434,"12.1":0.01184,"13.1":0.09074,"14.1":0.14597,"15.1":0.08285,"15.2-15.3":0.10652},G:{"8":0,"3.2":0,"4.0-4.1":0.0017,"4.2-4.3":0,"5.0-5.1":0.00284,"6.0-6.1":0,"7.0-7.1":0.02497,"8.1-8.4":0,"9.0-9.2":0.00114,"9.3":0.0874,"10.0-10.2":0.0017,"10.3":0.02327,"11.0-11.2":0.01873,"11.3-11.4":0.00738,"12.0-12.1":0.00624,"12.2-12.5":0.3723,"13.0-13.1":0.00908,"13.2":0.00568,"13.3":0.06243,"13.4-13.7":0.07605,"14.0-14.4":0.34619,"14.5-14.8":0.97841,"15.0-15.1":0.85526,"15.2-15.3":2.76384,"15.4":0.02894},P:{"4":0.27753,"5.0-5.4":0.01015,"6.2-6.4":0.02056,"7.2-7.4":0.32893,"8.2":0.11355,"9.2":0.07195,"10.1":0.02048,"11.1-11.2":0.27753,"12.0":0.06167,"13.0":0.16446,"14.0":0.25698,"15.0":0.2467,"16.0":2.16888},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00202,"4.2-4.3":0.01514,"4.4":0,"4.4.3-4.4.4":0.09183},A:{"11":0.08679,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.12716},Q:{"10.4":0},O:{"0":0.13927},H:{"0":0.33248},L:{"0":49.83656},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NL.js
new file mode 100644
index 0000000..2e013cc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NL.js
@@ -0,0 +1 @@
+module.exports={C:{"11":0.01047,"52":0.02617,"55":0.00523,"56":0.0157,"60":0.01047,"66":0.01047,"74":0.01047,"78":0.05756,"80":0.00523,"81":0.0157,"83":0.00523,"84":0.0157,"87":0.00523,"88":0.02093,"89":0.00523,"90":0.00523,"91":0.07326,"92":0.00523,"93":0.00523,"94":0.05233,"95":0.09419,"96":1.18266,"97":1.89958,"98":0.01047,_:"2 3 4 5 6 7 8 9 10 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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 57 58 59 61 62 63 64 65 67 68 69 70 71 72 73 75 76 77 79 82 85 86 99 3.5 3.6"},D:{"15":0.04186,"47":0.05233,"48":0.01047,"49":0.03663,"52":0.0628,"53":0.01047,"63":0.00523,"64":0.08896,"65":0.00523,"66":0.0157,"67":0.01047,"69":0.07326,"70":0.11513,"72":0.10466,"73":0.01047,"74":0.01047,"75":0.01047,"76":0.02093,"77":0.0157,"78":0.0157,"79":0.22502,"80":0.11513,"81":0.02093,"83":0.0471,"84":0.07326,"85":0.0785,"86":0.06803,"87":0.14129,"88":0.0314,"89":0.04186,"90":0.04186,"91":0.0785,"92":0.22502,"93":0.81112,"94":0.20932,"95":0.18839,"96":0.68029,"97":10.11539,"98":18.36783,"99":0.01047,"100":0.01047,_:"4 5 6 7 8 9 10 11 12 13 14 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 50 51 54 55 56 57 58 59 60 61 62 68 71 101"},F:{"67":0.01047,"80":0.00523,"82":0.17269,"83":0.64889,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00523,"18":0.02617,"89":0.00523,"90":0.00523,"91":0.00523,"92":0.0157,"93":0.00523,"94":0.0157,"95":0.0314,"96":0.0785,"97":1.51757,"98":5.10218,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88"},E:{"4":0,"12":0.00523,"13":0.0628,"14":0.38201,"15":0.24595,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.00523,"10.1":0.00523,"11.1":0.03663,"12.1":0.06803,"13.1":0.41864,"14.1":1.46001,"15.1":0.79018,"15.2-15.3":1.78445,"15.4":0.0157},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.0018,"7.0-7.1":0.00361,"8.1-8.4":0.00541,"9.0-9.2":0.06133,"9.3":0.07575,"10.0-10.2":0,"10.3":0.10642,"11.0-11.2":0.01263,"11.3-11.4":0.03247,"12.0-12.1":0.01263,"12.2-12.5":0.62768,"13.0-13.1":0.02345,"13.2":0.00902,"13.3":0.05772,"13.4-13.7":0.1966,"14.0-14.4":0.70704,"14.5-14.8":3.30795,"15.0-15.1":2.57746,"15.2-15.3":10.16195,"15.4":0.0469},P:{"4":0.11614,_:"5.0-5.4 6.2-6.4 7.2-7.4 8.2 9.2 10.1","11.1-11.2":0.01056,"12.0":0.02112,"13.0":0.07391,"14.0":0.07391,"15.0":0.08447,"16.0":4.44511},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00468,"4.2-4.3":0.00562,"4.4":0,"4.4.3-4.4.4":0.04215},A:{"8":0.02528,"9":0.05898,"10":0.00843,"11":0.40445,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.40528},Q:{"10.4":0.00477},O:{"0":0.43389},H:{"0":0.30244},L:{"0":23.61706},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NO.js
new file mode 100644
index 0000000..f9b0732
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NO.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01269,"59":0.01903,"78":0.0444,"88":0.00634,"91":0.06977,"94":0.00634,"95":0.03172,"96":3.05098,"97":2.96218,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 89 90 92 93 98 99 3.5 3.6"},D:{"38":0.00634,"49":0.03172,"64":0.02537,"65":0.00634,"66":0.08246,"67":0.01269,"69":0.12686,"70":0.02537,"72":0.02537,"75":0.02537,"76":0.19029,"77":0.00634,"78":0.01269,"79":0.08246,"80":0.05709,"81":0.01269,"83":0.01269,"84":0.03172,"85":2.76555,"86":0.03172,"87":0.12686,"88":0.03172,"89":0.03172,"90":0.07612,"91":0.08246,"92":0.06343,"93":0.08246,"94":0.13955,"95":0.90705,"96":1.00854,"97":11.97558,"98":20.08828,"99":0.00634,"100":0.01903,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 68 71 73 74 101"},F:{"82":0.37424,"83":0.93876,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.01269,"18":0.01269,"84":0.01903,"85":0.05074,"86":0.00634,"87":0.00634,"89":0.01269,"91":0.00634,"92":0.01269,"94":0.01903,"95":0.02537,"96":0.06343,"97":1.60478,"98":5.02366,_:"12 13 14 15 16 79 80 81 83 88 90 93"},E:{"4":0,"12":0.00634,"13":0.12052,"14":0.50744,"15":0.35521,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.00634,"10.1":0.00634,"11.1":0.03172,"12.1":0.07612,"13.1":0.41864,"14.1":2.51183,"15.1":1.39546,"15.2-15.3":2.13125,"15.4":0.00634},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00215,"9.0-9.2":0.00215,"9.3":0.04522,"10.0-10.2":0.00215,"10.3":0.09043,"11.0-11.2":0.01723,"11.3-11.4":0.05383,"12.0-12.1":0.01507,"12.2-12.5":0.4134,"13.0-13.1":0.02584,"13.2":0.00646,"13.3":0.05813,"13.4-13.7":0.14211,"14.0-14.4":0.74498,"14.5-14.8":4.31273,"15.0-15.1":3.32229,"15.2-15.3":12.21259,"15.4":0.04737},P:{"4":0.0423,"5.0-5.4":0.01015,"6.2-6.4":0.04189,"7.2-7.4":0.15152,"8.2":0.11355,"9.2":0.0112,"10.1":0.02048,"11.1-11.2":0.02115,"12.0":0.0112,"13.0":0.02115,"14.0":0.03172,"15.0":0.03172,"16.0":2.38991},I:{"0":0,"3":0,"4":0.0026,"2.1":0,"2.2":0.00195,"2.3":0.00195,"4.1":0.0026,"4.2-4.3":0.0065,"4.4":0,"4.4.3-4.4.4":0.01365},A:{"8":0.04229,"9":0.00705,"10":0.0141,"11":0.25372,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.20479},Q:{"10.4":0},O:{"0":0.01829},H:{"0":0.14541},L:{"0":12.12816},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NP.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NP.js
new file mode 100644
index 0000000..5dffd89
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NP.js
@@ -0,0 +1 @@
+module.exports={C:{"28":0.00216,"47":0.00216,"48":0.00216,"52":0.00864,"66":0.00432,"71":0.0389,"72":0.01297,"73":0.01081,"74":0.01081,"75":0.01945,"76":0.05619,"78":0.04106,"87":0.50135,"88":0.00432,"89":0.00648,"90":0.00216,"91":0.01513,"92":0.00216,"94":0.00432,"95":0.03025,"96":0.35224,"97":0.65911,"98":0.04754,_:"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 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 67 68 69 70 77 79 80 81 82 83 84 85 86 93 99 3.5 3.6"},D:{"38":0.00432,"49":0.00648,"53":0.00216,"63":0.00648,"64":0.00432,"65":0.00864,"67":0.00432,"68":0.00216,"69":0.00432,"70":0.00432,"71":0.00216,"72":0.00216,"73":0.00216,"74":0.00432,"75":0.00432,"76":0.01729,"78":0.00432,"79":0.02161,"80":0.00648,"81":0.00648,"83":0.01297,"84":0.03242,"85":0.00648,"86":0.01513,"87":0.02593,"88":0.02161,"89":0.97461,"90":0.01297,"91":0.01729,"92":0.02377,"93":0.02377,"94":0.01513,"95":0.04106,"96":0.22474,"97":4.20963,"98":10.50678,"99":0.05835,"100":0.01945,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 59 60 61 62 66 77 101"},F:{"63":0.01081,"75":0.03242,"82":0.05619,"83":0.38682,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 64 65 66 67 68 69 70 71 72 73 74 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00216,"16":0.00216,"17":0.00216,"18":0.00864,"81":0.01513,"89":0.31983,"92":0.00432,"93":0.00432,"95":0.00432,"96":0.01513,"97":0.255,"98":0.83631,_:"13 14 15 79 80 83 84 85 86 87 88 90 91 94"},E:{"4":0,"8":0.00432,"9":0.00216,"13":0.00432,"14":0.05403,"15":0.01513,_:"0 5 6 7 10 11 12 3.1 3.2 5.1 6.1 7.1 15.4","9.1":0.00432,"10.1":0.00216,"11.1":0.00432,"12.1":0.00864,"13.1":0.02161,"14.1":0.09508,"15.1":0.04106,"15.2-15.3":0.0886},G:{"8":0.0023,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00092,"6.0-6.1":0.00046,"7.0-7.1":0.00965,"8.1-8.4":0.00184,"9.0-9.2":0.00322,"9.3":0.02574,"10.0-10.2":0.0023,"10.3":0.04045,"11.0-11.2":0.27395,"11.3-11.4":0.01241,"12.0-12.1":0.02298,"12.2-12.5":0.42149,"13.0-13.1":0.05378,"13.2":0.0046,"13.3":0.0239,"13.4-13.7":0.0717,"14.0-14.4":0.62511,"14.5-14.8":0.75243,"15.0-15.1":0.48814,"15.2-15.3":1.74618,"15.4":0.01011},P:{"4":0.14128,"5.0-5.4":0.01015,"6.2-6.4":0.02048,"7.2-7.4":0.05434,"8.2":0.11355,"9.2":0.08258,"10.1":0.02048,"11.1-11.2":0.02174,"12.0":0.02174,"13.0":0.05434,"14.0":0.04347,"15.0":0.04347,"16.0":0.57599},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0016,"4.2-4.3":0.00561,"4.4":0,"4.4.3-4.4.4":0.06334},A:{"6":0.00216,"11":0.01081,_:"7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.65848},Q:{"10.4":0},O:{"0":1.07394},H:{"0":0.86831},L:{"0":69.56896},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NR.js
new file mode 100644
index 0000000..f8c464a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NR.js
@@ -0,0 +1 @@
+module.exports={C:{"96":0.2029,"97":0.03689,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 98 99 3.5 3.6"},D:{"11":0.02372,"75":0.03689,"79":0.01318,"86":0.01318,"89":0.01318,"96":0.888,"97":2.9512,"98":9.57559,_:"4 5 6 7 8 9 10 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 76 77 78 80 81 83 84 85 87 88 90 91 92 93 94 95 99 100 101"},F:{"83":0.06061,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.02372,"84":0.03689,"94":0.02372,"96":0.03689,"97":0.25296,"98":1.09089,_:"12 13 15 16 17 18 79 80 81 83 85 86 87 88 89 90 91 92 93 95"},E:{"4":0,"11":0.08432,"13":0.03689,"14":6.93532,_:"0 5 6 7 8 9 10 12 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 12.1 13.1 15.1 15.2-15.3 15.4","11.1":0.06061,"14.1":1.14096},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.01067,"12.0-12.1":0,"12.2-12.5":0.01067,"13.0-13.1":0.03155,"13.2":0.02088,"13.3":0,"13.4-13.7":0.36702,"14.0-14.4":0.18931,"14.5-14.8":1.91073,"15.0-15.1":1.12287,"15.2-15.3":0.97625,"15.4":0},P:{"4":0.02031,"5.0-5.4":0.01015,"6.2-6.4":0.02048,"7.2-7.4":0.02031,"8.2":0.11355,"9.2":0.08258,"10.1":0.02048,"11.1-11.2":0.21618,"12.0":0.02059,"13.0":0.11169,"14.0":0.12184,"15.0":0.01015,"16.0":0.75137},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.16864,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.01473},Q:{"10.4":0},O:{"0":0.86171},H:{"0":6.83325},L:{"0":62.07733},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NU.js
new file mode 100644
index 0000000..55b5be9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NU.js
@@ -0,0 +1 @@
+module.exports={C:{_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 3.5 3.6"},D:{"81":4.4448,"98":31.1136,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 99 100 101"},F:{"83":2.2224,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"98":2.2224,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97"},E:{"4":0,"14":4.4448,_:"0 5 6 7 8 9 10 11 12 13 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1 15.1 15.2-15.3 15.4"},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":6.66511,"13.0-13.1":0,"13.2":2.22222,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":2.22222,"15.0-15.1":0,"15.2-15.3":2.22222,"15.4":2.22222},P:{"4":0.29325,"5.0-5.4":0.01015,"6.2-6.4":0.04189,"7.2-7.4":0.03361,"8.2":0.11355,"9.2":0.0112,"10.1":0.02048,"11.1-11.2":0.03361,"12.0":0.0112,"13.0":0.05602,"14.0":0.10083,"15.0":0.08963,"16.0":0.45933},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":6.6672,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0},H:{"0":0},L:{"0":28.886},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NZ.js
new file mode 100644
index 0000000..585806a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/NZ.js
@@ -0,0 +1 @@
+module.exports={C:{"11":0.01228,"34":0.01228,"52":0.02456,"54":0.00614,"59":0.02456,"78":0.08597,"88":0.01228,"89":0.01228,"90":0.00614,"91":0.07369,"92":0.00614,"93":0.01842,"94":0.16581,"95":0.03685,"96":1.02555,"97":1.6028,_:"2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 55 56 57 58 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 98 99 3.5 3.6"},D:{"34":0.03071,"38":0.15353,"49":0.07369,"53":0.04299,"59":0.01842,"61":0.03071,"65":0.01842,"66":0.05527,"67":0.01228,"68":0.01228,"69":0.00614,"70":0.01842,"71":0.00614,"72":0.01842,"73":0.01228,"74":0.01842,"75":0.01228,"76":0.03685,"77":0.01842,"78":0.01228,"79":0.39917,"80":0.01842,"81":0.01842,"83":0.01842,"84":0.02456,"85":0.01228,"86":0.01842,"87":0.15353,"88":0.01842,"89":0.04913,"90":0.17809,"91":0.08597,"92":0.15353,"93":0.62024,"94":0.27635,"95":0.23336,"96":1.19135,"97":11.95039,"98":26.92829,"99":0.04299,"100":0.01842,_:"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 35 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 60 62 63 64 101"},F:{"28":0.00614,"36":0.00614,"40":0.00614,"46":0.09212,"82":0.11668,"83":0.39917,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00614,"18":0.01842,"84":0.00614,"85":0.00614,"90":0.01228,"92":0.00614,"95":0.07369,"96":0.04913,"97":1.23434,"98":4.43994,_:"12 13 14 15 16 79 80 81 83 86 87 88 89 91 93 94"},E:{"4":0,"12":0.01228,"13":0.07369,"14":0.41759,"15":0.3439,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.02456,"11.1":0.05527,"12.1":0.12282,"13.1":0.55883,"14.1":1.78703,"15.1":0.97028,"15.2-15.3":1.78703,"15.4":0.01228},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00313,"6.0-6.1":0.01254,"7.0-7.1":0.00627,"8.1-8.4":0.02351,"9.0-9.2":0.01724,"9.3":0.17551,"10.0-10.2":0.00784,"10.3":0.20215,"11.0-11.2":0.10343,"11.3-11.4":0.08149,"12.0-12.1":0.03134,"12.2-12.5":0.84622,"13.0-13.1":0.01567,"13.2":0.0047,"13.3":0.06895,"13.4-13.7":0.19902,"14.0-14.4":0.46699,"14.5-14.8":2.80818,"15.0-15.1":2.08107,"15.2-15.3":8.46843,"15.4":0.04388},P:{"4":0.72232,"5.0-5.4":0.01015,"6.2-6.4":0.02048,"7.2-7.4":0.99755,"8.2":0.11355,"9.2":0.02078,"10.1":0.02048,"11.1-11.2":0.03283,"12.0":0.01094,"13.0":0.10944,"14.0":0.08755,"15.0":0.07661,"16.0":2.36394},I:{"0":0,"3":0,"4":0.00265,"2.1":0,"2.2":0.00132,"2.3":0.00132,"4.1":0.00132,"4.2-4.3":0.00728,"4.4":0,"4.4.3-4.4.4":0.03242},A:{"11":0.38074,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.41291},Q:{"10.4":0},O:{"0":0.08104},H:{"0":0.17171},L:{"0":18.97166},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/OM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/OM.js
new file mode 100644
index 0000000..4f5b65a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/OM.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00326,"52":0.00326,"78":0.00979,"86":0.00653,"91":0.00653,"95":0.00653,"96":0.20883,"97":0.29367,"98":0.00653,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 87 88 89 90 92 93 94 99 3.5 3.6"},D:{"11":0.00653,"30":0.01305,"38":0.02284,"49":0.02937,"53":0.00326,"59":0.00653,"62":0.00653,"63":0.00326,"64":0.00326,"65":0.0261,"67":0.00326,"68":0.00326,"69":0.00653,"70":0.00979,"71":0.00653,"73":0.00326,"74":0.00979,"75":0.01632,"76":0.00653,"77":0.00326,"78":0.00326,"79":0.06526,"80":0.00653,"81":0.00979,"83":0.00979,"84":0.00326,"85":0.02937,"86":0.03589,"87":0.05221,"88":0.01632,"89":0.03263,"90":0.01632,"91":0.04568,"92":0.14357,"93":0.46987,"94":0.05547,"95":0.05547,"96":0.31977,"97":5.89624,"98":15.186,"99":0.05221,"100":0.01632,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 60 61 66 72 101"},F:{"28":0.00979,"46":0.00979,"82":0.15336,"83":0.36546,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00326,"15":0.00326,"16":0.00653,"17":0.00326,"18":0.01958,"84":0.00653,"89":0.00326,"91":0.00326,"92":0.01305,"93":0.00326,"94":0.01305,"95":0.01958,"96":0.03589,"97":0.47966,"98":2.26452,_:"13 14 79 80 81 83 85 86 87 88 90"},E:{"4":0,"13":0.02937,"14":0.13378,"15":0.11094,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.00979,"12.1":0.01305,"13.1":0.0881,"14.1":0.38177,"15.1":0.2382,"15.2-15.3":0.37525,"15.4":0.00653},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00321,"6.0-6.1":0,"7.0-7.1":0.03532,"8.1-8.4":0.00803,"9.0-9.2":0.00161,"9.3":0.04334,"10.0-10.2":0.00321,"10.3":0.0305,"11.0-11.2":0.03692,"11.3-11.4":0.01124,"12.0-12.1":0.01605,"12.2-12.5":0.51368,"13.0-13.1":0.03692,"13.2":0.02087,"13.3":0.08508,"13.4-13.7":0.20708,"14.0-14.4":0.78657,"14.5-14.8":2.87177,"15.0-15.1":2.79953,"15.2-15.3":8.43069,"15.4":0.10595},P:{"4":0.18523,"5.0-5.4":0.01015,"6.2-6.4":0.01029,"7.2-7.4":0.17494,"8.2":0.11355,"9.2":0.03087,"10.1":0.02048,"11.1-11.2":0.16465,"12.0":0.05145,"13.0":0.19552,"14.0":0.22639,"15.0":0.20581,"16.0":2.50061},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00049,"4.2-4.3":0.00391,"4.4":0,"4.4.3-4.4.4":0.02929},A:{"11":2.92039,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.06737},Q:{"10.4":0},O:{"0":0.88928},H:{"0":0.4975},L:{"0":39.42475},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PA.js
new file mode 100644
index 0000000..5ba7e2d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PA.js
@@ -0,0 +1 @@
+module.exports={C:{"51":0.00755,"52":0.00755,"56":0.00377,"73":0.03773,"78":0.01887,"83":0.00377,"84":0.00377,"88":0.01132,"89":0.01132,"90":0.03396,"91":0.02641,"93":0.00755,"94":0.01132,"95":0.01132,"96":0.50558,"97":0.78101,"98":0.00755,_:"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 40 41 42 43 44 45 46 47 48 49 50 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 79 80 81 82 85 86 87 92 99 3.5 3.6"},D:{"34":0.01132,"38":0.01509,"47":0.01132,"49":0.02641,"53":0.01132,"56":0.00377,"58":0.00377,"61":0.00377,"62":0.01509,"63":0.00377,"65":0.01132,"67":0.00755,"68":0.00755,"69":0.01132,"70":0.01132,"72":0.01887,"73":0.02264,"75":0.04528,"76":0.01887,"77":0.00755,"78":0.00755,"79":0.19242,"80":0.01887,"81":0.01509,"83":0.01509,"84":0.01509,"85":0.00755,"86":0.02264,"87":0.14337,"88":0.01132,"89":0.03018,"90":0.04905,"91":0.23015,"92":0.08678,"93":0.22638,"94":0.02641,"95":0.07546,"96":0.49804,"97":7.59128,"98":16.55215,"99":0.00755,"100":0.01132,"101":0.01132,_:"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 35 36 37 39 40 41 42 43 44 45 46 48 50 51 52 54 55 57 59 60 64 66 71 74"},F:{"28":0.00755,"46":0.00377,"79":0.01132,"82":0.4754,"83":1.61107,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00377,"14":0.00377,"16":0.00755,"17":0.01132,"18":0.02641,"84":0.00755,"89":0.00377,"90":0.00755,"92":0.01132,"93":0.00377,"94":0.00755,"95":0.00755,"96":0.03773,"97":0.69046,"98":2.46377,_:"13 15 79 80 81 83 85 86 87 88 91"},E:{"4":0,"8":0.00755,"12":0.00755,"13":0.00755,"14":0.13583,"15":0.07923,_:"0 5 6 7 9 10 11 3.1 3.2 6.1 7.1 9.1 10.1","5.1":0.01887,"11.1":0.01509,"12.1":0.02641,"13.1":0.26034,"14.1":0.615,"15.1":0.24147,"15.2-15.3":0.57727,"15.4":0.00377},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00166,"6.0-6.1":0.00581,"7.0-7.1":0.03819,"8.1-8.4":0.00664,"9.0-9.2":0.01494,"9.3":0.09132,"10.0-10.2":0,"10.3":0.02657,"11.0-11.2":0.01245,"11.3-11.4":0.0083,"12.0-12.1":0.01411,"12.2-12.5":0.33041,"13.0-13.1":0.01826,"13.2":0.00166,"13.3":0.03653,"13.4-13.7":0.14694,"14.0-14.4":0.39516,"14.5-14.8":1.54413,"15.0-15.1":1.23115,"15.2-15.3":4.34181,"15.4":0.03321},P:{"4":0.27566,"5.0-5.4":0.01065,"6.2-6.4":0.01065,"7.2-7.4":0.31649,"8.2":0.03083,"9.2":0.04084,"10.1":0.01021,"11.1-11.2":0.20419,"12.0":0.03063,"13.0":0.14293,"14.0":0.18377,"15.0":0.22461,"16.0":2.87907},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00854,"4.4":0,"4.4.3-4.4.4":0.06617},A:{"11":0.18865,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.25527},Q:{"10.4":0},O:{"0":0.1432},H:{"0":0.24756},L:{"0":44.50503},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PE.js
new file mode 100644
index 0000000..755887a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PE.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.005,"52":0.015,"76":0.01,"78":0.01,"84":0.01,"88":0.01,"90":0.01,"91":0.01,"92":0.01,"93":0.005,"94":0.01,"95":0.015,"96":0.39992,"97":0.68486,_:"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 40 41 42 43 44 45 46 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 79 80 81 82 83 85 86 87 89 98 99 3.5 3.6"},D:{"22":0.01,"34":0.005,"38":0.05499,"47":0.01,"49":0.02999,"53":0.02,"65":0.01,"66":0.005,"68":0.01,"69":0.01,"70":0.005,"71":0.005,"72":0.005,"74":0.01,"75":0.01,"76":0.005,"77":0.02,"78":0.01,"79":0.24995,"80":0.025,"81":0.04499,"83":0.03499,"84":0.02,"85":0.015,"86":0.03999,"87":0.09498,"88":0.025,"89":0.02999,"90":0.02999,"91":0.23495,"92":0.09498,"93":0.11998,"94":0.06499,"95":0.08498,"96":0.54489,"97":11.24775,"98":27.94441,"99":0.02,"100":0.01,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 48 50 51 52 54 55 56 57 58 59 60 61 62 63 64 67 73 101"},F:{"36":0.01,"80":0.005,"81":0.005,"82":0.64487,"83":1.68466,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.005,"18":0.025,"84":0.005,"88":0.01,"90":0.005,"91":0.005,"92":0.01,"94":0.005,"95":0.01,"96":0.04999,"97":0.5149,"98":1.87463,_:"13 14 15 16 17 79 80 81 83 85 86 87 89 93"},E:{"4":0,"12":0.005,"13":0.005,"14":0.06499,"15":0.06499,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.005,"12.1":0.01,"13.1":0.04999,"14.1":0.14997,"15.1":0.11498,"15.2-15.3":0.17497},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00348,"6.0-6.1":0.00145,"7.0-7.1":0.00261,"8.1-8.4":0.00058,"9.0-9.2":0,"9.3":0.01245,"10.0-10.2":0.00463,"10.3":0.01738,"11.0-11.2":0.00521,"11.3-11.4":0.00695,"12.0-12.1":0.00724,"12.2-12.5":0.1593,"13.0-13.1":0.00463,"13.2":0.00463,"13.3":0.0197,"13.4-13.7":0.04489,"14.0-14.4":0.1735,"14.5-14.8":0.58566,"15.0-15.1":0.5063,"15.2-15.3":1.32715,"15.4":0.00782},P:{"4":0.2466,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.07505,"8.2":0.03083,"9.2":0.02144,"10.1":0.03037,"11.1-11.2":0.09649,"12.0":0.02144,"13.0":0.06433,"14.0":0.11794,"15.0":0.08577,"16.0":0.76123},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00129,"4.2-4.3":0.00323,"4.4":0,"4.4.3-4.4.4":0.05549},A:{"11":0.12498,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.09002},Q:{"10.4":0},O:{"0":0.02501},H:{"0":0.17045},L:{"0":43.35314},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PF.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PF.js
new file mode 100644
index 0000000..1b9da8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PF.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.02663,"48":0.0222,"52":0.00888,"56":0.02663,"59":0.01332,"60":0.03551,"61":0.00444,"63":0.00444,"65":0.00444,"68":0.25302,"78":0.31961,"81":0.00444,"82":0.03551,"84":0.01332,"88":0.00888,"89":0.00888,"90":0.00444,"91":0.13317,"92":0.00888,"93":0.05771,"94":0.04439,"95":0.03995,"96":1.32282,"97":2.44589,"98":0.00444,_:"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 40 41 42 43 44 45 46 49 50 51 53 54 55 57 58 62 64 66 67 69 70 71 72 73 74 75 76 77 79 80 83 85 86 87 99 3.5 3.6"},D:{"49":0.03551,"62":0.01776,"67":0.03107,"77":0.01332,"79":0.00888,"83":0.02663,"84":0.02663,"85":0.00888,"86":0.00888,"87":0.08878,"88":0.00888,"89":0.01776,"91":0.01776,"92":0.11541,"93":0.182,"94":0.02663,"95":0.03551,"96":0.51936,"97":5.49548,"98":17.54737,"100":0.00444,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 63 64 65 66 68 69 70 71 72 73 74 75 76 78 80 81 90 99 101"},F:{"71":0.03995,"82":0.23971,"83":0.53712,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00888,"17":0.01332,"18":0.00888,"89":0.00888,"90":0.00888,"91":0.01332,"92":0.03551,"93":0.09322,"95":0.00888,"96":0.0222,"97":0.71468,"98":2.13072,_:"12 13 15 16 79 80 81 83 84 85 86 87 88 94"},E:{"4":0,"12":0.01332,"13":0.04439,"14":0.7857,"15":0.2841,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.00444,"11.1":0.13761,"12.1":0.16424,"13.1":0.38619,"14.1":2.05082,"15.1":1.08312,"15.2-15.3":1.65575,"15.4":0.0222},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00215,"6.0-6.1":0,"7.0-7.1":0.00431,"8.1-8.4":0,"9.0-9.2":0.00431,"9.3":0.14426,"10.0-10.2":0.01722,"10.3":0.15718,"11.0-11.2":0.0689,"11.3-11.4":0.03014,"12.0-12.1":0.13349,"12.2-12.5":1.54807,"13.0-13.1":0.04737,"13.2":0.00431,"13.3":0.09043,"13.4-13.7":0.44784,"14.0-14.4":0.86339,"14.5-14.8":4.11026,"15.0-15.1":3.61289,"15.2-15.3":10.20566,"15.4":0.03445},P:{"4":0.02094,"5.0-5.4":0.02093,"6.2-6.4":0.04074,"7.2-7.4":0.10469,"8.2":0.02094,"9.2":0.01094,"10.1":0.04074,"11.1-11.2":0.13609,"12.0":0.01047,"13.0":0.07328,"14.0":0.14656,"15.0":0.11516,"16.0":2.66954},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00189,"4.2-4.3":0.00142,"4.4":0,"4.4.3-4.4.4":0.01893},A:{"11":0.20419,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.31142},Q:{"10.4":0},O:{"0":0.67288},H:{"0":0.06318},L:{"0":29.53786},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PG.js
new file mode 100644
index 0000000..6e46218
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PG.js
@@ -0,0 +1 @@
+module.exports={C:{"33":0.02085,"44":0.00695,"48":0.00695,"56":0.00695,"61":0.01043,"72":0.00695,"77":0.02433,"78":0.00348,"79":0.00695,"80":0.0139,"82":0.03475,"83":0.00695,"84":0.01738,"88":0.0139,"89":0.00348,"90":0.01043,"91":0.04518,"92":0.00348,"93":0.0139,"94":0.01738,"95":0.0695,"96":0.59075,"97":1.33788,"98":0.06603,_:"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 34 35 36 37 38 39 40 41 42 43 45 46 47 49 50 51 52 53 54 55 57 58 59 60 62 63 64 65 66 67 68 69 70 71 73 74 75 76 81 85 86 87 99 3.5 3.6"},D:{"26":0.00695,"37":0.02433,"38":0.00348,"43":0.00348,"44":0.00695,"46":0.00348,"49":0.02085,"53":0.00695,"54":0.01043,"55":0.00348,"56":0.01043,"59":0.00695,"60":0.00695,"61":0.01043,"62":0.00695,"65":0.0139,"67":0.02085,"68":0.00695,"69":0.16333,"70":0.17028,"72":0.00695,"74":0.03475,"76":0.0139,"77":0.00695,"78":0.00348,"79":0.00695,"80":0.01043,"81":0.04865,"83":0.03128,"84":0.00695,"85":0.05213,"86":0.02433,"87":0.05213,"88":0.44828,"89":0.07993,"90":0.04518,"91":0.07645,"92":0.0556,"93":0.09035,"94":0.07645,"95":0.07645,"96":0.52473,"97":4.1978,"98":9.76823,"99":0.00695,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 34 35 36 39 40 41 42 45 47 48 50 51 52 57 58 63 64 66 71 73 75 100 101"},F:{"28":0.00348,"67":0.13553,"73":0.00695,"76":0.00695,"77":0.04865,"80":0.04865,"81":0.0139,"82":0.11815,"83":0.46565,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 74 75 78 79 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05213,"13":0.05908,"14":0.0278,"15":0.04518,"16":0.06603,"17":0.05213,"18":0.26758,"80":0.03128,"83":0.01043,"84":0.10425,"85":0.02085,"88":0.00348,"89":0.03823,"90":0.0139,"91":0.0278,"92":0.0417,"93":0.0139,"94":0.03823,"95":0.04518,"96":0.1112,"97":0.95215,"98":2.96765,_:"79 81 86 87"},E:{"4":0,"7":0.00348,"12":0.00695,"13":0.02085,"14":0.04865,"15":0.0139,_:"0 5 6 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.05213,"12.1":0.01738,"13.1":0.37183,"14.1":0.10773,"15.1":0.03128,"15.2-15.3":0.15985},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00121,"7.0-7.1":0,"8.1-8.4":0.0006,"9.0-9.2":0.00904,"9.3":0.01356,"10.0-10.2":0,"10.3":0.02924,"11.0-11.2":0.00573,"11.3-11.4":0.01658,"12.0-12.1":0.01537,"12.2-12.5":0.27279,"13.0-13.1":0.00603,"13.2":0.00452,"13.3":0.06722,"13.4-13.7":0.10912,"14.0-14.4":0.21009,"14.5-14.8":0.40903,"15.0-15.1":0.79847,"15.2-15.3":1.04353,"15.4":0.00241},P:{"4":0.5237,"5.0-5.4":0.01065,"6.2-6.4":0.01027,"7.2-7.4":1.15009,"8.2":0.03083,"9.2":0.12322,"10.1":0.01021,"11.1-11.2":0.25672,"12.0":0.05134,"13.0":0.45182,"14.0":0.45182,"15.0":0.54424,"16.0":2.14615},I:{"0":0,"3":0,"4":0.00282,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02441,"4.2-4.3":0.02347,"4.4":0,"4.4.3-4.4.4":0.2103},A:{"9":0.02309,"10":0.00924,"11":0.33254,_:"6 7 8 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.13703},Q:{"10.4":0.0522},O:{"0":2.32943},H:{"0":1.68644},L:{"0":59.5965},S:{"2.5":0.09788}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PH.js
new file mode 100644
index 0000000..edf9106
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PH.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00474,"36":0.00949,"52":0.00949,"56":0.03321,"59":0.01423,"72":0.00474,"78":0.00949,"87":0.00474,"88":0.00949,"91":0.00949,"92":0.00949,"94":0.00949,"95":0.01423,"96":0.31785,"97":0.48863,"98":0.00949,_:"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 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 89 90 93 99 3.5 3.6"},D:{"49":0.02372,"52":0.00474,"53":0.00949,"55":0.00949,"56":0.00474,"58":0.00474,"63":0.00474,"65":0.01423,"66":0.06167,"67":0.00949,"69":0.01423,"70":0.00949,"71":0.01423,"72":0.01423,"73":0.00949,"74":0.02372,"75":0.02372,"76":0.03321,"77":0.01898,"78":0.10437,"79":0.08065,"80":0.02846,"81":0.02846,"83":0.03795,"84":0.03321,"85":0.03321,"86":0.05218,"87":0.1186,"88":0.05218,"89":0.05693,"90":0.06642,"91":0.1186,"92":0.18027,"93":0.1186,"94":0.09488,"95":0.12334,"96":0.61672,"97":9.93394,"98":23.6014,"99":0.02372,"100":0.02372,_:"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 40 41 42 43 44 45 46 47 48 50 51 54 57 59 60 61 62 64 68 101"},F:{"28":0.03321,"36":0.00949,"46":0.00949,"82":0.30836,"83":0.85392,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00949,"18":0.01423,"84":0.00474,"92":0.00949,"95":0.01423,"96":0.02846,"97":0.76378,"98":2.65664,_:"12 13 14 15 16 79 80 81 83 85 86 87 88 89 90 91 93 94"},E:{"4":0,"13":0.01898,"14":0.09962,"15":0.0759,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00474,"11.1":0.02372,"12.1":0.01423,"13.1":0.07116,"14.1":0.29887,"15.1":0.17078,"15.2-15.3":0.29413},G:{"8":0.00087,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00043,"5.0-5.1":0.01039,"6.0-6.1":0.00217,"7.0-7.1":0.01473,"8.1-8.4":0.00087,"9.0-9.2":0.00823,"9.3":0.0589,"10.0-10.2":0.00476,"10.3":0.03465,"11.0-11.2":0.01776,"11.3-11.4":0.03378,"12.0-12.1":0.01949,"12.2-12.5":0.38849,"13.0-13.1":0.01299,"13.2":0.00736,"13.3":0.03162,"13.4-13.7":0.10351,"14.0-14.4":0.26809,"14.5-14.8":0.72371,"15.0-15.1":0.71591,"15.2-15.3":1.85713,"15.4":0.01429},P:{"4":0.32855,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.07505,"8.2":0.03083,"9.2":0.0106,"10.1":0.03037,"11.1-11.2":0.05299,"12.0":0.0106,"13.0":0.03179,"14.0":0.05299,"15.0":0.05299,"16.0":0.72069},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00401,"4.2-4.3":0.0024,"4.4":0,"4.4.3-4.4.4":0.04088},A:{"11":3.07886,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.09459},Q:{"10.4":0.01051},O:{"0":1.13508},H:{"0":0.69651},L:{"0":45.06218},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PK.js
new file mode 100644
index 0000000..fdf2806
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PK.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.01214,"50":0.00243,"52":0.03156,"68":0.00243,"72":0.00486,"78":0.00971,"79":0.00486,"80":0.00486,"81":0.00486,"82":0.00243,"83":0.00243,"84":0.00486,"88":0.00486,"89":0.00486,"91":0.02185,"93":0.00486,"94":0.04128,"95":0.017,"96":0.36177,"97":0.59486,"98":0.03156,_:"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 40 41 42 43 44 45 46 48 49 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 85 86 87 90 92 99 3.5 3.6"},D:{"38":0.00486,"40":0.00243,"42":0.00243,"43":0.017,"49":0.02428,"50":0.00243,"56":0.02671,"58":0.00243,"62":0.00243,"63":0.00728,"64":0.03885,"65":0.00728,"66":0.00243,"67":0.00243,"68":0.00728,"69":0.00486,"70":0.00486,"71":0.00728,"72":0.00728,"73":0.00728,"74":0.01214,"75":0.00971,"76":0.00971,"77":0.00486,"78":0.00728,"79":0.017,"80":0.02185,"81":0.03399,"83":0.03642,"84":0.06798,"85":0.03885,"86":0.06798,"87":0.08012,"88":0.017,"89":0.03399,"90":0.02185,"91":0.0437,"92":0.05099,"93":0.25008,"94":0.0437,"95":0.07284,"96":0.34235,"97":5.06724,"98":12.37066,"99":0.02428,"100":0.02671,_:"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 39 41 44 45 46 47 48 51 52 53 54 55 57 59 60 61 101"},F:{"71":0.00243,"82":0.06798,"83":0.52202,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01214,"13":0.00243,"14":0.00243,"15":0.00486,"16":0.00486,"17":0.00243,"18":0.02428,"84":0.00486,"85":0.00243,"89":0.00486,"92":0.00728,"95":0.00728,"96":0.00971,"97":0.19424,"98":0.66284,_:"79 80 81 83 86 87 88 90 91 93 94"},E:{"4":0,"13":0.00971,"14":0.02914,"15":0.017,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 15.4","5.1":0.00971,"10.1":0.00243,"11.1":0.00486,"12.1":0.00728,"13.1":0.01942,"14.1":0.09226,"15.1":0.03885,"15.2-15.3":0.05584},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00114,"5.0-5.1":0.00228,"6.0-6.1":0.00076,"7.0-7.1":0.03841,"8.1-8.4":0.00076,"9.0-9.2":0.00456,"9.3":0.07795,"10.0-10.2":0.0057,"10.3":0.04715,"11.0-11.2":0.01559,"11.3-11.4":0.01483,"12.0-12.1":0.01065,"12.2-12.5":0.35402,"13.0-13.1":0.00799,"13.2":0.00456,"13.3":0.0289,"13.4-13.7":0.10115,"14.0-14.4":0.2331,"14.5-14.8":0.66849,"15.0-15.1":0.6221,"15.2-15.3":1.55182,"15.4":0.00875},P:{"4":0.21296,"5.0-5.4":0.01065,"6.2-6.4":0.01065,"7.2-7.4":0.05324,"8.2":0.11355,"9.2":0.0213,"10.1":0.02048,"11.1-11.2":0.04259,"12.0":0.0213,"13.0":0.08519,"14.0":0.06389,"15.0":0.09583,"16.0":1.03288},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00139,"4.2-4.3":0.00555,"4.4":0,"4.4.3-4.4.4":0.05363},A:{"8":0.00744,"9":0.00744,"11":0.09923,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.06057},Q:{"10.4":0},O:{"0":4.32304},H:{"0":1.74893},L:{"0":64.93215},S:{"2.5":0.11357}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PL.js
new file mode 100644
index 0000000..2470b76
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PL.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.00474,"52":0.16597,"56":0.00474,"66":0.00948,"68":0.00948,"72":0.01897,"78":0.03794,"80":0.00474,"81":0.00474,"82":0.00948,"83":0.00474,"84":0.02371,"85":0.00474,"86":0.00948,"87":0.02845,"88":0.02371,"89":0.02845,"90":0.01897,"91":0.11855,"92":0.01897,"93":0.03794,"94":0.06165,"95":0.12329,"96":2.48007,"97":3.42847,"98":0.01423,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 67 69 70 71 73 74 75 76 77 79 99 3.5 3.6"},D:{"34":0.01423,"49":0.11855,"50":0.00474,"58":0.00948,"63":0.01897,"70":0.00474,"71":0.00474,"74":0.00474,"75":0.00948,"76":0.04268,"77":0.01423,"78":0.01423,"79":0.27504,"80":0.00948,"81":0.00948,"83":0.01897,"84":0.04742,"85":0.01897,"86":0.04268,"87":0.06165,"88":0.03319,"89":0.03319,"90":0.03319,"91":0.03794,"92":0.04742,"93":0.1802,"94":0.07587,"95":0.09484,"96":0.8915,"97":7.64885,"98":15.2313,"99":0.00474,"100":0.00474,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 51 52 53 54 55 56 57 59 60 61 62 64 65 66 67 68 69 72 73 101"},F:{"36":0.01897,"75":0.00948,"76":0.00474,"77":0.01897,"78":0.01897,"79":0.01897,"80":0.01897,"81":0.01897,"82":2.50852,"83":6.2215,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00948,"16":0.00474,"17":0.00948,"18":0.01897,"84":0.00474,"86":0.00474,"89":0.00474,"91":0.00948,"92":0.01897,"93":0.00474,"94":0.01423,"95":0.01897,"96":0.06165,"97":0.98634,"98":3.33363,_:"12 13 14 79 80 81 83 85 87 88 90"},E:{"4":0,"13":0.01423,"14":0.07113,"15":0.04742,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00948,"12.1":0.01897,"13.1":0.07113,"14.1":0.1802,"15.1":0.12329,"15.2-15.3":0.22287},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00039,"6.0-6.1":0.00116,"7.0-7.1":0.00232,"8.1-8.4":0.00077,"9.0-9.2":0.00039,"9.3":0.01898,"10.0-10.2":0.00039,"10.3":0.00929,"11.0-11.2":0.00387,"11.3-11.4":0.00349,"12.0-12.1":0.00542,"12.2-12.5":0.06932,"13.0-13.1":0.00852,"13.2":0.00503,"13.3":0.01704,"13.4-13.7":0.05925,"14.0-14.4":0.1793,"14.5-14.8":0.7114,"15.0-15.1":0.60413,"15.2-15.3":2.15394,"15.4":0.01549},P:{"4":0.18679,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.02075,"8.2":0.03083,"9.2":0.12453,"10.1":0.03037,"11.1-11.2":0.09339,"12.0":0.03113,"13.0":0.09339,"14.0":0.14528,"15.0":0.09339,"16.0":1.96127},I:{"0":0,"3":0,"4":0.00216,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01417,"4.2-4.3":0.00984,"4.4":0,"4.4.3-4.4.4":0.02641},A:{"11":0.14226,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01052},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.21032},Q:{"10.4":0},O:{"0":0.03681},H:{"0":1.18475},L:{"0":44.77015},S:{"2.5":0.00526}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PM.js
new file mode 100644
index 0000000..36f80ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PM.js
@@ -0,0 +1 @@
+module.exports={C:{"43":0.00778,"52":0.00778,"78":0.02724,"79":0.22179,"86":0.00389,"91":0.14397,"95":0.05447,"96":0.54474,"97":1.57586,"98":0.01556,_:"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 40 41 42 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 80 81 82 83 84 85 87 88 89 90 92 93 94 99 3.5 3.6"},D:{"29":0.00389,"49":0.00778,"61":0.00389,"65":0.01167,"76":0.01167,"79":0.01556,"84":0.01167,"87":0.01946,"89":0.00389,"91":0.00389,"94":0.01167,"95":0.00389,"96":0.26459,"97":4.10501,"98":10.93371,_:"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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 62 63 64 66 67 68 69 70 71 72 73 74 75 77 78 80 81 83 85 86 88 90 92 93 99 100 101"},F:{"82":0.27626,"83":1.26068,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00389,"97":1.24123,"98":4.5836,_:"12 13 14 15 16 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96"},E:{"4":0,"14":0.10117,"15":0.08949,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00389,"11.1":0.04669,"12.1":0.00389,"13.1":0.10895,"14.1":1.30349,"15.1":1.71204,"15.2-15.3":5.78203,"15.4":0.29183},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00956,"10.0-10.2":0,"10.3":0.01913,"11.0-11.2":0.02391,"11.3-11.4":0.01434,"12.0-12.1":0.00956,"12.2-12.5":1.39619,"13.0-13.1":0,"13.2":0.00956,"13.3":0.31558,"13.4-13.7":0.00956,"14.0-14.4":0.15779,"14.5-14.8":5.98639,"15.0-15.1":7.05744,"15.2-15.3":32.27965,"15.4":0.50205},P:{"4":0.16724,"5.0-5.4":0.01121,"6.2-6.4":0.01012,"7.2-7.4":0.68986,"8.2":0.03083,"9.2":0.03136,"10.1":0.03037,"11.1-11.2":0.20905,"12.0":0.0209,"13.0":0.14633,"14.0":0.20905,"15.0":0.36584,"16.0":0.31767},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.04934,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.03618},A:{"11":0.05058,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.09164},Q:{"10.4":0},O:{"0":0},H:{"0":0.08097},L:{"0":12.73345},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PN.js
new file mode 100644
index 0000000..d70389d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PN.js
@@ -0,0 +1 @@
+module.exports={C:{_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 3.5 3.6"},D:{"81":57.14,"98":42.86,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 99 100 101"},F:{_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1 15.1 15.2-15.3 15.4"},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0},P:{"4":0.32855,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.07505,"8.2":0.03083,"9.2":0.0106,"10.1":0.03037,"11.1-11.2":0.05299,"12.0":0.0106,"13.0":0.03179,"14.0":0.05299,"15.0":0.05299,"16.0":0.72069},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{_:"6 7 8 9 10 11 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0},H:{"0":0},L:{"0":0},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PR.js
new file mode 100644
index 0000000..343757b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PR.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.04526,"73":0.04073,"78":0.0181,"90":0.05431,"91":0.03168,"95":0.03168,"96":0.93688,"97":1.29896,"98":0.01358,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 92 93 94 99 3.5 3.6"},D:{"25":0.00453,"49":0.03621,"54":0.01358,"58":0.00453,"63":0.00453,"65":0.00453,"68":0.00453,"71":0.00453,"75":0.01358,"76":0.0181,"78":0.00905,"79":0.06789,"80":0.00905,"81":0.00905,"83":0.0181,"84":0.03168,"85":0.00905,"86":0.03168,"87":0.49786,"88":0.0181,"89":0.05884,"90":0.0181,"91":0.02263,"92":0.04526,"93":0.05431,"94":0.11315,"95":0.08599,"96":0.47523,"97":7.62178,"98":16.76883,"99":0.0181,"100":0.00453,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 55 56 57 59 60 61 62 64 66 67 69 70 72 73 74 77 101"},F:{"82":0.17651,"83":0.64269,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.00905,"17":0.01358,"18":0.04526,"84":0.00453,"85":0.00905,"89":0.00453,"90":0.00905,"91":0.00453,"92":0.00905,"93":0.00453,"94":0.04526,"95":0.04526,"96":0.18104,"97":1.53431,"98":5.46288,_:"12 13 14 15 79 80 81 83 86 87 88"},E:{"4":0,"12":0.00905,"13":0.04979,"14":0.43902,"15":0.30324,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.02716,"11.1":0.03621,"12.1":0.06789,"13.1":0.38924,"14.1":1.6882,"15.1":0.66985,"15.2-15.3":1.67009,"15.4":0.03168},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00775,"9.0-9.2":0.00258,"9.3":0.09036,"10.0-10.2":0,"10.3":0.03098,"11.0-11.2":0.07229,"11.3-11.4":0.0284,"12.0-12.1":0.01549,"12.2-12.5":0.35886,"13.0-13.1":0.02065,"13.2":0.01549,"13.3":0.05422,"13.4-13.7":0.23494,"14.0-14.4":0.83131,"14.5-14.8":4.41988,"15.0-15.1":4.05586,"15.2-15.3":15.44891,"15.4":0.11101},P:{"4":0.21935,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.05223,"8.2":0.03083,"9.2":0.04178,"10.1":0.03037,"11.1-11.2":0.06267,"12.0":0.01045,"13.0":0.17757,"14.0":0.09401,"15.0":0.09401,"16.0":2.43379},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.01642},A:{"11":0.23535,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.2737},Q:{"10.4":0},O:{"0":0.00547},H:{"0":0.11401},L:{"0":24.77973},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PS.js
new file mode 100644
index 0000000..a822cfb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PS.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.02036,"78":0.00291,"79":0.01163,"87":0.00582,"88":0.00291,"91":0.02036,"94":0.00291,"95":0.01745,"96":0.47691,"97":0.60777,"98":0.00872,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 80 81 82 83 84 85 86 89 90 92 93 99 3.5 3.6"},D:{"35":0.41294,"38":0.02036,"41":0.0349,"43":0.00582,"49":0.01745,"53":0.00582,"56":0.00291,"58":0.00582,"60":0.00582,"61":0.01454,"63":0.00872,"69":0.00582,"70":0.00291,"71":0.00872,"72":0.00872,"73":0.00291,"74":0.00582,"76":0.00291,"77":0.20938,"78":0.00582,"79":0.07561,"80":0.01745,"81":0.01745,"83":0.01163,"84":0.01745,"85":0.00872,"86":0.04653,"87":0.05525,"88":0.00872,"89":0.17739,"90":0.01745,"91":0.0378,"92":0.04071,"93":0.05816,"94":0.04071,"95":0.04944,"96":0.33151,"97":6.66223,"98":15.3019,"99":0.00582,"100":0.01454,_:"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 36 37 39 40 42 44 45 46 47 48 50 51 52 54 55 57 59 62 64 65 66 67 68 75 101"},F:{"82":0.13377,"83":0.6543,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00291,"13":0.00291,"17":0.00582,"18":0.03199,"84":0.00582,"92":0.00872,"93":0.00291,"95":0.00872,"96":0.02036,"97":0.34314,"98":1.23008,_:"14 15 16 79 80 81 83 85 86 87 88 89 90 91 94"},E:{"4":0,"13":0.01454,"14":0.04362,"15":0.02908,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00872,"12.1":0.00872,"13.1":0.02036,"14.1":0.12214,"15.1":0.09887,"15.2-15.3":0.15122},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00241,"6.0-6.1":0,"7.0-7.1":0.03047,"8.1-8.4":0.0016,"9.0-9.2":0,"9.3":0.03208,"10.0-10.2":0.0016,"10.3":0.01684,"11.0-11.2":0.00722,"11.3-11.4":0.01524,"12.0-12.1":0.02005,"12.2-12.5":0.27424,"13.0-13.1":0.00882,"13.2":0.00321,"13.3":0.02887,"13.4-13.7":0.09222,"14.0-14.4":0.3841,"14.5-14.8":1.69677,"15.0-15.1":1.30546,"15.2-15.3":4.07113,"15.4":0.02165},P:{"4":0.08236,"5.0-5.4":0.01065,"6.2-6.4":0.01065,"7.2-7.4":0.12354,"8.2":0.03083,"9.2":0.02059,"10.1":0.01029,"11.1-11.2":0.15442,"12.0":0.05147,"13.0":0.24708,"14.0":0.17501,"15.0":0.1956,"16.0":2.13103},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00278,"4.2-4.3":0.00972,"4.4":0,"4.4.3-4.4.4":0.12225},A:{"11":0.09887,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.0851},Q:{"10.4":0},O:{"0":0.07092},H:{"0":0.39614},L:{"0":54.16528},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PT.js
new file mode 100644
index 0000000..7e030db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PT.js
@@ -0,0 +1 @@
+module.exports={C:{"3":0.01273,"15":0.01273,"49":0.03819,"52":0.05092,"54":0.01273,"78":0.04456,"84":0.01273,"87":0.00637,"88":0.00637,"91":0.05729,"92":0.01273,"93":0.0191,"94":0.01273,"95":0.05729,"96":1.15207,"97":1.91587,"98":0.01273,_:"2 4 5 6 7 8 9 10 11 12 13 14 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 53 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 89 90 99 3.5 3.6"},D:{"23":0.02546,"38":0.00637,"43":0.36917,"49":0.10821,"59":0.00637,"63":0.00637,"65":0.00637,"67":0.00637,"68":0.01273,"69":0.0191,"70":0.00637,"71":0.0191,"73":0.01273,"75":0.00637,"76":0.01273,"77":0.01273,"78":0.01273,"79":0.04456,"80":0.02546,"81":0.01273,"83":0.01273,"84":0.04456,"85":0.02546,"86":0.04456,"87":0.17822,"88":0.02546,"89":0.07638,"90":0.09548,"91":0.12094,"92":0.05092,"93":0.35008,"94":0.08275,"95":0.11457,"96":0.40736,"97":12.78092,"98":29.53997,"99":0.02546,"100":0.01273,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 44 45 46 47 48 50 51 52 53 54 55 56 57 58 60 61 62 64 66 72 74 101"},F:{"82":1.46395,"83":3.11249,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01273,"18":0.01273,"84":0.00637,"89":0.01273,"90":0.00637,"91":0.00637,"92":0.01273,"93":0.00637,"94":0.01273,"95":0.0191,"96":0.05092,"97":1.26027,"98":4.62736,_:"12 13 14 16 17 79 80 81 83 85 86 87 88"},E:{"4":0,"13":0.03819,"14":0.20368,"15":0.16549,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00637,"11.1":0.02546,"12.1":0.03819,"13.1":0.22914,"14.1":0.62377,"15.1":0.37554,"15.2-15.3":0.84018,"15.4":0.01273},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00176,"5.0-5.1":0,"6.0-6.1":0.00176,"7.0-7.1":0.00088,"8.1-8.4":0.00616,"9.0-9.2":0,"9.3":0.06244,"10.0-10.2":0,"10.3":0.06419,"11.0-11.2":0.02902,"11.3-11.4":0.00703,"12.0-12.1":0.00528,"12.2-12.5":0.27348,"13.0-13.1":0.01847,"13.2":0.0044,"13.3":0.0255,"13.4-13.7":0.11168,"14.0-14.4":0.28492,"14.5-14.8":1.46064,"15.0-15.1":1.36654,"15.2-15.3":5.01329,"15.4":0.04837},P:{"4":0.01076,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.02075,"8.2":0.03083,"9.2":0.12453,"10.1":0.03037,"11.1-11.2":0.01076,"12.0":0.01076,"13.0":0.04305,"14.0":0.05381,"15.0":0.04305,"16.0":1.46357},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00277,"4.2-4.3":0.00554,"4.4":0,"4.4.3-4.4.4":0.04985},A:{"11":0.37554,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.18175},Q:{"10.4":0},O:{"0":0.14177},H:{"0":0.20304},L:{"0":24.70845},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PW.js
new file mode 100644
index 0000000..c7f6eb1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PW.js
@@ -0,0 +1 @@
+module.exports={C:{"92":0.04309,"96":0.89408,"97":0.8456,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 93 94 95 98 99 3.5 3.6"},D:{"33":0.01077,"43":0.0754,"48":0.01077,"49":0.01077,"58":0.02154,"68":0.09695,"75":0.7325,"76":0.0377,"78":0.02693,"79":0.25314,"81":0.64632,"85":0.01616,"86":0.01077,"87":0.28007,"89":0.08618,"90":0.09695,"91":0.05925,"93":0.06463,"94":0.03232,"95":0.02154,"96":1.01795,"97":13.10414,"98":25.16339,_:"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 34 35 36 37 38 39 40 41 42 44 45 46 47 50 51 52 53 54 55 56 57 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 77 80 83 84 88 92 99 100 101"},F:{"79":0.11311,"82":0.02154,"83":0.15619,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.02154,"18":0.01077,"89":0.01077,"96":0.2693,"97":1.08797,"98":2.97846,_:"12 13 15 16 17 79 80 81 83 84 85 86 87 88 90 91 92 93 94 95"},E:{"4":0,"11":0.04847,"13":0.01077,"14":0.17235,"15":0.08618,_:"0 5 6 7 8 9 10 12 3.1 3.2 5.1 6.1 7.1 9.1 11.1 15.4","10.1":0.05386,"12.1":0.03232,"13.1":0.17774,"14.1":1.52962,"15.1":0.19928,"15.2-15.3":1.10952},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00335,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00335,"10.0-10.2":0.00335,"10.3":0.43827,"11.0-11.2":0,"11.3-11.4":0.02683,"12.0-12.1":0.00335,"12.2-12.5":0.29293,"13.0-13.1":0,"13.2":0,"13.3":0.08162,"13.4-13.7":0.03019,"14.0-14.4":0.25715,"14.5-14.8":3.30942,"15.0-15.1":1.58427,"15.2-15.3":5.01556,"15.4":0.12522},P:{"4":0.21296,"5.0-5.4":0.01065,"6.2-6.4":0.01065,"7.2-7.4":0.46249,"8.2":0.03083,"9.2":0.0213,"10.1":0.01028,"11.1-11.2":0.02056,"12.0":0.0213,"13.0":0.08519,"14.0":0.15416,"15.0":0.29805,"16.0":3.07297},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.12926,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.24905},Q:{"10.4":0},O:{"0":0.17987},H:{"0":0.75974},L:{"0":31.12102},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PY.js
new file mode 100644
index 0000000..4659e82
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/PY.js
@@ -0,0 +1 @@
+module.exports={C:{"24":0.03432,"30":0.00644,"35":0.11154,"43":0.00215,"47":0.00429,"52":0.3239,"56":0.00215,"60":0.00429,"61":0.00215,"64":0.00429,"65":0.00215,"66":0.00215,"68":0.01502,"69":0.00858,"72":0.00858,"73":0.03218,"77":0.01073,"78":0.00429,"86":0.00644,"88":0.01716,"89":0.00644,"90":0.01073,"91":0.01073,"92":0.00215,"93":0.01287,"94":0.00644,"95":0.01716,"96":0.37109,"97":0.60275,"98":0.00429,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 31 32 33 34 36 37 38 39 40 41 42 44 45 46 48 49 50 51 53 54 55 57 58 59 62 63 67 70 71 74 75 76 79 80 81 82 83 84 85 87 99 3.5 3.6"},D:{"11":0.00858,"31":0.00644,"35":0.00215,"38":0.00858,"41":0.00215,"47":0.03432,"49":0.02789,"52":0.00215,"53":0.00215,"54":0.00215,"55":0.00215,"63":0.00429,"64":0.18447,"65":0.02145,"66":0.00429,"69":0.00858,"70":0.00215,"71":0.01073,"72":0.00215,"73":0.00429,"74":0.00215,"75":0.00644,"76":0.00429,"77":0.00429,"78":0.00429,"79":0.07508,"80":0.00644,"81":0.01073,"83":0.00858,"84":0.00644,"85":0.01931,"86":0.02145,"87":0.18876,"88":0.01716,"89":0.0236,"90":0.01502,"91":0.07293,"92":0.0429,"93":0.0429,"94":0.02574,"95":0.03218,"96":0.57057,"97":4.15058,"98":10.24238,"99":0.00215,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 36 37 39 40 42 43 44 45 46 48 50 51 56 57 58 59 60 61 62 67 68 100 101"},F:{"36":0.00429,"76":0.00429,"78":0.00429,"82":0.21665,"83":0.66495,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00215,"15":0.00429,"17":0.00429,"18":0.00858,"84":0.00429,"89":0.00215,"92":0.01073,"95":0.00858,"96":0.01073,"97":0.28314,"98":0.9867,_:"12 13 16 79 80 81 83 85 86 87 88 90 91 93 94"},E:{"4":0,"13":0.00215,"14":0.02145,"15":0.01931,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1 15.4","5.1":0.04505,"12.1":0.00215,"13.1":0.05363,"14.1":0.09867,"15.1":0.07508,"15.2-15.3":0.09009},G:{"8":0,"3.2":0.00179,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00313,"6.0-6.1":0,"7.0-7.1":0.02415,"8.1-8.4":0.00089,"9.0-9.2":0.00224,"9.3":0.00716,"10.0-10.2":0.00134,"10.3":0.01387,"11.0-11.2":0.00626,"11.3-11.4":0.01208,"12.0-12.1":0.00358,"12.2-12.5":0.23976,"13.0-13.1":0.00403,"13.2":0.00134,"13.3":0.01118,"13.4-13.7":0.05457,"14.0-14.4":0.15566,"14.5-14.8":0.97379,"15.0-15.1":0.68885,"15.2-15.3":2.25353,"15.4":0.01029},P:{"4":0.50616,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.64788,"8.2":0.03083,"9.2":0.08098,"10.1":0.03037,"11.1-11.2":0.21259,"12.0":0.07086,"13.0":0.25308,"14.0":0.32394,"15.0":0.27332,"16.0":2.35868},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00269,"4.2-4.3":0.00539,"4.4":0,"4.4.3-4.4.4":0.08618},A:{"8":0.00644,"11":0.07937,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.08641},Q:{"10.4":0},O:{"0":0.04713},H:{"0":0.18592},L:{"0":60.80205},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/QA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/QA.js
new file mode 100644
index 0000000..ac8465b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/QA.js
@@ -0,0 +1 @@
+module.exports={C:{"38":0.03135,"52":0.00314,"78":0.00627,"84":0.00314,"89":0.00627,"91":0.02822,"94":0.00314,"95":0.00941,"96":0.24767,"97":0.41069,"98":0.00314,_:"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 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 88 90 92 93 99 3.5 3.6"},D:{"34":0.00314,"38":0.01568,"39":0.00314,"41":0.00627,"49":0.02822,"53":0.00627,"61":0.00314,"65":0.00627,"67":0.00627,"68":0.01568,"69":0.00627,"71":0.00314,"73":0.00627,"74":0.01254,"75":0.00941,"76":0.00627,"77":0.00314,"78":0.00941,"79":0.05957,"80":0.00941,"81":0.00627,"83":0.00941,"84":0.01881,"85":0.00941,"86":0.03449,"87":0.05643,"88":0.01881,"89":0.02195,"90":0.01568,"91":0.02822,"92":0.07524,"93":0.04703,"94":0.04389,"95":0.09092,"96":0.31037,"97":6.37032,"98":15.20162,"99":0.01568,"100":0.00941,_:"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 35 36 37 40 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 59 60 62 63 64 66 70 72 101"},F:{"28":0.01568,"46":0.00627,"82":0.16616,"83":0.47339,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00314,"16":0.00314,"17":0.00941,"18":0.03135,"84":0.01254,"85":0.01881,"91":0.00941,"92":0.00941,"93":0.00314,"94":0.00941,"95":0.02822,"96":0.04389,"97":0.60506,"98":2.11299,_:"12 13 14 79 80 81 83 86 87 88 89 90"},E:{"4":0,"12":0.00627,"13":0.02822,"14":0.17243,"15":0.16616,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.00627,"12.1":0.02195,"13.1":0.12854,"14.1":0.64895,"15.1":0.36366,"15.2-15.3":0.73359,"15.4":0.00941},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00274,"6.0-6.1":0.00274,"7.0-7.1":0.01233,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0507,"10.0-10.2":0.00137,"10.3":0.03699,"11.0-11.2":0.03562,"11.3-11.4":0.01233,"12.0-12.1":0.00548,"12.2-12.5":0.27815,"13.0-13.1":0.0137,"13.2":0.00411,"13.3":0.04385,"13.4-13.7":0.16031,"14.0-14.4":0.55355,"14.5-14.8":2.04156,"15.0-15.1":2.01142,"15.2-15.3":8.35397,"15.4":0.06988},P:{"4":0.12427,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.05178,"8.2":0.03083,"9.2":0.04178,"10.1":0.03037,"11.1-11.2":0.07249,"12.0":0.01036,"13.0":0.04142,"14.0":0.0932,"15.0":0.11391,"16.0":1.99866},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00294,"4.4":0,"4.4.3-4.4.4":0.01766},A:{"11":0.16929,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.08926},Q:{"10.4":0},O:{"0":4.0784},H:{"0":0.98804},L:{"0":46.01359},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RE.js
new file mode 100644
index 0000000..0b4b1e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RE.js
@@ -0,0 +1 @@
+module.exports={C:{"11":0.00445,"23":0.00445,"32":0.01335,"45":0.00445,"48":0.0178,"49":0.0178,"52":0.02225,"54":0.0089,"55":0.0089,"56":0.0089,"60":0.0178,"61":0.0356,"66":0.0089,"68":0.01335,"72":0.0089,"78":0.20915,"80":0.00445,"82":0.01335,"85":0.0089,"88":0.0267,"89":0.12015,"90":0.0089,"91":0.1424,"93":0.0089,"94":0.0178,"95":0.0534,"96":1.87345,"97":3.4087,_:"2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 33 34 35 36 37 38 39 40 41 42 43 44 46 47 50 51 53 57 58 59 62 63 64 65 67 69 70 71 73 74 75 76 77 79 81 83 84 86 87 92 98 99 3.5 3.6"},D:{"34":0.0178,"46":0.00445,"47":0.0089,"49":0.0801,"54":0.01335,"57":0.00445,"58":0.01335,"61":0.02225,"62":0.00445,"63":0.00445,"65":0.0178,"67":0.0089,"69":0.00445,"70":0.0089,"71":0.0178,"74":0.00445,"76":0.04005,"77":0.0089,"78":0.00445,"79":0.13795,"80":0.0267,"81":0.0089,"83":0.04005,"84":0.0178,"85":0.0267,"86":0.0178,"87":0.0801,"88":0.00445,"89":0.02225,"90":0.01335,"91":0.0267,"92":0.04005,"93":0.01335,"94":0.0356,"95":0.0801,"96":0.3649,"97":6.3813,"98":16.39825,"100":0.00445,_:"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 35 36 37 38 39 40 41 42 43 44 45 48 50 51 52 53 55 56 59 60 64 66 68 72 73 75 99 101"},F:{"28":0.0089,"46":0.00445,"82":0.2581,"83":1.07245,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00445,"16":0.00445,"17":0.1691,"18":0.0267,"84":0.0178,"86":0.0089,"89":0.00445,"90":0.00445,"92":0.01335,"94":0.04895,"95":0.0178,"96":0.0534,"97":1.1214,"98":4.10735,_:"12 13 14 79 80 81 83 85 87 88 91 93"},E:{"4":0,"11":0.01335,"12":0.0178,"13":0.0712,"14":0.36935,"15":0.20025,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1","9.1":0.00445,"10.1":0.01335,"11.1":0.06675,"12.1":0.1246,"13.1":0.57405,"14.1":1.2549,"15.1":0.8544,"15.2-15.3":1.18815,"15.4":0.00445},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01055,"8.1-8.4":0.00176,"9.0-9.2":0,"9.3":0.14423,"10.0-10.2":0.01231,"10.3":0.08619,"11.0-11.2":0.0299,"11.3-11.4":0.01583,"12.0-12.1":0.02638,"12.2-12.5":0.48369,"13.0-13.1":0.07739,"13.2":0.00528,"13.3":0.05453,"13.4-13.7":0.19875,"14.0-14.4":0.68948,"14.5-14.8":3.10267,"15.0-15.1":2.72451,"15.2-15.3":9.83039,"15.4":0.08619},P:{"4":0.06207,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.10345,"8.2":0.03083,"9.2":0.01035,"10.1":0.03037,"11.1-11.2":0.17587,"12.0":0.01035,"13.0":0.10345,"14.0":0.14483,"15.0":0.14483,"16.0":2.65868},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00171,"4.2-4.3":0.00114,"4.4":0,"4.4.3-4.4.4":0.036},A:{"11":0.1246,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.35526},Q:{"10.4":0},O:{"0":0.15543},H:{"0":0.16817},L:{"0":34.4385},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RO.js
new file mode 100644
index 0000000..0dd3dce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RO.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.17475,"55":0.00406,"68":0.00406,"72":0.00813,"78":0.02438,"79":0.00406,"81":0.00406,"82":0.00406,"84":0.02032,"88":0.01626,"89":0.00813,"90":0.00406,"91":0.06909,"92":0.00813,"93":0.00813,"94":0.01626,"95":0.04064,"96":1.11354,"97":1.79629,"98":0.01219,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 80 83 85 86 87 99 3.5 3.6"},D:{"38":0.00406,"49":0.13411,"51":0.01626,"60":0.34544,"61":0.00813,"67":0.01626,"68":0.00406,"69":0.08941,"70":0.00813,"71":0.01219,"72":0.00813,"73":0.00406,"74":0.00813,"75":0.00813,"76":0.02032,"77":0.00813,"78":0.01626,"79":0.04877,"80":0.01219,"81":0.03251,"83":0.01626,"84":0.04064,"85":0.02845,"86":0.03658,"87":0.10566,"88":0.02845,"89":0.03251,"90":0.04064,"91":0.04877,"92":0.04877,"93":0.32512,"94":0.06096,"95":0.05283,"96":0.34138,"97":8.5913,"98":19.26336,"99":0.01219,"100":0.00813,_:"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 39 40 41 42 43 44 45 46 47 48 50 52 53 54 55 56 57 58 59 62 63 64 65 66 101"},F:{"36":0.00406,"78":0.00406,"82":0.53238,"83":1.99949,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.01626,"84":0.00406,"89":0.00406,"92":0.00813,"94":0.00406,"95":0.01219,"96":0.02438,"97":0.508,"98":1.81254,_:"12 13 14 15 16 17 79 80 81 83 85 86 87 88 90 91 93"},E:{"4":0,"13":0.05283,"14":0.06909,"15":0.04877,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.00406,"11.1":0.00813,"12.1":0.02032,"13.1":0.06502,"14.1":0.20726,"15.1":0.12192,"15.2-15.3":0.27229,"15.4":0.00406},G:{"8":0,"3.2":0.01833,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.06987,"6.0-6.1":0.00115,"7.0-7.1":0.00573,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03092,"10.0-10.2":0.00229,"10.3":0.03551,"11.0-11.2":0.00916,"11.3-11.4":0.01603,"12.0-12.1":0.01718,"12.2-12.5":0.27259,"13.0-13.1":0.01374,"13.2":0.00687,"13.3":0.05039,"13.4-13.7":0.16035,"14.0-14.4":0.51655,"14.5-14.8":2.12461,"15.0-15.1":1.78215,"15.2-15.3":6.2444,"15.4":0.06872},P:{"4":0.09337,"5.0-5.4":0.01065,"6.2-6.4":0.01012,"7.2-7.4":0.10345,"8.2":0.03083,"9.2":0.01037,"10.1":0.03037,"11.1-11.2":0.11412,"12.0":0.0415,"13.0":0.12449,"14.0":0.31123,"15.0":0.16599,"16.0":3.16421},I:{"0":0,"3":0,"4":0.0147,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01715,"4.4":0,"4.4.3-4.4.4":0.12251},A:{"11":0.28854,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.2078},Q:{"10.4":0},O:{"0":0.0475},H:{"0":0.2698},L:{"0":43.38381},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RS.js
new file mode 100644
index 0000000..43daff1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RS.js
@@ -0,0 +1 @@
+module.exports={C:{"38":0.00352,"48":0.00704,"50":0.00704,"52":0.17248,"56":0.01056,"57":0.00352,"60":0.00704,"65":0.00704,"66":0.01408,"68":0.01056,"72":0.00704,"76":0.00704,"78":0.02464,"79":0.00704,"80":0.00352,"81":0.00352,"82":0.00704,"83":0.00704,"84":0.0176,"87":0.01056,"88":0.0352,"89":0.0176,"90":0.00704,"91":0.0352,"92":0.14432,"93":0.02816,"94":0.02464,"95":0.05984,"96":1.41152,"97":2.36896,"98":0.02816,_:"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 39 40 41 42 43 44 45 46 47 49 51 53 54 55 58 59 61 62 63 64 67 69 70 71 73 74 75 77 85 86 99 3.5 3.6"},D:{"38":0.01056,"43":0.00352,"47":0.01408,"48":0.00352,"49":0.14784,"53":0.0176,"56":0.00352,"63":0.01056,"65":0.00704,"66":0.00352,"67":0.01056,"68":0.02112,"70":0.01408,"71":0.00352,"72":0.01056,"73":0.01056,"74":0.00704,"75":0.01056,"76":0.00704,"77":0.00704,"78":0.0176,"79":0.08448,"80":0.0176,"81":0.0176,"83":0.02816,"84":0.0528,"85":0.03872,"86":0.07392,"87":0.11968,"88":0.0352,"89":0.03872,"90":0.02112,"91":0.03872,"92":0.05632,"93":0.30624,"94":0.0528,"95":0.06688,"96":0.3344,"97":7.2864,"98":15.44576,"99":0.01056,"100":0.01408,_:"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 39 40 41 42 44 45 46 50 51 52 54 55 57 58 59 60 61 62 64 69 101"},F:{"28":0.00704,"36":0.00704,"40":0.00352,"68":0.02112,"71":0.00704,"79":0.00352,"82":0.34144,"83":1.69664,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00352,"18":0.01408,"84":0.00352,"90":0.00352,"92":0.00704,"95":0.00352,"96":0.0176,"97":0.32032,"98":1.21088,_:"12 13 14 15 16 79 80 81 83 85 86 87 88 89 91 93 94"},E:{"4":0,"13":0.02816,"14":0.06336,"15":0.03168,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00704,"11.1":0.00704,"12.1":0.0176,"13.1":0.0704,"14.1":0.12672,"15.1":0.0528,"15.2-15.3":0.13728},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00129,"6.0-6.1":0,"7.0-7.1":0.02702,"8.1-8.4":0.00515,"9.0-9.2":0.00129,"9.3":0.03088,"10.0-10.2":0.00515,"10.3":0.07333,"11.0-11.2":0.02058,"11.3-11.4":0.03088,"12.0-12.1":0.01801,"12.2-12.5":0.63555,"13.0-13.1":0.02444,"13.2":0.01158,"13.3":0.08234,"13.4-13.7":0.26245,"14.0-14.4":0.70631,"14.5-14.8":3.29481,"15.0-15.1":1.63518,"15.2-15.3":5.95665,"15.4":0.03345},P:{"4":0.0314,"5.0-5.4":0.01034,"6.2-6.4":0.02028,"7.2-7.4":0.02094,"8.2":0.03042,"9.2":0.04056,"10.1":0.05069,"11.1-11.2":0.09421,"12.0":0.0314,"13.0":0.10468,"14.0":0.11514,"15.0":0.11514,"16.0":2.0726},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00336,"4.2-4.3":0.0084,"4.4":0,"4.4.3-4.4.4":0.0336},A:{"8":0.0153,"9":0.00765,"10":0.00383,"11":0.14922,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.17496},Q:{"10.4":0},O:{"0":0.02592},H:{"0":0.34969},L:{"0":46.34224},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RU.js
new file mode 100644
index 0000000..cde0f61
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RU.js
@@ -0,0 +1 @@
+module.exports={C:{"4":0.00623,"33":0.03117,"38":0.01247,"44":0.10596,"50":0.0374,"51":0.02493,"52":0.25555,"55":0.26179,"56":0.0187,"60":0.01247,"68":0.0187,"69":0.0187,"70":0.03117,"71":0.01247,"72":0.0187,"75":0.01247,"77":0.0187,"78":0.0748,"79":0.0187,"80":0.04363,"81":0.0561,"82":0.02493,"83":0.0187,"84":0.0561,"86":0.02493,"87":0.0187,"88":0.0374,"89":0.04363,"90":0.04363,"91":0.10596,"92":0.04986,"93":0.02493,"94":0.0374,"95":0.11219,"96":1.08454,"97":1.50215,"98":0.01247,_:"2 3 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 34 35 36 37 39 40 41 42 43 45 46 47 48 49 53 54 57 58 59 61 62 63 64 65 66 67 73 74 76 85 99 3.5 3.6"},D:{"38":0.00623,"41":0.01247,"47":0.00623,"48":0.04363,"49":0.13089,"51":0.22439,"53":0.01247,"56":0.03117,"57":0.00623,"58":0.00623,"59":0.00623,"61":0.01247,"62":0.00623,"63":0.00623,"64":0.01247,"65":0.00623,"66":0.01247,"67":0.02493,"68":0.02493,"69":0.02493,"70":0.02493,"71":0.02493,"72":0.0374,"73":0.04363,"74":0.0748,"75":0.02493,"76":0.03117,"77":0.0187,"78":0.02493,"79":0.44878,"80":0.10596,"81":0.06233,"83":0.11219,"84":0.24932,"85":0.20569,"86":0.32412,"87":0.35528,"88":0.24309,"89":0.18699,"90":0.41761,"91":0.16829,"92":0.25555,"93":0.5859,"94":0.13089,"95":0.18699,"96":1.14687,"97":8.69504,"98":16.99116,"99":0.01247,"100":0.0187,_:"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 39 40 42 43 44 45 46 50 52 54 55 60 101"},F:{"36":0.04363,"54":0.00623,"60":0.00623,"68":0.01247,"70":0.00623,"71":0.01247,"72":0.01247,"73":0.01247,"75":0.0187,"76":0.0187,"77":0.13089,"78":0.0935,"79":0.11843,"80":0.09973,"81":0.0561,"82":1.03468,"83":4.47529,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 55 56 57 58 62 63 64 65 66 67 69 74 9.5-9.6 10.5 10.6 11.1 11.5 11.6","10.0-10.1":0,"12.1":0.02493},B:{"14":0.00623,"17":0.00623,"18":0.06233,"84":0.01247,"85":0.01247,"86":0.01247,"89":0.00623,"90":0.01247,"91":0.00623,"92":0.01247,"94":0.01247,"95":0.01247,"96":0.04363,"97":0.55474,"98":1.80134,_:"12 13 15 16 79 80 81 83 87 88 93"},E:{"4":0,"12":0.00623,"13":0.06856,"14":0.15583,"15":0.09973,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 10.1","5.1":0.11843,"9.1":0.04363,"11.1":0.01247,"12.1":0.02493,"13.1":0.14959,"14.1":0.40515,"15.1":0.27425,"15.2-15.3":0.44254,"15.4":0.00623},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00168,"5.0-5.1":0.00838,"6.0-6.1":0.00419,"7.0-7.1":0.00671,"8.1-8.4":0.00755,"9.0-9.2":0.0109,"9.3":0.05198,"10.0-10.2":0.01174,"10.3":0.05869,"11.0-11.2":0.02264,"11.3-11.4":0.02264,"12.0-12.1":0.02683,"12.2-12.5":0.31776,"13.0-13.1":0.02683,"13.2":0.01425,"13.3":0.0503,"13.4-13.7":0.20038,"14.0-14.4":0.50808,"14.5-14.8":1.5695,"15.0-15.1":1.55273,"15.2-15.3":3.88183,"15.4":0.02599},P:{"4":0.04483,"5.0-5.4":0.01121,"6.2-6.4":0.01012,"7.2-7.4":0.08966,"8.2":0.03083,"9.2":0.02242,"10.1":0.03037,"11.1-11.2":0.05604,"12.0":0.02242,"13.0":0.07845,"14.0":0.08966,"15.0":0.06725,"16.0":0.87419},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0029,"4.2-4.3":0.01161,"4.4":0,"4.4.3-4.4.4":0.05706},A:{"6":0.0135,"7":0.0135,"8":0.06752,"9":0.04051,"10":0.03376,"11":0.47942,_:"5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.13185},Q:{"10.4":0.00753},O:{"0":0.21472},H:{"0":0.78103},L:{"0":23.1652},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RW.js
new file mode 100644
index 0000000..3bc9e53
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/RW.js
@@ -0,0 +1 @@
+module.exports={C:{"28":0.00471,"31":0.01884,"36":0.00942,"37":0.00471,"40":0.00471,"47":0.02356,"50":0.06124,"52":0.01884,"56":0.00942,"66":0.00471,"69":0.00471,"71":0.00471,"72":0.00942,"75":0.00471,"78":0.03769,"80":0.00471,"82":0.00942,"88":0.00942,"89":0.02356,"91":0.1696,"93":0.00942,"94":0.01884,"95":0.03298,"96":1.13535,"97":1.7996,"98":0.11306,_:"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 29 30 32 33 34 35 38 39 41 42 43 44 45 46 48 49 51 53 54 55 57 58 59 60 61 62 63 64 65 67 68 70 73 74 76 77 79 81 83 84 85 86 87 90 92 99 3.5 3.6"},D:{"25":0.00471,"29":0.00471,"38":0.01413,"41":0.05653,"43":0.01884,"49":0.04711,"58":0.00471,"60":0.02827,"61":0.00471,"63":0.01413,"65":0.00942,"66":0.00471,"68":0.00471,"69":0.02827,"70":0.00942,"71":0.0424,"72":0.00942,"73":0.00471,"74":0.0424,"75":0.00471,"76":0.01413,"77":0.01413,"78":0.00471,"79":0.03298,"80":0.0424,"81":0.01884,"83":0.01413,"84":0.08009,"85":0.01413,"86":0.0424,"87":0.08009,"88":0.01884,"89":0.06595,"90":0.03298,"91":0.07067,"92":0.0848,"93":0.09893,"94":0.212,"95":0.10364,"96":0.48052,"97":8.66824,"98":19.80033,"99":0.0424,"100":0.04711,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 30 31 32 33 34 35 36 37 39 40 42 44 45 46 47 48 50 51 52 53 54 55 56 57 59 62 64 67 101"},F:{"42":0.03298,"79":0.00942,"82":0.09893,"83":0.85269,_:"9 11 12 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 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.19786,"13":0.13662,"14":0.0424,"15":0.01884,"16":0.02356,"17":0.03298,"18":0.16017,"84":0.03298,"85":0.01884,"87":0.00942,"89":0.01884,"90":0.00942,"91":0.00942,"92":0.0424,"93":0.00471,"94":0.00942,"95":0.01884,"96":0.07538,"97":3.82533,"98":3.19877,_:"79 80 81 83 86 88"},E:{"4":0,"14":0.03769,"15":0.02356,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 6.1 7.1 9.1 15.4","5.1":0.00471,"10.1":0.00471,"11.1":0.01884,"12.1":0.03298,"13.1":0.06595,"14.1":0.22142,"15.1":0.06124,"15.2-15.3":0.19786},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00178,"6.0-6.1":0,"7.0-7.1":0.01006,"8.1-8.4":0,"9.0-9.2":0.00237,"9.3":0.02841,"10.0-10.2":0.00592,"10.3":0.05209,"11.0-11.2":0.01184,"11.3-11.4":0.0148,"12.0-12.1":0.03847,"12.2-12.5":0.55106,"13.0-13.1":0.0148,"13.2":0.00474,"13.3":0.04676,"13.4-13.7":0.10536,"14.0-14.4":0.59131,"14.5-14.8":0.96124,"15.0-15.1":0.9938,"15.2-15.3":2.45342,"15.4":0.03019},P:{"4":0.12615,"5.0-5.4":0.01121,"6.2-6.4":0.01012,"7.2-7.4":0.12615,"8.2":0.03083,"9.2":0.07359,"10.1":0.03037,"11.1-11.2":0.12615,"12.0":0.02102,"13.0":0.05256,"14.0":0.09461,"15.0":0.09461,"16.0":0.97764},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00098,"4.2-4.3":0.00146,"4.4":0,"4.4.3-4.4.4":0.02929},A:{"11":0.15075,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00529},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0.21156},Q:{"10.4":0},O:{"0":0.26974},H:{"0":7.561},L:{"0":39.08053},S:{"2.5":0.03173}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SA.js
new file mode 100644
index 0000000..b182ff1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SA.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00246,"52":0.00739,"78":0.01725,"84":0.00246,"91":0.01232,"94":0.00246,"95":0.00986,"96":0.26611,"97":0.44845,"98":0.00493,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 88 89 90 92 93 99 3.5 3.6"},D:{"11":0.00493,"34":0.00246,"38":0.00739,"43":0.00493,"47":0.00493,"49":0.04189,"53":0.00493,"56":0.00986,"63":0.00739,"64":0.00493,"65":0.00493,"66":0.00246,"67":0.01232,"68":0.00493,"69":0.00739,"70":0.00246,"71":0.00739,"72":0.00246,"74":0.01232,"75":0.00986,"76":0.00493,"77":0.00739,"78":0.01232,"79":0.06406,"80":0.01478,"81":0.00739,"83":0.02218,"84":0.01478,"85":0.02957,"86":0.0271,"87":0.27597,"88":0.01971,"89":0.02218,"90":0.01232,"91":0.03203,"92":0.07392,"93":0.31046,"94":0.02957,"95":0.05421,"96":0.30061,"97":4.928,"98":11.57834,"99":0.00739,"100":0.01232,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 44 45 46 48 50 51 52 54 55 57 58 59 60 61 62 73 101"},F:{"28":0.00986,"36":0.00246,"46":0.00739,"72":0.00493,"73":0.00493,"75":0.00493,"76":0.00493,"77":0.01232,"78":0.00739,"79":0.00986,"80":0.01232,"81":0.01478,"82":0.09856,"83":0.08624,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 74 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00493,"14":0.00493,"15":0.00493,"16":0.00493,"17":0.00493,"18":0.01971,"84":0.00493,"89":0.00493,"90":0.00246,"91":0.00246,"92":0.00986,"93":0.00493,"94":0.00739,"95":0.01971,"96":0.0345,"97":0.46077,"98":1.67798,_:"13 79 80 81 83 85 86 87 88"},E:{"4":0,"12":0.00246,"13":0.0271,"14":0.18726,"15":0.13306,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1","5.1":0.00246,"10.1":0.00246,"11.1":0.01232,"12.1":0.02464,"13.1":0.0887,"14.1":0.47802,"15.1":0.30307,"15.2-15.3":0.41149,"15.4":0.00493},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02477,"8.1-8.4":0.00354,"9.0-9.2":0,"9.3":0.04955,"10.0-10.2":0.00708,"10.3":0.03539,"11.0-11.2":0.02124,"11.3-11.4":0.02124,"12.0-12.1":0.06017,"12.2-12.5":0.81404,"13.0-13.1":0.12741,"13.2":0.08848,"13.3":0.33269,"13.4-13.7":0.7928,"14.0-14.4":3.88967,"14.5-14.8":7.83597,"15.0-15.1":7.55991,"15.2-15.3":13.62978,"15.4":0.08494},P:{"4":0.05168,"5.0-5.4":0.01034,"6.2-6.4":0.04087,"7.2-7.4":0.1137,"8.2":0.16348,"9.2":0.01034,"10.1":0.01033,"11.1-11.2":0.07236,"12.0":0.02067,"13.0":0.10336,"14.0":0.16538,"15.0":0.14471,"16.0":1.83989},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00188,"4.4":0,"4.4.3-4.4.4":0.0358},A:{"11":0.19219,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.08291},Q:{"10.4":0},O:{"0":0.94966},H:{"0":0.11417},L:{"0":35.61174},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SB.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SB.js
new file mode 100644
index 0000000..da46d3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SB.js
@@ -0,0 +1 @@
+module.exports={C:{"47":0.04251,"68":0.00981,"78":0.01308,"83":0.01962,"87":0.00327,"88":0.00981,"90":0.00327,"91":0.00327,"94":0.01635,"95":0.02943,"96":0.54609,"97":0.72267,"98":0.12426,_:"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 40 41 42 43 44 45 46 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 84 85 86 89 92 93 99 3.5 3.6"},D:{"11":0.00654,"70":0.00654,"71":0.03597,"75":0.10791,"78":0.00654,"80":0.00981,"81":0.03597,"83":0.02289,"85":0.01308,"86":0.02616,"87":0.03597,"88":0.05886,"89":0.04251,"90":0.01962,"91":0.04578,"93":0.00654,"95":0.01962,"96":0.1962,"97":4.08423,"98":9.33258,_:"4 5 6 7 8 9 10 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 72 73 74 76 77 79 84 92 94 99 100 101"},F:{"47":0.00654,"83":0.16677,_:"9 11 12 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 40 41 42 43 44 45 46 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01635,"13":0.05232,"14":0.40875,"15":0.08502,"16":0.08502,"17":0.06213,"18":0.51993,"84":0.01308,"85":0.0327,"86":0.01635,"87":0.00654,"88":0.01308,"89":0.05559,"92":0.02943,"93":0.17004,"94":0.03924,"96":0.05559,"97":0.73575,"98":1.91622,_:"79 80 81 83 90 91 95"},E:{"4":0,"13":0.01962,"14":0.00327,"15":0.00327,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00327,"12.1":0.01962,"13.1":0.05232,"14.1":0.04251,"15.1":0.09156,"15.2-15.3":0.03597},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02248,"8.1-8.4":0,"9.0-9.2":0.0017,"9.3":0.03287,"10.0-10.2":0,"10.3":0.14376,"11.0-11.2":0.06064,"11.3-11.4":0.007,"12.0-12.1":0.01209,"12.2-12.5":0.2854,"13.0-13.1":0.007,"13.2":0.03626,"13.3":0.02947,"13.4-13.7":0.07082,"14.0-14.4":0.27501,"14.5-14.8":0.34096,"15.0-15.1":0.14715,"15.2-15.3":0.64735,"15.4":0},P:{"4":0.17359,"5.0-5.4":0.01029,"6.2-6.4":0.04084,"7.2-7.4":0.24506,"8.2":0.03042,"9.2":0.25528,"10.1":0.04084,"11.1-11.2":0.34718,"12.0":0.14295,"13.0":0.61266,"14.0":0.26549,"15.0":0.0919,"16.0":0.74541},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.05804,"4.2-4.3":0.01451,"4.4":0,"4.4.3-4.4.4":0.24376},A:{"10":0.02972,"11":0.99052,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.07403},Q:{"10.4":0},O:{"0":5.68685},H:{"0":2.89267},L:{"0":62.27555},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SC.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SC.js
new file mode 100644
index 0000000..2b81462
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SC.js
@@ -0,0 +1 @@
+module.exports={C:{"38":0.00861,"50":0.00431,"55":0.02584,"56":0.02153,"59":0.03014,"60":0.03875,"61":0.05167,"62":0.02153,"63":0.02153,"68":0.05598,"69":0.03014,"70":0.03875,"71":0.03445,"72":0.05167,"73":0.06459,"74":0.04737,"75":0.04737,"76":0.04306,"77":0.0732,"78":0.11196,"79":0.04306,"80":0.0689,"81":0.0732,"82":0.13349,"83":0.03875,"84":0.0732,"86":0.00861,"87":0.00861,"88":0.01292,"89":0.01292,"90":0.00431,"91":0.52533,"92":0.01722,"94":0.01722,"95":0.05598,"96":0.4306,"97":0.84828,"98":0.01722,_:"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 39 40 41 42 43 44 45 46 47 48 49 51 52 53 54 57 58 64 65 66 67 85 93 99 3.5 3.6"},D:{"33":0.01722,"43":0.00861,"48":0.03014,"53":0.01292,"55":0.01722,"59":0.1421,"63":0.00431,"65":0.00861,"66":0.00431,"68":0.87412,"69":0.27128,"70":0.27128,"71":0.23683,"72":0.89995,"73":0.1464,"74":0.38754,"75":0.24975,"76":0.25836,"77":0.25836,"78":0.53825,"79":0.58562,"80":0.67174,"81":0.37032,"83":0.62006,"84":0.58131,"85":0.8612,"86":0.84398,"87":1.02052,"88":0.49088,"89":0.64159,"90":0.59853,"91":0.16793,"92":1.25735,"93":0.7923,"94":0.02584,"95":0.03445,"96":1.66642,"97":2.27787,"98":4.89592,"99":0.05167,"100":0.00861,_:"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 34 35 36 37 38 39 40 41 42 44 45 46 47 49 50 51 52 54 56 57 58 60 61 62 64 67 101"},F:{"46":0.00861,"47":0.00431,"48":0.00861,"49":0.00861,"51":0.00861,"53":0.04306,"54":0.05598,"55":0.05167,"56":0.01292,"57":0.00431,"60":0.01292,"62":0.00431,"63":0.00431,"65":0.00861,"66":0.00861,"67":0.05167,"68":0.09473,"69":0.00431,"72":0.01292,"73":0.05598,"74":0.00861,"75":0.01292,"76":0.01292,"77":0.05598,"78":0.02153,"79":0.04737,"80":0.03445,"81":0.01292,"82":0.04737,"83":0.46935,_:"9 11 12 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 40 41 42 43 44 45 50 52 58 64 70 71 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.01292,"15":0.00861,"16":0.03875,"17":0.05167,"18":0.29281,"79":0.02153,"80":0.08612,"81":0.06028,"83":0.05598,"84":0.07751,"85":0.03445,"86":0.05167,"87":0.03445,"88":0.04737,"89":0.10765,"90":0.04306,"91":0.00431,"92":0.02153,"95":0.01722,"96":0.05167,"97":0.33587,"98":0.85689,_:"12 13 93 94"},E:{"4":0,"13":0.11626,"14":0.05598,"15":0.05167,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1 11.1","9.1":2.09702,"12.1":0.01292,"13.1":0.06459,"14.1":0.21099,"15.1":1.77407,"15.2-15.3":3.84956,"15.4":0.01722},G:{"8":0.04188,"3.2":0.00966,"4.0-4.1":0.00966,"4.2-4.3":0.06764,"5.0-5.1":0.07409,"6.0-6.1":0.11918,"7.0-7.1":0.14495,"8.1-8.4":0.20615,"9.0-9.2":0.17072,"9.3":0.28024,"10.0-10.2":0.22226,"10.3":0.24159,"11.0-11.2":0.37688,"11.3-11.4":0.26736,"12.0-12.1":0.34789,"12.2-12.5":0.73443,"13.0-13.1":0.21904,"13.2":0.08697,"13.3":0.28024,"13.4-13.7":0.89549,"14.0-14.4":0.47673,"14.5-14.8":0.53794,"15.0-15.1":5.11522,"15.2-15.3":21.23718,"15.4":0.04188},P:{"4":0.15464,"5.0-5.4":0.03093,"6.2-6.4":0.07216,"7.2-7.4":0.2268,"8.2":0.03042,"9.2":0.12371,"10.1":0.29896,"11.1-11.2":0.35051,"12.0":0.16495,"13.0":0.2268,"14.0":0.10309,"15.0":0.08247,"16.0":1.10308},I:{"0":0,"3":0,"4":0.00444,"2.1":0,"2.2":0.005,"2.3":0.00111,"4.1":0.01055,"4.2-4.3":0.02555,"4.4":0,"4.4.3-4.4.4":0.06722},A:{"8":0.03478,"9":0.02484,"10":0.00994,"11":0.51175,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.31317},Q:{"10.4":0.01708},O:{"0":0.88257},H:{"0":0.31266},L:{"0":20.14343},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SD.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SD.js
new file mode 100644
index 0000000..9d3a47f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SD.js
@@ -0,0 +1 @@
+module.exports={C:{"16":0.00139,"17":0.01249,"19":0.00278,"23":0.00278,"24":0.00278,"29":0.00278,"30":0.00416,"31":0.00694,"32":0.00139,"33":0.01249,"34":0.00139,"35":0.01943,"36":0.00555,"38":0.01666,"39":0.00833,"40":0.00416,"41":0.00833,"42":0.00416,"43":0.01804,"44":0.00555,"45":0.00278,"46":0.00278,"47":0.01666,"48":0.00555,"49":0.00555,"50":0.00278,"51":0.00416,"52":0.09438,"53":0.00139,"54":0.00278,"56":0.00833,"57":0.00139,"58":0.00278,"60":0.00278,"61":0.00555,"62":0.00278,"63":0.00416,"64":0.00139,"65":0.00139,"66":0.00416,"68":0.00972,"69":0.00416,"70":0.00416,"72":0.02498,"73":0.00278,"74":0.00416,"78":0.03609,"80":0.00278,"81":0.01943,"82":0.00833,"83":0.01388,"84":0.00972,"85":0.00416,"86":0.00833,"87":0.00416,"88":0.01804,"89":0.03054,"90":0.00694,"91":0.06107,"92":0.01388,"93":0.02082,"94":0.0347,"95":0.03748,"96":2.00844,"97":1.04794,"98":0.0236,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 18 20 21 22 25 26 27 28 37 55 59 67 71 75 76 77 79 99 3.5 3.6"},D:{"26":0.00278,"28":0.00416,"29":0.01666,"33":0.0111,"37":0.00139,"38":0.00278,"39":0.00139,"40":0.01666,"43":0.0458,"46":0.00416,"47":0.00278,"48":0.00139,"49":0.00278,"50":0.00833,"51":0.00139,"52":0.00416,"53":0.00694,"54":0.00278,"55":0.00694,"56":0.00416,"57":0.00416,"58":0.00972,"59":0.00278,"60":0.00278,"62":0.00278,"63":0.01388,"64":0.00833,"65":0.00416,"66":0.00416,"67":0.00555,"68":0.00416,"69":0.01943,"70":0.0111,"71":0.00555,"72":0.00972,"73":0.00278,"74":0.00694,"75":0.01249,"76":0.00833,"77":0.00555,"78":0.01666,"79":0.03886,"80":0.01249,"81":0.01249,"83":0.02498,"84":0.00833,"85":0.02082,"86":0.03609,"87":0.04025,"88":0.01804,"89":0.01388,"90":0.02637,"91":0.06107,"92":0.03609,"93":0.02082,"94":0.0347,"95":0.01943,"96":0.17905,"97":2.15418,"98":3.38256,"99":0.00416,"100":0.00416,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 30 31 32 34 35 36 41 42 44 45 61 101"},F:{"18":0.00139,"33":0.00139,"36":0.00694,"38":0.00278,"42":0.00278,"50":0.00278,"53":0.00139,"62":0.00139,"65":0.00416,"66":0.00139,"71":0.00416,"73":0.00278,"74":0.00278,"77":0.00278,"79":0.00972,"80":0.00278,"81":0.00139,"82":0.04719,"83":0.64126,_:"9 11 12 15 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 37 39 40 41 43 44 45 46 47 48 49 51 52 54 55 56 57 58 60 63 64 67 68 69 70 72 75 76 78 9.5-9.6 10.5 10.6 11.1 11.6 12.1","10.0-10.1":0,"11.5":0.00139},B:{"12":0.0236,"13":0.00555,"14":0.02082,"15":0.00555,"16":0.00972,"17":0.02221,"18":0.06107,"84":0.01388,"85":0.00416,"89":0.00694,"90":0.00694,"91":0.00833,"92":0.01804,"93":0.00833,"94":0.00555,"95":0.00972,"96":0.0347,"97":0.21792,"98":0.60794,_:"79 80 81 83 86 87 88"},E:{"4":0,"12":0.00139,"13":0.00833,"14":0.03609,"15":0.02082,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1","5.1":0.00278,"9.1":0.00139,"10.1":0.00278,"11.1":0.01249,"12.1":0.00278,"13.1":0.02221,"14.1":0.09716,"15.1":0.01388,"15.2-15.3":0.04303,"15.4":0.00278},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00187,"5.0-5.1":0,"6.0-6.1":0.00094,"7.0-7.1":0.01125,"8.1-8.4":0,"9.0-9.2":0.00703,"9.3":0.03328,"10.0-10.2":0.00984,"10.3":0.04031,"11.0-11.2":0.02062,"11.3-11.4":0.06702,"12.0-12.1":0.08952,"12.2-12.5":0.52586,"13.0-13.1":0.05155,"13.2":0.0225,"13.3":0.07874,"13.4-13.7":0.15466,"14.0-14.4":0.69693,"14.5-14.8":0.96736,"15.0-15.1":0.73817,"15.2-15.3":1.1628,"15.4":0.00469},P:{"4":1.45751,"5.0-5.4":0.08041,"6.2-6.4":0.14072,"7.2-7.4":0.65337,"8.2":0.03016,"9.2":0.17088,"10.1":0.08041,"11.1-11.2":0.48249,"12.0":0.13067,"13.0":0.42217,"14.0":0.71368,"15.0":0.48249,"16.0":1.64849},I:{"0":0,"3":0,"4":0.00101,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00406,"4.2-4.3":0.01657,"4.4":0,"4.4.3-4.4.4":0.10754},A:{"9":0.00707,"11":0.22334,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.31003},Q:{"10.4":0},O:{"0":1.30902},H:{"0":6.04158},L:{"0":67.45873},S:{"2.5":0.01722}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SE.js
new file mode 100644
index 0000000..5c567cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SE.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.02167,"68":0.00542,"78":0.07043,"84":0.01625,"88":0.01084,"91":0.0596,"92":0.01084,"94":0.01084,"95":0.04334,"96":0.81812,"97":1.27865,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 87 89 90 93 98 99 3.5 3.6"},D:{"38":0.01084,"49":0.02709,"65":0.01084,"66":0.00542,"67":0.01084,"69":0.16796,"71":0.00542,"72":0.00542,"73":0.00542,"75":0.02709,"76":0.03793,"77":0.02167,"78":0.01084,"79":0.05418,"80":0.03251,"81":0.01084,"83":0.01625,"84":0.04876,"85":0.02709,"86":0.03793,"87":0.17879,"88":0.02709,"89":0.0596,"90":0.0596,"91":0.0596,"92":0.07585,"93":0.47137,"94":0.22756,"95":0.13003,"96":1.07276,"97":12.53725,"98":19.14721,"99":0.02709,"100":0.02167,_:"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 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 68 70 74 101"},F:{"80":0.01084,"82":0.31966,"83":1.28948,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.01625,"18":0.02709,"85":0.01084,"86":0.01625,"88":0.01084,"89":0.01625,"90":0.00542,"91":0.02167,"92":0.01084,"93":0.01084,"94":0.01084,"95":0.02709,"96":0.12461,"97":1.60373,"98":5.00623,_:"12 13 14 15 17 79 80 81 83 84 87"},E:{"4":0,"13":0.09752,"14":0.57431,"15":0.27632,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.00542,"10.1":0.01625,"11.1":0.03793,"12.1":0.09211,"13.1":0.4822,"14.1":2.10218,"15.1":0.81812,"15.2-15.3":1.72292,"15.4":0.01084},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00236,"7.0-7.1":0.00236,"8.1-8.4":0.00946,"9.0-9.2":0.00473,"9.3":0.07566,"10.0-10.2":0.00473,"10.3":0.13004,"11.0-11.2":0.02837,"11.3-11.4":0.02837,"12.0-12.1":0.03783,"12.2-12.5":0.82989,"13.0-13.1":0.03074,"13.2":0.01891,"13.3":0.09221,"13.4-13.7":0.2719,"14.0-14.4":0.92683,"14.5-14.8":5.26542,"15.0-15.1":3.0713,"15.2-15.3":12.76752,"15.4":0.03074},P:{"4":0.06363,"5.0-5.4":0.08041,"6.2-6.4":0.14072,"7.2-7.4":0.67198,"8.2":0.03016,"9.2":0.02036,"10.1":0.03053,"11.1-11.2":0.0106,"12.0":0.02121,"13.0":0.06363,"14.0":0.08484,"15.0":0.09544,"16.0":3.40414},I:{"0":0,"3":0,"4":0.00761,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00285,"4.2-4.3":0.00666,"4.4":0,"4.4.3-4.4.4":0.03328},A:{"11":0.18963,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.2795},Q:{"10.4":0},O:{"0":0.03207},H:{"0":0.76782},L:{"0":17.42427},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SG.js
new file mode 100644
index 0000000..33e7076
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SG.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00281,"48":0.00562,"52":0.00562,"63":0.00562,"78":0.0225,"79":0.00281,"80":0.00562,"83":0.00281,"84":0.00562,"87":0.0225,"88":0.00844,"89":0.00844,"90":0.01406,"91":0.01968,"92":0.00844,"93":0.00562,"94":0.01125,"95":0.0225,"96":0.50054,"97":0.81548,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 64 65 66 67 68 69 70 71 72 73 74 75 76 77 81 82 85 86 98 99 3.5 3.6"},D:{"22":0.00562,"26":0.00562,"34":0.03937,"38":0.10404,"47":0.0225,"49":0.02531,"53":0.02812,"55":0.00562,"56":0.01406,"57":0.00562,"60":0.01125,"62":0.00562,"64":0.03374,"65":0.01406,"66":0.01125,"67":0.01687,"68":0.00562,"69":0.00281,"70":0.03656,"71":0.00562,"72":0.03374,"73":0.00562,"74":0.00562,"75":0.00562,"76":0.01406,"77":0.01125,"78":0.01687,"79":0.31776,"80":0.05343,"81":0.03937,"83":0.03937,"84":0.03374,"85":0.03656,"86":0.03374,"87":0.08436,"88":0.02812,"89":0.02531,"90":0.01687,"91":0.05905,"92":0.05905,"93":0.16028,"94":0.11248,"95":0.07592,"96":0.40774,"97":5.02223,"98":12.08316,"99":0.00844,"100":0.00844,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 48 50 51 52 54 58 59 61 63 101"},F:{"36":0.01406,"40":0.00562,"46":0.03374,"77":0.01406,"78":0.00844,"79":0.01125,"80":0.01125,"81":0.00844,"82":0.05905,"83":0.28401,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00281,"18":0.00844,"84":0.00281,"92":0.00281,"94":0.00281,"95":0.01968,"96":0.01687,"97":0.43867,"98":1.69282,_:"12 13 14 15 16 79 80 81 83 85 86 87 88 89 90 91 93"},E:{"4":0,"8":0.00562,"12":0.00562,"13":0.05062,"14":0.21371,"15":0.14622,_:"0 5 6 7 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.00281,"10.1":0.01125,"11.1":0.01968,"12.1":0.02812,"13.1":0.19122,"14.1":0.88578,"15.1":0.52022,"15.2-15.3":0.97014,"15.4":0.01125},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00149,"6.0-6.1":0.00595,"7.0-7.1":0.01638,"8.1-8.4":0.01638,"9.0-9.2":0.00595,"9.3":0.12505,"10.0-10.2":0.02084,"10.3":0.08188,"11.0-11.2":0.0268,"11.3-11.4":0.02977,"12.0-12.1":0.02531,"12.2-12.5":0.4362,"13.0-13.1":0.0268,"13.2":0.01042,"13.3":0.05211,"13.4-13.7":0.18311,"14.0-14.4":0.50914,"14.5-14.8":2.17801,"15.0-15.1":2.18545,"15.2-15.3":8.89811,"15.4":0.04913},P:{"4":0.50181,"5.0-5.4":0.01029,"6.2-6.4":0.07216,"7.2-7.4":0.07202,"8.2":0.03042,"9.2":0.03087,"10.1":0.01029,"11.1-11.2":0.05144,"12.0":0.03072,"13.0":0.07169,"14.0":0.03072,"15.0":0.0512,"16.0":2.92892},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":7.25348,"4.4":0,"4.4.3-4.4.4":21.76044},A:{"8":0.00891,"9":0.00891,"11":0.21838,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.37372},Q:{"10.4":0.02156},O:{"0":0.50309},H:{"0":0.46949},L:{"0":19.10707},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SH.js
new file mode 100644
index 0000000..666d0dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SH.js
@@ -0,0 +1 @@
+module.exports={C:{"85":0.22214,"96":0.22214,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 86 87 88 89 90 91 92 93 94 95 97 98 99 3.5 3.6"},D:{"49":1.10502,"96":0.22214,"97":18.10474,"98":3.31222,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 99 100 101"},F:{"83":2.87078,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 12.1 13.1 14.1 15.1 15.2-15.3 15.4","11.1":0.44144},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":13.12716,"13.0-13.1":0,"13.2":0.63491,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0.63491,"15.0-15.1":0,"15.2-15.3":0,"15.4":0},P:{"4":0.12615,"5.0-5.4":0.01121,"6.2-6.4":0.01012,"7.2-7.4":0.12615,"8.2":0.03083,"9.2":0.07359,"10.1":0.03037,"11.1-11.2":0.22276,"12.0":0.02102,"13.0":0.05256,"14.0":0.6784,"15.0":0.09461,"16.0":0.97764},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.22214,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,"11":0.03845},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":52.62442},H:{"0":0},L:{"0":5.36322},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SI.js
new file mode 100644
index 0000000..18e4fb9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SI.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.18429,"60":0.02304,"66":0.01152,"67":0.01728,"68":0.01152,"71":0.00576,"76":0.00576,"77":0.02304,"78":0.10942,"82":0.02304,"83":0.0288,"84":0.01728,"87":0.00576,"88":0.05183,"89":0.03455,"90":0.01152,"91":0.13822,"92":0.01728,"93":0.01152,"94":0.0288,"95":0.1267,"96":2.6549,"97":4.22135,"98":0.01728,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 69 70 72 73 74 75 79 80 81 85 86 99 3.5 3.6"},D:{"49":0.07487,"51":0.0288,"63":0.02304,"69":0.02304,"70":0.00576,"72":0.00576,"76":0.0288,"77":0.01728,"78":0.01152,"79":0.04607,"80":0.02304,"81":0.01152,"83":0.02304,"84":0.03455,"85":0.02304,"86":0.04607,"87":0.05759,"88":0.01152,"89":0.03455,"90":0.08063,"91":0.12094,"92":0.05183,"93":0.71412,"94":0.04031,"95":0.06911,"96":0.85233,"97":10.40651,"98":25.89246,"99":0.01152,"100":0.00576,_:"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 40 41 42 43 44 45 46 47 48 50 52 53 54 55 56 57 58 59 60 61 62 64 65 66 67 68 71 73 74 75 101"},F:{"82":0.38585,"83":1.36488,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.02304,"86":0.00576,"92":0.01152,"94":0.00576,"95":0.01152,"96":0.04031,"97":1.0539,"98":3.88157,_:"12 13 14 15 16 17 79 80 81 83 84 85 87 88 89 90 91 93"},E:{"4":0,"5":0.01728,"13":0.04607,"14":0.14398,"15":0.13246,_:"0 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.00576,"11.1":0.02304,"12.1":0.0288,"13.1":0.24764,"14.1":0.46648,"15.1":0.34554,"15.2-15.3":0.56438,"15.4":0.00576},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00288,"6.0-6.1":0.00192,"7.0-7.1":0.00096,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02397,"10.0-10.2":0.00192,"10.3":0.04027,"11.0-11.2":0.00575,"11.3-11.4":0.00863,"12.0-12.1":0.00863,"12.2-12.5":0.15052,"13.0-13.1":0.00959,"13.2":0.00288,"13.3":0.02013,"13.4-13.7":0.10834,"14.0-14.4":0.50335,"14.5-14.8":1.65097,"15.0-15.1":1.67878,"15.2-15.3":5.29616,"15.4":0.06903},P:{"4":0.03157,"5.0-5.4":0.01029,"6.2-6.4":0.07216,"7.2-7.4":0.07202,"8.2":0.03042,"9.2":0.03087,"10.1":0.01029,"11.1-11.2":0.04209,"12.0":0.01052,"13.0":0.10523,"14.0":0.12628,"15.0":0.09471,"16.0":2.694},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00308,"4.2-4.3":0.00463,"4.4":0,"4.4.3-4.4.4":0.02622},A:{"11":0.42041,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.4241},Q:{"10.4":0},O:{"0":0.01272},H:{"0":0.22886},L:{"0":29.11605},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SK.js
new file mode 100644
index 0000000..7909b0f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SK.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.14582,"56":0.01042,"65":0.00521,"68":0.01042,"72":0.01042,"74":0.00521,"78":0.05208,"80":0.01042,"81":0.01042,"82":0.01042,"84":0.00521,"87":0.03125,"88":0.02604,"89":0.01042,"90":0.01042,"91":0.10416,"92":0.02604,"93":0.01042,"94":0.02604,"95":0.07291,"96":2.32277,"97":3.81226,"98":0.02083,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 66 67 69 70 71 73 75 76 77 79 83 85 86 99 3.5 3.6"},D:{"34":0.01042,"38":0.10416,"43":0.01042,"47":0.01562,"49":0.11458,"53":0.02604,"63":0.09895,"67":0.00521,"70":0.01042,"71":0.01042,"72":0.02083,"74":0.00521,"75":0.00521,"77":0.01042,"78":0.01562,"79":0.35414,"80":0.01562,"81":0.04166,"83":0.02604,"84":0.05208,"85":0.05208,"86":0.11458,"87":0.04687,"88":0.01562,"89":0.07291,"90":0.02083,"91":0.04166,"92":0.05208,"93":0.15624,"94":0.03646,"95":0.08854,"96":0.42706,"97":9.44731,"98":21.78506,"99":0.01562,"100":0.01042,_:"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 35 36 37 39 40 41 42 44 45 46 48 50 51 52 54 55 56 57 58 59 60 61 62 64 65 66 68 69 73 76 101"},F:{"28":0.02604,"36":0.01042,"40":0.00521,"46":0.01562,"69":0.01042,"78":0.01042,"79":0.01042,"80":0.01562,"81":0.00521,"82":0.55726,"83":2.70295,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 70 71 72 73 74 75 76 77 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.01562,"18":0.01562,"85":0.00521,"86":0.01042,"87":0.01042,"91":0.02083,"92":0.01042,"93":0.00521,"94":0.01042,"95":0.01562,"96":0.03646,"97":0.9739,"98":3.41645,_:"12 13 14 15 16 79 80 81 83 84 88 89 90"},E:{"4":0,"12":0.01042,"13":0.02604,"14":0.17707,"15":0.08854,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.01042,"12.1":0.03646,"13.1":0.1927,"14.1":0.44789,"15.1":0.30206,"15.2-15.3":0.64579,"15.4":0.00521},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01039,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03117,"10.0-10.2":0,"10.3":0.08001,"11.0-11.2":0.00935,"11.3-11.4":0.01247,"12.0-12.1":0.00831,"12.2-12.5":0.23898,"13.0-13.1":0.00727,"13.2":0.01559,"13.3":0.02494,"13.4-13.7":0.1143,"14.0-14.4":0.35224,"14.5-14.8":1.65209,"15.0-15.1":1.67079,"15.2-15.3":6.08052,"15.4":0.07585},P:{"4":0.49039,"5.0-5.4":0.01029,"6.2-6.4":0.07216,"7.2-7.4":0.07202,"8.2":0.03042,"9.2":0.03087,"10.1":0.01029,"11.1-11.2":0.04174,"12.0":0.0313,"13.0":0.05217,"14.0":0.07304,"15.0":0.07304,"16.0":2.00331},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0029,"4.2-4.3":0.00639,"4.4":0,"4.4.3-4.4.4":0.04821},A:{"9":0.00521,"11":0.28123,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.27794},Q:{"10.4":0},O:{"0":0.04792},H:{"0":0.3947},L:{"0":34.01666},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SL.js
new file mode 100644
index 0000000..15c88a4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SL.js
@@ -0,0 +1 @@
+module.exports={C:{"30":0.00225,"33":0.00225,"35":0.01578,"43":0.00902,"45":0.00676,"47":0.00225,"57":0.00451,"61":0.00225,"78":0.00451,"80":0.00225,"87":0.00451,"91":0.00902,"94":0.00225,"95":0.03156,"96":0.41474,"97":0.73706,"98":0.06311,_:"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 31 32 34 36 37 38 39 40 41 42 44 46 48 49 50 51 52 53 54 55 56 58 59 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 81 82 83 84 85 86 88 89 90 92 93 99 3.5 3.6"},D:{"34":0.02029,"37":0.01127,"43":0.01578,"44":0.00225,"46":0.00676,"48":0.00225,"49":0.01803,"53":0.00676,"55":0.00451,"56":0.00451,"57":0.01803,"60":0.02705,"62":0.00225,"63":0.00225,"64":0.0293,"65":0.00902,"67":0.00676,"68":0.00225,"69":0.00902,"72":0.2547,"73":0.00676,"74":0.00676,"75":0.02029,"76":0.01803,"77":0.02479,"79":0.01352,"80":0.00902,"81":0.00902,"83":0.02029,"84":0.01352,"85":0.00451,"86":0.02029,"87":0.0293,"88":0.01803,"89":0.01803,"90":0.00676,"91":0.02254,"92":0.02029,"93":0.03832,"94":0.02479,"95":0.01803,"96":0.18934,"97":3.01811,"98":5.74319,"99":0.01352,"100":0.00225,_:"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 35 36 38 39 40 41 42 45 47 50 51 52 54 58 59 61 66 70 71 78 101"},F:{"20":0.00451,"31":0.00225,"38":0.00225,"42":0.01127,"48":0.00225,"60":0.00676,"62":0.00451,"64":0.00451,"66":0.00225,"67":0.00225,"79":0.01352,"80":0.00225,"81":0.00902,"82":0.1961,"83":0.70776,_:"9 11 12 15 16 17 18 19 21 22 23 24 25 26 27 28 29 30 32 33 34 35 36 37 39 40 41 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 63 65 68 69 70 71 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.07664,"13":0.04057,"14":0.03381,"15":0.02254,"16":0.04057,"17":0.01352,"18":0.11045,"80":0.00451,"84":0.01803,"85":0.01352,"87":0.01127,"88":0.00451,"89":0.01803,"90":0.01578,"91":0.01578,"92":0.06762,"93":0.01803,"94":0.01352,"95":0.0293,"96":0.11045,"97":0.51166,"98":1.65894,_:"79 81 83 86"},E:{"4":0,"13":0.00451,"14":0.02705,"15":0.01127,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 10.1 15.4","5.1":0.00451,"7.1":0.00225,"9.1":0.00225,"11.1":0.01578,"12.1":0.00451,"13.1":0.01578,"14.1":0.23442,"15.1":0.0586,"15.2-15.3":0.05184},G:{"8":0.00207,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00069,"5.0-5.1":0,"6.0-6.1":0.00207,"7.0-7.1":0.00829,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.09815,"10.0-10.2":0.00415,"10.3":0.03456,"11.0-11.2":0.03387,"11.3-11.4":0.01313,"12.0-12.1":0.06013,"12.2-12.5":0.59236,"13.0-13.1":0.05806,"13.2":0.03387,"13.3":0.1258,"13.4-13.7":0.18455,"14.0-14.4":1.16744,"14.5-14.8":1.51165,"15.0-15.1":1.43078,"15.2-15.3":1.54483,"15.4":0.00207},P:{"4":0.1852,"5.0-5.4":0.01029,"6.2-6.4":0.07216,"7.2-7.4":0.07202,"8.2":0.03042,"9.2":0.03087,"10.1":0.01029,"11.1-11.2":0.05144,"12.0":0.16495,"13.0":0.03087,"14.0":0.10289,"15.0":0.11318,"16.0":0.80254},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0012,"4.2-4.3":0.00329,"4.4":0,"4.4.3-4.4.4":0.04972},A:{"10":0.02058,"11":0.18228,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01549},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.12392},Q:{"10.4":0},O:{"0":1.79684},H:{"0":18.71978},L:{"0":52.91197},S:{"2.5":0.02324}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SM.js
new file mode 100644
index 0000000..356a899
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SM.js
@@ -0,0 +1 @@
+module.exports={C:{"48":0.02024,"52":0.02699,"56":0.02024,"59":0.02024,"60":0.01349,"64":0.01349,"78":0.24289,"87":0.00675,"89":0.01349,"90":0.04723,"91":0.07422,"93":0.01349,"95":0.12819,"96":1.49109,"97":3.11711,"98":0.04048,_:"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 40 41 42 43 44 45 46 47 49 50 51 53 54 55 57 58 61 62 63 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 88 92 94 99 3.5 3.6"},D:{"49":0.03374,"66":0.00675,"71":0.01349,"76":0.60048,"77":0.02699,"79":0.18892,"80":0.01349,"84":0.02699,"87":0.17542,"88":0.02024,"89":0.00675,"91":0.02024,"92":0.02024,"95":0.00675,"96":0.31711,"97":13.85834,"98":32.88488,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 67 68 69 70 72 73 74 75 78 81 83 85 86 90 93 94 99 100 101"},F:{"77":0.04723,"82":0.05398,"83":0.25639,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.03374,"95":0.01349,"97":1.28193,"98":4.52049,_:"12 13 14 15 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 96"},E:{"4":0,"13":0.04723,"14":0.16193,"15":0.22265,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.56,"12.1":0.16193,"13.1":1.17398,"14.1":1.03229,"15.1":0.41831,"15.2-15.3":1.2347},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00258,"9.0-9.2":0.00773,"9.3":0.02406,"10.0-10.2":0,"10.3":0.02148,"11.0-11.2":0.0696,"11.3-11.4":0.00258,"12.0-12.1":0.00516,"12.2-12.5":0.65729,"13.0-13.1":0,"13.2":0.00516,"13.3":0,"13.4-13.7":0.13661,"14.0-14.4":1.00355,"14.5-14.8":1.17797,"15.0-15.1":0.76211,"15.2-15.3":4.705,"15.4":0.01031},P:{"4":0.08266,"5.0-5.4":0.01121,"6.2-6.4":0.04087,"7.2-7.4":0.63347,"8.2":0.16348,"9.2":0.01033,"10.1":0.01033,"11.1-11.2":0.11366,"12.0":0.05109,"13.0":0.34739,"14.0":0.093,"15.0":0.01033,"16.0":3.01725},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00798,"4.4":0,"4.4.3-4.4.4":0.05383},A:{"11":0.1147,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.1106},Q:{"10.4":0},O:{"0":0},H:{"0":0.02156},L:{"0":20.72511},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SN.js
new file mode 100644
index 0000000..41a9b8e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SN.js
@@ -0,0 +1 @@
+module.exports={C:{"35":0.07044,"43":0.00486,"49":0.00729,"52":0.01215,"57":0.03886,"65":0.00243,"68":0.00243,"70":0.00243,"72":0.00486,"78":0.01457,"80":0.06558,"81":0.00243,"84":0.00972,"86":0.00486,"88":0.04129,"89":0.01943,"91":0.02186,"92":0.00486,"93":0.00243,"94":0.16517,"95":0.02429,"96":0.6364,"97":0.76756,"98":0.00486,_:"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 36 37 38 39 40 41 42 44 45 46 47 48 50 51 53 54 55 56 58 59 60 61 62 63 64 66 67 69 71 73 74 75 76 77 79 82 83 85 87 90 99 3.5 3.6"},D:{"33":0.00486,"38":0.01457,"40":0.00243,"43":0.00486,"49":0.017,"58":0.00729,"60":0.00486,"63":0.00486,"64":0.00243,"65":0.01215,"66":0.07044,"67":0.00729,"68":0.01215,"69":0.02672,"70":0.01457,"71":0.00243,"72":0.00486,"73":0.00243,"74":0.017,"75":0.01215,"76":0.05587,"77":0.00243,"78":0.00486,"79":0.07773,"80":0.00972,"81":0.04129,"83":0.01943,"84":0.01215,"85":0.017,"86":0.02672,"87":0.03644,"88":0.01943,"89":0.03886,"90":0.03158,"91":0.03401,"92":0.03401,"93":0.02186,"94":0.04372,"95":0.08987,"96":0.32792,"97":3.50019,"98":7.95498,"99":0.00729,"100":0.00486,_:"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 34 35 36 37 39 41 42 44 45 46 47 48 50 51 52 53 54 55 56 57 59 61 62 101"},F:{"37":0.00486,"70":0.00486,"79":0.00243,"82":0.05101,"83":0.89387,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00972,"13":0.017,"14":0.00486,"15":0.00972,"16":0.00972,"17":0.01215,"18":0.03644,"84":0.00243,"85":0.00729,"89":0.00729,"90":0.00243,"92":0.00972,"93":0.00729,"94":0.00486,"95":0.00729,"96":0.05101,"97":0.44937,"98":1.5327,_:"79 80 81 83 86 87 88 91"},E:{"4":0,"13":0.01215,"14":0.07287,"15":0.01215,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00486,"11.1":0.02429,"12.1":0.0583,"13.1":0.05344,"14.1":0.09473,"15.1":0.04615,"15.2-15.3":0.10688},G:{"8":0.00677,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00271,"7.0-7.1":0.2111,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.09878,"10.0-10.2":0.02977,"10.3":0.20704,"11.0-11.2":0.12179,"11.3-11.4":0.12179,"12.0-12.1":0.12585,"12.2-12.5":2.82821,"13.0-13.1":0.05413,"13.2":0.04195,"13.3":0.19486,"13.4-13.7":0.59541,"14.0-14.4":1.6252,"14.5-14.8":2.49802,"15.0-15.1":1.66039,"15.2-15.3":3.04743,"15.4":0.05819},P:{"4":0.89223,"5.0-5.4":0.01034,"6.2-6.4":0.02028,"7.2-7.4":0.365,"8.2":0.03042,"9.2":0.04056,"10.1":0.05069,"11.1-11.2":0.22306,"12.0":0.16222,"13.0":0.13181,"14.0":0.16222,"15.0":0.17236,"16.0":1.21667},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00086,"4.2-4.3":0.00185,"4.4":0,"4.4.3-4.4.4":0.02757},A:{"6":0.00243,"11":0.04372,_:"7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00757},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.053},Q:{"10.4":0},O:{"0":0.11357},H:{"0":0.53758},L:{"0":60.07901},S:{"2.5":0.01514}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SO.js
new file mode 100644
index 0000000..98ba434
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SO.js
@@ -0,0 +1 @@
+module.exports={C:{"4":0.00172,"15":0.00515,"17":0.00686,"48":0.00172,"52":0.00343,"55":0.00343,"78":0.00343,"87":0.01201,"91":0.00343,"93":0.00172,"94":0.06346,"95":0.00686,"96":0.10633,"97":0.27269,"98":0.03087,_:"2 3 5 6 7 8 9 10 11 12 13 14 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 88 89 90 92 99 3.5 3.6"},D:{"11":0.00172,"23":0.01029,"24":0.00172,"25":0.00172,"33":0.00343,"38":0.00858,"39":0.00172,"40":0.00343,"43":0.01372,"45":0.00343,"49":0.00686,"53":0.00343,"56":0.00172,"60":0.00343,"63":0.01029,"65":0.00343,"67":0.00172,"68":0.00858,"70":0.00686,"71":0.00172,"73":0.00172,"74":0.00515,"75":0.02401,"76":0.00515,"77":0.01029,"78":0.00343,"79":0.05831,"80":0.01372,"81":0.01372,"83":0.00343,"84":0.00686,"86":0.02401,"87":0.01887,"88":0.00686,"89":0.00515,"90":0.01201,"91":0.01372,"92":0.04288,"93":0.01372,"94":0.01715,"95":0.08747,"96":0.17493,"97":3.42143,"98":7.8547,"99":0.01372,"100":0.01715,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 26 27 28 29 30 31 32 34 35 36 37 41 42 44 46 47 48 50 51 52 54 55 57 58 59 61 62 64 66 69 72 85 101"},F:{"53":0.01372,"78":0.00343,"79":0.00343,"80":0.00172,"82":0.04802,"83":0.25211,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01029,"13":0.00172,"14":0.01029,"15":0.00343,"16":0.01029,"17":0.01201,"18":0.05145,"84":0.01544,"85":0.00343,"87":0.00686,"89":0.01029,"90":0.00343,"92":0.02744,"93":0.00343,"94":0.00515,"95":0.00515,"96":0.04288,"97":0.36187,"98":1.1199,_:"79 80 81 83 86 88 91"},E:{"4":0,"12":0.00515,"13":0.00343,"14":0.06174,"15":0.02401,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1 11.1","5.1":0.00343,"10.1":0.01372,"12.1":0.00343,"13.1":0.01372,"14.1":0.07889,"15.1":0.08404,"15.2-15.3":0.09776,"15.4":0.00343},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00169,"6.0-6.1":0.00169,"7.0-7.1":0.0045,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04331,"10.0-10.2":0.00169,"10.3":0.01744,"11.0-11.2":0.00731,"11.3-11.4":0.00787,"12.0-12.1":0.03431,"12.2-12.5":0.59175,"13.0-13.1":0.12375,"13.2":0.01012,"13.3":0.07706,"13.4-13.7":0.17719,"14.0-14.4":0.76331,"14.5-14.8":1.07212,"15.0-15.1":1.04962,"15.2-15.3":1.60592,"15.4":0.03487},P:{"4":0.32607,"5.0-5.4":0.05095,"6.2-6.4":0.11209,"7.2-7.4":0.8865,"8.2":0.03042,"9.2":0.05095,"10.1":0.04084,"11.1-11.2":0.30569,"12.0":0.06114,"13.0":0.28531,"14.0":0.43815,"15.0":0.35664,"16.0":1.55901},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02752,"4.4":0,"4.4.3-4.4.4":0.20446},A:{"8":0.00343,"10":0.00343,"11":0.02401,_:"6 7 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.1657},Q:{"10.4":0},O:{"0":1.88898},H:{"0":2.20408},L:{"0":65.0104},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SR.js
new file mode 100644
index 0000000..e62ffc3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SR.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.03792,"78":0.00689,"91":0.00345,"95":0.01724,"96":0.56531,"97":0.87899,"98":0.08273,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 92 93 94 99 3.5 3.6"},D:{"49":0.03102,"53":0.01034,"63":0.01034,"65":0.02413,"68":0.00689,"69":0.00689,"70":0.00345,"71":0.00689,"72":0.00345,"75":0.04136,"76":0.01034,"79":0.03447,"80":0.03792,"81":0.02068,"83":0.00689,"84":0.01034,"85":0.01379,"86":0.00345,"87":0.05171,"88":0.06205,"89":0.01034,"90":0.01724,"91":0.01724,"92":0.00689,"93":0.09996,"94":0.02068,"95":0.03102,"96":0.41364,"97":6.01157,"98":16.1423,"99":0.04826,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 54 55 56 57 58 59 60 61 62 64 66 67 73 74 77 78 100 101"},F:{"28":0.00345,"63":0.09996,"82":0.1172,"83":0.5791,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05515,"13":0.01379,"15":0.00689,"16":0.00689,"17":0.01034,"18":0.08618,"84":0.00345,"85":0.01034,"90":0.01034,"92":0.01034,"93":0.01379,"95":0.00689,"96":0.14822,"97":0.73076,"98":3.31601,_:"14 79 80 81 83 86 87 88 89 91 94"},E:{"4":0,"13":0.00689,"14":0.07928,"15":0.01724,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.01379,"11.1":0.01379,"12.1":0.00689,"13.1":0.03447,"14.1":0.86864,"15.1":0.26542,"15.2-15.3":0.46535,"15.4":0.00345},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00484,"6.0-6.1":0,"7.0-7.1":0.02907,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07073,"10.0-10.2":0.00097,"10.3":0.12402,"11.0-11.2":0.00194,"11.3-11.4":0.01453,"12.0-12.1":0.01453,"12.2-12.5":0.8885,"13.0-13.1":0.10077,"13.2":0.00969,"13.3":0.14631,"13.4-13.7":0.14631,"14.0-14.4":0.374,"14.5-14.8":1.37974,"15.0-15.1":1.5057,"15.2-15.3":4.85042,"15.4":0.02325},P:{"4":0.67175,"5.0-5.4":0.08041,"6.2-6.4":0.14072,"7.2-7.4":0.62086,"8.2":0.03016,"9.2":0.04071,"10.1":0.03053,"11.1-11.2":0.36641,"12.0":0.12214,"13.0":0.16285,"14.0":0.21374,"15.0":0.39694,"16.0":6.94144},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00054,"4.2-4.3":0.00564,"4.4":0,"4.4.3-4.4.4":0.02659},A:{"11":0.10686,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.19004},Q:{"10.4":0},O:{"0":0.38663},H:{"0":0.22334},L:{"0":42.71467},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ST.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ST.js
new file mode 100644
index 0000000..fc18072
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ST.js
@@ -0,0 +1 @@
+module.exports={C:{"56":0.02655,"94":0.01328,"95":0.15045,"96":0.10178,"97":1.62398,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 98 99 3.5 3.6"},D:{"38":0.02655,"40":0.07523,"43":0.02655,"64":0.06195,"65":0.04868,"68":0.2124,"69":0.10178,"75":3.92498,"79":0.50445,"81":0.04868,"86":0.03983,"88":0.02655,"89":9.01815,"92":0.07523,"93":0.03983,"94":0.06195,"95":0.02655,"96":0.10178,"97":5.76135,"98":10.27485,"99":0.04868,_:"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 39 41 42 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 66 67 70 71 72 73 74 76 77 78 80 83 84 85 87 90 91 100 101"},F:{"28":0.02655,"83":0.3894,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.02655,"18":0.04868,"91":0.04868,"92":0.04868,"93":0.01328,"94":0.01328,"96":0.03983,"97":1.31865,"98":2.70368,_:"12 13 15 16 17 79 80 81 83 84 85 86 87 88 89 90 95"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 6.1 7.1 9.1 10.1 11.1 12.1 14.1 15.4","5.1":0.04868,"13.1":0.01328,"15.1":0.03983,"15.2-15.3":0.11505},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.01058,"12.0-12.1":0,"12.2-12.5":0.22179,"13.0-13.1":0,"13.2":0.01058,"13.3":0,"13.4-13.7":0.02115,"14.0-14.4":0.02115,"14.5-14.8":0.50734,"15.0-15.1":0.60221,"15.2-15.3":1.62686,"15.4":0},P:{"4":0.08216,"5.0-5.4":0.01121,"6.2-6.4":0.04087,"7.2-7.4":0.03081,"8.2":0.16348,"9.2":0.01027,"10.1":0.01033,"11.1-11.2":0.01027,"12.0":0.01027,"13.0":0.06162,"14.0":0.07189,"15.0":0.18486,"16.0":0.51349},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00365,"4.2-4.3":0.00075,"4.4":0,"4.4.3-4.4.4":0.03463},A:{"11":0.49118,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.17283},Q:{"10.4":0.01115},O:{"0":1.33243},H:{"0":0.13723},L:{"0":44.10515},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SV.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SV.js
new file mode 100644
index 0000000..ce57f39
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SV.js
@@ -0,0 +1 @@
+module.exports={C:{"35":0.00897,"52":0.02242,"68":0.00448,"70":0.03138,"73":0.04035,"78":0.01793,"80":0.00448,"88":0.01345,"89":0.01345,"90":0.17484,"91":0.0269,"92":0.00448,"93":0.00448,"94":0.02242,"95":0.0269,"96":0.67693,"97":1.12523,"98":0.00897,_:"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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 71 72 74 75 76 77 79 81 82 83 84 85 86 87 99 3.5 3.6"},D:{"38":0.00897,"47":0.00448,"49":0.05828,"53":0.00897,"55":0.00448,"65":0.00448,"66":0.00448,"67":0.00897,"69":0.00897,"70":0.00897,"71":0.01793,"72":0.01793,"73":0.01345,"74":0.03586,"75":0.0269,"76":0.03138,"77":0.01793,"78":0.01345,"79":0.15691,"80":0.01345,"81":0.01793,"83":0.01345,"84":0.02242,"85":0.01793,"86":0.03138,"87":0.04035,"88":0.02242,"89":0.0269,"90":0.03586,"91":0.14794,"92":0.05828,"93":0.04035,"94":0.11208,"95":0.07173,"96":0.41244,"97":8.66116,"98":21.37046,"99":0.00448,"100":0.00897,_:"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 39 40 41 42 43 44 45 46 48 50 51 52 54 56 57 58 59 60 61 62 63 64 68 101"},F:{"36":0.00448,"46":0.00897,"77":0.00448,"80":0.00448,"82":0.45727,"83":1.28214,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00897,"16":0.00448,"17":0.00448,"18":0.02242,"84":0.01345,"87":0.00448,"89":0.00448,"92":0.01793,"94":0.0269,"95":0.01345,"96":0.09863,"97":0.67245,"98":2.78394,_:"12 13 14 79 80 81 83 85 86 88 90 91 93"},E:{"4":0,"12":0.01345,"13":0.04931,"14":0.08069,"15":0.08966,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 9.1","5.1":0.0269,"10.1":0.00448,"11.1":0.00448,"12.1":0.01345,"13.1":0.07173,"14.1":0.22863,"15.1":0.17484,"15.2-15.3":0.31829,"15.4":0.00448},G:{"8":0,"3.2":0.00102,"4.0-4.1":0.00102,"4.2-4.3":0,"5.0-5.1":0.00102,"6.0-6.1":0.01229,"7.0-7.1":0.01639,"8.1-8.4":0.00102,"9.0-9.2":0,"9.3":0.02766,"10.0-10.2":0.00051,"10.3":0.01946,"11.0-11.2":0.00461,"11.3-11.4":0.00717,"12.0-12.1":0.00768,"12.2-12.5":0.24331,"13.0-13.1":0.00563,"13.2":0.00461,"13.3":0.02151,"13.4-13.7":0.07581,"14.0-14.4":0.32578,"14.5-14.8":0.87899,"15.0-15.1":0.65771,"15.2-15.3":2.78911,"15.4":0.01742},P:{"4":0.17686,"5.0-5.4":0.01013,"6.2-6.4":0.04052,"7.2-7.4":0.20807,"8.2":0.0104,"9.2":0.02081,"10.1":0.06153,"11.1-11.2":0.13525,"12.0":0.03121,"13.0":0.18726,"14.0":0.14565,"15.0":0.11444,"16.0":1.51891},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00398,"4.2-4.3":0.00497,"4.4":0,"4.4.3-4.4.4":0.05173},A:{"11":0.08069,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.54067},Q:{"10.4":0},O:{"0":0.09379},H:{"0":0.18803},L:{"0":45.00528},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SY.js
new file mode 100644
index 0000000..91189fe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SY.js
@@ -0,0 +1 @@
+module.exports={C:{"16":0.00261,"30":0.00391,"35":0.0013,"38":0.00391,"41":0.0013,"43":0.00261,"47":0.00522,"48":0.00261,"52":0.04434,"53":0.0013,"54":0.0013,"56":0.00522,"57":0.0013,"60":0.0013,"61":0.0013,"66":0.0013,"70":0.0013,"72":0.01304,"74":0.00261,"76":0.00261,"78":0.01304,"80":0.00261,"81":0.00261,"83":0.0013,"84":0.04303,"85":0.00261,"86":0.00391,"87":0.0013,"88":0.00391,"89":0.01043,"90":0.00261,"91":0.01174,"92":0.00522,"93":0.00522,"94":0.04434,"95":0.0313,"96":0.50726,"97":0.8476,"98":0.00261,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 33 34 36 37 39 40 42 44 45 46 49 50 51 55 58 59 62 63 64 65 67 68 69 71 73 75 77 79 82 99 3.5 3.6"},D:{"11":0.00261,"24":0.0013,"28":0.0013,"33":0.0013,"36":0.00522,"38":0.00522,"39":0.00261,"40":0.0013,"42":0.00261,"43":0.01434,"49":0.01043,"50":0.0013,"51":0.0013,"52":0.00522,"53":0.00391,"55":0.00261,"56":0.00261,"57":0.00261,"58":0.00261,"60":0.00391,"61":0.0013,"62":0.00261,"63":0.0313,"64":0.00261,"65":0.00522,"66":0.00522,"67":0.00652,"68":0.00261,"69":0.01174,"70":0.0639,"71":0.01043,"72":0.00782,"73":0.00652,"74":0.00261,"75":0.00391,"76":0.00261,"77":0.00391,"78":0.01043,"79":0.04694,"80":0.01565,"81":0.01956,"83":0.01956,"84":0.00913,"85":0.01434,"86":0.02347,"87":0.11997,"88":0.02086,"89":0.02738,"90":0.02869,"91":0.07042,"92":0.05346,"93":0.04694,"94":0.02999,"95":0.05607,"96":0.24776,"97":2.32634,"98":5.42986,"99":0.00522,"100":0.00652,"101":0.00261,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 29 30 31 32 34 35 37 41 44 45 46 47 48 54 59"},F:{"69":0.0013,"79":0.0013,"80":0.01304,"82":0.07694,"83":0.31557,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00522,"14":0.00261,"15":0.00522,"16":0.00391,"17":0.01304,"18":0.0326,"84":0.00913,"86":0.0013,"89":0.00522,"90":0.00522,"91":0.0013,"92":0.01695,"93":0.0013,"94":0.0013,"95":0.00913,"96":0.01304,"97":0.16822,"98":0.5542,_:"13 79 80 81 83 85 87 88"},E:{"4":0,"13":0.00261,"14":0.01304,"15":0.00522,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1","5.1":0.05477,"10.1":0.00913,"11.1":0.00261,"12.1":0.0013,"13.1":0.01043,"14.1":0.04564,"15.1":0.03912,"15.2-15.3":0.08476,"15.4":0.0013},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00293,"6.0-6.1":0.00176,"7.0-7.1":0.03108,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.10087,"10.0-10.2":0.00469,"10.3":0.05278,"11.0-11.2":0.01877,"11.3-11.4":0.04574,"12.0-12.1":0.06334,"12.2-12.5":0.4457,"13.0-13.1":0.0305,"13.2":0.00645,"13.3":0.04633,"13.4-13.7":0.12667,"14.0-14.4":0.32783,"14.5-14.8":0.59584,"15.0-15.1":1.08435,"15.2-15.3":2.85251,"15.4":0.02229},P:{"4":2.07895,"5.0-5.4":0.08035,"6.2-6.4":0.18078,"7.2-7.4":0.41177,"8.2":0.04017,"9.2":0.27117,"10.1":0.18078,"11.1-11.2":0.31134,"12.0":0.16069,"13.0":0.62268,"14.0":0.96415,"15.0":0.55238,"16.0":1.7877},I:{"0":0,"3":0,"4":0.00171,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01641,"4.2-4.3":0.02964,"4.4":0,"4.4.3-4.4.4":0.16092},A:{"11":0.05607,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.15651},Q:{"10.4":0},O:{"0":1.11296},H:{"0":1.60521},L:{"0":70.09159},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SZ.js
new file mode 100644
index 0000000..8fb3093
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/SZ.js
@@ -0,0 +1 @@
+module.exports={C:{"23":0.02002,"27":0.005,"34":0.01751,"36":0.01751,"52":0.01251,"60":0.05004,"61":0.00751,"76":0.01251,"77":0.005,"78":0.005,"88":0.01001,"89":0.01001,"91":0.02002,"92":0.005,"94":0.005,"96":0.81815,"97":0.3803,"98":0.03002,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 28 29 30 31 32 33 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 62 63 64 65 66 67 68 69 70 71 72 73 74 75 79 80 81 82 83 84 85 86 87 90 93 95 99 3.5 3.6"},D:{"26":0.005,"36":0.00751,"49":0.00751,"59":0.0025,"63":0.005,"68":0.005,"69":0.00751,"70":0.02002,"74":0.04754,"75":0.0025,"76":0.00751,"78":0.0025,"79":0.01251,"80":0.005,"81":0.01751,"83":0.01001,"84":0.0025,"85":0.01751,"86":0.02252,"87":0.03002,"88":0.02752,"89":0.005,"90":0.01001,"91":0.02502,"92":0.02752,"93":0.0025,"94":0.10008,"95":0.04504,"96":0.18014,"97":3.68044,"98":6.72287,"99":0.00751,"100":0.01501,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 60 61 62 64 65 66 67 71 72 73 77 101"},F:{"36":0.005,"37":0.005,"60":0.01001,"62":0.0025,"63":0.005,"65":0.0025,"66":0.00751,"77":0.03753,"79":0.06005,"80":0.005,"82":0.07006,"83":1.26601,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 64 67 68 69 70 71 72 73 74 75 76 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01751,"13":0.02252,"14":0.0025,"15":0.01251,"16":0.01751,"17":0.02752,"18":0.10258,"80":0.005,"84":0.01251,"85":0.01751,"86":0.26021,"89":0.01001,"90":0.01751,"92":0.01501,"93":0.005,"94":0.00751,"95":0.0025,"96":0.02752,"97":0.71557,"98":1.78643,_:"79 81 83 87 88 91"},E:{"4":0,"8":0.00751,"13":0.00751,"14":0.01751,"15":0.01751,_:"0 5 6 7 9 10 11 12 3.1 3.2 6.1 7.1","5.1":0.005,"9.1":0.005,"10.1":0.00751,"11.1":0.0025,"12.1":0.0025,"13.1":0.02752,"14.1":0.03753,"15.1":0.46787,"15.2-15.3":0.8732,"15.4":0.02002},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00297,"8.1-8.4":0.00495,"9.0-9.2":0,"9.3":0.00792,"10.0-10.2":0,"10.3":0.18715,"11.0-11.2":0.01188,"11.3-11.4":0.00693,"12.0-12.1":0.01584,"12.2-12.5":0.21587,"13.0-13.1":0.01188,"13.2":0,"13.3":0.01188,"13.4-13.7":0.02872,"14.0-14.4":0.1921,"14.5-14.8":0.7704,"15.0-15.1":1.69825,"15.2-15.3":6.71674,"15.4":0.01386},P:{"4":0.35635,"5.0-5.4":0.08041,"6.2-6.4":0.14072,"7.2-7.4":0.67198,"8.2":0.03016,"9.2":0.02036,"10.1":0.03053,"11.1-11.2":0.09163,"12.0":0.04073,"13.0":0.18327,"14.0":0.1629,"15.0":0.18327,"16.0":1.19123},I:{"0":0,"3":0,"4":0.00023,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00046,"4.2-4.3":0.00103,"4.4":0,"4.4.3-4.4.4":0.02077},A:{"9":0.00751,"11":0.1251,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.015},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.09747},Q:{"10.4":0},O:{"0":1.18468},H:{"0":15.81573},L:{"0":48.96257},S:{"2.5":0.06748}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TC.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TC.js
new file mode 100644
index 0000000..eb709eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TC.js
@@ -0,0 +1 @@
+module.exports={C:{"56":0.04314,"68":0.00539,"92":0.01078,"93":0.02696,"96":0.674,"97":0.73331,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 94 95 98 99 3.5 3.6"},D:{"23":0.00539,"42":0.16715,"49":0.01078,"63":0.01618,"76":0.04314,"78":0.00539,"79":0.02157,"83":0.03774,"84":0.00539,"86":0.07549,"87":0.27499,"88":0.03774,"91":0.01618,"92":0.03235,"93":0.07549,"94":0.02157,"95":0.01078,"96":2.68522,"97":11.00507,"98":15.2324,"99":0.31274,"100":0.29656,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 65 66 67 68 69 70 71 72 73 74 75 77 80 81 85 89 90 101"},F:{"79":0.01078,"80":0.01078,"82":0.04853,"83":0.17794,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.01078,"16":0.01618,"17":4.84202,"18":0.16176,"80":0.00539,"96":0.03235,"97":1.42888,"98":4.62094,_:"12 13 15 79 81 83 84 85 86 87 88 89 90 91 92 93 94 95"},E:{"4":0,"13":0.10245,"14":0.30195,"15":0.66861,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.01618,"10.1":0.02696,"11.1":0.01078,"12.1":0.09706,"13.1":0.78184,"14.1":2.75531,"15.1":0.92203,"15.2-15.3":1.8225,"15.4":0.00539},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00443,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.03545,"9.0-9.2":0,"9.3":0.01329,"10.0-10.2":0,"10.3":0.04653,"11.0-11.2":0.01773,"11.3-11.4":0.00886,"12.0-12.1":0.03324,"12.2-12.5":0.91067,"13.0-13.1":0.0288,"13.2":0.00222,"13.3":0.03545,"13.4-13.7":0.10414,"14.0-14.4":0.72898,"14.5-14.8":4.0792,"15.0-15.1":3.38788,"15.2-15.3":12.69625,"15.4":0.01773},P:{"4":0.15843,"5.0-5.4":0.0102,"6.2-6.4":0.01036,"7.2-7.4":0.04225,"8.2":0.02073,"9.2":0.19011,"10.1":0.0204,"11.1-11.2":0.04225,"12.0":0.06121,"13.0":0.39078,"14.0":0.05281,"15.0":0.02112,"16.0":2.47144},I:{"0":0,"3":0,"4":0.00481,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.00441},A:{"11":0.17794,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.04148},Q:{"10.4":0},O:{"0":0.00461},H:{"0":0.17454},L:{"0":19.34237},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TD.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TD.js
new file mode 100644
index 0000000..a11acae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TD.js
@@ -0,0 +1 @@
+module.exports={C:{"17":0.00473,"35":0.00378,"37":0.00284,"41":0.00662,"47":0.00284,"52":0.0246,"55":0.00284,"57":0.01608,"58":0.00284,"61":0.00189,"66":0.00473,"72":0.035,"78":0.01041,"79":0.00095,"80":0.01135,"81":0.00095,"85":0.01324,"86":0.01608,"87":0.00095,"88":0.00284,"89":0.00757,"90":0.00095,"91":0.00189,"93":0.00284,"94":0.00284,"95":0.02933,"96":0.47395,"97":0.45881,"98":0.02081,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 36 38 39 40 42 43 44 45 46 48 49 50 51 53 54 56 59 60 62 63 64 65 67 68 69 70 71 73 74 75 76 77 82 83 84 92 99 3.5 3.6"},D:{"11":0.00284,"24":0.00378,"25":0.00568,"26":0.00189,"30":0.01987,"33":0.00095,"37":0.00946,"38":0.00189,"39":0.00095,"40":0.01324,"43":0.00284,"49":0.00568,"52":0.00189,"55":0.0123,"57":0.00378,"60":0.00568,"61":0.00189,"65":0.00473,"67":0.00473,"68":0.00851,"69":0.00095,"70":0.00284,"72":0.00095,"74":0.00189,"75":0.00662,"77":0.00851,"78":0.00284,"79":0.00189,"80":0.06433,"81":0.00851,"83":0.01987,"85":0.00189,"86":0.01419,"87":0.04635,"88":0.00189,"89":0.00189,"90":0.00946,"91":0.00189,"92":0.08609,"93":0.03406,"94":0.01987,"95":0.01135,"96":0.05771,"97":1.16074,"98":2.11053,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 27 28 29 31 32 34 35 36 41 42 44 45 46 47 48 50 51 53 54 56 58 59 62 63 64 66 71 73 76 84 99 100 101"},F:{"34":0.00284,"35":0.00284,"37":0.05487,"40":0.01135,"42":0.01797,"43":0.00284,"44":0.00189,"45":0.00095,"46":0.00473,"50":0.00662,"51":0.00095,"62":0.00189,"64":0.00568,"66":0.00189,"77":0.00189,"79":0.00946,"80":0.03027,"81":0.00946,"82":0.04825,"83":0.05203,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 36 38 39 41 47 48 49 52 53 54 55 56 57 58 60 63 65 67 68 69 70 71 72 73 74 75 76 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.07473,"13":0.01987,"14":0.05487,"15":0.00095,"16":0.00473,"17":0.01324,"18":0.02838,"80":0.00189,"84":0.01135,"85":0.01324,"89":0.01135,"90":0.00284,"91":0.00189,"92":0.02365,"93":0.00851,"94":0.01419,"95":0.03216,"96":0.16082,"97":0.21096,"98":0.45692,_:"79 81 83 86 87 88"},E:{"4":0,"11":0.00473,"13":0.00189,"14":0.00946,"15":0.00189,_:"0 5 6 7 8 9 10 12 3.1 3.2 6.1 11.1 15.4","5.1":0.00284,"7.1":0.00757,"9.1":0.00189,"10.1":0.00568,"12.1":0.00568,"13.1":0.01703,"14.1":0.00757,"15.1":0.00757,"15.2-15.3":0.03216},G:{"8":0.00068,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01559,"10.0-10.2":0.00407,"10.3":0.00881,"11.0-11.2":0.01694,"11.3-11.4":0.04066,"12.0-12.1":0.17144,"12.2-12.5":2.01735,"13.0-13.1":0.23108,"13.2":0.00136,"13.3":0.03049,"13.4-13.7":0.07522,"14.0-14.4":1.23535,"14.5-14.8":0.55702,"15.0-15.1":1.02392,"15.2-15.3":1.33835,"15.4":0.00407},P:{"4":0.84672,"5.0-5.4":0.0504,"6.2-6.4":0.04032,"7.2-7.4":0.21168,"8.2":0.01049,"9.2":0.16128,"10.1":0.04032,"11.1-11.2":0.24192,"12.0":0.0504,"13.0":0.3024,"14.0":0.63504,"15.0":0.23184,"16.0":0.74592},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00138,"4.4":0,"4.4.3-4.4.4":0.05295},A:{"11":0.25069,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01811},N:{_:"10 11"},R:{_:"0"},M:{"0":0.13581},Q:{"10.4":0.04527},O:{"0":0.5704},H:{"0":3.06011},L:{"0":77.16592},S:{"2.5":0.03622}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TG.js
new file mode 100644
index 0000000..d85f4ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TG.js
@@ -0,0 +1 @@
+module.exports={C:{"40":0.00684,"43":0.01369,"50":0.00684,"51":0.00684,"52":0.02738,"56":0.00342,"60":0.00684,"64":0.01027,"65":0.00342,"66":0.00342,"68":0.01027,"72":0.03764,"75":0.00342,"77":0.00684,"78":0.01711,"79":0.01027,"80":0.03764,"84":0.01027,"85":0.00684,"86":0.00342,"87":0.00684,"88":0.01711,"89":0.02395,"90":0.00342,"91":0.03764,"92":0.02395,"93":0.01369,"94":0.03764,"95":0.11635,"96":1.70073,"97":2.58361,"98":0.05475,_:"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 41 42 44 45 46 47 48 49 53 54 55 57 58 59 61 62 63 67 69 70 71 73 74 76 81 82 83 99 3.5 3.6"},D:{"11":0.00342,"29":0.0308,"31":0.20874,"33":0.05133,"43":0.07528,"45":0.00342,"48":0.00342,"49":0.05475,"50":0.00342,"51":0.00342,"55":0.02738,"58":0.00684,"59":0.00684,"60":0.00684,"63":0.01027,"64":0.00342,"65":0.02053,"69":0.00342,"70":0.00342,"72":0.04106,"73":0.01027,"74":0.00684,"75":0.00684,"76":0.01027,"77":0.01027,"78":0.00684,"79":0.03764,"80":0.02395,"81":0.05475,"83":0.01711,"84":0.04791,"85":0.01711,"86":0.06844,"87":0.02738,"88":0.01711,"89":0.03422,"90":0.01369,"91":0.02738,"92":0.22585,"93":0.05133,"94":0.02738,"95":0.07871,"96":0.61254,"97":3.89766,"98":10.25573,"99":0.02053,"100":0.03422,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 30 32 34 35 36 37 38 39 40 41 42 44 46 47 52 53 54 56 57 61 62 66 67 68 71 101"},F:{"70":0.01027,"79":0.02395,"80":0.00684,"81":0.00684,"82":0.24296,"83":1.98476,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01027,"13":0.00684,"14":0.00684,"15":0.02053,"16":0.00342,"17":0.20532,"18":0.03422,"83":0.00684,"84":0.01027,"85":0.00342,"89":0.00342,"92":0.03422,"95":0.01711,"96":0.04106,"97":0.55094,"98":2.00187,_:"79 80 81 86 87 88 90 91 93 94"},E:{"4":0,"13":0.00342,"14":0.02738,"15":0.00342,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 11.1 15.4","5.1":0.01369,"12.1":0.00684,"13.1":0.05817,"14.1":0.10266,"15.1":0.02738,"15.2-15.3":0.05817},G:{"8":0.00062,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.02618,"5.0-5.1":0.02805,"6.0-6.1":0,"7.0-7.1":0.08165,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.06482,"10.0-10.2":0,"10.3":0.08789,"11.0-11.2":0.10098,"11.3-11.4":0.00748,"12.0-12.1":0.05111,"12.2-12.5":1.02223,"13.0-13.1":0.00436,"13.2":0.00125,"13.3":0.10472,"13.4-13.7":0.18762,"14.0-14.4":0.4625,"14.5-14.8":1.03906,"15.0-15.1":0.75919,"15.2-15.3":2.1685,"15.4":0.03117},P:{"4":0.07814,"5.0-5.4":0.01116,"6.2-6.4":0.01036,"7.2-7.4":0.03349,"8.2":0.02073,"9.2":0.04146,"10.1":0.05182,"11.1-11.2":0.02233,"12.0":0.02073,"13.0":0.04465,"14.0":0.02233,"15.0":0.05581,"16.0":0.46883},I:{"0":0,"3":0,"4":0.00106,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00212,"4.2-4.3":0.00531,"4.4":0,"4.4.3-4.4.4":0.06386},A:{"11":0.29429,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.12498},Q:{"10.4":0.03289},O:{"0":0.78278},H:{"0":3.18232},L:{"0":52.9161},S:{"2.5":0.01316}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TH.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TH.js
new file mode 100644
index 0000000..f7f4caa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TH.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.04137,"53":0.00414,"54":0.00414,"55":0.00827,"56":0.08274,"68":0.00827,"69":0.00414,"70":0.00414,"71":0.00414,"72":0.00827,"73":0.00414,"74":0.00414,"75":0.00414,"76":0.00414,"77":0.00414,"78":0.02482,"79":0.00827,"80":0.00827,"81":0.00827,"82":0.00827,"83":0.00827,"84":0.00414,"88":0.00827,"89":0.00827,"91":0.01241,"94":0.00827,"95":0.02896,"96":0.51299,"97":0.88118,"98":0.00827,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 57 58 59 60 61 62 63 64 65 66 67 85 86 87 90 92 93 99 3.5 3.6"},D:{"25":0.00414,"38":0.00827,"43":0.01241,"47":0.00414,"48":0.00414,"49":0.07447,"53":0.02482,"56":0.01655,"57":0.00827,"58":0.01241,"63":0.00827,"65":0.01241,"66":0.00414,"67":0.00414,"68":0.04964,"69":0.03723,"70":0.04137,"71":0.03723,"72":0.04964,"73":0.02069,"74":0.06206,"75":0.04551,"76":0.04551,"77":0.04137,"78":0.05792,"79":0.12825,"80":0.0786,"81":0.06619,"83":0.0786,"84":0.0786,"85":0.08688,"86":0.12825,"87":0.11584,"88":0.08688,"89":0.07447,"90":0.08274,"91":0.06619,"92":0.06619,"93":0.0786,"94":0.07033,"95":0.06206,"96":0.26891,"97":8.01751,"98":19.79141,"99":0.02896,"100":0.02069,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 44 45 46 50 51 52 54 55 59 60 61 62 64 101"},F:{"28":0.01241,"46":0.00414,"53":0.00414,"54":0.00827,"55":0.00827,"70":0.00414,"71":0.00414,"82":0.05378,"83":0.42197,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 56 57 58 60 62 63 64 65 66 67 68 69 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6","10.0-10.1":0,"12.1":0.00827},B:{"14":0.00414,"16":0.00827,"17":0.00827,"18":0.02896,"80":0.00827,"81":0.00827,"83":0.00827,"84":0.01655,"85":0.00827,"86":0.01241,"87":0.00827,"88":0.00827,"89":0.01241,"90":0.00827,"91":0.00414,"92":0.00827,"94":0.00827,"95":0.00827,"96":0.02896,"97":0.59987,"98":2.23398,_:"12 13 15 79 93"},E:{"4":0,"13":0.0331,"14":0.14893,"15":0.21099,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1","9.1":0.25236,"10.1":0.00414,"11.1":0.00827,"12.1":0.01655,"13.1":0.11584,"14.1":0.7157,"15.1":0.52954,"15.2-15.3":1.1294,"15.4":0.00827},G:{"8":0.0074,"3.2":0.00148,"4.0-4.1":0.00296,"4.2-4.3":0.01036,"5.0-5.1":0.01184,"6.0-6.1":0.0222,"7.0-7.1":0.03107,"8.1-8.4":0.03995,"9.0-9.2":0.02959,"9.3":0.08582,"10.0-10.2":0.03699,"10.3":0.08878,"11.0-11.2":0.0725,"11.3-11.4":0.05919,"12.0-12.1":0.0725,"12.2-12.5":0.68509,"13.0-13.1":0.05771,"13.2":0.02515,"13.3":0.09766,"13.4-13.7":0.24859,"14.0-14.4":0.70876,"14.5-14.8":2.46809,"15.0-15.1":2.46662,"15.2-15.3":7.4324,"15.4":0.03551},P:{"4":0.14731,_:"5.0-5.4 6.2-6.4 8.2","7.2-7.4":0.12627,"9.2":0.04209,"10.1":0.06313,"11.1-11.2":0.15783,"12.0":0.04209,"13.0":0.08418,"14.0":0.14731,"15.0":0.12627,"16.0":1.83086},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00235,"4.2-4.3":0.0086,"4.4":0,"4.4.3-4.4.4":0.03596},A:{"8":0.00849,"9":0.00849,"11":0.3057,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.12899},Q:{"10.4":0},O:{"0":0.2697},H:{"0":0.23313},L:{"0":41.06986},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TJ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TJ.js
new file mode 100644
index 0000000..d0b32f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TJ.js
@@ -0,0 +1 @@
+module.exports={C:{"28":0.00253,"35":0.00253,"50":0.00253,"52":0.08841,"77":0.00253,"78":0.02526,"79":0.00758,"80":0.00758,"81":0.0101,"82":0.00758,"83":0.00758,"88":0.11367,"91":0.01263,"92":0.00505,"94":0.01768,"95":0.02273,"96":0.42184,"97":0.89926,_:"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 29 30 31 32 33 34 36 37 38 39 40 41 42 43 44 45 46 47 48 49 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 84 85 86 87 89 90 93 98 99 3.5 3.6"},D:{"11":0.02779,"23":0.00253,"35":0.00505,"38":0.00253,"43":0.00253,"44":0.08083,"47":0.00758,"48":0.13135,"49":0.06062,"54":0.00505,"56":0.00253,"57":0.0101,"58":0.00758,"59":0.00505,"62":0.01516,"63":0.00505,"64":0.00758,"67":0.01263,"69":0.01768,"70":0.01516,"71":0.01516,"72":0.00253,"73":0.00505,"74":0.01263,"75":0.04294,"76":0.00758,"77":0.00253,"78":0.0101,"79":0.23744,"80":0.01516,"81":0.02526,"83":0.03284,"84":0.23997,"85":0.29554,"86":0.05557,"87":0.53299,"88":0.02021,"89":0.06568,"90":0.0101,"91":0.04042,"92":0.05052,"93":0.00758,"94":0.04042,"95":0.05557,"96":0.35111,"97":3.95824,"98":8.70712,"100":0.01263,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 32 33 34 36 37 39 40 41 42 45 46 50 51 52 53 55 60 61 65 66 68 99 101"},F:{"11":0.00253,"36":0.01768,"42":0.00758,"56":0.00253,"57":0.00253,"66":0.00505,"67":0.02021,"68":0.05557,"77":0.00253,"79":0.00505,"80":0.00253,"82":0.08588,"83":0.93209,_:"9 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 58 60 62 63 64 65 69 70 71 72 73 74 75 76 78 81 9.5-9.6 10.6 11.1 11.5 11.6","10.0-10.1":0,"10.5":0.00253,"12.1":0.00505},B:{"12":0.00505,"13":0.00505,"14":0.00253,"17":0.00253,"18":0.04547,"84":0.03536,"85":0.00505,"86":0.09346,"91":0.00758,"92":0.00505,"95":0.0101,"96":0.0101,"97":0.12377,"98":0.54056,_:"15 16 79 80 81 83 87 88 89 90 93 94"},E:{"4":0,"13":0.00758,"14":0.02021,"15":0.02021,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 12.1 15.4","5.1":1.66716,"11.1":0.05557,"13.1":0.04042,"14.1":0.22987,"15.1":0.14146,"15.2-15.3":0.17935},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00315,"5.0-5.1":0.0063,"6.0-6.1":0.00315,"7.0-7.1":0.00945,"8.1-8.4":0,"9.0-9.2":0.00315,"9.3":0.05734,"10.0-10.2":0.00567,"10.3":0.07499,"11.0-11.2":0.02584,"11.3-11.4":0.04726,"12.0-12.1":0.27538,"12.2-12.5":0.51547,"13.0-13.1":0.04159,"13.2":0.01954,"13.3":0.08633,"13.4-13.7":0.17203,"14.0-14.4":0.59298,"14.5-14.8":0.80409,"15.0-15.1":1.02149,"15.2-15.3":2.52002,"15.4":0.01449},P:{"4":1.16404,"5.0-5.4":0.17059,"6.2-6.4":0.21073,"7.2-7.4":0.59206,"8.2":0.05017,"9.2":0.34118,"10.1":0.08028,"11.1-11.2":0.36125,"12.0":0.18063,"13.0":0.4315,"14.0":0.51178,"15.0":0.35122,"16.0":1.90662},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.0018,"4.1":0.0084,"4.2-4.3":0.0114,"4.4":0,"4.4.3-4.4.4":0.0606},A:{"8":0.01087,"9":0.03805,"10":0.01359,"11":0.1522,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.0822},Q:{"10.4":0},O:{"0":1.6889},H:{"0":2.21446},L:{"0":56.84675},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TK.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TK.js
new file mode 100644
index 0000000..bc928f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TK.js
@@ -0,0 +1 @@
+module.exports={C:{_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 3.5 3.6"},D:{"97":0.0335,"98":0.13958,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 99 100 101"},F:{_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"98":0.00558,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1","15.1":18.37924,"15.2-15.3":17.43013,"15.4":0.01117},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.00439,"13.0-13.1":0,"13.2":0.00439,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0.00439,"15.0-15.1":10.90159,"15.2-15.3":32.69162,"15.4":0.24119},P:{"4":0.07814,"5.0-5.4":0.01116,"6.2-6.4":0.01036,"7.2-7.4":0.03349,"8.2":0.02073,"9.2":0.04146,"10.1":0.05182,"11.1-11.2":0.02233,"12.0":0.02073,"13.0":0.04465,"14.0":0.02233,"15.0":0.05581,"16.0":0.46883},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.00558,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0},H:{"0":0},L:{"0":0.31361},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TL.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TL.js
new file mode 100644
index 0000000..588199c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TL.js
@@ -0,0 +1 @@
+module.exports={C:{"7":0.00466,"15":0.01397,"18":0.00466,"21":0.02329,"23":0.00932,"24":0.00466,"29":0.01863,"30":0.00466,"33":0.00932,"34":0.02329,"37":0.04192,"38":0.00932,"39":0.00466,"40":0.01863,"41":0.13042,"43":0.02329,"44":0.01397,"45":0.01863,"46":0.00932,"47":0.09782,"48":0.04192,"49":0.00932,"52":0.00932,"54":0.01397,"56":0.06055,"57":0.09316,"58":0.00466,"61":0.16769,"65":0.00466,"67":0.03726,"68":0.03261,"70":0.00466,"72":0.0559,"77":0.00932,"78":0.0559,"79":0.41922,"80":0.00466,"81":0.02329,"83":0.00932,"84":0.01397,"85":0.03261,"86":0.04192,"88":0.02795,"89":0.02795,"90":0.00932,"91":0.11645,"92":0.06987,"93":0.07453,"94":0.06055,"95":0.22358,"96":3.9593,"97":4.67663,"98":0.40059,_:"2 3 4 5 6 8 9 10 11 12 13 14 16 17 19 20 22 25 26 27 28 31 32 35 36 42 50 51 53 55 59 60 62 63 64 66 69 71 73 74 75 76 82 87 99 3.5 3.6"},D:{"30":0.00932,"31":0.01397,"40":0.01397,"43":0.04658,"47":0.00932,"49":0.02795,"56":0.00932,"57":0.00932,"58":0.27482,"61":0.07453,"62":0.04192,"63":0.09782,"64":0.00466,"65":0.02795,"67":0.01863,"68":0.01397,"71":0.01397,"72":0.00932,"73":0.00932,"74":0.01863,"75":0.01397,"77":0.00466,"78":0.01397,"79":0.04192,"80":0.03261,"83":0.00932,"84":0.10713,"85":0.00932,"86":0.01863,"87":0.53567,"88":0.01863,"89":0.02329,"90":0.01863,"91":0.03261,"92":0.0559,"93":0.02795,"94":0.10713,"95":0.12111,"96":0.58225,"97":7.37827,"98":15.52046,"99":0.00932,"100":0.00932,_:"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 32 33 34 35 36 37 38 39 41 42 44 45 46 48 50 51 52 53 54 55 59 60 66 69 70 76 81 101"},F:{"56":0.03726,"65":0.00466,"79":0.00466,"82":0.08384,"83":1.14121,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 57 58 60 62 63 64 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.06055,"13":0.01397,"14":0.00466,"15":0.04658,"16":0.03261,"17":0.02329,"18":0.13508,"84":0.01863,"85":0.02329,"89":0.01397,"90":0.01863,"91":0.00466,"92":0.01863,"93":0.02795,"94":0.03261,"95":0.02329,"96":0.21427,"97":1.04805,"98":4.05246,_:"79 80 81 83 86 87 88"},E:{"4":0,"8":0.01863,"11":0.00932,"12":0.01863,"13":0.00466,"14":0.18166,"15":0.02795,_:"0 5 6 7 9 10 3.1 3.2 5.1 6.1 7.1 15.4","9.1":0.02795,"10.1":0.01863,"11.1":0.01397,"12.1":0.06521,"13.1":0.12111,"14.1":0.24687,"15.1":0.14906,"15.2-15.3":0.20495},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00401,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00802,"9.3":0.00516,"10.0-10.2":0.00458,"10.3":0.04814,"11.0-11.2":0.01261,"11.3-11.4":0.05273,"12.0-12.1":0.0682,"12.2-12.5":0.76453,"13.0-13.1":0.06533,"13.2":0.01662,"13.3":0.13468,"13.4-13.7":0.20976,"14.0-14.4":1.24423,"14.5-14.8":1.59669,"15.0-15.1":0.65736,"15.2-15.3":0.83503,"15.4":0},P:{"4":0.24874,"5.0-5.4":0.02059,"6.2-6.4":0.01036,"7.2-7.4":0.11401,"8.2":0.02073,"9.2":0.04146,"10.1":0.05182,"11.1-11.2":0.18655,"12.0":0.02073,"13.0":0.13473,"14.0":0.32129,"15.0":0.16583,"16.0":0.4042},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00102,"4.2-4.3":0.00153,"4.4":0,"4.4.3-4.4.4":0.00814},A:{"11":0.31674,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.03206},Q:{"10.4":0.02672},O:{"0":0.55033},H:{"0":1.86149},L:{"0":44.20826},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TM.js
new file mode 100644
index 0000000..bb9f61f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TM.js
@@ -0,0 +1 @@
+module.exports={C:{"41":0.00669,"48":0.02006,"51":0.04013,"52":0.02006,"56":0.00669,"60":0.02675,"68":0.02006,"71":0.01338,"72":0.01338,"81":0.00669,"82":0.37453,"84":0.02006,"88":0.02006,"89":0.01338,"91":0.04682,"93":0.00669,"94":0.01338,"95":0.03344,"96":0.29427,"97":0.23408,_:"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 40 42 43 44 45 46 47 49 50 53 54 55 57 58 59 61 62 63 64 65 66 67 69 70 73 74 75 76 77 78 79 80 83 85 86 87 90 92 98 99 3.5 3.6"},D:{"49":0.00669,"55":0.00669,"66":0.01338,"67":0.02675,"70":0.00669,"71":0.02675,"78":0.10032,"79":0.26083,"83":0.1137,"84":0.01338,"85":0.04013,"86":0.06688,"87":0.02675,"89":0.07357,"90":0.10032,"91":0.82931,"92":0.81594,"93":0.06019,"94":0.01338,"95":0.00669,"96":0.19395,"97":14.31901,"98":31.23296,"100":0.02006,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 56 57 58 59 60 61 62 63 64 65 68 69 72 73 74 75 76 77 80 81 88 99 101"},F:{"28":0.02675,"47":0.54173,"54":0.01338,"76":0.04682,"77":0.03344,"81":0.02006,"82":0.0535,"83":0.41466,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 48 49 50 51 52 53 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.02006,"18":0.00669,"88":0.00669,"94":0.01338,"95":0.00669,"96":0.01338,"97":0.32771,"98":1.96627,_:"12 13 15 16 17 79 80 81 83 84 85 86 87 89 90 91 92 93"},E:{"4":0,"11":0.1137,"12":0.01338,"14":1.13027,_:"0 5 6 7 8 9 10 13 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 13.1 15.4","12.1":0.00669,"14.1":0.2809,"15.1":0.06019,"15.2-15.3":0.20733},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04035,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.00605,"12.0-12.1":0,"12.2-12.5":0.02623,"13.0-13.1":0,"13.2":0.00605,"13.3":0.01412,"13.4-13.7":0.00605,"14.0-14.4":0.14324,"14.5-14.8":0.05447,"15.0-15.1":8.59046,"15.2-15.3":11.27977,"15.4":0.00605},P:{"4":0.06226,"5.0-5.4":0.0102,"6.2-6.4":0.01036,"7.2-7.4":0.06226,"8.2":0.02073,"9.2":0.0306,"10.1":0.0204,"11.1-11.2":0.13261,"12.0":0.06121,"13.0":0.08302,"14.0":0.15302,"15.0":0.04151,"16.0":0.45661},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00192,"4.4":0,"4.4.3-4.4.4":0.00471},A:{"10":0.15252,"11":3.25836,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.41413},Q:{"10.4":0.01325},O:{"0":0.815},H:{"0":0},L:{"0":8.23535},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TN.js
new file mode 100644
index 0000000..feac9ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TN.js
@@ -0,0 +1 @@
+module.exports={C:{"43":0.00436,"52":0.09592,"60":0.00436,"72":0.00436,"78":0.03488,"80":0.00872,"81":0.00436,"82":0.01308,"84":0.13952,"87":0.00436,"88":0.02616,"89":0.00872,"91":0.03052,"92":0.00872,"93":0.00436,"94":0.01308,"95":0.02616,"96":0.64528,"97":0.97664,"98":0.00872,_:"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 40 41 42 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 83 85 86 90 99 3.5 3.6"},D:{"38":0.00436,"39":0.01308,"42":0.00436,"43":0.00436,"47":0.00872,"49":0.20492,"50":0.00436,"55":0.00436,"56":0.0218,"58":0.00872,"60":0.00436,"62":0.00436,"63":0.01744,"64":0.00872,"65":0.01308,"66":0.00872,"67":0.01744,"68":0.01308,"69":0.00872,"70":0.01744,"71":0.01308,"72":0.01308,"73":0.00872,"74":0.01308,"75":0.01308,"76":0.00872,"77":0.01744,"78":0.01744,"79":0.05668,"80":0.03052,"81":0.03488,"83":0.0436,"84":0.05232,"85":0.06976,"86":0.07848,"87":0.72376,"88":0.03052,"89":0.06976,"90":0.0654,"91":0.0872,"92":0.10028,"93":0.4578,"94":0.05232,"95":0.10028,"96":0.55372,"97":9.02084,"98":20.66204,"99":0.01308,"100":0.03052,_:"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 40 41 44 45 46 48 51 52 53 54 57 59 61 101"},F:{"40":0.00872,"71":0.00436,"82":0.7848,"83":2.27156,_:"9 11 12 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 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00872,"13":0.01308,"16":0.00436,"17":0.00436,"18":0.0218,"84":0.00436,"85":0.00436,"89":0.00436,"92":0.03488,"94":0.00436,"95":0.01744,"96":0.03052,"97":0.55372,"98":1.90096,_:"14 15 79 80 81 83 86 87 88 90 91 93"},E:{"4":0,"13":0.10028,"14":0.03488,"15":0.03924,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.00872,"12.1":0.00872,"13.1":0.03924,"14.1":0.11336,"15.1":0.06104,"15.2-15.3":0.06976},G:{"8":0.00037,"3.2":0.00037,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01373,"6.0-6.1":0.00111,"7.0-7.1":0.03526,"8.1-8.4":0.00223,"9.0-9.2":0.00223,"9.3":0.05382,"10.0-10.2":0.00482,"10.3":0.06235,"11.0-11.2":0.02004,"11.3-11.4":0.01485,"12.0-12.1":0.01485,"12.2-12.5":0.2906,"13.0-13.1":0.00557,"13.2":0.00631,"13.3":0.0308,"13.4-13.7":0.33477,"14.0-14.4":0.26054,"14.5-14.8":0.7716,"15.0-15.1":0.52182,"15.2-15.3":1.25594,"15.4":0.00779},P:{"4":0.25027,"5.0-5.4":0.01116,"6.2-6.4":0.01036,"7.2-7.4":0.14599,"8.2":0.02073,"9.2":0.04171,"10.1":0.05182,"11.1-11.2":0.12514,"12.0":0.03128,"13.0":0.17728,"14.0":0.17728,"15.0":0.13556,"16.0":1.53291},I:{"0":0,"3":0,"4":0.00296,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00414,"4.2-4.3":0.00591,"4.4":0,"4.4.3-4.4.4":0.06032},A:{"9":0.00436,"11":0.11772,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.07897},Q:{"10.4":0},O:{"0":0.10718},H:{"0":0.27237},L:{"0":48.76275},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TO.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TO.js
new file mode 100644
index 0000000..0c0f1ad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TO.js
@@ -0,0 +1 @@
+module.exports={C:{"78":0.10686,"92":0.03717,"96":0.14403,"97":0.39026,"98":0.01858,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 91 93 94 95 99 3.5 3.6"},D:{"61":0.06504,"75":0.00929,"77":0.27876,"79":0.21836,"81":0.00929,"86":0.00929,"88":0.00929,"89":0.00929,"90":0.18119,"91":0.02788,"94":0.01858,"95":0.24624,"96":2.93627,"97":4.56702,"98":21.67824,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 62 63 64 65 66 67 68 69 70 71 72 73 74 76 78 80 83 84 85 87 92 93 99 100 101"},F:{"82":0.22765,"83":0.51571,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00929,"18":0.07434,"81":0.02788,"83":0.01858,"84":0.00929,"89":0.00929,"90":0.00929,"92":0.07434,"93":0.10686,"96":0.32522,"97":1.40309,"98":2.30906,_:"12 13 15 16 17 79 80 85 86 87 88 91 94 95"},E:{"4":0,"13":0.01858,"14":0.13473,_:"0 5 6 7 8 9 10 11 12 15 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.02788,"11.1":0.00929,"12.1":0.01858,"13.1":0.00929,"14.1":0.11615,"15.1":0.28805,"15.2-15.3":0.01858},G:{"8":0.05313,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00781,"10.0-10.2":0.03828,"10.3":0.01484,"11.0-11.2":0.03047,"11.3-11.4":0.00781,"12.0-12.1":0.00781,"12.2-12.5":1.24853,"13.0-13.1":0.20548,"13.2":0.01484,"13.3":0.30471,"13.4-13.7":0.62426,"14.0-14.4":0.82975,"14.5-14.8":2.24625,"15.0-15.1":1.52276,"15.2-15.3":0.65473,"15.4":0},P:{"4":0.07814,"5.0-5.4":0.01116,"6.2-6.4":0.01036,"7.2-7.4":0.38743,"8.2":0.02073,"9.2":0.43841,"10.1":0.05182,"11.1-11.2":0.13254,"12.0":0.02073,"13.0":0.25489,"14.0":0.04078,"15.0":0.03059,"16.0":0.84624},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.02788,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0.58359},H:{"0":0.07096},L:{"0":52.20205},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TR.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TR.js
new file mode 100644
index 0000000..50bb36b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TR.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.01394,"55":0.00279,"78":0.01115,"79":0.00836,"80":0.00836,"81":0.00557,"82":0.00279,"83":0.00279,"84":0.04181,"87":0.00557,"88":0.00279,"89":0.00279,"91":0.00836,"92":0.01115,"94":0.00279,"95":0.01115,"96":0.25362,"97":0.4069,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 85 86 90 93 98 99 3.5 3.6"},D:{"22":0.06689,"26":0.03623,"34":0.07525,"38":0.12263,"43":0.00279,"47":0.0864,"48":0.00557,"49":0.10033,"53":0.02508,"56":0.00557,"58":0.00279,"59":0.00557,"60":0.00279,"61":0.01115,"63":0.00836,"65":0.00557,"67":0.00557,"68":0.01672,"69":0.00557,"70":0.00836,"71":0.04738,"72":0.00557,"73":0.01672,"74":0.00557,"75":0.00836,"76":0.00836,"77":0.00836,"78":0.01115,"79":0.18116,"80":0.0223,"81":0.0223,"83":0.03344,"84":0.06968,"85":0.06968,"86":0.06689,"87":0.28706,"88":0.0223,"89":0.04459,"90":0.01672,"91":0.04181,"92":0.05295,"93":0.17001,"94":0.04181,"95":0.11148,"96":0.26755,"97":5.46252,"98":13.05988,"99":0.00557,"100":0.00557,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 33 35 36 37 39 40 41 42 44 45 46 50 51 52 54 55 57 62 64 66 101"},F:{"28":0.00836,"31":0.00557,"32":0.01115,"36":0.01394,"40":0.06131,"46":0.04738,"71":0.00279,"79":0.00279,"80":0.00557,"81":0.00279,"82":0.30936,"83":1.10923,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00557,"13":0.00557,"14":0.00557,"15":0.00557,"16":0.00557,"17":0.00557,"18":0.02508,"84":0.00557,"85":0.00557,"86":0.00557,"87":0.00557,"89":0.00279,"91":0.00279,"92":0.00836,"94":0.00557,"95":0.01115,"96":0.0223,"97":0.36788,"98":1.19841,_:"79 80 81 83 88 90 93"},E:{"4":0,"13":0.05017,"14":0.05295,"15":0.02508,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 15.4","5.1":0.0223,"10.1":0.00557,"11.1":0.00557,"12.1":0.01672,"13.1":0.05295,"14.1":0.15886,"15.1":0.07525,"15.2-15.3":0.1505},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00106,"6.0-6.1":0.00317,"7.0-7.1":0.04643,"8.1-8.4":0.00739,"9.0-9.2":0.00422,"9.3":0.08864,"10.0-10.2":0.01688,"10.3":0.13929,"11.0-11.2":0.04221,"11.3-11.4":0.03904,"12.0-12.1":0.03377,"12.2-12.5":1.40244,"13.0-13.1":0.01899,"13.2":0.00633,"13.3":0.06437,"13.4-13.7":0.24799,"14.0-14.4":0.50864,"14.5-14.8":1.79817,"15.0-15.1":1.3328,"15.2-15.3":4.74129,"15.4":0.0095},P:{"4":0.60186,"5.0-5.4":0.0102,"6.2-6.4":0.01036,"7.2-7.4":0.22442,"8.2":0.02073,"9.2":0.0306,"10.1":0.0204,"11.1-11.2":0.13261,"12.0":0.06121,"13.0":0.26523,"14.0":0.15302,"15.0":0.19382,"16.0":2.88689},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0023,"4.2-4.3":0.0076,"4.4":0,"4.4.3-4.4.4":0.02616},A:{"8":0.01136,"9":0.01136,"10":0.00568,"11":0.42589,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.18754},Q:{"10.4":0},O:{"0":0.12983},H:{"0":0.68971},L:{"0":55.72819},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TT.js
new file mode 100644
index 0000000..18ac670
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TT.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00901,"68":0.00451,"78":0.01352,"87":0.00901,"89":0.02704,"91":0.01802,"92":0.12166,"93":0.00451,"94":0.00451,"95":0.13969,"96":0.58578,"97":1.14903,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 88 90 98 99 3.5 3.6"},D:{"26":0.03154,"38":0.00451,"47":0.01802,"49":0.03605,"55":0.00451,"56":0.00901,"62":0.00901,"63":0.00901,"66":0.03154,"67":0.00901,"68":0.02253,"74":0.05858,"75":0.01802,"76":0.04055,"77":0.00451,"79":0.09012,"80":0.02704,"81":0.09913,"83":0.00901,"84":0.00901,"86":0.01802,"87":0.09012,"88":0.01802,"89":0.01802,"90":0.03154,"91":0.05858,"92":0.04506,"93":0.11265,"94":0.08111,"95":0.0721,"96":0.55874,"97":9.12916,"98":19.20908,"99":0.02704,"100":0.04506,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 48 50 51 52 53 54 57 58 59 60 61 64 65 69 70 71 72 73 78 85 101"},F:{"28":0.01352,"80":0.01352,"82":0.21629,"83":0.8291,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00451,"14":0.00451,"15":0.00451,"16":0.00451,"17":0.00901,"18":0.01802,"85":0.03154,"89":0.00901,"90":0.00451,"92":0.01352,"95":0.02253,"96":0.03605,"97":1.40137,"98":4.43841,_:"13 79 80 81 83 84 86 87 88 91 93 94"},E:{"4":0,"13":0.00901,"14":0.21178,"15":0.11265,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.02253,"11.1":0.09463,"12.1":0.03605,"13.1":0.28838,"14.1":0.43258,"15.1":0.25684,"15.2-15.3":0.57226,"15.4":0.01802},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00936,"6.0-6.1":0,"7.0-7.1":0.09358,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.17406,"10.0-10.2":0,"10.3":0.1254,"11.0-11.2":0.00561,"11.3-11.4":0.0131,"12.0-12.1":0.00936,"12.2-12.5":0.37433,"13.0-13.1":0.01029,"13.2":0.00094,"13.3":0.0262,"13.4-13.7":0.05896,"14.0-14.4":0.26016,"14.5-14.8":1.33075,"15.0-15.1":1.45335,"15.2-15.3":5.36232,"15.4":0.04679},P:{"4":0.46074,"5.0-5.4":0.01116,"6.2-6.4":0.01036,"7.2-7.4":0.27859,"8.2":0.02073,"9.2":0.02143,"10.1":0.05182,"11.1-11.2":0.11786,"12.0":0.01071,"13.0":0.18215,"14.0":0.16072,"15.0":0.15001,"16.0":4.47881},I:{"0":0,"3":0,"4":0.00202,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0004,"4.2-4.3":0.00161,"4.4":0,"4.4.3-4.4.4":0.03991},A:{"11":0.09463,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.14282},Q:{"10.4":0},O:{"0":0.03845},H:{"0":0.33803},L:{"0":40.36034},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TV.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TV.js
new file mode 100644
index 0000000..c82f79b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TV.js
@@ -0,0 +1 @@
+module.exports={C:{"85":0.05317,"96":0.10634,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 86 87 88 89 90 91 92 93 94 95 97 98 99 3.5 3.6"},D:{"96":0.26585,"97":10.66263,"98":16.39272,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 99 100 101"},F:{"82":0.05317,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"13":0.10634,"17":0.05317,"92":0.42536,"95":0.15951,"96":0.47853,"97":0.37219,"98":4.61352,_:"12 14 15 16 18 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 12.1 15.1 15.4","11.1":0.05317,"13.1":0.15951,"14.1":2.01637,"15.2-15.3":0.47853},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.46475,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.14295,"13.0-13.1":0,"13.2":0.10727,"13.3":0,"13.4-13.7":0.10727,"14.0-14.4":0,"14.5-14.8":0.85791,"15.0-15.1":0.10727,"15.2-15.3":0.42884,"15.4":0},P:{"4":0.15843,"5.0-5.4":0.0102,"6.2-6.4":0.01036,"7.2-7.4":0.04225,"8.2":0.02073,"9.2":0.19011,"10.1":0.11002,"11.1-11.2":0.04225,"12.0":0.06121,"13.0":0.39078,"14.0":0.05281,"15.0":0.02112,"16.0":0.54008},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.05317,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0.32505},H:{"0":0},L:{"0":57.37093},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TW.js
new file mode 100644
index 0000000..53593ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TW.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.02901,"52":0.01658,"55":0.00829,"67":0.00414,"78":0.00829,"88":0.00414,"89":0.00414,"91":0.00829,"93":0.00414,"94":0.00829,"95":0.02072,"96":0.3481,"97":0.57602,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 56 57 58 59 60 61 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 90 92 98 99 3.5 3.6"},D:{"11":0.00829,"22":0.00829,"26":0.00414,"30":0.00829,"34":0.02901,"38":0.11189,"45":0.00414,"47":0.00414,"49":0.15333,"53":0.11189,"55":0.01243,"56":0.02901,"58":0.00829,"61":0.0373,"62":0.00414,"63":0.00829,"64":0.00829,"65":0.01243,"66":0.01243,"67":0.02486,"68":0.01658,"69":0.01658,"70":0.01658,"71":0.02072,"72":0.01243,"73":0.00829,"74":0.02072,"75":0.01658,"76":0.01243,"77":0.00829,"78":0.00829,"79":0.45584,"80":0.02072,"81":0.06216,"83":0.01658,"84":0.01243,"85":0.01658,"86":0.04973,"87":0.09117,"88":0.01658,"89":0.06216,"90":0.02486,"91":0.04973,"92":0.04973,"93":0.21549,"94":0.07045,"95":0.08702,"96":0.50971,"97":7.79486,"98":20.07768,"99":0.00829,"100":0.01243,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 31 32 33 35 36 37 39 40 41 42 43 44 46 48 50 51 52 54 57 59 60 101"},F:{"28":0.02901,"36":0.02072,"40":0.00414,"46":0.07045,"82":0.01243,"83":0.1036,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00414,"16":0.00414,"17":0.00829,"18":0.02072,"84":0.00414,"91":0.00414,"92":0.00829,"94":0.00829,"95":0.00829,"96":0.02486,"97":0.56773,"98":2.24605,_:"12 13 15 79 80 81 83 85 86 87 88 89 90 93"},E:{"4":0,"12":0.00829,"13":0.12846,"14":0.41854,"15":0.16162,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.00829,"10.1":0.02072,"11.1":0.02901,"12.1":0.06216,"13.1":0.28179,"14.1":1.82336,"15.1":0.62989,"15.2-15.3":1.27221,"15.4":0.00414},G:{"8":0.00261,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02866,"6.0-6.1":0.01303,"7.0-7.1":0.10681,"8.1-8.4":0.04689,"9.0-9.2":0.01563,"9.3":0.2501,"10.0-10.2":0.02345,"10.3":0.26573,"11.0-11.2":0.05992,"11.3-11.4":0.05992,"12.0-12.1":0.13287,"12.2-12.5":0.93527,"13.0-13.1":0.11984,"13.2":0.0495,"13.3":0.22665,"13.4-13.7":0.5002,"14.0-14.4":2.64168,"14.5-14.8":6.13526,"15.0-15.1":4.51482,"15.2-15.3":9.86331,"15.4":0.0495},P:{"4":0.63144,"5.0-5.4":0.08035,"6.2-6.4":0.18078,"7.2-7.4":0.41177,"8.2":0.0107,"9.2":0.06421,"10.1":0.03211,"11.1-11.2":0.11773,"12.0":0.06421,"13.0":0.22475,"14.0":0.21405,"15.0":0.26756,"16.0":2.40803},I:{"0":0,"3":0,"4":0.00045,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0009,"4.2-4.3":0.0036,"4.4":0,"4.4.3-4.4.4":0.01847},A:{"11":0.19477,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.08784},Q:{"10.4":0.01171},O:{"0":0.0937},H:{"0":0.29938},L:{"0":28.60877},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TZ.js
new file mode 100644
index 0000000..7715fae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/TZ.js
@@ -0,0 +1 @@
+module.exports={C:{"30":0.00377,"32":0.00377,"33":0.00189,"34":0.00566,"36":0.00566,"38":0.01132,"39":0.00189,"43":0.00755,"44":0.00377,"45":0.00377,"47":0.00377,"48":0.00377,"49":0.00755,"51":0.00189,"52":0.00755,"56":0.00377,"61":0.00189,"63":0.00377,"65":0.00566,"68":0.00566,"72":0.01321,"78":0.01887,"79":0.00189,"84":0.00377,"85":0.00189,"88":0.00566,"89":0.0151,"90":0.00189,"91":0.02076,"92":0.00377,"93":0.00755,"94":0.01321,"95":0.02831,"96":0.78311,"97":1.09635,"98":0.07359,_:"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 31 35 37 40 41 42 46 50 53 54 55 57 58 59 60 62 64 66 67 69 70 71 73 74 75 76 77 80 81 82 83 86 87 99 3.5 3.6"},D:{"11":0.00189,"21":0.00189,"37":0.00377,"38":0.00377,"39":0.01321,"43":0.00566,"47":0.00566,"49":0.01321,"50":0.00377,"53":0.00189,"55":0.10001,"57":0.00377,"58":0.00566,"60":0.00377,"63":0.00944,"64":0.00566,"65":0.00944,"67":0.00377,"68":0.00377,"69":0.00755,"70":0.00944,"71":0.00566,"72":0.00755,"73":0.00377,"74":0.01132,"75":0.00944,"76":0.00189,"77":0.00566,"78":0.00566,"79":0.02642,"80":0.01321,"81":0.00755,"83":0.00755,"84":0.01132,"85":0.00944,"86":0.0151,"87":0.0434,"88":0.01887,"89":0.01321,"90":0.01132,"91":0.02453,"92":0.02642,"93":0.01887,"94":0.03208,"95":0.0434,"96":0.26041,"97":2.73426,"98":6.62148,"99":0.00566,"100":0.00755,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 40 41 42 44 45 46 48 51 52 54 56 59 61 62 66 101"},F:{"28":0.00189,"37":0.00189,"63":0.00189,"67":0.00566,"73":0.00189,"79":0.00566,"80":0.00377,"81":0.00755,"82":0.06605,"83":0.66422,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 64 65 66 68 69 70 71 72 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.02642,"13":0.00944,"14":0.00377,"15":0.01698,"16":0.01698,"17":0.00944,"18":0.10001,"84":0.00944,"85":0.00755,"86":0.00377,"89":0.02453,"90":0.0151,"91":0.00189,"92":0.01698,"93":0.00377,"94":0.00755,"95":0.02453,"96":0.05095,"97":0.37551,"98":1.00011,_:"79 80 81 83 87 88"},E:{"4":0,"12":0.00755,"13":0.00944,"14":0.06416,"15":0.02453,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 7.1","6.1":0.00189,"9.1":0.00377,"10.1":0.00755,"11.1":0.01321,"12.1":0.01698,"13.1":0.04906,"14.1":0.07737,"15.1":0.04906,"15.2-15.3":0.08869,"15.4":0.00566},G:{"8":0.00119,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00298,"6.0-6.1":0,"7.0-7.1":0.01193,"8.1-8.4":0.00358,"9.0-9.2":0.0006,"9.3":0.03221,"10.0-10.2":0.00298,"10.3":0.04713,"11.0-11.2":0.03579,"11.3-11.4":0.05846,"12.0-12.1":0.04593,"12.2-12.5":1.14534,"13.0-13.1":0.03221,"13.2":0.01074,"13.3":0.08232,"13.4-13.7":0.27619,"14.0-14.4":0.83932,"14.5-14.8":0.9968,"15.0-15.1":0.91687,"15.2-15.3":1.41437,"15.4":0.00537},P:{"4":0.35011,"5.0-5.4":0.02059,"6.2-6.4":0.21073,"7.2-7.4":0.12357,"8.2":0.05017,"9.2":0.13387,"10.1":0.08028,"11.1-11.2":0.08238,"12.0":0.04119,"13.0":0.08238,"14.0":0.17506,"15.0":0.21625,"16.0":1.02974},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00219,"4.2-4.3":0.00658,"4.4":0,"4.4.3-4.4.4":0.07235},A:{"8":0.00209,"11":0.07528,_:"6 7 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.1379},Q:{"10.4":0},O:{"0":1.25736},H:{"0":16.62702},L:{"0":56.13239},S:{"2.5":0.44616}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UA.js
new file mode 100644
index 0000000..5f910aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UA.js
@@ -0,0 +1 @@
+module.exports={C:{"45":0.01142,"48":0.01713,"52":0.27408,"53":0.00571,"55":0.27408,"56":0.03426,"57":0.00571,"60":0.07994,"68":0.24553,"72":0.00571,"78":0.12562,"79":0.01713,"80":0.01142,"81":0.04568,"82":0.02284,"83":0.01142,"84":0.02855,"86":0.01713,"87":0.01713,"88":0.02855,"89":0.02284,"90":0.01142,"91":0.10849,"92":0.02284,"93":0.02284,"94":0.02284,"95":0.16559,"96":1.0278,"97":1.42179,"98":0.00571,_:"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 40 41 42 43 44 46 47 49 50 51 54 58 59 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 85 99 3.5 3.6"},D:{"41":0.01713,"48":0.00571,"49":0.19414,"51":0.00571,"56":0.00571,"57":0.00571,"58":0.00571,"59":0.12562,"61":0.07423,"62":0.00571,"63":0.03426,"64":0.00571,"65":0.00571,"66":0.00571,"67":0.01713,"68":0.01713,"69":0.02855,"70":0.01713,"71":0.02284,"72":0.01713,"73":0.03997,"74":0.07994,"75":0.01142,"76":0.02284,"77":0.01713,"78":0.02284,"79":0.07994,"80":0.04568,"81":0.02855,"83":0.07423,"84":0.10278,"85":0.1142,"86":0.25695,"87":0.21127,"88":0.1713,"89":0.09707,"90":0.18272,"91":0.06852,"92":0.15988,"93":1.22765,"94":0.11991,"95":0.09707,"96":0.93073,"97":10.62631,"98":19.8708,"99":0.01713,"100":0.06852,_:"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 40 42 43 44 45 46 47 50 52 53 54 55 60 101"},F:{"35":0.00571,"36":0.06852,"58":0.01713,"60":0.00571,"67":0.00571,"68":0.01713,"70":0.00571,"71":0.01142,"72":0.00571,"73":0.01142,"75":0.01142,"76":0.00571,"77":0.09136,"78":0.0571,"79":0.08565,"80":0.08565,"81":0.05139,"82":1.10774,"83":7.94832,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 62 63 64 65 66 69 74 9.5-9.6 10.5 10.6 11.1 11.5 11.6","10.0-10.1":0,"12.1":0.03997},B:{"14":0.00571,"18":0.01142,"84":0.00571,"85":0.00571,"90":0.00571,"96":0.01142,"97":0.27979,"98":0.86792,_:"12 13 15 16 17 79 80 81 83 86 87 88 89 91 92 93 94 95"},E:{"4":0,"13":0.03426,"14":0.1142,"15":0.06281,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1","5.1":0.18272,"9.1":0.00571,"11.1":0.01142,"12.1":0.02855,"13.1":0.12562,"14.1":0.35973,"15.1":0.21127,"15.2-15.3":0.34831,"15.4":0.00571},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00197,"6.0-6.1":0.00262,"7.0-7.1":0.00721,"8.1-8.4":0.00197,"9.0-9.2":0.00262,"9.3":0.03015,"10.0-10.2":0.0059,"10.3":0.03801,"11.0-11.2":0.01245,"11.3-11.4":0.01376,"12.0-12.1":0.01114,"12.2-12.5":0.24051,"13.0-13.1":0.01573,"13.2":0.00655,"13.3":0.03473,"13.4-13.7":0.12386,"14.0-14.4":0.32505,"14.5-14.8":1.25236,"15.0-15.1":1.06428,"15.2-15.3":3.34226,"15.4":0.01769},P:{"4":0.01085,"5.0-5.4":0.0102,"6.2-6.4":0.01085,"7.2-7.4":0.08681,"8.2":0.02073,"9.2":0.0217,"10.1":0.11002,"11.1-11.2":0.06511,"12.0":0.01085,"13.0":0.0434,"14.0":0.07596,"15.0":0.06511,"16.0":1.08512},I:{"0":0,"3":0,"4":0.00158,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00158,"4.2-4.3":0.00473,"4.4":0,"4.4.3-4.4.4":0.02643},A:{"8":0.01713,"9":0.01713,"11":0.3426,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.16302},Q:{"10.4":0},O:{"0":0.18447},H:{"0":3.72845},L:{"0":26.30602},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UG.js
new file mode 100644
index 0000000..13852d1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UG.js
@@ -0,0 +1 @@
+module.exports={C:{"36":0.00277,"38":0.00277,"40":0.00277,"41":0.00554,"42":0.00554,"43":0.00831,"44":0.01108,"47":0.01108,"48":0.00554,"50":0.00554,"52":0.04157,"55":0.00277,"56":0.00831,"57":0.00554,"58":0.00277,"60":0.01108,"64":0.01108,"66":0.00554,"67":0.00277,"68":0.00554,"69":0.00277,"72":0.0194,"73":0.00554,"76":0.00277,"78":0.05819,"82":0.00277,"84":0.00554,"85":0.00831,"86":0.00554,"87":0.00277,"88":0.02217,"89":0.03325,"90":0.01108,"91":0.06928,"92":0.0194,"93":0.00554,"94":0.02494,"95":0.07482,"96":1.35225,"97":2.01729,"98":0.28264,_:"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 37 39 45 46 49 51 53 54 59 61 62 63 65 70 71 74 75 77 79 80 81 83 99 3.5 3.6"},D:{"19":0.00831,"24":0.00277,"37":0.00554,"38":0.00831,"39":0.00277,"40":0.00277,"47":0.00831,"49":0.01386,"50":0.00554,"56":0.00554,"57":0.00554,"58":0.00554,"59":0.00554,"62":0.00554,"63":0.01386,"64":0.0194,"65":0.01663,"66":0.00554,"67":0.00277,"68":0.00277,"69":0.00277,"70":0.00554,"71":0.00554,"72":0.01663,"73":0.00277,"74":0.02217,"75":0.01108,"76":0.00831,"77":0.00277,"78":0.00554,"79":0.03602,"80":0.05265,"81":0.01108,"83":0.06096,"84":0.00554,"85":0.01386,"86":0.03325,"87":0.04157,"88":0.01386,"89":0.0194,"90":0.02217,"91":0.04157,"92":0.05265,"93":0.04434,"94":0.06373,"95":0.04988,"96":0.3824,"97":4.41697,"98":9.19972,"99":0.02217,"100":0.00831,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 23 25 26 27 28 29 30 31 32 33 34 35 36 41 42 43 44 45 46 48 51 52 53 54 55 60 61 101"},F:{"28":0.00277,"57":0.00277,"67":0.00554,"68":0.00277,"79":0.01108,"80":0.01108,"81":0.00277,"82":0.05819,"83":0.79251,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 58 60 62 63 64 65 66 69 70 71 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.03048,"13":0.01663,"14":0.00831,"15":0.01386,"16":0.01386,"17":0.01386,"18":0.08313,"84":0.01108,"85":0.00831,"88":0.00277,"89":0.0194,"90":0.01108,"91":0.00554,"92":0.03879,"93":0.00831,"94":0.00831,"95":0.0194,"96":0.07205,"97":0.40457,"98":1.26358,_:"79 80 81 83 86 87"},E:{"4":0,"8":0.00277,"10":0.00277,"12":0.00277,"13":0.01108,"14":0.02771,"15":0.01663,_:"0 5 6 7 9 11 3.1 3.2 5.1 6.1 7.1 9.1 15.4","10.1":0.00554,"11.1":0.00554,"12.1":0.01386,"13.1":0.04157,"14.1":0.11915,"15.1":0.03879,"15.2-15.3":0.05542},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00301,"6.0-6.1":0.00086,"7.0-7.1":0.0262,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03608,"10.0-10.2":0.00515,"10.3":0.05241,"11.0-11.2":0.01675,"11.3-11.4":0.26246,"12.0-12.1":0.01546,"12.2-12.5":0.53523,"13.0-13.1":0.0378,"13.2":0.01289,"13.3":0.05842,"13.4-13.7":0.08763,"14.0-14.4":0.5842,"14.5-14.8":0.73326,"15.0-15.1":0.73626,"15.2-15.3":1.08506,"15.4":0.0043},P:{"4":0.12479,"5.0-5.4":0.0102,"6.2-6.4":0.01036,"7.2-7.4":0.07279,"8.2":0.02073,"9.2":0.17678,"10.1":0.11002,"11.1-11.2":0.05199,"12.0":0.0104,"13.0":0.09359,"14.0":0.35357,"15.0":0.13519,"16.0":0.59274},I:{"0":0,"3":0,"4":0.00081,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00081,"4.2-4.3":0.00222,"4.4":0,"4.4.3-4.4.4":0.03954},A:{"8":0.00603,"9":0.00302,"10":0.00302,"11":0.12371,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00723},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.13733},Q:{"10.4":0},O:{"0":1.02638},H:{"0":15.98526},L:{"0":52.49623},S:{"2.5":0.23852}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/US.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/US.js
new file mode 100644
index 0000000..9dc9b23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/US.js
@@ -0,0 +1 @@
+module.exports={C:{"2":0.00478,"3":0.00478,"4":0.03347,"11":0.00956,"38":0.00478,"43":0.00478,"44":0.01912,"45":0.00478,"47":0.00478,"48":0.00478,"52":0.03347,"54":0.00956,"55":0.00956,"59":0.00478,"68":0.00478,"78":0.10996,"79":0.00478,"80":0.00478,"81":0.00478,"82":0.00956,"83":0.00478,"84":0.00478,"85":0.00478,"86":0.00956,"87":0.00956,"88":0.01434,"89":0.01434,"90":0.00956,"91":0.09084,"92":0.00478,"93":0.01434,"94":0.0765,"95":0.06215,"96":0.92751,"97":1.37693,_:"5 6 7 8 9 10 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 39 40 41 42 46 49 50 51 53 56 57 58 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 98 99 3.5 3.6"},D:{"35":0.01912,"38":0.00478,"40":0.02391,"43":0.00956,"46":0.00478,"47":0.00478,"48":0.05737,"49":0.05737,"50":0.00478,"52":0.00478,"56":0.08606,"58":0.00478,"59":0.01434,"60":0.05737,"63":0.00956,"64":0.04781,"65":0.01434,"66":0.04781,"67":0.01912,"68":0.00956,"69":0.01434,"70":0.05259,"71":0.00478,"72":0.3012,"73":0.00478,"74":0.02391,"75":0.02391,"76":0.22949,"77":0.01434,"78":0.05259,"79":0.42551,"80":0.08606,"81":0.06693,"83":0.31555,"84":0.11474,"85":0.09084,"86":0.07172,"87":0.14343,"88":0.05259,"89":0.08128,"90":0.08606,"91":0.20558,"92":0.15299,"93":0.34423,"94":0.4016,"95":0.12431,"96":1.30999,"97":8.49106,"98":13.86012,"99":0.01912,"100":0.05259,"101":0.01912,_:"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 36 37 39 41 42 44 45 51 53 54 55 57 61 62"},F:{"80":0.00478,"82":0.10518,"83":0.36814,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00956,"15":0.03347,"16":0.00956,"17":0.00956,"18":0.26774,"85":0.00956,"86":0.00478,"87":0.02869,"89":0.00478,"90":0.00478,"91":0.00478,"92":0.00956,"93":0.00478,"94":0.00956,"95":0.06215,"96":0.07172,"97":1.29087,"98":4.14991,_:"13 14 79 80 81 83 84 88"},E:{"4":0,"8":0.00478,"9":0.00956,"12":0.00956,"13":0.0765,"14":0.41595,"15":0.26774,_:"0 5 6 7 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.05259,"10.1":0.02869,"11.1":0.06215,"12.1":0.13387,"13.1":1.64945,"14.1":1.67813,"15.1":0.7554,"15.2-15.3":1.92196,"15.4":0.02391},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.0084,"7.0-7.1":0.0084,"8.1-8.4":0.0084,"9.0-9.2":0.0112,"9.3":0.08116,"10.0-10.2":0.0112,"10.3":0.09796,"11.0-11.2":0.03918,"11.3-11.4":0.04758,"12.0-12.1":0.05318,"12.2-12.5":0.54296,"13.0-13.1":0.04758,"13.2":0.01959,"13.3":0.10915,"13.4-13.7":0.34425,"14.0-14.4":1.1391,"14.5-14.8":5.14976,"15.0-15.1":3.85392,"15.2-15.3":16.3225,"15.4":0.07837},P:{"4":0.03251,_:"5.0-5.4 6.2-6.4 7.2-7.4 8.2 9.2 10.1","11.1-11.2":0.02167,"12.0":0.01084,"13.0":0.04334,"14.0":0.07585,"15.0":0.06501,"16.0":1.74445},I:{"0":0,"3":0,"4":0.01305,"2.1":0,"2.2":0.00703,"2.3":0.001,"4.1":0.00201,"4.2-4.3":0.0261,"4.4":0,"4.4.3-4.4.4":0.02911},A:{"7":0.0049,"8":0.01469,"9":0.07836,"11":0.70526,_:"6 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.4384},Q:{"10.4":0.00522},O:{"0":0.11482},H:{"0":0.20258},L:{"0":21.66147},S:{"2.5":0.00522}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UY.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UY.js
new file mode 100644
index 0000000..8d8a06c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UY.js
@@ -0,0 +1 @@
+module.exports={C:{"45":0.00459,"52":0.08723,"55":0.00918,"57":0.00918,"61":0.00918,"66":0.01377,"68":0.00918,"73":0.02755,"78":0.03214,"81":0.00459,"83":0.00918,"84":0.01377,"85":0.01836,"86":0.01377,"88":0.02296,"89":0.00459,"90":0.03214,"91":0.09641,"92":0.00918,"93":0.00918,"94":0.00918,"95":0.03673,"96":0.72997,"97":1.26712,_:"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 40 41 42 43 44 46 47 48 49 50 51 53 54 56 58 59 60 62 63 64 65 67 69 70 71 72 74 75 76 77 79 80 82 87 98 99 3.5 3.6"},D:{"22":0.00918,"36":0.04132,"38":0.04591,"43":0.00918,"47":0.01836,"48":0.00459,"49":0.12396,"52":0.00459,"53":0.00918,"55":0.00459,"58":0.00459,"62":0.04132,"63":0.00459,"65":0.01377,"66":0.01377,"69":0.01377,"70":0.26628,"71":0.01377,"72":0.00459,"73":0.01377,"74":0.01836,"75":0.00918,"76":0.01377,"77":0.00459,"78":0.00918,"79":0.0505,"80":0.14232,"81":0.03214,"83":0.04132,"84":0.01377,"85":0.02296,"86":0.93656,"87":0.07346,"88":0.02755,"89":0.05509,"90":0.05968,"91":0.09182,"92":0.07346,"93":0.09641,"94":0.08264,"95":0.08264,"96":0.53715,"97":9.14068,"98":22.12403,"99":0.00459,"100":0.00918,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 37 39 40 41 42 44 45 46 50 51 54 56 57 59 60 61 64 67 68 101"},F:{"82":0.94116,"83":2.31386,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00459,"14":0.00459,"17":0.00459,"18":0.00918,"92":0.02296,"95":0.01836,"96":0.04132,"97":0.50501,"98":1.8364,_:"13 15 16 79 80 81 83 84 85 86 87 88 89 90 91 93 94"},E:{"4":0,"13":0.02296,"14":0.04591,"15":0.04591,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.01377,"11.1":0.00918,"12.1":0.1515,"13.1":0.12396,"14.1":0.27087,"15.1":0.14691,"15.2-15.3":0.23414},G:{"8":0,"3.2":0.00138,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02561,"6.0-6.1":0,"7.0-7.1":0.00831,"8.1-8.4":0,"9.0-9.2":0.00138,"9.3":0.03185,"10.0-10.2":0.00069,"10.3":0.03738,"11.0-11.2":0.00346,"11.3-11.4":0.00692,"12.0-12.1":0.01246,"12.2-12.5":0.39392,"13.0-13.1":0.02008,"13.2":0.00138,"13.3":0.03185,"13.4-13.7":0.11492,"14.0-14.4":0.34961,"14.5-14.8":1.29321,"15.0-15.1":1.11252,"15.2-15.3":3.43863,"15.4":0.03254},P:{"4":0.05252,"5.0-5.4":0.0102,"6.2-6.4":0.01085,"7.2-7.4":0.19957,"8.2":0.02073,"9.2":0.02101,"10.1":0.11002,"11.1-11.2":0.08403,"12.0":0.06302,"13.0":0.09453,"14.0":0.08403,"15.0":0.10504,"16.0":1.10287},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00412,"4.2-4.3":0.00206,"4.4":0,"4.4.3-4.4.4":0.03709},A:{"9":0.00918,"11":0.1515,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.26504},Q:{"10.4":0},O:{"0":0.01623},H:{"0":0.10754},L:{"0":43.02314},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UZ.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UZ.js
new file mode 100644
index 0000000..587e47c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/UZ.js
@@ -0,0 +1 @@
+module.exports={C:{"30":0.00613,"52":0.08891,"55":0.02759,"57":0.00307,"72":0.00307,"73":0.00613,"78":0.0092,"80":0.00307,"81":0.00613,"84":0.00307,"89":0.00307,"91":0.03986,"92":0.00307,"93":0.00613,"94":0.0092,"95":0.0092,"96":0.325,"97":0.54575,"98":0.0092,_:"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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 56 58 59 60 61 62 63 64 65 66 67 68 69 70 71 74 75 76 77 79 82 83 85 86 87 88 90 99 3.5 3.6"},D:{"34":0.00307,"35":0.00307,"38":0.00613,"49":0.10424,"56":0.01533,"63":0.00307,"64":0.00613,"66":0.03373,"67":0.0092,"68":0.00613,"70":0.00613,"71":0.0184,"72":0.01533,"73":0.0184,"74":0.02453,"75":0.0092,"76":0.00307,"78":0.00613,"79":0.04906,"80":0.04292,"81":0.02146,"83":0.03679,"84":0.05212,"85":0.05519,"86":0.12571,"87":0.05519,"88":0.02453,"89":0.07665,"90":0.02453,"91":0.03679,"92":0.03679,"93":0.08278,"94":0.05825,"95":0.03679,"96":0.42617,"97":5.6813,"98":13.86445,"99":0.0092,"100":0.01533,_:"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 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 57 58 59 60 61 62 65 69 77 101"},F:{"28":0.00307,"36":0.00307,"42":0.00307,"51":0.00613,"53":0.03986,"54":0.00613,"55":0.01226,"56":0.00613,"57":0.02453,"58":0.02146,"60":0.01533,"62":0.01533,"63":0.00613,"64":0.03986,"65":0.0092,"66":0.01226,"67":0.01226,"68":0.0184,"70":0.0092,"71":0.0092,"72":0.0184,"73":0.0092,"74":0.00613,"75":0.0092,"76":0.0092,"77":0.04292,"78":0.02146,"79":0.06745,"80":0.05212,"81":0.0184,"82":0.04599,"83":0.03986,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 43 44 45 46 47 48 49 50 52 69 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01226,"15":0.00613,"16":0.00613,"17":0.00307,"18":0.04906,"83":0.00613,"84":0.03373,"85":0.00613,"86":0.00307,"87":0.00307,"88":0.00613,"89":0.01226,"90":0.0092,"91":0.0092,"92":0.0092,"93":0.00613,"94":0.0092,"95":0.01226,"96":0.02759,"97":0.25448,"98":0.84008,_:"13 14 79 80 81"},E:{"4":0,"13":0.01226,"14":0.03066,"15":0.0184,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.99952,"11.1":0.00307,"12.1":0.00613,"13.1":0.05519,"14.1":0.08278,"15.1":0.05825,"15.2-15.3":0.08278},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00093,"5.0-5.1":0.00232,"6.0-6.1":0.00139,"7.0-7.1":0.0251,"8.1-8.4":0,"9.0-9.2":0.00604,"9.3":0.03346,"10.0-10.2":0.00372,"10.3":0.07716,"11.0-11.2":0.01534,"11.3-11.4":0.01441,"12.0-12.1":0.01069,"12.2-12.5":0.46154,"13.0-13.1":0.02649,"13.2":0.0093,"13.3":0.02882,"13.4-13.7":0.0911,"14.0-14.4":0.38392,"14.5-14.8":0.79386,"15.0-15.1":0.80409,"15.2-15.3":1.83824,"15.4":0.0172},P:{"4":0.90873,"5.0-5.4":0.04039,"6.2-6.4":0.13126,"7.2-7.4":0.55534,"8.2":0.02019,"9.2":0.12116,"10.1":0.05049,"11.1-11.2":0.3332,"12.0":0.10097,"13.0":0.38369,"14.0":0.47456,"15.0":0.36349,"16.0":2.53436},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00155,"4.2-4.3":0.00492,"4.4":0,"4.4.3-4.4.4":0.0282},A:{"9":0.00613,"11":0.18396,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.0624},Q:{"10.4":0},O:{"0":3.31397},H:{"0":0.46602},L:{"0":48.80021},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VA.js
new file mode 100644
index 0000000..e351753
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VA.js
@@ -0,0 +1 @@
+module.exports={C:{"39":0.03884,"70":0.01942,"84":0.01942,"90":0.93216,"91":0.21362,"93":0.04855,"95":0.03884,"96":4.90355,"97":6.42802,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 78 79 80 81 82 83 85 86 87 88 89 92 94 98 99 3.5 3.6"},D:{"67":0.43695,"92":0.01942,"93":0.7768,"95":0.17478,"96":0.14565,"97":18.49755,"98":42.15111,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 91 94 99 100 101"},F:{_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.0971,"18":3.05865,"97":3.1072,"98":11.01114,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96"},E:{"4":0,"14":0.18449,"15":0.16507,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.33014,"12.1":0.22333,"13.1":0.12623,"14.1":0.17478,"15.1":0.24275,"15.2-15.3":1.2623},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0042,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.0042,"12.2-12.5":0.57132,"13.0-13.1":0,"13.2":0,"13.3":0.0042,"13.4-13.7":0,"14.0-14.4":0.0169,"14.5-14.8":0.08042,"15.0-15.1":0.05501,"15.2-15.3":0.39359,"15.4":0.0042},P:{"4":0.35753,"5.0-5.4":0.08172,"6.2-6.4":0.04086,"7.2-7.4":0.2043,"8.2":0.04086,"9.2":0.23495,"10.1":0.07459,"11.1-11.2":0.4086,"12.0":0.07151,"13.0":0.09194,"14.0":0.30645,"15.0":0.26559,"16.0":0.4397},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.78651,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.10602,_:"11"},R:{_:"0"},M:{"0":0},Q:{"10.4":0},O:{"0":0},H:{"0":0.00827},L:{"0":1.43435},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VC.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VC.js
new file mode 100644
index 0000000..11f3b90
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VC.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00783,"78":0.00783,"80":0.00391,"91":0.00391,"94":0.01957,"95":0.02348,"96":0.91956,"97":0.80217,"98":0.03522,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 81 82 83 84 85 86 87 88 89 90 92 93 99 3.5 3.6"},D:{"23":0.00783,"48":0.01565,"49":0.01565,"61":0.02739,"68":0.00391,"69":0.01957,"70":0.00783,"74":0.00391,"75":0.00783,"76":0.38347,"78":0.01957,"79":0.01957,"80":0.00783,"83":0.03522,"86":0.00783,"87":0.24652,"88":0.01957,"89":0.00783,"90":0.03522,"91":0.00391,"92":0.01957,"93":0.08217,"94":0.08609,"95":0.05478,"96":0.61825,"97":6.60906,"98":14.59158,"99":0.04696,"100":0.00391,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 50 51 52 53 54 55 56 57 58 59 60 62 63 64 65 66 67 71 72 73 77 81 84 85 101"},F:{"28":0.02348,"82":0.01565,"83":0.22695,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"89":0.00391,"94":0.00391,"96":0.06261,"97":0.82173,"98":3.95213,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 90 91 92 93 95"},E:{"4":0,"8":0.07826,"13":0.01174,"14":0.21913,"15":0.08609,_:"0 5 6 7 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1 11.1 15.4","9.1":0.01565,"12.1":0.02739,"13.1":0.19565,"14.1":0.23869,"15.1":0.27,"15.2-15.3":1.45172},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00753,"7.0-7.1":0.04216,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03011,"10.0-10.2":0,"10.3":0.87329,"11.0-11.2":0.03312,"11.3-11.4":0.00301,"12.0-12.1":0.00753,"12.2-12.5":0.91545,"13.0-13.1":0.00151,"13.2":0,"13.3":0.00452,"13.4-13.7":0.14605,"14.0-14.4":0.23639,"14.5-14.8":3.64372,"15.0-15.1":3.21009,"15.2-15.3":5.88265,"15.4":0.01355},P:{"4":0.14291,"5.0-5.4":0.01121,"6.2-6.4":0.01012,"7.2-7.4":0.21986,"8.2":0.03083,"9.2":0.04397,"10.1":0.03037,"11.1-11.2":0.14291,"12.0":0.01099,"13.0":0.09894,"14.0":0.03298,"15.0":0.06596,"16.0":3.44082},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02164,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.05139},A:{"10":0.0313,"11":0.03522,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.09129},Q:{"10.4":0},O:{"0":0.03043},H:{"0":0.08067},L:{"0":37.69295},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VE.js
new file mode 100644
index 0000000..bb70ceb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VE.js
@@ -0,0 +1 @@
+module.exports={C:{"23":0.01095,"27":0.21353,"28":0.01095,"40":0.00548,"43":0.01095,"45":0.00548,"47":0.01643,"48":0.00548,"52":0.44895,"56":0.01095,"60":0.0219,"62":0.01095,"64":0.01095,"65":0.01643,"66":0.01095,"67":0.01095,"68":0.02738,"69":0.01643,"70":0.01095,"71":0.01095,"72":0.02738,"78":0.07665,"79":0.01095,"80":0.01095,"81":0.00548,"83":0.00548,"84":0.01095,"87":0.00548,"88":0.0219,"89":0.0219,"90":0.01643,"91":0.10403,"92":0.01643,"93":0.01643,"94":0.02738,"95":0.03833,"96":1.23188,"97":2.04218,"98":0.0219,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 29 30 31 32 33 34 35 36 37 38 39 41 42 44 46 49 50 51 53 54 55 57 58 59 61 63 73 74 75 76 77 82 85 86 99 3.5 3.6"},D:{"34":0.00548,"42":0.00548,"47":0.01643,"49":0.5037,"51":0.00548,"53":0.00548,"55":0.01095,"58":0.01643,"63":0.03285,"64":0.01095,"65":0.01643,"66":0.01095,"67":0.06023,"68":0.01095,"69":0.03833,"70":0.02738,"71":0.03285,"72":0.03285,"73":0.01643,"74":0.02738,"75":0.05475,"76":0.04928,"77":0.03833,"78":0.01643,"79":0.0657,"80":0.0438,"81":0.0438,"83":0.06023,"84":0.04928,"85":0.06023,"86":0.08213,"87":0.14235,"88":0.1095,"89":0.09308,"90":0.08213,"91":0.14235,"92":0.1533,"93":0.13688,"94":0.1314,"95":0.10403,"96":1.17713,"97":9.89333,"98":23.2359,"99":0.01095,"100":0.01643,_:"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 35 36 37 38 39 40 41 43 44 45 46 48 50 52 54 56 57 59 60 61 62 101"},F:{"53":0.00548,"57":0.01643,"68":0.00548,"78":0.01095,"82":0.41063,"83":1.65345,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 54 55 56 58 60 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00548,"18":0.01095,"84":0.00548,"85":0.01095,"92":0.01643,"95":0.00548,"96":0.01643,"97":0.36135,"98":1.37423,_:"13 14 15 16 17 79 80 81 83 86 87 88 89 90 91 93 94"},E:{"4":0,"13":0.01095,"14":0.03285,"15":0.01643,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.0219,"11.1":0.00548,"12.1":0.01095,"13.1":0.03833,"14.1":0.07118,"15.1":0.03833,"15.2-15.3":0.07665},G:{"8":0.00186,"3.2":0.00041,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00557,"6.0-6.1":0.00392,"7.0-7.1":0.01383,"8.1-8.4":0.00186,"9.0-9.2":0.00083,"9.3":0.06131,"10.0-10.2":0.00206,"10.3":0.06007,"11.0-11.2":0.00537,"11.3-11.4":0.00495,"12.0-12.1":0.00826,"12.2-12.5":0.21427,"13.0-13.1":0.01177,"13.2":0.00351,"13.3":0.02787,"13.4-13.7":0.03736,"14.0-14.4":0.13356,"14.5-14.8":0.37012,"15.0-15.1":0.30984,"15.2-15.3":0.77945,"15.4":0.00537},P:{"4":0.12107,"5.0-5.4":0.04039,"6.2-6.4":0.06112,"7.2-7.4":0.11007,"8.2":0.02019,"9.2":0.11205,"10.1":0.05049,"11.1-11.2":0.03302,"12.0":0.01101,"13.0":0.03302,"14.0":0.06604,"15.0":0.08805,"16.0":0.75947},I:{"0":0,"3":0,"4":0.00026,"2.1":0,"2.2":0,"2.3":0.0001,"4.1":0.00209,"4.2-4.3":0.00382,"4.4":0,"4.4.3-4.4.4":0.02539},A:{"9":0.00548,"11":0.1095,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.01358},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.1448},Q:{"10.4":0},O:{"0":0.04073},H:{"0":0.43268},L:{"0":42.58945},S:{"2.5":0.00453}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VG.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VG.js
new file mode 100644
index 0000000..a5c4e6d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VG.js
@@ -0,0 +1 @@
+module.exports={C:{"78":0.0074,"80":0.0074,"89":0.01481,"95":0.01481,"96":0.45164,"97":1.76215,"98":0.03702,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 81 82 83 84 85 86 87 88 90 91 92 93 94 99 3.5 3.6"},D:{"62":0.01851,"65":0.02962,"74":0.0074,"75":0.01481,"76":0.0074,"79":0.01111,"80":0.03332,"84":0.13327,"86":0.05183,"87":0.02591,"90":0.02962,"91":0.17399,"92":0.0074,"93":0.03702,"94":0.02962,"95":0.56641,"96":0.62564,"97":5.87878,"98":11.30221,"100":0.0074,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 63 64 66 67 68 69 70 71 72 73 77 78 81 83 85 88 89 99 101"},F:{"82":0.12587,"83":0.31097,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01111,"16":0.01111,"18":0.30727,"95":0.01481,"96":0.0074,"97":0.84035,"98":4.46091,_:"12 13 14 17 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94"},E:{"4":0,"13":0.0074,"14":0.09995,"15":0.11476,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 11.1","10.1":0.01481,"12.1":0.08885,"13.1":0.26284,"14.1":1.27719,"15.1":1.98797,"15.2-15.3":3.41695,"15.4":0.02591},G:{"8":0,"3.2":0,"4.0-4.1":0.00243,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.16541,"9.3":0.12163,"10.0-10.2":0,"10.3":0.01216,"11.0-11.2":0.0146,"11.3-11.4":0.04135,"12.0-12.1":0.0073,"12.2-12.5":0.50353,"13.0-13.1":0.01216,"13.2":0,"13.3":0.14595,"13.4-13.7":0.17514,"14.0-14.4":0.63732,"14.5-14.8":3.69258,"15.0-15.1":3.06499,"15.2-15.3":15.63874,"15.4":0.08514},P:{"4":0.05127,"5.0-5.4":0.1009,"6.2-6.4":0.18286,"7.2-7.4":0.01025,"8.2":0.02052,"9.2":0.01025,"10.1":0.01018,"11.1-11.2":0.12304,"12.0":0.02048,"13.0":0.06152,"14.0":0.27684,"15.0":0.07177,"16.0":3.08627},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.0189},A:{"11":0.32578,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.15748},Q:{"10.4":0.0063},O:{"0":0.13858},H:{"0":0.01789},L:{"0":34.70058},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VI.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VI.js
new file mode 100644
index 0000000..5730786
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VI.js
@@ -0,0 +1 @@
+module.exports={C:{"67":0.00494,"78":0.00988,"91":0.08395,"92":0.01975,"93":0.01975,"94":0.18764,"95":0.00494,"96":0.99748,"97":1.3777,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 98 99 3.5 3.6"},D:{"23":0.00494,"49":0.00988,"72":0.01481,"75":0.02963,"76":0.09382,"78":0.01975,"79":0.01975,"80":0.0395,"83":0.02963,"85":0.01481,"87":0.01975,"89":0.00494,"90":0.06419,"91":0.05432,"92":0.38516,"93":0.02963,"94":0.25678,"95":0.06419,"96":0.68638,"97":7.82179,"98":15.17941,"99":0.00494,"100":0.00988,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 77 81 84 86 88 101"},F:{"82":0.0395,"83":0.24196,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00494,"16":0.00988,"18":0.01481,"85":0.00494,"90":0.00988,"92":0.01481,"94":0.01975,"95":0.03457,"96":0.17283,"97":2.11346,"98":7.47119,_:"12 13 14 17 79 80 81 83 84 86 87 88 89 91 93"},E:{"4":0,"11":0.00988,"12":0.01975,"13":0.07901,"14":0.4938,"15":0.16295,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.01975,"12.1":0.05926,"13.1":0.69132,"14.1":2.41962,"15.1":1.06167,"15.2-15.3":2.64183,"15.4":0.00494},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.03496,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01883,"10.0-10.2":0,"10.3":0.11027,"11.0-11.2":0.01076,"11.3-11.4":0.06993,"12.0-12.1":0.00807,"12.2-12.5":0.80147,"13.0-13.1":0.04841,"13.2":0,"13.3":0.04303,"13.4-13.7":0.39805,"14.0-14.4":1.52763,"14.5-14.8":4.45919,"15.0-15.1":3.91053,"15.2-15.3":15.39468,"15.4":0.05379},P:{"4":0.03166,"5.0-5.4":0.04039,"6.2-6.4":0.06112,"7.2-7.4":0.12327,"8.2":0.02019,"9.2":0.05136,"10.1":0.03082,"11.1-11.2":0.02111,"12.0":0.06164,"13.0":0.05276,"14.0":0.13719,"15.0":0.03166,"16.0":3.3558},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.01013},A:{"10":0.00988,"11":0.21233,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.39998},Q:{"10.4":0},O:{"0":0.0405},H:{"0":0.05752},L:{"0":20.72961},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VN.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VN.js
new file mode 100644
index 0000000..0cb11cb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VN.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.0464,"55":0.0029,"56":0.0058,"67":0.0058,"68":0.0058,"69":0.0029,"70":0.0058,"71":0.0174,"72":0.0029,"75":0.0029,"77":0.0087,"78":0.0203,"79":0.0116,"80":0.0116,"81":0.0145,"82":0.0174,"83":0.0116,"84":0.0232,"86":0.0058,"87":0.0174,"88":0.0087,"89":0.0058,"90":0.0058,"91":0.0145,"92":0.0116,"93":0.0145,"94":0.0145,"95":0.0058,"96":0.1276,"97":0.2668,"98":0.0029,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 57 58 59 60 61 62 63 64 65 66 73 74 76 85 99 3.5 3.6"},D:{"22":0.0029,"33":0.0116,"34":0.0058,"38":0.0203,"41":0.0058,"47":0.0029,"48":0.0116,"49":0.0319,"50":0.0174,"52":0.0029,"53":0.0116,"54":0.0058,"56":0.0087,"57":0.0319,"58":0.0029,"60":0.0029,"61":0.0029,"63":0.0058,"64":0.0029,"65":0.0058,"67":0.0058,"68":0.0145,"69":0.0145,"70":0.0145,"71":0.0145,"72":0.0174,"73":0.0116,"74":0.0174,"75":0.0203,"76":0.0174,"77":0.3045,"78":0.0174,"79":0.1015,"80":0.0464,"81":0.0464,"83":0.0841,"84":0.1276,"85":0.1421,"86":0.1595,"87":0.2117,"88":0.0319,"89":0.0551,"90":0.0377,"91":0.1305,"92":0.0551,"93":0.4582,"94":0.0319,"95":0.0406,"96":0.2233,"97":2.7463,"98":10.2776,"99":0.0174,"100":0.0058,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 35 36 37 39 40 42 43 44 45 46 51 55 59 62 66 101"},F:{"28":0.0087,"36":0.0116,"40":0.0087,"43":0.0116,"46":0.0232,"57":0.0029,"60":0.0029,"68":0.0087,"70":0.0087,"71":0.0087,"72":0.0058,"77":0.0522,"78":0.0377,"79":0.0464,"80":0.0377,"81":0.029,"82":0.0783,"83":0.3364,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 44 45 47 48 49 50 51 52 53 54 55 56 58 62 63 64 65 66 67 69 73 74 75 76 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.0058,"17":0.0058,"18":0.0319,"83":0.0058,"84":0.0145,"85":0.0116,"86":0.0087,"87":0.0058,"88":0.0029,"89":0.0058,"90":0.0087,"91":0.0029,"92":0.0058,"93":0.0029,"94":0.0058,"95":0.0058,"96":0.0203,"97":0.145,"98":1.0208,_:"12 13 14 15 79 80 81"},E:{"4":0,"13":0.0348,"14":0.0812,"15":0.0464,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.0667,"11.1":0.0087,"12.1":0.0116,"13.1":0.0696,"14.1":0.3045,"15.1":0.1334,"15.2-15.3":0.1885,"15.4":0.0029},G:{"8":0.00479,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00319,"5.0-5.1":0.00319,"6.0-6.1":0.00479,"7.0-7.1":0.02233,"8.1-8.4":0.01276,"9.0-9.2":0.02712,"9.3":0.13558,"10.0-10.2":0.03828,"10.3":0.22171,"11.0-11.2":0.09251,"11.3-11.4":0.13877,"12.0-12.1":0.10846,"12.2-12.5":1.8359,"13.0-13.1":0.06859,"13.2":0.03669,"13.3":0.20576,"13.4-13.7":0.74808,"14.0-14.4":1.70191,"14.5-14.8":4.24122,"15.0-15.1":1.81038,"15.2-15.3":4.45336,"15.4":0.0335},P:{"4":0.39037,"5.0-5.4":0.04039,"6.2-6.4":0.06112,"7.2-7.4":0.12327,"8.2":0.02019,"9.2":0.05136,"10.1":0.03082,"11.1-11.2":0.18491,"12.0":0.06164,"13.0":0.16437,"14.0":0.21573,"15.0":0.16437,"16.0":2.17786},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00109,"4.2-4.3":0.00255,"4.4":0,"4.4.3-4.4.4":0.02476},A:{"7":0.00313,"8":0.02189,"9":0.01563,"10":0.00625,"11":0.1532,_:"6 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.07101},Q:{"10.4":0},O:{"0":1.86046},H:{"0":0.3832},L:{"0":48.25849},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VU.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VU.js
new file mode 100644
index 0000000..217b507
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/VU.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.0216,"38":0.05183,"52":0.12525,"56":0.00864,"72":0.04751,"82":0.00864,"84":0.01728,"88":0.00864,"89":0.00864,"90":0.02591,"91":0.11661,"95":0.00864,"96":2.0904,"97":2.11199,"98":0.0216,_:"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 35 36 37 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 78 79 80 81 83 85 86 87 92 93 94 99 3.5 3.6"},D:{"31":0.01296,"37":0.05615,"39":0.13389,"53":0.01728,"55":0.01728,"59":0.06047,"63":0.01728,"67":0.00864,"69":0.11229,"77":0.01728,"79":0.09934,"81":1.00633,"83":0.03887,"84":0.05615,"86":0.01728,"87":0.16844,"88":0.59602,"90":0.01728,"91":0.02591,"92":0.02591,"94":0.02591,"95":0.05615,"96":1.93923,"97":7.62304,"98":11.4799,_:"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 32 33 34 35 36 38 40 41 42 43 44 45 46 47 48 49 50 51 52 54 56 57 58 60 61 62 64 65 66 68 70 71 72 73 74 75 76 78 80 85 89 93 99 100 101"},F:{"82":0.19867,"83":0.26778,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.19867,"13":0.02591,"14":0.0216,"17":0.05183,"18":0.24618,"80":0.00864,"84":0.02591,"85":0.00864,"89":0.00864,"94":0.00864,"96":0.1598,"97":1.02792,"98":3.67979,_:"15 16 79 81 83 86 87 88 90 91 92 93 95"},E:{"4":0,"13":0.00864,"14":0.19867,_:"0 5 6 7 8 9 10 11 12 15 3.1 3.2 5.1 6.1 7.1 9.1 11.1 15.4","10.1":0.00864,"12.1":0.02591,"13.1":1.16613,"14.1":0.704,"15.1":0.42326,"15.2-15.3":0.49237},G:{"8":0.00265,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00265,"7.0-7.1":0.00265,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01358,"10.0-10.2":0,"10.3":0.00265,"11.0-11.2":0.04374,"11.3-11.4":0.00265,"12.0-12.1":0.05997,"12.2-12.5":0.30317,"13.0-13.1":0.01624,"13.2":0.00265,"13.3":0.14479,"13.4-13.7":0.06262,"14.0-14.4":0.19913,"14.5-14.8":0.88234,"15.0-15.1":0.42046,"15.2-15.3":1.14741,"15.4":0.00265},P:{"4":0.06112,"5.0-5.4":0.04039,"6.2-6.4":0.06112,"7.2-7.4":0.74362,"8.2":0.02019,"9.2":0.11205,"10.1":0.05049,"11.1-11.2":0.03056,"12.0":0.02037,"13.0":0.06112,"14.0":0.20373,"15.0":0.24448,"16.0":1.71135},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00448,"4.4":0,"4.4.3-4.4.4":0.03529},A:{"11":1.16613,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.13066},Q:{"10.4":0},O:{"0":1.42593},H:{"0":0.04303},L:{"0":52.54926},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/WF.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/WF.js
new file mode 100644
index 0000000..5201b41
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/WF.js
@@ -0,0 +1 @@
+module.exports={C:{"78":0.02568,"91":0.38841,"95":0.02568,"96":0.73509,"97":1.2519,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 92 93 94 98 99 3.5 3.6"},D:{"78":0.05136,"85":0.03852,"90":0.01284,"96":0.0642,"97":1.0593,"98":3.67866,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 83 84 86 87 88 89 91 92 93 94 95 99 100 101"},F:{"82":0.02568,"83":0.2568,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"16":0.02568,"97":0.2568,"98":0.68373,_:"12 13 14 15 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96"},E:{"4":0,"14":0.1284,"15":0.03852,_:"0 5 6 7 8 9 10 11 12 13 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 15.4","13.1":0.01284,"14.1":0.20544,"15.1":5.59182,"15.2-15.3":10.29126},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.011,"11.0-11.2":0,"11.3-11.4":0.011,"12.0-12.1":0,"12.2-12.5":0.011,"13.0-13.1":0,"13.2":0.011,"13.3":0.0385,"13.4-13.7":0.08801,"14.0-14.4":0.11551,"14.5-14.8":0.66007,"15.0-15.1":10.73713,"15.2-15.3":43.16854,"15.4":0.15402},P:{"4":0.03166,"5.0-5.4":0.04039,"6.2-6.4":0.06112,"7.2-7.4":0.12327,"8.2":0.02019,"9.2":0.05136,"10.1":0.03082,"11.1-11.2":0.02111,"12.0":0.06164,"13.0":0.1316,"14.0":0.13719,"15.0":0.03166,"16.0":0.98196},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{"11":0.01284,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.08148},Q:{"10.4":0},O:{"0":0.05432},H:{"0":0},L:{"0":10.15761},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/WS.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/WS.js
new file mode 100644
index 0000000..83245c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/WS.js
@@ -0,0 +1 @@
+module.exports={C:{"52":0.00906,"59":0.04983,"66":0.00906,"72":0.00906,"78":0.04983,"90":0.01812,"93":0.00906,"94":0.09966,"95":0.01812,"96":0.19026,"97":0.50736,"98":0.08154,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 60 61 62 63 64 65 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 91 92 99 3.5 3.6"},D:{"49":0.01359,"63":0.00453,"68":0.01359,"69":0.04077,"70":0.05436,"71":0.01812,"77":0.00906,"78":0.01812,"79":0.02265,"80":0.07701,"84":0.02265,"86":0.00453,"87":0.00453,"88":0.01359,"89":0.03624,"91":0.01812,"92":0.0453,"93":0.02265,"94":0.02718,"95":0.24462,"96":0.20385,"97":6.13362,"98":15.3567,"99":0.00906,"100":0.01812,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 64 65 66 67 72 73 74 75 76 81 83 85 90 101"},F:{"82":0.12231,"83":1.15062,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.15855,"13":0.09966,"14":0.00906,"15":0.04983,"16":0.04077,"17":0.06795,"18":0.42582,"84":0.01359,"85":0.08607,"89":0.04077,"92":0.03171,"94":0.13137,"95":0.03624,"96":0.18573,"97":1.80294,"98":5.33181,_:"79 80 81 83 86 87 88 90 91 93"},E:{"4":0,"13":0.02265,"14":0.13137,_:"0 5 6 7 8 9 10 11 12 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 12.1 15.4","11.1":0.00906,"13.1":0.11778,"14.1":0.1359,"15.1":0.05889,"15.2-15.3":0.0906},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00149,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0544,"10.0-10.2":0,"10.3":0.0149,"11.0-11.2":0.08569,"11.3-11.4":0.19076,"12.0-12.1":0.06483,"12.2-12.5":0.86065,"13.0-13.1":0.04918,"13.2":0.22205,"13.3":0.18703,"13.4-13.7":0.25484,"14.0-14.4":1.42249,"14.5-14.8":2.12144,"15.0-15.1":0.81445,"15.2-15.3":1.10729,"15.4":0},P:{"4":0.16348,"5.0-5.4":0.01121,"6.2-6.4":0.04087,"7.2-7.4":0.63347,"8.2":0.16348,"9.2":0.20434,"10.1":0.08174,"11.1-11.2":0.36782,"12.0":0.05109,"13.0":0.34739,"14.0":0.52108,"15.0":0.49043,"16.0":1.71649},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00025,"4.2-4.3":0.00087,"4.4":0,"4.4.3-4.4.4":0.00435},A:{"10":0.00475,"11":0.09491,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.12583},Q:{"10.4":0.04377},O:{"0":0.61275},H:{"0":1.31562},L:{"0":51.41736},S:{"2.5":0.05471}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/YE.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/YE.js
new file mode 100644
index 0000000..e241f35
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/YE.js
@@ -0,0 +1 @@
+module.exports={C:{"3":0.03086,"37":0.00193,"43":0.00579,"44":0.01157,"47":0.00386,"50":0.00386,"52":0.07523,"54":0.00386,"56":0.00579,"57":0.00772,"59":0.00386,"60":0.00965,"62":0.00386,"63":0.00193,"64":0.00193,"65":0.00193,"66":0.00193,"68":0.00386,"69":0.00579,"72":0.01543,"74":0.00193,"78":0.01929,"82":0.00386,"84":0.00193,"86":0.00386,"87":0.01543,"88":0.00193,"89":0.00965,"91":0.00772,"92":0.00579,"93":0.00386,"94":0.04051,"95":0.02122,"96":0.39737,"97":0.63271,"98":0.00772,_:"2 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 38 39 40 41 42 45 46 48 49 51 53 55 58 61 67 70 71 73 75 76 77 79 80 81 83 85 90 99 3.5 3.6"},D:{"37":0.0135,"40":0.00386,"44":0.00579,"48":0.00193,"49":0.00965,"50":0.00386,"51":0.00386,"52":0.00386,"53":0.00772,"54":0.00193,"55":0.00965,"56":0.00772,"57":0.00386,"60":0.00386,"62":0.00386,"63":0.0135,"64":0.00772,"65":0.00386,"66":0.00965,"67":0.00772,"68":0.00386,"69":0.00965,"70":0.04437,"71":0.00965,"72":0.00386,"73":0.00579,"74":0.01929,"75":0.0135,"76":0.02701,"77":0.00772,"78":0.00579,"79":0.03472,"80":0.02122,"81":0.01929,"83":0.03665,"84":0.01736,"85":0.00965,"86":0.08681,"87":0.06173,"88":0.01736,"89":0.09066,"90":0.03279,"91":0.04437,"92":0.08681,"93":0.05208,"94":0.0463,"95":0.07137,"96":0.36844,"97":2.02545,"98":4.07212,"99":0.00386,"100":0.00579,_:"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 38 39 41 42 43 45 46 47 58 59 61 101"},F:{"65":0.00193,"66":0.00193,"67":0.00579,"79":0.00193,"80":0.00386,"81":0.00193,"82":0.08102,"83":0.11381,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 68 69 70 71 72 73 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00193,"84":0.01157,"85":0.00386,"89":0.00772,"90":0.00579,"92":0.04244,"93":0.00193,"94":0.00965,"95":0.01736,"96":0.03858,"97":0.12924,"98":0.4591,_:"13 14 15 16 17 18 79 80 81 83 86 87 88 91"},E:{"4":0,"14":0.00386,_:"0 5 6 7 8 9 10 11 12 13 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 15.4","14.1":0.01157,"15.1":0.01929,"15.2-15.3":0.00772},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.01017,"5.0-5.1":0,"6.0-6.1":0.00116,"7.0-7.1":0.00727,"8.1-8.4":0,"9.0-9.2":0.00378,"9.3":0.00262,"10.0-10.2":0.00203,"10.3":0.00378,"11.0-11.2":0.00276,"11.3-11.4":0.00262,"12.0-12.1":0.01787,"12.2-12.5":0.18627,"13.0-13.1":0.00581,"13.2":0.01729,"13.3":0.01613,"13.4-13.7":0.04679,"14.0-14.4":0.42994,"14.5-14.8":0.22492,"15.0-15.1":0.21751,"15.2-15.3":0.25311,"15.4":0.00058},P:{"4":0.25168,"5.0-5.4":0.10067,"6.2-6.4":0.0302,"7.2-7.4":0.24162,"8.2":0.02019,"9.2":0.35236,"10.1":0.05034,"11.1-11.2":0.47316,"12.0":0.09061,"13.0":0.34229,"14.0":0.27182,"15.0":0.4329,"16.0":2.72825},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00439,"4.2-4.3":0.00644,"4.4":0,"4.4.3-4.4.4":0.04565},A:{"11":0.01157,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.29855},Q:{"10.4":0},O:{"0":4.36533},H:{"0":10.7942},L:{"0":62.46775},S:{"2.5":0.02421}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/YT.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/YT.js
new file mode 100644
index 0000000..c396649
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/YT.js
@@ -0,0 +1 @@
+module.exports={C:{"51":0.02462,"60":0.10831,"68":0.00985,"73":0.01969,"78":3.68733,"84":0.04431,"85":0.18707,"86":0.01477,"88":0.12308,"89":0.128,"91":0.14769,"94":0.00985,"95":0.17723,"96":2.75688,"97":2.70765,_:"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 40 41 42 43 44 45 46 47 48 49 50 52 53 54 55 56 57 58 59 61 62 63 64 65 66 67 69 70 71 72 74 75 76 77 79 80 81 82 83 87 90 92 93 98 99 3.5 3.6"},D:{"49":0.00492,"58":0.00985,"64":0.01969,"67":0.00985,"69":0.02462,"75":0.05415,"77":0.05415,"79":0.02954,"81":0.01477,"83":0.01477,"85":0.00985,"87":0.13292,"88":0.08369,"89":0.06892,"90":0.02462,"91":0.10831,"92":0.03446,"93":1.11752,"94":0.01477,"95":0.03938,"96":0.48738,"97":8.44295,"98":14.47854,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 59 60 61 62 63 65 66 68 70 71 72 73 74 76 78 80 84 86 99 100 101"},F:{"82":0.05415,"83":0.37907,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"14":0.00492,"17":0.15754,"18":0.01477,"84":0.01477,"85":0.00985,"89":0.02462,"91":0.02954,"92":0.00985,"93":0.00492,"94":0.02462,"95":0.06892,"96":0.12308,"97":1.27013,"98":4.58331,_:"12 13 15 16 79 80 81 83 86 87 88 90"},E:{"4":0,"12":0.01969,"13":0.00492,"14":0.44799,"15":0.12308,_:"0 5 6 7 8 9 10 11 3.1 3.2 5.1 6.1 7.1 9.1 10.1 15.4","11.1":0.01477,"12.1":0.12308,"13.1":0.15754,"14.1":0.86645,"15.1":0.68922,"15.2-15.3":0.58091},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.03171,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00362,"10.0-10.2":0,"10.3":0.00181,"11.0-11.2":0.05164,"11.3-11.4":0.00544,"12.0-12.1":0.01812,"12.2-12.5":0.17303,"13.0-13.1":0.05526,"13.2":0.00181,"13.3":0.03895,"13.4-13.7":0.10056,"14.0-14.4":0.72111,"14.5-14.8":2.14703,"15.0-15.1":2.08361,"15.2-15.3":3.60918,"15.4":0.01449},P:{"4":0.01024,"5.0-5.4":0.01024,"6.2-6.4":0.02048,"7.2-7.4":0.03072,"8.2":0.01015,"9.2":0.12286,"10.1":0.02048,"11.1-11.2":0.18429,"12.0":0.05073,"13.0":0.02048,"14.0":0.11262,"15.0":0.14334,"16.0":3.63464},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00159,"4.2-4.3":0.00159,"4.4":0,"4.4.3-4.4.4":0.01206},A:{"11":0.27077,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.02136,_:"11"},R:{_:"0"},M:{"0":0.13708},Q:{"10.4":0},O:{"0":0.27416},H:{"0":0.19226},L:{"0":36.20709},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZA.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZA.js
new file mode 100644
index 0000000..cd4c0e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZA.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00855,"52":0.03848,"60":0.00855,"68":0.00214,"69":0.00428,"70":0.00428,"71":0.00214,"72":0.00641,"73":0.00428,"74":0.00214,"75":0.00214,"77":0.00855,"78":0.01069,"79":0.00641,"80":0.00428,"81":0.00855,"82":0.00641,"83":0.00428,"84":0.00428,"85":0.00214,"86":0.00855,"87":0.00855,"88":0.01069,"89":0.00855,"90":0.00641,"91":0.01924,"92":0.00641,"93":0.00855,"94":0.01497,"95":0.01069,"96":0.30787,"97":0.49815,"98":0.01069,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 76 99 3.5 3.6"},D:{"11":0.00214,"18":0.00214,"28":0.00855,"34":0.00641,"38":0.00428,"39":0.00214,"40":0.00428,"49":0.04276,"50":0.00641,"52":0.00855,"55":0.00641,"56":0.00214,"63":0.00214,"64":0.01069,"65":0.00641,"66":0.00214,"67":0.01069,"69":0.01497,"70":0.02352,"71":0.00428,"72":0.01283,"73":0.00428,"74":0.00855,"75":0.00214,"76":0.00428,"77":0.00428,"78":0.00641,"79":0.03848,"80":0.02566,"81":0.01497,"83":0.00855,"84":0.00641,"85":0.00641,"86":0.01497,"87":0.02352,"88":0.0171,"89":0.01283,"90":0.01497,"91":0.03207,"92":0.04276,"93":0.07911,"94":0.04704,"95":0.02779,"96":0.1689,"97":3.04451,"98":7.74597,"99":0.00641,"100":0.00641,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 19 20 21 22 23 24 25 26 27 29 30 31 32 33 35 36 37 41 42 43 44 45 46 47 48 51 53 54 57 58 59 60 61 62 68 101"},F:{"28":0.00855,"67":0.00855,"77":0.00428,"78":0.00214,"79":0.00641,"80":0.00641,"81":0.00214,"82":0.05559,"83":0.29932,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01069,"13":0.00428,"14":0.00641,"15":0.00855,"16":0.01069,"17":0.0171,"18":0.04062,"84":0.00855,"85":0.00214,"89":0.00641,"90":0.00214,"91":0.00428,"92":0.00855,"93":0.00214,"94":0.00641,"95":0.03207,"96":0.03635,"97":0.53664,"98":1.69757,_:"79 80 81 83 86 87 88"},E:{"4":0,"13":0.02138,"14":0.06842,"15":0.04917,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1","10.1":0.00641,"11.1":0.01069,"12.1":0.02138,"13.1":0.09835,"14.1":0.2758,"15.1":0.14752,"15.2-15.3":0.36346,"15.4":0.00428},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00219,"6.0-6.1":0.00219,"7.0-7.1":0.01094,"8.1-8.4":0.00875,"9.0-9.2":0.00547,"9.3":0.09842,"10.0-10.2":0.00328,"10.3":0.06342,"11.0-11.2":0.01422,"11.3-11.4":0.02187,"12.0-12.1":0.02624,"12.2-12.5":0.60908,"13.0-13.1":0.04483,"13.2":0.01094,"13.3":0.07764,"13.4-13.7":0.17715,"14.0-14.4":0.56862,"14.5-14.8":1.93878,"15.0-15.1":1.61729,"15.2-15.3":5.6053,"15.4":0.02296},P:{"4":0.30271,"5.0-5.4":0.05095,"6.2-6.4":0.01009,"7.2-7.4":0.55497,"8.2":0.01009,"9.2":0.05045,"10.1":0.05045,"11.1-11.2":0.23208,"12.0":0.15136,"13.0":0.3128,"14.0":0.37334,"15.0":0.36325,"16.0":6.45786},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00122,"4.2-4.3":0.00405,"4.4":0,"4.4.3-4.4.4":0.03405},A:{"11":0.31642,_:"6 7 8 9 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.51896},Q:{"10.4":0.00786},O:{"0":0.58973},H:{"0":3.58065},L:{"0":57.61738},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZM.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZM.js
new file mode 100644
index 0000000..298d5f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZM.js
@@ -0,0 +1 @@
+module.exports={C:{"27":0.00266,"31":0.00797,"34":0.00531,"37":0.00797,"38":0.00266,"43":0.00531,"45":0.00266,"46":0.00266,"47":0.00797,"48":0.00266,"52":0.01328,"68":0.00531,"69":0.00266,"72":0.00531,"78":0.01328,"79":0.00531,"88":0.00531,"91":0.02656,"92":0.00266,"93":0.00266,"94":0.00797,"95":0.02125,"96":0.51261,"97":0.91101,"98":0.04781,_:"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 28 29 30 32 33 35 36 39 40 41 42 44 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 70 71 73 74 75 76 77 80 81 82 83 84 85 86 87 89 90 99 3.5 3.6"},D:{"11":0.00531,"34":0.00266,"38":0.00531,"39":0.00266,"43":0.00531,"49":0.01859,"50":0.01328,"51":0.00266,"55":0.00531,"57":0.00531,"58":0.00266,"59":0.00266,"62":0.00531,"63":0.00797,"65":0.00531,"66":0.00531,"67":0.00531,"68":0.00797,"69":0.00531,"70":0.00266,"71":0.03984,"72":0.00266,"73":0.03718,"74":0.00797,"75":0.00531,"76":0.00797,"77":0.01594,"78":0.00797,"79":0.02125,"80":0.01328,"81":0.03718,"83":0.02656,"84":0.01859,"85":0.00531,"86":0.05578,"87":0.0664,"88":0.02656,"89":0.03187,"90":0.06109,"91":0.03984,"92":0.05046,"93":0.04781,"94":0.04515,"95":0.05843,"96":0.43027,"97":3.8273,"98":8.39562,"99":0.02125,"100":0.00531,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 40 41 42 44 45 46 47 48 52 53 54 56 60 61 64 101"},F:{"34":0.00531,"36":0.00797,"40":0.00266,"42":0.01062,"45":0.00797,"63":0.00531,"65":0.00266,"67":0.01594,"73":0.00531,"76":0.00266,"77":0.00531,"79":0.03187,"80":0.01062,"81":0.00531,"82":0.1567,"83":1.22973,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 37 38 39 41 43 44 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 64 66 68 69 70 71 72 74 75 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6","10.0-10.1":0,"12.1":0.02125},B:{"12":0.08234,"13":0.03187,"14":0.03453,"15":0.02656,"16":0.0239,"17":0.03984,"18":0.12218,"80":0.00266,"84":0.02656,"85":0.02125,"86":0.00531,"88":0.00266,"89":0.03187,"90":0.03453,"91":0.00797,"92":0.04515,"93":0.01328,"94":0.01594,"95":0.03187,"96":0.07968,"97":0.61885,"98":1.78749,_:"79 81 83 87"},E:{"4":0,"13":0.02656,"14":0.03984,"15":0.01062,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 15.4","5.1":0.02656,"9.1":0.00266,"10.1":0.01859,"11.1":0.01328,"12.1":0.01328,"13.1":0.05046,"14.1":0.14077,"15.1":0.09562,"15.2-15.3":0.10358},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01342,"6.0-6.1":0,"7.0-7.1":0.00992,"8.1-8.4":0,"9.0-9.2":0.00058,"9.3":0.1126,"10.0-10.2":0.01925,"10.3":0.15052,"11.0-11.2":0.06943,"11.3-11.4":0.05076,"12.0-12.1":0.03325,"12.2-12.5":1.19306,"13.0-13.1":0.02567,"13.2":0.00642,"13.3":0.11551,"13.4-13.7":0.20361,"14.0-14.4":0.58341,"14.5-14.8":0.89728,"15.0-15.1":0.85236,"15.2-15.3":1.49002,"15.4":0.00408},P:{"4":0.59599,"5.0-5.4":0.01028,"6.2-6.4":0.0302,"7.2-7.4":0.12331,"8.2":0.02019,"9.2":0.06165,"10.1":0.02055,"11.1-11.2":0.03083,"12.0":0.02055,"13.0":0.10276,"14.0":0.10276,"15.0":0.3391,"16.0":1.1406},I:{"0":0,"3":0,"4":0.00091,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00327,"4.2-4.3":0.00327,"4.4":0,"4.4.3-4.4.4":0.10271},A:{"10":0.01005,"11":0.20774,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.02938},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.09547},Q:{"10.4":0},O:{"0":2.3207},H:{"0":13.43286},L:{"0":53.21928},S:{"2.5":0.02203}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZW.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZW.js
new file mode 100644
index 0000000..0a1dc08
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/ZW.js
@@ -0,0 +1 @@
+module.exports={C:{"41":0.00415,"43":0.00829,"47":0.00829,"48":0.00829,"52":0.02073,"57":0.02073,"60":0.00415,"69":0.00829,"72":0.01658,"78":0.0539,"80":0.00415,"82":0.00415,"84":0.02073,"85":0.00415,"87":0.01244,"88":0.03317,"89":0.02073,"90":0.00415,"91":0.02488,"92":0.01244,"93":0.02488,"94":0.03317,"95":0.04975,"96":1.23551,"97":1.8118,"98":0.11609,_:"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 40 42 44 45 46 49 50 51 53 54 55 56 58 59 61 62 63 64 65 66 67 68 70 71 73 74 75 76 77 79 81 83 86 99 3.5 3.6"},D:{"34":0.00415,"37":0.00829,"49":0.02488,"58":0.01244,"60":0.00415,"63":0.02073,"64":0.00829,"65":0.00415,"66":0.01244,"67":0.00829,"68":0.00415,"69":0.01244,"70":0.02073,"71":0.00415,"72":0.00415,"73":0.01244,"74":0.06219,"75":0.00829,"76":0.02073,"77":0.01658,"78":0.01244,"79":0.06219,"80":0.02073,"81":0.02488,"83":0.02902,"84":0.01658,"85":0.02073,"86":0.04561,"87":0.04561,"88":0.01658,"89":0.04561,"90":0.02902,"91":0.07877,"92":0.06219,"93":0.04975,"94":0.07877,"95":0.08707,"96":0.44362,"97":6.38484,"98":14.22493,"99":0.02902,"100":0.02488,_:"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 35 36 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 59 61 62 101"},F:{"36":0.00829,"67":0.01658,"77":0.00415,"79":0.02073,"80":0.07877,"81":0.01658,"82":0.2612,"83":1.57133,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 68 69 70 71 72 73 74 75 76 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.07048,"13":0.04975,"14":0.02488,"15":0.03317,"16":0.0539,"17":0.0539,"18":0.15755,"84":0.02902,"85":0.01658,"89":0.03731,"90":0.02073,"91":0.00829,"92":0.04975,"93":0.01244,"94":0.01658,"95":0.02902,"96":0.0995,"97":1.08211,"98":3.09706,_:"79 80 81 83 86 87 88"},E:{"4":0,"12":0.00415,"13":0.03317,"14":0.08292,"15":0.04561,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1 10.1 15.4","5.1":0.00415,"9.1":0.00415,"11.1":0.00829,"12.1":0.00829,"13.1":0.09536,"14.1":0.41875,"15.1":0.14511,"15.2-15.3":0.38972},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00072,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01878,"8.1-8.4":0.00144,"9.0-9.2":0,"9.3":0.1322,"10.0-10.2":0.00361,"10.3":0.08524,"11.0-11.2":0.0065,"11.3-11.4":0.01734,"12.0-12.1":0.02384,"12.2-12.5":0.5389,"13.0-13.1":0.02384,"13.2":0.01156,"13.3":0.08307,"13.4-13.7":0.10547,"14.0-14.4":0.54323,"14.5-14.8":1.35953,"15.0-15.1":1.22516,"15.2-15.3":3.0304,"15.4":0.013},P:{"4":0.25107,"5.0-5.4":0.01028,"6.2-6.4":0.0302,"7.2-7.4":0.15692,"8.2":0.02019,"9.2":0.06165,"10.1":0.02055,"11.1-11.2":0.05231,"12.0":0.03138,"13.0":0.11507,"14.0":0.10461,"15.0":0.12554,"16.0":1.42274},I:{"0":0,"3":0,"4":0.00035,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00105,"4.2-4.3":0.00805,"4.4":0,"4.4.3-4.4.4":0.1369},A:{"10":0.01244,"11":0.18242,_:"6 7 8 9 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.15806},Q:{"10.4":0.04098},O:{"0":1.70351},H:{"0":9.08919},L:{"0":43.06018},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-af.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-af.js
new file mode 100644
index 0000000..ef7f0d1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-af.js
@@ -0,0 +1 @@
+module.exports={C:{"2":0.09788,"15":0.1015,"18":0.1015,"21":0.1015,"23":0.1015,"25":0.203,"30":0.1015,"43":0.00363,"47":0.00363,"51":0.1015,"52":0.05438,"60":0.00363,"72":0.00725,"78":0.01088,"81":0.00363,"84":0.01813,"87":0.00363,"88":0.00725,"89":0.01088,"91":0.02538,"92":0.00725,"93":0.00363,"94":0.01088,"95":0.02175,"96":5.45563,"97":10.69375,"98":0.029,_:"3 4 5 6 7 8 9 10 11 12 13 14 16 17 19 20 22 24 26 27 28 29 31 32 33 34 35 36 37 38 39 40 41 42 44 45 46 48 49 50 53 54 55 56 57 58 59 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 82 83 85 86 90 99 3.5 3.6"},D:{"19":0.1015,"24":0.3045,"30":0.1015,"33":0.10875,"35":0.203,"38":0.00725,"40":0.00725,"43":0.05438,"47":0.00363,"49":0.03988,"50":0.00363,"53":0.00363,"54":0.1015,"55":0.10513,"56":0.5075,"58":0.00363,"60":0.00363,"63":0.01088,"64":0.00725,"65":0.00725,"66":0.00725,"67":0.0145,"68":0.00725,"69":0.02175,"70":0.01813,"71":0.00725,"72":0.01088,"73":0.00363,"74":0.00725,"75":0.00725,"76":0.00725,"77":0.00725,"78":0.00725,"79":0.058,"80":0.01813,"81":0.02175,"83":0.01813,"84":0.02175,"85":0.01813,"86":0.03988,"87":0.06888,"88":0.02175,"89":0.02538,"90":0.02175,"91":0.03988,"92":0.05075,"93":0.09788,"94":0.03988,"95":0.0435,"96":0.22838,"97":2.929,"98":6.82225,"99":0.00725,"100":0.01088,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 23 25 26 27 28 29 31 32 34 36 37 39 41 42 44 45 46 48 51 52 57 59 61 62 101"},F:{"28":0.00363,"43":0.1015,"64":0.00363,"72":0.00363,"73":0.00363,"79":0.01088,"80":0.01088,"81":0.00725,"82":0.08338,"83":0.42775,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 65 66 67 68 69 70 71 74 75 76 77 78 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0.1015},B:{"12":0.01088,"13":0.00363,"14":0.00363,"15":0.00363,"16":0.00725,"17":0.00725,"18":0.029,"84":0.00725,"85":0.00363,"89":0.00725,"90":0.00363,"92":0.01088,"94":0.00363,"95":0.0145,"96":0.03263,"97":0.31175,"98":0.957,_:"79 80 81 83 86 87 88 91 93"},E:{"4":0,"5":0.1015,"13":0.01813,"14":0.03988,"15":0.02538,_:"0 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1 15.4","5.1":0.00363,"9.1":0.00363,"11.1":0.00725,"12.1":0.01088,"13.1":0.0435,"14.1":0.10875,"15.1":0.06163,"15.2-15.3":0.12325},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00326,"6.0-6.1":1.88832,"7.0-7.1":0.02202,"8.1-8.4":0.00326,"9.0-9.2":0.00245,"9.3":0.0571,"10.0-10.2":0.26265,"10.3":0.08565,"11.0-11.2":0.04813,"11.3-11.4":0.03915,"12.0-12.1":0.03915,"12.2-12.5":0.91357,"13.0-13.1":0.02936,"13.2":0.01468,"13.3":0.07096,"13.4-13.7":0.18435,"14.0-14.4":0.65092,"14.5-14.8":0.9307,"15.0-15.1":0.82058,"15.2-15.3":2.07674,"15.4":0.0106},P:{"4":0.28151,"5.0-5.4":0.01028,"6.2-6.4":0.0302,"7.2-7.4":0.1981,"8.2":0.02019,"9.2":0.0417,"10.1":0.02055,"11.1-11.2":0.13554,"12.0":0.0417,"13.0":0.14597,"14.0":0.17725,"15.0":0.16682,"16.0":2.04354},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00493,"4.2-4.3":0.06896,"4.4":0,"4.4.3-4.4.4":0.24487},A:{"8":0.203,"9":0.203,"10":0.203,"11":0.116,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0.00638},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.19763},Q:{"10.4":0},O:{"0":0.46538},H:{"0":7.09768},L:{"0":45.066},S:{"2.5":0.01275}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-an.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-an.js
new file mode 100644
index 0000000..076c254
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-an.js
@@ -0,0 +1 @@
+module.exports={C:{"55":0.0083,"89":0.0083,"91":0.03595,"96":0.5613,"97":0.18249,_:"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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 90 92 93 94 95 98 99 3.5 3.6"},D:{"49":0.0083,"71":0.02765,"94":0.0083,"96":0.0083,"97":1.73089,"98":1.20554,_:"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 40 41 42 43 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 91 92 93 95 99 100 101"},F:{"82":0.01936,"83":0.07189,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"92":0.0083,"94":0.03595,"98":0.19908,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 93 95 96 97"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 14.1","13.1":0.01936,"15.1":1.22213,"15.2-15.3":12.48951,"15.4":1.91891},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00607,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0.00607,"13.4-13.7":0,"14.0-14.4":0.07892,"14.5-14.8":3.83658,"15.0-15.1":4.37686,"15.2-15.3":49.40205,"15.4":2.98063},P:{"4":0.02035,"5.0-5.4":0.01028,"6.2-6.4":0.0302,"7.2-7.4":0.1981,"8.2":0.02019,"9.2":0.05087,"10.1":0.02055,"11.1-11.2":0.13554,"12.0":0.0417,"13.0":0.14597,"14.0":0.17725,"15.0":0.02035,"16.0":0.55958},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},A:{_:"6 7 8 9 10 11 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.13023},Q:{"10.4":0.02171},O:{"0":0.20258},H:{"0":0.28083},L:{"0":10.55679},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-as.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-as.js
new file mode 100644
index 0000000..6b01572
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-as.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.00647,"36":0.01294,"43":0.09384,"47":0.00324,"52":0.06148,"56":0.00971,"60":0.00324,"68":0.00324,"72":0.00647,"75":0.00647,"78":0.01618,"79":0.00324,"80":0.00324,"81":0.00324,"82":0.00324,"84":0.00971,"87":0.01294,"88":0.00971,"89":0.00971,"90":0.00647,"91":0.02265,"92":0.00647,"93":0.00647,"94":0.01294,"95":0.02589,"96":0.48864,"97":0.83165,"98":0.02912,_:"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 35 37 38 39 40 41 42 44 45 46 48 49 50 51 53 54 55 57 58 59 61 62 63 64 65 66 67 69 70 71 73 74 76 77 83 85 86 99 3.5 3.6"},D:{"22":0.00971,"26":0.00324,"34":0.01618,"35":0.00324,"38":0.0356,"42":0.00647,"47":0.01294,"48":0.00971,"49":0.05501,"53":0.02265,"55":0.00971,"56":0.00971,"57":0.00971,"58":0.00647,"61":0.00647,"62":0.01294,"63":0.01294,"64":0.00647,"65":0.00971,"66":0.00647,"67":0.00971,"68":0.00971,"69":0.0809,"70":0.05825,"71":0.02265,"72":0.05178,"73":0.00971,"74":0.0356,"75":0.03236,"76":0.01294,"77":0.01942,"78":0.02912,"79":0.18122,"80":0.03883,"81":0.03236,"83":0.0453,"84":0.0453,"85":0.03883,"86":0.06472,"87":0.11002,"88":0.02912,"89":0.06148,"90":0.0356,"91":0.05501,"92":0.09384,"93":0.14562,"94":0.07443,"95":0.0809,"96":0.40126,"97":5.80538,"98":14.57818,"99":0.01618,"100":0.01618,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 27 28 29 30 31 32 33 36 37 39 40 41 43 44 45 46 50 51 52 54 59 60 101"},F:{"28":0.00971,"36":0.00647,"40":0.00647,"46":0.01942,"79":0.00324,"80":0.00324,"82":0.0809,"83":0.37538,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00324,"14":0.00324,"16":0.00324,"17":0.00647,"18":0.02589,"84":0.00647,"85":0.00324,"86":0.00324,"89":0.00971,"90":0.00324,"91":0.00324,"92":0.00971,"94":0.00647,"95":0.00971,"96":0.02912,"97":0.48864,"98":1.86717,_:"13 15 79 80 81 83 87 88 93"},E:{"4":0,"12":0.00324,"13":0.0356,"14":0.13268,"15":0.07119,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1","5.1":0.01942,"9.1":0.01294,"10.1":0.00647,"11.1":0.01294,"12.1":0.02265,"13.1":0.10355,"14.1":0.46922,"15.1":0.21358,"15.2-15.3":0.41744,"15.4":0.00324},G:{"8":0.00104,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.0052,"5.0-5.1":0.00623,"6.0-6.1":0.00623,"7.0-7.1":0.02598,"8.1-8.4":0.01143,"9.0-9.2":0.02182,"9.3":0.07481,"10.0-10.2":0.04156,"10.3":0.08416,"11.0-11.2":0.10287,"11.3-11.4":0.03117,"12.0-12.1":0.04156,"12.2-12.5":0.51121,"13.0-13.1":0.0426,"13.2":0.01455,"13.3":0.07585,"13.4-13.7":0.24418,"14.0-14.4":0.77617,"14.5-14.8":1.99083,"15.0-15.1":1.62716,"15.2-15.3":4.62483,"15.4":0.02805},P:{"4":0.34125,"5.0-5.4":0.01028,"6.2-6.4":0.0302,"7.2-7.4":0.10341,"8.2":0.02019,"9.2":0.03102,"10.1":0.02055,"11.1-11.2":0.09307,"12.0":0.04136,"13.0":0.14477,"14.0":0.15511,"15.0":0.15511,"16.0":1.98545},I:{"0":0,"3":0,"4":0.03949,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02962,"4.2-4.3":0.09872,"4.4":0,"4.4.3-4.4.4":0.56269},A:{"8":0.02586,"9":0.01724,"10":0.00862,"11":0.99998,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.17586},Q:{"10.4":0.4126},O:{"0":1.92098},H:{"0":1.10144},L:{"0":49.86406},S:{"2.5":0.2435}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-eu.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-eu.js
new file mode 100644
index 0000000..2b844c5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-eu.js
@@ -0,0 +1 @@
+module.exports={C:{"44":0.00515,"48":0.0103,"52":0.10817,"55":0.01545,"56":0.00515,"59":0.0103,"60":0.0103,"66":0.00515,"68":0.0206,"72":0.00515,"77":0.01545,"78":0.09787,"79":0.01545,"80":0.0103,"81":0.05151,"82":0.0103,"83":0.00515,"84":0.03091,"85":0.00515,"86":0.0103,"87":0.0206,"88":0.0206,"89":0.0206,"90":0.05666,"91":0.14938,"92":0.01545,"93":0.0206,"94":0.08242,"95":0.08242,"96":1.74619,"97":2.61156,"98":0.0103,_:"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 40 41 42 43 45 46 47 49 50 51 53 54 57 58 61 62 63 64 65 67 69 70 71 73 74 75 76 99 3.5 3.6"},D:{"22":0.0103,"38":0.01545,"40":0.03606,"43":0.0103,"47":0.0103,"48":0.0103,"49":0.10302,"51":0.0206,"52":0.0103,"53":0.00515,"54":0.00515,"56":0.0103,"60":0.02576,"62":0.0103,"63":0.0103,"64":0.02576,"65":0.0206,"66":0.03606,"67":0.01545,"68":0.00515,"69":0.06696,"70":0.02576,"71":0.0103,"72":0.03091,"73":0.0103,"74":0.01545,"75":0.19059,"76":0.02576,"77":0.0206,"78":0.03091,"79":0.15968,"80":0.09272,"81":0.03091,"83":0.04636,"84":0.08242,"85":0.11847,"86":0.09272,"87":0.16483,"88":0.04636,"89":0.06181,"90":0.06181,"91":0.08757,"92":0.08242,"93":0.45329,"94":0.20604,"95":0.11847,"96":0.64388,"97":9.22029,"98":18.22424,"99":0.0103,"100":0.01545,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 41 42 44 45 46 50 55 57 58 59 61 101"},F:{"31":0.0206,"36":0.00515,"40":0.01545,"68":0.0103,"77":0.0103,"78":0.00515,"79":0.0103,"80":0.0103,"81":0.00515,"82":0.55631,"83":1.76164,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 37 38 39 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 69 70 71 72 73 74 75 76 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.0103,"15":0.0103,"16":0.00515,"17":0.0103,"18":0.03091,"84":0.00515,"85":0.0103,"86":0.00515,"89":0.00515,"90":0.00515,"91":0.0103,"92":0.01545,"93":0.0103,"94":0.0103,"95":0.03606,"96":0.07211,"97":1.30835,"98":4.29078,_:"13 14 79 80 81 83 87 88"},E:{"4":0,"12":0.00515,"13":0.06181,"14":0.33482,"15":0.20089,_:"0 5 6 7 8 9 10 11 3.1 3.2 6.1 7.1","5.1":0.0103,"9.1":0.0103,"10.1":0.0103,"11.1":0.04121,"12.1":0.07211,"13.1":0.32451,"14.1":1.12292,"15.1":0.60267,"15.2-15.3":1.26715,"15.4":0.0103},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00311,"6.0-6.1":0.00156,"7.0-7.1":0.014,"8.1-8.4":0.00467,"9.0-9.2":0.01089,"9.3":0.10111,"10.0-10.2":0.00622,"10.3":0.11044,"11.0-11.2":0.02333,"11.3-11.4":0.04044,"12.0-12.1":0.02178,"12.2-12.5":0.55688,"13.0-13.1":0.02489,"13.2":0.00933,"13.3":0.05911,"13.4-13.7":0.19911,"14.0-14.4":0.63776,"14.5-14.8":3.00216,"15.0-15.1":2.24617,"15.2-15.3":8.43093,"15.4":0.042},P:{"4":0.10593,_:"5.0-5.4 6.2-6.4 7.2-7.4 8.2 10.1","9.2":0.01059,"11.1-11.2":0.06356,"12.0":0.02119,"13.0":0.09534,"14.0":0.11653,"15.0":0.22246,"16.0":2.8072},I:{"0":0,"3":0,"4":0.00572,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00572,"4.2-4.3":0.01,"4.4":0,"4.4.3-4.4.4":0.04645},A:{"8":0.01636,"9":0.01636,"10":0.00545,"11":0.33269,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.35398},Q:{"10.4":0},O:{"0":0.13577},H:{"0":0.40857},L:{"0":28.30804},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-na.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-na.js
new file mode 100644
index 0000000..4742e98
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-na.js
@@ -0,0 +1 @@
+module.exports={C:{"2":0.00482,"4":0.06749,"11":0.00964,"38":0.00482,"43":0.00482,"44":0.02411,"45":0.00482,"48":0.00482,"52":0.03375,"54":0.00964,"55":0.01928,"63":0.01928,"68":0.00482,"72":0.00482,"78":0.10124,"79":0.00482,"80":0.00482,"81":0.00964,"82":0.00964,"83":0.00482,"84":0.00482,"85":0.00482,"86":0.00482,"87":0.01446,"88":0.01446,"89":0.01446,"90":0.00964,"91":0.08678,"92":0.00482,"93":0.01446,"94":0.06749,"95":0.05785,"96":0.89189,"97":1.4222,"98":0.00482,_:"3 5 6 7 8 9 10 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 39 40 41 42 46 47 49 50 51 53 56 57 58 59 60 61 62 64 65 66 67 69 70 71 73 74 75 76 77 99 3.5 3.6"},D:{"35":0.01446,"38":0.00482,"40":0.01928,"43":0.00482,"46":0.00482,"47":0.00964,"48":0.06267,"49":0.06749,"50":0.00482,"52":0.00482,"56":0.07232,"58":0.00482,"59":0.00964,"60":0.04821,"63":0.00964,"64":0.03857,"65":0.01446,"66":0.03857,"67":0.01928,"68":0.00964,"69":0.01928,"70":0.06267,"71":0.00482,"72":0.24587,"73":0.00482,"74":0.02411,"75":0.01928,"76":0.19284,"77":0.01446,"78":0.04821,"79":0.3664,"80":0.07714,"81":0.06267,"83":0.28926,"84":0.11088,"85":0.08678,"86":0.07714,"87":0.14463,"88":0.04821,"89":0.07232,"90":0.07714,"91":0.1832,"92":0.13981,"93":0.32783,"94":0.35675,"95":0.12053,"96":1.18597,"97":8.3789,"98":15.28739,"99":0.01928,"100":0.04339,"101":0.01446,_:"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 36 37 39 41 42 44 45 51 53 54 55 57 61 62"},F:{"82":0.12535,"83":0.42907,_:"9 11 12 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00964,"15":0.02893,"16":0.00964,"17":0.02411,"18":0.22177,"84":0.00482,"85":0.00964,"86":0.00482,"87":0.02411,"89":0.00482,"90":0.00482,"91":0.00482,"92":0.00964,"93":0.00482,"94":0.00964,"95":0.05785,"96":0.06749,"97":1.24382,"98":4.18945,_:"13 14 79 80 81 83 88"},E:{"4":0,"8":0.00482,"9":0.00964,"12":0.00964,"13":0.07232,"14":0.39532,"15":0.25069,_:"0 5 6 7 10 11 3.1 3.2 5.1 6.1 7.1","9.1":0.04339,"10.1":0.02411,"11.1":0.05785,"12.1":0.12535,"13.1":1.42702,"14.1":1.58611,"15.1":0.71833,"15.2-15.3":1.79341,"15.4":0.02411},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00775,"7.0-7.1":0.01291,"8.1-8.4":0.00775,"9.0-9.2":0.01033,"9.3":0.09037,"10.0-10.2":0.01033,"10.3":0.10586,"11.0-11.2":0.04131,"11.3-11.4":0.04906,"12.0-12.1":0.04906,"12.2-12.5":0.57578,"13.0-13.1":0.04648,"13.2":0.01807,"13.3":0.10328,"13.4-13.7":0.32533,"14.0-14.4":1.04053,"14.5-14.8":4.7405,"15.0-15.1":3.50115,"15.2-15.3":15.00641,"15.4":0.07488},P:{"4":0.05406,_:"5.0-5.4 6.2-6.4 7.2-7.4 8.2 9.2 10.1","11.1-11.2":0.03243,"12.0":0.01081,"13.0":0.04325,"14.0":0.07568,"15.0":0.06487,"16.0":1.82716},I:{"0":0,"3":0,"4":0.0093,"2.1":0,"2.2":0.00558,"2.3":0.00093,"4.1":0.00186,"4.2-4.3":0.02045,"4.4":0,"4.4.3-4.4.4":0.0344},A:{"7":0.00495,"8":0.01486,"9":0.06936,"11":0.62916,_:"6 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{_:"10 11"},R:{_:"0"},M:{"0":0.4144},Q:{"10.4":0.00518},O:{"0":0.11396},H:{"0":0.19616},L:{"0":22.93694},S:{"2.5":0.00518}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-oc.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-oc.js
new file mode 100644
index 0000000..0845984
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-oc.js
@@ -0,0 +1 @@
+module.exports={C:{"34":0.01163,"48":0.00582,"52":0.02908,"54":0.01745,"66":0.01163,"78":0.06397,"84":0.01163,"87":0.01745,"88":0.00582,"89":0.01163,"90":0.01163,"91":0.05815,"93":0.01745,"94":0.16282,"95":0.04652,"96":0.94203,"97":1.50027,"98":0.01163,_:"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 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 55 56 57 58 59 60 61 62 63 64 65 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 85 86 92 99 3.5 3.6"},D:{"26":0.01163,"34":0.02908,"38":0.1163,"49":0.05815,"53":0.03489,"56":0.01163,"57":0.01163,"59":0.03489,"60":0.02326,"61":0.00582,"64":0.03489,"65":0.02326,"66":0.02326,"67":0.01745,"68":0.01745,"69":0.01745,"70":0.04071,"71":0.00582,"72":0.04071,"73":0.01163,"74":0.02326,"75":0.01745,"76":0.02326,"77":0.01163,"78":0.02908,"79":0.37216,"80":0.0756,"81":0.04071,"83":0.02908,"84":0.02908,"85":0.04071,"86":0.05815,"87":0.19771,"88":0.03489,"89":0.02908,"90":0.06397,"91":0.08141,"92":0.17445,"93":0.3082,"94":0.26168,"95":0.40124,"96":1.17463,"97":10.61238,"98":23.13789,"99":0.01745,"100":0.01745,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 47 48 50 51 52 54 55 58 62 63 101"},F:{"36":0.00582,"46":0.06397,"80":0.00582,"82":0.13956,"83":0.41868,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00582,"16":0.01163,"17":0.00582,"18":0.02326,"84":0.01163,"85":0.00582,"86":0.01745,"87":0.00582,"89":0.01745,"90":0.01163,"91":0.01163,"92":0.01745,"93":0.00582,"94":0.01163,"95":0.08723,"96":0.09304,"97":1.3549,"98":4.89042,_:"12 13 14 79 80 81 83 88"},E:{"4":0,"11":0.00582,"12":0.01745,"13":0.1163,"14":0.52335,"15":0.35472,_:"0 5 6 7 8 9 10 3.1 3.2 5.1 6.1 7.1","9.1":0.01163,"10.1":0.03489,"11.1":0.06397,"12.1":0.13956,"13.1":0.57569,"14.1":2.21552,"15.1":1.04089,"15.2-15.3":2.08759,"15.4":0.01163},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01655,"6.0-6.1":0.01242,"7.0-7.1":0.01242,"8.1-8.4":0.02069,"9.0-9.2":0.02069,"9.3":0.20693,"10.0-10.2":0.01862,"10.3":0.23176,"11.0-11.2":0.07242,"11.3-11.4":0.08277,"12.0-12.1":0.05794,"12.2-12.5":1.05326,"13.0-13.1":0.03311,"13.2":0.01448,"13.3":0.10139,"13.4-13.7":0.29591,"14.0-14.4":0.85461,"14.5-14.8":3.89643,"15.0-15.1":2.72729,"15.2-15.3":10.90917,"15.4":0.04759},P:{"4":0.74859,"5.0-5.4":0.01085,"6.2-6.4":0.0302,"7.2-7.4":0.0217,"8.2":0.02019,"9.2":0.01085,"10.1":0.02055,"11.1-11.2":0.03255,"12.0":0.0217,"13.0":0.09764,"14.0":0.10849,"15.0":0.10849,"16.0":2.53869},I:{"0":0,"3":0,"4":0.00266,"2.1":0,"2.2":0.00133,"2.3":0.00133,"4.1":0.00266,"4.2-4.3":0.00598,"4.4":0,"4.4.3-4.4.4":0.0279},A:{"9":0.01084,"11":0.39039,_:"6 7 8 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.38502},Q:{"10.4":0.00837},O:{"0":0.10463},H:{"0":0.1466},L:{"0":17.01388},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-sa.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-sa.js
new file mode 100644
index 0000000..e31160b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-sa.js
@@ -0,0 +1 @@
+module.exports={C:{"27":0.00756,"52":0.04911,"60":0.00378,"68":0.00756,"72":0.00378,"78":0.02267,"81":0.00756,"84":0.00756,"86":0.00756,"87":0.00378,"88":0.01511,"89":0.00756,"90":0.01133,"91":0.03778,"92":0.00756,"93":0.00756,"94":0.03022,"95":0.02267,"96":0.54781,"97":0.90294,"98":0.00756,_:"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 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 53 54 55 56 57 58 59 61 62 63 64 65 66 67 69 70 71 73 74 75 76 77 79 80 82 83 85 99 3.5 3.6"},D:{"38":0.01511,"47":0.01133,"49":0.07934,"51":0.00756,"53":0.00756,"54":0.00756,"55":0.00378,"58":0.00756,"63":0.00756,"64":0.00378,"65":0.00756,"66":0.01511,"67":0.00756,"68":0.00756,"69":0.01511,"70":0.01133,"71":0.00756,"72":0.00756,"73":0.00378,"74":0.01133,"75":0.03778,"76":0.01133,"77":0.01133,"78":0.01133,"79":0.08689,"80":0.02267,"81":0.02645,"83":0.02645,"84":0.04156,"85":0.03022,"86":0.05667,"87":0.09067,"88":0.02645,"89":0.04534,"90":0.03778,"91":0.4458,"92":0.06045,"93":0.15868,"94":0.06045,"95":0.07178,"96":0.43447,"97":7.72601,"98":18.95423,"99":0.02267,"100":0.01511,_:"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 39 40 41 42 43 44 45 46 48 50 52 56 57 59 60 61 62 101"},F:{"36":0.00756,"73":0.00756,"81":0.00378,"82":0.70271,"83":1.74921,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 74 75 76 77 78 79 80 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01133,"17":0.00378,"18":0.01511,"84":0.00378,"89":0.00378,"90":0.00378,"91":0.00756,"92":0.00756,"94":0.00378,"95":0.01889,"96":0.02267,"97":0.47225,"98":1.71143,_:"12 13 14 16 79 80 81 83 85 86 87 88 93"},E:{"4":0,"13":0.01511,"14":0.04156,"15":0.034,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1 15.4","5.1":0.00756,"11.1":0.00756,"12.1":0.01511,"13.1":0.06045,"14.1":0.14734,"15.1":0.08312,"15.2-15.3":0.15112},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0058,"6.0-6.1":0.00097,"7.0-7.1":0.00387,"8.1-8.4":0.00048,"9.0-9.2":0.00048,"9.3":0.0266,"10.0-10.2":0.00097,"10.3":0.02612,"11.0-11.2":0.00435,"11.3-11.4":0.01596,"12.0-12.1":0.00629,"12.2-12.5":0.21089,"13.0-13.1":0.00677,"13.2":0.0029,"13.3":0.0208,"13.4-13.7":0.07836,"14.0-14.4":0.20509,"14.5-14.8":1.00705,"15.0-15.1":0.75117,"15.2-15.3":2.44845,"15.4":0.01112},P:{"4":0.15406,"5.0-5.4":0.01085,"6.2-6.4":0.0302,"7.2-7.4":0.20541,"8.2":0.02019,"9.2":0.01027,"10.1":0.02055,"11.1-11.2":0.08216,"12.0":0.02054,"13.0":0.1027,"14.0":0.1027,"15.0":0.1027,"16.0":1.57137},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00272,"4.2-4.3":0.00544,"4.4":0,"4.4.3-4.4.4":0.03539},A:{"8":0.00389,"9":0.00389,"11":0.12445,_:"6 7 10 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.112},Q:{"10.4":0},O:{"0":0.04978},H:{"0":0.16494},L:{"0":42.74835},S:{"2.5":0}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-ww.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-ww.js
new file mode 100644
index 0000000..df07a0d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/data/regions/alt-ww.js
@@ -0,0 +1 @@
+module.exports={C:{"2":0.00832,"4":0.01664,"15":0.00832,"18":0.00416,"21":0.00832,"23":0.00416,"25":0.01248,"30":0.00832,"36":0.00416,"43":0.04161,"44":0.00832,"48":0.00416,"51":0.00832,"52":0.06242,"55":0.00832,"56":0.00832,"59":0.00416,"60":0.00832,"63":0.00832,"68":0.00832,"72":0.00832,"77":0.00416,"78":0.05825,"79":0.00832,"80":0.00416,"81":0.01664,"82":0.00416,"83":0.00416,"84":0.01248,"86":0.00416,"87":0.01248,"88":0.01248,"89":0.01248,"90":0.02081,"91":0.09986,"92":0.00832,"93":0.01248,"94":0.04577,"95":0.04577,"96":1.16508,"97":2.02641,"98":0.01664,_:"3 5 6 7 8 9 10 11 12 13 14 16 17 19 20 22 24 26 27 28 29 31 32 33 34 35 37 38 39 40 41 42 45 46 47 49 50 53 54 57 58 61 62 64 65 66 67 69 70 71 73 74 75 76 85 99 3.5 3.6"},D:{"19":0.00832,"22":0.00832,"24":0.01664,"30":0.00832,"33":0.00832,"34":0.00832,"35":0.01664,"38":0.02081,"40":0.01248,"43":0.00832,"47":0.00832,"48":0.02081,"49":0.07074,"51":0.00832,"52":0.00416,"53":0.01248,"54":0.00832,"55":0.01248,"56":0.05409,"57":0.00416,"58":0.00416,"59":0.00416,"60":0.02081,"61":0.00416,"62":0.00832,"63":0.00832,"64":0.02081,"65":0.01248,"66":0.02081,"67":0.01248,"68":0.00832,"69":0.05409,"70":0.04993,"71":0.01664,"72":0.09154,"73":0.00832,"74":0.02497,"75":0.06242,"76":0.05825,"77":0.01664,"78":0.03745,"79":0.21221,"80":0.05825,"81":0.03745,"83":0.10403,"84":0.06658,"85":0.07074,"86":0.07074,"87":0.12899,"88":0.03745,"89":0.06242,"90":0.04993,"91":0.11235,"92":0.09986,"93":0.26214,"94":0.17476,"95":0.09986,"96":0.64912,"97":7.14028,"98":15.53301,"99":0.01664,"100":0.02081,"101":0.00416,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 23 25 26 27 28 29 31 32 36 37 39 41 42 44 45 46 50"},F:{"28":0.00416,"31":0.00416,"36":0.00416,"40":0.00832,"43":0.00416,"46":0.00832,"77":0.00416,"79":0.00416,"80":0.00416,"82":0.22886,"83":0.78643,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 32 33 34 35 37 38 39 41 42 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 81 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0.00416},B:{"12":0.00832,"15":0.01248,"16":0.00416,"17":0.01248,"18":0.0749,"84":0.00416,"85":0.00832,"86":0.00416,"87":0.00832,"89":0.00832,"90":0.00416,"91":0.00416,"92":0.01248,"93":0.00416,"94":0.00832,"95":0.02913,"96":0.04993,"97":0.85301,"98":2.98344,_:"13 14 79 80 81 83 88"},E:{"4":0,"5":0.00832,"12":0.00416,"13":0.04993,"14":0.23718,"15":0.14564,_:"0 6 7 8 9 10 11 3.1 3.2 6.1 7.1","5.1":0.01248,"9.1":0.01664,"10.1":0.01248,"11.1":0.02913,"12.1":0.05825,"13.1":0.47852,"14.1":0.87797,"15.1":0.42026,"15.2-15.3":0.93623,"15.4":0.01248},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00299,"5.0-5.1":0.00448,"6.0-6.1":0.12242,"7.0-7.1":0.01941,"8.1-8.4":0.00746,"9.0-9.2":0.01344,"9.3":0.0836,"10.0-10.2":0.03882,"10.3":0.09555,"11.0-11.2":0.06419,"11.3-11.4":0.03732,"12.0-12.1":0.03732,"12.2-12.5":0.55984,"13.0-13.1":0.03732,"13.2":0.01344,"13.3":0.07614,"13.4-13.7":0.24483,"14.0-14.4":0.7778,"14.5-14.8":2.77828,"15.0-15.1":2.12738,"15.2-15.3":7.74216,"15.4":0.04031},P:{"4":0.21833,"5.0-5.4":0.01028,"6.2-6.4":0.0302,"7.2-7.4":0.07278,"8.2":0.02019,"9.2":0.03119,"10.1":0.02055,"11.1-11.2":0.07278,"12.0":0.03119,"13.0":0.10397,"14.0":0.11436,"15.0":0.14555,"16.0":2.10015},I:{"0":0,"3":0,"4":0.01335,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01335,"4.2-4.3":0.06339,"4.4":0,"4.4.3-4.4.4":0.26025},A:{"8":0.03955,"9":0.05932,"10":0.02637,"11":0.61958,_:"6 7 5.5"},K:{_:"0 10 11 12 11.1 11.5 12.1"},J:{"7":0,"10":0},N:{"10":0.04242,"11":0.03845},R:{_:"0"},M:{"0":0.28027},Q:{"10.4":0.16933},O:{"0":0.86417},H:{"0":1.03373},L:{"0":37.2095},S:{"2.5":0.09926}};
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/lib/statuses.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/lib/statuses.js
new file mode 100644
index 0000000..4d73ab3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/lib/statuses.js
@@ -0,0 +1,9 @@
+module.exports = {
+  1: 'ls', // WHATWG Living Standard
+  2: 'rec', // W3C Recommendation
+  3: 'pr', // W3C Proposed Recommendation
+  4: 'cr', // W3C Candidate Recommendation
+  5: 'wd', // W3C Working Draft
+  6: 'other', // Non-W3C, but reputable
+  7: 'unoff' // Unofficial, Editor's Draft or W3C "Note"
+}
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/lib/supported.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/lib/supported.js
new file mode 100644
index 0000000..3f81e4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/lib/supported.js
@@ -0,0 +1,9 @@
+module.exports = {
+  y: 1 << 0,
+  n: 1 << 1,
+  a: 1 << 2,
+  p: 1 << 3,
+  u: 1 << 4,
+  x: 1 << 5,
+  d: 1 << 6
+}
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/agents.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/agents.js
new file mode 100644
index 0000000..0c8a790
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/agents.js
@@ -0,0 +1,47 @@
+'use strict'
+
+const browsers = require('./browsers').browsers
+const versions = require('./browserVersions').browserVersions
+const agentsData = require('../../data/agents')
+
+function unpackBrowserVersions(versionsData) {
+  return Object.keys(versionsData).reduce((usage, version) => {
+    usage[versions[version]] = versionsData[version]
+    return usage
+  }, {})
+}
+
+module.exports.agents = Object.keys(agentsData).reduce((map, key) => {
+  let versionsData = agentsData[key]
+  map[browsers[key]] = Object.keys(versionsData).reduce((data, entry) => {
+    if (entry === 'A') {
+      data.usage_global = unpackBrowserVersions(versionsData[entry])
+    } else if (entry === 'C') {
+      data.versions = versionsData[entry].reduce((list, version) => {
+        if (version === '') {
+          list.push(null)
+        } else {
+          list.push(versions[version])
+        }
+        return list
+      }, [])
+    } else if (entry === 'D') {
+      data.prefix_exceptions = unpackBrowserVersions(versionsData[entry])
+    } else if (entry === 'E') {
+      data.browser = versionsData[entry]
+    } else if (entry === 'F') {
+      data.release_date = Object.keys(versionsData[entry]).reduce(
+        (map2, key2) => {
+          map2[versions[key2]] = versionsData[entry][key2]
+          return map2
+        },
+        {}
+      )
+    } else {
+      // entry is B
+      data.prefix = versionsData[entry]
+    }
+    return data
+  }, {})
+  return map
+}, {})
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/browserVersions.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/browserVersions.js
new file mode 100644
index 0000000..553526e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/browserVersions.js
@@ -0,0 +1 @@
+module.exports.browserVersions = require('../../data/browserVersions')
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/browsers.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/browsers.js
new file mode 100644
index 0000000..85e68b4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/browsers.js
@@ -0,0 +1 @@
+module.exports.browsers = require('../../data/browsers')
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/feature.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/feature.js
new file mode 100644
index 0000000..9440b8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/feature.js
@@ -0,0 +1,48 @@
+'use strict'
+
+const statuses = require('../lib/statuses')
+const supported = require('../lib/supported')
+const browsers = require('./browsers').browsers
+const versions = require('./browserVersions').browserVersions
+
+const MATH2LOG = Math.log(2)
+
+function unpackSupport(cipher) {
+  // bit flags
+  let stats = Object.keys(supported).reduce((list, support) => {
+    if (cipher & supported[support]) list.push(support)
+    return list
+  }, [])
+
+  // notes
+  let notes = cipher >> 7
+  let notesArray = []
+  while (notes) {
+    let note = Math.floor(Math.log(notes) / MATH2LOG) + 1
+    notesArray.unshift(`#${note}`)
+    notes -= Math.pow(2, note - 1)
+  }
+
+  return stats.concat(notesArray).join(' ')
+}
+
+function unpackFeature(packed) {
+  let unpacked = { status: statuses[packed.B], title: packed.C }
+  unpacked.stats = Object.keys(packed.A).reduce((browserStats, key) => {
+    let browser = packed.A[key]
+    browserStats[browsers[key]] = Object.keys(browser).reduce(
+      (stats, support) => {
+        let packedVersions = browser[support].split(' ')
+        let unpacked2 = unpackSupport(support)
+        packedVersions.forEach(v => (stats[versions[v]] = unpacked2))
+        return stats
+      },
+      {}
+    )
+    return browserStats
+  }, {})
+  return unpacked
+}
+
+module.exports = unpackFeature
+module.exports.default = unpackFeature
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/features.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/features.js
new file mode 100644
index 0000000..8362aec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/features.js
@@ -0,0 +1,6 @@
+/*
+ * Load this dynamically so that it
+ * doesn't appear in the rollup bundle.
+ */
+
+module.exports.features = require('../../data/features')
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/index.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/index.js
new file mode 100644
index 0000000..12017e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/index.js
@@ -0,0 +1,4 @@
+module.exports.agents = require('./agents').agents
+module.exports.feature = require('./feature')
+module.exports.features = require('./features').features
+module.exports.region = require('./region')
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/region.js b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/region.js
new file mode 100644
index 0000000..d5cc2b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/dist/unpacker/region.js
@@ -0,0 +1,22 @@
+'use strict'
+
+const browsers = require('./browsers').browsers
+
+function unpackRegion(packed) {
+  return Object.keys(packed).reduce((list, browser) => {
+    let data = packed[browser]
+    list[browsers[browser]] = Object.keys(data).reduce((memo, key) => {
+      let stats = data[key]
+      if (key === '_') {
+        stats.split(' ').forEach(version => (memo[version] = null))
+      } else {
+        memo[key] = stats
+      }
+      return memo
+    }, {})
+    return list
+  }, {})
+}
+
+module.exports = unpackRegion
+module.exports.default = unpackRegion
diff --git a/node_modules/mathjs/examples/node_modules/caniuse-lite/package.json b/node_modules/mathjs/examples/node_modules/caniuse-lite/package.json
new file mode 100644
index 0000000..e9f5dff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/caniuse-lite/package.json
@@ -0,0 +1,34 @@
+{
+  "name": "caniuse-lite",
+  "version": "1.0.30001320",
+  "description": "A smaller version of caniuse-db, with only the essentials!",
+  "main": "dist/unpacker/index.js",
+  "files": [
+    "data",
+    "dist"
+  ],
+  "keywords": [
+    "support",
+    "css",
+    "js",
+    "html5",
+    "svg"
+  ],
+  "author": {
+    "name": "Ben Briggs",
+    "email": "beneb.info@gmail.com",
+    "url": "http://beneb.info"
+  },
+  "repository": "browserslist/caniuse-lite",
+  "funding": [
+    {
+      "type": "opencollective",
+      "url": "https://opencollective.com/browserslist"
+    },
+    {
+      "type": "tidelift",
+      "url": "https://tidelift.com/funding/github/npm/caniuse-lite"
+    }
+  ],
+  "license": "CC-BY-4.0"
+}
diff --git a/node_modules/mathjs/examples/node_modules/chrome-trace-event/CHANGES.md b/node_modules/mathjs/examples/node_modules/chrome-trace-event/CHANGES.md
new file mode 100644
index 0000000..889d7de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/chrome-trace-event/CHANGES.md
@@ -0,0 +1,26 @@
+# node-trace-event changelog
+
+## 1.3.1 (not yet released)
+
+(nothing yet)
+
+
+## 1.3.0
+
+- Add `.child(<fields>)` option to `trace_event.createBunyanTracer()` object.
+
+
+## 1.2.0
+
+- Add `trace_event.createBunyanLogger()` usage for some sugar. See the
+  README.md for details.
+
+
+## 1.1.0
+
+- Rename to 'trace-event', which is a much more accurate name.
+
+
+## 1.0.0
+
+First release.
diff --git a/node_modules/mathjs/examples/node_modules/chrome-trace-event/LICENSE.txt b/node_modules/mathjs/examples/node_modules/chrome-trace-event/LICENSE.txt
new file mode 100644
index 0000000..427a136
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/chrome-trace-event/LICENSE.txt
@@ -0,0 +1,23 @@
+# This is the MIT license
+
+Copyright (c) 2015 Joyent Inc. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be included
+in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
diff --git a/node_modules/mathjs/examples/node_modules/chrome-trace-event/README.md b/node_modules/mathjs/examples/node_modules/chrome-trace-event/README.md
new file mode 100644
index 0000000..8bd2077
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/chrome-trace-event/README.md
@@ -0,0 +1,31 @@
+[![Build Status](https://travis-ci.org/samccone/chrome-trace-event.svg?branch=master)](https://travis-ci.org/samccone/chrome-trace-event)
+
+chrome-trace-event: A node library for creating trace event logs of program
+execution according to [Google's Trace Event
+format](https://docs.google.com/document/d/1CvAClvFfyA5R-PhYUmn5OOQtYMH4h6I0nSsKchNAySU).
+These logs can then be visualized with
+[trace-viewer](https://github.com/google/trace-viewer) or chrome devtools to grok one's programs.
+
+# Install
+
+    npm install chrome-trace-event
+
+# Usage
+
+```javascript
+const Trace = require("chrome-trace-event").Tracer;
+const trace = new Trace({
+    noStream: true
+});
+trace.pipe(fs.createWriteStream(outPath));
+trace.flush();
+```
+
+# Links
+
+* https://github.com/google/trace-viewer/wiki
+* https://docs.google.com/document/d/1CvAClvFfyA5R-PhYUmn5OOQtYMH4h6I0nSsKchNAySU
+
+# License
+
+MIT. See LICENSE.txt.
diff --git a/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.d.ts b/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.d.ts
new file mode 100644
index 0000000..f68cd37
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.d.ts
@@ -0,0 +1,52 @@
+/**
+ * trace-event - A library to create a trace of your node app per
+ * Google's Trace Event format:
+ * // JSSTYLED
+ *      https://docs.google.com/document/d/1CvAClvFfyA5R-PhYUmn5OOQtYMH4h6I0nSsKchNAySU
+ */
+/// <reference types="node" />
+import { Readable as ReadableStream } from "stream";
+export interface Event {
+    ts: number;
+    pid: number;
+    tid: number;
+    /** event phase */
+    ph?: string;
+    [otherData: string]: any;
+}
+export interface Fields {
+    cat?: any;
+    args?: any;
+    [filedName: string]: any;
+}
+export interface TracerOptions {
+    parent?: Tracer | null;
+    fields?: Fields | null;
+    objectMode?: boolean | null;
+    noStream?: boolean;
+}
+export declare class Tracer extends ReadableStream {
+    private _objectMode;
+    /** Node Stream internal APIs */
+    private _push;
+    private firstPush?;
+    private noStream;
+    private events;
+    private parent;
+    private fields;
+    constructor(opts?: TracerOptions);
+    /**
+     * If in no streamMode in order to flush out the trace
+     * you need to call flush.
+     */
+    flush(): void;
+    _read(_: number): void;
+    private _pushString;
+    private _flush;
+    child(fields: Fields): Tracer;
+    begin(fields: Fields): void;
+    end(fields: Fields): void;
+    completeEvent(fields: Fields): void;
+    instantEvent(fields: Fields): void;
+    mkEventFunc(ph: string): (fields: Fields) => void;
+}
diff --git a/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.js b/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.js
new file mode 100644
index 0000000..d28c03a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.js
@@ -0,0 +1,170 @@
+"use strict";
+/**
+ * trace-event - A library to create a trace of your node app per
+ * Google's Trace Event format:
+ * // JSSTYLED
+ *      https://docs.google.com/document/d/1CvAClvFfyA5R-PhYUmn5OOQtYMH4h6I0nSsKchNAySU
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Tracer = void 0;
+const stream_1 = require("stream");
+function evCommon() {
+    var hrtime = process.hrtime(); // [seconds, nanoseconds]
+    var ts = hrtime[0] * 1000000 + Math.round(hrtime[1] / 1000); // microseconds
+    return {
+        ts,
+        pid: process.pid,
+        tid: process.pid // no meaningful tid for node.js
+    };
+}
+class Tracer extends stream_1.Readable {
+    constructor(opts = {}) {
+        super();
+        this.noStream = false;
+        this.events = [];
+        if (typeof opts !== "object") {
+            throw new Error("Invalid options passed (must be an object)");
+        }
+        if (opts.parent != null && typeof opts.parent !== "object") {
+            throw new Error("Invalid option (parent) passed (must be an object)");
+        }
+        if (opts.fields != null && typeof opts.fields !== "object") {
+            throw new Error("Invalid option (fields) passed (must be an object)");
+        }
+        if (opts.objectMode != null &&
+            (opts.objectMode !== true && opts.objectMode !== false)) {
+            throw new Error("Invalid option (objectsMode) passed (must be a boolean)");
+        }
+        this.noStream = opts.noStream || false;
+        this.parent = opts.parent;
+        if (this.parent) {
+            this.fields = Object.assign({}, opts.parent && opts.parent.fields);
+        }
+        else {
+            this.fields = {};
+        }
+        if (opts.fields) {
+            Object.assign(this.fields, opts.fields);
+        }
+        if (!this.fields.cat) {
+            // trace-viewer *requires* `cat`, so let's have a fallback.
+            this.fields.cat = "default";
+        }
+        else if (Array.isArray(this.fields.cat)) {
+            this.fields.cat = this.fields.cat.join(",");
+        }
+        if (!this.fields.args) {
+            // trace-viewer *requires* `args`, so let's have a fallback.
+            this.fields.args = {};
+        }
+        if (this.parent) {
+            // TODO: Not calling Readable ctor here. Does that cause probs?
+            //      Probably if trying to pipe from the child.
+            //      Might want a serpate TracerChild class for these guys.
+            this._push = this.parent._push.bind(this.parent);
+        }
+        else {
+            this._objectMode = Boolean(opts.objectMode);
+            var streamOpts = { objectMode: this._objectMode };
+            if (this._objectMode) {
+                this._push = this.push;
+            }
+            else {
+                this._push = this._pushString;
+                streamOpts.encoding = "utf8";
+            }
+            stream_1.Readable.call(this, streamOpts);
+        }
+    }
+    /**
+     * If in no streamMode in order to flush out the trace
+     * you need to call flush.
+     */
+    flush() {
+        if (this.noStream === true) {
+            for (const evt of this.events) {
+                this._push(evt);
+            }
+            this._flush();
+        }
+    }
+    _read(_) { }
+    _pushString(ev) {
+        var separator = "";
+        if (!this.firstPush) {
+            this.push("[");
+            this.firstPush = true;
+        }
+        else {
+            separator = ",\n";
+        }
+        this.push(separator + JSON.stringify(ev), "utf8");
+    }
+    _flush() {
+        if (!this._objectMode) {
+            this.push("]");
+        }
+    }
+    child(fields) {
+        return new Tracer({
+            parent: this,
+            fields: fields
+        });
+    }
+    begin(fields) {
+        return this.mkEventFunc("b")(fields);
+    }
+    end(fields) {
+        return this.mkEventFunc("e")(fields);
+    }
+    completeEvent(fields) {
+        return this.mkEventFunc("X")(fields);
+    }
+    instantEvent(fields) {
+        return this.mkEventFunc("I")(fields);
+    }
+    mkEventFunc(ph) {
+        return (fields) => {
+            var ev = evCommon();
+            // Assign the event phase.
+            ev.ph = ph;
+            if (fields) {
+                if (typeof fields === "string") {
+                    ev.name = fields;
+                }
+                else {
+                    for (const k of Object.keys(fields)) {
+                        if (k === "cat") {
+                            ev.cat = fields.cat.join(",");
+                        }
+                        else {
+                            ev[k] = fields[k];
+                        }
+                    }
+                }
+            }
+            if (!this.noStream) {
+                this._push(ev);
+            }
+            else {
+                this.events.push(ev);
+            }
+        };
+    }
+}
+exports.Tracer = Tracer;
+/*
+ * These correspond to the "Async events" in the Trace Events doc.
+ *
+ * Required fields:
+ * - name
+ * - id
+ *
+ * Optional fields:
+ * - cat (array)
+ * - args (object)
+ * - TODO: stack fields, other optional fields?
+ *
+ * Dev Note: We don't explicitly assert that correct fields are
+ * used for speed (premature optimization alert!).
+ */
diff --git a/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.js.map b/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.js.map
new file mode 100644
index 0000000..4e016e4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/chrome-trace-event/dist/trace-event.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"trace-event.js","sourceRoot":"","sources":["../lib/trace-event.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEH,iCAAqE;AAYrE;IACE,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,yBAAyB;IACxD,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,eAAe;IAC5E,OAAO;QACL,EAAE,IAAA;QACF,GAAG,EAAE,OAAO,CAAC,GAAG;QAChB,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,gCAAgC;KAClD,CAAC;AACJ,CAAC;AAiBD;IAA4B,kCAAc;IAUxC,gBAAY,IAAwB;QAAxB,qBAAA,EAAA,SAAwB;QAApC,YACE,iBAAO,SA6DR;QAnEO,cAAQ,GAAY,KAAK,CAAC;QAC1B,YAAM,GAAY,EAAE,CAAC;QAM3B,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;SAC/D;QAED,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE;YAC1D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;SACvE;QAED,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE;YAC1D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;SACvE;QAED,IACE,IAAI,CAAC,UAAU,IAAI,IAAI;YACvB,CAAC,IAAI,CAAC,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,EACvD;YACA,MAAM,IAAI,KAAK,CACb,yDAAyD,CAC1D,CAAC;SACH;QAED,KAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;QACvC,KAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAE1B,IAAI,KAAI,CAAC,MAAM,EAAE;YACf,KAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;SACpE;aAAM;YACL,KAAI,CAAC,MAAM,GAAG,EAAE,CAAC;SAClB;QACD,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,MAAM,CAAC,MAAM,CAAC,KAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACzC;QACD,IAAI,CAAC,KAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpB,2DAA2D;YAC3D,KAAI,CAAC,MAAM,CAAC,GAAG,GAAG,SAAS,CAAC;SAC7B;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;YACzC,KAAI,CAAC,MAAM,CAAC,GAAG,GAAG,KAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAC7C;QACD,IAAI,CAAC,KAAI,CAAC,MAAM,CAAC,IAAI,EAAE;YACrB,4DAA4D;YAC5D,KAAI,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;SACvB;QAED,IAAI,KAAI,CAAC,MAAM,EAAE;YACf,+DAA+D;YAC/D,kDAAkD;YAClD,8DAA8D;YAC9D,KAAI,CAAC,KAAK,GAAG,KAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAI,CAAC,MAAM,CAAC,CAAC;SAClD;aAAM;YACL,KAAI,CAAC,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5C,IAAI,UAAU,GAAoB,EAAE,UAAU,EAAE,KAAI,CAAC,WAAW,EAAE,CAAC;YACnE,IAAI,KAAI,CAAC,WAAW,EAAE;gBACpB,KAAI,CAAC,KAAK,GAAG,KAAI,CAAC,IAAI,CAAC;aACxB;iBAAM;gBACL,KAAI,CAAC,KAAK,GAAG,KAAI,CAAC,WAAW,CAAC;gBAC9B,UAAU,CAAC,QAAQ,GAAG,MAAM,CAAC;aAC9B;YAED,iBAAc,CAAC,IAAI,CAAC,KAAI,EAAE,UAAU,CAAC,CAAC;SACvC;;IACH,CAAC;IAED;;;OAGG;IACI,sBAAK,GAAZ;QACE,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE;YAC1B,KAAkB,UAAW,EAAX,KAAA,IAAI,CAAC,MAAM,EAAX,cAAW,EAAX,IAAW;gBAAxB,IAAM,GAAG,SAAA;gBACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;aACjB;YACD,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IAED,sBAAK,GAAL,UAAM,CAAS,IAAG,CAAC;IAEX,4BAAW,GAAnB,UAAoB,EAAS;QAC3B,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;YACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;SACvB;aAAM;YACL,SAAS,GAAG,KAAK,CAAC;SACnB;QACD,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAEO,uBAAM,GAAd;QACE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;YACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAChB;IACH,CAAC;IAEM,sBAAK,GAAZ,UAAa,MAAc;QACzB,OAAO,IAAI,MAAM,CAAC;YAChB,MAAM,EAAE,IAAI;YACZ,MAAM,EAAE,MAAM;SACf,CAAC,CAAC;IACL,CAAC;IAEM,sBAAK,GAAZ,UAAa,MAAc;QACzB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;IAEM,oBAAG,GAAV,UAAW,MAAc;QACvB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;IAEM,8BAAa,GAApB,UAAqB,MAAc;QACjC,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;IAEM,6BAAY,GAAnB,UAAoB,MAAc;QAChC,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;IAEM,4BAAW,GAAlB,UAAmB,EAAU;QAA7B,iBA0BC;QAzBC,OAAO,UAAC,MAAc;YACpB,IAAI,EAAE,GAAG,QAAQ,EAAE,CAAC;YACpB,0BAA0B;YAC1B,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;YAEX,IAAI,MAAM,EAAE;gBACV,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;oBAC9B,EAAE,CAAC,IAAI,GAAG,MAAM,CAAC;iBAClB;qBAAM;oBACL,KAAgB,UAAmB,EAAnB,KAAA,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAnB,cAAmB,EAAnB,IAAmB;wBAA9B,IAAM,CAAC,SAAA;wBACV,IAAI,CAAC,KAAK,KAAK,EAAE;4BACf,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBAC/B;6BAAM;4BACL,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;yBACnB;qBACF;iBACF;aACF;YAED,IAAI,CAAC,KAAI,CAAC,QAAQ,EAAE;gBAClB,KAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;aAChB;iBAAM;gBACL,KAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACtB;QACH,CAAC,CAAC;IACJ,CAAC;IACH,aAAC;AAAD,CAAC,AA5JD,CAA4B,iBAAc,GA4JzC;AA5JY,wBAAM;AA8JnB;;;;;;;;;;;;;;GAcG"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/chrome-trace-event/package.json b/node_modules/mathjs/examples/node_modules/chrome-trace-event/package.json
new file mode 100644
index 0000000..40f95f1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/chrome-trace-event/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "chrome-trace-event",
+  "description": "A library to create a trace of your node app per Google's Trace Event format.",
+  "license": "MIT",
+  "version": "1.0.3",
+  "author": "Trent Mick, Sam Saccone",
+  "keywords": [
+    "trace-event",
+    "trace",
+    "event",
+    "trace-viewer",
+    "google"
+  ],
+  "repository": {
+    "url": "github:samccone/chrome-trace-event"
+  },
+  "main": "./dist/trace-event.js",
+  "typings": "./dist/trace-event.d.ts",
+  "dependencies": {},
+  "devDependencies": {
+    "@types/node": "*",
+    "prettier": "^1.12.1",
+    "tape": "4.8.0",
+    "typescript": "^4.2.4"
+  },
+  "engines": {
+    "node": ">=6.0"
+  },
+  "files": [
+    "dist",
+    "CHANGES.md"
+  ],
+  "scripts": {
+    "build": "tsc",
+    "check_format": "prettier -l lib/** test/** examples/**",
+    "test": "tape test/*.test.js"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/clone-deep/LICENSE b/node_modules/mathjs/examples/node_modules/clone-deep/LICENSE
new file mode 100644
index 0000000..d32ab44
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/clone-deep/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2018, Jon Schlinkert.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/clone-deep/README.md b/node_modules/mathjs/examples/node_modules/clone-deep/README.md
new file mode 100644
index 0000000..943a435
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/clone-deep/README.md
@@ -0,0 +1,106 @@
+# clone-deep [![NPM version](https://img.shields.io/npm/v/clone-deep.svg?style=flat)](https://www.npmjs.com/package/clone-deep) [![NPM monthly downloads](https://img.shields.io/npm/dm/clone-deep.svg?style=flat)](https://npmjs.org/package/clone-deep) [![NPM total downloads](https://img.shields.io/npm/dt/clone-deep.svg?style=flat)](https://npmjs.org/package/clone-deep) [![Linux Build Status](https://img.shields.io/travis/jonschlinkert/clone-deep.svg?style=flat&label=Travis)](https://travis-ci.org/jonschlinkert/clone-deep)
+
+> Recursively (deep) clone JavaScript native types, like Object, Array, RegExp, Date as well as primitives.
+
+Please consider following this project's author, [Jon Schlinkert](https://github.com/jonschlinkert), and consider starring the project to show your :heart: and support.
+
+## Install
+
+Install with [npm](https://www.npmjs.com/):
+
+```sh
+$ npm install --save clone-deep
+```
+
+## Usage
+
+```js
+const cloneDeep = require('clone-deep');
+
+let obj = { a: 'b' };
+let arr = [obj];
+let copy = cloneDeep(arr);
+obj.c = 'd';
+
+console.log(copy);
+//=> [{ a: 'b' }]
+
+console.log(arr);
+//=> [{ a: 'b', c: 'd' }]
+```
+
+## Heads up!
+
+The last argument specifies whether or not to clone instances (objects that are from a custom class or are not created by the `Object` constructor. This value may be `true` or the function use for cloning instances.
+
+When an `instanceClone` function is provided, it will be invoked to clone objects that are not "plain" objects (as defined by [isPlainObject](#isPlainObject)`isPlainObject`). If `instanceClone` is not specified, this library will not attempt to clone non-plain objects, and will simply copy the object reference.
+
+## Attribution
+
+Initially based on [mout's](https://github.com/mout/mout) implementation of deepClone.
+
+## About
+
+<details>
+<summary><strong>Contributing</strong></summary>
+
+Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
+
+</details>
+
+<details>
+<summary><strong>Running Tests</strong></summary>
+
+Running and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command:
+
+```sh
+$ npm install && npm test
+```
+
+</details>
+
+<details>
+<summary><strong>Building docs</strong></summary>
+
+_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_
+
+To generate the readme, run the following command:
+
+```sh
+$ npm install -g verbose/verb#dev verb-generate-readme && verb
+```
+
+</details>
+
+### Related projects
+
+You might also be interested in these projects:
+
+* [is-plain-object](https://www.npmjs.com/package/is-plain-object): Returns true if an object was created by the `Object` constructor. | [homepage](https://github.com/jonschlinkert/is-plain-object "Returns true if an object was created by the `Object` constructor.")
+* [isobject](https://www.npmjs.com/package/isobject): Returns true if the value is an object and not an array or null. | [homepage](https://github.com/jonschlinkert/isobject "Returns true if the value is an object and not an array or null.")
+* [kind-of](https://www.npmjs.com/package/kind-of): Get the native type of a value. | [homepage](https://github.com/jonschlinkert/kind-of "Get the native type of a value.")
+* [shallow-clone](https://www.npmjs.com/package/shallow-clone): Creates a shallow clone of any JavaScript value. | [homepage](https://github.com/jonschlinkert/shallow-clone "Creates a shallow clone of any JavaScript value.")
+
+### Contributors
+
+| **Commits** | **Contributor** |  
+| --- | --- |  
+| 46 | [jonschlinkert](https://github.com/jonschlinkert) |  
+| 2  | [yujunlong2000](https://github.com/yujunlong2000) |  
+
+### Author
+
+**Jon Schlinkert**
+
+* [GitHub Profile](https://github.com/jonschlinkert)
+* [Twitter Profile](https://twitter.com/jonschlinkert)
+* [LinkedIn Profile](https://linkedin.com/in/jonschlinkert)
+
+### License
+
+Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
+Released under the [MIT License](LICENSE).
+
+***
+
+_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.8.0, on November 21, 2018._
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/clone-deep/index.js b/node_modules/mathjs/examples/node_modules/clone-deep/index.js
new file mode 100644
index 0000000..9133c08
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/clone-deep/index.js
@@ -0,0 +1,49 @@
+'use strict';
+
+/**
+ * Module dependenices
+ */
+
+const clone = require('shallow-clone');
+const typeOf = require('kind-of');
+const isPlainObject = require('is-plain-object');
+
+function cloneDeep(val, instanceClone) {
+  switch (typeOf(val)) {
+    case 'object':
+      return cloneObjectDeep(val, instanceClone);
+    case 'array':
+      return cloneArrayDeep(val, instanceClone);
+    default: {
+      return clone(val);
+    }
+  }
+}
+
+function cloneObjectDeep(val, instanceClone) {
+  if (typeof instanceClone === 'function') {
+    return instanceClone(val);
+  }
+  if (instanceClone || isPlainObject(val)) {
+    const res = new val.constructor();
+    for (let key in val) {
+      res[key] = cloneDeep(val[key], instanceClone);
+    }
+    return res;
+  }
+  return val;
+}
+
+function cloneArrayDeep(val, instanceClone) {
+  const res = new val.constructor(val.length);
+  for (let i = 0; i < val.length; i++) {
+    res[i] = cloneDeep(val[i], instanceClone);
+  }
+  return res;
+}
+
+/**
+ * Expose `cloneDeep`
+ */
+
+module.exports = cloneDeep;
diff --git a/node_modules/mathjs/examples/node_modules/clone-deep/package.json b/node_modules/mathjs/examples/node_modules/clone-deep/package.json
new file mode 100644
index 0000000..7b494ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/clone-deep/package.json
@@ -0,0 +1,81 @@
+{
+  "name": "clone-deep",
+  "description": "Recursively (deep) clone JavaScript native types, like Object, Array, RegExp, Date as well as primitives.",
+  "version": "4.0.1",
+  "homepage": "https://github.com/jonschlinkert/clone-deep",
+  "author": "Jon Schlinkert (https://github.com/jonschlinkert)",
+  "repository": "jonschlinkert/clone-deep",
+  "bugs": {
+    "url": "https://github.com/jonschlinkert/clone-deep/issues"
+  },
+  "license": "MIT",
+  "files": [
+    "index.js"
+  ],
+  "main": "index.js",
+  "engines": {
+    "node": ">=6"
+  },
+  "scripts": {
+    "test": "mocha"
+  },
+  "dependencies": {
+    "is-plain-object": "^2.0.4",
+    "kind-of": "^6.0.2",
+    "shallow-clone": "^3.0.0"
+  },
+  "devDependencies": {
+    "gulp-format-md": "^2.0.0",
+    "mocha": "^5.2.0"
+  },
+  "keywords": [
+    "array",
+    "assign",
+    "buffer",
+    "clamped",
+    "clone",
+    "clone-array",
+    "clone-array-deep",
+    "clone-buffer",
+    "clone-date",
+    "clone-deep",
+    "clone-map",
+    "clone-object",
+    "clone-object-deep",
+    "clone-reg-exp",
+    "clone-regex",
+    "clone-regexp",
+    "clone-set",
+    "date",
+    "deep",
+    "extend",
+    "mixin",
+    "mixin-object",
+    "object",
+    "regex",
+    "regexp",
+    "shallow",
+    "symbol"
+  ],
+  "verb": {
+    "toc": false,
+    "layout": "default",
+    "tasks": [
+      "readme"
+    ],
+    "plugins": [
+      "gulp-format-md"
+    ],
+    "related": {
+      "list": [
+        "is-plain-object",
+        "isobject",
+        "kind-of",
+        "shallow-clone"
+      ]
+    },
+    "lint": {
+      "reflinks": true
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/colorette/LICENSE.md b/node_modules/mathjs/examples/node_modules/colorette/LICENSE.md
new file mode 100644
index 0000000..6ba7a0f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/colorette/LICENSE.md
@@ -0,0 +1,7 @@
+Copyright © Jorge Bucaran <<https://jorgebucaran.com>>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/colorette/README.md b/node_modules/mathjs/examples/node_modules/colorette/README.md
new file mode 100644
index 0000000..c2498a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/colorette/README.md
@@ -0,0 +1,134 @@
+# 🌈Colorette
+
+> Easily set your terminal text color & styles.
+
+- No dependecies
+- Automatic color support detection
+- Up to [2x faster](#benchmarks) than alternatives
+- TypeScript support
+- [`NO_COLOR`](https://no-color.org) friendly
+- Node >= `10`
+
+> [**Upgrading from Colorette `1.x`?**](https://github.com/jorgebucaran/colorette/issues/70)
+
+## Quickstart
+
+```js
+import { blue, bold, underline } from "colorette"
+
+console.log(
+  blue("I'm blue"),
+  bold(blue("da ba dee")),
+  underline(bold(blue("da ba daa")))
+)
+```
+
+Here's an example using [template literals](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Template_literals).
+
+```js
+console.log(`
+  There's a ${underline(blue("house"))},
+  With a ${bold(blue("window"))},
+  And a ${blue("corvette")}
+  And everything is blue
+`)
+```
+
+You can also nest styles without breaking existing color sequences.
+
+```js
+console.log(bold(`I'm ${blue(`da ba ${underline("dee")} da ba`)} daa`))
+```
+
+Need to override terminal color detection? You can do that too.
+
+```js
+import { createColors } from "colorette"
+
+const { blue } = createColors({ useColor: false })
+
+console.log(blue("Blue? Nope, nah"))
+```
+
+## Installation
+
+```console
+npm install colorette
+```
+
+## API
+
+### \<color\>()
+
+> See all [supported colors](#supported-colors).
+
+```js
+import { blue } from "colorette"
+
+blue("I'm blue") //=> \x1b[34mI'm blue\x1b[39m
+```
+
+### createColors()
+
+Override terminal color detection via `createColors({ useColor })`.
+
+```js
+import { createColors } from "colorette"
+
+const { blue } = createColors({ useColor: false })
+```
+
+### isColorSupported
+
+`true` if your terminal supports color, `false` otherwise. Used internally, but exposed for convenience.
+
+## Environment
+
+You can override color detection from the CLI by setting the `--no-color` or `--color` flags.
+
+```console
+$ ./example.js --no-color | ./consumer.js
+```
+
+Or if you can't use CLI flags, by setting the `NO_COLOR=` or `FORCE_COLOR=` environment variables.
+
+```console
+$ NO_COLOR= ./example.js | ./consumer.js
+```
+
+## Supported colors
+
+| Colors  | Background Colors | Bright Colors | Bright Background Colors | Modifiers         |
+| ------- | ----------------- | ------------- | ------------------------ | ----------------- |
+| black   | bgBlack           | blackBright   | bgBlackBright            | dim               |
+| red     | bgRed             | redBright     | bgRedBright              | **bold**          |
+| green   | bgGreen           | greenBright   | bgGreenBright            | hidden            |
+| yellow  | bgYellow          | yellowBright  | bgYellowBright           | _italic_          |
+| blue    | bgBlue            | blueBright    | bgBlueBright             | <u>underline</u>  |
+| magenta | bgMagenta         | magentaBright | bgMagentaBright          | ~~strikethrough~~ |
+| cyan    | bgCyan            | cyanBright    | bgCyanBright             | reset             |
+| white   | bgWhite           | whiteBright   | bgWhiteBright            |                   |
+| gray    |                   |               |                          |                   |
+
+## [Benchmarks](https://github.com/jorgebucaran/colorette/actions/workflows/bench.yml)
+
+```console
+npm --prefix bench start
+```
+
+```diff
+  chalk         1,786,703 ops/sec
+  kleur         1,618,960 ops/sec
+  colors          646,823 ops/sec
+  ansi-colors     786,149 ops/sec
+  picocolors    2,871,758 ops/sec
++ colorette     3,002,751 ops/sec
+```
+
+## Acknowledgements
+
+Colorette started out in 2015 by [@jorgebucaran](https://github.com/jorgebucaran) as a lightweight alternative to [Chalk](https://github.com/chalk/chalk) and was introduced originally as [Clor](https://github.com/jorgebucaran/colorette/commit/b01b5b9961ceb7df878583a3002e836fae9e37ce). Our terminal color detection logic borrows heavily from [@sindresorhus](https://github.com/sindresorhus) and [@Qix-](https://github.com/Qix-) work on Chalk. The idea of slicing strings to clear bleeding sequences was adapted from a similar technique used by [@alexeyraspopov](https://github.com/alexeyraspopov) in [picocolors](https://github.com/alexeyraspopov/picocolors). Thank you to all our contributors! <3
+
+## License
+
+[MIT](LICENSE.md)
diff --git a/node_modules/mathjs/examples/node_modules/colorette/index.cjs b/node_modules/mathjs/examples/node_modules/colorette/index.cjs
new file mode 100644
index 0000000..05dafea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/colorette/index.cjs
@@ -0,0 +1,215 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var tty = require('tty');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n["default"] = e;
+  return Object.freeze(n);
+}
+
+var tty__namespace = /*#__PURE__*/_interopNamespace(tty);
+
+const env = process.env || {};
+const argv = process.argv || [];
+
+const isDisabled = "NO_COLOR" in env || argv.includes("--no-color");
+const isForced = "FORCE_COLOR" in env || argv.includes("--color");
+const isWindows = process.platform === "win32";
+
+const isCompatibleTerminal =
+  tty__namespace && tty__namespace.isatty && tty__namespace.isatty(1) && env.TERM && env.TERM !== "dumb";
+
+const isCI =
+  "CI" in env &&
+  ("GITHUB_ACTIONS" in env || "GITLAB_CI" in env || "CIRCLECI" in env);
+
+const isColorSupported =
+  !isDisabled && (isForced || isWindows || isCompatibleTerminal || isCI);
+
+const replaceClose = (
+  index,
+  string,
+  close,
+  replace,
+  head = string.substring(0, index) + replace,
+  tail = string.substring(index + close.length),
+  next = tail.indexOf(close)
+) => head + (next < 0 ? tail : replaceClose(next, tail, close, replace));
+
+const clearBleed = (index, string, open, close, replace) =>
+  index < 0
+    ? open + string + close
+    : open + replaceClose(index, string, close, replace) + close;
+
+const filterEmpty =
+  (open, close, replace = open, at = open.length + 1) =>
+  (string) =>
+    string || !(string === "" || string === undefined)
+      ? clearBleed(
+          ("" + string).indexOf(close, at),
+          string,
+          open,
+          close,
+          replace
+        )
+      : "";
+
+const init = (open, close, replace) =>
+  filterEmpty(`\x1b[${open}m`, `\x1b[${close}m`, replace);
+
+const colors = {
+  reset: init(0, 0),
+  bold: init(1, 22, "\x1b[22m\x1b[1m"),
+  dim: init(2, 22, "\x1b[22m\x1b[2m"),
+  italic: init(3, 23),
+  underline: init(4, 24),
+  inverse: init(7, 27),
+  hidden: init(8, 28),
+  strikethrough: init(9, 29),
+  black: init(30, 39),
+  red: init(31, 39),
+  green: init(32, 39),
+  yellow: init(33, 39),
+  blue: init(34, 39),
+  magenta: init(35, 39),
+  cyan: init(36, 39),
+  white: init(37, 39),
+  gray: init(90, 39),
+  bgBlack: init(40, 49),
+  bgRed: init(41, 49),
+  bgGreen: init(42, 49),
+  bgYellow: init(43, 49),
+  bgBlue: init(44, 49),
+  bgMagenta: init(45, 49),
+  bgCyan: init(46, 49),
+  bgWhite: init(47, 49),
+  blackBright: init(90, 39),
+  redBright: init(91, 39),
+  greenBright: init(92, 39),
+  yellowBright: init(93, 39),
+  blueBright: init(94, 39),
+  magentaBright: init(95, 39),
+  cyanBright: init(96, 39),
+  whiteBright: init(97, 39),
+  bgBlackBright: init(100, 49),
+  bgRedBright: init(101, 49),
+  bgGreenBright: init(102, 49),
+  bgYellowBright: init(103, 49),
+  bgBlueBright: init(104, 49),
+  bgMagentaBright: init(105, 49),
+  bgCyanBright: init(106, 49),
+  bgWhiteBright: init(107, 49),
+};
+
+const none = (any) => any;
+
+const createColors = ({ useColor = isColorSupported } = {}) =>
+  useColor
+    ? colors
+    : Object.keys(colors).reduce(
+        (colors, key) => ({ ...colors, [key]: none }),
+        {}
+      );
+
+const {
+  reset,
+  bold,
+  dim,
+  italic,
+  underline,
+  inverse,
+  hidden,
+  strikethrough,
+  black,
+  red,
+  green,
+  yellow,
+  blue,
+  magenta,
+  cyan,
+  white,
+  gray,
+  bgBlack,
+  bgRed,
+  bgGreen,
+  bgYellow,
+  bgBlue,
+  bgMagenta,
+  bgCyan,
+  bgWhite,
+  blackBright,
+  redBright,
+  greenBright,
+  yellowBright,
+  blueBright,
+  magentaBright,
+  cyanBright,
+  whiteBright,
+  bgBlackBright,
+  bgRedBright,
+  bgGreenBright,
+  bgYellowBright,
+  bgBlueBright,
+  bgMagentaBright,
+  bgCyanBright,
+  bgWhiteBright,
+} = createColors();
+
+exports.bgBlack = bgBlack;
+exports.bgBlackBright = bgBlackBright;
+exports.bgBlue = bgBlue;
+exports.bgBlueBright = bgBlueBright;
+exports.bgCyan = bgCyan;
+exports.bgCyanBright = bgCyanBright;
+exports.bgGreen = bgGreen;
+exports.bgGreenBright = bgGreenBright;
+exports.bgMagenta = bgMagenta;
+exports.bgMagentaBright = bgMagentaBright;
+exports.bgRed = bgRed;
+exports.bgRedBright = bgRedBright;
+exports.bgWhite = bgWhite;
+exports.bgWhiteBright = bgWhiteBright;
+exports.bgYellow = bgYellow;
+exports.bgYellowBright = bgYellowBright;
+exports.black = black;
+exports.blackBright = blackBright;
+exports.blue = blue;
+exports.blueBright = blueBright;
+exports.bold = bold;
+exports.createColors = createColors;
+exports.cyan = cyan;
+exports.cyanBright = cyanBright;
+exports.dim = dim;
+exports.gray = gray;
+exports.green = green;
+exports.greenBright = greenBright;
+exports.hidden = hidden;
+exports.inverse = inverse;
+exports.isColorSupported = isColorSupported;
+exports.italic = italic;
+exports.magenta = magenta;
+exports.magentaBright = magentaBright;
+exports.red = red;
+exports.redBright = redBright;
+exports.reset = reset;
+exports.strikethrough = strikethrough;
+exports.underline = underline;
+exports.white = white;
+exports.whiteBright = whiteBright;
+exports.yellow = yellow;
+exports.yellowBright = yellowBright;
diff --git a/node_modules/mathjs/examples/node_modules/colorette/index.d.ts b/node_modules/mathjs/examples/node_modules/colorette/index.d.ts
new file mode 100644
index 0000000..ba32c9f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/colorette/index.d.ts
@@ -0,0 +1,93 @@
+declare module "colorette" {
+  type Color = (text: string | number) => string
+
+  interface Colorette {
+    reset: Color
+    bold: Color
+    dim: Color
+    italic: Color
+    underline: Color
+    inverse: Color
+    hidden: Color
+    strikethrough: Color
+    black: Color
+    red: Color
+    green: Color
+    yellow: Color
+    blue: Color
+    magenta: Color
+    cyan: Color
+    white: Color
+    gray: Color
+    bgBlack: Color
+    bgRed: Color
+    bgGreen: Color
+    bgYellow: Color
+    bgBlue: Color
+    bgMagenta: Color
+    bgCyan: Color
+    bgWhite: Color
+    blackBright: Color
+    redBright: Color
+    greenBright: Color
+    yellowBright: Color
+    blueBright: Color
+    magentaBright: Color
+    cyanBright: Color
+    whiteBright: Color
+    bgBlackBright: Color
+    bgRedBright: Color
+    bgGreenBright: Color
+    bgYellowBright: Color
+    bgBlueBright: Color
+    bgMagentaBright: Color
+    bgCyanBright: Color
+    bgWhiteBright: Color
+  }
+
+  const reset: Color
+  const bold: Color
+  const dim: Color
+  const italic: Color
+  const underline: Color
+  const inverse: Color
+  const hidden: Color
+  const strikethrough: Color
+  const black: Color
+  const red: Color
+  const green: Color
+  const yellow: Color
+  const blue: Color
+  const magenta: Color
+  const cyan: Color
+  const white: Color
+  const gray: Color
+  const bgBlack: Color
+  const bgRed: Color
+  const bgGreen: Color
+  const bgYellow: Color
+  const bgBlue: Color
+  const bgMagenta: Color
+  const bgCyan: Color
+  const bgWhite: Color
+  const blackBright: Color
+  const redBright: Color
+  const greenBright: Color
+  const yellowBright: Color
+  const blueBright: Color
+  const magentaBright: Color
+  const cyanBright: Color
+  const whiteBright: Color
+  const bgBlackBright: Color
+  const bgRedBright: Color
+  const bgGreenBright: Color
+  const bgYellowBright: Color
+  const bgBlueBright: Color
+  const bgMagentaBright: Color
+  const bgCyanBright: Color
+  const bgWhiteBright: Color
+
+  const isColorSupported: boolean
+
+  function createColors(options?: { useColor: boolean }): Colorette
+}
diff --git a/node_modules/mathjs/examples/node_modules/colorette/index.js b/node_modules/mathjs/examples/node_modules/colorette/index.js
new file mode 100644
index 0000000..2e16e25
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/colorette/index.js
@@ -0,0 +1,147 @@
+import * as tty from "tty"
+
+const env = process.env || {}
+const argv = process.argv || []
+
+const isDisabled = "NO_COLOR" in env || argv.includes("--no-color")
+const isForced = "FORCE_COLOR" in env || argv.includes("--color")
+const isWindows = process.platform === "win32"
+
+const isCompatibleTerminal =
+  tty && tty.isatty && tty.isatty(1) && env.TERM && env.TERM !== "dumb"
+
+const isCI =
+  "CI" in env &&
+  ("GITHUB_ACTIONS" in env || "GITLAB_CI" in env || "CIRCLECI" in env)
+
+export const isColorSupported =
+  !isDisabled && (isForced || isWindows || isCompatibleTerminal || isCI)
+
+const replaceClose = (
+  index,
+  string,
+  close,
+  replace,
+  head = string.substring(0, index) + replace,
+  tail = string.substring(index + close.length),
+  next = tail.indexOf(close)
+) => head + (next < 0 ? tail : replaceClose(next, tail, close, replace))
+
+const clearBleed = (index, string, open, close, replace) =>
+  index < 0
+    ? open + string + close
+    : open + replaceClose(index, string, close, replace) + close
+
+const filterEmpty =
+  (open, close, replace = open, at = open.length + 1) =>
+  (string) =>
+    string || !(string === "" || string === undefined)
+      ? clearBleed(
+          ("" + string).indexOf(close, at),
+          string,
+          open,
+          close,
+          replace
+        )
+      : ""
+
+const init = (open, close, replace) =>
+  filterEmpty(`\x1b[${open}m`, `\x1b[${close}m`, replace)
+
+const colors = {
+  reset: init(0, 0),
+  bold: init(1, 22, "\x1b[22m\x1b[1m"),
+  dim: init(2, 22, "\x1b[22m\x1b[2m"),
+  italic: init(3, 23),
+  underline: init(4, 24),
+  inverse: init(7, 27),
+  hidden: init(8, 28),
+  strikethrough: init(9, 29),
+  black: init(30, 39),
+  red: init(31, 39),
+  green: init(32, 39),
+  yellow: init(33, 39),
+  blue: init(34, 39),
+  magenta: init(35, 39),
+  cyan: init(36, 39),
+  white: init(37, 39),
+  gray: init(90, 39),
+  bgBlack: init(40, 49),
+  bgRed: init(41, 49),
+  bgGreen: init(42, 49),
+  bgYellow: init(43, 49),
+  bgBlue: init(44, 49),
+  bgMagenta: init(45, 49),
+  bgCyan: init(46, 49),
+  bgWhite: init(47, 49),
+  blackBright: init(90, 39),
+  redBright: init(91, 39),
+  greenBright: init(92, 39),
+  yellowBright: init(93, 39),
+  blueBright: init(94, 39),
+  magentaBright: init(95, 39),
+  cyanBright: init(96, 39),
+  whiteBright: init(97, 39),
+  bgBlackBright: init(100, 49),
+  bgRedBright: init(101, 49),
+  bgGreenBright: init(102, 49),
+  bgYellowBright: init(103, 49),
+  bgBlueBright: init(104, 49),
+  bgMagentaBright: init(105, 49),
+  bgCyanBright: init(106, 49),
+  bgWhiteBright: init(107, 49),
+}
+
+const none = (any) => any
+
+export const createColors = ({ useColor = isColorSupported } = {}) =>
+  useColor
+    ? colors
+    : Object.keys(colors).reduce(
+        (colors, key) => ({ ...colors, [key]: none }),
+        {}
+      )
+
+export const {
+  reset,
+  bold,
+  dim,
+  italic,
+  underline,
+  inverse,
+  hidden,
+  strikethrough,
+  black,
+  red,
+  green,
+  yellow,
+  blue,
+  magenta,
+  cyan,
+  white,
+  gray,
+  bgBlack,
+  bgRed,
+  bgGreen,
+  bgYellow,
+  bgBlue,
+  bgMagenta,
+  bgCyan,
+  bgWhite,
+  blackBright,
+  redBright,
+  greenBright,
+  yellowBright,
+  blueBright,
+  magentaBright,
+  cyanBright,
+  whiteBright,
+  bgBlackBright,
+  bgRedBright,
+  bgGreenBright,
+  bgYellowBright,
+  bgBlueBright,
+  bgMagentaBright,
+  bgCyanBright,
+  bgWhiteBright,
+} = createColors()
diff --git a/node_modules/mathjs/examples/node_modules/colorette/package.json b/node_modules/mathjs/examples/node_modules/colorette/package.json
new file mode 100644
index 0000000..9848e04
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/colorette/package.json
@@ -0,0 +1,39 @@
+{
+  "name": "colorette",
+  "version": "2.0.16",
+  "type": "module",
+  "main": "index.cjs",
+  "module": "index.js",
+  "types": "index.d.ts",
+  "description": "🌈Easily set your terminal text color & styles.",
+  "repository": "jorgebucaran/colorette",
+  "license": "MIT",
+  "exports": {
+    "./package.json": "./package.json",
+    ".": {
+      "require": "./index.cjs",
+      "import": "./index.js"
+    }
+  },
+  "files": [
+    "*.*(c)[tj]s*"
+  ],
+  "author": "Jorge Bucaran",
+  "keywords": [
+    "terminal",
+    "styles",
+    "color",
+    "ansi"
+  ],
+  "scripts": {
+    "test": "c8 twist tests/*.js",
+    "build": "npx rollup --format cjs --input index.js --file index.cjs",
+    "deploy": "npm test && git commit --all --message $tag && git tag --sign $tag --message $tag && git push && git push --tags",
+    "release": "tag=$npm_package_version npm run deploy && npm publish --access public",
+    "prepare": "npm run build"
+  },
+  "devDependencies": {
+    "c8": "*",
+    "twist": "*"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/commander/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/commander/CHANGELOG.md
new file mode 100644
index 0000000..7dce779
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/commander/CHANGELOG.md
@@ -0,0 +1,419 @@
+2.20.3 / 2019-10-11
+==================
+
+  * Support Node.js 0.10 (Revert #1059)
+  * Ran "npm unpublish commander@2.20.2". There is no 2.20.2.
+
+2.20.1 / 2019-09-29
+==================
+
+  * Improve executable subcommand tracking
+  * Update dev dependencies
+
+2.20.0 / 2019-04-02
+==================
+
+  * fix: resolve symbolic links completely when hunting for subcommands (#935)
+  * Update index.d.ts (#930)
+  * Update Readme.md (#924)
+  * Remove --save option as it isn't required anymore (#918)
+  * Add link to the license file (#900)
+  * Added example of receiving args from options (#858)
+  * Added missing semicolon (#882)
+  * Add extension to .eslintrc (#876)
+
+2.19.0 / 2018-10-02
+==================
+
+  * Removed newline after Options and Commands headers (#864)
+  * Bugfix - Error output (#862)
+  * Fix to change default value to string (#856)
+
+2.18.0 / 2018-09-07
+==================
+
+  * Standardize help output (#853)
+  * chmod 644 travis.yml (#851)
+  * add support for execute typescript subcommand via ts-node (#849)
+
+2.17.1 / 2018-08-07
+==================
+
+  * Fix bug in command emit (#844)
+
+2.17.0 / 2018-08-03
+==================
+
+  * fixed newline output after help information (#833)
+  * Fix to emit the action even without command (#778)
+  * npm update (#823)
+
+2.16.0 / 2018-06-29
+==================
+
+  * Remove Makefile and `test/run` (#821)
+  * Make 'npm test' run on Windows (#820)
+  * Add badge to display install size (#807)
+  * chore: cache node_modules (#814)
+  * chore: remove Node.js 4 (EOL), add Node.js 10 (#813)
+  * fixed typo in readme (#812)
+  * Fix types (#804)
+  * Update eslint to resolve vulnerabilities in lodash (#799)
+  * updated readme with custom event listeners. (#791)
+  * fix tests (#794)
+
+2.15.0 / 2018-03-07
+==================
+
+  * Update downloads badge to point to graph of downloads over time instead of duplicating link to npm
+  * Arguments description
+
+2.14.1 / 2018-02-07
+==================
+
+  * Fix typing of help function
+
+2.14.0 / 2018-02-05
+==================
+
+  * only register the option:version event once
+  * Fixes issue #727: Passing empty string for option on command is set to undefined
+  * enable eqeqeq rule
+  * resolves #754 add linter configuration to project
+  * resolves #560 respect custom name for version option
+  * document how to override the version flag
+  * document using options per command
+
+2.13.0 / 2018-01-09
+==================
+
+  * Do not print default for --no-
+  * remove trailing spaces in command help
+  * Update CI's Node.js to LTS and latest version
+  * typedefs: Command and Option types added to commander namespace
+
+2.12.2 / 2017-11-28
+==================
+
+  * fix: typings are not shipped
+
+2.12.1 / 2017-11-23
+==================
+
+  * Move @types/node to dev dependency
+
+2.12.0 / 2017-11-22
+==================
+
+  * add attributeName() method to Option objects
+  * Documentation updated for options with --no prefix
+  * typings: `outputHelp` takes a string as the first parameter
+  * typings: use overloads
+  * feat(typings): update to match js api
+  * Print default value in option help
+  * Fix translation error
+  * Fail when using same command and alias (#491)
+  * feat(typings): add help callback
+  * fix bug when description is add after command with options (#662)
+  * Format js code
+  * Rename History.md to CHANGELOG.md (#668)
+  * feat(typings): add typings to support TypeScript (#646)
+  * use current node
+
+2.11.0 / 2017-07-03
+==================
+
+  * Fix help section order and padding (#652)
+  * feature: support for signals to subcommands (#632)
+  * Fixed #37, --help should not display first (#447)
+  * Fix translation errors. (#570)
+  * Add package-lock.json
+  * Remove engines
+  * Upgrade package version
+  * Prefix events to prevent conflicts between commands and options (#494)
+  * Removing dependency on graceful-readlink
+  * Support setting name in #name function and make it chainable
+  * Add .vscode directory to .gitignore (Visual Studio Code metadata)
+  * Updated link to ruby commander in readme files
+
+2.10.0 / 2017-06-19
+==================
+
+  * Update .travis.yml. drop support for older node.js versions.
+  * Fix require arguments in README.md
+  * On SemVer you do not start from 0.0.1
+  * Add missing semi colon in readme
+  * Add save param to npm install
+  * node v6 travis test
+  * Update Readme_zh-CN.md
+  * Allow literal '--' to be passed-through as an argument
+  * Test subcommand alias help
+  * link build badge to master branch
+  * Support the alias of Git style sub-command
+  * added keyword commander for better search result on npm
+  * Fix Sub-Subcommands
+  * test node.js stable
+  * Fixes TypeError when a command has an option called `--description`
+  * Update README.md to make it beginner friendly and elaborate on the difference between angled and square brackets.
+  * Add chinese Readme file
+
+2.9.0 / 2015-10-13
+==================
+
+  * Add option `isDefault` to set default subcommand #415 @Qix-
+  * Add callback to allow filtering or post-processing of help text #434 @djulien
+  * Fix `undefined` text in help information close #414 #416 @zhiyelee
+
+2.8.1 / 2015-04-22
+==================
+
+ * Back out `support multiline description` Close #396 #397
+
+2.8.0 / 2015-04-07
+==================
+
+  * Add `process.execArg` support, execution args like `--harmony` will be passed to sub-commands #387 @DigitalIO @zhiyelee
+  * Fix bug in Git-style sub-commands #372 @zhiyelee
+  * Allow commands to be hidden from help #383 @tonylukasavage
+  * When git-style sub-commands are in use, yet none are called, display help #382 @claylo
+  * Add ability to specify arguments syntax for top-level command #258 @rrthomas
+  * Support multiline descriptions #208 @zxqfox
+
+2.7.1 / 2015-03-11
+==================
+
+ * Revert #347 (fix collisions when option and first arg have same name) which causes a bug in #367.
+
+2.7.0 / 2015-03-09
+==================
+
+ * Fix git-style bug when installed globally. Close #335 #349 @zhiyelee
+ * Fix collisions when option and first arg have same name. Close #346 #347 @tonylukasavage
+ * Add support for camelCase on `opts()`. Close #353  @nkzawa
+ * Add node.js 0.12 and io.js to travis.yml
+ * Allow RegEx options. #337 @palanik
+ * Fixes exit code when sub-command failing.  Close #260 #332 @pirelenito
+ * git-style `bin` files in $PATH make sense. Close #196 #327  @zhiyelee
+
+2.6.0 / 2014-12-30
+==================
+
+  * added `Command#allowUnknownOption` method. Close #138 #318 @doozr @zhiyelee
+  * Add application description to the help msg. Close #112 @dalssoft
+
+2.5.1 / 2014-12-15
+==================
+
+  * fixed two bugs incurred by variadic arguments. Close #291 @Quentin01 #302 @zhiyelee
+
+2.5.0 / 2014-10-24
+==================
+
+ * add support for variadic arguments. Closes #277 @whitlockjc
+
+2.4.0 / 2014-10-17
+==================
+
+ * fixed a bug on executing the coercion function of subcommands option. Closes #270
+ * added `Command.prototype.name` to retrieve command name. Closes #264 #266 @tonylukasavage
+ * added `Command.prototype.opts` to retrieve all the options as a simple object of key-value pairs. Closes #262 @tonylukasavage
+ * fixed a bug on subcommand name. Closes #248 @jonathandelgado
+ * fixed function normalize doesn’t honor option terminator. Closes #216 @abbr
+
+2.3.0 / 2014-07-16
+==================
+
+ * add command alias'. Closes PR #210
+ * fix: Typos. Closes #99
+ * fix: Unused fs module. Closes #217
+
+2.2.0 / 2014-03-29
+==================
+
+ * add passing of previous option value
+ * fix: support subcommands on windows. Closes #142
+ * Now the defaultValue passed as the second argument of the coercion function.
+
+2.1.0 / 2013-11-21
+==================
+
+ * add: allow cflag style option params, unit test, fixes #174
+
+2.0.0 / 2013-07-18
+==================
+
+ * remove input methods (.prompt, .confirm, etc)
+
+1.3.2 / 2013-07-18
+==================
+
+ * add support for sub-commands to co-exist with the original command
+
+1.3.1 / 2013-07-18
+==================
+
+ * add quick .runningCommand hack so you can opt-out of other logic when running a sub command
+
+1.3.0 / 2013-07-09
+==================
+
+ * add EACCES error handling
+ * fix sub-command --help
+
+1.2.0 / 2013-06-13
+==================
+
+ * allow "-" hyphen as an option argument
+ * support for RegExp coercion
+
+1.1.1 / 2012-11-20
+==================
+
+  * add more sub-command padding
+  * fix .usage() when args are present. Closes #106
+
+1.1.0 / 2012-11-16
+==================
+
+  * add git-style executable subcommand support. Closes #94
+
+1.0.5 / 2012-10-09
+==================
+
+  * fix `--name` clobbering. Closes #92
+  * fix examples/help. Closes #89
+
+1.0.4 / 2012-09-03
+==================
+
+  * add `outputHelp()` method.
+
+1.0.3 / 2012-08-30
+==================
+
+  * remove invalid .version() defaulting
+
+1.0.2 / 2012-08-24
+==================
+
+  * add `--foo=bar` support [arv]
+  * fix password on node 0.8.8. Make backward compatible with 0.6 [focusaurus]
+
+1.0.1 / 2012-08-03
+==================
+
+  * fix issue #56
+  * fix tty.setRawMode(mode) was moved to tty.ReadStream#setRawMode() (i.e. process.stdin.setRawMode())
+
+1.0.0 / 2012-07-05
+==================
+
+  * add support for optional option descriptions
+  * add defaulting of `.version()` to package.json's version
+
+0.6.1 / 2012-06-01
+==================
+
+  * Added: append (yes or no) on confirmation
+  * Added: allow node.js v0.7.x
+
+0.6.0 / 2012-04-10
+==================
+
+  * Added `.prompt(obj, callback)` support. Closes #49
+  * Added default support to .choose(). Closes #41
+  * Fixed the choice example
+
+0.5.1 / 2011-12-20
+==================
+
+  * Fixed `password()` for recent nodes. Closes #36
+
+0.5.0 / 2011-12-04
+==================
+
+  * Added sub-command option support [itay]
+
+0.4.3 / 2011-12-04
+==================
+
+  * Fixed custom help ordering. Closes #32
+
+0.4.2 / 2011-11-24
+==================
+
+  * Added travis support
+  * Fixed: line-buffered input automatically trimmed. Closes #31
+
+0.4.1 / 2011-11-18
+==================
+
+  * Removed listening for "close" on --help
+
+0.4.0 / 2011-11-15
+==================
+
+  * Added support for `--`. Closes #24
+
+0.3.3 / 2011-11-14
+==================
+
+  * Fixed: wait for close event when writing help info [Jerry Hamlet]
+
+0.3.2 / 2011-11-01
+==================
+
+  * Fixed long flag definitions with values [felixge]
+
+0.3.1 / 2011-10-31
+==================
+
+  * Changed `--version` short flag to `-V` from `-v`
+  * Changed `.version()` so it's configurable [felixge]
+
+0.3.0 / 2011-10-31
+==================
+
+  * Added support for long flags only. Closes #18
+
+0.2.1 / 2011-10-24
+==================
+
+  * "node": ">= 0.4.x < 0.7.0". Closes #20
+
+0.2.0 / 2011-09-26
+==================
+
+  * Allow for defaults that are not just boolean. Default peassignment only occurs for --no-*, optional, and required arguments. [Jim Isaacs]
+
+0.1.0 / 2011-08-24
+==================
+
+  * Added support for custom `--help` output
+
+0.0.5 / 2011-08-18
+==================
+
+  * Changed: when the user enters nothing prompt for password again
+  * Fixed issue with passwords beginning with numbers [NuckChorris]
+
+0.0.4 / 2011-08-15
+==================
+
+  * Fixed `Commander#args`
+
+0.0.3 / 2011-08-15
+==================
+
+  * Added default option value support
+
+0.0.2 / 2011-08-15
+==================
+
+  * Added mask support to `Command#password(str[, mask], fn)`
+  * Added `Command#password(str, fn)`
+
+0.0.1 / 2010-01-03
+==================
+
+  * Initial release
diff --git a/node_modules/mathjs/examples/node_modules/commander/LICENSE b/node_modules/mathjs/examples/node_modules/commander/LICENSE
new file mode 100644
index 0000000..10f997a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/commander/LICENSE
@@ -0,0 +1,22 @@
+(The MIT License)
+
+Copyright (c) 2011 TJ Holowaychuk <tj@vision-media.ca>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/commander/Readme.md b/node_modules/mathjs/examples/node_modules/commander/Readme.md
new file mode 100644
index 0000000..c846e7a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/commander/Readme.md
@@ -0,0 +1,428 @@
+# Commander.js
+
+
+[![Build Status](https://api.travis-ci.org/tj/commander.js.svg?branch=master)](http://travis-ci.org/tj/commander.js)
+[![NPM Version](http://img.shields.io/npm/v/commander.svg?style=flat)](https://www.npmjs.org/package/commander)
+[![NPM Downloads](https://img.shields.io/npm/dm/commander.svg?style=flat)](https://npmcharts.com/compare/commander?minimal=true)
+[![Install Size](https://packagephobia.now.sh/badge?p=commander)](https://packagephobia.now.sh/result?p=commander)
+[![Join the chat at https://gitter.im/tj/commander.js](https://badges.gitter.im/Join%20Chat.svg)](https://gitter.im/tj/commander.js?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
+
+  The complete solution for [node.js](http://nodejs.org) command-line interfaces, inspired by Ruby's [commander](https://github.com/commander-rb/commander).  
+  [API documentation](http://tj.github.com/commander.js/)
+
+
+## Installation
+
+    $ npm install commander
+
+## Option parsing
+
+Options with commander are defined with the `.option()` method, also serving as documentation for the options. The example below parses args and options from `process.argv`, leaving remaining args as the `program.args` array which were not consumed by options.
+
+```js
+#!/usr/bin/env node
+
+/**
+ * Module dependencies.
+ */
+
+var program = require('commander');
+
+program
+  .version('0.1.0')
+  .option('-p, --peppers', 'Add peppers')
+  .option('-P, --pineapple', 'Add pineapple')
+  .option('-b, --bbq-sauce', 'Add bbq sauce')
+  .option('-c, --cheese [type]', 'Add the specified type of cheese [marble]', 'marble')
+  .parse(process.argv);
+
+console.log('you ordered a pizza with:');
+if (program.peppers) console.log('  - peppers');
+if (program.pineapple) console.log('  - pineapple');
+if (program.bbqSauce) console.log('  - bbq');
+console.log('  - %s cheese', program.cheese);
+```
+
+Short flags may be passed as a single arg, for example `-abc` is equivalent to `-a -b -c`. Multi-word options such as "--template-engine" are camel-cased, becoming `program.templateEngine` etc.
+
+Note that multi-word options starting with `--no` prefix negate the boolean value of the following word. For example, `--no-sauce` sets the value of `program.sauce` to false.
+
+```js
+#!/usr/bin/env node
+
+/**
+ * Module dependencies.
+ */
+
+var program = require('commander');
+
+program
+  .option('--no-sauce', 'Remove sauce')
+  .parse(process.argv);
+
+console.log('you ordered a pizza');
+if (program.sauce) console.log('  with sauce');
+else console.log(' without sauce');
+```
+
+To get string arguments from options you will need to use angle brackets <> for required inputs or square brackets [] for optional inputs. 
+
+e.g. ```.option('-m --myarg [myVar]', 'my super cool description')```
+
+Then to access the input if it was passed in.
+
+e.g. ```var myInput = program.myarg```
+
+**NOTE**: If you pass a argument without using brackets the example above will return true and not the value passed in.
+
+
+## Version option
+
+Calling the `version` implicitly adds the `-V` and `--version` options to the command.
+When either of these options is present, the command prints the version number and exits.
+
+    $ ./examples/pizza -V
+    0.0.1
+
+If you want your program to respond to the `-v` option instead of the `-V` option, simply pass custom flags to the `version` method using the same syntax as the `option` method.
+
+```js
+program
+  .version('0.0.1', '-v, --version')
+```
+
+The version flags can be named anything, but the long option is required.
+
+## Command-specific options
+
+You can attach options to a command.
+
+```js
+#!/usr/bin/env node
+
+var program = require('commander');
+
+program
+  .command('rm <dir>')
+  .option('-r, --recursive', 'Remove recursively')
+  .action(function (dir, cmd) {
+    console.log('remove ' + dir + (cmd.recursive ? ' recursively' : ''))
+  })
+
+program.parse(process.argv)
+```
+
+A command's options are validated when the command is used. Any unknown options will be reported as an error. However, if an action-based command does not define an action, then the options are not validated.
+
+## Coercion
+
+```js
+function range(val) {
+  return val.split('..').map(Number);
+}
+
+function list(val) {
+  return val.split(',');
+}
+
+function collect(val, memo) {
+  memo.push(val);
+  return memo;
+}
+
+function increaseVerbosity(v, total) {
+  return total + 1;
+}
+
+program
+  .version('0.1.0')
+  .usage('[options] <file ...>')
+  .option('-i, --integer <n>', 'An integer argument', parseInt)
+  .option('-f, --float <n>', 'A float argument', parseFloat)
+  .option('-r, --range <a>..<b>', 'A range', range)
+  .option('-l, --list <items>', 'A list', list)
+  .option('-o, --optional [value]', 'An optional value')
+  .option('-c, --collect [value]', 'A repeatable value', collect, [])
+  .option('-v, --verbose', 'A value that can be increased', increaseVerbosity, 0)
+  .parse(process.argv);
+
+console.log(' int: %j', program.integer);
+console.log(' float: %j', program.float);
+console.log(' optional: %j', program.optional);
+program.range = program.range || [];
+console.log(' range: %j..%j', program.range[0], program.range[1]);
+console.log(' list: %j', program.list);
+console.log(' collect: %j', program.collect);
+console.log(' verbosity: %j', program.verbose);
+console.log(' args: %j', program.args);
+```
+
+## Regular Expression
+```js
+program
+  .version('0.1.0')
+  .option('-s --size <size>', 'Pizza size', /^(large|medium|small)$/i, 'medium')
+  .option('-d --drink [drink]', 'Drink', /^(coke|pepsi|izze)$/i)
+  .parse(process.argv);
+
+console.log(' size: %j', program.size);
+console.log(' drink: %j', program.drink);
+```
+
+## Variadic arguments
+
+ The last argument of a command can be variadic, and only the last argument.  To make an argument variadic you have to
+ append `...` to the argument name.  Here is an example:
+
+```js
+#!/usr/bin/env node
+
+/**
+ * Module dependencies.
+ */
+
+var program = require('commander');
+
+program
+  .version('0.1.0')
+  .command('rmdir <dir> [otherDirs...]')
+  .action(function (dir, otherDirs) {
+    console.log('rmdir %s', dir);
+    if (otherDirs) {
+      otherDirs.forEach(function (oDir) {
+        console.log('rmdir %s', oDir);
+      });
+    }
+  });
+
+program.parse(process.argv);
+```
+
+ An `Array` is used for the value of a variadic argument.  This applies to `program.args` as well as the argument passed
+ to your action as demonstrated above.
+
+## Specify the argument syntax
+
+```js
+#!/usr/bin/env node
+
+var program = require('commander');
+
+program
+  .version('0.1.0')
+  .arguments('<cmd> [env]')
+  .action(function (cmd, env) {
+     cmdValue = cmd;
+     envValue = env;
+  });
+
+program.parse(process.argv);
+
+if (typeof cmdValue === 'undefined') {
+   console.error('no command given!');
+   process.exit(1);
+}
+console.log('command:', cmdValue);
+console.log('environment:', envValue || "no environment given");
+```
+Angled brackets (e.g. `<cmd>`) indicate required input. Square brackets (e.g. `[env]`) indicate optional input.
+
+## Git-style sub-commands
+
+```js
+// file: ./examples/pm
+var program = require('commander');
+
+program
+  .version('0.1.0')
+  .command('install [name]', 'install one or more packages')
+  .command('search [query]', 'search with optional query')
+  .command('list', 'list packages installed', {isDefault: true})
+  .parse(process.argv);
+```
+
+When `.command()` is invoked with a description argument, no `.action(callback)` should be called to handle sub-commands, otherwise there will be an error. This tells commander that you're going to use separate executables for sub-commands, much like `git(1)` and other popular tools.  
+The commander will try to search the executables in the directory of the entry script (like `./examples/pm`) with the name `program-command`, like `pm-install`, `pm-search`.
+
+Options can be passed with the call to `.command()`. Specifying `true` for `opts.noHelp` will remove the subcommand from the generated help output. Specifying `true` for `opts.isDefault` will run the subcommand if no other subcommand is specified.
+
+If the program is designed to be installed globally, make sure the executables have proper modes, like `755`.
+
+### `--harmony`
+
+You can enable `--harmony` option in two ways:
+* Use `#! /usr/bin/env node --harmony` in the sub-commands scripts. Note some os version don’t support this pattern.
+* Use the `--harmony` option when call the command, like `node --harmony examples/pm publish`. The `--harmony` option will be preserved when spawning sub-command process.
+
+## Automated --help
+
+ The help information is auto-generated based on the information commander already knows about your program, so the following `--help` info is for free:
+
+```  
+$ ./examples/pizza --help
+Usage: pizza [options]
+
+An application for pizzas ordering
+
+Options:
+  -h, --help           output usage information
+  -V, --version        output the version number
+  -p, --peppers        Add peppers
+  -P, --pineapple      Add pineapple
+  -b, --bbq            Add bbq sauce
+  -c, --cheese <type>  Add the specified type of cheese [marble]
+  -C, --no-cheese      You do not want any cheese
+```
+
+## Custom help
+
+ You can display arbitrary `-h, --help` information
+ by listening for "--help". Commander will automatically
+ exit once you are done so that the remainder of your program
+ does not execute causing undesired behaviors, for example
+ in the following executable "stuff" will not output when
+ `--help` is used.
+
+```js
+#!/usr/bin/env node
+
+/**
+ * Module dependencies.
+ */
+
+var program = require('commander');
+
+program
+  .version('0.1.0')
+  .option('-f, --foo', 'enable some foo')
+  .option('-b, --bar', 'enable some bar')
+  .option('-B, --baz', 'enable some baz');
+
+// must be before .parse() since
+// node's emit() is immediate
+
+program.on('--help', function(){
+  console.log('')
+  console.log('Examples:');
+  console.log('  $ custom-help --help');
+  console.log('  $ custom-help -h');
+});
+
+program.parse(process.argv);
+
+console.log('stuff');
+```
+
+Yields the following help output when `node script-name.js -h` or `node script-name.js --help` are run:
+
+```
+Usage: custom-help [options]
+
+Options:
+  -h, --help     output usage information
+  -V, --version  output the version number
+  -f, --foo      enable some foo
+  -b, --bar      enable some bar
+  -B, --baz      enable some baz
+
+Examples:
+  $ custom-help --help
+  $ custom-help -h
+```
+
+## .outputHelp(cb)
+
+Output help information without exiting.
+Optional callback cb allows post-processing of help text before it is displayed.
+
+If you want to display help by default (e.g. if no command was provided), you can use something like:
+
+```js
+var program = require('commander');
+var colors = require('colors');
+
+program
+  .version('0.1.0')
+  .command('getstream [url]', 'get stream URL')
+  .parse(process.argv);
+
+if (!process.argv.slice(2).length) {
+  program.outputHelp(make_red);
+}
+
+function make_red(txt) {
+  return colors.red(txt); //display the help text in red on the console
+}
+```
+
+## .help(cb)
+
+  Output help information and exit immediately.
+  Optional callback cb allows post-processing of help text before it is displayed.
+
+
+## Custom event listeners
+ You can execute custom actions by listening to command and option events.
+
+```js
+program.on('option:verbose', function () {
+  process.env.VERBOSE = this.verbose;
+});
+
+// error on unknown commands
+program.on('command:*', function () {
+  console.error('Invalid command: %s\nSee --help for a list of available commands.', program.args.join(' '));
+  process.exit(1);
+});
+```
+
+## Examples
+
+```js
+var program = require('commander');
+
+program
+  .version('0.1.0')
+  .option('-C, --chdir <path>', 'change the working directory')
+  .option('-c, --config <path>', 'set config path. defaults to ./deploy.conf')
+  .option('-T, --no-tests', 'ignore test hook');
+
+program
+  .command('setup [env]')
+  .description('run setup commands for all envs')
+  .option("-s, --setup_mode [mode]", "Which setup mode to use")
+  .action(function(env, options){
+    var mode = options.setup_mode || "normal";
+    env = env || 'all';
+    console.log('setup for %s env(s) with %s mode', env, mode);
+  });
+
+program
+  .command('exec <cmd>')
+  .alias('ex')
+  .description('execute the given remote cmd')
+  .option("-e, --exec_mode <mode>", "Which exec mode to use")
+  .action(function(cmd, options){
+    console.log('exec "%s" using %s mode', cmd, options.exec_mode);
+  }).on('--help', function() {
+    console.log('');
+    console.log('Examples:');
+    console.log('');
+    console.log('  $ deploy exec sequential');
+    console.log('  $ deploy exec async');
+  });
+
+program
+  .command('*')
+  .action(function(env){
+    console.log('deploying "%s"', env);
+  });
+
+program.parse(process.argv);
+```
+
+More Demos can be found in the [examples](https://github.com/tj/commander.js/tree/master/examples) directory.
+
+## License
+
+[MIT](https://github.com/tj/commander.js/blob/master/LICENSE)
diff --git a/node_modules/mathjs/examples/node_modules/commander/index.js b/node_modules/mathjs/examples/node_modules/commander/index.js
new file mode 100644
index 0000000..ec1d61d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/commander/index.js
@@ -0,0 +1,1224 @@
+/**
+ * Module dependencies.
+ */
+
+var EventEmitter = require('events').EventEmitter;
+var spawn = require('child_process').spawn;
+var path = require('path');
+var dirname = path.dirname;
+var basename = path.basename;
+var fs = require('fs');
+
+/**
+ * Inherit `Command` from `EventEmitter.prototype`.
+ */
+
+require('util').inherits(Command, EventEmitter);
+
+/**
+ * Expose the root command.
+ */
+
+exports = module.exports = new Command();
+
+/**
+ * Expose `Command`.
+ */
+
+exports.Command = Command;
+
+/**
+ * Expose `Option`.
+ */
+
+exports.Option = Option;
+
+/**
+ * Initialize a new `Option` with the given `flags` and `description`.
+ *
+ * @param {String} flags
+ * @param {String} description
+ * @api public
+ */
+
+function Option(flags, description) {
+  this.flags = flags;
+  this.required = flags.indexOf('<') >= 0;
+  this.optional = flags.indexOf('[') >= 0;
+  this.bool = flags.indexOf('-no-') === -1;
+  flags = flags.split(/[ ,|]+/);
+  if (flags.length > 1 && !/^[[<]/.test(flags[1])) this.short = flags.shift();
+  this.long = flags.shift();
+  this.description = description || '';
+}
+
+/**
+ * Return option name.
+ *
+ * @return {String}
+ * @api private
+ */
+
+Option.prototype.name = function() {
+  return this.long
+    .replace('--', '')
+    .replace('no-', '');
+};
+
+/**
+ * Return option name, in a camelcase format that can be used
+ * as a object attribute key.
+ *
+ * @return {String}
+ * @api private
+ */
+
+Option.prototype.attributeName = function() {
+  return camelcase(this.name());
+};
+
+/**
+ * Check if `arg` matches the short or long flag.
+ *
+ * @param {String} arg
+ * @return {Boolean}
+ * @api private
+ */
+
+Option.prototype.is = function(arg) {
+  return this.short === arg || this.long === arg;
+};
+
+/**
+ * Initialize a new `Command`.
+ *
+ * @param {String} name
+ * @api public
+ */
+
+function Command(name) {
+  this.commands = [];
+  this.options = [];
+  this._execs = {};
+  this._allowUnknownOption = false;
+  this._args = [];
+  this._name = name || '';
+}
+
+/**
+ * Add command `name`.
+ *
+ * The `.action()` callback is invoked when the
+ * command `name` is specified via __ARGV__,
+ * and the remaining arguments are applied to the
+ * function for access.
+ *
+ * When the `name` is "*" an un-matched command
+ * will be passed as the first arg, followed by
+ * the rest of __ARGV__ remaining.
+ *
+ * Examples:
+ *
+ *      program
+ *        .version('0.0.1')
+ *        .option('-C, --chdir <path>', 'change the working directory')
+ *        .option('-c, --config <path>', 'set config path. defaults to ./deploy.conf')
+ *        .option('-T, --no-tests', 'ignore test hook')
+ *
+ *      program
+ *        .command('setup')
+ *        .description('run remote setup commands')
+ *        .action(function() {
+ *          console.log('setup');
+ *        });
+ *
+ *      program
+ *        .command('exec <cmd>')
+ *        .description('run the given remote command')
+ *        .action(function(cmd) {
+ *          console.log('exec "%s"', cmd);
+ *        });
+ *
+ *      program
+ *        .command('teardown <dir> [otherDirs...]')
+ *        .description('run teardown commands')
+ *        .action(function(dir, otherDirs) {
+ *          console.log('dir "%s"', dir);
+ *          if (otherDirs) {
+ *            otherDirs.forEach(function (oDir) {
+ *              console.log('dir "%s"', oDir);
+ *            });
+ *          }
+ *        });
+ *
+ *      program
+ *        .command('*')
+ *        .description('deploy the given env')
+ *        .action(function(env) {
+ *          console.log('deploying "%s"', env);
+ *        });
+ *
+ *      program.parse(process.argv);
+  *
+ * @param {String} name
+ * @param {String} [desc] for git-style sub-commands
+ * @return {Command} the new command
+ * @api public
+ */
+
+Command.prototype.command = function(name, desc, opts) {
+  if (typeof desc === 'object' && desc !== null) {
+    opts = desc;
+    desc = null;
+  }
+  opts = opts || {};
+  var args = name.split(/ +/);
+  var cmd = new Command(args.shift());
+
+  if (desc) {
+    cmd.description(desc);
+    this.executables = true;
+    this._execs[cmd._name] = true;
+    if (opts.isDefault) this.defaultExecutable = cmd._name;
+  }
+  cmd._noHelp = !!opts.noHelp;
+  this.commands.push(cmd);
+  cmd.parseExpectedArgs(args);
+  cmd.parent = this;
+
+  if (desc) return this;
+  return cmd;
+};
+
+/**
+ * Define argument syntax for the top-level command.
+ *
+ * @api public
+ */
+
+Command.prototype.arguments = function(desc) {
+  return this.parseExpectedArgs(desc.split(/ +/));
+};
+
+/**
+ * Add an implicit `help [cmd]` subcommand
+ * which invokes `--help` for the given command.
+ *
+ * @api private
+ */
+
+Command.prototype.addImplicitHelpCommand = function() {
+  this.command('help [cmd]', 'display help for [cmd]');
+};
+
+/**
+ * Parse expected `args`.
+ *
+ * For example `["[type]"]` becomes `[{ required: false, name: 'type' }]`.
+ *
+ * @param {Array} args
+ * @return {Command} for chaining
+ * @api public
+ */
+
+Command.prototype.parseExpectedArgs = function(args) {
+  if (!args.length) return;
+  var self = this;
+  args.forEach(function(arg) {
+    var argDetails = {
+      required: false,
+      name: '',
+      variadic: false
+    };
+
+    switch (arg[0]) {
+      case '<':
+        argDetails.required = true;
+        argDetails.name = arg.slice(1, -1);
+        break;
+      case '[':
+        argDetails.name = arg.slice(1, -1);
+        break;
+    }
+
+    if (argDetails.name.length > 3 && argDetails.name.slice(-3) === '...') {
+      argDetails.variadic = true;
+      argDetails.name = argDetails.name.slice(0, -3);
+    }
+    if (argDetails.name) {
+      self._args.push(argDetails);
+    }
+  });
+  return this;
+};
+
+/**
+ * Register callback `fn` for the command.
+ *
+ * Examples:
+ *
+ *      program
+ *        .command('help')
+ *        .description('display verbose help')
+ *        .action(function() {
+ *           // output help here
+ *        });
+ *
+ * @param {Function} fn
+ * @return {Command} for chaining
+ * @api public
+ */
+
+Command.prototype.action = function(fn) {
+  var self = this;
+  var listener = function(args, unknown) {
+    // Parse any so-far unknown options
+    args = args || [];
+    unknown = unknown || [];
+
+    var parsed = self.parseOptions(unknown);
+
+    // Output help if necessary
+    outputHelpIfNecessary(self, parsed.unknown);
+
+    // If there are still any unknown options, then we simply
+    // die, unless someone asked for help, in which case we give it
+    // to them, and then we die.
+    if (parsed.unknown.length > 0) {
+      self.unknownOption(parsed.unknown[0]);
+    }
+
+    // Leftover arguments need to be pushed back. Fixes issue #56
+    if (parsed.args.length) args = parsed.args.concat(args);
+
+    self._args.forEach(function(arg, i) {
+      if (arg.required && args[i] == null) {
+        self.missingArgument(arg.name);
+      } else if (arg.variadic) {
+        if (i !== self._args.length - 1) {
+          self.variadicArgNotLast(arg.name);
+        }
+
+        args[i] = args.splice(i);
+      }
+    });
+
+    // Always append ourselves to the end of the arguments,
+    // to make sure we match the number of arguments the user
+    // expects
+    if (self._args.length) {
+      args[self._args.length] = self;
+    } else {
+      args.push(self);
+    }
+
+    fn.apply(self, args);
+  };
+  var parent = this.parent || this;
+  var name = parent === this ? '*' : this._name;
+  parent.on('command:' + name, listener);
+  if (this._alias) parent.on('command:' + this._alias, listener);
+  return this;
+};
+
+/**
+ * Define option with `flags`, `description` and optional
+ * coercion `fn`.
+ *
+ * The `flags` string should contain both the short and long flags,
+ * separated by comma, a pipe or space. The following are all valid
+ * all will output this way when `--help` is used.
+ *
+ *    "-p, --pepper"
+ *    "-p|--pepper"
+ *    "-p --pepper"
+ *
+ * Examples:
+ *
+ *     // simple boolean defaulting to false
+ *     program.option('-p, --pepper', 'add pepper');
+ *
+ *     --pepper
+ *     program.pepper
+ *     // => Boolean
+ *
+ *     // simple boolean defaulting to true
+ *     program.option('-C, --no-cheese', 'remove cheese');
+ *
+ *     program.cheese
+ *     // => true
+ *
+ *     --no-cheese
+ *     program.cheese
+ *     // => false
+ *
+ *     // required argument
+ *     program.option('-C, --chdir <path>', 'change the working directory');
+ *
+ *     --chdir /tmp
+ *     program.chdir
+ *     // => "/tmp"
+ *
+ *     // optional argument
+ *     program.option('-c, --cheese [type]', 'add cheese [marble]');
+ *
+ * @param {String} flags
+ * @param {String} description
+ * @param {Function|*} [fn] or default
+ * @param {*} [defaultValue]
+ * @return {Command} for chaining
+ * @api public
+ */
+
+Command.prototype.option = function(flags, description, fn, defaultValue) {
+  var self = this,
+    option = new Option(flags, description),
+    oname = option.name(),
+    name = option.attributeName();
+
+  // default as 3rd arg
+  if (typeof fn !== 'function') {
+    if (fn instanceof RegExp) {
+      var regex = fn;
+      fn = function(val, def) {
+        var m = regex.exec(val);
+        return m ? m[0] : def;
+      };
+    } else {
+      defaultValue = fn;
+      fn = null;
+    }
+  }
+
+  // preassign default value only for --no-*, [optional], or <required>
+  if (!option.bool || option.optional || option.required) {
+    // when --no-* we make sure default is true
+    if (!option.bool) defaultValue = true;
+    // preassign only if we have a default
+    if (defaultValue !== undefined) {
+      self[name] = defaultValue;
+      option.defaultValue = defaultValue;
+    }
+  }
+
+  // register the option
+  this.options.push(option);
+
+  // when it's passed assign the value
+  // and conditionally invoke the callback
+  this.on('option:' + oname, function(val) {
+    // coercion
+    if (val !== null && fn) {
+      val = fn(val, self[name] === undefined ? defaultValue : self[name]);
+    }
+
+    // unassigned or bool
+    if (typeof self[name] === 'boolean' || typeof self[name] === 'undefined') {
+      // if no value, bool true, and we have a default, then use it!
+      if (val == null) {
+        self[name] = option.bool
+          ? defaultValue || true
+          : false;
+      } else {
+        self[name] = val;
+      }
+    } else if (val !== null) {
+      // reassign
+      self[name] = val;
+    }
+  });
+
+  return this;
+};
+
+/**
+ * Allow unknown options on the command line.
+ *
+ * @param {Boolean} arg if `true` or omitted, no error will be thrown
+ * for unknown options.
+ * @api public
+ */
+Command.prototype.allowUnknownOption = function(arg) {
+  this._allowUnknownOption = arguments.length === 0 || arg;
+  return this;
+};
+
+/**
+ * Parse `argv`, settings options and invoking commands when defined.
+ *
+ * @param {Array} argv
+ * @return {Command} for chaining
+ * @api public
+ */
+
+Command.prototype.parse = function(argv) {
+  // implicit help
+  if (this.executables) this.addImplicitHelpCommand();
+
+  // store raw args
+  this.rawArgs = argv;
+
+  // guess name
+  this._name = this._name || basename(argv[1], '.js');
+
+  // github-style sub-commands with no sub-command
+  if (this.executables && argv.length < 3 && !this.defaultExecutable) {
+    // this user needs help
+    argv.push('--help');
+  }
+
+  // process argv
+  var parsed = this.parseOptions(this.normalize(argv.slice(2)));
+  var args = this.args = parsed.args;
+
+  var result = this.parseArgs(this.args, parsed.unknown);
+
+  // executable sub-commands
+  var name = result.args[0];
+
+  var aliasCommand = null;
+  // check alias of sub commands
+  if (name) {
+    aliasCommand = this.commands.filter(function(command) {
+      return command.alias() === name;
+    })[0];
+  }
+
+  if (this._execs[name] === true) {
+    return this.executeSubCommand(argv, args, parsed.unknown);
+  } else if (aliasCommand) {
+    // is alias of a subCommand
+    args[0] = aliasCommand._name;
+    return this.executeSubCommand(argv, args, parsed.unknown);
+  } else if (this.defaultExecutable) {
+    // use the default subcommand
+    args.unshift(this.defaultExecutable);
+    return this.executeSubCommand(argv, args, parsed.unknown);
+  }
+
+  return result;
+};
+
+/**
+ * Execute a sub-command executable.
+ *
+ * @param {Array} argv
+ * @param {Array} args
+ * @param {Array} unknown
+ * @api private
+ */
+
+Command.prototype.executeSubCommand = function(argv, args, unknown) {
+  args = args.concat(unknown);
+
+  if (!args.length) this.help();
+  if (args[0] === 'help' && args.length === 1) this.help();
+
+  // <cmd> --help
+  if (args[0] === 'help') {
+    args[0] = args[1];
+    args[1] = '--help';
+  }
+
+  // executable
+  var f = argv[1];
+  // name of the subcommand, link `pm-install`
+  var bin = basename(f, path.extname(f)) + '-' + args[0];
+
+  // In case of globally installed, get the base dir where executable
+  //  subcommand file should be located at
+  var baseDir;
+
+  var resolvedLink = fs.realpathSync(f);
+
+  baseDir = dirname(resolvedLink);
+
+  // prefer local `./<bin>` to bin in the $PATH
+  var localBin = path.join(baseDir, bin);
+
+  // whether bin file is a js script with explicit `.js` or `.ts` extension
+  var isExplicitJS = false;
+  if (exists(localBin + '.js')) {
+    bin = localBin + '.js';
+    isExplicitJS = true;
+  } else if (exists(localBin + '.ts')) {
+    bin = localBin + '.ts';
+    isExplicitJS = true;
+  } else if (exists(localBin)) {
+    bin = localBin;
+  }
+
+  args = args.slice(1);
+
+  var proc;
+  if (process.platform !== 'win32') {
+    if (isExplicitJS) {
+      args.unshift(bin);
+      // add executable arguments to spawn
+      args = (process.execArgv || []).concat(args);
+
+      proc = spawn(process.argv[0], args, { stdio: 'inherit', customFds: [0, 1, 2] });
+    } else {
+      proc = spawn(bin, args, { stdio: 'inherit', customFds: [0, 1, 2] });
+    }
+  } else {
+    args.unshift(bin);
+    proc = spawn(process.execPath, args, { stdio: 'inherit' });
+  }
+
+  var signals = ['SIGUSR1', 'SIGUSR2', 'SIGTERM', 'SIGINT', 'SIGHUP'];
+  signals.forEach(function(signal) {
+    process.on(signal, function() {
+      if (proc.killed === false && proc.exitCode === null) {
+        proc.kill(signal);
+      }
+    });
+  });
+  proc.on('close', process.exit.bind(process));
+  proc.on('error', function(err) {
+    if (err.code === 'ENOENT') {
+      console.error('error: %s(1) does not exist, try --help', bin);
+    } else if (err.code === 'EACCES') {
+      console.error('error: %s(1) not executable. try chmod or run with root', bin);
+    }
+    process.exit(1);
+  });
+
+  // Store the reference to the child process
+  this.runningCommand = proc;
+};
+
+/**
+ * Normalize `args`, splitting joined short flags. For example
+ * the arg "-abc" is equivalent to "-a -b -c".
+ * This also normalizes equal sign and splits "--abc=def" into "--abc def".
+ *
+ * @param {Array} args
+ * @return {Array}
+ * @api private
+ */
+
+Command.prototype.normalize = function(args) {
+  var ret = [],
+    arg,
+    lastOpt,
+    index;
+
+  for (var i = 0, len = args.length; i < len; ++i) {
+    arg = args[i];
+    if (i > 0) {
+      lastOpt = this.optionFor(args[i - 1]);
+    }
+
+    if (arg === '--') {
+      // Honor option terminator
+      ret = ret.concat(args.slice(i));
+      break;
+    } else if (lastOpt && lastOpt.required) {
+      ret.push(arg);
+    } else if (arg.length > 1 && arg[0] === '-' && arg[1] !== '-') {
+      arg.slice(1).split('').forEach(function(c) {
+        ret.push('-' + c);
+      });
+    } else if (/^--/.test(arg) && ~(index = arg.indexOf('='))) {
+      ret.push(arg.slice(0, index), arg.slice(index + 1));
+    } else {
+      ret.push(arg);
+    }
+  }
+
+  return ret;
+};
+
+/**
+ * Parse command `args`.
+ *
+ * When listener(s) are available those
+ * callbacks are invoked, otherwise the "*"
+ * event is emitted and those actions are invoked.
+ *
+ * @param {Array} args
+ * @return {Command} for chaining
+ * @api private
+ */
+
+Command.prototype.parseArgs = function(args, unknown) {
+  var name;
+
+  if (args.length) {
+    name = args[0];
+    if (this.listeners('command:' + name).length) {
+      this.emit('command:' + args.shift(), args, unknown);
+    } else {
+      this.emit('command:*', args);
+    }
+  } else {
+    outputHelpIfNecessary(this, unknown);
+
+    // If there were no args and we have unknown options,
+    // then they are extraneous and we need to error.
+    if (unknown.length > 0) {
+      this.unknownOption(unknown[0]);
+    }
+    if (this.commands.length === 0 &&
+        this._args.filter(function(a) { return a.required; }).length === 0) {
+      this.emit('command:*');
+    }
+  }
+
+  return this;
+};
+
+/**
+ * Return an option matching `arg` if any.
+ *
+ * @param {String} arg
+ * @return {Option}
+ * @api private
+ */
+
+Command.prototype.optionFor = function(arg) {
+  for (var i = 0, len = this.options.length; i < len; ++i) {
+    if (this.options[i].is(arg)) {
+      return this.options[i];
+    }
+  }
+};
+
+/**
+ * Parse options from `argv` returning `argv`
+ * void of these options.
+ *
+ * @param {Array} argv
+ * @return {Array}
+ * @api public
+ */
+
+Command.prototype.parseOptions = function(argv) {
+  var args = [],
+    len = argv.length,
+    literal,
+    option,
+    arg;
+
+  var unknownOptions = [];
+
+  // parse options
+  for (var i = 0; i < len; ++i) {
+    arg = argv[i];
+
+    // literal args after --
+    if (literal) {
+      args.push(arg);
+      continue;
+    }
+
+    if (arg === '--') {
+      literal = true;
+      continue;
+    }
+
+    // find matching Option
+    option = this.optionFor(arg);
+
+    // option is defined
+    if (option) {
+      // requires arg
+      if (option.required) {
+        arg = argv[++i];
+        if (arg == null) return this.optionMissingArgument(option);
+        this.emit('option:' + option.name(), arg);
+      // optional arg
+      } else if (option.optional) {
+        arg = argv[i + 1];
+        if (arg == null || (arg[0] === '-' && arg !== '-')) {
+          arg = null;
+        } else {
+          ++i;
+        }
+        this.emit('option:' + option.name(), arg);
+      // bool
+      } else {
+        this.emit('option:' + option.name());
+      }
+      continue;
+    }
+
+    // looks like an option
+    if (arg.length > 1 && arg[0] === '-') {
+      unknownOptions.push(arg);
+
+      // If the next argument looks like it might be
+      // an argument for this option, we pass it on.
+      // If it isn't, then it'll simply be ignored
+      if ((i + 1) < argv.length && argv[i + 1][0] !== '-') {
+        unknownOptions.push(argv[++i]);
+      }
+      continue;
+    }
+
+    // arg
+    args.push(arg);
+  }
+
+  return { args: args, unknown: unknownOptions };
+};
+
+/**
+ * Return an object containing options as key-value pairs
+ *
+ * @return {Object}
+ * @api public
+ */
+Command.prototype.opts = function() {
+  var result = {},
+    len = this.options.length;
+
+  for (var i = 0; i < len; i++) {
+    var key = this.options[i].attributeName();
+    result[key] = key === this._versionOptionName ? this._version : this[key];
+  }
+  return result;
+};
+
+/**
+ * Argument `name` is missing.
+ *
+ * @param {String} name
+ * @api private
+ */
+
+Command.prototype.missingArgument = function(name) {
+  console.error("error: missing required argument `%s'", name);
+  process.exit(1);
+};
+
+/**
+ * `Option` is missing an argument, but received `flag` or nothing.
+ *
+ * @param {String} option
+ * @param {String} flag
+ * @api private
+ */
+
+Command.prototype.optionMissingArgument = function(option, flag) {
+  if (flag) {
+    console.error("error: option `%s' argument missing, got `%s'", option.flags, flag);
+  } else {
+    console.error("error: option `%s' argument missing", option.flags);
+  }
+  process.exit(1);
+};
+
+/**
+ * Unknown option `flag`.
+ *
+ * @param {String} flag
+ * @api private
+ */
+
+Command.prototype.unknownOption = function(flag) {
+  if (this._allowUnknownOption) return;
+  console.error("error: unknown option `%s'", flag);
+  process.exit(1);
+};
+
+/**
+ * Variadic argument with `name` is not the last argument as required.
+ *
+ * @param {String} name
+ * @api private
+ */
+
+Command.prototype.variadicArgNotLast = function(name) {
+  console.error("error: variadic arguments must be last `%s'", name);
+  process.exit(1);
+};
+
+/**
+ * Set the program version to `str`.
+ *
+ * This method auto-registers the "-V, --version" flag
+ * which will print the version number when passed.
+ *
+ * @param {String} str
+ * @param {String} [flags]
+ * @return {Command} for chaining
+ * @api public
+ */
+
+Command.prototype.version = function(str, flags) {
+  if (arguments.length === 0) return this._version;
+  this._version = str;
+  flags = flags || '-V, --version';
+  var versionOption = new Option(flags, 'output the version number');
+  this._versionOptionName = versionOption.long.substr(2) || 'version';
+  this.options.push(versionOption);
+  this.on('option:' + this._versionOptionName, function() {
+    process.stdout.write(str + '\n');
+    process.exit(0);
+  });
+  return this;
+};
+
+/**
+ * Set the description to `str`.
+ *
+ * @param {String} str
+ * @param {Object} argsDescription
+ * @return {String|Command}
+ * @api public
+ */
+
+Command.prototype.description = function(str, argsDescription) {
+  if (arguments.length === 0) return this._description;
+  this._description = str;
+  this._argsDescription = argsDescription;
+  return this;
+};
+
+/**
+ * Set an alias for the command
+ *
+ * @param {String} alias
+ * @return {String|Command}
+ * @api public
+ */
+
+Command.prototype.alias = function(alias) {
+  var command = this;
+  if (this.commands.length !== 0) {
+    command = this.commands[this.commands.length - 1];
+  }
+
+  if (arguments.length === 0) return command._alias;
+
+  if (alias === command._name) throw new Error('Command alias can\'t be the same as its name');
+
+  command._alias = alias;
+  return this;
+};
+
+/**
+ * Set / get the command usage `str`.
+ *
+ * @param {String} str
+ * @return {String|Command}
+ * @api public
+ */
+
+Command.prototype.usage = function(str) {
+  var args = this._args.map(function(arg) {
+    return humanReadableArgName(arg);
+  });
+
+  var usage = '[options]' +
+    (this.commands.length ? ' [command]' : '') +
+    (this._args.length ? ' ' + args.join(' ') : '');
+
+  if (arguments.length === 0) return this._usage || usage;
+  this._usage = str;
+
+  return this;
+};
+
+/**
+ * Get or set the name of the command
+ *
+ * @param {String} str
+ * @return {String|Command}
+ * @api public
+ */
+
+Command.prototype.name = function(str) {
+  if (arguments.length === 0) return this._name;
+  this._name = str;
+  return this;
+};
+
+/**
+ * Return prepared commands.
+ *
+ * @return {Array}
+ * @api private
+ */
+
+Command.prototype.prepareCommands = function() {
+  return this.commands.filter(function(cmd) {
+    return !cmd._noHelp;
+  }).map(function(cmd) {
+    var args = cmd._args.map(function(arg) {
+      return humanReadableArgName(arg);
+    }).join(' ');
+
+    return [
+      cmd._name +
+        (cmd._alias ? '|' + cmd._alias : '') +
+        (cmd.options.length ? ' [options]' : '') +
+        (args ? ' ' + args : ''),
+      cmd._description
+    ];
+  });
+};
+
+/**
+ * Return the largest command length.
+ *
+ * @return {Number}
+ * @api private
+ */
+
+Command.prototype.largestCommandLength = function() {
+  var commands = this.prepareCommands();
+  return commands.reduce(function(max, command) {
+    return Math.max(max, command[0].length);
+  }, 0);
+};
+
+/**
+ * Return the largest option length.
+ *
+ * @return {Number}
+ * @api private
+ */
+
+Command.prototype.largestOptionLength = function() {
+  var options = [].slice.call(this.options);
+  options.push({
+    flags: '-h, --help'
+  });
+  return options.reduce(function(max, option) {
+    return Math.max(max, option.flags.length);
+  }, 0);
+};
+
+/**
+ * Return the largest arg length.
+ *
+ * @return {Number}
+ * @api private
+ */
+
+Command.prototype.largestArgLength = function() {
+  return this._args.reduce(function(max, arg) {
+    return Math.max(max, arg.name.length);
+  }, 0);
+};
+
+/**
+ * Return the pad width.
+ *
+ * @return {Number}
+ * @api private
+ */
+
+Command.prototype.padWidth = function() {
+  var width = this.largestOptionLength();
+  if (this._argsDescription && this._args.length) {
+    if (this.largestArgLength() > width) {
+      width = this.largestArgLength();
+    }
+  }
+
+  if (this.commands && this.commands.length) {
+    if (this.largestCommandLength() > width) {
+      width = this.largestCommandLength();
+    }
+  }
+
+  return width;
+};
+
+/**
+ * Return help for options.
+ *
+ * @return {String}
+ * @api private
+ */
+
+Command.prototype.optionHelp = function() {
+  var width = this.padWidth();
+
+  // Append the help information
+  return this.options.map(function(option) {
+    return pad(option.flags, width) + '  ' + option.description +
+      ((option.bool && option.defaultValue !== undefined) ? ' (default: ' + JSON.stringify(option.defaultValue) + ')' : '');
+  }).concat([pad('-h, --help', width) + '  ' + 'output usage information'])
+    .join('\n');
+};
+
+/**
+ * Return command help documentation.
+ *
+ * @return {String}
+ * @api private
+ */
+
+Command.prototype.commandHelp = function() {
+  if (!this.commands.length) return '';
+
+  var commands = this.prepareCommands();
+  var width = this.padWidth();
+
+  return [
+    'Commands:',
+    commands.map(function(cmd) {
+      var desc = cmd[1] ? '  ' + cmd[1] : '';
+      return (desc ? pad(cmd[0], width) : cmd[0]) + desc;
+    }).join('\n').replace(/^/gm, '  '),
+    ''
+  ].join('\n');
+};
+
+/**
+ * Return program help documentation.
+ *
+ * @return {String}
+ * @api private
+ */
+
+Command.prototype.helpInformation = function() {
+  var desc = [];
+  if (this._description) {
+    desc = [
+      this._description,
+      ''
+    ];
+
+    var argsDescription = this._argsDescription;
+    if (argsDescription && this._args.length) {
+      var width = this.padWidth();
+      desc.push('Arguments:');
+      desc.push('');
+      this._args.forEach(function(arg) {
+        desc.push('  ' + pad(arg.name, width) + '  ' + argsDescription[arg.name]);
+      });
+      desc.push('');
+    }
+  }
+
+  var cmdName = this._name;
+  if (this._alias) {
+    cmdName = cmdName + '|' + this._alias;
+  }
+  var usage = [
+    'Usage: ' + cmdName + ' ' + this.usage(),
+    ''
+  ];
+
+  var cmds = [];
+  var commandHelp = this.commandHelp();
+  if (commandHelp) cmds = [commandHelp];
+
+  var options = [
+    'Options:',
+    '' + this.optionHelp().replace(/^/gm, '  '),
+    ''
+  ];
+
+  return usage
+    .concat(desc)
+    .concat(options)
+    .concat(cmds)
+    .join('\n');
+};
+
+/**
+ * Output help information for this command
+ *
+ * @api public
+ */
+
+Command.prototype.outputHelp = function(cb) {
+  if (!cb) {
+    cb = function(passthru) {
+      return passthru;
+    };
+  }
+  process.stdout.write(cb(this.helpInformation()));
+  this.emit('--help');
+};
+
+/**
+ * Output help information and exit.
+ *
+ * @api public
+ */
+
+Command.prototype.help = function(cb) {
+  this.outputHelp(cb);
+  process.exit();
+};
+
+/**
+ * Camel-case the given `flag`
+ *
+ * @param {String} flag
+ * @return {String}
+ * @api private
+ */
+
+function camelcase(flag) {
+  return flag.split('-').reduce(function(str, word) {
+    return str + word[0].toUpperCase() + word.slice(1);
+  });
+}
+
+/**
+ * Pad `str` to `width`.
+ *
+ * @param {String} str
+ * @param {Number} width
+ * @return {String}
+ * @api private
+ */
+
+function pad(str, width) {
+  var len = Math.max(0, width - str.length);
+  return str + Array(len + 1).join(' ');
+}
+
+/**
+ * Output help information if necessary
+ *
+ * @param {Command} command to output help for
+ * @param {Array} array of options to search for -h or --help
+ * @api private
+ */
+
+function outputHelpIfNecessary(cmd, options) {
+  options = options || [];
+  for (var i = 0; i < options.length; i++) {
+    if (options[i] === '--help' || options[i] === '-h') {
+      cmd.outputHelp();
+      process.exit(0);
+    }
+  }
+}
+
+/**
+ * Takes an argument an returns its human readable equivalent for help usage.
+ *
+ * @param {Object} arg
+ * @return {String}
+ * @api private
+ */
+
+function humanReadableArgName(arg) {
+  var nameOutput = arg.name + (arg.variadic === true ? '...' : '');
+
+  return arg.required
+    ? '<' + nameOutput + '>'
+    : '[' + nameOutput + ']';
+}
+
+// for versions before node v0.8 when there weren't `fs.existsSync`
+function exists(file) {
+  try {
+    if (fs.statSync(file).isFile()) {
+      return true;
+    }
+  } catch (e) {
+    return false;
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/commander/package.json b/node_modules/mathjs/examples/node_modules/commander/package.json
new file mode 100644
index 0000000..0023c5c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/commander/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "commander",
+  "version": "2.20.3",
+  "description": "the complete solution for node.js command-line programs",
+  "keywords": [
+    "commander",
+    "command",
+    "option",
+    "parser"
+  ],
+  "author": "TJ Holowaychuk <tj@vision-media.ca>",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/tj/commander.js.git"
+  },
+  "scripts": {
+    "lint": "eslint index.js",
+    "test": "node test/run.js && npm run test-typings",
+    "test-typings": "tsc -p tsconfig.json"
+  },
+  "main": "index",
+  "files": [
+    "index.js",
+    "typings/index.d.ts"
+  ],
+  "dependencies": {},
+  "devDependencies": {
+    "@types/node": "^12.7.8",
+    "eslint": "^6.4.0",
+    "should": "^13.2.3",
+    "sinon": "^7.5.0",
+    "standard": "^14.3.1",
+    "ts-node": "^8.4.1",
+    "typescript": "^3.6.3"
+  },
+  "typings": "typings/index.d.ts"
+}
diff --git a/node_modules/mathjs/examples/node_modules/commander/typings/index.d.ts b/node_modules/mathjs/examples/node_modules/commander/typings/index.d.ts
new file mode 100644
index 0000000..bcda277
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/commander/typings/index.d.ts
@@ -0,0 +1,310 @@
+// Type definitions for commander 2.11
+// Project: https://github.com/visionmedia/commander.js
+// Definitions by: Alan Agius <https://github.com/alan-agius4>, Marcelo Dezem <https://github.com/mdezem>, vvakame <https://github.com/vvakame>, Jules Randolph <https://github.com/sveinburne>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare namespace local {
+
+  class Option {
+    flags: string;
+    required: boolean;
+    optional: boolean;
+    bool: boolean;
+    short?: string;
+    long: string;
+    description: string;
+
+    /**
+     * Initialize a new `Option` with the given `flags` and `description`.
+     *
+     * @param {string} flags
+     * @param {string} [description]
+     */
+    constructor(flags: string, description?: string);
+  }
+
+  class Command extends NodeJS.EventEmitter {
+    [key: string]: any;
+
+    args: string[];
+
+    /**
+     * Initialize a new `Command`.
+     *
+     * @param {string} [name]
+     */
+    constructor(name?: string);
+
+    /**
+     * Set the program version to `str`.
+     *
+     * This method auto-registers the "-V, --version" flag
+     * which will print the version number when passed.
+     *
+     * @param {string} str
+     * @param {string} [flags]
+     * @returns {Command} for chaining
+     */
+    version(str: string, flags?: string): Command;
+
+    /**
+     * Add command `name`.
+     *
+     * The `.action()` callback is invoked when the
+     * command `name` is specified via __ARGV__,
+     * and the remaining arguments are applied to the
+     * function for access.
+     *
+     * When the `name` is "*" an un-matched command
+     * will be passed as the first arg, followed by
+     * the rest of __ARGV__ remaining.
+     *
+     * @example
+     *      program
+     *        .version('0.0.1')
+     *        .option('-C, --chdir <path>', 'change the working directory')
+     *        .option('-c, --config <path>', 'set config path. defaults to ./deploy.conf')
+     *        .option('-T, --no-tests', 'ignore test hook')
+     *
+     *      program
+     *        .command('setup')
+     *        .description('run remote setup commands')
+     *        .action(function() {
+     *          console.log('setup');
+     *        });
+     *
+     *      program
+     *        .command('exec <cmd>')
+     *        .description('run the given remote command')
+     *        .action(function(cmd) {
+     *          console.log('exec "%s"', cmd);
+     *        });
+     *
+     *      program
+     *        .command('teardown <dir> [otherDirs...]')
+     *        .description('run teardown commands')
+     *        .action(function(dir, otherDirs) {
+     *          console.log('dir "%s"', dir);
+     *          if (otherDirs) {
+     *            otherDirs.forEach(function (oDir) {
+     *              console.log('dir "%s"', oDir);
+     *            });
+     *          }
+     *        });
+     *
+     *      program
+     *        .command('*')
+     *        .description('deploy the given env')
+     *        .action(function(env) {
+     *          console.log('deploying "%s"', env);
+     *        });
+     *
+     *      program.parse(process.argv);
+     *
+     * @param {string} name
+     * @param {string} [desc] for git-style sub-commands
+     * @param {CommandOptions} [opts] command options
+     * @returns {Command} the new command
+     */
+    command(name: string, desc?: string, opts?: commander.CommandOptions): Command;
+
+    /**
+     * Define argument syntax for the top-level command.
+     *
+     * @param {string} desc
+     * @returns {Command} for chaining
+     */
+    arguments(desc: string): Command;
+
+    /**
+     * Parse expected `args`.
+     *
+     * For example `["[type]"]` becomes `[{ required: false, name: 'type' }]`.
+     *
+     * @param {string[]} args
+     * @returns {Command} for chaining
+     */
+    parseExpectedArgs(args: string[]): Command;
+
+    /**
+     * Register callback `fn` for the command.
+     *
+     * @example
+     *      program
+     *        .command('help')
+     *        .description('display verbose help')
+     *        .action(function() {
+     *           // output help here
+     *        });
+     *
+     * @param {(...args: any[]) => void} fn
+     * @returns {Command} for chaining
+     */
+    action(fn: (...args: any[]) => void): Command;
+
+    /**
+     * Define option with `flags`, `description` and optional
+     * coercion `fn`.
+     *
+     * The `flags` string should contain both the short and long flags,
+     * separated by comma, a pipe or space. The following are all valid
+     * all will output this way when `--help` is used.
+     *
+     *    "-p, --pepper"
+     *    "-p|--pepper"
+     *    "-p --pepper"
+     *
+     * @example
+     *     // simple boolean defaulting to false
+     *     program.option('-p, --pepper', 'add pepper');
+     *
+     *     --pepper
+     *     program.pepper
+     *     // => Boolean
+     *
+     *     // simple boolean defaulting to true
+     *     program.option('-C, --no-cheese', 'remove cheese');
+     *
+     *     program.cheese
+     *     // => true
+     *
+     *     --no-cheese
+     *     program.cheese
+     *     // => false
+     *
+     *     // required argument
+     *     program.option('-C, --chdir <path>', 'change the working directory');
+     *
+     *     --chdir /tmp
+     *     program.chdir
+     *     // => "/tmp"
+     *
+     *     // optional argument
+     *     program.option('-c, --cheese [type]', 'add cheese [marble]');
+     *
+     * @param {string} flags
+     * @param {string} [description]
+     * @param {((arg1: any, arg2: any) => void) | RegExp} [fn] function or default
+     * @param {*} [defaultValue]
+     * @returns {Command} for chaining
+     */
+    option(flags: string, description?: string, fn?: ((arg1: any, arg2: any) => void) | RegExp, defaultValue?: any): Command;
+    option(flags: string, description?: string, defaultValue?: any): Command;
+
+    /**
+     * Allow unknown options on the command line.
+     *
+     * @param {boolean} [arg] if `true` or omitted, no error will be thrown for unknown options.
+     * @returns {Command} for chaining
+     */
+    allowUnknownOption(arg?: boolean): Command;
+
+    /**
+     * Parse `argv`, settings options and invoking commands when defined.
+     *
+     * @param {string[]} argv
+     * @returns {Command} for chaining
+     */
+    parse(argv: string[]): Command;
+
+    /**
+     * Parse options from `argv` returning `argv` void of these options.
+     *
+     * @param {string[]} argv
+     * @returns {ParseOptionsResult}
+     */
+    parseOptions(argv: string[]): commander.ParseOptionsResult;
+
+    /**
+     * Return an object containing options as key-value pairs
+     *
+     * @returns {{[key: string]: any}}
+     */
+    opts(): { [key: string]: any };
+
+    /**
+     * Set the description to `str`.
+     *
+     * @param {string} str
+     * @param {{[argName: string]: string}} argsDescription
+     * @return {(Command | string)}
+     */
+    description(str: string, argsDescription?: {[argName: string]: string}): Command;
+    description(): string;
+
+    /**
+     * Set an alias for the command.
+     *
+     * @param {string} alias
+     * @return {(Command | string)}
+     */
+    alias(alias: string): Command;
+    alias(): string;
+
+    /**
+     * Set or get the command usage.
+     *
+     * @param {string} str
+     * @return {(Command | string)}
+     */
+    usage(str: string): Command;
+    usage(): string;
+
+    /**
+     * Set the name of the command.
+     *
+     * @param {string} str
+     * @return {Command}
+     */
+    name(str: string): Command;
+
+    /**
+     * Get the name of the command.
+     *
+     * @return {string}
+     */
+    name(): string;
+
+    /**
+     * Output help information for this command.
+     *
+     * @param {(str: string) => string} [cb]
+     */
+    outputHelp(cb?: (str: string) => string): void;
+
+    /** Output help information and exit.
+     *
+     * @param {(str: string) => string} [cb]
+     */
+    help(cb?: (str: string) => string): never;
+  }
+
+}
+
+declare namespace commander {
+
+    type Command = local.Command
+
+    type Option = local.Option
+
+    interface CommandOptions {
+        noHelp?: boolean;
+        isDefault?: boolean;
+    }
+
+    interface ParseOptionsResult {
+        args: string[];
+        unknown: string[];
+    }
+
+    interface CommanderStatic extends Command {
+        Command: typeof local.Command;
+        Option: typeof local.Option;
+        CommandOptions: CommandOptions;
+        ParseOptionsResult: ParseOptionsResult;
+    }
+
+}
+
+declare const commander: commander.CommanderStatic;
+export = commander;
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/cross-spawn/CHANGELOG.md
new file mode 100644
index 0000000..d07c9e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/CHANGELOG.md
@@ -0,0 +1,130 @@
+# Changelog
+
+All notable changes to this project will be documented in this file. See [standard-version](https://github.com/conventional-changelog/standard-version) for commit guidelines.
+
+### [7.0.3](https://github.com/moxystudio/node-cross-spawn/compare/v7.0.2...v7.0.3) (2020-05-25)
+
+
+### Bug Fixes
+
+* detect path key based on correct environment ([#133](https://github.com/moxystudio/node-cross-spawn/issues/133)) ([159e7e9](https://github.com/moxystudio/node-cross-spawn/commit/159e7e9785e57451cba034ae51719f97135074ae))
+
+### [7.0.2](https://github.com/moxystudio/node-cross-spawn/compare/v7.0.1...v7.0.2) (2020-04-04)
+
+
+### Bug Fixes
+
+* fix worker threads in Node >=11.10.0 ([#132](https://github.com/moxystudio/node-cross-spawn/issues/132)) ([6c5b4f0](https://github.com/moxystudio/node-cross-spawn/commit/6c5b4f015814a6c4f6b33230dfd1a860aedc0aaf))
+
+### [7.0.1](https://github.com/moxystudio/node-cross-spawn/compare/v7.0.0...v7.0.1) (2019-10-07)
+
+
+### Bug Fixes
+
+* **core:** support worker threads ([#127](https://github.com/moxystudio/node-cross-spawn/issues/127)) ([cfd49c9](https://github.com/moxystudio/node-cross-spawn/commit/cfd49c9))
+
+## [7.0.0](https://github.com/moxystudio/node-cross-spawn/compare/v6.0.5...v7.0.0) (2019-09-03)
+
+
+### ⚠ BREAKING CHANGES
+
+* drop support for Node.js < 8
+
+* drop support for versions below Node.js 8 ([#125](https://github.com/moxystudio/node-cross-spawn/issues/125)) ([16feb53](https://github.com/moxystudio/node-cross-spawn/commit/16feb53))
+
+<a name="6.0.5"></a>
+## [6.0.5](https://github.com/moxystudio/node-cross-spawn/compare/v6.0.4...v6.0.5) (2018-03-02)
+
+
+### Bug Fixes
+
+* avoid using deprecated Buffer constructor ([#94](https://github.com/moxystudio/node-cross-spawn/issues/94)) ([d5770df](https://github.com/moxystudio/node-cross-spawn/commit/d5770df)), closes [/nodejs.org/api/deprecations.html#deprecations_dep0005](https://github.com//nodejs.org/api/deprecations.html/issues/deprecations_dep0005)
+
+
+
+<a name="6.0.4"></a>
+## [6.0.4](https://github.com/moxystudio/node-cross-spawn/compare/v6.0.3...v6.0.4) (2018-01-31)
+
+
+### Bug Fixes
+
+* fix paths being incorrectly normalized on unix ([06ee3c6](https://github.com/moxystudio/node-cross-spawn/commit/06ee3c6)), closes [#90](https://github.com/moxystudio/node-cross-spawn/issues/90)
+
+
+
+<a name="6.0.3"></a>
+## [6.0.3](https://github.com/moxystudio/node-cross-spawn/compare/v6.0.2...v6.0.3) (2018-01-23)
+
+
+
+<a name="6.0.2"></a>
+## [6.0.2](https://github.com/moxystudio/node-cross-spawn/compare/v6.0.1...v6.0.2) (2018-01-23)
+
+
+
+<a name="6.0.1"></a>
+## [6.0.1](https://github.com/moxystudio/node-cross-spawn/compare/v6.0.0...v6.0.1) (2018-01-23)
+
+
+
+<a name="6.0.0"></a>
+# [6.0.0](https://github.com/moxystudio/node-cross-spawn/compare/5.1.0...6.0.0) (2018-01-23)
+
+
+### Bug Fixes
+
+* fix certain arguments not being correctly escaped or causing batch syntax error ([900cf10](https://github.com/moxystudio/node-cross-spawn/commit/900cf10)), closes [#82](https://github.com/moxystudio/node-cross-spawn/issues/82) [#51](https://github.com/moxystudio/node-cross-spawn/issues/51)
+* fix commands as posix relatixe paths not working correctly, e.g.: `./my-command` ([900cf10](https://github.com/moxystudio/node-cross-spawn/commit/900cf10))
+* fix `options` argument being mutated ([900cf10](https://github.com/moxystudio/node-cross-spawn/commit/900cf10))
+* fix commands resolution when PATH was actually Path ([900cf10](https://github.com/moxystudio/node-cross-spawn/commit/900cf10))
+
+
+### Features
+
+* improve compliance with node's ENOENT errors ([900cf10](https://github.com/moxystudio/node-cross-spawn/commit/900cf10))
+* improve detection of node's shell option support ([900cf10](https://github.com/moxystudio/node-cross-spawn/commit/900cf10))
+
+
+### Chores
+
+* upgrade tooling
+* upgrate project to es6 (node v4)
+
+
+### BREAKING CHANGES
+
+* remove support for older nodejs versions, only `node >= 4` is supported
+
+
+<a name="5.1.0"></a>
+## [5.1.0](https://github.com/moxystudio/node-cross-spawn/compare/5.0.1...5.1.0) (2017-02-26)
+
+
+### Bug Fixes
+
+* fix `options.shell` support for NodeJS [v4.8](https://github.com/nodejs/node/blob/master/doc/changelogs/CHANGELOG_V4.md#4.8.0)
+
+
+<a name="5.0.1"></a>
+## [5.0.1](https://github.com/moxystudio/node-cross-spawn/compare/5.0.0...5.0.1) (2016-11-04)
+
+
+### Bug Fixes
+
+* fix `options.shell` support for NodeJS v7
+
+
+<a name="5.0.0"></a>
+# [5.0.0](https://github.com/moxystudio/node-cross-spawn/compare/4.0.2...5.0.0) (2016-10-30)
+
+
+## Features
+
+* add support for `options.shell`
+* improve parsing of shebangs by using [`shebang-command`](https://github.com/kevva/shebang-command) module
+
+
+## Chores
+
+* refactor some code to make it more clear
+* update README caveats
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/LICENSE b/node_modules/mathjs/examples/node_modules/cross-spawn/LICENSE
new file mode 100644
index 0000000..8407b9a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2018 Made With MOXY Lda <hello@moxy.studio>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/README.md b/node_modules/mathjs/examples/node_modules/cross-spawn/README.md
new file mode 100644
index 0000000..c4a4da8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/README.md
@@ -0,0 +1,96 @@
+# cross-spawn
+
+[![NPM version][npm-image]][npm-url] [![Downloads][downloads-image]][npm-url] [![Build Status][travis-image]][travis-url] [![Build status][appveyor-image]][appveyor-url] [![Coverage Status][codecov-image]][codecov-url] [![Dependency status][david-dm-image]][david-dm-url] [![Dev Dependency status][david-dm-dev-image]][david-dm-dev-url]
+
+[npm-url]:https://npmjs.org/package/cross-spawn
+[downloads-image]:https://img.shields.io/npm/dm/cross-spawn.svg
+[npm-image]:https://img.shields.io/npm/v/cross-spawn.svg
+[travis-url]:https://travis-ci.org/moxystudio/node-cross-spawn
+[travis-image]:https://img.shields.io/travis/moxystudio/node-cross-spawn/master.svg
+[appveyor-url]:https://ci.appveyor.com/project/satazor/node-cross-spawn
+[appveyor-image]:https://img.shields.io/appveyor/ci/satazor/node-cross-spawn/master.svg
+[codecov-url]:https://codecov.io/gh/moxystudio/node-cross-spawn
+[codecov-image]:https://img.shields.io/codecov/c/github/moxystudio/node-cross-spawn/master.svg
+[david-dm-url]:https://david-dm.org/moxystudio/node-cross-spawn
+[david-dm-image]:https://img.shields.io/david/moxystudio/node-cross-spawn.svg
+[david-dm-dev-url]:https://david-dm.org/moxystudio/node-cross-spawn?type=dev
+[david-dm-dev-image]:https://img.shields.io/david/dev/moxystudio/node-cross-spawn.svg
+
+A cross platform solution to node's spawn and spawnSync.
+
+
+## Installation
+
+Node.js version 8 and up:
+`$ npm install cross-spawn`
+
+Node.js version 7 and under:
+`$ npm install cross-spawn@6`
+
+## Why
+
+Node has issues when using spawn on Windows:
+
+- It ignores [PATHEXT](https://github.com/joyent/node/issues/2318)
+- It does not support [shebangs](https://en.wikipedia.org/wiki/Shebang_(Unix))
+- Has problems running commands with [spaces](https://github.com/nodejs/node/issues/7367)
+- Has problems running commands with posix relative paths (e.g.: `./my-folder/my-executable`)
+- Has an [issue](https://github.com/moxystudio/node-cross-spawn/issues/82) with command shims (files in `node_modules/.bin/`), where arguments with quotes and parenthesis would result in [invalid syntax error](https://github.com/moxystudio/node-cross-spawn/blob/e77b8f22a416db46b6196767bcd35601d7e11d54/test/index.test.js#L149)
+- No `options.shell` support on node `<v4.8`
+
+All these issues are handled correctly by `cross-spawn`.
+There are some known modules, such as [win-spawn](https://github.com/ForbesLindesay/win-spawn), that try to solve this but they are either broken or provide faulty escaping of shell arguments.
+
+
+## Usage
+
+Exactly the same way as node's [`spawn`](https://nodejs.org/api/child_process.html#child_process_child_process_spawn_command_args_options) or [`spawnSync`](https://nodejs.org/api/child_process.html#child_process_child_process_spawnsync_command_args_options), so it's a drop in replacement.
+
+
+```js
+const spawn = require('cross-spawn');
+
+// Spawn NPM asynchronously
+const child = spawn('npm', ['list', '-g', '-depth', '0'], { stdio: 'inherit' });
+
+// Spawn NPM synchronously
+const result = spawn.sync('npm', ['list', '-g', '-depth', '0'], { stdio: 'inherit' });
+```
+
+
+## Caveats
+
+### Using `options.shell` as an alternative to `cross-spawn`
+
+Starting from node `v4.8`, `spawn` has a `shell` option that allows you run commands from within a shell. This new option solves
+the [PATHEXT](https://github.com/joyent/node/issues/2318) issue but:
+
+- It's not supported in node `<v4.8`
+- You must manually escape the command and arguments which is very error prone, specially when passing user input
+- There are a lot of other unresolved issues from the [Why](#why) section that you must take into account
+
+If you are using the `shell` option to spawn a command in a cross platform way, consider using `cross-spawn` instead. You have been warned.
+
+### `options.shell` support
+
+While `cross-spawn` adds support for `options.shell` in node `<v4.8`, all of its enhancements are disabled.
+
+This mimics the Node.js behavior. More specifically, the command and its arguments will not be automatically escaped nor shebang support will be offered. This is by design because if you are using `options.shell` you are probably targeting a specific platform anyway and you don't want things to get into your way.
+
+### Shebangs support
+
+While `cross-spawn` handles shebangs on Windows, its support is limited. More specifically, it just supports `#!/usr/bin/env <program>` where `<program>` must not contain any arguments.   
+If you would like to have the shebang support improved, feel free to contribute via a pull-request.
+
+Remember to always test your code on Windows!
+
+
+## Tests
+
+`$ npm test`   
+`$ npm test -- --watch` during development
+
+
+## License
+
+Released under the [MIT License](https://www.opensource.org/licenses/mit-license.php).
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/index.js b/node_modules/mathjs/examples/node_modules/cross-spawn/index.js
new file mode 100644
index 0000000..5509742
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/index.js
@@ -0,0 +1,39 @@
+'use strict';
+
+const cp = require('child_process');
+const parse = require('./lib/parse');
+const enoent = require('./lib/enoent');
+
+function spawn(command, args, options) {
+    // Parse the arguments
+    const parsed = parse(command, args, options);
+
+    // Spawn the child process
+    const spawned = cp.spawn(parsed.command, parsed.args, parsed.options);
+
+    // Hook into child process "exit" event to emit an error if the command
+    // does not exists, see: https://github.com/IndigoUnited/node-cross-spawn/issues/16
+    enoent.hookChildProcess(spawned, parsed);
+
+    return spawned;
+}
+
+function spawnSync(command, args, options) {
+    // Parse the arguments
+    const parsed = parse(command, args, options);
+
+    // Spawn the child process
+    const result = cp.spawnSync(parsed.command, parsed.args, parsed.options);
+
+    // Analyze if the command does not exist, see: https://github.com/IndigoUnited/node-cross-spawn/issues/16
+    result.error = result.error || enoent.verifyENOENTSync(result.status, parsed);
+
+    return result;
+}
+
+module.exports = spawn;
+module.exports.spawn = spawn;
+module.exports.sync = spawnSync;
+
+module.exports._parse = parse;
+module.exports._enoent = enoent;
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/lib/enoent.js b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/enoent.js
new file mode 100644
index 0000000..14df9b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/enoent.js
@@ -0,0 +1,59 @@
+'use strict';
+
+const isWin = process.platform === 'win32';
+
+function notFoundError(original, syscall) {
+    return Object.assign(new Error(`${syscall} ${original.command} ENOENT`), {
+        code: 'ENOENT',
+        errno: 'ENOENT',
+        syscall: `${syscall} ${original.command}`,
+        path: original.command,
+        spawnargs: original.args,
+    });
+}
+
+function hookChildProcess(cp, parsed) {
+    if (!isWin) {
+        return;
+    }
+
+    const originalEmit = cp.emit;
+
+    cp.emit = function (name, arg1) {
+        // If emitting "exit" event and exit code is 1, we need to check if
+        // the command exists and emit an "error" instead
+        // See https://github.com/IndigoUnited/node-cross-spawn/issues/16
+        if (name === 'exit') {
+            const err = verifyENOENT(arg1, parsed, 'spawn');
+
+            if (err) {
+                return originalEmit.call(cp, 'error', err);
+            }
+        }
+
+        return originalEmit.apply(cp, arguments); // eslint-disable-line prefer-rest-params
+    };
+}
+
+function verifyENOENT(status, parsed) {
+    if (isWin && status === 1 && !parsed.file) {
+        return notFoundError(parsed.original, 'spawn');
+    }
+
+    return null;
+}
+
+function verifyENOENTSync(status, parsed) {
+    if (isWin && status === 1 && !parsed.file) {
+        return notFoundError(parsed.original, 'spawnSync');
+    }
+
+    return null;
+}
+
+module.exports = {
+    hookChildProcess,
+    verifyENOENT,
+    verifyENOENTSync,
+    notFoundError,
+};
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/lib/parse.js b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/parse.js
new file mode 100644
index 0000000..0129d74
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/parse.js
@@ -0,0 +1,91 @@
+'use strict';
+
+const path = require('path');
+const resolveCommand = require('./util/resolveCommand');
+const escape = require('./util/escape');
+const readShebang = require('./util/readShebang');
+
+const isWin = process.platform === 'win32';
+const isExecutableRegExp = /\.(?:com|exe)$/i;
+const isCmdShimRegExp = /node_modules[\\/].bin[\\/][^\\/]+\.cmd$/i;
+
+function detectShebang(parsed) {
+    parsed.file = resolveCommand(parsed);
+
+    const shebang = parsed.file && readShebang(parsed.file);
+
+    if (shebang) {
+        parsed.args.unshift(parsed.file);
+        parsed.command = shebang;
+
+        return resolveCommand(parsed);
+    }
+
+    return parsed.file;
+}
+
+function parseNonShell(parsed) {
+    if (!isWin) {
+        return parsed;
+    }
+
+    // Detect & add support for shebangs
+    const commandFile = detectShebang(parsed);
+
+    // We don't need a shell if the command filename is an executable
+    const needsShell = !isExecutableRegExp.test(commandFile);
+
+    // If a shell is required, use cmd.exe and take care of escaping everything correctly
+    // Note that `forceShell` is an hidden option used only in tests
+    if (parsed.options.forceShell || needsShell) {
+        // Need to double escape meta chars if the command is a cmd-shim located in `node_modules/.bin/`
+        // The cmd-shim simply calls execute the package bin file with NodeJS, proxying any argument
+        // Because the escape of metachars with ^ gets interpreted when the cmd.exe is first called,
+        // we need to double escape them
+        const needsDoubleEscapeMetaChars = isCmdShimRegExp.test(commandFile);
+
+        // Normalize posix paths into OS compatible paths (e.g.: foo/bar -> foo\bar)
+        // This is necessary otherwise it will always fail with ENOENT in those cases
+        parsed.command = path.normalize(parsed.command);
+
+        // Escape command & arguments
+        parsed.command = escape.command(parsed.command);
+        parsed.args = parsed.args.map((arg) => escape.argument(arg, needsDoubleEscapeMetaChars));
+
+        const shellCommand = [parsed.command].concat(parsed.args).join(' ');
+
+        parsed.args = ['/d', '/s', '/c', `"${shellCommand}"`];
+        parsed.command = process.env.comspec || 'cmd.exe';
+        parsed.options.windowsVerbatimArguments = true; // Tell node's spawn that the arguments are already escaped
+    }
+
+    return parsed;
+}
+
+function parse(command, args, options) {
+    // Normalize arguments, similar to nodejs
+    if (args && !Array.isArray(args)) {
+        options = args;
+        args = null;
+    }
+
+    args = args ? args.slice(0) : []; // Clone array to avoid changing the original
+    options = Object.assign({}, options); // Clone object to avoid changing the original
+
+    // Build our parsed object
+    const parsed = {
+        command,
+        args,
+        options,
+        file: undefined,
+        original: {
+            command,
+            args,
+        },
+    };
+
+    // Delegate further parsing to shell or non-shell
+    return options.shell ? parsed : parseNonShell(parsed);
+}
+
+module.exports = parse;
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/escape.js b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/escape.js
new file mode 100644
index 0000000..b0bb84c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/escape.js
@@ -0,0 +1,45 @@
+'use strict';
+
+// See http://www.robvanderwoude.com/escapechars.php
+const metaCharsRegExp = /([()\][%!^"`<>&|;, *?])/g;
+
+function escapeCommand(arg) {
+    // Escape meta chars
+    arg = arg.replace(metaCharsRegExp, '^$1');
+
+    return arg;
+}
+
+function escapeArgument(arg, doubleEscapeMetaChars) {
+    // Convert to string
+    arg = `${arg}`;
+
+    // Algorithm below is based on https://qntm.org/cmd
+
+    // Sequence of backslashes followed by a double quote:
+    // double up all the backslashes and escape the double quote
+    arg = arg.replace(/(\\*)"/g, '$1$1\\"');
+
+    // Sequence of backslashes followed by the end of the string
+    // (which will become a double quote later):
+    // double up all the backslashes
+    arg = arg.replace(/(\\*)$/, '$1$1');
+
+    // All other backslashes occur literally
+
+    // Quote the whole thing:
+    arg = `"${arg}"`;
+
+    // Escape meta chars
+    arg = arg.replace(metaCharsRegExp, '^$1');
+
+    // Double escape meta chars if necessary
+    if (doubleEscapeMetaChars) {
+        arg = arg.replace(metaCharsRegExp, '^$1');
+    }
+
+    return arg;
+}
+
+module.exports.command = escapeCommand;
+module.exports.argument = escapeArgument;
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/readShebang.js b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/readShebang.js
new file mode 100644
index 0000000..5e83733
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/readShebang.js
@@ -0,0 +1,23 @@
+'use strict';
+
+const fs = require('fs');
+const shebangCommand = require('shebang-command');
+
+function readShebang(command) {
+    // Read the first 150 bytes from the file
+    const size = 150;
+    const buffer = Buffer.alloc(size);
+
+    let fd;
+
+    try {
+        fd = fs.openSync(command, 'r');
+        fs.readSync(fd, buffer, 0, size, 0);
+        fs.closeSync(fd);
+    } catch (e) { /* Empty */ }
+
+    // Attempt to extract shebang (null is returned if not a shebang)
+    return shebangCommand(buffer.toString());
+}
+
+module.exports = readShebang;
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/resolveCommand.js b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/resolveCommand.js
new file mode 100644
index 0000000..7972455
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/lib/util/resolveCommand.js
@@ -0,0 +1,52 @@
+'use strict';
+
+const path = require('path');
+const which = require('which');
+const getPathKey = require('path-key');
+
+function resolveCommandAttempt(parsed, withoutPathExt) {
+    const env = parsed.options.env || process.env;
+    const cwd = process.cwd();
+    const hasCustomCwd = parsed.options.cwd != null;
+    // Worker threads do not have process.chdir()
+    const shouldSwitchCwd = hasCustomCwd && process.chdir !== undefined && !process.chdir.disabled;
+
+    // If a custom `cwd` was specified, we need to change the process cwd
+    // because `which` will do stat calls but does not support a custom cwd
+    if (shouldSwitchCwd) {
+        try {
+            process.chdir(parsed.options.cwd);
+        } catch (err) {
+            /* Empty */
+        }
+    }
+
+    let resolved;
+
+    try {
+        resolved = which.sync(parsed.command, {
+            path: env[getPathKey({ env })],
+            pathExt: withoutPathExt ? path.delimiter : undefined,
+        });
+    } catch (e) {
+        /* Empty */
+    } finally {
+        if (shouldSwitchCwd) {
+            process.chdir(cwd);
+        }
+    }
+
+    // If we successfully resolved, ensure that an absolute path is returned
+    // Note that when a custom `cwd` was used, we need to resolve to an absolute path based on it
+    if (resolved) {
+        resolved = path.resolve(hasCustomCwd ? parsed.options.cwd : '', resolved);
+    }
+
+    return resolved;
+}
+
+function resolveCommand(parsed) {
+    return resolveCommandAttempt(parsed) || resolveCommandAttempt(parsed, true);
+}
+
+module.exports = resolveCommand;
diff --git a/node_modules/mathjs/examples/node_modules/cross-spawn/package.json b/node_modules/mathjs/examples/node_modules/cross-spawn/package.json
new file mode 100644
index 0000000..232ff97
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/cross-spawn/package.json
@@ -0,0 +1,73 @@
+{
+  "name": "cross-spawn",
+  "version": "7.0.3",
+  "description": "Cross platform child_process#spawn and child_process#spawnSync",
+  "keywords": [
+    "spawn",
+    "spawnSync",
+    "windows",
+    "cross-platform",
+    "path-ext",
+    "shebang",
+    "cmd",
+    "execute"
+  ],
+  "author": "André Cruz <andre@moxy.studio>",
+  "homepage": "https://github.com/moxystudio/node-cross-spawn",
+  "repository": {
+    "type": "git",
+    "url": "git@github.com:moxystudio/node-cross-spawn.git"
+  },
+  "license": "MIT",
+  "main": "index.js",
+  "files": [
+    "lib"
+  ],
+  "scripts": {
+    "lint": "eslint .",
+    "test": "jest --env node --coverage",
+    "prerelease": "npm t && npm run lint",
+    "release": "standard-version",
+    "postrelease": "git push --follow-tags origin HEAD && npm publish"
+  },
+  "husky": {
+    "hooks": {
+      "commit-msg": "commitlint -E HUSKY_GIT_PARAMS",
+      "pre-commit": "lint-staged"
+    }
+  },
+  "lint-staged": {
+    "*.js": [
+      "eslint --fix",
+      "git add"
+    ]
+  },
+  "commitlint": {
+    "extends": [
+      "@commitlint/config-conventional"
+    ]
+  },
+  "dependencies": {
+    "path-key": "^3.1.0",
+    "shebang-command": "^2.0.0",
+    "which": "^2.0.1"
+  },
+  "devDependencies": {
+    "@commitlint/cli": "^8.1.0",
+    "@commitlint/config-conventional": "^8.1.0",
+    "babel-core": "^6.26.3",
+    "babel-jest": "^24.9.0",
+    "babel-preset-moxy": "^3.1.0",
+    "eslint": "^5.16.0",
+    "eslint-config-moxy": "^7.1.0",
+    "husky": "^3.0.5",
+    "jest": "^24.9.0",
+    "lint-staged": "^9.2.5",
+    "mkdirp": "^0.5.1",
+    "rimraf": "^3.0.0",
+    "standard-version": "^7.0.0"
+  },
+  "engines": {
+    "node": ">= 8"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/electron-to-chromium/CHANGELOG.md
new file mode 100644
index 0000000..1669c34
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/CHANGELOG.md
@@ -0,0 +1,14 @@
+v1.3.0
+  * Additionally include chromium to electron mappings
+
+v1.2.0
+  * versions and full-versions are now separately importable.
+
+v1.1.0
+  * Both electronToChromium and electronToBrowserList now can accept strings as well as numbers.
+
+v1.0.1
+  Update documentation
+
+v1.0.0
+  Inititial release
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/LICENSE b/node_modules/mathjs/examples/node_modules/electron-to-chromium/LICENSE
new file mode 100644
index 0000000..6c7b614
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/LICENSE
@@ -0,0 +1,5 @@
+Copyright 2018 Kilian Valkhof
+
+Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/README.md b/node_modules/mathjs/examples/node_modules/electron-to-chromium/README.md
new file mode 100644
index 0000000..a96ddf1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/README.md
@@ -0,0 +1,186 @@
+### Made by [@kilianvalkhof](https://twitter.com/kilianvalkhof)
+
+#### Other projects:
+
+- 💻 [Polypane](https://polypane.app) - Develop responsive websites and apps twice as fast on multiple screens at once
+- 🖌️ [Superposition](https://superposition.design) - Kickstart your design system by extracting design tokens from your website
+- 🗒️ [FromScratch](https://fromscratch.rocks) - A smart but simple autosaving scratchpad
+
+---
+
+# Electron-to-Chromium [![npm](https://img.shields.io/npm/v/electron-to-chromium.svg)](https://www.npmjs.com/package/electron-to-chromium) [![travis](https://img.shields.io/travis/Kilian/electron-to-chromium/master.svg)](https://travis-ci.org/Kilian/electron-to-chromium) [![npm-downloads](https://img.shields.io/npm/dm/electron-to-chromium.svg)](https://www.npmjs.com/package/electron-to-chromium) [![codecov](https://codecov.io/gh/Kilian/electron-to-chromium/branch/master/graph/badge.svg)](https://codecov.io/gh/Kilian/electron-to-chromium)[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2FKilian%2Felectron-to-chromium.svg?type=shield)](https://app.fossa.io/projects/git%2Bgithub.com%2FKilian%2Felectron-to-chromium?ref=badge_shield)
+
+This repository provides a mapping of Electron versions to the Chromium version that it uses.
+
+This package is used in [Browserslist](https://github.com/ai/browserslist), so you can use e.g. `electron >= 1.4` in [Autoprefixer](https://github.com/postcss/autoprefixer), [Stylelint](https://github.com/stylelint/stylelint), [babel-preset-env](https://github.com/babel/babel-preset-env) and [eslint-plugin-compat](https://github.com/amilajack/eslint-plugin-compat).
+
+**Supported by:**
+
+  <a href="https://m.do.co/c/bb22ea58e765">
+    <img src="https://opensource.nyc3.cdn.digitaloceanspaces.com/attribution/assets/SVG/DO_Logo_horizontal_blue.svg" width="201px">
+  </a>
+
+
+## Install
+Install using `npm install electron-to-chromium`.
+
+## Usage
+To include Electron-to-Chromium, require it:
+
+```js
+var e2c = require('electron-to-chromium');
+```
+
+### Properties
+The Electron-to-Chromium object has 4 properties to use:
+
+#### `versions`
+An object of key-value pairs with a _major_ Electron version as the key, and the corresponding major Chromium version as the value.
+
+```js
+var versions = e2c.versions;
+console.log(versions['1.4']);
+// returns "53"
+```
+
+#### `fullVersions`
+An object of key-value pairs with a Electron version as the key, and the corresponding full Chromium version as the value.
+
+```js
+var versions = e2c.fullVersions;
+console.log(versions['1.4.11']);
+// returns "53.0.2785.143"
+```
+
+#### `chromiumVersions`
+An object of key-value pairs with a _major_ Chromium version as the key, and the corresponding major Electron version as the value.
+
+```js
+var versions = e2c.chromiumVersions;
+console.log(versions['54']);
+// returns "1.4"
+```
+
+#### `fullChromiumVersions`
+An object of key-value pairs with a Chromium version as the key, and an array of the corresponding major Electron versions as the value.
+
+```js
+var versions = e2c.fullChromiumVersions;
+console.log(versions['54.0.2840.101']);
+// returns ["1.5.1", "1.5.0"]
+```
+### Functions
+
+#### `electronToChromium(query)`
+Arguments:
+* Query: string or number, required. A major or full Electron version.
+
+A function that returns the corresponding Chromium version for a given Electron function. Returns a string.
+
+If you provide it with a major Electron version, it will return a major Chromium version:
+
+```js
+var chromeVersion = e2c.electronToChromium('1.4');
+// chromeVersion is "53"
+```
+
+If you provide it with a full Electron version, it will return the full Chromium version.
+
+```js
+var chromeVersion = e2c.electronToChromium('1.4.11');
+// chromeVersion is "53.0.2785.143"
+```
+
+If a query does not match a Chromium version, it will return `undefined`.
+
+```js
+var chromeVersion = e2c.electronToChromium('9000');
+// chromeVersion is undefined
+```
+
+#### `chromiumToElectron(query)`
+Arguments:
+* Query: string or number, required. A major or full Chromium version.
+
+Returns a string with the corresponding Electron version for a given Chromium query.
+
+If you provide it with a major Chromium version, it will return a major Electron version:
+
+```js
+var electronVersion = e2c.chromiumToElectron('54');
+// electronVersion is "1.4"
+```
+
+If you provide it with a full Chrome version, it will return an array of full Electron versions.
+
+```js
+var electronVersions = e2c.chromiumToElectron('56.0.2924.87');
+// electronVersions is ["1.6.3", "1.6.2", "1.6.1", "1.6.0"]
+```
+
+If a query does not match an Electron version, it will return `undefined`.
+
+```js
+var electronVersion = e2c.chromiumToElectron('10');
+// electronVersion is undefined
+```
+
+#### `electronToBrowserList(query)` **DEPRECATED**
+Arguments:
+* Query: string or number, required. A major Electron version.
+
+_**Deprecated**: Browserlist already includes electron-to-chromium._
+
+A function that returns a [Browserslist](https://github.com/ai/browserslist) query that matches the given major Electron version. Returns a string.
+
+If you provide it with a major Electron version, it will return a Browserlist query string that matches the Chromium capabilities:
+
+```js
+var query = e2c.electronToBrowserList('1.4');
+// query is "Chrome >= 53"
+```
+
+If a query does not match a Chromium version, it will return `undefined`.
+
+```js
+var query = e2c.electronToBrowserList('9000');
+// query is undefined
+```
+
+### Importing just versions, fullVersions, chromiumVersions and fullChromiumVersions
+All lists can be imported on their own, if file size is a concern.
+
+#### `versions`
+
+```js
+var versions = require('electron-to-chromium/versions');
+```
+
+#### `fullVersions`
+
+```js
+var fullVersions = require('electron-to-chromium/full-versions');
+```
+
+#### `chromiumVersions`
+
+```js
+var chromiumVersions = require('electron-to-chromium/chromium-versions');
+```
+
+#### `fullChromiumVersions`
+
+```js
+var fullChromiumVersions = require('electron-to-chromium/full-chromium-versions');
+```
+
+## Updating
+This package will be updated with each new Electron release.
+
+To update the list, run `npm run build.js`. Requires internet access as it downloads from the canonical list of Electron versions.
+
+To verify correct behaviour, run `npm test`.
+
+
+## License
+[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2FKilian%2Felectron-to-chromium.svg?type=large)](https://app.fossa.io/projects/git%2Bgithub.com%2FKilian%2Felectron-to-chromium?ref=badge_large)
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/chromium-versions.js b/node_modules/mathjs/examples/node_modules/electron-to-chromium/chromium-versions.js
new file mode 100644
index 0000000..590b2d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/chromium-versions.js
@@ -0,0 +1,45 @@
+module.exports = {
+	"39": "0.20",
+	"40": "0.21",
+	"41": "0.21",
+	"42": "0.25",
+	"43": "0.27",
+	"44": "0.30",
+	"45": "0.31",
+	"47": "0.36",
+	"49": "0.37",
+	"50": "1.1",
+	"51": "1.2",
+	"52": "1.3",
+	"53": "1.4",
+	"54": "1.4",
+	"56": "1.6",
+	"58": "1.7",
+	"59": "1.8",
+	"61": "2.0",
+	"66": "3.0",
+	"69": "4.0",
+	"72": "5.0",
+	"73": "5.0",
+	"76": "6.0",
+	"78": "7.0",
+	"79": "8.0",
+	"80": "8.0",
+	"82": "9.0",
+	"83": "9.0",
+	"84": "10.0",
+	"85": "10.0",
+	"86": "11.0",
+	"87": "11.0",
+	"89": "12.0",
+	"90": "13.0",
+	"91": "13.0",
+	"92": "14.0",
+	"93": "14.0",
+	"94": "15.0",
+	"95": "16.0",
+	"96": "16.0",
+	"98": "17.0",
+	"99": "18.0",
+	"100": "18.0"
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/chromium-versions.json b/node_modules/mathjs/examples/node_modules/electron-to-chromium/chromium-versions.json
new file mode 100644
index 0000000..cb99e21
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/chromium-versions.json
@@ -0,0 +1 @@
+{"39":"0.20","40":"0.21","41":"0.21","42":"0.25","43":"0.27","44":"0.30","45":"0.31","47":"0.36","49":"0.37","50":"1.1","51":"1.2","52":"1.3","53":"1.4","54":"1.4","56":"1.6","58":"1.7","59":"1.8","61":"2.0","66":"3.0","69":"4.0","72":"5.0","73":"5.0","76":"6.0","78":"7.0","79":"8.0","80":"8.0","82":"9.0","83":"9.0","84":"10.0","85":"10.0","86":"11.0","87":"11.0","89":"12.0","90":"13.0","91":"13.0","92":"14.0","93":"14.0","94":"15.0","95":"16.0","96":"16.0","98":"17.0","99":"18.0","100":"18.0"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-chromium-versions.js b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-chromium-versions.js
new file mode 100644
index 0000000..2c6f278
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-chromium-versions.js
@@ -0,0 +1,1833 @@
+module.exports = {
+	"39.0.2171.65": [
+		"0.20.0",
+		"0.20.1",
+		"0.20.2",
+		"0.20.3",
+		"0.20.4",
+		"0.20.5",
+		"0.20.6",
+		"0.20.7",
+		"0.20.8"
+	],
+	"40.0.2214.91": [
+		"0.21.0",
+		"0.21.1",
+		"0.21.2"
+	],
+	"41.0.2272.76": [
+		"0.21.3",
+		"0.22.1",
+		"0.22.2",
+		"0.22.3",
+		"0.23.0",
+		"0.24.0"
+	],
+	"42.0.2311.107": [
+		"0.25.0",
+		"0.25.1",
+		"0.25.2",
+		"0.25.3",
+		"0.26.0",
+		"0.26.1",
+		"0.27.0",
+		"0.27.1"
+	],
+	"43.0.2357.65": [
+		"0.27.2",
+		"0.27.3",
+		"0.28.0",
+		"0.28.1",
+		"0.28.2",
+		"0.28.3",
+		"0.29.1",
+		"0.29.2"
+	],
+	"44.0.2403.125": [
+		"0.30.4",
+		"0.31.0"
+	],
+	"45.0.2454.85": [
+		"0.31.2",
+		"0.32.2",
+		"0.32.3",
+		"0.33.0",
+		"0.33.1",
+		"0.33.2",
+		"0.33.3",
+		"0.33.4",
+		"0.33.6",
+		"0.33.7",
+		"0.33.8",
+		"0.33.9",
+		"0.34.0",
+		"0.34.1",
+		"0.34.2",
+		"0.34.3",
+		"0.34.4",
+		"0.35.1",
+		"0.35.2",
+		"0.35.3",
+		"0.35.4",
+		"0.35.5"
+	],
+	"47.0.2526.73": [
+		"0.36.0",
+		"0.36.2",
+		"0.36.3",
+		"0.36.4"
+	],
+	"47.0.2526.110": [
+		"0.36.5",
+		"0.36.6",
+		"0.36.7",
+		"0.36.8",
+		"0.36.9",
+		"0.36.10",
+		"0.36.11",
+		"0.36.12"
+	],
+	"49.0.2623.75": [
+		"0.37.0",
+		"0.37.1",
+		"0.37.3",
+		"0.37.4",
+		"0.37.5",
+		"0.37.6",
+		"0.37.7",
+		"0.37.8",
+		"1.0.0",
+		"1.0.1",
+		"1.0.2"
+	],
+	"50.0.2661.102": [
+		"1.1.0",
+		"1.1.1",
+		"1.1.2",
+		"1.1.3"
+	],
+	"51.0.2704.63": [
+		"1.2.0",
+		"1.2.1"
+	],
+	"51.0.2704.84": [
+		"1.2.2",
+		"1.2.3"
+	],
+	"51.0.2704.103": [
+		"1.2.4",
+		"1.2.5"
+	],
+	"51.0.2704.106": [
+		"1.2.6",
+		"1.2.7",
+		"1.2.8"
+	],
+	"52.0.2743.82": [
+		"1.3.0",
+		"1.3.1",
+		"1.3.2",
+		"1.3.3",
+		"1.3.4",
+		"1.3.5",
+		"1.3.6",
+		"1.3.7",
+		"1.3.9",
+		"1.3.10",
+		"1.3.13",
+		"1.3.14",
+		"1.3.15"
+	],
+	"53.0.2785.113": [
+		"1.4.0",
+		"1.4.1",
+		"1.4.2",
+		"1.4.3",
+		"1.4.4",
+		"1.4.5"
+	],
+	"53.0.2785.143": [
+		"1.4.6",
+		"1.4.7",
+		"1.4.8",
+		"1.4.10",
+		"1.4.11",
+		"1.4.13",
+		"1.4.14",
+		"1.4.15",
+		"1.4.16"
+	],
+	"54.0.2840.51": [
+		"1.4.12"
+	],
+	"54.0.2840.101": [
+		"1.5.0",
+		"1.5.1"
+	],
+	"56.0.2924.87": [
+		"1.6.0",
+		"1.6.1",
+		"1.6.2",
+		"1.6.3",
+		"1.6.4",
+		"1.6.5",
+		"1.6.6",
+		"1.6.7",
+		"1.6.8",
+		"1.6.9",
+		"1.6.10",
+		"1.6.11",
+		"1.6.12",
+		"1.6.13",
+		"1.6.14",
+		"1.6.15",
+		"1.6.16",
+		"1.6.17",
+		"1.6.18"
+	],
+	"58.0.3029.110": [
+		"1.7.0",
+		"1.7.1",
+		"1.7.2",
+		"1.7.3",
+		"1.7.4",
+		"1.7.5",
+		"1.7.6",
+		"1.7.7",
+		"1.7.8",
+		"1.7.9",
+		"1.7.10",
+		"1.7.11",
+		"1.7.12",
+		"1.7.13",
+		"1.7.14",
+		"1.7.15",
+		"1.7.16"
+	],
+	"59.0.3071.115": [
+		"1.8.0",
+		"1.8.1",
+		"1.8.2-beta.1",
+		"1.8.2-beta.2",
+		"1.8.2-beta.3",
+		"1.8.2-beta.4",
+		"1.8.2-beta.5",
+		"1.8.2",
+		"1.8.3",
+		"1.8.4",
+		"1.8.5",
+		"1.8.6",
+		"1.8.7",
+		"1.8.8"
+	],
+	"61.0.3163.100": [
+		"2.0.0-beta.1",
+		"2.0.0-beta.2",
+		"2.0.0-beta.3",
+		"2.0.0-beta.4",
+		"2.0.0-beta.5",
+		"2.0.0-beta.6",
+		"2.0.0-beta.7",
+		"2.0.0-beta.8",
+		"2.0.0",
+		"2.0.1",
+		"2.0.2",
+		"2.0.3",
+		"2.0.4",
+		"2.0.5",
+		"2.0.6",
+		"2.0.7",
+		"2.0.8-nightly.20180819",
+		"2.0.8-nightly.20180820",
+		"2.0.8",
+		"2.0.9",
+		"2.0.10",
+		"2.0.11",
+		"2.0.12",
+		"2.0.13",
+		"2.0.14",
+		"2.0.15",
+		"2.0.16",
+		"2.0.17",
+		"2.0.18",
+		"2.1.0-unsupported.20180809"
+	],
+	"66.0.3359.181": [
+		"3.0.0-beta.1",
+		"3.0.0-beta.2",
+		"3.0.0-beta.3",
+		"3.0.0-beta.4",
+		"3.0.0-beta.5",
+		"3.0.0-beta.6",
+		"3.0.0-beta.7",
+		"3.0.0-beta.8",
+		"3.0.0-beta.9",
+		"3.0.0-beta.10",
+		"3.0.0-beta.11",
+		"3.0.0-beta.12",
+		"3.0.0-beta.13",
+		"3.0.0-nightly.20180818",
+		"3.0.0-nightly.20180821",
+		"3.0.0-nightly.20180823",
+		"3.0.0-nightly.20180904",
+		"3.0.0",
+		"3.0.1",
+		"3.0.2",
+		"3.0.3",
+		"3.0.4",
+		"3.0.5",
+		"3.0.6",
+		"3.0.7",
+		"3.0.8",
+		"3.0.9",
+		"3.0.10",
+		"3.0.11",
+		"3.0.12",
+		"3.0.13",
+		"3.0.14",
+		"3.0.15",
+		"3.0.16",
+		"3.1.0-beta.1",
+		"3.1.0-beta.2",
+		"3.1.0-beta.3",
+		"3.1.0-beta.4",
+		"3.1.0-beta.5",
+		"3.1.0",
+		"3.1.1",
+		"3.1.2",
+		"3.1.3",
+		"3.1.4",
+		"3.1.5",
+		"3.1.6",
+		"3.1.7",
+		"3.1.8",
+		"3.1.9",
+		"3.1.10",
+		"3.1.11",
+		"3.1.12",
+		"3.1.13",
+		"4.0.0-nightly.20180817",
+		"4.0.0-nightly.20180819",
+		"4.0.0-nightly.20180821"
+	],
+	"69.0.3497.106": [
+		"4.0.0-beta.1",
+		"4.0.0-beta.2",
+		"4.0.0-beta.3",
+		"4.0.0-beta.4",
+		"4.0.0-beta.5",
+		"4.0.0-beta.6",
+		"4.0.0-beta.7",
+		"4.0.0-beta.8",
+		"4.0.0-beta.9",
+		"4.0.0-beta.10",
+		"4.0.0-beta.11",
+		"4.0.0-nightly.20181010",
+		"4.0.0",
+		"4.0.1",
+		"4.0.2",
+		"4.0.3",
+		"4.0.4",
+		"4.0.5",
+		"4.0.6"
+	],
+	"67.0.3396.99": [
+		"4.0.0-nightly.20180929"
+	],
+	"68.0.3440.128": [
+		"4.0.0-nightly.20181006"
+	],
+	"69.0.3497.128": [
+		"4.0.7",
+		"4.0.8",
+		"4.1.0",
+		"4.1.1",
+		"4.1.2",
+		"4.1.3",
+		"4.1.4",
+		"4.1.5",
+		"4.2.0",
+		"4.2.1",
+		"4.2.2",
+		"4.2.3",
+		"4.2.4",
+		"4.2.5",
+		"4.2.6",
+		"4.2.7",
+		"4.2.8",
+		"4.2.9",
+		"4.2.10",
+		"4.2.11",
+		"4.2.12"
+	],
+	"72.0.3626.52": [
+		"5.0.0-beta.1",
+		"5.0.0-beta.2"
+	],
+	"73.0.3683.27": [
+		"5.0.0-beta.3"
+	],
+	"73.0.3683.54": [
+		"5.0.0-beta.4"
+	],
+	"73.0.3683.61": [
+		"5.0.0-beta.5"
+	],
+	"73.0.3683.84": [
+		"5.0.0-beta.6"
+	],
+	"73.0.3683.94": [
+		"5.0.0-beta.7"
+	],
+	"73.0.3683.104": [
+		"5.0.0-beta.8"
+	],
+	"73.0.3683.117": [
+		"5.0.0-beta.9"
+	],
+	"70.0.3538.110": [
+		"5.0.0-nightly.20190107"
+	],
+	"71.0.3578.98": [
+		"5.0.0-nightly.20190121",
+		"5.0.0-nightly.20190122"
+	],
+	"73.0.3683.119": [
+		"5.0.0"
+	],
+	"73.0.3683.121": [
+		"5.0.1",
+		"5.0.2",
+		"5.0.3",
+		"5.0.4",
+		"5.0.5",
+		"5.0.6",
+		"5.0.7",
+		"5.0.8",
+		"5.0.9",
+		"5.0.10",
+		"5.0.11",
+		"5.0.12",
+		"5.0.13"
+	],
+	"76.0.3774.1": [
+		"6.0.0-beta.1"
+	],
+	"76.0.3783.1": [
+		"6.0.0-beta.2",
+		"6.0.0-beta.3",
+		"6.0.0-beta.4"
+	],
+	"76.0.3805.4": [
+		"6.0.0-beta.5"
+	],
+	"76.0.3809.3": [
+		"6.0.0-beta.6"
+	],
+	"76.0.3809.22": [
+		"6.0.0-beta.7"
+	],
+	"76.0.3809.26": [
+		"6.0.0-beta.8",
+		"6.0.0-beta.9"
+	],
+	"76.0.3809.37": [
+		"6.0.0-beta.10"
+	],
+	"76.0.3809.42": [
+		"6.0.0-beta.11"
+	],
+	"76.0.3809.54": [
+		"6.0.0-beta.12"
+	],
+	"76.0.3809.60": [
+		"6.0.0-beta.13"
+	],
+	"76.0.3809.68": [
+		"6.0.0-beta.14"
+	],
+	"76.0.3809.74": [
+		"6.0.0-beta.15"
+	],
+	"72.0.3626.107": [
+		"6.0.0-nightly.20190212"
+	],
+	"72.0.3626.110": [
+		"6.0.0-nightly.20190213"
+	],
+	"74.0.3724.8": [
+		"6.0.0-nightly.20190311"
+	],
+	"76.0.3809.88": [
+		"6.0.0"
+	],
+	"76.0.3809.102": [
+		"6.0.1"
+	],
+	"76.0.3809.110": [
+		"6.0.2"
+	],
+	"76.0.3809.126": [
+		"6.0.3"
+	],
+	"76.0.3809.131": [
+		"6.0.4"
+	],
+	"76.0.3809.136": [
+		"6.0.5"
+	],
+	"76.0.3809.138": [
+		"6.0.6"
+	],
+	"76.0.3809.139": [
+		"6.0.7"
+	],
+	"76.0.3809.146": [
+		"6.0.8",
+		"6.0.9",
+		"6.0.10",
+		"6.0.11",
+		"6.0.12",
+		"6.1.0",
+		"6.1.1",
+		"6.1.2",
+		"6.1.3",
+		"6.1.4",
+		"6.1.5",
+		"6.1.6",
+		"6.1.7",
+		"6.1.8",
+		"6.1.9",
+		"6.1.10",
+		"6.1.11",
+		"6.1.12"
+	],
+	"78.0.3866.0": [
+		"7.0.0-beta.1",
+		"7.0.0-beta.2",
+		"7.0.0-beta.3",
+		"7.0.0-nightly.20190727",
+		"7.0.0-nightly.20190728",
+		"7.0.0-nightly.20190729",
+		"7.0.0-nightly.20190730",
+		"7.0.0-nightly.20190731",
+		"8.0.0-nightly.20190801",
+		"8.0.0-nightly.20190802"
+	],
+	"78.0.3896.6": [
+		"7.0.0-beta.4"
+	],
+	"78.0.3905.1": [
+		"7.0.0-beta.5",
+		"7.0.0-beta.6",
+		"7.0.0-beta.7",
+		"7.0.0"
+	],
+	"76.0.3784.0": [
+		"7.0.0-nightly.20190521"
+	],
+	"76.0.3806.0": [
+		"7.0.0-nightly.20190529",
+		"7.0.0-nightly.20190530",
+		"7.0.0-nightly.20190531",
+		"7.0.0-nightly.20190602",
+		"7.0.0-nightly.20190603"
+	],
+	"77.0.3814.0": [
+		"7.0.0-nightly.20190604"
+	],
+	"77.0.3815.0": [
+		"7.0.0-nightly.20190605",
+		"7.0.0-nightly.20190606",
+		"7.0.0-nightly.20190607",
+		"7.0.0-nightly.20190608",
+		"7.0.0-nightly.20190609",
+		"7.0.0-nightly.20190611",
+		"7.0.0-nightly.20190612",
+		"7.0.0-nightly.20190613",
+		"7.0.0-nightly.20190615",
+		"7.0.0-nightly.20190616",
+		"7.0.0-nightly.20190618",
+		"7.0.0-nightly.20190619",
+		"7.0.0-nightly.20190622",
+		"7.0.0-nightly.20190623",
+		"7.0.0-nightly.20190624",
+		"7.0.0-nightly.20190627",
+		"7.0.0-nightly.20190629",
+		"7.0.0-nightly.20190630",
+		"7.0.0-nightly.20190701",
+		"7.0.0-nightly.20190702"
+	],
+	"77.0.3843.0": [
+		"7.0.0-nightly.20190704",
+		"7.0.0-nightly.20190705"
+	],
+	"77.0.3848.0": [
+		"7.0.0-nightly.20190719",
+		"7.0.0-nightly.20190720",
+		"7.0.0-nightly.20190721"
+	],
+	"77.0.3864.0": [
+		"7.0.0-nightly.20190726"
+	],
+	"78.0.3904.92": [
+		"7.0.1"
+	],
+	"78.0.3904.94": [
+		"7.1.0"
+	],
+	"78.0.3904.99": [
+		"7.1.1"
+	],
+	"78.0.3904.113": [
+		"7.1.2"
+	],
+	"78.0.3904.126": [
+		"7.1.3"
+	],
+	"78.0.3904.130": [
+		"7.1.4",
+		"7.1.5",
+		"7.1.6",
+		"7.1.7",
+		"7.1.8",
+		"7.1.9",
+		"7.1.10",
+		"7.1.11",
+		"7.1.12",
+		"7.1.13",
+		"7.1.14",
+		"7.2.0",
+		"7.2.1",
+		"7.2.2",
+		"7.2.3",
+		"7.2.4",
+		"7.3.0",
+		"7.3.1",
+		"7.3.2",
+		"7.3.3"
+	],
+	"79.0.3931.0": [
+		"8.0.0-beta.1",
+		"8.0.0-beta.2",
+		"8.0.0-nightly.20191019",
+		"8.0.0-nightly.20191020",
+		"8.0.0-nightly.20191021",
+		"8.0.0-nightly.20191023"
+	],
+	"80.0.3955.0": [
+		"8.0.0-beta.3",
+		"8.0.0-beta.4"
+	],
+	"80.0.3987.14": [
+		"8.0.0-beta.5"
+	],
+	"80.0.3987.51": [
+		"8.0.0-beta.6"
+	],
+	"80.0.3987.59": [
+		"8.0.0-beta.7"
+	],
+	"80.0.3987.75": [
+		"8.0.0-beta.8",
+		"8.0.0-beta.9"
+	],
+	"78.0.3871.0": [
+		"8.0.0-nightly.20190803",
+		"8.0.0-nightly.20190806",
+		"8.0.0-nightly.20190807",
+		"8.0.0-nightly.20190808",
+		"8.0.0-nightly.20190809",
+		"8.0.0-nightly.20190810",
+		"8.0.0-nightly.20190811",
+		"8.0.0-nightly.20190812",
+		"8.0.0-nightly.20190813",
+		"8.0.0-nightly.20190814",
+		"8.0.0-nightly.20190815"
+	],
+	"78.0.3881.0": [
+		"8.0.0-nightly.20190816",
+		"8.0.0-nightly.20190817",
+		"8.0.0-nightly.20190818",
+		"8.0.0-nightly.20190819",
+		"8.0.0-nightly.20190820"
+	],
+	"78.0.3892.0": [
+		"8.0.0-nightly.20190824",
+		"8.0.0-nightly.20190825",
+		"8.0.0-nightly.20190827",
+		"8.0.0-nightly.20190828",
+		"8.0.0-nightly.20190830",
+		"8.0.0-nightly.20190901",
+		"8.0.0-nightly.20190902",
+		"8.0.0-nightly.20190907",
+		"8.0.0-nightly.20190909",
+		"8.0.0-nightly.20190910",
+		"8.0.0-nightly.20190911",
+		"8.0.0-nightly.20190913",
+		"8.0.0-nightly.20190914",
+		"8.0.0-nightly.20190915",
+		"8.0.0-nightly.20190917"
+	],
+	"79.0.3915.0": [
+		"8.0.0-nightly.20190919",
+		"8.0.0-nightly.20190920"
+	],
+	"79.0.3919.0": [
+		"8.0.0-nightly.20190923",
+		"8.0.0-nightly.20190924",
+		"8.0.0-nightly.20190926",
+		"8.0.0-nightly.20190929",
+		"8.0.0-nightly.20190930",
+		"8.0.0-nightly.20191001",
+		"8.0.0-nightly.20191004",
+		"8.0.0-nightly.20191005",
+		"8.0.0-nightly.20191006",
+		"8.0.0-nightly.20191009",
+		"8.0.0-nightly.20191011",
+		"8.0.0-nightly.20191012",
+		"8.0.0-nightly.20191017"
+	],
+	"80.0.3952.0": [
+		"8.0.0-nightly.20191101",
+		"8.0.0-nightly.20191105"
+	],
+	"80.0.3987.86": [
+		"8.0.0",
+		"8.0.1",
+		"8.0.2"
+	],
+	"80.0.3987.134": [
+		"8.0.3"
+	],
+	"80.0.3987.137": [
+		"8.1.0"
+	],
+	"80.0.3987.141": [
+		"8.1.1"
+	],
+	"80.0.3987.158": [
+		"8.2.0"
+	],
+	"80.0.3987.163": [
+		"8.2.1",
+		"8.2.2",
+		"8.2.3",
+		"8.5.3",
+		"8.5.4",
+		"8.5.5"
+	],
+	"80.0.3987.165": [
+		"8.2.4",
+		"8.2.5",
+		"8.3.0",
+		"8.3.1",
+		"8.3.2",
+		"8.3.3",
+		"8.3.4",
+		"8.4.0",
+		"8.4.1",
+		"8.5.0",
+		"8.5.1",
+		"8.5.2"
+	],
+	"82.0.4048.0": [
+		"9.0.0-beta.1",
+		"9.0.0-beta.2",
+		"9.0.0-beta.3",
+		"9.0.0-beta.4",
+		"9.0.0-beta.5"
+	],
+	"82.0.4058.2": [
+		"9.0.0-beta.6",
+		"9.0.0-beta.7",
+		"9.0.0-beta.9"
+	],
+	"82.0.4085.10": [
+		"9.0.0-beta.10"
+	],
+	"82.0.4085.14": [
+		"9.0.0-beta.12",
+		"9.0.0-beta.13"
+	],
+	"82.0.4085.27": [
+		"9.0.0-beta.14"
+	],
+	"83.0.4102.3": [
+		"9.0.0-beta.15",
+		"9.0.0-beta.16"
+	],
+	"83.0.4103.14": [
+		"9.0.0-beta.17"
+	],
+	"83.0.4103.16": [
+		"9.0.0-beta.18"
+	],
+	"83.0.4103.24": [
+		"9.0.0-beta.19"
+	],
+	"83.0.4103.26": [
+		"9.0.0-beta.20",
+		"9.0.0-beta.21"
+	],
+	"83.0.4103.34": [
+		"9.0.0-beta.22"
+	],
+	"83.0.4103.44": [
+		"9.0.0-beta.23"
+	],
+	"83.0.4103.45": [
+		"9.0.0-beta.24"
+	],
+	"80.0.3954.0": [
+		"9.0.0-nightly.20191121",
+		"9.0.0-nightly.20191122",
+		"9.0.0-nightly.20191123",
+		"9.0.0-nightly.20191124",
+		"9.0.0-nightly.20191129",
+		"9.0.0-nightly.20191130",
+		"9.0.0-nightly.20191201",
+		"9.0.0-nightly.20191202",
+		"9.0.0-nightly.20191203",
+		"9.0.0-nightly.20191204",
+		"9.0.0-nightly.20191210"
+	],
+	"81.0.3994.0": [
+		"9.0.0-nightly.20191220",
+		"9.0.0-nightly.20191221",
+		"9.0.0-nightly.20191222",
+		"9.0.0-nightly.20191223",
+		"9.0.0-nightly.20191224",
+		"9.0.0-nightly.20191225",
+		"9.0.0-nightly.20191226",
+		"9.0.0-nightly.20191228",
+		"9.0.0-nightly.20191229",
+		"9.0.0-nightly.20191230",
+		"9.0.0-nightly.20191231",
+		"9.0.0-nightly.20200101",
+		"9.0.0-nightly.20200103",
+		"9.0.0-nightly.20200104",
+		"9.0.0-nightly.20200105",
+		"9.0.0-nightly.20200106",
+		"9.0.0-nightly.20200108",
+		"9.0.0-nightly.20200109",
+		"9.0.0-nightly.20200110",
+		"9.0.0-nightly.20200111",
+		"9.0.0-nightly.20200113",
+		"9.0.0-nightly.20200115",
+		"9.0.0-nightly.20200116",
+		"9.0.0-nightly.20200117"
+	],
+	"81.0.4030.0": [
+		"9.0.0-nightly.20200119",
+		"9.0.0-nightly.20200121"
+	],
+	"83.0.4103.64": [
+		"9.0.0"
+	],
+	"83.0.4103.94": [
+		"9.0.1",
+		"9.0.2"
+	],
+	"83.0.4103.100": [
+		"9.0.3"
+	],
+	"83.0.4103.104": [
+		"9.0.4"
+	],
+	"83.0.4103.119": [
+		"9.0.5"
+	],
+	"83.0.4103.122": [
+		"9.1.0",
+		"9.1.1",
+		"9.1.2",
+		"9.2.0",
+		"9.2.1",
+		"9.3.0",
+		"9.3.1",
+		"9.3.2",
+		"9.3.3",
+		"9.3.4",
+		"9.3.5",
+		"9.4.0",
+		"9.4.1",
+		"9.4.2",
+		"9.4.3",
+		"9.4.4"
+	],
+	"84.0.4129.0": [
+		"10.0.0-beta.1",
+		"10.0.0-beta.2",
+		"10.0.0-nightly.20200501",
+		"10.0.0-nightly.20200504",
+		"10.0.0-nightly.20200505",
+		"10.0.0-nightly.20200506",
+		"10.0.0-nightly.20200507",
+		"10.0.0-nightly.20200508",
+		"10.0.0-nightly.20200511",
+		"10.0.0-nightly.20200512",
+		"10.0.0-nightly.20200513",
+		"10.0.0-nightly.20200514",
+		"10.0.0-nightly.20200515",
+		"10.0.0-nightly.20200518",
+		"10.0.0-nightly.20200519",
+		"10.0.0-nightly.20200520",
+		"10.0.0-nightly.20200521",
+		"11.0.0-nightly.20200525",
+		"11.0.0-nightly.20200526"
+	],
+	"85.0.4161.2": [
+		"10.0.0-beta.3",
+		"10.0.0-beta.4"
+	],
+	"85.0.4181.1": [
+		"10.0.0-beta.8",
+		"10.0.0-beta.9"
+	],
+	"85.0.4183.19": [
+		"10.0.0-beta.10"
+	],
+	"85.0.4183.20": [
+		"10.0.0-beta.11"
+	],
+	"85.0.4183.26": [
+		"10.0.0-beta.12"
+	],
+	"85.0.4183.39": [
+		"10.0.0-beta.13",
+		"10.0.0-beta.14",
+		"10.0.0-beta.15",
+		"10.0.0-beta.17",
+		"10.0.0-beta.19",
+		"10.0.0-beta.20",
+		"10.0.0-beta.21"
+	],
+	"85.0.4183.70": [
+		"10.0.0-beta.23"
+	],
+	"85.0.4183.78": [
+		"10.0.0-beta.24"
+	],
+	"85.0.4183.80": [
+		"10.0.0-beta.25"
+	],
+	"82.0.4050.0": [
+		"10.0.0-nightly.20200209",
+		"10.0.0-nightly.20200210",
+		"10.0.0-nightly.20200211",
+		"10.0.0-nightly.20200216",
+		"10.0.0-nightly.20200217",
+		"10.0.0-nightly.20200218",
+		"10.0.0-nightly.20200221",
+		"10.0.0-nightly.20200222",
+		"10.0.0-nightly.20200223",
+		"10.0.0-nightly.20200226",
+		"10.0.0-nightly.20200303"
+	],
+	"82.0.4076.0": [
+		"10.0.0-nightly.20200304",
+		"10.0.0-nightly.20200305",
+		"10.0.0-nightly.20200306",
+		"10.0.0-nightly.20200309",
+		"10.0.0-nightly.20200310"
+	],
+	"82.0.4083.0": [
+		"10.0.0-nightly.20200311"
+	],
+	"83.0.4086.0": [
+		"10.0.0-nightly.20200316"
+	],
+	"83.0.4087.0": [
+		"10.0.0-nightly.20200317",
+		"10.0.0-nightly.20200318",
+		"10.0.0-nightly.20200320",
+		"10.0.0-nightly.20200323",
+		"10.0.0-nightly.20200324",
+		"10.0.0-nightly.20200325",
+		"10.0.0-nightly.20200326",
+		"10.0.0-nightly.20200327",
+		"10.0.0-nightly.20200330",
+		"10.0.0-nightly.20200331",
+		"10.0.0-nightly.20200401",
+		"10.0.0-nightly.20200402",
+		"10.0.0-nightly.20200403",
+		"10.0.0-nightly.20200406"
+	],
+	"83.0.4095.0": [
+		"10.0.0-nightly.20200408",
+		"10.0.0-nightly.20200410",
+		"10.0.0-nightly.20200413"
+	],
+	"84.0.4114.0": [
+		"10.0.0-nightly.20200414"
+	],
+	"84.0.4115.0": [
+		"10.0.0-nightly.20200415",
+		"10.0.0-nightly.20200416",
+		"10.0.0-nightly.20200417"
+	],
+	"84.0.4121.0": [
+		"10.0.0-nightly.20200422",
+		"10.0.0-nightly.20200423"
+	],
+	"84.0.4125.0": [
+		"10.0.0-nightly.20200427",
+		"10.0.0-nightly.20200428",
+		"10.0.0-nightly.20200429",
+		"10.0.0-nightly.20200430"
+	],
+	"85.0.4183.84": [
+		"10.0.0"
+	],
+	"85.0.4183.86": [
+		"10.0.1"
+	],
+	"85.0.4183.87": [
+		"10.1.0"
+	],
+	"85.0.4183.93": [
+		"10.1.1"
+	],
+	"85.0.4183.98": [
+		"10.1.2"
+	],
+	"85.0.4183.121": [
+		"10.1.3",
+		"10.1.4",
+		"10.1.5",
+		"10.1.6",
+		"10.1.7",
+		"10.2.0",
+		"10.3.0",
+		"10.3.1",
+		"10.3.2",
+		"10.4.0",
+		"10.4.1",
+		"10.4.2",
+		"10.4.3",
+		"10.4.4",
+		"10.4.5",
+		"10.4.6",
+		"10.4.7"
+	],
+	"86.0.4234.0": [
+		"11.0.0-beta.1",
+		"11.0.0-beta.3",
+		"11.0.0-beta.4",
+		"11.0.0-beta.5",
+		"11.0.0-beta.6",
+		"11.0.0-beta.7",
+		"11.0.0-nightly.20200822",
+		"11.0.0-nightly.20200824",
+		"11.0.0-nightly.20200825",
+		"11.0.0-nightly.20200826",
+		"12.0.0-nightly.20200827",
+		"12.0.0-nightly.20200831",
+		"12.0.0-nightly.20200902",
+		"12.0.0-nightly.20200903",
+		"12.0.0-nightly.20200907",
+		"12.0.0-nightly.20200910",
+		"12.0.0-nightly.20200911",
+		"12.0.0-nightly.20200914"
+	],
+	"87.0.4251.1": [
+		"11.0.0-beta.8",
+		"11.0.0-beta.9",
+		"11.0.0-beta.11"
+	],
+	"87.0.4280.11": [
+		"11.0.0-beta.12",
+		"11.0.0-beta.13"
+	],
+	"87.0.4280.27": [
+		"11.0.0-beta.16",
+		"11.0.0-beta.17",
+		"11.0.0-beta.18",
+		"11.0.0-beta.19"
+	],
+	"87.0.4280.40": [
+		"11.0.0-beta.20"
+	],
+	"87.0.4280.47": [
+		"11.0.0-beta.22",
+		"11.0.0-beta.23"
+	],
+	"85.0.4156.0": [
+		"11.0.0-nightly.20200529"
+	],
+	"85.0.4162.0": [
+		"11.0.0-nightly.20200602",
+		"11.0.0-nightly.20200603",
+		"11.0.0-nightly.20200604",
+		"11.0.0-nightly.20200609",
+		"11.0.0-nightly.20200610",
+		"11.0.0-nightly.20200611",
+		"11.0.0-nightly.20200615",
+		"11.0.0-nightly.20200616",
+		"11.0.0-nightly.20200617",
+		"11.0.0-nightly.20200618",
+		"11.0.0-nightly.20200619"
+	],
+	"85.0.4179.0": [
+		"11.0.0-nightly.20200701",
+		"11.0.0-nightly.20200702",
+		"11.0.0-nightly.20200703",
+		"11.0.0-nightly.20200706",
+		"11.0.0-nightly.20200707",
+		"11.0.0-nightly.20200708",
+		"11.0.0-nightly.20200709"
+	],
+	"86.0.4203.0": [
+		"11.0.0-nightly.20200716",
+		"11.0.0-nightly.20200717",
+		"11.0.0-nightly.20200720",
+		"11.0.0-nightly.20200721"
+	],
+	"86.0.4209.0": [
+		"11.0.0-nightly.20200723",
+		"11.0.0-nightly.20200724",
+		"11.0.0-nightly.20200729",
+		"11.0.0-nightly.20200730",
+		"11.0.0-nightly.20200731",
+		"11.0.0-nightly.20200803",
+		"11.0.0-nightly.20200804",
+		"11.0.0-nightly.20200805",
+		"11.0.0-nightly.20200811",
+		"11.0.0-nightly.20200812"
+	],
+	"87.0.4280.60": [
+		"11.0.0",
+		"11.0.1"
+	],
+	"87.0.4280.67": [
+		"11.0.2",
+		"11.0.3",
+		"11.0.4"
+	],
+	"87.0.4280.88": [
+		"11.0.5",
+		"11.1.0",
+		"11.1.1"
+	],
+	"87.0.4280.141": [
+		"11.2.0",
+		"11.2.1",
+		"11.2.2",
+		"11.2.3",
+		"11.3.0",
+		"11.4.0",
+		"11.4.1",
+		"11.4.2",
+		"11.4.3",
+		"11.4.4",
+		"11.4.5",
+		"11.4.6",
+		"11.4.7",
+		"11.4.8",
+		"11.4.9",
+		"11.4.10",
+		"11.4.11",
+		"11.4.12",
+		"11.5.0"
+	],
+	"89.0.4328.0": [
+		"12.0.0-beta.1",
+		"12.0.0-beta.3",
+		"12.0.0-beta.4",
+		"12.0.0-beta.5",
+		"12.0.0-beta.6",
+		"12.0.0-beta.7",
+		"12.0.0-beta.8",
+		"12.0.0-beta.9",
+		"12.0.0-beta.10",
+		"12.0.0-beta.11",
+		"12.0.0-beta.12",
+		"12.0.0-beta.14",
+		"13.0.0-nightly.20201119",
+		"13.0.0-nightly.20201123",
+		"13.0.0-nightly.20201124",
+		"13.0.0-nightly.20201126",
+		"13.0.0-nightly.20201127",
+		"13.0.0-nightly.20201130",
+		"13.0.0-nightly.20201201",
+		"13.0.0-nightly.20201202",
+		"13.0.0-nightly.20201203",
+		"13.0.0-nightly.20201204",
+		"13.0.0-nightly.20201207",
+		"13.0.0-nightly.20201208",
+		"13.0.0-nightly.20201209",
+		"13.0.0-nightly.20201210",
+		"13.0.0-nightly.20201211",
+		"13.0.0-nightly.20201214"
+	],
+	"89.0.4348.1": [
+		"12.0.0-beta.16",
+		"12.0.0-beta.18",
+		"12.0.0-beta.19",
+		"12.0.0-beta.20"
+	],
+	"89.0.4388.2": [
+		"12.0.0-beta.21",
+		"12.0.0-beta.22",
+		"12.0.0-beta.23",
+		"12.0.0-beta.24",
+		"12.0.0-beta.25",
+		"12.0.0-beta.26"
+	],
+	"89.0.4389.23": [
+		"12.0.0-beta.27",
+		"12.0.0-beta.28",
+		"12.0.0-beta.29"
+	],
+	"89.0.4389.58": [
+		"12.0.0-beta.30",
+		"12.0.0-beta.31"
+	],
+	"87.0.4268.0": [
+		"12.0.0-nightly.20201013",
+		"12.0.0-nightly.20201014",
+		"12.0.0-nightly.20201015"
+	],
+	"88.0.4292.0": [
+		"12.0.0-nightly.20201023",
+		"12.0.0-nightly.20201026"
+	],
+	"88.0.4306.0": [
+		"12.0.0-nightly.20201030",
+		"12.0.0-nightly.20201102",
+		"12.0.0-nightly.20201103",
+		"12.0.0-nightly.20201104",
+		"12.0.0-nightly.20201105",
+		"12.0.0-nightly.20201106",
+		"12.0.0-nightly.20201111",
+		"12.0.0-nightly.20201112"
+	],
+	"88.0.4324.0": [
+		"12.0.0-nightly.20201116"
+	],
+	"89.0.4389.69": [
+		"12.0.0"
+	],
+	"89.0.4389.82": [
+		"12.0.1"
+	],
+	"89.0.4389.90": [
+		"12.0.2"
+	],
+	"89.0.4389.114": [
+		"12.0.3",
+		"12.0.4"
+	],
+	"89.0.4389.128": [
+		"12.0.5",
+		"12.0.6",
+		"12.0.7",
+		"12.0.8",
+		"12.0.9",
+		"12.0.10",
+		"12.0.11",
+		"12.0.12",
+		"12.0.13",
+		"12.0.14",
+		"12.0.15",
+		"12.0.16",
+		"12.0.17",
+		"12.0.18",
+		"12.1.0",
+		"12.1.1",
+		"12.1.2",
+		"12.2.0",
+		"12.2.1",
+		"12.2.2",
+		"12.2.3"
+	],
+	"90.0.4402.0": [
+		"13.0.0-beta.2",
+		"13.0.0-beta.3",
+		"13.0.0-nightly.20210210",
+		"13.0.0-nightly.20210211",
+		"13.0.0-nightly.20210212",
+		"13.0.0-nightly.20210216",
+		"13.0.0-nightly.20210217",
+		"13.0.0-nightly.20210218",
+		"13.0.0-nightly.20210219",
+		"13.0.0-nightly.20210222",
+		"13.0.0-nightly.20210225",
+		"13.0.0-nightly.20210226",
+		"13.0.0-nightly.20210301",
+		"13.0.0-nightly.20210302",
+		"13.0.0-nightly.20210303",
+		"14.0.0-nightly.20210304"
+	],
+	"90.0.4415.0": [
+		"13.0.0-beta.4",
+		"13.0.0-beta.5",
+		"13.0.0-beta.6",
+		"13.0.0-beta.7",
+		"13.0.0-beta.8",
+		"13.0.0-beta.9",
+		"13.0.0-beta.11",
+		"13.0.0-beta.12",
+		"13.0.0-beta.13",
+		"14.0.0-nightly.20210305",
+		"14.0.0-nightly.20210308",
+		"14.0.0-nightly.20210309",
+		"14.0.0-nightly.20210311",
+		"14.0.0-nightly.20210315",
+		"14.0.0-nightly.20210316",
+		"14.0.0-nightly.20210317",
+		"14.0.0-nightly.20210318",
+		"14.0.0-nightly.20210319",
+		"14.0.0-nightly.20210323",
+		"14.0.0-nightly.20210324",
+		"14.0.0-nightly.20210325",
+		"14.0.0-nightly.20210326",
+		"14.0.0-nightly.20210329",
+		"14.0.0-nightly.20210330"
+	],
+	"91.0.4448.0": [
+		"13.0.0-beta.14",
+		"13.0.0-beta.16",
+		"13.0.0-beta.17",
+		"13.0.0-beta.18",
+		"13.0.0-beta.20",
+		"14.0.0-nightly.20210331",
+		"14.0.0-nightly.20210401",
+		"14.0.0-nightly.20210402",
+		"14.0.0-nightly.20210406",
+		"14.0.0-nightly.20210407",
+		"14.0.0-nightly.20210408",
+		"14.0.0-nightly.20210409",
+		"14.0.0-nightly.20210413",
+		"14.0.0-nightly.20210413"
+	],
+	"91.0.4472.33": [
+		"13.0.0-beta.21",
+		"13.0.0-beta.22",
+		"13.0.0-beta.23"
+	],
+	"91.0.4472.38": [
+		"13.0.0-beta.24",
+		"13.0.0-beta.26",
+		"13.0.0-beta.27",
+		"13.0.0-beta.28"
+	],
+	"89.0.4349.0": [
+		"13.0.0-nightly.20201215",
+		"13.0.0-nightly.20201216",
+		"13.0.0-nightly.20201221",
+		"13.0.0-nightly.20201222"
+	],
+	"89.0.4359.0": [
+		"13.0.0-nightly.20201223",
+		"13.0.0-nightly.20210104",
+		"13.0.0-nightly.20210108",
+		"13.0.0-nightly.20210111"
+	],
+	"89.0.4386.0": [
+		"13.0.0-nightly.20210113",
+		"13.0.0-nightly.20210114",
+		"13.0.0-nightly.20210118",
+		"13.0.0-nightly.20210122",
+		"13.0.0-nightly.20210125"
+	],
+	"89.0.4389.0": [
+		"13.0.0-nightly.20210127",
+		"13.0.0-nightly.20210128",
+		"13.0.0-nightly.20210129",
+		"13.0.0-nightly.20210201",
+		"13.0.0-nightly.20210202",
+		"13.0.0-nightly.20210203",
+		"13.0.0-nightly.20210205",
+		"13.0.0-nightly.20210208",
+		"13.0.0-nightly.20210209"
+	],
+	"91.0.4472.69": [
+		"13.0.0",
+		"13.0.1"
+	],
+	"91.0.4472.77": [
+		"13.1.0",
+		"13.1.1",
+		"13.1.2"
+	],
+	"91.0.4472.106": [
+		"13.1.3",
+		"13.1.4"
+	],
+	"91.0.4472.124": [
+		"13.1.5",
+		"13.1.6",
+		"13.1.7"
+	],
+	"91.0.4472.164": [
+		"13.1.8",
+		"13.1.9",
+		"13.2.0",
+		"13.2.1",
+		"13.2.2",
+		"13.2.3",
+		"13.3.0",
+		"13.4.0",
+		"13.5.0",
+		"13.5.1",
+		"13.5.2",
+		"13.6.0",
+		"13.6.1",
+		"13.6.2",
+		"13.6.3",
+		"13.6.6",
+		"13.6.7",
+		"13.6.8",
+		"13.6.9"
+	],
+	"92.0.4511.0": [
+		"14.0.0-beta.1",
+		"14.0.0-beta.2",
+		"14.0.0-beta.3",
+		"14.0.0-nightly.20210520",
+		"14.0.0-nightly.20210523",
+		"14.0.0-nightly.20210524",
+		"15.0.0-nightly.20210527",
+		"15.0.0-nightly.20210528",
+		"15.0.0-nightly.20210531",
+		"15.0.0-nightly.20210601",
+		"15.0.0-nightly.20210602"
+	],
+	"93.0.4536.0": [
+		"14.0.0-beta.5",
+		"14.0.0-beta.6",
+		"14.0.0-beta.7",
+		"14.0.0-beta.8",
+		"15.0.0-nightly.20210609",
+		"15.0.0-nightly.20210610",
+		"15.0.0-nightly.20210611",
+		"15.0.0-nightly.20210614",
+		"15.0.0-nightly.20210615",
+		"15.0.0-nightly.20210616"
+	],
+	"93.0.4539.0": [
+		"14.0.0-beta.9",
+		"14.0.0-beta.10",
+		"15.0.0-nightly.20210617",
+		"15.0.0-nightly.20210618",
+		"15.0.0-nightly.20210621",
+		"15.0.0-nightly.20210622"
+	],
+	"93.0.4557.4": [
+		"14.0.0-beta.11",
+		"14.0.0-beta.12"
+	],
+	"93.0.4566.0": [
+		"14.0.0-beta.13",
+		"14.0.0-beta.14",
+		"14.0.0-beta.15",
+		"14.0.0-beta.16",
+		"14.0.0-beta.17",
+		"15.0.0-alpha.1",
+		"15.0.0-alpha.2",
+		"15.0.0-nightly.20210706",
+		"15.0.0-nightly.20210707",
+		"15.0.0-nightly.20210708",
+		"15.0.0-nightly.20210709",
+		"15.0.0-nightly.20210712",
+		"15.0.0-nightly.20210713",
+		"15.0.0-nightly.20210714",
+		"15.0.0-nightly.20210715",
+		"15.0.0-nightly.20210716",
+		"15.0.0-nightly.20210719",
+		"15.0.0-nightly.20210720",
+		"15.0.0-nightly.20210721",
+		"16.0.0-nightly.20210722",
+		"16.0.0-nightly.20210723",
+		"16.0.0-nightly.20210726"
+	],
+	"93.0.4577.15": [
+		"14.0.0-beta.18",
+		"14.0.0-beta.19",
+		"14.0.0-beta.20",
+		"14.0.0-beta.21"
+	],
+	"93.0.4577.25": [
+		"14.0.0-beta.22",
+		"14.0.0-beta.23"
+	],
+	"93.0.4577.51": [
+		"14.0.0-beta.24",
+		"14.0.0-beta.25"
+	],
+	"92.0.4475.0": [
+		"14.0.0-nightly.20210426",
+		"14.0.0-nightly.20210426",
+		"14.0.0-nightly.20210427",
+		"14.0.0-nightly.20210427"
+	],
+	"92.0.4488.0": [
+		"14.0.0-nightly.20210430",
+		"14.0.0-nightly.20210430",
+		"14.0.0-nightly.20210503",
+		"14.0.0-nightly.20210503"
+	],
+	"92.0.4496.0": [
+		"14.0.0-nightly.20210505",
+		"14.0.0-nightly.20210505"
+	],
+	"92.0.4498.0": [
+		"14.0.0-nightly.20210506",
+		"14.0.0-nightly.20210506"
+	],
+	"92.0.4499.0": [
+		"14.0.0-nightly.20210507",
+		"14.0.0-nightly.20210507",
+		"14.0.0-nightly.20210510",
+		"14.0.0-nightly.20210510",
+		"14.0.0-nightly.20210511",
+		"14.0.0-nightly.20210511",
+		"14.0.0-nightly.20210512",
+		"14.0.0-nightly.20210512",
+		"14.0.0-nightly.20210513",
+		"14.0.0-nightly.20210513"
+	],
+	"92.0.4505.0": [
+		"14.0.0-nightly.20210514",
+		"14.0.0-nightly.20210517",
+		"14.0.0-nightly.20210518",
+		"14.0.0-nightly.20210519"
+	],
+	"93.0.4577.58": [
+		"14.0.0"
+	],
+	"93.0.4577.63": [
+		"14.0.1"
+	],
+	"93.0.4577.82": [
+		"14.0.2",
+		"14.1.0",
+		"14.1.1",
+		"14.2.0",
+		"14.2.1",
+		"14.2.2",
+		"14.2.3",
+		"14.2.4",
+		"14.2.5",
+		"14.2.6",
+		"14.2.7",
+		"14.2.8"
+	],
+	"94.0.4584.0": [
+		"15.0.0-alpha.3",
+		"15.0.0-alpha.4",
+		"15.0.0-alpha.5",
+		"15.0.0-alpha.6",
+		"16.0.0-nightly.20210727",
+		"16.0.0-nightly.20210728",
+		"16.0.0-nightly.20210729",
+		"16.0.0-nightly.20210802",
+		"16.0.0-nightly.20210803",
+		"16.0.0-nightly.20210804",
+		"16.0.0-nightly.20210805",
+		"16.0.0-nightly.20210806",
+		"16.0.0-nightly.20210809",
+		"16.0.0-nightly.20210810",
+		"16.0.0-nightly.20210811"
+	],
+	"94.0.4590.2": [
+		"15.0.0-alpha.7",
+		"15.0.0-alpha.8",
+		"15.0.0-alpha.9",
+		"16.0.0-nightly.20210812",
+		"16.0.0-nightly.20210813",
+		"16.0.0-nightly.20210816",
+		"16.0.0-nightly.20210817",
+		"16.0.0-nightly.20210818",
+		"16.0.0-nightly.20210819",
+		"16.0.0-nightly.20210820",
+		"16.0.0-nightly.20210823"
+	],
+	"94.0.4606.12": [
+		"15.0.0-alpha.10"
+	],
+	"94.0.4606.20": [
+		"15.0.0-beta.1",
+		"15.0.0-beta.2"
+	],
+	"94.0.4606.31": [
+		"15.0.0-beta.3",
+		"15.0.0-beta.4",
+		"15.0.0-beta.5",
+		"15.0.0-beta.6",
+		"15.0.0-beta.7"
+	],
+	"93.0.4530.0": [
+		"15.0.0-nightly.20210603",
+		"15.0.0-nightly.20210604"
+	],
+	"93.0.4535.0": [
+		"15.0.0-nightly.20210608"
+	],
+	"93.0.4550.0": [
+		"15.0.0-nightly.20210623",
+		"15.0.0-nightly.20210624"
+	],
+	"93.0.4552.0": [
+		"15.0.0-nightly.20210625",
+		"15.0.0-nightly.20210628",
+		"15.0.0-nightly.20210629"
+	],
+	"93.0.4558.0": [
+		"15.0.0-nightly.20210630",
+		"15.0.0-nightly.20210701",
+		"15.0.0-nightly.20210702"
+	],
+	"94.0.4606.51": [
+		"15.0.0"
+	],
+	"94.0.4606.61": [
+		"15.1.0",
+		"15.1.1"
+	],
+	"94.0.4606.71": [
+		"15.1.2"
+	],
+	"94.0.4606.81": [
+		"15.2.0",
+		"15.3.0",
+		"15.3.1",
+		"15.3.2",
+		"15.3.3",
+		"15.3.4",
+		"15.3.5",
+		"15.3.6",
+		"15.3.7",
+		"15.4.0",
+		"15.4.1",
+		"15.4.2"
+	],
+	"95.0.4629.0": [
+		"16.0.0-alpha.1",
+		"16.0.0-alpha.2",
+		"16.0.0-alpha.3",
+		"16.0.0-alpha.4",
+		"16.0.0-alpha.5",
+		"16.0.0-alpha.6",
+		"16.0.0-alpha.7",
+		"16.0.0-nightly.20210902",
+		"16.0.0-nightly.20210903",
+		"16.0.0-nightly.20210906",
+		"16.0.0-nightly.20210907",
+		"16.0.0-nightly.20210908",
+		"16.0.0-nightly.20210909",
+		"16.0.0-nightly.20210910",
+		"16.0.0-nightly.20210913",
+		"16.0.0-nightly.20210914",
+		"16.0.0-nightly.20210915",
+		"16.0.0-nightly.20210916",
+		"16.0.0-nightly.20210917",
+		"16.0.0-nightly.20210920",
+		"16.0.0-nightly.20210921"
+	],
+	"96.0.4647.0": [
+		"16.0.0-alpha.8",
+		"16.0.0-alpha.9",
+		"16.0.0-beta.1",
+		"16.0.0-beta.2",
+		"16.0.0-beta.3",
+		"17.0.0-nightly.20211006",
+		"17.0.0-nightly.20211007",
+		"17.0.0-nightly.20211008",
+		"17.0.0-nightly.20211011",
+		"17.0.0-nightly.20211012",
+		"17.0.0-nightly.20211013",
+		"17.0.0-nightly.20211014",
+		"17.0.0-nightly.20211015",
+		"17.0.0-nightly.20211018",
+		"17.0.0-nightly.20211019",
+		"17.0.0-nightly.20211020",
+		"17.0.0-nightly.20211021"
+	],
+	"96.0.4664.18": [
+		"16.0.0-beta.4",
+		"16.0.0-beta.5"
+	],
+	"96.0.4664.27": [
+		"16.0.0-beta.6",
+		"16.0.0-beta.7"
+	],
+	"96.0.4664.35": [
+		"16.0.0-beta.8",
+		"16.0.0-beta.9"
+	],
+	"95.0.4612.5": [
+		"16.0.0-nightly.20210824",
+		"16.0.0-nightly.20210825",
+		"16.0.0-nightly.20210826",
+		"16.0.0-nightly.20210827",
+		"16.0.0-nightly.20210830",
+		"16.0.0-nightly.20210831",
+		"16.0.0-nightly.20210901"
+	],
+	"96.0.4664.45": [
+		"16.0.0",
+		"16.0.1"
+	],
+	"96.0.4664.55": [
+		"16.0.2",
+		"16.0.3",
+		"16.0.4",
+		"16.0.5"
+	],
+	"96.0.4664.110": [
+		"16.0.6",
+		"16.0.7",
+		"16.0.8"
+	],
+	"96.0.4664.174": [
+		"16.0.9",
+		"16.0.10",
+		"16.1.0",
+		"16.1.1"
+	],
+	"96.0.4664.4": [
+		"17.0.0-alpha.1",
+		"17.0.0-alpha.2",
+		"17.0.0-alpha.3",
+		"17.0.0-nightly.20211022",
+		"17.0.0-nightly.20211025",
+		"17.0.0-nightly.20211026",
+		"17.0.0-nightly.20211027",
+		"17.0.0-nightly.20211028",
+		"17.0.0-nightly.20211029",
+		"17.0.0-nightly.20211101",
+		"17.0.0-nightly.20211102",
+		"17.0.0-nightly.20211103",
+		"17.0.0-nightly.20211104",
+		"17.0.0-nightly.20211105",
+		"17.0.0-nightly.20211108",
+		"17.0.0-nightly.20211109",
+		"17.0.0-nightly.20211110",
+		"17.0.0-nightly.20211111",
+		"17.0.0-nightly.20211112",
+		"17.0.0-nightly.20211115",
+		"17.0.0-nightly.20211116",
+		"17.0.0-nightly.20211117",
+		"18.0.0-nightly.20211118",
+		"18.0.0-nightly.20211119",
+		"18.0.0-nightly.20211122",
+		"18.0.0-nightly.20211123"
+	],
+	"98.0.4706.0": [
+		"17.0.0-alpha.4",
+		"17.0.0-alpha.5",
+		"17.0.0-alpha.6",
+		"17.0.0-beta.1",
+		"17.0.0-beta.2",
+		"18.0.0-nightly.20211124",
+		"18.0.0-nightly.20211125",
+		"18.0.0-nightly.20211126",
+		"18.0.0-nightly.20211129",
+		"18.0.0-nightly.20211130",
+		"18.0.0-nightly.20211201",
+		"18.0.0-nightly.20211202",
+		"18.0.0-nightly.20211203",
+		"18.0.0-nightly.20211206",
+		"18.0.0-nightly.20211207",
+		"18.0.0-nightly.20211208",
+		"18.0.0-nightly.20211209",
+		"18.0.0-nightly.20211210",
+		"18.0.0-nightly.20211213",
+		"18.0.0-nightly.20211214",
+		"18.0.0-nightly.20211215",
+		"18.0.0-nightly.20211216",
+		"18.0.0-nightly.20211217",
+		"18.0.0-nightly.20211220",
+		"18.0.0-nightly.20211221",
+		"18.0.0-nightly.20211222",
+		"18.0.0-nightly.20211223",
+		"18.0.0-nightly.20211228",
+		"18.0.0-nightly.20211229",
+		"18.0.0-nightly.20211231",
+		"18.0.0-nightly.20220103",
+		"18.0.0-nightly.20220104",
+		"18.0.0-nightly.20220105",
+		"18.0.0-nightly.20220106",
+		"18.0.0-nightly.20220107",
+		"18.0.0-nightly.20220110"
+	],
+	"98.0.4758.9": [
+		"17.0.0-beta.3"
+	],
+	"98.0.4758.11": [
+		"17.0.0-beta.4",
+		"17.0.0-beta.5",
+		"17.0.0-beta.6",
+		"17.0.0-beta.7",
+		"17.0.0-beta.8",
+		"17.0.0-beta.9"
+	],
+	"98.0.4758.74": [
+		"17.0.0"
+	],
+	"98.0.4758.82": [
+		"17.0.1"
+	],
+	"98.0.4758.102": [
+		"17.1.0"
+	],
+	"98.0.4758.109": [
+		"17.1.1",
+		"17.1.2",
+		"17.2.0"
+	],
+	"99.0.4767.0": [
+		"18.0.0-alpha.1",
+		"18.0.0-alpha.2",
+		"18.0.0-alpha.3",
+		"18.0.0-alpha.4",
+		"18.0.0-alpha.5",
+		"18.0.0-nightly.20220111",
+		"18.0.0-nightly.20220112",
+		"18.0.0-nightly.20220113",
+		"18.0.0-nightly.20220114",
+		"18.0.0-nightly.20220117",
+		"18.0.0-nightly.20220118",
+		"18.0.0-nightly.20220119",
+		"18.0.0-nightly.20220121",
+		"18.0.0-nightly.20220124",
+		"18.0.0-nightly.20220125",
+		"18.0.0-nightly.20220127",
+		"18.0.0-nightly.20220128",
+		"18.0.0-nightly.20220131",
+		"18.0.0-nightly.20220201",
+		"19.0.0-nightly.20220202",
+		"19.0.0-nightly.20220203",
+		"19.0.0-nightly.20220204",
+		"19.0.0-nightly.20220207",
+		"19.0.0-nightly.20220208",
+		"19.0.0-nightly.20220209"
+	],
+	"100.0.4894.0": [
+		"18.0.0-beta.1",
+		"18.0.0-beta.2",
+		"18.0.0-beta.3",
+		"18.0.0-beta.4",
+		"18.0.0-beta.5",
+		"18.0.0-beta.6",
+		"19.0.0-nightly.20220308",
+		"19.0.0-nightly.20220309",
+		"19.0.0-nightly.20220310",
+		"19.0.0-nightly.20220311",
+		"19.0.0-nightly.20220314",
+		"19.0.0-nightly.20220315",
+		"19.0.0-nightly.20220316",
+		"19.0.0-nightly.20220317",
+		"19.0.0-nightly.20220318",
+		"19.0.0-nightly.20220321",
+		"19.0.0-nightly.20220322",
+		"19.0.0-nightly.20220323",
+		"19.0.0-nightly.20220324"
+	],
+	"102.0.4961.0": [
+		"19.0.0-nightly.20220325"
+	]
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-chromium-versions.json b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-chromium-versions.json
new file mode 100644
index 0000000..040cbe8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-chromium-versions.json
@@ -0,0 +1 @@
+{"39.0.2171.65":["0.20.0","0.20.1","0.20.2","0.20.3","0.20.4","0.20.5","0.20.6","0.20.7","0.20.8"],"40.0.2214.91":["0.21.0","0.21.1","0.21.2"],"41.0.2272.76":["0.21.3","0.22.1","0.22.2","0.22.3","0.23.0","0.24.0"],"42.0.2311.107":["0.25.0","0.25.1","0.25.2","0.25.3","0.26.0","0.26.1","0.27.0","0.27.1"],"43.0.2357.65":["0.27.2","0.27.3","0.28.0","0.28.1","0.28.2","0.28.3","0.29.1","0.29.2"],"44.0.2403.125":["0.30.4","0.31.0"],"45.0.2454.85":["0.31.2","0.32.2","0.32.3","0.33.0","0.33.1","0.33.2","0.33.3","0.33.4","0.33.6","0.33.7","0.33.8","0.33.9","0.34.0","0.34.1","0.34.2","0.34.3","0.34.4","0.35.1","0.35.2","0.35.3","0.35.4","0.35.5"],"47.0.2526.73":["0.36.0","0.36.2","0.36.3","0.36.4"],"47.0.2526.110":["0.36.5","0.36.6","0.36.7","0.36.8","0.36.9","0.36.10","0.36.11","0.36.12"],"49.0.2623.75":["0.37.0","0.37.1","0.37.3","0.37.4","0.37.5","0.37.6","0.37.7","0.37.8","1.0.0","1.0.1","1.0.2"],"50.0.2661.102":["1.1.0","1.1.1","1.1.2","1.1.3"],"51.0.2704.63":["1.2.0","1.2.1"],"51.0.2704.84":["1.2.2","1.2.3"],"51.0.2704.103":["1.2.4","1.2.5"],"51.0.2704.106":["1.2.6","1.2.7","1.2.8"],"52.0.2743.82":["1.3.0","1.3.1","1.3.2","1.3.3","1.3.4","1.3.5","1.3.6","1.3.7","1.3.9","1.3.10","1.3.13","1.3.14","1.3.15"],"53.0.2785.113":["1.4.0","1.4.1","1.4.2","1.4.3","1.4.4","1.4.5"],"53.0.2785.143":["1.4.6","1.4.7","1.4.8","1.4.10","1.4.11","1.4.13","1.4.14","1.4.15","1.4.16"],"54.0.2840.51":["1.4.12"],"54.0.2840.101":["1.5.0","1.5.1"],"56.0.2924.87":["1.6.0","1.6.1","1.6.2","1.6.3","1.6.4","1.6.5","1.6.6","1.6.7","1.6.8","1.6.9","1.6.10","1.6.11","1.6.12","1.6.13","1.6.14","1.6.15","1.6.16","1.6.17","1.6.18"],"58.0.3029.110":["1.7.0","1.7.1","1.7.2","1.7.3","1.7.4","1.7.5","1.7.6","1.7.7","1.7.8","1.7.9","1.7.10","1.7.11","1.7.12","1.7.13","1.7.14","1.7.15","1.7.16"],"59.0.3071.115":["1.8.0","1.8.1","1.8.2-beta.1","1.8.2-beta.2","1.8.2-beta.3","1.8.2-beta.4","1.8.2-beta.5","1.8.2","1.8.3","1.8.4","1.8.5","1.8.6","1.8.7","1.8.8"],"61.0.3163.100":["2.0.0-beta.1","2.0.0-beta.2","2.0.0-beta.3","2.0.0-beta.4","2.0.0-beta.5","2.0.0-beta.6","2.0.0-beta.7","2.0.0-beta.8","2.0.0","2.0.1","2.0.2","2.0.3","2.0.4","2.0.5","2.0.6","2.0.7","2.0.8-nightly.20180819","2.0.8-nightly.20180820","2.0.8","2.0.9","2.0.10","2.0.11","2.0.12","2.0.13","2.0.14","2.0.15","2.0.16","2.0.17","2.0.18","2.1.0-unsupported.20180809"],"66.0.3359.181":["3.0.0-beta.1","3.0.0-beta.2","3.0.0-beta.3","3.0.0-beta.4","3.0.0-beta.5","3.0.0-beta.6","3.0.0-beta.7","3.0.0-beta.8","3.0.0-beta.9","3.0.0-beta.10","3.0.0-beta.11","3.0.0-beta.12","3.0.0-beta.13","3.0.0-nightly.20180818","3.0.0-nightly.20180821","3.0.0-nightly.20180823","3.0.0-nightly.20180904","3.0.0","3.0.1","3.0.2","3.0.3","3.0.4","3.0.5","3.0.6","3.0.7","3.0.8","3.0.9","3.0.10","3.0.11","3.0.12","3.0.13","3.0.14","3.0.15","3.0.16","3.1.0-beta.1","3.1.0-beta.2","3.1.0-beta.3","3.1.0-beta.4","3.1.0-beta.5","3.1.0","3.1.1","3.1.2","3.1.3","3.1.4","3.1.5","3.1.6","3.1.7","3.1.8","3.1.9","3.1.10","3.1.11","3.1.12","3.1.13","4.0.0-nightly.20180817","4.0.0-nightly.20180819","4.0.0-nightly.20180821"],"69.0.3497.106":["4.0.0-beta.1","4.0.0-beta.2","4.0.0-beta.3","4.0.0-beta.4","4.0.0-beta.5","4.0.0-beta.6","4.0.0-beta.7","4.0.0-beta.8","4.0.0-beta.9","4.0.0-beta.10","4.0.0-beta.11","4.0.0-nightly.20181010","4.0.0","4.0.1","4.0.2","4.0.3","4.0.4","4.0.5","4.0.6"],"67.0.3396.99":["4.0.0-nightly.20180929"],"68.0.3440.128":["4.0.0-nightly.20181006"],"69.0.3497.128":["4.0.7","4.0.8","4.1.0","4.1.1","4.1.2","4.1.3","4.1.4","4.1.5","4.2.0","4.2.1","4.2.2","4.2.3","4.2.4","4.2.5","4.2.6","4.2.7","4.2.8","4.2.9","4.2.10","4.2.11","4.2.12"],"72.0.3626.52":["5.0.0-beta.1","5.0.0-beta.2"],"73.0.3683.27":["5.0.0-beta.3"],"73.0.3683.54":["5.0.0-beta.4"],"73.0.3683.61":["5.0.0-beta.5"],"73.0.3683.84":["5.0.0-beta.6"],"73.0.3683.94":["5.0.0-beta.7"],"73.0.3683.104":["5.0.0-beta.8"],"73.0.3683.117":["5.0.0-beta.9"],"70.0.3538.110":["5.0.0-nightly.20190107"],"71.0.3578.98":["5.0.0-nightly.20190121","5.0.0-nightly.20190122"],"73.0.3683.119":["5.0.0"],"73.0.3683.121":["5.0.1","5.0.2","5.0.3","5.0.4","5.0.5","5.0.6","5.0.7","5.0.8","5.0.9","5.0.10","5.0.11","5.0.12","5.0.13"],"76.0.3774.1":["6.0.0-beta.1"],"76.0.3783.1":["6.0.0-beta.2","6.0.0-beta.3","6.0.0-beta.4"],"76.0.3805.4":["6.0.0-beta.5"],"76.0.3809.3":["6.0.0-beta.6"],"76.0.3809.22":["6.0.0-beta.7"],"76.0.3809.26":["6.0.0-beta.8","6.0.0-beta.9"],"76.0.3809.37":["6.0.0-beta.10"],"76.0.3809.42":["6.0.0-beta.11"],"76.0.3809.54":["6.0.0-beta.12"],"76.0.3809.60":["6.0.0-beta.13"],"76.0.3809.68":["6.0.0-beta.14"],"76.0.3809.74":["6.0.0-beta.15"],"72.0.3626.107":["6.0.0-nightly.20190212"],"72.0.3626.110":["6.0.0-nightly.20190213"],"74.0.3724.8":["6.0.0-nightly.20190311"],"76.0.3809.88":["6.0.0"],"76.0.3809.102":["6.0.1"],"76.0.3809.110":["6.0.2"],"76.0.3809.126":["6.0.3"],"76.0.3809.131":["6.0.4"],"76.0.3809.136":["6.0.5"],"76.0.3809.138":["6.0.6"],"76.0.3809.139":["6.0.7"],"76.0.3809.146":["6.0.8","6.0.9","6.0.10","6.0.11","6.0.12","6.1.0","6.1.1","6.1.2","6.1.3","6.1.4","6.1.5","6.1.6","6.1.7","6.1.8","6.1.9","6.1.10","6.1.11","6.1.12"],"78.0.3866.0":["7.0.0-beta.1","7.0.0-beta.2","7.0.0-beta.3","7.0.0-nightly.20190727","7.0.0-nightly.20190728","7.0.0-nightly.20190729","7.0.0-nightly.20190730","7.0.0-nightly.20190731","8.0.0-nightly.20190801","8.0.0-nightly.20190802"],"78.0.3896.6":["7.0.0-beta.4"],"78.0.3905.1":["7.0.0-beta.5","7.0.0-beta.6","7.0.0-beta.7","7.0.0"],"76.0.3784.0":["7.0.0-nightly.20190521"],"76.0.3806.0":["7.0.0-nightly.20190529","7.0.0-nightly.20190530","7.0.0-nightly.20190531","7.0.0-nightly.20190602","7.0.0-nightly.20190603"],"77.0.3814.0":["7.0.0-nightly.20190604"],"77.0.3815.0":["7.0.0-nightly.20190605","7.0.0-nightly.20190606","7.0.0-nightly.20190607","7.0.0-nightly.20190608","7.0.0-nightly.20190609","7.0.0-nightly.20190611","7.0.0-nightly.20190612","7.0.0-nightly.20190613","7.0.0-nightly.20190615","7.0.0-nightly.20190616","7.0.0-nightly.20190618","7.0.0-nightly.20190619","7.0.0-nightly.20190622","7.0.0-nightly.20190623","7.0.0-nightly.20190624","7.0.0-nightly.20190627","7.0.0-nightly.20190629","7.0.0-nightly.20190630","7.0.0-nightly.20190701","7.0.0-nightly.20190702"],"77.0.3843.0":["7.0.0-nightly.20190704","7.0.0-nightly.20190705"],"77.0.3848.0":["7.0.0-nightly.20190719","7.0.0-nightly.20190720","7.0.0-nightly.20190721"],"77.0.3864.0":["7.0.0-nightly.20190726"],"78.0.3904.92":["7.0.1"],"78.0.3904.94":["7.1.0"],"78.0.3904.99":["7.1.1"],"78.0.3904.113":["7.1.2"],"78.0.3904.126":["7.1.3"],"78.0.3904.130":["7.1.4","7.1.5","7.1.6","7.1.7","7.1.8","7.1.9","7.1.10","7.1.11","7.1.12","7.1.13","7.1.14","7.2.0","7.2.1","7.2.2","7.2.3","7.2.4","7.3.0","7.3.1","7.3.2","7.3.3"],"79.0.3931.0":["8.0.0-beta.1","8.0.0-beta.2","8.0.0-nightly.20191019","8.0.0-nightly.20191020","8.0.0-nightly.20191021","8.0.0-nightly.20191023"],"80.0.3955.0":["8.0.0-beta.3","8.0.0-beta.4"],"80.0.3987.14":["8.0.0-beta.5"],"80.0.3987.51":["8.0.0-beta.6"],"80.0.3987.59":["8.0.0-beta.7"],"80.0.3987.75":["8.0.0-beta.8","8.0.0-beta.9"],"78.0.3871.0":["8.0.0-nightly.20190803","8.0.0-nightly.20190806","8.0.0-nightly.20190807","8.0.0-nightly.20190808","8.0.0-nightly.20190809","8.0.0-nightly.20190810","8.0.0-nightly.20190811","8.0.0-nightly.20190812","8.0.0-nightly.20190813","8.0.0-nightly.20190814","8.0.0-nightly.20190815"],"78.0.3881.0":["8.0.0-nightly.20190816","8.0.0-nightly.20190817","8.0.0-nightly.20190818","8.0.0-nightly.20190819","8.0.0-nightly.20190820"],"78.0.3892.0":["8.0.0-nightly.20190824","8.0.0-nightly.20190825","8.0.0-nightly.20190827","8.0.0-nightly.20190828","8.0.0-nightly.20190830","8.0.0-nightly.20190901","8.0.0-nightly.20190902","8.0.0-nightly.20190907","8.0.0-nightly.20190909","8.0.0-nightly.20190910","8.0.0-nightly.20190911","8.0.0-nightly.20190913","8.0.0-nightly.20190914","8.0.0-nightly.20190915","8.0.0-nightly.20190917"],"79.0.3915.0":["8.0.0-nightly.20190919","8.0.0-nightly.20190920"],"79.0.3919.0":["8.0.0-nightly.20190923","8.0.0-nightly.20190924","8.0.0-nightly.20190926","8.0.0-nightly.20190929","8.0.0-nightly.20190930","8.0.0-nightly.20191001","8.0.0-nightly.20191004","8.0.0-nightly.20191005","8.0.0-nightly.20191006","8.0.0-nightly.20191009","8.0.0-nightly.20191011","8.0.0-nightly.20191012","8.0.0-nightly.20191017"],"80.0.3952.0":["8.0.0-nightly.20191101","8.0.0-nightly.20191105"],"80.0.3987.86":["8.0.0","8.0.1","8.0.2"],"80.0.3987.134":["8.0.3"],"80.0.3987.137":["8.1.0"],"80.0.3987.141":["8.1.1"],"80.0.3987.158":["8.2.0"],"80.0.3987.163":["8.2.1","8.2.2","8.2.3","8.5.3","8.5.4","8.5.5"],"80.0.3987.165":["8.2.4","8.2.5","8.3.0","8.3.1","8.3.2","8.3.3","8.3.4","8.4.0","8.4.1","8.5.0","8.5.1","8.5.2"],"82.0.4048.0":["9.0.0-beta.1","9.0.0-beta.2","9.0.0-beta.3","9.0.0-beta.4","9.0.0-beta.5"],"82.0.4058.2":["9.0.0-beta.6","9.0.0-beta.7","9.0.0-beta.9"],"82.0.4085.10":["9.0.0-beta.10"],"82.0.4085.14":["9.0.0-beta.12","9.0.0-beta.13"],"82.0.4085.27":["9.0.0-beta.14"],"83.0.4102.3":["9.0.0-beta.15","9.0.0-beta.16"],"83.0.4103.14":["9.0.0-beta.17"],"83.0.4103.16":["9.0.0-beta.18"],"83.0.4103.24":["9.0.0-beta.19"],"83.0.4103.26":["9.0.0-beta.20","9.0.0-beta.21"],"83.0.4103.34":["9.0.0-beta.22"],"83.0.4103.44":["9.0.0-beta.23"],"83.0.4103.45":["9.0.0-beta.24"],"80.0.3954.0":["9.0.0-nightly.20191121","9.0.0-nightly.20191122","9.0.0-nightly.20191123","9.0.0-nightly.20191124","9.0.0-nightly.20191129","9.0.0-nightly.20191130","9.0.0-nightly.20191201","9.0.0-nightly.20191202","9.0.0-nightly.20191203","9.0.0-nightly.20191204","9.0.0-nightly.20191210"],"81.0.3994.0":["9.0.0-nightly.20191220","9.0.0-nightly.20191221","9.0.0-nightly.20191222","9.0.0-nightly.20191223","9.0.0-nightly.20191224","9.0.0-nightly.20191225","9.0.0-nightly.20191226","9.0.0-nightly.20191228","9.0.0-nightly.20191229","9.0.0-nightly.20191230","9.0.0-nightly.20191231","9.0.0-nightly.20200101","9.0.0-nightly.20200103","9.0.0-nightly.20200104","9.0.0-nightly.20200105","9.0.0-nightly.20200106","9.0.0-nightly.20200108","9.0.0-nightly.20200109","9.0.0-nightly.20200110","9.0.0-nightly.20200111","9.0.0-nightly.20200113","9.0.0-nightly.20200115","9.0.0-nightly.20200116","9.0.0-nightly.20200117"],"81.0.4030.0":["9.0.0-nightly.20200119","9.0.0-nightly.20200121"],"83.0.4103.64":["9.0.0"],"83.0.4103.94":["9.0.1","9.0.2"],"83.0.4103.100":["9.0.3"],"83.0.4103.104":["9.0.4"],"83.0.4103.119":["9.0.5"],"83.0.4103.122":["9.1.0","9.1.1","9.1.2","9.2.0","9.2.1","9.3.0","9.3.1","9.3.2","9.3.3","9.3.4","9.3.5","9.4.0","9.4.1","9.4.2","9.4.3","9.4.4"],"84.0.4129.0":["10.0.0-beta.1","10.0.0-beta.2","10.0.0-nightly.20200501","10.0.0-nightly.20200504","10.0.0-nightly.20200505","10.0.0-nightly.20200506","10.0.0-nightly.20200507","10.0.0-nightly.20200508","10.0.0-nightly.20200511","10.0.0-nightly.20200512","10.0.0-nightly.20200513","10.0.0-nightly.20200514","10.0.0-nightly.20200515","10.0.0-nightly.20200518","10.0.0-nightly.20200519","10.0.0-nightly.20200520","10.0.0-nightly.20200521","11.0.0-nightly.20200525","11.0.0-nightly.20200526"],"85.0.4161.2":["10.0.0-beta.3","10.0.0-beta.4"],"85.0.4181.1":["10.0.0-beta.8","10.0.0-beta.9"],"85.0.4183.19":["10.0.0-beta.10"],"85.0.4183.20":["10.0.0-beta.11"],"85.0.4183.26":["10.0.0-beta.12"],"85.0.4183.39":["10.0.0-beta.13","10.0.0-beta.14","10.0.0-beta.15","10.0.0-beta.17","10.0.0-beta.19","10.0.0-beta.20","10.0.0-beta.21"],"85.0.4183.70":["10.0.0-beta.23"],"85.0.4183.78":["10.0.0-beta.24"],"85.0.4183.80":["10.0.0-beta.25"],"82.0.4050.0":["10.0.0-nightly.20200209","10.0.0-nightly.20200210","10.0.0-nightly.20200211","10.0.0-nightly.20200216","10.0.0-nightly.20200217","10.0.0-nightly.20200218","10.0.0-nightly.20200221","10.0.0-nightly.20200222","10.0.0-nightly.20200223","10.0.0-nightly.20200226","10.0.0-nightly.20200303"],"82.0.4076.0":["10.0.0-nightly.20200304","10.0.0-nightly.20200305","10.0.0-nightly.20200306","10.0.0-nightly.20200309","10.0.0-nightly.20200310"],"82.0.4083.0":["10.0.0-nightly.20200311"],"83.0.4086.0":["10.0.0-nightly.20200316"],"83.0.4087.0":["10.0.0-nightly.20200317","10.0.0-nightly.20200318","10.0.0-nightly.20200320","10.0.0-nightly.20200323","10.0.0-nightly.20200324","10.0.0-nightly.20200325","10.0.0-nightly.20200326","10.0.0-nightly.20200327","10.0.0-nightly.20200330","10.0.0-nightly.20200331","10.0.0-nightly.20200401","10.0.0-nightly.20200402","10.0.0-nightly.20200403","10.0.0-nightly.20200406"],"83.0.4095.0":["10.0.0-nightly.20200408","10.0.0-nightly.20200410","10.0.0-nightly.20200413"],"84.0.4114.0":["10.0.0-nightly.20200414"],"84.0.4115.0":["10.0.0-nightly.20200415","10.0.0-nightly.20200416","10.0.0-nightly.20200417"],"84.0.4121.0":["10.0.0-nightly.20200422","10.0.0-nightly.20200423"],"84.0.4125.0":["10.0.0-nightly.20200427","10.0.0-nightly.20200428","10.0.0-nightly.20200429","10.0.0-nightly.20200430"],"85.0.4183.84":["10.0.0"],"85.0.4183.86":["10.0.1"],"85.0.4183.87":["10.1.0"],"85.0.4183.93":["10.1.1"],"85.0.4183.98":["10.1.2"],"85.0.4183.121":["10.1.3","10.1.4","10.1.5","10.1.6","10.1.7","10.2.0","10.3.0","10.3.1","10.3.2","10.4.0","10.4.1","10.4.2","10.4.3","10.4.4","10.4.5","10.4.6","10.4.7"],"86.0.4234.0":["11.0.0-beta.1","11.0.0-beta.3","11.0.0-beta.4","11.0.0-beta.5","11.0.0-beta.6","11.0.0-beta.7","11.0.0-nightly.20200822","11.0.0-nightly.20200824","11.0.0-nightly.20200825","11.0.0-nightly.20200826","12.0.0-nightly.20200827","12.0.0-nightly.20200831","12.0.0-nightly.20200902","12.0.0-nightly.20200903","12.0.0-nightly.20200907","12.0.0-nightly.20200910","12.0.0-nightly.20200911","12.0.0-nightly.20200914"],"87.0.4251.1":["11.0.0-beta.8","11.0.0-beta.9","11.0.0-beta.11"],"87.0.4280.11":["11.0.0-beta.12","11.0.0-beta.13"],"87.0.4280.27":["11.0.0-beta.16","11.0.0-beta.17","11.0.0-beta.18","11.0.0-beta.19"],"87.0.4280.40":["11.0.0-beta.20"],"87.0.4280.47":["11.0.0-beta.22","11.0.0-beta.23"],"85.0.4156.0":["11.0.0-nightly.20200529"],"85.0.4162.0":["11.0.0-nightly.20200602","11.0.0-nightly.20200603","11.0.0-nightly.20200604","11.0.0-nightly.20200609","11.0.0-nightly.20200610","11.0.0-nightly.20200611","11.0.0-nightly.20200615","11.0.0-nightly.20200616","11.0.0-nightly.20200617","11.0.0-nightly.20200618","11.0.0-nightly.20200619"],"85.0.4179.0":["11.0.0-nightly.20200701","11.0.0-nightly.20200702","11.0.0-nightly.20200703","11.0.0-nightly.20200706","11.0.0-nightly.20200707","11.0.0-nightly.20200708","11.0.0-nightly.20200709"],"86.0.4203.0":["11.0.0-nightly.20200716","11.0.0-nightly.20200717","11.0.0-nightly.20200720","11.0.0-nightly.20200721"],"86.0.4209.0":["11.0.0-nightly.20200723","11.0.0-nightly.20200724","11.0.0-nightly.20200729","11.0.0-nightly.20200730","11.0.0-nightly.20200731","11.0.0-nightly.20200803","11.0.0-nightly.20200804","11.0.0-nightly.20200805","11.0.0-nightly.20200811","11.0.0-nightly.20200812"],"87.0.4280.60":["11.0.0","11.0.1"],"87.0.4280.67":["11.0.2","11.0.3","11.0.4"],"87.0.4280.88":["11.0.5","11.1.0","11.1.1"],"87.0.4280.141":["11.2.0","11.2.1","11.2.2","11.2.3","11.3.0","11.4.0","11.4.1","11.4.2","11.4.3","11.4.4","11.4.5","11.4.6","11.4.7","11.4.8","11.4.9","11.4.10","11.4.11","11.4.12","11.5.0"],"89.0.4328.0":["12.0.0-beta.1","12.0.0-beta.3","12.0.0-beta.4","12.0.0-beta.5","12.0.0-beta.6","12.0.0-beta.7","12.0.0-beta.8","12.0.0-beta.9","12.0.0-beta.10","12.0.0-beta.11","12.0.0-beta.12","12.0.0-beta.14","13.0.0-nightly.20201119","13.0.0-nightly.20201123","13.0.0-nightly.20201124","13.0.0-nightly.20201126","13.0.0-nightly.20201127","13.0.0-nightly.20201130","13.0.0-nightly.20201201","13.0.0-nightly.20201202","13.0.0-nightly.20201203","13.0.0-nightly.20201204","13.0.0-nightly.20201207","13.0.0-nightly.20201208","13.0.0-nightly.20201209","13.0.0-nightly.20201210","13.0.0-nightly.20201211","13.0.0-nightly.20201214"],"89.0.4348.1":["12.0.0-beta.16","12.0.0-beta.18","12.0.0-beta.19","12.0.0-beta.20"],"89.0.4388.2":["12.0.0-beta.21","12.0.0-beta.22","12.0.0-beta.23","12.0.0-beta.24","12.0.0-beta.25","12.0.0-beta.26"],"89.0.4389.23":["12.0.0-beta.27","12.0.0-beta.28","12.0.0-beta.29"],"89.0.4389.58":["12.0.0-beta.30","12.0.0-beta.31"],"87.0.4268.0":["12.0.0-nightly.20201013","12.0.0-nightly.20201014","12.0.0-nightly.20201015"],"88.0.4292.0":["12.0.0-nightly.20201023","12.0.0-nightly.20201026"],"88.0.4306.0":["12.0.0-nightly.20201030","12.0.0-nightly.20201102","12.0.0-nightly.20201103","12.0.0-nightly.20201104","12.0.0-nightly.20201105","12.0.0-nightly.20201106","12.0.0-nightly.20201111","12.0.0-nightly.20201112"],"88.0.4324.0":["12.0.0-nightly.20201116"],"89.0.4389.69":["12.0.0"],"89.0.4389.82":["12.0.1"],"89.0.4389.90":["12.0.2"],"89.0.4389.114":["12.0.3","12.0.4"],"89.0.4389.128":["12.0.5","12.0.6","12.0.7","12.0.8","12.0.9","12.0.10","12.0.11","12.0.12","12.0.13","12.0.14","12.0.15","12.0.16","12.0.17","12.0.18","12.1.0","12.1.1","12.1.2","12.2.0","12.2.1","12.2.2","12.2.3"],"90.0.4402.0":["13.0.0-beta.2","13.0.0-beta.3","13.0.0-nightly.20210210","13.0.0-nightly.20210211","13.0.0-nightly.20210212","13.0.0-nightly.20210216","13.0.0-nightly.20210217","13.0.0-nightly.20210218","13.0.0-nightly.20210219","13.0.0-nightly.20210222","13.0.0-nightly.20210225","13.0.0-nightly.20210226","13.0.0-nightly.20210301","13.0.0-nightly.20210302","13.0.0-nightly.20210303","14.0.0-nightly.20210304"],"90.0.4415.0":["13.0.0-beta.4","13.0.0-beta.5","13.0.0-beta.6","13.0.0-beta.7","13.0.0-beta.8","13.0.0-beta.9","13.0.0-beta.11","13.0.0-beta.12","13.0.0-beta.13","14.0.0-nightly.20210305","14.0.0-nightly.20210308","14.0.0-nightly.20210309","14.0.0-nightly.20210311","14.0.0-nightly.20210315","14.0.0-nightly.20210316","14.0.0-nightly.20210317","14.0.0-nightly.20210318","14.0.0-nightly.20210319","14.0.0-nightly.20210323","14.0.0-nightly.20210324","14.0.0-nightly.20210325","14.0.0-nightly.20210326","14.0.0-nightly.20210329","14.0.0-nightly.20210330"],"91.0.4448.0":["13.0.0-beta.14","13.0.0-beta.16","13.0.0-beta.17","13.0.0-beta.18","13.0.0-beta.20","14.0.0-nightly.20210331","14.0.0-nightly.20210401","14.0.0-nightly.20210402","14.0.0-nightly.20210406","14.0.0-nightly.20210407","14.0.0-nightly.20210408","14.0.0-nightly.20210409","14.0.0-nightly.20210413","14.0.0-nightly.20210413"],"91.0.4472.33":["13.0.0-beta.21","13.0.0-beta.22","13.0.0-beta.23"],"91.0.4472.38":["13.0.0-beta.24","13.0.0-beta.26","13.0.0-beta.27","13.0.0-beta.28"],"89.0.4349.0":["13.0.0-nightly.20201215","13.0.0-nightly.20201216","13.0.0-nightly.20201221","13.0.0-nightly.20201222"],"89.0.4359.0":["13.0.0-nightly.20201223","13.0.0-nightly.20210104","13.0.0-nightly.20210108","13.0.0-nightly.20210111"],"89.0.4386.0":["13.0.0-nightly.20210113","13.0.0-nightly.20210114","13.0.0-nightly.20210118","13.0.0-nightly.20210122","13.0.0-nightly.20210125"],"89.0.4389.0":["13.0.0-nightly.20210127","13.0.0-nightly.20210128","13.0.0-nightly.20210129","13.0.0-nightly.20210201","13.0.0-nightly.20210202","13.0.0-nightly.20210203","13.0.0-nightly.20210205","13.0.0-nightly.20210208","13.0.0-nightly.20210209"],"91.0.4472.69":["13.0.0","13.0.1"],"91.0.4472.77":["13.1.0","13.1.1","13.1.2"],"91.0.4472.106":["13.1.3","13.1.4"],"91.0.4472.124":["13.1.5","13.1.6","13.1.7"],"91.0.4472.164":["13.1.8","13.1.9","13.2.0","13.2.1","13.2.2","13.2.3","13.3.0","13.4.0","13.5.0","13.5.1","13.5.2","13.6.0","13.6.1","13.6.2","13.6.3","13.6.6","13.6.7","13.6.8","13.6.9"],"92.0.4511.0":["14.0.0-beta.1","14.0.0-beta.2","14.0.0-beta.3","14.0.0-nightly.20210520","14.0.0-nightly.20210523","14.0.0-nightly.20210524","15.0.0-nightly.20210527","15.0.0-nightly.20210528","15.0.0-nightly.20210531","15.0.0-nightly.20210601","15.0.0-nightly.20210602"],"93.0.4536.0":["14.0.0-beta.5","14.0.0-beta.6","14.0.0-beta.7","14.0.0-beta.8","15.0.0-nightly.20210609","15.0.0-nightly.20210610","15.0.0-nightly.20210611","15.0.0-nightly.20210614","15.0.0-nightly.20210615","15.0.0-nightly.20210616"],"93.0.4539.0":["14.0.0-beta.9","14.0.0-beta.10","15.0.0-nightly.20210617","15.0.0-nightly.20210618","15.0.0-nightly.20210621","15.0.0-nightly.20210622"],"93.0.4557.4":["14.0.0-beta.11","14.0.0-beta.12"],"93.0.4566.0":["14.0.0-beta.13","14.0.0-beta.14","14.0.0-beta.15","14.0.0-beta.16","14.0.0-beta.17","15.0.0-alpha.1","15.0.0-alpha.2","15.0.0-nightly.20210706","15.0.0-nightly.20210707","15.0.0-nightly.20210708","15.0.0-nightly.20210709","15.0.0-nightly.20210712","15.0.0-nightly.20210713","15.0.0-nightly.20210714","15.0.0-nightly.20210715","15.0.0-nightly.20210716","15.0.0-nightly.20210719","15.0.0-nightly.20210720","15.0.0-nightly.20210721","16.0.0-nightly.20210722","16.0.0-nightly.20210723","16.0.0-nightly.20210726"],"93.0.4577.15":["14.0.0-beta.18","14.0.0-beta.19","14.0.0-beta.20","14.0.0-beta.21"],"93.0.4577.25":["14.0.0-beta.22","14.0.0-beta.23"],"93.0.4577.51":["14.0.0-beta.24","14.0.0-beta.25"],"92.0.4475.0":["14.0.0-nightly.20210426","14.0.0-nightly.20210426","14.0.0-nightly.20210427","14.0.0-nightly.20210427"],"92.0.4488.0":["14.0.0-nightly.20210430","14.0.0-nightly.20210430","14.0.0-nightly.20210503","14.0.0-nightly.20210503"],"92.0.4496.0":["14.0.0-nightly.20210505","14.0.0-nightly.20210505"],"92.0.4498.0":["14.0.0-nightly.20210506","14.0.0-nightly.20210506"],"92.0.4499.0":["14.0.0-nightly.20210507","14.0.0-nightly.20210507","14.0.0-nightly.20210510","14.0.0-nightly.20210510","14.0.0-nightly.20210511","14.0.0-nightly.20210511","14.0.0-nightly.20210512","14.0.0-nightly.20210512","14.0.0-nightly.20210513","14.0.0-nightly.20210513"],"92.0.4505.0":["14.0.0-nightly.20210514","14.0.0-nightly.20210517","14.0.0-nightly.20210518","14.0.0-nightly.20210519"],"93.0.4577.58":["14.0.0"],"93.0.4577.63":["14.0.1"],"93.0.4577.82":["14.0.2","14.1.0","14.1.1","14.2.0","14.2.1","14.2.2","14.2.3","14.2.4","14.2.5","14.2.6","14.2.7","14.2.8"],"94.0.4584.0":["15.0.0-alpha.3","15.0.0-alpha.4","15.0.0-alpha.5","15.0.0-alpha.6","16.0.0-nightly.20210727","16.0.0-nightly.20210728","16.0.0-nightly.20210729","16.0.0-nightly.20210802","16.0.0-nightly.20210803","16.0.0-nightly.20210804","16.0.0-nightly.20210805","16.0.0-nightly.20210806","16.0.0-nightly.20210809","16.0.0-nightly.20210810","16.0.0-nightly.20210811"],"94.0.4590.2":["15.0.0-alpha.7","15.0.0-alpha.8","15.0.0-alpha.9","16.0.0-nightly.20210812","16.0.0-nightly.20210813","16.0.0-nightly.20210816","16.0.0-nightly.20210817","16.0.0-nightly.20210818","16.0.0-nightly.20210819","16.0.0-nightly.20210820","16.0.0-nightly.20210823"],"94.0.4606.12":["15.0.0-alpha.10"],"94.0.4606.20":["15.0.0-beta.1","15.0.0-beta.2"],"94.0.4606.31":["15.0.0-beta.3","15.0.0-beta.4","15.0.0-beta.5","15.0.0-beta.6","15.0.0-beta.7"],"93.0.4530.0":["15.0.0-nightly.20210603","15.0.0-nightly.20210604"],"93.0.4535.0":["15.0.0-nightly.20210608"],"93.0.4550.0":["15.0.0-nightly.20210623","15.0.0-nightly.20210624"],"93.0.4552.0":["15.0.0-nightly.20210625","15.0.0-nightly.20210628","15.0.0-nightly.20210629"],"93.0.4558.0":["15.0.0-nightly.20210630","15.0.0-nightly.20210701","15.0.0-nightly.20210702"],"94.0.4606.51":["15.0.0"],"94.0.4606.61":["15.1.0","15.1.1"],"94.0.4606.71":["15.1.2"],"94.0.4606.81":["15.2.0","15.3.0","15.3.1","15.3.2","15.3.3","15.3.4","15.3.5","15.3.6","15.3.7","15.4.0","15.4.1","15.4.2"],"95.0.4629.0":["16.0.0-alpha.1","16.0.0-alpha.2","16.0.0-alpha.3","16.0.0-alpha.4","16.0.0-alpha.5","16.0.0-alpha.6","16.0.0-alpha.7","16.0.0-nightly.20210902","16.0.0-nightly.20210903","16.0.0-nightly.20210906","16.0.0-nightly.20210907","16.0.0-nightly.20210908","16.0.0-nightly.20210909","16.0.0-nightly.20210910","16.0.0-nightly.20210913","16.0.0-nightly.20210914","16.0.0-nightly.20210915","16.0.0-nightly.20210916","16.0.0-nightly.20210917","16.0.0-nightly.20210920","16.0.0-nightly.20210921"],"96.0.4647.0":["16.0.0-alpha.8","16.0.0-alpha.9","16.0.0-beta.1","16.0.0-beta.2","16.0.0-beta.3","17.0.0-nightly.20211006","17.0.0-nightly.20211007","17.0.0-nightly.20211008","17.0.0-nightly.20211011","17.0.0-nightly.20211012","17.0.0-nightly.20211013","17.0.0-nightly.20211014","17.0.0-nightly.20211015","17.0.0-nightly.20211018","17.0.0-nightly.20211019","17.0.0-nightly.20211020","17.0.0-nightly.20211021"],"96.0.4664.18":["16.0.0-beta.4","16.0.0-beta.5"],"96.0.4664.27":["16.0.0-beta.6","16.0.0-beta.7"],"96.0.4664.35":["16.0.0-beta.8","16.0.0-beta.9"],"95.0.4612.5":["16.0.0-nightly.20210824","16.0.0-nightly.20210825","16.0.0-nightly.20210826","16.0.0-nightly.20210827","16.0.0-nightly.20210830","16.0.0-nightly.20210831","16.0.0-nightly.20210901"],"96.0.4664.45":["16.0.0","16.0.1"],"96.0.4664.55":["16.0.2","16.0.3","16.0.4","16.0.5"],"96.0.4664.110":["16.0.6","16.0.7","16.0.8"],"96.0.4664.174":["16.0.9","16.0.10","16.1.0","16.1.1"],"96.0.4664.4":["17.0.0-alpha.1","17.0.0-alpha.2","17.0.0-alpha.3","17.0.0-nightly.20211022","17.0.0-nightly.20211025","17.0.0-nightly.20211026","17.0.0-nightly.20211027","17.0.0-nightly.20211028","17.0.0-nightly.20211029","17.0.0-nightly.20211101","17.0.0-nightly.20211102","17.0.0-nightly.20211103","17.0.0-nightly.20211104","17.0.0-nightly.20211105","17.0.0-nightly.20211108","17.0.0-nightly.20211109","17.0.0-nightly.20211110","17.0.0-nightly.20211111","17.0.0-nightly.20211112","17.0.0-nightly.20211115","17.0.0-nightly.20211116","17.0.0-nightly.20211117","18.0.0-nightly.20211118","18.0.0-nightly.20211119","18.0.0-nightly.20211122","18.0.0-nightly.20211123"],"98.0.4706.0":["17.0.0-alpha.4","17.0.0-alpha.5","17.0.0-alpha.6","17.0.0-beta.1","17.0.0-beta.2","18.0.0-nightly.20211124","18.0.0-nightly.20211125","18.0.0-nightly.20211126","18.0.0-nightly.20211129","18.0.0-nightly.20211130","18.0.0-nightly.20211201","18.0.0-nightly.20211202","18.0.0-nightly.20211203","18.0.0-nightly.20211206","18.0.0-nightly.20211207","18.0.0-nightly.20211208","18.0.0-nightly.20211209","18.0.0-nightly.20211210","18.0.0-nightly.20211213","18.0.0-nightly.20211214","18.0.0-nightly.20211215","18.0.0-nightly.20211216","18.0.0-nightly.20211217","18.0.0-nightly.20211220","18.0.0-nightly.20211221","18.0.0-nightly.20211222","18.0.0-nightly.20211223","18.0.0-nightly.20211228","18.0.0-nightly.20211229","18.0.0-nightly.20211231","18.0.0-nightly.20220103","18.0.0-nightly.20220104","18.0.0-nightly.20220105","18.0.0-nightly.20220106","18.0.0-nightly.20220107","18.0.0-nightly.20220110"],"98.0.4758.9":["17.0.0-beta.3"],"98.0.4758.11":["17.0.0-beta.4","17.0.0-beta.5","17.0.0-beta.6","17.0.0-beta.7","17.0.0-beta.8","17.0.0-beta.9"],"98.0.4758.74":["17.0.0"],"98.0.4758.82":["17.0.1"],"98.0.4758.102":["17.1.0"],"98.0.4758.109":["17.1.1","17.1.2","17.2.0"],"99.0.4767.0":["18.0.0-alpha.1","18.0.0-alpha.2","18.0.0-alpha.3","18.0.0-alpha.4","18.0.0-alpha.5","18.0.0-nightly.20220111","18.0.0-nightly.20220112","18.0.0-nightly.20220113","18.0.0-nightly.20220114","18.0.0-nightly.20220117","18.0.0-nightly.20220118","18.0.0-nightly.20220119","18.0.0-nightly.20220121","18.0.0-nightly.20220124","18.0.0-nightly.20220125","18.0.0-nightly.20220127","18.0.0-nightly.20220128","18.0.0-nightly.20220131","18.0.0-nightly.20220201","19.0.0-nightly.20220202","19.0.0-nightly.20220203","19.0.0-nightly.20220204","19.0.0-nightly.20220207","19.0.0-nightly.20220208","19.0.0-nightly.20220209"],"100.0.4894.0":["18.0.0-beta.1","18.0.0-beta.2","18.0.0-beta.3","18.0.0-beta.4","18.0.0-beta.5","18.0.0-beta.6","19.0.0-nightly.20220308","19.0.0-nightly.20220309","19.0.0-nightly.20220310","19.0.0-nightly.20220311","19.0.0-nightly.20220314","19.0.0-nightly.20220315","19.0.0-nightly.20220316","19.0.0-nightly.20220317","19.0.0-nightly.20220318","19.0.0-nightly.20220321","19.0.0-nightly.20220322","19.0.0-nightly.20220323","19.0.0-nightly.20220324"],"102.0.4961.0":["19.0.0-nightly.20220325"]}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-versions.js b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-versions.js
new file mode 100644
index 0000000..4f093c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-versions.js
@@ -0,0 +1,1335 @@
+module.exports = {
+	"0.20.0": "39.0.2171.65",
+	"0.20.1": "39.0.2171.65",
+	"0.20.2": "39.0.2171.65",
+	"0.20.3": "39.0.2171.65",
+	"0.20.4": "39.0.2171.65",
+	"0.20.5": "39.0.2171.65",
+	"0.20.6": "39.0.2171.65",
+	"0.20.7": "39.0.2171.65",
+	"0.20.8": "39.0.2171.65",
+	"0.21.0": "40.0.2214.91",
+	"0.21.1": "40.0.2214.91",
+	"0.21.2": "40.0.2214.91",
+	"0.21.3": "41.0.2272.76",
+	"0.22.1": "41.0.2272.76",
+	"0.22.2": "41.0.2272.76",
+	"0.22.3": "41.0.2272.76",
+	"0.23.0": "41.0.2272.76",
+	"0.24.0": "41.0.2272.76",
+	"0.25.0": "42.0.2311.107",
+	"0.25.1": "42.0.2311.107",
+	"0.25.2": "42.0.2311.107",
+	"0.25.3": "42.0.2311.107",
+	"0.26.0": "42.0.2311.107",
+	"0.26.1": "42.0.2311.107",
+	"0.27.0": "42.0.2311.107",
+	"0.27.1": "42.0.2311.107",
+	"0.27.2": "43.0.2357.65",
+	"0.27.3": "43.0.2357.65",
+	"0.28.0": "43.0.2357.65",
+	"0.28.1": "43.0.2357.65",
+	"0.28.2": "43.0.2357.65",
+	"0.28.3": "43.0.2357.65",
+	"0.29.1": "43.0.2357.65",
+	"0.29.2": "43.0.2357.65",
+	"0.30.4": "44.0.2403.125",
+	"0.31.0": "44.0.2403.125",
+	"0.31.2": "45.0.2454.85",
+	"0.32.2": "45.0.2454.85",
+	"0.32.3": "45.0.2454.85",
+	"0.33.0": "45.0.2454.85",
+	"0.33.1": "45.0.2454.85",
+	"0.33.2": "45.0.2454.85",
+	"0.33.3": "45.0.2454.85",
+	"0.33.4": "45.0.2454.85",
+	"0.33.6": "45.0.2454.85",
+	"0.33.7": "45.0.2454.85",
+	"0.33.8": "45.0.2454.85",
+	"0.33.9": "45.0.2454.85",
+	"0.34.0": "45.0.2454.85",
+	"0.34.1": "45.0.2454.85",
+	"0.34.2": "45.0.2454.85",
+	"0.34.3": "45.0.2454.85",
+	"0.34.4": "45.0.2454.85",
+	"0.35.1": "45.0.2454.85",
+	"0.35.2": "45.0.2454.85",
+	"0.35.3": "45.0.2454.85",
+	"0.35.4": "45.0.2454.85",
+	"0.35.5": "45.0.2454.85",
+	"0.36.0": "47.0.2526.73",
+	"0.36.2": "47.0.2526.73",
+	"0.36.3": "47.0.2526.73",
+	"0.36.4": "47.0.2526.73",
+	"0.36.5": "47.0.2526.110",
+	"0.36.6": "47.0.2526.110",
+	"0.36.7": "47.0.2526.110",
+	"0.36.8": "47.0.2526.110",
+	"0.36.9": "47.0.2526.110",
+	"0.36.10": "47.0.2526.110",
+	"0.36.11": "47.0.2526.110",
+	"0.36.12": "47.0.2526.110",
+	"0.37.0": "49.0.2623.75",
+	"0.37.1": "49.0.2623.75",
+	"0.37.3": "49.0.2623.75",
+	"0.37.4": "49.0.2623.75",
+	"0.37.5": "49.0.2623.75",
+	"0.37.6": "49.0.2623.75",
+	"0.37.7": "49.0.2623.75",
+	"0.37.8": "49.0.2623.75",
+	"1.0.0": "49.0.2623.75",
+	"1.0.1": "49.0.2623.75",
+	"1.0.2": "49.0.2623.75",
+	"1.1.0": "50.0.2661.102",
+	"1.1.1": "50.0.2661.102",
+	"1.1.2": "50.0.2661.102",
+	"1.1.3": "50.0.2661.102",
+	"1.2.0": "51.0.2704.63",
+	"1.2.1": "51.0.2704.63",
+	"1.2.2": "51.0.2704.84",
+	"1.2.3": "51.0.2704.84",
+	"1.2.4": "51.0.2704.103",
+	"1.2.5": "51.0.2704.103",
+	"1.2.6": "51.0.2704.106",
+	"1.2.7": "51.0.2704.106",
+	"1.2.8": "51.0.2704.106",
+	"1.3.0": "52.0.2743.82",
+	"1.3.1": "52.0.2743.82",
+	"1.3.2": "52.0.2743.82",
+	"1.3.3": "52.0.2743.82",
+	"1.3.4": "52.0.2743.82",
+	"1.3.5": "52.0.2743.82",
+	"1.3.6": "52.0.2743.82",
+	"1.3.7": "52.0.2743.82",
+	"1.3.9": "52.0.2743.82",
+	"1.3.10": "52.0.2743.82",
+	"1.3.13": "52.0.2743.82",
+	"1.3.14": "52.0.2743.82",
+	"1.3.15": "52.0.2743.82",
+	"1.4.0": "53.0.2785.113",
+	"1.4.1": "53.0.2785.113",
+	"1.4.2": "53.0.2785.113",
+	"1.4.3": "53.0.2785.113",
+	"1.4.4": "53.0.2785.113",
+	"1.4.5": "53.0.2785.113",
+	"1.4.6": "53.0.2785.143",
+	"1.4.7": "53.0.2785.143",
+	"1.4.8": "53.0.2785.143",
+	"1.4.10": "53.0.2785.143",
+	"1.4.11": "53.0.2785.143",
+	"1.4.12": "54.0.2840.51",
+	"1.4.13": "53.0.2785.143",
+	"1.4.14": "53.0.2785.143",
+	"1.4.15": "53.0.2785.143",
+	"1.4.16": "53.0.2785.143",
+	"1.5.0": "54.0.2840.101",
+	"1.5.1": "54.0.2840.101",
+	"1.6.0": "56.0.2924.87",
+	"1.6.1": "56.0.2924.87",
+	"1.6.2": "56.0.2924.87",
+	"1.6.3": "56.0.2924.87",
+	"1.6.4": "56.0.2924.87",
+	"1.6.5": "56.0.2924.87",
+	"1.6.6": "56.0.2924.87",
+	"1.6.7": "56.0.2924.87",
+	"1.6.8": "56.0.2924.87",
+	"1.6.9": "56.0.2924.87",
+	"1.6.10": "56.0.2924.87",
+	"1.6.11": "56.0.2924.87",
+	"1.6.12": "56.0.2924.87",
+	"1.6.13": "56.0.2924.87",
+	"1.6.14": "56.0.2924.87",
+	"1.6.15": "56.0.2924.87",
+	"1.6.16": "56.0.2924.87",
+	"1.6.17": "56.0.2924.87",
+	"1.6.18": "56.0.2924.87",
+	"1.7.0": "58.0.3029.110",
+	"1.7.1": "58.0.3029.110",
+	"1.7.2": "58.0.3029.110",
+	"1.7.3": "58.0.3029.110",
+	"1.7.4": "58.0.3029.110",
+	"1.7.5": "58.0.3029.110",
+	"1.7.6": "58.0.3029.110",
+	"1.7.7": "58.0.3029.110",
+	"1.7.8": "58.0.3029.110",
+	"1.7.9": "58.0.3029.110",
+	"1.7.10": "58.0.3029.110",
+	"1.7.11": "58.0.3029.110",
+	"1.7.12": "58.0.3029.110",
+	"1.7.13": "58.0.3029.110",
+	"1.7.14": "58.0.3029.110",
+	"1.7.15": "58.0.3029.110",
+	"1.7.16": "58.0.3029.110",
+	"1.8.0": "59.0.3071.115",
+	"1.8.1": "59.0.3071.115",
+	"1.8.2-beta.1": "59.0.3071.115",
+	"1.8.2-beta.2": "59.0.3071.115",
+	"1.8.2-beta.3": "59.0.3071.115",
+	"1.8.2-beta.4": "59.0.3071.115",
+	"1.8.2-beta.5": "59.0.3071.115",
+	"1.8.2": "59.0.3071.115",
+	"1.8.3": "59.0.3071.115",
+	"1.8.4": "59.0.3071.115",
+	"1.8.5": "59.0.3071.115",
+	"1.8.6": "59.0.3071.115",
+	"1.8.7": "59.0.3071.115",
+	"1.8.8": "59.0.3071.115",
+	"2.0.0-beta.1": "61.0.3163.100",
+	"2.0.0-beta.2": "61.0.3163.100",
+	"2.0.0-beta.3": "61.0.3163.100",
+	"2.0.0-beta.4": "61.0.3163.100",
+	"2.0.0-beta.5": "61.0.3163.100",
+	"2.0.0-beta.6": "61.0.3163.100",
+	"2.0.0-beta.7": "61.0.3163.100",
+	"2.0.0-beta.8": "61.0.3163.100",
+	"2.0.0": "61.0.3163.100",
+	"2.0.1": "61.0.3163.100",
+	"2.0.2": "61.0.3163.100",
+	"2.0.3": "61.0.3163.100",
+	"2.0.4": "61.0.3163.100",
+	"2.0.5": "61.0.3163.100",
+	"2.0.6": "61.0.3163.100",
+	"2.0.7": "61.0.3163.100",
+	"2.0.8-nightly.20180819": "61.0.3163.100",
+	"2.0.8-nightly.20180820": "61.0.3163.100",
+	"2.0.8": "61.0.3163.100",
+	"2.0.9": "61.0.3163.100",
+	"2.0.10": "61.0.3163.100",
+	"2.0.11": "61.0.3163.100",
+	"2.0.12": "61.0.3163.100",
+	"2.0.13": "61.0.3163.100",
+	"2.0.14": "61.0.3163.100",
+	"2.0.15": "61.0.3163.100",
+	"2.0.16": "61.0.3163.100",
+	"2.0.17": "61.0.3163.100",
+	"2.0.18": "61.0.3163.100",
+	"2.1.0-unsupported.20180809": "61.0.3163.100",
+	"3.0.0-beta.1": "66.0.3359.181",
+	"3.0.0-beta.2": "66.0.3359.181",
+	"3.0.0-beta.3": "66.0.3359.181",
+	"3.0.0-beta.4": "66.0.3359.181",
+	"3.0.0-beta.5": "66.0.3359.181",
+	"3.0.0-beta.6": "66.0.3359.181",
+	"3.0.0-beta.7": "66.0.3359.181",
+	"3.0.0-beta.8": "66.0.3359.181",
+	"3.0.0-beta.9": "66.0.3359.181",
+	"3.0.0-beta.10": "66.0.3359.181",
+	"3.0.0-beta.11": "66.0.3359.181",
+	"3.0.0-beta.12": "66.0.3359.181",
+	"3.0.0-beta.13": "66.0.3359.181",
+	"3.0.0-nightly.20180818": "66.0.3359.181",
+	"3.0.0-nightly.20180821": "66.0.3359.181",
+	"3.0.0-nightly.20180823": "66.0.3359.181",
+	"3.0.0-nightly.20180904": "66.0.3359.181",
+	"3.0.0": "66.0.3359.181",
+	"3.0.1": "66.0.3359.181",
+	"3.0.2": "66.0.3359.181",
+	"3.0.3": "66.0.3359.181",
+	"3.0.4": "66.0.3359.181",
+	"3.0.5": "66.0.3359.181",
+	"3.0.6": "66.0.3359.181",
+	"3.0.7": "66.0.3359.181",
+	"3.0.8": "66.0.3359.181",
+	"3.0.9": "66.0.3359.181",
+	"3.0.10": "66.0.3359.181",
+	"3.0.11": "66.0.3359.181",
+	"3.0.12": "66.0.3359.181",
+	"3.0.13": "66.0.3359.181",
+	"3.0.14": "66.0.3359.181",
+	"3.0.15": "66.0.3359.181",
+	"3.0.16": "66.0.3359.181",
+	"3.1.0-beta.1": "66.0.3359.181",
+	"3.1.0-beta.2": "66.0.3359.181",
+	"3.1.0-beta.3": "66.0.3359.181",
+	"3.1.0-beta.4": "66.0.3359.181",
+	"3.1.0-beta.5": "66.0.3359.181",
+	"3.1.0": "66.0.3359.181",
+	"3.1.1": "66.0.3359.181",
+	"3.1.2": "66.0.3359.181",
+	"3.1.3": "66.0.3359.181",
+	"3.1.4": "66.0.3359.181",
+	"3.1.5": "66.0.3359.181",
+	"3.1.6": "66.0.3359.181",
+	"3.1.7": "66.0.3359.181",
+	"3.1.8": "66.0.3359.181",
+	"3.1.9": "66.0.3359.181",
+	"3.1.10": "66.0.3359.181",
+	"3.1.11": "66.0.3359.181",
+	"3.1.12": "66.0.3359.181",
+	"3.1.13": "66.0.3359.181",
+	"4.0.0-beta.1": "69.0.3497.106",
+	"4.0.0-beta.2": "69.0.3497.106",
+	"4.0.0-beta.3": "69.0.3497.106",
+	"4.0.0-beta.4": "69.0.3497.106",
+	"4.0.0-beta.5": "69.0.3497.106",
+	"4.0.0-beta.6": "69.0.3497.106",
+	"4.0.0-beta.7": "69.0.3497.106",
+	"4.0.0-beta.8": "69.0.3497.106",
+	"4.0.0-beta.9": "69.0.3497.106",
+	"4.0.0-beta.10": "69.0.3497.106",
+	"4.0.0-beta.11": "69.0.3497.106",
+	"4.0.0-nightly.20180817": "66.0.3359.181",
+	"4.0.0-nightly.20180819": "66.0.3359.181",
+	"4.0.0-nightly.20180821": "66.0.3359.181",
+	"4.0.0-nightly.20180929": "67.0.3396.99",
+	"4.0.0-nightly.20181006": "68.0.3440.128",
+	"4.0.0-nightly.20181010": "69.0.3497.106",
+	"4.0.0": "69.0.3497.106",
+	"4.0.1": "69.0.3497.106",
+	"4.0.2": "69.0.3497.106",
+	"4.0.3": "69.0.3497.106",
+	"4.0.4": "69.0.3497.106",
+	"4.0.5": "69.0.3497.106",
+	"4.0.6": "69.0.3497.106",
+	"4.0.7": "69.0.3497.128",
+	"4.0.8": "69.0.3497.128",
+	"4.1.0": "69.0.3497.128",
+	"4.1.1": "69.0.3497.128",
+	"4.1.2": "69.0.3497.128",
+	"4.1.3": "69.0.3497.128",
+	"4.1.4": "69.0.3497.128",
+	"4.1.5": "69.0.3497.128",
+	"4.2.0": "69.0.3497.128",
+	"4.2.1": "69.0.3497.128",
+	"4.2.2": "69.0.3497.128",
+	"4.2.3": "69.0.3497.128",
+	"4.2.4": "69.0.3497.128",
+	"4.2.5": "69.0.3497.128",
+	"4.2.6": "69.0.3497.128",
+	"4.2.7": "69.0.3497.128",
+	"4.2.8": "69.0.3497.128",
+	"4.2.9": "69.0.3497.128",
+	"4.2.10": "69.0.3497.128",
+	"4.2.11": "69.0.3497.128",
+	"4.2.12": "69.0.3497.128",
+	"5.0.0-beta.1": "72.0.3626.52",
+	"5.0.0-beta.2": "72.0.3626.52",
+	"5.0.0-beta.3": "73.0.3683.27",
+	"5.0.0-beta.4": "73.0.3683.54",
+	"5.0.0-beta.5": "73.0.3683.61",
+	"5.0.0-beta.6": "73.0.3683.84",
+	"5.0.0-beta.7": "73.0.3683.94",
+	"5.0.0-beta.8": "73.0.3683.104",
+	"5.0.0-beta.9": "73.0.3683.117",
+	"5.0.0-nightly.20190107": "70.0.3538.110",
+	"5.0.0-nightly.20190121": "71.0.3578.98",
+	"5.0.0-nightly.20190122": "71.0.3578.98",
+	"5.0.0": "73.0.3683.119",
+	"5.0.1": "73.0.3683.121",
+	"5.0.2": "73.0.3683.121",
+	"5.0.3": "73.0.3683.121",
+	"5.0.4": "73.0.3683.121",
+	"5.0.5": "73.0.3683.121",
+	"5.0.6": "73.0.3683.121",
+	"5.0.7": "73.0.3683.121",
+	"5.0.8": "73.0.3683.121",
+	"5.0.9": "73.0.3683.121",
+	"5.0.10": "73.0.3683.121",
+	"5.0.11": "73.0.3683.121",
+	"5.0.12": "73.0.3683.121",
+	"5.0.13": "73.0.3683.121",
+	"6.0.0-beta.1": "76.0.3774.1",
+	"6.0.0-beta.2": "76.0.3783.1",
+	"6.0.0-beta.3": "76.0.3783.1",
+	"6.0.0-beta.4": "76.0.3783.1",
+	"6.0.0-beta.5": "76.0.3805.4",
+	"6.0.0-beta.6": "76.0.3809.3",
+	"6.0.0-beta.7": "76.0.3809.22",
+	"6.0.0-beta.8": "76.0.3809.26",
+	"6.0.0-beta.9": "76.0.3809.26",
+	"6.0.0-beta.10": "76.0.3809.37",
+	"6.0.0-beta.11": "76.0.3809.42",
+	"6.0.0-beta.12": "76.0.3809.54",
+	"6.0.0-beta.13": "76.0.3809.60",
+	"6.0.0-beta.14": "76.0.3809.68",
+	"6.0.0-beta.15": "76.0.3809.74",
+	"6.0.0-nightly.20190212": "72.0.3626.107",
+	"6.0.0-nightly.20190213": "72.0.3626.110",
+	"6.0.0-nightly.20190311": "74.0.3724.8",
+	"6.0.0": "76.0.3809.88",
+	"6.0.1": "76.0.3809.102",
+	"6.0.2": "76.0.3809.110",
+	"6.0.3": "76.0.3809.126",
+	"6.0.4": "76.0.3809.131",
+	"6.0.5": "76.0.3809.136",
+	"6.0.6": "76.0.3809.138",
+	"6.0.7": "76.0.3809.139",
+	"6.0.8": "76.0.3809.146",
+	"6.0.9": "76.0.3809.146",
+	"6.0.10": "76.0.3809.146",
+	"6.0.11": "76.0.3809.146",
+	"6.0.12": "76.0.3809.146",
+	"6.1.0": "76.0.3809.146",
+	"6.1.1": "76.0.3809.146",
+	"6.1.2": "76.0.3809.146",
+	"6.1.3": "76.0.3809.146",
+	"6.1.4": "76.0.3809.146",
+	"6.1.5": "76.0.3809.146",
+	"6.1.6": "76.0.3809.146",
+	"6.1.7": "76.0.3809.146",
+	"6.1.8": "76.0.3809.146",
+	"6.1.9": "76.0.3809.146",
+	"6.1.10": "76.0.3809.146",
+	"6.1.11": "76.0.3809.146",
+	"6.1.12": "76.0.3809.146",
+	"7.0.0-beta.1": "78.0.3866.0",
+	"7.0.0-beta.2": "78.0.3866.0",
+	"7.0.0-beta.3": "78.0.3866.0",
+	"7.0.0-beta.4": "78.0.3896.6",
+	"7.0.0-beta.5": "78.0.3905.1",
+	"7.0.0-beta.6": "78.0.3905.1",
+	"7.0.0-beta.7": "78.0.3905.1",
+	"7.0.0-nightly.20190521": "76.0.3784.0",
+	"7.0.0-nightly.20190529": "76.0.3806.0",
+	"7.0.0-nightly.20190530": "76.0.3806.0",
+	"7.0.0-nightly.20190531": "76.0.3806.0",
+	"7.0.0-nightly.20190602": "76.0.3806.0",
+	"7.0.0-nightly.20190603": "76.0.3806.0",
+	"7.0.0-nightly.20190604": "77.0.3814.0",
+	"7.0.0-nightly.20190605": "77.0.3815.0",
+	"7.0.0-nightly.20190606": "77.0.3815.0",
+	"7.0.0-nightly.20190607": "77.0.3815.0",
+	"7.0.0-nightly.20190608": "77.0.3815.0",
+	"7.0.0-nightly.20190609": "77.0.3815.0",
+	"7.0.0-nightly.20190611": "77.0.3815.0",
+	"7.0.0-nightly.20190612": "77.0.3815.0",
+	"7.0.0-nightly.20190613": "77.0.3815.0",
+	"7.0.0-nightly.20190615": "77.0.3815.0",
+	"7.0.0-nightly.20190616": "77.0.3815.0",
+	"7.0.0-nightly.20190618": "77.0.3815.0",
+	"7.0.0-nightly.20190619": "77.0.3815.0",
+	"7.0.0-nightly.20190622": "77.0.3815.0",
+	"7.0.0-nightly.20190623": "77.0.3815.0",
+	"7.0.0-nightly.20190624": "77.0.3815.0",
+	"7.0.0-nightly.20190627": "77.0.3815.0",
+	"7.0.0-nightly.20190629": "77.0.3815.0",
+	"7.0.0-nightly.20190630": "77.0.3815.0",
+	"7.0.0-nightly.20190701": "77.0.3815.0",
+	"7.0.0-nightly.20190702": "77.0.3815.0",
+	"7.0.0-nightly.20190704": "77.0.3843.0",
+	"7.0.0-nightly.20190705": "77.0.3843.0",
+	"7.0.0-nightly.20190719": "77.0.3848.0",
+	"7.0.0-nightly.20190720": "77.0.3848.0",
+	"7.0.0-nightly.20190721": "77.0.3848.0",
+	"7.0.0-nightly.20190726": "77.0.3864.0",
+	"7.0.0-nightly.20190727": "78.0.3866.0",
+	"7.0.0-nightly.20190728": "78.0.3866.0",
+	"7.0.0-nightly.20190729": "78.0.3866.0",
+	"7.0.0-nightly.20190730": "78.0.3866.0",
+	"7.0.0-nightly.20190731": "78.0.3866.0",
+	"7.0.0": "78.0.3905.1",
+	"7.0.1": "78.0.3904.92",
+	"7.1.0": "78.0.3904.94",
+	"7.1.1": "78.0.3904.99",
+	"7.1.2": "78.0.3904.113",
+	"7.1.3": "78.0.3904.126",
+	"7.1.4": "78.0.3904.130",
+	"7.1.5": "78.0.3904.130",
+	"7.1.6": "78.0.3904.130",
+	"7.1.7": "78.0.3904.130",
+	"7.1.8": "78.0.3904.130",
+	"7.1.9": "78.0.3904.130",
+	"7.1.10": "78.0.3904.130",
+	"7.1.11": "78.0.3904.130",
+	"7.1.12": "78.0.3904.130",
+	"7.1.13": "78.0.3904.130",
+	"7.1.14": "78.0.3904.130",
+	"7.2.0": "78.0.3904.130",
+	"7.2.1": "78.0.3904.130",
+	"7.2.2": "78.0.3904.130",
+	"7.2.3": "78.0.3904.130",
+	"7.2.4": "78.0.3904.130",
+	"7.3.0": "78.0.3904.130",
+	"7.3.1": "78.0.3904.130",
+	"7.3.2": "78.0.3904.130",
+	"7.3.3": "78.0.3904.130",
+	"8.0.0-beta.1": "79.0.3931.0",
+	"8.0.0-beta.2": "79.0.3931.0",
+	"8.0.0-beta.3": "80.0.3955.0",
+	"8.0.0-beta.4": "80.0.3955.0",
+	"8.0.0-beta.5": "80.0.3987.14",
+	"8.0.0-beta.6": "80.0.3987.51",
+	"8.0.0-beta.7": "80.0.3987.59",
+	"8.0.0-beta.8": "80.0.3987.75",
+	"8.0.0-beta.9": "80.0.3987.75",
+	"8.0.0-nightly.20190801": "78.0.3866.0",
+	"8.0.0-nightly.20190802": "78.0.3866.0",
+	"8.0.0-nightly.20190803": "78.0.3871.0",
+	"8.0.0-nightly.20190806": "78.0.3871.0",
+	"8.0.0-nightly.20190807": "78.0.3871.0",
+	"8.0.0-nightly.20190808": "78.0.3871.0",
+	"8.0.0-nightly.20190809": "78.0.3871.0",
+	"8.0.0-nightly.20190810": "78.0.3871.0",
+	"8.0.0-nightly.20190811": "78.0.3871.0",
+	"8.0.0-nightly.20190812": "78.0.3871.0",
+	"8.0.0-nightly.20190813": "78.0.3871.0",
+	"8.0.0-nightly.20190814": "78.0.3871.0",
+	"8.0.0-nightly.20190815": "78.0.3871.0",
+	"8.0.0-nightly.20190816": "78.0.3881.0",
+	"8.0.0-nightly.20190817": "78.0.3881.0",
+	"8.0.0-nightly.20190818": "78.0.3881.0",
+	"8.0.0-nightly.20190819": "78.0.3881.0",
+	"8.0.0-nightly.20190820": "78.0.3881.0",
+	"8.0.0-nightly.20190824": "78.0.3892.0",
+	"8.0.0-nightly.20190825": "78.0.3892.0",
+	"8.0.0-nightly.20190827": "78.0.3892.0",
+	"8.0.0-nightly.20190828": "78.0.3892.0",
+	"8.0.0-nightly.20190830": "78.0.3892.0",
+	"8.0.0-nightly.20190901": "78.0.3892.0",
+	"8.0.0-nightly.20190902": "78.0.3892.0",
+	"8.0.0-nightly.20190907": "78.0.3892.0",
+	"8.0.0-nightly.20190909": "78.0.3892.0",
+	"8.0.0-nightly.20190910": "78.0.3892.0",
+	"8.0.0-nightly.20190911": "78.0.3892.0",
+	"8.0.0-nightly.20190913": "78.0.3892.0",
+	"8.0.0-nightly.20190914": "78.0.3892.0",
+	"8.0.0-nightly.20190915": "78.0.3892.0",
+	"8.0.0-nightly.20190917": "78.0.3892.0",
+	"8.0.0-nightly.20190919": "79.0.3915.0",
+	"8.0.0-nightly.20190920": "79.0.3915.0",
+	"8.0.0-nightly.20190923": "79.0.3919.0",
+	"8.0.0-nightly.20190924": "79.0.3919.0",
+	"8.0.0-nightly.20190926": "79.0.3919.0",
+	"8.0.0-nightly.20190929": "79.0.3919.0",
+	"8.0.0-nightly.20190930": "79.0.3919.0",
+	"8.0.0-nightly.20191001": "79.0.3919.0",
+	"8.0.0-nightly.20191004": "79.0.3919.0",
+	"8.0.0-nightly.20191005": "79.0.3919.0",
+	"8.0.0-nightly.20191006": "79.0.3919.0",
+	"8.0.0-nightly.20191009": "79.0.3919.0",
+	"8.0.0-nightly.20191011": "79.0.3919.0",
+	"8.0.0-nightly.20191012": "79.0.3919.0",
+	"8.0.0-nightly.20191017": "79.0.3919.0",
+	"8.0.0-nightly.20191019": "79.0.3931.0",
+	"8.0.0-nightly.20191020": "79.0.3931.0",
+	"8.0.0-nightly.20191021": "79.0.3931.0",
+	"8.0.0-nightly.20191023": "79.0.3931.0",
+	"8.0.0-nightly.20191101": "80.0.3952.0",
+	"8.0.0-nightly.20191105": "80.0.3952.0",
+	"8.0.0": "80.0.3987.86",
+	"8.0.1": "80.0.3987.86",
+	"8.0.2": "80.0.3987.86",
+	"8.0.3": "80.0.3987.134",
+	"8.1.0": "80.0.3987.137",
+	"8.1.1": "80.0.3987.141",
+	"8.2.0": "80.0.3987.158",
+	"8.2.1": "80.0.3987.163",
+	"8.2.2": "80.0.3987.163",
+	"8.2.3": "80.0.3987.163",
+	"8.2.4": "80.0.3987.165",
+	"8.2.5": "80.0.3987.165",
+	"8.3.0": "80.0.3987.165",
+	"8.3.1": "80.0.3987.165",
+	"8.3.2": "80.0.3987.165",
+	"8.3.3": "80.0.3987.165",
+	"8.3.4": "80.0.3987.165",
+	"8.4.0": "80.0.3987.165",
+	"8.4.1": "80.0.3987.165",
+	"8.5.0": "80.0.3987.165",
+	"8.5.1": "80.0.3987.165",
+	"8.5.2": "80.0.3987.165",
+	"8.5.3": "80.0.3987.163",
+	"8.5.4": "80.0.3987.163",
+	"8.5.5": "80.0.3987.163",
+	"9.0.0-beta.1": "82.0.4048.0",
+	"9.0.0-beta.2": "82.0.4048.0",
+	"9.0.0-beta.3": "82.0.4048.0",
+	"9.0.0-beta.4": "82.0.4048.0",
+	"9.0.0-beta.5": "82.0.4048.0",
+	"9.0.0-beta.6": "82.0.4058.2",
+	"9.0.0-beta.7": "82.0.4058.2",
+	"9.0.0-beta.9": "82.0.4058.2",
+	"9.0.0-beta.10": "82.0.4085.10",
+	"9.0.0-beta.12": "82.0.4085.14",
+	"9.0.0-beta.13": "82.0.4085.14",
+	"9.0.0-beta.14": "82.0.4085.27",
+	"9.0.0-beta.15": "83.0.4102.3",
+	"9.0.0-beta.16": "83.0.4102.3",
+	"9.0.0-beta.17": "83.0.4103.14",
+	"9.0.0-beta.18": "83.0.4103.16",
+	"9.0.0-beta.19": "83.0.4103.24",
+	"9.0.0-beta.20": "83.0.4103.26",
+	"9.0.0-beta.21": "83.0.4103.26",
+	"9.0.0-beta.22": "83.0.4103.34",
+	"9.0.0-beta.23": "83.0.4103.44",
+	"9.0.0-beta.24": "83.0.4103.45",
+	"9.0.0-nightly.20191121": "80.0.3954.0",
+	"9.0.0-nightly.20191122": "80.0.3954.0",
+	"9.0.0-nightly.20191123": "80.0.3954.0",
+	"9.0.0-nightly.20191124": "80.0.3954.0",
+	"9.0.0-nightly.20191129": "80.0.3954.0",
+	"9.0.0-nightly.20191130": "80.0.3954.0",
+	"9.0.0-nightly.20191201": "80.0.3954.0",
+	"9.0.0-nightly.20191202": "80.0.3954.0",
+	"9.0.0-nightly.20191203": "80.0.3954.0",
+	"9.0.0-nightly.20191204": "80.0.3954.0",
+	"9.0.0-nightly.20191210": "80.0.3954.0",
+	"9.0.0-nightly.20191220": "81.0.3994.0",
+	"9.0.0-nightly.20191221": "81.0.3994.0",
+	"9.0.0-nightly.20191222": "81.0.3994.0",
+	"9.0.0-nightly.20191223": "81.0.3994.0",
+	"9.0.0-nightly.20191224": "81.0.3994.0",
+	"9.0.0-nightly.20191225": "81.0.3994.0",
+	"9.0.0-nightly.20191226": "81.0.3994.0",
+	"9.0.0-nightly.20191228": "81.0.3994.0",
+	"9.0.0-nightly.20191229": "81.0.3994.0",
+	"9.0.0-nightly.20191230": "81.0.3994.0",
+	"9.0.0-nightly.20191231": "81.0.3994.0",
+	"9.0.0-nightly.20200101": "81.0.3994.0",
+	"9.0.0-nightly.20200103": "81.0.3994.0",
+	"9.0.0-nightly.20200104": "81.0.3994.0",
+	"9.0.0-nightly.20200105": "81.0.3994.0",
+	"9.0.0-nightly.20200106": "81.0.3994.0",
+	"9.0.0-nightly.20200108": "81.0.3994.0",
+	"9.0.0-nightly.20200109": "81.0.3994.0",
+	"9.0.0-nightly.20200110": "81.0.3994.0",
+	"9.0.0-nightly.20200111": "81.0.3994.0",
+	"9.0.0-nightly.20200113": "81.0.3994.0",
+	"9.0.0-nightly.20200115": "81.0.3994.0",
+	"9.0.0-nightly.20200116": "81.0.3994.0",
+	"9.0.0-nightly.20200117": "81.0.3994.0",
+	"9.0.0-nightly.20200119": "81.0.4030.0",
+	"9.0.0-nightly.20200121": "81.0.4030.0",
+	"9.0.0": "83.0.4103.64",
+	"9.0.1": "83.0.4103.94",
+	"9.0.2": "83.0.4103.94",
+	"9.0.3": "83.0.4103.100",
+	"9.0.4": "83.0.4103.104",
+	"9.0.5": "83.0.4103.119",
+	"9.1.0": "83.0.4103.122",
+	"9.1.1": "83.0.4103.122",
+	"9.1.2": "83.0.4103.122",
+	"9.2.0": "83.0.4103.122",
+	"9.2.1": "83.0.4103.122",
+	"9.3.0": "83.0.4103.122",
+	"9.3.1": "83.0.4103.122",
+	"9.3.2": "83.0.4103.122",
+	"9.3.3": "83.0.4103.122",
+	"9.3.4": "83.0.4103.122",
+	"9.3.5": "83.0.4103.122",
+	"9.4.0": "83.0.4103.122",
+	"9.4.1": "83.0.4103.122",
+	"9.4.2": "83.0.4103.122",
+	"9.4.3": "83.0.4103.122",
+	"9.4.4": "83.0.4103.122",
+	"10.0.0-beta.1": "84.0.4129.0",
+	"10.0.0-beta.2": "84.0.4129.0",
+	"10.0.0-beta.3": "85.0.4161.2",
+	"10.0.0-beta.4": "85.0.4161.2",
+	"10.0.0-beta.8": "85.0.4181.1",
+	"10.0.0-beta.9": "85.0.4181.1",
+	"10.0.0-beta.10": "85.0.4183.19",
+	"10.0.0-beta.11": "85.0.4183.20",
+	"10.0.0-beta.12": "85.0.4183.26",
+	"10.0.0-beta.13": "85.0.4183.39",
+	"10.0.0-beta.14": "85.0.4183.39",
+	"10.0.0-beta.15": "85.0.4183.39",
+	"10.0.0-beta.17": "85.0.4183.39",
+	"10.0.0-beta.19": "85.0.4183.39",
+	"10.0.0-beta.20": "85.0.4183.39",
+	"10.0.0-beta.21": "85.0.4183.39",
+	"10.0.0-beta.23": "85.0.4183.70",
+	"10.0.0-beta.24": "85.0.4183.78",
+	"10.0.0-beta.25": "85.0.4183.80",
+	"10.0.0-nightly.20200209": "82.0.4050.0",
+	"10.0.0-nightly.20200210": "82.0.4050.0",
+	"10.0.0-nightly.20200211": "82.0.4050.0",
+	"10.0.0-nightly.20200216": "82.0.4050.0",
+	"10.0.0-nightly.20200217": "82.0.4050.0",
+	"10.0.0-nightly.20200218": "82.0.4050.0",
+	"10.0.0-nightly.20200221": "82.0.4050.0",
+	"10.0.0-nightly.20200222": "82.0.4050.0",
+	"10.0.0-nightly.20200223": "82.0.4050.0",
+	"10.0.0-nightly.20200226": "82.0.4050.0",
+	"10.0.0-nightly.20200303": "82.0.4050.0",
+	"10.0.0-nightly.20200304": "82.0.4076.0",
+	"10.0.0-nightly.20200305": "82.0.4076.0",
+	"10.0.0-nightly.20200306": "82.0.4076.0",
+	"10.0.0-nightly.20200309": "82.0.4076.0",
+	"10.0.0-nightly.20200310": "82.0.4076.0",
+	"10.0.0-nightly.20200311": "82.0.4083.0",
+	"10.0.0-nightly.20200316": "83.0.4086.0",
+	"10.0.0-nightly.20200317": "83.0.4087.0",
+	"10.0.0-nightly.20200318": "83.0.4087.0",
+	"10.0.0-nightly.20200320": "83.0.4087.0",
+	"10.0.0-nightly.20200323": "83.0.4087.0",
+	"10.0.0-nightly.20200324": "83.0.4087.0",
+	"10.0.0-nightly.20200325": "83.0.4087.0",
+	"10.0.0-nightly.20200326": "83.0.4087.0",
+	"10.0.0-nightly.20200327": "83.0.4087.0",
+	"10.0.0-nightly.20200330": "83.0.4087.0",
+	"10.0.0-nightly.20200331": "83.0.4087.0",
+	"10.0.0-nightly.20200401": "83.0.4087.0",
+	"10.0.0-nightly.20200402": "83.0.4087.0",
+	"10.0.0-nightly.20200403": "83.0.4087.0",
+	"10.0.0-nightly.20200406": "83.0.4087.0",
+	"10.0.0-nightly.20200408": "83.0.4095.0",
+	"10.0.0-nightly.20200410": "83.0.4095.0",
+	"10.0.0-nightly.20200413": "83.0.4095.0",
+	"10.0.0-nightly.20200414": "84.0.4114.0",
+	"10.0.0-nightly.20200415": "84.0.4115.0",
+	"10.0.0-nightly.20200416": "84.0.4115.0",
+	"10.0.0-nightly.20200417": "84.0.4115.0",
+	"10.0.0-nightly.20200422": "84.0.4121.0",
+	"10.0.0-nightly.20200423": "84.0.4121.0",
+	"10.0.0-nightly.20200427": "84.0.4125.0",
+	"10.0.0-nightly.20200428": "84.0.4125.0",
+	"10.0.0-nightly.20200429": "84.0.4125.0",
+	"10.0.0-nightly.20200430": "84.0.4125.0",
+	"10.0.0-nightly.20200501": "84.0.4129.0",
+	"10.0.0-nightly.20200504": "84.0.4129.0",
+	"10.0.0-nightly.20200505": "84.0.4129.0",
+	"10.0.0-nightly.20200506": "84.0.4129.0",
+	"10.0.0-nightly.20200507": "84.0.4129.0",
+	"10.0.0-nightly.20200508": "84.0.4129.0",
+	"10.0.0-nightly.20200511": "84.0.4129.0",
+	"10.0.0-nightly.20200512": "84.0.4129.0",
+	"10.0.0-nightly.20200513": "84.0.4129.0",
+	"10.0.0-nightly.20200514": "84.0.4129.0",
+	"10.0.0-nightly.20200515": "84.0.4129.0",
+	"10.0.0-nightly.20200518": "84.0.4129.0",
+	"10.0.0-nightly.20200519": "84.0.4129.0",
+	"10.0.0-nightly.20200520": "84.0.4129.0",
+	"10.0.0-nightly.20200521": "84.0.4129.0",
+	"10.0.0": "85.0.4183.84",
+	"10.0.1": "85.0.4183.86",
+	"10.1.0": "85.0.4183.87",
+	"10.1.1": "85.0.4183.93",
+	"10.1.2": "85.0.4183.98",
+	"10.1.3": "85.0.4183.121",
+	"10.1.4": "85.0.4183.121",
+	"10.1.5": "85.0.4183.121",
+	"10.1.6": "85.0.4183.121",
+	"10.1.7": "85.0.4183.121",
+	"10.2.0": "85.0.4183.121",
+	"10.3.0": "85.0.4183.121",
+	"10.3.1": "85.0.4183.121",
+	"10.3.2": "85.0.4183.121",
+	"10.4.0": "85.0.4183.121",
+	"10.4.1": "85.0.4183.121",
+	"10.4.2": "85.0.4183.121",
+	"10.4.3": "85.0.4183.121",
+	"10.4.4": "85.0.4183.121",
+	"10.4.5": "85.0.4183.121",
+	"10.4.6": "85.0.4183.121",
+	"10.4.7": "85.0.4183.121",
+	"11.0.0-beta.1": "86.0.4234.0",
+	"11.0.0-beta.3": "86.0.4234.0",
+	"11.0.0-beta.4": "86.0.4234.0",
+	"11.0.0-beta.5": "86.0.4234.0",
+	"11.0.0-beta.6": "86.0.4234.0",
+	"11.0.0-beta.7": "86.0.4234.0",
+	"11.0.0-beta.8": "87.0.4251.1",
+	"11.0.0-beta.9": "87.0.4251.1",
+	"11.0.0-beta.11": "87.0.4251.1",
+	"11.0.0-beta.12": "87.0.4280.11",
+	"11.0.0-beta.13": "87.0.4280.11",
+	"11.0.0-beta.16": "87.0.4280.27",
+	"11.0.0-beta.17": "87.0.4280.27",
+	"11.0.0-beta.18": "87.0.4280.27",
+	"11.0.0-beta.19": "87.0.4280.27",
+	"11.0.0-beta.20": "87.0.4280.40",
+	"11.0.0-beta.22": "87.0.4280.47",
+	"11.0.0-beta.23": "87.0.4280.47",
+	"11.0.0-nightly.20200525": "84.0.4129.0",
+	"11.0.0-nightly.20200526": "84.0.4129.0",
+	"11.0.0-nightly.20200529": "85.0.4156.0",
+	"11.0.0-nightly.20200602": "85.0.4162.0",
+	"11.0.0-nightly.20200603": "85.0.4162.0",
+	"11.0.0-nightly.20200604": "85.0.4162.0",
+	"11.0.0-nightly.20200609": "85.0.4162.0",
+	"11.0.0-nightly.20200610": "85.0.4162.0",
+	"11.0.0-nightly.20200611": "85.0.4162.0",
+	"11.0.0-nightly.20200615": "85.0.4162.0",
+	"11.0.0-nightly.20200616": "85.0.4162.0",
+	"11.0.0-nightly.20200617": "85.0.4162.0",
+	"11.0.0-nightly.20200618": "85.0.4162.0",
+	"11.0.0-nightly.20200619": "85.0.4162.0",
+	"11.0.0-nightly.20200701": "85.0.4179.0",
+	"11.0.0-nightly.20200702": "85.0.4179.0",
+	"11.0.0-nightly.20200703": "85.0.4179.0",
+	"11.0.0-nightly.20200706": "85.0.4179.0",
+	"11.0.0-nightly.20200707": "85.0.4179.0",
+	"11.0.0-nightly.20200708": "85.0.4179.0",
+	"11.0.0-nightly.20200709": "85.0.4179.0",
+	"11.0.0-nightly.20200716": "86.0.4203.0",
+	"11.0.0-nightly.20200717": "86.0.4203.0",
+	"11.0.0-nightly.20200720": "86.0.4203.0",
+	"11.0.0-nightly.20200721": "86.0.4203.0",
+	"11.0.0-nightly.20200723": "86.0.4209.0",
+	"11.0.0-nightly.20200724": "86.0.4209.0",
+	"11.0.0-nightly.20200729": "86.0.4209.0",
+	"11.0.0-nightly.20200730": "86.0.4209.0",
+	"11.0.0-nightly.20200731": "86.0.4209.0",
+	"11.0.0-nightly.20200803": "86.0.4209.0",
+	"11.0.0-nightly.20200804": "86.0.4209.0",
+	"11.0.0-nightly.20200805": "86.0.4209.0",
+	"11.0.0-nightly.20200811": "86.0.4209.0",
+	"11.0.0-nightly.20200812": "86.0.4209.0",
+	"11.0.0-nightly.20200822": "86.0.4234.0",
+	"11.0.0-nightly.20200824": "86.0.4234.0",
+	"11.0.0-nightly.20200825": "86.0.4234.0",
+	"11.0.0-nightly.20200826": "86.0.4234.0",
+	"11.0.0": "87.0.4280.60",
+	"11.0.1": "87.0.4280.60",
+	"11.0.2": "87.0.4280.67",
+	"11.0.3": "87.0.4280.67",
+	"11.0.4": "87.0.4280.67",
+	"11.0.5": "87.0.4280.88",
+	"11.1.0": "87.0.4280.88",
+	"11.1.1": "87.0.4280.88",
+	"11.2.0": "87.0.4280.141",
+	"11.2.1": "87.0.4280.141",
+	"11.2.2": "87.0.4280.141",
+	"11.2.3": "87.0.4280.141",
+	"11.3.0": "87.0.4280.141",
+	"11.4.0": "87.0.4280.141",
+	"11.4.1": "87.0.4280.141",
+	"11.4.2": "87.0.4280.141",
+	"11.4.3": "87.0.4280.141",
+	"11.4.4": "87.0.4280.141",
+	"11.4.5": "87.0.4280.141",
+	"11.4.6": "87.0.4280.141",
+	"11.4.7": "87.0.4280.141",
+	"11.4.8": "87.0.4280.141",
+	"11.4.9": "87.0.4280.141",
+	"11.4.10": "87.0.4280.141",
+	"11.4.11": "87.0.4280.141",
+	"11.4.12": "87.0.4280.141",
+	"11.5.0": "87.0.4280.141",
+	"12.0.0-beta.1": "89.0.4328.0",
+	"12.0.0-beta.3": "89.0.4328.0",
+	"12.0.0-beta.4": "89.0.4328.0",
+	"12.0.0-beta.5": "89.0.4328.0",
+	"12.0.0-beta.6": "89.0.4328.0",
+	"12.0.0-beta.7": "89.0.4328.0",
+	"12.0.0-beta.8": "89.0.4328.0",
+	"12.0.0-beta.9": "89.0.4328.0",
+	"12.0.0-beta.10": "89.0.4328.0",
+	"12.0.0-beta.11": "89.0.4328.0",
+	"12.0.0-beta.12": "89.0.4328.0",
+	"12.0.0-beta.14": "89.0.4328.0",
+	"12.0.0-beta.16": "89.0.4348.1",
+	"12.0.0-beta.18": "89.0.4348.1",
+	"12.0.0-beta.19": "89.0.4348.1",
+	"12.0.0-beta.20": "89.0.4348.1",
+	"12.0.0-beta.21": "89.0.4388.2",
+	"12.0.0-beta.22": "89.0.4388.2",
+	"12.0.0-beta.23": "89.0.4388.2",
+	"12.0.0-beta.24": "89.0.4388.2",
+	"12.0.0-beta.25": "89.0.4388.2",
+	"12.0.0-beta.26": "89.0.4388.2",
+	"12.0.0-beta.27": "89.0.4389.23",
+	"12.0.0-beta.28": "89.0.4389.23",
+	"12.0.0-beta.29": "89.0.4389.23",
+	"12.0.0-beta.30": "89.0.4389.58",
+	"12.0.0-beta.31": "89.0.4389.58",
+	"12.0.0-nightly.20200827": "86.0.4234.0",
+	"12.0.0-nightly.20200831": "86.0.4234.0",
+	"12.0.0-nightly.20200902": "86.0.4234.0",
+	"12.0.0-nightly.20200903": "86.0.4234.0",
+	"12.0.0-nightly.20200907": "86.0.4234.0",
+	"12.0.0-nightly.20200910": "86.0.4234.0",
+	"12.0.0-nightly.20200911": "86.0.4234.0",
+	"12.0.0-nightly.20200914": "86.0.4234.0",
+	"12.0.0-nightly.20201013": "87.0.4268.0",
+	"12.0.0-nightly.20201014": "87.0.4268.0",
+	"12.0.0-nightly.20201015": "87.0.4268.0",
+	"12.0.0-nightly.20201023": "88.0.4292.0",
+	"12.0.0-nightly.20201026": "88.0.4292.0",
+	"12.0.0-nightly.20201030": "88.0.4306.0",
+	"12.0.0-nightly.20201102": "88.0.4306.0",
+	"12.0.0-nightly.20201103": "88.0.4306.0",
+	"12.0.0-nightly.20201104": "88.0.4306.0",
+	"12.0.0-nightly.20201105": "88.0.4306.0",
+	"12.0.0-nightly.20201106": "88.0.4306.0",
+	"12.0.0-nightly.20201111": "88.0.4306.0",
+	"12.0.0-nightly.20201112": "88.0.4306.0",
+	"12.0.0-nightly.20201116": "88.0.4324.0",
+	"12.0.0": "89.0.4389.69",
+	"12.0.1": "89.0.4389.82",
+	"12.0.2": "89.0.4389.90",
+	"12.0.3": "89.0.4389.114",
+	"12.0.4": "89.0.4389.114",
+	"12.0.5": "89.0.4389.128",
+	"12.0.6": "89.0.4389.128",
+	"12.0.7": "89.0.4389.128",
+	"12.0.8": "89.0.4389.128",
+	"12.0.9": "89.0.4389.128",
+	"12.0.10": "89.0.4389.128",
+	"12.0.11": "89.0.4389.128",
+	"12.0.12": "89.0.4389.128",
+	"12.0.13": "89.0.4389.128",
+	"12.0.14": "89.0.4389.128",
+	"12.0.15": "89.0.4389.128",
+	"12.0.16": "89.0.4389.128",
+	"12.0.17": "89.0.4389.128",
+	"12.0.18": "89.0.4389.128",
+	"12.1.0": "89.0.4389.128",
+	"12.1.1": "89.0.4389.128",
+	"12.1.2": "89.0.4389.128",
+	"12.2.0": "89.0.4389.128",
+	"12.2.1": "89.0.4389.128",
+	"12.2.2": "89.0.4389.128",
+	"12.2.3": "89.0.4389.128",
+	"13.0.0-beta.2": "90.0.4402.0",
+	"13.0.0-beta.3": "90.0.4402.0",
+	"13.0.0-beta.4": "90.0.4415.0",
+	"13.0.0-beta.5": "90.0.4415.0",
+	"13.0.0-beta.6": "90.0.4415.0",
+	"13.0.0-beta.7": "90.0.4415.0",
+	"13.0.0-beta.8": "90.0.4415.0",
+	"13.0.0-beta.9": "90.0.4415.0",
+	"13.0.0-beta.11": "90.0.4415.0",
+	"13.0.0-beta.12": "90.0.4415.0",
+	"13.0.0-beta.13": "90.0.4415.0",
+	"13.0.0-beta.14": "91.0.4448.0",
+	"13.0.0-beta.16": "91.0.4448.0",
+	"13.0.0-beta.17": "91.0.4448.0",
+	"13.0.0-beta.18": "91.0.4448.0",
+	"13.0.0-beta.20": "91.0.4448.0",
+	"13.0.0-beta.21": "91.0.4472.33",
+	"13.0.0-beta.22": "91.0.4472.33",
+	"13.0.0-beta.23": "91.0.4472.33",
+	"13.0.0-beta.24": "91.0.4472.38",
+	"13.0.0-beta.26": "91.0.4472.38",
+	"13.0.0-beta.27": "91.0.4472.38",
+	"13.0.0-beta.28": "91.0.4472.38",
+	"13.0.0-nightly.20201119": "89.0.4328.0",
+	"13.0.0-nightly.20201123": "89.0.4328.0",
+	"13.0.0-nightly.20201124": "89.0.4328.0",
+	"13.0.0-nightly.20201126": "89.0.4328.0",
+	"13.0.0-nightly.20201127": "89.0.4328.0",
+	"13.0.0-nightly.20201130": "89.0.4328.0",
+	"13.0.0-nightly.20201201": "89.0.4328.0",
+	"13.0.0-nightly.20201202": "89.0.4328.0",
+	"13.0.0-nightly.20201203": "89.0.4328.0",
+	"13.0.0-nightly.20201204": "89.0.4328.0",
+	"13.0.0-nightly.20201207": "89.0.4328.0",
+	"13.0.0-nightly.20201208": "89.0.4328.0",
+	"13.0.0-nightly.20201209": "89.0.4328.0",
+	"13.0.0-nightly.20201210": "89.0.4328.0",
+	"13.0.0-nightly.20201211": "89.0.4328.0",
+	"13.0.0-nightly.20201214": "89.0.4328.0",
+	"13.0.0-nightly.20201215": "89.0.4349.0",
+	"13.0.0-nightly.20201216": "89.0.4349.0",
+	"13.0.0-nightly.20201221": "89.0.4349.0",
+	"13.0.0-nightly.20201222": "89.0.4349.0",
+	"13.0.0-nightly.20201223": "89.0.4359.0",
+	"13.0.0-nightly.20210104": "89.0.4359.0",
+	"13.0.0-nightly.20210108": "89.0.4359.0",
+	"13.0.0-nightly.20210111": "89.0.4359.0",
+	"13.0.0-nightly.20210113": "89.0.4386.0",
+	"13.0.0-nightly.20210114": "89.0.4386.0",
+	"13.0.0-nightly.20210118": "89.0.4386.0",
+	"13.0.0-nightly.20210122": "89.0.4386.0",
+	"13.0.0-nightly.20210125": "89.0.4386.0",
+	"13.0.0-nightly.20210127": "89.0.4389.0",
+	"13.0.0-nightly.20210128": "89.0.4389.0",
+	"13.0.0-nightly.20210129": "89.0.4389.0",
+	"13.0.0-nightly.20210201": "89.0.4389.0",
+	"13.0.0-nightly.20210202": "89.0.4389.0",
+	"13.0.0-nightly.20210203": "89.0.4389.0",
+	"13.0.0-nightly.20210205": "89.0.4389.0",
+	"13.0.0-nightly.20210208": "89.0.4389.0",
+	"13.0.0-nightly.20210209": "89.0.4389.0",
+	"13.0.0-nightly.20210210": "90.0.4402.0",
+	"13.0.0-nightly.20210211": "90.0.4402.0",
+	"13.0.0-nightly.20210212": "90.0.4402.0",
+	"13.0.0-nightly.20210216": "90.0.4402.0",
+	"13.0.0-nightly.20210217": "90.0.4402.0",
+	"13.0.0-nightly.20210218": "90.0.4402.0",
+	"13.0.0-nightly.20210219": "90.0.4402.0",
+	"13.0.0-nightly.20210222": "90.0.4402.0",
+	"13.0.0-nightly.20210225": "90.0.4402.0",
+	"13.0.0-nightly.20210226": "90.0.4402.0",
+	"13.0.0-nightly.20210301": "90.0.4402.0",
+	"13.0.0-nightly.20210302": "90.0.4402.0",
+	"13.0.0-nightly.20210303": "90.0.4402.0",
+	"13.0.0": "91.0.4472.69",
+	"13.0.1": "91.0.4472.69",
+	"13.1.0": "91.0.4472.77",
+	"13.1.1": "91.0.4472.77",
+	"13.1.2": "91.0.4472.77",
+	"13.1.3": "91.0.4472.106",
+	"13.1.4": "91.0.4472.106",
+	"13.1.5": "91.0.4472.124",
+	"13.1.6": "91.0.4472.124",
+	"13.1.7": "91.0.4472.124",
+	"13.1.8": "91.0.4472.164",
+	"13.1.9": "91.0.4472.164",
+	"13.2.0": "91.0.4472.164",
+	"13.2.1": "91.0.4472.164",
+	"13.2.2": "91.0.4472.164",
+	"13.2.3": "91.0.4472.164",
+	"13.3.0": "91.0.4472.164",
+	"13.4.0": "91.0.4472.164",
+	"13.5.0": "91.0.4472.164",
+	"13.5.1": "91.0.4472.164",
+	"13.5.2": "91.0.4472.164",
+	"13.6.0": "91.0.4472.164",
+	"13.6.1": "91.0.4472.164",
+	"13.6.2": "91.0.4472.164",
+	"13.6.3": "91.0.4472.164",
+	"13.6.6": "91.0.4472.164",
+	"13.6.7": "91.0.4472.164",
+	"13.6.8": "91.0.4472.164",
+	"13.6.9": "91.0.4472.164",
+	"14.0.0-beta.1": "92.0.4511.0",
+	"14.0.0-beta.2": "92.0.4511.0",
+	"14.0.0-beta.3": "92.0.4511.0",
+	"14.0.0-beta.5": "93.0.4536.0",
+	"14.0.0-beta.6": "93.0.4536.0",
+	"14.0.0-beta.7": "93.0.4536.0",
+	"14.0.0-beta.8": "93.0.4536.0",
+	"14.0.0-beta.9": "93.0.4539.0",
+	"14.0.0-beta.10": "93.0.4539.0",
+	"14.0.0-beta.11": "93.0.4557.4",
+	"14.0.0-beta.12": "93.0.4557.4",
+	"14.0.0-beta.13": "93.0.4566.0",
+	"14.0.0-beta.14": "93.0.4566.0",
+	"14.0.0-beta.15": "93.0.4566.0",
+	"14.0.0-beta.16": "93.0.4566.0",
+	"14.0.0-beta.17": "93.0.4566.0",
+	"14.0.0-beta.18": "93.0.4577.15",
+	"14.0.0-beta.19": "93.0.4577.15",
+	"14.0.0-beta.20": "93.0.4577.15",
+	"14.0.0-beta.21": "93.0.4577.15",
+	"14.0.0-beta.22": "93.0.4577.25",
+	"14.0.0-beta.23": "93.0.4577.25",
+	"14.0.0-beta.24": "93.0.4577.51",
+	"14.0.0-beta.25": "93.0.4577.51",
+	"14.0.0-nightly.20210304": "90.0.4402.0",
+	"14.0.0-nightly.20210305": "90.0.4415.0",
+	"14.0.0-nightly.20210308": "90.0.4415.0",
+	"14.0.0-nightly.20210309": "90.0.4415.0",
+	"14.0.0-nightly.20210311": "90.0.4415.0",
+	"14.0.0-nightly.20210315": "90.0.4415.0",
+	"14.0.0-nightly.20210316": "90.0.4415.0",
+	"14.0.0-nightly.20210317": "90.0.4415.0",
+	"14.0.0-nightly.20210318": "90.0.4415.0",
+	"14.0.0-nightly.20210319": "90.0.4415.0",
+	"14.0.0-nightly.20210323": "90.0.4415.0",
+	"14.0.0-nightly.20210324": "90.0.4415.0",
+	"14.0.0-nightly.20210325": "90.0.4415.0",
+	"14.0.0-nightly.20210326": "90.0.4415.0",
+	"14.0.0-nightly.20210329": "90.0.4415.0",
+	"14.0.0-nightly.20210330": "90.0.4415.0",
+	"14.0.0-nightly.20210331": "91.0.4448.0",
+	"14.0.0-nightly.20210401": "91.0.4448.0",
+	"14.0.0-nightly.20210402": "91.0.4448.0",
+	"14.0.0-nightly.20210406": "91.0.4448.0",
+	"14.0.0-nightly.20210407": "91.0.4448.0",
+	"14.0.0-nightly.20210408": "91.0.4448.0",
+	"14.0.0-nightly.20210409": "91.0.4448.0",
+	"14.0.0-nightly.20210413": "91.0.4448.0",
+	"14.0.0-nightly.20210426": "92.0.4475.0",
+	"14.0.0-nightly.20210427": "92.0.4475.0",
+	"14.0.0-nightly.20210430": "92.0.4488.0",
+	"14.0.0-nightly.20210503": "92.0.4488.0",
+	"14.0.0-nightly.20210505": "92.0.4496.0",
+	"14.0.0-nightly.20210506": "92.0.4498.0",
+	"14.0.0-nightly.20210507": "92.0.4499.0",
+	"14.0.0-nightly.20210510": "92.0.4499.0",
+	"14.0.0-nightly.20210511": "92.0.4499.0",
+	"14.0.0-nightly.20210512": "92.0.4499.0",
+	"14.0.0-nightly.20210513": "92.0.4499.0",
+	"14.0.0-nightly.20210514": "92.0.4505.0",
+	"14.0.0-nightly.20210517": "92.0.4505.0",
+	"14.0.0-nightly.20210518": "92.0.4505.0",
+	"14.0.0-nightly.20210519": "92.0.4505.0",
+	"14.0.0-nightly.20210520": "92.0.4511.0",
+	"14.0.0-nightly.20210523": "92.0.4511.0",
+	"14.0.0-nightly.20210524": "92.0.4511.0",
+	"14.0.0": "93.0.4577.58",
+	"14.0.1": "93.0.4577.63",
+	"14.0.2": "93.0.4577.82",
+	"14.1.0": "93.0.4577.82",
+	"14.1.1": "93.0.4577.82",
+	"14.2.0": "93.0.4577.82",
+	"14.2.1": "93.0.4577.82",
+	"14.2.2": "93.0.4577.82",
+	"14.2.3": "93.0.4577.82",
+	"14.2.4": "93.0.4577.82",
+	"14.2.5": "93.0.4577.82",
+	"14.2.6": "93.0.4577.82",
+	"14.2.7": "93.0.4577.82",
+	"14.2.8": "93.0.4577.82",
+	"15.0.0-alpha.1": "93.0.4566.0",
+	"15.0.0-alpha.2": "93.0.4566.0",
+	"15.0.0-alpha.3": "94.0.4584.0",
+	"15.0.0-alpha.4": "94.0.4584.0",
+	"15.0.0-alpha.5": "94.0.4584.0",
+	"15.0.0-alpha.6": "94.0.4584.0",
+	"15.0.0-alpha.7": "94.0.4590.2",
+	"15.0.0-alpha.8": "94.0.4590.2",
+	"15.0.0-alpha.9": "94.0.4590.2",
+	"15.0.0-alpha.10": "94.0.4606.12",
+	"15.0.0-beta.1": "94.0.4606.20",
+	"15.0.0-beta.2": "94.0.4606.20",
+	"15.0.0-beta.3": "94.0.4606.31",
+	"15.0.0-beta.4": "94.0.4606.31",
+	"15.0.0-beta.5": "94.0.4606.31",
+	"15.0.0-beta.6": "94.0.4606.31",
+	"15.0.0-beta.7": "94.0.4606.31",
+	"15.0.0-nightly.20210527": "92.0.4511.0",
+	"15.0.0-nightly.20210528": "92.0.4511.0",
+	"15.0.0-nightly.20210531": "92.0.4511.0",
+	"15.0.0-nightly.20210601": "92.0.4511.0",
+	"15.0.0-nightly.20210602": "92.0.4511.0",
+	"15.0.0-nightly.20210603": "93.0.4530.0",
+	"15.0.0-nightly.20210604": "93.0.4530.0",
+	"15.0.0-nightly.20210608": "93.0.4535.0",
+	"15.0.0-nightly.20210609": "93.0.4536.0",
+	"15.0.0-nightly.20210610": "93.0.4536.0",
+	"15.0.0-nightly.20210611": "93.0.4536.0",
+	"15.0.0-nightly.20210614": "93.0.4536.0",
+	"15.0.0-nightly.20210615": "93.0.4536.0",
+	"15.0.0-nightly.20210616": "93.0.4536.0",
+	"15.0.0-nightly.20210617": "93.0.4539.0",
+	"15.0.0-nightly.20210618": "93.0.4539.0",
+	"15.0.0-nightly.20210621": "93.0.4539.0",
+	"15.0.0-nightly.20210622": "93.0.4539.0",
+	"15.0.0-nightly.20210623": "93.0.4550.0",
+	"15.0.0-nightly.20210624": "93.0.4550.0",
+	"15.0.0-nightly.20210625": "93.0.4552.0",
+	"15.0.0-nightly.20210628": "93.0.4552.0",
+	"15.0.0-nightly.20210629": "93.0.4552.0",
+	"15.0.0-nightly.20210630": "93.0.4558.0",
+	"15.0.0-nightly.20210701": "93.0.4558.0",
+	"15.0.0-nightly.20210702": "93.0.4558.0",
+	"15.0.0-nightly.20210706": "93.0.4566.0",
+	"15.0.0-nightly.20210707": "93.0.4566.0",
+	"15.0.0-nightly.20210708": "93.0.4566.0",
+	"15.0.0-nightly.20210709": "93.0.4566.0",
+	"15.0.0-nightly.20210712": "93.0.4566.0",
+	"15.0.0-nightly.20210713": "93.0.4566.0",
+	"15.0.0-nightly.20210714": "93.0.4566.0",
+	"15.0.0-nightly.20210715": "93.0.4566.0",
+	"15.0.0-nightly.20210716": "93.0.4566.0",
+	"15.0.0-nightly.20210719": "93.0.4566.0",
+	"15.0.0-nightly.20210720": "93.0.4566.0",
+	"15.0.0-nightly.20210721": "93.0.4566.0",
+	"15.0.0": "94.0.4606.51",
+	"15.1.0": "94.0.4606.61",
+	"15.1.1": "94.0.4606.61",
+	"15.1.2": "94.0.4606.71",
+	"15.2.0": "94.0.4606.81",
+	"15.3.0": "94.0.4606.81",
+	"15.3.1": "94.0.4606.81",
+	"15.3.2": "94.0.4606.81",
+	"15.3.3": "94.0.4606.81",
+	"15.3.4": "94.0.4606.81",
+	"15.3.5": "94.0.4606.81",
+	"15.3.6": "94.0.4606.81",
+	"15.3.7": "94.0.4606.81",
+	"15.4.0": "94.0.4606.81",
+	"15.4.1": "94.0.4606.81",
+	"15.4.2": "94.0.4606.81",
+	"16.0.0-alpha.1": "95.0.4629.0",
+	"16.0.0-alpha.2": "95.0.4629.0",
+	"16.0.0-alpha.3": "95.0.4629.0",
+	"16.0.0-alpha.4": "95.0.4629.0",
+	"16.0.0-alpha.5": "95.0.4629.0",
+	"16.0.0-alpha.6": "95.0.4629.0",
+	"16.0.0-alpha.7": "95.0.4629.0",
+	"16.0.0-alpha.8": "96.0.4647.0",
+	"16.0.0-alpha.9": "96.0.4647.0",
+	"16.0.0-beta.1": "96.0.4647.0",
+	"16.0.0-beta.2": "96.0.4647.0",
+	"16.0.0-beta.3": "96.0.4647.0",
+	"16.0.0-beta.4": "96.0.4664.18",
+	"16.0.0-beta.5": "96.0.4664.18",
+	"16.0.0-beta.6": "96.0.4664.27",
+	"16.0.0-beta.7": "96.0.4664.27",
+	"16.0.0-beta.8": "96.0.4664.35",
+	"16.0.0-beta.9": "96.0.4664.35",
+	"16.0.0-nightly.20210722": "93.0.4566.0",
+	"16.0.0-nightly.20210723": "93.0.4566.0",
+	"16.0.0-nightly.20210726": "93.0.4566.0",
+	"16.0.0-nightly.20210727": "94.0.4584.0",
+	"16.0.0-nightly.20210728": "94.0.4584.0",
+	"16.0.0-nightly.20210729": "94.0.4584.0",
+	"16.0.0-nightly.20210802": "94.0.4584.0",
+	"16.0.0-nightly.20210803": "94.0.4584.0",
+	"16.0.0-nightly.20210804": "94.0.4584.0",
+	"16.0.0-nightly.20210805": "94.0.4584.0",
+	"16.0.0-nightly.20210806": "94.0.4584.0",
+	"16.0.0-nightly.20210809": "94.0.4584.0",
+	"16.0.0-nightly.20210810": "94.0.4584.0",
+	"16.0.0-nightly.20210811": "94.0.4584.0",
+	"16.0.0-nightly.20210812": "94.0.4590.2",
+	"16.0.0-nightly.20210813": "94.0.4590.2",
+	"16.0.0-nightly.20210816": "94.0.4590.2",
+	"16.0.0-nightly.20210817": "94.0.4590.2",
+	"16.0.0-nightly.20210818": "94.0.4590.2",
+	"16.0.0-nightly.20210819": "94.0.4590.2",
+	"16.0.0-nightly.20210820": "94.0.4590.2",
+	"16.0.0-nightly.20210823": "94.0.4590.2",
+	"16.0.0-nightly.20210824": "95.0.4612.5",
+	"16.0.0-nightly.20210825": "95.0.4612.5",
+	"16.0.0-nightly.20210826": "95.0.4612.5",
+	"16.0.0-nightly.20210827": "95.0.4612.5",
+	"16.0.0-nightly.20210830": "95.0.4612.5",
+	"16.0.0-nightly.20210831": "95.0.4612.5",
+	"16.0.0-nightly.20210901": "95.0.4612.5",
+	"16.0.0-nightly.20210902": "95.0.4629.0",
+	"16.0.0-nightly.20210903": "95.0.4629.0",
+	"16.0.0-nightly.20210906": "95.0.4629.0",
+	"16.0.0-nightly.20210907": "95.0.4629.0",
+	"16.0.0-nightly.20210908": "95.0.4629.0",
+	"16.0.0-nightly.20210909": "95.0.4629.0",
+	"16.0.0-nightly.20210910": "95.0.4629.0",
+	"16.0.0-nightly.20210913": "95.0.4629.0",
+	"16.0.0-nightly.20210914": "95.0.4629.0",
+	"16.0.0-nightly.20210915": "95.0.4629.0",
+	"16.0.0-nightly.20210916": "95.0.4629.0",
+	"16.0.0-nightly.20210917": "95.0.4629.0",
+	"16.0.0-nightly.20210920": "95.0.4629.0",
+	"16.0.0-nightly.20210921": "95.0.4629.0",
+	"16.0.0": "96.0.4664.45",
+	"16.0.1": "96.0.4664.45",
+	"16.0.2": "96.0.4664.55",
+	"16.0.3": "96.0.4664.55",
+	"16.0.4": "96.0.4664.55",
+	"16.0.5": "96.0.4664.55",
+	"16.0.6": "96.0.4664.110",
+	"16.0.7": "96.0.4664.110",
+	"16.0.8": "96.0.4664.110",
+	"16.0.9": "96.0.4664.174",
+	"16.0.10": "96.0.4664.174",
+	"16.1.0": "96.0.4664.174",
+	"16.1.1": "96.0.4664.174",
+	"17.0.0-alpha.1": "96.0.4664.4",
+	"17.0.0-alpha.2": "96.0.4664.4",
+	"17.0.0-alpha.3": "96.0.4664.4",
+	"17.0.0-alpha.4": "98.0.4706.0",
+	"17.0.0-alpha.5": "98.0.4706.0",
+	"17.0.0-alpha.6": "98.0.4706.0",
+	"17.0.0-beta.1": "98.0.4706.0",
+	"17.0.0-beta.2": "98.0.4706.0",
+	"17.0.0-beta.3": "98.0.4758.9",
+	"17.0.0-beta.4": "98.0.4758.11",
+	"17.0.0-beta.5": "98.0.4758.11",
+	"17.0.0-beta.6": "98.0.4758.11",
+	"17.0.0-beta.7": "98.0.4758.11",
+	"17.0.0-beta.8": "98.0.4758.11",
+	"17.0.0-beta.9": "98.0.4758.11",
+	"17.0.0-nightly.20211006": "96.0.4647.0",
+	"17.0.0-nightly.20211007": "96.0.4647.0",
+	"17.0.0-nightly.20211008": "96.0.4647.0",
+	"17.0.0-nightly.20211011": "96.0.4647.0",
+	"17.0.0-nightly.20211012": "96.0.4647.0",
+	"17.0.0-nightly.20211013": "96.0.4647.0",
+	"17.0.0-nightly.20211014": "96.0.4647.0",
+	"17.0.0-nightly.20211015": "96.0.4647.0",
+	"17.0.0-nightly.20211018": "96.0.4647.0",
+	"17.0.0-nightly.20211019": "96.0.4647.0",
+	"17.0.0-nightly.20211020": "96.0.4647.0",
+	"17.0.0-nightly.20211021": "96.0.4647.0",
+	"17.0.0-nightly.20211022": "96.0.4664.4",
+	"17.0.0-nightly.20211025": "96.0.4664.4",
+	"17.0.0-nightly.20211026": "96.0.4664.4",
+	"17.0.0-nightly.20211027": "96.0.4664.4",
+	"17.0.0-nightly.20211028": "96.0.4664.4",
+	"17.0.0-nightly.20211029": "96.0.4664.4",
+	"17.0.0-nightly.20211101": "96.0.4664.4",
+	"17.0.0-nightly.20211102": "96.0.4664.4",
+	"17.0.0-nightly.20211103": "96.0.4664.4",
+	"17.0.0-nightly.20211104": "96.0.4664.4",
+	"17.0.0-nightly.20211105": "96.0.4664.4",
+	"17.0.0-nightly.20211108": "96.0.4664.4",
+	"17.0.0-nightly.20211109": "96.0.4664.4",
+	"17.0.0-nightly.20211110": "96.0.4664.4",
+	"17.0.0-nightly.20211111": "96.0.4664.4",
+	"17.0.0-nightly.20211112": "96.0.4664.4",
+	"17.0.0-nightly.20211115": "96.0.4664.4",
+	"17.0.0-nightly.20211116": "96.0.4664.4",
+	"17.0.0-nightly.20211117": "96.0.4664.4",
+	"17.0.0": "98.0.4758.74",
+	"17.0.1": "98.0.4758.82",
+	"17.1.0": "98.0.4758.102",
+	"17.1.1": "98.0.4758.109",
+	"17.1.2": "98.0.4758.109",
+	"17.2.0": "98.0.4758.109",
+	"18.0.0-alpha.1": "99.0.4767.0",
+	"18.0.0-alpha.2": "99.0.4767.0",
+	"18.0.0-alpha.3": "99.0.4767.0",
+	"18.0.0-alpha.4": "99.0.4767.0",
+	"18.0.0-alpha.5": "99.0.4767.0",
+	"18.0.0-beta.1": "100.0.4894.0",
+	"18.0.0-beta.2": "100.0.4894.0",
+	"18.0.0-beta.3": "100.0.4894.0",
+	"18.0.0-beta.4": "100.0.4894.0",
+	"18.0.0-beta.5": "100.0.4894.0",
+	"18.0.0-beta.6": "100.0.4894.0",
+	"18.0.0-nightly.20211118": "96.0.4664.4",
+	"18.0.0-nightly.20211119": "96.0.4664.4",
+	"18.0.0-nightly.20211122": "96.0.4664.4",
+	"18.0.0-nightly.20211123": "96.0.4664.4",
+	"18.0.0-nightly.20211124": "98.0.4706.0",
+	"18.0.0-nightly.20211125": "98.0.4706.0",
+	"18.0.0-nightly.20211126": "98.0.4706.0",
+	"18.0.0-nightly.20211129": "98.0.4706.0",
+	"18.0.0-nightly.20211130": "98.0.4706.0",
+	"18.0.0-nightly.20211201": "98.0.4706.0",
+	"18.0.0-nightly.20211202": "98.0.4706.0",
+	"18.0.0-nightly.20211203": "98.0.4706.0",
+	"18.0.0-nightly.20211206": "98.0.4706.0",
+	"18.0.0-nightly.20211207": "98.0.4706.0",
+	"18.0.0-nightly.20211208": "98.0.4706.0",
+	"18.0.0-nightly.20211209": "98.0.4706.0",
+	"18.0.0-nightly.20211210": "98.0.4706.0",
+	"18.0.0-nightly.20211213": "98.0.4706.0",
+	"18.0.0-nightly.20211214": "98.0.4706.0",
+	"18.0.0-nightly.20211215": "98.0.4706.0",
+	"18.0.0-nightly.20211216": "98.0.4706.0",
+	"18.0.0-nightly.20211217": "98.0.4706.0",
+	"18.0.0-nightly.20211220": "98.0.4706.0",
+	"18.0.0-nightly.20211221": "98.0.4706.0",
+	"18.0.0-nightly.20211222": "98.0.4706.0",
+	"18.0.0-nightly.20211223": "98.0.4706.0",
+	"18.0.0-nightly.20211228": "98.0.4706.0",
+	"18.0.0-nightly.20211229": "98.0.4706.0",
+	"18.0.0-nightly.20211231": "98.0.4706.0",
+	"18.0.0-nightly.20220103": "98.0.4706.0",
+	"18.0.0-nightly.20220104": "98.0.4706.0",
+	"18.0.0-nightly.20220105": "98.0.4706.0",
+	"18.0.0-nightly.20220106": "98.0.4706.0",
+	"18.0.0-nightly.20220107": "98.0.4706.0",
+	"18.0.0-nightly.20220110": "98.0.4706.0",
+	"18.0.0-nightly.20220111": "99.0.4767.0",
+	"18.0.0-nightly.20220112": "99.0.4767.0",
+	"18.0.0-nightly.20220113": "99.0.4767.0",
+	"18.0.0-nightly.20220114": "99.0.4767.0",
+	"18.0.0-nightly.20220117": "99.0.4767.0",
+	"18.0.0-nightly.20220118": "99.0.4767.0",
+	"18.0.0-nightly.20220119": "99.0.4767.0",
+	"18.0.0-nightly.20220121": "99.0.4767.0",
+	"18.0.0-nightly.20220124": "99.0.4767.0",
+	"18.0.0-nightly.20220125": "99.0.4767.0",
+	"18.0.0-nightly.20220127": "99.0.4767.0",
+	"18.0.0-nightly.20220128": "99.0.4767.0",
+	"18.0.0-nightly.20220131": "99.0.4767.0",
+	"18.0.0-nightly.20220201": "99.0.4767.0",
+	"19.0.0-nightly.20220202": "99.0.4767.0",
+	"19.0.0-nightly.20220203": "99.0.4767.0",
+	"19.0.0-nightly.20220204": "99.0.4767.0",
+	"19.0.0-nightly.20220207": "99.0.4767.0",
+	"19.0.0-nightly.20220208": "99.0.4767.0",
+	"19.0.0-nightly.20220209": "99.0.4767.0",
+	"19.0.0-nightly.20220308": "100.0.4894.0",
+	"19.0.0-nightly.20220309": "100.0.4894.0",
+	"19.0.0-nightly.20220310": "100.0.4894.0",
+	"19.0.0-nightly.20220311": "100.0.4894.0",
+	"19.0.0-nightly.20220314": "100.0.4894.0",
+	"19.0.0-nightly.20220315": "100.0.4894.0",
+	"19.0.0-nightly.20220316": "100.0.4894.0",
+	"19.0.0-nightly.20220317": "100.0.4894.0",
+	"19.0.0-nightly.20220318": "100.0.4894.0",
+	"19.0.0-nightly.20220321": "100.0.4894.0",
+	"19.0.0-nightly.20220322": "100.0.4894.0",
+	"19.0.0-nightly.20220323": "100.0.4894.0",
+	"19.0.0-nightly.20220324": "100.0.4894.0",
+	"19.0.0-nightly.20220325": "102.0.4961.0"
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-versions.json b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-versions.json
new file mode 100644
index 0000000..858b3c6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/full-versions.json
@@ -0,0 +1 @@
+{"0.20.0":"39.0.2171.65","0.20.1":"39.0.2171.65","0.20.2":"39.0.2171.65","0.20.3":"39.0.2171.65","0.20.4":"39.0.2171.65","0.20.5":"39.0.2171.65","0.20.6":"39.0.2171.65","0.20.7":"39.0.2171.65","0.20.8":"39.0.2171.65","0.21.0":"40.0.2214.91","0.21.1":"40.0.2214.91","0.21.2":"40.0.2214.91","0.21.3":"41.0.2272.76","0.22.1":"41.0.2272.76","0.22.2":"41.0.2272.76","0.22.3":"41.0.2272.76","0.23.0":"41.0.2272.76","0.24.0":"41.0.2272.76","0.25.0":"42.0.2311.107","0.25.1":"42.0.2311.107","0.25.2":"42.0.2311.107","0.25.3":"42.0.2311.107","0.26.0":"42.0.2311.107","0.26.1":"42.0.2311.107","0.27.0":"42.0.2311.107","0.27.1":"42.0.2311.107","0.27.2":"43.0.2357.65","0.27.3":"43.0.2357.65","0.28.0":"43.0.2357.65","0.28.1":"43.0.2357.65","0.28.2":"43.0.2357.65","0.28.3":"43.0.2357.65","0.29.1":"43.0.2357.65","0.29.2":"43.0.2357.65","0.30.4":"44.0.2403.125","0.31.0":"44.0.2403.125","0.31.2":"45.0.2454.85","0.32.2":"45.0.2454.85","0.32.3":"45.0.2454.85","0.33.0":"45.0.2454.85","0.33.1":"45.0.2454.85","0.33.2":"45.0.2454.85","0.33.3":"45.0.2454.85","0.33.4":"45.0.2454.85","0.33.6":"45.0.2454.85","0.33.7":"45.0.2454.85","0.33.8":"45.0.2454.85","0.33.9":"45.0.2454.85","0.34.0":"45.0.2454.85","0.34.1":"45.0.2454.85","0.34.2":"45.0.2454.85","0.34.3":"45.0.2454.85","0.34.4":"45.0.2454.85","0.35.1":"45.0.2454.85","0.35.2":"45.0.2454.85","0.35.3":"45.0.2454.85","0.35.4":"45.0.2454.85","0.35.5":"45.0.2454.85","0.36.0":"47.0.2526.73","0.36.2":"47.0.2526.73","0.36.3":"47.0.2526.73","0.36.4":"47.0.2526.73","0.36.5":"47.0.2526.110","0.36.6":"47.0.2526.110","0.36.7":"47.0.2526.110","0.36.8":"47.0.2526.110","0.36.9":"47.0.2526.110","0.36.10":"47.0.2526.110","0.36.11":"47.0.2526.110","0.36.12":"47.0.2526.110","0.37.0":"49.0.2623.75","0.37.1":"49.0.2623.75","0.37.3":"49.0.2623.75","0.37.4":"49.0.2623.75","0.37.5":"49.0.2623.75","0.37.6":"49.0.2623.75","0.37.7":"49.0.2623.75","0.37.8":"49.0.2623.75","1.0.0":"49.0.2623.75","1.0.1":"49.0.2623.75","1.0.2":"49.0.2623.75","1.1.0":"50.0.2661.102","1.1.1":"50.0.2661.102","1.1.2":"50.0.2661.102","1.1.3":"50.0.2661.102","1.2.0":"51.0.2704.63","1.2.1":"51.0.2704.63","1.2.2":"51.0.2704.84","1.2.3":"51.0.2704.84","1.2.4":"51.0.2704.103","1.2.5":"51.0.2704.103","1.2.6":"51.0.2704.106","1.2.7":"51.0.2704.106","1.2.8":"51.0.2704.106","1.3.0":"52.0.2743.82","1.3.1":"52.0.2743.82","1.3.2":"52.0.2743.82","1.3.3":"52.0.2743.82","1.3.4":"52.0.2743.82","1.3.5":"52.0.2743.82","1.3.6":"52.0.2743.82","1.3.7":"52.0.2743.82","1.3.9":"52.0.2743.82","1.3.10":"52.0.2743.82","1.3.13":"52.0.2743.82","1.3.14":"52.0.2743.82","1.3.15":"52.0.2743.82","1.4.0":"53.0.2785.113","1.4.1":"53.0.2785.113","1.4.2":"53.0.2785.113","1.4.3":"53.0.2785.113","1.4.4":"53.0.2785.113","1.4.5":"53.0.2785.113","1.4.6":"53.0.2785.143","1.4.7":"53.0.2785.143","1.4.8":"53.0.2785.143","1.4.10":"53.0.2785.143","1.4.11":"53.0.2785.143","1.4.12":"54.0.2840.51","1.4.13":"53.0.2785.143","1.4.14":"53.0.2785.143","1.4.15":"53.0.2785.143","1.4.16":"53.0.2785.143","1.5.0":"54.0.2840.101","1.5.1":"54.0.2840.101","1.6.0":"56.0.2924.87","1.6.1":"56.0.2924.87","1.6.2":"56.0.2924.87","1.6.3":"56.0.2924.87","1.6.4":"56.0.2924.87","1.6.5":"56.0.2924.87","1.6.6":"56.0.2924.87","1.6.7":"56.0.2924.87","1.6.8":"56.0.2924.87","1.6.9":"56.0.2924.87","1.6.10":"56.0.2924.87","1.6.11":"56.0.2924.87","1.6.12":"56.0.2924.87","1.6.13":"56.0.2924.87","1.6.14":"56.0.2924.87","1.6.15":"56.0.2924.87","1.6.16":"56.0.2924.87","1.6.17":"56.0.2924.87","1.6.18":"56.0.2924.87","1.7.0":"58.0.3029.110","1.7.1":"58.0.3029.110","1.7.2":"58.0.3029.110","1.7.3":"58.0.3029.110","1.7.4":"58.0.3029.110","1.7.5":"58.0.3029.110","1.7.6":"58.0.3029.110","1.7.7":"58.0.3029.110","1.7.8":"58.0.3029.110","1.7.9":"58.0.3029.110","1.7.10":"58.0.3029.110","1.7.11":"58.0.3029.110","1.7.12":"58.0.3029.110","1.7.13":"58.0.3029.110","1.7.14":"58.0.3029.110","1.7.15":"58.0.3029.110","1.7.16":"58.0.3029.110","1.8.0":"59.0.3071.115","1.8.1":"59.0.3071.115","1.8.2-beta.1":"59.0.3071.115","1.8.2-beta.2":"59.0.3071.115","1.8.2-beta.3":"59.0.3071.115","1.8.2-beta.4":"59.0.3071.115","1.8.2-beta.5":"59.0.3071.115","1.8.2":"59.0.3071.115","1.8.3":"59.0.3071.115","1.8.4":"59.0.3071.115","1.8.5":"59.0.3071.115","1.8.6":"59.0.3071.115","1.8.7":"59.0.3071.115","1.8.8":"59.0.3071.115","2.0.0-beta.1":"61.0.3163.100","2.0.0-beta.2":"61.0.3163.100","2.0.0-beta.3":"61.0.3163.100","2.0.0-beta.4":"61.0.3163.100","2.0.0-beta.5":"61.0.3163.100","2.0.0-beta.6":"61.0.3163.100","2.0.0-beta.7":"61.0.3163.100","2.0.0-beta.8":"61.0.3163.100","2.0.0":"61.0.3163.100","2.0.1":"61.0.3163.100","2.0.2":"61.0.3163.100","2.0.3":"61.0.3163.100","2.0.4":"61.0.3163.100","2.0.5":"61.0.3163.100","2.0.6":"61.0.3163.100","2.0.7":"61.0.3163.100","2.0.8-nightly.20180819":"61.0.3163.100","2.0.8-nightly.20180820":"61.0.3163.100","2.0.8":"61.0.3163.100","2.0.9":"61.0.3163.100","2.0.10":"61.0.3163.100","2.0.11":"61.0.3163.100","2.0.12":"61.0.3163.100","2.0.13":"61.0.3163.100","2.0.14":"61.0.3163.100","2.0.15":"61.0.3163.100","2.0.16":"61.0.3163.100","2.0.17":"61.0.3163.100","2.0.18":"61.0.3163.100","2.1.0-unsupported.20180809":"61.0.3163.100","3.0.0-beta.1":"66.0.3359.181","3.0.0-beta.2":"66.0.3359.181","3.0.0-beta.3":"66.0.3359.181","3.0.0-beta.4":"66.0.3359.181","3.0.0-beta.5":"66.0.3359.181","3.0.0-beta.6":"66.0.3359.181","3.0.0-beta.7":"66.0.3359.181","3.0.0-beta.8":"66.0.3359.181","3.0.0-beta.9":"66.0.3359.181","3.0.0-beta.10":"66.0.3359.181","3.0.0-beta.11":"66.0.3359.181","3.0.0-beta.12":"66.0.3359.181","3.0.0-beta.13":"66.0.3359.181","3.0.0-nightly.20180818":"66.0.3359.181","3.0.0-nightly.20180821":"66.0.3359.181","3.0.0-nightly.20180823":"66.0.3359.181","3.0.0-nightly.20180904":"66.0.3359.181","3.0.0":"66.0.3359.181","3.0.1":"66.0.3359.181","3.0.2":"66.0.3359.181","3.0.3":"66.0.3359.181","3.0.4":"66.0.3359.181","3.0.5":"66.0.3359.181","3.0.6":"66.0.3359.181","3.0.7":"66.0.3359.181","3.0.8":"66.0.3359.181","3.0.9":"66.0.3359.181","3.0.10":"66.0.3359.181","3.0.11":"66.0.3359.181","3.0.12":"66.0.3359.181","3.0.13":"66.0.3359.181","3.0.14":"66.0.3359.181","3.0.15":"66.0.3359.181","3.0.16":"66.0.3359.181","3.1.0-beta.1":"66.0.3359.181","3.1.0-beta.2":"66.0.3359.181","3.1.0-beta.3":"66.0.3359.181","3.1.0-beta.4":"66.0.3359.181","3.1.0-beta.5":"66.0.3359.181","3.1.0":"66.0.3359.181","3.1.1":"66.0.3359.181","3.1.2":"66.0.3359.181","3.1.3":"66.0.3359.181","3.1.4":"66.0.3359.181","3.1.5":"66.0.3359.181","3.1.6":"66.0.3359.181","3.1.7":"66.0.3359.181","3.1.8":"66.0.3359.181","3.1.9":"66.0.3359.181","3.1.10":"66.0.3359.181","3.1.11":"66.0.3359.181","3.1.12":"66.0.3359.181","3.1.13":"66.0.3359.181","4.0.0-beta.1":"69.0.3497.106","4.0.0-beta.2":"69.0.3497.106","4.0.0-beta.3":"69.0.3497.106","4.0.0-beta.4":"69.0.3497.106","4.0.0-beta.5":"69.0.3497.106","4.0.0-beta.6":"69.0.3497.106","4.0.0-beta.7":"69.0.3497.106","4.0.0-beta.8":"69.0.3497.106","4.0.0-beta.9":"69.0.3497.106","4.0.0-beta.10":"69.0.3497.106","4.0.0-beta.11":"69.0.3497.106","4.0.0-nightly.20180817":"66.0.3359.181","4.0.0-nightly.20180819":"66.0.3359.181","4.0.0-nightly.20180821":"66.0.3359.181","4.0.0-nightly.20180929":"67.0.3396.99","4.0.0-nightly.20181006":"68.0.3440.128","4.0.0-nightly.20181010":"69.0.3497.106","4.0.0":"69.0.3497.106","4.0.1":"69.0.3497.106","4.0.2":"69.0.3497.106","4.0.3":"69.0.3497.106","4.0.4":"69.0.3497.106","4.0.5":"69.0.3497.106","4.0.6":"69.0.3497.106","4.0.7":"69.0.3497.128","4.0.8":"69.0.3497.128","4.1.0":"69.0.3497.128","4.1.1":"69.0.3497.128","4.1.2":"69.0.3497.128","4.1.3":"69.0.3497.128","4.1.4":"69.0.3497.128","4.1.5":"69.0.3497.128","4.2.0":"69.0.3497.128","4.2.1":"69.0.3497.128","4.2.2":"69.0.3497.128","4.2.3":"69.0.3497.128","4.2.4":"69.0.3497.128","4.2.5":"69.0.3497.128","4.2.6":"69.0.3497.128","4.2.7":"69.0.3497.128","4.2.8":"69.0.3497.128","4.2.9":"69.0.3497.128","4.2.10":"69.0.3497.128","4.2.11":"69.0.3497.128","4.2.12":"69.0.3497.128","5.0.0-beta.1":"72.0.3626.52","5.0.0-beta.2":"72.0.3626.52","5.0.0-beta.3":"73.0.3683.27","5.0.0-beta.4":"73.0.3683.54","5.0.0-beta.5":"73.0.3683.61","5.0.0-beta.6":"73.0.3683.84","5.0.0-beta.7":"73.0.3683.94","5.0.0-beta.8":"73.0.3683.104","5.0.0-beta.9":"73.0.3683.117","5.0.0-nightly.20190107":"70.0.3538.110","5.0.0-nightly.20190121":"71.0.3578.98","5.0.0-nightly.20190122":"71.0.3578.98","5.0.0":"73.0.3683.119","5.0.1":"73.0.3683.121","5.0.2":"73.0.3683.121","5.0.3":"73.0.3683.121","5.0.4":"73.0.3683.121","5.0.5":"73.0.3683.121","5.0.6":"73.0.3683.121","5.0.7":"73.0.3683.121","5.0.8":"73.0.3683.121","5.0.9":"73.0.3683.121","5.0.10":"73.0.3683.121","5.0.11":"73.0.3683.121","5.0.12":"73.0.3683.121","5.0.13":"73.0.3683.121","6.0.0-beta.1":"76.0.3774.1","6.0.0-beta.2":"76.0.3783.1","6.0.0-beta.3":"76.0.3783.1","6.0.0-beta.4":"76.0.3783.1","6.0.0-beta.5":"76.0.3805.4","6.0.0-beta.6":"76.0.3809.3","6.0.0-beta.7":"76.0.3809.22","6.0.0-beta.8":"76.0.3809.26","6.0.0-beta.9":"76.0.3809.26","6.0.0-beta.10":"76.0.3809.37","6.0.0-beta.11":"76.0.3809.42","6.0.0-beta.12":"76.0.3809.54","6.0.0-beta.13":"76.0.3809.60","6.0.0-beta.14":"76.0.3809.68","6.0.0-beta.15":"76.0.3809.74","6.0.0-nightly.20190212":"72.0.3626.107","6.0.0-nightly.20190213":"72.0.3626.110","6.0.0-nightly.20190311":"74.0.3724.8","6.0.0":"76.0.3809.88","6.0.1":"76.0.3809.102","6.0.2":"76.0.3809.110","6.0.3":"76.0.3809.126","6.0.4":"76.0.3809.131","6.0.5":"76.0.3809.136","6.0.6":"76.0.3809.138","6.0.7":"76.0.3809.139","6.0.8":"76.0.3809.146","6.0.9":"76.0.3809.146","6.0.10":"76.0.3809.146","6.0.11":"76.0.3809.146","6.0.12":"76.0.3809.146","6.1.0":"76.0.3809.146","6.1.1":"76.0.3809.146","6.1.2":"76.0.3809.146","6.1.3":"76.0.3809.146","6.1.4":"76.0.3809.146","6.1.5":"76.0.3809.146","6.1.6":"76.0.3809.146","6.1.7":"76.0.3809.146","6.1.8":"76.0.3809.146","6.1.9":"76.0.3809.146","6.1.10":"76.0.3809.146","6.1.11":"76.0.3809.146","6.1.12":"76.0.3809.146","7.0.0-beta.1":"78.0.3866.0","7.0.0-beta.2":"78.0.3866.0","7.0.0-beta.3":"78.0.3866.0","7.0.0-beta.4":"78.0.3896.6","7.0.0-beta.5":"78.0.3905.1","7.0.0-beta.6":"78.0.3905.1","7.0.0-beta.7":"78.0.3905.1","7.0.0-nightly.20190521":"76.0.3784.0","7.0.0-nightly.20190529":"76.0.3806.0","7.0.0-nightly.20190530":"76.0.3806.0","7.0.0-nightly.20190531":"76.0.3806.0","7.0.0-nightly.20190602":"76.0.3806.0","7.0.0-nightly.20190603":"76.0.3806.0","7.0.0-nightly.20190604":"77.0.3814.0","7.0.0-nightly.20190605":"77.0.3815.0","7.0.0-nightly.20190606":"77.0.3815.0","7.0.0-nightly.20190607":"77.0.3815.0","7.0.0-nightly.20190608":"77.0.3815.0","7.0.0-nightly.20190609":"77.0.3815.0","7.0.0-nightly.20190611":"77.0.3815.0","7.0.0-nightly.20190612":"77.0.3815.0","7.0.0-nightly.20190613":"77.0.3815.0","7.0.0-nightly.20190615":"77.0.3815.0","7.0.0-nightly.20190616":"77.0.3815.0","7.0.0-nightly.20190618":"77.0.3815.0","7.0.0-nightly.20190619":"77.0.3815.0","7.0.0-nightly.20190622":"77.0.3815.0","7.0.0-nightly.20190623":"77.0.3815.0","7.0.0-nightly.20190624":"77.0.3815.0","7.0.0-nightly.20190627":"77.0.3815.0","7.0.0-nightly.20190629":"77.0.3815.0","7.0.0-nightly.20190630":"77.0.3815.0","7.0.0-nightly.20190701":"77.0.3815.0","7.0.0-nightly.20190702":"77.0.3815.0","7.0.0-nightly.20190704":"77.0.3843.0","7.0.0-nightly.20190705":"77.0.3843.0","7.0.0-nightly.20190719":"77.0.3848.0","7.0.0-nightly.20190720":"77.0.3848.0","7.0.0-nightly.20190721":"77.0.3848.0","7.0.0-nightly.20190726":"77.0.3864.0","7.0.0-nightly.20190727":"78.0.3866.0","7.0.0-nightly.20190728":"78.0.3866.0","7.0.0-nightly.20190729":"78.0.3866.0","7.0.0-nightly.20190730":"78.0.3866.0","7.0.0-nightly.20190731":"78.0.3866.0","7.0.0":"78.0.3905.1","7.0.1":"78.0.3904.92","7.1.0":"78.0.3904.94","7.1.1":"78.0.3904.99","7.1.2":"78.0.3904.113","7.1.3":"78.0.3904.126","7.1.4":"78.0.3904.130","7.1.5":"78.0.3904.130","7.1.6":"78.0.3904.130","7.1.7":"78.0.3904.130","7.1.8":"78.0.3904.130","7.1.9":"78.0.3904.130","7.1.10":"78.0.3904.130","7.1.11":"78.0.3904.130","7.1.12":"78.0.3904.130","7.1.13":"78.0.3904.130","7.1.14":"78.0.3904.130","7.2.0":"78.0.3904.130","7.2.1":"78.0.3904.130","7.2.2":"78.0.3904.130","7.2.3":"78.0.3904.130","7.2.4":"78.0.3904.130","7.3.0":"78.0.3904.130","7.3.1":"78.0.3904.130","7.3.2":"78.0.3904.130","7.3.3":"78.0.3904.130","8.0.0-beta.1":"79.0.3931.0","8.0.0-beta.2":"79.0.3931.0","8.0.0-beta.3":"80.0.3955.0","8.0.0-beta.4":"80.0.3955.0","8.0.0-beta.5":"80.0.3987.14","8.0.0-beta.6":"80.0.3987.51","8.0.0-beta.7":"80.0.3987.59","8.0.0-beta.8":"80.0.3987.75","8.0.0-beta.9":"80.0.3987.75","8.0.0-nightly.20190801":"78.0.3866.0","8.0.0-nightly.20190802":"78.0.3866.0","8.0.0-nightly.20190803":"78.0.3871.0","8.0.0-nightly.20190806":"78.0.3871.0","8.0.0-nightly.20190807":"78.0.3871.0","8.0.0-nightly.20190808":"78.0.3871.0","8.0.0-nightly.20190809":"78.0.3871.0","8.0.0-nightly.20190810":"78.0.3871.0","8.0.0-nightly.20190811":"78.0.3871.0","8.0.0-nightly.20190812":"78.0.3871.0","8.0.0-nightly.20190813":"78.0.3871.0","8.0.0-nightly.20190814":"78.0.3871.0","8.0.0-nightly.20190815":"78.0.3871.0","8.0.0-nightly.20190816":"78.0.3881.0","8.0.0-nightly.20190817":"78.0.3881.0","8.0.0-nightly.20190818":"78.0.3881.0","8.0.0-nightly.20190819":"78.0.3881.0","8.0.0-nightly.20190820":"78.0.3881.0","8.0.0-nightly.20190824":"78.0.3892.0","8.0.0-nightly.20190825":"78.0.3892.0","8.0.0-nightly.20190827":"78.0.3892.0","8.0.0-nightly.20190828":"78.0.3892.0","8.0.0-nightly.20190830":"78.0.3892.0","8.0.0-nightly.20190901":"78.0.3892.0","8.0.0-nightly.20190902":"78.0.3892.0","8.0.0-nightly.20190907":"78.0.3892.0","8.0.0-nightly.20190909":"78.0.3892.0","8.0.0-nightly.20190910":"78.0.3892.0","8.0.0-nightly.20190911":"78.0.3892.0","8.0.0-nightly.20190913":"78.0.3892.0","8.0.0-nightly.20190914":"78.0.3892.0","8.0.0-nightly.20190915":"78.0.3892.0","8.0.0-nightly.20190917":"78.0.3892.0","8.0.0-nightly.20190919":"79.0.3915.0","8.0.0-nightly.20190920":"79.0.3915.0","8.0.0-nightly.20190923":"79.0.3919.0","8.0.0-nightly.20190924":"79.0.3919.0","8.0.0-nightly.20190926":"79.0.3919.0","8.0.0-nightly.20190929":"79.0.3919.0","8.0.0-nightly.20190930":"79.0.3919.0","8.0.0-nightly.20191001":"79.0.3919.0","8.0.0-nightly.20191004":"79.0.3919.0","8.0.0-nightly.20191005":"79.0.3919.0","8.0.0-nightly.20191006":"79.0.3919.0","8.0.0-nightly.20191009":"79.0.3919.0","8.0.0-nightly.20191011":"79.0.3919.0","8.0.0-nightly.20191012":"79.0.3919.0","8.0.0-nightly.20191017":"79.0.3919.0","8.0.0-nightly.20191019":"79.0.3931.0","8.0.0-nightly.20191020":"79.0.3931.0","8.0.0-nightly.20191021":"79.0.3931.0","8.0.0-nightly.20191023":"79.0.3931.0","8.0.0-nightly.20191101":"80.0.3952.0","8.0.0-nightly.20191105":"80.0.3952.0","8.0.0":"80.0.3987.86","8.0.1":"80.0.3987.86","8.0.2":"80.0.3987.86","8.0.3":"80.0.3987.134","8.1.0":"80.0.3987.137","8.1.1":"80.0.3987.141","8.2.0":"80.0.3987.158","8.2.1":"80.0.3987.163","8.2.2":"80.0.3987.163","8.2.3":"80.0.3987.163","8.2.4":"80.0.3987.165","8.2.5":"80.0.3987.165","8.3.0":"80.0.3987.165","8.3.1":"80.0.3987.165","8.3.2":"80.0.3987.165","8.3.3":"80.0.3987.165","8.3.4":"80.0.3987.165","8.4.0":"80.0.3987.165","8.4.1":"80.0.3987.165","8.5.0":"80.0.3987.165","8.5.1":"80.0.3987.165","8.5.2":"80.0.3987.165","8.5.3":"80.0.3987.163","8.5.4":"80.0.3987.163","8.5.5":"80.0.3987.163","9.0.0-beta.1":"82.0.4048.0","9.0.0-beta.2":"82.0.4048.0","9.0.0-beta.3":"82.0.4048.0","9.0.0-beta.4":"82.0.4048.0","9.0.0-beta.5":"82.0.4048.0","9.0.0-beta.6":"82.0.4058.2","9.0.0-beta.7":"82.0.4058.2","9.0.0-beta.9":"82.0.4058.2","9.0.0-beta.10":"82.0.4085.10","9.0.0-beta.12":"82.0.4085.14","9.0.0-beta.13":"82.0.4085.14","9.0.0-beta.14":"82.0.4085.27","9.0.0-beta.15":"83.0.4102.3","9.0.0-beta.16":"83.0.4102.3","9.0.0-beta.17":"83.0.4103.14","9.0.0-beta.18":"83.0.4103.16","9.0.0-beta.19":"83.0.4103.24","9.0.0-beta.20":"83.0.4103.26","9.0.0-beta.21":"83.0.4103.26","9.0.0-beta.22":"83.0.4103.34","9.0.0-beta.23":"83.0.4103.44","9.0.0-beta.24":"83.0.4103.45","9.0.0-nightly.20191121":"80.0.3954.0","9.0.0-nightly.20191122":"80.0.3954.0","9.0.0-nightly.20191123":"80.0.3954.0","9.0.0-nightly.20191124":"80.0.3954.0","9.0.0-nightly.20191129":"80.0.3954.0","9.0.0-nightly.20191130":"80.0.3954.0","9.0.0-nightly.20191201":"80.0.3954.0","9.0.0-nightly.20191202":"80.0.3954.0","9.0.0-nightly.20191203":"80.0.3954.0","9.0.0-nightly.20191204":"80.0.3954.0","9.0.0-nightly.20191210":"80.0.3954.0","9.0.0-nightly.20191220":"81.0.3994.0","9.0.0-nightly.20191221":"81.0.3994.0","9.0.0-nightly.20191222":"81.0.3994.0","9.0.0-nightly.20191223":"81.0.3994.0","9.0.0-nightly.20191224":"81.0.3994.0","9.0.0-nightly.20191225":"81.0.3994.0","9.0.0-nightly.20191226":"81.0.3994.0","9.0.0-nightly.20191228":"81.0.3994.0","9.0.0-nightly.20191229":"81.0.3994.0","9.0.0-nightly.20191230":"81.0.3994.0","9.0.0-nightly.20191231":"81.0.3994.0","9.0.0-nightly.20200101":"81.0.3994.0","9.0.0-nightly.20200103":"81.0.3994.0","9.0.0-nightly.20200104":"81.0.3994.0","9.0.0-nightly.20200105":"81.0.3994.0","9.0.0-nightly.20200106":"81.0.3994.0","9.0.0-nightly.20200108":"81.0.3994.0","9.0.0-nightly.20200109":"81.0.3994.0","9.0.0-nightly.20200110":"81.0.3994.0","9.0.0-nightly.20200111":"81.0.3994.0","9.0.0-nightly.20200113":"81.0.3994.0","9.0.0-nightly.20200115":"81.0.3994.0","9.0.0-nightly.20200116":"81.0.3994.0","9.0.0-nightly.20200117":"81.0.3994.0","9.0.0-nightly.20200119":"81.0.4030.0","9.0.0-nightly.20200121":"81.0.4030.0","9.0.0":"83.0.4103.64","9.0.1":"83.0.4103.94","9.0.2":"83.0.4103.94","9.0.3":"83.0.4103.100","9.0.4":"83.0.4103.104","9.0.5":"83.0.4103.119","9.1.0":"83.0.4103.122","9.1.1":"83.0.4103.122","9.1.2":"83.0.4103.122","9.2.0":"83.0.4103.122","9.2.1":"83.0.4103.122","9.3.0":"83.0.4103.122","9.3.1":"83.0.4103.122","9.3.2":"83.0.4103.122","9.3.3":"83.0.4103.122","9.3.4":"83.0.4103.122","9.3.5":"83.0.4103.122","9.4.0":"83.0.4103.122","9.4.1":"83.0.4103.122","9.4.2":"83.0.4103.122","9.4.3":"83.0.4103.122","9.4.4":"83.0.4103.122","10.0.0-beta.1":"84.0.4129.0","10.0.0-beta.2":"84.0.4129.0","10.0.0-beta.3":"85.0.4161.2","10.0.0-beta.4":"85.0.4161.2","10.0.0-beta.8":"85.0.4181.1","10.0.0-beta.9":"85.0.4181.1","10.0.0-beta.10":"85.0.4183.19","10.0.0-beta.11":"85.0.4183.20","10.0.0-beta.12":"85.0.4183.26","10.0.0-beta.13":"85.0.4183.39","10.0.0-beta.14":"85.0.4183.39","10.0.0-beta.15":"85.0.4183.39","10.0.0-beta.17":"85.0.4183.39","10.0.0-beta.19":"85.0.4183.39","10.0.0-beta.20":"85.0.4183.39","10.0.0-beta.21":"85.0.4183.39","10.0.0-beta.23":"85.0.4183.70","10.0.0-beta.24":"85.0.4183.78","10.0.0-beta.25":"85.0.4183.80","10.0.0-nightly.20200209":"82.0.4050.0","10.0.0-nightly.20200210":"82.0.4050.0","10.0.0-nightly.20200211":"82.0.4050.0","10.0.0-nightly.20200216":"82.0.4050.0","10.0.0-nightly.20200217":"82.0.4050.0","10.0.0-nightly.20200218":"82.0.4050.0","10.0.0-nightly.20200221":"82.0.4050.0","10.0.0-nightly.20200222":"82.0.4050.0","10.0.0-nightly.20200223":"82.0.4050.0","10.0.0-nightly.20200226":"82.0.4050.0","10.0.0-nightly.20200303":"82.0.4050.0","10.0.0-nightly.20200304":"82.0.4076.0","10.0.0-nightly.20200305":"82.0.4076.0","10.0.0-nightly.20200306":"82.0.4076.0","10.0.0-nightly.20200309":"82.0.4076.0","10.0.0-nightly.20200310":"82.0.4076.0","10.0.0-nightly.20200311":"82.0.4083.0","10.0.0-nightly.20200316":"83.0.4086.0","10.0.0-nightly.20200317":"83.0.4087.0","10.0.0-nightly.20200318":"83.0.4087.0","10.0.0-nightly.20200320":"83.0.4087.0","10.0.0-nightly.20200323":"83.0.4087.0","10.0.0-nightly.20200324":"83.0.4087.0","10.0.0-nightly.20200325":"83.0.4087.0","10.0.0-nightly.20200326":"83.0.4087.0","10.0.0-nightly.20200327":"83.0.4087.0","10.0.0-nightly.20200330":"83.0.4087.0","10.0.0-nightly.20200331":"83.0.4087.0","10.0.0-nightly.20200401":"83.0.4087.0","10.0.0-nightly.20200402":"83.0.4087.0","10.0.0-nightly.20200403":"83.0.4087.0","10.0.0-nightly.20200406":"83.0.4087.0","10.0.0-nightly.20200408":"83.0.4095.0","10.0.0-nightly.20200410":"83.0.4095.0","10.0.0-nightly.20200413":"83.0.4095.0","10.0.0-nightly.20200414":"84.0.4114.0","10.0.0-nightly.20200415":"84.0.4115.0","10.0.0-nightly.20200416":"84.0.4115.0","10.0.0-nightly.20200417":"84.0.4115.0","10.0.0-nightly.20200422":"84.0.4121.0","10.0.0-nightly.20200423":"84.0.4121.0","10.0.0-nightly.20200427":"84.0.4125.0","10.0.0-nightly.20200428":"84.0.4125.0","10.0.0-nightly.20200429":"84.0.4125.0","10.0.0-nightly.20200430":"84.0.4125.0","10.0.0-nightly.20200501":"84.0.4129.0","10.0.0-nightly.20200504":"84.0.4129.0","10.0.0-nightly.20200505":"84.0.4129.0","10.0.0-nightly.20200506":"84.0.4129.0","10.0.0-nightly.20200507":"84.0.4129.0","10.0.0-nightly.20200508":"84.0.4129.0","10.0.0-nightly.20200511":"84.0.4129.0","10.0.0-nightly.20200512":"84.0.4129.0","10.0.0-nightly.20200513":"84.0.4129.0","10.0.0-nightly.20200514":"84.0.4129.0","10.0.0-nightly.20200515":"84.0.4129.0","10.0.0-nightly.20200518":"84.0.4129.0","10.0.0-nightly.20200519":"84.0.4129.0","10.0.0-nightly.20200520":"84.0.4129.0","10.0.0-nightly.20200521":"84.0.4129.0","10.0.0":"85.0.4183.84","10.0.1":"85.0.4183.86","10.1.0":"85.0.4183.87","10.1.1":"85.0.4183.93","10.1.2":"85.0.4183.98","10.1.3":"85.0.4183.121","10.1.4":"85.0.4183.121","10.1.5":"85.0.4183.121","10.1.6":"85.0.4183.121","10.1.7":"85.0.4183.121","10.2.0":"85.0.4183.121","10.3.0":"85.0.4183.121","10.3.1":"85.0.4183.121","10.3.2":"85.0.4183.121","10.4.0":"85.0.4183.121","10.4.1":"85.0.4183.121","10.4.2":"85.0.4183.121","10.4.3":"85.0.4183.121","10.4.4":"85.0.4183.121","10.4.5":"85.0.4183.121","10.4.6":"85.0.4183.121","10.4.7":"85.0.4183.121","11.0.0-beta.1":"86.0.4234.0","11.0.0-beta.3":"86.0.4234.0","11.0.0-beta.4":"86.0.4234.0","11.0.0-beta.5":"86.0.4234.0","11.0.0-beta.6":"86.0.4234.0","11.0.0-beta.7":"86.0.4234.0","11.0.0-beta.8":"87.0.4251.1","11.0.0-beta.9":"87.0.4251.1","11.0.0-beta.11":"87.0.4251.1","11.0.0-beta.12":"87.0.4280.11","11.0.0-beta.13":"87.0.4280.11","11.0.0-beta.16":"87.0.4280.27","11.0.0-beta.17":"87.0.4280.27","11.0.0-beta.18":"87.0.4280.27","11.0.0-beta.19":"87.0.4280.27","11.0.0-beta.20":"87.0.4280.40","11.0.0-beta.22":"87.0.4280.47","11.0.0-beta.23":"87.0.4280.47","11.0.0-nightly.20200525":"84.0.4129.0","11.0.0-nightly.20200526":"84.0.4129.0","11.0.0-nightly.20200529":"85.0.4156.0","11.0.0-nightly.20200602":"85.0.4162.0","11.0.0-nightly.20200603":"85.0.4162.0","11.0.0-nightly.20200604":"85.0.4162.0","11.0.0-nightly.20200609":"85.0.4162.0","11.0.0-nightly.20200610":"85.0.4162.0","11.0.0-nightly.20200611":"85.0.4162.0","11.0.0-nightly.20200615":"85.0.4162.0","11.0.0-nightly.20200616":"85.0.4162.0","11.0.0-nightly.20200617":"85.0.4162.0","11.0.0-nightly.20200618":"85.0.4162.0","11.0.0-nightly.20200619":"85.0.4162.0","11.0.0-nightly.20200701":"85.0.4179.0","11.0.0-nightly.20200702":"85.0.4179.0","11.0.0-nightly.20200703":"85.0.4179.0","11.0.0-nightly.20200706":"85.0.4179.0","11.0.0-nightly.20200707":"85.0.4179.0","11.0.0-nightly.20200708":"85.0.4179.0","11.0.0-nightly.20200709":"85.0.4179.0","11.0.0-nightly.20200716":"86.0.4203.0","11.0.0-nightly.20200717":"86.0.4203.0","11.0.0-nightly.20200720":"86.0.4203.0","11.0.0-nightly.20200721":"86.0.4203.0","11.0.0-nightly.20200723":"86.0.4209.0","11.0.0-nightly.20200724":"86.0.4209.0","11.0.0-nightly.20200729":"86.0.4209.0","11.0.0-nightly.20200730":"86.0.4209.0","11.0.0-nightly.20200731":"86.0.4209.0","11.0.0-nightly.20200803":"86.0.4209.0","11.0.0-nightly.20200804":"86.0.4209.0","11.0.0-nightly.20200805":"86.0.4209.0","11.0.0-nightly.20200811":"86.0.4209.0","11.0.0-nightly.20200812":"86.0.4209.0","11.0.0-nightly.20200822":"86.0.4234.0","11.0.0-nightly.20200824":"86.0.4234.0","11.0.0-nightly.20200825":"86.0.4234.0","11.0.0-nightly.20200826":"86.0.4234.0","11.0.0":"87.0.4280.60","11.0.1":"87.0.4280.60","11.0.2":"87.0.4280.67","11.0.3":"87.0.4280.67","11.0.4":"87.0.4280.67","11.0.5":"87.0.4280.88","11.1.0":"87.0.4280.88","11.1.1":"87.0.4280.88","11.2.0":"87.0.4280.141","11.2.1":"87.0.4280.141","11.2.2":"87.0.4280.141","11.2.3":"87.0.4280.141","11.3.0":"87.0.4280.141","11.4.0":"87.0.4280.141","11.4.1":"87.0.4280.141","11.4.2":"87.0.4280.141","11.4.3":"87.0.4280.141","11.4.4":"87.0.4280.141","11.4.5":"87.0.4280.141","11.4.6":"87.0.4280.141","11.4.7":"87.0.4280.141","11.4.8":"87.0.4280.141","11.4.9":"87.0.4280.141","11.4.10":"87.0.4280.141","11.4.11":"87.0.4280.141","11.4.12":"87.0.4280.141","11.5.0":"87.0.4280.141","12.0.0-beta.1":"89.0.4328.0","12.0.0-beta.3":"89.0.4328.0","12.0.0-beta.4":"89.0.4328.0","12.0.0-beta.5":"89.0.4328.0","12.0.0-beta.6":"89.0.4328.0","12.0.0-beta.7":"89.0.4328.0","12.0.0-beta.8":"89.0.4328.0","12.0.0-beta.9":"89.0.4328.0","12.0.0-beta.10":"89.0.4328.0","12.0.0-beta.11":"89.0.4328.0","12.0.0-beta.12":"89.0.4328.0","12.0.0-beta.14":"89.0.4328.0","12.0.0-beta.16":"89.0.4348.1","12.0.0-beta.18":"89.0.4348.1","12.0.0-beta.19":"89.0.4348.1","12.0.0-beta.20":"89.0.4348.1","12.0.0-beta.21":"89.0.4388.2","12.0.0-beta.22":"89.0.4388.2","12.0.0-beta.23":"89.0.4388.2","12.0.0-beta.24":"89.0.4388.2","12.0.0-beta.25":"89.0.4388.2","12.0.0-beta.26":"89.0.4388.2","12.0.0-beta.27":"89.0.4389.23","12.0.0-beta.28":"89.0.4389.23","12.0.0-beta.29":"89.0.4389.23","12.0.0-beta.30":"89.0.4389.58","12.0.0-beta.31":"89.0.4389.58","12.0.0-nightly.20200827":"86.0.4234.0","12.0.0-nightly.20200831":"86.0.4234.0","12.0.0-nightly.20200902":"86.0.4234.0","12.0.0-nightly.20200903":"86.0.4234.0","12.0.0-nightly.20200907":"86.0.4234.0","12.0.0-nightly.20200910":"86.0.4234.0","12.0.0-nightly.20200911":"86.0.4234.0","12.0.0-nightly.20200914":"86.0.4234.0","12.0.0-nightly.20201013":"87.0.4268.0","12.0.0-nightly.20201014":"87.0.4268.0","12.0.0-nightly.20201015":"87.0.4268.0","12.0.0-nightly.20201023":"88.0.4292.0","12.0.0-nightly.20201026":"88.0.4292.0","12.0.0-nightly.20201030":"88.0.4306.0","12.0.0-nightly.20201102":"88.0.4306.0","12.0.0-nightly.20201103":"88.0.4306.0","12.0.0-nightly.20201104":"88.0.4306.0","12.0.0-nightly.20201105":"88.0.4306.0","12.0.0-nightly.20201106":"88.0.4306.0","12.0.0-nightly.20201111":"88.0.4306.0","12.0.0-nightly.20201112":"88.0.4306.0","12.0.0-nightly.20201116":"88.0.4324.0","12.0.0":"89.0.4389.69","12.0.1":"89.0.4389.82","12.0.2":"89.0.4389.90","12.0.3":"89.0.4389.114","12.0.4":"89.0.4389.114","12.0.5":"89.0.4389.128","12.0.6":"89.0.4389.128","12.0.7":"89.0.4389.128","12.0.8":"89.0.4389.128","12.0.9":"89.0.4389.128","12.0.10":"89.0.4389.128","12.0.11":"89.0.4389.128","12.0.12":"89.0.4389.128","12.0.13":"89.0.4389.128","12.0.14":"89.0.4389.128","12.0.15":"89.0.4389.128","12.0.16":"89.0.4389.128","12.0.17":"89.0.4389.128","12.0.18":"89.0.4389.128","12.1.0":"89.0.4389.128","12.1.1":"89.0.4389.128","12.1.2":"89.0.4389.128","12.2.0":"89.0.4389.128","12.2.1":"89.0.4389.128","12.2.2":"89.0.4389.128","12.2.3":"89.0.4389.128","13.0.0-beta.2":"90.0.4402.0","13.0.0-beta.3":"90.0.4402.0","13.0.0-beta.4":"90.0.4415.0","13.0.0-beta.5":"90.0.4415.0","13.0.0-beta.6":"90.0.4415.0","13.0.0-beta.7":"90.0.4415.0","13.0.0-beta.8":"90.0.4415.0","13.0.0-beta.9":"90.0.4415.0","13.0.0-beta.11":"90.0.4415.0","13.0.0-beta.12":"90.0.4415.0","13.0.0-beta.13":"90.0.4415.0","13.0.0-beta.14":"91.0.4448.0","13.0.0-beta.16":"91.0.4448.0","13.0.0-beta.17":"91.0.4448.0","13.0.0-beta.18":"91.0.4448.0","13.0.0-beta.20":"91.0.4448.0","13.0.0-beta.21":"91.0.4472.33","13.0.0-beta.22":"91.0.4472.33","13.0.0-beta.23":"91.0.4472.33","13.0.0-beta.24":"91.0.4472.38","13.0.0-beta.26":"91.0.4472.38","13.0.0-beta.27":"91.0.4472.38","13.0.0-beta.28":"91.0.4472.38","13.0.0-nightly.20201119":"89.0.4328.0","13.0.0-nightly.20201123":"89.0.4328.0","13.0.0-nightly.20201124":"89.0.4328.0","13.0.0-nightly.20201126":"89.0.4328.0","13.0.0-nightly.20201127":"89.0.4328.0","13.0.0-nightly.20201130":"89.0.4328.0","13.0.0-nightly.20201201":"89.0.4328.0","13.0.0-nightly.20201202":"89.0.4328.0","13.0.0-nightly.20201203":"89.0.4328.0","13.0.0-nightly.20201204":"89.0.4328.0","13.0.0-nightly.20201207":"89.0.4328.0","13.0.0-nightly.20201208":"89.0.4328.0","13.0.0-nightly.20201209":"89.0.4328.0","13.0.0-nightly.20201210":"89.0.4328.0","13.0.0-nightly.20201211":"89.0.4328.0","13.0.0-nightly.20201214":"89.0.4328.0","13.0.0-nightly.20201215":"89.0.4349.0","13.0.0-nightly.20201216":"89.0.4349.0","13.0.0-nightly.20201221":"89.0.4349.0","13.0.0-nightly.20201222":"89.0.4349.0","13.0.0-nightly.20201223":"89.0.4359.0","13.0.0-nightly.20210104":"89.0.4359.0","13.0.0-nightly.20210108":"89.0.4359.0","13.0.0-nightly.20210111":"89.0.4359.0","13.0.0-nightly.20210113":"89.0.4386.0","13.0.0-nightly.20210114":"89.0.4386.0","13.0.0-nightly.20210118":"89.0.4386.0","13.0.0-nightly.20210122":"89.0.4386.0","13.0.0-nightly.20210125":"89.0.4386.0","13.0.0-nightly.20210127":"89.0.4389.0","13.0.0-nightly.20210128":"89.0.4389.0","13.0.0-nightly.20210129":"89.0.4389.0","13.0.0-nightly.20210201":"89.0.4389.0","13.0.0-nightly.20210202":"89.0.4389.0","13.0.0-nightly.20210203":"89.0.4389.0","13.0.0-nightly.20210205":"89.0.4389.0","13.0.0-nightly.20210208":"89.0.4389.0","13.0.0-nightly.20210209":"89.0.4389.0","13.0.0-nightly.20210210":"90.0.4402.0","13.0.0-nightly.20210211":"90.0.4402.0","13.0.0-nightly.20210212":"90.0.4402.0","13.0.0-nightly.20210216":"90.0.4402.0","13.0.0-nightly.20210217":"90.0.4402.0","13.0.0-nightly.20210218":"90.0.4402.0","13.0.0-nightly.20210219":"90.0.4402.0","13.0.0-nightly.20210222":"90.0.4402.0","13.0.0-nightly.20210225":"90.0.4402.0","13.0.0-nightly.20210226":"90.0.4402.0","13.0.0-nightly.20210301":"90.0.4402.0","13.0.0-nightly.20210302":"90.0.4402.0","13.0.0-nightly.20210303":"90.0.4402.0","13.0.0":"91.0.4472.69","13.0.1":"91.0.4472.69","13.1.0":"91.0.4472.77","13.1.1":"91.0.4472.77","13.1.2":"91.0.4472.77","13.1.3":"91.0.4472.106","13.1.4":"91.0.4472.106","13.1.5":"91.0.4472.124","13.1.6":"91.0.4472.124","13.1.7":"91.0.4472.124","13.1.8":"91.0.4472.164","13.1.9":"91.0.4472.164","13.2.0":"91.0.4472.164","13.2.1":"91.0.4472.164","13.2.2":"91.0.4472.164","13.2.3":"91.0.4472.164","13.3.0":"91.0.4472.164","13.4.0":"91.0.4472.164","13.5.0":"91.0.4472.164","13.5.1":"91.0.4472.164","13.5.2":"91.0.4472.164","13.6.0":"91.0.4472.164","13.6.1":"91.0.4472.164","13.6.2":"91.0.4472.164","13.6.3":"91.0.4472.164","13.6.6":"91.0.4472.164","13.6.7":"91.0.4472.164","13.6.8":"91.0.4472.164","13.6.9":"91.0.4472.164","14.0.0-beta.1":"92.0.4511.0","14.0.0-beta.2":"92.0.4511.0","14.0.0-beta.3":"92.0.4511.0","14.0.0-beta.5":"93.0.4536.0","14.0.0-beta.6":"93.0.4536.0","14.0.0-beta.7":"93.0.4536.0","14.0.0-beta.8":"93.0.4536.0","14.0.0-beta.9":"93.0.4539.0","14.0.0-beta.10":"93.0.4539.0","14.0.0-beta.11":"93.0.4557.4","14.0.0-beta.12":"93.0.4557.4","14.0.0-beta.13":"93.0.4566.0","14.0.0-beta.14":"93.0.4566.0","14.0.0-beta.15":"93.0.4566.0","14.0.0-beta.16":"93.0.4566.0","14.0.0-beta.17":"93.0.4566.0","14.0.0-beta.18":"93.0.4577.15","14.0.0-beta.19":"93.0.4577.15","14.0.0-beta.20":"93.0.4577.15","14.0.0-beta.21":"93.0.4577.15","14.0.0-beta.22":"93.0.4577.25","14.0.0-beta.23":"93.0.4577.25","14.0.0-beta.24":"93.0.4577.51","14.0.0-beta.25":"93.0.4577.51","14.0.0-nightly.20210304":"90.0.4402.0","14.0.0-nightly.20210305":"90.0.4415.0","14.0.0-nightly.20210308":"90.0.4415.0","14.0.0-nightly.20210309":"90.0.4415.0","14.0.0-nightly.20210311":"90.0.4415.0","14.0.0-nightly.20210315":"90.0.4415.0","14.0.0-nightly.20210316":"90.0.4415.0","14.0.0-nightly.20210317":"90.0.4415.0","14.0.0-nightly.20210318":"90.0.4415.0","14.0.0-nightly.20210319":"90.0.4415.0","14.0.0-nightly.20210323":"90.0.4415.0","14.0.0-nightly.20210324":"90.0.4415.0","14.0.0-nightly.20210325":"90.0.4415.0","14.0.0-nightly.20210326":"90.0.4415.0","14.0.0-nightly.20210329":"90.0.4415.0","14.0.0-nightly.20210330":"90.0.4415.0","14.0.0-nightly.20210331":"91.0.4448.0","14.0.0-nightly.20210401":"91.0.4448.0","14.0.0-nightly.20210402":"91.0.4448.0","14.0.0-nightly.20210406":"91.0.4448.0","14.0.0-nightly.20210407":"91.0.4448.0","14.0.0-nightly.20210408":"91.0.4448.0","14.0.0-nightly.20210409":"91.0.4448.0","14.0.0-nightly.20210413":"91.0.4448.0","14.0.0-nightly.20210426":"92.0.4475.0","14.0.0-nightly.20210427":"92.0.4475.0","14.0.0-nightly.20210430":"92.0.4488.0","14.0.0-nightly.20210503":"92.0.4488.0","14.0.0-nightly.20210505":"92.0.4496.0","14.0.0-nightly.20210506":"92.0.4498.0","14.0.0-nightly.20210507":"92.0.4499.0","14.0.0-nightly.20210510":"92.0.4499.0","14.0.0-nightly.20210511":"92.0.4499.0","14.0.0-nightly.20210512":"92.0.4499.0","14.0.0-nightly.20210513":"92.0.4499.0","14.0.0-nightly.20210514":"92.0.4505.0","14.0.0-nightly.20210517":"92.0.4505.0","14.0.0-nightly.20210518":"92.0.4505.0","14.0.0-nightly.20210519":"92.0.4505.0","14.0.0-nightly.20210520":"92.0.4511.0","14.0.0-nightly.20210523":"92.0.4511.0","14.0.0-nightly.20210524":"92.0.4511.0","14.0.0":"93.0.4577.58","14.0.1":"93.0.4577.63","14.0.2":"93.0.4577.82","14.1.0":"93.0.4577.82","14.1.1":"93.0.4577.82","14.2.0":"93.0.4577.82","14.2.1":"93.0.4577.82","14.2.2":"93.0.4577.82","14.2.3":"93.0.4577.82","14.2.4":"93.0.4577.82","14.2.5":"93.0.4577.82","14.2.6":"93.0.4577.82","14.2.7":"93.0.4577.82","14.2.8":"93.0.4577.82","15.0.0-alpha.1":"93.0.4566.0","15.0.0-alpha.2":"93.0.4566.0","15.0.0-alpha.3":"94.0.4584.0","15.0.0-alpha.4":"94.0.4584.0","15.0.0-alpha.5":"94.0.4584.0","15.0.0-alpha.6":"94.0.4584.0","15.0.0-alpha.7":"94.0.4590.2","15.0.0-alpha.8":"94.0.4590.2","15.0.0-alpha.9":"94.0.4590.2","15.0.0-alpha.10":"94.0.4606.12","15.0.0-beta.1":"94.0.4606.20","15.0.0-beta.2":"94.0.4606.20","15.0.0-beta.3":"94.0.4606.31","15.0.0-beta.4":"94.0.4606.31","15.0.0-beta.5":"94.0.4606.31","15.0.0-beta.6":"94.0.4606.31","15.0.0-beta.7":"94.0.4606.31","15.0.0-nightly.20210527":"92.0.4511.0","15.0.0-nightly.20210528":"92.0.4511.0","15.0.0-nightly.20210531":"92.0.4511.0","15.0.0-nightly.20210601":"92.0.4511.0","15.0.0-nightly.20210602":"92.0.4511.0","15.0.0-nightly.20210603":"93.0.4530.0","15.0.0-nightly.20210604":"93.0.4530.0","15.0.0-nightly.20210608":"93.0.4535.0","15.0.0-nightly.20210609":"93.0.4536.0","15.0.0-nightly.20210610":"93.0.4536.0","15.0.0-nightly.20210611":"93.0.4536.0","15.0.0-nightly.20210614":"93.0.4536.0","15.0.0-nightly.20210615":"93.0.4536.0","15.0.0-nightly.20210616":"93.0.4536.0","15.0.0-nightly.20210617":"93.0.4539.0","15.0.0-nightly.20210618":"93.0.4539.0","15.0.0-nightly.20210621":"93.0.4539.0","15.0.0-nightly.20210622":"93.0.4539.0","15.0.0-nightly.20210623":"93.0.4550.0","15.0.0-nightly.20210624":"93.0.4550.0","15.0.0-nightly.20210625":"93.0.4552.0","15.0.0-nightly.20210628":"93.0.4552.0","15.0.0-nightly.20210629":"93.0.4552.0","15.0.0-nightly.20210630":"93.0.4558.0","15.0.0-nightly.20210701":"93.0.4558.0","15.0.0-nightly.20210702":"93.0.4558.0","15.0.0-nightly.20210706":"93.0.4566.0","15.0.0-nightly.20210707":"93.0.4566.0","15.0.0-nightly.20210708":"93.0.4566.0","15.0.0-nightly.20210709":"93.0.4566.0","15.0.0-nightly.20210712":"93.0.4566.0","15.0.0-nightly.20210713":"93.0.4566.0","15.0.0-nightly.20210714":"93.0.4566.0","15.0.0-nightly.20210715":"93.0.4566.0","15.0.0-nightly.20210716":"93.0.4566.0","15.0.0-nightly.20210719":"93.0.4566.0","15.0.0-nightly.20210720":"93.0.4566.0","15.0.0-nightly.20210721":"93.0.4566.0","15.0.0":"94.0.4606.51","15.1.0":"94.0.4606.61","15.1.1":"94.0.4606.61","15.1.2":"94.0.4606.71","15.2.0":"94.0.4606.81","15.3.0":"94.0.4606.81","15.3.1":"94.0.4606.81","15.3.2":"94.0.4606.81","15.3.3":"94.0.4606.81","15.3.4":"94.0.4606.81","15.3.5":"94.0.4606.81","15.3.6":"94.0.4606.81","15.3.7":"94.0.4606.81","15.4.0":"94.0.4606.81","15.4.1":"94.0.4606.81","15.4.2":"94.0.4606.81","16.0.0-alpha.1":"95.0.4629.0","16.0.0-alpha.2":"95.0.4629.0","16.0.0-alpha.3":"95.0.4629.0","16.0.0-alpha.4":"95.0.4629.0","16.0.0-alpha.5":"95.0.4629.0","16.0.0-alpha.6":"95.0.4629.0","16.0.0-alpha.7":"95.0.4629.0","16.0.0-alpha.8":"96.0.4647.0","16.0.0-alpha.9":"96.0.4647.0","16.0.0-beta.1":"96.0.4647.0","16.0.0-beta.2":"96.0.4647.0","16.0.0-beta.3":"96.0.4647.0","16.0.0-beta.4":"96.0.4664.18","16.0.0-beta.5":"96.0.4664.18","16.0.0-beta.6":"96.0.4664.27","16.0.0-beta.7":"96.0.4664.27","16.0.0-beta.8":"96.0.4664.35","16.0.0-beta.9":"96.0.4664.35","16.0.0-nightly.20210722":"93.0.4566.0","16.0.0-nightly.20210723":"93.0.4566.0","16.0.0-nightly.20210726":"93.0.4566.0","16.0.0-nightly.20210727":"94.0.4584.0","16.0.0-nightly.20210728":"94.0.4584.0","16.0.0-nightly.20210729":"94.0.4584.0","16.0.0-nightly.20210802":"94.0.4584.0","16.0.0-nightly.20210803":"94.0.4584.0","16.0.0-nightly.20210804":"94.0.4584.0","16.0.0-nightly.20210805":"94.0.4584.0","16.0.0-nightly.20210806":"94.0.4584.0","16.0.0-nightly.20210809":"94.0.4584.0","16.0.0-nightly.20210810":"94.0.4584.0","16.0.0-nightly.20210811":"94.0.4584.0","16.0.0-nightly.20210812":"94.0.4590.2","16.0.0-nightly.20210813":"94.0.4590.2","16.0.0-nightly.20210816":"94.0.4590.2","16.0.0-nightly.20210817":"94.0.4590.2","16.0.0-nightly.20210818":"94.0.4590.2","16.0.0-nightly.20210819":"94.0.4590.2","16.0.0-nightly.20210820":"94.0.4590.2","16.0.0-nightly.20210823":"94.0.4590.2","16.0.0-nightly.20210824":"95.0.4612.5","16.0.0-nightly.20210825":"95.0.4612.5","16.0.0-nightly.20210826":"95.0.4612.5","16.0.0-nightly.20210827":"95.0.4612.5","16.0.0-nightly.20210830":"95.0.4612.5","16.0.0-nightly.20210831":"95.0.4612.5","16.0.0-nightly.20210901":"95.0.4612.5","16.0.0-nightly.20210902":"95.0.4629.0","16.0.0-nightly.20210903":"95.0.4629.0","16.0.0-nightly.20210906":"95.0.4629.0","16.0.0-nightly.20210907":"95.0.4629.0","16.0.0-nightly.20210908":"95.0.4629.0","16.0.0-nightly.20210909":"95.0.4629.0","16.0.0-nightly.20210910":"95.0.4629.0","16.0.0-nightly.20210913":"95.0.4629.0","16.0.0-nightly.20210914":"95.0.4629.0","16.0.0-nightly.20210915":"95.0.4629.0","16.0.0-nightly.20210916":"95.0.4629.0","16.0.0-nightly.20210917":"95.0.4629.0","16.0.0-nightly.20210920":"95.0.4629.0","16.0.0-nightly.20210921":"95.0.4629.0","16.0.0":"96.0.4664.45","16.0.1":"96.0.4664.45","16.0.2":"96.0.4664.55","16.0.3":"96.0.4664.55","16.0.4":"96.0.4664.55","16.0.5":"96.0.4664.55","16.0.6":"96.0.4664.110","16.0.7":"96.0.4664.110","16.0.8":"96.0.4664.110","16.0.9":"96.0.4664.174","16.0.10":"96.0.4664.174","16.1.0":"96.0.4664.174","16.1.1":"96.0.4664.174","17.0.0-alpha.1":"96.0.4664.4","17.0.0-alpha.2":"96.0.4664.4","17.0.0-alpha.3":"96.0.4664.4","17.0.0-alpha.4":"98.0.4706.0","17.0.0-alpha.5":"98.0.4706.0","17.0.0-alpha.6":"98.0.4706.0","17.0.0-beta.1":"98.0.4706.0","17.0.0-beta.2":"98.0.4706.0","17.0.0-beta.3":"98.0.4758.9","17.0.0-beta.4":"98.0.4758.11","17.0.0-beta.5":"98.0.4758.11","17.0.0-beta.6":"98.0.4758.11","17.0.0-beta.7":"98.0.4758.11","17.0.0-beta.8":"98.0.4758.11","17.0.0-beta.9":"98.0.4758.11","17.0.0-nightly.20211006":"96.0.4647.0","17.0.0-nightly.20211007":"96.0.4647.0","17.0.0-nightly.20211008":"96.0.4647.0","17.0.0-nightly.20211011":"96.0.4647.0","17.0.0-nightly.20211012":"96.0.4647.0","17.0.0-nightly.20211013":"96.0.4647.0","17.0.0-nightly.20211014":"96.0.4647.0","17.0.0-nightly.20211015":"96.0.4647.0","17.0.0-nightly.20211018":"96.0.4647.0","17.0.0-nightly.20211019":"96.0.4647.0","17.0.0-nightly.20211020":"96.0.4647.0","17.0.0-nightly.20211021":"96.0.4647.0","17.0.0-nightly.20211022":"96.0.4664.4","17.0.0-nightly.20211025":"96.0.4664.4","17.0.0-nightly.20211026":"96.0.4664.4","17.0.0-nightly.20211027":"96.0.4664.4","17.0.0-nightly.20211028":"96.0.4664.4","17.0.0-nightly.20211029":"96.0.4664.4","17.0.0-nightly.20211101":"96.0.4664.4","17.0.0-nightly.20211102":"96.0.4664.4","17.0.0-nightly.20211103":"96.0.4664.4","17.0.0-nightly.20211104":"96.0.4664.4","17.0.0-nightly.20211105":"96.0.4664.4","17.0.0-nightly.20211108":"96.0.4664.4","17.0.0-nightly.20211109":"96.0.4664.4","17.0.0-nightly.20211110":"96.0.4664.4","17.0.0-nightly.20211111":"96.0.4664.4","17.0.0-nightly.20211112":"96.0.4664.4","17.0.0-nightly.20211115":"96.0.4664.4","17.0.0-nightly.20211116":"96.0.4664.4","17.0.0-nightly.20211117":"96.0.4664.4","17.0.0":"98.0.4758.74","17.0.1":"98.0.4758.82","17.1.0":"98.0.4758.102","17.1.1":"98.0.4758.109","17.1.2":"98.0.4758.109","17.2.0":"98.0.4758.109","18.0.0-alpha.1":"99.0.4767.0","18.0.0-alpha.2":"99.0.4767.0","18.0.0-alpha.3":"99.0.4767.0","18.0.0-alpha.4":"99.0.4767.0","18.0.0-alpha.5":"99.0.4767.0","18.0.0-beta.1":"100.0.4894.0","18.0.0-beta.2":"100.0.4894.0","18.0.0-beta.3":"100.0.4894.0","18.0.0-beta.4":"100.0.4894.0","18.0.0-beta.5":"100.0.4894.0","18.0.0-beta.6":"100.0.4894.0","18.0.0-nightly.20211118":"96.0.4664.4","18.0.0-nightly.20211119":"96.0.4664.4","18.0.0-nightly.20211122":"96.0.4664.4","18.0.0-nightly.20211123":"96.0.4664.4","18.0.0-nightly.20211124":"98.0.4706.0","18.0.0-nightly.20211125":"98.0.4706.0","18.0.0-nightly.20211126":"98.0.4706.0","18.0.0-nightly.20211129":"98.0.4706.0","18.0.0-nightly.20211130":"98.0.4706.0","18.0.0-nightly.20211201":"98.0.4706.0","18.0.0-nightly.20211202":"98.0.4706.0","18.0.0-nightly.20211203":"98.0.4706.0","18.0.0-nightly.20211206":"98.0.4706.0","18.0.0-nightly.20211207":"98.0.4706.0","18.0.0-nightly.20211208":"98.0.4706.0","18.0.0-nightly.20211209":"98.0.4706.0","18.0.0-nightly.20211210":"98.0.4706.0","18.0.0-nightly.20211213":"98.0.4706.0","18.0.0-nightly.20211214":"98.0.4706.0","18.0.0-nightly.20211215":"98.0.4706.0","18.0.0-nightly.20211216":"98.0.4706.0","18.0.0-nightly.20211217":"98.0.4706.0","18.0.0-nightly.20211220":"98.0.4706.0","18.0.0-nightly.20211221":"98.0.4706.0","18.0.0-nightly.20211222":"98.0.4706.0","18.0.0-nightly.20211223":"98.0.4706.0","18.0.0-nightly.20211228":"98.0.4706.0","18.0.0-nightly.20211229":"98.0.4706.0","18.0.0-nightly.20211231":"98.0.4706.0","18.0.0-nightly.20220103":"98.0.4706.0","18.0.0-nightly.20220104":"98.0.4706.0","18.0.0-nightly.20220105":"98.0.4706.0","18.0.0-nightly.20220106":"98.0.4706.0","18.0.0-nightly.20220107":"98.0.4706.0","18.0.0-nightly.20220110":"98.0.4706.0","18.0.0-nightly.20220111":"99.0.4767.0","18.0.0-nightly.20220112":"99.0.4767.0","18.0.0-nightly.20220113":"99.0.4767.0","18.0.0-nightly.20220114":"99.0.4767.0","18.0.0-nightly.20220117":"99.0.4767.0","18.0.0-nightly.20220118":"99.0.4767.0","18.0.0-nightly.20220119":"99.0.4767.0","18.0.0-nightly.20220121":"99.0.4767.0","18.0.0-nightly.20220124":"99.0.4767.0","18.0.0-nightly.20220125":"99.0.4767.0","18.0.0-nightly.20220127":"99.0.4767.0","18.0.0-nightly.20220128":"99.0.4767.0","18.0.0-nightly.20220131":"99.0.4767.0","18.0.0-nightly.20220201":"99.0.4767.0","19.0.0-nightly.20220202":"99.0.4767.0","19.0.0-nightly.20220203":"99.0.4767.0","19.0.0-nightly.20220204":"99.0.4767.0","19.0.0-nightly.20220207":"99.0.4767.0","19.0.0-nightly.20220208":"99.0.4767.0","19.0.0-nightly.20220209":"99.0.4767.0","19.0.0-nightly.20220308":"100.0.4894.0","19.0.0-nightly.20220309":"100.0.4894.0","19.0.0-nightly.20220310":"100.0.4894.0","19.0.0-nightly.20220311":"100.0.4894.0","19.0.0-nightly.20220314":"100.0.4894.0","19.0.0-nightly.20220315":"100.0.4894.0","19.0.0-nightly.20220316":"100.0.4894.0","19.0.0-nightly.20220317":"100.0.4894.0","19.0.0-nightly.20220318":"100.0.4894.0","19.0.0-nightly.20220321":"100.0.4894.0","19.0.0-nightly.20220322":"100.0.4894.0","19.0.0-nightly.20220323":"100.0.4894.0","19.0.0-nightly.20220324":"100.0.4894.0","19.0.0-nightly.20220325":"102.0.4961.0"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/index.js b/node_modules/mathjs/examples/node_modules/electron-to-chromium/index.js
new file mode 100644
index 0000000..1818281
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/index.js
@@ -0,0 +1,36 @@
+var versions = require('./versions');
+var fullVersions = require('./full-versions');
+var chromiumVersions = require('./chromium-versions');
+var fullChromiumVersions = require('./full-chromium-versions');
+
+var electronToChromium = function (query) {
+  var number = getQueryString(query);
+  return number.split('.').length > 2 ? fullVersions[number] : versions[number] || undefined;
+};
+
+var chromiumToElectron = function (query) {
+  var number = getQueryString(query);
+  return number.split('.').length > 2 ? fullChromiumVersions[number] : chromiumVersions[number] || undefined;
+};
+
+var electronToBrowserList = function (query) {
+  var number = getQueryString(query);
+  return versions[number] ? "Chrome >= " + versions[number] : undefined;
+};
+
+var getQueryString = function (query) {
+  var number = query;
+  if (query === 1) { number = "1.0" }
+  if (typeof query === 'number') { number += ''; }
+  return number;
+};
+
+module.exports = {
+  versions: versions,
+  fullVersions: fullVersions,
+  chromiumVersions: chromiumVersions,
+  fullChromiumVersions: fullChromiumVersions,
+  electronToChromium: electronToChromium,
+  electronToBrowserList: electronToBrowserList,
+  chromiumToElectron: chromiumToElectron
+};
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/package.json b/node_modules/mathjs/examples/node_modules/electron-to-chromium/package.json
new file mode 100644
index 0000000..2640d64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/package.json
@@ -0,0 +1,42 @@
+{
+  "name": "electron-to-chromium",
+  "version": "1.4.96",
+  "description": "Provides a list of electron-to-chromium version mappings",
+  "main": "index.js",
+  "files": [
+    "versions.js",
+    "full-versions.js",
+    "chromium-versions.js",
+    "full-chromium-versions.js",
+    "versions.json",
+    "full-versions.json",
+    "chromium-versions.json",
+    "full-chromium-versions.json",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "node build.js",
+    "update": "node automated-update.js",
+    "test": "nyc ava --verbose",
+    "report": "nyc report --reporter=text-lcov > coverage.lcov && codecov"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/kilian/electron-to-chromium/"
+  },
+  "keywords": [
+    "electron",
+    "chrome",
+    "browserlist"
+  ],
+  "author": "Kilian Valkhof",
+  "license": "ISC",
+  "devDependencies": {
+    "ava": "^4.0.1",
+    "codecov": "^3.8.0",
+    "electron-releases": "^3.974.0",
+    "nyc": "^15.1.0",
+    "request": "^2.65.0",
+    "shelljs": "^0.8.4"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/versions.js b/node_modules/mathjs/examples/node_modules/electron-to-chromium/versions.js
new file mode 100644
index 0000000..d891c94
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/versions.js
@@ -0,0 +1,89 @@
+module.exports = {
+	"0.20": "39",
+	"0.21": "41",
+	"0.22": "41",
+	"0.23": "41",
+	"0.24": "41",
+	"0.25": "42",
+	"0.26": "42",
+	"0.27": "43",
+	"0.28": "43",
+	"0.29": "43",
+	"0.30": "44",
+	"0.31": "45",
+	"0.32": "45",
+	"0.33": "45",
+	"0.34": "45",
+	"0.35": "45",
+	"0.36": "47",
+	"0.37": "49",
+	"1.0": "49",
+	"1.1": "50",
+	"1.2": "51",
+	"1.3": "52",
+	"1.4": "53",
+	"1.5": "54",
+	"1.6": "56",
+	"1.7": "58",
+	"1.8": "59",
+	"2.0": "61",
+	"2.1": "61",
+	"3.0": "66",
+	"3.1": "66",
+	"4.0": "69",
+	"4.1": "69",
+	"4.2": "69",
+	"5.0": "73",
+	"6.0": "76",
+	"6.1": "76",
+	"7.0": "78",
+	"7.1": "78",
+	"7.2": "78",
+	"7.3": "78",
+	"8.0": "80",
+	"8.1": "80",
+	"8.2": "80",
+	"8.3": "80",
+	"8.4": "80",
+	"8.5": "80",
+	"9.0": "83",
+	"9.1": "83",
+	"9.2": "83",
+	"9.3": "83",
+	"9.4": "83",
+	"10.0": "85",
+	"10.1": "85",
+	"10.2": "85",
+	"10.3": "85",
+	"10.4": "85",
+	"11.0": "87",
+	"11.1": "87",
+	"11.2": "87",
+	"11.3": "87",
+	"11.4": "87",
+	"11.5": "87",
+	"12.0": "89",
+	"12.1": "89",
+	"12.2": "89",
+	"13.0": "91",
+	"13.1": "91",
+	"13.2": "91",
+	"13.3": "91",
+	"13.4": "91",
+	"13.5": "91",
+	"13.6": "91",
+	"14.0": "93",
+	"14.1": "93",
+	"14.2": "93",
+	"15.0": "94",
+	"15.1": "94",
+	"15.2": "94",
+	"15.3": "94",
+	"15.4": "94",
+	"16.0": "96",
+	"16.1": "96",
+	"17.0": "98",
+	"17.1": "98",
+	"17.2": "98",
+	"18.0": "100"
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/electron-to-chromium/versions.json b/node_modules/mathjs/examples/node_modules/electron-to-chromium/versions.json
new file mode 100644
index 0000000..dc7a48c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/electron-to-chromium/versions.json
@@ -0,0 +1 @@
+{"0.20":"39","0.21":"41","0.22":"41","0.23":"41","0.24":"41","0.25":"42","0.26":"42","0.27":"43","0.28":"43","0.29":"43","0.30":"44","0.31":"45","0.32":"45","0.33":"45","0.34":"45","0.35":"45","0.36":"47","0.37":"49","1.0":"49","1.1":"50","1.2":"51","1.3":"52","1.4":"53","1.5":"54","1.6":"56","1.7":"58","1.8":"59","2.0":"61","2.1":"61","3.0":"66","3.1":"66","4.0":"69","4.1":"69","4.2":"69","5.0":"73","6.0":"76","6.1":"76","7.0":"78","7.1":"78","7.2":"78","7.3":"78","8.0":"80","8.1":"80","8.2":"80","8.3":"80","8.4":"80","8.5":"80","9.0":"83","9.1":"83","9.2":"83","9.3":"83","9.4":"83","10.0":"85","10.1":"85","10.2":"85","10.3":"85","10.4":"85","11.0":"87","11.1":"87","11.2":"87","11.3":"87","11.4":"87","11.5":"87","12.0":"89","12.1":"89","12.2":"89","13.0":"91","13.1":"91","13.2":"91","13.3":"91","13.4":"91","13.5":"91","13.6":"91","14.0":"93","14.1":"93","14.2":"93","15.0":"94","15.1":"94","15.2":"94","15.3":"94","15.4":"94","16.0":"96","16.1":"96","17.0":"98","17.1":"98","17.2":"98","18.0":"100"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/LICENSE b/node_modules/mathjs/examples/node_modules/enhanced-resolve/LICENSE
new file mode 100644
index 0000000..8c11fc7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/LICENSE
@@ -0,0 +1,20 @@
+Copyright JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/README.md b/node_modules/mathjs/examples/node_modules/enhanced-resolve/README.md
new file mode 100644
index 0000000..ad512e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/README.md
@@ -0,0 +1,167 @@
+# enhanced-resolve
+
+Offers an async require.resolve function. It's highly configurable.
+
+## Features
+
+- plugin system
+- provide a custom filesystem
+- sync and async node.js filesystems included
+
+## Getting Started
+
+### Install
+
+```sh
+# npm
+npm install enhanced-resolve
+# or Yarn
+yarn add enhanced-resolve
+```
+
+### Resolve
+
+There is a Node.js API which allows to resolve requests according to the Node.js resolving rules.
+Sync and async APIs are offered. A `create` method allows to create a custom resolve function.
+
+```js
+const resolve = require("enhanced-resolve");
+
+resolve("/some/path/to/folder", "module/dir", (err, result) => {
+	result; // === "/some/path/node_modules/module/dir/index.js"
+});
+
+resolve.sync("/some/path/to/folder", "../../dir");
+// === "/some/path/dir/index.js"
+
+const myResolve = resolve.create({
+	// or resolve.create.sync
+	extensions: [".ts", ".js"]
+	// see more options below
+});
+
+myResolve("/some/path/to/folder", "ts-module", (err, result) => {
+	result; // === "/some/node_modules/ts-module/index.ts"
+});
+```
+
+### Creating a Resolver
+
+The easiest way to create a resolver is to use the `createResolver` function on `ResolveFactory`, along with one of the supplied File System implementations.
+
+```js
+const fs = require("fs");
+const { CachedInputFileSystem, ResolverFactory } = require("enhanced-resolve");
+
+// create a resolver
+const myResolver = ResolverFactory.createResolver({
+	// Typical usage will consume the `fs` + `CachedInputFileSystem`, which wraps Node.js `fs` to add caching.
+	fileSystem: new CachedInputFileSystem(fs, 4000),
+	extensions: [".js", ".json"]
+	/* any other resolver options here. Options/defaults can be seen below */
+});
+
+// resolve a file with the new resolver
+const context = {};
+const resolveContext = {};
+const lookupStartPath = "/Users/webpack/some/root/dir";
+const request = "./path/to-look-up.js";
+myResolver.resolve({}, lookupStartPath, request, resolveContext, (
+	err /*Error*/,
+	filepath /*string*/
+) => {
+	// Do something with the path
+});
+```
+
+#### Resolver Options
+
+| Field            | Default                     | Description                                                                                                                                               |
+| ---------------- | --------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| alias            | []                          | A list of module alias configurations or an object which maps key to value                                                                                |
+| aliasFields      | []                          | A list of alias fields in description files                                                                                                               |
+| cachePredicate   | function() { return true }; | A function which decides whether a request should be cached or not. An object is passed to the function with `path` and `request` properties.             |
+| cacheWithContext | true                        | If unsafe cache is enabled, includes `request.context` in the cache key                                                                                   |
+| conditionNames   | ["node"]                    | A list of exports field condition names                                                                                                                   |
+| descriptionFiles | ["package.json"]            | A list of description files to read from                                                                                                                  |
+| enforceExtension | false                       | Enforce that a extension from extensions must be used                                                                                                     |
+| exportsFields    | ["exports"]                 | A list of exports fields in description files                                                                                                             |
+| extensions       | [".js", ".json", ".node"]   | A list of extensions which should be tried for files                                                                                                      |
+| fallback         | []                          | Same as `alias`, but only used if default resolving fails                                                                                                |                                                                                                                                                                                         
+| fileSystem       |                             | The file system which should be used                                                                                                                      |
+| fullySpecified   | false                       | Request passed to resolve is already fully specified and extensions or main files are not resolved for it (they are still resolved for internal requests) |
+| mainFields       | ["main"]                    | A list of main fields in description files                                                                                                                |
+| mainFiles        | ["index"]                   | A list of main files in directories                                                                                                                       |
+| modules          | ["node_modules"]            | A list of directories to resolve modules from, can be absolute path or folder name                                                                        |
+| plugins          | []                          | A list of additional resolve plugins which should be applied                                                                                              |
+| resolver         | undefined                   | A prepared Resolver to which the plugins are attached                                                                                                     |
+| resolveToContext | false                       | Resolve to a context instead of a file                                                                                                                    |
+| preferRelative   | false                       | Prefer to resolve module requests as relative request and fallback to resolving as module                                                                 |
+| preferAbsolute   | false                       | Prefer to resolve server-relative urls as absolute paths before falling back to resolve in roots                                                          |
+| restrictions     | []                          | A list of resolve restrictions                                                                                                                            |
+| roots            | []                          | A list of root paths                                                                                                                                      |
+| symlinks         | true                        | Whether to resolve symlinks to their symlinked location                                                                                                   |
+| unsafeCache      | false                       | Use this cache object to unsafely cache the successful requests                                                                                           |
+
+## Plugins
+
+Similar to `webpack`, the core of `enhanced-resolve` functionality is implemented as individual plugins that are executed using [`tapable`](https://github.com/webpack/tapable).
+These plugins can extend the functionality of the library, adding other ways for files/contexts to be resolved.
+
+A plugin should be a `class` (or its ES5 equivalent) with an `apply` method. The `apply` method will receive a `resolver` instance, that can be used to hook in to the event system.
+
+### Plugin Boilerplate
+
+```js
+class MyResolverPlugin {
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("MyResolverPlugin", (request, resolveContext, callback) => {
+				// Any logic you need to create a new `request` can go here
+				resolver.doResolve(target, request, null, resolveContext, callback);
+			});
+	}
+}
+```
+
+Plugins are executed in a pipeline, and register which event they should be executed before/after. In the example above, `source` is the name of the event that starts the pipeline, and `target` is what event this plugin should fire, which is what continues the execution of the pipeline. For an example of how these different plugin events create a chain, see `lib/ResolverFactory.js`, in the `//// pipeline ////` section.
+
+## Escaping
+
+It's allowed to escape `#` as `\0#` to avoid parsing it as fragment.
+
+enhanced-resolve will try to resolve requests containing `#` as path and as fragment, so it will automatically figure out if `./some#thing` means `.../some.js#thing` or `.../some#thing.js`. When a `#` is resolved as path it will be escaped in the result. Here: `.../some\0#thing.js`.
+
+## Tests
+
+```javascript
+npm test
+```
+
+[![Build Status](https://secure.travis-ci.org/webpack/enhanced-resolve.png?branch=main)](http://travis-ci.org/webpack/enhanced-resolve)
+
+## Passing options from webpack
+
+If you are using `webpack`, and you want to pass custom options to `enhanced-resolve`, the options are passed from the `resolve` key of your webpack configuration e.g.:
+
+```
+resolve: {
+  extensions: ['.js', '.jsx'],
+  modules: [path.resolve(__dirname, 'src'), 'node_modules'],
+  plugins: [new DirectoryNamedWebpackPlugin()]
+  ...
+},
+```
+
+## License
+
+Copyright (c) 2012-2019 JS Foundation and other contributors
+
+MIT (http://www.opensource.org/licenses/mit-license.php)
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AliasFieldPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AliasFieldPlugin.js
new file mode 100644
index 0000000..4699431
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AliasFieldPlugin.js
@@ -0,0 +1,96 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DescriptionFileUtils = require("./DescriptionFileUtils");
+const getInnerRequest = require("./getInnerRequest");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveRequest} ResolveRequest */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class AliasFieldPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | Array<string>} field field
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, field, target) {
+		this.source = source;
+		this.field = field;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("AliasFieldPlugin", (request, resolveContext, callback) => {
+				if (!request.descriptionFileData) return callback();
+				const innerRequest = getInnerRequest(resolver, request);
+				if (!innerRequest) return callback();
+				const fieldData = DescriptionFileUtils.getField(
+					request.descriptionFileData,
+					this.field
+				);
+				if (fieldData === null || typeof fieldData !== "object") {
+					if (resolveContext.log)
+						resolveContext.log(
+							"Field '" +
+								this.field +
+								"' doesn't contain a valid alias configuration"
+						);
+					return callback();
+				}
+				const data1 = fieldData[innerRequest];
+				const data2 = fieldData[innerRequest.replace(/^\.\//, "")];
+				const data = typeof data1 !== "undefined" ? data1 : data2;
+				if (data === innerRequest) return callback();
+				if (data === undefined) return callback();
+				if (data === false) {
+					/** @type {ResolveRequest} */
+					const ignoreObj = {
+						...request,
+						path: false
+					};
+					if (typeof resolveContext.yield === "function") {
+						resolveContext.yield(ignoreObj);
+						return callback(null, null);
+					}
+					return callback(null, ignoreObj);
+				}
+				const obj = {
+					...request,
+					path: request.descriptionFileRoot,
+					request: data,
+					fullySpecified: false
+				};
+				resolver.doResolve(
+					target,
+					obj,
+					"aliased from description file " +
+						request.descriptionFilePath +
+						" with mapping '" +
+						innerRequest +
+						"' to '" +
+						data +
+						"'",
+					resolveContext,
+					(err, result) => {
+						if (err) return callback(err);
+
+						// Don't allow other aliasing or raw request
+						if (result === undefined) return callback(null, null);
+						callback(null, result);
+					}
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AliasPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AliasPlugin.js
new file mode 100644
index 0000000..ee42952
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AliasPlugin.js
@@ -0,0 +1,120 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const forEachBail = require("./forEachBail");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveRequest} ResolveRequest */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+/** @typedef {{alias: string|Array<string>|false, name: string, onlyModule?: boolean}} AliasOption */
+
+module.exports = class AliasPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {AliasOption | Array<AliasOption>} options options
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, options, target) {
+		this.source = source;
+		this.options = Array.isArray(options) ? options : [options];
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("AliasPlugin", (request, resolveContext, callback) => {
+				const innerRequest = request.request || request.path;
+				if (!innerRequest) return callback();
+				forEachBail(
+					this.options,
+					(item, callback) => {
+						let shouldStop = false;
+						if (
+							innerRequest === item.name ||
+							(!item.onlyModule &&
+								innerRequest.startsWith(
+									request.request
+										? `${item.name}/`
+										: resolver.join(item.name, "_").slice(0, -1)
+								))
+						) {
+							const remainingRequest = innerRequest.substr(item.name.length);
+							const resolveWithAlias = (alias, callback) => {
+								if (alias === false) {
+									/** @type {ResolveRequest} */
+									const ignoreObj = {
+										...request,
+										path: false
+									};
+									if (typeof resolveContext.yield === "function") {
+										resolveContext.yield(ignoreObj);
+										return callback(null, null);
+									}
+									return callback(null, ignoreObj);
+								}
+								if (
+									innerRequest !== alias &&
+									!innerRequest.startsWith(alias + "/")
+								) {
+									shouldStop = true;
+									const newRequestStr = alias + remainingRequest;
+									const obj = {
+										...request,
+										request: newRequestStr,
+										fullySpecified: false
+									};
+									return resolver.doResolve(
+										target,
+										obj,
+										"aliased with mapping '" +
+											item.name +
+											"': '" +
+											alias +
+											"' to '" +
+											newRequestStr +
+											"'",
+										resolveContext,
+										(err, result) => {
+											if (err) return callback(err);
+											if (result) return callback(null, result);
+											return callback();
+										}
+									);
+								}
+								return callback();
+							};
+							const stoppingCallback = (err, result) => {
+								if (err) return callback(err);
+
+								if (result) return callback(null, result);
+								// Don't allow other aliasing or raw request
+								if (shouldStop) return callback(null, null);
+								return callback();
+							};
+							if (Array.isArray(item.alias)) {
+								return forEachBail(
+									item.alias,
+									resolveWithAlias,
+									stoppingCallback
+								);
+							} else {
+								return resolveWithAlias(item.alias, stoppingCallback);
+							}
+						}
+						return callback();
+					},
+					callback
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AppendPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AppendPlugin.js
new file mode 100644
index 0000000..2ab01e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/AppendPlugin.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class AppendPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string} appending appending
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, appending, target) {
+		this.source = source;
+		this.appending = appending;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("AppendPlugin", (request, resolveContext, callback) => {
+				const obj = {
+					...request,
+					path: request.path + this.appending,
+					relativePath:
+						request.relativePath && request.relativePath + this.appending
+				};
+				resolver.doResolve(
+					target,
+					obj,
+					this.appending,
+					resolveContext,
+					callback
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/CachedInputFileSystem.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/CachedInputFileSystem.js
new file mode 100644
index 0000000..74dbd98
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/CachedInputFileSystem.js
@@ -0,0 +1,477 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const nextTick = require("process").nextTick;
+
+/** @typedef {import("./Resolver").FileSystem} FileSystem */
+/** @typedef {import("./Resolver").SyncFileSystem} SyncFileSystem */
+
+const dirname = path => {
+	let idx = path.length - 1;
+	while (idx >= 0) {
+		const c = path.charCodeAt(idx);
+		// slash or backslash
+		if (c === 47 || c === 92) break;
+		idx--;
+	}
+	if (idx < 0) return "";
+	return path.slice(0, idx);
+};
+
+const runCallbacks = (callbacks, err, result) => {
+	if (callbacks.length === 1) {
+		callbacks[0](err, result);
+		callbacks.length = 0;
+		return;
+	}
+	let error;
+	for (const callback of callbacks) {
+		try {
+			callback(err, result);
+		} catch (e) {
+			if (!error) error = e;
+		}
+	}
+	callbacks.length = 0;
+	if (error) throw error;
+};
+
+class OperationMergerBackend {
+	/**
+	 * @param {any} provider async method
+	 * @param {any} syncProvider sync method
+	 * @param {any} providerContext call context for the provider methods
+	 */
+	constructor(provider, syncProvider, providerContext) {
+		this._provider = provider;
+		this._syncProvider = syncProvider;
+		this._providerContext = providerContext;
+		this._activeAsyncOperations = new Map();
+
+		this.provide = this._provider
+			? (path, options, callback) => {
+					if (typeof options === "function") {
+						callback = options;
+						options = undefined;
+					}
+					if (options) {
+						return this._provider.call(
+							this._providerContext,
+							path,
+							options,
+							callback
+						);
+					}
+					if (typeof path !== "string") {
+						callback(new TypeError("path must be a string"));
+						return;
+					}
+					let callbacks = this._activeAsyncOperations.get(path);
+					if (callbacks) {
+						callbacks.push(callback);
+						return;
+					}
+					this._activeAsyncOperations.set(path, (callbacks = [callback]));
+					provider(path, (err, result) => {
+						this._activeAsyncOperations.delete(path);
+						runCallbacks(callbacks, err, result);
+					});
+			  }
+			: null;
+		this.provideSync = this._syncProvider
+			? (path, options) => {
+					return this._syncProvider.call(this._providerContext, path, options);
+			  }
+			: null;
+	}
+
+	purge() {}
+	purgeParent() {}
+}
+
+/*
+
+IDLE:
+	insert data: goto SYNC
+
+SYNC:
+	before provide: run ticks
+	event loop tick: goto ASYNC_ACTIVE
+
+ASYNC:
+	timeout: run tick, goto ASYNC_PASSIVE
+
+ASYNC_PASSIVE:
+	before provide: run ticks
+
+IDLE --[insert data]--> SYNC --[event loop tick]--> ASYNC_ACTIVE --[interval tick]-> ASYNC_PASSIVE
+                                                          ^                             |
+                                                          +---------[insert data]-------+
+*/
+
+const STORAGE_MODE_IDLE = 0;
+const STORAGE_MODE_SYNC = 1;
+const STORAGE_MODE_ASYNC = 2;
+
+class CacheBackend {
+	/**
+	 * @param {number} duration max cache duration of items
+	 * @param {any} provider async method
+	 * @param {any} syncProvider sync method
+	 * @param {any} providerContext call context for the provider methods
+	 */
+	constructor(duration, provider, syncProvider, providerContext) {
+		this._duration = duration;
+		this._provider = provider;
+		this._syncProvider = syncProvider;
+		this._providerContext = providerContext;
+		/** @type {Map<string, (function(Error, any): void)[]>} */
+		this._activeAsyncOperations = new Map();
+		/** @type {Map<string, { err: Error, result: any, level: Set<string> }>} */
+		this._data = new Map();
+		/** @type {Set<string>[]} */
+		this._levels = [];
+		for (let i = 0; i < 10; i++) this._levels.push(new Set());
+		for (let i = 5000; i < duration; i += 500) this._levels.push(new Set());
+		this._currentLevel = 0;
+		this._tickInterval = Math.floor(duration / this._levels.length);
+		/** @type {STORAGE_MODE_IDLE | STORAGE_MODE_SYNC | STORAGE_MODE_ASYNC} */
+		this._mode = STORAGE_MODE_IDLE;
+
+		/** @type {NodeJS.Timeout | undefined} */
+		this._timeout = undefined;
+		/** @type {number | undefined} */
+		this._nextDecay = undefined;
+
+		this.provide = provider ? this.provide.bind(this) : null;
+		this.provideSync = syncProvider ? this.provideSync.bind(this) : null;
+	}
+
+	provide(path, options, callback) {
+		if (typeof options === "function") {
+			callback = options;
+			options = undefined;
+		}
+		if (typeof path !== "string") {
+			callback(new TypeError("path must be a string"));
+			return;
+		}
+		if (options) {
+			return this._provider.call(
+				this._providerContext,
+				path,
+				options,
+				callback
+			);
+		}
+
+		// When in sync mode we can move to async mode
+		if (this._mode === STORAGE_MODE_SYNC) {
+			this._enterAsyncMode();
+		}
+
+		// Check in cache
+		let cacheEntry = this._data.get(path);
+		if (cacheEntry !== undefined) {
+			if (cacheEntry.err) return nextTick(callback, cacheEntry.err);
+			return nextTick(callback, null, cacheEntry.result);
+		}
+
+		// Check if there is already the same operation running
+		let callbacks = this._activeAsyncOperations.get(path);
+		if (callbacks !== undefined) {
+			callbacks.push(callback);
+			return;
+		}
+		this._activeAsyncOperations.set(path, (callbacks = [callback]));
+
+		// Run the operation
+		this._provider.call(this._providerContext, path, (err, result) => {
+			this._activeAsyncOperations.delete(path);
+			this._storeResult(path, err, result);
+
+			// Enter async mode if not yet done
+			this._enterAsyncMode();
+
+			runCallbacks(callbacks, err, result);
+		});
+	}
+
+	provideSync(path, options) {
+		if (typeof path !== "string") {
+			throw new TypeError("path must be a string");
+		}
+		if (options) {
+			return this._syncProvider.call(this._providerContext, path, options);
+		}
+
+		// In sync mode we may have to decay some cache items
+		if (this._mode === STORAGE_MODE_SYNC) {
+			this._runDecays();
+		}
+
+		// Check in cache
+		let cacheEntry = this._data.get(path);
+		if (cacheEntry !== undefined) {
+			if (cacheEntry.err) throw cacheEntry.err;
+			return cacheEntry.result;
+		}
+
+		// Get all active async operations
+		// This sync operation will also complete them
+		const callbacks = this._activeAsyncOperations.get(path);
+		this._activeAsyncOperations.delete(path);
+
+		// Run the operation
+		// When in idle mode, we will enter sync mode
+		let result;
+		try {
+			result = this._syncProvider.call(this._providerContext, path);
+		} catch (err) {
+			this._storeResult(path, err, undefined);
+			this._enterSyncModeWhenIdle();
+			if (callbacks) runCallbacks(callbacks, err, undefined);
+			throw err;
+		}
+		this._storeResult(path, undefined, result);
+		this._enterSyncModeWhenIdle();
+		if (callbacks) runCallbacks(callbacks, undefined, result);
+		return result;
+	}
+
+	purge(what) {
+		if (!what) {
+			if (this._mode !== STORAGE_MODE_IDLE) {
+				this._data.clear();
+				for (const level of this._levels) {
+					level.clear();
+				}
+				this._enterIdleMode();
+			}
+		} else if (typeof what === "string") {
+			for (let [key, data] of this._data) {
+				if (key.startsWith(what)) {
+					this._data.delete(key);
+					data.level.delete(key);
+				}
+			}
+			if (this._data.size === 0) {
+				this._enterIdleMode();
+			}
+		} else {
+			for (let [key, data] of this._data) {
+				for (const item of what) {
+					if (key.startsWith(item)) {
+						this._data.delete(key);
+						data.level.delete(key);
+						break;
+					}
+				}
+			}
+			if (this._data.size === 0) {
+				this._enterIdleMode();
+			}
+		}
+	}
+
+	purgeParent(what) {
+		if (!what) {
+			this.purge();
+		} else if (typeof what === "string") {
+			this.purge(dirname(what));
+		} else {
+			const set = new Set();
+			for (const item of what) {
+				set.add(dirname(item));
+			}
+			this.purge(set);
+		}
+	}
+
+	_storeResult(path, err, result) {
+		if (this._data.has(path)) return;
+		const level = this._levels[this._currentLevel];
+		this._data.set(path, { err, result, level });
+		level.add(path);
+	}
+
+	_decayLevel() {
+		const nextLevel = (this._currentLevel + 1) % this._levels.length;
+		const decay = this._levels[nextLevel];
+		this._currentLevel = nextLevel;
+		for (let item of decay) {
+			this._data.delete(item);
+		}
+		decay.clear();
+		if (this._data.size === 0) {
+			this._enterIdleMode();
+		} else {
+			// @ts-ignore _nextDecay is always a number in sync mode
+			this._nextDecay += this._tickInterval;
+		}
+	}
+
+	_runDecays() {
+		while (
+			/** @type {number} */ (this._nextDecay) <= Date.now() &&
+			this._mode !== STORAGE_MODE_IDLE
+		) {
+			this._decayLevel();
+		}
+	}
+
+	_enterAsyncMode() {
+		let timeout = 0;
+		switch (this._mode) {
+			case STORAGE_MODE_ASYNC:
+				return;
+			case STORAGE_MODE_IDLE:
+				this._nextDecay = Date.now() + this._tickInterval;
+				timeout = this._tickInterval;
+				break;
+			case STORAGE_MODE_SYNC:
+				this._runDecays();
+				// @ts-ignore _runDecays may change the mode
+				if (this._mode === STORAGE_MODE_IDLE) return;
+				timeout = Math.max(
+					0,
+					/** @type {number} */ (this._nextDecay) - Date.now()
+				);
+				break;
+		}
+		this._mode = STORAGE_MODE_ASYNC;
+		const ref = setTimeout(() => {
+			this._mode = STORAGE_MODE_SYNC;
+			this._runDecays();
+		}, timeout);
+		if (ref.unref) ref.unref();
+		this._timeout = ref;
+	}
+
+	_enterSyncModeWhenIdle() {
+		if (this._mode === STORAGE_MODE_IDLE) {
+			this._mode = STORAGE_MODE_SYNC;
+			this._nextDecay = Date.now() + this._tickInterval;
+		}
+	}
+
+	_enterIdleMode() {
+		this._mode = STORAGE_MODE_IDLE;
+		this._nextDecay = undefined;
+		if (this._timeout) clearTimeout(this._timeout);
+	}
+}
+
+const createBackend = (duration, provider, syncProvider, providerContext) => {
+	if (duration > 0) {
+		return new CacheBackend(duration, provider, syncProvider, providerContext);
+	}
+	return new OperationMergerBackend(provider, syncProvider, providerContext);
+};
+
+module.exports = class CachedInputFileSystem {
+	constructor(fileSystem, duration) {
+		this.fileSystem = fileSystem;
+
+		this._lstatBackend = createBackend(
+			duration,
+			this.fileSystem.lstat,
+			this.fileSystem.lstatSync,
+			this.fileSystem
+		);
+		const lstat = this._lstatBackend.provide;
+		this.lstat = /** @type {FileSystem["lstat"]} */ (lstat);
+		const lstatSync = this._lstatBackend.provideSync;
+		this.lstatSync = /** @type {SyncFileSystem["lstatSync"]} */ (lstatSync);
+
+		this._statBackend = createBackend(
+			duration,
+			this.fileSystem.stat,
+			this.fileSystem.statSync,
+			this.fileSystem
+		);
+		const stat = this._statBackend.provide;
+		this.stat = /** @type {FileSystem["stat"]} */ (stat);
+		const statSync = this._statBackend.provideSync;
+		this.statSync = /** @type {SyncFileSystem["statSync"]} */ (statSync);
+
+		this._readdirBackend = createBackend(
+			duration,
+			this.fileSystem.readdir,
+			this.fileSystem.readdirSync,
+			this.fileSystem
+		);
+		const readdir = this._readdirBackend.provide;
+		this.readdir = /** @type {FileSystem["readdir"]} */ (readdir);
+		const readdirSync = this._readdirBackend.provideSync;
+		this.readdirSync = /** @type {SyncFileSystem["readdirSync"]} */ (readdirSync);
+
+		this._readFileBackend = createBackend(
+			duration,
+			this.fileSystem.readFile,
+			this.fileSystem.readFileSync,
+			this.fileSystem
+		);
+		const readFile = this._readFileBackend.provide;
+		this.readFile = /** @type {FileSystem["readFile"]} */ (readFile);
+		const readFileSync = this._readFileBackend.provideSync;
+		this.readFileSync = /** @type {SyncFileSystem["readFileSync"]} */ (readFileSync);
+
+		this._readJsonBackend = createBackend(
+			duration,
+			this.fileSystem.readJson ||
+				(this.readFile &&
+					((path, callback) => {
+						// @ts-ignore
+						this.readFile(path, (err, buffer) => {
+							if (err) return callback(err);
+							if (!buffer || buffer.length === 0)
+								return callback(new Error("No file content"));
+							let data;
+							try {
+								data = JSON.parse(buffer.toString("utf-8"));
+							} catch (e) {
+								return callback(e);
+							}
+							callback(null, data);
+						});
+					})),
+			this.fileSystem.readJsonSync ||
+				(this.readFileSync &&
+					(path => {
+						const buffer = this.readFileSync(path);
+						const data = JSON.parse(buffer.toString("utf-8"));
+						return data;
+					})),
+			this.fileSystem
+		);
+		const readJson = this._readJsonBackend.provide;
+		this.readJson = /** @type {FileSystem["readJson"]} */ (readJson);
+		const readJsonSync = this._readJsonBackend.provideSync;
+		this.readJsonSync = /** @type {SyncFileSystem["readJsonSync"]} */ (readJsonSync);
+
+		this._readlinkBackend = createBackend(
+			duration,
+			this.fileSystem.readlink,
+			this.fileSystem.readlinkSync,
+			this.fileSystem
+		);
+		const readlink = this._readlinkBackend.provide;
+		this.readlink = /** @type {FileSystem["readlink"]} */ (readlink);
+		const readlinkSync = this._readlinkBackend.provideSync;
+		this.readlinkSync = /** @type {SyncFileSystem["readlinkSync"]} */ (readlinkSync);
+	}
+
+	purge(what) {
+		this._statBackend.purge(what);
+		this._lstatBackend.purge(what);
+		this._readdirBackend.purgeParent(what);
+		this._readFileBackend.purge(what);
+		this._readlinkBackend.purge(what);
+		this._readJsonBackend.purge(what);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/CloneBasenamePlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/CloneBasenamePlugin.js
new file mode 100644
index 0000000..48b2cd3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/CloneBasenamePlugin.js
@@ -0,0 +1,45 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const basename = require("./getPaths").basename;
+
+/** @typedef {import("./Resolver")} Resolver */
+
+module.exports = class CloneBasenamePlugin {
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("CloneBasenamePlugin", (request, resolveContext, callback) => {
+				const filename = basename(request.path);
+				const filePath = resolver.join(request.path, filename);
+				const obj = {
+					...request,
+					path: filePath,
+					relativePath:
+						request.relativePath &&
+						resolver.join(request.relativePath, filename)
+				};
+				resolver.doResolve(
+					target,
+					obj,
+					"using path: " + filePath,
+					resolveContext,
+					callback
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ConditionalPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ConditionalPlugin.js
new file mode 100644
index 0000000..ebcec62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ConditionalPlugin.js
@@ -0,0 +1,59 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveRequest} ResolveRequest */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class ConditionalPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {Partial<ResolveRequest>} test compare object
+	 * @param {string | null} message log message
+	 * @param {boolean} allowAlternatives when false, do not continue with the current step when "test" matches
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, test, message, allowAlternatives, target) {
+		this.source = source;
+		this.test = test;
+		this.message = message;
+		this.allowAlternatives = allowAlternatives;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		const { test, message, allowAlternatives } = this;
+		const keys = Object.keys(test);
+		resolver
+			.getHook(this.source)
+			.tapAsync("ConditionalPlugin", (request, resolveContext, callback) => {
+				for (const prop of keys) {
+					if (request[prop] !== test[prop]) return callback();
+				}
+				resolver.doResolve(
+					target,
+					request,
+					message,
+					resolveContext,
+					allowAlternatives
+						? callback
+						: (err, result) => {
+								if (err) return callback(err);
+
+								// Don't allow other alternatives
+								if (result === undefined) return callback(null, null);
+								callback(null, result);
+						  }
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DescriptionFilePlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DescriptionFilePlugin.js
new file mode 100644
index 0000000..83c0e08
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DescriptionFilePlugin.js
@@ -0,0 +1,96 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DescriptionFileUtils = require("./DescriptionFileUtils");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class DescriptionFilePlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string[]} filenames filenames
+	 * @param {boolean} pathIsFile pathIsFile
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, filenames, pathIsFile, target) {
+		this.source = source;
+		this.filenames = filenames;
+		this.pathIsFile = pathIsFile;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync(
+				"DescriptionFilePlugin",
+				(request, resolveContext, callback) => {
+					const path = request.path;
+					if (!path) return callback();
+					const directory = this.pathIsFile
+						? DescriptionFileUtils.cdUp(path)
+						: path;
+					if (!directory) return callback();
+					DescriptionFileUtils.loadDescriptionFile(
+						resolver,
+						directory,
+						this.filenames,
+						request.descriptionFilePath
+							? {
+									path: request.descriptionFilePath,
+									content: request.descriptionFileData,
+									directory: /** @type {string} */ (request.descriptionFileRoot)
+							  }
+							: undefined,
+						resolveContext,
+						(err, result) => {
+							if (err) return callback(err);
+							if (!result) {
+								if (resolveContext.log)
+									resolveContext.log(
+										`No description file found in ${directory} or above`
+									);
+								return callback();
+							}
+							const relativePath =
+								"." + path.substr(result.directory.length).replace(/\\/g, "/");
+							const obj = {
+								...request,
+								descriptionFilePath: result.path,
+								descriptionFileData: result.content,
+								descriptionFileRoot: result.directory,
+								relativePath: relativePath
+							};
+							resolver.doResolve(
+								target,
+								obj,
+								"using description file: " +
+									result.path +
+									" (relative path: " +
+									relativePath +
+									")",
+								resolveContext,
+								(err, result) => {
+									if (err) return callback(err);
+
+									// Don't allow other processing
+									if (result === undefined) return callback(null, null);
+									callback(null, result);
+								}
+							);
+						}
+					);
+				}
+			);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DescriptionFileUtils.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DescriptionFileUtils.js
new file mode 100644
index 0000000..87e5f79
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DescriptionFileUtils.js
@@ -0,0 +1,170 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const forEachBail = require("./forEachBail");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveContext} ResolveContext */
+
+/**
+ * @typedef {Object} DescriptionFileInfo
+ * @property {any=} content
+ * @property {string} path
+ * @property {string} directory
+ */
+
+/**
+ * @callback ErrorFirstCallback
+ * @param {Error|null=} error
+ * @param {DescriptionFileInfo=} result
+ */
+
+/**
+ * @param {Resolver} resolver resolver
+ * @param {string} directory directory
+ * @param {string[]} filenames filenames
+ * @param {DescriptionFileInfo|undefined} oldInfo oldInfo
+ * @param {ResolveContext} resolveContext resolveContext
+ * @param {ErrorFirstCallback} callback callback
+ */
+function loadDescriptionFile(
+	resolver,
+	directory,
+	filenames,
+	oldInfo,
+	resolveContext,
+	callback
+) {
+	(function findDescriptionFile() {
+		if (oldInfo && oldInfo.directory === directory) {
+			// We already have info for this directory and can reuse it
+			return callback(null, oldInfo);
+		}
+		forEachBail(
+			filenames,
+			(filename, callback) => {
+				const descriptionFilePath = resolver.join(directory, filename);
+				if (resolver.fileSystem.readJson) {
+					resolver.fileSystem.readJson(descriptionFilePath, (err, content) => {
+						if (err) {
+							if (typeof err.code !== "undefined") {
+								if (resolveContext.missingDependencies) {
+									resolveContext.missingDependencies.add(descriptionFilePath);
+								}
+								return callback();
+							}
+							if (resolveContext.fileDependencies) {
+								resolveContext.fileDependencies.add(descriptionFilePath);
+							}
+							return onJson(err);
+						}
+						if (resolveContext.fileDependencies) {
+							resolveContext.fileDependencies.add(descriptionFilePath);
+						}
+						onJson(null, content);
+					});
+				} else {
+					resolver.fileSystem.readFile(descriptionFilePath, (err, content) => {
+						if (err) {
+							if (resolveContext.missingDependencies) {
+								resolveContext.missingDependencies.add(descriptionFilePath);
+							}
+							return callback();
+						}
+						if (resolveContext.fileDependencies) {
+							resolveContext.fileDependencies.add(descriptionFilePath);
+						}
+						let json;
+
+						if (content) {
+							try {
+								json = JSON.parse(content.toString());
+							} catch (e) {
+								return onJson(e);
+							}
+						} else {
+							return onJson(new Error("No content in file"));
+						}
+
+						onJson(null, json);
+					});
+				}
+
+				function onJson(err, content) {
+					if (err) {
+						if (resolveContext.log)
+							resolveContext.log(
+								descriptionFilePath + " (directory description file): " + err
+							);
+						else
+							err.message =
+								descriptionFilePath + " (directory description file): " + err;
+						return callback(err);
+					}
+					callback(null, {
+						content,
+						directory,
+						path: descriptionFilePath
+					});
+				}
+			},
+			(err, result) => {
+				if (err) return callback(err);
+				if (result) {
+					return callback(null, result);
+				} else {
+					const dir = cdUp(directory);
+					if (!dir) {
+						return callback();
+					} else {
+						directory = dir;
+						return findDescriptionFile();
+					}
+				}
+			}
+		);
+	})();
+}
+
+/**
+ * @param {any} content content
+ * @param {string|string[]} field field
+ * @returns {object|string|number|boolean|undefined} field data
+ */
+function getField(content, field) {
+	if (!content) return undefined;
+	if (Array.isArray(field)) {
+		let current = content;
+		for (let j = 0; j < field.length; j++) {
+			if (current === null || typeof current !== "object") {
+				current = null;
+				break;
+			}
+			current = current[field[j]];
+		}
+		return current;
+	} else {
+		return content[field];
+	}
+}
+
+/**
+ * @param {string} directory directory
+ * @returns {string|null} parent directory or null
+ */
+function cdUp(directory) {
+	if (directory === "/") return null;
+	const i = directory.lastIndexOf("/"),
+		j = directory.lastIndexOf("\\");
+	const p = i < 0 ? j : j < 0 ? i : i < j ? j : i;
+	if (p < 0) return null;
+	return directory.substr(0, p || 1);
+}
+
+exports.loadDescriptionFile = loadDescriptionFile;
+exports.getField = getField;
+exports.cdUp = cdUp;
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DirectoryExistsPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DirectoryExistsPlugin.js
new file mode 100644
index 0000000..80c9409
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/DirectoryExistsPlugin.js
@@ -0,0 +1,63 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class DirectoryExistsPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync(
+				"DirectoryExistsPlugin",
+				(request, resolveContext, callback) => {
+					const fs = resolver.fileSystem;
+					const directory = request.path;
+					if (!directory) return callback();
+					fs.stat(directory, (err, stat) => {
+						if (err || !stat) {
+							if (resolveContext.missingDependencies)
+								resolveContext.missingDependencies.add(directory);
+							if (resolveContext.log)
+								resolveContext.log(directory + " doesn't exist");
+							return callback();
+						}
+						if (!stat.isDirectory()) {
+							if (resolveContext.missingDependencies)
+								resolveContext.missingDependencies.add(directory);
+							if (resolveContext.log)
+								resolveContext.log(directory + " is not a directory");
+							return callback();
+						}
+						if (resolveContext.fileDependencies)
+							resolveContext.fileDependencies.add(directory);
+						resolver.doResolve(
+							target,
+							request,
+							`existing directory ${directory}`,
+							resolveContext,
+							callback
+						);
+					});
+				}
+			);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ExportsFieldPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ExportsFieldPlugin.js
new file mode 100644
index 0000000..2730753
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ExportsFieldPlugin.js
@@ -0,0 +1,149 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const path = require("path");
+const DescriptionFileUtils = require("./DescriptionFileUtils");
+const forEachBail = require("./forEachBail");
+const { processExportsField } = require("./util/entrypoints");
+const { parseIdentifier } = require("./util/identifier");
+const { checkExportsFieldTarget } = require("./util/path");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+/** @typedef {import("./util/entrypoints").ExportsField} ExportsField */
+/** @typedef {import("./util/entrypoints").FieldProcessor} FieldProcessor */
+
+module.exports = class ExportsFieldPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {Set<string>} conditionNames condition names
+	 * @param {string | string[]} fieldNamePath name path
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, conditionNames, fieldNamePath, target) {
+		this.source = source;
+		this.target = target;
+		this.conditionNames = conditionNames;
+		this.fieldName = fieldNamePath;
+		/** @type {WeakMap<any, FieldProcessor>} */
+		this.fieldProcessorCache = new WeakMap();
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("ExportsFieldPlugin", (request, resolveContext, callback) => {
+				// When there is no description file, abort
+				if (!request.descriptionFilePath) return callback();
+				if (
+					// When the description file is inherited from parent, abort
+					// (There is no description file inside of this package)
+					request.relativePath !== "." ||
+					request.request === undefined
+				)
+					return callback();
+
+				const remainingRequest =
+					request.query || request.fragment
+						? (request.request === "." ? "./" : request.request) +
+						  request.query +
+						  request.fragment
+						: request.request;
+				/** @type {ExportsField|null} */
+				const exportsField = DescriptionFileUtils.getField(
+					request.descriptionFileData,
+					this.fieldName
+				);
+				if (!exportsField) return callback();
+
+				if (request.directory) {
+					return callback(
+						new Error(
+							`Resolving to directories is not possible with the exports field (request was ${remainingRequest}/)`
+						)
+					);
+				}
+
+				let paths;
+
+				try {
+					// We attach the cache to the description file instead of the exportsField value
+					// because we use a WeakMap and the exportsField could be a string too.
+					// Description file is always an object when exports field can be accessed.
+					let fieldProcessor = this.fieldProcessorCache.get(
+						request.descriptionFileData
+					);
+					if (fieldProcessor === undefined) {
+						fieldProcessor = processExportsField(exportsField);
+						this.fieldProcessorCache.set(
+							request.descriptionFileData,
+							fieldProcessor
+						);
+					}
+					paths = fieldProcessor(remainingRequest, this.conditionNames);
+				} catch (err) {
+					if (resolveContext.log) {
+						resolveContext.log(
+							`Exports field in ${request.descriptionFilePath} can't be processed: ${err}`
+						);
+					}
+					return callback(err);
+				}
+
+				if (paths.length === 0) {
+					return callback(
+						new Error(
+							`Package path ${remainingRequest} is not exported from package ${request.descriptionFileRoot} (see exports field in ${request.descriptionFilePath})`
+						)
+					);
+				}
+
+				forEachBail(
+					paths,
+					(p, callback) => {
+						const parsedIdentifier = parseIdentifier(p);
+
+						if (!parsedIdentifier) return callback();
+
+						const [relativePath, query, fragment] = parsedIdentifier;
+
+						const error = checkExportsFieldTarget(relativePath);
+
+						if (error) {
+							return callback(error);
+						}
+
+						const obj = {
+							...request,
+							request: undefined,
+							path: path.join(
+								/** @type {string} */ (request.descriptionFileRoot),
+								relativePath
+							),
+							relativePath,
+							query,
+							fragment
+						};
+
+						resolver.doResolve(
+							target,
+							obj,
+							"using exports field: " + p,
+							resolveContext,
+							callback
+						);
+					},
+					(err, result) => callback(err, result || null)
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/FileExistsPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/FileExistsPlugin.js
new file mode 100644
index 0000000..2dd33e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/FileExistsPlugin.js
@@ -0,0 +1,58 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class FileExistsPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		const fs = resolver.fileSystem;
+		resolver
+			.getHook(this.source)
+			.tapAsync("FileExistsPlugin", (request, resolveContext, callback) => {
+				const file = request.path;
+				if (!file) return callback();
+				fs.stat(file, (err, stat) => {
+					if (err || !stat) {
+						if (resolveContext.missingDependencies)
+							resolveContext.missingDependencies.add(file);
+						if (resolveContext.log) resolveContext.log(file + " doesn't exist");
+						return callback();
+					}
+					if (!stat.isFile()) {
+						if (resolveContext.missingDependencies)
+							resolveContext.missingDependencies.add(file);
+						if (resolveContext.log) resolveContext.log(file + " is not a file");
+						return callback();
+					}
+					if (resolveContext.fileDependencies)
+						resolveContext.fileDependencies.add(file);
+					resolver.doResolve(
+						target,
+						request,
+						"existing file: " + file,
+						resolveContext,
+						callback
+					);
+				});
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ImportsFieldPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ImportsFieldPlugin.js
new file mode 100644
index 0000000..8be64a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ImportsFieldPlugin.js
@@ -0,0 +1,171 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const path = require("path");
+const DescriptionFileUtils = require("./DescriptionFileUtils");
+const forEachBail = require("./forEachBail");
+const { processImportsField } = require("./util/entrypoints");
+const { parseIdentifier } = require("./util/identifier");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+/** @typedef {import("./util/entrypoints").FieldProcessor} FieldProcessor */
+/** @typedef {import("./util/entrypoints").ImportsField} ImportsField */
+
+const dotCode = ".".charCodeAt(0);
+
+module.exports = class ImportsFieldPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {Set<string>} conditionNames condition names
+	 * @param {string | string[]} fieldNamePath name path
+	 * @param {string | ResolveStepHook} targetFile target file
+	 * @param {string | ResolveStepHook} targetPackage target package
+	 */
+	constructor(
+		source,
+		conditionNames,
+		fieldNamePath,
+		targetFile,
+		targetPackage
+	) {
+		this.source = source;
+		this.targetFile = targetFile;
+		this.targetPackage = targetPackage;
+		this.conditionNames = conditionNames;
+		this.fieldName = fieldNamePath;
+		/** @type {WeakMap<any, FieldProcessor>} */
+		this.fieldProcessorCache = new WeakMap();
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const targetFile = resolver.ensureHook(this.targetFile);
+		const targetPackage = resolver.ensureHook(this.targetPackage);
+
+		resolver
+			.getHook(this.source)
+			.tapAsync("ImportsFieldPlugin", (request, resolveContext, callback) => {
+				// When there is no description file, abort
+				if (!request.descriptionFilePath || request.request === undefined) {
+					return callback();
+				}
+
+				const remainingRequest =
+					request.request + request.query + request.fragment;
+				/** @type {ImportsField|null} */
+				const importsField = DescriptionFileUtils.getField(
+					request.descriptionFileData,
+					this.fieldName
+				);
+				if (!importsField) return callback();
+
+				if (request.directory) {
+					return callback(
+						new Error(
+							`Resolving to directories is not possible with the imports field (request was ${remainingRequest}/)`
+						)
+					);
+				}
+
+				let paths;
+
+				try {
+					// We attach the cache to the description file instead of the importsField value
+					// because we use a WeakMap and the importsField could be a string too.
+					// Description file is always an object when exports field can be accessed.
+					let fieldProcessor = this.fieldProcessorCache.get(
+						request.descriptionFileData
+					);
+					if (fieldProcessor === undefined) {
+						fieldProcessor = processImportsField(importsField);
+						this.fieldProcessorCache.set(
+							request.descriptionFileData,
+							fieldProcessor
+						);
+					}
+					paths = fieldProcessor(remainingRequest, this.conditionNames);
+				} catch (err) {
+					if (resolveContext.log) {
+						resolveContext.log(
+							`Imports field in ${request.descriptionFilePath} can't be processed: ${err}`
+						);
+					}
+					return callback(err);
+				}
+
+				if (paths.length === 0) {
+					return callback(
+						new Error(
+							`Package import ${remainingRequest} is not imported from package ${request.descriptionFileRoot} (see imports field in ${request.descriptionFilePath})`
+						)
+					);
+				}
+
+				forEachBail(
+					paths,
+					(p, callback) => {
+						const parsedIdentifier = parseIdentifier(p);
+
+						if (!parsedIdentifier) return callback();
+
+						const [path_, query, fragment] = parsedIdentifier;
+
+						switch (path_.charCodeAt(0)) {
+							// should be relative
+							case dotCode: {
+								const obj = {
+									...request,
+									request: undefined,
+									path: path.join(
+										/** @type {string} */ (request.descriptionFileRoot),
+										path_
+									),
+									relativePath: path_,
+									query,
+									fragment
+								};
+
+								resolver.doResolve(
+									targetFile,
+									obj,
+									"using imports field: " + p,
+									resolveContext,
+									callback
+								);
+								break;
+							}
+
+							// package resolving
+							default: {
+								const obj = {
+									...request,
+									request: path_,
+									relativePath: path_,
+									fullySpecified: true,
+									query,
+									fragment
+								};
+
+								resolver.doResolve(
+									targetPackage,
+									obj,
+									"using imports field: " + p,
+									resolveContext,
+									callback
+								);
+							}
+						}
+					},
+					(err, result) => callback(err, result || null)
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/JoinRequestPartPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/JoinRequestPartPlugin.js
new file mode 100644
index 0000000..356af1d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/JoinRequestPartPlugin.js
@@ -0,0 +1,64 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+const namespaceStartCharCode = "@".charCodeAt(0);
+
+module.exports = class JoinRequestPartPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync(
+				"JoinRequestPartPlugin",
+				(request, resolveContext, callback) => {
+					const req = request.request || "";
+					let i = req.indexOf("/", 3);
+
+					if (i >= 0 && req.charCodeAt(2) === namespaceStartCharCode) {
+						i = req.indexOf("/", i + 1);
+					}
+
+					let moduleName, remainingRequest, fullySpecified;
+					if (i < 0) {
+						moduleName = req;
+						remainingRequest = ".";
+						fullySpecified = false;
+					} else {
+						moduleName = req.slice(0, i);
+						remainingRequest = "." + req.slice(i);
+						fullySpecified = request.fullySpecified;
+					}
+					const obj = {
+						...request,
+						path: resolver.join(request.path, moduleName),
+						relativePath:
+							request.relativePath &&
+							resolver.join(request.relativePath, moduleName),
+						request: remainingRequest,
+						fullySpecified
+					};
+					resolver.doResolve(target, obj, null, resolveContext, callback);
+				}
+			);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/JoinRequestPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/JoinRequestPlugin.js
new file mode 100644
index 0000000..69db197
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/JoinRequestPlugin.js
@@ -0,0 +1,41 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class JoinRequestPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("JoinRequestPlugin", (request, resolveContext, callback) => {
+				const obj = {
+					...request,
+					path: resolver.join(request.path, request.request),
+					relativePath:
+						request.relativePath &&
+						resolver.join(request.relativePath, request.request),
+					request: undefined
+				};
+				resolver.doResolve(target, obj, null, resolveContext, callback);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/LogInfoPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/LogInfoPlugin.js
new file mode 100644
index 0000000..13c93f1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/LogInfoPlugin.js
@@ -0,0 +1,50 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+
+module.exports = class LogInfoPlugin {
+	constructor(source) {
+		this.source = source;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const source = this.source;
+		resolver
+			.getHook(this.source)
+			.tapAsync("LogInfoPlugin", (request, resolveContext, callback) => {
+				if (!resolveContext.log) return callback();
+				const log = resolveContext.log;
+				const prefix = "[" + source + "] ";
+				if (request.path)
+					log(prefix + "Resolving in directory: " + request.path);
+				if (request.request)
+					log(prefix + "Resolving request: " + request.request);
+				if (request.module) log(prefix + "Request is an module request.");
+				if (request.directory) log(prefix + "Request is a directory request.");
+				if (request.query)
+					log(prefix + "Resolving request query: " + request.query);
+				if (request.fragment)
+					log(prefix + "Resolving request fragment: " + request.fragment);
+				if (request.descriptionFilePath)
+					log(
+						prefix + "Has description data from " + request.descriptionFilePath
+					);
+				if (request.relativePath)
+					log(
+						prefix +
+							"Relative path from description file is: " +
+							request.relativePath
+					);
+				callback();
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/MainFieldPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/MainFieldPlugin.js
new file mode 100644
index 0000000..5534618
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/MainFieldPlugin.js
@@ -0,0 +1,81 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const path = require("path");
+const DescriptionFileUtils = require("./DescriptionFileUtils");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+/** @typedef {{name: string|Array<string>, forceRelative: boolean}} MainFieldOptions */
+
+const alreadyTriedMainField = Symbol("alreadyTriedMainField");
+
+module.exports = class MainFieldPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {MainFieldOptions} options options
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, options, target) {
+		this.source = source;
+		this.options = options;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("MainFieldPlugin", (request, resolveContext, callback) => {
+				if (
+					request.path !== request.descriptionFileRoot ||
+					request[alreadyTriedMainField] === request.descriptionFilePath ||
+					!request.descriptionFilePath
+				)
+					return callback();
+				const filename = path.basename(request.descriptionFilePath);
+				let mainModule = DescriptionFileUtils.getField(
+					request.descriptionFileData,
+					this.options.name
+				);
+
+				if (
+					!mainModule ||
+					typeof mainModule !== "string" ||
+					mainModule === "." ||
+					mainModule === "./"
+				) {
+					return callback();
+				}
+				if (this.options.forceRelative && !/^\.\.?\//.test(mainModule))
+					mainModule = "./" + mainModule;
+				const obj = {
+					...request,
+					request: mainModule,
+					module: false,
+					directory: mainModule.endsWith("/"),
+					[alreadyTriedMainField]: request.descriptionFilePath
+				};
+				return resolver.doResolve(
+					target,
+					obj,
+					"use " +
+						mainModule +
+						" from " +
+						this.options.name +
+						" in " +
+						filename,
+					resolveContext,
+					callback
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInHierachicDirectoriesPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInHierachicDirectoriesPlugin.js
new file mode 100644
index 0000000..06065e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInHierachicDirectoriesPlugin.js
@@ -0,0 +1,9 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+// TODO remove in next major
+module.exports = require("./ModulesInHierarchicalDirectoriesPlugin");
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInHierarchicalDirectoriesPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInHierarchicalDirectoriesPlugin.js
new file mode 100644
index 0000000..bb7530e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInHierarchicalDirectoriesPlugin.js
@@ -0,0 +1,80 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const forEachBail = require("./forEachBail");
+const getPaths = require("./getPaths");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class ModulesInHierarchicalDirectoriesPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | Array<string>} directories directories
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, directories, target) {
+		this.source = source;
+		this.directories = /** @type {Array<string>} */ ([]).concat(directories);
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync(
+				"ModulesInHierarchicalDirectoriesPlugin",
+				(request, resolveContext, callback) => {
+					const fs = resolver.fileSystem;
+					const addrs = getPaths(request.path)
+						.paths.map(p => {
+							return this.directories.map(d => resolver.join(p, d));
+						})
+						.reduce((array, p) => {
+							array.push.apply(array, p);
+							return array;
+						}, []);
+					forEachBail(
+						addrs,
+						(addr, callback) => {
+							fs.stat(addr, (err, stat) => {
+								if (!err && stat && stat.isDirectory()) {
+									const obj = {
+										...request,
+										path: addr,
+										request: "./" + request.request,
+										module: false
+									};
+									const message = "looking for modules in " + addr;
+									return resolver.doResolve(
+										target,
+										obj,
+										message,
+										resolveContext,
+										callback
+									);
+								}
+								if (resolveContext.log)
+									resolveContext.log(
+										addr + " doesn't exist or is not a directory"
+									);
+								if (resolveContext.missingDependencies)
+									resolveContext.missingDependencies.add(addr);
+								return callback();
+							});
+						},
+						callback
+					);
+				}
+			);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInRootPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInRootPlugin.js
new file mode 100644
index 0000000..c00643c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ModulesInRootPlugin.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class ModulesInRootPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string} path path
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, path, target) {
+		this.source = source;
+		this.path = path;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("ModulesInRootPlugin", (request, resolveContext, callback) => {
+				const obj = {
+					...request,
+					path: this.path,
+					request: "./" + request.request,
+					module: false
+				};
+				resolver.doResolve(
+					target,
+					obj,
+					"looking for modules in " + this.path,
+					resolveContext,
+					callback
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/NextPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/NextPlugin.js
new file mode 100644
index 0000000..e59c56b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/NextPlugin.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class NextPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("NextPlugin", (request, resolveContext, callback) => {
+				resolver.doResolve(target, request, null, resolveContext, callback);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ParsePlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ParsePlugin.js
new file mode 100644
index 0000000..188a4e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ParsePlugin.js
@@ -0,0 +1,74 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveRequest} ResolveRequest */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class ParsePlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {Partial<ResolveRequest>} requestOptions request options
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, requestOptions, target) {
+		this.source = source;
+		this.requestOptions = requestOptions;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("ParsePlugin", (request, resolveContext, callback) => {
+				const parsed = resolver.parse(/** @type {string} */ (request.request));
+				const obj = { ...request, ...parsed, ...this.requestOptions };
+				if (request.query && !parsed.query) {
+					obj.query = request.query;
+				}
+				if (request.fragment && !parsed.fragment) {
+					obj.fragment = request.fragment;
+				}
+				if (parsed && resolveContext.log) {
+					if (parsed.module) resolveContext.log("Parsed request is a module");
+					if (parsed.directory)
+						resolveContext.log("Parsed request is a directory");
+				}
+				// There is an edge-case where a request with # can be a path or a fragment -> try both
+				if (obj.request && !obj.query && obj.fragment) {
+					const directory = obj.fragment.endsWith("/");
+					const alternative = {
+						...obj,
+						directory,
+						request:
+							obj.request +
+							(obj.directory ? "/" : "") +
+							(directory ? obj.fragment.slice(0, -1) : obj.fragment),
+						fragment: ""
+					};
+					resolver.doResolve(
+						target,
+						alternative,
+						null,
+						resolveContext,
+						(err, result) => {
+							if (err) return callback(err);
+							if (result) return callback(null, result);
+							resolver.doResolve(target, obj, null, resolveContext, callback);
+						}
+					);
+					return;
+				}
+				resolver.doResolve(target, obj, null, resolveContext, callback);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/PnpPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/PnpPlugin.js
new file mode 100644
index 0000000..cecb7dd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/PnpPlugin.js
@@ -0,0 +1,103 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Maël Nison @arcanis
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+/**
+ * @typedef {Object} PnpApiImpl
+ * @property {function(string, string, object): string} resolveToUnqualified
+ */
+
+module.exports = class PnpPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {PnpApiImpl} pnpApi pnpApi
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, pnpApi, target) {
+		this.source = source;
+		this.pnpApi = pnpApi;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("PnpPlugin", (request, resolveContext, callback) => {
+				const req = request.request;
+				if (!req) return callback();
+
+				// The trailing slash indicates to PnP that this value is a folder rather than a file
+				const issuer = `${request.path}/`;
+
+				const packageMatch = /^(@[^/]+\/)?[^/]+/.exec(req);
+				if (!packageMatch) return callback();
+
+				const packageName = packageMatch[0];
+				const innerRequest = `.${req.slice(packageName.length)}`;
+
+				let resolution;
+				let apiResolution;
+				try {
+					resolution = this.pnpApi.resolveToUnqualified(packageName, issuer, {
+						considerBuiltins: false
+					});
+					if (resolveContext.fileDependencies) {
+						apiResolution = this.pnpApi.resolveToUnqualified("pnpapi", issuer, {
+							considerBuiltins: false
+						});
+					}
+				} catch (error) {
+					if (
+						error.code === "MODULE_NOT_FOUND" &&
+						error.pnpCode === "UNDECLARED_DEPENDENCY"
+					) {
+						// This is not a PnP managed dependency.
+						// Try to continue resolving with our alternatives
+						if (resolveContext.log) {
+							resolveContext.log(`request is not managed by the pnpapi`);
+							for (const line of error.message.split("\n").filter(Boolean))
+								resolveContext.log(`  ${line}`);
+						}
+						return callback();
+					}
+					return callback(error);
+				}
+
+				if (resolution === packageName) return callback();
+
+				if (apiResolution && resolveContext.fileDependencies) {
+					resolveContext.fileDependencies.add(apiResolution);
+				}
+
+				const obj = {
+					...request,
+					path: resolution,
+					request: innerRequest,
+					ignoreSymlinks: true,
+					fullySpecified: request.fullySpecified && innerRequest !== "."
+				};
+				resolver.doResolve(
+					target,
+					obj,
+					`resolved by pnp to ${resolution}`,
+					resolveContext,
+					(err, result) => {
+						if (err) return callback(err);
+						if (result) return callback(null, result);
+						// Skip alternatives
+						return callback(null, null);
+					}
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/Resolver.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/Resolver.js
new file mode 100644
index 0000000..5e747a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/Resolver.js
@@ -0,0 +1,500 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { AsyncSeriesBailHook, AsyncSeriesHook, SyncHook } = require("tapable");
+const createInnerContext = require("./createInnerContext");
+const { parseIdentifier } = require("./util/identifier");
+const {
+	normalize,
+	cachedJoin: join,
+	getType,
+	PathType
+} = require("./util/path");
+
+/** @typedef {import("./ResolverFactory").ResolveOptions} ResolveOptions */
+
+/**
+ * @typedef {Object} FileSystemStats
+ * @property {function(): boolean} isDirectory
+ * @property {function(): boolean} isFile
+ */
+
+/**
+ * @typedef {Object} FileSystemDirent
+ * @property {Buffer | string} name
+ * @property {function(): boolean} isDirectory
+ * @property {function(): boolean} isFile
+ */
+
+/**
+ * @typedef {Object} PossibleFileSystemError
+ * @property {string=} code
+ * @property {number=} errno
+ * @property {string=} path
+ * @property {string=} syscall
+ */
+
+/**
+ * @template T
+ * @callback FileSystemCallback
+ * @param {PossibleFileSystemError & Error | null | undefined} err
+ * @param {T=} result
+ */
+
+/**
+ * @typedef {Object} FileSystem
+ * @property {(function(string, FileSystemCallback<Buffer | string>): void) & function(string, object, FileSystemCallback<Buffer | string>): void} readFile
+ * @property {(function(string, FileSystemCallback<(Buffer | string)[] | FileSystemDirent[]>): void) & function(string, object, FileSystemCallback<(Buffer | string)[] | FileSystemDirent[]>): void} readdir
+ * @property {((function(string, FileSystemCallback<object>): void) & function(string, object, FileSystemCallback<object>): void)=} readJson
+ * @property {(function(string, FileSystemCallback<Buffer | string>): void) & function(string, object, FileSystemCallback<Buffer | string>): void} readlink
+ * @property {(function(string, FileSystemCallback<FileSystemStats>): void) & function(string, object, FileSystemCallback<Buffer | string>): void=} lstat
+ * @property {(function(string, FileSystemCallback<FileSystemStats>): void) & function(string, object, FileSystemCallback<Buffer | string>): void} stat
+ */
+
+/**
+ * @typedef {Object} SyncFileSystem
+ * @property {function(string, object=): Buffer | string} readFileSync
+ * @property {function(string, object=): (Buffer | string)[] | FileSystemDirent[]} readdirSync
+ * @property {(function(string, object=): object)=} readJsonSync
+ * @property {function(string, object=): Buffer | string} readlinkSync
+ * @property {function(string, object=): FileSystemStats=} lstatSync
+ * @property {function(string, object=): FileSystemStats} statSync
+ */
+
+/**
+ * @typedef {Object} ParsedIdentifier
+ * @property {string} request
+ * @property {string} query
+ * @property {string} fragment
+ * @property {boolean} directory
+ * @property {boolean} module
+ * @property {boolean} file
+ * @property {boolean} internal
+ */
+
+/**
+ * @typedef {Object} BaseResolveRequest
+ * @property {string | false} path
+ * @property {string=} descriptionFilePath
+ * @property {string=} descriptionFileRoot
+ * @property {object=} descriptionFileData
+ * @property {string=} relativePath
+ * @property {boolean=} ignoreSymlinks
+ * @property {boolean=} fullySpecified
+ */
+
+/** @typedef {BaseResolveRequest & Partial<ParsedIdentifier>} ResolveRequest */
+
+/**
+ * String with special formatting
+ * @typedef {string} StackEntry
+ */
+
+/** @template T @typedef {{ add: (T) => void }} WriteOnlySet */
+
+/**
+ * Resolve context
+ * @typedef {Object} ResolveContext
+ * @property {WriteOnlySet<string>=} contextDependencies
+ * @property {WriteOnlySet<string>=} fileDependencies files that was found on file system
+ * @property {WriteOnlySet<string>=} missingDependencies dependencies that was not found on file system
+ * @property {Set<StackEntry>=} stack set of hooks' calls. For instance, `resolve → parsedResolve → describedResolve`,
+ * @property {(function(string): void)=} log log function
+ * @property {(function (ResolveRequest): void)=} yield yield result, if provided plugins can return several results
+ */
+
+/** @typedef {AsyncSeriesBailHook<[ResolveRequest, ResolveContext], ResolveRequest | null>} ResolveStepHook */
+
+/**
+ * @param {string} str input string
+ * @returns {string} in camel case
+ */
+function toCamelCase(str) {
+	return str.replace(/-([a-z])/g, str => str.substr(1).toUpperCase());
+}
+
+class Resolver {
+	/**
+	 * @param {ResolveStepHook} hook hook
+	 * @param {ResolveRequest} request request
+	 * @returns {StackEntry} stack entry
+	 */
+	static createStackEntry(hook, request) {
+		return (
+			hook.name +
+			": (" +
+			request.path +
+			") " +
+			(request.request || "") +
+			(request.query || "") +
+			(request.fragment || "") +
+			(request.directory ? " directory" : "") +
+			(request.module ? " module" : "")
+		);
+	}
+
+	/**
+	 * @param {FileSystem} fileSystem a filesystem
+	 * @param {ResolveOptions} options options
+	 */
+	constructor(fileSystem, options) {
+		this.fileSystem = fileSystem;
+		this.options = options;
+		this.hooks = {
+			/** @type {SyncHook<[ResolveStepHook, ResolveRequest], void>} */
+			resolveStep: new SyncHook(["hook", "request"], "resolveStep"),
+			/** @type {SyncHook<[ResolveRequest, Error]>} */
+			noResolve: new SyncHook(["request", "error"], "noResolve"),
+			/** @type {ResolveStepHook} */
+			resolve: new AsyncSeriesBailHook(
+				["request", "resolveContext"],
+				"resolve"
+			),
+			/** @type {AsyncSeriesHook<[ResolveRequest, ResolveContext]>} */
+			result: new AsyncSeriesHook(["result", "resolveContext"], "result")
+		};
+	}
+
+	/**
+	 * @param {string | ResolveStepHook} name hook name or hook itself
+	 * @returns {ResolveStepHook} the hook
+	 */
+	ensureHook(name) {
+		if (typeof name !== "string") {
+			return name;
+		}
+		name = toCamelCase(name);
+		if (/^before/.test(name)) {
+			return /** @type {ResolveStepHook} */ (this.ensureHook(
+				name[6].toLowerCase() + name.substr(7)
+			).withOptions({
+				stage: -10
+			}));
+		}
+		if (/^after/.test(name)) {
+			return /** @type {ResolveStepHook} */ (this.ensureHook(
+				name[5].toLowerCase() + name.substr(6)
+			).withOptions({
+				stage: 10
+			}));
+		}
+		const hook = this.hooks[name];
+		if (!hook) {
+			return (this.hooks[name] = new AsyncSeriesBailHook(
+				["request", "resolveContext"],
+				name
+			));
+		}
+		return hook;
+	}
+
+	/**
+	 * @param {string | ResolveStepHook} name hook name or hook itself
+	 * @returns {ResolveStepHook} the hook
+	 */
+	getHook(name) {
+		if (typeof name !== "string") {
+			return name;
+		}
+		name = toCamelCase(name);
+		if (/^before/.test(name)) {
+			return /** @type {ResolveStepHook} */ (this.getHook(
+				name[6].toLowerCase() + name.substr(7)
+			).withOptions({
+				stage: -10
+			}));
+		}
+		if (/^after/.test(name)) {
+			return /** @type {ResolveStepHook} */ (this.getHook(
+				name[5].toLowerCase() + name.substr(6)
+			).withOptions({
+				stage: 10
+			}));
+		}
+		const hook = this.hooks[name];
+		if (!hook) {
+			throw new Error(`Hook ${name} doesn't exist`);
+		}
+		return hook;
+	}
+
+	/**
+	 * @param {object} context context information object
+	 * @param {string} path context path
+	 * @param {string} request request string
+	 * @returns {string | false} result
+	 */
+	resolveSync(context, path, request) {
+		/** @type {Error | null | undefined} */
+		let err = undefined;
+		/** @type {string | false | undefined} */
+		let result = undefined;
+		let sync = false;
+		this.resolve(context, path, request, {}, (e, r) => {
+			err = e;
+			result = r;
+			sync = true;
+		});
+		if (!sync) {
+			throw new Error(
+				"Cannot 'resolveSync' because the fileSystem is not sync. Use 'resolve'!"
+			);
+		}
+		if (err) throw err;
+		if (result === undefined) throw new Error("No result");
+		return result;
+	}
+
+	/**
+	 * @param {object} context context information object
+	 * @param {string} path context path
+	 * @param {string} request request string
+	 * @param {ResolveContext} resolveContext resolve context
+	 * @param {function(Error | null, (string|false)=, ResolveRequest=): void} callback callback function
+	 * @returns {void}
+	 */
+	resolve(context, path, request, resolveContext, callback) {
+		if (!context || typeof context !== "object")
+			return callback(new Error("context argument is not an object"));
+		if (typeof path !== "string")
+			return callback(new Error("path argument is not a string"));
+		if (typeof request !== "string")
+			return callback(new Error("path argument is not a string"));
+		if (!resolveContext)
+			return callback(new Error("resolveContext argument is not set"));
+
+		const obj = {
+			context: context,
+			path: path,
+			request: request
+		};
+
+		let yield_;
+		let yieldCalled = false;
+		let finishYield;
+		if (typeof resolveContext.yield === "function") {
+			const old = resolveContext.yield;
+			yield_ = obj => {
+				old(obj);
+				yieldCalled = true;
+			};
+			finishYield = result => {
+				if (result) yield_(result);
+				callback(null);
+			};
+		}
+
+		const message = `resolve '${request}' in '${path}'`;
+
+		const finishResolved = result => {
+			return callback(
+				null,
+				result.path === false
+					? false
+					: `${result.path.replace(/#/g, "\0#")}${
+							result.query ? result.query.replace(/#/g, "\0#") : ""
+					  }${result.fragment || ""}`,
+				result
+			);
+		};
+
+		const finishWithoutResolve = log => {
+			/**
+			 * @type {Error & {details?: string}}
+			 */
+			const error = new Error("Can't " + message);
+			error.details = log.join("\n");
+			this.hooks.noResolve.call(obj, error);
+			return callback(error);
+		};
+
+		if (resolveContext.log) {
+			// We need log anyway to capture it in case of an error
+			const parentLog = resolveContext.log;
+			const log = [];
+			return this.doResolve(
+				this.hooks.resolve,
+				obj,
+				message,
+				{
+					log: msg => {
+						parentLog(msg);
+						log.push(msg);
+					},
+					yield: yield_,
+					fileDependencies: resolveContext.fileDependencies,
+					contextDependencies: resolveContext.contextDependencies,
+					missingDependencies: resolveContext.missingDependencies,
+					stack: resolveContext.stack
+				},
+				(err, result) => {
+					if (err) return callback(err);
+
+					if (yieldCalled || (result && yield_)) return finishYield(result);
+					if (result) return finishResolved(result);
+
+					return finishWithoutResolve(log);
+				}
+			);
+		} else {
+			// Try to resolve assuming there is no error
+			// We don't log stuff in this case
+			return this.doResolve(
+				this.hooks.resolve,
+				obj,
+				message,
+				{
+					log: undefined,
+					yield: yield_,
+					fileDependencies: resolveContext.fileDependencies,
+					contextDependencies: resolveContext.contextDependencies,
+					missingDependencies: resolveContext.missingDependencies,
+					stack: resolveContext.stack
+				},
+				(err, result) => {
+					if (err) return callback(err);
+
+					if (yieldCalled || (result && yield_)) return finishYield(result);
+					if (result) return finishResolved(result);
+
+					// log is missing for the error details
+					// so we redo the resolving for the log info
+					// this is more expensive to the success case
+					// is assumed by default
+
+					const log = [];
+
+					return this.doResolve(
+						this.hooks.resolve,
+						obj,
+						message,
+						{
+							log: msg => log.push(msg),
+							yield: yield_,
+							stack: resolveContext.stack
+						},
+						(err, result) => {
+							if (err) return callback(err);
+
+							// In a case that there is a race condition and yield will be called
+							if (yieldCalled || (result && yield_)) return finishYield(result);
+
+							return finishWithoutResolve(log);
+						}
+					);
+				}
+			);
+		}
+	}
+
+	doResolve(hook, request, message, resolveContext, callback) {
+		const stackEntry = Resolver.createStackEntry(hook, request);
+
+		let newStack;
+		if (resolveContext.stack) {
+			newStack = new Set(resolveContext.stack);
+			if (resolveContext.stack.has(stackEntry)) {
+				/**
+				 * Prevent recursion
+				 * @type {Error & {recursion?: boolean}}
+				 */
+				const recursionError = new Error(
+					"Recursion in resolving\nStack:\n  " +
+						Array.from(newStack).join("\n  ")
+				);
+				recursionError.recursion = true;
+				if (resolveContext.log)
+					resolveContext.log("abort resolving because of recursion");
+				return callback(recursionError);
+			}
+			newStack.add(stackEntry);
+		} else {
+			newStack = new Set([stackEntry]);
+		}
+		this.hooks.resolveStep.call(hook, request);
+
+		if (hook.isUsed()) {
+			const innerContext = createInnerContext(
+				{
+					log: resolveContext.log,
+					yield: resolveContext.yield,
+					fileDependencies: resolveContext.fileDependencies,
+					contextDependencies: resolveContext.contextDependencies,
+					missingDependencies: resolveContext.missingDependencies,
+					stack: newStack
+				},
+				message
+			);
+			return hook.callAsync(request, innerContext, (err, result) => {
+				if (err) return callback(err);
+				if (result) return callback(null, result);
+				callback();
+			});
+		} else {
+			callback();
+		}
+	}
+
+	/**
+	 * @param {string} identifier identifier
+	 * @returns {ParsedIdentifier} parsed identifier
+	 */
+	parse(identifier) {
+		const part = {
+			request: "",
+			query: "",
+			fragment: "",
+			module: false,
+			directory: false,
+			file: false,
+			internal: false
+		};
+
+		const parsedIdentifier = parseIdentifier(identifier);
+
+		if (!parsedIdentifier) return part;
+
+		[part.request, part.query, part.fragment] = parsedIdentifier;
+
+		if (part.request.length > 0) {
+			part.internal = this.isPrivate(identifier);
+			part.module = this.isModule(part.request);
+			part.directory = this.isDirectory(part.request);
+			if (part.directory) {
+				part.request = part.request.substr(0, part.request.length - 1);
+			}
+		}
+
+		return part;
+	}
+
+	isModule(path) {
+		return getType(path) === PathType.Normal;
+	}
+
+	isPrivate(path) {
+		return getType(path) === PathType.Internal;
+	}
+
+	/**
+	 * @param {string} path a path
+	 * @returns {boolean} true, if the path is a directory path
+	 */
+	isDirectory(path) {
+		return path.endsWith("/");
+	}
+
+	join(path, request) {
+		return join(path, request);
+	}
+
+	normalize(path) {
+		return normalize(path);
+	}
+}
+
+module.exports = Resolver;
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ResolverFactory.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ResolverFactory.js
new file mode 100644
index 0000000..7a290de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ResolverFactory.js
@@ -0,0 +1,661 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const versions = require("process").versions;
+const Resolver = require("./Resolver");
+const { getType, PathType } = require("./util/path");
+
+const SyncAsyncFileSystemDecorator = require("./SyncAsyncFileSystemDecorator");
+
+const AliasFieldPlugin = require("./AliasFieldPlugin");
+const AliasPlugin = require("./AliasPlugin");
+const AppendPlugin = require("./AppendPlugin");
+const ConditionalPlugin = require("./ConditionalPlugin");
+const DescriptionFilePlugin = require("./DescriptionFilePlugin");
+const DirectoryExistsPlugin = require("./DirectoryExistsPlugin");
+const ExportsFieldPlugin = require("./ExportsFieldPlugin");
+const FileExistsPlugin = require("./FileExistsPlugin");
+const ImportsFieldPlugin = require("./ImportsFieldPlugin");
+const JoinRequestPartPlugin = require("./JoinRequestPartPlugin");
+const JoinRequestPlugin = require("./JoinRequestPlugin");
+const MainFieldPlugin = require("./MainFieldPlugin");
+const ModulesInHierarchicalDirectoriesPlugin = require("./ModulesInHierarchicalDirectoriesPlugin");
+const ModulesInRootPlugin = require("./ModulesInRootPlugin");
+const NextPlugin = require("./NextPlugin");
+const ParsePlugin = require("./ParsePlugin");
+const PnpPlugin = require("./PnpPlugin");
+const RestrictionsPlugin = require("./RestrictionsPlugin");
+const ResultPlugin = require("./ResultPlugin");
+const RootsPlugin = require("./RootsPlugin");
+const SelfReferencePlugin = require("./SelfReferencePlugin");
+const SymlinkPlugin = require("./SymlinkPlugin");
+const TryNextPlugin = require("./TryNextPlugin");
+const UnsafeCachePlugin = require("./UnsafeCachePlugin");
+const UseFilePlugin = require("./UseFilePlugin");
+
+/** @typedef {import("./AliasPlugin").AliasOption} AliasOptionEntry */
+/** @typedef {import("./PnpPlugin").PnpApiImpl} PnpApi */
+/** @typedef {import("./Resolver").FileSystem} FileSystem */
+/** @typedef {import("./Resolver").ResolveRequest} ResolveRequest */
+/** @typedef {import("./Resolver").SyncFileSystem} SyncFileSystem */
+
+/** @typedef {string|string[]|false} AliasOptionNewRequest */
+/** @typedef {{[k: string]: AliasOptionNewRequest}} AliasOptions */
+/** @typedef {{apply: function(Resolver): void} | function(this: Resolver, Resolver): void} Plugin */
+
+/**
+ * @typedef {Object} UserResolveOptions
+ * @property {(AliasOptions | AliasOptionEntry[])=} alias A list of module alias configurations or an object which maps key to value
+ * @property {(AliasOptions | AliasOptionEntry[])=} fallback A list of module alias configurations or an object which maps key to value, applied only after modules option
+ * @property {(string | string[])[]=} aliasFields A list of alias fields in description files
+ * @property {(function(ResolveRequest): boolean)=} cachePredicate A function which decides whether a request should be cached or not. An object is passed with at least `path` and `request` properties.
+ * @property {boolean=} cacheWithContext Whether or not the unsafeCache should include request context as part of the cache key.
+ * @property {string[]=} descriptionFiles A list of description files to read from
+ * @property {string[]=} conditionNames A list of exports field condition names.
+ * @property {boolean=} enforceExtension Enforce that a extension from extensions must be used
+ * @property {(string | string[])[]=} exportsFields A list of exports fields in description files
+ * @property {(string | string[])[]=} importsFields A list of imports fields in description files
+ * @property {string[]=} extensions A list of extensions which should be tried for files
+ * @property {FileSystem} fileSystem The file system which should be used
+ * @property {(object | boolean)=} unsafeCache Use this cache object to unsafely cache the successful requests
+ * @property {boolean=} symlinks Resolve symlinks to their symlinked location
+ * @property {Resolver=} resolver A prepared Resolver to which the plugins are attached
+ * @property {string[] | string=} modules A list of directories to resolve modules from, can be absolute path or folder name
+ * @property {(string | string[] | {name: string | string[], forceRelative: boolean})[]=} mainFields A list of main fields in description files
+ * @property {string[]=} mainFiles  A list of main files in directories
+ * @property {Plugin[]=} plugins A list of additional resolve plugins which should be applied
+ * @property {PnpApi | null=} pnpApi A PnP API that should be used - null is "never", undefined is "auto"
+ * @property {string[]=} roots A list of root paths
+ * @property {boolean=} fullySpecified The request is already fully specified and no extensions or directories are resolved for it
+ * @property {boolean=} resolveToContext Resolve to a context instead of a file
+ * @property {(string|RegExp)[]=} restrictions A list of resolve restrictions
+ * @property {boolean=} useSyncFileSystemCalls Use only the sync constraints of the file system calls
+ * @property {boolean=} preferRelative Prefer to resolve module requests as relative requests before falling back to modules
+ * @property {boolean=} preferAbsolute Prefer to resolve server-relative urls as absolute paths before falling back to resolve in roots
+ */
+
+/**
+ * @typedef {Object} ResolveOptions
+ * @property {AliasOptionEntry[]} alias
+ * @property {AliasOptionEntry[]} fallback
+ * @property {Set<string | string[]>} aliasFields
+ * @property {(function(ResolveRequest): boolean)} cachePredicate
+ * @property {boolean} cacheWithContext
+ * @property {Set<string>} conditionNames A list of exports field condition names.
+ * @property {string[]} descriptionFiles
+ * @property {boolean} enforceExtension
+ * @property {Set<string | string[]>} exportsFields
+ * @property {Set<string | string[]>} importsFields
+ * @property {Set<string>} extensions
+ * @property {FileSystem} fileSystem
+ * @property {object | false} unsafeCache
+ * @property {boolean} symlinks
+ * @property {Resolver=} resolver
+ * @property {Array<string | string[]>} modules
+ * @property {{name: string[], forceRelative: boolean}[]} mainFields
+ * @property {Set<string>} mainFiles
+ * @property {Plugin[]} plugins
+ * @property {PnpApi | null} pnpApi
+ * @property {Set<string>} roots
+ * @property {boolean} fullySpecified
+ * @property {boolean} resolveToContext
+ * @property {Set<string|RegExp>} restrictions
+ * @property {boolean} preferRelative
+ * @property {boolean} preferAbsolute
+ */
+
+/**
+ * @param {PnpApi | null=} option option
+ * @returns {PnpApi | null} processed option
+ */
+function processPnpApiOption(option) {
+	if (
+		option === undefined &&
+		/** @type {NodeJS.ProcessVersions & {pnp: string}} */ versions.pnp
+	) {
+		// @ts-ignore
+		return require("pnpapi"); // eslint-disable-line node/no-missing-require
+	}
+
+	return option || null;
+}
+
+/**
+ * @param {AliasOptions | AliasOptionEntry[] | undefined} alias alias
+ * @returns {AliasOptionEntry[]} normalized aliases
+ */
+function normalizeAlias(alias) {
+	return typeof alias === "object" && !Array.isArray(alias) && alias !== null
+		? Object.keys(alias).map(key => {
+				/** @type {AliasOptionEntry} */
+				const obj = { name: key, onlyModule: false, alias: alias[key] };
+
+				if (/\$$/.test(key)) {
+					obj.onlyModule = true;
+					obj.name = key.substr(0, key.length - 1);
+				}
+
+				return obj;
+		  })
+		: /** @type {Array<AliasOptionEntry>} */ (alias) || [];
+}
+
+/**
+ * @param {UserResolveOptions} options input options
+ * @returns {ResolveOptions} output options
+ */
+function createOptions(options) {
+	const mainFieldsSet = new Set(options.mainFields || ["main"]);
+	const mainFields = [];
+
+	for (const item of mainFieldsSet) {
+		if (typeof item === "string") {
+			mainFields.push({
+				name: [item],
+				forceRelative: true
+			});
+		} else if (Array.isArray(item)) {
+			mainFields.push({
+				name: item,
+				forceRelative: true
+			});
+		} else {
+			mainFields.push({
+				name: Array.isArray(item.name) ? item.name : [item.name],
+				forceRelative: item.forceRelative
+			});
+		}
+	}
+
+	return {
+		alias: normalizeAlias(options.alias),
+		fallback: normalizeAlias(options.fallback),
+		aliasFields: new Set(options.aliasFields),
+		cachePredicate:
+			options.cachePredicate ||
+			function () {
+				return true;
+			},
+		cacheWithContext:
+			typeof options.cacheWithContext !== "undefined"
+				? options.cacheWithContext
+				: true,
+		exportsFields: new Set(options.exportsFields || ["exports"]),
+		importsFields: new Set(options.importsFields || ["imports"]),
+		conditionNames: new Set(options.conditionNames),
+		descriptionFiles: Array.from(
+			new Set(options.descriptionFiles || ["package.json"])
+		),
+		enforceExtension:
+			options.enforceExtension === undefined
+				? options.extensions && options.extensions.includes("")
+					? true
+					: false
+				: options.enforceExtension,
+		extensions: new Set(options.extensions || [".js", ".json", ".node"]),
+		fileSystem: options.useSyncFileSystemCalls
+			? new SyncAsyncFileSystemDecorator(
+					/** @type {SyncFileSystem} */ (
+						/** @type {unknown} */ (options.fileSystem)
+					)
+			  )
+			: options.fileSystem,
+		unsafeCache:
+			options.unsafeCache && typeof options.unsafeCache !== "object"
+				? {}
+				: options.unsafeCache || false,
+		symlinks: typeof options.symlinks !== "undefined" ? options.symlinks : true,
+		resolver: options.resolver,
+		modules: mergeFilteredToArray(
+			Array.isArray(options.modules)
+				? options.modules
+				: options.modules
+				? [options.modules]
+				: ["node_modules"],
+			item => {
+				const type = getType(item);
+				return type === PathType.Normal || type === PathType.Relative;
+			}
+		),
+		mainFields,
+		mainFiles: new Set(options.mainFiles || ["index"]),
+		plugins: options.plugins || [],
+		pnpApi: processPnpApiOption(options.pnpApi),
+		roots: new Set(options.roots || undefined),
+		fullySpecified: options.fullySpecified || false,
+		resolveToContext: options.resolveToContext || false,
+		preferRelative: options.preferRelative || false,
+		preferAbsolute: options.preferAbsolute || false,
+		restrictions: new Set(options.restrictions)
+	};
+}
+
+/**
+ * @param {UserResolveOptions} options resolve options
+ * @returns {Resolver} created resolver
+ */
+exports.createResolver = function (options) {
+	const normalizedOptions = createOptions(options);
+
+	const {
+		alias,
+		fallback,
+		aliasFields,
+		cachePredicate,
+		cacheWithContext,
+		conditionNames,
+		descriptionFiles,
+		enforceExtension,
+		exportsFields,
+		importsFields,
+		extensions,
+		fileSystem,
+		fullySpecified,
+		mainFields,
+		mainFiles,
+		modules,
+		plugins: userPlugins,
+		pnpApi,
+		resolveToContext,
+		preferRelative,
+		preferAbsolute,
+		symlinks,
+		unsafeCache,
+		resolver: customResolver,
+		restrictions,
+		roots
+	} = normalizedOptions;
+
+	const plugins = userPlugins.slice();
+
+	const resolver = customResolver
+		? customResolver
+		: new Resolver(fileSystem, normalizedOptions);
+
+	//// pipeline ////
+
+	resolver.ensureHook("resolve");
+	resolver.ensureHook("internalResolve");
+	resolver.ensureHook("newInternalResolve");
+	resolver.ensureHook("parsedResolve");
+	resolver.ensureHook("describedResolve");
+	resolver.ensureHook("internal");
+	resolver.ensureHook("rawModule");
+	resolver.ensureHook("module");
+	resolver.ensureHook("resolveAsModule");
+	resolver.ensureHook("undescribedResolveInPackage");
+	resolver.ensureHook("resolveInPackage");
+	resolver.ensureHook("resolveInExistingDirectory");
+	resolver.ensureHook("relative");
+	resolver.ensureHook("describedRelative");
+	resolver.ensureHook("directory");
+	resolver.ensureHook("undescribedExistingDirectory");
+	resolver.ensureHook("existingDirectory");
+	resolver.ensureHook("undescribedRawFile");
+	resolver.ensureHook("rawFile");
+	resolver.ensureHook("file");
+	resolver.ensureHook("finalFile");
+	resolver.ensureHook("existingFile");
+	resolver.ensureHook("resolved");
+
+	// TODO remove in next major
+	// cspell:word Interal
+	// Backward-compat
+	resolver.hooks.newInteralResolve = resolver.hooks.newInternalResolve;
+
+	// resolve
+	for (const { source, resolveOptions } of [
+		{ source: "resolve", resolveOptions: { fullySpecified } },
+		{ source: "internal-resolve", resolveOptions: { fullySpecified: false } }
+	]) {
+		if (unsafeCache) {
+			plugins.push(
+				new UnsafeCachePlugin(
+					source,
+					cachePredicate,
+					unsafeCache,
+					cacheWithContext,
+					`new-${source}`
+				)
+			);
+			plugins.push(
+				new ParsePlugin(`new-${source}`, resolveOptions, "parsed-resolve")
+			);
+		} else {
+			plugins.push(new ParsePlugin(source, resolveOptions, "parsed-resolve"));
+		}
+	}
+
+	// parsed-resolve
+	plugins.push(
+		new DescriptionFilePlugin(
+			"parsed-resolve",
+			descriptionFiles,
+			false,
+			"described-resolve"
+		)
+	);
+	plugins.push(new NextPlugin("after-parsed-resolve", "described-resolve"));
+
+	// described-resolve
+	plugins.push(new NextPlugin("described-resolve", "normal-resolve"));
+	if (fallback.length > 0) {
+		plugins.push(
+			new AliasPlugin("described-resolve", fallback, "internal-resolve")
+		);
+	}
+
+	// normal-resolve
+	if (alias.length > 0)
+		plugins.push(new AliasPlugin("normal-resolve", alias, "internal-resolve"));
+	aliasFields.forEach(item => {
+		plugins.push(
+			new AliasFieldPlugin("normal-resolve", item, "internal-resolve")
+		);
+	});
+	if (preferRelative) {
+		plugins.push(new JoinRequestPlugin("after-normal-resolve", "relative"));
+	}
+	plugins.push(
+		new ConditionalPlugin(
+			"after-normal-resolve",
+			{ module: true },
+			"resolve as module",
+			false,
+			"raw-module"
+		)
+	);
+	plugins.push(
+		new ConditionalPlugin(
+			"after-normal-resolve",
+			{ internal: true },
+			"resolve as internal import",
+			false,
+			"internal"
+		)
+	);
+	if (preferAbsolute) {
+		plugins.push(new JoinRequestPlugin("after-normal-resolve", "relative"));
+	}
+	if (roots.size > 0) {
+		plugins.push(new RootsPlugin("after-normal-resolve", roots, "relative"));
+	}
+	if (!preferRelative && !preferAbsolute) {
+		plugins.push(new JoinRequestPlugin("after-normal-resolve", "relative"));
+	}
+
+	// internal
+	importsFields.forEach(importsField => {
+		plugins.push(
+			new ImportsFieldPlugin(
+				"internal",
+				conditionNames,
+				importsField,
+				"relative",
+				"internal-resolve"
+			)
+		);
+	});
+
+	// raw-module
+	exportsFields.forEach(exportsField => {
+		plugins.push(
+			new SelfReferencePlugin("raw-module", exportsField, "resolve-as-module")
+		);
+	});
+	modules.forEach(item => {
+		if (Array.isArray(item)) {
+			if (item.includes("node_modules") && pnpApi) {
+				plugins.push(
+					new ModulesInHierarchicalDirectoriesPlugin(
+						"raw-module",
+						item.filter(i => i !== "node_modules"),
+						"module"
+					)
+				);
+				plugins.push(
+					new PnpPlugin("raw-module", pnpApi, "undescribed-resolve-in-package")
+				);
+			} else {
+				plugins.push(
+					new ModulesInHierarchicalDirectoriesPlugin(
+						"raw-module",
+						item,
+						"module"
+					)
+				);
+			}
+		} else {
+			plugins.push(new ModulesInRootPlugin("raw-module", item, "module"));
+		}
+	});
+
+	// module
+	plugins.push(new JoinRequestPartPlugin("module", "resolve-as-module"));
+
+	// resolve-as-module
+	if (!resolveToContext) {
+		plugins.push(
+			new ConditionalPlugin(
+				"resolve-as-module",
+				{ directory: false, request: "." },
+				"single file module",
+				true,
+				"undescribed-raw-file"
+			)
+		);
+	}
+	plugins.push(
+		new DirectoryExistsPlugin(
+			"resolve-as-module",
+			"undescribed-resolve-in-package"
+		)
+	);
+
+	// undescribed-resolve-in-package
+	plugins.push(
+		new DescriptionFilePlugin(
+			"undescribed-resolve-in-package",
+			descriptionFiles,
+			false,
+			"resolve-in-package"
+		)
+	);
+	plugins.push(
+		new NextPlugin("after-undescribed-resolve-in-package", "resolve-in-package")
+	);
+
+	// resolve-in-package
+	exportsFields.forEach(exportsField => {
+		plugins.push(
+			new ExportsFieldPlugin(
+				"resolve-in-package",
+				conditionNames,
+				exportsField,
+				"relative"
+			)
+		);
+	});
+	plugins.push(
+		new NextPlugin("resolve-in-package", "resolve-in-existing-directory")
+	);
+
+	// resolve-in-existing-directory
+	plugins.push(
+		new JoinRequestPlugin("resolve-in-existing-directory", "relative")
+	);
+
+	// relative
+	plugins.push(
+		new DescriptionFilePlugin(
+			"relative",
+			descriptionFiles,
+			true,
+			"described-relative"
+		)
+	);
+	plugins.push(new NextPlugin("after-relative", "described-relative"));
+
+	// described-relative
+	if (resolveToContext) {
+		plugins.push(new NextPlugin("described-relative", "directory"));
+	} else {
+		plugins.push(
+			new ConditionalPlugin(
+				"described-relative",
+				{ directory: false },
+				null,
+				true,
+				"raw-file"
+			)
+		);
+		plugins.push(
+			new ConditionalPlugin(
+				"described-relative",
+				{ fullySpecified: false },
+				"as directory",
+				true,
+				"directory"
+			)
+		);
+	}
+
+	// directory
+	plugins.push(
+		new DirectoryExistsPlugin("directory", "undescribed-existing-directory")
+	);
+
+	if (resolveToContext) {
+		// undescribed-existing-directory
+		plugins.push(new NextPlugin("undescribed-existing-directory", "resolved"));
+	} else {
+		// undescribed-existing-directory
+		plugins.push(
+			new DescriptionFilePlugin(
+				"undescribed-existing-directory",
+				descriptionFiles,
+				false,
+				"existing-directory"
+			)
+		);
+		mainFiles.forEach(item => {
+			plugins.push(
+				new UseFilePlugin(
+					"undescribed-existing-directory",
+					item,
+					"undescribed-raw-file"
+				)
+			);
+		});
+
+		// described-existing-directory
+		mainFields.forEach(item => {
+			plugins.push(
+				new MainFieldPlugin(
+					"existing-directory",
+					item,
+					"resolve-in-existing-directory"
+				)
+			);
+		});
+		mainFiles.forEach(item => {
+			plugins.push(
+				new UseFilePlugin("existing-directory", item, "undescribed-raw-file")
+			);
+		});
+
+		// undescribed-raw-file
+		plugins.push(
+			new DescriptionFilePlugin(
+				"undescribed-raw-file",
+				descriptionFiles,
+				true,
+				"raw-file"
+			)
+		);
+		plugins.push(new NextPlugin("after-undescribed-raw-file", "raw-file"));
+
+		// raw-file
+		plugins.push(
+			new ConditionalPlugin(
+				"raw-file",
+				{ fullySpecified: true },
+				null,
+				false,
+				"file"
+			)
+		);
+		if (!enforceExtension) {
+			plugins.push(new TryNextPlugin("raw-file", "no extension", "file"));
+		}
+		extensions.forEach(item => {
+			plugins.push(new AppendPlugin("raw-file", item, "file"));
+		});
+
+		// file
+		if (alias.length > 0)
+			plugins.push(new AliasPlugin("file", alias, "internal-resolve"));
+		aliasFields.forEach(item => {
+			plugins.push(new AliasFieldPlugin("file", item, "internal-resolve"));
+		});
+		plugins.push(new NextPlugin("file", "final-file"));
+
+		// final-file
+		plugins.push(new FileExistsPlugin("final-file", "existing-file"));
+
+		// existing-file
+		if (symlinks)
+			plugins.push(new SymlinkPlugin("existing-file", "existing-file"));
+		plugins.push(new NextPlugin("existing-file", "resolved"));
+	}
+
+	// resolved
+	if (restrictions.size > 0) {
+		plugins.push(new RestrictionsPlugin(resolver.hooks.resolved, restrictions));
+	}
+	plugins.push(new ResultPlugin(resolver.hooks.resolved));
+
+	//// RESOLVER ////
+
+	for (const plugin of plugins) {
+		if (typeof plugin === "function") {
+			plugin.call(resolver, resolver);
+		} else {
+			plugin.apply(resolver);
+		}
+	}
+
+	return resolver;
+};
+
+/**
+ * Merging filtered elements
+ * @param {string[]} array source array
+ * @param {function(string): boolean} filter predicate
+ * @returns {Array<string | string[]>} merge result
+ */
+function mergeFilteredToArray(array, filter) {
+	/** @type {Array<string | string[]>} */
+	const result = [];
+	const set = new Set(array);
+
+	for (const item of set) {
+		if (filter(item)) {
+			const lastElement =
+				result.length > 0 ? result[result.length - 1] : undefined;
+			if (Array.isArray(lastElement)) {
+				lastElement.push(item);
+			} else {
+				result.push([item]);
+			}
+		} else {
+			result.push(item);
+		}
+	}
+
+	return result;
+}
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/RestrictionsPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/RestrictionsPlugin.js
new file mode 100644
index 0000000..1d87a5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/RestrictionsPlugin.js
@@ -0,0 +1,65 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+const slashCode = "/".charCodeAt(0);
+const backslashCode = "\\".charCodeAt(0);
+
+const isInside = (path, parent) => {
+	if (!path.startsWith(parent)) return false;
+	if (path.length === parent.length) return true;
+	const charCode = path.charCodeAt(parent.length);
+	return charCode === slashCode || charCode === backslashCode;
+};
+
+module.exports = class RestrictionsPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {Set<string | RegExp>} restrictions restrictions
+	 */
+	constructor(source, restrictions) {
+		this.source = source;
+		this.restrictions = restrictions;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		resolver
+			.getHook(this.source)
+			.tapAsync("RestrictionsPlugin", (request, resolveContext, callback) => {
+				if (typeof request.path === "string") {
+					const path = request.path;
+					for (const rule of this.restrictions) {
+						if (typeof rule === "string") {
+							if (!isInside(path, rule)) {
+								if (resolveContext.log) {
+									resolveContext.log(
+										`${path} is not inside of the restriction ${rule}`
+									);
+								}
+								return callback(null, null);
+							}
+						} else if (!rule.test(path)) {
+							if (resolveContext.log) {
+								resolveContext.log(
+									`${path} doesn't match the restriction ${rule}`
+								);
+							}
+							return callback(null, null);
+						}
+					}
+				}
+
+				callback();
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ResultPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ResultPlugin.js
new file mode 100644
index 0000000..e25c43f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/ResultPlugin.js
@@ -0,0 +1,42 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class ResultPlugin {
+	/**
+	 * @param {ResolveStepHook} source source
+	 */
+	constructor(source) {
+		this.source = source;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		this.source.tapAsync(
+			"ResultPlugin",
+			(request, resolverContext, callback) => {
+				const obj = { ...request };
+				if (resolverContext.log)
+					resolverContext.log("reporting result " + obj.path);
+				resolver.hooks.result.callAsync(obj, resolverContext, err => {
+					if (err) return callback(err);
+					if (typeof resolverContext.yield === "function") {
+						resolverContext.yield(obj);
+						callback(null, null);
+					} else {
+						callback(null, obj);
+					}
+				});
+			}
+		);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/RootsPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/RootsPlugin.js
new file mode 100644
index 0000000..ba495a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/RootsPlugin.js
@@ -0,0 +1,62 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const forEachBail = require("./forEachBail");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+class RootsPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source hook
+	 * @param {Set<string>} roots roots
+	 * @param {string | ResolveStepHook} target target hook
+	 */
+	constructor(source, roots, target) {
+		this.roots = Array.from(roots);
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+
+		resolver
+			.getHook(this.source)
+			.tapAsync("RootsPlugin", (request, resolveContext, callback) => {
+				const req = request.request;
+				if (!req) return callback();
+				if (!req.startsWith("/")) return callback();
+
+				forEachBail(
+					this.roots,
+					(root, callback) => {
+						const path = resolver.join(root, req.slice(1));
+						const obj = {
+							...request,
+							path,
+							relativePath: request.relativePath && path
+						};
+						resolver.doResolve(
+							target,
+							obj,
+							`root path ${root}`,
+							resolveContext,
+							callback
+						);
+					},
+					callback
+				);
+			});
+	}
+}
+
+module.exports = RootsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SelfReferencePlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SelfReferencePlugin.js
new file mode 100644
index 0000000..984f25a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SelfReferencePlugin.js
@@ -0,0 +1,80 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DescriptionFileUtils = require("./DescriptionFileUtils");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+const slashCode = "/".charCodeAt(0);
+
+module.exports = class SelfReferencePlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | string[]} fieldNamePath name path
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, fieldNamePath, target) {
+		this.source = source;
+		this.target = target;
+		this.fieldName = fieldNamePath;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("SelfReferencePlugin", (request, resolveContext, callback) => {
+				if (!request.descriptionFilePath) return callback();
+
+				const req = request.request;
+				if (!req) return callback();
+
+				// Feature is only enabled when an exports field is present
+				const exportsField = DescriptionFileUtils.getField(
+					request.descriptionFileData,
+					this.fieldName
+				);
+				if (!exportsField) return callback();
+
+				const name = DescriptionFileUtils.getField(
+					request.descriptionFileData,
+					"name"
+				);
+				if (typeof name !== "string") return callback();
+
+				if (
+					req.startsWith(name) &&
+					(req.length === name.length ||
+						req.charCodeAt(name.length) === slashCode)
+				) {
+					const remainingRequest = `.${req.slice(name.length)}`;
+
+					const obj = {
+						...request,
+						request: remainingRequest,
+						path: /** @type {string} */ (request.descriptionFileRoot),
+						relativePath: "."
+					};
+
+					resolver.doResolve(
+						target,
+						obj,
+						"self reference",
+						resolveContext,
+						callback
+					);
+				} else {
+					return callback();
+				}
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SymlinkPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SymlinkPlugin.js
new file mode 100644
index 0000000..2d36f09
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SymlinkPlugin.js
@@ -0,0 +1,88 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const forEachBail = require("./forEachBail");
+const getPaths = require("./getPaths");
+const { getType, PathType } = require("./util/path");
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class SymlinkPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, target) {
+		this.source = source;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		const fs = resolver.fileSystem;
+		resolver
+			.getHook(this.source)
+			.tapAsync("SymlinkPlugin", (request, resolveContext, callback) => {
+				if (request.ignoreSymlinks) return callback();
+				const pathsResult = getPaths(request.path);
+				const pathSegments = pathsResult.segments;
+				const paths = pathsResult.paths;
+
+				let containsSymlink = false;
+				let idx = -1;
+				forEachBail(
+					paths,
+					(path, callback) => {
+						idx++;
+						if (resolveContext.fileDependencies)
+							resolveContext.fileDependencies.add(path);
+						fs.readlink(path, (err, result) => {
+							if (!err && result) {
+								pathSegments[idx] = result;
+								containsSymlink = true;
+								// Shortcut when absolute symlink found
+								const resultType = getType(result.toString());
+								if (
+									resultType === PathType.AbsoluteWin ||
+									resultType === PathType.AbsolutePosix
+								) {
+									return callback(null, idx);
+								}
+							}
+							callback();
+						});
+					},
+					(err, idx) => {
+						if (!containsSymlink) return callback();
+						const resultSegments =
+							typeof idx === "number"
+								? pathSegments.slice(0, idx + 1)
+								: pathSegments.slice();
+						const result = resultSegments.reduceRight((a, b) => {
+							return resolver.join(a, b);
+						});
+						const obj = {
+							...request,
+							path: result
+						};
+						resolver.doResolve(
+							target,
+							obj,
+							"resolved symlink to " + result,
+							resolveContext,
+							callback
+						);
+					}
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SyncAsyncFileSystemDecorator.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SyncAsyncFileSystemDecorator.js
new file mode 100644
index 0000000..ee9116f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/SyncAsyncFileSystemDecorator.js
@@ -0,0 +1,95 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver").FileSystem} FileSystem */
+/** @typedef {import("./Resolver").SyncFileSystem} SyncFileSystem */
+
+/**
+ * @param {SyncFileSystem} fs file system implementation
+ * @constructor
+ */
+function SyncAsyncFileSystemDecorator(fs) {
+	this.fs = fs;
+
+	this.lstat = undefined;
+	this.lstatSync = undefined;
+	const lstatSync = fs.lstatSync;
+	if (lstatSync) {
+		this.lstat = (arg, options, callback) => {
+			let result;
+			try {
+				result = lstatSync.call(fs, arg);
+			} catch (e) {
+				return (callback || options)(e);
+			}
+			(callback || options)(null, result);
+		};
+		this.lstatSync = (arg, options) => lstatSync.call(fs, arg, options);
+	}
+
+	this.stat = (arg, options, callback) => {
+		let result;
+		try {
+			result = callback ? fs.statSync(arg, options) : fs.statSync(arg);
+		} catch (e) {
+			return (callback || options)(e);
+		}
+		(callback || options)(null, result);
+	};
+	this.statSync = (arg, options) => fs.statSync(arg, options);
+
+	this.readdir = (arg, options, callback) => {
+		let result;
+		try {
+			result = fs.readdirSync(arg);
+		} catch (e) {
+			return (callback || options)(e);
+		}
+		(callback || options)(null, result);
+	};
+	this.readdirSync = (arg, options) => fs.readdirSync(arg, options);
+
+	this.readFile = (arg, options, callback) => {
+		let result;
+		try {
+			result = fs.readFileSync(arg);
+		} catch (e) {
+			return (callback || options)(e);
+		}
+		(callback || options)(null, result);
+	};
+	this.readFileSync = (arg, options) => fs.readFileSync(arg, options);
+
+	this.readlink = (arg, options, callback) => {
+		let result;
+		try {
+			result = fs.readlinkSync(arg);
+		} catch (e) {
+			return (callback || options)(e);
+		}
+		(callback || options)(null, result);
+	};
+	this.readlinkSync = (arg, options) => fs.readlinkSync(arg, options);
+
+	this.readJson = undefined;
+	this.readJsonSync = undefined;
+	const readJsonSync = fs.readJsonSync;
+	if (readJsonSync) {
+		this.readJson = (arg, options, callback) => {
+			let result;
+			try {
+				result = readJsonSync.call(fs, arg);
+			} catch (e) {
+				return (callback || options)(e);
+			}
+			(callback || options)(null, result);
+		};
+
+		this.readJsonSync = (arg, options) => readJsonSync.call(fs, arg, options);
+	}
+}
+module.exports = SyncAsyncFileSystemDecorator;
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/TryNextPlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/TryNextPlugin.js
new file mode 100644
index 0000000..1b70bef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/TryNextPlugin.js
@@ -0,0 +1,41 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class TryNextPlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string} message message
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, message, target) {
+		this.source = source;
+		this.message = message;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("TryNextPlugin", (request, resolveContext, callback) => {
+				resolver.doResolve(
+					target,
+					request,
+					this.message,
+					resolveContext,
+					callback
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/UnsafeCachePlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/UnsafeCachePlugin.js
new file mode 100644
index 0000000..a2f07f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/UnsafeCachePlugin.js
@@ -0,0 +1,99 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveRequest} ResolveRequest */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+/** @typedef {{[k: string]: any}} Cache */
+
+function getCacheId(type, request, withContext) {
+	return JSON.stringify({
+		type,
+		context: withContext ? request.context : "",
+		path: request.path,
+		query: request.query,
+		fragment: request.fragment,
+		request: request.request
+	});
+}
+
+module.exports = class UnsafeCachePlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {function(ResolveRequest): boolean} filterPredicate filterPredicate
+	 * @param {Cache} cache cache
+	 * @param {boolean} withContext withContext
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, filterPredicate, cache, withContext, target) {
+		this.source = source;
+		this.filterPredicate = filterPredicate;
+		this.withContext = withContext;
+		this.cache = cache;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("UnsafeCachePlugin", (request, resolveContext, callback) => {
+				if (!this.filterPredicate(request)) return callback();
+				const isYield = typeof resolveContext.yield === "function";
+				const cacheId = getCacheId(
+					isYield ? "yield" : "default",
+					request,
+					this.withContext
+				);
+				const cacheEntry = this.cache[cacheId];
+				if (cacheEntry) {
+					if (isYield) {
+						const yield_ = /** @type {Function} */ (resolveContext.yield);
+						if (Array.isArray(cacheEntry)) {
+							for (const result of cacheEntry) yield_(result);
+						} else {
+							yield_(cacheEntry);
+						}
+						return callback(null, null);
+					}
+					return callback(null, cacheEntry);
+				}
+
+				let yieldFn;
+				let yield_;
+				const yieldResult = [];
+				if (isYield) {
+					yieldFn = resolveContext.yield;
+					yield_ = result => {
+						yieldResult.push(result);
+					};
+				}
+
+				resolver.doResolve(
+					target,
+					request,
+					null,
+					yield_ ? { ...resolveContext, yield: yield_ } : resolveContext,
+					(err, result) => {
+						if (err) return callback(err);
+						if (isYield) {
+							if (result) yieldResult.push(result);
+							for (const result of yieldResult) yieldFn(result);
+							this.cache[cacheId] = yieldResult;
+							return callback(null, null);
+						}
+						if (result) return callback(null, (this.cache[cacheId] = result));
+						callback();
+					}
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/UseFilePlugin.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/UseFilePlugin.js
new file mode 100644
index 0000000..3d664d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/UseFilePlugin.js
@@ -0,0 +1,49 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").ResolveStepHook} ResolveStepHook */
+
+module.exports = class UseFilePlugin {
+	/**
+	 * @param {string | ResolveStepHook} source source
+	 * @param {string} filename filename
+	 * @param {string | ResolveStepHook} target target
+	 */
+	constructor(source, filename, target) {
+		this.source = source;
+		this.filename = filename;
+		this.target = target;
+	}
+
+	/**
+	 * @param {Resolver} resolver the resolver
+	 * @returns {void}
+	 */
+	apply(resolver) {
+		const target = resolver.ensureHook(this.target);
+		resolver
+			.getHook(this.source)
+			.tapAsync("UseFilePlugin", (request, resolveContext, callback) => {
+				const filePath = resolver.join(request.path, this.filename);
+				const obj = {
+					...request,
+					path: filePath,
+					relativePath:
+						request.relativePath &&
+						resolver.join(request.relativePath, this.filename)
+				};
+				resolver.doResolve(
+					target,
+					obj,
+					"using path: " + filePath,
+					resolveContext,
+					callback
+				);
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/createInnerContext.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/createInnerContext.js
new file mode 100644
index 0000000..0529356
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/createInnerContext.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+module.exports = function createInnerContext(
+	options,
+	message,
+	messageOptional
+) {
+	let messageReported = false;
+	let innerLog = undefined;
+	if (options.log) {
+		if (message) {
+			innerLog = msg => {
+				if (!messageReported) {
+					options.log(message);
+					messageReported = true;
+				}
+				options.log("  " + msg);
+			};
+		} else {
+			innerLog = options.log;
+		}
+	}
+	const childContext = {
+		log: innerLog,
+		yield: options.yield,
+		fileDependencies: options.fileDependencies,
+		contextDependencies: options.contextDependencies,
+		missingDependencies: options.missingDependencies,
+		stack: options.stack
+	};
+	return childContext;
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/forEachBail.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/forEachBail.js
new file mode 100644
index 0000000..031a562
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/forEachBail.js
@@ -0,0 +1,25 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+module.exports = function forEachBail(array, iterator, callback) {
+	if (array.length === 0) return callback();
+
+	let i = 0;
+	const next = () => {
+		let loop = undefined;
+		iterator(array[i++], (err, result) => {
+			if (err || result !== undefined || i >= array.length) {
+				return callback(err, result);
+			}
+			if (loop === false) while (next());
+			loop = true;
+		});
+		if (!loop) loop = false;
+		return loop;
+	};
+	while (next());
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/getInnerRequest.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/getInnerRequest.js
new file mode 100644
index 0000000..0475814
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/getInnerRequest.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+module.exports = function getInnerRequest(resolver, request) {
+	if (
+		typeof request.__innerRequest === "string" &&
+		request.__innerRequest_request === request.request &&
+		request.__innerRequest_relativePath === request.relativePath
+	)
+		return request.__innerRequest;
+	let innerRequest;
+	if (request.request) {
+		innerRequest = request.request;
+		if (/^\.\.?(?:\/|$)/.test(innerRequest) && request.relativePath) {
+			innerRequest = resolver.join(request.relativePath, innerRequest);
+		}
+	} else {
+		innerRequest = request.relativePath;
+	}
+	request.__innerRequest_request = request.request;
+	request.__innerRequest_relativePath = request.relativePath;
+	return (request.__innerRequest = innerRequest);
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/getPaths.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/getPaths.js
new file mode 100644
index 0000000..fad33e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/getPaths.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+module.exports = function getPaths(path) {
+	if (path === "/") return { paths: ["/"], segments: [""] };
+	const parts = path.split(/(.*?[\\/]+)/);
+	const paths = [path];
+	const segments = [parts[parts.length - 1]];
+	let part = parts[parts.length - 1];
+	path = path.substr(0, path.length - part.length - 1);
+	for (let i = parts.length - 2; i > 2; i -= 2) {
+		paths.push(path);
+		part = parts[i];
+		path = path.substr(0, path.length - part.length) || "/";
+		segments.push(part.substr(0, part.length - 1));
+	}
+	part = parts[1];
+	segments.push(part);
+	paths.push(part);
+	return {
+		paths: paths,
+		segments: segments
+	};
+};
+
+module.exports.basename = function basename(path) {
+	const i = path.lastIndexOf("/"),
+		j = path.lastIndexOf("\\");
+	const p = i < 0 ? j : j < 0 ? i : i < j ? j : i;
+	if (p < 0) return null;
+	const s = path.substr(p + 1);
+	return s;
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/index.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/index.js
new file mode 100644
index 0000000..0a6f437
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/index.js
@@ -0,0 +1,131 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const fs = require("graceful-fs");
+const CachedInputFileSystem = require("./CachedInputFileSystem");
+const ResolverFactory = require("./ResolverFactory");
+
+/** @typedef {import("./PnpPlugin").PnpApiImpl} PnpApi */
+/** @typedef {import("./Resolver")} Resolver */
+/** @typedef {import("./Resolver").FileSystem} FileSystem */
+/** @typedef {import("./Resolver").ResolveContext} ResolveContext */
+/** @typedef {import("./Resolver").ResolveRequest} ResolveRequest */
+/** @typedef {import("./ResolverFactory").Plugin} Plugin */
+/** @typedef {import("./ResolverFactory").UserResolveOptions} ResolveOptions */
+
+const nodeFileSystem = new CachedInputFileSystem(fs, 4000);
+
+const nodeContext = {
+	environments: ["node+es3+es5+process+native"]
+};
+
+const asyncResolver = ResolverFactory.createResolver({
+	conditionNames: ["node"],
+	extensions: [".js", ".json", ".node"],
+	fileSystem: nodeFileSystem
+});
+function resolve(context, path, request, resolveContext, callback) {
+	if (typeof context === "string") {
+		callback = resolveContext;
+		resolveContext = request;
+		request = path;
+		path = context;
+		context = nodeContext;
+	}
+	if (typeof callback !== "function") {
+		callback = resolveContext;
+	}
+	asyncResolver.resolve(context, path, request, resolveContext, callback);
+}
+
+const syncResolver = ResolverFactory.createResolver({
+	conditionNames: ["node"],
+	extensions: [".js", ".json", ".node"],
+	useSyncFileSystemCalls: true,
+	fileSystem: nodeFileSystem
+});
+function resolveSync(context, path, request) {
+	if (typeof context === "string") {
+		request = path;
+		path = context;
+		context = nodeContext;
+	}
+	return syncResolver.resolveSync(context, path, request);
+}
+
+function create(options) {
+	options = {
+		fileSystem: nodeFileSystem,
+		...options
+	};
+	const resolver = ResolverFactory.createResolver(options);
+	return function (context, path, request, resolveContext, callback) {
+		if (typeof context === "string") {
+			callback = resolveContext;
+			resolveContext = request;
+			request = path;
+			path = context;
+			context = nodeContext;
+		}
+		if (typeof callback !== "function") {
+			callback = resolveContext;
+		}
+		resolver.resolve(context, path, request, resolveContext, callback);
+	};
+}
+
+function createSync(options) {
+	options = {
+		useSyncFileSystemCalls: true,
+		fileSystem: nodeFileSystem,
+		...options
+	};
+	const resolver = ResolverFactory.createResolver(options);
+	return function (context, path, request) {
+		if (typeof context === "string") {
+			request = path;
+			path = context;
+			context = nodeContext;
+		}
+		return resolver.resolveSync(context, path, request);
+	};
+}
+
+/**
+ * @template A
+ * @template B
+ * @param {A} obj input a
+ * @param {B} exports input b
+ * @returns {A & B} merged
+ */
+const mergeExports = (obj, exports) => {
+	const descriptors = Object.getOwnPropertyDescriptors(exports);
+	Object.defineProperties(obj, descriptors);
+	return /** @type {A & B} */ (Object.freeze(obj));
+};
+
+module.exports = mergeExports(resolve, {
+	get sync() {
+		return resolveSync;
+	},
+	create: mergeExports(create, {
+		get sync() {
+			return createSync;
+		}
+	}),
+	ResolverFactory,
+	CachedInputFileSystem,
+	get CloneBasenamePlugin() {
+		return require("./CloneBasenamePlugin");
+	},
+	get LogInfoPlugin() {
+		return require("./LogInfoPlugin");
+	},
+	get forEachBail() {
+		return require("./forEachBail");
+	}
+});
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/entrypoints.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/entrypoints.js
new file mode 100644
index 0000000..b925d62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/entrypoints.js
@@ -0,0 +1,667 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+/** @typedef {string|(string|ConditionalMapping)[]} DirectMapping */
+/** @typedef {{[k: string]: MappingValue}} ConditionalMapping */
+/** @typedef {ConditionalMapping|DirectMapping|null} MappingValue */
+/** @typedef {Record<string, MappingValue>|ConditionalMapping|DirectMapping} ExportsField */
+/** @typedef {Record<string, MappingValue>} ImportsField */
+
+/**
+ * @typedef {Object} PathTreeNode
+ * @property {Map<string, PathTreeNode>|null} children
+ * @property {MappingValue} folder
+ * @property {Map<string, MappingValue>|null} wildcards
+ * @property {Map<string, MappingValue>} files
+ */
+
+/**
+ * Processing exports/imports field
+ * @callback FieldProcessor
+ * @param {string} request request
+ * @param {Set<string>} conditionNames condition names
+ * @returns {string[]} resolved paths
+ */
+
+/*
+Example exports field:
+{
+  ".": "./main.js",
+  "./feature": {
+    "browser": "./feature-browser.js",
+    "default": "./feature.js"
+  }
+}
+Terminology:
+
+Enhanced-resolve name keys ("." and "./feature") as exports field keys.
+
+If value is string or string[], mapping is called as a direct mapping
+and value called as a direct export.
+
+If value is key-value object, mapping is called as a conditional mapping
+and value called as a conditional export.
+
+Key in conditional mapping is called condition name.
+
+Conditional mapping nested in another conditional mapping is called nested mapping.
+
+----------
+
+Example imports field:
+{
+  "#a": "./main.js",
+  "#moment": {
+    "browser": "./moment/index.js",
+    "default": "moment"
+  },
+  "#moment/": {
+    "browser": "./moment/",
+    "default": "moment/"
+  }
+}
+Terminology:
+
+Enhanced-resolve name keys ("#a" and "#moment/", "#moment") as imports field keys.
+
+If value is string or string[], mapping is called as a direct mapping
+and value called as a direct export.
+
+If value is key-value object, mapping is called as a conditional mapping
+and value called as a conditional export.
+
+Key in conditional mapping is called condition name.
+
+Conditional mapping nested in another conditional mapping is called nested mapping.
+
+*/
+
+const slashCode = "/".charCodeAt(0);
+const dotCode = ".".charCodeAt(0);
+const hashCode = "#".charCodeAt(0);
+
+/**
+ * @param {ExportsField} exportsField the exports field
+ * @returns {FieldProcessor} process callback
+ */
+module.exports.processExportsField = function processExportsField(
+	exportsField
+) {
+	return createFieldProcessor(
+		buildExportsFieldPathTree(exportsField),
+		assertExportsFieldRequest,
+		assertExportTarget
+	);
+};
+
+/**
+ * @param {ImportsField} importsField the exports field
+ * @returns {FieldProcessor} process callback
+ */
+module.exports.processImportsField = function processImportsField(
+	importsField
+) {
+	return createFieldProcessor(
+		buildImportsFieldPathTree(importsField),
+		assertImportsFieldRequest,
+		assertImportTarget
+	);
+};
+
+/**
+ * @param {PathTreeNode} treeRoot root
+ * @param {(s: string) => string} assertRequest assertRequest
+ * @param {(s: string, f: boolean) => void} assertTarget assertTarget
+ * @returns {FieldProcessor} field processor
+ */
+function createFieldProcessor(treeRoot, assertRequest, assertTarget) {
+	return function fieldProcessor(request, conditionNames) {
+		request = assertRequest(request);
+
+		const match = findMatch(request, treeRoot);
+
+		if (match === null) return [];
+
+		const [mapping, remainRequestIndex] = match;
+
+		/** @type {DirectMapping|null} */
+		let direct = null;
+
+		if (isConditionalMapping(mapping)) {
+			direct = conditionalMapping(
+				/** @type {ConditionalMapping} */ (mapping),
+				conditionNames
+			);
+
+			// matching not found
+			if (direct === null) return [];
+		} else {
+			direct = /** @type {DirectMapping} */ (mapping);
+		}
+
+		const remainingRequest =
+			remainRequestIndex === request.length + 1
+				? undefined
+				: remainRequestIndex < 0
+				? request.slice(-remainRequestIndex - 1)
+				: request.slice(remainRequestIndex);
+
+		return directMapping(
+			remainingRequest,
+			remainRequestIndex < 0,
+			direct,
+			conditionNames,
+			assertTarget
+		);
+	};
+}
+
+/**
+ * @param {string} request request
+ * @returns {string} updated request
+ */
+function assertExportsFieldRequest(request) {
+	if (request.charCodeAt(0) !== dotCode) {
+		throw new Error('Request should be relative path and start with "."');
+	}
+	if (request.length === 1) return "";
+	if (request.charCodeAt(1) !== slashCode) {
+		throw new Error('Request should be relative path and start with "./"');
+	}
+	if (request.charCodeAt(request.length - 1) === slashCode) {
+		throw new Error("Only requesting file allowed");
+	}
+
+	return request.slice(2);
+}
+
+/**
+ * @param {string} request request
+ * @returns {string} updated request
+ */
+function assertImportsFieldRequest(request) {
+	if (request.charCodeAt(0) !== hashCode) {
+		throw new Error('Request should start with "#"');
+	}
+	if (request.length === 1) {
+		throw new Error("Request should have at least 2 characters");
+	}
+	if (request.charCodeAt(1) === slashCode) {
+		throw new Error('Request should not start with "#/"');
+	}
+	if (request.charCodeAt(request.length - 1) === slashCode) {
+		throw new Error("Only requesting file allowed");
+	}
+
+	return request.slice(1);
+}
+
+/**
+ * @param {string} exp export target
+ * @param {boolean} expectFolder is folder expected
+ */
+function assertExportTarget(exp, expectFolder) {
+	if (
+		exp.charCodeAt(0) === slashCode ||
+		(exp.charCodeAt(0) === dotCode && exp.charCodeAt(1) !== slashCode)
+	) {
+		throw new Error(
+			`Export should be relative path and start with "./", got ${JSON.stringify(
+				exp
+			)}.`
+		);
+	}
+
+	const isFolder = exp.charCodeAt(exp.length - 1) === slashCode;
+
+	if (isFolder !== expectFolder) {
+		throw new Error(
+			expectFolder
+				? `Expecting folder to folder mapping. ${JSON.stringify(
+						exp
+				  )} should end with "/"`
+				: `Expecting file to file mapping. ${JSON.stringify(
+						exp
+				  )} should not end with "/"`
+		);
+	}
+}
+
+/**
+ * @param {string} imp import target
+ * @param {boolean} expectFolder is folder expected
+ */
+function assertImportTarget(imp, expectFolder) {
+	const isFolder = imp.charCodeAt(imp.length - 1) === slashCode;
+
+	if (isFolder !== expectFolder) {
+		throw new Error(
+			expectFolder
+				? `Expecting folder to folder mapping. ${JSON.stringify(
+						imp
+				  )} should end with "/"`
+				: `Expecting file to file mapping. ${JSON.stringify(
+						imp
+				  )} should not end with "/"`
+		);
+	}
+}
+
+/**
+ * Trying to match request to field
+ * @param {string} request request
+ * @param {PathTreeNode} treeRoot path tree root
+ * @returns {[MappingValue, number]|null} match or null, number is negative and one less when it's a folder mapping, number is request.length + 1 for direct mappings
+ */
+function findMatch(request, treeRoot) {
+	if (request.length === 0) {
+		const value = treeRoot.files.get("");
+
+		return value ? [value, 1] : null;
+	}
+
+	if (
+		treeRoot.children === null &&
+		treeRoot.folder === null &&
+		treeRoot.wildcards === null
+	) {
+		const value = treeRoot.files.get(request);
+
+		return value ? [value, request.length + 1] : null;
+	}
+
+	let node = treeRoot;
+	let lastNonSlashIndex = 0;
+	let slashIndex = request.indexOf("/", 0);
+
+	/** @type {[MappingValue, number]|null} */
+	let lastFolderMatch = null;
+
+	const applyFolderMapping = () => {
+		const folderMapping = node.folder;
+		if (folderMapping) {
+			if (lastFolderMatch) {
+				lastFolderMatch[0] = folderMapping;
+				lastFolderMatch[1] = -lastNonSlashIndex - 1;
+			} else {
+				lastFolderMatch = [folderMapping, -lastNonSlashIndex - 1];
+			}
+		}
+	};
+
+	const applyWildcardMappings = (wildcardMappings, remainingRequest) => {
+		if (wildcardMappings) {
+			for (const [key, target] of wildcardMappings) {
+				if (remainingRequest.startsWith(key)) {
+					if (!lastFolderMatch) {
+						lastFolderMatch = [target, lastNonSlashIndex + key.length];
+					} else if (lastFolderMatch[1] < lastNonSlashIndex + key.length) {
+						lastFolderMatch[0] = target;
+						lastFolderMatch[1] = lastNonSlashIndex + key.length;
+					}
+				}
+			}
+		}
+	};
+
+	while (slashIndex !== -1) {
+		applyFolderMapping();
+
+		const wildcardMappings = node.wildcards;
+
+		if (!wildcardMappings && node.children === null) return lastFolderMatch;
+
+		const folder = request.slice(lastNonSlashIndex, slashIndex);
+
+		applyWildcardMappings(wildcardMappings, folder);
+
+		if (node.children === null) return lastFolderMatch;
+
+		const newNode = node.children.get(folder);
+
+		if (!newNode) {
+			return lastFolderMatch;
+		}
+
+		node = newNode;
+		lastNonSlashIndex = slashIndex + 1;
+		slashIndex = request.indexOf("/", lastNonSlashIndex);
+	}
+
+	const remainingRequest =
+		lastNonSlashIndex > 0 ? request.slice(lastNonSlashIndex) : request;
+
+	const value = node.files.get(remainingRequest);
+
+	if (value) {
+		return [value, request.length + 1];
+	}
+
+	applyFolderMapping();
+
+	applyWildcardMappings(node.wildcards, remainingRequest);
+
+	return lastFolderMatch;
+}
+
+/**
+ * @param {ConditionalMapping|DirectMapping|null} mapping mapping
+ * @returns {boolean} is conditional mapping
+ */
+function isConditionalMapping(mapping) {
+	return (
+		mapping !== null && typeof mapping === "object" && !Array.isArray(mapping)
+	);
+}
+
+/**
+ * @param {string|undefined} remainingRequest remaining request when folder mapping, undefined for file mappings
+ * @param {boolean} subpathMapping true, for subpath mappings
+ * @param {DirectMapping|null} mappingTarget direct export
+ * @param {Set<string>} conditionNames condition names
+ * @param {(d: string, f: boolean) => void} assert asserting direct value
+ * @returns {string[]} mapping result
+ */
+function directMapping(
+	remainingRequest,
+	subpathMapping,
+	mappingTarget,
+	conditionNames,
+	assert
+) {
+	if (mappingTarget === null) return [];
+
+	if (typeof mappingTarget === "string") {
+		return [
+			targetMapping(remainingRequest, subpathMapping, mappingTarget, assert)
+		];
+	}
+
+	const targets = [];
+
+	for (const exp of mappingTarget) {
+		if (typeof exp === "string") {
+			targets.push(
+				targetMapping(remainingRequest, subpathMapping, exp, assert)
+			);
+			continue;
+		}
+
+		const mapping = conditionalMapping(exp, conditionNames);
+		if (!mapping) continue;
+		const innerExports = directMapping(
+			remainingRequest,
+			subpathMapping,
+			mapping,
+			conditionNames,
+			assert
+		);
+		for (const innerExport of innerExports) {
+			targets.push(innerExport);
+		}
+	}
+
+	return targets;
+}
+
+/**
+ * @param {string|undefined} remainingRequest remaining request when folder mapping, undefined for file mappings
+ * @param {boolean} subpathMapping true, for subpath mappings
+ * @param {string} mappingTarget direct export
+ * @param {(d: string, f: boolean) => void} assert asserting direct value
+ * @returns {string} mapping result
+ */
+function targetMapping(
+	remainingRequest,
+	subpathMapping,
+	mappingTarget,
+	assert
+) {
+	if (remainingRequest === undefined) {
+		assert(mappingTarget, false);
+		return mappingTarget;
+	}
+	if (subpathMapping) {
+		assert(mappingTarget, true);
+		return mappingTarget + remainingRequest;
+	}
+	assert(mappingTarget, false);
+	return mappingTarget.replace(/\*/g, remainingRequest.replace(/\$/g, "$$"));
+}
+
+/**
+ * @param {ConditionalMapping} conditionalMapping_ conditional mapping
+ * @param {Set<string>} conditionNames condition names
+ * @returns {DirectMapping|null} direct mapping if found
+ */
+function conditionalMapping(conditionalMapping_, conditionNames) {
+	/** @type {[ConditionalMapping, string[], number][]} */
+	let lookup = [[conditionalMapping_, Object.keys(conditionalMapping_), 0]];
+
+	loop: while (lookup.length > 0) {
+		const [mapping, conditions, j] = lookup[lookup.length - 1];
+		const last = conditions.length - 1;
+
+		for (let i = j; i < conditions.length; i++) {
+			const condition = conditions[i];
+
+			// assert default. Could be last only
+			if (i !== last) {
+				if (condition === "default") {
+					throw new Error("Default condition should be last one");
+				}
+			} else if (condition === "default") {
+				const innerMapping = mapping[condition];
+				// is nested
+				if (isConditionalMapping(innerMapping)) {
+					const conditionalMapping = /** @type {ConditionalMapping} */ (innerMapping);
+					lookup[lookup.length - 1][2] = i + 1;
+					lookup.push([conditionalMapping, Object.keys(conditionalMapping), 0]);
+					continue loop;
+				}
+
+				return /** @type {DirectMapping} */ (innerMapping);
+			}
+
+			if (conditionNames.has(condition)) {
+				const innerMapping = mapping[condition];
+				// is nested
+				if (isConditionalMapping(innerMapping)) {
+					const conditionalMapping = /** @type {ConditionalMapping} */ (innerMapping);
+					lookup[lookup.length - 1][2] = i + 1;
+					lookup.push([conditionalMapping, Object.keys(conditionalMapping), 0]);
+					continue loop;
+				}
+
+				return /** @type {DirectMapping} */ (innerMapping);
+			}
+		}
+
+		lookup.pop();
+	}
+
+	return null;
+}
+
+/**
+ * Internal helper to create path tree node
+ * to ensure that each node gets the same hidden class
+ * @returns {PathTreeNode} node
+ */
+function createNode() {
+	return {
+		children: null,
+		folder: null,
+		wildcards: null,
+		files: new Map()
+	};
+}
+
+/**
+ * Internal helper for building path tree
+ * @param {PathTreeNode} root root
+ * @param {string} path path
+ * @param {MappingValue} target target
+ */
+function walkPath(root, path, target) {
+	if (path.length === 0) {
+		root.folder = target;
+		return;
+	}
+
+	let node = root;
+	// Typical path tree can looks like
+	// root
+	// - files: ["a.js", "b.js"]
+	// - children:
+	//    node1:
+	//    - files: ["a.js", "b.js"]
+	let lastNonSlashIndex = 0;
+	let slashIndex = path.indexOf("/", 0);
+
+	while (slashIndex !== -1) {
+		const folder = path.slice(lastNonSlashIndex, slashIndex);
+		let newNode;
+
+		if (node.children === null) {
+			newNode = createNode();
+			node.children = new Map();
+			node.children.set(folder, newNode);
+		} else {
+			newNode = node.children.get(folder);
+
+			if (!newNode) {
+				newNode = createNode();
+				node.children.set(folder, newNode);
+			}
+		}
+
+		node = newNode;
+		lastNonSlashIndex = slashIndex + 1;
+		slashIndex = path.indexOf("/", lastNonSlashIndex);
+	}
+
+	if (lastNonSlashIndex >= path.length) {
+		node.folder = target;
+	} else {
+		const file = lastNonSlashIndex > 0 ? path.slice(lastNonSlashIndex) : path;
+		if (file.endsWith("*")) {
+			if (node.wildcards === null) node.wildcards = new Map();
+			node.wildcards.set(file.slice(0, -1), target);
+		} else {
+			node.files.set(file, target);
+		}
+	}
+}
+
+/**
+ * @param {ExportsField} field exports field
+ * @returns {PathTreeNode} tree root
+ */
+function buildExportsFieldPathTree(field) {
+	const root = createNode();
+
+	// handle syntax sugar, if exports field is direct mapping for "."
+	if (typeof field === "string") {
+		root.files.set("", field);
+
+		return root;
+	} else if (Array.isArray(field)) {
+		root.files.set("", field.slice());
+
+		return root;
+	}
+
+	const keys = Object.keys(field);
+
+	for (let i = 0; i < keys.length; i++) {
+		const key = keys[i];
+
+		if (key.charCodeAt(0) !== dotCode) {
+			// handle syntax sugar, if exports field is conditional mapping for "."
+			if (i === 0) {
+				while (i < keys.length) {
+					const charCode = keys[i].charCodeAt(0);
+					if (charCode === dotCode || charCode === slashCode) {
+						throw new Error(
+							`Exports field key should be relative path and start with "." (key: ${JSON.stringify(
+								key
+							)})`
+						);
+					}
+					i++;
+				}
+
+				root.files.set("", field);
+				return root;
+			}
+
+			throw new Error(
+				`Exports field key should be relative path and start with "." (key: ${JSON.stringify(
+					key
+				)})`
+			);
+		}
+
+		if (key.length === 1) {
+			root.files.set("", field[key]);
+			continue;
+		}
+
+		if (key.charCodeAt(1) !== slashCode) {
+			throw new Error(
+				`Exports field key should be relative path and start with "./" (key: ${JSON.stringify(
+					key
+				)})`
+			);
+		}
+
+		walkPath(root, key.slice(2), field[key]);
+	}
+
+	return root;
+}
+
+/**
+ * @param {ImportsField} field imports field
+ * @returns {PathTreeNode} root
+ */
+function buildImportsFieldPathTree(field) {
+	const root = createNode();
+
+	const keys = Object.keys(field);
+
+	for (let i = 0; i < keys.length; i++) {
+		const key = keys[i];
+
+		if (key.charCodeAt(0) !== hashCode) {
+			throw new Error(
+				`Imports field key should start with "#" (key: ${JSON.stringify(key)})`
+			);
+		}
+
+		if (key.length === 1) {
+			throw new Error(
+				`Imports field key should have at least 2 characters (key: ${JSON.stringify(
+					key
+				)})`
+			);
+		}
+
+		if (key.charCodeAt(1) === slashCode) {
+			throw new Error(
+				`Imports field key should not start with "#/" (key: ${JSON.stringify(
+					key
+				)})`
+			);
+		}
+
+		walkPath(root, key.slice(1), field[key]);
+	}
+
+	return root;
+}
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/identifier.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/identifier.js
new file mode 100644
index 0000000..0c29ae4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/identifier.js
@@ -0,0 +1,26 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const PATH_QUERY_FRAGMENT_REGEXP = /^(#?(?:\0.|[^?#\0])*)(\?(?:\0.|[^#\0])*)?(#.*)?$/;
+
+/**
+ * @param {string} identifier identifier
+ * @returns {[string, string, string]|null} parsed identifier
+ */
+function parseIdentifier(identifier) {
+	const match = PATH_QUERY_FRAGMENT_REGEXP.exec(identifier);
+
+	if (!match) return null;
+
+	return [
+		match[1].replace(/\0(.)/g, "$1"),
+		match[2] ? match[2].replace(/\0(.)/g, "$1") : "",
+		match[3] || ""
+	];
+}
+
+module.exports.parseIdentifier = parseIdentifier;
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/path.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/path.js
new file mode 100644
index 0000000..b84c146
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/path.js
@@ -0,0 +1,221 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const path = require("path");
+
+const CHAR_HASH = "#".charCodeAt(0);
+const CHAR_SLASH = "/".charCodeAt(0);
+const CHAR_BACKSLASH = "\\".charCodeAt(0);
+const CHAR_A = "A".charCodeAt(0);
+const CHAR_Z = "Z".charCodeAt(0);
+const CHAR_LOWER_A = "a".charCodeAt(0);
+const CHAR_LOWER_Z = "z".charCodeAt(0);
+const CHAR_DOT = ".".charCodeAt(0);
+const CHAR_COLON = ":".charCodeAt(0);
+
+const posixNormalize = path.posix.normalize;
+const winNormalize = path.win32.normalize;
+
+/**
+ * @enum {number}
+ */
+const PathType = Object.freeze({
+	Empty: 0,
+	Normal: 1,
+	Relative: 2,
+	AbsoluteWin: 3,
+	AbsolutePosix: 4,
+	Internal: 5
+});
+exports.PathType = PathType;
+
+/**
+ * @param {string} p a path
+ * @returns {PathType} type of path
+ */
+const getType = p => {
+	switch (p.length) {
+		case 0:
+			return PathType.Empty;
+		case 1: {
+			const c0 = p.charCodeAt(0);
+			switch (c0) {
+				case CHAR_DOT:
+					return PathType.Relative;
+				case CHAR_SLASH:
+					return PathType.AbsolutePosix;
+				case CHAR_HASH:
+					return PathType.Internal;
+			}
+			return PathType.Normal;
+		}
+		case 2: {
+			const c0 = p.charCodeAt(0);
+			switch (c0) {
+				case CHAR_DOT: {
+					const c1 = p.charCodeAt(1);
+					switch (c1) {
+						case CHAR_DOT:
+						case CHAR_SLASH:
+							return PathType.Relative;
+					}
+					return PathType.Normal;
+				}
+				case CHAR_SLASH:
+					return PathType.AbsolutePosix;
+				case CHAR_HASH:
+					return PathType.Internal;
+			}
+			const c1 = p.charCodeAt(1);
+			if (c1 === CHAR_COLON) {
+				if (
+					(c0 >= CHAR_A && c0 <= CHAR_Z) ||
+					(c0 >= CHAR_LOWER_A && c0 <= CHAR_LOWER_Z)
+				) {
+					return PathType.AbsoluteWin;
+				}
+			}
+			return PathType.Normal;
+		}
+	}
+	const c0 = p.charCodeAt(0);
+	switch (c0) {
+		case CHAR_DOT: {
+			const c1 = p.charCodeAt(1);
+			switch (c1) {
+				case CHAR_SLASH:
+					return PathType.Relative;
+				case CHAR_DOT: {
+					const c2 = p.charCodeAt(2);
+					if (c2 === CHAR_SLASH) return PathType.Relative;
+					return PathType.Normal;
+				}
+			}
+			return PathType.Normal;
+		}
+		case CHAR_SLASH:
+			return PathType.AbsolutePosix;
+		case CHAR_HASH:
+			return PathType.Internal;
+	}
+	const c1 = p.charCodeAt(1);
+	if (c1 === CHAR_COLON) {
+		const c2 = p.charCodeAt(2);
+		if (
+			(c2 === CHAR_BACKSLASH || c2 === CHAR_SLASH) &&
+			((c0 >= CHAR_A && c0 <= CHAR_Z) ||
+				(c0 >= CHAR_LOWER_A && c0 <= CHAR_LOWER_Z))
+		) {
+			return PathType.AbsoluteWin;
+		}
+	}
+	return PathType.Normal;
+};
+exports.getType = getType;
+
+/**
+ * @param {string} p a path
+ * @returns {string} the normalized path
+ */
+const normalize = p => {
+	switch (getType(p)) {
+		case PathType.Empty:
+			return p;
+		case PathType.AbsoluteWin:
+			return winNormalize(p);
+		case PathType.Relative: {
+			const r = posixNormalize(p);
+			return getType(r) === PathType.Relative ? r : `./${r}`;
+		}
+	}
+	return posixNormalize(p);
+};
+exports.normalize = normalize;
+
+/**
+ * @param {string} rootPath the root path
+ * @param {string | undefined} request the request path
+ * @returns {string} the joined path
+ */
+const join = (rootPath, request) => {
+	if (!request) return normalize(rootPath);
+	const requestType = getType(request);
+	switch (requestType) {
+		case PathType.AbsolutePosix:
+			return posixNormalize(request);
+		case PathType.AbsoluteWin:
+			return winNormalize(request);
+	}
+	switch (getType(rootPath)) {
+		case PathType.Normal:
+		case PathType.Relative:
+		case PathType.AbsolutePosix:
+			return posixNormalize(`${rootPath}/${request}`);
+		case PathType.AbsoluteWin:
+			return winNormalize(`${rootPath}\\${request}`);
+	}
+	switch (requestType) {
+		case PathType.Empty:
+			return rootPath;
+		case PathType.Relative: {
+			const r = posixNormalize(rootPath);
+			return getType(r) === PathType.Relative ? r : `./${r}`;
+		}
+	}
+	return posixNormalize(rootPath);
+};
+exports.join = join;
+
+const joinCache = new Map();
+
+/**
+ * @param {string} rootPath the root path
+ * @param {string | undefined} request the request path
+ * @returns {string} the joined path
+ */
+const cachedJoin = (rootPath, request) => {
+	let cacheEntry;
+	let cache = joinCache.get(rootPath);
+	if (cache === undefined) {
+		joinCache.set(rootPath, (cache = new Map()));
+	} else {
+		cacheEntry = cache.get(request);
+		if (cacheEntry !== undefined) return cacheEntry;
+	}
+	cacheEntry = join(rootPath, request);
+	cache.set(request, cacheEntry);
+	return cacheEntry;
+};
+exports.cachedJoin = cachedJoin;
+
+const checkExportsFieldTarget = relativePath => {
+	let lastNonSlashIndex = 2;
+	let slashIndex = relativePath.indexOf("/", 2);
+	let cd = 0;
+
+	while (slashIndex !== -1) {
+		const folder = relativePath.slice(lastNonSlashIndex, slashIndex);
+
+		switch (folder) {
+			case "..": {
+				cd--;
+				if (cd < 0)
+					return new Error(
+						`Trying to access out of package scope. Requesting ${relativePath}`
+					);
+				break;
+			}
+			default:
+				cd++;
+				break;
+		}
+
+		lastNonSlashIndex = slashIndex + 1;
+		slashIndex = relativePath.indexOf("/", lastNonSlashIndex);
+	}
+};
+exports.checkExportsFieldTarget = checkExportsFieldTarget;
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/process-browser.js b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/process-browser.js
new file mode 100644
index 0000000..277f729
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/lib/util/process-browser.js
@@ -0,0 +1,16 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+module.exports = {
+	versions: {},
+	nextTick(fn) {
+		const args = Array.prototype.slice.call(arguments, 1);
+		Promise.resolve().then(function () {
+			fn.apply(null, args);
+		});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/package.json b/node_modules/mathjs/examples/node_modules/enhanced-resolve/package.json
new file mode 100644
index 0000000..879a095
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/package.json
@@ -0,0 +1,70 @@
+{
+  "name": "enhanced-resolve",
+  "version": "5.9.2",
+  "author": "Tobias Koppers @sokra",
+  "description": "Offers a async require.resolve function. It's highly configurable.",
+  "files": [
+    "lib",
+    "types.d.ts",
+    "LICENSE"
+  ],
+  "browser": {
+    "pnpapi": false,
+    "process": "./lib/util/process-browser.js"
+  },
+  "dependencies": {
+    "graceful-fs": "^4.2.4",
+    "tapable": "^2.2.0"
+  },
+  "license": "MIT",
+  "devDependencies": {
+    "@types/mocha": "^8.0.3",
+    "@types/node": "^14.11.1",
+    "cspell": "4.2.8",
+    "eslint": "^7.9.0",
+    "eslint-config-prettier": "^6.11.0",
+    "eslint-plugin-jsdoc": "^30.5.1",
+    "eslint-plugin-node": "^11.1.0",
+    "eslint-plugin-prettier": "^3.1.4",
+    "husky": "^6.0.0",
+    "lint-staged": "^10.4.0",
+    "memfs": "^3.2.0",
+    "mocha": "^8.1.3",
+    "nyc": "^15.1.0",
+    "prettier": "^2.1.2",
+    "should": "^13.2.3",
+    "tooling": "webpack/tooling#v1.14.0",
+    "typescript": "^4.2.0-beta"
+  },
+  "engines": {
+    "node": ">=10.13.0"
+  },
+  "main": "lib/index.js",
+  "types": "types.d.ts",
+  "homepage": "http://github.com/webpack/enhanced-resolve",
+  "scripts": {
+    "lint": "yarn run code-lint && yarn run type-lint && yarn run special-lint && yarn run spelling",
+    "fix": "yarn run code-lint-fix && yarn run special-lint-fix",
+    "code-lint": "eslint --cache lib test",
+    "code-lint-fix": "eslint --cache lib test --fix",
+    "type-lint": "tsc",
+    "special-lint": "node node_modules/tooling/lockfile-lint && node node_modules/tooling/inherit-types && node node_modules/tooling/format-file-header && node node_modules/tooling/generate-types",
+    "special-lint-fix": "node node_modules/tooling/inherit-types --write && node node_modules/tooling/format-file-header --write && node node_modules/tooling/generate-types --write",
+    "pretty": "prettier --loglevel warn --write \"lib/**/*.{js,json}\" \"test/*.js\"",
+    "pretest": "yarn lint",
+    "spelling": "cspell \"**/*.*\"",
+    "test": "mocha --full-trace --check-leaks",
+    "test:only": "mocha --full-trace --check-leaks",
+    "precover": "yarn lint",
+    "cover": "nyc --reporter=html node node_modules/mocha/bin/_mocha --full-trace --check-leaks",
+    "cover:ci": "nyc --reporter=lcovonly node node_modules/mocha/bin/_mocha --full-trace --check-leaks",
+    "prepare": "husky install"
+  },
+  "lint-staged": {
+    "*.js": "eslint --cache"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/webpack/enhanced-resolve.git"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/enhanced-resolve/types.d.ts b/node_modules/mathjs/examples/node_modules/enhanced-resolve/types.d.ts
new file mode 100644
index 0000000..c418c89
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/enhanced-resolve/types.d.ts
@@ -0,0 +1,506 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+
+import { AsyncSeriesBailHook, AsyncSeriesHook, SyncHook } from "tapable";
+
+declare interface AliasOption {
+	alias: string | false | string[];
+	name: string;
+	onlyModule?: boolean;
+}
+type AliasOptionNewRequest = string | false | string[];
+declare interface AliasOptions {
+	[index: string]: AliasOptionNewRequest;
+}
+declare interface BaseResolveRequest {
+	path: string | false;
+	descriptionFilePath?: string;
+	descriptionFileRoot?: string;
+	descriptionFileData?: object;
+	relativePath?: string;
+	ignoreSymlinks?: boolean;
+	fullySpecified?: boolean;
+}
+declare class CachedInputFileSystem {
+	constructor(fileSystem?: any, duration?: any);
+	fileSystem: any;
+	lstat?: {
+		(arg0: string, arg1: FileSystemCallback<FileSystemStats>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	lstatSync?: (arg0: string, arg1?: object) => FileSystemStats;
+	stat: {
+		(arg0: string, arg1: FileSystemCallback<FileSystemStats>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	statSync: (arg0: string, arg1?: object) => FileSystemStats;
+	readdir: {
+		(
+			arg0: string,
+			arg1: FileSystemCallback<(string | Buffer)[] | FileSystemDirent[]>
+		): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<(string | Buffer)[] | FileSystemDirent[]>
+		): void;
+	};
+	readdirSync: (
+		arg0: string,
+		arg1?: object
+	) => (string | Buffer)[] | FileSystemDirent[];
+	readFile: {
+		(arg0: string, arg1: FileSystemCallback<string | Buffer>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	readFileSync: (arg0: string, arg1?: object) => string | Buffer;
+	readJson?: {
+		(arg0: string, arg1: FileSystemCallback<object>): void;
+		(arg0: string, arg1: object, arg2: FileSystemCallback<object>): void;
+	};
+	readJsonSync?: (arg0: string, arg1?: object) => object;
+	readlink: {
+		(arg0: string, arg1: FileSystemCallback<string | Buffer>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	readlinkSync: (arg0: string, arg1?: object) => string | Buffer;
+	purge(what?: any): void;
+}
+declare class CloneBasenamePlugin {
+	constructor(source?: any, target?: any);
+	source: any;
+	target: any;
+	apply(resolver: Resolver): void;
+}
+declare interface FileSystem {
+	readFile: {
+		(arg0: string, arg1: FileSystemCallback<string | Buffer>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	readdir: {
+		(
+			arg0: string,
+			arg1: FileSystemCallback<(string | Buffer)[] | FileSystemDirent[]>
+		): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<(string | Buffer)[] | FileSystemDirent[]>
+		): void;
+	};
+	readJson?: {
+		(arg0: string, arg1: FileSystemCallback<object>): void;
+		(arg0: string, arg1: object, arg2: FileSystemCallback<object>): void;
+	};
+	readlink: {
+		(arg0: string, arg1: FileSystemCallback<string | Buffer>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	lstat?: {
+		(arg0: string, arg1: FileSystemCallback<FileSystemStats>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	stat: {
+		(arg0: string, arg1: FileSystemCallback<FileSystemStats>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+}
+declare interface FileSystemCallback<T> {
+	(err?: null | (PossibleFileSystemError & Error), result?: T): any;
+}
+declare interface FileSystemDirent {
+	name: string | Buffer;
+	isDirectory: () => boolean;
+	isFile: () => boolean;
+}
+declare interface FileSystemStats {
+	isDirectory: () => boolean;
+	isFile: () => boolean;
+}
+declare class LogInfoPlugin {
+	constructor(source?: any);
+	source: any;
+	apply(resolver: Resolver): void;
+}
+declare interface ParsedIdentifier {
+	request: string;
+	query: string;
+	fragment: string;
+	directory: boolean;
+	module: boolean;
+	file: boolean;
+	internal: boolean;
+}
+type Plugin =
+	| { apply: (arg0: Resolver) => void }
+	| ((this: Resolver, arg1: Resolver) => void);
+declare interface PnpApiImpl {
+	resolveToUnqualified: (arg0: string, arg1: string, arg2: object) => string;
+}
+declare interface PossibleFileSystemError {
+	code?: string;
+	errno?: number;
+	path?: string;
+	syscall?: string;
+}
+
+/**
+ * Resolve context
+ */
+declare interface ResolveContext {
+	contextDependencies?: WriteOnlySet<string>;
+
+	/**
+	 * files that was found on file system
+	 */
+	fileDependencies?: WriteOnlySet<string>;
+
+	/**
+	 * dependencies that was not found on file system
+	 */
+	missingDependencies?: WriteOnlySet<string>;
+
+	/**
+	 * set of hooks' calls. For instance, `resolve → parsedResolve → describedResolve`,
+	 */
+	stack?: Set<string>;
+
+	/**
+	 * log function
+	 */
+	log?: (arg0: string) => void;
+
+	/**
+	 * yield result, if provided plugins can return several results
+	 */
+	yield?: (arg0: ResolveRequest) => void;
+}
+declare interface ResolveOptions {
+	alias: AliasOption[];
+	fallback: AliasOption[];
+	aliasFields: Set<string | string[]>;
+	cachePredicate: (arg0: ResolveRequest) => boolean;
+	cacheWithContext: boolean;
+
+	/**
+	 * A list of exports field condition names.
+	 */
+	conditionNames: Set<string>;
+	descriptionFiles: string[];
+	enforceExtension: boolean;
+	exportsFields: Set<string | string[]>;
+	importsFields: Set<string | string[]>;
+	extensions: Set<string>;
+	fileSystem: FileSystem;
+	unsafeCache: false | object;
+	symlinks: boolean;
+	resolver?: Resolver;
+	modules: (string | string[])[];
+	mainFields: { name: string[]; forceRelative: boolean }[];
+	mainFiles: Set<string>;
+	plugins: Plugin[];
+	pnpApi: null | PnpApiImpl;
+	roots: Set<string>;
+	fullySpecified: boolean;
+	resolveToContext: boolean;
+	restrictions: Set<string | RegExp>;
+	preferRelative: boolean;
+	preferAbsolute: boolean;
+}
+type ResolveRequest = BaseResolveRequest & Partial<ParsedIdentifier>;
+declare abstract class Resolver {
+	fileSystem: FileSystem;
+	options: ResolveOptions;
+	hooks: {
+		resolveStep: SyncHook<
+			[
+				AsyncSeriesBailHook<
+					[ResolveRequest, ResolveContext],
+					null | ResolveRequest
+				>,
+				ResolveRequest
+			]
+		>;
+		noResolve: SyncHook<[ResolveRequest, Error]>;
+		resolve: AsyncSeriesBailHook<
+			[ResolveRequest, ResolveContext],
+			null | ResolveRequest
+		>;
+		result: AsyncSeriesHook<[ResolveRequest, ResolveContext]>;
+	};
+	ensureHook(
+		name:
+			| string
+			| AsyncSeriesBailHook<
+					[ResolveRequest, ResolveContext],
+					null | ResolveRequest
+			  >
+	): AsyncSeriesBailHook<
+		[ResolveRequest, ResolveContext],
+		null | ResolveRequest
+	>;
+	getHook(
+		name:
+			| string
+			| AsyncSeriesBailHook<
+					[ResolveRequest, ResolveContext],
+					null | ResolveRequest
+			  >
+	): AsyncSeriesBailHook<
+		[ResolveRequest, ResolveContext],
+		null | ResolveRequest
+	>;
+	resolveSync(context: object, path: string, request: string): string | false;
+	resolve(
+		context: object,
+		path: string,
+		request: string,
+		resolveContext: ResolveContext,
+		callback: (
+			arg0: null | Error,
+			arg1?: string | false,
+			arg2?: ResolveRequest
+		) => void
+	): void;
+	doResolve(
+		hook?: any,
+		request?: any,
+		message?: any,
+		resolveContext?: any,
+		callback?: any
+	): any;
+	parse(identifier: string): ParsedIdentifier;
+	isModule(path?: any): boolean;
+	isPrivate(path?: any): boolean;
+	isDirectory(path: string): boolean;
+	join(path?: any, request?: any): string;
+	normalize(path?: any): string;
+}
+declare interface UserResolveOptions {
+	/**
+	 * A list of module alias configurations or an object which maps key to value
+	 */
+	alias?: AliasOptions | AliasOption[];
+
+	/**
+	 * A list of module alias configurations or an object which maps key to value, applied only after modules option
+	 */
+	fallback?: AliasOptions | AliasOption[];
+
+	/**
+	 * A list of alias fields in description files
+	 */
+	aliasFields?: (string | string[])[];
+
+	/**
+	 * A function which decides whether a request should be cached or not. An object is passed with at least `path` and `request` properties.
+	 */
+	cachePredicate?: (arg0: ResolveRequest) => boolean;
+
+	/**
+	 * Whether or not the unsafeCache should include request context as part of the cache key.
+	 */
+	cacheWithContext?: boolean;
+
+	/**
+	 * A list of description files to read from
+	 */
+	descriptionFiles?: string[];
+
+	/**
+	 * A list of exports field condition names.
+	 */
+	conditionNames?: string[];
+
+	/**
+	 * Enforce that a extension from extensions must be used
+	 */
+	enforceExtension?: boolean;
+
+	/**
+	 * A list of exports fields in description files
+	 */
+	exportsFields?: (string | string[])[];
+
+	/**
+	 * A list of imports fields in description files
+	 */
+	importsFields?: (string | string[])[];
+
+	/**
+	 * A list of extensions which should be tried for files
+	 */
+	extensions?: string[];
+
+	/**
+	 * The file system which should be used
+	 */
+	fileSystem: FileSystem;
+
+	/**
+	 * Use this cache object to unsafely cache the successful requests
+	 */
+	unsafeCache?: boolean | object;
+
+	/**
+	 * Resolve symlinks to their symlinked location
+	 */
+	symlinks?: boolean;
+
+	/**
+	 * A prepared Resolver to which the plugins are attached
+	 */
+	resolver?: Resolver;
+
+	/**
+	 * A list of directories to resolve modules from, can be absolute path or folder name
+	 */
+	modules?: string | string[];
+
+	/**
+	 * A list of main fields in description files
+	 */
+	mainFields?: (
+		| string
+		| string[]
+		| { name: string | string[]; forceRelative: boolean }
+	)[];
+
+	/**
+	 * A list of main files in directories
+	 */
+	mainFiles?: string[];
+
+	/**
+	 * A list of additional resolve plugins which should be applied
+	 */
+	plugins?: Plugin[];
+
+	/**
+	 * A PnP API that should be used - null is "never", undefined is "auto"
+	 */
+	pnpApi?: null | PnpApiImpl;
+
+	/**
+	 * A list of root paths
+	 */
+	roots?: string[];
+
+	/**
+	 * The request is already fully specified and no extensions or directories are resolved for it
+	 */
+	fullySpecified?: boolean;
+
+	/**
+	 * Resolve to a context instead of a file
+	 */
+	resolveToContext?: boolean;
+
+	/**
+	 * A list of resolve restrictions
+	 */
+	restrictions?: (string | RegExp)[];
+
+	/**
+	 * Use only the sync constraints of the file system calls
+	 */
+	useSyncFileSystemCalls?: boolean;
+
+	/**
+	 * Prefer to resolve module requests as relative requests before falling back to modules
+	 */
+	preferRelative?: boolean;
+
+	/**
+	 * Prefer to resolve server-relative urls as absolute paths before falling back to resolve in roots
+	 */
+	preferAbsolute?: boolean;
+}
+declare interface WriteOnlySet<T> {
+	add: (T?: any) => void;
+}
+declare function exports(
+	context?: any,
+	path?: any,
+	request?: any,
+	resolveContext?: any,
+	callback?: any
+): void;
+declare namespace exports {
+	export const sync: (
+		context?: any,
+		path?: any,
+		request?: any
+	) => string | false;
+	export function create(
+		options?: any
+	): (
+		context?: any,
+		path?: any,
+		request?: any,
+		resolveContext?: any,
+		callback?: any
+	) => void;
+	export namespace create {
+		export const sync: (
+			options?: any
+		) => (context?: any, path?: any, request?: any) => string | false;
+	}
+	export namespace ResolverFactory {
+		export let createResolver: (options: UserResolveOptions) => Resolver;
+	}
+	export const forEachBail: (
+		array?: any,
+		iterator?: any,
+		callback?: any
+	) => any;
+	export {
+		CachedInputFileSystem,
+		CloneBasenamePlugin,
+		LogInfoPlugin,
+		PnpApiImpl as PnpApi,
+		Resolver,
+		FileSystem,
+		ResolveContext,
+		ResolveRequest,
+		Plugin,
+		UserResolveOptions as ResolveOptions
+	};
+}
+
+export = exports;
diff --git a/node_modules/mathjs/examples/node_modules/envinfo/LICENSE b/node_modules/mathjs/examples/node_modules/envinfo/LICENSE
new file mode 100644
index 0000000..1bc5440
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/envinfo/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Trevor Brindle
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/envinfo/README.md b/node_modules/mathjs/examples/node_modules/envinfo/README.md
new file mode 100644
index 0000000..b9eb694
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/envinfo/README.md
@@ -0,0 +1,285 @@
+<p align="center">
+  <img src="https://raw.githubusercontent.com/tabrindle/envinfo/master/logo.png" align="center"  width="700px"/>
+  <h3 align="center">envinfo generates a report of the common details needed when troubleshooting software issues, such as your operating system, binary versions, browsers, installed languages, and more</h3> 
+  <hr/>
+</p>
+
+[![CircleCI](https://circleci.com/gh/tabrindle/envinfo/tree/master.svg?style=svg)](https://circleci.com/gh/tabrindle/envinfo/tree/master) [![Build Status](https://travis-ci.org/tabrindle/envinfo.svg?branch=master)](https://travis-ci.org/tabrindle/envinfo) [![npm version](https://badge.fury.io/js/envinfo.svg)](https://badge.fury.io/js/envinfo) [![npm downloads per month](https://img.shields.io/npm/dm/envinfo.svg?maxAge=86400)](https://www.npmjs.com/package/envinfo) [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+[![All Contributors](https://img.shields.io/badge/all_contributors-10-orange.svg?style=flat-square)](#contributors)
+
+## The problem
+
+-   It works on my computer
+-   "command not found"
+-   what version of "command" are you running?
+-   what version of "different command" are you running?
+-   do you have "insert obscure android sdk version"?
+-   every github issue reporting template ever:
+
+**Please mention other relevant information such as the browser version, Node.js version, Operating System and programming language.**
+
+## This solution
+
+-   Gather all of this information in one spot, quickly, and painlessly.
+
+## Installation
+
+To use as a CLI tool, install this package globally:
+
+```sh
+npm install -g envinfo || yarn global add envinfo
+```
+
+Or, use without installing with npx:
+
+`npx envinfo`
+
+To use as a library in another project:
+
+```sh
+npm install envinfo || yarn add envinfo
+```
+
+## CLI Usage
+
+`envinfo` || `npx envinfo`
+
+```bash
+  System:
+    OS: macOS Mojave 10.14.5
+    CPU: (8) x64 Intel(R) Core(TM) i7-7820HQ CPU @ 2.90GHz
+    Memory: 2.97 GB / 16.00 GB
+    Shell: 5.3 - /bin/zsh
+  Binaries:
+    Node: 8.16.0 - ~/.nvm/versions/node/v8.16.0/bin/node
+    Yarn: 1.15.2 - ~/.yarn/bin/yarn
+    npm: 6.9.0 - ~/.nvm/versions/node/v8.16.0/bin/npm
+    Watchman: 4.9.0 - /usr/local/bin/watchman
+  Managers:
+    Cargo: 1.31.0 - ~/.cargo/bin/cargo
+    CocoaPods: 1.7.3 - /usr/local/bin/pod
+    Composer: 1.8.6 - /usr/local/bin/composer
+    Gradle: 5.5 - /usr/local/bin/gradle
+    Homebrew: 2.1.7 - /usr/local/bin/brew
+    Maven: 3.6.1 - /usr/local/bin/mvn
+    pip2: 19.0.3 - /usr/local/bin/pip2
+    pip3: 19.0.2 - /usr/local/bin/pip3
+    RubyGems: 2.5.2.3 - /usr/bin/gem
+  Utilities:
+    CMake: 3.13.3 - /usr/local/bin/cmake
+    Make: 3.81 - /usr/bin/make
+    GCC: 10.14. - /usr/bin/gcc
+    Git: 2.20.0 - /usr/local/bin/git
+    Mercurial: 4.5.3 - /usr/bin/hg
+    Clang: 1001.0.46.4 - /usr/bin/clang
+    Subversion: 1.10.3 - /usr/bin/svn
+  Servers:
+    Apache: 2.4.34 - /usr/sbin/apachectl
+    Nginx: 1.13.12 - /usr/local/bin/nginx
+  Virtualization:
+    Docker: 18.09.1 - /usr/local/bin/docker
+    Parallels: 13.3.0 - /usr/local/bin/prlctl
+    VirtualBox: 5.2.20 - /usr/local/bin/vboxmanage
+  SDKs:
+    iOS SDK:
+      Platforms: iOS 12.2, macOS 10.14, tvOS 12.2, watchOS 5.2
+    Android SDK:
+      API Levels: 28
+      Build Tools: 28.0.3
+      System Images: android-28 | Google Play Intel x86 Atom
+  IDEs:
+    Android Studio: 3.2 AI-181.5540.7.32.5056338
+    Atom: 1.23.3
+    Emacs: 22.1.1 - /usr/bin/emacs
+    Nano: 2.0.6 - /usr/bin/nano
+    VSCode: 1.36.0 - /usr/local/bin/code
+    Vim: 8.0 - /usr/bin/vim
+    Xcode: 10.2.1/10E1001 - /usr/bin/xcodebuild
+  Languages:
+    Bash: 4.4.23 - /usr/local/bin/bash
+    Elixir: 1.6.2 - /usr/local/bin/elixir
+    Go: 1.11.1 - /usr/local/bin/go
+    Java: 1.8.0_192 - /usr/bin/javac
+    Perl: 5.18.4 - /usr/bin/perl
+    PHP: 7.1.23 - /usr/bin/php
+    Python: 2.7.16 - /usr/local/bin/python
+    Python3: 3.7.2 - /usr/local/bin/python3
+    R: 3.6.0 - /usr/local/bin/R
+    Ruby: 2.3.7 - /usr/bin/ruby
+    Rust: 1.16.0 - /Users/tabrindle/.cargo/bin/rustup
+  Databases:
+    MongoDB: 3.6.4 - /usr/local/bin/mongo
+    MySQL: 10.3.10 (MariaDB) - /usr/local/bin/mysql
+    PostgreSQL: 10.3 - /usr/local/bin/postgres
+    SQLite: 3.24.0 - /usr/bin/sqlite3
+  Browsers:
+    Chrome: 75.0.3770.100
+    Chrome Canary: 77.0.3847.0
+    Firefox: 68.0
+    Firefox Developer Edition: 69.0
+    Firefox Nightly: 69.0a1
+    Safari: 12.1.1
+    Safari Technology Preview: 13.0
+  npmPackages:
+    apollo-client: ^2.3.1 => 2.3.1
+    jest: ^22.2.1 => 22.2.1
+    ...
+    react: ^16.3.2 => 16.3.2
+    react-apollo: ^2.1.4 => 2.1.4
+    run4staged: ^1.1.1 => 1.1.1
+    solidarity: 2.0.5 => 2.0.5
+    styled-components: ^3.1.6 => 3.1.6
+  npmGlobalPackages:
+    create-react-app: 1.5.2
+    create-react-native-app: 1.0.0
+    envinfo: 5.10.0
+    exp: 49.2.2
+    gatsby-cli: 1.1.52
+    npm: 5.6.0
+    react-native-cli: 2.0.1
+    solidarity: 2.1.0
+    typescript: 2.8.1
+```
+
+## Programmatic Usage
+
+Envinfo takes a configuration object and returns a Promise that resolves a string (optionally yaml, json or markdown)
+
+```javascript
+import envinfo from 'envinfo';
+
+envinfo.run(
+    {
+        System: ['OS', 'CPU'],
+        Binaries: ['Node', 'Yarn', 'npm'],
+        Browsers: ['Chrome', 'Firefox', 'Safari'],
+        npmPackages: ['styled-components', 'babel-plugin-styled-components'],
+    },
+    { json: true, showNotFound: true }
+).then(env => console.log(env));
+```
+
+logs:
+
+```json
+{
+    "System": {
+        "OS": "macOS High Sierra 10.13",
+        "CPU": "x64 Intel(R) Core(TM) i7-4870HQ CPU @ 2.50GHz"
+    },
+    "Binaries": {
+        "Node": {
+            "version": "8.11.0",
+            "path": "~/.nvm/versions/node/v8.11.0/bin/node"
+        },
+        "Yarn": {
+            "version": "1.5.1",
+            "path": "~/.yarn/bin/yarn"
+        },
+        "npm": {
+            "version": "5.6.0",
+            "path": "~/.nvm/versions/node/v8.11.0/bin/npm"
+        }
+    },
+    "Browsers": {
+        "Chrome": {
+            "version": "67.0.3396.62"
+        },
+        "Firefox": {
+            "version": "59.0.2"
+        },
+        "Safari": {
+            "version": "11.0"
+        }
+    },
+    "npmPackages": {
+        "styled-components": {
+            "wanted": "^3.2.1",
+            "installed": "3.2.1"
+        },
+        "babel-plugin-styled-components": "Not Found"
+    }
+}
+```
+
+All of envinfo's helpers are also exported for use. You can use envinfo as a whole, or just the parts that you need, like this:
+
+```javascript
+const envinfo = require('envinfo');
+
+// each helper returns a promise
+const node = await envinfo.helpers.getNodeInfo();
+
+// The promises resolve to an array of values: ["Name", "Version", "Path"]
+// e.g. ["Node", "10.9.0", "/usr/local/bin/node"]
+
+console.log(`Node: ${node[1]} - ${node[2]}`); // "Node: 10.9.0 - ~/.nvm/versions/node/v8.14.0/bin/node"
+```
+
+## CLI Options
+
+```
+    --system               Print general system info such as OS, CPU, Memory and Shell
+    --browsers             Get version numbers of installed web browsers
+    --SDKs                 Get platforms, build tools and SDKs of iOS and Android
+    --IDEs                 Get version numbers of installed IDEs
+    --languages            Get version numbers of installed languages such as Java, Python, PHP, etc
+    --binaries             Get version numbers of node, npm, watchman, etc
+    --npmPackages          Get version numbers of locally installed npm packages - glob, string, or comma delimited list
+    --npmGlobalPackages    Get version numbers of globally installed npm packages
+
+    --duplicates           Mark duplicate npm packages inside parentheses eg. (2.1.4)
+    --fullTree             Traverse entire node_modules dependency tree, not just top level
+
+    --markdown             Print output in markdown format
+    --json                 Print output in JSON format
+    --console              Print to console (defaults to on for CLI usage, off for programmatic usage)
+```
+
+## Integration
+
+envinfo is live in:
+
+-   [React Native](https://github.com/facebook/react-native) (`react-native info`)
+-   [Create React App](https://github.com/facebook/create-react-app) (`create-react-app --info`)
+-   [Expo CLI](https://github.com/expo/expo-cli) (`expo diagnostics`)
+-   [Webpack](https://github.com/webpack/webpack-cli) (`webpack-cli info`)
+-   [Solidarity](https://github.com/infinitered/solidarity) (`solidarity report`)
+-   [Gatsby](https://github.com/gatsbyjs/gatsby) (`gatsby info`)
+
+envinfo is used in the ISSUE_TEMPLATE of:
+
+-   [styled-components](https://github.com/styled-components/styled-components)
+-   [Jest](https://github.com/facebook/jest)
+-   [Apollo Client](https://github.com/apollographql/apollo-client)
+
+## Alternatives
+
+-   type `command -v` until you smash your computer
+-   [specs](https://github.com/mcandre/specs) - an excellent ruby gem that runs `command -v` for you on :all-the-things: Great for raw info.
+-   [screenfetch](https://github.com/KittyKatt/screenFetch) - fetch system and terminal information, and display a pretty ascii logo
+-   [Solidarity](https://github.com/infinitered/solidarity) - a project based environment checker
+-   write your own
+
+## License
+
+MIT
+
+## Contributing
+
+PRs for additional features are welcome! Run `npm run lint && npm run format` before committing.
+
+This project came out of a [PR](https://github.com/facebook/react-native/pull/14428) to the React Native CLI tool - issues are reported frequently without important environment information, like Node/npm versions.
+
+## Contributors
+
+Thanks goes to these wonderful people ([emoji key](https://github.com/kentcdodds/all-contributors#emoji-key)):
+
+<!-- ALL-CONTRIBUTORS-LIST:START - Do not remove or modify this section -->
+<!-- prettier-ignore -->
+| [<img src="https://avatars1.githubusercontent.com/u/2925048?v=4" width="100px;"/><br /><sub><b>Trevor Brindle</b></sub>](http://trevorbrindle.com)<br />[💬](#question-tabrindle "Answering Questions") [📝](#blog-tabrindle "Blogposts") [🐛](https://github.com/tabrindle/envinfo/issues?q=author%3Atabrindle "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=tabrindle "Code") [📖](https://github.com/tabrindle/envinfo/commits?author=tabrindle "Documentation") [💡](#example-tabrindle "Examples") [🤔](#ideas-tabrindle "Ideas, Planning, & Feedback") [👀](#review-tabrindle "Reviewed Pull Requests") [📢](#talk-tabrindle "Talks") [⚠️](https://github.com/tabrindle/envinfo/commits?author=tabrindle "Tests") | [<img src="https://avatars0.githubusercontent.com/u/997157?v=4" width="100px;"/><br /><sub><b>Gant Laborde</b></sub>](http://gantlaborde.com/)<br />[📝](#blog-GantMan "Blogposts") [🐛](https://github.com/tabrindle/envinfo/issues?q=author%3AGantMan "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=GantMan "Code") [🤔](#ideas-GantMan "Ideas, Planning, & Feedback") | [<img src="https://avatars1.githubusercontent.com/u/599352?v=4" width="100px;"/><br /><sub><b>Anton Fisher</b></sub>](http://antonfisher.com)<br />[🐛](https://github.com/tabrindle/envinfo/issues?q=author%3Aantonfisher "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=antonfisher "Code") | [<img src="https://avatars1.githubusercontent.com/u/960133?v=4" width="100px;"/><br /><sub><b>Ahmad Awais ⚡️</b></sub>](https://AhmadAwais.com/)<br />[🐛](https://github.com/tabrindle/envinfo/issues?q=author%3Aahmadawais "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=ahmadawais "Code") | [<img src="https://avatars2.githubusercontent.com/u/9251453?v=4" width="100px;"/><br /><sub><b>Hasan</b></sub>](https://github.com/LEQADA)<br />[🐛](https://github.com/tabrindle/envinfo/issues?q=author%3ALEQADA "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=LEQADA "Code") | [<img src="https://avatars3.githubusercontent.com/u/1232725?v=4" width="100px;"/><br /><sub><b>Ernesto Ramírez</b></sub>](http://twitter.com/_ErnestoR)<br />[🐛](https://github.com/tabrindle/envinfo/issues?q=author%3AErnestoR "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=ErnestoR "Code") | [<img src="https://avatars1.githubusercontent.com/u/3759816?v=4" width="100px;"/><br /><sub><b>Jiawen Geng</b></sub>](https://www.gengjiawen.com)<br />[🐛](https://github.com/tabrindle/envinfo/issues?q=author%3Agengjiawen "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=gengjiawen "Code") [🤔](#ideas-gengjiawen "Ideas, Planning, & Feedback") [⚠️](https://github.com/tabrindle/envinfo/commits?author=gengjiawen "Tests") |
+| :---: | :---: | :---: | :---: | :---: | :---: | :---: |
+| [<img src="https://avatars3.githubusercontent.com/u/12520493?v=4" width="100px;"/><br /><sub><b>Zac Anger</b></sub>](https://zacanger.com)<br />[💻](https://github.com/tabrindle/envinfo/commits?author=zacanger "Code") [🐛](https://github.com/tabrindle/envinfo/issues?q=author%3Azacanger "Bug reports") | [<img src="https://avatars3.githubusercontent.com/u/497214?v=4" width="100px;"/><br /><sub><b>Ville Immonen</b></sub>](https://twitter.com/VilleImmonen)<br />[🐛](https://github.com/tabrindle/envinfo/issues?q=author%3Afson "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=fson "Code") | [<img src="https://avatars2.githubusercontent.com/u/27246?v=4" width="100px;"/><br /><sub><b>Olmo Maldonado</b></sub>](http://ibolmo.com)<br />[🐛](https://github.com/tabrindle/envinfo/issues?q=author%3Aibolmo "Bug reports") [💻](https://github.com/tabrindle/envinfo/commits?author=ibolmo "Code") |
+<!-- ALL-CONTRIBUTORS-LIST:END -->
+
+This project follows the [all-contributors](https://github.com/kentcdodds/all-contributors) specification. Contributions of any kind welcome!
diff --git a/node_modules/mathjs/examples/node_modules/envinfo/dist/cli.js b/node_modules/mathjs/examples/node_modules/envinfo/dist/cli.js
new file mode 100644
index 0000000..bd6057f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/envinfo/dist/cli.js
@@ -0,0 +1,2 @@
+#!/usr/bin/env node
+"use strict";module.exports=function(n){var e={};function o(t){if(e[t])return e[t].exports;var r=e[t]={i:t,l:!1,exports:{}};return n[t].call(r.exports,r,r.exports,o),r.l=!0,r.exports}return o.m=n,o.c=e,o.d=function(n,e,t){o.o(n,e)||Object.defineProperty(n,e,{enumerable:!0,get:t})},o.r=function(n){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(n,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(n,"__esModule",{value:!0})},o.t=function(n,e){if(1&e&&(n=o(n)),8&e)return n;if(4&e&&"object"==typeof n&&n&&n.__esModule)return n;var t=Object.create(null);if(o.r(t),Object.defineProperty(t,"default",{enumerable:!0,value:n}),2&e&&"string"!=typeof n)for(var r in n)o.d(t,r,function(e){return n[e]}.bind(null,r));return t},o.n=function(n){var e=n&&n.__esModule?function(){return n.default}:function(){return n};return o.d(e,"a",e),e},o.o=function(n,e){return Object.prototype.hasOwnProperty.call(n,e)},o.p="",o(o.s=171)}({171:function(n,e,o){var t=o(172)(process.argv.slice(2));t.console=!0,t.help||t._.indexOf("help")>-1?console.log("\n  ,,',                                  ,,             ,,,,,,           ,',,\n ,,,                                                  ,,,                  ,,,\n ,,       ,,,,,    ,,,,,,   ,,,     ,,  ,,  .,,,,,,   ,,,,,,,   ,,,,,       ,,\n ,,     ,,    ,,  ,,,   ,,,  ,,    ,,,  ,,  ,,,   ,,, ,,      ,,,   ,,,     ,,\n ,,,   ,,     .,, ,,,    ,,  ,,,   ,,   ,,  ,,,    ,, ,,     ,,      ,,     ,,,\n ,,    ,,,,,,,,,, ,,,    ,,   ,,  ,,    ,,  ,,,    ,, ,,     ,,      ,,     ,,\n ,,    ,,,        ,,,    ,,    ,,,,,    ,,  ,,,    ,, ,,     ,,,    ,,,     ,,\n ,,      ,,,,,,,  ,,,    ,,     ,,,     ,,  ,,,    ,, ,,       ,,,,,,,      ,,\n ,,,                                                                       ,,,\n  ,,,'                                                                  ',,,\n\n  VERSION: 7.8.0\n\n  USAGE:\n\n    `envinfo` || `npx envinfo`\n\n  OPTIONS:\n\n    --system               Print general system info such as OS, CPU, Memory and Shell\n    --browsers             Get version numbers of installed web browsers\n    --SDKs                 Get platforms, build tools and SDKs of iOS and Android\n    --IDEs                 Get version numbers of installed IDEs\n    --languages            Get version numbers of installed languages such as Java, Python, PHP, etc\n    --managers             Get version numbers of installed package/dependency managers\n    --monorepos            Get monorepo tools\n    --binaries             Get version numbers of node, npm, watchman, etc\n    --npmPackages          Get version numbers of locally installed npm packages - glob, string, or comma delimited list\n    --npmGlobalPackages    Get version numbers of globally installed npm packages\n\n    --duplicates           Mark duplicate npm packages inside parentheses eg. (2.1.4)\n    --fullTree             Traverse entire node_modules dependency tree, not just top level\n\n    --markdown             Print output in markdown format\n    --json                 Print output in JSON format\n    --console              Print to console (defaults to on for CLI usage, off for programmatic usage)\n    --showNotFound         Don't filter out values marked 'Not Found'\n    --title                Give your report a top level title ie 'Environment Report'\n\n    --clipboard            *Removed - use clipboardy or clipboard-cli directly*\n  "):t.version||t.v||t._.indexOf("version")>-1?console.log("7.8.0"):o(173).cli(t)},172:function(n,e){function o(n){return"number"==typeof n||(!!/^0x[0-9a-f]+$/i.test(n)||/^[-+]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(n))}n.exports=function(n,e){e||(e={});var t={bools:{},strings:{},unknownFn:null};"function"==typeof e.unknown&&(t.unknownFn=e.unknown),"boolean"==typeof e.boolean&&e.boolean?t.allBools=!0:[].concat(e.boolean).filter(Boolean).forEach(function(n){t.bools[n]=!0});var r={};Object.keys(e.alias||{}).forEach(function(n){r[n]=[].concat(e.alias[n]),r[n].forEach(function(e){r[e]=[n].concat(r[n].filter(function(n){return e!==n}))})}),[].concat(e.string).filter(Boolean).forEach(function(n){t.strings[n]=!0,r[n]&&(t.strings[r[n]]=!0)});var s=e.default||{},i={_:[]};Object.keys(t.bools).forEach(function(n){a(n,void 0!==s[n]&&s[n])});var l=[];function a(n,e,s){if(!s||!t.unknownFn||function(n,e){return t.allBools&&/^--[^=]+$/.test(e)||t.strings[n]||t.bools[n]||r[n]}(n,s)||!1!==t.unknownFn(s)){var l=!t.strings[n]&&o(e)?Number(e):e;u(i,n.split("."),l),(r[n]||[]).forEach(function(n){u(i,n.split("."),l)})}}function u(n,e,o){for(var r=n,s=0;s<e.length-1;s++){if("__proto__"===(i=e[s]))return;void 0===r[i]&&(r[i]={}),r[i]!==Object.prototype&&r[i]!==Number.prototype&&r[i]!==String.prototype||(r[i]={}),r[i]===Array.prototype&&(r[i]=[]),r=r[i]}var i;"__proto__"!==(i=e[e.length-1])&&(r!==Object.prototype&&r!==Number.prototype&&r!==String.prototype||(r={}),r===Array.prototype&&(r=[]),void 0===r[i]||t.bools[i]||"boolean"==typeof r[i]?r[i]=o:Array.isArray(r[i])?r[i].push(o):r[i]=[r[i],o])}function c(n){return r[n].some(function(n){return t.bools[n]})}-1!==n.indexOf("--")&&(l=n.slice(n.indexOf("--")+1),n=n.slice(0,n.indexOf("--")));for(var f=0;f<n.length;f++){var p=n[f];if(/^--.+=/.test(p)){var d=p.match(/^--([^=]+)=([\s\S]*)$/),b=d[1],m=d[2];t.bools[b]&&(m="false"!==m),a(b,m,p)}else if(/^--no-.+/.test(p)){a(b=p.match(/^--no-(.+)/)[1],!1,p)}else if(/^--.+/.test(p)){b=p.match(/^--(.+)/)[1];void 0===(h=n[f+1])||/^-/.test(h)||t.bools[b]||t.allBools||r[b]&&c(b)?/^(true|false)$/.test(h)?(a(b,"true"===h,p),f++):a(b,!t.strings[b]||"",p):(a(b,h,p),f++)}else if(/^-[^-]+/.test(p)){for(var v=p.slice(1,-1).split(""),g=!1,y=0;y<v.length;y++){var h;if("-"!==(h=p.slice(y+2))){if(/[A-Za-z]/.test(v[y])&&/=/.test(h)){a(v[y],h.split("=")[1],p),g=!0;break}if(/[A-Za-z]/.test(v[y])&&/-?\d+(\.\d*)?(e-?\d+)?$/.test(h)){a(v[y],h,p),g=!0;break}if(v[y+1]&&v[y+1].match(/\W/)){a(v[y],p.slice(y+2),p),g=!0;break}a(v[y],!t.strings[v[y]]||"",p)}else a(v[y],h,p)}b=p.slice(-1)[0];g||"-"===b||(!n[f+1]||/^(-|--)[^-]/.test(n[f+1])||t.bools[b]||r[b]&&c(b)?n[f+1]&&/^(true|false)$/.test(n[f+1])?(a(b,"true"===n[f+1],p),f++):a(b,!t.strings[b]||"",p):(a(b,n[f+1],p),f++))}else if(t.unknownFn&&!1===t.unknownFn(p)||i._.push(t.strings._||!o(p)?p:Number(p)),e.stopEarly){i._.push.apply(i._,n.slice(f+1));break}}return Object.keys(s).forEach(function(n){var e,o,t;e=i,o=n.split("."),t=e,o.slice(0,-1).forEach(function(n){t=t[n]||{}}),o[o.length-1]in t||(u(i,n.split("."),s[n]),(r[n]||[]).forEach(function(e){u(i,e.split("."),s[n])}))}),e["--"]?(i["--"]=new Array,l.forEach(function(n){i["--"].push(n)})):l.forEach(function(n){i._.push(n)}),i}},173:function(n,e){n.exports=require("./envinfo")}});
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/envinfo/dist/envinfo.js b/node_modules/mathjs/examples/node_modules/envinfo/dist/envinfo.js
new file mode 100644
index 0000000..1247656
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/envinfo/dist/envinfo.js
@@ -0,0 +1 @@
+module.exports=function(e){var t={};function n(r){if(t[r])return t[r].exports;var o=t[r]={i:r,l:!1,exports:{}};return e[r].call(o.exports,o,o.exports,n),o.l=!0,o.exports}return n.m=e,n.c=t,n.d=function(e,t,r){n.o(e,t)||Object.defineProperty(e,t,{enumerable:!0,get:r})},n.r=function(e){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},n.t=function(e,t){if(1&t&&(e=n(e)),8&t)return e;if(4&t&&"object"==typeof e&&e&&e.__esModule)return e;var r=Object.create(null);if(n.r(r),Object.defineProperty(r,"default",{enumerable:!0,value:e}),2&t&&"string"!=typeof e)for(var o in e)n.d(r,o,function(t){return e[t]}.bind(null,o));return r},n.n=function(e){var t=e&&e.__esModule?function(){return e.default}:function(){return e};return n.d(t,"a",t),t},n.o=function(e,t){return Object.prototype.hasOwnProperty.call(e,t)},n.p="",n(n.s=78)}([function(e,t){e.exports=require("path")},function(e,t,n){"use strict";n(22),n(101),n(21),n(103),n(114),n(16),n(27),n(74),n(116),n(2);var r=n(0),o=n(5),i=n(17),s=n(49),a=n(76),c=n(45),u=n(121),l=function(e){var t=(arguments.length>1&&void 0!==arguments[1]?arguments[1]:{}).unify,n=void 0!==t&&t;return new Promise(function(t){s.exec(e,{stdio:[0,"pipe","ignore"]},function(e,r,o){var i="";i=n?r.toString()+o.toString():r.toString(),t((e?"":i).trim())})})},f=function(e){var t=Object.values(Array.prototype.slice.call(arguments).slice(1));(process.env.ENVINFO_DEBUG||"").toLowerCase()===e&&console.log(e,JSON.stringify(t))},p=function(e){return new Promise(function(t){o.readFile(e,"utf8",function(e,n){return t(n||null)})})},h=function(e){return p(e).then(function(e){return e?JSON.parse(e):null})},d=/\d+\.[\d+|.]+/g,m=function(e){f("trace","findDarwinApplication",e);var t=`mdfind "kMDItemCFBundleIdentifier=='${e}'"`;return f("trace",t),l(t).then(function(e){return e.replace(/(\s)/g,"\\ ")})},g=function(e,t){var n=(t||["CFBundleShortVersionString"]).map(function(e){return"-c Print:"+e});return["/usr/libexec/PlistBuddy"].concat(n).concat([e]).join(" ")},v=function(e,t){for(var n=[],r=null;null!==(r=e.exec(t));)n.push(r);return n};e.exports={run:l,log:f,fileExists:function(e){return new Promise(function(t){o.stat(e,function(n){return t(n?null:e)})})},readFile:p,requireJson:h,versionRegex:d,findDarwinApplication:m,generatePlistBuddyCommand:g,matchAll:v,parseSDKManagerOutput:function(e){var t=e.split("Available")[0];return{apiLevels:v(u.androidAPILevels,t).map(function(e){return e[1]}),buildTools:v(u.androidBuildTools,t).map(function(e){return e[1]}),systemImages:v(u.androidSystemImages,t).map(function(e){return e[1].split("|").map(function(e){return e.trim()})}).map(function(e){return e[0].split(";")[0]+" | "+e[2].split(" System Image")[0]})}},isLinux:"linux"===process.platform,isMacOS:"darwin"===process.platform,NA:"N/A",NotFound:"Not Found",isWindows:process.platform.startsWith("win"),isObject:function(e){return"object"==typeof e&&!Array.isArray(e)},noop:function(e){return e},pipe:function(e){return function(t){return e.reduce(function(e,t){return t(e)},t)}},browserBundleIdentifiers:{"Brave Browser":"com.brave.Browser",Chrome:"com.google.Chrome","Chrome Canary":"com.google.Chrome.canary",Firefox:"org.mozilla.firefox","Firefox Developer Edition":"org.mozilla.firefoxdeveloperedition","Firefox Nightly":"org.mozilla.nightly","Microsoft Edge":"com.microsoft.edgemac",Safari:"com.apple.Safari","Safari Technology Preview":"com.apple.SafariTechnologyPreview"},ideBundleIdentifiers:{Atom:"com.github.atom",IntelliJ:"com.jetbrains.intellij",PhpStorm:"com.jetbrains.PhpStorm","Sublime Text":"com.sublimetext.3",WebStorm:"com.jetbrains.WebStorm"},runSync:function(e){return(s.execSync(e,{stdio:[0,"pipe","ignore"]}).toString()||"").trim()},which:function(e){return new Promise(function(t){return a(e,function(e,n){return t(n)})})},getDarwinApplicationVersion:function(e){var t;return f("trace","getDarwinApplicationVersion",e),t="darwin"!==process.platform?"N/A":m(e).then(function(e){return l(g(r.join(e,"Contents","Info.plist"),["CFBundleShortVersionString"]))}),Promise.resolve(t)},uniq:function(e){return Array.from(new Set(e))},toReadableBytes:function(e){var t=Math.floor(Math.log(e)/Math.log(1024));return e?(e/Math.pow(1024,t)).toFixed(2)+" "+["B","KB","MB","GB","TB","PB"][t]:"0 Bytes"},omit:function(e,t){return Object.keys(e).filter(function(e){return t.indexOf(e)<0}).reduce(function(t,n){return Object.assign(t,{[n]:e[n]})},{})},pick:function(e,t){return Object.keys(e).filter(function(e){return t.indexOf(e)>=0}).reduce(function(t,n){return Object.assign(t,{[n]:e[n]})},{})},getPackageJsonByName:function(e){return h(r.join(process.cwd(),"node_modules",e,"package.json"))},getPackageJsonByPath:function(e){return h(r.join(process.cwd(),e))},getPackageJsonByFullPath:function(e){return f("trace","getPackageJsonByFullPath",e),h(e)},getAllPackageJsonPaths:function(e){return f("trace","getAllPackageJsonPaths",e),new Promise(function(t){var n=function(e,n){return t(n.map(r.normalize)||[])};return c(e?r.join("node_modules",e,"package.json"):r.join("node_modules","**","package.json"),n)})},sortObject:function(e){return Object.keys(e).sort().reduce(function(t,n){return t[n]=e[n],t},{})},findVersion:function(e,t,n){f("trace","findVersion",e,t,n);var r=n||0,o=t||d,i=e.match(o);return i?i[r]:e},condensePath:function(e){return(e||"").replace(i.homedir(),"~")},determineFound:function(e,t,n){return f("trace","determineFound",e,t,n),"N/A"===t?Promise.resolve([e,"N/A"]):t&&0!==Object.keys(t).length?n?Promise.resolve([e,t,n]):Promise.resolve([e,t]):Promise.resolve([e,"Not Found"])}}},function(e,t,n){"use strict";var r,o,i,s,a=n(36),c=n(4),u=n(12),l=n(56),f=n(8),p=n(6),h=n(19),d=n(37),m=n(38),g=n(81),v=n(60).set,y=n(83)(),b=n(62),w=n(84),x=n(85),S=n(86),P=c.TypeError,O=c.process,j=O&&O.versions,E=j&&j.v8||"",I=c.Promise,_="process"==l(O),A=function(){},k=o=b.f,N=!!function(){try{var e=I.resolve(1),t=(e.constructor={})[n(3)("species")]=function(e){e(A,A)};return(_||"function"==typeof PromiseRejectionEvent)&&e.then(A)instanceof t&&0!==E.indexOf("6.6")&&-1===x.indexOf("Chrome/66")}catch(e){}}(),F=function(e){var t;return!(!p(e)||"function"!=typeof(t=e.then))&&t},C=function(e,t){if(!e._n){e._n=!0;var n=e._c;y(function(){for(var r=e._v,o=1==e._s,i=0,s=function(t){var n,i,s,a=o?t.ok:t.fail,c=t.resolve,u=t.reject,l=t.domain;try{a?(o||(2==e._h&&V(e),e._h=1),!0===a?n=r:(l&&l.enter(),n=a(r),l&&(l.exit(),s=!0)),n===t.promise?u(P("Promise-chain cycle")):(i=F(n))?i.call(n,c,u):c(n)):u(r)}catch(e){l&&!s&&l.exit(),u(e)}};n.length>i;)s(n[i++]);e._c=[],e._n=!1,t&&!e._h&&M(e)})}},M=function(e){v.call(c,function(){var t,n,r,o=e._v,i=T(e);if(i&&(t=w(function(){_?O.emit("unhandledRejection",o,e):(n=c.onunhandledrejection)?n({promise:e,reason:o}):(r=c.console)&&r.error&&r.error("Unhandled promise rejection",o)}),e._h=_||T(e)?2:1),e._a=void 0,i&&t.e)throw t.v})},T=function(e){return 1!==e._h&&0===(e._a||e._c).length},V=function(e){v.call(c,function(){var t;_?O.emit("rejectionHandled",e):(t=c.onrejectionhandled)&&t({promise:e,reason:e._v})})},D=function(e){var t=this;t._d||(t._d=!0,(t=t._w||t)._v=e,t._s=2,t._a||(t._a=t._c.slice()),C(t,!0))},B=function(e){var t,n=this;if(!n._d){n._d=!0,n=n._w||n;try{if(n===e)throw P("Promise can't be resolved itself");(t=F(e))?y(function(){var r={_w:n,_d:!1};try{t.call(e,u(B,r,1),u(D,r,1))}catch(e){D.call(r,e)}}):(n._v=e,n._s=1,C(n,!1))}catch(e){D.call({_w:n,_d:!1},e)}}};N||(I=function(e){d(this,I,"Promise","_h"),h(e),r.call(this);try{e(u(B,this,1),u(D,this,1))}catch(e){D.call(this,e)}},(r=function(e){this._c=[],this._a=void 0,this._s=0,this._d=!1,this._v=void 0,this._h=0,this._n=!1}).prototype=n(40)(I.prototype,{then:function(e,t){var n=k(g(this,I));return n.ok="function"!=typeof e||e,n.fail="function"==typeof t&&t,n.domain=_?O.domain:void 0,this._c.push(n),this._a&&this._a.push(n),this._s&&C(this,!1),n.promise},catch:function(e){return this.then(void 0,e)}}),i=function(){var e=new r;this.promise=e,this.resolve=u(B,e,1),this.reject=u(D,e,1)},b.f=k=function(e){return e===I||e===s?new i(e):o(e)}),f(f.G+f.W+f.F*!N,{Promise:I}),n(26)(I,"Promise"),n(63)("Promise"),s=n(18).Promise,f(f.S+f.F*!N,"Promise",{reject:function(e){var t=k(this);return(0,t.reject)(e),t.promise}}),f(f.S+f.F*(a||!N),"Promise",{resolve:function(e){return S(a&&this===s?I:this,e)}}),f(f.S+f.F*!(N&&n(41)(function(e){I.all(e).catch(A)})),"Promise",{all:function(e){var t=this,n=k(t),r=n.resolve,o=n.reject,i=w(function(){var n=[],i=0,s=1;m(e,!1,function(e){var a=i++,c=!1;n.push(void 0),s++,t.resolve(e).then(function(e){c||(c=!0,n[a]=e,--s||r(n))},o)}),--s||r(n)});return i.e&&o(i.v),n.promise},race:function(e){var t=this,n=k(t),r=n.reject,o=w(function(){m(e,!1,function(e){t.resolve(e).then(n.resolve,r)})});return o.e&&r(o.v),n.promise}})},function(e,t,n){var r=n(55)("wks"),o=n(24),i=n(4).Symbol,s="function"==typeof i;(e.exports=function(e){return r[e]||(r[e]=s&&i[e]||(s?i:o)("Symbol."+e))}).store=r},function(e,t){var n=e.exports="undefined"!=typeof window&&window.Math==Math?window:"undefined"!=typeof self&&self.Math==Math?self:Function("return this")();"number"==typeof __g&&(__g=n)},function(e,t){e.exports=require("fs")},function(e,t){e.exports=function(e){return"object"==typeof e?null!==e:"function"==typeof e}},function(e,t,n){var r=n(6);e.exports=function(e){if(!r(e))throw TypeError(e+" is not an object!");return e}},function(e,t,n){var r=n(4),o=n(18),i=n(13),s=n(14),a=n(12),c=function(e,t,n){var u,l,f,p,h=e&c.F,d=e&c.G,m=e&c.S,g=e&c.P,v=e&c.B,y=d?r:m?r[t]||(r[t]={}):(r[t]||{}).prototype,b=d?o:o[t]||(o[t]={}),w=b.prototype||(b.prototype={});for(u in d&&(n=t),n)f=((l=!h&&y&&void 0!==y[u])?y:n)[u],p=v&&l?a(f,r):g&&"function"==typeof f?a(Function.call,f):f,y&&s(y,u,f,e&c.U),b[u]!=f&&i(b,u,p),g&&w[u]!=f&&(w[u]=f)};r.core=o,c.F=1,c.G=2,c.S=4,c.P=8,c.B=16,c.W=32,c.U=64,c.R=128,e.exports=c},function(e,t,n){e.exports=!n(10)(function(){return 7!=Object.defineProperty({},"a",{get:function(){return 7}}).a})},function(e,t){e.exports=function(e){try{return!!e()}catch(e){return!0}}},function(e,t,n){var r=n(7),o=n(50),i=n(51),s=Object.defineProperty;t.f=n(9)?Object.defineProperty:function(e,t,n){if(r(e),t=i(t,!0),r(n),o)try{return s(e,t,n)}catch(e){}if("get"in n||"set"in n)throw TypeError("Accessors not supported!");return"value"in n&&(e[t]=n.value),e}},function(e,t,n){var r=n(19);e.exports=function(e,t,n){if(r(e),void 0===t)return e;switch(n){case 1:return function(n){return e.call(t,n)};case 2:return function(n,r){return e.call(t,n,r)};case 3:return function(n,r,o){return e.call(t,n,r,o)}}return function(){return e.apply(t,arguments)}}},function(e,t,n){var r=n(11),o=n(23);e.exports=n(9)?function(e,t,n){return r.f(e,t,o(1,n))}:function(e,t,n){return e[t]=n,e}},function(e,t,n){var r=n(4),o=n(13),i=n(15),s=n(24)("src"),a=Function.toString,c=(""+a).split("toString");n(18).inspectSource=function(e){return a.call(e)},(e.exports=function(e,t,n,a){var u="function"==typeof n;u&&(i(n,"name")||o(n,"name",t)),e[t]!==n&&(u&&(i(n,s)||o(n,s,e[t]?""+e[t]:c.join(String(t)))),e===r?e[t]=n:a?e[t]?e[t]=n:o(e,t,n):(delete e[t],o(e,t,n)))})(Function.prototype,"toString",function(){return"function"==typeof this&&this[s]||a.call(this)})},function(e,t){var n={}.hasOwnProperty;e.exports=function(e,t){return n.call(e,t)}},function(e,t,n){n(28)("split",2,function(e,t,r){"use strict";var o=n(92),i=r,s=[].push;if("c"=="abbc".split(/(b)*/)[1]||4!="test".split(/(?:)/,-1).length||2!="ab".split(/(?:ab)*/).length||4!=".".split(/(.?)(.?)/).length||".".split(/()()/).length>1||"".split(/.?/).length){var a=void 0===/()??/.exec("")[1];r=function(e,t){var n=String(this);if(void 0===e&&0===t)return[];if(!o(e))return i.call(n,e,t);var r,c,u,l,f,p=[],h=(e.ignoreCase?"i":"")+(e.multiline?"m":"")+(e.unicode?"u":"")+(e.sticky?"y":""),d=0,m=void 0===t?4294967295:t>>>0,g=new RegExp(e.source,h+"g");for(a||(r=new RegExp("^"+g.source+"$(?!\\s)",h));(c=g.exec(n))&&!((u=c.index+c[0].length)>d&&(p.push(n.slice(d,c.index)),!a&&c.length>1&&c[0].replace(r,function(){for(f=1;f<arguments.length-2;f++)void 0===arguments[f]&&(c[f]=void 0)}),c.length>1&&c.index<n.length&&s.apply(p,c.slice(1)),l=c[0].length,d=u,p.length>=m));)g.lastIndex===c.index&&g.lastIndex++;return d===n.length?!l&&g.test("")||p.push(""):p.push(n.slice(d)),p.length>m?p.slice(0,m):p}}else"0".split(void 0,0).length&&(r=function(e,t){return void 0===e&&0===t?[]:i.call(this,e,t)});return[function(n,o){var i=e(this),s=null==n?void 0:n[t];return void 0!==s?s.call(n,i,o):r.call(String(i),n,o)},r]})},function(e,t){e.exports=require("os")},function(e,t){var n=e.exports={version:"2.5.7"};"number"==typeof __e&&(__e=n)},function(e,t){e.exports=function(e){if("function"!=typeof e)throw TypeError(e+" is not a function!");return e}},function(e,t){var n={}.toString;e.exports=function(e){return n.call(e).slice(8,-1)}},function(e,t,n){var r=n(8);r(r.S+r.F,"Object",{assign:n(88)})},function(e,t,n){n(28)("match",1,function(e,t,n){return[function(n){"use strict";var r=e(this),o=null==n?void 0:n[t];return void 0!==o?o.call(n,r):new RegExp(n)[t](String(r))},n]})},function(e,t){e.exports=function(e,t){return{enumerable:!(1&e),configurable:!(2&e),writable:!(4&e),value:t}}},function(e,t){var n=0,r=Math.random();e.exports=function(e){return"Symbol(".concat(void 0===e?"":e,")_",(++n+r).toString(36))}},function(e,t,n){var r=n(53),o=n(34);e.exports=function(e){return r(o(e))}},function(e,t,n){var r=n(11).f,o=n(15),i=n(3)("toStringTag");e.exports=function(e,t,n){e&&!o(e=n?e:e.prototype,i)&&r(e,i,{configurable:!0,value:t})}},function(e,t,n){n(28)("replace",2,function(e,t,n){return[function(r,o){"use strict";var i=e(this),s=null==r?void 0:r[t];return void 0!==s?s.call(r,i,o):n.call(String(i),r,o)},n]})},function(e,t,n){"use strict";var r=n(13),o=n(14),i=n(10),s=n(34),a=n(3);e.exports=function(e,t,n){var c=a(e),u=n(s,c,""[e]),l=u[0],f=u[1];i(function(){var t={};return t[c]=function(){return 7},7!=""[e](t)})&&(o(String.prototype,e,l),r(RegExp.prototype,c,2==t?function(e,t){return f.call(e,this,t)}:function(e){return f.call(e,this)}))}},function(e,t,n){var r=n(34);e.exports=function(e){return Object(r(e))}},function(e,t){e.exports=require("util")},function(e,t,n){var r=n(70);function o(e){var t=function(){return t.called?t.value:(t.called=!0,t.value=e.apply(this,arguments))};return t.called=!1,t}function i(e){var t=function(){if(t.called)throw new Error(t.onceError);return t.called=!0,t.value=e.apply(this,arguments)},n=e.name||"Function wrapped with `once`";return t.onceError=n+" shouldn't be called more than once",t.called=!1,t}e.exports=r(o),e.exports.strict=r(i),o.proto=o(function(){Object.defineProperty(Function.prototype,"once",{value:function(){return o(this)},configurable:!0}),Object.defineProperty(Function.prototype,"onceStrict",{value:function(){return i(this)},configurable:!0})})},function(e,t,n){"use strict";var r=n(8),o=n(52)(!0);r(r.P,"Array",{includes:function(e){return o(this,e,arguments.length>1?arguments[1]:void 0)}}),n(80)("includes")},function(e,t,n){var r=n(6),o=n(4).document,i=r(o)&&r(o.createElement);e.exports=function(e){return i?o.createElement(e):{}}},function(e,t){e.exports=function(e){if(null==e)throw TypeError("Can't call method on  "+e);return e}},function(e,t,n){var r=n(54),o=Math.min;e.exports=function(e){return e>0?o(r(e),9007199254740991):0}},function(e,t){e.exports=!1},function(e,t){e.exports=function(e,t,n,r){if(!(e instanceof t)||void 0!==r&&r in e)throw TypeError(n+": incorrect invocation!");return e}},function(e,t,n){var r=n(12),o=n(57),i=n(58),s=n(7),a=n(35),c=n(59),u={},l={};(t=e.exports=function(e,t,n,f,p){var h,d,m,g,v=p?function(){return e}:c(e),y=r(n,f,t?2:1),b=0;if("function"!=typeof v)throw TypeError(e+" is not iterable!");if(i(v)){for(h=a(e.length);h>b;b++)if((g=t?y(s(d=e[b])[0],d[1]):y(e[b]))===u||g===l)return g}else for(m=v.call(e);!(d=m.next()).done;)if((g=o(m,y,d.value,t))===u||g===l)return g}).BREAK=u,t.RETURN=l},function(e,t){e.exports={}},function(e,t,n){var r=n(14);e.exports=function(e,t,n){for(var o in t)r(e,o,t[o],n);return e}},function(e,t,n){var r=n(3)("iterator"),o=!1;try{var i=[7][r]();i.return=function(){o=!0},Array.from(i,function(){throw 2})}catch(e){}e.exports=function(e,t){if(!t&&!o)return!1;var n=!1;try{var i=[7],s=i[r]();s.next=function(){return{done:n=!0}},i[r]=function(){return s},e(i)}catch(e){}return n}},function(e,t,n){var r=n(87),o=n(66);e.exports=Object.keys||function(e){return r(e,o)}},function(e,t,n){var r=n(55)("keys"),o=n(24);e.exports=function(e){return r[e]||(r[e]=o(e))}},function(e,t){t.f={}.propertyIsEnumerable},function(e,t,n){e.exports=b;var r=n(5),o=n(67),i=n(46),s=(i.Minimatch,n(97)),a=n(68).EventEmitter,c=n(0),u=n(47),l=n(48),f=n(99),p=n(69),h=(p.alphasort,p.alphasorti,p.setopts),d=p.ownProp,m=n(100),g=(n(30),p.childrenIgnored),v=p.isIgnored,y=n(31);function b(e,t,n){if("function"==typeof t&&(n=t,t={}),t||(t={}),t.sync){if(n)throw new TypeError("callback provided to sync glob");return f(e,t)}return new x(e,t,n)}b.sync=f;var w=b.GlobSync=f.GlobSync;function x(e,t,n){if("function"==typeof t&&(n=t,t=null),t&&t.sync){if(n)throw new TypeError("callback provided to sync glob");return new w(e,t)}if(!(this instanceof x))return new x(e,t,n);h(this,e,t),this._didRealPath=!1;var r=this.minimatch.set.length;this.matches=new Array(r),"function"==typeof n&&(n=y(n),this.on("error",n),this.on("end",function(e){n(null,e)}));var o=this;if(this._processing=0,this._emitQueue=[],this._processQueue=[],this.paused=!1,this.noprocess)return this;if(0===r)return a();for(var i=!0,s=0;s<r;s++)this._process(this.minimatch.set[s],s,!1,a);function a(){--o._processing,o._processing<=0&&(i?process.nextTick(function(){o._finish()}):o._finish())}i=!1}b.glob=b,b.hasMagic=function(e,t){var n=function(e,t){if(null===t||"object"!=typeof t)return e;for(var n=Object.keys(t),r=n.length;r--;)e[n[r]]=t[n[r]];return e}({},t);n.noprocess=!0;var r=new x(e,n).minimatch.set;if(!e)return!1;if(r.length>1)return!0;for(var o=0;o<r[0].length;o++)if("string"!=typeof r[0][o])return!0;return!1},b.Glob=x,s(x,a),x.prototype._finish=function(){if(u(this instanceof x),!this.aborted){if(this.realpath&&!this._didRealpath)return this._realpath();p.finish(this),this.emit("end",this.found)}},x.prototype._realpath=function(){if(!this._didRealpath){this._didRealpath=!0;var e=this.matches.length;if(0===e)return this._finish();for(var t=this,n=0;n<this.matches.length;n++)this._realpathSet(n,r)}function r(){0==--e&&t._finish()}},x.prototype._realpathSet=function(e,t){var n=this.matches[e];if(!n)return t();var r=Object.keys(n),i=this,s=r.length;if(0===s)return t();var a=this.matches[e]=Object.create(null);r.forEach(function(n,r){n=i._makeAbs(n),o.realpath(n,i.realpathCache,function(r,o){r?"stat"===r.syscall?a[n]=!0:i.emit("error",r):a[o]=!0,0==--s&&(i.matches[e]=a,t())})})},x.prototype._mark=function(e){return p.mark(this,e)},x.prototype._makeAbs=function(e){return p.makeAbs(this,e)},x.prototype.abort=function(){this.aborted=!0,this.emit("abort")},x.prototype.pause=function(){this.paused||(this.paused=!0,this.emit("pause"))},x.prototype.resume=function(){if(this.paused){if(this.emit("resume"),this.paused=!1,this._emitQueue.length){var e=this._emitQueue.slice(0);this._emitQueue.length=0;for(var t=0;t<e.length;t++){var n=e[t];this._emitMatch(n[0],n[1])}}if(this._processQueue.length){var r=this._processQueue.slice(0);this._processQueue.length=0;for(t=0;t<r.length;t++){var o=r[t];this._processing--,this._process(o[0],o[1],o[2],o[3])}}}},x.prototype._process=function(e,t,n,r){if(u(this instanceof x),u("function"==typeof r),!this.aborted)if(this._processing++,this.paused)this._processQueue.push([e,t,n,r]);else{for(var o,s=0;"string"==typeof e[s];)s++;switch(s){case e.length:return void this._processSimple(e.join("/"),t,r);case 0:o=null;break;default:o=e.slice(0,s).join("/")}var a,c=e.slice(s);null===o?a=".":l(o)||l(e.join("/"))?(o&&l(o)||(o="/"+o),a=o):a=o;var f=this._makeAbs(a);if(g(this,a))return r();c[0]===i.GLOBSTAR?this._processGlobStar(o,a,f,c,t,n,r):this._processReaddir(o,a,f,c,t,n,r)}},x.prototype._processReaddir=function(e,t,n,r,o,i,s){var a=this;this._readdir(n,i,function(c,u){return a._processReaddir2(e,t,n,r,o,i,u,s)})},x.prototype._processReaddir2=function(e,t,n,r,o,i,s,a){if(!s)return a();for(var u=r[0],l=!!this.minimatch.negate,f=u._glob,p=this.dot||"."===f.charAt(0),h=[],d=0;d<s.length;d++){if("."!==(g=s[d]).charAt(0)||p)(l&&!e?!g.match(u):g.match(u))&&h.push(g)}var m=h.length;if(0===m)return a();if(1===r.length&&!this.mark&&!this.stat){this.matches[o]||(this.matches[o]=Object.create(null));for(d=0;d<m;d++){var g=h[d];e&&(g="/"!==e?e+"/"+g:e+g),"/"!==g.charAt(0)||this.nomount||(g=c.join(this.root,g)),this._emitMatch(o,g)}return a()}r.shift();for(d=0;d<m;d++){g=h[d];e&&(g="/"!==e?e+"/"+g:e+g),this._process([g].concat(r),o,i,a)}a()},x.prototype._emitMatch=function(e,t){if(!this.aborted&&!v(this,t))if(this.paused)this._emitQueue.push([e,t]);else{var n=l(t)?t:this._makeAbs(t);if(this.mark&&(t=this._mark(t)),this.absolute&&(t=n),!this.matches[e][t]){if(this.nodir){var r=this.cache[n];if("DIR"===r||Array.isArray(r))return}this.matches[e][t]=!0;var o=this.statCache[n];o&&this.emit("stat",t,o),this.emit("match",t)}}},x.prototype._readdirInGlobStar=function(e,t){if(!this.aborted){if(this.follow)return this._readdir(e,!1,t);var n=this,o=m("lstat\0"+e,function(r,o){if(r&&"ENOENT"===r.code)return t();var i=o&&o.isSymbolicLink();n.symlinks[e]=i,i||!o||o.isDirectory()?n._readdir(e,!1,t):(n.cache[e]="FILE",t())});o&&r.lstat(e,o)}},x.prototype._readdir=function(e,t,n){if(!this.aborted&&(n=m("readdir\0"+e+"\0"+t,n))){if(t&&!d(this.symlinks,e))return this._readdirInGlobStar(e,n);if(d(this.cache,e)){var o=this.cache[e];if(!o||"FILE"===o)return n();if(Array.isArray(o))return n(null,o)}r.readdir(e,function(e,t,n){return function(r,o){r?e._readdirError(t,r,n):e._readdirEntries(t,o,n)}}(this,e,n))}},x.prototype._readdirEntries=function(e,t,n){if(!this.aborted){if(!this.mark&&!this.stat)for(var r=0;r<t.length;r++){var o=t[r];o="/"===e?e+o:e+"/"+o,this.cache[o]=!0}return this.cache[e]=t,n(null,t)}},x.prototype._readdirError=function(e,t,n){if(!this.aborted){switch(t.code){case"ENOTSUP":case"ENOTDIR":var r=this._makeAbs(e);if(this.cache[r]="FILE",r===this.cwdAbs){var o=new Error(t.code+" invalid cwd "+this.cwd);o.path=this.cwd,o.code=t.code,this.emit("error",o),this.abort()}break;case"ENOENT":case"ELOOP":case"ENAMETOOLONG":case"UNKNOWN":this.cache[this._makeAbs(e)]=!1;break;default:this.cache[this._makeAbs(e)]=!1,this.strict&&(this.emit("error",t),this.abort()),this.silent||console.error("glob error",t)}return n()}},x.prototype._processGlobStar=function(e,t,n,r,o,i,s){var a=this;this._readdir(n,i,function(c,u){a._processGlobStar2(e,t,n,r,o,i,u,s)})},x.prototype._processGlobStar2=function(e,t,n,r,o,i,s,a){if(!s)return a();var c=r.slice(1),u=e?[e]:[],l=u.concat(c);this._process(l,o,!1,a);var f=this.symlinks[n],p=s.length;if(f&&i)return a();for(var h=0;h<p;h++){if("."!==s[h].charAt(0)||this.dot){var d=u.concat(s[h],c);this._process(d,o,!0,a);var m=u.concat(s[h],r);this._process(m,o,!0,a)}}a()},x.prototype._processSimple=function(e,t,n){var r=this;this._stat(e,function(o,i){r._processSimple2(e,t,o,i,n)})},x.prototype._processSimple2=function(e,t,n,r,o){if(this.matches[t]||(this.matches[t]=Object.create(null)),!r)return o();if(e&&l(e)&&!this.nomount){var i=/[\/\\]$/.test(e);"/"===e.charAt(0)?e=c.join(this.root,e):(e=c.resolve(this.root,e),i&&(e+="/"))}"win32"===process.platform&&(e=e.replace(/\\/g,"/")),this._emitMatch(t,e),o()},x.prototype._stat=function(e,t){var n=this._makeAbs(e),o="/"===e.slice(-1);if(e.length>this.maxLength)return t();if(!this.stat&&d(this.cache,n)){var i=this.cache[n];if(Array.isArray(i)&&(i="DIR"),!o||"DIR"===i)return t(null,i);if(o&&"FILE"===i)return t()}var s=this.statCache[n];if(void 0!==s){if(!1===s)return t(null,s);var a=s.isDirectory()?"DIR":"FILE";return o&&"FILE"===a?t():t(null,a,s)}var c=this,u=m("stat\0"+n,function(o,i){if(i&&i.isSymbolicLink())return r.stat(n,function(r,o){r?c._stat2(e,n,null,i,t):c._stat2(e,n,r,o,t)});c._stat2(e,n,o,i,t)});u&&r.lstat(n,u)},x.prototype._stat2=function(e,t,n,r,o){if(n&&("ENOENT"===n.code||"ENOTDIR"===n.code))return this.statCache[t]=!1,o();var i="/"===e.slice(-1);if(this.statCache[t]=r,"/"===t.slice(-1)&&r&&!r.isDirectory())return o(null,!1,r);var s=!0;return r&&(s=r.isDirectory()?"DIR":"FILE"),this.cache[t]=this.cache[t]||s,i&&"FILE"===s?o():o(null,s,r)}},function(e,t,n){e.exports=d,d.Minimatch=m;var r={sep:"/"};try{r=n(0)}catch(e){}var o=d.GLOBSTAR=m.GLOBSTAR={},i=n(94),s={"!":{open:"(?:(?!(?:",close:"))[^/]*?)"},"?":{open:"(?:",close:")?"},"+":{open:"(?:",close:")+"},"*":{open:"(?:",close:")*"},"@":{open:"(?:",close:")"}},a="[^/]",c=a+"*?",u="(?:(?!(?:\\/|^)(?:\\.{1,2})($|\\/)).)*?",l="(?:(?!(?:\\/|^)\\.).)*?",f="().*{}+?[]^$\\!".split("").reduce(function(e,t){return e[t]=!0,e},{});var p=/\/+/;function h(e,t){e=e||{},t=t||{};var n={};return Object.keys(t).forEach(function(e){n[e]=t[e]}),Object.keys(e).forEach(function(t){n[t]=e[t]}),n}function d(e,t,n){if("string"!=typeof t)throw new TypeError("glob pattern string required");return n||(n={}),!(!n.nocomment&&"#"===t.charAt(0))&&(""===t.trim()?""===e:new m(t,n).match(e))}function m(e,t){if(!(this instanceof m))return new m(e,t);if("string"!=typeof e)throw new TypeError("glob pattern string required");t||(t={}),e=e.trim(),"/"!==r.sep&&(e=e.split(r.sep).join("/")),this.options=t,this.set=[],this.pattern=e,this.regexp=null,this.negate=!1,this.comment=!1,this.empty=!1,this.make()}function g(e,t){if(t||(t=this instanceof m?this.options:{}),void 0===(e=void 0===e?this.pattern:e))throw new TypeError("undefined pattern");return t.nobrace||!e.match(/\{.*\}/)?[e]:i(e)}d.filter=function(e,t){return t=t||{},function(n,r,o){return d(n,e,t)}},d.defaults=function(e){if(!e||!Object.keys(e).length)return d;var t=d,n=function(n,r,o){return t.minimatch(n,r,h(e,o))};return n.Minimatch=function(n,r){return new t.Minimatch(n,h(e,r))},n},m.defaults=function(e){return e&&Object.keys(e).length?d.defaults(e).Minimatch:m},m.prototype.debug=function(){},m.prototype.make=function(){if(this._made)return;var e=this.pattern,t=this.options;if(!t.nocomment&&"#"===e.charAt(0))return void(this.comment=!0);if(!e)return void(this.empty=!0);this.parseNegate();var n=this.globSet=this.braceExpand();t.debug&&(this.debug=console.error);this.debug(this.pattern,n),n=this.globParts=n.map(function(e){return e.split(p)}),this.debug(this.pattern,n),n=n.map(function(e,t,n){return e.map(this.parse,this)},this),this.debug(this.pattern,n),n=n.filter(function(e){return-1===e.indexOf(!1)}),this.debug(this.pattern,n),this.set=n},m.prototype.parseNegate=function(){var e=this.pattern,t=!1,n=this.options,r=0;if(n.nonegate)return;for(var o=0,i=e.length;o<i&&"!"===e.charAt(o);o++)t=!t,r++;r&&(this.pattern=e.substr(r));this.negate=t},d.braceExpand=function(e,t){return g(e,t)},m.prototype.braceExpand=g,m.prototype.parse=function(e,t){if(e.length>65536)throw new TypeError("pattern is too long");var n=this.options;if(!n.noglobstar&&"**"===e)return o;if(""===e)return"";var r,i="",u=!!n.nocase,l=!1,p=[],h=[],d=!1,m=-1,g=-1,y="."===e.charAt(0)?"":n.dot?"(?!(?:^|\\/)\\.{1,2}(?:$|\\/))":"(?!\\.)",b=this;function w(){if(r){switch(r){case"*":i+=c,u=!0;break;case"?":i+=a,u=!0;break;default:i+="\\"+r}b.debug("clearStateChar %j %j",r,i),r=!1}}for(var x,S=0,P=e.length;S<P&&(x=e.charAt(S));S++)if(this.debug("%s\t%s %s %j",e,S,i,x),l&&f[x])i+="\\"+x,l=!1;else switch(x){case"/":return!1;case"\\":w(),l=!0;continue;case"?":case"*":case"+":case"@":case"!":if(this.debug("%s\t%s %s %j <-- stateChar",e,S,i,x),d){this.debug("  in class"),"!"===x&&S===g+1&&(x="^"),i+=x;continue}b.debug("call clearStateChar %j",r),w(),r=x,n.noext&&w();continue;case"(":if(d){i+="(";continue}if(!r){i+="\\(";continue}p.push({type:r,start:S-1,reStart:i.length,open:s[r].open,close:s[r].close}),i+="!"===r?"(?:(?!(?:":"(?:",this.debug("plType %j %j",r,i),r=!1;continue;case")":if(d||!p.length){i+="\\)";continue}w(),u=!0;var O=p.pop();i+=O.close,"!"===O.type&&h.push(O),O.reEnd=i.length;continue;case"|":if(d||!p.length||l){i+="\\|",l=!1;continue}w(),i+="|";continue;case"[":if(w(),d){i+="\\"+x;continue}d=!0,g=S,m=i.length,i+=x;continue;case"]":if(S===g+1||!d){i+="\\"+x,l=!1;continue}if(d){var j=e.substring(g+1,S);try{RegExp("["+j+"]")}catch(e){var E=this.parse(j,v);i=i.substr(0,m)+"\\["+E[0]+"\\]",u=u||E[1],d=!1;continue}}u=!0,d=!1,i+=x;continue;default:w(),l?l=!1:!f[x]||"^"===x&&d||(i+="\\"),i+=x}d&&(j=e.substr(g+1),E=this.parse(j,v),i=i.substr(0,m)+"\\["+E[0],u=u||E[1]);for(O=p.pop();O;O=p.pop()){var I=i.slice(O.reStart+O.open.length);this.debug("setting tail",i,O),I=I.replace(/((?:\\{2}){0,64})(\\?)\|/g,function(e,t,n){return n||(n="\\"),t+t+n+"|"}),this.debug("tail=%j\n   %s",I,I,O,i);var _="*"===O.type?c:"?"===O.type?a:"\\"+O.type;u=!0,i=i.slice(0,O.reStart)+_+"\\("+I}w(),l&&(i+="\\\\");var A=!1;switch(i.charAt(0)){case".":case"[":case"(":A=!0}for(var k=h.length-1;k>-1;k--){var N=h[k],F=i.slice(0,N.reStart),C=i.slice(N.reStart,N.reEnd-8),M=i.slice(N.reEnd-8,N.reEnd),T=i.slice(N.reEnd);M+=T;var V=F.split("(").length-1,D=T;for(S=0;S<V;S++)D=D.replace(/\)[+*?]?/,"");var B="";""===(T=D)&&t!==v&&(B="$");var L=F+C+T+B+M;i=L}""!==i&&u&&(i="(?=.)"+i);A&&(i=y+i);if(t===v)return[i,u];if(!u)return e.replace(/\\(.)/g,"$1");var $=n.nocase?"i":"";try{var R=new RegExp("^"+i+"$",$)}catch(e){return new RegExp("$.")}return R._glob=e,R._src=i,R};var v={};d.makeRe=function(e,t){return new m(e,t||{}).makeRe()},m.prototype.makeRe=function(){if(this.regexp||!1===this.regexp)return this.regexp;var e=this.set;if(!e.length)return this.regexp=!1,this.regexp;var t=this.options,n=t.noglobstar?c:t.dot?u:l,r=t.nocase?"i":"",i=e.map(function(e){return e.map(function(e){return e===o?n:"string"==typeof e?e.replace(/[-[\]{}()*+?.,\\^$|#\s]/g,"\\$&"):e._src}).join("\\/")}).join("|");i="^(?:"+i+")$",this.negate&&(i="^(?!"+i+").*$");try{this.regexp=new RegExp(i,r)}catch(e){this.regexp=!1}return this.regexp},d.match=function(e,t,n){var r=new m(t,n=n||{});return e=e.filter(function(e){return r.match(e)}),r.options.nonull&&!e.length&&e.push(t),e},m.prototype.match=function(e,t){if(this.debug("match",e,this.pattern),this.comment)return!1;if(this.empty)return""===e;if("/"===e&&t)return!0;var n=this.options;"/"!==r.sep&&(e=e.split(r.sep).join("/"));e=e.split(p),this.debug(this.pattern,"split",e);var o,i,s=this.set;for(this.debug(this.pattern,"set",s),i=e.length-1;i>=0&&!(o=e[i]);i--);for(i=0;i<s.length;i++){var a=s[i],c=e;n.matchBase&&1===a.length&&(c=[o]);var u=this.matchOne(c,a,t);if(u)return!!n.flipNegate||!this.negate}return!n.flipNegate&&this.negate},m.prototype.matchOne=function(e,t,n){var r=this.options;this.debug("matchOne",{this:this,file:e,pattern:t}),this.debug("matchOne",e.length,t.length);for(var i=0,s=0,a=e.length,c=t.length;i<a&&s<c;i++,s++){this.debug("matchOne loop");var u,l=t[s],f=e[i];if(this.debug(t,l,f),!1===l)return!1;if(l===o){this.debug("GLOBSTAR",[t,l,f]);var p=i,h=s+1;if(h===c){for(this.debug("** at the end");i<a;i++)if("."===e[i]||".."===e[i]||!r.dot&&"."===e[i].charAt(0))return!1;return!0}for(;p<a;){var d=e[p];if(this.debug("\nglobstar while",e,p,t,h,d),this.matchOne(e.slice(p),t.slice(h),n))return this.debug("globstar found match!",p,a,d),!0;if("."===d||".."===d||!r.dot&&"."===d.charAt(0)){this.debug("dot detected!",e,p,t,h);break}this.debug("globstar swallow a segment, and continue"),p++}return!(!n||(this.debug("\n>>> no match, partial?",e,p,t,h),p!==a))}if("string"==typeof l?(u=r.nocase?f.toLowerCase()===l.toLowerCase():f===l,this.debug("string match",l,f,u)):(u=f.match(l),this.debug("pattern match",l,f,u)),!u)return!1}if(i===a&&s===c)return!0;if(i===a)return n;if(s===c)return i===a-1&&""===e[i];throw new Error("wtf?")}},function(e,t){e.exports=require("assert")},function(e,t,n){"use strict";function r(e){return"/"===e.charAt(0)}function o(e){var t=/^([a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/]+[^\\\/]+)?([\\\/])?([\s\S]*?)$/.exec(e),n=t[1]||"",r=Boolean(n&&":"!==n.charAt(1));return Boolean(t[2]||r)}e.exports="win32"===process.platform?o:r,e.exports.posix=r,e.exports.win32=o},function(e,t){e.exports=require("child_process")},function(e,t,n){e.exports=!n(9)&&!n(10)(function(){return 7!=Object.defineProperty(n(33)("div"),"a",{get:function(){return 7}}).a})},function(e,t,n){var r=n(6);e.exports=function(e,t){if(!r(e))return e;var n,o;if(t&&"function"==typeof(n=e.toString)&&!r(o=n.call(e)))return o;if("function"==typeof(n=e.valueOf)&&!r(o=n.call(e)))return o;if(!t&&"function"==typeof(n=e.toString)&&!r(o=n.call(e)))return o;throw TypeError("Can't convert object to primitive value")}},function(e,t,n){var r=n(25),o=n(35),i=n(79);e.exports=function(e){return function(t,n,s){var a,c=r(t),u=o(c.length),l=i(s,u);if(e&&n!=n){for(;u>l;)if((a=c[l++])!=a)return!0}else for(;u>l;l++)if((e||l in c)&&c[l]===n)return e||l||0;return!e&&-1}}},function(e,t,n){var r=n(20);e.exports=Object("z").propertyIsEnumerable(0)?Object:function(e){return"String"==r(e)?e.split(""):Object(e)}},function(e,t){var n=Math.ceil,r=Math.floor;e.exports=function(e){return isNaN(e=+e)?0:(e>0?r:n)(e)}},function(e,t,n){var r=n(18),o=n(4),i=o["__core-js_shared__"]||(o["__core-js_shared__"]={});(e.exports=function(e,t){return i[e]||(i[e]=void 0!==t?t:{})})("versions",[]).push({version:r.version,mode:n(36)?"pure":"global",copyright:"© 2018 Denis Pushkarev (zloirock.ru)"})},function(e,t,n){var r=n(20),o=n(3)("toStringTag"),i="Arguments"==r(function(){return arguments}());e.exports=function(e){var t,n,s;return void 0===e?"Undefined":null===e?"Null":"string"==typeof(n=function(e,t){try{return e[t]}catch(e){}}(t=Object(e),o))?n:i?r(t):"Object"==(s=r(t))&&"function"==typeof t.callee?"Arguments":s}},function(e,t,n){var r=n(7);e.exports=function(e,t,n,o){try{return o?t(r(n)[0],n[1]):t(n)}catch(t){var i=e.return;throw void 0!==i&&r(i.call(e)),t}}},function(e,t,n){var r=n(39),o=n(3)("iterator"),i=Array.prototype;e.exports=function(e){return void 0!==e&&(r.Array===e||i[o]===e)}},function(e,t,n){var r=n(56),o=n(3)("iterator"),i=n(39);e.exports=n(18).getIteratorMethod=function(e){if(null!=e)return e[o]||e["@@iterator"]||i[r(e)]}},function(e,t,n){var r,o,i,s=n(12),a=n(82),c=n(61),u=n(33),l=n(4),f=l.process,p=l.setImmediate,h=l.clearImmediate,d=l.MessageChannel,m=l.Dispatch,g=0,v={},y=function(){var e=+this;if(v.hasOwnProperty(e)){var t=v[e];delete v[e],t()}},b=function(e){y.call(e.data)};p&&h||(p=function(e){for(var t=[],n=1;arguments.length>n;)t.push(arguments[n++]);return v[++g]=function(){a("function"==typeof e?e:Function(e),t)},r(g),g},h=function(e){delete v[e]},"process"==n(20)(f)?r=function(e){f.nextTick(s(y,e,1))}:m&&m.now?r=function(e){m.now(s(y,e,1))}:d?(i=(o=new d).port2,o.port1.onmessage=b,r=s(i.postMessage,i,1)):l.addEventListener&&"function"==typeof postMessage&&!l.importScripts?(r=function(e){l.postMessage(e+"","*")},l.addEventListener("message",b,!1)):r="onreadystatechange"in u("script")?function(e){c.appendChild(u("script")).onreadystatechange=function(){c.removeChild(this),y.call(e)}}:function(e){setTimeout(s(y,e,1),0)}),e.exports={set:p,clear:h}},function(e,t,n){var r=n(4).document;e.exports=r&&r.documentElement},function(e,t,n){"use strict";var r=n(19);function o(e){var t,n;this.promise=new e(function(e,r){if(void 0!==t||void 0!==n)throw TypeError("Bad Promise constructor");t=e,n=r}),this.resolve=r(t),this.reject=r(n)}e.exports.f=function(e){return new o(e)}},function(e,t,n){"use strict";var r=n(4),o=n(11),i=n(9),s=n(3)("species");e.exports=function(e){var t=r[e];i&&t&&!t[s]&&o.f(t,s,{configurable:!0,get:function(){return this}})}},function(e,t,n){var r=n(8),o=n(65)(!0);r(r.S,"Object",{entries:function(e){return o(e)}})},function(e,t,n){var r=n(42),o=n(25),i=n(44).f;e.exports=function(e){return function(t){for(var n,s=o(t),a=r(s),c=a.length,u=0,l=[];c>u;)i.call(s,n=a[u++])&&l.push(e?[n,s[n]]:s[n]);return l}}},function(e,t){e.exports="constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf".split(",")},function(e,t,n){e.exports=l,l.realpath=l,l.sync=f,l.realpathSync=f,l.monkeypatch=function(){r.realpath=l,r.realpathSync=f},l.unmonkeypatch=function(){r.realpath=o,r.realpathSync=i};var r=n(5),o=r.realpath,i=r.realpathSync,s=process.version,a=/^v[0-5]\./.test(s),c=n(93);function u(e){return e&&"realpath"===e.syscall&&("ELOOP"===e.code||"ENOMEM"===e.code||"ENAMETOOLONG"===e.code)}function l(e,t,n){if(a)return o(e,t,n);"function"==typeof t&&(n=t,t=null),o(e,t,function(r,o){u(r)?c.realpath(e,t,n):n(r,o)})}function f(e,t){if(a)return i(e,t);try{return i(e,t)}catch(n){if(u(n))return c.realpathSync(e,t);throw n}}},function(e,t){e.exports=require("events")},function(e,t,n){function r(e,t){return Object.prototype.hasOwnProperty.call(e,t)}t.alphasort=u,t.alphasorti=c,t.setopts=function(e,t,n){n||(n={});if(n.matchBase&&-1===t.indexOf("/")){if(n.noglobstar)throw new Error("base matching requires globstar");t="**/"+t}e.silent=!!n.silent,e.pattern=t,e.strict=!1!==n.strict,e.realpath=!!n.realpath,e.realpathCache=n.realpathCache||Object.create(null),e.follow=!!n.follow,e.dot=!!n.dot,e.mark=!!n.mark,e.nodir=!!n.nodir,e.nodir&&(e.mark=!0);e.sync=!!n.sync,e.nounique=!!n.nounique,e.nonull=!!n.nonull,e.nosort=!!n.nosort,e.nocase=!!n.nocase,e.stat=!!n.stat,e.noprocess=!!n.noprocess,e.absolute=!!n.absolute,e.maxLength=n.maxLength||1/0,e.cache=n.cache||Object.create(null),e.statCache=n.statCache||Object.create(null),e.symlinks=n.symlinks||Object.create(null),function(e,t){e.ignore=t.ignore||[],Array.isArray(e.ignore)||(e.ignore=[e.ignore]);e.ignore.length&&(e.ignore=e.ignore.map(l))}(e,n),e.changedCwd=!1;var i=process.cwd();r(n,"cwd")?(e.cwd=o.resolve(n.cwd),e.changedCwd=e.cwd!==i):e.cwd=i;e.root=n.root||o.resolve(e.cwd,"/"),e.root=o.resolve(e.root),"win32"===process.platform&&(e.root=e.root.replace(/\\/g,"/"));e.cwdAbs=s(e.cwd)?e.cwd:f(e,e.cwd),"win32"===process.platform&&(e.cwdAbs=e.cwdAbs.replace(/\\/g,"/"));e.nomount=!!n.nomount,n.nonegate=!0,n.nocomment=!0,e.minimatch=new a(t,n),e.options=e.minimatch.options},t.ownProp=r,t.makeAbs=f,t.finish=function(e){for(var t=e.nounique,n=t?[]:Object.create(null),r=0,o=e.matches.length;r<o;r++){var i=e.matches[r];if(i&&0!==Object.keys(i).length){var s=Object.keys(i);t?n.push.apply(n,s):s.forEach(function(e){n[e]=!0})}else if(e.nonull){var a=e.minimatch.globSet[r];t?n.push(a):n[a]=!0}}t||(n=Object.keys(n));e.nosort||(n=n.sort(e.nocase?c:u));if(e.mark){for(var r=0;r<n.length;r++)n[r]=e._mark(n[r]);e.nodir&&(n=n.filter(function(t){var n=!/\/$/.test(t),r=e.cache[t]||e.cache[f(e,t)];return n&&r&&(n="DIR"!==r&&!Array.isArray(r)),n}))}e.ignore.length&&(n=n.filter(function(t){return!p(e,t)}));e.found=n},t.mark=function(e,t){var n=f(e,t),r=e.cache[n],o=t;if(r){var i="DIR"===r||Array.isArray(r),s="/"===t.slice(-1);if(i&&!s?o+="/":!i&&s&&(o=o.slice(0,-1)),o!==t){var a=f(e,o);e.statCache[a]=e.statCache[n],e.cache[a]=e.cache[n]}}return o},t.isIgnored=p,t.childrenIgnored=function(e,t){return!!e.ignore.length&&e.ignore.some(function(e){return!(!e.gmatcher||!e.gmatcher.match(t))})};var o=n(0),i=n(46),s=n(48),a=i.Minimatch;function c(e,t){return e.toLowerCase().localeCompare(t.toLowerCase())}function u(e,t){return e.localeCompare(t)}function l(e){var t=null;if("/**"===e.slice(-3)){var n=e.replace(/(\/\*\*)+$/,"");t=new a(n,{dot:!0})}return{matcher:new a(e,{dot:!0}),gmatcher:t}}function f(e,t){var n=t;return n="/"===t.charAt(0)?o.join(e.root,t):s(t)||""===t?t:e.changedCwd?o.resolve(e.cwd,t):o.resolve(t),"win32"===process.platform&&(n=n.replace(/\\/g,"/")),n}function p(e,t){return!!e.ignore.length&&e.ignore.some(function(e){return e.matcher.match(t)||!(!e.gmatcher||!e.gmatcher.match(t))})}},function(e,t){e.exports=function e(t,n){if(t&&n)return e(t)(n);if("function"!=typeof t)throw new TypeError("need wrapper function");Object.keys(t).forEach(function(e){r[e]=t[e]});return r;function r(){for(var e=new Array(arguments.length),n=0;n<e.length;n++)e[n]=arguments[n];var r=t.apply(this,e),o=e[e.length-1];return"function"==typeof r&&r!==o&&Object.keys(o).forEach(function(e){r[e]=o[e]}),r}}},function(e,t,n){var r=n(7),o=n(105),i=n(66),s=n(43)("IE_PROTO"),a=function(){},c=function(){var e,t=n(33)("iframe"),r=i.length;for(t.style.display="none",n(61).appendChild(t),t.src="javascript:",(e=t.contentWindow.document).open(),e.write("<script>document.F=Object<\/script>"),e.close(),c=e.F;r--;)delete c.prototype[i[r]];return c()};e.exports=Object.create||function(e,t){var n;return null!==e?(a.prototype=r(e),n=new a,a.prototype=null,n[s]=e):n=c(),void 0===t?n:o(n,t)}},function(e,t,n){var r=n(24)("meta"),o=n(6),i=n(15),s=n(11).f,a=0,c=Object.isExtensible||function(){return!0},u=!n(10)(function(){return c(Object.preventExtensions({}))}),l=function(e){s(e,r,{value:{i:"O"+ ++a,w:{}}})},f=e.exports={KEY:r,NEED:!1,fastKey:function(e,t){if(!o(e))return"symbol"==typeof e?e:("string"==typeof e?"S":"P")+e;if(!i(e,r)){if(!c(e))return"F";if(!t)return"E";l(e)}return e[r].i},getWeak:function(e,t){if(!i(e,r)){if(!c(e))return!0;if(!t)return!1;l(e)}return e[r].w},onFreeze:function(e){return u&&f.NEED&&c(e)&&!i(e,r)&&l(e),e}}},function(e,t,n){var r=n(6);e.exports=function(e,t){if(!r(e)||e._t!==t)throw TypeError("Incompatible receiver, "+t+" required!");return e}},function(e,t,n){var r=n(8),o=n(65)(!1);r(r.S,"Object",{values:function(e){return o(e)}})},function(e,t,n){"use strict";var r=n(7);e.exports=function(){var e=r(this),t="";return e.global&&(t+="g"),e.ignoreCase&&(t+="i"),e.multiline&&(t+="m"),e.unicode&&(t+="u"),e.sticky&&(t+="y"),t}},function(e,t,n){e.exports=u,u.sync=function(e,t){for(var n=c(e,t=t||{}),r=n.env,i=n.ext,u=n.extExe,l=[],f=0,p=r.length;f<p;f++){var h=r[f];'"'===h.charAt(0)&&'"'===h.slice(-1)&&(h=h.slice(1,-1));var d=o.join(h,e);!h&&/^\.[\\\/]/.test(e)&&(d=e.slice(0,2)+d);for(var m=0,g=i.length;m<g;m++){var v=d+i[m];try{if(s.sync(v,{pathExt:u})){if(!t.all)return v;l.push(v)}}catch(e){}}}if(t.all&&l.length)return l;if(t.nothrow)return null;throw a(e)};var r="win32"===process.platform||"cygwin"===process.env.OSTYPE||"msys"===process.env.OSTYPE,o=n(0),i=r?";":":",s=n(118);function a(e){var t=new Error("not found: "+e);return t.code="ENOENT",t}function c(e,t){var n=t.colon||i,o=t.path||process.env.PATH||"",s=[""];o=o.split(n);var a="";return r&&(o.unshift(process.cwd()),s=(a=t.pathExt||process.env.PATHEXT||".EXE;.CMD;.BAT;.COM").split(n),-1!==e.indexOf(".")&&""!==s[0]&&s.unshift("")),(e.match(/\//)||r&&e.match(/\\/))&&(o=[""]),{env:o,ext:s,extExe:a}}function u(e,t,n){"function"==typeof t&&(n=t,t={});var r=c(e,t),i=r.env,u=r.ext,l=r.extExe,f=[];!function r(c,p){if(c===p)return t.all&&f.length?n(null,f):n(a(e));var h=i[c];'"'===h.charAt(0)&&'"'===h.slice(-1)&&(h=h.slice(1,-1));var d=o.join(h,e);!h&&/^\.[\\\/]/.test(e)&&(d=e.slice(0,2)+d),function e(o,i){if(o===i)return r(c+1,p);var a=u[o];s(d+a,{pathExt:l},function(r,s){if(!r&&s){if(!t.all)return n(null,d+a);f.push(d+a)}return e(o+1,i)})}(0,u.length)}(0,i.length)}},function(e,t,n){"use strict";e.exports=(e=>{const t=(e=e||{}).env||process.env;return"win32"!==(e.platform||process.platform)?"PATH":Object.keys(t).find(e=>"PATH"===e.toUpperCase())||"Path"})},function(e,t,n){"use strict";n(32),n(2),n(27),n(64),n(21);var r=n(90),o=n(161),i=n(170),s=n(1);function a(e,t){(t=t||{}).clipboard&&console.log("\n*** Clipboard option removed - use clipboardy or clipboard-cli directly ***\n");var n=Object.keys(e).length>0?e:i.defaults,s=Object.entries(n).reduce(function(e,n){var o=n[0],i=n[1],s=r[`get${o}`];return s?(i&&e.push(s(i,t)),e):e=e.concat((i||[]).map(function(e){var t=r[`get${e.replace(/\s/g,"")}Info`];return t?t():Promise.resolve(["Unknown"])}))},[]);return Promise.all(s).then(function(e){var n=e.reduce(function(e,t){return t&&t[0]&&Object.assign(e,{[t[0]]:t}),e},{});return function(e,t){var n=t.json?o.json:t.markdown?o.markdown:o.yaml;if(t.console){var r=!1;process.stdout.isTTY&&(r=!0),console.log(n(e,Object.assign({},t,{console:r})))}return n(e,Object.assign({},t,{console:!1}))}(Object.entries(i.defaults).reduce(function(e,t){var r=t[0],o=t[1];return n[r]?Object.assign(e,{[r]:n[r][1]}):Object.assign(e,{[r]:(o||[]).reduce(function(e,t){return n[t]?(n[t].shift(),1===n[t].length?Object.assign(e,{[t]:n[t][0]}):Object.assign(e,{[t]:{version:n[t][0],path:n[t][1]}})):e},{})})},{}),t)})}e.exports={cli:function(e){if(e.all)return a(Object.assign({},i.defaults,{npmPackages:!0,npmGlobalPackages:!0}),e);if(e.raw)return a(JSON.parse(e.raw),e);if(e.helper){var t=r[`get${e.helper}`]||r[`get${e.helper}Info`]||r[e.helper];return t?t().then(console.log):console.error("Not Found")}var n=function(e,t){return e.toLowerCase().includes(t.toLowerCase())},o=Object.keys(e).filter(function(e){return Object.keys(i.defaults).some(function(t){return n(t,e)})}),c=Object.entries(i.defaults).reduce(function(t,r){return o.some(function(e){return n(e,r[0])})?Object.assign(t,{[r[0]]:r[1]||e[r[0]]}):t},{});return e.preset?i[e.preset]?a(Object.assign({},s.omit(i[e.preset],["options"]),c),Object.assign({},i[e.preset].options,s.pick(e,["duplicates","fullTree","json","markdown","console"]))):console.error(`\nNo "${e.preset}" preset found.`):a(c,e)},helpers:r,main:a,run:function(e,t){return"string"==typeof e.preset?a(i[e.preset],t):a(e,t)}}},function(e,t,n){var r=n(54),o=Math.max,i=Math.min;e.exports=function(e,t){return(e=r(e))<0?o(e+t,0):i(e,t)}},function(e,t,n){var r=n(3)("unscopables"),o=Array.prototype;null==o[r]&&n(13)(o,r,{}),e.exports=function(e){o[r][e]=!0}},function(e,t,n){var r=n(7),o=n(19),i=n(3)("species");e.exports=function(e,t){var n,s=r(e).constructor;return void 0===s||null==(n=r(s)[i])?t:o(n)}},function(e,t){e.exports=function(e,t,n){var r=void 0===n;switch(t.length){case 0:return r?e():e.call(n);case 1:return r?e(t[0]):e.call(n,t[0]);case 2:return r?e(t[0],t[1]):e.call(n,t[0],t[1]);case 3:return r?e(t[0],t[1],t[2]):e.call(n,t[0],t[1],t[2]);case 4:return r?e(t[0],t[1],t[2],t[3]):e.call(n,t[0],t[1],t[2],t[3])}return e.apply(n,t)}},function(e,t,n){var r=n(4),o=n(60).set,i=r.MutationObserver||r.WebKitMutationObserver,s=r.process,a=r.Promise,c="process"==n(20)(s);e.exports=function(){var e,t,n,u=function(){var r,o;for(c&&(r=s.domain)&&r.exit();e;){o=e.fn,e=e.next;try{o()}catch(r){throw e?n():t=void 0,r}}t=void 0,r&&r.enter()};if(c)n=function(){s.nextTick(u)};else if(!i||r.navigator&&r.navigator.standalone)if(a&&a.resolve){var l=a.resolve(void 0);n=function(){l.then(u)}}else n=function(){o.call(r,u)};else{var f=!0,p=document.createTextNode("");new i(u).observe(p,{characterData:!0}),n=function(){p.data=f=!f}}return function(r){var o={fn:r,next:void 0};t&&(t.next=o),e||(e=o,n()),t=o}}},function(e,t){e.exports=function(e){try{return{e:!1,v:e()}}catch(e){return{e:!0,v:e}}}},function(e,t,n){var r=n(4).navigator;e.exports=r&&r.userAgent||""},function(e,t,n){var r=n(7),o=n(6),i=n(62);e.exports=function(e,t){if(r(e),o(t)&&t.constructor===e)return t;var n=i.f(e);return(0,n.resolve)(t),n.promise}},function(e,t,n){var r=n(15),o=n(25),i=n(52)(!1),s=n(43)("IE_PROTO");e.exports=function(e,t){var n,a=o(e),c=0,u=[];for(n in a)n!=s&&r(a,n)&&u.push(n);for(;t.length>c;)r(a,n=t[c++])&&(~i(u,n)||u.push(n));return u}},function(e,t,n){"use strict";var r=n(42),o=n(89),i=n(44),s=n(29),a=n(53),c=Object.assign;e.exports=!c||n(10)(function(){var e={},t={},n=Symbol(),r="abcdefghijklmnopqrst";return e[n]=7,r.split("").forEach(function(e){t[e]=e}),7!=c({},e)[n]||Object.keys(c({},t)).join("")!=r})?function(e,t){for(var n=s(e),c=arguments.length,u=1,l=o.f,f=i.f;c>u;)for(var p,h=a(arguments[u++]),d=l?r(h).concat(l(h)):r(h),m=d.length,g=0;m>g;)f.call(h,p=d[g++])&&(n[p]=h[p]);return n}:c},function(e,t){t.f=Object.getOwnPropertySymbols},function(e,t,n){"use strict";function r(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}n(21);var o=n(91),i=n(1),s=n(122),a=n(123),c=n(124),u=n(125),l=n(126),f=n(127),p=n(128),h=n(129),d=n(130),m=n(131),g=n(159),v=n(160);e.exports=Object.assign({},i,o,function(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{},o=Object.keys(n);"function"==typeof Object.getOwnPropertySymbols&&(o=o.concat(Object.getOwnPropertySymbols(n).filter(function(e){return Object.getOwnPropertyDescriptor(n,e).enumerable}))),o.forEach(function(t){r(e,t,n[t])})}return e}({},s,a,c,u,l,f,p,h,d,m,g,v))},function(e,t,n){"use strict";n(22),n(21),n(2),n(32),n(16);var r=n(45),o=n(0),i=n(1),s=function(e){var t=e.split("node_modules"+o.sep),n=t[t.length-1];return"@"===n.charAt(0)?[n.split(o.sep)[0],n.split(o.sep)[1]].join("/"):n.split(o.sep)[0]};e.exports={getnpmPackages:function(e,t){i.log("trace","getnpmPackages"),t||(t={});var n=null,r=null;return"string"==typeof e&&(e.includes("*")||e.includes("?")||e.includes("+")||e.includes("!")?n=e:e=e.split(",")),Promise.all(["npmPackages",i.getPackageJsonByPath("package.json").then(function(e){return Object.assign({},(e||{}).devDependencies||{},(e||{}).dependencies||{})}).then(function(e){return r=e,t.fullTree||t.duplicates||n?i.getAllPackageJsonPaths(n):Promise.resolve(Object.keys(e||[]).map(function(e){return o.join("node_modules",e,"package.json")}))}).then(function(o){return!n&&"boolean"!=typeof e||t.fullTree?Array.isArray(e)?Promise.resolve((o||[]).filter(function(t){return e.includes(s(t))})):Promise.resolve(o):Promise.resolve((o||[]).filter(function(e){return Object.keys(r||[]).includes(s(e))}))}).then(function(e){return Promise.all([e,Promise.all(e.map(function(e){return i.getPackageJsonByPath(e)}))])}).then(function(e){var n=e[0],o=e[1].reduce(function(e,r,o){return r&&r.name?(e[r.name]||(e[r.name]={}),t.duplicates&&(e[r.name].duplicates=i.uniq((e[r.name].duplicates||[]).concat(r.version))),1===(n[o].match(/node_modules/g)||[]).length&&(e[r.name].installed=r.version),e):e},{});return Object.keys(o).forEach(function(e){o[e].duplicates&&o[e].installed&&(o[e].duplicates=o[e].duplicates.filter(function(t){return t!==o[e].installed})),r[e]&&(o[e].wanted=r[e])}),o}).then(function(n){return t.showNotFound&&Array.isArray(e)&&e.forEach(function(e){n[e]||(n[e]="Not Found")}),n}).then(function(e){return i.sortObject(e)})])},getnpmGlobalPackages:function(e,t){i.log("trace","getnpmGlobalPackages",e);var n=null;return"string"==typeof e?e.includes("*")||e.includes("?")||e.includes("+")||e.includes("!")?n=e:e=e.split(","):Array.isArray(e)||(e=!0),Promise.all(["npmGlobalPackages",i.run("npm get prefix --global").then(function(e){return new Promise(function(t,s){return r(o.join(e,i.isWindows?"":"lib","node_modules",n||"{*,@*/*}","package.json"),function(e,n){e||t(n),s(e)})})}).then(function(t){return Promise.all(t.filter(function(t){return"boolean"==typeof e||null!==n||e.includes(s(t))}).map(function(e){return i.getPackageJsonByFullPath(e)}))}).then(function(e){return e.reduce(function(e,t){return t?Object.assign(e,{[t.name]:t.version}):e},{})}).then(function(n){return t.showNotFound&&Array.isArray(e)&&e.forEach(function(e){n[e]||(n[e]="Not Found")}),n})])}}},function(e,t,n){var r=n(6),o=n(20),i=n(3)("match");e.exports=function(e){var t;return r(e)&&(void 0!==(t=e[i])?!!t:"RegExp"==o(e))}},function(e,t,n){var r=n(0),o="win32"===process.platform,i=n(5),s=process.env.NODE_DEBUG&&/fs/.test(process.env.NODE_DEBUG);function a(e){return"function"==typeof e?e:function(){var e;if(s){var t=new Error;e=function(e){e&&(t.message=e.message,n(e=t))}}else e=n;return e;function n(e){if(e){if(process.throwDeprecation)throw e;if(!process.noDeprecation){var t="fs: missing callback "+(e.stack||e.message);process.traceDeprecation?console.trace(t):console.error(t)}}}}()}r.normalize;if(o)var c=/(.*?)(?:[\/\\]+|$)/g;else c=/(.*?)(?:[\/]+|$)/g;if(o)var u=/^(?:[a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/][^\\\/]+)?[\\\/]*/;else u=/^[\/]*/;t.realpathSync=function(e,t){if(e=r.resolve(e),t&&Object.prototype.hasOwnProperty.call(t,e))return t[e];var n,s,a,l,f=e,p={},h={};function d(){var t=u.exec(e);n=t[0].length,s=t[0],a=t[0],l="",o&&!h[a]&&(i.lstatSync(a),h[a]=!0)}for(d();n<e.length;){c.lastIndex=n;var m=c.exec(e);if(l=s,s+=m[0],a=l+m[1],n=c.lastIndex,!(h[a]||t&&t[a]===a)){var g;if(t&&Object.prototype.hasOwnProperty.call(t,a))g=t[a];else{var v=i.lstatSync(a);if(!v.isSymbolicLink()){h[a]=!0,t&&(t[a]=a);continue}var y=null;if(!o){var b=v.dev.toString(32)+":"+v.ino.toString(32);p.hasOwnProperty(b)&&(y=p[b])}null===y&&(i.statSync(a),y=i.readlinkSync(a)),g=r.resolve(l,y),t&&(t[a]=g),o||(p[b]=y)}e=r.resolve(g,e.slice(n)),d()}}return t&&(t[f]=e),e},t.realpath=function(e,t,n){if("function"!=typeof n&&(n=a(t),t=null),e=r.resolve(e),t&&Object.prototype.hasOwnProperty.call(t,e))return process.nextTick(n.bind(null,null,t[e]));var s,l,f,p,h=e,d={},m={};function g(){var t=u.exec(e);s=t[0].length,l=t[0],f=t[0],p="",o&&!m[f]?i.lstat(f,function(e){if(e)return n(e);m[f]=!0,v()}):process.nextTick(v)}function v(){if(s>=e.length)return t&&(t[h]=e),n(null,e);c.lastIndex=s;var r=c.exec(e);return p=l,l+=r[0],f=p+r[1],s=c.lastIndex,m[f]||t&&t[f]===f?process.nextTick(v):t&&Object.prototype.hasOwnProperty.call(t,f)?w(t[f]):i.lstat(f,y)}function y(e,r){if(e)return n(e);if(!r.isSymbolicLink())return m[f]=!0,t&&(t[f]=f),process.nextTick(v);if(!o){var s=r.dev.toString(32)+":"+r.ino.toString(32);if(d.hasOwnProperty(s))return b(null,d[s],f)}i.stat(f,function(e){if(e)return n(e);i.readlink(f,function(e,t){o||(d[s]=t),b(e,t)})})}function b(e,o,i){if(e)return n(e);var s=r.resolve(p,o);t&&(t[i]=s),w(s)}function w(t){e=r.resolve(t,e.slice(s)),g()}g()}},function(e,t,n){var r=n(95),o=n(96);e.exports=function(e){if(!e)return[];"{}"===e.substr(0,2)&&(e="\\{\\}"+e.substr(2));return function e(t,n){var i=[];var s=o("{","}",t);if(!s||/\$$/.test(s.pre))return[t];var c=/^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(s.body);var u=/^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(s.body);var f=c||u;var g=s.body.indexOf(",")>=0;if(!f&&!g)return s.post.match(/,.*\}/)?(t=s.pre+"{"+s.body+a+s.post,e(t)):[t];var v;if(f)v=s.body.split(/\.\./);else if(1===(v=function e(t){if(!t)return[""];var n=[];var r=o("{","}",t);if(!r)return t.split(",");var i=r.pre;var s=r.body;var a=r.post;var c=i.split(",");c[c.length-1]+="{"+s+"}";var u=e(a);a.length&&(c[c.length-1]+=u.shift(),c.push.apply(c,u));n.push.apply(n,c);return n}(s.body)).length&&1===(v=e(v[0],!1).map(p)).length){var y=s.post.length?e(s.post,!1):[""];return y.map(function(e){return s.pre+v[0]+e})}var b=s.pre;var y=s.post.length?e(s.post,!1):[""];var w;if(f){var x=l(v[0]),S=l(v[1]),P=Math.max(v[0].length,v[1].length),O=3==v.length?Math.abs(l(v[2])):1,j=d,E=S<x;E&&(O*=-1,j=m);var I=v.some(h);w=[];for(var _=x;j(_,S);_+=O){var A;if(u)"\\"===(A=String.fromCharCode(_))&&(A="");else if(A=String(_),I){var k=P-A.length;if(k>0){var N=new Array(k+1).join("0");A=_<0?"-"+N+A.slice(1):N+A}}w.push(A)}}else w=r(v,function(t){return e(t,!1)});for(var F=0;F<w.length;F++)for(var C=0;C<y.length;C++){var M=b+w[F]+y[C];(!n||f||M)&&i.push(M)}return i}(function(e){return e.split("\\\\").join(i).split("\\{").join(s).split("\\}").join(a).split("\\,").join(c).split("\\.").join(u)}(e),!0).map(f)};var i="\0SLASH"+Math.random()+"\0",s="\0OPEN"+Math.random()+"\0",a="\0CLOSE"+Math.random()+"\0",c="\0COMMA"+Math.random()+"\0",u="\0PERIOD"+Math.random()+"\0";function l(e){return parseInt(e,10)==e?parseInt(e,10):e.charCodeAt(0)}function f(e){return e.split(i).join("\\").split(s).join("{").split(a).join("}").split(c).join(",").split(u).join(".")}function p(e){return"{"+e+"}"}function h(e){return/^-?0\d/.test(e)}function d(e,t){return e<=t}function m(e,t){return e>=t}},function(e,t){e.exports=function(e,t){for(var r=[],o=0;o<e.length;o++){var i=t(e[o],o);n(i)?r.push.apply(r,i):r.push(i)}return r};var n=Array.isArray||function(e){return"[object Array]"===Object.prototype.toString.call(e)}},function(e,t,n){"use strict";function r(e,t,n){e instanceof RegExp&&(e=o(e,n)),t instanceof RegExp&&(t=o(t,n));var r=i(e,t,n);return r&&{start:r[0],end:r[1],pre:n.slice(0,r[0]),body:n.slice(r[0]+e.length,r[1]),post:n.slice(r[1]+t.length)}}function o(e,t){var n=t.match(e);return n?n[0]:null}function i(e,t,n){var r,o,i,s,a,c=n.indexOf(e),u=n.indexOf(t,c+1),l=c;if(c>=0&&u>0){for(r=[],i=n.length;l>=0&&!a;)l==c?(r.push(l),c=n.indexOf(e,l+1)):1==r.length?a=[r.pop(),u]:((o=r.pop())<i&&(i=o,s=u),u=n.indexOf(t,l+1)),l=c<u&&c>=0?c:u;r.length&&(a=[i,s])}return a}e.exports=r,r.range=i},function(e,t,n){try{var r=n(30);if("function"!=typeof r.inherits)throw"";e.exports=r.inherits}catch(t){e.exports=n(98)}},function(e,t){"function"==typeof Object.create?e.exports=function(e,t){e.super_=t,e.prototype=Object.create(t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}})}:e.exports=function(e,t){e.super_=t;var n=function(){};n.prototype=t.prototype,e.prototype=new n,e.prototype.constructor=e}},function(e,t,n){e.exports=d,d.GlobSync=m;var r=n(5),o=n(67),i=n(46),s=(i.Minimatch,n(45).Glob,n(30),n(0)),a=n(47),c=n(48),u=n(69),l=(u.alphasort,u.alphasorti,u.setopts),f=u.ownProp,p=u.childrenIgnored,h=u.isIgnored;function d(e,t){if("function"==typeof t||3===arguments.length)throw new TypeError("callback provided to sync glob\nSee: https://github.com/isaacs/node-glob/issues/167");return new m(e,t).found}function m(e,t){if(!e)throw new Error("must provide pattern");if("function"==typeof t||3===arguments.length)throw new TypeError("callback provided to sync glob\nSee: https://github.com/isaacs/node-glob/issues/167");if(!(this instanceof m))return new m(e,t);if(l(this,e,t),this.noprocess)return this;var n=this.minimatch.set.length;this.matches=new Array(n);for(var r=0;r<n;r++)this._process(this.minimatch.set[r],r,!1);this._finish()}m.prototype._finish=function(){if(a(this instanceof m),this.realpath){var e=this;this.matches.forEach(function(t,n){var r=e.matches[n]=Object.create(null);for(var i in t)try{i=e._makeAbs(i),r[o.realpathSync(i,e.realpathCache)]=!0}catch(t){if("stat"!==t.syscall)throw t;r[e._makeAbs(i)]=!0}})}u.finish(this)},m.prototype._process=function(e,t,n){a(this instanceof m);for(var r,o=0;"string"==typeof e[o];)o++;switch(o){case e.length:return void this._processSimple(e.join("/"),t);case 0:r=null;break;default:r=e.slice(0,o).join("/")}var s,u=e.slice(o);null===r?s=".":c(r)||c(e.join("/"))?(r&&c(r)||(r="/"+r),s=r):s=r;var l=this._makeAbs(s);p(this,s)||(u[0]===i.GLOBSTAR?this._processGlobStar(r,s,l,u,t,n):this._processReaddir(r,s,l,u,t,n))},m.prototype._processReaddir=function(e,t,n,r,o,i){var a=this._readdir(n,i);if(a){for(var c=r[0],u=!!this.minimatch.negate,l=c._glob,f=this.dot||"."===l.charAt(0),p=[],h=0;h<a.length;h++){if("."!==(g=a[h]).charAt(0)||f)(u&&!e?!g.match(c):g.match(c))&&p.push(g)}var d=p.length;if(0!==d)if(1!==r.length||this.mark||this.stat){r.shift();for(h=0;h<d;h++){var m;g=p[h];m=e?[e,g]:[g],this._process(m.concat(r),o,i)}}else{this.matches[o]||(this.matches[o]=Object.create(null));for(var h=0;h<d;h++){var g=p[h];e&&(g="/"!==e.slice(-1)?e+"/"+g:e+g),"/"!==g.charAt(0)||this.nomount||(g=s.join(this.root,g)),this._emitMatch(o,g)}}}},m.prototype._emitMatch=function(e,t){if(!h(this,t)){var n=this._makeAbs(t);if(this.mark&&(t=this._mark(t)),this.absolute&&(t=n),!this.matches[e][t]){if(this.nodir){var r=this.cache[n];if("DIR"===r||Array.isArray(r))return}this.matches[e][t]=!0,this.stat&&this._stat(t)}}},m.prototype._readdirInGlobStar=function(e){if(this.follow)return this._readdir(e,!1);var t,n;try{n=r.lstatSync(e)}catch(e){if("ENOENT"===e.code)return null}var o=n&&n.isSymbolicLink();return this.symlinks[e]=o,o||!n||n.isDirectory()?t=this._readdir(e,!1):this.cache[e]="FILE",t},m.prototype._readdir=function(e,t){if(t&&!f(this.symlinks,e))return this._readdirInGlobStar(e);if(f(this.cache,e)){var n=this.cache[e];if(!n||"FILE"===n)return null;if(Array.isArray(n))return n}try{return this._readdirEntries(e,r.readdirSync(e))}catch(t){return this._readdirError(e,t),null}},m.prototype._readdirEntries=function(e,t){if(!this.mark&&!this.stat)for(var n=0;n<t.length;n++){var r=t[n];r="/"===e?e+r:e+"/"+r,this.cache[r]=!0}return this.cache[e]=t,t},m.prototype._readdirError=function(e,t){switch(t.code){case"ENOTSUP":case"ENOTDIR":var n=this._makeAbs(e);if(this.cache[n]="FILE",n===this.cwdAbs){var r=new Error(t.code+" invalid cwd "+this.cwd);throw r.path=this.cwd,r.code=t.code,r}break;case"ENOENT":case"ELOOP":case"ENAMETOOLONG":case"UNKNOWN":this.cache[this._makeAbs(e)]=!1;break;default:if(this.cache[this._makeAbs(e)]=!1,this.strict)throw t;this.silent||console.error("glob error",t)}},m.prototype._processGlobStar=function(e,t,n,r,o,i){var s=this._readdir(n,i);if(s){var a=r.slice(1),c=e?[e]:[],u=c.concat(a);this._process(u,o,!1);var l=s.length;if(!this.symlinks[n]||!i)for(var f=0;f<l;f++){if("."!==s[f].charAt(0)||this.dot){var p=c.concat(s[f],a);this._process(p,o,!0);var h=c.concat(s[f],r);this._process(h,o,!0)}}}},m.prototype._processSimple=function(e,t){var n=this._stat(e);if(this.matches[t]||(this.matches[t]=Object.create(null)),n){if(e&&c(e)&&!this.nomount){var r=/[\/\\]$/.test(e);"/"===e.charAt(0)?e=s.join(this.root,e):(e=s.resolve(this.root,e),r&&(e+="/"))}"win32"===process.platform&&(e=e.replace(/\\/g,"/")),this._emitMatch(t,e)}},m.prototype._stat=function(e){var t=this._makeAbs(e),n="/"===e.slice(-1);if(e.length>this.maxLength)return!1;if(!this.stat&&f(this.cache,t)){var o=this.cache[t];if(Array.isArray(o)&&(o="DIR"),!n||"DIR"===o)return o;if(n&&"FILE"===o)return!1}var i=this.statCache[t];if(!i){var s;try{s=r.lstatSync(t)}catch(e){if(e&&("ENOENT"===e.code||"ENOTDIR"===e.code))return this.statCache[t]=!1,!1}if(s&&s.isSymbolicLink())try{i=r.statSync(t)}catch(e){i=s}else i=s}this.statCache[t]=i;o=!0;return i&&(o=i.isDirectory()?"DIR":"FILE"),this.cache[t]=this.cache[t]||o,(!n||"FILE"!==o)&&o},m.prototype._mark=function(e){return u.mark(this,e)},m.prototype._makeAbs=function(e){return u.makeAbs(this,e)}},function(e,t,n){var r=n(70),o=Object.create(null),i=n(31);e.exports=r(function(e,t){return o[e]?(o[e].push(t),null):(o[e]=[t],function(e){return i(function t(){var n=o[e],r=n.length,i=function(e){for(var t=e.length,n=[],r=0;r<t;r++)n[r]=e[r];return n}(arguments);try{for(var s=0;s<r;s++)n[s].apply(null,i)}finally{n.length>r?(n.splice(0,r),process.nextTick(function(){t.apply(null,i)})):delete o[e]}})}(e))})},function(e,t,n){"use strict";var r=n(8),o=n(19),i=n(29),s=n(10),a=[].sort,c=[1,2,3];r(r.P+r.F*(s(function(){c.sort(void 0)})||!s(function(){c.sort(null)})||!n(102)(a)),"Array",{sort:function(e){return void 0===e?a.call(i(this)):a.call(i(this),o(e))}})},function(e,t,n){"use strict";var r=n(10);e.exports=function(e,t){return!!e&&r(function(){t?e.call(null,function(){},1):e.call(null)})}},function(e,t,n){"use strict";var r=n(104),o=n(73);e.exports=n(110)("Set",function(e){return function(){return e(this,arguments.length>0?arguments[0]:void 0)}},{add:function(e){return r.def(o(this,"Set"),e=0===e?0:e,e)}},r)},function(e,t,n){"use strict";var r=n(11).f,o=n(71),i=n(40),s=n(12),a=n(37),c=n(38),u=n(106),l=n(109),f=n(63),p=n(9),h=n(72).fastKey,d=n(73),m=p?"_s":"size",g=function(e,t){var n,r=h(t);if("F"!==r)return e._i[r];for(n=e._f;n;n=n.n)if(n.k==t)return n};e.exports={getConstructor:function(e,t,n,u){var l=e(function(e,r){a(e,l,t,"_i"),e._t=t,e._i=o(null),e._f=void 0,e._l=void 0,e[m]=0,null!=r&&c(r,n,e[u],e)});return i(l.prototype,{clear:function(){for(var e=d(this,t),n=e._i,r=e._f;r;r=r.n)r.r=!0,r.p&&(r.p=r.p.n=void 0),delete n[r.i];e._f=e._l=void 0,e[m]=0},delete:function(e){var n=d(this,t),r=g(n,e);if(r){var o=r.n,i=r.p;delete n._i[r.i],r.r=!0,i&&(i.n=o),o&&(o.p=i),n._f==r&&(n._f=o),n._l==r&&(n._l=i),n[m]--}return!!r},forEach:function(e){d(this,t);for(var n,r=s(e,arguments.length>1?arguments[1]:void 0,3);n=n?n.n:this._f;)for(r(n.v,n.k,this);n&&n.r;)n=n.p},has:function(e){return!!g(d(this,t),e)}}),p&&r(l.prototype,"size",{get:function(){return d(this,t)[m]}}),l},def:function(e,t,n){var r,o,i=g(e,t);return i?i.v=n:(e._l=i={i:o=h(t,!0),k:t,v:n,p:r=e._l,n:void 0,r:!1},e._f||(e._f=i),r&&(r.n=i),e[m]++,"F"!==o&&(e._i[o]=i)),e},getEntry:g,setStrong:function(e,t,n){u(e,t,function(e,n){this._t=d(e,t),this._k=n,this._l=void 0},function(){for(var e=this._k,t=this._l;t&&t.r;)t=t.p;return this._t&&(this._l=t=t?t.n:this._t._f)?l(0,"keys"==e?t.k:"values"==e?t.v:[t.k,t.v]):(this._t=void 0,l(1))},n?"entries":"values",!n,!0),f(t)}}},function(e,t,n){var r=n(11),o=n(7),i=n(42);e.exports=n(9)?Object.defineProperties:function(e,t){o(e);for(var n,s=i(t),a=s.length,c=0;a>c;)r.f(e,n=s[c++],t[n]);return e}},function(e,t,n){"use strict";var r=n(36),o=n(8),i=n(14),s=n(13),a=n(39),c=n(107),u=n(26),l=n(108),f=n(3)("iterator"),p=!([].keys&&"next"in[].keys()),h=function(){return this};e.exports=function(e,t,n,d,m,g,v){c(n,t,d);var y,b,w,x=function(e){if(!p&&e in j)return j[e];switch(e){case"keys":case"values":return function(){return new n(this,e)}}return function(){return new n(this,e)}},S=t+" Iterator",P="values"==m,O=!1,j=e.prototype,E=j[f]||j["@@iterator"]||m&&j[m],I=E||x(m),_=m?P?x("entries"):I:void 0,A="Array"==t&&j.entries||E;if(A&&(w=l(A.call(new e)))!==Object.prototype&&w.next&&(u(w,S,!0),r||"function"==typeof w[f]||s(w,f,h)),P&&E&&"values"!==E.name&&(O=!0,I=function(){return E.call(this)}),r&&!v||!p&&!O&&j[f]||s(j,f,I),a[t]=I,a[S]=h,m)if(y={values:P?I:x("values"),keys:g?I:x("keys"),entries:_},v)for(b in y)b in j||i(j,b,y[b]);else o(o.P+o.F*(p||O),t,y);return y}},function(e,t,n){"use strict";var r=n(71),o=n(23),i=n(26),s={};n(13)(s,n(3)("iterator"),function(){return this}),e.exports=function(e,t,n){e.prototype=r(s,{next:o(1,n)}),i(e,t+" Iterator")}},function(e,t,n){var r=n(15),o=n(29),i=n(43)("IE_PROTO"),s=Object.prototype;e.exports=Object.getPrototypeOf||function(e){return e=o(e),r(e,i)?e[i]:"function"==typeof e.constructor&&e instanceof e.constructor?e.constructor.prototype:e instanceof Object?s:null}},function(e,t){e.exports=function(e,t){return{value:t,done:!!e}}},function(e,t,n){"use strict";var r=n(4),o=n(8),i=n(14),s=n(40),a=n(72),c=n(38),u=n(37),l=n(6),f=n(10),p=n(41),h=n(26),d=n(111);e.exports=function(e,t,n,m,g,v){var y=r[e],b=y,w=g?"set":"add",x=b&&b.prototype,S={},P=function(e){var t=x[e];i(x,e,"delete"==e?function(e){return!(v&&!l(e))&&t.call(this,0===e?0:e)}:"has"==e?function(e){return!(v&&!l(e))&&t.call(this,0===e?0:e)}:"get"==e?function(e){return v&&!l(e)?void 0:t.call(this,0===e?0:e)}:"add"==e?function(e){return t.call(this,0===e?0:e),this}:function(e,n){return t.call(this,0===e?0:e,n),this})};if("function"==typeof b&&(v||x.forEach&&!f(function(){(new b).entries().next()}))){var O=new b,j=O[w](v?{}:-0,1)!=O,E=f(function(){O.has(1)}),I=p(function(e){new b(e)}),_=!v&&f(function(){for(var e=new b,t=5;t--;)e[w](t,t);return!e.has(-0)});I||((b=t(function(t,n){u(t,b,e);var r=d(new y,t,b);return null!=n&&c(n,g,r[w],r),r})).prototype=x,x.constructor=b),(E||_)&&(P("delete"),P("has"),g&&P("get")),(_||j)&&P(w),v&&x.clear&&delete x.clear}else b=m.getConstructor(t,e,g,w),s(b.prototype,n),a.NEED=!0;return h(b,e),S[e]=b,o(o.G+o.W+o.F*(b!=y),S),v||m.setStrong(b,e,g),b}},function(e,t,n){var r=n(6),o=n(112).set;e.exports=function(e,t,n){var i,s=t.constructor;return s!==n&&"function"==typeof s&&(i=s.prototype)!==n.prototype&&r(i)&&o&&o(e,i),e}},function(e,t,n){var r=n(6),o=n(7),i=function(e,t){if(o(e),!r(t)&&null!==t)throw TypeError(t+": can't set as prototype!")};e.exports={set:Object.setPrototypeOf||("__proto__"in{}?function(e,t,r){try{(r=n(12)(Function.call,n(113).f(Object.prototype,"__proto__").set,2))(e,[]),t=!(e instanceof Array)}catch(e){t=!0}return function(e,n){return i(e,n),t?e.__proto__=n:r(e,n),e}}({},!1):void 0),check:i}},function(e,t,n){var r=n(44),o=n(23),i=n(25),s=n(51),a=n(15),c=n(50),u=Object.getOwnPropertyDescriptor;t.f=n(9)?u:function(e,t){if(e=i(e),t=s(t,!0),c)try{return u(e,t)}catch(e){}if(a(e,t))return o(!r.f.call(e,t),e[t])}},function(e,t,n){"use strict";var r=n(12),o=n(8),i=n(29),s=n(57),a=n(58),c=n(35),u=n(115),l=n(59);o(o.S+o.F*!n(41)(function(e){Array.from(e)}),"Array",{from:function(e){var t,n,o,f,p=i(e),h="function"==typeof this?this:Array,d=arguments.length,m=d>1?arguments[1]:void 0,g=void 0!==m,v=0,y=l(p);if(g&&(m=r(m,d>2?arguments[2]:void 0,2)),null==y||h==Array&&a(y))for(n=new h(t=c(p.length));t>v;v++)u(n,v,g?m(p[v],v):p[v]);else for(f=y.call(p),n=new h;!(o=f.next()).done;v++)u(n,v,g?s(f,m,[o.value,v],!0):o.value);return n.length=v,n}})},function(e,t,n){"use strict";var r=n(11),o=n(23);e.exports=function(e,t,n){t in e?r.f(e,t,o(0,n)):e[t]=n}},function(e,t,n){"use strict";n(117);var r=n(7),o=n(75),i=n(9),s=/./.toString,a=function(e){n(14)(RegExp.prototype,"toString",e,!0)};n(10)(function(){return"/a/b"!=s.call({source:"a",flags:"b"})})?a(function(){var e=r(this);return"/".concat(e.source,"/","flags"in e?e.flags:!i&&e instanceof RegExp?o.call(e):void 0)}):"toString"!=s.name&&a(function(){return s.call(this)})},function(e,t,n){n(9)&&"g"!=/./g.flags&&n(11).f(RegExp.prototype,"flags",{configurable:!0,get:n(75)})},function(e,t,n){var r;n(5);function o(e,t,n){if("function"==typeof t&&(n=t,t={}),!n){if("function"!=typeof Promise)throw new TypeError("callback not provided");return new Promise(function(n,r){o(e,t||{},function(e,t){e?r(e):n(t)})})}r(e,t||{},function(e,r){e&&("EACCES"===e.code||t&&t.ignoreErrors)&&(e=null,r=!1),n(e,r)})}r="win32"===process.platform||global.TESTING_WINDOWS?n(119):n(120),e.exports=o,o.sync=function(e,t){try{return r.sync(e,t||{})}catch(e){if(t&&t.ignoreErrors||"EACCES"===e.code)return!1;throw e}}},function(e,t,n){e.exports=i,i.sync=function(e,t){return o(r.statSync(e),e,t)};var r=n(5);function o(e,t,n){return!(!e.isSymbolicLink()&&!e.isFile())&&function(e,t){var n=void 0!==t.pathExt?t.pathExt:process.env.PATHEXT;if(!n)return!0;if(-1!==(n=n.split(";")).indexOf(""))return!0;for(var r=0;r<n.length;r++){var o=n[r].toLowerCase();if(o&&e.substr(-o.length).toLowerCase()===o)return!0}return!1}(t,n)}function i(e,t,n){r.stat(e,function(r,i){n(r,!r&&o(i,e,t))})}},function(e,t,n){e.exports=o,o.sync=function(e,t){return i(r.statSync(e),t)};var r=n(5);function o(e,t,n){r.stat(e,function(e,r){n(e,!e&&i(r,t))})}function i(e,t){return e.isFile()&&function(e,t){var n=e.mode,r=e.uid,o=e.gid,i=void 0!==t.uid?t.uid:process.getuid&&process.getuid(),s=void 0!==t.gid?t.gid:process.getgid&&process.getgid(),a=parseInt("100",8),c=parseInt("010",8),u=parseInt("001",8),l=a|c;return n&u||n&c&&o===s||n&a&&r===i||n&l&&0===i}(e,t)}},function(e,t,n){"use strict";e.exports={androidSystemImages:/system-images;([\S \t]+)/g,androidAPILevels:/platforms;android-(\d+)[\S\s]/g,androidBuildTools:/build-tools;([\d|.]+)[\S\s]/g}},function(e,t,n){"use strict";n(2);var r=n(1);e.exports={getNodeInfo:function(){return r.log("trace","getNodeInfo"),Promise.all([r.isWindows?r.run("node -v").then(r.findVersion):r.which("node").then(function(e){return e?r.run(e+" -v"):Promise.resolve("")}).then(r.findVersion),r.which("node").then(r.condensePath)]).then(function(e){return r.determineFound("Node",e[0],e[1])})},getnpmInfo:function(){return r.log("trace","getnpmInfo"),Promise.all([r.run("npm -v"),r.which("npm").then(r.condensePath)]).then(function(e){return r.determineFound("npm",e[0],e[1])})},getWatchmanInfo:function(){return r.log("trace","getWatchmanInfo"),Promise.all([r.which("watchman").then(function(e){return e?r.run(e+" -v"):void 0}),r.which("watchman")]).then(function(e){return r.determineFound("Watchman",e[0],e[1])})},getYarnInfo:function(){return r.log("trace","getYarnInfo"),Promise.all([r.run("yarn -v"),r.which("yarn").then(r.condensePath)]).then(function(e){return r.determineFound("Yarn",e[0],e[1])})}}},function(e,t,n){"use strict";n(16),n(2),n(27);var r=n(5),o=n(17),i=n(1),s=n(0);e.exports={getBraveBrowserInfo:function(){return i.log("trace","getBraveBrowser"),(i.isLinux?i.run("brave --version || brave-browser --version").then(function(e){return e.replace(/^.* ([^ ]*)/g,"$1")}):i.isMacOS?i.getDarwinApplicationVersion(i.browserBundleIdentifiers["Brave Browser"]).then(i.findVersion):Promise.resolve("N/A")).then(function(e){return i.determineFound("Brave Browser",e,"N/A")})},getChromeInfo:function(){var e;if(i.log("trace","getChromeInfo"),i.isLinux)e=i.run("google-chrome --version").then(function(e){return e.replace(" dev","").replace(/^.* ([^ ]*)/g,"$1")});else if(i.isMacOS)e=i.getDarwinApplicationVersion(i.browserBundleIdentifiers.Chrome).then(i.findVersion);else if(i.isWindows){var t;try{t=i.findVersion(r.readdirSync(s.join(process.env["ProgramFiles(x86)"],"Google/Chrome/Application")).join("\n"))}catch(e){t=i.NotFound}e=Promise.resolve(t)}else e=Promise.resolve("N/A");return e.then(function(e){return i.determineFound("Chrome",e,"N/A")})},getChromeCanaryInfo:function(){return i.log("trace","getChromeCanaryInfo"),i.getDarwinApplicationVersion(i.browserBundleIdentifiers["Chrome Canary"]).then(function(e){return i.determineFound("Chrome Canary",e,"N/A")})},getChromiumInfo:function(){return i.log("trace","getChromiumInfo"),(i.isLinux?i.run("chromium --version").then(i.findVersion):Promise.resolve("N/A")).then(function(e){return i.determineFound("Chromium",e,"N/A")})},getEdgeInfo:function(){var e;if(i.log("trace","getEdgeInfo"),i.isWindows&&"10"===o.release().split(".")[0]){var t={Spartan:"Microsoft.MicrosoftEdge",Chromium:"Microsoft.MicrosoftEdge.Stable",ChromiumDev:"Microsoft.MicrosoftEdge.Dev"};e=Promise.all(Object.keys(t).map(function(e){return function(e,t){return i.run(`powershell get-appxpackage ${e}`).then(function(e){if(""!==i.findVersion(e))return`${t} (${i.findVersion(e)})`})}(t[e],e)}).filter(function(e){return void 0!==e}))}else{if(!i.isMacOS)return Promise.resolve("N/A");e=i.getDarwinApplicationVersion(i.browserBundleIdentifiers["Microsoft Edge"])}return e.then(function(e){return i.determineFound("Edge",Array.isArray(e)?e.filter(function(e){return void 0!==e}):e,i.NA)})},getFirefoxInfo:function(){return i.log("trace","getFirefoxInfo"),(i.isLinux?i.run("firefox --version").then(function(e){return e.replace(/^.* ([^ ]*)/g,"$1")}):i.isMacOS?i.getDarwinApplicationVersion(i.browserBundleIdentifiers.Firefox):Promise.resolve("N/A")).then(function(e){return i.determineFound("Firefox",e,"N/A")})},getFirefoxDeveloperEditionInfo:function(){return i.log("trace","getFirefoxDeveloperEditionInfo"),i.getDarwinApplicationVersion(i.browserBundleIdentifiers["Firefox Developer Edition"]).then(function(e){return i.determineFound("Firefox Developer Edition",e,"N/A")})},getFirefoxNightlyInfo:function(){return i.log("trace","getFirefoxNightlyInfo"),(i.isLinux?i.run("firefox-trunk --version").then(function(e){return e.replace(/^.* ([^ ]*)/g,"$1")}):i.isMacOS?i.getDarwinApplicationVersion(i.browserBundleIdentifiers["Firefox Nightly"]):Promise.resolve("N/A")).then(function(e){return i.determineFound("Firefox Nightly",e,"N/A")})},getInternetExplorerInfo:function(){var e;if(i.log("trace","getInternetExplorerInfo"),i.isWindows){var t=[process.env.SYSTEMDRIVE||"C:","Program Files","Internet Explorer","iexplore.exe"].join("\\\\");e=i.run(`wmic datafile where "name='${t}'" get Version`).then(i.findVersion)}else e=Promise.resolve("N/A");return e.then(function(e){return i.determineFound("Internet Explorer",e,"N/A")})},getSafariTechnologyPreviewInfo:function(){return i.log("trace","getSafariTechnologyPreviewInfo"),i.getDarwinApplicationVersion(i.browserBundleIdentifiers["Safari Technology Preview"]).then(function(e){return i.determineFound("Safari Technology Preview",e,"N/A")})},getSafariInfo:function(){return i.log("trace","getSafariInfo"),i.getDarwinApplicationVersion(i.browserBundleIdentifiers.Safari).then(function(e){return i.determineFound("Safari",e,"N/A")})}}},function(e,t,n){"use strict";n(32),n(2);var r=n(1);e.exports={getMongoDBInfo:function(){return r.log("trace","getMongoDBInfo"),Promise.all([r.run("mongo --version").then(r.findVersion),r.which("mongo")]).then(function(e){return r.determineFound("MongoDB",e[0],e[1])})},getMySQLInfo:function(){return r.log("trace","getMySQLInfo"),Promise.all([r.run("mysql --version").then(function(e){return`${r.findVersion(e,null,1)}${e.includes("MariaDB")?" (MariaDB)":""}`}),r.which("mysql")]).then(function(e){return r.determineFound("MySQL",e[0],e[1])})},getPostgreSQLInfo:function(){return r.log("trace","getPostgreSQLInfo"),Promise.all([r.run("postgres --version").then(r.findVersion),r.which("postgres")]).then(function(e){return r.determineFound("PostgreSQL",e[0],e[1])})},getSQLiteInfo:function(){return r.log("trace","getSQLiteInfo"),Promise.all([r.run("sqlite3 --version").then(r.findVersion),r.which("sqlite3")]).then(function(e){return r.determineFound("SQLite",e[0],e[1])})}}},function(e,t,n){"use strict";n(27),n(16),n(2);var r=n(0),o=n(1);e.exports={getAndroidStudioInfo:function(){var e=Promise.resolve("N/A");return o.isMacOS?e=o.run(o.generatePlistBuddyCommand(r.join("/","Applications","Android\\ Studio.app","Contents","Info.plist"),["CFBundleShortVersionString","CFBundleVersion"])).then(function(e){return e||o.run(o.generatePlistBuddyCommand(r.join("~","Applications","JetBrains\\ Toolbox","Android\\ Studio.app","Contents","Info.plist"),["CFBundleShortVersionString","CFBundleVersion"]))}).then(function(e){return e.split("\n").join(" ")}):o.isLinux?e=Promise.all([o.run('cat /opt/android-studio/bin/studio.sh | grep "$Home/.AndroidStudio" | head -1').then(o.findVersion),o.run("cat /opt/android-studio/build.txt")]).then(function(e){return`${e[0]} ${e[1]}`.trim()||o.NotFound}):o.isWindows&&(e=Promise.all([o.run('wmic datafile where name="C:\\\\Program Files\\\\Android\\\\Android Studio\\\\bin\\\\studio.exe" get Version').then(function(e){return e.replace(/(\r\n|\n|\r)/gm,"")}),o.run('type "C:\\\\Program Files\\\\Android\\\\Android Studio\\\\build.txt"').then(function(e){return e.replace(/(\r\n|\n|\r)/gm,"")})]).then(function(e){return`${e[0]} ${e[1]}`.trim()||o.NotFound})),e.then(function(e){return o.determineFound("Android Studio",e)})},getAtomInfo:function(){return o.log("trace","getAtomInfo"),Promise.all([o.getDarwinApplicationVersion(o.ideBundleIdentifiers.Atom),"N/A"]).then(function(e){return o.determineFound("Atom",e[0],e[1])})},getEmacsInfo:function(){return o.log("trace","getEmacsInfo"),o.isMacOS||o.isLinux?Promise.all([o.run("emacs --version").then(o.findVersion),o.run("which emacs")]).then(function(e){return o.determineFound("Emacs",e[0],e[1])}):Promise.resolve(["Emacs","N/A"])},getIntelliJInfo:function(){return o.log("trace","getIntelliJInfo"),o.getDarwinApplicationVersion(o.ideBundleIdentifiers.IntelliJ).then(function(e){return o.determineFound("IntelliJ",e)})},getNanoInfo:function(){return o.log("trace","getNanoInfo"),o.isMacOS||o.isLinux?Promise.all([o.run("nano --version").then(o.findVersion),o.run("which nano")]).then(function(e){return o.determineFound("Nano",e[0],e[1])}):Promise.resolve(["Nano","N/A"])},getNvimInfo:function(){return o.log("trace","getNvimInfo"),o.isMacOS||o.isLinux?Promise.all([o.run("nvim --version").then(o.findVersion),o.run("which nvim")]).then(function(e){return o.determineFound("Nvim",e[0],e[1])}):Promise.resolve(["Vim","N/A"])},getPhpStormInfo:function(){return o.log("trace","getPhpStormInfo"),o.getDarwinApplicationVersion(o.ideBundleIdentifiers.PhpStorm).then(function(e){return o.determineFound("PhpStorm",e)})},getSublimeTextInfo:function(){return o.log("trace","getSublimeTextInfo"),Promise.all([o.run("subl --version").then(function(e){return o.findVersion(e,/\d+/)}),o.which("subl")]).then(function(e){return""===e[0]&&o.isMacOS?(o.log("trace","getSublimeTextInfo using plist"),Promise.all([o.getDarwinApplicationVersion(o.ideBundleIdentifiers["Sublime Text"]),"N/A"])):e}).then(function(e){return o.determineFound("Sublime Text",e[0],e[1])})},getVimInfo:function(){return o.log("trace","getVimInfo"),o.isMacOS||o.isLinux?Promise.all([o.run("vim --version").then(o.findVersion),o.run("which vim")]).then(function(e){return o.determineFound("Vim",e[0],e[1])}):Promise.resolve(["Vim","N/A"])},getVSCodeInfo:function(){return o.log("trace","getVSCodeInfo"),Promise.all([o.run("code --version").then(o.findVersion),o.which("code")]).then(function(e){return o.determineFound("VSCode",e[0],e[1])})},getVisualStudioInfo:function(){return o.log("trace","getVisualStudioInfo"),o.isWindows?o.run(`"${process.env["ProgramFiles(x86)"]}/Microsoft Visual Studio/Installer/vswhere.exe" -format json -prerelease`).then(function(e){var t=JSON.parse(e).map(function(e){return{Version:e.installationVersion,DisplayName:e.displayName}});return o.determineFound("Visual Studio",t.map(function(e){return`${e.Version} (${e.DisplayName})`}))}).catch(function(){return Promise.resolve(["Visual Studio",o.NotFound])}):Promise.resolve(["Visual Studio",o.NA])},getWebStormInfo:function(){return o.log("trace","getWebStormInfo"),o.getDarwinApplicationVersion(o.ideBundleIdentifiers.WebStorm).then(function(e){return o.determineFound("WebStorm",e)})},getXcodeInfo:function(){return o.log("trace","getXcodeInfo"),o.isMacOS?Promise.all([o.which("xcodebuild").then(function(e){return o.run(e+" -version")}).then(function(e){return`${o.findVersion(e)}/${e.split("Build version ")[1]}`}),o.which("xcodebuild")]).then(function(e){return o.determineFound("Xcode",e[0],e[1])}):Promise.resolve(["Xcode","N/A"])}}},function(e,t,n){"use strict";n(2);var r=n(1);e.exports={getBashInfo:function(){return r.log("trace","getBashInfo"),Promise.all([r.run("bash --version").then(r.findVersion),r.which("bash")]).then(function(e){return r.determineFound("Bash",e[0],e[1])})},getElixirInfo:function(){return r.log("trace","getElixirInfo"),Promise.all([r.run("elixir --version").then(function(e){return r.findVersion(e,/[Elixir]+\s([\d+.[\d+|.]+)/,1)}),r.which("elixir")]).then(function(e){return Promise.resolve(r.determineFound("Elixir",e[0],e[1]))})},getErlangInfo:function(){return r.log("trace","getErlangInfo"),Promise.all([r.run("erl -eval \"{ok, Version} = file:read_file(filename:join([code:root_dir(), 'releases', erlang:system_info(otp_release), 'OTP_VERSION'])), io:fwrite(Version), halt().\" -noshell").then(r.findVersion),r.which("erl")]).then(function(e){return Promise.resolve(r.determineFound("Erlang",e[0],e[1]))})},getGoInfo:function(){return r.log("trace","getGoInfo"),Promise.all([r.run("go version").then(r.findVersion),r.which("go")]).then(function(e){return r.determineFound("Go",e[0],e[1])})},getJavaInfo:function(){return r.log("trace","getJavaInfo"),Promise.all([r.run("javac -version",{unify:!0}).then(function(e){return r.findVersion(e,/\d+\.[\w+|.|_|-]+/)}),r.run("which javac")]).then(function(e){return r.determineFound("Java",e[0],e[1])})},getPerlInfo:function(){return r.log("trace","getPerlInfo"),Promise.all([r.run("perl -v").then(r.findVersion),r.which("perl")]).then(function(e){return r.determineFound("Perl",e[0],e[1])})},getPHPInfo:function(){return r.log("trace","getPHPInfo"),Promise.all([r.run("php -v").then(r.findVersion),r.which("php")]).then(function(e){return r.determineFound("PHP",e[0],e[1])})},getProtocInfo:function(){return r.log("trace","getProtocInfo"),Promise.all([r.run("protoc --version").then(r.findVersion),r.run("which protoc")]).then(function(e){return r.determineFound("Protoc",e[0],e[1])})},getPythonInfo:function(){return r.log("trace","getPythonInfo"),Promise.all([r.run("python -V 2>&1").then(r.findVersion),r.run("which python")]).then(function(e){return r.determineFound("Python",e[0],e[1])})},getPython3Info:function(){return r.log("trace","getPython3Info"),Promise.all([r.run("python3 -V 2>&1").then(r.findVersion),r.run("which python3")]).then(function(e){return r.determineFound("Python3",e[0],e[1])})},getRInfo:function(){return r.log("trace","getRInfo"),Promise.all([r.run("R --version",{unify:!0}).then(r.findVersion),r.which("R")]).then(function(e){return r.determineFound("R",e[0],e[1])})},getRubyInfo:function(){return r.log("trace","getRubyInfo"),Promise.all([r.run("ruby -v").then(r.findVersion),r.which("ruby")]).then(function(e){return r.determineFound("Ruby",e[0],e[1])})},getRustInfo:function(){return r.log("trace","getRustInfo"),Promise.all([r.run("rustc --version").then(r.findVersion),r.run("which rustc")]).then(function(e){return r.determineFound("Rust",e[0],e[1])})},getScalaInfo:function(){return r.log("trace","getScalaInfo"),r.isMacOS||r.isLinux?Promise.all([r.run("scalac -version").then(r.findVersion),r.run("which scalac")]).then(function(e){return r.determineFound("Scala",e[0],e[1])}):Promise.resolve(["Scala","N/A"])}}},function(e,t,n){"use strict";n(2);var r=n(1);e.exports={getAptInfo:function(){return r.log("trace","getAptInfo"),r.isLinux?Promise.all([r.run("apt --version").then(r.findVersion),r.which("apt")]).then(function(e){return r.determineFound("Apt",e[0],e[1])}):Promise.all(["Apt","N/A"])},getCargoInfo:function(){return r.log("trace","getCargoInfo"),Promise.all([r.run("cargo --version").then(r.findVersion),r.which("cargo").then(r.condensePath)]).then(function(e){return r.determineFound("Cargo",e[0],e[1])})},getCocoaPodsInfo:function(){return r.log("trace","getCocoaPodsInfo"),r.isMacOS?Promise.all([r.run("pod --version").then(r.findVersion),r.which("pod")]).then(function(e){return r.determineFound("CocoaPods",e[0],e[1])}):Promise.all(["CocoaPods","N/A"])},getComposerInfo:function(){return r.log("trace","getComposerInfo"),Promise.all([r.run("composer --version").then(r.findVersion),r.which("composer").then(r.condensePath)]).then(function(e){return r.determineFound("Composer",e[0],e[1])})},getGradleInfo:function(){return r.log("trace","getGradleInfo"),Promise.all([r.run("gradle --version").then(r.findVersion),r.which("gradle").then(r.condensePath)]).then(function(e){return r.determineFound("Gradle",e[0],e[1])})},getHomebrewInfo:function(){return r.log("trace","getHomebrewInfo"),r.isMacOS?Promise.all([r.run("brew --version").then(r.findVersion),r.which("brew")]).then(function(e){return r.determineFound("Homebrew",e[0],e[1])}):Promise.all(["Homebrew","N/A"])},getMavenInfo:function(){return r.log("trace","getMavenInfo"),Promise.all([r.run("mvn --version").then(r.findVersion),r.which("mvn").then(r.condensePath)]).then(function(e){return r.determineFound("Maven",e[0],e[1])})},getpip2Info:function(){return r.log("trace","getpip2Info"),Promise.all([r.run("pip2 --version").then(r.findVersion),r.which("pip2").then(r.condensePath)]).then(function(e){return r.determineFound("pip2",e[0],e[1])})},getpip3Info:function(){return r.log("trace","getpip3Info"),Promise.all([r.run("pip3 --version").then(r.findVersion),r.which("pip3").then(r.condensePath)]).then(function(e){return r.determineFound("pip3",e[0],e[1])})},getRubyGemsInfo:function(){return r.log("trace","getRubyGemsInfo"),Promise.all([r.run("gem --version").then(r.findVersion),r.which("gem")]).then(function(e){return r.determineFound("RubyGems",e[0],e[1])})},getYumInfo:function(){return r.log("trace","getYumInfo"),r.isLinux?Promise.all([r.run("yum --version").then(r.findVersion),r.which("yum")]).then(function(e){return r.determineFound("Yum",e[0],e[1])}):Promise.all(["Yum","N/A"])}}},function(e,t,n){"use strict";n(2);var r=n(1),o=n(0);e.exports={getYarnWorkspacesInfo:function(){return r.log("trace","getYarnWorkspacesInfo"),Promise.all([r.run("yarn -v"),r.getPackageJsonByPath("package.json").then(function(e){return e&&"workspaces"in e})]).then(function(e){var t="Yarn Workspaces";return e[0]&&e[1]?Promise.resolve([t,e[0]]):Promise.resolve([t,"Not Found"])})},getLernaInfo:function(){return r.log("trace","getLernaInfo"),Promise.all([r.getPackageJsonByName("lerna").then(function(e){return e&&e.version}),r.fileExists(o.join(process.cwd(),"lerna.json"))]).then(function(e){return e[0]&&e[1]?Promise.resolve(["Lerna",e[0]]):Promise.resolve(["Lerna","Not Found"])})}}},function(e,t,n){"use strict";n(22),n(2),n(16);var r=n(5),o=n(0),i=n(1);e.exports={getAndroidSDKInfo:function(){return i.run("sdkmanager --list").then(function(e){return!e&&process.env.ANDROID_HOME?i.run(`${process.env.ANDROID_HOME}/tools/bin/sdkmanager --list`):e}).then(function(e){return!e&&process.env.ANDROID_HOME?i.run(`${process.env.ANDROID_HOME}/cmdline-tools/latest/bin/sdkmanager --list`):e}).then(function(e){return!e&&i.isMacOS?i.run("~/Library/Android/sdk/tools/bin/sdkmanager --list"):e}).then(function(e){var t=i.parseSDKManagerOutput(e),n=function(e){var t,n=o.join(e,"source.properties");try{t=r.readFileSync(n,"utf8")}catch(e){if("ENOENT"===e.code)return;throw e}for(var i=t.split("\n"),s=0;s<i.length;s+=1){var a=i[s].split("=");if(2===a.length&&"Pkg.Revision"===a[0].trim())return a[1].trim()}},s=process.env.ANDROID_NDK?n(process.env.ANDROID_NDK):process.env.ANDROID_NDK_HOME?n(process.env.ANDROID_NDK_HOME):process.env.ANDROID_HOME?n(o.join(process.env.ANDROID_HOME,"ndk-bundle")):void 0;return t.buildTools.length||t.apiLevels.length||t.systemImages.length||s?Promise.resolve(["Android SDK",{"API Levels":t.apiLevels||i.NotFound,"Build Tools":t.buildTools||i.NotFound,"System Images":t.systemImages||i.NotFound,"Android NDK":s||i.NotFound}]):Promise.resolve(["Android SDK",i.NotFound])})},getiOSSDKInfo:function(){return i.isMacOS?i.run("xcodebuild -showsdks").then(function(e){return e.match(/[\w]+\s[\d|.]+/g)}).then(i.uniq).then(function(e){return e.length?["iOS SDK",{Platforms:e}]:["iOS SDK",i.NotFound]}):Promise.resolve(["iOS SDK","N/A"])},getWindowsSDKInfo:function(){if(i.log("trace","getWindowsSDKInfo"),i.isWindows){var e=i.NotFound;return i.run("reg query HKLM\\SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\AppModelUnlock").then(function(t){e=t.split(/[\r\n]/g).slice(1).filter(function(e){return""!==e}).reduce(function(e,t){var n=t.match(/[^\s]+/g);return"0x0"!==n[2]&&"0x1"!==n[2]||(n[2]="0x1"===n[2]?"Enabled":"Disabled"),e[n[0]]=n[2],e},{}),0===Object.keys(e).length&&(e=i.NotFound);try{var n=r.readdirSync(`${process.env["ProgramFiles(x86)"]}/Windows Kits/10/Platforms/UAP`);e.Versions=n}catch(e){}return Promise.resolve(["Windows SDK",e])})}return Promise.resolve(["Windows SDK",i.NA])}}},function(e,t,n){"use strict";n(2);var r=n(1);e.exports={getApacheInfo:function(){return r.log("trace","getApacheInfo"),r.isMacOS||r.isLinux?Promise.all([r.run("apachectl -v").then(r.findVersion),r.run("which apachectl")]).then(function(e){return r.determineFound("Apache",e[0],e[1])}):Promise.resolve(["Apache","N/A"])},getNginxInfo:function(){return r.log("trace","getNginxInfo"),r.isMacOS||r.isLinux?Promise.all([r.run("nginx -v 2>&1").then(r.findVersion),r.run("which nginx")]).then(function(e){return r.determineFound("Nginx",e[0],e[1])}):Promise.resolve(["Nginx","N/A"])}}},function(e,t,n){"use strict";n(22),n(2);var r=n(132),o=n(1),i=n(17);e.exports={getContainerInfo:function(){return o.log("trace","getContainerInfo"),o.isLinux?Promise.all([o.fileExists("/.dockerenv"),o.readFile("/proc/self/cgroup")]).then(function(e){return o.log("trace","getContainerInfoThen",e),Promise.resolve(["Container",e[0]||e[1]?"Yes":"N/A"])}).catch(function(e){return o.log("trace","getContainerInfoCatch",e)}):Promise.resolve(["Container","N/A"])},getCPUInfo:function(){var e;o.log("trace","getCPUInfo");try{var t=i.cpus();e="("+t.length+") "+i.arch()+" "+t[0].model}catch(t){e="Unknown"}return Promise.all(["CPU",e])},getMemoryInfo:function(){return o.log("trace","getMemoryInfo"),Promise.all(["Memory",`${o.toReadableBytes(i.freemem())} / ${o.toReadableBytes(i.totalmem())}`])},getOSInfo:function(){return o.log("trace","getOSInfo"),(o.isMacOS?o.run("sw_vers -productVersion "):o.isLinux?o.run("cat /etc/os-release").then(function(e){var t=(e||"").match(/NAME="(.+)"/)||"",n=(e||"").match(/VERSION="(.+)"/)||["",""],r=null!==n?n[1]:"";return`${t[1]} ${r}`.trim()||""}):o.isWindows?Promise.resolve(i.release()):Promise.resolve()).then(function(e){var t=r(i.platform(),i.release());return e&&(t+=` ${e}`),["OS",t]})},getShellInfo:function(){if(o.log("trace","getShellInfo",process.env),o.isMacOS||o.isLinux){var e=process.env.SHELL||o.runSync("getent passwd $LOGNAME | cut -d: -f7 | head -1"),t=`${e} --version 2>&1`;return e.match("/bin/ash")&&(t=`${e} --help 2>&1`),Promise.all([o.run(t).then(o.findVersion),o.which(e)]).then(function(e){return o.determineFound("Shell",e[0]||"Unknown",e[1])})}return Promise.resolve(["Shell","N/A"])},getGLibcInfo:function(){return o.log("trace","getGLibc"),o.isLinux?Promise.all([o.run("ldd --version").then(o.findVersion)]).then(function(e){return o.determineFound("GLibc",e[0]||"Unknown")}):Promise.resolve(["GLibc","N/A"])}}},function(e,t,n){"use strict";const r=n(17),o=n(133),i=n(134);e.exports=((e,t)=>{if(!e&&t)throw new Error("You can't specify a `release` without specifying `platform`");let n;if("darwin"===(e=e||r.platform()))return t||"darwin"!==r.platform()||(t=r.release()),(t?Number(t.split(".")[0])>15?"macOS":"OS X":"macOS")+((n=t?o(t).name:"")?" "+n:"");return"linux"===e?(t||"linux"!==r.platform()||(t=r.release()),"Linux"+((n=t?t.replace(/^(\d+\.\d+).*/,"$1"):"")?" "+n:"")):"win32"===e?(t||"win32"!==r.platform()||(t=r.release()),"Windows"+((n=t?i(t):"")?" "+n:"")):e})},function(e,t,n){"use strict";const r=n(17),o=new Map([[18,"Mojave"],[17,"High Sierra"],[16,"Sierra"],[15,"El Capitan"],[14,"Yosemite"],[13,"Mavericks"],[12,"Mountain Lion"],[11,"Lion"],[10,"Snow Leopard"],[9,"Leopard"],[8,"Tiger"],[7,"Panther"],[6,"Jaguar"],[5,"Puma"]]),i=e=>(e=Number((e||r.release()).split(".")[0]),{name:o.get(e),version:"10."+(e-4)});e.exports=i,e.exports.default=i},function(e,t,n){"use strict";const r=n(17),o=n(135),i=new Map([["10.0","10"],["6.3","8.1"],["6.2","8"],["6.1","7"],["6.0","Vista"],["5.2","Server 2003"],["5.1","XP"],["5.0","2000"],["4.9","ME"],["4.1","98"],["4.0","95"]]);e.exports=(e=>{const t=/\d+\.\d/.exec(e||r.release());if(e&&!t)throw new Error("`release` argument doesn't match `n.n`");const n=(t||[])[0];if((!e||e===r.release())&&["6.1","6.2","6.3","10.0"].includes(n)){const e=((o.sync("wmic",["os","get","Caption"]).stdout||"").match(/2008|2012|2016/)||[])[0];if(e)return`Server ${e}`}return i.get(n)})},function(e,t,n){"use strict";const r=n(0),o=n(49),i=n(136),s=n(146),a=n(147),c=n(148),u=n(149),l=n(154),f=n(155),p=n(157),h=n(158),d=1e7;function m(e,t,n){let o;return(n=Object.assign({extendEnv:!0,env:{}},n)).extendEnv&&(n.env=Object.assign({},process.env,n.env)),!0===n.__winShell?(delete n.__winShell,o={command:e,args:t,options:n,file:e,original:{cmd:e,args:t}}):o=i._parse(e,t,n),(n=Object.assign({maxBuffer:d,buffer:!0,stripEof:!0,preferLocal:!0,localDir:o.options.cwd||process.cwd(),encoding:"utf8",reject:!0,cleanup:!0},o.options)).stdio=h(n),n.preferLocal&&(n.env=a.env(Object.assign({},n,{cwd:n.localDir}))),n.detached&&(n.cleanup=!1),"win32"===process.platform&&"cmd.exe"===r.basename(o.command)&&o.args.unshift("/q"),{cmd:o.command,args:o.args,opts:n,parsed:o}}function g(e,t){return t&&e.stripEof&&(t=s(t)),t}function v(e,t,n){let r="/bin/sh",o=["-c",t];return n=Object.assign({},n),"win32"===process.platform&&(n.__winShell=!0,r=process.env.comspec||"cmd.exe",o=["/s","/c",`"${t}"`],n.windowsVerbatimArguments=!0),n.shell&&(r=n.shell,delete n.shell),e(r,o,n)}function y(e,t,{encoding:n,buffer:r,maxBuffer:o}){if(!e[t])return null;let i;return(i=r?n?u(e[t],{encoding:n,maxBuffer:o}):u.buffer(e[t],{maxBuffer:o}):new Promise((n,r)=>{e[t].once("end",n).once("error",r)})).catch(e=>{throw e.stream=t,e.message=`${t} ${e.message}`,e})}function b(e,t){const{stdout:n,stderr:r}=e;let o=e.error;const{code:i,signal:s}=e,{parsed:a,joinedCmd:c}=t,u=t.timedOut||!1;if(!o){let e="";Array.isArray(a.opts.stdio)?("inherit"!==a.opts.stdio[2]&&(e+=e.length>0?r:`\n${r}`),"inherit"!==a.opts.stdio[1]&&(e+=`\n${n}`)):"inherit"!==a.opts.stdio&&(e=`\n${r}${n}`),(o=new Error(`Command failed: ${c}${e}`)).code=i<0?p(i):i}return o.stdout=n,o.stderr=r,o.failed=!0,o.signal=s||null,o.cmd=c,o.timedOut=u,o}function w(e,t){let n=e;return Array.isArray(t)&&t.length>0&&(n+=" "+t.join(" ")),n}e.exports=((e,t,n)=>{const r=m(e,t,n),{encoding:s,buffer:a,maxBuffer:u}=r.opts,p=w(e,t);let h,d;try{h=o.spawn(r.cmd,r.args,r.opts)}catch(e){return Promise.reject(e)}r.opts.cleanup&&(d=f(()=>{h.kill()}));let v=null,x=!1;const S=()=>{v&&(clearTimeout(v),v=null),d&&d()};r.opts.timeout>0&&(v=setTimeout(()=>{v=null,x=!0,h.kill(r.opts.killSignal)},r.opts.timeout));const P=new Promise(e=>{h.on("exit",(t,n)=>{S(),e({code:t,signal:n})}),h.on("error",t=>{S(),e({error:t})}),h.stdin&&h.stdin.on("error",t=>{S(),e({error:t})})});function O(){h.stdout&&h.stdout.destroy(),h.stderr&&h.stderr.destroy()}const j=()=>l(Promise.all([P,y(h,"stdout",{encoding:s,buffer:a,maxBuffer:u}),y(h,"stderr",{encoding:s,buffer:a,maxBuffer:u})]).then(e=>{const t=e[0];if(t.stdout=e[1],t.stderr=e[2],t.error||0!==t.code||null!==t.signal){const e=b(t,{joinedCmd:p,parsed:r,timedOut:x});if(e.killed=e.killed||h.killed,!r.opts.reject)return e;throw e}return{stdout:g(r.opts,t.stdout),stderr:g(r.opts,t.stderr),code:0,failed:!1,killed:!1,signal:null,cmd:p,timedOut:!1}}),O);return i._enoent.hookChildProcess(h,r.parsed),function(e,t){null!=t&&(c(t)?t.pipe(e.stdin):e.stdin.end(t))}(h,r.opts.input),h.then=((e,t)=>j().then(e,t)),h.catch=(e=>j().catch(e)),h}),e.exports.stdout=((...t)=>e.exports(...t).then(e=>e.stdout)),e.exports.stderr=((...t)=>e.exports(...t).then(e=>e.stderr)),e.exports.shell=((t,n)=>v(e.exports,t,n)),e.exports.sync=((e,t,n)=>{const r=m(e,t,n),i=w(e,t);if(c(r.opts.input))throw new TypeError("The `input` option cannot be a stream in sync mode");const s=o.spawnSync(r.cmd,r.args,r.opts);if(s.code=s.status,s.error||0!==s.status||null!==s.signal){const e=b(s,{joinedCmd:i,parsed:r});if(!r.opts.reject)return e;throw e}return{stdout:g(r.opts,s.stdout),stderr:g(r.opts,s.stderr),code:0,failed:!1,signal:null,cmd:i,timedOut:!1}}),e.exports.shellSync=((t,n)=>v(e.exports.sync,t,n))},function(e,t,n){"use strict";const r=n(49),o=n(137),i=n(145);function s(e,t,n){const s=o(e,t,n),a=r.spawn(s.command,s.args,s.options);return i.hookChildProcess(a,s),a}e.exports=s,e.exports.spawn=s,e.exports.sync=function(e,t,n){const s=o(e,t,n),a=r.spawnSync(s.command,s.args,s.options);return a.error=a.error||i.verifyENOENTSync(a.status,s),a},e.exports._parse=o,e.exports._enoent=i},function(e,t,n){"use strict";const r=n(0),o=n(138),i=n(139),s=n(140),a=n(141),c=n(144),u="win32"===process.platform,l=/\.(?:com|exe)$/i,f=/node_modules[\\/].bin[\\/][^\\/]+\.cmd$/i,p=o(()=>c.satisfies(process.version,"^4.8.0 || ^5.7.0 || >= 6.0.0",!0))||!1;function h(e){if(!u)return e;const t=function(e){e.file=i(e);const t=e.file&&a(e.file);return t?(e.args.unshift(e.file),e.command=t,i(e)):e.file}(e),n=!l.test(t);if(e.options.forceShell||n){const n=f.test(t);e.command=r.normalize(e.command),e.command=s.command(e.command),e.args=e.args.map(e=>s.argument(e,n));const o=[e.command].concat(e.args).join(" ");e.args=["/d","/s","/c",`"${o}"`],e.command=process.env.comspec||"cmd.exe",e.options.windowsVerbatimArguments=!0}return e}e.exports=function(e,t,n){t&&!Array.isArray(t)&&(n=t,t=null);const r={command:e,args:t=t?t.slice(0):[],options:n=Object.assign({},n),file:void 0,original:{command:e,args:t}};return n.shell?function(e){if(p)return e;const t=[e.command].concat(e.args).join(" ");return u?(e.command="string"==typeof e.options.shell?e.options.shell:process.env.comspec||"cmd.exe",e.args=["/d","/s","/c",`"${t}"`],e.options.windowsVerbatimArguments=!0):("string"==typeof e.options.shell?e.command=e.options.shell:"android"===process.platform?e.command="/system/bin/sh":e.command="/bin/sh",e.args=["-c",t]),e}(r):h(r)}},function(e,t,n){"use strict";e.exports=function(e){try{return e()}catch(e){}}},function(e,t,n){"use strict";const r=n(0),o=n(76),i=n(77)();function s(e,t){const n=process.cwd(),s=null!=e.options.cwd;if(s)try{process.chdir(e.options.cwd)}catch(e){}let a;try{a=o.sync(e.command,{path:(e.options.env||process.env)[i],pathExt:t?r.delimiter:void 0})}catch(e){}finally{process.chdir(n)}return a&&(a=r.resolve(s?e.options.cwd:"",a)),a}e.exports=function(e){return s(e)||s(e,!0)}},function(e,t,n){"use strict";const r=/([()\][%!^"`<>&|;, *?])/g;e.exports.command=function(e){return e=e.replace(r,"^$1")},e.exports.argument=function(e,t){return e=(e=`"${e=(e=(e=`${e}`).replace(/(\\*)"/g,'$1$1\\"')).replace(/(\\*)$/,"$1$1")}"`).replace(r,"^$1"),t&&(e=e.replace(r,"^$1")),e}},function(e,t,n){"use strict";const r=n(5),o=n(142);e.exports=function(e){let t,n;Buffer.alloc?t=Buffer.alloc(150):(t=new Buffer(150)).fill(0);try{n=r.openSync(e,"r"),r.readSync(n,t,0,150,0),r.closeSync(n)}catch(e){}return o(t.toString())}},function(e,t,n){"use strict";var r=n(143);e.exports=function(e){var t=e.match(r);if(!t)return null;var n=t[0].replace(/#! ?/,"").split(" "),o=n[0].split("/").pop(),i=n[1];return"env"===o?i:o+(i?" "+i:"")}},function(e,t,n){"use strict";e.exports=/^#!.*/},function(e,t){var n;t=e.exports=Y,n="object"==typeof process&&process.env&&process.env.NODE_DEBUG&&/\bsemver\b/i.test(process.env.NODE_DEBUG)?function(){var e=Array.prototype.slice.call(arguments,0);e.unshift("SEMVER"),console.log.apply(console,e)}:function(){},t.SEMVER_SPEC_VERSION="2.0.0";var r=256,o=Number.MAX_SAFE_INTEGER||9007199254740991,i=t.re=[],s=t.src=[],a=0,c=a++;s[c]="0|[1-9]\\d*";var u=a++;s[u]="[0-9]+";var l=a++;s[l]="\\d*[a-zA-Z-][a-zA-Z0-9-]*";var f=a++;s[f]="("+s[c]+")\\.("+s[c]+")\\.("+s[c]+")";var p=a++;s[p]="("+s[u]+")\\.("+s[u]+")\\.("+s[u]+")";var h=a++;s[h]="(?:"+s[c]+"|"+s[l]+")";var d=a++;s[d]="(?:"+s[u]+"|"+s[l]+")";var m=a++;s[m]="(?:-("+s[h]+"(?:\\."+s[h]+")*))";var g=a++;s[g]="(?:-?("+s[d]+"(?:\\."+s[d]+")*))";var v=a++;s[v]="[0-9A-Za-z-]+";var y=a++;s[y]="(?:\\+("+s[v]+"(?:\\."+s[v]+")*))";var b=a++,w="v?"+s[f]+s[m]+"?"+s[y]+"?";s[b]="^"+w+"$";var x="[v=\\s]*"+s[p]+s[g]+"?"+s[y]+"?",S=a++;s[S]="^"+x+"$";var P=a++;s[P]="((?:<|>)?=?)";var O=a++;s[O]=s[u]+"|x|X|\\*";var j=a++;s[j]=s[c]+"|x|X|\\*";var E=a++;s[E]="[v=\\s]*("+s[j]+")(?:\\.("+s[j]+")(?:\\.("+s[j]+")(?:"+s[m]+")?"+s[y]+"?)?)?";var I=a++;s[I]="[v=\\s]*("+s[O]+")(?:\\.("+s[O]+")(?:\\.("+s[O]+")(?:"+s[g]+")?"+s[y]+"?)?)?";var _=a++;s[_]="^"+s[P]+"\\s*"+s[E]+"$";var A=a++;s[A]="^"+s[P]+"\\s*"+s[I]+"$";var k=a++;s[k]="(?:^|[^\\d])(\\d{1,16})(?:\\.(\\d{1,16}))?(?:\\.(\\d{1,16}))?(?:$|[^\\d])";var N=a++;s[N]="(?:~>?)";var F=a++;s[F]="(\\s*)"+s[N]+"\\s+",i[F]=new RegExp(s[F],"g");var C=a++;s[C]="^"+s[N]+s[E]+"$";var M=a++;s[M]="^"+s[N]+s[I]+"$";var T=a++;s[T]="(?:\\^)";var V=a++;s[V]="(\\s*)"+s[T]+"\\s+",i[V]=new RegExp(s[V],"g");var D=a++;s[D]="^"+s[T]+s[E]+"$";var B=a++;s[B]="^"+s[T]+s[I]+"$";var L=a++;s[L]="^"+s[P]+"\\s*("+x+")$|^$";var $=a++;s[$]="^"+s[P]+"\\s*("+w+")$|^$";var R=a++;s[R]="(\\s*)"+s[P]+"\\s*("+x+"|"+s[E]+")",i[R]=new RegExp(s[R],"g");var G=a++;s[G]="^\\s*("+s[E]+")\\s+-\\s+("+s[E]+")\\s*$";var W=a++;s[W]="^\\s*("+s[I]+")\\s+-\\s+("+s[I]+")\\s*$";var U=a++;s[U]="(<|>)?=?\\s*\\*";for(var q=0;q<35;q++)n(q,s[q]),i[q]||(i[q]=new RegExp(s[q]));function K(e,t){if(t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1}),e instanceof Y)return e;if("string"!=typeof e)return null;if(e.length>r)return null;if(!(t.loose?i[S]:i[b]).test(e))return null;try{return new Y(e,t)}catch(e){return null}}function Y(e,t){if(t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1}),e instanceof Y){if(e.loose===t.loose)return e;e=e.version}else if("string"!=typeof e)throw new TypeError("Invalid Version: "+e);if(e.length>r)throw new TypeError("version is longer than "+r+" characters");if(!(this instanceof Y))return new Y(e,t);n("SemVer",e,t),this.options=t,this.loose=!!t.loose;var s=e.trim().match(t.loose?i[S]:i[b]);if(!s)throw new TypeError("Invalid Version: "+e);if(this.raw=e,this.major=+s[1],this.minor=+s[2],this.patch=+s[3],this.major>o||this.major<0)throw new TypeError("Invalid major version");if(this.minor>o||this.minor<0)throw new TypeError("Invalid minor version");if(this.patch>o||this.patch<0)throw new TypeError("Invalid patch version");s[4]?this.prerelease=s[4].split(".").map(function(e){if(/^[0-9]+$/.test(e)){var t=+e;if(t>=0&&t<o)return t}return e}):this.prerelease=[],this.build=s[5]?s[5].split("."):[],this.format()}t.parse=K,t.valid=function(e,t){var n=K(e,t);return n?n.version:null},t.clean=function(e,t){var n=K(e.trim().replace(/^[=v]+/,""),t);return n?n.version:null},t.SemVer=Y,Y.prototype.format=function(){return this.version=this.major+"."+this.minor+"."+this.patch,this.prerelease.length&&(this.version+="-"+this.prerelease.join(".")),this.version},Y.prototype.toString=function(){return this.version},Y.prototype.compare=function(e){return n("SemVer.compare",this.version,this.options,e),e instanceof Y||(e=new Y(e,this.options)),this.compareMain(e)||this.comparePre(e)},Y.prototype.compareMain=function(e){return e instanceof Y||(e=new Y(e,this.options)),J(this.major,e.major)||J(this.minor,e.minor)||J(this.patch,e.patch)},Y.prototype.comparePre=function(e){if(e instanceof Y||(e=new Y(e,this.options)),this.prerelease.length&&!e.prerelease.length)return-1;if(!this.prerelease.length&&e.prerelease.length)return 1;if(!this.prerelease.length&&!e.prerelease.length)return 0;var t=0;do{var r=this.prerelease[t],o=e.prerelease[t];if(n("prerelease compare",t,r,o),void 0===r&&void 0===o)return 0;if(void 0===o)return 1;if(void 0===r)return-1;if(r!==o)return J(r,o)}while(++t)},Y.prototype.inc=function(e,t){switch(e){case"premajor":this.prerelease.length=0,this.patch=0,this.minor=0,this.major++,this.inc("pre",t);break;case"preminor":this.prerelease.length=0,this.patch=0,this.minor++,this.inc("pre",t);break;case"prepatch":this.prerelease.length=0,this.inc("patch",t),this.inc("pre",t);break;case"prerelease":0===this.prerelease.length&&this.inc("patch",t),this.inc("pre",t);break;case"major":0===this.minor&&0===this.patch&&0!==this.prerelease.length||this.major++,this.minor=0,this.patch=0,this.prerelease=[];break;case"minor":0===this.patch&&0!==this.prerelease.length||this.minor++,this.patch=0,this.prerelease=[];break;case"patch":0===this.prerelease.length&&this.patch++,this.prerelease=[];break;case"pre":if(0===this.prerelease.length)this.prerelease=[0];else{for(var n=this.prerelease.length;--n>=0;)"number"==typeof this.prerelease[n]&&(this.prerelease[n]++,n=-2);-1===n&&this.prerelease.push(0)}t&&(this.prerelease[0]===t?isNaN(this.prerelease[1])&&(this.prerelease=[t,0]):this.prerelease=[t,0]);break;default:throw new Error("invalid increment argument: "+e)}return this.format(),this.raw=this.version,this},t.inc=function(e,t,n,r){"string"==typeof n&&(r=n,n=void 0);try{return new Y(e,n).inc(t,r).version}catch(e){return null}},t.diff=function(e,t){if(Z(e,t))return null;var n=K(e),r=K(t);if(n.prerelease.length||r.prerelease.length){for(var o in n)if(("major"===o||"minor"===o||"patch"===o)&&n[o]!==r[o])return"pre"+o;return"prerelease"}for(var o in n)if(("major"===o||"minor"===o||"patch"===o)&&n[o]!==r[o])return o},t.compareIdentifiers=J;var H=/^[0-9]+$/;function J(e,t){var n=H.test(e),r=H.test(t);return n&&r&&(e=+e,t=+t),n&&!r?-1:r&&!n?1:e<t?-1:e>t?1:0}function z(e,t,n){return new Y(e,n).compare(new Y(t,n))}function Q(e,t,n){return z(e,t,n)>0}function X(e,t,n){return z(e,t,n)<0}function Z(e,t,n){return 0===z(e,t,n)}function ee(e,t,n){return 0!==z(e,t,n)}function te(e,t,n){return z(e,t,n)>=0}function ne(e,t,n){return z(e,t,n)<=0}function re(e,t,n,r){var o;switch(t){case"===":"object"==typeof e&&(e=e.version),"object"==typeof n&&(n=n.version),o=e===n;break;case"!==":"object"==typeof e&&(e=e.version),"object"==typeof n&&(n=n.version),o=e!==n;break;case"":case"=":case"==":o=Z(e,n,r);break;case"!=":o=ee(e,n,r);break;case">":o=Q(e,n,r);break;case">=":o=te(e,n,r);break;case"<":o=X(e,n,r);break;case"<=":o=ne(e,n,r);break;default:throw new TypeError("Invalid operator: "+t)}return o}function oe(e,t){if(t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1}),e instanceof oe){if(e.loose===!!t.loose)return e;e=e.value}if(!(this instanceof oe))return new oe(e,t);n("comparator",e,t),this.options=t,this.loose=!!t.loose,this.parse(e),this.semver===ie?this.value="":this.value=this.operator+this.semver.version,n("comp",this)}t.rcompareIdentifiers=function(e,t){return J(t,e)},t.major=function(e,t){return new Y(e,t).major},t.minor=function(e,t){return new Y(e,t).minor},t.patch=function(e,t){return new Y(e,t).patch},t.compare=z,t.compareLoose=function(e,t){return z(e,t,!0)},t.rcompare=function(e,t,n){return z(t,e,n)},t.sort=function(e,n){return e.sort(function(e,r){return t.compare(e,r,n)})},t.rsort=function(e,n){return e.sort(function(e,r){return t.rcompare(e,r,n)})},t.gt=Q,t.lt=X,t.eq=Z,t.neq=ee,t.gte=te,t.lte=ne,t.cmp=re,t.Comparator=oe;var ie={};function se(e,t){if(t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1}),e instanceof se)return e.loose===!!t.loose&&e.includePrerelease===!!t.includePrerelease?e:new se(e.raw,t);if(e instanceof oe)return new se(e.value,t);if(!(this instanceof se))return new se(e,t);if(this.options=t,this.loose=!!t.loose,this.includePrerelease=!!t.includePrerelease,this.raw=e,this.set=e.split(/\s*\|\|\s*/).map(function(e){return this.parseRange(e.trim())},this).filter(function(e){return e.length}),!this.set.length)throw new TypeError("Invalid SemVer Range: "+e);this.format()}function ae(e){return!e||"x"===e.toLowerCase()||"*"===e}function ce(e,t,n,r,o,i,s,a,c,u,l,f,p){return((t=ae(n)?"":ae(r)?">="+n+".0.0":ae(o)?">="+n+"."+r+".0":">="+t)+" "+(a=ae(c)?"":ae(u)?"<"+(+c+1)+".0.0":ae(l)?"<"+c+"."+(+u+1)+".0":f?"<="+c+"."+u+"."+l+"-"+f:"<="+a)).trim()}function ue(e,t,r){for(var o=0;o<e.length;o++)if(!e[o].test(t))return!1;if(r||(r={}),t.prerelease.length&&!r.includePrerelease){for(o=0;o<e.length;o++)if(n(e[o].semver),e[o].semver!==ie&&e[o].semver.prerelease.length>0){var i=e[o].semver;if(i.major===t.major&&i.minor===t.minor&&i.patch===t.patch)return!0}return!1}return!0}function le(e,t,n){try{t=new se(t,n)}catch(e){return!1}return t.test(e)}function fe(e,t,n,r){var o,i,s,a,c;switch(e=new Y(e,r),t=new se(t,r),n){case">":o=Q,i=ne,s=X,a=">",c=">=";break;case"<":o=X,i=te,s=Q,a="<",c="<=";break;default:throw new TypeError('Must provide a hilo val of "<" or ">"')}if(le(e,t,r))return!1;for(var u=0;u<t.set.length;++u){var l=t.set[u],f=null,p=null;if(l.forEach(function(e){e.semver===ie&&(e=new oe(">=0.0.0")),f=f||e,p=p||e,o(e.semver,f.semver,r)?f=e:s(e.semver,p.semver,r)&&(p=e)}),f.operator===a||f.operator===c)return!1;if((!p.operator||p.operator===a)&&i(e,p.semver))return!1;if(p.operator===c&&s(e,p.semver))return!1}return!0}oe.prototype.parse=function(e){var t=this.options.loose?i[L]:i[$],n=e.match(t);if(!n)throw new TypeError("Invalid comparator: "+e);this.operator=n[1],"="===this.operator&&(this.operator=""),n[2]?this.semver=new Y(n[2],this.options.loose):this.semver=ie},oe.prototype.toString=function(){return this.value},oe.prototype.test=function(e){return n("Comparator.test",e,this.options.loose),this.semver===ie||("string"==typeof e&&(e=new Y(e,this.options)),re(e,this.operator,this.semver,this.options))},oe.prototype.intersects=function(e,t){if(!(e instanceof oe))throw new TypeError("a Comparator is required");var n;if(t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1}),""===this.operator)return n=new se(e.value,t),le(this.value,n,t);if(""===e.operator)return n=new se(this.value,t),le(e.semver,n,t);var r=!(">="!==this.operator&&">"!==this.operator||">="!==e.operator&&">"!==e.operator),o=!("<="!==this.operator&&"<"!==this.operator||"<="!==e.operator&&"<"!==e.operator),i=this.semver.version===e.semver.version,s=!(">="!==this.operator&&"<="!==this.operator||">="!==e.operator&&"<="!==e.operator),a=re(this.semver,"<",e.semver,t)&&(">="===this.operator||">"===this.operator)&&("<="===e.operator||"<"===e.operator),c=re(this.semver,">",e.semver,t)&&("<="===this.operator||"<"===this.operator)&&(">="===e.operator||">"===e.operator);return r||o||i&&s||a||c},t.Range=se,se.prototype.format=function(){return this.range=this.set.map(function(e){return e.join(" ").trim()}).join("||").trim(),this.range},se.prototype.toString=function(){return this.range},se.prototype.parseRange=function(e){var t=this.options.loose;e=e.trim();var r=t?i[W]:i[G];e=e.replace(r,ce),n("hyphen replace",e),e=e.replace(i[R],"$1$2$3"),n("comparator trim",e,i[R]),e=(e=(e=e.replace(i[F],"$1~")).replace(i[V],"$1^")).split(/\s+/).join(" ");var o=t?i[L]:i[$],s=e.split(" ").map(function(e){return function(e,t){return n("comp",e,t),e=function(e,t){return e.trim().split(/\s+/).map(function(e){return function(e,t){n("caret",e,t),t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1});var r=t.loose?i[B]:i[D];return e.replace(r,function(t,r,o,i,s){var a;return n("caret",e,t,r,o,i,s),ae(r)?a="":ae(o)?a=">="+r+".0.0 <"+(+r+1)+".0.0":ae(i)?a="0"===r?">="+r+"."+o+".0 <"+r+"."+(+o+1)+".0":">="+r+"."+o+".0 <"+(+r+1)+".0.0":s?(n("replaceCaret pr",s),"-"!==s.charAt(0)&&(s="-"+s),a="0"===r?"0"===o?">="+r+"."+o+"."+i+s+" <"+r+"."+o+"."+(+i+1):">="+r+"."+o+"."+i+s+" <"+r+"."+(+o+1)+".0":">="+r+"."+o+"."+i+s+" <"+(+r+1)+".0.0"):(n("no pr"),a="0"===r?"0"===o?">="+r+"."+o+"."+i+" <"+r+"."+o+"."+(+i+1):">="+r+"."+o+"."+i+" <"+r+"."+(+o+1)+".0":">="+r+"."+o+"."+i+" <"+(+r+1)+".0.0"),n("caret return",a),a})}(e,t)}).join(" ")}(e,t),n("caret",e),e=function(e,t){return e.trim().split(/\s+/).map(function(e){return function(e,t){t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1});var r=t.loose?i[M]:i[C];return e.replace(r,function(t,r,o,i,s){var a;return n("tilde",e,t,r,o,i,s),ae(r)?a="":ae(o)?a=">="+r+".0.0 <"+(+r+1)+".0.0":ae(i)?a=">="+r+"."+o+".0 <"+r+"."+(+o+1)+".0":s?(n("replaceTilde pr",s),"-"!==s.charAt(0)&&(s="-"+s),a=">="+r+"."+o+"."+i+s+" <"+r+"."+(+o+1)+".0"):a=">="+r+"."+o+"."+i+" <"+r+"."+(+o+1)+".0",n("tilde return",a),a})}(e,t)}).join(" ")}(e,t),n("tildes",e),e=function(e,t){return n("replaceXRanges",e,t),e.split(/\s+/).map(function(e){return function(e,t){e=e.trim(),t&&"object"==typeof t||(t={loose:!!t,includePrerelease:!1});var r=t.loose?i[A]:i[_];return e.replace(r,function(t,r,o,i,s,a){n("xRange",e,t,r,o,i,s,a);var c=ae(o),u=c||ae(i),l=u||ae(s),f=l;return"="===r&&f&&(r=""),c?t=">"===r||"<"===r?"<0.0.0":"*":r&&f?(u&&(i=0),l&&(s=0),">"===r?(r=">=",u?(o=+o+1,i=0,s=0):l&&(i=+i+1,s=0)):"<="===r&&(r="<",u?o=+o+1:i=+i+1),t=r+o+"."+i+"."+s):u?t=">="+o+".0.0 <"+(+o+1)+".0.0":l&&(t=">="+o+"."+i+".0 <"+o+"."+(+i+1)+".0"),n("xRange return",t),t})}(e,t)}).join(" ")}(e,t),n("xrange",e),e=function(e,t){return n("replaceStars",e,t),e.trim().replace(i[U],"")}(e,t),n("stars",e),e}(e,this.options)},this).join(" ").split(/\s+/);return this.options.loose&&(s=s.filter(function(e){return!!e.match(o)})),s=s.map(function(e){return new oe(e,this.options)},this)},se.prototype.intersects=function(e,t){if(!(e instanceof se))throw new TypeError("a Range is required");return this.set.some(function(n){return n.every(function(n){return e.set.some(function(e){return e.every(function(e){return n.intersects(e,t)})})})})},t.toComparators=function(e,t){return new se(e,t).set.map(function(e){return e.map(function(e){return e.value}).join(" ").trim().split(" ")})},se.prototype.test=function(e){if(!e)return!1;"string"==typeof e&&(e=new Y(e,this.options));for(var t=0;t<this.set.length;t++)if(ue(this.set[t],e,this.options))return!0;return!1},t.satisfies=le,t.maxSatisfying=function(e,t,n){var r=null,o=null;try{var i=new se(t,n)}catch(e){return null}return e.forEach(function(e){i.test(e)&&(r&&-1!==o.compare(e)||(o=new Y(r=e,n)))}),r},t.minSatisfying=function(e,t,n){var r=null,o=null;try{var i=new se(t,n)}catch(e){return null}return e.forEach(function(e){i.test(e)&&(r&&1!==o.compare(e)||(o=new Y(r=e,n)))}),r},t.validRange=function(e,t){try{return new se(e,t).range||"*"}catch(e){return null}},t.ltr=function(e,t,n){return fe(e,t,"<",n)},t.gtr=function(e,t,n){return fe(e,t,">",n)},t.outside=fe,t.prerelease=function(e,t){var n=K(e,t);return n&&n.prerelease.length?n.prerelease:null},t.intersects=function(e,t,n){return e=new se(e,n),t=new se(t,n),e.intersects(t)},t.coerce=function(e){if(e instanceof Y)return e;if("string"!=typeof e)return null;var t=e.match(i[k]);return null==t?null:K((t[1]||"0")+"."+(t[2]||"0")+"."+(t[3]||"0"))}},function(e,t,n){"use strict";const r="win32"===process.platform;function o(e,t){return Object.assign(new Error(`${t} ${e.command} ENOENT`),{code:"ENOENT",errno:"ENOENT",syscall:`${t} ${e.command}`,path:e.command,spawnargs:e.args})}function i(e,t){return r&&1===e&&!t.file?o(t.original,"spawn"):null}e.exports={hookChildProcess:function(e,t){if(!r)return;const n=e.emit;e.emit=function(r,o){if("exit"===r){const r=i(o,t);if(r)return n.call(e,"error",r)}return n.apply(e,arguments)}},verifyENOENT:i,verifyENOENTSync:function(e,t){return r&&1===e&&!t.file?o(t.original,"spawnSync"):null},notFoundError:o}},function(e,t,n){"use strict";e.exports=function(e){var t="string"==typeof e?"\n":"\n".charCodeAt(),n="string"==typeof e?"\r":"\r".charCodeAt();return e[e.length-1]===t&&(e=e.slice(0,e.length-1)),e[e.length-1]===n&&(e=e.slice(0,e.length-1)),e}},function(e,t,n){"use strict";const r=n(0),o=n(77);e.exports=(e=>{let t;e=Object.assign({cwd:process.cwd(),path:process.env[o()]},e);let n=r.resolve(e.cwd);const i=[];for(;t!==n;)i.push(r.join(n,"node_modules/.bin")),t=n,n=r.resolve(n,"..");return i.push(r.dirname(process.execPath)),i.concat(e.path).join(r.delimiter)}),e.exports.env=(t=>{t=Object.assign({env:process.env},t);const n=Object.assign({},t.env),r=o({env:n});return t.path=n[r],n[r]=e.exports(t),n})},function(e,t,n){"use strict";var r=e.exports=function(e){return null!==e&&"object"==typeof e&&"function"==typeof e.pipe};r.writable=function(e){return r(e)&&!1!==e.writable&&"function"==typeof e._write&&"object"==typeof e._writableState},r.readable=function(e){return r(e)&&!1!==e.readable&&"function"==typeof e._read&&"object"==typeof e._readableState},r.duplex=function(e){return r.writable(e)&&r.readable(e)},r.transform=function(e){return r.duplex(e)&&"function"==typeof e._transform&&"object"==typeof e._transformState}},function(e,t,n){"use strict";const r=n(150),o=n(152);class i extends Error{constructor(){super("maxBuffer exceeded"),this.name="MaxBufferError"}}function s(e,t){if(!e)return Promise.reject(new Error("Expected a stream"));t=Object.assign({maxBuffer:1/0},t);const{maxBuffer:n}=t;let s;return new Promise((a,c)=>{const u=e=>{e&&(e.bufferedData=s.getBufferedValue()),c(e)};(s=r(e,o(t),e=>{e?u(e):a()})).on("data",()=>{s.getBufferedLength()>n&&u(new i)})}).then(()=>s.getBufferedValue())}e.exports=s,e.exports.buffer=((e,t)=>s(e,Object.assign({},t,{encoding:"buffer"}))),e.exports.array=((e,t)=>s(e,Object.assign({},t,{array:!0}))),e.exports.MaxBufferError=i},function(e,t,n){var r=n(31),o=n(151),i=n(5),s=function(){},a=/^v?\.0/.test(process.version),c=function(e){return"function"==typeof e},u=function(e,t,n,u){u=r(u);var l=!1;e.on("close",function(){l=!0}),o(e,{readable:t,writable:n},function(e){if(e)return u(e);l=!0,u()});var f=!1;return function(t){if(!l&&!f)return f=!0,function(e){return!!a&&!!i&&(e instanceof(i.ReadStream||s)||e instanceof(i.WriteStream||s))&&c(e.close)}(e)?e.close(s):function(e){return e.setHeader&&c(e.abort)}(e)?e.abort():c(e.destroy)?e.destroy():void u(t||new Error("stream was destroyed"))}},l=function(e){e()},f=function(e,t){return e.pipe(t)};e.exports=function(){var e,t=Array.prototype.slice.call(arguments),n=c(t[t.length-1]||s)&&t.pop()||s;if(Array.isArray(t[0])&&(t=t[0]),t.length<2)throw new Error("pump requires two streams per minimum");var r=t.map(function(o,i){var s=i<t.length-1;return u(o,s,i>0,function(t){e||(e=t),t&&r.forEach(l),s||(r.forEach(l),n(e))})});return t.reduce(f)}},function(e,t,n){var r=n(31),o=function(){},i=function(e,t,n){if("function"==typeof t)return i(e,null,t);t||(t={}),n=r(n||o);var s=e._writableState,a=e._readableState,c=t.readable||!1!==t.readable&&e.readable,u=t.writable||!1!==t.writable&&e.writable,l=function(){e.writable||f()},f=function(){u=!1,c||n.call(e)},p=function(){c=!1,u||n.call(e)},h=function(t){n.call(e,t?new Error("exited with error code: "+t):null)},d=function(t){n.call(e,t)},m=function(){return(!c||a&&a.ended)&&(!u||s&&s.ended)?void 0:n.call(e,new Error("premature close"))},g=function(){e.req.on("finish",f)};return!function(e){return e.setHeader&&"function"==typeof e.abort}(e)?u&&!s&&(e.on("end",l),e.on("close",l)):(e.on("complete",f),e.on("abort",m),e.req?g():e.on("request",g)),function(e){return e.stdio&&Array.isArray(e.stdio)&&3===e.stdio.length}(e)&&e.on("exit",h),e.on("end",p),e.on("finish",f),!1!==t.error&&e.on("error",d),e.on("close",m),function(){e.removeListener("complete",f),e.removeListener("abort",m),e.removeListener("request",g),e.req&&e.req.removeListener("finish",f),e.removeListener("end",l),e.removeListener("close",l),e.removeListener("finish",f),e.removeListener("exit",h),e.removeListener("end",p),e.removeListener("error",d),e.removeListener("close",m)}};e.exports=i},function(e,t,n){"use strict";const{PassThrough:r}=n(153);e.exports=(e=>{e=Object.assign({},e);const{array:t}=e;let{encoding:n}=e;const o="buffer"===n;let i=!1;t?i=!(n||o):n=n||"utf8",o&&(n=null);let s=0;const a=[],c=new r({objectMode:i});return n&&c.setEncoding(n),c.on("data",e=>{a.push(e),i?s=a.length:s+=e.length}),c.getBufferedValue=(()=>t?a:o?Buffer.concat(a,s):a.join("")),c.getBufferedLength=(()=>s),c})},function(e,t){e.exports=require("stream")},function(e,t,n){"use strict";e.exports=((e,t)=>(t=t||(()=>{}),e.then(e=>new Promise(e=>{e(t())}).then(()=>e),e=>new Promise(e=>{e(t())}).then(()=>{throw e}))))},function(e,t,n){var r,o=n(47),i=n(156),s=n(68);function a(){l&&(l=!1,i.forEach(function(e){try{process.removeListener(e,u[e])}catch(e){}}),process.emit=d,process.reallyExit=p,r.count-=1)}function c(e,t,n){r.emitted[e]||(r.emitted[e]=!0,r.emit(e,t,n))}"function"!=typeof s&&(s=s.EventEmitter),process.__signal_exit_emitter__?r=process.__signal_exit_emitter__:((r=process.__signal_exit_emitter__=new s).count=0,r.emitted={}),r.infinite||(r.setMaxListeners(1/0),r.infinite=!0),e.exports=function(e,t){o.equal(typeof e,"function","a callback must be provided for exit handler"),!1===l&&f();var n="exit";t&&t.alwaysLast&&(n="afterexit");return r.on(n,e),function(){r.removeListener(n,e),0===r.listeners("exit").length&&0===r.listeners("afterexit").length&&a()}},e.exports.unload=a;var u={};i.forEach(function(e){u[e]=function(){process.listeners(e).length===r.count&&(a(),c("exit",null,e),c("afterexit",null,e),process.kill(process.pid,e))}}),e.exports.signals=function(){return i},e.exports.load=f;var l=!1;function f(){l||(l=!0,r.count+=1,i=i.filter(function(e){try{return process.on(e,u[e]),!0}catch(e){return!1}}),process.emit=m,process.reallyExit=h)}var p=process.reallyExit;function h(e){process.exitCode=e||0,c("exit",process.exitCode,null),c("afterexit",process.exitCode,null),p.call(process,process.exitCode)}var d=process.emit;function m(e,t){if("exit"===e){void 0!==t&&(process.exitCode=t);var n=d.apply(this,arguments);return c("exit",process.exitCode,null),c("afterexit",process.exitCode,null),n}return d.apply(this,arguments)}},function(e,t){e.exports=["SIGABRT","SIGALRM","SIGHUP","SIGINT","SIGTERM"],"win32"!==process.platform&&e.exports.push("SIGVTALRM","SIGXCPU","SIGXFSZ","SIGUSR2","SIGTRAP","SIGSYS","SIGQUIT","SIGIOT"),"linux"===process.platform&&e.exports.push("SIGIO","SIGPOLL","SIGPWR","SIGSTKFLT","SIGUNUSED")},function(e,t,n){"use strict";const r=n(30);let o;if("function"==typeof r.getSystemErrorName)e.exports=r.getSystemErrorName;else{try{if("function"!=typeof(o=process.binding("uv")).errname)throw new TypeError("uv.errname is not a function")}catch(e){console.error("execa/lib/errname: unable to establish process.binding('uv')",e),o=null}e.exports=(e=>i(o,e))}function i(e,t){if(e)return e.errname(t);if(!(t<0))throw new Error("err >= 0");return`Unknown system error ${t}`}e.exports.__test__=i},function(e,t,n){"use strict";const r=["stdin","stdout","stderr"];e.exports=(e=>{if(!e)return null;if(e.stdio&&(e=>r.some(t=>Boolean(e[t])))(e))throw new Error(`It's not possible to provide \`stdio\` in combination with one of ${r.map(e=>`\`${e}\``).join(", ")}`);if("string"==typeof e.stdio)return e.stdio;const t=e.stdio||[];if(!Array.isArray(t))throw new TypeError(`Expected \`stdio\` to be of type \`string\` or \`Array\`, got \`${typeof t}\``);const n=[],o=Math.max(t.length,r.length);for(let i=0;i<o;i++){let o=null;void 0!==t[i]?o=t[i]:void 0!==e[r[i]]&&(o=e[r[i]]),n[i]=o}return n})},function(e,t,n){"use strict";n(2);var r=n(1);e.exports={getBazelInfo:function(){return r.log("trace","getBazelInfo"),Promise.all([r.run("bazel --version").then(r.findVersion),r.run("which bazel")]).then(function(e){return r.determineFound("Bazel",e[0],e[1])})},getCMakeInfo:function(){return r.log("trace","getCMakeInfo"),Promise.all([r.run("cmake --version").then(r.findVersion),r.run("which cmake")]).then(function(e){return r.determineFound("CMake",e[0],e[1])})},getGCCInfo:function(){return r.log("trace","getGCCInfo"),r.isMacOS||r.isLinux?Promise.all([r.run("gcc -v 2>&1").then(r.findVersion),r.run("which gcc")]).then(function(e){return r.determineFound("GCC",e[0],e[1])}):Promise.resolve(["GCC","N/A"])},getClangInfo:function(){return r.log("trace","getClangInfo"),Promise.all([r.run("clang --version").then(r.findVersion),r.which("clang")]).then(function(e){return r.determineFound("Clang",e[0],e[1])})},getGitInfo:function(){return r.log("trace","getGitInfo"),Promise.all([r.run("git --version").then(r.findVersion),r.run("which git")]).then(function(e){return r.determineFound("Git",e[0],e[1])})},getMakeInfo:function(){return r.log("trace","getMakeInfo"),r.isMacOS||r.isLinux?Promise.all([r.run("make --version").then(r.findVersion),r.run("which make")]).then(function(e){return r.determineFound("Make",e[0],e[1])}):Promise.resolve(["Make","N/A"])},getNinjaInfo:function(){return r.log("trace","getNinjaInfo"),Promise.all([r.run("ninja --version").then(r.findVersion),r.run("which ninja")]).then(function(e){return r.determineFound("Ninja",e[0],e[1])})},getMercurialInfo:function(){return r.log("trace","getMercurialInfo"),r.isMacOS||r.isLinux?Promise.all([r.run("hg --version").then(r.findVersion),r.run("which hg")]).then(function(e){return r.determineFound("Mercurial",e[0],e[1])}):Promise.resolve(["Mercurial","N/A"])},getSubversionInfo:function(){return r.log("trace","getSubversionInfo"),r.isMacOS||r.isLinux?Promise.all([r.run("svn --version").then(r.findVersion),r.run("which svn")]).then(function(e){return r.determineFound("Subversion",e[0],e[1])}):Promise.resolve(["Subversion","N/A"])},getFFmpegInfo:function(){return r.log("trace","getFFmpegInfo"),Promise.all([r.run("ffmpeg -version").then(r.findVersion),r.which("ffmpeg")]).then(function(e){return r.determineFound("FFmpeg",e[0],e[1])})}}},function(e,t,n){"use strict";n(2);var r=n(1);e.exports={getDockerInfo:function(){return r.log("trace","getDockerInfo"),Promise.all([r.run("docker --version").then(r.findVersion),r.which("docker")]).then(function(e){return r.determineFound("Docker",e[0],e[1])})},getParallelsInfo:function(){return r.log("trace","getParallelsInfo"),Promise.all([r.run("prlctl --version").then(r.findVersion),r.which("prlctl")]).then(function(e){return r.determineFound("Parallels",e[0],e[1])})},getVirtualBoxInfo:function(){return r.log("trace","getVirtualBoxInfo"),Promise.all([r.run("vboxmanage --version").then(r.findVersion),r.which("vboxmanage")]).then(function(e){return r.determineFound("VirtualBox",e[0],e[1])})},getVMwareFusionInfo:function(){return r.log("trace","getVMwareFusionInfo"),r.getDarwinApplicationVersion("com.vmware.fusion").then(function(e){return r.determineFound("VMWare Fusion",e,"N/A")})}}},function(e,t,n){"use strict";n(162),n(64),n(22),n(16),n(21),n(74);var r=n(163),o=n(1);function i(e,t){return o.log("trace","clean",e),Object.keys(e).reduce(function(n,r){return!t.showNotFound&&"Not Found"===e[r]||"N/A"===e[r]||void 0===e[r]||0===Object.keys(e[r]).length?n:o.isObject(e[r])?Object.values(e[r]).every(function(e){return"N/A"===e||!t.showNotFound&&"Not Found"===e})?n:Object.assign(n,{[r]:i(e[r],t)}):Object.assign(n,{[r]:e[r]})},{})}function s(e,t){o.log("trace","formatHeaders"),t||(t={type:"underline"});var n={underline:["",""]};return e.slice().split("\n").map(function(e){if(":"===e.slice("-1")){var r=e.match(/^[\s]*/g)[0];return`${r}${n[t.type][0]}${e.slice(r.length)}${n[t.type][1]}`}return e}).join("\n")}function a(e){return o.log("trace","formatPackages"),e.npmPackages?Object.assign(e,{npmPackages:Object.entries(e.npmPackages||{}).reduce(function(e,t){var n=t[0],r=t[1];if("Not Found"===r)return Object.assign(e,{[n]:r});var o=r.wanted?`${r.wanted} =>`:"",i=Array.isArray(r.installed)?r.installed.join(", "):r.installed,s=r.duplicates?`(${r.duplicates.join(", ")})`:"";return Object.assign(e,{[n]:`${o} ${i} ${s}`})},{})}):e}function c(e,t,n){return n||(n={emptyMessage:"None"}),Array.isArray(t)&&(t=t.length>0?t.join(", "):n.emptyMessage),{[e]:t}}function u(e){return o.log("trace","serializeArrays"),function e(t,n){return Object.entries(t).reduce(function(t,r){var i=r[0],s=r[1];return o.isObject(s)?Object.assign(t,{[i]:e(s,n)}):Object.assign(t,n(i,s))},{})}(e,c)}function l(e){return o.log("trace","serializeVersionsAndPaths"),Object.entries(e).reduce(function(e,t){return Object.assign(e,{[t[0]]:Object.entries(t[1]).reduce(function(e,t){var n=t[0],r=t[1];return r.version?Object.assign(e,{[n]:[r.version,r.path].filter(Boolean).join(" - ")}):Object.assign(e,{[n]:[r][0]})},{})},{})},{})}function f(e){return r(e,{indent:"  ",prefix:"\n",postfix:"\n"})}function p(e){return e.slice().split("\n").map(function(e){if(""!==e){var t=":"===e.slice("-1"),n=e.search(/\S|$/);return t?`${"#".repeat(n/2+1)} `+e.slice(n):" - "+e.slice(n)}return""}).join("\n")}function h(e,t){return t||(t={indent:"  "}),JSON.stringify(e,null,t.indent)}e.exports={json:function(e,t){return o.log("trace","formatToJson"),t||(t={}),e=o.pipe([function(){return i(e,t)},t.title?function(e){return{[t.title]:e}}:o.noop,h])(e),e=t.console?`\n${e}\n`:e},markdown:function(e,t){return o.log("trace","formatToMarkdown"),o.pipe([function(){return i(e,t)},a,u,l,f,p,t.title?function(e){return`\n# ${t.title}${e}`}:o.noop])(e,t)},yaml:function(e,t){return o.log("trace","formatToYaml",t),o.pipe([function(){return i(e,t)},a,u,l,t.title?function(e){return{[t.title]:e}}:o.noop,f,t.console?s:o.noop])(e,t)}}},function(e,t,n){n(28)("search",1,function(e,t,n){return[function(n){"use strict";var r=e(this),o=null==n?void 0:n[t];return void 0!==o?o.call(n,r):new RegExp(n)[t](String(r))},n]})},function(e,t,n){"use strict";var r=n(164),o=n(165),i=n(169),s=["object","array"];e.exports=function(e,t){var n=o(t),a=n.colors,c=n.prefix,u=n.postfix,l=n.dateToString,f=n.errorToString,p=n.indent,h=new Map;function d(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:1,n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0;if(0===Object.keys(e).length)return" {}";var o="\n",a=i(t,p);return Object.keys(e).forEach(function(c){var u=e[c],l=r(u),f=i(n,"  "),p=-1!==s.indexOf(l)?"":" ",h=v(u)?" [Circular]":g(l,u,t+1,n);o+=`${f}${a}${c}:${p}${h}\n`}),o.substring(0,o.length-1)}function m(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:1,n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0;if(0===e.length)return" []";var o="\n",s=i(t,p);return e.forEach(function(e){var a=r(e),c=i(n,"  "),u=v(e)?"[Circular]":g(a,e,t,n+1).toString().trimLeft();o+=`${c}${s}- ${u}\n`}),o.substring(0,o.length-1)}function g(e,t,n,r){switch(e){case"array":return m(t,n,r);case"object":return d(t,n,r);case"string":return a.string(t);case"symbol":return a.symbol(t.toString());case"number":return a.number(t);case"boolean":return a.boolean(t);case"null":return a.null("null");case"undefined":return a.undefined("undefined");case"date":return a.date(l(t));case"error":return a.error(f(t));default:return t&&t.toString?t.toString():Object.prototype.toString.call(t)}}function v(e){return-1!==["object","array"].indexOf(r(e))&&(!!h.has(e)||(h.set(e),!1))}var y="";return h.set(e),"object"===r(e)&&Object.keys(e).length>0?y=d(e):"array"===r(e)&&e.length>0&&(y=m(e)),0===y.length?"":`${c}${y.slice(1)}${u}`}},function(e,t,n){"use strict";e.exports=function(e){return Array.isArray(e)?"array":e instanceof Date?"date":e instanceof Error?"error":null===e?"null":"object"==typeof e&&"[object Object]"===Object.prototype.toString.call(e)?"object":typeof e}},function(e,t,n){"use strict";var r=n(166),o=n(167),i=n(168),s=" ",a="\n",c="";function u(e,t){return void 0===e?t:e}e.exports=function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};return{indent:u(e.indent,s),prefix:u(e.prefix,a),postfix:u(e.postfix,c),errorToString:e.errorToString||r,dateToString:e.dateToString||o,colors:Object.assign({},i,e.colors)}}},function(e,t,n){"use strict";e.exports=function(e){return Error.prototype.toString.call(e)}},function(e,t,n){"use strict";e.exports=function(e){return`new Date(${Date.prototype.toISOString.call(e)})`}},function(e,t,n){"use strict";function r(e){return e}e.exports={date:r,error:r,symbol:r,string:r,number:r,boolean:r,null:r,undefined:r}},function(e,t,n){"use strict";e.exports=function(){for(var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:1,t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"  ",n="",r=0;r<e;r+=1)n+=t;return n}},function(e,t,n){"use strict";e.exports={defaults:{System:["OS","CPU","Memory","Container","Shell"],Binaries:["Node","Yarn","npm","Watchman"],Managers:["Apt","Cargo","CocoaPods","Composer","Gradle","Homebrew","Maven","pip2","pip3","RubyGems","Yum"],Utilities:["Bazel","CMake","Make","GCC","Git","Clang","Ninja","Mercurial","Subversion","FFmpeg"],Servers:["Apache","Nginx"],Virtualization:["Docker","Parallels","VirtualBox","VMware Fusion"],SDKs:["iOS SDK","Android SDK","Windows SDK"],IDEs:["Android Studio","Atom","Emacs","IntelliJ","NVim","Nano","PhpStorm","Sublime Text","VSCode","Visual Studio","Vim","WebStorm","Xcode"],Languages:["Bash","Go","Elixir","Erlang","Java","Perl","PHP","Protoc","Python","Python3","R","Ruby","Rust","Scala"],Databases:["MongoDB","MySQL","PostgreSQL","SQLite"],Browsers:["Brave Browser","Chrome","Chrome Canary","Chromium","Edge","Firefox","Firefox Developer Edition","Firefox Nightly","Internet Explorer","Safari","Safari Technology Preview"],Monorepos:["Yarn Workspaces","Lerna"],npmPackages:null,npmGlobalPackages:null},jest:{System:["OS","CPU"],Binaries:["Node","Yarn","npm"],npmPackages:["jest"]},"react-native":{System:["OS","CPU"],Binaries:["Node","Yarn","npm","Watchman"],SDKs:["iOS SDK","Android SDK","Windows SDK"],IDEs:["Android Studio","Xcode","Visual Studio"],npmPackages:["react","react-native"],npmGlobalPackages:["react-native-cli"]},nyc:{System:["OS","CPU","Memory"],Binaries:["Node","Yarn","npm"],npmPackages:"/**/{*babel*,@babel/*/,*istanbul*,nyc,source-map-support,typescript,ts-node}"},webpack:{System:["OS","CPU"],Binaries:["Node","Yarn","npm"],npmPackages:"*webpack*",npmGlobalPackages:["webpack","webpack-cli"]},"styled-components":{System:["OS","CPU"],Binaries:["Node","Yarn","npm"],Browsers:["Chrome","Firefox","Safari"],npmPackages:"*styled-components*"},"create-react-app":{System:["OS","CPU"],Binaries:["Node","npm","Yarn"],Browsers:["Chrome","Edge","Internet Explorer","Firefox","Safari"],npmPackages:["react","react-dom","react-scripts"],npmGlobalPackages:["create-react-app"],options:{duplicates:!0,showNotFound:!0}},apollo:{System:["OS"],Binaries:["Node","npm","Yarn"],Browsers:["Chrome","Edge","Firefox","Safari"],npmPackages:"{*apollo*,@apollo/*}",npmGlobalPackages:"{*apollo*,@apollo/*}"},"react-native-web":{System:["OS","CPU"],Binaries:["Node","npm","Yarn"],Browsers:["Chrome","Edge","Internet Explorer","Firefox","Safari"],npmPackages:["react","react-native-web"],options:{showNotFound:!0}},babel:{System:["OS"],Binaries:["Node","npm","Yarn"],Monorepos:["Yarn Workspaces","Lerna"],npmPackages:"{*babel*,@babel/*,eslint,webpack,create-react-app,react-native,lerna,jest}"},playwright:{System:["OS","Memory","Container"],Binaries:["Node","Yarn","npm"],Languages:["Bash"],npmPackages:"playwright*"}}}]);
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/envinfo/package.json b/node_modules/mathjs/examples/node_modules/envinfo/package.json
new file mode 100644
index 0000000..8a65951
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/envinfo/package.json
@@ -0,0 +1,96 @@
+{
+  "name": "envinfo",
+  "version": "7.8.1",
+  "description": "Info about your dev environment for debugging purposes",
+  "repository": "https://github.com/tabrindle/envinfo",
+  "author": "tabrindle@gmail.com",
+  "license": "MIT",
+  "files": [
+    "dist/"
+  ],
+  "main": "dist/envinfo.js",
+  "bin": {
+    "envinfo": "dist/cli.js"
+  },
+  "engines": {
+    "node": ">=4"
+  },
+  "scripts": {
+    "build": "webpack --progress",
+    "check:format": "prettier -l src/**/*.js --verbose",
+    "compress": "gzexe envinfo-* && upx envinfo-win.exe",
+    "contributors:add": "all-contributors add",
+    "contributors:generate": "all-contributors generate",
+    "postcompress": "tar -czvf envinfo-linux.tar.gz envinfo-linux && tar -czvf envinfo-macos.tar.gz envinfo-macos && zip -r -X envinfo-win.zip envinfo-win.exe",
+    "executable": "pkg package.json",
+    "format": "prettier --write src/**/*.js",
+    "lint": "eslint src",
+    "lint-fix": "eslint src --fix",
+    "preversion": "npm run test && webpack && git add .",
+    "postversion": "npm run executable && npm run compress && npm run release",
+    "release": "github-release upload --owner=tabrindle --repo=envinfo --tag=${npm_package_version} 'envinfo-linux.tar.gz' 'envinfo-macos.tar.gz' 'envinfo-win.zip'",
+    "start": "node -r esm src/cli.js",
+    "test": "jest --env=node && eslint src && prettier -l src/**/*.js"
+  },
+  "husky": {
+    "hooks": {
+      "commit-msg": "commitlint -E HUSKY_GIT_PARAMS && npm run lint"
+    }
+  },
+  "keywords": [
+    "development",
+    "env",
+    "environment",
+    "info",
+    "issues",
+    "reporting",
+    "diagnostics"
+  ],
+  "pkg": {
+    "scripts": "dist/*.js",
+    "targets": [
+      "linux",
+      "macos",
+      "win"
+    ]
+  },
+  "jest": {
+    "testEnvironment": "node"
+  },
+  "dependencies": {},
+  "devDependencies": {
+    "@babel/core": "^7.2.2",
+    "@babel/plugin-proposal-optional-chaining": "^7.2.0",
+    "@babel/polyfill": "^7.2.5",
+    "@babel/preset-env": "^7.3.1",
+    "@commitlint/cli": "^8.3.5",
+    "@commitlint/config-conventional": "^8.3.4",
+    "all-contributors-cli": "^4.11.1",
+    "babel-core": "7.0.0-bridge.0",
+    "babel-eslint": "^10.0.1",
+    "babel-jest": "23.6.0",
+    "babel-loader": "^8.0.5",
+    "eslint": "^5.13.0",
+    "eslint-config-airbnb-base": "^12.1.0",
+    "eslint-config-prettier": "^2.7.0",
+    "eslint-plugin-import": "^2.8.0",
+    "eslint-plugin-prettier": "^2.3.1",
+    "esm": "^3.2.22",
+    "github-release-cli": "^0.4.1",
+    "glob": "^7.1.6",
+    "husky": "^4.2.5",
+    "jest": "^22.4.3",
+    "minimist": "^1.2.5",
+    "os-name": "^3.1.0",
+    "pkg": "^4.5.1",
+    "prettier": "^1.19.1",
+    "prettier-eslint-cli": "^4.1.1",
+    "webpack": "^4.29.6",
+    "webpack-cli": "^3.1.2",
+    "which": "^1.2.14",
+    "yamlify-object": "^0.5.1"
+  },
+  "resolutions": {
+    "lodash": "4.17.15"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/LICENSE b/node_modules/mathjs/examples/node_modules/es-module-lexer/LICENSE
new file mode 100644
index 0000000..740b7ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/LICENSE
@@ -0,0 +1,10 @@
+MIT License
+-----------
+
+Copyright (C) 2018-2021 Guy Bedford
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/README.md b/node_modules/mathjs/examples/node_modules/es-module-lexer/README.md
new file mode 100644
index 0000000..4cfcc85
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/README.md
@@ -0,0 +1,251 @@
+# ES Module Lexer
+
+[![Build Status][travis-image]][travis-url]
+
+A JS module syntax lexer used in [es-module-shims](https://github.com/guybedford/es-module-shims).
+
+Outputs the list of exports and locations of import specifiers, including dynamic import and import meta handling.
+
+A very small single JS file (4KiB gzipped) that includes inlined Web Assembly for very fast source analysis of ECMAScript module syntax only.
+
+For an example of the performance, Angular 1 (720KiB) is fully parsed in 5ms, in comparison to the fastest JS parser, Acorn which takes over 100ms.
+
+_Comprehensively handles the JS language grammar while remaining small and fast. - ~10ms per MB of JS cold and ~5ms per MB of JS warm, [see benchmarks](#benchmarks) for more info._
+
+### Usage
+
+```
+npm install es-module-lexer
+```
+
+For use in CommonJS:
+
+```js
+const { init, parse } = require('es-module-lexer');
+
+(async () => {
+  // either await init, or call parse asynchronously
+  // this is necessary for the Web Assembly boot
+  await init;
+
+  const [imports, exports] = parse('export var p = 5');
+  exports[0] === 'p';
+})();
+```
+
+An ES module version is also available:
+
+```js
+import { init, parse } from 'es-module-lexer';
+
+(async () => {
+  await init;
+
+  const source = `
+    import { name } from 'mod';
+    import json from './json.json' assert { type: 'json' }
+    export var p = 5;
+    export function q () {
+
+    };
+
+    // Comments provided to demonstrate edge cases
+    import /*comment!*/ ('asdf', { assert: { type: 'json' }});
+    import /*comment!*/.meta.asdf;
+  `;
+
+  const [imports, exports] = parse(source, 'optional-sourcename');
+
+  // Returns "mod"
+  imports[0].n
+  source.substring(imports[0].s, imports[0].e);
+  // "s" = start
+  // "e" = end
+
+  // Returns "import { name } from 'mod'"
+  source.substring(imports[0].ss, imports[0].se);
+  // "ss" = statement start
+  // "se" = statement end
+
+  // Returns "{ type: 'json' }"
+  source.substring(imports[1].a, imports[1].se);
+  // "a" = assert
+
+  // Returns "p,q"
+  exports.toString();
+
+  // Dynamic imports are indicated by imports[2].d > -1
+  // In this case the "d" index is the start of the dynamic import
+  // Returns true
+  imports[2].d > -1;
+
+  // Returns "asdf"
+  imports[2].n
+  // Returns "'asdf'"
+  source.substring(imports[2].s, imports[2].e);
+  // Returns "import /*comment!*/ ("
+  source.substring(imports[2].d, imports[2].s);
+  // Returns "import /*comment!*/ ('asdf', { assert: { type: 'json' } })"
+  source.substring(imports[2].d, imports[2].se + 1);
+  // Returns "{ assert: { type: 'json' } }"
+  source.substring(imports[2].a, imports[2].e);
+  // ss is the same as d
+  // as, ae not used for dynamic imports
+
+  // import.meta is indicated by imports[2].d === -2
+  // Returns true
+  imports[2].d === -2;
+  // Returns "import /*comment!*/.meta"
+  source.substring(imports[2].s, imports[2].e);
+})();
+```
+
+### CSP asm.js Build
+
+The default version of the library uses Wasm and (safe) eval usage for performance and a minimal footprint.
+
+Neither of these represent security escalation possibilities since there are no execution string injection vectors, but that can still violate existing CSP policies for applications.
+
+For a version that works with CSP eval disabled, use the `es-module-lexer/js` build:
+
+```js
+import { parse } from 'es-module-lexer/js';
+```
+
+Instead of Web Assembly, this uses an asm.js build which is almost as fast as the Wasm version ([see benchmarks below](#benchmarks)).
+
+### Escape Sequences
+
+To handle escape sequences in specifier strings, the `.n` field of imported specifiers will be provided where possible.
+
+For dynamic import expressions, this field will be empty if not a valid JS string.
+
+### Facade Detection
+
+Facade modules that only use import / export syntax can be detected via the third return value:
+
+```js
+const [,, facade] = parse(`
+  export * from 'external';
+  import * as ns from 'external2';
+  export { a as b } from 'external3';
+  export { ns };
+`);
+facade === true;
+```
+
+### Environment Support
+
+Node.js 10+, and [all browsers with Web Assembly support](https://caniuse.com/#feat=wasm).
+
+### Grammar Support
+
+* Token state parses all line comments, block comments, strings, template strings, blocks, parens and punctuators.
+* Division operator / regex token ambiguity is handled via backtracking checks against punctuator prefixes, including closing brace or paren backtracking.
+* Always correctly parses valid JS source, but may parse invalid JS source without errors.
+
+### Limitations
+
+The lexing approach is designed to deal with the full language grammar including RegEx / division operator ambiguity through backtracking and paren / brace tracking.
+
+The only limitation to the reduced parser is that the "exports" list may not correctly gather all export identifiers in the following edge cases:
+
+```js
+// Only "a" is detected as an export, "q" isn't
+export var a = 'asdf', q = z;
+
+// "b" is not detected as an export
+export var { a: b } = asdf;
+```
+
+The above cases are handled gracefully in that the lexer will keep going fine, it will just not properly detect the export names above.
+
+### Benchmarks
+
+Benchmarks can be run with `npm run bench`.
+
+Current results for a high spec machine:
+
+#### Wasm Build
+
+```
+Module load time
+> 5ms
+Cold Run, All Samples
+test/samples/*.js (3123 KiB)
+> 20ms
+
+Warm Runs (average of 25 runs)
+test/samples/angular.js (739 KiB)
+> 2.12ms
+test/samples/angular.min.js (188 KiB)
+> 1ms
+test/samples/d3.js (508 KiB)
+> 3.04ms
+test/samples/d3.min.js (274 KiB)
+> 2ms
+test/samples/magic-string.js (35 KiB)
+> 0ms
+test/samples/magic-string.min.js (20 KiB)
+> 0ms
+test/samples/rollup.js (929 KiB)
+> 4.04ms
+test/samples/rollup.min.js (429 KiB)
+> 2.16ms
+
+Warm Runs, All Samples (average of 25 runs)
+test/samples/*.js (3123 KiB)
+> 14.4ms
+```
+
+#### JS Build (asm.js)
+
+```
+Module load time
+> 2ms
+Cold Run, All Samples
+test/samples/*.js (3123 KiB)
+> 35ms
+
+Warm Runs (average of 25 runs)
+test/samples/angular.js (739 KiB)
+> 3ms
+test/samples/angular.min.js (188 KiB)
+> 1.08ms
+test/samples/d3.js (508 KiB)
+> 3.04ms
+test/samples/d3.min.js (274 KiB)
+> 2ms
+test/samples/magic-string.js (35 KiB)
+> 0ms
+test/samples/magic-string.min.js (20 KiB)
+> 0ms
+test/samples/rollup.js (929 KiB)
+> 5.04ms
+test/samples/rollup.min.js (429 KiB)
+> 3ms
+
+Warm Runs, All Samples (average of 25 runs)
+test/samples/*.js (3123 KiB)
+> 17ms
+```
+
+### Building
+
+To build download the WASI SDK from https://github.com/WebAssembly/wasi-sdk/releases.
+
+The Makefile assumes the existence of "wasi-sdk-11.0" and "wabt" (optional) as sibling folders to this project.
+
+The build through the Makefile is then run via `make lib/lexer.wasm`, which can also be triggered via `npm run build:wasm` to create `dist/lexer.js`.
+
+On Windows it may be preferable to use the Linux subsystem.
+
+After the Web Assembly build, the CJS build can be triggered via `npm run build`.
+
+### License
+
+MIT
+
+[travis-url]: https://travis-ci.org/guybedford/es-module-lexer
+[travis-image]: https://travis-ci.org/guybedford/es-module-lexer.svg?branch=master
+
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.asm.js b/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.asm.js
new file mode 100644
index 0000000..acc16df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.asm.js
@@ -0,0 +1 @@
+let e,r,a,i=4194304;const s=1===new Uint8Array(new Uint16Array([1]).buffer)[0];let t,f,c;export function parse(k,l="@"){if(t=k,f=l,t.length>i||!e){for(;t.length>i;)i*=2;r=new ArrayBuffer(4*i),e=function(e,r,a){"use asm";var i=new e.Int8Array(a),s=new e.Int16Array(a),t=new e.Int32Array(a),f=new e.Uint8Array(a),c=new e.Uint16Array(a),n=816;function b(e){e=e|0;var r=0,a=0,f=0,b=0,l=0;l=n;n=n+14336|0;b=l;i[589]=1;s[291]=0;s[292]=0;s[293]=-1;t[15]=t[2];i[590]=0;t[14]=0;i[588]=0;t[16]=l+10240;t[17]=l+2048;i[591]=0;e=(t[3]|0)+-2|0;t[18]=e;r=e+(t[12]<<1)|0;t[19]=r;e:while(1){a=e+2|0;t[18]=a;if(e>>>0>=r>>>0){f=18;break}r:do{switch(s[a>>1]|0){case 9:case 10:case 11:case 12:case 13:case 32:break;case 101:{if((((s[292]|0)==0?R(a)|0:0)?B(e+4|0,120,112,111,114,116)|0:0)?(u(),(i[589]|0)==0):0){f=9;break e}else f=17;break}case 105:{if(R(a)|0?B(e+4|0,109,112,111,114,116)|0:0){k();f=17}else f=17;break}case 59:{f=17;break}case 47:switch(s[e+4>>1]|0){case 47:{G();break r}case 42:{p(1);break r}default:{f=16;break e}}default:{f=16;break e}}}while(0);if((f|0)==17){f=0;t[15]=t[18]}e=t[18]|0;r=t[19]|0}if((f|0)==9){e=t[18]|0;t[15]=e;f=19}else if((f|0)==16){i[589]=0;t[18]=e;f=19}else if((f|0)==18)if(!(i[588]|0)){e=a;f=19}else e=0;do{if((f|0)==19){e:while(1){r=e+2|0;t[18]=r;a=r;if(e>>>0>=(t[19]|0)>>>0){f=75;break}r:do{switch(s[r>>1]|0){case 9:case 10:case 11:case 12:case 13:case 32:break;case 101:{if(((s[292]|0)==0?R(r)|0:0)?B(e+4|0,120,112,111,114,116)|0:0){u();f=74}else f=74;break}case 105:{if(R(r)|0?B(e+4|0,109,112,111,114,116)|0:0){k();f=74}else f=74;break}case 99:{if((R(r)|0?z(e+4|0,108,97,115,115)|0:0)?Z(s[e+12>>1]|0)|0:0){i[591]=1;f=74}else f=74;break}case 40:{r=t[15]|0;a=t[17]|0;f=s[292]|0;s[292]=f+1<<16>>16;t[a+((f&65535)<<2)>>2]=r;f=74;break}case 41:{e=s[292]|0;if(!(e<<16>>16)){f=36;break e}f=e+-1<<16>>16;s[292]=f;e=t[11]|0;if((e|0)!=0?(t[e+20>>2]|0)==(t[(t[17]|0)+((f&65535)<<2)>>2]|0):0){r=e+4|0;if(!(t[r>>2]|0))t[r>>2]=a;t[e+12>>2]=a;t[11]=0;f=74}else f=74;break}case 123:{f=t[15]|0;a=t[8]|0;e=f;do{if((s[f>>1]|0)==41&(a|0)!=0?(t[a+4>>2]|0)==(f|0):0){r=t[9]|0;t[8]=r;if(!r){t[4]=0;break}else{t[r+28>>2]=0;break}}}while(0);r=s[292]|0;f=r&65535;i[b+f>>0]=i[591]|0;i[591]=0;a=t[17]|0;s[292]=r+1<<16>>16;t[a+(f<<2)>>2]=e;f=74;break}case 125:{e=s[292]|0;if(!(e<<16>>16)){f=49;break e}a=e+-1<<16>>16;s[292]=a;r=s[293]|0;if(e<<16>>16!=r<<16>>16)if(r<<16>>16!=-1&(a&65535)<(r&65535)){f=53;break e}else{f=74;break r}else{a=t[16]|0;f=(s[291]|0)+-1<<16>>16;s[291]=f;s[293]=s[a+((f&65535)<<1)>>1]|0;h();f=74;break r}}case 39:{d(39);f=74;break}case 34:{d(34);f=74;break}case 47:switch(s[e+4>>1]|0){case 47:{G();break r}case 42:{p(1);break r}default:{r=t[15]|0;a=s[r>>1]|0;a:do{if(!(x(a)|0)){switch(a<<16>>16){case 41:if(L(t[(t[17]|0)+(c[292]<<2)>>2]|0)|0){f=71;break a}else{f=68;break a}case 125:break;default:{f=68;break a}}e=c[292]|0;if(!(y(t[(t[17]|0)+(e<<2)>>2]|0)|0)?(i[b+e>>0]|0)==0:0)f=68;else f=71}else switch(a<<16>>16){case 46:if(((s[r+-2>>1]|0)+-48&65535)<10){f=68;break a}else{f=71;break a}case 43:if((s[r+-2>>1]|0)==43){f=68;break a}else{f=71;break a}case 45:if((s[r+-2>>1]|0)==45){f=68;break a}else{f=71;break a}default:{f=71;break a}}}while(0);a:do{if((f|0)==68){f=0;if(!(o(r)|0)){switch(a<<16>>16){case 0:{f=71;break a}case 47:break;default:{e=1;break a}}if(!(i[590]|0))e=1;else f=71}else f=71}}while(0);if((f|0)==71){I();e=0}i[590]=e;f=74;break r}}case 96:{h();f=74;break}default:f=74}}while(0);if((f|0)==74){f=0;t[15]=t[18]}e=t[18]|0}if((f|0)==36){Y();e=0;break}else if((f|0)==49){Y();e=0;break}else if((f|0)==53){Y();e=0;break}else if((f|0)==75){e=(s[293]|0)==-1&(s[292]|0)==0&(i[588]|0)==0;break}}}while(0);n=l;return e|0}function u(){var e=0,r=0,a=0,f=0,c=0,n=0;c=t[18]|0;n=c+12|0;t[18]=n;r=w(1)|0;e=t[18]|0;if(!((e|0)==(n|0)?!(S(r)|0):0))f=3;e:do{if((f|0)==3){r:do{switch(r<<16>>16){case 100:{J(e,e+14|0);break e}case 97:{t[18]=e+10;w(1)|0;e=t[18]|0;f=6;break}case 102:{f=6;break}case 99:{if(z(e+2|0,108,97,115,115)|0?(a=e+10|0,F(s[a>>1]|0)|0):0){t[18]=a;c=w(1)|0;n=t[18]|0;H(c)|0;J(n,t[18]|0);t[18]=(t[18]|0)+-2;break e}e=e+4|0;t[18]=e;f=13;break}case 108:case 118:{f=13;break}case 123:{t[18]=e+2;e=w(1)|0;a=t[18]|0;while(1){if(_(e)|0){d(e);e=(t[18]|0)+2|0;t[18]=e}else{H(e)|0;e=t[18]|0}w(1)|0;e=g(a,e)|0;if(e<<16>>16==44){t[18]=(t[18]|0)+2;e=w(1)|0}r=a;a=t[18]|0;if(e<<16>>16==125){f=32;break}if((a|0)==(r|0)){f=29;break}if(a>>>0>(t[19]|0)>>>0){f=31;break}}if((f|0)==29){Y();break e}else if((f|0)==31){Y();break e}else if((f|0)==32){t[18]=a+2;f=34;break r}break}case 42:{t[18]=e+2;w(1)|0;f=t[18]|0;g(f,f)|0;f=34;break}default:{}}}while(0);if((f|0)==6){t[18]=e+16;e=w(1)|0;if(e<<16>>16==42){t[18]=(t[18]|0)+2;e=w(1)|0}n=t[18]|0;H(e)|0;J(n,t[18]|0);t[18]=(t[18]|0)+-2;break}else if((f|0)==13){e=e+4|0;t[18]=e;i[589]=0;r:while(1){t[18]=e+2;n=w(1)|0;e=t[18]|0;switch((H(n)|0)<<16>>16){case 91:case 123:{f=15;break r}default:{}}r=t[18]|0;if((r|0)==(e|0))break e;J(e,r);switch((w(1)|0)<<16>>16){case 61:{f=19;break r}case 44:break;default:{f=20;break r}}e=t[18]|0}if((f|0)==15){t[18]=(t[18]|0)+-2;break}else if((f|0)==19){t[18]=(t[18]|0)+-2;break}else if((f|0)==20){t[18]=(t[18]|0)+-2;break}}else if((f|0)==34)r=w(1)|0;e=t[18]|0;if(r<<16>>16==102?K(e+2|0,114,111,109)|0:0){t[18]=e+8;l(c,w(1)|0);break}t[18]=e+-2}}while(0);return}function k(){var e=0,r=0,a=0,f=0,c=0;c=t[18]|0;r=c+12|0;t[18]=r;e:do{switch((w(1)|0)<<16>>16){case 40:{r=t[17]|0;a=s[292]|0;s[292]=a+1<<16>>16;t[r+((a&65535)<<2)>>2]=c;if((s[t[15]>>1]|0)!=46){v(c,(t[18]|0)+2|0,0,c);t[11]=t[8];t[18]=(t[18]|0)+2;switch((w(1)|0)<<16>>16){case 39:{d(39);break}case 34:{d(34);break}default:{t[18]=(t[18]|0)+-2;break e}}t[18]=(t[18]|0)+2;switch((w(1)|0)<<16>>16){case 44:{c=t[18]|0;t[(t[8]|0)+4>>2]=c;t[18]=c+2;w(1)|0;c=t[18]|0;a=t[8]|0;t[a+16>>2]=c;i[a+24>>0]=1;t[18]=c+-2;break e}case 41:{s[292]=(s[292]|0)+-1<<16>>16;a=t[18]|0;c=t[8]|0;t[c+4>>2]=a;t[c+12>>2]=a;i[c+24>>0]=1;break e}default:{t[18]=(t[18]|0)+-2;break e}}}break}case 46:{t[18]=(t[18]|0)+2;if(((w(1)|0)<<16>>16==109?(e=t[18]|0,K(e+2|0,101,116,97)|0):0)?(s[t[15]>>1]|0)!=46:0)v(c,c,e+8|0,2);break}case 42:case 39:case 34:{f=16;break}case 123:{e=t[18]|0;if(s[292]|0){t[18]=e+-2;break e}while(1){if(e>>>0>=(t[19]|0)>>>0)break;e=w(1)|0;if(!(_(e)|0)){if(e<<16>>16==125){f=31;break}}else d(e);e=(t[18]|0)+2|0;t[18]=e}if((f|0)==31)t[18]=(t[18]|0)+2;w(1)|0;e=t[18]|0;if(!(z(e,102,114,111,109)|0)){Y();break e}t[18]=e+8;e=w(1)|0;if(_(e)|0){l(c,e);break e}else{Y();break e}}default:if((t[18]|0)!=(r|0))f=16}}while(0);do{if((f|0)==16){if(s[292]|0){t[18]=(t[18]|0)+-2;break}e=t[19]|0;r=t[18]|0;while(1){if(r>>>0>=e>>>0){f=23;break}a=s[r>>1]|0;if(_(a)|0){f=21;break}f=r+2|0;t[18]=f;r=f}if((f|0)==21){l(c,a);break}else if((f|0)==23){Y();break}}}while(0);return}function l(e,r){e=e|0;r=r|0;var a=0,i=0;a=(t[18]|0)+2|0;switch(r<<16>>16){case 39:{d(39);i=5;break}case 34:{d(34);i=5;break}default:Y()}do{if((i|0)==5){v(e,a,t[18]|0,1);t[18]=(t[18]|0)+2;i=(w(0)|0)<<16>>16==97;r=t[18]|0;if(i?B(r+2|0,115,115,101,114,116)|0:0){t[18]=r+12;if((w(1)|0)<<16>>16!=123){t[18]=r;break}e=t[18]|0;a=e;e:while(1){t[18]=a+2;a=w(1)|0;switch(a<<16>>16){case 39:{d(39);t[18]=(t[18]|0)+2;a=w(1)|0;break}case 34:{d(34);t[18]=(t[18]|0)+2;a=w(1)|0;break}default:a=H(a)|0}if(a<<16>>16!=58){i=16;break}t[18]=(t[18]|0)+2;switch((w(1)|0)<<16>>16){case 39:{d(39);break}case 34:{d(34);break}default:{i=20;break e}}t[18]=(t[18]|0)+2;switch((w(1)|0)<<16>>16){case 125:{i=25;break e}case 44:break;default:{i=24;break e}}t[18]=(t[18]|0)+2;if((w(1)|0)<<16>>16==125){i=25;break}a=t[18]|0}if((i|0)==16){t[18]=r;break}else if((i|0)==20){t[18]=r;break}else if((i|0)==24){t[18]=r;break}else if((i|0)==25){i=t[8]|0;t[i+16>>2]=e;t[i+12>>2]=(t[18]|0)+2;break}}t[18]=r+-2}}while(0);return}function o(e){e=e|0;e:do{switch(s[e>>1]|0){case 100:switch(s[e+-2>>1]|0){case 105:{e=q(e+-4|0,118,111)|0;break e}case 108:{e=P(e+-4|0,121,105,101)|0;break e}default:{e=0;break e}}case 101:{switch(s[e+-2>>1]|0){case 115:break;case 116:{e=E(e+-4|0,100,101,108,101)|0;break e}default:{e=0;break e}}switch(s[e+-4>>1]|0){case 108:{e=D(e+-6|0,101)|0;break e}case 97:{e=D(e+-6|0,99)|0;break e}default:{e=0;break e}}}case 102:{if((s[e+-2>>1]|0)==111?(s[e+-4>>1]|0)==101:0)switch(s[e+-6>>1]|0){case 99:{e=O(e+-8|0,105,110,115,116,97,110)|0;break e}case 112:{e=q(e+-8|0,116,121)|0;break e}default:{e=0;break e}}else e=0;break}case 110:{e=e+-2|0;if(D(e,105)|0)e=1;else e=$(e,114,101,116,117,114)|0;break}case 111:{e=D(e+-2|0,100)|0;break}case 114:{e=m(e+-2|0,100,101,98,117,103,103,101)|0;break}case 116:{e=E(e+-2|0,97,119,97,105)|0;break}case 119:switch(s[e+-2>>1]|0){case 101:{e=D(e+-4|0,110)|0;break e}case 111:{e=P(e+-4|0,116,104,114)|0;break e}default:{e=0;break e}}default:e=0}}while(0);return e|0}function h(){var e=0,r=0,a=0;r=t[19]|0;a=t[18]|0;e:while(1){e=a+2|0;if(a>>>0>=r>>>0){r=8;break}switch(s[e>>1]|0){case 96:{r=9;break e}case 36:{if((s[a+4>>1]|0)==123){r=6;break e}break}case 92:{e=a+4|0;break}default:{}}a=e}if((r|0)==6){t[18]=a+4;e=s[293]|0;r=t[16]|0;a=s[291]|0;s[291]=a+1<<16>>16;s[r+((a&65535)<<1)>>1]=e;a=(s[292]|0)+1<<16>>16;s[292]=a;s[293]=a}else if((r|0)==8){t[18]=e;Y()}else if((r|0)==9)t[18]=e;return}function w(e){e=e|0;var r=0,a=0,i=0;a=t[18]|0;e:do{r=s[a>>1]|0;r:do{if(r<<16>>16!=47)if(e)if(Z(r)|0)break;else break e;else if(Q(r)|0)break;else break e;else switch(s[a+2>>1]|0){case 47:{G();break r}case 42:{p(e);break r}default:{r=47;break e}}}while(0);i=t[18]|0;a=i+2|0;t[18]=a}while(i>>>0<(t[19]|0)>>>0);return r|0}function d(e){e=e|0;var r=0,a=0,i=0,f=0;f=t[19]|0;r=t[18]|0;while(1){i=r+2|0;if(r>>>0>=f>>>0){r=9;break}a=s[i>>1]|0;if(a<<16>>16==e<<16>>16){r=10;break}if(a<<16>>16==92){a=r+4|0;if((s[a>>1]|0)==13){r=r+6|0;r=(s[r>>1]|0)==10?r:a}else r=a}else if(ae(a)|0){r=9;break}else r=i}if((r|0)==9){t[18]=i;Y()}else if((r|0)==10)t[18]=i;return}function v(e,r,a,s){e=e|0;r=r|0;a=a|0;s=s|0;var f=0,c=0;f=t[13]|0;t[13]=f+32;c=t[8]|0;t[((c|0)==0?16:c+28|0)>>2]=f;t[9]=c;t[8]=f;t[f+8>>2]=e;do{if(2!=(s|0))if(1==(s|0)){t[f+12>>2]=a+2;break}else{t[f+12>>2]=t[3];break}else t[f+12>>2]=a}while(0);t[f>>2]=r;t[f+4>>2]=a;t[f+16>>2]=0;t[f+20>>2]=s;i[f+24>>0]=1==(s|0)&1;t[f+28>>2]=0;return}function A(){var e=0,r=0,a=0;a=t[19]|0;r=t[18]|0;e:while(1){e=r+2|0;if(r>>>0>=a>>>0){r=6;break}switch(s[e>>1]|0){case 13:case 10:{r=6;break e}case 93:{r=7;break e}case 92:{e=r+4|0;break}default:{}}r=e}if((r|0)==6){t[18]=e;Y();e=0}else if((r|0)==7){t[18]=e;e=93}return e|0}function C(e,r,a,i,t,f,c,n){e=e|0;r=r|0;a=a|0;i=i|0;t=t|0;f=f|0;c=c|0;n=n|0;if((((((s[e+12>>1]|0)==n<<16>>16?(s[e+10>>1]|0)==c<<16>>16:0)?(s[e+8>>1]|0)==f<<16>>16:0)?(s[e+6>>1]|0)==t<<16>>16:0)?(s[e+4>>1]|0)==i<<16>>16:0)?(s[e+2>>1]|0)==a<<16>>16:0)r=(s[e>>1]|0)==r<<16>>16;else r=0;return r|0}function y(e){e=e|0;switch(s[e>>1]|0){case 62:{e=(s[e+-2>>1]|0)==61;break}case 41:case 59:{e=1;break}case 104:{e=E(e+-2|0,99,97,116,99)|0;break}case 121:{e=O(e+-2|0,102,105,110,97,108,108)|0;break}case 101:{e=P(e+-2|0,101,108,115)|0;break}default:e=0}return e|0}function g(e,r){e=e|0;r=r|0;var a=0,i=0;a=t[18]|0;i=s[a>>1]|0;if(i<<16>>16==97){t[18]=a+4;a=w(1)|0;e=t[18]|0;if(_(a)|0){d(a);r=(t[18]|0)+2|0;t[18]=r}else{H(a)|0;r=t[18]|0}i=w(1)|0;a=t[18]|0}if((a|0)!=(e|0))J(e,r);return i|0}function I(){var e=0,r=0,a=0;e:while(1){e=t[18]|0;r=e+2|0;t[18]=r;if(e>>>0>=(t[19]|0)>>>0){a=7;break}switch(s[r>>1]|0){case 13:case 10:{a=7;break e}case 47:break e;case 91:{A()|0;break}case 92:{t[18]=e+4;break}default:{}}}if((a|0)==7)Y();return}function p(e){e=e|0;var r=0,a=0,i=0,f=0,c=0;f=(t[18]|0)+2|0;t[18]=f;a=t[19]|0;while(1){r=f+2|0;if(f>>>0>=a>>>0)break;i=s[r>>1]|0;if(!e?ae(i)|0:0)break;if(i<<16>>16==42?(s[f+4>>1]|0)==47:0){c=8;break}f=r}if((c|0)==8){t[18]=r;r=f+4|0}t[18]=r;return}function U(e,r,a,i,t,f,c){e=e|0;r=r|0;a=a|0;i=i|0;t=t|0;f=f|0;c=c|0;if(((((s[e+10>>1]|0)==c<<16>>16?(s[e+8>>1]|0)==f<<16>>16:0)?(s[e+6>>1]|0)==t<<16>>16:0)?(s[e+4>>1]|0)==i<<16>>16:0)?(s[e+2>>1]|0)==a<<16>>16:0)r=(s[e>>1]|0)==r<<16>>16;else r=0;return r|0}function m(e,r,a,i,f,c,n,b){e=e|0;r=r|0;a=a|0;i=i|0;f=f|0;c=c|0;n=n|0;b=b|0;var u=0,k=0;k=e+-12|0;u=t[3]|0;if(k>>>0>=u>>>0?C(k,r,a,i,f,c,n,b)|0:0)if((k|0)==(u|0))u=1;else u=F(s[e+-14>>1]|0)|0;else u=0;return u|0}function S(e){e=e|0;e:do{switch(e<<16>>16){case 38:case 37:case 33:{e=1;break}default:if((e&-8)<<16>>16==40|(e+-58&65535)<6)e=1;else{switch(e<<16>>16){case 91:case 93:case 94:{e=1;break e}default:{}}e=(e+-123&65535)<4}}}while(0);return e|0}function x(e){e=e|0;e:do{switch(e<<16>>16){case 38:case 37:case 33:break;default:if(!((e+-58&65535)<6|(e+-40&65535)<7&e<<16>>16!=41)){switch(e<<16>>16){case 91:case 94:break e;default:{}}return e<<16>>16!=125&(e+-123&65535)<4|0}}}while(0);return 1}function O(e,r,a,i,f,c,n){e=e|0;r=r|0;a=a|0;i=i|0;f=f|0;c=c|0;n=n|0;var b=0,u=0;u=e+-10|0;b=t[3]|0;if(u>>>0>=b>>>0?U(u,r,a,i,f,c,n)|0:0)if((u|0)==(b|0))b=1;else b=F(s[e+-12>>1]|0)|0;else b=0;return b|0}function $(e,r,a,i,f,c){e=e|0;r=r|0;a=a|0;i=i|0;f=f|0;c=c|0;var n=0,b=0;b=e+-8|0;n=t[3]|0;if(b>>>0>=n>>>0?B(b,r,a,i,f,c)|0:0)if((b|0)==(n|0))n=1;else n=F(s[e+-10>>1]|0)|0;else n=0;return n|0}function j(e){e=e|0;var r=0,a=0,i=0,f=0;a=n;n=n+16|0;i=a;t[i>>2]=0;t[12]=e;r=t[3]|0;f=r+(e<<1)|0;e=f+2|0;s[f>>1]=0;t[i>>2]=e;t[13]=e;t[4]=0;t[8]=0;t[6]=0;t[5]=0;t[10]=0;t[7]=0;n=a;return r|0}function B(e,r,a,i,t,f){e=e|0;r=r|0;a=a|0;i=i|0;t=t|0;f=f|0;if((((s[e+8>>1]|0)==f<<16>>16?(s[e+6>>1]|0)==t<<16>>16:0)?(s[e+4>>1]|0)==i<<16>>16:0)?(s[e+2>>1]|0)==a<<16>>16:0)r=(s[e>>1]|0)==r<<16>>16;else r=0;return r|0}function E(e,r,a,i,f){e=e|0;r=r|0;a=a|0;i=i|0;f=f|0;var c=0,n=0;n=e+-6|0;c=t[3]|0;if(n>>>0>=c>>>0?z(n,r,a,i,f)|0:0)if((n|0)==(c|0))c=1;else c=F(s[e+-8>>1]|0)|0;else c=0;return c|0}function P(e,r,a,i){e=e|0;r=r|0;a=a|0;i=i|0;var f=0,c=0;c=e+-4|0;f=t[3]|0;if(c>>>0>=f>>>0?K(c,r,a,i)|0:0)if((c|0)==(f|0))f=1;else f=F(s[e+-6>>1]|0)|0;else f=0;return f|0}function q(e,r,a){e=e|0;r=r|0;a=a|0;var i=0,f=0;f=e+-2|0;i=t[3]|0;if(f>>>0>=i>>>0?N(f,r,a)|0:0)if((f|0)==(i|0))i=1;else i=F(s[e+-4>>1]|0)|0;else i=0;return i|0}function z(e,r,a,i,t){e=e|0;r=r|0;a=a|0;i=i|0;t=t|0;if(((s[e+6>>1]|0)==t<<16>>16?(s[e+4>>1]|0)==i<<16>>16:0)?(s[e+2>>1]|0)==a<<16>>16:0)r=(s[e>>1]|0)==r<<16>>16;else r=0;return r|0}function D(e,r){e=e|0;r=r|0;var a=0;a=t[3]|0;if(a>>>0<=e>>>0?(s[e>>1]|0)==r<<16>>16:0)if((a|0)==(e|0))a=1;else a=F(s[e+-2>>1]|0)|0;else a=0;return a|0}function F(e){e=e|0;e:do{if((e+-9&65535)<5)e=1;else{switch(e<<16>>16){case 32:case 160:{e=1;break e}default:{}}e=e<<16>>16!=46&(S(e)|0)}}while(0);return e|0}function G(){var e=0,r=0,a=0;e=t[19]|0;a=t[18]|0;e:while(1){r=a+2|0;if(a>>>0>=e>>>0)break;switch(s[r>>1]|0){case 13:case 10:break e;default:a=r}}t[18]=r;return}function H(e){e=e|0;while(1){if(Z(e)|0)break;if(S(e)|0)break;e=(t[18]|0)+2|0;t[18]=e;e=s[e>>1]|0;if(!(e<<16>>16)){e=0;break}}return e|0}function J(e,r){e=e|0;r=r|0;var a=0,i=0;a=t[13]|0;t[13]=a+12;i=t[10]|0;t[((i|0)==0?20:i+8|0)>>2]=a;t[10]=a;t[a>>2]=e;t[a+4>>2]=r;t[a+8>>2]=0;return}function K(e,r,a,i){e=e|0;r=r|0;a=a|0;i=i|0;if((s[e+4>>1]|0)==i<<16>>16?(s[e+2>>1]|0)==a<<16>>16:0)r=(s[e>>1]|0)==r<<16>>16;else r=0;return r|0}function L(e){e=e|0;if(!($(e,119,104,105,108,101)|0)?!(P(e,102,111,114)|0):0)e=q(e,105,102)|0;else e=1;return e|0}function M(){var e=0;e=t[(t[6]|0)+20>>2]|0;switch(e|0){case 1:{e=-1;break}case 2:{e=-2;break}default:e=e-(t[3]|0)>>1}return e|0}function N(e,r,a){e=e|0;r=r|0;a=a|0;if((s[e+2>>1]|0)==a<<16>>16)r=(s[e>>1]|0)==r<<16>>16;else r=0;return r|0}function Q(e){e=e|0;switch(e<<16>>16){case 160:case 32:case 12:case 11:case 9:{e=1;break}default:e=0}return e|0}function R(e){e=e|0;if((t[3]|0)==(e|0))e=1;else e=F(s[e+-2>>1]|0)|0;return e|0}function T(){var e=0;e=t[(t[6]|0)+16>>2]|0;if(!e)e=-1;else e=e-(t[3]|0)>>1;return e|0}function V(){var e=0;e=t[6]|0;e=t[((e|0)==0?16:e+28|0)>>2]|0;t[6]=e;return(e|0)!=0|0}function W(){var e=0;e=t[7]|0;e=t[((e|0)==0?20:e+8|0)>>2]|0;t[7]=e;return(e|0)!=0|0}function X(e){e=e|0;var r=0;r=n;n=n+e|0;n=n+15&-16;return r|0}function Y(){i[588]=1;t[14]=(t[18]|0)-(t[3]|0)>>1;t[18]=(t[19]|0)+2;return}function Z(e){e=e|0;return(e|128)<<16>>16==160|(e+-9&65535)<5|0}function _(e){e=e|0;return e<<16>>16==39|e<<16>>16==34|0}function ee(){return(t[(t[6]|0)+12>>2]|0)-(t[3]|0)>>1|0}function re(){return(t[(t[6]|0)+8>>2]|0)-(t[3]|0)>>1|0}function ae(e){e=e|0;return e<<16>>16==13|e<<16>>16==10|0}function ie(){return(t[(t[6]|0)+4>>2]|0)-(t[3]|0)>>1|0}function se(){return(t[(t[7]|0)+4>>2]|0)-(t[3]|0)>>1|0}function te(){return(t[t[6]>>2]|0)-(t[3]|0)>>1|0}function fe(){return(t[t[7]>>2]|0)-(t[3]|0)>>1|0}function ce(){return f[(t[6]|0)+24>>0]|0|0}function ne(e){e=e|0;t[3]=e;return}function be(){return(i[589]|0)!=0|0}function ue(){return t[14]|0}return{ai:T,e:ue,ee:se,es:fe,f:be,id:M,ie:ie,ip:ce,is:te,p:b,re:W,ri:V,sa:j,se:ee,ses:ne,ss:re,sta:X}}({Int8Array:Int8Array,Int16Array:Int16Array,Int32Array:Int32Array,Uint8Array:Uint8Array,Uint16Array:Uint16Array},{},r),a=e.sta(2*i)}const o=t.length+1;e.ses(a),e.sa(o-1),(s?b:n)(t,new Uint16Array(r,a,o)),e.p()||(c=e.e(),h());const w=[],d=[];for(;e.ri();){const r=e.is(),a=e.ie(),i=e.ai(),s=e.id(),f=e.ss(),c=e.se();let n;e.ip()&&(n=u(-1===s?r:r+1,t.charCodeAt(-1===s?r-1:r))),w.push({n:n,s:r,e:a,ss:f,se:c,d:s,a:i})}for(;e.re();){const r=e.es(),a=t.charCodeAt(r);d.push(34===a||39===a?u(r+1,a):t.slice(e.es(),e.ee()))}return[w,d,!!e.f()]}function n(e,r){const a=e.length;let i=0;for(;i<a;){const a=e.charCodeAt(i);r[i++]=(255&a)<<8|a>>>8}}function b(e,r){const a=e.length;let i=0;for(;i<a;)r[i]=e.charCodeAt(i++)}function u(e,r){c=e;let a="",i=c;for(;;){c>=t.length&&h();const e=t.charCodeAt(c);if(e===r)break;92===e?(a+=t.slice(i,c),a+=k(),i=c):(8232===e||8233===e||o(e)&&h(),++c)}return a+=t.slice(i,c++),a}function k(){let e=t.charCodeAt(++c);switch(++c,e){case 110:return"\n";case 114:return"\r";case 120:return String.fromCharCode(l(2));case 117:return function(){let e;123===t.charCodeAt(c)?(++c,e=l(t.indexOf("}",c)-c),++c,e>1114111&&h()):e=l(4);return e<=65535?String.fromCharCode(e):(e-=65536,String.fromCharCode(55296+(e>>10),56320+(1023&e)))}();case 116:return"\t";case 98:return"\b";case 118:return"\v";case 102:return"\f";case 13:10===t.charCodeAt(c)&&++c;case 10:return"";case 56:case 57:h();default:if(e>=48&&e<=55){let r=t.substr(c-1,3).match(/^[0-7]+/)[0],a=parseInt(r,8);return a>255&&(r=r.slice(0,-1),a=parseInt(r,8)),c+=r.length-1,e=t.charCodeAt(c),"0"===r&&56!==e&&57!==e||h(),String.fromCharCode(a)}return o(e)?"":String.fromCharCode(e)}}function l(e){const r=c;let a=0,i=0;for(let r=0;r<e;++r,++c){let e,s=t.charCodeAt(c);if(95!==s){if(s>=97)e=s-97+10;else if(s>=65)e=s-65+10;else{if(!(s>=48&&s<=57))break;e=s-48}if(e>=16)break;i=s,a=16*a+e}else 95!==i&&0!==r||h(),i=s}return 95!==i&&c-r===e||h(),a}function o(e){return 13===e||10===e}function h(){throw Object.assign(new Error(`Parse error ${f}:${t.slice(0,c).split("\n").length}:${c-t.lastIndexOf("\n",c-1)}`),{idx:c})}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.cjs b/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.cjs
new file mode 100644
index 0000000..ad4a914
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.cjs
@@ -0,0 +1 @@
+"use strict";exports.parse=parse,exports.init=void 0;const A=1===new Uint8Array(new Uint16Array([1]).buffer)[0];function parse(E,I="@"){if(!B)return init.then(()=>parse(E));const g=E.length+1,D=(B.__heap_base.value||B.__heap_base)+4*g-B.memory.buffer.byteLength;D>0&&B.memory.grow(Math.ceil(D/65536));const w=B.sa(g-1);if((A?C:Q)(E,new Uint16Array(B.memory.buffer,w,g)),!B.parse())throw Object.assign(new Error(`Parse error ${I}:${E.slice(0,B.e()).split("\n").length}:${B.e()-E.lastIndexOf("\n",B.e()-1)}`),{idx:B.e()});const L=[],k=[];for(;B.ri();){const A=B.is(),Q=B.ie(),C=B.ai(),I=B.id(),g=B.ss(),D=B.se();let w;B.ip()&&(w=J(E.slice(-1===I?A-1:A,-1===I?Q+1:Q))),L.push({n:w,s:A,e:Q,ss:g,se:D,d:I,a:C})}for(;B.re();){const A=E.slice(B.es(),B.ee()),Q=A[0];k.push('"'===Q||"'"===Q?J(A):A)}function J(A){try{return(0,eval)(A)}catch(A){}}return[L,k,!!B.f()]}function Q(A,Q){const C=A.length;let B=0;for(;B<C;){const C=A.charCodeAt(B);Q[B++]=(255&C)<<8|C>>>8}}function C(A,Q){const C=A.length;let B=0;for(;B<C;)Q[B]=A.charCodeAt(B++)}let B;const init=WebAssembly.compile((E="AGFzbQEAAAABXA1gAX8Bf2AEf39/fwBgAn9/AGAAAX9gBn9/f39/fwF/YAAAYAF/AGAEf39/fwF/YAN/f38Bf2AHf39/f39/fwF/YAV/f39/fwF/YAJ/fwF/YAh/f39/f39/fwF/AzEwAAECAwMDAwMDAwMDAwMDAwAABAUFBQYFBgAAAAAFBQAEBwgJCgsMAAIAAAALAwkMBAUBcAEBAQUDAQABBg8CfwFB8PAAC38AQfDwAAsHZBEGbWVtb3J5AgACc2EAAAFlAAMCaXMABAJpZQAFAnNzAAYCc2UABwJhaQAIAmlkAAkCaXAACgJlcwALAmVlAAwCcmkADQJyZQAOAWYADwVwYXJzZQAQC19faGVhcF9iYXNlAwEK8jkwaAEBf0EAIAA2ArgIQQAoApAIIgEgAEEBdGoiAEEAOwEAQQAgAEECaiIANgK8CEEAIAA2AsAIQQBBADYClAhBAEEANgKkCEEAQQA2ApwIQQBBADYCmAhBAEEANgKsCEEAQQA2AqAIIAELsgEBAn9BACgCpAgiBEEcakGUCCAEG0EAKALACCIFNgIAQQAgBTYCpAhBACAENgKoCEEAIAVBIGo2AsAIIAUgADYCCAJAAkBBACgCiAggA0cNACAFIAI2AgwMAQsCQEEAKAKECCADRw0AIAUgAkECajYCDAwBCyAFQQAoApAINgIMCyAFIAE2AgAgBSADNgIUIAVBADYCECAFIAI2AgQgBUEANgIcIAVBACgChAggA0Y6ABgLSAEBf0EAKAKsCCICQQhqQZgIIAIbQQAoAsAIIgI2AgBBACACNgKsCEEAIAJBDGo2AsAIIAJBADYCCCACIAE2AgQgAiAANgIACwgAQQAoAsQICxUAQQAoApwIKAIAQQAoApAIa0EBdQsVAEEAKAKcCCgCBEEAKAKQCGtBAXULFQBBACgCnAgoAghBACgCkAhrQQF1CxUAQQAoApwIKAIMQQAoApAIa0EBdQseAQF/QQAoApwIKAIQIgBBACgCkAhrQQF1QX8gABsLOwEBfwJAQQAoApwIKAIUIgBBACgChAhHDQBBfw8LAkAgAEEAKAKICEcNAEF+DwsgAEEAKAKQCGtBAXULCwBBACgCnAgtABgLFQBBACgCoAgoAgBBACgCkAhrQQF1CxUAQQAoAqAIKAIEQQAoApAIa0EBdQslAQF/QQBBACgCnAgiAEEcakGUCCAAGygCACIANgKcCCAAQQBHCyUBAX9BAEEAKAKgCCIAQQhqQZgIIAAbKAIAIgA2AqAIIABBAEcLCABBAC0AyAgL9gsBBH8jAEGA8ABrIgEkAEEAQQE6AMgIQQBB//8DOwHOCEEAQQAoAowINgLQCEEAQQAoApAIQX5qIgI2AuQIQQAgAkEAKAK4CEEBdGoiAzYC6AhBAEEAOwHKCEEAQQA7AcwIQQBBADoA1AhBAEEANgLECEEAQQA6ALQIQQAgAUGA0ABqNgLYCEEAIAFBgBBqNgLcCEEAQQA6AOAIAkACQAJAAkADQEEAIAJBAmoiBDYC5AggAiADTw0BAkAgBC8BACIDQXdqQQVJDQACQAJAAkACQAJAIANBm39qDgUBCAgIAgALIANBIEYNBCADQS9GDQMgA0E7Rg0CDAcLQQAvAcwIDQEgBBARRQ0BIAJBBGpB+ABB8ABB7wBB8gBB9AAQEkUNARATQQAtAMgIDQFBAEEAKALkCCICNgLQCAwHCyAEEBFFDQAgAkEEakHtAEHwAEHvAEHyAEH0ABASRQ0AEBQLQQBBACgC5Ag2AtAIDAELAkAgAi8BBCIEQSpGDQAgBEEvRw0EEBUMAQtBARAWC0EAKALoCCEDQQAoAuQIIQIMAAsLQQAhAyAEIQJBAC0AtAgNAgwBC0EAIAI2AuQIQQBBADoAyAgLA0BBACACQQJqIgQ2AuQIAkACQAJAAkACQAJAIAJBACgC6AhPDQAgBC8BACIDQXdqQQVJDQUCQAJAAkACQAJAAkACQAJAAkACQCADQWBqDgoPDggODg4OBwECAAsCQAJAAkACQCADQaB/ag4KCBERAxEBERERAgALIANBhX9qDgMFEAYLC0EALwHMCA0PIAQQEUUNDyACQQRqQfgAQfAAQe8AQfIAQfQAEBJFDQ8QEwwPCyAEEBFFDQ4gAkEEakHtAEHwAEHvAEHyAEH0ABASRQ0OEBQMDgsgBBARRQ0NIAIvAQpB8wBHDQ0gAi8BCEHzAEcNDSACLwEGQeEARw0NIAIvAQRB7ABHDQ0gAi8BDCIEQXdqIgJBF0sNC0EBIAJ0QZ+AgARxRQ0LDAwLQQBBAC8BzAgiAkEBajsBzAhBACgC3AggAkECdGpBACgC0Ag2AgAMDAtBAC8BzAgiAkUNCEEAIAJBf2oiAzsBzAhBACgCsAgiAkUNCyACKAIUQQAoAtwIIANB//8DcUECdGooAgBHDQsCQCACKAIEDQAgAiAENgIECyACIAQ2AgxBAEEANgKwCAwLCwJAQQAoAtAIIgQvAQBBKUcNAEEAKAKkCCICRQ0AIAIoAgQgBEcNAEEAQQAoAqgIIgI2AqQIAkAgAkUNACACQQA2AhwMAQtBAEEANgKUCAsgAUEALwHMCCICakEALQDgCDoAAEEAIAJBAWo7AcwIQQAoAtwIIAJBAnRqIAQ2AgBBAEEAOgDgCAwKC0EALwHMCCICRQ0GQQAgAkF/aiIDOwHMCCACQQAvAc4IIgRHDQFBAEEALwHKCEF/aiICOwHKCEEAQQAoAtgIIAJB//8DcUEBdGovAQA7Ac4ICxAXDAgLIARB//8DRg0HIANB//8DcSAESQ0EDAcLQScQGAwGC0EiEBgMBQsgA0EvRw0EAkACQCACLwEEIgJBKkYNACACQS9HDQEQFQwHC0EBEBYMBgsCQAJAAkACQEEAKALQCCIELwEAIgIQGUUNAAJAAkACQCACQVVqDgQBBQIABQsgBEF+ai8BAEFQakH//wNxQQpJDQMMBAsgBEF+ai8BAEErRg0CDAMLIARBfmovAQBBLUYNAQwCCwJAIAJB/QBGDQAgAkEpRw0BQQAoAtwIQQAvAcwIQQJ0aigCABAaRQ0BDAILQQAoAtwIQQAvAcwIIgNBAnRqKAIAEBsNASABIANqLQAADQELIAQQHA0AIAJFDQBBASEEIAJBL0ZBAC0A1AhBAEdxRQ0BCxAdQQAhBAtBACAEOgDUCAwEC0EALwHOCEH//wNGQQAvAcwIRXFBAC0AtAhFcSEDDAYLEB5BACEDDAULIARBoAFHDQELQQBBAToA4AgLQQBBACgC5Ag2AtAIC0EAKALkCCECDAALCyABQYDwAGokACADCx0AAkBBACgCkAggAEcNAEEBDwsgAEF+ai8BABAfCz8BAX9BACEGAkAgAC8BCCAFRw0AIAAvAQYgBEcNACAALwEEIANHDQAgAC8BAiACRw0AIAAvAQAgAUYhBgsgBgvUBgEEf0EAQQAoAuQIIgBBDGoiATYC5AhBARAnIQICQAJAAkACQAJAQQAoAuQIIgMgAUcNACACECtFDQELAkACQAJAAkACQCACQZ9/ag4MBgEDCAEHAQEBAQEEAAsCQAJAIAJBKkYNACACQfYARg0FIAJB+wBHDQJBACADQQJqNgLkCEEBECchA0EAKALkCCEBA0ACQAJAIANB//8DcSICQSJGDQAgAkEnRg0AIAIQKhpBACgC5AghAgwBCyACEBhBAEEAKALkCEECaiICNgLkCAtBARAnGgJAIAEgAhAsIgNBLEcNAEEAQQAoAuQIQQJqNgLkCEEBECchAwtBACgC5AghAgJAIANB/QBGDQAgAiABRg0FIAIhASACQQAoAugITQ0BDAULC0EAIAJBAmo2AuQIDAELQQAgA0ECajYC5AhBARAnGkEAKALkCCICIAIQLBoLQQEQJyECC0EAKALkCCEDAkAgAkHmAEcNACADLwEGQe0ARw0AIAMvAQRB7wBHDQAgAy8BAkHyAEcNAEEAIANBCGo2AuQIIABBARAnECgPC0EAIANBfmo2AuQIDAMLEB4PCwJAIAMvAQhB8wBHDQAgAy8BBkHzAEcNACADLwEEQeEARw0AIAMvAQJB7ABHDQAgAy8BChAfRQ0AQQAgA0EKajYC5AhBARAnIQJBACgC5AghAyACECoaIANBACgC5AgQAkEAQQAoAuQIQX5qNgLkCA8LQQAgA0EEaiIDNgLkCAtBACADQQRqIgI2AuQIQQBBADoAyAgDQEEAIAJBAmo2AuQIQQEQJyEDQQAoAuQIIQICQCADECpBIHJB+wBHDQBBAEEAKALkCEF+ajYC5AgPC0EAKALkCCIDIAJGDQEgAiADEAICQEEBECciAkEsRg0AAkAgAkE9Rw0AQQBBACgC5AhBfmo2AuQIDwtBAEEAKALkCEF+ajYC5AgPC0EAKALkCCECDAALCw8LQQAgA0EKajYC5AhBARAnGkEAKALkCCEDC0EAIANBEGo2AuQIAkBBARAnIgJBKkcNAEEAQQAoAuQIQQJqNgLkCEEBECchAgtBACgC5AghAyACECoaIANBACgC5AgQAkEAQQAoAuQIQX5qNgLkCA8LIAMgA0EOahACC64GAQR/QQBBACgC5AgiAEEMaiIBNgLkCAJAAkACQAJAAkACQAJAAkACQAJAQQEQJyICQVlqDggCCAECAQEBBwALIAJBIkYNASACQfsARg0CC0EAKALkCCABRg0HC0EALwHMCA0BQQAoAuQIIQJBACgC6AghAwNAIAIgA08NBAJAAkAgAi8BACIBQSdGDQAgAUEiRw0BCyAAIAEQKA8LQQAgAkECaiICNgLkCAwACwtBACgC5AghAkEALwHMCA0BAkADQAJAAkACQCACQQAoAugITw0AQQEQJyICQSJGDQEgAkEnRg0BIAJB/QBHDQJBAEEAKALkCEECajYC5AgLQQEQJxpBACgC5AgiAi8BBkHtAEcNBiACLwEEQe8ARw0GIAIvAQJB8gBHDQYgAi8BAEHmAEcNBkEAIAJBCGo2AuQIQQEQJyICQSJGDQMgAkEnRg0DDAYLIAIQGAtBAEEAKALkCEECaiICNgLkCAwACwsgACACECgMBQtBAEEAKALkCEF+ajYC5AgPC0EAIAJBfmo2AuQIDwsQHg8LQQBBACgC5AhBAmo2AuQIQQEQJ0HtAEcNAUEAKALkCCICLwEGQeEARw0BIAIvAQRB9ABHDQEgAi8BAkHlAEcNAUEAKALQCC8BAEEuRg0BIAAgACACQQhqQQAoAogIEAEPC0EAKALcCEEALwHMCCICQQJ0aiAANgIAQQAgAkEBajsBzAhBACgC0AgvAQBBLkYNACAAQQAoAuQIQQJqQQAgABABQQBBACgCpAg2ArAIQQBBACgC5AhBAmo2AuQIAkBBARAnIgJBIkYNACACQSdGDQBBAEEAKALkCEF+ajYC5AgPCyACEBhBAEEAKALkCEECajYC5AgCQAJAAkBBARAnQVdqDgQBAgIAAgtBACgCpAhBACgC5AgiAjYCBEEAIAJBAmo2AuQIQQEQJxpBACgCpAgiAkEBOgAYIAJBACgC5AgiATYCEEEAIAFBfmo2AuQIDwtBACgCpAgiAkEBOgAYIAJBACgC5AgiATYCDCACIAE2AgRBAEEALwHMCEF/ajsBzAgPC0EAQQAoAuQIQX5qNgLkCA8LC0cBA39BACgC5AhBAmohAEEAKALoCCEBAkADQCAAIgJBfmogAU8NASACQQJqIQAgAi8BAEF2ag4EAQAAAQALC0EAIAI2AuQIC5gBAQN/QQBBACgC5AgiAUECajYC5AggAUEGaiEBQQAoAugIIQIDQAJAAkACQCABQXxqIAJPDQAgAUF+ai8BACEDAkACQCAADQAgA0EqRg0BIANBdmoOBAIEBAIECyADQSpHDQMLIAEvAQBBL0cNAkEAIAFBfmo2AuQIDAELIAFBfmohAQtBACABNgLkCA8LIAFBAmohAQwACwu/AQEEf0EAKALkCCEAQQAoAugIIQECQAJAA0AgACICQQJqIQAgAiABTw0BAkACQCAALwEAIgNBpH9qDgUBAgICBAALIANBJEcNASACLwEEQfsARw0BQQBBAC8ByggiAEEBajsByghBACgC2AggAEEBdGpBAC8Bzgg7AQBBACACQQRqNgLkCEEAQQAvAcwIQQFqIgA7Ac4IQQAgADsBzAgPCyACQQRqIQAMAAsLQQAgADYC5AgQHg8LQQAgADYC5AgLiAEBBH9BACgC5AghAUEAKALoCCECAkACQANAIAEiA0ECaiEBIAMgAk8NASABLwEAIgQgAEYNAgJAIARB3ABGDQAgBEF2ag4EAgEBAgELIANBBGohASADLwEEQQ1HDQAgA0EGaiABIAMvAQZBCkYbIQEMAAsLQQAgATYC5AgQHg8LQQAgATYC5AgLbAEBfwJAAkAgAEFfaiIBQQVLDQBBASABdEExcQ0BCyAAQUZqQf//A3FBBkkNACAAQSlHIABBWGpB//8DcUEHSXENAAJAIABBpX9qDgQBAAABAAsgAEH9AEcgAEGFf2pB//8DcUEESXEPC0EBCz0BAX9BASEBAkAgAEH3AEHoAEHpAEHsAEHlABAgDQAgAEHmAEHvAEHyABAhDQAgAEHpAEHmABAiIQELIAELmwEBAn9BASEBAkACQAJAAkACQAJAIAAvAQAiAkFFag4EBQQEAQALAkAgAkGbf2oOBAMEBAIACyACQSlGDQQgAkH5AEcNAyAAQX5qQeYAQekAQe4AQeEAQewAQewAECMPCyAAQX5qLwEAQT1GDwsgAEF+akHjAEHhAEH0AEHjABAkDwsgAEF+akHlAEHsAEHzABAhDwtBACEBCyABC9IDAQJ/QQAhAQJAAkACQAJAAkACQAJAAkACQCAALwEAQZx/ag4UAAECCAgICAgICAMECAgFCAYICAcICwJAAkAgAEF+ai8BAEGXf2oOBAAJCQEJCyAAQXxqQfYAQe8AECIPCyAAQXxqQfkAQekAQeUAECEPCwJAAkAgAEF+ai8BAEGNf2oOAgABCAsCQCAAQXxqLwEAIgJB4QBGDQAgAkHsAEcNCCAAQXpqQeUAECUPCyAAQXpqQeMAECUPCyAAQXxqQeQAQeUAQewAQeUAECQPCyAAQX5qLwEAQe8ARw0FIABBfGovAQBB5QBHDQUCQCAAQXpqLwEAIgJB8ABGDQAgAkHjAEcNBiAAQXhqQekAQe4AQfMAQfQAQeEAQe4AECMPCyAAQXhqQfQAQfkAECIPC0EBIQEgAEF+aiIAQekAECUNBCAAQfIAQeUAQfQAQfUAQfIAECAPCyAAQX5qQeQAECUPCyAAQX5qQeQAQeUAQeIAQfUAQecAQecAQeUAECYPCyAAQX5qQeEAQfcAQeEAQekAECQPCwJAIABBfmovAQAiAkHvAEYNACACQeUARw0BIABBfGpB7gAQJQ8LIABBfGpB9ABB6ABB8gAQISEBCyABC3ABAn8CQAJAA0BBAEEAKALkCCIAQQJqIgE2AuQIIABBACgC6AhPDQECQAJAAkAgAS8BACIBQaV/ag4CAQIACwJAIAFBdmoOBAQDAwQACyABQS9HDQIMBAsQLRoMAQtBACAAQQRqNgLkCAwACwsQHgsLNQEBf0EAQQE6ALQIQQAoAuQIIQBBAEEAKALoCEECajYC5AhBACAAQQAoApAIa0EBdTYCxAgLNAEBf0EBIQECQCAAQXdqQf//A3FBBUkNACAAQYABckGgAUYNACAAQS5HIAAQK3EhAQsgAQtJAQN/QQAhBgJAIABBeGoiB0EAKAKQCCIISQ0AIAcgASACIAMgBCAFEBJFDQACQCAHIAhHDQBBAQ8LIABBdmovAQAQHyEGCyAGC1kBA39BACEEAkAgAEF8aiIFQQAoApAIIgZJDQAgAC8BACADRw0AIABBfmovAQAgAkcNACAFLwEAIAFHDQACQCAFIAZHDQBBAQ8LIABBemovAQAQHyEECyAEC0wBA39BACEDAkAgAEF+aiIEQQAoApAIIgVJDQAgAC8BACACRw0AIAQvAQAgAUcNAAJAIAQgBUcNAEEBDwsgAEF8ai8BABAfIQMLIAMLSwEDf0EAIQcCQCAAQXZqIghBACgCkAgiCUkNACAIIAEgAiADIAQgBSAGEC5FDQACQCAIIAlHDQBBAQ8LIABBdGovAQAQHyEHCyAHC2YBA39BACEFAkAgAEF6aiIGQQAoApAIIgdJDQAgAC8BACAERw0AIABBfmovAQAgA0cNACAAQXxqLwEAIAJHDQAgBi8BACABRw0AAkAgBiAHRw0AQQEPCyAAQXhqLwEAEB8hBQsgBQs9AQJ/QQAhAgJAQQAoApAIIgMgAEsNACAALwEAIAFHDQACQCADIABHDQBBAQ8LIABBfmovAQAQHyECCyACC00BA39BACEIAkAgAEF0aiIJQQAoApAIIgpJDQAgCSABIAIgAyAEIAUgBiAHEC9FDQACQCAJIApHDQBBAQ8LIABBcmovAQAQHyEICyAIC5wBAQN/QQAoAuQIIQECQANAAkACQCABLwEAIgJBL0cNAAJAIAEvAQIiAUEqRg0AIAFBL0cNBBAVDAILIAAQFgwBCwJAAkAgAEUNACACQXdqIgFBF0sNAUEBIAF0QZ+AgARxRQ0BDAILIAIQKUUNAwwBCyACQaABRw0CC0EAQQAoAuQIIgNBAmoiATYC5AggA0EAKALoCEkNAAsLIAILywMBAX8CQCABQSJGDQAgAUEnRg0AEB4PC0EAKALkCCECIAEQGCAAIAJBAmpBACgC5AhBACgChAgQAUEAQQAoAuQIQQJqNgLkCEEAECchAEEAKALkCCEBAkACQCAAQeEARw0AIAFBAmpB8wBB8wBB5QBB8gBB9AAQEg0BC0EAIAFBfmo2AuQIDwtBACABQQxqNgLkCAJAQQEQJ0H7AEYNAEEAIAE2AuQIDwtBACgC5AgiAiEAA0BBACAAQQJqNgLkCAJAAkACQEEBECciAEEiRg0AIABBJ0cNAUEnEBhBAEEAKALkCEECajYC5AhBARAnIQAMAgtBIhAYQQBBACgC5AhBAmo2AuQIQQEQJyEADAELIAAQKiEACwJAIABBOkYNAEEAIAE2AuQIDwtBAEEAKALkCEECajYC5AgCQEEBECciAEEiRg0AIABBJ0YNAEEAIAE2AuQIDwsgABAYQQBBACgC5AhBAmo2AuQIAkACQEEBECciAEEsRg0AIABB/QBGDQFBACABNgLkCA8LQQBBACgC5AhBAmo2AuQIQQEQJ0H9AEYNAEEAKALkCCEADAELC0EAKAKkCCIBIAI2AhAgAUEAKALkCEECajYCDAswAQF/AkACQCAAQXdqIgFBF0sNAEEBIAF0QY2AgARxDQELIABBoAFGDQBBAA8LQQELbQECfwJAAkADQAJAIABB//8DcSIBQXdqIgJBF0sNAEEBIAJ0QZ+AgARxDQILIAFBoAFGDQEgACECIAEQKw0CQQAhAkEAQQAoAuQIIgBBAmo2AuQIIAAvAQIiAA0ADAILCyAAIQILIAJB//8DcQtoAQJ/QQEhAQJAAkAgAEFfaiICQQVLDQBBASACdEExcQ0BCyAAQfj/A3FBKEYNACAAQUZqQf//A3FBBkkNAAJAIABBpX9qIgJBA0sNACACQQFHDQELIABBhX9qQf//A3FBBEkhAQsgAQuLAQECfwJAQQAoAuQIIgIvAQAiA0HhAEcNAEEAIAJBBGo2AuQIQQEQJyECQQAoAuQIIQACQAJAIAJBIkYNACACQSdGDQAgAhAqGkEAKALkCCEBDAELIAIQGEEAQQAoAuQIQQJqIgE2AuQIC0EBECchA0EAKALkCCECCwJAIAIgAEYNACAAIAEQAgsgAwtyAQR/QQAoAuQIIQBBACgC6AghAQJAAkADQCAAQQJqIQIgACABTw0BAkACQCACLwEAIgNBpH9qDgIBBAALIAIhACADQXZqDgQCAQECAQsgAEEEaiEADAALC0EAIAI2AuQIEB5BAA8LQQAgAjYC5AhB3QALSQEBf0EAIQcCQCAALwEKIAZHDQAgAC8BCCAFRw0AIAAvAQYgBEcNACAALwEEIANHDQAgAC8BAiACRw0AIAAvAQAgAUYhBwsgBwtTAQF/QQAhCAJAIAAvAQwgB0cNACAALwEKIAZHDQAgAC8BCCAFRw0AIAAvAQYgBEcNACAALwEEIANHDQAgAC8BAiACRw0AIAAvAQAgAUYhCAsgCAsLHwIAQYAICwIAAABBhAgLEAEAAAACAAAAAAQAAHA4AAA=","undefined"!=typeof Buffer?Buffer.from(E,"base64"):Uint8Array.from(atob(E),A=>A.charCodeAt(0)))).then(WebAssembly.instantiate).then(({exports:A})=>{B=A});var E;exports.init=init;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.js b/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.js
new file mode 100644
index 0000000..7e41e5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/dist/lexer.js
@@ -0,0 +1,2 @@
+/* es-module-lexer 0.9.3 */
+const A=1===new Uint8Array(new Uint16Array([1]).buffer)[0];export function parse(E,I="@"){if(!B)return init.then(()=>parse(E));const g=E.length+1,D=(B.__heap_base.value||B.__heap_base)+4*g-B.memory.buffer.byteLength;D>0&&B.memory.grow(Math.ceil(D/65536));const w=B.sa(g-1);if((A?C:Q)(E,new Uint16Array(B.memory.buffer,w,g)),!B.parse())throw Object.assign(new Error(`Parse error ${I}:${E.slice(0,B.e()).split("\n").length}:${B.e()-E.lastIndexOf("\n",B.e()-1)}`),{idx:B.e()});const L=[],k=[];for(;B.ri();){const A=B.is(),Q=B.ie(),C=B.ai(),I=B.id(),g=B.ss(),D=B.se();let w;B.ip()&&(w=J(E.slice(-1===I?A-1:A,-1===I?Q+1:Q))),L.push({n:w,s:A,e:Q,ss:g,se:D,d:I,a:C})}for(;B.re();){const A=E.slice(B.es(),B.ee()),Q=A[0];k.push('"'===Q||"'"===Q?J(A):A)}function J(A){try{return(0,eval)(A)}catch(A){}}return[L,k,!!B.f()]}function Q(A,Q){const C=A.length;let B=0;for(;B<C;){const C=A.charCodeAt(B);Q[B++]=(255&C)<<8|C>>>8}}function C(A,Q){const C=A.length;let B=0;for(;B<C;)Q[B]=A.charCodeAt(B++)}let B;export const init=WebAssembly.compile((E="AGFzbQEAAAABXA1gAX8Bf2AEf39/fwBgAn9/AGAAAX9gBn9/f39/fwF/YAAAYAF/AGAEf39/fwF/YAN/f38Bf2AHf39/f39/fwF/YAV/f39/fwF/YAJ/fwF/YAh/f39/f39/fwF/AzEwAAECAwMDAwMDAwMDAwMDAwAABAUFBQYFBgAAAAAFBQAEBwgJCgsMAAIAAAALAwkMBAUBcAEBAQUDAQABBg8CfwFB8PAAC38AQfDwAAsHZBEGbWVtb3J5AgACc2EAAAFlAAMCaXMABAJpZQAFAnNzAAYCc2UABwJhaQAIAmlkAAkCaXAACgJlcwALAmVlAAwCcmkADQJyZQAOAWYADwVwYXJzZQAQC19faGVhcF9iYXNlAwEK8jkwaAEBf0EAIAA2ArgIQQAoApAIIgEgAEEBdGoiAEEAOwEAQQAgAEECaiIANgK8CEEAIAA2AsAIQQBBADYClAhBAEEANgKkCEEAQQA2ApwIQQBBADYCmAhBAEEANgKsCEEAQQA2AqAIIAELsgEBAn9BACgCpAgiBEEcakGUCCAEG0EAKALACCIFNgIAQQAgBTYCpAhBACAENgKoCEEAIAVBIGo2AsAIIAUgADYCCAJAAkBBACgCiAggA0cNACAFIAI2AgwMAQsCQEEAKAKECCADRw0AIAUgAkECajYCDAwBCyAFQQAoApAINgIMCyAFIAE2AgAgBSADNgIUIAVBADYCECAFIAI2AgQgBUEANgIcIAVBACgChAggA0Y6ABgLSAEBf0EAKAKsCCICQQhqQZgIIAIbQQAoAsAIIgI2AgBBACACNgKsCEEAIAJBDGo2AsAIIAJBADYCCCACIAE2AgQgAiAANgIACwgAQQAoAsQICxUAQQAoApwIKAIAQQAoApAIa0EBdQsVAEEAKAKcCCgCBEEAKAKQCGtBAXULFQBBACgCnAgoAghBACgCkAhrQQF1CxUAQQAoApwIKAIMQQAoApAIa0EBdQseAQF/QQAoApwIKAIQIgBBACgCkAhrQQF1QX8gABsLOwEBfwJAQQAoApwIKAIUIgBBACgChAhHDQBBfw8LAkAgAEEAKAKICEcNAEF+DwsgAEEAKAKQCGtBAXULCwBBACgCnAgtABgLFQBBACgCoAgoAgBBACgCkAhrQQF1CxUAQQAoAqAIKAIEQQAoApAIa0EBdQslAQF/QQBBACgCnAgiAEEcakGUCCAAGygCACIANgKcCCAAQQBHCyUBAX9BAEEAKAKgCCIAQQhqQZgIIAAbKAIAIgA2AqAIIABBAEcLCABBAC0AyAgL9gsBBH8jAEGA8ABrIgEkAEEAQQE6AMgIQQBB//8DOwHOCEEAQQAoAowINgLQCEEAQQAoApAIQX5qIgI2AuQIQQAgAkEAKAK4CEEBdGoiAzYC6AhBAEEAOwHKCEEAQQA7AcwIQQBBADoA1AhBAEEANgLECEEAQQA6ALQIQQAgAUGA0ABqNgLYCEEAIAFBgBBqNgLcCEEAQQA6AOAIAkACQAJAAkADQEEAIAJBAmoiBDYC5AggAiADTw0BAkAgBC8BACIDQXdqQQVJDQACQAJAAkACQAJAIANBm39qDgUBCAgIAgALIANBIEYNBCADQS9GDQMgA0E7Rg0CDAcLQQAvAcwIDQEgBBARRQ0BIAJBBGpB+ABB8ABB7wBB8gBB9AAQEkUNARATQQAtAMgIDQFBAEEAKALkCCICNgLQCAwHCyAEEBFFDQAgAkEEakHtAEHwAEHvAEHyAEH0ABASRQ0AEBQLQQBBACgC5Ag2AtAIDAELAkAgAi8BBCIEQSpGDQAgBEEvRw0EEBUMAQtBARAWC0EAKALoCCEDQQAoAuQIIQIMAAsLQQAhAyAEIQJBAC0AtAgNAgwBC0EAIAI2AuQIQQBBADoAyAgLA0BBACACQQJqIgQ2AuQIAkACQAJAAkACQAJAIAJBACgC6AhPDQAgBC8BACIDQXdqQQVJDQUCQAJAAkACQAJAAkACQAJAAkACQCADQWBqDgoPDggODg4OBwECAAsCQAJAAkACQCADQaB/ag4KCBERAxEBERERAgALIANBhX9qDgMFEAYLC0EALwHMCA0PIAQQEUUNDyACQQRqQfgAQfAAQe8AQfIAQfQAEBJFDQ8QEwwPCyAEEBFFDQ4gAkEEakHtAEHwAEHvAEHyAEH0ABASRQ0OEBQMDgsgBBARRQ0NIAIvAQpB8wBHDQ0gAi8BCEHzAEcNDSACLwEGQeEARw0NIAIvAQRB7ABHDQ0gAi8BDCIEQXdqIgJBF0sNC0EBIAJ0QZ+AgARxRQ0LDAwLQQBBAC8BzAgiAkEBajsBzAhBACgC3AggAkECdGpBACgC0Ag2AgAMDAtBAC8BzAgiAkUNCEEAIAJBf2oiAzsBzAhBACgCsAgiAkUNCyACKAIUQQAoAtwIIANB//8DcUECdGooAgBHDQsCQCACKAIEDQAgAiAENgIECyACIAQ2AgxBAEEANgKwCAwLCwJAQQAoAtAIIgQvAQBBKUcNAEEAKAKkCCICRQ0AIAIoAgQgBEcNAEEAQQAoAqgIIgI2AqQIAkAgAkUNACACQQA2AhwMAQtBAEEANgKUCAsgAUEALwHMCCICakEALQDgCDoAAEEAIAJBAWo7AcwIQQAoAtwIIAJBAnRqIAQ2AgBBAEEAOgDgCAwKC0EALwHMCCICRQ0GQQAgAkF/aiIDOwHMCCACQQAvAc4IIgRHDQFBAEEALwHKCEF/aiICOwHKCEEAQQAoAtgIIAJB//8DcUEBdGovAQA7Ac4ICxAXDAgLIARB//8DRg0HIANB//8DcSAESQ0EDAcLQScQGAwGC0EiEBgMBQsgA0EvRw0EAkACQCACLwEEIgJBKkYNACACQS9HDQEQFQwHC0EBEBYMBgsCQAJAAkACQEEAKALQCCIELwEAIgIQGUUNAAJAAkACQCACQVVqDgQBBQIABQsgBEF+ai8BAEFQakH//wNxQQpJDQMMBAsgBEF+ai8BAEErRg0CDAMLIARBfmovAQBBLUYNAQwCCwJAIAJB/QBGDQAgAkEpRw0BQQAoAtwIQQAvAcwIQQJ0aigCABAaRQ0BDAILQQAoAtwIQQAvAcwIIgNBAnRqKAIAEBsNASABIANqLQAADQELIAQQHA0AIAJFDQBBASEEIAJBL0ZBAC0A1AhBAEdxRQ0BCxAdQQAhBAtBACAEOgDUCAwEC0EALwHOCEH//wNGQQAvAcwIRXFBAC0AtAhFcSEDDAYLEB5BACEDDAULIARBoAFHDQELQQBBAToA4AgLQQBBACgC5Ag2AtAIC0EAKALkCCECDAALCyABQYDwAGokACADCx0AAkBBACgCkAggAEcNAEEBDwsgAEF+ai8BABAfCz8BAX9BACEGAkAgAC8BCCAFRw0AIAAvAQYgBEcNACAALwEEIANHDQAgAC8BAiACRw0AIAAvAQAgAUYhBgsgBgvUBgEEf0EAQQAoAuQIIgBBDGoiATYC5AhBARAnIQICQAJAAkACQAJAQQAoAuQIIgMgAUcNACACECtFDQELAkACQAJAAkACQCACQZ9/ag4MBgEDCAEHAQEBAQEEAAsCQAJAIAJBKkYNACACQfYARg0FIAJB+wBHDQJBACADQQJqNgLkCEEBECchA0EAKALkCCEBA0ACQAJAIANB//8DcSICQSJGDQAgAkEnRg0AIAIQKhpBACgC5AghAgwBCyACEBhBAEEAKALkCEECaiICNgLkCAtBARAnGgJAIAEgAhAsIgNBLEcNAEEAQQAoAuQIQQJqNgLkCEEBECchAwtBACgC5AghAgJAIANB/QBGDQAgAiABRg0FIAIhASACQQAoAugITQ0BDAULC0EAIAJBAmo2AuQIDAELQQAgA0ECajYC5AhBARAnGkEAKALkCCICIAIQLBoLQQEQJyECC0EAKALkCCEDAkAgAkHmAEcNACADLwEGQe0ARw0AIAMvAQRB7wBHDQAgAy8BAkHyAEcNAEEAIANBCGo2AuQIIABBARAnECgPC0EAIANBfmo2AuQIDAMLEB4PCwJAIAMvAQhB8wBHDQAgAy8BBkHzAEcNACADLwEEQeEARw0AIAMvAQJB7ABHDQAgAy8BChAfRQ0AQQAgA0EKajYC5AhBARAnIQJBACgC5AghAyACECoaIANBACgC5AgQAkEAQQAoAuQIQX5qNgLkCA8LQQAgA0EEaiIDNgLkCAtBACADQQRqIgI2AuQIQQBBADoAyAgDQEEAIAJBAmo2AuQIQQEQJyEDQQAoAuQIIQICQCADECpBIHJB+wBHDQBBAEEAKALkCEF+ajYC5AgPC0EAKALkCCIDIAJGDQEgAiADEAICQEEBECciAkEsRg0AAkAgAkE9Rw0AQQBBACgC5AhBfmo2AuQIDwtBAEEAKALkCEF+ajYC5AgPC0EAKALkCCECDAALCw8LQQAgA0EKajYC5AhBARAnGkEAKALkCCEDC0EAIANBEGo2AuQIAkBBARAnIgJBKkcNAEEAQQAoAuQIQQJqNgLkCEEBECchAgtBACgC5AghAyACECoaIANBACgC5AgQAkEAQQAoAuQIQX5qNgLkCA8LIAMgA0EOahACC64GAQR/QQBBACgC5AgiAEEMaiIBNgLkCAJAAkACQAJAAkACQAJAAkACQAJAQQEQJyICQVlqDggCCAECAQEBBwALIAJBIkYNASACQfsARg0CC0EAKALkCCABRg0HC0EALwHMCA0BQQAoAuQIIQJBACgC6AghAwNAIAIgA08NBAJAAkAgAi8BACIBQSdGDQAgAUEiRw0BCyAAIAEQKA8LQQAgAkECaiICNgLkCAwACwtBACgC5AghAkEALwHMCA0BAkADQAJAAkACQCACQQAoAugITw0AQQEQJyICQSJGDQEgAkEnRg0BIAJB/QBHDQJBAEEAKALkCEECajYC5AgLQQEQJxpBACgC5AgiAi8BBkHtAEcNBiACLwEEQe8ARw0GIAIvAQJB8gBHDQYgAi8BAEHmAEcNBkEAIAJBCGo2AuQIQQEQJyICQSJGDQMgAkEnRg0DDAYLIAIQGAtBAEEAKALkCEECaiICNgLkCAwACwsgACACECgMBQtBAEEAKALkCEF+ajYC5AgPC0EAIAJBfmo2AuQIDwsQHg8LQQBBACgC5AhBAmo2AuQIQQEQJ0HtAEcNAUEAKALkCCICLwEGQeEARw0BIAIvAQRB9ABHDQEgAi8BAkHlAEcNAUEAKALQCC8BAEEuRg0BIAAgACACQQhqQQAoAogIEAEPC0EAKALcCEEALwHMCCICQQJ0aiAANgIAQQAgAkEBajsBzAhBACgC0AgvAQBBLkYNACAAQQAoAuQIQQJqQQAgABABQQBBACgCpAg2ArAIQQBBACgC5AhBAmo2AuQIAkBBARAnIgJBIkYNACACQSdGDQBBAEEAKALkCEF+ajYC5AgPCyACEBhBAEEAKALkCEECajYC5AgCQAJAAkBBARAnQVdqDgQBAgIAAgtBACgCpAhBACgC5AgiAjYCBEEAIAJBAmo2AuQIQQEQJxpBACgCpAgiAkEBOgAYIAJBACgC5AgiATYCEEEAIAFBfmo2AuQIDwtBACgCpAgiAkEBOgAYIAJBACgC5AgiATYCDCACIAE2AgRBAEEALwHMCEF/ajsBzAgPC0EAQQAoAuQIQX5qNgLkCA8LC0cBA39BACgC5AhBAmohAEEAKALoCCEBAkADQCAAIgJBfmogAU8NASACQQJqIQAgAi8BAEF2ag4EAQAAAQALC0EAIAI2AuQIC5gBAQN/QQBBACgC5AgiAUECajYC5AggAUEGaiEBQQAoAugIIQIDQAJAAkACQCABQXxqIAJPDQAgAUF+ai8BACEDAkACQCAADQAgA0EqRg0BIANBdmoOBAIEBAIECyADQSpHDQMLIAEvAQBBL0cNAkEAIAFBfmo2AuQIDAELIAFBfmohAQtBACABNgLkCA8LIAFBAmohAQwACwu/AQEEf0EAKALkCCEAQQAoAugIIQECQAJAA0AgACICQQJqIQAgAiABTw0BAkACQCAALwEAIgNBpH9qDgUBAgICBAALIANBJEcNASACLwEEQfsARw0BQQBBAC8ByggiAEEBajsByghBACgC2AggAEEBdGpBAC8Bzgg7AQBBACACQQRqNgLkCEEAQQAvAcwIQQFqIgA7Ac4IQQAgADsBzAgPCyACQQRqIQAMAAsLQQAgADYC5AgQHg8LQQAgADYC5AgLiAEBBH9BACgC5AghAUEAKALoCCECAkACQANAIAEiA0ECaiEBIAMgAk8NASABLwEAIgQgAEYNAgJAIARB3ABGDQAgBEF2ag4EAgEBAgELIANBBGohASADLwEEQQ1HDQAgA0EGaiABIAMvAQZBCkYbIQEMAAsLQQAgATYC5AgQHg8LQQAgATYC5AgLbAEBfwJAAkAgAEFfaiIBQQVLDQBBASABdEExcQ0BCyAAQUZqQf//A3FBBkkNACAAQSlHIABBWGpB//8DcUEHSXENAAJAIABBpX9qDgQBAAABAAsgAEH9AEcgAEGFf2pB//8DcUEESXEPC0EBCz0BAX9BASEBAkAgAEH3AEHoAEHpAEHsAEHlABAgDQAgAEHmAEHvAEHyABAhDQAgAEHpAEHmABAiIQELIAELmwEBAn9BASEBAkACQAJAAkACQAJAIAAvAQAiAkFFag4EBQQEAQALAkAgAkGbf2oOBAMEBAIACyACQSlGDQQgAkH5AEcNAyAAQX5qQeYAQekAQe4AQeEAQewAQewAECMPCyAAQX5qLwEAQT1GDwsgAEF+akHjAEHhAEH0AEHjABAkDwsgAEF+akHlAEHsAEHzABAhDwtBACEBCyABC9IDAQJ/QQAhAQJAAkACQAJAAkACQAJAAkACQCAALwEAQZx/ag4UAAECCAgICAgICAMECAgFCAYICAcICwJAAkAgAEF+ai8BAEGXf2oOBAAJCQEJCyAAQXxqQfYAQe8AECIPCyAAQXxqQfkAQekAQeUAECEPCwJAAkAgAEF+ai8BAEGNf2oOAgABCAsCQCAAQXxqLwEAIgJB4QBGDQAgAkHsAEcNCCAAQXpqQeUAECUPCyAAQXpqQeMAECUPCyAAQXxqQeQAQeUAQewAQeUAECQPCyAAQX5qLwEAQe8ARw0FIABBfGovAQBB5QBHDQUCQCAAQXpqLwEAIgJB8ABGDQAgAkHjAEcNBiAAQXhqQekAQe4AQfMAQfQAQeEAQe4AECMPCyAAQXhqQfQAQfkAECIPC0EBIQEgAEF+aiIAQekAECUNBCAAQfIAQeUAQfQAQfUAQfIAECAPCyAAQX5qQeQAECUPCyAAQX5qQeQAQeUAQeIAQfUAQecAQecAQeUAECYPCyAAQX5qQeEAQfcAQeEAQekAECQPCwJAIABBfmovAQAiAkHvAEYNACACQeUARw0BIABBfGpB7gAQJQ8LIABBfGpB9ABB6ABB8gAQISEBCyABC3ABAn8CQAJAA0BBAEEAKALkCCIAQQJqIgE2AuQIIABBACgC6AhPDQECQAJAAkAgAS8BACIBQaV/ag4CAQIACwJAIAFBdmoOBAQDAwQACyABQS9HDQIMBAsQLRoMAQtBACAAQQRqNgLkCAwACwsQHgsLNQEBf0EAQQE6ALQIQQAoAuQIIQBBAEEAKALoCEECajYC5AhBACAAQQAoApAIa0EBdTYCxAgLNAEBf0EBIQECQCAAQXdqQf//A3FBBUkNACAAQYABckGgAUYNACAAQS5HIAAQK3EhAQsgAQtJAQN/QQAhBgJAIABBeGoiB0EAKAKQCCIISQ0AIAcgASACIAMgBCAFEBJFDQACQCAHIAhHDQBBAQ8LIABBdmovAQAQHyEGCyAGC1kBA39BACEEAkAgAEF8aiIFQQAoApAIIgZJDQAgAC8BACADRw0AIABBfmovAQAgAkcNACAFLwEAIAFHDQACQCAFIAZHDQBBAQ8LIABBemovAQAQHyEECyAEC0wBA39BACEDAkAgAEF+aiIEQQAoApAIIgVJDQAgAC8BACACRw0AIAQvAQAgAUcNAAJAIAQgBUcNAEEBDwsgAEF8ai8BABAfIQMLIAMLSwEDf0EAIQcCQCAAQXZqIghBACgCkAgiCUkNACAIIAEgAiADIAQgBSAGEC5FDQACQCAIIAlHDQBBAQ8LIABBdGovAQAQHyEHCyAHC2YBA39BACEFAkAgAEF6aiIGQQAoApAIIgdJDQAgAC8BACAERw0AIABBfmovAQAgA0cNACAAQXxqLwEAIAJHDQAgBi8BACABRw0AAkAgBiAHRw0AQQEPCyAAQXhqLwEAEB8hBQsgBQs9AQJ/QQAhAgJAQQAoApAIIgMgAEsNACAALwEAIAFHDQACQCADIABHDQBBAQ8LIABBfmovAQAQHyECCyACC00BA39BACEIAkAgAEF0aiIJQQAoApAIIgpJDQAgCSABIAIgAyAEIAUgBiAHEC9FDQACQCAJIApHDQBBAQ8LIABBcmovAQAQHyEICyAIC5wBAQN/QQAoAuQIIQECQANAAkACQCABLwEAIgJBL0cNAAJAIAEvAQIiAUEqRg0AIAFBL0cNBBAVDAILIAAQFgwBCwJAAkAgAEUNACACQXdqIgFBF0sNAUEBIAF0QZ+AgARxRQ0BDAILIAIQKUUNAwwBCyACQaABRw0CC0EAQQAoAuQIIgNBAmoiATYC5AggA0EAKALoCEkNAAsLIAILywMBAX8CQCABQSJGDQAgAUEnRg0AEB4PC0EAKALkCCECIAEQGCAAIAJBAmpBACgC5AhBACgChAgQAUEAQQAoAuQIQQJqNgLkCEEAECchAEEAKALkCCEBAkACQCAAQeEARw0AIAFBAmpB8wBB8wBB5QBB8gBB9AAQEg0BC0EAIAFBfmo2AuQIDwtBACABQQxqNgLkCAJAQQEQJ0H7AEYNAEEAIAE2AuQIDwtBACgC5AgiAiEAA0BBACAAQQJqNgLkCAJAAkACQEEBECciAEEiRg0AIABBJ0cNAUEnEBhBAEEAKALkCEECajYC5AhBARAnIQAMAgtBIhAYQQBBACgC5AhBAmo2AuQIQQEQJyEADAELIAAQKiEACwJAIABBOkYNAEEAIAE2AuQIDwtBAEEAKALkCEECajYC5AgCQEEBECciAEEiRg0AIABBJ0YNAEEAIAE2AuQIDwsgABAYQQBBACgC5AhBAmo2AuQIAkACQEEBECciAEEsRg0AIABB/QBGDQFBACABNgLkCA8LQQBBACgC5AhBAmo2AuQIQQEQJ0H9AEYNAEEAKALkCCEADAELC0EAKAKkCCIBIAI2AhAgAUEAKALkCEECajYCDAswAQF/AkACQCAAQXdqIgFBF0sNAEEBIAF0QY2AgARxDQELIABBoAFGDQBBAA8LQQELbQECfwJAAkADQAJAIABB//8DcSIBQXdqIgJBF0sNAEEBIAJ0QZ+AgARxDQILIAFBoAFGDQEgACECIAEQKw0CQQAhAkEAQQAoAuQIIgBBAmo2AuQIIAAvAQIiAA0ADAILCyAAIQILIAJB//8DcQtoAQJ/QQEhAQJAAkAgAEFfaiICQQVLDQBBASACdEExcQ0BCyAAQfj/A3FBKEYNACAAQUZqQf//A3FBBkkNAAJAIABBpX9qIgJBA0sNACACQQFHDQELIABBhX9qQf//A3FBBEkhAQsgAQuLAQECfwJAQQAoAuQIIgIvAQAiA0HhAEcNAEEAIAJBBGo2AuQIQQEQJyECQQAoAuQIIQACQAJAIAJBIkYNACACQSdGDQAgAhAqGkEAKALkCCEBDAELIAIQGEEAQQAoAuQIQQJqIgE2AuQIC0EBECchA0EAKALkCCECCwJAIAIgAEYNACAAIAEQAgsgAwtyAQR/QQAoAuQIIQBBACgC6AghAQJAAkADQCAAQQJqIQIgACABTw0BAkACQCACLwEAIgNBpH9qDgIBBAALIAIhACADQXZqDgQCAQECAQsgAEEEaiEADAALC0EAIAI2AuQIEB5BAA8LQQAgAjYC5AhB3QALSQEBf0EAIQcCQCAALwEKIAZHDQAgAC8BCCAFRw0AIAAvAQYgBEcNACAALwEEIANHDQAgAC8BAiACRw0AIAAvAQAgAUYhBwsgBwtTAQF/QQAhCAJAIAAvAQwgB0cNACAALwEKIAZHDQAgAC8BCCAFRw0AIAAvAQYgBEcNACAALwEEIANHDQAgAC8BAiACRw0AIAAvAQAgAUYhCAsgCAsLHwIAQYAICwIAAABBhAgLEAEAAAACAAAAAAQAAHA4AAA=","undefined"!=typeof Buffer?Buffer.from(E,"base64"):Uint8Array.from(atob(E),A=>A.charCodeAt(0)))).then(WebAssembly.instantiate).then(({exports:A})=>{B=A});var E;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/lexer.js b/node_modules/mathjs/examples/node_modules/es-module-lexer/lexer.js
new file mode 100644
index 0000000..c921261
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/lexer.js
@@ -0,0 +1,899 @@
+let source, pos, end,
+  openTokenDepth,
+  lastTokenPos,
+  openTokenPosStack,
+  openClassPosStack,
+  curDynamicImport,
+  templateStackDepth,
+  facade,
+  lastSlashWasDivision,
+  nextBraceIsClass,
+  templateDepth,
+  templateStack,
+  imports,
+  exports,
+  name;
+
+function addImport (ss, s, e, d) {
+  const impt = { ss, se: d === -2 ? e : d === -1 ? e + 1 : 0, s, e, d, a: -1, n: undefined };
+  imports.push(impt);
+  return impt;
+}
+
+function readName (impt) {
+  let { d, s } = impt;
+  if (d !== -1)
+    s++;
+  impt.n = readString(s, source.charCodeAt(s - 1));
+}
+
+// Note: parsing is based on the _assumption_ that the source is already valid
+export function parse (_source, _name) {
+  openTokenDepth = 0;
+  curDynamicImport = null;
+  templateDepth = -1;
+  lastTokenPos = -1;
+  lastSlashWasDivision = false;
+  templateStack = Array(1024);
+  templateStackDepth = 0;
+  openTokenPosStack = Array(1024);
+  openClassPosStack = Array(1024);
+  nextBraceIsClass = false;
+  facade = true;
+  name = _name || '@';
+
+  imports = [];
+  exports = new Set();
+
+  source = _source;
+  pos = -1;
+  end = source.length - 1;
+  let ch = 0;
+
+  // start with a pure "module-only" parser
+  m: while (pos++ < end) {
+    ch = source.charCodeAt(pos);
+
+    if (ch === 32 || ch < 14 && ch > 8)
+      continue;
+
+    switch (ch) {
+      case 101/*e*/:
+        if (openTokenDepth === 0 && keywordStart(pos) && source.startsWith('xport', pos + 1)) {
+          tryParseExportStatement();
+          // export might have been a non-pure declaration
+          if (!facade) {
+            lastTokenPos = pos;
+            break m;
+          }
+        }
+        break;
+      case 105/*i*/:
+        if (keywordStart(pos) && source.startsWith('mport', pos + 1))
+          tryParseImportStatement();
+        break;
+      case 59/*;*/:
+        break;
+      case 47/*/*/: {
+        const next_ch = source.charCodeAt(pos + 1);
+        if (next_ch === 47/*/*/) {
+          lineComment();
+          // dont update lastToken
+          continue;
+        }
+        else if (next_ch === 42/***/) {
+          blockComment(true);
+          // dont update lastToken
+          continue;
+        }
+        // fallthrough
+      }
+      default:
+        // as soon as we hit a non-module token, we go to main parser
+        facade = false;
+        pos--;
+        break m;
+    }
+    lastTokenPos = pos;
+  }
+
+  while (pos++ < end) {
+    ch = source.charCodeAt(pos);
+
+    if (ch === 32 || ch < 14 && ch > 8)
+      continue;
+
+    switch (ch) {
+      case 101/*e*/:
+        if (openTokenDepth === 0 && keywordStart(pos) && source.startsWith('xport', pos + 1))
+          tryParseExportStatement();
+        break;
+      case 105/*i*/:
+        if (keywordStart(pos) && source.startsWith('mport', pos + 1))
+          tryParseImportStatement();
+        break;
+      case 99/*c*/:
+        if (keywordStart(pos) && source.startsWith('lass', pos + 1) && isBrOrWs(source.charCodeAt(pos + 5)))
+          nextBraceIsClass = true;
+        break;
+      case 40/*(*/:
+        openTokenPosStack[openTokenDepth++] = lastTokenPos;
+        break;
+      case 41/*)*/:
+        if (openTokenDepth === 0)
+          syntaxError();
+        openTokenDepth--;
+        if (curDynamicImport && curDynamicImport.d === openTokenPosStack[openTokenDepth]) {
+          if (curDynamicImport.e === 0)
+            curDynamicImport.e = pos;
+          curDynamicImport.se = pos;
+          curDynamicImport = null;
+        }
+        break;
+      case 123/*{*/:
+        // dynamic import followed by { is not a dynamic import (so remove)
+        // this is a sneaky way to get around { import () {} } v { import () }
+        // block / object ambiguity without a parser (assuming source is valid)
+        if (source.charCodeAt(lastTokenPos) === 41/*)*/ && imports.length && imports[imports.length - 1].e === lastTokenPos) {
+          imports.pop();
+        }
+        openClassPosStack[openTokenDepth] = nextBraceIsClass;
+        nextBraceIsClass = false;
+        openTokenPosStack[openTokenDepth++] = lastTokenPos;
+        break;
+      case 125/*}*/:
+        if (openTokenDepth === 0)
+          syntaxError();
+        if (openTokenDepth-- === templateDepth) {
+          templateDepth = templateStack[--templateStackDepth];
+          templateString();
+        }
+        else {
+          if (templateDepth !== -1 && openTokenDepth < templateDepth)
+            syntaxError();
+        }
+        break;
+      case 39/*'*/:
+      case 34/*"*/:
+        stringLiteral(ch);
+        break;
+      case 47/*/*/: {
+        const next_ch = source.charCodeAt(pos + 1);
+        if (next_ch === 47/*/*/) {
+          lineComment();
+          // dont update lastToken
+          continue;
+        }
+        else if (next_ch === 42/***/) {
+          blockComment(true);
+          // dont update lastToken
+          continue;
+        }
+        else {
+          // Division / regex ambiguity handling based on checking backtrack analysis of:
+          // - what token came previously (lastToken)
+          // - if a closing brace or paren, what token came before the corresponding
+          //   opening brace or paren (lastOpenTokenIndex)
+          const lastToken = source.charCodeAt(lastTokenPos);
+          if (isExpressionPunctuator(lastToken) &&
+              !(lastToken === 46/*.*/ && (source.charCodeAt(lastTokenPos - 1) >= 48/*0*/ && source.charCodeAt(lastTokenPos - 1) <= 57/*9*/)) &&
+              !(lastToken === 43/*+*/ && source.charCodeAt(lastTokenPos - 1) === 43/*+*/) && !(lastToken === 45/*-*/ && source.charCodeAt(lastTokenPos - 1) === 45/*-*/) ||
+              lastToken === 41/*)*/ && isParenKeyword(openTokenPosStack[openTokenDepth]) ||
+              lastToken === 125/*}*/ && (isExpressionTerminator(openTokenPosStack[openTokenDepth]) || openClassPosStack[openTokenDepth]) ||
+              lastToken === 47/*/*/ && lastSlashWasDivision ||
+              isExpressionKeyword(lastTokenPos) ||
+              !lastToken) {
+            regularExpression();
+            lastSlashWasDivision = false;
+          }
+          else {
+            lastSlashWasDivision = true;
+          }
+        }
+        break;
+      }
+      case 96/*`*/:
+        templateString();
+        break;
+    }
+    lastTokenPos = pos;
+  }
+
+  if (templateDepth !== -1 || openTokenDepth)
+    syntaxError();
+
+  return [imports, [...exports], facade];
+}
+
+function tryParseImportStatement () {
+  const startPos = pos;
+
+  pos += 6;
+
+  let ch = commentWhitespace(true);
+  
+  switch (ch) {
+    // dynamic import
+    case 40/*(*/:
+      openTokenPosStack[openTokenDepth++] = startPos;
+      if (source.charCodeAt(lastTokenPos) === 46/*.*/)
+        return;
+      // dynamic import indicated by positive d
+      const impt = addImport(startPos, pos + 1, 0, startPos);
+      curDynamicImport = impt;
+      // try parse a string, to record a safe dynamic import string
+      pos++;
+      ch = commentWhitespace(true);
+      if (ch === 39/*'*/ || ch === 34/*"*/) {
+        stringLiteral(ch);
+      }
+      else {
+        pos--;
+        return;
+      }
+      pos++;
+      ch = commentWhitespace(true);
+      if (ch === 44/*,*/) {
+        impt.e = pos;
+        pos++;
+        ch = commentWhitespace(true);
+        impt.a = pos;
+        readName(impt);
+        pos--;
+      }
+      else if (ch === 41/*)*/) {
+        openTokenDepth--;
+        impt.e = pos;
+        impt.se = pos;
+        readName(impt);
+      }
+      else {
+        pos--;
+      }
+      return;
+    // import.meta
+    case 46/*.*/:
+      pos++;
+      ch = commentWhitespace(true);
+      // import.meta indicated by d === -2
+      if (ch === 109/*m*/ && source.startsWith('eta', pos + 1) && source.charCodeAt(lastTokenPos) !== 46/*.*/)
+        addImport(startPos, startPos, pos + 4, -2);
+      return;
+    
+    default:
+      // no space after "import" -> not an import keyword
+      if (pos === startPos + 6)
+        break;
+    case 34/*"*/:
+    case 39/*'*/:
+    case 123/*{*/:
+    case 42/***/:
+      // import statement only permitted at base-level
+      if (openTokenDepth !== 0) {
+        pos--;
+        return;
+      }
+      while (pos < end) {
+        ch = source.charCodeAt(pos);
+        if (ch === 39/*'*/ || ch === 34/*"*/) {
+          readImportString(startPos, ch);
+          return;
+        }
+        pos++;
+      }
+      syntaxError();
+  }
+}
+
+function tryParseExportStatement () {
+  const sStartPos = pos;
+
+  pos += 6;
+
+  const curPos = pos;
+
+  let ch = commentWhitespace(true);
+
+  if (pos === curPos && !isPunctuator(ch))
+    return;
+
+  switch (ch) {
+    // export default ...
+    case 100/*d*/:
+      exports.add(source.slice(pos, pos + 7));
+      return;
+
+    // export async? function*? name () {
+    case 97/*a*/:
+      pos += 5;
+      commentWhitespace(true);
+    // fallthrough
+    case 102/*f*/:
+      pos += 8;
+      ch = commentWhitespace(true);
+      if (ch === 42/***/) {
+        pos++;
+        ch = commentWhitespace(true);
+      }
+      const startPos = pos;
+      ch = readToWsOrPunctuator(ch);
+      exports.add(source.slice(startPos, pos));
+      pos--;
+      return;
+
+    case 99/*c*/:
+      if (source.startsWith('lass', pos + 1) && isBrOrWsOrPunctuatorNotDot(source.charCodeAt(pos + 5))) {
+        pos += 5;
+        ch = commentWhitespace(true);
+        const startPos = pos;
+        ch = readToWsOrPunctuator(ch);
+        exports.add(source.slice(startPos, pos));
+        pos--;
+        return;
+      }
+      pos += 2;
+    // fallthrough
+
+    // export var/let/const name = ...(, name = ...)+
+    case 118/*v*/:
+    case 109/*l*/:
+      // destructured initializations not currently supported (skipped for { or [)
+      // also, lexing names after variable equals is skipped (export var p = function () { ... }, q = 5 skips "q")
+      pos += 2;
+      facade = false;
+      do {
+        pos++;
+        ch = commentWhitespace(true);
+        const startPos = pos;
+        ch = readToWsOrPunctuator(ch);
+        // dont yet handle [ { destructurings
+        if (ch === 123/*{*/ || ch === 91/*[*/) {
+          pos--;
+          return;
+        }
+        if (pos === startPos)
+          return;
+        exports.add(source.slice(startPos, pos));
+        ch = commentWhitespace(true);
+        if (ch === 61/*=*/) {
+          pos--;
+          return;
+        }
+      } while (ch === 44/*,*/);
+      pos--;
+      return;
+
+
+    // export {...}
+    case 123/*{*/:
+      pos++;
+      ch = commentWhitespace(true);
+      while (true) {
+        const startPos = pos;
+        readToWsOrPunctuator(ch);
+        const endPos = pos;
+        commentWhitespace(true);
+        ch = readExportAs(startPos, endPos);
+        // ,
+        if (ch === 44/*,*/) {
+          pos++;
+          ch = commentWhitespace(true);
+        }
+        if (ch === 125/*}*/)
+          break;
+        if (pos === startPos)
+          return syntaxError(); 
+        if (pos > end)
+          return syntaxError();
+      }
+      pos++;
+      ch = commentWhitespace(true);
+    break;
+    
+    // export *
+    // export * as X
+    case 42/***/:
+      pos++;
+      commentWhitespace(true);
+      ch = readExportAs(pos, pos);
+      ch = commentWhitespace(true);
+    break;
+  }
+
+  // from ...
+  if (ch === 102/*f*/ && source.startsWith('rom', pos + 1)) {
+    pos += 4;
+    readImportString(sStartPos, commentWhitespace(true));
+  }
+  else {
+    pos--;
+  }
+}
+
+/*
+ * Ported from Acorn
+ *   
+ * MIT License
+
+ * Copyright (C) 2012-2020 by various contributors (see AUTHORS)
+
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+let acornPos;
+function readString (start, quote) {
+  acornPos = start;
+  let out = '', chunkStart = acornPos;
+  for (;;) {
+    if (acornPos >= source.length) syntaxError();
+    const ch = source.charCodeAt(acornPos);
+    if (ch === quote) break;
+    if (ch === 92) { // '\'
+      out += source.slice(chunkStart, acornPos);
+      out += readEscapedChar();
+      chunkStart = acornPos;
+    }
+    else if (ch === 0x2028 || ch === 0x2029) {
+      ++acornPos;
+    }
+    else {
+      if (isBr(ch)) syntaxError();
+      ++acornPos;
+    }
+  }
+  out += source.slice(chunkStart, acornPos++);
+  return out;
+}
+
+// Used to read escaped characters
+
+function readEscapedChar () {
+  let ch = source.charCodeAt(++acornPos);
+  ++acornPos;
+  switch (ch) {
+    case 110: return '\n'; // 'n' -> '\n'
+    case 114: return '\r'; // 'r' -> '\r'
+    case 120: return String.fromCharCode(readHexChar(2)); // 'x'
+    case 117: return readCodePointToString(); // 'u'
+    case 116: return '\t'; // 't' -> '\t'
+    case 98: return '\b'; // 'b' -> '\b'
+    case 118: return '\u000b'; // 'v' -> '\u000b'
+    case 102: return '\f'; // 'f' -> '\f'
+    case 13: if (source.charCodeAt(acornPos) === 10) ++acornPos; // '\r\n'
+    case 10: // ' \n'
+      return '';
+    case 56:
+    case 57:
+      syntaxError();
+    default:
+      if (ch >= 48 && ch <= 55) {
+        let octalStr = source.substr(acornPos - 1, 3).match(/^[0-7]+/)[0];
+        let octal = parseInt(octalStr, 8);
+        if (octal > 255) {
+          octalStr = octalStr.slice(0, -1);
+          octal = parseInt(octalStr, 8);
+        }
+        acornPos += octalStr.length - 1;
+        ch = source.charCodeAt(acornPos);
+        if (octalStr !== '0' || ch === 56 || ch === 57)
+          syntaxError();
+        return String.fromCharCode(octal);
+      }
+      if (isBr(ch)) {
+        // Unicode new line characters after \ get removed from output in both
+        // template literals and strings
+        return '';
+      }
+      return String.fromCharCode(ch);
+  }
+}
+
+// Used to read character escape sequences ('\x', '\u', '\U').
+
+function readHexChar (len) {
+  const start = acornPos;
+  let total = 0, lastCode = 0;
+  for (let i = 0; i < len; ++i, ++acornPos) {
+    let code = source.charCodeAt(acornPos), val;
+
+    if (code === 95) {
+      if (lastCode === 95 || i === 0) syntaxError();
+      lastCode = code;
+      continue;
+    }
+
+    if (code >= 97) val = code - 97 + 10; // a
+    else if (code >= 65) val = code - 65 + 10; // A
+    else if (code >= 48 && code <= 57) val = code - 48; // 0-9
+    else break;
+    if (val >= 16) break;
+    lastCode = code;
+    total = total * 16 + val;
+  }
+
+  if (lastCode === 95 || acornPos - start !== len) syntaxError();
+
+  return total;
+}
+
+// Read a string value, interpreting backslash-escapes.
+
+function readCodePointToString () {
+  const ch = source.charCodeAt(acornPos);
+  let code;
+  if (ch === 123) { // '{'
+    ++acornPos;
+    code = readHexChar(source.indexOf('}', acornPos) - acornPos);
+    ++acornPos;
+    if (code > 0x10FFFF) syntaxError();
+  } else {
+    code = readHexChar(4);
+  }
+  // UTF-16 Decoding
+  if (code <= 0xFFFF) return String.fromCharCode(code);
+  code -= 0x10000;
+  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00);
+}
+
+/*
+ * </ Acorn Port>
+ */
+
+function readExportAs (startPos, endPos) {
+  let ch = source.charCodeAt(pos);
+  if (ch === 97 /*a*/) {
+    pos += 2;
+    ch = commentWhitespace(true);
+    startPos = pos;
+    readToWsOrPunctuator(ch);
+    endPos = pos;
+    ch = commentWhitespace(true);
+  }
+  if (pos !== startPos)
+    exports.add(source.slice(startPos, endPos));
+  return ch;
+}
+
+function readImportString (ss, ch) {
+  const startPos = pos + 1;
+  if (ch === 39/*'*/ || ch === 34/*"*/) {
+    stringLiteral(ch);
+  }
+  else {
+    syntaxError();
+    return;
+  }
+  const impt = addImport(ss, startPos, pos, -1);
+  readName(impt);
+  pos++;
+  ch = commentWhitespace(false);
+  if (ch !== 97/*a*/ || !source.startsWith('ssert', pos + 1)) {
+    pos--;
+    return;
+  }
+  const assertIndex = pos;
+
+  pos += 6;
+  ch = commentWhitespace(true);
+  if (ch !== 123/*{*/) {
+    pos = assertIndex;
+    return;
+  }
+  const assertStart = pos;
+  do {
+    pos++;
+    ch = commentWhitespace(true);
+    if (ch === 39/*'*/ || ch === 34/*"*/) {
+      stringLiteral(ch);
+      pos++;
+      ch = commentWhitespace(true);
+    }
+    else {
+      ch = readToWsOrPunctuator(ch);
+    }
+    if (ch !== 58/*:*/) {
+      pos = assertIndex;
+      return;
+    }
+    pos++;
+    ch = commentWhitespace(true);
+    if (ch === 39/*'*/ || ch === 34/*"*/) {
+      stringLiteral(ch);
+    }
+    else {
+      pos = assertIndex;
+      return;
+    }
+    pos++;
+    ch = commentWhitespace(true);
+    if (ch === 44/*,*/) {
+      pos++;
+      ch = commentWhitespace(true);
+      if (ch === 125/*}*/)
+        break;
+      continue;
+    }
+    if (ch === 125/*}*/)
+      break;
+    pos = assertIndex;
+    return;
+  } while (true);
+  impt.a = assertStart;
+  impt.se = pos + 1;
+}
+
+function commentWhitespace (br) {
+  let ch;
+  do {
+    ch = source.charCodeAt(pos);
+    if (ch === 47/*/*/) {
+      const next_ch = source.charCodeAt(pos + 1);
+      if (next_ch === 47/*/*/)
+        lineComment();
+      else if (next_ch === 42/***/)
+        blockComment(br);
+      else
+        return ch;
+    }
+    else if (br ? !isBrOrWs(ch): !isWsNotBr(ch)) {
+      return ch;
+    }
+  } while (pos++ < end);
+  return ch;
+}
+
+function templateString () {
+  while (pos++ < end) {
+    const ch = source.charCodeAt(pos);
+    if (ch === 36/*$*/ && source.charCodeAt(pos + 1) === 123/*{*/) {
+      pos++;
+      templateStack[templateStackDepth++] = templateDepth;
+      templateDepth = ++openTokenDepth;
+      return;
+    }
+    if (ch === 96/*`*/)
+      return;
+    if (ch === 92/*\*/)
+      pos++;
+  }
+  syntaxError();
+}
+
+function blockComment (br) {
+  pos++;
+  while (pos++ < end) {
+    const ch = source.charCodeAt(pos);
+    if (!br && isBr(ch))
+      return;
+    if (ch === 42/***/ && source.charCodeAt(pos + 1) === 47/*/*/) {
+      pos++;
+      return;
+    }
+  }
+}
+
+function lineComment () {
+  while (pos++ < end) {
+    const ch = source.charCodeAt(pos);
+    if (ch === 10/*\n*/ || ch === 13/*\r*/)
+      return;
+  }
+}
+
+function stringLiteral (quote) {
+  while (pos++ < end) {
+    let ch = source.charCodeAt(pos);
+    if (ch === quote)
+      return;
+    if (ch === 92/*\*/) {
+      ch = source.charCodeAt(++pos);
+      if (ch === 13/*\r*/ && source.charCodeAt(pos + 1) === 10/*\n*/)
+        pos++;
+    }
+    else if (isBr(ch))
+      break;
+  }
+  syntaxError();
+}
+
+function regexCharacterClass () {
+  while (pos++ < end) {
+    let ch = source.charCodeAt(pos);
+    if (ch === 93/*]*/)
+      return ch;
+    if (ch === 92/*\*/)
+      pos++;
+    else if (ch === 10/*\n*/ || ch === 13/*\r*/)
+      break;
+  }
+  syntaxError();
+}
+
+function regularExpression () {
+  while (pos++ < end) {
+    let ch = source.charCodeAt(pos);
+    if (ch === 47/*/*/)
+      return;
+    if (ch === 91/*[*/)
+      ch = regexCharacterClass();
+    else if (ch === 92/*\*/)
+      pos++;
+    else if (ch === 10/*\n*/ || ch === 13/*\r*/)
+      break;
+  }
+  syntaxError();
+}
+
+function readToWsOrPunctuator (ch) {
+  do {
+    if (isBrOrWs(ch) || isPunctuator(ch))
+      return ch;
+  } while (ch = source.charCodeAt(++pos));
+  return ch;
+}
+
+// Note: non-asii BR and whitespace checks omitted for perf / footprint
+// if there is a significant user need this can be reconsidered
+function isBr (c) {
+  return c === 13/*\r*/ || c === 10/*\n*/;
+}
+
+function isWsNotBr (c) {
+  return c === 9 || c === 11 || c === 12 || c === 32 || c === 160;
+}
+
+function isBrOrWs (c) {
+  return c > 8 && c < 14 || c === 32 || c === 160;
+}
+
+function isBrOrWsOrPunctuatorNotDot (c) {
+  return c > 8 && c < 14 || c === 32 || c === 160 || isPunctuator(c) && c !== 46/*.*/;
+}
+
+function keywordStart (pos) {
+  return pos === 0 || isBrOrWsOrPunctuatorNotDot(source.charCodeAt(pos - 1));
+}
+
+function readPrecedingKeyword (pos, match) {
+  if (pos < match.length - 1)
+    return false;
+  return source.startsWith(match, pos - match.length + 1) && (pos === 0 || isBrOrWsOrPunctuatorNotDot(source.charCodeAt(pos - match.length)));
+}
+
+function readPrecedingKeyword1 (pos, ch) {
+  return source.charCodeAt(pos) === ch && (pos === 0 || isBrOrWsOrPunctuatorNotDot(source.charCodeAt(pos - 1)));
+}
+
+// Detects one of case, debugger, delete, do, else, in, instanceof, new,
+//   return, throw, typeof, void, yield, await
+function isExpressionKeyword (pos) {
+  switch (source.charCodeAt(pos)) {
+    case 100/*d*/:
+      switch (source.charCodeAt(pos - 1)) {
+        case 105/*i*/:
+          // void
+          return readPrecedingKeyword(pos - 2, 'vo');
+        case 108/*l*/:
+          // yield
+          return readPrecedingKeyword(pos - 2, 'yie');
+        default:
+          return false;
+      }
+    case 101/*e*/:
+      switch (source.charCodeAt(pos - 1)) {
+        case 115/*s*/:
+          switch (source.charCodeAt(pos - 2)) {
+            case 108/*l*/:
+              // else
+              return readPrecedingKeyword1(pos - 3, 101/*e*/);
+            case 97/*a*/:
+              // case
+              return readPrecedingKeyword1(pos - 3, 99/*c*/);
+            default:
+              return false;
+          }
+        case 116/*t*/:
+          // delete
+          return readPrecedingKeyword(pos - 2, 'dele');
+        default:
+          return false;
+      }
+    case 102/*f*/:
+      if (source.charCodeAt(pos - 1) !== 111/*o*/ || source.charCodeAt(pos - 2) !== 101/*e*/)
+        return false;
+      switch (source.charCodeAt(pos - 3)) {
+        case 99/*c*/:
+          // instanceof
+          return readPrecedingKeyword(pos - 4, 'instan');
+        case 112/*p*/:
+          // typeof
+          return readPrecedingKeyword(pos - 4, 'ty');
+        default:
+          return false;
+      }
+    case 110/*n*/:
+      // in, return
+      return readPrecedingKeyword1(pos - 1, 105/*i*/) || readPrecedingKeyword(pos - 1, 'retur');
+    case 111/*o*/:
+      // do
+      return readPrecedingKeyword1(pos - 1, 100/*d*/);
+    case 114/*r*/:
+      // debugger
+      return readPrecedingKeyword(pos - 1, 'debugge');
+    case 116/*t*/:
+      // await
+      return readPrecedingKeyword(pos - 1, 'awai');
+    case 119/*w*/:
+      switch (source.charCodeAt(pos - 1)) {
+        case 101/*e*/:
+          // new
+          return readPrecedingKeyword1(pos - 2, 110/*n*/);
+        case 111/*o*/:
+          // throw
+          return readPrecedingKeyword(pos - 2, 'thr');
+        default:
+          return false;
+      }
+  }
+  return false;
+}
+
+function isParenKeyword (curPos) {
+  return source.charCodeAt(curPos) === 101/*e*/ && source.startsWith('whil', curPos - 4) ||
+      source.charCodeAt(curPos) === 114/*r*/ && source.startsWith('fo', curPos - 2) ||
+      source.charCodeAt(curPos - 1) === 105/*i*/ && source.charCodeAt(curPos) === 102/*f*/;
+}
+
+function isPunctuator (ch) {
+  // 23 possible punctuator endings: !%&()*+,-./:;<=>?[]^{}|~
+  return ch === 33/*!*/ || ch === 37/*%*/ || ch === 38/*&*/ ||
+    ch > 39 && ch < 48 || ch > 57 && ch < 64 ||
+    ch === 91/*[*/ || ch === 93/*]*/ || ch === 94/*^*/ ||
+    ch > 122 && ch < 127;
+}
+
+function isExpressionPunctuator (ch) {
+  // 20 possible expression endings: !%&(*+,-.:;<=>?[^{|~
+  return ch === 33/*!*/ || ch === 37/*%*/ || ch === 38/*&*/ ||
+    ch > 39 && ch < 47 && ch !== 41 || ch > 57 && ch < 64 ||
+    ch === 91/*[*/ || ch === 94/*^*/ || ch > 122 && ch < 127 && ch !== 125/*}*/;
+}
+
+function isExpressionTerminator (curPos) {
+  // detects:
+  // => ; ) finally catch else
+  // as all of these followed by a { will indicate a statement brace
+  switch (source.charCodeAt(curPos)) {
+    case 62/*>*/:
+      return source.charCodeAt(curPos - 1) === 61/*=*/;
+    case 59/*;*/:
+    case 41/*)*/:
+      return true;
+    case 104/*h*/:
+      return source.startsWith('catc', curPos - 4);
+    case 121/*y*/:
+      return source.startsWith('finall', curPos - 6);
+    case 101/*e*/:
+      return source.startsWith('els', curPos - 3);
+  }
+  return false;
+}
+
+function syntaxError () {
+  throw Object.assign(new Error(`Parse error ${name}:${source.slice(0, pos).split('\n').length}:${pos - source.lastIndexOf('\n', pos - 1)}`), { idx: pos });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/package.json b/node_modules/mathjs/examples/node_modules/es-module-lexer/package.json
new file mode 100644
index 0000000..bdabf21
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/package.json
@@ -0,0 +1,53 @@
+{
+  "name": "es-module-lexer",
+  "version": "0.9.3",
+  "description": "Lexes ES modules returning their import/export metadata",
+  "main": "dist/lexer.cjs",
+  "module": "dist/lexer.js",
+  "types": "types/lexer.d.ts",
+  "exports": {
+    ".": {
+      "module": "./dist/lexer.js",
+      "import": "./dist/lexer.js",
+      "require": "./dist/lexer.cjs"
+    },
+    "./js": "./dist/lexer.asm.js"
+  },
+  "scripts": {
+    "test:js": "mocha -b -u tdd test/*.cjs",
+    "test:wasm": "cross-env WASM=1 mocha -b -u tdd test/*.cjs",
+    "test": "npm run test:js && npm run test:wasm",
+    "build": "npm run build:wasm && npm run build:asm && npm run build:cjs",
+    "build:cjs": "babel dist/lexer.js | terser -c -m -o dist/lexer.cjs",
+    "build:wasm": "node build.js",
+    "build:asm": "cat src/lexer.asm.js lib/lexer.asm.js | terser --module -c -m -o dist/lexer.asm.js",
+    "bench": "node --expose-gc bench/index.js",
+    "prepublishOnly": "npm run build",
+    "footprint": "npm run build && echo Wasm: && cat dist/lexer.js | brotli | wc -c && echo Asm.js: && cat dist/lexer.asm.js | brotli | wc -c"
+  },
+  "author": "Guy Bedford",
+  "license": "MIT",
+  "devDependencies": {
+    "@babel/cli": "^7.5.5",
+    "@babel/core": "^7.5.5",
+    "@babel/plugin-transform-modules-commonjs": "^7.5.0",
+    "cross-env": "^7.0.3",
+    "kleur": "^2.0.2",
+    "mocha": "^5.2.0",
+    "terser": "^4.1.4"
+  },
+  "files": [
+    "dist",
+    "types",
+    "lexer.js"
+  ],
+  "type": "module",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/guybedford/es-module-lexer.git"
+  },
+  "bugs": {
+    "url": "https://github.com/guybedford/es-module-lexer/issues"
+  },
+  "homepage": "https://github.com/guybedford/es-module-lexer#readme"
+}
diff --git a/node_modules/mathjs/examples/node_modules/es-module-lexer/types/lexer.d.ts b/node_modules/mathjs/examples/node_modules/es-module-lexer/types/lexer.d.ts
new file mode 100644
index 0000000..6b3fd6f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/es-module-lexer/types/lexer.d.ts
@@ -0,0 +1,86 @@
+export interface ImportSpecifier {
+  /**
+   * Module name
+   * 
+   * To handle escape sequences in specifier strings, the .n field of imported specifiers will be provided where possible.
+   * 
+   * For dynamic import expressions, this field will be empty if not a valid JS string.
+   * 
+   * @example
+   * const [imports1, exports1] = parse(String.raw`import './\u0061\u0062.js'`);
+   * imports1[0].n;
+   * // Returns "./ab.js"
+   * 
+   * const [imports2, exports2] = parse(`import("./ab.js")`);
+   * imports2[0].n;
+   * // Returns "./ab.js"
+   * 
+   * const [imports3, exports3] = parse(`import("./" + "ab.js")`);
+   * imports3[0].n;
+   * // Returns undefined
+   */
+  readonly n: string | undefined;
+  /**
+   * Start of module specifier
+   * 
+   * @example
+   * const source = `import { a } from 'asdf'`;
+   * const [imports, exports] = parse(source);
+   * source.substring(imports[0].s, imports[0].e);
+   * // Returns "asdf"
+   */
+  readonly s: number;
+  /**
+   * End of module specifier
+   */
+  readonly e: number;
+
+  /**
+   * Start of import statement
+   * 
+   * @example
+   * const source = `import { a } from 'asdf'`;
+   * const [imports, exports] = parse(source);
+   * source.substring(imports[0].ss, imports[0].se);
+   * // Returns "import { a } from 'asdf';"
+   */
+  readonly ss: number;
+  /**
+   * End of import statement
+   */
+  readonly se: number;
+
+  /**
+   * If this import statement is a dynamic import, this is the start value.
+   * Otherwise this is `-1`.
+   */
+  readonly d: number;
+
+  /**
+   * If this import has an import assertion, this is the start value.
+   * Otherwise this is `-1`.
+   */
+  readonly a: number;
+}
+
+/**
+ * Wait for init to resolve before calling `parse`.
+ */
+export const init: Promise<void>;
+
+/**
+ * Outputs the list of exports and locations of import specifiers,
+ * including dynamic import and import meta handling.
+ * 
+ * @param source Source code to parser
+ * @param name Optional sourcename
+ * @returns Tuple contaning imports list and exports list.
+ */
+export function parse(
+  source: string,
+  name?: string
+): readonly [
+  imports: ReadonlyArray<ImportSpecifier>,
+  exports: ReadonlyArray<string>,
+  facade: boolean
+];
diff --git a/node_modules/mathjs/examples/node_modules/escalade/dist/index.js b/node_modules/mathjs/examples/node_modules/escalade/dist/index.js
new file mode 100644
index 0000000..ad236c4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/dist/index.js
@@ -0,0 +1,22 @@
+const { dirname, resolve } = require('path');
+const { readdir, stat } = require('fs');
+const { promisify } = require('util');
+
+const toStats = promisify(stat);
+const toRead = promisify(readdir);
+
+module.exports = async function (start, callback) {
+	let dir = resolve('.', start);
+	let tmp, stats = await toStats(dir);
+
+	if (!stats.isDirectory()) {
+		dir = dirname(dir);
+	}
+
+	while (true) {
+		tmp = await callback(dir, await toRead(dir));
+		if (tmp) return resolve(dir, tmp);
+		dir = dirname(tmp = dir);
+		if (tmp === dir) break;
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/escalade/dist/index.mjs b/node_modules/mathjs/examples/node_modules/escalade/dist/index.mjs
new file mode 100644
index 0000000..bf95be0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/dist/index.mjs
@@ -0,0 +1,22 @@
+import { dirname, resolve } from 'path';
+import { readdir, stat } from 'fs';
+import { promisify } from 'util';
+
+const toStats = promisify(stat);
+const toRead = promisify(readdir);
+
+export default async function (start, callback) {
+	let dir = resolve('.', start);
+	let tmp, stats = await toStats(dir);
+
+	if (!stats.isDirectory()) {
+		dir = dirname(dir);
+	}
+
+	while (true) {
+		tmp = await callback(dir, await toRead(dir));
+		if (tmp) return resolve(dir, tmp);
+		dir = dirname(tmp = dir);
+		if (tmp === dir) break;
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/escalade/index.d.ts b/node_modules/mathjs/examples/node_modules/escalade/index.d.ts
new file mode 100644
index 0000000..283e398
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/index.d.ts
@@ -0,0 +1,3 @@
+type Promisable<T> = T | Promise<T>;
+export type Callback = (directory: string, files: string[]) => Promisable<string | false | void>;
+export default function (directory: string, callback: Callback): Promise<string | void>;
diff --git a/node_modules/mathjs/examples/node_modules/escalade/license b/node_modules/mathjs/examples/node_modules/escalade/license
new file mode 100644
index 0000000..fa6089f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Luke Edwards <luke.edwards05@gmail.com> (lukeed.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/escalade/package.json b/node_modules/mathjs/examples/node_modules/escalade/package.json
new file mode 100644
index 0000000..0d1bfce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/package.json
@@ -0,0 +1,61 @@
+{
+  "name": "escalade",
+  "version": "3.1.1",
+  "repository": "lukeed/escalade",
+  "description": "A tiny (183B to 210B) and fast utility to ascend parent directories",
+  "module": "dist/index.mjs",
+  "main": "dist/index.js",
+  "types": "index.d.ts",
+  "license": "MIT",
+  "author": {
+    "name": "Luke Edwards",
+    "email": "luke.edwards05@gmail.com",
+    "url": "https://lukeed.com"
+  },
+  "exports": {
+    ".": [
+      {
+        "import": "./dist/index.mjs",
+        "require": "./dist/index.js"
+      },
+      "./dist/index.js"
+    ],
+    "./sync": [
+      {
+        "import": "./sync/index.mjs",
+        "require": "./sync/index.js"
+      },
+      "./sync/index.js"
+    ]
+  },
+  "files": [
+    "*.d.ts",
+    "dist",
+    "sync"
+  ],
+  "modes": {
+    "sync": "src/sync.js",
+    "default": "src/async.js"
+  },
+  "engines": {
+    "node": ">=6"
+  },
+  "scripts": {
+    "build": "bundt",
+    "pretest": "npm run build",
+    "test": "uvu -r esm test -i fixtures"
+  },
+  "keywords": [
+    "find",
+    "parent",
+    "parents",
+    "directory",
+    "search",
+    "walk"
+  ],
+  "devDependencies": {
+    "bundt": "1.1.1",
+    "esm": "3.2.25",
+    "uvu": "0.3.3"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/escalade/readme.md b/node_modules/mathjs/examples/node_modules/escalade/readme.md
new file mode 100644
index 0000000..4e2195c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/readme.md
@@ -0,0 +1,211 @@
+# escalade [![CI](https://github.com/lukeed/escalade/workflows/CI/badge.svg)](https://github.com/lukeed/escalade/actions) [![codecov](https://badgen.now.sh/codecov/c/github/lukeed/escalade)](https://codecov.io/gh/lukeed/escalade)
+
+> A tiny (183B to 210B) and [fast](#benchmarks) utility to ascend parent directories
+
+With [escalade](https://en.wikipedia.org/wiki/Escalade), you can scale parent directories until you've found what you're looking for.<br>Given an input file or directory, `escalade` will continue executing your callback function until either:
+
+1) the callback returns a truthy value
+2) `escalade` has reached the system root directory (eg, `/`)
+
+> **Important:**<br>Please note that `escalade` only deals with direct ancestry – it will not dive into parents' sibling directories.
+
+---
+
+**Notice:** As of v3.1.0, `escalade` now includes [Deno support](http://deno.land/x/escalade)! Please see [Deno Usage](#deno) below.
+
+---
+
+## Install
+
+```
+$ npm install --save escalade
+```
+
+
+## Modes
+
+There are two "versions" of `escalade` available:
+
+#### "async"
+> **Node.js:** >= 8.x<br>
+> **Size (gzip):** 210 bytes<br>
+> **Availability:** [CommonJS](https://unpkg.com/escalade/dist/index.js), [ES Module](https://unpkg.com/escalade/dist/index.mjs)
+
+This is the primary/default mode. It makes use of `async`/`await` and [`util.promisify`](https://nodejs.org/api/util.html#util_util_promisify_original).
+
+#### "sync"
+> **Node.js:** >= 6.x<br>
+> **Size (gzip):** 183 bytes<br>
+> **Availability:** [CommonJS](https://unpkg.com/escalade/sync/index.js), [ES Module](https://unpkg.com/escalade/sync/index.mjs)
+
+This is the opt-in mode, ideal for scenarios where `async` usage cannot be supported.
+
+
+## Usage
+
+***Example Structure***
+
+```
+/Users/lukeed
+  └── oss
+    ├── license
+    └── escalade
+      ├── package.json
+      └── test
+        └── fixtures
+          ├── index.js
+          └── foobar
+            └── demo.js
+```
+
+***Example Usage***
+
+```js
+//~> demo.js
+import { join } from 'path';
+import escalade from 'escalade';
+
+const input = join(__dirname, 'demo.js');
+// or: const input = __dirname;
+
+const pkg = await escalade(input, (dir, names) => {
+  console.log('~> dir:', dir);
+  console.log('~> names:', names);
+  console.log('---');
+
+  if (names.includes('package.json')) {
+    // will be resolved into absolute
+    return 'package.json';
+  }
+});
+
+//~> dir: /Users/lukeed/oss/escalade/test/fixtures/foobar
+//~> names: ['demo.js']
+//---
+//~> dir: /Users/lukeed/oss/escalade/test/fixtures
+//~> names: ['index.js', 'foobar']
+//---
+//~> dir: /Users/lukeed/oss/escalade/test
+//~> names: ['fixtures']
+//---
+//~> dir: /Users/lukeed/oss/escalade
+//~> names: ['package.json', 'test']
+//---
+
+console.log(pkg);
+//=> /Users/lukeed/oss/escalade/package.json
+
+// Now search for "missing123.txt"
+// (Assume it doesn't exist anywhere!)
+const missing = await escalade(input, (dir, names) => {
+  console.log('~> dir:', dir);
+  return names.includes('missing123.txt') && 'missing123.txt';
+});
+
+//~> dir: /Users/lukeed/oss/escalade/test/fixtures/foobar
+//~> dir: /Users/lukeed/oss/escalade/test/fixtures
+//~> dir: /Users/lukeed/oss/escalade/test
+//~> dir: /Users/lukeed/oss/escalade
+//~> dir: /Users/lukeed/oss
+//~> dir: /Users/lukeed
+//~> dir: /Users
+//~> dir: /
+
+console.log(missing);
+//=> undefined
+```
+
+> **Note:** To run the above example with "sync" mode, import from `escalade/sync` and remove the `await` keyword.
+
+
+## API
+
+### escalade(input, callback)
+Returns: `string|void` or `Promise<string|void>`
+
+When your `callback` locates a file, `escalade` will resolve/return with an absolute path.<br>
+If your `callback` was never satisfied, then `escalade` will resolve/return with nothing (undefined).
+
+> **Important:**<br>The `sync` and `async` versions share the same API.<br>The **only** difference is that `sync` is not Promise-based.
+
+#### input
+Type: `string`
+
+The path from which to start ascending.
+
+This may be a file or a directory path.<br>However, when `input` is a file, `escalade` will begin with its parent directory.
+
+> **Important:** Unless given an absolute path, `input` will be resolved from `process.cwd()` location.
+
+#### callback
+Type: `Function`
+
+The callback to execute for each ancestry level. It always is given two arguments:
+
+1) `dir` - an absolute path of the current parent directory
+2) `names` - a list (`string[]`) of contents _relative to_ the `dir` parent
+
+> **Note:** The `names` list can contain names of files _and_ directories.
+
+When your callback returns a _falsey_ value, then `escalade` will continue with `dir`'s parent directory, re-invoking your callback with new argument values.
+
+When your callback returns a string, then `escalade` stops iteration immediately.<br>
+If the string is an absolute path, then it's left as is. Otherwise, the string is resolved into an absolute path _from_ the `dir` that housed the satisfying condition.
+
+> **Important:** Your `callback` can be a `Promise/AsyncFunction` when using the "async" version of `escalade`.
+
+## Benchmarks
+
+> Running on Node.js v10.13.0
+
+```
+# Load Time
+  find-up         3.891ms
+  escalade        0.485ms
+  escalade/sync   0.309ms
+
+# Levels: 6 (target = "foo.txt"):
+  find-up          x 24,856 ops/sec ±6.46% (55 runs sampled)
+  escalade         x 73,084 ops/sec ±4.23% (73 runs sampled)
+  find-up.sync     x  3,663 ops/sec ±1.12% (83 runs sampled)
+  escalade/sync    x  9,360 ops/sec ±0.62% (88 runs sampled)
+
+# Levels: 12 (target = "package.json"):
+  find-up          x 29,300 ops/sec ±10.68% (70 runs sampled)
+  escalade         x 73,685 ops/sec ± 5.66% (66 runs sampled)
+  find-up.sync     x  1,707 ops/sec ± 0.58% (91 runs sampled)
+  escalade/sync    x  4,667 ops/sec ± 0.68% (94 runs sampled)
+
+# Levels: 18 (target = "missing123.txt"):
+  find-up          x 21,818 ops/sec ±17.37% (14 runs sampled)
+  escalade         x 67,101 ops/sec ±21.60% (20 runs sampled)
+  find-up.sync     x  1,037 ops/sec ± 2.86% (88 runs sampled)
+  escalade/sync    x  1,248 ops/sec ± 0.50% (93 runs sampled)
+```
+
+## Deno
+
+As of v3.1.0, `escalade` is available on the Deno registry.
+
+Please note that the [API](#api) is identical and that there are still [two modes](#modes) from which to choose:
+
+```ts
+// Choose "async" mode
+import escalade from 'https://deno.land/escalade/async.ts';
+
+// Choose "sync" mode
+import escalade from 'https://deno.land/escalade/sync.ts';
+```
+
+> **Important:** The `allow-read` permission is required!
+
+
+## Related
+
+- [premove](https://github.com/lukeed/premove) - A tiny (247B) utility to remove items recursively
+- [totalist](https://github.com/lukeed/totalist) - A tiny (195B to 224B) utility to recursively list all (total) files in a directory
+- [mk-dirs](https://github.com/lukeed/mk-dirs) - A tiny (420B) utility to make a directory and its parents, recursively
+
+## License
+
+MIT © [Luke Edwards](https://lukeed.com)
diff --git a/node_modules/mathjs/examples/node_modules/escalade/sync/index.d.ts b/node_modules/mathjs/examples/node_modules/escalade/sync/index.d.ts
new file mode 100644
index 0000000..746ddd3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/sync/index.d.ts
@@ -0,0 +1,2 @@
+export type Callback = (directory: string, files: string[]) => string | false | void;
+export default function (directory: string, callback: Callback): string | void;
diff --git a/node_modules/mathjs/examples/node_modules/escalade/sync/index.js b/node_modules/mathjs/examples/node_modules/escalade/sync/index.js
new file mode 100644
index 0000000..902cc46
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/sync/index.js
@@ -0,0 +1,18 @@
+const { dirname, resolve } = require('path');
+const { readdirSync, statSync } = require('fs');
+
+module.exports = function (start, callback) {
+	let dir = resolve('.', start);
+	let tmp, stats = statSync(dir);
+
+	if (!stats.isDirectory()) {
+		dir = dirname(dir);
+	}
+
+	while (true) {
+		tmp = callback(dir, readdirSync(dir));
+		if (tmp) return resolve(dir, tmp);
+		dir = dirname(tmp = dir);
+		if (tmp === dir) break;
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/escalade/sync/index.mjs b/node_modules/mathjs/examples/node_modules/escalade/sync/index.mjs
new file mode 100644
index 0000000..3cdc5bd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/escalade/sync/index.mjs
@@ -0,0 +1,18 @@
+import { dirname, resolve } from 'path';
+import { readdirSync, statSync } from 'fs';
+
+export default function (start, callback) {
+	let dir = resolve('.', start);
+	let tmp, stats = statSync(dir);
+
+	if (!stats.isDirectory()) {
+		dir = dirname(dir);
+	}
+
+	while (true) {
+		tmp = callback(dir, readdirSync(dir));
+		if (tmp) return resolve(dir, tmp);
+		dir = dirname(tmp = dir);
+		if (tmp === dir) break;
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/eslint-scope/CHANGELOG.md
new file mode 100644
index 0000000..cc07de0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/CHANGELOG.md
@@ -0,0 +1,70 @@
+v5.1.1 - September 12, 2020
+
+* [`9b528d7`](https://github.com/eslint/eslint-scope/commit/9b528d778c381718c12dabfb7f1c0e0dc6b36e49) Upgrade: esrecurse version to ^4.3.0 (#64) (Timofey Kachalov)
+* [`f758bbc`](https://github.com/eslint/eslint-scope/commit/f758bbc3d49b9b9ea2289a5d6a6bba8dcf2c4903) Chore: fix definiton -> definition typo in comments (#63) (Kevin Kirsche)
+* [`7513734`](https://github.com/eslint/eslint-scope/commit/751373473375b3f2edc4eaf1c8d2763d8435bb72) Chore: move to GitHub Actions (#62) (Kai Cataldo)
+
+v5.1.0 - June 4, 2020
+
+* [`d4a3764`](https://github.com/eslint/eslint-scope/commit/d4a376434b16289c1a428d7e304576e997520873) Update: support new export syntax (#56) (Toru Nagashima)
+
+v5.0.0 - July 20, 2019
+
+* [`e9fa22e`](https://github.com/eslint/eslint-scope/commit/e9fa22ea412c26cf2761fa98af7e715644bdb464) Upgrade: update dependencies after dropping support for Node <8 (#53) (Kai Cataldo)
+* [`ee9f7c1`](https://github.com/eslint/eslint-scope/commit/ee9f7c12721aa195ba7e0e69551f49bfdb479951) Breaking: drop support for Node v6 (#54) (Kai Cataldo)
+
+v4.0.3 - March 15, 2019
+
+* [`299df64`](https://github.com/eslint/eslint-scope/commit/299df64bdafb30b4d9372e4b7af0cf51a3818c4a) Fix: arrow function scope strictness (take 2) (#52) (futpib)
+
+v4.0.2 - March 1, 2019
+
+* [`c925600`](https://github.com/eslint/eslint-scope/commit/c925600a684ae0f71b96f85339437a43b4d50d99) Revert "Fix: Arrow function scope strictness (fixes #49) (#50)" (#51) (Teddy Katz)
+
+v4.0.1 - March 1, 2019
+
+* [`2533966`](https://github.com/eslint/eslint-scope/commit/2533966faf317df5a3847fab937ba462c16808b8) Fix: Arrow function scope strictness (fixes #49) (#50) (futpib)
+* [`0cbeea5`](https://github.com/eslint/eslint-scope/commit/0cbeea51dfb66ab88ea34b0e3b4ad5e6cc210f2f) Chore: add supported Node.js versions to CI (#47) (Kai Cataldo)
+* [`b423057`](https://github.com/eslint/eslint-scope/commit/b42305760638b8edf4667acf1445e450869bd983) Upgrade: eslint-release@1.0.0 (#46) (Teddy Katz)
+
+v4.0.0 - June 21, 2018
+
+
+
+v4.0.0-rc.0 - June 9, 2018
+
+* 3b919b8 Build: Adding rc release script to package.json (#38) (Kevin Partington)
+* 137732a Chore: avoid creating package-lock.json files (#37) (Teddy Katz)
+
+v4.0.0-alpha.0 - April 27, 2018
+
+* 7cc3769 Upgrade: eslint-release ^0.11.1 (#36) (Teddy Katz)
+* c9f6967 Breaking: remove TDZScope (refs eslint/eslint#10245) (#35) (Toru Nagashima)
+* 982a71f Fix: wrong resolution about default parameters (#33) (Toru Nagashima)
+* 57889f1 Docs: Remove extra header line from LICENSE (#32) (Gyandeep Singh)
+
+v3.7.1 - April 12, 2017
+
+* ced6262 Fix: restore previous Scope API exports from escope (#31) (Vitor Balocco)
+* 5c3d966 Fix: Remove and Modify tests that contain invalid ES6 syntax (#29) (Reyad Attiyat)
+
+v3.7.0 - March 17, 2017
+
+* 9e27835 Chore: Add files section to package.json (#24) (Ilya Volodin)
+* 3e4d123 Upgrade: eslint-config-eslint to 4.0.0 (#21) (Teddy Katz)
+* 38c50fb Chore: Rename src to lib and test to tests (#20) (Corbin Uselton)
+* f4cd920 Chore: Remove esprima (#19) (Corbin Uselton)
+* f81fad5 Revert "Chore: Remove esprima" (#18) (James Henry)
+* 31b0085 Chore: Remove es6-map and es6-weakmap as they are included in node4 (#10) (#13) (Corbin Uselton)
+* 12a1ca1 Add Makefile.js and eslint (#15) (Reyad Attiyat)
+* 7d23f8e Chore: Remove es6-map and es6-weakmap as they are included in node4 (#10) (Corbin Uselton)
+* 019441e Chore: Convert to ES6 that is supported on Node 4, commonjs modules and remove Babel (#14) (Corbin Uselton)
+* c647f65 Update: Add check for node.body in referencer (#2) (Corbin Uselton)
+* eb5c9db Remove browserify and jsdoc (#12) (Corbin Uselton)
+* cf38df0 Chore: Update README.md (#3) (James Henry)
+* 8a142ca Chore: Add eslint-release scripts (#6) (James Henry)
+* e60d8cb Chore: Remove unused bower.json (#5) (James Henry)
+* 049c545 Chore: Fix tests for eslint-scope (#4) (James Henry)
+* f026aab Chore: Update package.json for eslint fork (#1) (James Henry)
+* a94d281 Chore: Update license with JSF copyright (Nicholas C. Zakas)
+
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/LICENSE b/node_modules/mathjs/examples/node_modules/eslint-scope/LICENSE
new file mode 100644
index 0000000..d36a526
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/LICENSE
@@ -0,0 +1,22 @@
+Copyright JS Foundation and other contributors, https://js.foundation
+Copyright (C) 2012-2013 Yusuke Suzuki (twitter: @Constellation) and other contributors.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/README.md b/node_modules/mathjs/examples/node_modules/eslint-scope/README.md
new file mode 100644
index 0000000..7e7ce0d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/README.md
@@ -0,0 +1,54 @@
+# ESLint Scope
+
+ESLint Scope is the [ECMAScript](http://www.ecma-international.org/publications/standards/Ecma-262.htm) scope analyzer used in ESLint. It is a fork of [escope](http://github.com/estools/escope).
+
+## Usage
+
+Install:
+
+```
+npm i eslint-scope --save
+```
+
+Example:
+
+```js
+var eslintScope = require('eslint-scope');
+var espree = require('espree');
+var estraverse = require('estraverse');
+
+var ast = espree.parse(code);
+var scopeManager = eslintScope.analyze(ast);
+
+var currentScope = scopeManager.acquire(ast);   // global scope
+
+estraverse.traverse(ast, {
+    enter: function(node, parent) {
+        // do stuff
+
+        if (/Function/.test(node.type)) {
+            currentScope = scopeManager.acquire(node);  // get current function scope
+        }
+    },
+    leave: function(node, parent) {
+        if (/Function/.test(node.type)) {
+            currentScope = currentScope.upper;  // set to parent scope
+        }
+
+        // do stuff
+    }
+});
+```
+
+## Contributing
+
+Issues and pull requests will be triaged and responded to as quickly as possible. We operate under the [ESLint Contributor Guidelines](http://eslint.org/docs/developer-guide/contributing), so please be sure to read them before contributing. If you're not sure where to dig in, check out the [issues](https://github.com/eslint/eslint-scope/issues).
+
+## Build Commands
+
+* `npm test` - run all linting and tests
+* `npm run lint` - run all linting
+
+## License
+
+ESLint Scope is licensed under a permissive BSD 2-clause license.
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/definition.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/definition.js
new file mode 100644
index 0000000..172bfe2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/definition.js
@@ -0,0 +1,86 @@
+/*
+  Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+"use strict";
+
+const Variable = require("./variable");
+
+/**
+ * @class Definition
+ */
+class Definition {
+    constructor(type, name, node, parent, index, kind) {
+
+        /**
+         * @member {String} Definition#type - type of the occurrence (e.g. "Parameter", "Variable", ...).
+         */
+        this.type = type;
+
+        /**
+         * @member {espree.Identifier} Definition#name - the identifier AST node of the occurrence.
+         */
+        this.name = name;
+
+        /**
+         * @member {espree.Node} Definition#node - the enclosing node of the identifier.
+         */
+        this.node = node;
+
+        /**
+         * @member {espree.Node?} Definition#parent - the enclosing statement node of the identifier.
+         */
+        this.parent = parent;
+
+        /**
+         * @member {Number?} Definition#index - the index in the declaration statement.
+         */
+        this.index = index;
+
+        /**
+         * @member {String?} Definition#kind - the kind of the declaration statement.
+         */
+        this.kind = kind;
+    }
+}
+
+/**
+ * @class ParameterDefinition
+ */
+class ParameterDefinition extends Definition {
+    constructor(name, node, index, rest) {
+        super(Variable.Parameter, name, node, null, index, null);
+
+        /**
+         * Whether the parameter definition is a part of a rest parameter.
+         * @member {boolean} ParameterDefinition#rest
+         */
+        this.rest = rest;
+    }
+}
+
+module.exports = {
+    ParameterDefinition,
+    Definition
+};
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/index.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/index.js
new file mode 100644
index 0000000..0f16fa4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/index.js
@@ -0,0 +1,165 @@
+/*
+  Copyright (C) 2012-2014 Yusuke Suzuki <utatane.tea@gmail.com>
+  Copyright (C) 2013 Alex Seville <hi@alexanderseville.com>
+  Copyright (C) 2014 Thiago de Arruda <tpadilha84@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+/**
+ * Escope (<a href="http://github.com/estools/escope">escope</a>) is an <a
+ * href="http://www.ecma-international.org/publications/standards/Ecma-262.htm">ECMAScript</a>
+ * scope analyzer extracted from the <a
+ * href="http://github.com/estools/esmangle">esmangle project</a/>.
+ * <p>
+ * <em>escope</em> finds lexical scopes in a source program, i.e. areas of that
+ * program where different occurrences of the same identifier refer to the same
+ * variable. With each scope the contained variables are collected, and each
+ * identifier reference in code is linked to its corresponding variable (if
+ * possible).
+ * <p>
+ * <em>escope</em> works on a syntax tree of the parsed source code which has
+ * to adhere to the <a
+ * href="https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API">
+ * Mozilla Parser API</a>. E.g. <a href="https://github.com/eslint/espree">espree</a> is a parser
+ * that produces such syntax trees.
+ * <p>
+ * The main interface is the {@link analyze} function.
+ * @module escope
+ */
+"use strict";
+
+/* eslint no-underscore-dangle: ["error", { "allow": ["__currentScope"] }] */
+
+const assert = require("assert");
+
+const ScopeManager = require("./scope-manager");
+const Referencer = require("./referencer");
+const Reference = require("./reference");
+const Variable = require("./variable");
+const Scope = require("./scope").Scope;
+const version = require("../package.json").version;
+
+/**
+ * Set the default options
+ * @returns {Object} options
+ */
+function defaultOptions() {
+    return {
+        optimistic: false,
+        directive: false,
+        nodejsScope: false,
+        impliedStrict: false,
+        sourceType: "script", // one of ['script', 'module']
+        ecmaVersion: 5,
+        childVisitorKeys: null,
+        fallback: "iteration"
+    };
+}
+
+/**
+ * Preform deep update on option object
+ * @param {Object} target - Options
+ * @param {Object} override - Updates
+ * @returns {Object} Updated options
+ */
+function updateDeeply(target, override) {
+
+    /**
+     * Is hash object
+     * @param {Object} value - Test value
+     * @returns {boolean} Result
+     */
+    function isHashObject(value) {
+        return typeof value === "object" && value instanceof Object && !(value instanceof Array) && !(value instanceof RegExp);
+    }
+
+    for (const key in override) {
+        if (Object.prototype.hasOwnProperty.call(override, key)) {
+            const val = override[key];
+
+            if (isHashObject(val)) {
+                if (isHashObject(target[key])) {
+                    updateDeeply(target[key], val);
+                } else {
+                    target[key] = updateDeeply({}, val);
+                }
+            } else {
+                target[key] = val;
+            }
+        }
+    }
+    return target;
+}
+
+/**
+ * Main interface function. Takes an Espree syntax tree and returns the
+ * analyzed scopes.
+ * @function analyze
+ * @param {espree.Tree} tree - Abstract Syntax Tree
+ * @param {Object} providedOptions - Options that tailor the scope analysis
+ * @param {boolean} [providedOptions.optimistic=false] - the optimistic flag
+ * @param {boolean} [providedOptions.directive=false]- the directive flag
+ * @param {boolean} [providedOptions.ignoreEval=false]- whether to check 'eval()' calls
+ * @param {boolean} [providedOptions.nodejsScope=false]- whether the whole
+ * script is executed under node.js environment. When enabled, escope adds
+ * a function scope immediately following the global scope.
+ * @param {boolean} [providedOptions.impliedStrict=false]- implied strict mode
+ * (if ecmaVersion >= 5).
+ * @param {string} [providedOptions.sourceType='script']- the source type of the script. one of 'script' and 'module'
+ * @param {number} [providedOptions.ecmaVersion=5]- which ECMAScript version is considered
+ * @param {Object} [providedOptions.childVisitorKeys=null] - Additional known visitor keys. See [esrecurse](https://github.com/estools/esrecurse)'s the `childVisitorKeys` option.
+ * @param {string} [providedOptions.fallback='iteration'] - A kind of the fallback in order to encounter with unknown node. See [esrecurse](https://github.com/estools/esrecurse)'s the `fallback` option.
+ * @returns {ScopeManager} ScopeManager
+ */
+function analyze(tree, providedOptions) {
+    const options = updateDeeply(defaultOptions(), providedOptions);
+    const scopeManager = new ScopeManager(options);
+    const referencer = new Referencer(options, scopeManager);
+
+    referencer.visit(tree);
+
+    assert(scopeManager.__currentScope === null, "currentScope should be null.");
+
+    return scopeManager;
+}
+
+module.exports = {
+
+    /** @name module:escope.version */
+    version,
+
+    /** @name module:escope.Reference */
+    Reference,
+
+    /** @name module:escope.Variable */
+    Variable,
+
+    /** @name module:escope.Scope */
+    Scope,
+
+    /** @name module:escope.ScopeManager */
+    ScopeManager,
+    analyze
+};
+
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/pattern-visitor.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/pattern-visitor.js
new file mode 100644
index 0000000..afa6291
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/pattern-visitor.js
@@ -0,0 +1,152 @@
+/*
+  Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+"use strict";
+
+/* eslint-disable no-undefined */
+
+const Syntax = require("estraverse").Syntax;
+const esrecurse = require("esrecurse");
+
+/**
+ * Get last array element
+ * @param {array} xs - array
+ * @returns {any} Last elment
+ */
+function getLast(xs) {
+    return xs[xs.length - 1] || null;
+}
+
+class PatternVisitor extends esrecurse.Visitor {
+    static isPattern(node) {
+        const nodeType = node.type;
+
+        return (
+            nodeType === Syntax.Identifier ||
+            nodeType === Syntax.ObjectPattern ||
+            nodeType === Syntax.ArrayPattern ||
+            nodeType === Syntax.SpreadElement ||
+            nodeType === Syntax.RestElement ||
+            nodeType === Syntax.AssignmentPattern
+        );
+    }
+
+    constructor(options, rootPattern, callback) {
+        super(null, options);
+        this.rootPattern = rootPattern;
+        this.callback = callback;
+        this.assignments = [];
+        this.rightHandNodes = [];
+        this.restElements = [];
+    }
+
+    Identifier(pattern) {
+        const lastRestElement = getLast(this.restElements);
+
+        this.callback(pattern, {
+            topLevel: pattern === this.rootPattern,
+            rest: lastRestElement !== null && lastRestElement !== undefined && lastRestElement.argument === pattern,
+            assignments: this.assignments
+        });
+    }
+
+    Property(property) {
+
+        // Computed property's key is a right hand node.
+        if (property.computed) {
+            this.rightHandNodes.push(property.key);
+        }
+
+        // If it's shorthand, its key is same as its value.
+        // If it's shorthand and has its default value, its key is same as its value.left (the value is AssignmentPattern).
+        // If it's not shorthand, the name of new variable is its value's.
+        this.visit(property.value);
+    }
+
+    ArrayPattern(pattern) {
+        for (let i = 0, iz = pattern.elements.length; i < iz; ++i) {
+            const element = pattern.elements[i];
+
+            this.visit(element);
+        }
+    }
+
+    AssignmentPattern(pattern) {
+        this.assignments.push(pattern);
+        this.visit(pattern.left);
+        this.rightHandNodes.push(pattern.right);
+        this.assignments.pop();
+    }
+
+    RestElement(pattern) {
+        this.restElements.push(pattern);
+        this.visit(pattern.argument);
+        this.restElements.pop();
+    }
+
+    MemberExpression(node) {
+
+        // Computed property's key is a right hand node.
+        if (node.computed) {
+            this.rightHandNodes.push(node.property);
+        }
+
+        // the object is only read, write to its property.
+        this.rightHandNodes.push(node.object);
+    }
+
+    //
+    // ForInStatement.left and AssignmentExpression.left are LeftHandSideExpression.
+    // By spec, LeftHandSideExpression is Pattern or MemberExpression.
+    //   (see also: https://github.com/estree/estree/pull/20#issuecomment-74584758)
+    // But espree 2.0 parses to ArrayExpression, ObjectExpression, etc...
+    //
+
+    SpreadElement(node) {
+        this.visit(node.argument);
+    }
+
+    ArrayExpression(node) {
+        node.elements.forEach(this.visit, this);
+    }
+
+    AssignmentExpression(node) {
+        this.assignments.push(node);
+        this.visit(node.left);
+        this.rightHandNodes.push(node.right);
+        this.assignments.pop();
+    }
+
+    CallExpression(node) {
+
+        // arguments are right hand nodes.
+        node.arguments.forEach(a => {
+            this.rightHandNodes.push(a);
+        });
+        this.visit(node.callee);
+    }
+}
+
+module.exports = PatternVisitor;
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/reference.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/reference.js
new file mode 100644
index 0000000..9529827
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/reference.js
@@ -0,0 +1,167 @@
+/*
+  Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+"use strict";
+
+const READ = 0x1;
+const WRITE = 0x2;
+const RW = READ | WRITE;
+
+/**
+ * A Reference represents a single occurrence of an identifier in code.
+ * @class Reference
+ */
+class Reference {
+    constructor(ident, scope, flag, writeExpr, maybeImplicitGlobal, partial, init) {
+
+        /**
+         * Identifier syntax node.
+         * @member {espreeIdentifier} Reference#identifier
+         */
+        this.identifier = ident;
+
+        /**
+         * Reference to the enclosing Scope.
+         * @member {Scope} Reference#from
+         */
+        this.from = scope;
+
+        /**
+         * Whether the reference comes from a dynamic scope (such as 'eval',
+         * 'with', etc.), and may be trapped by dynamic scopes.
+         * @member {boolean} Reference#tainted
+         */
+        this.tainted = false;
+
+        /**
+         * The variable this reference is resolved with.
+         * @member {Variable} Reference#resolved
+         */
+        this.resolved = null;
+
+        /**
+         * The read-write mode of the reference. (Value is one of {@link
+         * Reference.READ}, {@link Reference.RW}, {@link Reference.WRITE}).
+         * @member {number} Reference#flag
+         * @private
+         */
+        this.flag = flag;
+        if (this.isWrite()) {
+
+            /**
+             * If reference is writeable, this is the tree being written to it.
+             * @member {espreeNode} Reference#writeExpr
+             */
+            this.writeExpr = writeExpr;
+
+            /**
+             * Whether the Reference might refer to a partial value of writeExpr.
+             * @member {boolean} Reference#partial
+             */
+            this.partial = partial;
+
+            /**
+             * Whether the Reference is to write of initialization.
+             * @member {boolean} Reference#init
+             */
+            this.init = init;
+        }
+        this.__maybeImplicitGlobal = maybeImplicitGlobal;
+    }
+
+    /**
+     * Whether the reference is static.
+     * @method Reference#isStatic
+     * @returns {boolean} static
+     */
+    isStatic() {
+        return !this.tainted && this.resolved && this.resolved.scope.isStatic();
+    }
+
+    /**
+     * Whether the reference is writeable.
+     * @method Reference#isWrite
+     * @returns {boolean} write
+     */
+    isWrite() {
+        return !!(this.flag & Reference.WRITE);
+    }
+
+    /**
+     * Whether the reference is readable.
+     * @method Reference#isRead
+     * @returns {boolean} read
+     */
+    isRead() {
+        return !!(this.flag & Reference.READ);
+    }
+
+    /**
+     * Whether the reference is read-only.
+     * @method Reference#isReadOnly
+     * @returns {boolean} read only
+     */
+    isReadOnly() {
+        return this.flag === Reference.READ;
+    }
+
+    /**
+     * Whether the reference is write-only.
+     * @method Reference#isWriteOnly
+     * @returns {boolean} write only
+     */
+    isWriteOnly() {
+        return this.flag === Reference.WRITE;
+    }
+
+    /**
+     * Whether the reference is read-write.
+     * @method Reference#isReadWrite
+     * @returns {boolean} read write
+     */
+    isReadWrite() {
+        return this.flag === Reference.RW;
+    }
+}
+
+/**
+ * @constant Reference.READ
+ * @private
+ */
+Reference.READ = READ;
+
+/**
+ * @constant Reference.WRITE
+ * @private
+ */
+Reference.WRITE = WRITE;
+
+/**
+ * @constant Reference.RW
+ * @private
+ */
+Reference.RW = RW;
+
+module.exports = Reference;
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/referencer.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/referencer.js
new file mode 100644
index 0000000..63d1935
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/referencer.js
@@ -0,0 +1,629 @@
+/*
+  Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+"use strict";
+
+/* eslint-disable no-underscore-dangle */
+/* eslint-disable no-undefined */
+
+const Syntax = require("estraverse").Syntax;
+const esrecurse = require("esrecurse");
+const Reference = require("./reference");
+const Variable = require("./variable");
+const PatternVisitor = require("./pattern-visitor");
+const definition = require("./definition");
+const assert = require("assert");
+
+const ParameterDefinition = definition.ParameterDefinition;
+const Definition = definition.Definition;
+
+/**
+ * Traverse identifier in pattern
+ * @param {Object} options - options
+ * @param {pattern} rootPattern - root pattern
+ * @param {Refencer} referencer - referencer
+ * @param {callback} callback - callback
+ * @returns {void}
+ */
+function traverseIdentifierInPattern(options, rootPattern, referencer, callback) {
+
+    // Call the callback at left hand identifier nodes, and Collect right hand nodes.
+    const visitor = new PatternVisitor(options, rootPattern, callback);
+
+    visitor.visit(rootPattern);
+
+    // Process the right hand nodes recursively.
+    if (referencer !== null && referencer !== undefined) {
+        visitor.rightHandNodes.forEach(referencer.visit, referencer);
+    }
+}
+
+// Importing ImportDeclaration.
+// http://people.mozilla.org/~jorendorff/es6-draft.html#sec-moduledeclarationinstantiation
+// https://github.com/estree/estree/blob/master/es6.md#importdeclaration
+// FIXME: Now, we don't create module environment, because the context is
+// implementation dependent.
+
+class Importer extends esrecurse.Visitor {
+    constructor(declaration, referencer) {
+        super(null, referencer.options);
+        this.declaration = declaration;
+        this.referencer = referencer;
+    }
+
+    visitImport(id, specifier) {
+        this.referencer.visitPattern(id, pattern => {
+            this.referencer.currentScope().__define(pattern,
+                new Definition(
+                    Variable.ImportBinding,
+                    pattern,
+                    specifier,
+                    this.declaration,
+                    null,
+                    null
+                ));
+        });
+    }
+
+    ImportNamespaceSpecifier(node) {
+        const local = (node.local || node.id);
+
+        if (local) {
+            this.visitImport(local, node);
+        }
+    }
+
+    ImportDefaultSpecifier(node) {
+        const local = (node.local || node.id);
+
+        this.visitImport(local, node);
+    }
+
+    ImportSpecifier(node) {
+        const local = (node.local || node.id);
+
+        if (node.name) {
+            this.visitImport(node.name, node);
+        } else {
+            this.visitImport(local, node);
+        }
+    }
+}
+
+// Referencing variables and creating bindings.
+class Referencer extends esrecurse.Visitor {
+    constructor(options, scopeManager) {
+        super(null, options);
+        this.options = options;
+        this.scopeManager = scopeManager;
+        this.parent = null;
+        this.isInnerMethodDefinition = false;
+    }
+
+    currentScope() {
+        return this.scopeManager.__currentScope;
+    }
+
+    close(node) {
+        while (this.currentScope() && node === this.currentScope().block) {
+            this.scopeManager.__currentScope = this.currentScope().__close(this.scopeManager);
+        }
+    }
+
+    pushInnerMethodDefinition(isInnerMethodDefinition) {
+        const previous = this.isInnerMethodDefinition;
+
+        this.isInnerMethodDefinition = isInnerMethodDefinition;
+        return previous;
+    }
+
+    popInnerMethodDefinition(isInnerMethodDefinition) {
+        this.isInnerMethodDefinition = isInnerMethodDefinition;
+    }
+
+    referencingDefaultValue(pattern, assignments, maybeImplicitGlobal, init) {
+        const scope = this.currentScope();
+
+        assignments.forEach(assignment => {
+            scope.__referencing(
+                pattern,
+                Reference.WRITE,
+                assignment.right,
+                maybeImplicitGlobal,
+                pattern !== assignment.left,
+                init
+            );
+        });
+    }
+
+    visitPattern(node, options, callback) {
+        let visitPatternOptions = options;
+        let visitPatternCallback = callback;
+
+        if (typeof options === "function") {
+            visitPatternCallback = options;
+            visitPatternOptions = { processRightHandNodes: false };
+        }
+
+        traverseIdentifierInPattern(
+            this.options,
+            node,
+            visitPatternOptions.processRightHandNodes ? this : null,
+            visitPatternCallback
+        );
+    }
+
+    visitFunction(node) {
+        let i, iz;
+
+        // FunctionDeclaration name is defined in upper scope
+        // NOTE: Not referring variableScope. It is intended.
+        // Since
+        //  in ES5, FunctionDeclaration should be in FunctionBody.
+        //  in ES6, FunctionDeclaration should be block scoped.
+
+        if (node.type === Syntax.FunctionDeclaration) {
+
+            // id is defined in upper scope
+            this.currentScope().__define(node.id,
+                new Definition(
+                    Variable.FunctionName,
+                    node.id,
+                    node,
+                    null,
+                    null,
+                    null
+                ));
+        }
+
+        // FunctionExpression with name creates its special scope;
+        // FunctionExpressionNameScope.
+        if (node.type === Syntax.FunctionExpression && node.id) {
+            this.scopeManager.__nestFunctionExpressionNameScope(node);
+        }
+
+        // Consider this function is in the MethodDefinition.
+        this.scopeManager.__nestFunctionScope(node, this.isInnerMethodDefinition);
+
+        const that = this;
+
+        /**
+         * Visit pattern callback
+         * @param {pattern} pattern - pattern
+         * @param {Object} info - info
+         * @returns {void}
+         */
+        function visitPatternCallback(pattern, info) {
+            that.currentScope().__define(pattern,
+                new ParameterDefinition(
+                    pattern,
+                    node,
+                    i,
+                    info.rest
+                ));
+
+            that.referencingDefaultValue(pattern, info.assignments, null, true);
+        }
+
+        // Process parameter declarations.
+        for (i = 0, iz = node.params.length; i < iz; ++i) {
+            this.visitPattern(node.params[i], { processRightHandNodes: true }, visitPatternCallback);
+        }
+
+        // if there's a rest argument, add that
+        if (node.rest) {
+            this.visitPattern({
+                type: "RestElement",
+                argument: node.rest
+            }, pattern => {
+                this.currentScope().__define(pattern,
+                    new ParameterDefinition(
+                        pattern,
+                        node,
+                        node.params.length,
+                        true
+                    ));
+            });
+        }
+
+        // In TypeScript there are a number of function-like constructs which have no body,
+        // so check it exists before traversing
+        if (node.body) {
+
+            // Skip BlockStatement to prevent creating BlockStatement scope.
+            if (node.body.type === Syntax.BlockStatement) {
+                this.visitChildren(node.body);
+            } else {
+                this.visit(node.body);
+            }
+        }
+
+        this.close(node);
+    }
+
+    visitClass(node) {
+        if (node.type === Syntax.ClassDeclaration) {
+            this.currentScope().__define(node.id,
+                new Definition(
+                    Variable.ClassName,
+                    node.id,
+                    node,
+                    null,
+                    null,
+                    null
+                ));
+        }
+
+        this.visit(node.superClass);
+
+        this.scopeManager.__nestClassScope(node);
+
+        if (node.id) {
+            this.currentScope().__define(node.id,
+                new Definition(
+                    Variable.ClassName,
+                    node.id,
+                    node
+                ));
+        }
+        this.visit(node.body);
+
+        this.close(node);
+    }
+
+    visitProperty(node) {
+        let previous;
+
+        if (node.computed) {
+            this.visit(node.key);
+        }
+
+        const isMethodDefinition = node.type === Syntax.MethodDefinition;
+
+        if (isMethodDefinition) {
+            previous = this.pushInnerMethodDefinition(true);
+        }
+        this.visit(node.value);
+        if (isMethodDefinition) {
+            this.popInnerMethodDefinition(previous);
+        }
+    }
+
+    visitForIn(node) {
+        if (node.left.type === Syntax.VariableDeclaration && node.left.kind !== "var") {
+            this.scopeManager.__nestForScope(node);
+        }
+
+        if (node.left.type === Syntax.VariableDeclaration) {
+            this.visit(node.left);
+            this.visitPattern(node.left.declarations[0].id, pattern => {
+                this.currentScope().__referencing(pattern, Reference.WRITE, node.right, null, true, true);
+            });
+        } else {
+            this.visitPattern(node.left, { processRightHandNodes: true }, (pattern, info) => {
+                let maybeImplicitGlobal = null;
+
+                if (!this.currentScope().isStrict) {
+                    maybeImplicitGlobal = {
+                        pattern,
+                        node
+                    };
+                }
+                this.referencingDefaultValue(pattern, info.assignments, maybeImplicitGlobal, false);
+                this.currentScope().__referencing(pattern, Reference.WRITE, node.right, maybeImplicitGlobal, true, false);
+            });
+        }
+        this.visit(node.right);
+        this.visit(node.body);
+
+        this.close(node);
+    }
+
+    visitVariableDeclaration(variableTargetScope, type, node, index) {
+
+        const decl = node.declarations[index];
+        const init = decl.init;
+
+        this.visitPattern(decl.id, { processRightHandNodes: true }, (pattern, info) => {
+            variableTargetScope.__define(
+                pattern,
+                new Definition(
+                    type,
+                    pattern,
+                    decl,
+                    node,
+                    index,
+                    node.kind
+                )
+            );
+
+            this.referencingDefaultValue(pattern, info.assignments, null, true);
+            if (init) {
+                this.currentScope().__referencing(pattern, Reference.WRITE, init, null, !info.topLevel, true);
+            }
+        });
+    }
+
+    AssignmentExpression(node) {
+        if (PatternVisitor.isPattern(node.left)) {
+            if (node.operator === "=") {
+                this.visitPattern(node.left, { processRightHandNodes: true }, (pattern, info) => {
+                    let maybeImplicitGlobal = null;
+
+                    if (!this.currentScope().isStrict) {
+                        maybeImplicitGlobal = {
+                            pattern,
+                            node
+                        };
+                    }
+                    this.referencingDefaultValue(pattern, info.assignments, maybeImplicitGlobal, false);
+                    this.currentScope().__referencing(pattern, Reference.WRITE, node.right, maybeImplicitGlobal, !info.topLevel, false);
+                });
+            } else {
+                this.currentScope().__referencing(node.left, Reference.RW, node.right);
+            }
+        } else {
+            this.visit(node.left);
+        }
+        this.visit(node.right);
+    }
+
+    CatchClause(node) {
+        this.scopeManager.__nestCatchScope(node);
+
+        this.visitPattern(node.param, { processRightHandNodes: true }, (pattern, info) => {
+            this.currentScope().__define(pattern,
+                new Definition(
+                    Variable.CatchClause,
+                    node.param,
+                    node,
+                    null,
+                    null,
+                    null
+                ));
+            this.referencingDefaultValue(pattern, info.assignments, null, true);
+        });
+        this.visit(node.body);
+
+        this.close(node);
+    }
+
+    Program(node) {
+        this.scopeManager.__nestGlobalScope(node);
+
+        if (this.scopeManager.__isNodejsScope()) {
+
+            // Force strictness of GlobalScope to false when using node.js scope.
+            this.currentScope().isStrict = false;
+            this.scopeManager.__nestFunctionScope(node, false);
+        }
+
+        if (this.scopeManager.__isES6() && this.scopeManager.isModule()) {
+            this.scopeManager.__nestModuleScope(node);
+        }
+
+        if (this.scopeManager.isStrictModeSupported() && this.scopeManager.isImpliedStrict()) {
+            this.currentScope().isStrict = true;
+        }
+
+        this.visitChildren(node);
+        this.close(node);
+    }
+
+    Identifier(node) {
+        this.currentScope().__referencing(node);
+    }
+
+    UpdateExpression(node) {
+        if (PatternVisitor.isPattern(node.argument)) {
+            this.currentScope().__referencing(node.argument, Reference.RW, null);
+        } else {
+            this.visitChildren(node);
+        }
+    }
+
+    MemberExpression(node) {
+        this.visit(node.object);
+        if (node.computed) {
+            this.visit(node.property);
+        }
+    }
+
+    Property(node) {
+        this.visitProperty(node);
+    }
+
+    MethodDefinition(node) {
+        this.visitProperty(node);
+    }
+
+    BreakStatement() {} // eslint-disable-line class-methods-use-this
+
+    ContinueStatement() {} // eslint-disable-line class-methods-use-this
+
+    LabeledStatement(node) {
+        this.visit(node.body);
+    }
+
+    ForStatement(node) {
+
+        // Create ForStatement declaration.
+        // NOTE: In ES6, ForStatement dynamically generates
+        // per iteration environment. However, escope is
+        // a static analyzer, we only generate one scope for ForStatement.
+        if (node.init && node.init.type === Syntax.VariableDeclaration && node.init.kind !== "var") {
+            this.scopeManager.__nestForScope(node);
+        }
+
+        this.visitChildren(node);
+
+        this.close(node);
+    }
+
+    ClassExpression(node) {
+        this.visitClass(node);
+    }
+
+    ClassDeclaration(node) {
+        this.visitClass(node);
+    }
+
+    CallExpression(node) {
+
+        // Check this is direct call to eval
+        if (!this.scopeManager.__ignoreEval() && node.callee.type === Syntax.Identifier && node.callee.name === "eval") {
+
+            // NOTE: This should be `variableScope`. Since direct eval call always creates Lexical environment and
+            // let / const should be enclosed into it. Only VariableDeclaration affects on the caller's environment.
+            this.currentScope().variableScope.__detectEval();
+        }
+        this.visitChildren(node);
+    }
+
+    BlockStatement(node) {
+        if (this.scopeManager.__isES6()) {
+            this.scopeManager.__nestBlockScope(node);
+        }
+
+        this.visitChildren(node);
+
+        this.close(node);
+    }
+
+    ThisExpression() {
+        this.currentScope().variableScope.__detectThis();
+    }
+
+    WithStatement(node) {
+        this.visit(node.object);
+
+        // Then nest scope for WithStatement.
+        this.scopeManager.__nestWithScope(node);
+
+        this.visit(node.body);
+
+        this.close(node);
+    }
+
+    VariableDeclaration(node) {
+        const variableTargetScope = (node.kind === "var") ? this.currentScope().variableScope : this.currentScope();
+
+        for (let i = 0, iz = node.declarations.length; i < iz; ++i) {
+            const decl = node.declarations[i];
+
+            this.visitVariableDeclaration(variableTargetScope, Variable.Variable, node, i);
+            if (decl.init) {
+                this.visit(decl.init);
+            }
+        }
+    }
+
+    // sec 13.11.8
+    SwitchStatement(node) {
+        this.visit(node.discriminant);
+
+        if (this.scopeManager.__isES6()) {
+            this.scopeManager.__nestSwitchScope(node);
+        }
+
+        for (let i = 0, iz = node.cases.length; i < iz; ++i) {
+            this.visit(node.cases[i]);
+        }
+
+        this.close(node);
+    }
+
+    FunctionDeclaration(node) {
+        this.visitFunction(node);
+    }
+
+    FunctionExpression(node) {
+        this.visitFunction(node);
+    }
+
+    ForOfStatement(node) {
+        this.visitForIn(node);
+    }
+
+    ForInStatement(node) {
+        this.visitForIn(node);
+    }
+
+    ArrowFunctionExpression(node) {
+        this.visitFunction(node);
+    }
+
+    ImportDeclaration(node) {
+        assert(this.scopeManager.__isES6() && this.scopeManager.isModule(), "ImportDeclaration should appear when the mode is ES6 and in the module context.");
+
+        const importer = new Importer(node, this);
+
+        importer.visit(node);
+    }
+
+    visitExportDeclaration(node) {
+        if (node.source) {
+            return;
+        }
+        if (node.declaration) {
+            this.visit(node.declaration);
+            return;
+        }
+
+        this.visitChildren(node);
+    }
+
+    // TODO: ExportDeclaration doesn't exist. for bc?
+    ExportDeclaration(node) {
+        this.visitExportDeclaration(node);
+    }
+
+    ExportAllDeclaration(node) {
+        this.visitExportDeclaration(node);
+    }
+
+    ExportDefaultDeclaration(node) {
+        this.visitExportDeclaration(node);
+    }
+
+    ExportNamedDeclaration(node) {
+        this.visitExportDeclaration(node);
+    }
+
+    ExportSpecifier(node) {
+
+        // TODO: `node.id` doesn't exist. for bc?
+        const local = (node.id || node.local);
+
+        this.visit(local);
+    }
+
+    MetaProperty() { // eslint-disable-line class-methods-use-this
+
+        // do nothing.
+    }
+}
+
+module.exports = Referencer;
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/scope-manager.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/scope-manager.js
new file mode 100644
index 0000000..c192799
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/scope-manager.js
@@ -0,0 +1,247 @@
+/*
+  Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+"use strict";
+
+/* eslint-disable no-underscore-dangle */
+
+const Scope = require("./scope");
+const assert = require("assert");
+
+const GlobalScope = Scope.GlobalScope;
+const CatchScope = Scope.CatchScope;
+const WithScope = Scope.WithScope;
+const ModuleScope = Scope.ModuleScope;
+const ClassScope = Scope.ClassScope;
+const SwitchScope = Scope.SwitchScope;
+const FunctionScope = Scope.FunctionScope;
+const ForScope = Scope.ForScope;
+const FunctionExpressionNameScope = Scope.FunctionExpressionNameScope;
+const BlockScope = Scope.BlockScope;
+
+/**
+ * @class ScopeManager
+ */
+class ScopeManager {
+    constructor(options) {
+        this.scopes = [];
+        this.globalScope = null;
+        this.__nodeToScope = new WeakMap();
+        this.__currentScope = null;
+        this.__options = options;
+        this.__declaredVariables = new WeakMap();
+    }
+
+    __useDirective() {
+        return this.__options.directive;
+    }
+
+    __isOptimistic() {
+        return this.__options.optimistic;
+    }
+
+    __ignoreEval() {
+        return this.__options.ignoreEval;
+    }
+
+    __isNodejsScope() {
+        return this.__options.nodejsScope;
+    }
+
+    isModule() {
+        return this.__options.sourceType === "module";
+    }
+
+    isImpliedStrict() {
+        return this.__options.impliedStrict;
+    }
+
+    isStrictModeSupported() {
+        return this.__options.ecmaVersion >= 5;
+    }
+
+    // Returns appropriate scope for this node.
+    __get(node) {
+        return this.__nodeToScope.get(node);
+    }
+
+    /**
+     * Get variables that are declared by the node.
+     *
+     * "are declared by the node" means the node is same as `Variable.defs[].node` or `Variable.defs[].parent`.
+     * If the node declares nothing, this method returns an empty array.
+     * CAUTION: This API is experimental. See https://github.com/estools/escope/pull/69 for more details.
+     *
+     * @param {Espree.Node} node - a node to get.
+     * @returns {Variable[]} variables that declared by the node.
+     */
+    getDeclaredVariables(node) {
+        return this.__declaredVariables.get(node) || [];
+    }
+
+    /**
+     * acquire scope from node.
+     * @method ScopeManager#acquire
+     * @param {Espree.Node} node - node for the acquired scope.
+     * @param {boolean=} inner - look up the most inner scope, default value is false.
+     * @returns {Scope?} Scope from node
+     */
+    acquire(node, inner) {
+
+        /**
+         * predicate
+         * @param {Scope} testScope - scope to test
+         * @returns {boolean} predicate
+         */
+        function predicate(testScope) {
+            if (testScope.type === "function" && testScope.functionExpressionScope) {
+                return false;
+            }
+            return true;
+        }
+
+        const scopes = this.__get(node);
+
+        if (!scopes || scopes.length === 0) {
+            return null;
+        }
+
+        // Heuristic selection from all scopes.
+        // If you would like to get all scopes, please use ScopeManager#acquireAll.
+        if (scopes.length === 1) {
+            return scopes[0];
+        }
+
+        if (inner) {
+            for (let i = scopes.length - 1; i >= 0; --i) {
+                const scope = scopes[i];
+
+                if (predicate(scope)) {
+                    return scope;
+                }
+            }
+        } else {
+            for (let i = 0, iz = scopes.length; i < iz; ++i) {
+                const scope = scopes[i];
+
+                if (predicate(scope)) {
+                    return scope;
+                }
+            }
+        }
+
+        return null;
+    }
+
+    /**
+     * acquire all scopes from node.
+     * @method ScopeManager#acquireAll
+     * @param {Espree.Node} node - node for the acquired scope.
+     * @returns {Scopes?} Scope array
+     */
+    acquireAll(node) {
+        return this.__get(node);
+    }
+
+    /**
+     * release the node.
+     * @method ScopeManager#release
+     * @param {Espree.Node} node - releasing node.
+     * @param {boolean=} inner - look up the most inner scope, default value is false.
+     * @returns {Scope?} upper scope for the node.
+     */
+    release(node, inner) {
+        const scopes = this.__get(node);
+
+        if (scopes && scopes.length) {
+            const scope = scopes[0].upper;
+
+            if (!scope) {
+                return null;
+            }
+            return this.acquire(scope.block, inner);
+        }
+        return null;
+    }
+
+    attach() { } // eslint-disable-line class-methods-use-this
+
+    detach() { } // eslint-disable-line class-methods-use-this
+
+    __nestScope(scope) {
+        if (scope instanceof GlobalScope) {
+            assert(this.__currentScope === null);
+            this.globalScope = scope;
+        }
+        this.__currentScope = scope;
+        return scope;
+    }
+
+    __nestGlobalScope(node) {
+        return this.__nestScope(new GlobalScope(this, node));
+    }
+
+    __nestBlockScope(node) {
+        return this.__nestScope(new BlockScope(this, this.__currentScope, node));
+    }
+
+    __nestFunctionScope(node, isMethodDefinition) {
+        return this.__nestScope(new FunctionScope(this, this.__currentScope, node, isMethodDefinition));
+    }
+
+    __nestForScope(node) {
+        return this.__nestScope(new ForScope(this, this.__currentScope, node));
+    }
+
+    __nestCatchScope(node) {
+        return this.__nestScope(new CatchScope(this, this.__currentScope, node));
+    }
+
+    __nestWithScope(node) {
+        return this.__nestScope(new WithScope(this, this.__currentScope, node));
+    }
+
+    __nestClassScope(node) {
+        return this.__nestScope(new ClassScope(this, this.__currentScope, node));
+    }
+
+    __nestSwitchScope(node) {
+        return this.__nestScope(new SwitchScope(this, this.__currentScope, node));
+    }
+
+    __nestModuleScope(node) {
+        return this.__nestScope(new ModuleScope(this, this.__currentScope, node));
+    }
+
+    __nestFunctionExpressionNameScope(node) {
+        return this.__nestScope(new FunctionExpressionNameScope(this, this.__currentScope, node));
+    }
+
+    __isES6() {
+        return this.__options.ecmaVersion >= 6;
+    }
+}
+
+module.exports = ScopeManager;
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/scope.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/scope.js
new file mode 100644
index 0000000..bdb5f63
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/scope.js
@@ -0,0 +1,748 @@
+/*
+  Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+"use strict";
+
+/* eslint-disable no-underscore-dangle */
+/* eslint-disable no-undefined */
+
+const Syntax = require("estraverse").Syntax;
+
+const Reference = require("./reference");
+const Variable = require("./variable");
+const Definition = require("./definition").Definition;
+const assert = require("assert");
+
+/**
+ * Test if scope is struct
+ * @param {Scope} scope - scope
+ * @param {Block} block - block
+ * @param {boolean} isMethodDefinition - is method definition
+ * @param {boolean} useDirective - use directive
+ * @returns {boolean} is strict scope
+ */
+function isStrictScope(scope, block, isMethodDefinition, useDirective) {
+    let body;
+
+    // When upper scope is exists and strict, inner scope is also strict.
+    if (scope.upper && scope.upper.isStrict) {
+        return true;
+    }
+
+    if (isMethodDefinition) {
+        return true;
+    }
+
+    if (scope.type === "class" || scope.type === "module") {
+        return true;
+    }
+
+    if (scope.type === "block" || scope.type === "switch") {
+        return false;
+    }
+
+    if (scope.type === "function") {
+        if (block.type === Syntax.ArrowFunctionExpression && block.body.type !== Syntax.BlockStatement) {
+            return false;
+        }
+
+        if (block.type === Syntax.Program) {
+            body = block;
+        } else {
+            body = block.body;
+        }
+
+        if (!body) {
+            return false;
+        }
+    } else if (scope.type === "global") {
+        body = block;
+    } else {
+        return false;
+    }
+
+    // Search 'use strict' directive.
+    if (useDirective) {
+        for (let i = 0, iz = body.body.length; i < iz; ++i) {
+            const stmt = body.body[i];
+
+            if (stmt.type !== Syntax.DirectiveStatement) {
+                break;
+            }
+            if (stmt.raw === "\"use strict\"" || stmt.raw === "'use strict'") {
+                return true;
+            }
+        }
+    } else {
+        for (let i = 0, iz = body.body.length; i < iz; ++i) {
+            const stmt = body.body[i];
+
+            if (stmt.type !== Syntax.ExpressionStatement) {
+                break;
+            }
+            const expr = stmt.expression;
+
+            if (expr.type !== Syntax.Literal || typeof expr.value !== "string") {
+                break;
+            }
+            if (expr.raw !== null && expr.raw !== undefined) {
+                if (expr.raw === "\"use strict\"" || expr.raw === "'use strict'") {
+                    return true;
+                }
+            } else {
+                if (expr.value === "use strict") {
+                    return true;
+                }
+            }
+        }
+    }
+    return false;
+}
+
+/**
+ * Register scope
+ * @param {ScopeManager} scopeManager - scope manager
+ * @param {Scope} scope - scope
+ * @returns {void}
+ */
+function registerScope(scopeManager, scope) {
+    scopeManager.scopes.push(scope);
+
+    const scopes = scopeManager.__nodeToScope.get(scope.block);
+
+    if (scopes) {
+        scopes.push(scope);
+    } else {
+        scopeManager.__nodeToScope.set(scope.block, [scope]);
+    }
+}
+
+/**
+ * Should be statically
+ * @param {Object} def - def
+ * @returns {boolean} should be statically
+ */
+function shouldBeStatically(def) {
+    return (
+        (def.type === Variable.ClassName) ||
+        (def.type === Variable.Variable && def.parent.kind !== "var")
+    );
+}
+
+/**
+ * @class Scope
+ */
+class Scope {
+    constructor(scopeManager, type, upperScope, block, isMethodDefinition) {
+
+        /**
+         * One of 'module', 'block', 'switch', 'function', 'catch', 'with', 'function', 'class', 'global'.
+         * @member {String} Scope#type
+         */
+        this.type = type;
+
+        /**
+         * The scoped {@link Variable}s of this scope, as <code>{ Variable.name
+         * : Variable }</code>.
+         * @member {Map} Scope#set
+         */
+        this.set = new Map();
+
+        /**
+         * The tainted variables of this scope, as <code>{ Variable.name :
+         * boolean }</code>.
+         * @member {Map} Scope#taints */
+        this.taints = new Map();
+
+        /**
+         * Generally, through the lexical scoping of JS you can always know
+         * which variable an identifier in the source code refers to. There are
+         * a few exceptions to this rule. With 'global' and 'with' scopes you
+         * can only decide at runtime which variable a reference refers to.
+         * Moreover, if 'eval()' is used in a scope, it might introduce new
+         * bindings in this or its parent scopes.
+         * All those scopes are considered 'dynamic'.
+         * @member {boolean} Scope#dynamic
+         */
+        this.dynamic = this.type === "global" || this.type === "with";
+
+        /**
+         * A reference to the scope-defining syntax node.
+         * @member {espree.Node} Scope#block
+         */
+        this.block = block;
+
+        /**
+         * The {@link Reference|references} that are not resolved with this scope.
+         * @member {Reference[]} Scope#through
+         */
+        this.through = [];
+
+        /**
+         * The scoped {@link Variable}s of this scope. In the case of a
+         * 'function' scope this includes the automatic argument <em>arguments</em> as
+         * its first element, as well as all further formal arguments.
+         * @member {Variable[]} Scope#variables
+         */
+        this.variables = [];
+
+        /**
+         * Any variable {@link Reference|reference} found in this scope. This
+         * includes occurrences of local variables as well as variables from
+         * parent scopes (including the global scope). For local variables
+         * this also includes defining occurrences (like in a 'var' statement).
+         * In a 'function' scope this does not include the occurrences of the
+         * formal parameter in the parameter list.
+         * @member {Reference[]} Scope#references
+         */
+        this.references = [];
+
+        /**
+         * For 'global' and 'function' scopes, this is a self-reference. For
+         * other scope types this is the <em>variableScope</em> value of the
+         * parent scope.
+         * @member {Scope} Scope#variableScope
+         */
+        this.variableScope =
+            (this.type === "global" || this.type === "function" || this.type === "module") ? this : upperScope.variableScope;
+
+        /**
+         * Whether this scope is created by a FunctionExpression.
+         * @member {boolean} Scope#functionExpressionScope
+         */
+        this.functionExpressionScope = false;
+
+        /**
+         * Whether this is a scope that contains an 'eval()' invocation.
+         * @member {boolean} Scope#directCallToEvalScope
+         */
+        this.directCallToEvalScope = false;
+
+        /**
+         * @member {boolean} Scope#thisFound
+         */
+        this.thisFound = false;
+
+        this.__left = [];
+
+        /**
+         * Reference to the parent {@link Scope|scope}.
+         * @member {Scope} Scope#upper
+         */
+        this.upper = upperScope;
+
+        /**
+         * Whether 'use strict' is in effect in this scope.
+         * @member {boolean} Scope#isStrict
+         */
+        this.isStrict = isStrictScope(this, block, isMethodDefinition, scopeManager.__useDirective());
+
+        /**
+         * List of nested {@link Scope}s.
+         * @member {Scope[]} Scope#childScopes
+         */
+        this.childScopes = [];
+        if (this.upper) {
+            this.upper.childScopes.push(this);
+        }
+
+        this.__declaredVariables = scopeManager.__declaredVariables;
+
+        registerScope(scopeManager, this);
+    }
+
+    __shouldStaticallyClose(scopeManager) {
+        return (!this.dynamic || scopeManager.__isOptimistic());
+    }
+
+    __shouldStaticallyCloseForGlobal(ref) {
+
+        // On global scope, let/const/class declarations should be resolved statically.
+        const name = ref.identifier.name;
+
+        if (!this.set.has(name)) {
+            return false;
+        }
+
+        const variable = this.set.get(name);
+        const defs = variable.defs;
+
+        return defs.length > 0 && defs.every(shouldBeStatically);
+    }
+
+    __staticCloseRef(ref) {
+        if (!this.__resolve(ref)) {
+            this.__delegateToUpperScope(ref);
+        }
+    }
+
+    __dynamicCloseRef(ref) {
+
+        // notify all names are through to global
+        let current = this;
+
+        do {
+            current.through.push(ref);
+            current = current.upper;
+        } while (current);
+    }
+
+    __globalCloseRef(ref) {
+
+        // let/const/class declarations should be resolved statically.
+        // others should be resolved dynamically.
+        if (this.__shouldStaticallyCloseForGlobal(ref)) {
+            this.__staticCloseRef(ref);
+        } else {
+            this.__dynamicCloseRef(ref);
+        }
+    }
+
+    __close(scopeManager) {
+        let closeRef;
+
+        if (this.__shouldStaticallyClose(scopeManager)) {
+            closeRef = this.__staticCloseRef;
+        } else if (this.type !== "global") {
+            closeRef = this.__dynamicCloseRef;
+        } else {
+            closeRef = this.__globalCloseRef;
+        }
+
+        // Try Resolving all references in this scope.
+        for (let i = 0, iz = this.__left.length; i < iz; ++i) {
+            const ref = this.__left[i];
+
+            closeRef.call(this, ref);
+        }
+        this.__left = null;
+
+        return this.upper;
+    }
+
+    // To override by function scopes.
+    // References in default parameters isn't resolved to variables which are in their function body.
+    __isValidResolution(ref, variable) { // eslint-disable-line class-methods-use-this, no-unused-vars
+        return true;
+    }
+
+    __resolve(ref) {
+        const name = ref.identifier.name;
+
+        if (!this.set.has(name)) {
+            return false;
+        }
+        const variable = this.set.get(name);
+
+        if (!this.__isValidResolution(ref, variable)) {
+            return false;
+        }
+        variable.references.push(ref);
+        variable.stack = variable.stack && ref.from.variableScope === this.variableScope;
+        if (ref.tainted) {
+            variable.tainted = true;
+            this.taints.set(variable.name, true);
+        }
+        ref.resolved = variable;
+
+        return true;
+    }
+
+    __delegateToUpperScope(ref) {
+        if (this.upper) {
+            this.upper.__left.push(ref);
+        }
+        this.through.push(ref);
+    }
+
+    __addDeclaredVariablesOfNode(variable, node) {
+        if (node === null || node === undefined) {
+            return;
+        }
+
+        let variables = this.__declaredVariables.get(node);
+
+        if (variables === null || variables === undefined) {
+            variables = [];
+            this.__declaredVariables.set(node, variables);
+        }
+        if (variables.indexOf(variable) === -1) {
+            variables.push(variable);
+        }
+    }
+
+    __defineGeneric(name, set, variables, node, def) {
+        let variable;
+
+        variable = set.get(name);
+        if (!variable) {
+            variable = new Variable(name, this);
+            set.set(name, variable);
+            variables.push(variable);
+        }
+
+        if (def) {
+            variable.defs.push(def);
+            this.__addDeclaredVariablesOfNode(variable, def.node);
+            this.__addDeclaredVariablesOfNode(variable, def.parent);
+        }
+        if (node) {
+            variable.identifiers.push(node);
+        }
+    }
+
+    __define(node, def) {
+        if (node && node.type === Syntax.Identifier) {
+            this.__defineGeneric(
+                node.name,
+                this.set,
+                this.variables,
+                node,
+                def
+            );
+        }
+    }
+
+    __referencing(node, assign, writeExpr, maybeImplicitGlobal, partial, init) {
+
+        // because Array element may be null
+        if (!node || node.type !== Syntax.Identifier) {
+            return;
+        }
+
+        // Specially handle like `this`.
+        if (node.name === "super") {
+            return;
+        }
+
+        const ref = new Reference(node, this, assign || Reference.READ, writeExpr, maybeImplicitGlobal, !!partial, !!init);
+
+        this.references.push(ref);
+        this.__left.push(ref);
+    }
+
+    __detectEval() {
+        let current = this;
+
+        this.directCallToEvalScope = true;
+        do {
+            current.dynamic = true;
+            current = current.upper;
+        } while (current);
+    }
+
+    __detectThis() {
+        this.thisFound = true;
+    }
+
+    __isClosed() {
+        return this.__left === null;
+    }
+
+    /**
+     * returns resolved {Reference}
+     * @method Scope#resolve
+     * @param {Espree.Identifier} ident - identifier to be resolved.
+     * @returns {Reference} reference
+     */
+    resolve(ident) {
+        let ref, i, iz;
+
+        assert(this.__isClosed(), "Scope should be closed.");
+        assert(ident.type === Syntax.Identifier, "Target should be identifier.");
+        for (i = 0, iz = this.references.length; i < iz; ++i) {
+            ref = this.references[i];
+            if (ref.identifier === ident) {
+                return ref;
+            }
+        }
+        return null;
+    }
+
+    /**
+     * returns this scope is static
+     * @method Scope#isStatic
+     * @returns {boolean} static
+     */
+    isStatic() {
+        return !this.dynamic;
+    }
+
+    /**
+     * returns this scope has materialized arguments
+     * @method Scope#isArgumentsMaterialized
+     * @returns {boolean} arguemnts materialized
+     */
+    isArgumentsMaterialized() { // eslint-disable-line class-methods-use-this
+        return true;
+    }
+
+    /**
+     * returns this scope has materialized `this` reference
+     * @method Scope#isThisMaterialized
+     * @returns {boolean} this materialized
+     */
+    isThisMaterialized() { // eslint-disable-line class-methods-use-this
+        return true;
+    }
+
+    isUsedName(name) {
+        if (this.set.has(name)) {
+            return true;
+        }
+        for (let i = 0, iz = this.through.length; i < iz; ++i) {
+            if (this.through[i].identifier.name === name) {
+                return true;
+            }
+        }
+        return false;
+    }
+}
+
+class GlobalScope extends Scope {
+    constructor(scopeManager, block) {
+        super(scopeManager, "global", null, block, false);
+        this.implicit = {
+            set: new Map(),
+            variables: [],
+
+            /**
+            * List of {@link Reference}s that are left to be resolved (i.e. which
+            * need to be linked to the variable they refer to).
+            * @member {Reference[]} Scope#implicit#left
+            */
+            left: []
+        };
+    }
+
+    __close(scopeManager) {
+        const implicit = [];
+
+        for (let i = 0, iz = this.__left.length; i < iz; ++i) {
+            const ref = this.__left[i];
+
+            if (ref.__maybeImplicitGlobal && !this.set.has(ref.identifier.name)) {
+                implicit.push(ref.__maybeImplicitGlobal);
+            }
+        }
+
+        // create an implicit global variable from assignment expression
+        for (let i = 0, iz = implicit.length; i < iz; ++i) {
+            const info = implicit[i];
+
+            this.__defineImplicit(info.pattern,
+                new Definition(
+                    Variable.ImplicitGlobalVariable,
+                    info.pattern,
+                    info.node,
+                    null,
+                    null,
+                    null
+                ));
+
+        }
+
+        this.implicit.left = this.__left;
+
+        return super.__close(scopeManager);
+    }
+
+    __defineImplicit(node, def) {
+        if (node && node.type === Syntax.Identifier) {
+            this.__defineGeneric(
+                node.name,
+                this.implicit.set,
+                this.implicit.variables,
+                node,
+                def
+            );
+        }
+    }
+}
+
+class ModuleScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "module", upperScope, block, false);
+    }
+}
+
+class FunctionExpressionNameScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "function-expression-name", upperScope, block, false);
+        this.__define(block.id,
+            new Definition(
+                Variable.FunctionName,
+                block.id,
+                block,
+                null,
+                null,
+                null
+            ));
+        this.functionExpressionScope = true;
+    }
+}
+
+class CatchScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "catch", upperScope, block, false);
+    }
+}
+
+class WithScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "with", upperScope, block, false);
+    }
+
+    __close(scopeManager) {
+        if (this.__shouldStaticallyClose(scopeManager)) {
+            return super.__close(scopeManager);
+        }
+
+        for (let i = 0, iz = this.__left.length; i < iz; ++i) {
+            const ref = this.__left[i];
+
+            ref.tainted = true;
+            this.__delegateToUpperScope(ref);
+        }
+        this.__left = null;
+
+        return this.upper;
+    }
+}
+
+class BlockScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "block", upperScope, block, false);
+    }
+}
+
+class SwitchScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "switch", upperScope, block, false);
+    }
+}
+
+class FunctionScope extends Scope {
+    constructor(scopeManager, upperScope, block, isMethodDefinition) {
+        super(scopeManager, "function", upperScope, block, isMethodDefinition);
+
+        // section 9.2.13, FunctionDeclarationInstantiation.
+        // NOTE Arrow functions never have an arguments objects.
+        if (this.block.type !== Syntax.ArrowFunctionExpression) {
+            this.__defineArguments();
+        }
+    }
+
+    isArgumentsMaterialized() {
+
+        // TODO(Constellation)
+        // We can more aggressive on this condition like this.
+        //
+        // function t() {
+        //     // arguments of t is always hidden.
+        //     function arguments() {
+        //     }
+        // }
+        if (this.block.type === Syntax.ArrowFunctionExpression) {
+            return false;
+        }
+
+        if (!this.isStatic()) {
+            return true;
+        }
+
+        const variable = this.set.get("arguments");
+
+        assert(variable, "Always have arguments variable.");
+        return variable.tainted || variable.references.length !== 0;
+    }
+
+    isThisMaterialized() {
+        if (!this.isStatic()) {
+            return true;
+        }
+        return this.thisFound;
+    }
+
+    __defineArguments() {
+        this.__defineGeneric(
+            "arguments",
+            this.set,
+            this.variables,
+            null,
+            null
+        );
+        this.taints.set("arguments", true);
+    }
+
+    // References in default parameters isn't resolved to variables which are in their function body.
+    //     const x = 1
+    //     function f(a = x) { // This `x` is resolved to the `x` in the outer scope.
+    //         const x = 2
+    //         console.log(a)
+    //     }
+    __isValidResolution(ref, variable) {
+
+        // If `options.nodejsScope` is true, `this.block` becomes a Program node.
+        if (this.block.type === "Program") {
+            return true;
+        }
+
+        const bodyStart = this.block.body.range[0];
+
+        // It's invalid resolution in the following case:
+        return !(
+            variable.scope === this &&
+            ref.identifier.range[0] < bodyStart && // the reference is in the parameter part.
+            variable.defs.every(d => d.name.range[0] >= bodyStart) // the variable is in the body.
+        );
+    }
+}
+
+class ForScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "for", upperScope, block, false);
+    }
+}
+
+class ClassScope extends Scope {
+    constructor(scopeManager, upperScope, block) {
+        super(scopeManager, "class", upperScope, block, false);
+    }
+}
+
+module.exports = {
+    Scope,
+    GlobalScope,
+    ModuleScope,
+    FunctionExpressionNameScope,
+    CatchScope,
+    WithScope,
+    BlockScope,
+    SwitchScope,
+    FunctionScope,
+    ForScope,
+    ClassScope
+};
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/lib/variable.js b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/variable.js
new file mode 100644
index 0000000..702c478
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/lib/variable.js
@@ -0,0 +1,88 @@
+/*
+  Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+"use strict";
+
+/**
+ * A Variable represents a locally scoped identifier. These include arguments to
+ * functions.
+ * @class Variable
+ */
+class Variable {
+    constructor(name, scope) {
+
+        /**
+         * The variable name, as given in the source code.
+         * @member {String} Variable#name
+         */
+        this.name = name;
+
+        /**
+         * List of defining occurrences of this variable (like in 'var ...'
+         * statements or as parameter), as AST nodes.
+         * @member {espree.Identifier[]} Variable#identifiers
+         */
+        this.identifiers = [];
+
+        /**
+         * List of {@link Reference|references} of this variable (excluding parameter entries)
+         * in its defining scope and all nested scopes. For defining
+         * occurrences only see {@link Variable#defs}.
+         * @member {Reference[]} Variable#references
+         */
+        this.references = [];
+
+        /**
+         * List of defining occurrences of this variable (like in 'var ...'
+         * statements or as parameter), as custom objects.
+         * @member {Definition[]} Variable#defs
+         */
+        this.defs = [];
+
+        this.tainted = false;
+
+        /**
+         * Whether this is a stack variable.
+         * @member {boolean} Variable#stack
+         */
+        this.stack = true;
+
+        /**
+         * Reference to the enclosing Scope.
+         * @member {Scope} Variable#scope
+         */
+        this.scope = scope;
+    }
+}
+
+Variable.CatchClause = "CatchClause";
+Variable.Parameter = "Parameter";
+Variable.FunctionName = "FunctionName";
+Variable.ClassName = "ClassName";
+Variable.Variable = "Variable";
+Variable.ImportBinding = "ImportBinding";
+Variable.ImplicitGlobalVariable = "ImplicitGlobalVariable";
+
+module.exports = Variable;
+
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/eslint-scope/package.json b/node_modules/mathjs/examples/node_modules/eslint-scope/package.json
new file mode 100644
index 0000000..b700b92
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/eslint-scope/package.json
@@ -0,0 +1,48 @@
+{
+  "name": "eslint-scope",
+  "description": "ECMAScript scope analyzer for ESLint",
+  "homepage": "http://github.com/eslint/eslint-scope",
+  "main": "lib/index.js",
+  "version": "5.1.1",
+  "engines": {
+    "node": ">=8.0.0"
+  },
+  "repository": "eslint/eslint-scope",
+  "bugs": {
+    "url": "https://github.com/eslint/eslint-scope/issues"
+  },
+  "license": "BSD-2-Clause",
+  "scripts": {
+    "test": "node Makefile.js test",
+    "lint": "node Makefile.js lint",
+    "generate-release": "eslint-generate-release",
+    "generate-alpharelease": "eslint-generate-prerelease alpha",
+    "generate-betarelease": "eslint-generate-prerelease beta",
+    "generate-rcrelease": "eslint-generate-prerelease rc",
+    "publish-release": "eslint-publish-release"
+  },
+  "files": [
+    "LICENSE",
+    "README.md",
+    "lib"
+  ],
+  "dependencies": {
+    "esrecurse": "^4.3.0",
+    "estraverse": "^4.1.1"
+  },
+  "devDependencies": {
+    "@typescript-eslint/parser": "^1.11.0",
+    "chai": "^4.2.0",
+    "eslint": "^6.0.1",
+    "eslint-config-eslint": "^5.0.1",
+    "eslint-plugin-node": "^9.1.0",
+    "eslint-release": "^1.0.0",
+    "eslint-visitor-keys": "^1.2.0",
+    "espree": "^7.1.0",
+    "istanbul": "^0.4.5",
+    "mocha": "^6.1.4",
+    "npm-license": "^0.3.3",
+    "shelljs": "^0.8.3",
+    "typescript": "^3.5.2"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/.babelrc b/node_modules/mathjs/examples/node_modules/esrecurse/.babelrc
new file mode 100644
index 0000000..a0765e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/.babelrc
@@ -0,0 +1,3 @@
+{
+    "presets": ["es2015"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/README.md b/node_modules/mathjs/examples/node_modules/esrecurse/README.md
new file mode 100644
index 0000000..ffea6b4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/README.md
@@ -0,0 +1,171 @@
+### Esrecurse [![Build Status](https://travis-ci.org/estools/esrecurse.svg?branch=master)](https://travis-ci.org/estools/esrecurse)
+
+Esrecurse ([esrecurse](https://github.com/estools/esrecurse)) is
+[ECMAScript](https://www.ecma-international.org/publications/standards/Ecma-262.htm)
+recursive traversing functionality.
+
+### Example Usage
+
+The following code will output all variables declared at the root of a file.
+
+```javascript
+esrecurse.visit(ast, {
+    XXXStatement: function (node) {
+        this.visit(node.left);
+        // do something...
+        this.visit(node.right);
+    }
+});
+```
+
+We can use `Visitor` instance.
+
+```javascript
+var visitor = new esrecurse.Visitor({
+    XXXStatement: function (node) {
+        this.visit(node.left);
+        // do something...
+        this.visit(node.right);
+    }
+});
+
+visitor.visit(ast);
+```
+
+We can inherit `Visitor` instance easily.
+
+```javascript
+class Derived extends esrecurse.Visitor {
+    constructor()
+    {
+        super(null);
+    }
+
+    XXXStatement(node) {
+    }
+}
+```
+
+```javascript
+function DerivedVisitor() {
+    esrecurse.Visitor.call(/* this for constructor */  this  /* visitor object automatically becomes this. */);
+}
+util.inherits(DerivedVisitor, esrecurse.Visitor);
+DerivedVisitor.prototype.XXXStatement = function (node) {
+    this.visit(node.left);
+    // do something...
+    this.visit(node.right);
+};
+```
+
+And you can invoke default visiting operation inside custom visit operation.
+
+```javascript
+function DerivedVisitor() {
+    esrecurse.Visitor.call(/* this for constructor */  this  /* visitor object automatically becomes this. */);
+}
+util.inherits(DerivedVisitor, esrecurse.Visitor);
+DerivedVisitor.prototype.XXXStatement = function (node) {
+    // do something...
+    this.visitChildren(node);
+};
+```
+
+The `childVisitorKeys` option does customize the behaviour of `this.visitChildren(node)`.
+We can use user-defined node types.
+
+```javascript
+// This tree contains a user-defined `TestExpression` node.
+var tree = {
+    type: 'TestExpression',
+
+    // This 'argument' is the property containing the other **node**.
+    argument: {
+        type: 'Literal',
+        value: 20
+    },
+
+    // This 'extended' is the property not containing the other **node**.
+    extended: true
+};
+esrecurse.visit(
+    ast,
+    {
+        Literal: function (node) {
+            // do something...
+        }
+    },
+    {
+        // Extending the existing traversing rules.
+        childVisitorKeys: {
+            // TargetNodeName: [ 'keys', 'containing', 'the', 'other', '**node**' ]
+            TestExpression: ['argument']
+        }
+    }
+);
+```
+
+We can use the `fallback` option as well.
+If the `fallback` option is `"iteration"`, `esrecurse` would visit all enumerable properties of unknown nodes.
+Please note circular references cause the stack overflow. AST might have circular references in additional properties for some purpose (e.g. `node.parent`).
+
+```javascript
+esrecurse.visit(
+    ast,
+    {
+        Literal: function (node) {
+            // do something...
+        }
+    },
+    {
+        fallback: 'iteration'
+    }
+);
+```
+
+If the `fallback` option is a function, `esrecurse` calls this function to determine the enumerable properties of unknown nodes.
+Please note circular references cause the stack overflow. AST might have circular references in additional properties for some purpose (e.g. `node.parent`).
+
+```javascript
+esrecurse.visit(
+    ast,
+    {
+        Literal: function (node) {
+            // do something...
+        }
+    },
+    {
+        fallback: function (node) {
+            return Object.keys(node).filter(function(key) {
+                return key !== 'argument'
+            });
+        }
+    }
+);
+```
+
+### License
+
+Copyright (C) 2014 [Yusuke Suzuki](https://github.com/Constellation)
+ (twitter: [@Constellation](https://twitter.com/Constellation)) and other contributors.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/esrecurse.js b/node_modules/mathjs/examples/node_modules/esrecurse/esrecurse.js
new file mode 100644
index 0000000..15d57df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/esrecurse.js
@@ -0,0 +1,117 @@
+/*
+  Copyright (C) 2014 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+(function () {
+    'use strict';
+
+    var estraverse = require('estraverse');
+
+    function isNode(node) {
+        if (node == null) {
+            return false;
+        }
+        return typeof node === 'object' && typeof node.type === 'string';
+    }
+
+    function isProperty(nodeType, key) {
+        return (nodeType === estraverse.Syntax.ObjectExpression || nodeType === estraverse.Syntax.ObjectPattern) && key === 'properties';
+    }
+
+    function Visitor(visitor, options) {
+        options = options || {};
+
+        this.__visitor = visitor ||  this;
+        this.__childVisitorKeys = options.childVisitorKeys
+            ? Object.assign({}, estraverse.VisitorKeys, options.childVisitorKeys)
+            : estraverse.VisitorKeys;
+        if (options.fallback === 'iteration') {
+            this.__fallback = Object.keys;
+        } else if (typeof options.fallback === 'function') {
+            this.__fallback = options.fallback;
+        }
+    }
+
+    /* Default method for visiting children.
+     * When you need to call default visiting operation inside custom visiting
+     * operation, you can use it with `this.visitChildren(node)`.
+     */
+    Visitor.prototype.visitChildren = function (node) {
+        var type, children, i, iz, j, jz, child;
+
+        if (node == null) {
+            return;
+        }
+
+        type = node.type || estraverse.Syntax.Property;
+
+        children = this.__childVisitorKeys[type];
+        if (!children) {
+            if (this.__fallback) {
+                children = this.__fallback(node);
+            } else {
+                throw new Error('Unknown node type ' + type + '.');
+            }
+        }
+
+        for (i = 0, iz = children.length; i < iz; ++i) {
+            child = node[children[i]];
+            if (child) {
+                if (Array.isArray(child)) {
+                    for (j = 0, jz = child.length; j < jz; ++j) {
+                        if (child[j]) {
+                            if (isNode(child[j]) || isProperty(type, children[i])) {
+                                this.visit(child[j]);
+                            }
+                        }
+                    }
+                } else if (isNode(child)) {
+                    this.visit(child);
+                }
+            }
+        }
+    };
+
+    /* Dispatching node. */
+    Visitor.prototype.visit = function (node) {
+        var type;
+
+        if (node == null) {
+            return;
+        }
+
+        type = node.type || estraverse.Syntax.Property;
+        if (this.__visitor[type]) {
+            this.__visitor[type].call(this, node);
+            return;
+        }
+        this.visitChildren(node);
+    };
+
+    exports.version = require('./package.json').version;
+    exports.Visitor = Visitor;
+    exports.visit = function (node, visitor, options) {
+        var v = new Visitor(visitor, options);
+        v.visit(node);
+    };
+}());
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/gulpfile.babel.js b/node_modules/mathjs/examples/node_modules/esrecurse/gulpfile.babel.js
new file mode 100644
index 0000000..aa881c9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/gulpfile.babel.js
@@ -0,0 +1,92 @@
+// Copyright (C) 2014 Yusuke Suzuki <utatane.tea@gmail.com>
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+//
+//   * Redistributions of source code must retain the above copyright
+//     notice, this list of conditions and the following disclaimer.
+//   * Redistributions in binary form must reproduce the above copyright
+//     notice, this list of conditions and the following disclaimer in the
+//     documentation and/or other materials provided with the distribution.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+// ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+import gulp from 'gulp';
+import mocha from 'gulp-mocha';
+import eslint from 'gulp-eslint';
+import minimist from 'minimist';
+import git from 'gulp-git';
+import bump from 'gulp-bump';
+import filter from 'gulp-filter';
+import tagVersion from 'gulp-tag-version';
+import 'babel-register';
+
+const SOURCE = [
+    '*.js'
+];
+
+let ESLINT_OPTION = {
+    parser: 'babel-eslint',
+    parserOptions: {
+        'sourceType': 'module'
+    },
+    rules: {
+        'quotes': 0,
+        'eqeqeq': 0,
+        'no-use-before-define': 0,
+        'no-shadow': 0,
+        'no-new': 0,
+        'no-underscore-dangle': 0,
+        'no-multi-spaces': 0,
+        'no-native-reassign': 0,
+        'no-loop-func': 0
+    },
+    env: {
+        'node': true
+    }
+};
+
+gulp.task('test', function() {
+    let options = minimist(process.argv.slice(2), {
+        string: 'test',
+        default: {
+            test: 'test/*.js'
+        }
+    }
+    );
+    return gulp.src(options.test).pipe(mocha({reporter: 'spec'}));
+});
+
+gulp.task('lint', () =>
+    gulp.src(SOURCE)
+    .pipe(eslint(ESLINT_OPTION))
+    .pipe(eslint.formatEach('stylish', process.stderr))
+    .pipe(eslint.failOnError())
+);
+
+let inc = importance =>
+    gulp.src(['./package.json'])
+        .pipe(bump({type: importance}))
+        .pipe(gulp.dest('./'))
+        .pipe(git.commit('Bumps package version'))
+        .pipe(filter('package.json'))
+        .pipe(tagVersion({
+            prefix: ''
+        }))
+;
+
+gulp.task('travis', [ 'lint', 'test' ]);
+gulp.task('default', [ 'travis' ]);
+
+gulp.task('patch', [ ], () => inc('patch'));
+gulp.task('minor', [ ], () => inc('minor'));
+gulp.task('major', [ ], () => inc('major'));
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/.jshintrc b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/.jshintrc
new file mode 100644
index 0000000..f642dae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/.jshintrc
@@ -0,0 +1,16 @@
+{
+  "curly": true,
+  "eqeqeq": true,
+  "immed": true,
+  "eqnull": true,
+  "latedef": true,
+  "noarg": true,
+  "noempty": true,
+  "quotmark": "single",
+  "undef": true,
+  "unused": true,
+  "strict": true,
+  "trailing": true,
+
+  "node": true
+}
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/LICENSE.BSD b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/LICENSE.BSD
new file mode 100644
index 0000000..3e580c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/LICENSE.BSD
@@ -0,0 +1,19 @@
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/README.md b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/README.md
new file mode 100644
index 0000000..ccd3377
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/README.md
@@ -0,0 +1,153 @@
+### Estraverse [![Build Status](https://secure.travis-ci.org/estools/estraverse.svg)](http://travis-ci.org/estools/estraverse)
+
+Estraverse ([estraverse](http://github.com/estools/estraverse)) is
+[ECMAScript](http://www.ecma-international.org/publications/standards/Ecma-262.htm)
+traversal functions from [esmangle project](http://github.com/estools/esmangle).
+
+### Documentation
+
+You can find usage docs at [wiki page](https://github.com/estools/estraverse/wiki/Usage).
+
+### Example Usage
+
+The following code will output all variables declared at the root of a file.
+
+```javascript
+estraverse.traverse(ast, {
+    enter: function (node, parent) {
+        if (node.type == 'FunctionExpression' || node.type == 'FunctionDeclaration')
+            return estraverse.VisitorOption.Skip;
+    },
+    leave: function (node, parent) {
+        if (node.type == 'VariableDeclarator')
+          console.log(node.id.name);
+    }
+});
+```
+
+We can use `this.skip`, `this.remove` and `this.break` functions instead of using Skip, Remove and Break.
+
+```javascript
+estraverse.traverse(ast, {
+    enter: function (node) {
+        this.break();
+    }
+});
+```
+
+And estraverse provides `estraverse.replace` function. When returning node from `enter`/`leave`, current node is replaced with it.
+
+```javascript
+result = estraverse.replace(tree, {
+    enter: function (node) {
+        // Replace it with replaced.
+        if (node.type === 'Literal')
+            return replaced;
+    }
+});
+```
+
+By passing `visitor.keys` mapping, we can extend estraverse traversing functionality.
+
+```javascript
+// This tree contains a user-defined `TestExpression` node.
+var tree = {
+    type: 'TestExpression',
+
+    // This 'argument' is the property containing the other **node**.
+    argument: {
+        type: 'Literal',
+        value: 20
+    },
+
+    // This 'extended' is the property not containing the other **node**.
+    extended: true
+};
+estraverse.traverse(tree, {
+    enter: function (node) { },
+
+    // Extending the existing traversing rules.
+    keys: {
+        // TargetNodeName: [ 'keys', 'containing', 'the', 'other', '**node**' ]
+        TestExpression: ['argument']
+    }
+});
+```
+
+By passing `visitor.fallback` option, we can control the behavior when encountering unknown nodes.
+
+```javascript
+// This tree contains a user-defined `TestExpression` node.
+var tree = {
+    type: 'TestExpression',
+
+    // This 'argument' is the property containing the other **node**.
+    argument: {
+        type: 'Literal',
+        value: 20
+    },
+
+    // This 'extended' is the property not containing the other **node**.
+    extended: true
+};
+estraverse.traverse(tree, {
+    enter: function (node) { },
+
+    // Iterating the child **nodes** of unknown nodes.
+    fallback: 'iteration'
+});
+```
+
+When `visitor.fallback` is a function, we can determine which keys to visit on each node.
+
+```javascript
+// This tree contains a user-defined `TestExpression` node.
+var tree = {
+    type: 'TestExpression',
+
+    // This 'argument' is the property containing the other **node**.
+    argument: {
+        type: 'Literal',
+        value: 20
+    },
+
+    // This 'extended' is the property not containing the other **node**.
+    extended: true
+};
+estraverse.traverse(tree, {
+    enter: function (node) { },
+
+    // Skip the `argument` property of each node
+    fallback: function(node) {
+        return Object.keys(node).filter(function(key) {
+            return key !== 'argument';
+        });
+    }
+});
+```
+
+### License
+
+Copyright (C) 2012-2016 [Yusuke Suzuki](http://github.com/Constellation)
+ (twitter: [@Constellation](http://twitter.com/Constellation)) and other contributors.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/estraverse.js b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/estraverse.js
new file mode 100644
index 0000000..f0d9af9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/estraverse.js
@@ -0,0 +1,805 @@
+/*
+  Copyright (C) 2012-2013 Yusuke Suzuki <utatane.tea@gmail.com>
+  Copyright (C) 2012 Ariya Hidayat <ariya.hidayat@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+/*jslint vars:false, bitwise:true*/
+/*jshint indent:4*/
+/*global exports:true*/
+(function clone(exports) {
+    'use strict';
+
+    var Syntax,
+        VisitorOption,
+        VisitorKeys,
+        BREAK,
+        SKIP,
+        REMOVE;
+
+    function deepCopy(obj) {
+        var ret = {}, key, val;
+        for (key in obj) {
+            if (obj.hasOwnProperty(key)) {
+                val = obj[key];
+                if (typeof val === 'object' && val !== null) {
+                    ret[key] = deepCopy(val);
+                } else {
+                    ret[key] = val;
+                }
+            }
+        }
+        return ret;
+    }
+
+    // based on LLVM libc++ upper_bound / lower_bound
+    // MIT License
+
+    function upperBound(array, func) {
+        var diff, len, i, current;
+
+        len = array.length;
+        i = 0;
+
+        while (len) {
+            diff = len >>> 1;
+            current = i + diff;
+            if (func(array[current])) {
+                len = diff;
+            } else {
+                i = current + 1;
+                len -= diff + 1;
+            }
+        }
+        return i;
+    }
+
+    Syntax = {
+        AssignmentExpression: 'AssignmentExpression',
+        AssignmentPattern: 'AssignmentPattern',
+        ArrayExpression: 'ArrayExpression',
+        ArrayPattern: 'ArrayPattern',
+        ArrowFunctionExpression: 'ArrowFunctionExpression',
+        AwaitExpression: 'AwaitExpression', // CAUTION: It's deferred to ES7.
+        BlockStatement: 'BlockStatement',
+        BinaryExpression: 'BinaryExpression',
+        BreakStatement: 'BreakStatement',
+        CallExpression: 'CallExpression',
+        CatchClause: 'CatchClause',
+        ChainExpression: 'ChainExpression',
+        ClassBody: 'ClassBody',
+        ClassDeclaration: 'ClassDeclaration',
+        ClassExpression: 'ClassExpression',
+        ComprehensionBlock: 'ComprehensionBlock',  // CAUTION: It's deferred to ES7.
+        ComprehensionExpression: 'ComprehensionExpression',  // CAUTION: It's deferred to ES7.
+        ConditionalExpression: 'ConditionalExpression',
+        ContinueStatement: 'ContinueStatement',
+        DebuggerStatement: 'DebuggerStatement',
+        DirectiveStatement: 'DirectiveStatement',
+        DoWhileStatement: 'DoWhileStatement',
+        EmptyStatement: 'EmptyStatement',
+        ExportAllDeclaration: 'ExportAllDeclaration',
+        ExportDefaultDeclaration: 'ExportDefaultDeclaration',
+        ExportNamedDeclaration: 'ExportNamedDeclaration',
+        ExportSpecifier: 'ExportSpecifier',
+        ExpressionStatement: 'ExpressionStatement',
+        ForStatement: 'ForStatement',
+        ForInStatement: 'ForInStatement',
+        ForOfStatement: 'ForOfStatement',
+        FunctionDeclaration: 'FunctionDeclaration',
+        FunctionExpression: 'FunctionExpression',
+        GeneratorExpression: 'GeneratorExpression',  // CAUTION: It's deferred to ES7.
+        Identifier: 'Identifier',
+        IfStatement: 'IfStatement',
+        ImportExpression: 'ImportExpression',
+        ImportDeclaration: 'ImportDeclaration',
+        ImportDefaultSpecifier: 'ImportDefaultSpecifier',
+        ImportNamespaceSpecifier: 'ImportNamespaceSpecifier',
+        ImportSpecifier: 'ImportSpecifier',
+        Literal: 'Literal',
+        LabeledStatement: 'LabeledStatement',
+        LogicalExpression: 'LogicalExpression',
+        MemberExpression: 'MemberExpression',
+        MetaProperty: 'MetaProperty',
+        MethodDefinition: 'MethodDefinition',
+        ModuleSpecifier: 'ModuleSpecifier',
+        NewExpression: 'NewExpression',
+        ObjectExpression: 'ObjectExpression',
+        ObjectPattern: 'ObjectPattern',
+        PrivateIdentifier: 'PrivateIdentifier',
+        Program: 'Program',
+        Property: 'Property',
+        PropertyDefinition: 'PropertyDefinition',
+        RestElement: 'RestElement',
+        ReturnStatement: 'ReturnStatement',
+        SequenceExpression: 'SequenceExpression',
+        SpreadElement: 'SpreadElement',
+        Super: 'Super',
+        SwitchStatement: 'SwitchStatement',
+        SwitchCase: 'SwitchCase',
+        TaggedTemplateExpression: 'TaggedTemplateExpression',
+        TemplateElement: 'TemplateElement',
+        TemplateLiteral: 'TemplateLiteral',
+        ThisExpression: 'ThisExpression',
+        ThrowStatement: 'ThrowStatement',
+        TryStatement: 'TryStatement',
+        UnaryExpression: 'UnaryExpression',
+        UpdateExpression: 'UpdateExpression',
+        VariableDeclaration: 'VariableDeclaration',
+        VariableDeclarator: 'VariableDeclarator',
+        WhileStatement: 'WhileStatement',
+        WithStatement: 'WithStatement',
+        YieldExpression: 'YieldExpression'
+    };
+
+    VisitorKeys = {
+        AssignmentExpression: ['left', 'right'],
+        AssignmentPattern: ['left', 'right'],
+        ArrayExpression: ['elements'],
+        ArrayPattern: ['elements'],
+        ArrowFunctionExpression: ['params', 'body'],
+        AwaitExpression: ['argument'], // CAUTION: It's deferred to ES7.
+        BlockStatement: ['body'],
+        BinaryExpression: ['left', 'right'],
+        BreakStatement: ['label'],
+        CallExpression: ['callee', 'arguments'],
+        CatchClause: ['param', 'body'],
+        ChainExpression: ['expression'],
+        ClassBody: ['body'],
+        ClassDeclaration: ['id', 'superClass', 'body'],
+        ClassExpression: ['id', 'superClass', 'body'],
+        ComprehensionBlock: ['left', 'right'],  // CAUTION: It's deferred to ES7.
+        ComprehensionExpression: ['blocks', 'filter', 'body'],  // CAUTION: It's deferred to ES7.
+        ConditionalExpression: ['test', 'consequent', 'alternate'],
+        ContinueStatement: ['label'],
+        DebuggerStatement: [],
+        DirectiveStatement: [],
+        DoWhileStatement: ['body', 'test'],
+        EmptyStatement: [],
+        ExportAllDeclaration: ['source'],
+        ExportDefaultDeclaration: ['declaration'],
+        ExportNamedDeclaration: ['declaration', 'specifiers', 'source'],
+        ExportSpecifier: ['exported', 'local'],
+        ExpressionStatement: ['expression'],
+        ForStatement: ['init', 'test', 'update', 'body'],
+        ForInStatement: ['left', 'right', 'body'],
+        ForOfStatement: ['left', 'right', 'body'],
+        FunctionDeclaration: ['id', 'params', 'body'],
+        FunctionExpression: ['id', 'params', 'body'],
+        GeneratorExpression: ['blocks', 'filter', 'body'],  // CAUTION: It's deferred to ES7.
+        Identifier: [],
+        IfStatement: ['test', 'consequent', 'alternate'],
+        ImportExpression: ['source'],
+        ImportDeclaration: ['specifiers', 'source'],
+        ImportDefaultSpecifier: ['local'],
+        ImportNamespaceSpecifier: ['local'],
+        ImportSpecifier: ['imported', 'local'],
+        Literal: [],
+        LabeledStatement: ['label', 'body'],
+        LogicalExpression: ['left', 'right'],
+        MemberExpression: ['object', 'property'],
+        MetaProperty: ['meta', 'property'],
+        MethodDefinition: ['key', 'value'],
+        ModuleSpecifier: [],
+        NewExpression: ['callee', 'arguments'],
+        ObjectExpression: ['properties'],
+        ObjectPattern: ['properties'],
+        PrivateIdentifier: [],
+        Program: ['body'],
+        Property: ['key', 'value'],
+        PropertyDefinition: ['key', 'value'],
+        RestElement: [ 'argument' ],
+        ReturnStatement: ['argument'],
+        SequenceExpression: ['expressions'],
+        SpreadElement: ['argument'],
+        Super: [],
+        SwitchStatement: ['discriminant', 'cases'],
+        SwitchCase: ['test', 'consequent'],
+        TaggedTemplateExpression: ['tag', 'quasi'],
+        TemplateElement: [],
+        TemplateLiteral: ['quasis', 'expressions'],
+        ThisExpression: [],
+        ThrowStatement: ['argument'],
+        TryStatement: ['block', 'handler', 'finalizer'],
+        UnaryExpression: ['argument'],
+        UpdateExpression: ['argument'],
+        VariableDeclaration: ['declarations'],
+        VariableDeclarator: ['id', 'init'],
+        WhileStatement: ['test', 'body'],
+        WithStatement: ['object', 'body'],
+        YieldExpression: ['argument']
+    };
+
+    // unique id
+    BREAK = {};
+    SKIP = {};
+    REMOVE = {};
+
+    VisitorOption = {
+        Break: BREAK,
+        Skip: SKIP,
+        Remove: REMOVE
+    };
+
+    function Reference(parent, key) {
+        this.parent = parent;
+        this.key = key;
+    }
+
+    Reference.prototype.replace = function replace(node) {
+        this.parent[this.key] = node;
+    };
+
+    Reference.prototype.remove = function remove() {
+        if (Array.isArray(this.parent)) {
+            this.parent.splice(this.key, 1);
+            return true;
+        } else {
+            this.replace(null);
+            return false;
+        }
+    };
+
+    function Element(node, path, wrap, ref) {
+        this.node = node;
+        this.path = path;
+        this.wrap = wrap;
+        this.ref = ref;
+    }
+
+    function Controller() { }
+
+    // API:
+    // return property path array from root to current node
+    Controller.prototype.path = function path() {
+        var i, iz, j, jz, result, element;
+
+        function addToPath(result, path) {
+            if (Array.isArray(path)) {
+                for (j = 0, jz = path.length; j < jz; ++j) {
+                    result.push(path[j]);
+                }
+            } else {
+                result.push(path);
+            }
+        }
+
+        // root node
+        if (!this.__current.path) {
+            return null;
+        }
+
+        // first node is sentinel, second node is root element
+        result = [];
+        for (i = 2, iz = this.__leavelist.length; i < iz; ++i) {
+            element = this.__leavelist[i];
+            addToPath(result, element.path);
+        }
+        addToPath(result, this.__current.path);
+        return result;
+    };
+
+    // API:
+    // return type of current node
+    Controller.prototype.type = function () {
+        var node = this.current();
+        return node.type || this.__current.wrap;
+    };
+
+    // API:
+    // return array of parent elements
+    Controller.prototype.parents = function parents() {
+        var i, iz, result;
+
+        // first node is sentinel
+        result = [];
+        for (i = 1, iz = this.__leavelist.length; i < iz; ++i) {
+            result.push(this.__leavelist[i].node);
+        }
+
+        return result;
+    };
+
+    // API:
+    // return current node
+    Controller.prototype.current = function current() {
+        return this.__current.node;
+    };
+
+    Controller.prototype.__execute = function __execute(callback, element) {
+        var previous, result;
+
+        result = undefined;
+
+        previous  = this.__current;
+        this.__current = element;
+        this.__state = null;
+        if (callback) {
+            result = callback.call(this, element.node, this.__leavelist[this.__leavelist.length - 1].node);
+        }
+        this.__current = previous;
+
+        return result;
+    };
+
+    // API:
+    // notify control skip / break
+    Controller.prototype.notify = function notify(flag) {
+        this.__state = flag;
+    };
+
+    // API:
+    // skip child nodes of current node
+    Controller.prototype.skip = function () {
+        this.notify(SKIP);
+    };
+
+    // API:
+    // break traversals
+    Controller.prototype['break'] = function () {
+        this.notify(BREAK);
+    };
+
+    // API:
+    // remove node
+    Controller.prototype.remove = function () {
+        this.notify(REMOVE);
+    };
+
+    Controller.prototype.__initialize = function(root, visitor) {
+        this.visitor = visitor;
+        this.root = root;
+        this.__worklist = [];
+        this.__leavelist = [];
+        this.__current = null;
+        this.__state = null;
+        this.__fallback = null;
+        if (visitor.fallback === 'iteration') {
+            this.__fallback = Object.keys;
+        } else if (typeof visitor.fallback === 'function') {
+            this.__fallback = visitor.fallback;
+        }
+
+        this.__keys = VisitorKeys;
+        if (visitor.keys) {
+            this.__keys = Object.assign(Object.create(this.__keys), visitor.keys);
+        }
+    };
+
+    function isNode(node) {
+        if (node == null) {
+            return false;
+        }
+        return typeof node === 'object' && typeof node.type === 'string';
+    }
+
+    function isProperty(nodeType, key) {
+        return (nodeType === Syntax.ObjectExpression || nodeType === Syntax.ObjectPattern) && 'properties' === key;
+    }
+  
+    function candidateExistsInLeaveList(leavelist, candidate) {
+        for (var i = leavelist.length - 1; i >= 0; --i) {
+            if (leavelist[i].node === candidate) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    Controller.prototype.traverse = function traverse(root, visitor) {
+        var worklist,
+            leavelist,
+            element,
+            node,
+            nodeType,
+            ret,
+            key,
+            current,
+            current2,
+            candidates,
+            candidate,
+            sentinel;
+
+        this.__initialize(root, visitor);
+
+        sentinel = {};
+
+        // reference
+        worklist = this.__worklist;
+        leavelist = this.__leavelist;
+
+        // initialize
+        worklist.push(new Element(root, null, null, null));
+        leavelist.push(new Element(null, null, null, null));
+
+        while (worklist.length) {
+            element = worklist.pop();
+
+            if (element === sentinel) {
+                element = leavelist.pop();
+
+                ret = this.__execute(visitor.leave, element);
+
+                if (this.__state === BREAK || ret === BREAK) {
+                    return;
+                }
+                continue;
+            }
+
+            if (element.node) {
+
+                ret = this.__execute(visitor.enter, element);
+
+                if (this.__state === BREAK || ret === BREAK) {
+                    return;
+                }
+
+                worklist.push(sentinel);
+                leavelist.push(element);
+
+                if (this.__state === SKIP || ret === SKIP) {
+                    continue;
+                }
+
+                node = element.node;
+                nodeType = node.type || element.wrap;
+                candidates = this.__keys[nodeType];
+                if (!candidates) {
+                    if (this.__fallback) {
+                        candidates = this.__fallback(node);
+                    } else {
+                        throw new Error('Unknown node type ' + nodeType + '.');
+                    }
+                }
+
+                current = candidates.length;
+                while ((current -= 1) >= 0) {
+                    key = candidates[current];
+                    candidate = node[key];
+                    if (!candidate) {
+                        continue;
+                    }
+
+                    if (Array.isArray(candidate)) {
+                        current2 = candidate.length;
+                        while ((current2 -= 1) >= 0) {
+                            if (!candidate[current2]) {
+                                continue;
+                            }
+
+                            if (candidateExistsInLeaveList(leavelist, candidate[current2])) {
+                              continue;
+                            }
+
+                            if (isProperty(nodeType, candidates[current])) {
+                                element = new Element(candidate[current2], [key, current2], 'Property', null);
+                            } else if (isNode(candidate[current2])) {
+                                element = new Element(candidate[current2], [key, current2], null, null);
+                            } else {
+                                continue;
+                            }
+                            worklist.push(element);
+                        }
+                    } else if (isNode(candidate)) {
+                        if (candidateExistsInLeaveList(leavelist, candidate)) {
+                          continue;
+                        }
+
+                        worklist.push(new Element(candidate, key, null, null));
+                    }
+                }
+            }
+        }
+    };
+
+    Controller.prototype.replace = function replace(root, visitor) {
+        var worklist,
+            leavelist,
+            node,
+            nodeType,
+            target,
+            element,
+            current,
+            current2,
+            candidates,
+            candidate,
+            sentinel,
+            outer,
+            key;
+
+        function removeElem(element) {
+            var i,
+                key,
+                nextElem,
+                parent;
+
+            if (element.ref.remove()) {
+                // When the reference is an element of an array.
+                key = element.ref.key;
+                parent = element.ref.parent;
+
+                // If removed from array, then decrease following items' keys.
+                i = worklist.length;
+                while (i--) {
+                    nextElem = worklist[i];
+                    if (nextElem.ref && nextElem.ref.parent === parent) {
+                        if  (nextElem.ref.key < key) {
+                            break;
+                        }
+                        --nextElem.ref.key;
+                    }
+                }
+            }
+        }
+
+        this.__initialize(root, visitor);
+
+        sentinel = {};
+
+        // reference
+        worklist = this.__worklist;
+        leavelist = this.__leavelist;
+
+        // initialize
+        outer = {
+            root: root
+        };
+        element = new Element(root, null, null, new Reference(outer, 'root'));
+        worklist.push(element);
+        leavelist.push(element);
+
+        while (worklist.length) {
+            element = worklist.pop();
+
+            if (element === sentinel) {
+                element = leavelist.pop();
+
+                target = this.__execute(visitor.leave, element);
+
+                // node may be replaced with null,
+                // so distinguish between undefined and null in this place
+                if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {
+                    // replace
+                    element.ref.replace(target);
+                }
+
+                if (this.__state === REMOVE || target === REMOVE) {
+                    removeElem(element);
+                }
+
+                if (this.__state === BREAK || target === BREAK) {
+                    return outer.root;
+                }
+                continue;
+            }
+
+            target = this.__execute(visitor.enter, element);
+
+            // node may be replaced with null,
+            // so distinguish between undefined and null in this place
+            if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {
+                // replace
+                element.ref.replace(target);
+                element.node = target;
+            }
+
+            if (this.__state === REMOVE || target === REMOVE) {
+                removeElem(element);
+                element.node = null;
+            }
+
+            if (this.__state === BREAK || target === BREAK) {
+                return outer.root;
+            }
+
+            // node may be null
+            node = element.node;
+            if (!node) {
+                continue;
+            }
+
+            worklist.push(sentinel);
+            leavelist.push(element);
+
+            if (this.__state === SKIP || target === SKIP) {
+                continue;
+            }
+
+            nodeType = node.type || element.wrap;
+            candidates = this.__keys[nodeType];
+            if (!candidates) {
+                if (this.__fallback) {
+                    candidates = this.__fallback(node);
+                } else {
+                    throw new Error('Unknown node type ' + nodeType + '.');
+                }
+            }
+
+            current = candidates.length;
+            while ((current -= 1) >= 0) {
+                key = candidates[current];
+                candidate = node[key];
+                if (!candidate) {
+                    continue;
+                }
+
+                if (Array.isArray(candidate)) {
+                    current2 = candidate.length;
+                    while ((current2 -= 1) >= 0) {
+                        if (!candidate[current2]) {
+                            continue;
+                        }
+                        if (isProperty(nodeType, candidates[current])) {
+                            element = new Element(candidate[current2], [key, current2], 'Property', new Reference(candidate, current2));
+                        } else if (isNode(candidate[current2])) {
+                            element = new Element(candidate[current2], [key, current2], null, new Reference(candidate, current2));
+                        } else {
+                            continue;
+                        }
+                        worklist.push(element);
+                    }
+                } else if (isNode(candidate)) {
+                    worklist.push(new Element(candidate, key, null, new Reference(node, key)));
+                }
+            }
+        }
+
+        return outer.root;
+    };
+
+    function traverse(root, visitor) {
+        var controller = new Controller();
+        return controller.traverse(root, visitor);
+    }
+
+    function replace(root, visitor) {
+        var controller = new Controller();
+        return controller.replace(root, visitor);
+    }
+
+    function extendCommentRange(comment, tokens) {
+        var target;
+
+        target = upperBound(tokens, function search(token) {
+            return token.range[0] > comment.range[0];
+        });
+
+        comment.extendedRange = [comment.range[0], comment.range[1]];
+
+        if (target !== tokens.length) {
+            comment.extendedRange[1] = tokens[target].range[0];
+        }
+
+        target -= 1;
+        if (target >= 0) {
+            comment.extendedRange[0] = tokens[target].range[1];
+        }
+
+        return comment;
+    }
+
+    function attachComments(tree, providedComments, tokens) {
+        // At first, we should calculate extended comment ranges.
+        var comments = [], comment, len, i, cursor;
+
+        if (!tree.range) {
+            throw new Error('attachComments needs range information');
+        }
+
+        // tokens array is empty, we attach comments to tree as 'leadingComments'
+        if (!tokens.length) {
+            if (providedComments.length) {
+                for (i = 0, len = providedComments.length; i < len; i += 1) {
+                    comment = deepCopy(providedComments[i]);
+                    comment.extendedRange = [0, tree.range[0]];
+                    comments.push(comment);
+                }
+                tree.leadingComments = comments;
+            }
+            return tree;
+        }
+
+        for (i = 0, len = providedComments.length; i < len; i += 1) {
+            comments.push(extendCommentRange(deepCopy(providedComments[i]), tokens));
+        }
+
+        // This is based on John Freeman's implementation.
+        cursor = 0;
+        traverse(tree, {
+            enter: function (node) {
+                var comment;
+
+                while (cursor < comments.length) {
+                    comment = comments[cursor];
+                    if (comment.extendedRange[1] > node.range[0]) {
+                        break;
+                    }
+
+                    if (comment.extendedRange[1] === node.range[0]) {
+                        if (!node.leadingComments) {
+                            node.leadingComments = [];
+                        }
+                        node.leadingComments.push(comment);
+                        comments.splice(cursor, 1);
+                    } else {
+                        cursor += 1;
+                    }
+                }
+
+                // already out of owned node
+                if (cursor === comments.length) {
+                    return VisitorOption.Break;
+                }
+
+                if (comments[cursor].extendedRange[0] > node.range[1]) {
+                    return VisitorOption.Skip;
+                }
+            }
+        });
+
+        cursor = 0;
+        traverse(tree, {
+            leave: function (node) {
+                var comment;
+
+                while (cursor < comments.length) {
+                    comment = comments[cursor];
+                    if (node.range[1] < comment.extendedRange[0]) {
+                        break;
+                    }
+
+                    if (node.range[1] === comment.extendedRange[0]) {
+                        if (!node.trailingComments) {
+                            node.trailingComments = [];
+                        }
+                        node.trailingComments.push(comment);
+                        comments.splice(cursor, 1);
+                    } else {
+                        cursor += 1;
+                    }
+                }
+
+                // already out of owned node
+                if (cursor === comments.length) {
+                    return VisitorOption.Break;
+                }
+
+                if (comments[cursor].extendedRange[0] > node.range[1]) {
+                    return VisitorOption.Skip;
+                }
+            }
+        });
+
+        return tree;
+    }
+
+    exports.Syntax = Syntax;
+    exports.traverse = traverse;
+    exports.replace = replace;
+    exports.attachComments = attachComments;
+    exports.VisitorKeys = VisitorKeys;
+    exports.VisitorOption = VisitorOption;
+    exports.Controller = Controller;
+    exports.cloneEnvironment = function () { return clone({}); };
+
+    return exports;
+}(exports));
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/gulpfile.js b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/gulpfile.js
new file mode 100644
index 0000000..8772bbc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/gulpfile.js
@@ -0,0 +1,70 @@
+/*
+  Copyright (C) 2014 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS'
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+'use strict';
+
+var gulp = require('gulp'),
+    git = require('gulp-git'),
+    bump = require('gulp-bump'),
+    filter = require('gulp-filter'),
+    tagVersion = require('gulp-tag-version');
+
+var TEST = [ 'test/*.js' ];
+var POWERED = [ 'powered-test/*.js' ];
+var SOURCE = [ 'src/**/*.js' ];
+
+/**
+ * Bumping version number and tagging the repository with it.
+ * Please read http://semver.org/
+ *
+ * You can use the commands
+ *
+ *     gulp patch     # makes v0.1.0 -> v0.1.1
+ *     gulp feature   # makes v0.1.1 -> v0.2.0
+ *     gulp release   # makes v0.2.1 -> v1.0.0
+ *
+ * To bump the version numbers accordingly after you did a patch,
+ * introduced a feature or made a backwards-incompatible release.
+ */
+
+function inc(importance) {
+    // get all the files to bump version in
+    return gulp.src(['./package.json'])
+        // bump the version number in those files
+        .pipe(bump({type: importance}))
+        // save it back to filesystem
+        .pipe(gulp.dest('./'))
+        // commit the changed version number
+        .pipe(git.commit('Bumps package version'))
+        // read only one file to get the version number
+        .pipe(filter('package.json'))
+        // **tag it in the repository**
+        .pipe(tagVersion({
+            prefix: ''
+        }));
+}
+
+gulp.task('patch', [ ], function () { return inc('patch'); })
+gulp.task('minor', [ ], function () { return inc('minor'); })
+gulp.task('major', [ ], function () { return inc('major'); })
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/package.json b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/package.json
new file mode 100644
index 0000000..a863218
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/node_modules/estraverse/package.json
@@ -0,0 +1,40 @@
+{
+  "name": "estraverse",
+  "description": "ECMAScript JS AST traversal functions",
+  "homepage": "https://github.com/estools/estraverse",
+  "main": "estraverse.js",
+  "version": "5.3.0",
+  "engines": {
+    "node": ">=4.0"
+  },
+  "maintainers": [
+    {
+      "name": "Yusuke Suzuki",
+      "email": "utatane.tea@gmail.com",
+      "web": "http://github.com/Constellation"
+    }
+  ],
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/estools/estraverse.git"
+  },
+  "devDependencies": {
+    "babel-preset-env": "^1.6.1",
+    "babel-register": "^6.3.13",
+    "chai": "^2.1.1",
+    "espree": "^1.11.0",
+    "gulp": "^3.8.10",
+    "gulp-bump": "^0.2.2",
+    "gulp-filter": "^2.0.0",
+    "gulp-git": "^1.0.1",
+    "gulp-tag-version": "^1.3.0",
+    "jshint": "^2.5.6",
+    "mocha": "^2.1.0"
+  },
+  "license": "BSD-2-Clause",
+  "scripts": {
+    "test": "npm run-script lint && npm run-script unit-test",
+    "lint": "jshint estraverse.js",
+    "unit-test": "mocha --compilers js:babel-register"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/esrecurse/package.json b/node_modules/mathjs/examples/node_modules/esrecurse/package.json
new file mode 100644
index 0000000..dec5b1b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/esrecurse/package.json
@@ -0,0 +1,52 @@
+{
+  "name": "esrecurse",
+  "description": "ECMAScript AST recursive visitor",
+  "homepage": "https://github.com/estools/esrecurse",
+  "main": "esrecurse.js",
+  "version": "4.3.0",
+  "engines": {
+    "node": ">=4.0"
+  },
+  "maintainers": [
+    {
+      "name": "Yusuke Suzuki",
+      "email": "utatane.tea@gmail.com",
+      "web": "https://github.com/Constellation"
+    }
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/estools/esrecurse.git"
+  },
+  "dependencies": {
+    "estraverse": "^5.2.0"
+  },
+  "devDependencies": {
+    "babel-cli": "^6.24.1",
+    "babel-eslint": "^7.2.3",
+    "babel-preset-es2015": "^6.24.1",
+    "babel-register": "^6.24.1",
+    "chai": "^4.0.2",
+    "esprima": "^4.0.0",
+    "gulp": "^3.9.0",
+    "gulp-bump": "^2.7.0",
+    "gulp-eslint": "^4.0.0",
+    "gulp-filter": "^5.0.0",
+    "gulp-git": "^2.4.1",
+    "gulp-mocha": "^4.3.1",
+    "gulp-tag-version": "^1.2.1",
+    "jsdoc": "^3.3.0-alpha10",
+    "minimist": "^1.1.0"
+  },
+  "license": "BSD-2-Clause",
+  "scripts": {
+    "test": "gulp travis",
+    "unit-test": "gulp test",
+    "lint": "gulp lint"
+  },
+  "babel": {
+    "presets": [
+      "es2015"
+    ]
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/estraverse/.jshintrc b/node_modules/mathjs/examples/node_modules/estraverse/.jshintrc
new file mode 100644
index 0000000..f642dae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/estraverse/.jshintrc
@@ -0,0 +1,16 @@
+{
+  "curly": true,
+  "eqeqeq": true,
+  "immed": true,
+  "eqnull": true,
+  "latedef": true,
+  "noarg": true,
+  "noempty": true,
+  "quotmark": "single",
+  "undef": true,
+  "unused": true,
+  "strict": true,
+  "trailing": true,
+
+  "node": true
+}
diff --git a/node_modules/mathjs/examples/node_modules/estraverse/LICENSE.BSD b/node_modules/mathjs/examples/node_modules/estraverse/LICENSE.BSD
new file mode 100644
index 0000000..3e580c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/estraverse/LICENSE.BSD
@@ -0,0 +1,19 @@
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/estraverse/README.md b/node_modules/mathjs/examples/node_modules/estraverse/README.md
new file mode 100644
index 0000000..ccd3377
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/estraverse/README.md
@@ -0,0 +1,153 @@
+### Estraverse [![Build Status](https://secure.travis-ci.org/estools/estraverse.svg)](http://travis-ci.org/estools/estraverse)
+
+Estraverse ([estraverse](http://github.com/estools/estraverse)) is
+[ECMAScript](http://www.ecma-international.org/publications/standards/Ecma-262.htm)
+traversal functions from [esmangle project](http://github.com/estools/esmangle).
+
+### Documentation
+
+You can find usage docs at [wiki page](https://github.com/estools/estraverse/wiki/Usage).
+
+### Example Usage
+
+The following code will output all variables declared at the root of a file.
+
+```javascript
+estraverse.traverse(ast, {
+    enter: function (node, parent) {
+        if (node.type == 'FunctionExpression' || node.type == 'FunctionDeclaration')
+            return estraverse.VisitorOption.Skip;
+    },
+    leave: function (node, parent) {
+        if (node.type == 'VariableDeclarator')
+          console.log(node.id.name);
+    }
+});
+```
+
+We can use `this.skip`, `this.remove` and `this.break` functions instead of using Skip, Remove and Break.
+
+```javascript
+estraverse.traverse(ast, {
+    enter: function (node) {
+        this.break();
+    }
+});
+```
+
+And estraverse provides `estraverse.replace` function. When returning node from `enter`/`leave`, current node is replaced with it.
+
+```javascript
+result = estraverse.replace(tree, {
+    enter: function (node) {
+        // Replace it with replaced.
+        if (node.type === 'Literal')
+            return replaced;
+    }
+});
+```
+
+By passing `visitor.keys` mapping, we can extend estraverse traversing functionality.
+
+```javascript
+// This tree contains a user-defined `TestExpression` node.
+var tree = {
+    type: 'TestExpression',
+
+    // This 'argument' is the property containing the other **node**.
+    argument: {
+        type: 'Literal',
+        value: 20
+    },
+
+    // This 'extended' is the property not containing the other **node**.
+    extended: true
+};
+estraverse.traverse(tree, {
+    enter: function (node) { },
+
+    // Extending the existing traversing rules.
+    keys: {
+        // TargetNodeName: [ 'keys', 'containing', 'the', 'other', '**node**' ]
+        TestExpression: ['argument']
+    }
+});
+```
+
+By passing `visitor.fallback` option, we can control the behavior when encountering unknown nodes.
+
+```javascript
+// This tree contains a user-defined `TestExpression` node.
+var tree = {
+    type: 'TestExpression',
+
+    // This 'argument' is the property containing the other **node**.
+    argument: {
+        type: 'Literal',
+        value: 20
+    },
+
+    // This 'extended' is the property not containing the other **node**.
+    extended: true
+};
+estraverse.traverse(tree, {
+    enter: function (node) { },
+
+    // Iterating the child **nodes** of unknown nodes.
+    fallback: 'iteration'
+});
+```
+
+When `visitor.fallback` is a function, we can determine which keys to visit on each node.
+
+```javascript
+// This tree contains a user-defined `TestExpression` node.
+var tree = {
+    type: 'TestExpression',
+
+    // This 'argument' is the property containing the other **node**.
+    argument: {
+        type: 'Literal',
+        value: 20
+    },
+
+    // This 'extended' is the property not containing the other **node**.
+    extended: true
+};
+estraverse.traverse(tree, {
+    enter: function (node) { },
+
+    // Skip the `argument` property of each node
+    fallback: function(node) {
+        return Object.keys(node).filter(function(key) {
+            return key !== 'argument';
+        });
+    }
+});
+```
+
+### License
+
+Copyright (C) 2012-2016 [Yusuke Suzuki](http://github.com/Constellation)
+ (twitter: [@Constellation](http://twitter.com/Constellation)) and other contributors.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/estraverse/estraverse.js b/node_modules/mathjs/examples/node_modules/estraverse/estraverse.js
new file mode 100644
index 0000000..b106d38
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/estraverse/estraverse.js
@@ -0,0 +1,782 @@
+/*
+  Copyright (C) 2012-2013 Yusuke Suzuki <utatane.tea@gmail.com>
+  Copyright (C) 2012 Ariya Hidayat <ariya.hidayat@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+/*jslint vars:false, bitwise:true*/
+/*jshint indent:4*/
+/*global exports:true*/
+(function clone(exports) {
+    'use strict';
+
+    var Syntax,
+        VisitorOption,
+        VisitorKeys,
+        BREAK,
+        SKIP,
+        REMOVE;
+
+    function deepCopy(obj) {
+        var ret = {}, key, val;
+        for (key in obj) {
+            if (obj.hasOwnProperty(key)) {
+                val = obj[key];
+                if (typeof val === 'object' && val !== null) {
+                    ret[key] = deepCopy(val);
+                } else {
+                    ret[key] = val;
+                }
+            }
+        }
+        return ret;
+    }
+
+    // based on LLVM libc++ upper_bound / lower_bound
+    // MIT License
+
+    function upperBound(array, func) {
+        var diff, len, i, current;
+
+        len = array.length;
+        i = 0;
+
+        while (len) {
+            diff = len >>> 1;
+            current = i + diff;
+            if (func(array[current])) {
+                len = diff;
+            } else {
+                i = current + 1;
+                len -= diff + 1;
+            }
+        }
+        return i;
+    }
+
+    Syntax = {
+        AssignmentExpression: 'AssignmentExpression',
+        AssignmentPattern: 'AssignmentPattern',
+        ArrayExpression: 'ArrayExpression',
+        ArrayPattern: 'ArrayPattern',
+        ArrowFunctionExpression: 'ArrowFunctionExpression',
+        AwaitExpression: 'AwaitExpression', // CAUTION: It's deferred to ES7.
+        BlockStatement: 'BlockStatement',
+        BinaryExpression: 'BinaryExpression',
+        BreakStatement: 'BreakStatement',
+        CallExpression: 'CallExpression',
+        CatchClause: 'CatchClause',
+        ClassBody: 'ClassBody',
+        ClassDeclaration: 'ClassDeclaration',
+        ClassExpression: 'ClassExpression',
+        ComprehensionBlock: 'ComprehensionBlock',  // CAUTION: It's deferred to ES7.
+        ComprehensionExpression: 'ComprehensionExpression',  // CAUTION: It's deferred to ES7.
+        ConditionalExpression: 'ConditionalExpression',
+        ContinueStatement: 'ContinueStatement',
+        DebuggerStatement: 'DebuggerStatement',
+        DirectiveStatement: 'DirectiveStatement',
+        DoWhileStatement: 'DoWhileStatement',
+        EmptyStatement: 'EmptyStatement',
+        ExportAllDeclaration: 'ExportAllDeclaration',
+        ExportDefaultDeclaration: 'ExportDefaultDeclaration',
+        ExportNamedDeclaration: 'ExportNamedDeclaration',
+        ExportSpecifier: 'ExportSpecifier',
+        ExpressionStatement: 'ExpressionStatement',
+        ForStatement: 'ForStatement',
+        ForInStatement: 'ForInStatement',
+        ForOfStatement: 'ForOfStatement',
+        FunctionDeclaration: 'FunctionDeclaration',
+        FunctionExpression: 'FunctionExpression',
+        GeneratorExpression: 'GeneratorExpression',  // CAUTION: It's deferred to ES7.
+        Identifier: 'Identifier',
+        IfStatement: 'IfStatement',
+        ImportExpression: 'ImportExpression',
+        ImportDeclaration: 'ImportDeclaration',
+        ImportDefaultSpecifier: 'ImportDefaultSpecifier',
+        ImportNamespaceSpecifier: 'ImportNamespaceSpecifier',
+        ImportSpecifier: 'ImportSpecifier',
+        Literal: 'Literal',
+        LabeledStatement: 'LabeledStatement',
+        LogicalExpression: 'LogicalExpression',
+        MemberExpression: 'MemberExpression',
+        MetaProperty: 'MetaProperty',
+        MethodDefinition: 'MethodDefinition',
+        ModuleSpecifier: 'ModuleSpecifier',
+        NewExpression: 'NewExpression',
+        ObjectExpression: 'ObjectExpression',
+        ObjectPattern: 'ObjectPattern',
+        Program: 'Program',
+        Property: 'Property',
+        RestElement: 'RestElement',
+        ReturnStatement: 'ReturnStatement',
+        SequenceExpression: 'SequenceExpression',
+        SpreadElement: 'SpreadElement',
+        Super: 'Super',
+        SwitchStatement: 'SwitchStatement',
+        SwitchCase: 'SwitchCase',
+        TaggedTemplateExpression: 'TaggedTemplateExpression',
+        TemplateElement: 'TemplateElement',
+        TemplateLiteral: 'TemplateLiteral',
+        ThisExpression: 'ThisExpression',
+        ThrowStatement: 'ThrowStatement',
+        TryStatement: 'TryStatement',
+        UnaryExpression: 'UnaryExpression',
+        UpdateExpression: 'UpdateExpression',
+        VariableDeclaration: 'VariableDeclaration',
+        VariableDeclarator: 'VariableDeclarator',
+        WhileStatement: 'WhileStatement',
+        WithStatement: 'WithStatement',
+        YieldExpression: 'YieldExpression'
+    };
+
+    VisitorKeys = {
+        AssignmentExpression: ['left', 'right'],
+        AssignmentPattern: ['left', 'right'],
+        ArrayExpression: ['elements'],
+        ArrayPattern: ['elements'],
+        ArrowFunctionExpression: ['params', 'body'],
+        AwaitExpression: ['argument'], // CAUTION: It's deferred to ES7.
+        BlockStatement: ['body'],
+        BinaryExpression: ['left', 'right'],
+        BreakStatement: ['label'],
+        CallExpression: ['callee', 'arguments'],
+        CatchClause: ['param', 'body'],
+        ClassBody: ['body'],
+        ClassDeclaration: ['id', 'superClass', 'body'],
+        ClassExpression: ['id', 'superClass', 'body'],
+        ComprehensionBlock: ['left', 'right'],  // CAUTION: It's deferred to ES7.
+        ComprehensionExpression: ['blocks', 'filter', 'body'],  // CAUTION: It's deferred to ES7.
+        ConditionalExpression: ['test', 'consequent', 'alternate'],
+        ContinueStatement: ['label'],
+        DebuggerStatement: [],
+        DirectiveStatement: [],
+        DoWhileStatement: ['body', 'test'],
+        EmptyStatement: [],
+        ExportAllDeclaration: ['source'],
+        ExportDefaultDeclaration: ['declaration'],
+        ExportNamedDeclaration: ['declaration', 'specifiers', 'source'],
+        ExportSpecifier: ['exported', 'local'],
+        ExpressionStatement: ['expression'],
+        ForStatement: ['init', 'test', 'update', 'body'],
+        ForInStatement: ['left', 'right', 'body'],
+        ForOfStatement: ['left', 'right', 'body'],
+        FunctionDeclaration: ['id', 'params', 'body'],
+        FunctionExpression: ['id', 'params', 'body'],
+        GeneratorExpression: ['blocks', 'filter', 'body'],  // CAUTION: It's deferred to ES7.
+        Identifier: [],
+        IfStatement: ['test', 'consequent', 'alternate'],
+        ImportExpression: ['source'],
+        ImportDeclaration: ['specifiers', 'source'],
+        ImportDefaultSpecifier: ['local'],
+        ImportNamespaceSpecifier: ['local'],
+        ImportSpecifier: ['imported', 'local'],
+        Literal: [],
+        LabeledStatement: ['label', 'body'],
+        LogicalExpression: ['left', 'right'],
+        MemberExpression: ['object', 'property'],
+        MetaProperty: ['meta', 'property'],
+        MethodDefinition: ['key', 'value'],
+        ModuleSpecifier: [],
+        NewExpression: ['callee', 'arguments'],
+        ObjectExpression: ['properties'],
+        ObjectPattern: ['properties'],
+        Program: ['body'],
+        Property: ['key', 'value'],
+        RestElement: [ 'argument' ],
+        ReturnStatement: ['argument'],
+        SequenceExpression: ['expressions'],
+        SpreadElement: ['argument'],
+        Super: [],
+        SwitchStatement: ['discriminant', 'cases'],
+        SwitchCase: ['test', 'consequent'],
+        TaggedTemplateExpression: ['tag', 'quasi'],
+        TemplateElement: [],
+        TemplateLiteral: ['quasis', 'expressions'],
+        ThisExpression: [],
+        ThrowStatement: ['argument'],
+        TryStatement: ['block', 'handler', 'finalizer'],
+        UnaryExpression: ['argument'],
+        UpdateExpression: ['argument'],
+        VariableDeclaration: ['declarations'],
+        VariableDeclarator: ['id', 'init'],
+        WhileStatement: ['test', 'body'],
+        WithStatement: ['object', 'body'],
+        YieldExpression: ['argument']
+    };
+
+    // unique id
+    BREAK = {};
+    SKIP = {};
+    REMOVE = {};
+
+    VisitorOption = {
+        Break: BREAK,
+        Skip: SKIP,
+        Remove: REMOVE
+    };
+
+    function Reference(parent, key) {
+        this.parent = parent;
+        this.key = key;
+    }
+
+    Reference.prototype.replace = function replace(node) {
+        this.parent[this.key] = node;
+    };
+
+    Reference.prototype.remove = function remove() {
+        if (Array.isArray(this.parent)) {
+            this.parent.splice(this.key, 1);
+            return true;
+        } else {
+            this.replace(null);
+            return false;
+        }
+    };
+
+    function Element(node, path, wrap, ref) {
+        this.node = node;
+        this.path = path;
+        this.wrap = wrap;
+        this.ref = ref;
+    }
+
+    function Controller() { }
+
+    // API:
+    // return property path array from root to current node
+    Controller.prototype.path = function path() {
+        var i, iz, j, jz, result, element;
+
+        function addToPath(result, path) {
+            if (Array.isArray(path)) {
+                for (j = 0, jz = path.length; j < jz; ++j) {
+                    result.push(path[j]);
+                }
+            } else {
+                result.push(path);
+            }
+        }
+
+        // root node
+        if (!this.__current.path) {
+            return null;
+        }
+
+        // first node is sentinel, second node is root element
+        result = [];
+        for (i = 2, iz = this.__leavelist.length; i < iz; ++i) {
+            element = this.__leavelist[i];
+            addToPath(result, element.path);
+        }
+        addToPath(result, this.__current.path);
+        return result;
+    };
+
+    // API:
+    // return type of current node
+    Controller.prototype.type = function () {
+        var node = this.current();
+        return node.type || this.__current.wrap;
+    };
+
+    // API:
+    // return array of parent elements
+    Controller.prototype.parents = function parents() {
+        var i, iz, result;
+
+        // first node is sentinel
+        result = [];
+        for (i = 1, iz = this.__leavelist.length; i < iz; ++i) {
+            result.push(this.__leavelist[i].node);
+        }
+
+        return result;
+    };
+
+    // API:
+    // return current node
+    Controller.prototype.current = function current() {
+        return this.__current.node;
+    };
+
+    Controller.prototype.__execute = function __execute(callback, element) {
+        var previous, result;
+
+        result = undefined;
+
+        previous  = this.__current;
+        this.__current = element;
+        this.__state = null;
+        if (callback) {
+            result = callback.call(this, element.node, this.__leavelist[this.__leavelist.length - 1].node);
+        }
+        this.__current = previous;
+
+        return result;
+    };
+
+    // API:
+    // notify control skip / break
+    Controller.prototype.notify = function notify(flag) {
+        this.__state = flag;
+    };
+
+    // API:
+    // skip child nodes of current node
+    Controller.prototype.skip = function () {
+        this.notify(SKIP);
+    };
+
+    // API:
+    // break traversals
+    Controller.prototype['break'] = function () {
+        this.notify(BREAK);
+    };
+
+    // API:
+    // remove node
+    Controller.prototype.remove = function () {
+        this.notify(REMOVE);
+    };
+
+    Controller.prototype.__initialize = function(root, visitor) {
+        this.visitor = visitor;
+        this.root = root;
+        this.__worklist = [];
+        this.__leavelist = [];
+        this.__current = null;
+        this.__state = null;
+        this.__fallback = null;
+        if (visitor.fallback === 'iteration') {
+            this.__fallback = Object.keys;
+        } else if (typeof visitor.fallback === 'function') {
+            this.__fallback = visitor.fallback;
+        }
+
+        this.__keys = VisitorKeys;
+        if (visitor.keys) {
+            this.__keys = Object.assign(Object.create(this.__keys), visitor.keys);
+        }
+    };
+
+    function isNode(node) {
+        if (node == null) {
+            return false;
+        }
+        return typeof node === 'object' && typeof node.type === 'string';
+    }
+
+    function isProperty(nodeType, key) {
+        return (nodeType === Syntax.ObjectExpression || nodeType === Syntax.ObjectPattern) && 'properties' === key;
+    }
+
+    Controller.prototype.traverse = function traverse(root, visitor) {
+        var worklist,
+            leavelist,
+            element,
+            node,
+            nodeType,
+            ret,
+            key,
+            current,
+            current2,
+            candidates,
+            candidate,
+            sentinel;
+
+        this.__initialize(root, visitor);
+
+        sentinel = {};
+
+        // reference
+        worklist = this.__worklist;
+        leavelist = this.__leavelist;
+
+        // initialize
+        worklist.push(new Element(root, null, null, null));
+        leavelist.push(new Element(null, null, null, null));
+
+        while (worklist.length) {
+            element = worklist.pop();
+
+            if (element === sentinel) {
+                element = leavelist.pop();
+
+                ret = this.__execute(visitor.leave, element);
+
+                if (this.__state === BREAK || ret === BREAK) {
+                    return;
+                }
+                continue;
+            }
+
+            if (element.node) {
+
+                ret = this.__execute(visitor.enter, element);
+
+                if (this.__state === BREAK || ret === BREAK) {
+                    return;
+                }
+
+                worklist.push(sentinel);
+                leavelist.push(element);
+
+                if (this.__state === SKIP || ret === SKIP) {
+                    continue;
+                }
+
+                node = element.node;
+                nodeType = node.type || element.wrap;
+                candidates = this.__keys[nodeType];
+                if (!candidates) {
+                    if (this.__fallback) {
+                        candidates = this.__fallback(node);
+                    } else {
+                        throw new Error('Unknown node type ' + nodeType + '.');
+                    }
+                }
+
+                current = candidates.length;
+                while ((current -= 1) >= 0) {
+                    key = candidates[current];
+                    candidate = node[key];
+                    if (!candidate) {
+                        continue;
+                    }
+
+                    if (Array.isArray(candidate)) {
+                        current2 = candidate.length;
+                        while ((current2 -= 1) >= 0) {
+                            if (!candidate[current2]) {
+                                continue;
+                            }
+                            if (isProperty(nodeType, candidates[current])) {
+                                element = new Element(candidate[current2], [key, current2], 'Property', null);
+                            } else if (isNode(candidate[current2])) {
+                                element = new Element(candidate[current2], [key, current2], null, null);
+                            } else {
+                                continue;
+                            }
+                            worklist.push(element);
+                        }
+                    } else if (isNode(candidate)) {
+                        worklist.push(new Element(candidate, key, null, null));
+                    }
+                }
+            }
+        }
+    };
+
+    Controller.prototype.replace = function replace(root, visitor) {
+        var worklist,
+            leavelist,
+            node,
+            nodeType,
+            target,
+            element,
+            current,
+            current2,
+            candidates,
+            candidate,
+            sentinel,
+            outer,
+            key;
+
+        function removeElem(element) {
+            var i,
+                key,
+                nextElem,
+                parent;
+
+            if (element.ref.remove()) {
+                // When the reference is an element of an array.
+                key = element.ref.key;
+                parent = element.ref.parent;
+
+                // If removed from array, then decrease following items' keys.
+                i = worklist.length;
+                while (i--) {
+                    nextElem = worklist[i];
+                    if (nextElem.ref && nextElem.ref.parent === parent) {
+                        if  (nextElem.ref.key < key) {
+                            break;
+                        }
+                        --nextElem.ref.key;
+                    }
+                }
+            }
+        }
+
+        this.__initialize(root, visitor);
+
+        sentinel = {};
+
+        // reference
+        worklist = this.__worklist;
+        leavelist = this.__leavelist;
+
+        // initialize
+        outer = {
+            root: root
+        };
+        element = new Element(root, null, null, new Reference(outer, 'root'));
+        worklist.push(element);
+        leavelist.push(element);
+
+        while (worklist.length) {
+            element = worklist.pop();
+
+            if (element === sentinel) {
+                element = leavelist.pop();
+
+                target = this.__execute(visitor.leave, element);
+
+                // node may be replaced with null,
+                // so distinguish between undefined and null in this place
+                if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {
+                    // replace
+                    element.ref.replace(target);
+                }
+
+                if (this.__state === REMOVE || target === REMOVE) {
+                    removeElem(element);
+                }
+
+                if (this.__state === BREAK || target === BREAK) {
+                    return outer.root;
+                }
+                continue;
+            }
+
+            target = this.__execute(visitor.enter, element);
+
+            // node may be replaced with null,
+            // so distinguish between undefined and null in this place
+            if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {
+                // replace
+                element.ref.replace(target);
+                element.node = target;
+            }
+
+            if (this.__state === REMOVE || target === REMOVE) {
+                removeElem(element);
+                element.node = null;
+            }
+
+            if (this.__state === BREAK || target === BREAK) {
+                return outer.root;
+            }
+
+            // node may be null
+            node = element.node;
+            if (!node) {
+                continue;
+            }
+
+            worklist.push(sentinel);
+            leavelist.push(element);
+
+            if (this.__state === SKIP || target === SKIP) {
+                continue;
+            }
+
+            nodeType = node.type || element.wrap;
+            candidates = this.__keys[nodeType];
+            if (!candidates) {
+                if (this.__fallback) {
+                    candidates = this.__fallback(node);
+                } else {
+                    throw new Error('Unknown node type ' + nodeType + '.');
+                }
+            }
+
+            current = candidates.length;
+            while ((current -= 1) >= 0) {
+                key = candidates[current];
+                candidate = node[key];
+                if (!candidate) {
+                    continue;
+                }
+
+                if (Array.isArray(candidate)) {
+                    current2 = candidate.length;
+                    while ((current2 -= 1) >= 0) {
+                        if (!candidate[current2]) {
+                            continue;
+                        }
+                        if (isProperty(nodeType, candidates[current])) {
+                            element = new Element(candidate[current2], [key, current2], 'Property', new Reference(candidate, current2));
+                        } else if (isNode(candidate[current2])) {
+                            element = new Element(candidate[current2], [key, current2], null, new Reference(candidate, current2));
+                        } else {
+                            continue;
+                        }
+                        worklist.push(element);
+                    }
+                } else if (isNode(candidate)) {
+                    worklist.push(new Element(candidate, key, null, new Reference(node, key)));
+                }
+            }
+        }
+
+        return outer.root;
+    };
+
+    function traverse(root, visitor) {
+        var controller = new Controller();
+        return controller.traverse(root, visitor);
+    }
+
+    function replace(root, visitor) {
+        var controller = new Controller();
+        return controller.replace(root, visitor);
+    }
+
+    function extendCommentRange(comment, tokens) {
+        var target;
+
+        target = upperBound(tokens, function search(token) {
+            return token.range[0] > comment.range[0];
+        });
+
+        comment.extendedRange = [comment.range[0], comment.range[1]];
+
+        if (target !== tokens.length) {
+            comment.extendedRange[1] = tokens[target].range[0];
+        }
+
+        target -= 1;
+        if (target >= 0) {
+            comment.extendedRange[0] = tokens[target].range[1];
+        }
+
+        return comment;
+    }
+
+    function attachComments(tree, providedComments, tokens) {
+        // At first, we should calculate extended comment ranges.
+        var comments = [], comment, len, i, cursor;
+
+        if (!tree.range) {
+            throw new Error('attachComments needs range information');
+        }
+
+        // tokens array is empty, we attach comments to tree as 'leadingComments'
+        if (!tokens.length) {
+            if (providedComments.length) {
+                for (i = 0, len = providedComments.length; i < len; i += 1) {
+                    comment = deepCopy(providedComments[i]);
+                    comment.extendedRange = [0, tree.range[0]];
+                    comments.push(comment);
+                }
+                tree.leadingComments = comments;
+            }
+            return tree;
+        }
+
+        for (i = 0, len = providedComments.length; i < len; i += 1) {
+            comments.push(extendCommentRange(deepCopy(providedComments[i]), tokens));
+        }
+
+        // This is based on John Freeman's implementation.
+        cursor = 0;
+        traverse(tree, {
+            enter: function (node) {
+                var comment;
+
+                while (cursor < comments.length) {
+                    comment = comments[cursor];
+                    if (comment.extendedRange[1] > node.range[0]) {
+                        break;
+                    }
+
+                    if (comment.extendedRange[1] === node.range[0]) {
+                        if (!node.leadingComments) {
+                            node.leadingComments = [];
+                        }
+                        node.leadingComments.push(comment);
+                        comments.splice(cursor, 1);
+                    } else {
+                        cursor += 1;
+                    }
+                }
+
+                // already out of owned node
+                if (cursor === comments.length) {
+                    return VisitorOption.Break;
+                }
+
+                if (comments[cursor].extendedRange[0] > node.range[1]) {
+                    return VisitorOption.Skip;
+                }
+            }
+        });
+
+        cursor = 0;
+        traverse(tree, {
+            leave: function (node) {
+                var comment;
+
+                while (cursor < comments.length) {
+                    comment = comments[cursor];
+                    if (node.range[1] < comment.extendedRange[0]) {
+                        break;
+                    }
+
+                    if (node.range[1] === comment.extendedRange[0]) {
+                        if (!node.trailingComments) {
+                            node.trailingComments = [];
+                        }
+                        node.trailingComments.push(comment);
+                        comments.splice(cursor, 1);
+                    } else {
+                        cursor += 1;
+                    }
+                }
+
+                // already out of owned node
+                if (cursor === comments.length) {
+                    return VisitorOption.Break;
+                }
+
+                if (comments[cursor].extendedRange[0] > node.range[1]) {
+                    return VisitorOption.Skip;
+                }
+            }
+        });
+
+        return tree;
+    }
+
+    exports.version = require('./package.json').version;
+    exports.Syntax = Syntax;
+    exports.traverse = traverse;
+    exports.replace = replace;
+    exports.attachComments = attachComments;
+    exports.VisitorKeys = VisitorKeys;
+    exports.VisitorOption = VisitorOption;
+    exports.Controller = Controller;
+    exports.cloneEnvironment = function () { return clone({}); };
+
+    return exports;
+}(exports));
+/* vim: set sw=4 ts=4 et tw=80 : */
diff --git a/node_modules/mathjs/examples/node_modules/estraverse/gulpfile.js b/node_modules/mathjs/examples/node_modules/estraverse/gulpfile.js
new file mode 100644
index 0000000..8772bbc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/estraverse/gulpfile.js
@@ -0,0 +1,70 @@
+/*
+  Copyright (C) 2014 Yusuke Suzuki <utatane.tea@gmail.com>
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS'
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+'use strict';
+
+var gulp = require('gulp'),
+    git = require('gulp-git'),
+    bump = require('gulp-bump'),
+    filter = require('gulp-filter'),
+    tagVersion = require('gulp-tag-version');
+
+var TEST = [ 'test/*.js' ];
+var POWERED = [ 'powered-test/*.js' ];
+var SOURCE = [ 'src/**/*.js' ];
+
+/**
+ * Bumping version number and tagging the repository with it.
+ * Please read http://semver.org/
+ *
+ * You can use the commands
+ *
+ *     gulp patch     # makes v0.1.0 -> v0.1.1
+ *     gulp feature   # makes v0.1.1 -> v0.2.0
+ *     gulp release   # makes v0.2.1 -> v1.0.0
+ *
+ * To bump the version numbers accordingly after you did a patch,
+ * introduced a feature or made a backwards-incompatible release.
+ */
+
+function inc(importance) {
+    // get all the files to bump version in
+    return gulp.src(['./package.json'])
+        // bump the version number in those files
+        .pipe(bump({type: importance}))
+        // save it back to filesystem
+        .pipe(gulp.dest('./'))
+        // commit the changed version number
+        .pipe(git.commit('Bumps package version'))
+        // read only one file to get the version number
+        .pipe(filter('package.json'))
+        // **tag it in the repository**
+        .pipe(tagVersion({
+            prefix: ''
+        }));
+}
+
+gulp.task('patch', [ ], function () { return inc('patch'); })
+gulp.task('minor', [ ], function () { return inc('minor'); })
+gulp.task('major', [ ], function () { return inc('major'); })
diff --git a/node_modules/mathjs/examples/node_modules/estraverse/package.json b/node_modules/mathjs/examples/node_modules/estraverse/package.json
new file mode 100644
index 0000000..1138238
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/estraverse/package.json
@@ -0,0 +1,40 @@
+{
+  "name": "estraverse",
+  "description": "ECMAScript JS AST traversal functions",
+  "homepage": "https://github.com/estools/estraverse",
+  "main": "estraverse.js",
+  "version": "4.3.0",
+  "engines": {
+    "node": ">=4.0"
+  },
+  "maintainers": [
+    {
+      "name": "Yusuke Suzuki",
+      "email": "utatane.tea@gmail.com",
+      "web": "http://github.com/Constellation"
+    }
+  ],
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/estools/estraverse.git"
+  },
+  "devDependencies": {
+    "babel-preset-env": "^1.6.1",
+    "babel-register": "^6.3.13",
+    "chai": "^2.1.1",
+    "espree": "^1.11.0",
+    "gulp": "^3.8.10",
+    "gulp-bump": "^0.2.2",
+    "gulp-filter": "^2.0.0",
+    "gulp-git": "^1.0.1",
+    "gulp-tag-version": "^1.3.0",
+    "jshint": "^2.5.6",
+    "mocha": "^2.1.0"
+  },
+  "license": "BSD-2-Clause",
+  "scripts": {
+    "test": "npm run-script lint && npm run-script unit-test",
+    "lint": "jshint estraverse.js",
+    "unit-test": "mocha --compilers js:babel-register"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/.airtap.yml b/node_modules/mathjs/examples/node_modules/events/.airtap.yml
new file mode 100644
index 0000000..c7a8a87
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/.airtap.yml
@@ -0,0 +1,15 @@
+sauce_connect: true
+loopback: airtap.local
+browsers:
+  - name: chrome
+    version: latest
+  - name: firefox
+    version: latest
+  - name: safari
+    version: 9..latest
+  - name: iphone
+    version: latest
+  - name: ie
+    version: 9..latest
+  - name: microsoftedge
+    version: 13..latest
diff --git a/node_modules/mathjs/examples/node_modules/events/.github/FUNDING.yml b/node_modules/mathjs/examples/node_modules/events/.github/FUNDING.yml
new file mode 100644
index 0000000..8b8cb78
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/.github/FUNDING.yml
@@ -0,0 +1,12 @@
+# These are supported funding model platforms
+
+github: # Replace with up to 4 GitHub Sponsors-enabled usernames e.g., [user1, user2]
+patreon: # Replace with a single Patreon username
+open_collective: # Replace with a single Open Collective username
+ko_fi: # Replace with a single Ko-fi username
+tidelift: npm/events
+community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
+liberapay: # Replace with a single Liberapay username
+issuehunt: # Replace with a single IssueHunt username
+otechie: # Replace with a single Otechie username
+custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']
diff --git a/node_modules/mathjs/examples/node_modules/events/.travis.yml b/node_modules/mathjs/examples/node_modules/events/.travis.yml
new file mode 100644
index 0000000..486dc3c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/.travis.yml
@@ -0,0 +1,18 @@
+dist: xenial
+os: linux
+language: node_js
+node_js:
+  - 'stable'
+  - 'lts/*'
+  - '0.12'
+script:
+  - npm test
+  - if [ "${TRAVIS_PULL_REQUEST}" = "false" ] && [ "${TRAVIS_NODE_VERSION}" = "stable" ]; then npm run test:browsers; fi
+addons:
+  sauce_connect: true
+  hosts:
+    - airtap.local
+env:
+  global:
+  - secure: XcBiD8yReflut9q7leKsigDZ0mI3qTKH+QrNVY8DaqlomJOZw8aOrVuX9Jz12l86ZJ41nbxmKnRNkFzcVr9mbP9YaeTb3DpeOBWmvaoSfud9Wnc16VfXtc1FCcwDhSVcSiM3UtnrmFU5cH+Dw1LPh5PbfylYOS/nJxUvG0FFLqI=
+  - secure: jNWtEbqhUdQ0xXDHvCYfUbKYeJCi6a7B4LsrcxYCyWWn4NIgncE5x2YbB+FSUUFVYfz0dsn5RKP1oHB99f0laUEo18HBNkrAS/rtyOdVzcpJjbQ6kgSILGjnJD/Ty1B57Rcz3iyev5Y7bLZ6Y1FbDnk/i9/l0faOGz8vTC3Vdkc=
diff --git a/node_modules/mathjs/examples/node_modules/events/History.md b/node_modules/mathjs/examples/node_modules/events/History.md
new file mode 100644
index 0000000..f48bf21
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/History.md
@@ -0,0 +1,118 @@
+# 3.3.0
+
+ - Support EventTarget emitters in `events.once` from Node.js 12.11.0.
+
+   Now you can use the `events.once` function with objects that implement the EventTarget interface. This interface is used widely in
+   the DOM and other web APIs.
+
+   ```js
+   var events = require('events');
+   var assert = require('assert');
+
+   async function connect() {
+     var ws = new WebSocket('wss://example.com');
+     await events.once(ws, 'open');
+     assert(ws.readyState === WebSocket.OPEN);
+   }
+
+   async function onClick() {
+     await events.once(document.body, 'click');
+     alert('you clicked the page!');
+   }
+   ```
+
+# 3.2.0
+
+ - Add `events.once` from Node.js 11.13.0.
+
+   To use this function, Promises must be supported in the environment. Use a polyfill like `es6-promise` if you support older browsers.
+
+# 3.1.0 (2020-01-08)
+
+`events` now matches the Node.js 11.12.0 API.
+
+  - pass through return value in wrapped `emitter.once()` listeners
+
+    Now, this works:
+    ```js
+    emitter.once('myevent', function () { return 1; });
+    var listener = emitter.rawListeners('myevent')[0]
+    assert(listener() === 1);
+    ```
+    Previously, `listener()` would return undefined regardless of the implementation.
+
+    Ported from https://github.com/nodejs/node/commit/acc506c2d2771dab8d7bba6d3452bc5180dff7cf
+
+  - Reduce code duplication in listener type check ([#67](https://github.com/Gozala/events/pull/67) by [@friederbluemle](https://github.com/friederbluemle)).
+  - Improve `emitter.once()` performance in some engines
+
+# 3.0.0 (2018-05-25)
+
+**This version drops support for IE8.** `events` no longer includes polyfills
+for ES5 features. If you need to support older environments, use an ES5 shim
+like [es5-shim](https://npmjs.com/package/es5-shim). Both the shim and sham
+versions of es5-shim are necessary.
+
+  - Update to events code from Node.js 10.x
+    - (semver major) Adds `off()` method
+  - Port more tests from Node.js
+  - Switch browser tests to airtap, making things more reliable
+
+# 2.1.0 (2018-05-25)
+
+  - add Emitter#rawListeners from Node.js v9.4
+
+# 2.0.0 (2018-02-02)
+
+  - Update to events code from node.js 8.x
+    - Adds `prependListener()` and `prependOnceListener()`
+    - Adds `eventNames()` method
+    - (semver major) Unwrap `once()` listeners in `listeners()`
+  - copy tests from node.js
+
+Note that this version doubles the gzipped size, jumping from 1.1KB to 2.1KB,
+due to new methods and runtime performance improvements. Be aware of that when
+upgrading.
+
+# 1.1.1 (2016-06-22)
+
+  - add more context to errors if they are not instanceof Error
+
+# 1.1.0 (2015-09-29)
+
+  - add Emitter#listerCount (to match node v4 api)
+
+# 1.0.2 (2014-08-28)
+
+  - remove un-reachable code
+  - update devDeps
+
+## 1.0.1 / 2014-05-11
+
+  - check for console.trace before using it
+
+## 1.0.0 / 2013-12-10
+
+  - Update to latest events code from node.js 0.10
+  - copy tests from node.js
+
+## 0.4.0 / 2011-07-03 ##
+
+  - Switching to graphquire@0.8.0
+
+## 0.3.0 / 2011-07-03 ##
+
+  - Switching to URL based module require.
+
+## 0.2.0 / 2011-06-10 ##
+
+  - Simplified package structure.
+  - Graphquire for dependency management.
+
+## 0.1.1 / 2011-05-16 ##
+
+  - Unhandled errors are logged via console.error
+
+## 0.1.0 / 2011-04-22 ##
+
+  - Initial release
diff --git a/node_modules/mathjs/examples/node_modules/events/LICENSE b/node_modules/mathjs/examples/node_modules/events/LICENSE
new file mode 100644
index 0000000..52ed3b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/LICENSE
@@ -0,0 +1,22 @@
+MIT
+
+Copyright Joyent, Inc. and other Node contributors.
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to permit
+persons to whom the Software is furnished to do so, subject to the
+following conditions:
+
+The above copyright notice and this permission notice shall be included
+in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/events/Readme.md b/node_modules/mathjs/examples/node_modules/events/Readme.md
new file mode 100644
index 0000000..80849c0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/Readme.md
@@ -0,0 +1,50 @@
+# events [![Build Status](https://travis-ci.org/Gozala/events.png?branch=master)](https://travis-ci.org/Gozala/events)
+
+> Node's event emitter for all engines.
+
+This implements the Node.js [`events`][node.js docs] module for environments that do not have it, like browsers.
+
+> `events` currently matches the **Node.js 11.13.0** API.
+
+Note that the `events` module uses ES5 features. If you need to support very old browsers like IE8, use a shim like [`es5-shim`](https://www.npmjs.com/package/es5-shim). You need both the shim and the sham versions of `es5-shim`.
+
+This module is maintained, but only by very few people. If you'd like to help, let us know in the [Maintainer Needed](https://github.com/Gozala/events/issues/43) issue!
+
+## Install
+
+You usually do not have to install `events` yourself! If your code runs in Node.js, `events` is built in. If your code runs in the browser, bundlers like [browserify](https://github.com/browserify/browserify) or [webpack](https://github.com/webpack/webpack) also include the `events` module.
+
+But if none of those apply, with npm do:
+
+```
+npm install events
+```
+
+## Usage
+
+```javascript
+var EventEmitter = require('events')
+
+var ee = new EventEmitter()
+ee.on('message', function (text) {
+  console.log(text)
+})
+ee.emit('message', 'hello world')
+```
+
+## API
+
+See the [Node.js EventEmitter docs][node.js docs]. `events` currently matches the Node.js 11.13.0 API.
+
+## Contributing
+
+PRs are very welcome! The main way to contribute to `events` is by porting features, bugfixes and tests from Node.js. Ideally, code contributions to this module are copy-pasted from Node.js and transpiled to ES5, rather than reimplemented from scratch. Matching the Node.js code as closely as possible makes maintenance simpler when new changes land in Node.js.
+This module intends to provide exactly the same API as Node.js, so features that are not available in the core `events` module will not be accepted. Feature requests should instead be directed at [nodejs/node](https://github.com/nodejs/node) and will be added to this module once they are implemented in Node.js.
+
+If there is a difference in behaviour between Node.js's `events` module and this module, please open an issue!
+
+## License
+
+[MIT](./LICENSE)
+
+[node.js docs]: https://nodejs.org/dist/v11.13.0/docs/api/events.html
diff --git a/node_modules/mathjs/examples/node_modules/events/events.js b/node_modules/mathjs/examples/node_modules/events/events.js
new file mode 100644
index 0000000..34b69a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/events.js
@@ -0,0 +1,497 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+'use strict';
+
+var R = typeof Reflect === 'object' ? Reflect : null
+var ReflectApply = R && typeof R.apply === 'function'
+  ? R.apply
+  : function ReflectApply(target, receiver, args) {
+    return Function.prototype.apply.call(target, receiver, args);
+  }
+
+var ReflectOwnKeys
+if (R && typeof R.ownKeys === 'function') {
+  ReflectOwnKeys = R.ownKeys
+} else if (Object.getOwnPropertySymbols) {
+  ReflectOwnKeys = function ReflectOwnKeys(target) {
+    return Object.getOwnPropertyNames(target)
+      .concat(Object.getOwnPropertySymbols(target));
+  };
+} else {
+  ReflectOwnKeys = function ReflectOwnKeys(target) {
+    return Object.getOwnPropertyNames(target);
+  };
+}
+
+function ProcessEmitWarning(warning) {
+  if (console && console.warn) console.warn(warning);
+}
+
+var NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {
+  return value !== value;
+}
+
+function EventEmitter() {
+  EventEmitter.init.call(this);
+}
+module.exports = EventEmitter;
+module.exports.once = once;
+
+// Backwards-compat with node 0.10.x
+EventEmitter.EventEmitter = EventEmitter;
+
+EventEmitter.prototype._events = undefined;
+EventEmitter.prototype._eventsCount = 0;
+EventEmitter.prototype._maxListeners = undefined;
+
+// By default EventEmitters will print a warning if more than 10 listeners are
+// added to it. This is a useful default which helps finding memory leaks.
+var defaultMaxListeners = 10;
+
+function checkListener(listener) {
+  if (typeof listener !== 'function') {
+    throw new TypeError('The "listener" argument must be of type Function. Received type ' + typeof listener);
+  }
+}
+
+Object.defineProperty(EventEmitter, 'defaultMaxListeners', {
+  enumerable: true,
+  get: function() {
+    return defaultMaxListeners;
+  },
+  set: function(arg) {
+    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {
+      throw new RangeError('The value of "defaultMaxListeners" is out of range. It must be a non-negative number. Received ' + arg + '.');
+    }
+    defaultMaxListeners = arg;
+  }
+});
+
+EventEmitter.init = function() {
+
+  if (this._events === undefined ||
+      this._events === Object.getPrototypeOf(this)._events) {
+    this._events = Object.create(null);
+    this._eventsCount = 0;
+  }
+
+  this._maxListeners = this._maxListeners || undefined;
+};
+
+// Obviously not all Emitters should be limited to 10. This function allows
+// that to be increased. Set to zero for unlimited.
+EventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {
+  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {
+    throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received ' + n + '.');
+  }
+  this._maxListeners = n;
+  return this;
+};
+
+function _getMaxListeners(that) {
+  if (that._maxListeners === undefined)
+    return EventEmitter.defaultMaxListeners;
+  return that._maxListeners;
+}
+
+EventEmitter.prototype.getMaxListeners = function getMaxListeners() {
+  return _getMaxListeners(this);
+};
+
+EventEmitter.prototype.emit = function emit(type) {
+  var args = [];
+  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);
+  var doError = (type === 'error');
+
+  var events = this._events;
+  if (events !== undefined)
+    doError = (doError && events.error === undefined);
+  else if (!doError)
+    return false;
+
+  // If there is no 'error' event listener then throw.
+  if (doError) {
+    var er;
+    if (args.length > 0)
+      er = args[0];
+    if (er instanceof Error) {
+      // Note: The comments on the `throw` lines are intentional, they show
+      // up in Node's output if this results in an unhandled exception.
+      throw er; // Unhandled 'error' event
+    }
+    // At least give some kind of context to the user
+    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));
+    err.context = er;
+    throw err; // Unhandled 'error' event
+  }
+
+  var handler = events[type];
+
+  if (handler === undefined)
+    return false;
+
+  if (typeof handler === 'function') {
+    ReflectApply(handler, this, args);
+  } else {
+    var len = handler.length;
+    var listeners = arrayClone(handler, len);
+    for (var i = 0; i < len; ++i)
+      ReflectApply(listeners[i], this, args);
+  }
+
+  return true;
+};
+
+function _addListener(target, type, listener, prepend) {
+  var m;
+  var events;
+  var existing;
+
+  checkListener(listener);
+
+  events = target._events;
+  if (events === undefined) {
+    events = target._events = Object.create(null);
+    target._eventsCount = 0;
+  } else {
+    // To avoid recursion in the case that type === "newListener"! Before
+    // adding it to the listeners, first emit "newListener".
+    if (events.newListener !== undefined) {
+      target.emit('newListener', type,
+                  listener.listener ? listener.listener : listener);
+
+      // Re-assign `events` because a newListener handler could have caused the
+      // this._events to be assigned to a new object
+      events = target._events;
+    }
+    existing = events[type];
+  }
+
+  if (existing === undefined) {
+    // Optimize the case of one listener. Don't need the extra array object.
+    existing = events[type] = listener;
+    ++target._eventsCount;
+  } else {
+    if (typeof existing === 'function') {
+      // Adding the second element, need to change to array.
+      existing = events[type] =
+        prepend ? [listener, existing] : [existing, listener];
+      // If we've already got an array, just append.
+    } else if (prepend) {
+      existing.unshift(listener);
+    } else {
+      existing.push(listener);
+    }
+
+    // Check for listener leak
+    m = _getMaxListeners(target);
+    if (m > 0 && existing.length > m && !existing.warned) {
+      existing.warned = true;
+      // No error code for this since it is a Warning
+      // eslint-disable-next-line no-restricted-syntax
+      var w = new Error('Possible EventEmitter memory leak detected. ' +
+                          existing.length + ' ' + String(type) + ' listeners ' +
+                          'added. Use emitter.setMaxListeners() to ' +
+                          'increase limit');
+      w.name = 'MaxListenersExceededWarning';
+      w.emitter = target;
+      w.type = type;
+      w.count = existing.length;
+      ProcessEmitWarning(w);
+    }
+  }
+
+  return target;
+}
+
+EventEmitter.prototype.addListener = function addListener(type, listener) {
+  return _addListener(this, type, listener, false);
+};
+
+EventEmitter.prototype.on = EventEmitter.prototype.addListener;
+
+EventEmitter.prototype.prependListener =
+    function prependListener(type, listener) {
+      return _addListener(this, type, listener, true);
+    };
+
+function onceWrapper() {
+  if (!this.fired) {
+    this.target.removeListener(this.type, this.wrapFn);
+    this.fired = true;
+    if (arguments.length === 0)
+      return this.listener.call(this.target);
+    return this.listener.apply(this.target, arguments);
+  }
+}
+
+function _onceWrap(target, type, listener) {
+  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };
+  var wrapped = onceWrapper.bind(state);
+  wrapped.listener = listener;
+  state.wrapFn = wrapped;
+  return wrapped;
+}
+
+EventEmitter.prototype.once = function once(type, listener) {
+  checkListener(listener);
+  this.on(type, _onceWrap(this, type, listener));
+  return this;
+};
+
+EventEmitter.prototype.prependOnceListener =
+    function prependOnceListener(type, listener) {
+      checkListener(listener);
+      this.prependListener(type, _onceWrap(this, type, listener));
+      return this;
+    };
+
+// Emits a 'removeListener' event if and only if the listener was removed.
+EventEmitter.prototype.removeListener =
+    function removeListener(type, listener) {
+      var list, events, position, i, originalListener;
+
+      checkListener(listener);
+
+      events = this._events;
+      if (events === undefined)
+        return this;
+
+      list = events[type];
+      if (list === undefined)
+        return this;
+
+      if (list === listener || list.listener === listener) {
+        if (--this._eventsCount === 0)
+          this._events = Object.create(null);
+        else {
+          delete events[type];
+          if (events.removeListener)
+            this.emit('removeListener', type, list.listener || listener);
+        }
+      } else if (typeof list !== 'function') {
+        position = -1;
+
+        for (i = list.length - 1; i >= 0; i--) {
+          if (list[i] === listener || list[i].listener === listener) {
+            originalListener = list[i].listener;
+            position = i;
+            break;
+          }
+        }
+
+        if (position < 0)
+          return this;
+
+        if (position === 0)
+          list.shift();
+        else {
+          spliceOne(list, position);
+        }
+
+        if (list.length === 1)
+          events[type] = list[0];
+
+        if (events.removeListener !== undefined)
+          this.emit('removeListener', type, originalListener || listener);
+      }
+
+      return this;
+    };
+
+EventEmitter.prototype.off = EventEmitter.prototype.removeListener;
+
+EventEmitter.prototype.removeAllListeners =
+    function removeAllListeners(type) {
+      var listeners, events, i;
+
+      events = this._events;
+      if (events === undefined)
+        return this;
+
+      // not listening for removeListener, no need to emit
+      if (events.removeListener === undefined) {
+        if (arguments.length === 0) {
+          this._events = Object.create(null);
+          this._eventsCount = 0;
+        } else if (events[type] !== undefined) {
+          if (--this._eventsCount === 0)
+            this._events = Object.create(null);
+          else
+            delete events[type];
+        }
+        return this;
+      }
+
+      // emit removeListener for all listeners on all events
+      if (arguments.length === 0) {
+        var keys = Object.keys(events);
+        var key;
+        for (i = 0; i < keys.length; ++i) {
+          key = keys[i];
+          if (key === 'removeListener') continue;
+          this.removeAllListeners(key);
+        }
+        this.removeAllListeners('removeListener');
+        this._events = Object.create(null);
+        this._eventsCount = 0;
+        return this;
+      }
+
+      listeners = events[type];
+
+      if (typeof listeners === 'function') {
+        this.removeListener(type, listeners);
+      } else if (listeners !== undefined) {
+        // LIFO order
+        for (i = listeners.length - 1; i >= 0; i--) {
+          this.removeListener(type, listeners[i]);
+        }
+      }
+
+      return this;
+    };
+
+function _listeners(target, type, unwrap) {
+  var events = target._events;
+
+  if (events === undefined)
+    return [];
+
+  var evlistener = events[type];
+  if (evlistener === undefined)
+    return [];
+
+  if (typeof evlistener === 'function')
+    return unwrap ? [evlistener.listener || evlistener] : [evlistener];
+
+  return unwrap ?
+    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);
+}
+
+EventEmitter.prototype.listeners = function listeners(type) {
+  return _listeners(this, type, true);
+};
+
+EventEmitter.prototype.rawListeners = function rawListeners(type) {
+  return _listeners(this, type, false);
+};
+
+EventEmitter.listenerCount = function(emitter, type) {
+  if (typeof emitter.listenerCount === 'function') {
+    return emitter.listenerCount(type);
+  } else {
+    return listenerCount.call(emitter, type);
+  }
+};
+
+EventEmitter.prototype.listenerCount = listenerCount;
+function listenerCount(type) {
+  var events = this._events;
+
+  if (events !== undefined) {
+    var evlistener = events[type];
+
+    if (typeof evlistener === 'function') {
+      return 1;
+    } else if (evlistener !== undefined) {
+      return evlistener.length;
+    }
+  }
+
+  return 0;
+}
+
+EventEmitter.prototype.eventNames = function eventNames() {
+  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];
+};
+
+function arrayClone(arr, n) {
+  var copy = new Array(n);
+  for (var i = 0; i < n; ++i)
+    copy[i] = arr[i];
+  return copy;
+}
+
+function spliceOne(list, index) {
+  for (; index + 1 < list.length; index++)
+    list[index] = list[index + 1];
+  list.pop();
+}
+
+function unwrapListeners(arr) {
+  var ret = new Array(arr.length);
+  for (var i = 0; i < ret.length; ++i) {
+    ret[i] = arr[i].listener || arr[i];
+  }
+  return ret;
+}
+
+function once(emitter, name) {
+  return new Promise(function (resolve, reject) {
+    function errorListener(err) {
+      emitter.removeListener(name, resolver);
+      reject(err);
+    }
+
+    function resolver() {
+      if (typeof emitter.removeListener === 'function') {
+        emitter.removeListener('error', errorListener);
+      }
+      resolve([].slice.call(arguments));
+    };
+
+    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });
+    if (name !== 'error') {
+      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });
+    }
+  });
+}
+
+function addErrorHandlerIfEventEmitter(emitter, handler, flags) {
+  if (typeof emitter.on === 'function') {
+    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);
+  }
+}
+
+function eventTargetAgnosticAddListener(emitter, name, listener, flags) {
+  if (typeof emitter.on === 'function') {
+    if (flags.once) {
+      emitter.once(name, listener);
+    } else {
+      emitter.on(name, listener);
+    }
+  } else if (typeof emitter.addEventListener === 'function') {
+    // EventTarget does not have `error` event semantics like Node
+    // EventEmitters, we do not listen for `error` events here.
+    emitter.addEventListener(name, function wrapListener(arg) {
+      // IE does not have builtin `{ once: true }` support so we
+      // have to do it manually.
+      if (flags.once) {
+        emitter.removeEventListener(name, wrapListener);
+      }
+      listener(arg);
+    });
+  } else {
+    throw new TypeError('The "emitter" argument must be of type EventEmitter. Received type ' + typeof emitter);
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/package.json b/node_modules/mathjs/examples/node_modules/events/package.json
new file mode 100644
index 0000000..b9580d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/package.json
@@ -0,0 +1,37 @@
+{
+  "name": "events",
+  "version": "3.3.0",
+  "description": "Node's event emitter for all engines.",
+  "keywords": [
+    "events",
+    "eventEmitter",
+    "eventDispatcher",
+    "listeners"
+  ],
+  "author": "Irakli Gozalishvili <rfobic@gmail.com> (http://jeditoolkit.com)",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/Gozala/events.git",
+    "web": "https://github.com/Gozala/events"
+  },
+  "bugs": {
+    "url": "http://github.com/Gozala/events/issues/"
+  },
+  "main": "./events.js",
+  "engines": {
+    "node": ">=0.8.x"
+  },
+  "devDependencies": {
+    "airtap": "^1.0.0",
+    "functions-have-names": "^1.2.1",
+    "has": "^1.0.3",
+    "has-symbols": "^1.0.1",
+    "isarray": "^2.0.5",
+    "tape": "^5.0.0"
+  },
+  "scripts": {
+    "test": "node tests/index.js",
+    "test:browsers": "airtap -- tests/index.js"
+  },
+  "license": "MIT"
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/security.md b/node_modules/mathjs/examples/node_modules/events/security.md
new file mode 100644
index 0000000..a14ace6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/security.md
@@ -0,0 +1,10 @@
+# Security Policy
+
+## Supported Versions
+Only the latest major version is supported at any given time.
+
+## Reporting a Vulnerability
+
+To report a security vulnerability, please use the
+[Tidelift security contact](https://tidelift.com/security).
+Tidelift will coordinate the fix and disclosure.
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/add-listeners.js b/node_modules/mathjs/examples/node_modules/events/tests/add-listeners.js
new file mode 100644
index 0000000..9b57827
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/add-listeners.js
@@ -0,0 +1,111 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('./common');
+var assert = require('assert');
+var EventEmitter = require('../');
+
+{
+  var ee = new EventEmitter();
+  var events_new_listener_emitted = [];
+  var listeners_new_listener_emitted = [];
+
+  // Sanity check
+  assert.strictEqual(ee.addListener, ee.on);
+
+  ee.on('newListener', function(event, listener) {
+    // Don't track newListener listeners.
+    if (event === 'newListener')
+      return;
+
+    events_new_listener_emitted.push(event);
+    listeners_new_listener_emitted.push(listener);
+  });
+
+  var hello = common.mustCall(function(a, b) {
+    assert.strictEqual('a', a);
+    assert.strictEqual('b', b);
+  });
+
+  ee.once('newListener', function(name, listener) {
+    assert.strictEqual(name, 'hello');
+    assert.strictEqual(listener, hello);
+
+    var listeners = this.listeners('hello');
+    assert.ok(Array.isArray(listeners));
+    assert.strictEqual(listeners.length, 0);
+  });
+
+  ee.on('hello', hello);
+  ee.once('foo', assert.fail);
+
+  assert.ok(Array.isArray(events_new_listener_emitted));
+  assert.strictEqual(events_new_listener_emitted.length, 2);
+  assert.strictEqual(events_new_listener_emitted[0], 'hello');
+  assert.strictEqual(events_new_listener_emitted[1], 'foo');
+
+  assert.ok(Array.isArray(listeners_new_listener_emitted));
+  assert.strictEqual(listeners_new_listener_emitted.length, 2);
+  assert.strictEqual(listeners_new_listener_emitted[0], hello);
+  assert.strictEqual(listeners_new_listener_emitted[1], assert.fail);
+
+  ee.emit('hello', 'a', 'b');
+}
+
+// just make sure that this doesn't throw:
+{
+  var f = new EventEmitter();
+
+  f.setMaxListeners(0);
+}
+
+{
+  var listen1 = function() {};
+  var listen2 = function() {};
+  var ee = new EventEmitter();
+
+  ee.once('newListener', function() {
+    var listeners = ee.listeners('hello');
+    assert.ok(Array.isArray(listeners));
+    assert.strictEqual(listeners.length, 0);
+    ee.once('newListener', function() {
+      var listeners = ee.listeners('hello');
+      assert.ok(Array.isArray(listeners));
+      assert.strictEqual(listeners.length, 0);
+    });
+    ee.on('hello', listen2);
+  });
+  ee.on('hello', listen1);
+  // The order of listeners on an event is not always the order in which the
+  // listeners were added.
+  var listeners = ee.listeners('hello');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 2);
+  assert.strictEqual(listeners[0], listen2);
+  assert.strictEqual(listeners[1], listen1);
+}
+
+// Verify that the listener must be a function
+assert.throws(function() {
+  var ee = new EventEmitter();
+
+  ee.on('foo', null);
+}, /^TypeError: The "listener" argument must be of type Function. Received type object$/);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/check-listener-leaks.js b/node_modules/mathjs/examples/node_modules/events/tests/check-listener-leaks.js
new file mode 100644
index 0000000..7fce48f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/check-listener-leaks.js
@@ -0,0 +1,101 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('./common');
+var assert = require('assert');
+var events = require('../');
+
+// Redirect warning output to tape.
+var consoleWarn = console.warn;
+console.warn = common.test.comment;
+
+common.test.on('end', function () {
+  console.warn = consoleWarn;
+});
+
+// default
+{
+  var e = new events.EventEmitter();
+
+  for (var i = 0; i < 10; i++) {
+    e.on('default', common.mustNotCall());
+  }
+  assert.ok(!e._events['default'].hasOwnProperty('warned'));
+  e.on('default', common.mustNotCall());
+  assert.ok(e._events['default'].warned);
+
+  // specific
+  e.setMaxListeners(5);
+  for (var i = 0; i < 5; i++) {
+    e.on('specific', common.mustNotCall());
+  }
+  assert.ok(!e._events['specific'].hasOwnProperty('warned'));
+  e.on('specific', common.mustNotCall());
+  assert.ok(e._events['specific'].warned);
+
+  // only one
+  e.setMaxListeners(1);
+  e.on('only one', common.mustNotCall());
+  assert.ok(!e._events['only one'].hasOwnProperty('warned'));
+  e.on('only one', common.mustNotCall());
+  assert.ok(e._events['only one'].hasOwnProperty('warned'));
+
+  // unlimited
+  e.setMaxListeners(0);
+  for (var i = 0; i < 1000; i++) {
+    e.on('unlimited', common.mustNotCall());
+  }
+  assert.ok(!e._events['unlimited'].hasOwnProperty('warned'));
+}
+
+// process-wide
+{
+  events.EventEmitter.defaultMaxListeners = 42;
+  var e = new events.EventEmitter();
+
+  for (var i = 0; i < 42; ++i) {
+    e.on('fortytwo', common.mustNotCall());
+  }
+  assert.ok(!e._events['fortytwo'].hasOwnProperty('warned'));
+  e.on('fortytwo', common.mustNotCall());
+  assert.ok(e._events['fortytwo'].hasOwnProperty('warned'));
+  delete e._events['fortytwo'].warned;
+
+  events.EventEmitter.defaultMaxListeners = 44;
+  e.on('fortytwo', common.mustNotCall());
+  assert.ok(!e._events['fortytwo'].hasOwnProperty('warned'));
+  e.on('fortytwo', common.mustNotCall());
+  assert.ok(e._events['fortytwo'].hasOwnProperty('warned'));
+}
+
+// but _maxListeners still has precedence over defaultMaxListeners
+{
+  events.EventEmitter.defaultMaxListeners = 42;
+  var e = new events.EventEmitter();
+  e.setMaxListeners(1);
+  e.on('uno', common.mustNotCall());
+  assert.ok(!e._events['uno'].hasOwnProperty('warned'));
+  e.on('uno', common.mustNotCall());
+  assert.ok(e._events['uno'].hasOwnProperty('warned'));
+
+  // chainable
+  assert.strictEqual(e, e.setMaxListeners(1));
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/common.js b/node_modules/mathjs/examples/node_modules/events/tests/common.js
new file mode 100644
index 0000000..49569b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/common.js
@@ -0,0 +1,104 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var test = require('tape');
+var assert = require('assert');
+
+var noop = function() {};
+
+var mustCallChecks = [];
+
+function runCallChecks(exitCode) {
+  if (exitCode !== 0) return;
+
+  var failed = filter(mustCallChecks, function(context) {
+    if ('minimum' in context) {
+      context.messageSegment = 'at least ' + context.minimum;
+      return context.actual < context.minimum;
+    } else {
+      context.messageSegment = 'exactly ' + context.exact;
+      return context.actual !== context.exact;
+    }
+  });
+
+  for (var i = 0; i < failed.length; i++) {
+    var context = failed[i];
+    console.log('Mismatched %s function calls. Expected %s, actual %d.',
+        context.name,
+        context.messageSegment,
+        context.actual);
+    // IE8 has no .stack
+    if (context.stack) console.log(context.stack.split('\n').slice(2).join('\n'));
+  }
+
+  assert.strictEqual(failed.length, 0);
+}
+
+exports.mustCall = function(fn, exact) {
+  return _mustCallInner(fn, exact, 'exact');
+};
+
+function _mustCallInner(fn, criteria, field) {
+  if (typeof criteria == 'undefined') criteria = 1;
+
+  if (typeof fn === 'number') {
+    criteria = fn;
+    fn = noop;
+  } else if (fn === undefined) {
+    fn = noop;
+  }
+
+  if (typeof criteria !== 'number')
+    throw new TypeError('Invalid ' + field + ' value: ' + criteria);
+
+  var context = {
+    actual: 0,
+    stack: (new Error()).stack,
+    name: fn.name || '<anonymous>'
+  };
+
+  context[field] = criteria;
+
+  // add the exit listener only once to avoid listener leak warnings
+  if (mustCallChecks.length === 0) test.onFinish(function() { runCallChecks(0); });
+
+  mustCallChecks.push(context);
+
+  return function() {
+    context.actual++;
+    return fn.apply(this, arguments);
+  };
+}
+
+exports.mustNotCall = function(msg) {
+  return function mustNotCall() {
+    assert.fail(msg || 'function should not have been called');
+  };
+};
+
+function filter(arr, fn) {
+  if (arr.filter) return arr.filter(fn);
+  var filtered = [];
+  for (var i = 0; i < arr.length; i++) {
+    if (fn(arr[i], i, arr)) filtered.push(arr[i]);
+  }
+  return filtered
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/errors.js b/node_modules/mathjs/examples/node_modules/events/tests/errors.js
new file mode 100644
index 0000000..a23df43
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/errors.js
@@ -0,0 +1,13 @@
+'use strict';
+var assert = require('assert');
+var EventEmitter = require('../');
+
+var EE = new EventEmitter();
+
+assert.throws(function () {
+  EE.emit('error', 'Accepts a string');
+}, 'Error: Unhandled error. (Accepts a string)');
+
+assert.throws(function () {
+  EE.emit('error', { message: 'Error!' });
+}, 'Unhandled error. ([object Object])');
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/events-list.js b/node_modules/mathjs/examples/node_modules/events/tests/events-list.js
new file mode 100644
index 0000000..08aa621
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/events-list.js
@@ -0,0 +1,28 @@
+'use strict';
+
+var EventEmitter = require('../');
+var assert = require('assert');
+
+var EE = new EventEmitter();
+var m = function() {};
+EE.on('foo', function() {});
+assert.equal(1, EE.eventNames().length);
+assert.equal('foo', EE.eventNames()[0]);
+EE.on('bar', m);
+assert.equal(2, EE.eventNames().length);
+assert.equal('foo', EE.eventNames()[0]);
+assert.equal('bar', EE.eventNames()[1]);
+EE.removeListener('bar', m);
+assert.equal(1, EE.eventNames().length);
+assert.equal('foo', EE.eventNames()[0]);
+
+if (typeof Symbol !== 'undefined') {
+  var s = Symbol('s');
+  EE.on(s, m);
+  assert.equal(2, EE.eventNames().length);
+  assert.equal('foo', EE.eventNames()[0]);
+  assert.equal(s, EE.eventNames()[1]);
+  EE.removeListener(s, m);
+  assert.equal(1, EE.eventNames().length);
+  assert.equal('foo', EE.eventNames()[0]);
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/events-once.js b/node_modules/mathjs/examples/node_modules/events/tests/events-once.js
new file mode 100644
index 0000000..dae8649
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/events-once.js
@@ -0,0 +1,234 @@
+'use strict';
+
+var common = require('./common');
+var EventEmitter = require('../').EventEmitter;
+var once = require('../').once;
+var has = require('has');
+var assert = require('assert');
+
+function Event(type) {
+  this.type = type;
+}
+
+function EventTargetMock() {
+  this.events = {};
+
+  this.addEventListener = common.mustCall(this.addEventListener);
+  this.removeEventListener = common.mustCall(this.removeEventListener);
+}
+
+EventTargetMock.prototype.addEventListener = function addEventListener(name, listener, options) {
+  if (!(name in this.events)) {
+    this.events[name] = { listeners: [], options: options || {} }
+  }
+  this.events[name].listeners.push(listener);
+};
+
+EventTargetMock.prototype.removeEventListener = function removeEventListener(name, callback) {
+  if (!(name in this.events)) {
+    return;
+  }
+  var event = this.events[name];
+  var stack = event.listeners;
+
+  for (var i = 0, l = stack.length; i < l; i++) {
+    if (stack[i] === callback) {
+      stack.splice(i, 1);
+      if (stack.length === 0) {
+        delete this.events[name];
+      }
+      return;
+    }
+  }
+};
+
+EventTargetMock.prototype.dispatchEvent = function dispatchEvent(arg) {
+  if (!(arg.type in this.events)) {
+    return true;
+  }
+
+  var event = this.events[arg.type];
+  var stack = event.listeners.slice();
+
+  for (var i = 0, l = stack.length; i < l; i++) {
+    stack[i].call(null, arg);
+    if (event.options.once) {
+      this.removeEventListener(arg.type, stack[i]);
+    }
+  }
+  return !arg.defaultPrevented;
+};
+
+function onceAnEvent() {
+  var ee = new EventEmitter();
+
+  process.nextTick(function () {
+    ee.emit('myevent', 42);
+  });
+
+  return once(ee, 'myevent').then(function (args) {
+    var value = args[0]
+    assert.strictEqual(value, 42);
+    assert.strictEqual(ee.listenerCount('error'), 0);
+    assert.strictEqual(ee.listenerCount('myevent'), 0);
+  });
+}
+
+function onceAnEventWithTwoArgs() {
+  var ee = new EventEmitter();
+
+  process.nextTick(function () {
+    ee.emit('myevent', 42, 24);
+  });
+
+  return once(ee, 'myevent').then(function (value) {
+    assert.strictEqual(value.length, 2);
+    assert.strictEqual(value[0], 42);
+    assert.strictEqual(value[1], 24);
+  });
+}
+
+function catchesErrors() {
+  var ee = new EventEmitter();
+
+  var expected = new Error('kaboom');
+  var err;
+  process.nextTick(function () {
+    ee.emit('error', expected);
+  });
+
+  return once(ee, 'myevent').then(function () {
+    throw new Error('should reject')
+  }, function (err) {
+    assert.strictEqual(err, expected);
+    assert.strictEqual(ee.listenerCount('error'), 0);
+    assert.strictEqual(ee.listenerCount('myevent'), 0);
+  });
+}
+
+function stopListeningAfterCatchingError() {
+  var ee = new EventEmitter();
+
+  var expected = new Error('kaboom');
+  var err;
+  process.nextTick(function () {
+    ee.emit('error', expected);
+    ee.emit('myevent', 42, 24);
+  });
+
+  // process.on('multipleResolves', common.mustNotCall());
+
+  return once(ee, 'myevent').then(common.mustNotCall, function (err) {
+    // process.removeAllListeners('multipleResolves');
+    assert.strictEqual(err, expected);
+    assert.strictEqual(ee.listenerCount('error'), 0);
+    assert.strictEqual(ee.listenerCount('myevent'), 0);
+  });
+}
+
+function onceError() {
+  var ee = new EventEmitter();
+
+  var expected = new Error('kaboom');
+  process.nextTick(function () {
+    ee.emit('error', expected);
+  });
+
+  var promise = once(ee, 'error');
+  assert.strictEqual(ee.listenerCount('error'), 1);
+  return promise.then(function (args) {
+    var err = args[0]
+    assert.strictEqual(err, expected);
+    assert.strictEqual(ee.listenerCount('error'), 0);
+    assert.strictEqual(ee.listenerCount('myevent'), 0);
+  });
+}
+
+function onceWithEventTarget() {
+  var et = new EventTargetMock();
+  var event = new Event('myevent');
+  process.nextTick(function () {
+    et.dispatchEvent(event);
+  });
+  return once(et, 'myevent').then(function (args) {
+    var value = args[0];
+    assert.strictEqual(value, event);
+    assert.strictEqual(has(et.events, 'myevent'), false);
+  });
+}
+
+function onceWithEventTargetError() {
+  var et = new EventTargetMock();
+  var error = new Event('error');
+  process.nextTick(function () {
+    et.dispatchEvent(error);
+  });
+  return once(et, 'error').then(function (args) {
+    var err = args[0];
+    assert.strictEqual(err, error);
+    assert.strictEqual(has(et.events, 'error'), false);
+  });
+}
+
+function prioritizesEventEmitter() {
+  var ee = new EventEmitter();
+  ee.addEventListener = assert.fail;
+  ee.removeAllListeners = assert.fail;
+  process.nextTick(function () {
+    ee.emit('foo');
+  });
+  return once(ee, 'foo');
+}
+
+var allTests = [
+  onceAnEvent(),
+  onceAnEventWithTwoArgs(),
+  catchesErrors(),
+  stopListeningAfterCatchingError(),
+  onceError(),
+  onceWithEventTarget(),
+  onceWithEventTargetError(),
+  prioritizesEventEmitter()
+];
+
+var hasBrowserEventTarget = false;
+try {
+  hasBrowserEventTarget = typeof (new window.EventTarget().addEventListener) === 'function' &&
+    new window.Event('xyz').type === 'xyz';
+} catch (err) {}
+
+if (hasBrowserEventTarget) {
+  var onceWithBrowserEventTarget = function onceWithBrowserEventTarget() {
+    var et = new window.EventTarget();
+    var event = new window.Event('myevent');
+    process.nextTick(function () {
+      et.dispatchEvent(event);
+    });
+    return once(et, 'myevent').then(function (args) {
+      var value = args[0];
+      assert.strictEqual(value, event);
+      assert.strictEqual(has(et.events, 'myevent'), false);
+    });
+  }
+
+  var onceWithBrowserEventTargetError = function onceWithBrowserEventTargetError() {
+    var et = new window.EventTarget();
+    var error = new window.Event('error');
+    process.nextTick(function () {
+      et.dispatchEvent(error);
+    });
+    return once(et, 'error').then(function (args) {
+      var err = args[0];
+      assert.strictEqual(err, error);
+      assert.strictEqual(has(et.events, 'error'), false);
+    });
+  }
+
+  common.test.comment('Testing with browser built-in EventTarget');
+  allTests.push([
+    onceWithBrowserEventTarget(),
+    onceWithBrowserEventTargetError()
+  ]);
+}
+
+module.exports = Promise.all(allTests);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/index.js b/node_modules/mathjs/examples/node_modules/events/tests/index.js
new file mode 100644
index 0000000..2d739e6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/index.js
@@ -0,0 +1,64 @@
+var test = require('tape');
+var functionsHaveNames = require('functions-have-names');
+var hasSymbols = require('has-symbols');
+
+require('./legacy-compat');
+var common = require('./common');
+
+// we do this to easily wrap each file in a mocha test
+// and also have browserify be able to statically analyze this file
+var orig_require = require;
+var require = function(file) {
+    test(file, function(t) {
+        // Store the tape object so tests can access it.
+        t.on('end', function () { delete common.test; });
+        common.test = t;
+
+        try {
+          var exp = orig_require(file);
+          if (exp && exp.then) {
+            exp.then(function () { t.end(); }, t.fail);
+            return;
+          }
+        } catch (err) {
+          t.fail(err);
+        }
+        t.end();
+    });
+};
+
+require('./add-listeners.js');
+require('./check-listener-leaks.js');
+require('./errors.js');
+require('./events-list.js');
+if (typeof Promise === 'function') {
+  require('./events-once.js');
+} else {
+  // Promise support is not available.
+  test('./events-once.js', { skip: true }, function () {});
+}
+require('./listener-count.js');
+require('./listeners-side-effects.js');
+require('./listeners.js');
+require('./max-listeners.js');
+if (functionsHaveNames()) {
+  require('./method-names.js');
+} else {
+  // Function.name is not supported in IE
+  test('./method-names.js', { skip: true }, function () {});
+}
+require('./modify-in-emit.js');
+require('./num-args.js');
+require('./once.js');
+require('./prepend.js');
+require('./set-max-listeners-side-effects.js');
+require('./special-event-names.js');
+require('./subclass.js');
+if (hasSymbols()) {
+  require('./symbols.js');
+} else {
+  // Symbol is not available.
+  test('./symbols.js', { skip: true }, function () {});
+}
+require('./remove-all-listeners.js');
+require('./remove-listeners.js');
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/legacy-compat.js b/node_modules/mathjs/examples/node_modules/events/tests/legacy-compat.js
new file mode 100644
index 0000000..a402be6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/legacy-compat.js
@@ -0,0 +1,16 @@
+// sigh... life is hard
+if (!global.console) {
+    console = {}
+}
+
+var fns = ['log', 'error', 'trace'];
+for (var i=0 ; i<fns.length ; ++i) {
+    var fn = fns[i];
+    if (!console[fn]) {
+        console[fn] = function() {};
+    }
+}
+
+if (!Array.isArray) {
+    Array.isArray = require('isarray');
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/listener-count.js b/node_modules/mathjs/examples/node_modules/events/tests/listener-count.js
new file mode 100644
index 0000000..9d422d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/listener-count.js
@@ -0,0 +1,37 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+require('./common');
+var assert = require('assert');
+var EventEmitter = require('../');
+
+var emitter = new EventEmitter();
+emitter.on('foo', function() {});
+emitter.on('foo', function() {});
+emitter.on('baz', function() {});
+// Allow any type
+emitter.on(123, function() {});
+
+assert.strictEqual(EventEmitter.listenerCount(emitter, 'foo'), 2);
+assert.strictEqual(emitter.listenerCount('foo'), 2);
+assert.strictEqual(emitter.listenerCount('bar'), 0);
+assert.strictEqual(emitter.listenerCount('baz'), 1);
+assert.strictEqual(emitter.listenerCount(123), 1);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/listeners-side-effects.js b/node_modules/mathjs/examples/node_modules/events/tests/listeners-side-effects.js
new file mode 100644
index 0000000..180f833
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/listeners-side-effects.js
@@ -0,0 +1,56 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+require('./common');
+var assert = require('assert');
+
+var EventEmitter = require('../').EventEmitter;
+
+var e = new EventEmitter();
+var fl;  // foo listeners
+
+fl = e.listeners('foo');
+assert.ok(Array.isArray(fl));
+assert.strictEqual(fl.length, 0);
+if (Object.create) assert.ok(!(e._events instanceof Object));
+assert.strictEqual(Object.keys(e._events).length, 0);
+
+e.on('foo', assert.fail);
+fl = e.listeners('foo');
+assert.strictEqual(e._events.foo, assert.fail);
+assert.ok(Array.isArray(fl));
+assert.strictEqual(fl.length, 1);
+assert.strictEqual(fl[0], assert.fail);
+
+e.listeners('bar');
+
+e.on('foo', assert.ok);
+fl = e.listeners('foo');
+
+assert.ok(Array.isArray(e._events.foo));
+assert.strictEqual(e._events.foo.length, 2);
+assert.strictEqual(e._events.foo[0], assert.fail);
+assert.strictEqual(e._events.foo[1], assert.ok);
+
+assert.ok(Array.isArray(fl));
+assert.strictEqual(fl.length, 2);
+assert.strictEqual(fl[0], assert.fail);
+assert.strictEqual(fl[1], assert.ok);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/listeners.js b/node_modules/mathjs/examples/node_modules/events/tests/listeners.js
new file mode 100644
index 0000000..1909d2d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/listeners.js
@@ -0,0 +1,168 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+require('./common');
+var assert = require('assert');
+var events = require('../');
+var util = require('util');
+
+function listener() {}
+function listener2() {}
+function listener3() {
+  return 0;
+}
+function listener4() {
+  return 1;
+}
+
+function TestStream() {}
+util.inherits(TestStream, events.EventEmitter);
+
+{
+  var ee = new events.EventEmitter();
+  ee.on('foo', listener);
+  var fooListeners = ee.listeners('foo');
+
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 1);
+  assert.strictEqual(listeners[0], listener);
+
+  ee.removeAllListeners('foo');
+  listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+
+  assert.ok(Array.isArray(fooListeners));
+  assert.strictEqual(fooListeners.length, 1);
+  assert.strictEqual(fooListeners[0], listener);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee.on('foo', listener);
+
+  var eeListenersCopy = ee.listeners('foo');
+  assert.ok(Array.isArray(eeListenersCopy));
+  assert.strictEqual(eeListenersCopy.length, 1);
+  assert.strictEqual(eeListenersCopy[0], listener);
+
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 1);
+  assert.strictEqual(listeners[0], listener);
+
+  eeListenersCopy.push(listener2);
+  listeners = ee.listeners('foo');
+  
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 1);
+  assert.strictEqual(listeners[0], listener);
+
+  assert.strictEqual(eeListenersCopy.length, 2);
+  assert.strictEqual(eeListenersCopy[0], listener);
+  assert.strictEqual(eeListenersCopy[1], listener2);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee.on('foo', listener);
+  var eeListenersCopy = ee.listeners('foo');
+  ee.on('foo', listener2);
+
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 2);
+  assert.strictEqual(listeners[0], listener);
+  assert.strictEqual(listeners[1], listener2);
+
+  assert.ok(Array.isArray(eeListenersCopy));
+  assert.strictEqual(eeListenersCopy.length, 1);
+  assert.strictEqual(eeListenersCopy[0], listener);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee.once('foo', listener);
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 1);
+  assert.strictEqual(listeners[0], listener);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee.on('foo', listener);
+  ee.once('foo', listener2);
+
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 2);
+  assert.strictEqual(listeners[0], listener);
+  assert.strictEqual(listeners[1], listener2);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee._events = undefined;
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+}
+
+{
+  var s = new TestStream();
+  var listeners = s.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+}
+
+
+{
+  var ee = new events.EventEmitter();
+  ee.on('foo', listener);
+  var wrappedListener = ee.rawListeners('foo');
+  assert.strictEqual(wrappedListener.length, 1);
+  assert.strictEqual(wrappedListener[0], listener);
+  assert.notStrictEqual(wrappedListener, ee.rawListeners('foo'));
+  ee.once('foo', listener);
+  var wrappedListeners = ee.rawListeners('foo');
+  assert.strictEqual(wrappedListeners.length, 2);
+  assert.strictEqual(wrappedListeners[0], listener);
+  assert.notStrictEqual(wrappedListeners[1], listener);
+  assert.strictEqual(wrappedListeners[1].listener, listener);
+  assert.notStrictEqual(wrappedListeners, ee.rawListeners('foo'));
+  ee.emit('foo');
+  assert.strictEqual(wrappedListeners.length, 2);
+  assert.strictEqual(wrappedListeners[1].listener, listener);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee.once('foo', listener3);
+  ee.on('foo', listener4);
+  var rawListeners = ee.rawListeners('foo');
+  assert.strictEqual(rawListeners.length, 2);
+  assert.strictEqual(rawListeners[0](), 0);
+  var rawListener = ee.rawListeners('foo');
+  assert.strictEqual(rawListener.length, 1);
+  assert.strictEqual(rawListener[0](), 1);
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/max-listeners.js b/node_modules/mathjs/examples/node_modules/events/tests/max-listeners.js
new file mode 100644
index 0000000..0b43953
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/max-listeners.js
@@ -0,0 +1,47 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('./common');
+var assert = require('assert');
+var events = require('../');
+var e = new events.EventEmitter();
+
+var hasDefineProperty = !!Object.defineProperty;
+try { Object.defineProperty({}, 'x', { value: 0 }); } catch (err) { hasDefineProperty = false }
+
+e.on('maxListeners', common.mustCall());
+
+// Should not corrupt the 'maxListeners' queue.
+e.setMaxListeners(42);
+
+var throwsObjs = [NaN, -1, 'and even this'];
+var maxError = /^RangeError: The value of "n" is out of range\. It must be a non-negative number\./;
+var defError = /^RangeError: The value of "defaultMaxListeners" is out of range\. It must be a non-negative number\./;
+
+for (var i = 0; i < throwsObjs.length; i++) {
+  var obj = throwsObjs[i];
+  assert.throws(function() { e.setMaxListeners(obj); }, maxError);
+  if (hasDefineProperty) {
+    assert.throws(function() { events.defaultMaxListeners = obj; }, defError);
+  }
+}
+
+e.emit('maxListeners');
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/method-names.js b/node_modules/mathjs/examples/node_modules/events/tests/method-names.js
new file mode 100644
index 0000000..364a161
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/method-names.js
@@ -0,0 +1,35 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+'use strict';
+require('./common');
+var assert = require('assert');
+var events = require('../');
+
+var E = events.EventEmitter.prototype;
+assert.strictEqual(E.constructor.name, 'EventEmitter');
+assert.strictEqual(E.on, E.addListener);  // Same method.
+assert.strictEqual(E.off, E.removeListener);  // Same method.
+Object.getOwnPropertyNames(E).forEach(function(name) {
+  if (name === 'constructor' || name === 'on' || name === 'off') return;
+  if (typeof E[name] !== 'function') return;
+  assert.strictEqual(E[name].name, name);
+});
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/modify-in-emit.js b/node_modules/mathjs/examples/node_modules/events/tests/modify-in-emit.js
new file mode 100644
index 0000000..53fa633
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/modify-in-emit.js
@@ -0,0 +1,90 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+require('./common');
+var assert = require('assert');
+var events = require('../');
+
+var callbacks_called = [];
+
+var e = new events.EventEmitter();
+
+function callback1() {
+  callbacks_called.push('callback1');
+  e.on('foo', callback2);
+  e.on('foo', callback3);
+  e.removeListener('foo', callback1);
+}
+
+function callback2() {
+  callbacks_called.push('callback2');
+  e.removeListener('foo', callback2);
+}
+
+function callback3() {
+  callbacks_called.push('callback3');
+  e.removeListener('foo', callback3);
+}
+
+e.on('foo', callback1);
+assert.strictEqual(e.listeners('foo').length, 1);
+
+e.emit('foo');
+assert.strictEqual(e.listeners('foo').length, 2);
+assert.ok(Array.isArray(callbacks_called));
+assert.strictEqual(callbacks_called.length, 1);
+assert.strictEqual(callbacks_called[0], 'callback1');
+
+e.emit('foo');
+assert.strictEqual(e.listeners('foo').length, 0);
+assert.ok(Array.isArray(callbacks_called));
+assert.strictEqual(callbacks_called.length, 3);
+assert.strictEqual(callbacks_called[0], 'callback1');
+assert.strictEqual(callbacks_called[1], 'callback2');
+assert.strictEqual(callbacks_called[2], 'callback3');
+
+e.emit('foo');
+assert.strictEqual(e.listeners('foo').length, 0);
+assert.ok(Array.isArray(callbacks_called));
+assert.strictEqual(callbacks_called.length, 3);
+assert.strictEqual(callbacks_called[0], 'callback1');
+assert.strictEqual(callbacks_called[1], 'callback2');
+assert.strictEqual(callbacks_called[2], 'callback3');
+
+e.on('foo', callback1);
+e.on('foo', callback2);
+assert.strictEqual(e.listeners('foo').length, 2);
+e.removeAllListeners('foo');
+assert.strictEqual(e.listeners('foo').length, 0);
+
+// Verify that removing callbacks while in emit allows emits to propagate to
+// all listeners
+callbacks_called = [];
+
+e.on('foo', callback2);
+e.on('foo', callback3);
+assert.strictEqual(2, e.listeners('foo').length);
+e.emit('foo');
+assert.ok(Array.isArray(callbacks_called));
+assert.strictEqual(callbacks_called.length, 2);
+assert.strictEqual(callbacks_called[0], 'callback2');
+assert.strictEqual(callbacks_called[1], 'callback3');
+assert.strictEqual(0, e.listeners('foo').length);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/num-args.js b/node_modules/mathjs/examples/node_modules/events/tests/num-args.js
new file mode 100644
index 0000000..c9b0deb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/num-args.js
@@ -0,0 +1,60 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+require('./common');
+var assert = require('assert');
+var events = require('../');
+
+var e = new events.EventEmitter();
+var num_args_emitted = [];
+
+e.on('numArgs', function() {
+  var numArgs = arguments.length;
+  num_args_emitted.push(numArgs);
+});
+
+e.on('foo', function() {
+  num_args_emitted.push(arguments.length);
+});
+
+e.on('foo', function() {
+  num_args_emitted.push(arguments.length);
+});
+
+e.emit('numArgs');
+e.emit('numArgs', null);
+e.emit('numArgs', null, null);
+e.emit('numArgs', null, null, null);
+e.emit('numArgs', null, null, null, null);
+e.emit('numArgs', null, null, null, null, null);
+
+e.emit('foo', null, null, null, null);
+
+assert.ok(Array.isArray(num_args_emitted));
+assert.strictEqual(num_args_emitted.length, 8);
+assert.strictEqual(num_args_emitted[0], 0);
+assert.strictEqual(num_args_emitted[1], 1);
+assert.strictEqual(num_args_emitted[2], 2);
+assert.strictEqual(num_args_emitted[3], 3);
+assert.strictEqual(num_args_emitted[4], 4);
+assert.strictEqual(num_args_emitted[5], 5);
+assert.strictEqual(num_args_emitted[6], 4);
+assert.strictEqual(num_args_emitted[6], 4);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/once.js b/node_modules/mathjs/examples/node_modules/events/tests/once.js
new file mode 100644
index 0000000..4b36c05
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/once.js
@@ -0,0 +1,83 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('./common');
+var assert = require('assert');
+var EventEmitter = require('../');
+
+var e = new EventEmitter();
+
+e.once('hello', common.mustCall());
+
+e.emit('hello', 'a', 'b');
+e.emit('hello', 'a', 'b');
+e.emit('hello', 'a', 'b');
+e.emit('hello', 'a', 'b');
+
+function remove() {
+  assert.fail('once->foo should not be emitted');
+}
+
+e.once('foo', remove);
+e.removeListener('foo', remove);
+e.emit('foo');
+
+e.once('e', common.mustCall(function() {
+  e.emit('e');
+}));
+
+e.once('e', common.mustCall());
+
+e.emit('e');
+
+// Verify that the listener must be a function
+assert.throws(function() {
+  var ee = new EventEmitter();
+
+  ee.once('foo', null);
+}, /^TypeError: The "listener" argument must be of type Function. Received type object$/);
+
+{
+  // once() has different code paths based on the number of arguments being
+  // emitted. Verify that all of the cases are covered.
+  var maxArgs = 4;
+
+  for (var i = 0; i <= maxArgs; ++i) {
+    var ee = new EventEmitter();
+    var args = ['foo'];
+
+    for (var j = 0; j < i; ++j)
+      args.push(j);
+
+    ee.once('foo', common.mustCall(function() {
+      var params = Array.prototype.slice.call(arguments);
+      var restArgs = args.slice(1);
+      assert.ok(Array.isArray(params));
+      assert.strictEqual(params.length, restArgs.length);
+      for (var index = 0; index < params.length; index++) {
+        var param = params[index];
+        assert.strictEqual(param, restArgs[index]);
+      }
+  	}));
+
+    EventEmitter.prototype.emit.apply(ee, args);
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/prepend.js b/node_modules/mathjs/examples/node_modules/events/tests/prepend.js
new file mode 100644
index 0000000..79afde0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/prepend.js
@@ -0,0 +1,31 @@
+'use strict';
+
+var common = require('./common');
+var EventEmitter = require('../');
+var assert = require('assert');
+
+var myEE = new EventEmitter();
+var m = 0;
+// This one comes last.
+myEE.on('foo', common.mustCall(function () {
+  assert.strictEqual(m, 2);
+}));
+
+// This one comes second.
+myEE.prependListener('foo', common.mustCall(function () {
+  assert.strictEqual(m++, 1);
+}));
+
+// This one comes first.
+myEE.prependOnceListener('foo',
+                         common.mustCall(function () {
+                           assert.strictEqual(m++, 0);
+                         }));
+
+myEE.emit('foo');
+
+// Verify that the listener must be a function
+assert.throws(function () {
+  var ee = new EventEmitter();
+  ee.prependOnceListener('foo', null);
+}, 'TypeError: The "listener" argument must be of type Function. Received type object');
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/remove-all-listeners.js b/node_modules/mathjs/examples/node_modules/events/tests/remove-all-listeners.js
new file mode 100644
index 0000000..622941c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/remove-all-listeners.js
@@ -0,0 +1,133 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('./common');
+var assert = require('assert');
+var events = require('../');
+var test = require('tape');
+
+function expect(expected) {
+  var actual = [];
+  test.onFinish(function() {
+    var sortedActual = actual.sort();
+    var sortedExpected = expected.sort();
+    assert.strictEqual(sortedActual.length, sortedExpected.length);
+    for (var index = 0; index < sortedActual.length; index++) {
+      var value = sortedActual[index];
+      assert.strictEqual(value, sortedExpected[index]);
+    }
+  });
+  function listener(name) {
+    actual.push(name);
+  }
+  return common.mustCall(listener, expected.length);
+}
+
+{
+  var ee = new events.EventEmitter();
+  var noop = common.mustNotCall();
+  ee.on('foo', noop);
+  ee.on('bar', noop);
+  ee.on('baz', noop);
+  ee.on('baz', noop);
+  var fooListeners = ee.listeners('foo');
+  var barListeners = ee.listeners('bar');
+  var bazListeners = ee.listeners('baz');
+  ee.on('removeListener', expect(['bar', 'baz', 'baz']));
+  ee.removeAllListeners('bar');
+  ee.removeAllListeners('baz');
+
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 1);
+  assert.strictEqual(listeners[0], noop);
+
+  listeners = ee.listeners('bar');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+  listeners = ee.listeners('baz');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+  // After calling removeAllListeners(),
+  // the old listeners array should stay unchanged.
+  assert.strictEqual(fooListeners.length, 1);
+  assert.strictEqual(fooListeners[0], noop);
+  assert.strictEqual(barListeners.length, 1);
+  assert.strictEqual(barListeners[0], noop);
+  assert.strictEqual(bazListeners.length, 2);
+  assert.strictEqual(bazListeners[0], noop);
+  assert.strictEqual(bazListeners[1], noop);
+  // After calling removeAllListeners(),
+  // new listeners arrays is different from the old.
+  assert.notStrictEqual(ee.listeners('bar'), barListeners);
+  assert.notStrictEqual(ee.listeners('baz'), bazListeners);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee.on('foo', common.mustNotCall());
+  ee.on('bar', common.mustNotCall());
+  // Expect LIFO order
+  ee.on('removeListener', expect(['foo', 'bar', 'removeListener']));
+  ee.on('removeListener', expect(['foo', 'bar']));
+  ee.removeAllListeners();
+
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+  listeners = ee.listeners('bar');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee.on('removeListener', common.mustNotCall());
+  // Check for regression where removeAllListeners() throws when
+  // there exists a 'removeListener' listener, but there exists
+  // no listeners for the provided event type.
+  assert.doesNotThrow(function () { ee.removeAllListeners(ee, 'foo') });
+}
+
+{
+  var ee = new events.EventEmitter();
+  var expectLength = 2;
+  ee.on('removeListener', function() {
+    assert.strictEqual(expectLength--, this.listeners('baz').length);
+  });
+  ee.on('baz', common.mustNotCall());
+  ee.on('baz', common.mustNotCall());
+  ee.on('baz', common.mustNotCall());
+  assert.strictEqual(ee.listeners('baz').length, expectLength + 1);
+  ee.removeAllListeners('baz');
+  assert.strictEqual(ee.listeners('baz').length, 0);
+}
+
+{
+  var ee = new events.EventEmitter();
+  assert.strictEqual(ee, ee.removeAllListeners());
+}
+
+{
+  var ee = new events.EventEmitter();
+  ee._events = undefined;
+  assert.strictEqual(ee, ee.removeAllListeners());
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/remove-listeners.js b/node_modules/mathjs/examples/node_modules/events/tests/remove-listeners.js
new file mode 100644
index 0000000..18e4d16
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/remove-listeners.js
@@ -0,0 +1,212 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('./common');
+var assert = require('assert');
+var EventEmitter = require('../');
+
+var listener1 = function listener1() {};
+var listener2 = function listener2() {};
+
+{
+  var ee = new EventEmitter();
+  ee.on('hello', listener1);
+  ee.on('removeListener', common.mustCall(function(name, cb) {
+    assert.strictEqual(name, 'hello');
+    assert.strictEqual(cb, listener1);
+  }));
+  ee.removeListener('hello', listener1);
+  var listeners = ee.listeners('hello');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+}
+
+{
+  var ee = new EventEmitter();
+  ee.on('hello', listener1);
+  ee.on('removeListener', common.mustNotCall());
+  ee.removeListener('hello', listener2);
+
+  var listeners = ee.listeners('hello');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 1);
+  assert.strictEqual(listeners[0], listener1);
+}
+
+{
+  var ee = new EventEmitter();
+  ee.on('hello', listener1);
+  ee.on('hello', listener2);
+
+  var listeners;
+  ee.once('removeListener', common.mustCall(function(name, cb) {
+    assert.strictEqual(name, 'hello');
+    assert.strictEqual(cb, listener1);
+    listeners = ee.listeners('hello');
+    assert.ok(Array.isArray(listeners));
+    assert.strictEqual(listeners.length, 1);
+    assert.strictEqual(listeners[0], listener2);
+  }));
+  ee.removeListener('hello', listener1);
+  listeners = ee.listeners('hello');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 1);
+  assert.strictEqual(listeners[0], listener2);
+  ee.once('removeListener', common.mustCall(function(name, cb) {
+    assert.strictEqual(name, 'hello');
+    assert.strictEqual(cb, listener2);
+    listeners = ee.listeners('hello');
+    assert.ok(Array.isArray(listeners));
+    assert.strictEqual(listeners.length, 0);
+  }));
+  ee.removeListener('hello', listener2);
+  listeners = ee.listeners('hello');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+}
+
+{
+  var ee = new EventEmitter();
+
+  function remove1() {
+    assert.fail('remove1 should not have been called');
+  }
+
+  function remove2() {
+    assert.fail('remove2 should not have been called');
+  }
+
+  ee.on('removeListener', common.mustCall(function(name, cb) {
+    if (cb !== remove1) return;
+    this.removeListener('quux', remove2);
+    this.emit('quux');
+  }, 2));
+  ee.on('quux', remove1);
+  ee.on('quux', remove2);
+  ee.removeListener('quux', remove1);
+}
+
+{
+  var ee = new EventEmitter();
+  ee.on('hello', listener1);
+  ee.on('hello', listener2);
+
+  var listeners;
+  ee.once('removeListener', common.mustCall(function(name, cb) {
+    assert.strictEqual(name, 'hello');
+    assert.strictEqual(cb, listener1);
+    listeners = ee.listeners('hello');
+    assert.ok(Array.isArray(listeners));
+    assert.strictEqual(listeners.length, 1);
+    assert.strictEqual(listeners[0], listener2);
+    ee.once('removeListener', common.mustCall(function(name, cb) {
+      assert.strictEqual(name, 'hello');
+      assert.strictEqual(cb, listener2);
+      listeners = ee.listeners('hello');
+      assert.ok(Array.isArray(listeners));
+      assert.strictEqual(listeners.length, 0);
+    }));
+    ee.removeListener('hello', listener2);
+    listeners = ee.listeners('hello');
+    assert.ok(Array.isArray(listeners));
+    assert.strictEqual(listeners.length, 0);
+  }));
+  ee.removeListener('hello', listener1);
+  listeners = ee.listeners('hello');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 0);
+}
+
+{
+  var ee = new EventEmitter();
+  var listener3 = common.mustCall(function() {
+    ee.removeListener('hello', listener4);
+  }, 2);
+  var listener4 = common.mustCall();
+
+  ee.on('hello', listener3);
+  ee.on('hello', listener4);
+
+  // listener4 will still be called although it is removed by listener 3.
+  ee.emit('hello');
+  // This is so because the interal listener array at time of emit
+  // was [listener3,listener4]
+
+  // Interal listener array [listener3]
+  ee.emit('hello');
+}
+
+{
+  var ee = new EventEmitter();
+
+  ee.once('hello', listener1);
+  ee.on('removeListener', common.mustCall(function(eventName, listener) {
+    assert.strictEqual(eventName, 'hello');
+    assert.strictEqual(listener, listener1);
+  }));
+  ee.emit('hello');
+}
+
+{
+  var ee = new EventEmitter();
+
+  assert.strictEqual(ee, ee.removeListener('foo', function() {}));
+}
+
+// Verify that the removed listener must be a function
+assert.throws(function() {
+  var ee = new EventEmitter();
+
+  ee.removeListener('foo', null);
+}, /^TypeError: The "listener" argument must be of type Function\. Received type object$/);
+
+{
+  var ee = new EventEmitter();
+  var listener = function() {};
+  ee._events = undefined;
+  var e = ee.removeListener('foo', listener);
+  assert.strictEqual(e, ee);
+}
+
+{
+  var ee = new EventEmitter();
+
+  ee.on('foo', listener1);
+  ee.on('foo', listener2);
+  var listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 2);
+  assert.strictEqual(listeners[0], listener1);
+  assert.strictEqual(listeners[1], listener2);
+
+  ee.removeListener('foo', listener1);
+  assert.strictEqual(ee._events.foo, listener2);
+
+  ee.on('foo', listener1);
+  listeners = ee.listeners('foo');
+  assert.ok(Array.isArray(listeners));
+  assert.strictEqual(listeners.length, 2);
+  assert.strictEqual(listeners[0], listener2);
+  assert.strictEqual(listeners[1], listener1);
+
+  ee.removeListener('foo', listener1);
+  assert.strictEqual(ee._events.foo, listener2);
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/set-max-listeners-side-effects.js b/node_modules/mathjs/examples/node_modules/events/tests/set-max-listeners-side-effects.js
new file mode 100644
index 0000000..13dbb67
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/set-max-listeners-side-effects.js
@@ -0,0 +1,31 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+require('./common');
+var assert = require('assert');
+var events = require('../');
+
+var e = new events.EventEmitter();
+
+if (Object.create) assert.ok(!(e._events instanceof Object));
+assert.strictEqual(Object.keys(e._events).length, 0);
+e.setMaxListeners(5);
+assert.strictEqual(Object.keys(e._events).length, 0);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/special-event-names.js b/node_modules/mathjs/examples/node_modules/events/tests/special-event-names.js
new file mode 100644
index 0000000..a2f0b74
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/special-event-names.js
@@ -0,0 +1,45 @@
+'use strict';
+
+var common = require('./common');
+var EventEmitter = require('../');
+var assert = require('assert');
+
+var ee = new EventEmitter();
+var handler = function() {};
+
+assert.strictEqual(ee.eventNames().length, 0);
+
+assert.strictEqual(ee._events.hasOwnProperty, undefined);
+assert.strictEqual(ee._events.toString, undefined);
+
+ee.on('__defineGetter__', handler);
+ee.on('toString', handler);
+ee.on('__proto__', handler);
+
+assert.strictEqual(ee.eventNames()[0], '__defineGetter__');
+assert.strictEqual(ee.eventNames()[1], 'toString');
+
+assert.strictEqual(ee.listeners('__defineGetter__').length, 1);
+assert.strictEqual(ee.listeners('__defineGetter__')[0], handler);
+assert.strictEqual(ee.listeners('toString').length, 1);
+assert.strictEqual(ee.listeners('toString')[0], handler);
+
+// Only run __proto__ tests if that property can actually be set
+if ({ __proto__: 'ok' }.__proto__ === 'ok') {
+  assert.strictEqual(ee.eventNames().length, 3);
+  assert.strictEqual(ee.eventNames()[2], '__proto__');
+  assert.strictEqual(ee.listeners('__proto__').length, 1);
+  assert.strictEqual(ee.listeners('__proto__')[0], handler);
+
+  ee.on('__proto__', common.mustCall(function(val) {
+    assert.strictEqual(val, 1);
+  }));
+  ee.emit('__proto__', 1);
+
+  process.on('__proto__', common.mustCall(function(val) {
+    assert.strictEqual(val, 1);
+  }));
+  process.emit('__proto__', 1);
+} else {
+  console.log('# skipped __proto__')
+}
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/subclass.js b/node_modules/mathjs/examples/node_modules/events/tests/subclass.js
new file mode 100644
index 0000000..bd033ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/subclass.js
@@ -0,0 +1,66 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('./common');
+var test = require('tape');
+var assert = require('assert');
+var EventEmitter = require('../').EventEmitter;
+var util = require('util');
+
+util.inherits(MyEE, EventEmitter);
+
+function MyEE(cb) {
+  this.once(1, cb);
+  this.emit(1);
+  this.removeAllListeners();
+  EventEmitter.call(this);
+}
+
+var myee = new MyEE(common.mustCall());
+
+
+util.inherits(ErrorEE, EventEmitter);
+function ErrorEE() {
+  this.emit('error', new Error('blerg'));
+}
+
+assert.throws(function() {
+  new ErrorEE();
+}, /blerg/);
+
+test.onFinish(function() {
+  assert.ok(!(myee._events instanceof Object));
+  assert.strictEqual(Object.keys(myee._events).length, 0);
+});
+
+
+function MyEE2() {
+  EventEmitter.call(this);
+}
+
+MyEE2.prototype = new EventEmitter();
+
+var ee1 = new MyEE2();
+var ee2 = new MyEE2();
+
+ee1.on('x', function() {});
+
+assert.strictEqual(ee2.listenerCount('x'), 0);
diff --git a/node_modules/mathjs/examples/node_modules/events/tests/symbols.js b/node_modules/mathjs/examples/node_modules/events/tests/symbols.js
new file mode 100644
index 0000000..0721f0e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/events/tests/symbols.js
@@ -0,0 +1,25 @@
+'use strict';
+
+var common = require('./common');
+var EventEmitter = require('../');
+var assert = require('assert');
+
+var ee = new EventEmitter();
+var foo = Symbol('foo');
+var listener = common.mustCall();
+
+ee.on(foo, listener);
+assert.strictEqual(ee.listeners(foo).length, 1);
+assert.strictEqual(ee.listeners(foo)[0], listener);
+
+ee.emit(foo);
+
+ee.removeAllListeners();
+assert.strictEqual(ee.listeners(foo).length, 0);
+
+ee.on(foo, listener);
+assert.strictEqual(ee.listeners(foo).length, 1);
+assert.strictEqual(ee.listeners(foo)[0], listener);
+
+ee.removeListener(foo, listener);
+assert.strictEqual(ee.listeners(foo).length, 0);
diff --git a/node_modules/mathjs/examples/node_modules/execa/index.d.ts b/node_modules/mathjs/examples/node_modules/execa/index.d.ts
new file mode 100644
index 0000000..417d535
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/index.d.ts
@@ -0,0 +1,564 @@
+/// <reference types="node"/>
+import {ChildProcess} from 'child_process';
+import {Stream, Readable as ReadableStream} from 'stream';
+
+declare namespace execa {
+	type StdioOption =
+		| 'pipe'
+		| 'ipc'
+		| 'ignore'
+		| 'inherit'
+		| Stream
+		| number
+		| undefined;
+
+	interface CommonOptions<EncodingType> {
+		/**
+		Kill the spawned process when the parent process exits unless either:
+			- the spawned process is [`detached`](https://nodejs.org/api/child_process.html#child_process_options_detached)
+			- the parent process is terminated abruptly, for example, with `SIGKILL` as opposed to `SIGTERM` or a normal exit
+
+		@default true
+		*/
+		readonly cleanup?: boolean;
+
+		/**
+		Prefer locally installed binaries when looking for a binary to execute.
+
+		If you `$ npm install foo`, you can then `execa('foo')`.
+
+		@default false
+		*/
+		readonly preferLocal?: boolean;
+
+		/**
+		Preferred path to find locally installed binaries in (use with `preferLocal`).
+
+		@default process.cwd()
+		*/
+		readonly localDir?: string;
+
+		/**
+		Path to the Node.js executable to use in child processes.
+
+		This can be either an absolute path or a path relative to the `cwd` option.
+
+		Requires `preferLocal` to be `true`.
+
+		For example, this can be used together with [`get-node`](https://github.com/ehmicky/get-node) to run a specific Node.js version in a child process.
+
+		@default process.execPath
+		*/
+		readonly execPath?: string;
+
+		/**
+		Buffer the output from the spawned process. When set to `false`, you must read the output of `stdout` and `stderr` (or `all` if the `all` option is `true`). Otherwise the returned promise will not be resolved/rejected.
+
+		If the spawned process fails, `error.stdout`, `error.stderr`, and `error.all` will contain the buffered data.
+
+		@default true
+		*/
+		readonly buffer?: boolean;
+
+		/**
+		Same options as [`stdio`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio).
+
+		@default 'pipe'
+		*/
+		readonly stdin?: StdioOption;
+
+		/**
+		Same options as [`stdio`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio).
+
+		@default 'pipe'
+		*/
+		readonly stdout?: StdioOption;
+
+		/**
+		Same options as [`stdio`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio).
+
+		@default 'pipe'
+		*/
+		readonly stderr?: StdioOption;
+
+		/**
+		Setting this to `false` resolves the promise with the error instead of rejecting it.
+
+		@default true
+		*/
+		readonly reject?: boolean;
+
+		/**
+		Add an `.all` property on the promise and the resolved value. The property contains the output of the process with `stdout` and `stderr` interleaved.
+
+		@default false
+		*/
+		readonly all?: boolean;
+
+		/**
+		Strip the final [newline character](https://en.wikipedia.org/wiki/Newline) from the output.
+
+		@default true
+		*/
+		readonly stripFinalNewline?: boolean;
+
+		/**
+		Set to `false` if you don't want to extend the environment variables when providing the `env` property.
+
+		@default true
+		*/
+		readonly extendEnv?: boolean;
+
+		/**
+		Current working directory of the child process.
+
+		@default process.cwd()
+		*/
+		readonly cwd?: string;
+
+		/**
+		Environment key-value pairs. Extends automatically from `process.env`. Set `extendEnv` to `false` if you don't want this.
+
+		@default process.env
+		*/
+		readonly env?: NodeJS.ProcessEnv;
+
+		/**
+		Explicitly set the value of `argv[0]` sent to the child process. This will be set to `command` or `file` if not specified.
+		*/
+		readonly argv0?: string;
+
+		/**
+		Child's [stdio](https://nodejs.org/api/child_process.html#child_process_options_stdio) configuration.
+
+		@default 'pipe'
+		*/
+		readonly stdio?: 'pipe' | 'ignore' | 'inherit' | readonly StdioOption[];
+
+		/**
+		Specify the kind of serialization used for sending messages between processes when using the `stdio: 'ipc'` option or `execa.node()`:
+			- `json`: Uses `JSON.stringify()` and `JSON.parse()`.
+			- `advanced`: Uses [`v8.serialize()`](https://nodejs.org/api/v8.html#v8_v8_serialize_value)
+
+		Requires Node.js `13.2.0` or later.
+
+		[More info.](https://nodejs.org/api/child_process.html#child_process_advanced_serialization)
+
+		@default 'json'
+		*/
+		readonly serialization?: 'json' | 'advanced';
+
+		/**
+		Prepare child to run independently of its parent process. Specific behavior [depends on the platform](https://nodejs.org/api/child_process.html#child_process_options_detached).
+
+		@default false
+		*/
+		readonly detached?: boolean;
+
+		/**
+		Sets the user identity of the process.
+		*/
+		readonly uid?: number;
+
+		/**
+		Sets the group identity of the process.
+		*/
+		readonly gid?: number;
+
+		/**
+		If `true`, runs `command` inside of a shell. Uses `/bin/sh` on UNIX and `cmd.exe` on Windows. A different shell can be specified as a string. The shell should understand the `-c` switch on UNIX or `/d /s /c` on Windows.
+
+		We recommend against using this option since it is:
+		- not cross-platform, encouraging shell-specific syntax.
+		- slower, because of the additional shell interpretation.
+		- unsafe, potentially allowing command injection.
+
+		@default false
+		*/
+		readonly shell?: boolean | string;
+
+		/**
+		Specify the character encoding used to decode the `stdout` and `stderr` output. If set to `null`, then `stdout` and `stderr` will be a `Buffer` instead of a string.
+
+		@default 'utf8'
+		*/
+		readonly encoding?: EncodingType;
+
+		/**
+		If `timeout` is greater than `0`, the parent will send the signal identified by the `killSignal` property (the default is `SIGTERM`) if the child runs longer than `timeout` milliseconds.
+
+		@default 0
+		*/
+		readonly timeout?: number;
+
+		/**
+		Largest amount of data in bytes allowed on `stdout` or `stderr`. Default: 100 MB.
+
+		@default 100_000_000
+		*/
+		readonly maxBuffer?: number;
+
+		/**
+		Signal value to be used when the spawned process will be killed.
+
+		@default 'SIGTERM'
+		*/
+		readonly killSignal?: string | number;
+
+		/**
+		If `true`, no quoting or escaping of arguments is done on Windows. Ignored on other platforms. This is set to `true` automatically when the `shell` option is `true`.
+
+		@default false
+		*/
+		readonly windowsVerbatimArguments?: boolean;
+
+		/**
+		On Windows, do not create a new console window. Please note this also prevents `CTRL-C` [from working](https://github.com/nodejs/node/issues/29837) on Windows.
+
+		@default true
+		*/
+		readonly windowsHide?: boolean;
+	}
+
+	interface Options<EncodingType = string> extends CommonOptions<EncodingType> {
+		/**
+		Write some input to the `stdin` of your binary.
+		*/
+		readonly input?: string | Buffer | ReadableStream;
+	}
+
+	interface SyncOptions<EncodingType = string> extends CommonOptions<EncodingType> {
+		/**
+		Write some input to the `stdin` of your binary.
+		*/
+		readonly input?: string | Buffer;
+	}
+
+	interface NodeOptions<EncodingType = string> extends Options<EncodingType> {
+		/**
+		The Node.js executable to use.
+
+		@default process.execPath
+		*/
+		readonly nodePath?: string;
+
+		/**
+		List of [CLI options](https://nodejs.org/api/cli.html#cli_options) passed to the Node.js executable.
+
+		@default process.execArgv
+		*/
+		readonly nodeOptions?: string[];
+	}
+
+	interface ExecaReturnBase<StdoutStderrType> {
+		/**
+		The file and arguments that were run, for logging purposes.
+
+		This is not escaped and should not be executed directly as a process, including using `execa()` or `execa.command()`.
+		*/
+		command: string;
+
+		/**
+		Same as `command` but escaped.
+
+		This is meant to be copy and pasted into a shell, for debugging purposes.
+		Since the escaping is fairly basic, this should not be executed directly as a process, including using `execa()` or `execa.command()`.
+		*/
+		escapedCommand: string;
+
+		/**
+		The numeric exit code of the process that was run.
+		*/
+		exitCode: number;
+
+		/**
+		The output of the process on stdout.
+		*/
+		stdout: StdoutStderrType;
+
+		/**
+		The output of the process on stderr.
+		*/
+		stderr: StdoutStderrType;
+
+		/**
+		Whether the process failed to run.
+		*/
+		failed: boolean;
+
+		/**
+		Whether the process timed out.
+		*/
+		timedOut: boolean;
+
+		/**
+		Whether the process was killed.
+		*/
+		killed: boolean;
+
+		/**
+		The name of the signal that was used to terminate the process. For example, `SIGFPE`.
+
+		If a signal terminated the process, this property is defined and included in the error message. Otherwise it is `undefined`.
+		*/
+		signal?: string;
+
+		/**
+		A human-friendly description of the signal that was used to terminate the process. For example, `Floating point arithmetic error`.
+
+		If a signal terminated the process, this property is defined and included in the error message. Otherwise it is `undefined`. It is also `undefined` when the signal is very uncommon which should seldomly happen.
+		*/
+		signalDescription?: string;
+	}
+
+	interface ExecaSyncReturnValue<StdoutErrorType = string>
+		extends ExecaReturnBase<StdoutErrorType> {
+	}
+
+	/**
+	Result of a child process execution. On success this is a plain object. On failure this is also an `Error` instance.
+
+	The child process fails when:
+	- its exit code is not `0`
+	- it was killed with a signal
+	- timing out
+	- being canceled
+	- there's not enough memory or there are already too many child processes
+	*/
+	interface ExecaReturnValue<StdoutErrorType = string>
+		extends ExecaSyncReturnValue<StdoutErrorType> {
+		/**
+		The output of the process with `stdout` and `stderr` interleaved.
+
+		This is `undefined` if either:
+		- the `all` option is `false` (default value)
+		- `execa.sync()` was used
+		*/
+		all?: StdoutErrorType;
+
+		/**
+		Whether the process was canceled.
+		*/
+		isCanceled: boolean;
+	}
+
+	interface ExecaSyncError<StdoutErrorType = string>
+		extends Error,
+		ExecaReturnBase<StdoutErrorType> {
+		/**
+		Error message when the child process failed to run. In addition to the underlying error message, it also contains some information related to why the child process errored.
+
+		The child process stderr then stdout are appended to the end, separated with newlines and not interleaved.
+		*/
+		message: string;
+
+		/**
+		This is the same as the `message` property except it does not include the child process stdout/stderr.
+		*/
+		shortMessage: string;
+
+		/**
+		Original error message. This is the same as the `message` property except it includes neither the child process stdout/stderr nor some additional information added by Execa.
+
+		This is `undefined` unless the child process exited due to an `error` event or a timeout.
+		*/
+		originalMessage?: string;
+	}
+
+	interface ExecaError<StdoutErrorType = string>
+		extends ExecaSyncError<StdoutErrorType> {
+		/**
+		The output of the process with `stdout` and `stderr` interleaved.
+
+		This is `undefined` if either:
+		- the `all` option is `false` (default value)
+		- `execa.sync()` was used
+		*/
+		all?: StdoutErrorType;
+
+		/**
+		Whether the process was canceled.
+		*/
+		isCanceled: boolean;
+	}
+
+	interface KillOptions {
+		/**
+		Milliseconds to wait for the child process to terminate before sending `SIGKILL`.
+
+		Can be disabled with `false`.
+
+		@default 5000
+		*/
+		forceKillAfterTimeout?: number | false;
+	}
+
+	interface ExecaChildPromise<StdoutErrorType> {
+		/**
+		Stream combining/interleaving [`stdout`](https://nodejs.org/api/child_process.html#child_process_subprocess_stdout) and [`stderr`](https://nodejs.org/api/child_process.html#child_process_subprocess_stderr).
+
+		This is `undefined` if either:
+			- the `all` option is `false` (the default value)
+			- both `stdout` and `stderr` options are set to [`'inherit'`, `'ipc'`, `Stream` or `integer`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio)
+		*/
+		all?: ReadableStream;
+
+		catch<ResultType = never>(
+			onRejected?: (reason: ExecaError<StdoutErrorType>) => ResultType | PromiseLike<ResultType>
+		): Promise<ExecaReturnValue<StdoutErrorType> | ResultType>;
+
+		/**
+		Same as the original [`child_process#kill()`](https://nodejs.org/api/child_process.html#child_process_subprocess_kill_signal), except if `signal` is `SIGTERM` (the default value) and the child process is not terminated after 5 seconds, force it by sending `SIGKILL`.
+		*/
+		kill(signal?: string, options?: KillOptions): void;
+
+		/**
+		Similar to [`childProcess.kill()`](https://nodejs.org/api/child_process.html#child_process_subprocess_kill_signal). This is preferred when cancelling the child process execution as the error is more descriptive and [`childProcessResult.isCanceled`](#iscanceled) is set to `true`.
+		*/
+		cancel(): void;
+	}
+
+	type ExecaChildProcess<StdoutErrorType = string> = ChildProcess &
+	ExecaChildPromise<StdoutErrorType> &
+	Promise<ExecaReturnValue<StdoutErrorType>>;
+}
+
+declare const execa: {
+	/**
+	Execute a file.
+
+	Think of this as a mix of `child_process.execFile` and `child_process.spawn`.
+
+	@param file - The program/script to execute.
+	@param arguments - Arguments to pass to `file` on execution.
+	@returns A [`child_process` instance](https://nodejs.org/api/child_process.html#child_process_class_childprocess), which is enhanced to also be a `Promise` for a result `Object` with `stdout` and `stderr` properties.
+
+	@example
+	```
+	import execa = require('execa');
+
+	(async () => {
+		const {stdout} = await execa('echo', ['unicorns']);
+		console.log(stdout);
+		//=> 'unicorns'
+
+		// Cancelling a spawned process
+
+		const subprocess = execa('node');
+
+		setTimeout(() => {
+			subprocess.cancel()
+		}, 1000);
+
+		try {
+			await subprocess;
+		} catch (error) {
+			console.log(subprocess.killed); // true
+			console.log(error.isCanceled); // true
+		}
+	})();
+
+	// Pipe the child process stdout to the current stdout
+	execa('echo', ['unicorns']).stdout.pipe(process.stdout);
+	```
+	*/
+	(
+		file: string,
+		arguments?: readonly string[],
+		options?: execa.Options
+	): execa.ExecaChildProcess;
+	(
+		file: string,
+		arguments?: readonly string[],
+		options?: execa.Options<null>
+	): execa.ExecaChildProcess<Buffer>;
+	(file: string, options?: execa.Options): execa.ExecaChildProcess;
+	(file: string, options?: execa.Options<null>): execa.ExecaChildProcess<
+	Buffer
+	>;
+
+	/**
+	Execute a file synchronously.
+
+	This method throws an `Error` if the command fails.
+
+	@param file - The program/script to execute.
+	@param arguments - Arguments to pass to `file` on execution.
+	@returns A result `Object` with `stdout` and `stderr` properties.
+	*/
+	sync(
+		file: string,
+		arguments?: readonly string[],
+		options?: execa.SyncOptions
+	): execa.ExecaSyncReturnValue;
+	sync(
+		file: string,
+		arguments?: readonly string[],
+		options?: execa.SyncOptions<null>
+	): execa.ExecaSyncReturnValue<Buffer>;
+	sync(file: string, options?: execa.SyncOptions): execa.ExecaSyncReturnValue;
+	sync(
+		file: string,
+		options?: execa.SyncOptions<null>
+	): execa.ExecaSyncReturnValue<Buffer>;
+
+	/**
+	Same as `execa()` except both file and arguments are specified in a single `command` string. For example, `execa('echo', ['unicorns'])` is the same as `execa.command('echo unicorns')`.
+
+	If the file or an argument contains spaces, they must be escaped with backslashes. This matters especially if `command` is not a constant but a variable, for example with `__dirname` or `process.cwd()`. Except for spaces, no escaping/quoting is needed.
+
+	The `shell` option must be used if the `command` uses shell-specific features (for example, `&&` or `||`), as opposed to being a simple `file` followed by its `arguments`.
+
+	@param command - The program/script to execute and its arguments.
+	@returns A [`child_process` instance](https://nodejs.org/api/child_process.html#child_process_class_childprocess), which is enhanced to also be a `Promise` for a result `Object` with `stdout` and `stderr` properties.
+
+	@example
+	```
+	import execa = require('execa');
+
+	(async () => {
+		const {stdout} = await execa.command('echo unicorns');
+		console.log(stdout);
+		//=> 'unicorns'
+	})();
+	```
+	*/
+	command(command: string, options?: execa.Options): execa.ExecaChildProcess;
+	command(command: string, options?: execa.Options<null>): execa.ExecaChildProcess<Buffer>;
+
+	/**
+	Same as `execa.command()` but synchronous.
+
+	@param command - The program/script to execute and its arguments.
+	@returns A result `Object` with `stdout` and `stderr` properties.
+	*/
+	commandSync(command: string, options?: execa.SyncOptions): execa.ExecaSyncReturnValue;
+	commandSync(command: string, options?: execa.SyncOptions<null>): execa.ExecaSyncReturnValue<Buffer>;
+
+	/**
+	Execute a Node.js script as a child process.
+
+	Same as `execa('node', [scriptPath, ...arguments], options)` except (like [`child_process#fork()`](https://nodejs.org/api/child_process.html#child_process_child_process_fork_modulepath_args_options)):
+		- the current Node version and options are used. This can be overridden using the `nodePath` and `nodeArguments` options.
+		- the `shell` option cannot be used
+		- an extra channel [`ipc`](https://nodejs.org/api/child_process.html#child_process_options_stdio) is passed to [`stdio`](#stdio)
+
+	@param scriptPath - Node.js script to execute.
+	@param arguments - Arguments to pass to `scriptPath` on execution.
+	@returns A [`child_process` instance](https://nodejs.org/api/child_process.html#child_process_class_childprocess), which is enhanced to also be a `Promise` for a result `Object` with `stdout` and `stderr` properties.
+	*/
+	node(
+		scriptPath: string,
+		arguments?: readonly string[],
+		options?: execa.NodeOptions
+	): execa.ExecaChildProcess;
+	node(
+		scriptPath: string,
+		arguments?: readonly string[],
+		options?: execa.Options<null>
+	): execa.ExecaChildProcess<Buffer>;
+	node(scriptPath: string, options?: execa.Options): execa.ExecaChildProcess;
+	node(scriptPath: string, options?: execa.Options<null>): execa.ExecaChildProcess<Buffer>;
+};
+
+export = execa;
diff --git a/node_modules/mathjs/examples/node_modules/execa/index.js b/node_modules/mathjs/examples/node_modules/execa/index.js
new file mode 100644
index 0000000..6fc9f12
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/index.js
@@ -0,0 +1,268 @@
+'use strict';
+const path = require('path');
+const childProcess = require('child_process');
+const crossSpawn = require('cross-spawn');
+const stripFinalNewline = require('strip-final-newline');
+const npmRunPath = require('npm-run-path');
+const onetime = require('onetime');
+const makeError = require('./lib/error');
+const normalizeStdio = require('./lib/stdio');
+const {spawnedKill, spawnedCancel, setupTimeout, validateTimeout, setExitHandler} = require('./lib/kill');
+const {handleInput, getSpawnedResult, makeAllStream, validateInputSync} = require('./lib/stream');
+const {mergePromise, getSpawnedPromise} = require('./lib/promise');
+const {joinCommand, parseCommand, getEscapedCommand} = require('./lib/command');
+
+const DEFAULT_MAX_BUFFER = 1000 * 1000 * 100;
+
+const getEnv = ({env: envOption, extendEnv, preferLocal, localDir, execPath}) => {
+	const env = extendEnv ? {...process.env, ...envOption} : envOption;
+
+	if (preferLocal) {
+		return npmRunPath.env({env, cwd: localDir, execPath});
+	}
+
+	return env;
+};
+
+const handleArguments = (file, args, options = {}) => {
+	const parsed = crossSpawn._parse(file, args, options);
+	file = parsed.command;
+	args = parsed.args;
+	options = parsed.options;
+
+	options = {
+		maxBuffer: DEFAULT_MAX_BUFFER,
+		buffer: true,
+		stripFinalNewline: true,
+		extendEnv: true,
+		preferLocal: false,
+		localDir: options.cwd || process.cwd(),
+		execPath: process.execPath,
+		encoding: 'utf8',
+		reject: true,
+		cleanup: true,
+		all: false,
+		windowsHide: true,
+		...options
+	};
+
+	options.env = getEnv(options);
+
+	options.stdio = normalizeStdio(options);
+
+	if (process.platform === 'win32' && path.basename(file, '.exe') === 'cmd') {
+		// #116
+		args.unshift('/q');
+	}
+
+	return {file, args, options, parsed};
+};
+
+const handleOutput = (options, value, error) => {
+	if (typeof value !== 'string' && !Buffer.isBuffer(value)) {
+		// When `execa.sync()` errors, we normalize it to '' to mimic `execa()`
+		return error === undefined ? undefined : '';
+	}
+
+	if (options.stripFinalNewline) {
+		return stripFinalNewline(value);
+	}
+
+	return value;
+};
+
+const execa = (file, args, options) => {
+	const parsed = handleArguments(file, args, options);
+	const command = joinCommand(file, args);
+	const escapedCommand = getEscapedCommand(file, args);
+
+	validateTimeout(parsed.options);
+
+	let spawned;
+	try {
+		spawned = childProcess.spawn(parsed.file, parsed.args, parsed.options);
+	} catch (error) {
+		// Ensure the returned error is always both a promise and a child process
+		const dummySpawned = new childProcess.ChildProcess();
+		const errorPromise = Promise.reject(makeError({
+			error,
+			stdout: '',
+			stderr: '',
+			all: '',
+			command,
+			escapedCommand,
+			parsed,
+			timedOut: false,
+			isCanceled: false,
+			killed: false
+		}));
+		return mergePromise(dummySpawned, errorPromise);
+	}
+
+	const spawnedPromise = getSpawnedPromise(spawned);
+	const timedPromise = setupTimeout(spawned, parsed.options, spawnedPromise);
+	const processDone = setExitHandler(spawned, parsed.options, timedPromise);
+
+	const context = {isCanceled: false};
+
+	spawned.kill = spawnedKill.bind(null, spawned.kill.bind(spawned));
+	spawned.cancel = spawnedCancel.bind(null, spawned, context);
+
+	const handlePromise = async () => {
+		const [{error, exitCode, signal, timedOut}, stdoutResult, stderrResult, allResult] = await getSpawnedResult(spawned, parsed.options, processDone);
+		const stdout = handleOutput(parsed.options, stdoutResult);
+		const stderr = handleOutput(parsed.options, stderrResult);
+		const all = handleOutput(parsed.options, allResult);
+
+		if (error || exitCode !== 0 || signal !== null) {
+			const returnedError = makeError({
+				error,
+				exitCode,
+				signal,
+				stdout,
+				stderr,
+				all,
+				command,
+				escapedCommand,
+				parsed,
+				timedOut,
+				isCanceled: context.isCanceled,
+				killed: spawned.killed
+			});
+
+			if (!parsed.options.reject) {
+				return returnedError;
+			}
+
+			throw returnedError;
+		}
+
+		return {
+			command,
+			escapedCommand,
+			exitCode: 0,
+			stdout,
+			stderr,
+			all,
+			failed: false,
+			timedOut: false,
+			isCanceled: false,
+			killed: false
+		};
+	};
+
+	const handlePromiseOnce = onetime(handlePromise);
+
+	handleInput(spawned, parsed.options.input);
+
+	spawned.all = makeAllStream(spawned, parsed.options);
+
+	return mergePromise(spawned, handlePromiseOnce);
+};
+
+module.exports = execa;
+
+module.exports.sync = (file, args, options) => {
+	const parsed = handleArguments(file, args, options);
+	const command = joinCommand(file, args);
+	const escapedCommand = getEscapedCommand(file, args);
+
+	validateInputSync(parsed.options);
+
+	let result;
+	try {
+		result = childProcess.spawnSync(parsed.file, parsed.args, parsed.options);
+	} catch (error) {
+		throw makeError({
+			error,
+			stdout: '',
+			stderr: '',
+			all: '',
+			command,
+			escapedCommand,
+			parsed,
+			timedOut: false,
+			isCanceled: false,
+			killed: false
+		});
+	}
+
+	const stdout = handleOutput(parsed.options, result.stdout, result.error);
+	const stderr = handleOutput(parsed.options, result.stderr, result.error);
+
+	if (result.error || result.status !== 0 || result.signal !== null) {
+		const error = makeError({
+			stdout,
+			stderr,
+			error: result.error,
+			signal: result.signal,
+			exitCode: result.status,
+			command,
+			escapedCommand,
+			parsed,
+			timedOut: result.error && result.error.code === 'ETIMEDOUT',
+			isCanceled: false,
+			killed: result.signal !== null
+		});
+
+		if (!parsed.options.reject) {
+			return error;
+		}
+
+		throw error;
+	}
+
+	return {
+		command,
+		escapedCommand,
+		exitCode: 0,
+		stdout,
+		stderr,
+		failed: false,
+		timedOut: false,
+		isCanceled: false,
+		killed: false
+	};
+};
+
+module.exports.command = (command, options) => {
+	const [file, ...args] = parseCommand(command);
+	return execa(file, args, options);
+};
+
+module.exports.commandSync = (command, options) => {
+	const [file, ...args] = parseCommand(command);
+	return execa.sync(file, args, options);
+};
+
+module.exports.node = (scriptPath, args, options = {}) => {
+	if (args && !Array.isArray(args) && typeof args === 'object') {
+		options = args;
+		args = [];
+	}
+
+	const stdio = normalizeStdio.node(options);
+	const defaultExecArgv = process.execArgv.filter(arg => !arg.startsWith('--inspect'));
+
+	const {
+		nodePath = process.execPath,
+		nodeOptions = defaultExecArgv
+	} = options;
+
+	return execa(
+		nodePath,
+		[
+			...nodeOptions,
+			scriptPath,
+			...(Array.isArray(args) ? args : [])
+		],
+		{
+			...options,
+			stdin: undefined,
+			stdout: undefined,
+			stderr: undefined,
+			stdio,
+			shell: false
+		}
+	);
+};
diff --git a/node_modules/mathjs/examples/node_modules/execa/lib/command.js b/node_modules/mathjs/examples/node_modules/execa/lib/command.js
new file mode 100644
index 0000000..859b006
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/lib/command.js
@@ -0,0 +1,52 @@
+'use strict';
+const normalizeArgs = (file, args = []) => {
+	if (!Array.isArray(args)) {
+		return [file];
+	}
+
+	return [file, ...args];
+};
+
+const NO_ESCAPE_REGEXP = /^[\w.-]+$/;
+const DOUBLE_QUOTES_REGEXP = /"/g;
+
+const escapeArg = arg => {
+	if (typeof arg !== 'string' || NO_ESCAPE_REGEXP.test(arg)) {
+		return arg;
+	}
+
+	return `"${arg.replace(DOUBLE_QUOTES_REGEXP, '\\"')}"`;
+};
+
+const joinCommand = (file, args) => {
+	return normalizeArgs(file, args).join(' ');
+};
+
+const getEscapedCommand = (file, args) => {
+	return normalizeArgs(file, args).map(arg => escapeArg(arg)).join(' ');
+};
+
+const SPACES_REGEXP = / +/g;
+
+// Handle `execa.command()`
+const parseCommand = command => {
+	const tokens = [];
+	for (const token of command.trim().split(SPACES_REGEXP)) {
+		// Allow spaces to be escaped by a backslash if not meant as a delimiter
+		const previousToken = tokens[tokens.length - 1];
+		if (previousToken && previousToken.endsWith('\\')) {
+			// Merge previous token with current one
+			tokens[tokens.length - 1] = `${previousToken.slice(0, -1)} ${token}`;
+		} else {
+			tokens.push(token);
+		}
+	}
+
+	return tokens;
+};
+
+module.exports = {
+	joinCommand,
+	getEscapedCommand,
+	parseCommand
+};
diff --git a/node_modules/mathjs/examples/node_modules/execa/lib/error.js b/node_modules/mathjs/examples/node_modules/execa/lib/error.js
new file mode 100644
index 0000000..4214467
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/lib/error.js
@@ -0,0 +1,88 @@
+'use strict';
+const {signalsByName} = require('human-signals');
+
+const getErrorPrefix = ({timedOut, timeout, errorCode, signal, signalDescription, exitCode, isCanceled}) => {
+	if (timedOut) {
+		return `timed out after ${timeout} milliseconds`;
+	}
+
+	if (isCanceled) {
+		return 'was canceled';
+	}
+
+	if (errorCode !== undefined) {
+		return `failed with ${errorCode}`;
+	}
+
+	if (signal !== undefined) {
+		return `was killed with ${signal} (${signalDescription})`;
+	}
+
+	if (exitCode !== undefined) {
+		return `failed with exit code ${exitCode}`;
+	}
+
+	return 'failed';
+};
+
+const makeError = ({
+	stdout,
+	stderr,
+	all,
+	error,
+	signal,
+	exitCode,
+	command,
+	escapedCommand,
+	timedOut,
+	isCanceled,
+	killed,
+	parsed: {options: {timeout}}
+}) => {
+	// `signal` and `exitCode` emitted on `spawned.on('exit')` event can be `null`.
+	// We normalize them to `undefined`
+	exitCode = exitCode === null ? undefined : exitCode;
+	signal = signal === null ? undefined : signal;
+	const signalDescription = signal === undefined ? undefined : signalsByName[signal].description;
+
+	const errorCode = error && error.code;
+
+	const prefix = getErrorPrefix({timedOut, timeout, errorCode, signal, signalDescription, exitCode, isCanceled});
+	const execaMessage = `Command ${prefix}: ${command}`;
+	const isError = Object.prototype.toString.call(error) === '[object Error]';
+	const shortMessage = isError ? `${execaMessage}\n${error.message}` : execaMessage;
+	const message = [shortMessage, stderr, stdout].filter(Boolean).join('\n');
+
+	if (isError) {
+		error.originalMessage = error.message;
+		error.message = message;
+	} else {
+		error = new Error(message);
+	}
+
+	error.shortMessage = shortMessage;
+	error.command = command;
+	error.escapedCommand = escapedCommand;
+	error.exitCode = exitCode;
+	error.signal = signal;
+	error.signalDescription = signalDescription;
+	error.stdout = stdout;
+	error.stderr = stderr;
+
+	if (all !== undefined) {
+		error.all = all;
+	}
+
+	if ('bufferedData' in error) {
+		delete error.bufferedData;
+	}
+
+	error.failed = true;
+	error.timedOut = Boolean(timedOut);
+	error.isCanceled = isCanceled;
+	error.killed = killed && !timedOut;
+
+	return error;
+};
+
+module.exports = makeError;
diff --git a/node_modules/mathjs/examples/node_modules/execa/lib/kill.js b/node_modules/mathjs/examples/node_modules/execa/lib/kill.js
new file mode 100644
index 0000000..287a142
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/lib/kill.js
@@ -0,0 +1,115 @@
+'use strict';
+const os = require('os');
+const onExit = require('signal-exit');
+
+const DEFAULT_FORCE_KILL_TIMEOUT = 1000 * 5;
+
+// Monkey-patches `childProcess.kill()` to add `forceKillAfterTimeout` behavior
+const spawnedKill = (kill, signal = 'SIGTERM', options = {}) => {
+	const killResult = kill(signal);
+	setKillTimeout(kill, signal, options, killResult);
+	return killResult;
+};
+
+const setKillTimeout = (kill, signal, options, killResult) => {
+	if (!shouldForceKill(signal, options, killResult)) {
+		return;
+	}
+
+	const timeout = getForceKillAfterTimeout(options);
+	const t = setTimeout(() => {
+		kill('SIGKILL');
+	}, timeout);
+
+	// Guarded because there's no `.unref()` when `execa` is used in the renderer
+	// process in Electron. This cannot be tested since we don't run tests in
+	// Electron.
+	// istanbul ignore else
+	if (t.unref) {
+		t.unref();
+	}
+};
+
+const shouldForceKill = (signal, {forceKillAfterTimeout}, killResult) => {
+	return isSigterm(signal) && forceKillAfterTimeout !== false && killResult;
+};
+
+const isSigterm = signal => {
+	return signal === os.constants.signals.SIGTERM ||
+		(typeof signal === 'string' && signal.toUpperCase() === 'SIGTERM');
+};
+
+const getForceKillAfterTimeout = ({forceKillAfterTimeout = true}) => {
+	if (forceKillAfterTimeout === true) {
+		return DEFAULT_FORCE_KILL_TIMEOUT;
+	}
+
+	if (!Number.isFinite(forceKillAfterTimeout) || forceKillAfterTimeout < 0) {
+		throw new TypeError(`Expected the \`forceKillAfterTimeout\` option to be a non-negative integer, got \`${forceKillAfterTimeout}\` (${typeof forceKillAfterTimeout})`);
+	}
+
+	return forceKillAfterTimeout;
+};
+
+// `childProcess.cancel()`
+const spawnedCancel = (spawned, context) => {
+	const killResult = spawned.kill();
+
+	if (killResult) {
+		context.isCanceled = true;
+	}
+};
+
+const timeoutKill = (spawned, signal, reject) => {
+	spawned.kill(signal);
+	reject(Object.assign(new Error('Timed out'), {timedOut: true, signal}));
+};
+
+// `timeout` option handling
+const setupTimeout = (spawned, {timeout, killSignal = 'SIGTERM'}, spawnedPromise) => {
+	if (timeout === 0 || timeout === undefined) {
+		return spawnedPromise;
+	}
+
+	let timeoutId;
+	const timeoutPromise = new Promise((resolve, reject) => {
+		timeoutId = setTimeout(() => {
+			timeoutKill(spawned, killSignal, reject);
+		}, timeout);
+	});
+
+	const safeSpawnedPromise = spawnedPromise.finally(() => {
+		clearTimeout(timeoutId);
+	});
+
+	return Promise.race([timeoutPromise, safeSpawnedPromise]);
+};
+
+const validateTimeout = ({timeout}) => {
+	if (timeout !== undefined && (!Number.isFinite(timeout) || timeout < 0)) {
+		throw new TypeError(`Expected the \`timeout\` option to be a non-negative integer, got \`${timeout}\` (${typeof timeout})`);
+	}
+};
+
+// `cleanup` option handling
+const setExitHandler = async (spawned, {cleanup, detached}, timedPromise) => {
+	if (!cleanup || detached) {
+		return timedPromise;
+	}
+
+	const removeExitHandler = onExit(() => {
+		spawned.kill();
+	});
+
+	return timedPromise.finally(() => {
+		removeExitHandler();
+	});
+};
+
+module.exports = {
+	spawnedKill,
+	spawnedCancel,
+	setupTimeout,
+	validateTimeout,
+	setExitHandler
+};
diff --git a/node_modules/mathjs/examples/node_modules/execa/lib/promise.js b/node_modules/mathjs/examples/node_modules/execa/lib/promise.js
new file mode 100644
index 0000000..bd9d523
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/lib/promise.js
@@ -0,0 +1,46 @@
+'use strict';
+
+const nativePromisePrototype = (async () => {})().constructor.prototype;
+const descriptors = ['then', 'catch', 'finally'].map(property => [
+	property,
+	Reflect.getOwnPropertyDescriptor(nativePromisePrototype, property)
+]);
+
+// The return value is a mixin of `childProcess` and `Promise`
+const mergePromise = (spawned, promise) => {
+	for (const [property, descriptor] of descriptors) {
+		// Starting the main `promise` is deferred to avoid consuming streams
+		const value = typeof promise === 'function' ?
+			(...args) => Reflect.apply(descriptor.value, promise(), args) :
+			descriptor.value.bind(promise);
+
+		Reflect.defineProperty(spawned, property, {...descriptor, value});
+	}
+
+	return spawned;
+};
+
+// Use promises instead of `child_process` events
+const getSpawnedPromise = spawned => {
+	return new Promise((resolve, reject) => {
+		spawned.on('exit', (exitCode, signal) => {
+			resolve({exitCode, signal});
+		});
+
+		spawned.on('error', error => {
+			reject(error);
+		});
+
+		if (spawned.stdin) {
+			spawned.stdin.on('error', error => {
+				reject(error);
+			});
+		}
+	});
+};
+
+module.exports = {
+	mergePromise,
+	getSpawnedPromise
+};
+
diff --git a/node_modules/mathjs/examples/node_modules/execa/lib/stdio.js b/node_modules/mathjs/examples/node_modules/execa/lib/stdio.js
new file mode 100644
index 0000000..45129ed
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/lib/stdio.js
@@ -0,0 +1,52 @@
+'use strict';
+const aliases = ['stdin', 'stdout', 'stderr'];
+
+const hasAlias = options => aliases.some(alias => options[alias] !== undefined);
+
+const normalizeStdio = options => {
+	if (!options) {
+		return;
+	}
+
+	const {stdio} = options;
+
+	if (stdio === undefined) {
+		return aliases.map(alias => options[alias]);
+	}
+
+	if (hasAlias(options)) {
+		throw new Error(`It's not possible to provide \`stdio\` in combination with one of ${aliases.map(alias => `\`${alias}\``).join(', ')}`);
+	}
+
+	if (typeof stdio === 'string') {
+		return stdio;
+	}
+
+	if (!Array.isArray(stdio)) {
+		throw new TypeError(`Expected \`stdio\` to be of type \`string\` or \`Array\`, got \`${typeof stdio}\``);
+	}
+
+	const length = Math.max(stdio.length, aliases.length);
+	return Array.from({length}, (value, index) => stdio[index]);
+};
+
+module.exports = normalizeStdio;
+
+// `ipc` is pushed unless it is already present
+module.exports.node = options => {
+	const stdio = normalizeStdio(options);
+
+	if (stdio === 'ipc') {
+		return 'ipc';
+	}
+
+	if (stdio === undefined || typeof stdio === 'string') {
+		return [stdio, stdio, stdio, 'ipc'];
+	}
+
+	if (stdio.includes('ipc')) {
+		return stdio;
+	}
+
+	return [...stdio, 'ipc'];
+};
diff --git a/node_modules/mathjs/examples/node_modules/execa/lib/stream.js b/node_modules/mathjs/examples/node_modules/execa/lib/stream.js
new file mode 100644
index 0000000..d445dd4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/lib/stream.js
@@ -0,0 +1,97 @@
+'use strict';
+const isStream = require('is-stream');
+const getStream = require('get-stream');
+const mergeStream = require('merge-stream');
+
+// `input` option
+const handleInput = (spawned, input) => {
+	// Checking for stdin is workaround for https://github.com/nodejs/node/issues/26852
+	// @todo remove `|| spawned.stdin === undefined` once we drop support for Node.js <=12.2.0
+	if (input === undefined || spawned.stdin === undefined) {
+		return;
+	}
+
+	if (isStream(input)) {
+		input.pipe(spawned.stdin);
+	} else {
+		spawned.stdin.end(input);
+	}
+};
+
+// `all` interleaves `stdout` and `stderr`
+const makeAllStream = (spawned, {all}) => {
+	if (!all || (!spawned.stdout && !spawned.stderr)) {
+		return;
+	}
+
+	const mixed = mergeStream();
+
+	if (spawned.stdout) {
+		mixed.add(spawned.stdout);
+	}
+
+	if (spawned.stderr) {
+		mixed.add(spawned.stderr);
+	}
+
+	return mixed;
+};
+
+// On failure, `result.stdout|stderr|all` should contain the currently buffered stream
+const getBufferedData = async (stream, streamPromise) => {
+	if (!stream) {
+		return;
+	}
+
+	stream.destroy();
+
+	try {
+		return await streamPromise;
+	} catch (error) {
+		return error.bufferedData;
+	}
+};
+
+const getStreamPromise = (stream, {encoding, buffer, maxBuffer}) => {
+	if (!stream || !buffer) {
+		return;
+	}
+
+	if (encoding) {
+		return getStream(stream, {encoding, maxBuffer});
+	}
+
+	return getStream.buffer(stream, {maxBuffer});
+};
+
+// Retrieve result of child process: exit code, signal, error, streams (stdout/stderr/all)
+const getSpawnedResult = async ({stdout, stderr, all}, {encoding, buffer, maxBuffer}, processDone) => {
+	const stdoutPromise = getStreamPromise(stdout, {encoding, buffer, maxBuffer});
+	const stderrPromise = getStreamPromise(stderr, {encoding, buffer, maxBuffer});
+	const allPromise = getStreamPromise(all, {encoding, buffer, maxBuffer: maxBuffer * 2});
+
+	try {
+		return await Promise.all([processDone, stdoutPromise, stderrPromise, allPromise]);
+	} catch (error) {
+		return Promise.all([
+			{error, signal: error.signal, timedOut: error.timedOut},
+			getBufferedData(stdout, stdoutPromise),
+			getBufferedData(stderr, stderrPromise),
+			getBufferedData(all, allPromise)
+		]);
+	}
+};
+
+const validateInputSync = ({input}) => {
+	if (isStream(input)) {
+		throw new TypeError('The `input` option cannot be a stream in sync mode');
+	}
+};
+
+module.exports = {
+	handleInput,
+	makeAllStream,
+	getSpawnedResult,
+	validateInputSync
+};
+
diff --git a/node_modules/mathjs/examples/node_modules/execa/license b/node_modules/mathjs/examples/node_modules/execa/license
new file mode 100644
index 0000000..fa7ceba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/execa/package.json b/node_modules/mathjs/examples/node_modules/execa/package.json
new file mode 100644
index 0000000..22556f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/package.json
@@ -0,0 +1,74 @@
+{
+	"name": "execa",
+	"version": "5.1.1",
+	"description": "Process execution for humans",
+	"license": "MIT",
+	"repository": "sindresorhus/execa",
+	"funding": "https://github.com/sindresorhus/execa?sponsor=1",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=10"
+	},
+	"scripts": {
+		"test": "xo && nyc ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts",
+		"lib"
+	],
+	"keywords": [
+		"exec",
+		"child",
+		"process",
+		"execute",
+		"fork",
+		"execfile",
+		"spawn",
+		"file",
+		"shell",
+		"bin",
+		"binary",
+		"binaries",
+		"npm",
+		"path",
+		"local"
+	],
+	"dependencies": {
+		"cross-spawn": "^7.0.3",
+		"get-stream": "^6.0.0",
+		"human-signals": "^2.1.0",
+		"is-stream": "^2.0.0",
+		"merge-stream": "^2.0.0",
+		"npm-run-path": "^4.0.1",
+		"onetime": "^5.1.2",
+		"signal-exit": "^3.0.3",
+		"strip-final-newline": "^2.0.0"
+	},
+	"devDependencies": {
+		"@types/node": "^14.14.10",
+		"ava": "^2.4.0",
+		"get-node": "^11.0.1",
+		"is-running": "^2.1.0",
+		"nyc": "^15.1.0",
+		"p-event": "^4.2.0",
+		"tempfile": "^3.0.0",
+		"tsd": "^0.13.1",
+		"xo": "^0.35.0"
+	},
+	"nyc": {
+		"reporter": [
+			"text",
+			"lcov"
+		],
+		"exclude": [
+			"**/fixtures/**",
+			"**/test.js",
+			"**/test/**"
+		]
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/execa/readme.md b/node_modules/mathjs/examples/node_modules/execa/readme.md
new file mode 100644
index 0000000..843edbc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/execa/readme.md
@@ -0,0 +1,663 @@
+<img src="media/logo.svg" width="400">
+<br>
+
+[![Coverage Status](https://codecov.io/gh/sindresorhus/execa/branch/main/graph/badge.svg)](https://codecov.io/gh/sindresorhus/execa)
+
+> Process execution for humans
+
+## Why
+
+This package improves [`child_process`](https://nodejs.org/api/child_process.html) methods with:
+
+- Promise interface.
+- [Strips the final newline](#stripfinalnewline) from the output so you don't have to do `stdout.trim()`.
+- Supports [shebang](https://en.wikipedia.org/wiki/Shebang_(Unix)) binaries cross-platform.
+- [Improved Windows support.](https://github.com/IndigoUnited/node-cross-spawn#why)
+- Higher max buffer. 100 MB instead of 200 KB.
+- [Executes locally installed binaries by name.](#preferlocal)
+- [Cleans up spawned processes when the parent process dies.](#cleanup)
+- [Get interleaved output](#all) from `stdout` and `stderr` similar to what is printed on the terminal. [*(Async only)*](#execasyncfile-arguments-options)
+- [Can specify file and arguments as a single string without a shell](#execacommandcommand-options)
+- More descriptive errors.
+
+## Install
+
+```
+$ npm install execa
+```
+
+## Usage
+
+```js
+const execa = require('execa');
+
+(async () => {
+	const {stdout} = await execa('echo', ['unicorns']);
+	console.log(stdout);
+	//=> 'unicorns'
+})();
+```
+
+### Pipe the child process stdout to the parent
+
+```js
+const execa = require('execa');
+
+execa('echo', ['unicorns']).stdout.pipe(process.stdout);
+```
+
+### Handling Errors
+
+```js
+const execa = require('execa');
+
+(async () => {
+	// Catching an error
+	try {
+		await execa('unknown', ['command']);
+	} catch (error) {
+		console.log(error);
+		/*
+		{
+			message: 'Command failed with ENOENT: unknown command spawn unknown ENOENT',
+			errno: -2,
+			code: 'ENOENT',
+			syscall: 'spawn unknown',
+			path: 'unknown',
+			spawnargs: ['command'],
+			originalMessage: 'spawn unknown ENOENT',
+			shortMessage: 'Command failed with ENOENT: unknown command spawn unknown ENOENT',
+			command: 'unknown command',
+			escapedCommand: 'unknown command',
+			stdout: '',
+			stderr: '',
+			all: '',
+			failed: true,
+			timedOut: false,
+			isCanceled: false,
+			killed: false
+		}
+		*/
+	}
+
+})();
+```
+
+### Cancelling a spawned process
+
+```js
+const execa = require('execa');
+
+(async () => {
+	const subprocess = execa('node');
+
+	setTimeout(() => {
+		subprocess.cancel();
+	}, 1000);
+
+	try {
+		await subprocess;
+	} catch (error) {
+		console.log(subprocess.killed); // true
+		console.log(error.isCanceled); // true
+	}
+})()
+```
+
+### Catching an error with the sync method
+
+```js
+try {
+	execa.sync('unknown', ['command']);
+} catch (error) {
+	console.log(error);
+	/*
+	{
+		message: 'Command failed with ENOENT: unknown command spawnSync unknown ENOENT',
+		errno: -2,
+		code: 'ENOENT',
+		syscall: 'spawnSync unknown',
+		path: 'unknown',
+		spawnargs: ['command'],
+		originalMessage: 'spawnSync unknown ENOENT',
+		shortMessage: 'Command failed with ENOENT: unknown command spawnSync unknown ENOENT',
+		command: 'unknown command',
+		escapedCommand: 'unknown command',
+		stdout: '',
+		stderr: '',
+		all: '',
+		failed: true,
+		timedOut: false,
+		isCanceled: false,
+		killed: false
+	}
+	*/
+}
+```
+
+### Kill a process
+
+Using SIGTERM, and after 2 seconds, kill it with SIGKILL.
+
+```js
+const subprocess = execa('node');
+
+setTimeout(() => {
+	subprocess.kill('SIGTERM', {
+		forceKillAfterTimeout: 2000
+	});
+}, 1000);
+```
+
+## API
+
+### execa(file, arguments, options?)
+
+Execute a file. Think of this as a mix of [`child_process.execFile()`](https://nodejs.org/api/child_process.html#child_process_child_process_execfile_file_args_options_callback) and [`child_process.spawn()`](https://nodejs.org/api/child_process.html#child_process_child_process_spawn_command_args_options).
+
+No escaping/quoting is needed.
+
+Unless the [`shell`](#shell) option is used, no shell interpreter (Bash, `cmd.exe`, etc.) is used, so shell features such as variables substitution (`echo $PATH`) are not allowed.
+
+Returns a [`child_process` instance](https://nodejs.org/api/child_process.html#child_process_class_childprocess) which:
+  - is also a `Promise` resolving or rejecting with a [`childProcessResult`](#childProcessResult).
+  - exposes the following additional methods and properties.
+
+#### kill(signal?, options?)
+
+Same as the original [`child_process#kill()`](https://nodejs.org/api/child_process.html#child_process_subprocess_kill_signal) except: if `signal` is `SIGTERM` (the default value) and the child process is not terminated after 5 seconds, force it by sending `SIGKILL`.
+
+##### options.forceKillAfterTimeout
+
+Type: `number | false`\
+Default: `5000`
+
+Milliseconds to wait for the child process to terminate before sending `SIGKILL`.
+
+Can be disabled with `false`.
+
+#### cancel()
+
+Similar to [`childProcess.kill()`](https://nodejs.org/api/child_process.html#child_process_subprocess_kill_signal). This is preferred when cancelling the child process execution as the error is more descriptive and [`childProcessResult.isCanceled`](#iscanceled) is set to `true`.
+
+#### all
+
+Type: `ReadableStream | undefined`
+
+Stream combining/interleaving [`stdout`](https://nodejs.org/api/child_process.html#child_process_subprocess_stdout) and [`stderr`](https://nodejs.org/api/child_process.html#child_process_subprocess_stderr).
+
+This is `undefined` if either:
+  - the [`all` option](#all-2) is `false` (the default value)
+  - both [`stdout`](#stdout-1) and [`stderr`](#stderr-1) options are set to [`'inherit'`, `'ipc'`, `Stream` or `integer`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio)
+
+### execa.sync(file, arguments?, options?)
+
+Execute a file synchronously.
+
+Returns or throws a [`childProcessResult`](#childProcessResult).
+
+### execa.command(command, options?)
+
+Same as [`execa()`](#execafile-arguments-options) except both file and arguments are specified in a single `command` string. For example, `execa('echo', ['unicorns'])` is the same as `execa.command('echo unicorns')`.
+
+If the file or an argument contains spaces, they must be escaped with backslashes. This matters especially if `command` is not a constant but a variable, for example with `__dirname` or `process.cwd()`. Except for spaces, no escaping/quoting is needed.
+
+The [`shell` option](#shell) must be used if the `command` uses shell-specific features (for example, `&&` or `||`), as opposed to being a simple `file` followed by its `arguments`.
+
+### execa.commandSync(command, options?)
+
+Same as [`execa.command()`](#execacommand-command-options) but synchronous.
+
+Returns or throws a [`childProcessResult`](#childProcessResult).
+
+### execa.node(scriptPath, arguments?, options?)
+
+Execute a Node.js script as a child process.
+
+Same as `execa('node', [scriptPath, ...arguments], options)` except (like [`child_process#fork()`](https://nodejs.org/api/child_process.html#child_process_child_process_fork_modulepath_args_options)):
+  - the current Node version and options are used. This can be overridden using the [`nodePath`](#nodepath-for-node-only) and [`nodeOptions`](#nodeoptions-for-node-only) options.
+  - the [`shell`](#shell) option cannot be used
+  - an extra channel [`ipc`](https://nodejs.org/api/child_process.html#child_process_options_stdio) is passed to [`stdio`](#stdio)
+
+### childProcessResult
+
+Type: `object`
+
+Result of a child process execution. On success this is a plain object. On failure this is also an `Error` instance.
+
+The child process [fails](#failed) when:
+- its [exit code](#exitcode) is not `0`
+- it was [killed](#killed) with a [signal](#signal)
+- [timing out](#timedout)
+- [being canceled](#iscanceled)
+- there's not enough memory or there are already too many child processes
+
+#### command
+
+Type: `string`
+
+The file and arguments that were run, for logging purposes.
+
+This is not escaped and should not be executed directly as a process, including using [`execa()`](#execafile-arguments-options) or [`execa.command()`](#execacommandcommand-options).
+
+#### escapedCommand
+
+Type: `string`
+
+Same as [`command`](#command) but escaped.
+
+This is meant to be copy and pasted into a shell, for debugging purposes.
+Since the escaping is fairly basic, this should not be executed directly as a process, including using [`execa()`](#execafile-arguments-options) or [`execa.command()`](#execacommandcommand-options).
+
+#### exitCode
+
+Type: `number`
+
+The numeric exit code of the process that was run.
+
+#### stdout
+
+Type: `string | Buffer`
+
+The output of the process on stdout.
+
+#### stderr
+
+Type: `string | Buffer`
+
+The output of the process on stderr.
+
+#### all
+
+Type: `string | Buffer | undefined`
+
+The output of the process with `stdout` and `stderr` interleaved.
+
+This is `undefined` if either:
+  - the [`all` option](#all-2) is `false` (the default value)
+  - `execa.sync()` was used
+
+#### failed
+
+Type: `boolean`
+
+Whether the process failed to run.
+
+#### timedOut
+
+Type: `boolean`
+
+Whether the process timed out.
+
+#### isCanceled
+
+Type: `boolean`
+
+Whether the process was canceled.
+
+#### killed
+
+Type: `boolean`
+
+Whether the process was killed.
+
+#### signal
+
+Type: `string | undefined`
+
+The name of the signal that was used to terminate the process. For example, `SIGFPE`.
+
+If a signal terminated the process, this property is defined and included in the error message. Otherwise it is `undefined`.
+
+#### signalDescription
+
+Type: `string | undefined`
+
+A human-friendly description of the signal that was used to terminate the process. For example, `Floating point arithmetic error`.
+
+If a signal terminated the process, this property is defined and included in the error message. Otherwise it is `undefined`. It is also `undefined` when the signal is very uncommon which should seldomly happen.
+
+#### message
+
+Type: `string`
+
+Error message when the child process failed to run. In addition to the [underlying error message](#originalMessage), it also contains some information related to why the child process errored.
+
+The child process [stderr](#stderr) then [stdout](#stdout) are appended to the end, separated with newlines and not interleaved.
+
+#### shortMessage
+
+Type: `string`
+
+This is the same as the [`message` property](#message) except it does not include the child process stdout/stderr.
+
+#### originalMessage
+
+Type: `string | undefined`
+
+Original error message. This is the same as the `message` property except it includes neither the child process stdout/stderr nor some additional information added by Execa.
+
+This is `undefined` unless the child process exited due to an `error` event or a timeout.
+
+### options
+
+Type: `object`
+
+#### cleanup
+
+Type: `boolean`\
+Default: `true`
+
+Kill the spawned process when the parent process exits unless either:
+	- the spawned process is [`detached`](https://nodejs.org/api/child_process.html#child_process_options_detached)
+	- the parent process is terminated abruptly, for example, with `SIGKILL` as opposed to `SIGTERM` or a normal exit
+
+#### preferLocal
+
+Type: `boolean`\
+Default: `false`
+
+Prefer locally installed binaries when looking for a binary to execute.\
+If you `$ npm install foo`, you can then `execa('foo')`.
+
+#### localDir
+
+Type: `string`\
+Default: `process.cwd()`
+
+Preferred path to find locally installed binaries in (use with `preferLocal`).
+
+#### execPath
+
+Type: `string`\
+Default: `process.execPath` (Current Node.js executable)
+
+Path to the Node.js executable to use in child processes.
+
+This can be either an absolute path or a path relative to the [`cwd` option](#cwd).
+
+Requires [`preferLocal`](#preferlocal) to be `true`.
+
+For example, this can be used together with [`get-node`](https://github.com/ehmicky/get-node) to run a specific Node.js version in a child process.
+
+#### buffer
+
+Type: `boolean`\
+Default: `true`
+
+Buffer the output from the spawned process. When set to `false`, you must read the output of [`stdout`](#stdout-1) and [`stderr`](#stderr-1) (or [`all`](#all) if the [`all`](#all-2) option is `true`). Otherwise the returned promise will not be resolved/rejected.
+
+If the spawned process fails, [`error.stdout`](#stdout), [`error.stderr`](#stderr), and [`error.all`](#all) will contain the buffered data.
+
+#### input
+
+Type: `string | Buffer | stream.Readable`
+
+Write some input to the `stdin` of your binary.\
+Streams are not allowed when using the synchronous methods.
+
+#### stdin
+
+Type: `string | number | Stream | undefined`\
+Default: `pipe`
+
+Same options as [`stdio`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio).
+
+#### stdout
+
+Type: `string | number | Stream | undefined`\
+Default: `pipe`
+
+Same options as [`stdio`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio).
+
+#### stderr
+
+Type: `string | number | Stream | undefined`\
+Default: `pipe`
+
+Same options as [`stdio`](https://nodejs.org/dist/latest-v6.x/docs/api/child_process.html#child_process_options_stdio).
+
+#### all
+
+Type: `boolean`\
+Default: `false`
+
+Add an `.all` property on the [promise](#all) and the [resolved value](#all-1). The property contains the output of the process with `stdout` and `stderr` interleaved.
+
+#### reject
+
+Type: `boolean`\
+Default: `true`
+
+Setting this to `false` resolves the promise with the error instead of rejecting it.
+
+#### stripFinalNewline
+
+Type: `boolean`\
+Default: `true`
+
+Strip the final [newline character](https://en.wikipedia.org/wiki/Newline) from the output.
+
+#### extendEnv
+
+Type: `boolean`\
+Default: `true`
+
+Set to `false` if you don't want to extend the environment variables when providing the `env` property.
+
+---
+
+Execa also accepts the below options which are the same as the options for [`child_process#spawn()`](https://nodejs.org/api/child_process.html#child_process_child_process_spawn_command_args_options)/[`child_process#exec()`](https://nodejs.org/api/child_process.html#child_process_child_process_exec_command_options_callback)
+
+#### cwd
+
+Type: `string`\
+Default: `process.cwd()`
+
+Current working directory of the child process.
+
+#### env
+
+Type: `object`\
+Default: `process.env`
+
+Environment key-value pairs. Extends automatically from `process.env`. Set [`extendEnv`](#extendenv) to `false` if you don't want this.
+
+#### argv0
+
+Type: `string`
+
+Explicitly set the value of `argv[0]` sent to the child process. This will be set to `file` if not specified.
+
+#### stdio
+
+Type: `string | string[]`\
+Default: `pipe`
+
+Child's [stdio](https://nodejs.org/api/child_process.html#child_process_options_stdio) configuration.
+
+#### serialization
+
+Type: `string`\
+Default: `'json'`
+
+Specify the kind of serialization used for sending messages between processes when using the [`stdio: 'ipc'`](#stdio) option or [`execa.node()`](#execanodescriptpath-arguments-options):
+	- `json`: Uses `JSON.stringify()` and `JSON.parse()`.
+	- `advanced`: Uses [`v8.serialize()`](https://nodejs.org/api/v8.html#v8_v8_serialize_value)
+
+Requires Node.js `13.2.0` or later.
+
+[More info.](https://nodejs.org/api/child_process.html#child_process_advanced_serialization)
+
+#### detached
+
+Type: `boolean`
+
+Prepare child to run independently of its parent process. Specific behavior [depends on the platform](https://nodejs.org/api/child_process.html#child_process_options_detached).
+
+#### uid
+
+Type: `number`
+
+Sets the user identity of the process.
+
+#### gid
+
+Type: `number`
+
+Sets the group identity of the process.
+
+#### shell
+
+Type: `boolean | string`\
+Default: `false`
+
+If `true`, runs `file` inside of a shell. Uses `/bin/sh` on UNIX and `cmd.exe` on Windows. A different shell can be specified as a string. The shell should understand the `-c` switch on UNIX or `/d /s /c` on Windows.
+
+We recommend against using this option since it is:
+- not cross-platform, encouraging shell-specific syntax.
+- slower, because of the additional shell interpretation.
+- unsafe, potentially allowing command injection.
+
+#### encoding
+
+Type: `string | null`\
+Default: `utf8`
+
+Specify the character encoding used to decode the `stdout` and `stderr` output. If set to `null`, then `stdout` and `stderr` will be a `Buffer` instead of a string.
+
+#### timeout
+
+Type: `number`\
+Default: `0`
+
+If timeout is greater than `0`, the parent will send the signal identified by the `killSignal` property (the default is `SIGTERM`) if the child runs longer than timeout milliseconds.
+
+#### maxBuffer
+
+Type: `number`\
+Default: `100_000_000` (100 MB)
+
+Largest amount of data in bytes allowed on `stdout` or `stderr`.
+
+#### killSignal
+
+Type: `string | number`\
+Default: `SIGTERM`
+
+Signal value to be used when the spawned process will be killed.
+
+#### windowsVerbatimArguments
+
+Type: `boolean`\
+Default: `false`
+
+If `true`, no quoting or escaping of arguments is done on Windows. Ignored on other platforms. This is set to `true` automatically when the `shell` option is `true`.
+
+#### windowsHide
+
+Type: `boolean`\
+Default: `true`
+
+On Windows, do not create a new console window. Please note this also prevents `CTRL-C` [from working](https://github.com/nodejs/node/issues/29837) on Windows.
+
+#### nodePath *(For `.node()` only)*
+
+Type: `string`\
+Default: [`process.execPath`](https://nodejs.org/api/process.html#process_process_execpath)
+
+Node.js executable used to create the child process.
+
+#### nodeOptions *(For `.node()` only)*
+
+Type: `string[]`\
+Default: [`process.execArgv`](https://nodejs.org/api/process.html#process_process_execargv)
+
+List of [CLI options](https://nodejs.org/api/cli.html#cli_options) passed to the Node.js executable.
+
+## Tips
+
+### Retry on error
+
+Gracefully handle failures by using automatic retries and exponential backoff with the [`p-retry`](https://github.com/sindresorhus/p-retry) package:
+
+```js
+const pRetry = require('p-retry');
+
+const run = async () => {
+	const results = await execa('curl', ['-sSL', 'https://sindresorhus.com/unicorn']);
+	return results;
+};
+
+(async () => {
+	console.log(await pRetry(run, {retries: 5}));
+})();
+```
+
+### Save and pipe output from a child process
+
+Let's say you want to show the output of a child process in real-time while also saving it to a variable.
+
+```js
+const execa = require('execa');
+
+const subprocess = execa('echo', ['foo']);
+subprocess.stdout.pipe(process.stdout);
+
+(async () => {
+	const {stdout} = await subprocess;
+	console.log('child output:', stdout);
+})();
+```
+
+### Redirect output to a file
+
+```js
+const execa = require('execa');
+
+const subprocess = execa('echo', ['foo'])
+subprocess.stdout.pipe(fs.createWriteStream('stdout.txt'))
+```
+
+### Redirect input from a file
+
+```js
+const execa = require('execa');
+
+const subprocess = execa('cat')
+fs.createReadStream('stdin.txt').pipe(subprocess.stdin)
+```
+
+### Execute the current package's binary
+
+```js
+const {getBinPathSync} = require('get-bin-path');
+
+const binPath = getBinPathSync();
+const subprocess = execa(binPath);
+```
+
+`execa` can be combined with [`get-bin-path`](https://github.com/ehmicky/get-bin-path) to test the current package's binary. As opposed to hard-coding the path to the binary, this validates that the `package.json` `bin` field is correctly set up.
+
+## Related
+
+- [gulp-execa](https://github.com/ehmicky/gulp-execa) - Gulp plugin for `execa`
+- [nvexeca](https://github.com/ehmicky/nvexeca) - Run `execa` using any Node.js version
+- [sudo-prompt](https://github.com/jorangreef/sudo-prompt) - Run commands with elevated privileges.
+
+## Maintainers
+
+- [Sindre Sorhus](https://github.com/sindresorhus)
+- [@ehmicky](https://github.com/ehmicky)
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-execa?utm_source=npm-execa&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/LICENSE b/node_modules/mathjs/examples/node_modules/fast-deep-equal/LICENSE
new file mode 100644
index 0000000..7f15435
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 Evgeny Poberezkin
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/README.md b/node_modules/mathjs/examples/node_modules/fast-deep-equal/README.md
new file mode 100644
index 0000000..d3f4ffc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/README.md
@@ -0,0 +1,96 @@
+# fast-deep-equal
+The fastest deep equal with ES6 Map, Set and Typed arrays support.
+
+[![Build Status](https://travis-ci.org/epoberezkin/fast-deep-equal.svg?branch=master)](https://travis-ci.org/epoberezkin/fast-deep-equal)
+[![npm](https://img.shields.io/npm/v/fast-deep-equal.svg)](https://www.npmjs.com/package/fast-deep-equal)
+[![Coverage Status](https://coveralls.io/repos/github/epoberezkin/fast-deep-equal/badge.svg?branch=master)](https://coveralls.io/github/epoberezkin/fast-deep-equal?branch=master)
+
+
+## Install
+
+```bash
+npm install fast-deep-equal
+```
+
+
+## Features
+
+- ES5 compatible
+- works in node.js (8+) and browsers (IE9+)
+- checks equality of Date and RegExp objects by value.
+
+ES6 equal (`require('fast-deep-equal/es6')`) also supports:
+- Maps
+- Sets
+- Typed arrays
+
+
+## Usage
+
+```javascript
+var equal = require('fast-deep-equal');
+console.log(equal({foo: 'bar'}, {foo: 'bar'})); // true
+```
+
+To support ES6 Maps, Sets and Typed arrays equality use:
+
+```javascript
+var equal = require('fast-deep-equal/es6');
+console.log(equal(Int16Array([1, 2]), Int16Array([1, 2]))); // true
+```
+
+To use with React (avoiding the traversal of React elements' _owner
+property that contains circular references and is not needed when
+comparing the elements - borrowed from [react-fast-compare](https://github.com/FormidableLabs/react-fast-compare)):
+
+```javascript
+var equal = require('fast-deep-equal/react');
+var equal = require('fast-deep-equal/es6/react');
+```
+
+
+## Performance benchmark
+
+Node.js v12.6.0:
+
+```
+fast-deep-equal x 261,950 ops/sec ±0.52% (89 runs sampled)
+fast-deep-equal/es6 x 212,991 ops/sec ±0.34% (92 runs sampled)
+fast-equals x 230,957 ops/sec ±0.83% (85 runs sampled)
+nano-equal x 187,995 ops/sec ±0.53% (88 runs sampled)
+shallow-equal-fuzzy x 138,302 ops/sec ±0.49% (90 runs sampled)
+underscore.isEqual x 74,423 ops/sec ±0.38% (89 runs sampled)
+lodash.isEqual x 36,637 ops/sec ±0.72% (90 runs sampled)
+deep-equal x 2,310 ops/sec ±0.37% (90 runs sampled)
+deep-eql x 35,312 ops/sec ±0.67% (91 runs sampled)
+ramda.equals x 12,054 ops/sec ±0.40% (91 runs sampled)
+util.isDeepStrictEqual x 46,440 ops/sec ±0.43% (90 runs sampled)
+assert.deepStrictEqual x 456 ops/sec ±0.71% (88 runs sampled)
+
+The fastest is fast-deep-equal
+```
+
+To run benchmark (requires node.js 6+):
+
+```bash
+npm run benchmark
+```
+
+__Please note__: this benchmark runs against the available test cases. To choose the most performant library for your application, it is recommended to benchmark against your data and to NOT expect this benchmark to reflect the performance difference in your application.
+
+
+## Enterprise support
+
+fast-deep-equal package is a part of [Tidelift enterprise subscription](https://tidelift.com/subscription/pkg/npm-fast-deep-equal?utm_source=npm-fast-deep-equal&utm_medium=referral&utm_campaign=enterprise&utm_term=repo) - it provides a centralised commercial support to open-source software users, in addition to the support provided by software maintainers.
+
+
+## Security contact
+
+To report a security vulnerability, please use the
+[Tidelift security contact](https://tidelift.com/security).
+Tidelift will coordinate the fix and disclosure. Please do NOT report security vulnerability via GitHub issues.
+
+
+## License
+
+[MIT](https://github.com/epoberezkin/fast-deep-equal/blob/master/LICENSE)
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/index.d.ts b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/index.d.ts
new file mode 100644
index 0000000..c7eb9c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/index.d.ts
@@ -0,0 +1,2 @@
+declare const equal: (a: any, b: any) => boolean;
+export = equal;
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/index.js b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/index.js
new file mode 100644
index 0000000..d980be2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/index.js
@@ -0,0 +1,72 @@
+'use strict';
+
+// do not edit .js files directly - edit src/index.jst
+
+
+  var envHasBigInt64Array = typeof BigInt64Array !== 'undefined';
+
+
+module.exports = function equal(a, b) {
+  if (a === b) return true;
+
+  if (a && b && typeof a == 'object' && typeof b == 'object') {
+    if (a.constructor !== b.constructor) return false;
+
+    var length, i, keys;
+    if (Array.isArray(a)) {
+      length = a.length;
+      if (length != b.length) return false;
+      for (i = length; i-- !== 0;)
+        if (!equal(a[i], b[i])) return false;
+      return true;
+    }
+
+
+    if ((a instanceof Map) && (b instanceof Map)) {
+      if (a.size !== b.size) return false;
+      for (i of a.entries())
+        if (!b.has(i[0])) return false;
+      for (i of a.entries())
+        if (!equal(i[1], b.get(i[0]))) return false;
+      return true;
+    }
+
+    if ((a instanceof Set) && (b instanceof Set)) {
+      if (a.size !== b.size) return false;
+      for (i of a.entries())
+        if (!b.has(i[0])) return false;
+      return true;
+    }
+
+    if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {
+      length = a.length;
+      if (length != b.length) return false;
+      for (i = length; i-- !== 0;)
+        if (a[i] !== b[i]) return false;
+      return true;
+    }
+
+
+    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;
+    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();
+    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();
+
+    keys = Object.keys(a);
+    length = keys.length;
+    if (length !== Object.keys(b).length) return false;
+
+    for (i = length; i-- !== 0;)
+      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;
+
+    for (i = length; i-- !== 0;) {
+      var key = keys[i];
+
+      if (!equal(a[key], b[key])) return false;
+    }
+
+    return true;
+  }
+
+  // true if both NaN, false otherwise
+  return a!==a && b!==b;
+};
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/react.d.ts b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/react.d.ts
new file mode 100644
index 0000000..c7eb9c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/react.d.ts
@@ -0,0 +1,2 @@
+declare const equal: (a: any, b: any) => boolean;
+export = equal;
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/react.js b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/react.js
new file mode 100644
index 0000000..98e2f9b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/es6/react.js
@@ -0,0 +1,79 @@
+'use strict';
+
+// do not edit .js files directly - edit src/index.jst
+
+
+  var envHasBigInt64Array = typeof BigInt64Array !== 'undefined';
+
+
+module.exports = function equal(a, b) {
+  if (a === b) return true;
+
+  if (a && b && typeof a == 'object' && typeof b == 'object') {
+    if (a.constructor !== b.constructor) return false;
+
+    var length, i, keys;
+    if (Array.isArray(a)) {
+      length = a.length;
+      if (length != b.length) return false;
+      for (i = length; i-- !== 0;)
+        if (!equal(a[i], b[i])) return false;
+      return true;
+    }
+
+
+    if ((a instanceof Map) && (b instanceof Map)) {
+      if (a.size !== b.size) return false;
+      for (i of a.entries())
+        if (!b.has(i[0])) return false;
+      for (i of a.entries())
+        if (!equal(i[1], b.get(i[0]))) return false;
+      return true;
+    }
+
+    if ((a instanceof Set) && (b instanceof Set)) {
+      if (a.size !== b.size) return false;
+      for (i of a.entries())
+        if (!b.has(i[0])) return false;
+      return true;
+    }
+
+    if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {
+      length = a.length;
+      if (length != b.length) return false;
+      for (i = length; i-- !== 0;)
+        if (a[i] !== b[i]) return false;
+      return true;
+    }
+
+
+    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;
+    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();
+    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();
+
+    keys = Object.keys(a);
+    length = keys.length;
+    if (length !== Object.keys(b).length) return false;
+
+    for (i = length; i-- !== 0;)
+      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;
+
+    for (i = length; i-- !== 0;) {
+      var key = keys[i];
+
+      if (key === '_owner' && a.$$typeof) {
+        // React-specific: avoid traversing React elements' _owner.
+        //  _owner contains circular references
+        // and is not needed when comparing the actual elements (and not their owners)
+        continue;
+      }
+
+      if (!equal(a[key], b[key])) return false;
+    }
+
+    return true;
+  }
+
+  // true if both NaN, false otherwise
+  return a!==a && b!==b;
+};
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/index.d.ts b/node_modules/mathjs/examples/node_modules/fast-deep-equal/index.d.ts
new file mode 100644
index 0000000..3c042ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/index.d.ts
@@ -0,0 +1,4 @@
+declare module 'fast-deep-equal' {
+    const equal: (a: any, b: any) => boolean;
+    export = equal;
+}
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/index.js b/node_modules/mathjs/examples/node_modules/fast-deep-equal/index.js
new file mode 100644
index 0000000..30dd1ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/index.js
@@ -0,0 +1,46 @@
+'use strict';
+
+// do not edit .js files directly - edit src/index.jst
+
+
+
+module.exports = function equal(a, b) {
+  if (a === b) return true;
+
+  if (a && b && typeof a == 'object' && typeof b == 'object') {
+    if (a.constructor !== b.constructor) return false;
+
+    var length, i, keys;
+    if (Array.isArray(a)) {
+      length = a.length;
+      if (length != b.length) return false;
+      for (i = length; i-- !== 0;)
+        if (!equal(a[i], b[i])) return false;
+      return true;
+    }
+
+
+
+    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;
+    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();
+    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();
+
+    keys = Object.keys(a);
+    length = keys.length;
+    if (length !== Object.keys(b).length) return false;
+
+    for (i = length; i-- !== 0;)
+      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;
+
+    for (i = length; i-- !== 0;) {
+      var key = keys[i];
+
+      if (!equal(a[key], b[key])) return false;
+    }
+
+    return true;
+  }
+
+  // true if both NaN, false otherwise
+  return a!==a && b!==b;
+};
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/package.json b/node_modules/mathjs/examples/node_modules/fast-deep-equal/package.json
new file mode 100644
index 0000000..3cfe66c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/package.json
@@ -0,0 +1,61 @@
+{
+  "name": "fast-deep-equal",
+  "version": "3.1.3",
+  "description": "Fast deep equal",
+  "main": "index.js",
+  "scripts": {
+    "eslint": "eslint *.js benchmark/*.js spec/*.js",
+    "build": "node build",
+    "benchmark": "npm i && npm run build && cd ./benchmark && npm i && node ./",
+    "test-spec": "mocha spec/*.spec.js -R spec",
+    "test-cov": "nyc npm run test-spec",
+    "test-ts": "tsc --target ES5 --noImplicitAny index.d.ts",
+    "test": "npm run build && npm run eslint && npm run test-ts && npm run test-cov",
+    "prepublish": "npm run build"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/epoberezkin/fast-deep-equal.git"
+  },
+  "keywords": [
+    "fast",
+    "equal",
+    "deep-equal"
+  ],
+  "author": "Evgeny Poberezkin",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/epoberezkin/fast-deep-equal/issues"
+  },
+  "homepage": "https://github.com/epoberezkin/fast-deep-equal#readme",
+  "devDependencies": {
+    "coveralls": "^3.1.0",
+    "dot": "^1.1.2",
+    "eslint": "^7.2.0",
+    "mocha": "^7.2.0",
+    "nyc": "^15.1.0",
+    "pre-commit": "^1.2.2",
+    "react": "^16.12.0",
+    "react-test-renderer": "^16.12.0",
+    "sinon": "^9.0.2",
+    "typescript": "^3.9.5"
+  },
+  "nyc": {
+    "exclude": [
+      "**/spec/**",
+      "node_modules"
+    ],
+    "reporter": [
+      "lcov",
+      "text-summary"
+    ]
+  },
+  "files": [
+    "index.js",
+    "index.d.ts",
+    "react.js",
+    "react.d.ts",
+    "es6/"
+  ],
+  "types": "index.d.ts"
+}
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/react.d.ts b/node_modules/mathjs/examples/node_modules/fast-deep-equal/react.d.ts
new file mode 100644
index 0000000..c7eb9c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/react.d.ts
@@ -0,0 +1,2 @@
+declare const equal: (a: any, b: any) => boolean;
+export = equal;
diff --git a/node_modules/mathjs/examples/node_modules/fast-deep-equal/react.js b/node_modules/mathjs/examples/node_modules/fast-deep-equal/react.js
new file mode 100644
index 0000000..3489b98
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-deep-equal/react.js
@@ -0,0 +1,53 @@
+'use strict';
+
+// do not edit .js files directly - edit src/index.jst
+
+
+
+module.exports = function equal(a, b) {
+  if (a === b) return true;
+
+  if (a && b && typeof a == 'object' && typeof b == 'object') {
+    if (a.constructor !== b.constructor) return false;
+
+    var length, i, keys;
+    if (Array.isArray(a)) {
+      length = a.length;
+      if (length != b.length) return false;
+      for (i = length; i-- !== 0;)
+        if (!equal(a[i], b[i])) return false;
+      return true;
+    }
+
+
+
+    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;
+    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();
+    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();
+
+    keys = Object.keys(a);
+    length = keys.length;
+    if (length !== Object.keys(b).length) return false;
+
+    for (i = length; i-- !== 0;)
+      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;
+
+    for (i = length; i-- !== 0;) {
+      var key = keys[i];
+
+      if (key === '_owner' && a.$$typeof) {
+        // React-specific: avoid traversing React elements' _owner.
+        //  _owner contains circular references
+        // and is not needed when comparing the actual elements (and not their owners)
+        continue;
+      }
+
+      if (!equal(a[key], b[key])) return false;
+    }
+
+    return true;
+  }
+
+  // true if both NaN, false otherwise
+  return a!==a && b!==b;
+};
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.eslintrc.yml b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.eslintrc.yml
new file mode 100644
index 0000000..1c77b0d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.eslintrc.yml
@@ -0,0 +1,26 @@
+extends: eslint:recommended
+env:
+  node: true
+  browser: true
+rules:
+  block-scoped-var: 2
+  callback-return: 2
+  dot-notation: 2
+  indent: 2
+  linebreak-style: [2, unix]
+  new-cap: 2
+  no-console: [2, allow: [warn, error]]
+  no-else-return: 2
+  no-eq-null: 2
+  no-fallthrough: 2
+  no-invalid-this: 2
+  no-return-assign: 2
+  no-shadow: 1
+  no-trailing-spaces: 2
+  no-use-before-define: [2, nofunc]
+  quotes: [2, single, avoid-escape]
+  semi: [2, always]
+  strict: [2, global]
+  valid-jsdoc: [2, requireReturn: false]
+  no-control-regex: 0
+  no-useless-escape: 2
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.github/FUNDING.yml b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.github/FUNDING.yml
new file mode 100644
index 0000000..61f9daa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.github/FUNDING.yml
@@ -0,0 +1 @@
+tidelift: "npm/fast-json-stable-stringify"
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.travis.yml b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.travis.yml
new file mode 100644
index 0000000..b61e8f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/.travis.yml
@@ -0,0 +1,8 @@
+language: node_js
+node_js:
+  - "8"
+  - "10"
+  - "12"
+  - "13"
+after_script:
+  - coveralls < coverage/lcov.info
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/LICENSE b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/LICENSE
new file mode 100644
index 0000000..c932223
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/LICENSE
@@ -0,0 +1,21 @@
+This software is released under the MIT license:
+
+Copyright (c) 2017 Evgeny Poberezkin
+Copyright (c) 2013 James Halliday
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/README.md b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/README.md
new file mode 100644
index 0000000..02cf49f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/README.md
@@ -0,0 +1,131 @@
+# fast-json-stable-stringify
+
+Deterministic `JSON.stringify()` - a faster version of [@substack](https://github.com/substack)'s json-stable-strigify without [jsonify](https://github.com/substack/jsonify).
+
+You can also pass in a custom comparison function.
+
+[![Build Status](https://travis-ci.org/epoberezkin/fast-json-stable-stringify.svg?branch=master)](https://travis-ci.org/epoberezkin/fast-json-stable-stringify)
+[![Coverage Status](https://coveralls.io/repos/github/epoberezkin/fast-json-stable-stringify/badge.svg?branch=master)](https://coveralls.io/github/epoberezkin/fast-json-stable-stringify?branch=master)
+
+# example
+
+``` js
+var stringify = require('fast-json-stable-stringify');
+var obj = { c: 8, b: [{z:6,y:5,x:4},7], a: 3 };
+console.log(stringify(obj));
+```
+
+output:
+
+```
+{"a":3,"b":[{"x":4,"y":5,"z":6},7],"c":8}
+```
+
+
+# methods
+
+``` js
+var stringify = require('fast-json-stable-stringify')
+```
+
+## var str = stringify(obj, opts)
+
+Return a deterministic stringified string `str` from the object `obj`.
+
+
+## options
+
+### cmp
+
+If `opts` is given, you can supply an `opts.cmp` to have a custom comparison
+function for object keys. Your function `opts.cmp` is called with these
+parameters:
+
+``` js
+opts.cmp({ key: akey, value: avalue }, { key: bkey, value: bvalue })
+```
+
+For example, to sort on the object key names in reverse order you could write:
+
+``` js
+var stringify = require('fast-json-stable-stringify');
+
+var obj = { c: 8, b: [{z:6,y:5,x:4},7], a: 3 };
+var s = stringify(obj, function (a, b) {
+    return a.key < b.key ? 1 : -1;
+});
+console.log(s);
+```
+
+which results in the output string:
+
+```
+{"c":8,"b":[{"z":6,"y":5,"x":4},7],"a":3}
+```
+
+Or if you wanted to sort on the object values in reverse order, you could write:
+
+```
+var stringify = require('fast-json-stable-stringify');
+
+var obj = { d: 6, c: 5, b: [{z:3,y:2,x:1},9], a: 10 };
+var s = stringify(obj, function (a, b) {
+    return a.value < b.value ? 1 : -1;
+});
+console.log(s);
+```
+
+which outputs:
+
+```
+{"d":6,"c":5,"b":[{"z":3,"y":2,"x":1},9],"a":10}
+```
+
+### cycles
+
+Pass `true` in `opts.cycles` to stringify circular property as `__cycle__` - the result will not be a valid JSON string in this case.
+
+TypeError will be thrown in case of circular object without this option.
+
+
+# install
+
+With [npm](https://npmjs.org) do:
+
+```
+npm install fast-json-stable-stringify
+```
+
+
+# benchmark
+
+To run benchmark (requires Node.js 6+):
+```
+node benchmark
+```
+
+Results:
+```
+fast-json-stable-stringify x 17,189 ops/sec ±1.43% (83 runs sampled)
+json-stable-stringify x 13,634 ops/sec ±1.39% (85 runs sampled)
+fast-stable-stringify x 20,212 ops/sec ±1.20% (84 runs sampled)
+faster-stable-stringify x 15,549 ops/sec ±1.12% (84 runs sampled)
+The fastest is fast-stable-stringify
+```
+
+
+## Enterprise support
+
+fast-json-stable-stringify package is a part of [Tidelift enterprise subscription](https://tidelift.com/subscription/pkg/npm-fast-json-stable-stringify?utm_source=npm-fast-json-stable-stringify&utm_medium=referral&utm_campaign=enterprise&utm_term=repo) - it provides a centralised commercial support to open-source software users, in addition to the support provided by software maintainers.
+
+
+## Security contact
+
+To report a security vulnerability, please use the
+[Tidelift security contact](https://tidelift.com/security).
+Tidelift will coordinate the fix and disclosure. Please do NOT report security vulnerability via GitHub issues.
+
+
+# license
+
+[MIT](https://github.com/epoberezkin/fast-json-stable-stringify/blob/master/LICENSE)
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/benchmark/index.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/benchmark/index.js
new file mode 100644
index 0000000..e725f9f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/benchmark/index.js
@@ -0,0 +1,31 @@
+'use strict';
+
+const Benchmark = require('benchmark');
+const suite = new Benchmark.Suite;
+const testData = require('./test.json');
+
+
+const stringifyPackages = {
+  // 'JSON.stringify': JSON.stringify,
+  'fast-json-stable-stringify': require('../index'),
+  'json-stable-stringify': true,
+  'fast-stable-stringify': true,
+  'faster-stable-stringify': true
+};
+
+
+for (const name in stringifyPackages) {
+  let func = stringifyPackages[name];
+  if (func === true) func = require(name);
+
+  suite.add(name, function() {
+    func(testData);
+  });
+}
+
+suite
+  .on('cycle', (event) => console.log(String(event.target)))
+  .on('complete', function () {
+    console.log('The fastest is ' + this.filter('fastest').map('name'));
+  })
+  .run({async: true});
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/benchmark/test.json b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/benchmark/test.json
new file mode 100644
index 0000000..c9118c1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/benchmark/test.json
@@ -0,0 +1,137 @@
+[
+  {
+    "_id": "59ef4a83ee8364808d761beb",
+    "index": 0,
+    "guid": "e50ffae9-7128-4148-9ee5-40c3fc523c5d",
+    "isActive": false,
+    "balance": "$2,341.81",
+    "picture": "http://placehold.it/32x32",
+    "age": 28,
+    "eyeColor": "brown",
+    "name": "Carey Savage",
+    "gender": "female",
+    "company": "VERAQ",
+    "email": "careysavage@veraq.com",
+    "phone": "+1 (897) 574-3014",
+    "address": "458 Willow Street, Henrietta, California, 7234",
+    "about": "Nisi reprehenderit nulla ad officia pariatur non dolore laboris irure cupidatat laborum. Minim eu ex Lorem adipisicing exercitation irure minim sunt est enim mollit incididunt voluptate nulla. Ut mollit anim reprehenderit et aliqua ex esse aliquip. Aute sit duis deserunt do incididunt consequat minim qui dolor commodo deserunt et voluptate.\r\n",
+    "registered": "2014-05-21T01:56:51 -01:00",
+    "latitude": 63.89502,
+    "longitude": 62.369807,
+    "tags": [
+      "nostrud",
+      "nisi",
+      "consectetur",
+      "ullamco",
+      "cupidatat",
+      "culpa",
+      "commodo"
+    ],
+    "friends": [
+      {
+        "id": 0,
+        "name": "Henry Walls"
+      },
+      {
+        "id": 1,
+        "name": "Janice Baker"
+      },
+      {
+        "id": 2,
+        "name": "Russell Bush"
+      }
+    ],
+    "greeting": "Hello, Carey Savage! You have 4 unread messages.",
+    "favoriteFruit": "banana"
+  },
+  {
+    "_id": "59ef4a83ff5774a691454e89",
+    "index": 1,
+    "guid": "2bee9efc-4095-4c2e-87ef-d08c8054c89d",
+    "isActive": true,
+    "balance": "$1,618.15",
+    "picture": "http://placehold.it/32x32",
+    "age": 35,
+    "eyeColor": "blue",
+    "name": "Elinor Pearson",
+    "gender": "female",
+    "company": "FLEXIGEN",
+    "email": "elinorpearson@flexigen.com",
+    "phone": "+1 (923) 548-3751",
+    "address": "600 Bayview Avenue, Draper, Montana, 3088",
+    "about": "Mollit commodo ea sit Lorem velit. Irure anim esse Lorem sint quis officia ut. Aliqua nisi dolore in aute deserunt mollit ex ea in mollit.\r\n",
+    "registered": "2017-04-22T07:58:41 -01:00",
+    "latitude": -87.824919,
+    "longitude": 69.538927,
+    "tags": [
+      "fugiat",
+      "labore",
+      "proident",
+      "quis",
+      "eiusmod",
+      "qui",
+      "est"
+    ],
+    "friends": [
+      {
+        "id": 0,
+        "name": "Massey Wagner"
+      },
+      {
+        "id": 1,
+        "name": "Marcella Ferrell"
+      },
+      {
+        "id": 2,
+        "name": "Evans Mckee"
+      }
+    ],
+    "greeting": "Hello, Elinor Pearson! You have 3 unread messages.",
+    "favoriteFruit": "strawberry"
+  },
+  {
+    "_id": "59ef4a839ec8a4be4430b36b",
+    "index": 2,
+    "guid": "ddd6e8c0-95bd-416d-8b46-a768d6363809",
+    "isActive": false,
+    "balance": "$2,046.95",
+    "picture": "http://placehold.it/32x32",
+    "age": 40,
+    "eyeColor": "green",
+    "name": "Irwin Davidson",
+    "gender": "male",
+    "company": "DANJA",
+    "email": "irwindavidson@danja.com",
+    "phone": "+1 (883) 537-2041",
+    "address": "439 Cook Street, Chapin, Kentucky, 7398",
+    "about": "Irure velit non commodo aliqua exercitation ut nostrud minim magna. Dolor ad ad ut irure eu. Non pariatur dolor eiusmod ipsum do et exercitation cillum. Et amet laboris minim eiusmod ullamco magna ea reprehenderit proident sunt.\r\n",
+    "registered": "2016-09-01T07:49:08 -01:00",
+    "latitude": -49.803812,
+    "longitude": 104.93279,
+    "tags": [
+      "consequat",
+      "enim",
+      "quis",
+      "magna",
+      "est",
+      "culpa",
+      "tempor"
+    ],
+    "friends": [
+      {
+        "id": 0,
+        "name": "Ruth Hansen"
+      },
+      {
+        "id": 1,
+        "name": "Kathrine Austin"
+      },
+      {
+        "id": 2,
+        "name": "Rivera Munoz"
+      }
+    ],
+    "greeting": "Hello, Irwin Davidson! You have 2 unread messages.",
+    "favoriteFruit": "banana"
+  }
+]
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/key_cmp.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/key_cmp.js
new file mode 100644
index 0000000..d5f6675
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/key_cmp.js
@@ -0,0 +1,7 @@
+var stringify = require('../');
+
+var obj = { c: 8, b: [{z:6,y:5,x:4},7], a: 3 };
+var s = stringify(obj, function (a, b) {
+    return a.key < b.key ? 1 : -1;
+});
+console.log(s);
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/nested.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/nested.js
new file mode 100644
index 0000000..9a672fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/nested.js
@@ -0,0 +1,3 @@
+var stringify = require('../');
+var obj = { c: 8, b: [{z:6,y:5,x:4},7], a: 3 };
+console.log(stringify(obj));
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/str.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/str.js
new file mode 100644
index 0000000..9b4b3cd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/str.js
@@ -0,0 +1,3 @@
+var stringify = require('../');
+var obj = { c: 6, b: [4,5], a: 3 };
+console.log(stringify(obj));
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/value_cmp.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/value_cmp.js
new file mode 100644
index 0000000..09f1c5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/example/value_cmp.js
@@ -0,0 +1,7 @@
+var stringify = require('../');
+
+var obj = { d: 6, c: 5, b: [{z:3,y:2,x:1},9], a: 10 };
+var s = stringify(obj, function (a, b) {
+    return a.value < b.value ? 1 : -1;
+});
+console.log(s);
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/index.d.ts b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/index.d.ts
new file mode 100644
index 0000000..23e46ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/index.d.ts
@@ -0,0 +1,4 @@
+declare module 'fast-json-stable-stringify' {
+  function stringify(obj: any): string;
+  export = stringify;
+}
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/index.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/index.js
new file mode 100644
index 0000000..c44e6a4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/index.js
@@ -0,0 +1,59 @@
+'use strict';
+
+module.exports = function (data, opts) {
+    if (!opts) opts = {};
+    if (typeof opts === 'function') opts = { cmp: opts };
+    var cycles = (typeof opts.cycles === 'boolean') ? opts.cycles : false;
+
+    var cmp = opts.cmp && (function (f) {
+        return function (node) {
+            return function (a, b) {
+                var aobj = { key: a, value: node[a] };
+                var bobj = { key: b, value: node[b] };
+                return f(aobj, bobj);
+            };
+        };
+    })(opts.cmp);
+
+    var seen = [];
+    return (function stringify (node) {
+        if (node && node.toJSON && typeof node.toJSON === 'function') {
+            node = node.toJSON();
+        }
+
+        if (node === undefined) return;
+        if (typeof node == 'number') return isFinite(node) ? '' + node : 'null';
+        if (typeof node !== 'object') return JSON.stringify(node);
+
+        var i, out;
+        if (Array.isArray(node)) {
+            out = '[';
+            for (i = 0; i < node.length; i++) {
+                if (i) out += ',';
+                out += stringify(node[i]) || 'null';
+            }
+            return out + ']';
+        }
+
+        if (node === null) return 'null';
+
+        if (seen.indexOf(node) !== -1) {
+            if (cycles) return JSON.stringify('__cycle__');
+            throw new TypeError('Converting circular structure to JSON');
+        }
+
+        var seenIndex = seen.push(node) - 1;
+        var keys = Object.keys(node).sort(cmp && cmp(node));
+        out = '';
+        for (i = 0; i < keys.length; i++) {
+            var key = keys[i];
+            var value = stringify(node[key]);
+
+            if (!value) continue;
+            if (out) out += ',';
+            out += JSON.stringify(key) + ':' + value;
+        }
+        seen.splice(seenIndex, 1);
+        return '{' + out + '}';
+    })(data);
+};
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/package.json b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/package.json
new file mode 100644
index 0000000..ad2c8bf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/package.json
@@ -0,0 +1,52 @@
+{
+  "name": "fast-json-stable-stringify",
+  "version": "2.1.0",
+  "description": "deterministic `JSON.stringify()` - a faster version of substack's json-stable-strigify without jsonify",
+  "main": "index.js",
+  "types": "index.d.ts",
+  "dependencies": {},
+  "devDependencies": {
+    "benchmark": "^2.1.4",
+    "coveralls": "^3.0.0",
+    "eslint": "^6.7.0",
+    "fast-stable-stringify": "latest",
+    "faster-stable-stringify": "latest",
+    "json-stable-stringify": "latest",
+    "nyc": "^14.1.0",
+    "pre-commit": "^1.2.2",
+    "tape": "^4.11.0"
+  },
+  "scripts": {
+    "eslint": "eslint index.js test",
+    "test-spec": "tape test/*.js",
+    "test": "npm run eslint && nyc npm run test-spec"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/epoberezkin/fast-json-stable-stringify.git"
+  },
+  "homepage": "https://github.com/epoberezkin/fast-json-stable-stringify",
+  "keywords": [
+    "json",
+    "stringify",
+    "deterministic",
+    "hash",
+    "stable"
+  ],
+  "author": {
+    "name": "James Halliday",
+    "email": "mail@substack.net",
+    "url": "http://substack.net"
+  },
+  "license": "MIT",
+  "nyc": {
+    "exclude": [
+      "test",
+      "node_modules"
+    ],
+    "reporter": [
+      "lcov",
+      "text-summary"
+    ]
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/cmp.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/cmp.js
new file mode 100644
index 0000000..4efd6b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/cmp.js
@@ -0,0 +1,13 @@
+'use strict';
+
+var test = require('tape');
+var stringify = require('../');
+
+test('custom comparison function', function (t) {
+    t.plan(1);
+    var obj = { c: 8, b: [{z:6,y:5,x:4},7], a: 3 };
+    var s = stringify(obj, function (a, b) {
+        return a.key < b.key ? 1 : -1;
+    });
+    t.equal(s, '{"c":8,"b":[{"z":6,"y":5,"x":4},7],"a":3}');
+});
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/nested.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/nested.js
new file mode 100644
index 0000000..167a358
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/nested.js
@@ -0,0 +1,44 @@
+'use strict';
+
+var test = require('tape');
+var stringify = require('../');
+
+test('nested', function (t) {
+    t.plan(1);
+    var obj = { c: 8, b: [{z:6,y:5,x:4},7], a: 3 };
+    t.equal(stringify(obj), '{"a":3,"b":[{"x":4,"y":5,"z":6},7],"c":8}');
+});
+
+test('cyclic (default)', function (t) {
+    t.plan(1);
+    var one = { a: 1 };
+    var two = { a: 2, one: one };
+    one.two = two;
+    try {
+        stringify(one);
+    } catch (ex) {
+        t.equal(ex.toString(), 'TypeError: Converting circular structure to JSON');
+    }
+});
+
+test('cyclic (specifically allowed)', function (t) {
+    t.plan(1);
+    var one = { a: 1 };
+    var two = { a: 2, one: one };
+    one.two = two;
+    t.equal(stringify(one, {cycles:true}), '{"a":1,"two":{"a":2,"one":"__cycle__"}}');
+});
+
+test('repeated non-cyclic value', function(t) {
+    t.plan(1);
+    var one = { x: 1 };
+    var two = { a: one, b: one };
+    t.equal(stringify(two), '{"a":{"x":1},"b":{"x":1}}');
+});
+
+test('acyclic but with reused obj-property pointers', function (t) {
+    t.plan(1);
+    var x = { a: 1 };
+    var y = { b: x, c: x };
+    t.equal(stringify(y), '{"b":{"a":1},"c":{"a":1}}');
+});
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/str.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/str.js
new file mode 100644
index 0000000..99a9ade
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/str.js
@@ -0,0 +1,46 @@
+'use strict';
+
+var test = require('tape');
+var stringify = require('../');
+
+test('simple object', function (t) {
+    t.plan(1);
+    var obj = { c: 6, b: [4,5], a: 3, z: null };
+    t.equal(stringify(obj), '{"a":3,"b":[4,5],"c":6,"z":null}');
+});
+
+test('object with undefined', function (t) {
+    t.plan(1);
+    var obj = { a: 3, z: undefined };
+    t.equal(stringify(obj), '{"a":3}');
+});
+
+test('object with null', function (t) {
+    t.plan(1);
+    var obj = { a: 3, z: null };
+    t.equal(stringify(obj), '{"a":3,"z":null}');
+});
+
+test('object with NaN and Infinity', function (t) {
+    t.plan(1);
+    var obj = { a: 3, b: NaN, c: Infinity };
+    t.equal(stringify(obj), '{"a":3,"b":null,"c":null}');
+});
+
+test('array with undefined', function (t) {
+    t.plan(1);
+    var obj = [4, undefined, 6];
+    t.equal(stringify(obj), '[4,null,6]');
+});
+
+test('object with empty string', function (t) {
+    t.plan(1);
+    var obj = { a: 3, z: '' };
+    t.equal(stringify(obj), '{"a":3,"z":""}');
+});
+
+test('array with empty string', function (t) {
+    t.plan(1);
+    var obj = [4, '', 6];
+    t.equal(stringify(obj), '[4,"",6]');
+});
diff --git a/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/to-json.js b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/to-json.js
new file mode 100644
index 0000000..2fb2cfa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fast-json-stable-stringify/test/to-json.js
@@ -0,0 +1,22 @@
+'use strict';
+
+var test = require('tape');
+var stringify = require('../');
+
+test('toJSON function', function (t) {
+    t.plan(1);
+    var obj = { one: 1, two: 2, toJSON: function() { return { one: 1 }; } };
+    t.equal(stringify(obj), '{"one":1}' );
+});
+
+test('toJSON returns string', function (t) {
+    t.plan(1);
+    var obj = { one: 1, two: 2, toJSON: function() { return 'one'; } };
+    t.equal(stringify(obj), '"one"');
+});
+
+test('toJSON returns array', function (t) {
+    t.plan(1);
+    var obj = { one: 1, two: 2, toJSON: function() { return ['one']; } };
+    t.equal(stringify(obj), '["one"]');
+});
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.eslintrc.js b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.eslintrc.js
new file mode 100644
index 0000000..7238c86
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.eslintrc.js
@@ -0,0 +1,27 @@
+"use strict";
+module.exports = {
+  env: {
+    browser: true,
+    commonjs: true,
+    es2020: true,
+  },
+  extends: ["eslint:all", "prettier", "plugin:node/recommended"],
+  parserOptions: {
+    ecmaVersion: 11,
+  },
+  rules: {
+    camelcase: "off",
+    "capitalized-comments": "off",
+    curly: ["error", "all"],
+    "id-length": "off",
+    "max-lines-per-function": "off",
+    "max-statements": "off",
+    "multiline-comment-style": "off",
+    "no-bitwise": "off",
+    "no-magic-numbers": "off",
+    "no-param-reassign": "off",
+    "no-plusplus": "off",
+    "one-var": "off",
+    "padded-blocks": "off",
+  },
+};
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.prettierrc b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.prettierrc
new file mode 100644
index 0000000..222861c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.prettierrc
@@ -0,0 +1,4 @@
+{
+  "tabWidth": 2,
+  "useTabs": false
+}
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.travis.yml b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.travis.yml
new file mode 100644
index 0000000..dc94017
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/.travis.yml
@@ -0,0 +1,17 @@
+sudo: false
+
+language: node_js
+
+os:
+  - linux
+  - osx
+  - windows
+
+arch: amd64
+
+node_js:
+  - node
+
+script:
+  - npm test
+  - npm run test:coveralls
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/LICENSE.md b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/LICENSE.md
new file mode 100644
index 0000000..0e62da3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/LICENSE.md
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 Kasper Unn Weihe
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/README.md b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/README.md
new file mode 100644
index 0000000..020ec88
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/README.md
@@ -0,0 +1,55 @@
+# fastest-levenshtein :rocket: 
+> Fastest JS implemenation of [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance).<br>
+> Measure the difference between two strings.
+
+[![Build Status](https://travis-ci.org/ka-weihe/node-levenshtein.svg?branch=master)](https://travis-ci.org/ka-weihe/node-levenshtein)
+[![Coverage Status](https://coveralls.io/repos/github/ka-weihe/node-levenshtein/badge.svg?branch=master)](https://coveralls.io/github/ka-weihe/node-levenshtein?branch=master)
+```
+$ npm i fastest-levenshtein
+```
+
+## Usage
+### Node
+```javascript
+const {distance, closest} = require('fastest-levenshtein')
+
+// Print levenshtein-distance between 'fast' and 'faster' 
+console.log(distance('fast', 'faster'))
+//=> 2
+
+// Print string from array with lowest edit-distance to 'fast'
+console.log(closest('fast', ['slow', 'faster', 'fastest']))
+//=> 'faster'
+```
+
+### Deno
+```javascript
+import {distance, closest} from 'https://deno.land/x/fastest_levenshtein/mod.ts'
+
+// Print levenshtein-distance between 'fast' and 'faster' 
+console.log(distance('fast', 'faster'))
+//=> 2
+
+// Print string from array with lowest edit-distance to 'fast'
+console.log(closest('fast', ['slow', 'faster', 'fastest']))
+//=> 'faster'
+```
+
+## Benchmark
+I generated 500 pairs of strings with length N. I measured the ops/sec each library achieves to process all the given pairs. Higher is better. `fastest-levenshtein` is a lot faster in all cases. 
+
+| Test Target               | N=4   | N=8   | N=16  | N=32 | N=64  | N=128 | N=256 | N=512 | N=1024 |
+|---------------------------|-------|-------|-------|------|-------|-------|-------|-------|--------|
+| fastest-levenshtein       | 44423 | 23702 | 10764 | 4595 | 1049  | 291.5 | 86.64 | 22.24 | 5.473  |
+| js-levenshtein            | 21261 | 10030 | 2939  | 824  | 223   | 57.62 | 14.77 | 3.717 | 0.934  |
+| leven                     | 19688 | 6884  | 1606  | 436  | 117   | 30.34 | 7.604 | 1.929 | 0.478  |
+| fast-levenshtein          | 18577 | 6112  | 1265  | 345  | 89.41 | 22.70 | 5.676 | 1.428 | 0.348  |
+| levenshtein-edit-distance | 22968 | 7445  | 1493  | 409  | 109   | 28.07 | 7.095 | 1.789 | 0.445  |
+
+### Relative Performance
+This image shows the relative performance between `fastest-levenshtein` and `js-levenshtein` (the 2nd fastest). `fastest-levenshtein` is always a lot faster. x-axis shows "times faster".
+
+![Benchmark](/images/relaperf.png)
+
+## License
+This project is licensed under the MIT License - see the [LICENSE.md](LICENSE.md) file for details
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/index.d.ts b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/index.d.ts
new file mode 100644
index 0000000..bdc2bb1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/index.d.ts
@@ -0,0 +1,2 @@
+export function distance(a: string, b: string): number;
+export function closest(str: string, arr: string[]): string;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/index.js b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/index.js
new file mode 100644
index 0000000..437bdeb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/index.js
@@ -0,0 +1,147 @@
+"use strict";
+const peq = new Uint32Array(0x10000);
+const myers_32 = (a, b) => {
+  const n = a.length;
+  const m = b.length;
+  const lst = 1 << (n - 1);
+  let pv = -1;
+  let mv = 0;
+  let sc = n;
+  let i = n;
+  while (i--) {
+    peq[a.charCodeAt(i)] |= 1 << i;
+  }
+  for (i = 0; i < m; i++) {
+    let eq = peq[b.charCodeAt(i)];
+    const xv = eq | mv;
+    eq |= ((eq & pv) + pv) ^ pv;
+    mv |= ~(eq | pv);
+    pv &= eq;
+    if (mv & lst) {
+      sc++;
+    }
+    if (pv & lst) {
+      sc--;
+    }
+    mv = (mv << 1) | 1;
+    pv = (pv << 1) | ~(xv | mv);
+    mv &= xv;
+  }
+  i = n;
+  while (i--) {
+    peq[a.charCodeAt(i)] = 0;
+  }
+  return sc;
+};
+
+const myers_x = (a, b) => {
+  const n = a.length;
+  const m = b.length;
+  const mhc = [];
+  const phc = [];
+  const hsize = Math.ceil(n / 32);
+  const vsize = Math.ceil(m / 32);
+  let score = m;
+  for (let i = 0; i < hsize; i++) {
+    phc[i] = -1;
+    mhc[i] = 0;
+  }
+  let j = 0;
+  for (; j < vsize - 1; j++) {
+    let mv = 0;
+    let pv = -1;
+    const start = j * 32;
+    const end = Math.min(32, m) + start;
+    for (let k = start; k < end; k++) {
+      peq[b.charCodeAt(k)] |= 1 << k;
+    }
+    score = m;
+    for (let i = 0; i < n; i++) {
+      const eq = peq[a.charCodeAt(i)];
+      const pb = (phc[(i / 32) | 0] >>> i) & 1;
+      const mb = (mhc[(i / 32) | 0] >>> i) & 1;
+      const xv = eq | mv;
+      const xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;
+      let ph = mv | ~(xh | pv);
+      let mh = pv & xh;
+      if ((ph >>> 31) ^ pb) {
+        phc[(i / 32) | 0] ^= 1 << i;
+      }
+      if ((mh >>> 31) ^ mb) {
+        mhc[(i / 32) | 0] ^= 1 << i;
+      }
+      ph = (ph << 1) | pb;
+      mh = (mh << 1) | mb;
+      pv = mh | ~(xv | ph);
+      mv = ph & xv;
+    }
+    for (let k = start; k < end; k++) {
+      peq[b.charCodeAt(k)] = 0;
+    }
+  }
+  let mv = 0;
+  let pv = -1;
+  const start = j * 32;
+  const end = Math.min(32, m - start) + start;
+  for (let k = start; k < end; k++) {
+    peq[b.charCodeAt(k)] |= 1 << k;
+  }
+  score = m;
+  for (let i = 0; i < n; i++) {
+    const eq = peq[a.charCodeAt(i)];
+    const pb = (phc[(i / 32) | 0] >>> i) & 1;
+    const mb = (mhc[(i / 32) | 0] >>> i) & 1;
+    const xv = eq | mv;
+    const xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;
+    let ph = mv | ~(xh | pv);
+    let mh = pv & xh;
+    score += (ph >>> (m - 1)) & 1;
+    score -= (mh >>> (m - 1)) & 1;
+    if ((ph >>> 31) ^ pb) {
+      phc[(i / 32) | 0] ^= 1 << i;
+    }
+    if ((mh >>> 31) ^ mb) {
+      mhc[(i / 32) | 0] ^= 1 << i;
+    }
+    ph = (ph << 1) | pb;
+    mh = (mh << 1) | mb;
+    pv = mh | ~(xv | ph);
+    mv = ph & xv;
+  }
+  for (let k = start; k < end; k++) {
+    peq[b.charCodeAt(k)] = 0;
+  }
+  return score;
+};
+
+const distance = (a, b) => {
+  if (a.length > b.length) {
+    const tmp = b;
+    b = a;
+    a = tmp;
+  }
+  if (a.length === 0) {
+    return b.length;
+  }
+  if (a.length <= 32) {
+    return myers_32(a, b);
+  }
+  return myers_x(a, b);
+};
+
+const closest = (str, arr) => {
+  let min_distance = Infinity;
+  let min_index = 0;
+  for (let i = 0; i < arr.length; i++) {
+    const dist = distance(str, arr[i]);
+    if (dist < min_distance) {
+      min_distance = dist;
+      min_index = i;
+    }
+  }
+  return arr[min_index];
+};
+
+module.exports = {
+  closest, distance
+}
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/package.json b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/package.json
new file mode 100644
index 0000000..4d3ca34
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/package.json
@@ -0,0 +1,63 @@
+{
+  "name": "fastest-levenshtein",
+  "version": "1.0.12",
+  "description": "Fastest Levenshtein distance implementation in JS.",
+  "main": "index.js",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/ka-weihe/fastest-levenshtein.git"
+  },
+  "keywords": [
+    "levenshtein",
+    "distance",
+    "fast",
+    "fastest",
+    "edit",
+    "string",
+    "similarity",
+    "algorithm",
+    "match",
+    "comparison",
+    "fuzzy",
+    "search",
+    "string",
+    "matching",
+    "similar",
+    "node",
+    "difference"
+  ],
+  "author": "Kasper U. Weihe",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/ka-weihe/fastest-levenshtein/issues"
+  },
+  "homepage": "https://github.com/ka-weihe/fastest-levenshtein#README",
+  "scripts": {
+    "test": "jest",
+    "test:coverage": "jest --coverage",
+    "test:coveralls": "jest --coverage --coverageReporters=text-lcov | coveralls"
+  },
+  "devDependencies": {
+    "benchmark": "^2.1.4",
+    "coveralls": "^3.1.0",
+    "eslint": "^7.5.0",
+    "eslint-config-airbnb": "^18.2.0",
+    "eslint-config-airbnb-base": "^14.2.0",
+    "eslint-config-node": "^4.1.0",
+    "eslint-config-prettier": "^6.11.0",
+    "eslint-plugin-import": "^2.22.0",
+    "eslint-plugin-jsx-a11y": "^6.3.1",
+    "eslint-plugin-node": "^11.1.0",
+    "eslint-plugin-prettier": "^3.1.4",
+    "eslint-plugin-react": "^7.20.3",
+    "eslint-plugin-react-hooks": "^4.0.0",
+    "fast-levenshtein": "^2.0.6",
+    "jest": "^26.1.0",
+    "js-levenshtein": "^1.1.6",
+    "leven": "^3.1.0",
+    "natural": "^2.1.5",
+    "prettier": "^2.0.5",
+    "talisman": "^1.1.2",
+    "levenshtein-edit-distance": "^2.0.5"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/fastest-levenshtein/test.js b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/test.js
new file mode 100644
index 0000000..4b5d6ec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/fastest-levenshtein/test.js
@@ -0,0 +1,64 @@
+const {distance, closest} = require("./index.js");
+
+const levenshtein = (a, b) => {
+  if (a.length === 0) return b.length;
+  if (b.length === 0) return a.length;
+
+  if (a.length > b.length) {
+    const tmp = a;
+    a = b;
+    b = tmp;
+  }
+
+  const row = [];
+  for (let i = 0; i <= a.length; i++) {
+    row[i] = i;
+  }
+
+  for (let i = 1; i <= b.length; i++) {
+    let prev = i;
+    for (let j = 1; j <= a.length; j++) {
+      let val;
+      if (b.charAt(i - 1) === a.charAt(j - 1)) {
+        val = row[j - 1];
+      } else {
+        val = Math.min(row[j - 1] + 1, prev + 1, row[j] + 1);
+      }
+      row[j - 1] = prev;
+      prev = val;
+    }
+    row[a.length] = prev;
+  }
+
+  return row[a.length];
+};
+
+function makeid(length) {
+  let result = "";
+  const characters =
+    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+  const charactersLength = characters.length;
+  for (let i = 0; i < length; i++) {
+    result += characters.charAt(Math.floor(Math.random() * charactersLength));
+  }
+  return result;
+}
+
+test("test compare", () => {
+  const errors = 0;
+  for (let i = 0; i < 1000; i++) {
+    const rnd_num1 = (Math.random() * 1000) | 0;
+    const rnd_num2 = (Math.random() * 1000) | 0;
+    const rnd_string1 = makeid(rnd_num1);
+    const rnd_string2 = makeid(rnd_num2);
+    const actual = distance(rnd_string1, rnd_string2);
+    const expected = levenshtein(rnd_string1, rnd_string2);
+    expect(actual).toBe(expected);
+  }
+});
+
+test("test find", () => {
+  const actual = closest("fast", ["slow", "faster", "fastest"]);
+  const expected = "faster";
+  expect(actual).toBe(expected);
+});
diff --git a/node_modules/mathjs/examples/node_modules/find-up/index.d.ts b/node_modules/mathjs/examples/node_modules/find-up/index.d.ts
new file mode 100644
index 0000000..41e3192
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/find-up/index.d.ts
@@ -0,0 +1,137 @@
+import {Options as LocatePathOptions} from 'locate-path';
+
+declare const stop: unique symbol;
+
+declare namespace findUp {
+	interface Options extends LocatePathOptions {}
+
+	type StopSymbol = typeof stop;
+
+	type Match = string | StopSymbol | undefined;
+}
+
+declare const findUp: {
+	/**
+	Find a file or directory by walking up parent directories.
+
+	@param name - Name of the file or directory to find. Can be multiple.
+	@returns The first path found (by respecting the order of `name`s) or `undefined` if none could be found.
+
+	@example
+	```
+	// /
+	// └── Users
+	//     └── sindresorhus
+	//         ├── unicorn.png
+	//         └── foo
+	//             └── bar
+	//                 ├── baz
+	//                 └── example.js
+
+	// example.js
+	import findUp = require('find-up');
+
+	(async () => {
+		console.log(await findUp('unicorn.png'));
+		//=> '/Users/sindresorhus/unicorn.png'
+
+		console.log(await findUp(['rainbow.png', 'unicorn.png']));
+		//=> '/Users/sindresorhus/unicorn.png'
+	})();
+	```
+	*/
+	(name: string | string[], options?: findUp.Options): Promise<string | undefined>;
+
+	/**
+	Find a file or directory by walking up parent directories.
+
+	@param matcher - Called for each directory in the search. Return a path or `findUp.stop` to stop the search.
+	@returns The first path found or `undefined` if none could be found.
+
+	@example
+	```
+	import path = require('path');
+	import findUp = require('find-up');
+
+	(async () => {
+		console.log(await findUp(async directory => {
+			const hasUnicorns = await findUp.exists(path.join(directory, 'unicorn.png'));
+			return hasUnicorns && directory;
+		}, {type: 'directory'}));
+		//=> '/Users/sindresorhus'
+	})();
+	```
+	*/
+	(matcher: (directory: string) => (findUp.Match | Promise<findUp.Match>), options?: findUp.Options): Promise<string | undefined>;
+
+	sync: {
+		/**
+		Synchronously find a file or directory by walking up parent directories.
+
+		@param name - Name of the file or directory to find. Can be multiple.
+		@returns The first path found (by respecting the order of `name`s) or `undefined` if none could be found.
+		*/
+		(name: string | string[], options?: findUp.Options): string | undefined;
+
+		/**
+		Synchronously find a file or directory by walking up parent directories.
+
+		@param matcher - Called for each directory in the search. Return a path or `findUp.stop` to stop the search.
+		@returns The first path found or `undefined` if none could be found.
+
+		@example
+		```
+		import path = require('path');
+		import findUp = require('find-up');
+
+		console.log(findUp.sync(directory => {
+			const hasUnicorns = findUp.sync.exists(path.join(directory, 'unicorn.png'));
+			return hasUnicorns && directory;
+		}, {type: 'directory'}));
+		//=> '/Users/sindresorhus'
+		```
+		*/
+		(matcher: (directory: string) => findUp.Match, options?: findUp.Options): string | undefined;
+
+		/**
+		Synchronously check if a path exists.
+
+		@param path - Path to the file or directory.
+		@returns Whether the path exists.
+
+		@example
+		```
+		import findUp = require('find-up');
+
+		console.log(findUp.sync.exists('/Users/sindresorhus/unicorn.png'));
+		//=> true
+		```
+		*/
+		exists(path: string): boolean;
+	}
+
+	/**
+	Check if a path exists.
+
+	@param path - Path to a file or directory.
+	@returns Whether the path exists.
+
+	@example
+	```
+	import findUp = require('find-up');
+
+	(async () => {
+		console.log(await findUp.exists('/Users/sindresorhus/unicorn.png'));
+		//=> true
+	})();
+	```
+	*/
+	exists(path: string): Promise<boolean>;
+
+	/**
+	Return this in a `matcher` function to stop the search and force `findUp` to immediately return `undefined`.
+	*/
+	readonly stop: findUp.StopSymbol;
+};
+
+export = findUp;
diff --git a/node_modules/mathjs/examples/node_modules/find-up/index.js b/node_modules/mathjs/examples/node_modules/find-up/index.js
new file mode 100644
index 0000000..ce564e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/find-up/index.js
@@ -0,0 +1,89 @@
+'use strict';
+const path = require('path');
+const locatePath = require('locate-path');
+const pathExists = require('path-exists');
+
+const stop = Symbol('findUp.stop');
+
+module.exports = async (name, options = {}) => {
+	let directory = path.resolve(options.cwd || '');
+	const {root} = path.parse(directory);
+	const paths = [].concat(name);
+
+	const runMatcher = async locateOptions => {
+		if (typeof name !== 'function') {
+			return locatePath(paths, locateOptions);
+		}
+
+		const foundPath = await name(locateOptions.cwd);
+		if (typeof foundPath === 'string') {
+			return locatePath([foundPath], locateOptions);
+		}
+
+		return foundPath;
+	};
+
+	// eslint-disable-next-line no-constant-condition
+	while (true) {
+		// eslint-disable-next-line no-await-in-loop
+		const foundPath = await runMatcher({...options, cwd: directory});
+
+		if (foundPath === stop) {
+			return;
+		}
+
+		if (foundPath) {
+			return path.resolve(directory, foundPath);
+		}
+
+		if (directory === root) {
+			return;
+		}
+
+		directory = path.dirname(directory);
+	}
+};
+
+module.exports.sync = (name, options = {}) => {
+	let directory = path.resolve(options.cwd || '');
+	const {root} = path.parse(directory);
+	const paths = [].concat(name);
+
+	const runMatcher = locateOptions => {
+		if (typeof name !== 'function') {
+			return locatePath.sync(paths, locateOptions);
+		}
+
+		const foundPath = name(locateOptions.cwd);
+		if (typeof foundPath === 'string') {
+			return locatePath.sync([foundPath], locateOptions);
+		}
+
+		return foundPath;
+	};
+
+	// eslint-disable-next-line no-constant-condition
+	while (true) {
+		const foundPath = runMatcher({...options, cwd: directory});
+
+		if (foundPath === stop) {
+			return;
+		}
+
+		if (foundPath) {
+			return path.resolve(directory, foundPath);
+		}
+
+		if (directory === root) {
+			return;
+		}
+
+		directory = path.dirname(directory);
+	}
+};
+
+module.exports.exists = pathExists;
+
+module.exports.sync.exists = pathExists.sync;
+
+module.exports.stop = stop;
diff --git a/node_modules/mathjs/examples/node_modules/find-up/license b/node_modules/mathjs/examples/node_modules/find-up/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/find-up/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/find-up/package.json b/node_modules/mathjs/examples/node_modules/find-up/package.json
new file mode 100644
index 0000000..cd50281
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/find-up/package.json
@@ -0,0 +1,53 @@
+{
+	"name": "find-up",
+	"version": "4.1.0",
+	"description": "Find a file or directory by walking up parent directories",
+	"license": "MIT",
+	"repository": "sindresorhus/find-up",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"find",
+		"up",
+		"find-up",
+		"findup",
+		"look-up",
+		"look",
+		"file",
+		"search",
+		"match",
+		"package",
+		"resolve",
+		"parent",
+		"parents",
+		"folder",
+		"directory",
+		"walk",
+		"walking",
+		"path"
+	],
+	"dependencies": {
+		"locate-path": "^5.0.0",
+		"path-exists": "^4.0.0"
+	},
+	"devDependencies": {
+		"ava": "^2.1.0",
+		"is-path-inside": "^2.1.0",
+		"tempy": "^0.3.0",
+		"tsd": "^0.7.3",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/find-up/readme.md b/node_modules/mathjs/examples/node_modules/find-up/readme.md
new file mode 100644
index 0000000..d6a21e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/find-up/readme.md
@@ -0,0 +1,156 @@
+# find-up [![Build Status](https://travis-ci.org/sindresorhus/find-up.svg?branch=master)](https://travis-ci.org/sindresorhus/find-up)
+
+> Find a file or directory by walking up parent directories
+
+
+## Install
+
+```
+$ npm install find-up
+```
+
+
+## Usage
+
+```
+/
+└── Users
+    └── sindresorhus
+        ├── unicorn.png
+        └── foo
+            └── bar
+                ├── baz
+                └── example.js
+```
+
+`example.js`
+
+```js
+const path = require('path');
+const findUp = require('find-up');
+
+(async () => {
+	console.log(await findUp('unicorn.png'));
+	//=> '/Users/sindresorhus/unicorn.png'
+
+	console.log(await findUp(['rainbow.png', 'unicorn.png']));
+	//=> '/Users/sindresorhus/unicorn.png'
+
+	console.log(await findUp(async directory => {
+		const hasUnicorns = await findUp.exists(path.join(directory, 'unicorn.png'));
+		return hasUnicorns && directory;
+	}, {type: 'directory'}));
+	//=> '/Users/sindresorhus'
+})();
+```
+
+
+## API
+
+### findUp(name, options?)
+### findUp(matcher, options?)
+
+Returns a `Promise` for either the path or `undefined` if it couldn't be found.
+
+### findUp([...name], options?)
+
+Returns a `Promise` for either the first path found (by respecting the order of the array) or `undefined` if none could be found.
+
+### findUp.sync(name, options?)
+### findUp.sync(matcher, options?)
+
+Returns a path or `undefined` if it couldn't be found.
+
+### findUp.sync([...name], options?)
+
+Returns the first path found (by respecting the order of the array) or `undefined` if none could be found.
+
+#### name
+
+Type: `string`
+
+Name of the file or directory to find.
+
+#### matcher
+
+Type: `Function`
+
+A function that will be called with each directory until it returns a `string` with the path, which stops the search, or the root directory has been reached and nothing was found. Useful if you want to match files with certain patterns, set of permissions, or other advanced use-cases.
+
+When using async mode, the `matcher` may optionally be an async or promise-returning function that returns the path.
+
+#### options
+
+Type: `object`
+
+##### cwd
+
+Type: `string`<br>
+Default: `process.cwd()`
+
+Directory to start from.
+
+##### type
+
+Type: `string`<br>
+Default: `'file'`<br>
+Values: `'file'` `'directory'`
+
+The type of paths that can match.
+
+##### allowSymlinks
+
+Type: `boolean`<br>
+Default: `true`
+
+Allow symbolic links to match if they point to the chosen path type.
+
+### findUp.exists(path)
+
+Returns a `Promise<boolean>` of whether the path exists.
+
+### findUp.sync.exists(path)
+
+Returns a `boolean` of whether the path exists.
+
+#### path
+
+Type: `string`
+
+Path to a file or directory.
+
+### findUp.stop
+
+A [`Symbol`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol) that can be returned by a `matcher` function to stop the search and cause `findUp` to immediately return `undefined`. Useful as a performance optimization in case the current working directory is deeply nested in the filesystem.
+
+```js
+const path = require('path');
+const findUp = require('find-up');
+
+(async () => {
+	await findUp(directory => {
+		return path.basename(directory) === 'work' ? findUp.stop : 'logo.png';
+	});
+})();
+```
+
+
+## Related
+
+- [find-up-cli](https://github.com/sindresorhus/find-up-cli) - CLI for this module
+- [pkg-up](https://github.com/sindresorhus/pkg-up) - Find the closest package.json file
+- [pkg-dir](https://github.com/sindresorhus/pkg-dir) - Find the root directory of an npm package
+- [resolve-from](https://github.com/sindresorhus/resolve-from) - Resolve the path of a module like `require.resolve()` but from a given path
+
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-find-up?utm_source=npm-find-up&utm_medium=referral&utm_campaign=readme">Get professional support for 'find-up' with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/.editorconfig b/node_modules/mathjs/examples/node_modules/function-bind/.editorconfig
new file mode 100644
index 0000000..ac29ade
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/.editorconfig
@@ -0,0 +1,20 @@
+root = true
+
+[*]
+indent_style = tab
+indent_size = 4
+end_of_line = lf
+charset = utf-8
+trim_trailing_whitespace = true
+insert_final_newline = true
+max_line_length = 120
+
+[CHANGELOG.md]
+indent_style = space
+indent_size = 2
+
+[*.json]
+max_line_length = off
+
+[Makefile]
+max_line_length = off
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/.eslintrc b/node_modules/mathjs/examples/node_modules/function-bind/.eslintrc
new file mode 100644
index 0000000..9b33d8e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/.eslintrc
@@ -0,0 +1,15 @@
+{
+	"root": true,
+
+	"extends": "@ljharb",
+
+	"rules": {
+		"func-name-matching": 0,
+		"indent": [2, 4],
+		"max-nested-callbacks": [2, 3],
+		"max-params": [2, 3],
+		"max-statements": [2, 20],
+		"no-new-func": [1],
+		"strict": [0]
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/.jscs.json b/node_modules/mathjs/examples/node_modules/function-bind/.jscs.json
new file mode 100644
index 0000000..8c44794
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/.jscs.json
@@ -0,0 +1,176 @@
+{
+	"es3": true,
+
+	"additionalRules": [],
+
+	"requireSemicolons": true,
+
+	"disallowMultipleSpaces": true,
+
+	"disallowIdentifierNames": [],
+
+	"requireCurlyBraces": {
+		"allExcept": [],
+		"keywords": ["if", "else", "for", "while", "do", "try", "catch"]
+	},
+
+	"requireSpaceAfterKeywords": ["if", "else", "for", "while", "do", "switch", "return", "try", "catch", "function"],
+
+	"disallowSpaceAfterKeywords": [],
+
+	"disallowSpaceBeforeComma": true,
+	"disallowSpaceAfterComma": false,
+	"disallowSpaceBeforeSemicolon": true,
+
+	"disallowNodeTypes": [
+		"DebuggerStatement",
+		"ForInStatement",
+		"LabeledStatement",
+		"SwitchCase",
+		"SwitchStatement",
+		"WithStatement"
+	],
+
+	"requireObjectKeysOnNewLine": { "allExcept": ["sameLine"] },
+
+	"requireSpacesInAnonymousFunctionExpression": { "beforeOpeningRoundBrace": true, "beforeOpeningCurlyBrace": true },
+	"requireSpacesInNamedFunctionExpression": { "beforeOpeningCurlyBrace": true },
+	"disallowSpacesInNamedFunctionExpression": { "beforeOpeningRoundBrace": true },
+	"requireSpacesInFunctionDeclaration": { "beforeOpeningCurlyBrace": true },
+	"disallowSpacesInFunctionDeclaration": { "beforeOpeningRoundBrace": true },
+
+	"requireSpaceBetweenArguments": true,
+
+	"disallowSpacesInsideParentheses": true,
+
+	"disallowSpacesInsideArrayBrackets": true,
+
+	"disallowQuotedKeysInObjects": { "allExcept": ["reserved"] },
+
+	"disallowSpaceAfterObjectKeys": true,
+
+	"requireCommaBeforeLineBreak": true,
+
+	"disallowSpaceAfterPrefixUnaryOperators": ["++", "--", "+", "-", "~", "!"],
+	"requireSpaceAfterPrefixUnaryOperators": [],
+
+	"disallowSpaceBeforePostfixUnaryOperators": ["++", "--"],
+	"requireSpaceBeforePostfixUnaryOperators": [],
+
+	"disallowSpaceBeforeBinaryOperators": [],
+	"requireSpaceBeforeBinaryOperators": ["+", "-", "/", "*", "=", "==", "===", "!=", "!=="],
+
+	"requireSpaceAfterBinaryOperators": ["+", "-", "/", "*", "=", "==", "===", "!=", "!=="],
+	"disallowSpaceAfterBinaryOperators": [],
+
+	"disallowImplicitTypeConversion": ["binary", "string"],
+
+	"disallowKeywords": ["with", "eval"],
+
+	"requireKeywordsOnNewLine": [],
+	"disallowKeywordsOnNewLine": ["else"],
+
+	"requireLineFeedAtFileEnd": true,
+
+	"disallowTrailingWhitespace": true,
+
+	"disallowTrailingComma": true,
+
+	"excludeFiles": ["node_modules/**", "vendor/**"],
+
+	"disallowMultipleLineStrings": true,
+
+	"requireDotNotation": { "allExcept": ["keywords"] },
+
+	"requireParenthesesAroundIIFE": true,
+
+	"validateLineBreaks": "LF",
+
+	"validateQuoteMarks": {
+		"escape": true,
+		"mark": "'"
+	},
+
+	"disallowOperatorBeforeLineBreak": [],
+
+	"requireSpaceBeforeKeywords": [
+		"do",
+		"for",
+		"if",
+		"else",
+		"switch",
+		"case",
+		"try",
+		"catch",
+		"finally",
+		"while",
+		"with",
+		"return"
+	],
+
+	"validateAlignedFunctionParameters": {
+		"lineBreakAfterOpeningBraces": true,
+		"lineBreakBeforeClosingBraces": true
+	},
+
+	"requirePaddingNewLinesBeforeExport": true,
+
+	"validateNewlineAfterArrayElements": {
+		"maximum": 8
+	},
+
+	"requirePaddingNewLinesAfterUseStrict": true,
+
+	"disallowArrowFunctions": true,
+
+	"disallowMultiLineTernary": true,
+
+	"validateOrderInObjectKeys": "asc-insensitive",
+
+	"disallowIdenticalDestructuringNames": true,
+
+	"disallowNestedTernaries": { "maxLevel": 1 },
+
+	"requireSpaceAfterComma": { "allExcept": ["trailing"] },
+	"requireAlignedMultilineParams": false,
+
+	"requireSpacesInGenerator": {
+		"afterStar": true
+	},
+
+	"disallowSpacesInGenerator": {
+		"beforeStar": true
+	},
+
+	"disallowVar": false,
+
+	"requireArrayDestructuring": false,
+
+	"requireEnhancedObjectLiterals": false,
+
+	"requireObjectDestructuring": false,
+
+	"requireEarlyReturn": false,
+
+	"requireCapitalizedConstructorsNew": {
+		"allExcept": ["Function", "String", "Object", "Symbol", "Number", "Date", "RegExp", "Error", "Boolean", "Array"]
+	},
+
+	"requireImportAlphabetized": false,
+
+    "requireSpaceBeforeObjectValues": true,
+    "requireSpaceBeforeDestructuredValues": true,
+
+	"disallowSpacesInsideTemplateStringPlaceholders": true,
+
+    "disallowArrayDestructuringReturn": false,
+
+    "requireNewlineBeforeSingleStatementsInIf": false,
+
+	"disallowUnusedVariables": true,
+
+	"requireSpacesInsideImportedObjectBraces": true,
+
+	"requireUseStrict": true
+}
+
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/.travis.yml b/node_modules/mathjs/examples/node_modules/function-bind/.travis.yml
new file mode 100644
index 0000000..85f70d2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/.travis.yml
@@ -0,0 +1,168 @@
+language: node_js
+os:
+ - linux
+node_js:
+  - "8.4"
+  - "7.10"
+  - "6.11"
+  - "5.12"
+  - "4.8"
+  - "iojs-v3.3"
+  - "iojs-v2.5"
+  - "iojs-v1.8"
+  - "0.12"
+  - "0.10"
+  - "0.8"
+before_install:
+  - 'if [ "${TRAVIS_NODE_VERSION}" = "0.6" ]; then npm install -g npm@1.3 ; elif [ "${TRAVIS_NODE_VERSION}" != "0.9" ]; then case "$(npm --version)" in 1.*) npm install -g npm@1.4.28 ;; 2.*) npm install -g npm@2 ;; esac ; fi'
+  - 'if [ "${TRAVIS_NODE_VERSION}" != "0.6" ] && [ "${TRAVIS_NODE_VERSION}" != "0.9" ]; then if [ "${TRAVIS_NODE_VERSION%${TRAVIS_NODE_VERSION#[0-9]}}" = "0" ] || [ "${TRAVIS_NODE_VERSION:0:4}" = "iojs" ]; then npm install -g npm@4.5 ; else npm install -g npm; fi; fi'
+install:
+  - 'if [ "${TRAVIS_NODE_VERSION}" = "0.6" ]; then nvm install 0.8 && npm install -g npm@1.3 && npm install -g npm@1.4.28 && npm install -g npm@2 && npm install && nvm use "${TRAVIS_NODE_VERSION}"; else npm install; fi;'
+script:
+  - 'if [ -n "${PRETEST-}" ]; then npm run pretest ; fi'
+  - 'if [ -n "${POSTTEST-}" ]; then npm run posttest ; fi'
+  - 'if [ -n "${COVERAGE-}" ]; then npm run coverage ; fi'
+  - 'if [ -n "${TEST-}" ]; then npm run tests-only ; fi'
+sudo: false
+env:
+  - TEST=true
+matrix:
+  fast_finish: true
+  include:
+    - node_js: "node"
+      env: PRETEST=true
+    - node_js: "4"
+      env: COVERAGE=true
+    - node_js: "8.3"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "8.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "8.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "8.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.9"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.8"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.7"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.6"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.5"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.4"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.3"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "7.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.10"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.9"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.8"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.7"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.6"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.5"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.4"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.3"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "6.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.11"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.10"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.9"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.8"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.7"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.6"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.5"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.4"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.3"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "5.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.7"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.6"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.5"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.4"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.3"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "4.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v3.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v3.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v3.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v2.4"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v2.3"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v2.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v2.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v2.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.7"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.6"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.5"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.4"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.3"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.2"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.1"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "iojs-v1.0"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "0.11"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "0.9"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "0.6"
+      env: TEST=true ALLOW_FAILURE=true
+    - node_js: "0.4"
+      env: TEST=true ALLOW_FAILURE=true
+  allow_failures:
+    - os: osx
+    - env: TEST=true ALLOW_FAILURE=true
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/LICENSE b/node_modules/mathjs/examples/node_modules/function-bind/LICENSE
new file mode 100644
index 0000000..62d6d23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/LICENSE
@@ -0,0 +1,20 @@
+Copyright (c) 2013 Raynos.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/README.md b/node_modules/mathjs/examples/node_modules/function-bind/README.md
new file mode 100644
index 0000000..81862a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/README.md
@@ -0,0 +1,48 @@
+# function-bind
+
+<!--
+    [![build status][travis-svg]][travis-url]
+    [![NPM version][npm-badge-svg]][npm-url]
+    [![Coverage Status][5]][6]
+    [![gemnasium Dependency Status][7]][8]
+    [![Dependency status][deps-svg]][deps-url]
+    [![Dev Dependency status][dev-deps-svg]][dev-deps-url]
+-->
+
+<!-- [![browser support][11]][12] -->
+
+Implementation of function.prototype.bind
+
+## Example
+
+I mainly do this for unit tests I run on phantomjs.
+PhantomJS does not have Function.prototype.bind :(
+
+```js
+Function.prototype.bind = require("function-bind")
+```
+
+## Installation
+
+`npm install function-bind`
+
+## Contributors
+
+ - Raynos
+
+## MIT Licenced
+
+  [travis-svg]: https://travis-ci.org/Raynos/function-bind.svg
+  [travis-url]: https://travis-ci.org/Raynos/function-bind
+  [npm-badge-svg]: https://badge.fury.io/js/function-bind.svg
+  [npm-url]: https://npmjs.org/package/function-bind
+  [5]: https://coveralls.io/repos/Raynos/function-bind/badge.png
+  [6]: https://coveralls.io/r/Raynos/function-bind
+  [7]: https://gemnasium.com/Raynos/function-bind.png
+  [8]: https://gemnasium.com/Raynos/function-bind
+  [deps-svg]: https://david-dm.org/Raynos/function-bind.svg
+  [deps-url]: https://david-dm.org/Raynos/function-bind
+  [dev-deps-svg]: https://david-dm.org/Raynos/function-bind/dev-status.svg
+  [dev-deps-url]: https://david-dm.org/Raynos/function-bind#info=devDependencies
+  [11]: https://ci.testling.com/Raynos/function-bind.png
+  [12]: https://ci.testling.com/Raynos/function-bind
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/implementation.js b/node_modules/mathjs/examples/node_modules/function-bind/implementation.js
new file mode 100644
index 0000000..cc4daec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/implementation.js
@@ -0,0 +1,52 @@
+'use strict';
+
+/* eslint no-invalid-this: 1 */
+
+var ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';
+var slice = Array.prototype.slice;
+var toStr = Object.prototype.toString;
+var funcType = '[object Function]';
+
+module.exports = function bind(that) {
+    var target = this;
+    if (typeof target !== 'function' || toStr.call(target) !== funcType) {
+        throw new TypeError(ERROR_MESSAGE + target);
+    }
+    var args = slice.call(arguments, 1);
+
+    var bound;
+    var binder = function () {
+        if (this instanceof bound) {
+            var result = target.apply(
+                this,
+                args.concat(slice.call(arguments))
+            );
+            if (Object(result) === result) {
+                return result;
+            }
+            return this;
+        } else {
+            return target.apply(
+                that,
+                args.concat(slice.call(arguments))
+            );
+        }
+    };
+
+    var boundLength = Math.max(0, target.length - args.length);
+    var boundArgs = [];
+    for (var i = 0; i < boundLength; i++) {
+        boundArgs.push('$' + i);
+    }
+
+    bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);
+
+    if (target.prototype) {
+        var Empty = function Empty() {};
+        Empty.prototype = target.prototype;
+        bound.prototype = new Empty();
+        Empty.prototype = null;
+    }
+
+    return bound;
+};
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/index.js b/node_modules/mathjs/examples/node_modules/function-bind/index.js
new file mode 100644
index 0000000..3bb6b96
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/index.js
@@ -0,0 +1,5 @@
+'use strict';
+
+var implementation = require('./implementation');
+
+module.exports = Function.prototype.bind || implementation;
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/package.json b/node_modules/mathjs/examples/node_modules/function-bind/package.json
new file mode 100644
index 0000000..20a1727
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/package.json
@@ -0,0 +1,63 @@
+{
+  "name": "function-bind",
+  "version": "1.1.1",
+  "description": "Implementation of Function.prototype.bind",
+  "keywords": [
+    "function",
+    "bind",
+    "shim",
+    "es5"
+  ],
+  "author": "Raynos <raynos2@gmail.com>",
+  "repository": "git://github.com/Raynos/function-bind.git",
+  "main": "index",
+  "homepage": "https://github.com/Raynos/function-bind",
+  "contributors": [
+    {
+      "name": "Raynos"
+    },
+    {
+      "name": "Jordan Harband",
+      "url": "https://github.com/ljharb"
+    }
+  ],
+  "bugs": {
+    "url": "https://github.com/Raynos/function-bind/issues",
+    "email": "raynos2@gmail.com"
+  },
+  "dependencies": {},
+  "devDependencies": {
+    "@ljharb/eslint-config": "^12.2.1",
+    "covert": "^1.1.0",
+    "eslint": "^4.5.0",
+    "jscs": "^3.0.7",
+    "tape": "^4.8.0"
+  },
+  "license": "MIT",
+  "scripts": {
+    "pretest": "npm run lint",
+    "test": "npm run tests-only",
+    "posttest": "npm run coverage -- --quiet",
+    "tests-only": "node test",
+    "coverage": "covert test/*.js",
+    "lint": "npm run jscs && npm run eslint",
+    "jscs": "jscs *.js */*.js",
+    "eslint": "eslint *.js */*.js"
+  },
+  "testling": {
+    "files": "test/index.js",
+    "browsers": [
+      "ie/8..latest",
+      "firefox/16..latest",
+      "firefox/nightly",
+      "chrome/22..latest",
+      "chrome/canary",
+      "opera/12..latest",
+      "opera/next",
+      "safari/5.1..latest",
+      "ipad/6.0..latest",
+      "iphone/6.0..latest",
+      "android-browser/4.2..latest"
+    ]
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/test/.eslintrc b/node_modules/mathjs/examples/node_modules/function-bind/test/.eslintrc
new file mode 100644
index 0000000..8a56d5b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/test/.eslintrc
@@ -0,0 +1,9 @@
+{
+	"rules": {
+		"array-bracket-newline": 0,
+		"array-element-newline": 0,
+		"max-statements-per-line": [2, { "max": 2 }],
+		"no-invalid-this": 0,
+		"no-magic-numbers": 0,
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/function-bind/test/index.js b/node_modules/mathjs/examples/node_modules/function-bind/test/index.js
new file mode 100644
index 0000000..2edecce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/function-bind/test/index.js
@@ -0,0 +1,252 @@
+// jscs:disable requireUseStrict
+
+var test = require('tape');
+
+var functionBind = require('../implementation');
+var getCurrentContext = function () { return this; };
+
+test('functionBind is a function', function (t) {
+    t.equal(typeof functionBind, 'function');
+    t.end();
+});
+
+test('non-functions', function (t) {
+    var nonFunctions = [true, false, [], {}, 42, 'foo', NaN, /a/g];
+    t.plan(nonFunctions.length);
+    for (var i = 0; i < nonFunctions.length; ++i) {
+        try { functionBind.call(nonFunctions[i]); } catch (ex) {
+            t.ok(ex instanceof TypeError, 'throws when given ' + String(nonFunctions[i]));
+        }
+    }
+    t.end();
+});
+
+test('without a context', function (t) {
+    t.test('binds properly', function (st) {
+        var args, context;
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                context = this;
+            })
+        };
+        namespace.func(1, 2, 3);
+        st.deepEqual(args, [1, 2, 3]);
+        st.equal(context, getCurrentContext.call());
+        st.end();
+    });
+
+    t.test('binds properly, and still supplies bound arguments', function (st) {
+        var args, context;
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                context = this;
+            }, undefined, 1, 2, 3)
+        };
+        namespace.func(4, 5, 6);
+        st.deepEqual(args, [1, 2, 3, 4, 5, 6]);
+        st.equal(context, getCurrentContext.call());
+        st.end();
+    });
+
+    t.test('returns properly', function (st) {
+        var args;
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                return this;
+            }, null)
+        };
+        var context = namespace.func(1, 2, 3);
+        st.equal(context, getCurrentContext.call(), 'returned context is namespaced context');
+        st.deepEqual(args, [1, 2, 3], 'passed arguments are correct');
+        st.end();
+    });
+
+    t.test('returns properly with bound arguments', function (st) {
+        var args;
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                return this;
+            }, null, 1, 2, 3)
+        };
+        var context = namespace.func(4, 5, 6);
+        st.equal(context, getCurrentContext.call(), 'returned context is namespaced context');
+        st.deepEqual(args, [1, 2, 3, 4, 5, 6], 'passed arguments are correct');
+        st.end();
+    });
+
+    t.test('called as a constructor', function (st) {
+        var thunkify = function (value) {
+            return function () { return value; };
+        };
+        st.test('returns object value', function (sst) {
+            var expectedReturnValue = [1, 2, 3];
+            var Constructor = functionBind.call(thunkify(expectedReturnValue), null);
+            var result = new Constructor();
+            sst.equal(result, expectedReturnValue);
+            sst.end();
+        });
+
+        st.test('does not return primitive value', function (sst) {
+            var Constructor = functionBind.call(thunkify(42), null);
+            var result = new Constructor();
+            sst.notEqual(result, 42);
+            sst.end();
+        });
+
+        st.test('object from bound constructor is instance of original and bound constructor', function (sst) {
+            var A = function (x) {
+                this.name = x || 'A';
+            };
+            var B = functionBind.call(A, null, 'B');
+
+            var result = new B();
+            sst.ok(result instanceof B, 'result is instance of bound constructor');
+            sst.ok(result instanceof A, 'result is instance of original constructor');
+            sst.end();
+        });
+
+        st.end();
+    });
+
+    t.end();
+});
+
+test('with a context', function (t) {
+    t.test('with no bound arguments', function (st) {
+        var args, context;
+        var boundContext = {};
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                context = this;
+            }, boundContext)
+        };
+        namespace.func(1, 2, 3);
+        st.equal(context, boundContext, 'binds a context properly');
+        st.deepEqual(args, [1, 2, 3], 'supplies passed arguments');
+        st.end();
+    });
+
+    t.test('with bound arguments', function (st) {
+        var args, context;
+        var boundContext = {};
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                context = this;
+            }, boundContext, 1, 2, 3)
+        };
+        namespace.func(4, 5, 6);
+        st.equal(context, boundContext, 'binds a context properly');
+        st.deepEqual(args, [1, 2, 3, 4, 5, 6], 'supplies bound and passed arguments');
+        st.end();
+    });
+
+    t.test('returns properly', function (st) {
+        var boundContext = {};
+        var args;
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                return this;
+            }, boundContext)
+        };
+        var context = namespace.func(1, 2, 3);
+        st.equal(context, boundContext, 'returned context is bound context');
+        st.notEqual(context, getCurrentContext.call(), 'returned context is not lexical context');
+        st.deepEqual(args, [1, 2, 3], 'passed arguments are correct');
+        st.end();
+    });
+
+    t.test('returns properly with bound arguments', function (st) {
+        var boundContext = {};
+        var args;
+        var namespace = {
+            func: functionBind.call(function () {
+                args = Array.prototype.slice.call(arguments);
+                return this;
+            }, boundContext, 1, 2, 3)
+        };
+        var context = namespace.func(4, 5, 6);
+        st.equal(context, boundContext, 'returned context is bound context');
+        st.notEqual(context, getCurrentContext.call(), 'returned context is not lexical context');
+        st.deepEqual(args, [1, 2, 3, 4, 5, 6], 'passed arguments are correct');
+        st.end();
+    });
+
+    t.test('passes the correct arguments when called as a constructor', function (st) {
+        var expected = { name: 'Correct' };
+        var namespace = {
+            Func: functionBind.call(function (arg) {
+                return arg;
+            }, { name: 'Incorrect' })
+        };
+        var returned = new namespace.Func(expected);
+        st.equal(returned, expected, 'returns the right arg when called as a constructor');
+        st.end();
+    });
+
+    t.test('has the new instance\'s context when called as a constructor', function (st) {
+        var actualContext;
+        var expectedContext = { foo: 'bar' };
+        var namespace = {
+            Func: functionBind.call(function () {
+                actualContext = this;
+            }, expectedContext)
+        };
+        var result = new namespace.Func();
+        st.equal(result instanceof namespace.Func, true);
+        st.notEqual(actualContext, expectedContext);
+        st.end();
+    });
+
+    t.end();
+});
+
+test('bound function length', function (t) {
+    t.test('sets a correct length without thisArg', function (st) {
+        var subject = functionBind.call(function (a, b, c) { return a + b + c; });
+        st.equal(subject.length, 3);
+        st.equal(subject(1, 2, 3), 6);
+        st.end();
+    });
+
+    t.test('sets a correct length with thisArg', function (st) {
+        var subject = functionBind.call(function (a, b, c) { return a + b + c; }, {});
+        st.equal(subject.length, 3);
+        st.equal(subject(1, 2, 3), 6);
+        st.end();
+    });
+
+    t.test('sets a correct length without thisArg and first argument', function (st) {
+        var subject = functionBind.call(function (a, b, c) { return a + b + c; }, undefined, 1);
+        st.equal(subject.length, 2);
+        st.equal(subject(2, 3), 6);
+        st.end();
+    });
+
+    t.test('sets a correct length with thisArg and first argument', function (st) {
+        var subject = functionBind.call(function (a, b, c) { return a + b + c; }, {}, 1);
+        st.equal(subject.length, 2);
+        st.equal(subject(2, 3), 6);
+        st.end();
+    });
+
+    t.test('sets a correct length without thisArg and too many arguments', function (st) {
+        var subject = functionBind.call(function (a, b, c) { return a + b + c; }, undefined, 1, 2, 3, 4);
+        st.equal(subject.length, 0);
+        st.equal(subject(), 6);
+        st.end();
+    });
+
+    t.test('sets a correct length with thisArg and too many arguments', function (st) {
+        var subject = functionBind.call(function (a, b, c) { return a + b + c; }, {}, 1, 2, 3, 4);
+        st.equal(subject.length, 0);
+        st.equal(subject(), 6);
+        st.end();
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/get-stream/buffer-stream.js b/node_modules/mathjs/examples/node_modules/get-stream/buffer-stream.js
new file mode 100644
index 0000000..2dd7574
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/get-stream/buffer-stream.js
@@ -0,0 +1,52 @@
+'use strict';
+const {PassThrough: PassThroughStream} = require('stream');
+
+module.exports = options => {
+	options = {...options};
+
+	const {array} = options;
+	let {encoding} = options;
+	const isBuffer = encoding === 'buffer';
+	let objectMode = false;
+
+	if (array) {
+		objectMode = !(encoding || isBuffer);
+	} else {
+		encoding = encoding || 'utf8';
+	}
+
+	if (isBuffer) {
+		encoding = null;
+	}
+
+	const stream = new PassThroughStream({objectMode});
+
+	if (encoding) {
+		stream.setEncoding(encoding);
+	}
+
+	let length = 0;
+	const chunks = [];
+
+	stream.on('data', chunk => {
+		chunks.push(chunk);
+
+		if (objectMode) {
+			length = chunks.length;
+		} else {
+			length += chunk.length;
+		}
+	});
+
+	stream.getBufferedValue = () => {
+		if (array) {
+			return chunks;
+		}
+
+		return isBuffer ? Buffer.concat(chunks, length) : chunks.join('');
+	};
+
+	stream.getBufferedLength = () => length;
+
+	return stream;
+};
diff --git a/node_modules/mathjs/examples/node_modules/get-stream/index.d.ts b/node_modules/mathjs/examples/node_modules/get-stream/index.d.ts
new file mode 100644
index 0000000..9485b2b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/get-stream/index.d.ts
@@ -0,0 +1,105 @@
+/// <reference types="node"/>
+import {Stream} from 'stream';
+
+declare class MaxBufferErrorClass extends Error {
+	readonly name: 'MaxBufferError';
+	constructor();
+}
+
+declare namespace getStream {
+	interface Options {
+		/**
+		Maximum length of the returned string. If it exceeds this value before the stream ends, the promise will be rejected with a `MaxBufferError` error.
+
+		@default Infinity
+		*/
+		readonly maxBuffer?: number;
+	}
+
+	interface OptionsWithEncoding<EncodingType = BufferEncoding> extends Options {
+		/**
+		[Encoding](https://nodejs.org/api/buffer.html#buffer_buffer) of the incoming stream.
+
+		@default 'utf8'
+		*/
+		readonly encoding?: EncodingType;
+	}
+
+	type MaxBufferError = MaxBufferErrorClass;
+}
+
+declare const getStream: {
+	/**
+	Get the `stream` as a string.
+
+	@returns A promise that resolves when the end event fires on the stream, indicating that there is no more data to be read. The stream is switched to flowing mode.
+
+	@example
+	```
+	import * as fs from 'fs';
+	import getStream = require('get-stream');
+
+	(async () => {
+		const stream = fs.createReadStream('unicorn.txt');
+
+		console.log(await getStream(stream));
+		//               ,,))))))));,
+		//            __)))))))))))))),
+		// \|/       -\(((((''''((((((((.
+		// -*-==//////((''  .     `)))))),
+		// /|\      ))| o    ;-.    '(((((                                  ,(,
+		//          ( `|    /  )    ;))))'                               ,_))^;(~
+		//             |   |   |   ,))((((_     _____------~~~-.        %,;(;(>';'~
+		//             o_);   ;    )))(((` ~---~  `::           \      %%~~)(v;(`('~
+		//                   ;    ''''````         `:       `:::|\,__,%%    );`'; ~
+		//                  |   _                )     /      `:|`----'     `-'
+		//            ______/\/~    |                 /        /
+		//          /~;;.____/;;'  /          ___--,-(   `;;;/
+		//         / //  _;______;'------~~~~~    /;;/\    /
+		//        //  | |                        / ;   \;;,\
+		//       (<_  | ;                      /',/-----'  _>
+		//        \_| ||_                     //~;~~~~~~~~~
+		//            `\_|                   (,~~
+		//                                    \~\
+		//                                     ~~
+	})();
+	```
+	*/
+	(stream: Stream, options?: getStream.OptionsWithEncoding): Promise<string>;
+
+	/**
+	Get the `stream` as a buffer.
+
+	It honors the `maxBuffer` option as above, but it refers to byte length rather than string length.
+	*/
+	buffer(
+		stream: Stream,
+		options?: getStream.Options
+	): Promise<Buffer>;
+
+	/**
+	Get the `stream` as an array of values.
+
+	It honors both the `maxBuffer` and `encoding` options. The behavior changes slightly based on the encoding chosen:
+
+	- When `encoding` is unset, it assumes an [object mode stream](https://nodesource.com/blog/understanding-object-streams/) and collects values emitted from `stream` unmodified. In this case `maxBuffer` refers to the number of items in the array (not the sum of their sizes).
+	- When `encoding` is set to `buffer`, it collects an array of buffers. `maxBuffer` refers to the summed byte lengths of every buffer in the array.
+	- When `encoding` is set to anything else, it collects an array of strings. `maxBuffer` refers to the summed character lengths of every string in the array.
+	*/
+	array<StreamObjectModeType>(
+		stream: Stream,
+		options?: getStream.Options
+	): Promise<StreamObjectModeType[]>;
+	array(
+		stream: Stream,
+		options: getStream.OptionsWithEncoding<'buffer'>
+	): Promise<Buffer[]>;
+	array(
+		stream: Stream,
+		options: getStream.OptionsWithEncoding<BufferEncoding>
+	): Promise<string[]>;
+
+	MaxBufferError: typeof MaxBufferErrorClass;
+};
+
+export = getStream;
diff --git a/node_modules/mathjs/examples/node_modules/get-stream/index.js b/node_modules/mathjs/examples/node_modules/get-stream/index.js
new file mode 100644
index 0000000..1c5d028
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/get-stream/index.js
@@ -0,0 +1,61 @@
+'use strict';
+const {constants: BufferConstants} = require('buffer');
+const stream = require('stream');
+const {promisify} = require('util');
+const bufferStream = require('./buffer-stream');
+
+const streamPipelinePromisified = promisify(stream.pipeline);
+
+class MaxBufferError extends Error {
+	constructor() {
+		super('maxBuffer exceeded');
+		this.name = 'MaxBufferError';
+	}
+}
+
+async function getStream(inputStream, options) {
+	if (!inputStream) {
+		throw new Error('Expected a stream');
+	}
+
+	options = {
+		maxBuffer: Infinity,
+		...options
+	};
+
+	const {maxBuffer} = options;
+	const stream = bufferStream(options);
+
+	await new Promise((resolve, reject) => {
+		const rejectPromise = error => {
+			// Don't retrieve an oversized buffer.
+			if (error && stream.getBufferedLength() <= BufferConstants.MAX_LENGTH) {
+				error.bufferedData = stream.getBufferedValue();
+			}
+
+			reject(error);
+		};
+
+		(async () => {
+			try {
+				await streamPipelinePromisified(inputStream, stream);
+				resolve();
+			} catch (error) {
+				rejectPromise(error);
+			}
+		})();
+
+		stream.on('data', () => {
+			if (stream.getBufferedLength() > maxBuffer) {
+				rejectPromise(new MaxBufferError());
+			}
+		});
+	});
+
+	return stream.getBufferedValue();
+}
+
+module.exports = getStream;
+module.exports.buffer = (stream, options) => getStream(stream, {...options, encoding: 'buffer'});
+module.exports.array = (stream, options) => getStream(stream, {...options, array: true});
+module.exports.MaxBufferError = MaxBufferError;
diff --git a/node_modules/mathjs/examples/node_modules/get-stream/license b/node_modules/mathjs/examples/node_modules/get-stream/license
new file mode 100644
index 0000000..fa7ceba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/get-stream/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/get-stream/package.json b/node_modules/mathjs/examples/node_modules/get-stream/package.json
new file mode 100644
index 0000000..bd47a75
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/get-stream/package.json
@@ -0,0 +1,47 @@
+{
+	"name": "get-stream",
+	"version": "6.0.1",
+	"description": "Get a stream as a string, buffer, or array",
+	"license": "MIT",
+	"repository": "sindresorhus/get-stream",
+	"funding": "https://github.com/sponsors/sindresorhus",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=10"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts",
+		"buffer-stream.js"
+	],
+	"keywords": [
+		"get",
+		"stream",
+		"promise",
+		"concat",
+		"string",
+		"text",
+		"buffer",
+		"read",
+		"data",
+		"consume",
+		"readable",
+		"readablestream",
+		"array",
+		"object"
+	],
+	"devDependencies": {
+		"@types/node": "^14.0.27",
+		"ava": "^2.4.0",
+		"into-stream": "^5.0.0",
+		"tsd": "^0.13.1",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/get-stream/readme.md b/node_modules/mathjs/examples/node_modules/get-stream/readme.md
new file mode 100644
index 0000000..70b01fd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/get-stream/readme.md
@@ -0,0 +1,124 @@
+# get-stream
+
+> Get a stream as a string, buffer, or array
+
+## Install
+
+```
+$ npm install get-stream
+```
+
+## Usage
+
+```js
+const fs = require('fs');
+const getStream = require('get-stream');
+
+(async () => {
+	const stream = fs.createReadStream('unicorn.txt');
+
+	console.log(await getStream(stream));
+	/*
+	              ,,))))))));,
+	           __)))))))))))))),
+	\|/       -\(((((''''((((((((.
+	-*-==//////((''  .     `)))))),
+	/|\      ))| o    ;-.    '(((((                                  ,(,
+	         ( `|    /  )    ;))))'                               ,_))^;(~
+	            |   |   |   ,))((((_     _____------~~~-.        %,;(;(>';'~
+	            o_);   ;    )))(((` ~---~  `::           \      %%~~)(v;(`('~
+	                  ;    ''''````         `:       `:::|\,__,%%    );`'; ~
+	                 |   _                )     /      `:|`----'     `-'
+	           ______/\/~    |                 /        /
+	         /~;;.____/;;'  /          ___--,-(   `;;;/
+	        / //  _;______;'------~~~~~    /;;/\    /
+	       //  | |                        / ;   \;;,\
+	      (<_  | ;                      /',/-----'  _>
+	       \_| ||_                     //~;~~~~~~~~~
+	           `\_|                   (,~~
+	                                   \~\
+	                                    ~~
+	*/
+})();
+```
+
+## API
+
+The methods returns a promise that resolves when the `end` event fires on the stream, indicating that there is no more data to be read. The stream is switched to flowing mode.
+
+### getStream(stream, options?)
+
+Get the `stream` as a string.
+
+#### options
+
+Type: `object`
+
+##### encoding
+
+Type: `string`\
+Default: `'utf8'`
+
+[Encoding](https://nodejs.org/api/buffer.html#buffer_buffer) of the incoming stream.
+
+##### maxBuffer
+
+Type: `number`\
+Default: `Infinity`
+
+Maximum length of the returned string. If it exceeds this value before the stream ends, the promise will be rejected with a `getStream.MaxBufferError` error.
+
+### getStream.buffer(stream, options?)
+
+Get the `stream` as a buffer.
+
+It honors the `maxBuffer` option as above, but it refers to byte length rather than string length.
+
+### getStream.array(stream, options?)
+
+Get the `stream` as an array of values.
+
+It honors both the `maxBuffer` and `encoding` options. The behavior changes slightly based on the encoding chosen:
+
+- When `encoding` is unset, it assumes an [object mode stream](https://nodesource.com/blog/understanding-object-streams/) and collects values emitted from `stream` unmodified. In this case `maxBuffer` refers to the number of items in the array (not the sum of their sizes).
+
+- When `encoding` is set to `buffer`, it collects an array of buffers. `maxBuffer` refers to the summed byte lengths of every buffer in the array.
+
+- When `encoding` is set to anything else, it collects an array of strings. `maxBuffer` refers to the summed character lengths of every string in the array.
+
+## Errors
+
+If the input stream emits an `error` event, the promise will be rejected with the error. The buffered data will be attached to the `bufferedData` property of the error.
+
+```js
+(async () => {
+	try {
+		await getStream(streamThatErrorsAtTheEnd('unicorn'));
+	} catch (error) {
+		console.log(error.bufferedData);
+		//=> 'unicorn'
+	}
+})()
+```
+
+## FAQ
+
+### How is this different from [`concat-stream`](https://github.com/maxogden/concat-stream)?
+
+This module accepts a stream instead of being one and returns a promise instead of using a callback. The API is simpler and it only supports returning a string, buffer, or array. It doesn't have a fragile type inference. You explicitly choose what you want. And it doesn't depend on the huge `readable-stream` package.
+
+## Related
+
+- [get-stdin](https://github.com/sindresorhus/get-stdin) - Get stdin as a string or buffer
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-get-stream?utm_source=npm-get-stream&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/glob-to-regexp/.travis.yml b/node_modules/mathjs/examples/node_modules/glob-to-regexp/.travis.yml
new file mode 100644
index 0000000..ddc9c4f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/glob-to-regexp/.travis.yml
@@ -0,0 +1,4 @@
+language: node_js
+node_js:
+  - 0.8
+  - "0.10"
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/glob-to-regexp/README.md b/node_modules/mathjs/examples/node_modules/glob-to-regexp/README.md
new file mode 100644
index 0000000..afb4114
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/glob-to-regexp/README.md
@@ -0,0 +1,75 @@
+# Glob To Regular Expression
+
+[![Build Status](https://travis-ci.org/fitzgen/glob-to-regexp.png?branch=master)](https://travis-ci.org/fitzgen/glob-to-regexp)
+
+Turn a \*-wildcard style glob (`"*.min.js"`) into a regular expression
+(`/^.*\.min\.js$/`)!
+
+To match bash-like globs, eg. `?` for any single-character match, `[a-z]` for
+character ranges, and `{*.html, *.js}` for multiple alternatives, call with
+`{ extended: true }`.
+
+To obey [globstars `**`](https://github.com/isaacs/node-glob#glob-primer) rules set option `{globstar: true}`.
+NOTE: This changes the behavior of `*` when `globstar` is `true` as shown below:
+When `{globstar: true}`: `/foo/**` will match any string that starts with `/foo/`
+like `/foo/index.htm`, `/foo/bar/baz.txt`, etc.  Also, `/foo/**/*.txt` will match
+any string that starts with `/foo/` and ends with `.txt` like `/foo/bar.txt`,
+`/foo/bar/baz.txt`, etc.
+Whereas `/foo/*` (single `*`, not a globstar) will match strings that start with
+`/foo/` like `/foo/index.htm`, `/foo/baz.txt` but will not match strings that
+contain a `/` to the right like `/foo/bar/baz.txt`, `/foo/bar/baz/qux.dat`, etc.
+
+Set flags on the resulting `RegExp` object by adding the `flags` property to the option object, eg `{ flags: "i" }` for ignoring case.
+
+## Install
+
+    npm install glob-to-regexp
+
+## Usage
+```js
+var globToRegExp = require('glob-to-regexp');
+var re = globToRegExp("p*uck");
+re.test("pot luck"); // true
+re.test("pluck"); // true
+re.test("puck"); // true
+
+re = globToRegExp("*.min.js");
+re.test("http://example.com/jquery.min.js"); // true
+re.test("http://example.com/jquery.min.js.map"); // false
+
+re = globToRegExp("*/www/*.js");
+re.test("http://example.com/www/app.js"); // true
+re.test("http://example.com/www/lib/factory-proxy-model-observer.js"); // true
+
+// Extended globs
+re = globToRegExp("*/www/{*.js,*.html}", { extended: true });
+re.test("http://example.com/www/app.js"); // true
+re.test("http://example.com/www/index.html"); // true
+```
+
+## License
+
+Copyright (c) 2013, Nick Fitzgerald
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice, this
+  list of conditions and the following disclaimer in the documentation and/or
+  other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/glob-to-regexp/index.js b/node_modules/mathjs/examples/node_modules/glob-to-regexp/index.js
new file mode 100644
index 0000000..365cf22
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/glob-to-regexp/index.js
@@ -0,0 +1,130 @@
+module.exports = function (glob, opts) {
+  if (typeof glob !== 'string') {
+    throw new TypeError('Expected a string');
+  }
+
+  var str = String(glob);
+
+  // The regexp we are building, as a string.
+  var reStr = "";
+
+  // Whether we are matching so called "extended" globs (like bash) and should
+  // support single character matching, matching ranges of characters, group
+  // matching, etc.
+  var extended = opts ? !!opts.extended : false;
+
+  // When globstar is _false_ (default), '/foo/*' is translated a regexp like
+  // '^\/foo\/.*$' which will match any string beginning with '/foo/'
+  // When globstar is _true_, '/foo/*' is translated to regexp like
+  // '^\/foo\/[^/]*$' which will match any string beginning with '/foo/' BUT
+  // which does not have a '/' to the right of it.
+  // E.g. with '/foo/*' these will match: '/foo/bar', '/foo/bar.txt' but
+  // these will not '/foo/bar/baz', '/foo/bar/baz.txt'
+  // Lastely, when globstar is _true_, '/foo/**' is equivelant to '/foo/*' when
+  // globstar is _false_
+  var globstar = opts ? !!opts.globstar : false;
+
+  // If we are doing extended matching, this boolean is true when we are inside
+  // a group (eg {*.html,*.js}), and false otherwise.
+  var inGroup = false;
+
+  // RegExp flags (eg "i" ) to pass in to RegExp constructor.
+  var flags = opts && typeof( opts.flags ) === "string" ? opts.flags : "";
+
+  var c;
+  for (var i = 0, len = str.length; i < len; i++) {
+    c = str[i];
+
+    switch (c) {
+    case "/":
+    case "$":
+    case "^":
+    case "+":
+    case ".":
+    case "(":
+    case ")":
+    case "=":
+    case "!":
+    case "|":
+      reStr += "\\" + c;
+      break;
+
+    case "?":
+      if (extended) {
+        reStr += ".";
+	    break;
+      }
+
+    case "[":
+    case "]":
+      if (extended) {
+        reStr += c;
+	    break;
+      }
+
+    case "{":
+      if (extended) {
+        inGroup = true;
+	    reStr += "(";
+	    break;
+      }
+
+    case "}":
+      if (extended) {
+        inGroup = false;
+	    reStr += ")";
+	    break;
+      }
+
+    case ",":
+      if (inGroup) {
+        reStr += "|";
+	    break;
+      }
+      reStr += "\\" + c;
+      break;
+
+    case "*":
+      // Move over all consecutive "*"'s.
+      // Also store the previous and next characters
+      var prevChar = str[i - 1];
+      var starCount = 1;
+      while(str[i + 1] === "*") {
+        starCount++;
+        i++;
+      }
+      var nextChar = str[i + 1];
+
+      if (!globstar) {
+        // globstar is disabled, so treat any number of "*" as one
+        reStr += ".*";
+      } else {
+        // globstar is enabled, so determine if this is a globstar segment
+        var isGlobstar = starCount > 1                      // multiple "*"'s
+          && (prevChar === "/" || prevChar === undefined)   // from the start of the segment
+          && (nextChar === "/" || nextChar === undefined)   // to the end of the segment
+
+        if (isGlobstar) {
+          // it's a globstar, so match zero or more path segments
+          reStr += "((?:[^/]*(?:\/|$))*)";
+          i++; // move over the "/"
+        } else {
+          // it's not a globstar, so only match one path segment
+          reStr += "([^/]*)";
+        }
+      }
+      break;
+
+    default:
+      reStr += c;
+    }
+  }
+
+  // When regexp 'g' flag is specified don't
+  // constrain the regular expression with ^ & $
+  if (!flags || !~flags.indexOf('g')) {
+    reStr = "^" + reStr + "$";
+  }
+
+  return new RegExp(reStr, flags);
+};
diff --git a/node_modules/mathjs/examples/node_modules/glob-to-regexp/package.json b/node_modules/mathjs/examples/node_modules/glob-to-regexp/package.json
new file mode 100644
index 0000000..467daf3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/glob-to-regexp/package.json
@@ -0,0 +1,23 @@
+{
+  "name": "glob-to-regexp",
+  "version": "0.4.1",
+  "description": "Convert globs to regular expressions",
+  "main": "index.js",
+  "scripts": {
+    "test": "node test.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/fitzgen/glob-to-regexp.git"
+  },
+  "keywords": [
+    "regexp",
+    "glob",
+    "regexps",
+    "regular expressions",
+    "regular expression",
+    "wildcard"
+  ],
+  "author": "Nick Fitzgerald <fitzgen@gmail.com>",
+  "license": "BSD-2-Clause"
+}
diff --git a/node_modules/mathjs/examples/node_modules/glob-to-regexp/test.js b/node_modules/mathjs/examples/node_modules/glob-to-regexp/test.js
new file mode 100644
index 0000000..58ee622
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/glob-to-regexp/test.js
@@ -0,0 +1,235 @@
+var globToRegexp = require("./index.js");
+var assert = require("assert");
+
+function assertMatch(glob, str, opts) {
+  //console.log(glob, globToRegexp(glob, opts));
+  assert.ok(globToRegexp(glob, opts).test(str));
+}
+
+function assertNotMatch(glob, str, opts) {
+  //console.log(glob, globToRegexp(glob, opts));
+  assert.equal(false, globToRegexp(glob, opts).test(str));
+}
+
+function test(globstar) {
+  // Match everything
+  assertMatch("*", "foo");
+  assertMatch("*", "foo", { flags: 'g' });
+
+  // Match the end
+  assertMatch("f*", "foo");
+  assertMatch("f*", "foo", { flags: 'g' });
+
+  // Match the start
+  assertMatch("*o", "foo");
+  assertMatch("*o", "foo", { flags: 'g' });
+
+  // Match the middle
+  assertMatch("f*uck", "firetruck");
+  assertMatch("f*uck", "firetruck", { flags: 'g' });
+
+  // Don't match without Regexp 'g'
+  assertNotMatch("uc", "firetruck");
+  // Match anywhere with RegExp 'g'
+  assertMatch("uc", "firetruck", { flags: 'g' });
+
+  // Match zero characters
+  assertMatch("f*uck", "fuck");
+  assertMatch("f*uck", "fuck", { flags: 'g' });
+
+  // More complex matches
+  assertMatch("*.min.js", "http://example.com/jquery.min.js", {globstar: false});
+  assertMatch("*.min.*", "http://example.com/jquery.min.js", {globstar: false});
+  assertMatch("*/js/*.js", "http://example.com/js/jquery.min.js", {globstar: false});
+
+  // More complex matches with RegExp 'g' flag (complex regression)
+  assertMatch("*.min.*", "http://example.com/jquery.min.js", { flags: 'g' });
+  assertMatch("*.min.js", "http://example.com/jquery.min.js", { flags: 'g' });
+  assertMatch("*/js/*.js", "http://example.com/js/jquery.min.js", { flags: 'g' });
+
+  // Test string  "\\\\/$^+?.()=!|{},[].*"  represents  <glob>\\/$^+?.()=!|{},[].*</glob>
+  // The equivalent regex is:  /^\\\/\$\^\+\?\.\(\)\=\!\|\{\}\,\[\]\..*$/
+  // Both glob and regex match:  \/$^+?.()=!|{},[].*
+  var testStr = "\\\\/$^+?.()=!|{},[].*";
+  var targetStr = "\\/$^+?.()=!|{},[].*";
+  assertMatch(testStr, targetStr);
+  assertMatch(testStr, targetStr, { flags: 'g' });
+
+  // Equivalent matches without/with using RegExp 'g'
+  assertNotMatch(".min.", "http://example.com/jquery.min.js");
+  assertMatch("*.min.*", "http://example.com/jquery.min.js");
+  assertMatch(".min.", "http://example.com/jquery.min.js", { flags: 'g' });
+
+  assertNotMatch("http:", "http://example.com/jquery.min.js");
+  assertMatch("http:*", "http://example.com/jquery.min.js");
+  assertMatch("http:", "http://example.com/jquery.min.js", { flags: 'g' });
+
+  assertNotMatch("min.js", "http://example.com/jquery.min.js");
+  assertMatch("*.min.js", "http://example.com/jquery.min.js");
+  assertMatch("min.js", "http://example.com/jquery.min.js", { flags: 'g' });
+
+  // Match anywhere (globally) using RegExp 'g'
+  assertMatch("min", "http://example.com/jquery.min.js", { flags: 'g' });
+  assertMatch("/js/", "http://example.com/js/jquery.min.js", { flags: 'g' });
+
+  assertNotMatch("/js*jq*.js", "http://example.com/js/jquery.min.js");
+  assertMatch("/js*jq*.js", "http://example.com/js/jquery.min.js", { flags: 'g' });
+
+  // Extended mode
+
+  // ?: Match one character, no more and no less
+  assertMatch("f?o", "foo", { extended: true });
+  assertNotMatch("f?o", "fooo", { extended: true });
+  assertNotMatch("f?oo", "foo", { extended: true });
+
+  // ?: Match one character with RegExp 'g'
+  assertMatch("f?o", "foo", { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("f?o", "fooo", { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("f?o?", "fooo", { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("?fo", "fooo", { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("f?oo", "foo", { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("foo?", "foo", { extended: true,  globstar: globstar, flags: 'g' });
+
+  // []: Match a character range
+  assertMatch("fo[oz]", "foo", { extended: true });
+  assertMatch("fo[oz]", "foz", { extended: true });
+  assertNotMatch("fo[oz]", "fog", { extended: true });
+
+  // []: Match a character range and RegExp 'g' (regresion)
+  assertMatch("fo[oz]", "foo", { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("fo[oz]", "foz", { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("fo[oz]", "fog", { extended: true,  globstar: globstar, flags: 'g' });
+
+  // {}: Match a choice of different substrings
+  assertMatch("foo{bar,baaz}", "foobaaz", { extended: true });
+  assertMatch("foo{bar,baaz}", "foobar", { extended: true });
+  assertNotMatch("foo{bar,baaz}", "foobuzz", { extended: true });
+  assertMatch("foo{bar,b*z}", "foobuzz", { extended: true });
+
+  // {}: Match a choice of different substrings and RegExp 'g' (regression)
+  assertMatch("foo{bar,baaz}", "foobaaz", { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("foo{bar,baaz}", "foobar", { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("foo{bar,baaz}", "foobuzz", { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("foo{bar,b*z}", "foobuzz", { extended: true,  globstar: globstar, flags: 'g' });
+
+  // More complex extended matches
+  assertMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+              "http://foo.baaz.com/jquery.min.js",
+              { extended: true });
+  assertMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+              "http://moz.buzz.com/index.html",
+              { extended: true });
+  assertNotMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+                 "http://moz.buzz.com/index.htm",
+                 { extended: true });
+  assertNotMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+                 "http://moz.bar.com/index.html",
+                 { extended: true });
+  assertNotMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+                 "http://flozz.buzz.com/index.html",
+                 { extended: true });
+
+  // More complex extended matches and RegExp 'g' (regresion)
+  assertMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+              "http://foo.baaz.com/jquery.min.js",
+              { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+              "http://moz.buzz.com/index.html",
+              { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+                 "http://moz.buzz.com/index.htm",
+                 { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+                 "http://moz.bar.com/index.html",
+                 { extended: true,  globstar: globstar, flags: 'g' });
+  assertNotMatch("http://?o[oz].b*z.com/{*.js,*.html}",
+                 "http://flozz.buzz.com/index.html",
+                 { extended: true,  globstar: globstar, flags: 'g' });
+
+  // globstar
+  assertMatch("http://foo.com/**/{*.js,*.html}",
+              "http://foo.com/bar/jquery.min.js",
+              { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("http://foo.com/**/{*.js,*.html}",
+              "http://foo.com/bar/baz/jquery.min.js",
+              { extended: true,  globstar: globstar, flags: 'g' });
+  assertMatch("http://foo.com/**",
+              "http://foo.com/bar/baz/jquery.min.js",
+              { extended: true,  globstar: globstar, flags: 'g' });
+
+  // Remaining special chars should still match themselves
+  // Test string  "\\\\/$^+.()=!|,.*"  represents  <glob>\\/$^+.()=!|,.*</glob>
+  // The equivalent regex is:  /^\\\/\$\^\+\.\(\)\=\!\|\,\..*$/
+  // Both glob and regex match:  \/$^+.()=!|,.*
+  var testExtStr = "\\\\/$^+.()=!|,.*";
+  var targetExtStr = "\\/$^+.()=!|,.*";
+  assertMatch(testExtStr, targetExtStr, { extended: true });
+  assertMatch(testExtStr, targetExtStr, { extended: true,  globstar: globstar, flags: 'g' });
+}
+
+// regression
+// globstar false
+test(false)
+// globstar true
+test(true);
+
+// globstar specific tests
+assertMatch("/foo/*", "/foo/bar.txt", {globstar: true });
+assertMatch("/foo/**", "/foo/baz.txt", {globstar: true });
+assertMatch("/foo/**", "/foo/bar/baz.txt", {globstar: true });
+assertMatch("/foo/*/*.txt", "/foo/bar/baz.txt", {globstar: true });
+assertMatch("/foo/**/*.txt", "/foo/bar/baz.txt", {globstar: true });
+assertMatch("/foo/**/*.txt", "/foo/bar/baz/qux.txt", {globstar: true });
+assertMatch("/foo/**/bar.txt", "/foo/bar.txt", {globstar: true });
+assertMatch("/foo/**/**/bar.txt", "/foo/bar.txt", {globstar: true });
+assertMatch("/foo/**/*/baz.txt", "/foo/bar/baz.txt", {globstar: true });
+assertMatch("/foo/**/*.txt", "/foo/bar.txt", {globstar: true });
+assertMatch("/foo/**/**/*.txt", "/foo/bar.txt", {globstar: true });
+assertMatch("/foo/**/*/*.txt", "/foo/bar/baz.txt", {globstar: true });
+assertMatch("**/*.txt", "/foo/bar/baz/qux.txt", {globstar: true });
+assertMatch("**/foo.txt", "foo.txt", {globstar: true });
+assertMatch("**/*.txt", "foo.txt", {globstar: true });
+
+assertNotMatch("/foo/*", "/foo/bar/baz.txt", {globstar: true });
+assertNotMatch("/foo/*.txt", "/foo/bar/baz.txt", {globstar: true });
+assertNotMatch("/foo/*/*.txt", "/foo/bar/baz/qux.txt", {globstar: true });
+assertNotMatch("/foo/*/bar.txt", "/foo/bar.txt", {globstar: true });
+assertNotMatch("/foo/*/*/baz.txt", "/foo/bar/baz.txt", {globstar: true });
+assertNotMatch("/foo/**.txt", "/foo/bar/baz/qux.txt", {globstar: true });
+assertNotMatch("/foo/bar**/*.txt", "/foo/bar/baz/qux.txt", {globstar: true });
+assertNotMatch("/foo/bar**", "/foo/bar/baz.txt", {globstar: true });
+assertNotMatch("**/.txt", "/foo/bar/baz/qux.txt", {globstar: true });
+assertNotMatch("*/*.txt", "/foo/bar/baz/qux.txt", {globstar: true });
+assertNotMatch("*/*.txt", "foo.txt", {globstar: true });
+
+assertNotMatch("http://foo.com/*",
+               "http://foo.com/bar/baz/jquery.min.js",
+               { extended: true,  globstar: true });
+assertNotMatch("http://foo.com/*",
+               "http://foo.com/bar/baz/jquery.min.js",
+               { globstar: true });
+
+assertMatch("http://foo.com/*",
+            "http://foo.com/bar/baz/jquery.min.js",
+            { globstar: false });
+assertMatch("http://foo.com/**",
+            "http://foo.com/bar/baz/jquery.min.js",
+            { globstar: true });
+
+assertMatch("http://foo.com/*/*/jquery.min.js",
+            "http://foo.com/bar/baz/jquery.min.js",
+            { globstar: true });
+assertMatch("http://foo.com/**/jquery.min.js",
+            "http://foo.com/bar/baz/jquery.min.js",
+            { globstar: true });
+assertMatch("http://foo.com/*/*/jquery.min.js",
+            "http://foo.com/bar/baz/jquery.min.js",
+            { globstar: false });
+assertMatch("http://foo.com/*/jquery.min.js",
+            "http://foo.com/bar/baz/jquery.min.js",
+            { globstar: false });
+assertNotMatch("http://foo.com/*/jquery.min.js",
+               "http://foo.com/bar/baz/jquery.min.js",
+               { globstar: true });
+
+console.log("Ok!");
diff --git a/node_modules/mathjs/examples/node_modules/graceful-fs/LICENSE b/node_modules/mathjs/examples/node_modules/graceful-fs/LICENSE
new file mode 100644
index 0000000..9d2c803
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/graceful-fs/LICENSE
@@ -0,0 +1,15 @@
+The ISC License
+
+Copyright (c) Isaac Z. Schlueter, Ben Noordhuis, and Contributors
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
+IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/graceful-fs/README.md b/node_modules/mathjs/examples/node_modules/graceful-fs/README.md
new file mode 100644
index 0000000..82d6e4d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/graceful-fs/README.md
@@ -0,0 +1,143 @@
+# graceful-fs
+
+graceful-fs functions as a drop-in replacement for the fs module,
+making various improvements.
+
+The improvements are meant to normalize behavior across different
+platforms and environments, and to make filesystem access more
+resilient to errors.
+
+## Improvements over [fs module](https://nodejs.org/api/fs.html)
+
+* Queues up `open` and `readdir` calls, and retries them once
+  something closes if there is an EMFILE error from too many file
+  descriptors.
+* fixes `lchmod` for Node versions prior to 0.6.2.
+* implements `fs.lutimes` if possible. Otherwise it becomes a noop.
+* ignores `EINVAL` and `EPERM` errors in `chown`, `fchown` or
+  `lchown` if the user isn't root.
+* makes `lchmod` and `lchown` become noops, if not available.
+* retries reading a file if `read` results in EAGAIN error.
+
+On Windows, it retries renaming a file for up to one second if `EACCESS`
+or `EPERM` error occurs, likely because antivirus software has locked
+the directory.
+
+## USAGE
+
+```javascript
+// use just like fs
+var fs = require('graceful-fs')
+
+// now go and do stuff with it...
+fs.readFile('some-file-or-whatever', (err, data) => {
+  // Do stuff here.
+})
+```
+
+## Sync methods
+
+This module cannot intercept or handle `EMFILE` or `ENFILE` errors from sync
+methods.  If you use sync methods which open file descriptors then you are
+responsible for dealing with any errors.
+
+This is a known limitation, not a bug.
+
+## Global Patching
+
+If you want to patch the global fs module (or any other fs-like
+module) you can do this:
+
+```javascript
+// Make sure to read the caveat below.
+var realFs = require('fs')
+var gracefulFs = require('graceful-fs')
+gracefulFs.gracefulify(realFs)
+```
+
+This should only ever be done at the top-level application layer, in
+order to delay on EMFILE errors from any fs-using dependencies.  You
+should **not** do this in a library, because it can cause unexpected
+delays in other parts of the program.
+
+## Changes
+
+This module is fairly stable at this point, and used by a lot of
+things.  That being said, because it implements a subtle behavior
+change in a core part of the node API, even modest changes can be
+extremely breaking, and the versioning is thus biased towards
+bumping the major when in doubt.
+
+The main change between major versions has been switching between
+providing a fully-patched `fs` module vs monkey-patching the node core
+builtin, and the approach by which a non-monkey-patched `fs` was
+created.
+
+The goal is to trade `EMFILE` errors for slower fs operations.  So, if
+you try to open a zillion files, rather than crashing, `open`
+operations will be queued up and wait for something else to `close`.
+
+There are advantages to each approach.  Monkey-patching the fs means
+that no `EMFILE` errors can possibly occur anywhere in your
+application, because everything is using the same core `fs` module,
+which is patched.  However, it can also obviously cause undesirable
+side-effects, especially if the module is loaded multiple times.
+
+Implementing a separate-but-identical patched `fs` module is more
+surgical (and doesn't run the risk of patching multiple times), but
+also imposes the challenge of keeping in sync with the core module.
+
+The current approach loads the `fs` module, and then creates a
+lookalike object that has all the same methods, except a few that are
+patched.  It is safe to use in all versions of Node from 0.8 through
+7.0.
+
+### v4
+
+* Do not monkey-patch the fs module.  This module may now be used as a
+  drop-in dep, and users can opt into monkey-patching the fs builtin
+  if their app requires it.
+
+### v3
+
+* Monkey-patch fs, because the eval approach no longer works on recent
+  node.
+* fixed possible type-error throw if rename fails on windows
+* verify that we *never* get EMFILE errors
+* Ignore ENOSYS from chmod/chown
+* clarify that graceful-fs must be used as a drop-in
+
+### v2.1.0
+
+* Use eval rather than monkey-patching fs.
+* readdir: Always sort the results
+* win32: requeue a file if error has an OK status
+
+### v2.0
+
+* A return to monkey patching
+* wrap process.cwd
+
+### v1.1
+
+* wrap readFile
+* Wrap fs.writeFile.
+* readdir protection
+* Don't clobber the fs builtin
+* Handle fs.read EAGAIN errors by trying again
+* Expose the curOpen counter
+* No-op lchown/lchmod if not implemented
+* fs.rename patch only for win32
+* Patch fs.rename to handle AV software on Windows
+* Close #4 Chown should not fail on einval or eperm if non-root
+* Fix isaacs/fstream#1 Only wrap fs one time
+* Fix #3 Start at 1024 max files, then back off on EMFILE
+* lutimes that doens't blow up on Linux
+* A full on-rewrite using a queue instead of just swallowing the EMFILE error
+* Wrap Read/Write streams as well
+
+### 1.0
+
+* Update engines for node 0.6
+* Be lstat-graceful on Windows
+* first
diff --git a/node_modules/mathjs/examples/node_modules/graceful-fs/clone.js b/node_modules/mathjs/examples/node_modules/graceful-fs/clone.js
new file mode 100644
index 0000000..dff3cc8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/graceful-fs/clone.js
@@ -0,0 +1,23 @@
+'use strict'
+
+module.exports = clone
+
+var getPrototypeOf = Object.getPrototypeOf || function (obj) {
+  return obj.__proto__
+}
+
+function clone (obj) {
+  if (obj === null || typeof obj !== 'object')
+    return obj
+
+  if (obj instanceof Object)
+    var copy = { __proto__: getPrototypeOf(obj) }
+  else
+    var copy = Object.create(null)
+
+  Object.getOwnPropertyNames(obj).forEach(function (key) {
+    Object.defineProperty(copy, key, Object.getOwnPropertyDescriptor(obj, key))
+  })
+
+  return copy
+}
diff --git a/node_modules/mathjs/examples/node_modules/graceful-fs/graceful-fs.js b/node_modules/mathjs/examples/node_modules/graceful-fs/graceful-fs.js
new file mode 100644
index 0000000..947cd94
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/graceful-fs/graceful-fs.js
@@ -0,0 +1,429 @@
+var fs = require('fs')
+var polyfills = require('./polyfills.js')
+var legacy = require('./legacy-streams.js')
+var clone = require('./clone.js')
+
+var util = require('util')
+
+/* istanbul ignore next - node 0.x polyfill */
+var gracefulQueue
+var previousSymbol
+
+/* istanbul ignore else - node 0.x polyfill */
+if (typeof Symbol === 'function' && typeof Symbol.for === 'function') {
+  gracefulQueue = Symbol.for('graceful-fs.queue')
+  // This is used in testing by future versions
+  previousSymbol = Symbol.for('graceful-fs.previous')
+} else {
+  gracefulQueue = '___graceful-fs.queue'
+  previousSymbol = '___graceful-fs.previous'
+}
+
+function noop () {}
+
+function publishQueue(context, queue) {
+  Object.defineProperty(context, gracefulQueue, {
+    get: function() {
+      return queue
+    }
+  })
+}
+
+var debug = noop
+if (util.debuglog)
+  debug = util.debuglog('gfs4')
+else if (/\bgfs4\b/i.test(process.env.NODE_DEBUG || ''))
+  debug = function() {
+    var m = util.format.apply(util, arguments)
+    m = 'GFS4: ' + m.split(/\n/).join('\nGFS4: ')
+    console.error(m)
+  }
+
+// Once time initialization
+if (!fs[gracefulQueue]) {
+  // This queue can be shared by multiple loaded instances
+  var queue = global[gracefulQueue] || []
+  publishQueue(fs, queue)
+
+  // Patch fs.close/closeSync to shared queue version, because we need
+  // to retry() whenever a close happens *anywhere* in the program.
+  // This is essential when multiple graceful-fs instances are
+  // in play at the same time.
+  fs.close = (function (fs$close) {
+    function close (fd, cb) {
+      return fs$close.call(fs, fd, function (err) {
+        // This function uses the graceful-fs shared queue
+        if (!err) {
+          resetQueue()
+        }
+
+        if (typeof cb === 'function')
+          cb.apply(this, arguments)
+      })
+    }
+
+    Object.defineProperty(close, previousSymbol, {
+      value: fs$close
+    })
+    return close
+  })(fs.close)
+
+  fs.closeSync = (function (fs$closeSync) {
+    function closeSync (fd) {
+      // This function uses the graceful-fs shared queue
+      fs$closeSync.apply(fs, arguments)
+      resetQueue()
+    }
+
+    Object.defineProperty(closeSync, previousSymbol, {
+      value: fs$closeSync
+    })
+    return closeSync
+  })(fs.closeSync)
+
+  if (/\bgfs4\b/i.test(process.env.NODE_DEBUG || '')) {
+    process.on('exit', function() {
+      debug(fs[gracefulQueue])
+      require('assert').equal(fs[gracefulQueue].length, 0)
+    })
+  }
+}
+
+if (!global[gracefulQueue]) {
+  publishQueue(global, fs[gracefulQueue]);
+}
+
+module.exports = patch(clone(fs))
+if (process.env.TEST_GRACEFUL_FS_GLOBAL_PATCH && !fs.__patched) {
+    module.exports = patch(fs)
+    fs.__patched = true;
+}
+
+function patch (fs) {
+  // Everything that references the open() function needs to be in here
+  polyfills(fs)
+  fs.gracefulify = patch
+
+  fs.createReadStream = createReadStream
+  fs.createWriteStream = createWriteStream
+  var fs$readFile = fs.readFile
+  fs.readFile = readFile
+  function readFile (path, options, cb) {
+    if (typeof options === 'function')
+      cb = options, options = null
+
+    return go$readFile(path, options, cb)
+
+    function go$readFile (path, options, cb, startTime) {
+      return fs$readFile(path, options, function (err) {
+        if (err && (err.code === 'EMFILE' || err.code === 'ENFILE'))
+          enqueue([go$readFile, [path, options, cb], err, startTime || Date.now(), Date.now()])
+        else {
+          if (typeof cb === 'function')
+            cb.apply(this, arguments)
+        }
+      })
+    }
+  }
+
+  var fs$writeFile = fs.writeFile
+  fs.writeFile = writeFile
+  function writeFile (path, data, options, cb) {
+    if (typeof options === 'function')
+      cb = options, options = null
+
+    return go$writeFile(path, data, options, cb)
+
+    function go$writeFile (path, data, options, cb, startTime) {
+      return fs$writeFile(path, data, options, function (err) {
+        if (err && (err.code === 'EMFILE' || err.code === 'ENFILE'))
+          enqueue([go$writeFile, [path, data, options, cb], err, startTime || Date.now(), Date.now()])
+        else {
+          if (typeof cb === 'function')
+            cb.apply(this, arguments)
+        }
+      })
+    }
+  }
+
+  var fs$appendFile = fs.appendFile
+  if (fs$appendFile)
+    fs.appendFile = appendFile
+  function appendFile (path, data, options, cb) {
+    if (typeof options === 'function')
+      cb = options, options = null
+
+    return go$appendFile(path, data, options, cb)
+
+    function go$appendFile (path, data, options, cb, startTime) {
+      return fs$appendFile(path, data, options, function (err) {
+        if (err && (err.code === 'EMFILE' || err.code === 'ENFILE'))
+          enqueue([go$appendFile, [path, data, options, cb], err, startTime || Date.now(), Date.now()])
+        else {
+          if (typeof cb === 'function')
+            cb.apply(this, arguments)
+        }
+      })
+    }
+  }
+
+  var fs$copyFile = fs.copyFile
+  if (fs$copyFile)
+    fs.copyFile = copyFile
+  function copyFile (src, dest, flags, cb) {
+    if (typeof flags === 'function') {
+      cb = flags
+      flags = 0
+    }
+    return go$copyFile(src, dest, flags, cb)
+
+    function go$copyFile (src, dest, flags, cb, startTime) {
+      return fs$copyFile(src, dest, flags, function (err) {
+        if (err && (err.code === 'EMFILE' || err.code === 'ENFILE'))
+          enqueue([go$copyFile, [src, dest, flags, cb], err, startTime || Date.now(), Date.now()])
+        else {
+          if (typeof cb === 'function')
+            cb.apply(this, arguments)
+        }
+      })
+    }
+  }
+
+  var fs$readdir = fs.readdir
+  fs.readdir = readdir
+  function readdir (path, options, cb) {
+    if (typeof options === 'function')
+      cb = options, options = null
+
+    return go$readdir(path, options, cb)
+
+    function go$readdir (path, options, cb, startTime) {
+      return fs$readdir(path, options, function (err, files) {
+        if (err && (err.code === 'EMFILE' || err.code === 'ENFILE'))
+          enqueue([go$readdir, [path, options, cb], err, startTime || Date.now(), Date.now()])
+        else {
+          if (files && files.sort)
+            files.sort()
+
+          if (typeof cb === 'function')
+            cb.call(this, err, files)
+        }
+      })
+    }
+  }
+
+  if (process.version.substr(0, 4) === 'v0.8') {
+    var legStreams = legacy(fs)
+    ReadStream = legStreams.ReadStream
+    WriteStream = legStreams.WriteStream
+  }
+
+  var fs$ReadStream = fs.ReadStream
+  if (fs$ReadStream) {
+    ReadStream.prototype = Object.create(fs$ReadStream.prototype)
+    ReadStream.prototype.open = ReadStream$open
+  }
+
+  var fs$WriteStream = fs.WriteStream
+  if (fs$WriteStream) {
+    WriteStream.prototype = Object.create(fs$WriteStream.prototype)
+    WriteStream.prototype.open = WriteStream$open
+  }
+
+  Object.defineProperty(fs, 'ReadStream', {
+    get: function () {
+      return ReadStream
+    },
+    set: function (val) {
+      ReadStream = val
+    },
+    enumerable: true,
+    configurable: true
+  })
+  Object.defineProperty(fs, 'WriteStream', {
+    get: function () {
+      return WriteStream
+    },
+    set: function (val) {
+      WriteStream = val
+    },
+    enumerable: true,
+    configurable: true
+  })
+
+  // legacy names
+  var FileReadStream = ReadStream
+  Object.defineProperty(fs, 'FileReadStream', {
+    get: function () {
+      return FileReadStream
+    },
+    set: function (val) {
+      FileReadStream = val
+    },
+    enumerable: true,
+    configurable: true
+  })
+  var FileWriteStream = WriteStream
+  Object.defineProperty(fs, 'FileWriteStream', {
+    get: function () {
+      return FileWriteStream
+    },
+    set: function (val) {
+      FileWriteStream = val
+    },
+    enumerable: true,
+    configurable: true
+  })
+
+  function ReadStream (path, options) {
+    if (this instanceof ReadStream)
+      return fs$ReadStream.apply(this, arguments), this
+    else
+      return ReadStream.apply(Object.create(ReadStream.prototype), arguments)
+  }
+
+  function ReadStream$open () {
+    var that = this
+    open(that.path, that.flags, that.mode, function (err, fd) {
+      if (err) {
+        if (that.autoClose)
+          that.destroy()
+
+        that.emit('error', err)
+      } else {
+        that.fd = fd
+        that.emit('open', fd)
+        that.read()
+      }
+    })
+  }
+
+  function WriteStream (path, options) {
+    if (this instanceof WriteStream)
+      return fs$WriteStream.apply(this, arguments), this
+    else
+      return WriteStream.apply(Object.create(WriteStream.prototype), arguments)
+  }
+
+  function WriteStream$open () {
+    var that = this
+    open(that.path, that.flags, that.mode, function (err, fd) {
+      if (err) {
+        that.destroy()
+        that.emit('error', err)
+      } else {
+        that.fd = fd
+        that.emit('open', fd)
+      }
+    })
+  }
+
+  function createReadStream (path, options) {
+    return new fs.ReadStream(path, options)
+  }
+
+  function createWriteStream (path, options) {
+    return new fs.WriteStream(path, options)
+  }
+
+  var fs$open = fs.open
+  fs.open = open
+  function open (path, flags, mode, cb) {
+    if (typeof mode === 'function')
+      cb = mode, mode = null
+
+    return go$open(path, flags, mode, cb)
+
+    function go$open (path, flags, mode, cb, startTime) {
+      return fs$open(path, flags, mode, function (err, fd) {
+        if (err && (err.code === 'EMFILE' || err.code === 'ENFILE'))
+          enqueue([go$open, [path, flags, mode, cb], err, startTime || Date.now(), Date.now()])
+        else {
+          if (typeof cb === 'function')
+            cb.apply(this, arguments)
+        }
+      })
+    }
+  }
+
+  return fs
+}
+
+function enqueue (elem) {
+  debug('ENQUEUE', elem[0].name, elem[1])
+  fs[gracefulQueue].push(elem)
+  retry()
+}
+
+// keep track of the timeout between retry() calls
+var retryTimer
+
+// reset the startTime and lastTime to now
+// this resets the start of the 60 second overall timeout as well as the
+// delay between attempts so that we'll retry these jobs sooner
+function resetQueue () {
+  var now = Date.now()
+  for (var i = 0; i < fs[gracefulQueue].length; ++i) {
+    // entries that are only a length of 2 are from an older version, don't
+    // bother modifying those since they'll be retried anyway.
+    if (fs[gracefulQueue][i].length > 2) {
+      fs[gracefulQueue][i][3] = now // startTime
+      fs[gracefulQueue][i][4] = now // lastTime
+    }
+  }
+  // call retry to make sure we're actively processing the queue
+  retry()
+}
+
+function retry () {
+  // clear the timer and remove it to help prevent unintended concurrency
+  clearTimeout(retryTimer)
+  retryTimer = undefined
+
+  if (fs[gracefulQueue].length === 0)
+    return
+
+  var elem = fs[gracefulQueue].shift()
+  var fn = elem[0]
+  var args = elem[1]
+  // these items may be unset if they were added by an older graceful-fs
+  var err = elem[2]
+  var startTime = elem[3]
+  var lastTime = elem[4]
+
+  // if we don't have a startTime we have no way of knowing if we've waited
+  // long enough, so go ahead and retry this item now
+  if (startTime === undefined) {
+    debug('RETRY', fn.name, args)
+    fn.apply(null, args)
+  } else if (Date.now() - startTime >= 60000) {
+    // it's been more than 60 seconds total, bail now
+    debug('TIMEOUT', fn.name, args)
+    var cb = args.pop()
+    if (typeof cb === 'function')
+      cb.call(null, err)
+  } else {
+    // the amount of time between the last attempt and right now
+    var sinceAttempt = Date.now() - lastTime
+    // the amount of time between when we first tried, and when we last tried
+    // rounded up to at least 1
+    var sinceStart = Math.max(lastTime - startTime, 1)
+    // backoff. wait longer than the total time we've been retrying, but only
+    // up to a maximum of 100ms
+    var desiredDelay = Math.min(sinceStart * 1.2, 100)
+    // it's been long enough since the last retry, do it again
+    if (sinceAttempt >= desiredDelay) {
+      debug('RETRY', fn.name, args)
+      fn.apply(null, args.concat([startTime]))
+    } else {
+      // if we can't do this job yet, push it to the end of the queue
+      // and let the next iteration check again
+      fs[gracefulQueue].push(elem)
+    }
+  }
+
+  // schedule our next run if one isn't already scheduled
+  if (retryTimer === undefined) {
+    retryTimer = setTimeout(retry, 0)
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/graceful-fs/legacy-streams.js b/node_modules/mathjs/examples/node_modules/graceful-fs/legacy-streams.js
new file mode 100644
index 0000000..d617b50
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/graceful-fs/legacy-streams.js
@@ -0,0 +1,118 @@
+var Stream = require('stream').Stream
+
+module.exports = legacy
+
+function legacy (fs) {
+  return {
+    ReadStream: ReadStream,
+    WriteStream: WriteStream
+  }
+
+  function ReadStream (path, options) {
+    if (!(this instanceof ReadStream)) return new ReadStream(path, options);
+
+    Stream.call(this);
+
+    var self = this;
+
+    this.path = path;
+    this.fd = null;
+    this.readable = true;
+    this.paused = false;
+
+    this.flags = 'r';
+    this.mode = 438; /*=0666*/
+    this.bufferSize = 64 * 1024;
+
+    options = options || {};
+
+    // Mixin options into this
+    var keys = Object.keys(options);
+    for (var index = 0, length = keys.length; index < length; index++) {
+      var key = keys[index];
+      this[key] = options[key];
+    }
+
+    if (this.encoding) this.setEncoding(this.encoding);
+
+    if (this.start !== undefined) {
+      if ('number' !== typeof this.start) {
+        throw TypeError('start must be a Number');
+      }
+      if (this.end === undefined) {
+        this.end = Infinity;
+      } else if ('number' !== typeof this.end) {
+        throw TypeError('end must be a Number');
+      }
+
+      if (this.start > this.end) {
+        throw new Error('start must be <= end');
+      }
+
+      this.pos = this.start;
+    }
+
+    if (this.fd !== null) {
+      process.nextTick(function() {
+        self._read();
+      });
+      return;
+    }
+
+    fs.open(this.path, this.flags, this.mode, function (err, fd) {
+      if (err) {
+        self.emit('error', err);
+        self.readable = false;
+        return;
+      }
+
+      self.fd = fd;
+      self.emit('open', fd);
+      self._read();
+    })
+  }
+
+  function WriteStream (path, options) {
+    if (!(this instanceof WriteStream)) return new WriteStream(path, options);
+
+    Stream.call(this);
+
+    this.path = path;
+    this.fd = null;
+    this.writable = true;
+
+    this.flags = 'w';
+    this.encoding = 'binary';
+    this.mode = 438; /*=0666*/
+    this.bytesWritten = 0;
+
+    options = options || {};
+
+    // Mixin options into this
+    var keys = Object.keys(options);
+    for (var index = 0, length = keys.length; index < length; index++) {
+      var key = keys[index];
+      this[key] = options[key];
+    }
+
+    if (this.start !== undefined) {
+      if ('number' !== typeof this.start) {
+        throw TypeError('start must be a Number');
+      }
+      if (this.start < 0) {
+        throw new Error('start must be >= zero');
+      }
+
+      this.pos = this.start;
+    }
+
+    this.busy = false;
+    this._queue = [];
+
+    if (this.fd === null) {
+      this._open = fs.open;
+      this._queue.push([this._open, this.path, this.flags, this.mode, undefined]);
+      this.flush();
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/graceful-fs/package.json b/node_modules/mathjs/examples/node_modules/graceful-fs/package.json
new file mode 100644
index 0000000..e1cb584
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/graceful-fs/package.json
@@ -0,0 +1,50 @@
+{
+  "name": "graceful-fs",
+  "description": "A drop-in replacement for fs, making various improvements.",
+  "version": "4.2.9",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/isaacs/node-graceful-fs"
+  },
+  "main": "graceful-fs.js",
+  "directories": {
+    "test": "test"
+  },
+  "scripts": {
+    "preversion": "npm test",
+    "postversion": "npm publish",
+    "postpublish": "git push origin --follow-tags",
+    "test": "nyc --silent node test.js | tap -c -",
+    "posttest": "nyc report"
+  },
+  "keywords": [
+    "fs",
+    "module",
+    "reading",
+    "retry",
+    "retries",
+    "queue",
+    "error",
+    "errors",
+    "handling",
+    "EMFILE",
+    "EAGAIN",
+    "EINVAL",
+    "EPERM",
+    "EACCESS"
+  ],
+  "license": "ISC",
+  "devDependencies": {
+    "import-fresh": "^2.0.0",
+    "mkdirp": "^0.5.0",
+    "rimraf": "^2.2.8",
+    "tap": "^12.7.0"
+  },
+  "files": [
+    "fs.js",
+    "graceful-fs.js",
+    "legacy-streams.js",
+    "polyfills.js",
+    "clone.js"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/graceful-fs/polyfills.js b/node_modules/mathjs/examples/node_modules/graceful-fs/polyfills.js
new file mode 100644
index 0000000..26804ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/graceful-fs/polyfills.js
@@ -0,0 +1,348 @@
+var constants = require('constants')
+
+var origCwd = process.cwd
+var cwd = null
+
+var platform = process.env.GRACEFUL_FS_PLATFORM || process.platform
+
+process.cwd = function() {
+  if (!cwd)
+    cwd = origCwd.call(process)
+  return cwd
+}
+try {
+  process.cwd()
+} catch (er) {}
+
+// This check is needed until node.js 12 is required
+if (typeof process.chdir === 'function') {
+  var chdir = process.chdir
+  process.chdir = function (d) {
+    cwd = null
+    chdir.call(process, d)
+  }
+  if (Object.setPrototypeOf) Object.setPrototypeOf(process.chdir, chdir)
+}
+
+module.exports = patch
+
+function patch (fs) {
+  // (re-)implement some things that are known busted or missing.
+
+  // lchmod, broken prior to 0.6.2
+  // back-port the fix here.
+  if (constants.hasOwnProperty('O_SYMLINK') &&
+      process.version.match(/^v0\.6\.[0-2]|^v0\.5\./)) {
+    patchLchmod(fs)
+  }
+
+  // lutimes implementation, or no-op
+  if (!fs.lutimes) {
+    patchLutimes(fs)
+  }
+
+  // https://github.com/isaacs/node-graceful-fs/issues/4
+  // Chown should not fail on einval or eperm if non-root.
+  // It should not fail on enosys ever, as this just indicates
+  // that a fs doesn't support the intended operation.
+
+  fs.chown = chownFix(fs.chown)
+  fs.fchown = chownFix(fs.fchown)
+  fs.lchown = chownFix(fs.lchown)
+
+  fs.chmod = chmodFix(fs.chmod)
+  fs.fchmod = chmodFix(fs.fchmod)
+  fs.lchmod = chmodFix(fs.lchmod)
+
+  fs.chownSync = chownFixSync(fs.chownSync)
+  fs.fchownSync = chownFixSync(fs.fchownSync)
+  fs.lchownSync = chownFixSync(fs.lchownSync)
+
+  fs.chmodSync = chmodFixSync(fs.chmodSync)
+  fs.fchmodSync = chmodFixSync(fs.fchmodSync)
+  fs.lchmodSync = chmodFixSync(fs.lchmodSync)
+
+  fs.stat = statFix(fs.stat)
+  fs.fstat = statFix(fs.fstat)
+  fs.lstat = statFix(fs.lstat)
+
+  fs.statSync = statFixSync(fs.statSync)
+  fs.fstatSync = statFixSync(fs.fstatSync)
+  fs.lstatSync = statFixSync(fs.lstatSync)
+
+  // if lchmod/lchown do not exist, then make them no-ops
+  if (!fs.lchmod) {
+    fs.lchmod = function (path, mode, cb) {
+      if (cb) process.nextTick(cb)
+    }
+    fs.lchmodSync = function () {}
+  }
+  if (!fs.lchown) {
+    fs.lchown = function (path, uid, gid, cb) {
+      if (cb) process.nextTick(cb)
+    }
+    fs.lchownSync = function () {}
+  }
+
+  // on Windows, A/V software can lock the directory, causing this
+  // to fail with an EACCES or EPERM if the directory contains newly
+  // created files.  Try again on failure, for up to 60 seconds.
+
+  // Set the timeout this long because some Windows Anti-Virus, such as Parity
+  // bit9, may lock files for up to a minute, causing npm package install
+  // failures. Also, take care to yield the scheduler. Windows scheduling gives
+  // CPU to a busy looping process, which can cause the program causing the lock
+  // contention to be starved of CPU by node, so the contention doesn't resolve.
+  if (platform === "win32") {
+    fs.rename = (function (fs$rename) { return function (from, to, cb) {
+      var start = Date.now()
+      var backoff = 0;
+      fs$rename(from, to, function CB (er) {
+        if (er
+            && (er.code === "EACCES" || er.code === "EPERM")
+            && Date.now() - start < 60000) {
+          setTimeout(function() {
+            fs.stat(to, function (stater, st) {
+              if (stater && stater.code === "ENOENT")
+                fs$rename(from, to, CB);
+              else
+                cb(er)
+            })
+          }, backoff)
+          if (backoff < 100)
+            backoff += 10;
+          return;
+        }
+        if (cb) cb(er)
+      })
+    }})(fs.rename)
+  }
+
+  // if read() returns EAGAIN, then just try it again.
+  fs.read = (function (fs$read) {
+    function read (fd, buffer, offset, length, position, callback_) {
+      var callback
+      if (callback_ && typeof callback_ === 'function') {
+        var eagCounter = 0
+        callback = function (er, _, __) {
+          if (er && er.code === 'EAGAIN' && eagCounter < 10) {
+            eagCounter ++
+            return fs$read.call(fs, fd, buffer, offset, length, position, callback)
+          }
+          callback_.apply(this, arguments)
+        }
+      }
+      return fs$read.call(fs, fd, buffer, offset, length, position, callback)
+    }
+
+    // This ensures `util.promisify` works as it does for native `fs.read`.
+    if (Object.setPrototypeOf) Object.setPrototypeOf(read, fs$read)
+    return read
+  })(fs.read)
+
+  fs.readSync = (function (fs$readSync) { return function (fd, buffer, offset, length, position) {
+    var eagCounter = 0
+    while (true) {
+      try {
+        return fs$readSync.call(fs, fd, buffer, offset, length, position)
+      } catch (er) {
+        if (er.code === 'EAGAIN' && eagCounter < 10) {
+          eagCounter ++
+          continue
+        }
+        throw er
+      }
+    }
+  }})(fs.readSync)
+
+  function patchLchmod (fs) {
+    fs.lchmod = function (path, mode, callback) {
+      fs.open( path
+             , constants.O_WRONLY | constants.O_SYMLINK
+             , mode
+             , function (err, fd) {
+        if (err) {
+          if (callback) callback(err)
+          return
+        }
+        // prefer to return the chmod error, if one occurs,
+        // but still try to close, and report closing errors if they occur.
+        fs.fchmod(fd, mode, function (err) {
+          fs.close(fd, function(err2) {
+            if (callback) callback(err || err2)
+          })
+        })
+      })
+    }
+
+    fs.lchmodSync = function (path, mode) {
+      var fd = fs.openSync(path, constants.O_WRONLY | constants.O_SYMLINK, mode)
+
+      // prefer to return the chmod error, if one occurs,
+      // but still try to close, and report closing errors if they occur.
+      var threw = true
+      var ret
+      try {
+        ret = fs.fchmodSync(fd, mode)
+        threw = false
+      } finally {
+        if (threw) {
+          try {
+            fs.closeSync(fd)
+          } catch (er) {}
+        } else {
+          fs.closeSync(fd)
+        }
+      }
+      return ret
+    }
+  }
+
+  function patchLutimes (fs) {
+    if (constants.hasOwnProperty("O_SYMLINK")) {
+      fs.lutimes = function (path, at, mt, cb) {
+        fs.open(path, constants.O_SYMLINK, function (er, fd) {
+          if (er) {
+            if (cb) cb(er)
+            return
+          }
+          fs.futimes(fd, at, mt, function (er) {
+            fs.close(fd, function (er2) {
+              if (cb) cb(er || er2)
+            })
+          })
+        })
+      }
+
+      fs.lutimesSync = function (path, at, mt) {
+        var fd = fs.openSync(path, constants.O_SYMLINK)
+        var ret
+        var threw = true
+        try {
+          ret = fs.futimesSync(fd, at, mt)
+          threw = false
+        } finally {
+          if (threw) {
+            try {
+              fs.closeSync(fd)
+            } catch (er) {}
+          } else {
+            fs.closeSync(fd)
+          }
+        }
+        return ret
+      }
+
+    } else {
+      fs.lutimes = function (_a, _b, _c, cb) { if (cb) process.nextTick(cb) }
+      fs.lutimesSync = function () {}
+    }
+  }
+
+  function chmodFix (orig) {
+    if (!orig) return orig
+    return function (target, mode, cb) {
+      return orig.call(fs, target, mode, function (er) {
+        if (chownErOk(er)) er = null
+        if (cb) cb.apply(this, arguments)
+      })
+    }
+  }
+
+  function chmodFixSync (orig) {
+    if (!orig) return orig
+    return function (target, mode) {
+      try {
+        return orig.call(fs, target, mode)
+      } catch (er) {
+        if (!chownErOk(er)) throw er
+      }
+    }
+  }
+
+
+  function chownFix (orig) {
+    if (!orig) return orig
+    return function (target, uid, gid, cb) {
+      return orig.call(fs, target, uid, gid, function (er) {
+        if (chownErOk(er)) er = null
+        if (cb) cb.apply(this, arguments)
+      })
+    }
+  }
+
+  function chownFixSync (orig) {
+    if (!orig) return orig
+    return function (target, uid, gid) {
+      try {
+        return orig.call(fs, target, uid, gid)
+      } catch (er) {
+        if (!chownErOk(er)) throw er
+      }
+    }
+  }
+
+  function statFix (orig) {
+    if (!orig) return orig
+    // Older versions of Node erroneously returned signed integers for
+    // uid + gid.
+    return function (target, options, cb) {
+      if (typeof options === 'function') {
+        cb = options
+        options = null
+      }
+      function callback (er, stats) {
+        if (stats) {
+          if (stats.uid < 0) stats.uid += 0x100000000
+          if (stats.gid < 0) stats.gid += 0x100000000
+        }
+        if (cb) cb.apply(this, arguments)
+      }
+      return options ? orig.call(fs, target, options, callback)
+        : orig.call(fs, target, callback)
+    }
+  }
+
+  function statFixSync (orig) {
+    if (!orig) return orig
+    // Older versions of Node erroneously returned signed integers for
+    // uid + gid.
+    return function (target, options) {
+      var stats = options ? orig.call(fs, target, options)
+        : orig.call(fs, target)
+      if (stats) {
+        if (stats.uid < 0) stats.uid += 0x100000000
+        if (stats.gid < 0) stats.gid += 0x100000000
+      }
+      return stats;
+    }
+  }
+
+  // ENOSYS means that the fs doesn't support the op. Just ignore
+  // that, because it doesn't matter.
+  //
+  // if there's no getuid, or if getuid() is something other
+  // than 0, and the error is EINVAL or EPERM, then just ignore
+  // it.
+  //
+  // This specific case is a silent failure in cp, install, tar,
+  // and most other unix tools that manage permissions.
+  //
+  // When running as root, or if other types of errors are
+  // encountered, then it's strict.
+  function chownErOk (er) {
+    if (!er)
+      return true
+
+    if (er.code === "ENOSYS")
+      return true
+
+    var nonroot = !process.getuid || process.getuid() !== 0
+    if (nonroot) {
+      if (er.code === "EINVAL" || er.code === "EPERM")
+        return true
+    }
+
+    return false
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/has-flag/index.d.ts b/node_modules/mathjs/examples/node_modules/has-flag/index.d.ts
new file mode 100644
index 0000000..a0a48c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has-flag/index.d.ts
@@ -0,0 +1,39 @@
+/**
+Check if [`argv`](https://nodejs.org/docs/latest/api/process.html#process_process_argv) has a specific flag.
+
+@param flag - CLI flag to look for. The `--` prefix is optional.
+@param argv - CLI arguments. Default: `process.argv`.
+@returns Whether the flag exists.
+
+@example
+```
+// $ ts-node foo.ts -f --unicorn --foo=bar -- --rainbow
+
+// foo.ts
+import hasFlag = require('has-flag');
+
+hasFlag('unicorn');
+//=> true
+
+hasFlag('--unicorn');
+//=> true
+
+hasFlag('f');
+//=> true
+
+hasFlag('-f');
+//=> true
+
+hasFlag('foo=bar');
+//=> true
+
+hasFlag('foo');
+//=> false
+
+hasFlag('rainbow');
+//=> false
+```
+*/
+declare function hasFlag(flag: string, argv?: string[]): boolean;
+
+export = hasFlag;
diff --git a/node_modules/mathjs/examples/node_modules/has-flag/index.js b/node_modules/mathjs/examples/node_modules/has-flag/index.js
new file mode 100644
index 0000000..b6f80b1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has-flag/index.js
@@ -0,0 +1,8 @@
+'use strict';
+
+module.exports = (flag, argv = process.argv) => {
+	const prefix = flag.startsWith('-') ? '' : (flag.length === 1 ? '-' : '--');
+	const position = argv.indexOf(prefix + flag);
+	const terminatorPosition = argv.indexOf('--');
+	return position !== -1 && (terminatorPosition === -1 || position < terminatorPosition);
+};
diff --git a/node_modules/mathjs/examples/node_modules/has-flag/license b/node_modules/mathjs/examples/node_modules/has-flag/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has-flag/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/has-flag/package.json b/node_modules/mathjs/examples/node_modules/has-flag/package.json
new file mode 100644
index 0000000..a9cba4b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has-flag/package.json
@@ -0,0 +1,46 @@
+{
+	"name": "has-flag",
+	"version": "4.0.0",
+	"description": "Check if argv has a specific flag",
+	"license": "MIT",
+	"repository": "sindresorhus/has-flag",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"has",
+		"check",
+		"detect",
+		"contains",
+		"find",
+		"flag",
+		"cli",
+		"command-line",
+		"argv",
+		"process",
+		"arg",
+		"args",
+		"argument",
+		"arguments",
+		"getopt",
+		"minimist",
+		"optimist"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/has-flag/readme.md b/node_modules/mathjs/examples/node_modules/has-flag/readme.md
new file mode 100644
index 0000000..3f72dff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has-flag/readme.md
@@ -0,0 +1,89 @@
+# has-flag [![Build Status](https://travis-ci.org/sindresorhus/has-flag.svg?branch=master)](https://travis-ci.org/sindresorhus/has-flag)
+
+> Check if [`argv`](https://nodejs.org/docs/latest/api/process.html#process_process_argv) has a specific flag
+
+Correctly stops looking after an `--` argument terminator.
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-has-flag?utm_source=npm-has-flag&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
+
+---
+
+
+## Install
+
+```
+$ npm install has-flag
+```
+
+
+## Usage
+
+```js
+// foo.js
+const hasFlag = require('has-flag');
+
+hasFlag('unicorn');
+//=> true
+
+hasFlag('--unicorn');
+//=> true
+
+hasFlag('f');
+//=> true
+
+hasFlag('-f');
+//=> true
+
+hasFlag('foo=bar');
+//=> true
+
+hasFlag('foo');
+//=> false
+
+hasFlag('rainbow');
+//=> false
+```
+
+```
+$ node foo.js -f --unicorn --foo=bar -- --rainbow
+```
+
+
+## API
+
+### hasFlag(flag, [argv])
+
+Returns a boolean for whether the flag exists.
+
+#### flag
+
+Type: `string`
+
+CLI flag to look for. The `--` prefix is optional.
+
+#### argv
+
+Type: `string[]`<br>
+Default: `process.argv`
+
+CLI arguments.
+
+
+## Security
+
+To report a security vulnerability, please use the [Tidelift security contact](https://tidelift.com/security). Tidelift will coordinate the fix and disclosure.
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/has/LICENSE-MIT b/node_modules/mathjs/examples/node_modules/has/LICENSE-MIT
new file mode 100644
index 0000000..ae7014d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has/LICENSE-MIT
@@ -0,0 +1,22 @@
+Copyright (c) 2013 Thiago de Arruda
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/has/README.md b/node_modules/mathjs/examples/node_modules/has/README.md
new file mode 100644
index 0000000..635e3a4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has/README.md
@@ -0,0 +1,18 @@
+# has
+
+> Object.prototype.hasOwnProperty.call shortcut
+
+## Installation
+
+```sh
+npm install --save has
+```
+
+## Usage
+
+```js
+var has = require('has');
+
+has({}, 'hasOwnProperty'); // false
+has(Object.prototype, 'hasOwnProperty'); // true
+```
diff --git a/node_modules/mathjs/examples/node_modules/has/package.json b/node_modules/mathjs/examples/node_modules/has/package.json
new file mode 100644
index 0000000..7c4592f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has/package.json
@@ -0,0 +1,48 @@
+{
+  "name": "has",
+  "description": "Object.prototype.hasOwnProperty.call shortcut",
+  "version": "1.0.3",
+  "homepage": "https://github.com/tarruda/has",
+  "author": {
+    "name": "Thiago de Arruda",
+    "email": "tpadilha84@gmail.com"
+  },
+ "contributors": [
+    {
+      "name": "Jordan Harband",
+      "email": "ljharb@gmail.com",
+      "url": "http://ljharb.codes"
+    }
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/tarruda/has.git"
+  },
+  "bugs": {
+    "url": "https://github.com/tarruda/has/issues"
+  },
+  "license": "MIT",
+  "licenses": [
+    {
+      "type": "MIT",
+      "url": "https://github.com/tarruda/has/blob/master/LICENSE-MIT"
+    }
+  ],
+  "main": "./src",
+  "dependencies": {
+    "function-bind": "^1.1.1"
+  },
+  "devDependencies": {
+    "@ljharb/eslint-config": "^12.2.1",
+    "eslint": "^4.19.1",
+    "tape": "^4.9.0"
+  },
+  "engines": {
+    "node": ">= 0.4.0"
+  },
+  "scripts": {
+    "lint": "eslint .",
+    "pretest": "npm run lint",
+    "test": "tape test"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/has/src/index.js b/node_modules/mathjs/examples/node_modules/has/src/index.js
new file mode 100644
index 0000000..dd92dd9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has/src/index.js
@@ -0,0 +1,5 @@
+'use strict';
+
+var bind = require('function-bind');
+
+module.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);
diff --git a/node_modules/mathjs/examples/node_modules/has/test/index.js b/node_modules/mathjs/examples/node_modules/has/test/index.js
new file mode 100644
index 0000000..43d480b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/has/test/index.js
@@ -0,0 +1,10 @@
+'use strict';
+
+var test = require('tape');
+var has = require('../');
+
+test('has', function (t) {
+  t.equal(has({}, 'hasOwnProperty'), false, 'object literal does not have own property "hasOwnProperty"');
+  t.equal(has(Object.prototype, 'hasOwnProperty'), true, 'Object.prototype has own property "hasOwnProperty"');
+  t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/human-signals/CHANGELOG.md
new file mode 100644
index 0000000..70d0392
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/CHANGELOG.md
@@ -0,0 +1,11 @@
+# 2.1.0
+
+## TypeScript types
+
+- Add [TypeScript definitions](src/main.d.ts)
+
+# 2.0.0
+
+## Breaking changes
+
+- Minimal supported Node.js version is now `10.17.0`
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/LICENSE b/node_modules/mathjs/examples/node_modules/human-signals/LICENSE
new file mode 100644
index 0000000..9af9492
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/LICENSE
@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2019 ehmicky <ehmicky@gmail.com>
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/README.md b/node_modules/mathjs/examples/node_modules/human-signals/README.md
new file mode 100644
index 0000000..2af37c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/README.md
@@ -0,0 +1,165 @@
+[![Codecov](https://img.shields.io/codecov/c/github/ehmicky/human-signals.svg?label=tested&logo=codecov)](https://codecov.io/gh/ehmicky/human-signals)
+[![Travis](https://img.shields.io/badge/cross-platform-4cc61e.svg?logo=travis)](https://travis-ci.org/ehmicky/human-signals)
+[![Node](https://img.shields.io/node/v/human-signals.svg?logo=node.js)](https://www.npmjs.com/package/human-signals)
+[![Gitter](https://img.shields.io/gitter/room/ehmicky/human-signals.svg?logo=gitter)](https://gitter.im/ehmicky/human-signals)
+[![Twitter](https://img.shields.io/badge/%E2%80%8B-twitter-4cc61e.svg?logo=twitter)](https://twitter.com/intent/follow?screen_name=ehmicky)
+[![Medium](https://img.shields.io/badge/%E2%80%8B-medium-4cc61e.svg?logo=medium)](https://medium.com/@ehmicky)
+
+Human-friendly process signals.
+
+This is a map of known process signals with some information about each signal.
+
+Unlike
+[`os.constants.signals`](https://nodejs.org/api/os.html#os_signal_constants)
+this includes:
+
+- human-friendly [descriptions](#description)
+- [default actions](#action), including whether they [can be prevented](#forced)
+- whether the signal is [supported](#supported) by the current OS
+
+# Example
+
+```js
+const { signalsByName, signalsByNumber } = require('human-signals')
+
+console.log(signalsByName.SIGINT)
+// {
+//   name: 'SIGINT',
+//   number: 2,
+//   description: 'User interruption with CTRL-C',
+//   supported: true,
+//   action: 'terminate',
+//   forced: false,
+//   standard: 'ansi'
+// }
+
+console.log(signalsByNumber[8])
+// {
+//   name: 'SIGFPE',
+//   number: 8,
+//   description: 'Floating point arithmetic error',
+//   supported: true,
+//   action: 'core',
+//   forced: false,
+//   standard: 'ansi'
+// }
+```
+
+# Install
+
+```bash
+npm install human-signals
+```
+
+# Usage
+
+## signalsByName
+
+_Type_: `object`
+
+Object whose keys are signal [names](#name) and values are
+[signal objects](#signal).
+
+## signalsByNumber
+
+_Type_: `object`
+
+Object whose keys are signal [numbers](#number) and values are
+[signal objects](#signal).
+
+## signal
+
+_Type_: `object`
+
+Signal object with the following properties.
+
+### name
+
+_Type_: `string`
+
+Standard name of the signal, for example `'SIGINT'`.
+
+### number
+
+_Type_: `number`
+
+Code number of the signal, for example `2`. While most `number` are
+cross-platform, some are different between different OS.
+
+### description
+
+_Type_: `string`
+
+Human-friendly description for the signal, for example
+`'User interruption with CTRL-C'`.
+
+### supported
+
+_Type_: `boolean`
+
+Whether the current OS can handle this signal in Node.js using
+[`process.on(name, handler)`](https://nodejs.org/api/process.html#process_signal_events).
+
+The list of supported signals
+[is OS-specific](https://github.com/ehmicky/cross-platform-node-guide/blob/master/docs/6_networking_ipc/signals.md#cross-platform-signals).
+
+### action
+
+_Type_: `string`\
+_Enum_: `'terminate'`, `'core'`, `'ignore'`, `'pause'`, `'unpause'`
+
+What is the default action for this signal when it is not handled.
+
+### forced
+
+_Type_: `boolean`
+
+Whether the signal's default action cannot be prevented. This is `true` for
+`SIGTERM`, `SIGKILL` and `SIGSTOP`.
+
+### standard
+
+_Type_: `string`\
+_Enum_: `'ansi'`, `'posix'`, `'bsd'`, `'systemv'`, `'other'`
+
+Which standard defined that signal.
+
+# Support
+
+If you found a bug or would like a new feature, _don't hesitate_ to
+[submit an issue on GitHub](../../issues).
+
+For other questions, feel free to
+[chat with us on Gitter](https://gitter.im/ehmicky/human-signals).
+
+Everyone is welcome regardless of personal background. We enforce a
+[Code of conduct](CODE_OF_CONDUCT.md) in order to promote a positive and
+inclusive environment.
+
+# Contributing
+
+This project was made with ❤️. The simplest way to give back is by starring and
+sharing it online.
+
+If the documentation is unclear or has a typo, please click on the page's `Edit`
+button (pencil icon) and suggest a correction.
+
+If you would like to help us fix a bug or add a new feature, please check our
+[guidelines](CONTRIBUTING.md). Pull requests are welcome!
+
+Thanks go to our wonderful contributors:
+
+<!-- ALL-CONTRIBUTORS-LIST:START -->
+<!-- prettier-ignore-start -->
+<!-- markdownlint-disable -->
+<table>
+  <tr>
+    <td align="center"><a href="https://twitter.com/ehmicky"><img src="https://avatars2.githubusercontent.com/u/8136211?v=4" width="100px;" alt=""/><br /><sub><b>ehmicky</b></sub></a><br /><a href="https://github.com/ehmicky/human-signals/commits?author=ehmicky" title="Code">💻</a> <a href="#design-ehmicky" title="Design">🎨</a> <a href="#ideas-ehmicky" title="Ideas, Planning, & Feedback">🤔</a> <a href="https://github.com/ehmicky/human-signals/commits?author=ehmicky" title="Documentation">📖</a></td>
+    <td align="center"><a href="http://www.electrovir.com"><img src="https://avatars0.githubusercontent.com/u/1205860?v=4" width="100px;" alt=""/><br /><sub><b>electrovir</b></sub></a><br /><a href="https://github.com/ehmicky/human-signals/commits?author=electrovir" title="Code">💻</a></td>
+  </tr>
+</table>
+
+<!-- markdownlint-enable -->
+<!-- prettier-ignore-end -->
+
+<!-- ALL-CONTRIBUTORS-LIST:END -->
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/core.js b/node_modules/mathjs/examples/node_modules/human-signals/build/src/core.js
new file mode 100644
index 0000000..98e8fce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/core.js
@@ -0,0 +1,273 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.SIGNALS=void 0;
+
+const SIGNALS=[
+{
+name:"SIGHUP",
+number:1,
+action:"terminate",
+description:"Terminal closed",
+standard:"posix"},
+
+{
+name:"SIGINT",
+number:2,
+action:"terminate",
+description:"User interruption with CTRL-C",
+standard:"ansi"},
+
+{
+name:"SIGQUIT",
+number:3,
+action:"core",
+description:"User interruption with CTRL-\\",
+standard:"posix"},
+
+{
+name:"SIGILL",
+number:4,
+action:"core",
+description:"Invalid machine instruction",
+standard:"ansi"},
+
+{
+name:"SIGTRAP",
+number:5,
+action:"core",
+description:"Debugger breakpoint",
+standard:"posix"},
+
+{
+name:"SIGABRT",
+number:6,
+action:"core",
+description:"Aborted",
+standard:"ansi"},
+
+{
+name:"SIGIOT",
+number:6,
+action:"core",
+description:"Aborted",
+standard:"bsd"},
+
+{
+name:"SIGBUS",
+number:7,
+action:"core",
+description:
+"Bus error due to misaligned, non-existing address or paging error",
+standard:"bsd"},
+
+{
+name:"SIGEMT",
+number:7,
+action:"terminate",
+description:"Command should be emulated but is not implemented",
+standard:"other"},
+
+{
+name:"SIGFPE",
+number:8,
+action:"core",
+description:"Floating point arithmetic error",
+standard:"ansi"},
+
+{
+name:"SIGKILL",
+number:9,
+action:"terminate",
+description:"Forced termination",
+standard:"posix",
+forced:true},
+
+{
+name:"SIGUSR1",
+number:10,
+action:"terminate",
+description:"Application-specific signal",
+standard:"posix"},
+
+{
+name:"SIGSEGV",
+number:11,
+action:"core",
+description:"Segmentation fault",
+standard:"ansi"},
+
+{
+name:"SIGUSR2",
+number:12,
+action:"terminate",
+description:"Application-specific signal",
+standard:"posix"},
+
+{
+name:"SIGPIPE",
+number:13,
+action:"terminate",
+description:"Broken pipe or socket",
+standard:"posix"},
+
+{
+name:"SIGALRM",
+number:14,
+action:"terminate",
+description:"Timeout or timer",
+standard:"posix"},
+
+{
+name:"SIGTERM",
+number:15,
+action:"terminate",
+description:"Termination",
+standard:"ansi"},
+
+{
+name:"SIGSTKFLT",
+number:16,
+action:"terminate",
+description:"Stack is empty or overflowed",
+standard:"other"},
+
+{
+name:"SIGCHLD",
+number:17,
+action:"ignore",
+description:"Child process terminated, paused or unpaused",
+standard:"posix"},
+
+{
+name:"SIGCLD",
+number:17,
+action:"ignore",
+description:"Child process terminated, paused or unpaused",
+standard:"other"},
+
+{
+name:"SIGCONT",
+number:18,
+action:"unpause",
+description:"Unpaused",
+standard:"posix",
+forced:true},
+
+{
+name:"SIGSTOP",
+number:19,
+action:"pause",
+description:"Paused",
+standard:"posix",
+forced:true},
+
+{
+name:"SIGTSTP",
+number:20,
+action:"pause",
+description:"Paused using CTRL-Z or \"suspend\"",
+standard:"posix"},
+
+{
+name:"SIGTTIN",
+number:21,
+action:"pause",
+description:"Background process cannot read terminal input",
+standard:"posix"},
+
+{
+name:"SIGBREAK",
+number:21,
+action:"terminate",
+description:"User interruption with CTRL-BREAK",
+standard:"other"},
+
+{
+name:"SIGTTOU",
+number:22,
+action:"pause",
+description:"Background process cannot write to terminal output",
+standard:"posix"},
+
+{
+name:"SIGURG",
+number:23,
+action:"ignore",
+description:"Socket received out-of-band data",
+standard:"bsd"},
+
+{
+name:"SIGXCPU",
+number:24,
+action:"core",
+description:"Process timed out",
+standard:"bsd"},
+
+{
+name:"SIGXFSZ",
+number:25,
+action:"core",
+description:"File too big",
+standard:"bsd"},
+
+{
+name:"SIGVTALRM",
+number:26,
+action:"terminate",
+description:"Timeout or timer",
+standard:"bsd"},
+
+{
+name:"SIGPROF",
+number:27,
+action:"terminate",
+description:"Timeout or timer",
+standard:"bsd"},
+
+{
+name:"SIGWINCH",
+number:28,
+action:"ignore",
+description:"Terminal window size changed",
+standard:"bsd"},
+
+{
+name:"SIGIO",
+number:29,
+action:"terminate",
+description:"I/O is available",
+standard:"other"},
+
+{
+name:"SIGPOLL",
+number:29,
+action:"terminate",
+description:"Watched event",
+standard:"other"},
+
+{
+name:"SIGINFO",
+number:29,
+action:"ignore",
+description:"Request for process information",
+standard:"other"},
+
+{
+name:"SIGPWR",
+number:30,
+action:"terminate",
+description:"Device running out of power",
+standard:"systemv"},
+
+{
+name:"SIGSYS",
+number:31,
+action:"core",
+description:"Invalid system call",
+standard:"other"},
+
+{
+name:"SIGUNUSED",
+number:31,
+action:"terminate",
+description:"Invalid system call",
+standard:"other"}];exports.SIGNALS=SIGNALS;
+//# sourceMappingURL=core.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/core.js.map b/node_modules/mathjs/examples/node_modules/human-signals/build/src/core.js.map
new file mode 100644
index 0000000..cbfce26
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/core.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/core.js"],"names":["SIGNALS","name","number","action","description","standard","forced"],"mappings":";;AAEO,KAAMA,CAAAA,OAAO,CAAG;AACrB;AACEC,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,iBAJf;AAKEC,QAAQ,CAAE,OALZ,CADqB;;AAQrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,+BAJf;AAKEC,QAAQ,CAAE,MALZ,CARqB;;AAerB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,gCAJf;AAKEC,QAAQ,CAAE,OALZ,CAfqB;;AAsBrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,6BAJf;AAKEC,QAAQ,CAAE,MALZ,CAtBqB;;AA6BrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,qBAJf;AAKEC,QAAQ,CAAE,OALZ,CA7BqB;;AAoCrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,SAJf;AAKEC,QAAQ,CAAE,MALZ,CApCqB;;AA2CrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,SAJf;AAKEC,QAAQ,CAAE,KALZ,CA3CqB;;AAkDrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW;AACT,mEALJ;AAMEC,QAAQ,CAAE,KANZ,CAlDqB;;AA0DrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,mDAJf;AAKEC,QAAQ,CAAE,OALZ,CA1DqB;;AAiErB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,iCAJf;AAKEC,QAAQ,CAAE,MALZ,CAjEqB;;AAwErB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,CAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,oBAJf;AAKEC,QAAQ,CAAE,OALZ;AAMEC,MAAM,CAAE,IANV,CAxEqB;;AAgFrB;AACEL,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,6BAJf;AAKEC,QAAQ,CAAE,OALZ,CAhFqB;;AAuFrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,oBAJf;AAKEC,QAAQ,CAAE,MALZ,CAvFqB;;AA8FrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,6BAJf;AAKEC,QAAQ,CAAE,OALZ,CA9FqB;;AAqGrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,uBAJf;AAKEC,QAAQ,CAAE,OALZ,CArGqB;;AA4GrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,kBAJf;AAKEC,QAAQ,CAAE,OALZ,CA5GqB;;AAmHrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,aAJf;AAKEC,QAAQ,CAAE,MALZ,CAnHqB;;AA0HrB;AACEJ,IAAI,CAAE,WADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,8BAJf;AAKEC,QAAQ,CAAE,OALZ,CA1HqB;;AAiIrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,QAHV;AAIEC,WAAW,CAAE,8CAJf;AAKEC,QAAQ,CAAE,OALZ,CAjIqB;;AAwIrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,QAHV;AAIEC,WAAW,CAAE,8CAJf;AAKEC,QAAQ,CAAE,OALZ,CAxIqB;;AA+IrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,SAHV;AAIEC,WAAW,CAAE,UAJf;AAKEC,QAAQ,CAAE,OALZ;AAMEC,MAAM,CAAE,IANV,CA/IqB;;AAuJrB;AACEL,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,OAHV;AAIEC,WAAW,CAAE,QAJf;AAKEC,QAAQ,CAAE,OALZ;AAMEC,MAAM,CAAE,IANV,CAvJqB;;AA+JrB;AACEL,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,OAHV;AAIEC,WAAW,CAAE,oCAJf;AAKEC,QAAQ,CAAE,OALZ,CA/JqB;;AAsKrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,OAHV;AAIEC,WAAW,CAAE,+CAJf;AAKEC,QAAQ,CAAE,OALZ,CAtKqB;;AA6KrB;AACEJ,IAAI,CAAE,UADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,mCAJf;AAKEC,QAAQ,CAAE,OALZ,CA7KqB;;AAoLrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,OAHV;AAIEC,WAAW,CAAE,oDAJf;AAKEC,QAAQ,CAAE,OALZ,CApLqB;;AA2LrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,QAHV;AAIEC,WAAW,CAAE,kCAJf;AAKEC,QAAQ,CAAE,KALZ,CA3LqB;;AAkMrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,mBAJf;AAKEC,QAAQ,CAAE,KALZ,CAlMqB;;AAyMrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,cAJf;AAKEC,QAAQ,CAAE,KALZ,CAzMqB;;AAgNrB;AACEJ,IAAI,CAAE,WADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,kBAJf;AAKEC,QAAQ,CAAE,KALZ,CAhNqB;;AAuNrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,kBAJf;AAKEC,QAAQ,CAAE,KALZ,CAvNqB;;AA8NrB;AACEJ,IAAI,CAAE,UADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,QAHV;AAIEC,WAAW,CAAE,8BAJf;AAKEC,QAAQ,CAAE,KALZ,CA9NqB;;AAqOrB;AACEJ,IAAI,CAAE,OADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,kBAJf;AAKEC,QAAQ,CAAE,OALZ,CArOqB;;AA4OrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,eAJf;AAKEC,QAAQ,CAAE,OALZ,CA5OqB;;AAmPrB;AACEJ,IAAI,CAAE,SADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,QAHV;AAIEC,WAAW,CAAE,iCAJf;AAKEC,QAAQ,CAAE,OALZ,CAnPqB;;AA0PrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,6BAJf;AAKEC,QAAQ,CAAE,SALZ,CA1PqB;;AAiQrB;AACEJ,IAAI,CAAE,QADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,MAHV;AAIEC,WAAW,CAAE,qBAJf;AAKEC,QAAQ,CAAE,OALZ,CAjQqB;;AAwQrB;AACEJ,IAAI,CAAE,WADR;AAEEC,MAAM,CAAE,EAFV;AAGEC,MAAM,CAAE,WAHV;AAIEC,WAAW,CAAE,qBAJf;AAKEC,QAAQ,CAAE,OALZ,CAxQqB,CAAhB,C","sourcesContent":["/* eslint-disable max-lines */\n// List of known process signals with information about them\nexport const SIGNALS = [\n  {\n    name: 'SIGHUP',\n    number: 1,\n    action: 'terminate',\n    description: 'Terminal closed',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGINT',\n    number: 2,\n    action: 'terminate',\n    description: 'User interruption with CTRL-C',\n    standard: 'ansi',\n  },\n  {\n    name: 'SIGQUIT',\n    number: 3,\n    action: 'core',\n    description: 'User interruption with CTRL-\\\\',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGILL',\n    number: 4,\n    action: 'core',\n    description: 'Invalid machine instruction',\n    standard: 'ansi',\n  },\n  {\n    name: 'SIGTRAP',\n    number: 5,\n    action: 'core',\n    description: 'Debugger breakpoint',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGABRT',\n    number: 6,\n    action: 'core',\n    description: 'Aborted',\n    standard: 'ansi',\n  },\n  {\n    name: 'SIGIOT',\n    number: 6,\n    action: 'core',\n    description: 'Aborted',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGBUS',\n    number: 7,\n    action: 'core',\n    description:\n      'Bus error due to misaligned, non-existing address or paging error',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGEMT',\n    number: 7,\n    action: 'terminate',\n    description: 'Command should be emulated but is not implemented',\n    standard: 'other',\n  },\n  {\n    name: 'SIGFPE',\n    number: 8,\n    action: 'core',\n    description: 'Floating point arithmetic error',\n    standard: 'ansi',\n  },\n  {\n    name: 'SIGKILL',\n    number: 9,\n    action: 'terminate',\n    description: 'Forced termination',\n    standard: 'posix',\n    forced: true,\n  },\n  {\n    name: 'SIGUSR1',\n    number: 10,\n    action: 'terminate',\n    description: 'Application-specific signal',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGSEGV',\n    number: 11,\n    action: 'core',\n    description: 'Segmentation fault',\n    standard: 'ansi',\n  },\n  {\n    name: 'SIGUSR2',\n    number: 12,\n    action: 'terminate',\n    description: 'Application-specific signal',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGPIPE',\n    number: 13,\n    action: 'terminate',\n    description: 'Broken pipe or socket',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGALRM',\n    number: 14,\n    action: 'terminate',\n    description: 'Timeout or timer',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGTERM',\n    number: 15,\n    action: 'terminate',\n    description: 'Termination',\n    standard: 'ansi',\n  },\n  {\n    name: 'SIGSTKFLT',\n    number: 16,\n    action: 'terminate',\n    description: 'Stack is empty or overflowed',\n    standard: 'other',\n  },\n  {\n    name: 'SIGCHLD',\n    number: 17,\n    action: 'ignore',\n    description: 'Child process terminated, paused or unpaused',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGCLD',\n    number: 17,\n    action: 'ignore',\n    description: 'Child process terminated, paused or unpaused',\n    standard: 'other',\n  },\n  {\n    name: 'SIGCONT',\n    number: 18,\n    action: 'unpause',\n    description: 'Unpaused',\n    standard: 'posix',\n    forced: true,\n  },\n  {\n    name: 'SIGSTOP',\n    number: 19,\n    action: 'pause',\n    description: 'Paused',\n    standard: 'posix',\n    forced: true,\n  },\n  {\n    name: 'SIGTSTP',\n    number: 20,\n    action: 'pause',\n    description: 'Paused using CTRL-Z or \"suspend\"',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGTTIN',\n    number: 21,\n    action: 'pause',\n    description: 'Background process cannot read terminal input',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGBREAK',\n    number: 21,\n    action: 'terminate',\n    description: 'User interruption with CTRL-BREAK',\n    standard: 'other',\n  },\n  {\n    name: 'SIGTTOU',\n    number: 22,\n    action: 'pause',\n    description: 'Background process cannot write to terminal output',\n    standard: 'posix',\n  },\n  {\n    name: 'SIGURG',\n    number: 23,\n    action: 'ignore',\n    description: 'Socket received out-of-band data',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGXCPU',\n    number: 24,\n    action: 'core',\n    description: 'Process timed out',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGXFSZ',\n    number: 25,\n    action: 'core',\n    description: 'File too big',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGVTALRM',\n    number: 26,\n    action: 'terminate',\n    description: 'Timeout or timer',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGPROF',\n    number: 27,\n    action: 'terminate',\n    description: 'Timeout or timer',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGWINCH',\n    number: 28,\n    action: 'ignore',\n    description: 'Terminal window size changed',\n    standard: 'bsd',\n  },\n  {\n    name: 'SIGIO',\n    number: 29,\n    action: 'terminate',\n    description: 'I/O is available',\n    standard: 'other',\n  },\n  {\n    name: 'SIGPOLL',\n    number: 29,\n    action: 'terminate',\n    description: 'Watched event',\n    standard: 'other',\n  },\n  {\n    name: 'SIGINFO',\n    number: 29,\n    action: 'ignore',\n    description: 'Request for process information',\n    standard: 'other',\n  },\n  {\n    name: 'SIGPWR',\n    number: 30,\n    action: 'terminate',\n    description: 'Device running out of power',\n    standard: 'systemv',\n  },\n  {\n    name: 'SIGSYS',\n    number: 31,\n    action: 'core',\n    description: 'Invalid system call',\n    standard: 'other',\n  },\n  {\n    name: 'SIGUNUSED',\n    number: 31,\n    action: 'terminate',\n    description: 'Invalid system call',\n    standard: 'other',\n  },\n]\n/* eslint-enable max-lines */\n"],"file":"src/core.js"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.d.ts b/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.d.ts
new file mode 100644
index 0000000..2dc5ea7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.d.ts
@@ -0,0 +1,52 @@
+/**
+ * Object whose keys are signal names and values are signal objects.
+ */
+export declare const signalsByName: { [signalName: string]: Signal }
+/**
+ * Object whose keys are signal numbers and values are signal objects.
+ */
+export declare const signalsByNumber: { [signalNumber: string]: Signal }
+
+export declare type SignalAction =
+  | 'terminate'
+  | 'core'
+  | 'ignore'
+  | 'pause'
+  | 'unpause'
+export declare type SignalStandard =
+  | 'ansi'
+  | 'posix'
+  | 'bsd'
+  | 'systemv'
+  | 'other'
+
+export declare type Signal = {
+  /**
+   * Standard name of the signal, for example 'SIGINT'.
+   */
+  name: string
+  /**
+   * Code number of the signal, for example 2. While most number are cross-platform, some are different between different OS.
+   */
+  number: number
+  /**
+   * Human-friendly description for the signal, for example 'User interruption with CTRL-C'.
+   */
+  description: string
+  /**
+   * Whether the current OS can handle this signal in Node.js using process.on(name, handler). The list of supported signals is OS-specific.
+   */
+  supported: boolean
+  /**
+   * What is the default action for this signal when it is not handled.
+   */
+  action: SignalAction
+  /**
+   * Whether the signal's default action cannot be prevented. This is true for SIGTERM, SIGKILL and SIGSTOP.
+   */
+  forced: boolean
+  /**
+   * Which standard defined that signal.
+   */
+  standard: SignalStandard
+}
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.js b/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.js
new file mode 100644
index 0000000..88f5fd2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.js
@@ -0,0 +1,71 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.signalsByNumber=exports.signalsByName=void 0;var _os=require("os");
+
+var _signals=require("./signals.js");
+var _realtime=require("./realtime.js");
+
+
+
+const getSignalsByName=function(){
+const signals=(0,_signals.getSignals)();
+return signals.reduce(getSignalByName,{});
+};
+
+const getSignalByName=function(
+signalByNameMemo,
+{name,number,description,supported,action,forced,standard})
+{
+return{
+...signalByNameMemo,
+[name]:{name,number,description,supported,action,forced,standard}};
+
+};
+
+const signalsByName=getSignalsByName();exports.signalsByName=signalsByName;
+
+
+
+
+const getSignalsByNumber=function(){
+const signals=(0,_signals.getSignals)();
+const length=_realtime.SIGRTMAX+1;
+const signalsA=Array.from({length},(value,number)=>
+getSignalByNumber(number,signals));
+
+return Object.assign({},...signalsA);
+};
+
+const getSignalByNumber=function(number,signals){
+const signal=findSignalByNumber(number,signals);
+
+if(signal===undefined){
+return{};
+}
+
+const{name,description,supported,action,forced,standard}=signal;
+return{
+[number]:{
+name,
+number,
+description,
+supported,
+action,
+forced,
+standard}};
+
+
+};
+
+
+
+const findSignalByNumber=function(number,signals){
+const signal=signals.find(({name})=>_os.constants.signals[name]===number);
+
+if(signal!==undefined){
+return signal;
+}
+
+return signals.find(signalA=>signalA.number===number);
+};
+
+const signalsByNumber=getSignalsByNumber();exports.signalsByNumber=signalsByNumber;
+//# sourceMappingURL=main.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.js.map b/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.js.map
new file mode 100644
index 0000000..3fdcede
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/main.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/main.js"],"names":["getSignalsByName","signals","reduce","getSignalByName","signalByNameMemo","name","number","description","supported","action","forced","standard","signalsByName","getSignalsByNumber","length","SIGRTMAX","signalsA","Array","from","value","getSignalByNumber","Object","assign","signal","findSignalByNumber","undefined","find","constants","signalA","signalsByNumber"],"mappings":"2HAAA;;AAEA;AACA;;;;AAIA,KAAMA,CAAAA,gBAAgB,CAAG,UAAW;AAClC,KAAMC,CAAAA,OAAO,CAAG,yBAAhB;AACA,MAAOA,CAAAA,OAAO,CAACC,MAAR,CAAeC,eAAf,CAAgC,EAAhC,CAAP;AACD,CAHD;;AAKA,KAAMA,CAAAA,eAAe,CAAG;AACtBC,gBADsB;AAEtB,CAAEC,IAAF,CAAQC,MAAR,CAAgBC,WAAhB,CAA6BC,SAA7B,CAAwCC,MAAxC,CAAgDC,MAAhD,CAAwDC,QAAxD,CAFsB;AAGtB;AACA,MAAO;AACL,GAAGP,gBADE;AAEL,CAACC,IAAD,EAAQ,CAAEA,IAAF,CAAQC,MAAR,CAAgBC,WAAhB,CAA6BC,SAA7B,CAAwCC,MAAxC,CAAgDC,MAAhD,CAAwDC,QAAxD,CAFH,CAAP;;AAID,CARD;;AAUO,KAAMC,CAAAA,aAAa,CAAGZ,gBAAgB,EAAtC,C;;;;;AAKP,KAAMa,CAAAA,kBAAkB,CAAG,UAAW;AACpC,KAAMZ,CAAAA,OAAO,CAAG,yBAAhB;AACA,KAAMa,CAAAA,MAAM,CAAGC,mBAAW,CAA1B;AACA,KAAMC,CAAAA,QAAQ,CAAGC,KAAK,CAACC,IAAN,CAAW,CAAEJ,MAAF,CAAX,CAAuB,CAACK,KAAD,CAAQb,MAAR;AACtCc,iBAAiB,CAACd,MAAD,CAASL,OAAT,CADF,CAAjB;;AAGA,MAAOoB,CAAAA,MAAM,CAACC,MAAP,CAAc,EAAd,CAAkB,GAAGN,QAArB,CAAP;AACD,CAPD;;AASA,KAAMI,CAAAA,iBAAiB,CAAG,SAASd,MAAT,CAAiBL,OAAjB,CAA0B;AAClD,KAAMsB,CAAAA,MAAM,CAAGC,kBAAkB,CAAClB,MAAD,CAASL,OAAT,CAAjC;;AAEA,GAAIsB,MAAM,GAAKE,SAAf,CAA0B;AACxB,MAAO,EAAP;AACD;;AAED,KAAM,CAAEpB,IAAF,CAAQE,WAAR,CAAqBC,SAArB,CAAgCC,MAAhC,CAAwCC,MAAxC,CAAgDC,QAAhD,EAA6DY,MAAnE;AACA,MAAO;AACL,CAACjB,MAAD,EAAU;AACRD,IADQ;AAERC,MAFQ;AAGRC,WAHQ;AAIRC,SAJQ;AAKRC,MALQ;AAMRC,MANQ;AAORC,QAPQ,CADL,CAAP;;;AAWD,CAnBD;;;;AAuBA,KAAMa,CAAAA,kBAAkB,CAAG,SAASlB,MAAT,CAAiBL,OAAjB,CAA0B;AACnD,KAAMsB,CAAAA,MAAM,CAAGtB,OAAO,CAACyB,IAAR,CAAa,CAAC,CAAErB,IAAF,CAAD,GAAcsB,cAAU1B,OAAV,CAAkBI,IAAlB,IAA4BC,MAAvD,CAAf;;AAEA,GAAIiB,MAAM,GAAKE,SAAf,CAA0B;AACxB,MAAOF,CAAAA,MAAP;AACD;;AAED,MAAOtB,CAAAA,OAAO,CAACyB,IAAR,CAAaE,OAAO,EAAIA,OAAO,CAACtB,MAAR,GAAmBA,MAA3C,CAAP;AACD,CARD;;AAUO,KAAMuB,CAAAA,eAAe,CAAGhB,kBAAkB,EAA1C,C","sourcesContent":["import { constants } from 'os'\n\nimport { getSignals } from './signals.js'\nimport { SIGRTMAX } from './realtime.js'\n\n// Retrieve `signalsByName`, an object mapping signal name to signal properties.\n// We make sure the object is sorted by `number`.\nconst getSignalsByName = function() {\n  const signals = getSignals()\n  return signals.reduce(getSignalByName, {})\n}\n\nconst getSignalByName = function(\n  signalByNameMemo,\n  { name, number, description, supported, action, forced, standard },\n) {\n  return {\n    ...signalByNameMemo,\n    [name]: { name, number, description, supported, action, forced, standard },\n  }\n}\n\nexport const signalsByName = getSignalsByName()\n\n// Retrieve `signalsByNumber`, an object mapping signal number to signal\n// properties.\n// We make sure the object is sorted by `number`.\nconst getSignalsByNumber = function() {\n  const signals = getSignals()\n  const length = SIGRTMAX + 1\n  const signalsA = Array.from({ length }, (value, number) =>\n    getSignalByNumber(number, signals),\n  )\n  return Object.assign({}, ...signalsA)\n}\n\nconst getSignalByNumber = function(number, signals) {\n  const signal = findSignalByNumber(number, signals)\n\n  if (signal === undefined) {\n    return {}\n  }\n\n  const { name, description, supported, action, forced, standard } = signal\n  return {\n    [number]: {\n      name,\n      number,\n      description,\n      supported,\n      action,\n      forced,\n      standard,\n    },\n  }\n}\n\n// Several signals might end up sharing the same number because of OS-specific\n// numbers, in which case those prevail.\nconst findSignalByNumber = function(number, signals) {\n  const signal = signals.find(({ name }) => constants.signals[name] === number)\n\n  if (signal !== undefined) {\n    return signal\n  }\n\n  return signals.find(signalA => signalA.number === number)\n}\n\nexport const signalsByNumber = getSignalsByNumber()\n"],"file":"src/main.js"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/realtime.js b/node_modules/mathjs/examples/node_modules/human-signals/build/src/realtime.js
new file mode 100644
index 0000000..f665516
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/realtime.js
@@ -0,0 +1,19 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.SIGRTMAX=exports.getRealtimeSignals=void 0;
+const getRealtimeSignals=function(){
+const length=SIGRTMAX-SIGRTMIN+1;
+return Array.from({length},getRealtimeSignal);
+};exports.getRealtimeSignals=getRealtimeSignals;
+
+const getRealtimeSignal=function(value,index){
+return{
+name:`SIGRT${index+1}`,
+number:SIGRTMIN+index,
+action:"terminate",
+description:"Application-specific signal (realtime)",
+standard:"posix"};
+
+};
+
+const SIGRTMIN=34;
+const SIGRTMAX=64;exports.SIGRTMAX=SIGRTMAX;
+//# sourceMappingURL=realtime.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/realtime.js.map b/node_modules/mathjs/examples/node_modules/human-signals/build/src/realtime.js.map
new file mode 100644
index 0000000..808bbd1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/realtime.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/realtime.js"],"names":["getRealtimeSignals","length","SIGRTMAX","SIGRTMIN","Array","from","getRealtimeSignal","value","index","name","number","action","description","standard"],"mappings":";AACO,KAAMA,CAAAA,kBAAkB,CAAG,UAAW;AAC3C,KAAMC,CAAAA,MAAM,CAAGC,QAAQ,CAAGC,QAAX,CAAsB,CAArC;AACA,MAAOC,CAAAA,KAAK,CAACC,IAAN,CAAW,CAAEJ,MAAF,CAAX,CAAuBK,iBAAvB,CAAP;AACD,CAHM,C;;AAKP,KAAMA,CAAAA,iBAAiB,CAAG,SAASC,KAAT,CAAgBC,KAAhB,CAAuB;AAC/C,MAAO;AACLC,IAAI,CAAG,QAAOD,KAAK,CAAG,CAAE,EADnB;AAELE,MAAM,CAAEP,QAAQ,CAAGK,KAFd;AAGLG,MAAM,CAAE,WAHH;AAILC,WAAW,CAAE,wCAJR;AAKLC,QAAQ,CAAE,OALL,CAAP;;AAOD,CARD;;AAUA,KAAMV,CAAAA,QAAQ,CAAG,EAAjB;AACO,KAAMD,CAAAA,QAAQ,CAAG,EAAjB,C","sourcesContent":["// List of realtime signals with information about them\nexport const getRealtimeSignals = function() {\n  const length = SIGRTMAX - SIGRTMIN + 1\n  return Array.from({ length }, getRealtimeSignal)\n}\n\nconst getRealtimeSignal = function(value, index) {\n  return {\n    name: `SIGRT${index + 1}`,\n    number: SIGRTMIN + index,\n    action: 'terminate',\n    description: 'Application-specific signal (realtime)',\n    standard: 'posix',\n  }\n}\n\nconst SIGRTMIN = 34\nexport const SIGRTMAX = 64\n"],"file":"src/realtime.js"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/signals.js b/node_modules/mathjs/examples/node_modules/human-signals/build/src/signals.js
new file mode 100644
index 0000000..ab3b387
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/signals.js
@@ -0,0 +1,35 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.getSignals=void 0;var _os=require("os");
+
+var _core=require("./core.js");
+var _realtime=require("./realtime.js");
+
+
+
+const getSignals=function(){
+const realtimeSignals=(0,_realtime.getRealtimeSignals)();
+const signals=[..._core.SIGNALS,...realtimeSignals].map(normalizeSignal);
+return signals;
+};exports.getSignals=getSignals;
+
+
+
+
+
+
+
+const normalizeSignal=function({
+name,
+number:defaultNumber,
+description,
+action,
+forced=false,
+standard})
+{
+const{
+signals:{[name]:constantSignal}}=
+_os.constants;
+const supported=constantSignal!==undefined;
+const number=supported?constantSignal:defaultNumber;
+return{name,number,description,supported,action,forced,standard};
+};
+//# sourceMappingURL=signals.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/build/src/signals.js.map b/node_modules/mathjs/examples/node_modules/human-signals/build/src/signals.js.map
new file mode 100644
index 0000000..2a6b919
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/build/src/signals.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/signals.js"],"names":["getSignals","realtimeSignals","signals","SIGNALS","map","normalizeSignal","name","number","defaultNumber","description","action","forced","standard","constantSignal","constants","supported","undefined"],"mappings":"gGAAA;;AAEA;AACA;;;;AAIO,KAAMA,CAAAA,UAAU,CAAG,UAAW;AACnC,KAAMC,CAAAA,eAAe,CAAG,kCAAxB;AACA,KAAMC,CAAAA,OAAO,CAAG,CAAC,GAAGC,aAAJ,CAAa,GAAGF,eAAhB,EAAiCG,GAAjC,CAAqCC,eAArC,CAAhB;AACA,MAAOH,CAAAA,OAAP;AACD,CAJM,C;;;;;;;;AAYP,KAAMG,CAAAA,eAAe,CAAG,SAAS;AAC/BC,IAD+B;AAE/BC,MAAM,CAAEC,aAFuB;AAG/BC,WAH+B;AAI/BC,MAJ+B;AAK/BC,MAAM,CAAG,KALsB;AAM/BC,QAN+B,CAAT;AAOrB;AACD,KAAM;AACJV,OAAO,CAAE,CAAE,CAACI,IAAD,EAAQO,cAAV,CADL;AAEFC,aAFJ;AAGA,KAAMC,CAAAA,SAAS,CAAGF,cAAc,GAAKG,SAArC;AACA,KAAMT,CAAAA,MAAM,CAAGQ,SAAS,CAAGF,cAAH,CAAoBL,aAA5C;AACA,MAAO,CAAEF,IAAF,CAAQC,MAAR,CAAgBE,WAAhB,CAA6BM,SAA7B,CAAwCL,MAAxC,CAAgDC,MAAhD,CAAwDC,QAAxD,CAAP;AACD,CAdD","sourcesContent":["import { constants } from 'os'\n\nimport { SIGNALS } from './core.js'\nimport { getRealtimeSignals } from './realtime.js'\n\n// Retrieve list of know signals (including realtime) with information about\n// them\nexport const getSignals = function() {\n  const realtimeSignals = getRealtimeSignals()\n  const signals = [...SIGNALS, ...realtimeSignals].map(normalizeSignal)\n  return signals\n}\n\n// Normalize signal:\n//  - `number`: signal numbers are OS-specific. This is taken into account by\n//    `os.constants.signals`. However we provide a default `number` since some\n//     signals are not defined for some OS.\n//  - `forced`: set default to `false`\n//  - `supported`: set value\nconst normalizeSignal = function({\n  name,\n  number: defaultNumber,\n  description,\n  action,\n  forced = false,\n  standard,\n}) {\n  const {\n    signals: { [name]: constantSignal },\n  } = constants\n  const supported = constantSignal !== undefined\n  const number = supported ? constantSignal : defaultNumber\n  return { name, number, description, supported, action, forced, standard }\n}\n"],"file":"src/signals.js"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/human-signals/package.json b/node_modules/mathjs/examples/node_modules/human-signals/package.json
new file mode 100644
index 0000000..fd1d027
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/human-signals/package.json
@@ -0,0 +1,64 @@
+{
+  "name": "human-signals",
+  "version": "2.1.0",
+  "main": "build/src/main.js",
+  "files": [
+    "build/src",
+    "!~"
+  ],
+  "scripts": {
+    "test": "gulp test"
+  },
+  "husky": {
+    "hooks": {
+      "pre-push": "gulp check --full"
+    }
+  },
+  "description": "Human-friendly process signals",
+  "keywords": [
+    "signal",
+    "signals",
+    "handlers",
+    "error-handling",
+    "errors",
+    "interrupts",
+    "sigterm",
+    "sigint",
+    "irq",
+    "process",
+    "exit",
+    "exit-code",
+    "status",
+    "operating-system",
+    "es6",
+    "javascript",
+    "linux",
+    "macos",
+    "windows",
+    "nodejs"
+  ],
+  "license": "Apache-2.0",
+  "homepage": "https://git.io/JeluP",
+  "repository": "ehmicky/human-signals",
+  "bugs": {
+    "url": "https://github.com/ehmicky/human-signals/issues"
+  },
+  "author": "ehmicky <ehmicky@gmail.com> (https://github.com/ehmicky)",
+  "directories": {
+    "lib": "src",
+    "test": "test"
+  },
+  "types": "build/src/main.d.ts",
+  "dependencies": {},
+  "devDependencies": {
+    "@ehmicky/dev-tasks": "^0.31.9",
+    "ajv": "^6.12.0",
+    "ava": "^3.5.0",
+    "gulp": "^4.0.2",
+    "husky": "^4.2.3",
+    "test-each": "^2.0.0"
+  },
+  "engines": {
+    "node": ">=10.17.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/import-local/fixtures/cli.js b/node_modules/mathjs/examples/node_modules/import-local/fixtures/cli.js
new file mode 100644
index 0000000..46b939f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/import-local/fixtures/cli.js
@@ -0,0 +1,7 @@
+#!/usr/bin/env node
+'use strict';
+const importLocal = require('..');
+
+if (importLocal(__filename)) {
+	console.log('local');
+}
diff --git a/node_modules/mathjs/examples/node_modules/import-local/index.js b/node_modules/mathjs/examples/node_modules/import-local/index.js
new file mode 100644
index 0000000..28c9c60
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/import-local/index.js
@@ -0,0 +1,24 @@
+'use strict';
+const path = require('path');
+const {fileURLToPath} = require('url');
+const resolveCwd = require('resolve-cwd');
+const pkgDir = require('pkg-dir');
+
+module.exports = filename => {
+	const normalizedFilename = filename.startsWith('file://') ? fileURLToPath(filename) : filename;
+	const globalDir = pkgDir.sync(path.dirname(normalizedFilename));
+	const relativePath = path.relative(globalDir, normalizedFilename);
+	const pkg = require(path.join(globalDir, 'package.json'));
+	const localFile = resolveCwd.silent(path.join(pkg.name, relativePath));
+	const localNodeModules = path.join(process.cwd(), 'node_modules');
+
+	const filenameInLocalNodeModules = !path.relative(localNodeModules, normalizedFilename).startsWith('..') &&
+		// On Windows, if `localNodeModules` and `normalizedFilename` are on different partitions, `path.relative()` returns the value of `normalizedFilename`, resulting in `filenameInLocalNodeModules` incorrectly becoming `true`.
+		path.parse(localNodeModules).root === path.parse(normalizedFilename).root;
+
+	// Use `path.relative()` to detect local package installation,
+	// because __filename's case is inconsistent on Windows
+	// Can use `===` when targeting Node.js 8
+	// See https://github.com/nodejs/node/issues/6624
+	return !filenameInLocalNodeModules && localFile && path.relative(localFile, normalizedFilename) !== '' && require(localFile);
+};
diff --git a/node_modules/mathjs/examples/node_modules/import-local/license b/node_modules/mathjs/examples/node_modules/import-local/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/import-local/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/import-local/package.json b/node_modules/mathjs/examples/node_modules/import-local/package.json
new file mode 100644
index 0000000..0de45f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/import-local/package.json
@@ -0,0 +1,52 @@
+{
+	"name": "import-local",
+	"version": "3.1.0",
+	"description": "Let a globally installed package use a locally installed version of itself if available",
+	"license": "MIT",
+	"repository": "sindresorhus/import-local",
+	"funding": "https://github.com/sponsors/sindresorhus",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"bin": {
+		"import-local-fixture": "fixtures/cli.js"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava"
+	},
+	"files": [
+		"index.js",
+		"fixtures/cli.js"
+	],
+	"keywords": [
+		"import",
+		"local",
+		"require",
+		"resolve",
+		"global",
+		"version",
+		"prefer",
+		"cli"
+	],
+	"dependencies": {
+		"pkg-dir": "^4.2.0",
+		"resolve-cwd": "^3.0.0"
+	},
+	"devDependencies": {
+		"ava": "2.1.0",
+		"cpy": "^7.0.1",
+		"del": "^4.1.1",
+		"execa": "^2.0.1",
+		"xo": "^0.24.0"
+	},
+	"xo": {
+		"ignores": [
+			"fixtures"
+		]
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/import-local/readme.md b/node_modules/mathjs/examples/node_modules/import-local/readme.md
new file mode 100644
index 0000000..cc5244f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/import-local/readme.md
@@ -0,0 +1,37 @@
+# import-local
+
+> Let a globally installed package use a locally installed version of itself if available
+
+Useful for CLI tools that want to defer to the user's locally installed version when available, but still work if it's not installed locally. For example, [AVA](https://avajs.dev) and [XO](https://github.com/xojs/xo) uses this method.
+
+## Install
+
+```sh
+npm install import-local
+```
+
+## Usage
+
+```js
+import importLocal from 'import-local';
+
+if (importLocal(import.meta.url)) {
+	console.log('Using local version of this package');
+} else {
+	// Code for both global and local version here…
+}
+```
+
+You can also pass in `__filename` when used in a CommonJS context.
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-import-local?utm_source=npm-import-local&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/interpret/CHANGELOG b/node_modules/mathjs/examples/node_modules/interpret/CHANGELOG
new file mode 100644
index 0000000..cbc8a8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/interpret/CHANGELOG
@@ -0,0 +1,115 @@
+v1.0.3:
+  date: 2017-04-18
+  changes:
+    - fix buble support
+v1.0.2:
+  date: 2017-03-29
+  changes:
+    - add support for coffeescript (now with no hyphen)
+v1.0.1:
+  date: 2016-05-01
+  changes:
+    - add support for buble
+v1.0.0:
+  date: 2015-11-18
+  changes:
+    - add support for babel-register
+    - go stable!
+v0.6.6:
+  date: 2015-09-21
+  changes:
+    - add support for ts-node (formerly typescript-node)
+v0.6.5:
+  date: 2015-07-22
+  changes:
+    - add support for typescript 1.5 via typescript-node
+v0.6.4:
+  date: 2015-07-07
+  changes:
+    - add support for earlgrey
+v0.6.3:
+  date: 2015-07-03
+  changes:
+    - prefer babel/core to babel
+v0.6.2:
+  date: 2015-05-20
+  changes:
+    - update module list for iced coffee-script
+v0.6.1:
+  date: 2015-05-20
+  changes:
+    - Fix toml loader.
+v0.6.0:
+  date: 2015-05-19
+  changes:
+    - Combine fallbacks and loaders into `extensions`.
+    - Provide implementation guidance.
+v0.5.1:
+  date: 2015-03-01
+  changes:
+    - Add support for CirruScript.
+v0.5.0:
+  date: 2015-02-27
+  changes:
+    - Refactor es6 support via Babel (formerly 6to5)
+v0.4.3:
+  date: 2015-02-09
+  changes:
+    - Switch support from typescript-require to typescript-register.
+v0.4.2:
+  date: 2015-01-16
+  changes:
+    - Add support for wisp.
+v0.4.1:
+  date: 2015-01-10
+  changes:
+    - Add support for 6to5 (es6)
+v0.4.0:
+  date: 2014-01-09
+  changes:
+    - Add support for fallback (legacy) modules
+    - Add support for module configurations
+v0.3.10:
+  date: 2014-12-17
+  changes:
+    - Add support for json5.
+v0.3.9:
+  date: 2014-12-08
+  changes:
+    - Add support for literate iced coffee.
+v0.3.8:
+  date: 2014-11-20
+  changes:
+    - Add support for [cjsx](https://github.com/jsdf/coffee-react).
+v0.3.7:
+  date: 2014-09-08
+  changes:
+    - Add support for [TypeScript](http://www.typescriptlang.org/).
+v0.3.6:
+  date: 2014-08-25
+  changes:
+    - Add support for coffee.md.
+v0.3.5:
+  date: 2014-07-03
+  changes:
+    - Add support for jsx.
+v0.3.4:
+  date: 2014-06-27
+  changes:
+    - Make .js first jsVariant entry.
+v0.3.3:
+  date: 2014-06-02
+  changes:
+    - Fix casing on livescript dependency.
+v0.3.0:
+  date: 2014-04-20
+  changes:
+    - Simplify loading of coffee-script and iced-coffee-script.
+v0.2.0:
+  date: 2014-04-20
+  changes:
+    - Move module loading into rechoir.
+v0.1.0:
+  date: 2014-04-20
+  changes:
+    - Initial public release.
diff --git a/node_modules/mathjs/examples/node_modules/interpret/LICENSE b/node_modules/mathjs/examples/node_modules/interpret/LICENSE
new file mode 100644
index 0000000..7d7525d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/interpret/LICENSE
@@ -0,0 +1,22 @@
+Copyright (c) 2014-2018 Tyler Kellen <tyler@sleekcode.net>, Blaine Bublitz <blaine.bublitz@gmail.com>, and Eric Schoffstall <yo@contra.io>
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/interpret/README.md b/node_modules/mathjs/examples/node_modules/interpret/README.md
new file mode 100644
index 0000000..f56410c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/interpret/README.md
@@ -0,0 +1,229 @@
+<p align="center">
+  <a href="http://gulpjs.com">
+    <img height="257" width="114" src="https://raw.githubusercontent.com/gulpjs/artwork/master/gulp-2x.png">
+  </a>
+</p>
+
+# interpret
+
+[![NPM version][npm-image]][npm-url] [![Downloads][downloads-image]][npm-url] [![Travis Build Status][travis-image]][travis-url] [![AppVeyor Build Status][appveyor-image]][appveyor-url] [![Coveralls Status][coveralls-image]][coveralls-url] [![Gitter chat][gitter-image]][gitter-url]
+
+A dictionary of file extensions and associated module loaders.
+
+## What is it
+This is used by [Liftoff](http://github.com/tkellen/node-liftoff) to automatically require dependencies for configuration files, and by [rechoir](http://github.com/tkellen/node-rechoir) for registering module loaders.
+
+## interpret for enterprise
+
+Available as part of the Tidelift Subscription
+
+The maintainers of interpret and thousands of other packages are working with Tidelift to deliver commercial support and maintenance for the open source dependencies you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact dependencies you use. [Learn more.](https://tidelift.com/subscription/pkg/npm-interpret?utm_source=npm-interpret&utm_medium=referral&utm_campaign=enterprise&utm_term=repo)
+
+## API
+
+### extensions
+Map file types to modules which provide a [require.extensions] loader.
+
+```js
+{
+  '.babel.js': [
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+    {
+      module: 'babel-register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel-core/register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+  ],
+  '.babel.ts': [
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.ts',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+  ],
+  '.buble.js': 'buble/register',
+  '.cirru': 'cirru-script/lib/register',
+  '.cjsx': 'node-cjsx/register',
+  '.co': 'coco',
+  '.coffee': ['coffeescript/register', 'coffee-script/register', 'coffeescript', 'coffee-script'],
+  '.coffee.md': ['coffeescript/register', 'coffee-script/register', 'coffeescript', 'coffee-script'],
+  '.csv': 'require-csv',
+  '.eg': 'earlgrey/register',
+  '.esm.js': {
+    module: 'esm',
+    register: function(hook) {
+      // register on .js extension due to https://github.com/joyent/node/blob/v0.12.0/lib/module.js#L353
+      // which only captures the final extension (.babel.js -> .js)
+      var esmLoader = hook(module);
+      require.extensions['.js'] = esmLoader('module')._extensions['.js'];
+    },
+  },
+  '.iced': ['iced-coffee-script/register', 'iced-coffee-script'],
+  '.iced.md': 'iced-coffee-script/register',
+  '.ini': 'require-ini',
+  '.js': null,
+  '.json': null,
+  '.json5': ['json5/lib/register', 'json5/lib/require'],
+  '.jsx': [
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+    {
+      module: 'babel-register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel-core/register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'node-jsx',
+      register: function(hook) {
+        hook.install({ extension: '.jsx', harmony: true });
+      },
+    },
+  ],
+  '.litcoffee': ['coffeescript/register', 'coffee-script/register', 'coffeescript', 'coffee-script'],
+  '.liticed': 'iced-coffee-script/register',
+  '.ls': ['livescript', 'LiveScript'],
+  '.mjs': '/absolute/path/to/interpret/mjs-stub.js',
+  '.node': null,
+  '.toml': {
+    module: 'toml-require',
+    register: function(hook) {
+      hook.install();
+    },
+  },
+  '.ts': [
+    'ts-node/register',
+    'typescript-node/register',
+    'typescript-register',
+    'typescript-require',
+    'sucrase/register/ts',
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.ts',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+  ],
+  '.tsx': [
+    'ts-node/register',
+    'typescript-node/register',
+    'sucrase/register',
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.tsx',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+  ],
+  '.wisp': 'wisp/engine/node',
+  '.xml': 'require-xml',
+  '.yaml': 'require-yaml',
+  '.yml': 'require-yaml',
+}
+```
+
+### jsVariants
+Same as above, but only include the extensions which are javascript variants.
+
+## How to use it
+
+Consumers should use the exported `extensions` or `jsVariants` object to determine which module should be loaded for a given extension. If a matching extension is found, consumers should do the following:
+
+1. If the value is null, do nothing.
+
+2. If the value is a string, try to require it.
+
+3. If the value is an object, try to require the `module` property. If successful, the `register` property (a function) should be called with the module passed as the first argument.
+
+4. If the value is an array, iterate over it, attempting step #2 or #3 until one of the attempts does not throw.
+
+[require.extensions]: http://nodejs.org/api/globals.html#globals_require_extensions
+
+[downloads-image]: http://img.shields.io/npm/dm/interpret.svg
+[npm-url]: https://www.npmjs.com/package/interpret
+[npm-image]: http://img.shields.io/npm/v/interpret.svg
+
+[travis-url]: https://travis-ci.org/gulpjs/interpret
+[travis-image]: http://img.shields.io/travis/gulpjs/interpret.svg?label=travis-ci
+
+[appveyor-url]: https://ci.appveyor.com/project/gulpjs/interpret
+[appveyor-image]: https://img.shields.io/appveyor/ci/gulpjs/interpret.svg?label=appveyor
+
+[coveralls-url]: https://coveralls.io/r/gulpjs/interpret
+[coveralls-image]: http://img.shields.io/coveralls/gulpjs/interpret/master.svg
+
+[gitter-url]: https://gitter.im/gulpjs/gulp
+[gitter-image]: https://badges.gitter.im/gulpjs/gulp.svg
diff --git a/node_modules/mathjs/examples/node_modules/interpret/index.js b/node_modules/mathjs/examples/node_modules/interpret/index.js
new file mode 100644
index 0000000..2a2b829
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/interpret/index.js
@@ -0,0 +1,211 @@
+var path = require('path');
+
+var endsInBabelJs = /\.babel\.[jt]s(x)$/;
+
+var mjsStub = path.join(__dirname, 'mjs-stub');
+
+function ignoreNonBabelAndNodeModules(file) {
+  return !endsInBabelJs.test(file) &&
+    path.relative(process.cwd(), file).split(path.sep).indexOf('node_modules') >= 0;
+}
+
+var extensions = {
+  '.babel.js': [
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+    {
+      module: 'babel-register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel-core/register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.js',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+  ],
+  '.babel.ts': [
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.ts',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+  ],
+  '.buble.js': 'buble/register',
+  '.cirru': 'cirru-script/lib/register',
+  '.cjsx': 'node-cjsx/register',
+  '.co': 'coco',
+  '.coffee': ['coffeescript/register', 'coffee-script/register', 'coffeescript', 'coffee-script'],
+  '.coffee.md': ['coffeescript/register', 'coffee-script/register', 'coffeescript', 'coffee-script'],
+  '.csv': 'require-csv',
+  '.eg': 'earlgrey/register',
+  '.esm.js': {
+    module: 'esm',
+    register: function(hook) {
+      // register on .js extension due to https://github.com/joyent/node/blob/v0.12.0/lib/module.js#L353
+      // which only captures the final extension (.babel.js -> .js)
+      var esmLoader = hook(module);
+      require.extensions['.js'] = esmLoader('module')._extensions['.js'];
+    },
+  },
+  '.iced': ['iced-coffee-script/register', 'iced-coffee-script'],
+  '.iced.md': 'iced-coffee-script/register',
+  '.ini': 'require-ini',
+  '.js': null,
+  '.json': null,
+  '.json5': ['json5/lib/register', 'json5/lib/require'],
+  '.jsx': [
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+    {
+      module: 'babel-register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel-core/register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.jsx',
+          ignore: ignoreNonBabelAndNodeModules,
+        });
+      },
+    },
+    {
+      module: 'node-jsx',
+      register: function(hook) {
+        hook.install({ extension: '.jsx', harmony: true });
+      },
+    },
+  ],
+  '.litcoffee': ['coffeescript/register', 'coffee-script/register', 'coffeescript', 'coffee-script'],
+  '.liticed': 'iced-coffee-script/register',
+  '.ls': ['livescript', 'LiveScript'],
+  '.mjs': mjsStub,
+  '.node': null,
+  '.toml': {
+    module: 'toml-require',
+    register: function(hook) {
+      hook.install();
+    },
+  },
+  '.ts': [
+    'ts-node/register',
+    'typescript-node/register',
+    'typescript-register',
+    'typescript-require',
+    'sucrase/register/ts',
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.ts',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+  ],
+  '.tsx': [
+    'ts-node/register',
+    'typescript-node/register',
+    'sucrase/register',
+    {
+      module: '@babel/register',
+      register: function(hook) {
+        hook({
+          extensions: '.tsx',
+          rootMode: 'upward-optional',
+          ignore: [ignoreNonBabelAndNodeModules],
+        });
+      },
+    },
+  ],
+  '.wisp': 'wisp/engine/node',
+  '.xml': 'require-xml',
+  '.yaml': 'require-yaml',
+  '.yml': 'require-yaml',
+};
+
+var jsVariantExtensions = [
+  '.js',
+  '.babel.js',
+  '.babel.ts',
+  '.buble.js',
+  '.cirru',
+  '.cjsx',
+  '.co',
+  '.coffee',
+  '.coffee.md',
+  '.eg',
+  '.esm.js',
+  '.iced',
+  '.iced.md',
+  '.jsx',
+  '.litcoffee',
+  '.liticed',
+  '.ls',
+  '.mjs',
+  '.ts',
+  '.tsx',
+  '.wisp',
+];
+
+module.exports = {
+  extensions: extensions,
+  jsVariants: jsVariantExtensions.reduce(function(result, ext) {
+    result[ext] = extensions[ext];
+    return result;
+  }, {}),
+};
diff --git a/node_modules/mathjs/examples/node_modules/interpret/mjs-stub.js b/node_modules/mathjs/examples/node_modules/interpret/mjs-stub.js
new file mode 100644
index 0000000..6a1af95
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/interpret/mjs-stub.js
@@ -0,0 +1 @@
+require.extensions['.mjs'] = null;
diff --git a/node_modules/mathjs/examples/node_modules/interpret/package.json b/node_modules/mathjs/examples/node_modules/interpret/package.json
new file mode 100644
index 0000000..cc05601
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/interpret/package.json
@@ -0,0 +1,75 @@
+{
+  "name": "interpret",
+  "version": "2.2.0",
+  "description": "A dictionary of file extensions and associated module loaders.",
+  "author": "Gulp Team <team@gulpjs.com> (http://gulpjs.com/)",
+  "contributors": [
+    "Blaine Bublitz <blaine.bublitz@gmail.com>",
+    "Tyler Kellen <tyler@sleekcode.net> (http://goingslowly.com/)"
+  ],
+  "repository": "gulpjs/interpret",
+  "license": "MIT",
+  "engines": {
+    "node": ">= 0.10"
+  },
+  "main": "index.js",
+  "files": [
+    "LICENSE",
+    "index.js",
+    "mjs-stub.js"
+  ],
+  "scripts": {
+    "lint": "eslint .",
+    "pretest": "rm -rf tmp/ && npm run lint",
+    "test": "mocha --async-only",
+    "cover": "nyc --reporter=lcov --reporter=text-summary npm test",
+    "coveralls": "nyc --reporter=text-lcov npm test | coveralls"
+  },
+  "dependencies": {},
+  "devDependencies": {
+    "coveralls": "github:phated/node-coveralls#2.x",
+    "eslint": "^2.13.0",
+    "eslint-config-gulp": "^3.0.1",
+    "expect": "^1.20.2",
+    "mocha": "^3.5.3",
+    "nyc": "^10.3.2",
+    "parse-node-version": "^1.0.0",
+    "rechoir": "^0.7.0",
+    "shelljs": "0.7.5",
+    "trash-cli": "^3.0.0"
+  },
+  "keywords": [
+    "cirru-script",
+    "cjsx",
+    "co",
+    "coco",
+    "coffee",
+    "coffee-script",
+    "coffee.md",
+    "coffeescript",
+    "csv",
+    "earlgrey",
+    "es",
+    "es6",
+    "iced",
+    "iced.md",
+    "iced-coffee-script",
+    "ini",
+    "js",
+    "json",
+    "json5",
+    "jsx",
+    "react",
+    "litcoffee",
+    "liticed",
+    "ls",
+    "livescript",
+    "toml",
+    "ts",
+    "typescript",
+    "wisp",
+    "xml",
+    "yaml",
+    "yml"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/.eslintrc b/node_modules/mathjs/examples/node_modules/is-core-module/.eslintrc
new file mode 100644
index 0000000..05b25c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/.eslintrc
@@ -0,0 +1,17 @@
+{
+    "extends": "@ljharb",
+    "root": true,
+    "rules": {
+		"func-style": 1,
+    },
+    "overrides": [
+        {
+            "files": "test/**",
+            "rules": {
+                "global-require": 0,
+                "max-lines-per-function": 0,
+				"no-negated-condition": 0,
+            },
+        },
+    ],
+}
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/.nycrc b/node_modules/mathjs/examples/node_modules/is-core-module/.nycrc
new file mode 100644
index 0000000..bdd626c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/.nycrc
@@ -0,0 +1,9 @@
+{
+	"all": true,
+	"check-coverage": false,
+	"reporter": ["text-summary", "text", "html", "json"],
+	"exclude": [
+		"coverage",
+		"test"
+	]
+}
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/is-core-module/CHANGELOG.md
new file mode 100644
index 0000000..f4f1674
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/CHANGELOG.md
@@ -0,0 +1,127 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/)
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## [v2.8.1](https://github.com/inspect-js/is-core-module/compare/v2.8.0...v2.8.1) - 2022-01-05
+
+### Commits
+
+- [actions] reuse common workflows [`cd2cf9b`](https://github.com/inspect-js/is-core-module/commit/cd2cf9b3b66c8d328f65610efe41e9325db7716d)
+- [Fix] update node 0.4 results [`062195d`](https://github.com/inspect-js/is-core-module/commit/062195d89f0876a88b95d378b43f7fcc1205bc5b)
+- [Dev Deps] update `eslint`, `@ljharb/eslint-config`, `safe-publish-latest`, `tape` [`0790b62`](https://github.com/inspect-js/is-core-module/commit/0790b6222848c6167132f9f73acc3520fa8d1298)
+- [Dev Deps] update `eslint`, `@ljharb/eslint-config`, `tape` [`7d139a6`](https://github.com/inspect-js/is-core-module/commit/7d139a6d767709eabf0a0251e074ec1fb230c06e)
+- [Tests] run `nyc` in `tests-only`, not `test` [`780e8a0`](https://github.com/inspect-js/is-core-module/commit/780e8a049951c71cf78b1707f0871c48a28bde14)
+
+## [v2.8.0](https://github.com/inspect-js/is-core-module/compare/v2.7.0...v2.8.0) - 2021-10-14
+
+### Commits
+
+- [actions] update codecov uploader [`0cfe94e`](https://github.com/inspect-js/is-core-module/commit/0cfe94e106a7d005ea03e008c0a21dec13a77904)
+- [New] add `readline/promises` to node v17+ [`4f78c30`](https://github.com/inspect-js/is-core-module/commit/4f78c3008b1b58b4db6dc91d99610b1bc859da7e)
+- [Tests] node ^14.18 supports `node:` prefixes for CJS [`43e2f17`](https://github.com/inspect-js/is-core-module/commit/43e2f177452cea2f0eaf34f61b5407217bbdb6f4)
+
+## [v2.7.0](https://github.com/inspect-js/is-core-module/compare/v2.6.0...v2.7.0) - 2021-09-27
+
+### Commits
+
+- [New] node `v14.18` added `node:`-prefixed core modules to `require` [`6d943ab`](https://github.com/inspect-js/is-core-module/commit/6d943abe81382b9bbe344384d80fbfebe1cc0526)
+- [Tests] add coverage for Object.prototype pollution [`c6baf5f`](https://github.com/inspect-js/is-core-module/commit/c6baf5f942311a1945c1af41167bb80b84df2af7)
+- [Dev Deps] update `@ljharb/eslint-config` [`6717f00`](https://github.com/inspect-js/is-core-module/commit/6717f000d063ea57beb772bded36c2f056ac404c)
+- [eslint] fix linter warning [`594c10b`](https://github.com/inspect-js/is-core-module/commit/594c10bb7d39d7eb00925c90924199ff596184b2)
+- [meta] add `sideEffects` flag [`c32cfa5`](https://github.com/inspect-js/is-core-module/commit/c32cfa5195632944c4dd4284a142b8476e75be13)
+
+## [v2.6.0](https://github.com/inspect-js/is-core-module/compare/v2.5.0...v2.6.0) - 2021-08-17
+
+### Commits
+
+- [Dev Deps] update `eslint`, `tape` [`6cc928f`](https://github.com/inspect-js/is-core-module/commit/6cc928f8a4bba66aeeccc4f6beeac736d4bd3081)
+- [New] add `stream/consumers` to node `&gt;= 16.7` [`a1a423e`](https://github.com/inspect-js/is-core-module/commit/a1a423e467e4cc27df180234fad5bab45943e67d)
+- [Refactor] Remove duplicated `&&` operand [`86faea7`](https://github.com/inspect-js/is-core-module/commit/86faea738213a2433c62d1098488dc9314dca832)
+- [Tests] include prereleases [`a4da7a6`](https://github.com/inspect-js/is-core-module/commit/a4da7a6abf7568e2aa4fd98e69452179f1850963)
+
+## [v2.5.0](https://github.com/inspect-js/is-core-module/compare/v2.4.0...v2.5.0) - 2021-07-12
+
+### Commits
+
+- [Dev Deps] update `auto-changelog`, `eslint` [`6334cc9`](https://github.com/inspect-js/is-core-module/commit/6334cc94f3af7469685bd8f236740991baaf2705)
+- [New] add `stream/web` to node v16.5+ [`17ac59b`](https://github.com/inspect-js/is-core-module/commit/17ac59b662d63e220a2e5728625f005c24f177b2)
+
+## [v2.4.0](https://github.com/inspect-js/is-core-module/compare/v2.3.0...v2.4.0) - 2021-05-09
+
+### Commits
+
+- [readme] add actions and codecov badges [`82b7faa`](https://github.com/inspect-js/is-core-module/commit/82b7faa12b56dbe47fbea67e1a5b9e447027ba40)
+- [Dev Deps] update `@ljharb/eslint-config`, `aud` [`8096868`](https://github.com/inspect-js/is-core-module/commit/8096868c024a161ccd4d44110b136763e92eace8)
+- [Dev Deps] update `eslint` [`6726824`](https://github.com/inspect-js/is-core-module/commit/67268249b88230018c510f6532a8046d7326346f)
+- [New] add `diagnostics_channel` to node `^14.17` [`86c6563`](https://github.com/inspect-js/is-core-module/commit/86c65634201b8ff9b3e48a9a782594579c7f5c3c)
+- [meta] fix prepublish script [`697a01e`](https://github.com/inspect-js/is-core-module/commit/697a01e3c9c0be074066520954f30fb28532ec57)
+
+## [v2.3.0](https://github.com/inspect-js/is-core-module/compare/v2.2.0...v2.3.0) - 2021-04-24
+
+### Commits
+
+- [meta] do not publish github action workflow files [`060d4bb`](https://github.com/inspect-js/is-core-module/commit/060d4bb971a29451c19ff336eb56bee27f9fa95a)
+- [New] add support for `node:` prefix, in node 16+ [`7341223`](https://github.com/inspect-js/is-core-module/commit/73412230a769f6e81c05eea50b6520cebf54ed2f)
+- [actions] use `node/install` instead of `node/run`; use `codecov` action [`016269a`](https://github.com/inspect-js/is-core-module/commit/016269abae9f6657a5254adfbb813f09a05067f9)
+- [patch] remove unneeded `.0` in version ranges [`cb466a6`](https://github.com/inspect-js/is-core-module/commit/cb466a6d89e52b8389e5c12715efcd550c41cea3)
+- [Dev Deps] update `eslint`, `@ljharb/eslint-config`, `aud`, `tape` [`c9f9c39`](https://github.com/inspect-js/is-core-module/commit/c9f9c396ace60ef81906f98059c064e6452473ed)
+- [actions] update workflows [`3ee4a89`](https://github.com/inspect-js/is-core-module/commit/3ee4a89fd5a02fccd43882d905448ea6a98e9a3c)
+- [Dev Deps] update `eslint`, `@ljharb/eslint-config` [`dee4fed`](https://github.com/inspect-js/is-core-module/commit/dee4fed79690c1d43a22f7fa9426abebdc6d727f)
+- [Dev Deps] update `eslint`, `@ljharb/eslint-config` [`7d046ba`](https://github.com/inspect-js/is-core-module/commit/7d046ba07ae8c9292e43652694ca808d7b309de8)
+- [meta] use `prepublishOnly` script for npm 7+ [`149e677`](https://github.com/inspect-js/is-core-module/commit/149e6771a5ede6d097e71785b467a9c4b4977cc7)
+- [readme] remove travis badge [`903b51d`](https://github.com/inspect-js/is-core-module/commit/903b51d6b69b98abeabfbc3695c345b02646f19c)
+
+## [v2.2.0](https://github.com/inspect-js/is-core-module/compare/v2.1.0...v2.2.0) - 2020-11-26
+
+### Commits
+
+- [Tests] migrate tests to Github Actions [`c919f57`](https://github.com/inspect-js/is-core-module/commit/c919f573c0a92d10a0acad0b650b5aecb033d426)
+- [patch] `core.json`: %s/    /\t/g [`db3f685`](https://github.com/inspect-js/is-core-module/commit/db3f68581f53e73cc09cd675955eb1bdd6a5a39b)
+- [Tests] run `nyc` on all tests [`b2f925f`](https://github.com/inspect-js/is-core-module/commit/b2f925f8866f210ef441f39fcc8cc42692ab89b1)
+- [Dev Deps] update `eslint`, `@ljharb/eslint-config`, `aud`; add `safe-publish-latest` [`89f02a2`](https://github.com/inspect-js/is-core-module/commit/89f02a2b4162246dea303a6ee31bb9a550b05c72)
+- [New] add `path/posix`, `path/win32`, `util/types` [`77f94f1`](https://github.com/inspect-js/is-core-module/commit/77f94f1e90ffd7c0be2a3f1aa8574ebf7fd981b3)
+
+## [v2.1.0](https://github.com/inspect-js/is-core-module/compare/v2.0.0...v2.1.0) - 2020-11-04
+
+### Commits
+
+- [Dev Deps] update `eslint` [`5e0034e`](https://github.com/inspect-js/is-core-module/commit/5e0034eae57c09c8f1bd769f502486a00f56c6e4)
+- [New] Add `diagnostics_channel` [`c2d83d0`](https://github.com/inspect-js/is-core-module/commit/c2d83d0a0225a1a658945d9bab7036ea347d29ec)
+
+## [v2.0.0](https://github.com/inspect-js/is-core-module/compare/v1.0.2...v2.0.0) - 2020-09-29
+
+### Commits
+
+- v2 implementation [`865aeb5`](https://github.com/inspect-js/is-core-module/commit/865aeb5ca0e90248a3dfff5d7622e4751fdeb9cd)
+- Only apps should have lockfiles [`5a5e660`](https://github.com/inspect-js/is-core-module/commit/5a5e660d568e37eb44e17fb1ebb12a105205fc2b)
+- Initial commit for v2 [`5a51524`](https://github.com/inspect-js/is-core-module/commit/5a51524e06f92adece5fbb138c69b7b9748a2348)
+- Tests [`116eae4`](https://github.com/inspect-js/is-core-module/commit/116eae4fccd01bc72c1fd3cc4b7561c387afc496)
+- [meta] add `auto-changelog` [`c24388b`](https://github.com/inspect-js/is-core-module/commit/c24388bee828d223040519d1f5b226ca35beee63)
+- [actions] add "Automatic Rebase" and "require allow edits" actions [`34292db`](https://github.com/inspect-js/is-core-module/commit/34292dbcbadae0868aff03c22dbd8b7b8a11558a)
+- [Tests] add `npm run lint` [`4f9eeee`](https://github.com/inspect-js/is-core-module/commit/4f9eeee7ddff10698bbf528620f4dc8d4fa3e697)
+- [readme] fix travis badges, https all URLs [`e516a73`](https://github.com/inspect-js/is-core-module/commit/e516a73b0dccce20938c432b1ba512eae8eff9e9)
+- [meta] create FUNDING.yml [`1aabebc`](https://github.com/inspect-js/is-core-module/commit/1aabebca98d01f8a04e46bc2e2520fa93cf21ac6)
+- [Fix] `domain`: domain landed sometime &gt; v0.7.7 and &lt;= v0.7.12 [`2df7d37`](https://github.com/inspect-js/is-core-module/commit/2df7d37595d41b15eeada732b706b926c2771655)
+- [Fix] `sys`: worked in 0.6, not 0.7, and 0.8+ [`a75c134`](https://github.com/inspect-js/is-core-module/commit/a75c134229e1e9441801f6b73f6a52489346eb65)
+
+## [v1.0.2](https://github.com/inspect-js/is-core-module/compare/v1.0.1...v1.0.2) - 2014-09-28
+
+### Commits
+
+- simpler [`66fe90f`](https://github.com/inspect-js/is-core-module/commit/66fe90f9771581b9adc0c3900baa52c21b5baea2)
+
+## [v1.0.1](https://github.com/inspect-js/is-core-module/compare/v1.0.0...v1.0.1) - 2014-09-28
+
+### Commits
+
+- remove stupid [`f21f906`](https://github.com/inspect-js/is-core-module/commit/f21f906f882c2bd656a5fc5ed6fbe48ddaffb2ac)
+- update readme [`1eff0ec`](https://github.com/inspect-js/is-core-module/commit/1eff0ec69798d1ec65771552d1562911e90a8027)
+
+## v1.0.0 - 2014-09-28
+
+### Commits
+
+- init [`48e5e76`](https://github.com/inspect-js/is-core-module/commit/48e5e76cac378fddb8c1f7d4055b8dfc943d6b96)
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/LICENSE b/node_modules/mathjs/examples/node_modules/is-core-module/LICENSE
new file mode 100644
index 0000000..2e50287
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/LICENSE
@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 Dave Justice
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/README.md b/node_modules/mathjs/examples/node_modules/is-core-module/README.md
new file mode 100644
index 0000000..062d906
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/README.md
@@ -0,0 +1,40 @@
+# is-core-module <sup>[![Version Badge][2]][1]</sup>
+
+[![github actions][actions-image]][actions-url]
+[![coverage][codecov-image]][codecov-url]
+[![dependency status][5]][6]
+[![dev dependency status][7]][8]
+[![License][license-image]][license-url]
+[![Downloads][downloads-image]][downloads-url]
+
+[![npm badge][11]][1]
+
+Is this specifier a node.js core module? Optionally provide a node version to check; defaults to the current node version.
+
+## Example
+
+```js
+var isCore = require('is-core-module');
+var assert = require('assert');
+assert(isCore('fs'));
+assert(!isCore('butts'));
+```
+
+## Tests
+Clone the repo, `npm install`, and run `npm test`
+
+[1]: https://npmjs.org/package/is-core-module
+[2]: https://versionbadg.es/inspect-js/is-core-module.svg
+[5]: https://david-dm.org/inspect-js/is-core-module.svg
+[6]: https://david-dm.org/inspect-js/is-core-module
+[7]: https://david-dm.org/inspect-js/is-core-module/dev-status.svg
+[8]: https://david-dm.org/inspect-js/is-core-module#info=devDependencies
+[11]: https://nodei.co/npm/is-core-module.png?downloads=true&stars=true
+[license-image]: https://img.shields.io/npm/l/is-core-module.svg
+[license-url]: LICENSE
+[downloads-image]: https://img.shields.io/npm/dm/is-core-module.svg
+[downloads-url]: https://npm-stat.com/charts.html?package=is-core-module
+[codecov-image]: https://codecov.io/gh/inspect-js/is-core-module/branch/main/graphs/badge.svg
+[codecov-url]: https://app.codecov.io/gh/inspect-js/is-core-module/
+[actions-image]: https://img.shields.io/endpoint?url=https://github-actions-badge-u3jn4tfpocch.runkit.sh/inspect-js/is-core-module
+[actions-url]: https://github.com/inspect-js/is-core-module/actions
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/core.json b/node_modules/mathjs/examples/node_modules/is-core-module/core.json
new file mode 100644
index 0000000..d275294
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/core.json
@@ -0,0 +1,152 @@
+{
+	"assert": true,
+	"node:assert": [">= 14.18 && < 15", ">= 16"],
+	"assert/strict": ">= 15",
+	"node:assert/strict": ">= 16",
+	"async_hooks": ">= 8",
+	"node:async_hooks": [">= 14.18 && < 15", ">= 16"],
+	"buffer_ieee754": ">= 0.5 && < 0.9.7",
+	"buffer": true,
+	"node:buffer": [">= 14.18 && < 15", ">= 16"],
+	"child_process": true,
+	"node:child_process": [">= 14.18 && < 15", ">= 16"],
+	"cluster": ">= 0.5",
+	"node:cluster": [">= 14.18 && < 15", ">= 16"],
+	"console": true,
+	"node:console": [">= 14.18 && < 15", ">= 16"],
+	"constants": true,
+	"node:constants": [">= 14.18 && < 15", ">= 16"],
+	"crypto": true,
+	"node:crypto": [">= 14.18 && < 15", ">= 16"],
+	"_debug_agent": ">= 1 && < 8",
+	"_debugger": "< 8",
+	"dgram": true,
+	"node:dgram": [">= 14.18 && < 15", ">= 16"],
+	"diagnostics_channel": [">= 14.17 && < 15", ">= 15.1"],
+	"node:diagnostics_channel": [">= 14.18 && < 15", ">= 16"],
+	"dns": true,
+	"node:dns": [">= 14.18 && < 15", ">= 16"],
+	"dns/promises": ">= 15",
+	"node:dns/promises": ">= 16",
+	"domain": ">= 0.7.12",
+	"node:domain": [">= 14.18 && < 15", ">= 16"],
+	"events": true,
+	"node:events": [">= 14.18 && < 15", ">= 16"],
+	"freelist": "< 6",
+	"fs": true,
+	"node:fs": [">= 14.18 && < 15", ">= 16"],
+	"fs/promises": [">= 10 && < 10.1", ">= 14"],
+	"node:fs/promises": [">= 14.18 && < 15", ">= 16"],
+	"_http_agent": ">= 0.11.1",
+	"node:_http_agent": [">= 14.18 && < 15", ">= 16"],
+	"_http_client": ">= 0.11.1",
+	"node:_http_client": [">= 14.18 && < 15", ">= 16"],
+	"_http_common": ">= 0.11.1",
+	"node:_http_common": [">= 14.18 && < 15", ">= 16"],
+	"_http_incoming": ">= 0.11.1",
+	"node:_http_incoming": [">= 14.18 && < 15", ">= 16"],
+	"_http_outgoing": ">= 0.11.1",
+	"node:_http_outgoing": [">= 14.18 && < 15", ">= 16"],
+	"_http_server": ">= 0.11.1",
+	"node:_http_server": [">= 14.18 && < 15", ">= 16"],
+	"http": true,
+	"node:http": [">= 14.18 && < 15", ">= 16"],
+	"http2": ">= 8.8",
+	"node:http2": [">= 14.18 && < 15", ">= 16"],
+	"https": true,
+	"node:https": [">= 14.18 && < 15", ">= 16"],
+	"inspector": ">= 8",
+	"node:inspector": [">= 14.18 && < 15", ">= 16"],
+	"_linklist": "< 8",
+	"module": true,
+	"node:module": [">= 14.18 && < 15", ">= 16"],
+	"net": true,
+	"node:net": [">= 14.18 && < 15", ">= 16"],
+	"node-inspect/lib/_inspect": ">= 7.6 && < 12",
+	"node-inspect/lib/internal/inspect_client": ">= 7.6 && < 12",
+	"node-inspect/lib/internal/inspect_repl": ">= 7.6 && < 12",
+	"os": true,
+	"node:os": [">= 14.18 && < 15", ">= 16"],
+	"path": true,
+	"node:path": [">= 14.18 && < 15", ">= 16"],
+	"path/posix": ">= 15.3",
+	"node:path/posix": ">= 16",
+	"path/win32": ">= 15.3",
+	"node:path/win32": ">= 16",
+	"perf_hooks": ">= 8.5",
+	"node:perf_hooks": [">= 14.18 && < 15", ">= 16"],
+	"process": ">= 1",
+	"node:process": [">= 14.18 && < 15", ">= 16"],
+	"punycode": ">= 0.5",
+	"node:punycode": [">= 14.18 && < 15", ">= 16"],
+	"querystring": true,
+	"node:querystring": [">= 14.18 && < 15", ">= 16"],
+	"readline": true,
+	"node:readline": [">= 14.18 && < 15", ">= 16"],
+	"readline/promises": ">= 17",
+	"node:readline/promises": ">= 17",
+	"repl": true,
+	"node:repl": [">= 14.18 && < 15", ">= 16"],
+	"smalloc": ">= 0.11.5 && < 3",
+	"_stream_duplex": ">= 0.9.4",
+	"node:_stream_duplex": [">= 14.18 && < 15", ">= 16"],
+	"_stream_transform": ">= 0.9.4",
+	"node:_stream_transform": [">= 14.18 && < 15", ">= 16"],
+	"_stream_wrap": ">= 1.4.1",
+	"node:_stream_wrap": [">= 14.18 && < 15", ">= 16"],
+	"_stream_passthrough": ">= 0.9.4",
+	"node:_stream_passthrough": [">= 14.18 && < 15", ">= 16"],
+	"_stream_readable": ">= 0.9.4",
+	"node:_stream_readable": [">= 14.18 && < 15", ">= 16"],
+	"_stream_writable": ">= 0.9.4",
+	"node:_stream_writable": [">= 14.18 && < 15", ">= 16"],
+	"stream": true,
+	"node:stream": [">= 14.18 && < 15", ">= 16"],
+	"stream/consumers": ">= 16.7",
+	"node:stream/consumers": ">= 16.7",
+	"stream/promises": ">= 15",
+	"node:stream/promises": ">= 16",
+	"stream/web": ">= 16.5",
+	"node:stream/web": ">= 16.5",
+	"string_decoder": true,
+	"node:string_decoder": [">= 14.18 && < 15", ">= 16"],
+	"sys": [">= 0.4 && < 0.7", ">= 0.8"],
+	"node:sys": [">= 14.18 && < 15", ">= 16"],
+	"timers": true,
+	"node:timers": [">= 14.18 && < 15", ">= 16"],
+	"timers/promises": ">= 15",
+	"node:timers/promises": ">= 16",
+	"_tls_common": ">= 0.11.13",
+	"node:_tls_common": [">= 14.18 && < 15", ">= 16"],
+	"_tls_legacy": ">= 0.11.3 && < 10",
+	"_tls_wrap": ">= 0.11.3",
+	"node:_tls_wrap": [">= 14.18 && < 15", ">= 16"],
+	"tls": true,
+	"node:tls": [">= 14.18 && < 15", ">= 16"],
+	"trace_events": ">= 10",
+	"node:trace_events": [">= 14.18 && < 15", ">= 16"],
+	"tty": true,
+	"node:tty": [">= 14.18 && < 15", ">= 16"],
+	"url": true,
+	"node:url": [">= 14.18 && < 15", ">= 16"],
+	"util": true,
+	"node:util": [">= 14.18 && < 15", ">= 16"],
+	"util/types": ">= 15.3",
+	"node:util/types": ">= 16",
+	"v8/tools/arguments": ">= 10 && < 12",
+	"v8/tools/codemap": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/consarray": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/csvparser": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/logreader": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/profile_view": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/splaytree": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8": ">= 1",
+	"node:v8": [">= 14.18 && < 15", ">= 16"],
+	"vm": true,
+	"node:vm": [">= 14.18 && < 15", ">= 16"],
+	"wasi": ">= 13.4 && < 13.5",
+	"worker_threads": ">= 11.7",
+	"node:worker_threads": [">= 14.18 && < 15", ">= 16"],
+	"zlib": ">= 0.5",
+	"node:zlib": [">= 14.18 && < 15", ">= 16"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/index.js b/node_modules/mathjs/examples/node_modules/is-core-module/index.js
new file mode 100644
index 0000000..f9637e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/index.js
@@ -0,0 +1,69 @@
+'use strict';
+
+var has = require('has');
+
+function specifierIncluded(current, specifier) {
+	var nodeParts = current.split('.');
+	var parts = specifier.split(' ');
+	var op = parts.length > 1 ? parts[0] : '=';
+	var versionParts = (parts.length > 1 ? parts[1] : parts[0]).split('.');
+
+	for (var i = 0; i < 3; ++i) {
+		var cur = parseInt(nodeParts[i] || 0, 10);
+		var ver = parseInt(versionParts[i] || 0, 10);
+		if (cur === ver) {
+			continue; // eslint-disable-line no-restricted-syntax, no-continue
+		}
+		if (op === '<') {
+			return cur < ver;
+		}
+		if (op === '>=') {
+			return cur >= ver;
+		}
+		return false;
+	}
+	return op === '>=';
+}
+
+function matchesRange(current, range) {
+	var specifiers = range.split(/ ?&& ?/);
+	if (specifiers.length === 0) {
+		return false;
+	}
+	for (var i = 0; i < specifiers.length; ++i) {
+		if (!specifierIncluded(current, specifiers[i])) {
+			return false;
+		}
+	}
+	return true;
+}
+
+function versionIncluded(nodeVersion, specifierValue) {
+	if (typeof specifierValue === 'boolean') {
+		return specifierValue;
+	}
+
+	var current = typeof nodeVersion === 'undefined'
+		? process.versions && process.versions.node
+		: nodeVersion;
+
+	if (typeof current !== 'string') {
+		throw new TypeError(typeof nodeVersion === 'undefined' ? 'Unable to determine current node version' : 'If provided, a valid node version is required');
+	}
+
+	if (specifierValue && typeof specifierValue === 'object') {
+		for (var i = 0; i < specifierValue.length; ++i) {
+			if (matchesRange(current, specifierValue[i])) {
+				return true;
+			}
+		}
+		return false;
+	}
+	return matchesRange(current, specifierValue);
+}
+
+var data = require('./core.json');
+
+module.exports = function isCore(x, nodeVersion) {
+	return has(data, x) && versionIncluded(nodeVersion, data[x]);
+};
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/package.json b/node_modules/mathjs/examples/node_modules/is-core-module/package.json
new file mode 100644
index 0000000..0caddef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/package.json
@@ -0,0 +1,69 @@
+{
+	"name": "is-core-module",
+	"version": "2.8.1",
+	"description": "Is this specifier a node.js core module?",
+	"main": "index.js",
+	"sideEffects": false,
+	"exports": {
+		".": [
+			{
+				"default": "./index.js"
+			},
+			"./index.js"
+		],
+		"./package.json": "./package.json"
+	},
+	"scripts": {
+		"prepublish": "not-in-publish || npm run prepublishOnly",
+		"prepublishOnly": "safe-publish-latest",
+		"lint": "eslint .",
+		"pretest": "npm run lint",
+		"tests-only": "nyc tape 'test/**/*.js'",
+		"test": "npm run tests-only",
+		"posttest": "aud --production",
+		"version": "auto-changelog && git add CHANGELOG.md",
+		"postversion": "auto-changelog && git add CHANGELOG.md && git commit --no-edit --amend && git tag -f \"v$(node -e \"console.log(require('./package.json').version)\")\""
+	},
+	"repository": {
+		"type": "git",
+		"url": "git+https://github.com/inspect-js/is-core-module.git"
+	},
+	"keywords": [
+		"core",
+		"modules",
+		"module",
+		"npm",
+		"node",
+		"dependencies"
+	],
+	"author": "Jordan Harband <ljharb@gmail.com>",
+	"funding": {
+		"url": "https://github.com/sponsors/ljharb"
+	},
+	"license": "MIT",
+	"bugs": {
+		"url": "https://github.com/inspect-js/is-core-module/issues"
+	},
+	"homepage": "https://github.com/inspect-js/is-core-module",
+	"dependencies": {
+		"has": "^1.0.3"
+	},
+	"devDependencies": {
+		"@ljharb/eslint-config": "^20.1.0",
+		"aud": "^1.1.5",
+		"auto-changelog": "^2.3.0",
+		"eslint": "^8.6.0",
+		"nyc": "^10.3.2",
+		"safe-publish-latest": "^2.0.0",
+		"semver": "^6.3.0",
+		"tape": "^5.4.0"
+	},
+	"auto-changelog": {
+		"output": "CHANGELOG.md",
+		"template": "keepachangelog",
+		"unreleased": false,
+		"commitLimit": false,
+		"backfillLimit": false,
+		"hideCredit": true
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/is-core-module/test/index.js b/node_modules/mathjs/examples/node_modules/is-core-module/test/index.js
new file mode 100644
index 0000000..b688cd2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-core-module/test/index.js
@@ -0,0 +1,130 @@
+'use strict';
+
+var test = require('tape');
+var keys = require('object-keys');
+var semver = require('semver');
+var isCore = require('../');
+var data = require('../core.json');
+
+var supportsNodePrefix = semver.satisfies(process.versions.node, '^14.18 || >= 16', { includePrerelease: true });
+
+test('core modules', function (t) {
+	t.test('isCore()', function (st) {
+		st.ok(isCore('fs'));
+		st.ok(isCore('net'));
+		st.ok(isCore('http'));
+
+		st.ok(!isCore('seq'));
+		st.ok(!isCore('../'));
+
+		st.ok(!isCore('toString'));
+
+		st.end();
+	});
+
+	t.test('core list', function (st) {
+		var cores = keys(data);
+		st.plan(cores.length);
+
+		for (var i = 0; i < cores.length; ++i) {
+			var mod = cores[i];
+			var requireFunc = function () { require(mod); }; // eslint-disable-line no-loop-func
+			if (isCore(mod)) {
+				st.doesNotThrow(requireFunc, mod + ' supported; requiring does not throw');
+			} else {
+				st['throws'](requireFunc, mod + ' not supported; requiring throws');
+			}
+		}
+
+		st.end();
+	});
+
+	t.test('core via repl module', { skip: !data.repl }, function (st) {
+		var libs = require('repl')._builtinLibs; // eslint-disable-line no-underscore-dangle
+		if (!libs) {
+			st.skip('module.builtinModules does not exist');
+		} else {
+			for (var i = 0; i < libs.length; ++i) {
+				var mod = libs[i];
+				st.ok(data[mod], mod + ' is a core module');
+				st.doesNotThrow(
+					function () { require(mod); }, // eslint-disable-line no-loop-func
+					'requiring ' + mod + ' does not throw'
+				);
+				if (supportsNodePrefix) {
+					st.doesNotThrow(
+						function () { require('node:' + mod); }, // eslint-disable-line no-loop-func
+						'requiring node:' + mod + ' does not throw'
+					);
+				} else {
+					st['throws'](
+						function () { require('node:' + mod); }, // eslint-disable-line no-loop-func
+						'requiring node:' + mod + ' throws'
+					);
+				}
+			}
+		}
+		st.end();
+	});
+
+	t.test('core via builtinModules list', { skip: !data.module }, function (st) {
+		var libs = require('module').builtinModules;
+		if (!libs) {
+			st.skip('module.builtinModules does not exist');
+		} else {
+			var excludeList = [
+				'_debug_agent',
+				'v8/tools/tickprocessor-driver',
+				'v8/tools/SourceMap',
+				'v8/tools/tickprocessor',
+				'v8/tools/profile'
+			];
+			for (var i = 0; i < libs.length; ++i) {
+				var mod = libs[i];
+				if (excludeList.indexOf(mod) === -1) {
+					st.ok(data[mod], mod + ' is a core module');
+					st.doesNotThrow(
+						function () { require(mod); }, // eslint-disable-line no-loop-func
+						'requiring ' + mod + ' does not throw'
+					);
+					if (supportsNodePrefix) {
+						st.doesNotThrow(
+							function () { require('node:' + mod); }, // eslint-disable-line no-loop-func
+							'requiring node:' + mod + ' does not throw'
+						);
+					} else {
+						st['throws'](
+							function () { require('node:' + mod); }, // eslint-disable-line no-loop-func
+							'requiring node:' + mod + ' throws'
+						);
+					}
+				}
+			}
+		}
+		st.end();
+	});
+
+	t.test('Object.prototype pollution', function (st) {
+		/* eslint no-extend-native: 1 */
+		var nonKey = 'not a core module';
+		st.teardown(function () {
+			delete Object.prototype.fs;
+			delete Object.prototype.path;
+			delete Object.prototype.http;
+			delete Object.prototype[nonKey];
+		});
+		Object.prototype.fs = false;
+		Object.prototype.path = '>= 999999999';
+		Object.prototype.http = data.http;
+		Object.prototype[nonKey] = true;
+
+		st.equal(isCore('fs'), true, 'fs is a core module even if Object.prototype lies');
+		st.equal(isCore('path'), true, 'path is a core module even if Object.prototype lies');
+		st.equal(isCore('http'), true, 'path is a core module even if Object.prototype matches data');
+		st.equal(isCore(nonKey), false, '"' + nonKey + '" is not a core module even if Object.prototype lies');
+
+		st.end();
+	});
+
+	t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/is-plain-object/LICENSE b/node_modules/mathjs/examples/node_modules/is-plain-object/LICENSE
new file mode 100644
index 0000000..3f2eca1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-plain-object/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2017, Jon Schlinkert.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/is-plain-object/README.md b/node_modules/mathjs/examples/node_modules/is-plain-object/README.md
new file mode 100644
index 0000000..1f9d0c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-plain-object/README.md
@@ -0,0 +1,104 @@
+# is-plain-object [![NPM version](https://img.shields.io/npm/v/is-plain-object.svg?style=flat)](https://www.npmjs.com/package/is-plain-object) [![NPM monthly downloads](https://img.shields.io/npm/dm/is-plain-object.svg?style=flat)](https://npmjs.org/package/is-plain-object) [![NPM total downloads](https://img.shields.io/npm/dt/is-plain-object.svg?style=flat)](https://npmjs.org/package/is-plain-object) [![Linux Build Status](https://img.shields.io/travis/jonschlinkert/is-plain-object.svg?style=flat&label=Travis)](https://travis-ci.org/jonschlinkert/is-plain-object)
+
+> Returns true if an object was created by the `Object` constructor.
+
+## Install
+
+Install with [npm](https://www.npmjs.com/):
+
+```sh
+$ npm install --save is-plain-object
+```
+
+Use [isobject](https://github.com/jonschlinkert/isobject) if you only want to check if the value is an object and not an array or null.
+
+## Usage
+
+```js
+var isPlainObject = require('is-plain-object');
+```
+
+**true** when created by the `Object` constructor.
+
+```js
+isPlainObject(Object.create({}));
+//=> true
+isPlainObject(Object.create(Object.prototype));
+//=> true
+isPlainObject({foo: 'bar'});
+//=> true
+isPlainObject({});
+//=> true
+```
+
+**false** when not created by the `Object` constructor.
+
+```js
+isPlainObject(1);
+//=> false
+isPlainObject(['foo', 'bar']);
+//=> false
+isPlainObject([]);
+//=> false
+isPlainObject(new Foo);
+//=> false
+isPlainObject(null);
+//=> false
+isPlainObject(Object.create(null));
+//=> false
+```
+
+## About
+
+### Related projects
+
+* [is-number](https://www.npmjs.com/package/is-number): Returns true if the value is a number. comprehensive tests. | [homepage](https://github.com/jonschlinkert/is-number "Returns true if the value is a number. comprehensive tests.")
+* [isobject](https://www.npmjs.com/package/isobject): Returns true if the value is an object and not an array or null. | [homepage](https://github.com/jonschlinkert/isobject "Returns true if the value is an object and not an array or null.")
+* [kind-of](https://www.npmjs.com/package/kind-of): Get the native type of a value. | [homepage](https://github.com/jonschlinkert/kind-of "Get the native type of a value.")
+
+### Contributing
+
+Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
+
+### Contributors
+
+| **Commits** | **Contributor** | 
+| --- | --- |
+| 17 | [jonschlinkert](https://github.com/jonschlinkert) |
+| 6 | [stevenvachon](https://github.com/stevenvachon) |
+| 3 | [onokumus](https://github.com/onokumus) |
+| 1 | [wtgtybhertgeghgtwtg](https://github.com/wtgtybhertgeghgtwtg) |
+
+### Building docs
+
+_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_
+
+To generate the readme, run the following command:
+
+```sh
+$ npm install -g verbose/verb#dev verb-generate-readme && verb
+```
+
+### Running tests
+
+Running and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command:
+
+```sh
+$ npm install && npm test
+```
+
+### Author
+
+**Jon Schlinkert**
+
+* [github/jonschlinkert](https://github.com/jonschlinkert)
+* [twitter/jonschlinkert](https://twitter.com/jonschlinkert)
+
+### License
+
+Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
+Released under the [MIT License](LICENSE).
+
+***
+
+_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.6.0, on July 11, 2017._
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/is-plain-object/index.d.ts b/node_modules/mathjs/examples/node_modules/is-plain-object/index.d.ts
new file mode 100644
index 0000000..74a44e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-plain-object/index.d.ts
@@ -0,0 +1,5 @@
+export = isPlainObject;
+
+declare function isPlainObject(o: any): boolean;
+
+declare namespace isPlainObject {}
diff --git a/node_modules/mathjs/examples/node_modules/is-plain-object/index.js b/node_modules/mathjs/examples/node_modules/is-plain-object/index.js
new file mode 100644
index 0000000..c328484
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-plain-object/index.js
@@ -0,0 +1,37 @@
+/*!
+ * is-plain-object <https://github.com/jonschlinkert/is-plain-object>
+ *
+ * Copyright (c) 2014-2017, Jon Schlinkert.
+ * Released under the MIT License.
+ */
+
+'use strict';
+
+var isObject = require('isobject');
+
+function isObjectObject(o) {
+  return isObject(o) === true
+    && Object.prototype.toString.call(o) === '[object Object]';
+}
+
+module.exports = function isPlainObject(o) {
+  var ctor,prot;
+
+  if (isObjectObject(o) === false) return false;
+
+  // If has modified constructor
+  ctor = o.constructor;
+  if (typeof ctor !== 'function') return false;
+
+  // If has modified prototype
+  prot = ctor.prototype;
+  if (isObjectObject(prot) === false) return false;
+
+  // If constructor does not have an Object-specific method
+  if (prot.hasOwnProperty('isPrototypeOf') === false) {
+    return false;
+  }
+
+  // Most likely a plain Object
+  return true;
+};
diff --git a/node_modules/mathjs/examples/node_modules/is-plain-object/package.json b/node_modules/mathjs/examples/node_modules/is-plain-object/package.json
new file mode 100644
index 0000000..dd60498
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-plain-object/package.json
@@ -0,0 +1,79 @@
+{
+  "name": "is-plain-object",
+  "description": "Returns true if an object was created by the `Object` constructor.",
+  "version": "2.0.4",
+  "homepage": "https://github.com/jonschlinkert/is-plain-object",
+  "author": "Jon Schlinkert (https://github.com/jonschlinkert)",
+  "contributors": [
+    "Jon Schlinkert (http://twitter.com/jonschlinkert)",
+    "Osman Nuri Okumuş (http://onokumus.com)",
+    "Steven Vachon (https://svachon.com)",
+    "(https://github.com/wtgtybhertgeghgtwtg)"
+  ],
+  "repository": "jonschlinkert/is-plain-object",
+  "bugs": {
+    "url": "https://github.com/jonschlinkert/is-plain-object/issues"
+  },
+  "license": "MIT",
+  "files": [
+    "index.d.ts",
+    "index.js"
+  ],
+  "main": "index.js",
+  "engines": {
+    "node": ">=0.10.0"
+  },
+  "scripts": {
+    "browserify": "browserify index.js --standalone isPlainObject | uglifyjs --compress --mangle -o browser/is-plain-object.js",
+    "test_browser": "mocha-phantomjs test/browser.html",
+    "test_node": "mocha",
+    "test": "npm run test_node && npm run browserify && npm run test_browser"
+  },
+  "dependencies": {
+    "isobject": "^3.0.1"
+  },
+  "devDependencies": {
+    "browserify": "^14.4.0",
+    "chai": "^4.0.2",
+    "gulp-format-md": "^1.0.0",
+    "mocha": "^3.4.2",
+    "mocha-phantomjs": "^4.1.0",
+    "phantomjs": "^2.1.7",
+    "uglify-js": "^3.0.24"
+  },
+  "keywords": [
+    "check",
+    "is",
+    "is-object",
+    "isobject",
+    "javascript",
+    "kind",
+    "kind-of",
+    "object",
+    "plain",
+    "type",
+    "typeof",
+    "value"
+  ],
+  "types": "index.d.ts",
+  "verb": {
+    "toc": false,
+    "layout": "default",
+    "tasks": [
+      "readme"
+    ],
+    "plugins": [
+      "gulp-format-md"
+    ],
+    "related": {
+      "list": [
+        "is-number",
+        "isobject",
+        "kind-of"
+      ]
+    },
+    "lint": {
+      "reflinks": true
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/is-stream/index.d.ts b/node_modules/mathjs/examples/node_modules/is-stream/index.d.ts
new file mode 100644
index 0000000..eee2e83
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-stream/index.d.ts
@@ -0,0 +1,79 @@
+import * as stream from 'stream';
+
+declare const isStream: {
+	/**
+	@returns Whether `stream` is a [`Stream`](https://nodejs.org/api/stream.html#stream_stream).
+
+	@example
+	```
+	import * as fs from 'fs';
+	import isStream = require('is-stream');
+
+	isStream(fs.createReadStream('unicorn.png'));
+	//=> true
+
+	isStream({});
+	//=> false
+	```
+	*/
+	(stream: unknown): stream is stream.Stream;
+
+	/**
+	@returns Whether `stream` is a [`stream.Writable`](https://nodejs.org/api/stream.html#stream_class_stream_writable).
+
+	@example
+	```
+	import * as fs from 'fs';
+	import isStream = require('is-stream');
+
+	isStream.writable(fs.createWriteStrem('unicorn.txt'));
+	//=> true
+	```
+	*/
+	writable(stream: unknown): stream is stream.Writable;
+
+	/**
+	@returns Whether `stream` is a [`stream.Readable`](https://nodejs.org/api/stream.html#stream_class_stream_readable).
+
+	@example
+	```
+	import * as fs from 'fs';
+	import isStream = require('is-stream');
+
+	isStream.readable(fs.createReadStream('unicorn.png'));
+	//=> true
+	```
+	*/
+	readable(stream: unknown): stream is stream.Readable;
+
+	/**
+	@returns Whether `stream` is a [`stream.Duplex`](https://nodejs.org/api/stream.html#stream_class_stream_duplex).
+
+	@example
+	```
+	import {Duplex} from 'stream';
+	import isStream = require('is-stream');
+
+	isStream.duplex(new Duplex());
+	//=> true
+	```
+	*/
+	duplex(stream: unknown): stream is stream.Duplex;
+
+	/**
+	@returns Whether `stream` is a [`stream.Transform`](https://nodejs.org/api/stream.html#stream_class_stream_transform).
+
+	@example
+	```
+	import * as fs from 'fs';
+	import Stringify = require('streaming-json-stringify');
+	import isStream = require('is-stream');
+
+	isStream.transform(Stringify());
+	//=> true
+	```
+	*/
+	transform(input: unknown): input is stream.Transform;
+};
+
+export = isStream;
diff --git a/node_modules/mathjs/examples/node_modules/is-stream/index.js b/node_modules/mathjs/examples/node_modules/is-stream/index.js
new file mode 100644
index 0000000..2e43434
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-stream/index.js
@@ -0,0 +1,28 @@
+'use strict';
+
+const isStream = stream =>
+	stream !== null &&
+	typeof stream === 'object' &&
+	typeof stream.pipe === 'function';
+
+isStream.writable = stream =>
+	isStream(stream) &&
+	stream.writable !== false &&
+	typeof stream._write === 'function' &&
+	typeof stream._writableState === 'object';
+
+isStream.readable = stream =>
+	isStream(stream) &&
+	stream.readable !== false &&
+	typeof stream._read === 'function' &&
+	typeof stream._readableState === 'object';
+
+isStream.duplex = stream =>
+	isStream.writable(stream) &&
+	isStream.readable(stream);
+
+isStream.transform = stream =>
+	isStream.duplex(stream) &&
+	typeof stream._transform === 'function';
+
+module.exports = isStream;
diff --git a/node_modules/mathjs/examples/node_modules/is-stream/license b/node_modules/mathjs/examples/node_modules/is-stream/license
new file mode 100644
index 0000000..fa7ceba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-stream/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/is-stream/package.json b/node_modules/mathjs/examples/node_modules/is-stream/package.json
new file mode 100644
index 0000000..c3b5673
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-stream/package.json
@@ -0,0 +1,42 @@
+{
+	"name": "is-stream",
+	"version": "2.0.1",
+	"description": "Check if something is a Node.js stream",
+	"license": "MIT",
+	"repository": "sindresorhus/is-stream",
+	"funding": "https://github.com/sponsors/sindresorhus",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"stream",
+		"type",
+		"streams",
+		"writable",
+		"readable",
+		"duplex",
+		"transform",
+		"check",
+		"detect",
+		"is"
+	],
+	"devDependencies": {
+		"@types/node": "^11.13.6",
+		"ava": "^1.4.1",
+		"tempy": "^0.3.0",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/is-stream/readme.md b/node_modules/mathjs/examples/node_modules/is-stream/readme.md
new file mode 100644
index 0000000..19308e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/is-stream/readme.md
@@ -0,0 +1,60 @@
+# is-stream
+
+> Check if something is a [Node.js stream](https://nodejs.org/api/stream.html)
+
+## Install
+
+```
+$ npm install is-stream
+```
+
+## Usage
+
+```js
+const fs = require('fs');
+const isStream = require('is-stream');
+
+isStream(fs.createReadStream('unicorn.png'));
+//=> true
+
+isStream({});
+//=> false
+```
+
+## API
+
+### isStream(stream)
+
+Returns a `boolean` for whether it's a [`Stream`](https://nodejs.org/api/stream.html#stream_stream).
+
+#### isStream.writable(stream)
+
+Returns a `boolean` for whether it's a [`stream.Writable`](https://nodejs.org/api/stream.html#stream_class_stream_writable).
+
+#### isStream.readable(stream)
+
+Returns a `boolean` for whether it's a [`stream.Readable`](https://nodejs.org/api/stream.html#stream_class_stream_readable).
+
+#### isStream.duplex(stream)
+
+Returns a `boolean` for whether it's a [`stream.Duplex`](https://nodejs.org/api/stream.html#stream_class_stream_duplex).
+
+#### isStream.transform(stream)
+
+Returns a `boolean` for whether it's a [`stream.Transform`](https://nodejs.org/api/stream.html#stream_class_stream_transform).
+
+## Related
+
+- [is-file-stream](https://github.com/jamestalmage/is-file-stream) - Detect if a stream is a file stream
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-is-stream?utm_source=npm-is-stream&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/isexe/LICENSE b/node_modules/mathjs/examples/node_modules/isexe/LICENSE
new file mode 100644
index 0000000..19129e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isexe/LICENSE
@@ -0,0 +1,15 @@
+The ISC License
+
+Copyright (c) Isaac Z. Schlueter and Contributors
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
+IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/isexe/README.md b/node_modules/mathjs/examples/node_modules/isexe/README.md
new file mode 100644
index 0000000..35769e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isexe/README.md
@@ -0,0 +1,51 @@
+# isexe
+
+Minimal module to check if a file is executable, and a normal file.
+
+Uses `fs.stat` and tests against the `PATHEXT` environment variable on
+Windows.
+
+## USAGE
+
+```javascript
+var isexe = require('isexe')
+isexe('some-file-name', function (err, isExe) {
+  if (err) {
+    console.error('probably file does not exist or something', err)
+  } else if (isExe) {
+    console.error('this thing can be run')
+  } else {
+    console.error('cannot be run')
+  }
+})
+
+// same thing but synchronous, throws errors
+var isExe = isexe.sync('some-file-name')
+
+// treat errors as just "not executable"
+isexe('maybe-missing-file', { ignoreErrors: true }, callback)
+var isExe = isexe.sync('maybe-missing-file', { ignoreErrors: true })
+```
+
+## API
+
+### `isexe(path, [options], [callback])`
+
+Check if the path is executable.  If no callback provided, and a
+global `Promise` object is available, then a Promise will be returned.
+
+Will raise whatever errors may be raised by `fs.stat`, unless
+`options.ignoreErrors` is set to true.
+
+### `isexe.sync(path, [options])`
+
+Same as `isexe` but returns the value and throws any errors raised.
+
+### Options
+
+* `ignoreErrors` Treat all errors as "no, this is not executable", but
+  don't raise them.
+* `uid` Number to use as the user id
+* `gid` Number to use as the group id
+* `pathExt` List of path extensions to use instead of `PATHEXT`
+  environment variable on Windows.
diff --git a/node_modules/mathjs/examples/node_modules/isexe/index.js b/node_modules/mathjs/examples/node_modules/isexe/index.js
new file mode 100644
index 0000000..553fb32
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isexe/index.js
@@ -0,0 +1,57 @@
+var fs = require('fs')
+var core
+if (process.platform === 'win32' || global.TESTING_WINDOWS) {
+  core = require('./windows.js')
+} else {
+  core = require('./mode.js')
+}
+
+module.exports = isexe
+isexe.sync = sync
+
+function isexe (path, options, cb) {
+  if (typeof options === 'function') {
+    cb = options
+    options = {}
+  }
+
+  if (!cb) {
+    if (typeof Promise !== 'function') {
+      throw new TypeError('callback not provided')
+    }
+
+    return new Promise(function (resolve, reject) {
+      isexe(path, options || {}, function (er, is) {
+        if (er) {
+          reject(er)
+        } else {
+          resolve(is)
+        }
+      })
+    })
+  }
+
+  core(path, options || {}, function (er, is) {
+    // ignore EACCES because that just means we aren't allowed to run it
+    if (er) {
+      if (er.code === 'EACCES' || options && options.ignoreErrors) {
+        er = null
+        is = false
+      }
+    }
+    cb(er, is)
+  })
+}
+
+function sync (path, options) {
+  // my kingdom for a filtered catch
+  try {
+    return core.sync(path, options || {})
+  } catch (er) {
+    if (options && options.ignoreErrors || er.code === 'EACCES') {
+      return false
+    } else {
+      throw er
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/isexe/mode.js b/node_modules/mathjs/examples/node_modules/isexe/mode.js
new file mode 100644
index 0000000..1995ea4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isexe/mode.js
@@ -0,0 +1,41 @@
+module.exports = isexe
+isexe.sync = sync
+
+var fs = require('fs')
+
+function isexe (path, options, cb) {
+  fs.stat(path, function (er, stat) {
+    cb(er, er ? false : checkStat(stat, options))
+  })
+}
+
+function sync (path, options) {
+  return checkStat(fs.statSync(path), options)
+}
+
+function checkStat (stat, options) {
+  return stat.isFile() && checkMode(stat, options)
+}
+
+function checkMode (stat, options) {
+  var mod = stat.mode
+  var uid = stat.uid
+  var gid = stat.gid
+
+  var myUid = options.uid !== undefined ?
+    options.uid : process.getuid && process.getuid()
+  var myGid = options.gid !== undefined ?
+    options.gid : process.getgid && process.getgid()
+
+  var u = parseInt('100', 8)
+  var g = parseInt('010', 8)
+  var o = parseInt('001', 8)
+  var ug = u | g
+
+  var ret = (mod & o) ||
+    (mod & g) && gid === myGid ||
+    (mod & u) && uid === myUid ||
+    (mod & ug) && myUid === 0
+
+  return ret
+}
diff --git a/node_modules/mathjs/examples/node_modules/isexe/package.json b/node_modules/mathjs/examples/node_modules/isexe/package.json
new file mode 100644
index 0000000..e452689
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isexe/package.json
@@ -0,0 +1,31 @@
+{
+  "name": "isexe",
+  "version": "2.0.0",
+  "description": "Minimal module to check if a file is executable.",
+  "main": "index.js",
+  "directories": {
+    "test": "test"
+  },
+  "devDependencies": {
+    "mkdirp": "^0.5.1",
+    "rimraf": "^2.5.0",
+    "tap": "^10.3.0"
+  },
+  "scripts": {
+    "test": "tap test/*.js --100",
+    "preversion": "npm test",
+    "postversion": "npm publish",
+    "postpublish": "git push origin --all; git push origin --tags"
+  },
+  "author": "Isaac Z. Schlueter <i@izs.me> (http://blog.izs.me/)",
+  "license": "ISC",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/isaacs/isexe.git"
+  },
+  "keywords": [],
+  "bugs": {
+    "url": "https://github.com/isaacs/isexe/issues"
+  },
+  "homepage": "https://github.com/isaacs/isexe#readme"
+}
diff --git a/node_modules/mathjs/examples/node_modules/isexe/test/basic.js b/node_modules/mathjs/examples/node_modules/isexe/test/basic.js
new file mode 100644
index 0000000..d926df6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isexe/test/basic.js
@@ -0,0 +1,221 @@
+var t = require('tap')
+var fs = require('fs')
+var path = require('path')
+var fixture = path.resolve(__dirname, 'fixtures')
+var meow = fixture + '/meow.cat'
+var mine = fixture + '/mine.cat'
+var ours = fixture + '/ours.cat'
+var fail = fixture + '/fail.false'
+var noent = fixture + '/enoent.exe'
+var mkdirp = require('mkdirp')
+var rimraf = require('rimraf')
+
+var isWindows = process.platform === 'win32'
+var hasAccess = typeof fs.access === 'function'
+var winSkip = isWindows && 'windows'
+var accessSkip = !hasAccess && 'no fs.access function'
+var hasPromise = typeof Promise === 'function'
+var promiseSkip = !hasPromise && 'no global Promise'
+
+function reset () {
+  delete require.cache[require.resolve('../')]
+  return require('../')
+}
+
+t.test('setup fixtures', function (t) {
+  rimraf.sync(fixture)
+  mkdirp.sync(fixture)
+  fs.writeFileSync(meow, '#!/usr/bin/env cat\nmeow\n')
+  fs.chmodSync(meow, parseInt('0755', 8))
+  fs.writeFileSync(fail, '#!/usr/bin/env false\n')
+  fs.chmodSync(fail, parseInt('0644', 8))
+  fs.writeFileSync(mine, '#!/usr/bin/env cat\nmine\n')
+  fs.chmodSync(mine, parseInt('0744', 8))
+  fs.writeFileSync(ours, '#!/usr/bin/env cat\nours\n')
+  fs.chmodSync(ours, parseInt('0754', 8))
+  t.end()
+})
+
+t.test('promise', { skip: promiseSkip }, function (t) {
+  var isexe = reset()
+  t.test('meow async', function (t) {
+    isexe(meow).then(function (is) {
+      t.ok(is)
+      t.end()
+    })
+  })
+  t.test('fail async', function (t) {
+    isexe(fail).then(function (is) {
+      t.notOk(is)
+      t.end()
+    })
+  })
+  t.test('noent async', function (t) {
+    isexe(noent).catch(function (er) {
+      t.ok(er)
+      t.end()
+    })
+  })
+  t.test('noent ignore async', function (t) {
+    isexe(noent, { ignoreErrors: true }).then(function (is) {
+      t.notOk(is)
+      t.end()
+    })
+  })
+  t.end()
+})
+
+t.test('no promise', function (t) {
+  global.Promise = null
+  var isexe = reset()
+  t.throws('try to meow a promise', function () {
+    isexe(meow)
+  })
+  t.end()
+})
+
+t.test('access', { skip: accessSkip || winSkip }, function (t) {
+  runTest(t)
+})
+
+t.test('mode', { skip: winSkip }, function (t) {
+  delete fs.access
+  delete fs.accessSync
+  var isexe = reset()
+  t.ok(isexe.sync(ours, { uid: 0, gid: 0 }))
+  t.ok(isexe.sync(mine, { uid: 0, gid: 0 }))
+  runTest(t)
+})
+
+t.test('windows', function (t) {
+  global.TESTING_WINDOWS = true
+  var pathExt = '.EXE;.CAT;.CMD;.COM'
+  t.test('pathExt option', function (t) {
+    runTest(t, { pathExt: '.EXE;.CAT;.CMD;.COM' })
+  })
+  t.test('pathExt env', function (t) {
+    process.env.PATHEXT = pathExt
+    runTest(t)
+  })
+  t.test('no pathExt', function (t) {
+    // with a pathExt of '', any filename is fine.
+    // so the "fail" one would still pass.
+    runTest(t, { pathExt: '', skipFail: true })
+  })
+  t.test('pathext with empty entry', function (t) {
+    // with a pathExt of '', any filename is fine.
+    // so the "fail" one would still pass.
+    runTest(t, { pathExt: ';' + pathExt, skipFail: true })
+  })
+  t.end()
+})
+
+t.test('cleanup', function (t) {
+  rimraf.sync(fixture)
+  t.end()
+})
+
+function runTest (t, options) {
+  var isexe = reset()
+
+  var optionsIgnore = Object.create(options || {})
+  optionsIgnore.ignoreErrors = true
+
+  if (!options || !options.skipFail) {
+    t.notOk(isexe.sync(fail, options))
+  }
+  t.notOk(isexe.sync(noent, optionsIgnore))
+  if (!options) {
+    t.ok(isexe.sync(meow))
+  } else {
+    t.ok(isexe.sync(meow, options))
+  }
+
+  t.ok(isexe.sync(mine, options))
+  t.ok(isexe.sync(ours, options))
+  t.throws(function () {
+    isexe.sync(noent, options)
+  })
+
+  t.test('meow async', function (t) {
+    if (!options) {
+      isexe(meow, function (er, is) {
+        if (er) {
+          throw er
+        }
+        t.ok(is)
+        t.end()
+      })
+    } else {
+      isexe(meow, options, function (er, is) {
+        if (er) {
+          throw er
+        }
+        t.ok(is)
+        t.end()
+      })
+    }
+  })
+
+  t.test('mine async', function (t) {
+    isexe(mine, options, function (er, is) {
+      if (er) {
+        throw er
+      }
+      t.ok(is)
+      t.end()
+    })
+  })
+
+  t.test('ours async', function (t) {
+    isexe(ours, options, function (er, is) {
+      if (er) {
+        throw er
+      }
+      t.ok(is)
+      t.end()
+    })
+  })
+
+  if (!options || !options.skipFail) {
+    t.test('fail async', function (t) {
+      isexe(fail, options, function (er, is) {
+        if (er) {
+          throw er
+        }
+        t.notOk(is)
+        t.end()
+      })
+    })
+  }
+
+  t.test('noent async', function (t) {
+    isexe(noent, options, function (er, is) {
+      t.ok(er)
+      t.notOk(is)
+      t.end()
+    })
+  })
+
+  t.test('noent ignore async', function (t) {
+    isexe(noent, optionsIgnore, function (er, is) {
+      if (er) {
+        throw er
+      }
+      t.notOk(is)
+      t.end()
+    })
+  })
+
+  t.test('directory is not executable', function (t) {
+    isexe(__dirname, options, function (er, is) {
+      if (er) {
+        throw er
+      }
+      t.notOk(is)
+      t.end()
+    })
+  })
+
+  t.end()
+}
diff --git a/node_modules/mathjs/examples/node_modules/isexe/windows.js b/node_modules/mathjs/examples/node_modules/isexe/windows.js
new file mode 100644
index 0000000..3499673
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isexe/windows.js
@@ -0,0 +1,42 @@
+module.exports = isexe
+isexe.sync = sync
+
+var fs = require('fs')
+
+function checkPathExt (path, options) {
+  var pathext = options.pathExt !== undefined ?
+    options.pathExt : process.env.PATHEXT
+
+  if (!pathext) {
+    return true
+  }
+
+  pathext = pathext.split(';')
+  if (pathext.indexOf('') !== -1) {
+    return true
+  }
+  for (var i = 0; i < pathext.length; i++) {
+    var p = pathext[i].toLowerCase()
+    if (p && path.substr(-p.length).toLowerCase() === p) {
+      return true
+    }
+  }
+  return false
+}
+
+function checkStat (stat, path, options) {
+  if (!stat.isSymbolicLink() && !stat.isFile()) {
+    return false
+  }
+  return checkPathExt(path, options)
+}
+
+function isexe (path, options, cb) {
+  fs.stat(path, function (er, stat) {
+    cb(er, er ? false : checkStat(stat, path, options))
+  })
+}
+
+function sync (path, options) {
+  return checkStat(fs.statSync(path), path, options)
+}
diff --git a/node_modules/mathjs/examples/node_modules/isobject/LICENSE b/node_modules/mathjs/examples/node_modules/isobject/LICENSE
new file mode 100644
index 0000000..943e71d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isobject/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2017, Jon Schlinkert.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/isobject/README.md b/node_modules/mathjs/examples/node_modules/isobject/README.md
new file mode 100644
index 0000000..d01feaa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isobject/README.md
@@ -0,0 +1,122 @@
+# isobject [![NPM version](https://img.shields.io/npm/v/isobject.svg?style=flat)](https://www.npmjs.com/package/isobject) [![NPM monthly downloads](https://img.shields.io/npm/dm/isobject.svg?style=flat)](https://npmjs.org/package/isobject)  [![NPM total downloads](https://img.shields.io/npm/dt/isobject.svg?style=flat)](https://npmjs.org/package/isobject) [![Linux Build Status](https://img.shields.io/travis/jonschlinkert/isobject.svg?style=flat&label=Travis)](https://travis-ci.org/jonschlinkert/isobject)
+
+> Returns true if the value is an object and not an array or null.
+
+## Install
+
+Install with [npm](https://www.npmjs.com/):
+
+```sh
+$ npm install --save isobject
+```
+
+Install with [yarn](https://yarnpkg.com):
+
+```sh
+$ yarn add isobject
+```
+
+Use [is-plain-object](https://github.com/jonschlinkert/is-plain-object) if you want only objects that are created by the `Object` constructor.
+
+## Install
+
+Install with [npm](https://www.npmjs.com/):
+
+```sh
+$ npm install isobject
+```
+Install with [bower](https://bower.io/)
+
+```sh
+$ bower install isobject
+```
+
+## Usage
+
+```js
+var isObject = require('isobject');
+```
+
+**True**
+
+All of the following return `true`:
+
+```js
+isObject({});
+isObject(Object.create({}));
+isObject(Object.create(Object.prototype));
+isObject(Object.create(null));
+isObject({});
+isObject(new Foo);
+isObject(/foo/);
+```
+
+**False**
+
+All of the following return `false`:
+
+```js
+isObject();
+isObject(function () {});
+isObject(1);
+isObject([]);
+isObject(undefined);
+isObject(null);
+```
+
+## About
+
+### Related projects
+
+* [extend-shallow](https://www.npmjs.com/package/extend-shallow): Extend an object with the properties of additional objects. node.js/javascript util. | [homepage](https://github.com/jonschlinkert/extend-shallow "Extend an object with the properties of additional objects. node.js/javascript util.")
+* [is-plain-object](https://www.npmjs.com/package/is-plain-object): Returns true if an object was created by the `Object` constructor. | [homepage](https://github.com/jonschlinkert/is-plain-object "Returns true if an object was created by the `Object` constructor.")
+* [kind-of](https://www.npmjs.com/package/kind-of): Get the native type of a value. | [homepage](https://github.com/jonschlinkert/kind-of "Get the native type of a value.")
+* [merge-deep](https://www.npmjs.com/package/merge-deep): Recursively merge values in a javascript object. | [homepage](https://github.com/jonschlinkert/merge-deep "Recursively merge values in a javascript object.")
+
+### Contributing
+
+Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
+
+### Contributors
+
+| **Commits** | **Contributor** |  
+| --- | --- |  
+| 29 | [jonschlinkert](https://github.com/jonschlinkert) |  
+| 4  | [doowb](https://github.com/doowb) |  
+| 1  | [magnudae](https://github.com/magnudae) |  
+| 1  | [LeSuisse](https://github.com/LeSuisse) |  
+| 1  | [tmcw](https://github.com/tmcw) |  
+
+### Building docs
+
+_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_
+
+To generate the readme, run the following command:
+
+```sh
+$ npm install -g verbose/verb#dev verb-generate-readme && verb
+```
+
+### Running tests
+
+Running and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command:
+
+```sh
+$ npm install && npm test
+```
+
+### Author
+
+**Jon Schlinkert**
+
+* [github/jonschlinkert](https://github.com/jonschlinkert)
+* [twitter/jonschlinkert](https://twitter.com/jonschlinkert)
+
+### License
+
+Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
+Released under the [MIT License](LICENSE).
+
+***
+
+_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.6.0, on June 30, 2017._
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/isobject/index.d.ts b/node_modules/mathjs/examples/node_modules/isobject/index.d.ts
new file mode 100644
index 0000000..55f81c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isobject/index.d.ts
@@ -0,0 +1,5 @@
+export = isObject;
+
+declare function isObject(val: any): boolean;
+
+declare namespace isObject {}
diff --git a/node_modules/mathjs/examples/node_modules/isobject/index.js b/node_modules/mathjs/examples/node_modules/isobject/index.js
new file mode 100644
index 0000000..2d59958
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isobject/index.js
@@ -0,0 +1,12 @@
+/*!
+ * isobject <https://github.com/jonschlinkert/isobject>
+ *
+ * Copyright (c) 2014-2017, Jon Schlinkert.
+ * Released under the MIT License.
+ */
+
+'use strict';
+
+module.exports = function isObject(val) {
+  return val != null && typeof val === 'object' && Array.isArray(val) === false;
+};
diff --git a/node_modules/mathjs/examples/node_modules/isobject/package.json b/node_modules/mathjs/examples/node_modules/isobject/package.json
new file mode 100644
index 0000000..62aa8c1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/isobject/package.json
@@ -0,0 +1,74 @@
+{
+  "name": "isobject",
+  "description": "Returns true if the value is an object and not an array or null.",
+  "version": "3.0.1",
+  "homepage": "https://github.com/jonschlinkert/isobject",
+  "author": "Jon Schlinkert (https://github.com/jonschlinkert)",
+  "contributors": [
+    "(https://github.com/LeSuisse)",
+    "Brian Woodward (https://twitter.com/doowb)",
+    "Jon Schlinkert (http://twitter.com/jonschlinkert)",
+    "Magnús Dæhlen (https://github.com/magnudae)",
+    "Tom MacWright (https://macwright.org)"
+  ],
+  "repository": "jonschlinkert/isobject",
+  "bugs": {
+    "url": "https://github.com/jonschlinkert/isobject/issues"
+  },
+  "license": "MIT",
+  "files": [
+    "index.d.ts",
+    "index.js"
+  ],
+  "main": "index.js",
+  "engines": {
+    "node": ">=0.10.0"
+  },
+  "scripts": {
+    "test": "mocha"
+  },
+  "dependencies": {},
+  "devDependencies": {
+    "gulp-format-md": "^0.1.9",
+    "mocha": "^2.4.5"
+  },
+  "keywords": [
+    "check",
+    "is",
+    "is-object",
+    "isobject",
+    "kind",
+    "kind-of",
+    "kindof",
+    "native",
+    "object",
+    "type",
+    "typeof",
+    "value"
+  ],
+  "types": "index.d.ts",
+  "verb": {
+    "related": {
+      "list": [
+        "extend-shallow",
+        "is-plain-object",
+        "kind-of",
+        "merge-deep"
+      ]
+    },
+    "toc": false,
+    "layout": "default",
+    "tasks": [
+      "readme"
+    ],
+    "plugins": [
+      "gulp-format-md"
+    ],
+    "lint": {
+      "reflinks": true
+    },
+    "reflinks": [
+      "verb"
+    ]
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/LICENSE b/node_modules/mathjs/examples/node_modules/jest-worker/LICENSE
new file mode 100644
index 0000000..b96dcb0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Facebook, Inc. and its affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/README.md b/node_modules/mathjs/examples/node_modules/jest-worker/README.md
new file mode 100644
index 0000000..0727a04
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/README.md
@@ -0,0 +1,247 @@
+# jest-worker
+
+Module for executing heavy tasks under forked processes in parallel, by providing a `Promise` based interface, minimum overhead, and bound workers.
+
+The module works by providing an absolute path of the module to be loaded in all forked processes. Files relative to a node module are also accepted. All methods are exposed on the parent process as promises, so they can be `await`'ed. Child (worker) methods can either be synchronous or asynchronous.
+
+The module also implements support for bound workers. Binding a worker means that, based on certain parameters, the same task will always be executed by the same worker. The way bound workers work is by using the returned string of the `computeWorkerKey` method. If the string was used before for a task, the call will be queued to the related worker that processed the task earlier; if not, it will be executed by the first available worker, then sticked to the worker that executed it; so the next time it will be processed by the same worker. If you have no preference on the worker executing the task, but you have defined a `computeWorkerKey` method because you want _some_ of the tasks to be sticked, you can return `null` from it.
+
+The list of exposed methods can be explicitly provided via the `exposedMethods` option. If it is not provided, it will be obtained by requiring the child module into the main process, and analyzed via reflection. Check the "minimal example" section for a valid one.
+
+## Install
+
+```sh
+$ yarn add jest-worker
+```
+
+## Example
+
+This example covers the minimal usage:
+
+### File `parent.js`
+
+```javascript
+import {Worker as JestWorker} from 'jest-worker';
+
+async function main() {
+  const worker = new JestWorker(require.resolve('./Worker'));
+  const result = await worker.hello('Alice'); // "Hello, Alice"
+}
+
+main();
+```
+
+### File `worker.js`
+
+```javascript
+export function hello(param) {
+  return 'Hello, ' + param;
+}
+```
+
+## Experimental worker
+
+Node 10 shipped with [worker-threads](https://nodejs.org/api/worker_threads.html), a "threading API" that uses SharedArrayBuffers to communicate between the main process and its child threads. This experimental Node feature can significantly improve the communication time between parent and child processes in `jest-worker`.
+
+Since `worker_threads` are considered experimental in Node, you have to opt-in to this behavior by passing `enableWorkerThreads: true` when instantiating the worker. While the feature was unflagged in Node 11.7.0, you'll need to run the Node process with the `--experimental-worker` flag for Node 10.
+
+## API
+
+The `Worker` export is a constructor that is initialized by passing the worker path, plus an options object.
+
+### `workerPath: string` (required)
+
+Node module name or absolute path of the file to be loaded in the child processes. Use `require.resolve` to transform a relative path into an absolute one.
+
+### `options: Object` (optional)
+
+#### `exposedMethods: $ReadOnlyArray<string>` (optional)
+
+List of method names that can be called on the child processes from the parent process. You cannot expose any method named like a public `Worker` method, or starting with `_`. If you use method auto-discovery, then these methods will not be exposed, even if they exist.
+
+#### `numWorkers: number` (optional)
+
+Amount of workers to spawn. Defaults to the number of CPUs minus 1.
+
+#### `maxRetries: number` (optional)
+
+Maximum amount of times that a dead child can be re-spawned, per call. Defaults to `3`, pass `Infinity` to allow endless retries.
+
+#### `forkOptions: Object` (optional)
+
+Allow customizing all options passed to `childProcess.fork`. By default, some values are set (`cwd`, `env` and `execArgv`), but you can override them and customize the rest. For a list of valid values, check [the Node documentation](https://nodejs.org/api/child_process.html#child_process_child_process_fork_modulepath_args_options).
+
+#### `computeWorkerKey: (method: string, ...args: Array<any>) => ?string` (optional)
+
+Every time a method exposed via the API is called, `computeWorkerKey` is also called in order to bound the call to a worker. This is useful for workers that are able to cache the result or part of it. You bound calls to a worker by making `computeWorkerKey` return the same identifier for all different calls. If you do not want to bind the call to any worker, return `null`.
+
+The callback you provide is called with the method name, plus all the rest of the arguments of the call. Thus, you have full control to decide what to return. Check a practical example on bound workers under the "bound worker usage" section.
+
+By default, no process is bound to any worker.
+
+#### `setupArgs: Array<mixed>` (optional)
+
+The arguments that will be passed to the `setup` method during initialization.
+
+#### `WorkerPool: (workerPath: string, options?: WorkerPoolOptions) => WorkerPoolInterface` (optional)
+
+Provide a custom worker pool to be used for spawning child processes. By default, Jest will use a node thread pool if available and fall back to child process threads.
+
+#### `enableWorkerThreads: boolean` (optional)
+
+`jest-worker` will automatically detect if `worker_threads` are available, but will not use them unless passed `enableWorkerThreads: true`.
+
+### `workerSchedulingPolicy: 'round-robin' | 'in-order'` (optional)
+
+Specifies the policy how tasks are assigned to workers if multiple workers are _idle_:
+
+- `round-robin` (default): The task will be sequentially distributed onto the workers. The first task is assigned to the worker 1, the second to the worker 2, to ensure that the work is distributed across workers.
+- `in-order`: The task will be assigned to the first free worker starting with worker 1 and only assign the work to worker 2 if the worker 1 is busy.
+
+Tasks are always assigned to the first free worker as soon as tasks start to queue up. The scheduling policy does not define the task scheduling which is always first-in, first-out.
+
+### `taskQueue`: TaskQueue` (optional)
+
+The task queue defines in which order tasks (method calls) are processed by the workers. `jest-worker` ships with a `FifoQueue` and `PriorityQueue`:
+
+- `FifoQueue` (default): Processes the method calls (tasks) in the call order.
+- `PriorityQueue`: Processes the method calls by a computed priority in natural ordering (lower priorities first). Tasks with the same priority are processed in any order (FIFO not guaranteed). The constructor accepts a single argument, the function that is passed the name of the called function and the arguments and returns a numerical value for the priority: `new require('jest-worker').PriorityQueue((method, filename) => filename.length)`.
+
+## JestWorker
+
+### Methods
+
+The returned `JestWorker` instance has all the exposed methods, plus some additional ones to interact with the workers itself:
+
+#### `getStdout(): Readable`
+
+Returns a `ReadableStream` where the standard output of all workers is piped. Note that the `silent` option of the child workers must be set to `true` to make it work. This is the default set by `jest-worker`, but keep it in mind when overriding options through `forkOptions`.
+
+#### `getStderr(): Readable`
+
+Returns a `ReadableStream` where the standard error of all workers is piped. Note that the `silent` option of the child workers must be set to `true` to make it work. This is the default set by `jest-worker`, but keep it in mind when overriding options through `forkOptions`.
+
+#### `end()`
+
+Finishes the workers by killing all workers. No further calls can be done to the `Worker` instance.
+
+Returns a Promise that resolves with `{ forceExited: boolean }` once all workers are dead. If `forceExited` is `true`, at least one of the workers did not exit gracefully, which likely happened because it executed a leaky task that left handles open. This should be avoided, force exiting workers is a last resort to prevent creating lots of orphans.
+
+**Note:**
+
+`await`ing the `end()` Promise immediately after the workers are no longer needed before proceeding to do other useful things in your program may not be a good idea. If workers have to be force exited, `jest-worker` may go through multiple stages of force exiting (e.g. SIGTERM, later SIGKILL) and give the worker overall around 1 second time to exit on its own. During this time, your program will wait, even though it may not be necessary that all workers are dead before continuing execution.
+
+Consider deliberately leaving this Promise floating (unhandled resolution). After your program has done the rest of its work and is about to exit, the Node process will wait for the Promise to resolve after all workers are dead as the last event loop task. That way you parallelized computation time of your program and waiting time and you didn't delay the outputs of your program unnecessarily.
+
+### Worker IDs
+
+Each worker has a unique id (index that starts with `1`), which is available inside the worker as `process.env.JEST_WORKER_ID`.
+
+## Setting up and tearing down the child process
+
+The child process can define two special methods (both of them can be asynchronous):
+
+- `setup()`: If defined, it's executed before the first call to any method in the child.
+- `teardown()`: If defined, it's executed when the farm ends.
+
+# More examples
+
+## Standard usage
+
+This example covers the standard usage:
+
+### File `parent.js`
+
+```javascript
+import {Worker as JestWorker} from 'jest-worker';
+
+async function main() {
+  const myWorker = new JestWorker(require.resolve('./Worker'), {
+    exposedMethods: ['foo', 'bar', 'getWorkerId'],
+    numWorkers: 4,
+  });
+
+  console.log(await myWorker.foo('Alice')); // "Hello from foo: Alice"
+  console.log(await myWorker.bar('Bob')); // "Hello from bar: Bob"
+  console.log(await myWorker.getWorkerId()); // "3" -> this message has sent from the 3rd worker
+
+  const {forceExited} = await myWorker.end();
+  if (forceExited) {
+    console.error('Workers failed to exit gracefully');
+  }
+}
+
+main();
+```
+
+### File `worker.js`
+
+```javascript
+export function foo(param) {
+  return 'Hello from foo: ' + param;
+}
+
+export function bar(param) {
+  return 'Hello from bar: ' + param;
+}
+
+export function getWorkerId() {
+  return process.env.JEST_WORKER_ID;
+}
+```
+
+## Bound worker usage:
+
+This example covers the usage with a `computeWorkerKey` method:
+
+### File `parent.js`
+
+```javascript
+import {Worker as JestWorker} from 'jest-worker';
+
+async function main() {
+  const myWorker = new JestWorker(require.resolve('./Worker'), {
+    computeWorkerKey: (method, filename) => filename,
+  });
+
+  // Transform the given file, within the first available worker.
+  console.log(await myWorker.transform('/tmp/foo.js'));
+
+  // Wait a bit.
+  await sleep(10000);
+
+  // Transform the same file again. Will immediately return because the
+  // transformed file is cached in the worker, and `computeWorkerKey` ensures
+  // the same worker that processed the file the first time will process it now.
+  console.log(await myWorker.transform('/tmp/foo.js'));
+
+  const {forceExited} = await myWorker.end();
+  if (forceExited) {
+    console.error('Workers failed to exit gracefully');
+  }
+}
+
+main();
+```
+
+### File `worker.js`
+
+```javascript
+import babel from '@babel/core';
+
+const cache = Object.create(null);
+
+export function transform(filename) {
+  if (cache[filename]) {
+    return cache[filename];
+  }
+
+  // jest-worker can handle both immediate results and thenables. If a
+  // thenable is returned, it will be await'ed until it resolves.
+  return babel.transformFileAsync(filename).then(result => {
+    cache[filename] = result;
+
+    return result;
+  });
+}
+```
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/Farm.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/Farm.d.ts
new file mode 100644
index 0000000..3fe79d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/Farm.d.ts
@@ -0,0 +1,29 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { FarmOptions, PromiseWithCustomMessage, TaskQueue } from './types';
+export default class Farm {
+    private _numOfWorkers;
+    private _callback;
+    private readonly _computeWorkerKey;
+    private readonly _workerSchedulingPolicy;
+    private readonly _cacheKeys;
+    private readonly _locks;
+    private _offset;
+    private readonly _taskQueue;
+    constructor(_numOfWorkers: number, _callback: Function, options?: {
+        computeWorkerKey?: FarmOptions['computeWorkerKey'];
+        workerSchedulingPolicy?: FarmOptions['workerSchedulingPolicy'];
+        taskQueue?: TaskQueue;
+    });
+    doWork(method: string, ...args: Array<unknown>): PromiseWithCustomMessage<unknown>;
+    private _process;
+    private _push;
+    private _getNextWorkerOffset;
+    private _lock;
+    private _unlock;
+    private _isLocked;
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/Farm.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/Farm.js
new file mode 100644
index 0000000..e29daf5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/Farm.js
@@ -0,0 +1,206 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+var _FifoQueue = _interopRequireDefault(require('./FifoQueue'));
+
+var _types = require('./types');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+class Farm {
+  constructor(_numOfWorkers, _callback, options = {}) {
+    var _options$workerSchedu, _options$taskQueue;
+
+    _defineProperty(this, '_computeWorkerKey', void 0);
+
+    _defineProperty(this, '_workerSchedulingPolicy', void 0);
+
+    _defineProperty(this, '_cacheKeys', Object.create(null));
+
+    _defineProperty(this, '_locks', []);
+
+    _defineProperty(this, '_offset', 0);
+
+    _defineProperty(this, '_taskQueue', void 0);
+
+    this._numOfWorkers = _numOfWorkers;
+    this._callback = _callback;
+    this._computeWorkerKey = options.computeWorkerKey;
+    this._workerSchedulingPolicy =
+      (_options$workerSchedu = options.workerSchedulingPolicy) !== null &&
+      _options$workerSchedu !== void 0
+        ? _options$workerSchedu
+        : 'round-robin';
+    this._taskQueue =
+      (_options$taskQueue = options.taskQueue) !== null &&
+      _options$taskQueue !== void 0
+        ? _options$taskQueue
+        : new _FifoQueue.default();
+  }
+
+  doWork(method, ...args) {
+    const customMessageListeners = new Set();
+
+    const addCustomMessageListener = listener => {
+      customMessageListeners.add(listener);
+      return () => {
+        customMessageListeners.delete(listener);
+      };
+    };
+
+    const onCustomMessage = message => {
+      customMessageListeners.forEach(listener => listener(message));
+    };
+
+    const promise = new Promise( // Bind args to this function so it won't reference to the parent scope.
+      // This prevents a memory leak in v8, because otherwise the function will
+      // retaine args for the closure.
+      ((args, resolve, reject) => {
+        const computeWorkerKey = this._computeWorkerKey;
+        const request = [_types.CHILD_MESSAGE_CALL, false, method, args];
+        let worker = null;
+        let hash = null;
+
+        if (computeWorkerKey) {
+          hash = computeWorkerKey.call(this, method, ...args);
+          worker = hash == null ? null : this._cacheKeys[hash];
+        }
+
+        const onStart = worker => {
+          if (hash != null) {
+            this._cacheKeys[hash] = worker;
+          }
+        };
+
+        const onEnd = (error, result) => {
+          customMessageListeners.clear();
+
+          if (error) {
+            reject(error);
+          } else {
+            resolve(result);
+          }
+        };
+
+        const task = {
+          onCustomMessage,
+          onEnd,
+          onStart,
+          request
+        };
+
+        if (worker) {
+          this._taskQueue.enqueue(task, worker.getWorkerId());
+
+          this._process(worker.getWorkerId());
+        } else {
+          this._push(task);
+        }
+      }).bind(null, args)
+    );
+    promise.UNSTABLE_onCustomMessage = addCustomMessageListener;
+    return promise;
+  }
+
+  _process(workerId) {
+    if (this._isLocked(workerId)) {
+      return this;
+    }
+
+    const task = this._taskQueue.dequeue(workerId);
+
+    if (!task) {
+      return this;
+    }
+
+    if (task.request[1]) {
+      throw new Error('Queue implementation returned processed task');
+    } // Reference the task object outside so it won't be retained by onEnd,
+    // and other properties of the task object, such as task.request can be
+    // garbage collected.
+
+    const taskOnEnd = task.onEnd;
+
+    const onEnd = (error, result) => {
+      taskOnEnd(error, result);
+
+      this._unlock(workerId);
+
+      this._process(workerId);
+    };
+
+    task.request[1] = true;
+
+    this._lock(workerId);
+
+    this._callback(
+      workerId,
+      task.request,
+      task.onStart,
+      onEnd,
+      task.onCustomMessage
+    );
+
+    return this;
+  }
+
+  _push(task) {
+    this._taskQueue.enqueue(task);
+
+    const offset = this._getNextWorkerOffset();
+
+    for (let i = 0; i < this._numOfWorkers; i++) {
+      this._process((offset + i) % this._numOfWorkers);
+
+      if (task.request[1]) {
+        break;
+      }
+    }
+
+    return this;
+  }
+
+  _getNextWorkerOffset() {
+    switch (this._workerSchedulingPolicy) {
+      case 'in-order':
+        return 0;
+
+      case 'round-robin':
+        return this._offset++;
+    }
+  }
+
+  _lock(workerId) {
+    this._locks[workerId] = true;
+  }
+
+  _unlock(workerId) {
+    this._locks[workerId] = false;
+  }
+
+  _isLocked(workerId) {
+    return this._locks[workerId];
+  }
+}
+
+exports.default = Farm;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/FifoQueue.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/FifoQueue.d.ts
new file mode 100644
index 0000000..d78e9e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/FifoQueue.d.ts
@@ -0,0 +1,18 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import type { QueueChildMessage, TaskQueue } from './types';
+/**
+ * First-in, First-out task queue that manages a dedicated pool
+ * for each worker as well as a shared queue. The FIFO ordering is guaranteed
+ * across the worker specific and shared queue.
+ */
+export default class FifoQueue implements TaskQueue {
+    private _workerQueues;
+    private _sharedQueue;
+    enqueue(task: QueueChildMessage, workerId?: number): void;
+    dequeue(workerId: number): QueueChildMessage | null;
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/FifoQueue.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/FifoQueue.js
new file mode 100644
index 0000000..bb52e07
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/FifoQueue.js
@@ -0,0 +1,171 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+/**
+ * First-in, First-out task queue that manages a dedicated pool
+ * for each worker as well as a shared queue. The FIFO ordering is guaranteed
+ * across the worker specific and shared queue.
+ */
+class FifoQueue {
+  constructor() {
+    _defineProperty(this, '_workerQueues', []);
+
+    _defineProperty(this, '_sharedQueue', new InternalQueue());
+  }
+
+  enqueue(task, workerId) {
+    if (workerId == null) {
+      this._sharedQueue.enqueue(task);
+
+      return;
+    }
+
+    let workerQueue = this._workerQueues[workerId];
+
+    if (workerQueue == null) {
+      workerQueue = this._workerQueues[workerId] = new InternalQueue();
+    }
+
+    const sharedTop = this._sharedQueue.peekLast();
+
+    const item = {
+      previousSharedTask: sharedTop,
+      task
+    };
+    workerQueue.enqueue(item);
+  }
+
+  dequeue(workerId) {
+    var _this$_workerQueues$w, _workerTop$previousSh, _workerTop$previousSh2;
+
+    const workerTop =
+      (_this$_workerQueues$w = this._workerQueues[workerId]) === null ||
+      _this$_workerQueues$w === void 0
+        ? void 0
+        : _this$_workerQueues$w.peek();
+    const sharedTaskIsProcessed =
+      (_workerTop$previousSh =
+        workerTop === null || workerTop === void 0
+          ? void 0
+          : (_workerTop$previousSh2 = workerTop.previousSharedTask) === null ||
+            _workerTop$previousSh2 === void 0
+          ? void 0
+          : _workerTop$previousSh2.request[1]) !== null &&
+      _workerTop$previousSh !== void 0
+        ? _workerTop$previousSh
+        : true; // Process the top task from the shared queue if
+    // - there's no task in the worker specific queue or
+    // - if the non-worker-specific task after which this worker specifif task
+    //   hasn been queued wasn't processed yet
+
+    if (workerTop != null && sharedTaskIsProcessed) {
+      var _this$_workerQueues$w2,
+        _this$_workerQueues$w3,
+        _this$_workerQueues$w4;
+
+      return (_this$_workerQueues$w2 =
+        (_this$_workerQueues$w3 = this._workerQueues[workerId]) === null ||
+        _this$_workerQueues$w3 === void 0
+          ? void 0
+          : (_this$_workerQueues$w4 = _this$_workerQueues$w3.dequeue()) ===
+              null || _this$_workerQueues$w4 === void 0
+          ? void 0
+          : _this$_workerQueues$w4.task) !== null &&
+        _this$_workerQueues$w2 !== void 0
+        ? _this$_workerQueues$w2
+        : null;
+    }
+
+    return this._sharedQueue.dequeue();
+  }
+}
+
+exports.default = FifoQueue;
+
+/**
+ * FIFO queue for a single worker / shared queue.
+ */
+class InternalQueue {
+  constructor() {
+    _defineProperty(this, '_head', null);
+
+    _defineProperty(this, '_last', null);
+  }
+
+  enqueue(value) {
+    const item = {
+      next: null,
+      value
+    };
+
+    if (this._last == null) {
+      this._head = item;
+    } else {
+      this._last.next = item;
+    }
+
+    this._last = item;
+  }
+
+  dequeue() {
+    if (this._head == null) {
+      return null;
+    }
+
+    const item = this._head;
+    this._head = item.next;
+
+    if (this._head == null) {
+      this._last = null;
+    }
+
+    return item.value;
+  }
+
+  peek() {
+    var _this$_head$value, _this$_head;
+
+    return (_this$_head$value =
+      (_this$_head = this._head) === null || _this$_head === void 0
+        ? void 0
+        : _this$_head.value) !== null && _this$_head$value !== void 0
+      ? _this$_head$value
+      : null;
+  }
+
+  peekLast() {
+    var _this$_last$value, _this$_last;
+
+    return (_this$_last$value =
+      (_this$_last = this._last) === null || _this$_last === void 0
+        ? void 0
+        : _this$_last.value) !== null && _this$_last$value !== void 0
+      ? _this$_last$value
+      : null;
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/PriorityQueue.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/PriorityQueue.d.ts
new file mode 100644
index 0000000..d6bcf4c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/PriorityQueue.d.ts
@@ -0,0 +1,41 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import type { QueueChildMessage, TaskQueue } from './types';
+export declare type ComputeTaskPriorityCallback = (method: string, ...args: Array<unknown>) => number;
+declare type QueueItem = {
+    task: QueueChildMessage;
+    priority: number;
+};
+/**
+ * Priority queue that processes tasks in natural ordering (lower priority first)
+ * accoridng to the priority computed by the function passed in the constructor.
+ *
+ * FIFO ordering isn't guaranteed for tasks with the same priority.
+ *
+ * Worker specific tasks with the same priority as a non-worker specific task
+ * are always processed first.
+ */
+export default class PriorityQueue implements TaskQueue {
+    private _computePriority;
+    private _queue;
+    private _sharedQueue;
+    constructor(_computePriority: ComputeTaskPriorityCallback);
+    enqueue(task: QueueChildMessage, workerId?: number): void;
+    _enqueue(task: QueueChildMessage, queue: MinHeap<QueueItem>): void;
+    dequeue(workerId: number): QueueChildMessage | null;
+    _getWorkerQueue(workerId: number): MinHeap<QueueItem>;
+}
+declare type HeapItem = {
+    priority: number;
+};
+declare class MinHeap<TItem extends HeapItem> {
+    private _heap;
+    peek(): TItem | null;
+    add(item: TItem): void;
+    poll(): TItem | null;
+}
+export {};
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/PriorityQueue.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/PriorityQueue.js
new file mode 100644
index 0000000..6a55b59
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/PriorityQueue.js
@@ -0,0 +1,188 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+/**
+ * Priority queue that processes tasks in natural ordering (lower priority first)
+ * accoridng to the priority computed by the function passed in the constructor.
+ *
+ * FIFO ordering isn't guaranteed for tasks with the same priority.
+ *
+ * Worker specific tasks with the same priority as a non-worker specific task
+ * are always processed first.
+ */
+class PriorityQueue {
+  constructor(_computePriority) {
+    _defineProperty(this, '_queue', []);
+
+    _defineProperty(this, '_sharedQueue', new MinHeap());
+
+    this._computePriority = _computePriority;
+  }
+
+  enqueue(task, workerId) {
+    if (workerId == null) {
+      this._enqueue(task, this._sharedQueue);
+    } else {
+      const queue = this._getWorkerQueue(workerId);
+
+      this._enqueue(task, queue);
+    }
+  }
+
+  _enqueue(task, queue) {
+    const item = {
+      priority: this._computePriority(task.request[2], ...task.request[3]),
+      task
+    };
+    queue.add(item);
+  }
+
+  dequeue(workerId) {
+    const workerQueue = this._getWorkerQueue(workerId);
+
+    const workerTop = workerQueue.peek();
+
+    const sharedTop = this._sharedQueue.peek(); // use the task from the worker queue if there's no task in the shared queue
+    // or if the priority of the worker queue is smaller or equal to the
+    // priority of the top task in the shared queue. The tasks of the
+    // worker specific queue are preferred because no other worker can pick this
+    // specific task up.
+
+    if (
+      sharedTop == null ||
+      (workerTop != null && workerTop.priority <= sharedTop.priority)
+    ) {
+      var _workerQueue$poll$tas, _workerQueue$poll;
+
+      return (_workerQueue$poll$tas =
+        (_workerQueue$poll = workerQueue.poll()) === null ||
+        _workerQueue$poll === void 0
+          ? void 0
+          : _workerQueue$poll.task) !== null && _workerQueue$poll$tas !== void 0
+        ? _workerQueue$poll$tas
+        : null;
+    }
+
+    return this._sharedQueue.poll().task;
+  }
+
+  _getWorkerQueue(workerId) {
+    let queue = this._queue[workerId];
+
+    if (queue == null) {
+      queue = this._queue[workerId] = new MinHeap();
+    }
+
+    return queue;
+  }
+}
+
+exports.default = PriorityQueue;
+
+class MinHeap {
+  constructor() {
+    _defineProperty(this, '_heap', []);
+  }
+
+  peek() {
+    var _this$_heap$;
+
+    return (_this$_heap$ = this._heap[0]) !== null && _this$_heap$ !== void 0
+      ? _this$_heap$
+      : null;
+  }
+
+  add(item) {
+    const nodes = this._heap;
+    nodes.push(item);
+
+    if (nodes.length === 1) {
+      return;
+    }
+
+    let currentIndex = nodes.length - 1; // Bubble up the added node as long as the parent is bigger
+
+    while (currentIndex > 0) {
+      const parentIndex = Math.floor((currentIndex + 1) / 2) - 1;
+      const parent = nodes[parentIndex];
+
+      if (parent.priority <= item.priority) {
+        break;
+      }
+
+      nodes[currentIndex] = parent;
+      nodes[parentIndex] = item;
+      currentIndex = parentIndex;
+    }
+  }
+
+  poll() {
+    const nodes = this._heap;
+    const result = nodes[0];
+    const lastElement = nodes.pop(); // heap was empty or removed the last element
+
+    if (result == null || nodes.length === 0) {
+      return result !== null && result !== void 0 ? result : null;
+    }
+
+    let index = 0;
+    nodes[0] =
+      lastElement !== null && lastElement !== void 0 ? lastElement : null;
+    const element = nodes[0];
+
+    while (true) {
+      let swapIndex = null;
+      const rightChildIndex = (index + 1) * 2;
+      const leftChildIndex = rightChildIndex - 1;
+      const rightChild = nodes[rightChildIndex];
+      const leftChild = nodes[leftChildIndex]; // if the left child is smaller, swap with the left
+
+      if (leftChild != null && leftChild.priority < element.priority) {
+        swapIndex = leftChildIndex;
+      } // If the right child is smaller or the right child is smaller than the left
+      // then swap with the right child
+
+      if (
+        rightChild != null &&
+        rightChild.priority < (swapIndex == null ? element : leftChild).priority
+      ) {
+        swapIndex = rightChildIndex;
+      }
+
+      if (swapIndex == null) {
+        break;
+      }
+
+      nodes[index] = nodes[swapIndex];
+      nodes[swapIndex] = element;
+      index = swapIndex;
+    }
+
+    return result;
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/WorkerPool.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/WorkerPool.d.ts
new file mode 100644
index 0000000..9f13ff7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/WorkerPool.d.ts
@@ -0,0 +1,13 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import BaseWorkerPool from './base/BaseWorkerPool';
+import type { ChildMessage, OnCustomMessage, OnEnd, OnStart, WorkerInterface, WorkerOptions, WorkerPoolInterface } from './types';
+declare class WorkerPool extends BaseWorkerPool implements WorkerPoolInterface {
+    send(workerId: number, request: ChildMessage, onStart: OnStart, onEnd: OnEnd, onCustomMessage: OnCustomMessage): void;
+    createWorker(workerOptions: WorkerOptions): WorkerInterface;
+}
+export default WorkerPool;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/WorkerPool.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/WorkerPool.js
new file mode 100644
index 0000000..b19a679
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/WorkerPool.js
@@ -0,0 +1,49 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+var _BaseWorkerPool = _interopRequireDefault(require('./base/BaseWorkerPool'));
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const canUseWorkerThreads = () => {
+  try {
+    require('worker_threads');
+
+    return true;
+  } catch {
+    return false;
+  }
+};
+
+class WorkerPool extends _BaseWorkerPool.default {
+  send(workerId, request, onStart, onEnd, onCustomMessage) {
+    this.getWorkerById(workerId).send(request, onStart, onEnd, onCustomMessage);
+  }
+
+  createWorker(workerOptions) {
+    let Worker;
+
+    if (this._options.enableWorkerThreads && canUseWorkerThreads()) {
+      Worker = require('./workers/NodeThreadsWorker').default;
+    } else {
+      Worker = require('./workers/ChildProcessWorker').default;
+    }
+
+    return new Worker(workerOptions);
+  }
+}
+
+var _default = WorkerPool;
+exports.default = _default;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/base/BaseWorkerPool.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/base/BaseWorkerPool.d.ts
new file mode 100644
index 0000000..311309e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/base/BaseWorkerPool.d.ts
@@ -0,0 +1,21 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import { PoolExitResult, WorkerInterface, WorkerOptions, WorkerPoolOptions } from '../types';
+export default class BaseWorkerPool {
+    private readonly _stderr;
+    private readonly _stdout;
+    protected readonly _options: WorkerPoolOptions;
+    private readonly _workers;
+    constructor(workerPath: string, options: WorkerPoolOptions);
+    getStderr(): NodeJS.ReadableStream;
+    getStdout(): NodeJS.ReadableStream;
+    getWorkers(): Array<WorkerInterface>;
+    getWorkerById(workerId: number): WorkerInterface;
+    createWorker(_workerOptions: WorkerOptions): WorkerInterface;
+    end(): Promise<PoolExitResult>;
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/base/BaseWorkerPool.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/base/BaseWorkerPool.js
new file mode 100644
index 0000000..491deb8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/base/BaseWorkerPool.js
@@ -0,0 +1,201 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function path() {
+  const data = _interopRequireWildcard(require('path'));
+
+  path = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function _mergeStream() {
+  const data = _interopRequireDefault(require('merge-stream'));
+
+  _mergeStream = function () {
+    return data;
+  };
+
+  return data;
+}
+
+var _types = require('../types');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+function _getRequireWildcardCache(nodeInterop) {
+  if (typeof WeakMap !== 'function') return null;
+  var cacheBabelInterop = new WeakMap();
+  var cacheNodeInterop = new WeakMap();
+  return (_getRequireWildcardCache = function (nodeInterop) {
+    return nodeInterop ? cacheNodeInterop : cacheBabelInterop;
+  })(nodeInterop);
+}
+
+function _interopRequireWildcard(obj, nodeInterop) {
+  if (!nodeInterop && obj && obj.__esModule) {
+    return obj;
+  }
+  if (obj === null || (typeof obj !== 'object' && typeof obj !== 'function')) {
+    return {default: obj};
+  }
+  var cache = _getRequireWildcardCache(nodeInterop);
+  if (cache && cache.has(obj)) {
+    return cache.get(obj);
+  }
+  var newObj = {};
+  var hasPropertyDescriptor =
+    Object.defineProperty && Object.getOwnPropertyDescriptor;
+  for (var key in obj) {
+    if (key !== 'default' && Object.prototype.hasOwnProperty.call(obj, key)) {
+      var desc = hasPropertyDescriptor
+        ? Object.getOwnPropertyDescriptor(obj, key)
+        : null;
+      if (desc && (desc.get || desc.set)) {
+        Object.defineProperty(newObj, key, desc);
+      } else {
+        newObj[key] = obj[key];
+      }
+    }
+  }
+  newObj.default = obj;
+  if (cache) {
+    cache.set(obj, newObj);
+  }
+  return newObj;
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+// How long to wait for the child process to terminate
+// after CHILD_MESSAGE_END before sending force exiting.
+const FORCE_EXIT_DELAY = 500;
+/* istanbul ignore next */
+
+const emptyMethod = () => {};
+
+class BaseWorkerPool {
+  constructor(workerPath, options) {
+    _defineProperty(this, '_stderr', void 0);
+
+    _defineProperty(this, '_stdout', void 0);
+
+    _defineProperty(this, '_options', void 0);
+
+    _defineProperty(this, '_workers', void 0);
+
+    this._options = options;
+    this._workers = new Array(options.numWorkers);
+
+    if (!path().isAbsolute(workerPath)) {
+      workerPath = require.resolve(workerPath);
+    }
+
+    const stdout = (0, _mergeStream().default)();
+    const stderr = (0, _mergeStream().default)();
+    const {forkOptions, maxRetries, resourceLimits, setupArgs} = options;
+
+    for (let i = 0; i < options.numWorkers; i++) {
+      const workerOptions = {
+        forkOptions,
+        maxRetries,
+        resourceLimits,
+        setupArgs,
+        workerId: i,
+        workerPath
+      };
+      const worker = this.createWorker(workerOptions);
+      const workerStdout = worker.getStdout();
+      const workerStderr = worker.getStderr();
+
+      if (workerStdout) {
+        stdout.add(workerStdout);
+      }
+
+      if (workerStderr) {
+        stderr.add(workerStderr);
+      }
+
+      this._workers[i] = worker;
+    }
+
+    this._stdout = stdout;
+    this._stderr = stderr;
+  }
+
+  getStderr() {
+    return this._stderr;
+  }
+
+  getStdout() {
+    return this._stdout;
+  }
+
+  getWorkers() {
+    return this._workers;
+  }
+
+  getWorkerById(workerId) {
+    return this._workers[workerId];
+  }
+
+  createWorker(_workerOptions) {
+    throw Error('Missing method createWorker in WorkerPool');
+  }
+
+  async end() {
+    // We do not cache the request object here. If so, it would only be only
+    // processed by one of the workers, and we want them all to close.
+    const workerExitPromises = this._workers.map(async worker => {
+      worker.send(
+        [_types.CHILD_MESSAGE_END, false],
+        emptyMethod,
+        emptyMethod,
+        emptyMethod
+      ); // Schedule a force exit in case worker fails to exit gracefully so
+      // await worker.waitForExit() never takes longer than FORCE_EXIT_DELAY
+
+      let forceExited = false;
+      const forceExitTimeout = setTimeout(() => {
+        worker.forceExit();
+        forceExited = true;
+      }, FORCE_EXIT_DELAY);
+      await worker.waitForExit(); // Worker ideally exited gracefully, don't send force exit then
+
+      clearTimeout(forceExitTimeout);
+      return forceExited;
+    });
+
+    const workerExits = await Promise.all(workerExitPromises);
+    return workerExits.reduce(
+      (result, forceExited) => ({
+        forceExited: result.forceExited || forceExited
+      }),
+      {
+        forceExited: false
+      }
+    );
+  }
+}
+
+exports.default = BaseWorkerPool;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/index.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/index.d.ts
new file mode 100644
index 0000000..5908dbb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/index.d.ts
@@ -0,0 +1,49 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import type { FarmOptions, PoolExitResult, PromiseWithCustomMessage, TaskQueue } from './types';
+export { default as PriorityQueue } from './PriorityQueue';
+export { default as FifoQueue } from './FifoQueue';
+export { default as messageParent } from './workers/messageParent';
+/**
+ * The Jest farm (publicly called "Worker") is a class that allows you to queue
+ * methods across multiple child processes, in order to parallelize work. This
+ * is done by providing an absolute path to a module that will be loaded on each
+ * of the child processes, and bridged to the main process.
+ *
+ * Bridged methods are specified by using the "exposedMethods" property of the
+ * "options" object. This is an array of strings, where each of them corresponds
+ * to the exported name in the loaded module.
+ *
+ * You can also control the amount of workers by using the "numWorkers" property
+ * of the "options" object, and the settings passed to fork the process through
+ * the "forkOptions" property. The amount of workers defaults to the amount of
+ * CPUS minus one.
+ *
+ * Queueing calls can be done in two ways:
+ *   - Standard method: calls will be redirected to the first available worker,
+ *     so they will get executed as soon as they can.
+ *
+ *   - Sticky method: if a "computeWorkerKey" method is provided within the
+ *     config, the resulting string of this method will be used as a key.
+ *     Every time this key is returned, it is guaranteed that your job will be
+ *     processed by the same worker. This is specially useful if your workers
+ *     are caching results.
+ */
+export declare class Worker {
+    private _ending;
+    private _farm;
+    private _options;
+    private _workerPool;
+    constructor(workerPath: string, options?: FarmOptions);
+    private _bindExposedWorkerMethods;
+    private _callFunctionWithArgs;
+    getStderr(): NodeJS.ReadableStream;
+    getStdout(): NodeJS.ReadableStream;
+    end(): Promise<PoolExitResult>;
+}
+export type { PromiseWithCustomMessage, TaskQueue };
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/index.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/index.js
new file mode 100644
index 0000000..5dac183
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/index.js
@@ -0,0 +1,223 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+Object.defineProperty(exports, 'FifoQueue', {
+  enumerable: true,
+  get: function () {
+    return _FifoQueue.default;
+  }
+});
+Object.defineProperty(exports, 'PriorityQueue', {
+  enumerable: true,
+  get: function () {
+    return _PriorityQueue.default;
+  }
+});
+exports.Worker = void 0;
+Object.defineProperty(exports, 'messageParent', {
+  enumerable: true,
+  get: function () {
+    return _messageParent.default;
+  }
+});
+
+function _os() {
+  const data = require('os');
+
+  _os = function () {
+    return data;
+  };
+
+  return data;
+}
+
+var _Farm = _interopRequireDefault(require('./Farm'));
+
+var _WorkerPool = _interopRequireDefault(require('./WorkerPool'));
+
+var _PriorityQueue = _interopRequireDefault(require('./PriorityQueue'));
+
+var _FifoQueue = _interopRequireDefault(require('./FifoQueue'));
+
+var _messageParent = _interopRequireDefault(require('./workers/messageParent'));
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+function getExposedMethods(workerPath, options) {
+  let exposedMethods = options.exposedMethods; // If no methods list is given, try getting it by auto-requiring the module.
+
+  if (!exposedMethods) {
+    const module = require(workerPath);
+
+    exposedMethods = Object.keys(module).filter(
+      // @ts-expect-error: no index
+      name => typeof module[name] === 'function'
+    );
+
+    if (typeof module === 'function') {
+      exposedMethods = [...exposedMethods, 'default'];
+    }
+  }
+
+  return exposedMethods;
+}
+/**
+ * The Jest farm (publicly called "Worker") is a class that allows you to queue
+ * methods across multiple child processes, in order to parallelize work. This
+ * is done by providing an absolute path to a module that will be loaded on each
+ * of the child processes, and bridged to the main process.
+ *
+ * Bridged methods are specified by using the "exposedMethods" property of the
+ * "options" object. This is an array of strings, where each of them corresponds
+ * to the exported name in the loaded module.
+ *
+ * You can also control the amount of workers by using the "numWorkers" property
+ * of the "options" object, and the settings passed to fork the process through
+ * the "forkOptions" property. The amount of workers defaults to the amount of
+ * CPUS minus one.
+ *
+ * Queueing calls can be done in two ways:
+ *   - Standard method: calls will be redirected to the first available worker,
+ *     so they will get executed as soon as they can.
+ *
+ *   - Sticky method: if a "computeWorkerKey" method is provided within the
+ *     config, the resulting string of this method will be used as a key.
+ *     Every time this key is returned, it is guaranteed that your job will be
+ *     processed by the same worker. This is specially useful if your workers
+ *     are caching results.
+ */
+
+class Worker {
+  constructor(workerPath, options) {
+    var _this$_options$enable,
+      _this$_options$forkOp,
+      _this$_options$maxRet,
+      _this$_options$numWor,
+      _this$_options$resour,
+      _this$_options$setupA;
+
+    _defineProperty(this, '_ending', void 0);
+
+    _defineProperty(this, '_farm', void 0);
+
+    _defineProperty(this, '_options', void 0);
+
+    _defineProperty(this, '_workerPool', void 0);
+
+    this._options = {...options};
+    this._ending = false;
+    const workerPoolOptions = {
+      enableWorkerThreads:
+        (_this$_options$enable = this._options.enableWorkerThreads) !== null &&
+        _this$_options$enable !== void 0
+          ? _this$_options$enable
+          : false,
+      forkOptions:
+        (_this$_options$forkOp = this._options.forkOptions) !== null &&
+        _this$_options$forkOp !== void 0
+          ? _this$_options$forkOp
+          : {},
+      maxRetries:
+        (_this$_options$maxRet = this._options.maxRetries) !== null &&
+        _this$_options$maxRet !== void 0
+          ? _this$_options$maxRet
+          : 3,
+      numWorkers:
+        (_this$_options$numWor = this._options.numWorkers) !== null &&
+        _this$_options$numWor !== void 0
+          ? _this$_options$numWor
+          : Math.max((0, _os().cpus)().length - 1, 1),
+      resourceLimits:
+        (_this$_options$resour = this._options.resourceLimits) !== null &&
+        _this$_options$resour !== void 0
+          ? _this$_options$resour
+          : {},
+      setupArgs:
+        (_this$_options$setupA = this._options.setupArgs) !== null &&
+        _this$_options$setupA !== void 0
+          ? _this$_options$setupA
+          : []
+    };
+
+    if (this._options.WorkerPool) {
+      // @ts-expect-error: constructor target any?
+      this._workerPool = new this._options.WorkerPool(
+        workerPath,
+        workerPoolOptions
+      );
+    } else {
+      this._workerPool = new _WorkerPool.default(workerPath, workerPoolOptions);
+    }
+
+    this._farm = new _Farm.default(
+      workerPoolOptions.numWorkers,
+      this._workerPool.send.bind(this._workerPool),
+      {
+        computeWorkerKey: this._options.computeWorkerKey,
+        taskQueue: this._options.taskQueue,
+        workerSchedulingPolicy: this._options.workerSchedulingPolicy
+      }
+    );
+
+    this._bindExposedWorkerMethods(workerPath, this._options);
+  }
+
+  _bindExposedWorkerMethods(workerPath, options) {
+    getExposedMethods(workerPath, options).forEach(name => {
+      if (name.startsWith('_')) {
+        return;
+      }
+
+      if (this.constructor.prototype.hasOwnProperty(name)) {
+        throw new TypeError('Cannot define a method called ' + name);
+      } // @ts-expect-error: dynamic extension of the class instance is expected.
+
+      this[name] = this._callFunctionWithArgs.bind(this, name);
+    });
+  }
+
+  _callFunctionWithArgs(method, ...args) {
+    if (this._ending) {
+      throw new Error('Farm is ended, no more calls can be done to it');
+    }
+
+    return this._farm.doWork(method, ...args);
+  }
+
+  getStderr() {
+    return this._workerPool.getStderr();
+  }
+
+  getStdout() {
+    return this._workerPool.getStdout();
+  }
+
+  async end() {
+    if (this._ending) {
+      throw new Error('Farm is ended, no more calls can be done to it');
+    }
+
+    this._ending = true;
+    return this._workerPool.end();
+  }
+}
+
+exports.Worker = Worker;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/types.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/types.d.ts
new file mode 100644
index 0000000..be160f6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/types.d.ts
@@ -0,0 +1,143 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import type { ForkOptions } from 'child_process';
+import type { EventEmitter } from 'events';
+export interface ResourceLimits {
+    maxYoungGenerationSizeMb?: number;
+    maxOldGenerationSizeMb?: number;
+    codeRangeSizeMb?: number;
+    stackSizeMb?: number;
+}
+export declare const CHILD_MESSAGE_INITIALIZE: 0;
+export declare const CHILD_MESSAGE_CALL: 1;
+export declare const CHILD_MESSAGE_END: 2;
+export declare const PARENT_MESSAGE_OK: 0;
+export declare const PARENT_MESSAGE_CLIENT_ERROR: 1;
+export declare const PARENT_MESSAGE_SETUP_ERROR: 2;
+export declare const PARENT_MESSAGE_CUSTOM: 3;
+export declare type PARENT_MESSAGE_ERROR = typeof PARENT_MESSAGE_CLIENT_ERROR | typeof PARENT_MESSAGE_SETUP_ERROR;
+export interface WorkerPoolInterface {
+    getStderr(): NodeJS.ReadableStream;
+    getStdout(): NodeJS.ReadableStream;
+    getWorkers(): Array<WorkerInterface>;
+    createWorker(options: WorkerOptions): WorkerInterface;
+    send(workerId: number, request: ChildMessage, onStart: OnStart, onEnd: OnEnd, onCustomMessage: OnCustomMessage): void;
+    end(): Promise<PoolExitResult>;
+}
+export interface WorkerInterface {
+    send(request: ChildMessage, onProcessStart: OnStart, onProcessEnd: OnEnd, onCustomMessage: OnCustomMessage): void;
+    waitForExit(): Promise<void>;
+    forceExit(): void;
+    getWorkerId(): number;
+    getStderr(): NodeJS.ReadableStream | null;
+    getStdout(): NodeJS.ReadableStream | null;
+}
+export declare type PoolExitResult = {
+    forceExited: boolean;
+};
+export interface PromiseWithCustomMessage<T> extends Promise<T> {
+    UNSTABLE_onCustomMessage?: (listener: OnCustomMessage) => () => void;
+}
+export type { ForkOptions };
+export interface TaskQueue {
+    /**
+     * Enqueues the task in the queue for the specified worker or adds it to the
+     * queue shared by all workers
+     * @param task the task to queue
+     * @param workerId the id of the worker that should process this task or undefined
+     * if there's no preference.
+     */
+    enqueue(task: QueueChildMessage, workerId?: number): void;
+    /**
+     * Dequeues the next item from the queue for the speified worker
+     * @param workerId the id of the worker for which the next task should be retrieved
+     */
+    dequeue(workerId: number): QueueChildMessage | null;
+}
+export declare type FarmOptions = {
+    computeWorkerKey?: (method: string, ...args: Array<unknown>) => string | null;
+    exposedMethods?: ReadonlyArray<string>;
+    forkOptions?: ForkOptions;
+    workerSchedulingPolicy?: 'round-robin' | 'in-order';
+    resourceLimits?: ResourceLimits;
+    setupArgs?: Array<unknown>;
+    maxRetries?: number;
+    numWorkers?: number;
+    taskQueue?: TaskQueue;
+    WorkerPool?: (workerPath: string, options?: WorkerPoolOptions) => WorkerPoolInterface;
+    enableWorkerThreads?: boolean;
+};
+export declare type WorkerPoolOptions = {
+    setupArgs: Array<unknown>;
+    forkOptions: ForkOptions;
+    resourceLimits: ResourceLimits;
+    maxRetries: number;
+    numWorkers: number;
+    enableWorkerThreads: boolean;
+};
+export declare type WorkerOptions = {
+    forkOptions: ForkOptions;
+    resourceLimits: ResourceLimits;
+    setupArgs: Array<unknown>;
+    maxRetries: number;
+    workerId: number;
+    workerData?: unknown;
+    workerPath: string;
+};
+export declare type MessagePort = typeof EventEmitter & {
+    postMessage(message: unknown): void;
+};
+export declare type MessageChannel = {
+    port1: MessagePort;
+    port2: MessagePort;
+};
+export declare type ChildMessageInitialize = [
+    typeof CHILD_MESSAGE_INITIALIZE,
+    boolean,
+    string,
+    // file
+    Array<unknown> | undefined,
+    // setupArgs
+    MessagePort | undefined
+];
+export declare type ChildMessageCall = [
+    typeof CHILD_MESSAGE_CALL,
+    boolean,
+    string,
+    Array<unknown>
+];
+export declare type ChildMessageEnd = [
+    typeof CHILD_MESSAGE_END,
+    boolean
+];
+export declare type ChildMessage = ChildMessageInitialize | ChildMessageCall | ChildMessageEnd;
+export declare type ParentMessageCustom = [
+    typeof PARENT_MESSAGE_CUSTOM,
+    unknown
+];
+export declare type ParentMessageOk = [
+    typeof PARENT_MESSAGE_OK,
+    unknown
+];
+export declare type ParentMessageError = [
+    PARENT_MESSAGE_ERROR,
+    string,
+    string,
+    string,
+    unknown
+];
+export declare type ParentMessage = ParentMessageOk | ParentMessageError | ParentMessageCustom;
+export declare type OnStart = (worker: WorkerInterface) => void;
+export declare type OnEnd = (err: Error | null, result: unknown) => void;
+export declare type OnCustomMessage = (message: Array<unknown> | unknown) => void;
+export declare type QueueChildMessage = {
+    request: ChildMessageCall;
+    onStart: OnStart;
+    onEnd: OnEnd;
+    onCustomMessage: OnCustomMessage;
+};
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/types.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/types.js
new file mode 100644
index 0000000..92b358b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/types.js
@@ -0,0 +1,39 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.PARENT_MESSAGE_SETUP_ERROR =
+  exports.PARENT_MESSAGE_OK =
+  exports.PARENT_MESSAGE_CUSTOM =
+  exports.PARENT_MESSAGE_CLIENT_ERROR =
+  exports.CHILD_MESSAGE_INITIALIZE =
+  exports.CHILD_MESSAGE_END =
+  exports.CHILD_MESSAGE_CALL =
+    void 0;
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+// import type {ResourceLimits} from 'worker_threads';
+// This is not present in the Node 12 typings
+// Because of the dynamic nature of a worker communication process, all messages
+// coming from any of the other processes cannot be typed. Thus, many types
+// include "unknown" as a TS type, which is (unfortunately) correct here.
+const CHILD_MESSAGE_INITIALIZE = 0;
+exports.CHILD_MESSAGE_INITIALIZE = CHILD_MESSAGE_INITIALIZE;
+const CHILD_MESSAGE_CALL = 1;
+exports.CHILD_MESSAGE_CALL = CHILD_MESSAGE_CALL;
+const CHILD_MESSAGE_END = 2;
+exports.CHILD_MESSAGE_END = CHILD_MESSAGE_END;
+const PARENT_MESSAGE_OK = 0;
+exports.PARENT_MESSAGE_OK = PARENT_MESSAGE_OK;
+const PARENT_MESSAGE_CLIENT_ERROR = 1;
+exports.PARENT_MESSAGE_CLIENT_ERROR = PARENT_MESSAGE_CLIENT_ERROR;
+const PARENT_MESSAGE_SETUP_ERROR = 2;
+exports.PARENT_MESSAGE_SETUP_ERROR = PARENT_MESSAGE_SETUP_ERROR;
+const PARENT_MESSAGE_CUSTOM = 3;
+exports.PARENT_MESSAGE_CUSTOM = PARENT_MESSAGE_CUSTOM;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/ChildProcessWorker.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/ChildProcessWorker.d.ts
new file mode 100644
index 0000000..4a8dcf1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/ChildProcessWorker.d.ts
@@ -0,0 +1,51 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import { ChildMessage, OnCustomMessage, OnEnd, OnStart, WorkerInterface, WorkerOptions } from '../types';
+/**
+ * This class wraps the child process and provides a nice interface to
+ * communicate with. It takes care of:
+ *
+ *  - Re-spawning the process if it dies.
+ *  - Queues calls while the worker is busy.
+ *  - Re-sends the requests if the worker blew up.
+ *
+ * The reason for queueing them here (since childProcess.send also has an
+ * internal queue) is because the worker could be doing asynchronous work, and
+ * this would lead to the child process to read its receiving buffer and start a
+ * second call. By queueing calls here, we don't send the next call to the
+ * children until we receive the result of the previous one.
+ *
+ * As soon as a request starts to be processed by a worker, its "processed"
+ * field is changed to "true", so that other workers which might encounter the
+ * same call skip it.
+ */
+export default class ChildProcessWorker implements WorkerInterface {
+    private _child;
+    private _options;
+    private _request;
+    private _retries;
+    private _onProcessEnd;
+    private _onCustomMessage;
+    private _fakeStream;
+    private _stdout;
+    private _stderr;
+    private _exitPromise;
+    private _resolveExitPromise;
+    constructor(options: WorkerOptions);
+    initialize(): void;
+    private _shutdown;
+    private _onMessage;
+    private _onExit;
+    send(request: ChildMessage, onProcessStart: OnStart, onProcessEnd: OnEnd, onCustomMessage: OnCustomMessage): void;
+    waitForExit(): Promise<void>;
+    forceExit(): void;
+    getWorkerId(): number;
+    getStdout(): NodeJS.ReadableStream | null;
+    getStderr(): NodeJS.ReadableStream | null;
+    private _getFakeStream;
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/ChildProcessWorker.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/ChildProcessWorker.js
new file mode 100644
index 0000000..f8a42c9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/ChildProcessWorker.js
@@ -0,0 +1,333 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _child_process() {
+  const data = require('child_process');
+
+  _child_process = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function _stream() {
+  const data = require('stream');
+
+  _stream = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function _mergeStream() {
+  const data = _interopRequireDefault(require('merge-stream'));
+
+  _mergeStream = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function _supportsColor() {
+  const data = require('supports-color');
+
+  _supportsColor = function () {
+    return data;
+  };
+
+  return data;
+}
+
+var _types = require('../types');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+const SIGNAL_BASE_EXIT_CODE = 128;
+const SIGKILL_EXIT_CODE = SIGNAL_BASE_EXIT_CODE + 9;
+const SIGTERM_EXIT_CODE = SIGNAL_BASE_EXIT_CODE + 15; // How long to wait after SIGTERM before sending SIGKILL
+
+const SIGKILL_DELAY = 500;
+/**
+ * This class wraps the child process and provides a nice interface to
+ * communicate with. It takes care of:
+ *
+ *  - Re-spawning the process if it dies.
+ *  - Queues calls while the worker is busy.
+ *  - Re-sends the requests if the worker blew up.
+ *
+ * The reason for queueing them here (since childProcess.send also has an
+ * internal queue) is because the worker could be doing asynchronous work, and
+ * this would lead to the child process to read its receiving buffer and start a
+ * second call. By queueing calls here, we don't send the next call to the
+ * children until we receive the result of the previous one.
+ *
+ * As soon as a request starts to be processed by a worker, its "processed"
+ * field is changed to "true", so that other workers which might encounter the
+ * same call skip it.
+ */
+
+class ChildProcessWorker {
+  constructor(options) {
+    _defineProperty(this, '_child', void 0);
+
+    _defineProperty(this, '_options', void 0);
+
+    _defineProperty(this, '_request', void 0);
+
+    _defineProperty(this, '_retries', void 0);
+
+    _defineProperty(this, '_onProcessEnd', void 0);
+
+    _defineProperty(this, '_onCustomMessage', void 0);
+
+    _defineProperty(this, '_fakeStream', void 0);
+
+    _defineProperty(this, '_stdout', void 0);
+
+    _defineProperty(this, '_stderr', void 0);
+
+    _defineProperty(this, '_exitPromise', void 0);
+
+    _defineProperty(this, '_resolveExitPromise', void 0);
+
+    this._options = options;
+    this._request = null;
+    this._fakeStream = null;
+    this._stdout = null;
+    this._stderr = null;
+    this._exitPromise = new Promise(resolve => {
+      this._resolveExitPromise = resolve;
+    });
+    this.initialize();
+  }
+
+  initialize() {
+    const forceColor = _supportsColor().stdout
+      ? {
+          FORCE_COLOR: '1'
+        }
+      : {};
+    const child = (0, _child_process().fork)(
+      require.resolve('./processChild'),
+      [],
+      {
+        cwd: process.cwd(),
+        env: {
+          ...process.env,
+          JEST_WORKER_ID: String(this._options.workerId + 1),
+          // 0-indexed workerId, 1-indexed JEST_WORKER_ID
+          ...forceColor
+        },
+        // Suppress --debug / --inspect flags while preserving others (like --harmony).
+        execArgv: process.execArgv.filter(v => !/^--(debug|inspect)/.test(v)),
+        silent: true,
+        ...this._options.forkOptions
+      }
+    );
+
+    if (child.stdout) {
+      if (!this._stdout) {
+        // We need to add a permanent stream to the merged stream to prevent it
+        // from ending when the subprocess stream ends
+        this._stdout = (0, _mergeStream().default)(this._getFakeStream());
+      }
+
+      this._stdout.add(child.stdout);
+    }
+
+    if (child.stderr) {
+      if (!this._stderr) {
+        // We need to add a permanent stream to the merged stream to prevent it
+        // from ending when the subprocess stream ends
+        this._stderr = (0, _mergeStream().default)(this._getFakeStream());
+      }
+
+      this._stderr.add(child.stderr);
+    }
+
+    child.on('message', this._onMessage.bind(this));
+    child.on('exit', this._onExit.bind(this));
+    child.send([
+      _types.CHILD_MESSAGE_INITIALIZE,
+      false,
+      this._options.workerPath,
+      this._options.setupArgs
+    ]);
+    this._child = child;
+    this._retries++; // If we exceeded the amount of retries, we will emulate an error reply
+    // coming from the child. This avoids code duplication related with cleaning
+    // the queue, and scheduling the next call.
+
+    if (this._retries > this._options.maxRetries) {
+      const error = new Error(
+        `Jest worker encountered ${this._retries} child process exceptions, exceeding retry limit`
+      );
+
+      this._onMessage([
+        _types.PARENT_MESSAGE_CLIENT_ERROR,
+        error.name,
+        error.message,
+        error.stack,
+        {
+          type: 'WorkerError'
+        }
+      ]);
+    }
+  }
+
+  _shutdown() {
+    // End the temporary streams so the merged streams end too
+    if (this._fakeStream) {
+      this._fakeStream.end();
+
+      this._fakeStream = null;
+    }
+
+    this._resolveExitPromise();
+  }
+
+  _onMessage(response) {
+    // TODO: Add appropriate type check
+    let error;
+
+    switch (response[0]) {
+      case _types.PARENT_MESSAGE_OK:
+        this._onProcessEnd(null, response[1]);
+
+        break;
+
+      case _types.PARENT_MESSAGE_CLIENT_ERROR:
+        error = response[4];
+
+        if (error != null && typeof error === 'object') {
+          const extra = error; // @ts-expect-error: no index
+
+          const NativeCtor = global[response[1]];
+          const Ctor = typeof NativeCtor === 'function' ? NativeCtor : Error;
+          error = new Ctor(response[2]);
+          error.type = response[1];
+          error.stack = response[3];
+
+          for (const key in extra) {
+            error[key] = extra[key];
+          }
+        }
+
+        this._onProcessEnd(error, null);
+
+        break;
+
+      case _types.PARENT_MESSAGE_SETUP_ERROR:
+        error = new Error('Error when calling setup: ' + response[2]);
+        error.type = response[1];
+        error.stack = response[3];
+
+        this._onProcessEnd(error, null);
+
+        break;
+
+      case _types.PARENT_MESSAGE_CUSTOM:
+        this._onCustomMessage(response[1]);
+
+        break;
+
+      default:
+        throw new TypeError('Unexpected response from worker: ' + response[0]);
+    }
+  }
+
+  _onExit(exitCode) {
+    if (
+      exitCode !== 0 &&
+      exitCode !== null &&
+      exitCode !== SIGTERM_EXIT_CODE &&
+      exitCode !== SIGKILL_EXIT_CODE
+    ) {
+      this.initialize();
+
+      if (this._request) {
+        this._child.send(this._request);
+      }
+    } else {
+      this._shutdown();
+    }
+  }
+
+  send(request, onProcessStart, onProcessEnd, onCustomMessage) {
+    onProcessStart(this);
+
+    this._onProcessEnd = (...args) => {
+      // Clean the request to avoid sending past requests to workers that fail
+      // while waiting for a new request (timers, unhandled rejections...)
+      this._request = null;
+      return onProcessEnd(...args);
+    };
+
+    this._onCustomMessage = (...arg) => onCustomMessage(...arg);
+
+    this._request = request;
+    this._retries = 0;
+
+    this._child.send(request, () => {});
+  }
+
+  waitForExit() {
+    return this._exitPromise;
+  }
+
+  forceExit() {
+    this._child.kill('SIGTERM');
+
+    const sigkillTimeout = setTimeout(
+      () => this._child.kill('SIGKILL'),
+      SIGKILL_DELAY
+    );
+
+    this._exitPromise.then(() => clearTimeout(sigkillTimeout));
+  }
+
+  getWorkerId() {
+    return this._options.workerId;
+  }
+
+  getStdout() {
+    return this._stdout;
+  }
+
+  getStderr() {
+    return this._stderr;
+  }
+
+  _getFakeStream() {
+    if (!this._fakeStream) {
+      this._fakeStream = new (_stream().PassThrough)();
+    }
+
+    return this._fakeStream;
+  }
+}
+
+exports.default = ChildProcessWorker;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/NodeThreadsWorker.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/NodeThreadsWorker.d.ts
new file mode 100644
index 0000000..4696ecc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/NodeThreadsWorker.d.ts
@@ -0,0 +1,34 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import { ChildMessage, OnCustomMessage, OnEnd, OnStart, WorkerInterface, WorkerOptions } from '../types';
+export default class ExperimentalWorker implements WorkerInterface {
+    private _worker;
+    private _options;
+    private _request;
+    private _retries;
+    private _onProcessEnd;
+    private _onCustomMessage;
+    private _fakeStream;
+    private _stdout;
+    private _stderr;
+    private _exitPromise;
+    private _resolveExitPromise;
+    private _forceExited;
+    constructor(options: WorkerOptions);
+    initialize(): void;
+    private _shutdown;
+    private _onMessage;
+    private _onExit;
+    waitForExit(): Promise<void>;
+    forceExit(): void;
+    send(request: ChildMessage, onProcessStart: OnStart, onProcessEnd: OnEnd | null, onCustomMessage: OnCustomMessage): void;
+    getWorkerId(): number;
+    getStdout(): NodeJS.ReadableStream | null;
+    getStderr(): NodeJS.ReadableStream | null;
+    private _getFakeStream;
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/NodeThreadsWorker.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/NodeThreadsWorker.js
new file mode 100644
index 0000000..21b7dd2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/NodeThreadsWorker.js
@@ -0,0 +1,344 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function path() {
+  const data = _interopRequireWildcard(require('path'));
+
+  path = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function _stream() {
+  const data = require('stream');
+
+  _stream = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function _worker_threads() {
+  const data = require('worker_threads');
+
+  _worker_threads = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function _mergeStream() {
+  const data = _interopRequireDefault(require('merge-stream'));
+
+  _mergeStream = function () {
+    return data;
+  };
+
+  return data;
+}
+
+var _types = require('../types');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+function _getRequireWildcardCache(nodeInterop) {
+  if (typeof WeakMap !== 'function') return null;
+  var cacheBabelInterop = new WeakMap();
+  var cacheNodeInterop = new WeakMap();
+  return (_getRequireWildcardCache = function (nodeInterop) {
+    return nodeInterop ? cacheNodeInterop : cacheBabelInterop;
+  })(nodeInterop);
+}
+
+function _interopRequireWildcard(obj, nodeInterop) {
+  if (!nodeInterop && obj && obj.__esModule) {
+    return obj;
+  }
+  if (obj === null || (typeof obj !== 'object' && typeof obj !== 'function')) {
+    return {default: obj};
+  }
+  var cache = _getRequireWildcardCache(nodeInterop);
+  if (cache && cache.has(obj)) {
+    return cache.get(obj);
+  }
+  var newObj = {};
+  var hasPropertyDescriptor =
+    Object.defineProperty && Object.getOwnPropertyDescriptor;
+  for (var key in obj) {
+    if (key !== 'default' && Object.prototype.hasOwnProperty.call(obj, key)) {
+      var desc = hasPropertyDescriptor
+        ? Object.getOwnPropertyDescriptor(obj, key)
+        : null;
+      if (desc && (desc.get || desc.set)) {
+        Object.defineProperty(newObj, key, desc);
+      } else {
+        newObj[key] = obj[key];
+      }
+    }
+  }
+  newObj.default = obj;
+  if (cache) {
+    cache.set(obj, newObj);
+  }
+  return newObj;
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+class ExperimentalWorker {
+  constructor(options) {
+    _defineProperty(this, '_worker', void 0);
+
+    _defineProperty(this, '_options', void 0);
+
+    _defineProperty(this, '_request', void 0);
+
+    _defineProperty(this, '_retries', void 0);
+
+    _defineProperty(this, '_onProcessEnd', void 0);
+
+    _defineProperty(this, '_onCustomMessage', void 0);
+
+    _defineProperty(this, '_fakeStream', void 0);
+
+    _defineProperty(this, '_stdout', void 0);
+
+    _defineProperty(this, '_stderr', void 0);
+
+    _defineProperty(this, '_exitPromise', void 0);
+
+    _defineProperty(this, '_resolveExitPromise', void 0);
+
+    _defineProperty(this, '_forceExited', void 0);
+
+    this._options = options;
+    this._request = null;
+    this._fakeStream = null;
+    this._stdout = null;
+    this._stderr = null;
+    this._exitPromise = new Promise(resolve => {
+      this._resolveExitPromise = resolve;
+    });
+    this._forceExited = false;
+    this.initialize();
+  }
+
+  initialize() {
+    this._worker = new (_worker_threads().Worker)(
+      path().resolve(__dirname, './threadChild.js'),
+      {
+        eval: false,
+        // @ts-expect-error: added in newer versions
+        resourceLimits: this._options.resourceLimits,
+        stderr: true,
+        stdout: true,
+        workerData: this._options.workerData,
+        ...this._options.forkOptions
+      }
+    );
+
+    if (this._worker.stdout) {
+      if (!this._stdout) {
+        // We need to add a permanent stream to the merged stream to prevent it
+        // from ending when the subprocess stream ends
+        this._stdout = (0, _mergeStream().default)(this._getFakeStream());
+      }
+
+      this._stdout.add(this._worker.stdout);
+    }
+
+    if (this._worker.stderr) {
+      if (!this._stderr) {
+        // We need to add a permanent stream to the merged stream to prevent it
+        // from ending when the subprocess stream ends
+        this._stderr = (0, _mergeStream().default)(this._getFakeStream());
+      }
+
+      this._stderr.add(this._worker.stderr);
+    }
+
+    this._worker.on('message', this._onMessage.bind(this));
+
+    this._worker.on('exit', this._onExit.bind(this));
+
+    this._worker.postMessage([
+      _types.CHILD_MESSAGE_INITIALIZE,
+      false,
+      this._options.workerPath,
+      this._options.setupArgs,
+      String(this._options.workerId + 1) // 0-indexed workerId, 1-indexed JEST_WORKER_ID
+    ]);
+
+    this._retries++; // If we exceeded the amount of retries, we will emulate an error reply
+    // coming from the child. This avoids code duplication related with cleaning
+    // the queue, and scheduling the next call.
+
+    if (this._retries > this._options.maxRetries) {
+      const error = new Error('Call retries were exceeded');
+
+      this._onMessage([
+        _types.PARENT_MESSAGE_CLIENT_ERROR,
+        error.name,
+        error.message,
+        error.stack,
+        {
+          type: 'WorkerError'
+        }
+      ]);
+    }
+  }
+
+  _shutdown() {
+    // End the permanent stream so the merged stream end too
+    if (this._fakeStream) {
+      this._fakeStream.end();
+
+      this._fakeStream = null;
+    }
+
+    this._resolveExitPromise();
+  }
+
+  _onMessage(response) {
+    let error;
+
+    switch (response[0]) {
+      case _types.PARENT_MESSAGE_OK:
+        this._onProcessEnd(null, response[1]);
+
+        break;
+
+      case _types.PARENT_MESSAGE_CLIENT_ERROR:
+        error = response[4];
+
+        if (error != null && typeof error === 'object') {
+          const extra = error; // @ts-expect-error: no index
+
+          const NativeCtor = global[response[1]];
+          const Ctor = typeof NativeCtor === 'function' ? NativeCtor : Error;
+          error = new Ctor(response[2]);
+          error.type = response[1];
+          error.stack = response[3];
+
+          for (const key in extra) {
+            // @ts-expect-error: no index
+            error[key] = extra[key];
+          }
+        }
+
+        this._onProcessEnd(error, null);
+
+        break;
+
+      case _types.PARENT_MESSAGE_SETUP_ERROR:
+        error = new Error('Error when calling setup: ' + response[2]); // @ts-expect-error: adding custom properties to errors.
+
+        error.type = response[1];
+        error.stack = response[3];
+
+        this._onProcessEnd(error, null);
+
+        break;
+
+      case _types.PARENT_MESSAGE_CUSTOM:
+        this._onCustomMessage(response[1]);
+
+        break;
+
+      default:
+        throw new TypeError('Unexpected response from worker: ' + response[0]);
+    }
+  }
+
+  _onExit(exitCode) {
+    if (exitCode !== 0 && !this._forceExited) {
+      this.initialize();
+
+      if (this._request) {
+        this._worker.postMessage(this._request);
+      }
+    } else {
+      this._shutdown();
+    }
+  }
+
+  waitForExit() {
+    return this._exitPromise;
+  }
+
+  forceExit() {
+    this._forceExited = true;
+
+    this._worker.terminate();
+  }
+
+  send(request, onProcessStart, onProcessEnd, onCustomMessage) {
+    onProcessStart(this);
+
+    this._onProcessEnd = (...args) => {
+      var _onProcessEnd;
+
+      // Clean the request to avoid sending past requests to workers that fail
+      // while waiting for a new request (timers, unhandled rejections...)
+      this._request = null;
+      const res =
+        (_onProcessEnd = onProcessEnd) === null || _onProcessEnd === void 0
+          ? void 0
+          : _onProcessEnd(...args); // Clean up the reference so related closures can be garbage collected.
+
+      onProcessEnd = null;
+      return res;
+    };
+
+    this._onCustomMessage = (...arg) => onCustomMessage(...arg);
+
+    this._request = request;
+    this._retries = 0;
+
+    this._worker.postMessage(request);
+  }
+
+  getWorkerId() {
+    return this._options.workerId;
+  }
+
+  getStdout() {
+    return this._stdout;
+  }
+
+  getStderr() {
+    return this._stderr;
+  }
+
+  _getFakeStream() {
+    if (!this._fakeStream) {
+      this._fakeStream = new (_stream().PassThrough)();
+    }
+
+    return this._fakeStream;
+  }
+}
+
+exports.default = ExperimentalWorker;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/messageParent.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/messageParent.d.ts
new file mode 100644
index 0000000..795bb35
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/messageParent.d.ts
@@ -0,0 +1,8 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+export default function messageParent(message: unknown, parentProcess?: NodeJS.Process): void;
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/messageParent.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/messageParent.js
new file mode 100644
index 0000000..51765ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/messageParent.js
@@ -0,0 +1,38 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = messageParent;
+
+var _types = require('../types');
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const isWorkerThread = (() => {
+  try {
+    // `Require` here to support Node v10
+    const {isMainThread, parentPort} = require('worker_threads');
+
+    return !isMainThread && parentPort != null;
+  } catch {
+    return false;
+  }
+})();
+
+function messageParent(message, parentProcess = process) {
+  if (isWorkerThread) {
+    // `Require` here to support Node v10
+    const {parentPort} = require('worker_threads'); // ! is safe due to `null` check in `isWorkerThread`
+
+    parentPort.postMessage([_types.PARENT_MESSAGE_CUSTOM, message]);
+  } else if (typeof parentProcess.send === 'function') {
+    parentProcess.send([_types.PARENT_MESSAGE_CUSTOM, message]);
+  } else {
+    throw new Error('"messageParent" can only be used inside a worker');
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/processChild.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/processChild.d.ts
new file mode 100644
index 0000000..fac0c7e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/processChild.d.ts
@@ -0,0 +1,7 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export {};
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/processChild.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/processChild.js
new file mode 100644
index 0000000..fdf766e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/processChild.js
@@ -0,0 +1,148 @@
+'use strict';
+
+var _types = require('../types');
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+let file = null;
+let setupArgs = [];
+let initialized = false;
+/**
+ * This file is a small bootstrapper for workers. It sets up the communication
+ * between the worker and the parent process, interpreting parent messages and
+ * sending results back.
+ *
+ * The file loaded will be lazily initialized the first time any of the workers
+ * is called. This is done for optimal performance: if the farm is initialized,
+ * but no call is made to it, child Node processes will be consuming the least
+ * possible amount of memory.
+ *
+ * If an invalid message is detected, the child will exit (by throwing) with a
+ * non-zero exit code.
+ */
+
+const messageListener = request => {
+  switch (request[0]) {
+    case _types.CHILD_MESSAGE_INITIALIZE:
+      const init = request;
+      file = init[2];
+      setupArgs = request[3];
+      break;
+
+    case _types.CHILD_MESSAGE_CALL:
+      const call = request;
+      execMethod(call[2], call[3]);
+      break;
+
+    case _types.CHILD_MESSAGE_END:
+      end();
+      break;
+
+    default:
+      throw new TypeError(
+        'Unexpected request from parent process: ' + request[0]
+      );
+  }
+};
+
+process.on('message', messageListener);
+
+function reportSuccess(result) {
+  if (!process || !process.send) {
+    throw new Error('Child can only be used on a forked process');
+  }
+
+  process.send([_types.PARENT_MESSAGE_OK, result]);
+}
+
+function reportClientError(error) {
+  return reportError(error, _types.PARENT_MESSAGE_CLIENT_ERROR);
+}
+
+function reportInitializeError(error) {
+  return reportError(error, _types.PARENT_MESSAGE_SETUP_ERROR);
+}
+
+function reportError(error, type) {
+  if (!process || !process.send) {
+    throw new Error('Child can only be used on a forked process');
+  }
+
+  if (error == null) {
+    error = new Error('"null" or "undefined" thrown');
+  }
+
+  process.send([
+    type,
+    error.constructor && error.constructor.name,
+    error.message,
+    error.stack,
+    typeof error === 'object' ? {...error} : error
+  ]);
+}
+
+function end() {
+  const main = require(file);
+
+  if (!main.teardown) {
+    exitProcess();
+    return;
+  }
+
+  execFunction(main.teardown, main, [], exitProcess, exitProcess);
+}
+
+function exitProcess() {
+  // Clean up open handles so the process ideally exits gracefully
+  process.removeListener('message', messageListener);
+}
+
+function execMethod(method, args) {
+  const main = require(file);
+
+  let fn;
+
+  if (method === 'default') {
+    fn = main.__esModule ? main['default'] : main;
+  } else {
+    fn = main[method];
+  }
+
+  function execHelper() {
+    execFunction(fn, main, args, reportSuccess, reportClientError);
+  }
+
+  if (initialized || !main.setup) {
+    execHelper();
+    return;
+  }
+
+  initialized = true;
+  execFunction(main.setup, main, setupArgs, execHelper, reportInitializeError);
+}
+
+const isPromise = obj =>
+  !!obj &&
+  (typeof obj === 'object' || typeof obj === 'function') &&
+  typeof obj.then === 'function';
+
+function execFunction(fn, ctx, args, onResult, onError) {
+  let result;
+
+  try {
+    result = fn.apply(ctx, args);
+  } catch (err) {
+    onError(err);
+    return;
+  }
+
+  if (isPromise(result)) {
+    result.then(onResult, onError);
+  } else {
+    onResult(result);
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/threadChild.d.ts b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/threadChild.d.ts
new file mode 100644
index 0000000..fac0c7e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/threadChild.d.ts
@@ -0,0 +1,7 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export {};
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/threadChild.js b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/threadChild.js
new file mode 100644
index 0000000..dae1e64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/build/workers/threadChild.js
@@ -0,0 +1,159 @@
+'use strict';
+
+function _worker_threads() {
+  const data = require('worker_threads');
+
+  _worker_threads = function () {
+    return data;
+  };
+
+  return data;
+}
+
+var _types = require('../types');
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+let file = null;
+let setupArgs = [];
+let initialized = false;
+/**
+ * This file is a small bootstrapper for workers. It sets up the communication
+ * between the worker and the parent process, interpreting parent messages and
+ * sending results back.
+ *
+ * The file loaded will be lazily initialized the first time any of the workers
+ * is called. This is done for optimal performance: if the farm is initialized,
+ * but no call is made to it, child Node processes will be consuming the least
+ * possible amount of memory.
+ *
+ * If an invalid message is detected, the child will exit (by throwing) with a
+ * non-zero exit code.
+ */
+
+const messageListener = request => {
+  switch (request[0]) {
+    case _types.CHILD_MESSAGE_INITIALIZE:
+      const init = request;
+      file = init[2];
+      setupArgs = request[3];
+      process.env.JEST_WORKER_ID = request[4];
+      break;
+
+    case _types.CHILD_MESSAGE_CALL:
+      const call = request;
+      execMethod(call[2], call[3]);
+      break;
+
+    case _types.CHILD_MESSAGE_END:
+      end();
+      break;
+
+    default:
+      throw new TypeError(
+        'Unexpected request from parent process: ' + request[0]
+      );
+  }
+};
+
+_worker_threads().parentPort.on('message', messageListener);
+
+function reportSuccess(result) {
+  if (_worker_threads().isMainThread) {
+    throw new Error('Child can only be used on a forked process');
+  }
+
+  _worker_threads().parentPort.postMessage([_types.PARENT_MESSAGE_OK, result]);
+}
+
+function reportClientError(error) {
+  return reportError(error, _types.PARENT_MESSAGE_CLIENT_ERROR);
+}
+
+function reportInitializeError(error) {
+  return reportError(error, _types.PARENT_MESSAGE_SETUP_ERROR);
+}
+
+function reportError(error, type) {
+  if (_worker_threads().isMainThread) {
+    throw new Error('Child can only be used on a forked process');
+  }
+
+  if (error == null) {
+    error = new Error('"null" or "undefined" thrown');
+  }
+
+  _worker_threads().parentPort.postMessage([
+    type,
+    error.constructor && error.constructor.name,
+    error.message,
+    error.stack,
+    typeof error === 'object' ? {...error} : error
+  ]);
+}
+
+function end() {
+  const main = require(file);
+
+  if (!main.teardown) {
+    exitProcess();
+    return;
+  }
+
+  execFunction(main.teardown, main, [], exitProcess, exitProcess);
+}
+
+function exitProcess() {
+  // Clean up open handles so the worker ideally exits gracefully
+  _worker_threads().parentPort.removeListener('message', messageListener);
+}
+
+function execMethod(method, args) {
+  const main = require(file);
+
+  let fn;
+
+  if (method === 'default') {
+    fn = main.__esModule ? main['default'] : main;
+  } else {
+    fn = main[method];
+  }
+
+  function execHelper() {
+    execFunction(fn, main, args, reportSuccess, reportClientError);
+  }
+
+  if (initialized || !main.setup) {
+    execHelper();
+    return;
+  }
+
+  initialized = true;
+  execFunction(main.setup, main, setupArgs, execHelper, reportInitializeError);
+}
+
+const isPromise = obj =>
+  !!obj &&
+  (typeof obj === 'object' || typeof obj === 'function') &&
+  typeof obj.then === 'function';
+
+function execFunction(fn, ctx, args, onResult, onError) {
+  let result;
+
+  try {
+    result = fn.apply(ctx, args);
+  } catch (err) {
+    onError(err);
+    return;
+  }
+
+  if (isPromise(result)) {
+    result.then(onResult, onError);
+  } else {
+    onResult(result);
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/jest-worker/package.json b/node_modules/mathjs/examples/node_modules/jest-worker/package.json
new file mode 100644
index 0000000..06280d1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/jest-worker/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "jest-worker",
+  "version": "27.5.1",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/facebook/jest.git",
+    "directory": "packages/jest-worker"
+  },
+  "license": "MIT",
+  "main": "./build/index.js",
+  "types": "./build/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./build/index.d.ts",
+      "default": "./build/index.js"
+    },
+    "./package.json": "./package.json"
+  },
+  "dependencies": {
+    "@types/node": "*",
+    "merge-stream": "^2.0.0",
+    "supports-color": "^8.0.0"
+  },
+  "devDependencies": {
+    "@types/merge-stream": "^1.1.2",
+    "@types/supports-color": "^8.1.0",
+    "get-stream": "^6.0.0",
+    "jest-leak-detector": "^27.5.1",
+    "worker-farm": "^1.6.0"
+  },
+  "engines": {
+    "node": ">= 10.13.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "67c1aa20c5fec31366d733e901fee2b981cb1850"
+}
diff --git a/node_modules/mathjs/examples/node_modules/json-parse-better-errors/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/CHANGELOG.md
new file mode 100644
index 0000000..b1d212d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/CHANGELOG.md
@@ -0,0 +1,46 @@
+# Change Log
+
+All notable changes to this project will be documented in this file. See [standard-version](https://github.com/conventional-changelog/standard-version) for commit guidelines.
+
+<a name="1.0.2"></a>
+## [1.0.2](https://github.com/zkat/json-parse-better-errors/compare/v1.0.1...v1.0.2) (2018-03-30)
+
+
+### Bug Fixes
+
+* **messages:** More friendly messages for non-string ([#1](https://github.com/zkat/json-parse-better-errors/issues/1)) ([a476d42](https://github.com/zkat/json-parse-better-errors/commit/a476d42))
+
+
+
+<a name="1.0.1"></a>
+## [1.0.1](https://github.com/zkat/json-parse-better-errors/compare/v1.0.0...v1.0.1) (2017-08-16)
+
+
+### Bug Fixes
+
+* **license:** oops. Forgot to update license.md ([efe2958](https://github.com/zkat/json-parse-better-errors/commit/efe2958))
+
+
+
+<a name="1.0.0"></a>
+# 1.0.0 (2017-08-15)
+
+
+### Features
+
+* **init:** Initial Commit ([562c977](https://github.com/zkat/json-parse-better-errors/commit/562c977))
+
+
+### BREAKING CHANGES
+
+* **init:** This is the first commit!
+
+
+
+<a name="0.1.0"></a>
+# 0.1.0 (2017-08-15)
+
+
+### Features
+
+* **init:** Initial Commit ([9dd1a19](https://github.com/zkat/json-parse-better-errors/commit/9dd1a19))
diff --git a/node_modules/mathjs/examples/node_modules/json-parse-better-errors/LICENSE.md b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/LICENSE.md
new file mode 100644
index 0000000..c51842c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/LICENSE.md
@@ -0,0 +1,7 @@
+Copyright 2017 Kat Marchán
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/json-parse-better-errors/README.md b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/README.md
new file mode 100644
index 0000000..a1f0f0a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/README.md
@@ -0,0 +1,46 @@
+# json-parse-better-errors [![npm version](https://img.shields.io/npm/v/json-parse-better-errors.svg)](https://npm.im/json-parse-better-errors) [![license](https://img.shields.io/npm/l/json-parse-better-errors.svg)](https://npm.im/json-parse-better-errors) [![Travis](https://img.shields.io/travis/zkat/json-parse-better-errors.svg)](https://travis-ci.org/zkat/json-parse-better-errors) [![AppVeyor](https://ci.appveyor.com/api/projects/status/github/zkat/json-parse-better-errors?svg=true)](https://ci.appveyor.com/project/zkat/json-parse-better-errors) [![Coverage Status](https://coveralls.io/repos/github/zkat/json-parse-better-errors/badge.svg?branch=latest)](https://coveralls.io/github/zkat/json-parse-better-errors?branch=latest)
+
+[`json-parse-better-errors`](https://github.com/zkat/json-parse-better-errors) is a Node.js library for
+getting nicer errors out of `JSON.parse()`, including context and position of the parse errors.
+
+## Install
+
+`$ npm install --save json-parse-better-errors`
+
+## Table of Contents
+
+* [Example](#example)
+* [Features](#features)
+* [Contributing](#contributing)
+* [API](#api)
+  * [`parse`](#parse)
+
+### Example
+
+```javascript
+const parseJson = require('json-parse-better-errors')
+
+parseJson('"foo"')
+parseJson('garbage') // more useful error message
+```
+
+### Features
+
+* Like JSON.parse, but the errors are better.
+
+### Contributing
+
+The npm team enthusiastically welcomes contributions and project participation! There's a bunch of things you can do if you want to contribute! The [Contributor Guide](CONTRIBUTING.md) has all the information you need for everything from reporting bugs to contributing entire new features. Please don't hesitate to jump in if you'd like to, or even ask us questions if something isn't clear.
+
+All participants and maintainers in this project are expected to follow [Code of Conduct](CODE_OF_CONDUCT.md), and just generally be excellent to each other.
+
+Please refer to the [Changelog](CHANGELOG.md) for project history details, too.
+
+Happy hacking!
+
+### API
+
+#### <a name="parse"></a> `> parse(txt, ?reviver, ?context=20)`
+
+Works just like `JSON.parse`, but will include a bit more information when an
+error happens.
diff --git a/node_modules/mathjs/examples/node_modules/json-parse-better-errors/index.js b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/index.js
new file mode 100644
index 0000000..14644c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/index.js
@@ -0,0 +1,38 @@
+'use strict'
+
+module.exports = parseJson
+function parseJson (txt, reviver, context) {
+  context = context || 20
+  try {
+    return JSON.parse(txt, reviver)
+  } catch (e) {
+    if (typeof txt !== 'string') {
+      const isEmptyArray = Array.isArray(txt) && txt.length === 0
+      const errorMessage = 'Cannot parse ' +
+      (isEmptyArray ? 'an empty array' : String(txt))
+      throw new TypeError(errorMessage)
+    }
+    const syntaxErr = e.message.match(/^Unexpected token.*position\s+(\d+)/i)
+    const errIdx = syntaxErr
+    ? +syntaxErr[1]
+    : e.message.match(/^Unexpected end of JSON.*/i)
+    ? txt.length - 1
+    : null
+    if (errIdx != null) {
+      const start = errIdx <= context
+      ? 0
+      : errIdx - context
+      const end = errIdx + context >= txt.length
+      ? txt.length
+      : errIdx + context
+      e.message += ` while parsing near '${
+        start === 0 ? '' : '...'
+      }${txt.slice(start, end)}${
+        end === txt.length ? '' : '...'
+      }'`
+    } else {
+      e.message += ` while parsing '${txt.slice(0, context * 2)}'`
+    }
+    throw e
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/json-parse-better-errors/package.json b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/package.json
new file mode 100644
index 0000000..c4c2c20
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-parse-better-errors/package.json
@@ -0,0 +1,45 @@
+{
+  "name": "json-parse-better-errors",
+  "version": "1.0.2",
+  "description": "JSON.parse with context information on error",
+  "main": "index.js",
+  "files": [
+    "*.js"
+  ],
+  "scripts": {
+    "prerelease": "npm t",
+    "postrelease": "npm publish && git push --follow-tags",
+    "pretest": "standard",
+    "release": "standard-version -s",
+    "test": "tap -J --coverage test/*.js",
+    "update-coc": "weallbehave -o . && git add CODE_OF_CONDUCT.md && git commit -m 'docs(coc): updated CODE_OF_CONDUCT.md'",
+    "update-contrib": "weallcontribute -o . && git add CONTRIBUTING.md && git commit -m 'docs(contributing): updated CONTRIBUTING.md'"
+  },
+  "repository": "https://github.com/zkat/json-parse-better-errors",
+  "keywords": [
+    "JSON",
+    "parser"
+  ],
+  "author": {
+    "name": "Kat Marchán",
+    "email": "kzm@zkat.tech",
+    "twitter": "maybekatz"
+  },
+  "license": "MIT",
+  "devDependencies": {
+    "nyc": "^10.3.2",
+    "standard": "^9.0.2",
+    "standard-version": "^4.1.0",
+    "tap": "^10.3.3",
+    "weallbehave": "^1.2.0",
+    "weallcontribute": "^1.0.8"
+  },
+  "config": {
+    "nyc": {
+      "exclude": [
+        "node_modules/**",
+        "test/**"
+      ]
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/.eslintrc.yml b/node_modules/mathjs/examples/node_modules/json-schema-traverse/.eslintrc.yml
new file mode 100644
index 0000000..ab1762d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/.eslintrc.yml
@@ -0,0 +1,27 @@
+extends: eslint:recommended
+env:
+  node: true
+  browser: true
+rules:
+  block-scoped-var: 2
+  complexity: [2, 13]
+  curly: [2, multi-or-nest, consistent]
+  dot-location: [2, property]
+  dot-notation: 2
+  indent: [2, 2, SwitchCase: 1]
+  linebreak-style: [2, unix]
+  new-cap: 2
+  no-console: [2, allow: [warn, error]]
+  no-else-return: 2
+  no-eq-null: 2
+  no-fallthrough: 2
+  no-invalid-this: 2
+  no-return-assign: 2
+  no-shadow: 1
+  no-trailing-spaces: 2
+  no-use-before-define: [2, nofunc]
+  quotes: [2, single, avoid-escape]
+  semi: [2, always]
+  strict: [2, global]
+  valid-jsdoc: [2, requireReturn: false]
+  no-control-regex: 0
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/.travis.yml b/node_modules/mathjs/examples/node_modules/json-schema-traverse/.travis.yml
new file mode 100644
index 0000000..7ddce74
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/.travis.yml
@@ -0,0 +1,8 @@
+language: node_js
+node_js:
+  - "4"
+  - "6"
+  - "7"
+  - "8"
+after_script:
+  - coveralls < coverage/lcov.info
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/LICENSE b/node_modules/mathjs/examples/node_modules/json-schema-traverse/LICENSE
new file mode 100644
index 0000000..7f15435
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 Evgeny Poberezkin
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/README.md b/node_modules/mathjs/examples/node_modules/json-schema-traverse/README.md
new file mode 100644
index 0000000..d5ccaf4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/README.md
@@ -0,0 +1,83 @@
+# json-schema-traverse
+Traverse JSON Schema passing each schema object to callback
+
+[![Build Status](https://travis-ci.org/epoberezkin/json-schema-traverse.svg?branch=master)](https://travis-ci.org/epoberezkin/json-schema-traverse)
+[![npm version](https://badge.fury.io/js/json-schema-traverse.svg)](https://www.npmjs.com/package/json-schema-traverse)
+[![Coverage Status](https://coveralls.io/repos/github/epoberezkin/json-schema-traverse/badge.svg?branch=master)](https://coveralls.io/github/epoberezkin/json-schema-traverse?branch=master)
+
+
+## Install
+
+```
+npm install json-schema-traverse
+```
+
+
+## Usage
+
+```javascript
+const traverse = require('json-schema-traverse');
+const schema = {
+  properties: {
+    foo: {type: 'string'},
+    bar: {type: 'integer'}
+  }
+};
+
+traverse(schema, {cb});
+// cb is called 3 times with:
+// 1. root schema
+// 2. {type: 'string'}
+// 3. {type: 'integer'}
+
+// Or:
+
+traverse(schema, {cb: {pre, post}});
+// pre is called 3 times with:
+// 1. root schema
+// 2. {type: 'string'}
+// 3. {type: 'integer'}
+//
+// post is called 3 times with:
+// 1. {type: 'string'}
+// 2. {type: 'integer'}
+// 3. root schema
+
+```
+
+Callback function `cb` is called for each schema object (not including draft-06 boolean schemas), including the root schema, in pre-order traversal. Schema references ($ref) are not resolved, they are passed as is.  Alternatively, you can pass a `{pre, post}` object as `cb`, and then `pre` will be called before traversing child elements, and `post` will be called after all child elements have been traversed.
+
+Callback is passed these parameters:
+
+- _schema_: the current schema object
+- _JSON pointer_: from the root schema to the current schema object
+- _root schema_: the schema passed to `traverse` object
+- _parent JSON pointer_: from the root schema to the parent schema object (see below)
+- _parent keyword_: the keyword inside which this schema appears (e.g. `properties`, `anyOf`, etc.)
+- _parent schema_: not necessarily parent object/array; in the example above the parent schema for `{type: 'string'}` is the root schema
+- _index/property_: index or property name in the array/object containing multiple schemas; in the example above for `{type: 'string'}` the property name is `'foo'`
+
+
+## Traverse objects in all unknown keywords
+
+```javascript
+const traverse = require('json-schema-traverse');
+const schema = {
+  mySchema: {
+    minimum: 1,
+    maximum: 2
+  }
+};
+
+traverse(schema, {allKeys: true, cb});
+// cb is called 2 times with:
+// 1. root schema
+// 2. mySchema
+```
+
+Without option `allKeys: true` callback will be called only with root schema.
+
+
+## License
+
+[MIT](https://github.com/epoberezkin/json-schema-traverse/blob/master/LICENSE)
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/index.js b/node_modules/mathjs/examples/node_modules/json-schema-traverse/index.js
new file mode 100644
index 0000000..d4a18df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/index.js
@@ -0,0 +1,89 @@
+'use strict';
+
+var traverse = module.exports = function (schema, opts, cb) {
+  // Legacy support for v0.3.1 and earlier.
+  if (typeof opts == 'function') {
+    cb = opts;
+    opts = {};
+  }
+
+  cb = opts.cb || cb;
+  var pre = (typeof cb == 'function') ? cb : cb.pre || function() {};
+  var post = cb.post || function() {};
+
+  _traverse(opts, pre, post, schema, '', schema);
+};
+
+
+traverse.keywords = {
+  additionalItems: true,
+  items: true,
+  contains: true,
+  additionalProperties: true,
+  propertyNames: true,
+  not: true
+};
+
+traverse.arrayKeywords = {
+  items: true,
+  allOf: true,
+  anyOf: true,
+  oneOf: true
+};
+
+traverse.propsKeywords = {
+  definitions: true,
+  properties: true,
+  patternProperties: true,
+  dependencies: true
+};
+
+traverse.skipKeywords = {
+  default: true,
+  enum: true,
+  const: true,
+  required: true,
+  maximum: true,
+  minimum: true,
+  exclusiveMaximum: true,
+  exclusiveMinimum: true,
+  multipleOf: true,
+  maxLength: true,
+  minLength: true,
+  pattern: true,
+  format: true,
+  maxItems: true,
+  minItems: true,
+  uniqueItems: true,
+  maxProperties: true,
+  minProperties: true
+};
+
+
+function _traverse(opts, pre, post, schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex) {
+  if (schema && typeof schema == 'object' && !Array.isArray(schema)) {
+    pre(schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex);
+    for (var key in schema) {
+      var sch = schema[key];
+      if (Array.isArray(sch)) {
+        if (key in traverse.arrayKeywords) {
+          for (var i=0; i<sch.length; i++)
+            _traverse(opts, pre, post, sch[i], jsonPtr + '/' + key + '/' + i, rootSchema, jsonPtr, key, schema, i);
+        }
+      } else if (key in traverse.propsKeywords) {
+        if (sch && typeof sch == 'object') {
+          for (var prop in sch)
+            _traverse(opts, pre, post, sch[prop], jsonPtr + '/' + key + '/' + escapeJsonPtr(prop), rootSchema, jsonPtr, key, schema, prop);
+        }
+      } else if (key in traverse.keywords || (opts.allKeys && !(key in traverse.skipKeywords))) {
+        _traverse(opts, pre, post, sch, jsonPtr + '/' + key, rootSchema, jsonPtr, key, schema);
+      }
+    }
+    post(schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex);
+  }
+}
+
+
+function escapeJsonPtr(str) {
+  return str.replace(/~/g, '~0').replace(/\//g, '~1');
+}
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/package.json b/node_modules/mathjs/examples/node_modules/json-schema-traverse/package.json
new file mode 100644
index 0000000..1566063
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/package.json
@@ -0,0 +1,43 @@
+{
+  "name": "json-schema-traverse",
+  "version": "0.4.1",
+  "description": "Traverse JSON Schema passing each schema object to callback",
+  "main": "index.js",
+  "scripts": {
+    "eslint": "eslint index.js spec",
+    "test-spec": "mocha spec -R spec",
+    "test": "npm run eslint && nyc npm run test-spec"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/epoberezkin/json-schema-traverse.git"
+  },
+  "keywords": [
+    "JSON-Schema",
+    "traverse",
+    "iterate"
+  ],
+  "author": "Evgeny Poberezkin",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/epoberezkin/json-schema-traverse/issues"
+  },
+  "homepage": "https://github.com/epoberezkin/json-schema-traverse#readme",
+  "devDependencies": {
+    "coveralls": "^2.13.1",
+    "eslint": "^3.19.0",
+    "mocha": "^3.4.2",
+    "nyc": "^11.0.2",
+    "pre-commit": "^1.2.2"
+  },
+  "nyc": {
+    "exclude": [
+      "**/spec/**",
+      "node_modules"
+    ],
+    "reporter": [
+      "lcov",
+      "text-summary"
+    ]
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/.eslintrc.yml b/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/.eslintrc.yml
new file mode 100644
index 0000000..3344da7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/.eslintrc.yml
@@ -0,0 +1,6 @@
+parserOptions:
+  ecmaVersion: 6
+globals:
+  beforeEach: false
+  describe: false
+  it: false
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/fixtures/schema.js b/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/fixtures/schema.js
new file mode 100644
index 0000000..c51430c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/fixtures/schema.js
@@ -0,0 +1,125 @@
+'use strict';
+
+var schema = {
+  additionalItems: subschema('additionalItems'),
+  items: subschema('items'),
+  contains: subschema('contains'),
+  additionalProperties: subschema('additionalProperties'),
+  propertyNames: subschema('propertyNames'),
+  not: subschema('not'),
+  allOf: [
+    subschema('allOf_0'),
+    subschema('allOf_1'),
+    {
+      items: [
+        subschema('items_0'),
+        subschema('items_1'),
+      ]
+    }
+  ],
+  anyOf: [
+    subschema('anyOf_0'),
+    subschema('anyOf_1'),
+  ],
+  oneOf: [
+    subschema('oneOf_0'),
+    subschema('oneOf_1'),
+  ],
+  definitions: {
+    foo: subschema('definitions_foo'),
+    bar: subschema('definitions_bar'),
+  },
+  properties: {
+    foo: subschema('properties_foo'),
+    bar: subschema('properties_bar'),
+  },
+  patternProperties: {
+    foo: subschema('patternProperties_foo'),
+    bar: subschema('patternProperties_bar'),
+  },
+  dependencies: {
+    foo: subschema('dependencies_foo'),
+    bar: subschema('dependencies_bar'),
+  },
+  required: ['foo', 'bar']
+};
+
+
+function subschema(keyword) {
+  var sch = {
+    properties: {},
+    additionalProperties: false,
+    additionalItems: false,
+    anyOf: [
+      {format: 'email'},
+      {format: 'hostname'}
+    ]
+  };
+  sch.properties['foo_' + keyword] = {title: 'foo'};
+  sch.properties['bar_' + keyword] = {title: 'bar'};
+  return sch;
+}
+
+
+module.exports = {
+  schema: schema,
+
+  // schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex
+  expectedCalls: [[schema, '', schema, undefined, undefined, undefined, undefined]]
+    .concat(expectedCalls('additionalItems'))
+    .concat(expectedCalls('items'))
+    .concat(expectedCalls('contains'))
+    .concat(expectedCalls('additionalProperties'))
+    .concat(expectedCalls('propertyNames'))
+    .concat(expectedCalls('not'))
+    .concat(expectedCallsChild('allOf', 0))
+    .concat(expectedCallsChild('allOf', 1))
+    .concat([
+      [schema.allOf[2], '/allOf/2', schema, '', 'allOf', schema, 2],
+      [schema.allOf[2].items[0], '/allOf/2/items/0', schema, '/allOf/2', 'items', schema.allOf[2], 0],
+      [schema.allOf[2].items[0].properties.foo_items_0, '/allOf/2/items/0/properties/foo_items_0', schema, '/allOf/2/items/0', 'properties', schema.allOf[2].items[0], 'foo_items_0'],
+      [schema.allOf[2].items[0].properties.bar_items_0, '/allOf/2/items/0/properties/bar_items_0', schema, '/allOf/2/items/0', 'properties', schema.allOf[2].items[0], 'bar_items_0'],
+      [schema.allOf[2].items[0].anyOf[0], '/allOf/2/items/0/anyOf/0', schema, '/allOf/2/items/0', 'anyOf', schema.allOf[2].items[0], 0],
+      [schema.allOf[2].items[0].anyOf[1], '/allOf/2/items/0/anyOf/1', schema, '/allOf/2/items/0', 'anyOf', schema.allOf[2].items[0], 1],
+
+      [schema.allOf[2].items[1], '/allOf/2/items/1', schema, '/allOf/2', 'items', schema.allOf[2], 1],
+      [schema.allOf[2].items[1].properties.foo_items_1, '/allOf/2/items/1/properties/foo_items_1', schema, '/allOf/2/items/1', 'properties', schema.allOf[2].items[1], 'foo_items_1'],
+      [schema.allOf[2].items[1].properties.bar_items_1, '/allOf/2/items/1/properties/bar_items_1', schema, '/allOf/2/items/1', 'properties', schema.allOf[2].items[1], 'bar_items_1'],
+      [schema.allOf[2].items[1].anyOf[0], '/allOf/2/items/1/anyOf/0', schema, '/allOf/2/items/1', 'anyOf', schema.allOf[2].items[1], 0],
+      [schema.allOf[2].items[1].anyOf[1], '/allOf/2/items/1/anyOf/1', schema, '/allOf/2/items/1', 'anyOf', schema.allOf[2].items[1], 1]
+    ])
+    .concat(expectedCallsChild('anyOf', 0))
+    .concat(expectedCallsChild('anyOf', 1))
+    .concat(expectedCallsChild('oneOf', 0))
+    .concat(expectedCallsChild('oneOf', 1))
+    .concat(expectedCallsChild('definitions', 'foo'))
+    .concat(expectedCallsChild('definitions', 'bar'))
+    .concat(expectedCallsChild('properties', 'foo'))
+    .concat(expectedCallsChild('properties', 'bar'))
+    .concat(expectedCallsChild('patternProperties', 'foo'))
+    .concat(expectedCallsChild('patternProperties', 'bar'))
+    .concat(expectedCallsChild('dependencies', 'foo'))
+    .concat(expectedCallsChild('dependencies', 'bar'))
+};
+
+
+function expectedCalls(keyword) {
+  return [
+    [schema[keyword], `/${keyword}`, schema, '', keyword, schema, undefined],
+    [schema[keyword].properties[`foo_${keyword}`], `/${keyword}/properties/foo_${keyword}`, schema, `/${keyword}`, 'properties', schema[keyword], `foo_${keyword}`],
+    [schema[keyword].properties[`bar_${keyword}`], `/${keyword}/properties/bar_${keyword}`, schema, `/${keyword}`, 'properties', schema[keyword], `bar_${keyword}`],
+    [schema[keyword].anyOf[0], `/${keyword}/anyOf/0`, schema, `/${keyword}`, 'anyOf', schema[keyword], 0],
+    [schema[keyword].anyOf[1], `/${keyword}/anyOf/1`, schema, `/${keyword}`, 'anyOf', schema[keyword], 1]
+  ];
+}
+
+
+function expectedCallsChild(keyword, i) {
+  return [
+    [schema[keyword][i], `/${keyword}/${i}`, schema, '', keyword, schema, i],
+    [schema[keyword][i].properties[`foo_${keyword}_${i}`], `/${keyword}/${i}/properties/foo_${keyword}_${i}`, schema, `/${keyword}/${i}`, 'properties', schema[keyword][i], `foo_${keyword}_${i}`],
+    [schema[keyword][i].properties[`bar_${keyword}_${i}`], `/${keyword}/${i}/properties/bar_${keyword}_${i}`, schema, `/${keyword}/${i}`, 'properties', schema[keyword][i], `bar_${keyword}_${i}`],
+    [schema[keyword][i].anyOf[0], `/${keyword}/${i}/anyOf/0`, schema, `/${keyword}/${i}`, 'anyOf', schema[keyword][i], 0],
+    [schema[keyword][i].anyOf[1], `/${keyword}/${i}/anyOf/1`, schema, `/${keyword}/${i}`, 'anyOf', schema[keyword][i], 1]
+  ];
+}
diff --git a/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/index.spec.js b/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/index.spec.js
new file mode 100644
index 0000000..c76b64f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/json-schema-traverse/spec/index.spec.js
@@ -0,0 +1,171 @@
+'use strict';
+
+var traverse = require('../index');
+var assert = require('assert');
+
+describe('json-schema-traverse', function() {
+  var calls;
+
+  beforeEach(function() {
+    calls = [];
+  });
+
+  it('should traverse all keywords containing schemas recursively', function() {
+    var schema = require('./fixtures/schema').schema;
+    var expectedCalls = require('./fixtures/schema').expectedCalls;
+
+    traverse(schema, {cb: callback});
+    assert.deepStrictEqual(calls, expectedCalls);
+  });
+
+  describe('Legacy v0.3.1 API', function() {
+    it('should traverse all keywords containing schemas recursively', function() {
+      var schema = require('./fixtures/schema').schema;
+      var expectedCalls = require('./fixtures/schema').expectedCalls;
+
+      traverse(schema, callback);
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+
+    it('should work when an options object is provided', function() {
+      // schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex
+      var schema = require('./fixtures/schema').schema;
+      var expectedCalls = require('./fixtures/schema').expectedCalls;
+
+      traverse(schema, {}, callback);
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+  });
+
+
+  describe('allKeys option', function() {
+    var schema = {
+      someObject: {
+        minimum: 1,
+        maximum: 2
+      }
+    };
+
+    it('should traverse objects with allKeys: true option', function() {
+      // schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex
+      var expectedCalls = [
+        [schema, '', schema, undefined, undefined, undefined, undefined],
+        [schema.someObject, '/someObject', schema, '', 'someObject', schema, undefined]
+      ];
+
+      traverse(schema, {allKeys: true, cb: callback});
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+
+
+    it('should NOT traverse objects with allKeys: false option', function() {
+      // schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex
+      var expectedCalls = [
+        [schema, '', schema, undefined, undefined, undefined, undefined]
+      ];
+
+      traverse(schema, {allKeys: false, cb: callback});
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+
+
+    it('should NOT traverse objects without allKeys option', function() {
+      // schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex
+      var expectedCalls = [
+        [schema, '', schema, undefined, undefined, undefined, undefined]
+      ];
+
+      traverse(schema, {cb: callback});
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+
+
+    it('should NOT travers objects in standard keywords which value is not a schema', function() {
+      var schema2 = {
+        const: {foo: 'bar'},
+        enum: ['a', 'b'],
+        required: ['foo'],
+        another: {
+
+        },
+        patternProperties: {}, // will not traverse - no properties
+        dependencies: true, // will not traverse - invalid
+        properties: {
+          smaller: {
+            type: 'number'
+          },
+          larger: {
+            type: 'number',
+            minimum: {$data: '1/smaller'}
+          }
+        }
+      };
+
+      // schema, jsonPtr, rootSchema, parentJsonPtr, parentKeyword, parentSchema, keyIndex
+      var expectedCalls = [
+        [schema2, '', schema2, undefined, undefined, undefined, undefined],
+        [schema2.another, '/another', schema2, '', 'another', schema2, undefined],
+        [schema2.properties.smaller, '/properties/smaller', schema2, '', 'properties', schema2, 'smaller'],
+        [schema2.properties.larger, '/properties/larger', schema2, '', 'properties', schema2, 'larger'],
+      ];
+
+      traverse(schema2, {allKeys: true, cb: callback});
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+  });
+
+  describe('pre and post', function() {
+    var schema = {
+      type: 'object',
+      properties: {
+        name: {type: 'string'},
+        age: {type: 'number'}
+      }
+    };
+
+    it('should traverse schema in pre-order', function() {
+      traverse(schema, {cb: {pre}});
+      var expectedCalls = [
+        ['pre', schema, '', schema, undefined, undefined, undefined, undefined],
+        ['pre', schema.properties.name, '/properties/name', schema, '', 'properties', schema, 'name'],
+        ['pre', schema.properties.age, '/properties/age', schema, '', 'properties', schema, 'age'],
+      ];
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+
+    it('should traverse schema in post-order', function() {
+      traverse(schema, {cb: {post}});
+      var expectedCalls = [
+        ['post', schema.properties.name, '/properties/name', schema, '', 'properties', schema, 'name'],
+        ['post', schema.properties.age, '/properties/age', schema, '', 'properties', schema, 'age'],
+        ['post', schema, '', schema, undefined, undefined, undefined, undefined],
+      ];
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+
+    it('should traverse schema in pre- and post-order at the same time', function() {
+      traverse(schema, {cb: {pre, post}});
+      var expectedCalls = [
+        ['pre', schema, '', schema, undefined, undefined, undefined, undefined],
+        ['pre', schema.properties.name, '/properties/name', schema, '', 'properties', schema, 'name'],
+        ['post', schema.properties.name, '/properties/name', schema, '', 'properties', schema, 'name'],
+        ['pre', schema.properties.age, '/properties/age', schema, '', 'properties', schema, 'age'],
+        ['post', schema.properties.age, '/properties/age', schema, '', 'properties', schema, 'age'],
+        ['post', schema, '', schema, undefined, undefined, undefined, undefined],
+      ];
+      assert.deepStrictEqual(calls, expectedCalls);
+    });
+  });
+
+  function callback() {
+    calls.push(Array.prototype.slice.call(arguments));
+  }
+
+  function pre() {
+    calls.push(['pre'].concat(Array.prototype.slice.call(arguments)));
+  }
+
+  function post() {
+    calls.push(['post'].concat(Array.prototype.slice.call(arguments)));
+  }
+});
diff --git a/node_modules/mathjs/examples/node_modules/kind-of/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/kind-of/CHANGELOG.md
new file mode 100644
index 0000000..01687d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/kind-of/CHANGELOG.md
@@ -0,0 +1,160 @@
+# Release history
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](http://keepachangelog.com/en/1.0.0/)
+and this project adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.html).
+
+<details>
+  <summary><strong>Guiding Principles</strong></summary>
+
+- Changelogs are for humans, not machines.
+- There should be an entry for every single version.
+- The same types of changes should be grouped.
+- Versions and sections should be linkable.
+- The latest version comes first.
+- The release date of each versions is displayed.
+- Mention whether you follow Semantic Versioning.
+
+</details>
+
+<details>
+  <summary><strong>Types of changes</strong></summary>
+
+Changelog entries are classified using the following labels _(from [keep-a-changelog](http://keepachangelog.com/)_):
+
+- `Added` for new features.
+- `Changed` for changes in existing functionality.
+- `Deprecated` for soon-to-be removed features.
+- `Removed` for now removed features.
+- `Fixed` for any bug fixes.
+- `Security` in case of vulnerabilities.
+
+</details>
+
+## [6.0.3] - 2020-01-16
+
+- Merge pull request #31 for issue #30
+
+## [6.0.0] - 2017-10-13
+
+- refactor code to be more performant
+- refactor benchmarks
+
+## [5.1.0] - 2017-10-13
+
+**Added**
+
+- Merge pull request #15 from aretecode/patch-1
+- adds support and tests for string & array iterators
+
+**Changed**
+
+- updates benchmarks
+
+## [5.0.2] - 2017-08-02
+
+- Merge pull request #14 from struct78/master
+- Added `undefined` check
+
+## [5.0.0] - 2017-06-21
+
+- Merge pull request #12 from aretecode/iterator
+- Set Iterator + Map Iterator
+- streamline `isbuffer`, minor edits
+
+## [4.0.0] - 2017-05-19
+
+- Merge pull request #8 from tunnckoCore/master
+- update deps
+
+## [3.2.2] - 2017-05-16
+
+- fix version
+
+## [3.2.1] - 2017-05-16
+
+- add browserify
+
+## [3.2.0] - 2017-04-25
+
+- Merge pull request #10 from ksheedlo/unrequire-buffer
+- add `promise` support and tests
+- Remove unnecessary `Buffer` check
+
+## [3.1.0] - 2016-12-07
+
+- Merge pull request #7 from laggingreflex/err
+- add support for `error` and tests
+- run update
+
+## [3.0.4] - 2016-07-29
+
+- move tests
+- run update
+
+## [3.0.3] - 2016-05-03
+
+- fix prepublish script
+- remove unused dep
+
+## [3.0.0] - 2015-11-17
+
+- add typed array support
+- Merge pull request #5 from miguelmota/typed-arrays
+- adds new tests
+
+## [2.0.1] - 2015-08-21
+
+- use `is-buffer` module
+
+## [2.0.0] - 2015-05-31
+
+- Create fallback for `Array.isArray` if used as a browser package
+- Merge pull request #2 from dtothefp/patch-1
+- Merge pull request #3 from pdehaan/patch-1
+- Merge branch 'master' of https://github.com/chorks/kind-of into chorks-master
+- optimizations, mostly date and regex
+
+## [1.1.0] - 2015-02-09
+
+- adds `buffer` support
+- adds tests for `buffer`
+
+## [1.0.0] - 2015-01-19
+
+- update benchmarks
+- optimizations based on benchmarks
+
+## [0.1.2] - 2014-10-26
+
+- return `typeof` value if it's not an object. very slight speed improvement
+- use `.slice`
+- adds benchmarks
+
+## [0.1.0] - 2014-9-26
+
+- first commit
+
+[6.0.0]: https://github.com/jonschlinkert/kind-of/compare/5.1.0...6.0.0
+[5.1.0]: https://github.com/jonschlinkert/kind-of/compare/5.0.2...5.1.0
+[5.0.2]: https://github.com/jonschlinkert/kind-of/compare/5.0.1...5.0.2
+[5.0.1]: https://github.com/jonschlinkert/kind-of/compare/5.0.0...5.0.1
+[5.0.0]: https://github.com/jonschlinkert/kind-of/compare/4.0.0...5.0.0
+[4.0.0]: https://github.com/jonschlinkert/kind-of/compare/3.2.2...4.0.0
+[3.2.2]: https://github.com/jonschlinkert/kind-of/compare/3.2.1...3.2.2
+[3.2.1]: https://github.com/jonschlinkert/kind-of/compare/3.2.0...3.2.1
+[3.2.0]: https://github.com/jonschlinkert/kind-of/compare/3.1.0...3.2.0
+[3.1.0]: https://github.com/jonschlinkert/kind-of/compare/3.0.4...3.1.0
+[3.0.4]: https://github.com/jonschlinkert/kind-of/compare/3.0.3...3.0.4
+[3.0.3]: https://github.com/jonschlinkert/kind-of/compare/3.0.0...3.0.3
+[3.0.0]: https://github.com/jonschlinkert/kind-of/compare/2.0.1...3.0.0
+[2.0.1]: https://github.com/jonschlinkert/kind-of/compare/2.0.0...2.0.1
+[2.0.0]: https://github.com/jonschlinkert/kind-of/compare/1.1.0...2.0.0
+[1.1.0]: https://github.com/jonschlinkert/kind-of/compare/1.0.0...1.1.0
+[1.0.0]: https://github.com/jonschlinkert/kind-of/compare/0.1.2...1.0.0
+[0.1.2]: https://github.com/jonschlinkert/kind-of/compare/0.1.0...0.1.2
+[0.1.0]: https://github.com/jonschlinkert/kind-of/commit/2fae09b0b19b1aadb558e9be39f0c3ef6034eb87
+
+[Unreleased]: https://github.com/jonschlinkert/kind-of/compare/0.1.2...HEAD
+[keep-a-changelog]: https://github.com/olivierlacan/keep-a-changelog
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/kind-of/LICENSE b/node_modules/mathjs/examples/node_modules/kind-of/LICENSE
new file mode 100644
index 0000000..3f2eca1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/kind-of/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2017, Jon Schlinkert.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/kind-of/README.md b/node_modules/mathjs/examples/node_modules/kind-of/README.md
new file mode 100644
index 0000000..0411dc5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/kind-of/README.md
@@ -0,0 +1,367 @@
+# kind-of [![NPM version](https://img.shields.io/npm/v/kind-of.svg?style=flat)](https://www.npmjs.com/package/kind-of) [![NPM monthly downloads](https://img.shields.io/npm/dm/kind-of.svg?style=flat)](https://npmjs.org/package/kind-of) [![NPM total downloads](https://img.shields.io/npm/dt/kind-of.svg?style=flat)](https://npmjs.org/package/kind-of) [![Linux Build Status](https://img.shields.io/travis/jonschlinkert/kind-of.svg?style=flat&label=Travis)](https://travis-ci.org/jonschlinkert/kind-of)
+
+> Get the native type of a value.
+
+Please consider following this project's author, [Jon Schlinkert](https://github.com/jonschlinkert), and consider starring the project to show your :heart: and support.
+
+## Install
+
+Install with [npm](https://www.npmjs.com/):
+
+```sh
+$ npm install --save kind-of
+```
+
+Install with [bower](https://bower.io/)
+
+```sh
+$ bower install kind-of --save
+```
+
+## Why use this?
+
+1. [it's fast](#benchmarks) | [optimizations](#optimizations)
+2. [better type checking](#better-type-checking)
+
+## Usage
+
+> es5, es6, and browser ready
+
+```js
+var kindOf = require('kind-of');
+
+kindOf(undefined);
+//=> 'undefined'
+
+kindOf(null);
+//=> 'null'
+
+kindOf(true);
+//=> 'boolean'
+
+kindOf(false);
+//=> 'boolean'
+
+kindOf(new Buffer(''));
+//=> 'buffer'
+
+kindOf(42);
+//=> 'number'
+
+kindOf('str');
+//=> 'string'
+
+kindOf(arguments);
+//=> 'arguments'
+
+kindOf({});
+//=> 'object'
+
+kindOf(Object.create(null));
+//=> 'object'
+
+kindOf(new Test());
+//=> 'object'
+
+kindOf(new Date());
+//=> 'date'
+
+kindOf([1, 2, 3]);
+//=> 'array'
+
+kindOf(/foo/);
+//=> 'regexp'
+
+kindOf(new RegExp('foo'));
+//=> 'regexp'
+
+kindOf(new Error('error'));
+//=> 'error'
+
+kindOf(function () {});
+//=> 'function'
+
+kindOf(function * () {});
+//=> 'generatorfunction'
+
+kindOf(Symbol('str'));
+//=> 'symbol'
+
+kindOf(new Map());
+//=> 'map'
+
+kindOf(new WeakMap());
+//=> 'weakmap'
+
+kindOf(new Set());
+//=> 'set'
+
+kindOf(new WeakSet());
+//=> 'weakset'
+
+kindOf(new Int8Array());
+//=> 'int8array'
+
+kindOf(new Uint8Array());
+//=> 'uint8array'
+
+kindOf(new Uint8ClampedArray());
+//=> 'uint8clampedarray'
+
+kindOf(new Int16Array());
+//=> 'int16array'
+
+kindOf(new Uint16Array());
+//=> 'uint16array'
+
+kindOf(new Int32Array());
+//=> 'int32array'
+
+kindOf(new Uint32Array());
+//=> 'uint32array'
+
+kindOf(new Float32Array());
+//=> 'float32array'
+
+kindOf(new Float64Array());
+//=> 'float64array'
+```
+
+## Benchmarks
+
+Benchmarked against [typeof](http://github.com/CodingFu/typeof) and [type-of](https://github.com/ForbesLindesay/type-of).
+
+```bash
+# arguments (32 bytes)
+  kind-of x 17,024,098 ops/sec ±1.90% (86 runs sampled)
+  lib-type-of x 11,926,235 ops/sec ±1.34% (83 runs sampled)
+  lib-typeof x 9,245,257 ops/sec ±1.22% (87 runs sampled)
+
+  fastest is kind-of (by 161% avg)
+
+# array (22 bytes)
+  kind-of x 17,196,492 ops/sec ±1.07% (88 runs sampled)
+  lib-type-of x 8,838,283 ops/sec ±1.02% (87 runs sampled)
+  lib-typeof x 8,677,848 ops/sec ±0.87% (87 runs sampled)
+
+  fastest is kind-of (by 196% avg)
+
+# boolean (24 bytes)
+  kind-of x 16,841,600 ops/sec ±1.10% (86 runs sampled)
+  lib-type-of x 8,096,787 ops/sec ±0.95% (87 runs sampled)
+  lib-typeof x 8,423,345 ops/sec ±1.15% (86 runs sampled)
+
+  fastest is kind-of (by 204% avg)
+
+# buffer (38 bytes)
+  kind-of x 14,848,060 ops/sec ±1.05% (86 runs sampled)
+  lib-type-of x 3,671,577 ops/sec ±1.49% (87 runs sampled)
+  lib-typeof x 8,360,236 ops/sec ±1.24% (86 runs sampled)
+
+  fastest is kind-of (by 247% avg)
+
+# date (30 bytes)
+  kind-of x 16,067,761 ops/sec ±1.58% (86 runs sampled)
+  lib-type-of x 8,954,436 ops/sec ±1.40% (87 runs sampled)
+  lib-typeof x 8,488,307 ops/sec ±1.51% (84 runs sampled)
+
+  fastest is kind-of (by 184% avg)
+
+# error (36 bytes)
+  kind-of x 9,634,090 ops/sec ±1.12% (89 runs sampled)
+  lib-type-of x 7,735,624 ops/sec ±1.32% (86 runs sampled)
+  lib-typeof x 7,442,160 ops/sec ±1.11% (90 runs sampled)
+
+  fastest is kind-of (by 127% avg)
+
+# function (34 bytes)
+  kind-of x 10,031,494 ops/sec ±1.27% (86 runs sampled)
+  lib-type-of x 9,502,757 ops/sec ±1.17% (89 runs sampled)
+  lib-typeof x 8,278,985 ops/sec ±1.08% (88 runs sampled)
+
+  fastest is kind-of (by 113% avg)
+
+# null (24 bytes)
+  kind-of x 18,159,808 ops/sec ±1.92% (86 runs sampled)
+  lib-type-of x 12,927,635 ops/sec ±1.01% (88 runs sampled)
+  lib-typeof x 7,958,234 ops/sec ±1.21% (89 runs sampled)
+
+  fastest is kind-of (by 174% avg)
+
+# number (22 bytes)
+  kind-of x 17,846,779 ops/sec ±0.91% (85 runs sampled)
+  lib-type-of x 3,316,636 ops/sec ±1.19% (86 runs sampled)
+  lib-typeof x 2,329,477 ops/sec ±2.21% (85 runs sampled)
+
+  fastest is kind-of (by 632% avg)
+
+# object-plain (47 bytes)
+  kind-of x 7,085,155 ops/sec ±1.05% (88 runs sampled)
+  lib-type-of x 8,870,930 ops/sec ±1.06% (83 runs sampled)
+  lib-typeof x 8,716,024 ops/sec ±1.05% (87 runs sampled)
+
+  fastest is lib-type-of (by 112% avg)
+
+# regex (25 bytes)
+  kind-of x 14,196,052 ops/sec ±1.65% (84 runs sampled)
+  lib-type-of x 9,554,164 ops/sec ±1.25% (88 runs sampled)
+  lib-typeof x 8,359,691 ops/sec ±1.07% (87 runs sampled)
+
+  fastest is kind-of (by 158% avg)
+
+# string (33 bytes)
+  kind-of x 16,131,428 ops/sec ±1.41% (85 runs sampled)
+  lib-type-of x 7,273,172 ops/sec ±1.05% (87 runs sampled)
+  lib-typeof x 7,382,635 ops/sec ±1.17% (85 runs sampled)
+
+  fastest is kind-of (by 220% avg)
+
+# symbol (34 bytes)
+  kind-of x 17,011,537 ops/sec ±1.24% (86 runs sampled)
+  lib-type-of x 3,492,454 ops/sec ±1.23% (89 runs sampled)
+  lib-typeof x 7,471,235 ops/sec ±2.48% (87 runs sampled)
+
+  fastest is kind-of (by 310% avg)
+
+# template-strings (36 bytes)
+  kind-of x 15,434,250 ops/sec ±1.46% (83 runs sampled)
+  lib-type-of x 7,157,907 ops/sec ±0.97% (87 runs sampled)
+  lib-typeof x 7,517,986 ops/sec ±0.92% (86 runs sampled)
+
+  fastest is kind-of (by 210% avg)
+
+# undefined (29 bytes)
+  kind-of x 19,167,115 ops/sec ±1.71% (87 runs sampled)
+  lib-type-of x 15,477,740 ops/sec ±1.63% (85 runs sampled)
+  lib-typeof x 19,075,495 ops/sec ±1.17% (83 runs sampled)
+
+  fastest is lib-typeof,kind-of
+
+```
+
+## Optimizations
+
+In 7 out of 8 cases, this library is 2x-10x faster than other top libraries included in the benchmarks. There are a few things that lead to this performance advantage, none of them hard and fast rules, but all of them simple and repeatable in almost any code library:
+
+1. Optimize around the fastest and most common use cases first. Of course, this will change from project-to-project, but I took some time to understand how and why `typeof` checks were being used in my own libraries and other libraries I use a lot.
+2. Optimize around bottlenecks - In other words, the order in which conditionals are implemented is significant, because each check is only as fast as the failing checks that came before it. Here, the biggest bottleneck by far is checking for plain objects (an object that was created by the `Object` constructor). I opted to make this check happen by process of elimination rather than brute force up front (e.g. by using something like `val.constructor.name`), so that every other type check would not be penalized it.
+3. Don't do uneccessary processing - why do `.slice(8, -1).toLowerCase();` just to get the word `regex`? It's much faster to do `if (type === '[object RegExp]') return 'regex'`
+4. There is no reason to make the code in a microlib as terse as possible, just to win points for making it shorter. It's always better to favor performant code over terse code. You will always only be using a single `require()` statement to use the library anyway, regardless of how the code is written.
+
+## Better type checking
+
+kind-of seems to be more consistently "correct" than other type checking libs I've looked at. For example, here are some differing results from other popular libs:
+
+### [typeof](https://github.com/CodingFu/typeof) lib
+
+Incorrectly identifies instances of custom constructors (pretty common):
+
+```js
+var typeOf = require('typeof');
+function Test() {}
+console.log(typeOf(new Test()));
+//=> 'test'
+```
+
+Returns `object` instead of `arguments`:
+
+```js
+function foo() {
+  console.log(typeOf(arguments)) //=> 'object'
+}
+foo();
+```
+
+### [type-of](https://github.com/ForbesLindesay/type-of) lib
+
+Incorrectly returns `object` for generator functions, buffers, `Map`, `Set`, `WeakMap` and `WeakSet`:
+
+```js
+function * foo() {}
+console.log(typeOf(foo));
+//=> 'object'
+console.log(typeOf(new Buffer('')));
+//=> 'object'
+console.log(typeOf(new Map()));
+//=> 'object'
+console.log(typeOf(new Set()));
+//=> 'object'
+console.log(typeOf(new WeakMap()));
+//=> 'object'
+console.log(typeOf(new WeakSet()));
+//=> 'object'
+```
+
+## About
+
+<details>
+<summary><strong>Contributing</strong></summary>
+
+Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
+
+</details>
+
+<details>
+<summary><strong>Running Tests</strong></summary>
+
+Running and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command:
+
+```sh
+$ npm install && npm test
+```
+
+</details>
+
+<details>
+<summary><strong>Building docs</strong></summary>
+
+_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_
+
+To generate the readme, run the following command:
+
+```sh
+$ npm install -g verbose/verb#dev verb-generate-readme && verb
+```
+
+</details>
+
+### Related projects
+
+You might also be interested in these projects:
+
+* [is-glob](https://www.npmjs.com/package/is-glob): Returns `true` if the given string looks like a glob pattern or an extglob pattern… [more](https://github.com/micromatch/is-glob) | [homepage](https://github.com/micromatch/is-glob "Returns `true` if the given string looks like a glob pattern or an extglob pattern. This makes it easy to create code that only uses external modules like node-glob when necessary, resulting in much faster code execution and initialization time, and a bet")
+* [is-number](https://www.npmjs.com/package/is-number): Returns true if a number or string value is a finite number. Useful for regex… [more](https://github.com/jonschlinkert/is-number) | [homepage](https://github.com/jonschlinkert/is-number "Returns true if a number or string value is a finite number. Useful for regex matches, parsing, user input, etc.")
+* [is-primitive](https://www.npmjs.com/package/is-primitive): Returns `true` if the value is a primitive.  | [homepage](https://github.com/jonschlinkert/is-primitive "Returns `true` if the value is a primitive. ")
+
+### Contributors
+
+| **Commits** | **Contributor** |  
+| --- | --- |  
+| 102 | [jonschlinkert](https://github.com/jonschlinkert) |  
+| 3   | [aretecode](https://github.com/aretecode) |  
+| 2   | [miguelmota](https://github.com/miguelmota) |  
+| 1   | [doowb](https://github.com/doowb) |  
+| 1   | [dtothefp](https://github.com/dtothefp) |  
+| 1   | [ianstormtaylor](https://github.com/ianstormtaylor) |  
+| 1   | [ksheedlo](https://github.com/ksheedlo) |  
+| 1   | [pdehaan](https://github.com/pdehaan) |  
+| 1   | [laggingreflex](https://github.com/laggingreflex) |  
+| 1   | [tunnckoCore](https://github.com/tunnckoCore) |  
+| 1   | [xiaofen9](https://github.com/xiaofen9) |  
+
+### Author
+
+**Jon Schlinkert**
+
+* [GitHub Profile](https://github.com/jonschlinkert)
+* [Twitter Profile](https://twitter.com/jonschlinkert)
+* [LinkedIn Profile](https://linkedin.com/in/jonschlinkert)
+
+### License
+
+Copyright © 2020, [Jon Schlinkert](https://github.com/jonschlinkert).
+Released under the [MIT License](LICENSE).
+
+***
+
+_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.8.0, on January 16, 2020._
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/kind-of/index.js b/node_modules/mathjs/examples/node_modules/kind-of/index.js
new file mode 100644
index 0000000..dfa799b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/kind-of/index.js
@@ -0,0 +1,129 @@
+var toString = Object.prototype.toString;
+
+module.exports = function kindOf(val) {
+  if (val === void 0) return 'undefined';
+  if (val === null) return 'null';
+
+  var type = typeof val;
+  if (type === 'boolean') return 'boolean';
+  if (type === 'string') return 'string';
+  if (type === 'number') return 'number';
+  if (type === 'symbol') return 'symbol';
+  if (type === 'function') {
+    return isGeneratorFn(val) ? 'generatorfunction' : 'function';
+  }
+
+  if (isArray(val)) return 'array';
+  if (isBuffer(val)) return 'buffer';
+  if (isArguments(val)) return 'arguments';
+  if (isDate(val)) return 'date';
+  if (isError(val)) return 'error';
+  if (isRegexp(val)) return 'regexp';
+
+  switch (ctorName(val)) {
+    case 'Symbol': return 'symbol';
+    case 'Promise': return 'promise';
+
+    // Set, Map, WeakSet, WeakMap
+    case 'WeakMap': return 'weakmap';
+    case 'WeakSet': return 'weakset';
+    case 'Map': return 'map';
+    case 'Set': return 'set';
+
+    // 8-bit typed arrays
+    case 'Int8Array': return 'int8array';
+    case 'Uint8Array': return 'uint8array';
+    case 'Uint8ClampedArray': return 'uint8clampedarray';
+
+    // 16-bit typed arrays
+    case 'Int16Array': return 'int16array';
+    case 'Uint16Array': return 'uint16array';
+
+    // 32-bit typed arrays
+    case 'Int32Array': return 'int32array';
+    case 'Uint32Array': return 'uint32array';
+    case 'Float32Array': return 'float32array';
+    case 'Float64Array': return 'float64array';
+  }
+
+  if (isGeneratorObj(val)) {
+    return 'generator';
+  }
+
+  // Non-plain objects
+  type = toString.call(val);
+  switch (type) {
+    case '[object Object]': return 'object';
+    // iterators
+    case '[object Map Iterator]': return 'mapiterator';
+    case '[object Set Iterator]': return 'setiterator';
+    case '[object String Iterator]': return 'stringiterator';
+    case '[object Array Iterator]': return 'arrayiterator';
+  }
+
+  // other
+  return type.slice(8, -1).toLowerCase().replace(/\s/g, '');
+};
+
+function ctorName(val) {
+  return typeof val.constructor === 'function' ? val.constructor.name : null;
+}
+
+function isArray(val) {
+  if (Array.isArray) return Array.isArray(val);
+  return val instanceof Array;
+}
+
+function isError(val) {
+  return val instanceof Error || (typeof val.message === 'string' && val.constructor && typeof val.constructor.stackTraceLimit === 'number');
+}
+
+function isDate(val) {
+  if (val instanceof Date) return true;
+  return typeof val.toDateString === 'function'
+    && typeof val.getDate === 'function'
+    && typeof val.setDate === 'function';
+}
+
+function isRegexp(val) {
+  if (val instanceof RegExp) return true;
+  return typeof val.flags === 'string'
+    && typeof val.ignoreCase === 'boolean'
+    && typeof val.multiline === 'boolean'
+    && typeof val.global === 'boolean';
+}
+
+function isGeneratorFn(name, val) {
+  return ctorName(name) === 'GeneratorFunction';
+}
+
+function isGeneratorObj(val) {
+  return typeof val.throw === 'function'
+    && typeof val.return === 'function'
+    && typeof val.next === 'function';
+}
+
+function isArguments(val) {
+  try {
+    if (typeof val.length === 'number' && typeof val.callee === 'function') {
+      return true;
+    }
+  } catch (err) {
+    if (err.message.indexOf('callee') !== -1) {
+      return true;
+    }
+  }
+  return false;
+}
+
+/**
+ * If you need to support Safari 5-7 (8-10 yr-old browser),
+ * take a look at https://github.com/feross/is-buffer
+ */
+
+function isBuffer(val) {
+  if (val.constructor && typeof val.constructor.isBuffer === 'function') {
+    return val.constructor.isBuffer(val);
+  }
+  return false;
+}
diff --git a/node_modules/mathjs/examples/node_modules/kind-of/package.json b/node_modules/mathjs/examples/node_modules/kind-of/package.json
new file mode 100644
index 0000000..5820cad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/kind-of/package.json
@@ -0,0 +1,88 @@
+{
+  "name": "kind-of",
+  "description": "Get the native type of a value.",
+  "version": "6.0.3",
+  "homepage": "https://github.com/jonschlinkert/kind-of",
+  "author": "Jon Schlinkert (https://github.com/jonschlinkert)",
+  "contributors": [
+    "David Fox-Powell (https://dtothefp.github.io/me)",
+    "James (https://twitter.com/aretecode)",
+    "Jon Schlinkert (http://twitter.com/jonschlinkert)",
+    "Ken Sheedlo (kensheedlo.com)",
+    "laggingreflex (https://github.com/laggingreflex)",
+    "Miguel Mota (https://miguelmota.com)",
+    "Peter deHaan (http://about.me/peterdehaan)",
+    "tunnckoCore (https://i.am.charlike.online)"
+  ],
+  "repository": "jonschlinkert/kind-of",
+  "bugs": {
+    "url": "https://github.com/jonschlinkert/kind-of/issues"
+  },
+  "license": "MIT",
+  "files": [
+    "index.js"
+  ],
+  "main": "index.js",
+  "engines": {
+    "node": ">=0.10.0"
+  },
+  "scripts": {
+    "test": "mocha",
+    "prepublish": "browserify -o browser.js -e index.js -s index --bare"
+  },
+  "devDependencies": {
+    "benchmarked": "^2.0.0",
+    "browserify": "^14.4.0",
+    "gulp-format-md": "^1.0.0",
+    "mocha": "^4.0.1",
+    "write": "^1.0.3"
+  },
+  "keywords": [
+    "arguments",
+    "array",
+    "boolean",
+    "check",
+    "date",
+    "function",
+    "is",
+    "is-type",
+    "is-type-of",
+    "kind",
+    "kind-of",
+    "number",
+    "object",
+    "of",
+    "regexp",
+    "string",
+    "test",
+    "type",
+    "type-of",
+    "typeof",
+    "types"
+  ],
+  "verb": {
+    "toc": false,
+    "layout": "default",
+    "tasks": [
+      "readme"
+    ],
+    "plugins": [
+      "gulp-format-md"
+    ],
+    "lint": {
+      "reflinks": true
+    },
+    "related": {
+      "list": [
+        "is-glob",
+        "is-number",
+        "is-primitive"
+      ]
+    },
+    "reflinks": [
+      "type-of",
+      "typeof",
+      "verb"
+    ]
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/loader-runner/LICENSE b/node_modules/mathjs/examples/node_modules/loader-runner/LICENSE
new file mode 100644
index 0000000..084338a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/loader-runner/LICENSE
@@ -0,0 +1,21 @@
+The MIT License
+
+Copyright (c) Tobias Koppers @sokra
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/loader-runner/README.md b/node_modules/mathjs/examples/node_modules/loader-runner/README.md
new file mode 100644
index 0000000..f052dd3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/loader-runner/README.md
@@ -0,0 +1,53 @@
+# loader-runner
+
+``` js
+import { runLoaders } from "loader-runner";
+
+runLoaders({
+	resource: "/abs/path/to/file.txt?query",
+	// String: Absolute path to the resource (optionally including query string)
+
+	loaders: ["/abs/path/to/loader.js?query"],
+	// String[]: Absolute paths to the loaders (optionally including query string)
+	// {loader, options}[]: Absolute paths to the loaders with options object
+
+	context: { minimize: true },
+	// Additional loader context which is used as base context
+
+	processResource: (loaderContext, resourcePath, callback) => { ... },
+	// Optional: A function to process the resource
+	// Must have signature function(context, path, function(err, buffer))
+	// By default readResource is used and the resource is added a fileDependency
+
+	readResource: fs.readFile.bind(fs)
+	// Optional: A function to read the resource
+	// Only used when 'processResource' is not provided
+	// Must have signature function(path, function(err, buffer))
+	// By default fs.readFile is used
+}, function(err, result) {
+	// err: Error?
+
+	// result.result: Buffer | String
+	// The result
+	// only available when no error occured
+
+	// result.resourceBuffer: Buffer
+	// The raw resource as Buffer (useful for SourceMaps)
+	// only available when no error occured
+
+	// result.cacheable: Bool
+	// Is the result cacheable or do it require reexecution?
+
+	// result.fileDependencies: String[]
+	// An array of paths (existing files) on which the result depends on
+
+	// result.missingDependencies: String[]
+	// An array of paths (not existing files) on which the result depends on
+
+	// result.contextDependencies: String[]
+	// An array of paths (directories) on which the result depends on
+})
+```
+
+More documentation following...
+
diff --git a/node_modules/mathjs/examples/node_modules/loader-runner/lib/LoaderLoadingError.js b/node_modules/mathjs/examples/node_modules/loader-runner/lib/LoaderLoadingError.js
new file mode 100644
index 0000000..fa1e54d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/loader-runner/lib/LoaderLoadingError.js
@@ -0,0 +1,11 @@
+"use strict";
+
+class LoadingLoaderError extends Error {
+	constructor(message) {
+		super(message);
+		this.name = "LoaderRunnerError";
+		Error.captureStackTrace(this, this.constructor);
+	}
+}
+
+module.exports = LoadingLoaderError;
diff --git a/node_modules/mathjs/examples/node_modules/loader-runner/lib/LoaderRunner.js b/node_modules/mathjs/examples/node_modules/loader-runner/lib/LoaderRunner.js
new file mode 100644
index 0000000..0afa9d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/loader-runner/lib/LoaderRunner.js
@@ -0,0 +1,415 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+var fs = require("fs");
+var readFile = fs.readFile.bind(fs);
+var loadLoader = require("./loadLoader");
+
+function utf8BufferToString(buf) {
+	var str = buf.toString("utf-8");
+	if(str.charCodeAt(0) === 0xFEFF) {
+		return str.substr(1);
+	} else {
+		return str;
+	}
+}
+
+const PATH_QUERY_FRAGMENT_REGEXP = /^((?:\0.|[^?#\0])*)(\?(?:\0.|[^#\0])*)?(#.*)?$/;
+
+/**
+ * @param {string} str the path with query and fragment
+ * @returns {{ path: string, query: string, fragment: string }} parsed parts
+ */
+function parsePathQueryFragment(str) {
+	var match = PATH_QUERY_FRAGMENT_REGEXP.exec(str);
+	return {
+		path: match[1].replace(/\0(.)/g, "$1"),
+		query: match[2] ? match[2].replace(/\0(.)/g, "$1") : "",
+		fragment: match[3] || ""
+	};
+}
+
+function dirname(path) {
+	if(path === "/") return "/";
+	var i = path.lastIndexOf("/");
+	var j = path.lastIndexOf("\\");
+	var i2 = path.indexOf("/");
+	var j2 = path.indexOf("\\");
+	var idx = i > j ? i : j;
+	var idx2 = i > j ? i2 : j2;
+	if(idx < 0) return path;
+	if(idx === idx2) return path.substr(0, idx + 1);
+	return path.substr(0, idx);
+}
+
+function createLoaderObject(loader) {
+	var obj = {
+		path: null,
+		query: null,
+		fragment: null,
+		options: null,
+		ident: null,
+		normal: null,
+		pitch: null,
+		raw: null,
+		data: null,
+		pitchExecuted: false,
+		normalExecuted: false
+	};
+	Object.defineProperty(obj, "request", {
+		enumerable: true,
+		get: function() {
+			return obj.path.replace(/#/g, "\0#") + obj.query.replace(/#/g, "\0#") + obj.fragment;
+		},
+		set: function(value) {
+			if(typeof value === "string") {
+				var splittedRequest = parsePathQueryFragment(value);
+				obj.path = splittedRequest.path;
+				obj.query = splittedRequest.query;
+				obj.fragment = splittedRequest.fragment;
+				obj.options = undefined;
+				obj.ident = undefined;
+			} else {
+				if(!value.loader)
+					throw new Error("request should be a string or object with loader and options (" + JSON.stringify(value) + ")");
+				obj.path = value.loader;
+				obj.fragment = value.fragment || "";
+				obj.type = value.type;
+				obj.options = value.options;
+				obj.ident = value.ident;
+				if(obj.options === null)
+					obj.query = "";
+				else if(obj.options === undefined)
+					obj.query = "";
+				else if(typeof obj.options === "string")
+					obj.query = "?" + obj.options;
+				else if(obj.ident)
+					obj.query = "??" + obj.ident;
+				else if(typeof obj.options === "object" && obj.options.ident)
+					obj.query = "??" + obj.options.ident;
+				else
+					obj.query = "?" + JSON.stringify(obj.options);
+			}
+		}
+	});
+	obj.request = loader;
+	if(Object.preventExtensions) {
+		Object.preventExtensions(obj);
+	}
+	return obj;
+}
+
+function runSyncOrAsync(fn, context, args, callback) {
+	var isSync = true;
+	var isDone = false;
+	var isError = false; // internal error
+	var reportedError = false;
+	context.async = function async() {
+		if(isDone) {
+			if(reportedError) return; // ignore
+			throw new Error("async(): The callback was already called.");
+		}
+		isSync = false;
+		return innerCallback;
+	};
+	var innerCallback = context.callback = function() {
+		if(isDone) {
+			if(reportedError) return; // ignore
+			throw new Error("callback(): The callback was already called.");
+		}
+		isDone = true;
+		isSync = false;
+		try {
+			callback.apply(null, arguments);
+		} catch(e) {
+			isError = true;
+			throw e;
+		}
+	};
+	try {
+		var result = (function LOADER_EXECUTION() {
+			return fn.apply(context, args);
+		}());
+		if(isSync) {
+			isDone = true;
+			if(result === undefined)
+				return callback();
+			if(result && typeof result === "object" && typeof result.then === "function") {
+				return result.then(function(r) {
+					callback(null, r);
+				}, callback);
+			}
+			return callback(null, result);
+		}
+	} catch(e) {
+		if(isError) throw e;
+		if(isDone) {
+			// loader is already "done", so we cannot use the callback function
+			// for better debugging we print the error on the console
+			if(typeof e === "object" && e.stack) console.error(e.stack);
+			else console.error(e);
+			return;
+		}
+		isDone = true;
+		reportedError = true;
+		callback(e);
+	}
+
+}
+
+function convertArgs(args, raw) {
+	if(!raw && Buffer.isBuffer(args[0]))
+		args[0] = utf8BufferToString(args[0]);
+	else if(raw && typeof args[0] === "string")
+		args[0] = Buffer.from(args[0], "utf-8");
+}
+
+function iteratePitchingLoaders(options, loaderContext, callback) {
+	// abort after last loader
+	if(loaderContext.loaderIndex >= loaderContext.loaders.length)
+		return processResource(options, loaderContext, callback);
+
+	var currentLoaderObject = loaderContext.loaders[loaderContext.loaderIndex];
+
+	// iterate
+	if(currentLoaderObject.pitchExecuted) {
+		loaderContext.loaderIndex++;
+		return iteratePitchingLoaders(options, loaderContext, callback);
+	}
+
+	// load loader module
+	loadLoader(currentLoaderObject, function(err) {
+		if(err) {
+			loaderContext.cacheable(false);
+			return callback(err);
+		}
+		var fn = currentLoaderObject.pitch;
+		currentLoaderObject.pitchExecuted = true;
+		if(!fn) return iteratePitchingLoaders(options, loaderContext, callback);
+
+		runSyncOrAsync(
+			fn,
+			loaderContext, [loaderContext.remainingRequest, loaderContext.previousRequest, currentLoaderObject.data = {}],
+			function(err) {
+				if(err) return callback(err);
+				var args = Array.prototype.slice.call(arguments, 1);
+				// Determine whether to continue the pitching process based on
+				// argument values (as opposed to argument presence) in order
+				// to support synchronous and asynchronous usages.
+				var hasArg = args.some(function(value) {
+					return value !== undefined;
+				});
+				if(hasArg) {
+					loaderContext.loaderIndex--;
+					iterateNormalLoaders(options, loaderContext, args, callback);
+				} else {
+					iteratePitchingLoaders(options, loaderContext, callback);
+				}
+			}
+		);
+	});
+}
+
+function processResource(options, loaderContext, callback) {
+	// set loader index to last loader
+	loaderContext.loaderIndex = loaderContext.loaders.length - 1;
+
+	var resourcePath = loaderContext.resourcePath;
+	if(resourcePath) {
+		options.processResource(loaderContext, resourcePath, function(err, buffer) {
+			if(err) return callback(err);
+			options.resourceBuffer = buffer;
+			iterateNormalLoaders(options, loaderContext, [buffer], callback);
+		});
+	} else {
+		iterateNormalLoaders(options, loaderContext, [null], callback);
+	}
+}
+
+function iterateNormalLoaders(options, loaderContext, args, callback) {
+	if(loaderContext.loaderIndex < 0)
+		return callback(null, args);
+
+	var currentLoaderObject = loaderContext.loaders[loaderContext.loaderIndex];
+
+	// iterate
+	if(currentLoaderObject.normalExecuted) {
+		loaderContext.loaderIndex--;
+		return iterateNormalLoaders(options, loaderContext, args, callback);
+	}
+
+	var fn = currentLoaderObject.normal;
+	currentLoaderObject.normalExecuted = true;
+	if(!fn) {
+		return iterateNormalLoaders(options, loaderContext, args, callback);
+	}
+
+	convertArgs(args, currentLoaderObject.raw);
+
+	runSyncOrAsync(fn, loaderContext, args, function(err) {
+		if(err) return callback(err);
+
+		var args = Array.prototype.slice.call(arguments, 1);
+		iterateNormalLoaders(options, loaderContext, args, callback);
+	});
+}
+
+exports.getContext = function getContext(resource) {
+	var path = parsePathQueryFragment(resource).path;
+	return dirname(path);
+};
+
+exports.runLoaders = function runLoaders(options, callback) {
+	// read options
+	var resource = options.resource || "";
+	var loaders = options.loaders || [];
+	var loaderContext = options.context || {};
+	var processResource = options.processResource || ((readResource, context, resource, callback) => {
+		context.addDependency(resource);
+		readResource(resource, callback);
+	}).bind(null, options.readResource || readFile);
+
+	//
+	var splittedResource = resource && parsePathQueryFragment(resource);
+	var resourcePath = splittedResource ? splittedResource.path : undefined;
+	var resourceQuery = splittedResource ? splittedResource.query : undefined;
+	var resourceFragment = splittedResource ? splittedResource.fragment : undefined;
+	var contextDirectory = resourcePath ? dirname(resourcePath) : null;
+
+	// execution state
+	var requestCacheable = true;
+	var fileDependencies = [];
+	var contextDependencies = [];
+	var missingDependencies = [];
+
+	// prepare loader objects
+	loaders = loaders.map(createLoaderObject);
+
+	loaderContext.context = contextDirectory;
+	loaderContext.loaderIndex = 0;
+	loaderContext.loaders = loaders;
+	loaderContext.resourcePath = resourcePath;
+	loaderContext.resourceQuery = resourceQuery;
+	loaderContext.resourceFragment = resourceFragment;
+	loaderContext.async = null;
+	loaderContext.callback = null;
+	loaderContext.cacheable = function cacheable(flag) {
+		if(flag === false) {
+			requestCacheable = false;
+		}
+	};
+	loaderContext.dependency = loaderContext.addDependency = function addDependency(file) {
+		fileDependencies.push(file);
+	};
+	loaderContext.addContextDependency = function addContextDependency(context) {
+		contextDependencies.push(context);
+	};
+	loaderContext.addMissingDependency = function addMissingDependency(context) {
+		missingDependencies.push(context);
+	};
+	loaderContext.getDependencies = function getDependencies() {
+		return fileDependencies.slice();
+	};
+	loaderContext.getContextDependencies = function getContextDependencies() {
+		return contextDependencies.slice();
+	};
+	loaderContext.getMissingDependencies = function getMissingDependencies() {
+		return missingDependencies.slice();
+	};
+	loaderContext.clearDependencies = function clearDependencies() {
+		fileDependencies.length = 0;
+		contextDependencies.length = 0;
+		missingDependencies.length = 0;
+		requestCacheable = true;
+	};
+	Object.defineProperty(loaderContext, "resource", {
+		enumerable: true,
+		get: function() {
+			if(loaderContext.resourcePath === undefined)
+				return undefined;
+			return loaderContext.resourcePath.replace(/#/g, "\0#") + loaderContext.resourceQuery.replace(/#/g, "\0#") + loaderContext.resourceFragment;
+		},
+		set: function(value) {
+			var splittedResource = value && parsePathQueryFragment(value);
+			loaderContext.resourcePath = splittedResource ? splittedResource.path : undefined;
+			loaderContext.resourceQuery = splittedResource ? splittedResource.query : undefined;
+			loaderContext.resourceFragment = splittedResource ? splittedResource.fragment : undefined;
+		}
+	});
+	Object.defineProperty(loaderContext, "request", {
+		enumerable: true,
+		get: function() {
+			return loaderContext.loaders.map(function(o) {
+				return o.request;
+			}).concat(loaderContext.resource || "").join("!");
+		}
+	});
+	Object.defineProperty(loaderContext, "remainingRequest", {
+		enumerable: true,
+		get: function() {
+			if(loaderContext.loaderIndex >= loaderContext.loaders.length - 1 && !loaderContext.resource)
+				return "";
+			return loaderContext.loaders.slice(loaderContext.loaderIndex + 1).map(function(o) {
+				return o.request;
+			}).concat(loaderContext.resource || "").join("!");
+		}
+	});
+	Object.defineProperty(loaderContext, "currentRequest", {
+		enumerable: true,
+		get: function() {
+			return loaderContext.loaders.slice(loaderContext.loaderIndex).map(function(o) {
+				return o.request;
+			}).concat(loaderContext.resource || "").join("!");
+		}
+	});
+	Object.defineProperty(loaderContext, "previousRequest", {
+		enumerable: true,
+		get: function() {
+			return loaderContext.loaders.slice(0, loaderContext.loaderIndex).map(function(o) {
+				return o.request;
+			}).join("!");
+		}
+	});
+	Object.defineProperty(loaderContext, "query", {
+		enumerable: true,
+		get: function() {
+			var entry = loaderContext.loaders[loaderContext.loaderIndex];
+			return entry.options && typeof entry.options === "object" ? entry.options : entry.query;
+		}
+	});
+	Object.defineProperty(loaderContext, "data", {
+		enumerable: true,
+		get: function() {
+			return loaderContext.loaders[loaderContext.loaderIndex].data;
+		}
+	});
+
+	// finish loader context
+	if(Object.preventExtensions) {
+		Object.preventExtensions(loaderContext);
+	}
+
+	var processOptions = {
+		resourceBuffer: null,
+		processResource: processResource
+	};
+	iteratePitchingLoaders(processOptions, loaderContext, function(err, result) {
+		if(err) {
+			return callback(err, {
+				cacheable: requestCacheable,
+				fileDependencies: fileDependencies,
+				contextDependencies: contextDependencies,
+				missingDependencies: missingDependencies
+			});
+		}
+		callback(null, {
+			result: result,
+			resourceBuffer: processOptions.resourceBuffer,
+			cacheable: requestCacheable,
+			fileDependencies: fileDependencies,
+			contextDependencies: contextDependencies,
+			missingDependencies: missingDependencies
+		});
+	});
+};
diff --git a/node_modules/mathjs/examples/node_modules/loader-runner/lib/loadLoader.js b/node_modules/mathjs/examples/node_modules/loader-runner/lib/loadLoader.js
new file mode 100644
index 0000000..1210353
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/loader-runner/lib/loadLoader.js
@@ -0,0 +1,54 @@
+var LoaderLoadingError = require("./LoaderLoadingError");
+var url;
+
+module.exports = function loadLoader(loader, callback) {
+	if(loader.type === "module") {
+		try {
+			if(url === undefined) url = require("url");
+			var loaderUrl = url.pathToFileURL(loader.path);
+			var modulePromise = eval("import(" + JSON.stringify(loaderUrl.toString()) + ")");
+			modulePromise.then(function(module) {
+				handleResult(loader, module, callback);
+			}, callback);
+			return;
+		} catch(e) {
+			callback(e);
+		}
+	} else {
+		try {
+			var module = require(loader.path);
+		} catch(e) {
+			// it is possible for node to choke on a require if the FD descriptor
+			// limit has been reached. give it a chance to recover.
+			if(e instanceof Error && e.code === "EMFILE") {
+				var retry = loadLoader.bind(null, loader, callback);
+				if(typeof setImmediate === "function") {
+					// node >= 0.9.0
+					return setImmediate(retry);
+				} else {
+					// node < 0.9.0
+					return process.nextTick(retry);
+				}
+			}
+			return callback(e);
+		}
+		return handleResult(loader, module, callback);
+	}
+};
+
+function handleResult(loader, module, callback) {
+	if(typeof module !== "function" && typeof module !== "object") {
+		return callback(new LoaderLoadingError(
+			"Module '" + loader.path + "' is not a loader (export function or es6 module)"
+		));
+	}
+	loader.normal = typeof module === "function" ? module : module.default;
+	loader.pitch = module.pitch;
+	loader.raw = module.raw;
+	if(typeof loader.normal !== "function" && typeof loader.pitch !== "function") {
+		return callback(new LoaderLoadingError(
+			"Module '" + loader.path + "' is not a loader (must have normal or pitch function)"
+		));
+	}
+	callback();
+}
diff --git a/node_modules/mathjs/examples/node_modules/loader-runner/package.json b/node_modules/mathjs/examples/node_modules/loader-runner/package.json
new file mode 100644
index 0000000..06ba8f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/loader-runner/package.json
@@ -0,0 +1,45 @@
+{
+  "name": "loader-runner",
+  "version": "4.2.0",
+  "description": "Runs (webpack) loaders",
+  "main": "lib/LoaderRunner.js",
+  "scripts": {
+    "lint": "eslint lib test",
+    "pretest": "npm run lint",
+    "test": "mocha --reporter spec",
+    "precover": "npm run lint",
+    "cover": "istanbul cover node_modules/mocha/bin/_mocha"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/webpack/loader-runner.git"
+  },
+  "keywords": [
+    "webpack",
+    "loader"
+  ],
+  "author": "Tobias Koppers @sokra",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/webpack/loader-runner/issues"
+  },
+  "homepage": "https://github.com/webpack/loader-runner#readme",
+  "engines": {
+    "node": ">=6.11.5"
+  },
+  "files": [
+    "lib/",
+    "bin/",
+    "hot/",
+    "web_modules/",
+    "schemas/"
+  ],
+  "devDependencies": {
+    "eslint": "^3.12.2",
+    "eslint-plugin-node": "^3.0.5",
+    "eslint-plugin-nodeca": "^1.0.3",
+    "istanbul": "^0.4.1",
+    "mocha": "^3.2.0",
+    "should": "^8.0.2"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/locate-path/index.d.ts b/node_modules/mathjs/examples/node_modules/locate-path/index.d.ts
new file mode 100644
index 0000000..fbde526
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/locate-path/index.d.ts
@@ -0,0 +1,83 @@
+declare namespace locatePath {
+	interface Options {
+		/**
+		Current working directory.
+
+		@default process.cwd()
+		*/
+		readonly cwd?: string;
+
+		/**
+		Type of path to match.
+
+		@default 'file'
+		*/
+		readonly type?: 'file' | 'directory';
+
+		/**
+		Allow symbolic links to match if they point to the requested path type.
+
+		@default true
+		*/
+		readonly allowSymlinks?: boolean;
+	}
+
+	interface AsyncOptions extends Options {
+		/**
+		Number of concurrently pending promises. Minimum: `1`.
+
+		@default Infinity
+		*/
+		readonly concurrency?: number;
+
+		/**
+		Preserve `paths` order when searching.
+
+		Disable this to improve performance if you don't care about the order.
+
+		@default true
+		*/
+		readonly preserveOrder?: boolean;
+	}
+}
+
+declare const locatePath: {
+	/**
+	Get the first path that exists on disk of multiple paths.
+
+	@param paths - Paths to check.
+	@returns The first path that exists or `undefined` if none exists.
+
+	@example
+	```
+	import locatePath = require('locate-path');
+
+	const files = [
+		'unicorn.png',
+		'rainbow.png', // Only this one actually exists on disk
+		'pony.png'
+	];
+
+	(async () => {
+		console(await locatePath(files));
+		//=> 'rainbow'
+	})();
+	```
+	*/
+	(paths: Iterable<string>, options?: locatePath.AsyncOptions): Promise<
+		string | undefined
+	>;
+
+	/**
+	Synchronously get the first path that exists on disk of multiple paths.
+
+	@param paths - Paths to check.
+	@returns The first path that exists or `undefined` if none exists.
+	*/
+	sync(
+		paths: Iterable<string>,
+		options?: locatePath.Options
+	): string | undefined;
+};
+
+export = locatePath;
diff --git a/node_modules/mathjs/examples/node_modules/locate-path/index.js b/node_modules/mathjs/examples/node_modules/locate-path/index.js
new file mode 100644
index 0000000..4604bbf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/locate-path/index.js
@@ -0,0 +1,65 @@
+'use strict';
+const path = require('path');
+const fs = require('fs');
+const {promisify} = require('util');
+const pLocate = require('p-locate');
+
+const fsStat = promisify(fs.stat);
+const fsLStat = promisify(fs.lstat);
+
+const typeMappings = {
+	directory: 'isDirectory',
+	file: 'isFile'
+};
+
+function checkType({type}) {
+	if (type in typeMappings) {
+		return;
+	}
+
+	throw new Error(`Invalid type specified: ${type}`);
+}
+
+const matchType = (type, stat) => type === undefined || stat[typeMappings[type]]();
+
+module.exports = async (paths, options) => {
+	options = {
+		cwd: process.cwd(),
+		type: 'file',
+		allowSymlinks: true,
+		...options
+	};
+	checkType(options);
+	const statFn = options.allowSymlinks ? fsStat : fsLStat;
+
+	return pLocate(paths, async path_ => {
+		try {
+			const stat = await statFn(path.resolve(options.cwd, path_));
+			return matchType(options.type, stat);
+		} catch (_) {
+			return false;
+		}
+	}, options);
+};
+
+module.exports.sync = (paths, options) => {
+	options = {
+		cwd: process.cwd(),
+		allowSymlinks: true,
+		type: 'file',
+		...options
+	};
+	checkType(options);
+	const statFn = options.allowSymlinks ? fs.statSync : fs.lstatSync;
+
+	for (const path_ of paths) {
+		try {
+			const stat = statFn(path.resolve(options.cwd, path_));
+
+			if (matchType(options.type, stat)) {
+				return path_;
+			}
+		} catch (_) {
+		}
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/locate-path/license b/node_modules/mathjs/examples/node_modules/locate-path/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/locate-path/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/locate-path/package.json b/node_modules/mathjs/examples/node_modules/locate-path/package.json
new file mode 100644
index 0000000..063b290
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/locate-path/package.json
@@ -0,0 +1,45 @@
+{
+	"name": "locate-path",
+	"version": "5.0.0",
+	"description": "Get the first path that exists on disk of multiple paths",
+	"license": "MIT",
+	"repository": "sindresorhus/locate-path",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"locate",
+		"path",
+		"paths",
+		"file",
+		"files",
+		"exists",
+		"find",
+		"finder",
+		"search",
+		"searcher",
+		"array",
+		"iterable",
+		"iterator"
+	],
+	"dependencies": {
+		"p-locate": "^4.1.0"
+	},
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/locate-path/readme.md b/node_modules/mathjs/examples/node_modules/locate-path/readme.md
new file mode 100644
index 0000000..2184c6f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/locate-path/readme.md
@@ -0,0 +1,122 @@
+# locate-path [![Build Status](https://travis-ci.org/sindresorhus/locate-path.svg?branch=master)](https://travis-ci.org/sindresorhus/locate-path)
+
+> Get the first path that exists on disk of multiple paths
+
+
+## Install
+
+```
+$ npm install locate-path
+```
+
+
+## Usage
+
+Here we find the first file that exists on disk, in array order.
+
+```js
+const locatePath = require('locate-path');
+
+const files = [
+	'unicorn.png',
+	'rainbow.png', // Only this one actually exists on disk
+	'pony.png'
+];
+
+(async () => {
+	console(await locatePath(files));
+	//=> 'rainbow'
+})();
+```
+
+
+## API
+
+### locatePath(paths, [options])
+
+Returns a `Promise<string>` for the first path that exists or `undefined` if none exists.
+
+#### paths
+
+Type: `Iterable<string>`
+
+Paths to check.
+
+#### options
+
+Type: `Object`
+
+##### concurrency
+
+Type: `number`<br>
+Default: `Infinity`<br>
+Minimum: `1`
+
+Number of concurrently pending promises.
+
+##### preserveOrder
+
+Type: `boolean`<br>
+Default: `true`
+
+Preserve `paths` order when searching.
+
+Disable this to improve performance if you don't care about the order.
+
+##### cwd
+
+Type: `string`<br>
+Default: `process.cwd()`
+
+Current working directory.
+
+##### type
+
+Type: `string`<br>
+Default: `file`<br>
+Values: `file` `directory`
+
+The type of paths that can match.
+
+##### allowSymlinks
+
+Type: `boolean`<br>
+Default: `true`
+
+Allow symbolic links to match if they point to the chosen path type.
+
+### locatePath.sync(paths, [options])
+
+Returns the first path that exists or `undefined` if none exists.
+
+#### paths
+
+Type: `Iterable<string>`
+
+Paths to check.
+
+#### options
+
+Type: `Object`
+
+##### cwd
+
+Same as above.
+
+##### type
+
+Same as above.
+
+##### allowSymlinks
+
+Same as above.
+
+
+## Related
+
+- [path-exists](https://github.com/sindresorhus/path-exists) - Check if a path exists
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/merge-stream/LICENSE b/node_modules/mathjs/examples/node_modules/merge-stream/LICENSE
new file mode 100644
index 0000000..94a4c0a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/merge-stream/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) Stephen Sugden <me@stephensugden.com> (stephensugden.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/merge-stream/README.md b/node_modules/mathjs/examples/node_modules/merge-stream/README.md
new file mode 100644
index 0000000..0d54841
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/merge-stream/README.md
@@ -0,0 +1,78 @@
+# merge-stream
+
+Merge (interleave) a bunch of streams.
+
+[![build status](https://secure.travis-ci.org/grncdr/merge-stream.svg?branch=master)](http://travis-ci.org/grncdr/merge-stream)
+
+## Synopsis
+
+```javascript
+var stream1 = new Stream();
+var stream2 = new Stream();
+
+var merged = mergeStream(stream1, stream2);
+
+var stream3 = new Stream();
+merged.add(stream3);
+merged.isEmpty();
+//=> false
+```
+
+## Description
+
+This is adapted from [event-stream](https://github.com/dominictarr/event-stream) separated into a new module, using Streams3.
+
+## API
+
+### `mergeStream`
+
+Type: `function`
+
+Merges an arbitrary number of streams. Returns a merged stream.
+
+#### `merged.add`
+
+A method to dynamically add more sources to the stream. The argument supplied to `add` can be either a source or an array of sources.
+
+#### `merged.isEmpty`
+
+A method that tells you if the merged stream is empty.
+
+When a stream is "empty" (aka. no sources were added), it could not be returned to a gulp task.
+
+So, we could do something like this:
+
+```js
+stream = require('merge-stream')();
+// Something like a loop to add some streams to the merge stream
+// stream.add(streamA);
+// stream.add(streamB);
+return stream.isEmpty() ? null : stream;
+```
+
+## Gulp example
+
+An example use case for **merge-stream** is to combine parts of a task in a project's **gulpfile.js** like this:
+
+```js
+const gulp =          require('gulp');
+const htmlValidator = require('gulp-w3c-html-validator');
+const jsHint =        require('gulp-jshint');
+const mergeStream =   require('merge-stream');
+
+function lint() {
+  return mergeStream(
+    gulp.src('src/*.html')
+      .pipe(htmlValidator())
+      .pipe(htmlValidator.reporter()),
+    gulp.src('src/*.js')
+      .pipe(jsHint())
+      .pipe(jsHint.reporter())
+  );
+}
+gulp.task('lint', lint);
+```
+
+## License
+
+MIT
diff --git a/node_modules/mathjs/examples/node_modules/merge-stream/index.js b/node_modules/mathjs/examples/node_modules/merge-stream/index.js
new file mode 100644
index 0000000..b1a9e1a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/merge-stream/index.js
@@ -0,0 +1,41 @@
+'use strict';
+
+const { PassThrough } = require('stream');
+
+module.exports = function (/*streams...*/) {
+  var sources = []
+  var output  = new PassThrough({objectMode: true})
+
+  output.setMaxListeners(0)
+
+  output.add = add
+  output.isEmpty = isEmpty
+
+  output.on('unpipe', remove)
+
+  Array.prototype.slice.call(arguments).forEach(add)
+
+  return output
+
+  function add (source) {
+    if (Array.isArray(source)) {
+      source.forEach(add)
+      return this
+    }
+
+    sources.push(source);
+    source.once('end', remove.bind(null, source))
+    source.once('error', output.emit.bind(output, 'error'))
+    source.pipe(output, {end: false})
+    return this
+  }
+
+  function isEmpty () {
+    return sources.length == 0;
+  }
+
+  function remove (source) {
+    sources = sources.filter(function (it) { return it !== source })
+    if (!sources.length && output.readable) { output.end() }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/merge-stream/package.json b/node_modules/mathjs/examples/node_modules/merge-stream/package.json
new file mode 100644
index 0000000..1a4c54c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/merge-stream/package.json
@@ -0,0 +1,19 @@
+{
+  "name": "merge-stream",
+  "version": "2.0.0",
+  "description": "Create a stream that emits events from multiple other streams",
+  "files": [
+    "index.js"
+  ],
+  "scripts": {
+    "test": "istanbul cover test.js && istanbul check-cover --statements 100 --branches 100"
+  },
+  "repository": "grncdr/merge-stream",
+  "author": "Stephen Sugden <me@stephensugden.com>",
+  "license": "MIT",
+  "dependencies": {},
+  "devDependencies": {
+    "from2": "^2.0.3",
+    "istanbul": "^0.4.5"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/mime-db/HISTORY.md b/node_modules/mathjs/examples/node_modules/mime-db/HISTORY.md
new file mode 100644
index 0000000..7436f64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-db/HISTORY.md
@@ -0,0 +1,507 @@
+1.52.0 / 2022-02-21
+===================
+
+  * Add extensions from IANA for more `image/*` types
+  * Add extension `.asc` to `application/pgp-keys`
+  * Add extensions to various XML types
+  * Add new upstream MIME types
+
+1.51.0 / 2021-11-08
+===================
+
+  * Add new upstream MIME types
+  * Mark `image/vnd.microsoft.icon` as compressible
+  * Mark `image/vnd.ms-dds` as compressible
+
+1.50.0 / 2021-09-15
+===================
+
+  * Add deprecated iWorks mime types and extensions
+  * Add new upstream MIME types
+
+1.49.0 / 2021-07-26
+===================
+
+  * Add extension `.trig` to `application/trig`
+  * Add new upstream MIME types
+
+1.48.0 / 2021-05-30
+===================
+
+  * Add extension `.mvt` to `application/vnd.mapbox-vector-tile`
+  * Add new upstream MIME types
+  * Mark `text/yaml` as compressible
+
+1.47.0 / 2021-04-01
+===================
+
+  * Add new upstream MIME types
+  * Remove ambigious extensions from IANA for `application/*+xml` types
+  * Update primary extension to `.es` for `application/ecmascript`
+
+1.46.0 / 2021-02-13
+===================
+
+  * Add extension `.amr` to `audio/amr`
+  * Add extension `.m4s` to `video/iso.segment`
+  * Add extension `.opus` to `audio/ogg`
+  * Add new upstream MIME types
+
+1.45.0 / 2020-09-22
+===================
+
+  * Add `application/ubjson` with extension `.ubj`
+  * Add `image/avif` with extension `.avif`
+  * Add `image/ktx2` with extension `.ktx2`
+  * Add extension `.dbf` to `application/vnd.dbf`
+  * Add extension `.rar` to `application/vnd.rar`
+  * Add extension `.td` to `application/urc-targetdesc+xml`
+  * Add new upstream MIME types
+  * Fix extension of `application/vnd.apple.keynote` to be `.key`
+
+1.44.0 / 2020-04-22
+===================
+
+  * Add charsets from IANA
+  * Add extension `.cjs` to `application/node`
+  * Add new upstream MIME types
+
+1.43.0 / 2020-01-05
+===================
+
+  * Add `application/x-keepass2` with extension `.kdbx`
+  * Add extension `.mxmf` to `audio/mobile-xmf`
+  * Add extensions from IANA for `application/*+xml` types
+  * Add new upstream MIME types
+
+1.42.0 / 2019-09-25
+===================
+
+  * Add `image/vnd.ms-dds` with extension `.dds`
+  * Add new upstream MIME types
+  * Remove compressible from `multipart/mixed`
+
+1.41.0 / 2019-08-30
+===================
+
+  * Add new upstream MIME types
+  * Add `application/toml` with extension `.toml`
+  * Mark `font/ttf` as compressible
+
+1.40.0 / 2019-04-20
+===================
+
+  * Add extensions from IANA for `model/*` types
+  * Add `text/mdx` with extension `.mdx`
+
+1.39.0 / 2019-04-04
+===================
+
+  * Add extensions `.siv` and `.sieve` to `application/sieve`
+  * Add new upstream MIME types
+
+1.38.0 / 2019-02-04
+===================
+
+  * Add extension `.nq` to `application/n-quads`
+  * Add extension `.nt` to `application/n-triples`
+  * Add new upstream MIME types
+  * Mark `text/less` as compressible
+
+1.37.0 / 2018-10-19
+===================
+
+  * Add extensions to HEIC image types
+  * Add new upstream MIME types
+
+1.36.0 / 2018-08-20
+===================
+
+  * Add Apple file extensions from IANA
+  * Add extensions from IANA for `image/*` types
+  * Add new upstream MIME types
+
+1.35.0 / 2018-07-15
+===================
+
+  * Add extension `.owl` to `application/rdf+xml`
+  * Add new upstream MIME types
+    - Removes extension `.woff` from `application/font-woff`
+
+1.34.0 / 2018-06-03
+===================
+
+  * Add extension `.csl` to `application/vnd.citationstyles.style+xml`
+  * Add extension `.es` to `application/ecmascript`
+  * Add new upstream MIME types
+  * Add `UTF-8` as default charset for `text/turtle`
+  * Mark all XML-derived types as compressible
+
+1.33.0 / 2018-02-15
+===================
+
+  * Add extensions from IANA for `message/*` types
+  * Add new upstream MIME types
+  * Fix some incorrect OOXML types
+  * Remove `application/font-woff2`
+
+1.32.0 / 2017-11-29
+===================
+
+  * Add new upstream MIME types
+  * Update `text/hjson` to registered `application/hjson`
+  * Add `text/shex` with extension `.shex`
+
+1.31.0 / 2017-10-25
+===================
+
+  * Add `application/raml+yaml` with extension `.raml`
+  * Add `application/wasm` with extension `.wasm`
+  * Add new `font` type from IANA
+  * Add new upstream font extensions
+  * Add new upstream MIME types
+  * Add extensions for JPEG-2000 images
+
+1.30.0 / 2017-08-27
+===================
+
+  * Add `application/vnd.ms-outlook`
+  * Add `application/x-arj`
+  * Add extension `.mjs` to `application/javascript`
+  * Add glTF types and extensions
+  * Add new upstream MIME types
+  * Add `text/x-org`
+  * Add VirtualBox MIME types
+  * Fix `source` records for `video/*` types that are IANA
+  * Update `font/opentype` to registered `font/otf`
+
+1.29.0 / 2017-07-10
+===================
+
+  * Add `application/fido.trusted-apps+json`
+  * Add extension `.wadl` to `application/vnd.sun.wadl+xml`
+  * Add new upstream MIME types
+  * Add `UTF-8` as default charset for `text/css`
+
+1.28.0 / 2017-05-14
+===================
+
+  * Add new upstream MIME types
+  * Add extension `.gz` to `application/gzip`
+  * Update extensions `.md` and `.markdown` to be `text/markdown`
+
+1.27.0 / 2017-03-16
+===================
+
+  * Add new upstream MIME types
+  * Add `image/apng` with extension `.apng`
+
+1.26.0 / 2017-01-14
+===================
+
+  * Add new upstream MIME types
+  * Add extension `.geojson` to `application/geo+json`
+
+1.25.0 / 2016-11-11
+===================
+
+  * Add new upstream MIME types
+
+1.24.0 / 2016-09-18
+===================
+
+  * Add `audio/mp3`
+  * Add new upstream MIME types
+
+1.23.0 / 2016-05-01
+===================
+
+  * Add new upstream MIME types
+  * Add extension `.3gpp` to `audio/3gpp`
+
+1.22.0 / 2016-02-15
+===================
+
+  * Add `text/slim`
+  * Add extension `.rng` to `application/xml`
+  * Add new upstream MIME types
+  * Fix extension of `application/dash+xml` to be `.mpd`
+  * Update primary extension to `.m4a` for `audio/mp4`
+
+1.21.0 / 2016-01-06
+===================
+
+  * Add Google document types
+  * Add new upstream MIME types
+
+1.20.0 / 2015-11-10
+===================
+
+  * Add `text/x-suse-ymp`
+  * Add new upstream MIME types
+
+1.19.0 / 2015-09-17
+===================
+
+  * Add `application/vnd.apple.pkpass`
+  * Add new upstream MIME types
+
+1.18.0 / 2015-09-03
+===================
+
+  * Add new upstream MIME types
+
+1.17.0 / 2015-08-13
+===================
+
+  * Add `application/x-msdos-program`
+  * Add `audio/g711-0`
+  * Add `image/vnd.mozilla.apng`
+  * Add extension `.exe` to `application/x-msdos-program`
+
+1.16.0 / 2015-07-29
+===================
+
+  * Add `application/vnd.uri-map`
+
+1.15.0 / 2015-07-13
+===================
+
+  * Add `application/x-httpd-php`
+
+1.14.0 / 2015-06-25
+===================
+
+  * Add `application/scim+json`
+  * Add `application/vnd.3gpp.ussd+xml`
+  * Add `application/vnd.biopax.rdf+xml`
+  * Add `text/x-processing`
+
+1.13.0 / 2015-06-07
+===================
+
+  * Add nginx as a source
+  * Add `application/x-cocoa`
+  * Add `application/x-java-archive-diff`
+  * Add `application/x-makeself`
+  * Add `application/x-perl`
+  * Add `application/x-pilot`
+  * Add `application/x-redhat-package-manager`
+  * Add `application/x-sea`
+  * Add `audio/x-m4a`
+  * Add `audio/x-realaudio`
+  * Add `image/x-jng`
+  * Add `text/mathml`
+
+1.12.0 / 2015-06-05
+===================
+
+  * Add `application/bdoc`
+  * Add `application/vnd.hyperdrive+json`
+  * Add `application/x-bdoc`
+  * Add extension `.rtf` to `text/rtf`
+
+1.11.0 / 2015-05-31
+===================
+
+  * Add `audio/wav`
+  * Add `audio/wave`
+  * Add extension `.litcoffee` to `text/coffeescript`
+  * Add extension `.sfd-hdstx` to `application/vnd.hydrostatix.sof-data`
+  * Add extension `.n-gage` to `application/vnd.nokia.n-gage.symbian.install`
+
+1.10.0 / 2015-05-19
+===================
+
+  * Add `application/vnd.balsamiq.bmpr`
+  * Add `application/vnd.microsoft.portable-executable`
+  * Add `application/x-ns-proxy-autoconfig`
+
+1.9.1 / 2015-04-19
+==================
+
+  * Remove `.json` extension from `application/manifest+json`
+    - This is causing bugs downstream
+
+1.9.0 / 2015-04-19
+==================
+
+  * Add `application/manifest+json`
+  * Add `application/vnd.micro+json`
+  * Add `image/vnd.zbrush.pcx`
+  * Add `image/x-ms-bmp`
+
+1.8.0 / 2015-03-13
+==================
+
+  * Add `application/vnd.citationstyles.style+xml`
+  * Add `application/vnd.fastcopy-disk-image`
+  * Add `application/vnd.gov.sk.xmldatacontainer+xml`
+  * Add extension `.jsonld` to `application/ld+json`
+
+1.7.0 / 2015-02-08
+==================
+
+  * Add `application/vnd.gerber`
+  * Add `application/vnd.msa-disk-image`
+
+1.6.1 / 2015-02-05
+==================
+
+  * Community extensions ownership transferred from `node-mime`
+
+1.6.0 / 2015-01-29
+==================
+
+  * Add `application/jose`
+  * Add `application/jose+json`
+  * Add `application/json-seq`
+  * Add `application/jwk+json`
+  * Add `application/jwk-set+json`
+  * Add `application/jwt`
+  * Add `application/rdap+json`
+  * Add `application/vnd.gov.sk.e-form+xml`
+  * Add `application/vnd.ims.imsccv1p3`
+
+1.5.0 / 2014-12-30
+==================
+
+  * Add `application/vnd.oracle.resource+json`
+  * Fix various invalid MIME type entries
+    - `application/mbox+xml`
+    - `application/oscp-response`
+    - `application/vwg-multiplexed`
+    - `audio/g721`
+
+1.4.0 / 2014-12-21
+==================
+
+  * Add `application/vnd.ims.imsccv1p2`
+  * Fix various invalid MIME type entries
+    - `application/vnd-acucobol`
+    - `application/vnd-curl`
+    - `application/vnd-dart`
+    - `application/vnd-dxr`
+    - `application/vnd-fdf`
+    - `application/vnd-mif`
+    - `application/vnd-sema`
+    - `application/vnd-wap-wmlc`
+    - `application/vnd.adobe.flash-movie`
+    - `application/vnd.dece-zip`
+    - `application/vnd.dvb_service`
+    - `application/vnd.micrografx-igx`
+    - `application/vnd.sealed-doc`
+    - `application/vnd.sealed-eml`
+    - `application/vnd.sealed-mht`
+    - `application/vnd.sealed-ppt`
+    - `application/vnd.sealed-tiff`
+    - `application/vnd.sealed-xls`
+    - `application/vnd.sealedmedia.softseal-html`
+    - `application/vnd.sealedmedia.softseal-pdf`
+    - `application/vnd.wap-slc`
+    - `application/vnd.wap-wbxml`
+    - `audio/vnd.sealedmedia.softseal-mpeg`
+    - `image/vnd-djvu`
+    - `image/vnd-svf`
+    - `image/vnd-wap-wbmp`
+    - `image/vnd.sealed-png`
+    - `image/vnd.sealedmedia.softseal-gif`
+    - `image/vnd.sealedmedia.softseal-jpg`
+    - `model/vnd-dwf`
+    - `model/vnd.parasolid.transmit-binary`
+    - `model/vnd.parasolid.transmit-text`
+    - `text/vnd-a`
+    - `text/vnd-curl`
+    - `text/vnd.wap-wml`
+  * Remove example template MIME types
+    - `application/example`
+    - `audio/example`
+    - `image/example`
+    - `message/example`
+    - `model/example`
+    - `multipart/example`
+    - `text/example`
+    - `video/example`
+
+1.3.1 / 2014-12-16
+==================
+
+  * Fix missing extensions
+    - `application/json5`
+    - `text/hjson`
+
+1.3.0 / 2014-12-07
+==================
+
+  * Add `application/a2l`
+  * Add `application/aml`
+  * Add `application/atfx`
+  * Add `application/atxml`
+  * Add `application/cdfx+xml`
+  * Add `application/dii`
+  * Add `application/json5`
+  * Add `application/lxf`
+  * Add `application/mf4`
+  * Add `application/vnd.apache.thrift.compact`
+  * Add `application/vnd.apache.thrift.json`
+  * Add `application/vnd.coffeescript`
+  * Add `application/vnd.enphase.envoy`
+  * Add `application/vnd.ims.imsccv1p1`
+  * Add `text/csv-schema`
+  * Add `text/hjson`
+  * Add `text/markdown`
+  * Add `text/yaml`
+
+1.2.0 / 2014-11-09
+==================
+
+  * Add `application/cea`
+  * Add `application/dit`
+  * Add `application/vnd.gov.sk.e-form+zip`
+  * Add `application/vnd.tmd.mediaflex.api+xml`
+  * Type `application/epub+zip` is now IANA-registered
+
+1.1.2 / 2014-10-23
+==================
+
+  * Rebuild database for `application/x-www-form-urlencoded` change
+
+1.1.1 / 2014-10-20
+==================
+
+  * Mark `application/x-www-form-urlencoded` as compressible.
+
+1.1.0 / 2014-09-28
+==================
+
+  * Add `application/font-woff2`
+
+1.0.3 / 2014-09-25
+==================
+
+  * Fix engine requirement in package
+
+1.0.2 / 2014-09-25
+==================
+
+  * Add `application/coap-group+json`
+  * Add `application/dcd`
+  * Add `application/vnd.apache.thrift.binary`
+  * Add `image/vnd.tencent.tap`
+  * Mark all JSON-derived types as compressible
+  * Update `text/vtt` data
+
+1.0.1 / 2014-08-30
+==================
+
+  * Fix extension ordering
+
+1.0.0 / 2014-08-30
+==================
+
+  * Add `application/atf`
+  * Add `application/merge-patch+json`
+  * Add `multipart/x-mixed-replace`
+  * Add `source: 'apache'` metadata
+  * Add `source: 'iana'` metadata
+  * Remove badly-assumed charset data
diff --git a/node_modules/mathjs/examples/node_modules/mime-db/LICENSE b/node_modules/mathjs/examples/node_modules/mime-db/LICENSE
new file mode 100644
index 0000000..0751cb1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-db/LICENSE
@@ -0,0 +1,23 @@
+(The MIT License)
+
+Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
+Copyright (c) 2015-2022 Douglas Christopher Wilson <doug@somethingdoug.com>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/mime-db/README.md b/node_modules/mathjs/examples/node_modules/mime-db/README.md
new file mode 100644
index 0000000..5a8fcfe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-db/README.md
@@ -0,0 +1,100 @@
+# mime-db
+
+[![NPM Version][npm-version-image]][npm-url]
+[![NPM Downloads][npm-downloads-image]][npm-url]
+[![Node.js Version][node-image]][node-url]
+[![Build Status][ci-image]][ci-url]
+[![Coverage Status][coveralls-image]][coveralls-url]
+
+This is a large database of mime types and information about them.
+It consists of a single, public JSON file and does not include any logic,
+allowing it to remain as un-opinionated as possible with an API.
+It aggregates data from the following sources:
+
+- http://www.iana.org/assignments/media-types/media-types.xhtml
+- http://svn.apache.org/repos/asf/httpd/httpd/trunk/docs/conf/mime.types
+- http://hg.nginx.org/nginx/raw-file/default/conf/mime.types
+
+## Installation
+
+```bash
+npm install mime-db
+```
+
+### Database Download
+
+If you're crazy enough to use this in the browser, you can just grab the
+JSON file using [jsDelivr](https://www.jsdelivr.com/). It is recommended to
+replace `master` with [a release tag](https://github.com/jshttp/mime-db/tags)
+as the JSON format may change in the future.
+
+```
+https://cdn.jsdelivr.net/gh/jshttp/mime-db@master/db.json
+```
+
+## Usage
+
+```js
+var db = require('mime-db')
+
+// grab data on .js files
+var data = db['application/javascript']
+```
+
+## Data Structure
+
+The JSON file is a map lookup for lowercased mime types.
+Each mime type has the following properties:
+
+- `.source` - where the mime type is defined.
+    If not set, it's probably a custom media type.
+    - `apache` - [Apache common media types](http://svn.apache.org/repos/asf/httpd/httpd/trunk/docs/conf/mime.types)
+    - `iana` - [IANA-defined media types](http://www.iana.org/assignments/media-types/media-types.xhtml)
+    - `nginx` - [nginx media types](http://hg.nginx.org/nginx/raw-file/default/conf/mime.types)
+- `.extensions[]` - known extensions associated with this mime type.
+- `.compressible` - whether a file of this type can be gzipped.
+- `.charset` - the default charset associated with this type, if any.
+
+If unknown, every property could be `undefined`.
+
+## Contributing
+
+To edit the database, only make PRs against `src/custom-types.json` or
+`src/custom-suffix.json`.
+
+The `src/custom-types.json` file is a JSON object with the MIME type as the
+keys and the values being an object with the following keys:
+
+- `compressible` - leave out if you don't know, otherwise `true`/`false` to
+  indicate whether the data represented by the type is typically compressible.
+- `extensions` - include an array of file extensions that are associated with
+  the type.
+- `notes` - human-readable notes about the type, typically what the type is.
+- `sources` - include an array of URLs of where the MIME type and the associated
+  extensions are sourced from. This needs to be a [primary source](https://en.wikipedia.org/wiki/Primary_source);
+  links to type aggregating sites and Wikipedia are _not acceptable_.
+
+To update the build, run `npm run build`.
+
+### Adding Custom Media Types
+
+The best way to get new media types included in this library is to register
+them with the IANA. The community registration procedure is outlined in
+[RFC 6838 section 5](http://tools.ietf.org/html/rfc6838#section-5). Types
+registered with the IANA are automatically pulled into this library.
+
+If that is not possible / feasible, they can be added directly here as a
+"custom" type. To do this, it is required to have a primary source that
+definitively lists the media type. If an extension is going to be listed as
+associateed with this media type, the source must definitively link the
+media type and extension as well.
+
+[ci-image]: https://badgen.net/github/checks/jshttp/mime-db/master?label=ci
+[ci-url]: https://github.com/jshttp/mime-db/actions?query=workflow%3Aci
+[coveralls-image]: https://badgen.net/coveralls/c/github/jshttp/mime-db/master
+[coveralls-url]: https://coveralls.io/r/jshttp/mime-db?branch=master
+[node-image]: https://badgen.net/npm/node/mime-db
+[node-url]: https://nodejs.org/en/download
+[npm-downloads-image]: https://badgen.net/npm/dm/mime-db
+[npm-url]: https://npmjs.org/package/mime-db
+[npm-version-image]: https://badgen.net/npm/v/mime-db
diff --git a/node_modules/mathjs/examples/node_modules/mime-db/db.json b/node_modules/mathjs/examples/node_modules/mime-db/db.json
new file mode 100644
index 0000000..eb9c42c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-db/db.json
@@ -0,0 +1,8519 @@
+{
+  "application/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "application/3gpdash-qoe-report+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/3gpp-ims+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/3gpphal+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/3gpphalforms+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/a2l": {
+    "source": "iana"
+  },
+  "application/ace+cbor": {
+    "source": "iana"
+  },
+  "application/activemessage": {
+    "source": "iana"
+  },
+  "application/activity+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-costmap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-costmapfilter+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-directory+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointcost+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointcostparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointprop+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointpropparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-error+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-networkmap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-networkmapfilter+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-updatestreamcontrol+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-updatestreamparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/aml": {
+    "source": "iana"
+  },
+  "application/andrew-inset": {
+    "source": "iana",
+    "extensions": ["ez"]
+  },
+  "application/applefile": {
+    "source": "iana"
+  },
+  "application/applixware": {
+    "source": "apache",
+    "extensions": ["aw"]
+  },
+  "application/at+jwt": {
+    "source": "iana"
+  },
+  "application/atf": {
+    "source": "iana"
+  },
+  "application/atfx": {
+    "source": "iana"
+  },
+  "application/atom+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atom"]
+  },
+  "application/atomcat+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atomcat"]
+  },
+  "application/atomdeleted+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atomdeleted"]
+  },
+  "application/atomicmail": {
+    "source": "iana"
+  },
+  "application/atomsvc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atomsvc"]
+  },
+  "application/atsc-dwd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dwd"]
+  },
+  "application/atsc-dynamic-event-message": {
+    "source": "iana"
+  },
+  "application/atsc-held+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["held"]
+  },
+  "application/atsc-rdt+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/atsc-rsat+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rsat"]
+  },
+  "application/atxml": {
+    "source": "iana"
+  },
+  "application/auth-policy+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/bacnet-xdd+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/batch-smtp": {
+    "source": "iana"
+  },
+  "application/bdoc": {
+    "compressible": false,
+    "extensions": ["bdoc"]
+  },
+  "application/beep+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/calendar+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/calendar+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xcs"]
+  },
+  "application/call-completion": {
+    "source": "iana"
+  },
+  "application/cals-1840": {
+    "source": "iana"
+  },
+  "application/captive+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cbor": {
+    "source": "iana"
+  },
+  "application/cbor-seq": {
+    "source": "iana"
+  },
+  "application/cccex": {
+    "source": "iana"
+  },
+  "application/ccmp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ccxml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ccxml"]
+  },
+  "application/cdfx+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["cdfx"]
+  },
+  "application/cdmi-capability": {
+    "source": "iana",
+    "extensions": ["cdmia"]
+  },
+  "application/cdmi-container": {
+    "source": "iana",
+    "extensions": ["cdmic"]
+  },
+  "application/cdmi-domain": {
+    "source": "iana",
+    "extensions": ["cdmid"]
+  },
+  "application/cdmi-object": {
+    "source": "iana",
+    "extensions": ["cdmio"]
+  },
+  "application/cdmi-queue": {
+    "source": "iana",
+    "extensions": ["cdmiq"]
+  },
+  "application/cdni": {
+    "source": "iana"
+  },
+  "application/cea": {
+    "source": "iana"
+  },
+  "application/cea-2018+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cellml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cfw": {
+    "source": "iana"
+  },
+  "application/city+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/clr": {
+    "source": "iana"
+  },
+  "application/clue+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/clue_info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cms": {
+    "source": "iana"
+  },
+  "application/cnrp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/coap-group+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/coap-payload": {
+    "source": "iana"
+  },
+  "application/commonground": {
+    "source": "iana"
+  },
+  "application/conference-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cose": {
+    "source": "iana"
+  },
+  "application/cose-key": {
+    "source": "iana"
+  },
+  "application/cose-key-set": {
+    "source": "iana"
+  },
+  "application/cpl+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["cpl"]
+  },
+  "application/csrattrs": {
+    "source": "iana"
+  },
+  "application/csta+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cstadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/csvm+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cu-seeme": {
+    "source": "apache",
+    "extensions": ["cu"]
+  },
+  "application/cwt": {
+    "source": "iana"
+  },
+  "application/cybercash": {
+    "source": "iana"
+  },
+  "application/dart": {
+    "compressible": true
+  },
+  "application/dash+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpd"]
+  },
+  "application/dash-patch+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpp"]
+  },
+  "application/dashdelta": {
+    "source": "iana"
+  },
+  "application/davmount+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["davmount"]
+  },
+  "application/dca-rft": {
+    "source": "iana"
+  },
+  "application/dcd": {
+    "source": "iana"
+  },
+  "application/dec-dx": {
+    "source": "iana"
+  },
+  "application/dialog-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dicom": {
+    "source": "iana"
+  },
+  "application/dicom+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dicom+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dii": {
+    "source": "iana"
+  },
+  "application/dit": {
+    "source": "iana"
+  },
+  "application/dns": {
+    "source": "iana"
+  },
+  "application/dns+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dns-message": {
+    "source": "iana"
+  },
+  "application/docbook+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["dbk"]
+  },
+  "application/dots+cbor": {
+    "source": "iana"
+  },
+  "application/dskpp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dssc+der": {
+    "source": "iana",
+    "extensions": ["dssc"]
+  },
+  "application/dssc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xdssc"]
+  },
+  "application/dvcs": {
+    "source": "iana"
+  },
+  "application/ecmascript": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["es","ecma"]
+  },
+  "application/edi-consent": {
+    "source": "iana"
+  },
+  "application/edi-x12": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/edifact": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/efi": {
+    "source": "iana"
+  },
+  "application/elm+json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/elm+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.cap+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/emergencycalldata.comment+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.control+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.deviceinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.ecall.msd": {
+    "source": "iana"
+  },
+  "application/emergencycalldata.providerinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.serviceinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.subscriberinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.veds+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emma+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["emma"]
+  },
+  "application/emotionml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["emotionml"]
+  },
+  "application/encaprtp": {
+    "source": "iana"
+  },
+  "application/epp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/epub+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["epub"]
+  },
+  "application/eshop": {
+    "source": "iana"
+  },
+  "application/exi": {
+    "source": "iana",
+    "extensions": ["exi"]
+  },
+  "application/expect-ct-report+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/express": {
+    "source": "iana",
+    "extensions": ["exp"]
+  },
+  "application/fastinfoset": {
+    "source": "iana"
+  },
+  "application/fastsoap": {
+    "source": "iana"
+  },
+  "application/fdt+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["fdt"]
+  },
+  "application/fhir+json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/fhir+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/fido.trusted-apps+json": {
+    "compressible": true
+  },
+  "application/fits": {
+    "source": "iana"
+  },
+  "application/flexfec": {
+    "source": "iana"
+  },
+  "application/font-sfnt": {
+    "source": "iana"
+  },
+  "application/font-tdpfr": {
+    "source": "iana",
+    "extensions": ["pfr"]
+  },
+  "application/font-woff": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/framework-attributes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/geo+json": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["geojson"]
+  },
+  "application/geo+json-seq": {
+    "source": "iana"
+  },
+  "application/geopackage+sqlite3": {
+    "source": "iana"
+  },
+  "application/geoxacml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/gltf-buffer": {
+    "source": "iana"
+  },
+  "application/gml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["gml"]
+  },
+  "application/gpx+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["gpx"]
+  },
+  "application/gxf": {
+    "source": "apache",
+    "extensions": ["gxf"]
+  },
+  "application/gzip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["gz"]
+  },
+  "application/h224": {
+    "source": "iana"
+  },
+  "application/held+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/hjson": {
+    "extensions": ["hjson"]
+  },
+  "application/http": {
+    "source": "iana"
+  },
+  "application/hyperstudio": {
+    "source": "iana",
+    "extensions": ["stk"]
+  },
+  "application/ibe-key-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ibe-pkg-reply+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ibe-pp-data": {
+    "source": "iana"
+  },
+  "application/iges": {
+    "source": "iana"
+  },
+  "application/im-iscomposing+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/index": {
+    "source": "iana"
+  },
+  "application/index.cmd": {
+    "source": "iana"
+  },
+  "application/index.obj": {
+    "source": "iana"
+  },
+  "application/index.response": {
+    "source": "iana"
+  },
+  "application/index.vnd": {
+    "source": "iana"
+  },
+  "application/inkml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ink","inkml"]
+  },
+  "application/iotp": {
+    "source": "iana"
+  },
+  "application/ipfix": {
+    "source": "iana",
+    "extensions": ["ipfix"]
+  },
+  "application/ipp": {
+    "source": "iana"
+  },
+  "application/isup": {
+    "source": "iana"
+  },
+  "application/its+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["its"]
+  },
+  "application/java-archive": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["jar","war","ear"]
+  },
+  "application/java-serialized-object": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["ser"]
+  },
+  "application/java-vm": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["class"]
+  },
+  "application/javascript": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["js","mjs"]
+  },
+  "application/jf2feed+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jose": {
+    "source": "iana"
+  },
+  "application/jose+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jrd+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jscalendar+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["json","map"]
+  },
+  "application/json-patch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/json-seq": {
+    "source": "iana"
+  },
+  "application/json5": {
+    "extensions": ["json5"]
+  },
+  "application/jsonml+json": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["jsonml"]
+  },
+  "application/jwk+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jwk-set+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jwt": {
+    "source": "iana"
+  },
+  "application/kpml-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/kpml-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ld+json": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["jsonld"]
+  },
+  "application/lgr+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lgr"]
+  },
+  "application/link-format": {
+    "source": "iana"
+  },
+  "application/load-control+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/lost+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lostxml"]
+  },
+  "application/lostsync+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/lpf+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/lxf": {
+    "source": "iana"
+  },
+  "application/mac-binhex40": {
+    "source": "iana",
+    "extensions": ["hqx"]
+  },
+  "application/mac-compactpro": {
+    "source": "apache",
+    "extensions": ["cpt"]
+  },
+  "application/macwriteii": {
+    "source": "iana"
+  },
+  "application/mads+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mads"]
+  },
+  "application/manifest+json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["webmanifest"]
+  },
+  "application/marc": {
+    "source": "iana",
+    "extensions": ["mrc"]
+  },
+  "application/marcxml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mrcx"]
+  },
+  "application/mathematica": {
+    "source": "iana",
+    "extensions": ["ma","nb","mb"]
+  },
+  "application/mathml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mathml"]
+  },
+  "application/mathml-content+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mathml-presentation+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-associated-procedure-description+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-deregister+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-envelope+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-msk+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-msk-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-protection-description+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-reception-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-register+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-register-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-schedule+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-user-service-description+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbox": {
+    "source": "iana",
+    "extensions": ["mbox"]
+  },
+  "application/media-policy-dataset+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpf"]
+  },
+  "application/media_control+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mediaservercontrol+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mscml"]
+  },
+  "application/merge-patch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/metalink+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["metalink"]
+  },
+  "application/metalink4+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["meta4"]
+  },
+  "application/mets+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mets"]
+  },
+  "application/mf4": {
+    "source": "iana"
+  },
+  "application/mikey": {
+    "source": "iana"
+  },
+  "application/mipc": {
+    "source": "iana"
+  },
+  "application/missing-blocks+cbor-seq": {
+    "source": "iana"
+  },
+  "application/mmt-aei+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["maei"]
+  },
+  "application/mmt-usd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["musd"]
+  },
+  "application/mods+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mods"]
+  },
+  "application/moss-keys": {
+    "source": "iana"
+  },
+  "application/moss-signature": {
+    "source": "iana"
+  },
+  "application/mosskey-data": {
+    "source": "iana"
+  },
+  "application/mosskey-request": {
+    "source": "iana"
+  },
+  "application/mp21": {
+    "source": "iana",
+    "extensions": ["m21","mp21"]
+  },
+  "application/mp4": {
+    "source": "iana",
+    "extensions": ["mp4s","m4p"]
+  },
+  "application/mpeg4-generic": {
+    "source": "iana"
+  },
+  "application/mpeg4-iod": {
+    "source": "iana"
+  },
+  "application/mpeg4-iod-xmt": {
+    "source": "iana"
+  },
+  "application/mrb-consumer+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mrb-publish+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/msc-ivr+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/msc-mixer+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/msword": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["doc","dot"]
+  },
+  "application/mud+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/multipart-core": {
+    "source": "iana"
+  },
+  "application/mxf": {
+    "source": "iana",
+    "extensions": ["mxf"]
+  },
+  "application/n-quads": {
+    "source": "iana",
+    "extensions": ["nq"]
+  },
+  "application/n-triples": {
+    "source": "iana",
+    "extensions": ["nt"]
+  },
+  "application/nasdata": {
+    "source": "iana"
+  },
+  "application/news-checkgroups": {
+    "source": "iana",
+    "charset": "US-ASCII"
+  },
+  "application/news-groupinfo": {
+    "source": "iana",
+    "charset": "US-ASCII"
+  },
+  "application/news-transmission": {
+    "source": "iana"
+  },
+  "application/nlsml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/node": {
+    "source": "iana",
+    "extensions": ["cjs"]
+  },
+  "application/nss": {
+    "source": "iana"
+  },
+  "application/oauth-authz-req+jwt": {
+    "source": "iana"
+  },
+  "application/oblivious-dns-message": {
+    "source": "iana"
+  },
+  "application/ocsp-request": {
+    "source": "iana"
+  },
+  "application/ocsp-response": {
+    "source": "iana"
+  },
+  "application/octet-stream": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["bin","dms","lrf","mar","so","dist","distz","pkg","bpk","dump","elc","deploy","exe","dll","deb","dmg","iso","img","msi","msp","msm","buffer"]
+  },
+  "application/oda": {
+    "source": "iana",
+    "extensions": ["oda"]
+  },
+  "application/odm+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/odx": {
+    "source": "iana"
+  },
+  "application/oebps-package+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["opf"]
+  },
+  "application/ogg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ogx"]
+  },
+  "application/omdoc+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["omdoc"]
+  },
+  "application/onenote": {
+    "source": "apache",
+    "extensions": ["onetoc","onetoc2","onetmp","onepkg"]
+  },
+  "application/opc-nodeset+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/oscore": {
+    "source": "iana"
+  },
+  "application/oxps": {
+    "source": "iana",
+    "extensions": ["oxps"]
+  },
+  "application/p21": {
+    "source": "iana"
+  },
+  "application/p21+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/p2p-overlay+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["relo"]
+  },
+  "application/parityfec": {
+    "source": "iana"
+  },
+  "application/passport": {
+    "source": "iana"
+  },
+  "application/patch-ops-error+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xer"]
+  },
+  "application/pdf": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["pdf"]
+  },
+  "application/pdx": {
+    "source": "iana"
+  },
+  "application/pem-certificate-chain": {
+    "source": "iana"
+  },
+  "application/pgp-encrypted": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["pgp"]
+  },
+  "application/pgp-keys": {
+    "source": "iana",
+    "extensions": ["asc"]
+  },
+  "application/pgp-signature": {
+    "source": "iana",
+    "extensions": ["asc","sig"]
+  },
+  "application/pics-rules": {
+    "source": "apache",
+    "extensions": ["prf"]
+  },
+  "application/pidf+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/pidf-diff+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/pkcs10": {
+    "source": "iana",
+    "extensions": ["p10"]
+  },
+  "application/pkcs12": {
+    "source": "iana"
+  },
+  "application/pkcs7-mime": {
+    "source": "iana",
+    "extensions": ["p7m","p7c"]
+  },
+  "application/pkcs7-signature": {
+    "source": "iana",
+    "extensions": ["p7s"]
+  },
+  "application/pkcs8": {
+    "source": "iana",
+    "extensions": ["p8"]
+  },
+  "application/pkcs8-encrypted": {
+    "source": "iana"
+  },
+  "application/pkix-attr-cert": {
+    "source": "iana",
+    "extensions": ["ac"]
+  },
+  "application/pkix-cert": {
+    "source": "iana",
+    "extensions": ["cer"]
+  },
+  "application/pkix-crl": {
+    "source": "iana",
+    "extensions": ["crl"]
+  },
+  "application/pkix-pkipath": {
+    "source": "iana",
+    "extensions": ["pkipath"]
+  },
+  "application/pkixcmp": {
+    "source": "iana",
+    "extensions": ["pki"]
+  },
+  "application/pls+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["pls"]
+  },
+  "application/poc-settings+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/postscript": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ai","eps","ps"]
+  },
+  "application/ppsp-tracker+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/problem+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/problem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/provenance+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["provx"]
+  },
+  "application/prs.alvestrand.titrax-sheet": {
+    "source": "iana"
+  },
+  "application/prs.cww": {
+    "source": "iana",
+    "extensions": ["cww"]
+  },
+  "application/prs.cyn": {
+    "source": "iana",
+    "charset": "7-BIT"
+  },
+  "application/prs.hpub+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/prs.nprend": {
+    "source": "iana"
+  },
+  "application/prs.plucker": {
+    "source": "iana"
+  },
+  "application/prs.rdf-xml-crypt": {
+    "source": "iana"
+  },
+  "application/prs.xsf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/pskc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["pskcxml"]
+  },
+  "application/pvd+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/qsig": {
+    "source": "iana"
+  },
+  "application/raml+yaml": {
+    "compressible": true,
+    "extensions": ["raml"]
+  },
+  "application/raptorfec": {
+    "source": "iana"
+  },
+  "application/rdap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/rdf+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rdf","owl"]
+  },
+  "application/reginfo+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rif"]
+  },
+  "application/relax-ng-compact-syntax": {
+    "source": "iana",
+    "extensions": ["rnc"]
+  },
+  "application/remote-printing": {
+    "source": "iana"
+  },
+  "application/reputon+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/resource-lists+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rl"]
+  },
+  "application/resource-lists-diff+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rld"]
+  },
+  "application/rfc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/riscos": {
+    "source": "iana"
+  },
+  "application/rlmi+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/rls-services+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rs"]
+  },
+  "application/route-apd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rapd"]
+  },
+  "application/route-s-tsid+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sls"]
+  },
+  "application/route-usd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rusd"]
+  },
+  "application/rpki-ghostbusters": {
+    "source": "iana",
+    "extensions": ["gbr"]
+  },
+  "application/rpki-manifest": {
+    "source": "iana",
+    "extensions": ["mft"]
+  },
+  "application/rpki-publication": {
+    "source": "iana"
+  },
+  "application/rpki-roa": {
+    "source": "iana",
+    "extensions": ["roa"]
+  },
+  "application/rpki-updown": {
+    "source": "iana"
+  },
+  "application/rsd+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["rsd"]
+  },
+  "application/rss+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["rss"]
+  },
+  "application/rtf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rtf"]
+  },
+  "application/rtploopback": {
+    "source": "iana"
+  },
+  "application/rtx": {
+    "source": "iana"
+  },
+  "application/samlassertion+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/samlmetadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sarif+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sarif-external-properties+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sbe": {
+    "source": "iana"
+  },
+  "application/sbml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sbml"]
+  },
+  "application/scaip+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/scim+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/scvp-cv-request": {
+    "source": "iana",
+    "extensions": ["scq"]
+  },
+  "application/scvp-cv-response": {
+    "source": "iana",
+    "extensions": ["scs"]
+  },
+  "application/scvp-vp-request": {
+    "source": "iana",
+    "extensions": ["spq"]
+  },
+  "application/scvp-vp-response": {
+    "source": "iana",
+    "extensions": ["spp"]
+  },
+  "application/sdp": {
+    "source": "iana",
+    "extensions": ["sdp"]
+  },
+  "application/secevent+jwt": {
+    "source": "iana"
+  },
+  "application/senml+cbor": {
+    "source": "iana"
+  },
+  "application/senml+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/senml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["senmlx"]
+  },
+  "application/senml-etch+cbor": {
+    "source": "iana"
+  },
+  "application/senml-etch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/senml-exi": {
+    "source": "iana"
+  },
+  "application/sensml+cbor": {
+    "source": "iana"
+  },
+  "application/sensml+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sensml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sensmlx"]
+  },
+  "application/sensml-exi": {
+    "source": "iana"
+  },
+  "application/sep+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sep-exi": {
+    "source": "iana"
+  },
+  "application/session-info": {
+    "source": "iana"
+  },
+  "application/set-payment": {
+    "source": "iana"
+  },
+  "application/set-payment-initiation": {
+    "source": "iana",
+    "extensions": ["setpay"]
+  },
+  "application/set-registration": {
+    "source": "iana"
+  },
+  "application/set-registration-initiation": {
+    "source": "iana",
+    "extensions": ["setreg"]
+  },
+  "application/sgml": {
+    "source": "iana"
+  },
+  "application/sgml-open-catalog": {
+    "source": "iana"
+  },
+  "application/shf+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["shf"]
+  },
+  "application/sieve": {
+    "source": "iana",
+    "extensions": ["siv","sieve"]
+  },
+  "application/simple-filter+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/simple-message-summary": {
+    "source": "iana"
+  },
+  "application/simplesymbolcontainer": {
+    "source": "iana"
+  },
+  "application/sipc": {
+    "source": "iana"
+  },
+  "application/slate": {
+    "source": "iana"
+  },
+  "application/smil": {
+    "source": "iana"
+  },
+  "application/smil+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["smi","smil"]
+  },
+  "application/smpte336m": {
+    "source": "iana"
+  },
+  "application/soap+fastinfoset": {
+    "source": "iana"
+  },
+  "application/soap+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sparql-query": {
+    "source": "iana",
+    "extensions": ["rq"]
+  },
+  "application/sparql-results+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["srx"]
+  },
+  "application/spdx+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/spirits-event+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sql": {
+    "source": "iana"
+  },
+  "application/srgs": {
+    "source": "iana",
+    "extensions": ["gram"]
+  },
+  "application/srgs+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["grxml"]
+  },
+  "application/sru+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sru"]
+  },
+  "application/ssdl+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["ssdl"]
+  },
+  "application/ssml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ssml"]
+  },
+  "application/stix+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/swid+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["swidtag"]
+  },
+  "application/tamp-apex-update": {
+    "source": "iana"
+  },
+  "application/tamp-apex-update-confirm": {
+    "source": "iana"
+  },
+  "application/tamp-community-update": {
+    "source": "iana"
+  },
+  "application/tamp-community-update-confirm": {
+    "source": "iana"
+  },
+  "application/tamp-error": {
+    "source": "iana"
+  },
+  "application/tamp-sequence-adjust": {
+    "source": "iana"
+  },
+  "application/tamp-sequence-adjust-confirm": {
+    "source": "iana"
+  },
+  "application/tamp-status-query": {
+    "source": "iana"
+  },
+  "application/tamp-status-response": {
+    "source": "iana"
+  },
+  "application/tamp-update": {
+    "source": "iana"
+  },
+  "application/tamp-update-confirm": {
+    "source": "iana"
+  },
+  "application/tar": {
+    "compressible": true
+  },
+  "application/taxii+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/td+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/tei+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["tei","teicorpus"]
+  },
+  "application/tetra_isi": {
+    "source": "iana"
+  },
+  "application/thraud+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["tfi"]
+  },
+  "application/timestamp-query": {
+    "source": "iana"
+  },
+  "application/timestamp-reply": {
+    "source": "iana"
+  },
+  "application/timestamped-data": {
+    "source": "iana",
+    "extensions": ["tsd"]
+  },
+  "application/tlsrpt+gzip": {
+    "source": "iana"
+  },
+  "application/tlsrpt+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/tnauthlist": {
+    "source": "iana"
+  },
+  "application/token-introspection+jwt": {
+    "source": "iana"
+  },
+  "application/toml": {
+    "compressible": true,
+    "extensions": ["toml"]
+  },
+  "application/trickle-ice-sdpfrag": {
+    "source": "iana"
+  },
+  "application/trig": {
+    "source": "iana",
+    "extensions": ["trig"]
+  },
+  "application/ttml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ttml"]
+  },
+  "application/tve-trigger": {
+    "source": "iana"
+  },
+  "application/tzif": {
+    "source": "iana"
+  },
+  "application/tzif-leap": {
+    "source": "iana"
+  },
+  "application/ubjson": {
+    "compressible": false,
+    "extensions": ["ubj"]
+  },
+  "application/ulpfec": {
+    "source": "iana"
+  },
+  "application/urc-grpsheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/urc-ressheet+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rsheet"]
+  },
+  "application/urc-targetdesc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["td"]
+  },
+  "application/urc-uisocketdesc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vcard+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vcard+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vemmi": {
+    "source": "iana"
+  },
+  "application/vividence.scriptfile": {
+    "source": "apache"
+  },
+  "application/vnd.1000minds.decision-model+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["1km"]
+  },
+  "application/vnd.3gpp-prose+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp-prose-pc3ch+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp-v2x-local-service-information": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.5gnas": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.access-transfer-events+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.bsf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.gmop+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.gtpc": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.interworking-data": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.lpp": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mc-signalling-ear": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mcdata-affiliation-command+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-payload": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mcdata-service-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-signalling": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mcdata-ue-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-user-profile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-affiliation-command+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-floor-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-location-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-mbms-usage-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-service-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-signed+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-ue-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-ue-init-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-user-profile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-affiliation-command+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-affiliation-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-location-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-mbms-usage-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-service-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-transmission-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-ue-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-user-profile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mid-call+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.ngap": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.pfcp": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.pic-bw-large": {
+    "source": "iana",
+    "extensions": ["plb"]
+  },
+  "application/vnd.3gpp.pic-bw-small": {
+    "source": "iana",
+    "extensions": ["psb"]
+  },
+  "application/vnd.3gpp.pic-bw-var": {
+    "source": "iana",
+    "extensions": ["pvb"]
+  },
+  "application/vnd.3gpp.s1ap": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.sms": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.sms+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.srvcc-ext+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.srvcc-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.state-and-event-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.ussd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp2.bcmcsinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp2.sms": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp2.tcap": {
+    "source": "iana",
+    "extensions": ["tcap"]
+  },
+  "application/vnd.3lightssoftware.imagescal": {
+    "source": "iana"
+  },
+  "application/vnd.3m.post-it-notes": {
+    "source": "iana",
+    "extensions": ["pwn"]
+  },
+  "application/vnd.accpac.simply.aso": {
+    "source": "iana",
+    "extensions": ["aso"]
+  },
+  "application/vnd.accpac.simply.imp": {
+    "source": "iana",
+    "extensions": ["imp"]
+  },
+  "application/vnd.acucobol": {
+    "source": "iana",
+    "extensions": ["acu"]
+  },
+  "application/vnd.acucorp": {
+    "source": "iana",
+    "extensions": ["atc","acutc"]
+  },
+  "application/vnd.adobe.air-application-installer-package+zip": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["air"]
+  },
+  "application/vnd.adobe.flash.movie": {
+    "source": "iana"
+  },
+  "application/vnd.adobe.formscentral.fcdt": {
+    "source": "iana",
+    "extensions": ["fcdt"]
+  },
+  "application/vnd.adobe.fxp": {
+    "source": "iana",
+    "extensions": ["fxp","fxpl"]
+  },
+  "application/vnd.adobe.partial-upload": {
+    "source": "iana"
+  },
+  "application/vnd.adobe.xdp+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xdp"]
+  },
+  "application/vnd.adobe.xfdf": {
+    "source": "iana",
+    "extensions": ["xfdf"]
+  },
+  "application/vnd.aether.imp": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.afplinedata": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.afplinedata-pagedef": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.cmoca-cmresource": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.foca-charset": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.foca-codedfont": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.foca-codepage": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-cmtable": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-formdef": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-mediummap": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-objectcontainer": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-overlay": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-pagesegment": {
+    "source": "iana"
+  },
+  "application/vnd.age": {
+    "source": "iana",
+    "extensions": ["age"]
+  },
+  "application/vnd.ah-barcode": {
+    "source": "iana"
+  },
+  "application/vnd.ahead.space": {
+    "source": "iana",
+    "extensions": ["ahead"]
+  },
+  "application/vnd.airzip.filesecure.azf": {
+    "source": "iana",
+    "extensions": ["azf"]
+  },
+  "application/vnd.airzip.filesecure.azs": {
+    "source": "iana",
+    "extensions": ["azs"]
+  },
+  "application/vnd.amadeus+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.amazon.ebook": {
+    "source": "apache",
+    "extensions": ["azw"]
+  },
+  "application/vnd.amazon.mobi8-ebook": {
+    "source": "iana"
+  },
+  "application/vnd.americandynamics.acc": {
+    "source": "iana",
+    "extensions": ["acc"]
+  },
+  "application/vnd.amiga.ami": {
+    "source": "iana",
+    "extensions": ["ami"]
+  },
+  "application/vnd.amundsen.maze+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.android.ota": {
+    "source": "iana"
+  },
+  "application/vnd.android.package-archive": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["apk"]
+  },
+  "application/vnd.anki": {
+    "source": "iana"
+  },
+  "application/vnd.anser-web-certificate-issue-initiation": {
+    "source": "iana",
+    "extensions": ["cii"]
+  },
+  "application/vnd.anser-web-funds-transfer-initiation": {
+    "source": "apache",
+    "extensions": ["fti"]
+  },
+  "application/vnd.antix.game-component": {
+    "source": "iana",
+    "extensions": ["atx"]
+  },
+  "application/vnd.apache.arrow.file": {
+    "source": "iana"
+  },
+  "application/vnd.apache.arrow.stream": {
+    "source": "iana"
+  },
+  "application/vnd.apache.thrift.binary": {
+    "source": "iana"
+  },
+  "application/vnd.apache.thrift.compact": {
+    "source": "iana"
+  },
+  "application/vnd.apache.thrift.json": {
+    "source": "iana"
+  },
+  "application/vnd.api+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.aplextor.warrp+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.apothekende.reservation+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.apple.installer+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpkg"]
+  },
+  "application/vnd.apple.keynote": {
+    "source": "iana",
+    "extensions": ["key"]
+  },
+  "application/vnd.apple.mpegurl": {
+    "source": "iana",
+    "extensions": ["m3u8"]
+  },
+  "application/vnd.apple.numbers": {
+    "source": "iana",
+    "extensions": ["numbers"]
+  },
+  "application/vnd.apple.pages": {
+    "source": "iana",
+    "extensions": ["pages"]
+  },
+  "application/vnd.apple.pkpass": {
+    "compressible": false,
+    "extensions": ["pkpass"]
+  },
+  "application/vnd.arastra.swi": {
+    "source": "iana"
+  },
+  "application/vnd.aristanetworks.swi": {
+    "source": "iana",
+    "extensions": ["swi"]
+  },
+  "application/vnd.artisan+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.artsquare": {
+    "source": "iana"
+  },
+  "application/vnd.astraea-software.iota": {
+    "source": "iana",
+    "extensions": ["iota"]
+  },
+  "application/vnd.audiograph": {
+    "source": "iana",
+    "extensions": ["aep"]
+  },
+  "application/vnd.autopackage": {
+    "source": "iana"
+  },
+  "application/vnd.avalon+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.avistar+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.balsamiq.bmml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["bmml"]
+  },
+  "application/vnd.balsamiq.bmpr": {
+    "source": "iana"
+  },
+  "application/vnd.banana-accounting": {
+    "source": "iana"
+  },
+  "application/vnd.bbf.usp.error": {
+    "source": "iana"
+  },
+  "application/vnd.bbf.usp.msg": {
+    "source": "iana"
+  },
+  "application/vnd.bbf.usp.msg+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.bekitzur-stech+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.bint.med-content": {
+    "source": "iana"
+  },
+  "application/vnd.biopax.rdf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.blink-idb-value-wrapper": {
+    "source": "iana"
+  },
+  "application/vnd.blueice.multipass": {
+    "source": "iana",
+    "extensions": ["mpm"]
+  },
+  "application/vnd.bluetooth.ep.oob": {
+    "source": "iana"
+  },
+  "application/vnd.bluetooth.le.oob": {
+    "source": "iana"
+  },
+  "application/vnd.bmi": {
+    "source": "iana",
+    "extensions": ["bmi"]
+  },
+  "application/vnd.bpf": {
+    "source": "iana"
+  },
+  "application/vnd.bpf3": {
+    "source": "iana"
+  },
+  "application/vnd.businessobjects": {
+    "source": "iana",
+    "extensions": ["rep"]
+  },
+  "application/vnd.byu.uapi+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cab-jscript": {
+    "source": "iana"
+  },
+  "application/vnd.canon-cpdl": {
+    "source": "iana"
+  },
+  "application/vnd.canon-lips": {
+    "source": "iana"
+  },
+  "application/vnd.capasystems-pg+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cendio.thinlinc.clientconf": {
+    "source": "iana"
+  },
+  "application/vnd.century-systems.tcp_stream": {
+    "source": "iana"
+  },
+  "application/vnd.chemdraw+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["cdxml"]
+  },
+  "application/vnd.chess-pgn": {
+    "source": "iana"
+  },
+  "application/vnd.chipnuts.karaoke-mmd": {
+    "source": "iana",
+    "extensions": ["mmd"]
+  },
+  "application/vnd.ciedi": {
+    "source": "iana"
+  },
+  "application/vnd.cinderella": {
+    "source": "iana",
+    "extensions": ["cdy"]
+  },
+  "application/vnd.cirpack.isdn-ext": {
+    "source": "iana"
+  },
+  "application/vnd.citationstyles.style+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["csl"]
+  },
+  "application/vnd.claymore": {
+    "source": "iana",
+    "extensions": ["cla"]
+  },
+  "application/vnd.cloanto.rp9": {
+    "source": "iana",
+    "extensions": ["rp9"]
+  },
+  "application/vnd.clonk.c4group": {
+    "source": "iana",
+    "extensions": ["c4g","c4d","c4f","c4p","c4u"]
+  },
+  "application/vnd.cluetrust.cartomobile-config": {
+    "source": "iana",
+    "extensions": ["c11amc"]
+  },
+  "application/vnd.cluetrust.cartomobile-config-pkg": {
+    "source": "iana",
+    "extensions": ["c11amz"]
+  },
+  "application/vnd.coffeescript": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.document": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.document-template": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.presentation": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.presentation-template": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.spreadsheet": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.spreadsheet-template": {
+    "source": "iana"
+  },
+  "application/vnd.collection+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.collection.doc+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.collection.next+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.comicbook+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.comicbook-rar": {
+    "source": "iana"
+  },
+  "application/vnd.commerce-battelle": {
+    "source": "iana"
+  },
+  "application/vnd.commonspace": {
+    "source": "iana",
+    "extensions": ["csp"]
+  },
+  "application/vnd.contact.cmsg": {
+    "source": "iana",
+    "extensions": ["cdbcmsg"]
+  },
+  "application/vnd.coreos.ignition+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cosmocaller": {
+    "source": "iana",
+    "extensions": ["cmc"]
+  },
+  "application/vnd.crick.clicker": {
+    "source": "iana",
+    "extensions": ["clkx"]
+  },
+  "application/vnd.crick.clicker.keyboard": {
+    "source": "iana",
+    "extensions": ["clkk"]
+  },
+  "application/vnd.crick.clicker.palette": {
+    "source": "iana",
+    "extensions": ["clkp"]
+  },
+  "application/vnd.crick.clicker.template": {
+    "source": "iana",
+    "extensions": ["clkt"]
+  },
+  "application/vnd.crick.clicker.wordbank": {
+    "source": "iana",
+    "extensions": ["clkw"]
+  },
+  "application/vnd.criticaltools.wbs+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wbs"]
+  },
+  "application/vnd.cryptii.pipe+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.crypto-shade-file": {
+    "source": "iana"
+  },
+  "application/vnd.cryptomator.encrypted": {
+    "source": "iana"
+  },
+  "application/vnd.cryptomator.vault": {
+    "source": "iana"
+  },
+  "application/vnd.ctc-posml": {
+    "source": "iana",
+    "extensions": ["pml"]
+  },
+  "application/vnd.ctct.ws+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cups-pdf": {
+    "source": "iana"
+  },
+  "application/vnd.cups-postscript": {
+    "source": "iana"
+  },
+  "application/vnd.cups-ppd": {
+    "source": "iana",
+    "extensions": ["ppd"]
+  },
+  "application/vnd.cups-raster": {
+    "source": "iana"
+  },
+  "application/vnd.cups-raw": {
+    "source": "iana"
+  },
+  "application/vnd.curl": {
+    "source": "iana"
+  },
+  "application/vnd.curl.car": {
+    "source": "apache",
+    "extensions": ["car"]
+  },
+  "application/vnd.curl.pcurl": {
+    "source": "apache",
+    "extensions": ["pcurl"]
+  },
+  "application/vnd.cyan.dean.root+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cybank": {
+    "source": "iana"
+  },
+  "application/vnd.cyclonedx+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cyclonedx+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.d2l.coursepackage1p0+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.d3m-dataset": {
+    "source": "iana"
+  },
+  "application/vnd.d3m-problem": {
+    "source": "iana"
+  },
+  "application/vnd.dart": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dart"]
+  },
+  "application/vnd.data-vision.rdz": {
+    "source": "iana",
+    "extensions": ["rdz"]
+  },
+  "application/vnd.datapackage+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dataresource+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dbf": {
+    "source": "iana",
+    "extensions": ["dbf"]
+  },
+  "application/vnd.debian.binary-package": {
+    "source": "iana"
+  },
+  "application/vnd.dece.data": {
+    "source": "iana",
+    "extensions": ["uvf","uvvf","uvd","uvvd"]
+  },
+  "application/vnd.dece.ttml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["uvt","uvvt"]
+  },
+  "application/vnd.dece.unspecified": {
+    "source": "iana",
+    "extensions": ["uvx","uvvx"]
+  },
+  "application/vnd.dece.zip": {
+    "source": "iana",
+    "extensions": ["uvz","uvvz"]
+  },
+  "application/vnd.denovo.fcselayout-link": {
+    "source": "iana",
+    "extensions": ["fe_launch"]
+  },
+  "application/vnd.desmume.movie": {
+    "source": "iana"
+  },
+  "application/vnd.dir-bi.plate-dl-nosuffix": {
+    "source": "iana"
+  },
+  "application/vnd.dm.delegation+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dna": {
+    "source": "iana",
+    "extensions": ["dna"]
+  },
+  "application/vnd.document+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dolby.mlp": {
+    "source": "apache",
+    "extensions": ["mlp"]
+  },
+  "application/vnd.dolby.mobile.1": {
+    "source": "iana"
+  },
+  "application/vnd.dolby.mobile.2": {
+    "source": "iana"
+  },
+  "application/vnd.doremir.scorecloud-binary-document": {
+    "source": "iana"
+  },
+  "application/vnd.dpgraph": {
+    "source": "iana",
+    "extensions": ["dpg"]
+  },
+  "application/vnd.dreamfactory": {
+    "source": "iana",
+    "extensions": ["dfac"]
+  },
+  "application/vnd.drive+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ds-keypoint": {
+    "source": "apache",
+    "extensions": ["kpxx"]
+  },
+  "application/vnd.dtg.local": {
+    "source": "iana"
+  },
+  "application/vnd.dtg.local.flash": {
+    "source": "iana"
+  },
+  "application/vnd.dtg.local.html": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ait": {
+    "source": "iana",
+    "extensions": ["ait"]
+  },
+  "application/vnd.dvb.dvbisl+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.dvbj": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.esgcontainer": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcdftnotifaccess": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcesgaccess": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcesgaccess2": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcesgpdd": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcroaming": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.iptv.alfec-base": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.iptv.alfec-enhancement": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.notif-aggregate-root+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-container+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-generic+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-ia-msglist+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-ia-registration-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-ia-registration-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-init+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.pfr": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.service": {
+    "source": "iana",
+    "extensions": ["svc"]
+  },
+  "application/vnd.dxr": {
+    "source": "iana"
+  },
+  "application/vnd.dynageo": {
+    "source": "iana",
+    "extensions": ["geo"]
+  },
+  "application/vnd.dzr": {
+    "source": "iana"
+  },
+  "application/vnd.easykaraoke.cdgdownload": {
+    "source": "iana"
+  },
+  "application/vnd.ecdis-update": {
+    "source": "iana"
+  },
+  "application/vnd.ecip.rlp": {
+    "source": "iana"
+  },
+  "application/vnd.eclipse.ditto+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ecowin.chart": {
+    "source": "iana",
+    "extensions": ["mag"]
+  },
+  "application/vnd.ecowin.filerequest": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.fileupdate": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.series": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.seriesrequest": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.seriesupdate": {
+    "source": "iana"
+  },
+  "application/vnd.efi.img": {
+    "source": "iana"
+  },
+  "application/vnd.efi.iso": {
+    "source": "iana"
+  },
+  "application/vnd.emclient.accessrequest+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.enliven": {
+    "source": "iana",
+    "extensions": ["nml"]
+  },
+  "application/vnd.enphase.envoy": {
+    "source": "iana"
+  },
+  "application/vnd.eprints.data+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.epson.esf": {
+    "source": "iana",
+    "extensions": ["esf"]
+  },
+  "application/vnd.epson.msf": {
+    "source": "iana",
+    "extensions": ["msf"]
+  },
+  "application/vnd.epson.quickanime": {
+    "source": "iana",
+    "extensions": ["qam"]
+  },
+  "application/vnd.epson.salt": {
+    "source": "iana",
+    "extensions": ["slt"]
+  },
+  "application/vnd.epson.ssf": {
+    "source": "iana",
+    "extensions": ["ssf"]
+  },
+  "application/vnd.ericsson.quickcall": {
+    "source": "iana"
+  },
+  "application/vnd.espass-espass+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.eszigno3+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["es3","et3"]
+  },
+  "application/vnd.etsi.aoc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.asic-e+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.etsi.asic-s+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.etsi.cug+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvcommand+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvdiscovery+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsad-bc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsad-cod+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsad-npvr+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvservice+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsync+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvueprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.mcid+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.mheg5": {
+    "source": "iana"
+  },
+  "application/vnd.etsi.overload-control-policy-dataset+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.pstn+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.sci+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.simservs+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.timestamp-token": {
+    "source": "iana"
+  },
+  "application/vnd.etsi.tsl+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.tsl.der": {
+    "source": "iana"
+  },
+  "application/vnd.eu.kasparian.car+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.eudora.data": {
+    "source": "iana"
+  },
+  "application/vnd.evolv.ecig.profile": {
+    "source": "iana"
+  },
+  "application/vnd.evolv.ecig.settings": {
+    "source": "iana"
+  },
+  "application/vnd.evolv.ecig.theme": {
+    "source": "iana"
+  },
+  "application/vnd.exstream-empower+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.exstream-package": {
+    "source": "iana"
+  },
+  "application/vnd.ezpix-album": {
+    "source": "iana",
+    "extensions": ["ez2"]
+  },
+  "application/vnd.ezpix-package": {
+    "source": "iana",
+    "extensions": ["ez3"]
+  },
+  "application/vnd.f-secure.mobile": {
+    "source": "iana"
+  },
+  "application/vnd.familysearch.gedcom+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.fastcopy-disk-image": {
+    "source": "iana"
+  },
+  "application/vnd.fdf": {
+    "source": "iana",
+    "extensions": ["fdf"]
+  },
+  "application/vnd.fdsn.mseed": {
+    "source": "iana",
+    "extensions": ["mseed"]
+  },
+  "application/vnd.fdsn.seed": {
+    "source": "iana",
+    "extensions": ["seed","dataless"]
+  },
+  "application/vnd.ffsns": {
+    "source": "iana"
+  },
+  "application/vnd.ficlab.flb+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.filmit.zfc": {
+    "source": "iana"
+  },
+  "application/vnd.fints": {
+    "source": "iana"
+  },
+  "application/vnd.firemonkeys.cloudcell": {
+    "source": "iana"
+  },
+  "application/vnd.flographit": {
+    "source": "iana",
+    "extensions": ["gph"]
+  },
+  "application/vnd.fluxtime.clip": {
+    "source": "iana",
+    "extensions": ["ftc"]
+  },
+  "application/vnd.font-fontforge-sfd": {
+    "source": "iana"
+  },
+  "application/vnd.framemaker": {
+    "source": "iana",
+    "extensions": ["fm","frame","maker","book"]
+  },
+  "application/vnd.frogans.fnc": {
+    "source": "iana",
+    "extensions": ["fnc"]
+  },
+  "application/vnd.frogans.ltf": {
+    "source": "iana",
+    "extensions": ["ltf"]
+  },
+  "application/vnd.fsc.weblaunch": {
+    "source": "iana",
+    "extensions": ["fsc"]
+  },
+  "application/vnd.fujifilm.fb.docuworks": {
+    "source": "iana"
+  },
+  "application/vnd.fujifilm.fb.docuworks.binder": {
+    "source": "iana"
+  },
+  "application/vnd.fujifilm.fb.docuworks.container": {
+    "source": "iana"
+  },
+  "application/vnd.fujifilm.fb.jfi+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.fujitsu.oasys": {
+    "source": "iana",
+    "extensions": ["oas"]
+  },
+  "application/vnd.fujitsu.oasys2": {
+    "source": "iana",
+    "extensions": ["oa2"]
+  },
+  "application/vnd.fujitsu.oasys3": {
+    "source": "iana",
+    "extensions": ["oa3"]
+  },
+  "application/vnd.fujitsu.oasysgp": {
+    "source": "iana",
+    "extensions": ["fg5"]
+  },
+  "application/vnd.fujitsu.oasysprs": {
+    "source": "iana",
+    "extensions": ["bh2"]
+  },
+  "application/vnd.fujixerox.art-ex": {
+    "source": "iana"
+  },
+  "application/vnd.fujixerox.art4": {
+    "source": "iana"
+  },
+  "application/vnd.fujixerox.ddd": {
+    "source": "iana",
+    "extensions": ["ddd"]
+  },
+  "application/vnd.fujixerox.docuworks": {
+    "source": "iana",
+    "extensions": ["xdw"]
+  },
+  "application/vnd.fujixerox.docuworks.binder": {
+    "source": "iana",
+    "extensions": ["xbd"]
+  },
+  "application/vnd.fujixerox.docuworks.container": {
+    "source": "iana"
+  },
+  "application/vnd.fujixerox.hbpl": {
+    "source": "iana"
+  },
+  "application/vnd.fut-misnet": {
+    "source": "iana"
+  },
+  "application/vnd.futoin+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.futoin+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.fuzzysheet": {
+    "source": "iana",
+    "extensions": ["fzs"]
+  },
+  "application/vnd.genomatix.tuxedo": {
+    "source": "iana",
+    "extensions": ["txd"]
+  },
+  "application/vnd.gentics.grd+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.geo+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.geocube+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.geogebra.file": {
+    "source": "iana",
+    "extensions": ["ggb"]
+  },
+  "application/vnd.geogebra.slides": {
+    "source": "iana"
+  },
+  "application/vnd.geogebra.tool": {
+    "source": "iana",
+    "extensions": ["ggt"]
+  },
+  "application/vnd.geometry-explorer": {
+    "source": "iana",
+    "extensions": ["gex","gre"]
+  },
+  "application/vnd.geonext": {
+    "source": "iana",
+    "extensions": ["gxt"]
+  },
+  "application/vnd.geoplan": {
+    "source": "iana",
+    "extensions": ["g2w"]
+  },
+  "application/vnd.geospace": {
+    "source": "iana",
+    "extensions": ["g3w"]
+  },
+  "application/vnd.gerber": {
+    "source": "iana"
+  },
+  "application/vnd.globalplatform.card-content-mgt": {
+    "source": "iana"
+  },
+  "application/vnd.globalplatform.card-content-mgt-response": {
+    "source": "iana"
+  },
+  "application/vnd.gmx": {
+    "source": "iana",
+    "extensions": ["gmx"]
+  },
+  "application/vnd.google-apps.document": {
+    "compressible": false,
+    "extensions": ["gdoc"]
+  },
+  "application/vnd.google-apps.presentation": {
+    "compressible": false,
+    "extensions": ["gslides"]
+  },
+  "application/vnd.google-apps.spreadsheet": {
+    "compressible": false,
+    "extensions": ["gsheet"]
+  },
+  "application/vnd.google-earth.kml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["kml"]
+  },
+  "application/vnd.google-earth.kmz": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["kmz"]
+  },
+  "application/vnd.gov.sk.e-form+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.gov.sk.e-form+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.gov.sk.xmldatacontainer+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.grafeq": {
+    "source": "iana",
+    "extensions": ["gqf","gqs"]
+  },
+  "application/vnd.gridmp": {
+    "source": "iana"
+  },
+  "application/vnd.groove-account": {
+    "source": "iana",
+    "extensions": ["gac"]
+  },
+  "application/vnd.groove-help": {
+    "source": "iana",
+    "extensions": ["ghf"]
+  },
+  "application/vnd.groove-identity-message": {
+    "source": "iana",
+    "extensions": ["gim"]
+  },
+  "application/vnd.groove-injector": {
+    "source": "iana",
+    "extensions": ["grv"]
+  },
+  "application/vnd.groove-tool-message": {
+    "source": "iana",
+    "extensions": ["gtm"]
+  },
+  "application/vnd.groove-tool-template": {
+    "source": "iana",
+    "extensions": ["tpl"]
+  },
+  "application/vnd.groove-vcard": {
+    "source": "iana",
+    "extensions": ["vcg"]
+  },
+  "application/vnd.hal+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hal+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["hal"]
+  },
+  "application/vnd.handheld-entertainment+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["zmm"]
+  },
+  "application/vnd.hbci": {
+    "source": "iana",
+    "extensions": ["hbci"]
+  },
+  "application/vnd.hc+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hcl-bireports": {
+    "source": "iana"
+  },
+  "application/vnd.hdt": {
+    "source": "iana"
+  },
+  "application/vnd.heroku+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hhe.lesson-player": {
+    "source": "iana",
+    "extensions": ["les"]
+  },
+  "application/vnd.hl7cda+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.hl7v2+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.hp-hpgl": {
+    "source": "iana",
+    "extensions": ["hpgl"]
+  },
+  "application/vnd.hp-hpid": {
+    "source": "iana",
+    "extensions": ["hpid"]
+  },
+  "application/vnd.hp-hps": {
+    "source": "iana",
+    "extensions": ["hps"]
+  },
+  "application/vnd.hp-jlyt": {
+    "source": "iana",
+    "extensions": ["jlt"]
+  },
+  "application/vnd.hp-pcl": {
+    "source": "iana",
+    "extensions": ["pcl"]
+  },
+  "application/vnd.hp-pclxl": {
+    "source": "iana",
+    "extensions": ["pclxl"]
+  },
+  "application/vnd.httphone": {
+    "source": "iana"
+  },
+  "application/vnd.hydrostatix.sof-data": {
+    "source": "iana",
+    "extensions": ["sfd-hdstx"]
+  },
+  "application/vnd.hyper+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hyper-item+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hyperdrive+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hzn-3d-crossword": {
+    "source": "iana"
+  },
+  "application/vnd.ibm.afplinedata": {
+    "source": "iana"
+  },
+  "application/vnd.ibm.electronic-media": {
+    "source": "iana"
+  },
+  "application/vnd.ibm.minipay": {
+    "source": "iana",
+    "extensions": ["mpy"]
+  },
+  "application/vnd.ibm.modcap": {
+    "source": "iana",
+    "extensions": ["afp","listafp","list3820"]
+  },
+  "application/vnd.ibm.rights-management": {
+    "source": "iana",
+    "extensions": ["irm"]
+  },
+  "application/vnd.ibm.secure-container": {
+    "source": "iana",
+    "extensions": ["sc"]
+  },
+  "application/vnd.iccprofile": {
+    "source": "iana",
+    "extensions": ["icc","icm"]
+  },
+  "application/vnd.ieee.1905": {
+    "source": "iana"
+  },
+  "application/vnd.igloader": {
+    "source": "iana",
+    "extensions": ["igl"]
+  },
+  "application/vnd.imagemeter.folder+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.imagemeter.image+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.immervision-ivp": {
+    "source": "iana",
+    "extensions": ["ivp"]
+  },
+  "application/vnd.immervision-ivu": {
+    "source": "iana",
+    "extensions": ["ivu"]
+  },
+  "application/vnd.ims.imsccv1p1": {
+    "source": "iana"
+  },
+  "application/vnd.ims.imsccv1p2": {
+    "source": "iana"
+  },
+  "application/vnd.ims.imsccv1p3": {
+    "source": "iana"
+  },
+  "application/vnd.ims.lis.v2.result+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolconsumerprofile+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolproxy+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolproxy.id+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolsettings+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolsettings.simple+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.informedcontrol.rms+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.informix-visionary": {
+    "source": "iana"
+  },
+  "application/vnd.infotech.project": {
+    "source": "iana"
+  },
+  "application/vnd.infotech.project+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.innopath.wamp.notification": {
+    "source": "iana"
+  },
+  "application/vnd.insors.igm": {
+    "source": "iana",
+    "extensions": ["igm"]
+  },
+  "application/vnd.intercon.formnet": {
+    "source": "iana",
+    "extensions": ["xpw","xpx"]
+  },
+  "application/vnd.intergeo": {
+    "source": "iana",
+    "extensions": ["i2g"]
+  },
+  "application/vnd.intertrust.digibox": {
+    "source": "iana"
+  },
+  "application/vnd.intertrust.nncp": {
+    "source": "iana"
+  },
+  "application/vnd.intu.qbo": {
+    "source": "iana",
+    "extensions": ["qbo"]
+  },
+  "application/vnd.intu.qfx": {
+    "source": "iana",
+    "extensions": ["qfx"]
+  },
+  "application/vnd.iptc.g2.catalogitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.conceptitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.knowledgeitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.newsitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.newsmessage+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.packageitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.planningitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ipunplugged.rcprofile": {
+    "source": "iana",
+    "extensions": ["rcprofile"]
+  },
+  "application/vnd.irepository.package+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["irp"]
+  },
+  "application/vnd.is-xpr": {
+    "source": "iana",
+    "extensions": ["xpr"]
+  },
+  "application/vnd.isac.fcs": {
+    "source": "iana",
+    "extensions": ["fcs"]
+  },
+  "application/vnd.iso11783-10+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.jam": {
+    "source": "iana",
+    "extensions": ["jam"]
+  },
+  "application/vnd.japannet-directory-service": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-jpnstore-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-payment-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-registration": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-registration-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-setstore-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-verification": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-verification-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.jcp.javame.midlet-rms": {
+    "source": "iana",
+    "extensions": ["rms"]
+  },
+  "application/vnd.jisp": {
+    "source": "iana",
+    "extensions": ["jisp"]
+  },
+  "application/vnd.joost.joda-archive": {
+    "source": "iana",
+    "extensions": ["joda"]
+  },
+  "application/vnd.jsk.isdn-ngn": {
+    "source": "iana"
+  },
+  "application/vnd.kahootz": {
+    "source": "iana",
+    "extensions": ["ktz","ktr"]
+  },
+  "application/vnd.kde.karbon": {
+    "source": "iana",
+    "extensions": ["karbon"]
+  },
+  "application/vnd.kde.kchart": {
+    "source": "iana",
+    "extensions": ["chrt"]
+  },
+  "application/vnd.kde.kformula": {
+    "source": "iana",
+    "extensions": ["kfo"]
+  },
+  "application/vnd.kde.kivio": {
+    "source": "iana",
+    "extensions": ["flw"]
+  },
+  "application/vnd.kde.kontour": {
+    "source": "iana",
+    "extensions": ["kon"]
+  },
+  "application/vnd.kde.kpresenter": {
+    "source": "iana",
+    "extensions": ["kpr","kpt"]
+  },
+  "application/vnd.kde.kspread": {
+    "source": "iana",
+    "extensions": ["ksp"]
+  },
+  "application/vnd.kde.kword": {
+    "source": "iana",
+    "extensions": ["kwd","kwt"]
+  },
+  "application/vnd.kenameaapp": {
+    "source": "iana",
+    "extensions": ["htke"]
+  },
+  "application/vnd.kidspiration": {
+    "source": "iana",
+    "extensions": ["kia"]
+  },
+  "application/vnd.kinar": {
+    "source": "iana",
+    "extensions": ["kne","knp"]
+  },
+  "application/vnd.koan": {
+    "source": "iana",
+    "extensions": ["skp","skd","skt","skm"]
+  },
+  "application/vnd.kodak-descriptor": {
+    "source": "iana",
+    "extensions": ["sse"]
+  },
+  "application/vnd.las": {
+    "source": "iana"
+  },
+  "application/vnd.las.las+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.las.las+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lasxml"]
+  },
+  "application/vnd.laszip": {
+    "source": "iana"
+  },
+  "application/vnd.leap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.liberty-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.llamagraphics.life-balance.desktop": {
+    "source": "iana",
+    "extensions": ["lbd"]
+  },
+  "application/vnd.llamagraphics.life-balance.exchange+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lbe"]
+  },
+  "application/vnd.logipipe.circuit+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.loom": {
+    "source": "iana"
+  },
+  "application/vnd.lotus-1-2-3": {
+    "source": "iana",
+    "extensions": ["123"]
+  },
+  "application/vnd.lotus-approach": {
+    "source": "iana",
+    "extensions": ["apr"]
+  },
+  "application/vnd.lotus-freelance": {
+    "source": "iana",
+    "extensions": ["pre"]
+  },
+  "application/vnd.lotus-notes": {
+    "source": "iana",
+    "extensions": ["nsf"]
+  },
+  "application/vnd.lotus-organizer": {
+    "source": "iana",
+    "extensions": ["org"]
+  },
+  "application/vnd.lotus-screencam": {
+    "source": "iana",
+    "extensions": ["scm"]
+  },
+  "application/vnd.lotus-wordpro": {
+    "source": "iana",
+    "extensions": ["lwp"]
+  },
+  "application/vnd.macports.portpkg": {
+    "source": "iana",
+    "extensions": ["portpkg"]
+  },
+  "application/vnd.mapbox-vector-tile": {
+    "source": "iana",
+    "extensions": ["mvt"]
+  },
+  "application/vnd.marlin.drm.actiontoken+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.marlin.drm.conftoken+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.marlin.drm.license+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.marlin.drm.mdcf": {
+    "source": "iana"
+  },
+  "application/vnd.mason+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.maxar.archive.3tz+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.maxmind.maxmind-db": {
+    "source": "iana"
+  },
+  "application/vnd.mcd": {
+    "source": "iana",
+    "extensions": ["mcd"]
+  },
+  "application/vnd.medcalcdata": {
+    "source": "iana",
+    "extensions": ["mc1"]
+  },
+  "application/vnd.mediastation.cdkey": {
+    "source": "iana",
+    "extensions": ["cdkey"]
+  },
+  "application/vnd.meridian-slingshot": {
+    "source": "iana"
+  },
+  "application/vnd.mfer": {
+    "source": "iana",
+    "extensions": ["mwf"]
+  },
+  "application/vnd.mfmp": {
+    "source": "iana",
+    "extensions": ["mfm"]
+  },
+  "application/vnd.micro+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.micrografx.flo": {
+    "source": "iana",
+    "extensions": ["flo"]
+  },
+  "application/vnd.micrografx.igx": {
+    "source": "iana",
+    "extensions": ["igx"]
+  },
+  "application/vnd.microsoft.portable-executable": {
+    "source": "iana"
+  },
+  "application/vnd.microsoft.windows.thumbnail-cache": {
+    "source": "iana"
+  },
+  "application/vnd.miele+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.mif": {
+    "source": "iana",
+    "extensions": ["mif"]
+  },
+  "application/vnd.minisoft-hp3000-save": {
+    "source": "iana"
+  },
+  "application/vnd.mitsubishi.misty-guard.trustweb": {
+    "source": "iana"
+  },
+  "application/vnd.mobius.daf": {
+    "source": "iana",
+    "extensions": ["daf"]
+  },
+  "application/vnd.mobius.dis": {
+    "source": "iana",
+    "extensions": ["dis"]
+  },
+  "application/vnd.mobius.mbk": {
+    "source": "iana",
+    "extensions": ["mbk"]
+  },
+  "application/vnd.mobius.mqy": {
+    "source": "iana",
+    "extensions": ["mqy"]
+  },
+  "application/vnd.mobius.msl": {
+    "source": "iana",
+    "extensions": ["msl"]
+  },
+  "application/vnd.mobius.plc": {
+    "source": "iana",
+    "extensions": ["plc"]
+  },
+  "application/vnd.mobius.txf": {
+    "source": "iana",
+    "extensions": ["txf"]
+  },
+  "application/vnd.mophun.application": {
+    "source": "iana",
+    "extensions": ["mpn"]
+  },
+  "application/vnd.mophun.certificate": {
+    "source": "iana",
+    "extensions": ["mpc"]
+  },
+  "application/vnd.motorola.flexsuite": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.adsi": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.fis": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.gotap": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.kmr": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.ttc": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.wem": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.iprm": {
+    "source": "iana"
+  },
+  "application/vnd.mozilla.xul+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xul"]
+  },
+  "application/vnd.ms-3mfdocument": {
+    "source": "iana"
+  },
+  "application/vnd.ms-artgalry": {
+    "source": "iana",
+    "extensions": ["cil"]
+  },
+  "application/vnd.ms-asf": {
+    "source": "iana"
+  },
+  "application/vnd.ms-cab-compressed": {
+    "source": "iana",
+    "extensions": ["cab"]
+  },
+  "application/vnd.ms-color.iccprofile": {
+    "source": "apache"
+  },
+  "application/vnd.ms-excel": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["xls","xlm","xla","xlc","xlt","xlw"]
+  },
+  "application/vnd.ms-excel.addin.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xlam"]
+  },
+  "application/vnd.ms-excel.sheet.binary.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xlsb"]
+  },
+  "application/vnd.ms-excel.sheet.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xlsm"]
+  },
+  "application/vnd.ms-excel.template.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xltm"]
+  },
+  "application/vnd.ms-fontobject": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["eot"]
+  },
+  "application/vnd.ms-htmlhelp": {
+    "source": "iana",
+    "extensions": ["chm"]
+  },
+  "application/vnd.ms-ims": {
+    "source": "iana",
+    "extensions": ["ims"]
+  },
+  "application/vnd.ms-lrm": {
+    "source": "iana",
+    "extensions": ["lrm"]
+  },
+  "application/vnd.ms-office.activex+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-officetheme": {
+    "source": "iana",
+    "extensions": ["thmx"]
+  },
+  "application/vnd.ms-opentype": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.ms-outlook": {
+    "compressible": false,
+    "extensions": ["msg"]
+  },
+  "application/vnd.ms-package.obfuscated-opentype": {
+    "source": "apache"
+  },
+  "application/vnd.ms-pki.seccat": {
+    "source": "apache",
+    "extensions": ["cat"]
+  },
+  "application/vnd.ms-pki.stl": {
+    "source": "apache",
+    "extensions": ["stl"]
+  },
+  "application/vnd.ms-playready.initiator+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-powerpoint": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ppt","pps","pot"]
+  },
+  "application/vnd.ms-powerpoint.addin.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["ppam"]
+  },
+  "application/vnd.ms-powerpoint.presentation.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["pptm"]
+  },
+  "application/vnd.ms-powerpoint.slide.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["sldm"]
+  },
+  "application/vnd.ms-powerpoint.slideshow.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["ppsm"]
+  },
+  "application/vnd.ms-powerpoint.template.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["potm"]
+  },
+  "application/vnd.ms-printdevicecapabilities+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-printing.printticket+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.ms-printschematicket+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-project": {
+    "source": "iana",
+    "extensions": ["mpp","mpt"]
+  },
+  "application/vnd.ms-tnef": {
+    "source": "iana"
+  },
+  "application/vnd.ms-windows.devicepairing": {
+    "source": "iana"
+  },
+  "application/vnd.ms-windows.nwprinting.oob": {
+    "source": "iana"
+  },
+  "application/vnd.ms-windows.printerpairing": {
+    "source": "iana"
+  },
+  "application/vnd.ms-windows.wsd.oob": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.lic-chlg-req": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.lic-resp": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.meter-chlg-req": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.meter-resp": {
+    "source": "iana"
+  },
+  "application/vnd.ms-word.document.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["docm"]
+  },
+  "application/vnd.ms-word.template.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["dotm"]
+  },
+  "application/vnd.ms-works": {
+    "source": "iana",
+    "extensions": ["wps","wks","wcm","wdb"]
+  },
+  "application/vnd.ms-wpl": {
+    "source": "iana",
+    "extensions": ["wpl"]
+  },
+  "application/vnd.ms-xpsdocument": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["xps"]
+  },
+  "application/vnd.msa-disk-image": {
+    "source": "iana"
+  },
+  "application/vnd.mseq": {
+    "source": "iana",
+    "extensions": ["mseq"]
+  },
+  "application/vnd.msign": {
+    "source": "iana"
+  },
+  "application/vnd.multiad.creator": {
+    "source": "iana"
+  },
+  "application/vnd.multiad.creator.cif": {
+    "source": "iana"
+  },
+  "application/vnd.music-niff": {
+    "source": "iana"
+  },
+  "application/vnd.musician": {
+    "source": "iana",
+    "extensions": ["mus"]
+  },
+  "application/vnd.muvee.style": {
+    "source": "iana",
+    "extensions": ["msty"]
+  },
+  "application/vnd.mynfc": {
+    "source": "iana",
+    "extensions": ["taglet"]
+  },
+  "application/vnd.nacamar.ybrid+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ncd.control": {
+    "source": "iana"
+  },
+  "application/vnd.ncd.reference": {
+    "source": "iana"
+  },
+  "application/vnd.nearst.inv+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nebumind.line": {
+    "source": "iana"
+  },
+  "application/vnd.nervana": {
+    "source": "iana"
+  },
+  "application/vnd.netfpx": {
+    "source": "iana"
+  },
+  "application/vnd.neurolanguage.nlu": {
+    "source": "iana",
+    "extensions": ["nlu"]
+  },
+  "application/vnd.nimn": {
+    "source": "iana"
+  },
+  "application/vnd.nintendo.nitro.rom": {
+    "source": "iana"
+  },
+  "application/vnd.nintendo.snes.rom": {
+    "source": "iana"
+  },
+  "application/vnd.nitf": {
+    "source": "iana",
+    "extensions": ["ntf","nitf"]
+  },
+  "application/vnd.noblenet-directory": {
+    "source": "iana",
+    "extensions": ["nnd"]
+  },
+  "application/vnd.noblenet-sealer": {
+    "source": "iana",
+    "extensions": ["nns"]
+  },
+  "application/vnd.noblenet-web": {
+    "source": "iana",
+    "extensions": ["nnw"]
+  },
+  "application/vnd.nokia.catalogs": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.conml+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.conml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.iptv.config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.isds-radio-presets": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.landmark+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.landmark+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.landmarkcollection+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.n-gage.ac+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ac"]
+  },
+  "application/vnd.nokia.n-gage.data": {
+    "source": "iana",
+    "extensions": ["ngdat"]
+  },
+  "application/vnd.nokia.n-gage.symbian.install": {
+    "source": "iana",
+    "extensions": ["n-gage"]
+  },
+  "application/vnd.nokia.ncd": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.pcd+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.pcd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.radio-preset": {
+    "source": "iana",
+    "extensions": ["rpst"]
+  },
+  "application/vnd.nokia.radio-presets": {
+    "source": "iana",
+    "extensions": ["rpss"]
+  },
+  "application/vnd.novadigm.edm": {
+    "source": "iana",
+    "extensions": ["edm"]
+  },
+  "application/vnd.novadigm.edx": {
+    "source": "iana",
+    "extensions": ["edx"]
+  },
+  "application/vnd.novadigm.ext": {
+    "source": "iana",
+    "extensions": ["ext"]
+  },
+  "application/vnd.ntt-local.content-share": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.file-transfer": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.ogw_remote-access": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.sip-ta_remote": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.sip-ta_tcp_stream": {
+    "source": "iana"
+  },
+  "application/vnd.oasis.opendocument.chart": {
+    "source": "iana",
+    "extensions": ["odc"]
+  },
+  "application/vnd.oasis.opendocument.chart-template": {
+    "source": "iana",
+    "extensions": ["otc"]
+  },
+  "application/vnd.oasis.opendocument.database": {
+    "source": "iana",
+    "extensions": ["odb"]
+  },
+  "application/vnd.oasis.opendocument.formula": {
+    "source": "iana",
+    "extensions": ["odf"]
+  },
+  "application/vnd.oasis.opendocument.formula-template": {
+    "source": "iana",
+    "extensions": ["odft"]
+  },
+  "application/vnd.oasis.opendocument.graphics": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["odg"]
+  },
+  "application/vnd.oasis.opendocument.graphics-template": {
+    "source": "iana",
+    "extensions": ["otg"]
+  },
+  "application/vnd.oasis.opendocument.image": {
+    "source": "iana",
+    "extensions": ["odi"]
+  },
+  "application/vnd.oasis.opendocument.image-template": {
+    "source": "iana",
+    "extensions": ["oti"]
+  },
+  "application/vnd.oasis.opendocument.presentation": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["odp"]
+  },
+  "application/vnd.oasis.opendocument.presentation-template": {
+    "source": "iana",
+    "extensions": ["otp"]
+  },
+  "application/vnd.oasis.opendocument.spreadsheet": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ods"]
+  },
+  "application/vnd.oasis.opendocument.spreadsheet-template": {
+    "source": "iana",
+    "extensions": ["ots"]
+  },
+  "application/vnd.oasis.opendocument.text": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["odt"]
+  },
+  "application/vnd.oasis.opendocument.text-master": {
+    "source": "iana",
+    "extensions": ["odm"]
+  },
+  "application/vnd.oasis.opendocument.text-template": {
+    "source": "iana",
+    "extensions": ["ott"]
+  },
+  "application/vnd.oasis.opendocument.text-web": {
+    "source": "iana",
+    "extensions": ["oth"]
+  },
+  "application/vnd.obn": {
+    "source": "iana"
+  },
+  "application/vnd.ocf+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.oci.image.manifest.v1+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oftn.l10n+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.contentaccessdownload+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.contentaccessstreaming+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.cspg-hexbinary": {
+    "source": "iana"
+  },
+  "application/vnd.oipf.dae.svg+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.dae.xhtml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.mippvcontrolmessage+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.pae.gem": {
+    "source": "iana"
+  },
+  "application/vnd.oipf.spdiscovery+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.spdlist+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.ueprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.userprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.olpc-sugar": {
+    "source": "iana",
+    "extensions": ["xo"]
+  },
+  "application/vnd.oma-scws-config": {
+    "source": "iana"
+  },
+  "application/vnd.oma-scws-http-request": {
+    "source": "iana"
+  },
+  "application/vnd.oma-scws-http-response": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.associated-procedure-parameter+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.drm-trigger+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.imd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.ltkm": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.notification+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.provisioningtrigger": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.sgboot": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.sgdd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.sgdu": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.simple-symbol-container": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.smartcard-trigger+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.sprov+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.stkm": {
+    "source": "iana"
+  },
+  "application/vnd.oma.cab-address-book+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-feature-handler+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-pcc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-subs-invite+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-user-prefs+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.dcd": {
+    "source": "iana"
+  },
+  "application/vnd.oma.dcdc": {
+    "source": "iana"
+  },
+  "application/vnd.oma.dd2+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dd2"]
+  },
+  "application/vnd.oma.drm.risd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.group-usage-list+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.lwm2m+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.oma.lwm2m+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.lwm2m+tlv": {
+    "source": "iana"
+  },
+  "application/vnd.oma.pal+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.detailed-progress-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.final-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.groups+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.invocation-descriptor+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.optimized-progress-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.push": {
+    "source": "iana"
+  },
+  "application/vnd.oma.scidm.messages+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.xcap-directory+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.omads-email+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.omads-file+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.omads-folder+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.omaloc-supl-init": {
+    "source": "iana"
+  },
+  "application/vnd.onepager": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertamp": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertamx": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertat": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertatp": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertatx": {
+    "source": "iana"
+  },
+  "application/vnd.openblox.game+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["obgx"]
+  },
+  "application/vnd.openblox.game-binary": {
+    "source": "iana"
+  },
+  "application/vnd.openeye.oeb": {
+    "source": "iana"
+  },
+  "application/vnd.openofficeorg.extension": {
+    "source": "apache",
+    "extensions": ["oxt"]
+  },
+  "application/vnd.openstreetmap.data+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["osm"]
+  },
+  "application/vnd.opentimestamps.ots": {
+    "source": "iana"
+  },
+  "application/vnd.openxmlformats-officedocument.custom-properties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.customxmlproperties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawing+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.chart+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.chartshapes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramcolors+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramdata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramlayout+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramstyle+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.extended-properties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.commentauthors+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.comments+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.handoutmaster+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.notesmaster+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.notesslide+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.presentation": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["pptx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.presentation.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.presprops+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slide": {
+    "source": "iana",
+    "extensions": ["sldx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slide+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slidelayout+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slidemaster+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slideshow": {
+    "source": "iana",
+    "extensions": ["ppsx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slideshow.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slideupdateinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.tablestyles+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.tags+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.template": {
+    "source": "iana",
+    "extensions": ["potx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.template.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.viewprops+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.calcchain+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.chartsheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.comments+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.connections+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.dialogsheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.externallink+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.pivotcachedefinition+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.pivotcacherecords+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.pivottable+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.querytable+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.revisionheaders+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.revisionlog+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sharedstrings+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["xlsx"]
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sheetmetadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.table+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.tablesinglecells+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.template": {
+    "source": "iana",
+    "extensions": ["xltx"]
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.template.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.usernames+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.volatiledependencies+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.theme+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.themeoverride+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.vmldrawing": {
+    "source": "iana"
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.comments+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.document": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["docx"]
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.document.glossary+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.document.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.endnotes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.fonttable+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.footer+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.footnotes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.numbering+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.settings+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.styles+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.template": {
+    "source": "iana",
+    "extensions": ["dotx"]
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.template.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.websettings+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-package.core-properties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-package.digital-signature-xmlsignature+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-package.relationships+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oracle.resource+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.orange.indata": {
+    "source": "iana"
+  },
+  "application/vnd.osa.netdeploy": {
+    "source": "iana"
+  },
+  "application/vnd.osgeo.mapguide.package": {
+    "source": "iana",
+    "extensions": ["mgp"]
+  },
+  "application/vnd.osgi.bundle": {
+    "source": "iana"
+  },
+  "application/vnd.osgi.dp": {
+    "source": "iana",
+    "extensions": ["dp"]
+  },
+  "application/vnd.osgi.subsystem": {
+    "source": "iana",
+    "extensions": ["esa"]
+  },
+  "application/vnd.otps.ct-kip+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oxli.countgraph": {
+    "source": "iana"
+  },
+  "application/vnd.pagerduty+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.palm": {
+    "source": "iana",
+    "extensions": ["pdb","pqa","oprc"]
+  },
+  "application/vnd.panoply": {
+    "source": "iana"
+  },
+  "application/vnd.paos.xml": {
+    "source": "iana"
+  },
+  "application/vnd.patentdive": {
+    "source": "iana"
+  },
+  "application/vnd.patientecommsdoc": {
+    "source": "iana"
+  },
+  "application/vnd.pawaafile": {
+    "source": "iana",
+    "extensions": ["paw"]
+  },
+  "application/vnd.pcos": {
+    "source": "iana"
+  },
+  "application/vnd.pg.format": {
+    "source": "iana",
+    "extensions": ["str"]
+  },
+  "application/vnd.pg.osasli": {
+    "source": "iana",
+    "extensions": ["ei6"]
+  },
+  "application/vnd.piaccess.application-licence": {
+    "source": "iana"
+  },
+  "application/vnd.picsel": {
+    "source": "iana",
+    "extensions": ["efif"]
+  },
+  "application/vnd.pmi.widget": {
+    "source": "iana",
+    "extensions": ["wg"]
+  },
+  "application/vnd.poc.group-advertisement+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.pocketlearn": {
+    "source": "iana",
+    "extensions": ["plf"]
+  },
+  "application/vnd.powerbuilder6": {
+    "source": "iana",
+    "extensions": ["pbd"]
+  },
+  "application/vnd.powerbuilder6-s": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder7": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder7-s": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder75": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder75-s": {
+    "source": "iana"
+  },
+  "application/vnd.preminet": {
+    "source": "iana"
+  },
+  "application/vnd.previewsystems.box": {
+    "source": "iana",
+    "extensions": ["box"]
+  },
+  "application/vnd.proteus.magazine": {
+    "source": "iana",
+    "extensions": ["mgz"]
+  },
+  "application/vnd.psfs": {
+    "source": "iana"
+  },
+  "application/vnd.publishare-delta-tree": {
+    "source": "iana",
+    "extensions": ["qps"]
+  },
+  "application/vnd.pvi.ptid1": {
+    "source": "iana",
+    "extensions": ["ptid"]
+  },
+  "application/vnd.pwg-multiplexed": {
+    "source": "iana"
+  },
+  "application/vnd.pwg-xhtml-print+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.qualcomm.brew-app-res": {
+    "source": "iana"
+  },
+  "application/vnd.quarantainenet": {
+    "source": "iana"
+  },
+  "application/vnd.quark.quarkxpress": {
+    "source": "iana",
+    "extensions": ["qxd","qxt","qwd","qwt","qxl","qxb"]
+  },
+  "application/vnd.quobject-quoxdocument": {
+    "source": "iana"
+  },
+  "application/vnd.radisys.moml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-conf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-conn+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-dialog+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-stream+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-conf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-base+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-fax-detect+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-fax-sendrecv+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-group+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-speech+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-transform+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.rainstor.data": {
+    "source": "iana"
+  },
+  "application/vnd.rapid": {
+    "source": "iana"
+  },
+  "application/vnd.rar": {
+    "source": "iana",
+    "extensions": ["rar"]
+  },
+  "application/vnd.realvnc.bed": {
+    "source": "iana",
+    "extensions": ["bed"]
+  },
+  "application/vnd.recordare.musicxml": {
+    "source": "iana",
+    "extensions": ["mxl"]
+  },
+  "application/vnd.recordare.musicxml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["musicxml"]
+  },
+  "application/vnd.renlearn.rlprint": {
+    "source": "iana"
+  },
+  "application/vnd.resilient.logic": {
+    "source": "iana"
+  },
+  "application/vnd.restful+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.rig.cryptonote": {
+    "source": "iana",
+    "extensions": ["cryptonote"]
+  },
+  "application/vnd.rim.cod": {
+    "source": "apache",
+    "extensions": ["cod"]
+  },
+  "application/vnd.rn-realmedia": {
+    "source": "apache",
+    "extensions": ["rm"]
+  },
+  "application/vnd.rn-realmedia-vbr": {
+    "source": "apache",
+    "extensions": ["rmvb"]
+  },
+  "application/vnd.route66.link66+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["link66"]
+  },
+  "application/vnd.rs-274x": {
+    "source": "iana"
+  },
+  "application/vnd.ruckus.download": {
+    "source": "iana"
+  },
+  "application/vnd.s3sms": {
+    "source": "iana"
+  },
+  "application/vnd.sailingtracker.track": {
+    "source": "iana",
+    "extensions": ["st"]
+  },
+  "application/vnd.sar": {
+    "source": "iana"
+  },
+  "application/vnd.sbm.cid": {
+    "source": "iana"
+  },
+  "application/vnd.sbm.mid2": {
+    "source": "iana"
+  },
+  "application/vnd.scribus": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.3df": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.csf": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.doc": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.eml": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.mht": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.net": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.ppt": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.tiff": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.xls": {
+    "source": "iana"
+  },
+  "application/vnd.sealedmedia.softseal.html": {
+    "source": "iana"
+  },
+  "application/vnd.sealedmedia.softseal.pdf": {
+    "source": "iana"
+  },
+  "application/vnd.seemail": {
+    "source": "iana",
+    "extensions": ["see"]
+  },
+  "application/vnd.seis+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.sema": {
+    "source": "iana",
+    "extensions": ["sema"]
+  },
+  "application/vnd.semd": {
+    "source": "iana",
+    "extensions": ["semd"]
+  },
+  "application/vnd.semf": {
+    "source": "iana",
+    "extensions": ["semf"]
+  },
+  "application/vnd.shade-save-file": {
+    "source": "iana"
+  },
+  "application/vnd.shana.informed.formdata": {
+    "source": "iana",
+    "extensions": ["ifm"]
+  },
+  "application/vnd.shana.informed.formtemplate": {
+    "source": "iana",
+    "extensions": ["itp"]
+  },
+  "application/vnd.shana.informed.interchange": {
+    "source": "iana",
+    "extensions": ["iif"]
+  },
+  "application/vnd.shana.informed.package": {
+    "source": "iana",
+    "extensions": ["ipk"]
+  },
+  "application/vnd.shootproof+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.shopkick+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.shp": {
+    "source": "iana"
+  },
+  "application/vnd.shx": {
+    "source": "iana"
+  },
+  "application/vnd.sigrok.session": {
+    "source": "iana"
+  },
+  "application/vnd.simtech-mindmapper": {
+    "source": "iana",
+    "extensions": ["twd","twds"]
+  },
+  "application/vnd.siren+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.smaf": {
+    "source": "iana",
+    "extensions": ["mmf"]
+  },
+  "application/vnd.smart.notebook": {
+    "source": "iana"
+  },
+  "application/vnd.smart.teacher": {
+    "source": "iana",
+    "extensions": ["teacher"]
+  },
+  "application/vnd.snesdev-page-table": {
+    "source": "iana"
+  },
+  "application/vnd.software602.filler.form+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["fo"]
+  },
+  "application/vnd.software602.filler.form-xml-zip": {
+    "source": "iana"
+  },
+  "application/vnd.solent.sdkm+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sdkm","sdkd"]
+  },
+  "application/vnd.spotfire.dxp": {
+    "source": "iana",
+    "extensions": ["dxp"]
+  },
+  "application/vnd.spotfire.sfs": {
+    "source": "iana",
+    "extensions": ["sfs"]
+  },
+  "application/vnd.sqlite3": {
+    "source": "iana"
+  },
+  "application/vnd.sss-cod": {
+    "source": "iana"
+  },
+  "application/vnd.sss-dtf": {
+    "source": "iana"
+  },
+  "application/vnd.sss-ntf": {
+    "source": "iana"
+  },
+  "application/vnd.stardivision.calc": {
+    "source": "apache",
+    "extensions": ["sdc"]
+  },
+  "application/vnd.stardivision.draw": {
+    "source": "apache",
+    "extensions": ["sda"]
+  },
+  "application/vnd.stardivision.impress": {
+    "source": "apache",
+    "extensions": ["sdd"]
+  },
+  "application/vnd.stardivision.math": {
+    "source": "apache",
+    "extensions": ["smf"]
+  },
+  "application/vnd.stardivision.writer": {
+    "source": "apache",
+    "extensions": ["sdw","vor"]
+  },
+  "application/vnd.stardivision.writer-global": {
+    "source": "apache",
+    "extensions": ["sgl"]
+  },
+  "application/vnd.stepmania.package": {
+    "source": "iana",
+    "extensions": ["smzip"]
+  },
+  "application/vnd.stepmania.stepchart": {
+    "source": "iana",
+    "extensions": ["sm"]
+  },
+  "application/vnd.street-stream": {
+    "source": "iana"
+  },
+  "application/vnd.sun.wadl+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wadl"]
+  },
+  "application/vnd.sun.xml.calc": {
+    "source": "apache",
+    "extensions": ["sxc"]
+  },
+  "application/vnd.sun.xml.calc.template": {
+    "source": "apache",
+    "extensions": ["stc"]
+  },
+  "application/vnd.sun.xml.draw": {
+    "source": "apache",
+    "extensions": ["sxd"]
+  },
+  "application/vnd.sun.xml.draw.template": {
+    "source": "apache",
+    "extensions": ["std"]
+  },
+  "application/vnd.sun.xml.impress": {
+    "source": "apache",
+    "extensions": ["sxi"]
+  },
+  "application/vnd.sun.xml.impress.template": {
+    "source": "apache",
+    "extensions": ["sti"]
+  },
+  "application/vnd.sun.xml.math": {
+    "source": "apache",
+    "extensions": ["sxm"]
+  },
+  "application/vnd.sun.xml.writer": {
+    "source": "apache",
+    "extensions": ["sxw"]
+  },
+  "application/vnd.sun.xml.writer.global": {
+    "source": "apache",
+    "extensions": ["sxg"]
+  },
+  "application/vnd.sun.xml.writer.template": {
+    "source": "apache",
+    "extensions": ["stw"]
+  },
+  "application/vnd.sus-calendar": {
+    "source": "iana",
+    "extensions": ["sus","susp"]
+  },
+  "application/vnd.svd": {
+    "source": "iana",
+    "extensions": ["svd"]
+  },
+  "application/vnd.swiftview-ics": {
+    "source": "iana"
+  },
+  "application/vnd.sycle+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.syft+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.symbian.install": {
+    "source": "apache",
+    "extensions": ["sis","sisx"]
+  },
+  "application/vnd.syncml+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["xsm"]
+  },
+  "application/vnd.syncml.dm+wbxml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["bdm"]
+  },
+  "application/vnd.syncml.dm+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["xdm"]
+  },
+  "application/vnd.syncml.dm.notification": {
+    "source": "iana"
+  },
+  "application/vnd.syncml.dmddf+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.syncml.dmddf+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["ddf"]
+  },
+  "application/vnd.syncml.dmtnds+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.syncml.dmtnds+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.syncml.ds.notification": {
+    "source": "iana"
+  },
+  "application/vnd.tableschema+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.tao.intent-module-archive": {
+    "source": "iana",
+    "extensions": ["tao"]
+  },
+  "application/vnd.tcpdump.pcap": {
+    "source": "iana",
+    "extensions": ["pcap","cap","dmp"]
+  },
+  "application/vnd.think-cell.ppttc+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.tmd.mediaflex.api+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.tml": {
+    "source": "iana"
+  },
+  "application/vnd.tmobile-livetv": {
+    "source": "iana",
+    "extensions": ["tmo"]
+  },
+  "application/vnd.tri.onesource": {
+    "source": "iana"
+  },
+  "application/vnd.trid.tpt": {
+    "source": "iana",
+    "extensions": ["tpt"]
+  },
+  "application/vnd.triscape.mxs": {
+    "source": "iana",
+    "extensions": ["mxs"]
+  },
+  "application/vnd.trueapp": {
+    "source": "iana",
+    "extensions": ["tra"]
+  },
+  "application/vnd.truedoc": {
+    "source": "iana"
+  },
+  "application/vnd.ubisoft.webplayer": {
+    "source": "iana"
+  },
+  "application/vnd.ufdl": {
+    "source": "iana",
+    "extensions": ["ufd","ufdl"]
+  },
+  "application/vnd.uiq.theme": {
+    "source": "iana",
+    "extensions": ["utz"]
+  },
+  "application/vnd.umajin": {
+    "source": "iana",
+    "extensions": ["umj"]
+  },
+  "application/vnd.unity": {
+    "source": "iana",
+    "extensions": ["unityweb"]
+  },
+  "application/vnd.uoml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["uoml"]
+  },
+  "application/vnd.uplanet.alert": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.alert-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.bearer-choice": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.bearer-choice-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.cacheop": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.cacheop-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.channel": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.channel-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.list": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.list-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.listcmd": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.listcmd-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.signal": {
+    "source": "iana"
+  },
+  "application/vnd.uri-map": {
+    "source": "iana"
+  },
+  "application/vnd.valve.source.material": {
+    "source": "iana"
+  },
+  "application/vnd.vcx": {
+    "source": "iana",
+    "extensions": ["vcx"]
+  },
+  "application/vnd.vd-study": {
+    "source": "iana"
+  },
+  "application/vnd.vectorworks": {
+    "source": "iana"
+  },
+  "application/vnd.vel+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.verimatrix.vcas": {
+    "source": "iana"
+  },
+  "application/vnd.veritone.aion+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.veryant.thin": {
+    "source": "iana"
+  },
+  "application/vnd.ves.encrypted": {
+    "source": "iana"
+  },
+  "application/vnd.vidsoft.vidconference": {
+    "source": "iana"
+  },
+  "application/vnd.visio": {
+    "source": "iana",
+    "extensions": ["vsd","vst","vss","vsw"]
+  },
+  "application/vnd.visionary": {
+    "source": "iana",
+    "extensions": ["vis"]
+  },
+  "application/vnd.vividence.scriptfile": {
+    "source": "iana"
+  },
+  "application/vnd.vsf": {
+    "source": "iana",
+    "extensions": ["vsf"]
+  },
+  "application/vnd.wap.sic": {
+    "source": "iana"
+  },
+  "application/vnd.wap.slc": {
+    "source": "iana"
+  },
+  "application/vnd.wap.wbxml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["wbxml"]
+  },
+  "application/vnd.wap.wmlc": {
+    "source": "iana",
+    "extensions": ["wmlc"]
+  },
+  "application/vnd.wap.wmlscriptc": {
+    "source": "iana",
+    "extensions": ["wmlsc"]
+  },
+  "application/vnd.webturbo": {
+    "source": "iana",
+    "extensions": ["wtb"]
+  },
+  "application/vnd.wfa.dpp": {
+    "source": "iana"
+  },
+  "application/vnd.wfa.p2p": {
+    "source": "iana"
+  },
+  "application/vnd.wfa.wsc": {
+    "source": "iana"
+  },
+  "application/vnd.windows.devicepairing": {
+    "source": "iana"
+  },
+  "application/vnd.wmc": {
+    "source": "iana"
+  },
+  "application/vnd.wmf.bootstrap": {
+    "source": "iana"
+  },
+  "application/vnd.wolfram.mathematica": {
+    "source": "iana"
+  },
+  "application/vnd.wolfram.mathematica.package": {
+    "source": "iana"
+  },
+  "application/vnd.wolfram.player": {
+    "source": "iana",
+    "extensions": ["nbp"]
+  },
+  "application/vnd.wordperfect": {
+    "source": "iana",
+    "extensions": ["wpd"]
+  },
+  "application/vnd.wqd": {
+    "source": "iana",
+    "extensions": ["wqd"]
+  },
+  "application/vnd.wrq-hp3000-labelled": {
+    "source": "iana"
+  },
+  "application/vnd.wt.stf": {
+    "source": "iana",
+    "extensions": ["stf"]
+  },
+  "application/vnd.wv.csp+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.wv.csp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.wv.ssp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.xacml+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.xara": {
+    "source": "iana",
+    "extensions": ["xar"]
+  },
+  "application/vnd.xfdl": {
+    "source": "iana",
+    "extensions": ["xfdl"]
+  },
+  "application/vnd.xfdl.webform": {
+    "source": "iana"
+  },
+  "application/vnd.xmi+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.xmpie.cpkg": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.dpkg": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.plan": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.ppkg": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.xlim": {
+    "source": "iana"
+  },
+  "application/vnd.yamaha.hv-dic": {
+    "source": "iana",
+    "extensions": ["hvd"]
+  },
+  "application/vnd.yamaha.hv-script": {
+    "source": "iana",
+    "extensions": ["hvs"]
+  },
+  "application/vnd.yamaha.hv-voice": {
+    "source": "iana",
+    "extensions": ["hvp"]
+  },
+  "application/vnd.yamaha.openscoreformat": {
+    "source": "iana",
+    "extensions": ["osf"]
+  },
+  "application/vnd.yamaha.openscoreformat.osfpvg+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["osfpvg"]
+  },
+  "application/vnd.yamaha.remote-setup": {
+    "source": "iana"
+  },
+  "application/vnd.yamaha.smaf-audio": {
+    "source": "iana",
+    "extensions": ["saf"]
+  },
+  "application/vnd.yamaha.smaf-phrase": {
+    "source": "iana",
+    "extensions": ["spf"]
+  },
+  "application/vnd.yamaha.through-ngn": {
+    "source": "iana"
+  },
+  "application/vnd.yamaha.tunnel-udpencap": {
+    "source": "iana"
+  },
+  "application/vnd.yaoweme": {
+    "source": "iana"
+  },
+  "application/vnd.yellowriver-custom-menu": {
+    "source": "iana",
+    "extensions": ["cmp"]
+  },
+  "application/vnd.youtube.yt": {
+    "source": "iana"
+  },
+  "application/vnd.zul": {
+    "source": "iana",
+    "extensions": ["zir","zirz"]
+  },
+  "application/vnd.zzazz.deck+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["zaz"]
+  },
+  "application/voicexml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["vxml"]
+  },
+  "application/voucher-cms+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vq-rtcpxr": {
+    "source": "iana"
+  },
+  "application/wasm": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wasm"]
+  },
+  "application/watcherinfo+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wif"]
+  },
+  "application/webpush-options+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/whoispp-query": {
+    "source": "iana"
+  },
+  "application/whoispp-response": {
+    "source": "iana"
+  },
+  "application/widget": {
+    "source": "iana",
+    "extensions": ["wgt"]
+  },
+  "application/winhlp": {
+    "source": "apache",
+    "extensions": ["hlp"]
+  },
+  "application/wita": {
+    "source": "iana"
+  },
+  "application/wordperfect5.1": {
+    "source": "iana"
+  },
+  "application/wsdl+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wsdl"]
+  },
+  "application/wspolicy+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wspolicy"]
+  },
+  "application/x-7z-compressed": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["7z"]
+  },
+  "application/x-abiword": {
+    "source": "apache",
+    "extensions": ["abw"]
+  },
+  "application/x-ace-compressed": {
+    "source": "apache",
+    "extensions": ["ace"]
+  },
+  "application/x-amf": {
+    "source": "apache"
+  },
+  "application/x-apple-diskimage": {
+    "source": "apache",
+    "extensions": ["dmg"]
+  },
+  "application/x-arj": {
+    "compressible": false,
+    "extensions": ["arj"]
+  },
+  "application/x-authorware-bin": {
+    "source": "apache",
+    "extensions": ["aab","x32","u32","vox"]
+  },
+  "application/x-authorware-map": {
+    "source": "apache",
+    "extensions": ["aam"]
+  },
+  "application/x-authorware-seg": {
+    "source": "apache",
+    "extensions": ["aas"]
+  },
+  "application/x-bcpio": {
+    "source": "apache",
+    "extensions": ["bcpio"]
+  },
+  "application/x-bdoc": {
+    "compressible": false,
+    "extensions": ["bdoc"]
+  },
+  "application/x-bittorrent": {
+    "source": "apache",
+    "extensions": ["torrent"]
+  },
+  "application/x-blorb": {
+    "source": "apache",
+    "extensions": ["blb","blorb"]
+  },
+  "application/x-bzip": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["bz"]
+  },
+  "application/x-bzip2": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["bz2","boz"]
+  },
+  "application/x-cbr": {
+    "source": "apache",
+    "extensions": ["cbr","cba","cbt","cbz","cb7"]
+  },
+  "application/x-cdlink": {
+    "source": "apache",
+    "extensions": ["vcd"]
+  },
+  "application/x-cfs-compressed": {
+    "source": "apache",
+    "extensions": ["cfs"]
+  },
+  "application/x-chat": {
+    "source": "apache",
+    "extensions": ["chat"]
+  },
+  "application/x-chess-pgn": {
+    "source": "apache",
+    "extensions": ["pgn"]
+  },
+  "application/x-chrome-extension": {
+    "extensions": ["crx"]
+  },
+  "application/x-cocoa": {
+    "source": "nginx",
+    "extensions": ["cco"]
+  },
+  "application/x-compress": {
+    "source": "apache"
+  },
+  "application/x-conference": {
+    "source": "apache",
+    "extensions": ["nsc"]
+  },
+  "application/x-cpio": {
+    "source": "apache",
+    "extensions": ["cpio"]
+  },
+  "application/x-csh": {
+    "source": "apache",
+    "extensions": ["csh"]
+  },
+  "application/x-deb": {
+    "compressible": false
+  },
+  "application/x-debian-package": {
+    "source": "apache",
+    "extensions": ["deb","udeb"]
+  },
+  "application/x-dgc-compressed": {
+    "source": "apache",
+    "extensions": ["dgc"]
+  },
+  "application/x-director": {
+    "source": "apache",
+    "extensions": ["dir","dcr","dxr","cst","cct","cxt","w3d","fgd","swa"]
+  },
+  "application/x-doom": {
+    "source": "apache",
+    "extensions": ["wad"]
+  },
+  "application/x-dtbncx+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["ncx"]
+  },
+  "application/x-dtbook+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["dtb"]
+  },
+  "application/x-dtbresource+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["res"]
+  },
+  "application/x-dvi": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["dvi"]
+  },
+  "application/x-envoy": {
+    "source": "apache",
+    "extensions": ["evy"]
+  },
+  "application/x-eva": {
+    "source": "apache",
+    "extensions": ["eva"]
+  },
+  "application/x-font-bdf": {
+    "source": "apache",
+    "extensions": ["bdf"]
+  },
+  "application/x-font-dos": {
+    "source": "apache"
+  },
+  "application/x-font-framemaker": {
+    "source": "apache"
+  },
+  "application/x-font-ghostscript": {
+    "source": "apache",
+    "extensions": ["gsf"]
+  },
+  "application/x-font-libgrx": {
+    "source": "apache"
+  },
+  "application/x-font-linux-psf": {
+    "source": "apache",
+    "extensions": ["psf"]
+  },
+  "application/x-font-pcf": {
+    "source": "apache",
+    "extensions": ["pcf"]
+  },
+  "application/x-font-snf": {
+    "source": "apache",
+    "extensions": ["snf"]
+  },
+  "application/x-font-speedo": {
+    "source": "apache"
+  },
+  "application/x-font-sunos-news": {
+    "source": "apache"
+  },
+  "application/x-font-type1": {
+    "source": "apache",
+    "extensions": ["pfa","pfb","pfm","afm"]
+  },
+  "application/x-font-vfont": {
+    "source": "apache"
+  },
+  "application/x-freearc": {
+    "source": "apache",
+    "extensions": ["arc"]
+  },
+  "application/x-futuresplash": {
+    "source": "apache",
+    "extensions": ["spl"]
+  },
+  "application/x-gca-compressed": {
+    "source": "apache",
+    "extensions": ["gca"]
+  },
+  "application/x-glulx": {
+    "source": "apache",
+    "extensions": ["ulx"]
+  },
+  "application/x-gnumeric": {
+    "source": "apache",
+    "extensions": ["gnumeric"]
+  },
+  "application/x-gramps-xml": {
+    "source": "apache",
+    "extensions": ["gramps"]
+  },
+  "application/x-gtar": {
+    "source": "apache",
+    "extensions": ["gtar"]
+  },
+  "application/x-gzip": {
+    "source": "apache"
+  },
+  "application/x-hdf": {
+    "source": "apache",
+    "extensions": ["hdf"]
+  },
+  "application/x-httpd-php": {
+    "compressible": true,
+    "extensions": ["php"]
+  },
+  "application/x-install-instructions": {
+    "source": "apache",
+    "extensions": ["install"]
+  },
+  "application/x-iso9660-image": {
+    "source": "apache",
+    "extensions": ["iso"]
+  },
+  "application/x-iwork-keynote-sffkey": {
+    "extensions": ["key"]
+  },
+  "application/x-iwork-numbers-sffnumbers": {
+    "extensions": ["numbers"]
+  },
+  "application/x-iwork-pages-sffpages": {
+    "extensions": ["pages"]
+  },
+  "application/x-java-archive-diff": {
+    "source": "nginx",
+    "extensions": ["jardiff"]
+  },
+  "application/x-java-jnlp-file": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["jnlp"]
+  },
+  "application/x-javascript": {
+    "compressible": true
+  },
+  "application/x-keepass2": {
+    "extensions": ["kdbx"]
+  },
+  "application/x-latex": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["latex"]
+  },
+  "application/x-lua-bytecode": {
+    "extensions": ["luac"]
+  },
+  "application/x-lzh-compressed": {
+    "source": "apache",
+    "extensions": ["lzh","lha"]
+  },
+  "application/x-makeself": {
+    "source": "nginx",
+    "extensions": ["run"]
+  },
+  "application/x-mie": {
+    "source": "apache",
+    "extensions": ["mie"]
+  },
+  "application/x-mobipocket-ebook": {
+    "source": "apache",
+    "extensions": ["prc","mobi"]
+  },
+  "application/x-mpegurl": {
+    "compressible": false
+  },
+  "application/x-ms-application": {
+    "source": "apache",
+    "extensions": ["application"]
+  },
+  "application/x-ms-shortcut": {
+    "source": "apache",
+    "extensions": ["lnk"]
+  },
+  "application/x-ms-wmd": {
+    "source": "apache",
+    "extensions": ["wmd"]
+  },
+  "application/x-ms-wmz": {
+    "source": "apache",
+    "extensions": ["wmz"]
+  },
+  "application/x-ms-xbap": {
+    "source": "apache",
+    "extensions": ["xbap"]
+  },
+  "application/x-msaccess": {
+    "source": "apache",
+    "extensions": ["mdb"]
+  },
+  "application/x-msbinder": {
+    "source": "apache",
+    "extensions": ["obd"]
+  },
+  "application/x-mscardfile": {
+    "source": "apache",
+    "extensions": ["crd"]
+  },
+  "application/x-msclip": {
+    "source": "apache",
+    "extensions": ["clp"]
+  },
+  "application/x-msdos-program": {
+    "extensions": ["exe"]
+  },
+  "application/x-msdownload": {
+    "source": "apache",
+    "extensions": ["exe","dll","com","bat","msi"]
+  },
+  "application/x-msmediaview": {
+    "source": "apache",
+    "extensions": ["mvb","m13","m14"]
+  },
+  "application/x-msmetafile": {
+    "source": "apache",
+    "extensions": ["wmf","wmz","emf","emz"]
+  },
+  "application/x-msmoney": {
+    "source": "apache",
+    "extensions": ["mny"]
+  },
+  "application/x-mspublisher": {
+    "source": "apache",
+    "extensions": ["pub"]
+  },
+  "application/x-msschedule": {
+    "source": "apache",
+    "extensions": ["scd"]
+  },
+  "application/x-msterminal": {
+    "source": "apache",
+    "extensions": ["trm"]
+  },
+  "application/x-mswrite": {
+    "source": "apache",
+    "extensions": ["wri"]
+  },
+  "application/x-netcdf": {
+    "source": "apache",
+    "extensions": ["nc","cdf"]
+  },
+  "application/x-ns-proxy-autoconfig": {
+    "compressible": true,
+    "extensions": ["pac"]
+  },
+  "application/x-nzb": {
+    "source": "apache",
+    "extensions": ["nzb"]
+  },
+  "application/x-perl": {
+    "source": "nginx",
+    "extensions": ["pl","pm"]
+  },
+  "application/x-pilot": {
+    "source": "nginx",
+    "extensions": ["prc","pdb"]
+  },
+  "application/x-pkcs12": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["p12","pfx"]
+  },
+  "application/x-pkcs7-certificates": {
+    "source": "apache",
+    "extensions": ["p7b","spc"]
+  },
+  "application/x-pkcs7-certreqresp": {
+    "source": "apache",
+    "extensions": ["p7r"]
+  },
+  "application/x-pki-message": {
+    "source": "iana"
+  },
+  "application/x-rar-compressed": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["rar"]
+  },
+  "application/x-redhat-package-manager": {
+    "source": "nginx",
+    "extensions": ["rpm"]
+  },
+  "application/x-research-info-systems": {
+    "source": "apache",
+    "extensions": ["ris"]
+  },
+  "application/x-sea": {
+    "source": "nginx",
+    "extensions": ["sea"]
+  },
+  "application/x-sh": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["sh"]
+  },
+  "application/x-shar": {
+    "source": "apache",
+    "extensions": ["shar"]
+  },
+  "application/x-shockwave-flash": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["swf"]
+  },
+  "application/x-silverlight-app": {
+    "source": "apache",
+    "extensions": ["xap"]
+  },
+  "application/x-sql": {
+    "source": "apache",
+    "extensions": ["sql"]
+  },
+  "application/x-stuffit": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["sit"]
+  },
+  "application/x-stuffitx": {
+    "source": "apache",
+    "extensions": ["sitx"]
+  },
+  "application/x-subrip": {
+    "source": "apache",
+    "extensions": ["srt"]
+  },
+  "application/x-sv4cpio": {
+    "source": "apache",
+    "extensions": ["sv4cpio"]
+  },
+  "application/x-sv4crc": {
+    "source": "apache",
+    "extensions": ["sv4crc"]
+  },
+  "application/x-t3vm-image": {
+    "source": "apache",
+    "extensions": ["t3"]
+  },
+  "application/x-tads": {
+    "source": "apache",
+    "extensions": ["gam"]
+  },
+  "application/x-tar": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["tar"]
+  },
+  "application/x-tcl": {
+    "source": "apache",
+    "extensions": ["tcl","tk"]
+  },
+  "application/x-tex": {
+    "source": "apache",
+    "extensions": ["tex"]
+  },
+  "application/x-tex-tfm": {
+    "source": "apache",
+    "extensions": ["tfm"]
+  },
+  "application/x-texinfo": {
+    "source": "apache",
+    "extensions": ["texinfo","texi"]
+  },
+  "application/x-tgif": {
+    "source": "apache",
+    "extensions": ["obj"]
+  },
+  "application/x-ustar": {
+    "source": "apache",
+    "extensions": ["ustar"]
+  },
+  "application/x-virtualbox-hdd": {
+    "compressible": true,
+    "extensions": ["hdd"]
+  },
+  "application/x-virtualbox-ova": {
+    "compressible": true,
+    "extensions": ["ova"]
+  },
+  "application/x-virtualbox-ovf": {
+    "compressible": true,
+    "extensions": ["ovf"]
+  },
+  "application/x-virtualbox-vbox": {
+    "compressible": true,
+    "extensions": ["vbox"]
+  },
+  "application/x-virtualbox-vbox-extpack": {
+    "compressible": false,
+    "extensions": ["vbox-extpack"]
+  },
+  "application/x-virtualbox-vdi": {
+    "compressible": true,
+    "extensions": ["vdi"]
+  },
+  "application/x-virtualbox-vhd": {
+    "compressible": true,
+    "extensions": ["vhd"]
+  },
+  "application/x-virtualbox-vmdk": {
+    "compressible": true,
+    "extensions": ["vmdk"]
+  },
+  "application/x-wais-source": {
+    "source": "apache",
+    "extensions": ["src"]
+  },
+  "application/x-web-app-manifest+json": {
+    "compressible": true,
+    "extensions": ["webapp"]
+  },
+  "application/x-www-form-urlencoded": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/x-x509-ca-cert": {
+    "source": "iana",
+    "extensions": ["der","crt","pem"]
+  },
+  "application/x-x509-ca-ra-cert": {
+    "source": "iana"
+  },
+  "application/x-x509-next-ca-cert": {
+    "source": "iana"
+  },
+  "application/x-xfig": {
+    "source": "apache",
+    "extensions": ["fig"]
+  },
+  "application/x-xliff+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xlf"]
+  },
+  "application/x-xpinstall": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["xpi"]
+  },
+  "application/x-xz": {
+    "source": "apache",
+    "extensions": ["xz"]
+  },
+  "application/x-zmachine": {
+    "source": "apache",
+    "extensions": ["z1","z2","z3","z4","z5","z6","z7","z8"]
+  },
+  "application/x400-bp": {
+    "source": "iana"
+  },
+  "application/xacml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xaml+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xaml"]
+  },
+  "application/xcap-att+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xav"]
+  },
+  "application/xcap-caps+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xca"]
+  },
+  "application/xcap-diff+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xdf"]
+  },
+  "application/xcap-el+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xel"]
+  },
+  "application/xcap-error+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xcap-ns+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xns"]
+  },
+  "application/xcon-conference-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xcon-conference-info-diff+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xenc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xenc"]
+  },
+  "application/xhtml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xhtml","xht"]
+  },
+  "application/xhtml-voice+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/xliff+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xlf"]
+  },
+  "application/xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xml","xsl","xsd","rng"]
+  },
+  "application/xml-dtd": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dtd"]
+  },
+  "application/xml-external-parsed-entity": {
+    "source": "iana"
+  },
+  "application/xml-patch+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xmpp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xop+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xop"]
+  },
+  "application/xproc+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xpl"]
+  },
+  "application/xslt+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xsl","xslt"]
+  },
+  "application/xspf+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xspf"]
+  },
+  "application/xv+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mxml","xhvml","xvml","xvm"]
+  },
+  "application/yang": {
+    "source": "iana",
+    "extensions": ["yang"]
+  },
+  "application/yang-data+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yang-data+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yang-patch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yang-patch+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yin+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["yin"]
+  },
+  "application/zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["zip"]
+  },
+  "application/zlib": {
+    "source": "iana"
+  },
+  "application/zstd": {
+    "source": "iana"
+  },
+  "audio/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "audio/32kadpcm": {
+    "source": "iana"
+  },
+  "audio/3gpp": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["3gpp"]
+  },
+  "audio/3gpp2": {
+    "source": "iana"
+  },
+  "audio/aac": {
+    "source": "iana"
+  },
+  "audio/ac3": {
+    "source": "iana"
+  },
+  "audio/adpcm": {
+    "source": "apache",
+    "extensions": ["adp"]
+  },
+  "audio/amr": {
+    "source": "iana",
+    "extensions": ["amr"]
+  },
+  "audio/amr-wb": {
+    "source": "iana"
+  },
+  "audio/amr-wb+": {
+    "source": "iana"
+  },
+  "audio/aptx": {
+    "source": "iana"
+  },
+  "audio/asc": {
+    "source": "iana"
+  },
+  "audio/atrac-advanced-lossless": {
+    "source": "iana"
+  },
+  "audio/atrac-x": {
+    "source": "iana"
+  },
+  "audio/atrac3": {
+    "source": "iana"
+  },
+  "audio/basic": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["au","snd"]
+  },
+  "audio/bv16": {
+    "source": "iana"
+  },
+  "audio/bv32": {
+    "source": "iana"
+  },
+  "audio/clearmode": {
+    "source": "iana"
+  },
+  "audio/cn": {
+    "source": "iana"
+  },
+  "audio/dat12": {
+    "source": "iana"
+  },
+  "audio/dls": {
+    "source": "iana"
+  },
+  "audio/dsr-es201108": {
+    "source": "iana"
+  },
+  "audio/dsr-es202050": {
+    "source": "iana"
+  },
+  "audio/dsr-es202211": {
+    "source": "iana"
+  },
+  "audio/dsr-es202212": {
+    "source": "iana"
+  },
+  "audio/dv": {
+    "source": "iana"
+  },
+  "audio/dvi4": {
+    "source": "iana"
+  },
+  "audio/eac3": {
+    "source": "iana"
+  },
+  "audio/encaprtp": {
+    "source": "iana"
+  },
+  "audio/evrc": {
+    "source": "iana"
+  },
+  "audio/evrc-qcp": {
+    "source": "iana"
+  },
+  "audio/evrc0": {
+    "source": "iana"
+  },
+  "audio/evrc1": {
+    "source": "iana"
+  },
+  "audio/evrcb": {
+    "source": "iana"
+  },
+  "audio/evrcb0": {
+    "source": "iana"
+  },
+  "audio/evrcb1": {
+    "source": "iana"
+  },
+  "audio/evrcnw": {
+    "source": "iana"
+  },
+  "audio/evrcnw0": {
+    "source": "iana"
+  },
+  "audio/evrcnw1": {
+    "source": "iana"
+  },
+  "audio/evrcwb": {
+    "source": "iana"
+  },
+  "audio/evrcwb0": {
+    "source": "iana"
+  },
+  "audio/evrcwb1": {
+    "source": "iana"
+  },
+  "audio/evs": {
+    "source": "iana"
+  },
+  "audio/flexfec": {
+    "source": "iana"
+  },
+  "audio/fwdred": {
+    "source": "iana"
+  },
+  "audio/g711-0": {
+    "source": "iana"
+  },
+  "audio/g719": {
+    "source": "iana"
+  },
+  "audio/g722": {
+    "source": "iana"
+  },
+  "audio/g7221": {
+    "source": "iana"
+  },
+  "audio/g723": {
+    "source": "iana"
+  },
+  "audio/g726-16": {
+    "source": "iana"
+  },
+  "audio/g726-24": {
+    "source": "iana"
+  },
+  "audio/g726-32": {
+    "source": "iana"
+  },
+  "audio/g726-40": {
+    "source": "iana"
+  },
+  "audio/g728": {
+    "source": "iana"
+  },
+  "audio/g729": {
+    "source": "iana"
+  },
+  "audio/g7291": {
+    "source": "iana"
+  },
+  "audio/g729d": {
+    "source": "iana"
+  },
+  "audio/g729e": {
+    "source": "iana"
+  },
+  "audio/gsm": {
+    "source": "iana"
+  },
+  "audio/gsm-efr": {
+    "source": "iana"
+  },
+  "audio/gsm-hr-08": {
+    "source": "iana"
+  },
+  "audio/ilbc": {
+    "source": "iana"
+  },
+  "audio/ip-mr_v2.5": {
+    "source": "iana"
+  },
+  "audio/isac": {
+    "source": "apache"
+  },
+  "audio/l16": {
+    "source": "iana"
+  },
+  "audio/l20": {
+    "source": "iana"
+  },
+  "audio/l24": {
+    "source": "iana",
+    "compressible": false
+  },
+  "audio/l8": {
+    "source": "iana"
+  },
+  "audio/lpc": {
+    "source": "iana"
+  },
+  "audio/melp": {
+    "source": "iana"
+  },
+  "audio/melp1200": {
+    "source": "iana"
+  },
+  "audio/melp2400": {
+    "source": "iana"
+  },
+  "audio/melp600": {
+    "source": "iana"
+  },
+  "audio/mhas": {
+    "source": "iana"
+  },
+  "audio/midi": {
+    "source": "apache",
+    "extensions": ["mid","midi","kar","rmi"]
+  },
+  "audio/mobile-xmf": {
+    "source": "iana",
+    "extensions": ["mxmf"]
+  },
+  "audio/mp3": {
+    "compressible": false,
+    "extensions": ["mp3"]
+  },
+  "audio/mp4": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["m4a","mp4a"]
+  },
+  "audio/mp4a-latm": {
+    "source": "iana"
+  },
+  "audio/mpa": {
+    "source": "iana"
+  },
+  "audio/mpa-robust": {
+    "source": "iana"
+  },
+  "audio/mpeg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["mpga","mp2","mp2a","mp3","m2a","m3a"]
+  },
+  "audio/mpeg4-generic": {
+    "source": "iana"
+  },
+  "audio/musepack": {
+    "source": "apache"
+  },
+  "audio/ogg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["oga","ogg","spx","opus"]
+  },
+  "audio/opus": {
+    "source": "iana"
+  },
+  "audio/parityfec": {
+    "source": "iana"
+  },
+  "audio/pcma": {
+    "source": "iana"
+  },
+  "audio/pcma-wb": {
+    "source": "iana"
+  },
+  "audio/pcmu": {
+    "source": "iana"
+  },
+  "audio/pcmu-wb": {
+    "source": "iana"
+  },
+  "audio/prs.sid": {
+    "source": "iana"
+  },
+  "audio/qcelp": {
+    "source": "iana"
+  },
+  "audio/raptorfec": {
+    "source": "iana"
+  },
+  "audio/red": {
+    "source": "iana"
+  },
+  "audio/rtp-enc-aescm128": {
+    "source": "iana"
+  },
+  "audio/rtp-midi": {
+    "source": "iana"
+  },
+  "audio/rtploopback": {
+    "source": "iana"
+  },
+  "audio/rtx": {
+    "source": "iana"
+  },
+  "audio/s3m": {
+    "source": "apache",
+    "extensions": ["s3m"]
+  },
+  "audio/scip": {
+    "source": "iana"
+  },
+  "audio/silk": {
+    "source": "apache",
+    "extensions": ["sil"]
+  },
+  "audio/smv": {
+    "source": "iana"
+  },
+  "audio/smv-qcp": {
+    "source": "iana"
+  },
+  "audio/smv0": {
+    "source": "iana"
+  },
+  "audio/sofa": {
+    "source": "iana"
+  },
+  "audio/sp-midi": {
+    "source": "iana"
+  },
+  "audio/speex": {
+    "source": "iana"
+  },
+  "audio/t140c": {
+    "source": "iana"
+  },
+  "audio/t38": {
+    "source": "iana"
+  },
+  "audio/telephone-event": {
+    "source": "iana"
+  },
+  "audio/tetra_acelp": {
+    "source": "iana"
+  },
+  "audio/tetra_acelp_bb": {
+    "source": "iana"
+  },
+  "audio/tone": {
+    "source": "iana"
+  },
+  "audio/tsvcis": {
+    "source": "iana"
+  },
+  "audio/uemclip": {
+    "source": "iana"
+  },
+  "audio/ulpfec": {
+    "source": "iana"
+  },
+  "audio/usac": {
+    "source": "iana"
+  },
+  "audio/vdvi": {
+    "source": "iana"
+  },
+  "audio/vmr-wb": {
+    "source": "iana"
+  },
+  "audio/vnd.3gpp.iufp": {
+    "source": "iana"
+  },
+  "audio/vnd.4sb": {
+    "source": "iana"
+  },
+  "audio/vnd.audiokoz": {
+    "source": "iana"
+  },
+  "audio/vnd.celp": {
+    "source": "iana"
+  },
+  "audio/vnd.cisco.nse": {
+    "source": "iana"
+  },
+  "audio/vnd.cmles.radio-events": {
+    "source": "iana"
+  },
+  "audio/vnd.cns.anp1": {
+    "source": "iana"
+  },
+  "audio/vnd.cns.inf1": {
+    "source": "iana"
+  },
+  "audio/vnd.dece.audio": {
+    "source": "iana",
+    "extensions": ["uva","uvva"]
+  },
+  "audio/vnd.digital-winds": {
+    "source": "iana",
+    "extensions": ["eol"]
+  },
+  "audio/vnd.dlna.adts": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.heaac.1": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.heaac.2": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.mlp": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.mps": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pl2": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pl2x": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pl2z": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pulse.1": {
+    "source": "iana"
+  },
+  "audio/vnd.dra": {
+    "source": "iana",
+    "extensions": ["dra"]
+  },
+  "audio/vnd.dts": {
+    "source": "iana",
+    "extensions": ["dts"]
+  },
+  "audio/vnd.dts.hd": {
+    "source": "iana",
+    "extensions": ["dtshd"]
+  },
+  "audio/vnd.dts.uhd": {
+    "source": "iana"
+  },
+  "audio/vnd.dvb.file": {
+    "source": "iana"
+  },
+  "audio/vnd.everad.plj": {
+    "source": "iana"
+  },
+  "audio/vnd.hns.audio": {
+    "source": "iana"
+  },
+  "audio/vnd.lucent.voice": {
+    "source": "iana",
+    "extensions": ["lvp"]
+  },
+  "audio/vnd.ms-playready.media.pya": {
+    "source": "iana",
+    "extensions": ["pya"]
+  },
+  "audio/vnd.nokia.mobile-xmf": {
+    "source": "iana"
+  },
+  "audio/vnd.nortel.vbk": {
+    "source": "iana"
+  },
+  "audio/vnd.nuera.ecelp4800": {
+    "source": "iana",
+    "extensions": ["ecelp4800"]
+  },
+  "audio/vnd.nuera.ecelp7470": {
+    "source": "iana",
+    "extensions": ["ecelp7470"]
+  },
+  "audio/vnd.nuera.ecelp9600": {
+    "source": "iana",
+    "extensions": ["ecelp9600"]
+  },
+  "audio/vnd.octel.sbc": {
+    "source": "iana"
+  },
+  "audio/vnd.presonus.multitrack": {
+    "source": "iana"
+  },
+  "audio/vnd.qcelp": {
+    "source": "iana"
+  },
+  "audio/vnd.rhetorex.32kadpcm": {
+    "source": "iana"
+  },
+  "audio/vnd.rip": {
+    "source": "iana",
+    "extensions": ["rip"]
+  },
+  "audio/vnd.rn-realaudio": {
+    "compressible": false
+  },
+  "audio/vnd.sealedmedia.softseal.mpeg": {
+    "source": "iana"
+  },
+  "audio/vnd.vmx.cvsd": {
+    "source": "iana"
+  },
+  "audio/vnd.wave": {
+    "compressible": false
+  },
+  "audio/vorbis": {
+    "source": "iana",
+    "compressible": false
+  },
+  "audio/vorbis-config": {
+    "source": "iana"
+  },
+  "audio/wav": {
+    "compressible": false,
+    "extensions": ["wav"]
+  },
+  "audio/wave": {
+    "compressible": false,
+    "extensions": ["wav"]
+  },
+  "audio/webm": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["weba"]
+  },
+  "audio/x-aac": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["aac"]
+  },
+  "audio/x-aiff": {
+    "source": "apache",
+    "extensions": ["aif","aiff","aifc"]
+  },
+  "audio/x-caf": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["caf"]
+  },
+  "audio/x-flac": {
+    "source": "apache",
+    "extensions": ["flac"]
+  },
+  "audio/x-m4a": {
+    "source": "nginx",
+    "extensions": ["m4a"]
+  },
+  "audio/x-matroska": {
+    "source": "apache",
+    "extensions": ["mka"]
+  },
+  "audio/x-mpegurl": {
+    "source": "apache",
+    "extensions": ["m3u"]
+  },
+  "audio/x-ms-wax": {
+    "source": "apache",
+    "extensions": ["wax"]
+  },
+  "audio/x-ms-wma": {
+    "source": "apache",
+    "extensions": ["wma"]
+  },
+  "audio/x-pn-realaudio": {
+    "source": "apache",
+    "extensions": ["ram","ra"]
+  },
+  "audio/x-pn-realaudio-plugin": {
+    "source": "apache",
+    "extensions": ["rmp"]
+  },
+  "audio/x-realaudio": {
+    "source": "nginx",
+    "extensions": ["ra"]
+  },
+  "audio/x-tta": {
+    "source": "apache"
+  },
+  "audio/x-wav": {
+    "source": "apache",
+    "extensions": ["wav"]
+  },
+  "audio/xm": {
+    "source": "apache",
+    "extensions": ["xm"]
+  },
+  "chemical/x-cdx": {
+    "source": "apache",
+    "extensions": ["cdx"]
+  },
+  "chemical/x-cif": {
+    "source": "apache",
+    "extensions": ["cif"]
+  },
+  "chemical/x-cmdf": {
+    "source": "apache",
+    "extensions": ["cmdf"]
+  },
+  "chemical/x-cml": {
+    "source": "apache",
+    "extensions": ["cml"]
+  },
+  "chemical/x-csml": {
+    "source": "apache",
+    "extensions": ["csml"]
+  },
+  "chemical/x-pdb": {
+    "source": "apache"
+  },
+  "chemical/x-xyz": {
+    "source": "apache",
+    "extensions": ["xyz"]
+  },
+  "font/collection": {
+    "source": "iana",
+    "extensions": ["ttc"]
+  },
+  "font/otf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["otf"]
+  },
+  "font/sfnt": {
+    "source": "iana"
+  },
+  "font/ttf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ttf"]
+  },
+  "font/woff": {
+    "source": "iana",
+    "extensions": ["woff"]
+  },
+  "font/woff2": {
+    "source": "iana",
+    "extensions": ["woff2"]
+  },
+  "image/aces": {
+    "source": "iana",
+    "extensions": ["exr"]
+  },
+  "image/apng": {
+    "compressible": false,
+    "extensions": ["apng"]
+  },
+  "image/avci": {
+    "source": "iana",
+    "extensions": ["avci"]
+  },
+  "image/avcs": {
+    "source": "iana",
+    "extensions": ["avcs"]
+  },
+  "image/avif": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["avif"]
+  },
+  "image/bmp": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["bmp"]
+  },
+  "image/cgm": {
+    "source": "iana",
+    "extensions": ["cgm"]
+  },
+  "image/dicom-rle": {
+    "source": "iana",
+    "extensions": ["drle"]
+  },
+  "image/emf": {
+    "source": "iana",
+    "extensions": ["emf"]
+  },
+  "image/fits": {
+    "source": "iana",
+    "extensions": ["fits"]
+  },
+  "image/g3fax": {
+    "source": "iana",
+    "extensions": ["g3"]
+  },
+  "image/gif": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["gif"]
+  },
+  "image/heic": {
+    "source": "iana",
+    "extensions": ["heic"]
+  },
+  "image/heic-sequence": {
+    "source": "iana",
+    "extensions": ["heics"]
+  },
+  "image/heif": {
+    "source": "iana",
+    "extensions": ["heif"]
+  },
+  "image/heif-sequence": {
+    "source": "iana",
+    "extensions": ["heifs"]
+  },
+  "image/hej2k": {
+    "source": "iana",
+    "extensions": ["hej2"]
+  },
+  "image/hsj2": {
+    "source": "iana",
+    "extensions": ["hsj2"]
+  },
+  "image/ief": {
+    "source": "iana",
+    "extensions": ["ief"]
+  },
+  "image/jls": {
+    "source": "iana",
+    "extensions": ["jls"]
+  },
+  "image/jp2": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jp2","jpg2"]
+  },
+  "image/jpeg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jpeg","jpg","jpe"]
+  },
+  "image/jph": {
+    "source": "iana",
+    "extensions": ["jph"]
+  },
+  "image/jphc": {
+    "source": "iana",
+    "extensions": ["jhc"]
+  },
+  "image/jpm": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jpm"]
+  },
+  "image/jpx": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jpx","jpf"]
+  },
+  "image/jxr": {
+    "source": "iana",
+    "extensions": ["jxr"]
+  },
+  "image/jxra": {
+    "source": "iana",
+    "extensions": ["jxra"]
+  },
+  "image/jxrs": {
+    "source": "iana",
+    "extensions": ["jxrs"]
+  },
+  "image/jxs": {
+    "source": "iana",
+    "extensions": ["jxs"]
+  },
+  "image/jxsc": {
+    "source": "iana",
+    "extensions": ["jxsc"]
+  },
+  "image/jxsi": {
+    "source": "iana",
+    "extensions": ["jxsi"]
+  },
+  "image/jxss": {
+    "source": "iana",
+    "extensions": ["jxss"]
+  },
+  "image/ktx": {
+    "source": "iana",
+    "extensions": ["ktx"]
+  },
+  "image/ktx2": {
+    "source": "iana",
+    "extensions": ["ktx2"]
+  },
+  "image/naplps": {
+    "source": "iana"
+  },
+  "image/pjpeg": {
+    "compressible": false
+  },
+  "image/png": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["png"]
+  },
+  "image/prs.btif": {
+    "source": "iana",
+    "extensions": ["btif"]
+  },
+  "image/prs.pti": {
+    "source": "iana",
+    "extensions": ["pti"]
+  },
+  "image/pwg-raster": {
+    "source": "iana"
+  },
+  "image/sgi": {
+    "source": "apache",
+    "extensions": ["sgi"]
+  },
+  "image/svg+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["svg","svgz"]
+  },
+  "image/t38": {
+    "source": "iana",
+    "extensions": ["t38"]
+  },
+  "image/tiff": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["tif","tiff"]
+  },
+  "image/tiff-fx": {
+    "source": "iana",
+    "extensions": ["tfx"]
+  },
+  "image/vnd.adobe.photoshop": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["psd"]
+  },
+  "image/vnd.airzip.accelerator.azv": {
+    "source": "iana",
+    "extensions": ["azv"]
+  },
+  "image/vnd.cns.inf2": {
+    "source": "iana"
+  },
+  "image/vnd.dece.graphic": {
+    "source": "iana",
+    "extensions": ["uvi","uvvi","uvg","uvvg"]
+  },
+  "image/vnd.djvu": {
+    "source": "iana",
+    "extensions": ["djvu","djv"]
+  },
+  "image/vnd.dvb.subtitle": {
+    "source": "iana",
+    "extensions": ["sub"]
+  },
+  "image/vnd.dwg": {
+    "source": "iana",
+    "extensions": ["dwg"]
+  },
+  "image/vnd.dxf": {
+    "source": "iana",
+    "extensions": ["dxf"]
+  },
+  "image/vnd.fastbidsheet": {
+    "source": "iana",
+    "extensions": ["fbs"]
+  },
+  "image/vnd.fpx": {
+    "source": "iana",
+    "extensions": ["fpx"]
+  },
+  "image/vnd.fst": {
+    "source": "iana",
+    "extensions": ["fst"]
+  },
+  "image/vnd.fujixerox.edmics-mmr": {
+    "source": "iana",
+    "extensions": ["mmr"]
+  },
+  "image/vnd.fujixerox.edmics-rlc": {
+    "source": "iana",
+    "extensions": ["rlc"]
+  },
+  "image/vnd.globalgraphics.pgb": {
+    "source": "iana"
+  },
+  "image/vnd.microsoft.icon": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ico"]
+  },
+  "image/vnd.mix": {
+    "source": "iana"
+  },
+  "image/vnd.mozilla.apng": {
+    "source": "iana"
+  },
+  "image/vnd.ms-dds": {
+    "compressible": true,
+    "extensions": ["dds"]
+  },
+  "image/vnd.ms-modi": {
+    "source": "iana",
+    "extensions": ["mdi"]
+  },
+  "image/vnd.ms-photo": {
+    "source": "apache",
+    "extensions": ["wdp"]
+  },
+  "image/vnd.net-fpx": {
+    "source": "iana",
+    "extensions": ["npx"]
+  },
+  "image/vnd.pco.b16": {
+    "source": "iana",
+    "extensions": ["b16"]
+  },
+  "image/vnd.radiance": {
+    "source": "iana"
+  },
+  "image/vnd.sealed.png": {
+    "source": "iana"
+  },
+  "image/vnd.sealedmedia.softseal.gif": {
+    "source": "iana"
+  },
+  "image/vnd.sealedmedia.softseal.jpg": {
+    "source": "iana"
+  },
+  "image/vnd.svf": {
+    "source": "iana"
+  },
+  "image/vnd.tencent.tap": {
+    "source": "iana",
+    "extensions": ["tap"]
+  },
+  "image/vnd.valve.source.texture": {
+    "source": "iana",
+    "extensions": ["vtf"]
+  },
+  "image/vnd.wap.wbmp": {
+    "source": "iana",
+    "extensions": ["wbmp"]
+  },
+  "image/vnd.xiff": {
+    "source": "iana",
+    "extensions": ["xif"]
+  },
+  "image/vnd.zbrush.pcx": {
+    "source": "iana",
+    "extensions": ["pcx"]
+  },
+  "image/webp": {
+    "source": "apache",
+    "extensions": ["webp"]
+  },
+  "image/wmf": {
+    "source": "iana",
+    "extensions": ["wmf"]
+  },
+  "image/x-3ds": {
+    "source": "apache",
+    "extensions": ["3ds"]
+  },
+  "image/x-cmu-raster": {
+    "source": "apache",
+    "extensions": ["ras"]
+  },
+  "image/x-cmx": {
+    "source": "apache",
+    "extensions": ["cmx"]
+  },
+  "image/x-freehand": {
+    "source": "apache",
+    "extensions": ["fh","fhc","fh4","fh5","fh7"]
+  },
+  "image/x-icon": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["ico"]
+  },
+  "image/x-jng": {
+    "source": "nginx",
+    "extensions": ["jng"]
+  },
+  "image/x-mrsid-image": {
+    "source": "apache",
+    "extensions": ["sid"]
+  },
+  "image/x-ms-bmp": {
+    "source": "nginx",
+    "compressible": true,
+    "extensions": ["bmp"]
+  },
+  "image/x-pcx": {
+    "source": "apache",
+    "extensions": ["pcx"]
+  },
+  "image/x-pict": {
+    "source": "apache",
+    "extensions": ["pic","pct"]
+  },
+  "image/x-portable-anymap": {
+    "source": "apache",
+    "extensions": ["pnm"]
+  },
+  "image/x-portable-bitmap": {
+    "source": "apache",
+    "extensions": ["pbm"]
+  },
+  "image/x-portable-graymap": {
+    "source": "apache",
+    "extensions": ["pgm"]
+  },
+  "image/x-portable-pixmap": {
+    "source": "apache",
+    "extensions": ["ppm"]
+  },
+  "image/x-rgb": {
+    "source": "apache",
+    "extensions": ["rgb"]
+  },
+  "image/x-tga": {
+    "source": "apache",
+    "extensions": ["tga"]
+  },
+  "image/x-xbitmap": {
+    "source": "apache",
+    "extensions": ["xbm"]
+  },
+  "image/x-xcf": {
+    "compressible": false
+  },
+  "image/x-xpixmap": {
+    "source": "apache",
+    "extensions": ["xpm"]
+  },
+  "image/x-xwindowdump": {
+    "source": "apache",
+    "extensions": ["xwd"]
+  },
+  "message/cpim": {
+    "source": "iana"
+  },
+  "message/delivery-status": {
+    "source": "iana"
+  },
+  "message/disposition-notification": {
+    "source": "iana",
+    "extensions": [
+      "disposition-notification"
+    ]
+  },
+  "message/external-body": {
+    "source": "iana"
+  },
+  "message/feedback-report": {
+    "source": "iana"
+  },
+  "message/global": {
+    "source": "iana",
+    "extensions": ["u8msg"]
+  },
+  "message/global-delivery-status": {
+    "source": "iana",
+    "extensions": ["u8dsn"]
+  },
+  "message/global-disposition-notification": {
+    "source": "iana",
+    "extensions": ["u8mdn"]
+  },
+  "message/global-headers": {
+    "source": "iana",
+    "extensions": ["u8hdr"]
+  },
+  "message/http": {
+    "source": "iana",
+    "compressible": false
+  },
+  "message/imdn+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "message/news": {
+    "source": "iana"
+  },
+  "message/partial": {
+    "source": "iana",
+    "compressible": false
+  },
+  "message/rfc822": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["eml","mime"]
+  },
+  "message/s-http": {
+    "source": "iana"
+  },
+  "message/sip": {
+    "source": "iana"
+  },
+  "message/sipfrag": {
+    "source": "iana"
+  },
+  "message/tracking-status": {
+    "source": "iana"
+  },
+  "message/vnd.si.simp": {
+    "source": "iana"
+  },
+  "message/vnd.wfa.wsc": {
+    "source": "iana",
+    "extensions": ["wsc"]
+  },
+  "model/3mf": {
+    "source": "iana",
+    "extensions": ["3mf"]
+  },
+  "model/e57": {
+    "source": "iana"
+  },
+  "model/gltf+json": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["gltf"]
+  },
+  "model/gltf-binary": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["glb"]
+  },
+  "model/iges": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["igs","iges"]
+  },
+  "model/mesh": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["msh","mesh","silo"]
+  },
+  "model/mtl": {
+    "source": "iana",
+    "extensions": ["mtl"]
+  },
+  "model/obj": {
+    "source": "iana",
+    "extensions": ["obj"]
+  },
+  "model/step": {
+    "source": "iana"
+  },
+  "model/step+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["stpx"]
+  },
+  "model/step+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["stpz"]
+  },
+  "model/step-xml+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["stpxz"]
+  },
+  "model/stl": {
+    "source": "iana",
+    "extensions": ["stl"]
+  },
+  "model/vnd.collada+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dae"]
+  },
+  "model/vnd.dwf": {
+    "source": "iana",
+    "extensions": ["dwf"]
+  },
+  "model/vnd.flatland.3dml": {
+    "source": "iana"
+  },
+  "model/vnd.gdl": {
+    "source": "iana",
+    "extensions": ["gdl"]
+  },
+  "model/vnd.gs-gdl": {
+    "source": "apache"
+  },
+  "model/vnd.gs.gdl": {
+    "source": "iana"
+  },
+  "model/vnd.gtw": {
+    "source": "iana",
+    "extensions": ["gtw"]
+  },
+  "model/vnd.moml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "model/vnd.mts": {
+    "source": "iana",
+    "extensions": ["mts"]
+  },
+  "model/vnd.opengex": {
+    "source": "iana",
+    "extensions": ["ogex"]
+  },
+  "model/vnd.parasolid.transmit.binary": {
+    "source": "iana",
+    "extensions": ["x_b"]
+  },
+  "model/vnd.parasolid.transmit.text": {
+    "source": "iana",
+    "extensions": ["x_t"]
+  },
+  "model/vnd.pytha.pyox": {
+    "source": "iana"
+  },
+  "model/vnd.rosette.annotated-data-model": {
+    "source": "iana"
+  },
+  "model/vnd.sap.vds": {
+    "source": "iana",
+    "extensions": ["vds"]
+  },
+  "model/vnd.usdz+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["usdz"]
+  },
+  "model/vnd.valve.source.compiled-map": {
+    "source": "iana",
+    "extensions": ["bsp"]
+  },
+  "model/vnd.vtu": {
+    "source": "iana",
+    "extensions": ["vtu"]
+  },
+  "model/vrml": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["wrl","vrml"]
+  },
+  "model/x3d+binary": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["x3db","x3dbz"]
+  },
+  "model/x3d+fastinfoset": {
+    "source": "iana",
+    "extensions": ["x3db"]
+  },
+  "model/x3d+vrml": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["x3dv","x3dvz"]
+  },
+  "model/x3d+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["x3d","x3dz"]
+  },
+  "model/x3d-vrml": {
+    "source": "iana",
+    "extensions": ["x3dv"]
+  },
+  "multipart/alternative": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/appledouble": {
+    "source": "iana"
+  },
+  "multipart/byteranges": {
+    "source": "iana"
+  },
+  "multipart/digest": {
+    "source": "iana"
+  },
+  "multipart/encrypted": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/form-data": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/header-set": {
+    "source": "iana"
+  },
+  "multipart/mixed": {
+    "source": "iana"
+  },
+  "multipart/multilingual": {
+    "source": "iana"
+  },
+  "multipart/parallel": {
+    "source": "iana"
+  },
+  "multipart/related": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/report": {
+    "source": "iana"
+  },
+  "multipart/signed": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/vnd.bint.med-plus": {
+    "source": "iana"
+  },
+  "multipart/voice-message": {
+    "source": "iana"
+  },
+  "multipart/x-mixed-replace": {
+    "source": "iana"
+  },
+  "text/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "text/cache-manifest": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["appcache","manifest"]
+  },
+  "text/calendar": {
+    "source": "iana",
+    "extensions": ["ics","ifb"]
+  },
+  "text/calender": {
+    "compressible": true
+  },
+  "text/cmd": {
+    "compressible": true
+  },
+  "text/coffeescript": {
+    "extensions": ["coffee","litcoffee"]
+  },
+  "text/cql": {
+    "source": "iana"
+  },
+  "text/cql-expression": {
+    "source": "iana"
+  },
+  "text/cql-identifier": {
+    "source": "iana"
+  },
+  "text/css": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["css"]
+  },
+  "text/csv": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["csv"]
+  },
+  "text/csv-schema": {
+    "source": "iana"
+  },
+  "text/directory": {
+    "source": "iana"
+  },
+  "text/dns": {
+    "source": "iana"
+  },
+  "text/ecmascript": {
+    "source": "iana"
+  },
+  "text/encaprtp": {
+    "source": "iana"
+  },
+  "text/enriched": {
+    "source": "iana"
+  },
+  "text/fhirpath": {
+    "source": "iana"
+  },
+  "text/flexfec": {
+    "source": "iana"
+  },
+  "text/fwdred": {
+    "source": "iana"
+  },
+  "text/gff3": {
+    "source": "iana"
+  },
+  "text/grammar-ref-list": {
+    "source": "iana"
+  },
+  "text/html": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["html","htm","shtml"]
+  },
+  "text/jade": {
+    "extensions": ["jade"]
+  },
+  "text/javascript": {
+    "source": "iana",
+    "compressible": true
+  },
+  "text/jcr-cnd": {
+    "source": "iana"
+  },
+  "text/jsx": {
+    "compressible": true,
+    "extensions": ["jsx"]
+  },
+  "text/less": {
+    "compressible": true,
+    "extensions": ["less"]
+  },
+  "text/markdown": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["markdown","md"]
+  },
+  "text/mathml": {
+    "source": "nginx",
+    "extensions": ["mml"]
+  },
+  "text/mdx": {
+    "compressible": true,
+    "extensions": ["mdx"]
+  },
+  "text/mizar": {
+    "source": "iana"
+  },
+  "text/n3": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["n3"]
+  },
+  "text/parameters": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/parityfec": {
+    "source": "iana"
+  },
+  "text/plain": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["txt","text","conf","def","list","log","in","ini"]
+  },
+  "text/provenance-notation": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/prs.fallenstein.rst": {
+    "source": "iana"
+  },
+  "text/prs.lines.tag": {
+    "source": "iana",
+    "extensions": ["dsc"]
+  },
+  "text/prs.prop.logic": {
+    "source": "iana"
+  },
+  "text/raptorfec": {
+    "source": "iana"
+  },
+  "text/red": {
+    "source": "iana"
+  },
+  "text/rfc822-headers": {
+    "source": "iana"
+  },
+  "text/richtext": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rtx"]
+  },
+  "text/rtf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rtf"]
+  },
+  "text/rtp-enc-aescm128": {
+    "source": "iana"
+  },
+  "text/rtploopback": {
+    "source": "iana"
+  },
+  "text/rtx": {
+    "source": "iana"
+  },
+  "text/sgml": {
+    "source": "iana",
+    "extensions": ["sgml","sgm"]
+  },
+  "text/shaclc": {
+    "source": "iana"
+  },
+  "text/shex": {
+    "source": "iana",
+    "extensions": ["shex"]
+  },
+  "text/slim": {
+    "extensions": ["slim","slm"]
+  },
+  "text/spdx": {
+    "source": "iana",
+    "extensions": ["spdx"]
+  },
+  "text/strings": {
+    "source": "iana"
+  },
+  "text/stylus": {
+    "extensions": ["stylus","styl"]
+  },
+  "text/t140": {
+    "source": "iana"
+  },
+  "text/tab-separated-values": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["tsv"]
+  },
+  "text/troff": {
+    "source": "iana",
+    "extensions": ["t","tr","roff","man","me","ms"]
+  },
+  "text/turtle": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["ttl"]
+  },
+  "text/ulpfec": {
+    "source": "iana"
+  },
+  "text/uri-list": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["uri","uris","urls"]
+  },
+  "text/vcard": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["vcard"]
+  },
+  "text/vnd.a": {
+    "source": "iana"
+  },
+  "text/vnd.abc": {
+    "source": "iana"
+  },
+  "text/vnd.ascii-art": {
+    "source": "iana"
+  },
+  "text/vnd.curl": {
+    "source": "iana",
+    "extensions": ["curl"]
+  },
+  "text/vnd.curl.dcurl": {
+    "source": "apache",
+    "extensions": ["dcurl"]
+  },
+  "text/vnd.curl.mcurl": {
+    "source": "apache",
+    "extensions": ["mcurl"]
+  },
+  "text/vnd.curl.scurl": {
+    "source": "apache",
+    "extensions": ["scurl"]
+  },
+  "text/vnd.debian.copyright": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/vnd.dmclientscript": {
+    "source": "iana"
+  },
+  "text/vnd.dvb.subtitle": {
+    "source": "iana",
+    "extensions": ["sub"]
+  },
+  "text/vnd.esmertec.theme-descriptor": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/vnd.familysearch.gedcom": {
+    "source": "iana",
+    "extensions": ["ged"]
+  },
+  "text/vnd.ficlab.flt": {
+    "source": "iana"
+  },
+  "text/vnd.fly": {
+    "source": "iana",
+    "extensions": ["fly"]
+  },
+  "text/vnd.fmi.flexstor": {
+    "source": "iana",
+    "extensions": ["flx"]
+  },
+  "text/vnd.gml": {
+    "source": "iana"
+  },
+  "text/vnd.graphviz": {
+    "source": "iana",
+    "extensions": ["gv"]
+  },
+  "text/vnd.hans": {
+    "source": "iana"
+  },
+  "text/vnd.hgl": {
+    "source": "iana"
+  },
+  "text/vnd.in3d.3dml": {
+    "source": "iana",
+    "extensions": ["3dml"]
+  },
+  "text/vnd.in3d.spot": {
+    "source": "iana",
+    "extensions": ["spot"]
+  },
+  "text/vnd.iptc.newsml": {
+    "source": "iana"
+  },
+  "text/vnd.iptc.nitf": {
+    "source": "iana"
+  },
+  "text/vnd.latex-z": {
+    "source": "iana"
+  },
+  "text/vnd.motorola.reflex": {
+    "source": "iana"
+  },
+  "text/vnd.ms-mediapackage": {
+    "source": "iana"
+  },
+  "text/vnd.net2phone.commcenter.command": {
+    "source": "iana"
+  },
+  "text/vnd.radisys.msml-basic-layout": {
+    "source": "iana"
+  },
+  "text/vnd.senx.warpscript": {
+    "source": "iana"
+  },
+  "text/vnd.si.uricatalogue": {
+    "source": "iana"
+  },
+  "text/vnd.sosi": {
+    "source": "iana"
+  },
+  "text/vnd.sun.j2me.app-descriptor": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["jad"]
+  },
+  "text/vnd.trolltech.linguist": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/vnd.wap.si": {
+    "source": "iana"
+  },
+  "text/vnd.wap.sl": {
+    "source": "iana"
+  },
+  "text/vnd.wap.wml": {
+    "source": "iana",
+    "extensions": ["wml"]
+  },
+  "text/vnd.wap.wmlscript": {
+    "source": "iana",
+    "extensions": ["wmls"]
+  },
+  "text/vtt": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["vtt"]
+  },
+  "text/x-asm": {
+    "source": "apache",
+    "extensions": ["s","asm"]
+  },
+  "text/x-c": {
+    "source": "apache",
+    "extensions": ["c","cc","cxx","cpp","h","hh","dic"]
+  },
+  "text/x-component": {
+    "source": "nginx",
+    "extensions": ["htc"]
+  },
+  "text/x-fortran": {
+    "source": "apache",
+    "extensions": ["f","for","f77","f90"]
+  },
+  "text/x-gwt-rpc": {
+    "compressible": true
+  },
+  "text/x-handlebars-template": {
+    "extensions": ["hbs"]
+  },
+  "text/x-java-source": {
+    "source": "apache",
+    "extensions": ["java"]
+  },
+  "text/x-jquery-tmpl": {
+    "compressible": true
+  },
+  "text/x-lua": {
+    "extensions": ["lua"]
+  },
+  "text/x-markdown": {
+    "compressible": true,
+    "extensions": ["mkd"]
+  },
+  "text/x-nfo": {
+    "source": "apache",
+    "extensions": ["nfo"]
+  },
+  "text/x-opml": {
+    "source": "apache",
+    "extensions": ["opml"]
+  },
+  "text/x-org": {
+    "compressible": true,
+    "extensions": ["org"]
+  },
+  "text/x-pascal": {
+    "source": "apache",
+    "extensions": ["p","pas"]
+  },
+  "text/x-processing": {
+    "compressible": true,
+    "extensions": ["pde"]
+  },
+  "text/x-sass": {
+    "extensions": ["sass"]
+  },
+  "text/x-scss": {
+    "extensions": ["scss"]
+  },
+  "text/x-setext": {
+    "source": "apache",
+    "extensions": ["etx"]
+  },
+  "text/x-sfv": {
+    "source": "apache",
+    "extensions": ["sfv"]
+  },
+  "text/x-suse-ymp": {
+    "compressible": true,
+    "extensions": ["ymp"]
+  },
+  "text/x-uuencode": {
+    "source": "apache",
+    "extensions": ["uu"]
+  },
+  "text/x-vcalendar": {
+    "source": "apache",
+    "extensions": ["vcs"]
+  },
+  "text/x-vcard": {
+    "source": "apache",
+    "extensions": ["vcf"]
+  },
+  "text/xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xml"]
+  },
+  "text/xml-external-parsed-entity": {
+    "source": "iana"
+  },
+  "text/yaml": {
+    "compressible": true,
+    "extensions": ["yaml","yml"]
+  },
+  "video/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "video/3gpp": {
+    "source": "iana",
+    "extensions": ["3gp","3gpp"]
+  },
+  "video/3gpp-tt": {
+    "source": "iana"
+  },
+  "video/3gpp2": {
+    "source": "iana",
+    "extensions": ["3g2"]
+  },
+  "video/av1": {
+    "source": "iana"
+  },
+  "video/bmpeg": {
+    "source": "iana"
+  },
+  "video/bt656": {
+    "source": "iana"
+  },
+  "video/celb": {
+    "source": "iana"
+  },
+  "video/dv": {
+    "source": "iana"
+  },
+  "video/encaprtp": {
+    "source": "iana"
+  },
+  "video/ffv1": {
+    "source": "iana"
+  },
+  "video/flexfec": {
+    "source": "iana"
+  },
+  "video/h261": {
+    "source": "iana",
+    "extensions": ["h261"]
+  },
+  "video/h263": {
+    "source": "iana",
+    "extensions": ["h263"]
+  },
+  "video/h263-1998": {
+    "source": "iana"
+  },
+  "video/h263-2000": {
+    "source": "iana"
+  },
+  "video/h264": {
+    "source": "iana",
+    "extensions": ["h264"]
+  },
+  "video/h264-rcdo": {
+    "source": "iana"
+  },
+  "video/h264-svc": {
+    "source": "iana"
+  },
+  "video/h265": {
+    "source": "iana"
+  },
+  "video/iso.segment": {
+    "source": "iana",
+    "extensions": ["m4s"]
+  },
+  "video/jpeg": {
+    "source": "iana",
+    "extensions": ["jpgv"]
+  },
+  "video/jpeg2000": {
+    "source": "iana"
+  },
+  "video/jpm": {
+    "source": "apache",
+    "extensions": ["jpm","jpgm"]
+  },
+  "video/jxsv": {
+    "source": "iana"
+  },
+  "video/mj2": {
+    "source": "iana",
+    "extensions": ["mj2","mjp2"]
+  },
+  "video/mp1s": {
+    "source": "iana"
+  },
+  "video/mp2p": {
+    "source": "iana"
+  },
+  "video/mp2t": {
+    "source": "iana",
+    "extensions": ["ts"]
+  },
+  "video/mp4": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["mp4","mp4v","mpg4"]
+  },
+  "video/mp4v-es": {
+    "source": "iana"
+  },
+  "video/mpeg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["mpeg","mpg","mpe","m1v","m2v"]
+  },
+  "video/mpeg4-generic": {
+    "source": "iana"
+  },
+  "video/mpv": {
+    "source": "iana"
+  },
+  "video/nv": {
+    "source": "iana"
+  },
+  "video/ogg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ogv"]
+  },
+  "video/parityfec": {
+    "source": "iana"
+  },
+  "video/pointer": {
+    "source": "iana"
+  },
+  "video/quicktime": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["qt","mov"]
+  },
+  "video/raptorfec": {
+    "source": "iana"
+  },
+  "video/raw": {
+    "source": "iana"
+  },
+  "video/rtp-enc-aescm128": {
+    "source": "iana"
+  },
+  "video/rtploopback": {
+    "source": "iana"
+  },
+  "video/rtx": {
+    "source": "iana"
+  },
+  "video/scip": {
+    "source": "iana"
+  },
+  "video/smpte291": {
+    "source": "iana"
+  },
+  "video/smpte292m": {
+    "source": "iana"
+  },
+  "video/ulpfec": {
+    "source": "iana"
+  },
+  "video/vc1": {
+    "source": "iana"
+  },
+  "video/vc2": {
+    "source": "iana"
+  },
+  "video/vnd.cctv": {
+    "source": "iana"
+  },
+  "video/vnd.dece.hd": {
+    "source": "iana",
+    "extensions": ["uvh","uvvh"]
+  },
+  "video/vnd.dece.mobile": {
+    "source": "iana",
+    "extensions": ["uvm","uvvm"]
+  },
+  "video/vnd.dece.mp4": {
+    "source": "iana"
+  },
+  "video/vnd.dece.pd": {
+    "source": "iana",
+    "extensions": ["uvp","uvvp"]
+  },
+  "video/vnd.dece.sd": {
+    "source": "iana",
+    "extensions": ["uvs","uvvs"]
+  },
+  "video/vnd.dece.video": {
+    "source": "iana",
+    "extensions": ["uvv","uvvv"]
+  },
+  "video/vnd.directv.mpeg": {
+    "source": "iana"
+  },
+  "video/vnd.directv.mpeg-tts": {
+    "source": "iana"
+  },
+  "video/vnd.dlna.mpeg-tts": {
+    "source": "iana"
+  },
+  "video/vnd.dvb.file": {
+    "source": "iana",
+    "extensions": ["dvb"]
+  },
+  "video/vnd.fvt": {
+    "source": "iana",
+    "extensions": ["fvt"]
+  },
+  "video/vnd.hns.video": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.1dparityfec-1010": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.1dparityfec-2005": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.2dparityfec-1010": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.2dparityfec-2005": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.ttsavc": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.ttsmpeg2": {
+    "source": "iana"
+  },
+  "video/vnd.motorola.video": {
+    "source": "iana"
+  },
+  "video/vnd.motorola.videop": {
+    "source": "iana"
+  },
+  "video/vnd.mpegurl": {
+    "source": "iana",
+    "extensions": ["mxu","m4u"]
+  },
+  "video/vnd.ms-playready.media.pyv": {
+    "source": "iana",
+    "extensions": ["pyv"]
+  },
+  "video/vnd.nokia.interleaved-multimedia": {
+    "source": "iana"
+  },
+  "video/vnd.nokia.mp4vr": {
+    "source": "iana"
+  },
+  "video/vnd.nokia.videovoip": {
+    "source": "iana"
+  },
+  "video/vnd.objectvideo": {
+    "source": "iana"
+  },
+  "video/vnd.radgamettools.bink": {
+    "source": "iana"
+  },
+  "video/vnd.radgamettools.smacker": {
+    "source": "iana"
+  },
+  "video/vnd.sealed.mpeg1": {
+    "source": "iana"
+  },
+  "video/vnd.sealed.mpeg4": {
+    "source": "iana"
+  },
+  "video/vnd.sealed.swf": {
+    "source": "iana"
+  },
+  "video/vnd.sealedmedia.softseal.mov": {
+    "source": "iana"
+  },
+  "video/vnd.uvvu.mp4": {
+    "source": "iana",
+    "extensions": ["uvu","uvvu"]
+  },
+  "video/vnd.vivo": {
+    "source": "iana",
+    "extensions": ["viv"]
+  },
+  "video/vnd.youtube.yt": {
+    "source": "iana"
+  },
+  "video/vp8": {
+    "source": "iana"
+  },
+  "video/vp9": {
+    "source": "iana"
+  },
+  "video/webm": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["webm"]
+  },
+  "video/x-f4v": {
+    "source": "apache",
+    "extensions": ["f4v"]
+  },
+  "video/x-fli": {
+    "source": "apache",
+    "extensions": ["fli"]
+  },
+  "video/x-flv": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["flv"]
+  },
+  "video/x-m4v": {
+    "source": "apache",
+    "extensions": ["m4v"]
+  },
+  "video/x-matroska": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["mkv","mk3d","mks"]
+  },
+  "video/x-mng": {
+    "source": "apache",
+    "extensions": ["mng"]
+  },
+  "video/x-ms-asf": {
+    "source": "apache",
+    "extensions": ["asf","asx"]
+  },
+  "video/x-ms-vob": {
+    "source": "apache",
+    "extensions": ["vob"]
+  },
+  "video/x-ms-wm": {
+    "source": "apache",
+    "extensions": ["wm"]
+  },
+  "video/x-ms-wmv": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["wmv"]
+  },
+  "video/x-ms-wmx": {
+    "source": "apache",
+    "extensions": ["wmx"]
+  },
+  "video/x-ms-wvx": {
+    "source": "apache",
+    "extensions": ["wvx"]
+  },
+  "video/x-msvideo": {
+    "source": "apache",
+    "extensions": ["avi"]
+  },
+  "video/x-sgi-movie": {
+    "source": "apache",
+    "extensions": ["movie"]
+  },
+  "video/x-smv": {
+    "source": "apache",
+    "extensions": ["smv"]
+  },
+  "x-conference/x-cooltalk": {
+    "source": "apache",
+    "extensions": ["ice"]
+  },
+  "x-shader/x-fragment": {
+    "compressible": true
+  },
+  "x-shader/x-vertex": {
+    "compressible": true
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/mime-db/index.js b/node_modules/mathjs/examples/node_modules/mime-db/index.js
new file mode 100644
index 0000000..ec2be30
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-db/index.js
@@ -0,0 +1,12 @@
+/*!
+ * mime-db
+ * Copyright(c) 2014 Jonathan Ong
+ * Copyright(c) 2015-2022 Douglas Christopher Wilson
+ * MIT Licensed
+ */
+
+/**
+ * Module exports.
+ */
+
+module.exports = require('./db.json')
diff --git a/node_modules/mathjs/examples/node_modules/mime-db/package.json b/node_modules/mathjs/examples/node_modules/mime-db/package.json
new file mode 100644
index 0000000..32c14b8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-db/package.json
@@ -0,0 +1,60 @@
+{
+  "name": "mime-db",
+  "description": "Media Type Database",
+  "version": "1.52.0",
+  "contributors": [
+    "Douglas Christopher Wilson <doug@somethingdoug.com>",
+    "Jonathan Ong <me@jongleberry.com> (http://jongleberry.com)",
+    "Robert Kieffer <robert@broofa.com> (http://github.com/broofa)"
+  ],
+  "license": "MIT",
+  "keywords": [
+    "mime",
+    "db",
+    "type",
+    "types",
+    "database",
+    "charset",
+    "charsets"
+  ],
+  "repository": "jshttp/mime-db",
+  "devDependencies": {
+    "bluebird": "3.7.2",
+    "co": "4.6.0",
+    "cogent": "1.0.1",
+    "csv-parse": "4.16.3",
+    "eslint": "7.32.0",
+    "eslint-config-standard": "15.0.1",
+    "eslint-plugin-import": "2.25.4",
+    "eslint-plugin-markdown": "2.2.1",
+    "eslint-plugin-node": "11.1.0",
+    "eslint-plugin-promise": "5.1.1",
+    "eslint-plugin-standard": "4.1.0",
+    "gnode": "0.1.2",
+    "media-typer": "1.1.0",
+    "mocha": "9.2.1",
+    "nyc": "15.1.0",
+    "raw-body": "2.5.0",
+    "stream-to-array": "2.3.0"
+  },
+  "files": [
+    "HISTORY.md",
+    "LICENSE",
+    "README.md",
+    "db.json",
+    "index.js"
+  ],
+  "engines": {
+    "node": ">= 0.6"
+  },
+  "scripts": {
+    "build": "node scripts/build",
+    "fetch": "node scripts/fetch-apache && gnode scripts/fetch-iana && node scripts/fetch-nginx",
+    "lint": "eslint .",
+    "test": "mocha --reporter spec --bail --check-leaks test/",
+    "test-ci": "nyc --reporter=lcov --reporter=text npm test",
+    "test-cov": "nyc --reporter=html --reporter=text npm test",
+    "update": "npm run fetch && npm run build",
+    "version": "node scripts/version-history.js && git add HISTORY.md"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/mime-types/HISTORY.md b/node_modules/mathjs/examples/node_modules/mime-types/HISTORY.md
new file mode 100644
index 0000000..c5043b7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-types/HISTORY.md
@@ -0,0 +1,397 @@
+2.1.35 / 2022-03-12
+===================
+
+  * deps: mime-db@1.52.0
+    - Add extensions from IANA for more `image/*` types
+    - Add extension `.asc` to `application/pgp-keys`
+    - Add extensions to various XML types
+    - Add new upstream MIME types
+
+2.1.34 / 2021-11-08
+===================
+
+  * deps: mime-db@1.51.0
+    - Add new upstream MIME types
+
+2.1.33 / 2021-10-01
+===================
+
+  * deps: mime-db@1.50.0
+    - Add deprecated iWorks mime types and extensions
+    - Add new upstream MIME types
+
+2.1.32 / 2021-07-27
+===================
+
+  * deps: mime-db@1.49.0
+    - Add extension `.trig` to `application/trig`
+    - Add new upstream MIME types
+
+2.1.31 / 2021-06-01
+===================
+
+  * deps: mime-db@1.48.0
+    - Add extension `.mvt` to `application/vnd.mapbox-vector-tile`
+    - Add new upstream MIME types
+
+2.1.30 / 2021-04-02
+===================
+
+  * deps: mime-db@1.47.0
+    - Add extension `.amr` to `audio/amr`
+    - Remove ambigious extensions from IANA for `application/*+xml` types
+    - Update primary extension to `.es` for `application/ecmascript`
+
+2.1.29 / 2021-02-17
+===================
+
+  * deps: mime-db@1.46.0
+    - Add extension `.amr` to `audio/amr`
+    - Add extension `.m4s` to `video/iso.segment`
+    - Add extension `.opus` to `audio/ogg`
+    - Add new upstream MIME types
+
+2.1.28 / 2021-01-01
+===================
+
+  * deps: mime-db@1.45.0
+    - Add `application/ubjson` with extension `.ubj`
+    - Add `image/avif` with extension `.avif`
+    - Add `image/ktx2` with extension `.ktx2`
+    - Add extension `.dbf` to `application/vnd.dbf`
+    - Add extension `.rar` to `application/vnd.rar`
+    - Add extension `.td` to `application/urc-targetdesc+xml`
+    - Add new upstream MIME types
+    - Fix extension of `application/vnd.apple.keynote` to be `.key`
+
+2.1.27 / 2020-04-23
+===================
+
+  * deps: mime-db@1.44.0
+    - Add charsets from IANA
+    - Add extension `.cjs` to `application/node`
+    - Add new upstream MIME types
+
+2.1.26 / 2020-01-05
+===================
+
+  * deps: mime-db@1.43.0
+    - Add `application/x-keepass2` with extension `.kdbx`
+    - Add extension `.mxmf` to `audio/mobile-xmf`
+    - Add extensions from IANA for `application/*+xml` types
+    - Add new upstream MIME types
+
+2.1.25 / 2019-11-12
+===================
+
+  * deps: mime-db@1.42.0
+    - Add new upstream MIME types
+    - Add `application/toml` with extension `.toml`
+    - Add `image/vnd.ms-dds` with extension `.dds`
+
+2.1.24 / 2019-04-20
+===================
+
+  * deps: mime-db@1.40.0
+    - Add extensions from IANA for `model/*` types
+    - Add `text/mdx` with extension `.mdx`
+
+2.1.23 / 2019-04-17
+===================
+
+  * deps: mime-db@~1.39.0
+    - Add extensions `.siv` and `.sieve` to `application/sieve`
+    - Add new upstream MIME types
+
+2.1.22 / 2019-02-14
+===================
+
+  * deps: mime-db@~1.38.0
+    - Add extension `.nq` to `application/n-quads`
+    - Add extension `.nt` to `application/n-triples`
+    - Add new upstream MIME types
+
+2.1.21 / 2018-10-19
+===================
+
+  * deps: mime-db@~1.37.0
+    - Add extensions to HEIC image types
+    - Add new upstream MIME types
+
+2.1.20 / 2018-08-26
+===================
+
+  * deps: mime-db@~1.36.0
+    - Add Apple file extensions from IANA
+    - Add extensions from IANA for `image/*` types
+    - Add new upstream MIME types
+
+2.1.19 / 2018-07-17
+===================
+
+  * deps: mime-db@~1.35.0
+    - Add extension `.csl` to `application/vnd.citationstyles.style+xml`
+    - Add extension `.es` to `application/ecmascript`
+    - Add extension `.owl` to `application/rdf+xml`
+    - Add new upstream MIME types
+    - Add UTF-8 as default charset for `text/turtle`
+
+2.1.18 / 2018-02-16
+===================
+
+  * deps: mime-db@~1.33.0
+    - Add `application/raml+yaml` with extension `.raml`
+    - Add `application/wasm` with extension `.wasm`
+    - Add `text/shex` with extension `.shex`
+    - Add extensions for JPEG-2000 images
+    - Add extensions from IANA for `message/*` types
+    - Add new upstream MIME types
+    - Update font MIME types
+    - Update `text/hjson` to registered `application/hjson`
+
+2.1.17 / 2017-09-01
+===================
+
+  * deps: mime-db@~1.30.0
+    - Add `application/vnd.ms-outlook`
+    - Add `application/x-arj`
+    - Add extension `.mjs` to `application/javascript`
+    - Add glTF types and extensions
+    - Add new upstream MIME types
+    - Add `text/x-org`
+    - Add VirtualBox MIME types
+    - Fix `source` records for `video/*` types that are IANA
+    - Update `font/opentype` to registered `font/otf`
+
+2.1.16 / 2017-07-24
+===================
+
+  * deps: mime-db@~1.29.0
+    - Add `application/fido.trusted-apps+json`
+    - Add extension `.wadl` to `application/vnd.sun.wadl+xml`
+    - Add extension `.gz` to `application/gzip`
+    - Add new upstream MIME types
+    - Update extensions `.md` and `.markdown` to be `text/markdown`
+
+2.1.15 / 2017-03-23
+===================
+
+  * deps: mime-db@~1.27.0
+    - Add new mime types
+    - Add `image/apng`
+
+2.1.14 / 2017-01-14
+===================
+
+  * deps: mime-db@~1.26.0
+    - Add new mime types
+
+2.1.13 / 2016-11-18
+===================
+
+  * deps: mime-db@~1.25.0
+    - Add new mime types
+
+2.1.12 / 2016-09-18
+===================
+
+  * deps: mime-db@~1.24.0
+    - Add new mime types
+    - Add `audio/mp3`
+
+2.1.11 / 2016-05-01
+===================
+
+  * deps: mime-db@~1.23.0
+    - Add new mime types
+
+2.1.10 / 2016-02-15
+===================
+
+  * deps: mime-db@~1.22.0
+    - Add new mime types
+    - Fix extension of `application/dash+xml`
+    - Update primary extension for `audio/mp4`
+
+2.1.9 / 2016-01-06
+==================
+
+  * deps: mime-db@~1.21.0
+    - Add new mime types
+
+2.1.8 / 2015-11-30
+==================
+
+  * deps: mime-db@~1.20.0
+    - Add new mime types
+
+2.1.7 / 2015-09-20
+==================
+
+  * deps: mime-db@~1.19.0
+    - Add new mime types
+
+2.1.6 / 2015-09-03
+==================
+
+  * deps: mime-db@~1.18.0
+    - Add new mime types
+
+2.1.5 / 2015-08-20
+==================
+
+  * deps: mime-db@~1.17.0
+    - Add new mime types
+
+2.1.4 / 2015-07-30
+==================
+
+  * deps: mime-db@~1.16.0
+    - Add new mime types
+
+2.1.3 / 2015-07-13
+==================
+
+  * deps: mime-db@~1.15.0
+    - Add new mime types
+
+2.1.2 / 2015-06-25
+==================
+
+  * deps: mime-db@~1.14.0
+    - Add new mime types
+
+2.1.1 / 2015-06-08
+==================
+
+  * perf: fix deopt during mapping
+
+2.1.0 / 2015-06-07
+==================
+
+  * Fix incorrectly treating extension-less file name as extension
+    - i.e. `'path/to/json'` will no longer return `application/json`
+  * Fix `.charset(type)` to accept parameters
+  * Fix `.charset(type)` to match case-insensitive
+  * Improve generation of extension to MIME mapping
+  * Refactor internals for readability and no argument reassignment
+  * Prefer `application/*` MIME types from the same source
+  * Prefer any type over `application/octet-stream`
+  * deps: mime-db@~1.13.0
+    - Add nginx as a source
+    - Add new mime types
+
+2.0.14 / 2015-06-06
+===================
+
+  * deps: mime-db@~1.12.0
+    - Add new mime types
+
+2.0.13 / 2015-05-31
+===================
+
+  * deps: mime-db@~1.11.0
+    - Add new mime types
+
+2.0.12 / 2015-05-19
+===================
+
+  * deps: mime-db@~1.10.0
+    - Add new mime types
+
+2.0.11 / 2015-05-05
+===================
+
+  * deps: mime-db@~1.9.1
+    - Add new mime types
+
+2.0.10 / 2015-03-13
+===================
+
+  * deps: mime-db@~1.8.0
+    - Add new mime types
+
+2.0.9 / 2015-02-09
+==================
+
+  * deps: mime-db@~1.7.0
+    - Add new mime types
+    - Community extensions ownership transferred from `node-mime`
+
+2.0.8 / 2015-01-29
+==================
+
+  * deps: mime-db@~1.6.0
+    - Add new mime types
+
+2.0.7 / 2014-12-30
+==================
+
+  * deps: mime-db@~1.5.0
+    - Add new mime types
+    - Fix various invalid MIME type entries
+
+2.0.6 / 2014-12-30
+==================
+
+  * deps: mime-db@~1.4.0
+    - Add new mime types
+    - Fix various invalid MIME type entries
+    - Remove example template MIME types
+
+2.0.5 / 2014-12-29
+==================
+
+  * deps: mime-db@~1.3.1
+    - Fix missing extensions
+
+2.0.4 / 2014-12-10
+==================
+
+  * deps: mime-db@~1.3.0
+    - Add new mime types
+
+2.0.3 / 2014-11-09
+==================
+
+  * deps: mime-db@~1.2.0
+    - Add new mime types
+
+2.0.2 / 2014-09-28
+==================
+
+  * deps: mime-db@~1.1.0
+    - Add new mime types
+    - Update charsets
+
+2.0.1 / 2014-09-07
+==================
+
+  * Support Node.js 0.6
+
+2.0.0 / 2014-09-02
+==================
+
+  * Use `mime-db`
+  * Remove `.define()`
+
+1.0.2 / 2014-08-04
+==================
+
+  * Set charset=utf-8 for `text/javascript`
+
+1.0.1 / 2014-06-24
+==================
+
+  * Add `text/jsx` type
+
+1.0.0 / 2014-05-12
+==================
+
+  * Return `false` for unknown types
+  * Set charset=utf-8 for `application/json`
+
+0.1.0 / 2014-05-02
+==================
+
+  * Initial release
diff --git a/node_modules/mathjs/examples/node_modules/mime-types/LICENSE b/node_modules/mathjs/examples/node_modules/mime-types/LICENSE
new file mode 100644
index 0000000..0616607
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-types/LICENSE
@@ -0,0 +1,23 @@
+(The MIT License)
+
+Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
+Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/mime-types/README.md b/node_modules/mathjs/examples/node_modules/mime-types/README.md
new file mode 100644
index 0000000..48d2fb4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-types/README.md
@@ -0,0 +1,113 @@
+# mime-types
+
+[![NPM Version][npm-version-image]][npm-url]
+[![NPM Downloads][npm-downloads-image]][npm-url]
+[![Node.js Version][node-version-image]][node-version-url]
+[![Build Status][ci-image]][ci-url]
+[![Test Coverage][coveralls-image]][coveralls-url]
+
+The ultimate javascript content-type utility.
+
+Similar to [the `mime@1.x` module](https://www.npmjs.com/package/mime), except:
+
+- __No fallbacks.__ Instead of naively returning the first available type,
+  `mime-types` simply returns `false`, so do
+  `var type = mime.lookup('unrecognized') || 'application/octet-stream'`.
+- No `new Mime()` business, so you could do `var lookup = require('mime-types').lookup`.
+- No `.define()` functionality
+- Bug fixes for `.lookup(path)`
+
+Otherwise, the API is compatible with `mime` 1.x.
+
+## Install
+
+This is a [Node.js](https://nodejs.org/en/) module available through the
+[npm registry](https://www.npmjs.com/). Installation is done using the
+[`npm install` command](https://docs.npmjs.com/getting-started/installing-npm-packages-locally):
+
+```sh
+$ npm install mime-types
+```
+
+## Adding Types
+
+All mime types are based on [mime-db](https://www.npmjs.com/package/mime-db),
+so open a PR there if you'd like to add mime types.
+
+## API
+
+```js
+var mime = require('mime-types')
+```
+
+All functions return `false` if input is invalid or not found.
+
+### mime.lookup(path)
+
+Lookup the content-type associated with a file.
+
+```js
+mime.lookup('json') // 'application/json'
+mime.lookup('.md') // 'text/markdown'
+mime.lookup('file.html') // 'text/html'
+mime.lookup('folder/file.js') // 'application/javascript'
+mime.lookup('folder/.htaccess') // false
+
+mime.lookup('cats') // false
+```
+
+### mime.contentType(type)
+
+Create a full content-type header given a content-type or extension.
+When given an extension, `mime.lookup` is used to get the matching
+content-type, otherwise the given content-type is used. Then if the
+content-type does not already have a `charset` parameter, `mime.charset`
+is used to get the default charset and add to the returned content-type.
+
+```js
+mime.contentType('markdown') // 'text/x-markdown; charset=utf-8'
+mime.contentType('file.json') // 'application/json; charset=utf-8'
+mime.contentType('text/html') // 'text/html; charset=utf-8'
+mime.contentType('text/html; charset=iso-8859-1') // 'text/html; charset=iso-8859-1'
+
+// from a full path
+mime.contentType(path.extname('/path/to/file.json')) // 'application/json; charset=utf-8'
+```
+
+### mime.extension(type)
+
+Get the default extension for a content-type.
+
+```js
+mime.extension('application/octet-stream') // 'bin'
+```
+
+### mime.charset(type)
+
+Lookup the implied default charset of a content-type.
+
+```js
+mime.charset('text/markdown') // 'UTF-8'
+```
+
+### var type = mime.types[extension]
+
+A map of content-types by extension.
+
+### [extensions...] = mime.extensions[type]
+
+A map of extensions by content-type.
+
+## License
+
+[MIT](LICENSE)
+
+[ci-image]: https://badgen.net/github/checks/jshttp/mime-types/master?label=ci
+[ci-url]: https://github.com/jshttp/mime-types/actions/workflows/ci.yml
+[coveralls-image]: https://badgen.net/coveralls/c/github/jshttp/mime-types/master
+[coveralls-url]: https://coveralls.io/r/jshttp/mime-types?branch=master
+[node-version-image]: https://badgen.net/npm/node/mime-types
+[node-version-url]: https://nodejs.org/en/download
+[npm-downloads-image]: https://badgen.net/npm/dm/mime-types
+[npm-url]: https://npmjs.org/package/mime-types
+[npm-version-image]: https://badgen.net/npm/v/mime-types
diff --git a/node_modules/mathjs/examples/node_modules/mime-types/index.js b/node_modules/mathjs/examples/node_modules/mime-types/index.js
new file mode 100644
index 0000000..b9f34d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-types/index.js
@@ -0,0 +1,188 @@
+/*!
+ * mime-types
+ * Copyright(c) 2014 Jonathan Ong
+ * Copyright(c) 2015 Douglas Christopher Wilson
+ * MIT Licensed
+ */
+
+'use strict'
+
+/**
+ * Module dependencies.
+ * @private
+ */
+
+var db = require('mime-db')
+var extname = require('path').extname
+
+/**
+ * Module variables.
+ * @private
+ */
+
+var EXTRACT_TYPE_REGEXP = /^\s*([^;\s]*)(?:;|\s|$)/
+var TEXT_TYPE_REGEXP = /^text\//i
+
+/**
+ * Module exports.
+ * @public
+ */
+
+exports.charset = charset
+exports.charsets = { lookup: charset }
+exports.contentType = contentType
+exports.extension = extension
+exports.extensions = Object.create(null)
+exports.lookup = lookup
+exports.types = Object.create(null)
+
+// Populate the extensions/types maps
+populateMaps(exports.extensions, exports.types)
+
+/**
+ * Get the default charset for a MIME type.
+ *
+ * @param {string} type
+ * @return {boolean|string}
+ */
+
+function charset (type) {
+  if (!type || typeof type !== 'string') {
+    return false
+  }
+
+  // TODO: use media-typer
+  var match = EXTRACT_TYPE_REGEXP.exec(type)
+  var mime = match && db[match[1].toLowerCase()]
+
+  if (mime && mime.charset) {
+    return mime.charset
+  }
+
+  // default text/* to utf-8
+  if (match && TEXT_TYPE_REGEXP.test(match[1])) {
+    return 'UTF-8'
+  }
+
+  return false
+}
+
+/**
+ * Create a full Content-Type header given a MIME type or extension.
+ *
+ * @param {string} str
+ * @return {boolean|string}
+ */
+
+function contentType (str) {
+  // TODO: should this even be in this module?
+  if (!str || typeof str !== 'string') {
+    return false
+  }
+
+  var mime = str.indexOf('/') === -1
+    ? exports.lookup(str)
+    : str
+
+  if (!mime) {
+    return false
+  }
+
+  // TODO: use content-type or other module
+  if (mime.indexOf('charset') === -1) {
+    var charset = exports.charset(mime)
+    if (charset) mime += '; charset=' + charset.toLowerCase()
+  }
+
+  return mime
+}
+
+/**
+ * Get the default extension for a MIME type.
+ *
+ * @param {string} type
+ * @return {boolean|string}
+ */
+
+function extension (type) {
+  if (!type || typeof type !== 'string') {
+    return false
+  }
+
+  // TODO: use media-typer
+  var match = EXTRACT_TYPE_REGEXP.exec(type)
+
+  // get extensions
+  var exts = match && exports.extensions[match[1].toLowerCase()]
+
+  if (!exts || !exts.length) {
+    return false
+  }
+
+  return exts[0]
+}
+
+/**
+ * Lookup the MIME type for a file path/extension.
+ *
+ * @param {string} path
+ * @return {boolean|string}
+ */
+
+function lookup (path) {
+  if (!path || typeof path !== 'string') {
+    return false
+  }
+
+  // get the extension ("ext" or ".ext" or full path)
+  var extension = extname('x.' + path)
+    .toLowerCase()
+    .substr(1)
+
+  if (!extension) {
+    return false
+  }
+
+  return exports.types[extension] || false
+}
+
+/**
+ * Populate the extensions and types maps.
+ * @private
+ */
+
+function populateMaps (extensions, types) {
+  // source preference (least -> most)
+  var preference = ['nginx', 'apache', undefined, 'iana']
+
+  Object.keys(db).forEach(function forEachMimeType (type) {
+    var mime = db[type]
+    var exts = mime.extensions
+
+    if (!exts || !exts.length) {
+      return
+    }
+
+    // mime -> extensions
+    extensions[type] = exts
+
+    // extension -> mime
+    for (var i = 0; i < exts.length; i++) {
+      var extension = exts[i]
+
+      if (types[extension]) {
+        var from = preference.indexOf(db[types[extension]].source)
+        var to = preference.indexOf(mime.source)
+
+        if (types[extension] !== 'application/octet-stream' &&
+          (from > to || (from === to && types[extension].substr(0, 12) === 'application/'))) {
+          // skip the remapping
+          continue
+        }
+      }
+
+      // set the extension -> mime
+      types[extension] = type
+    }
+  })
+}
diff --git a/node_modules/mathjs/examples/node_modules/mime-types/package.json b/node_modules/mathjs/examples/node_modules/mime-types/package.json
new file mode 100644
index 0000000..bbef696
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mime-types/package.json
@@ -0,0 +1,44 @@
+{
+  "name": "mime-types",
+  "description": "The ultimate javascript content-type utility.",
+  "version": "2.1.35",
+  "contributors": [
+    "Douglas Christopher Wilson <doug@somethingdoug.com>",
+    "Jeremiah Senkpiel <fishrock123@rocketmail.com> (https://searchbeam.jit.su)",
+    "Jonathan Ong <me@jongleberry.com> (http://jongleberry.com)"
+  ],
+  "license": "MIT",
+  "keywords": [
+    "mime",
+    "types"
+  ],
+  "repository": "jshttp/mime-types",
+  "dependencies": {
+    "mime-db": "1.52.0"
+  },
+  "devDependencies": {
+    "eslint": "7.32.0",
+    "eslint-config-standard": "14.1.1",
+    "eslint-plugin-import": "2.25.4",
+    "eslint-plugin-markdown": "2.2.1",
+    "eslint-plugin-node": "11.1.0",
+    "eslint-plugin-promise": "5.2.0",
+    "eslint-plugin-standard": "4.1.0",
+    "mocha": "9.2.2",
+    "nyc": "15.1.0"
+  },
+  "files": [
+    "HISTORY.md",
+    "LICENSE",
+    "index.js"
+  ],
+  "engines": {
+    "node": ">= 0.6"
+  },
+  "scripts": {
+    "lint": "eslint .",
+    "test": "mocha --reporter spec test/test.js",
+    "test-ci": "nyc --reporter=lcov --reporter=text npm test",
+    "test-cov": "nyc --reporter=html --reporter=text npm test"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/mimic-fn/index.d.ts b/node_modules/mathjs/examples/node_modules/mimic-fn/index.d.ts
new file mode 100644
index 0000000..b4047d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mimic-fn/index.d.ts
@@ -0,0 +1,54 @@
+declare const mimicFn: {
+	/**
+	Make a function mimic another one. It will copy over the properties `name`, `length`, `displayName`, and any custom properties you may have set.
+
+	@param to - Mimicking function.
+	@param from - Function to mimic.
+	@returns The modified `to` function.
+
+	@example
+	```
+	import mimicFn = require('mimic-fn');
+
+	function foo() {}
+	foo.unicorn = '🦄';
+
+	function wrapper() {
+		return foo();
+	}
+
+	console.log(wrapper.name);
+	//=> 'wrapper'
+
+	mimicFn(wrapper, foo);
+
+	console.log(wrapper.name);
+	//=> 'foo'
+
+	console.log(wrapper.unicorn);
+	//=> '🦄'
+	```
+	*/
+	<
+		ArgumentsType extends unknown[],
+		ReturnType,
+		FunctionType extends (...arguments: ArgumentsType) => ReturnType
+	>(
+		to: (...arguments: ArgumentsType) => ReturnType,
+		from: FunctionType
+	): FunctionType;
+
+	// TODO: Remove this for the next major release, refactor the whole definition to:
+	// declare function mimicFn<
+	//	ArgumentsType extends unknown[],
+	//	ReturnType,
+	//	FunctionType extends (...arguments: ArgumentsType) => ReturnType
+	// >(
+	//	to: (...arguments: ArgumentsType) => ReturnType,
+	//	from: FunctionType
+	// ): FunctionType;
+	// export = mimicFn;
+	default: typeof mimicFn;
+};
+
+export = mimicFn;
diff --git a/node_modules/mathjs/examples/node_modules/mimic-fn/index.js b/node_modules/mathjs/examples/node_modules/mimic-fn/index.js
new file mode 100644
index 0000000..1a59705
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mimic-fn/index.js
@@ -0,0 +1,13 @@
+'use strict';
+
+const mimicFn = (to, from) => {
+	for (const prop of Reflect.ownKeys(from)) {
+		Object.defineProperty(to, prop, Object.getOwnPropertyDescriptor(from, prop));
+	}
+
+	return to;
+};
+
+module.exports = mimicFn;
+// TODO: Remove this for the next major release
+module.exports.default = mimicFn;
diff --git a/node_modules/mathjs/examples/node_modules/mimic-fn/license b/node_modules/mathjs/examples/node_modules/mimic-fn/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mimic-fn/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/mimic-fn/package.json b/node_modules/mathjs/examples/node_modules/mimic-fn/package.json
new file mode 100644
index 0000000..199d2c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mimic-fn/package.json
@@ -0,0 +1,42 @@
+{
+	"name": "mimic-fn",
+	"version": "2.1.0",
+	"description": "Make a function mimic another one",
+	"license": "MIT",
+	"repository": "sindresorhus/mimic-fn",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=6"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"function",
+		"mimic",
+		"imitate",
+		"rename",
+		"copy",
+		"inherit",
+		"properties",
+		"name",
+		"func",
+		"fn",
+		"set",
+		"infer",
+		"change"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.1",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/mimic-fn/readme.md b/node_modules/mathjs/examples/node_modules/mimic-fn/readme.md
new file mode 100644
index 0000000..0ef8a13
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/mimic-fn/readme.md
@@ -0,0 +1,69 @@
+# mimic-fn [![Build Status](https://travis-ci.org/sindresorhus/mimic-fn.svg?branch=master)](https://travis-ci.org/sindresorhus/mimic-fn)
+
+> Make a function mimic another one
+
+Useful when you wrap a function in another function and like to preserve the original name and other properties.
+
+
+## Install
+
+```
+$ npm install mimic-fn
+```
+
+
+## Usage
+
+```js
+const mimicFn = require('mimic-fn');
+
+function foo() {}
+foo.unicorn = '🦄';
+
+function wrapper() {
+	return foo();
+}
+
+console.log(wrapper.name);
+//=> 'wrapper'
+
+mimicFn(wrapper, foo);
+
+console.log(wrapper.name);
+//=> 'foo'
+
+console.log(wrapper.unicorn);
+//=> '🦄'
+```
+
+
+## API
+
+It will copy over the properties `name`, `length`, `displayName`, and any custom properties you may have set.
+
+### mimicFn(to, from)
+
+Modifies the `to` function and returns it.
+
+#### to
+
+Type: `Function`
+
+Mimicking function.
+
+#### from
+
+Type: `Function`
+
+Function to mimic.
+
+
+## Related
+
+- [rename-fn](https://github.com/sindresorhus/rename-fn) - Rename a function
+- [keep-func-props](https://github.com/ehmicky/keep-func-props) - Wrap a function without changing its name, length and other properties
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/LICENSE b/node_modules/mathjs/examples/node_modules/neo-async/LICENSE
new file mode 100644
index 0000000..4ec13d1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/LICENSE
@@ -0,0 +1,22 @@
+MIT License
+
+Copyright (c) 2014-2018 Suguru Motegi
+Based on Async.js, Copyright Caolan McMahon
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/README.md b/node_modules/mathjs/examples/node_modules/neo-async/README.md
new file mode 100644
index 0000000..d49e93c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/README.md
@@ -0,0 +1,273 @@
+<h1 align="center">Neo-Async</h1>
+
+<p align="center">
+  <img src="https://raw.githubusercontent.com/wiki/suguru03/neo-async/images/neo_async_v2.png" width="250px" />
+</p>
+
+<p align="center">
+  <a href="https://www.npmjs.com/package/neo-async"><img alt="npm" src="https://img.shields.io/npm/v/neo-async.svg"></a>
+  <a href="https://travis-ci.org/suguru03/neo-async"><img alt="Travis Status" src="https://img.shields.io/travis/suguru03/neo-async.svg"></a>
+  <a href="https://codecov.io/gh/suguru03/neo-async"><img alt="Coverage Status" src="https://img.shields.io/codecov/c/github/suguru03/neo-async/master.svg"></a>
+  <a href="https://www.npmjs.com/package/neo-async"><img alt="download" src="https://img.shields.io/npm/dm/neo-async.svg"></a>
+  <a href="https://lgtm.com/projects/g/suguru03/neo-async/context:javascript"><img src="https://img.shields.io/lgtm/grade/javascript/g/suguru03/neo-async.svg?logo=lgtm&logoWidth=18" alt="Code Quality: Javascript" height="18"></a>
+  <a href="https://lgtm.com/projects/g/suguru03/neo-async/alerts"><img src="https://img.shields.io/lgtm/alerts/g/suguru03/neo-async.svg?logo=lgtm&logoWidth=18" alt="Total Alerts" height="18"></a>
+  <a href="https://app.fossa.io/projects/git%2Bgithub.com%2Fsuguru03%2Fneo-async?ref=badge_shield"><img src="https://app.fossa.io/api/projects/git%2Bgithub.com%2Fsuguru03%2Fneo-async.svg?type=shield" alt="FOSSA" height="18"></a>
+</p>
+
+Neo-Async is thought to be used as a drop-in replacement for [Async](https://github.com/caolan/async), it almost fully covers its functionality and runs [faster](#benchmark).
+
+Benchmark is [here](#benchmark)!
+
+Bluebird's benchmark is [here](https://github.com/suguru03/bluebird/tree/aigle/benchmark)!
+
+## Code Coverage
+![coverage](https://raw.githubusercontent.com/wiki/suguru03/neo-async/images/coverage.png)
+
+## Installation
+
+### In a browser
+```html
+<script src="async.min.js"></script>
+```
+
+### In an AMD loader
+```js
+require(['async'], function(async) {});
+```
+
+### Promise and async/await
+
+I recommend to use [`Aigle`](https://github.com/suguru03/aigle).
+
+It is optimized for Promise handling and has almost the same functionality as `neo-async`.
+
+### Node.js
+
+#### standard
+
+```bash
+$ npm install neo-async
+```
+```js
+var async = require('neo-async');
+```
+
+#### replacement
+```bash
+$ npm install neo-async
+$ ln -s ./node_modules/neo-async ./node_modules/async
+```
+```js
+var async = require('async');
+```
+
+### Bower
+
+```bash
+bower install neo-async
+```
+
+## Feature
+
+[JSDoc](http://suguru03.github.io/neo-async/doc/async.html)
+
+\* not in Async
+
+### Collections
+
+- [`each`](http://suguru03.github.io/neo-async/doc/async.each.html)
+- [`eachSeries`](http://suguru03.github.io/neo-async/doc/async.eachSeries.html)
+- [`eachLimit`](http://suguru03.github.io/neo-async/doc/async.eachLimit.html)
+- [`forEach`](http://suguru03.github.io/neo-async/doc/async.each.html) -> [`each`](http://suguru03.github.io/neo-async/doc/async.each.html)
+- [`forEachSeries`](http://suguru03.github.io/neo-async/doc/async.eachSeries.html) -> [`eachSeries`](http://suguru03.github.io/neo-async/doc/async.eachSeries.html)
+- [`forEachLimit`](http://suguru03.github.io/neo-async/doc/async.eachLimit.html) -> [`eachLimit`](http://suguru03.github.io/neo-async/doc/async.eachLimit.html)
+- [`eachOf`](http://suguru03.github.io/neo-async/doc/async.each.html) -> [`each`](http://suguru03.github.io/neo-async/doc/async.each.html)
+- [`eachOfSeries`](http://suguru03.github.io/neo-async/doc/async.eachSeries.html) -> [`eachSeries`](http://suguru03.github.io/neo-async/doc/async.eachSeries.html)
+- [`eachOfLimit`](http://suguru03.github.io/neo-async/doc/async.eachLimit.html) -> [`eachLimit`](http://suguru03.github.io/neo-async/doc/async.eachLimit.html)
+- [`forEachOf`](http://suguru03.github.io/neo-async/doc/async.each.html) -> [`each`](http://suguru03.github.io/neo-async/doc/async.each.html)
+- [`forEachOfSeries`](http://suguru03.github.io/neo-async/doc/async.eachSeries.html) -> [`eachSeries`](http://suguru03.github.io/neo-async/doc/async.eachSeries.html)
+- [`eachOfLimit`](http://suguru03.github.io/neo-async/doc/async.eachLimit.html) -> [`forEachLimit`](http://suguru03.github.io/neo-async/doc/async.eachLimit.html)
+- [`map`](http://suguru03.github.io/neo-async/doc/async.map.html)
+- [`mapSeries`](http://suguru03.github.io/neo-async/doc/async.mapSeries.html)
+- [`mapLimit`](http://suguru03.github.io/neo-async/doc/async.mapLimit.html)
+- [`mapValues`](http://suguru03.github.io/neo-async/doc/async.mapValues.html)
+- [`mapValuesSeries`](http://suguru03.github.io/neo-async/doc/async.mapValuesSeries.html)
+- [`mapValuesLimit`](http://suguru03.github.io/neo-async/doc/async.mapValuesLimit.html)
+- [`filter`](http://suguru03.github.io/neo-async/doc/async.filter.html)
+- [`filterSeries`](http://suguru03.github.io/neo-async/doc/async.filterSeries.html)
+- [`filterLimit`](http://suguru03.github.io/neo-async/doc/async.filterLimit.html)
+- [`select`](http://suguru03.github.io/neo-async/doc/async.filter.html) -> [`filter`](http://suguru03.github.io/neo-async/doc/async.filter.html)
+- [`selectSeries`](http://suguru03.github.io/neo-async/doc/async.filterSeries.html) -> [`filterSeries`](http://suguru03.github.io/neo-async/doc/async.filterSeries.html)
+- [`selectLimit`](http://suguru03.github.io/neo-async/doc/async.filterLimit.html) -> [`filterLimit`](http://suguru03.github.io/neo-async/doc/async.filterLimit.html)
+- [`reject`](http://suguru03.github.io/neo-async/doc/async.reject.html)
+- [`rejectSeries`](http://suguru03.github.io/neo-async/doc/async.rejectSeries.html)
+- [`rejectLimit`](http://suguru03.github.io/neo-async/doc/async.rejectLimit.html)
+- [`detect`](http://suguru03.github.io/neo-async/doc/async.detect.html)
+- [`detectSeries`](http://suguru03.github.io/neo-async/doc/async.detectSeries.html)
+- [`detectLimit`](http://suguru03.github.io/neo-async/doc/async.detectLimit.html)
+- [`find`](http://suguru03.github.io/neo-async/doc/async.detect.html) -> [`detect`](http://suguru03.github.io/neo-async/doc/async.detect.html)
+- [`findSeries`](http://suguru03.github.io/neo-async/doc/async.detectSeries.html) -> [`detectSeries`](http://suguru03.github.io/neo-async/doc/async.detectSeries.html)
+- [`findLimit`](http://suguru03.github.io/neo-async/doc/async.detectLimit.html) -> [`detectLimit`](http://suguru03.github.io/neo-async/doc/async.detectLimit.html)
+- [`pick`](http://suguru03.github.io/neo-async/doc/async.pick.html) *
+- [`pickSeries`](http://suguru03.github.io/neo-async/doc/async.pickSeries.html) *
+- [`pickLimit`](http://suguru03.github.io/neo-async/doc/async.pickLimit.html) *
+- [`omit`](http://suguru03.github.io/neo-async/doc/async.omit.html) *
+- [`omitSeries`](http://suguru03.github.io/neo-async/doc/async.omitSeries.html) *
+- [`omitLimit`](http://suguru03.github.io/neo-async/doc/async.omitLimit.html) *
+- [`reduce`](http://suguru03.github.io/neo-async/doc/async.reduce.html)
+- [`inject`](http://suguru03.github.io/neo-async/doc/async.reduce.html) -> [`reduce`](http://suguru03.github.io/neo-async/doc/async.reduce.html)
+- [`foldl`](http://suguru03.github.io/neo-async/doc/async.reduce.html) -> [`reduce`](http://suguru03.github.io/neo-async/doc/async.reduce.html)
+- [`reduceRight`](http://suguru03.github.io/neo-async/doc/async.reduceRight.html)
+- [`foldr`](http://suguru03.github.io/neo-async/doc/async.reduceRight.html) -> [`reduceRight`](http://suguru03.github.io/neo-async/doc/async.reduceRight.html)
+- [`transform`](http://suguru03.github.io/neo-async/doc/async.transform.html)
+- [`transformSeries`](http://suguru03.github.io/neo-async/doc/async.transformSeries.html) *
+- [`transformLimit`](http://suguru03.github.io/neo-async/doc/async.transformLimit.html) *
+- [`sortBy`](http://suguru03.github.io/neo-async/doc/async.sortBy.html)
+- [`sortBySeries`](http://suguru03.github.io/neo-async/doc/async.sortBySeries.html) *
+- [`sortByLimit`](http://suguru03.github.io/neo-async/doc/async.sortByLimit.html) *
+- [`some`](http://suguru03.github.io/neo-async/doc/async.some.html)
+- [`someSeries`](http://suguru03.github.io/neo-async/doc/async.someSeries.html)
+- [`someLimit`](http://suguru03.github.io/neo-async/doc/async.someLimit.html)
+- [`any`](http://suguru03.github.io/neo-async/doc/async.some.html) -> [`some`](http://suguru03.github.io/neo-async/doc/async.some.html)
+- [`anySeries`](http://suguru03.github.io/neo-async/doc/async.someSeries.html) -> [`someSeries`](http://suguru03.github.io/neo-async/doc/async.someSeries.html)
+- [`anyLimit`](http://suguru03.github.io/neo-async/doc/async.someLimit.html) -> [`someLimit`](http://suguru03.github.io/neo-async/doc/async.someLimit.html)
+- [`every`](http://suguru03.github.io/neo-async/doc/async.every.html)
+- [`everySeries`](http://suguru03.github.io/neo-async/doc/async.everySeries.html)
+- [`everyLimit`](http://suguru03.github.io/neo-async/doc/async.everyLimit.html)
+- [`all`](http://suguru03.github.io/neo-async/doc/async.every.html) -> [`every`](http://suguru03.github.io/neo-async/doc/async.every.html)
+- [`allSeries`](http://suguru03.github.io/neo-async/doc/async.everySeries.html) -> [`every`](http://suguru03.github.io/neo-async/doc/async.everySeries.html)
+- [`allLimit`](http://suguru03.github.io/neo-async/doc/async.everyLimit.html) -> [`every`](http://suguru03.github.io/neo-async/doc/async.everyLimit.html)
+- [`concat`](http://suguru03.github.io/neo-async/doc/async.concat.html)
+- [`concatSeries`](http://suguru03.github.io/neo-async/doc/async.concatSeries.html)
+- [`concatLimit`](http://suguru03.github.io/neo-async/doc/async.concatLimit.html) *
+
+### Control Flow
+
+- [`parallel`](http://suguru03.github.io/neo-async/doc/async.parallel.html)
+- [`series`](http://suguru03.github.io/neo-async/doc/async.series.html)
+- [`parallelLimit`](http://suguru03.github.io/neo-async/doc/async.series.html)
+- [`tryEach`](http://suguru03.github.io/neo-async/doc/async.tryEach.html)
+- [`waterfall`](http://suguru03.github.io/neo-async/doc/async.waterfall.html)
+- [`angelFall`](http://suguru03.github.io/neo-async/doc/async.angelFall.html) *
+- [`angelfall`](http://suguru03.github.io/neo-async/doc/async.angelFall.html) -> [`angelFall`](http://suguru03.github.io/neo-async/doc/async.angelFall.html) *
+- [`whilst`](#whilst)
+- [`doWhilst`](#doWhilst)
+- [`until`](#until)
+- [`doUntil`](#doUntil)
+- [`during`](#during)
+- [`doDuring`](#doDuring)
+- [`forever`](#forever)
+- [`compose`](#compose)
+- [`seq`](#seq)
+- [`applyEach`](#applyEach)
+- [`applyEachSeries`](#applyEachSeries)
+- [`queue`](#queue)
+- [`priorityQueue`](#priorityQueue)
+- [`cargo`](#cargo)
+- [`auto`](#auto)
+- [`autoInject`](#autoInject)
+- [`retry`](#retry)
+- [`retryable`](#retryable)
+- [`iterator`](#iterator)
+- [`times`](http://suguru03.github.io/neo-async/doc/async.times.html)
+- [`timesSeries`](http://suguru03.github.io/neo-async/doc/async.timesSeries.html)
+- [`timesLimit`](http://suguru03.github.io/neo-async/doc/async.timesLimit.html)
+- [`race`](#race)
+
+### Utils
+- [`apply`](#apply)
+- [`setImmediate`](#setImmediate)
+- [`nextTick`](#nextTick)
+- [`memoize`](#memoize)
+- [`unmemoize`](#unmemoize)
+- [`ensureAsync`](#ensureAsync)
+- [`constant`](#constant)
+- [`asyncify`](#asyncify)
+- [`wrapSync`](#asyncify) -> [`asyncify`](#asyncify)
+- [`log`](#log)
+- [`dir`](#dir)
+- [`timeout`](http://suguru03.github.io/neo-async/doc/async.timeout.html)
+- [`reflect`](#reflect)
+- [`reflectAll`](#reflectAll)
+- [`createLogger`](#createLogger)
+
+## Mode
+- [`safe`](#safe) *
+- [`fast`](#fast) *
+
+## Benchmark
+
+[Benchmark: Async vs Neo-Async](http://suguru03.hatenablog.com/entry/2016/06/10/135559)
+
+### How to check
+
+```bash
+$ node perf
+```
+
+### Environment
+
+* Darwin 17.3.0 x64
+* Node.js v8.9.4
+* async v2.6.0
+* neo-async v2.5.0
+* benchmark v2.1.4
+
+### Result
+
+The value is the ratio (Neo-Async/Async) of the average speed.
+
+#### Collections
+|function|benchmark|
+|---|--:|
+|each/forEach|2.43|
+|eachSeries/forEachSeries|1.75|
+|eachLimit/forEachLimit|1.68|
+|eachOf|3.29|
+|eachOfSeries|1.50|
+|eachOfLimit|1.59|
+|map|3.95|
+|mapSeries|1.81|
+|mapLimit|1.27|
+|mapValues|2.73|
+|mapValuesSeries|1.59|
+|mapValuesLimit|1.23|
+|filter|3.00|
+|filterSeries|1.74|
+|filterLimit|1.17|
+|reject|4.59|
+|rejectSeries|2.31|
+|rejectLimit|1.58|
+|detect|4.30|
+|detectSeries|1.86|
+|detectLimit|1.32|
+|reduce|1.82|
+|transform|2.46|
+|sortBy|4.08|
+|some|2.19|
+|someSeries|1.83|
+|someLimit|1.32|
+|every|2.09|
+|everySeries|1.84|
+|everyLimit|1.35|
+|concat|3.79|
+|concatSeries|4.45|
+
+#### Control Flow
+|funciton|benchmark|
+|---|--:|
+|parallel|2.93|
+|series|1.96|
+|waterfall|1.29|
+|whilst|1.00|
+|doWhilst|1.12|
+|until|1.12|
+|doUntil|1.12|
+|during|1.18|
+|doDuring|2.42|
+|times|4.25|
+|auto|1.97|
+
+
+## License
+[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2Fsuguru03%2Fneo-async.svg?type=large)](https://app.fossa.io/projects/git%2Bgithub.com%2Fsuguru03%2Fneo-async?ref=badge_large)
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/all.js b/node_modules/mathjs/examples/node_modules/neo-async/all.js
new file mode 100644
index 0000000..dad54e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/all.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').all;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/allLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/allLimit.js
new file mode 100644
index 0000000..d9d7aaa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/allLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').allLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/allSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/allSeries.js
new file mode 100644
index 0000000..2a7a8ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/allSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').allSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/angelFall.js b/node_modules/mathjs/examples/node_modules/neo-async/angelFall.js
new file mode 100644
index 0000000..476c23e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/angelFall.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').angelfall;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/any.js b/node_modules/mathjs/examples/node_modules/neo-async/any.js
new file mode 100644
index 0000000..d6b07bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/any.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').any;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/anyLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/anyLimit.js
new file mode 100644
index 0000000..34114f8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/anyLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').anyLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/anySeries.js b/node_modules/mathjs/examples/node_modules/neo-async/anySeries.js
new file mode 100644
index 0000000..bb3781f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/anySeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').anySeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/apply.js b/node_modules/mathjs/examples/node_modules/neo-async/apply.js
new file mode 100644
index 0000000..41135e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/apply.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').apply;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/applyEach.js b/node_modules/mathjs/examples/node_modules/neo-async/applyEach.js
new file mode 100644
index 0000000..292bd1c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/applyEach.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').applyEach;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/applyEachSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/applyEachSeries.js
new file mode 100644
index 0000000..0aece7c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/applyEachSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').applyEachSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/async.js b/node_modules/mathjs/examples/node_modules/neo-async/async.js
new file mode 100644
index 0000000..e78eb16
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/async.js
@@ -0,0 +1,9184 @@
+(function(global, factory) {
+  /*jshint -W030 */
+  'use strict';
+  typeof exports === 'object' && typeof module !== 'undefined'
+    ? factory(exports)
+    : typeof define === 'function' && define.amd
+    ? define(['exports'], factory)
+    : global.async
+    ? factory((global.neo_async = global.neo_async || {}))
+    : factory((global.async = global.async || {}));
+})(this, function(exports) {
+  'use strict';
+
+  var noop = function noop() {};
+  var throwError = function throwError() {
+    throw new Error('Callback was already called.');
+  };
+
+  var DEFAULT_TIMES = 5;
+  var DEFAULT_INTERVAL = 0;
+
+  var obj = 'object';
+  var func = 'function';
+  var isArray = Array.isArray;
+  var nativeKeys = Object.keys;
+  var nativePush = Array.prototype.push;
+  var iteratorSymbol = typeof Symbol === func && Symbol.iterator;
+
+  var nextTick, asyncNextTick, asyncSetImmediate;
+  createImmediate();
+
+  /**
+   * @memberof async
+   * @namespace each
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.each(array, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.each(array, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.each(object, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.each(object, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b']]
+   * });
+   *
+   * @example
+   *
+   * // break
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num !== 2);
+   *   }, num * 10);
+   * };
+   * async.each(array, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 2]
+   * });
+   *
+   */
+  var each = createEach(arrayEach, baseEach, symbolEach);
+
+  /**
+   * @memberof async
+   * @namespace map
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.map(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2];
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.map(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.map(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.map(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b']]
+   * });
+   *
+   */
+  var map = createMap(arrayEachIndex, baseEachIndex, symbolEachIndex, true);
+
+  /**
+   * @memberof async
+   * @namespace mapValues
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValues(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3, '2': 2 }
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValues(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3, '2': 2 }
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValues(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3, c: 2 }
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValues(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3, c: 2 }
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b']]
+   * });
+   *
+   */
+  var mapValues = createMap(arrayEachIndex, baseEachKey, symbolEachKey, false);
+
+  /**
+   * @memberof async
+   * @namespace filter
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filter(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3];
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filter(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3];
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filter(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3];
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filter(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3];
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b']]
+   * });
+   *
+   */
+  var filter = createFilter(arrayEachIndexValue, baseEachIndexValue, symbolEachIndexValue, true);
+
+  /**
+   * @memberof async
+   * @namespace filterSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterSeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3];
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterSeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3]
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3]
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3]
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c']]
+   * });
+   *
+   */
+  var filterSeries = createFilterSeries(true);
+
+  /**
+   * @memberof async
+   * @namespace filterLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3]
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.filterLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3]
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  var filterLimit = createFilterLimit(true);
+
+  /**
+   * @memberof async
+   * @namespace reject
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.reject(array, iterator, function(err, res) {
+   *   console.log(res); // [2];
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.reject(array, iterator, function(err, res) {
+   *   console.log(res); // [2];
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.reject(object, iterator, function(err, res) {
+   *   console.log(res); // [2];
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.reject(object, iterator, function(err, res) {
+   *   console.log(res); // [2];
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b']]
+   * });
+   *
+   */
+  var reject = createFilter(arrayEachIndexValue, baseEachIndexValue, symbolEachIndexValue, false);
+
+  /**
+   * @memberof async
+   * @namespace rejectSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.rejectSeries(array, iterator, function(err, res) {
+   *   console.log(res); // [2];
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.rejectSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [2];
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.rejectSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [2];
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c']]
+   * });
+   *
+   */
+  var rejectSeries = createFilterSeries(false);
+
+  /**
+   * @memberof async
+   * @namespace rejectLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.rejectLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [4, 2]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.rejectLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [4, 2]
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.rejectLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [4, 2]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.rejectLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [4, 2]
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  var rejectLimit = createFilterLimit(false);
+
+  /**
+   * @memberof async
+   * @namespace detect
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detect(array, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detect(array, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [[1, 0]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detect(object, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detect(object, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [[1, 'a']]
+   * });
+   *
+   */
+  var detect = createDetect(arrayEachValue, baseEachValue, symbolEachValue, true);
+
+  /**
+   * @memberof async
+   * @namespace detectSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectSeries(array, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectSeries(array, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [[1, 0]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectSeries(object, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectSeries(object, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [[1, 'a']]
+   * });
+   *
+   */
+  var detectSeries = createDetectSeries(true);
+
+  /**
+   * @memberof async
+   * @namespace detectLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [[1, 0]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.detectLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // 1
+   *   console.log(order); // [[1, 'a']]
+   * });
+   *
+   */
+  var detectLimit = createDetectLimit(true);
+
+  /**
+   * @memberof async
+   * @namespace every
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.every(array, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [1, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.every(array, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [[1, 0], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.every(object, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [1, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.every(object, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [[1, 'a'], [2, 'c']]
+   * });
+   *
+   */
+  var every = createEvery(arrayEachValue, baseEachValue, symbolEachValue);
+
+  /**
+   * @memberof async
+   * @namespace everySeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everySeries(array, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everySeries(array, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everySeries(object, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everySeries(object, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [[1, 'a'], [3, 'b'] [2, 'c']]
+   * });
+   *
+   */
+  var everySeries = createEverySeries();
+
+  /**
+   * @memberof async
+   * @namespace everyLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everyLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [1, 3, 5, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everyLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everyLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [1, 3, 5, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.everyLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // false
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e']]
+   * });
+   *
+   */
+  var everyLimit = createEveryLimit();
+
+  /**
+   * @memberof async
+   * @namespace pick
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pick(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3 }
+   *   console.log(order); // [1, 2, 3, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pick(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3 }
+   *   console.log(order); // [[0, 1], [2, 2], [3, 1], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pick(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3 }
+   *   console.log(order); // [1, 2, 3, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pick(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3 }
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b'], [4, 'd']]
+   * });
+   *
+   */
+  var pick = createPick(arrayEachIndexValue, baseEachKeyValue, symbolEachKeyValue, true);
+
+  /**
+   * @memberof async
+   * @namespace pickSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickSeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3 }
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickSeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3 }
+   *   console.log(order); // [[0, 1], [3, 1], [2, 2], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickSeries(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3 }
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickSeries(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3 }
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c'], [4, 'd']]
+   * });
+   *
+   */
+  var pickSeries = createPickSeries(true);
+
+  /**
+   * @memberof async
+   * @namespace pickLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 5, '2': 3 }
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 5, '2': 3 }
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 5, c: 3 }
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.pickLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 5, c: 3 }
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  var pickLimit = createPickLimit(true);
+
+  /**
+   * @memberof async
+   * @namespace omit
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omit(array, iterator, function(err, res) {
+   *   console.log(res); // { '2': 2, '3': 4 }
+   *   console.log(order); // [1, 2, 3, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omit(array, iterator, function(err, res) {
+   *   console.log(res); // { '2': 2, '3': 4 }
+   *   console.log(order); // [[0, 1], [2, 2], [3, 1], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omit(object, iterator, function(err, res) {
+   *   console.log(res); // { c: 2, d: 4 }
+   *   console.log(order); // [1, 2, 3, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omit(object, iterator, function(err, res) {
+   *   console.log(res); // { c: 2, d: 4 }
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b'], [4, 'd']]
+   * });
+   *
+   */
+  var omit = createPick(arrayEachIndexValue, baseEachKeyValue, symbolEachKeyValue, false);
+
+  /**
+   * @memberof async
+   * @namespace omitSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitSeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '2': 2, '3': 4 }
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2, 4];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitSeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '2': 2, '3': 4 }
+   *   console.log(order); // [[0, 1], [3, 1], [2, 2], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitSeries(object, iterator, function(err, res) {
+   *   console.log(res); // { c: 2, d: 4 }
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitSeries(object, iterator, function(err, res) {
+   *   console.log(res); // { c: 2, d: 4 }
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c'], [4, 'd']]
+   * });
+   *
+   */
+  var omitSeries = createPickSeries(false);
+
+  /**
+   * @memberof async
+   * @namespace omitLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '3': 4, '4': 2 }
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '3': 4, '4': 2 }
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { d: 4, e: 2 }
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.omitLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { d: 4, e: 2 }
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  var omitLimit = createPickLimit(false);
+
+  /**
+   * @memberof async
+   * @namespace transform
+   * @param {Array|Object} collection
+   * @param {Array|Object|Function} [accumulator]
+   * @param {Function} [iterator]
+   * @param {Function} [callback]
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     result.push(num)
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transform(collection, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4]
+   *   console.log(order); // [1, 2, 3, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index and accumulator
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     result[index] = num;
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transform(collection, {}, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3, '2': 2, '3': 4 }
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object with accumulator
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     result.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transform(collection, [], iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4]
+   *   console.log(order); // [1, 2, 3, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     result[key] = num;
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transform(collection, iterator, function(err, res) {
+   *   console.log(res); //  { a: 1, b: 3, c: 2, d: 4 }
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b'], [4, 'd']]
+   * });
+   *
+   */
+  var transform = createTransform(arrayEachResult, baseEachResult, symbolEachResult);
+
+  /**
+   * @memberof async
+   * @namespace sortBy
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBy(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3];
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBy(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBy(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBy(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b']]
+   * });
+   *
+   */
+  var sortBy = createSortBy(arrayEachIndexValue, baseEachIndexValue, symbolEachIndexValue);
+
+  /**
+   * @memberof async
+   * @namespace concat
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concat(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3];
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concat(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [[1, 0], [2, 2], [3, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concat(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [1, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concat(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [[1, 'a'], [2, 'c'], [3, 'b']]
+   * });
+   *
+   */
+  var concat = createConcat(arrayEachIndex, baseEachIndex, symbolEachIndex);
+
+  /**
+   * @memberof async
+   * @namespace groupBy
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [4.2, 6.4, 6.1];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBy(array, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.1, 6.4] }
+   *   console.log(order); // [4.2, 6.1, 6.4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [4.2, 6.4, 6.1];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBy(array, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.1, 6.4] }
+   *   console.log(order); // [[4.2, 0], [6.1, 2], [6.4, 1]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 4.2, b: 6.4, c: 6.1 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBy(object, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.1, 6.4] }
+   *   console.log(order); // [4.2, 6.1, 6.4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 4.2, b: 6.4, c: 6.1 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBy(object, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.1, 6.4] }
+   *   console.log(order); // [[4.2, 'a'], [6.1, 'c'], [6.4, 'b']]
+   * });
+   *
+   */
+  var groupBy = createGroupBy(arrayEachValue, baseEachValue, symbolEachValue);
+
+  /**
+   * @memberof async
+   * @namespace parallel
+   * @param {Array|Object} tasks - functions
+   * @param {Function} callback
+   * @example
+   *
+   * var order = [];
+   * var tasks = [
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(1);
+   *      done(null, 1);
+   *    }, 10);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(2);
+   *      done(null, 2);
+   *    }, 30);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(3);
+   *      done(null, 3);
+   *    }, 40);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(4);
+   *      done(null, 4);
+   *    }, 20);
+   *  }
+   * ];
+   * async.parallel(tasks, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4];
+   *   console.log(order); // [1, 4, 2, 3]
+   * });
+   *
+   * @example
+   *
+   * var order = [];
+   * var tasks = {
+   *   'a': function(done) {
+   *     setTimeout(function() {
+   *       order.push(1);
+   *       done(null, 1);
+   *     }, 10);
+   *   },
+   *   'b': function(done) {
+   *     setTimeout(function() {
+   *       order.push(2);
+   *       done(null, 2);
+   *     }, 30);
+   *   },
+   *   'c': function(done) {
+   *     setTimeout(function() {
+   *       order.push(3);
+   *       done(null, 3);
+   *     }, 40);
+   *   },
+   *   'd': function(done) {
+   *     setTimeout(function() {
+   *       order.push(4);
+   *       done(null, 4);
+   *     }, 20);
+   *   }
+   * };
+   * async.parallel(tasks, function(err, res) {
+   *   console.log(res); // { a: 1, b: 2, c: 3, d:4 }
+   *   console.log(order); // [1, 4, 2, 3]
+   * });
+   *
+   */
+  var parallel = createParallel(arrayEachFunc, baseEachFunc);
+
+  /**
+   * @memberof async
+   * @namespace applyEach
+   */
+  var applyEach = createApplyEach(map);
+
+  /**
+   * @memberof async
+   * @namespace applyEachSeries
+   */
+  var applyEachSeries = createApplyEach(mapSeries);
+
+  /**
+   * @memberof async
+   * @namespace log
+   */
+  var log = createLogger('log');
+
+  /**
+   * @memberof async
+   * @namespace dir
+   */
+  var dir = createLogger('dir');
+
+  /**
+   * @version 2.6.2
+   * @namespace async
+   */
+  var index = {
+    VERSION: '2.6.2',
+
+    // Collections
+    each: each,
+    eachSeries: eachSeries,
+    eachLimit: eachLimit,
+    forEach: each,
+    forEachSeries: eachSeries,
+    forEachLimit: eachLimit,
+    eachOf: each,
+    eachOfSeries: eachSeries,
+    eachOfLimit: eachLimit,
+    forEachOf: each,
+    forEachOfSeries: eachSeries,
+    forEachOfLimit: eachLimit,
+    map: map,
+    mapSeries: mapSeries,
+    mapLimit: mapLimit,
+    mapValues: mapValues,
+    mapValuesSeries: mapValuesSeries,
+    mapValuesLimit: mapValuesLimit,
+    filter: filter,
+    filterSeries: filterSeries,
+    filterLimit: filterLimit,
+    select: filter,
+    selectSeries: filterSeries,
+    selectLimit: filterLimit,
+    reject: reject,
+    rejectSeries: rejectSeries,
+    rejectLimit: rejectLimit,
+    detect: detect,
+    detectSeries: detectSeries,
+    detectLimit: detectLimit,
+    find: detect,
+    findSeries: detectSeries,
+    findLimit: detectLimit,
+    pick: pick,
+    pickSeries: pickSeries,
+    pickLimit: pickLimit,
+    omit: omit,
+    omitSeries: omitSeries,
+    omitLimit: omitLimit,
+    reduce: reduce,
+    inject: reduce,
+    foldl: reduce,
+    reduceRight: reduceRight,
+    foldr: reduceRight,
+    transform: transform,
+    transformSeries: transformSeries,
+    transformLimit: transformLimit,
+    sortBy: sortBy,
+    sortBySeries: sortBySeries,
+    sortByLimit: sortByLimit,
+    some: some,
+    someSeries: someSeries,
+    someLimit: someLimit,
+    any: some,
+    anySeries: someSeries,
+    anyLimit: someLimit,
+    every: every,
+    everySeries: everySeries,
+    everyLimit: everyLimit,
+    all: every,
+    allSeries: everySeries,
+    allLimit: everyLimit,
+    concat: concat,
+    concatSeries: concatSeries,
+    concatLimit: concatLimit,
+    groupBy: groupBy,
+    groupBySeries: groupBySeries,
+    groupByLimit: groupByLimit,
+
+    // Control Flow
+    parallel: parallel,
+    series: series,
+    parallelLimit: parallelLimit,
+    tryEach: tryEach,
+    waterfall: waterfall,
+    angelFall: angelFall,
+    angelfall: angelFall,
+    whilst: whilst,
+    doWhilst: doWhilst,
+    until: until,
+    doUntil: doUntil,
+    during: during,
+    doDuring: doDuring,
+    forever: forever,
+    compose: compose,
+    seq: seq,
+    applyEach: applyEach,
+    applyEachSeries: applyEachSeries,
+    queue: queue,
+    priorityQueue: priorityQueue,
+    cargo: cargo,
+    auto: auto,
+    autoInject: autoInject,
+    retry: retry,
+    retryable: retryable,
+    iterator: iterator,
+    times: times,
+    timesSeries: timesSeries,
+    timesLimit: timesLimit,
+    race: race,
+
+    // Utils
+    apply: apply,
+    nextTick: asyncNextTick,
+    setImmediate: asyncSetImmediate,
+    memoize: memoize,
+    unmemoize: unmemoize,
+    ensureAsync: ensureAsync,
+    constant: constant,
+    asyncify: asyncify,
+    wrapSync: asyncify,
+    log: log,
+    dir: dir,
+    reflect: reflect,
+    reflectAll: reflectAll,
+    timeout: timeout,
+    createLogger: createLogger,
+
+    // Mode
+    safe: safe,
+    fast: fast
+  };
+
+  exports['default'] = index;
+  baseEachSync(
+    index,
+    function(func, key) {
+      exports[key] = func;
+    },
+    nativeKeys(index)
+  );
+
+  /**
+   * @private
+   */
+  function createImmediate(safeMode) {
+    var delay = function delay(fn) {
+      var args = slice(arguments, 1);
+      setTimeout(function() {
+        fn.apply(null, args);
+      });
+    };
+    asyncSetImmediate = typeof setImmediate === func ? setImmediate : delay;
+    if (typeof process === obj && typeof process.nextTick === func) {
+      nextTick = /^v0.10/.test(process.version) ? asyncSetImmediate : process.nextTick;
+      asyncNextTick = /^v0/.test(process.version) ? asyncSetImmediate : process.nextTick;
+    } else {
+      asyncNextTick = nextTick = asyncSetImmediate;
+    }
+    if (safeMode === false) {
+      nextTick = function(cb) {
+        cb();
+      };
+    }
+  }
+
+  /* sync functions based on lodash */
+
+  /**
+   * Converts `arguments` to an array.
+   *
+   * @private
+   * @param {Array} array = The array to slice.
+   */
+  function createArray(array) {
+    var index = -1;
+    var size = array.length;
+    var result = Array(size);
+
+    while (++index < size) {
+      result[index] = array[index];
+    }
+    return result;
+  }
+
+  /**
+   * Create an array from `start`
+   *
+   * @private
+   * @param {Array} array - The array to slice.
+   * @param {number} start - The start position.
+   */
+  function slice(array, start) {
+    var end = array.length;
+    var index = -1;
+    var size = end - start;
+    if (size <= 0) {
+      return [];
+    }
+    var result = Array(size);
+
+    while (++index < size) {
+      result[index] = array[index + start];
+    }
+    return result;
+  }
+
+  /**
+   * @private
+   * @param {Object} object
+   */
+  function objectClone(object) {
+    var keys = nativeKeys(object);
+    var size = keys.length;
+    var index = -1;
+    var result = {};
+
+    while (++index < size) {
+      var key = keys[index];
+      result[key] = object[key];
+    }
+    return result;
+  }
+
+  /**
+   * Create an array with all falsey values removed.
+   *
+   * @private
+   * @param {Array} array - The array to compact.
+   */
+  function compact(array) {
+    var index = -1;
+    var size = array.length;
+    var result = [];
+
+    while (++index < size) {
+      var value = array[index];
+      if (value) {
+        result[result.length] = value;
+      }
+    }
+    return result;
+  }
+
+  /**
+   * Create an array of reverse sequence.
+   *
+   * @private
+   * @param {Array} array - The array to reverse.
+   */
+  function reverse(array) {
+    var index = -1;
+    var size = array.length;
+    var result = Array(size);
+    var resIndex = size;
+
+    while (++index < size) {
+      result[--resIndex] = array[index];
+    }
+    return result;
+  }
+
+  /**
+   * Checks if key exists in object property.
+   *
+   * @private
+   * @param {Object} object - The object to inspect.
+   * @param {string} key - The key to check.
+   */
+  function has(object, key) {
+    return object.hasOwnProperty(key);
+  }
+
+  /**
+   * Check if target exists in array.
+   * @private
+   * @param {Array} array
+   * @param {*} target
+   */
+  function notInclude(array, target) {
+    var index = -1;
+    var size = array.length;
+
+    while (++index < size) {
+      if (array[index] === target) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  /**
+   * @private
+   * @param {Array} array - The array to iterate over.
+   * @param {Function} iterator - The function invoked per iteration.
+   */
+  function arrayEachSync(array, iterator) {
+    var index = -1;
+    var size = array.length;
+
+    while (++index < size) {
+      iterator(array[index], index);
+    }
+    return array;
+  }
+
+  /**
+   * @private
+   * @param {Object} object - The object to iterate over.
+   * @param {Function} iterator - The function invoked per iteration.
+   * @param {Array} keys
+   */
+  function baseEachSync(object, iterator, keys) {
+    var index = -1;
+    var size = keys.length;
+
+    while (++index < size) {
+      var key = keys[index];
+      iterator(object[key], key);
+    }
+    return object;
+  }
+
+  /**
+   * @private
+   * @param {number} n
+   * @param {Function} iterator
+   */
+  function timesSync(n, iterator) {
+    var index = -1;
+    while (++index < n) {
+      iterator(index);
+    }
+  }
+
+  /**
+   * @private
+   * @param {Array} array
+   * @param {number[]} criteria
+   */
+  function sortByCriteria(array, criteria) {
+    var l = array.length;
+    var indices = Array(l);
+    var i;
+    for (i = 0; i < l; i++) {
+      indices[i] = i;
+    }
+    quickSort(criteria, 0, l - 1, indices);
+    var result = Array(l);
+    for (var n = 0; n < l; n++) {
+      i = indices[n];
+      result[n] = i === undefined ? array[n] : array[i];
+    }
+    return result;
+  }
+
+  function partition(array, i, j, mid, indices) {
+    var l = i;
+    var r = j;
+    while (l <= r) {
+      i = l;
+      while (l < r && array[l] < mid) {
+        l++;
+      }
+      while (r >= i && array[r] >= mid) {
+        r--;
+      }
+      if (l > r) {
+        break;
+      }
+      swap(array, indices, l++, r--);
+    }
+    return l;
+  }
+
+  function swap(array, indices, l, r) {
+    var n = array[l];
+    array[l] = array[r];
+    array[r] = n;
+    var i = indices[l];
+    indices[l] = indices[r];
+    indices[r] = i;
+  }
+
+  function quickSort(array, i, j, indices) {
+    if (i === j) {
+      return;
+    }
+    var k = i;
+    while (++k <= j && array[i] === array[k]) {
+      var l = k - 1;
+      if (indices[l] > indices[k]) {
+        var index = indices[l];
+        indices[l] = indices[k];
+        indices[k] = index;
+      }
+    }
+    if (k > j) {
+      return;
+    }
+    var p = array[i] > array[k] ? i : k;
+    k = partition(array, i, j, array[p], indices);
+    quickSort(array, i, k - 1, indices);
+    quickSort(array, k, j, indices);
+  }
+
+  /**
+   * @Private
+   */
+  function makeConcatResult(array) {
+    var result = [];
+    arrayEachSync(array, function(value) {
+      if (value === noop) {
+        return;
+      }
+      if (isArray(value)) {
+        nativePush.apply(result, value);
+      } else {
+        result.push(value);
+      }
+    });
+    return result;
+  }
+
+  /* async functions */
+
+  /**
+   * @private
+   */
+  function arrayEach(array, iterator, callback) {
+    var index = -1;
+    var size = array.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        iterator(array[index], index, onlyOnce(callback));
+      }
+    } else {
+      while (++index < size) {
+        iterator(array[index], onlyOnce(callback));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function baseEach(object, iterator, callback, keys) {
+    var key;
+    var index = -1;
+    var size = keys.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        key = keys[index];
+        iterator(object[key], key, onlyOnce(callback));
+      }
+    } else {
+      while (++index < size) {
+        iterator(object[keys[index]], onlyOnce(callback));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function symbolEach(collection, iterator, callback) {
+    var iter = collection[iteratorSymbol]();
+    var index = 0;
+    var item;
+    if (iterator.length === 3) {
+      while ((item = iter.next()).done === false) {
+        iterator(item.value, index++, onlyOnce(callback));
+      }
+    } else {
+      while ((item = iter.next()).done === false) {
+        index++;
+        iterator(item.value, onlyOnce(callback));
+      }
+    }
+    return index;
+  }
+
+  /**
+   * @private
+   */
+  function arrayEachResult(array, result, iterator, callback) {
+    var index = -1;
+    var size = array.length;
+
+    if (iterator.length === 4) {
+      while (++index < size) {
+        iterator(result, array[index], index, onlyOnce(callback));
+      }
+    } else {
+      while (++index < size) {
+        iterator(result, array[index], onlyOnce(callback));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function baseEachResult(object, result, iterator, callback, keys) {
+    var key;
+    var index = -1;
+    var size = keys.length;
+
+    if (iterator.length === 4) {
+      while (++index < size) {
+        key = keys[index];
+        iterator(result, object[key], key, onlyOnce(callback));
+      }
+    } else {
+      while (++index < size) {
+        iterator(result, object[keys[index]], onlyOnce(callback));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function symbolEachResult(collection, result, iterator, callback) {
+    var item;
+    var index = 0;
+    var iter = collection[iteratorSymbol]();
+
+    if (iterator.length === 4) {
+      while ((item = iter.next()).done === false) {
+        iterator(result, item.value, index++, onlyOnce(callback));
+      }
+    } else {
+      while ((item = iter.next()).done === false) {
+        index++;
+        iterator(result, item.value, onlyOnce(callback));
+      }
+    }
+    return index;
+  }
+
+  /**
+   * @private
+   */
+  function arrayEachFunc(array, createCallback) {
+    var index = -1;
+    var size = array.length;
+
+    while (++index < size) {
+      array[index](createCallback(index));
+    }
+  }
+
+  /**
+   * @private
+   */
+  function baseEachFunc(object, createCallback, keys) {
+    var key;
+    var index = -1;
+    var size = keys.length;
+
+    while (++index < size) {
+      key = keys[index];
+      object[key](createCallback(key));
+    }
+  }
+
+  /**
+   * @private
+   */
+  function arrayEachIndex(array, iterator, createCallback) {
+    var index = -1;
+    var size = array.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        iterator(array[index], index, createCallback(index));
+      }
+    } else {
+      while (++index < size) {
+        iterator(array[index], createCallback(index));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function baseEachIndex(object, iterator, createCallback, keys) {
+    var key;
+    var index = -1;
+    var size = keys.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        key = keys[index];
+        iterator(object[key], key, createCallback(index));
+      }
+    } else {
+      while (++index < size) {
+        iterator(object[keys[index]], createCallback(index));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function symbolEachIndex(collection, iterator, createCallback) {
+    var item;
+    var index = 0;
+    var iter = collection[iteratorSymbol]();
+
+    if (iterator.length === 3) {
+      while ((item = iter.next()).done === false) {
+        iterator(item.value, index, createCallback(index++));
+      }
+    } else {
+      while ((item = iter.next()).done === false) {
+        iterator(item.value, createCallback(index++));
+      }
+    }
+    return index;
+  }
+
+  /**
+   * @private
+   */
+  function baseEachKey(object, iterator, createCallback, keys) {
+    var key;
+    var index = -1;
+    var size = keys.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        key = keys[index];
+        iterator(object[key], key, createCallback(key));
+      }
+    } else {
+      while (++index < size) {
+        key = keys[index];
+        iterator(object[key], createCallback(key));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function symbolEachKey(collection, iterator, createCallback) {
+    var item;
+    var index = 0;
+    var iter = collection[iteratorSymbol]();
+
+    if (iterator.length === 3) {
+      while ((item = iter.next()).done === false) {
+        iterator(item.value, index, createCallback(index++));
+      }
+    } else {
+      while ((item = iter.next()).done === false) {
+        iterator(item.value, createCallback(index++));
+      }
+    }
+    return index;
+  }
+
+  /**
+   * @private
+   */
+  function arrayEachValue(array, iterator, createCallback) {
+    var value;
+    var index = -1;
+    var size = array.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        value = array[index];
+        iterator(value, index, createCallback(value));
+      }
+    } else {
+      while (++index < size) {
+        value = array[index];
+        iterator(value, createCallback(value));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function baseEachValue(object, iterator, createCallback, keys) {
+    var key, value;
+    var index = -1;
+    var size = keys.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        key = keys[index];
+        value = object[key];
+        iterator(value, key, createCallback(value));
+      }
+    } else {
+      while (++index < size) {
+        value = object[keys[index]];
+        iterator(value, createCallback(value));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function symbolEachValue(collection, iterator, createCallback) {
+    var value, item;
+    var index = 0;
+    var iter = collection[iteratorSymbol]();
+
+    if (iterator.length === 3) {
+      while ((item = iter.next()).done === false) {
+        value = item.value;
+        iterator(value, index++, createCallback(value));
+      }
+    } else {
+      while ((item = iter.next()).done === false) {
+        index++;
+        value = item.value;
+        iterator(value, createCallback(value));
+      }
+    }
+    return index;
+  }
+
+  /**
+   * @private
+   */
+  function arrayEachIndexValue(array, iterator, createCallback) {
+    var value;
+    var index = -1;
+    var size = array.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        value = array[index];
+        iterator(value, index, createCallback(index, value));
+      }
+    } else {
+      while (++index < size) {
+        value = array[index];
+        iterator(value, createCallback(index, value));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function baseEachIndexValue(object, iterator, createCallback, keys) {
+    var key, value;
+    var index = -1;
+    var size = keys.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        key = keys[index];
+        value = object[key];
+        iterator(value, key, createCallback(index, value));
+      }
+    } else {
+      while (++index < size) {
+        value = object[keys[index]];
+        iterator(value, createCallback(index, value));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function symbolEachIndexValue(collection, iterator, createCallback) {
+    var value, item;
+    var index = 0;
+    var iter = collection[iteratorSymbol]();
+
+    if (iterator.length === 3) {
+      while ((item = iter.next()).done === false) {
+        value = item.value;
+        iterator(value, index, createCallback(index++, value));
+      }
+    } else {
+      while ((item = iter.next()).done === false) {
+        value = item.value;
+        iterator(value, createCallback(index++, value));
+      }
+    }
+    return index;
+  }
+
+  /**
+   * @private
+   */
+  function baseEachKeyValue(object, iterator, createCallback, keys) {
+    var key, value;
+    var index = -1;
+    var size = keys.length;
+
+    if (iterator.length === 3) {
+      while (++index < size) {
+        key = keys[index];
+        value = object[key];
+        iterator(value, key, createCallback(key, value));
+      }
+    } else {
+      while (++index < size) {
+        key = keys[index];
+        value = object[key];
+        iterator(value, createCallback(key, value));
+      }
+    }
+  }
+
+  /**
+   * @private
+   */
+  function symbolEachKeyValue(collection, iterator, createCallback) {
+    var value, item;
+    var index = 0;
+    var iter = collection[iteratorSymbol]();
+
+    if (iterator.length === 3) {
+      while ((item = iter.next()).done === false) {
+        value = item.value;
+        iterator(value, index, createCallback(index++, value));
+      }
+    } else {
+      while ((item = iter.next()).done === false) {
+        value = item.value;
+        iterator(value, createCallback(index++, value));
+      }
+    }
+    return index;
+  }
+
+  /**
+   * @private
+   * @param {Function} func
+   */
+  function onlyOnce(func) {
+    return function(err, res) {
+      var fn = func;
+      func = throwError;
+      fn(err, res);
+    };
+  }
+
+  /**
+   * @private
+   * @param {Function} func
+   */
+  function once(func) {
+    return function(err, res) {
+      var fn = func;
+      func = noop;
+      fn(err, res);
+    };
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   */
+  function createEach(arrayEach, baseEach, symbolEach) {
+    return function each(collection, iterator, callback) {
+      callback = once(callback || noop);
+      var size, keys;
+      var completed = 0;
+      if (isArray(collection)) {
+        size = collection.length;
+        arrayEach(collection, iterator, done);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = symbolEach(collection, iterator, done);
+        size && size === completed && callback(null);
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        baseEach(collection, iterator, done, keys);
+      }
+      if (!size) {
+        callback(null);
+      }
+
+      function done(err, bool) {
+        if (err) {
+          callback = once(callback);
+          callback(err);
+        } else if (++completed === size) {
+          callback(null);
+        } else if (bool === false) {
+          callback = once(callback);
+          callback(null);
+        }
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   */
+  function createMap(arrayEach, baseEach, symbolEach, useArray) {
+    var init, clone;
+    if (useArray) {
+      init = Array;
+      clone = createArray;
+    } else {
+      init = function() {
+        return {};
+      };
+      clone = objectClone;
+    }
+
+    return function(collection, iterator, callback) {
+      callback = callback || noop;
+      var size, keys, result;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        result = init(size);
+        arrayEach(collection, iterator, createCallback);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        // TODO: size could be changed
+        result = init(0);
+        size = symbolEach(collection, iterator, createCallback);
+        size && size === completed && callback(null, result);
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        result = init(size);
+        baseEach(collection, iterator, createCallback, keys);
+      }
+      if (!size) {
+        callback(null, init());
+      }
+
+      function createCallback(key) {
+        return function done(err, res) {
+          if (key === null) {
+            throwError();
+          }
+          if (err) {
+            key = null;
+            callback = once(callback);
+            callback(err, clone(result));
+            return;
+          }
+          result[key] = res;
+          key = null;
+          if (++completed === size) {
+            callback(null, result);
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   * @param {boolean} bool
+   */
+  function createFilter(arrayEach, baseEach, symbolEach, bool) {
+    return function(collection, iterator, callback) {
+      callback = callback || noop;
+      var size, keys, result;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        result = Array(size);
+        arrayEach(collection, iterator, createCallback);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        result = [];
+        size = symbolEach(collection, iterator, createCallback);
+        size && size === completed && callback(null, compact(result));
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        result = Array(size);
+        baseEach(collection, iterator, createCallback, keys);
+      }
+      if (!size) {
+        return callback(null, []);
+      }
+
+      function createCallback(index, value) {
+        return function done(err, res) {
+          if (index === null) {
+            throwError();
+          }
+          if (err) {
+            index = null;
+            callback = once(callback);
+            callback(err);
+            return;
+          }
+          if (!!res === bool) {
+            result[index] = value;
+          }
+          index = null;
+          if (++completed === size) {
+            callback(null, compact(result));
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {boolean} bool
+   */
+  function createFilterSeries(bool) {
+    return function(collection, iterator, callback) {
+      callback = onlyOnce(callback || noop);
+      var size, key, value, keys, iter, item, iterate;
+      var sync = false;
+      var completed = 0;
+      var result = [];
+
+      if (isArray(collection)) {
+        size = collection.length;
+        iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = Infinity;
+        iter = collection[iteratorSymbol]();
+        iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+      }
+      if (!size) {
+        return callback(null, []);
+      }
+      iterate();
+
+      function arrayIterator() {
+        value = collection[completed];
+        iterator(value, done);
+      }
+
+      function arrayIteratorWithIndex() {
+        value = collection[completed];
+        iterator(value, completed, done);
+      }
+
+      function symbolIterator() {
+        item = iter.next();
+        value = item.value;
+        item.done ? callback(null, result) : iterator(value, done);
+      }
+
+      function symbolIteratorWithKey() {
+        item = iter.next();
+        value = item.value;
+        item.done ? callback(null, result) : iterator(value, completed, done);
+      }
+
+      function objectIterator() {
+        key = keys[completed];
+        value = collection[key];
+        iterator(value, done);
+      }
+
+      function objectIteratorWithKey() {
+        key = keys[completed];
+        value = collection[key];
+        iterator(value, key, done);
+      }
+
+      function done(err, res) {
+        if (err) {
+          callback(err);
+          return;
+        }
+        if (!!res === bool) {
+          result[result.length] = value;
+        }
+        if (++completed === size) {
+          iterate = throwError;
+          callback(null, result);
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {boolean} bool
+   */
+  function createFilterLimit(bool) {
+    return function(collection, limit, iterator, callback) {
+      callback = callback || noop;
+      var size, index, key, value, keys, iter, item, iterate, result;
+      var sync = false;
+      var started = 0;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = Infinity;
+        result = [];
+        iter = collection[iteratorSymbol]();
+        iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+      }
+      if (!size || isNaN(limit) || limit < 1) {
+        return callback(null, []);
+      }
+      result = result || Array(size);
+      timesSync(limit > size ? size : limit, iterate);
+
+      function arrayIterator() {
+        index = started++;
+        if (index < size) {
+          value = collection[index];
+          iterator(value, createCallback(value, index));
+        }
+      }
+
+      function arrayIteratorWithIndex() {
+        index = started++;
+        if (index < size) {
+          value = collection[index];
+          iterator(value, index, createCallback(value, index));
+        }
+      }
+
+      function symbolIterator() {
+        item = iter.next();
+        if (item.done === false) {
+          value = item.value;
+          iterator(value, createCallback(value, started++));
+        } else if (completed === started && iterator !== noop) {
+          iterator = noop;
+          callback(null, compact(result));
+        }
+      }
+
+      function symbolIteratorWithKey() {
+        item = iter.next();
+        if (item.done === false) {
+          value = item.value;
+          iterator(value, started, createCallback(value, started++));
+        } else if (completed === started && iterator !== noop) {
+          iterator = noop;
+          callback(null, compact(result));
+        }
+      }
+
+      function objectIterator() {
+        index = started++;
+        if (index < size) {
+          value = collection[keys[index]];
+          iterator(value, createCallback(value, index));
+        }
+      }
+
+      function objectIteratorWithKey() {
+        index = started++;
+        if (index < size) {
+          key = keys[index];
+          value = collection[key];
+          iterator(value, key, createCallback(value, index));
+        }
+      }
+
+      function createCallback(value, index) {
+        return function(err, res) {
+          if (index === null) {
+            throwError();
+          }
+          if (err) {
+            index = null;
+            iterate = noop;
+            callback = once(callback);
+            callback(err);
+            return;
+          }
+          if (!!res === bool) {
+            result[index] = value;
+          }
+          index = null;
+          if (++completed === size) {
+            callback = onlyOnce(callback);
+            callback(null, compact(result));
+          } else if (sync) {
+            nextTick(iterate);
+          } else {
+            sync = true;
+            iterate();
+          }
+          sync = false;
+        };
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace eachSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachSeries(array, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachSeries(array, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachSeries(object, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachSeries(object, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'b']]
+   * });
+   *
+   * @example
+   *
+   * // break
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num !== 3);
+   *   }, num * 10);
+   * };
+   * async.eachSeries(array, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 3]
+   * });
+   */
+  function eachSeries(collection, iterator, callback) {
+    callback = onlyOnce(callback || noop);
+    var size, key, keys, iter, item, iterate;
+    var sync = false;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null);
+    }
+    iterate();
+
+    function arrayIterator() {
+      iterator(collection[completed], done);
+    }
+
+    function arrayIteratorWithIndex() {
+      iterator(collection[completed], completed, done);
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      item.done ? callback(null) : iterator(item.value, done);
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      item.done ? callback(null) : iterator(item.value, completed, done);
+    }
+
+    function objectIterator() {
+      iterator(collection[keys[completed]], done);
+    }
+
+    function objectIteratorWithKey() {
+      key = keys[completed];
+      iterator(collection[key], key, done);
+    }
+
+    function done(err, bool) {
+      if (err) {
+        callback(err);
+      } else if (++completed === size || bool === false) {
+        iterate = throwError;
+        callback(null);
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace eachLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.eachLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   * @example
+   *
+   * // break
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num !== 5);
+   *   }, num * 10);
+   * };
+   * async.eachLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // undefined
+   *   console.log(order); // [1, 3, 5]
+   * });
+   *
+   */
+  function eachLimit(collection, limit, iterator, callback) {
+    callback = callback || noop;
+    var size, index, key, keys, iter, item, iterate;
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    } else {
+      return callback(null);
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null);
+    }
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      if (started < size) {
+        iterator(collection[started++], done);
+      }
+    }
+
+    function arrayIteratorWithIndex() {
+      index = started++;
+      if (index < size) {
+        iterator(collection[index], index, done);
+      }
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done === false) {
+        started++;
+        iterator(item.value, done);
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null);
+      }
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(item.value, started++, done);
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null);
+      }
+    }
+
+    function objectIterator() {
+      if (started < size) {
+        iterator(collection[keys[started++]], done);
+      }
+    }
+
+    function objectIteratorWithKey() {
+      index = started++;
+      if (index < size) {
+        key = keys[index];
+        iterator(collection[key], key, done);
+      }
+    }
+
+    function done(err, bool) {
+      if (err || bool === false) {
+        iterate = noop;
+        callback = once(callback);
+        callback(err);
+      } else if (++completed === size) {
+        iterator = noop;
+        iterate = throwError;
+        callback = onlyOnce(callback);
+        callback(null);
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace mapSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapSeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2];
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapSeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c']]
+   * });
+   *
+   */
+  function mapSeries(collection, iterator, callback) {
+    callback = callback || noop;
+    var size, key, keys, iter, item, result, iterate;
+    var sync = false;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      result = [];
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null, []);
+    }
+    result = result || Array(size);
+    iterate();
+
+    function arrayIterator() {
+      iterator(collection[completed], done);
+    }
+
+    function arrayIteratorWithIndex() {
+      iterator(collection[completed], completed, done);
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(item.value, done);
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(item.value, completed, done);
+    }
+
+    function objectIterator() {
+      iterator(collection[keys[completed]], done);
+    }
+
+    function objectIteratorWithKey() {
+      key = keys[completed];
+      iterator(collection[key], key, done);
+    }
+
+    function done(err, res) {
+      if (err) {
+        iterate = throwError;
+        callback = onlyOnce(callback);
+        callback(err, createArray(result));
+        return;
+      }
+      result[completed] = res;
+      if (++completed === size) {
+        iterate = throwError;
+        callback(null, result);
+        callback = throwError;
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace mapLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3, 4, 2]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3, 4, 2]
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3, 4, 2]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 5, 3, 4, 2]
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  function mapLimit(collection, limit, iterator, callback) {
+    callback = callback || noop;
+    var size, index, key, keys, iter, item, result, iterate;
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      result = [];
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null, []);
+    }
+    result = result || Array(size);
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      index = started++;
+      if (index < size) {
+        iterator(collection[index], createCallback(index));
+      }
+    }
+
+    function arrayIteratorWithIndex() {
+      index = started++;
+      if (index < size) {
+        iterator(collection[index], index, createCallback(index));
+      }
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(item.value, createCallback(started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(item.value, started, createCallback(started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function objectIterator() {
+      index = started++;
+      if (index < size) {
+        iterator(collection[keys[index]], createCallback(index));
+      }
+    }
+
+    function objectIteratorWithKey() {
+      index = started++;
+      if (index < size) {
+        key = keys[index];
+        iterator(collection[key], key, createCallback(index));
+      }
+    }
+
+    function createCallback(index) {
+      return function(err, res) {
+        if (index === null) {
+          throwError();
+        }
+        if (err) {
+          index = null;
+          iterate = noop;
+          callback = once(callback);
+          callback(err, createArray(result));
+          return;
+        }
+        result[index] = res;
+        index = null;
+        if (++completed === size) {
+          iterate = throwError;
+          callback(null, result);
+          callback = throwError;
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace mapValuesSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesSeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3, '2': 2 }
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesSeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3, '2': 2 }
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesSeries(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3, c: 2 }
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesSeries(object, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 3, c: 2 }
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c']]
+   * });
+   *
+   */
+  function mapValuesSeries(collection, iterator, callback) {
+    callback = callback || noop;
+    var size, key, keys, iter, item, iterate;
+    var sync = false;
+    var result = {};
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null, result);
+    }
+    iterate();
+
+    function arrayIterator() {
+      key = completed;
+      iterator(collection[completed], done);
+    }
+
+    function arrayIteratorWithIndex() {
+      key = completed;
+      iterator(collection[completed], completed, done);
+    }
+
+    function symbolIterator() {
+      key = completed;
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(item.value, done);
+    }
+
+    function symbolIteratorWithKey() {
+      key = completed;
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(item.value, completed, done);
+    }
+
+    function objectIterator() {
+      key = keys[completed];
+      iterator(collection[key], done);
+    }
+
+    function objectIteratorWithKey() {
+      key = keys[completed];
+      iterator(collection[key], key, done);
+    }
+
+    function done(err, res) {
+      if (err) {
+        iterate = throwError;
+        callback = onlyOnce(callback);
+        callback(err, objectClone(result));
+        return;
+      }
+      result[key] = res;
+      if (++completed === size) {
+        iterate = throwError;
+        callback(null, result);
+        callback = throwError;
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace mapValuesLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 5, '2': 3, '3': 4, '4': 2 }
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 5, '2': 3, '3': 4, '4': 2 }
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 5, c: 3, d: 4, e: 2 }
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.mapValuesLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 5, c: 3, d: 4, e: 2 }
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  function mapValuesLimit(collection, limit, iterator, callback) {
+    callback = callback || noop;
+    var size, index, key, keys, iter, item, iterate;
+    var sync = false;
+    var result = {};
+    var started = 0;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null, result);
+    }
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      index = started++;
+      if (index < size) {
+        iterator(collection[index], createCallback(index));
+      }
+    }
+
+    function arrayIteratorWithIndex() {
+      index = started++;
+      if (index < size) {
+        iterator(collection[index], index, createCallback(index));
+      }
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(item.value, createCallback(started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(item.value, started, createCallback(started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function objectIterator() {
+      index = started++;
+      if (index < size) {
+        key = keys[index];
+        iterator(collection[key], createCallback(key));
+      }
+    }
+
+    function objectIteratorWithKey() {
+      index = started++;
+      if (index < size) {
+        key = keys[index];
+        iterator(collection[key], key, createCallback(key));
+      }
+    }
+
+    function createCallback(key) {
+      return function(err, res) {
+        if (key === null) {
+          throwError();
+        }
+        if (err) {
+          key = null;
+          iterate = noop;
+          callback = once(callback);
+          callback(err, objectClone(result));
+          return;
+        }
+        result[key] = res;
+        key = null;
+        if (++completed === size) {
+          callback(null, result);
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   * @param {boolean} bool
+   */
+  function createDetect(arrayEach, baseEach, symbolEach, bool) {
+    return function(collection, iterator, callback) {
+      callback = callback || noop;
+      var size, keys;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        arrayEach(collection, iterator, createCallback);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = symbolEach(collection, iterator, createCallback);
+        size && size === completed && callback(null);
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        baseEach(collection, iterator, createCallback, keys);
+      }
+      if (!size) {
+        callback(null);
+      }
+
+      function createCallback(value) {
+        var called = false;
+        return function done(err, res) {
+          if (called) {
+            throwError();
+          }
+          called = true;
+          if (err) {
+            callback = once(callback);
+            callback(err);
+          } else if (!!res === bool) {
+            callback = once(callback);
+            callback(null, value);
+          } else if (++completed === size) {
+            callback(null);
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {boolean} bool
+   */
+  function createDetectSeries(bool) {
+    return function(collection, iterator, callback) {
+      callback = onlyOnce(callback || noop);
+      var size, key, value, keys, iter, item, iterate;
+      var sync = false;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = Infinity;
+        iter = collection[iteratorSymbol]();
+        iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+      }
+      if (!size) {
+        return callback(null);
+      }
+      iterate();
+
+      function arrayIterator() {
+        value = collection[completed];
+        iterator(value, done);
+      }
+
+      function arrayIteratorWithIndex() {
+        value = collection[completed];
+        iterator(value, completed, done);
+      }
+
+      function symbolIterator() {
+        item = iter.next();
+        value = item.value;
+        item.done ? callback(null) : iterator(value, done);
+      }
+
+      function symbolIteratorWithKey() {
+        item = iter.next();
+        value = item.value;
+        item.done ? callback(null) : iterator(value, completed, done);
+      }
+
+      function objectIterator() {
+        value = collection[keys[completed]];
+        iterator(value, done);
+      }
+
+      function objectIteratorWithKey() {
+        key = keys[completed];
+        value = collection[key];
+        iterator(value, key, done);
+      }
+
+      function done(err, res) {
+        if (err) {
+          callback(err);
+        } else if (!!res === bool) {
+          iterate = throwError;
+          callback(null, value);
+        } else if (++completed === size) {
+          iterate = throwError;
+          callback(null);
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {boolean} bool
+   */
+  function createDetectLimit(bool) {
+    return function(collection, limit, iterator, callback) {
+      callback = callback || noop;
+      var size, index, key, value, keys, iter, item, iterate;
+      var sync = false;
+      var started = 0;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = Infinity;
+        iter = collection[iteratorSymbol]();
+        iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+      }
+      if (!size || isNaN(limit) || limit < 1) {
+        return callback(null);
+      }
+      timesSync(limit > size ? size : limit, iterate);
+
+      function arrayIterator() {
+        index = started++;
+        if (index < size) {
+          value = collection[index];
+          iterator(value, createCallback(value));
+        }
+      }
+
+      function arrayIteratorWithIndex() {
+        index = started++;
+        if (index < size) {
+          value = collection[index];
+          iterator(value, index, createCallback(value));
+        }
+      }
+
+      function symbolIterator() {
+        item = iter.next();
+        if (item.done === false) {
+          started++;
+          value = item.value;
+          iterator(value, createCallback(value));
+        } else if (completed === started && iterator !== noop) {
+          iterator = noop;
+          callback(null);
+        }
+      }
+
+      function symbolIteratorWithKey() {
+        item = iter.next();
+        if (item.done === false) {
+          value = item.value;
+          iterator(value, started++, createCallback(value));
+        } else if (completed === started && iterator !== noop) {
+          iterator = noop;
+          callback(null);
+        }
+      }
+
+      function objectIterator() {
+        index = started++;
+        if (index < size) {
+          value = collection[keys[index]];
+          iterator(value, createCallback(value));
+        }
+      }
+
+      function objectIteratorWithKey() {
+        if (started < size) {
+          key = keys[started++];
+          value = collection[key];
+          iterator(value, key, createCallback(value));
+        }
+      }
+
+      function createCallback(value) {
+        var called = false;
+        return function(err, res) {
+          if (called) {
+            throwError();
+          }
+          called = true;
+          if (err) {
+            iterate = noop;
+            callback = once(callback);
+            callback(err);
+          } else if (!!res === bool) {
+            iterate = noop;
+            callback = once(callback);
+            callback(null, value);
+          } else if (++completed === size) {
+            callback(null);
+          } else if (sync) {
+            nextTick(iterate);
+          } else {
+            sync = true;
+            iterate();
+          }
+          sync = false;
+        };
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   * @param {boolean} bool
+   */
+  function createPick(arrayEach, baseEach, symbolEach, bool) {
+    return function(collection, iterator, callback) {
+      callback = callback || noop;
+      var size, keys;
+      var completed = 0;
+      var result = {};
+
+      if (isArray(collection)) {
+        size = collection.length;
+        arrayEach(collection, iterator, createCallback);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = symbolEach(collection, iterator, createCallback);
+        size && size === completed && callback(null, result);
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        baseEach(collection, iterator, createCallback, keys);
+      }
+      if (!size) {
+        return callback(null, {});
+      }
+
+      function createCallback(key, value) {
+        return function done(err, res) {
+          if (key === null) {
+            throwError();
+          }
+          if (err) {
+            key = null;
+            callback = once(callback);
+            callback(err, objectClone(result));
+            return;
+          }
+          if (!!res === bool) {
+            result[key] = value;
+          }
+          key = null;
+          if (++completed === size) {
+            callback(null, result);
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {boolean} bool
+   */
+  function createPickSeries(bool) {
+    return function(collection, iterator, callback) {
+      callback = onlyOnce(callback || noop);
+      var size, key, value, keys, iter, item, iterate;
+      var sync = false;
+      var result = {};
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = Infinity;
+        iter = collection[iteratorSymbol]();
+        iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+      }
+      if (!size) {
+        return callback(null, {});
+      }
+      iterate();
+
+      function arrayIterator() {
+        key = completed;
+        value = collection[completed];
+        iterator(value, done);
+      }
+
+      function arrayIteratorWithIndex() {
+        key = completed;
+        value = collection[completed];
+        iterator(value, completed, done);
+      }
+
+      function symbolIterator() {
+        key = completed;
+        item = iter.next();
+        value = item.value;
+        item.done ? callback(null, result) : iterator(value, done);
+      }
+
+      function symbolIteratorWithKey() {
+        key = completed;
+        item = iter.next();
+        value = item.value;
+        item.done ? callback(null, result) : iterator(value, key, done);
+      }
+
+      function objectIterator() {
+        key = keys[completed];
+        value = collection[key];
+        iterator(value, done);
+      }
+
+      function objectIteratorWithKey() {
+        key = keys[completed];
+        value = collection[key];
+        iterator(value, key, done);
+      }
+
+      function done(err, res) {
+        if (err) {
+          callback(err, result);
+          return;
+        }
+        if (!!res === bool) {
+          result[key] = value;
+        }
+        if (++completed === size) {
+          iterate = throwError;
+          callback(null, result);
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {boolean} bool
+   */
+  function createPickLimit(bool) {
+    return function(collection, limit, iterator, callback) {
+      callback = callback || noop;
+      var size, index, key, value, keys, iter, item, iterate;
+      var sync = false;
+      var result = {};
+      var started = 0;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = Infinity;
+        iter = collection[iteratorSymbol]();
+        iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+      }
+      if (!size || isNaN(limit) || limit < 1) {
+        return callback(null, {});
+      }
+      timesSync(limit > size ? size : limit, iterate);
+
+      function arrayIterator() {
+        index = started++;
+        if (index < size) {
+          value = collection[index];
+          iterator(value, createCallback(value, index));
+        }
+      }
+
+      function arrayIteratorWithIndex() {
+        index = started++;
+        if (index < size) {
+          value = collection[index];
+          iterator(value, index, createCallback(value, index));
+        }
+      }
+
+      function symbolIterator() {
+        item = iter.next();
+        if (item.done === false) {
+          value = item.value;
+          iterator(value, createCallback(value, started++));
+        } else if (completed === started && iterator !== noop) {
+          iterator = noop;
+          callback(null, result);
+        }
+      }
+
+      function symbolIteratorWithKey() {
+        item = iter.next();
+        if (item.done === false) {
+          value = item.value;
+          iterator(value, started, createCallback(value, started++));
+        } else if (completed === started && iterator !== noop) {
+          iterator = noop;
+          callback(null, result);
+        }
+      }
+
+      function objectIterator() {
+        if (started < size) {
+          key = keys[started++];
+          value = collection[key];
+          iterator(value, createCallback(value, key));
+        }
+      }
+
+      function objectIteratorWithKey() {
+        if (started < size) {
+          key = keys[started++];
+          value = collection[key];
+          iterator(value, key, createCallback(value, key));
+        }
+      }
+
+      function createCallback(value, key) {
+        return function(err, res) {
+          if (key === null) {
+            throwError();
+          }
+          if (err) {
+            key = null;
+            iterate = noop;
+            callback = once(callback);
+            callback(err, objectClone(result));
+            return;
+          }
+          if (!!res === bool) {
+            result[key] = value;
+          }
+          key = null;
+          if (++completed === size) {
+            iterate = throwError;
+            callback = onlyOnce(callback);
+            callback(null, result);
+          } else if (sync) {
+            nextTick(iterate);
+          } else {
+            sync = true;
+            iterate();
+          }
+          sync = false;
+        };
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace reduce
+   * @param {Array|Object} collection
+   * @param {*} result
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduce(collection, 0, iterator, function(err, res) {
+   *   console.log(res); // 10
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduce(collection, '', iterator, function(err, res) {
+   *   console.log(res); // '1324'
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduce(collection, '', iterator, function(err, res) {
+   *   console.log(res); // '1324'
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduce(collection, 0, iterator, function(err, res) {
+   *   console.log(res); // 10
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'b'], [4, 'd']]
+   * });
+   *
+   */
+  function reduce(collection, result, iterator, callback) {
+    callback = onlyOnce(callback || noop);
+    var size, key, keys, iter, item, iterate;
+    var sync = false;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 4 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 4 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 4 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null, result);
+    }
+    iterate(result);
+
+    function arrayIterator(result) {
+      iterator(result, collection[completed], done);
+    }
+
+    function arrayIteratorWithIndex(result) {
+      iterator(result, collection[completed], completed, done);
+    }
+
+    function symbolIterator(result) {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(result, item.value, done);
+    }
+
+    function symbolIteratorWithKey(result) {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(result, item.value, completed, done);
+    }
+
+    function objectIterator(result) {
+      iterator(result, collection[keys[completed]], done);
+    }
+
+    function objectIteratorWithKey(result) {
+      key = keys[completed];
+      iterator(result, collection[key], key, done);
+    }
+
+    function done(err, result) {
+      if (err) {
+        callback(err, result);
+      } else if (++completed === size) {
+        iterator = throwError;
+        callback(null, result);
+      } else if (sync) {
+        nextTick(function() {
+          iterate(result);
+        });
+      } else {
+        sync = true;
+        iterate(result);
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace reduceRight
+   * @param {Array|Object} collection
+   * @param {*} result
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduceRight(collection, 0, iterator, function(err, res) {
+   *   console.log(res); // 10
+   *   console.log(order); // [4, 2, 3, 1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduceRight(collection, '', iterator, function(err, res) {
+   *   console.log(res); // '4231'
+   *   console.log(order); // [[4, 3], [2, 2], [3, 1], [1, 0]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduceRight(collection, '', iterator, function(err, res) {
+   *   console.log(res); // '4231'
+   *   console.log(order); // [4, 2, 3, 1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, result + num);
+   *   }, num * 10);
+   * };
+   * async.reduceRight(collection, 0, iterator, function(err, res) {
+   *   console.log(res); // 10
+   *   console.log(order); // [[4, 3], [2, 2], [3, 1], [1, 0]]
+   * });
+   *
+   */
+  function reduceRight(collection, result, iterator, callback) {
+    callback = onlyOnce(callback || noop);
+    var resIndex, index, key, keys, iter, item, col, iterate;
+    var sync = false;
+
+    if (isArray(collection)) {
+      resIndex = collection.length;
+      iterate = iterator.length === 4 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      col = [];
+      iter = collection[iteratorSymbol]();
+      index = -1;
+      while ((item = iter.next()).done === false) {
+        col[++index] = item.value;
+      }
+      collection = col;
+      resIndex = col.length;
+      iterate = iterator.length === 4 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      resIndex = keys.length;
+      iterate = iterator.length === 4 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!resIndex) {
+      return callback(null, result);
+    }
+    iterate(result);
+
+    function arrayIterator(result) {
+      iterator(result, collection[--resIndex], done);
+    }
+
+    function arrayIteratorWithIndex(result) {
+      iterator(result, collection[--resIndex], resIndex, done);
+    }
+
+    function objectIterator(result) {
+      iterator(result, collection[keys[--resIndex]], done);
+    }
+
+    function objectIteratorWithKey(result) {
+      key = keys[--resIndex];
+      iterator(result, collection[key], key, done);
+    }
+
+    function done(err, result) {
+      if (err) {
+        callback(err, result);
+      } else if (resIndex === 0) {
+        iterate = throwError;
+        callback(null, result);
+      } else if (sync) {
+        nextTick(function() {
+          iterate(result);
+        });
+      } else {
+        sync = true;
+        iterate(result);
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   */
+  function createTransform(arrayEach, baseEach, symbolEach) {
+    return function transform(collection, accumulator, iterator, callback) {
+      if (arguments.length === 3) {
+        callback = iterator;
+        iterator = accumulator;
+        accumulator = undefined;
+      }
+      callback = callback || noop;
+      var size, keys, result;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        result = accumulator !== undefined ? accumulator : [];
+        arrayEach(collection, result, iterator, done);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        result = accumulator !== undefined ? accumulator : {};
+        size = symbolEach(collection, result, iterator, done);
+        size && size === completed && callback(null, result);
+      } else if (typeof collection === obj) {
+        keys = nativeKeys(collection);
+        size = keys.length;
+        result = accumulator !== undefined ? accumulator : {};
+        baseEach(collection, result, iterator, done, keys);
+      }
+      if (!size) {
+        callback(null, accumulator !== undefined ? accumulator : result || {});
+      }
+
+      function done(err, bool) {
+        if (err) {
+          callback = once(callback);
+          callback(err, isArray(result) ? createArray(result) : objectClone(result));
+        } else if (++completed === size) {
+          callback(null, result);
+        } else if (bool === false) {
+          callback = once(callback);
+          callback(null, isArray(result) ? createArray(result) : objectClone(result));
+        }
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace transformSeries
+   * @param {Array|Object} collection
+   * @param {Array|Object|Function} [accumulator]
+   * @param {Function} [iterator]
+   * @param {Function} [callback]
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     result.push(num)
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformSeries(collection, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2, 4]
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index and accumulator
+   * var order = [];
+   * var collection = [1, 3, 2, 4];
+   * var iterator = function(result, num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     result[index] = num;
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformSeries(collection, {}, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 3, '2': 2, '3': 4 }
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object with accumulator
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     result.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformSeries(collection, [], iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2, 4]
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2, d: 4 };
+   * var iterator = function(result, num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     result[key] = num;
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformSeries(collection, iterator, function(err, res) {
+   *   console.log(res); //  { a: 1, b: 3, c: 2, d: 4 }
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'b'], [4, 'd']]
+   * });
+   *
+   */
+  function transformSeries(collection, accumulator, iterator, callback) {
+    if (arguments.length === 3) {
+      callback = iterator;
+      iterator = accumulator;
+      accumulator = undefined;
+    }
+    callback = onlyOnce(callback || noop);
+    var size, key, keys, iter, item, iterate, result;
+    var sync = false;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      result = accumulator !== undefined ? accumulator : [];
+      iterate = iterator.length === 4 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      result = accumulator !== undefined ? accumulator : {};
+      iterate = iterator.length === 4 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      result = accumulator !== undefined ? accumulator : {};
+      iterate = iterator.length === 4 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null, accumulator !== undefined ? accumulator : result || {});
+    }
+    iterate();
+
+    function arrayIterator() {
+      iterator(result, collection[completed], done);
+    }
+
+    function arrayIteratorWithIndex() {
+      iterator(result, collection[completed], completed, done);
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(result, item.value, done);
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(result, item.value, completed, done);
+    }
+
+    function objectIterator() {
+      iterator(result, collection[keys[completed]], done);
+    }
+
+    function objectIteratorWithKey() {
+      key = keys[completed];
+      iterator(result, collection[key], key, done);
+    }
+
+    function done(err, bool) {
+      if (err) {
+        callback(err, result);
+      } else if (++completed === size || bool === false) {
+        iterate = throwError;
+        callback(null, result);
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace transformLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Array|Object|Function} [accumulator]
+   * @param {Function} [iterator]
+   * @param {Function} [callback]
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     result.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 5, 2, 4]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index and accumulator
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(result, num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     result[index] = key;
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformLimit(array, 2, {}, iterator, function(err, res) {
+   *   console.log(res); // { '0': 1, '1': 5, '2': 3, '3': 4, '4': 2 }
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object with accumulator
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(result, num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     result.push(num);
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformLimit(object, 2, [], iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 5, 2, 4]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(result, num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     result[key] = num;
+   *     done();
+   *   }, num * 10);
+   * };
+   * async.transformLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  function transformLimit(collection, limit, accumulator, iterator, callback) {
+    if (arguments.length === 4) {
+      callback = iterator;
+      iterator = accumulator;
+      accumulator = undefined;
+    }
+    callback = callback || noop;
+    var size, index, key, keys, iter, item, iterate, result;
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      result = accumulator !== undefined ? accumulator : [];
+      iterate = iterator.length === 4 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      result = accumulator !== undefined ? accumulator : {};
+      iterate = iterator.length === 4 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      result = accumulator !== undefined ? accumulator : {};
+      iterate = iterator.length === 4 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null, accumulator !== undefined ? accumulator : result || {});
+    }
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      index = started++;
+      if (index < size) {
+        iterator(result, collection[index], onlyOnce(done));
+      }
+    }
+
+    function arrayIteratorWithIndex() {
+      index = started++;
+      if (index < size) {
+        iterator(result, collection[index], index, onlyOnce(done));
+      }
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done === false) {
+        started++;
+        iterator(result, item.value, onlyOnce(done));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(result, item.value, started++, onlyOnce(done));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function objectIterator() {
+      index = started++;
+      if (index < size) {
+        iterator(result, collection[keys[index]], onlyOnce(done));
+      }
+    }
+
+    function objectIteratorWithKey() {
+      index = started++;
+      if (index < size) {
+        key = keys[index];
+        iterator(result, collection[key], key, onlyOnce(done));
+      }
+    }
+
+    function done(err, bool) {
+      if (err || bool === false) {
+        iterate = noop;
+        callback(err || null, isArray(result) ? createArray(result) : objectClone(result));
+        callback = noop;
+      } else if (++completed === size) {
+        iterator = noop;
+        callback(null, result);
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @private
+   * @param {function} arrayEach
+   * @param {function} baseEach
+   * @param {function} symbolEach
+   */
+  function createSortBy(arrayEach, baseEach, symbolEach) {
+    return function sortBy(collection, iterator, callback) {
+      callback = callback || noop;
+      var size, array, criteria;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        array = Array(size);
+        criteria = Array(size);
+        arrayEach(collection, iterator, createCallback);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        array = [];
+        criteria = [];
+        size = symbolEach(collection, iterator, createCallback);
+        size && size === completed && callback(null, sortByCriteria(array, criteria));
+      } else if (typeof collection === obj) {
+        var keys = nativeKeys(collection);
+        size = keys.length;
+        array = Array(size);
+        criteria = Array(size);
+        baseEach(collection, iterator, createCallback, keys);
+      }
+      if (!size) {
+        callback(null, []);
+      }
+
+      function createCallback(index, value) {
+        var called = false;
+        array[index] = value;
+        return function done(err, criterion) {
+          if (called) {
+            throwError();
+          }
+          called = true;
+          criteria[index] = criterion;
+          if (err) {
+            callback = once(callback);
+            callback(err);
+          } else if (++completed === size) {
+            callback(null, sortByCriteria(array, criteria));
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace sortBySeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBySeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3];
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBySeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBySeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortBySeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3]
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c']]
+   * });
+   *
+   */
+  function sortBySeries(collection, iterator, callback) {
+    callback = onlyOnce(callback || noop);
+    var size, key, value, keys, iter, item, array, criteria, iterate;
+    var sync = false;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      array = collection;
+      criteria = Array(size);
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      array = [];
+      criteria = [];
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      array = Array(size);
+      criteria = Array(size);
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null, []);
+    }
+    iterate();
+
+    function arrayIterator() {
+      value = collection[completed];
+      iterator(value, done);
+    }
+
+    function arrayIteratorWithIndex() {
+      value = collection[completed];
+      iterator(value, completed, done);
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done) {
+        return callback(null, sortByCriteria(array, criteria));
+      }
+      value = item.value;
+      array[completed] = value;
+      iterator(value, done);
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done) {
+        return callback(null, sortByCriteria(array, criteria));
+      }
+      value = item.value;
+      array[completed] = value;
+      iterator(value, completed, done);
+    }
+
+    function objectIterator() {
+      value = collection[keys[completed]];
+      array[completed] = value;
+      iterator(value, done);
+    }
+
+    function objectIteratorWithKey() {
+      key = keys[completed];
+      value = collection[key];
+      array[completed] = value;
+      iterator(value, key, done);
+    }
+
+    function done(err, criterion) {
+      criteria[completed] = criterion;
+      if (err) {
+        callback(err);
+      } else if (++completed === size) {
+        iterate = throwError;
+        callback(null, sortByCriteria(array, criteria));
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace sortByLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortByLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4, 5]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortByLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4, 5]
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortByLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4, 5]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.sortByLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4, 5]
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  function sortByLimit(collection, limit, iterator, callback) {
+    callback = callback || noop;
+    var size, index, key, value, array, keys, iter, item, criteria, iterate;
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      array = collection;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      array = [];
+      criteria = [];
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      array = Array(size);
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null, []);
+    }
+    criteria = criteria || Array(size);
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      if (started < size) {
+        value = collection[started];
+        iterator(value, createCallback(value, started++));
+      }
+    }
+
+    function arrayIteratorWithIndex() {
+      index = started++;
+      if (index < size) {
+        value = collection[index];
+        iterator(value, index, createCallback(value, index));
+      }
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done === false) {
+        value = item.value;
+        array[started] = value;
+        iterator(value, createCallback(value, started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, sortByCriteria(array, criteria));
+      }
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done === false) {
+        value = item.value;
+        array[started] = value;
+        iterator(value, started, createCallback(value, started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, sortByCriteria(array, criteria));
+      }
+    }
+
+    function objectIterator() {
+      if (started < size) {
+        value = collection[keys[started]];
+        array[started] = value;
+        iterator(value, createCallback(value, started++));
+      }
+    }
+
+    function objectIteratorWithKey() {
+      if (started < size) {
+        key = keys[started];
+        value = collection[key];
+        array[started] = value;
+        iterator(value, key, createCallback(value, started++));
+      }
+    }
+
+    function createCallback(value, index) {
+      var called = false;
+      return function(err, criterion) {
+        if (called) {
+          throwError();
+        }
+        called = true;
+        criteria[index] = criterion;
+        if (err) {
+          iterate = noop;
+          callback(err);
+          callback = noop;
+        } else if (++completed === size) {
+          callback(null, sortByCriteria(array, criteria));
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace some
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.some(array, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.some(array, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [[1, 0]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.some(object, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.some(object, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [[1, 'a']]
+   * });
+   *
+   */
+  function some(collection, iterator, callback) {
+    callback = callback || noop;
+    detect(collection, iterator, done);
+
+    function done(err, res) {
+      if (err) {
+        return callback(err);
+      }
+      callback(null, !!res);
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace someSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someSeries(array, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someSeries(array, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [[1, 0]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someSeries(object, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someSeries(object, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [[1, 'a']]
+   * });
+   *
+   */
+  function someSeries(collection, iterator, callback) {
+    callback = callback || noop;
+    detectSeries(collection, iterator, done);
+
+    function done(err, res) {
+      if (err) {
+        return callback(err);
+      }
+      callback(null, !!res);
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace someLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [[1, 0]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num % 2);
+   *   }, num * 10);
+   * };
+   * async.someLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // true
+   *   console.log(order); // [[1, 'a']]
+   * });
+   *
+   */
+  function someLimit(collection, limit, iterator, callback) {
+    callback = callback || noop;
+    detectLimit(collection, limit, iterator, done);
+
+    function done(err, res) {
+      if (err) {
+        return callback(err);
+      }
+      callback(null, !!res);
+    }
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   */
+  function createEvery(arrayEach, baseEach, symbolEach) {
+    var deny = createDetect(arrayEach, baseEach, symbolEach, false);
+
+    return function every(collection, iterator, callback) {
+      callback = callback || noop;
+      deny(collection, iterator, done);
+
+      function done(err, res) {
+        if (err) {
+          return callback(err);
+        }
+        callback(null, !res);
+      }
+    };
+  }
+
+  /**
+   * @private
+   */
+  function createEverySeries() {
+    var denySeries = createDetectSeries(false);
+
+    return function everySeries(collection, iterator, callback) {
+      callback = callback || noop;
+      denySeries(collection, iterator, done);
+
+      function done(err, res) {
+        if (err) {
+          return callback(err);
+        }
+        callback(null, !res);
+      }
+    };
+  }
+
+  /**
+   * @private
+   */
+  function createEveryLimit() {
+    var denyLimit = createDetectLimit(false);
+
+    return function everyLimit(collection, limit, iterator, callback) {
+      callback = callback || noop;
+      denyLimit(collection, limit, iterator, done);
+
+      function done(err, res) {
+        if (err) {
+          return callback(err);
+        }
+        callback(null, !res);
+      }
+    };
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   */
+  function createConcat(arrayEach, baseEach, symbolEach) {
+    return function concat(collection, iterator, callback) {
+      callback = callback || noop;
+      var size, result;
+      var completed = 0;
+
+      if (isArray(collection)) {
+        size = collection.length;
+        result = Array(size);
+        arrayEach(collection, iterator, createCallback);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        result = [];
+        size = symbolEach(collection, iterator, createCallback);
+        size && size === completed && callback(null, result);
+      } else if (typeof collection === obj) {
+        var keys = nativeKeys(collection);
+        size = keys.length;
+        result = Array(size);
+        baseEach(collection, iterator, createCallback, keys);
+      }
+      if (!size) {
+        callback(null, []);
+      }
+
+      function createCallback(index) {
+        return function done(err, res) {
+          if (index === null) {
+            throwError();
+          }
+          if (err) {
+            index = null;
+            callback = once(callback);
+            arrayEachSync(result, function(array, index) {
+              if (array === undefined) {
+                result[index] = noop;
+              }
+            });
+            callback(err, makeConcatResult(result));
+            return;
+          }
+          switch (arguments.length) {
+            case 0:
+            case 1:
+              result[index] = noop;
+              break;
+            case 2:
+              result[index] = res;
+              break;
+            default:
+              result[index] = slice(arguments, 1);
+              break;
+          }
+          index = null;
+          if (++completed === size) {
+            callback(null, makeConcatResult(result));
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace concatSeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concatSeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2];
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 3, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concatSeries(array, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [[1, 0], [3, 1], [2, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concatSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [1, 3, 2]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 3, c: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concatSeries(object, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 2]
+   *   console.log(order); // [[1, 'a'], [3, 'b'], [2, 'c']]
+   * });
+   *
+   */
+  function concatSeries(collection, iterator, callback) {
+    callback = onlyOnce(callback || noop);
+    var size, key, keys, iter, item, iterate;
+    var sync = false;
+    var result = [];
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null, result);
+    }
+    iterate();
+
+    function arrayIterator() {
+      iterator(collection[completed], done);
+    }
+
+    function arrayIteratorWithIndex() {
+      iterator(collection[completed], completed, done);
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(item.value, done);
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      item.done ? callback(null, result) : iterator(item.value, completed, done);
+    }
+
+    function objectIterator() {
+      iterator(collection[keys[completed]], done);
+    }
+
+    function objectIteratorWithKey() {
+      key = keys[completed];
+      iterator(collection[key], key, done);
+    }
+
+    function done(err, array) {
+      if (isArray(array)) {
+        nativePush.apply(result, array);
+      } else if (arguments.length >= 2) {
+        nativePush.apply(result, slice(arguments, 1));
+      }
+      if (err) {
+        callback(err, result);
+      } else if (++completed === size) {
+        iterate = throwError;
+        callback(null, result);
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace concatLimit
+   * @param {Array|Object} collection
+   * @param {number} limit - limit >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concatLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 5, 2, 4]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1, 5, 3, 4, 2];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.cocnatLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 5, 2, 4]
+   *   console.log(order); // [[1, 0], [3, 2], [5, 1], [2, 4], [4, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, [num]);
+   *   }, num * 10);
+   * };
+   * async.concatLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 5, 2, 4]
+   *   console.log(order); // [1, 3, 5, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1, b: 5, c: 3, d: 4, e: 2 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, num);
+   *   }, num * 10);
+   * };
+   * async.cocnatLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // [1, 3, 5, 2, 4]
+   *   console.log(order); // [[1, 'a'], [3, 'c'], [5, 'b'], [2, 'e'], [4, 'd']]
+   * });
+   *
+   */
+  function concatLimit(collection, limit, iterator, callback) {
+    callback = callback || noop;
+    var size, key, iter, item, iterate, result;
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      result = [];
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      var keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null, []);
+    }
+    result = result || Array(size);
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      if (started < size) {
+        iterator(collection[started], createCallback(started++));
+      }
+    }
+
+    function arrayIteratorWithIndex() {
+      if (started < size) {
+        iterator(collection[started], started, createCallback(started++));
+      }
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(item.value, createCallback(started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, makeConcatResult(result));
+      }
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done === false) {
+        iterator(item.value, started, createCallback(started++));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, makeConcatResult(result));
+      }
+    }
+
+    function objectIterator() {
+      if (started < size) {
+        iterator(collection[keys[started]], createCallback(started++));
+      }
+    }
+
+    function objectIteratorWithKey() {
+      if (started < size) {
+        key = keys[started];
+        iterator(collection[key], key, createCallback(started++));
+      }
+    }
+
+    function createCallback(index) {
+      return function(err, res) {
+        if (index === null) {
+          throwError();
+        }
+        if (err) {
+          index = null;
+          iterate = noop;
+          callback = once(callback);
+          arrayEachSync(result, function(array, index) {
+            if (array === undefined) {
+              result[index] = noop;
+            }
+          });
+          callback(err, makeConcatResult(result));
+          return;
+        }
+        switch (arguments.length) {
+          case 0:
+          case 1:
+            result[index] = noop;
+            break;
+          case 2:
+            result[index] = res;
+            break;
+          default:
+            result[index] = slice(arguments, 1);
+            break;
+        }
+        index = null;
+        if (++completed === size) {
+          iterate = throwError;
+          callback(null, makeConcatResult(result));
+          callback = throwError;
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   * @param {Function} symbolEach
+   */
+  function createGroupBy(arrayEach, baseEach, symbolEach) {
+    return function groupBy(collection, iterator, callback) {
+      callback = callback || noop;
+      var size;
+      var completed = 0;
+      var result = {};
+
+      if (isArray(collection)) {
+        size = collection.length;
+        arrayEach(collection, iterator, createCallback);
+      } else if (!collection) {
+      } else if (iteratorSymbol && collection[iteratorSymbol]) {
+        size = symbolEach(collection, iterator, createCallback);
+        size && size === completed && callback(null, result);
+      } else if (typeof collection === obj) {
+        var keys = nativeKeys(collection);
+        size = keys.length;
+        baseEach(collection, iterator, createCallback, keys);
+      }
+      if (!size) {
+        callback(null, {});
+      }
+
+      function createCallback(value) {
+        var called = false;
+        return function done(err, key) {
+          if (called) {
+            throwError();
+          }
+          called = true;
+          if (err) {
+            callback = once(callback);
+            callback(err, objectClone(result));
+            return;
+          }
+          var array = result[key];
+          if (!array) {
+            result[key] = [value];
+          } else {
+            array.push(value);
+          }
+          if (++completed === size) {
+            callback(null, result);
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace groupBySeries
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [4.2, 6.4, 6.1];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBySeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.4, 6.1] }
+   *   console.log(order); // [4.2, 6.4, 6.1]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [4.2, 6.4, 6.1];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBySeries(array, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.4, 6.1] }
+   *   console.log(order); // [[4.2, 0], [6.4, 1], [6.1, 2]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 4.2, b: 6.4, c: 6.1 };
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBySeries(object, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.4, 6.1] }
+   *   console.log(order); // [4.2, 6.4, 6.1]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 4.2, b: 6.4, c: 6.1 };
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupBySeries(object, iterator, function(err, res) {
+   *   console.log(res); // { '4': [4.2], '6': [6.4, 6.1] }
+   *   console.log(order); // [[4.2, 'a'], [6.4, 'b'], [6.1, 'c']]
+   * });
+   *
+   */
+  function groupBySeries(collection, iterator, callback) {
+    callback = onlyOnce(callback || noop);
+    var size, key, value, keys, iter, item, iterate;
+    var sync = false;
+    var completed = 0;
+    var result = {};
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size) {
+      return callback(null, result);
+    }
+    iterate();
+
+    function arrayIterator() {
+      value = collection[completed];
+      iterator(value, done);
+    }
+
+    function arrayIteratorWithIndex() {
+      value = collection[completed];
+      iterator(value, completed, done);
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      value = item.value;
+      item.done ? callback(null, result) : iterator(value, done);
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      value = item.value;
+      item.done ? callback(null, result) : iterator(value, completed, done);
+    }
+
+    function objectIterator() {
+      value = collection[keys[completed]];
+      iterator(value, done);
+    }
+
+    function objectIteratorWithKey() {
+      key = keys[completed];
+      value = collection[key];
+      iterator(value, key, done);
+    }
+
+    function done(err, key) {
+      if (err) {
+        iterate = throwError;
+        callback = onlyOnce(callback);
+        callback(err, objectClone(result));
+        return;
+      }
+      var array = result[key];
+      if (!array) {
+        result[key] = [value];
+      } else {
+        array.push(value);
+      }
+      if (++completed === size) {
+        iterate = throwError;
+        callback(null, result);
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace groupByLimit
+   * @param {Array|Object} collection
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var order = [];
+   * var array = [1.1, 5.9, 3.2, 3.9, 2.1];
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupByLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '1': [1.1], '3': [3.2, 3.9], '5': [5.9], '2': [2.1] }
+   *   console.log(order); // [1.1, 3.2, 5.9, 2.1, 3.9]
+   * });
+   *
+   * @example
+   *
+   * // array with index
+   * var order = [];
+   * var array = [1.1, 5.9, 3.2, 3.9, 2.1];
+   * var iterator = function(num, index, done) {
+   *   setTimeout(function() {
+   *     order.push([num, index]);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupByLimit(array, 2, iterator, function(err, res) {
+   *   console.log(res); // { '1': [1.1], '3': [3.2, 3.9], '5': [5.9], '2': [2.1] }
+   *   console.log(order); // [[1.1, 0], [3.2, 2], [5.9, 1], [2.1, 4], [3.9, 3]]
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var order = [];
+   * var object = { a: 1.1, b: 5.9, c: 3.2, d: 3.9, e: 2.1 }
+   * var iterator = function(num, done) {
+   *   setTimeout(function() {
+   *     order.push(num);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupByLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { '1': [1.1], '3': [3.2, 3.9], '5': [5.9], '2': [2.1] }
+   *   console.log(order); // [1.1, 3.2, 5.9, 2.1, 3.9]
+   * });
+   *
+   * @example
+   *
+   * // object with key
+   * var order = [];
+   * var object = { a: 1.1, b: 5.9, c: 3.2, d: 3.9, e: 2.1 }
+   * var iterator = function(num, key, done) {
+   *   setTimeout(function() {
+   *     order.push([num, key]);
+   *     done(null, Math.floor(num));
+   *   }, num * 10);
+   * };
+   * async.groupByLimit(object, 2, iterator, function(err, res) {
+   *   console.log(res); // { '1': [1.1], '3': [3.2, 3.9], '5': [5.9], '2': [2.1] }
+   *   console.log(order); // [[1.1, 'a'], [3.2, 'c'], [5.9, 'b'], [2.1, 'e'], [3.9, 'd']]
+   * });
+   *
+   */
+  function groupByLimit(collection, limit, iterator, callback) {
+    callback = callback || noop;
+    var size, index, key, value, keys, iter, item, iterate;
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+    var result = {};
+
+    if (isArray(collection)) {
+      size = collection.length;
+      iterate = iterator.length === 3 ? arrayIteratorWithIndex : arrayIterator;
+    } else if (!collection) {
+    } else if (iteratorSymbol && collection[iteratorSymbol]) {
+      size = Infinity;
+      iter = collection[iteratorSymbol]();
+      iterate = iterator.length === 3 ? symbolIteratorWithKey : symbolIterator;
+    } else if (typeof collection === obj) {
+      keys = nativeKeys(collection);
+      size = keys.length;
+      iterate = iterator.length === 3 ? objectIteratorWithKey : objectIterator;
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null, result);
+    }
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      if (started < size) {
+        value = collection[started++];
+        iterator(value, createCallback(value));
+      }
+    }
+
+    function arrayIteratorWithIndex() {
+      index = started++;
+      if (index < size) {
+        value = collection[index];
+        iterator(value, index, createCallback(value));
+      }
+    }
+
+    function symbolIterator() {
+      item = iter.next();
+      if (item.done === false) {
+        started++;
+        value = item.value;
+        iterator(value, createCallback(value));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function symbolIteratorWithKey() {
+      item = iter.next();
+      if (item.done === false) {
+        value = item.value;
+        iterator(value, started++, createCallback(value));
+      } else if (completed === started && iterator !== noop) {
+        iterator = noop;
+        callback(null, result);
+      }
+    }
+
+    function objectIterator() {
+      if (started < size) {
+        value = collection[keys[started++]];
+        iterator(value, createCallback(value));
+      }
+    }
+
+    function objectIteratorWithKey() {
+      if (started < size) {
+        key = keys[started++];
+        value = collection[key];
+        iterator(value, key, createCallback(value));
+      }
+    }
+
+    function createCallback(value) {
+      var called = false;
+      return function(err, key) {
+        if (called) {
+          throwError();
+        }
+        called = true;
+        if (err) {
+          iterate = noop;
+          callback = once(callback);
+          callback(err, objectClone(result));
+          return;
+        }
+        var array = result[key];
+        if (!array) {
+          result[key] = [value];
+        } else {
+          array.push(value);
+        }
+        if (++completed === size) {
+          callback(null, result);
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * @private
+   * @param {Function} arrayEach
+   * @param {Function} baseEach
+   */
+  function createParallel(arrayEach, baseEach) {
+    return function parallel(tasks, callback) {
+      callback = callback || noop;
+      var size, keys, result;
+      var completed = 0;
+
+      if (isArray(tasks)) {
+        size = tasks.length;
+        result = Array(size);
+        arrayEach(tasks, createCallback);
+      } else if (tasks && typeof tasks === obj) {
+        keys = nativeKeys(tasks);
+        size = keys.length;
+        result = {};
+        baseEach(tasks, createCallback, keys);
+      }
+      if (!size) {
+        callback(null, result);
+      }
+
+      function createCallback(key) {
+        return function(err, res) {
+          if (key === null) {
+            throwError();
+          }
+          if (err) {
+            key = null;
+            callback = once(callback);
+            callback(err, result);
+            return;
+          }
+          result[key] = arguments.length <= 2 ? res : slice(arguments, 1);
+          key = null;
+          if (++completed === size) {
+            callback(null, result);
+          }
+        };
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace series
+   * @param {Array|Object} tasks - functions
+   * @param {Function} callback
+   * @example
+   *
+   * var order = [];
+   * var tasks = [
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(1);
+   *      done(null, 1);
+   *    }, 10);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(2);
+   *      done(null, 2);
+   *    }, 30);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(3);
+   *      done(null, 3);
+   *    }, 40);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(4);
+   *      done(null, 4);
+   *    }, 20);
+   *  }
+   * ];
+   * async.series(tasks, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4];
+   *   console.log(order); // [1, 2, 3, 4]
+   * });
+   *
+   * @example
+   *
+   * var order = [];
+   * var tasks = {
+   *   'a': function(done) {
+   *     setTimeout(function() {
+   *       order.push(1);
+   *       done(null, 1);
+   *     }, 10);
+   *   },
+   *   'b': function(done) {
+   *     setTimeout(function() {
+   *       order.push(2);
+   *       done(null, 2);
+   *     }, 30);
+   *   },
+   *   'c': function(done) {
+   *     setTimeout(function() {
+   *       order.push(3);
+   *       done(null, 3);
+   *     }, 40);
+   *   },
+   *   'd': function(done) {
+   *     setTimeout(function() {
+   *       order.push(4);
+   *       done(null, 4);
+   *     }, 20);
+   *   }
+   * };
+   * async.series(tasks, function(err, res) {
+   *   console.log(res); // { a: 1, b: 2, c: 3, d:4 }
+   *   console.log(order); // [1, 4, 2, 3]
+   * });
+   *
+   */
+  function series(tasks, callback) {
+    callback = callback || noop;
+    var size, key, keys, result, iterate;
+    var sync = false;
+    var completed = 0;
+
+    if (isArray(tasks)) {
+      size = tasks.length;
+      result = Array(size);
+      iterate = arrayIterator;
+    } else if (tasks && typeof tasks === obj) {
+      keys = nativeKeys(tasks);
+      size = keys.length;
+      result = {};
+      iterate = objectIterator;
+    } else {
+      return callback(null);
+    }
+    if (!size) {
+      return callback(null, result);
+    }
+    iterate();
+
+    function arrayIterator() {
+      key = completed;
+      tasks[completed](done);
+    }
+
+    function objectIterator() {
+      key = keys[completed];
+      tasks[key](done);
+    }
+
+    function done(err, res) {
+      if (err) {
+        iterate = throwError;
+        callback = onlyOnce(callback);
+        callback(err, result);
+        return;
+      }
+      result[key] = arguments.length <= 2 ? res : slice(arguments, 1);
+      if (++completed === size) {
+        iterate = throwError;
+        callback(null, result);
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace parallelLimit
+   * @param {Array|Object} tasks - functions
+   * @param {number} limit - limit >= 1
+   * @param {Function} callback
+   * @example
+   *
+   * var order = [];
+   * var tasks = [
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(1);
+   *      done(null, 1);
+   *    }, 10);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(2);
+   *      done(null, 2);
+   *    }, 50);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(3);
+   *      done(null, 3);
+   *    }, 30);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      order.push(4);
+   *      done(null, 4);
+   *    }, 40);
+   *  }
+   * ];
+   * async.parallelLimit(tasks, 2, function(err, res) {
+   *   console.log(res); // [1, 2, 3, 4];
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   * @example
+   *
+   * var order = [];
+   * var tasks = {
+   *   'a': function(done) {
+   *     setTimeout(function() {
+   *       order.push(1);
+   *       done(null, 1);
+   *     }, 10);
+   *   },
+   *   'b': function(done) {
+   *     setTimeout(function() {
+   *       order.push(2);
+   *       done(null, 2);
+   *     }, 50);
+   *   },
+   *   'c': function(done) {
+   *     setTimeout(function() {
+   *       order.push(3);
+   *       done(null, 3);
+   *     }, 20);
+   *   },
+   *   'd': function(done) {
+   *     setTimeout(function() {
+   *       order.push(4);
+   *       done(null, 4);
+   *     }, 40);
+   *   }
+   * };
+   * async.parallelLimit(tasks, 2, function(err, res) {
+   *   console.log(res); // { a: 1, b: 2, c: 3, d:4 }
+   *   console.log(order); // [1, 3, 2, 4]
+   * });
+   *
+   */
+  function parallelLimit(tasks, limit, callback) {
+    callback = callback || noop;
+    var size, index, key, keys, result, iterate;
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+
+    if (isArray(tasks)) {
+      size = tasks.length;
+      result = Array(size);
+      iterate = arrayIterator;
+    } else if (tasks && typeof tasks === obj) {
+      keys = nativeKeys(tasks);
+      size = keys.length;
+      result = {};
+      iterate = objectIterator;
+    }
+    if (!size || isNaN(limit) || limit < 1) {
+      return callback(null, result);
+    }
+    timesSync(limit > size ? size : limit, iterate);
+
+    function arrayIterator() {
+      index = started++;
+      if (index < size) {
+        tasks[index](createCallback(index));
+      }
+    }
+
+    function objectIterator() {
+      if (started < size) {
+        key = keys[started++];
+        tasks[key](createCallback(key));
+      }
+    }
+
+    function createCallback(key) {
+      return function(err, res) {
+        if (key === null) {
+          throwError();
+        }
+        if (err) {
+          key = null;
+          iterate = noop;
+          callback = once(callback);
+          callback(err, result);
+          return;
+        }
+        result[key] = arguments.length <= 2 ? res : slice(arguments, 1);
+        key = null;
+        if (++completed === size) {
+          callback(null, result);
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace tryEach
+   * @param {Array|Object} tasks - functions
+   * @param {Function} callback
+   * @example
+   *
+   * var tasks = [
+   *  function(done) {
+   *    setTimeout(function() {
+   *      done(new Error('error'));
+   *    }, 10);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      done(null, 2);
+   *    }, 10);
+   *  }
+   * ];
+   * async.tryEach(tasks, function(err, res) {
+   *   console.log(res); // 2
+   * });
+   *
+   * @example
+   *
+   * var tasks = [
+   *  function(done) {
+   *    setTimeout(function() {
+   *      done(new Error('error1'));
+   *    }, 10);
+   *  },
+   *  function(done) {
+   *    setTimeout(function() {
+   *      done(new Error('error2');
+   *    }, 10);
+   *  }
+   * ];
+   * async.tryEach(tasks, function(err, res) {
+   *   console.log(err); // error2
+   *   console.log(res); // undefined
+   * });
+   *
+   */
+  function tryEach(tasks, callback) {
+    callback = callback || noop;
+    var size, keys, iterate;
+    var sync = false;
+    var completed = 0;
+
+    if (isArray(tasks)) {
+      size = tasks.length;
+      iterate = arrayIterator;
+    } else if (tasks && typeof tasks === obj) {
+      keys = nativeKeys(tasks);
+      size = keys.length;
+      iterate = objectIterator;
+    }
+    if (!size) {
+      return callback(null);
+    }
+    iterate();
+
+    function arrayIterator() {
+      tasks[completed](done);
+    }
+
+    function objectIterator() {
+      tasks[keys[completed]](done);
+    }
+
+    function done(err, res) {
+      if (!err) {
+        if (arguments.length <= 2) {
+          callback(null, res);
+        } else {
+          callback(null, slice(arguments, 1));
+        }
+      } else if (++completed === size) {
+        callback(err);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * check for waterfall tasks
+   * @private
+   * @param {Array} tasks
+   * @param {Function} callback
+   * @return {boolean}
+   */
+  function checkWaterfallTasks(tasks, callback) {
+    if (!isArray(tasks)) {
+      callback(new Error('First argument to waterfall must be an array of functions'));
+      return false;
+    }
+    if (tasks.length === 0) {
+      callback(null);
+      return false;
+    }
+    return true;
+  }
+
+  /**
+   * check for waterfall tasks
+   * @private
+   * @param {function} func
+   * @param {Array|Object} args - arguments
+   * @return {function} next
+   */
+  function waterfallIterator(func, args, next) {
+    switch (args.length) {
+      case 0:
+      case 1:
+        return func(next);
+      case 2:
+        return func(args[1], next);
+      case 3:
+        return func(args[1], args[2], next);
+      case 4:
+        return func(args[1], args[2], args[3], next);
+      case 5:
+        return func(args[1], args[2], args[3], args[4], next);
+      case 6:
+        return func(args[1], args[2], args[3], args[4], args[5], next);
+      default:
+        args = slice(args, 1);
+        args.push(next);
+        return func.apply(null, args);
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace waterfall
+   * @param {Array} tasks - functions
+   * @param {Function} callback
+   * @example
+   *
+   * var order = [];
+   * var tasks = [
+   *   function(next) {
+   *     setTimeout(function() {
+   *       order.push(1);
+   *       next(null, 1);
+   *     }, 10);
+   *   },
+   *   function(arg1, next) {
+   *     setTimeout(function() {
+   *       order.push(2);
+   *       next(null, 1, 2);
+   *     }, 30);
+   *   },
+   *   function(arg1, arg2, next) {
+   *     setTimeout(function() {
+   *       order.push(3);
+   *       next(null, 3);
+   *     }, 20);
+   *   },
+   *   function(arg1, next) {
+   *     setTimeout(function() {
+   *       order.push(4);
+   *       next(null, 1, 2, 3, 4);
+   *     }, 40);
+   *   }
+   * ];
+   * async.waterfall(tasks, function(err, arg1, arg2, arg3, arg4) {
+   *   console.log(arg1, arg2, arg3, arg4); // 1 2 3 4
+   * });
+   *
+   */
+  function waterfall(tasks, callback) {
+    callback = callback || noop;
+    if (!checkWaterfallTasks(tasks, callback)) {
+      return;
+    }
+    var func, args, done, sync;
+    var completed = 0;
+    var size = tasks.length;
+    waterfallIterator(tasks[0], [], createCallback(0));
+
+    function iterate() {
+      waterfallIterator(func, args, createCallback(func));
+    }
+
+    function createCallback(index) {
+      return function next(err, res) {
+        if (index === undefined) {
+          callback = noop;
+          throwError();
+        }
+        index = undefined;
+        if (err) {
+          done = callback;
+          callback = throwError;
+          done(err);
+          return;
+        }
+        if (++completed === size) {
+          done = callback;
+          callback = throwError;
+          if (arguments.length <= 2) {
+            done(err, res);
+          } else {
+            done.apply(null, createArray(arguments));
+          }
+          return;
+        }
+        if (sync) {
+          args = arguments;
+          func = tasks[completed] || throwError;
+          nextTick(iterate);
+        } else {
+          sync = true;
+          waterfallIterator(tasks[completed] || throwError, arguments, createCallback(completed));
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * `angelFall` is like `waterfall` and inject callback to last argument of next task.
+   *
+   * @memberof async
+   * @namespace angelFall
+   * @param {Array} tasks - functions
+   * @param {Function} callback
+   * @example
+   *
+   * var order = [];
+   * var tasks = [
+   *   function(next) {
+   *     setTimeout(function() {
+   *       order.push(1);
+   *       next(null, 1);
+   *     }, 10);
+   *   },
+   *   function(arg1, empty, next) {
+   *     setTimeout(function() {
+   *       order.push(2);
+   *       next(null, 1, 2);
+   *     }, 30);
+   *   },
+   *   function(next) {
+   *     setTimeout(function() {
+   *       order.push(3);
+   *       next(null, 3);
+   *     }, 20);
+   *   },
+   *   function(arg1, empty1, empty2, empty3, next) {
+   *     setTimeout(function() {
+   *       order.push(4);
+   *       next(null, 1, 2, 3, 4);
+   *     }, 40);
+   *   }
+   * ];
+   * async.angelFall(tasks, function(err, arg1, arg2, arg3, arg4) {
+   *   console.log(arg1, arg2, arg3, arg4); // 1 2 3 4
+   * });
+   *
+   */
+  function angelFall(tasks, callback) {
+    callback = callback || noop;
+    if (!checkWaterfallTasks(tasks, callback)) {
+      return;
+    }
+    var completed = 0;
+    var sync = false;
+    var size = tasks.length;
+    var func = tasks[completed];
+    var args = [];
+    var iterate = function() {
+      switch (func.length) {
+        case 0:
+          try {
+            next(null, func());
+          } catch (e) {
+            next(e);
+          }
+          return;
+        case 1:
+          return func(next);
+        case 2:
+          return func(args[1], next);
+        case 3:
+          return func(args[1], args[2], next);
+        case 4:
+          return func(args[1], args[2], args[3], next);
+        case 5:
+          return func(args[1], args[2], args[3], args[4], next);
+        default:
+          args = slice(args, 1);
+          args[func.length - 1] = next;
+          return func.apply(null, args);
+      }
+    };
+    iterate();
+
+    function next(err, res) {
+      if (err) {
+        iterate = throwError;
+        callback = onlyOnce(callback);
+        callback(err);
+        return;
+      }
+      if (++completed === size) {
+        iterate = throwError;
+        var done = callback;
+        callback = throwError;
+        if (arguments.length === 2) {
+          done(err, res);
+        } else {
+          done.apply(null, createArray(arguments));
+        }
+        return;
+      }
+      func = tasks[completed];
+      args = arguments;
+      if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace whilst
+   * @param {Function} test
+   * @param {Function} iterator
+   * @param {Function} callback
+   */
+  function whilst(test, iterator, callback) {
+    callback = callback || noop;
+    var sync = false;
+    if (test()) {
+      iterate();
+    } else {
+      callback(null);
+    }
+
+    function iterate() {
+      if (sync) {
+        nextTick(next);
+      } else {
+        sync = true;
+        iterator(done);
+      }
+      sync = false;
+    }
+
+    function next() {
+      iterator(done);
+    }
+
+    function done(err, arg) {
+      if (err) {
+        return callback(err);
+      }
+      if (arguments.length <= 2) {
+        if (test(arg)) {
+          iterate();
+        } else {
+          callback(null, arg);
+        }
+        return;
+      }
+      arg = slice(arguments, 1);
+      if (test.apply(null, arg)) {
+        iterate();
+      } else {
+        callback.apply(null, [null].concat(arg));
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace doWhilst
+   * @param {Function} iterator
+   * @param {Function} test
+   * @param {Function} callback
+   */
+  function doWhilst(iterator, test, callback) {
+    callback = callback || noop;
+    var sync = false;
+    next();
+
+    function iterate() {
+      if (sync) {
+        nextTick(next);
+      } else {
+        sync = true;
+        iterator(done);
+      }
+      sync = false;
+    }
+
+    function next() {
+      iterator(done);
+    }
+
+    function done(err, arg) {
+      if (err) {
+        return callback(err);
+      }
+      if (arguments.length <= 2) {
+        if (test(arg)) {
+          iterate();
+        } else {
+          callback(null, arg);
+        }
+        return;
+      }
+      arg = slice(arguments, 1);
+      if (test.apply(null, arg)) {
+        iterate();
+      } else {
+        callback.apply(null, [null].concat(arg));
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace until
+   * @param {Function} test
+   * @param {Function} iterator
+   * @param {Function} callback
+   */
+  function until(test, iterator, callback) {
+    callback = callback || noop;
+    var sync = false;
+    if (!test()) {
+      iterate();
+    } else {
+      callback(null);
+    }
+
+    function iterate() {
+      if (sync) {
+        nextTick(next);
+      } else {
+        sync = true;
+        iterator(done);
+      }
+      sync = false;
+    }
+
+    function next() {
+      iterator(done);
+    }
+
+    function done(err, arg) {
+      if (err) {
+        return callback(err);
+      }
+      if (arguments.length <= 2) {
+        if (!test(arg)) {
+          iterate();
+        } else {
+          callback(null, arg);
+        }
+        return;
+      }
+      arg = slice(arguments, 1);
+      if (!test.apply(null, arg)) {
+        iterate();
+      } else {
+        callback.apply(null, [null].concat(arg));
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace doUntil
+   * @param {Function} iterator
+   * @param {Function} test
+   * @param {Function} callback
+   */
+  function doUntil(iterator, test, callback) {
+    callback = callback || noop;
+    var sync = false;
+    next();
+
+    function iterate() {
+      if (sync) {
+        nextTick(next);
+      } else {
+        sync = true;
+        iterator(done);
+      }
+      sync = false;
+    }
+
+    function next() {
+      iterator(done);
+    }
+
+    function done(err, arg) {
+      if (err) {
+        return callback(err);
+      }
+      if (arguments.length <= 2) {
+        if (!test(arg)) {
+          iterate();
+        } else {
+          callback(null, arg);
+        }
+        return;
+      }
+      arg = slice(arguments, 1);
+      if (!test.apply(null, arg)) {
+        iterate();
+      } else {
+        callback.apply(null, [null].concat(arg));
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace during
+   * @param {Function} test
+   * @param {Function} iterator
+   * @param {Function} callback
+   */
+  function during(test, iterator, callback) {
+    callback = callback || noop;
+    _test();
+
+    function _test() {
+      test(iterate);
+    }
+
+    function iterate(err, truth) {
+      if (err) {
+        return callback(err);
+      }
+      if (truth) {
+        iterator(done);
+      } else {
+        callback(null);
+      }
+    }
+
+    function done(err) {
+      if (err) {
+        return callback(err);
+      }
+      _test();
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace doDuring
+   * @param {Function} test
+   * @param {Function} iterator
+   * @param {Function} callback
+   */
+  function doDuring(iterator, test, callback) {
+    callback = callback || noop;
+    iterate(null, true);
+
+    function iterate(err, truth) {
+      if (err) {
+        return callback(err);
+      }
+      if (truth) {
+        iterator(done);
+      } else {
+        callback(null);
+      }
+    }
+
+    function done(err, res) {
+      if (err) {
+        return callback(err);
+      }
+      switch (arguments.length) {
+        case 0:
+        case 1:
+          test(iterate);
+          break;
+        case 2:
+          test(res, iterate);
+          break;
+        default:
+          var args = slice(arguments, 1);
+          args.push(iterate);
+          test.apply(null, args);
+          break;
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace forever
+   */
+  function forever(iterator, callback) {
+    var sync = false;
+    iterate();
+
+    function iterate() {
+      iterator(next);
+    }
+
+    function next(err) {
+      if (err) {
+        if (callback) {
+          return callback(err);
+        }
+        throw err;
+      }
+      if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace compose
+   */
+  function compose() {
+    return seq.apply(null, reverse(arguments));
+  }
+
+  /**
+   * @memberof async
+   * @namespace seq
+   */
+  function seq(/* functions... */) {
+    var fns = createArray(arguments);
+
+    return function() {
+      var self = this;
+      var args = createArray(arguments);
+      var callback = args[args.length - 1];
+      if (typeof callback === func) {
+        args.pop();
+      } else {
+        callback = noop;
+      }
+      reduce(fns, args, iterator, done);
+
+      function iterator(newargs, fn, callback) {
+        var func = function(err) {
+          var nextargs = slice(arguments, 1);
+          callback(err, nextargs);
+        };
+        newargs.push(func);
+        fn.apply(self, newargs);
+      }
+
+      function done(err, res) {
+        res = isArray(res) ? res : [res];
+        res.unshift(err);
+        callback.apply(self, res);
+      }
+    };
+  }
+
+  function createApplyEach(func) {
+    return function applyEach(fns /* arguments */) {
+      var go = function() {
+        var self = this;
+        var args = createArray(arguments);
+        var callback = args.pop() || noop;
+        return func(fns, iterator, callback);
+
+        function iterator(fn, done) {
+          fn.apply(self, args.concat([done]));
+        }
+      };
+      if (arguments.length > 1) {
+        var args = slice(arguments, 1);
+        return go.apply(this, args);
+      } else {
+        return go;
+      }
+    };
+  }
+
+  /**
+   * @see https://github.com/caolan/async/blob/master/lib/internal/DoublyLinkedList.js
+   */
+  function DLL() {
+    this.head = null;
+    this.tail = null;
+    this.length = 0;
+  }
+
+  DLL.prototype._removeLink = function(node) {
+    var prev = node.prev;
+    var next = node.next;
+    if (prev) {
+      prev.next = next;
+    } else {
+      this.head = next;
+    }
+    if (next) {
+      next.prev = prev;
+    } else {
+      this.tail = prev;
+    }
+    node.prev = null;
+    node.next = null;
+    this.length--;
+    return node;
+  };
+
+  DLL.prototype.empty = DLL;
+
+  DLL.prototype._setInitial = function(node) {
+    this.length = 1;
+    this.head = this.tail = node;
+  };
+
+  DLL.prototype.insertBefore = function(node, newNode) {
+    newNode.prev = node.prev;
+    newNode.next = node;
+    if (node.prev) {
+      node.prev.next = newNode;
+    } else {
+      this.head = newNode;
+    }
+    node.prev = newNode;
+    this.length++;
+  };
+
+  DLL.prototype.unshift = function(node) {
+    if (this.head) {
+      this.insertBefore(this.head, node);
+    } else {
+      this._setInitial(node);
+    }
+  };
+
+  DLL.prototype.push = function(node) {
+    var tail = this.tail;
+    if (tail) {
+      node.prev = tail;
+      node.next = tail.next;
+      this.tail = node;
+      tail.next = node;
+      this.length++;
+    } else {
+      this._setInitial(node);
+    }
+  };
+
+  DLL.prototype.shift = function() {
+    return this.head && this._removeLink(this.head);
+  };
+
+  DLL.prototype.splice = function(end) {
+    var task;
+    var tasks = [];
+    while (end-- && (task = this.shift())) {
+      tasks.push(task);
+    }
+    return tasks;
+  };
+
+  DLL.prototype.remove = function(test) {
+    var node = this.head;
+    while (node) {
+      if (test(node)) {
+        this._removeLink(node);
+      }
+      node = node.next;
+    }
+    return this;
+  };
+
+  /**
+   * @private
+   */
+  function baseQueue(isQueue, worker, concurrency, payload) {
+    if (concurrency === undefined) {
+      concurrency = 1;
+    } else if (isNaN(concurrency) || concurrency < 1) {
+      throw new Error('Concurrency must not be zero');
+    }
+
+    var workers = 0;
+    var workersList = [];
+    var _callback, _unshift;
+
+    var q = {
+      _tasks: new DLL(),
+      concurrency: concurrency,
+      payload: payload,
+      saturated: noop,
+      unsaturated: noop,
+      buffer: concurrency / 4,
+      empty: noop,
+      drain: noop,
+      error: noop,
+      started: false,
+      paused: false,
+      push: push,
+      kill: kill,
+      unshift: unshift,
+      remove: remove,
+      process: isQueue ? runQueue : runCargo,
+      length: getLength,
+      running: running,
+      workersList: getWorkersList,
+      idle: idle,
+      pause: pause,
+      resume: resume,
+      _worker: worker
+    };
+    return q;
+
+    function push(tasks, callback) {
+      _insert(tasks, callback);
+    }
+
+    function unshift(tasks, callback) {
+      _insert(tasks, callback, true);
+    }
+
+    function _exec(task) {
+      var item = {
+        data: task,
+        callback: _callback
+      };
+      if (_unshift) {
+        q._tasks.unshift(item);
+      } else {
+        q._tasks.push(item);
+      }
+      nextTick(q.process);
+    }
+
+    function _insert(tasks, callback, unshift) {
+      if (callback == null) {
+        callback = noop;
+      } else if (typeof callback !== 'function') {
+        throw new Error('task callback must be a function');
+      }
+      q.started = true;
+      var _tasks = isArray(tasks) ? tasks : [tasks];
+
+      if (tasks === undefined || !_tasks.length) {
+        if (q.idle()) {
+          nextTick(q.drain);
+        }
+        return;
+      }
+
+      _unshift = unshift;
+      _callback = callback;
+      arrayEachSync(_tasks, _exec);
+      // Avoid leaking the callback
+      _callback = undefined;
+    }
+
+    function kill() {
+      q.drain = noop;
+      q._tasks.empty();
+    }
+
+    function _next(q, tasks) {
+      var called = false;
+      return function done(err, res) {
+        if (called) {
+          throwError();
+        }
+        called = true;
+
+        workers--;
+        var task;
+        var index = -1;
+        var size = workersList.length;
+        var taskIndex = -1;
+        var taskSize = tasks.length;
+        var useApply = arguments.length > 2;
+        var args = useApply && createArray(arguments);
+        while (++taskIndex < taskSize) {
+          task = tasks[taskIndex];
+          while (++index < size) {
+            if (workersList[index] === task) {
+              if (index === 0) {
+                workersList.shift();
+              } else {
+                workersList.splice(index, 1);
+              }
+              index = size;
+              size--;
+            }
+          }
+          index = -1;
+          if (useApply) {
+            task.callback.apply(task, args);
+          } else {
+            task.callback(err, res);
+          }
+          if (err) {
+            q.error(err, task.data);
+          }
+        }
+
+        if (workers <= q.concurrency - q.buffer) {
+          q.unsaturated();
+        }
+
+        if (q._tasks.length + workers === 0) {
+          q.drain();
+        }
+        q.process();
+      };
+    }
+
+    function runQueue() {
+      while (!q.paused && workers < q.concurrency && q._tasks.length) {
+        var task = q._tasks.shift();
+        workers++;
+        workersList.push(task);
+        if (q._tasks.length === 0) {
+          q.empty();
+        }
+        if (workers === q.concurrency) {
+          q.saturated();
+        }
+        var done = _next(q, [task]);
+        worker(task.data, done);
+      }
+    }
+
+    function runCargo() {
+      while (!q.paused && workers < q.concurrency && q._tasks.length) {
+        var tasks = q._tasks.splice(q.payload || q._tasks.length);
+        var index = -1;
+        var size = tasks.length;
+        var data = Array(size);
+        while (++index < size) {
+          data[index] = tasks[index].data;
+        }
+        workers++;
+        nativePush.apply(workersList, tasks);
+        if (q._tasks.length === 0) {
+          q.empty();
+        }
+        if (workers === q.concurrency) {
+          q.saturated();
+        }
+        var done = _next(q, tasks);
+        worker(data, done);
+      }
+    }
+
+    function getLength() {
+      return q._tasks.length;
+    }
+
+    function running() {
+      return workers;
+    }
+
+    function getWorkersList() {
+      return workersList;
+    }
+
+    function idle() {
+      return q.length() + workers === 0;
+    }
+
+    function pause() {
+      q.paused = true;
+    }
+
+    function _resume() {
+      nextTick(q.process);
+    }
+
+    function resume() {
+      if (q.paused === false) {
+        return;
+      }
+      q.paused = false;
+      var count = q.concurrency < q._tasks.length ? q.concurrency : q._tasks.length;
+      timesSync(count, _resume);
+    }
+
+    /**
+     * @param {Function} test
+     */
+    function remove(test) {
+      q._tasks.remove(test);
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace queue
+   */
+  function queue(worker, concurrency) {
+    return baseQueue(true, worker, concurrency);
+  }
+
+  /**
+   * @memberof async
+   * @namespace priorityQueue
+   */
+  function priorityQueue(worker, concurrency) {
+    var q = baseQueue(true, worker, concurrency);
+    q.push = push;
+    delete q.unshift;
+    return q;
+
+    function push(tasks, priority, callback) {
+      q.started = true;
+      priority = priority || 0;
+      var _tasks = isArray(tasks) ? tasks : [tasks];
+      var taskSize = _tasks.length;
+
+      if (tasks === undefined || taskSize === 0) {
+        if (q.idle()) {
+          nextTick(q.drain);
+        }
+        return;
+      }
+
+      callback = typeof callback === func ? callback : noop;
+      var nextNode = q._tasks.head;
+      while (nextNode && priority >= nextNode.priority) {
+        nextNode = nextNode.next;
+      }
+      while (taskSize--) {
+        var item = {
+          data: _tasks[taskSize],
+          priority: priority,
+          callback: callback
+        };
+        if (nextNode) {
+          q._tasks.insertBefore(nextNode, item);
+        } else {
+          q._tasks.push(item);
+        }
+        nextTick(q.process);
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace cargo
+   */
+  function cargo(worker, payload) {
+    return baseQueue(false, worker, 1, payload);
+  }
+
+  /**
+   * @memberof async
+   * @namespace auto
+   * @param {Object} tasks
+   * @param {number} [concurrency]
+   * @param {Function} [callback]
+   */
+  function auto(tasks, concurrency, callback) {
+    if (typeof concurrency === func) {
+      callback = concurrency;
+      concurrency = null;
+    }
+    var keys = nativeKeys(tasks);
+    var rest = keys.length;
+    var results = {};
+    if (rest === 0) {
+      return callback(null, results);
+    }
+    var runningTasks = 0;
+    var readyTasks = new DLL();
+    var listeners = Object.create(null);
+    callback = onlyOnce(callback || noop);
+    concurrency = concurrency || rest;
+
+    baseEachSync(tasks, iterator, keys);
+    proceedQueue();
+
+    function iterator(task, key) {
+      // no dependencies
+      var _task, _taskSize;
+      if (!isArray(task)) {
+        _task = task;
+        _taskSize = 0;
+        readyTasks.push([_task, _taskSize, done]);
+        return;
+      }
+      var dependencySize = task.length - 1;
+      _task = task[dependencySize];
+      _taskSize = dependencySize;
+      if (dependencySize === 0) {
+        readyTasks.push([_task, _taskSize, done]);
+        return;
+      }
+      // dependencies
+      var index = -1;
+      while (++index < dependencySize) {
+        var dependencyName = task[index];
+        if (notInclude(keys, dependencyName)) {
+          var msg =
+            'async.auto task `' +
+            key +
+            '` has non-existent dependency `' +
+            dependencyName +
+            '` in ' +
+            task.join(', ');
+          throw new Error(msg);
+        }
+        var taskListeners = listeners[dependencyName];
+        if (!taskListeners) {
+          taskListeners = listeners[dependencyName] = [];
+        }
+        taskListeners.push(taskListener);
+      }
+
+      function done(err, arg) {
+        if (key === null) {
+          throwError();
+        }
+        arg = arguments.length <= 2 ? arg : slice(arguments, 1);
+        if (err) {
+          rest = 0;
+          runningTasks = 0;
+          readyTasks.length = 0;
+          var safeResults = objectClone(results);
+          safeResults[key] = arg;
+          key = null;
+          var _callback = callback;
+          callback = noop;
+          _callback(err, safeResults);
+          return;
+        }
+        runningTasks--;
+        rest--;
+        results[key] = arg;
+        taskComplete(key);
+        key = null;
+      }
+
+      function taskListener() {
+        if (--dependencySize === 0) {
+          readyTasks.push([_task, _taskSize, done]);
+        }
+      }
+    }
+
+    function proceedQueue() {
+      if (readyTasks.length === 0 && runningTasks === 0) {
+        if (rest !== 0) {
+          throw new Error('async.auto task has cyclic dependencies');
+        }
+        return callback(null, results);
+      }
+      while (readyTasks.length && runningTasks < concurrency && callback !== noop) {
+        runningTasks++;
+        var array = readyTasks.shift();
+        if (array[1] === 0) {
+          array[0](array[2]);
+        } else {
+          array[0](results, array[2]);
+        }
+      }
+    }
+
+    function taskComplete(key) {
+      var taskListeners = listeners[key] || [];
+      arrayEachSync(taskListeners, function(task) {
+        task();
+      });
+      proceedQueue();
+    }
+  }
+
+  var FN_ARGS = /^(function)?\s*[^\(]*\(\s*([^\)]*)\)/m;
+  var FN_ARG_SPLIT = /,/;
+  var FN_ARG = /(=.+)?(\s*)$/;
+  var STRIP_COMMENTS = /((\/\/.*$)|(\/\*[\s\S]*?\*\/))/gm;
+
+  /**
+   * parse function arguments for `autoInject`
+   *
+   * @private
+   */
+  function parseParams(func) {
+    func = func.toString().replace(STRIP_COMMENTS, '');
+    func = func.match(FN_ARGS)[2].replace(' ', '');
+    func = func ? func.split(FN_ARG_SPLIT) : [];
+    func = func.map(function(arg) {
+      return arg.replace(FN_ARG, '').trim();
+    });
+    return func;
+  }
+
+  /**
+   * @memberof async
+   * @namespace autoInject
+   * @param {Object} tasks
+   * @param {number} [concurrency]
+   * @param {Function} [callback]
+   */
+  function autoInject(tasks, concurrency, callback) {
+    var newTasks = {};
+    baseEachSync(tasks, iterator, nativeKeys(tasks));
+    auto(newTasks, concurrency, callback);
+
+    function iterator(task, key) {
+      var params;
+      var taskLength = task.length;
+
+      if (isArray(task)) {
+        if (taskLength === 0) {
+          throw new Error('autoInject task functions require explicit parameters.');
+        }
+        params = createArray(task);
+        taskLength = params.length - 1;
+        task = params[taskLength];
+        if (taskLength === 0) {
+          newTasks[key] = task;
+          return;
+        }
+      } else if (taskLength === 1) {
+        newTasks[key] = task;
+        return;
+      } else {
+        params = parseParams(task);
+        if (taskLength === 0 && params.length === 0) {
+          throw new Error('autoInject task functions require explicit parameters.');
+        }
+        taskLength = params.length - 1;
+      }
+      params[taskLength] = newTask;
+      newTasks[key] = params;
+
+      function newTask(results, done) {
+        switch (taskLength) {
+          case 1:
+            task(results[params[0]], done);
+            break;
+          case 2:
+            task(results[params[0]], results[params[1]], done);
+            break;
+          case 3:
+            task(results[params[0]], results[params[1]], results[params[2]], done);
+            break;
+          default:
+            var i = -1;
+            while (++i < taskLength) {
+              params[i] = results[params[i]];
+            }
+            params[i] = done;
+            task.apply(null, params);
+            break;
+        }
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace retry
+   * @param {integer|Object|Function} opts
+   * @param {Function} [task]
+   * @param {Function} [callback]
+   */
+  function retry(opts, task, callback) {
+    var times, intervalFunc, errorFilter;
+    var count = 0;
+    if (arguments.length < 3 && typeof opts === func) {
+      callback = task || noop;
+      task = opts;
+      opts = null;
+      times = DEFAULT_TIMES;
+    } else {
+      callback = callback || noop;
+      switch (typeof opts) {
+        case 'object':
+          if (typeof opts.errorFilter === func) {
+            errorFilter = opts.errorFilter;
+          }
+          var interval = opts.interval;
+          switch (typeof interval) {
+            case func:
+              intervalFunc = interval;
+              break;
+            case 'string':
+            case 'number':
+              interval = +interval;
+              intervalFunc = interval
+                ? function() {
+                    return interval;
+                  }
+                : function() {
+                    return DEFAULT_INTERVAL;
+                  };
+              break;
+          }
+          times = +opts.times || DEFAULT_TIMES;
+          break;
+        case 'number':
+          times = opts || DEFAULT_TIMES;
+          break;
+        case 'string':
+          times = +opts || DEFAULT_TIMES;
+          break;
+        default:
+          throw new Error('Invalid arguments for async.retry');
+      }
+    }
+    if (typeof task !== 'function') {
+      throw new Error('Invalid arguments for async.retry');
+    }
+
+    if (intervalFunc) {
+      task(intervalCallback);
+    } else {
+      task(simpleCallback);
+    }
+
+    function simpleIterator() {
+      task(simpleCallback);
+    }
+
+    function simpleCallback(err, res) {
+      if (++count === times || !err || (errorFilter && !errorFilter(err))) {
+        if (arguments.length <= 2) {
+          return callback(err, res);
+        }
+        var args = createArray(arguments);
+        return callback.apply(null, args);
+      }
+      simpleIterator();
+    }
+
+    function intervalIterator() {
+      task(intervalCallback);
+    }
+
+    function intervalCallback(err, res) {
+      if (++count === times || !err || (errorFilter && !errorFilter(err))) {
+        if (arguments.length <= 2) {
+          return callback(err, res);
+        }
+        var args = createArray(arguments);
+        return callback.apply(null, args);
+      }
+      setTimeout(intervalIterator, intervalFunc(count));
+    }
+  }
+
+  function retryable(opts, task) {
+    if (!task) {
+      task = opts;
+      opts = null;
+    }
+    return done;
+
+    function done() {
+      var taskFn;
+      var args = createArray(arguments);
+      var lastIndex = args.length - 1;
+      var callback = args[lastIndex];
+      switch (task.length) {
+        case 1:
+          taskFn = task1;
+          break;
+        case 2:
+          taskFn = task2;
+          break;
+        case 3:
+          taskFn = task3;
+          break;
+        default:
+          taskFn = task4;
+      }
+      if (opts) {
+        retry(opts, taskFn, callback);
+      } else {
+        retry(taskFn, callback);
+      }
+
+      function task1(done) {
+        task(done);
+      }
+
+      function task2(done) {
+        task(args[0], done);
+      }
+
+      function task3(done) {
+        task(args[0], args[1], done);
+      }
+
+      function task4(callback) {
+        args[lastIndex] = callback;
+        task.apply(null, args);
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace iterator
+   */
+  function iterator(tasks) {
+    var size = 0;
+    var keys = [];
+    if (isArray(tasks)) {
+      size = tasks.length;
+    } else {
+      keys = nativeKeys(tasks);
+      size = keys.length;
+    }
+    return makeCallback(0);
+
+    function makeCallback(index) {
+      var fn = function() {
+        if (size) {
+          var key = keys[index] || index;
+          tasks[key].apply(null, createArray(arguments));
+        }
+        return fn.next();
+      };
+      fn.next = function() {
+        return index < size - 1 ? makeCallback(index + 1) : null;
+      };
+      return fn;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace apply
+   */
+  function apply(func) {
+    switch (arguments.length) {
+      case 0:
+      case 1:
+        return func;
+      case 2:
+        return func.bind(null, arguments[1]);
+      case 3:
+        return func.bind(null, arguments[1], arguments[2]);
+      case 4:
+        return func.bind(null, arguments[1], arguments[2], arguments[3]);
+      case 5:
+        return func.bind(null, arguments[1], arguments[2], arguments[3], arguments[4]);
+      default:
+        var size = arguments.length;
+        var index = 0;
+        var args = Array(size);
+        args[index] = null;
+        while (++index < size) {
+          args[index] = arguments[index];
+        }
+        return func.bind.apply(func, args);
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace timeout
+   * @param {Function} func
+   * @param {number} millisec
+   * @param {*} info
+   */
+  function timeout(func, millisec, info) {
+    var callback, timer;
+    return wrappedFunc;
+
+    function wrappedFunc() {
+      timer = setTimeout(timeoutCallback, millisec);
+      var args = createArray(arguments);
+      var lastIndex = args.length - 1;
+      callback = args[lastIndex];
+      args[lastIndex] = injectedCallback;
+      simpleApply(func, args);
+    }
+
+    function timeoutCallback() {
+      var name = func.name || 'anonymous';
+      var err = new Error('Callback function "' + name + '" timed out.');
+      err.code = 'ETIMEDOUT';
+      if (info) {
+        err.info = info;
+      }
+      timer = null;
+      callback(err);
+    }
+
+    function injectedCallback() {
+      if (timer !== null) {
+        simpleApply(callback, createArray(arguments));
+        clearTimeout(timer);
+      }
+    }
+
+    function simpleApply(func, args) {
+      switch (args.length) {
+        case 0:
+          func();
+          break;
+        case 1:
+          func(args[0]);
+          break;
+        case 2:
+          func(args[0], args[1]);
+          break;
+        default:
+          func.apply(null, args);
+          break;
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace times
+   * @param {number} n - n >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * var iterator = function(n, done) {
+   *   done(null, n);
+   * };
+   * async.times(4, iterator, function(err, res) {
+   *   console.log(res); // [0, 1, 2, 3];
+   * });
+   *
+   */
+  function times(n, iterator, callback) {
+    callback = callback || noop;
+    n = +n;
+    if (isNaN(n) || n < 1) {
+      return callback(null, []);
+    }
+    var result = Array(n);
+    timesSync(n, iterate);
+
+    function iterate(num) {
+      iterator(num, createCallback(num));
+    }
+
+    function createCallback(index) {
+      return function(err, res) {
+        if (index === null) {
+          throwError();
+        }
+        result[index] = res;
+        index = null;
+        if (err) {
+          callback(err);
+          callback = noop;
+        } else if (--n === 0) {
+          callback(null, result);
+        }
+      };
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace timesSeries
+   * @param {number} n - n >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * var iterator = function(n, done) {
+   *   done(null, n);
+   * };
+   * async.timesSeries(4, iterator, function(err, res) {
+   *   console.log(res); // [0, 1, 2, 3];
+   * });
+   *
+   */
+  function timesSeries(n, iterator, callback) {
+    callback = callback || noop;
+    n = +n;
+    if (isNaN(n) || n < 1) {
+      return callback(null, []);
+    }
+    var result = Array(n);
+    var sync = false;
+    var completed = 0;
+    iterate();
+
+    function iterate() {
+      iterator(completed, done);
+    }
+
+    function done(err, res) {
+      result[completed] = res;
+      if (err) {
+        callback(err);
+        callback = throwError;
+      } else if (++completed >= n) {
+        callback(null, result);
+        callback = throwError;
+      } else if (sync) {
+        nextTick(iterate);
+      } else {
+        sync = true;
+        iterate();
+      }
+      sync = false;
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace timesLimit
+   * @param {number} n - n >= 1
+   * @param {number} limit - n >= 1
+   * @param {Function} iterator
+   * @param {Function} callback
+   * @example
+   *
+   * var iterator = function(n, done) {
+   *   done(null, n);
+   * };
+   * async.timesLimit(4, 2, iterator, function(err, res) {
+   *   console.log(res); // [0, 1, 2, 3];
+   * });
+   *
+   */
+  function timesLimit(n, limit, iterator, callback) {
+    callback = callback || noop;
+    n = +n;
+    if (isNaN(n) || n < 1 || isNaN(limit) || limit < 1) {
+      return callback(null, []);
+    }
+    var result = Array(n);
+    var sync = false;
+    var started = 0;
+    var completed = 0;
+    timesSync(limit > n ? n : limit, iterate);
+
+    function iterate() {
+      var index = started++;
+      if (index < n) {
+        iterator(index, createCallback(index));
+      }
+    }
+
+    function createCallback(index) {
+      return function(err, res) {
+        if (index === null) {
+          throwError();
+        }
+        result[index] = res;
+        index = null;
+        if (err) {
+          callback(err);
+          callback = noop;
+        } else if (++completed >= n) {
+          callback(null, result);
+          callback = throwError;
+        } else if (sync) {
+          nextTick(iterate);
+        } else {
+          sync = true;
+          iterate();
+        }
+        sync = false;
+      };
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace race
+   * @param {Array|Object} tasks - functions
+   * @param {Function} callback
+   * @example
+   *
+   * // array
+   * var called = 0;
+   * var tasks = [
+   *   function(done) {
+   *     setTimeout(function() {
+   *       called++;
+   *       done(null, '1');
+   *     }, 30);
+   *   },
+   *   function(done) {
+   *     setTimeout(function() {
+   *       called++;
+   *       done(null, '2');
+   *     }, 20);
+   *   },
+   *   function(done) {
+   *     setTimeout(function() {
+   *       called++;
+   *       done(null, '3');
+   *     }, 10);
+   *   }
+   * ];
+   * async.race(tasks, function(err, res) {
+   *   console.log(res); // '3'
+   *   console.log(called); // 1
+   *   setTimeout(function() {
+   *     console.log(called); // 3
+   *   }, 50);
+   * });
+   *
+   * @example
+   *
+   * // object
+   * var called = 0;
+   * var tasks = {
+   *   'test1': function(done) {
+   *     setTimeout(function() {
+   *       called++;
+   *       done(null, '1');
+   *     }, 30);
+   *   },
+   *   'test2': function(done) {
+   *     setTimeout(function() {
+   *       called++;
+   *       done(null, '2');
+   *     }, 20);
+   *   },
+   *   'test3': function(done) {
+   *     setTimeout(function() {
+   *       called++;
+   *       done(null, '3');
+   *     }, 10);
+   *   }
+   * };
+   * async.race(tasks, function(err, res) {
+   *   console.log(res); // '3'
+   *   console.log(called); // 1
+   *   setTimeout(function() {
+   *     console.log(called); // 3
+   *     done();
+   *   }, 50);
+   * });
+   *
+   */
+  function race(tasks, callback) {
+    callback = once(callback || noop);
+    var size, keys;
+    var index = -1;
+    if (isArray(tasks)) {
+      size = tasks.length;
+      while (++index < size) {
+        tasks[index](callback);
+      }
+    } else if (tasks && typeof tasks === obj) {
+      keys = nativeKeys(tasks);
+      size = keys.length;
+      while (++index < size) {
+        tasks[keys[index]](callback);
+      }
+    } else {
+      return callback(new TypeError('First argument to race must be a collection of functions'));
+    }
+    if (!size) {
+      callback(null);
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace memoize
+   */
+  function memoize(fn, hasher) {
+    hasher =
+      hasher ||
+      function(hash) {
+        return hash;
+      };
+
+    var memo = {};
+    var queues = {};
+    var memoized = function() {
+      var args = createArray(arguments);
+      var callback = args.pop();
+      var key = hasher.apply(null, args);
+      if (has(memo, key)) {
+        nextTick(function() {
+          callback.apply(null, memo[key]);
+        });
+        return;
+      }
+      if (has(queues, key)) {
+        return queues[key].push(callback);
+      }
+
+      queues[key] = [callback];
+      args.push(done);
+      fn.apply(null, args);
+
+      function done(err) {
+        var args = createArray(arguments);
+        if (!err) {
+          memo[key] = args;
+        }
+        var q = queues[key];
+        delete queues[key];
+
+        var i = -1;
+        var size = q.length;
+        while (++i < size) {
+          q[i].apply(null, args);
+        }
+      }
+    };
+    memoized.memo = memo;
+    memoized.unmemoized = fn;
+    return memoized;
+  }
+
+  /**
+   * @memberof async
+   * @namespace unmemoize
+   */
+  function unmemoize(fn) {
+    return function() {
+      return (fn.unmemoized || fn).apply(null, arguments);
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace ensureAsync
+   */
+  function ensureAsync(fn) {
+    return function(/* ...args, callback */) {
+      var args = createArray(arguments);
+      var lastIndex = args.length - 1;
+      var callback = args[lastIndex];
+      var sync = true;
+      args[lastIndex] = done;
+      fn.apply(this, args);
+      sync = false;
+
+      function done() {
+        var innerArgs = createArray(arguments);
+        if (sync) {
+          nextTick(function() {
+            callback.apply(null, innerArgs);
+          });
+        } else {
+          callback.apply(null, innerArgs);
+        }
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace constant
+   */
+  function constant(/* values... */) {
+    var args = [null].concat(createArray(arguments));
+    return function(callback) {
+      callback = arguments[arguments.length - 1];
+      callback.apply(this, args);
+    };
+  }
+
+  function asyncify(fn) {
+    return function(/* args..., callback */) {
+      var args = createArray(arguments);
+      var callback = args.pop();
+      var result;
+      try {
+        result = fn.apply(this, args);
+      } catch (e) {
+        return callback(e);
+      }
+      if (result && typeof result.then === func) {
+        result.then(
+          function(value) {
+            invokeCallback(callback, null, value);
+          },
+          function(err) {
+            invokeCallback(callback, err && err.message ? err : new Error(err));
+          }
+        );
+      } else {
+        callback(null, result);
+      }
+    };
+  }
+
+  function invokeCallback(callback, err, value) {
+    try {
+      callback(err, value);
+    } catch (e) {
+      nextTick(rethrow, e);
+    }
+  }
+
+  function rethrow(error) {
+    throw error;
+  }
+
+  /**
+   * @memberof async
+   * @namespace reflect
+   * @param {Function} func
+   * @return {Function}
+   */
+  function reflect(func) {
+    return function(/* args..., callback */) {
+      var callback;
+      switch (arguments.length) {
+        case 1:
+          callback = arguments[0];
+          return func(done);
+        case 2:
+          callback = arguments[1];
+          return func(arguments[0], done);
+        default:
+          var args = createArray(arguments);
+          var lastIndex = args.length - 1;
+          callback = args[lastIndex];
+          args[lastIndex] = done;
+          func.apply(this, args);
+      }
+
+      function done(err, res) {
+        if (err) {
+          return callback(null, {
+            error: err
+          });
+        }
+        if (arguments.length > 2) {
+          res = slice(arguments, 1);
+        }
+        callback(null, {
+          value: res
+        });
+      }
+    };
+  }
+
+  /**
+   * @memberof async
+   * @namespace reflectAll
+   * @param {Array[]|Object} tasks
+   * @return {Function}
+   */
+  function reflectAll(tasks) {
+    var newTasks, keys;
+    if (isArray(tasks)) {
+      newTasks = Array(tasks.length);
+      arrayEachSync(tasks, iterate);
+    } else if (tasks && typeof tasks === obj) {
+      keys = nativeKeys(tasks);
+      newTasks = {};
+      baseEachSync(tasks, iterate, keys);
+    }
+    return newTasks;
+
+    function iterate(func, key) {
+      newTasks[key] = reflect(func);
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace createLogger
+   */
+  function createLogger(name) {
+    return function(fn) {
+      var args = slice(arguments, 1);
+      args.push(done);
+      fn.apply(null, args);
+    };
+
+    function done(err) {
+      if (typeof console === obj) {
+        if (err) {
+          if (console.error) {
+            console.error(err);
+          }
+          return;
+        }
+        if (console[name]) {
+          var args = slice(arguments, 1);
+          arrayEachSync(args, function(arg) {
+            console[name](arg);
+          });
+        }
+      }
+    }
+  }
+
+  /**
+   * @memberof async
+   * @namespace safe
+   */
+  function safe() {
+    createImmediate();
+    return exports;
+  }
+
+  /**
+   * @memberof async
+   * @namespace fast
+   */
+  function fast() {
+    createImmediate(false);
+    return exports;
+  }
+});
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/async.min.js b/node_modules/mathjs/examples/node_modules/neo-async/async.min.js
new file mode 100644
index 0000000..4161a3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/async.min.js
@@ -0,0 +1,80 @@
+(function(N,O){"object"===typeof exports&&"undefined"!==typeof module?O(exports):"function"===typeof define&&define.amd?define(["exports"],O):N.async?O(N.neo_async=N.neo_async||{}):O(N.async=N.async||{})})(this,function(N){function O(a){var c=function(a){var d=J(arguments,1);setTimeout(function(){a.apply(null,d)})};T="function"===typeof setImmediate?setImmediate:c;"object"===typeof process&&"function"===typeof process.nextTick?(D=/^v0.10/.test(process.version)?T:process.nextTick,ba=/^v0/.test(process.version)?
+T:process.nextTick):ba=D=T;!1===a&&(D=function(a){a()})}function H(a){for(var c=-1,b=a.length,d=Array(b);++c<b;)d[c]=a[c];return d}function J(a,c){var b=-1,d=a.length-c;if(0>=d)return[];for(var e=Array(d);++b<d;)e[b]=a[b+c];return e}function L(a){for(var c=F(a),b=c.length,d=-1,e={};++d<b;){var f=c[d];e[f]=a[f]}return e}function U(a){for(var c=-1,b=a.length,d=[];++c<b;){var e=a[c];e&&(d[d.length]=e)}return d}function Za(a){for(var c=-1,b=a.length,d=Array(b),e=b;++c<b;)d[--e]=a[c];return d}function $a(a,
+c){for(var b=-1,d=a.length;++b<d;)if(a[b]===c)return!1;return!0}function Q(a,c){for(var b=-1,d=a.length;++b<d;)c(a[b],b);return a}function W(a,c,b){for(var d=-1,e=b.length;++d<e;){var f=b[d];c(a[f],f)}return a}function K(a,c){for(var b=-1;++b<a;)c(b)}function P(a,c){var b=a.length,d=Array(b),e;for(e=0;e<b;e++)d[e]=e;ca(c,0,b-1,d);for(var f=Array(b),g=0;g<b;g++)e=d[g],f[g]=void 0===e?a[g]:a[e];return f}function ca(a,c,b,d){if(c!==b){for(var e=c;++e<=b&&a[c]===a[e];){var f=e-1;if(d[f]>d[e]){var g=d[f];
+d[f]=d[e];d[e]=g}}if(!(e>b)){for(var l,e=a[a[c]>a[e]?c:e],f=c,g=b;f<=g;){for(l=f;f<g&&a[f]<e;)f++;for(;g>=l&&a[g]>=e;)g--;if(f>g)break;var q=a;l=d;var s=f++,h=g--,k=q[s];q[s]=q[h];q[h]=k;q=l[s];l[s]=l[h];l[h]=q}e=f;ca(a,c,e-1,d);ca(a,e,b,d)}}}function S(a){var c=[];Q(a,function(a){a!==w&&(C(a)?X.apply(c,a):c.push(a))});return c}function da(a,c,b){var d=-1,e=a.length;if(3===c.length)for(;++d<e;)c(a[d],d,b(d));else for(;++d<e;)c(a[d],b(d))}function ra(a,c,b,d){var e,f=-1,g=d.length;if(3===c.length)for(;++f<
+g;)e=d[f],c(a[e],e,b(f));else for(;++f<g;)c(a[d[f]],b(f))}function sa(a,c,b){var d=0,e=a[z]();if(3===c.length)for(;!1===(a=e.next()).done;)c(a.value,d,b(d++));else for(;!1===(a=e.next()).done;)c(a.value,b(d++));return d}function ea(a,c,b){var d,e=-1,f=a.length;if(3===c.length)for(;++e<f;)d=a[e],c(d,e,b(d));else for(;++e<f;)d=a[e],c(d,b(d))}function fa(a,c,b,d){var e,f,g=-1,l=d.length;if(3===c.length)for(;++g<l;)e=d[g],f=a[e],c(f,e,b(f));else for(;++g<l;)f=a[d[g]],c(f,b(f))}function ga(a,c,b){var d,
+e=0;a=a[z]();if(3===c.length)for(;!1===(d=a.next()).done;)d=d.value,c(d,e++,b(d));else for(;!1===(d=a.next()).done;)e++,d=d.value,c(d,b(d));return e}function V(a,c,b){var d,e=-1,f=a.length;if(3===c.length)for(;++e<f;)d=a[e],c(d,e,b(e,d));else for(;++e<f;)d=a[e],c(d,b(e,d))}function ha(a,c,b,d){var e,f,g=-1,l=d.length;if(3===c.length)for(;++g<l;)e=d[g],f=a[e],c(f,e,b(g,f));else for(;++g<l;)f=a[d[g]],c(f,b(g,f))}function ia(a,c,b){var d,e=0;a=a[z]();if(3===c.length)for(;!1===(d=a.next()).done;)d=d.value,
+c(d,e,b(e++,d));else for(;!1===(d=a.next()).done;)d=d.value,c(d,b(e++,d));return e}function ta(a,c,b,d){var e,f,g=-1,l=d.length;if(3===c.length)for(;++g<l;)e=d[g],f=a[e],c(f,e,b(e,f));else for(;++g<l;)e=d[g],f=a[e],c(f,b(e,f))}function ua(a,c,b){var d,e=0;a=a[z]();if(3===c.length)for(;!1===(d=a.next()).done;)d=d.value,c(d,e,b(e++,d));else for(;!1===(d=a.next()).done;)d=d.value,c(d,b(e++,d));return e}function E(a){return function(c,b){var d=a;a=A;d(c,b)}}function I(a){return function(c,b){var d=a;
+a=w;d(c,b)}}function va(a,c,b,d){var e,f;d?(e=Array,f=H):(e=function(){return{}},f=L);return function(d,l,q){function s(a){return function(b,d){null===a&&A();b?(a=null,q=I(q),q(b,f(m))):(m[a]=d,a=null,++r===h&&q(null,m))}}q=q||w;var h,k,m,r=0;C(d)?(h=d.length,m=e(h),a(d,l,s)):d&&(z&&d[z]?(m=e(0),(h=b(d,l,s))&&h===r&&q(null,m)):"object"===typeof d&&(k=F(d),h=k.length,m=e(h),c(d,l,s,k)));h||q(null,e())}}function wa(a,c,b,d){return function(e,f,g){function l(a,b){return function(c,e){null===a&&A();c?
+(a=null,g=I(g),g(c)):(!!e===d&&(h[a]=b),a=null,++k===q&&g(null,U(h)))}}g=g||w;var q,s,h,k=0;C(e)?(q=e.length,h=Array(q),a(e,f,l)):e&&(z&&e[z]?(h=[],(q=b(e,f,l))&&q===k&&g(null,U(h))):"object"===typeof e&&(s=F(e),q=s.length,h=Array(q),c(e,f,l,s)));if(!q)return g(null,[])}}function xa(a){return function(c,b,d){function e(){r=c[x];b(r,h)}function f(){r=c[x];b(r,x,h)}function g(){u=p.next();r=u.value;u.done?d(null,y):b(r,h)}function l(){u=p.next();r=u.value;u.done?d(null,y):b(r,x,h)}function q(){m=n[x];
+r=c[m];b(r,h)}function s(){m=n[x];r=c[m];b(r,m,h)}function h(b,c){b?d(b):(!!c===a&&(y[y.length]=r),++x===k?(v=A,d(null,y)):t?D(v):(t=!0,v()),t=!1)}d=E(d||w);var k,m,r,n,p,u,v,t=!1,x=0,y=[];C(c)?(k=c.length,v=3===b.length?f:e):c&&(z&&c[z]?(k=Infinity,p=c[z](),v=3===b.length?l:g):"object"===typeof c&&(n=F(c),k=n.length,v=3===b.length?s:q));if(!k)return d(null,[]);v()}}function ya(a){return function(c,b,d,e){function f(){r=B++;r<m&&(p=c[r],d(p,k(p,r)))}function g(){r=B++;r<m&&(p=c[r],d(p,r,k(p,r)))}
+function l(){t=v.next();!1===t.done?(p=t.value,d(p,k(p,B++))):R===B&&d!==w&&(d=w,e(null,U(y)))}function q(){t=v.next();!1===t.done?(p=t.value,d(p,B,k(p,B++))):R===B&&d!==w&&(d=w,e(null,U(y)))}function s(){r=B++;r<m&&(p=c[u[r]],d(p,k(p,r)))}function h(){r=B++;r<m&&(n=u[r],p=c[n],d(p,n,k(p,r)))}function k(b,d){return function(c,f){null===d&&A();c?(d=null,x=w,e=I(e),e(c)):(!!f===a&&(y[d]=b),d=null,++R===m?(e=E(e),e(null,U(y))):G?D(x):(G=!0,x()),G=!1)}}e=e||w;var m,r,n,p,u,v,t,x,y,G=!1,B=0,R=0;C(c)?(m=
+c.length,x=3===d.length?g:f):c&&(z&&c[z]?(m=Infinity,y=[],v=c[z](),x=3===d.length?q:l):"object"===typeof c&&(u=F(c),m=u.length,x=3===d.length?h:s));if(!m||isNaN(b)||1>b)return e(null,[]);y=y||Array(m);K(b>m?m:b,x)}}function Y(a,c,b){function d(){c(a[v],s)}function e(){c(a[v],v,s)}function f(){n=r.next();n.done?b(null):c(n.value,s)}function g(){n=r.next();n.done?b(null):c(n.value,v,s)}function l(){c(a[m[v]],s)}function q(){k=m[v];c(a[k],k,s)}function s(a,d){a?b(a):++v===h||!1===d?(p=A,b(null)):u?D(p):
+(u=!0,p());u=!1}b=E(b||w);var h,k,m,r,n,p,u=!1,v=0;C(a)?(h=a.length,p=3===c.length?e:d):a&&(z&&a[z]?(h=Infinity,r=a[z](),p=3===c.length?g:f):"object"===typeof a&&(m=F(a),h=m.length,p=3===c.length?q:l));if(!h)return b(null);p()}function Z(a,c,b,d){function e(){x<k&&b(a[x++],h)}function f(){m=x++;m<k&&b(a[m],m,h)}function g(){u=p.next();!1===u.done?(x++,b(u.value,h)):y===x&&b!==w&&(b=w,d(null))}function l(){u=p.next();!1===u.done?b(u.value,x++,h):y===x&&b!==w&&(b=w,d(null))}function q(){x<k&&b(a[n[x++]],
+h)}function s(){m=x++;m<k&&(r=n[m],b(a[r],r,h))}function h(a,c){a||!1===c?(v=w,d=I(d),d(a)):++y===k?(b=w,v=A,d=E(d),d(null)):t?D(v):(t=!0,v());t=!1}d=d||w;var k,m,r,n,p,u,v,t=!1,x=0,y=0;if(C(a))k=a.length,v=3===b.length?f:e;else if(a)if(z&&a[z])k=Infinity,p=a[z](),v=3===b.length?l:g;else if("object"===typeof a)n=F(a),k=n.length,v=3===b.length?s:q;else return d(null);if(!k||isNaN(c)||1>c)return d(null);K(c>k?k:c,v)}function za(a,c,b){function d(){c(a[t],s)}function e(){c(a[t],t,s)}function f(){n=r.next();
+n.done?b(null,p):c(n.value,s)}function g(){n=r.next();n.done?b(null,p):c(n.value,t,s)}function l(){c(a[m[t]],s)}function q(){k=m[t];c(a[k],k,s)}function s(a,d){a?(u=A,b=E(b),b(a,H(p))):(p[t]=d,++t===h?(u=A,b(null,p),b=A):v?D(u):(v=!0,u()),v=!1)}b=b||w;var h,k,m,r,n,p,u,v=!1,t=0;C(a)?(h=a.length,u=3===c.length?e:d):a&&(z&&a[z]?(h=Infinity,p=[],r=a[z](),u=3===c.length?g:f):"object"===typeof a&&(m=F(a),h=m.length,u=3===c.length?q:l));if(!h)return b(null,[]);p=p||Array(h);u()}function Aa(a,c,b,d){return function(e,
+f,g){function l(a){var b=!1;return function(c,e){b&&A();b=!0;c?(g=I(g),g(c)):!!e===d?(g=I(g),g(null,a)):++h===q&&g(null)}}g=g||w;var q,s,h=0;C(e)?(q=e.length,a(e,f,l)):e&&(z&&e[z]?(q=b(e,f,l))&&q===h&&g(null):"object"===typeof e&&(s=F(e),q=s.length,c(e,f,l,s)));q||g(null)}}function Ba(a){return function(c,b,d){function e(){r=c[x];b(r,h)}function f(){r=c[x];b(r,x,h)}function g(){u=p.next();r=u.value;u.done?d(null):b(r,h)}function l(){u=p.next();r=u.value;u.done?d(null):b(r,x,h)}function q(){r=c[n[x]];
+b(r,h)}function s(){m=n[x];r=c[m];b(r,m,h)}function h(b,c){b?d(b):!!c===a?(v=A,d(null,r)):++x===k?(v=A,d(null)):t?D(v):(t=!0,v());t=!1}d=E(d||w);var k,m,r,n,p,u,v,t=!1,x=0;C(c)?(k=c.length,v=3===b.length?f:e):c&&(z&&c[z]?(k=Infinity,p=c[z](),v=3===b.length?l:g):"object"===typeof c&&(n=F(c),k=n.length,v=3===b.length?s:q));if(!k)return d(null);v()}}function Ca(a){return function(c,b,d,e){function f(){r=G++;r<m&&(p=c[r],d(p,k(p)))}function g(){r=G++;r<m&&(p=c[r],d(p,r,k(p)))}function l(){t=v.next();
+!1===t.done?(G++,p=t.value,d(p,k(p))):B===G&&d!==w&&(d=w,e(null))}function q(){t=v.next();!1===t.done?(p=t.value,d(p,G++,k(p))):B===G&&d!==w&&(d=w,e(null))}function s(){r=G++;r<m&&(p=c[u[r]],d(p,k(p)))}function h(){G<m&&(n=u[G++],p=c[n],d(p,n,k(p)))}function k(b){var d=!1;return function(c,f){d&&A();d=!0;c?(x=w,e=I(e),e(c)):!!f===a?(x=w,e=I(e),e(null,b)):++B===m?e(null):y?D(x):(y=!0,x());y=!1}}e=e||w;var m,r,n,p,u,v,t,x,y=!1,G=0,B=0;C(c)?(m=c.length,x=3===d.length?g:f):c&&(z&&c[z]?(m=Infinity,v=c[z](),
+x=3===d.length?q:l):"object"===typeof c&&(u=F(c),m=u.length,x=3===d.length?h:s));if(!m||isNaN(b)||1>b)return e(null);K(b>m?m:b,x)}}function Da(a,c,b,d){return function(e,f,g){function l(a,b){return function(c,e){null===a&&A();c?(a=null,g=I(g),g(c,L(k))):(!!e===d&&(k[a]=b),a=null,++h===q&&g(null,k))}}g=g||w;var q,s,h=0,k={};C(e)?(q=e.length,a(e,f,l)):e&&(z&&e[z]?(q=b(e,f,l))&&q===h&&g(null,k):"object"===typeof e&&(s=F(e),q=s.length,c(e,f,l,s)));if(!q)return g(null,{})}}function Ea(a){return function(c,
+b,d){function e(){m=y;r=c[y];b(r,h)}function f(){m=y;r=c[y];b(r,y,h)}function g(){m=y;u=p.next();r=u.value;u.done?d(null,x):b(r,h)}function l(){m=y;u=p.next();r=u.value;u.done?d(null,x):b(r,m,h)}function q(){m=n[y];r=c[m];b(r,h)}function s(){m=n[y];r=c[m];b(r,m,h)}function h(b,c){b?d(b,x):(!!c===a&&(x[m]=r),++y===k?(v=A,d(null,x)):t?D(v):(t=!0,v()),t=!1)}d=E(d||w);var k,m,r,n,p,u,v,t=!1,x={},y=0;C(c)?(k=c.length,v=3===b.length?f:e):c&&(z&&c[z]?(k=Infinity,p=c[z](),v=3===b.length?l:g):"object"===typeof c&&
+(n=F(c),k=n.length,v=3===b.length?s:q));if(!k)return d(null,{});v()}}function Fa(a){return function(c,b,d,e){function f(){r=B++;r<m&&(p=c[r],d(p,k(p,r)))}function g(){r=B++;r<m&&(p=c[r],d(p,r,k(p,r)))}function l(){t=v.next();!1===t.done?(p=t.value,d(p,k(p,B++))):R===B&&d!==w&&(d=w,e(null,G))}function q(){t=v.next();!1===t.done?(p=t.value,d(p,B,k(p,B++))):R===B&&d!==w&&(d=w,e(null,G))}function s(){B<m&&(n=u[B++],p=c[n],d(p,k(p,n)))}function h(){B<m&&(n=u[B++],p=c[n],d(p,n,k(p,n)))}function k(b,d){return function(c,
+f){null===d&&A();c?(d=null,x=w,e=I(e),e(c,L(G))):(!!f===a&&(G[d]=b),d=null,++R===m?(x=A,e=E(e),e(null,G)):y?D(x):(y=!0,x()),y=!1)}}e=e||w;var m,r,n,p,u,v,t,x,y=!1,G={},B=0,R=0;C(c)?(m=c.length,x=3===d.length?g:f):c&&(z&&c[z]?(m=Infinity,v=c[z](),x=3===d.length?q:l):"object"===typeof c&&(u=F(c),m=u.length,x=3===d.length?h:s));if(!m||isNaN(b)||1>b)return e(null,{});K(b>m?m:b,x)}}function $(a,c,b,d){function e(d){b(d,a[t],h)}function f(d){b(d,a[t],t,h)}function g(a){p=n.next();p.done?d(null,a):b(a,p.value,
+h)}function l(a){p=n.next();p.done?d(null,a):b(a,p.value,t,h)}function q(d){b(d,a[r[t]],h)}function s(d){m=r[t];b(d,a[m],m,h)}function h(a,c){a?d(a,c):++t===k?(b=A,d(null,c)):v?D(function(){u(c)}):(v=!0,u(c));v=!1}d=E(d||w);var k,m,r,n,p,u,v=!1,t=0;C(a)?(k=a.length,u=4===b.length?f:e):a&&(z&&a[z]?(k=Infinity,n=a[z](),u=4===b.length?l:g):"object"===typeof a&&(r=F(a),k=r.length,u=4===b.length?s:q));if(!k)return d(null,c);u(c)}function Ga(a,c,b,d){function e(d){b(d,a[--s],q)}function f(d){b(d,a[--s],
+s,q)}function g(d){b(d,a[m[--s]],q)}function l(d){k=m[--s];b(d,a[k],k,q)}function q(a,b){a?d(a,b):0===s?(u=A,d(null,b)):v?D(function(){u(b)}):(v=!0,u(b));v=!1}d=E(d||w);var s,h,k,m,r,n,p,u,v=!1;if(C(a))s=a.length,u=4===b.length?f:e;else if(a)if(z&&a[z]){p=[];r=a[z]();for(h=-1;!1===(n=r.next()).done;)p[++h]=n.value;a=p;s=p.length;u=4===b.length?f:e}else"object"===typeof a&&(m=F(a),s=m.length,u=4===b.length?l:g);if(!s)return d(null,c);u(c)}function Ha(a,c,b){b=b||w;ja(a,c,function(a,c){if(a)return b(a);
+b(null,!!c)})}function Ia(a,c,b){b=b||w;ka(a,c,function(a,c){if(a)return b(a);b(null,!!c)})}function Ja(a,c,b,d){d=d||w;la(a,c,b,function(a,b){if(a)return d(a);d(null,!!b)})}function Ka(a,c){return C(a)?0===a.length?(c(null),!1):!0:(c(Error("First argument to waterfall must be an array of functions")),!1)}function ma(a,c,b){switch(c.length){case 0:case 1:return a(b);case 2:return a(c[1],b);case 3:return a(c[1],c[2],b);case 4:return a(c[1],c[2],c[3],b);case 5:return a(c[1],c[2],c[3],c[4],b);case 6:return a(c[1],
+c[2],c[3],c[4],c[5],b);default:return c=J(c,1),c.push(b),a.apply(null,c)}}function La(a,c){function b(b,h){if(b)q=A,c=E(c),c(b);else if(++d===f){q=A;var k=c;c=A;2===arguments.length?k(b,h):k.apply(null,H(arguments))}else g=a[d],l=arguments,e?D(q):(e=!0,q()),e=!1}c=c||w;if(Ka(a,c)){var d=0,e=!1,f=a.length,g=a[d],l=[],q=function(){switch(g.length){case 0:try{b(null,g())}catch(a){b(a)}break;case 1:return g(b);case 2:return g(l[1],b);case 3:return g(l[1],l[2],b);case 4:return g(l[1],l[2],l[3],b);case 5:return g(l[1],
+l[2],l[3],l[4],b);default:return l=J(l,1),l[g.length-1]=b,g.apply(null,l)}};q()}}function Ma(){var a=H(arguments);return function(){var c=this,b=H(arguments),d=b[b.length-1];"function"===typeof d?b.pop():d=w;$(a,b,function(a,b,d){a.push(function(a){var b=J(arguments,1);d(a,b)});b.apply(c,a)},function(a,b){b=C(b)?b:[b];b.unshift(a);d.apply(c,b)})}}function Na(a){return function(c){var b=function(){var b=this,d=H(arguments),g=d.pop()||w;return a(c,function(a,c){a.apply(b,d.concat([c]))},g)};if(1<arguments.length){var d=
+J(arguments,1);return b.apply(this,d)}return b}}function M(){this.tail=this.head=null;this.length=0}function na(a,c,b,d){function e(a){a={data:a,callback:m};r?n._tasks.unshift(a):n._tasks.push(a);D(n.process)}function f(a,b,d){if(null==b)b=w;else if("function"!==typeof b)throw Error("task callback must be a function");n.started=!0;var c=C(a)?a:[a];void 0!==a&&c.length?(r=d,m=b,Q(c,e),m=void 0):n.idle()&&D(n.drain)}function g(a,b){var d=!1;return function(c,e){d&&A();d=!0;h--;for(var f,g=-1,m=k.length,
+q=-1,l=b.length,n=2<arguments.length,r=n&&H(arguments);++q<l;){for(f=b[q];++g<m;)k[g]===f&&(0===g?k.shift():k.splice(g,1),g=m,m--);g=-1;n?f.callback.apply(f,r):f.callback(c,e);c&&a.error(c,f.data)}h<=a.concurrency-a.buffer&&a.unsaturated();0===a._tasks.length+h&&a.drain();a.process()}}function l(){for(;!n.paused&&h<n.concurrency&&n._tasks.length;){var a=n._tasks.shift();h++;k.push(a);0===n._tasks.length&&n.empty();h===n.concurrency&&n.saturated();var b=g(n,[a]);c(a.data,b)}}function q(){for(;!n.paused&&
+h<n.concurrency&&n._tasks.length;){for(var a=n._tasks.splice(n.payload||n._tasks.length),b=-1,d=a.length,e=Array(d);++b<d;)e[b]=a[b].data;h++;X.apply(k,a);0===n._tasks.length&&n.empty();h===n.concurrency&&n.saturated();a=g(n,a);c(e,a)}}function s(){D(n.process)}if(void 0===b)b=1;else if(isNaN(b)||1>b)throw Error("Concurrency must not be zero");var h=0,k=[],m,r,n={_tasks:new M,concurrency:b,payload:d,saturated:w,unsaturated:w,buffer:b/4,empty:w,drain:w,error:w,started:!1,paused:!1,push:function(a,
+b){f(a,b)},kill:function(){n.drain=w;n._tasks.empty()},unshift:function(a,b){f(a,b,!0)},remove:function(a){n._tasks.remove(a)},process:a?l:q,length:function(){return n._tasks.length},running:function(){return h},workersList:function(){return k},idle:function(){return 0===n.length()+h},pause:function(){n.paused=!0},resume:function(){!1!==n.paused&&(n.paused=!1,K(n.concurrency<n._tasks.length?n.concurrency:n._tasks.length,s))},_worker:c};return n}function Oa(a,c,b){function d(){if(0===s.length&&0===
+q){if(0!==g)throw Error("async.auto task has cyclic dependencies");return b(null,l)}for(;s.length&&q<c&&b!==w;){q++;var a=s.shift();if(0===a[1])a[0](a[2]);else a[0](l,a[2])}}function e(a){Q(h[a]||[],function(a){a()});d()}"function"===typeof c&&(b=c,c=null);var f=F(a),g=f.length,l={};if(0===g)return b(null,l);var q=0,s=new M,h=Object.create(null);b=E(b||w);c=c||g;W(a,function(a,d){function c(a,f){null===d&&A();f=2>=arguments.length?f:J(arguments,1);if(a){q=g=0;s.length=0;var k=L(l);k[d]=f;d=null;var h=
+b;b=w;h(a,k)}else q--,g--,l[d]=f,e(d),d=null}function n(){0===--v&&s.push([p,u,c])}var p,u;if(C(a)){var v=a.length-1;p=a[v];u=v;if(0===v)s.push([p,u,c]);else for(var t=-1;++t<v;){var x=a[t];if($a(f,x))throw t="async.auto task `"+d+"` has non-existent dependency `"+x+"` in "+a.join(", "),Error(t);var y=h[x];y||(y=h[x]=[]);y.push(n)}}else p=a,u=0,s.push([p,u,c])},f);d()}function ab(a){a=a.toString().replace(bb,"");a=(a=a.match(cb)[2].replace(" ",""))?a.split(db):[];return a=a.map(function(a){return a.replace(eb,
+"").trim()})}function oa(a,c,b){function d(a,e){if(++s===g||!a||q&&!q(a)){if(2>=arguments.length)return b(a,e);var f=H(arguments);return b.apply(null,f)}c(d)}function e(){c(f)}function f(a,d){if(++s===g||!a||q&&!q(a)){if(2>=arguments.length)return b(a,d);var c=H(arguments);return b.apply(null,c)}setTimeout(e,l(s))}var g,l,q,s=0;if(3>arguments.length&&"function"===typeof a)b=c||w,c=a,a=null,g=5;else switch(b=b||w,typeof a){case "object":"function"===typeof a.errorFilter&&(q=a.errorFilter);var h=a.interval;
+switch(typeof h){case "function":l=h;break;case "string":case "number":l=(h=+h)?function(){return h}:function(){return 0}}g=+a.times||5;break;case "number":g=a||5;break;case "string":g=+a||5;break;default:throw Error("Invalid arguments for async.retry");}if("function"!==typeof c)throw Error("Invalid arguments for async.retry");l?c(f):c(d)}function Pa(a){return function(){var c=H(arguments),b=c.pop(),d;try{d=a.apply(this,c)}catch(e){return b(e)}d&&"function"===typeof d.then?d.then(function(a){try{b(null,
+a)}catch(d){D(Qa,d)}},function(a){a=a&&a.message?a:Error(a);try{b(a,void 0)}catch(d){D(Qa,d)}}):b(null,d)}}function Qa(a){throw a;}function Ra(a){return function(){function c(a,d){if(a)return b(null,{error:a});2<arguments.length&&(d=J(arguments,1));b(null,{value:d})}var b;switch(arguments.length){case 1:return b=arguments[0],a(c);case 2:return b=arguments[1],a(arguments[0],c);default:var d=H(arguments),e=d.length-1;b=d[e];d[e]=c;a.apply(this,d)}}}function pa(a){function c(b){if("object"===typeof console)if(b)console.error&&
+console.error(b);else if(console[a]){var d=J(arguments,1);Q(d,function(b){console[a](b)})}}return function(a){var d=J(arguments,1);d.push(c);a.apply(null,d)}}var w=function(){},A=function(){throw Error("Callback was already called.");},C=Array.isArray,F=Object.keys,X=Array.prototype.push,z="function"===typeof Symbol&&Symbol.iterator,D,ba,T;O();var aa=function(a,c,b){return function(d,e,f){function g(a,b){a?(f=I(f),f(a)):++s===l?f(null):!1===b&&(f=I(f),f(null))}f=I(f||w);var l,q,s=0;C(d)?(l=d.length,
+a(d,e,g)):d&&(z&&d[z]?(l=b(d,e,g))&&l===s&&f(null):"object"===typeof d&&(q=F(d),l=q.length,c(d,e,g,q)));l||f(null)}}(function(a,c,b){var d=-1,e=a.length;if(3===c.length)for(;++d<e;)c(a[d],d,E(b));else for(;++d<e;)c(a[d],E(b))},function(a,c,b,d){var e,f=-1,g=d.length;if(3===c.length)for(;++f<g;)e=d[f],c(a[e],e,E(b));else for(;++f<g;)c(a[d[f]],E(b))},function(a,c,b){a=a[z]();var d=0,e;if(3===c.length)for(;!1===(e=a.next()).done;)c(e.value,d++,E(b));else for(;!1===(e=a.next()).done;)d++,c(e.value,E(b));
+return d}),Sa=va(da,ra,sa,!0),fb=va(da,function(a,c,b,d){var e,f=-1,g=d.length;if(3===c.length)for(;++f<g;)e=d[f],c(a[e],e,b(e));else for(;++f<g;)e=d[f],c(a[e],b(e))},function(a,c,b){var d=0,e=a[z]();if(3===c.length)for(;!1===(a=e.next()).done;)c(a.value,d,b(d++));else for(;!1===(a=e.next()).done;)c(a.value,b(d++));return d},!1),Ta=wa(V,ha,ia,!0),Ua=xa(!0),Va=ya(!0),gb=wa(V,ha,ia,!1),hb=xa(!1),ib=ya(!1),ja=Aa(ea,fa,ga,!0),ka=Ba(!0),la=Ca(!0),Wa=function(a,c,b){var d=Aa(a,c,b,!1);return function(a,
+b,c){c=c||w;d(a,b,function(a,b){if(a)return c(a);c(null,!b)})}}(ea,fa,ga),Xa=function(){var a=Ba(!1);return function(c,b,d){d=d||w;a(c,b,function(a,b){if(a)return d(a);d(null,!b)})}}(),Ya=function(){var a=Ca(!1);return function(c,b,d,e){e=e||w;a(c,b,d,function(a,b){if(a)return e(a);e(null,!b)})}}(),jb=Da(V,ta,ua,!0),kb=Ea(!0),lb=Fa(!0),mb=Da(V,ta,ua,!1),nb=Ea(!1),ob=Fa(!1),pb=function(a,c,b){return function(d,e,f,g){function l(a,b){a?(g=I(g),g(a,C(h)?H(h):L(h))):++k===q?g(null,h):!1===b&&(g=I(g),
+g(null,C(h)?H(h):L(h)))}3===arguments.length&&(g=f,f=e,e=void 0);g=g||w;var q,s,h,k=0;C(d)?(q=d.length,h=void 0!==e?e:[],a(d,h,f,l)):d&&(z&&d[z]?(h=void 0!==e?e:{},(q=b(d,h,f,l))&&q===k&&g(null,h)):"object"===typeof d&&(s=F(d),q=s.length,h=void 0!==e?e:{},c(d,h,f,l,s)));q||g(null,void 0!==e?e:h||{})}}(function(a,c,b,d){var e=-1,f=a.length;if(4===b.length)for(;++e<f;)b(c,a[e],e,E(d));else for(;++e<f;)b(c,a[e],E(d))},function(a,c,b,d,e){var f,g=-1,l=e.length;if(4===b.length)for(;++g<l;)f=e[g],b(c,a[f],
+f,E(d));else for(;++g<l;)b(c,a[e[g]],E(d))},function(a,c,b,d){var e=0,f=a[z]();if(4===b.length)for(;!1===(a=f.next()).done;)b(c,a.value,e++,E(d));else for(;!1===(a=f.next()).done;)e++,b(c,a.value,E(d));return e}),qb=function(a,c,b){return function(d,e,f){function g(a,b){var d=!1;q[a]=b;return function(b,c){d&&A();d=!0;s[a]=c;b?(f=I(f),f(b)):++h===l&&f(null,P(q,s))}}f=f||w;var l,q,s,h=0;if(C(d))l=d.length,q=Array(l),s=Array(l),a(d,e,g);else if(d)if(z&&d[z])q=[],s=[],(l=b(d,e,g))&&l===h&&f(null,P(q,
+s));else if("object"===typeof d){var k=F(d);l=k.length;q=Array(l);s=Array(l);c(d,e,g,k)}l||f(null,[])}}(V,ha,ia),rb=function(a,c,b){return function(d,e,f){function g(a){return function(b,d){null===a&&A();if(b)a=null,f=I(f),Q(q,function(a,b){void 0===a&&(q[b]=w)}),f(b,S(q));else{switch(arguments.length){case 0:case 1:q[a]=w;break;case 2:q[a]=d;break;default:q[a]=J(arguments,1)}a=null;++s===l&&f(null,S(q))}}}f=f||w;var l,q,s=0;if(C(d))l=d.length,q=Array(l),a(d,e,g);else if(d)if(z&&d[z])q=[],(l=b(d,
+e,g))&&l===s&&f(null,q);else if("object"===typeof d){var h=F(d);l=h.length;q=Array(l);c(d,e,g,h)}l||f(null,[])}}(da,ra,sa),sb=function(a,c,b){return function(d,e,f){function g(a){var b=!1;return function(d,c){b&&A();b=!0;if(d)f=I(f),f(d,L(s));else{var e=s[c];e?e.push(a):s[c]=[a];++q===l&&f(null,s)}}}f=f||w;var l,q=0,s={};if(C(d))l=d.length,a(d,e,g);else if(d)if(z&&d[z])(l=b(d,e,g))&&l===q&&f(null,s);else if("object"===typeof d){var h=F(d);l=h.length;c(d,e,g,h)}l||f(null,{})}}(ea,fa,ga),tb=function(a,
+c){return function(b,d){function e(a){return function(b,c){null===a&&A();b?(a=null,d=I(d),d(b,l)):(l[a]=2>=arguments.length?c:J(arguments,1),a=null,++q===f&&d(null,l))}}d=d||w;var f,g,l,q=0;C(b)?(f=b.length,l=Array(f),a(b,e)):b&&"object"===typeof b&&(g=F(b),f=g.length,l={},c(b,e,g));f||d(null,l)}}(function(a,c){for(var b=-1,d=a.length;++b<d;)a[b](c(b))},function(a,c,b){for(var d,e=-1,f=b.length;++e<f;)d=b[e],a[d](c(d))}),ub=Na(Sa),vb=Na(za),wb=pa("log"),xb=pa("dir"),qa={VERSION:"2.6.2",each:aa,eachSeries:Y,
+eachLimit:Z,forEach:aa,forEachSeries:Y,forEachLimit:Z,eachOf:aa,eachOfSeries:Y,eachOfLimit:Z,forEachOf:aa,forEachOfSeries:Y,forEachOfLimit:Z,map:Sa,mapSeries:za,mapLimit:function(a,c,b,d){function e(){m=y++;m<k&&b(a[m],h(m))}function f(){m=y++;m<k&&b(a[m],m,h(m))}function g(){u=p.next();!1===u.done?b(u.value,h(y++)):G===y&&b!==w&&(b=w,d(null,v))}function l(){u=p.next();!1===u.done?b(u.value,y,h(y++)):G===y&&b!==w&&(b=w,d(null,v))}function q(){m=y++;m<k&&b(a[n[m]],h(m))}function s(){m=y++;m<k&&(r=
+n[m],b(a[r],r,h(m)))}function h(a){return function(b,c){null===a&&A();b?(a=null,t=w,d=I(d),d(b,H(v))):(v[a]=c,a=null,++G===k?(t=A,d(null,v),d=A):x?D(t):(x=!0,t()),x=!1)}}d=d||w;var k,m,r,n,p,u,v,t,x=!1,y=0,G=0;C(a)?(k=a.length,t=3===b.length?f:e):a&&(z&&a[z]?(k=Infinity,v=[],p=a[z](),t=3===b.length?l:g):"object"===typeof a&&(n=F(a),k=n.length,t=3===b.length?s:q));if(!k||isNaN(c)||1>c)return d(null,[]);v=v||Array(k);K(c>k?k:c,t)},mapValues:fb,mapValuesSeries:function(a,c,b){function d(){k=t;c(a[t],
+s)}function e(){k=t;c(a[t],t,s)}function f(){k=t;n=r.next();n.done?b(null,v):c(n.value,s)}function g(){k=t;n=r.next();n.done?b(null,v):c(n.value,t,s)}function l(){k=m[t];c(a[k],s)}function q(){k=m[t];c(a[k],k,s)}function s(a,d){a?(p=A,b=E(b),b(a,L(v))):(v[k]=d,++t===h?(p=A,b(null,v),b=A):u?D(p):(u=!0,p()),u=!1)}b=b||w;var h,k,m,r,n,p,u=!1,v={},t=0;C(a)?(h=a.length,p=3===c.length?e:d):a&&(z&&a[z]?(h=Infinity,r=a[z](),p=3===c.length?g:f):"object"===typeof a&&(m=F(a),h=m.length,p=3===c.length?q:l));
+if(!h)return b(null,v);p()},mapValuesLimit:function(a,c,b,d){function e(){m=y++;m<k&&b(a[m],h(m))}function f(){m=y++;m<k&&b(a[m],m,h(m))}function g(){u=p.next();!1===u.done?b(u.value,h(y++)):G===y&&b!==w&&(b=w,d(null,x))}function l(){u=p.next();!1===u.done?b(u.value,y,h(y++)):G===y&&b!==w&&(b=w,d(null,x))}function q(){m=y++;m<k&&(r=n[m],b(a[r],h(r)))}function s(){m=y++;m<k&&(r=n[m],b(a[r],r,h(r)))}function h(a){return function(b,c){null===a&&A();b?(a=null,v=w,d=I(d),d(b,L(x))):(x[a]=c,a=null,++G===
+k?d(null,x):t?D(v):(t=!0,v()),t=!1)}}d=d||w;var k,m,r,n,p,u,v,t=!1,x={},y=0,G=0;C(a)?(k=a.length,v=3===b.length?f:e):a&&(z&&a[z]?(k=Infinity,p=a[z](),v=3===b.length?l:g):"object"===typeof a&&(n=F(a),k=n.length,v=3===b.length?s:q));if(!k||isNaN(c)||1>c)return d(null,x);K(c>k?k:c,v)},filter:Ta,filterSeries:Ua,filterLimit:Va,select:Ta,selectSeries:Ua,selectLimit:Va,reject:gb,rejectSeries:hb,rejectLimit:ib,detect:ja,detectSeries:ka,detectLimit:la,find:ja,findSeries:ka,findLimit:la,pick:jb,pickSeries:kb,
+pickLimit:lb,omit:mb,omitSeries:nb,omitLimit:ob,reduce:$,inject:$,foldl:$,reduceRight:Ga,foldr:Ga,transform:pb,transformSeries:function(a,c,b,d){function e(){b(v,a[x],h)}function f(){b(v,a[x],x,h)}function g(){p=n.next();p.done?d(null,v):b(v,p.value,h)}function l(){p=n.next();p.done?d(null,v):b(v,p.value,x,h)}function q(){b(v,a[r[x]],h)}function s(){m=r[x];b(v,a[m],m,h)}function h(a,b){a?d(a,v):++x===k||!1===b?(u=A,d(null,v)):t?D(u):(t=!0,u());t=!1}3===arguments.length&&(d=b,b=c,c=void 0);d=E(d||
+w);var k,m,r,n,p,u,v,t=!1,x=0;C(a)?(k=a.length,v=void 0!==c?c:[],u=4===b.length?f:e):a&&(z&&a[z]?(k=Infinity,n=a[z](),v=void 0!==c?c:{},u=4===b.length?l:g):"object"===typeof a&&(r=F(a),k=r.length,v=void 0!==c?c:{},u=4===b.length?s:q));if(!k)return d(null,void 0!==c?c:v||{});u()},transformLimit:function(a,c,b,d,e){function f(){r=A++;r<m&&d(x,a[r],E(k))}function g(){r=A++;r<m&&d(x,a[r],r,E(k))}function l(){v=u.next();!1===v.done?(A++,d(x,v.value,E(k))):B===A&&d!==w&&(d=w,e(null,x))}function q(){v=u.next();
+!1===v.done?d(x,v.value,A++,E(k)):B===A&&d!==w&&(d=w,e(null,x))}function s(){r=A++;r<m&&d(x,a[p[r]],E(k))}function h(){r=A++;r<m&&(n=p[r],d(x,a[n],n,E(k)))}function k(a,b){a||!1===b?(t=w,e(a||null,C(x)?H(x):L(x)),e=w):++B===m?(d=w,e(null,x)):y?D(t):(y=!0,t());y=!1}4===arguments.length&&(e=d,d=b,b=void 0);e=e||w;var m,r,n,p,u,v,t,x,y=!1,A=0,B=0;C(a)?(m=a.length,x=void 0!==b?b:[],t=4===d.length?g:f):a&&(z&&a[z]?(m=Infinity,u=a[z](),x=void 0!==b?b:{},t=4===d.length?q:l):"object"===typeof a&&(p=F(a),
+m=p.length,x=void 0!==b?b:{},t=4===d.length?h:s));if(!m||isNaN(c)||1>c)return e(null,void 0!==b?b:x||{});K(c>m?m:c,t)},sortBy:qb,sortBySeries:function(a,c,b){function d(){m=a[y];c(m,s)}function e(){m=a[y];c(m,y,s)}function f(){p=n.next();if(p.done)return b(null,P(u,v));m=p.value;u[y]=m;c(m,s)}function g(){p=n.next();if(p.done)return b(null,P(u,v));m=p.value;u[y]=m;c(m,y,s)}function l(){m=a[r[y]];u[y]=m;c(m,s)}function q(){k=r[y];m=a[k];u[y]=m;c(m,k,s)}function s(a,d){v[y]=d;a?b(a):++y===h?(t=A,b(null,
+P(u,v))):x?D(t):(x=!0,t());x=!1}b=E(b||w);var h,k,m,r,n,p,u,v,t,x=!1,y=0;C(a)?(h=a.length,u=a,v=Array(h),t=3===c.length?e:d):a&&(z&&a[z]?(h=Infinity,u=[],v=[],n=a[z](),t=3===c.length?g:f):"object"===typeof a&&(r=F(a),h=r.length,u=Array(h),v=Array(h),t=3===c.length?q:l));if(!h)return b(null,[]);t()},sortByLimit:function(a,c,b,d){function e(){B<k&&(n=a[B],b(n,h(n,B++)))}function f(){m=B++;m<k&&(n=a[m],b(n,m,h(n,m)))}function g(){t=v.next();!1===t.done?(n=t.value,p[B]=n,b(n,h(n,B++))):E===B&&b!==w&&
+(b=w,d(null,P(p,x)))}function l(){t=v.next();!1===t.done?(n=t.value,p[B]=n,b(n,B,h(n,B++))):E===B&&b!==w&&(b=w,d(null,P(p,x)))}function q(){B<k&&(n=a[u[B]],p[B]=n,b(n,h(n,B++)))}function s(){B<k&&(r=u[B],n=a[r],p[B]=n,b(n,r,h(n,B++)))}function h(a,b){var c=!1;return function(a,e){c&&A();c=!0;x[b]=e;a?(y=w,d(a),d=w):++E===k?d(null,P(p,x)):G?D(y):(G=!0,y());G=!1}}d=d||w;var k,m,r,n,p,u,v,t,x,y,G=!1,B=0,E=0;C(a)?(k=a.length,p=a,y=3===b.length?f:e):a&&(z&&a[z]?(k=Infinity,v=a[z](),p=[],x=[],y=3===b.length?
+l:g):"object"===typeof a&&(u=F(a),k=u.length,p=Array(k),y=3===b.length?s:q));if(!k||isNaN(c)||1>c)return d(null,[]);x=x||Array(k);K(c>k?k:c,y)},some:Ha,someSeries:Ia,someLimit:Ja,any:Ha,anySeries:Ia,anyLimit:Ja,every:Wa,everySeries:Xa,everyLimit:Ya,all:Wa,allSeries:Xa,allLimit:Ya,concat:rb,concatSeries:function(a,c,b){function d(){c(a[t],s)}function e(){c(a[t],t,s)}function f(){n=r.next();n.done?b(null,v):c(n.value,s)}function g(){n=r.next();n.done?b(null,v):c(n.value,t,s)}function l(){c(a[m[t]],
+s)}function q(){k=m[t];c(a[k],k,s)}function s(a,d){C(d)?X.apply(v,d):2<=arguments.length&&X.apply(v,J(arguments,1));a?b(a,v):++t===h?(p=A,b(null,v)):u?D(p):(u=!0,p());u=!1}b=E(b||w);var h,k,m,r,n,p,u=!1,v=[],t=0;C(a)?(h=a.length,p=3===c.length?e:d):a&&(z&&a[z]?(h=Infinity,r=a[z](),p=3===c.length?g:f):"object"===typeof a&&(m=F(a),h=m.length,p=3===c.length?q:l));if(!h)return b(null,v);p()},concatLimit:function(a,c,b,d){function e(){t<k&&b(a[t],h(t++))}function f(){t<k&&b(a[t],t,h(t++))}function g(){n=
+r.next();!1===n.done?b(n.value,h(t++)):x===t&&b!==w&&(b=w,d(null,S(u)))}function l(){n=r.next();!1===n.done?b(n.value,t,h(t++)):x===t&&b!==w&&(b=w,d(null,S(u)))}function q(){t<k&&b(a[y[t]],h(t++))}function s(){t<k&&(m=y[t],b(a[m],m,h(t++)))}function h(a){return function(b,c){null===a&&A();if(b)a=null,p=w,d=I(d),Q(u,function(a,b){void 0===a&&(u[b]=w)}),d(b,S(u));else{switch(arguments.length){case 0:case 1:u[a]=w;break;case 2:u[a]=c;break;default:u[a]=J(arguments,1)}a=null;++x===k?(p=A,d(null,S(u)),
+d=A):v?D(p):(v=!0,p());v=!1}}}d=d||w;var k,m,r,n,p,u,v=!1,t=0,x=0;if(C(a))k=a.length,p=3===b.length?f:e;else if(a)if(z&&a[z])k=Infinity,u=[],r=a[z](),p=3===b.length?l:g;else if("object"===typeof a){var y=F(a);k=y.length;p=3===b.length?s:q}if(!k||isNaN(c)||1>c)return d(null,[]);u=u||Array(k);K(c>k?k:c,p)},groupBy:sb,groupBySeries:function(a,c,b){function d(){m=a[t];c(m,s)}function e(){m=a[t];c(m,t,s)}function f(){p=n.next();m=p.value;p.done?b(null,x):c(m,s)}function g(){p=n.next();m=p.value;p.done?
+b(null,x):c(m,t,s)}function l(){m=a[r[t]];c(m,s)}function q(){k=r[t];m=a[k];c(m,k,s)}function s(a,d){if(a)u=A,b=E(b),b(a,L(x));else{var c=x[d];c?c.push(m):x[d]=[m];++t===h?(u=A,b(null,x)):v?D(u):(v=!0,u());v=!1}}b=E(b||w);var h,k,m,r,n,p,u,v=!1,t=0,x={};C(a)?(h=a.length,u=3===c.length?e:d):a&&(z&&a[z]?(h=Infinity,n=a[z](),u=3===c.length?g:f):"object"===typeof a&&(r=F(a),h=r.length,u=3===c.length?q:l));if(!h)return b(null,x);u()},groupByLimit:function(a,c,b,d){function e(){y<k&&(n=a[y++],b(n,h(n)))}
+function f(){m=y++;m<k&&(n=a[m],b(n,m,h(n)))}function g(){v=u.next();!1===v.done?(y++,n=v.value,b(n,h(n))):E===y&&b!==w&&(b=w,d(null,B))}function l(){v=u.next();!1===v.done?(n=v.value,b(n,y++,h(n))):E===y&&b!==w&&(b=w,d(null,B))}function q(){y<k&&(n=a[p[y++]],b(n,h(n)))}function s(){y<k&&(r=p[y++],n=a[r],b(n,r,h(n)))}function h(a){var b=!1;return function(c,e){b&&A();b=!0;if(c)t=w,d=I(d),d(c,L(B));else{var f=B[e];f?f.push(a):B[e]=[a];++E===k?d(null,B):x?D(t):(x=!0,t());x=!1}}}d=d||w;var k,m,r,n,p,
+u,v,t,x=!1,y=0,E=0,B={};C(a)?(k=a.length,t=3===b.length?f:e):a&&(z&&a[z]?(k=Infinity,u=a[z](),t=3===b.length?l:g):"object"===typeof a&&(p=F(a),k=p.length,t=3===b.length?s:q));if(!k||isNaN(c)||1>c)return d(null,B);K(c>k?k:c,t)},parallel:tb,series:function(a,c){function b(){g=k;a[k](e)}function d(){g=l[k];a[g](e)}function e(a,b){a?(s=A,c=E(c),c(a,q)):(q[g]=2>=arguments.length?b:J(arguments,1),++k===f?(s=A,c(null,q)):h?D(s):(h=!0,s()),h=!1)}c=c||w;var f,g,l,q,s,h=!1,k=0;if(C(a))f=a.length,q=Array(f),
+s=b;else if(a&&"object"===typeof a)l=F(a),f=l.length,q={},s=d;else return c(null);if(!f)return c(null,q);s()},parallelLimit:function(a,c,b){function d(){l=r++;if(l<g)a[l](f(l))}function e(){r<g&&(q=s[r++],a[q](f(q)))}function f(a){return function(d,c){null===a&&A();d?(a=null,k=w,b=I(b),b(d,h)):(h[a]=2>=arguments.length?c:J(arguments,1),a=null,++n===g?b(null,h):m?D(k):(m=!0,k()),m=!1)}}b=b||w;var g,l,q,s,h,k,m=!1,r=0,n=0;C(a)?(g=a.length,h=Array(g),k=d):a&&"object"===typeof a&&(s=F(a),g=s.length,h=
+{},k=e);if(!g||isNaN(c)||1>c)return b(null,h);K(c>g?g:c,k)},tryEach:function(a,c){function b(){a[q](e)}function d(){a[g[q]](e)}function e(a,b){a?++q===f?c(a):l():2>=arguments.length?c(null,b):c(null,J(arguments,1))}c=c||w;var f,g,l,q=0;C(a)?(f=a.length,l=b):a&&"object"===typeof a&&(g=F(a),f=g.length,l=d);if(!f)return c(null);l()},waterfall:function(a,c){function b(){ma(e,f,d(e))}function d(h){return function(k,m){void 0===h&&(c=w,A());h=void 0;k?(g=c,c=A,g(k)):++q===s?(g=c,c=A,2>=arguments.length?
+g(k,m):g.apply(null,H(arguments))):(l?(f=arguments,e=a[q]||A,D(b)):(l=!0,ma(a[q]||A,arguments,d(q))),l=!1)}}c=c||w;if(Ka(a,c)){var e,f,g,l,q=0,s=a.length;ma(a[0],[],d(0))}},angelFall:La,angelfall:La,whilst:function(a,c,b){function d(){g?D(e):(g=!0,c(f));g=!1}function e(){c(f)}function f(c,e){if(c)return b(c);2>=arguments.length?a(e)?d():b(null,e):(e=J(arguments,1),a.apply(null,e)?d():b.apply(null,[null].concat(e)))}b=b||w;var g=!1;a()?d():b(null)},doWhilst:function(a,c,b){function d(){g?D(e):(g=!0,
+a(f));g=!1}function e(){a(f)}function f(a,e){if(a)return b(a);2>=arguments.length?c(e)?d():b(null,e):(e=J(arguments,1),c.apply(null,e)?d():b.apply(null,[null].concat(e)))}b=b||w;var g=!1;e()},until:function(a,c,b){function d(){g?D(e):(g=!0,c(f));g=!1}function e(){c(f)}function f(c,e){if(c)return b(c);2>=arguments.length?a(e)?b(null,e):d():(e=J(arguments,1),a.apply(null,e)?b.apply(null,[null].concat(e)):d())}b=b||w;var g=!1;a()?b(null):d()},doUntil:function(a,c,b){function d(){g?D(e):(g=!0,a(f));g=
+!1}function e(){a(f)}function f(a,e){if(a)return b(a);2>=arguments.length?c(e)?b(null,e):d():(e=J(arguments,1),c.apply(null,e)?b.apply(null,[null].concat(e)):d())}b=b||w;var g=!1;e()},during:function(a,c,b){function d(a,d){if(a)return b(a);d?c(e):b(null)}function e(c){if(c)return b(c);a(d)}b=b||w;a(d)},doDuring:function(a,c,b){function d(d,c){if(d)return b(d);c?a(e):b(null)}function e(a,e){if(a)return b(a);switch(arguments.length){case 0:case 1:c(d);break;case 2:c(e,d);break;default:var l=J(arguments,
+1);l.push(d);c.apply(null,l)}}b=b||w;d(null,!0)},forever:function(a,c){function b(){a(d)}function d(a){if(a){if(c)return c(a);throw a;}e?D(b):(e=!0,b());e=!1}var e=!1;b()},compose:function(){return Ma.apply(null,Za(arguments))},seq:Ma,applyEach:ub,applyEachSeries:vb,queue:function(a,c){return na(!0,a,c)},priorityQueue:function(a,c){var b=na(!0,a,c);b.push=function(a,c,f){b.started=!0;c=c||0;var g=C(a)?a:[a],l=g.length;if(void 0===a||0===l)b.idle()&&D(b.drain);else{f="function"===typeof f?f:w;for(a=
+b._tasks.head;a&&c>=a.priority;)a=a.next;for(;l--;){var q={data:g[l],priority:c,callback:f};a?b._tasks.insertBefore(a,q):b._tasks.push(q);D(b.process)}}};delete b.unshift;return b},cargo:function(a,c){return na(!1,a,1,c)},auto:Oa,autoInject:function(a,c,b){var d={};W(a,function(a,b){var c,l=a.length;if(C(a)){if(0===l)throw Error("autoInject task functions require explicit parameters.");c=H(a);l=c.length-1;a=c[l];if(0===l){d[b]=a;return}}else{if(1===l){d[b]=a;return}c=ab(a);if(0===l&&0===c.length)throw Error("autoInject task functions require explicit parameters.");
+l=c.length-1}c[l]=function(b,d){switch(l){case 1:a(b[c[0]],d);break;case 2:a(b[c[0]],b[c[1]],d);break;case 3:a(b[c[0]],b[c[1]],b[c[2]],d);break;default:for(var f=-1;++f<l;)c[f]=b[c[f]];c[f]=d;a.apply(null,c)}};d[b]=c},F(a));Oa(d,c,b)},retry:oa,retryable:function(a,c){c||(c=a,a=null);return function(){function b(a){c(a)}function d(a){c(g[0],a)}function e(a){c(g[0],g[1],a)}var f,g=H(arguments),l=g.length-1,q=g[l];switch(c.length){case 1:f=b;break;case 2:f=d;break;case 3:f=e;break;default:f=function(a){g[l]=
+a;c.apply(null,g)}}a?oa(a,f,q):oa(f,q)}},iterator:function(a){function c(e){var f=function(){b&&a[d[e]||e].apply(null,H(arguments));return f.next()};f.next=function(){return e<b-1?c(e+1):null};return f}var b=0,d=[];C(a)?b=a.length:(d=F(a),b=d.length);return c(0)},times:function(a,c,b){function d(c){return function(d,l){null===c&&A();e[c]=l;c=null;d?(b(d),b=w):0===--a&&b(null,e)}}b=b||w;a=+a;if(isNaN(a)||1>a)return b(null,[]);var e=Array(a);K(a,function(a){c(a,d(a))})},timesSeries:function(a,c,b){function d(){c(l,
+e)}function e(c,e){f[l]=e;c?(b(c),b=A):++l>=a?(b(null,f),b=A):g?D(d):(g=!0,d());g=!1}b=b||w;a=+a;if(isNaN(a)||1>a)return b(null,[]);var f=Array(a),g=!1,l=0;d()},timesLimit:function(a,c,b,d){function e(){var c=q++;c<a&&b(c,f(c))}function f(b){return function(c,f){null===b&&A();g[b]=f;b=null;c?(d(c),d=w):++s>=a?(d(null,g),d=A):l?D(e):(l=!0,e());l=!1}}d=d||w;a=+a;if(isNaN(a)||1>a||isNaN(c)||1>c)return d(null,[]);var g=Array(a),l=!1,q=0,s=0;K(c>a?a:c,e)},race:function(a,c){c=I(c||w);var b,d,e=-1;if(C(a))for(b=
+a.length;++e<b;)a[e](c);else if(a&&"object"===typeof a)for(d=F(a),b=d.length;++e<b;)a[d[e]](c);else return c(new TypeError("First argument to race must be a collection of functions"));b||c(null)},apply:function(a){switch(arguments.length){case 0:case 1:return a;case 2:return a.bind(null,arguments[1]);case 3:return a.bind(null,arguments[1],arguments[2]);case 4:return a.bind(null,arguments[1],arguments[2],arguments[3]);case 5:return a.bind(null,arguments[1],arguments[2],arguments[3],arguments[4]);default:var c=
+arguments.length,b=0,d=Array(c);for(d[b]=null;++b<c;)d[b]=arguments[b];return a.bind.apply(a,d)}},nextTick:ba,setImmediate:T,memoize:function(a,c){c=c||function(a){return a};var b={},d={},e=function(){function e(a){var c=H(arguments);a||(b[q]=c);var f=d[q];delete d[q];for(var g=-1,l=f.length;++g<l;)f[g].apply(null,c)}var g=H(arguments),l=g.pop(),q=c.apply(null,g);if(b.hasOwnProperty(q))D(function(){l.apply(null,b[q])});else{if(d.hasOwnProperty(q))return d[q].push(l);d[q]=[l];g.push(e);a.apply(null,
+g)}};e.memo=b;e.unmemoized=a;return e},unmemoize:function(a){return function(){return(a.unmemoized||a).apply(null,arguments)}},ensureAsync:function(a){return function(){var c=H(arguments),b=c.length-1,d=c[b],e=!0;c[b]=function(){var a=H(arguments);e?D(function(){d.apply(null,a)}):d.apply(null,a)};a.apply(this,c);e=!1}},constant:function(){var a=[null].concat(H(arguments));return function(c){c=arguments[arguments.length-1];c.apply(this,a)}},asyncify:Pa,wrapSync:Pa,log:wb,dir:xb,reflect:Ra,reflectAll:function(a){function c(a,
+c){b[c]=Ra(a)}var b,d;C(a)?(b=Array(a.length),Q(a,c)):a&&"object"===typeof a&&(d=F(a),b={},W(a,c,d));return b},timeout:function(a,c,b){function d(){var c=Error('Callback function "'+(a.name||"anonymous")+'" timed out.');c.code="ETIMEDOUT";b&&(c.info=b);l=null;g(c)}function e(){null!==l&&(f(g,H(arguments)),clearTimeout(l))}function f(a,b){switch(b.length){case 0:a();break;case 1:a(b[0]);break;case 2:a(b[0],b[1]);break;default:a.apply(null,b)}}var g,l;return function(){l=setTimeout(d,c);var b=H(arguments),
+s=b.length-1;g=b[s];b[s]=e;f(a,b)}},createLogger:pa,safe:function(){O();return N},fast:function(){O(!1);return N}};N["default"]=qa;W(qa,function(a,c){N[c]=a},F(qa));M.prototype._removeLink=function(a){var c=a.prev,b=a.next;c?c.next=b:this.head=b;b?b.prev=c:this.tail=c;a.prev=null;a.next=null;this.length--;return a};M.prototype.empty=M;M.prototype._setInitial=function(a){this.length=1;this.head=this.tail=a};M.prototype.insertBefore=function(a,c){c.prev=a.prev;c.next=a;a.prev?a.prev.next=c:this.head=
+c;a.prev=c;this.length++};M.prototype.unshift=function(a){this.head?this.insertBefore(this.head,a):this._setInitial(a)};M.prototype.push=function(a){var c=this.tail;c?(a.prev=c,a.next=c.next,this.tail=a,c.next=a,this.length++):this._setInitial(a)};M.prototype.shift=function(){return this.head&&this._removeLink(this.head)};M.prototype.splice=function(a){for(var c,b=[];a--&&(c=this.shift());)b.push(c);return b};M.prototype.remove=function(a){for(var c=this.head;c;)a(c)&&this._removeLink(c),c=c.next;
+return this};var cb=/^(function)?\s*[^\(]*\(\s*([^\)]*)\)/m,db=/,/,eb=/(=.+)?(\s*)$/,bb=/((\/\/.*$)|(\/\*[\s\S]*?\*\/))/gm});
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/asyncify.js b/node_modules/mathjs/examples/node_modules/neo-async/asyncify.js
new file mode 100644
index 0000000..7b649eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/asyncify.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').asyncify;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/auto.js b/node_modules/mathjs/examples/node_modules/neo-async/auto.js
new file mode 100644
index 0000000..7c6fade
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/auto.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').auto;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/autoInject.js b/node_modules/mathjs/examples/node_modules/neo-async/autoInject.js
new file mode 100644
index 0000000..4f14175
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/autoInject.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').autoInject;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/cargo.js b/node_modules/mathjs/examples/node_modules/neo-async/cargo.js
new file mode 100644
index 0000000..c33fb7d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/cargo.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').cargo;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/compose.js b/node_modules/mathjs/examples/node_modules/neo-async/compose.js
new file mode 100644
index 0000000..2ae833e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/compose.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').compose;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/concat.js b/node_modules/mathjs/examples/node_modules/neo-async/concat.js
new file mode 100644
index 0000000..7eac75e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/concat.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').concat;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/concatLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/concatLimit.js
new file mode 100644
index 0000000..f25643d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/concatLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').concatLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/concatSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/concatSeries.js
new file mode 100644
index 0000000..9726231
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/concatSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').concatSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/constant.js b/node_modules/mathjs/examples/node_modules/neo-async/constant.js
new file mode 100644
index 0000000..a04f6b2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/constant.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').constant;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/createLogger.js b/node_modules/mathjs/examples/node_modules/neo-async/createLogger.js
new file mode 100644
index 0000000..941147b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/createLogger.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').createLogger;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/detect.js b/node_modules/mathjs/examples/node_modules/neo-async/detect.js
new file mode 100644
index 0000000..5770dc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/detect.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').detect;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/detectLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/detectLimit.js
new file mode 100644
index 0000000..cd8ffbd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/detectLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').detectLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/detectSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/detectSeries.js
new file mode 100644
index 0000000..2a62e25
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/detectSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').detectSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/dir.js b/node_modules/mathjs/examples/node_modules/neo-async/dir.js
new file mode 100644
index 0000000..12072c6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/dir.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').dir;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/doDuring.js b/node_modules/mathjs/examples/node_modules/neo-async/doDuring.js
new file mode 100644
index 0000000..df21901
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/doDuring.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').doDuring;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/doUntil.js b/node_modules/mathjs/examples/node_modules/neo-async/doUntil.js
new file mode 100644
index 0000000..a00a889
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/doUntil.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').doUntil;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/doWhilst.js b/node_modules/mathjs/examples/node_modules/neo-async/doWhilst.js
new file mode 100644
index 0000000..c03dc16
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/doWhilst.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').doWhilst;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/during.js b/node_modules/mathjs/examples/node_modules/neo-async/during.js
new file mode 100644
index 0000000..3943393
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/during.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').during;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/each.js b/node_modules/mathjs/examples/node_modules/neo-async/each.js
new file mode 100644
index 0000000..88ff483
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/each.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').each;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/eachLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/eachLimit.js
new file mode 100644
index 0000000..fdbd1b8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/eachLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').eachLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/eachOf.js b/node_modules/mathjs/examples/node_modules/neo-async/eachOf.js
new file mode 100644
index 0000000..bc697a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/eachOf.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').eachOf;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/eachOfLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/eachOfLimit.js
new file mode 100644
index 0000000..f00ea95
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/eachOfLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').eachOfLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/eachOfSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/eachOfSeries.js
new file mode 100644
index 0000000..3d70173
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/eachOfSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').eachOfSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/eachSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/eachSeries.js
new file mode 100644
index 0000000..88bdf86
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/eachSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').eachSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/ensureAsync.js b/node_modules/mathjs/examples/node_modules/neo-async/ensureAsync.js
new file mode 100644
index 0000000..65f42e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/ensureAsync.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').ensureAsync;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/every.js b/node_modules/mathjs/examples/node_modules/neo-async/every.js
new file mode 100644
index 0000000..b3f817b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/every.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').every;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/everyLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/everyLimit.js
new file mode 100644
index 0000000..49fd9e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/everyLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').everyLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/everySeries.js b/node_modules/mathjs/examples/node_modules/neo-async/everySeries.js
new file mode 100644
index 0000000..5b36508
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/everySeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').everySeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/fast.js b/node_modules/mathjs/examples/node_modules/neo-async/fast.js
new file mode 100644
index 0000000..25c6be8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/fast.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').fast;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/filter.js b/node_modules/mathjs/examples/node_modules/neo-async/filter.js
new file mode 100644
index 0000000..59cc323
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/filter.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').filter;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/filterLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/filterLimit.js
new file mode 100644
index 0000000..9c058ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/filterLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').filterLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/filterSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/filterSeries.js
new file mode 100644
index 0000000..a73fa57
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/filterSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').filterSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/find.js b/node_modules/mathjs/examples/node_modules/neo-async/find.js
new file mode 100644
index 0000000..2693d25
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/find.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').find;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/findLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/findLimit.js
new file mode 100644
index 0000000..ba3567d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/findLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').findLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/findSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/findSeries.js
new file mode 100644
index 0000000..44dcca5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/findSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').findSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/foldl.js b/node_modules/mathjs/examples/node_modules/neo-async/foldl.js
new file mode 100644
index 0000000..f43b0ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/foldl.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').foldl;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/foldr.js b/node_modules/mathjs/examples/node_modules/neo-async/foldr.js
new file mode 100644
index 0000000..0c8bf31
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/foldr.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').foldr;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/forEach.js b/node_modules/mathjs/examples/node_modules/neo-async/forEach.js
new file mode 100644
index 0000000..0a363c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/forEach.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').forEach;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/forEachLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/forEachLimit.js
new file mode 100644
index 0000000..e382983
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/forEachLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').forEachLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/forEachOf.js b/node_modules/mathjs/examples/node_modules/neo-async/forEachOf.js
new file mode 100644
index 0000000..97de0eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/forEachOf.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').forEachOf;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/forEachOfLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/forEachOfLimit.js
new file mode 100644
index 0000000..0667645
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/forEachOfLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').forEachOfLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/forEachOfSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/forEachOfSeries.js
new file mode 100644
index 0000000..ef6a8a5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/forEachOfSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').forEachOfSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/forEachSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/forEachSeries.js
new file mode 100644
index 0000000..45b5e8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/forEachSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').forEachSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/forever.js b/node_modules/mathjs/examples/node_modules/neo-async/forever.js
new file mode 100644
index 0000000..37e8cae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/forever.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').forever;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/groupBy.js b/node_modules/mathjs/examples/node_modules/neo-async/groupBy.js
new file mode 100644
index 0000000..04d92c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/groupBy.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').groupBy;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/groupByLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/groupByLimit.js
new file mode 100644
index 0000000..eee7bc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/groupByLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').groupByLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/groupBySeries.js b/node_modules/mathjs/examples/node_modules/neo-async/groupBySeries.js
new file mode 100644
index 0000000..153e47c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/groupBySeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').groupBySeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/inject.js b/node_modules/mathjs/examples/node_modules/neo-async/inject.js
new file mode 100644
index 0000000..5a2c7b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/inject.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').inject;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/iterator.js b/node_modules/mathjs/examples/node_modules/neo-async/iterator.js
new file mode 100644
index 0000000..dffc612
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/iterator.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').iterator;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/log.js b/node_modules/mathjs/examples/node_modules/neo-async/log.js
new file mode 100644
index 0000000..044afbe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/log.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').log;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/map.js b/node_modules/mathjs/examples/node_modules/neo-async/map.js
new file mode 100644
index 0000000..726f81a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/map.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').map;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/mapLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/mapLimit.js
new file mode 100644
index 0000000..7567782
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/mapLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').mapLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/mapSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/mapSeries.js
new file mode 100644
index 0000000..ee0e989
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/mapSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').mapSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/mapValues.js b/node_modules/mathjs/examples/node_modules/neo-async/mapValues.js
new file mode 100644
index 0000000..31a68bc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/mapValues.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').mapValues;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/mapValuesLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/mapValuesLimit.js
new file mode 100644
index 0000000..768cf1b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/mapValuesLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').mapValuesLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/mapValuesSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/mapValuesSeries.js
new file mode 100644
index 0000000..172ea37
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/mapValuesSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').mapValuesSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/memoize.js b/node_modules/mathjs/examples/node_modules/neo-async/memoize.js
new file mode 100644
index 0000000..96086fe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/memoize.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').memoize;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/nextTick.js b/node_modules/mathjs/examples/node_modules/neo-async/nextTick.js
new file mode 100644
index 0000000..175f316
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/nextTick.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').nextTick;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/omit.js b/node_modules/mathjs/examples/node_modules/neo-async/omit.js
new file mode 100644
index 0000000..e2fd84f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/omit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').omit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/omitLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/omitLimit.js
new file mode 100644
index 0000000..2acf759
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/omitLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').omitLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/omitSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/omitSeries.js
new file mode 100644
index 0000000..83de625
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/omitSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').omitSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/package.json b/node_modules/mathjs/examples/node_modules/neo-async/package.json
new file mode 100644
index 0000000..d5702c4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/package.json
@@ -0,0 +1,57 @@
+{
+  "name": "neo-async",
+  "version": "2.6.2",
+  "description": "Neo-Async is a drop-in replacement for Async, it almost fully covers its functionality and runs faster ",
+  "main": "async.js",
+  "license": "MIT",
+  "keywords": [
+    "async",
+    "util"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git@github.com:suguru03/neo-async.git"
+  },
+  "homepage": "https://github.com/suguru03/neo-async",
+  "dependencies": {},
+  "devDependencies": {
+    "aigle": "^1.14.0",
+    "async": "^2.6.0",
+    "benchmark": "^2.1.1",
+    "bluebird": "^3.5.1",
+    "codecov.io": "^0.1.6",
+    "fs-extra": "^4.0.2",
+    "func-comparator": "^0.7.2",
+    "gulp": "^4.0.2",
+    "gulp-bump": "^2.8.0",
+    "gulp-exit": "0.0.2",
+    "gulp-git": "^2.4.2",
+    "gulp-jscs": "^4.0.0",
+    "gulp-mocha": "^4.2.0",
+    "gulp-tag-version": "^1.3.0",
+    "gulp-util": "^3.0.7",
+    "husky": "^1.2.0",
+    "istanbul": "^0.4.3",
+    "jsdoc": "^3.5.5",
+    "jshint": "^2.9.5",
+    "lint-staged": "^8.1.0",
+    "lodash": "^4.16.6",
+    "minimist": "^1.2.0",
+    "mocha": "^3.5.3",
+    "mocha-parallel-executor": "^0.3.0",
+    "mocha.parallel": "^0.15.3",
+    "prettier": "^1.15.2",
+    "require-dir": "^0.3.0"
+  },
+  "lint-staged": {
+    "*.{js,ts}": [
+      "prettier --write",
+      "git add"
+    ]
+  },
+  "prettier": {
+    "printWidth": 100,
+    "singleQuote": true
+  },
+  "browser": "async.min.js"
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/parallel.js b/node_modules/mathjs/examples/node_modules/neo-async/parallel.js
new file mode 100644
index 0000000..c09021f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/parallel.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').parallel;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/parallelLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/parallelLimit.js
new file mode 100644
index 0000000..29d0c9e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/parallelLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').parallelLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/pick.js b/node_modules/mathjs/examples/node_modules/neo-async/pick.js
new file mode 100644
index 0000000..a74789a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/pick.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').pick;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/pickLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/pickLimit.js
new file mode 100644
index 0000000..3de9261
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/pickLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').pickLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/pickSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/pickSeries.js
new file mode 100644
index 0000000..eef0ae4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/pickSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').pickSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/priorityQueue.js b/node_modules/mathjs/examples/node_modules/neo-async/priorityQueue.js
new file mode 100644
index 0000000..55f9737
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/priorityQueue.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').priorityQueue;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/queue.js b/node_modules/mathjs/examples/node_modules/neo-async/queue.js
new file mode 100644
index 0000000..eb9e37b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/queue.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').queue;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/race.js b/node_modules/mathjs/examples/node_modules/neo-async/race.js
new file mode 100644
index 0000000..cab40db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/race.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').race;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/reduce.js b/node_modules/mathjs/examples/node_modules/neo-async/reduce.js
new file mode 100644
index 0000000..6f0c5c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/reduce.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').reduce;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/reduceRight.js b/node_modules/mathjs/examples/node_modules/neo-async/reduceRight.js
new file mode 100644
index 0000000..3f14a47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/reduceRight.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').reduceRight;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/reflect.js b/node_modules/mathjs/examples/node_modules/neo-async/reflect.js
new file mode 100644
index 0000000..233cae7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/reflect.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').reflect;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/reflectAll.js b/node_modules/mathjs/examples/node_modules/neo-async/reflectAll.js
new file mode 100644
index 0000000..901e28c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/reflectAll.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').reflectAll;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/reject.js b/node_modules/mathjs/examples/node_modules/neo-async/reject.js
new file mode 100644
index 0000000..a62c541
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/reject.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').reject;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/rejectLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/rejectLimit.js
new file mode 100644
index 0000000..f7b0efd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/rejectLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').rejectLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/rejectSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/rejectSeries.js
new file mode 100644
index 0000000..da4adc1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/rejectSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').rejectSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/retry.js b/node_modules/mathjs/examples/node_modules/neo-async/retry.js
new file mode 100644
index 0000000..07ada27
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/retry.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').retry;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/retryable.js b/node_modules/mathjs/examples/node_modules/neo-async/retryable.js
new file mode 100644
index 0000000..cd89807
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/retryable.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').retryable;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/safe.js b/node_modules/mathjs/examples/node_modules/neo-async/safe.js
new file mode 100644
index 0000000..6e4c698
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/safe.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').safe;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/select.js b/node_modules/mathjs/examples/node_modules/neo-async/select.js
new file mode 100644
index 0000000..e4fd51c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/select.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').select;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/selectLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/selectLimit.js
new file mode 100644
index 0000000..2f37e66
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/selectLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').selectLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/selectSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/selectSeries.js
new file mode 100644
index 0000000..a4de29d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/selectSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').selectSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/seq.js b/node_modules/mathjs/examples/node_modules/neo-async/seq.js
new file mode 100644
index 0000000..7eacd7e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/seq.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').seq;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/series.js b/node_modules/mathjs/examples/node_modules/neo-async/series.js
new file mode 100644
index 0000000..096d2d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/series.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').series;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/setImmediate.js b/node_modules/mathjs/examples/node_modules/neo-async/setImmediate.js
new file mode 100644
index 0000000..9b93ca7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/setImmediate.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').setImmediate;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/some.js b/node_modules/mathjs/examples/node_modules/neo-async/some.js
new file mode 100644
index 0000000..bcf6e9c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/some.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').some;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/someLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/someLimit.js
new file mode 100644
index 0000000..a970b2a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/someLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').someLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/someSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/someSeries.js
new file mode 100644
index 0000000..4965c52
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/someSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').someSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/sortBy.js b/node_modules/mathjs/examples/node_modules/neo-async/sortBy.js
new file mode 100644
index 0000000..7456216
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/sortBy.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').sortBy;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/sortByLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/sortByLimit.js
new file mode 100644
index 0000000..9601686
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/sortByLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').sortByLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/sortBySeries.js b/node_modules/mathjs/examples/node_modules/neo-async/sortBySeries.js
new file mode 100644
index 0000000..7d7e069
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/sortBySeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').sortBySeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/timeout.js b/node_modules/mathjs/examples/node_modules/neo-async/timeout.js
new file mode 100644
index 0000000..8fe4ad4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/timeout.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').timeout;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/times.js b/node_modules/mathjs/examples/node_modules/neo-async/times.js
new file mode 100644
index 0000000..c9d3744
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/times.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').times;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/timesLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/timesLimit.js
new file mode 100644
index 0000000..f22718a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/timesLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').timesLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/timesSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/timesSeries.js
new file mode 100644
index 0000000..63c055d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/timesSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').timesSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/transform.js b/node_modules/mathjs/examples/node_modules/neo-async/transform.js
new file mode 100644
index 0000000..83787e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/transform.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').transform;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/transformLimit.js b/node_modules/mathjs/examples/node_modules/neo-async/transformLimit.js
new file mode 100644
index 0000000..79eac86
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/transformLimit.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').transformLimit;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/transformSeries.js b/node_modules/mathjs/examples/node_modules/neo-async/transformSeries.js
new file mode 100644
index 0000000..5979c8f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/transformSeries.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').transformSeries;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/tryEach.js b/node_modules/mathjs/examples/node_modules/neo-async/tryEach.js
new file mode 100644
index 0000000..138a84a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/tryEach.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').tryEach;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/unmemoize.js b/node_modules/mathjs/examples/node_modules/neo-async/unmemoize.js
new file mode 100644
index 0000000..18830f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/unmemoize.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').unmemoize;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/until.js b/node_modules/mathjs/examples/node_modules/neo-async/until.js
new file mode 100644
index 0000000..826b48a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/until.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').until;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/waterfall.js b/node_modules/mathjs/examples/node_modules/neo-async/waterfall.js
new file mode 100644
index 0000000..e3fa20a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/waterfall.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').waterfall;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/whilst.js b/node_modules/mathjs/examples/node_modules/neo-async/whilst.js
new file mode 100644
index 0000000..0d72ea6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/whilst.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').whilst;
diff --git a/node_modules/mathjs/examples/node_modules/neo-async/wrapSync.js b/node_modules/mathjs/examples/node_modules/neo-async/wrapSync.js
new file mode 100644
index 0000000..965037b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/neo-async/wrapSync.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./async').wrapSync;
diff --git a/node_modules/mathjs/examples/node_modules/node-releases/LICENSE b/node_modules/mathjs/examples/node_modules/node-releases/LICENSE
new file mode 100644
index 0000000..ea39e4f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/node-releases/LICENSE
@@ -0,0 +1,21 @@
+The MIT License
+
+Copyright (c) 2017 Sergey Rubanov (https://github.com/chicoxyzzy)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/node-releases/README.md b/node_modules/mathjs/examples/node_modules/node-releases/README.md
new file mode 100644
index 0000000..114fb4a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/node-releases/README.md
@@ -0,0 +1,31 @@
+# Node.js releases data
+
+All data is located in `data` directory.
+
+`data/raw` contains raw data `nodejs.json` and `iojs.json`.
+
+`data/processed` contains `envs.js` with both node.js and io.js data preprocessed to be used by [Browserslist](https://github.com/ai/browserslist) and other projects. Each version in this file contains only necessary info: version, release date and optionally LTS flag.
+
+## Installation
+```bash
+npm install --save node-releases
+```
+
+## Updating data
+```bash
+npm run build
+```
+This is a build script which fetches data from web, processes it and saves processed data to `data/processed/envs.json`. If you want to run this steps separately you can use commands described below.
+
+
+### Fetching data
+```bash
+npm run fetch
+```
+This npm script will download new data to `data/raw` directory. Also it'll download Node.js release schedule into `release-schedule` folder.
+
+### Processing data
+```bash
+npm run process
+```
+This script generates `envs.json` file from raw data files and saves it to `data/processed` directory.
diff --git a/node_modules/mathjs/examples/node_modules/node-releases/data/processed/envs.json b/node_modules/mathjs/examples/node_modules/node-releases/data/processed/envs.json
new file mode 100644
index 0000000..812935d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/node-releases/data/processed/envs.json
@@ -0,0 +1 @@
+[{"name":"nodejs","version":"0.2.0","date":"2011-08-26","lts":false,"security":false},{"name":"nodejs","version":"0.3.0","date":"2011-08-26","lts":false,"security":false},{"name":"nodejs","version":"0.4.0","date":"2011-08-26","lts":false,"security":false},{"name":"nodejs","version":"0.5.0","date":"2011-08-26","lts":false,"security":false},{"name":"nodejs","version":"0.6.0","date":"2011-11-04","lts":false,"security":false},{"name":"nodejs","version":"0.7.0","date":"2012-01-17","lts":false,"security":false},{"name":"nodejs","version":"0.8.0","date":"2012-06-22","lts":false,"security":false},{"name":"nodejs","version":"0.9.0","date":"2012-07-20","lts":false,"security":false},{"name":"nodejs","version":"0.10.0","date":"2013-03-11","lts":false,"security":false},{"name":"nodejs","version":"0.11.0","date":"2013-03-28","lts":false,"security":false},{"name":"nodejs","version":"0.12.0","date":"2015-02-06","lts":false,"security":false},{"name":"nodejs","version":"4.0.0","date":"2015-09-08","lts":false,"security":false},{"name":"nodejs","version":"4.1.0","date":"2015-09-17","lts":false,"security":false},{"name":"nodejs","version":"4.2.0","date":"2015-10-12","lts":"Argon","security":false},{"name":"nodejs","version":"4.3.0","date":"2016-02-09","lts":"Argon","security":false},{"name":"nodejs","version":"4.4.0","date":"2016-03-08","lts":"Argon","security":false},{"name":"nodejs","version":"4.5.0","date":"2016-08-16","lts":"Argon","security":false},{"name":"nodejs","version":"4.6.0","date":"2016-09-27","lts":"Argon","security":true},{"name":"nodejs","version":"4.7.0","date":"2016-12-06","lts":"Argon","security":false},{"name":"nodejs","version":"4.8.0","date":"2017-02-21","lts":"Argon","security":false},{"name":"nodejs","version":"4.9.0","date":"2018-03-28","lts":"Argon","security":true},{"name":"nodejs","version":"5.0.0","date":"2015-10-29","lts":false,"security":false},{"name":"nodejs","version":"5.1.0","date":"2015-11-17","lts":false,"security":false},{"name":"nodejs","version":"5.2.0","date":"2015-12-09","lts":false,"security":false},{"name":"nodejs","version":"5.3.0","date":"2015-12-15","lts":false,"security":false},{"name":"nodejs","version":"5.4.0","date":"2016-01-06","lts":false,"security":false},{"name":"nodejs","version":"5.5.0","date":"2016-01-21","lts":false,"security":false},{"name":"nodejs","version":"5.6.0","date":"2016-02-09","lts":false,"security":false},{"name":"nodejs","version":"5.7.0","date":"2016-02-23","lts":false,"security":false},{"name":"nodejs","version":"5.8.0","date":"2016-03-09","lts":false,"security":false},{"name":"nodejs","version":"5.9.0","date":"2016-03-16","lts":false,"security":false},{"name":"nodejs","version":"5.10.0","date":"2016-04-01","lts":false,"security":false},{"name":"nodejs","version":"5.11.0","date":"2016-04-21","lts":false,"security":false},{"name":"nodejs","version":"5.12.0","date":"2016-06-23","lts":false,"security":false},{"name":"nodejs","version":"6.0.0","date":"2016-04-26","lts":false,"security":false},{"name":"nodejs","version":"6.1.0","date":"2016-05-05","lts":false,"security":false},{"name":"nodejs","version":"6.2.0","date":"2016-05-17","lts":false,"security":false},{"name":"nodejs","version":"6.3.0","date":"2016-07-06","lts":false,"security":false},{"name":"nodejs","version":"6.4.0","date":"2016-08-12","lts":false,"security":false},{"name":"nodejs","version":"6.5.0","date":"2016-08-26","lts":false,"security":false},{"name":"nodejs","version":"6.6.0","date":"2016-09-14","lts":false,"security":false},{"name":"nodejs","version":"6.7.0","date":"2016-09-27","lts":false,"security":true},{"name":"nodejs","version":"6.8.0","date":"2016-10-12","lts":false,"security":false},{"name":"nodejs","version":"6.9.0","date":"2016-10-18","lts":"Boron","security":false},{"name":"nodejs","version":"6.10.0","date":"2017-02-21","lts":"Boron","security":false},{"name":"nodejs","version":"6.11.0","date":"2017-06-06","lts":"Boron","security":false},{"name":"nodejs","version":"6.12.0","date":"2017-11-06","lts":"Boron","security":false},{"name":"nodejs","version":"6.13.0","date":"2018-02-10","lts":"Boron","security":false},{"name":"nodejs","version":"6.14.0","date":"2018-03-28","lts":"Boron","security":true},{"name":"nodejs","version":"6.15.0","date":"2018-11-27","lts":"Boron","security":true},{"name":"nodejs","version":"6.16.0","date":"2018-12-26","lts":"Boron","security":false},{"name":"nodejs","version":"6.17.0","date":"2019-02-28","lts":"Boron","security":true},{"name":"nodejs","version":"7.0.0","date":"2016-10-25","lts":false,"security":false},{"name":"nodejs","version":"7.1.0","date":"2016-11-08","lts":false,"security":false},{"name":"nodejs","version":"7.2.0","date":"2016-11-22","lts":false,"security":false},{"name":"nodejs","version":"7.3.0","date":"2016-12-20","lts":false,"security":false},{"name":"nodejs","version":"7.4.0","date":"2017-01-04","lts":false,"security":false},{"name":"nodejs","version":"7.5.0","date":"2017-01-31","lts":false,"security":false},{"name":"nodejs","version":"7.6.0","date":"2017-02-21","lts":false,"security":false},{"name":"nodejs","version":"7.7.0","date":"2017-02-28","lts":false,"security":false},{"name":"nodejs","version":"7.8.0","date":"2017-03-29","lts":false,"security":false},{"name":"nodejs","version":"7.9.0","date":"2017-04-11","lts":false,"security":false},{"name":"nodejs","version":"7.10.0","date":"2017-05-02","lts":false,"security":false},{"name":"nodejs","version":"8.0.0","date":"2017-05-30","lts":false,"security":false},{"name":"nodejs","version":"8.1.0","date":"2017-06-08","lts":false,"security":false},{"name":"nodejs","version":"8.2.0","date":"2017-07-19","lts":false,"security":false},{"name":"nodejs","version":"8.3.0","date":"2017-08-08","lts":false,"security":false},{"name":"nodejs","version":"8.4.0","date":"2017-08-15","lts":false,"security":false},{"name":"nodejs","version":"8.5.0","date":"2017-09-12","lts":false,"security":false},{"name":"nodejs","version":"8.6.0","date":"2017-09-26","lts":false,"security":false},{"name":"nodejs","version":"8.7.0","date":"2017-10-11","lts":false,"security":false},{"name":"nodejs","version":"8.8.0","date":"2017-10-24","lts":false,"security":false},{"name":"nodejs","version":"8.9.0","date":"2017-10-31","lts":"Carbon","security":false},{"name":"nodejs","version":"8.10.0","date":"2018-03-06","lts":"Carbon","security":false},{"name":"nodejs","version":"8.11.0","date":"2018-03-28","lts":"Carbon","security":true},{"name":"nodejs","version":"8.12.0","date":"2018-09-10","lts":"Carbon","security":false},{"name":"nodejs","version":"8.13.0","date":"2018-11-20","lts":"Carbon","security":false},{"name":"nodejs","version":"8.14.0","date":"2018-11-27","lts":"Carbon","security":true},{"name":"nodejs","version":"8.15.0","date":"2018-12-26","lts":"Carbon","security":false},{"name":"nodejs","version":"8.16.0","date":"2019-04-16","lts":"Carbon","security":false},{"name":"nodejs","version":"8.17.0","date":"2019-12-17","lts":"Carbon","security":true},{"name":"nodejs","version":"9.0.0","date":"2017-10-31","lts":false,"security":false},{"name":"nodejs","version":"9.1.0","date":"2017-11-07","lts":false,"security":false},{"name":"nodejs","version":"9.2.0","date":"2017-11-14","lts":false,"security":false},{"name":"nodejs","version":"9.3.0","date":"2017-12-12","lts":false,"security":false},{"name":"nodejs","version":"9.4.0","date":"2018-01-10","lts":false,"security":false},{"name":"nodejs","version":"9.5.0","date":"2018-01-31","lts":false,"security":false},{"name":"nodejs","version":"9.6.0","date":"2018-02-21","lts":false,"security":false},{"name":"nodejs","version":"9.7.0","date":"2018-03-01","lts":false,"security":false},{"name":"nodejs","version":"9.8.0","date":"2018-03-07","lts":false,"security":false},{"name":"nodejs","version":"9.9.0","date":"2018-03-21","lts":false,"security":false},{"name":"nodejs","version":"9.10.0","date":"2018-03-28","lts":false,"security":true},{"name":"nodejs","version":"9.11.0","date":"2018-04-04","lts":false,"security":false},{"name":"nodejs","version":"10.0.0","date":"2018-04-24","lts":false,"security":false},{"name":"nodejs","version":"10.1.0","date":"2018-05-08","lts":false,"security":false},{"name":"nodejs","version":"10.2.0","date":"2018-05-23","lts":false,"security":false},{"name":"nodejs","version":"10.3.0","date":"2018-05-29","lts":false,"security":false},{"name":"nodejs","version":"10.4.0","date":"2018-06-06","lts":false,"security":false},{"name":"nodejs","version":"10.5.0","date":"2018-06-20","lts":false,"security":false},{"name":"nodejs","version":"10.6.0","date":"2018-07-04","lts":false,"security":false},{"name":"nodejs","version":"10.7.0","date":"2018-07-18","lts":false,"security":false},{"name":"nodejs","version":"10.8.0","date":"2018-08-01","lts":false,"security":false},{"name":"nodejs","version":"10.9.0","date":"2018-08-15","lts":false,"security":false},{"name":"nodejs","version":"10.10.0","date":"2018-09-06","lts":false,"security":false},{"name":"nodejs","version":"10.11.0","date":"2018-09-19","lts":false,"security":false},{"name":"nodejs","version":"10.12.0","date":"2018-10-10","lts":false,"security":false},{"name":"nodejs","version":"10.13.0","date":"2018-10-30","lts":"Dubnium","security":false},{"name":"nodejs","version":"10.14.0","date":"2018-11-27","lts":"Dubnium","security":true},{"name":"nodejs","version":"10.15.0","date":"2018-12-26","lts":"Dubnium","security":false},{"name":"nodejs","version":"10.16.0","date":"2019-05-28","lts":"Dubnium","security":false},{"name":"nodejs","version":"10.17.0","date":"2019-10-22","lts":"Dubnium","security":false},{"name":"nodejs","version":"10.18.0","date":"2019-12-17","lts":"Dubnium","security":true},{"name":"nodejs","version":"10.19.0","date":"2020-02-05","lts":"Dubnium","security":true},{"name":"nodejs","version":"10.20.0","date":"2020-03-26","lts":"Dubnium","security":false},{"name":"nodejs","version":"10.21.0","date":"2020-06-02","lts":"Dubnium","security":true},{"name":"nodejs","version":"10.22.0","date":"2020-07-21","lts":"Dubnium","security":false},{"name":"nodejs","version":"10.23.0","date":"2020-10-27","lts":"Dubnium","security":false},{"name":"nodejs","version":"10.24.0","date":"2021-02-23","lts":"Dubnium","security":true},{"name":"nodejs","version":"11.0.0","date":"2018-10-23","lts":false,"security":false},{"name":"nodejs","version":"11.1.0","date":"2018-10-30","lts":false,"security":false},{"name":"nodejs","version":"11.2.0","date":"2018-11-15","lts":false,"security":false},{"name":"nodejs","version":"11.3.0","date":"2018-11-27","lts":false,"security":true},{"name":"nodejs","version":"11.4.0","date":"2018-12-07","lts":false,"security":false},{"name":"nodejs","version":"11.5.0","date":"2018-12-18","lts":false,"security":false},{"name":"nodejs","version":"11.6.0","date":"2018-12-26","lts":false,"security":false},{"name":"nodejs","version":"11.7.0","date":"2019-01-17","lts":false,"security":false},{"name":"nodejs","version":"11.8.0","date":"2019-01-24","lts":false,"security":false},{"name":"nodejs","version":"11.9.0","date":"2019-01-30","lts":false,"security":false},{"name":"nodejs","version":"11.10.0","date":"2019-02-14","lts":false,"security":false},{"name":"nodejs","version":"11.11.0","date":"2019-03-05","lts":false,"security":false},{"name":"nodejs","version":"11.12.0","date":"2019-03-14","lts":false,"security":false},{"name":"nodejs","version":"11.13.0","date":"2019-03-28","lts":false,"security":false},{"name":"nodejs","version":"11.14.0","date":"2019-04-10","lts":false,"security":false},{"name":"nodejs","version":"11.15.0","date":"2019-04-30","lts":false,"security":false},{"name":"nodejs","version":"12.0.0","date":"2019-04-23","lts":false,"security":false},{"name":"nodejs","version":"12.1.0","date":"2019-04-29","lts":false,"security":false},{"name":"nodejs","version":"12.2.0","date":"2019-05-07","lts":false,"security":false},{"name":"nodejs","version":"12.3.0","date":"2019-05-21","lts":false,"security":false},{"name":"nodejs","version":"12.4.0","date":"2019-06-04","lts":false,"security":false},{"name":"nodejs","version":"12.5.0","date":"2019-06-26","lts":false,"security":false},{"name":"nodejs","version":"12.6.0","date":"2019-07-03","lts":false,"security":false},{"name":"nodejs","version":"12.7.0","date":"2019-07-23","lts":false,"security":false},{"name":"nodejs","version":"12.8.0","date":"2019-08-06","lts":false,"security":false},{"name":"nodejs","version":"12.9.0","date":"2019-08-20","lts":false,"security":false},{"name":"nodejs","version":"12.10.0","date":"2019-09-04","lts":false,"security":false},{"name":"nodejs","version":"12.11.0","date":"2019-09-25","lts":false,"security":false},{"name":"nodejs","version":"12.12.0","date":"2019-10-11","lts":false,"security":false},{"name":"nodejs","version":"12.13.0","date":"2019-10-21","lts":"Erbium","security":false},{"name":"nodejs","version":"12.14.0","date":"2019-12-17","lts":"Erbium","security":true},{"name":"nodejs","version":"12.15.0","date":"2020-02-05","lts":"Erbium","security":true},{"name":"nodejs","version":"12.16.0","date":"2020-02-11","lts":"Erbium","security":false},{"name":"nodejs","version":"12.17.0","date":"2020-05-26","lts":"Erbium","security":false},{"name":"nodejs","version":"12.18.0","date":"2020-06-02","lts":"Erbium","security":true},{"name":"nodejs","version":"12.19.0","date":"2020-10-06","lts":"Erbium","security":false},{"name":"nodejs","version":"12.20.0","date":"2020-11-24","lts":"Erbium","security":false},{"name":"nodejs","version":"12.21.0","date":"2021-02-23","lts":"Erbium","security":true},{"name":"nodejs","version":"12.22.0","date":"2021-03-30","lts":"Erbium","security":false},{"name":"nodejs","version":"13.0.0","date":"2019-10-22","lts":false,"security":false},{"name":"nodejs","version":"13.1.0","date":"2019-11-05","lts":false,"security":false},{"name":"nodejs","version":"13.2.0","date":"2019-11-21","lts":false,"security":false},{"name":"nodejs","version":"13.3.0","date":"2019-12-03","lts":false,"security":false},{"name":"nodejs","version":"13.4.0","date":"2019-12-17","lts":false,"security":true},{"name":"nodejs","version":"13.5.0","date":"2019-12-18","lts":false,"security":false},{"name":"nodejs","version":"13.6.0","date":"2020-01-07","lts":false,"security":false},{"name":"nodejs","version":"13.7.0","date":"2020-01-21","lts":false,"security":false},{"name":"nodejs","version":"13.8.0","date":"2020-02-05","lts":false,"security":true},{"name":"nodejs","version":"13.9.0","date":"2020-02-18","lts":false,"security":false},{"name":"nodejs","version":"13.10.0","date":"2020-03-04","lts":false,"security":false},{"name":"nodejs","version":"13.11.0","date":"2020-03-12","lts":false,"security":false},{"name":"nodejs","version":"13.12.0","date":"2020-03-26","lts":false,"security":false},{"name":"nodejs","version":"13.13.0","date":"2020-04-14","lts":false,"security":false},{"name":"nodejs","version":"13.14.0","date":"2020-04-29","lts":false,"security":false},{"name":"nodejs","version":"14.0.0","date":"2020-04-21","lts":false,"security":false},{"name":"nodejs","version":"14.1.0","date":"2020-04-29","lts":false,"security":false},{"name":"nodejs","version":"14.2.0","date":"2020-05-05","lts":false,"security":false},{"name":"nodejs","version":"14.3.0","date":"2020-05-19","lts":false,"security":false},{"name":"nodejs","version":"14.4.0","date":"2020-06-02","lts":false,"security":true},{"name":"nodejs","version":"14.5.0","date":"2020-06-30","lts":false,"security":false},{"name":"nodejs","version":"14.6.0","date":"2020-07-20","lts":false,"security":false},{"name":"nodejs","version":"14.7.0","date":"2020-07-29","lts":false,"security":false},{"name":"nodejs","version":"14.8.0","date":"2020-08-11","lts":false,"security":false},{"name":"nodejs","version":"14.9.0","date":"2020-08-27","lts":false,"security":false},{"name":"nodejs","version":"14.10.0","date":"2020-09-08","lts":false,"security":false},{"name":"nodejs","version":"14.11.0","date":"2020-09-15","lts":false,"security":true},{"name":"nodejs","version":"14.12.0","date":"2020-09-22","lts":false,"security":false},{"name":"nodejs","version":"14.13.0","date":"2020-09-29","lts":false,"security":false},{"name":"nodejs","version":"14.14.0","date":"2020-10-15","lts":false,"security":false},{"name":"nodejs","version":"14.15.0","date":"2020-10-27","lts":"Fermium","security":false},{"name":"nodejs","version":"14.16.0","date":"2021-02-23","lts":"Fermium","security":true},{"name":"nodejs","version":"14.17.0","date":"2021-05-11","lts":"Fermium","security":false},{"name":"nodejs","version":"14.18.0","date":"2021-09-28","lts":"Fermium","security":false},{"name":"nodejs","version":"14.19.0","date":"2022-02-01","lts":"Fermium","security":false},{"name":"nodejs","version":"15.0.0","date":"2020-10-20","lts":false,"security":false},{"name":"nodejs","version":"15.1.0","date":"2020-11-04","lts":false,"security":false},{"name":"nodejs","version":"15.2.0","date":"2020-11-10","lts":false,"security":false},{"name":"nodejs","version":"15.3.0","date":"2020-11-24","lts":false,"security":false},{"name":"nodejs","version":"15.4.0","date":"2020-12-09","lts":false,"security":false},{"name":"nodejs","version":"15.5.0","date":"2020-12-22","lts":false,"security":false},{"name":"nodejs","version":"15.6.0","date":"2021-01-14","lts":false,"security":false},{"name":"nodejs","version":"15.7.0","date":"2021-01-25","lts":false,"security":false},{"name":"nodejs","version":"15.8.0","date":"2021-02-02","lts":false,"security":false},{"name":"nodejs","version":"15.9.0","date":"2021-02-18","lts":false,"security":false},{"name":"nodejs","version":"15.10.0","date":"2021-02-23","lts":false,"security":true},{"name":"nodejs","version":"15.11.0","date":"2021-03-03","lts":false,"security":false},{"name":"nodejs","version":"15.12.0","date":"2021-03-17","lts":false,"security":false},{"name":"nodejs","version":"15.13.0","date":"2021-03-31","lts":false,"security":false},{"name":"nodejs","version":"15.14.0","date":"2021-04-06","lts":false,"security":false},{"name":"nodejs","version":"16.0.0","date":"2021-04-20","lts":false,"security":false},{"name":"nodejs","version":"16.1.0","date":"2021-05-04","lts":false,"security":false},{"name":"nodejs","version":"16.2.0","date":"2021-05-19","lts":false,"security":false},{"name":"nodejs","version":"16.3.0","date":"2021-06-03","lts":false,"security":false},{"name":"nodejs","version":"16.4.0","date":"2021-06-23","lts":false,"security":false},{"name":"nodejs","version":"16.5.0","date":"2021-07-14","lts":false,"security":false},{"name":"nodejs","version":"16.6.0","date":"2021-07-29","lts":false,"security":true},{"name":"nodejs","version":"16.7.0","date":"2021-08-18","lts":false,"security":false},{"name":"nodejs","version":"16.8.0","date":"2021-08-25","lts":false,"security":false},{"name":"nodejs","version":"16.9.0","date":"2021-09-07","lts":false,"security":false},{"name":"nodejs","version":"16.10.0","date":"2021-09-22","lts":false,"security":false},{"name":"nodejs","version":"16.11.0","date":"2021-10-08","lts":false,"security":false},{"name":"nodejs","version":"16.12.0","date":"2021-10-20","lts":false,"security":false},{"name":"nodejs","version":"16.13.0","date":"2021-10-26","lts":"Gallium","security":false},{"name":"nodejs","version":"17.0.0","date":"2021-10-19","lts":false,"security":false},{"name":"nodejs","version":"17.1.0","date":"2021-11-09","lts":false,"security":false},{"name":"nodejs","version":"17.2.0","date":"2021-11-30","lts":false,"security":false},{"name":"nodejs","version":"17.3.0","date":"2021-12-17","lts":false,"security":false},{"name":"nodejs","version":"17.4.0","date":"2022-01-18","lts":false,"security":false}]
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/node-releases/data/release-schedule/release-schedule.json b/node_modules/mathjs/examples/node_modules/node-releases/data/release-schedule/release-schedule.json
new file mode 100644
index 0000000..8db6436
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/node-releases/data/release-schedule/release-schedule.json
@@ -0,0 +1 @@
+{"v0.8":{"start":"2012-06-25","end":"2014-07-31"},"v0.10":{"start":"2013-03-11","end":"2016-10-31"},"v0.12":{"start":"2015-02-06","end":"2016-12-31"},"v4":{"start":"2015-09-08","lts":"2015-10-12","maintenance":"2017-04-01","end":"2018-04-30","codename":"Argon"},"v5":{"start":"2015-10-29","maintenance":"2016-04-30","end":"2016-06-30"},"v6":{"start":"2016-04-26","lts":"2016-10-18","maintenance":"2018-04-30","end":"2019-04-30","codename":"Boron"},"v7":{"start":"2016-10-25","maintenance":"2017-04-30","end":"2017-06-30"},"v8":{"start":"2017-05-30","lts":"2017-10-31","maintenance":"2019-01-01","end":"2019-12-31","codename":"Carbon"},"v9":{"start":"2017-10-01","maintenance":"2018-04-01","end":"2018-06-30"},"v10":{"start":"2018-04-24","lts":"2018-10-30","maintenance":"2020-05-19","end":"2021-04-30","codename":"Dubnium"},"v11":{"start":"2018-10-23","maintenance":"2019-04-22","end":"2019-06-01"},"v12":{"start":"2019-04-23","lts":"2019-10-21","maintenance":"2020-11-30","end":"2022-04-30","codename":"Erbium"},"v13":{"start":"2019-10-22","maintenance":"2020-04-01","end":"2020-06-01"},"v14":{"start":"2020-04-21","lts":"2020-10-27","maintenance":"2021-10-19","end":"2023-04-30","codename":"Fermium"},"v15":{"start":"2020-10-20","maintenance":"2021-04-01","end":"2021-06-01"},"v16":{"start":"2021-04-20","lts":"2021-10-26","maintenance":"2022-10-18","end":"2024-04-30","codename":"Gallium"},"v17":{"start":"2021-10-19","maintenance":"2022-04-01","end":"2022-06-01"},"v18":{"start":"2022-04-19","lts":"2022-10-25","maintenance":"2023-10-18","end":"2025-04-30","codename":""}}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/node-releases/package.json b/node_modules/mathjs/examples/node_modules/node-releases/package.json
new file mode 100644
index 0000000..6eeea56
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/node-releases/package.json
@@ -0,0 +1,18 @@
+{
+  "name": "node-releases",
+  "version": "2.0.2",
+  "description": "Node.js releases data",
+  "scripts": {
+    "build": "node scripts/build.js"
+  },
+  "repository": "chicoxyzzy/node-releases",
+  "keywords": [
+    "nodejs",
+    "releases"
+  ],
+  "author": "Sergey Rubanov <chi187@gmail.com>",
+  "license": "MIT",
+  "devDependencies": {
+    "semver": "^7.3.5"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/npm-run-path/index.d.ts b/node_modules/mathjs/examples/node_modules/npm-run-path/index.d.ts
new file mode 100644
index 0000000..af10d41
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/npm-run-path/index.d.ts
@@ -0,0 +1,89 @@
+declare namespace npmRunPath {
+	interface RunPathOptions {
+		/**
+		Working directory.
+
+		@default process.cwd()
+		*/
+		readonly cwd?: string;
+
+		/**
+		PATH to be appended. Default: [`PATH`](https://github.com/sindresorhus/path-key).
+
+		Set it to an empty string to exclude the default PATH.
+		*/
+		readonly path?: string;
+
+		/**
+		Path to the Node.js executable to use in child processes if that is different from the current one. Its directory is pushed to the front of PATH.
+
+		This can be either an absolute path or a path relative to the `cwd` option.
+
+		@default process.execPath
+		*/
+		readonly execPath?: string;
+	}
+
+	interface ProcessEnv {
+		[key: string]: string | undefined;
+	}
+
+	interface EnvOptions {
+		/**
+		Working directory.
+
+		@default process.cwd()
+		*/
+		readonly cwd?: string;
+
+		/**
+		Accepts an object of environment variables, like `process.env`, and modifies the PATH using the correct [PATH key](https://github.com/sindresorhus/path-key). Use this if you're modifying the PATH for use in the `child_process` options.
+		*/
+		readonly env?: ProcessEnv;
+
+		/**
+		Path to the current Node.js executable. Its directory is pushed to the front of PATH.
+
+		This can be either an absolute path or a path relative to the `cwd` option.
+
+		@default process.execPath
+		*/
+		readonly execPath?: string;
+	}
+}
+
+declare const npmRunPath: {
+	/**
+	Get your [PATH](https://en.wikipedia.org/wiki/PATH_(variable)) prepended with locally installed binaries.
+
+	@returns The augmented path string.
+
+	@example
+	```
+	import * as childProcess from 'child_process';
+	import npmRunPath = require('npm-run-path');
+
+	console.log(process.env.PATH);
+	//=> '/usr/local/bin'
+
+	console.log(npmRunPath());
+	//=> '/Users/sindresorhus/dev/foo/node_modules/.bin:/Users/sindresorhus/dev/node_modules/.bin:/Users/sindresorhus/node_modules/.bin:/Users/node_modules/.bin:/node_modules/.bin:/usr/local/bin'
+
+	// `foo` is a locally installed binary
+	childProcess.execFileSync('foo', {
+		env: npmRunPath.env()
+	});
+	```
+	*/
+	(options?: npmRunPath.RunPathOptions): string;
+
+	/**
+	@returns The augmented [`process.env`](https://nodejs.org/api/process.html#process_process_env) object.
+	*/
+	env(options?: npmRunPath.EnvOptions): npmRunPath.ProcessEnv;
+
+	// TODO: Remove this for the next major release
+	default: typeof npmRunPath;
+};
+
+export = npmRunPath;
diff --git a/node_modules/mathjs/examples/node_modules/npm-run-path/index.js b/node_modules/mathjs/examples/node_modules/npm-run-path/index.js
new file mode 100644
index 0000000..8c94abc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/npm-run-path/index.js
@@ -0,0 +1,47 @@
+'use strict';
+const path = require('path');
+const pathKey = require('path-key');
+
+const npmRunPath = options => {
+	options = {
+		cwd: process.cwd(),
+		path: process.env[pathKey()],
+		execPath: process.execPath,
+		...options
+	};
+
+	let previous;
+	let cwdPath = path.resolve(options.cwd);
+	const result = [];
+
+	while (previous !== cwdPath) {
+		result.push(path.join(cwdPath, 'node_modules/.bin'));
+		previous = cwdPath;
+		cwdPath = path.resolve(cwdPath, '..');
+	}
+
+	// Ensure the running `node` binary is used
+	const execPathDir = path.resolve(options.cwd, options.execPath, '..');
+	result.push(execPathDir);
+
+	return result.concat(options.path).join(path.delimiter);
+};
+
+module.exports = npmRunPath;
+// TODO: Remove this for the next major release
+module.exports.default = npmRunPath;
+
+module.exports.env = options => {
+	options = {
+		env: process.env,
+		...options
+	};
+
+	const env = {...options.env};
+	const path = pathKey({env});
+
+	options.path = env[path];
+	env[path] = module.exports(options);
+
+	return env;
+};
diff --git a/node_modules/mathjs/examples/node_modules/npm-run-path/license b/node_modules/mathjs/examples/node_modules/npm-run-path/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/npm-run-path/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/npm-run-path/package.json b/node_modules/mathjs/examples/node_modules/npm-run-path/package.json
new file mode 100644
index 0000000..feb8c00
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/npm-run-path/package.json
@@ -0,0 +1,44 @@
+{
+	"name": "npm-run-path",
+	"version": "4.0.1",
+	"description": "Get your PATH prepended with locally installed binaries",
+	"license": "MIT",
+	"repository": "sindresorhus/npm-run-path",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"npm",
+		"run",
+		"path",
+		"package",
+		"bin",
+		"binary",
+		"binaries",
+		"script",
+		"cli",
+		"command-line",
+		"execute",
+		"executable"
+	],
+	"dependencies": {
+		"path-key": "^3.0.0"
+	},
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/npm-run-path/readme.md b/node_modules/mathjs/examples/node_modules/npm-run-path/readme.md
new file mode 100644
index 0000000..557fbeb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/npm-run-path/readme.md
@@ -0,0 +1,115 @@
+# npm-run-path [![Build Status](https://travis-ci.org/sindresorhus/npm-run-path.svg?branch=master)](https://travis-ci.org/sindresorhus/npm-run-path)
+
+> Get your [PATH](https://en.wikipedia.org/wiki/PATH_(variable)) prepended with locally installed binaries
+
+In [npm run scripts](https://docs.npmjs.com/cli/run-script) you can execute locally installed binaries by name. This enables the same outside npm.
+
+
+## Install
+
+```
+$ npm install npm-run-path
+```
+
+
+## Usage
+
+```js
+const childProcess = require('child_process');
+const npmRunPath = require('npm-run-path');
+
+console.log(process.env.PATH);
+//=> '/usr/local/bin'
+
+console.log(npmRunPath());
+//=> '/Users/sindresorhus/dev/foo/node_modules/.bin:/Users/sindresorhus/dev/node_modules/.bin:/Users/sindresorhus/node_modules/.bin:/Users/node_modules/.bin:/node_modules/.bin:/usr/local/bin'
+
+// `foo` is a locally installed binary
+childProcess.execFileSync('foo', {
+	env: npmRunPath.env()
+});
+```
+
+
+## API
+
+### npmRunPath(options?)
+
+Returns the augmented path string.
+
+#### options
+
+Type: `object`
+
+##### cwd
+
+Type: `string`<br>
+Default: `process.cwd()`
+
+Working directory.
+
+##### path
+
+Type: `string`<br>
+Default: [`PATH`](https://github.com/sindresorhus/path-key)
+
+PATH to be appended.<br>
+Set it to an empty string to exclude the default PATH.
+
+##### execPath
+
+Type: `string`<br>
+Default: `process.execPath`
+
+Path to the current Node.js executable. Its directory is pushed to the front of PATH.
+
+This can be either an absolute path or a path relative to the [`cwd` option](#cwd).
+
+### npmRunPath.env(options?)
+
+Returns the augmented [`process.env`](https://nodejs.org/api/process.html#process_process_env) object.
+
+#### options
+
+Type: `object`
+
+##### cwd
+
+Type: `string`<br>
+Default: `process.cwd()`
+
+Working directory.
+
+##### env
+
+Type: `Object`
+
+Accepts an object of environment variables, like `process.env`, and modifies the PATH using the correct [PATH key](https://github.com/sindresorhus/path-key). Use this if you're modifying the PATH for use in the `child_process` options.
+
+##### execPath
+
+Type: `string`<br>
+Default: `process.execPath`
+
+Path to the Node.js executable to use in child processes if that is different from the current one. Its directory is pushed to the front of PATH.
+
+This can be either an absolute path or a path relative to the [`cwd` option](#cwd).
+
+
+## Related
+
+- [npm-run-path-cli](https://github.com/sindresorhus/npm-run-path-cli) - CLI for this module
+- [execa](https://github.com/sindresorhus/execa) - Execute a locally installed binary
+
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-npm-run-path?utm_source=npm-npm-run-path&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/onetime/index.d.ts b/node_modules/mathjs/examples/node_modules/onetime/index.d.ts
new file mode 100644
index 0000000..ea84cab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/onetime/index.d.ts
@@ -0,0 +1,64 @@
+declare namespace onetime {
+	interface Options {
+		/**
+		Throw an error when called more than once.
+
+		@default false
+		*/
+		throw?: boolean;
+	}
+}
+
+declare const onetime: {
+	/**
+	Ensure a function is only called once. When called multiple times it will return the return value from the first call.
+
+	@param fn - Function that should only be called once.
+	@returns A function that only calls `fn` once.
+
+	@example
+	```
+	import onetime = require('onetime');
+
+	let i = 0;
+
+	const foo = onetime(() => ++i);
+
+	foo(); //=> 1
+	foo(); //=> 1
+	foo(); //=> 1
+
+	onetime.callCount(foo); //=> 3
+	```
+	*/
+	<ArgumentsType extends unknown[], ReturnType>(
+		fn: (...arguments: ArgumentsType) => ReturnType,
+		options?: onetime.Options
+	): (...arguments: ArgumentsType) => ReturnType;
+
+	/**
+	Get the number of times `fn` has been called.
+
+	@param fn - Function to get call count from.
+	@returns A number representing how many times `fn` has been called.
+
+	@example
+	```
+	import onetime = require('onetime');
+
+	const foo = onetime(() => {});
+	foo();
+	foo();
+	foo();
+
+	console.log(onetime.callCount(foo));
+	//=> 3
+	```
+	*/
+	callCount(fn: (...arguments: any[]) => unknown): number;
+
+	// TODO: Remove this for the next major release
+	default: typeof onetime;
+};
+
+export = onetime;
diff --git a/node_modules/mathjs/examples/node_modules/onetime/index.js b/node_modules/mathjs/examples/node_modules/onetime/index.js
new file mode 100644
index 0000000..99c5fc1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/onetime/index.js
@@ -0,0 +1,44 @@
+'use strict';
+const mimicFn = require('mimic-fn');
+
+const calledFunctions = new WeakMap();
+
+const onetime = (function_, options = {}) => {
+	if (typeof function_ !== 'function') {
+		throw new TypeError('Expected a function');
+	}
+
+	let returnValue;
+	let callCount = 0;
+	const functionName = function_.displayName || function_.name || '<anonymous>';
+
+	const onetime = function (...arguments_) {
+		calledFunctions.set(onetime, ++callCount);
+
+		if (callCount === 1) {
+			returnValue = function_.apply(this, arguments_);
+			function_ = null;
+		} else if (options.throw === true) {
+			throw new Error(`Function \`${functionName}\` can only be called once`);
+		}
+
+		return returnValue;
+	};
+
+	mimicFn(onetime, function_);
+	calledFunctions.set(onetime, callCount);
+
+	return onetime;
+};
+
+module.exports = onetime;
+// TODO: Remove this for the next major release
+module.exports.default = onetime;
+
+module.exports.callCount = function_ => {
+	if (!calledFunctions.has(function_)) {
+		throw new Error(`The given function \`${function_.name}\` is not wrapped by the \`onetime\` package`);
+	}
+
+	return calledFunctions.get(function_);
+};
diff --git a/node_modules/mathjs/examples/node_modules/onetime/license b/node_modules/mathjs/examples/node_modules/onetime/license
new file mode 100644
index 0000000..fa7ceba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/onetime/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/onetime/package.json b/node_modules/mathjs/examples/node_modules/onetime/package.json
new file mode 100644
index 0000000..54caea5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/onetime/package.json
@@ -0,0 +1,43 @@
+{
+	"name": "onetime",
+	"version": "5.1.2",
+	"description": "Ensure a function is only called once",
+	"license": "MIT",
+	"repository": "sindresorhus/onetime",
+	"funding": "https://github.com/sponsors/sindresorhus",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=6"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"once",
+		"function",
+		"one",
+		"onetime",
+		"func",
+		"fn",
+		"single",
+		"call",
+		"called",
+		"prevent"
+	],
+	"dependencies": {
+		"mimic-fn": "^2.1.0"
+	},
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.1",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/onetime/readme.md b/node_modules/mathjs/examples/node_modules/onetime/readme.md
new file mode 100644
index 0000000..2d133d3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/onetime/readme.md
@@ -0,0 +1,94 @@
+# onetime [![Build Status](https://travis-ci.com/sindresorhus/onetime.svg?branch=master)](https://travis-ci.com/github/sindresorhus/onetime)
+
+> Ensure a function is only called once
+
+When called multiple times it will return the return value from the first call.
+
+*Unlike the module [once](https://github.com/isaacs/once), this one isn't naughty and extending `Function.prototype`.*
+
+## Install
+
+```
+$ npm install onetime
+```
+
+## Usage
+
+```js
+const onetime = require('onetime');
+
+let i = 0;
+
+const foo = onetime(() => ++i);
+
+foo(); //=> 1
+foo(); //=> 1
+foo(); //=> 1
+
+onetime.callCount(foo); //=> 3
+```
+
+```js
+const onetime = require('onetime');
+
+const foo = onetime(() => {}, {throw: true});
+
+foo();
+
+foo();
+//=> Error: Function `foo` can only be called once
+```
+
+## API
+
+### onetime(fn, options?)
+
+Returns a function that only calls `fn` once.
+
+#### fn
+
+Type: `Function`
+
+Function that should only be called once.
+
+#### options
+
+Type: `object`
+
+##### throw
+
+Type: `boolean`\
+Default: `false`
+
+Throw an error when called more than once.
+
+### onetime.callCount(fn)
+
+Returns a number representing how many times `fn` has been called.
+
+Note: It throws an error if you pass in a function that is not wrapped by `onetime`.
+
+```js
+const onetime = require('onetime');
+
+const foo = onetime(() => {});
+
+foo();
+foo();
+foo();
+
+console.log(onetime.callCount(foo));
+//=> 3
+```
+
+#### fn
+
+Type: `Function`
+
+Function to get call count from.
+
+## onetime for enterprise
+
+Available as part of the Tidelift Subscription.
+
+The maintainers of onetime and thousands of other packages are working with Tidelift to deliver commercial support and maintenance for the open source dependencies you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact dependencies you use. [Learn more.](https://tidelift.com/subscription/pkg/npm-onetime?utm_source=npm-onetime&utm_medium=referral&utm_campaign=enterprise&utm_term=repo)
diff --git a/node_modules/mathjs/examples/node_modules/p-limit/index.d.ts b/node_modules/mathjs/examples/node_modules/p-limit/index.d.ts
new file mode 100644
index 0000000..6bbfad4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-limit/index.d.ts
@@ -0,0 +1,38 @@
+export interface Limit {
+	/**
+	@param fn - Promise-returning/async function.
+	@param arguments - Any arguments to pass through to `fn`. Support for passing arguments on to the `fn` is provided in order to be able to avoid creating unnecessary closures. You probably don't need this optimization unless you're pushing a lot of functions.
+	@returns The promise returned by calling `fn(...arguments)`.
+	*/
+	<Arguments extends unknown[], ReturnType>(
+		fn: (...arguments: Arguments) => PromiseLike<ReturnType> | ReturnType,
+		...arguments: Arguments
+	): Promise<ReturnType>;
+
+	/**
+	The number of promises that are currently running.
+	*/
+	readonly activeCount: number;
+
+	/**
+	The number of promises that are waiting to run (i.e. their internal `fn` was not called yet).
+	*/
+	readonly pendingCount: number;
+
+	/**
+	Discard pending promises that are waiting to run.
+
+	This might be useful if you want to teardown the queue at the end of your program's lifecycle or discard any function calls referencing an intermediary state of your app.
+
+	Note: This does not cancel promises that are already running.
+	*/
+	clearQueue(): void;
+}
+
+/**
+Run multiple promise-returning & async functions with limited concurrency.
+
+@param concurrency - Concurrency limit. Minimum: `1`.
+@returns A `limit` function.
+*/
+export default function pLimit(concurrency: number): Limit;
diff --git a/node_modules/mathjs/examples/node_modules/p-limit/index.js b/node_modules/mathjs/examples/node_modules/p-limit/index.js
new file mode 100644
index 0000000..6a72a4c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-limit/index.js
@@ -0,0 +1,57 @@
+'use strict';
+const pTry = require('p-try');
+
+const pLimit = concurrency => {
+	if (!((Number.isInteger(concurrency) || concurrency === Infinity) && concurrency > 0)) {
+		return Promise.reject(new TypeError('Expected `concurrency` to be a number from 1 and up'));
+	}
+
+	const queue = [];
+	let activeCount = 0;
+
+	const next = () => {
+		activeCount--;
+
+		if (queue.length > 0) {
+			queue.shift()();
+		}
+	};
+
+	const run = (fn, resolve, ...args) => {
+		activeCount++;
+
+		const result = pTry(fn, ...args);
+
+		resolve(result);
+
+		result.then(next, next);
+	};
+
+	const enqueue = (fn, resolve, ...args) => {
+		if (activeCount < concurrency) {
+			run(fn, resolve, ...args);
+		} else {
+			queue.push(run.bind(null, fn, resolve, ...args));
+		}
+	};
+
+	const generator = (fn, ...args) => new Promise(resolve => enqueue(fn, resolve, ...args));
+	Object.defineProperties(generator, {
+		activeCount: {
+			get: () => activeCount
+		},
+		pendingCount: {
+			get: () => queue.length
+		},
+		clearQueue: {
+			value: () => {
+				queue.length = 0;
+			}
+		}
+	});
+
+	return generator;
+};
+
+module.exports = pLimit;
+module.exports.default = pLimit;
diff --git a/node_modules/mathjs/examples/node_modules/p-limit/license b/node_modules/mathjs/examples/node_modules/p-limit/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-limit/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/p-limit/package.json b/node_modules/mathjs/examples/node_modules/p-limit/package.json
new file mode 100644
index 0000000..99a814f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-limit/package.json
@@ -0,0 +1,52 @@
+{
+	"name": "p-limit",
+	"version": "2.3.0",
+	"description": "Run multiple promise-returning & async functions with limited concurrency",
+	"license": "MIT",
+	"repository": "sindresorhus/p-limit",
+	"funding": "https://github.com/sponsors/sindresorhus",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=6"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd-check"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"promise",
+		"limit",
+		"limited",
+		"concurrency",
+		"throttle",
+		"throat",
+		"rate",
+		"batch",
+		"ratelimit",
+		"task",
+		"queue",
+		"async",
+		"await",
+		"promises",
+		"bluebird"
+	],
+	"dependencies": {
+		"p-try": "^2.0.0"
+	},
+	"devDependencies": {
+		"ava": "^1.2.1",
+		"delay": "^4.1.0",
+		"in-range": "^1.0.0",
+		"random-int": "^1.0.0",
+		"time-span": "^2.0.0",
+		"tsd-check": "^0.3.0",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/p-limit/readme.md b/node_modules/mathjs/examples/node_modules/p-limit/readme.md
new file mode 100644
index 0000000..64aa476
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-limit/readme.md
@@ -0,0 +1,101 @@
+# p-limit [![Build Status](https://travis-ci.org/sindresorhus/p-limit.svg?branch=master)](https://travis-ci.org/sindresorhus/p-limit)
+
+> Run multiple promise-returning & async functions with limited concurrency
+
+## Install
+
+```
+$ npm install p-limit
+```
+
+## Usage
+
+```js
+const pLimit = require('p-limit');
+
+const limit = pLimit(1);
+
+const input = [
+	limit(() => fetchSomething('foo')),
+	limit(() => fetchSomething('bar')),
+	limit(() => doSomething())
+];
+
+(async () => {
+	// Only one promise is run at once
+	const result = await Promise.all(input);
+	console.log(result);
+})();
+```
+
+## API
+
+### pLimit(concurrency)
+
+Returns a `limit` function.
+
+#### concurrency
+
+Type: `number`\
+Minimum: `1`\
+Default: `Infinity`
+
+Concurrency limit.
+
+### limit(fn, ...args)
+
+Returns the promise returned by calling `fn(...args)`.
+
+#### fn
+
+Type: `Function`
+
+Promise-returning/async function.
+
+#### args
+
+Any arguments to pass through to `fn`.
+
+Support for passing arguments on to the `fn` is provided in order to be able to avoid creating unnecessary closures. You probably don't need this optimization unless you're pushing a *lot* of functions.
+
+### limit.activeCount
+
+The number of promises that are currently running.
+
+### limit.pendingCount
+
+The number of promises that are waiting to run (i.e. their internal `fn` was not called yet).
+
+### limit.clearQueue()
+
+Discard pending promises that are waiting to run.
+
+This might be useful if you want to teardown the queue at the end of your program's lifecycle or discard any function calls referencing an intermediary state of your app.
+
+Note: This does not cancel promises that are already running.
+
+## FAQ
+
+### How is this different from the [`p-queue`](https://github.com/sindresorhus/p-queue) package?
+
+This package is only about limiting the number of concurrent executions, while `p-queue` is a fully featured queue implementation with lots of different options, introspection, and ability to pause the queue.
+
+## Related
+
+- [p-queue](https://github.com/sindresorhus/p-queue) - Promise queue with concurrency control
+- [p-throttle](https://github.com/sindresorhus/p-throttle) - Throttle promise-returning & async functions
+- [p-debounce](https://github.com/sindresorhus/p-debounce) - Debounce promise-returning & async functions
+- [p-all](https://github.com/sindresorhus/p-all) - Run promise-returning & async functions concurrently with optional limited concurrency
+- [More…](https://github.com/sindresorhus/promise-fun)
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-p-limit?utm_source=npm-p-limit&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/p-locate/index.d.ts b/node_modules/mathjs/examples/node_modules/p-locate/index.d.ts
new file mode 100644
index 0000000..14115e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-locate/index.d.ts
@@ -0,0 +1,64 @@
+declare namespace pLocate {
+	interface Options {
+		/**
+		Number of concurrently pending promises returned by `tester`. Minimum: `1`.
+
+		@default Infinity
+		*/
+		readonly concurrency?: number;
+
+		/**
+		Preserve `input` order when searching.
+
+		Disable this to improve performance if you don't care about the order.
+
+		@default true
+		*/
+		readonly preserveOrder?: boolean;
+	}
+}
+
+declare const pLocate: {
+	/**
+	Get the first fulfilled promise that satisfies the provided testing function.
+
+	@param input - An iterable of promises/values to test.
+	@param tester - This function will receive resolved values from `input` and is expected to return a `Promise<boolean>` or `boolean`.
+	@returns A `Promise` that is fulfilled when `tester` resolves to `true` or the iterable is done, or rejects if any of the promises reject. The fulfilled value is the current iterable value or `undefined` if `tester` never resolved to `true`.
+
+	@example
+	```
+	import pathExists = require('path-exists');
+	import pLocate = require('p-locate');
+
+	const files = [
+		'unicorn.png',
+		'rainbow.png', // Only this one actually exists on disk
+		'pony.png'
+	];
+
+	(async () => {
+		const foundPath = await pLocate(files, file => pathExists(file));
+
+		console.log(foundPath);
+		//=> 'rainbow'
+	})();
+	```
+	*/
+	<ValueType>(
+		input: Iterable<PromiseLike<ValueType> | ValueType>,
+		tester: (element: ValueType) => PromiseLike<boolean> | boolean,
+		options?: pLocate.Options
+	): Promise<ValueType | undefined>;
+
+	// TODO: Remove this for the next major release, refactor the whole definition to:
+	// declare function pLocate<ValueType>(
+	// 	input: Iterable<PromiseLike<ValueType> | ValueType>,
+	// 	tester: (element: ValueType) => PromiseLike<boolean> | boolean,
+	// 	options?: pLocate.Options
+	// ): Promise<ValueType | undefined>;
+	// export = pLocate;
+	default: typeof pLocate;
+};
+
+export = pLocate;
diff --git a/node_modules/mathjs/examples/node_modules/p-locate/index.js b/node_modules/mathjs/examples/node_modules/p-locate/index.js
new file mode 100644
index 0000000..e13ce15
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-locate/index.js
@@ -0,0 +1,52 @@
+'use strict';
+const pLimit = require('p-limit');
+
+class EndError extends Error {
+	constructor(value) {
+		super();
+		this.value = value;
+	}
+}
+
+// The input can also be a promise, so we await it
+const testElement = async (element, tester) => tester(await element);
+
+// The input can also be a promise, so we `Promise.all()` them both
+const finder = async element => {
+	const values = await Promise.all(element);
+	if (values[1] === true) {
+		throw new EndError(values[0]);
+	}
+
+	return false;
+};
+
+const pLocate = async (iterable, tester, options) => {
+	options = {
+		concurrency: Infinity,
+		preserveOrder: true,
+		...options
+	};
+
+	const limit = pLimit(options.concurrency);
+
+	// Start all the promises concurrently with optional limit
+	const items = [...iterable].map(element => [element, limit(testElement, element, tester)]);
+
+	// Check the promises either serially or concurrently
+	const checkLimit = pLimit(options.preserveOrder ? 1 : Infinity);
+
+	try {
+		await Promise.all(items.map(element => checkLimit(finder, element)));
+	} catch (error) {
+		if (error instanceof EndError) {
+			return error.value;
+		}
+
+		throw error;
+	}
+};
+
+module.exports = pLocate;
+// TODO: Remove this for the next major release
+module.exports.default = pLocate;
diff --git a/node_modules/mathjs/examples/node_modules/p-locate/license b/node_modules/mathjs/examples/node_modules/p-locate/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-locate/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/p-locate/package.json b/node_modules/mathjs/examples/node_modules/p-locate/package.json
new file mode 100644
index 0000000..e3de275
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-locate/package.json
@@ -0,0 +1,53 @@
+{
+	"name": "p-locate",
+	"version": "4.1.0",
+	"description": "Get the first fulfilled promise that satisfies the provided testing function",
+	"license": "MIT",
+	"repository": "sindresorhus/p-locate",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"promise",
+		"locate",
+		"find",
+		"finder",
+		"search",
+		"searcher",
+		"test",
+		"array",
+		"collection",
+		"iterable",
+		"iterator",
+		"race",
+		"fulfilled",
+		"fastest",
+		"async",
+		"await",
+		"promises",
+		"bluebird"
+	],
+	"dependencies": {
+		"p-limit": "^2.2.0"
+	},
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"delay": "^4.1.0",
+		"in-range": "^1.0.0",
+		"time-span": "^3.0.0",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/p-locate/readme.md b/node_modules/mathjs/examples/node_modules/p-locate/readme.md
new file mode 100644
index 0000000..f8e2c2e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-locate/readme.md
@@ -0,0 +1,90 @@
+# p-locate [![Build Status](https://travis-ci.org/sindresorhus/p-locate.svg?branch=master)](https://travis-ci.org/sindresorhus/p-locate)
+
+> Get the first fulfilled promise that satisfies the provided testing function
+
+Think of it like an async version of [`Array#find`](https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Array/find).
+
+
+## Install
+
+```
+$ npm install p-locate
+```
+
+
+## Usage
+
+Here we find the first file that exists on disk, in array order.
+
+```js
+const pathExists = require('path-exists');
+const pLocate = require('p-locate');
+
+const files = [
+	'unicorn.png',
+	'rainbow.png', // Only this one actually exists on disk
+	'pony.png'
+];
+
+(async () => {
+	const foundPath = await pLocate(files, file => pathExists(file));
+
+	console.log(foundPath);
+	//=> 'rainbow'
+})();
+```
+
+*The above is just an example. Use [`locate-path`](https://github.com/sindresorhus/locate-path) if you need this.*
+
+
+## API
+
+### pLocate(input, tester, [options])
+
+Returns a `Promise` that is fulfilled when `tester` resolves to `true` or the iterable is done, or rejects if any of the promises reject. The fulfilled value is the current iterable value or `undefined` if `tester` never resolved to `true`.
+
+#### input
+
+Type: `Iterable<Promise | unknown>`
+
+An iterable of promises/values to test.
+
+#### tester(element)
+
+Type: `Function`
+
+This function will receive resolved values from `input` and is expected to return a `Promise<boolean>` or `boolean`.
+
+#### options
+
+Type: `Object`
+
+##### concurrency
+
+Type: `number`<br>
+Default: `Infinity`<br>
+Minimum: `1`
+
+Number of concurrently pending promises returned by `tester`.
+
+##### preserveOrder
+
+Type: `boolean`<br>
+Default: `true`
+
+Preserve `input` order when searching.
+
+Disable this to improve performance if you don't care about the order.
+
+
+## Related
+
+- [p-map](https://github.com/sindresorhus/p-map) - Map over promises concurrently
+- [p-filter](https://github.com/sindresorhus/p-filter) - Filter promises concurrently
+- [p-any](https://github.com/sindresorhus/p-any) - Wait for any promise to be fulfilled
+- [More…](https://github.com/sindresorhus/promise-fun)
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/p-try/index.d.ts b/node_modules/mathjs/examples/node_modules/p-try/index.d.ts
new file mode 100644
index 0000000..2a7319e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-try/index.d.ts
@@ -0,0 +1,39 @@
+declare const pTry: {
+	/**
+	Start a promise chain.
+
+	@param fn - The function to run to start the promise chain.
+	@param arguments - Arguments to pass to `fn`.
+	@returns The value of calling `fn(...arguments)`. If the function throws an error, the returned `Promise` will be rejected with that error.
+
+	@example
+	```
+	import pTry = require('p-try');
+
+	(async () => {
+		try {
+			const value = await pTry(() => {
+				return synchronousFunctionThatMightThrow();
+			});
+			console.log(value);
+		} catch (error) {
+			console.error(error);
+		}
+	})();
+	```
+	*/
+	<ValueType, ArgumentsType extends unknown[]>(
+		fn: (...arguments: ArgumentsType) => PromiseLike<ValueType> | ValueType,
+		...arguments: ArgumentsType
+	): Promise<ValueType>;
+
+	// TODO: remove this in the next major version, refactor the whole definition to:
+	// declare function pTry<ValueType, ArgumentsType extends unknown[]>(
+	//	fn: (...arguments: ArgumentsType) => PromiseLike<ValueType> | ValueType,
+	//	...arguments: ArgumentsType
+	// ): Promise<ValueType>;
+	// export = pTry;
+	default: typeof pTry;
+};
+
+export = pTry;
diff --git a/node_modules/mathjs/examples/node_modules/p-try/index.js b/node_modules/mathjs/examples/node_modules/p-try/index.js
new file mode 100644
index 0000000..db858da
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-try/index.js
@@ -0,0 +1,9 @@
+'use strict';
+
+const pTry = (fn, ...arguments_) => new Promise(resolve => {
+	resolve(fn(...arguments_));
+});
+
+module.exports = pTry;
+// TODO: remove this in the next major version
+module.exports.default = pTry;
diff --git a/node_modules/mathjs/examples/node_modules/p-try/license b/node_modules/mathjs/examples/node_modules/p-try/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-try/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/p-try/package.json b/node_modules/mathjs/examples/node_modules/p-try/package.json
new file mode 100644
index 0000000..81c4d32
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-try/package.json
@@ -0,0 +1,42 @@
+{
+	"name": "p-try",
+	"version": "2.2.0",
+	"description": "`Start a promise chain",
+	"license": "MIT",
+	"repository": "sindresorhus/p-try",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=6"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"promise",
+		"try",
+		"resolve",
+		"function",
+		"catch",
+		"async",
+		"await",
+		"promises",
+		"settled",
+		"ponyfill",
+		"polyfill",
+		"shim",
+		"bluebird"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.1",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/p-try/readme.md b/node_modules/mathjs/examples/node_modules/p-try/readme.md
new file mode 100644
index 0000000..4d7bd64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/p-try/readme.md
@@ -0,0 +1,58 @@
+# p-try [![Build Status](https://travis-ci.org/sindresorhus/p-try.svg?branch=master)](https://travis-ci.org/sindresorhus/p-try)
+
+> Start a promise chain
+
+[How is it useful?](http://cryto.net/~joepie91/blog/2016/05/11/what-is-promise-try-and-why-does-it-matter/)
+
+
+## Install
+
+```
+$ npm install p-try
+```
+
+
+## Usage
+
+```js
+const pTry = require('p-try');
+
+(async () => {
+	try {
+		const value = await pTry(() => {
+			return synchronousFunctionThatMightThrow();
+		});
+		console.log(value);
+	} catch (error) {
+		console.error(error);
+	}
+})();
+```
+
+
+## API
+
+### pTry(fn, ...arguments)
+
+Returns a `Promise` resolved with the value of calling `fn(...arguments)`. If the function throws an error, the returned `Promise` will be rejected with that error.
+
+Support for passing arguments on to the `fn` is provided in order to be able to avoid creating unnecessary closures. You probably don't need this optimization unless you're pushing a *lot* of functions.
+
+#### fn
+
+The function to run to start the promise chain.
+
+#### arguments
+
+Arguments to pass to `fn`.
+
+
+## Related
+
+- [p-finally](https://github.com/sindresorhus/p-finally) - `Promise#finally()` ponyfill - Invoked when the promise is settled regardless of outcome
+- [More…](https://github.com/sindresorhus/promise-fun)
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/path-exists/index.d.ts b/node_modules/mathjs/examples/node_modules/path-exists/index.d.ts
new file mode 100644
index 0000000..54b7ab8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-exists/index.d.ts
@@ -0,0 +1,28 @@
+declare const pathExists: {
+	/**
+	Check if a path exists.
+
+	@returns Whether the path exists.
+
+	@example
+	```
+	// foo.ts
+	import pathExists = require('path-exists');
+
+	(async () => {
+		console.log(await pathExists('foo.ts'));
+		//=> true
+	})();
+	```
+	*/
+	(path: string): Promise<boolean>;
+
+	/**
+	Synchronously check if a path exists.
+
+	@returns Whether the path exists.
+	*/
+	sync(path: string): boolean;
+};
+
+export = pathExists;
diff --git a/node_modules/mathjs/examples/node_modules/path-exists/index.js b/node_modules/mathjs/examples/node_modules/path-exists/index.js
new file mode 100644
index 0000000..1943921
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-exists/index.js
@@ -0,0 +1,23 @@
+'use strict';
+const fs = require('fs');
+const {promisify} = require('util');
+
+const pAccess = promisify(fs.access);
+
+module.exports = async path => {
+	try {
+		await pAccess(path);
+		return true;
+	} catch (_) {
+		return false;
+	}
+};
+
+module.exports.sync = path => {
+	try {
+		fs.accessSync(path);
+		return true;
+	} catch (_) {
+		return false;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/path-exists/license b/node_modules/mathjs/examples/node_modules/path-exists/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-exists/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/path-exists/package.json b/node_modules/mathjs/examples/node_modules/path-exists/package.json
new file mode 100644
index 0000000..0755256
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-exists/package.json
@@ -0,0 +1,39 @@
+{
+	"name": "path-exists",
+	"version": "4.0.0",
+	"description": "Check if a path exists",
+	"license": "MIT",
+	"repository": "sindresorhus/path-exists",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"path",
+		"exists",
+		"exist",
+		"file",
+		"filepath",
+		"fs",
+		"filesystem",
+		"file-system",
+		"access",
+		"stat"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/path-exists/readme.md b/node_modules/mathjs/examples/node_modules/path-exists/readme.md
new file mode 100644
index 0000000..81f9845
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-exists/readme.md
@@ -0,0 +1,52 @@
+# path-exists [![Build Status](https://travis-ci.org/sindresorhus/path-exists.svg?branch=master)](https://travis-ci.org/sindresorhus/path-exists)
+
+> Check if a path exists
+
+NOTE: `fs.existsSync` has been un-deprecated in Node.js since 6.8.0. If you only need to check synchronously, this module is not needed.
+
+While [`fs.exists()`](https://nodejs.org/api/fs.html#fs_fs_exists_path_callback) is being [deprecated](https://github.com/iojs/io.js/issues/103), there's still a genuine use-case of being able to check if a path exists for other purposes than doing IO with it.
+
+Never use this before handling a file though:
+
+> In particular, checking if a file exists before opening it is an anti-pattern that leaves you vulnerable to race conditions: another process may remove the file between the calls to `fs.exists()` and `fs.open()`. Just open the file and handle the error when it's not there.
+
+
+## Install
+
+```
+$ npm install path-exists
+```
+
+
+## Usage
+
+```js
+// foo.js
+const pathExists = require('path-exists');
+
+(async () => {
+	console.log(await pathExists('foo.js'));
+	//=> true
+})();
+```
+
+
+## API
+
+### pathExists(path)
+
+Returns a `Promise<boolean>` of whether the path exists.
+
+### pathExists.sync(path)
+
+Returns a `boolean` of whether the path exists.
+
+
+## Related
+
+- [path-exists-cli](https://github.com/sindresorhus/path-exists-cli) - CLI for this module
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/path-key/index.d.ts b/node_modules/mathjs/examples/node_modules/path-key/index.d.ts
new file mode 100644
index 0000000..7c575d1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-key/index.d.ts
@@ -0,0 +1,40 @@
+/// <reference types="node" />
+
+declare namespace pathKey {
+	interface Options {
+		/**
+		Use a custom environment variables object. Default: [`process.env`](https://nodejs.org/api/process.html#process_process_env).
+		*/
+		readonly env?: {[key: string]: string | undefined};
+
+		/**
+		Get the PATH key for a specific platform. Default: [`process.platform`](https://nodejs.org/api/process.html#process_process_platform).
+		*/
+		readonly platform?: NodeJS.Platform;
+	}
+}
+
+declare const pathKey: {
+	/**
+	Get the [PATH](https://en.wikipedia.org/wiki/PATH_(variable)) environment variable key cross-platform.
+
+	@example
+	```
+	import pathKey = require('path-key');
+
+	const key = pathKey();
+	//=> 'PATH'
+
+	const PATH = process.env[key];
+	//=> '/usr/local/bin:/usr/bin:/bin'
+	```
+	*/
+	(options?: pathKey.Options): string;
+
+	// TODO: Remove this for the next major release, refactor the whole definition to:
+	// declare function pathKey(options?: pathKey.Options): string;
+	// export = pathKey;
+	default: typeof pathKey;
+};
+
+export = pathKey;
diff --git a/node_modules/mathjs/examples/node_modules/path-key/index.js b/node_modules/mathjs/examples/node_modules/path-key/index.js
new file mode 100644
index 0000000..0cf6415
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-key/index.js
@@ -0,0 +1,16 @@
+'use strict';
+
+const pathKey = (options = {}) => {
+	const environment = options.env || process.env;
+	const platform = options.platform || process.platform;
+
+	if (platform !== 'win32') {
+		return 'PATH';
+	}
+
+	return Object.keys(environment).reverse().find(key => key.toUpperCase() === 'PATH') || 'Path';
+};
+
+module.exports = pathKey;
+// TODO: Remove this for the next major release
+module.exports.default = pathKey;
diff --git a/node_modules/mathjs/examples/node_modules/path-key/license b/node_modules/mathjs/examples/node_modules/path-key/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-key/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/path-key/package.json b/node_modules/mathjs/examples/node_modules/path-key/package.json
new file mode 100644
index 0000000..c8cbd38
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-key/package.json
@@ -0,0 +1,39 @@
+{
+	"name": "path-key",
+	"version": "3.1.1",
+	"description": "Get the PATH environment variable key cross-platform",
+	"license": "MIT",
+	"repository": "sindresorhus/path-key",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"path",
+		"key",
+		"environment",
+		"env",
+		"variable",
+		"var",
+		"get",
+		"cross-platform",
+		"windows"
+	],
+	"devDependencies": {
+		"@types/node": "^11.13.0",
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/path-key/readme.md b/node_modules/mathjs/examples/node_modules/path-key/readme.md
new file mode 100644
index 0000000..a9052d7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-key/readme.md
@@ -0,0 +1,61 @@
+# path-key [![Build Status](https://travis-ci.org/sindresorhus/path-key.svg?branch=master)](https://travis-ci.org/sindresorhus/path-key)
+
+> Get the [PATH](https://en.wikipedia.org/wiki/PATH_(variable)) environment variable key cross-platform
+
+It's usually `PATH`, but on Windows it can be any casing like `Path`...
+
+
+## Install
+
+```
+$ npm install path-key
+```
+
+
+## Usage
+
+```js
+const pathKey = require('path-key');
+
+const key = pathKey();
+//=> 'PATH'
+
+const PATH = process.env[key];
+//=> '/usr/local/bin:/usr/bin:/bin'
+```
+
+
+## API
+
+### pathKey(options?)
+
+#### options
+
+Type: `object`
+
+##### env
+
+Type: `object`<br>
+Default: [`process.env`](https://nodejs.org/api/process.html#process_process_env)
+
+Use a custom environment variables object.
+
+#### platform
+
+Type: `string`<br>
+Default: [`process.platform`](https://nodejs.org/api/process.html#process_process_platform)
+
+Get the PATH key for a specific platform.
+
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-path-key?utm_source=npm-path-key&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
diff --git a/node_modules/mathjs/examples/node_modules/path-parse/LICENSE b/node_modules/mathjs/examples/node_modules/path-parse/LICENSE
new file mode 100644
index 0000000..810f3db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-parse/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Javier Blanco
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/path-parse/README.md b/node_modules/mathjs/examples/node_modules/path-parse/README.md
new file mode 100644
index 0000000..05097f8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-parse/README.md
@@ -0,0 +1,42 @@
+# path-parse [![Build Status](https://travis-ci.org/jbgutierrez/path-parse.svg?branch=master)](https://travis-ci.org/jbgutierrez/path-parse)
+
+> Node.js [`path.parse(pathString)`](https://nodejs.org/api/path.html#path_path_parse_pathstring) [ponyfill](https://ponyfill.com).
+
+## Install
+
+```
+$ npm install --save path-parse
+```
+
+## Usage
+
+```js
+var pathParse = require('path-parse');
+
+pathParse('/home/user/dir/file.txt');
+//=> {
+//       root : "/",
+//       dir : "/home/user/dir",
+//       base : "file.txt",
+//       ext : ".txt",
+//       name : "file"
+//   }
+```
+
+## API
+
+See [`path.parse(pathString)`](https://nodejs.org/api/path.html#path_path_parse_pathstring) docs.
+
+### pathParse(path)
+
+### pathParse.posix(path)
+
+The Posix specific version.
+
+### pathParse.win32(path)
+
+The Windows specific version.
+
+## License
+
+MIT © [Javier Blanco](http://jbgutierrez.info)
diff --git a/node_modules/mathjs/examples/node_modules/path-parse/index.js b/node_modules/mathjs/examples/node_modules/path-parse/index.js
new file mode 100644
index 0000000..f062d0a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-parse/index.js
@@ -0,0 +1,75 @@
+'use strict';
+
+var isWindows = process.platform === 'win32';
+
+// Regex to split a windows path into into [dir, root, basename, name, ext]
+var splitWindowsRe =
+    /^(((?:[a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/]+[^\\\/]+)?[\\\/]?)(?:[^\\\/]*[\\\/])*)((\.{1,2}|[^\\\/]+?|)(\.[^.\/\\]*|))[\\\/]*$/;
+
+var win32 = {};
+
+function win32SplitPath(filename) {
+  return splitWindowsRe.exec(filename).slice(1);
+}
+
+win32.parse = function(pathString) {
+  if (typeof pathString !== 'string') {
+    throw new TypeError(
+        "Parameter 'pathString' must be a string, not " + typeof pathString
+    );
+  }
+  var allParts = win32SplitPath(pathString);
+  if (!allParts || allParts.length !== 5) {
+    throw new TypeError("Invalid path '" + pathString + "'");
+  }
+  return {
+    root: allParts[1],
+    dir: allParts[0] === allParts[1] ? allParts[0] : allParts[0].slice(0, -1),
+    base: allParts[2],
+    ext: allParts[4],
+    name: allParts[3]
+  };
+};
+
+
+
+// Split a filename into [dir, root, basename, name, ext], unix version
+// 'root' is just a slash, or nothing.
+var splitPathRe =
+    /^((\/?)(?:[^\/]*\/)*)((\.{1,2}|[^\/]+?|)(\.[^.\/]*|))[\/]*$/;
+var posix = {};
+
+
+function posixSplitPath(filename) {
+  return splitPathRe.exec(filename).slice(1);
+}
+
+
+posix.parse = function(pathString) {
+  if (typeof pathString !== 'string') {
+    throw new TypeError(
+        "Parameter 'pathString' must be a string, not " + typeof pathString
+    );
+  }
+  var allParts = posixSplitPath(pathString);
+  if (!allParts || allParts.length !== 5) {
+    throw new TypeError("Invalid path '" + pathString + "'");
+  }
+  
+  return {
+    root: allParts[1],
+    dir: allParts[0].slice(0, -1),
+    base: allParts[2],
+    ext: allParts[4],
+    name: allParts[3],
+  };
+};
+
+
+if (isWindows)
+  module.exports = win32.parse;
+else /* posix */
+  module.exports = posix.parse;
+
+module.exports.posix = posix.parse;
+module.exports.win32 = win32.parse;
diff --git a/node_modules/mathjs/examples/node_modules/path-parse/package.json b/node_modules/mathjs/examples/node_modules/path-parse/package.json
new file mode 100644
index 0000000..36c23f8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/path-parse/package.json
@@ -0,0 +1,33 @@
+{
+  "name": "path-parse",
+  "version": "1.0.7",
+  "description": "Node.js path.parse() ponyfill",
+  "main": "index.js",
+  "scripts": {
+    "test": "node test.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/jbgutierrez/path-parse.git"
+  },
+  "keywords": [
+    "path",
+    "paths",
+    "file",
+    "dir",
+    "parse",
+    "built-in",
+    "util",
+    "utils",
+    "core",
+    "ponyfill",
+    "polyfill",
+    "shim"
+  ],
+  "author": "Javier Blanco <http://jbgutierrez.info>",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/jbgutierrez/path-parse/issues"
+  },
+  "homepage": "https://github.com/jbgutierrez/path-parse#readme"
+}
diff --git a/node_modules/mathjs/examples/node_modules/picocolors/LICENSE b/node_modules/mathjs/examples/node_modules/picocolors/LICENSE
new file mode 100644
index 0000000..496098c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/picocolors/LICENSE
@@ -0,0 +1,15 @@
+ISC License
+
+Copyright (c) 2021 Alexey Raspopov, Kostiantyn Denysov, Anton Verinov
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/picocolors/README.md b/node_modules/mathjs/examples/node_modules/picocolors/README.md
new file mode 100644
index 0000000..8e47aa8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/picocolors/README.md
@@ -0,0 +1,21 @@
+# picocolors
+
+The tiniest and the fastest library for terminal output formatting with ANSI colors.
+
+```javascript
+import pc from "picocolors"
+
+console.log(
+  pc.green(`How are ${pc.italic(`you`)} doing?`)
+)
+```
+
+- **No dependencies.**
+- **14 times** smaller and **2 times** faster than chalk.
+- Used by popular tools like PostCSS, SVGO, Stylelint, and Browserslist.
+- Node.js v6+ & browsers support. Support for both CJS and ESM projects.
+- TypeScript type declarations included.
+- [`NO_COLOR`](https://no-color.org/) friendly.
+
+## Docs
+Read **[full docs](https://github.com/alexeyraspopov/picocolors#readme)** on GitHub.
diff --git a/node_modules/mathjs/examples/node_modules/picocolors/package.json b/node_modules/mathjs/examples/node_modules/picocolors/package.json
new file mode 100644
index 0000000..85a12d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/picocolors/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "picocolors",
+  "version": "1.0.0",
+  "main": "./picocolors.js",
+  "types": "./picocolors.d.ts",
+  "browser": {
+    "./picocolors.js": "./picocolors.browser.js"
+  },
+  "sideEffects": false,
+  "description": "The tiniest and the fastest library for terminal output formatting with ANSI colors",
+  "files": [
+    "picocolors.*",
+    "types.ts"
+  ],
+  "keywords": [
+    "terminal",
+    "colors",
+    "formatting",
+    "cli",
+    "console"
+  ],
+  "author": "Alexey Raspopov",
+  "repository": "alexeyraspopov/picocolors",
+  "license": "ISC"
+}
diff --git a/node_modules/mathjs/examples/node_modules/picocolors/picocolors.browser.js b/node_modules/mathjs/examples/node_modules/picocolors/picocolors.browser.js
new file mode 100644
index 0000000..5eb9fbe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/picocolors/picocolors.browser.js
@@ -0,0 +1,4 @@
+var x=String;
+var create=function() {return {isColorSupported:false,reset:x,bold:x,dim:x,italic:x,underline:x,inverse:x,hidden:x,strikethrough:x,black:x,red:x,green:x,yellow:x,blue:x,magenta:x,cyan:x,white:x,gray:x,bgBlack:x,bgRed:x,bgGreen:x,bgYellow:x,bgBlue:x,bgMagenta:x,bgCyan:x,bgWhite:x}};
+module.exports=create();
+module.exports.createColors = create;
diff --git a/node_modules/mathjs/examples/node_modules/picocolors/picocolors.d.ts b/node_modules/mathjs/examples/node_modules/picocolors/picocolors.d.ts
new file mode 100644
index 0000000..94e146a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/picocolors/picocolors.d.ts
@@ -0,0 +1,5 @@
+import { Colors } from "./types"
+
+declare const picocolors: Colors & { createColors: (enabled?: boolean) => Colors }
+
+export = picocolors
diff --git a/node_modules/mathjs/examples/node_modules/picocolors/picocolors.js b/node_modules/mathjs/examples/node_modules/picocolors/picocolors.js
new file mode 100644
index 0000000..fdb6304
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/picocolors/picocolors.js
@@ -0,0 +1,58 @@
+let tty = require("tty")
+
+let isColorSupported =
+	!("NO_COLOR" in process.env || process.argv.includes("--no-color")) &&
+	("FORCE_COLOR" in process.env ||
+		process.argv.includes("--color") ||
+		process.platform === "win32" ||
+		(tty.isatty(1) && process.env.TERM !== "dumb") ||
+		"CI" in process.env)
+
+let formatter =
+	(open, close, replace = open) =>
+	input => {
+		let string = "" + input
+		let index = string.indexOf(close, open.length)
+		return ~index
+			? open + replaceClose(string, close, replace, index) + close
+			: open + string + close
+	}
+
+let replaceClose = (string, close, replace, index) => {
+	let start = string.substring(0, index) + replace
+	let end = string.substring(index + close.length)
+	let nextIndex = end.indexOf(close)
+	return ~nextIndex ? start + replaceClose(end, close, replace, nextIndex) : start + end
+}
+
+let createColors = (enabled = isColorSupported) => ({
+	isColorSupported: enabled,
+	reset: enabled ? s => `\x1b[0m${s}\x1b[0m` : String,
+	bold: enabled ? formatter("\x1b[1m", "\x1b[22m", "\x1b[22m\x1b[1m") : String,
+	dim: enabled ? formatter("\x1b[2m", "\x1b[22m", "\x1b[22m\x1b[2m") : String,
+	italic: enabled ? formatter("\x1b[3m", "\x1b[23m") : String,
+	underline: enabled ? formatter("\x1b[4m", "\x1b[24m") : String,
+	inverse: enabled ? formatter("\x1b[7m", "\x1b[27m") : String,
+	hidden: enabled ? formatter("\x1b[8m", "\x1b[28m") : String,
+	strikethrough: enabled ? formatter("\x1b[9m", "\x1b[29m") : String,
+	black: enabled ? formatter("\x1b[30m", "\x1b[39m") : String,
+	red: enabled ? formatter("\x1b[31m", "\x1b[39m") : String,
+	green: enabled ? formatter("\x1b[32m", "\x1b[39m") : String,
+	yellow: enabled ? formatter("\x1b[33m", "\x1b[39m") : String,
+	blue: enabled ? formatter("\x1b[34m", "\x1b[39m") : String,
+	magenta: enabled ? formatter("\x1b[35m", "\x1b[39m") : String,
+	cyan: enabled ? formatter("\x1b[36m", "\x1b[39m") : String,
+	white: enabled ? formatter("\x1b[37m", "\x1b[39m") : String,
+	gray: enabled ? formatter("\x1b[90m", "\x1b[39m") : String,
+	bgBlack: enabled ? formatter("\x1b[40m", "\x1b[49m") : String,
+	bgRed: enabled ? formatter("\x1b[41m", "\x1b[49m") : String,
+	bgGreen: enabled ? formatter("\x1b[42m", "\x1b[49m") : String,
+	bgYellow: enabled ? formatter("\x1b[43m", "\x1b[49m") : String,
+	bgBlue: enabled ? formatter("\x1b[44m", "\x1b[49m") : String,
+	bgMagenta: enabled ? formatter("\x1b[45m", "\x1b[49m") : String,
+	bgCyan: enabled ? formatter("\x1b[46m", "\x1b[49m") : String,
+	bgWhite: enabled ? formatter("\x1b[47m", "\x1b[49m") : String,
+})
+
+module.exports = createColors()
+module.exports.createColors = createColors
diff --git a/node_modules/mathjs/examples/node_modules/picocolors/types.ts b/node_modules/mathjs/examples/node_modules/picocolors/types.ts
new file mode 100644
index 0000000..b4bacee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/picocolors/types.ts
@@ -0,0 +1,30 @@
+export type Formatter = (input: string | number | null | undefined) => string
+
+export interface Colors {
+	isColorSupported: boolean
+	reset: Formatter
+	bold: Formatter
+	dim: Formatter
+	italic: Formatter
+	underline: Formatter
+	inverse: Formatter
+	hidden: Formatter
+	strikethrough: Formatter
+	black: Formatter
+	red: Formatter
+	green: Formatter
+	yellow: Formatter
+	blue: Formatter
+	magenta: Formatter
+	cyan: Formatter
+	white: Formatter
+	gray: Formatter
+	bgBlack: Formatter
+	bgRed: Formatter
+	bgGreen: Formatter
+	bgYellow: Formatter
+	bgBlue: Formatter
+	bgMagenta: Formatter
+	bgCyan: Formatter
+	bgWhite: Formatter
+}
diff --git a/node_modules/mathjs/examples/node_modules/pkg-dir/index.d.ts b/node_modules/mathjs/examples/node_modules/pkg-dir/index.d.ts
new file mode 100644
index 0000000..e339404
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/pkg-dir/index.d.ts
@@ -0,0 +1,44 @@
+declare const pkgDir: {
+	/**
+	Find the root directory of a Node.js project or npm package.
+
+	@param cwd - Directory to start from. Default: `process.cwd()`.
+	@returns The project root path or `undefined` if it couldn't be found.
+
+	@example
+	```
+	// /
+	// └── Users
+	//     └── sindresorhus
+	//         └── foo
+	//             ├── package.json
+	//             └── bar
+	//                 ├── baz
+	//                 └── example.js
+
+	// example.js
+	import pkgDir = require('pkg-dir');
+
+	(async () => {
+		const rootDir = await pkgDir(__dirname);
+
+		console.log(rootDir);
+		//=> '/Users/sindresorhus/foo'
+	})();
+	```
+	*/
+	(cwd?: string): Promise<string | undefined>;
+
+	/**
+	Synchronously find the root directory of a Node.js project or npm package.
+
+	@param cwd - Directory to start from. Default: `process.cwd()`.
+	@returns The project root path or `undefined` if it couldn't be found.
+	*/
+	sync(cwd?: string): string | undefined;
+
+	// TODO: Remove this for the next major release
+	default: typeof pkgDir;
+};
+
+export = pkgDir;
diff --git a/node_modules/mathjs/examples/node_modules/pkg-dir/index.js b/node_modules/mathjs/examples/node_modules/pkg-dir/index.js
new file mode 100644
index 0000000..83e683d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/pkg-dir/index.js
@@ -0,0 +1,17 @@
+'use strict';
+const path = require('path');
+const findUp = require('find-up');
+
+const pkgDir = async cwd => {
+	const filePath = await findUp('package.json', {cwd});
+	return filePath && path.dirname(filePath);
+};
+
+module.exports = pkgDir;
+// TODO: Remove this for the next major release
+module.exports.default = pkgDir;
+
+module.exports.sync = cwd => {
+	const filePath = findUp.sync('package.json', {cwd});
+	return filePath && path.dirname(filePath);
+};
diff --git a/node_modules/mathjs/examples/node_modules/pkg-dir/license b/node_modules/mathjs/examples/node_modules/pkg-dir/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/pkg-dir/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/pkg-dir/package.json b/node_modules/mathjs/examples/node_modules/pkg-dir/package.json
new file mode 100644
index 0000000..aad11e8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/pkg-dir/package.json
@@ -0,0 +1,56 @@
+{
+	"name": "pkg-dir",
+	"version": "4.2.0",
+	"description": "Find the root directory of a Node.js project or npm package",
+	"license": "MIT",
+	"repository": "sindresorhus/pkg-dir",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"package",
+		"json",
+		"root",
+		"npm",
+		"entry",
+		"find",
+		"up",
+		"find-up",
+		"findup",
+		"look-up",
+		"look",
+		"file",
+		"search",
+		"match",
+		"resolve",
+		"parent",
+		"parents",
+		"folder",
+		"directory",
+		"dir",
+		"walk",
+		"walking",
+		"path"
+	],
+	"dependencies": {
+		"find-up": "^4.0.0"
+	},
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tempy": "^0.3.0",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/pkg-dir/readme.md b/node_modules/mathjs/examples/node_modules/pkg-dir/readme.md
new file mode 100644
index 0000000..92a77f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/pkg-dir/readme.md
@@ -0,0 +1,66 @@
+# pkg-dir [![Build Status](https://travis-ci.org/sindresorhus/pkg-dir.svg?branch=master)](https://travis-ci.org/sindresorhus/pkg-dir)
+
+> Find the root directory of a Node.js project or npm package
+
+
+## Install
+
+```
+$ npm install pkg-dir
+```
+
+
+## Usage
+
+```
+/
+└── Users
+    └── sindresorhus
+        └── foo
+            ├── package.json
+            └── bar
+                ├── baz
+                └── example.js
+```
+
+```js
+// example.js
+const pkgDir = require('pkg-dir');
+
+(async () => {
+	const rootDir = await pkgDir(__dirname);
+
+	console.log(rootDir);
+	//=> '/Users/sindresorhus/foo'
+})();
+```
+
+
+## API
+
+### pkgDir([cwd])
+
+Returns a `Promise` for either the project root path or `undefined` if it couldn't be found.
+
+### pkgDir.sync([cwd])
+
+Returns the project root path or `undefined` if it couldn't be found.
+
+#### cwd
+
+Type: `string`<br>
+Default: `process.cwd()`
+
+Directory to start from.
+
+
+## Related
+
+- [pkg-dir-cli](https://github.com/sindresorhus/pkg-dir-cli) - CLI for this module
+- [pkg-up](https://github.com/sindresorhus/pkg-up) - Find the closest package.json file
+- [find-up](https://github.com/sindresorhus/find-up) - Find a file by walking up parent directories
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/punycode/LICENSE-MIT.txt b/node_modules/mathjs/examples/node_modules/punycode/LICENSE-MIT.txt
new file mode 100644
index 0000000..a41e0a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/punycode/LICENSE-MIT.txt
@@ -0,0 +1,20 @@
+Copyright Mathias Bynens <https://mathiasbynens.be/>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/punycode/README.md b/node_modules/mathjs/examples/node_modules/punycode/README.md
new file mode 100644
index 0000000..ee2f9d6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/punycode/README.md
@@ -0,0 +1,122 @@
+# Punycode.js [![Build status](https://travis-ci.org/bestiejs/punycode.js.svg?branch=master)](https://travis-ci.org/bestiejs/punycode.js) [![Code coverage status](http://img.shields.io/codecov/c/github/bestiejs/punycode.js.svg)](https://codecov.io/gh/bestiejs/punycode.js) [![Dependency status](https://gemnasium.com/bestiejs/punycode.js.svg)](https://gemnasium.com/bestiejs/punycode.js)
+
+Punycode.js is a robust Punycode converter that fully complies to [RFC 3492](https://tools.ietf.org/html/rfc3492) and [RFC 5891](https://tools.ietf.org/html/rfc5891).
+
+This JavaScript library is the result of comparing, optimizing and documenting different open-source implementations of the Punycode algorithm:
+
+* [The C example code from RFC 3492](https://tools.ietf.org/html/rfc3492#appendix-C)
+* [`punycode.c` by _Markus W. Scherer_ (IBM)](http://opensource.apple.com/source/ICU/ICU-400.42/icuSources/common/punycode.c)
+* [`punycode.c` by _Ben Noordhuis_](https://github.com/bnoordhuis/punycode/blob/master/punycode.c)
+* [JavaScript implementation by _some_](http://stackoverflow.com/questions/183485/can-anyone-recommend-a-good-free-javascript-for-punycode-to-unicode-conversion/301287#301287)
+* [`punycode.js` by _Ben Noordhuis_](https://github.com/joyent/node/blob/426298c8c1c0d5b5224ac3658c41e7c2a3fe9377/lib/punycode.js) (note: [not fully compliant](https://github.com/joyent/node/issues/2072))
+
+This project was [bundled](https://github.com/joyent/node/blob/master/lib/punycode.js) with Node.js from [v0.6.2+](https://github.com/joyent/node/compare/975f1930b1...61e796decc) until [v7](https://github.com/nodejs/node/pull/7941) (soft-deprecated).
+
+The current version supports recent versions of Node.js only. It provides a CommonJS module and an ES6 module. For the old version that offers the same functionality with broader support, including Rhino, Ringo, Narwhal, and web browsers, see [v1.4.1](https://github.com/bestiejs/punycode.js/releases/tag/v1.4.1).
+
+## Installation
+
+Via [npm](https://www.npmjs.com/):
+
+```bash
+npm install punycode --save
+```
+
+In [Node.js](https://nodejs.org/):
+
+```js
+const punycode = require('punycode');
+```
+
+## API
+
+### `punycode.decode(string)`
+
+Converts a Punycode string of ASCII symbols to a string of Unicode symbols.
+
+```js
+// decode domain name parts
+punycode.decode('maana-pta'); // 'mañana'
+punycode.decode('--dqo34k'); // '☃-⌘'
+```
+
+### `punycode.encode(string)`
+
+Converts a string of Unicode symbols to a Punycode string of ASCII symbols.
+
+```js
+// encode domain name parts
+punycode.encode('mañana'); // 'maana-pta'
+punycode.encode('☃-⌘'); // '--dqo34k'
+```
+
+### `punycode.toUnicode(input)`
+
+Converts a Punycode string representing a domain name or an email address to Unicode. Only the Punycoded parts of the input will be converted, i.e. it doesn’t matter if you call it on a string that has already been converted to Unicode.
+
+```js
+// decode domain names
+punycode.toUnicode('xn--maana-pta.com');
+// → 'mañana.com'
+punycode.toUnicode('xn----dqo34k.com');
+// → '☃-⌘.com'
+
+// decode email addresses
+punycode.toUnicode('джумла@xn--p-8sbkgc5ag7bhce.xn--ba-lmcq');
+// → 'джумла@джpумлатест.bрфa'
+```
+
+### `punycode.toASCII(input)`
+
+Converts a lowercased Unicode string representing a domain name or an email address to Punycode. Only the non-ASCII parts of the input will be converted, i.e. it doesn’t matter if you call it with a domain that’s already in ASCII.
+
+```js
+// encode domain names
+punycode.toASCII('mañana.com');
+// → 'xn--maana-pta.com'
+punycode.toASCII('☃-⌘.com');
+// → 'xn----dqo34k.com'
+
+// encode email addresses
+punycode.toASCII('джумла@джpумлатест.bрфa');
+// → 'джумла@xn--p-8sbkgc5ag7bhce.xn--ba-lmcq'
+```
+
+### `punycode.ucs2`
+
+#### `punycode.ucs2.decode(string)`
+
+Creates an array containing the numeric code point values of each Unicode symbol in the string. While [JavaScript uses UCS-2 internally](https://mathiasbynens.be/notes/javascript-encoding), this function will convert a pair of surrogate halves (each of which UCS-2 exposes as separate characters) into a single code point, matching UTF-16.
+
+```js
+punycode.ucs2.decode('abc');
+// → [0x61, 0x62, 0x63]
+// surrogate pair for U+1D306 TETRAGRAM FOR CENTRE:
+punycode.ucs2.decode('\uD834\uDF06');
+// → [0x1D306]
+```
+
+#### `punycode.ucs2.encode(codePoints)`
+
+Creates a string based on an array of numeric code point values.
+
+```js
+punycode.ucs2.encode([0x61, 0x62, 0x63]);
+// → 'abc'
+punycode.ucs2.encode([0x1D306]);
+// → '\uD834\uDF06'
+```
+
+### `punycode.version`
+
+A string representing the current Punycode.js version number.
+
+## Author
+
+| [![twitter/mathias](https://gravatar.com/avatar/24e08a9ea84deb17ae121074d0f17125?s=70)](https://twitter.com/mathias "Follow @mathias on Twitter") |
+|---|
+| [Mathias Bynens](https://mathiasbynens.be/) |
+
+## License
+
+Punycode.js is available under the [MIT](https://mths.be/mit) license.
diff --git a/node_modules/mathjs/examples/node_modules/punycode/package.json b/node_modules/mathjs/examples/node_modules/punycode/package.json
new file mode 100644
index 0000000..9202ccf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/punycode/package.json
@@ -0,0 +1,58 @@
+{
+  "name": "punycode",
+  "version": "2.1.1",
+  "description": "A robust Punycode converter that fully complies to RFC 3492 and RFC 5891, and works on nearly all JavaScript platforms.",
+  "homepage": "https://mths.be/punycode",
+  "main": "punycode.js",
+  "jsnext:main": "punycode.es6.js",
+  "module": "punycode.es6.js",
+  "engines": {
+    "node": ">=6"
+  },
+  "keywords": [
+    "punycode",
+    "unicode",
+    "idn",
+    "idna",
+    "dns",
+    "url",
+    "domain"
+  ],
+  "license": "MIT",
+  "author": {
+    "name": "Mathias Bynens",
+    "url": "https://mathiasbynens.be/"
+  },
+  "contributors": [
+    {
+      "name": "Mathias Bynens",
+      "url": "https://mathiasbynens.be/"
+    }
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/bestiejs/punycode.js.git"
+  },
+  "bugs": "https://github.com/bestiejs/punycode.js/issues",
+  "files": [
+    "LICENSE-MIT.txt",
+    "punycode.js",
+    "punycode.es6.js"
+  ],
+  "scripts": {
+    "test": "mocha tests",
+    "prepublish": "node scripts/prepublish.js"
+  },
+  "devDependencies": {
+    "codecov": "^1.0.1",
+    "istanbul": "^0.4.1",
+    "mocha": "^2.5.3"
+  },
+  "jspm": {
+    "map": {
+      "./punycode.js": {
+        "node": "@node/punycode"
+      }
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/punycode/punycode.es6.js b/node_modules/mathjs/examples/node_modules/punycode/punycode.es6.js
new file mode 100644
index 0000000..4610bc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/punycode/punycode.es6.js
@@ -0,0 +1,441 @@
+'use strict';
+
+/** Highest positive signed 32-bit float value */
+const maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1
+
+/** Bootstring parameters */
+const base = 36;
+const tMin = 1;
+const tMax = 26;
+const skew = 38;
+const damp = 700;
+const initialBias = 72;
+const initialN = 128; // 0x80
+const delimiter = '-'; // '\x2D'
+
+/** Regular expressions */
+const regexPunycode = /^xn--/;
+const regexNonASCII = /[^\0-\x7E]/; // non-ASCII chars
+const regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g; // RFC 3490 separators
+
+/** Error messages */
+const errors = {
+	'overflow': 'Overflow: input needs wider integers to process',
+	'not-basic': 'Illegal input >= 0x80 (not a basic code point)',
+	'invalid-input': 'Invalid input'
+};
+
+/** Convenience shortcuts */
+const baseMinusTMin = base - tMin;
+const floor = Math.floor;
+const stringFromCharCode = String.fromCharCode;
+
+/*--------------------------------------------------------------------------*/
+
+/**
+ * A generic error utility function.
+ * @private
+ * @param {String} type The error type.
+ * @returns {Error} Throws a `RangeError` with the applicable error message.
+ */
+function error(type) {
+	throw new RangeError(errors[type]);
+}
+
+/**
+ * A generic `Array#map` utility function.
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} callback The function that gets called for every array
+ * item.
+ * @returns {Array} A new array of values returned by the callback function.
+ */
+function map(array, fn) {
+	const result = [];
+	let length = array.length;
+	while (length--) {
+		result[length] = fn(array[length]);
+	}
+	return result;
+}
+
+/**
+ * A simple `Array#map`-like wrapper to work with domain name strings or email
+ * addresses.
+ * @private
+ * @param {String} domain The domain name or email address.
+ * @param {Function} callback The function that gets called for every
+ * character.
+ * @returns {Array} A new string of characters returned by the callback
+ * function.
+ */
+function mapDomain(string, fn) {
+	const parts = string.split('@');
+	let result = '';
+	if (parts.length > 1) {
+		// In email addresses, only the domain name should be punycoded. Leave
+		// the local part (i.e. everything up to `@`) intact.
+		result = parts[0] + '@';
+		string = parts[1];
+	}
+	// Avoid `split(regex)` for IE8 compatibility. See #17.
+	string = string.replace(regexSeparators, '\x2E');
+	const labels = string.split('.');
+	const encoded = map(labels, fn).join('.');
+	return result + encoded;
+}
+
+/**
+ * Creates an array containing the numeric code points of each Unicode
+ * character in the string. While JavaScript uses UCS-2 internally,
+ * this function will convert a pair of surrogate halves (each of which
+ * UCS-2 exposes as separate characters) into a single code point,
+ * matching UTF-16.
+ * @see `punycode.ucs2.encode`
+ * @see <https://mathiasbynens.be/notes/javascript-encoding>
+ * @memberOf punycode.ucs2
+ * @name decode
+ * @param {String} string The Unicode input string (UCS-2).
+ * @returns {Array} The new array of code points.
+ */
+function ucs2decode(string) {
+	const output = [];
+	let counter = 0;
+	const length = string.length;
+	while (counter < length) {
+		const value = string.charCodeAt(counter++);
+		if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
+			// It's a high surrogate, and there is a next character.
+			const extra = string.charCodeAt(counter++);
+			if ((extra & 0xFC00) == 0xDC00) { // Low surrogate.
+				output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
+			} else {
+				// It's an unmatched surrogate; only append this code unit, in case the
+				// next code unit is the high surrogate of a surrogate pair.
+				output.push(value);
+				counter--;
+			}
+		} else {
+			output.push(value);
+		}
+	}
+	return output;
+}
+
+/**
+ * Creates a string based on an array of numeric code points.
+ * @see `punycode.ucs2.decode`
+ * @memberOf punycode.ucs2
+ * @name encode
+ * @param {Array} codePoints The array of numeric code points.
+ * @returns {String} The new Unicode string (UCS-2).
+ */
+const ucs2encode = array => String.fromCodePoint(...array);
+
+/**
+ * Converts a basic code point into a digit/integer.
+ * @see `digitToBasic()`
+ * @private
+ * @param {Number} codePoint The basic numeric code point value.
+ * @returns {Number} The numeric value of a basic code point (for use in
+ * representing integers) in the range `0` to `base - 1`, or `base` if
+ * the code point does not represent a value.
+ */
+const basicToDigit = function(codePoint) {
+	if (codePoint - 0x30 < 0x0A) {
+		return codePoint - 0x16;
+	}
+	if (codePoint - 0x41 < 0x1A) {
+		return codePoint - 0x41;
+	}
+	if (codePoint - 0x61 < 0x1A) {
+		return codePoint - 0x61;
+	}
+	return base;
+};
+
+/**
+ * Converts a digit/integer into a basic code point.
+ * @see `basicToDigit()`
+ * @private
+ * @param {Number} digit The numeric value of a basic code point.
+ * @returns {Number} The basic code point whose value (when used for
+ * representing integers) is `digit`, which needs to be in the range
+ * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is
+ * used; else, the lowercase form is used. The behavior is undefined
+ * if `flag` is non-zero and `digit` has no uppercase form.
+ */
+const digitToBasic = function(digit, flag) {
+	//  0..25 map to ASCII a..z or A..Z
+	// 26..35 map to ASCII 0..9
+	return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+};
+
+/**
+ * Bias adaptation function as per section 3.4 of RFC 3492.
+ * https://tools.ietf.org/html/rfc3492#section-3.4
+ * @private
+ */
+const adapt = function(delta, numPoints, firstTime) {
+	let k = 0;
+	delta = firstTime ? floor(delta / damp) : delta >> 1;
+	delta += floor(delta / numPoints);
+	for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {
+		delta = floor(delta / baseMinusTMin);
+	}
+	return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
+};
+
+/**
+ * Converts a Punycode string of ASCII-only symbols to a string of Unicode
+ * symbols.
+ * @memberOf punycode
+ * @param {String} input The Punycode string of ASCII-only symbols.
+ * @returns {String} The resulting string of Unicode symbols.
+ */
+const decode = function(input) {
+	// Don't use UCS-2.
+	const output = [];
+	const inputLength = input.length;
+	let i = 0;
+	let n = initialN;
+	let bias = initialBias;
+
+	// Handle the basic code points: let `basic` be the number of input code
+	// points before the last delimiter, or `0` if there is none, then copy
+	// the first basic code points to the output.
+
+	let basic = input.lastIndexOf(delimiter);
+	if (basic < 0) {
+		basic = 0;
+	}
+
+	for (let j = 0; j < basic; ++j) {
+		// if it's not a basic code point
+		if (input.charCodeAt(j) >= 0x80) {
+			error('not-basic');
+		}
+		output.push(input.charCodeAt(j));
+	}
+
+	// Main decoding loop: start just after the last delimiter if any basic code
+	// points were copied; start at the beginning otherwise.
+
+	for (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {
+
+		// `index` is the index of the next character to be consumed.
+		// Decode a generalized variable-length integer into `delta`,
+		// which gets added to `i`. The overflow checking is easier
+		// if we increase `i` as we go, then subtract off its starting
+		// value at the end to obtain `delta`.
+		let oldi = i;
+		for (let w = 1, k = base; /* no condition */; k += base) {
+
+			if (index >= inputLength) {
+				error('invalid-input');
+			}
+
+			const digit = basicToDigit(input.charCodeAt(index++));
+
+			if (digit >= base || digit > floor((maxInt - i) / w)) {
+				error('overflow');
+			}
+
+			i += digit * w;
+			const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
+
+			if (digit < t) {
+				break;
+			}
+
+			const baseMinusT = base - t;
+			if (w > floor(maxInt / baseMinusT)) {
+				error('overflow');
+			}
+
+			w *= baseMinusT;
+
+		}
+
+		const out = output.length + 1;
+		bias = adapt(i - oldi, out, oldi == 0);
+
+		// `i` was supposed to wrap around from `out` to `0`,
+		// incrementing `n` each time, so we'll fix that now:
+		if (floor(i / out) > maxInt - n) {
+			error('overflow');
+		}
+
+		n += floor(i / out);
+		i %= out;
+
+		// Insert `n` at position `i` of the output.
+		output.splice(i++, 0, n);
+
+	}
+
+	return String.fromCodePoint(...output);
+};
+
+/**
+ * Converts a string of Unicode symbols (e.g. a domain name label) to a
+ * Punycode string of ASCII-only symbols.
+ * @memberOf punycode
+ * @param {String} input The string of Unicode symbols.
+ * @returns {String} The resulting Punycode string of ASCII-only symbols.
+ */
+const encode = function(input) {
+	const output = [];
+
+	// Convert the input in UCS-2 to an array of Unicode code points.
+	input = ucs2decode(input);
+
+	// Cache the length.
+	let inputLength = input.length;
+
+	// Initialize the state.
+	let n = initialN;
+	let delta = 0;
+	let bias = initialBias;
+
+	// Handle the basic code points.
+	for (const currentValue of input) {
+		if (currentValue < 0x80) {
+			output.push(stringFromCharCode(currentValue));
+		}
+	}
+
+	let basicLength = output.length;
+	let handledCPCount = basicLength;
+
+	// `handledCPCount` is the number of code points that have been handled;
+	// `basicLength` is the number of basic code points.
+
+	// Finish the basic string with a delimiter unless it's empty.
+	if (basicLength) {
+		output.push(delimiter);
+	}
+
+	// Main encoding loop:
+	while (handledCPCount < inputLength) {
+
+		// All non-basic code points < n have been handled already. Find the next
+		// larger one:
+		let m = maxInt;
+		for (const currentValue of input) {
+			if (currentValue >= n && currentValue < m) {
+				m = currentValue;
+			}
+		}
+
+		// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,
+		// but guard against overflow.
+		const handledCPCountPlusOne = handledCPCount + 1;
+		if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
+			error('overflow');
+		}
+
+		delta += (m - n) * handledCPCountPlusOne;
+		n = m;
+
+		for (const currentValue of input) {
+			if (currentValue < n && ++delta > maxInt) {
+				error('overflow');
+			}
+			if (currentValue == n) {
+				// Represent delta as a generalized variable-length integer.
+				let q = delta;
+				for (let k = base; /* no condition */; k += base) {
+					const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
+					if (q < t) {
+						break;
+					}
+					const qMinusT = q - t;
+					const baseMinusT = base - t;
+					output.push(
+						stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))
+					);
+					q = floor(qMinusT / baseMinusT);
+				}
+
+				output.push(stringFromCharCode(digitToBasic(q, 0)));
+				bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);
+				delta = 0;
+				++handledCPCount;
+			}
+		}
+
+		++delta;
+		++n;
+
+	}
+	return output.join('');
+};
+
+/**
+ * Converts a Punycode string representing a domain name or an email address
+ * to Unicode. Only the Punycoded parts of the input will be converted, i.e.
+ * it doesn't matter if you call it on a string that has already been
+ * converted to Unicode.
+ * @memberOf punycode
+ * @param {String} input The Punycoded domain name or email address to
+ * convert to Unicode.
+ * @returns {String} The Unicode representation of the given Punycode
+ * string.
+ */
+const toUnicode = function(input) {
+	return mapDomain(input, function(string) {
+		return regexPunycode.test(string)
+			? decode(string.slice(4).toLowerCase())
+			: string;
+	});
+};
+
+/**
+ * Converts a Unicode string representing a domain name or an email address to
+ * Punycode. Only the non-ASCII parts of the domain name will be converted,
+ * i.e. it doesn't matter if you call it with a domain that's already in
+ * ASCII.
+ * @memberOf punycode
+ * @param {String} input The domain name or email address to convert, as a
+ * Unicode string.
+ * @returns {String} The Punycode representation of the given domain name or
+ * email address.
+ */
+const toASCII = function(input) {
+	return mapDomain(input, function(string) {
+		return regexNonASCII.test(string)
+			? 'xn--' + encode(string)
+			: string;
+	});
+};
+
+/*--------------------------------------------------------------------------*/
+
+/** Define the public API */
+const punycode = {
+	/**
+	 * A string representing the current Punycode.js version number.
+	 * @memberOf punycode
+	 * @type String
+	 */
+	'version': '2.1.0',
+	/**
+	 * An object of methods to convert from JavaScript's internal character
+	 * representation (UCS-2) to Unicode code points, and back.
+	 * @see <https://mathiasbynens.be/notes/javascript-encoding>
+	 * @memberOf punycode
+	 * @type Object
+	 */
+	'ucs2': {
+		'decode': ucs2decode,
+		'encode': ucs2encode
+	},
+	'decode': decode,
+	'encode': encode,
+	'toASCII': toASCII,
+	'toUnicode': toUnicode
+};
+
+export { ucs2decode, ucs2encode, decode, encode, toASCII, toUnicode };
+export default punycode;
diff --git a/node_modules/mathjs/examples/node_modules/punycode/punycode.js b/node_modules/mathjs/examples/node_modules/punycode/punycode.js
new file mode 100644
index 0000000..ea61fd0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/punycode/punycode.js
@@ -0,0 +1,440 @@
+'use strict';
+
+/** Highest positive signed 32-bit float value */
+const maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1
+
+/** Bootstring parameters */
+const base = 36;
+const tMin = 1;
+const tMax = 26;
+const skew = 38;
+const damp = 700;
+const initialBias = 72;
+const initialN = 128; // 0x80
+const delimiter = '-'; // '\x2D'
+
+/** Regular expressions */
+const regexPunycode = /^xn--/;
+const regexNonASCII = /[^\0-\x7E]/; // non-ASCII chars
+const regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g; // RFC 3490 separators
+
+/** Error messages */
+const errors = {
+	'overflow': 'Overflow: input needs wider integers to process',
+	'not-basic': 'Illegal input >= 0x80 (not a basic code point)',
+	'invalid-input': 'Invalid input'
+};
+
+/** Convenience shortcuts */
+const baseMinusTMin = base - tMin;
+const floor = Math.floor;
+const stringFromCharCode = String.fromCharCode;
+
+/*--------------------------------------------------------------------------*/
+
+/**
+ * A generic error utility function.
+ * @private
+ * @param {String} type The error type.
+ * @returns {Error} Throws a `RangeError` with the applicable error message.
+ */
+function error(type) {
+	throw new RangeError(errors[type]);
+}
+
+/**
+ * A generic `Array#map` utility function.
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} callback The function that gets called for every array
+ * item.
+ * @returns {Array} A new array of values returned by the callback function.
+ */
+function map(array, fn) {
+	const result = [];
+	let length = array.length;
+	while (length--) {
+		result[length] = fn(array[length]);
+	}
+	return result;
+}
+
+/**
+ * A simple `Array#map`-like wrapper to work with domain name strings or email
+ * addresses.
+ * @private
+ * @param {String} domain The domain name or email address.
+ * @param {Function} callback The function that gets called for every
+ * character.
+ * @returns {Array} A new string of characters returned by the callback
+ * function.
+ */
+function mapDomain(string, fn) {
+	const parts = string.split('@');
+	let result = '';
+	if (parts.length > 1) {
+		// In email addresses, only the domain name should be punycoded. Leave
+		// the local part (i.e. everything up to `@`) intact.
+		result = parts[0] + '@';
+		string = parts[1];
+	}
+	// Avoid `split(regex)` for IE8 compatibility. See #17.
+	string = string.replace(regexSeparators, '\x2E');
+	const labels = string.split('.');
+	const encoded = map(labels, fn).join('.');
+	return result + encoded;
+}
+
+/**
+ * Creates an array containing the numeric code points of each Unicode
+ * character in the string. While JavaScript uses UCS-2 internally,
+ * this function will convert a pair of surrogate halves (each of which
+ * UCS-2 exposes as separate characters) into a single code point,
+ * matching UTF-16.
+ * @see `punycode.ucs2.encode`
+ * @see <https://mathiasbynens.be/notes/javascript-encoding>
+ * @memberOf punycode.ucs2
+ * @name decode
+ * @param {String} string The Unicode input string (UCS-2).
+ * @returns {Array} The new array of code points.
+ */
+function ucs2decode(string) {
+	const output = [];
+	let counter = 0;
+	const length = string.length;
+	while (counter < length) {
+		const value = string.charCodeAt(counter++);
+		if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
+			// It's a high surrogate, and there is a next character.
+			const extra = string.charCodeAt(counter++);
+			if ((extra & 0xFC00) == 0xDC00) { // Low surrogate.
+				output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
+			} else {
+				// It's an unmatched surrogate; only append this code unit, in case the
+				// next code unit is the high surrogate of a surrogate pair.
+				output.push(value);
+				counter--;
+			}
+		} else {
+			output.push(value);
+		}
+	}
+	return output;
+}
+
+/**
+ * Creates a string based on an array of numeric code points.
+ * @see `punycode.ucs2.decode`
+ * @memberOf punycode.ucs2
+ * @name encode
+ * @param {Array} codePoints The array of numeric code points.
+ * @returns {String} The new Unicode string (UCS-2).
+ */
+const ucs2encode = array => String.fromCodePoint(...array);
+
+/**
+ * Converts a basic code point into a digit/integer.
+ * @see `digitToBasic()`
+ * @private
+ * @param {Number} codePoint The basic numeric code point value.
+ * @returns {Number} The numeric value of a basic code point (for use in
+ * representing integers) in the range `0` to `base - 1`, or `base` if
+ * the code point does not represent a value.
+ */
+const basicToDigit = function(codePoint) {
+	if (codePoint - 0x30 < 0x0A) {
+		return codePoint - 0x16;
+	}
+	if (codePoint - 0x41 < 0x1A) {
+		return codePoint - 0x41;
+	}
+	if (codePoint - 0x61 < 0x1A) {
+		return codePoint - 0x61;
+	}
+	return base;
+};
+
+/**
+ * Converts a digit/integer into a basic code point.
+ * @see `basicToDigit()`
+ * @private
+ * @param {Number} digit The numeric value of a basic code point.
+ * @returns {Number} The basic code point whose value (when used for
+ * representing integers) is `digit`, which needs to be in the range
+ * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is
+ * used; else, the lowercase form is used. The behavior is undefined
+ * if `flag` is non-zero and `digit` has no uppercase form.
+ */
+const digitToBasic = function(digit, flag) {
+	//  0..25 map to ASCII a..z or A..Z
+	// 26..35 map to ASCII 0..9
+	return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+};
+
+/**
+ * Bias adaptation function as per section 3.4 of RFC 3492.
+ * https://tools.ietf.org/html/rfc3492#section-3.4
+ * @private
+ */
+const adapt = function(delta, numPoints, firstTime) {
+	let k = 0;
+	delta = firstTime ? floor(delta / damp) : delta >> 1;
+	delta += floor(delta / numPoints);
+	for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {
+		delta = floor(delta / baseMinusTMin);
+	}
+	return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
+};
+
+/**
+ * Converts a Punycode string of ASCII-only symbols to a string of Unicode
+ * symbols.
+ * @memberOf punycode
+ * @param {String} input The Punycode string of ASCII-only symbols.
+ * @returns {String} The resulting string of Unicode symbols.
+ */
+const decode = function(input) {
+	// Don't use UCS-2.
+	const output = [];
+	const inputLength = input.length;
+	let i = 0;
+	let n = initialN;
+	let bias = initialBias;
+
+	// Handle the basic code points: let `basic` be the number of input code
+	// points before the last delimiter, or `0` if there is none, then copy
+	// the first basic code points to the output.
+
+	let basic = input.lastIndexOf(delimiter);
+	if (basic < 0) {
+		basic = 0;
+	}
+
+	for (let j = 0; j < basic; ++j) {
+		// if it's not a basic code point
+		if (input.charCodeAt(j) >= 0x80) {
+			error('not-basic');
+		}
+		output.push(input.charCodeAt(j));
+	}
+
+	// Main decoding loop: start just after the last delimiter if any basic code
+	// points were copied; start at the beginning otherwise.
+
+	for (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {
+
+		// `index` is the index of the next character to be consumed.
+		// Decode a generalized variable-length integer into `delta`,
+		// which gets added to `i`. The overflow checking is easier
+		// if we increase `i` as we go, then subtract off its starting
+		// value at the end to obtain `delta`.
+		let oldi = i;
+		for (let w = 1, k = base; /* no condition */; k += base) {
+
+			if (index >= inputLength) {
+				error('invalid-input');
+			}
+
+			const digit = basicToDigit(input.charCodeAt(index++));
+
+			if (digit >= base || digit > floor((maxInt - i) / w)) {
+				error('overflow');
+			}
+
+			i += digit * w;
+			const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
+
+			if (digit < t) {
+				break;
+			}
+
+			const baseMinusT = base - t;
+			if (w > floor(maxInt / baseMinusT)) {
+				error('overflow');
+			}
+
+			w *= baseMinusT;
+
+		}
+
+		const out = output.length + 1;
+		bias = adapt(i - oldi, out, oldi == 0);
+
+		// `i` was supposed to wrap around from `out` to `0`,
+		// incrementing `n` each time, so we'll fix that now:
+		if (floor(i / out) > maxInt - n) {
+			error('overflow');
+		}
+
+		n += floor(i / out);
+		i %= out;
+
+		// Insert `n` at position `i` of the output.
+		output.splice(i++, 0, n);
+
+	}
+
+	return String.fromCodePoint(...output);
+};
+
+/**
+ * Converts a string of Unicode symbols (e.g. a domain name label) to a
+ * Punycode string of ASCII-only symbols.
+ * @memberOf punycode
+ * @param {String} input The string of Unicode symbols.
+ * @returns {String} The resulting Punycode string of ASCII-only symbols.
+ */
+const encode = function(input) {
+	const output = [];
+
+	// Convert the input in UCS-2 to an array of Unicode code points.
+	input = ucs2decode(input);
+
+	// Cache the length.
+	let inputLength = input.length;
+
+	// Initialize the state.
+	let n = initialN;
+	let delta = 0;
+	let bias = initialBias;
+
+	// Handle the basic code points.
+	for (const currentValue of input) {
+		if (currentValue < 0x80) {
+			output.push(stringFromCharCode(currentValue));
+		}
+	}
+
+	let basicLength = output.length;
+	let handledCPCount = basicLength;
+
+	// `handledCPCount` is the number of code points that have been handled;
+	// `basicLength` is the number of basic code points.
+
+	// Finish the basic string with a delimiter unless it's empty.
+	if (basicLength) {
+		output.push(delimiter);
+	}
+
+	// Main encoding loop:
+	while (handledCPCount < inputLength) {
+
+		// All non-basic code points < n have been handled already. Find the next
+		// larger one:
+		let m = maxInt;
+		for (const currentValue of input) {
+			if (currentValue >= n && currentValue < m) {
+				m = currentValue;
+			}
+		}
+
+		// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,
+		// but guard against overflow.
+		const handledCPCountPlusOne = handledCPCount + 1;
+		if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
+			error('overflow');
+		}
+
+		delta += (m - n) * handledCPCountPlusOne;
+		n = m;
+
+		for (const currentValue of input) {
+			if (currentValue < n && ++delta > maxInt) {
+				error('overflow');
+			}
+			if (currentValue == n) {
+				// Represent delta as a generalized variable-length integer.
+				let q = delta;
+				for (let k = base; /* no condition */; k += base) {
+					const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
+					if (q < t) {
+						break;
+					}
+					const qMinusT = q - t;
+					const baseMinusT = base - t;
+					output.push(
+						stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))
+					);
+					q = floor(qMinusT / baseMinusT);
+				}
+
+				output.push(stringFromCharCode(digitToBasic(q, 0)));
+				bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);
+				delta = 0;
+				++handledCPCount;
+			}
+		}
+
+		++delta;
+		++n;
+
+	}
+	return output.join('');
+};
+
+/**
+ * Converts a Punycode string representing a domain name or an email address
+ * to Unicode. Only the Punycoded parts of the input will be converted, i.e.
+ * it doesn't matter if you call it on a string that has already been
+ * converted to Unicode.
+ * @memberOf punycode
+ * @param {String} input The Punycoded domain name or email address to
+ * convert to Unicode.
+ * @returns {String} The Unicode representation of the given Punycode
+ * string.
+ */
+const toUnicode = function(input) {
+	return mapDomain(input, function(string) {
+		return regexPunycode.test(string)
+			? decode(string.slice(4).toLowerCase())
+			: string;
+	});
+};
+
+/**
+ * Converts a Unicode string representing a domain name or an email address to
+ * Punycode. Only the non-ASCII parts of the domain name will be converted,
+ * i.e. it doesn't matter if you call it with a domain that's already in
+ * ASCII.
+ * @memberOf punycode
+ * @param {String} input The domain name or email address to convert, as a
+ * Unicode string.
+ * @returns {String} The Punycode representation of the given domain name or
+ * email address.
+ */
+const toASCII = function(input) {
+	return mapDomain(input, function(string) {
+		return regexNonASCII.test(string)
+			? 'xn--' + encode(string)
+			: string;
+	});
+};
+
+/*--------------------------------------------------------------------------*/
+
+/** Define the public API */
+const punycode = {
+	/**
+	 * A string representing the current Punycode.js version number.
+	 * @memberOf punycode
+	 * @type String
+	 */
+	'version': '2.1.0',
+	/**
+	 * An object of methods to convert from JavaScript's internal character
+	 * representation (UCS-2) to Unicode code points, and back.
+	 * @see <https://mathiasbynens.be/notes/javascript-encoding>
+	 * @memberOf punycode
+	 * @type Object
+	 */
+	'ucs2': {
+		'decode': ucs2decode,
+		'encode': ucs2encode
+	},
+	'decode': decode,
+	'encode': encode,
+	'toASCII': toASCII,
+	'toUnicode': toUnicode
+};
+
+module.exports = punycode;
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/.travis.yml b/node_modules/mathjs/examples/node_modules/randombytes/.travis.yml
new file mode 100644
index 0000000..69fdf71
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/.travis.yml
@@ -0,0 +1,15 @@
+sudo: false
+language: node_js
+matrix:
+  include:
+    - node_js: '7'
+      env: TEST_SUITE=test
+    - node_js: '6'
+      env: TEST_SUITE=test
+    - node_js: '5'
+      env: TEST_SUITE=test
+    - node_js: '4'
+      env: TEST_SUITE=test
+    - node_js: '4'
+      env: TEST_SUITE=phantom
+script: "npm run-script $TEST_SUITE"
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/.zuul.yml b/node_modules/mathjs/examples/node_modules/randombytes/.zuul.yml
new file mode 100644
index 0000000..96d9cfb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/.zuul.yml
@@ -0,0 +1 @@
+ui: tape
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/LICENSE b/node_modules/mathjs/examples/node_modules/randombytes/LICENSE
new file mode 100644
index 0000000..fea9d48
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 crypto-browserify
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/README.md b/node_modules/mathjs/examples/node_modules/randombytes/README.md
new file mode 100644
index 0000000..3bacba4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/README.md
@@ -0,0 +1,14 @@
+randombytes
+===
+
+[![Version](http://img.shields.io/npm/v/randombytes.svg)](https://www.npmjs.org/package/randombytes) [![Build Status](https://travis-ci.org/crypto-browserify/randombytes.svg?branch=master)](https://travis-ci.org/crypto-browserify/randombytes)
+
+randombytes from node that works in the browser.  In node you just get crypto.randomBytes, but in the browser it uses .crypto/msCrypto.getRandomValues
+
+```js
+var randomBytes = require('randombytes');
+randomBytes(16);//get 16 random bytes
+randomBytes(16, function (err, resp) {
+  // resp is 16 random bytes
+});
+```
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/browser.js b/node_modules/mathjs/examples/node_modules/randombytes/browser.js
new file mode 100644
index 0000000..0fb0b71
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/browser.js
@@ -0,0 +1,50 @@
+'use strict'
+
+// limit of Crypto.getRandomValues()
+// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues
+var MAX_BYTES = 65536
+
+// Node supports requesting up to this number of bytes
+// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48
+var MAX_UINT32 = 4294967295
+
+function oldBrowser () {
+  throw new Error('Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11')
+}
+
+var Buffer = require('safe-buffer').Buffer
+var crypto = global.crypto || global.msCrypto
+
+if (crypto && crypto.getRandomValues) {
+  module.exports = randomBytes
+} else {
+  module.exports = oldBrowser
+}
+
+function randomBytes (size, cb) {
+  // phantomjs needs to throw
+  if (size > MAX_UINT32) throw new RangeError('requested too many random bytes')
+
+  var bytes = Buffer.allocUnsafe(size)
+
+  if (size > 0) {  // getRandomValues fails on IE if size == 0
+    if (size > MAX_BYTES) { // this is the max bytes crypto.getRandomValues
+      // can do at once see https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues
+      for (var generated = 0; generated < size; generated += MAX_BYTES) {
+        // buffer.slice automatically checks if the end is past the end of
+        // the buffer so we don't have to here
+        crypto.getRandomValues(bytes.slice(generated, generated + MAX_BYTES))
+      }
+    } else {
+      crypto.getRandomValues(bytes)
+    }
+  }
+
+  if (typeof cb === 'function') {
+    return process.nextTick(function () {
+      cb(null, bytes)
+    })
+  }
+
+  return bytes
+}
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/index.js b/node_modules/mathjs/examples/node_modules/randombytes/index.js
new file mode 100644
index 0000000..a2d9e39
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/index.js
@@ -0,0 +1 @@
+module.exports = require('crypto').randomBytes
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/package.json b/node_modules/mathjs/examples/node_modules/randombytes/package.json
new file mode 100644
index 0000000..3623652
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/package.json
@@ -0,0 +1,36 @@
+{
+  "name": "randombytes",
+  "version": "2.1.0",
+  "description": "random bytes from browserify stand alone",
+  "main": "index.js",
+  "scripts": {
+    "test": "standard && node test.js | tspec",
+    "phantom": "zuul --phantom -- test.js",
+    "local": "zuul --local --no-coverage -- test.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git@github.com:crypto-browserify/randombytes.git"
+  },
+  "keywords": [
+    "crypto",
+    "random"
+  ],
+  "author": "",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/crypto-browserify/randombytes/issues"
+  },
+  "homepage": "https://github.com/crypto-browserify/randombytes",
+  "browser": "browser.js",
+  "devDependencies": {
+    "phantomjs": "^1.9.9",
+    "standard": "^10.0.2",
+    "tap-spec": "^2.1.2",
+    "tape": "^4.6.3",
+    "zuul": "^3.7.2"
+  },
+  "dependencies": {
+    "safe-buffer": "^5.1.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/randombytes/test.js b/node_modules/mathjs/examples/node_modules/randombytes/test.js
new file mode 100644
index 0000000..f266976
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/randombytes/test.js
@@ -0,0 +1,81 @@
+var test = require('tape')
+var randomBytes = require('./')
+var MAX_BYTES = 65536
+var MAX_UINT32 = 4294967295
+
+test('sync', function (t) {
+  t.plan(9)
+  t.equals(randomBytes(0).length, 0, 'len: ' + 0)
+  t.equals(randomBytes(3).length, 3, 'len: ' + 3)
+  t.equals(randomBytes(30).length, 30, 'len: ' + 30)
+  t.equals(randomBytes(300).length, 300, 'len: ' + 300)
+  t.equals(randomBytes(17 + MAX_BYTES).length, 17 + MAX_BYTES, 'len: ' + 17 + MAX_BYTES)
+  t.equals(randomBytes(MAX_BYTES * 100).length, MAX_BYTES * 100, 'len: ' + MAX_BYTES * 100)
+  t.throws(function () {
+    randomBytes(MAX_UINT32 + 1)
+  })
+  t.throws(function () {
+    t.equals(randomBytes(-1))
+  })
+  t.throws(function () {
+    t.equals(randomBytes('hello'))
+  })
+})
+
+test('async', function (t) {
+  t.plan(9)
+
+  randomBytes(0, function (err, resp) {
+    if (err) throw err
+
+    t.equals(resp.length, 0, 'len: ' + 0)
+  })
+
+  randomBytes(3, function (err, resp) {
+    if (err) throw err
+
+    t.equals(resp.length, 3, 'len: ' + 3)
+  })
+
+  randomBytes(30, function (err, resp) {
+    if (err) throw err
+
+    t.equals(resp.length, 30, 'len: ' + 30)
+  })
+
+  randomBytes(300, function (err, resp) {
+    if (err) throw err
+
+    t.equals(resp.length, 300, 'len: ' + 300)
+  })
+
+  randomBytes(17 + MAX_BYTES, function (err, resp) {
+    if (err) throw err
+
+    t.equals(resp.length, 17 + MAX_BYTES, 'len: ' + 17 + MAX_BYTES)
+  })
+
+  randomBytes(MAX_BYTES * 100, function (err, resp) {
+    if (err) throw err
+
+    t.equals(resp.length, MAX_BYTES * 100, 'len: ' + MAX_BYTES * 100)
+  })
+
+  t.throws(function () {
+    randomBytes(MAX_UINT32 + 1, function () {
+      t.ok(false, 'should not get here')
+    })
+  })
+
+  t.throws(function () {
+    randomBytes(-1, function () {
+      t.ok(false, 'should not get here')
+    })
+  })
+
+  t.throws(function () {
+    randomBytes('hello', function () {
+      t.ok(false, 'should not get here')
+    })
+  })
+})
diff --git a/node_modules/mathjs/examples/node_modules/rechoir/LICENSE b/node_modules/mathjs/examples/node_modules/rechoir/LICENSE
new file mode 100644
index 0000000..41ed300
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/rechoir/LICENSE
@@ -0,0 +1,24 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2019 Tyler Kellen <tyler@sleekcode.net>, Blaine Bublitz <blaine.bublitz@gmail.com>, and Eric Schoffstall <yo@contra.io>
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/rechoir/README.md b/node_modules/mathjs/examples/node_modules/rechoir/README.md
new file mode 100644
index 0000000..cf96e4f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/rechoir/README.md
@@ -0,0 +1,83 @@
+<p align="center">
+  <a href="http://gulpjs.com">
+    <img height="257" width="114" src="https://raw.githubusercontent.com/gulpjs/artwork/master/gulp-2x.png">
+  </a>
+</p>
+
+# rechoir
+
+[![NPM version][npm-image]][npm-url] [![Downloads][downloads-image]][npm-url] [![Travis Build Status][travis-image]][travis-url] [![AppVeyor Build Status][appveyor-image]][appveyor-url] [![Coveralls Status][coveralls-image]][coveralls-url] [![Gitter chat][gitter-image]][gitter-url]
+
+Prepare a node environment to require files with different extensions.
+
+## What is it?
+
+This module, in conjunction with [interpret]-like objects, can register any filetype the npm ecosystem has a module loader for. This library is a dependency of [Liftoff].
+
+**Note:** While `rechoir` will automatically load and register transpilers like `coffee-script`, you must provide a local installation. The transpilers are **not** bundled with this module.
+
+
+## rechoir for enterprise
+
+Available as part of the Tidelift Subscription
+
+The maintainers of rechoir and thousands of other packages are working with Tidelift to deliver commercial support and maintenance for the open source dependencies you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact dependencies you use. [Learn more.](https://tidelift.com/subscription/pkg/npm-rechoir?utm_source=npm-rechoir&utm_medium=referral&utm_campaign=enterprise&utm_term=repo)
+
+
+## Usage
+
+```js
+const config = require('interpret').extensions;
+const rechoir = require('rechoir');
+rechoir.prepare(config, './test/fixtures/test.coffee');
+rechoir.prepare(config, './test/fixtures/test.csv');
+rechoir.prepare(config, './test/fixtures/test.toml');
+
+console.log(require('./test/fixtures/test.coffee'));
+console.log(require('./test/fixtures/test.csv'));
+console.log(require('./test/fixtures/test.toml'));
+```
+
+## API
+
+### `prepare(config, filepath, [cwd], [noThrow])`
+
+Look for a module loader associated with the provided file and attempt require it.  If necessary, run any setup required to inject it into [require.extensions](http://nodejs.org/api/globals.html#globals_require_extensions).
+
+`config` An [interpret]-like configuration object.
+
+`filepath` A file whose type you'd like to register a module loader for.
+
+`cwd` An optional path to start searching for the module required to load the requested file.  Defaults to the directory of `filepath`.
+
+`noThrow` An optional boolean indicating if the method should avoid throwing.
+
+If calling this method is successful (e.g. it doesn't throw), you can now require files of the type you requested natively.
+
+An error with a `failures` property will be thrown if the module loader(s) configured for a given extension cannot be registered.
+
+If a loader is already registered, this will simply return `true`.
+
+## License
+
+MIT
+
+[interpret]: http://github.com/gulpjs/interpret
+[Liftoff]: http://github.com/gulpjs/liftoff
+
+[downloads-image]: http://img.shields.io/npm/dm/rechoir.svg
+[npm-url]: https://www.npmjs.com/package/rechoir
+[npm-image]: http://img.shields.io/npm/v/rechoir.svg
+
+[travis-url]: https://travis-ci.org/gulpjs/rechoir
+[travis-image]: http://img.shields.io/travis/gulpjs/rechoir.svg?label=travis-ci
+
+[appveyor-url]: https://ci.appveyor.com/project/gulpjs/rechoir
+[appveyor-image]: https://img.shields.io/appveyor/ci/gulpjs/rechoir.svg?label=appveyor
+
+[coveralls-url]: https://coveralls.io/r/gulpjs/rechoir
+[coveralls-image]: http://img.shields.io/coveralls/gulpjs/rechoir/master.svg
+
+[gitter-url]: https://gitter.im/gulpjs/gulp
+[gitter-image]: https://badges.gitter.im/gulpjs/gulp.svg
+
diff --git a/node_modules/mathjs/examples/node_modules/rechoir/index.js b/node_modules/mathjs/examples/node_modules/rechoir/index.js
new file mode 100644
index 0000000..eb9ec70
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/rechoir/index.js
@@ -0,0 +1,67 @@
+var path = require('path');
+
+var extension = require('./lib/extension');
+var normalize = require('./lib/normalize');
+var register = require('./lib/register');
+
+exports.prepare = function(extensions, filepath, cwd, nothrow) {
+  var config, usedExtension, err, option, attempt, error;
+  var attempts = [];
+  var onlyErrors = true;
+  var exts = extension(filepath);
+
+  if (exts) {
+    exts.some(function(ext) {
+      usedExtension = ext;
+      config = normalize(extensions[ext]);
+      return !!config;
+    });
+  }
+
+  if (Object.keys(require.extensions).indexOf(usedExtension) !== -1) {
+    return true;
+  }
+
+  if (!config) {
+    if (nothrow) {
+      return;
+    }
+
+    throw new Error('No module loader found for "' + usedExtension + '".');
+  }
+
+  if (!cwd) {
+    cwd = path.dirname(path.resolve(filepath));
+  }
+  if (!Array.isArray(config)) {
+    config = [config];
+  }
+
+  for (var i in config) {
+    option = config[i];
+    attempt = register(cwd, option.module, option.register);
+    error = (attempt instanceof Error) ? attempt : null;
+    if (error) {
+      attempt = null;
+    }
+    attempts.push({
+      moduleName: option.module,
+      module: attempt,
+      error: error,
+    });
+    if (!error) {
+      onlyErrors = false;
+      break;
+    }
+  }
+  if (onlyErrors) {
+    err = new Error('Unable to use specified module loaders for "' + usedExtension + '".');
+    err.failures = attempts;
+    if (nothrow) {
+      return err;
+    }
+
+    throw err;
+  }
+  return attempts;
+};
diff --git a/node_modules/mathjs/examples/node_modules/rechoir/lib/extension.js b/node_modules/mathjs/examples/node_modules/rechoir/lib/extension.js
new file mode 100644
index 0000000..cc8070d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/rechoir/lib/extension.js
@@ -0,0 +1,44 @@
+'use strict';
+
+var path = require('path');
+
+function getLongExtension(basename) {
+  if (basename[basename.length - 1] === '.') {
+    return null;
+  }
+
+  var startIndex = (basename[0] === '.') ? 1 : 0;
+
+  var dotIndex = basename.indexOf('.', startIndex);
+  if (dotIndex <= startIndex) {
+    return null;
+  }
+
+  return basename.slice(dotIndex);
+}
+
+function getPossibleExtensions(longExtension) {
+  var arr = [longExtension];
+  var len = longExtension.length;
+  var startIndex = 1;
+
+  while (startIndex < len) {
+    var dotIndex = longExtension.indexOf('.', startIndex);
+    if (dotIndex < 0) {
+      break;
+    }
+    arr.push(longExtension.slice(dotIndex));
+    startIndex = dotIndex + 1;
+  }
+
+  return arr;
+}
+
+module.exports = function(input) {
+  var basename = path.basename(input);
+  var longExtension = getLongExtension(basename);
+  if (!longExtension) {
+    return;
+  }
+  return getPossibleExtensions(longExtension);
+};
diff --git a/node_modules/mathjs/examples/node_modules/rechoir/lib/normalize.js b/node_modules/mathjs/examples/node_modules/rechoir/lib/normalize.js
new file mode 100644
index 0000000..7e974f6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/rechoir/lib/normalize.js
@@ -0,0 +1,13 @@
+function normalizer(config) {
+  if (typeof config === 'string') {
+    return { module: config };
+  }
+  return config;
+}
+
+module.exports = function(config) {
+  if (Array.isArray(config)) {
+    return config.map(normalizer);
+  }
+  return normalizer(config);
+};
diff --git a/node_modules/mathjs/examples/node_modules/rechoir/lib/register.js b/node_modules/mathjs/examples/node_modules/rechoir/lib/register.js
new file mode 100644
index 0000000..f5d2336
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/rechoir/lib/register.js
@@ -0,0 +1,15 @@
+var resolve = require('resolve');
+
+module.exports = function(cwd, moduleName, register) {
+  var result;
+  try {
+    var modulePath = resolve.sync(moduleName, { basedir: cwd });
+    result = require(modulePath);
+    if (typeof register === 'function') {
+      register(result);
+    }
+  } catch (e) {
+    result = e;
+  }
+  return result;
+};
diff --git a/node_modules/mathjs/examples/node_modules/rechoir/package.json b/node_modules/mathjs/examples/node_modules/rechoir/package.json
new file mode 100644
index 0000000..00d125c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/rechoir/package.json
@@ -0,0 +1,46 @@
+{
+  "name": "rechoir",
+  "version": "0.7.1",
+  "description": "Prepare a node environment to require files with different extensions.",
+  "author": "Gulp Team <team@gulpjs.com> (http://gulpjs.com/)",
+  "contributors": [
+    "Blaine Bublitz <blaine.bublitz@gmail.com>",
+    "Tyler Kellen <tyler@sleekcode.net> (http://goingslowly.com/)"
+  ],
+  "repository": "gulpjs/rechoir",
+  "license": "MIT",
+  "engines": {
+    "node": ">= 0.10"
+  },
+  "main": "index.js",
+  "files": [
+    "LICENSE",
+    "index.js",
+    "lib/"
+  ],
+  "scripts": {
+    "lint": "eslint .",
+    "pretest": "rm -rf tmp/ && npm run lint",
+    "test": "mocha --async-only test test/lib",
+    "cover": "istanbul cover _mocha --report lcovonly test test/lib",
+    "coveralls": "npm run cover && istanbul-coveralls"
+  },
+  "dependencies": {
+    "resolve": "^1.9.0"
+  },
+  "devDependencies": {
+    "eslint": "^2.13.0",
+    "eslint-config-gulp": "^3.0.1",
+    "expect": "^1.20.2",
+    "istanbul": "^0.4.3",
+    "istanbul-coveralls": "^1.0.3",
+    "mocha": "^3.5.3"
+  },
+  "keywords": [
+    "require",
+    "loader",
+    "extension",
+    "extensions",
+    "prepare"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve-cwd/index.d.ts b/node_modules/mathjs/examples/node_modules/resolve-cwd/index.d.ts
new file mode 100644
index 0000000..4cc6003
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-cwd/index.d.ts
@@ -0,0 +1,48 @@
+declare const resolveCwd: {
+	/**
+	Resolve the path of a module like [`require.resolve()`](https://nodejs.org/api/globals.html#globals_require_resolve) but from the current working directory.
+
+	@param moduleId - What you would use in `require()`.
+	@returns The resolved module path.
+	@throws When the module can't be found.
+
+	@example
+	```
+	import resolveCwd = require('resolve-cwd');
+
+	console.log(__dirname);
+	//=> '/Users/sindresorhus/rainbow'
+
+	console.log(process.cwd());
+	//=> '/Users/sindresorhus/unicorn'
+
+	console.log(resolveCwd('./foo'));
+	//=> '/Users/sindresorhus/unicorn/foo.js'
+	```
+	*/
+	(moduleId: string): string;
+
+	/**
+	Resolve the path of a module like [`require.resolve()`](https://nodejs.org/api/globals.html#globals_require_resolve) but from the current working directory.
+
+	@param moduleId - What you would use in `require()`.
+	@returns The resolved module path. Returns `undefined` instead of throwing when the module can't be found.
+
+	@example
+	```
+	import resolveCwd = require('resolve-cwd');
+
+	console.log(__dirname);
+	//=> '/Users/sindresorhus/rainbow'
+
+	console.log(process.cwd());
+	//=> '/Users/sindresorhus/unicorn'
+
+	console.log(resolveCwd.silent('./foo'));
+	//=> '/Users/sindresorhus/unicorn/foo.js'
+	```
+	*/
+	silent(moduleId: string): string | undefined;
+};
+
+export = resolveCwd;
diff --git a/node_modules/mathjs/examples/node_modules/resolve-cwd/index.js b/node_modules/mathjs/examples/node_modules/resolve-cwd/index.js
new file mode 100644
index 0000000..82dd33c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-cwd/index.js
@@ -0,0 +1,5 @@
+'use strict';
+const resolveFrom = require('resolve-from');
+
+module.exports = moduleId => resolveFrom(process.cwd(), moduleId);
+module.exports.silent = moduleId => resolveFrom.silent(process.cwd(), moduleId);
diff --git a/node_modules/mathjs/examples/node_modules/resolve-cwd/license b/node_modules/mathjs/examples/node_modules/resolve-cwd/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-cwd/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/resolve-cwd/package.json b/node_modules/mathjs/examples/node_modules/resolve-cwd/package.json
new file mode 100644
index 0000000..70dface
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-cwd/package.json
@@ -0,0 +1,43 @@
+{
+	"name": "resolve-cwd",
+	"version": "3.0.0",
+	"description": "Resolve the path of a module like `require.resolve()` but from the current working directory",
+	"license": "MIT",
+	"repository": "sindresorhus/resolve-cwd",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"require",
+		"resolve",
+		"path",
+		"module",
+		"from",
+		"like",
+		"cwd",
+		"current",
+		"working",
+		"directory",
+		"import"
+	],
+	"dependencies": {
+		"resolve-from": "^5.0.0"
+	},
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve-cwd/readme.md b/node_modules/mathjs/examples/node_modules/resolve-cwd/readme.md
new file mode 100644
index 0000000..d9f3129
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-cwd/readme.md
@@ -0,0 +1,58 @@
+# resolve-cwd [![Build Status](https://travis-ci.org/sindresorhus/resolve-cwd.svg?branch=master)](https://travis-ci.org/sindresorhus/resolve-cwd)
+
+> Resolve the path of a module like [`require.resolve()`](https://nodejs.org/api/globals.html#globals_require_resolve) but from the current working directory
+
+
+## Install
+
+```
+$ npm install resolve-cwd
+```
+
+
+## Usage
+
+```js
+const resolveCwd = require('resolve-cwd');
+
+console.log(__dirname);
+//=> '/Users/sindresorhus/rainbow'
+
+console.log(process.cwd());
+//=> '/Users/sindresorhus/unicorn'
+
+console.log(resolveCwd('./foo'));
+//=> '/Users/sindresorhus/unicorn/foo.js'
+```
+
+
+## API
+
+### resolveCwd(moduleId)
+
+Like `require()`, throws when the module can't be found.
+
+### resolveCwd.silent(moduleId)
+
+Returns `undefined` instead of throwing when the module can't be found.
+
+#### moduleId
+
+Type: `string`
+
+What you would use in `require()`.
+
+
+## Related
+
+- [resolve-from](https://github.com/sindresorhus/resolve-from) - Resolve the path of a module from a given path
+- [import-from](https://github.com/sindresorhus/import-from) - Import a module from a given path
+- [import-cwd](https://github.com/sindresorhus/import-cwd) - Import a module from the current working directory
+- [resolve-pkg](https://github.com/sindresorhus/resolve-pkg) - Resolve the path of a package regardless of it having an entry point
+- [import-lazy](https://github.com/sindresorhus/import-lazy) - Import a module lazily
+- [resolve-global](https://github.com/sindresorhus/resolve-global) - Resolve the path of a globally installed module
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/resolve-from/index.d.ts b/node_modules/mathjs/examples/node_modules/resolve-from/index.d.ts
new file mode 100644
index 0000000..dd5f5ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-from/index.d.ts
@@ -0,0 +1,31 @@
+declare const resolveFrom: {
+	/**
+	Resolve the path of a module like [`require.resolve()`](https://nodejs.org/api/globals.html#globals_require_resolve) but from a given path.
+
+	@param fromDirectory - Directory to resolve from.
+	@param moduleId - What you would use in `require()`.
+	@returns Resolved module path. Throws when the module can't be found.
+
+	@example
+	```
+	import resolveFrom = require('resolve-from');
+
+	// There is a file at `./foo/bar.js`
+
+	resolveFrom('foo', './bar');
+	//=> '/Users/sindresorhus/dev/test/foo/bar.js'
+	```
+	*/
+	(fromDirectory: string, moduleId: string): string;
+
+	/**
+	Resolve the path of a module like [`require.resolve()`](https://nodejs.org/api/globals.html#globals_require_resolve) but from a given path.
+
+	@param fromDirectory - Directory to resolve from.
+	@param moduleId - What you would use in `require()`.
+	@returns Resolved module path or `undefined` when the module can't be found.
+	*/
+	silent(fromDirectory: string, moduleId: string): string | undefined;
+};
+
+export = resolveFrom;
diff --git a/node_modules/mathjs/examples/node_modules/resolve-from/index.js b/node_modules/mathjs/examples/node_modules/resolve-from/index.js
new file mode 100644
index 0000000..44f291c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-from/index.js
@@ -0,0 +1,47 @@
+'use strict';
+const path = require('path');
+const Module = require('module');
+const fs = require('fs');
+
+const resolveFrom = (fromDirectory, moduleId, silent) => {
+	if (typeof fromDirectory !== 'string') {
+		throw new TypeError(`Expected \`fromDir\` to be of type \`string\`, got \`${typeof fromDirectory}\``);
+	}
+
+	if (typeof moduleId !== 'string') {
+		throw new TypeError(`Expected \`moduleId\` to be of type \`string\`, got \`${typeof moduleId}\``);
+	}
+
+	try {
+		fromDirectory = fs.realpathSync(fromDirectory);
+	} catch (error) {
+		if (error.code === 'ENOENT') {
+			fromDirectory = path.resolve(fromDirectory);
+		} else if (silent) {
+			return;
+		} else {
+			throw error;
+		}
+	}
+
+	const fromFile = path.join(fromDirectory, 'noop.js');
+
+	const resolveFileName = () => Module._resolveFilename(moduleId, {
+		id: fromFile,
+		filename: fromFile,
+		paths: Module._nodeModulePaths(fromDirectory)
+	});
+
+	if (silent) {
+		try {
+			return resolveFileName();
+		} catch (error) {
+			return;
+		}
+	}
+
+	return resolveFileName();
+};
+
+module.exports = (fromDirectory, moduleId) => resolveFrom(fromDirectory, moduleId);
+module.exports.silent = (fromDirectory, moduleId) => resolveFrom(fromDirectory, moduleId, true);
diff --git a/node_modules/mathjs/examples/node_modules/resolve-from/license b/node_modules/mathjs/examples/node_modules/resolve-from/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-from/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/resolve-from/package.json b/node_modules/mathjs/examples/node_modules/resolve-from/package.json
new file mode 100644
index 0000000..733df16
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-from/package.json
@@ -0,0 +1,36 @@
+{
+	"name": "resolve-from",
+	"version": "5.0.0",
+	"description": "Resolve the path of a module like `require.resolve()` but from a given path",
+	"license": "MIT",
+	"repository": "sindresorhus/resolve-from",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"require",
+		"resolve",
+		"path",
+		"module",
+		"from",
+		"like",
+		"import"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve-from/readme.md b/node_modules/mathjs/examples/node_modules/resolve-from/readme.md
new file mode 100644
index 0000000..fd4f46f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve-from/readme.md
@@ -0,0 +1,72 @@
+# resolve-from [![Build Status](https://travis-ci.org/sindresorhus/resolve-from.svg?branch=master)](https://travis-ci.org/sindresorhus/resolve-from)
+
+> Resolve the path of a module like [`require.resolve()`](https://nodejs.org/api/globals.html#globals_require_resolve) but from a given path
+
+
+## Install
+
+```
+$ npm install resolve-from
+```
+
+
+## Usage
+
+```js
+const resolveFrom = require('resolve-from');
+
+// There is a file at `./foo/bar.js`
+
+resolveFrom('foo', './bar');
+//=> '/Users/sindresorhus/dev/test/foo/bar.js'
+```
+
+
+## API
+
+### resolveFrom(fromDirectory, moduleId)
+
+Like `require()`, throws when the module can't be found.
+
+### resolveFrom.silent(fromDirectory, moduleId)
+
+Returns `undefined` instead of throwing when the module can't be found.
+
+#### fromDirectory
+
+Type: `string`
+
+Directory to resolve from.
+
+#### moduleId
+
+Type: `string`
+
+What you would use in `require()`.
+
+
+## Tip
+
+Create a partial using a bound function if you want to resolve from the same `fromDirectory` multiple times:
+
+```js
+const resolveFromFoo = resolveFrom.bind(null, 'foo');
+
+resolveFromFoo('./bar');
+resolveFromFoo('./baz');
+```
+
+
+## Related
+
+- [resolve-cwd](https://github.com/sindresorhus/resolve-cwd) - Resolve the path of a module from the current working directory
+- [import-from](https://github.com/sindresorhus/import-from) - Import a module from a given path
+- [import-cwd](https://github.com/sindresorhus/import-cwd) - Import a module from the current working directory
+- [resolve-pkg](https://github.com/sindresorhus/resolve-pkg) - Resolve the path of a package regardless of it having an entry point
+- [import-lazy](https://github.com/sindresorhus/import-lazy) - Import a module lazily
+- [resolve-global](https://github.com/sindresorhus/resolve-global) - Resolve the path of a globally installed module
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/resolve/.editorconfig b/node_modules/mathjs/examples/node_modules/resolve/.editorconfig
new file mode 100644
index 0000000..d63f0bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/.editorconfig
@@ -0,0 +1,37 @@
+root = true
+
+[*]
+indent_style = space
+indent_size = 2
+end_of_line = lf
+charset = utf-8
+trim_trailing_whitespace = true
+insert_final_newline = true
+max_line_length = 200
+
+[*.js]
+block_comment_start = /*
+block_comment = *
+block_comment_end = */
+
+[*.yml]
+indent_size = 1
+
+[package.json]
+indent_style = tab
+
+[lib/core.json]
+indent_style = tab
+
+[CHANGELOG.md]
+indent_style = space
+indent_size = 2
+
+[{*.json,Makefile}]
+max_line_length = off
+
+[test/{dotdot,resolver,module_dir,multirepo,node_path,pathfilter,precedence}/**/*]
+indent_style = off
+indent_size = off
+max_line_length = off
+insert_final_newline = off
diff --git a/node_modules/mathjs/examples/node_modules/resolve/.eslintrc b/node_modules/mathjs/examples/node_modules/resolve/.eslintrc
new file mode 100644
index 0000000..ce1be6e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/.eslintrc
@@ -0,0 +1,65 @@
+{
+    "root": true,
+
+    "extends": "@ljharb",
+
+    "rules": {
+        "indent": [2, 4],
+        "strict": 0,
+        "complexity": 0,
+        "consistent-return": 0,
+        "curly": 0,
+        "dot-notation": [2, { "allowKeywords": true }],
+        "func-name-matching": 0,
+        "func-style": 0,
+        "global-require": 1,
+        "id-length": [2, { "min": 1, "max": 30 }],
+        "max-lines": [2, 350],
+        "max-lines-per-function": 0,
+        "max-nested-callbacks": 0,
+        "max-params": 0,
+        "max-statements-per-line": [2, { "max": 2 }],
+        "max-statements": 0,
+        "no-magic-numbers": 0,
+        "no-shadow": 0,
+        "no-use-before-define": 0,
+        "sort-keys": 0,
+    },
+    "overrides": [
+        {
+            "files": "bin/**",
+            "rules": {
+                "no-process-exit": "off",
+            },
+        },
+        {
+            "files": "example/**",
+            "rules": {
+                "no-console": 0,
+            },
+        },
+        {
+            "files": "test/resolver/nested_symlinks/mylib/*.js",
+            "rules": {
+                "no-throw-literal": 0,
+            },
+        },
+        {
+            "files": "test/**",
+            "parserOptions": {
+                "ecmaVersion": 5,
+                "allowReserved": false,
+            },
+            "rules": {
+                "dot-notation": [2, { "allowPattern": "throws" }],
+                "max-lines": 0,
+                "max-lines-per-function": 0,
+                "no-unused-vars": [2, { "vars": "all", "args": "none" }],
+            },
+        },
+    ],
+
+    "ignorePatterns": [
+        "./test/resolver/malformed_package_json/package.json",
+    ],
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/.github/FUNDING.yml b/node_modules/mathjs/examples/node_modules/resolve/.github/FUNDING.yml
new file mode 100644
index 0000000..d9c0595
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/.github/FUNDING.yml
@@ -0,0 +1,12 @@
+# These are supported funding model platforms
+
+github: [ljharb]
+patreon: # Replace with a single Patreon username
+open_collective: # Replace with a single Open Collective username
+ko_fi: # Replace with a single Ko-fi username
+tidelift: npm/resolve
+community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
+liberapay: # Replace with a single Liberapay username
+issuehunt: # Replace with a single IssueHunt username
+otechie: # Replace with a single Otechie username
+custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']
diff --git a/node_modules/mathjs/examples/node_modules/resolve/LICENSE b/node_modules/mathjs/examples/node_modules/resolve/LICENSE
new file mode 100644
index 0000000..ff4fce2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2012 James Halliday
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/resolve/SECURITY.md b/node_modules/mathjs/examples/node_modules/resolve/SECURITY.md
new file mode 100644
index 0000000..82e4285
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/SECURITY.md
@@ -0,0 +1,3 @@
+# Security
+
+Please email [@ljharb](https://github.com/ljharb) or see https://tidelift.com/security if you have a potential security vulnerability to report.
diff --git a/node_modules/mathjs/examples/node_modules/resolve/appveyor.yml b/node_modules/mathjs/examples/node_modules/resolve/appveyor.yml
new file mode 100644
index 0000000..f74b7b8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/appveyor.yml
@@ -0,0 +1,76 @@
+version: 1.0.{build}
+skip_branch_with_pr: true
+build: off
+
+environment:
+  matrix:
+    #- nodejs_version: "17"
+    - nodejs_version: "16"
+    - nodejs_version: "15"
+    - nodejs_version: "14"
+    - nodejs_version: "13"
+    - nodejs_version: "12"
+    - nodejs_version: "11"
+    - nodejs_version: "10"
+    - nodejs_version: "9"
+    - nodejs_version: "8"
+    - nodejs_version: "7"
+    - nodejs_version: "6"
+    - nodejs_version: "5"
+    - nodejs_version: "4"
+    - nodejs_version: "3"
+    - nodejs_version: "2"
+    - nodejs_version: "1"
+    - nodejs_version: "0.12"
+    - nodejs_version: "0.10"
+    - nodejs_version: "0.8"
+    - nodejs_version: "0.6"
+matrix:
+  # fast_finish: true
+  allow_failures:
+    - nodejs_version: "0.8"
+      # platform: x86 # x64 has started failing on the registry side, around early November 2020
+    - nodejs_version: "0.6"
+
+platform:
+  - x86
+  - x64
+
+# Install scripts. (runs after repo cloning)
+install:
+  # Fix symlinks in working copy (see https://github.com/appveyor/ci/issues/650#issuecomment-186592582) / https://github.com/charleskorn/batect/commit/d08986802ec43086902958c4ee7e57ff3e71dbef
+  - git config core.symlinks true
+  - git reset --hard
+  # Get the latest stable version of Node.js or io.js
+  - ps: if ($env:nodejs_version -ne '0.6') { Install-Product node $env:nodejs_version $env:platform }
+  - ps: Update-NodeJsInstallation (Get-NodeJsLatestBuild $env:nodejs_version) $env:platform
+  - IF %nodejs_version% EQU 0.6 npm config set strict-ssl false && npm -g install npm@1.3
+  - IF %nodejs_version% EQU 0.8 npm config set strict-ssl false && npm -g install npm@1.4.28 && npm install -g npm@4.5
+  - IF %nodejs_version% EQU 1 npm -g install npm@2.9
+  - IF %nodejs_version% EQU 2 npm -g install npm@4
+  - IF %nodejs_version% EQU 3 npm -g install npm@4
+  - IF %nodejs_version% EQU 4 npm -g install npm@5.3
+  - IF %nodejs_version% EQU 5 npm -g install npm@5.3
+  - IF %nodejs_version% EQU 6 npm -g install npm@6.9
+  - IF %nodejs_version% EQU 7 npm -g install npm@6
+  - IF %nodejs_version% EQU 8 npm -g install npm@6
+  - IF %nodejs_version% EQU 9 npm -g install npm@6.9
+  - IF %nodejs_version% EQU 10 npm -g install npm@7
+  - IF %nodejs_version% EQU 11 npm -g install npm@7
+  - IF %nodejs_version% EQU 12 npm -g install npm@7
+  - IF %nodejs_version% EQU 13 npm -g install npm@7
+  - IF %nodejs_version% EQU 14 npm -g install npm@7
+  - IF %nodejs_version% EQU 15 npm -g install npm@7
+  - IF %nodejs_version% EQU 16 npm -g install npm@7
+  - set PATH=%APPDATA%\npm;%PATH%
+  #- IF %nodejs_version% NEQ 0.6 AND %nodejs_version% NEQ 0.8 npm -g install npm
+  # install modules
+  - npm install
+
+# Post-install test scripts.
+test_script:
+ # Output useful info for debugging.
+ - node --version
+ - npm --version
+ # run tests
+ - npm run tests-only
diff --git a/node_modules/mathjs/examples/node_modules/resolve/async.js b/node_modules/mathjs/examples/node_modules/resolve/async.js
new file mode 100644
index 0000000..f38c581
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/async.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./lib/async');
diff --git a/node_modules/mathjs/examples/node_modules/resolve/bin/resolve b/node_modules/mathjs/examples/node_modules/resolve/bin/resolve
new file mode 100644
index 0000000..5ee329a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/bin/resolve
@@ -0,0 +1,50 @@
+#!/usr/bin/env node
+
+'use strict';
+
+var path = require('path');
+var fs = require('fs');
+
+if (
+    String(process.env.npm_lifecycle_script).slice(0, 8) !== 'resolve '
+    && (
+        !process.argv
+        || process.argv.length < 2
+        || (process.argv[1] !== __filename && fs.statSync(process.argv[1]).ino !== fs.statSync(__filename).ino)
+        || (process.env._ && path.resolve(process.env._) !== __filename)
+    )
+) {
+    console.error('Error: `resolve` must be run directly as an executable');
+    process.exit(1);
+}
+
+var supportsPreserveSymlinkFlag = require('supports-preserve-symlinks-flag');
+
+var preserveSymlinks = false;
+for (var i = 2; i < process.argv.length; i += 1) {
+    if (process.argv[i].slice(0, 2) === '--') {
+        if (supportsPreserveSymlinkFlag && process.argv[i] === '--preserve-symlinks') {
+            preserveSymlinks = true;
+        } else if (process.argv[i].length > 2) {
+            console.error('Unknown argument ' + process.argv[i].replace(/[=].*$/, ''));
+            process.exit(2);
+        }
+        process.argv.splice(i, 1);
+        i -= 1;
+        if (process.argv[i] === '--') { break; } // eslint-disable-line no-restricted-syntax
+    }
+}
+
+if (process.argv.length < 3) {
+    console.error('Error: `resolve` expects a specifier');
+    process.exit(2);
+}
+
+var resolve = require('../');
+
+var result = resolve.sync(process.argv[2], {
+    basedir: process.cwd(),
+    preserveSymlinks: preserveSymlinks
+});
+
+console.log(result);
diff --git a/node_modules/mathjs/examples/node_modules/resolve/example/async.js b/node_modules/mathjs/examples/node_modules/resolve/example/async.js
new file mode 100644
index 0000000..20e65dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/example/async.js
@@ -0,0 +1,5 @@
+var resolve = require('../');
+resolve('tap', { basedir: __dirname }, function (err, res) {
+    if (err) console.error(err);
+    else console.log(res);
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/example/sync.js b/node_modules/mathjs/examples/node_modules/resolve/example/sync.js
new file mode 100644
index 0000000..54b2cc1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/example/sync.js
@@ -0,0 +1,3 @@
+var resolve = require('../');
+var res = resolve.sync('tap', { basedir: __dirname });
+console.log(res);
diff --git a/node_modules/mathjs/examples/node_modules/resolve/index.js b/node_modules/mathjs/examples/node_modules/resolve/index.js
new file mode 100644
index 0000000..125d814
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/index.js
@@ -0,0 +1,6 @@
+var async = require('./lib/async');
+async.core = require('./lib/core');
+async.isCore = require('./lib/is-core');
+async.sync = require('./lib/sync');
+
+module.exports = async;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/async.js b/node_modules/mathjs/examples/node_modules/resolve/lib/async.js
new file mode 100644
index 0000000..2b0f0f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/async.js
@@ -0,0 +1,329 @@
+var fs = require('fs');
+var getHomedir = require('./homedir');
+var path = require('path');
+var caller = require('./caller');
+var nodeModulesPaths = require('./node-modules-paths');
+var normalizeOptions = require('./normalize-options');
+var isCore = require('is-core-module');
+
+var realpathFS = fs.realpath && typeof fs.realpath.native === 'function' ? fs.realpath.native : fs.realpath;
+
+var homedir = getHomedir();
+var defaultPaths = function () {
+    return [
+        path.join(homedir, '.node_modules'),
+        path.join(homedir, '.node_libraries')
+    ];
+};
+
+var defaultIsFile = function isFile(file, cb) {
+    fs.stat(file, function (err, stat) {
+        if (!err) {
+            return cb(null, stat.isFile() || stat.isFIFO());
+        }
+        if (err.code === 'ENOENT' || err.code === 'ENOTDIR') return cb(null, false);
+        return cb(err);
+    });
+};
+
+var defaultIsDir = function isDirectory(dir, cb) {
+    fs.stat(dir, function (err, stat) {
+        if (!err) {
+            return cb(null, stat.isDirectory());
+        }
+        if (err.code === 'ENOENT' || err.code === 'ENOTDIR') return cb(null, false);
+        return cb(err);
+    });
+};
+
+var defaultRealpath = function realpath(x, cb) {
+    realpathFS(x, function (realpathErr, realPath) {
+        if (realpathErr && realpathErr.code !== 'ENOENT') cb(realpathErr);
+        else cb(null, realpathErr ? x : realPath);
+    });
+};
+
+var maybeRealpath = function maybeRealpath(realpath, x, opts, cb) {
+    if (opts && opts.preserveSymlinks === false) {
+        realpath(x, cb);
+    } else {
+        cb(null, x);
+    }
+};
+
+var defaultReadPackage = function defaultReadPackage(readFile, pkgfile, cb) {
+    readFile(pkgfile, function (readFileErr, body) {
+        if (readFileErr) cb(readFileErr);
+        else {
+            try {
+                var pkg = JSON.parse(body);
+                cb(null, pkg);
+            } catch (jsonErr) {
+                cb(null);
+            }
+        }
+    });
+};
+
+var getPackageCandidates = function getPackageCandidates(x, start, opts) {
+    var dirs = nodeModulesPaths(start, opts, x);
+    for (var i = 0; i < dirs.length; i++) {
+        dirs[i] = path.join(dirs[i], x);
+    }
+    return dirs;
+};
+
+module.exports = function resolve(x, options, callback) {
+    var cb = callback;
+    var opts = options;
+    if (typeof options === 'function') {
+        cb = opts;
+        opts = {};
+    }
+    if (typeof x !== 'string') {
+        var err = new TypeError('Path must be a string.');
+        return process.nextTick(function () {
+            cb(err);
+        });
+    }
+
+    opts = normalizeOptions(x, opts);
+
+    var isFile = opts.isFile || defaultIsFile;
+    var isDirectory = opts.isDirectory || defaultIsDir;
+    var readFile = opts.readFile || fs.readFile;
+    var realpath = opts.realpath || defaultRealpath;
+    var readPackage = opts.readPackage || defaultReadPackage;
+    if (opts.readFile && opts.readPackage) {
+        var conflictErr = new TypeError('`readFile` and `readPackage` are mutually exclusive.');
+        return process.nextTick(function () {
+            cb(conflictErr);
+        });
+    }
+    var packageIterator = opts.packageIterator;
+
+    var extensions = opts.extensions || ['.js'];
+    var includeCoreModules = opts.includeCoreModules !== false;
+    var basedir = opts.basedir || path.dirname(caller());
+    var parent = opts.filename || basedir;
+
+    opts.paths = opts.paths || defaultPaths();
+
+    // ensure that `basedir` is an absolute path at this point, resolving against the process' current working directory
+    var absoluteStart = path.resolve(basedir);
+
+    maybeRealpath(
+        realpath,
+        absoluteStart,
+        opts,
+        function (err, realStart) {
+            if (err) cb(err);
+            else init(realStart);
+        }
+    );
+
+    var res;
+    function init(basedir) {
+        if ((/^(?:\.\.?(?:\/|$)|\/|([A-Za-z]:)?[/\\])/).test(x)) {
+            res = path.resolve(basedir, x);
+            if (x === '.' || x === '..' || x.slice(-1) === '/') res += '/';
+            if ((/\/$/).test(x) && res === basedir) {
+                loadAsDirectory(res, opts.package, onfile);
+            } else loadAsFile(res, opts.package, onfile);
+        } else if (includeCoreModules && isCore(x)) {
+            return cb(null, x);
+        } else loadNodeModules(x, basedir, function (err, n, pkg) {
+            if (err) cb(err);
+            else if (n) {
+                return maybeRealpath(realpath, n, opts, function (err, realN) {
+                    if (err) {
+                        cb(err);
+                    } else {
+                        cb(null, realN, pkg);
+                    }
+                });
+            } else {
+                var moduleError = new Error("Cannot find module '" + x + "' from '" + parent + "'");
+                moduleError.code = 'MODULE_NOT_FOUND';
+                cb(moduleError);
+            }
+        });
+    }
+
+    function onfile(err, m, pkg) {
+        if (err) cb(err);
+        else if (m) cb(null, m, pkg);
+        else loadAsDirectory(res, function (err, d, pkg) {
+            if (err) cb(err);
+            else if (d) {
+                maybeRealpath(realpath, d, opts, function (err, realD) {
+                    if (err) {
+                        cb(err);
+                    } else {
+                        cb(null, realD, pkg);
+                    }
+                });
+            } else {
+                var moduleError = new Error("Cannot find module '" + x + "' from '" + parent + "'");
+                moduleError.code = 'MODULE_NOT_FOUND';
+                cb(moduleError);
+            }
+        });
+    }
+
+    function loadAsFile(x, thePackage, callback) {
+        var loadAsFilePackage = thePackage;
+        var cb = callback;
+        if (typeof loadAsFilePackage === 'function') {
+            cb = loadAsFilePackage;
+            loadAsFilePackage = undefined;
+        }
+
+        var exts = [''].concat(extensions);
+        load(exts, x, loadAsFilePackage);
+
+        function load(exts, x, loadPackage) {
+            if (exts.length === 0) return cb(null, undefined, loadPackage);
+            var file = x + exts[0];
+
+            var pkg = loadPackage;
+            if (pkg) onpkg(null, pkg);
+            else loadpkg(path.dirname(file), onpkg);
+
+            function onpkg(err, pkg_, dir) {
+                pkg = pkg_;
+                if (err) return cb(err);
+                if (dir && pkg && opts.pathFilter) {
+                    var rfile = path.relative(dir, file);
+                    var rel = rfile.slice(0, rfile.length - exts[0].length);
+                    var r = opts.pathFilter(pkg, x, rel);
+                    if (r) return load(
+                        [''].concat(extensions.slice()),
+                        path.resolve(dir, r),
+                        pkg
+                    );
+                }
+                isFile(file, onex);
+            }
+            function onex(err, ex) {
+                if (err) return cb(err);
+                if (ex) return cb(null, file, pkg);
+                load(exts.slice(1), x, pkg);
+            }
+        }
+    }
+
+    function loadpkg(dir, cb) {
+        if (dir === '' || dir === '/') return cb(null);
+        if (process.platform === 'win32' && (/^\w:[/\\]*$/).test(dir)) {
+            return cb(null);
+        }
+        if ((/[/\\]node_modules[/\\]*$/).test(dir)) return cb(null);
+
+        maybeRealpath(realpath, dir, opts, function (unwrapErr, pkgdir) {
+            if (unwrapErr) return loadpkg(path.dirname(dir), cb);
+            var pkgfile = path.join(pkgdir, 'package.json');
+            isFile(pkgfile, function (err, ex) {
+                // on err, ex is false
+                if (!ex) return loadpkg(path.dirname(dir), cb);
+
+                readPackage(readFile, pkgfile, function (err, pkgParam) {
+                    if (err) cb(err);
+
+                    var pkg = pkgParam;
+
+                    if (pkg && opts.packageFilter) {
+                        pkg = opts.packageFilter(pkg, pkgfile);
+                    }
+                    cb(null, pkg, dir);
+                });
+            });
+        });
+    }
+
+    function loadAsDirectory(x, loadAsDirectoryPackage, callback) {
+        var cb = callback;
+        var fpkg = loadAsDirectoryPackage;
+        if (typeof fpkg === 'function') {
+            cb = fpkg;
+            fpkg = opts.package;
+        }
+
+        maybeRealpath(realpath, x, opts, function (unwrapErr, pkgdir) {
+            if (unwrapErr) return cb(unwrapErr);
+            var pkgfile = path.join(pkgdir, 'package.json');
+            isFile(pkgfile, function (err, ex) {
+                if (err) return cb(err);
+                if (!ex) return loadAsFile(path.join(x, 'index'), fpkg, cb);
+
+                readPackage(readFile, pkgfile, function (err, pkgParam) {
+                    if (err) return cb(err);
+
+                    var pkg = pkgParam;
+
+                    if (pkg && opts.packageFilter) {
+                        pkg = opts.packageFilter(pkg, pkgfile);
+                    }
+
+                    if (pkg && pkg.main) {
+                        if (typeof pkg.main !== 'string') {
+                            var mainError = new TypeError('package “' + pkg.name + '” `main` must be a string');
+                            mainError.code = 'INVALID_PACKAGE_MAIN';
+                            return cb(mainError);
+                        }
+                        if (pkg.main === '.' || pkg.main === './') {
+                            pkg.main = 'index';
+                        }
+                        loadAsFile(path.resolve(x, pkg.main), pkg, function (err, m, pkg) {
+                            if (err) return cb(err);
+                            if (m) return cb(null, m, pkg);
+                            if (!pkg) return loadAsFile(path.join(x, 'index'), pkg, cb);
+
+                            var dir = path.resolve(x, pkg.main);
+                            loadAsDirectory(dir, pkg, function (err, n, pkg) {
+                                if (err) return cb(err);
+                                if (n) return cb(null, n, pkg);
+                                loadAsFile(path.join(x, 'index'), pkg, cb);
+                            });
+                        });
+                        return;
+                    }
+
+                    loadAsFile(path.join(x, '/index'), pkg, cb);
+                });
+            });
+        });
+    }
+
+    function processDirs(cb, dirs) {
+        if (dirs.length === 0) return cb(null, undefined);
+        var dir = dirs[0];
+
+        isDirectory(path.dirname(dir), isdir);
+
+        function isdir(err, isdir) {
+            if (err) return cb(err);
+            if (!isdir) return processDirs(cb, dirs.slice(1));
+            loadAsFile(dir, opts.package, onfile);
+        }
+
+        function onfile(err, m, pkg) {
+            if (err) return cb(err);
+            if (m) return cb(null, m, pkg);
+            loadAsDirectory(dir, opts.package, ondir);
+        }
+
+        function ondir(err, n, pkg) {
+            if (err) return cb(err);
+            if (n) return cb(null, n, pkg);
+            processDirs(cb, dirs.slice(1));
+        }
+    }
+    function loadNodeModules(x, start, cb) {
+        var thunk = function () { return getPackageCandidates(x, start, opts); };
+        processDirs(
+            cb,
+            packageIterator ? packageIterator(x, start, thunk, opts) : thunk()
+        );
+    }
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/caller.js b/node_modules/mathjs/examples/node_modules/resolve/lib/caller.js
new file mode 100644
index 0000000..b14a280
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/caller.js
@@ -0,0 +1,8 @@
+module.exports = function () {
+    // see https://code.google.com/p/v8/wiki/JavaScriptStackTraceApi
+    var origPrepareStackTrace = Error.prepareStackTrace;
+    Error.prepareStackTrace = function (_, stack) { return stack; };
+    var stack = (new Error()).stack;
+    Error.prepareStackTrace = origPrepareStackTrace;
+    return stack[2].getFileName();
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/core.js b/node_modules/mathjs/examples/node_modules/resolve/lib/core.js
new file mode 100644
index 0000000..ecc5b2e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/core.js
@@ -0,0 +1,52 @@
+var current = (process.versions && process.versions.node && process.versions.node.split('.')) || [];
+
+function specifierIncluded(specifier) {
+    var parts = specifier.split(' ');
+    var op = parts.length > 1 ? parts[0] : '=';
+    var versionParts = (parts.length > 1 ? parts[1] : parts[0]).split('.');
+
+    for (var i = 0; i < 3; ++i) {
+        var cur = parseInt(current[i] || 0, 10);
+        var ver = parseInt(versionParts[i] || 0, 10);
+        if (cur === ver) {
+            continue; // eslint-disable-line no-restricted-syntax, no-continue
+        }
+        if (op === '<') {
+            return cur < ver;
+        } else if (op === '>=') {
+            return cur >= ver;
+        }
+        return false;
+    }
+    return op === '>=';
+}
+
+function matchesRange(range) {
+    var specifiers = range.split(/ ?&& ?/);
+    if (specifiers.length === 0) { return false; }
+    for (var i = 0; i < specifiers.length; ++i) {
+        if (!specifierIncluded(specifiers[i])) { return false; }
+    }
+    return true;
+}
+
+function versionIncluded(specifierValue) {
+    if (typeof specifierValue === 'boolean') { return specifierValue; }
+    if (specifierValue && typeof specifierValue === 'object') {
+        for (var i = 0; i < specifierValue.length; ++i) {
+            if (matchesRange(specifierValue[i])) { return true; }
+        }
+        return false;
+    }
+    return matchesRange(specifierValue);
+}
+
+var data = require('./core.json');
+
+var core = {};
+for (var mod in data) { // eslint-disable-line no-restricted-syntax
+    if (Object.prototype.hasOwnProperty.call(data, mod)) {
+        core[mod] = versionIncluded(data[mod]);
+    }
+}
+module.exports = core;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/core.json b/node_modules/mathjs/examples/node_modules/resolve/lib/core.json
new file mode 100644
index 0000000..d275294
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/core.json
@@ -0,0 +1,152 @@
+{
+	"assert": true,
+	"node:assert": [">= 14.18 && < 15", ">= 16"],
+	"assert/strict": ">= 15",
+	"node:assert/strict": ">= 16",
+	"async_hooks": ">= 8",
+	"node:async_hooks": [">= 14.18 && < 15", ">= 16"],
+	"buffer_ieee754": ">= 0.5 && < 0.9.7",
+	"buffer": true,
+	"node:buffer": [">= 14.18 && < 15", ">= 16"],
+	"child_process": true,
+	"node:child_process": [">= 14.18 && < 15", ">= 16"],
+	"cluster": ">= 0.5",
+	"node:cluster": [">= 14.18 && < 15", ">= 16"],
+	"console": true,
+	"node:console": [">= 14.18 && < 15", ">= 16"],
+	"constants": true,
+	"node:constants": [">= 14.18 && < 15", ">= 16"],
+	"crypto": true,
+	"node:crypto": [">= 14.18 && < 15", ">= 16"],
+	"_debug_agent": ">= 1 && < 8",
+	"_debugger": "< 8",
+	"dgram": true,
+	"node:dgram": [">= 14.18 && < 15", ">= 16"],
+	"diagnostics_channel": [">= 14.17 && < 15", ">= 15.1"],
+	"node:diagnostics_channel": [">= 14.18 && < 15", ">= 16"],
+	"dns": true,
+	"node:dns": [">= 14.18 && < 15", ">= 16"],
+	"dns/promises": ">= 15",
+	"node:dns/promises": ">= 16",
+	"domain": ">= 0.7.12",
+	"node:domain": [">= 14.18 && < 15", ">= 16"],
+	"events": true,
+	"node:events": [">= 14.18 && < 15", ">= 16"],
+	"freelist": "< 6",
+	"fs": true,
+	"node:fs": [">= 14.18 && < 15", ">= 16"],
+	"fs/promises": [">= 10 && < 10.1", ">= 14"],
+	"node:fs/promises": [">= 14.18 && < 15", ">= 16"],
+	"_http_agent": ">= 0.11.1",
+	"node:_http_agent": [">= 14.18 && < 15", ">= 16"],
+	"_http_client": ">= 0.11.1",
+	"node:_http_client": [">= 14.18 && < 15", ">= 16"],
+	"_http_common": ">= 0.11.1",
+	"node:_http_common": [">= 14.18 && < 15", ">= 16"],
+	"_http_incoming": ">= 0.11.1",
+	"node:_http_incoming": [">= 14.18 && < 15", ">= 16"],
+	"_http_outgoing": ">= 0.11.1",
+	"node:_http_outgoing": [">= 14.18 && < 15", ">= 16"],
+	"_http_server": ">= 0.11.1",
+	"node:_http_server": [">= 14.18 && < 15", ">= 16"],
+	"http": true,
+	"node:http": [">= 14.18 && < 15", ">= 16"],
+	"http2": ">= 8.8",
+	"node:http2": [">= 14.18 && < 15", ">= 16"],
+	"https": true,
+	"node:https": [">= 14.18 && < 15", ">= 16"],
+	"inspector": ">= 8",
+	"node:inspector": [">= 14.18 && < 15", ">= 16"],
+	"_linklist": "< 8",
+	"module": true,
+	"node:module": [">= 14.18 && < 15", ">= 16"],
+	"net": true,
+	"node:net": [">= 14.18 && < 15", ">= 16"],
+	"node-inspect/lib/_inspect": ">= 7.6 && < 12",
+	"node-inspect/lib/internal/inspect_client": ">= 7.6 && < 12",
+	"node-inspect/lib/internal/inspect_repl": ">= 7.6 && < 12",
+	"os": true,
+	"node:os": [">= 14.18 && < 15", ">= 16"],
+	"path": true,
+	"node:path": [">= 14.18 && < 15", ">= 16"],
+	"path/posix": ">= 15.3",
+	"node:path/posix": ">= 16",
+	"path/win32": ">= 15.3",
+	"node:path/win32": ">= 16",
+	"perf_hooks": ">= 8.5",
+	"node:perf_hooks": [">= 14.18 && < 15", ">= 16"],
+	"process": ">= 1",
+	"node:process": [">= 14.18 && < 15", ">= 16"],
+	"punycode": ">= 0.5",
+	"node:punycode": [">= 14.18 && < 15", ">= 16"],
+	"querystring": true,
+	"node:querystring": [">= 14.18 && < 15", ">= 16"],
+	"readline": true,
+	"node:readline": [">= 14.18 && < 15", ">= 16"],
+	"readline/promises": ">= 17",
+	"node:readline/promises": ">= 17",
+	"repl": true,
+	"node:repl": [">= 14.18 && < 15", ">= 16"],
+	"smalloc": ">= 0.11.5 && < 3",
+	"_stream_duplex": ">= 0.9.4",
+	"node:_stream_duplex": [">= 14.18 && < 15", ">= 16"],
+	"_stream_transform": ">= 0.9.4",
+	"node:_stream_transform": [">= 14.18 && < 15", ">= 16"],
+	"_stream_wrap": ">= 1.4.1",
+	"node:_stream_wrap": [">= 14.18 && < 15", ">= 16"],
+	"_stream_passthrough": ">= 0.9.4",
+	"node:_stream_passthrough": [">= 14.18 && < 15", ">= 16"],
+	"_stream_readable": ">= 0.9.4",
+	"node:_stream_readable": [">= 14.18 && < 15", ">= 16"],
+	"_stream_writable": ">= 0.9.4",
+	"node:_stream_writable": [">= 14.18 && < 15", ">= 16"],
+	"stream": true,
+	"node:stream": [">= 14.18 && < 15", ">= 16"],
+	"stream/consumers": ">= 16.7",
+	"node:stream/consumers": ">= 16.7",
+	"stream/promises": ">= 15",
+	"node:stream/promises": ">= 16",
+	"stream/web": ">= 16.5",
+	"node:stream/web": ">= 16.5",
+	"string_decoder": true,
+	"node:string_decoder": [">= 14.18 && < 15", ">= 16"],
+	"sys": [">= 0.4 && < 0.7", ">= 0.8"],
+	"node:sys": [">= 14.18 && < 15", ">= 16"],
+	"timers": true,
+	"node:timers": [">= 14.18 && < 15", ">= 16"],
+	"timers/promises": ">= 15",
+	"node:timers/promises": ">= 16",
+	"_tls_common": ">= 0.11.13",
+	"node:_tls_common": [">= 14.18 && < 15", ">= 16"],
+	"_tls_legacy": ">= 0.11.3 && < 10",
+	"_tls_wrap": ">= 0.11.3",
+	"node:_tls_wrap": [">= 14.18 && < 15", ">= 16"],
+	"tls": true,
+	"node:tls": [">= 14.18 && < 15", ">= 16"],
+	"trace_events": ">= 10",
+	"node:trace_events": [">= 14.18 && < 15", ">= 16"],
+	"tty": true,
+	"node:tty": [">= 14.18 && < 15", ">= 16"],
+	"url": true,
+	"node:url": [">= 14.18 && < 15", ">= 16"],
+	"util": true,
+	"node:util": [">= 14.18 && < 15", ">= 16"],
+	"util/types": ">= 15.3",
+	"node:util/types": ">= 16",
+	"v8/tools/arguments": ">= 10 && < 12",
+	"v8/tools/codemap": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/consarray": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/csvparser": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/logreader": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/profile_view": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8/tools/splaytree": [">= 4.4 && < 5", ">= 5.2 && < 12"],
+	"v8": ">= 1",
+	"node:v8": [">= 14.18 && < 15", ">= 16"],
+	"vm": true,
+	"node:vm": [">= 14.18 && < 15", ">= 16"],
+	"wasi": ">= 13.4 && < 13.5",
+	"worker_threads": ">= 11.7",
+	"node:worker_threads": [">= 14.18 && < 15", ">= 16"],
+	"zlib": ">= 0.5",
+	"node:zlib": [">= 14.18 && < 15", ">= 16"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/homedir.js b/node_modules/mathjs/examples/node_modules/resolve/lib/homedir.js
new file mode 100644
index 0000000..5ffdf73
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/homedir.js
@@ -0,0 +1,24 @@
+'use strict';
+
+var os = require('os');
+
+// adapted from https://github.com/sindresorhus/os-homedir/blob/11e089f4754db38bb535e5a8416320c4446e8cfd/index.js
+
+module.exports = os.homedir || function homedir() {
+    var home = process.env.HOME;
+    var user = process.env.LOGNAME || process.env.USER || process.env.LNAME || process.env.USERNAME;
+
+    if (process.platform === 'win32') {
+        return process.env.USERPROFILE || process.env.HOMEDRIVE + process.env.HOMEPATH || home || null;
+    }
+
+    if (process.platform === 'darwin') {
+        return home || (user ? '/Users/' + user : null);
+    }
+
+    if (process.platform === 'linux') {
+        return home || (process.getuid() === 0 ? '/root' : (user ? '/home/' + user : null)); // eslint-disable-line no-extra-parens
+    }
+
+    return home || null;
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/is-core.js b/node_modules/mathjs/examples/node_modules/resolve/lib/is-core.js
new file mode 100644
index 0000000..537f5c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/is-core.js
@@ -0,0 +1,5 @@
+var isCoreModule = require('is-core-module');
+
+module.exports = function isCore(x) {
+    return isCoreModule(x);
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/node-modules-paths.js b/node_modules/mathjs/examples/node_modules/resolve/lib/node-modules-paths.js
new file mode 100644
index 0000000..1cff010
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/node-modules-paths.js
@@ -0,0 +1,42 @@
+var path = require('path');
+var parse = path.parse || require('path-parse'); // eslint-disable-line global-require
+
+var getNodeModulesDirs = function getNodeModulesDirs(absoluteStart, modules) {
+    var prefix = '/';
+    if ((/^([A-Za-z]:)/).test(absoluteStart)) {
+        prefix = '';
+    } else if ((/^\\\\/).test(absoluteStart)) {
+        prefix = '\\\\';
+    }
+
+    var paths = [absoluteStart];
+    var parsed = parse(absoluteStart);
+    while (parsed.dir !== paths[paths.length - 1]) {
+        paths.push(parsed.dir);
+        parsed = parse(parsed.dir);
+    }
+
+    return paths.reduce(function (dirs, aPath) {
+        return dirs.concat(modules.map(function (moduleDir) {
+            return path.resolve(prefix, aPath, moduleDir);
+        }));
+    }, []);
+};
+
+module.exports = function nodeModulesPaths(start, opts, request) {
+    var modules = opts && opts.moduleDirectory
+        ? [].concat(opts.moduleDirectory)
+        : ['node_modules'];
+
+    if (opts && typeof opts.paths === 'function') {
+        return opts.paths(
+            request,
+            start,
+            function () { return getNodeModulesDirs(start, modules); },
+            opts
+        );
+    }
+
+    var dirs = getNodeModulesDirs(start, modules);
+    return opts && opts.paths ? dirs.concat(opts.paths) : dirs;
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/normalize-options.js b/node_modules/mathjs/examples/node_modules/resolve/lib/normalize-options.js
new file mode 100644
index 0000000..4b56904
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/normalize-options.js
@@ -0,0 +1,10 @@
+module.exports = function (x, opts) {
+    /**
+     * This file is purposefully a passthrough. It's expected that third-party
+     * environments will override it at runtime in order to inject special logic
+     * into `resolve` (by manipulating the options). One such example is the PnP
+     * code path in Yarn.
+     */
+
+    return opts || {};
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/lib/sync.js b/node_modules/mathjs/examples/node_modules/resolve/lib/sync.js
new file mode 100644
index 0000000..3246989
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/lib/sync.js
@@ -0,0 +1,208 @@
+var isCore = require('is-core-module');
+var fs = require('fs');
+var path = require('path');
+var getHomedir = require('./homedir');
+var caller = require('./caller');
+var nodeModulesPaths = require('./node-modules-paths');
+var normalizeOptions = require('./normalize-options');
+
+var realpathFS = fs.realpathSync && typeof fs.realpathSync.native === 'function' ? fs.realpathSync.native : fs.realpathSync;
+
+var homedir = getHomedir();
+var defaultPaths = function () {
+    return [
+        path.join(homedir, '.node_modules'),
+        path.join(homedir, '.node_libraries')
+    ];
+};
+
+var defaultIsFile = function isFile(file) {
+    try {
+        var stat = fs.statSync(file, { throwIfNoEntry: false });
+    } catch (e) {
+        if (e && (e.code === 'ENOENT' || e.code === 'ENOTDIR')) return false;
+        throw e;
+    }
+    return !!stat && (stat.isFile() || stat.isFIFO());
+};
+
+var defaultIsDir = function isDirectory(dir) {
+    try {
+        var stat = fs.statSync(dir, { throwIfNoEntry: false });
+    } catch (e) {
+        if (e && (e.code === 'ENOENT' || e.code === 'ENOTDIR')) return false;
+        throw e;
+    }
+    return !!stat && stat.isDirectory();
+};
+
+var defaultRealpathSync = function realpathSync(x) {
+    try {
+        return realpathFS(x);
+    } catch (realpathErr) {
+        if (realpathErr.code !== 'ENOENT') {
+            throw realpathErr;
+        }
+    }
+    return x;
+};
+
+var maybeRealpathSync = function maybeRealpathSync(realpathSync, x, opts) {
+    if (opts && opts.preserveSymlinks === false) {
+        return realpathSync(x);
+    }
+    return x;
+};
+
+var defaultReadPackageSync = function defaultReadPackageSync(readFileSync, pkgfile) {
+    var body = readFileSync(pkgfile);
+    try {
+        var pkg = JSON.parse(body);
+        return pkg;
+    } catch (jsonErr) {}
+};
+
+var getPackageCandidates = function getPackageCandidates(x, start, opts) {
+    var dirs = nodeModulesPaths(start, opts, x);
+    for (var i = 0; i < dirs.length; i++) {
+        dirs[i] = path.join(dirs[i], x);
+    }
+    return dirs;
+};
+
+module.exports = function resolveSync(x, options) {
+    if (typeof x !== 'string') {
+        throw new TypeError('Path must be a string.');
+    }
+    var opts = normalizeOptions(x, options);
+
+    var isFile = opts.isFile || defaultIsFile;
+    var readFileSync = opts.readFileSync || fs.readFileSync;
+    var isDirectory = opts.isDirectory || defaultIsDir;
+    var realpathSync = opts.realpathSync || defaultRealpathSync;
+    var readPackageSync = opts.readPackageSync || defaultReadPackageSync;
+    if (opts.readFileSync && opts.readPackageSync) {
+        throw new TypeError('`readFileSync` and `readPackageSync` are mutually exclusive.');
+    }
+    var packageIterator = opts.packageIterator;
+
+    var extensions = opts.extensions || ['.js'];
+    var includeCoreModules = opts.includeCoreModules !== false;
+    var basedir = opts.basedir || path.dirname(caller());
+    var parent = opts.filename || basedir;
+
+    opts.paths = opts.paths || defaultPaths();
+
+    // ensure that `basedir` is an absolute path at this point, resolving against the process' current working directory
+    var absoluteStart = maybeRealpathSync(realpathSync, path.resolve(basedir), opts);
+
+    if ((/^(?:\.\.?(?:\/|$)|\/|([A-Za-z]:)?[/\\])/).test(x)) {
+        var res = path.resolve(absoluteStart, x);
+        if (x === '.' || x === '..' || x.slice(-1) === '/') res += '/';
+        var m = loadAsFileSync(res) || loadAsDirectorySync(res);
+        if (m) return maybeRealpathSync(realpathSync, m, opts);
+    } else if (includeCoreModules && isCore(x)) {
+        return x;
+    } else {
+        var n = loadNodeModulesSync(x, absoluteStart);
+        if (n) return maybeRealpathSync(realpathSync, n, opts);
+    }
+
+    var err = new Error("Cannot find module '" + x + "' from '" + parent + "'");
+    err.code = 'MODULE_NOT_FOUND';
+    throw err;
+
+    function loadAsFileSync(x) {
+        var pkg = loadpkg(path.dirname(x));
+
+        if (pkg && pkg.dir && pkg.pkg && opts.pathFilter) {
+            var rfile = path.relative(pkg.dir, x);
+            var r = opts.pathFilter(pkg.pkg, x, rfile);
+            if (r) {
+                x = path.resolve(pkg.dir, r); // eslint-disable-line no-param-reassign
+            }
+        }
+
+        if (isFile(x)) {
+            return x;
+        }
+
+        for (var i = 0; i < extensions.length; i++) {
+            var file = x + extensions[i];
+            if (isFile(file)) {
+                return file;
+            }
+        }
+    }
+
+    function loadpkg(dir) {
+        if (dir === '' || dir === '/') return;
+        if (process.platform === 'win32' && (/^\w:[/\\]*$/).test(dir)) {
+            return;
+        }
+        if ((/[/\\]node_modules[/\\]*$/).test(dir)) return;
+
+        var pkgfile = path.join(maybeRealpathSync(realpathSync, dir, opts), 'package.json');
+
+        if (!isFile(pkgfile)) {
+            return loadpkg(path.dirname(dir));
+        }
+
+        var pkg = readPackageSync(readFileSync, pkgfile);
+
+        if (pkg && opts.packageFilter) {
+            // v2 will pass pkgfile
+            pkg = opts.packageFilter(pkg, /*pkgfile,*/ dir); // eslint-disable-line spaced-comment
+        }
+
+        return { pkg: pkg, dir: dir };
+    }
+
+    function loadAsDirectorySync(x) {
+        var pkgfile = path.join(maybeRealpathSync(realpathSync, x, opts), '/package.json');
+        if (isFile(pkgfile)) {
+            try {
+                var pkg = readPackageSync(readFileSync, pkgfile);
+            } catch (e) {}
+
+            if (pkg && opts.packageFilter) {
+                // v2 will pass pkgfile
+                pkg = opts.packageFilter(pkg, /*pkgfile,*/ x); // eslint-disable-line spaced-comment
+            }
+
+            if (pkg && pkg.main) {
+                if (typeof pkg.main !== 'string') {
+                    var mainError = new TypeError('package “' + pkg.name + '” `main` must be a string');
+                    mainError.code = 'INVALID_PACKAGE_MAIN';
+                    throw mainError;
+                }
+                if (pkg.main === '.' || pkg.main === './') {
+                    pkg.main = 'index';
+                }
+                try {
+                    var m = loadAsFileSync(path.resolve(x, pkg.main));
+                    if (m) return m;
+                    var n = loadAsDirectorySync(path.resolve(x, pkg.main));
+                    if (n) return n;
+                } catch (e) {}
+            }
+        }
+
+        return loadAsFileSync(path.join(x, '/index'));
+    }
+
+    function loadNodeModulesSync(x, start) {
+        var thunk = function () { return getPackageCandidates(x, start, opts); };
+        var dirs = packageIterator ? packageIterator(x, start, thunk, opts) : thunk();
+
+        for (var i = 0; i < dirs.length; i++) {
+            var dir = dirs[i];
+            if (isDirectory(path.dirname(dir))) {
+                var m = loadAsFileSync(dir);
+                if (m) return m;
+                var n = loadAsDirectorySync(dir);
+                if (n) return n;
+            }
+        }
+    }
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/package.json b/node_modules/mathjs/examples/node_modules/resolve/package.json
new file mode 100644
index 0000000..5cad3f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/package.json
@@ -0,0 +1,62 @@
+{
+	"name": "resolve",
+	"description": "resolve like require.resolve() on behalf of files asynchronously and synchronously",
+	"version": "1.22.0",
+	"repository": {
+		"type": "git",
+		"url": "git://github.com/browserify/resolve.git"
+	},
+	"bin": {
+		"resolve": "./bin/resolve"
+	},
+	"main": "index.js",
+	"keywords": [
+		"resolve",
+		"require",
+		"node",
+		"module"
+	],
+	"scripts": {
+		"prepublishOnly": "safe-publish-latest && cp node_modules/is-core-module/core.json ./lib/ ||:",
+		"prepublish": "not-in-publish || npm run prepublishOnly",
+		"prelint": "eclint check $(git ls-files | xargs find 2> /dev/null | grep -vE 'node_modules|\\.git')",
+		"lint": "eslint --ext=js,mjs --no-eslintrc -c .eslintrc . 'bin/**'",
+		"pretests-only": "cd ./test/resolver/nested_symlinks && node mylib/sync && node mylib/async",
+		"tests-only": "tape test/*.js",
+		"pretest": "npm run lint",
+		"test": "npm run --silent tests-only",
+		"posttest": "npm run test:multirepo && aud --production",
+		"test:multirepo": "cd ./test/resolver/multirepo && npm install && npm test"
+	},
+	"devDependencies": {
+		"@ljharb/eslint-config": "^20.2.0",
+		"array.prototype.map": "^1.0.4",
+		"aud": "^2.0.0",
+		"copy-dir": "^1.3.0",
+		"eclint": "^2.8.1",
+		"eslint": "^8.7.0",
+		"in-publish": "^2.0.1",
+		"mkdirp": "^0.5.5",
+		"mv": "^2.1.1",
+		"object-keys": "^1.1.1",
+		"rimraf": "^2.7.1",
+		"safe-publish-latest": "^2.0.0",
+		"tap": "0.4.13",
+		"tape": "^5.4.1",
+		"tmp": "^0.0.31"
+	},
+	"license": "MIT",
+	"author": {
+		"name": "James Halliday",
+		"email": "mail@substack.net",
+		"url": "http://substack.net"
+	},
+	"funding": {
+		"url": "https://github.com/sponsors/ljharb"
+	},
+	"dependencies": {
+		"is-core-module": "^2.8.1",
+		"path-parse": "^1.0.7",
+		"supports-preserve-symlinks-flag": "^1.0.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/readme.markdown b/node_modules/mathjs/examples/node_modules/resolve/readme.markdown
new file mode 100644
index 0000000..ad34d60
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/readme.markdown
@@ -0,0 +1,301 @@
+# resolve <sup>[![Version Badge][2]][1]</sup>
+
+implements the [node `require.resolve()` algorithm](https://nodejs.org/api/modules.html#modules_all_together) such that you can `require.resolve()` on behalf of a file asynchronously and synchronously
+
+[![github actions][actions-image]][actions-url]
+[![coverage][codecov-image]][codecov-url]
+[![dependency status][5]][6]
+[![dev dependency status][7]][8]
+[![License][license-image]][license-url]
+[![Downloads][downloads-image]][downloads-url]
+
+[![npm badge][11]][1]
+
+# example
+
+asynchronously resolve:
+
+```js
+var resolve = require('resolve/async'); // or, require('resolve')
+resolve('tap', { basedir: __dirname }, function (err, res) {
+    if (err) console.error(err);
+    else console.log(res);
+});
+```
+
+```
+$ node example/async.js
+/home/substack/projects/node-resolve/node_modules/tap/lib/main.js
+```
+
+synchronously resolve:
+
+```js
+var resolve = require('resolve/sync'); // or, `require('resolve').sync
+var res = resolve('tap', { basedir: __dirname });
+console.log(res);
+```
+
+```
+$ node example/sync.js
+/home/substack/projects/node-resolve/node_modules/tap/lib/main.js
+```
+
+# methods
+
+```js
+var resolve = require('resolve');
+var async = require('resolve/async');
+var sync = require('resolve/sync');
+```
+
+For both the synchronous and asynchronous methods, errors may have any of the following `err.code` values:
+
+- `MODULE_NOT_FOUND`: the given path string (`id`) could not be resolved to a module
+- `INVALID_BASEDIR`: the specified `opts.basedir` doesn't exist, or is not a directory
+- `INVALID_PACKAGE_MAIN`: a `package.json` was encountered with an invalid `main` property (eg. not a string)
+
+## resolve(id, opts={}, cb)
+
+Asynchronously resolve the module path string `id` into `cb(err, res [, pkg])`, where `pkg` (if defined) is the data from `package.json`.
+
+options are:
+
+* opts.basedir - directory to begin resolving from
+
+* opts.package - `package.json` data applicable to the module being loaded
+
+* opts.extensions - array of file extensions to search in order
+
+* opts.includeCoreModules - set to `false` to exclude node core modules (e.g. `fs`) from the search
+
+* opts.readFile - how to read files asynchronously
+
+* opts.isFile - function to asynchronously test whether a file exists
+
+* opts.isDirectory - function to asynchronously test whether a file exists and is a directory
+
+* opts.realpath - function to asynchronously resolve a potential symlink to its real path
+
+* `opts.readPackage(readFile, pkgfile, cb)` - function to asynchronously read and parse a package.json file
+  * readFile - the passed `opts.readFile` or `fs.readFile` if not specified
+  * pkgfile - path to package.json
+  * cb - callback
+
+* `opts.packageFilter(pkg, pkgfile, dir)` - transform the parsed package.json contents before looking at the "main" field
+  * pkg - package data
+  * pkgfile - path to package.json
+  * dir - directory that contains package.json
+
+* `opts.pathFilter(pkg, path, relativePath)` - transform a path within a package
+  * pkg - package data
+  * path - the path being resolved
+  * relativePath - the path relative from the package.json location
+  * returns - a relative path that will be joined from the package.json location
+
+* opts.paths - require.paths array to use if nothing is found on the normal `node_modules` recursive walk (probably don't use this)
+
+  For advanced users, `paths` can also be a `opts.paths(request, start, opts)` function
+    * request - the import specifier being resolved
+    * start - lookup path
+    * getNodeModulesDirs - a thunk (no-argument function) that returns the paths using standard `node_modules` resolution
+    * opts - the resolution options
+
+* `opts.packageIterator(request, start, opts)` - return the list of candidate paths where the packages sources may be found (probably don't use this)
+    * request - the import specifier being resolved
+    * start - lookup path
+    * getPackageCandidates - a thunk (no-argument function) that returns the paths using standard `node_modules` resolution
+    * opts - the resolution options
+
+* opts.moduleDirectory - directory (or directories) in which to recursively look for modules. default: `"node_modules"`
+
+* opts.preserveSymlinks - if true, doesn't resolve `basedir` to real path before resolving.
+This is the way Node resolves dependencies when executed with the [--preserve-symlinks](https://nodejs.org/api/all.html#cli_preserve_symlinks) flag.
+**Note:** this property is currently `true` by default but it will be changed to
+`false` in the next major version because *Node's resolution algorithm does not preserve symlinks by default*.
+
+default `opts` values:
+
+```js
+{
+    paths: [],
+    basedir: __dirname,
+    extensions: ['.js'],
+    includeCoreModules: true,
+    readFile: fs.readFile,
+    isFile: function isFile(file, cb) {
+        fs.stat(file, function (err, stat) {
+            if (!err) {
+                return cb(null, stat.isFile() || stat.isFIFO());
+            }
+            if (err.code === 'ENOENT' || err.code === 'ENOTDIR') return cb(null, false);
+            return cb(err);
+        });
+    },
+    isDirectory: function isDirectory(dir, cb) {
+        fs.stat(dir, function (err, stat) {
+            if (!err) {
+                return cb(null, stat.isDirectory());
+            }
+            if (err.code === 'ENOENT' || err.code === 'ENOTDIR') return cb(null, false);
+            return cb(err);
+        });
+    },
+    realpath: function realpath(file, cb) {
+        var realpath = typeof fs.realpath.native === 'function' ? fs.realpath.native : fs.realpath;
+        realpath(file, function (realPathErr, realPath) {
+            if (realPathErr && realPathErr.code !== 'ENOENT') cb(realPathErr);
+            else cb(null, realPathErr ? file : realPath);
+        });
+    },
+    readPackage: function defaultReadPackage(readFile, pkgfile, cb) {
+        readFile(pkgfile, function (readFileErr, body) {
+            if (readFileErr) cb(readFileErr);
+            else {
+                try {
+                    var pkg = JSON.parse(body);
+                    cb(null, pkg);
+                } catch (jsonErr) {
+                    cb(null);
+                }
+            }
+        });
+    },
+    moduleDirectory: 'node_modules',
+    preserveSymlinks: true
+}
+```
+
+## resolve.sync(id, opts)
+
+Synchronously resolve the module path string `id`, returning the result and
+throwing an error when `id` can't be resolved.
+
+options are:
+
+* opts.basedir - directory to begin resolving from
+
+* opts.extensions - array of file extensions to search in order
+
+* opts.includeCoreModules - set to `false` to exclude node core modules (e.g. `fs`) from the search
+
+* opts.readFileSync - how to read files synchronously
+
+* opts.isFile - function to synchronously test whether a file exists
+
+* opts.isDirectory - function to synchronously test whether a file exists and is a directory
+
+* opts.realpathSync - function to synchronously resolve a potential symlink to its real path
+
+* `opts.readPackageSync(readFileSync, pkgfile)` - function to synchronously read and parse a package.json file
+  * readFileSync - the passed `opts.readFileSync` or `fs.readFileSync` if not specified
+  * pkgfile - path to package.json
+
+* `opts.packageFilter(pkg, dir)` - transform the parsed package.json contents before looking at the "main" field
+  * pkg - package data
+  * dir - directory that contains package.json (Note: the second argument will change to "pkgfile" in v2)
+
+* `opts.pathFilter(pkg, path, relativePath)` - transform a path within a package
+  * pkg - package data
+  * path - the path being resolved
+  * relativePath - the path relative from the package.json location
+  * returns - a relative path that will be joined from the package.json location
+
+* opts.paths - require.paths array to use if nothing is found on the normal `node_modules` recursive walk (probably don't use this)
+
+  For advanced users, `paths` can also be a `opts.paths(request, start, opts)` function
+    * request - the import specifier being resolved
+    * start - lookup path
+    * getNodeModulesDirs - a thunk (no-argument function) that returns the paths using standard `node_modules` resolution
+    * opts - the resolution options
+
+* `opts.packageIterator(request, start, opts)` - return the list of candidate paths where the packages sources may be found (probably don't use this)
+    * request - the import specifier being resolved
+    * start - lookup path
+    * getPackageCandidates - a thunk (no-argument function) that returns the paths using standard `node_modules` resolution
+    * opts - the resolution options
+
+* opts.moduleDirectory - directory (or directories) in which to recursively look for modules. default: `"node_modules"`
+
+* opts.preserveSymlinks - if true, doesn't resolve `basedir` to real path before resolving.
+This is the way Node resolves dependencies when executed with the [--preserve-symlinks](https://nodejs.org/api/all.html#cli_preserve_symlinks) flag.
+**Note:** this property is currently `true` by default but it will be changed to
+`false` in the next major version because *Node's resolution algorithm does not preserve symlinks by default*.
+
+default `opts` values:
+
+```js
+{
+    paths: [],
+    basedir: __dirname,
+    extensions: ['.js'],
+    includeCoreModules: true,
+    readFileSync: fs.readFileSync,
+    isFile: function isFile(file) {
+        try {
+            var stat = fs.statSync(file);
+        } catch (e) {
+            if (e && (e.code === 'ENOENT' || e.code === 'ENOTDIR')) return false;
+            throw e;
+        }
+        return stat.isFile() || stat.isFIFO();
+    },
+    isDirectory: function isDirectory(dir) {
+        try {
+            var stat = fs.statSync(dir);
+        } catch (e) {
+            if (e && (e.code === 'ENOENT' || e.code === 'ENOTDIR')) return false;
+            throw e;
+        }
+        return stat.isDirectory();
+    },
+    realpathSync: function realpathSync(file) {
+        try {
+            var realpath = typeof fs.realpathSync.native === 'function' ? fs.realpathSync.native : fs.realpathSync;
+            return realpath(file);
+        } catch (realPathErr) {
+            if (realPathErr.code !== 'ENOENT') {
+                throw realPathErr;
+            }
+        }
+        return file;
+    },
+    readPackageSync: function defaultReadPackageSync(readFileSync, pkgfile) {
+        var body = readFileSync(pkgfile);
+        try {
+            var pkg = JSON.parse(body);
+            return pkg;
+        } catch (jsonErr) {}
+    },
+    moduleDirectory: 'node_modules',
+    preserveSymlinks: true
+}
+```
+
+# install
+
+With [npm](https://npmjs.org) do:
+
+```sh
+npm install resolve
+```
+
+# license
+
+MIT
+
+[1]: https://npmjs.org/package/resolve
+[2]: https://versionbadg.es/browserify/resolve.svg
+[5]: https://david-dm.org/browserify/resolve.svg
+[6]: https://david-dm.org/browserify/resolve
+[7]: https://david-dm.org/browserify/resolve/dev-status.svg
+[8]: https://david-dm.org/browserify/resolve#info=devDependencies
+[11]: https://nodei.co/npm/resolve.png?downloads=true&stars=true
+[license-image]: https://img.shields.io/npm/l/resolve.svg
+[license-url]: LICENSE
+[downloads-image]: https://img.shields.io/npm/dm/resolve.svg
+[downloads-url]: https://npm-stat.com/charts.html?package=resolve
+[codecov-image]: https://codecov.io/gh/browserify/resolve/branch/main/graphs/badge.svg
+[codecov-url]: https://app.codecov.io/gh/browserify/resolve/
+[actions-image]: https://img.shields.io/endpoint?url=https://github-actions-badge-u3jn4tfpocch.runkit.sh/browserify/resolve
+[actions-url]: https://github.com/browserify/resolve/actions
diff --git a/node_modules/mathjs/examples/node_modules/resolve/sync.js b/node_modules/mathjs/examples/node_modules/resolve/sync.js
new file mode 100644
index 0000000..cd0ee04
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/sync.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = require('./lib/sync');
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/core.js b/node_modules/mathjs/examples/node_modules/resolve/test/core.js
new file mode 100644
index 0000000..7a3ccb1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/core.js
@@ -0,0 +1,81 @@
+var test = require('tape');
+var keys = require('object-keys');
+var resolve = require('../');
+
+test('core modules', function (t) {
+    t.test('isCore()', function (st) {
+        st.ok(resolve.isCore('fs'));
+        st.ok(resolve.isCore('net'));
+        st.ok(resolve.isCore('http'));
+
+        st.ok(!resolve.isCore('seq'));
+        st.ok(!resolve.isCore('../'));
+
+        st.ok(!resolve.isCore('toString'));
+
+        st.end();
+    });
+
+    t.test('core list', function (st) {
+        var cores = keys(resolve.core);
+        st.plan(cores.length);
+
+        for (var i = 0; i < cores.length; ++i) {
+            var mod = cores[i];
+            var requireFunc = function () { require(mod); }; // eslint-disable-line no-loop-func
+            console.log(mod, resolve.core, resolve.core[mod]);
+            if (resolve.core[mod]) {
+                st.doesNotThrow(requireFunc, mod + ' supported; requiring does not throw');
+            } else {
+                st.throws(requireFunc, mod + ' not supported; requiring throws');
+            }
+        }
+
+        st.end();
+    });
+
+    t.test('core via repl module', { skip: !resolve.core.repl }, function (st) {
+        var libs = require('repl')._builtinLibs; // eslint-disable-line no-underscore-dangle
+        if (!libs) {
+            st.skip('module.builtinModules does not exist');
+            return st.end();
+        }
+        for (var i = 0; i < libs.length; ++i) {
+            var mod = libs[i];
+            st.ok(resolve.core[mod], mod + ' is a core module');
+            st.doesNotThrow(
+                function () { require(mod); }, // eslint-disable-line no-loop-func
+                'requiring ' + mod + ' does not throw'
+            );
+        }
+        st.end();
+    });
+
+    t.test('core via builtinModules list', { skip: !resolve.core.module }, function (st) {
+        var libs = require('module').builtinModules;
+        if (!libs) {
+            st.skip('module.builtinModules does not exist');
+            return st.end();
+        }
+        var blacklist = [
+            '_debug_agent',
+            'v8/tools/tickprocessor-driver',
+            'v8/tools/SourceMap',
+            'v8/tools/tickprocessor',
+            'v8/tools/profile'
+        ];
+        for (var i = 0; i < libs.length; ++i) {
+            var mod = libs[i];
+            if (blacklist.indexOf(mod) === -1) {
+                st.ok(resolve.core[mod], mod + ' is a core module');
+                st.doesNotThrow(
+                    function () { require(mod); }, // eslint-disable-line no-loop-func
+                    'requiring ' + mod + ' does not throw'
+                );
+            }
+        }
+        st.end();
+    });
+
+    t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/dotdot.js b/node_modules/mathjs/examples/node_modules/resolve/test/dotdot.js
new file mode 100644
index 0000000..3080665
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/dotdot.js
@@ -0,0 +1,29 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('dotdot', function (t) {
+    t.plan(4);
+    var dir = path.join(__dirname, '/dotdot/abc');
+
+    resolve('..', { basedir: dir }, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(__dirname, 'dotdot/index.js'));
+    });
+
+    resolve('.', { basedir: dir }, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, 'index.js'));
+    });
+});
+
+test('dotdot sync', function (t) {
+    t.plan(2);
+    var dir = path.join(__dirname, '/dotdot/abc');
+
+    var a = resolve.sync('..', { basedir: dir });
+    t.equal(a, path.join(__dirname, 'dotdot/index.js'));
+
+    var b = resolve.sync('.', { basedir: dir });
+    t.equal(b, path.join(dir, 'index.js'));
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/dotdot/abc/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/dotdot/abc/index.js
new file mode 100644
index 0000000..67f2534
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/dotdot/abc/index.js
@@ -0,0 +1,2 @@
+var x = require('..');
+console.log(x);
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/dotdot/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/dotdot/index.js
new file mode 100644
index 0000000..643f9fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/dotdot/index.js
@@ -0,0 +1 @@
+module.exports = 'whatever';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/faulty_basedir.js b/node_modules/mathjs/examples/node_modules/resolve/test/faulty_basedir.js
new file mode 100644
index 0000000..5f2141a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/faulty_basedir.js
@@ -0,0 +1,29 @@
+var test = require('tape');
+var path = require('path');
+var resolve = require('../');
+
+test('faulty basedir must produce error in windows', { skip: process.platform !== 'win32' }, function (t) {
+    t.plan(1);
+
+    var resolverDir = 'C:\\a\\b\\c\\d';
+
+    resolve('tape/lib/test.js', { basedir: resolverDir }, function (err, res, pkg) {
+        t.equal(!!err, true);
+    });
+});
+
+test('non-existent basedir should not throw when preserveSymlinks is false', function (t) {
+    t.plan(2);
+
+    var opts = {
+        basedir: path.join(path.sep, 'unreal', 'path', 'that', 'does', 'not', 'exist'),
+        preserveSymlinks: false
+    };
+
+    var module = './dotdot/abc';
+
+    resolve(module, opts, function (err, res) {
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+        t.equal(res, undefined);
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/filter.js b/node_modules/mathjs/examples/node_modules/resolve/test/filter.js
new file mode 100644
index 0000000..8f8cccd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/filter.js
@@ -0,0 +1,34 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('filter', function (t) {
+    t.plan(4);
+    var dir = path.join(__dirname, 'resolver');
+    var packageFilterArgs;
+    resolve('./baz', {
+        basedir: dir,
+        packageFilter: function (pkg, pkgfile) {
+            pkg.main = 'doom'; // eslint-disable-line no-param-reassign
+            packageFilterArgs = [pkg, pkgfile];
+            return pkg;
+        }
+    }, function (err, res, pkg) {
+        if (err) t.fail(err);
+
+        t.equal(res, path.join(dir, 'baz/doom.js'), 'changing the package "main" works');
+
+        var packageData = packageFilterArgs[0];
+        t.equal(pkg, packageData, 'first packageFilter argument is "pkg"');
+        t.equal(packageData.main, 'doom', 'package "main" was altered');
+
+        var packageFile = packageFilterArgs[1];
+        t.equal(
+            packageFile,
+            path.join(dir, 'baz/package.json'),
+            'second packageFilter argument is "pkgfile"'
+        );
+
+        t.end();
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/filter_sync.js b/node_modules/mathjs/examples/node_modules/resolve/test/filter_sync.js
new file mode 100644
index 0000000..8a43b98
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/filter_sync.js
@@ -0,0 +1,33 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('filter', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+    var packageFilterArgs;
+    var res = resolve.sync('./baz', {
+        basedir: dir,
+        // NOTE: in v2.x, this will be `pkg, pkgfile, dir`, but must remain "broken" here in v1.x for compatibility
+        packageFilter: function (pkg, /*pkgfile,*/ dir) { // eslint-disable-line spaced-comment
+            pkg.main = 'doom'; // eslint-disable-line no-param-reassign
+            packageFilterArgs = 'is 1.x' ? [pkg, dir] : [pkg, pkgfile, dir]; // eslint-disable-line no-constant-condition, no-undef
+            return pkg;
+        }
+    });
+
+    t.equal(res, path.join(dir, 'baz/doom.js'), 'changing the package "main" works');
+
+    var packageData = packageFilterArgs[0];
+    t.equal(packageData.main, 'doom', 'package "main" was altered');
+
+    if (!'is 1.x') { // eslint-disable-line no-constant-condition
+        var packageFile = packageFilterArgs[1];
+        t.equal(packageFile, path.join(dir, 'baz', 'package.json'), 'package.json path is correct');
+    }
+
+    var packageDir = packageFilterArgs['is 1.x' ? 1 : 2]; // eslint-disable-line no-constant-condition
+    // eslint-disable-next-line no-constant-condition
+    t.equal(packageDir, path.join(dir, 'baz'), ('is 1.x' ? 'second' : 'third') + ' packageFilter argument is "dir"');
+
+    t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/home_paths.js b/node_modules/mathjs/examples/node_modules/resolve/test/home_paths.js
new file mode 100644
index 0000000..3b8c9b3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/home_paths.js
@@ -0,0 +1,127 @@
+'use strict';
+
+var fs = require('fs');
+var homedir = require('../lib/homedir');
+var path = require('path');
+
+var test = require('tape');
+var mkdirp = require('mkdirp');
+var rimraf = require('rimraf');
+var mv = require('mv');
+var copyDir = require('copy-dir');
+var tmp = require('tmp');
+
+var HOME = homedir();
+
+var hnm = path.join(HOME, '.node_modules');
+var hnl = path.join(HOME, '.node_libraries');
+
+var resolve = require('../async');
+
+function makeDir(t, dir, cb) {
+    mkdirp(dir, function (err) {
+        if (err) {
+            cb(err);
+        } else {
+            t.teardown(function cleanup() {
+                rimraf.sync(dir);
+            });
+            cb();
+        }
+    });
+}
+
+function makeTempDir(t, dir, cb) {
+    if (fs.existsSync(dir)) {
+        var tmpResult = tmp.dirSync();
+        t.teardown(tmpResult.removeCallback);
+        var backup = path.join(tmpResult.name, path.basename(dir));
+        mv(dir, backup, function (err) {
+            if (err) {
+                cb(err);
+            } else {
+                t.teardown(function () {
+                    mv(backup, dir, cb);
+                });
+                makeDir(t, dir, cb);
+            }
+        });
+    } else {
+        makeDir(t, dir, cb);
+    }
+}
+
+test('homedir module paths', function (t) {
+    t.plan(7);
+
+    makeTempDir(t, hnm, function (err) {
+        t.error(err, 'no error with HNM temp dir');
+        if (err) {
+            return t.end();
+        }
+
+        var bazHNMDir = path.join(hnm, 'baz');
+        var dotMainDir = path.join(hnm, 'dot_main');
+        copyDir.sync(path.join(__dirname, 'resolver/baz'), bazHNMDir);
+        copyDir.sync(path.join(__dirname, 'resolver/dot_main'), dotMainDir);
+
+        var bazPkg = { name: 'baz', main: 'quux.js' };
+        var dotMainPkg = { main: 'index' };
+
+        var bazHNMmain = path.join(bazHNMDir, 'quux.js');
+        t.equal(require.resolve('baz'), bazHNMmain, 'sanity check: require.resolve finds HNM `baz`');
+        var dotMainMain = path.join(dotMainDir, 'index.js');
+        t.equal(require.resolve('dot_main'), dotMainMain, 'sanity check: require.resolve finds `dot_main`');
+
+        makeTempDir(t, hnl, function (err) {
+            t.error(err, 'no error with HNL temp dir');
+            if (err) {
+                return t.end();
+            }
+            var bazHNLDir = path.join(hnl, 'baz');
+            copyDir.sync(path.join(__dirname, 'resolver/baz'), bazHNLDir);
+
+            var dotSlashMainDir = path.join(hnl, 'dot_slash_main');
+            var dotSlashMainMain = path.join(dotSlashMainDir, 'index.js');
+            var dotSlashMainPkg = { main: 'index' };
+            copyDir.sync(path.join(__dirname, 'resolver/dot_slash_main'), dotSlashMainDir);
+
+            t.equal(require.resolve('baz'), bazHNMmain, 'sanity check: require.resolve finds HNM `baz`');
+            t.equal(require.resolve('dot_slash_main'), dotSlashMainMain, 'sanity check: require.resolve finds HNL `dot_slash_main`');
+
+            t.test('with temp dirs', function (st) {
+                st.plan(3);
+
+                st.test('just in `$HOME/.node_modules`', function (s2t) {
+                    s2t.plan(3);
+
+                    resolve('dot_main', function (err, res, pkg) {
+                        s2t.error(err, 'no error resolving `dot_main`');
+                        s2t.equal(res, dotMainMain, '`dot_main` resolves in `$HOME/.node_modules`');
+                        s2t.deepEqual(pkg, dotMainPkg);
+                    });
+                });
+
+                st.test('just in `$HOME/.node_libraries`', function (s2t) {
+                    s2t.plan(3);
+
+                    resolve('dot_slash_main', function (err, res, pkg) {
+                        s2t.error(err, 'no error resolving `dot_slash_main`');
+                        s2t.equal(res, dotSlashMainMain, '`dot_slash_main` resolves in `$HOME/.node_libraries`');
+                        s2t.deepEqual(pkg, dotSlashMainPkg);
+                    });
+                });
+
+                st.test('in `$HOME/.node_libraries` and `$HOME/.node_modules`', function (s2t) {
+                    s2t.plan(3);
+
+                    resolve('baz', function (err, res, pkg) {
+                        s2t.error(err, 'no error resolving `baz`');
+                        s2t.equal(res, bazHNMmain, '`baz` resolves in `$HOME/.node_modules` when in both');
+                        s2t.deepEqual(pkg, bazPkg);
+                    });
+                });
+            });
+        });
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/home_paths_sync.js b/node_modules/mathjs/examples/node_modules/resolve/test/home_paths_sync.js
new file mode 100644
index 0000000..5d2c56f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/home_paths_sync.js
@@ -0,0 +1,114 @@
+'use strict';
+
+var fs = require('fs');
+var homedir = require('../lib/homedir');
+var path = require('path');
+
+var test = require('tape');
+var mkdirp = require('mkdirp');
+var rimraf = require('rimraf');
+var mv = require('mv');
+var copyDir = require('copy-dir');
+var tmp = require('tmp');
+
+var HOME = homedir();
+
+var hnm = path.join(HOME, '.node_modules');
+var hnl = path.join(HOME, '.node_libraries');
+
+var resolve = require('../sync');
+
+function makeDir(t, dir, cb) {
+    mkdirp(dir, function (err) {
+        if (err) {
+            cb(err);
+        } else {
+            t.teardown(function cleanup() {
+                rimraf.sync(dir);
+            });
+            cb();
+        }
+    });
+}
+
+function makeTempDir(t, dir, cb) {
+    if (fs.existsSync(dir)) {
+        var tmpResult = tmp.dirSync();
+        t.teardown(tmpResult.removeCallback);
+        var backup = path.join(tmpResult.name, path.basename(dir));
+        mv(dir, backup, function (err) {
+            if (err) {
+                cb(err);
+            } else {
+                t.teardown(function () {
+                    mv(backup, dir, cb);
+                });
+                makeDir(t, dir, cb);
+            }
+        });
+    } else {
+        makeDir(t, dir, cb);
+    }
+}
+
+test('homedir module paths', function (t) {
+    t.plan(7);
+
+    makeTempDir(t, hnm, function (err) {
+        t.error(err, 'no error with HNM temp dir');
+        if (err) {
+            return t.end();
+        }
+
+        var bazHNMDir = path.join(hnm, 'baz');
+        var dotMainDir = path.join(hnm, 'dot_main');
+        copyDir.sync(path.join(__dirname, 'resolver/baz'), bazHNMDir);
+        copyDir.sync(path.join(__dirname, 'resolver/dot_main'), dotMainDir);
+
+        var bazHNMmain = path.join(bazHNMDir, 'quux.js');
+        t.equal(require.resolve('baz'), bazHNMmain, 'sanity check: require.resolve finds HNM `baz`');
+        var dotMainMain = path.join(dotMainDir, 'index.js');
+        t.equal(require.resolve('dot_main'), dotMainMain, 'sanity check: require.resolve finds `dot_main`');
+
+        makeTempDir(t, hnl, function (err) {
+            t.error(err, 'no error with HNL temp dir');
+            if (err) {
+                return t.end();
+            }
+            var bazHNLDir = path.join(hnl, 'baz');
+            copyDir.sync(path.join(__dirname, 'resolver/baz'), bazHNLDir);
+
+            var dotSlashMainDir = path.join(hnl, 'dot_slash_main');
+            var dotSlashMainMain = path.join(dotSlashMainDir, 'index.js');
+            copyDir.sync(path.join(__dirname, 'resolver/dot_slash_main'), dotSlashMainDir);
+
+            t.equal(require.resolve('baz'), bazHNMmain, 'sanity check: require.resolve finds HNM `baz`');
+            t.equal(require.resolve('dot_slash_main'), dotSlashMainMain, 'sanity check: require.resolve finds HNL `dot_slash_main`');
+
+            t.test('with temp dirs', function (st) {
+                st.plan(3);
+
+                st.test('just in `$HOME/.node_modules`', function (s2t) {
+                    s2t.plan(1);
+
+                    var res = resolve('dot_main');
+                    s2t.equal(res, dotMainMain, '`dot_main` resolves in `$HOME/.node_modules`');
+                });
+
+                st.test('just in `$HOME/.node_libraries`', function (s2t) {
+                    s2t.plan(1);
+
+                    var res = resolve('dot_slash_main');
+                    s2t.equal(res, dotSlashMainMain, '`dot_slash_main` resolves in `$HOME/.node_libraries`');
+                });
+
+                st.test('in `$HOME/.node_libraries` and `$HOME/.node_modules`', function (s2t) {
+                    s2t.plan(1);
+
+                    var res = resolve('baz');
+                    s2t.equal(res, bazHNMmain, '`baz` resolves in `$HOME/.node_modules` when in both');
+                });
+            });
+        });
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/mock.js b/node_modules/mathjs/examples/node_modules/resolve/test/mock.js
new file mode 100644
index 0000000..6116275
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/mock.js
@@ -0,0 +1,315 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('mock', function (t) {
+    t.plan(8);
+
+    var files = {};
+    files[path.resolve('/foo/bar/baz.js')] = 'beep';
+
+    var dirs = {};
+    dirs[path.resolve('/foo/bar')] = true;
+
+    function opts(basedir) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file, cb) {
+                cb(null, Object.prototype.hasOwnProperty.call(files, path.resolve(file)));
+            },
+            isDirectory: function (dir, cb) {
+                cb(null, !!dirs[path.resolve(dir)]);
+            },
+            readFile: function (file, cb) {
+                cb(null, files[path.resolve(file)]);
+            },
+            realpath: function (file, cb) {
+                cb(null, file);
+            }
+        };
+    }
+
+    resolve('./baz', opts('/foo/bar'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/bar/baz.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('./baz.js', opts('/foo/bar'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/bar/baz.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('baz', opts('/foo/bar'), function (err, res) {
+        t.equal(err.message, "Cannot find module 'baz' from '" + path.resolve('/foo/bar') + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+
+    resolve('../baz', opts('/foo/bar'), function (err, res) {
+        t.equal(err.message, "Cannot find module '../baz' from '" + path.resolve('/foo/bar') + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+});
+
+test('mock from package', function (t) {
+    t.plan(8);
+
+    var files = {};
+    files[path.resolve('/foo/bar/baz.js')] = 'beep';
+
+    var dirs = {};
+    dirs[path.resolve('/foo/bar')] = true;
+
+    function opts(basedir) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file, cb) {
+                cb(null, Object.prototype.hasOwnProperty.call(files, file));
+            },
+            isDirectory: function (dir, cb) {
+                cb(null, !!dirs[path.resolve(dir)]);
+            },
+            'package': { main: 'bar' },
+            readFile: function (file, cb) {
+                cb(null, files[file]);
+            },
+            realpath: function (file, cb) {
+                cb(null, file);
+            }
+        };
+    }
+
+    resolve('./baz', opts('/foo/bar'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/bar/baz.js'));
+        t.equal(pkg && pkg.main, 'bar');
+    });
+
+    resolve('./baz.js', opts('/foo/bar'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/bar/baz.js'));
+        t.equal(pkg && pkg.main, 'bar');
+    });
+
+    resolve('baz', opts('/foo/bar'), function (err, res) {
+        t.equal(err.message, "Cannot find module 'baz' from '" + path.resolve('/foo/bar') + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+
+    resolve('../baz', opts('/foo/bar'), function (err, res) {
+        t.equal(err.message, "Cannot find module '../baz' from '" + path.resolve('/foo/bar') + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+});
+
+test('mock package', function (t) {
+    t.plan(2);
+
+    var files = {};
+    files[path.resolve('/foo/node_modules/bar/baz.js')] = 'beep';
+    files[path.resolve('/foo/node_modules/bar/package.json')] = JSON.stringify({
+        main: './baz.js'
+    });
+
+    var dirs = {};
+    dirs[path.resolve('/foo')] = true;
+    dirs[path.resolve('/foo/node_modules')] = true;
+
+    function opts(basedir) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file, cb) {
+                cb(null, Object.prototype.hasOwnProperty.call(files, path.resolve(file)));
+            },
+            isDirectory: function (dir, cb) {
+                cb(null, !!dirs[path.resolve(dir)]);
+            },
+            readFile: function (file, cb) {
+                cb(null, files[path.resolve(file)]);
+            },
+            realpath: function (file, cb) {
+                cb(null, file);
+            }
+        };
+    }
+
+    resolve('bar', opts('/foo'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/node_modules/bar/baz.js'));
+        t.equal(pkg && pkg.main, './baz.js');
+    });
+});
+
+test('mock package from package', function (t) {
+    t.plan(2);
+
+    var files = {};
+    files[path.resolve('/foo/node_modules/bar/baz.js')] = 'beep';
+    files[path.resolve('/foo/node_modules/bar/package.json')] = JSON.stringify({
+        main: './baz.js'
+    });
+
+    var dirs = {};
+    dirs[path.resolve('/foo')] = true;
+    dirs[path.resolve('/foo/node_modules')] = true;
+
+    function opts(basedir) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file, cb) {
+                cb(null, Object.prototype.hasOwnProperty.call(files, path.resolve(file)));
+            },
+            isDirectory: function (dir, cb) {
+                cb(null, !!dirs[path.resolve(dir)]);
+            },
+            'package': { main: 'bar' },
+            readFile: function (file, cb) {
+                cb(null, files[path.resolve(file)]);
+            },
+            realpath: function (file, cb) {
+                cb(null, file);
+            }
+        };
+    }
+
+    resolve('bar', opts('/foo'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/node_modules/bar/baz.js'));
+        t.equal(pkg && pkg.main, './baz.js');
+    });
+});
+
+test('symlinked', function (t) {
+    t.plan(4);
+
+    var files = {};
+    files[path.resolve('/foo/bar/baz.js')] = 'beep';
+    files[path.resolve('/foo/bar/symlinked/baz.js')] = 'beep';
+
+    var dirs = {};
+    dirs[path.resolve('/foo/bar')] = true;
+    dirs[path.resolve('/foo/bar/symlinked')] = true;
+
+    function opts(basedir) {
+        return {
+            preserveSymlinks: false,
+            basedir: path.resolve(basedir),
+            isFile: function (file, cb) {
+                cb(null, Object.prototype.hasOwnProperty.call(files, path.resolve(file)));
+            },
+            isDirectory: function (dir, cb) {
+                cb(null, !!dirs[path.resolve(dir)]);
+            },
+            readFile: function (file, cb) {
+                cb(null, files[path.resolve(file)]);
+            },
+            realpath: function (file, cb) {
+                var resolved = path.resolve(file);
+
+                if (resolved.indexOf('symlinked') >= 0) {
+                    cb(null, resolved);
+                    return;
+                }
+
+                var ext = path.extname(resolved);
+
+                if (ext) {
+                    var dir = path.dirname(resolved);
+                    var base = path.basename(resolved);
+                    cb(null, path.join(dir, 'symlinked', base));
+                } else {
+                    cb(null, path.join(resolved, 'symlinked'));
+                }
+            }
+        };
+    }
+
+    resolve('./baz', opts('/foo/bar'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/bar/symlinked/baz.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('./baz.js', opts('/foo/bar'), function (err, res, pkg) {
+        if (err) return t.fail(err);
+        t.equal(res, path.resolve('/foo/bar/symlinked/baz.js'));
+        t.equal(pkg, undefined);
+    });
+});
+
+test('readPackage', function (t) {
+    t.plan(3);
+
+    var files = {};
+    files[path.resolve('/foo/node_modules/bar/something-else.js')] = 'beep';
+    files[path.resolve('/foo/node_modules/bar/package.json')] = JSON.stringify({
+        main: './baz.js'
+    });
+    files[path.resolve('/foo/node_modules/bar/baz.js')] = 'boop';
+
+    var dirs = {};
+    dirs[path.resolve('/foo')] = true;
+    dirs[path.resolve('/foo/node_modules')] = true;
+
+    function opts(basedir) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file, cb) {
+                cb(null, Object.prototype.hasOwnProperty.call(files, path.resolve(file)));
+            },
+            isDirectory: function (dir, cb) {
+                cb(null, !!dirs[path.resolve(dir)]);
+            },
+            'package': { main: 'bar' },
+            readFile: function (file, cb) {
+                cb(null, files[path.resolve(file)]);
+            },
+            realpath: function (file, cb) {
+                cb(null, file);
+            }
+        };
+    }
+
+    t.test('with readFile', function (st) {
+        st.plan(3);
+
+        resolve('bar', opts('/foo'), function (err, res, pkg) {
+            st.error(err);
+            st.equal(res, path.resolve('/foo/node_modules/bar/baz.js'));
+            st.equal(pkg && pkg.main, './baz.js');
+        });
+    });
+
+    var readPackage = function (readFile, file, cb) {
+        var barPackage = path.join('bar', 'package.json');
+        if (file.slice(-barPackage.length) === barPackage) {
+            cb(null, { main: './something-else.js' });
+        } else {
+            cb(null, JSON.parse(files[path.resolve(file)]));
+        }
+    };
+
+    t.test('with readPackage', function (st) {
+        st.plan(3);
+
+        var options = opts('/foo');
+        delete options.readFile;
+        options.readPackage = readPackage;
+        resolve('bar', options, function (err, res, pkg) {
+            st.error(err);
+            st.equal(res, path.resolve('/foo/node_modules/bar/something-else.js'));
+            st.equal(pkg && pkg.main, './something-else.js');
+        });
+    });
+
+    t.test('with readFile and readPackage', function (st) {
+        st.plan(1);
+
+        var options = opts('/foo');
+        options.readPackage = readPackage;
+        resolve('bar', options, function (err) {
+            st.throws(function () { throw err; }, TypeError, 'errors when both readFile and readPackage are provided');
+        });
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/mock_sync.js b/node_modules/mathjs/examples/node_modules/resolve/test/mock_sync.js
new file mode 100644
index 0000000..c5a7e2a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/mock_sync.js
@@ -0,0 +1,214 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('mock', function (t) {
+    t.plan(4);
+
+    var files = {};
+    files[path.resolve('/foo/bar/baz.js')] = 'beep';
+
+    var dirs = {};
+    dirs[path.resolve('/foo/bar')] = true;
+
+    function opts(basedir) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file) {
+                return Object.prototype.hasOwnProperty.call(files, path.resolve(file));
+            },
+            isDirectory: function (dir) {
+                return !!dirs[path.resolve(dir)];
+            },
+            readFileSync: function (file) {
+                return files[path.resolve(file)];
+            },
+            realpathSync: function (file) {
+                return file;
+            }
+        };
+    }
+
+    t.equal(
+        resolve.sync('./baz', opts('/foo/bar')),
+        path.resolve('/foo/bar/baz.js')
+    );
+
+    t.equal(
+        resolve.sync('./baz.js', opts('/foo/bar')),
+        path.resolve('/foo/bar/baz.js')
+    );
+
+    t.throws(function () {
+        resolve.sync('baz', opts('/foo/bar'));
+    });
+
+    t.throws(function () {
+        resolve.sync('../baz', opts('/foo/bar'));
+    });
+});
+
+test('mock package', function (t) {
+    t.plan(1);
+
+    var files = {};
+    files[path.resolve('/foo/node_modules/bar/baz.js')] = 'beep';
+    files[path.resolve('/foo/node_modules/bar/package.json')] = JSON.stringify({
+        main: './baz.js'
+    });
+
+    var dirs = {};
+    dirs[path.resolve('/foo')] = true;
+    dirs[path.resolve('/foo/node_modules')] = true;
+
+    function opts(basedir) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file) {
+                return Object.prototype.hasOwnProperty.call(files, path.resolve(file));
+            },
+            isDirectory: function (dir) {
+                return !!dirs[path.resolve(dir)];
+            },
+            readFileSync: function (file) {
+                return files[path.resolve(file)];
+            },
+            realpathSync: function (file) {
+                return file;
+            }
+        };
+    }
+
+    t.equal(
+        resolve.sync('bar', opts('/foo')),
+        path.resolve('/foo/node_modules/bar/baz.js')
+    );
+});
+
+test('symlinked', function (t) {
+    t.plan(2);
+
+    var files = {};
+    files[path.resolve('/foo/bar/baz.js')] = 'beep';
+    files[path.resolve('/foo/bar/symlinked/baz.js')] = 'beep';
+
+    var dirs = {};
+    dirs[path.resolve('/foo/bar')] = true;
+    dirs[path.resolve('/foo/bar/symlinked')] = true;
+
+    function opts(basedir) {
+        return {
+            preserveSymlinks: false,
+            basedir: path.resolve(basedir),
+            isFile: function (file) {
+                return Object.prototype.hasOwnProperty.call(files, path.resolve(file));
+            },
+            isDirectory: function (dir) {
+                return !!dirs[path.resolve(dir)];
+            },
+            readFileSync: function (file) {
+                return files[path.resolve(file)];
+            },
+            realpathSync: function (file) {
+                var resolved = path.resolve(file);
+
+                if (resolved.indexOf('symlinked') >= 0) {
+                    return resolved;
+                }
+
+                var ext = path.extname(resolved);
+
+                if (ext) {
+                    var dir = path.dirname(resolved);
+                    var base = path.basename(resolved);
+                    return path.join(dir, 'symlinked', base);
+                }
+                return path.join(resolved, 'symlinked');
+            }
+        };
+    }
+
+    t.equal(
+        resolve.sync('./baz', opts('/foo/bar')),
+        path.resolve('/foo/bar/symlinked/baz.js')
+    );
+
+    t.equal(
+        resolve.sync('./baz.js', opts('/foo/bar')),
+        path.resolve('/foo/bar/symlinked/baz.js')
+    );
+});
+
+test('readPackageSync', function (t) {
+    t.plan(3);
+
+    var files = {};
+    files[path.resolve('/foo/node_modules/bar/something-else.js')] = 'beep';
+    files[path.resolve('/foo/node_modules/bar/package.json')] = JSON.stringify({
+        main: './baz.js'
+    });
+    files[path.resolve('/foo/node_modules/bar/baz.js')] = 'boop';
+
+    var dirs = {};
+    dirs[path.resolve('/foo')] = true;
+    dirs[path.resolve('/foo/node_modules')] = true;
+
+    function opts(basedir, useReadPackage) {
+        return {
+            basedir: path.resolve(basedir),
+            isFile: function (file) {
+                return Object.prototype.hasOwnProperty.call(files, path.resolve(file));
+            },
+            isDirectory: function (dir) {
+                return !!dirs[path.resolve(dir)];
+            },
+            readFileSync: useReadPackage ? null : function (file) {
+                return files[path.resolve(file)];
+            },
+            realpathSync: function (file) {
+                return file;
+            }
+        };
+    }
+    t.test('with readFile', function (st) {
+        st.plan(1);
+
+        st.equal(
+            resolve.sync('bar', opts('/foo')),
+            path.resolve('/foo/node_modules/bar/baz.js')
+        );
+    });
+
+    var readPackageSync = function (readFileSync, file) {
+        if (file.indexOf(path.join('bar', 'package.json')) >= 0) {
+            return { main: './something-else.js' };
+        }
+        return JSON.parse(files[path.resolve(file)]);
+    };
+
+    t.test('with readPackage', function (st) {
+        st.plan(1);
+
+        var options = opts('/foo');
+        delete options.readFileSync;
+        options.readPackageSync = readPackageSync;
+
+        st.equal(
+            resolve.sync('bar', options),
+            path.resolve('/foo/node_modules/bar/something-else.js')
+        );
+    });
+
+    t.test('with readFile and readPackage', function (st) {
+        st.plan(1);
+
+        var options = opts('/foo');
+        options.readPackageSync = readPackageSync;
+        st.throws(
+            function () { resolve.sync('bar', options); },
+            TypeError,
+            'errors when both readFile and readPackage are provided'
+        );
+    });
+});
+
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/module_dir.js b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir.js
new file mode 100644
index 0000000..b50e5bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir.js
@@ -0,0 +1,56 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('moduleDirectory strings', function (t) {
+    t.plan(4);
+    var dir = path.join(__dirname, 'module_dir');
+    var xopts = {
+        basedir: dir,
+        moduleDirectory: 'xmodules'
+    };
+    resolve('aaa', xopts, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, '/xmodules/aaa/index.js'));
+    });
+
+    var yopts = {
+        basedir: dir,
+        moduleDirectory: 'ymodules'
+    };
+    resolve('aaa', yopts, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, '/ymodules/aaa/index.js'));
+    });
+});
+
+test('moduleDirectory array', function (t) {
+    t.plan(6);
+    var dir = path.join(__dirname, 'module_dir');
+    var aopts = {
+        basedir: dir,
+        moduleDirectory: ['xmodules', 'ymodules', 'zmodules']
+    };
+    resolve('aaa', aopts, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, '/xmodules/aaa/index.js'));
+    });
+
+    var bopts = {
+        basedir: dir,
+        moduleDirectory: ['zmodules', 'ymodules', 'xmodules']
+    };
+    resolve('aaa', bopts, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, '/ymodules/aaa/index.js'));
+    });
+
+    var copts = {
+        basedir: dir,
+        moduleDirectory: ['xmodules', 'ymodules', 'zmodules']
+    };
+    resolve('bbb', copts, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, '/zmodules/bbb/main.js'));
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/xmodules/aaa/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/xmodules/aaa/index.js
new file mode 100644
index 0000000..dd7cf7b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/xmodules/aaa/index.js
@@ -0,0 +1 @@
+module.exports = function (x) { return x * 100; };
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/ymodules/aaa/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/ymodules/aaa/index.js
new file mode 100644
index 0000000..ef2d4d4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/ymodules/aaa/index.js
@@ -0,0 +1 @@
+module.exports = function (x) { return x + 100; };
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/zmodules/bbb/main.js b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/zmodules/bbb/main.js
new file mode 100644
index 0000000..e8ba629
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/zmodules/bbb/main.js
@@ -0,0 +1 @@
+module.exports = function (n) { return n * 111; };
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/zmodules/bbb/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/zmodules/bbb/package.json
new file mode 100644
index 0000000..c13b8cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/module_dir/zmodules/bbb/package.json
@@ -0,0 +1,3 @@
+{
+  "main": "main.js"
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/node-modules-paths.js b/node_modules/mathjs/examples/node_modules/resolve/test/node-modules-paths.js
new file mode 100644
index 0000000..675441d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/node-modules-paths.js
@@ -0,0 +1,143 @@
+var test = require('tape');
+var path = require('path');
+var parse = path.parse || require('path-parse');
+var keys = require('object-keys');
+
+var nodeModulesPaths = require('../lib/node-modules-paths');
+
+var verifyDirs = function verifyDirs(t, start, dirs, moduleDirectories, paths) {
+    var moduleDirs = [].concat(moduleDirectories || 'node_modules');
+    if (paths) {
+        for (var k = 0; k < paths.length; ++k) {
+            moduleDirs.push(path.basename(paths[k]));
+        }
+    }
+
+    var foundModuleDirs = {};
+    var uniqueDirs = {};
+    var parsedDirs = {};
+    for (var i = 0; i < dirs.length; ++i) {
+        var parsed = parse(dirs[i]);
+        if (!foundModuleDirs[parsed.base]) { foundModuleDirs[parsed.base] = 0; }
+        foundModuleDirs[parsed.base] += 1;
+        parsedDirs[parsed.dir] = true;
+        uniqueDirs[dirs[i]] = true;
+    }
+    t.equal(keys(parsedDirs).length >= start.split(path.sep).length, true, 'there are >= dirs than "start" has');
+    var foundModuleDirNames = keys(foundModuleDirs);
+    t.deepEqual(foundModuleDirNames, moduleDirs, 'all desired module dirs were found');
+    t.equal(keys(uniqueDirs).length, dirs.length, 'all dirs provided were unique');
+
+    var counts = {};
+    for (var j = 0; j < foundModuleDirNames.length; ++j) {
+        counts[foundModuleDirs[j]] = true;
+    }
+    t.equal(keys(counts).length, 1, 'all found module directories had the same count');
+};
+
+test('node-modules-paths', function (t) {
+    t.test('no options', function (t) {
+        var start = path.join(__dirname, 'resolver');
+        var dirs = nodeModulesPaths(start);
+
+        verifyDirs(t, start, dirs);
+
+        t.end();
+    });
+
+    t.test('empty options', function (t) {
+        var start = path.join(__dirname, 'resolver');
+        var dirs = nodeModulesPaths(start, {});
+
+        verifyDirs(t, start, dirs);
+
+        t.end();
+    });
+
+    t.test('with paths=array option', function (t) {
+        var start = path.join(__dirname, 'resolver');
+        var paths = ['a', 'b'];
+        var dirs = nodeModulesPaths(start, { paths: paths });
+
+        verifyDirs(t, start, dirs, null, paths);
+
+        t.end();
+    });
+
+    t.test('with paths=function option', function (t) {
+        var paths = function paths(request, absoluteStart, getNodeModulesDirs, opts) {
+            return getNodeModulesDirs().concat(path.join(absoluteStart, 'not node modules', request));
+        };
+
+        var start = path.join(__dirname, 'resolver');
+        var dirs = nodeModulesPaths(start, { paths: paths }, 'pkg');
+
+        verifyDirs(t, start, dirs, null, [path.join(start, 'not node modules', 'pkg')]);
+
+        t.end();
+    });
+
+    t.test('with paths=function skipping node modules resolution', function (t) {
+        var paths = function paths(request, absoluteStart, getNodeModulesDirs, opts) {
+            return [];
+        };
+        var start = path.join(__dirname, 'resolver');
+        var dirs = nodeModulesPaths(start, { paths: paths });
+        t.deepEqual(dirs, [], 'no node_modules was computed');
+        t.end();
+    });
+
+    t.test('with moduleDirectory option', function (t) {
+        var start = path.join(__dirname, 'resolver');
+        var moduleDirectory = 'not node modules';
+        var dirs = nodeModulesPaths(start, { moduleDirectory: moduleDirectory });
+
+        verifyDirs(t, start, dirs, moduleDirectory);
+
+        t.end();
+    });
+
+    t.test('with 1 moduleDirectory and paths options', function (t) {
+        var start = path.join(__dirname, 'resolver');
+        var paths = ['a', 'b'];
+        var moduleDirectory = 'not node modules';
+        var dirs = nodeModulesPaths(start, { paths: paths, moduleDirectory: moduleDirectory });
+
+        verifyDirs(t, start, dirs, moduleDirectory, paths);
+
+        t.end();
+    });
+
+    t.test('with 1+ moduleDirectory and paths options', function (t) {
+        var start = path.join(__dirname, 'resolver');
+        var paths = ['a', 'b'];
+        var moduleDirectories = ['not node modules', 'other modules'];
+        var dirs = nodeModulesPaths(start, { paths: paths, moduleDirectory: moduleDirectories });
+
+        verifyDirs(t, start, dirs, moduleDirectories, paths);
+
+        t.end();
+    });
+
+    t.test('combine paths correctly on Windows', function (t) {
+        var start = 'C:\\Users\\username\\myProject\\src';
+        var paths = [];
+        var moduleDirectories = ['node_modules', start];
+        var dirs = nodeModulesPaths(start, { paths: paths, moduleDirectory: moduleDirectories });
+
+        t.equal(dirs.indexOf(path.resolve(start)) > -1, true, 'should contain start dir');
+
+        t.end();
+    });
+
+    t.test('combine paths correctly on non-Windows', { skip: process.platform === 'win32' }, function (t) {
+        var start = '/Users/username/git/myProject/src';
+        var paths = [];
+        var moduleDirectories = ['node_modules', '/Users/username/git/myProject/src'];
+        var dirs = nodeModulesPaths(start, { paths: paths, moduleDirectory: moduleDirectories });
+
+        t.equal(dirs.indexOf(path.resolve(start)) > -1, true, 'should contain start dir');
+
+        t.end();
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/node_path.js b/node_modules/mathjs/examples/node_modules/resolve/test/node_path.js
new file mode 100644
index 0000000..e463d6c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/node_path.js
@@ -0,0 +1,70 @@
+var fs = require('fs');
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('$NODE_PATH', function (t) {
+    t.plan(8);
+
+    var isDir = function (dir, cb) {
+        if (dir === '/node_path' || dir === 'node_path/x') {
+            return cb(null, true);
+        }
+        fs.stat(dir, function (err, stat) {
+            if (!err) {
+                return cb(null, stat.isDirectory());
+            }
+            if (err.code === 'ENOENT' || err.code === 'ENOTDIR') return cb(null, false);
+            return cb(err);
+        });
+    };
+
+    resolve('aaa', {
+        paths: [
+            path.join(__dirname, '/node_path/x'),
+            path.join(__dirname, '/node_path/y')
+        ],
+        basedir: __dirname,
+        isDirectory: isDir
+    }, function (err, res) {
+        t.error(err);
+        t.equal(res, path.join(__dirname, '/node_path/x/aaa/index.js'), 'aaa resolves');
+    });
+
+    resolve('bbb', {
+        paths: [
+            path.join(__dirname, '/node_path/x'),
+            path.join(__dirname, '/node_path/y')
+        ],
+        basedir: __dirname,
+        isDirectory: isDir
+    }, function (err, res) {
+        t.error(err);
+        t.equal(res, path.join(__dirname, '/node_path/y/bbb/index.js'), 'bbb resolves');
+    });
+
+    resolve('ccc', {
+        paths: [
+            path.join(__dirname, '/node_path/x'),
+            path.join(__dirname, '/node_path/y')
+        ],
+        basedir: __dirname,
+        isDirectory: isDir
+    }, function (err, res) {
+        t.error(err);
+        t.equal(res, path.join(__dirname, '/node_path/x/ccc/index.js'), 'ccc resolves');
+    });
+
+    // ensure that relative paths still resolve against the regular `node_modules` correctly
+    resolve('tap', {
+        paths: [
+            'node_path'
+        ],
+        basedir: path.join(__dirname, 'node_path/x'),
+        isDirectory: isDir
+    }, function (err, res) {
+        var root = require('tap/package.json').main; // eslint-disable-line global-require
+        t.error(err);
+        t.equal(res, path.resolve(__dirname, '..', 'node_modules/tap', root), 'tap resolves');
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/node_path/x/aaa/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/x/aaa/index.js
new file mode 100644
index 0000000..ad70d0b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/x/aaa/index.js
@@ -0,0 +1 @@
+module.exports = 'A';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/node_path/x/ccc/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/x/ccc/index.js
new file mode 100644
index 0000000..a64132e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/x/ccc/index.js
@@ -0,0 +1 @@
+module.exports = 'C';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/node_path/y/bbb/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/y/bbb/index.js
new file mode 100644
index 0000000..4d0f32e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/y/bbb/index.js
@@ -0,0 +1 @@
+module.exports = 'B';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/node_path/y/ccc/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/y/ccc/index.js
new file mode 100644
index 0000000..793315e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/node_path/y/ccc/index.js
@@ -0,0 +1 @@
+module.exports = 'CY';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/nonstring.js b/node_modules/mathjs/examples/node_modules/resolve/test/nonstring.js
new file mode 100644
index 0000000..ef63c40
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/nonstring.js
@@ -0,0 +1,9 @@
+var test = require('tape');
+var resolve = require('../');
+
+test('nonstring', function (t) {
+    t.plan(1);
+    resolve(555, function (err, res, pkg) {
+        t.ok(err);
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/pathfilter.js b/node_modules/mathjs/examples/node_modules/resolve/test/pathfilter.js
new file mode 100644
index 0000000..16519ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/pathfilter.js
@@ -0,0 +1,75 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+var resolverDir = path.join(__dirname, '/pathfilter/deep_ref');
+
+var pathFilterFactory = function (t) {
+    return function (pkg, x, remainder) {
+        t.equal(pkg.version, '1.2.3');
+        t.equal(x, path.join(resolverDir, 'node_modules/deep/ref'));
+        t.equal(remainder, 'ref');
+        return 'alt';
+    };
+};
+
+test('#62: deep module references and the pathFilter', function (t) {
+    t.test('deep/ref.js', function (st) {
+        st.plan(3);
+
+        resolve('deep/ref', { basedir: resolverDir }, function (err, res, pkg) {
+            if (err) st.fail(err);
+
+            st.equal(pkg.version, '1.2.3');
+            st.equal(res, path.join(resolverDir, 'node_modules/deep/ref.js'));
+        });
+
+        var res = resolve.sync('deep/ref', { basedir: resolverDir });
+        st.equal(res, path.join(resolverDir, 'node_modules/deep/ref.js'));
+    });
+
+    t.test('deep/deeper/ref', function (st) {
+        st.plan(4);
+
+        resolve(
+            'deep/deeper/ref',
+            { basedir: resolverDir },
+            function (err, res, pkg) {
+                if (err) t.fail(err);
+                st.notEqual(pkg, undefined);
+                st.equal(pkg.version, '1.2.3');
+                st.equal(res, path.join(resolverDir, 'node_modules/deep/deeper/ref.js'));
+            }
+        );
+
+        var res = resolve.sync(
+            'deep/deeper/ref',
+            { basedir: resolverDir }
+        );
+        st.equal(res, path.join(resolverDir, 'node_modules/deep/deeper/ref.js'));
+    });
+
+    t.test('deep/ref alt', function (st) {
+        st.plan(8);
+
+        var pathFilter = pathFilterFactory(st);
+
+        var res = resolve.sync(
+            'deep/ref',
+            { basedir: resolverDir, pathFilter: pathFilter }
+        );
+        st.equal(res, path.join(resolverDir, 'node_modules/deep/alt.js'));
+
+        resolve(
+            'deep/ref',
+            { basedir: resolverDir, pathFilter: pathFilter },
+            function (err, res, pkg) {
+                if (err) st.fail(err);
+                st.equal(res, path.join(resolverDir, 'node_modules/deep/alt.js'));
+                st.end();
+            }
+        );
+    });
+
+    t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/pathfilter/deep_ref/main.js b/node_modules/mathjs/examples/node_modules/resolve/test/pathfilter/deep_ref/main.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/precedence.js b/node_modules/mathjs/examples/node_modules/resolve/test/precedence.js
new file mode 100644
index 0000000..2febb59
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/precedence.js
@@ -0,0 +1,23 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+
+test('precedence', function (t) {
+    t.plan(3);
+    var dir = path.join(__dirname, 'precedence/aaa');
+
+    resolve('./', { basedir: dir }, function (err, res, pkg) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, 'index.js'));
+        t.equal(pkg.name, 'resolve');
+    });
+});
+
+test('./ should not load ${dir}.js', function (t) { // eslint-disable-line no-template-curly-in-string
+    t.plan(1);
+    var dir = path.join(__dirname, 'precedence/bbb');
+
+    resolve('./', { basedir: dir }, function (err, res, pkg) {
+        t.ok(err);
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa.js b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa.js
new file mode 100644
index 0000000..b83a3e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa.js
@@ -0,0 +1 @@
+module.exports = 'wtf';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa/index.js
new file mode 100644
index 0000000..e0f8f6a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa/index.js
@@ -0,0 +1 @@
+module.exports = 'okok';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa/main.js b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa/main.js
new file mode 100644
index 0000000..93542a9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/aaa/main.js
@@ -0,0 +1 @@
+console.log(require('./'));
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/precedence/bbb.js b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/bbb.js
new file mode 100644
index 0000000..2298f47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/bbb.js
@@ -0,0 +1 @@
+module.exports = '>_<';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/precedence/bbb/main.js b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/bbb/main.js
new file mode 100644
index 0000000..716b81d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/precedence/bbb/main.js
@@ -0,0 +1 @@
+console.log(require('./')); // should throw
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver.js
new file mode 100644
index 0000000..09da686
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver.js
@@ -0,0 +1,546 @@
+var path = require('path');
+var test = require('tape');
+var resolve = require('../');
+var async = require('../async');
+
+test('`./async` entry point', function (t) {
+    t.equal(resolve, async, '`./async` entry point is the same as `main`');
+    t.end();
+});
+
+test('async foo', function (t) {
+    t.plan(12);
+    var dir = path.join(__dirname, 'resolver');
+
+    resolve('./foo', { basedir: dir }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'foo.js'));
+        t.equal(pkg && pkg.name, 'resolve');
+    });
+
+    resolve('./foo.js', { basedir: dir }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'foo.js'));
+        t.equal(pkg && pkg.name, 'resolve');
+    });
+
+    resolve('./foo', { basedir: dir, 'package': { main: 'resolver' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'foo.js'));
+        t.equal(pkg && pkg.main, 'resolver');
+    });
+
+    resolve('./foo.js', { basedir: dir, 'package': { main: 'resolver' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'foo.js'));
+        t.equal(pkg.main, 'resolver');
+    });
+
+    resolve('./foo', { basedir: dir, filename: path.join(dir, 'baz.js') }, function (err, res) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'foo.js'));
+    });
+
+    resolve('foo', { basedir: dir }, function (err) {
+        t.equal(err.message, "Cannot find module 'foo' from '" + path.resolve(dir) + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+
+    // Test that filename is reported as the "from" value when passed.
+    resolve('foo', { basedir: dir, filename: path.join(dir, 'baz.js') }, function (err) {
+        t.equal(err.message, "Cannot find module 'foo' from '" + path.join(dir, 'baz.js') + "'");
+    });
+});
+
+test('bar', function (t) {
+    t.plan(6);
+    var dir = path.join(__dirname, 'resolver');
+
+    resolve('foo', { basedir: dir + '/bar' }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'bar/node_modules/foo/index.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('foo', { basedir: dir + '/bar' }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'bar/node_modules/foo/index.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('foo', { basedir: dir + '/bar', 'package': { main: 'bar' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'bar/node_modules/foo/index.js'));
+        t.equal(pkg.main, 'bar');
+    });
+});
+
+test('baz', function (t) {
+    t.plan(4);
+    var dir = path.join(__dirname, 'resolver');
+
+    resolve('./baz', { basedir: dir }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'baz/quux.js'));
+        t.equal(pkg.main, 'quux.js');
+    });
+
+    resolve('./baz', { basedir: dir, 'package': { main: 'resolver' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'baz/quux.js'));
+        t.equal(pkg.main, 'quux.js');
+    });
+});
+
+test('biz', function (t) {
+    t.plan(24);
+    var dir = path.join(__dirname, 'resolver/biz/node_modules');
+
+    resolve('./grux', { basedir: dir }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'grux/index.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('./grux', { basedir: dir, 'package': { main: 'biz' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'grux/index.js'));
+        t.equal(pkg.main, 'biz');
+    });
+
+    resolve('./garply', { basedir: dir }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'garply/lib/index.js'));
+        t.equal(pkg.main, './lib');
+    });
+
+    resolve('./garply', { basedir: dir, 'package': { main: 'biz' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'garply/lib/index.js'));
+        t.equal(pkg.main, './lib');
+    });
+
+    resolve('tiv', { basedir: dir + '/grux' }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'tiv/index.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('tiv', { basedir: dir + '/grux', 'package': { main: 'grux' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'tiv/index.js'));
+        t.equal(pkg.main, 'grux');
+    });
+
+    resolve('tiv', { basedir: dir + '/garply' }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'tiv/index.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('tiv', { basedir: dir + '/garply', 'package': { main: './lib' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'tiv/index.js'));
+        t.equal(pkg.main, './lib');
+    });
+
+    resolve('grux', { basedir: dir + '/tiv' }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'grux/index.js'));
+        t.equal(pkg, undefined);
+    });
+
+    resolve('grux', { basedir: dir + '/tiv', 'package': { main: 'tiv' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'grux/index.js'));
+        t.equal(pkg.main, 'tiv');
+    });
+
+    resolve('garply', { basedir: dir + '/tiv' }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'garply/lib/index.js'));
+        t.equal(pkg.main, './lib');
+    });
+
+    resolve('garply', { basedir: dir + '/tiv', 'package': { main: 'tiv' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'garply/lib/index.js'));
+        t.equal(pkg.main, './lib');
+    });
+});
+
+test('quux', function (t) {
+    t.plan(2);
+    var dir = path.join(__dirname, 'resolver/quux');
+
+    resolve('./foo', { basedir: dir, 'package': { main: 'quux' } }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'foo/index.js'));
+        t.equal(pkg.main, 'quux');
+    });
+});
+
+test('normalize', function (t) {
+    t.plan(2);
+    var dir = path.join(__dirname, 'resolver/biz/node_modules/grux');
+
+    resolve('../grux', { basedir: dir }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'index.js'));
+        t.equal(pkg, undefined);
+    });
+});
+
+test('cup', function (t) {
+    t.plan(5);
+    var dir = path.join(__dirname, 'resolver');
+
+    resolve('./cup', { basedir: dir, extensions: ['.js', '.coffee'] }, function (err, res) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'cup.coffee'));
+    });
+
+    resolve('./cup.coffee', { basedir: dir }, function (err, res) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'cup.coffee'));
+    });
+
+    resolve('./cup', { basedir: dir, extensions: ['.js'] }, function (err, res) {
+        t.equal(err.message, "Cannot find module './cup' from '" + path.resolve(dir) + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+
+    // Test that filename is reported as the "from" value when passed.
+    resolve('./cup', { basedir: dir, extensions: ['.js'], filename: path.join(dir, 'cupboard.js') }, function (err, res) {
+        t.equal(err.message, "Cannot find module './cup' from '" + path.join(dir, 'cupboard.js') + "'");
+    });
+});
+
+test('mug', function (t) {
+    t.plan(3);
+    var dir = path.join(__dirname, 'resolver');
+
+    resolve('./mug', { basedir: dir }, function (err, res) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'mug.js'));
+    });
+
+    resolve('./mug', { basedir: dir, extensions: ['.coffee', '.js'] }, function (err, res) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, '/mug.coffee'));
+    });
+
+    resolve('./mug', { basedir: dir, extensions: ['.js', '.coffee'] }, function (err, res) {
+        t.equal(res, path.join(dir, '/mug.js'));
+    });
+});
+
+test('other path', function (t) {
+    t.plan(6);
+    var resolverDir = path.join(__dirname, 'resolver');
+    var dir = path.join(resolverDir, 'bar');
+    var otherDir = path.join(resolverDir, 'other_path');
+
+    resolve('root', { basedir: dir, paths: [otherDir] }, function (err, res) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(resolverDir, 'other_path/root.js'));
+    });
+
+    resolve('lib/other-lib', { basedir: dir, paths: [otherDir] }, function (err, res) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(resolverDir, 'other_path/lib/other-lib.js'));
+    });
+
+    resolve('root', { basedir: dir }, function (err, res) {
+        t.equal(err.message, "Cannot find module 'root' from '" + path.resolve(dir) + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+
+    resolve('zzz', { basedir: dir, paths: [otherDir] }, function (err, res) {
+        t.equal(err.message, "Cannot find module 'zzz' from '" + path.resolve(dir) + "'");
+        t.equal(err.code, 'MODULE_NOT_FOUND');
+    });
+});
+
+test('path iterator', function (t) {
+    t.plan(2);
+
+    var resolverDir = path.join(__dirname, 'resolver');
+
+    var exactIterator = function (x, start, getPackageCandidates, opts) {
+        return [path.join(resolverDir, x)];
+    };
+
+    resolve('baz', { packageIterator: exactIterator }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(resolverDir, 'baz/quux.js'));
+        t.equal(pkg && pkg.name, 'baz');
+    });
+});
+
+test('incorrect main', function (t) {
+    t.plan(1);
+
+    var resolverDir = path.join(__dirname, 'resolver');
+    var dir = path.join(resolverDir, 'incorrect_main');
+
+    resolve('./incorrect_main', { basedir: resolverDir }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'index.js'));
+    });
+});
+
+test('without basedir', function (t) {
+    t.plan(1);
+
+    var dir = path.join(__dirname, 'resolver/without_basedir');
+    var tester = require(path.join(dir, 'main.js')); // eslint-disable-line global-require
+
+    tester(t, function (err, res, pkg) {
+        if (err) {
+            t.fail(err);
+        } else {
+            t.equal(res, path.join(dir, 'node_modules/mymodule.js'));
+        }
+    });
+});
+
+test('#52 - incorrectly resolves module-paths like "./someFolder/" when there is a file of the same name', function (t) {
+    t.plan(2);
+
+    var dir = path.join(__dirname, 'resolver');
+
+    resolve('./foo', { basedir: path.join(dir, 'same_names') }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'same_names/foo.js'));
+    });
+
+    resolve('./foo/', { basedir: path.join(dir, 'same_names') }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'same_names/foo/index.js'));
+    });
+});
+
+test('#211 - incorrectly resolves module-paths like "." when from inside a folder with a sibling file of the same name', function (t) {
+    t.plan(2);
+
+    var dir = path.join(__dirname, 'resolver');
+
+    resolve('./', { basedir: path.join(dir, 'same_names/foo') }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'same_names/foo/index.js'));
+    });
+
+    resolve('.', { basedir: path.join(dir, 'same_names/foo') }, function (err, res, pkg) {
+        if (err) t.fail(err);
+        t.equal(res, path.join(dir, 'same_names/foo/index.js'));
+    });
+});
+
+test('async: #121 - treating an existing file as a dir when no basedir', function (t) {
+    var testFile = path.basename(__filename);
+
+    t.test('sanity check', function (st) {
+        st.plan(1);
+        resolve('./' + testFile, function (err, res, pkg) {
+            if (err) t.fail(err);
+            st.equal(res, __filename, 'sanity check');
+        });
+    });
+
+    t.test('with a fake directory', function (st) {
+        st.plan(4);
+
+        resolve('./' + testFile + '/blah', function (err, res, pkg) {
+            st.ok(err, 'there is an error');
+            st.notOk(res, 'no result');
+
+            st.equal(err && err.code, 'MODULE_NOT_FOUND', 'error code matches require.resolve');
+            st.equal(
+                err && err.message,
+                'Cannot find module \'./' + testFile + '/blah\' from \'' + __dirname + '\'',
+                'can not find nonexistent module'
+            );
+            st.end();
+        });
+    });
+
+    t.end();
+});
+
+test('async dot main', function (t) {
+    var start = new Date();
+    t.plan(3);
+    resolve('./resolver/dot_main', function (err, ret) {
+        t.notOk(err);
+        t.equal(ret, path.join(__dirname, 'resolver/dot_main/index.js'));
+        t.ok(new Date() - start < 50, 'resolve.sync timedout');
+        t.end();
+    });
+});
+
+test('async dot slash main', function (t) {
+    var start = new Date();
+    t.plan(3);
+    resolve('./resolver/dot_slash_main', function (err, ret) {
+        t.notOk(err);
+        t.equal(ret, path.join(__dirname, 'resolver/dot_slash_main/index.js'));
+        t.ok(new Date() - start < 50, 'resolve.sync timedout');
+        t.end();
+    });
+});
+
+test('not a directory', function (t) {
+    t.plan(6);
+    var path = './foo';
+    resolve(path, { basedir: __filename }, function (err, res, pkg) {
+        t.ok(err, 'a non-directory errors');
+        t.equal(arguments.length, 1);
+        t.equal(res, undefined);
+        t.equal(pkg, undefined);
+
+        t.equal(err && err.message, 'Cannot find module \'' + path + '\' from \'' + __filename + '\'');
+        t.equal(err && err.code, 'MODULE_NOT_FOUND');
+    });
+});
+
+test('non-string "main" field in package.json', function (t) {
+    t.plan(5);
+
+    var dir = path.join(__dirname, 'resolver');
+    resolve('./invalid_main', { basedir: dir }, function (err, res, pkg) {
+        t.ok(err, 'errors on non-string main');
+        t.equal(err.message, 'package “invalid_main” `main` must be a string');
+        t.equal(err.code, 'INVALID_PACKAGE_MAIN');
+        t.equal(res, undefined, 'res is undefined');
+        t.equal(pkg, undefined, 'pkg is undefined');
+    });
+});
+
+test('non-string "main" field in package.json', function (t) {
+    t.plan(5);
+
+    var dir = path.join(__dirname, 'resolver');
+    resolve('./invalid_main', { basedir: dir }, function (err, res, pkg) {
+        t.ok(err, 'errors on non-string main');
+        t.equal(err.message, 'package “invalid_main” `main` must be a string');
+        t.equal(err.code, 'INVALID_PACKAGE_MAIN');
+        t.equal(res, undefined, 'res is undefined');
+        t.equal(pkg, undefined, 'pkg is undefined');
+    });
+});
+
+test('browser field in package.json', function (t) {
+    t.plan(3);
+
+    var dir = path.join(__dirname, 'resolver');
+    resolve(
+        './browser_field',
+        {
+            basedir: dir,
+            packageFilter: function packageFilter(pkg) {
+                if (pkg.browser) {
+                    pkg.main = pkg.browser; // eslint-disable-line no-param-reassign
+                    delete pkg.browser; // eslint-disable-line no-param-reassign
+                }
+                return pkg;
+            }
+        },
+        function (err, res, pkg) {
+            if (err) t.fail(err);
+            t.equal(res, path.join(dir, 'browser_field', 'b.js'));
+            t.equal(pkg && pkg.main, 'b');
+            t.equal(pkg && pkg.browser, undefined);
+        }
+    );
+});
+
+test('absolute paths', function (t) {
+    t.plan(4);
+
+    var extensionless = __filename.slice(0, -path.extname(__filename).length);
+
+    resolve(__filename, function (err, res) {
+        t.equal(
+            res,
+            __filename,
+            'absolute path to this file resolves'
+        );
+    });
+    resolve(extensionless, function (err, res) {
+        t.equal(
+            res,
+            __filename,
+            'extensionless absolute path to this file resolves'
+        );
+    });
+    resolve(__filename, { basedir: process.cwd() }, function (err, res) {
+        t.equal(
+            res,
+            __filename,
+            'absolute path to this file with a basedir resolves'
+        );
+    });
+    resolve(extensionless, { basedir: process.cwd() }, function (err, res) {
+        t.equal(
+            res,
+            __filename,
+            'extensionless absolute path to this file with a basedir resolves'
+        );
+    });
+});
+
+test('malformed package.json', function (t) {
+    /* eslint operator-linebreak: ["error", "before"], function-paren-newline: "off" */
+    t.plan(
+        (3 * 3) // 3 sets of 3 assertions in the final callback
+        + 2 // 1 readPackage call with malformed package.json
+    );
+
+    var basedir = path.join(__dirname, 'resolver/malformed_package_json');
+    var expected = path.join(basedir, 'index.js');
+
+    resolve('./index.js', { basedir: basedir }, function (err, res, pkg) {
+        t.error(err, 'no error');
+        t.equal(res, expected, 'malformed package.json is silently ignored');
+        t.equal(pkg, undefined, 'malformed package.json gives an undefined `pkg` argument');
+    });
+
+    resolve(
+        './index.js',
+        {
+            basedir: basedir,
+            packageFilter: function (pkg, pkgfile, dir) {
+                t.fail('should not reach here');
+            }
+        },
+        function (err, res, pkg) {
+            t.error(err, 'with packageFilter: no error');
+            t.equal(res, expected, 'with packageFilter: malformed package.json is silently ignored');
+            t.equal(pkg, undefined, 'with packageFilter: malformed package.json gives an undefined `pkg` argument');
+        }
+    );
+
+    resolve(
+        './index.js',
+        {
+            basedir: basedir,
+            readPackage: function (readFile, pkgfile, cb) {
+                t.equal(pkgfile, path.join(basedir, 'package.json'), 'readPackageSync: `pkgfile` is package.json path');
+                readFile(pkgfile, function (err, result) {
+                    try {
+                        cb(null, JSON.parse(result));
+                    } catch (e) {
+                        t.ok(e instanceof SyntaxError, 'readPackage: malformed package.json parses as a syntax error');
+                        cb(null);
+                    }
+                });
+            }
+        },
+        function (err, res, pkg) {
+            t.error(err, 'with readPackage: no error');
+            t.equal(res, expected, 'with readPackage: malformed package.json is silently ignored');
+            t.equal(pkg, undefined, 'with readPackage: malformed package.json gives an undefined `pkg` argument');
+        }
+    );
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/doom.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/doom.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/package.json
new file mode 100644
index 0000000..2f77720
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/package.json
@@ -0,0 +1,4 @@
+{
+    "name": "baz",
+    "main": "quux.js"
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/quux.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/quux.js
new file mode 100644
index 0000000..bd816ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/baz/quux.js
@@ -0,0 +1 @@
+module.exports = 1;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/browser_field/a.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/browser_field/a.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/browser_field/b.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/browser_field/b.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/browser_field/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/browser_field/package.json
new file mode 100644
index 0000000..bf406f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/browser_field/package.json
@@ -0,0 +1,5 @@
+{
+  "name": "browser_field",
+  "main": "a",
+  "browser": "b"
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/cup.coffee b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/cup.coffee
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/cup.coffee
@@ -0,0 +1 @@
+
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_main/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_main/index.js
new file mode 100644
index 0000000..bd816ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_main/index.js
@@ -0,0 +1 @@
+module.exports = 1;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_main/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_main/package.json
new file mode 100644
index 0000000..d7f4fc8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_main/package.json
@@ -0,0 +1,3 @@
+{
+    "main": "."
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_slash_main/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_slash_main/index.js
new file mode 100644
index 0000000..bd816ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_slash_main/index.js
@@ -0,0 +1 @@
+module.exports = 1;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_slash_main/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_slash_main/package.json
new file mode 100644
index 0000000..f51287b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/dot_slash_main/package.json
@@ -0,0 +1,3 @@
+{
+    "main": "./"
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/foo.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/foo.js
new file mode 100644
index 0000000..bd816ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/foo.js
@@ -0,0 +1 @@
+module.exports = 1;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/incorrect_main/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/incorrect_main/index.js
new file mode 100644
index 0000000..bc1fb0a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/incorrect_main/index.js
@@ -0,0 +1,2 @@
+// this is the actual main file 'index.js', not 'wrong.js' like the package.json would indicate
+module.exports = 1;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/incorrect_main/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/incorrect_main/package.json
new file mode 100644
index 0000000..b718804
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/incorrect_main/package.json
@@ -0,0 +1,3 @@
+{
+    "main": "wrong.js"
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/invalid_main/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/invalid_main/package.json
new file mode 100644
index 0000000..0590748
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/invalid_main/package.json
@@ -0,0 +1,7 @@
+{
+  "name": "invalid_main",
+  "main": [
+    "why is this a thing",
+    "srsly omg wtf"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/malformed_package_json/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/malformed_package_json/index.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/malformed_package_json/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/malformed_package_json/package.json
new file mode 100644
index 0000000..98232c6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/malformed_package_json/package.json
@@ -0,0 +1 @@
+{
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/mug.coffee b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/mug.coffee
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/mug.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/mug.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/lerna.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/lerna.json
new file mode 100644
index 0000000..d6707ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/lerna.json
@@ -0,0 +1,6 @@
+{
+  "packages": [
+    "packages/*"
+  ],
+  "version": "0.0.0"
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/package.json
new file mode 100644
index 0000000..8508f9d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/package.json
@@ -0,0 +1,20 @@
+{
+  "name": "monorepo-symlink-test",
+  "private": true,
+  "version": "0.0.0",
+  "description": "",
+  "main": "index.js",
+  "scripts": {
+    "postinstall": "lerna bootstrap",
+    "test": "node packages/package-a"
+  },
+  "author": "",
+  "license": "MIT",
+  "dependencies": {
+    "jquery": "^3.3.1",
+    "resolve": "../../../"
+  },
+  "devDependencies": {
+    "lerna": "^3.4.3"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-a/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-a/index.js
new file mode 100644
index 0000000..8875a32
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-a/index.js
@@ -0,0 +1,35 @@
+'use strict';
+
+var assert = require('assert');
+var path = require('path');
+var resolve = require('resolve');
+
+var basedir = __dirname + '/node_modules/@my-scope/package-b';
+
+var expected = path.join(__dirname, '../../node_modules/jquery/dist/jquery.js');
+
+/*
+ * preserveSymlinks === false
+ * will search NPM package from
+ * - packages/package-b/node_modules
+ * - packages/node_modules
+ * - node_modules
+ */
+assert.equal(resolve.sync('jquery', { basedir: basedir, preserveSymlinks: false }), expected);
+assert.equal(resolve.sync('../../node_modules/jquery', { basedir: basedir, preserveSymlinks: false }), expected);
+
+/*
+ * preserveSymlinks === true
+ * will search NPM package from
+ * - packages/package-a/node_modules/@my-scope/packages/package-b/node_modules
+ * - packages/package-a/node_modules/@my-scope/packages/node_modules
+ * - packages/package-a/node_modules/@my-scope/node_modules
+ * - packages/package-a/node_modules/node_modules
+ * - packages/package-a/node_modules
+ * - packages/node_modules
+ * - node_modules
+ */
+assert.equal(resolve.sync('jquery', { basedir: basedir, preserveSymlinks: true }), expected);
+assert.equal(resolve.sync('../../../../../node_modules/jquery', { basedir: basedir, preserveSymlinks: true }), expected);
+
+console.log(' * all monorepo paths successfully resolved through symlinks');
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-a/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-a/package.json
new file mode 100644
index 0000000..204de51
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-a/package.json
@@ -0,0 +1,14 @@
+{
+  "name": "@my-scope/package-a",
+  "version": "0.0.0",
+  "private": true,
+  "description": "",
+  "license": "MIT",
+  "main": "index.js",
+  "scripts": {
+    "test": "echo \"Error: run tests from root\" && exit 1"
+  },
+  "dependencies": {
+    "@my-scope/package-b": "^0.0.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-b/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-b/index.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-b/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-b/package.json
new file mode 100644
index 0000000..f57c3b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/multirepo/packages/package-b/package.json
@@ -0,0 +1,14 @@
+{
+  "name": "@my-scope/package-b",
+  "private": true,
+  "version": "0.0.0",
+  "description": "",
+  "license": "MIT",
+  "main": "index.js",
+  "scripts": {
+    "test": "echo \"Error: run tests from root\" && exit 1"
+  },
+  "dependencies": {
+    "@my-scope/package-a": "^0.0.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/async.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/async.js
new file mode 100644
index 0000000..9b4846a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/async.js
@@ -0,0 +1,26 @@
+var a = require.resolve('buffer/').replace(process.cwd(), '$CWD');
+var b;
+var c;
+
+var test = function test() {
+    console.log(a, ': require.resolve, preserveSymlinks ' + (process.execArgv.indexOf('preserve-symlinks') > -1 ? 'true' : 'false'));
+    console.log(b, ': preserveSymlinks true');
+    console.log(c, ': preserveSymlinks false');
+
+    if (a !== b && a !== c) {
+        throw 'async: no match';
+    }
+    console.log('async: success! a matched either b or c\n');
+};
+
+require('resolve')('buffer/', { preserveSymlinks: true }, function (err, result) {
+    if (err) { throw err; }
+    b = result.replace(process.cwd(), '$CWD');
+    if (b && c) { test(); }
+});
+require('resolve')('buffer/', { preserveSymlinks: false }, function (err, result) {
+    if (err) { throw err; }
+    c = result.replace(process.cwd(), '$CWD');
+    if (b && c) { test(); }
+});
+
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/package.json
new file mode 100644
index 0000000..acfe9e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/package.json
@@ -0,0 +1,15 @@
+{
+  "name": "mylib",
+  "version": "0.0.0",
+  "description": "",
+  "private": true,
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "keywords": [],
+  "author": "",
+  "license": "ISC",
+  "dependencies": {
+    "buffer": "*"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/sync.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/sync.js
new file mode 100644
index 0000000..3283efc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/nested_symlinks/mylib/sync.js
@@ -0,0 +1,12 @@
+var a = require.resolve('buffer/').replace(process.cwd(), '$CWD');
+var b = require('resolve').sync('buffer/', { preserveSymlinks: true }).replace(process.cwd(), '$CWD');
+var c = require('resolve').sync('buffer/', { preserveSymlinks: false }).replace(process.cwd(), '$CWD');
+
+console.log(a, ': require.resolve, preserveSymlinks ' + (process.execArgv.indexOf('preserve-symlinks') > -1 ? 'true' : 'false'));
+console.log(b, ': preserveSymlinks true');
+console.log(c, ': preserveSymlinks false');
+
+if (a !== b && a !== c) {
+    throw 'sync: no match';
+}
+console.log('sync: success! a matched either b or c\n');
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/other_path/lib/other-lib.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/other_path/lib/other-lib.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/other_path/root.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/other_path/root.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/quux/foo/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/quux/foo/index.js
new file mode 100644
index 0000000..bd816ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/quux/foo/index.js
@@ -0,0 +1 @@
+module.exports = 1;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/same_names/foo.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/same_names/foo.js
new file mode 100644
index 0000000..888cae3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/same_names/foo.js
@@ -0,0 +1 @@
+module.exports = 42;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/same_names/foo/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/same_names/foo/index.js
new file mode 100644
index 0000000..bd816ea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/same_names/foo/index.js
@@ -0,0 +1 @@
+module.exports = 1;
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/_/node_modules/foo.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/_/node_modules/foo.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/_/symlink_target/.gitkeep b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/_/symlink_target/.gitkeep
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/package/bar.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/package/bar.js
new file mode 100644
index 0000000..cb1c2c0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/package/bar.js
@@ -0,0 +1 @@
+module.exports = 'bar';
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/package/package.json b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/package/package.json
new file mode 100644
index 0000000..8e1b585
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/symlinked/package/package.json
@@ -0,0 +1,3 @@
+{
+    "main": "bar.js"
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver/without_basedir/main.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/without_basedir/main.js
new file mode 100644
index 0000000..5b31975
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver/without_basedir/main.js
@@ -0,0 +1,5 @@
+var resolve = require('../../../');
+
+module.exports = function (t, cb) {
+    resolve('mymodule', null, cb);
+};
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/resolver_sync.js b/node_modules/mathjs/examples/node_modules/resolve/test/resolver_sync.js
new file mode 100644
index 0000000..6e4ae1e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/resolver_sync.js
@@ -0,0 +1,645 @@
+var path = require('path');
+var fs = require('fs');
+var test = require('tape');
+
+var resolve = require('../');
+var sync = require('../sync');
+
+var requireResolveSupportsPaths = require.resolve.length > 1
+    && (/^12\.[012]\./).test(process.version); // broken in v12.0-12.2, see https://github.com/nodejs/node/issues/27794
+
+test('`./sync` entry point', function (t) {
+    t.equal(resolve.sync, sync, '`./sync` entry point is the same as `.sync` on `main`');
+    t.end();
+});
+
+test('foo', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+
+    t.equal(
+        resolve.sync('./foo', { basedir: dir }),
+        path.join(dir, 'foo.js'),
+        './foo'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./foo', { basedir: dir }),
+            require.resolve('./foo', { paths: [dir] }),
+            './foo: resolve.sync === require.resolve'
+        );
+    }
+
+    t.equal(
+        resolve.sync('./foo.js', { basedir: dir }),
+        path.join(dir, 'foo.js'),
+        './foo.js'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./foo.js', { basedir: dir }),
+            require.resolve('./foo.js', { paths: [dir] }),
+            './foo.js: resolve.sync === require.resolve'
+        );
+    }
+
+    t.equal(
+        resolve.sync('./foo.js', { basedir: dir, filename: path.join(dir, 'bar.js') }),
+        path.join(dir, 'foo.js')
+    );
+
+    t.throws(function () {
+        resolve.sync('foo', { basedir: dir });
+    });
+
+    // Test that filename is reported as the "from" value when passed.
+    t.throws(
+        function () {
+            resolve.sync('foo', { basedir: dir, filename: path.join(dir, 'bar.js') });
+        },
+        {
+            name: 'Error',
+            message: "Cannot find module 'foo' from '" + path.join(dir, 'bar.js') + "'"
+        }
+    );
+
+    t.end();
+});
+
+test('bar', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+
+    var basedir = path.join(dir, 'bar');
+
+    t.equal(
+        resolve.sync('foo', { basedir: basedir }),
+        path.join(dir, 'bar/node_modules/foo/index.js'),
+        'foo in bar'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('foo', { basedir: basedir }),
+            require.resolve('foo', { paths: [basedir] }),
+            'foo in bar: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+test('baz', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+
+    t.equal(
+        resolve.sync('./baz', { basedir: dir }),
+        path.join(dir, 'baz/quux.js'),
+        './baz'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./baz', { basedir: dir }),
+            require.resolve('./baz', { paths: [dir] }),
+            './baz: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+test('biz', function (t) {
+    var dir = path.join(__dirname, 'resolver/biz/node_modules');
+
+    t.equal(
+        resolve.sync('./grux', { basedir: dir }),
+        path.join(dir, 'grux/index.js')
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./grux', { basedir: dir }),
+            require.resolve('./grux', { paths: [dir] }),
+            './grux: resolve.sync === require.resolve'
+        );
+    }
+
+    var tivDir = path.join(dir, 'grux');
+    t.equal(
+        resolve.sync('tiv', { basedir: tivDir }),
+        path.join(dir, 'tiv/index.js')
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('tiv', { basedir: tivDir }),
+            require.resolve('tiv', { paths: [tivDir] }),
+            'tiv: resolve.sync === require.resolve'
+        );
+    }
+
+    var gruxDir = path.join(dir, 'tiv');
+    t.equal(
+        resolve.sync('grux', { basedir: gruxDir }),
+        path.join(dir, 'grux/index.js')
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('grux', { basedir: gruxDir }),
+            require.resolve('grux', { paths: [gruxDir] }),
+            'grux: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+test('normalize', function (t) {
+    var dir = path.join(__dirname, 'resolver/biz/node_modules/grux');
+
+    t.equal(
+        resolve.sync('../grux', { basedir: dir }),
+        path.join(dir, 'index.js')
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('../grux', { basedir: dir }),
+            require.resolve('../grux', { paths: [dir] }),
+            '../grux: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+test('cup', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+
+    t.equal(
+        resolve.sync('./cup', {
+            basedir: dir,
+            extensions: ['.js', '.coffee']
+        }),
+        path.join(dir, 'cup.coffee'),
+        './cup -> ./cup.coffee'
+    );
+
+    t.equal(
+        resolve.sync('./cup.coffee', { basedir: dir }),
+        path.join(dir, 'cup.coffee'),
+        './cup.coffee'
+    );
+
+    t.throws(function () {
+        resolve.sync('./cup', {
+            basedir: dir,
+            extensions: ['.js']
+        });
+    });
+
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./cup.coffee', { basedir: dir, extensions: ['.js', '.coffee'] }),
+            require.resolve('./cup.coffee', { paths: [dir] }),
+            './cup.coffee: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+test('mug', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+
+    t.equal(
+        resolve.sync('./mug', { basedir: dir }),
+        path.join(dir, 'mug.js'),
+        './mug -> ./mug.js'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./mug', { basedir: dir }),
+            require.resolve('./mug', { paths: [dir] }),
+            './mug: resolve.sync === require.resolve'
+        );
+    }
+
+    t.equal(
+        resolve.sync('./mug', {
+            basedir: dir,
+            extensions: ['.coffee', '.js']
+        }),
+        path.join(dir, 'mug.coffee'),
+        './mug -> ./mug.coffee'
+    );
+
+    t.equal(
+        resolve.sync('./mug', {
+            basedir: dir,
+            extensions: ['.js', '.coffee']
+        }),
+        path.join(dir, 'mug.js'),
+        './mug -> ./mug.js'
+    );
+
+    t.end();
+});
+
+test('other path', function (t) {
+    var resolverDir = path.join(__dirname, 'resolver');
+    var dir = path.join(resolverDir, 'bar');
+    var otherDir = path.join(resolverDir, 'other_path');
+
+    t.equal(
+        resolve.sync('root', {
+            basedir: dir,
+            paths: [otherDir]
+        }),
+        path.join(resolverDir, 'other_path/root.js')
+    );
+
+    t.equal(
+        resolve.sync('lib/other-lib', {
+            basedir: dir,
+            paths: [otherDir]
+        }),
+        path.join(resolverDir, 'other_path/lib/other-lib.js')
+    );
+
+    t.throws(function () {
+        resolve.sync('root', { basedir: dir });
+    });
+
+    t.throws(function () {
+        resolve.sync('zzz', {
+            basedir: dir,
+            paths: [otherDir]
+        });
+    });
+
+    t.end();
+});
+
+test('path iterator', function (t) {
+    var resolverDir = path.join(__dirname, 'resolver');
+
+    var exactIterator = function (x, start, getPackageCandidates, opts) {
+        return [path.join(resolverDir, x)];
+    };
+
+    t.equal(
+        resolve.sync('baz', { packageIterator: exactIterator }),
+        path.join(resolverDir, 'baz/quux.js')
+    );
+
+    t.end();
+});
+
+test('incorrect main', function (t) {
+    var resolverDir = path.join(__dirname, 'resolver');
+    var dir = path.join(resolverDir, 'incorrect_main');
+
+    t.equal(
+        resolve.sync('./incorrect_main', { basedir: resolverDir }),
+        path.join(dir, 'index.js')
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./incorrect_main', { basedir: resolverDir }),
+            require.resolve('./incorrect_main', { paths: [resolverDir] }),
+            './incorrect_main: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+var stubStatSync = function stubStatSync(fn) {
+    var statSync = fs.statSync;
+    try {
+        fs.statSync = function () {
+            throw new EvalError('Unknown Error');
+        };
+        return fn();
+    } finally {
+        fs.statSync = statSync;
+    }
+};
+
+test('#79 - re-throw non ENOENT errors from stat', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+
+    stubStatSync(function () {
+        t.throws(function () {
+            resolve.sync('foo', { basedir: dir });
+        }, /Unknown Error/);
+    });
+
+    t.end();
+});
+
+test('#52 - incorrectly resolves module-paths like "./someFolder/" when there is a file of the same name', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+    var basedir = path.join(dir, 'same_names');
+
+    t.equal(
+        resolve.sync('./foo', { basedir: basedir }),
+        path.join(dir, 'same_names/foo.js')
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./foo', { basedir: basedir }),
+            require.resolve('./foo', { paths: [basedir] }),
+            './foo: resolve.sync === require.resolve'
+        );
+    }
+
+    t.equal(
+        resolve.sync('./foo/', { basedir: basedir }),
+        path.join(dir, 'same_names/foo/index.js')
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./foo/', { basedir: basedir }),
+            require.resolve('./foo/', { paths: [basedir] }),
+            './foo/: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+test('#211 - incorrectly resolves module-paths like "." when from inside a folder with a sibling file of the same name', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+    var basedir = path.join(dir, 'same_names/foo');
+
+    t.equal(
+        resolve.sync('./', { basedir: basedir }),
+        path.join(dir, 'same_names/foo/index.js'),
+        './'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./', { basedir: basedir }),
+            require.resolve('./', { paths: [basedir] }),
+            './: resolve.sync === require.resolve'
+        );
+    }
+
+    t.equal(
+        resolve.sync('.', { basedir: basedir }),
+        path.join(dir, 'same_names/foo/index.js'),
+        '.'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('.', { basedir: basedir }),
+            require.resolve('.', { paths: [basedir] }),
+            '.: resolve.sync === require.resolve',
+            { todo: true }
+        );
+    }
+
+    t.end();
+});
+
+test('sync: #121 - treating an existing file as a dir when no basedir', function (t) {
+    var testFile = path.basename(__filename);
+
+    t.test('sanity check', function (st) {
+        st.equal(
+            resolve.sync('./' + testFile),
+            __filename,
+            'sanity check'
+        );
+        st.equal(
+            resolve.sync('./' + testFile),
+            require.resolve('./' + testFile),
+            'sanity check: resolve.sync === require.resolve'
+        );
+
+        st.end();
+    });
+
+    t.test('with a fake directory', function (st) {
+        function run() { return resolve.sync('./' + testFile + '/blah'); }
+
+        st.throws(run, 'throws an error');
+
+        try {
+            run();
+        } catch (e) {
+            st.equal(e.code, 'MODULE_NOT_FOUND', 'error code matches require.resolve');
+            st.equal(
+                e.message,
+                'Cannot find module \'./' + testFile + '/blah\' from \'' + __dirname + '\'',
+                'can not find nonexistent module'
+            );
+        }
+
+        st.end();
+    });
+
+    t.end();
+});
+
+test('sync dot main', function (t) {
+    var start = new Date();
+
+    t.equal(
+        resolve.sync('./resolver/dot_main'),
+        path.join(__dirname, 'resolver/dot_main/index.js'),
+        './resolver/dot_main'
+    );
+    t.equal(
+        resolve.sync('./resolver/dot_main'),
+        require.resolve('./resolver/dot_main'),
+        './resolver/dot_main: resolve.sync === require.resolve'
+    );
+
+    t.ok(new Date() - start < 50, 'resolve.sync timedout');
+
+    t.end();
+});
+
+test('sync dot slash main', function (t) {
+    var start = new Date();
+
+    t.equal(
+        resolve.sync('./resolver/dot_slash_main'),
+        path.join(__dirname, 'resolver/dot_slash_main/index.js')
+    );
+    t.equal(
+        resolve.sync('./resolver/dot_slash_main'),
+        require.resolve('./resolver/dot_slash_main'),
+        './resolver/dot_slash_main: resolve.sync === require.resolve'
+    );
+
+    t.ok(new Date() - start < 50, 'resolve.sync timedout');
+
+    t.end();
+});
+
+test('not a directory', function (t) {
+    var path = './foo';
+    try {
+        resolve.sync(path, { basedir: __filename });
+        t.fail();
+    } catch (err) {
+        t.ok(err, 'a non-directory errors');
+        t.equal(err && err.message, 'Cannot find module \'' + path + "' from '" + __filename + "'");
+        t.equal(err && err.code, 'MODULE_NOT_FOUND');
+    }
+    t.end();
+});
+
+test('non-string "main" field in package.json', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+    try {
+        var result = resolve.sync('./invalid_main', { basedir: dir });
+        t.equal(result, undefined, 'result should not exist');
+        t.fail('should not get here');
+    } catch (err) {
+        t.ok(err, 'errors on non-string main');
+        t.equal(err.message, 'package “invalid_main” `main` must be a string');
+        t.equal(err.code, 'INVALID_PACKAGE_MAIN');
+    }
+    t.end();
+});
+
+test('non-string "main" field in package.json', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+    try {
+        var result = resolve.sync('./invalid_main', { basedir: dir });
+        t.equal(result, undefined, 'result should not exist');
+        t.fail('should not get here');
+    } catch (err) {
+        t.ok(err, 'errors on non-string main');
+        t.equal(err.message, 'package “invalid_main” `main` must be a string');
+        t.equal(err.code, 'INVALID_PACKAGE_MAIN');
+    }
+    t.end();
+});
+
+test('browser field in package.json', function (t) {
+    var dir = path.join(__dirname, 'resolver');
+    var res = resolve.sync('./browser_field', {
+        basedir: dir,
+        packageFilter: function packageFilter(pkg) {
+            if (pkg.browser) {
+                pkg.main = pkg.browser; // eslint-disable-line no-param-reassign
+                delete pkg.browser; // eslint-disable-line no-param-reassign
+            }
+            return pkg;
+        }
+    });
+    t.equal(res, path.join(dir, 'browser_field', 'b.js'));
+    t.end();
+});
+
+test('absolute paths', function (t) {
+    var extensionless = __filename.slice(0, -path.extname(__filename).length);
+
+    t.equal(
+        resolve.sync(__filename),
+        __filename,
+        'absolute path to this file resolves'
+    );
+    t.equal(
+        resolve.sync(__filename),
+        require.resolve(__filename),
+        'absolute path to this file: resolve.sync === require.resolve'
+    );
+
+    t.equal(
+        resolve.sync(extensionless),
+        __filename,
+        'extensionless absolute path to this file resolves'
+    );
+    t.equal(
+        resolve.sync(__filename),
+        require.resolve(__filename),
+        'absolute path to this file: resolve.sync === require.resolve'
+    );
+
+    t.equal(
+        resolve.sync(__filename, { basedir: process.cwd() }),
+        __filename,
+        'absolute path to this file with a basedir resolves'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync(__filename, { basedir: process.cwd() }),
+            require.resolve(__filename, { paths: [process.cwd()] }),
+            'absolute path to this file + basedir: resolve.sync === require.resolve'
+        );
+    }
+
+    t.equal(
+        resolve.sync(extensionless, { basedir: process.cwd() }),
+        __filename,
+        'extensionless absolute path to this file with a basedir resolves'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync(extensionless, { basedir: process.cwd() }),
+            require.resolve(extensionless, { paths: [process.cwd()] }),
+            'extensionless absolute path to this file + basedir: resolve.sync === require.resolve'
+        );
+    }
+
+    t.end();
+});
+
+test('malformed package.json', function (t) {
+    t.plan(5 + (requireResolveSupportsPaths ? 1 : 0));
+
+    var basedir = path.join(__dirname, 'resolver/malformed_package_json');
+    var expected = path.join(basedir, 'index.js');
+
+    t.equal(
+        resolve.sync('./index.js', { basedir: basedir }),
+        expected,
+        'malformed package.json is silently ignored'
+    );
+    if (requireResolveSupportsPaths) {
+        t.equal(
+            resolve.sync('./index.js', { basedir: basedir }),
+            require.resolve('./index.js', { paths: [basedir] }),
+            'malformed package.json: resolve.sync === require.resolve'
+        );
+    }
+
+    var res1 = resolve.sync(
+        './index.js',
+        {
+            basedir: basedir,
+            packageFilter: function (pkg, pkgfile, dir) {
+                t.fail('should not reach here');
+            }
+        }
+    );
+
+    t.equal(
+        res1,
+        expected,
+        'with packageFilter: malformed package.json is silently ignored'
+    );
+
+    var res2 = resolve.sync(
+        './index.js',
+        {
+            basedir: basedir,
+            readPackageSync: function (readFileSync, pkgfile) {
+                t.equal(pkgfile, path.join(basedir, 'package.json'), 'readPackageSync: `pkgfile` is package.json path');
+                var result = String(readFileSync(pkgfile));
+                try {
+                    return JSON.parse(result);
+                } catch (e) {
+                    t.ok(e instanceof SyntaxError, 'readPackageSync: malformed package.json parses as a syntax error');
+                }
+            }
+        }
+    );
+
+    t.equal(
+        res2,
+        expected,
+        'with readPackageSync: malformed package.json is silently ignored'
+    );
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/shadowed_core.js b/node_modules/mathjs/examples/node_modules/resolve/test/shadowed_core.js
new file mode 100644
index 0000000..3a5f4fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/shadowed_core.js
@@ -0,0 +1,54 @@
+var test = require('tape');
+var resolve = require('../');
+var path = require('path');
+
+test('shadowed core modules still return core module', function (t) {
+    t.plan(2);
+
+    resolve('util', { basedir: path.join(__dirname, 'shadowed_core') }, function (err, res) {
+        t.ifError(err);
+        t.equal(res, 'util');
+    });
+});
+
+test('shadowed core modules still return core module [sync]', function (t) {
+    t.plan(1);
+
+    var res = resolve.sync('util', { basedir: path.join(__dirname, 'shadowed_core') });
+
+    t.equal(res, 'util');
+});
+
+test('shadowed core modules return shadow when appending `/`', function (t) {
+    t.plan(2);
+
+    resolve('util/', { basedir: path.join(__dirname, 'shadowed_core') }, function (err, res) {
+        t.ifError(err);
+        t.equal(res, path.join(__dirname, 'shadowed_core/node_modules/util/index.js'));
+    });
+});
+
+test('shadowed core modules return shadow when appending `/` [sync]', function (t) {
+    t.plan(1);
+
+    var res = resolve.sync('util/', { basedir: path.join(__dirname, 'shadowed_core') });
+
+    t.equal(res, path.join(__dirname, 'shadowed_core/node_modules/util/index.js'));
+});
+
+test('shadowed core modules return shadow with `includeCoreModules: false`', function (t) {
+    t.plan(2);
+
+    resolve('util', { basedir: path.join(__dirname, 'shadowed_core'), includeCoreModules: false }, function (err, res) {
+        t.ifError(err);
+        t.equal(res, path.join(__dirname, 'shadowed_core/node_modules/util/index.js'));
+    });
+});
+
+test('shadowed core modules return shadow with `includeCoreModules: false` [sync]', function (t) {
+    t.plan(1);
+
+    var res = resolve.sync('util', { basedir: path.join(__dirname, 'shadowed_core'), includeCoreModules: false });
+
+    t.equal(res, path.join(__dirname, 'shadowed_core/node_modules/util/index.js'));
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/shadowed_core/node_modules/util/index.js b/node_modules/mathjs/examples/node_modules/resolve/test/shadowed_core/node_modules/util/index.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/subdirs.js b/node_modules/mathjs/examples/node_modules/resolve/test/subdirs.js
new file mode 100644
index 0000000..b7b8450
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/subdirs.js
@@ -0,0 +1,13 @@
+var test = require('tape');
+var resolve = require('../');
+var path = require('path');
+
+test('subdirs', function (t) {
+    t.plan(2);
+
+    var dir = path.join(__dirname, '/subdirs');
+    resolve('a/b/c/x.json', { basedir: dir }, function (err, res) {
+        t.ifError(err);
+        t.equal(res, path.join(dir, 'node_modules/a/b/c/x.json'));
+    });
+});
diff --git a/node_modules/mathjs/examples/node_modules/resolve/test/symlinks.js b/node_modules/mathjs/examples/node_modules/resolve/test/symlinks.js
new file mode 100644
index 0000000..35f881a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/resolve/test/symlinks.js
@@ -0,0 +1,176 @@
+var path = require('path');
+var fs = require('fs');
+var test = require('tape');
+var map = require('array.prototype.map');
+var resolve = require('../');
+
+var symlinkDir = path.join(__dirname, 'resolver', 'symlinked', 'symlink');
+var packageDir = path.join(__dirname, 'resolver', 'symlinked', '_', 'node_modules', 'package');
+var modADir = path.join(__dirname, 'symlinks', 'source', 'node_modules', 'mod-a');
+var symlinkModADir = path.join(__dirname, 'symlinks', 'dest', 'node_modules', 'mod-a');
+try {
+    fs.unlinkSync(symlinkDir);
+} catch (err) {}
+try {
+    fs.unlinkSync(packageDir);
+} catch (err) {}
+try {
+    fs.unlinkSync(modADir);
+} catch (err) {}
+try {
+    fs.unlinkSync(symlinkModADir);
+} catch (err) {}
+
+try {
+    fs.symlinkSync('./_/symlink_target', symlinkDir, 'dir');
+} catch (err) {
+    // if fails then it is probably on Windows and lets try to create a junction
+    fs.symlinkSync(path.join(__dirname, 'resolver', 'symlinked', '_', 'symlink_target') + '\\', symlinkDir, 'junction');
+}
+try {
+    fs.symlinkSync('../../package', packageDir, 'dir');
+} catch (err) {
+    // if fails then it is probably on Windows and lets try to create a junction
+    fs.symlinkSync(path.join(__dirname, '..', '..', 'package') + '\\', packageDir, 'junction');
+}
+try {
+    fs.symlinkSync('../../source/node_modules/mod-a', symlinkModADir, 'dir');
+} catch (err) {
+    // if fails then it is probably on Windows and lets try to create a junction
+    fs.symlinkSync(path.join(__dirname, '..', '..', 'source', 'node_modules', 'mod-a') + '\\', symlinkModADir, 'junction');
+}
+
+test('symlink', function (t) {
+    t.plan(2);
+
+    resolve('foo', { basedir: symlinkDir, preserveSymlinks: false }, function (err, res, pkg) {
+        t.error(err);
+        t.equal(res, path.join(__dirname, 'resolver', 'symlinked', '_', 'node_modules', 'foo.js'));
+    });
+});
+
+test('sync symlink when preserveSymlinks = true', function (t) {
+    t.plan(4);
+
+    resolve('foo', { basedir: symlinkDir }, function (err, res, pkg) {
+        t.ok(err, 'there is an error');
+        t.notOk(res, 'no result');
+
+        t.equal(err && err.code, 'MODULE_NOT_FOUND', 'error code matches require.resolve');
+        t.equal(
+            err && err.message,
+            'Cannot find module \'foo\' from \'' + symlinkDir + '\'',
+            'can not find nonexistent module'
+        );
+    });
+});
+
+test('sync symlink', function (t) {
+    var start = new Date();
+    t.doesNotThrow(function () {
+        t.equal(
+            resolve.sync('foo', { basedir: symlinkDir, preserveSymlinks: false }),
+            path.join(__dirname, 'resolver', 'symlinked', '_', 'node_modules', 'foo.js')
+        );
+    });
+    t.ok(new Date() - start < 50, 'resolve.sync timedout');
+    t.end();
+});
+
+test('sync symlink when preserveSymlinks = true', function (t) {
+    t.throws(function () {
+        resolve.sync('foo', { basedir: symlinkDir });
+    }, /Cannot find module 'foo'/);
+    t.end();
+});
+
+test('sync symlink from node_modules to other dir when preserveSymlinks = false', function (t) {
+    var basedir = path.join(__dirname, 'resolver', 'symlinked', '_');
+    var fn = resolve.sync('package', { basedir: basedir, preserveSymlinks: false });
+
+    t.equal(fn, path.resolve(__dirname, 'resolver/symlinked/package/bar.js'));
+    t.end();
+});
+
+test('async symlink from node_modules to other dir when preserveSymlinks = false', function (t) {
+    t.plan(2);
+    var basedir = path.join(__dirname, 'resolver', 'symlinked', '_');
+    resolve('package', { basedir: basedir, preserveSymlinks: false }, function (err, result) {
+        t.notOk(err, 'no error');
+        t.equal(result, path.resolve(__dirname, 'resolver/symlinked/package/bar.js'));
+    });
+});
+
+test('packageFilter', function (t) {
+    function relative(x) {
+        return path.relative(__dirname, x);
+    }
+
+    function testPackageFilter(preserveSymlinks) {
+        return function (st) {
+            st.plan('is 1.x' ? 3 : 5); // eslint-disable-line no-constant-condition
+
+            var destMain = 'symlinks/dest/node_modules/mod-a/index.js';
+            var destPkg = 'symlinks/dest/node_modules/mod-a/package.json';
+            var sourceMain = 'symlinks/source/node_modules/mod-a/index.js';
+            var sourcePkg = 'symlinks/source/node_modules/mod-a/package.json';
+            var destDir = path.join(__dirname, 'symlinks', 'dest');
+
+            /* eslint multiline-comment-style: 0 */
+            /* v2.x will restore these tests
+            var packageFilterPath = [];
+            var actualPath = resolve.sync('mod-a', {
+                basedir: destDir,
+                preserveSymlinks: preserveSymlinks,
+                packageFilter: function (pkg, pkgfile, dir) {
+                    packageFilterPath.push(pkgfile);
+                }
+            });
+            st.equal(
+                relative(actualPath),
+                path.normalize(preserveSymlinks ? destMain : sourceMain),
+                'sync: actual path is correct'
+            );
+            st.deepEqual(
+                map(packageFilterPath, relative),
+                map(preserveSymlinks ? [destPkg, destPkg] : [sourcePkg, sourcePkg], path.normalize),
+                'sync: packageFilter pkgfile arg is correct'
+            );
+            */
+
+            var asyncPackageFilterPath = [];
+            resolve(
+                'mod-a',
+                {
+                    basedir: destDir,
+                    preserveSymlinks: preserveSymlinks,
+                    packageFilter: function (pkg, pkgfile) {
+                        asyncPackageFilterPath.push(pkgfile);
+                    }
+                },
+                function (err, actualPath) {
+                    st.error(err, 'no error');
+                    st.equal(
+                        relative(actualPath),
+                        path.normalize(preserveSymlinks ? destMain : sourceMain),
+                        'async: actual path is correct'
+                    );
+                    st.deepEqual(
+                        map(asyncPackageFilterPath, relative),
+                        map(
+                            preserveSymlinks ? [destPkg, destPkg, destPkg] : [sourcePkg, sourcePkg, sourcePkg],
+                            path.normalize
+                        ),
+                        'async: packageFilter pkgfile arg is correct'
+                    );
+                }
+            );
+        };
+    }
+
+    t.test('preserveSymlinks: false', testPackageFilter(false));
+
+    t.test('preserveSymlinks: true', testPackageFilter(true));
+
+    t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/safe-buffer/LICENSE b/node_modules/mathjs/examples/node_modules/safe-buffer/LICENSE
new file mode 100644
index 0000000..0c068ce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/safe-buffer/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) Feross Aboukhadijeh
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/safe-buffer/README.md b/node_modules/mathjs/examples/node_modules/safe-buffer/README.md
new file mode 100644
index 0000000..e9a81af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/safe-buffer/README.md
@@ -0,0 +1,584 @@
+# safe-buffer [![travis][travis-image]][travis-url] [![npm][npm-image]][npm-url] [![downloads][downloads-image]][downloads-url] [![javascript style guide][standard-image]][standard-url]
+
+[travis-image]: https://img.shields.io/travis/feross/safe-buffer/master.svg
+[travis-url]: https://travis-ci.org/feross/safe-buffer
+[npm-image]: https://img.shields.io/npm/v/safe-buffer.svg
+[npm-url]: https://npmjs.org/package/safe-buffer
+[downloads-image]: https://img.shields.io/npm/dm/safe-buffer.svg
+[downloads-url]: https://npmjs.org/package/safe-buffer
+[standard-image]: https://img.shields.io/badge/code_style-standard-brightgreen.svg
+[standard-url]: https://standardjs.com
+
+#### Safer Node.js Buffer API
+
+**Use the new Node.js Buffer APIs (`Buffer.from`, `Buffer.alloc`,
+`Buffer.allocUnsafe`, `Buffer.allocUnsafeSlow`) in all versions of Node.js.**
+
+**Uses the built-in implementation when available.**
+
+## install
+
+```
+npm install safe-buffer
+```
+
+## usage
+
+The goal of this package is to provide a safe replacement for the node.js `Buffer`.
+
+It's a drop-in replacement for `Buffer`. You can use it by adding one `require` line to
+the top of your node.js modules:
+
+```js
+var Buffer = require('safe-buffer').Buffer
+
+// Existing buffer code will continue to work without issues:
+
+new Buffer('hey', 'utf8')
+new Buffer([1, 2, 3], 'utf8')
+new Buffer(obj)
+new Buffer(16) // create an uninitialized buffer (potentially unsafe)
+
+// But you can use these new explicit APIs to make clear what you want:
+
+Buffer.from('hey', 'utf8') // convert from many types to a Buffer
+Buffer.alloc(16) // create a zero-filled buffer (safe)
+Buffer.allocUnsafe(16) // create an uninitialized buffer (potentially unsafe)
+```
+
+## api
+
+### Class Method: Buffer.from(array)
+<!-- YAML
+added: v3.0.0
+-->
+
+* `array` {Array}
+
+Allocates a new `Buffer` using an `array` of octets.
+
+```js
+const buf = Buffer.from([0x62,0x75,0x66,0x66,0x65,0x72]);
+  // creates a new Buffer containing ASCII bytes
+  // ['b','u','f','f','e','r']
+```
+
+A `TypeError` will be thrown if `array` is not an `Array`.
+
+### Class Method: Buffer.from(arrayBuffer[, byteOffset[, length]])
+<!-- YAML
+added: v5.10.0
+-->
+
+* `arrayBuffer` {ArrayBuffer} The `.buffer` property of a `TypedArray` or
+  a `new ArrayBuffer()`
+* `byteOffset` {Number} Default: `0`
+* `length` {Number} Default: `arrayBuffer.length - byteOffset`
+
+When passed a reference to the `.buffer` property of a `TypedArray` instance,
+the newly created `Buffer` will share the same allocated memory as the
+TypedArray.
+
+```js
+const arr = new Uint16Array(2);
+arr[0] = 5000;
+arr[1] = 4000;
+
+const buf = Buffer.from(arr.buffer); // shares the memory with arr;
+
+console.log(buf);
+  // Prints: <Buffer 88 13 a0 0f>
+
+// changing the TypedArray changes the Buffer also
+arr[1] = 6000;
+
+console.log(buf);
+  // Prints: <Buffer 88 13 70 17>
+```
+
+The optional `byteOffset` and `length` arguments specify a memory range within
+the `arrayBuffer` that will be shared by the `Buffer`.
+
+```js
+const ab = new ArrayBuffer(10);
+const buf = Buffer.from(ab, 0, 2);
+console.log(buf.length);
+  // Prints: 2
+```
+
+A `TypeError` will be thrown if `arrayBuffer` is not an `ArrayBuffer`.
+
+### Class Method: Buffer.from(buffer)
+<!-- YAML
+added: v3.0.0
+-->
+
+* `buffer` {Buffer}
+
+Copies the passed `buffer` data onto a new `Buffer` instance.
+
+```js
+const buf1 = Buffer.from('buffer');
+const buf2 = Buffer.from(buf1);
+
+buf1[0] = 0x61;
+console.log(buf1.toString());
+  // 'auffer'
+console.log(buf2.toString());
+  // 'buffer' (copy is not changed)
+```
+
+A `TypeError` will be thrown if `buffer` is not a `Buffer`.
+
+### Class Method: Buffer.from(str[, encoding])
+<!-- YAML
+added: v5.10.0
+-->
+
+* `str` {String} String to encode.
+* `encoding` {String} Encoding to use, Default: `'utf8'`
+
+Creates a new `Buffer` containing the given JavaScript string `str`. If
+provided, the `encoding` parameter identifies the character encoding.
+If not provided, `encoding` defaults to `'utf8'`.
+
+```js
+const buf1 = Buffer.from('this is a tést');
+console.log(buf1.toString());
+  // prints: this is a tést
+console.log(buf1.toString('ascii'));
+  // prints: this is a tC)st
+
+const buf2 = Buffer.from('7468697320697320612074c3a97374', 'hex');
+console.log(buf2.toString());
+  // prints: this is a tést
+```
+
+A `TypeError` will be thrown if `str` is not a string.
+
+### Class Method: Buffer.alloc(size[, fill[, encoding]])
+<!-- YAML
+added: v5.10.0
+-->
+
+* `size` {Number}
+* `fill` {Value} Default: `undefined`
+* `encoding` {String} Default: `utf8`
+
+Allocates a new `Buffer` of `size` bytes. If `fill` is `undefined`, the
+`Buffer` will be *zero-filled*.
+
+```js
+const buf = Buffer.alloc(5);
+console.log(buf);
+  // <Buffer 00 00 00 00 00>
+```
+
+The `size` must be less than or equal to the value of
+`require('buffer').kMaxLength` (on 64-bit architectures, `kMaxLength` is
+`(2^31)-1`). Otherwise, a [`RangeError`][] is thrown. A zero-length Buffer will
+be created if a `size` less than or equal to 0 is specified.
+
+If `fill` is specified, the allocated `Buffer` will be initialized by calling
+`buf.fill(fill)`. See [`buf.fill()`][] for more information.
+
+```js
+const buf = Buffer.alloc(5, 'a');
+console.log(buf);
+  // <Buffer 61 61 61 61 61>
+```
+
+If both `fill` and `encoding` are specified, the allocated `Buffer` will be
+initialized by calling `buf.fill(fill, encoding)`. For example:
+
+```js
+const buf = Buffer.alloc(11, 'aGVsbG8gd29ybGQ=', 'base64');
+console.log(buf);
+  // <Buffer 68 65 6c 6c 6f 20 77 6f 72 6c 64>
+```
+
+Calling `Buffer.alloc(size)` can be significantly slower than the alternative
+`Buffer.allocUnsafe(size)` but ensures that the newly created `Buffer` instance
+contents will *never contain sensitive data*.
+
+A `TypeError` will be thrown if `size` is not a number.
+
+### Class Method: Buffer.allocUnsafe(size)
+<!-- YAML
+added: v5.10.0
+-->
+
+* `size` {Number}
+
+Allocates a new *non-zero-filled* `Buffer` of `size` bytes.  The `size` must
+be less than or equal to the value of `require('buffer').kMaxLength` (on 64-bit
+architectures, `kMaxLength` is `(2^31)-1`). Otherwise, a [`RangeError`][] is
+thrown. A zero-length Buffer will be created if a `size` less than or equal to
+0 is specified.
+
+The underlying memory for `Buffer` instances created in this way is *not
+initialized*. The contents of the newly created `Buffer` are unknown and
+*may contain sensitive data*. Use [`buf.fill(0)`][] to initialize such
+`Buffer` instances to zeroes.
+
+```js
+const buf = Buffer.allocUnsafe(5);
+console.log(buf);
+  // <Buffer 78 e0 82 02 01>
+  // (octets will be different, every time)
+buf.fill(0);
+console.log(buf);
+  // <Buffer 00 00 00 00 00>
+```
+
+A `TypeError` will be thrown if `size` is not a number.
+
+Note that the `Buffer` module pre-allocates an internal `Buffer` instance of
+size `Buffer.poolSize` that is used as a pool for the fast allocation of new
+`Buffer` instances created using `Buffer.allocUnsafe(size)` (and the deprecated
+`new Buffer(size)` constructor) only when `size` is less than or equal to
+`Buffer.poolSize >> 1` (floor of `Buffer.poolSize` divided by two). The default
+value of `Buffer.poolSize` is `8192` but can be modified.
+
+Use of this pre-allocated internal memory pool is a key difference between
+calling `Buffer.alloc(size, fill)` vs. `Buffer.allocUnsafe(size).fill(fill)`.
+Specifically, `Buffer.alloc(size, fill)` will *never* use the internal Buffer
+pool, while `Buffer.allocUnsafe(size).fill(fill)` *will* use the internal
+Buffer pool if `size` is less than or equal to half `Buffer.poolSize`. The
+difference is subtle but can be important when an application requires the
+additional performance that `Buffer.allocUnsafe(size)` provides.
+
+### Class Method: Buffer.allocUnsafeSlow(size)
+<!-- YAML
+added: v5.10.0
+-->
+
+* `size` {Number}
+
+Allocates a new *non-zero-filled* and non-pooled `Buffer` of `size` bytes.  The
+`size` must be less than or equal to the value of
+`require('buffer').kMaxLength` (on 64-bit architectures, `kMaxLength` is
+`(2^31)-1`). Otherwise, a [`RangeError`][] is thrown. A zero-length Buffer will
+be created if a `size` less than or equal to 0 is specified.
+
+The underlying memory for `Buffer` instances created in this way is *not
+initialized*. The contents of the newly created `Buffer` are unknown and
+*may contain sensitive data*. Use [`buf.fill(0)`][] to initialize such
+`Buffer` instances to zeroes.
+
+When using `Buffer.allocUnsafe()` to allocate new `Buffer` instances,
+allocations under 4KB are, by default, sliced from a single pre-allocated
+`Buffer`. This allows applications to avoid the garbage collection overhead of
+creating many individually allocated Buffers. This approach improves both
+performance and memory usage by eliminating the need to track and cleanup as
+many `Persistent` objects.
+
+However, in the case where a developer may need to retain a small chunk of
+memory from a pool for an indeterminate amount of time, it may be appropriate
+to create an un-pooled Buffer instance using `Buffer.allocUnsafeSlow()` then
+copy out the relevant bits.
+
+```js
+// need to keep around a few small chunks of memory
+const store = [];
+
+socket.on('readable', () => {
+  const data = socket.read();
+  // allocate for retained data
+  const sb = Buffer.allocUnsafeSlow(10);
+  // copy the data into the new allocation
+  data.copy(sb, 0, 0, 10);
+  store.push(sb);
+});
+```
+
+Use of `Buffer.allocUnsafeSlow()` should be used only as a last resort *after*
+a developer has observed undue memory retention in their applications.
+
+A `TypeError` will be thrown if `size` is not a number.
+
+### All the Rest
+
+The rest of the `Buffer` API is exactly the same as in node.js.
+[See the docs](https://nodejs.org/api/buffer.html).
+
+
+## Related links
+
+- [Node.js issue: Buffer(number) is unsafe](https://github.com/nodejs/node/issues/4660)
+- [Node.js Enhancement Proposal: Buffer.from/Buffer.alloc/Buffer.zalloc/Buffer() soft-deprecate](https://github.com/nodejs/node-eps/pull/4)
+
+## Why is `Buffer` unsafe?
+
+Today, the node.js `Buffer` constructor is overloaded to handle many different argument
+types like `String`, `Array`, `Object`, `TypedArrayView` (`Uint8Array`, etc.),
+`ArrayBuffer`, and also `Number`.
+
+The API is optimized for convenience: you can throw any type at it, and it will try to do
+what you want.
+
+Because the Buffer constructor is so powerful, you often see code like this:
+
+```js
+// Convert UTF-8 strings to hex
+function toHex (str) {
+  return new Buffer(str).toString('hex')
+}
+```
+
+***But what happens if `toHex` is called with a `Number` argument?***
+
+### Remote Memory Disclosure
+
+If an attacker can make your program call the `Buffer` constructor with a `Number`
+argument, then they can make it allocate uninitialized memory from the node.js process.
+This could potentially disclose TLS private keys, user data, or database passwords.
+
+When the `Buffer` constructor is passed a `Number` argument, it returns an
+**UNINITIALIZED** block of memory of the specified `size`. When you create a `Buffer` like
+this, you **MUST** overwrite the contents before returning it to the user.
+
+From the [node.js docs](https://nodejs.org/api/buffer.html#buffer_new_buffer_size):
+
+> `new Buffer(size)`
+>
+> - `size` Number
+>
+> The underlying memory for `Buffer` instances created in this way is not initialized.
+> **The contents of a newly created `Buffer` are unknown and could contain sensitive
+> data.** Use `buf.fill(0)` to initialize a Buffer to zeroes.
+
+(Emphasis our own.)
+
+Whenever the programmer intended to create an uninitialized `Buffer` you often see code
+like this:
+
+```js
+var buf = new Buffer(16)
+
+// Immediately overwrite the uninitialized buffer with data from another buffer
+for (var i = 0; i < buf.length; i++) {
+  buf[i] = otherBuf[i]
+}
+```
+
+
+### Would this ever be a problem in real code?
+
+Yes. It's surprisingly common to forget to check the type of your variables in a
+dynamically-typed language like JavaScript.
+
+Usually the consequences of assuming the wrong type is that your program crashes with an
+uncaught exception. But the failure mode for forgetting to check the type of arguments to
+the `Buffer` constructor is more catastrophic.
+
+Here's an example of a vulnerable service that takes a JSON payload and converts it to
+hex:
+
+```js
+// Take a JSON payload {str: "some string"} and convert it to hex
+var server = http.createServer(function (req, res) {
+  var data = ''
+  req.setEncoding('utf8')
+  req.on('data', function (chunk) {
+    data += chunk
+  })
+  req.on('end', function () {
+    var body = JSON.parse(data)
+    res.end(new Buffer(body.str).toString('hex'))
+  })
+})
+
+server.listen(8080)
+```
+
+In this example, an http client just has to send:
+
+```json
+{
+  "str": 1000
+}
+```
+
+and it will get back 1,000 bytes of uninitialized memory from the server.
+
+This is a very serious bug. It's similar in severity to the
+[the Heartbleed bug](http://heartbleed.com/) that allowed disclosure of OpenSSL process
+memory by remote attackers.
+
+
+### Which real-world packages were vulnerable?
+
+#### [`bittorrent-dht`](https://www.npmjs.com/package/bittorrent-dht)
+
+[Mathias Buus](https://github.com/mafintosh) and I
+([Feross Aboukhadijeh](http://feross.org/)) found this issue in one of our own packages,
+[`bittorrent-dht`](https://www.npmjs.com/package/bittorrent-dht). The bug would allow
+anyone on the internet to send a series of messages to a user of `bittorrent-dht` and get
+them to reveal 20 bytes at a time of uninitialized memory from the node.js process.
+
+Here's
+[the commit](https://github.com/feross/bittorrent-dht/commit/6c7da04025d5633699800a99ec3fbadf70ad35b8)
+that fixed it. We released a new fixed version, created a
+[Node Security Project disclosure](https://nodesecurity.io/advisories/68), and deprecated all
+vulnerable versions on npm so users will get a warning to upgrade to a newer version.
+
+#### [`ws`](https://www.npmjs.com/package/ws)
+
+That got us wondering if there were other vulnerable packages. Sure enough, within a short
+period of time, we found the same issue in [`ws`](https://www.npmjs.com/package/ws), the
+most popular WebSocket implementation in node.js.
+
+If certain APIs were called with `Number` parameters instead of `String` or `Buffer` as
+expected, then uninitialized server memory would be disclosed to the remote peer.
+
+These were the vulnerable methods:
+
+```js
+socket.send(number)
+socket.ping(number)
+socket.pong(number)
+```
+
+Here's a vulnerable socket server with some echo functionality:
+
+```js
+server.on('connection', function (socket) {
+  socket.on('message', function (message) {
+    message = JSON.parse(message)
+    if (message.type === 'echo') {
+      socket.send(message.data) // send back the user's message
+    }
+  })
+})
+```
+
+`socket.send(number)` called on the server, will disclose server memory.
+
+Here's [the release](https://github.com/websockets/ws/releases/tag/1.0.1) where the issue
+was fixed, with a more detailed explanation. Props to
+[Arnout Kazemier](https://github.com/3rd-Eden) for the quick fix. Here's the
+[Node Security Project disclosure](https://nodesecurity.io/advisories/67).
+
+
+### What's the solution?
+
+It's important that node.js offers a fast way to get memory otherwise performance-critical
+applications would needlessly get a lot slower.
+
+But we need a better way to *signal our intent* as programmers. **When we want
+uninitialized memory, we should request it explicitly.**
+
+Sensitive functionality should not be packed into a developer-friendly API that loosely
+accepts many different types. This type of API encourages the lazy practice of passing
+variables in without checking the type very carefully.
+
+#### A new API: `Buffer.allocUnsafe(number)`
+
+The functionality of creating buffers with uninitialized memory should be part of another
+API. We propose `Buffer.allocUnsafe(number)`. This way, it's not part of an API that
+frequently gets user input of all sorts of different types passed into it.
+
+```js
+var buf = Buffer.allocUnsafe(16) // careful, uninitialized memory!
+
+// Immediately overwrite the uninitialized buffer with data from another buffer
+for (var i = 0; i < buf.length; i++) {
+  buf[i] = otherBuf[i]
+}
+```
+
+
+### How do we fix node.js core?
+
+We sent [a PR to node.js core](https://github.com/nodejs/node/pull/4514) (merged as
+`semver-major`) which defends against one case:
+
+```js
+var str = 16
+new Buffer(str, 'utf8')
+```
+
+In this situation, it's implied that the programmer intended the first argument to be a
+string, since they passed an encoding as a second argument. Today, node.js will allocate
+uninitialized memory in the case of `new Buffer(number, encoding)`, which is probably not
+what the programmer intended.
+
+But this is only a partial solution, since if the programmer does `new Buffer(variable)`
+(without an `encoding` parameter) there's no way to know what they intended. If `variable`
+is sometimes a number, then uninitialized memory will sometimes be returned.
+
+### What's the real long-term fix?
+
+We could deprecate and remove `new Buffer(number)` and use `Buffer.allocUnsafe(number)` when
+we need uninitialized memory. But that would break 1000s of packages.
+
+~~We believe the best solution is to:~~
+
+~~1. Change `new Buffer(number)` to return safe, zeroed-out memory~~
+
+~~2. Create a new API for creating uninitialized Buffers. We propose: `Buffer.allocUnsafe(number)`~~
+
+#### Update
+
+We now support adding three new APIs:
+
+- `Buffer.from(value)` - convert from any type to a buffer
+- `Buffer.alloc(size)` - create a zero-filled buffer
+- `Buffer.allocUnsafe(size)` - create an uninitialized buffer with given size
+
+This solves the core problem that affected `ws` and `bittorrent-dht` which is
+`Buffer(variable)` getting tricked into taking a number argument.
+
+This way, existing code continues working and the impact on the npm ecosystem will be
+minimal. Over time, npm maintainers can migrate performance-critical code to use
+`Buffer.allocUnsafe(number)` instead of `new Buffer(number)`.
+
+
+### Conclusion
+
+We think there's a serious design issue with the `Buffer` API as it exists today. It
+promotes insecure software by putting high-risk functionality into a convenient API
+with friendly "developer ergonomics".
+
+This wasn't merely a theoretical exercise because we found the issue in some of the
+most popular npm packages.
+
+Fortunately, there's an easy fix that can be applied today. Use `safe-buffer` in place of
+`buffer`.
+
+```js
+var Buffer = require('safe-buffer').Buffer
+```
+
+Eventually, we hope that node.js core can switch to this new, safer behavior. We believe
+the impact on the ecosystem would be minimal since it's not a breaking change.
+Well-maintained, popular packages would be updated to use `Buffer.alloc` quickly, while
+older, insecure packages would magically become safe from this attack vector.
+
+
+## links
+
+- [Node.js PR: buffer: throw if both length and enc are passed](https://github.com/nodejs/node/pull/4514)
+- [Node Security Project disclosure for `ws`](https://nodesecurity.io/advisories/67)
+- [Node Security Project disclosure for`bittorrent-dht`](https://nodesecurity.io/advisories/68)
+
+
+## credit
+
+The original issues in `bittorrent-dht`
+([disclosure](https://nodesecurity.io/advisories/68)) and
+`ws` ([disclosure](https://nodesecurity.io/advisories/67)) were discovered by
+[Mathias Buus](https://github.com/mafintosh) and
+[Feross Aboukhadijeh](http://feross.org/).
+
+Thanks to [Adam Baldwin](https://github.com/evilpacket) for helping disclose these issues
+and for his work running the [Node Security Project](https://nodesecurity.io/).
+
+Thanks to [John Hiesey](https://github.com/jhiesey) for proofreading this README and
+auditing the code.
+
+
+## license
+
+MIT. Copyright (C) [Feross Aboukhadijeh](http://feross.org)
diff --git a/node_modules/mathjs/examples/node_modules/safe-buffer/index.d.ts b/node_modules/mathjs/examples/node_modules/safe-buffer/index.d.ts
new file mode 100644
index 0000000..e9fed80
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/safe-buffer/index.d.ts
@@ -0,0 +1,187 @@
+declare module "safe-buffer" {
+  export class Buffer {
+    length: number
+    write(string: string, offset?: number, length?: number, encoding?: string): number;
+    toString(encoding?: string, start?: number, end?: number): string;
+    toJSON(): { type: 'Buffer', data: any[] };
+    equals(otherBuffer: Buffer): boolean;
+    compare(otherBuffer: Buffer, targetStart?: number, targetEnd?: number, sourceStart?: number, sourceEnd?: number): number;
+    copy(targetBuffer: Buffer, targetStart?: number, sourceStart?: number, sourceEnd?: number): number;
+    slice(start?: number, end?: number): Buffer;
+    writeUIntLE(value: number, offset: number, byteLength: number, noAssert?: boolean): number;
+    writeUIntBE(value: number, offset: number, byteLength: number, noAssert?: boolean): number;
+    writeIntLE(value: number, offset: number, byteLength: number, noAssert?: boolean): number;
+    writeIntBE(value: number, offset: number, byteLength: number, noAssert?: boolean): number;
+    readUIntLE(offset: number, byteLength: number, noAssert?: boolean): number;
+    readUIntBE(offset: number, byteLength: number, noAssert?: boolean): number;
+    readIntLE(offset: number, byteLength: number, noAssert?: boolean): number;
+    readIntBE(offset: number, byteLength: number, noAssert?: boolean): number;
+    readUInt8(offset: number, noAssert?: boolean): number;
+    readUInt16LE(offset: number, noAssert?: boolean): number;
+    readUInt16BE(offset: number, noAssert?: boolean): number;
+    readUInt32LE(offset: number, noAssert?: boolean): number;
+    readUInt32BE(offset: number, noAssert?: boolean): number;
+    readInt8(offset: number, noAssert?: boolean): number;
+    readInt16LE(offset: number, noAssert?: boolean): number;
+    readInt16BE(offset: number, noAssert?: boolean): number;
+    readInt32LE(offset: number, noAssert?: boolean): number;
+    readInt32BE(offset: number, noAssert?: boolean): number;
+    readFloatLE(offset: number, noAssert?: boolean): number;
+    readFloatBE(offset: number, noAssert?: boolean): number;
+    readDoubleLE(offset: number, noAssert?: boolean): number;
+    readDoubleBE(offset: number, noAssert?: boolean): number;
+    swap16(): Buffer;
+    swap32(): Buffer;
+    swap64(): Buffer;
+    writeUInt8(value: number, offset: number, noAssert?: boolean): number;
+    writeUInt16LE(value: number, offset: number, noAssert?: boolean): number;
+    writeUInt16BE(value: number, offset: number, noAssert?: boolean): number;
+    writeUInt32LE(value: number, offset: number, noAssert?: boolean): number;
+    writeUInt32BE(value: number, offset: number, noAssert?: boolean): number;
+    writeInt8(value: number, offset: number, noAssert?: boolean): number;
+    writeInt16LE(value: number, offset: number, noAssert?: boolean): number;
+    writeInt16BE(value: number, offset: number, noAssert?: boolean): number;
+    writeInt32LE(value: number, offset: number, noAssert?: boolean): number;
+    writeInt32BE(value: number, offset: number, noAssert?: boolean): number;
+    writeFloatLE(value: number, offset: number, noAssert?: boolean): number;
+    writeFloatBE(value: number, offset: number, noAssert?: boolean): number;
+    writeDoubleLE(value: number, offset: number, noAssert?: boolean): number;
+    writeDoubleBE(value: number, offset: number, noAssert?: boolean): number;
+    fill(value: any, offset?: number, end?: number): this;
+    indexOf(value: string | number | Buffer, byteOffset?: number, encoding?: string): number;
+    lastIndexOf(value: string | number | Buffer, byteOffset?: number, encoding?: string): number;
+    includes(value: string | number | Buffer, byteOffset?: number, encoding?: string): boolean;
+
+    /**
+     * Allocates a new buffer containing the given {str}.
+     *
+     * @param str String to store in buffer.
+     * @param encoding encoding to use, optional.  Default is 'utf8'
+     */
+     constructor (str: string, encoding?: string);
+    /**
+     * Allocates a new buffer of {size} octets.
+     *
+     * @param size count of octets to allocate.
+     */
+    constructor (size: number);
+    /**
+     * Allocates a new buffer containing the given {array} of octets.
+     *
+     * @param array The octets to store.
+     */
+    constructor (array: Uint8Array);
+    /**
+     * Produces a Buffer backed by the same allocated memory as
+     * the given {ArrayBuffer}.
+     *
+     *
+     * @param arrayBuffer The ArrayBuffer with which to share memory.
+     */
+    constructor (arrayBuffer: ArrayBuffer);
+    /**
+     * Allocates a new buffer containing the given {array} of octets.
+     *
+     * @param array The octets to store.
+     */
+    constructor (array: any[]);
+    /**
+     * Copies the passed {buffer} data onto a new {Buffer} instance.
+     *
+     * @param buffer The buffer to copy.
+     */
+    constructor (buffer: Buffer);
+    prototype: Buffer;
+    /**
+     * Allocates a new Buffer using an {array} of octets.
+     *
+     * @param array
+     */
+    static from(array: any[]): Buffer;
+    /**
+     * When passed a reference to the .buffer property of a TypedArray instance,
+     * the newly created Buffer will share the same allocated memory as the TypedArray.
+     * The optional {byteOffset} and {length} arguments specify a memory range
+     * within the {arrayBuffer} that will be shared by the Buffer.
+     *
+     * @param arrayBuffer The .buffer property of a TypedArray or a new ArrayBuffer()
+     * @param byteOffset
+     * @param length
+     */
+    static from(arrayBuffer: ArrayBuffer, byteOffset?: number, length?: number): Buffer;
+    /**
+     * Copies the passed {buffer} data onto a new Buffer instance.
+     *
+     * @param buffer
+     */
+    static from(buffer: Buffer): Buffer;
+    /**
+     * Creates a new Buffer containing the given JavaScript string {str}.
+     * If provided, the {encoding} parameter identifies the character encoding.
+     * If not provided, {encoding} defaults to 'utf8'.
+     *
+     * @param str
+     */
+    static from(str: string, encoding?: string): Buffer;
+    /**
+     * Returns true if {obj} is a Buffer
+     *
+     * @param obj object to test.
+     */
+    static isBuffer(obj: any): obj is Buffer;
+    /**
+     * Returns true if {encoding} is a valid encoding argument.
+     * Valid string encodings in Node 0.12: 'ascii'|'utf8'|'utf16le'|'ucs2'(alias of 'utf16le')|'base64'|'binary'(deprecated)|'hex'
+     *
+     * @param encoding string to test.
+     */
+    static isEncoding(encoding: string): boolean;
+    /**
+     * Gives the actual byte length of a string. encoding defaults to 'utf8'.
+     * This is not the same as String.prototype.length since that returns the number of characters in a string.
+     *
+     * @param string string to test.
+     * @param encoding encoding used to evaluate (defaults to 'utf8')
+     */
+    static byteLength(string: string, encoding?: string): number;
+    /**
+     * Returns a buffer which is the result of concatenating all the buffers in the list together.
+     *
+     * If the list has no items, or if the totalLength is 0, then it returns a zero-length buffer.
+     * If the list has exactly one item, then the first item of the list is returned.
+     * If the list has more than one item, then a new Buffer is created.
+     *
+     * @param list An array of Buffer objects to concatenate
+     * @param totalLength Total length of the buffers when concatenated.
+     *   If totalLength is not provided, it is read from the buffers in the list. However, this adds an additional loop to the function, so it is faster to provide the length explicitly.
+     */
+    static concat(list: Buffer[], totalLength?: number): Buffer;
+    /**
+     * The same as buf1.compare(buf2).
+     */
+    static compare(buf1: Buffer, buf2: Buffer): number;
+    /**
+     * Allocates a new buffer of {size} octets.
+     *
+     * @param size count of octets to allocate.
+     * @param fill if specified, buffer will be initialized by calling buf.fill(fill).
+     *    If parameter is omitted, buffer will be filled with zeros.
+     * @param encoding encoding used for call to buf.fill while initalizing
+     */
+    static alloc(size: number, fill?: string | Buffer | number, encoding?: string): Buffer;
+    /**
+     * Allocates a new buffer of {size} octets, leaving memory not initialized, so the contents
+     * of the newly created Buffer are unknown and may contain sensitive data.
+     *
+     * @param size count of octets to allocate
+     */
+    static allocUnsafe(size: number): Buffer;
+    /**
+     * Allocates a new non-pooled buffer of {size} octets, leaving memory not initialized, so the contents
+     * of the newly created Buffer are unknown and may contain sensitive data.
+     *
+     * @param size count of octets to allocate
+     */
+    static allocUnsafeSlow(size: number): Buffer;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/safe-buffer/index.js b/node_modules/mathjs/examples/node_modules/safe-buffer/index.js
new file mode 100644
index 0000000..f8d3ec9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/safe-buffer/index.js
@@ -0,0 +1,65 @@
+/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
+/* eslint-disable node/no-deprecated-api */
+var buffer = require('buffer')
+var Buffer = buffer.Buffer
+
+// alternative to using Object.keys for old browsers
+function copyProps (src, dst) {
+  for (var key in src) {
+    dst[key] = src[key]
+  }
+}
+if (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {
+  module.exports = buffer
+} else {
+  // Copy properties from require('buffer')
+  copyProps(buffer, exports)
+  exports.Buffer = SafeBuffer
+}
+
+function SafeBuffer (arg, encodingOrOffset, length) {
+  return Buffer(arg, encodingOrOffset, length)
+}
+
+SafeBuffer.prototype = Object.create(Buffer.prototype)
+
+// Copy static methods from Buffer
+copyProps(Buffer, SafeBuffer)
+
+SafeBuffer.from = function (arg, encodingOrOffset, length) {
+  if (typeof arg === 'number') {
+    throw new TypeError('Argument must not be a number')
+  }
+  return Buffer(arg, encodingOrOffset, length)
+}
+
+SafeBuffer.alloc = function (size, fill, encoding) {
+  if (typeof size !== 'number') {
+    throw new TypeError('Argument must be a number')
+  }
+  var buf = Buffer(size)
+  if (fill !== undefined) {
+    if (typeof encoding === 'string') {
+      buf.fill(fill, encoding)
+    } else {
+      buf.fill(fill)
+    }
+  } else {
+    buf.fill(0)
+  }
+  return buf
+}
+
+SafeBuffer.allocUnsafe = function (size) {
+  if (typeof size !== 'number') {
+    throw new TypeError('Argument must be a number')
+  }
+  return Buffer(size)
+}
+
+SafeBuffer.allocUnsafeSlow = function (size) {
+  if (typeof size !== 'number') {
+    throw new TypeError('Argument must be a number')
+  }
+  return buffer.SlowBuffer(size)
+}
diff --git a/node_modules/mathjs/examples/node_modules/safe-buffer/package.json b/node_modules/mathjs/examples/node_modules/safe-buffer/package.json
new file mode 100644
index 0000000..f2869e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/safe-buffer/package.json
@@ -0,0 +1,51 @@
+{
+  "name": "safe-buffer",
+  "description": "Safer Node.js Buffer API",
+  "version": "5.2.1",
+  "author": {
+    "name": "Feross Aboukhadijeh",
+    "email": "feross@feross.org",
+    "url": "https://feross.org"
+  },
+  "bugs": {
+    "url": "https://github.com/feross/safe-buffer/issues"
+  },
+  "devDependencies": {
+    "standard": "*",
+    "tape": "^5.0.0"
+  },
+  "homepage": "https://github.com/feross/safe-buffer",
+  "keywords": [
+    "buffer",
+    "buffer allocate",
+    "node security",
+    "safe",
+    "safe-buffer",
+    "security",
+    "uninitialized"
+  ],
+  "license": "MIT",
+  "main": "index.js",
+  "types": "index.d.ts",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/feross/safe-buffer.git"
+  },
+  "scripts": {
+    "test": "standard && tape test/*.js"
+  },
+  "funding": [
+    {
+      "type": "github",
+      "url": "https://github.com/sponsors/feross"
+    },
+    {
+      "type": "patreon",
+      "url": "https://www.patreon.com/feross"
+    },
+    {
+      "type": "consulting",
+      "url": "https://feross.org/support"
+    }
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/LICENSE b/node_modules/mathjs/examples/node_modules/schema-utils/LICENSE
new file mode 100644
index 0000000..8c11fc7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/LICENSE
@@ -0,0 +1,20 @@
+Copyright JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/README.md b/node_modules/mathjs/examples/node_modules/schema-utils/README.md
new file mode 100644
index 0000000..b56ab02
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/README.md
@@ -0,0 +1,290 @@
+<div align="center">
+  <a href="http://json-schema.org">
+    <img width="160" height="160"
+      src="https://raw.githubusercontent.com/webpack-contrib/schema-utils/master/.github/assets/logo.png">
+  </a>
+  <a href="https://github.com/webpack/webpack">
+    <img width="200" height="200"
+      src="https://webpack.js.org/assets/icon-square-big.svg">
+  </a>
+</div>
+
+[![npm][npm]][npm-url]
+[![node][node]][node-url]
+[![deps][deps]][deps-url]
+[![tests][tests]][tests-url]
+[![coverage][cover]][cover-url]
+[![chat][chat]][chat-url]
+[![size][size]][size-url]
+
+# schema-utils
+
+Package for validate options in loaders and plugins.
+
+## Getting Started
+
+To begin, you'll need to install `schema-utils`:
+
+```console
+npm install schema-utils
+```
+
+## API
+
+**schema.json**
+
+```json
+{
+  "type": "object",
+  "properties": {
+    "option": {
+      "type": "boolean"
+    }
+  },
+  "additionalProperties": false
+}
+```
+
+```js
+import schema from "./path/to/schema.json";
+import { validate } from "schema-utils";
+
+const options = { option: true };
+const configuration = { name: "Loader Name/Plugin Name/Name" };
+
+validate(schema, options, configuration);
+```
+
+### `schema`
+
+Type: `String`
+
+JSON schema.
+
+Simple example of schema:
+
+```json
+{
+  "type": "object",
+  "properties": {
+    "name": {
+      "description": "This is description of option.",
+      "type": "string"
+    }
+  },
+  "additionalProperties": false
+}
+```
+
+### `options`
+
+Type: `Object`
+
+Object with options.
+
+```js
+import schema from "./path/to/schema.json";
+import { validate } from "schema-utils";
+
+const options = { foo: "bar" };
+
+validate(schema, { name: 123 }, { name: "MyPlugin" });
+```
+
+### `configuration`
+
+Allow to configure validator.
+
+There is an alternative method to configure the `name` and`baseDataPath` options via the `title` property in the schema.
+For example:
+
+```json
+{
+  "title": "My Loader options",
+  "type": "object",
+  "properties": {
+    "name": {
+      "description": "This is description of option.",
+      "type": "string"
+    }
+  },
+  "additionalProperties": false
+}
+```
+
+The last word used for the `baseDataPath` option, other words used for the `name` option.
+Based on the example above the `name` option equals `My Loader`, the `baseDataPath` option equals `options`.
+
+#### `name`
+
+Type: `Object`
+Default: `"Object"`
+
+Allow to setup name in validation errors.
+
+```js
+import schema from "./path/to/schema.json";
+import { validate } from "schema-utils";
+
+const options = { foo: "bar" };
+
+validate(schema, options, { name: "MyPlugin" });
+```
+
+```shell
+Invalid configuration object. MyPlugin has been initialised using a configuration object that does not match the API schema.
+ - configuration.optionName should be a integer.
+```
+
+#### `baseDataPath`
+
+Type: `String`
+Default: `"configuration"`
+
+Allow to setup base data path in validation errors.
+
+```js
+import schema from "./path/to/schema.json";
+import { validate } from "schema-utils";
+
+const options = { foo: "bar" };
+
+validate(schema, options, { name: "MyPlugin", baseDataPath: "options" });
+```
+
+```shell
+Invalid options object. MyPlugin has been initialised using an options object that does not match the API schema.
+ - options.optionName should be a integer.
+```
+
+#### `postFormatter`
+
+Type: `Function`
+Default: `undefined`
+
+Allow to reformat errors.
+
+```js
+import schema from "./path/to/schema.json";
+import { validate } from "schema-utils";
+
+const options = { foo: "bar" };
+
+validate(schema, options, {
+  name: "MyPlugin",
+  postFormatter: (formattedError, error) => {
+    if (error.keyword === "type") {
+      return `${formattedError}\nAdditional Information.`;
+    }
+
+    return formattedError;
+  },
+});
+```
+
+```shell
+Invalid options object. MyPlugin has been initialized using an options object that does not match the API schema.
+ - options.optionName should be a integer.
+   Additional Information.
+```
+
+## Examples
+
+**schema.json**
+
+```json
+{
+  "type": "object",
+  "properties": {
+    "name": {
+      "type": "string"
+    },
+    "test": {
+      "anyOf": [
+        { "type": "array" },
+        { "type": "string" },
+        { "instanceof": "RegExp" }
+      ]
+    },
+    "transform": {
+      "instanceof": "Function"
+    },
+    "sourceMap": {
+      "type": "boolean"
+    }
+  },
+  "additionalProperties": false
+}
+```
+
+### `Loader`
+
+```js
+import { getOptions } from "loader-utils";
+import { validate } from "schema-utils";
+
+import schema from "path/to/schema.json";
+
+function loader(src, map) {
+  const options = getOptions(this);
+
+  validate(schema, options, {
+    name: "Loader Name",
+    baseDataPath: "options",
+  });
+
+  // Code...
+}
+
+export default loader;
+```
+
+### `Plugin`
+
+```js
+import { validate } from "schema-utils";
+
+import schema from "path/to/schema.json";
+
+class Plugin {
+  constructor(options) {
+    validate(schema, options, {
+      name: "Plugin Name",
+      baseDataPath: "options",
+    });
+
+    this.options = options;
+  }
+
+  apply(compiler) {
+    // Code...
+  }
+}
+
+export default Plugin;
+```
+
+## Contributing
+
+Please take a moment to read our contributing guidelines if you haven't yet done so.
+
+[CONTRIBUTING](./.github/CONTRIBUTING.md)
+
+## License
+
+[MIT](./LICENSE)
+
+[npm]: https://img.shields.io/npm/v/schema-utils.svg
+[npm-url]: https://npmjs.com/package/schema-utils
+[node]: https://img.shields.io/node/v/schema-utils.svg
+[node-url]: https://nodejs.org
+[deps]: https://david-dm.org/webpack/schema-utils.svg
+[deps-url]: https://david-dm.org/webpack/schema-utils
+[tests]: https://github.com/webpack/schema-utils/workflows/schema-utils/badge.svg
+[tests-url]: https://github.com/webpack/schema-utils/actions
+[cover]: https://codecov.io/gh/webpack/schema-utils/branch/master/graph/badge.svg
+[cover-url]: https://codecov.io/gh/webpack/schema-utils
+[chat]: https://badges.gitter.im/webpack/webpack.svg
+[chat-url]: https://gitter.im/webpack/webpack
+[size]: https://packagephobia.com/badge?p=schema-utils
+[size-url]: https://packagephobia.com/result?p=schema-utils
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/declarations/ValidationError.d.ts b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/ValidationError.d.ts
new file mode 100644
index 0000000..55a8a9a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/ValidationError.d.ts
@@ -0,0 +1,74 @@
+export default ValidationError;
+export type JSONSchema6 = import("json-schema").JSONSchema6;
+export type JSONSchema7 = import("json-schema").JSONSchema7;
+export type Schema = import("./validate").Schema;
+export type ValidationErrorConfiguration =
+  import("./validate").ValidationErrorConfiguration;
+export type PostFormatter = import("./validate").PostFormatter;
+export type SchemaUtilErrorObject = import("./validate").SchemaUtilErrorObject;
+declare class ValidationError extends Error {
+  /**
+   * @param {Array<SchemaUtilErrorObject>} errors
+   * @param {Schema} schema
+   * @param {ValidationErrorConfiguration} configuration
+   */
+  constructor(
+    errors: Array<SchemaUtilErrorObject>,
+    schema: Schema,
+    configuration?: ValidationErrorConfiguration
+  );
+  /** @type {Array<SchemaUtilErrorObject>} */
+  errors: Array<SchemaUtilErrorObject>;
+  /** @type {Schema} */
+  schema: Schema;
+  /** @type {string} */
+  headerName: string;
+  /** @type {string} */
+  baseDataPath: string;
+  /** @type {PostFormatter | null} */
+  postFormatter: PostFormatter | null;
+  /**
+   * @param {string} path
+   * @returns {Schema}
+   */
+  getSchemaPart(path: string): Schema;
+  /**
+   * @param {Schema} schema
+   * @param {boolean} logic
+   * @param {Array<Object>} prevSchemas
+   * @returns {string}
+   */
+  formatSchema(
+    schema: Schema,
+    logic?: boolean,
+    prevSchemas?: Array<Object>
+  ): string;
+  /**
+   * @param {Schema=} schemaPart
+   * @param {(boolean | Array<string>)=} additionalPath
+   * @param {boolean=} needDot
+   * @param {boolean=} logic
+   * @returns {string}
+   */
+  getSchemaPartText(
+    schemaPart?: Schema | undefined,
+    additionalPath?: (boolean | Array<string>) | undefined,
+    needDot?: boolean | undefined,
+    logic?: boolean | undefined
+  ): string;
+  /**
+   * @param {Schema=} schemaPart
+   * @returns {string}
+   */
+  getSchemaPartDescription(schemaPart?: Schema | undefined): string;
+  /**
+   * @param {SchemaUtilErrorObject} error
+   * @returns {string}
+   */
+  formatValidationError(error: SchemaUtilErrorObject): string;
+  /**
+   * @param {Array<SchemaUtilErrorObject>} errors
+   * @returns {string}
+   */
+  formatValidationErrors(errors: Array<SchemaUtilErrorObject>): string;
+}
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/declarations/index.d.ts b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/index.d.ts
new file mode 100644
index 0000000..df5ec27
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/index.d.ts
@@ -0,0 +1,3 @@
+import { validate } from "./validate";
+import { ValidationError } from "./validate";
+export { validate, ValidationError };
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/declarations/keywords/absolutePath.d.ts b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/keywords/absolutePath.d.ts
new file mode 100644
index 0000000..0d16689
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/keywords/absolutePath.d.ts
@@ -0,0 +1,10 @@
+export default addAbsolutePathKeyword;
+export type Ajv = import("ajv").Ajv;
+export type ValidateFunction = import("ajv").ValidateFunction;
+export type SchemaUtilErrorObject = import("../validate").SchemaUtilErrorObject;
+/**
+ *
+ * @param {Ajv} ajv
+ * @returns {Ajv}
+ */
+declare function addAbsolutePathKeyword(ajv: Ajv): Ajv;
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/declarations/util/Range.d.ts b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/util/Range.d.ts
new file mode 100644
index 0000000..2ba97fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/util/Range.d.ts
@@ -0,0 +1,79 @@
+export = Range;
+/**
+ * @typedef {[number, boolean]} RangeValue
+ */
+/**
+ * @callback RangeValueCallback
+ * @param {RangeValue} rangeValue
+ * @returns {boolean}
+ */
+declare class Range {
+  /**
+   * @param {"left" | "right"} side
+   * @param {boolean} exclusive
+   * @returns {">" | ">=" | "<" | "<="}
+   */
+  static getOperator(
+    side: "left" | "right",
+    exclusive: boolean
+  ): ">" | ">=" | "<" | "<=";
+  /**
+   * @param {number} value
+   * @param {boolean} logic is not logic applied
+   * @param {boolean} exclusive is range exclusive
+   * @returns {string}
+   */
+  static formatRight(value: number, logic: boolean, exclusive: boolean): string;
+  /**
+   * @param {number} value
+   * @param {boolean} logic is not logic applied
+   * @param {boolean} exclusive is range exclusive
+   * @returns {string}
+   */
+  static formatLeft(value: number, logic: boolean, exclusive: boolean): string;
+  /**
+   * @param {number} start left side value
+   * @param {number} end right side value
+   * @param {boolean} startExclusive is range exclusive from left side
+   * @param {boolean} endExclusive is range exclusive from right side
+   * @param {boolean} logic is not logic applied
+   * @returns {string}
+   */
+  static formatRange(
+    start: number,
+    end: number,
+    startExclusive: boolean,
+    endExclusive: boolean,
+    logic: boolean
+  ): string;
+  /**
+   * @param {Array<RangeValue>} values
+   * @param {boolean} logic is not logic applied
+   * @return {RangeValue} computed value and it's exclusive flag
+   */
+  static getRangeValue(values: Array<RangeValue>, logic: boolean): RangeValue;
+  /** @type {Array<RangeValue>} */
+  _left: Array<RangeValue>;
+  /** @type {Array<RangeValue>} */
+  _right: Array<RangeValue>;
+  /**
+   * @param {number} value
+   * @param {boolean=} exclusive
+   */
+  left(value: number, exclusive?: boolean | undefined): void;
+  /**
+   * @param {number} value
+   * @param {boolean=} exclusive
+   */
+  right(value: number, exclusive?: boolean | undefined): void;
+  /**
+   * @param {boolean} logic is not logic applied
+   * @return {string} "smart" range string representation
+   */
+  format(logic?: boolean): string;
+}
+declare namespace Range {
+  export { RangeValue, RangeValueCallback };
+}
+type RangeValue = [number, boolean];
+type RangeValueCallback = (rangeValue: RangeValue) => boolean;
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/declarations/util/hints.d.ts b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/util/hints.d.ts
new file mode 100644
index 0000000..e43e32a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/util/hints.d.ts
@@ -0,0 +1,3 @@
+export function stringHints(schema: Schema, logic: boolean): string[];
+export function numberHints(schema: Schema, logic: boolean): string[];
+export type Schema = import("../validate").Schema;
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/declarations/validate.d.ts b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/validate.d.ts
new file mode 100644
index 0000000..a04b6dd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/declarations/validate.d.ts
@@ -0,0 +1,37 @@
+export type JSONSchema4 = import("json-schema").JSONSchema4;
+export type JSONSchema6 = import("json-schema").JSONSchema6;
+export type JSONSchema7 = import("json-schema").JSONSchema7;
+export type ErrorObject = import("ajv").ErrorObject;
+export type Extend = {
+  formatMinimum?: number | undefined;
+  formatMaximum?: number | undefined;
+  formatExclusiveMinimum?: boolean | undefined;
+  formatExclusiveMaximum?: boolean | undefined;
+  link?: string | undefined;
+};
+export type Schema = (JSONSchema4 | JSONSchema6 | JSONSchema7) & Extend;
+export type SchemaUtilErrorObject = ErrorObject & {
+  children?: Array<ErrorObject>;
+};
+export type PostFormatter = (
+  formattedError: string,
+  error: SchemaUtilErrorObject
+) => string;
+export type ValidationErrorConfiguration = {
+  name?: string | undefined;
+  baseDataPath?: string | undefined;
+  postFormatter?: PostFormatter | undefined;
+};
+/**
+ * @param {Schema} schema
+ * @param {Array<object> | object} options
+ * @param {ValidationErrorConfiguration=} configuration
+ * @returns {void}
+ */
+export function validate(
+  schema: Schema,
+  options: Array<object> | object,
+  configuration?: ValidationErrorConfiguration | undefined
+): void;
+import ValidationError from "./ValidationError";
+export { ValidationError };
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/dist/ValidationError.js b/node_modules/mathjs/examples/node_modules/schema-utils/dist/ValidationError.js
new file mode 100644
index 0000000..372dde1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/dist/ValidationError.js
@@ -0,0 +1,1271 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+const {
+  stringHints,
+  numberHints
+} = require("./util/hints");
+/** @typedef {import("json-schema").JSONSchema6} JSONSchema6 */
+
+/** @typedef {import("json-schema").JSONSchema7} JSONSchema7 */
+
+/** @typedef {import("./validate").Schema} Schema */
+
+/** @typedef {import("./validate").ValidationErrorConfiguration} ValidationErrorConfiguration */
+
+/** @typedef {import("./validate").PostFormatter} PostFormatter */
+
+/** @typedef {import("./validate").SchemaUtilErrorObject} SchemaUtilErrorObject */
+
+/** @enum {number} */
+
+
+const SPECIFICITY = {
+  type: 1,
+  not: 1,
+  oneOf: 1,
+  anyOf: 1,
+  if: 1,
+  enum: 1,
+  const: 1,
+  instanceof: 1,
+  required: 2,
+  pattern: 2,
+  patternRequired: 2,
+  format: 2,
+  formatMinimum: 2,
+  formatMaximum: 2,
+  minimum: 2,
+  exclusiveMinimum: 2,
+  maximum: 2,
+  exclusiveMaximum: 2,
+  multipleOf: 2,
+  uniqueItems: 2,
+  contains: 2,
+  minLength: 2,
+  maxLength: 2,
+  minItems: 2,
+  maxItems: 2,
+  minProperties: 2,
+  maxProperties: 2,
+  dependencies: 2,
+  propertyNames: 2,
+  additionalItems: 2,
+  additionalProperties: 2,
+  absolutePath: 2
+};
+/**
+ *
+ * @param {Array<SchemaUtilErrorObject>} array
+ * @param {(item: SchemaUtilErrorObject) => number} fn
+ * @returns {Array<SchemaUtilErrorObject>}
+ */
+
+function filterMax(array, fn) {
+  const evaluatedMax = array.reduce((max, item) => Math.max(max, fn(item)), 0);
+  return array.filter(item => fn(item) === evaluatedMax);
+}
+/**
+ *
+ * @param {Array<SchemaUtilErrorObject>} children
+ * @returns {Array<SchemaUtilErrorObject>}
+ */
+
+
+function filterChildren(children) {
+  let newChildren = children;
+  newChildren = filterMax(newChildren,
+  /**
+   *
+   * @param {SchemaUtilErrorObject} error
+   * @returns {number}
+   */
+  error => error.dataPath ? error.dataPath.length : 0);
+  newChildren = filterMax(newChildren,
+  /**
+   * @param {SchemaUtilErrorObject} error
+   * @returns {number}
+   */
+  error => SPECIFICITY[
+  /** @type {keyof typeof SPECIFICITY} */
+  error.keyword] || 2);
+  return newChildren;
+}
+/**
+ * Find all children errors
+ * @param {Array<SchemaUtilErrorObject>} children
+ * @param {Array<string>} schemaPaths
+ * @return {number} returns index of first child
+ */
+
+
+function findAllChildren(children, schemaPaths) {
+  let i = children.length - 1;
+
+  const predicate =
+  /**
+   * @param {string} schemaPath
+   * @returns {boolean}
+   */
+  schemaPath => children[i].schemaPath.indexOf(schemaPath) !== 0;
+
+  while (i > -1 && !schemaPaths.every(predicate)) {
+    if (children[i].keyword === "anyOf" || children[i].keyword === "oneOf") {
+      const refs = extractRefs(children[i]);
+      const childrenStart = findAllChildren(children.slice(0, i), refs.concat(children[i].schemaPath));
+      i = childrenStart - 1;
+    } else {
+      i -= 1;
+    }
+  }
+
+  return i + 1;
+}
+/**
+ * Extracts all refs from schema
+ * @param {SchemaUtilErrorObject} error
+ * @return {Array<string>}
+ */
+
+
+function extractRefs(error) {
+  const {
+    schema
+  } = error;
+
+  if (!Array.isArray(schema)) {
+    return [];
+  }
+
+  return schema.map(({
+    $ref
+  }) => $ref).filter(s => s);
+}
+/**
+ * Groups children by their first level parent (assuming that error is root)
+ * @param {Array<SchemaUtilErrorObject>} children
+ * @return {Array<SchemaUtilErrorObject>}
+ */
+
+
+function groupChildrenByFirstChild(children) {
+  const result = [];
+  let i = children.length - 1;
+
+  while (i > 0) {
+    const child = children[i];
+
+    if (child.keyword === "anyOf" || child.keyword === "oneOf") {
+      const refs = extractRefs(child);
+      const childrenStart = findAllChildren(children.slice(0, i), refs.concat(child.schemaPath));
+
+      if (childrenStart !== i) {
+        result.push(Object.assign({}, child, {
+          children: children.slice(childrenStart, i)
+        }));
+        i = childrenStart;
+      } else {
+        result.push(child);
+      }
+    } else {
+      result.push(child);
+    }
+
+    i -= 1;
+  }
+
+  if (i === 0) {
+    result.push(children[i]);
+  }
+
+  return result.reverse();
+}
+/**
+ * @param {string} str
+ * @param {string} prefix
+ * @returns {string}
+ */
+
+
+function indent(str, prefix) {
+  return str.replace(/\n(?!$)/g, `\n${prefix}`);
+}
+/**
+ * @param {Schema} schema
+ * @returns {schema is (Schema & {not: Schema})}
+ */
+
+
+function hasNotInSchema(schema) {
+  return !!schema.not;
+}
+/**
+ * @param {Schema} schema
+ * @return {Schema}
+ */
+
+
+function findFirstTypedSchema(schema) {
+  if (hasNotInSchema(schema)) {
+    return findFirstTypedSchema(schema.not);
+  }
+
+  return schema;
+}
+/**
+ * @param {Schema} schema
+ * @return {boolean}
+ */
+
+
+function canApplyNot(schema) {
+  const typedSchema = findFirstTypedSchema(schema);
+  return likeNumber(typedSchema) || likeInteger(typedSchema) || likeString(typedSchema) || likeNull(typedSchema) || likeBoolean(typedSchema);
+}
+/**
+ * @param {any} maybeObj
+ * @returns {boolean}
+ */
+
+
+function isObject(maybeObj) {
+  return typeof maybeObj === "object" && maybeObj !== null;
+}
+/**
+ * @param {Schema} schema
+ * @returns {boolean}
+ */
+
+
+function likeNumber(schema) {
+  return schema.type === "number" || typeof schema.minimum !== "undefined" || typeof schema.exclusiveMinimum !== "undefined" || typeof schema.maximum !== "undefined" || typeof schema.exclusiveMaximum !== "undefined" || typeof schema.multipleOf !== "undefined";
+}
+/**
+ * @param {Schema} schema
+ * @returns {boolean}
+ */
+
+
+function likeInteger(schema) {
+  return schema.type === "integer" || typeof schema.minimum !== "undefined" || typeof schema.exclusiveMinimum !== "undefined" || typeof schema.maximum !== "undefined" || typeof schema.exclusiveMaximum !== "undefined" || typeof schema.multipleOf !== "undefined";
+}
+/**
+ * @param {Schema} schema
+ * @returns {boolean}
+ */
+
+
+function likeString(schema) {
+  return schema.type === "string" || typeof schema.minLength !== "undefined" || typeof schema.maxLength !== "undefined" || typeof schema.pattern !== "undefined" || typeof schema.format !== "undefined" || typeof schema.formatMinimum !== "undefined" || typeof schema.formatMaximum !== "undefined";
+}
+/**
+ * @param {Schema} schema
+ * @returns {boolean}
+ */
+
+
+function likeBoolean(schema) {
+  return schema.type === "boolean";
+}
+/**
+ * @param {Schema} schema
+ * @returns {boolean}
+ */
+
+
+function likeArray(schema) {
+  return schema.type === "array" || typeof schema.minItems === "number" || typeof schema.maxItems === "number" || typeof schema.uniqueItems !== "undefined" || typeof schema.items !== "undefined" || typeof schema.additionalItems !== "undefined" || typeof schema.contains !== "undefined";
+}
+/**
+ * @param {Schema & {patternRequired?: Array<string>}} schema
+ * @returns {boolean}
+ */
+
+
+function likeObject(schema) {
+  return schema.type === "object" || typeof schema.minProperties !== "undefined" || typeof schema.maxProperties !== "undefined" || typeof schema.required !== "undefined" || typeof schema.properties !== "undefined" || typeof schema.patternProperties !== "undefined" || typeof schema.additionalProperties !== "undefined" || typeof schema.dependencies !== "undefined" || typeof schema.propertyNames !== "undefined" || typeof schema.patternRequired !== "undefined";
+}
+/**
+ * @param {Schema} schema
+ * @returns {boolean}
+ */
+
+
+function likeNull(schema) {
+  return schema.type === "null";
+}
+/**
+ * @param {string} type
+ * @returns {string}
+ */
+
+
+function getArticle(type) {
+  if (/^[aeiou]/i.test(type)) {
+    return "an";
+  }
+
+  return "a";
+}
+/**
+ * @param {Schema=} schema
+ * @returns {string}
+ */
+
+
+function getSchemaNonTypes(schema) {
+  if (!schema) {
+    return "";
+  }
+
+  if (!schema.type) {
+    if (likeNumber(schema) || likeInteger(schema)) {
+      return " | should be any non-number";
+    }
+
+    if (likeString(schema)) {
+      return " | should be any non-string";
+    }
+
+    if (likeArray(schema)) {
+      return " | should be any non-array";
+    }
+
+    if (likeObject(schema)) {
+      return " | should be any non-object";
+    }
+  }
+
+  return "";
+}
+/**
+ * @param {Array<string>} hints
+ * @returns {string}
+ */
+
+
+function formatHints(hints) {
+  return hints.length > 0 ? `(${hints.join(", ")})` : "";
+}
+/**
+ * @param {Schema} schema
+ * @param {boolean} logic
+ * @returns {string[]}
+ */
+
+
+function getHints(schema, logic) {
+  if (likeNumber(schema) || likeInteger(schema)) {
+    return numberHints(schema, logic);
+  } else if (likeString(schema)) {
+    return stringHints(schema, logic);
+  }
+
+  return [];
+}
+
+class ValidationError extends Error {
+  /**
+   * @param {Array<SchemaUtilErrorObject>} errors
+   * @param {Schema} schema
+   * @param {ValidationErrorConfiguration} configuration
+   */
+  constructor(errors, schema, configuration = {}) {
+    super();
+    /** @type {string} */
+
+    this.name = "ValidationError";
+    /** @type {Array<SchemaUtilErrorObject>} */
+
+    this.errors = errors;
+    /** @type {Schema} */
+
+    this.schema = schema;
+    let headerNameFromSchema;
+    let baseDataPathFromSchema;
+
+    if (schema.title && (!configuration.name || !configuration.baseDataPath)) {
+      const splittedTitleFromSchema = schema.title.match(/^(.+) (.+)$/);
+
+      if (splittedTitleFromSchema) {
+        if (!configuration.name) {
+          [, headerNameFromSchema] = splittedTitleFromSchema;
+        }
+
+        if (!configuration.baseDataPath) {
+          [,, baseDataPathFromSchema] = splittedTitleFromSchema;
+        }
+      }
+    }
+    /** @type {string} */
+
+
+    this.headerName = configuration.name || headerNameFromSchema || "Object";
+    /** @type {string} */
+
+    this.baseDataPath = configuration.baseDataPath || baseDataPathFromSchema || "configuration";
+    /** @type {PostFormatter | null} */
+
+    this.postFormatter = configuration.postFormatter || null;
+    const header = `Invalid ${this.baseDataPath} object. ${this.headerName} has been initialized using ${getArticle(this.baseDataPath)} ${this.baseDataPath} object that does not match the API schema.\n`;
+    /** @type {string} */
+
+    this.message = `${header}${this.formatValidationErrors(errors)}`;
+    Error.captureStackTrace(this, this.constructor);
+  }
+  /**
+   * @param {string} path
+   * @returns {Schema}
+   */
+
+
+  getSchemaPart(path) {
+    const newPath = path.split("/");
+    let schemaPart = this.schema;
+
+    for (let i = 1; i < newPath.length; i++) {
+      const inner = schemaPart[
+      /** @type {keyof Schema} */
+      newPath[i]];
+
+      if (!inner) {
+        break;
+      }
+
+      schemaPart = inner;
+    }
+
+    return schemaPart;
+  }
+  /**
+   * @param {Schema} schema
+   * @param {boolean} logic
+   * @param {Array<Object>} prevSchemas
+   * @returns {string}
+   */
+
+
+  formatSchema(schema, logic = true, prevSchemas = []) {
+    let newLogic = logic;
+
+    const formatInnerSchema =
+    /**
+     *
+     * @param {Object} innerSchema
+     * @param {boolean=} addSelf
+     * @returns {string}
+     */
+    (innerSchema, addSelf) => {
+      if (!addSelf) {
+        return this.formatSchema(innerSchema, newLogic, prevSchemas);
+      }
+
+      if (prevSchemas.includes(innerSchema)) {
+        return "(recursive)";
+      }
+
+      return this.formatSchema(innerSchema, newLogic, prevSchemas.concat(schema));
+    };
+
+    if (hasNotInSchema(schema) && !likeObject(schema)) {
+      if (canApplyNot(schema.not)) {
+        newLogic = !logic;
+        return formatInnerSchema(schema.not);
+      }
+
+      const needApplyLogicHere = !schema.not.not;
+      const prefix = logic ? "" : "non ";
+      newLogic = !logic;
+      return needApplyLogicHere ? prefix + formatInnerSchema(schema.not) : formatInnerSchema(schema.not);
+    }
+
+    if (
+    /** @type {Schema & {instanceof: string | Array<string>}} */
+    schema.instanceof) {
+      const {
+        instanceof: value
+      } =
+      /** @type {Schema & {instanceof: string | Array<string>}} */
+      schema;
+      const values = !Array.isArray(value) ? [value] : value;
+      return values.map(
+      /**
+       * @param {string} item
+       * @returns {string}
+       */
+      item => item === "Function" ? "function" : item).join(" | ");
+    }
+
+    if (schema.enum) {
+      return (
+        /** @type {Array<any>} */
+        schema.enum.map(item => JSON.stringify(item)).join(" | ")
+      );
+    }
+
+    if (typeof schema.const !== "undefined") {
+      return JSON.stringify(schema.const);
+    }
+
+    if (schema.oneOf) {
+      return (
+        /** @type {Array<Schema>} */
+        schema.oneOf.map(item => formatInnerSchema(item, true)).join(" | ")
+      );
+    }
+
+    if (schema.anyOf) {
+      return (
+        /** @type {Array<Schema>} */
+        schema.anyOf.map(item => formatInnerSchema(item, true)).join(" | ")
+      );
+    }
+
+    if (schema.allOf) {
+      return (
+        /** @type {Array<Schema>} */
+        schema.allOf.map(item => formatInnerSchema(item, true)).join(" & ")
+      );
+    }
+
+    if (
+    /** @type {JSONSchema7} */
+    schema.if) {
+      const {
+        if: ifValue,
+        then: thenValue,
+        else: elseValue
+      } =
+      /** @type {JSONSchema7} */
+      schema;
+      return `${ifValue ? `if ${formatInnerSchema(ifValue)}` : ""}${thenValue ? ` then ${formatInnerSchema(thenValue)}` : ""}${elseValue ? ` else ${formatInnerSchema(elseValue)}` : ""}`;
+    }
+
+    if (schema.$ref) {
+      return formatInnerSchema(this.getSchemaPart(schema.$ref), true);
+    }
+
+    if (likeNumber(schema) || likeInteger(schema)) {
+      const [type, ...hints] = getHints(schema, logic);
+      const str = `${type}${hints.length > 0 ? ` ${formatHints(hints)}` : ""}`;
+      return logic ? str : hints.length > 0 ? `non-${type} | ${str}` : `non-${type}`;
+    }
+
+    if (likeString(schema)) {
+      const [type, ...hints] = getHints(schema, logic);
+      const str = `${type}${hints.length > 0 ? ` ${formatHints(hints)}` : ""}`;
+      return logic ? str : str === "string" ? "non-string" : `non-string | ${str}`;
+    }
+
+    if (likeBoolean(schema)) {
+      return `${logic ? "" : "non-"}boolean`;
+    }
+
+    if (likeArray(schema)) {
+      // not logic already applied in formatValidationError
+      newLogic = true;
+      const hints = [];
+
+      if (typeof schema.minItems === "number") {
+        hints.push(`should not have fewer than ${schema.minItems} item${schema.minItems > 1 ? "s" : ""}`);
+      }
+
+      if (typeof schema.maxItems === "number") {
+        hints.push(`should not have more than ${schema.maxItems} item${schema.maxItems > 1 ? "s" : ""}`);
+      }
+
+      if (schema.uniqueItems) {
+        hints.push("should not have duplicate items");
+      }
+
+      const hasAdditionalItems = typeof schema.additionalItems === "undefined" || Boolean(schema.additionalItems);
+      let items = "";
+
+      if (schema.items) {
+        if (Array.isArray(schema.items) && schema.items.length > 0) {
+          items = `${
+          /** @type {Array<Schema>} */
+          schema.items.map(item => formatInnerSchema(item)).join(", ")}`;
+
+          if (hasAdditionalItems) {
+            if (schema.additionalItems && isObject(schema.additionalItems) && Object.keys(schema.additionalItems).length > 0) {
+              hints.push(`additional items should be ${formatInnerSchema(schema.additionalItems)}`);
+            }
+          }
+        } else if (schema.items && Object.keys(schema.items).length > 0) {
+          // "additionalItems" is ignored
+          items = `${formatInnerSchema(schema.items)}`;
+        } else {
+          // Fallback for empty `items` value
+          items = "any";
+        }
+      } else {
+        // "additionalItems" is ignored
+        items = "any";
+      }
+
+      if (schema.contains && Object.keys(schema.contains).length > 0) {
+        hints.push(`should contains at least one ${this.formatSchema(schema.contains)} item`);
+      }
+
+      return `[${items}${hasAdditionalItems ? ", ..." : ""}]${hints.length > 0 ? ` (${hints.join(", ")})` : ""}`;
+    }
+
+    if (likeObject(schema)) {
+      // not logic already applied in formatValidationError
+      newLogic = true;
+      const hints = [];
+
+      if (typeof schema.minProperties === "number") {
+        hints.push(`should not have fewer than ${schema.minProperties} ${schema.minProperties > 1 ? "properties" : "property"}`);
+      }
+
+      if (typeof schema.maxProperties === "number") {
+        hints.push(`should not have more than ${schema.maxProperties} ${schema.minProperties && schema.minProperties > 1 ? "properties" : "property"}`);
+      }
+
+      if (schema.patternProperties && Object.keys(schema.patternProperties).length > 0) {
+        const patternProperties = Object.keys(schema.patternProperties);
+        hints.push(`additional property names should match pattern${patternProperties.length > 1 ? "s" : ""} ${patternProperties.map(pattern => JSON.stringify(pattern)).join(" | ")}`);
+      }
+
+      const properties = schema.properties ? Object.keys(schema.properties) : [];
+      const required = schema.required ? schema.required : [];
+      const allProperties = [...new Set(
+      /** @type {Array<string>} */
+      [].concat(required).concat(properties))];
+      const objectStructure = allProperties.map(property => {
+        const isRequired = required.includes(property); // Some properties need quotes, maybe we should add check
+        // Maybe we should output type of property (`foo: string`), but it is looks very unreadable
+
+        return `${property}${isRequired ? "" : "?"}`;
+      }).concat(typeof schema.additionalProperties === "undefined" || Boolean(schema.additionalProperties) ? schema.additionalProperties && isObject(schema.additionalProperties) ? [`<key>: ${formatInnerSchema(schema.additionalProperties)}`] : ["…"] : []).join(", ");
+      const {
+        dependencies,
+        propertyNames,
+        patternRequired
+      } =
+      /** @type {Schema & {patternRequired?: Array<string>;}} */
+      schema;
+
+      if (dependencies) {
+        Object.keys(dependencies).forEach(dependencyName => {
+          const dependency = dependencies[dependencyName];
+
+          if (Array.isArray(dependency)) {
+            hints.push(`should have ${dependency.length > 1 ? "properties" : "property"} ${dependency.map(dep => `'${dep}'`).join(", ")} when property '${dependencyName}' is present`);
+          } else {
+            hints.push(`should be valid according to the schema ${formatInnerSchema(dependency)} when property '${dependencyName}' is present`);
+          }
+        });
+      }
+
+      if (propertyNames && Object.keys(propertyNames).length > 0) {
+        hints.push(`each property name should match format ${JSON.stringify(schema.propertyNames.format)}`);
+      }
+
+      if (patternRequired && patternRequired.length > 0) {
+        hints.push(`should have property matching pattern ${patternRequired.map(
+        /**
+         * @param {string} item
+         * @returns {string}
+         */
+        item => JSON.stringify(item))}`);
+      }
+
+      return `object {${objectStructure ? ` ${objectStructure} ` : ""}}${hints.length > 0 ? ` (${hints.join(", ")})` : ""}`;
+    }
+
+    if (likeNull(schema)) {
+      return `${logic ? "" : "non-"}null`;
+    }
+
+    if (Array.isArray(schema.type)) {
+      // not logic already applied in formatValidationError
+      return `${schema.type.join(" | ")}`;
+    } // Fallback for unknown keywords
+    // not logic already applied in formatValidationError
+
+    /* istanbul ignore next */
+
+
+    return JSON.stringify(schema, null, 2);
+  }
+  /**
+   * @param {Schema=} schemaPart
+   * @param {(boolean | Array<string>)=} additionalPath
+   * @param {boolean=} needDot
+   * @param {boolean=} logic
+   * @returns {string}
+   */
+
+
+  getSchemaPartText(schemaPart, additionalPath, needDot = false, logic = true) {
+    if (!schemaPart) {
+      return "";
+    }
+
+    if (Array.isArray(additionalPath)) {
+      for (let i = 0; i < additionalPath.length; i++) {
+        /** @type {Schema | undefined} */
+        const inner = schemaPart[
+        /** @type {keyof Schema} */
+        additionalPath[i]];
+
+        if (inner) {
+          // eslint-disable-next-line no-param-reassign
+          schemaPart = inner;
+        } else {
+          break;
+        }
+      }
+    }
+
+    while (schemaPart.$ref) {
+      // eslint-disable-next-line no-param-reassign
+      schemaPart = this.getSchemaPart(schemaPart.$ref);
+    }
+
+    let schemaText = `${this.formatSchema(schemaPart, logic)}${needDot ? "." : ""}`;
+
+    if (schemaPart.description) {
+      schemaText += `\n-> ${schemaPart.description}`;
+    }
+
+    if (schemaPart.link) {
+      schemaText += `\n-> Read more at ${schemaPart.link}`;
+    }
+
+    return schemaText;
+  }
+  /**
+   * @param {Schema=} schemaPart
+   * @returns {string}
+   */
+
+
+  getSchemaPartDescription(schemaPart) {
+    if (!schemaPart) {
+      return "";
+    }
+
+    while (schemaPart.$ref) {
+      // eslint-disable-next-line no-param-reassign
+      schemaPart = this.getSchemaPart(schemaPart.$ref);
+    }
+
+    let schemaText = "";
+
+    if (schemaPart.description) {
+      schemaText += `\n-> ${schemaPart.description}`;
+    }
+
+    if (schemaPart.link) {
+      schemaText += `\n-> Read more at ${schemaPart.link}`;
+    }
+
+    return schemaText;
+  }
+  /**
+   * @param {SchemaUtilErrorObject} error
+   * @returns {string}
+   */
+
+
+  formatValidationError(error) {
+    const {
+      keyword,
+      dataPath: errorDataPath
+    } = error;
+    const dataPath = `${this.baseDataPath}${errorDataPath}`;
+
+    switch (keyword) {
+      case "type":
+        {
+          const {
+            parentSchema,
+            params
+          } = error; // eslint-disable-next-line default-case
+
+          switch (
+          /** @type {import("ajv").TypeParams} */
+          params.type) {
+            case "number":
+              return `${dataPath} should be a ${this.getSchemaPartText(parentSchema, false, true)}`;
+
+            case "integer":
+              return `${dataPath} should be an ${this.getSchemaPartText(parentSchema, false, true)}`;
+
+            case "string":
+              return `${dataPath} should be a ${this.getSchemaPartText(parentSchema, false, true)}`;
+
+            case "boolean":
+              return `${dataPath} should be a ${this.getSchemaPartText(parentSchema, false, true)}`;
+
+            case "array":
+              return `${dataPath} should be an array:\n${this.getSchemaPartText(parentSchema)}`;
+
+            case "object":
+              return `${dataPath} should be an object:\n${this.getSchemaPartText(parentSchema)}`;
+
+            case "null":
+              return `${dataPath} should be a ${this.getSchemaPartText(parentSchema, false, true)}`;
+
+            default:
+              return `${dataPath} should be:\n${this.getSchemaPartText(parentSchema)}`;
+          }
+        }
+
+      case "instanceof":
+        {
+          const {
+            parentSchema
+          } = error;
+          return `${dataPath} should be an instance of ${this.getSchemaPartText(parentSchema, false, true)}`;
+        }
+
+      case "pattern":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            pattern
+          } =
+          /** @type {import("ajv").PatternParams} */
+          params;
+          return `${dataPath} should match pattern ${JSON.stringify(pattern)}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "format":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            format
+          } =
+          /** @type {import("ajv").FormatParams} */
+          params;
+          return `${dataPath} should match format ${JSON.stringify(format)}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "formatMinimum":
+      case "formatMaximum":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            comparison,
+            limit
+          } =
+          /** @type {import("ajv").ComparisonParams} */
+          params;
+          return `${dataPath} should be ${comparison} ${JSON.stringify(limit)}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "minimum":
+      case "maximum":
+      case "exclusiveMinimum":
+      case "exclusiveMaximum":
+        {
+          const {
+            parentSchema,
+            params
+          } = error;
+          const {
+            comparison,
+            limit
+          } =
+          /** @type {import("ajv").ComparisonParams} */
+          params;
+          const [, ...hints] = getHints(
+          /** @type {Schema} */
+          parentSchema, true);
+
+          if (hints.length === 0) {
+            hints.push(`should be ${comparison} ${limit}`);
+          }
+
+          return `${dataPath} ${hints.join(" ")}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "multipleOf":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            multipleOf
+          } =
+          /** @type {import("ajv").MultipleOfParams} */
+          params;
+          return `${dataPath} should be multiple of ${multipleOf}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "patternRequired":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            missingPattern
+          } =
+          /** @type {import("ajv").PatternRequiredParams} */
+          params;
+          return `${dataPath} should have property matching pattern ${JSON.stringify(missingPattern)}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "minLength":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            limit
+          } =
+          /** @type {import("ajv").LimitParams} */
+          params;
+
+          if (limit === 1) {
+            return `${dataPath} should be a non-empty string${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+          }
+
+          const length = limit - 1;
+          return `${dataPath} should be longer than ${length} character${length > 1 ? "s" : ""}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "minItems":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            limit
+          } =
+          /** @type {import("ajv").LimitParams} */
+          params;
+
+          if (limit === 1) {
+            return `${dataPath} should be a non-empty array${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+          }
+
+          return `${dataPath} should not have fewer than ${limit} items${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "minProperties":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            limit
+          } =
+          /** @type {import("ajv").LimitParams} */
+          params;
+
+          if (limit === 1) {
+            return `${dataPath} should be a non-empty object${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+          }
+
+          return `${dataPath} should not have fewer than ${limit} properties${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "maxLength":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            limit
+          } =
+          /** @type {import("ajv").LimitParams} */
+          params;
+          const max = limit + 1;
+          return `${dataPath} should be shorter than ${max} character${max > 1 ? "s" : ""}${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "maxItems":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            limit
+          } =
+          /** @type {import("ajv").LimitParams} */
+          params;
+          return `${dataPath} should not have more than ${limit} items${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "maxProperties":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            limit
+          } =
+          /** @type {import("ajv").LimitParams} */
+          params;
+          return `${dataPath} should not have more than ${limit} properties${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "uniqueItems":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            i
+          } =
+          /** @type {import("ajv").UniqueItemsParams} */
+          params;
+          return `${dataPath} should not contain the item '${error.data[i]}' twice${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "additionalItems":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            limit
+          } =
+          /** @type {import("ajv").LimitParams} */
+          params;
+          return `${dataPath} should not have more than ${limit} items${getSchemaNonTypes(parentSchema)}. These items are valid:\n${this.getSchemaPartText(parentSchema)}`;
+        }
+
+      case "contains":
+        {
+          const {
+            parentSchema
+          } = error;
+          return `${dataPath} should contains at least one ${this.getSchemaPartText(parentSchema, ["contains"])} item${getSchemaNonTypes(parentSchema)}.`;
+        }
+
+      case "required":
+        {
+          const {
+            parentSchema,
+            params
+          } = error;
+          const missingProperty =
+          /** @type {import("ajv").DependenciesParams} */
+          params.missingProperty.replace(/^\./, "");
+          const hasProperty = parentSchema && Boolean(
+          /** @type {Schema} */
+          parentSchema.properties &&
+          /** @type {Schema} */
+          parentSchema.properties[missingProperty]);
+          return `${dataPath} misses the property '${missingProperty}'${getSchemaNonTypes(parentSchema)}.${hasProperty ? ` Should be:\n${this.getSchemaPartText(parentSchema, ["properties", missingProperty])}` : this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "additionalProperties":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            additionalProperty
+          } =
+          /** @type {import("ajv").AdditionalPropertiesParams} */
+          params;
+          return `${dataPath} has an unknown property '${additionalProperty}'${getSchemaNonTypes(parentSchema)}. These properties are valid:\n${this.getSchemaPartText(parentSchema)}`;
+        }
+
+      case "dependencies":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            property,
+            deps
+          } =
+          /** @type {import("ajv").DependenciesParams} */
+          params;
+          const dependencies = deps.split(",").map(
+          /**
+           * @param {string} dep
+           * @returns {string}
+           */
+          dep => `'${dep.trim()}'`).join(", ");
+          return `${dataPath} should have properties ${dependencies} when property '${property}' is present${getSchemaNonTypes(parentSchema)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "propertyNames":
+        {
+          const {
+            params,
+            parentSchema,
+            schema
+          } = error;
+          const {
+            propertyName
+          } =
+          /** @type {import("ajv").PropertyNamesParams} */
+          params;
+          return `${dataPath} property name '${propertyName}' is invalid${getSchemaNonTypes(parentSchema)}. Property names should be match format ${JSON.stringify(schema.format)}.${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      case "enum":
+        {
+          const {
+            parentSchema
+          } = error;
+
+          if (parentSchema &&
+          /** @type {Schema} */
+          parentSchema.enum &&
+          /** @type {Schema} */
+          parentSchema.enum.length === 1) {
+            return `${dataPath} should be ${this.getSchemaPartText(parentSchema, false, true)}`;
+          }
+
+          return `${dataPath} should be one of these:\n${this.getSchemaPartText(parentSchema)}`;
+        }
+
+      case "const":
+        {
+          const {
+            parentSchema
+          } = error;
+          return `${dataPath} should be equal to constant ${this.getSchemaPartText(parentSchema, false, true)}`;
+        }
+
+      case "not":
+        {
+          const postfix = likeObject(
+          /** @type {Schema} */
+          error.parentSchema) ? `\n${this.getSchemaPartText(error.parentSchema)}` : "";
+          const schemaOutput = this.getSchemaPartText(error.schema, false, false, false);
+
+          if (canApplyNot(error.schema)) {
+            return `${dataPath} should be any ${schemaOutput}${postfix}.`;
+          }
+
+          const {
+            schema,
+            parentSchema
+          } = error;
+          return `${dataPath} should not be ${this.getSchemaPartText(schema, false, true)}${parentSchema && likeObject(parentSchema) ? `\n${this.getSchemaPartText(parentSchema)}` : ""}`;
+        }
+
+      case "oneOf":
+      case "anyOf":
+        {
+          const {
+            parentSchema,
+            children
+          } = error;
+
+          if (children && children.length > 0) {
+            if (error.schema.length === 1) {
+              const lastChild = children[children.length - 1];
+              const remainingChildren = children.slice(0, children.length - 1);
+              return this.formatValidationError(Object.assign({}, lastChild, {
+                children: remainingChildren,
+                parentSchema: Object.assign({}, parentSchema, lastChild.parentSchema)
+              }));
+            }
+
+            let filteredChildren = filterChildren(children);
+
+            if (filteredChildren.length === 1) {
+              return this.formatValidationError(filteredChildren[0]);
+            }
+
+            filteredChildren = groupChildrenByFirstChild(filteredChildren);
+            return `${dataPath} should be one of these:\n${this.getSchemaPartText(parentSchema)}\nDetails:\n${filteredChildren.map(
+            /**
+             * @param {SchemaUtilErrorObject} nestedError
+             * @returns {string}
+             */
+            nestedError => ` * ${indent(this.formatValidationError(nestedError), "   ")}`).join("\n")}`;
+          }
+
+          return `${dataPath} should be one of these:\n${this.getSchemaPartText(parentSchema)}`;
+        }
+
+      case "if":
+        {
+          const {
+            params,
+            parentSchema
+          } = error;
+          const {
+            failingKeyword
+          } =
+          /** @type {import("ajv").IfParams} */
+          params;
+          return `${dataPath} should match "${failingKeyword}" schema:\n${this.getSchemaPartText(parentSchema, [failingKeyword])}`;
+        }
+
+      case "absolutePath":
+        {
+          const {
+            message,
+            parentSchema
+          } = error;
+          return `${dataPath}: ${message}${this.getSchemaPartDescription(parentSchema)}`;
+        }
+
+      /* istanbul ignore next */
+
+      default:
+        {
+          const {
+            message,
+            parentSchema
+          } = error;
+          const ErrorInJSON = JSON.stringify(error, null, 2); // For `custom`, `false schema`, `$ref` keywords
+          // Fallback for unknown keywords
+
+          return `${dataPath} ${message} (${ErrorInJSON}).\n${this.getSchemaPartText(parentSchema, false)}`;
+        }
+    }
+  }
+  /**
+   * @param {Array<SchemaUtilErrorObject>} errors
+   * @returns {string}
+   */
+
+
+  formatValidationErrors(errors) {
+    return errors.map(error => {
+      let formattedError = this.formatValidationError(error);
+
+      if (this.postFormatter) {
+        formattedError = this.postFormatter(formattedError, error);
+      }
+
+      return ` - ${indent(formattedError, "   ")}`;
+    }).join("\n");
+  }
+
+}
+
+var _default = ValidationError;
+exports.default = _default;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/dist/index.js b/node_modules/mathjs/examples/node_modules/schema-utils/dist/index.js
new file mode 100644
index 0000000..47f4345
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/dist/index.js
@@ -0,0 +1,11 @@
+"use strict";
+
+const {
+  validate,
+  ValidationError
+} = require("./validate");
+
+module.exports = {
+  validate,
+  ValidationError
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/dist/keywords/absolutePath.js b/node_modules/mathjs/examples/node_modules/schema-utils/dist/keywords/absolutePath.js
new file mode 100644
index 0000000..0a912da
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/dist/keywords/absolutePath.js
@@ -0,0 +1,93 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+/** @typedef {import("ajv").Ajv} Ajv */
+
+/** @typedef {import("ajv").ValidateFunction} ValidateFunction */
+
+/** @typedef {import("../validate").SchemaUtilErrorObject} SchemaUtilErrorObject */
+
+/**
+ * @param {string} message
+ * @param {object} schema
+ * @param {string} data
+ * @returns {SchemaUtilErrorObject}
+ */
+function errorMessage(message, schema, data) {
+  return {
+    // @ts-ignore
+    // eslint-disable-next-line no-undefined
+    dataPath: undefined,
+    // @ts-ignore
+    // eslint-disable-next-line no-undefined
+    schemaPath: undefined,
+    keyword: "absolutePath",
+    params: {
+      absolutePath: data
+    },
+    message,
+    parentSchema: schema
+  };
+}
+/**
+ * @param {boolean} shouldBeAbsolute
+ * @param {object} schema
+ * @param {string} data
+ * @returns {SchemaUtilErrorObject}
+ */
+
+
+function getErrorFor(shouldBeAbsolute, schema, data) {
+  const message = shouldBeAbsolute ? `The provided value ${JSON.stringify(data)} is not an absolute path!` : `A relative path is expected. However, the provided value ${JSON.stringify(data)} is an absolute path!`;
+  return errorMessage(message, schema, data);
+}
+/**
+ *
+ * @param {Ajv} ajv
+ * @returns {Ajv}
+ */
+
+
+function addAbsolutePathKeyword(ajv) {
+  ajv.addKeyword("absolutePath", {
+    errors: true,
+    type: "string",
+
+    compile(schema, parentSchema) {
+      /** @type {ValidateFunction} */
+      const callback = data => {
+        let passes = true;
+        const isExclamationMarkPresent = data.includes("!");
+
+        if (isExclamationMarkPresent) {
+          callback.errors = [errorMessage(`The provided value ${JSON.stringify(data)} contains exclamation mark (!) which is not allowed because it's reserved for loader syntax.`, parentSchema, data)];
+          passes = false;
+        } // ?:[A-Za-z]:\\ - Windows absolute path
+        // \\\\ - Windows network absolute path
+        // \/ - Unix-like OS absolute path
+
+
+        const isCorrectAbsolutePath = schema === /^(?:[A-Za-z]:(\\|\/)|\\\\|\/)/.test(data);
+
+        if (!isCorrectAbsolutePath) {
+          callback.errors = [getErrorFor(schema, parentSchema, data)];
+          passes = false;
+        }
+
+        return passes;
+      };
+
+      callback.errors = [];
+      return callback;
+    }
+
+  });
+  return ajv;
+}
+
+var _default = addAbsolutePathKeyword;
+exports.default = _default;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/dist/util/Range.js b/node_modules/mathjs/examples/node_modules/schema-utils/dist/util/Range.js
new file mode 100644
index 0000000..14b2431
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/dist/util/Range.js
@@ -0,0 +1,163 @@
+"use strict";
+
+/**
+ * @typedef {[number, boolean]} RangeValue
+ */
+
+/**
+ * @callback RangeValueCallback
+ * @param {RangeValue} rangeValue
+ * @returns {boolean}
+ */
+class Range {
+  /**
+   * @param {"left" | "right"} side
+   * @param {boolean} exclusive
+   * @returns {">" | ">=" | "<" | "<="}
+   */
+  static getOperator(side, exclusive) {
+    if (side === "left") {
+      return exclusive ? ">" : ">=";
+    }
+
+    return exclusive ? "<" : "<=";
+  }
+  /**
+   * @param {number} value
+   * @param {boolean} logic is not logic applied
+   * @param {boolean} exclusive is range exclusive
+   * @returns {string}
+   */
+
+
+  static formatRight(value, logic, exclusive) {
+    if (logic === false) {
+      return Range.formatLeft(value, !logic, !exclusive);
+    }
+
+    return `should be ${Range.getOperator("right", exclusive)} ${value}`;
+  }
+  /**
+   * @param {number} value
+   * @param {boolean} logic is not logic applied
+   * @param {boolean} exclusive is range exclusive
+   * @returns {string}
+   */
+
+
+  static formatLeft(value, logic, exclusive) {
+    if (logic === false) {
+      return Range.formatRight(value, !logic, !exclusive);
+    }
+
+    return `should be ${Range.getOperator("left", exclusive)} ${value}`;
+  }
+  /**
+   * @param {number} start left side value
+   * @param {number} end right side value
+   * @param {boolean} startExclusive is range exclusive from left side
+   * @param {boolean} endExclusive is range exclusive from right side
+   * @param {boolean} logic is not logic applied
+   * @returns {string}
+   */
+
+
+  static formatRange(start, end, startExclusive, endExclusive, logic) {
+    let result = "should be";
+    result += ` ${Range.getOperator(logic ? "left" : "right", logic ? startExclusive : !startExclusive)} ${start} `;
+    result += logic ? "and" : "or";
+    result += ` ${Range.getOperator(logic ? "right" : "left", logic ? endExclusive : !endExclusive)} ${end}`;
+    return result;
+  }
+  /**
+   * @param {Array<RangeValue>} values
+   * @param {boolean} logic is not logic applied
+   * @return {RangeValue} computed value and it's exclusive flag
+   */
+
+
+  static getRangeValue(values, logic) {
+    let minMax = logic ? Infinity : -Infinity;
+    let j = -1;
+    const predicate = logic ?
+    /** @type {RangeValueCallback} */
+    ([value]) => value <= minMax :
+    /** @type {RangeValueCallback} */
+    ([value]) => value >= minMax;
+
+    for (let i = 0; i < values.length; i++) {
+      if (predicate(values[i])) {
+        [minMax] = values[i];
+        j = i;
+      }
+    }
+
+    if (j > -1) {
+      return values[j];
+    }
+
+    return [Infinity, true];
+  }
+
+  constructor() {
+    /** @type {Array<RangeValue>} */
+    this._left = [];
+    /** @type {Array<RangeValue>} */
+
+    this._right = [];
+  }
+  /**
+   * @param {number} value
+   * @param {boolean=} exclusive
+   */
+
+
+  left(value, exclusive = false) {
+    this._left.push([value, exclusive]);
+  }
+  /**
+   * @param {number} value
+   * @param {boolean=} exclusive
+   */
+
+
+  right(value, exclusive = false) {
+    this._right.push([value, exclusive]);
+  }
+  /**
+   * @param {boolean} logic is not logic applied
+   * @return {string} "smart" range string representation
+   */
+
+
+  format(logic = true) {
+    const [start, leftExclusive] = Range.getRangeValue(this._left, logic);
+    const [end, rightExclusive] = Range.getRangeValue(this._right, !logic);
+
+    if (!Number.isFinite(start) && !Number.isFinite(end)) {
+      return "";
+    }
+
+    const realStart = leftExclusive ? start + 1 : start;
+    const realEnd = rightExclusive ? end - 1 : end; // e.g. 5 < x < 7, 5 < x <= 6, 6 <= x <= 6
+
+    if (realStart === realEnd) {
+      return `should be ${logic ? "" : "!"}= ${realStart}`;
+    } // e.g. 4 < x < ∞
+
+
+    if (Number.isFinite(start) && !Number.isFinite(end)) {
+      return Range.formatLeft(start, logic, leftExclusive);
+    } // e.g. ∞ < x < 4
+
+
+    if (!Number.isFinite(start) && Number.isFinite(end)) {
+      return Range.formatRight(end, logic, rightExclusive);
+    }
+
+    return Range.formatRange(start, end, leftExclusive, rightExclusive, logic);
+  }
+
+}
+
+module.exports = Range;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/dist/util/hints.js b/node_modules/mathjs/examples/node_modules/schema-utils/dist/util/hints.js
new file mode 100644
index 0000000..4317b86
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/dist/util/hints.js
@@ -0,0 +1,105 @@
+"use strict";
+
+const Range = require("./Range");
+/** @typedef {import("../validate").Schema} Schema */
+
+/**
+ * @param {Schema} schema
+ * @param {boolean} logic
+ * @return {string[]}
+ */
+
+
+module.exports.stringHints = function stringHints(schema, logic) {
+  const hints = [];
+  let type = "string";
+  const currentSchema = { ...schema
+  };
+
+  if (!logic) {
+    const tmpLength = currentSchema.minLength;
+    const tmpFormat = currentSchema.formatMinimum;
+    const tmpExclusive = currentSchema.formatExclusiveMaximum;
+    currentSchema.minLength = currentSchema.maxLength;
+    currentSchema.maxLength = tmpLength;
+    currentSchema.formatMinimum = currentSchema.formatMaximum;
+    currentSchema.formatMaximum = tmpFormat;
+    currentSchema.formatExclusiveMaximum = !currentSchema.formatExclusiveMinimum;
+    currentSchema.formatExclusiveMinimum = !tmpExclusive;
+  }
+
+  if (typeof currentSchema.minLength === "number") {
+    if (currentSchema.minLength === 1) {
+      type = "non-empty string";
+    } else {
+      const length = Math.max(currentSchema.minLength - 1, 0);
+      hints.push(`should be longer than ${length} character${length > 1 ? "s" : ""}`);
+    }
+  }
+
+  if (typeof currentSchema.maxLength === "number") {
+    if (currentSchema.maxLength === 0) {
+      type = "empty string";
+    } else {
+      const length = currentSchema.maxLength + 1;
+      hints.push(`should be shorter than ${length} character${length > 1 ? "s" : ""}`);
+    }
+  }
+
+  if (currentSchema.pattern) {
+    hints.push(`should${logic ? "" : " not"} match pattern ${JSON.stringify(currentSchema.pattern)}`);
+  }
+
+  if (currentSchema.format) {
+    hints.push(`should${logic ? "" : " not"} match format ${JSON.stringify(currentSchema.format)}`);
+  }
+
+  if (currentSchema.formatMinimum) {
+    hints.push(`should be ${currentSchema.formatExclusiveMinimum ? ">" : ">="} ${JSON.stringify(currentSchema.formatMinimum)}`);
+  }
+
+  if (currentSchema.formatMaximum) {
+    hints.push(`should be ${currentSchema.formatExclusiveMaximum ? "<" : "<="} ${JSON.stringify(currentSchema.formatMaximum)}`);
+  }
+
+  return [type].concat(hints);
+};
+/**
+ * @param {Schema} schema
+ * @param {boolean} logic
+ * @return {string[]}
+ */
+
+
+module.exports.numberHints = function numberHints(schema, logic) {
+  const hints = [schema.type === "integer" ? "integer" : "number"];
+  const range = new Range();
+
+  if (typeof schema.minimum === "number") {
+    range.left(schema.minimum);
+  }
+
+  if (typeof schema.exclusiveMinimum === "number") {
+    range.left(schema.exclusiveMinimum, true);
+  }
+
+  if (typeof schema.maximum === "number") {
+    range.right(schema.maximum);
+  }
+
+  if (typeof schema.exclusiveMaximum === "number") {
+    range.right(schema.exclusiveMaximum, true);
+  }
+
+  const rangeFormat = range.format(logic);
+
+  if (rangeFormat) {
+    hints.push(rangeFormat);
+  }
+
+  if (typeof schema.multipleOf === "number") {
+    hints.push(`should${logic ? "" : " not"} be multiple of ${schema.multipleOf}`);
+  }
+
+  return hints;
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/dist/validate.js b/node_modules/mathjs/examples/node_modules/schema-utils/dist/validate.js
new file mode 100644
index 0000000..8689ef0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/dist/validate.js
@@ -0,0 +1,163 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.validate = validate;
+Object.defineProperty(exports, "ValidationError", {
+  enumerable: true,
+  get: function () {
+    return _ValidationError.default;
+  }
+});
+
+var _absolutePath = _interopRequireDefault(require("./keywords/absolutePath"));
+
+var _ValidationError = _interopRequireDefault(require("./ValidationError"));
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+// Use CommonJS require for ajv libs so TypeScript consumers aren't locked into esModuleInterop (see #110).
+const Ajv = require("ajv");
+
+const ajvKeywords = require("ajv-keywords");
+/** @typedef {import("json-schema").JSONSchema4} JSONSchema4 */
+
+/** @typedef {import("json-schema").JSONSchema6} JSONSchema6 */
+
+/** @typedef {import("json-schema").JSONSchema7} JSONSchema7 */
+
+/** @typedef {import("ajv").ErrorObject} ErrorObject */
+
+/**
+ * @typedef {Object} Extend
+ * @property {number=} formatMinimum
+ * @property {number=} formatMaximum
+ * @property {boolean=} formatExclusiveMinimum
+ * @property {boolean=} formatExclusiveMaximum
+ * @property {string=} link
+ */
+
+/** @typedef {(JSONSchema4 | JSONSchema6 | JSONSchema7) & Extend} Schema */
+
+/** @typedef {ErrorObject & { children?: Array<ErrorObject>}} SchemaUtilErrorObject */
+
+/**
+ * @callback PostFormatter
+ * @param {string} formattedError
+ * @param {SchemaUtilErrorObject} error
+ * @returns {string}
+ */
+
+/**
+ * @typedef {Object} ValidationErrorConfiguration
+ * @property {string=} name
+ * @property {string=} baseDataPath
+ * @property {PostFormatter=} postFormatter
+ */
+
+
+const ajv = new Ajv({
+  allErrors: true,
+  verbose: true,
+  $data: true
+});
+ajvKeywords(ajv, ["instanceof", "formatMinimum", "formatMaximum", "patternRequired"]); // Custom keywords
+
+(0, _absolutePath.default)(ajv);
+/**
+ * @param {Schema} schema
+ * @param {Array<object> | object} options
+ * @param {ValidationErrorConfiguration=} configuration
+ * @returns {void}
+ */
+
+function validate(schema, options, configuration) {
+  let errors = [];
+
+  if (Array.isArray(options)) {
+    errors = Array.from(options, nestedOptions => validateObject(schema, nestedOptions));
+    errors.forEach((list, idx) => {
+      const applyPrefix =
+      /**
+       * @param {SchemaUtilErrorObject} error
+       */
+      error => {
+        // eslint-disable-next-line no-param-reassign
+        error.dataPath = `[${idx}]${error.dataPath}`;
+
+        if (error.children) {
+          error.children.forEach(applyPrefix);
+        }
+      };
+
+      list.forEach(applyPrefix);
+    });
+    errors = errors.reduce((arr, items) => {
+      arr.push(...items);
+      return arr;
+    }, []);
+  } else {
+    errors = validateObject(schema, options);
+  }
+
+  if (errors.length > 0) {
+    throw new _ValidationError.default(errors, schema, configuration);
+  }
+}
+/**
+ * @param {Schema} schema
+ * @param {Array<object> | object} options
+ * @returns {Array<SchemaUtilErrorObject>}
+ */
+
+
+function validateObject(schema, options) {
+  const compiledSchema = ajv.compile(schema);
+  const valid = compiledSchema(options);
+  if (valid) return [];
+  return compiledSchema.errors ? filterErrors(compiledSchema.errors) : [];
+}
+/**
+ * @param {Array<ErrorObject>} errors
+ * @returns {Array<SchemaUtilErrorObject>}
+ */
+
+
+function filterErrors(errors) {
+  /** @type {Array<SchemaUtilErrorObject>} */
+  let newErrors = [];
+
+  for (const error of
+  /** @type {Array<SchemaUtilErrorObject>} */
+  errors) {
+    const {
+      dataPath
+    } = error;
+    /** @type {Array<SchemaUtilErrorObject>} */
+
+    let children = [];
+    newErrors = newErrors.filter(oldError => {
+      if (oldError.dataPath.includes(dataPath)) {
+        if (oldError.children) {
+          children = children.concat(oldError.children.slice(0));
+        } // eslint-disable-next-line no-undefined, no-param-reassign
+
+
+        oldError.children = undefined;
+        children.push(oldError);
+        return false;
+      }
+
+      return true;
+    });
+
+    if (children.length) {
+      error.children = children;
+    }
+
+    newErrors.push(error);
+  }
+
+  return newErrors;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/schema-utils/package.json b/node_modules/mathjs/examples/node_modules/schema-utils/package.json
new file mode 100644
index 0000000..912eaba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/schema-utils/package.json
@@ -0,0 +1,78 @@
+{
+  "name": "schema-utils",
+  "version": "3.1.1",
+  "description": "webpack Validation Utils",
+  "license": "MIT",
+  "repository": "webpack/schema-utils",
+  "author": "webpack Contrib (https://github.com/webpack-contrib)",
+  "homepage": "https://github.com/webpack/schema-utils",
+  "bugs": "https://github.com/webpack/schema-utils/issues",
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/webpack"
+  },
+  "main": "dist/index.js",
+  "types": "declarations/index.d.ts",
+  "engines": {
+    "node": ">= 10.13.0"
+  },
+  "scripts": {
+    "start": "npm run build -- -w",
+    "clean": "del-cli dist declarations",
+    "prebuild": "npm run clean",
+    "build:types": "tsc --declaration --emitDeclarationOnly --outDir declarations && prettier \"declarations/**/*.ts\" --write",
+    "build:code": "cross-env NODE_ENV=production babel src -d dist --copy-files",
+    "build": "npm-run-all -p \"build:**\"",
+    "commitlint": "commitlint --from=master",
+    "security": "npm audit --production",
+    "fmt:check": "prettier \"{**/*,*}.{js,json,md,yml,css,ts}\" --list-different",
+    "lint:js": "eslint --cache .",
+    "lint:types": "tsc --pretty --noEmit",
+    "lint": "npm-run-all lint:js lint:types fmt:check",
+    "fmt": "npm run fmt:check -- --write",
+    "fix:js": "npm run lint:js -- --fix",
+    "fix": "npm-run-all fix:js fmt",
+    "test:only": "cross-env NODE_ENV=test jest",
+    "test:watch": "npm run test:only -- --watch",
+    "test:coverage": "npm run test:only -- --collectCoverageFrom=\"src/**/*.js\" --coverage",
+    "pretest": "npm run lint",
+    "test": "npm run test:coverage",
+    "prepare": "npm run build && husky install",
+    "release": "standard-version"
+  },
+  "files": [
+    "dist",
+    "declarations"
+  ],
+  "dependencies": {
+    "@types/json-schema": "^7.0.8",
+    "ajv": "^6.12.5",
+    "ajv-keywords": "^3.5.2"
+  },
+  "devDependencies": {
+    "@babel/cli": "^7.14.3",
+    "@babel/core": "^7.14.6",
+    "@babel/preset-env": "^7.14.7",
+    "@commitlint/cli": "^12.1.4",
+    "@commitlint/config-conventional": "^12.1.4",
+    "@webpack-contrib/eslint-config-webpack": "^3.0.0",
+    "babel-jest": "^27.0.6",
+    "cross-env": "^7.0.3",
+    "del": "^6.0.0",
+    "del-cli": "^3.0.1",
+    "eslint": "^7.31.0",
+    "eslint-config-prettier": "^8.3.0",
+    "eslint-plugin-import": "^2.23.4",
+    "husky": "^6.0.0",
+    "jest": "^27.0.6",
+    "lint-staged": "^11.0.1",
+    "npm-run-all": "^4.1.5",
+    "prettier": "^2.3.2",
+    "standard-version": "^9.3.1",
+    "typescript": "^4.3.5",
+    "webpack": "^5.45.1"
+  },
+  "keywords": [
+    "webpack"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/serialize-javascript/LICENSE b/node_modules/mathjs/examples/node_modules/serialize-javascript/LICENSE
new file mode 100644
index 0000000..263382a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/serialize-javascript/LICENSE
@@ -0,0 +1,27 @@
+Copyright 2014 Yahoo! Inc.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+    * Neither the name of the Yahoo! Inc. nor the
+      names of its contributors may be used to endorse or promote products
+      derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL YAHOO! INC. BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/serialize-javascript/README.md b/node_modules/mathjs/examples/node_modules/serialize-javascript/README.md
new file mode 100644
index 0000000..8736fdb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/serialize-javascript/README.md
@@ -0,0 +1,142 @@
+Serialize JavaScript
+====================
+
+Serialize JavaScript to a _superset_ of JSON that includes regular expressions, dates and functions.
+
+[![npm Version][npm-badge]][npm]
+[![Dependency Status][david-badge]][david]
+![Test](https://github.com/yahoo/serialize-javascript/workflows/Test/badge.svg)
+
+## Overview
+
+The code in this package began its life as an internal module to [express-state][]. To expand its usefulness, it now lives as `serialize-javascript` — an independent package on npm.
+
+You're probably wondering: **What about `JSON.stringify()`!?** We've found that sometimes we need to serialize JavaScript **functions**, **regexps**, **dates**, **sets** or **maps**. A great example is a web app that uses client-side URL routing where the route definitions are regexps that need to be shared from the server to the client. But this module is also great for communicating between node processes.
+
+The string returned from this package's single export function is literal JavaScript which can be saved to a `.js` file, or be embedded into an HTML document by making the content of a `<script>` element.
+
+> **HTML characters and JavaScript line terminators are escaped automatically.**
+
+Please note that serialization for ES6 Sets & Maps requires support for `Array.from` (not available in IE or Node < 0.12), or an `Array.from` polyfill.
+
+## Installation
+
+Install using npm:
+
+```shell
+$ npm install serialize-javascript
+```
+
+## Usage
+
+```js
+var serialize = require('serialize-javascript');
+
+serialize({
+    str  : 'string',
+    num  : 0,
+    obj  : {foo: 'foo'},
+    arr  : [1, 2, 3],
+    bool : true,
+    nil  : null,
+    undef: undefined,
+    inf  : Infinity,
+    date : new Date("Thu, 28 Apr 2016 22:02:17 GMT"),
+    map  : new Map([['hello', 'world']]),
+    set  : new Set([123, 456]),
+    fn   : function echo(arg) { return arg; },
+    re   : /([^\s]+)/g,
+    big  : BigInt(10),
+});
+```
+
+The above will produce the following string output:
+
+```js
+'{"str":"string","num":0,"obj":{"foo":"foo"},"arr":[1,2,3],"bool":true,"nil":null,"undef":undefined,"inf":Infinity,"date":new Date("2016-04-28T22:02:17.000Z"),"map":new Map([["hello","world"]]),"set":new Set([123,456]),"fn":function echo(arg) { return arg; },"re":new RegExp("([^\\\\s]+)", "g"),"big":BigInt("10")}'
+```
+
+Note: to produced a beautified string, you can pass an optional second argument to `serialize()` to define the number of spaces to be used for the indentation.
+
+### Automatic Escaping of HTML Characters
+
+A primary feature of this package is to serialize code to a string of literal JavaScript which can be embedded in an HTML document by adding it as the contents of the `<script>` element. In order to make this safe, HTML characters and JavaScript line terminators are escaped automatically.
+
+```js
+serialize({
+    haxorXSS: '</script>'
+});
+```
+
+The above will produce the following string, HTML-escaped output which is safe to put into an HTML document as it will not cause the inline script element to terminate:
+
+```js
+'{"haxorXSS":"\\u003C\\u002Fscript\\u003E"}'
+```
+
+> You can pass an optional `unsafe` argument to `serialize()` for straight serialization.
+
+### Options
+
+The `serialize()` function accepts an `options` object as its second argument. All options are being defaulted to `undefined`:
+
+#### `options.space`
+
+This option is the same as the `space` argument that can be passed to [`JSON.stringify`][JSON.stringify]. It can be used to add whitespace and indentation to the serialized output to make it more readable.
+
+```js
+serialize(obj, {space: 2});
+```
+
+#### `options.isJSON`
+
+This option is a signal to `serialize()` that the object being serialized does not contain any function or regexps values. This enables a hot-path that allows serialization to be over 3x faster. If you're serializing a lot of data, and know its pure JSON, then you can enable this option for a speed-up.
+
+**Note:** That when using this option, the output will still be escaped to protect against XSS.
+
+```js
+serialize(obj, {isJSON: true});
+```
+
+#### `options.unsafe`
+
+This option is to signal `serialize()` that we want to do a straight conversion, without the XSS protection. This options needs to be explicitly set to `true`. HTML characters and JavaScript line terminators will not be escaped. You will have to roll your own.
+
+```js
+serialize(obj, {unsafe: true});
+```
+
+#### `options.ignoreFunction`
+
+This option is to signal `serialize()` that we do not want serialize JavaScript function. 
+Just treat function like `JSON.stringify` do, but other features will work as expected.
+
+```js
+serialize(obj, {ignoreFunction: true});
+```
+
+## Deserializing
+
+For some use cases you might also need to deserialize the string. This is explicitly not part of this module. However, you can easily write it yourself:
+
+```js
+function deserialize(serializedJavascript){
+  return eval('(' + serializedJavascript + ')');
+}
+```
+
+**Note:** Don't forget the parentheses around the serialized javascript, as the opening bracket `{` will be considered to be the start of a body.
+
+## License
+
+This software is free to use under the Yahoo! Inc. BSD license.
+See the [LICENSE file][LICENSE] for license text and copyright information.
+
+
+[npm]: https://www.npmjs.org/package/serialize-javascript
+[npm-badge]: https://img.shields.io/npm/v/serialize-javascript.svg?style=flat-square
+[david]: https://david-dm.org/yahoo/serialize-javascript
+[david-badge]: https://img.shields.io/david/yahoo/serialize-javascript.svg?style=flat-square
+[express-state]: https://github.com/yahoo/express-state
+[JSON.stringify]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify
+[LICENSE]: https://github.com/yahoo/serialize-javascript/blob/main/LICENSE
diff --git a/node_modules/mathjs/examples/node_modules/serialize-javascript/index.js b/node_modules/mathjs/examples/node_modules/serialize-javascript/index.js
new file mode 100644
index 0000000..ab82742
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/serialize-javascript/index.js
@@ -0,0 +1,268 @@
+/*
+Copyright (c) 2014, Yahoo! Inc. All rights reserved.
+Copyrights licensed under the New BSD License.
+See the accompanying LICENSE file for terms.
+*/
+
+'use strict';
+
+var randomBytes = require('randombytes');
+
+// Generate an internal UID to make the regexp pattern harder to guess.
+var UID_LENGTH          = 16;
+var UID                 = generateUID();
+var PLACE_HOLDER_REGEXP = new RegExp('(\\\\)?"@__(F|R|D|M|S|A|U|I|B|L)-' + UID + '-(\\d+)__@"', 'g');
+
+var IS_NATIVE_CODE_REGEXP = /\{\s*\[native code\]\s*\}/g;
+var IS_PURE_FUNCTION = /function.*?\(/;
+var IS_ARROW_FUNCTION = /.*?=>.*?/;
+var UNSAFE_CHARS_REGEXP   = /[<>\/\u2028\u2029]/g;
+
+var RESERVED_SYMBOLS = ['*', 'async'];
+
+// Mapping of unsafe HTML and invalid JavaScript line terminator chars to their
+// Unicode char counterparts which are safe to use in JavaScript strings.
+var ESCAPED_CHARS = {
+    '<'     : '\\u003C',
+    '>'     : '\\u003E',
+    '/'     : '\\u002F',
+    '\u2028': '\\u2028',
+    '\u2029': '\\u2029'
+};
+
+function escapeUnsafeChars(unsafeChar) {
+    return ESCAPED_CHARS[unsafeChar];
+}
+
+function generateUID() {
+    var bytes = randomBytes(UID_LENGTH);
+    var result = '';
+    for(var i=0; i<UID_LENGTH; ++i) {
+        result += bytes[i].toString(16);
+    }
+    return result;
+}
+
+function deleteFunctions(obj){
+    var functionKeys = [];
+    for (var key in obj) {
+        if (typeof obj[key] === "function") {
+            functionKeys.push(key);
+        }
+    }
+    for (var i = 0; i < functionKeys.length; i++) {
+        delete obj[functionKeys[i]];
+    }
+}
+
+module.exports = function serialize(obj, options) {
+    options || (options = {});
+
+    // Backwards-compatibility for `space` as the second argument.
+    if (typeof options === 'number' || typeof options === 'string') {
+        options = {space: options};
+    }
+
+    var functions = [];
+    var regexps   = [];
+    var dates     = [];
+    var maps      = [];
+    var sets      = [];
+    var arrays    = [];
+    var undefs    = [];
+    var infinities= [];
+    var bigInts = [];
+    var urls = [];
+
+    // Returns placeholders for functions and regexps (identified by index)
+    // which are later replaced by their string representation.
+    function replacer(key, value) {
+
+        // For nested function
+        if(options.ignoreFunction){
+            deleteFunctions(value);
+        }
+
+        if (!value && value !== undefined) {
+            return value;
+        }
+
+        // If the value is an object w/ a toJSON method, toJSON is called before
+        // the replacer runs, so we use this[key] to get the non-toJSONed value.
+        var origValue = this[key];
+        var type = typeof origValue;
+
+        if (type === 'object') {
+            if(origValue instanceof RegExp) {
+                return '@__R-' + UID + '-' + (regexps.push(origValue) - 1) + '__@';
+            }
+
+            if(origValue instanceof Date) {
+                return '@__D-' + UID + '-' + (dates.push(origValue) - 1) + '__@';
+            }
+
+            if(origValue instanceof Map) {
+                return '@__M-' + UID + '-' + (maps.push(origValue) - 1) + '__@';
+            }
+
+            if(origValue instanceof Set) {
+                return '@__S-' + UID + '-' + (sets.push(origValue) - 1) + '__@';
+            }
+
+            if(origValue instanceof Array) {
+                var isSparse = origValue.filter(function(){return true}).length !== origValue.length;
+                if (isSparse) {
+                    return '@__A-' + UID + '-' + (arrays.push(origValue) - 1) + '__@';
+                }
+            }
+
+            if(origValue instanceof URL) {
+                return '@__L-' + UID + '-' + (urls.push(origValue) - 1) + '__@';
+            }
+        }
+
+        if (type === 'function') {
+            return '@__F-' + UID + '-' + (functions.push(origValue) - 1) + '__@';
+        }
+
+        if (type === 'undefined') {
+            return '@__U-' + UID + '-' + (undefs.push(origValue) - 1) + '__@';
+        }
+
+        if (type === 'number' && !isNaN(origValue) && !isFinite(origValue)) {
+            return '@__I-' + UID + '-' + (infinities.push(origValue) - 1) + '__@';
+        }
+
+        if (type === 'bigint') {
+            return '@__B-' + UID + '-' + (bigInts.push(origValue) - 1) + '__@';
+        }
+
+        return value;
+    }
+
+    function serializeFunc(fn) {
+      var serializedFn = fn.toString();
+      if (IS_NATIVE_CODE_REGEXP.test(serializedFn)) {
+          throw new TypeError('Serializing native function: ' + fn.name);
+      }
+
+      // pure functions, example: {key: function() {}}
+      if(IS_PURE_FUNCTION.test(serializedFn)) {
+          return serializedFn;
+      }
+
+      // arrow functions, example: arg1 => arg1+5
+      if(IS_ARROW_FUNCTION.test(serializedFn)) {
+          return serializedFn;
+      }
+
+      var argsStartsAt = serializedFn.indexOf('(');
+      var def = serializedFn.substr(0, argsStartsAt)
+        .trim()
+        .split(' ')
+        .filter(function(val) { return val.length > 0 });
+
+      var nonReservedSymbols = def.filter(function(val) {
+        return RESERVED_SYMBOLS.indexOf(val) === -1
+      });
+
+      // enhanced literal objects, example: {key() {}}
+      if(nonReservedSymbols.length > 0) {
+          return (def.indexOf('async') > -1 ? 'async ' : '') + 'function'
+            + (def.join('').indexOf('*') > -1 ? '*' : '')
+            + serializedFn.substr(argsStartsAt);
+      }
+
+      // arrow functions
+      return serializedFn;
+    }
+
+    // Check if the parameter is function
+    if (options.ignoreFunction && typeof obj === "function") {
+        obj = undefined;
+    }
+    // Protects against `JSON.stringify()` returning `undefined`, by serializing
+    // to the literal string: "undefined".
+    if (obj === undefined) {
+        return String(obj);
+    }
+
+    var str;
+
+    // Creates a JSON string representation of the value.
+    // NOTE: Node 0.12 goes into slow mode with extra JSON.stringify() args.
+    if (options.isJSON && !options.space) {
+        str = JSON.stringify(obj);
+    } else {
+        str = JSON.stringify(obj, options.isJSON ? null : replacer, options.space);
+    }
+
+    // Protects against `JSON.stringify()` returning `undefined`, by serializing
+    // to the literal string: "undefined".
+    if (typeof str !== 'string') {
+        return String(str);
+    }
+
+    // Replace unsafe HTML and invalid JavaScript line terminator chars with
+    // their safe Unicode char counterpart. This _must_ happen before the
+    // regexps and functions are serialized and added back to the string.
+    if (options.unsafe !== true) {
+        str = str.replace(UNSAFE_CHARS_REGEXP, escapeUnsafeChars);
+    }
+
+    if (functions.length === 0 && regexps.length === 0 && dates.length === 0 && maps.length === 0 && sets.length === 0 && arrays.length === 0 && undefs.length === 0 && infinities.length === 0 && bigInts.length === 0 && urls.length === 0) {
+        return str;
+    }
+
+    // Replaces all occurrences of function, regexp, date, map and set placeholders in the
+    // JSON string with their string representations. If the original value can
+    // not be found, then `undefined` is used.
+    return str.replace(PLACE_HOLDER_REGEXP, function (match, backSlash, type, valueIndex) {
+        // The placeholder may not be preceded by a backslash. This is to prevent
+        // replacing things like `"a\"@__R-<UID>-0__@"` and thus outputting
+        // invalid JS.
+        if (backSlash) {
+            return match;
+        }
+
+        if (type === 'D') {
+            return "new Date(\"" + dates[valueIndex].toISOString() + "\")";
+        }
+
+        if (type === 'R') {
+            return "new RegExp(" + serialize(regexps[valueIndex].source) + ", \"" + regexps[valueIndex].flags + "\")";
+        }
+
+        if (type === 'M') {
+            return "new Map(" + serialize(Array.from(maps[valueIndex].entries()), options) + ")";
+        }
+
+        if (type === 'S') {
+            return "new Set(" + serialize(Array.from(sets[valueIndex].values()), options) + ")";
+        }
+
+        if (type === 'A') {
+            return "Array.prototype.slice.call(" + serialize(Object.assign({ length: arrays[valueIndex].length }, arrays[valueIndex]), options) + ")";
+        }
+
+        if (type === 'U') {
+            return 'undefined'
+        }
+
+        if (type === 'I') {
+            return infinities[valueIndex];
+        }
+
+        if (type === 'B') {
+            return "BigInt(\"" + bigInts[valueIndex] + "\")";
+        }
+
+        if (type === 'L') {
+            return "new URL(\"" + urls[valueIndex].toString() + "\")"; 
+        }
+
+        var fn = functions[valueIndex];
+
+        return serializeFunc(fn);
+    });
+}
diff --git a/node_modules/mathjs/examples/node_modules/serialize-javascript/package.json b/node_modules/mathjs/examples/node_modules/serialize-javascript/package.json
new file mode 100644
index 0000000..caacd5d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/serialize-javascript/package.json
@@ -0,0 +1,36 @@
+{
+  "name": "serialize-javascript",
+  "version": "6.0.0",
+  "description": "Serialize JavaScript to a superset of JSON that includes regular expressions and functions.",
+  "main": "index.js",
+  "scripts": {
+    "benchmark": "node -v && node test/benchmark/serialize.js",
+    "test": "nyc --reporter=lcov mocha test/unit"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/yahoo/serialize-javascript.git"
+  },
+  "keywords": [
+    "serialize",
+    "serialization",
+    "javascript",
+    "js",
+    "json"
+  ],
+  "author": "Eric Ferraiuolo <edf@ericf.me>",
+  "license": "BSD-3-Clause",
+  "bugs": {
+    "url": "https://github.com/yahoo/serialize-javascript/issues"
+  },
+  "homepage": "https://github.com/yahoo/serialize-javascript",
+  "devDependencies": {
+    "benchmark": "^2.1.4",
+    "chai": "^4.1.0",
+    "mocha": "^9.0.0",
+    "nyc": "^15.0.0"
+  },
+  "dependencies": {
+    "randombytes": "^2.1.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/shallow-clone/LICENSE b/node_modules/mathjs/examples/node_modules/shallow-clone/LICENSE
new file mode 100644
index 0000000..7cccaf9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shallow-clone/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015-present, Jon Schlinkert.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/shallow-clone/README.md b/node_modules/mathjs/examples/node_modules/shallow-clone/README.md
new file mode 100644
index 0000000..ea7514e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shallow-clone/README.md
@@ -0,0 +1,153 @@
+# shallow-clone [![Donate](https://img.shields.io/badge/Donate-PayPal-green.svg)](https://www.paypal.com/cgi-bin/webscr?cmd=_s-xclick&hosted_button_id=W8YFZ425KND68) [![NPM version](https://img.shields.io/npm/v/shallow-clone.svg?style=flat)](https://www.npmjs.com/package/shallow-clone) [![NPM monthly downloads](https://img.shields.io/npm/dm/shallow-clone.svg?style=flat)](https://npmjs.org/package/shallow-clone) [![NPM total downloads](https://img.shields.io/npm/dt/shallow-clone.svg?style=flat)](https://npmjs.org/package/shallow-clone) [![Linux Build Status](https://img.shields.io/travis/jonschlinkert/shallow-clone.svg?style=flat&label=Travis)](https://travis-ci.org/jonschlinkert/shallow-clone)
+
+> Creates a shallow clone of any JavaScript value.
+
+Please consider following this project's author, [Jon Schlinkert](https://github.com/jonschlinkert), and consider starring the project to show your :heart: and support.
+
+## Install
+
+Install with [npm](https://www.npmjs.com/):
+
+```sh
+$ npm install --save shallow-clone
+```
+
+## Usage
+
+```js
+const clone = require('shallow-clone');
+```
+
+**Supports**
+
+* array buffers
+* arrays
+* buffers
+* dates
+* errors
+* float32 arrays
+* float64 arrays
+* int16 arrays
+* int32 arrays
+* int8 arrays
+* maps
+* objects
+* primitives
+* regular expressions
+* sets
+* symbols
+* uint16 arrays
+* uint32 arrays
+* uint8 arrays
+* uint8clamped arrays
+
+## Arrays
+
+By default, only the array itself is cloned (shallow), use [clone-deep](https://github.com/jonschlinkert/clone-deep) if you also need the elements in the array to be cloned.
+
+```js
+const arr = [{ a: 0 }, { b: 1 }];
+const foo = clone(arr);
+// foo =>  [{ 'a': 0 }, { 'b': 1 }]
+
+// array is cloned
+assert(actual === expected); // false
+
+// array elements are not
+assert.deepEqual(actual[0], expected[0]); // true
+```
+
+## Objects
+
+Only the object is shallow cloned, use [clone-deep](https://github.com/jonschlinkert/clone-deep) if you also need the values in the object to be cloned.
+
+```js
+console.log(clone({ a: 1, b: 2, c: 3 }));
+//=> {a: 1, b: 2, c: 3 }
+```
+
+## RegExp
+
+Clones regular expressions and flags, and preserves the `.lastIndex`.
+
+```js
+const regex = clone(/foo/g); //=> /foo/g
+// you can manually reset lastIndex if necessary
+regex.lastIndex = 0;
+```
+
+## Primitives
+
+Simply returns primitives unchanged.
+
+```js
+clone(0); //=> 0
+clone('foo'); //=> 'foo'
+```
+
+## About
+
+<details>
+<summary><strong>Contributing</strong></summary>
+
+Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
+
+</details>
+
+<details>
+<summary><strong>Running Tests</strong></summary>
+
+Running and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command:
+
+```sh
+$ npm install && npm test
+```
+
+</details>
+
+<details>
+<summary><strong>Building docs</strong></summary>
+
+_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_
+
+To generate the readme, run the following command:
+
+```sh
+$ npm install -g verbose/verb#dev verb-generate-readme && verb
+```
+
+</details>
+
+### Related projects
+
+You might also be interested in these projects:
+
+* [assign-deep](https://www.npmjs.com/package/assign-deep): Deeply assign the values of all enumerable-own-properties and symbols from one or more source objects… [more](https://github.com/jonschlinkert/assign-deep) | [homepage](https://github.com/jonschlinkert/assign-deep "Deeply assign the values of all enumerable-own-properties and symbols from one or more source objects to a target object. Returns the target object.")
+* [clone-deep](https://www.npmjs.com/package/clone-deep): Recursively (deep) clone JavaScript native types, like Object, Array, RegExp, Date as well as primitives. | [homepage](https://github.com/jonschlinkert/clone-deep "Recursively (deep) clone JavaScript native types, like Object, Array, RegExp, Date as well as primitives.")
+* [is-plain-object](https://www.npmjs.com/package/is-plain-object): Returns true if an object was created by the `Object` constructor. | [homepage](https://github.com/jonschlinkert/is-plain-object "Returns true if an object was created by the `Object` constructor.")
+* [kind-of](https://www.npmjs.com/package/kind-of): Get the native type of a value. | [homepage](https://github.com/jonschlinkert/kind-of "Get the native type of a value.")
+
+### Contributors
+
+| **Commits** | **Contributor** |  
+| --- | --- |  
+| 20 | [jonschlinkert](https://github.com/jonschlinkert) |  
+| 2  | [doowb](https://github.com/doowb) |  
+| 1  | [jakub-g](https://github.com/jakub-g) |  
+
+### Author
+
+**Jon Schlinkert**
+
+* [GitHub Profile](https://github.com/jonschlinkert)
+* [Twitter Profile](https://twitter.com/jonschlinkert)
+* [LinkedIn Profile](https://linkedin.com/in/jonschlinkert)
+
+### License
+
+Copyright © 2019, [Jon Schlinkert](https://github.com/jonschlinkert).
+Released under the [MIT License](LICENSE).
+
+***
+
+_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.8.0, on April 15, 2019._
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/shallow-clone/index.js b/node_modules/mathjs/examples/node_modules/shallow-clone/index.js
new file mode 100644
index 0000000..012746f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shallow-clone/index.js
@@ -0,0 +1,83 @@
+/*!
+ * shallow-clone <https://github.com/jonschlinkert/shallow-clone>
+ *
+ * Copyright (c) 2015-present, Jon Schlinkert.
+ * Released under the MIT License.
+ */
+
+'use strict';
+
+const valueOf = Symbol.prototype.valueOf;
+const typeOf = require('kind-of');
+
+function clone(val, deep) {
+  switch (typeOf(val)) {
+    case 'array':
+      return val.slice();
+    case 'object':
+      return Object.assign({}, val);
+    case 'date':
+      return new val.constructor(Number(val));
+    case 'map':
+      return new Map(val);
+    case 'set':
+      return new Set(val);
+    case 'buffer':
+      return cloneBuffer(val);
+    case 'symbol':
+      return cloneSymbol(val);
+    case 'arraybuffer':
+      return cloneArrayBuffer(val);
+    case 'float32array':
+    case 'float64array':
+    case 'int16array':
+    case 'int32array':
+    case 'int8array':
+    case 'uint16array':
+    case 'uint32array':
+    case 'uint8clampedarray':
+    case 'uint8array':
+      return cloneTypedArray(val);
+    case 'regexp':
+      return cloneRegExp(val);
+    case 'error':
+      return Object.create(val);
+    default: {
+      return val;
+    }
+  }
+}
+
+function cloneRegExp(val) {
+  const flags = val.flags !== void 0 ? val.flags : (/\w+$/.exec(val) || void 0);
+  const re = new val.constructor(val.source, flags);
+  re.lastIndex = val.lastIndex;
+  return re;
+}
+
+function cloneArrayBuffer(val) {
+  const res = new val.constructor(val.byteLength);
+  new Uint8Array(res).set(new Uint8Array(val));
+  return res;
+}
+
+function cloneTypedArray(val, deep) {
+  return new val.constructor(val.buffer, val.byteOffset, val.length);
+}
+
+function cloneBuffer(val) {
+  const len = val.length;
+  const buf = Buffer.allocUnsafe ? Buffer.allocUnsafe(len) : Buffer.from(len);
+  val.copy(buf);
+  return buf;
+}
+
+function cloneSymbol(val) {
+  return valueOf ? Object(valueOf.call(val)) : {};
+}
+
+/**
+ * Expose `clone`
+ */
+
+module.exports = clone;
diff --git a/node_modules/mathjs/examples/node_modules/shallow-clone/package.json b/node_modules/mathjs/examples/node_modules/shallow-clone/package.json
new file mode 100644
index 0000000..91f281c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shallow-clone/package.json
@@ -0,0 +1,64 @@
+{
+  "name": "shallow-clone",
+  "description": "Creates a shallow clone of any JavaScript value.",
+  "version": "3.0.1",
+  "homepage": "https://github.com/jonschlinkert/shallow-clone",
+  "author": "Jon Schlinkert (https://github.com/jonschlinkert)",
+  "contributors": [
+    "Brian Woodward (https://twitter.com/doowb)",
+    "Jon Schlinkert (http://twitter.com/jonschlinkert)"
+  ],
+  "repository": "jonschlinkert/shallow-clone",
+  "bugs": {
+    "url": "https://github.com/jonschlinkert/shallow-clone/issues"
+  },
+  "license": "MIT",
+  "files": [
+    "index.js"
+  ],
+  "main": "index.js",
+  "engines": {
+    "node": ">=8"
+  },
+  "scripts": {
+    "test": "mocha"
+  },
+  "dependencies": {
+    "kind-of": "^6.0.2"
+  },
+  "devDependencies": {
+    "gulp-format-md": "^2.0.0",
+    "mocha": "^6.1.3"
+  },
+  "keywords": [
+    "array",
+    "clone",
+    "copy",
+    "extend",
+    "mixin",
+    "object",
+    "primitive",
+    "shallow"
+  ],
+  "verb": {
+    "toc": false,
+    "layout": "default",
+    "tasks": [
+      "readme"
+    ],
+    "plugins": [
+      "gulp-format-md"
+    ],
+    "lint": {
+      "reflinks": true
+    },
+    "related": {
+      "list": [
+        "assign-deep",
+        "clone-deep",
+        "is-plain-object",
+        "kind-of"
+      ]
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/shebang-command/index.js b/node_modules/mathjs/examples/node_modules/shebang-command/index.js
new file mode 100644
index 0000000..f35db30
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-command/index.js
@@ -0,0 +1,19 @@
+'use strict';
+const shebangRegex = require('shebang-regex');
+
+module.exports = (string = '') => {
+	const match = string.match(shebangRegex);
+
+	if (!match) {
+		return null;
+	}
+
+	const [path, argument] = match[0].replace(/#! ?/, '').split(' ');
+	const binary = path.split('/').pop();
+
+	if (binary === 'env') {
+		return argument;
+	}
+
+	return argument ? `${binary} ${argument}` : binary;
+};
diff --git a/node_modules/mathjs/examples/node_modules/shebang-command/license b/node_modules/mathjs/examples/node_modules/shebang-command/license
new file mode 100644
index 0000000..db6bc32
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-command/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Kevin Mårtensson <kevinmartensson@gmail.com> (github.com/kevva)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/shebang-command/package.json b/node_modules/mathjs/examples/node_modules/shebang-command/package.json
new file mode 100644
index 0000000..18e3c04
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-command/package.json
@@ -0,0 +1,34 @@
+{
+	"name": "shebang-command",
+	"version": "2.0.0",
+	"description": "Get the command from a shebang",
+	"license": "MIT",
+	"repository": "kevva/shebang-command",
+	"author": {
+		"name": "Kevin Mårtensson",
+		"email": "kevinmartensson@gmail.com",
+		"url": "github.com/kevva"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava"
+	},
+	"files": [
+		"index.js"
+	],
+	"keywords": [
+		"cmd",
+		"command",
+		"parse",
+		"shebang"
+	],
+	"dependencies": {
+		"shebang-regex": "^3.0.0"
+	},
+	"devDependencies": {
+		"ava": "^2.3.0",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/shebang-command/readme.md b/node_modules/mathjs/examples/node_modules/shebang-command/readme.md
new file mode 100644
index 0000000..84feb44
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-command/readme.md
@@ -0,0 +1,34 @@
+# shebang-command [![Build Status](https://travis-ci.org/kevva/shebang-command.svg?branch=master)](https://travis-ci.org/kevva/shebang-command)
+
+> Get the command from a shebang
+
+
+## Install
+
+```
+$ npm install shebang-command
+```
+
+
+## Usage
+
+```js
+const shebangCommand = require('shebang-command');
+
+shebangCommand('#!/usr/bin/env node');
+//=> 'node'
+
+shebangCommand('#!/bin/bash');
+//=> 'bash'
+```
+
+
+## API
+
+### shebangCommand(string)
+
+#### string
+
+Type: `string`
+
+String containing a shebang.
diff --git a/node_modules/mathjs/examples/node_modules/shebang-regex/index.d.ts b/node_modules/mathjs/examples/node_modules/shebang-regex/index.d.ts
new file mode 100644
index 0000000..61d034b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-regex/index.d.ts
@@ -0,0 +1,22 @@
+/**
+Regular expression for matching a [shebang](https://en.wikipedia.org/wiki/Shebang_(Unix)) line.
+
+@example
+```
+import shebangRegex = require('shebang-regex');
+
+const string = '#!/usr/bin/env node\nconsole.log("unicorns");';
+
+shebangRegex.test(string);
+//=> true
+
+shebangRegex.exec(string)[0];
+//=> '#!/usr/bin/env node'
+
+shebangRegex.exec(string)[1];
+//=> '/usr/bin/env node'
+```
+*/
+declare const shebangRegex: RegExp;
+
+export = shebangRegex;
diff --git a/node_modules/mathjs/examples/node_modules/shebang-regex/index.js b/node_modules/mathjs/examples/node_modules/shebang-regex/index.js
new file mode 100644
index 0000000..63fc4a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-regex/index.js
@@ -0,0 +1,2 @@
+'use strict';
+module.exports = /^#!(.*)/;
diff --git a/node_modules/mathjs/examples/node_modules/shebang-regex/license b/node_modules/mathjs/examples/node_modules/shebang-regex/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-regex/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/shebang-regex/package.json b/node_modules/mathjs/examples/node_modules/shebang-regex/package.json
new file mode 100644
index 0000000..00ab30f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-regex/package.json
@@ -0,0 +1,35 @@
+{
+	"name": "shebang-regex",
+	"version": "3.0.0",
+	"description": "Regular expression for matching a shebang line",
+	"license": "MIT",
+	"repository": "sindresorhus/shebang-regex",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"regex",
+		"regexp",
+		"shebang",
+		"match",
+		"test",
+		"line"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/shebang-regex/readme.md b/node_modules/mathjs/examples/node_modules/shebang-regex/readme.md
new file mode 100644
index 0000000..5ecf863
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/shebang-regex/readme.md
@@ -0,0 +1,33 @@
+# shebang-regex [![Build Status](https://travis-ci.org/sindresorhus/shebang-regex.svg?branch=master)](https://travis-ci.org/sindresorhus/shebang-regex)
+
+> Regular expression for matching a [shebang](https://en.wikipedia.org/wiki/Shebang_(Unix)) line
+
+
+## Install
+
+```
+$ npm install shebang-regex
+```
+
+
+## Usage
+
+```js
+const shebangRegex = require('shebang-regex');
+
+const string = '#!/usr/bin/env node\nconsole.log("unicorns");';
+
+shebangRegex.test(string);
+//=> true
+
+shebangRegex.exec(string)[0];
+//=> '#!/usr/bin/env node'
+
+shebangRegex.exec(string)[1];
+//=> '/usr/bin/env node'
+```
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/signal-exit/LICENSE.txt b/node_modules/mathjs/examples/node_modules/signal-exit/LICENSE.txt
new file mode 100644
index 0000000..eead04a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/signal-exit/LICENSE.txt
@@ -0,0 +1,16 @@
+The ISC License
+
+Copyright (c) 2015, Contributors
+
+Permission to use, copy, modify, and/or distribute this software
+for any purpose with or without fee is hereby granted, provided
+that the above copyright notice and this permission notice
+appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
+OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE
+LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES
+OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
+ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/signal-exit/README.md b/node_modules/mathjs/examples/node_modules/signal-exit/README.md
new file mode 100644
index 0000000..f9c7c00
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/signal-exit/README.md
@@ -0,0 +1,39 @@
+# signal-exit
+
+[![Build Status](https://travis-ci.org/tapjs/signal-exit.png)](https://travis-ci.org/tapjs/signal-exit)
+[![Coverage](https://coveralls.io/repos/tapjs/signal-exit/badge.svg?branch=master)](https://coveralls.io/r/tapjs/signal-exit?branch=master)
+[![NPM version](https://img.shields.io/npm/v/signal-exit.svg)](https://www.npmjs.com/package/signal-exit)
+[![Standard Version](https://img.shields.io/badge/release-standard%20version-brightgreen.svg)](https://github.com/conventional-changelog/standard-version)
+
+When you want to fire an event no matter how a process exits:
+
+* reaching the end of execution.
+* explicitly having `process.exit(code)` called.
+* having `process.kill(pid, sig)` called.
+* receiving a fatal signal from outside the process
+
+Use `signal-exit`.
+
+```js
+var onExit = require('signal-exit')
+
+onExit(function (code, signal) {
+  console.log('process exited!')
+})
+```
+
+## API
+
+`var remove = onExit(function (code, signal) {}, options)`
+
+The return value of the function is a function that will remove the
+handler.
+
+Note that the function *only* fires for signals if the signal would
+cause the process to exit.  That is, there are no other listeners, and
+it is a fatal signal.
+
+## Options
+
+* `alwaysLast`: Run this handler after any other signal or exit
+  handlers.  This causes `process.emit` to be monkeypatched.
diff --git a/node_modules/mathjs/examples/node_modules/signal-exit/index.js b/node_modules/mathjs/examples/node_modules/signal-exit/index.js
new file mode 100644
index 0000000..93703f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/signal-exit/index.js
@@ -0,0 +1,202 @@
+// Note: since nyc uses this module to output coverage, any lines
+// that are in the direct sync flow of nyc's outputCoverage are
+// ignored, since we can never get coverage for them.
+// grab a reference to node's real process object right away
+var process = global.process
+
+const processOk = function (process) {
+  return process &&
+    typeof process === 'object' &&
+    typeof process.removeListener === 'function' &&
+    typeof process.emit === 'function' &&
+    typeof process.reallyExit === 'function' &&
+    typeof process.listeners === 'function' &&
+    typeof process.kill === 'function' &&
+    typeof process.pid === 'number' &&
+    typeof process.on === 'function'
+}
+
+// some kind of non-node environment, just no-op
+/* istanbul ignore if */
+if (!processOk(process)) {
+  module.exports = function () {
+    return function () {}
+  }
+} else {
+  var assert = require('assert')
+  var signals = require('./signals.js')
+  var isWin = /^win/i.test(process.platform)
+
+  var EE = require('events')
+  /* istanbul ignore if */
+  if (typeof EE !== 'function') {
+    EE = EE.EventEmitter
+  }
+
+  var emitter
+  if (process.__signal_exit_emitter__) {
+    emitter = process.__signal_exit_emitter__
+  } else {
+    emitter = process.__signal_exit_emitter__ = new EE()
+    emitter.count = 0
+    emitter.emitted = {}
+  }
+
+  // Because this emitter is a global, we have to check to see if a
+  // previous version of this library failed to enable infinite listeners.
+  // I know what you're about to say.  But literally everything about
+  // signal-exit is a compromise with evil.  Get used to it.
+  if (!emitter.infinite) {
+    emitter.setMaxListeners(Infinity)
+    emitter.infinite = true
+  }
+
+  module.exports = function (cb, opts) {
+    /* istanbul ignore if */
+    if (!processOk(global.process)) {
+      return function () {}
+    }
+    assert.equal(typeof cb, 'function', 'a callback must be provided for exit handler')
+
+    if (loaded === false) {
+      load()
+    }
+
+    var ev = 'exit'
+    if (opts && opts.alwaysLast) {
+      ev = 'afterexit'
+    }
+
+    var remove = function () {
+      emitter.removeListener(ev, cb)
+      if (emitter.listeners('exit').length === 0 &&
+          emitter.listeners('afterexit').length === 0) {
+        unload()
+      }
+    }
+    emitter.on(ev, cb)
+
+    return remove
+  }
+
+  var unload = function unload () {
+    if (!loaded || !processOk(global.process)) {
+      return
+    }
+    loaded = false
+
+    signals.forEach(function (sig) {
+      try {
+        process.removeListener(sig, sigListeners[sig])
+      } catch (er) {}
+    })
+    process.emit = originalProcessEmit
+    process.reallyExit = originalProcessReallyExit
+    emitter.count -= 1
+  }
+  module.exports.unload = unload
+
+  var emit = function emit (event, code, signal) {
+    /* istanbul ignore if */
+    if (emitter.emitted[event]) {
+      return
+    }
+    emitter.emitted[event] = true
+    emitter.emit(event, code, signal)
+  }
+
+  // { <signal>: <listener fn>, ... }
+  var sigListeners = {}
+  signals.forEach(function (sig) {
+    sigListeners[sig] = function listener () {
+      /* istanbul ignore if */
+      if (!processOk(global.process)) {
+        return
+      }
+      // If there are no other listeners, an exit is coming!
+      // Simplest way: remove us and then re-send the signal.
+      // We know that this will kill the process, so we can
+      // safely emit now.
+      var listeners = process.listeners(sig)
+      if (listeners.length === emitter.count) {
+        unload()
+        emit('exit', null, sig)
+        /* istanbul ignore next */
+        emit('afterexit', null, sig)
+        /* istanbul ignore next */
+        if (isWin && sig === 'SIGHUP') {
+          // "SIGHUP" throws an `ENOSYS` error on Windows,
+          // so use a supported signal instead
+          sig = 'SIGINT'
+        }
+        /* istanbul ignore next */
+        process.kill(process.pid, sig)
+      }
+    }
+  })
+
+  module.exports.signals = function () {
+    return signals
+  }
+
+  var loaded = false
+
+  var load = function load () {
+    if (loaded || !processOk(global.process)) {
+      return
+    }
+    loaded = true
+
+    // This is the number of onSignalExit's that are in play.
+    // It's important so that we can count the correct number of
+    // listeners on signals, and don't wait for the other one to
+    // handle it instead of us.
+    emitter.count += 1
+
+    signals = signals.filter(function (sig) {
+      try {
+        process.on(sig, sigListeners[sig])
+        return true
+      } catch (er) {
+        return false
+      }
+    })
+
+    process.emit = processEmit
+    process.reallyExit = processReallyExit
+  }
+  module.exports.load = load
+
+  var originalProcessReallyExit = process.reallyExit
+  var processReallyExit = function processReallyExit (code) {
+    /* istanbul ignore if */
+    if (!processOk(global.process)) {
+      return
+    }
+    process.exitCode = code || /* istanbul ignore next */ 0
+    emit('exit', process.exitCode, null)
+    /* istanbul ignore next */
+    emit('afterexit', process.exitCode, null)
+    /* istanbul ignore next */
+    originalProcessReallyExit.call(process, process.exitCode)
+  }
+
+  var originalProcessEmit = process.emit
+  var processEmit = function processEmit (ev, arg) {
+    if (ev === 'exit' && processOk(global.process)) {
+      /* istanbul ignore else */
+      if (arg !== undefined) {
+        process.exitCode = arg
+      }
+      var ret = originalProcessEmit.apply(this, arguments)
+      /* istanbul ignore next */
+      emit('exit', process.exitCode, null)
+      /* istanbul ignore next */
+      emit('afterexit', process.exitCode, null)
+      /* istanbul ignore next */
+      return ret
+    } else {
+      return originalProcessEmit.apply(this, arguments)
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/signal-exit/package.json b/node_modules/mathjs/examples/node_modules/signal-exit/package.json
new file mode 100644
index 0000000..e1a0031
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/signal-exit/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "signal-exit",
+  "version": "3.0.7",
+  "description": "when you want to fire an event no matter how a process exits.",
+  "main": "index.js",
+  "scripts": {
+    "test": "tap",
+    "snap": "tap",
+    "preversion": "npm test",
+    "postversion": "npm publish",
+    "prepublishOnly": "git push origin --follow-tags"
+  },
+  "files": [
+    "index.js",
+    "signals.js"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/tapjs/signal-exit.git"
+  },
+  "keywords": [
+    "signal",
+    "exit"
+  ],
+  "author": "Ben Coe <ben@npmjs.com>",
+  "license": "ISC",
+  "bugs": {
+    "url": "https://github.com/tapjs/signal-exit/issues"
+  },
+  "homepage": "https://github.com/tapjs/signal-exit",
+  "devDependencies": {
+    "chai": "^3.5.0",
+    "coveralls": "^3.1.1",
+    "nyc": "^15.1.0",
+    "standard-version": "^9.3.1",
+    "tap": "^15.1.1"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/signal-exit/signals.js b/node_modules/mathjs/examples/node_modules/signal-exit/signals.js
new file mode 100644
index 0000000..3bd67a8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/signal-exit/signals.js
@@ -0,0 +1,53 @@
+// This is not the set of all possible signals.
+//
+// It IS, however, the set of all signals that trigger
+// an exit on either Linux or BSD systems.  Linux is a
+// superset of the signal names supported on BSD, and
+// the unknown signals just fail to register, so we can
+// catch that easily enough.
+//
+// Don't bother with SIGKILL.  It's uncatchable, which
+// means that we can't fire any callbacks anyway.
+//
+// If a user does happen to register a handler on a non-
+// fatal signal like SIGWINCH or something, and then
+// exit, it'll end up firing `process.emit('exit')`, so
+// the handler will be fired anyway.
+//
+// SIGBUS, SIGFPE, SIGSEGV and SIGILL, when not raised
+// artificially, inherently leave the process in a
+// state from which it is not safe to try and enter JS
+// listeners.
+module.exports = [
+  'SIGABRT',
+  'SIGALRM',
+  'SIGHUP',
+  'SIGINT',
+  'SIGTERM'
+]
+
+if (process.platform !== 'win32') {
+  module.exports.push(
+    'SIGVTALRM',
+    'SIGXCPU',
+    'SIGXFSZ',
+    'SIGUSR2',
+    'SIGTRAP',
+    'SIGSYS',
+    'SIGQUIT',
+    'SIGIOT'
+    // should detect profiler and enable/disable accordingly.
+    // see #21
+    // 'SIGPROF'
+  )
+}
+
+if (process.platform === 'linux') {
+  module.exports.push(
+    'SIGIO',
+    'SIGPOLL',
+    'SIGPWR',
+    'SIGSTKFLT',
+    'SIGUNUSED'
+  )
+}
diff --git a/node_modules/mathjs/examples/node_modules/source-map-support/LICENSE.md b/node_modules/mathjs/examples/node_modules/source-map-support/LICENSE.md
new file mode 100644
index 0000000..6247ca9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map-support/LICENSE.md
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 Evan Wallace
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/source-map-support/README.md b/node_modules/mathjs/examples/node_modules/source-map-support/README.md
new file mode 100644
index 0000000..40228b7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map-support/README.md
@@ -0,0 +1,284 @@
+# Source Map Support
+[![Build Status](https://travis-ci.org/evanw/node-source-map-support.svg?branch=master)](https://travis-ci.org/evanw/node-source-map-support)
+
+This module provides source map support for stack traces in node via the [V8 stack trace API](https://github.com/v8/v8/wiki/Stack-Trace-API). It uses the [source-map](https://github.com/mozilla/source-map) module to replace the paths and line numbers of source-mapped files with their original paths and line numbers. The output mimics node's stack trace format with the goal of making every compile-to-JS language more of a first-class citizen. Source maps are completely general (not specific to any one language) so you can use source maps with multiple compile-to-JS languages in the same node process.
+
+## Installation and Usage
+
+#### Node support
+
+```
+$ npm install source-map-support
+```
+
+Source maps can be generated using libraries such as [source-map-index-generator](https://github.com/twolfson/source-map-index-generator). Once you have a valid source map, place a source mapping comment somewhere in the file (usually done automatically or with an option by your transpiler):
+
+```
+//# sourceMappingURL=path/to/source.map
+```
+
+If multiple sourceMappingURL comments exist in one file, the last sourceMappingURL comment will be
+respected (e.g. if a file mentions the comment in code, or went through multiple transpilers).
+The path should either be absolute or relative to the compiled file.
+
+From here you have two options.
+
+##### CLI Usage
+
+```bash
+node -r source-map-support/register compiled.js
+```
+
+##### Programmatic Usage
+
+Put the following line at the top of the compiled file.
+
+```js
+require('source-map-support').install();
+```
+
+It is also possible to install the source map support directly by
+requiring the `register` module which can be handy with ES6:
+
+```js
+import 'source-map-support/register'
+
+// Instead of:
+import sourceMapSupport from 'source-map-support'
+sourceMapSupport.install()
+```
+Note: if you're using babel-register, it includes source-map-support already.
+
+It is also very useful with Mocha:
+
+```
+$ mocha --require source-map-support/register tests/
+```
+
+#### Browser support
+
+This library also works in Chrome. While the DevTools console already supports source maps, the V8 engine doesn't and `Error.prototype.stack` will be incorrect without this library. Everything will just work if you deploy your source files using [browserify](http://browserify.org/). Just make sure to pass the `--debug` flag to the browserify command so your source maps are included in the bundled code.
+
+This library also works if you use another build process or just include the source files directly. In this case, include the file `browser-source-map-support.js` in your page and call `sourceMapSupport.install()`. It contains the whole library already bundled for the browser using browserify.
+
+```html
+<script src="browser-source-map-support.js"></script>
+<script>sourceMapSupport.install();</script>
+```
+
+This library also works if you use AMD (Asynchronous Module Definition), which is used in tools like [RequireJS](http://requirejs.org/). Just list `browser-source-map-support` as a dependency:
+
+```html
+<script>
+  define(['browser-source-map-support'], function(sourceMapSupport) {
+    sourceMapSupport.install();
+  });
+</script>
+```
+
+## Options
+
+This module installs two things: a change to the `stack` property on `Error` objects and a handler for uncaught exceptions that mimics node's default exception handler (the handler can be seen in the demos below). You may want to disable the handler if you have your own uncaught exception handler. This can be done by passing an argument to the installer:
+
+```js
+require('source-map-support').install({
+  handleUncaughtExceptions: false
+});
+```
+
+This module loads source maps from the filesystem by default. You can provide alternate loading behavior through a callback as shown below. For example, [Meteor](https://github.com/meteor) keeps all source maps cached in memory to avoid disk access.
+
+```js
+require('source-map-support').install({
+  retrieveSourceMap: function(source) {
+    if (source === 'compiled.js') {
+      return {
+        url: 'original.js',
+        map: fs.readFileSync('compiled.js.map', 'utf8')
+      };
+    }
+    return null;
+  }
+});
+```
+
+The module will by default assume a browser environment if XMLHttpRequest and window are defined. If either of these do not exist it will instead assume a node environment.
+In some rare cases, e.g. when running a browser emulation and where both variables are also set, you can explictly specify the environment to be either 'browser' or 'node'.
+
+```js
+require('source-map-support').install({
+  environment: 'node'
+});
+```
+
+To support files with inline source maps, the `hookRequire` options can be specified, which will monitor all source files for inline source maps.
+
+
+```js
+require('source-map-support').install({
+  hookRequire: true
+});
+```
+
+This monkey patches the `require` module loading chain, so is not enabled by default and is not recommended for any sort of production usage.
+
+## Demos
+
+#### Basic Demo
+
+original.js:
+
+```js
+throw new Error('test'); // This is the original code
+```
+
+compiled.js:
+
+```js
+require('source-map-support').install();
+
+throw new Error('test'); // This is the compiled code
+// The next line defines the sourceMapping.
+//# sourceMappingURL=compiled.js.map
+```
+
+compiled.js.map:
+
+```json
+{
+  "version": 3,
+  "file": "compiled.js",
+  "sources": ["original.js"],
+  "names": [],
+  "mappings": ";;AAAA,MAAM,IAAI"
+}
+```
+
+Run compiled.js using node (notice how the stack trace uses original.js instead of compiled.js):
+
+```
+$ node compiled.js
+
+original.js:1
+throw new Error('test'); // This is the original code
+      ^
+Error: test
+    at Object.<anonymous> (original.js:1:7)
+    at Module._compile (module.js:456:26)
+    at Object.Module._extensions..js (module.js:474:10)
+    at Module.load (module.js:356:32)
+    at Function.Module._load (module.js:312:12)
+    at Function.Module.runMain (module.js:497:10)
+    at startup (node.js:119:16)
+    at node.js:901:3
+```
+
+#### TypeScript Demo
+
+demo.ts:
+
+```typescript
+declare function require(name: string);
+require('source-map-support').install();
+class Foo {
+  constructor() { this.bar(); }
+  bar() { throw new Error('this is a demo'); }
+}
+new Foo();
+```
+
+Compile and run the file using the TypeScript compiler from the terminal:
+
+```
+$ npm install source-map-support typescript
+$ node_modules/typescript/bin/tsc -sourcemap demo.ts
+$ node demo.js
+
+demo.ts:5
+  bar() { throw new Error('this is a demo'); }
+                ^
+Error: this is a demo
+    at Foo.bar (demo.ts:5:17)
+    at new Foo (demo.ts:4:24)
+    at Object.<anonymous> (demo.ts:7:1)
+    at Module._compile (module.js:456:26)
+    at Object.Module._extensions..js (module.js:474:10)
+    at Module.load (module.js:356:32)
+    at Function.Module._load (module.js:312:12)
+    at Function.Module.runMain (module.js:497:10)
+    at startup (node.js:119:16)
+    at node.js:901:3
+```
+
+There is also the option to use `-r source-map-support/register` with typescript, without the need add the `require('source-map-support').install()` in the code base:
+
+```
+$ npm install source-map-support typescript
+$ node_modules/typescript/bin/tsc  -sourcemap demo.ts
+$ node -r source-map-support/register demo.js
+
+demo.ts:5
+  bar() { throw new Error('this is a demo'); }
+                ^
+Error: this is a demo
+    at Foo.bar (demo.ts:5:17)
+    at new Foo (demo.ts:4:24)
+    at Object.<anonymous> (demo.ts:7:1)
+    at Module._compile (module.js:456:26)
+    at Object.Module._extensions..js (module.js:474:10)
+    at Module.load (module.js:356:32)
+    at Function.Module._load (module.js:312:12)
+    at Function.Module.runMain (module.js:497:10)
+    at startup (node.js:119:16)
+    at node.js:901:3
+```
+
+#### CoffeeScript Demo
+
+demo.coffee:
+
+```coffee
+require('source-map-support').install()
+foo = ->
+  bar = -> throw new Error 'this is a demo'
+  bar()
+foo()
+```
+
+Compile and run the file using the CoffeeScript compiler from the terminal:
+
+```sh
+$ npm install source-map-support coffeescript
+$ node_modules/.bin/coffee --map --compile demo.coffee
+$ node demo.js
+
+demo.coffee:3
+  bar = -> throw new Error 'this is a demo'
+                     ^
+Error: this is a demo
+    at bar (demo.coffee:3:22)
+    at foo (demo.coffee:4:3)
+    at Object.<anonymous> (demo.coffee:5:1)
+    at Object.<anonymous> (demo.coffee:1:1)
+    at Module._compile (module.js:456:26)
+    at Object.Module._extensions..js (module.js:474:10)
+    at Module.load (module.js:356:32)
+    at Function.Module._load (module.js:312:12)
+    at Function.Module.runMain (module.js:497:10)
+    at startup (node.js:119:16)
+```
+
+## Tests
+
+This repo contains both automated tests for node and manual tests for the browser. The automated tests can be run using mocha (type `mocha` in the root directory). To run the manual tests:
+
+* Build the tests using `build.js`
+* Launch the HTTP server (`npm run serve-tests`) and visit
+  * http://127.0.0.1:1336/amd-test
+  * http://127.0.0.1:1336/browser-test
+  * http://127.0.0.1:1336/browserify-test - **Currently not working** due to a bug with browserify (see [pull request #66](https://github.com/evanw/node-source-map-support/pull/66) for details).
+* For `header-test`, run `server.js` inside that directory and visit http://127.0.0.1:1337/
+
+## License
+
+This code is available under the [MIT license](http://opensource.org/licenses/MIT).
diff --git a/node_modules/mathjs/examples/node_modules/source-map-support/browser-source-map-support.js b/node_modules/mathjs/examples/node_modules/source-map-support/browser-source-map-support.js
new file mode 100644
index 0000000..782da50
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map-support/browser-source-map-support.js
@@ -0,0 +1,114 @@
+/*
+ * Support for source maps in V8 stack traces
+ * https://github.com/evanw/node-source-map-support
+ */
+/*
+ The buffer module from node.js, for the browser.
+
+ @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
+ license  MIT
+*/
+(this.define||function(R,U){this.sourceMapSupport=U()})("browser-source-map-support",function(R){(function e(C,J,A){function p(f,c){if(!J[f]){if(!C[f]){var l="function"==typeof require&&require;if(!c&&l)return l(f,!0);if(t)return t(f,!0);throw Error("Cannot find module '"+f+"'");}l=J[f]={exports:{}};C[f][0].call(l.exports,function(q){var r=C[f][1][q];return p(r?r:q)},l,l.exports,e,C,J,A)}return J[f].exports}for(var t="function"==typeof require&&require,m=0;m<A.length;m++)p(A[m]);return p})({1:[function(C,
+J,A){R=C("./source-map-support")},{"./source-map-support":21}],2:[function(C,J,A){(function(e){function p(m){m=m.charCodeAt(0);if(43===m)return 62;if(47===m)return 63;if(48>m)return-1;if(58>m)return m-48+52;if(91>m)return m-65;if(123>m)return m-97+26}var t="undefined"!==typeof Uint8Array?Uint8Array:Array;e.toByteArray=function(m){function f(d){q[k++]=d}if(0<m.length%4)throw Error("Invalid string. Length must be a multiple of 4");var c=m.length;var l="="===m.charAt(c-2)?2:"="===m.charAt(c-1)?1:0;var q=
+new t(3*m.length/4-l);var r=0<l?m.length-4:m.length;var k=0;for(c=0;c<r;c+=4){var u=p(m.charAt(c))<<18|p(m.charAt(c+1))<<12|p(m.charAt(c+2))<<6|p(m.charAt(c+3));f((u&16711680)>>16);f((u&65280)>>8);f(u&255)}2===l?(u=p(m.charAt(c))<<2|p(m.charAt(c+1))>>4,f(u&255)):1===l&&(u=p(m.charAt(c))<<10|p(m.charAt(c+1))<<4|p(m.charAt(c+2))>>2,f(u>>8&255),f(u&255));return q};e.fromByteArray=function(m){var f=m.length%3,c="",l;var q=0;for(l=m.length-f;q<l;q+=3){var r=(m[q]<<16)+(m[q+1]<<8)+m[q+2];r="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r>>
+18&63)+"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r>>12&63)+"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r>>6&63)+"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r&63);c+=r}switch(f){case 1:r=m[m.length-1];c+="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r>>2);c+="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r<<4&63);c+="==";break;case 2:r=(m[m.length-2]<<8)+
+m[m.length-1],c+="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r>>10),c+="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r>>4&63),c+="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(r<<2&63),c+="="}return c}})("undefined"===typeof A?this.base64js={}:A)},{}],3:[function(C,J,A){},{}],4:[function(C,J,A){(function(e){var p=Object.prototype.toString,t="function"===typeof e.alloc&&"function"===typeof e.allocUnsafe&&"function"===
+typeof e.from;J.exports=function(m,f,c){if("number"===typeof m)throw new TypeError('"value" argument must not be a number');if("ArrayBuffer"===p.call(m).slice(8,-1)){f>>>=0;var l=m.byteLength-f;if(0>l)throw new RangeError("'offset' is out of bounds");if(void 0===c)c=l;else if(c>>>=0,c>l)throw new RangeError("'length' is out of bounds");return t?e.from(m.slice(f,f+c)):new e(new Uint8Array(m.slice(f,f+c)))}if("string"===typeof m){c=f;if("string"!==typeof c||""===c)c="utf8";if(!e.isEncoding(c))throw new TypeError('"encoding" must be a valid string encoding');
+return t?e.from(m,c):new e(m,c)}return t?e.from(m):new e(m)}}).call(this,C("buffer").Buffer)},{buffer:5}],5:[function(C,J,A){function e(a,b,h){if(!(this instanceof e))return new e(a,b,h);var w=typeof a;if("number"===w)var y=0<a?a>>>0:0;else if("string"===w){if("base64"===b)for(a=(a.trim?a.trim():a.replace(/^\s+|\s+$/g,"")).replace(L,"");0!==a.length%4;)a+="=";y=e.byteLength(a,b)}else if("object"===w&&null!==a)"Buffer"===a.type&&z(a.data)&&(a=a.data),y=0<+a.length?Math.floor(+a.length):0;else throw new TypeError("must start with number, buffer, array or string");
+if(this.length>G)throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+G.toString(16)+" bytes");if(e.TYPED_ARRAY_SUPPORT)var I=e._augment(new Uint8Array(y));else I=this,I.length=y,I._isBuffer=!0;if(e.TYPED_ARRAY_SUPPORT&&"number"===typeof a.byteLength)I._set(a);else{var K=a;if(z(K)||e.isBuffer(K)||K&&"object"===typeof K&&"number"===typeof K.length)if(e.isBuffer(a))for(b=0;b<y;b++)I[b]=a.readUInt8(b);else for(b=0;b<y;b++)I[b]=(a[b]%256+256)%256;else if("string"===w)I.write(a,
+0,b);else if("number"===w&&!e.TYPED_ARRAY_SUPPORT&&!h)for(b=0;b<y;b++)I[b]=0}return I}function p(a,b,h){var w="";for(h=Math.min(a.length,h);b<h;b++)w+=String.fromCharCode(a[b]);return w}function t(a,b,h){if(0!==a%1||0>a)throw new RangeError("offset is not uint");if(a+b>h)throw new RangeError("Trying to access beyond buffer length");}function m(a,b,h,w,y,I){if(!e.isBuffer(a))throw new TypeError("buffer must be a Buffer instance");if(b>y||b<I)throw new TypeError("value is out of bounds");if(h+w>a.length)throw new TypeError("index out of range");
+}function f(a,b,h,w){0>b&&(b=65535+b+1);for(var y=0,I=Math.min(a.length-h,2);y<I;y++)a[h+y]=(b&255<<8*(w?y:1-y))>>>8*(w?y:1-y)}function c(a,b,h,w){0>b&&(b=4294967295+b+1);for(var y=0,I=Math.min(a.length-h,4);y<I;y++)a[h+y]=b>>>8*(w?y:3-y)&255}function l(a,b,h,w,y,I){if(b>y||b<I)throw new TypeError("value is out of bounds");if(h+w>a.length)throw new TypeError("index out of range");}function q(a,b,h,w,y){y||l(a,b,h,4,3.4028234663852886E38,-3.4028234663852886E38);v.write(a,b,h,w,23,4);return h+4}function r(a,
+b,h,w,y){y||l(a,b,h,8,1.7976931348623157E308,-1.7976931348623157E308);v.write(a,b,h,w,52,8);return h+8}function k(a){for(var b=[],h=0;h<a.length;h++){var w=a.charCodeAt(h);if(127>=w)b.push(w);else{var y=h;55296<=w&&57343>=w&&h++;w=encodeURIComponent(a.slice(y,h+1)).substr(1).split("%");for(y=0;y<w.length;y++)b.push(parseInt(w[y],16))}}return b}function u(a){for(var b=[],h=0;h<a.length;h++)b.push(a.charCodeAt(h)&255);return b}function d(a,b,h,w,y){y&&(w-=w%y);for(y=0;y<w&&!(y+h>=b.length||y>=a.length);y++)b[y+
+h]=a[y];return y}function g(a){try{return decodeURIComponent(a)}catch(b){return String.fromCharCode(65533)}}var n=C("base64-js"),v=C("ieee754"),z=C("is-array");A.Buffer=e;A.SlowBuffer=e;A.INSPECT_MAX_BYTES=50;e.poolSize=8192;var G=1073741823;e.TYPED_ARRAY_SUPPORT=function(){try{var a=new ArrayBuffer(0),b=new Uint8Array(a);b.foo=function(){return 42};return 42===b.foo()&&"function"===typeof b.subarray&&0===(new Uint8Array(1)).subarray(1,1).byteLength}catch(h){return!1}}();e.isBuffer=function(a){return!(null==
+a||!a._isBuffer)};e.compare=function(a,b){if(!e.isBuffer(a)||!e.isBuffer(b))throw new TypeError("Arguments must be Buffers");for(var h=a.length,w=b.length,y=0,I=Math.min(h,w);y<I&&a[y]===b[y];y++);y!==I&&(h=a[y],w=b[y]);return h<w?-1:w<h?1:0};e.isEncoding=function(a){switch(String(a).toLowerCase()){case "hex":case "utf8":case "utf-8":case "ascii":case "binary":case "base64":case "raw":case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":return!0;default:return!1}};e.concat=function(a,b){if(!z(a))throw new TypeError("Usage: Buffer.concat(list[, length])");
+if(0===a.length)return new e(0);if(1===a.length)return a[0];var h;if(void 0===b)for(h=b=0;h<a.length;h++)b+=a[h].length;var w=new e(b),y=0;for(h=0;h<a.length;h++){var I=a[h];I.copy(w,y);y+=I.length}return w};e.byteLength=function(a,b){a+="";switch(b||"utf8"){case "ascii":case "binary":case "raw":var h=a.length;break;case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":h=2*a.length;break;case "hex":h=a.length>>>1;break;case "utf8":case "utf-8":h=k(a).length;break;case "base64":h=n.toByteArray(a).length;
+break;default:h=a.length}return h};e.prototype.length=void 0;e.prototype.parent=void 0;e.prototype.toString=function(a,b,h){var w=!1;b>>>=0;h=void 0===h||Infinity===h?this.length:h>>>0;a||(a="utf8");0>b&&(b=0);h>this.length&&(h=this.length);if(h<=b)return"";for(;;)switch(a){case "hex":a=b;b=h;h=this.length;if(!a||0>a)a=0;if(!b||0>b||b>h)b=h;w="";for(h=a;h<b;h++)a=w,w=this[h],w=16>w?"0"+w.toString(16):w.toString(16),w=a+w;return w;case "utf8":case "utf-8":w=a="";for(h=Math.min(this.length,h);b<h;b++)127>=
+this[b]?(a+=g(w)+String.fromCharCode(this[b]),w=""):w+="%"+this[b].toString(16);return a+g(w);case "ascii":return p(this,b,h);case "binary":return p(this,b,h);case "base64":return b=0===b&&h===this.length?n.fromByteArray(this):n.fromByteArray(this.slice(b,h)),b;case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":b=this.slice(b,h);h="";for(a=0;a<b.length;a+=2)h+=String.fromCharCode(b[a]+256*b[a+1]);return h;default:if(w)throw new TypeError("Unknown encoding: "+a);a=(a+"").toLowerCase();w=!0}};
+e.prototype.equals=function(a){if(!e.isBuffer(a))throw new TypeError("Argument must be a Buffer");return 0===e.compare(this,a)};e.prototype.inspect=function(){var a="",b=A.INSPECT_MAX_BYTES;0<this.length&&(a=this.toString("hex",0,b).match(/.{2}/g).join(" "),this.length>b&&(a+=" ... "));return"<Buffer "+a+">"};e.prototype.compare=function(a){if(!e.isBuffer(a))throw new TypeError("Argument must be a Buffer");return e.compare(this,a)};e.prototype.get=function(a){console.log(".get() is deprecated. Access using array indexes instead.");
+return this.readUInt8(a)};e.prototype.set=function(a,b){console.log(".set() is deprecated. Access using array indexes instead.");return this.writeUInt8(a,b)};e.prototype.write=function(a,b,h,w){if(isFinite(b))isFinite(h)||(w=h,h=void 0);else{var y=w;w=b;b=h;h=y}b=Number(b)||0;y=this.length-b;h?(h=Number(h),h>y&&(h=y)):h=y;w=String(w||"utf8").toLowerCase();switch(w){case "hex":b=Number(b)||0;w=this.length-b;h?(h=Number(h),h>w&&(h=w)):h=w;w=a.length;if(0!==w%2)throw Error("Invalid hex string");h>w/
+2&&(h=w/2);for(w=0;w<h;w++){y=parseInt(a.substr(2*w,2),16);if(isNaN(y))throw Error("Invalid hex string");this[b+w]=y}a=w;break;case "utf8":case "utf-8":a=d(k(a),this,b,h);break;case "ascii":a=d(u(a),this,b,h);break;case "binary":a=d(u(a),this,b,h);break;case "base64":a=d(n.toByteArray(a),this,b,h);break;case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":y=[];for(var I=0;I<a.length;I++){var K=a.charCodeAt(I);w=K>>8;K%=256;y.push(K);y.push(w)}a=d(y,this,b,h,2);break;default:throw new TypeError("Unknown encoding: "+
+w);}return a};e.prototype.toJSON=function(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};e.prototype.slice=function(a,b){var h=this.length;a=~~a;b=void 0===b?h:~~b;0>a?(a+=h,0>a&&(a=0)):a>h&&(a=h);0>b?(b+=h,0>b&&(b=0)):b>h&&(b=h);b<a&&(b=a);if(e.TYPED_ARRAY_SUPPORT)return e._augment(this.subarray(a,b));h=b-a;for(var w=new e(h,void 0,!0),y=0;y<h;y++)w[y]=this[y+a];return w};e.prototype.readUInt8=function(a,b){b||t(a,1,this.length);return this[a]};e.prototype.readUInt16LE=
+function(a,b){b||t(a,2,this.length);return this[a]|this[a+1]<<8};e.prototype.readUInt16BE=function(a,b){b||t(a,2,this.length);return this[a]<<8|this[a+1]};e.prototype.readUInt32LE=function(a,b){b||t(a,4,this.length);return(this[a]|this[a+1]<<8|this[a+2]<<16)+16777216*this[a+3]};e.prototype.readUInt32BE=function(a,b){b||t(a,4,this.length);return 16777216*this[a]+(this[a+1]<<16|this[a+2]<<8|this[a+3])};e.prototype.readInt8=function(a,b){b||t(a,1,this.length);return this[a]&128?-1*(255-this[a]+1):this[a]};
+e.prototype.readInt16LE=function(a,b){b||t(a,2,this.length);var h=this[a]|this[a+1]<<8;return h&32768?h|4294901760:h};e.prototype.readInt16BE=function(a,b){b||t(a,2,this.length);var h=this[a+1]|this[a]<<8;return h&32768?h|4294901760:h};e.prototype.readInt32LE=function(a,b){b||t(a,4,this.length);return this[a]|this[a+1]<<8|this[a+2]<<16|this[a+3]<<24};e.prototype.readInt32BE=function(a,b){b||t(a,4,this.length);return this[a]<<24|this[a+1]<<16|this[a+2]<<8|this[a+3]};e.prototype.readFloatLE=function(a,
+b){b||t(a,4,this.length);return v.read(this,a,!0,23,4)};e.prototype.readFloatBE=function(a,b){b||t(a,4,this.length);return v.read(this,a,!1,23,4)};e.prototype.readDoubleLE=function(a,b){b||t(a,8,this.length);return v.read(this,a,!0,52,8)};e.prototype.readDoubleBE=function(a,b){b||t(a,8,this.length);return v.read(this,a,!1,52,8)};e.prototype.writeUInt8=function(a,b,h){a=+a;b>>>=0;h||m(this,a,b,1,255,0);e.TYPED_ARRAY_SUPPORT||(a=Math.floor(a));this[b]=a;return b+1};e.prototype.writeUInt16LE=function(a,
+b,h){a=+a;b>>>=0;h||m(this,a,b,2,65535,0);e.TYPED_ARRAY_SUPPORT?(this[b]=a,this[b+1]=a>>>8):f(this,a,b,!0);return b+2};e.prototype.writeUInt16BE=function(a,b,h){a=+a;b>>>=0;h||m(this,a,b,2,65535,0);e.TYPED_ARRAY_SUPPORT?(this[b]=a>>>8,this[b+1]=a):f(this,a,b,!1);return b+2};e.prototype.writeUInt32LE=function(a,b,h){a=+a;b>>>=0;h||m(this,a,b,4,4294967295,0);e.TYPED_ARRAY_SUPPORT?(this[b+3]=a>>>24,this[b+2]=a>>>16,this[b+1]=a>>>8,this[b]=a):c(this,a,b,!0);return b+4};e.prototype.writeUInt32BE=function(a,
+b,h){a=+a;b>>>=0;h||m(this,a,b,4,4294967295,0);e.TYPED_ARRAY_SUPPORT?(this[b]=a>>>24,this[b+1]=a>>>16,this[b+2]=a>>>8,this[b+3]=a):c(this,a,b,!1);return b+4};e.prototype.writeInt8=function(a,b,h){a=+a;b>>>=0;h||m(this,a,b,1,127,-128);e.TYPED_ARRAY_SUPPORT||(a=Math.floor(a));0>a&&(a=255+a+1);this[b]=a;return b+1};e.prototype.writeInt16LE=function(a,b,h){a=+a;b>>>=0;h||m(this,a,b,2,32767,-32768);e.TYPED_ARRAY_SUPPORT?(this[b]=a,this[b+1]=a>>>8):f(this,a,b,!0);return b+2};e.prototype.writeInt16BE=function(a,
+b,h){a=+a;b>>>=0;h||m(this,a,b,2,32767,-32768);e.TYPED_ARRAY_SUPPORT?(this[b]=a>>>8,this[b+1]=a):f(this,a,b,!1);return b+2};e.prototype.writeInt32LE=function(a,b,h){a=+a;b>>>=0;h||m(this,a,b,4,2147483647,-2147483648);e.TYPED_ARRAY_SUPPORT?(this[b]=a,this[b+1]=a>>>8,this[b+2]=a>>>16,this[b+3]=a>>>24):c(this,a,b,!0);return b+4};e.prototype.writeInt32BE=function(a,b,h){a=+a;b>>>=0;h||m(this,a,b,4,2147483647,-2147483648);0>a&&(a=4294967295+a+1);e.TYPED_ARRAY_SUPPORT?(this[b]=a>>>24,this[b+1]=a>>>16,this[b+
+2]=a>>>8,this[b+3]=a):c(this,a,b,!1);return b+4};e.prototype.writeFloatLE=function(a,b,h){return q(this,a,b,!0,h)};e.prototype.writeFloatBE=function(a,b,h){return q(this,a,b,!1,h)};e.prototype.writeDoubleLE=function(a,b,h){return r(this,a,b,!0,h)};e.prototype.writeDoubleBE=function(a,b,h){return r(this,a,b,!1,h)};e.prototype.copy=function(a,b,h,w){h||(h=0);w||0===w||(w=this.length);b||(b=0);if(w!==h&&0!==a.length&&0!==this.length){if(w<h)throw new TypeError("sourceEnd < sourceStart");if(0>b||b>=a.length)throw new TypeError("targetStart out of bounds");
+if(0>h||h>=this.length)throw new TypeError("sourceStart out of bounds");if(0>w||w>this.length)throw new TypeError("sourceEnd out of bounds");w>this.length&&(w=this.length);a.length-b<w-h&&(w=a.length-b+h);w-=h;if(1E3>w||!e.TYPED_ARRAY_SUPPORT)for(var y=0;y<w;y++)a[y+b]=this[y+h];else a._set(this.subarray(h,h+w),b)}};e.prototype.fill=function(a,b,h){a||(a=0);b||(b=0);h||(h=this.length);if(h<b)throw new TypeError("end < start");if(h!==b&&0!==this.length){if(0>b||b>=this.length)throw new TypeError("start out of bounds");
+if(0>h||h>this.length)throw new TypeError("end out of bounds");if("number"===typeof a)for(;b<h;b++)this[b]=a;else{a=k(a.toString());for(var w=a.length;b<h;b++)this[b]=a[b%w]}return this}};e.prototype.toArrayBuffer=function(){if("undefined"!==typeof Uint8Array){if(e.TYPED_ARRAY_SUPPORT)return(new e(this)).buffer;for(var a=new Uint8Array(this.length),b=0,h=a.length;b<h;b+=1)a[b]=this[b];return a.buffer}throw new TypeError("Buffer.toArrayBuffer not supported in this browser");};var D=e.prototype;e._augment=
+function(a){a.constructor=e;a._isBuffer=!0;a._get=a.get;a._set=a.set;a.get=D.get;a.set=D.set;a.write=D.write;a.toString=D.toString;a.toLocaleString=D.toString;a.toJSON=D.toJSON;a.equals=D.equals;a.compare=D.compare;a.copy=D.copy;a.slice=D.slice;a.readUInt8=D.readUInt8;a.readUInt16LE=D.readUInt16LE;a.readUInt16BE=D.readUInt16BE;a.readUInt32LE=D.readUInt32LE;a.readUInt32BE=D.readUInt32BE;a.readInt8=D.readInt8;a.readInt16LE=D.readInt16LE;a.readInt16BE=D.readInt16BE;a.readInt32LE=D.readInt32LE;a.readInt32BE=
+D.readInt32BE;a.readFloatLE=D.readFloatLE;a.readFloatBE=D.readFloatBE;a.readDoubleLE=D.readDoubleLE;a.readDoubleBE=D.readDoubleBE;a.writeUInt8=D.writeUInt8;a.writeUInt16LE=D.writeUInt16LE;a.writeUInt16BE=D.writeUInt16BE;a.writeUInt32LE=D.writeUInt32LE;a.writeUInt32BE=D.writeUInt32BE;a.writeInt8=D.writeInt8;a.writeInt16LE=D.writeInt16LE;a.writeInt16BE=D.writeInt16BE;a.writeInt32LE=D.writeInt32LE;a.writeInt32BE=D.writeInt32BE;a.writeFloatLE=D.writeFloatLE;a.writeFloatBE=D.writeFloatBE;a.writeDoubleLE=
+D.writeDoubleLE;a.writeDoubleBE=D.writeDoubleBE;a.fill=D.fill;a.inspect=D.inspect;a.toArrayBuffer=D.toArrayBuffer;return a};var L=/[^+\/0-9A-z]/g},{"base64-js":2,ieee754:6,"is-array":7}],6:[function(C,J,A){A.read=function(e,p,t,m,f){var c=8*f-m-1;var l=(1<<c)-1,q=l>>1,r=-7;f=t?f-1:0;var k=t?-1:1,u=e[p+f];f+=k;t=u&(1<<-r)-1;u>>=-r;for(r+=c;0<r;t=256*t+e[p+f],f+=k,r-=8);c=t&(1<<-r)-1;t>>=-r;for(r+=m;0<r;c=256*c+e[p+f],f+=k,r-=8);if(0===t)t=1-q;else{if(t===l)return c?NaN:Infinity*(u?-1:1);c+=Math.pow(2,
+m);t-=q}return(u?-1:1)*c*Math.pow(2,t-m)};A.write=function(e,p,t,m,f,c){var l,q=8*c-f-1,r=(1<<q)-1,k=r>>1,u=23===f?Math.pow(2,-24)-Math.pow(2,-77):0;c=m?0:c-1;var d=m?1:-1,g=0>p||0===p&&0>1/p?1:0;p=Math.abs(p);isNaN(p)||Infinity===p?(p=isNaN(p)?1:0,m=r):(m=Math.floor(Math.log(p)/Math.LN2),1>p*(l=Math.pow(2,-m))&&(m--,l*=2),p=1<=m+k?p+u/l:p+u*Math.pow(2,1-k),2<=p*l&&(m++,l/=2),m+k>=r?(p=0,m=r):1<=m+k?(p=(p*l-1)*Math.pow(2,f),m+=k):(p=p*Math.pow(2,k-1)*Math.pow(2,f),m=0));for(;8<=f;e[t+c]=p&255,c+=
+d,p/=256,f-=8);m=m<<f|p;for(q+=f;0<q;e[t+c]=m&255,c+=d,m/=256,q-=8);e[t+c-d]|=128*g}},{}],7:[function(C,J,A){var e=Object.prototype.toString;J.exports=Array.isArray||function(p){return!!p&&"[object Array]"==e.call(p)}},{}],8:[function(C,J,A){(function(e){function p(c,l){for(var q=0,r=c.length-1;0<=r;r--){var k=c[r];"."===k?c.splice(r,1):".."===k?(c.splice(r,1),q++):q&&(c.splice(r,1),q--)}if(l)for(;q--;q)c.unshift("..");return c}function t(c,l){if(c.filter)return c.filter(l);for(var q=[],r=0;r<c.length;r++)l(c[r],
+r,c)&&q.push(c[r]);return q}var m=/^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;A.resolve=function(){for(var c="",l=!1,q=arguments.length-1;-1<=q&&!l;q--){var r=0<=q?arguments[q]:e.cwd();if("string"!==typeof r)throw new TypeError("Arguments to path.resolve must be strings");r&&(c=r+"/"+c,l="/"===r.charAt(0))}c=p(t(c.split("/"),function(k){return!!k}),!l).join("/");return(l?"/":"")+c||"."};A.normalize=function(c){var l=A.isAbsolute(c),q="/"===f(c,-1);(c=p(t(c.split("/"),function(r){return!!r}),
+!l).join("/"))||l||(c=".");c&&q&&(c+="/");return(l?"/":"")+c};A.isAbsolute=function(c){return"/"===c.charAt(0)};A.join=function(){var c=Array.prototype.slice.call(arguments,0);return A.normalize(t(c,function(l,q){if("string"!==typeof l)throw new TypeError("Arguments to path.join must be strings");return l}).join("/"))};A.relative=function(c,l){function q(n){for(var v=0;v<n.length&&""===n[v];v++);for(var z=n.length-1;0<=z&&""===n[z];z--);return v>z?[]:n.slice(v,z-v+1)}c=A.resolve(c).substr(1);l=A.resolve(l).substr(1);
+for(var r=q(c.split("/")),k=q(l.split("/")),u=Math.min(r.length,k.length),d=u,g=0;g<u;g++)if(r[g]!==k[g]){d=g;break}u=[];for(g=d;g<r.length;g++)u.push("..");u=u.concat(k.slice(d));return u.join("/")};A.sep="/";A.delimiter=":";A.dirname=function(c){var l=m.exec(c).slice(1);c=l[0];l=l[1];if(!c&&!l)return".";l&&(l=l.substr(0,l.length-1));return c+l};A.basename=function(c,l){var q=m.exec(c).slice(1)[2];l&&q.substr(-1*l.length)===l&&(q=q.substr(0,q.length-l.length));return q};A.extname=function(c){return m.exec(c).slice(1)[3]};
+var f="b"==="ab".substr(-1)?function(c,l,q){return c.substr(l,q)}:function(c,l,q){0>l&&(l=c.length+l);return c.substr(l,q)}}).call(this,C("g5I+bs"))},{"g5I+bs":9}],9:[function(C,J,A){function e(){}C=J.exports={};C.nextTick=function(){if("undefined"!==typeof window&&window.setImmediate)return function(t){return window.setImmediate(t)};if("undefined"!==typeof window&&window.postMessage&&window.addEventListener){var p=[];window.addEventListener("message",function(t){var m=t.source;m!==window&&null!==
+m||"process-tick"!==t.data||(t.stopPropagation(),0<p.length&&p.shift()())},!0);return function(t){p.push(t);window.postMessage("process-tick","*")}}return function(t){setTimeout(t,0)}}();C.title="browser";C.browser=!0;C.env={};C.argv=[];C.on=e;C.addListener=e;C.once=e;C.off=e;C.removeListener=e;C.removeAllListeners=e;C.emit=e;C.binding=function(p){throw Error("process.binding is not supported");};C.cwd=function(){return"/"};C.chdir=function(p){throw Error("process.chdir is not supported");}},{}],
+10:[function(C,J,A){function e(){this._array=[];this._set=m?new Map:Object.create(null)}var p=C("./util"),t=Object.prototype.hasOwnProperty,m="undefined"!==typeof Map;e.fromArray=function(f,c){for(var l=new e,q=0,r=f.length;q<r;q++)l.add(f[q],c);return l};e.prototype.size=function(){return m?this._set.size:Object.getOwnPropertyNames(this._set).length};e.prototype.add=function(f,c){var l=m?f:p.toSetString(f),q=m?this.has(f):t.call(this._set,l),r=this._array.length;q&&!c||this._array.push(f);q||(m?
+this._set.set(f,r):this._set[l]=r)};e.prototype.has=function(f){if(m)return this._set.has(f);f=p.toSetString(f);return t.call(this._set,f)};e.prototype.indexOf=function(f){if(m){var c=this._set.get(f);if(0<=c)return c}else if(c=p.toSetString(f),t.call(this._set,c))return this._set[c];throw Error('"'+f+'" is not in the set.');};e.prototype.at=function(f){if(0<=f&&f<this._array.length)return this._array[f];throw Error("No element indexed by "+f);};e.prototype.toArray=function(){return this._array.slice()};
+A.ArraySet=e},{"./util":19}],11:[function(C,J,A){var e=C("./base64");A.encode=function(p){var t="",m=0>p?(-p<<1)+1:p<<1;do p=m&31,m>>>=5,0<m&&(p|=32),t+=e.encode(p);while(0<m);return t};A.decode=function(p,t,m){var f=p.length,c=0,l=0;do{if(t>=f)throw Error("Expected more digits in base 64 VLQ value.");var q=e.decode(p.charCodeAt(t++));if(-1===q)throw Error("Invalid base64 digit: "+p.charAt(t-1));var r=!!(q&32);q&=31;c+=q<<l;l+=5}while(r);p=c>>1;m.value=1===(c&1)?-p:p;m.rest=t}},{"./base64":12}],12:[function(C,
+J,A){var e="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");A.encode=function(p){if(0<=p&&p<e.length)return e[p];throw new TypeError("Must be between 0 and 63: "+p);};A.decode=function(p){return 65<=p&&90>=p?p-65:97<=p&&122>=p?p-97+26:48<=p&&57>=p?p-48+52:43==p?62:47==p?63:-1}},{}],13:[function(C,J,A){function e(p,t,m,f,c,l){var q=Math.floor((t-p)/2)+p,r=c(m,f[q],!0);return 0===r?q:0<r?1<t-q?e(q,t,m,f,c,l):l==A.LEAST_UPPER_BOUND?t<f.length?t:-1:q:1<q-p?e(p,q,m,f,c,l):l==
+A.LEAST_UPPER_BOUND?q:0>p?-1:p}A.GREATEST_LOWER_BOUND=1;A.LEAST_UPPER_BOUND=2;A.search=function(p,t,m,f){if(0===t.length)return-1;p=e(-1,t.length,p,t,m,f||A.GREATEST_LOWER_BOUND);if(0>p)return-1;for(;0<=p-1&&0===m(t[p],t[p-1],!0);)--p;return p}},{}],14:[function(C,J,A){function e(){this._array=[];this._sorted=!0;this._last={generatedLine:-1,generatedColumn:0}}var p=C("./util");e.prototype.unsortedForEach=function(t,m){this._array.forEach(t,m)};e.prototype.add=function(t){var m=this._last,f=m.generatedLine,
+c=t.generatedLine,l=m.generatedColumn,q=t.generatedColumn;c>f||c==f&&q>=l||0>=p.compareByGeneratedPositionsInflated(m,t)?this._last=t:this._sorted=!1;this._array.push(t)};e.prototype.toArray=function(){this._sorted||(this._array.sort(p.compareByGeneratedPositionsInflated),this._sorted=!0);return this._array};A.MappingList=e},{"./util":19}],15:[function(C,J,A){function e(t,m,f){var c=t[m];t[m]=t[f];t[f]=c}function p(t,m,f,c){if(f<c){var l=f-1;e(t,Math.round(f+Math.random()*(c-f)),c);for(var q=t[c],
+r=f;r<c;r++)0>=m(t[r],q)&&(l+=1,e(t,l,r));e(t,l+1,r);l+=1;p(t,m,f,l-1);p(t,m,l+1,c)}}A.quickSort=function(t,m){p(t,m,0,t.length-1)}},{}],16:[function(C,J,A){function e(k,u){var d=k;"string"===typeof k&&(d=f.parseSourceMapInput(k));return null!=d.sections?new m(d,u):new p(d,u)}function p(k,u){var d=k;"string"===typeof k&&(d=f.parseSourceMapInput(k));var g=f.getArg(d,"version"),n=f.getArg(d,"sources"),v=f.getArg(d,"names",[]),z=f.getArg(d,"sourceRoot",null),G=f.getArg(d,"sourcesContent",null),D=f.getArg(d,
+"mappings");d=f.getArg(d,"file",null);if(g!=this._version)throw Error("Unsupported version: "+g);z&&(z=f.normalize(z));n=n.map(String).map(f.normalize).map(function(L){return z&&f.isAbsolute(z)&&f.isAbsolute(L)?f.relative(z,L):L});this._names=l.fromArray(v.map(String),!0);this._sources=l.fromArray(n,!0);this.sourceRoot=z;this.sourcesContent=G;this._mappings=D;this._sourceMapURL=u;this.file=d}function t(){this.generatedColumn=this.generatedLine=0;this.name=this.originalColumn=this.originalLine=this.source=
+null}function m(k,u){var d=k;"string"===typeof k&&(d=f.parseSourceMapInput(k));var g=f.getArg(d,"version");d=f.getArg(d,"sections");if(g!=this._version)throw Error("Unsupported version: "+g);this._sources=new l;this._names=new l;var n={line:-1,column:0};this._sections=d.map(function(v){if(v.url)throw Error("Support for url field in sections not implemented.");var z=f.getArg(v,"offset"),G=f.getArg(z,"line"),D=f.getArg(z,"column");if(G<n.line||G===n.line&&D<n.column)throw Error("Section offsets must be ordered and non-overlapping.");
+n=z;return{generatedOffset:{generatedLine:G+1,generatedColumn:D+1},consumer:new e(f.getArg(v,"map"),u)}})}var f=C("./util"),c=C("./binary-search"),l=C("./array-set").ArraySet,q=C("./base64-vlq"),r=C("./quick-sort").quickSort;e.fromSourceMap=function(k){return p.fromSourceMap(k)};e.prototype._version=3;e.prototype.__generatedMappings=null;Object.defineProperty(e.prototype,"_generatedMappings",{configurable:!0,enumerable:!0,get:function(){this.__generatedMappings||this._parseMappings(this._mappings,
+this.sourceRoot);return this.__generatedMappings}});e.prototype.__originalMappings=null;Object.defineProperty(e.prototype,"_originalMappings",{configurable:!0,enumerable:!0,get:function(){this.__originalMappings||this._parseMappings(this._mappings,this.sourceRoot);return this.__originalMappings}});e.prototype._charIsMappingSeparator=function(k,u){var d=k.charAt(u);return";"===d||","===d};e.prototype._parseMappings=function(k,u){throw Error("Subclasses must implement _parseMappings");};e.GENERATED_ORDER=
+1;e.ORIGINAL_ORDER=2;e.GREATEST_LOWER_BOUND=1;e.LEAST_UPPER_BOUND=2;e.prototype.eachMapping=function(k,u,d){u=u||null;switch(d||e.GENERATED_ORDER){case e.GENERATED_ORDER:d=this._generatedMappings;break;case e.ORIGINAL_ORDER:d=this._originalMappings;break;default:throw Error("Unknown order of iteration.");}var g=this.sourceRoot;d.map(function(n){var v=null===n.source?null:this._sources.at(n.source);v=f.computeSourceURL(g,v,this._sourceMapURL);return{source:v,generatedLine:n.generatedLine,generatedColumn:n.generatedColumn,
+originalLine:n.originalLine,originalColumn:n.originalColumn,name:null===n.name?null:this._names.at(n.name)}},this).forEach(k,u)};e.prototype.allGeneratedPositionsFor=function(k){var u=f.getArg(k,"line"),d={source:f.getArg(k,"source"),originalLine:u,originalColumn:f.getArg(k,"column",0)};null!=this.sourceRoot&&(d.source=f.relative(this.sourceRoot,d.source));if(!this._sources.has(d.source))return[];d.source=this._sources.indexOf(d.source);var g=[];d=this._findMapping(d,this._originalMappings,"originalLine",
+"originalColumn",f.compareByOriginalPositions,c.LEAST_UPPER_BOUND);if(0<=d){var n=this._originalMappings[d];if(void 0===k.column)for(u=n.originalLine;n&&n.originalLine===u;)g.push({line:f.getArg(n,"generatedLine",null),column:f.getArg(n,"generatedColumn",null),lastColumn:f.getArg(n,"lastGeneratedColumn",null)}),n=this._originalMappings[++d];else for(k=n.originalColumn;n&&n.originalLine===u&&n.originalColumn==k;)g.push({line:f.getArg(n,"generatedLine",null),column:f.getArg(n,"generatedColumn",null),
+lastColumn:f.getArg(n,"lastGeneratedColumn",null)}),n=this._originalMappings[++d]}return g};A.SourceMapConsumer=e;p.prototype=Object.create(e.prototype);p.prototype.consumer=e;p.fromSourceMap=function(k,u){var d=Object.create(p.prototype),g=d._names=l.fromArray(k._names.toArray(),!0),n=d._sources=l.fromArray(k._sources.toArray(),!0);d.sourceRoot=k._sourceRoot;d.sourcesContent=k._generateSourcesContent(d._sources.toArray(),d.sourceRoot);d.file=k._file;d._sourceMapURL=u;for(var v=k._mappings.toArray().slice(),
+z=d.__generatedMappings=[],G=d.__originalMappings=[],D=0,L=v.length;D<L;D++){var a=v[D],b=new t;b.generatedLine=a.generatedLine;b.generatedColumn=a.generatedColumn;a.source&&(b.source=n.indexOf(a.source),b.originalLine=a.originalLine,b.originalColumn=a.originalColumn,a.name&&(b.name=g.indexOf(a.name)),G.push(b));z.push(b)}r(d.__originalMappings,f.compareByOriginalPositions);return d};p.prototype._version=3;Object.defineProperty(p.prototype,"sources",{get:function(){return this._sources.toArray().map(function(k){return f.computeSourceURL(this.sourceRoot,
+k,this._sourceMapURL)},this)}});p.prototype._parseMappings=function(k,u){for(var d=1,g=0,n=0,v=0,z=0,G=0,D=k.length,L=0,a={},b={},h=[],w=[],y,I,K,N,P;L<D;)if(";"===k.charAt(L))d++,L++,g=0;else if(","===k.charAt(L))L++;else{y=new t;y.generatedLine=d;for(N=L;N<D&&!this._charIsMappingSeparator(k,N);N++);I=k.slice(L,N);if(K=a[I])L+=I.length;else{for(K=[];L<N;)q.decode(k,L,b),P=b.value,L=b.rest,K.push(P);if(2===K.length)throw Error("Found a source, but no line and column");if(3===K.length)throw Error("Found a source and line, but no column");
+a[I]=K}y.generatedColumn=g+K[0];g=y.generatedColumn;1<K.length&&(y.source=z+K[1],z+=K[1],y.originalLine=n+K[2],n=y.originalLine,y.originalLine+=1,y.originalColumn=v+K[3],v=y.originalColumn,4<K.length&&(y.name=G+K[4],G+=K[4]));w.push(y);"number"===typeof y.originalLine&&h.push(y)}r(w,f.compareByGeneratedPositionsDeflated);this.__generatedMappings=w;r(h,f.compareByOriginalPositions);this.__originalMappings=h};p.prototype._findMapping=function(k,u,d,g,n,v){if(0>=k[d])throw new TypeError("Line must be greater than or equal to 1, got "+
+k[d]);if(0>k[g])throw new TypeError("Column must be greater than or equal to 0, got "+k[g]);return c.search(k,u,n,v)};p.prototype.computeColumnSpans=function(){for(var k=0;k<this._generatedMappings.length;++k){var u=this._generatedMappings[k];if(k+1<this._generatedMappings.length){var d=this._generatedMappings[k+1];if(u.generatedLine===d.generatedLine){u.lastGeneratedColumn=d.generatedColumn-1;continue}}u.lastGeneratedColumn=Infinity}};p.prototype.originalPositionFor=function(k){var u={generatedLine:f.getArg(k,
+"line"),generatedColumn:f.getArg(k,"column")};k=this._findMapping(u,this._generatedMappings,"generatedLine","generatedColumn",f.compareByGeneratedPositionsDeflated,f.getArg(k,"bias",e.GREATEST_LOWER_BOUND));if(0<=k&&(k=this._generatedMappings[k],k.generatedLine===u.generatedLine)){u=f.getArg(k,"source",null);null!==u&&(u=this._sources.at(u),u=f.computeSourceURL(this.sourceRoot,u,this._sourceMapURL));var d=f.getArg(k,"name",null);null!==d&&(d=this._names.at(d));return{source:u,line:f.getArg(k,"originalLine",
+null),column:f.getArg(k,"originalColumn",null),name:d}}return{source:null,line:null,column:null,name:null}};p.prototype.hasContentsOfAllSources=function(){return this.sourcesContent?this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(k){return null==k}):!1};p.prototype.sourceContentFor=function(k,u){if(!this.sourcesContent)return null;var d=k;null!=this.sourceRoot&&(d=f.relative(this.sourceRoot,d));if(this._sources.has(d))return this.sourcesContent[this._sources.indexOf(d)];
+var g=this.sources,n;for(n=0;n<g.length;++n)if(g[n]==k)return this.sourcesContent[n];var v;if(null!=this.sourceRoot&&(v=f.urlParse(this.sourceRoot))){g=d.replace(/^file:\/\//,"");if("file"==v.scheme&&this._sources.has(g))return this.sourcesContent[this._sources.indexOf(g)];if((!v.path||"/"==v.path)&&this._sources.has("/"+d))return this.sourcesContent[this._sources.indexOf("/"+d)]}if(u)return null;throw Error('"'+d+'" is not in the SourceMap.');};p.prototype.generatedPositionFor=function(k){var u=
+f.getArg(k,"source");null!=this.sourceRoot&&(u=f.relative(this.sourceRoot,u));if(!this._sources.has(u))return{line:null,column:null,lastColumn:null};u=this._sources.indexOf(u);u={source:u,originalLine:f.getArg(k,"line"),originalColumn:f.getArg(k,"column")};k=this._findMapping(u,this._originalMappings,"originalLine","originalColumn",f.compareByOriginalPositions,f.getArg(k,"bias",e.GREATEST_LOWER_BOUND));return 0<=k&&(k=this._originalMappings[k],k.source===u.source)?{line:f.getArg(k,"generatedLine",
+null),column:f.getArg(k,"generatedColumn",null),lastColumn:f.getArg(k,"lastGeneratedColumn",null)}:{line:null,column:null,lastColumn:null}};A.BasicSourceMapConsumer=p;m.prototype=Object.create(e.prototype);m.prototype.constructor=e;m.prototype._version=3;Object.defineProperty(m.prototype,"sources",{get:function(){for(var k=[],u=0;u<this._sections.length;u++)for(var d=0;d<this._sections[u].consumer.sources.length;d++)k.push(this._sections[u].consumer.sources[d]);return k}});m.prototype.originalPositionFor=
+function(k){var u={generatedLine:f.getArg(k,"line"),generatedColumn:f.getArg(k,"column")},d=c.search(u,this._sections,function(g,n){var v=g.generatedLine-n.generatedOffset.generatedLine;return v?v:g.generatedColumn-n.generatedOffset.generatedColumn});return(d=this._sections[d])?d.consumer.originalPositionFor({line:u.generatedLine-(d.generatedOffset.generatedLine-1),column:u.generatedColumn-(d.generatedOffset.generatedLine===u.generatedLine?d.generatedOffset.generatedColumn-1:0),bias:k.bias}):{source:null,
+line:null,column:null,name:null}};m.prototype.hasContentsOfAllSources=function(){return this._sections.every(function(k){return k.consumer.hasContentsOfAllSources()})};m.prototype.sourceContentFor=function(k,u){for(var d=0;d<this._sections.length;d++){var g=this._sections[d].consumer.sourceContentFor(k,!0);if(g)return g}if(u)return null;throw Error('"'+k+'" is not in the SourceMap.');};m.prototype.generatedPositionFor=function(k){for(var u=0;u<this._sections.length;u++){var d=this._sections[u];if(-1!==
+d.consumer.sources.indexOf(f.getArg(k,"source"))){var g=d.consumer.generatedPositionFor(k);if(g)return{line:g.line+(d.generatedOffset.generatedLine-1),column:g.column+(d.generatedOffset.generatedLine===g.line?d.generatedOffset.generatedColumn-1:0)}}}return{line:null,column:null}};m.prototype._parseMappings=function(k,u){this.__generatedMappings=[];this.__originalMappings=[];for(var d=0;d<this._sections.length;d++)for(var g=this._sections[d],n=g.consumer._generatedMappings,v=0;v<n.length;v++){var z=
+n[v],G=g.consumer._sources.at(z.source);G=f.computeSourceURL(g.consumer.sourceRoot,G,this._sourceMapURL);this._sources.add(G);G=this._sources.indexOf(G);var D=null;z.name&&(D=g.consumer._names.at(z.name),this._names.add(D),D=this._names.indexOf(D));z={source:G,generatedLine:z.generatedLine+(g.generatedOffset.generatedLine-1),generatedColumn:z.generatedColumn+(g.generatedOffset.generatedLine===z.generatedLine?g.generatedOffset.generatedColumn-1:0),originalLine:z.originalLine,originalColumn:z.originalColumn,
+name:D};this.__generatedMappings.push(z);"number"===typeof z.originalLine&&this.__originalMappings.push(z)}r(this.__generatedMappings,f.compareByGeneratedPositionsDeflated);r(this.__originalMappings,f.compareByOriginalPositions)};A.IndexedSourceMapConsumer=m},{"./array-set":10,"./base64-vlq":11,"./binary-search":13,"./quick-sort":15,"./util":19}],17:[function(C,J,A){function e(c){c||(c={});this._file=t.getArg(c,"file",null);this._sourceRoot=t.getArg(c,"sourceRoot",null);this._skipValidation=t.getArg(c,
+"skipValidation",!1);this._sources=new m;this._names=new m;this._mappings=new f;this._sourcesContents=null}var p=C("./base64-vlq"),t=C("./util"),m=C("./array-set").ArraySet,f=C("./mapping-list").MappingList;e.prototype._version=3;e.fromSourceMap=function(c){var l=c.sourceRoot,q=new e({file:c.file,sourceRoot:l});c.eachMapping(function(r){var k={generated:{line:r.generatedLine,column:r.generatedColumn}};null!=r.source&&(k.source=r.source,null!=l&&(k.source=t.relative(l,k.source)),k.original={line:r.originalLine,
+column:r.originalColumn},null!=r.name&&(k.name=r.name));q.addMapping(k)});c.sources.forEach(function(r){var k=r;null!==l&&(k=t.relative(l,r));q._sources.has(k)||q._sources.add(k);k=c.sourceContentFor(r);null!=k&&q.setSourceContent(r,k)});return q};e.prototype.addMapping=function(c){var l=t.getArg(c,"generated"),q=t.getArg(c,"original",null),r=t.getArg(c,"source",null);c=t.getArg(c,"name",null);this._skipValidation||this._validateMapping(l,q,r,c);null!=r&&(r=String(r),this._sources.has(r)||this._sources.add(r));
+null!=c&&(c=String(c),this._names.has(c)||this._names.add(c));this._mappings.add({generatedLine:l.line,generatedColumn:l.column,originalLine:null!=q&&q.line,originalColumn:null!=q&&q.column,source:r,name:c})};e.prototype.setSourceContent=function(c,l){var q=c;null!=this._sourceRoot&&(q=t.relative(this._sourceRoot,q));null!=l?(this._sourcesContents||(this._sourcesContents=Object.create(null)),this._sourcesContents[t.toSetString(q)]=l):this._sourcesContents&&(delete this._sourcesContents[t.toSetString(q)],
+0===Object.keys(this._sourcesContents).length&&(this._sourcesContents=null))};e.prototype.applySourceMap=function(c,l,q){var r=l;if(null==l){if(null==c.file)throw Error('SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, or the source map\'s "file" property. Both were omitted.');r=c.file}var k=this._sourceRoot;null!=k&&(r=t.relative(k,r));var u=new m,d=new m;this._mappings.unsortedForEach(function(g){if(g.source===r&&null!=g.originalLine){var n=c.originalPositionFor({line:g.originalLine,
+column:g.originalColumn});null!=n.source&&(g.source=n.source,null!=q&&(g.source=t.join(q,g.source)),null!=k&&(g.source=t.relative(k,g.source)),g.originalLine=n.line,g.originalColumn=n.column,null!=n.name&&(g.name=n.name))}n=g.source;null==n||u.has(n)||u.add(n);g=g.name;null==g||d.has(g)||d.add(g)},this);this._sources=u;this._names=d;c.sources.forEach(function(g){var n=c.sourceContentFor(g);null!=n&&(null!=q&&(g=t.join(q,g)),null!=k&&(g=t.relative(k,g)),this.setSourceContent(g,n))},this)};e.prototype._validateMapping=
+function(c,l,q,r){if(l&&"number"!==typeof l.line&&"number"!==typeof l.column)throw Error("original.line and original.column are not numbers -- you probably meant to omit the original mapping entirely and only map the generated position. If so, pass null for the original mapping instead of an object with empty or null values.");if(!(c&&"line"in c&&"column"in c&&0<c.line&&0<=c.column&&!l&&!q&&!r||c&&"line"in c&&"column"in c&&l&&"line"in l&&"column"in l&&0<c.line&&0<=c.column&&0<l.line&&0<=l.column&&
+q))throw Error("Invalid mapping: "+JSON.stringify({generated:c,source:q,original:l,name:r}));};e.prototype._serializeMappings=function(){for(var c=0,l=1,q=0,r=0,k=0,u=0,d="",g,n,v,z=this._mappings.toArray(),G=0,D=z.length;G<D;G++){n=z[G];g="";if(n.generatedLine!==l)for(c=0;n.generatedLine!==l;)g+=";",l++;else if(0<G){if(!t.compareByGeneratedPositionsInflated(n,z[G-1]))continue;g+=","}g+=p.encode(n.generatedColumn-c);c=n.generatedColumn;null!=n.source&&(v=this._sources.indexOf(n.source),g+=p.encode(v-
+u),u=v,g+=p.encode(n.originalLine-1-r),r=n.originalLine-1,g+=p.encode(n.originalColumn-q),q=n.originalColumn,null!=n.name&&(n=this._names.indexOf(n.name),g+=p.encode(n-k),k=n));d+=g}return d};e.prototype._generateSourcesContent=function(c,l){return c.map(function(q){if(!this._sourcesContents)return null;null!=l&&(q=t.relative(l,q));q=t.toSetString(q);return Object.prototype.hasOwnProperty.call(this._sourcesContents,q)?this._sourcesContents[q]:null},this)};e.prototype.toJSON=function(){var c={version:this._version,
+sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};null!=this._file&&(c.file=this._file);null!=this._sourceRoot&&(c.sourceRoot=this._sourceRoot);this._sourcesContents&&(c.sourcesContent=this._generateSourcesContent(c.sources,c.sourceRoot));return c};e.prototype.toString=function(){return JSON.stringify(this.toJSON())};A.SourceMapGenerator=e},{"./array-set":10,"./base64-vlq":11,"./mapping-list":14,"./util":19}],18:[function(C,J,A){function e(f,c,l,q,r){this.children=
+[];this.sourceContents={};this.line=null==f?null:f;this.column=null==c?null:c;this.source=null==l?null:l;this.name=null==r?null:r;this.$$$isSourceNode$$$=!0;null!=q&&this.add(q)}var p=C("./source-map-generator").SourceMapGenerator,t=C("./util"),m=/(\r?\n)/;e.fromStringWithSourceMap=function(f,c,l){function q(z,G){if(null===z||void 0===z.source)r.add(G);else{var D=l?t.join(l,z.source):z.source;r.add(new e(z.originalLine,z.originalColumn,D,G,z.name))}}var r=new e,k=f.split(m),u=0,d=function(){var z=
+u<k.length?k[u++]:void 0,G=(u<k.length?k[u++]:void 0)||"";return z+G},g=1,n=0,v=null;c.eachMapping(function(z){if(null!==v)if(g<z.generatedLine)q(v,d()),g++,n=0;else{var G=k[u]||"",D=G.substr(0,z.generatedColumn-n);k[u]=G.substr(z.generatedColumn-n);n=z.generatedColumn;q(v,D);v=z;return}for(;g<z.generatedLine;)r.add(d()),g++;n<z.generatedColumn&&(G=k[u]||"",r.add(G.substr(0,z.generatedColumn)),k[u]=G.substr(z.generatedColumn),n=z.generatedColumn);v=z},this);u<k.length&&(v&&q(v,d()),r.add(k.splice(u).join("")));
+c.sources.forEach(function(z){var G=c.sourceContentFor(z);null!=G&&(null!=l&&(z=t.join(l,z)),r.setSourceContent(z,G))});return r};e.prototype.add=function(f){if(Array.isArray(f))f.forEach(function(c){this.add(c)},this);else if(f.$$$isSourceNode$$$||"string"===typeof f)f&&this.children.push(f);else throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+f);return this};e.prototype.prepend=function(f){if(Array.isArray(f))for(var c=f.length-1;0<=c;c--)this.prepend(f[c]);
+else if(f.$$$isSourceNode$$$||"string"===typeof f)this.children.unshift(f);else throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+f);return this};e.prototype.walk=function(f){for(var c,l=0,q=this.children.length;l<q;l++)c=this.children[l],c.$$$isSourceNode$$$?c.walk(f):""!==c&&f(c,{source:this.source,line:this.line,column:this.column,name:this.name})};e.prototype.join=function(f){var c,l=this.children.length;if(0<l){var q=[];for(c=0;c<l-1;c++)q.push(this.children[c]),
+q.push(f);q.push(this.children[c]);this.children=q}return this};e.prototype.replaceRight=function(f,c){var l=this.children[this.children.length-1];l.$$$isSourceNode$$$?l.replaceRight(f,c):"string"===typeof l?this.children[this.children.length-1]=l.replace(f,c):this.children.push("".replace(f,c));return this};e.prototype.setSourceContent=function(f,c){this.sourceContents[t.toSetString(f)]=c};e.prototype.walkSourceContents=function(f){for(var c=0,l=this.children.length;c<l;c++)this.children[c].$$$isSourceNode$$$&&
+this.children[c].walkSourceContents(f);var q=Object.keys(this.sourceContents);c=0;for(l=q.length;c<l;c++)f(t.fromSetString(q[c]),this.sourceContents[q[c]])};e.prototype.toString=function(){var f="";this.walk(function(c){f+=c});return f};e.prototype.toStringWithSourceMap=function(f){var c="",l=1,q=0,r=new p(f),k=!1,u=null,d=null,g=null,n=null;this.walk(function(v,z){c+=v;null!==z.source&&null!==z.line&&null!==z.column?(u===z.source&&d===z.line&&g===z.column&&n===z.name||r.addMapping({source:z.source,
+original:{line:z.line,column:z.column},generated:{line:l,column:q},name:z.name}),u=z.source,d=z.line,g=z.column,n=z.name,k=!0):k&&(r.addMapping({generated:{line:l,column:q}}),u=null,k=!1);for(var G=0,D=v.length;G<D;G++)10===v.charCodeAt(G)?(l++,q=0,G+1===D?(u=null,k=!1):k&&r.addMapping({source:z.source,original:{line:z.line,column:z.column},generated:{line:l,column:q},name:z.name})):q++});this.walkSourceContents(function(v,z){r.setSourceContent(v,z)});return{code:c,map:r}};A.SourceNode=e},{"./source-map-generator":17,
+"./util":19}],19:[function(C,J,A){function e(d){return(d=d.match(k))?{scheme:d[1],auth:d[2],host:d[3],port:d[4],path:d[5]}:null}function p(d){var g="";d.scheme&&(g+=d.scheme+":");g+="//";d.auth&&(g+=d.auth+"@");d.host&&(g+=d.host);d.port&&(g+=":"+d.port);d.path&&(g+=d.path);return g}function t(d){var g=d,n=e(d);if(n){if(!n.path)return d;g=n.path}d=A.isAbsolute(g);g=g.split(/\/+/);for(var v,z=0,G=g.length-1;0<=G;G--)v=g[G],"."===v?g.splice(G,1):".."===v?z++:0<z&&(""===v?(g.splice(G+1,z),z=0):(g.splice(G,
+2),z--));g=g.join("/");""===g&&(g=d?"/":".");return n?(n.path=g,p(n)):g}function m(d,g){""===d&&(d=".");""===g&&(g=".");var n=e(g),v=e(d);v&&(d=v.path||"/");if(n&&!n.scheme)return v&&(n.scheme=v.scheme),p(n);if(n||g.match(u))return g;if(v&&!v.host&&!v.path)return v.host=g,p(v);n="/"===g.charAt(0)?g:t(d.replace(/\/+$/,"")+"/"+g);return v?(v.path=n,p(v)):n}function f(d){return d}function c(d){return q(d)?"$"+d:d}function l(d){return q(d)?d.slice(1):d}function q(d){if(!d)return!1;var g=d.length;if(9>
+g||95!==d.charCodeAt(g-1)||95!==d.charCodeAt(g-2)||111!==d.charCodeAt(g-3)||116!==d.charCodeAt(g-4)||111!==d.charCodeAt(g-5)||114!==d.charCodeAt(g-6)||112!==d.charCodeAt(g-7)||95!==d.charCodeAt(g-8)||95!==d.charCodeAt(g-9))return!1;for(g-=10;0<=g;g--)if(36!==d.charCodeAt(g))return!1;return!0}function r(d,g){return d===g?0:null===d?1:null===g?-1:d>g?1:-1}A.getArg=function(d,g,n){if(g in d)return d[g];if(3===arguments.length)return n;throw Error('"'+g+'" is a required argument.');};var k=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/,
+u=/^data:.+,.+$/;A.urlParse=e;A.urlGenerate=p;A.normalize=t;A.join=m;A.isAbsolute=function(d){return"/"===d.charAt(0)||k.test(d)};A.relative=function(d,g){""===d&&(d=".");d=d.replace(/\/$/,"");for(var n=0;0!==g.indexOf(d+"/");){var v=d.lastIndexOf("/");if(0>v)return g;d=d.slice(0,v);if(d.match(/^([^\/]+:\/)?\/*$/))return g;++n}return Array(n+1).join("../")+g.substr(d.length+1)};C=!("__proto__"in Object.create(null));A.toSetString=C?f:c;A.fromSetString=C?f:l;A.compareByOriginalPositions=function(d,
+g,n){var v=r(d.source,g.source);if(0!==v)return v;v=d.originalLine-g.originalLine;if(0!==v)return v;v=d.originalColumn-g.originalColumn;if(0!==v||n)return v;v=d.generatedColumn-g.generatedColumn;if(0!==v)return v;v=d.generatedLine-g.generatedLine;return 0!==v?v:r(d.name,g.name)};A.compareByGeneratedPositionsDeflated=function(d,g,n){var v=d.generatedLine-g.generatedLine;if(0!==v)return v;v=d.generatedColumn-g.generatedColumn;if(0!==v||n)return v;v=r(d.source,g.source);if(0!==v)return v;v=d.originalLine-
+g.originalLine;if(0!==v)return v;v=d.originalColumn-g.originalColumn;return 0!==v?v:r(d.name,g.name)};A.compareByGeneratedPositionsInflated=function(d,g){var n=d.generatedLine-g.generatedLine;if(0!==n)return n;n=d.generatedColumn-g.generatedColumn;if(0!==n)return n;n=r(d.source,g.source);if(0!==n)return n;n=d.originalLine-g.originalLine;if(0!==n)return n;n=d.originalColumn-g.originalColumn;return 0!==n?n:r(d.name,g.name)};A.parseSourceMapInput=function(d){return JSON.parse(d.replace(/^\)]}'[^\n]*\n/,
+""))};A.computeSourceURL=function(d,g,n){g=g||"";d&&("/"!==d[d.length-1]&&"/"!==g[0]&&(d+="/"),g=d+g);if(n){d=e(n);if(!d)throw Error("sourceMapURL could not be parsed");d.path&&(n=d.path.lastIndexOf("/"),0<=n&&(d.path=d.path.substring(0,n+1)));g=m(p(d),g)}return t(g)}},{}],20:[function(C,J,A){A.SourceMapGenerator=C("./lib/source-map-generator").SourceMapGenerator;A.SourceMapConsumer=C("./lib/source-map-consumer").SourceMapConsumer;A.SourceNode=C("./lib/source-node").SourceNode},{"./lib/source-map-consumer":16,
+"./lib/source-map-generator":17,"./lib/source-node":18}],21:[function(C,J,A){(function(e){function p(){return"browser"===a?!0:"node"===a?!1:"undefined"!==typeof window&&"function"===typeof XMLHttpRequest&&!(window.require&&window.module&&window.process&&"renderer"===window.process.type)}function t(x){return function(B){for(var F=0;F<x.length;F++){var E=x[F](B);if(E)return E}return null}}function m(x,B){if(!x)return B;var F=n.dirname(x),E=/^\w+:\/\/[^\/]*/.exec(F);E=E?E[0]:"";var H=F.slice(E.length);
+return E&&/^\/\w:/.test(H)?(E+="/",E+n.resolve(F.slice(E.length),B).replace(/\\/g,"/")):E+n.resolve(F.slice(E.length),B)}function f(x){var B=h[x.source];if(!B){var F=N(x.source);F?(B=h[x.source]={url:F.url,map:new g(F.map)},B.map.sourcesContent&&B.map.sources.forEach(function(E,H){var M=B.map.sourcesContent[H];if(M){var S=m(B.url,E);b[S]=M}})):B=h[x.source]={url:null,map:null}}return B&&B.map&&"function"===typeof B.map.originalPositionFor&&(F=B.map.originalPositionFor(x),null!==F.source)?(F.source=
+m(B.url,F.source),F):x}function c(x){var B=/^eval at ([^(]+) \((.+):(\d+):(\d+)\)$/.exec(x);return B?(x=f({source:B[2],line:+B[3],column:B[4]-1}),"eval at "+B[1]+" ("+x.source+":"+x.line+":"+(x.column+1)+")"):(B=/^eval at ([^(]+) \((.+)\)$/.exec(x))?"eval at "+B[1]+" ("+c(B[2])+")":x}function l(){var x="";if(this.isNative())x="native";else{var B=this.getScriptNameOrSourceURL();!B&&this.isEval()&&(x=this.getEvalOrigin(),x+=", ");x=B?x+B:x+"<anonymous>";B=this.getLineNumber();null!=B&&(x+=":"+B,(B=
+this.getColumnNumber())&&(x+=":"+B))}B="";var F=this.getFunctionName(),E=!0,H=this.isConstructor();if(this.isToplevel()||H)H?B+="new "+(F||"<anonymous>"):F?B+=F:(B+=x,E=!1);else{H=this.getTypeName();"[object Object]"===H&&(H="null");var M=this.getMethodName();F?(H&&0!=F.indexOf(H)&&(B+=H+"."),B+=F,M&&F.indexOf("."+M)!=F.length-M.length-1&&(B+=" [as "+M+"]")):B+=H+"."+(M||"<anonymous>")}E&&(B+=" ("+x+")");return B}function q(x){var B={};Object.getOwnPropertyNames(Object.getPrototypeOf(x)).forEach(function(F){B[F]=
+/^(?:is|get)/.test(F)?function(){return x[F].call(x)}:x[F]});B.toString=l;return B}function r(x,B){void 0===B&&(B={nextPosition:null,curPosition:null});if(x.isNative())return B.curPosition=null,x;var F=x.getFileName()||x.getScriptNameOrSourceURL();if(F){var E=x.getLineNumber(),H=x.getColumnNumber()-1,M=/^v(10\.1[6-9]|10\.[2-9][0-9]|10\.[0-9]{3,}|1[2-9]\d*|[2-9]\d|\d{3,}|11\.11)/,S=M.test;var V="object"===typeof e&&null!==e?e.version:"";M=S.call(M,V)?0:62;1===E&&H>M&&!p()&&!x.isEval()&&(H-=M);var O=
+f({source:F,line:E,column:H});B.curPosition=O;x=q(x);var T=x.getFunctionName;x.getFunctionName=function(){return null==B.nextPosition?T():B.nextPosition.name||T()};x.getFileName=function(){return O.source};x.getLineNumber=function(){return O.line};x.getColumnNumber=function(){return O.column+1};x.getScriptNameOrSourceURL=function(){return O.source};return x}var Q=x.isEval()&&x.getEvalOrigin();Q&&(Q=c(Q),x=q(x),x.getEvalOrigin=function(){return Q});return x}function k(x,B){L&&(b={},h={});for(var F=
+(x.name||"Error")+": "+(x.message||""),E={nextPosition:null,curPosition:null},H=[],M=B.length-1;0<=M;M--)H.push("\n    at "+r(B[M],E)),E.nextPosition=E.curPosition;E.curPosition=E.nextPosition=null;return F+H.reverse().join("")}function u(x){var B=/\n    at [^(]+ \((.*):(\d+):(\d+)\)/.exec(x.stack);if(B){x=B[1];var F=+B[2];B=+B[3];var E=b[x];if(!E&&v&&v.existsSync(x))try{E=v.readFileSync(x,"utf8")}catch(H){E=""}if(E&&(E=E.split(/(?:\r\n|\r|\n)/)[F-1]))return x+":"+F+"\n"+E+"\n"+Array(B).join(" ")+
+"^"}return null}function d(){var x=e.emit;e.emit=function(B){if("uncaughtException"===B){var F=arguments[1]&&arguments[1].stack,E=0<this.listeners(B).length;if(F&&!E){F=arguments[1];E=u(F);var H="object"===typeof e&&null!==e?e.stderr:void 0;H&&H._handle&&H._handle.setBlocking&&H._handle.setBlocking(!0);E&&(console.error(),console.error(E));console.error(F.stack);"object"===typeof e&&null!==e&&"function"===typeof e.exit&&e.exit(1);return}}return x.apply(this,arguments)}}var g=C("source-map").SourceMapConsumer,
+n=C("path");try{var v=C("fs");v.existsSync&&v.readFileSync||(v=null)}catch(x){}var z=C("buffer-from"),G=!1,D=!1,L=!1,a="auto",b={},h={},w=/^data:application\/json[^,]+base64,/,y=[],I=[],K=t(y);y.push(function(x){x=x.trim();/^file:/.test(x)&&(x=x.replace(/file:\/\/\/(\w:)?/,function(E,H){return H?"":"/"}));if(x in b)return b[x];var B="";try{if(v)v.existsSync(x)&&(B=v.readFileSync(x,"utf8"));else{var F=new XMLHttpRequest;F.open("GET",x,!1);F.send(null);4===F.readyState&&200===F.status&&(B=F.responseText)}}catch(E){}return b[x]=
+B});var N=t(I);I.push(function(x){a:{if(p())try{var B=new XMLHttpRequest;B.open("GET",x,!1);B.send(null);var F=B.getResponseHeader("SourceMap")||B.getResponseHeader("X-SourceMap");if(F){var E=F;break a}}catch(M){}E=K(x);B=/(?:\/\/[@#][\s]*sourceMappingURL=([^\s'"]+)[\s]*$)|(?:\/\*[@#][\s]*sourceMappingURL=([^\s*'"]+)[\s]*(?:\*\/)[\s]*$)/mg;for(var H;F=B.exec(E);)H=F;E=H?H[1]:null}if(!E)return null;w.test(E)?(H=E.slice(E.indexOf(",")+1),H=z(H,"base64").toString(),E=x):(E=m(x,E),H=K(E));return H?{url:E,
+map:H}:null});var P=y.slice(0),W=I.slice(0);A.wrapCallSite=r;A.getErrorSource=u;A.mapSourcePosition=f;A.retrieveSourceMap=N;A.install=function(x){x=x||{};if(x.environment&&(a=x.environment,-1===["node","browser","auto"].indexOf(a)))throw Error("environment "+a+" was unknown. Available options are {auto, browser, node}");x.retrieveFile&&(x.overrideRetrieveFile&&(y.length=0),y.unshift(x.retrieveFile));x.retrieveSourceMap&&(x.overrideRetrieveSourceMap&&(I.length=0),I.unshift(x.retrieveSourceMap));if(x.hookRequire&&
+!p()){var B=J.require("module"),F=B.prototype._compile;F.__sourceMapSupport||(B.prototype._compile=function(E,H){b[H]=E;h[H]=void 0;return F.call(this,E,H)},B.prototype._compile.__sourceMapSupport=!0)}L||(L="emptyCacheBetweenOperations"in x?x.emptyCacheBetweenOperations:!1);G||(G=!0,Error.prepareStackTrace=k);if(!D){x="handleUncaughtExceptions"in x?x.handleUncaughtExceptions:!0;try{!1===J.require("worker_threads").isMainThread&&(x=!1)}catch(E){}x&&"object"===typeof e&&null!==e&&"function"===typeof e.on&&
+(D=!0,d())}};A.resetRetrieveHandlers=function(){y.length=0;I.length=0;y=P.slice(0);I=W.slice(0);N=t(I);K=t(y)}}).call(this,C("g5I+bs"))},{"buffer-from":4,fs:3,"g5I+bs":9,path:8,"source-map":20}]},{},[1]);return R});
diff --git a/node_modules/mathjs/examples/node_modules/source-map-support/package.json b/node_modules/mathjs/examples/node_modules/source-map-support/package.json
new file mode 100644
index 0000000..48ee1fd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map-support/package.json
@@ -0,0 +1,31 @@
+{
+  "name": "source-map-support",
+  "description": "Fixes stack traces for files with source maps",
+  "version": "0.5.21",
+  "main": "./source-map-support.js",
+  "scripts": {
+    "build": "node build.js",
+    "serve-tests": "http-server -p 1336",
+    "prepublish": "npm run build",
+    "test": "mocha"
+  },
+  "dependencies": {
+    "buffer-from": "^1.0.0",
+    "source-map": "^0.6.0"
+  },
+  "devDependencies": {
+    "browserify": "^4.2.3",
+    "coffeescript": "^1.12.7",
+    "http-server": "^0.11.1",
+    "mocha": "^3.5.3",
+    "webpack": "^1.15.0"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/evanw/node-source-map-support"
+  },
+  "bugs": {
+    "url": "https://github.com/evanw/node-source-map-support/issues"
+  },
+  "license": "MIT"
+}
diff --git a/node_modules/mathjs/examples/node_modules/source-map-support/register-hook-require.js b/node_modules/mathjs/examples/node_modules/source-map-support/register-hook-require.js
new file mode 100644
index 0000000..68fda03
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map-support/register-hook-require.js
@@ -0,0 +1 @@
+require('./').install({hookRequire: true});
diff --git a/node_modules/mathjs/examples/node_modules/source-map-support/register.js b/node_modules/mathjs/examples/node_modules/source-map-support/register.js
new file mode 100644
index 0000000..4f68e67
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map-support/register.js
@@ -0,0 +1 @@
+require('./').install();
diff --git a/node_modules/mathjs/examples/node_modules/source-map-support/source-map-support.js b/node_modules/mathjs/examples/node_modules/source-map-support/source-map-support.js
new file mode 100644
index 0000000..2942b5e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map-support/source-map-support.js
@@ -0,0 +1,625 @@
+var SourceMapConsumer = require('source-map').SourceMapConsumer;
+var path = require('path');
+
+var fs;
+try {
+  fs = require('fs');
+  if (!fs.existsSync || !fs.readFileSync) {
+    // fs doesn't have all methods we need
+    fs = null;
+  }
+} catch (err) {
+  /* nop */
+}
+
+var bufferFrom = require('buffer-from');
+
+/**
+ * Requires a module which is protected against bundler minification.
+ *
+ * @param {NodeModule} mod
+ * @param {string} request
+ */
+function dynamicRequire(mod, request) {
+  return mod.require(request);
+}
+
+// Only install once if called multiple times
+var errorFormatterInstalled = false;
+var uncaughtShimInstalled = false;
+
+// If true, the caches are reset before a stack trace formatting operation
+var emptyCacheBetweenOperations = false;
+
+// Supports {browser, node, auto}
+var environment = "auto";
+
+// Maps a file path to a string containing the file contents
+var fileContentsCache = {};
+
+// Maps a file path to a source map for that file
+var sourceMapCache = {};
+
+// Regex for detecting source maps
+var reSourceMap = /^data:application\/json[^,]+base64,/;
+
+// Priority list of retrieve handlers
+var retrieveFileHandlers = [];
+var retrieveMapHandlers = [];
+
+function isInBrowser() {
+  if (environment === "browser")
+    return true;
+  if (environment === "node")
+    return false;
+  return ((typeof window !== 'undefined') && (typeof XMLHttpRequest === 'function') && !(window.require && window.module && window.process && window.process.type === "renderer"));
+}
+
+function hasGlobalProcessEventEmitter() {
+  return ((typeof process === 'object') && (process !== null) && (typeof process.on === 'function'));
+}
+
+function globalProcessVersion() {
+  if ((typeof process === 'object') && (process !== null)) {
+    return process.version;
+  } else {
+    return '';
+  }
+}
+
+function globalProcessStderr() {
+  if ((typeof process === 'object') && (process !== null)) {
+    return process.stderr;
+  }
+}
+
+function globalProcessExit(code) {
+  if ((typeof process === 'object') && (process !== null) && (typeof process.exit === 'function')) {
+    return process.exit(code);
+  }
+}
+
+function handlerExec(list) {
+  return function(arg) {
+    for (var i = 0; i < list.length; i++) {
+      var ret = list[i](arg);
+      if (ret) {
+        return ret;
+      }
+    }
+    return null;
+  };
+}
+
+var retrieveFile = handlerExec(retrieveFileHandlers);
+
+retrieveFileHandlers.push(function(path) {
+  // Trim the path to make sure there is no extra whitespace.
+  path = path.trim();
+  if (/^file:/.test(path)) {
+    // existsSync/readFileSync can't handle file protocol, but once stripped, it works
+    path = path.replace(/file:\/\/\/(\w:)?/, function(protocol, drive) {
+      return drive ?
+        '' : // file:///C:/dir/file -> C:/dir/file
+        '/'; // file:///root-dir/file -> /root-dir/file
+    });
+  }
+  if (path in fileContentsCache) {
+    return fileContentsCache[path];
+  }
+
+  var contents = '';
+  try {
+    if (!fs) {
+      // Use SJAX if we are in the browser
+      var xhr = new XMLHttpRequest();
+      xhr.open('GET', path, /** async */ false);
+      xhr.send(null);
+      if (xhr.readyState === 4 && xhr.status === 200) {
+        contents = xhr.responseText;
+      }
+    } else if (fs.existsSync(path)) {
+      // Otherwise, use the filesystem
+      contents = fs.readFileSync(path, 'utf8');
+    }
+  } catch (er) {
+    /* ignore any errors */
+  }
+
+  return fileContentsCache[path] = contents;
+});
+
+// Support URLs relative to a directory, but be careful about a protocol prefix
+// in case we are in the browser (i.e. directories may start with "http://" or "file:///")
+function supportRelativeURL(file, url) {
+  if (!file) return url;
+  var dir = path.dirname(file);
+  var match = /^\w+:\/\/[^\/]*/.exec(dir);
+  var protocol = match ? match[0] : '';
+  var startPath = dir.slice(protocol.length);
+  if (protocol && /^\/\w\:/.test(startPath)) {
+    // handle file:///C:/ paths
+    protocol += '/';
+    return protocol + path.resolve(dir.slice(protocol.length), url).replace(/\\/g, '/');
+  }
+  return protocol + path.resolve(dir.slice(protocol.length), url);
+}
+
+function retrieveSourceMapURL(source) {
+  var fileData;
+
+  if (isInBrowser()) {
+     try {
+       var xhr = new XMLHttpRequest();
+       xhr.open('GET', source, false);
+       xhr.send(null);
+       fileData = xhr.readyState === 4 ? xhr.responseText : null;
+
+       // Support providing a sourceMappingURL via the SourceMap header
+       var sourceMapHeader = xhr.getResponseHeader("SourceMap") ||
+                             xhr.getResponseHeader("X-SourceMap");
+       if (sourceMapHeader) {
+         return sourceMapHeader;
+       }
+     } catch (e) {
+     }
+  }
+
+  // Get the URL of the source map
+  fileData = retrieveFile(source);
+  var re = /(?:\/\/[@#][\s]*sourceMappingURL=([^\s'"]+)[\s]*$)|(?:\/\*[@#][\s]*sourceMappingURL=([^\s*'"]+)[\s]*(?:\*\/)[\s]*$)/mg;
+  // Keep executing the search to find the *last* sourceMappingURL to avoid
+  // picking up sourceMappingURLs from comments, strings, etc.
+  var lastMatch, match;
+  while (match = re.exec(fileData)) lastMatch = match;
+  if (!lastMatch) return null;
+  return lastMatch[1];
+};
+
+// Can be overridden by the retrieveSourceMap option to install. Takes a
+// generated source filename; returns a {map, optional url} object, or null if
+// there is no source map.  The map field may be either a string or the parsed
+// JSON object (ie, it must be a valid argument to the SourceMapConsumer
+// constructor).
+var retrieveSourceMap = handlerExec(retrieveMapHandlers);
+retrieveMapHandlers.push(function(source) {
+  var sourceMappingURL = retrieveSourceMapURL(source);
+  if (!sourceMappingURL) return null;
+
+  // Read the contents of the source map
+  var sourceMapData;
+  if (reSourceMap.test(sourceMappingURL)) {
+    // Support source map URL as a data url
+    var rawData = sourceMappingURL.slice(sourceMappingURL.indexOf(',') + 1);
+    sourceMapData = bufferFrom(rawData, "base64").toString();
+    sourceMappingURL = source;
+  } else {
+    // Support source map URLs relative to the source URL
+    sourceMappingURL = supportRelativeURL(source, sourceMappingURL);
+    sourceMapData = retrieveFile(sourceMappingURL);
+  }
+
+  if (!sourceMapData) {
+    return null;
+  }
+
+  return {
+    url: sourceMappingURL,
+    map: sourceMapData
+  };
+});
+
+function mapSourcePosition(position) {
+  var sourceMap = sourceMapCache[position.source];
+  if (!sourceMap) {
+    // Call the (overrideable) retrieveSourceMap function to get the source map.
+    var urlAndMap = retrieveSourceMap(position.source);
+    if (urlAndMap) {
+      sourceMap = sourceMapCache[position.source] = {
+        url: urlAndMap.url,
+        map: new SourceMapConsumer(urlAndMap.map)
+      };
+
+      // Load all sources stored inline with the source map into the file cache
+      // to pretend like they are already loaded. They may not exist on disk.
+      if (sourceMap.map.sourcesContent) {
+        sourceMap.map.sources.forEach(function(source, i) {
+          var contents = sourceMap.map.sourcesContent[i];
+          if (contents) {
+            var url = supportRelativeURL(sourceMap.url, source);
+            fileContentsCache[url] = contents;
+          }
+        });
+      }
+    } else {
+      sourceMap = sourceMapCache[position.source] = {
+        url: null,
+        map: null
+      };
+    }
+  }
+
+  // Resolve the source URL relative to the URL of the source map
+  if (sourceMap && sourceMap.map && typeof sourceMap.map.originalPositionFor === 'function') {
+    var originalPosition = sourceMap.map.originalPositionFor(position);
+
+    // Only return the original position if a matching line was found. If no
+    // matching line is found then we return position instead, which will cause
+    // the stack trace to print the path and line for the compiled file. It is
+    // better to give a precise location in the compiled file than a vague
+    // location in the original file.
+    if (originalPosition.source !== null) {
+      originalPosition.source = supportRelativeURL(
+        sourceMap.url, originalPosition.source);
+      return originalPosition;
+    }
+  }
+
+  return position;
+}
+
+// Parses code generated by FormatEvalOrigin(), a function inside V8:
+// https://code.google.com/p/v8/source/browse/trunk/src/messages.js
+function mapEvalOrigin(origin) {
+  // Most eval() calls are in this format
+  var match = /^eval at ([^(]+) \((.+):(\d+):(\d+)\)$/.exec(origin);
+  if (match) {
+    var position = mapSourcePosition({
+      source: match[2],
+      line: +match[3],
+      column: match[4] - 1
+    });
+    return 'eval at ' + match[1] + ' (' + position.source + ':' +
+      position.line + ':' + (position.column + 1) + ')';
+  }
+
+  // Parse nested eval() calls using recursion
+  match = /^eval at ([^(]+) \((.+)\)$/.exec(origin);
+  if (match) {
+    return 'eval at ' + match[1] + ' (' + mapEvalOrigin(match[2]) + ')';
+  }
+
+  // Make sure we still return useful information if we didn't find anything
+  return origin;
+}
+
+// This is copied almost verbatim from the V8 source code at
+// https://code.google.com/p/v8/source/browse/trunk/src/messages.js. The
+// implementation of wrapCallSite() used to just forward to the actual source
+// code of CallSite.prototype.toString but unfortunately a new release of V8
+// did something to the prototype chain and broke the shim. The only fix I
+// could find was copy/paste.
+function CallSiteToString() {
+  var fileName;
+  var fileLocation = "";
+  if (this.isNative()) {
+    fileLocation = "native";
+  } else {
+    fileName = this.getScriptNameOrSourceURL();
+    if (!fileName && this.isEval()) {
+      fileLocation = this.getEvalOrigin();
+      fileLocation += ", ";  // Expecting source position to follow.
+    }
+
+    if (fileName) {
+      fileLocation += fileName;
+    } else {
+      // Source code does not originate from a file and is not native, but we
+      // can still get the source position inside the source string, e.g. in
+      // an eval string.
+      fileLocation += "<anonymous>";
+    }
+    var lineNumber = this.getLineNumber();
+    if (lineNumber != null) {
+      fileLocation += ":" + lineNumber;
+      var columnNumber = this.getColumnNumber();
+      if (columnNumber) {
+        fileLocation += ":" + columnNumber;
+      }
+    }
+  }
+
+  var line = "";
+  var functionName = this.getFunctionName();
+  var addSuffix = true;
+  var isConstructor = this.isConstructor();
+  var isMethodCall = !(this.isToplevel() || isConstructor);
+  if (isMethodCall) {
+    var typeName = this.getTypeName();
+    // Fixes shim to be backward compatable with Node v0 to v4
+    if (typeName === "[object Object]") {
+      typeName = "null";
+    }
+    var methodName = this.getMethodName();
+    if (functionName) {
+      if (typeName && functionName.indexOf(typeName) != 0) {
+        line += typeName + ".";
+      }
+      line += functionName;
+      if (methodName && functionName.indexOf("." + methodName) != functionName.length - methodName.length - 1) {
+        line += " [as " + methodName + "]";
+      }
+    } else {
+      line += typeName + "." + (methodName || "<anonymous>");
+    }
+  } else if (isConstructor) {
+    line += "new " + (functionName || "<anonymous>");
+  } else if (functionName) {
+    line += functionName;
+  } else {
+    line += fileLocation;
+    addSuffix = false;
+  }
+  if (addSuffix) {
+    line += " (" + fileLocation + ")";
+  }
+  return line;
+}
+
+function cloneCallSite(frame) {
+  var object = {};
+  Object.getOwnPropertyNames(Object.getPrototypeOf(frame)).forEach(function(name) {
+    object[name] = /^(?:is|get)/.test(name) ? function() { return frame[name].call(frame); } : frame[name];
+  });
+  object.toString = CallSiteToString;
+  return object;
+}
+
+function wrapCallSite(frame, state) {
+  // provides interface backward compatibility
+  if (state === undefined) {
+    state = { nextPosition: null, curPosition: null }
+  }
+  if(frame.isNative()) {
+    state.curPosition = null;
+    return frame;
+  }
+
+  // Most call sites will return the source file from getFileName(), but code
+  // passed to eval() ending in "//# sourceURL=..." will return the source file
+  // from getScriptNameOrSourceURL() instead
+  var source = frame.getFileName() || frame.getScriptNameOrSourceURL();
+  if (source) {
+    var line = frame.getLineNumber();
+    var column = frame.getColumnNumber() - 1;
+
+    // Fix position in Node where some (internal) code is prepended.
+    // See https://github.com/evanw/node-source-map-support/issues/36
+    // Header removed in node at ^10.16 || >=11.11.0
+    // v11 is not an LTS candidate, we can just test the one version with it.
+    // Test node versions for: 10.16-19, 10.20+, 12-19, 20-99, 100+, or 11.11
+    var noHeader = /^v(10\.1[6-9]|10\.[2-9][0-9]|10\.[0-9]{3,}|1[2-9]\d*|[2-9]\d|\d{3,}|11\.11)/;
+    var headerLength = noHeader.test(globalProcessVersion()) ? 0 : 62;
+    if (line === 1 && column > headerLength && !isInBrowser() && !frame.isEval()) {
+      column -= headerLength;
+    }
+
+    var position = mapSourcePosition({
+      source: source,
+      line: line,
+      column: column
+    });
+    state.curPosition = position;
+    frame = cloneCallSite(frame);
+    var originalFunctionName = frame.getFunctionName;
+    frame.getFunctionName = function() {
+      if (state.nextPosition == null) {
+        return originalFunctionName();
+      }
+      return state.nextPosition.name || originalFunctionName();
+    };
+    frame.getFileName = function() { return position.source; };
+    frame.getLineNumber = function() { return position.line; };
+    frame.getColumnNumber = function() { return position.column + 1; };
+    frame.getScriptNameOrSourceURL = function() { return position.source; };
+    return frame;
+  }
+
+  // Code called using eval() needs special handling
+  var origin = frame.isEval() && frame.getEvalOrigin();
+  if (origin) {
+    origin = mapEvalOrigin(origin);
+    frame = cloneCallSite(frame);
+    frame.getEvalOrigin = function() { return origin; };
+    return frame;
+  }
+
+  // If we get here then we were unable to change the source position
+  return frame;
+}
+
+// This function is part of the V8 stack trace API, for more info see:
+// https://v8.dev/docs/stack-trace-api
+function prepareStackTrace(error, stack) {
+  if (emptyCacheBetweenOperations) {
+    fileContentsCache = {};
+    sourceMapCache = {};
+  }
+
+  var name = error.name || 'Error';
+  var message = error.message || '';
+  var errorString = name + ": " + message;
+
+  var state = { nextPosition: null, curPosition: null };
+  var processedStack = [];
+  for (var i = stack.length - 1; i >= 0; i--) {
+    processedStack.push('\n    at ' + wrapCallSite(stack[i], state));
+    state.nextPosition = state.curPosition;
+  }
+  state.curPosition = state.nextPosition = null;
+  return errorString + processedStack.reverse().join('');
+}
+
+// Generate position and snippet of original source with pointer
+function getErrorSource(error) {
+  var match = /\n    at [^(]+ \((.*):(\d+):(\d+)\)/.exec(error.stack);
+  if (match) {
+    var source = match[1];
+    var line = +match[2];
+    var column = +match[3];
+
+    // Support the inline sourceContents inside the source map
+    var contents = fileContentsCache[source];
+
+    // Support files on disk
+    if (!contents && fs && fs.existsSync(source)) {
+      try {
+        contents = fs.readFileSync(source, 'utf8');
+      } catch (er) {
+        contents = '';
+      }
+    }
+
+    // Format the line from the original source code like node does
+    if (contents) {
+      var code = contents.split(/(?:\r\n|\r|\n)/)[line - 1];
+      if (code) {
+        return source + ':' + line + '\n' + code + '\n' +
+          new Array(column).join(' ') + '^';
+      }
+    }
+  }
+  return null;
+}
+
+function printErrorAndExit (error) {
+  var source = getErrorSource(error);
+
+  // Ensure error is printed synchronously and not truncated
+  var stderr = globalProcessStderr();
+  if (stderr && stderr._handle && stderr._handle.setBlocking) {
+    stderr._handle.setBlocking(true);
+  }
+
+  if (source) {
+    console.error();
+    console.error(source);
+  }
+
+  console.error(error.stack);
+  globalProcessExit(1);
+}
+
+function shimEmitUncaughtException () {
+  var origEmit = process.emit;
+
+  process.emit = function (type) {
+    if (type === 'uncaughtException') {
+      var hasStack = (arguments[1] && arguments[1].stack);
+      var hasListeners = (this.listeners(type).length > 0);
+
+      if (hasStack && !hasListeners) {
+        return printErrorAndExit(arguments[1]);
+      }
+    }
+
+    return origEmit.apply(this, arguments);
+  };
+}
+
+var originalRetrieveFileHandlers = retrieveFileHandlers.slice(0);
+var originalRetrieveMapHandlers = retrieveMapHandlers.slice(0);
+
+exports.wrapCallSite = wrapCallSite;
+exports.getErrorSource = getErrorSource;
+exports.mapSourcePosition = mapSourcePosition;
+exports.retrieveSourceMap = retrieveSourceMap;
+
+exports.install = function(options) {
+  options = options || {};
+
+  if (options.environment) {
+    environment = options.environment;
+    if (["node", "browser", "auto"].indexOf(environment) === -1) {
+      throw new Error("environment " + environment + " was unknown. Available options are {auto, browser, node}")
+    }
+  }
+
+  // Allow sources to be found by methods other than reading the files
+  // directly from disk.
+  if (options.retrieveFile) {
+    if (options.overrideRetrieveFile) {
+      retrieveFileHandlers.length = 0;
+    }
+
+    retrieveFileHandlers.unshift(options.retrieveFile);
+  }
+
+  // Allow source maps to be found by methods other than reading the files
+  // directly from disk.
+  if (options.retrieveSourceMap) {
+    if (options.overrideRetrieveSourceMap) {
+      retrieveMapHandlers.length = 0;
+    }
+
+    retrieveMapHandlers.unshift(options.retrieveSourceMap);
+  }
+
+  // Support runtime transpilers that include inline source maps
+  if (options.hookRequire && !isInBrowser()) {
+    // Use dynamicRequire to avoid including in browser bundles
+    var Module = dynamicRequire(module, 'module');
+    var $compile = Module.prototype._compile;
+
+    if (!$compile.__sourceMapSupport) {
+      Module.prototype._compile = function(content, filename) {
+        fileContentsCache[filename] = content;
+        sourceMapCache[filename] = undefined;
+        return $compile.call(this, content, filename);
+      };
+
+      Module.prototype._compile.__sourceMapSupport = true;
+    }
+  }
+
+  // Configure options
+  if (!emptyCacheBetweenOperations) {
+    emptyCacheBetweenOperations = 'emptyCacheBetweenOperations' in options ?
+      options.emptyCacheBetweenOperations : false;
+  }
+
+  // Install the error reformatter
+  if (!errorFormatterInstalled) {
+    errorFormatterInstalled = true;
+    Error.prepareStackTrace = prepareStackTrace;
+  }
+
+  if (!uncaughtShimInstalled) {
+    var installHandler = 'handleUncaughtExceptions' in options ?
+      options.handleUncaughtExceptions : true;
+
+    // Do not override 'uncaughtException' with our own handler in Node.js
+    // Worker threads. Workers pass the error to the main thread as an event,
+    // rather than printing something to stderr and exiting.
+    try {
+      // We need to use `dynamicRequire` because `require` on it's own will be optimized by WebPack/Browserify.
+      var worker_threads = dynamicRequire(module, 'worker_threads');
+      if (worker_threads.isMainThread === false) {
+        installHandler = false;
+      }
+    } catch(e) {}
+
+    // Provide the option to not install the uncaught exception handler. This is
+    // to support other uncaught exception handlers (in test frameworks, for
+    // example). If this handler is not installed and there are no other uncaught
+    // exception handlers, uncaught exceptions will be caught by node's built-in
+    // exception handler and the process will still be terminated. However, the
+    // generated JavaScript code will be shown above the stack trace instead of
+    // the original source code.
+    if (installHandler && hasGlobalProcessEventEmitter()) {
+      uncaughtShimInstalled = true;
+      shimEmitUncaughtException();
+    }
+  }
+};
+
+exports.resetRetrieveHandlers = function() {
+  retrieveFileHandlers.length = 0;
+  retrieveMapHandlers.length = 0;
+
+  retrieveFileHandlers = originalRetrieveFileHandlers.slice(0);
+  retrieveMapHandlers = originalRetrieveMapHandlers.slice(0);
+
+  retrieveSourceMap = handlerExec(retrieveMapHandlers);
+  retrieveFile = handlerExec(retrieveFileHandlers);
+}
diff --git a/node_modules/mathjs/examples/node_modules/source-map/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/source-map/CHANGELOG.md
new file mode 100644
index 0000000..3a8c066
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/CHANGELOG.md
@@ -0,0 +1,301 @@
+# Change Log
+
+## 0.5.6
+
+* Fix for regression when people were using numbers as names in source maps. See
+  #236.
+
+## 0.5.5
+
+* Fix "regression" of unsupported, implementation behavior that half the world
+  happens to have come to depend on. See #235.
+
+* Fix regression involving function hoisting in SpiderMonkey. See #233.
+
+## 0.5.4
+
+* Large performance improvements to source-map serialization. See #228 and #229.
+
+## 0.5.3
+
+* Do not include unnecessary distribution files. See
+  commit ef7006f8d1647e0a83fdc60f04f5a7ca54886f86.
+
+## 0.5.2
+
+* Include browser distributions of the library in package.json's `files`. See
+  issue #212.
+
+## 0.5.1
+
+* Fix latent bugs in IndexedSourceMapConsumer.prototype._parseMappings. See
+  ff05274becc9e6e1295ed60f3ea090d31d843379.
+
+## 0.5.0
+
+* Node 0.8 is no longer supported.
+
+* Use webpack instead of dryice for bundling.
+
+* Big speedups serializing source maps. See pull request #203.
+
+* Fix a bug with `SourceMapConsumer.prototype.sourceContentFor` and sources that
+  explicitly start with the source root. See issue #199.
+
+## 0.4.4
+
+* Fix an issue where using a `SourceMapGenerator` after having created a
+  `SourceMapConsumer` from it via `SourceMapConsumer.fromSourceMap` failed. See
+  issue #191.
+
+* Fix an issue with where `SourceMapGenerator` would mistakenly consider
+  different mappings as duplicates of each other and avoid generating them. See
+  issue #192.
+
+## 0.4.3
+
+* A very large number of performance improvements, particularly when parsing
+  source maps. Collectively about 75% of time shaved off of the source map
+  parsing benchmark!
+
+* Fix a bug in `SourceMapConsumer.prototype.allGeneratedPositionsFor` and fuzzy
+  searching in the presence of a column option. See issue #177.
+
+* Fix a bug with joining a source and its source root when the source is above
+  the root. See issue #182.
+
+* Add the `SourceMapConsumer.prototype.hasContentsOfAllSources` method to
+  determine when all sources' contents are inlined into the source map. See
+  issue #190.
+
+## 0.4.2
+
+* Add an `.npmignore` file so that the benchmarks aren't pulled down by
+  dependent projects. Issue #169.
+
+* Add an optional `column` argument to
+  `SourceMapConsumer.prototype.allGeneratedPositionsFor` and better handle lines
+  with no mappings. Issues #172 and #173.
+
+## 0.4.1
+
+* Fix accidentally defining a global variable. #170.
+
+## 0.4.0
+
+* The default direction for fuzzy searching was changed back to its original
+  direction. See #164.
+
+* There is now a `bias` option you can supply to `SourceMapConsumer` to control
+  the fuzzy searching direction. See #167.
+
+* About an 8% speed up in parsing source maps. See #159.
+
+* Added a benchmark for parsing and generating source maps.
+
+## 0.3.0
+
+* Change the default direction that searching for positions fuzzes when there is
+  not an exact match. See #154.
+
+* Support for environments using json2.js for JSON serialization. See #156.
+
+## 0.2.0
+
+* Support for consuming "indexed" source maps which do not have any remote
+  sections. See pull request #127. This introduces a minor backwards
+  incompatibility if you are monkey patching `SourceMapConsumer.prototype`
+  methods.
+
+## 0.1.43
+
+* Performance improvements for `SourceMapGenerator` and `SourceNode`. See issue
+  #148 for some discussion and issues #150, #151, and #152 for implementations.
+
+## 0.1.42
+
+* Fix an issue where `SourceNode`s from different versions of the source-map
+  library couldn't be used in conjunction with each other. See issue #142.
+
+## 0.1.41
+
+* Fix a bug with getting the source content of relative sources with a "./"
+  prefix. See issue #145 and [Bug 1090768](bugzil.la/1090768).
+
+* Add the `SourceMapConsumer.prototype.computeColumnSpans` method to compute the
+  column span of each mapping.
+
+* Add the `SourceMapConsumer.prototype.allGeneratedPositionsFor` method to find
+  all generated positions associated with a given original source and line.
+
+## 0.1.40
+
+* Performance improvements for parsing source maps in SourceMapConsumer.
+
+## 0.1.39
+
+* Fix a bug where setting a source's contents to null before any source content
+  had been set before threw a TypeError. See issue #131.
+
+## 0.1.38
+
+* Fix a bug where finding relative paths from an empty path were creating
+  absolute paths. See issue #129.
+
+## 0.1.37
+
+* Fix a bug where if the source root was an empty string, relative source paths
+  would turn into absolute source paths. Issue #124.
+
+## 0.1.36
+
+* Allow the `names` mapping property to be an empty string. Issue #121.
+
+## 0.1.35
+
+* A third optional parameter was added to `SourceNode.fromStringWithSourceMap`
+  to specify a path that relative sources in the second parameter should be
+  relative to. Issue #105.
+
+* If no file property is given to a `SourceMapGenerator`, then the resulting
+  source map will no longer have a `null` file property. The property will
+  simply not exist. Issue #104.
+
+* Fixed a bug where consecutive newlines were ignored in `SourceNode`s.
+  Issue #116.
+
+## 0.1.34
+
+* Make `SourceNode` work with windows style ("\r\n") newlines. Issue #103.
+
+* Fix bug involving source contents and the
+  `SourceMapGenerator.prototype.applySourceMap`. Issue #100.
+
+## 0.1.33
+
+* Fix some edge cases surrounding path joining and URL resolution.
+
+* Add a third parameter for relative path to
+  `SourceMapGenerator.prototype.applySourceMap`.
+
+* Fix issues with mappings and EOLs.
+
+## 0.1.32
+
+* Fixed a bug where SourceMapConsumer couldn't handle negative relative columns
+  (issue 92).
+
+* Fixed test runner to actually report number of failed tests as its process
+  exit code.
+
+* Fixed a typo when reporting bad mappings (issue 87).
+
+## 0.1.31
+
+* Delay parsing the mappings in SourceMapConsumer until queried for a source
+  location.
+
+* Support Sass source maps (which at the time of writing deviate from the spec
+  in small ways) in SourceMapConsumer.
+
+## 0.1.30
+
+* Do not join source root with a source, when the source is a data URI.
+
+* Extend the test runner to allow running single specific test files at a time.
+
+* Performance improvements in `SourceNode.prototype.walk` and
+  `SourceMapConsumer.prototype.eachMapping`.
+
+* Source map browser builds will now work inside Workers.
+
+* Better error messages when attempting to add an invalid mapping to a
+  `SourceMapGenerator`.
+
+## 0.1.29
+
+* Allow duplicate entries in the `names` and `sources` arrays of source maps
+  (usually from TypeScript) we are parsing. Fixes github issue 72.
+
+## 0.1.28
+
+* Skip duplicate mappings when creating source maps from SourceNode; github
+  issue 75.
+
+## 0.1.27
+
+* Don't throw an error when the `file` property is missing in SourceMapConsumer,
+  we don't use it anyway.
+
+## 0.1.26
+
+* Fix SourceNode.fromStringWithSourceMap for empty maps. Fixes github issue 70.
+
+## 0.1.25
+
+* Make compatible with browserify
+
+## 0.1.24
+
+* Fix issue with absolute paths and `file://` URIs. See
+  https://bugzilla.mozilla.org/show_bug.cgi?id=885597
+
+## 0.1.23
+
+* Fix issue with absolute paths and sourcesContent, github issue 64.
+
+## 0.1.22
+
+* Ignore duplicate mappings in SourceMapGenerator. Fixes github issue 21.
+
+## 0.1.21
+
+* Fixed handling of sources that start with a slash so that they are relative to
+  the source root's host.
+
+## 0.1.20
+
+* Fixed github issue #43: absolute URLs aren't joined with the source root
+  anymore.
+
+## 0.1.19
+
+* Using Travis CI to run tests.
+
+## 0.1.18
+
+* Fixed a bug in the handling of sourceRoot.
+
+## 0.1.17
+
+* Added SourceNode.fromStringWithSourceMap.
+
+## 0.1.16
+
+* Added missing documentation.
+
+* Fixed the generating of empty mappings in SourceNode.
+
+## 0.1.15
+
+* Added SourceMapGenerator.applySourceMap.
+
+## 0.1.14
+
+* The sourceRoot is now handled consistently.
+
+## 0.1.13
+
+* Added SourceMapGenerator.fromSourceMap.
+
+## 0.1.12
+
+* SourceNode now generates empty mappings too.
+
+## 0.1.11
+
+* Added name support to SourceNode.
+
+## 0.1.10
+
+* Added sourcesContent support to the customer and generator.
diff --git a/node_modules/mathjs/examples/node_modules/source-map/LICENSE b/node_modules/mathjs/examples/node_modules/source-map/LICENSE
new file mode 100644
index 0000000..ed1b7cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/LICENSE
@@ -0,0 +1,28 @@
+
+Copyright (c) 2009-2011, Mozilla Foundation and contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the names of the Mozilla Foundation nor the names of project
+  contributors may be used to endorse or promote products derived from this
+  software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/source-map/README.md b/node_modules/mathjs/examples/node_modules/source-map/README.md
new file mode 100644
index 0000000..fea4beb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/README.md
@@ -0,0 +1,742 @@
+# Source Map
+
+[![Build Status](https://travis-ci.org/mozilla/source-map.png?branch=master)](https://travis-ci.org/mozilla/source-map)
+
+[![NPM](https://nodei.co/npm/source-map.png?downloads=true&downloadRank=true)](https://www.npmjs.com/package/source-map)
+
+This is a library to generate and consume the source map format
+[described here][format].
+
+[format]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit
+
+## Use with Node
+
+    $ npm install source-map
+
+## Use on the Web
+
+    <script src="https://raw.githubusercontent.com/mozilla/source-map/master/dist/source-map.min.js" defer></script>
+
+--------------------------------------------------------------------------------
+
+<!-- `npm run toc` to regenerate the Table of Contents -->
+
+<!-- START doctoc generated TOC please keep comment here to allow auto update -->
+<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN doctoc TO UPDATE -->
+## Table of Contents
+
+- [Examples](#examples)
+  - [Consuming a source map](#consuming-a-source-map)
+  - [Generating a source map](#generating-a-source-map)
+    - [With SourceNode (high level API)](#with-sourcenode-high-level-api)
+    - [With SourceMapGenerator (low level API)](#with-sourcemapgenerator-low-level-api)
+- [API](#api)
+  - [SourceMapConsumer](#sourcemapconsumer)
+    - [new SourceMapConsumer(rawSourceMap)](#new-sourcemapconsumerrawsourcemap)
+    - [SourceMapConsumer.prototype.computeColumnSpans()](#sourcemapconsumerprototypecomputecolumnspans)
+    - [SourceMapConsumer.prototype.originalPositionFor(generatedPosition)](#sourcemapconsumerprototypeoriginalpositionforgeneratedposition)
+    - [SourceMapConsumer.prototype.generatedPositionFor(originalPosition)](#sourcemapconsumerprototypegeneratedpositionfororiginalposition)
+    - [SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)](#sourcemapconsumerprototypeallgeneratedpositionsfororiginalposition)
+    - [SourceMapConsumer.prototype.hasContentsOfAllSources()](#sourcemapconsumerprototypehascontentsofallsources)
+    - [SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])](#sourcemapconsumerprototypesourcecontentforsource-returnnullonmissing)
+    - [SourceMapConsumer.prototype.eachMapping(callback, context, order)](#sourcemapconsumerprototypeeachmappingcallback-context-order)
+  - [SourceMapGenerator](#sourcemapgenerator)
+    - [new SourceMapGenerator([startOfSourceMap])](#new-sourcemapgeneratorstartofsourcemap)
+    - [SourceMapGenerator.fromSourceMap(sourceMapConsumer)](#sourcemapgeneratorfromsourcemapsourcemapconsumer)
+    - [SourceMapGenerator.prototype.addMapping(mapping)](#sourcemapgeneratorprototypeaddmappingmapping)
+    - [SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)](#sourcemapgeneratorprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])](#sourcemapgeneratorprototypeapplysourcemapsourcemapconsumer-sourcefile-sourcemappath)
+    - [SourceMapGenerator.prototype.toString()](#sourcemapgeneratorprototypetostring)
+  - [SourceNode](#sourcenode)
+    - [new SourceNode([line, column, source[, chunk[, name]]])](#new-sourcenodeline-column-source-chunk-name)
+    - [SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])](#sourcenodefromstringwithsourcemapcode-sourcemapconsumer-relativepath)
+    - [SourceNode.prototype.add(chunk)](#sourcenodeprototypeaddchunk)
+    - [SourceNode.prototype.prepend(chunk)](#sourcenodeprototypeprependchunk)
+    - [SourceNode.prototype.setSourceContent(sourceFile, sourceContent)](#sourcenodeprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceNode.prototype.walk(fn)](#sourcenodeprototypewalkfn)
+    - [SourceNode.prototype.walkSourceContents(fn)](#sourcenodeprototypewalksourcecontentsfn)
+    - [SourceNode.prototype.join(sep)](#sourcenodeprototypejoinsep)
+    - [SourceNode.prototype.replaceRight(pattern, replacement)](#sourcenodeprototypereplacerightpattern-replacement)
+    - [SourceNode.prototype.toString()](#sourcenodeprototypetostring)
+    - [SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])](#sourcenodeprototypetostringwithsourcemapstartofsourcemap)
+
+<!-- END doctoc generated TOC please keep comment here to allow auto update -->
+
+## Examples
+
+### Consuming a source map
+
+```js
+var rawSourceMap = {
+  version: 3,
+  file: 'min.js',
+  names: ['bar', 'baz', 'n'],
+  sources: ['one.js', 'two.js'],
+  sourceRoot: 'http://example.com/www/js/',
+  mappings: 'CAAC,IAAI,IAAM,SAAUA,GAClB,OAAOC,IAAID;CCDb,IAAI,IAAM,SAAUE,GAClB,OAAOA'
+};
+
+var smc = new SourceMapConsumer(rawSourceMap);
+
+console.log(smc.sources);
+// [ 'http://example.com/www/js/one.js',
+//   'http://example.com/www/js/two.js' ]
+
+console.log(smc.originalPositionFor({
+  line: 2,
+  column: 28
+}));
+// { source: 'http://example.com/www/js/two.js',
+//   line: 2,
+//   column: 10,
+//   name: 'n' }
+
+console.log(smc.generatedPositionFor({
+  source: 'http://example.com/www/js/two.js',
+  line: 2,
+  column: 10
+}));
+// { line: 2, column: 28 }
+
+smc.eachMapping(function (m) {
+  // ...
+});
+```
+
+### Generating a source map
+
+In depth guide:
+[**Compiling to JavaScript, and Debugging with Source Maps**](https://hacks.mozilla.org/2013/05/compiling-to-javascript-and-debugging-with-source-maps/)
+
+#### With SourceNode (high level API)
+
+```js
+function compile(ast) {
+  switch (ast.type) {
+  case 'BinaryExpression':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      [compile(ast.left), " + ", compile(ast.right)]
+    );
+  case 'Literal':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      String(ast.value)
+    );
+  // ...
+  default:
+    throw new Error("Bad AST");
+  }
+}
+
+var ast = parse("40 + 2", "add.js");
+console.log(compile(ast).toStringWithSourceMap({
+  file: 'add.js'
+}));
+// { code: '40 + 2',
+//   map: [object SourceMapGenerator] }
+```
+
+#### With SourceMapGenerator (low level API)
+
+```js
+var map = new SourceMapGenerator({
+  file: "source-mapped.js"
+});
+
+map.addMapping({
+  generated: {
+    line: 10,
+    column: 35
+  },
+  source: "foo.js",
+  original: {
+    line: 33,
+    column: 2
+  },
+  name: "christopher"
+});
+
+console.log(map.toString());
+// '{"version":3,"file":"source-mapped.js","sources":["foo.js"],"names":["christopher"],"mappings":";;;;;;;;;mCAgCEA"}'
+```
+
+## API
+
+Get a reference to the module:
+
+```js
+// Node.js
+var sourceMap = require('source-map');
+
+// Browser builds
+var sourceMap = window.sourceMap;
+
+// Inside Firefox
+const sourceMap = require("devtools/toolkit/sourcemap/source-map.js");
+```
+
+### SourceMapConsumer
+
+A SourceMapConsumer instance represents a parsed source map which we can query
+for information about the original file positions by giving it a file position
+in the generated source.
+
+#### new SourceMapConsumer(rawSourceMap)
+
+The only parameter is the raw source map (either as a string which can be
+`JSON.parse`'d, or an object). According to the spec, source maps have the
+following attributes:
+
+* `version`: Which version of the source map spec this map is following.
+
+* `sources`: An array of URLs to the original source files.
+
+* `names`: An array of identifiers which can be referenced by individual
+  mappings.
+
+* `sourceRoot`: Optional. The URL root from which all sources are relative.
+
+* `sourcesContent`: Optional. An array of contents of the original source files.
+
+* `mappings`: A string of base64 VLQs which contain the actual mappings.
+
+* `file`: Optional. The generated filename this source map is associated with.
+
+```js
+var consumer = new sourceMap.SourceMapConsumer(rawSourceMapJsonData);
+```
+
+#### SourceMapConsumer.prototype.computeColumnSpans()
+
+Compute the last column for each generated mapping. The last column is
+inclusive.
+
+```js
+// Before:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+
+consumer.computeColumnSpans();
+
+// After:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1,
+//     lastColumn: 9 },
+//   { line: 2,
+//     column: 10,
+//     lastColumn: 19 },
+//   { line: 2,
+//     column: 20,
+//     lastColumn: Infinity } ]
+
+```
+
+#### SourceMapConsumer.prototype.originalPositionFor(generatedPosition)
+
+Returns the original source, line, and column information for the generated
+source's line and column positions provided. The only argument is an object with
+the following properties:
+
+* `line`: The line number in the generated source.  Line numbers in
+  this library are 1-based (note that the underlying source map
+  specification uses 0-based line numbers -- this library handles the
+  translation).
+
+* `column`: The column number in the generated source.  Column numbers
+  in this library are 0-based.
+
+* `bias`: Either `SourceMapConsumer.GREATEST_LOWER_BOUND` or
+  `SourceMapConsumer.LEAST_UPPER_BOUND`. Specifies whether to return the closest
+  element that is smaller than or greater than the one we are searching for,
+  respectively, if the exact element cannot be found.  Defaults to
+  `SourceMapConsumer.GREATEST_LOWER_BOUND`.
+
+and an object is returned with the following properties:
+
+* `source`: The original source file, or null if this information is not
+  available.
+
+* `line`: The line number in the original source, or null if this information is
+  not available.  The line number is 1-based.
+
+* `column`: The column number in the original source, or null if this
+  information is not available.  The column number is 0-based.
+
+* `name`: The original identifier, or null if this information is not available.
+
+```js
+consumer.originalPositionFor({ line: 2, column: 10 })
+// { source: 'foo.coffee',
+//   line: 2,
+//   column: 2,
+//   name: null }
+
+consumer.originalPositionFor({ line: 99999999999999999, column: 999999999999999 })
+// { source: null,
+//   line: null,
+//   column: null,
+//   name: null }
+```
+
+#### SourceMapConsumer.prototype.generatedPositionFor(originalPosition)
+
+Returns the generated line and column information for the original source,
+line, and column positions provided. The only argument is an object with
+the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: The column number in the original source.  The column
+  number is 0-based.
+
+and an object is returned with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.generatedPositionFor({ source: "example.js", line: 2, column: 10 })
+// { line: 1,
+//   column: 56 }
+```
+
+#### SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)
+
+Returns all generated line and column information for the original source, line,
+and column provided. If no column is provided, returns all mappings
+corresponding to a either the line we are searching for or the next closest line
+that has any mappings. Otherwise, returns all mappings corresponding to the
+given line and either the column we are searching for or the next closest column
+that has any offsets.
+
+The only argument is an object with the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: Optional. The column number in the original source.  The
+  column number is 0-based.
+
+and an array of objects is returned, each with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.allGeneratedpositionsfor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+```
+
+#### SourceMapConsumer.prototype.hasContentsOfAllSources()
+
+Return true if we have the embedded source content for every source listed in
+the source map, false otherwise.
+
+In other words, if this method returns `true`, then
+`consumer.sourceContentFor(s)` will succeed for every source `s` in
+`consumer.sources`.
+
+```js
+// ...
+if (consumer.hasContentsOfAllSources()) {
+  consumerReadyCallback(consumer);
+} else {
+  fetchSources(consumer, consumerReadyCallback);
+}
+// ...
+```
+
+#### SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])
+
+Returns the original source content for the source provided. The only
+argument is the URL of the original source file.
+
+If the source content for the given source is not found, then an error is
+thrown. Optionally, pass `true` as the second param to have `null` returned
+instead.
+
+```js
+consumer.sources
+// [ "my-cool-lib.clj" ]
+
+consumer.sourceContentFor("my-cool-lib.clj")
+// "..."
+
+consumer.sourceContentFor("this is not in the source map");
+// Error: "this is not in the source map" is not in the source map
+
+consumer.sourceContentFor("this is not in the source map", true);
+// null
+```
+
+#### SourceMapConsumer.prototype.eachMapping(callback, context, order)
+
+Iterate over each mapping between an original source/line/column and a
+generated line/column in this source map.
+
+* `callback`: The function that is called with each mapping. Mappings have the
+  form `{ source, generatedLine, generatedColumn, originalLine, originalColumn,
+  name }`
+
+* `context`: Optional. If specified, this object will be the value of `this`
+  every time that `callback` is called.
+
+* `order`: Either `SourceMapConsumer.GENERATED_ORDER` or
+  `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to iterate over
+  the mappings sorted by the generated file's line/column order or the
+  original's source/line/column order, respectively. Defaults to
+  `SourceMapConsumer.GENERATED_ORDER`.
+
+```js
+consumer.eachMapping(function (m) { console.log(m); })
+// ...
+// { source: 'illmatic.js',
+//   generatedLine: 1,
+//   generatedColumn: 0,
+//   originalLine: 1,
+//   originalColumn: 0,
+//   name: null }
+// { source: 'illmatic.js',
+//   generatedLine: 2,
+//   generatedColumn: 0,
+//   originalLine: 2,
+//   originalColumn: 0,
+//   name: null }
+// ...
+```
+### SourceMapGenerator
+
+An instance of the SourceMapGenerator represents a source map which is being
+built incrementally.
+
+#### new SourceMapGenerator([startOfSourceMap])
+
+You may pass an object with the following properties:
+
+* `file`: The filename of the generated source that this source map is
+  associated with.
+
+* `sourceRoot`: A root for all relative URLs in this source map.
+
+* `skipValidation`: Optional. When `true`, disables validation of mappings as
+  they are added. This can improve performance but should be used with
+  discretion, as a last resort. Even then, one should avoid using this flag when
+  running tests, if possible.
+
+```js
+var generator = new sourceMap.SourceMapGenerator({
+  file: "my-generated-javascript-file.js",
+  sourceRoot: "http://example.com/app/js/"
+});
+```
+
+#### SourceMapGenerator.fromSourceMap(sourceMapConsumer)
+
+Creates a new `SourceMapGenerator` from an existing `SourceMapConsumer` instance.
+
+* `sourceMapConsumer` The SourceMap.
+
+```js
+var generator = sourceMap.SourceMapGenerator.fromSourceMap(consumer);
+```
+
+#### SourceMapGenerator.prototype.addMapping(mapping)
+
+Add a single mapping from original source line and column to the generated
+source's line and column for this source map being created. The mapping object
+should have the following properties:
+
+* `generated`: An object with the generated line and column positions.
+
+* `original`: An object with the original line and column positions.
+
+* `source`: The original source file (relative to the sourceRoot).
+
+* `name`: An optional original token name for this mapping.
+
+```js
+generator.addMapping({
+  source: "module-one.scm",
+  original: { line: 128, column: 0 },
+  generated: { line: 3, column: 456 }
+})
+```
+
+#### SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for an original source file.
+
+* `sourceFile` the URL of the original source file.
+
+* `sourceContent` the content of the source file.
+
+```js
+generator.setSourceContent("module-one.scm",
+                           fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])
+
+Applies a SourceMap for a source file to the SourceMap.
+Each mapping to the supplied source file is rewritten using the
+supplied SourceMap. Note: The resolution for the resulting mappings
+is the minimum of this map and the supplied map.
+
+* `sourceMapConsumer`: The SourceMap to be applied.
+
+* `sourceFile`: Optional. The filename of the source file.
+  If omitted, sourceMapConsumer.file will be used, if it exists.
+  Otherwise an error will be thrown.
+
+* `sourceMapPath`: Optional. The dirname of the path to the SourceMap
+  to be applied. If relative, it is relative to the SourceMap.
+
+  This parameter is needed when the two SourceMaps aren't in the same
+  directory, and the SourceMap to be applied contains relative source
+  paths. If so, those relative source paths need to be rewritten
+  relative to the SourceMap.
+
+  If omitted, it is assumed that both SourceMaps are in the same directory,
+  thus not needing any rewriting. (Supplying `'.'` has the same effect.)
+
+#### SourceMapGenerator.prototype.toString()
+
+Renders the source map being generated to a string.
+
+```js
+generator.toString()
+// '{"version":3,"sources":["module-one.scm"],"names":[],"mappings":"...snip...","file":"my-generated-javascript-file.js","sourceRoot":"http://example.com/app/js/"}'
+```
+
+### SourceNode
+
+SourceNodes provide a way to abstract over interpolating and/or concatenating
+snippets of generated JavaScript source code, while maintaining the line and
+column information associated between those snippets and the original source
+code. This is useful as the final intermediate representation a compiler might
+use before outputting the generated JS and source map.
+
+#### new SourceNode([line, column, source[, chunk[, name]]])
+
+* `line`: The original line number associated with this source node, or null if
+  it isn't associated with an original line.  The line number is 1-based.
+
+* `column`: The original column number associated with this source node, or null
+  if it isn't associated with an original column.  The column number
+  is 0-based.
+
+* `source`: The original source's filename; null if no filename is provided.
+
+* `chunk`: Optional. Is immediately passed to `SourceNode.prototype.add`, see
+  below.
+
+* `name`: Optional. The original identifier.
+
+```js
+var node = new SourceNode(1, 2, "a.cpp", [
+  new SourceNode(3, 4, "b.cpp", "extern int status;\n"),
+  new SourceNode(5, 6, "c.cpp", "std::string* make_string(size_t n);\n"),
+  new SourceNode(7, 8, "d.cpp", "int main(int argc, char** argv) {}\n"),
+]);
+```
+
+#### SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])
+
+Creates a SourceNode from generated code and a SourceMapConsumer.
+
+* `code`: The generated code
+
+* `sourceMapConsumer` The SourceMap for the generated code
+
+* `relativePath` The optional path that relative sources in `sourceMapConsumer`
+  should be relative to.
+
+```js
+var consumer = new SourceMapConsumer(fs.readFileSync("path/to/my-file.js.map", "utf8"));
+var node = SourceNode.fromStringWithSourceMap(fs.readFileSync("path/to/my-file.js"),
+                                              consumer);
+```
+
+#### SourceNode.prototype.add(chunk)
+
+Add a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.add(" + ");
+node.add(otherNode);
+node.add([leftHandOperandNode, " + ", rightHandOperandNode]);
+```
+
+#### SourceNode.prototype.prepend(chunk)
+
+Prepend a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.prepend("/** Build Id: f783haef86324gf **/\n\n");
+```
+
+#### SourceNode.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for a source file. This will be added to the
+`SourceMap` in the `sourcesContent` field.
+
+* `sourceFile`: The filename of the source file
+
+* `sourceContent`: The content of the source file
+
+```js
+node.setSourceContent("module-one.scm",
+                      fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceNode.prototype.walk(fn)
+
+Walk over the tree of JS snippets in this node and its children. The walking
+function is called once for each snippet of JS and is passed that snippet and
+the its original associated source's line/column location.
+
+* `fn`: The traversal function.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.walk(function (code, loc) { console.log("WALK:", code, loc); })
+// WALK: uno { source: 'b.js', line: 3, column: 4, name: null }
+// WALK: dos { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: tres { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: quatro { source: 'c.js', line: 5, column: 6, name: null }
+```
+
+#### SourceNode.prototype.walkSourceContents(fn)
+
+Walk over the tree of SourceNodes. The walking function is called for each
+source file content and is passed the filename and source content.
+
+* `fn`: The traversal function.
+
+```js
+var a = new SourceNode(1, 2, "a.js", "generated from a");
+a.setSourceContent("a.js", "original a");
+var b = new SourceNode(1, 2, "b.js", "generated from b");
+b.setSourceContent("b.js", "original b");
+var c = new SourceNode(1, 2, "c.js", "generated from c");
+c.setSourceContent("c.js", "original c");
+
+var node = new SourceNode(null, null, null, [a, b, c]);
+node.walkSourceContents(function (source, contents) { console.log("WALK:", source, ":", contents); })
+// WALK: a.js : original a
+// WALK: b.js : original b
+// WALK: c.js : original c
+```
+
+#### SourceNode.prototype.join(sep)
+
+Like `Array.prototype.join` except for SourceNodes. Inserts the separator
+between each of this source node's children.
+
+* `sep`: The separator.
+
+```js
+var lhs = new SourceNode(1, 2, "a.rs", "my_copy");
+var operand = new SourceNode(3, 4, "a.rs", "=");
+var rhs = new SourceNode(5, 6, "a.rs", "orig.clone()");
+
+var node = new SourceNode(null, null, null, [ lhs, operand, rhs ]);
+var joinedNode = node.join(" ");
+```
+
+#### SourceNode.prototype.replaceRight(pattern, replacement)
+
+Call `String.prototype.replace` on the very right-most source snippet. Useful
+for trimming white space from the end of a source node, etc.
+
+* `pattern`: The pattern to replace.
+
+* `replacement`: The thing to replace the pattern with.
+
+```js
+// Trim trailing white space.
+node.replaceRight(/\s*$/, "");
+```
+
+#### SourceNode.prototype.toString()
+
+Return the string representation of this source node. Walks over the tree and
+concatenates all the various snippets together to one string.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toString()
+// 'unodostresquatro'
+```
+
+#### SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])
+
+Returns the string representation of this tree of source nodes, plus a
+SourceMapGenerator which contains all the mappings between the generated and
+original sources.
+
+The arguments are the same as those to `new SourceMapGenerator`.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toStringWithSourceMap({ file: "my-output-file.js" })
+// { code: 'unodostresquatro',
+//   map: [object SourceMapGenerator] }
+```
diff --git a/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.debug.js b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.debug.js
new file mode 100644
index 0000000..aad0620
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.debug.js
@@ -0,0 +1,3234 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory();
+	else if(typeof define === 'function' && define.amd)
+		define([], factory);
+	else if(typeof exports === 'object')
+		exports["sourceMap"] = factory();
+	else
+		root["sourceMap"] = factory();
+})(this, function() {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+/******/
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+/******/
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId])
+/******/ 			return installedModules[moduleId].exports;
+/******/
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			exports: {},
+/******/ 			id: moduleId,
+/******/ 			loaded: false
+/******/ 		};
+/******/
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+/******/
+/******/ 		// Flag the module as loaded
+/******/ 		module.loaded = true;
+/******/
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+/******/
+/******/
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+/******/
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+/******/
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+/******/
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(0);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/*
+	 * Copyright 2009-2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE.txt or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	exports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	exports.SourceMapConsumer = __webpack_require__(7).SourceMapConsumer;
+	exports.SourceNode = __webpack_require__(10).SourceNode;
+
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var base64VLQ = __webpack_require__(2);
+	var util = __webpack_require__(4);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var MappingList = __webpack_require__(6).MappingList;
+	
+	/**
+	 * An instance of the SourceMapGenerator represents a source map which is
+	 * being built incrementally. You may pass an object with the following
+	 * properties:
+	 *
+	 *   - file: The filename of the generated source.
+	 *   - sourceRoot: A root for all relative URLs in this source map.
+	 */
+	function SourceMapGenerator(aArgs) {
+	  if (!aArgs) {
+	    aArgs = {};
+	  }
+	  this._file = util.getArg(aArgs, 'file', null);
+	  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+	  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+	  this._mappings = new MappingList();
+	  this._sourcesContents = null;
+	}
+	
+	SourceMapGenerator.prototype._version = 3;
+	
+	/**
+	 * Creates a new SourceMapGenerator based on a SourceMapConsumer
+	 *
+	 * @param aSourceMapConsumer The SourceMap.
+	 */
+	SourceMapGenerator.fromSourceMap =
+	  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+	    var sourceRoot = aSourceMapConsumer.sourceRoot;
+	    var generator = new SourceMapGenerator({
+	      file: aSourceMapConsumer.file,
+	      sourceRoot: sourceRoot
+	    });
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      var newMapping = {
+	        generated: {
+	          line: mapping.generatedLine,
+	          column: mapping.generatedColumn
+	        }
+	      };
+	
+	      if (mapping.source != null) {
+	        newMapping.source = mapping.source;
+	        if (sourceRoot != null) {
+	          newMapping.source = util.relative(sourceRoot, newMapping.source);
+	        }
+	
+	        newMapping.original = {
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        };
+	
+	        if (mapping.name != null) {
+	          newMapping.name = mapping.name;
+	        }
+	      }
+	
+	      generator.addMapping(newMapping);
+	    });
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var sourceRelative = sourceFile;
+	      if (sourceRoot !== null) {
+	        sourceRelative = util.relative(sourceRoot, sourceFile);
+	      }
+	
+	      if (!generator._sources.has(sourceRelative)) {
+	        generator._sources.add(sourceRelative);
+	      }
+	
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        generator.setSourceContent(sourceFile, content);
+	      }
+	    });
+	    return generator;
+	  };
+	
+	/**
+	 * Add a single mapping from original source line and column to the generated
+	 * source's line and column for this source map being created. The mapping
+	 * object should have the following properties:
+	 *
+	 *   - generated: An object with the generated line and column positions.
+	 *   - original: An object with the original line and column positions.
+	 *   - source: The original source file (relative to the sourceRoot).
+	 *   - name: An optional original token name for this mapping.
+	 */
+	SourceMapGenerator.prototype.addMapping =
+	  function SourceMapGenerator_addMapping(aArgs) {
+	    var generated = util.getArg(aArgs, 'generated');
+	    var original = util.getArg(aArgs, 'original', null);
+	    var source = util.getArg(aArgs, 'source', null);
+	    var name = util.getArg(aArgs, 'name', null);
+	
+	    if (!this._skipValidation) {
+	      this._validateMapping(generated, original, source, name);
+	    }
+	
+	    if (source != null) {
+	      source = String(source);
+	      if (!this._sources.has(source)) {
+	        this._sources.add(source);
+	      }
+	    }
+	
+	    if (name != null) {
+	      name = String(name);
+	      if (!this._names.has(name)) {
+	        this._names.add(name);
+	      }
+	    }
+	
+	    this._mappings.add({
+	      generatedLine: generated.line,
+	      generatedColumn: generated.column,
+	      originalLine: original != null && original.line,
+	      originalColumn: original != null && original.column,
+	      source: source,
+	      name: name
+	    });
+	  };
+	
+	/**
+	 * Set the source content for a source file.
+	 */
+	SourceMapGenerator.prototype.setSourceContent =
+	  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+	    var source = aSourceFile;
+	    if (this._sourceRoot != null) {
+	      source = util.relative(this._sourceRoot, source);
+	    }
+	
+	    if (aSourceContent != null) {
+	      // Add the source content to the _sourcesContents map.
+	      // Create a new _sourcesContents map if the property is null.
+	      if (!this._sourcesContents) {
+	        this._sourcesContents = Object.create(null);
+	      }
+	      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+	    } else if (this._sourcesContents) {
+	      // Remove the source file from the _sourcesContents map.
+	      // If the _sourcesContents map is empty, set the property to null.
+	      delete this._sourcesContents[util.toSetString(source)];
+	      if (Object.keys(this._sourcesContents).length === 0) {
+	        this._sourcesContents = null;
+	      }
+	    }
+	  };
+	
+	/**
+	 * Applies the mappings of a sub-source-map for a specific source file to the
+	 * source map being generated. Each mapping to the supplied source file is
+	 * rewritten using the supplied source map. Note: The resolution for the
+	 * resulting mappings is the minimium of this map and the supplied map.
+	 *
+	 * @param aSourceMapConsumer The source map to be applied.
+	 * @param aSourceFile Optional. The filename of the source file.
+	 *        If omitted, SourceMapConsumer's file property will be used.
+	 * @param aSourceMapPath Optional. The dirname of the path to the source map
+	 *        to be applied. If relative, it is relative to the SourceMapConsumer.
+	 *        This parameter is needed when the two source maps aren't in the same
+	 *        directory, and the source map to be applied contains relative source
+	 *        paths. If so, those relative source paths need to be rewritten
+	 *        relative to the SourceMapGenerator.
+	 */
+	SourceMapGenerator.prototype.applySourceMap =
+	  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+	    var sourceFile = aSourceFile;
+	    // If aSourceFile is omitted, we will use the file property of the SourceMap
+	    if (aSourceFile == null) {
+	      if (aSourceMapConsumer.file == null) {
+	        throw new Error(
+	          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+	          'or the source map\'s "file" property. Both were omitted.'
+	        );
+	      }
+	      sourceFile = aSourceMapConsumer.file;
+	    }
+	    var sourceRoot = this._sourceRoot;
+	    // Make "sourceFile" relative if an absolute Url is passed.
+	    if (sourceRoot != null) {
+	      sourceFile = util.relative(sourceRoot, sourceFile);
+	    }
+	    // Applying the SourceMap can add and remove items from the sources and
+	    // the names array.
+	    var newSources = new ArraySet();
+	    var newNames = new ArraySet();
+	
+	    // Find mappings for the "sourceFile"
+	    this._mappings.unsortedForEach(function (mapping) {
+	      if (mapping.source === sourceFile && mapping.originalLine != null) {
+	        // Check if it can be mapped by the source map, then update the mapping.
+	        var original = aSourceMapConsumer.originalPositionFor({
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        });
+	        if (original.source != null) {
+	          // Copy mapping
+	          mapping.source = original.source;
+	          if (aSourceMapPath != null) {
+	            mapping.source = util.join(aSourceMapPath, mapping.source)
+	          }
+	          if (sourceRoot != null) {
+	            mapping.source = util.relative(sourceRoot, mapping.source);
+	          }
+	          mapping.originalLine = original.line;
+	          mapping.originalColumn = original.column;
+	          if (original.name != null) {
+	            mapping.name = original.name;
+	          }
+	        }
+	      }
+	
+	      var source = mapping.source;
+	      if (source != null && !newSources.has(source)) {
+	        newSources.add(source);
+	      }
+	
+	      var name = mapping.name;
+	      if (name != null && !newNames.has(name)) {
+	        newNames.add(name);
+	      }
+	
+	    }, this);
+	    this._sources = newSources;
+	    this._names = newNames;
+	
+	    // Copy sourcesContents of applied map.
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aSourceMapPath != null) {
+	          sourceFile = util.join(aSourceMapPath, sourceFile);
+	        }
+	        if (sourceRoot != null) {
+	          sourceFile = util.relative(sourceRoot, sourceFile);
+	        }
+	        this.setSourceContent(sourceFile, content);
+	      }
+	    }, this);
+	  };
+	
+	/**
+	 * A mapping can have one of the three levels of data:
+	 *
+	 *   1. Just the generated position.
+	 *   2. The Generated position, original position, and original source.
+	 *   3. Generated and original position, original source, as well as a name
+	 *      token.
+	 *
+	 * To maintain consistency, we validate that any new mapping being added falls
+	 * in to one of these categories.
+	 */
+	SourceMapGenerator.prototype._validateMapping =
+	  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+	                                              aName) {
+	    // When aOriginal is truthy but has empty values for .line and .column,
+	    // it is most likely a programmer error. In this case we throw a very
+	    // specific error message to try to guide them the right way.
+	    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+	    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+	        throw new Error(
+	            'original.line and original.column are not numbers -- you probably meant to omit ' +
+	            'the original mapping entirely and only map the generated position. If so, pass ' +
+	            'null for the original mapping instead of an object with empty or null values.'
+	        );
+	    }
+	
+	    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	        && aGenerated.line > 0 && aGenerated.column >= 0
+	        && !aOriginal && !aSource && !aName) {
+	      // Case 1.
+	      return;
+	    }
+	    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+	             && aGenerated.line > 0 && aGenerated.column >= 0
+	             && aOriginal.line > 0 && aOriginal.column >= 0
+	             && aSource) {
+	      // Cases 2 and 3.
+	      return;
+	    }
+	    else {
+	      throw new Error('Invalid mapping: ' + JSON.stringify({
+	        generated: aGenerated,
+	        source: aSource,
+	        original: aOriginal,
+	        name: aName
+	      }));
+	    }
+	  };
+	
+	/**
+	 * Serialize the accumulated mappings in to the stream of base 64 VLQs
+	 * specified by the source map format.
+	 */
+	SourceMapGenerator.prototype._serializeMappings =
+	  function SourceMapGenerator_serializeMappings() {
+	    var previousGeneratedColumn = 0;
+	    var previousGeneratedLine = 1;
+	    var previousOriginalColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousName = 0;
+	    var previousSource = 0;
+	    var result = '';
+	    var next;
+	    var mapping;
+	    var nameIdx;
+	    var sourceIdx;
+	
+	    var mappings = this._mappings.toArray();
+	    for (var i = 0, len = mappings.length; i < len; i++) {
+	      mapping = mappings[i];
+	      next = ''
+	
+	      if (mapping.generatedLine !== previousGeneratedLine) {
+	        previousGeneratedColumn = 0;
+	        while (mapping.generatedLine !== previousGeneratedLine) {
+	          next += ';';
+	          previousGeneratedLine++;
+	        }
+	      }
+	      else {
+	        if (i > 0) {
+	          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+	            continue;
+	          }
+	          next += ',';
+	        }
+	      }
+	
+	      next += base64VLQ.encode(mapping.generatedColumn
+	                                 - previousGeneratedColumn);
+	      previousGeneratedColumn = mapping.generatedColumn;
+	
+	      if (mapping.source != null) {
+	        sourceIdx = this._sources.indexOf(mapping.source);
+	        next += base64VLQ.encode(sourceIdx - previousSource);
+	        previousSource = sourceIdx;
+	
+	        // lines are stored 0-based in SourceMap spec version 3
+	        next += base64VLQ.encode(mapping.originalLine - 1
+	                                   - previousOriginalLine);
+	        previousOriginalLine = mapping.originalLine - 1;
+	
+	        next += base64VLQ.encode(mapping.originalColumn
+	                                   - previousOriginalColumn);
+	        previousOriginalColumn = mapping.originalColumn;
+	
+	        if (mapping.name != null) {
+	          nameIdx = this._names.indexOf(mapping.name);
+	          next += base64VLQ.encode(nameIdx - previousName);
+	          previousName = nameIdx;
+	        }
+	      }
+	
+	      result += next;
+	    }
+	
+	    return result;
+	  };
+	
+	SourceMapGenerator.prototype._generateSourcesContent =
+	  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+	    return aSources.map(function (source) {
+	      if (!this._sourcesContents) {
+	        return null;
+	      }
+	      if (aSourceRoot != null) {
+	        source = util.relative(aSourceRoot, source);
+	      }
+	      var key = util.toSetString(source);
+	      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+	        ? this._sourcesContents[key]
+	        : null;
+	    }, this);
+	  };
+	
+	/**
+	 * Externalize the source map.
+	 */
+	SourceMapGenerator.prototype.toJSON =
+	  function SourceMapGenerator_toJSON() {
+	    var map = {
+	      version: this._version,
+	      sources: this._sources.toArray(),
+	      names: this._names.toArray(),
+	      mappings: this._serializeMappings()
+	    };
+	    if (this._file != null) {
+	      map.file = this._file;
+	    }
+	    if (this._sourceRoot != null) {
+	      map.sourceRoot = this._sourceRoot;
+	    }
+	    if (this._sourcesContents) {
+	      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+	    }
+	
+	    return map;
+	  };
+	
+	/**
+	 * Render the source map being generated to a string.
+	 */
+	SourceMapGenerator.prototype.toString =
+	  function SourceMapGenerator_toString() {
+	    return JSON.stringify(this.toJSON());
+	  };
+	
+	exports.SourceMapGenerator = SourceMapGenerator;
+
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 *
+	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+	 *
+	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+	 * Redistribution and use in source and binary forms, with or without
+	 * modification, are permitted provided that the following conditions are
+	 * met:
+	 *
+	 *  * Redistributions of source code must retain the above copyright
+	 *    notice, this list of conditions and the following disclaimer.
+	 *  * Redistributions in binary form must reproduce the above
+	 *    copyright notice, this list of conditions and the following
+	 *    disclaimer in the documentation and/or other materials provided
+	 *    with the distribution.
+	 *  * Neither the name of Google Inc. nor the names of its
+	 *    contributors may be used to endorse or promote products derived
+	 *    from this software without specific prior written permission.
+	 *
+	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	 */
+	
+	var base64 = __webpack_require__(3);
+	
+	// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+	// length quantities we use in the source map spec, the first bit is the sign,
+	// the next four bits are the actual value, and the 6th bit is the
+	// continuation bit. The continuation bit tells us whether there are more
+	// digits in this value following this digit.
+	//
+	//   Continuation
+	//   |    Sign
+	//   |    |
+	//   V    V
+	//   101011
+	
+	var VLQ_BASE_SHIFT = 5;
+	
+	// binary: 100000
+	var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+	
+	// binary: 011111
+	var VLQ_BASE_MASK = VLQ_BASE - 1;
+	
+	// binary: 100000
+	var VLQ_CONTINUATION_BIT = VLQ_BASE;
+	
+	/**
+	 * Converts from a two-complement value to a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	 */
+	function toVLQSigned(aValue) {
+	  return aValue < 0
+	    ? ((-aValue) << 1) + 1
+	    : (aValue << 1) + 0;
+	}
+	
+	/**
+	 * Converts to a two-complement value from a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+	 *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+	 */
+	function fromVLQSigned(aValue) {
+	  var isNegative = (aValue & 1) === 1;
+	  var shifted = aValue >> 1;
+	  return isNegative
+	    ? -shifted
+	    : shifted;
+	}
+	
+	/**
+	 * Returns the base 64 VLQ encoded value.
+	 */
+	exports.encode = function base64VLQ_encode(aValue) {
+	  var encoded = "";
+	  var digit;
+	
+	  var vlq = toVLQSigned(aValue);
+	
+	  do {
+	    digit = vlq & VLQ_BASE_MASK;
+	    vlq >>>= VLQ_BASE_SHIFT;
+	    if (vlq > 0) {
+	      // There are still more digits in this value, so we must make sure the
+	      // continuation bit is marked.
+	      digit |= VLQ_CONTINUATION_BIT;
+	    }
+	    encoded += base64.encode(digit);
+	  } while (vlq > 0);
+	
+	  return encoded;
+	};
+	
+	/**
+	 * Decodes the next base 64 VLQ value from the given string and returns the
+	 * value and the rest of the string via the out parameter.
+	 */
+	exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+	  var strLen = aStr.length;
+	  var result = 0;
+	  var shift = 0;
+	  var continuation, digit;
+	
+	  do {
+	    if (aIndex >= strLen) {
+	      throw new Error("Expected more digits in base 64 VLQ value.");
+	    }
+	
+	    digit = base64.decode(aStr.charCodeAt(aIndex++));
+	    if (digit === -1) {
+	      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+	    }
+	
+	    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+	    digit &= VLQ_BASE_MASK;
+	    result = result + (digit << shift);
+	    shift += VLQ_BASE_SHIFT;
+	  } while (continuation);
+	
+	  aOutParam.value = fromVLQSigned(result);
+	  aOutParam.rest = aIndex;
+	};
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+	
+	/**
+	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+	 */
+	exports.encode = function (number) {
+	  if (0 <= number && number < intToCharMap.length) {
+	    return intToCharMap[number];
+	  }
+	  throw new TypeError("Must be between 0 and 63: " + number);
+	};
+	
+	/**
+	 * Decode a single base 64 character code digit to an integer. Returns -1 on
+	 * failure.
+	 */
+	exports.decode = function (charCode) {
+	  var bigA = 65;     // 'A'
+	  var bigZ = 90;     // 'Z'
+	
+	  var littleA = 97;  // 'a'
+	  var littleZ = 122; // 'z'
+	
+	  var zero = 48;     // '0'
+	  var nine = 57;     // '9'
+	
+	  var plus = 43;     // '+'
+	  var slash = 47;    // '/'
+	
+	  var littleOffset = 26;
+	  var numberOffset = 52;
+	
+	  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+	  if (bigA <= charCode && charCode <= bigZ) {
+	    return (charCode - bigA);
+	  }
+	
+	  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+	  if (littleA <= charCode && charCode <= littleZ) {
+	    return (charCode - littleA + littleOffset);
+	  }
+	
+	  // 52 - 61: 0123456789
+	  if (zero <= charCode && charCode <= nine) {
+	    return (charCode - zero + numberOffset);
+	  }
+	
+	  // 62: +
+	  if (charCode == plus) {
+	    return 62;
+	  }
+	
+	  // 63: /
+	  if (charCode == slash) {
+	    return 63;
+	  }
+	
+	  // Invalid base64 digit.
+	  return -1;
+	};
+
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	/**
+	 * This is a helper function for getting values from parameter/options
+	 * objects.
+	 *
+	 * @param args The object we are extracting values from
+	 * @param name The name of the property we are getting.
+	 * @param defaultValue An optional value to return if the property is missing
+	 * from the object. If this is not specified and the property is missing, an
+	 * error will be thrown.
+	 */
+	function getArg(aArgs, aName, aDefaultValue) {
+	  if (aName in aArgs) {
+	    return aArgs[aName];
+	  } else if (arguments.length === 3) {
+	    return aDefaultValue;
+	  } else {
+	    throw new Error('"' + aName + '" is a required argument.');
+	  }
+	}
+	exports.getArg = getArg;
+	
+	var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+	var dataUrlRegexp = /^data:.+\,.+$/;
+	
+	function urlParse(aUrl) {
+	  var match = aUrl.match(urlRegexp);
+	  if (!match) {
+	    return null;
+	  }
+	  return {
+	    scheme: match[1],
+	    auth: match[2],
+	    host: match[3],
+	    port: match[4],
+	    path: match[5]
+	  };
+	}
+	exports.urlParse = urlParse;
+	
+	function urlGenerate(aParsedUrl) {
+	  var url = '';
+	  if (aParsedUrl.scheme) {
+	    url += aParsedUrl.scheme + ':';
+	  }
+	  url += '//';
+	  if (aParsedUrl.auth) {
+	    url += aParsedUrl.auth + '@';
+	  }
+	  if (aParsedUrl.host) {
+	    url += aParsedUrl.host;
+	  }
+	  if (aParsedUrl.port) {
+	    url += ":" + aParsedUrl.port
+	  }
+	  if (aParsedUrl.path) {
+	    url += aParsedUrl.path;
+	  }
+	  return url;
+	}
+	exports.urlGenerate = urlGenerate;
+	
+	/**
+	 * Normalizes a path, or the path portion of a URL:
+	 *
+	 * - Replaces consecutive slashes with one slash.
+	 * - Removes unnecessary '.' parts.
+	 * - Removes unnecessary '<dir>/..' parts.
+	 *
+	 * Based on code in the Node.js 'path' core module.
+	 *
+	 * @param aPath The path or url to normalize.
+	 */
+	function normalize(aPath) {
+	  var path = aPath;
+	  var url = urlParse(aPath);
+	  if (url) {
+	    if (!url.path) {
+	      return aPath;
+	    }
+	    path = url.path;
+	  }
+	  var isAbsolute = exports.isAbsolute(path);
+	
+	  var parts = path.split(/\/+/);
+	  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+	    part = parts[i];
+	    if (part === '.') {
+	      parts.splice(i, 1);
+	    } else if (part === '..') {
+	      up++;
+	    } else if (up > 0) {
+	      if (part === '') {
+	        // The first part is blank if the path is absolute. Trying to go
+	        // above the root is a no-op. Therefore we can remove all '..' parts
+	        // directly after the root.
+	        parts.splice(i + 1, up);
+	        up = 0;
+	      } else {
+	        parts.splice(i, 2);
+	        up--;
+	      }
+	    }
+	  }
+	  path = parts.join('/');
+	
+	  if (path === '') {
+	    path = isAbsolute ? '/' : '.';
+	  }
+	
+	  if (url) {
+	    url.path = path;
+	    return urlGenerate(url);
+	  }
+	  return path;
+	}
+	exports.normalize = normalize;
+	
+	/**
+	 * Joins two paths/URLs.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be joined with the root.
+	 *
+	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+	 *   first.
+	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+	 *   is updated with the result and aRoot is returned. Otherwise the result
+	 *   is returned.
+	 *   - If aPath is absolute, the result is aPath.
+	 *   - Otherwise the two paths are joined with a slash.
+	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+	 */
+	function join(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	  if (aPath === "") {
+	    aPath = ".";
+	  }
+	  var aPathUrl = urlParse(aPath);
+	  var aRootUrl = urlParse(aRoot);
+	  if (aRootUrl) {
+	    aRoot = aRootUrl.path || '/';
+	  }
+	
+	  // `join(foo, '//www.example.org')`
+	  if (aPathUrl && !aPathUrl.scheme) {
+	    if (aRootUrl) {
+	      aPathUrl.scheme = aRootUrl.scheme;
+	    }
+	    return urlGenerate(aPathUrl);
+	  }
+	
+	  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+	    return aPath;
+	  }
+	
+	  // `join('http://', 'www.example.com')`
+	  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+	    aRootUrl.host = aPath;
+	    return urlGenerate(aRootUrl);
+	  }
+	
+	  var joined = aPath.charAt(0) === '/'
+	    ? aPath
+	    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+	
+	  if (aRootUrl) {
+	    aRootUrl.path = joined;
+	    return urlGenerate(aRootUrl);
+	  }
+	  return joined;
+	}
+	exports.join = join;
+	
+	exports.isAbsolute = function (aPath) {
+	  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+	};
+	
+	/**
+	 * Make a path relative to a URL or another path.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be made relative to aRoot.
+	 */
+	function relative(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	
+	  aRoot = aRoot.replace(/\/$/, '');
+	
+	  // It is possible for the path to be above the root. In this case, simply
+	  // checking whether the root is a prefix of the path won't work. Instead, we
+	  // need to remove components from the root one by one, until either we find
+	  // a prefix that fits, or we run out of components to remove.
+	  var level = 0;
+	  while (aPath.indexOf(aRoot + '/') !== 0) {
+	    var index = aRoot.lastIndexOf("/");
+	    if (index < 0) {
+	      return aPath;
+	    }
+	
+	    // If the only part of the root that is left is the scheme (i.e. http://,
+	    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+	    // have exhausted all components, so the path is not relative to the root.
+	    aRoot = aRoot.slice(0, index);
+	    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+	      return aPath;
+	    }
+	
+	    ++level;
+	  }
+	
+	  // Make sure we add a "../" for each component we removed from the root.
+	  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+	}
+	exports.relative = relative;
+	
+	var supportsNullProto = (function () {
+	  var obj = Object.create(null);
+	  return !('__proto__' in obj);
+	}());
+	
+	function identity (s) {
+	  return s;
+	}
+	
+	/**
+	 * Because behavior goes wacky when you set `__proto__` on objects, we
+	 * have to prefix all the strings in our set with an arbitrary character.
+	 *
+	 * See https://github.com/mozilla/source-map/pull/31 and
+	 * https://github.com/mozilla/source-map/issues/30
+	 *
+	 * @param String aStr
+	 */
+	function toSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return '$' + aStr;
+	  }
+	
+	  return aStr;
+	}
+	exports.toSetString = supportsNullProto ? identity : toSetString;
+	
+	function fromSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return aStr.slice(1);
+	  }
+	
+	  return aStr;
+	}
+	exports.fromSetString = supportsNullProto ? identity : fromSetString;
+	
+	function isProtoString(s) {
+	  if (!s) {
+	    return false;
+	  }
+	
+	  var length = s.length;
+	
+	  if (length < 9 /* "__proto__".length */) {
+	    return false;
+	  }
+	
+	  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+	      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+	      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+	      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+	    return false;
+	  }
+	
+	  for (var i = length - 10; i >= 0; i--) {
+	    if (s.charCodeAt(i) !== 36 /* '$' */) {
+	      return false;
+	    }
+	  }
+	
+	  return true;
+	}
+	
+	/**
+	 * Comparator between two mappings where the original positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same original source/line/column, but different generated
+	 * line and column the same. Useful when searching for a mapping with a
+	 * stubbed out mapping.
+	 */
+	function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+	  var cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0 || onlyCompareOriginal) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositions = compareByOriginalPositions;
+	
+	/**
+	 * Comparator between two mappings with deflated source and name indices where
+	 * the generated positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same generated line and column, but different
+	 * source/name/original line and column the same. Useful when searching for a
+	 * mapping with a stubbed out mapping.
+	 */
+	function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0 || onlyCompareGenerated) {
+	    return cmp;
+	  }
+	
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+	
+	function strcmp(aStr1, aStr2) {
+	  if (aStr1 === aStr2) {
+	    return 0;
+	  }
+	
+	  if (aStr1 === null) {
+	    return 1; // aStr2 !== null
+	  }
+	
+	  if (aStr2 === null) {
+	    return -1; // aStr1 !== null
+	  }
+	
+	  if (aStr1 > aStr2) {
+	    return 1;
+	  }
+	
+	  return -1;
+	}
+	
+	/**
+	 * Comparator between two mappings with inflated source and name strings where
+	 * the generated positions are compared.
+	 */
+	function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+	
+	/**
+	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+	 * in the source maps specification), and then parse the string as
+	 * JSON.
+	 */
+	function parseSourceMapInput(str) {
+	  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+	}
+	exports.parseSourceMapInput = parseSourceMapInput;
+	
+	/**
+	 * Compute the URL of a source given the the source root, the source's
+	 * URL, and the source map's URL.
+	 */
+	function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+	  sourceURL = sourceURL || '';
+	
+	  if (sourceRoot) {
+	    // This follows what Chrome does.
+	    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+	      sourceRoot += '/';
+	    }
+	    // The spec says:
+	    //   Line 4: An optional source root, useful for relocating source
+	    //   files on a server or removing repeated values in the
+	    //   “sources” entry.  This value is prepended to the individual
+	    //   entries in the “source” field.
+	    sourceURL = sourceRoot + sourceURL;
+	  }
+	
+	  // Historically, SourceMapConsumer did not take the sourceMapURL as
+	  // a parameter.  This mode is still somewhat supported, which is why
+	  // this code block is conditional.  However, it's preferable to pass
+	  // the source map URL to SourceMapConsumer, so that this function
+	  // can implement the source URL resolution algorithm as outlined in
+	  // the spec.  This block is basically the equivalent of:
+	  //    new URL(sourceURL, sourceMapURL).toString()
+	  // ... except it avoids using URL, which wasn't available in the
+	  // older releases of node still supported by this library.
+	  //
+	  // The spec says:
+	  //   If the sources are not absolute URLs after prepending of the
+	  //   “sourceRoot”, the sources are resolved relative to the
+	  //   SourceMap (like resolving script src in a html document).
+	  if (sourceMapURL) {
+	    var parsed = urlParse(sourceMapURL);
+	    if (!parsed) {
+	      throw new Error("sourceMapURL could not be parsed");
+	    }
+	    if (parsed.path) {
+	      // Strip the last path component, but keep the "/".
+	      var index = parsed.path.lastIndexOf('/');
+	      if (index >= 0) {
+	        parsed.path = parsed.path.substring(0, index + 1);
+	      }
+	    }
+	    sourceURL = join(urlGenerate(parsed), sourceURL);
+	  }
+	
+	  return normalize(sourceURL);
+	}
+	exports.computeSourceURL = computeSourceURL;
+
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var util = __webpack_require__(4);
+	var has = Object.prototype.hasOwnProperty;
+	var hasNativeMap = typeof Map !== "undefined";
+	
+	/**
+	 * A data structure which is a combination of an array and a set. Adding a new
+	 * member is O(1), testing for membership is O(1), and finding the index of an
+	 * element is O(1). Removing elements from the set is not supported. Only
+	 * strings are supported for membership.
+	 */
+	function ArraySet() {
+	  this._array = [];
+	  this._set = hasNativeMap ? new Map() : Object.create(null);
+	}
+	
+	/**
+	 * Static method for creating ArraySet instances from an existing array.
+	 */
+	ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+	  var set = new ArraySet();
+	  for (var i = 0, len = aArray.length; i < len; i++) {
+	    set.add(aArray[i], aAllowDuplicates);
+	  }
+	  return set;
+	};
+	
+	/**
+	 * Return how many unique items are in this ArraySet. If duplicates have been
+	 * added, than those do not count towards the size.
+	 *
+	 * @returns Number
+	 */
+	ArraySet.prototype.size = function ArraySet_size() {
+	  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+	};
+	
+	/**
+	 * Add the given string to this set.
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+	  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+	  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+	  var idx = this._array.length;
+	  if (!isDuplicate || aAllowDuplicates) {
+	    this._array.push(aStr);
+	  }
+	  if (!isDuplicate) {
+	    if (hasNativeMap) {
+	      this._set.set(aStr, idx);
+	    } else {
+	      this._set[sStr] = idx;
+	    }
+	  }
+	};
+	
+	/**
+	 * Is the given string a member of this set?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.has = function ArraySet_has(aStr) {
+	  if (hasNativeMap) {
+	    return this._set.has(aStr);
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    return has.call(this._set, sStr);
+	  }
+	};
+	
+	/**
+	 * What is the index of the given string in the array?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+	  if (hasNativeMap) {
+	    var idx = this._set.get(aStr);
+	    if (idx >= 0) {
+	        return idx;
+	    }
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    if (has.call(this._set, sStr)) {
+	      return this._set[sStr];
+	    }
+	  }
+	
+	  throw new Error('"' + aStr + '" is not in the set.');
+	};
+	
+	/**
+	 * What is the element at the given index?
+	 *
+	 * @param Number aIdx
+	 */
+	ArraySet.prototype.at = function ArraySet_at(aIdx) {
+	  if (aIdx >= 0 && aIdx < this._array.length) {
+	    return this._array[aIdx];
+	  }
+	  throw new Error('No element indexed by ' + aIdx);
+	};
+	
+	/**
+	 * Returns the array representation of this set (which has the proper indices
+	 * indicated by indexOf). Note that this is a copy of the internal array used
+	 * for storing the members so that no one can mess with internal state.
+	 */
+	ArraySet.prototype.toArray = function ArraySet_toArray() {
+	  return this._array.slice();
+	};
+	
+	exports.ArraySet = ArraySet;
+
+
+/***/ }),
+/* 6 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2014 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var util = __webpack_require__(4);
+	
+	/**
+	 * Determine whether mappingB is after mappingA with respect to generated
+	 * position.
+	 */
+	function generatedPositionAfter(mappingA, mappingB) {
+	  // Optimized for most common case
+	  var lineA = mappingA.generatedLine;
+	  var lineB = mappingB.generatedLine;
+	  var columnA = mappingA.generatedColumn;
+	  var columnB = mappingB.generatedColumn;
+	  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+	         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+	}
+	
+	/**
+	 * A data structure to provide a sorted view of accumulated mappings in a
+	 * performance conscious manner. It trades a neglibable overhead in general
+	 * case for a large speedup in case of mappings being added in order.
+	 */
+	function MappingList() {
+	  this._array = [];
+	  this._sorted = true;
+	  // Serves as infimum
+	  this._last = {generatedLine: -1, generatedColumn: 0};
+	}
+	
+	/**
+	 * Iterate through internal items. This method takes the same arguments that
+	 * `Array.prototype.forEach` takes.
+	 *
+	 * NOTE: The order of the mappings is NOT guaranteed.
+	 */
+	MappingList.prototype.unsortedForEach =
+	  function MappingList_forEach(aCallback, aThisArg) {
+	    this._array.forEach(aCallback, aThisArg);
+	  };
+	
+	/**
+	 * Add the given source mapping.
+	 *
+	 * @param Object aMapping
+	 */
+	MappingList.prototype.add = function MappingList_add(aMapping) {
+	  if (generatedPositionAfter(this._last, aMapping)) {
+	    this._last = aMapping;
+	    this._array.push(aMapping);
+	  } else {
+	    this._sorted = false;
+	    this._array.push(aMapping);
+	  }
+	};
+	
+	/**
+	 * Returns the flat, sorted array of mappings. The mappings are sorted by
+	 * generated position.
+	 *
+	 * WARNING: This method returns internal data without copying, for
+	 * performance. The return value must NOT be mutated, and should be treated as
+	 * an immutable borrow. If you want to take ownership, you must make your own
+	 * copy.
+	 */
+	MappingList.prototype.toArray = function MappingList_toArray() {
+	  if (!this._sorted) {
+	    this._array.sort(util.compareByGeneratedPositionsInflated);
+	    this._sorted = true;
+	  }
+	  return this._array;
+	};
+	
+	exports.MappingList = MappingList;
+
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var util = __webpack_require__(4);
+	var binarySearch = __webpack_require__(8);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var base64VLQ = __webpack_require__(2);
+	var quickSort = __webpack_require__(9).quickSort;
+	
+	function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+	
+	  return sourceMap.sections != null
+	    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+	    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+	}
+	
+	SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+	  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+	}
+	
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	SourceMapConsumer.prototype._version = 3;
+	
+	// `__generatedMappings` and `__originalMappings` are arrays that hold the
+	// parsed mapping coordinates from the source map's "mappings" attribute. They
+	// are lazily instantiated, accessed via the `_generatedMappings` and
+	// `_originalMappings` getters respectively, and we only parse the mappings
+	// and create these arrays once queried for a source location. We jump through
+	// these hoops because there can be many thousands of mappings, and parsing
+	// them is expensive, so we only want to do it if we must.
+	//
+	// Each object in the arrays is of the form:
+	//
+	//     {
+	//       generatedLine: The line number in the generated code,
+	//       generatedColumn: The column number in the generated code,
+	//       source: The path to the original source file that generated this
+	//               chunk of code,
+	//       originalLine: The line number in the original source that
+	//                     corresponds to this chunk of generated code,
+	//       originalColumn: The column number in the original source that
+	//                       corresponds to this chunk of generated code,
+	//       name: The name of the original symbol which generated this chunk of
+	//             code.
+	//     }
+	//
+	// All properties except for `generatedLine` and `generatedColumn` can be
+	// `null`.
+	//
+	// `_generatedMappings` is ordered by the generated positions.
+	//
+	// `_originalMappings` is ordered by the original positions.
+	
+	SourceMapConsumer.prototype.__generatedMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__generatedMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+	
+	    return this.__generatedMappings;
+	  }
+	});
+	
+	SourceMapConsumer.prototype.__originalMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__originalMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+	
+	    return this.__originalMappings;
+	  }
+	});
+	
+	SourceMapConsumer.prototype._charIsMappingSeparator =
+	  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+	    var c = aStr.charAt(index);
+	    return c === ";" || c === ",";
+	  };
+	
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	SourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    throw new Error("Subclasses must implement _parseMappings");
+	  };
+	
+	SourceMapConsumer.GENERATED_ORDER = 1;
+	SourceMapConsumer.ORIGINAL_ORDER = 2;
+	
+	SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+	SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+	
+	/**
+	 * Iterate over each mapping between an original source/line/column and a
+	 * generated line/column in this source map.
+	 *
+	 * @param Function aCallback
+	 *        The function that is called with each mapping.
+	 * @param Object aContext
+	 *        Optional. If specified, this object will be the value of `this` every
+	 *        time that `aCallback` is called.
+	 * @param aOrder
+	 *        Either `SourceMapConsumer.GENERATED_ORDER` or
+	 *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+	 *        iterate over the mappings sorted by the generated file's line/column
+	 *        order or the original's source/line/column order, respectively. Defaults to
+	 *        `SourceMapConsumer.GENERATED_ORDER`.
+	 */
+	SourceMapConsumer.prototype.eachMapping =
+	  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+	    var context = aContext || null;
+	    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+	
+	    var mappings;
+	    switch (order) {
+	    case SourceMapConsumer.GENERATED_ORDER:
+	      mappings = this._generatedMappings;
+	      break;
+	    case SourceMapConsumer.ORIGINAL_ORDER:
+	      mappings = this._originalMappings;
+	      break;
+	    default:
+	      throw new Error("Unknown order of iteration.");
+	    }
+	
+	    var sourceRoot = this.sourceRoot;
+	    mappings.map(function (mapping) {
+	      var source = mapping.source === null ? null : this._sources.at(mapping.source);
+	      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+	      return {
+	        source: source,
+	        generatedLine: mapping.generatedLine,
+	        generatedColumn: mapping.generatedColumn,
+	        originalLine: mapping.originalLine,
+	        originalColumn: mapping.originalColumn,
+	        name: mapping.name === null ? null : this._names.at(mapping.name)
+	      };
+	    }, this).forEach(aCallback, context);
+	  };
+	
+	/**
+	 * Returns all generated line and column information for the original source,
+	 * line, and column provided. If no column is provided, returns all mappings
+	 * corresponding to a either the line we are searching for or the next
+	 * closest line that has any mappings. Otherwise, returns all mappings
+	 * corresponding to the given line and either the column we are searching for
+	 * or the next closest column that has any offsets.
+	 *
+	 * The only argument is an object with the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number is 1-based.
+	 *   - column: Optional. the column number in the original source.
+	 *    The column number is 0-based.
+	 *
+	 * and an array of objects is returned, each with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *    line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *    The column number is 0-based.
+	 */
+	SourceMapConsumer.prototype.allGeneratedPositionsFor =
+	  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+	    var line = util.getArg(aArgs, 'line');
+	
+	    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+	    // returns the index of the closest mapping less than the needle. By
+	    // setting needle.originalColumn to 0, we thus find the last mapping for
+	    // the given line, provided such a mapping exists.
+	    var needle = {
+	      source: util.getArg(aArgs, 'source'),
+	      originalLine: line,
+	      originalColumn: util.getArg(aArgs, 'column', 0)
+	    };
+	
+	    needle.source = this._findSourceIndex(needle.source);
+	    if (needle.source < 0) {
+	      return [];
+	    }
+	
+	    var mappings = [];
+	
+	    var index = this._findMapping(needle,
+	                                  this._originalMappings,
+	                                  "originalLine",
+	                                  "originalColumn",
+	                                  util.compareByOriginalPositions,
+	                                  binarySearch.LEAST_UPPER_BOUND);
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+	
+	      if (aArgs.column === undefined) {
+	        var originalLine = mapping.originalLine;
+	
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we found. Since
+	        // mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we found.
+	        while (mapping && mapping.originalLine === originalLine) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+	
+	          mapping = this._originalMappings[++index];
+	        }
+	      } else {
+	        var originalColumn = mapping.originalColumn;
+	
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we were searching for.
+	        // Since mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we are searching for.
+	        while (mapping &&
+	               mapping.originalLine === line &&
+	               mapping.originalColumn == originalColumn) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+	
+	          mapping = this._originalMappings[++index];
+	        }
+	      }
+	    }
+	
+	    return mappings;
+	  };
+	
+	exports.SourceMapConsumer = SourceMapConsumer;
+	
+	/**
+	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+	 * query for information about the original file positions by giving it a file
+	 * position in the generated source.
+	 *
+	 * The first parameter is the raw source map (either as a JSON string, or
+	 * already parsed to an object). According to the spec, source maps have the
+	 * following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - sources: An array of URLs to the original source files.
+	 *   - names: An array of identifiers which can be referrenced by individual mappings.
+	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+	 *   - sourcesContent: Optional. An array of contents of the original source files.
+	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *
+	 * Here is an example source map, taken from the source map spec[0]:
+	 *
+	 *     {
+	 *       version : 3,
+	 *       file: "out.js",
+	 *       sourceRoot : "",
+	 *       sources: ["foo.js", "bar.js"],
+	 *       names: ["src", "maps", "are", "fun"],
+	 *       mappings: "AA,AB;;ABCDE;"
+	 *     }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+	 */
+	function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+	
+	  var version = util.getArg(sourceMap, 'version');
+	  var sources = util.getArg(sourceMap, 'sources');
+	  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+	  // requires the array) to play nice here.
+	  var names = util.getArg(sourceMap, 'names', []);
+	  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+	  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+	  var mappings = util.getArg(sourceMap, 'mappings');
+	  var file = util.getArg(sourceMap, 'file', null);
+	
+	  // Once again, Sass deviates from the spec and supplies the version as a
+	  // string rather than a number, so we use loose equality checking here.
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+	
+	  if (sourceRoot) {
+	    sourceRoot = util.normalize(sourceRoot);
+	  }
+	
+	  sources = sources
+	    .map(String)
+	    // Some source maps produce relative source paths like "./foo.js" instead of
+	    // "foo.js".  Normalize these first so that future comparisons will succeed.
+	    // See bugzil.la/1090768.
+	    .map(util.normalize)
+	    // Always ensure that absolute sources are internally stored relative to
+	    // the source root, if the source root is absolute. Not doing this would
+	    // be particularly problematic when the source root is a prefix of the
+	    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+	    .map(function (source) {
+	      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+	        ? util.relative(sourceRoot, source)
+	        : source;
+	    });
+	
+	  // Pass `true` below to allow duplicate names and sources. While source maps
+	  // are intended to be compressed and deduplicated, the TypeScript compiler
+	  // sometimes generates source maps with duplicates in them. See Github issue
+	  // #72 and bugzil.la/889492.
+	  this._names = ArraySet.fromArray(names.map(String), true);
+	  this._sources = ArraySet.fromArray(sources, true);
+	
+	  this._absoluteSources = this._sources.toArray().map(function (s) {
+	    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+	  });
+	
+	  this.sourceRoot = sourceRoot;
+	  this.sourcesContent = sourcesContent;
+	  this._mappings = mappings;
+	  this._sourceMapURL = aSourceMapURL;
+	  this.file = file;
+	}
+	
+	BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+	
+	/**
+	 * Utility function to find the index of a source.  Returns -1 if not
+	 * found.
+	 */
+	BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+	  var relativeSource = aSource;
+	  if (this.sourceRoot != null) {
+	    relativeSource = util.relative(this.sourceRoot, relativeSource);
+	  }
+	
+	  if (this._sources.has(relativeSource)) {
+	    return this._sources.indexOf(relativeSource);
+	  }
+	
+	  // Maybe aSource is an absolute URL as returned by |sources|.  In
+	  // this case we can't simply undo the transform.
+	  var i;
+	  for (i = 0; i < this._absoluteSources.length; ++i) {
+	    if (this._absoluteSources[i] == aSource) {
+	      return i;
+	    }
+	  }
+	
+	  return -1;
+	};
+	
+	/**
+	 * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+	 *
+	 * @param SourceMapGenerator aSourceMap
+	 *        The source map that will be consumed.
+	 * @param String aSourceMapURL
+	 *        The URL at which the source map can be found (optional)
+	 * @returns BasicSourceMapConsumer
+	 */
+	BasicSourceMapConsumer.fromSourceMap =
+	  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+	    var smc = Object.create(BasicSourceMapConsumer.prototype);
+	
+	    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);
+	    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);
+	    smc.sourceRoot = aSourceMap._sourceRoot;
+	    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),
+	                                                            smc.sourceRoot);
+	    smc.file = aSourceMap._file;
+	    smc._sourceMapURL = aSourceMapURL;
+	    smc._absoluteSources = smc._sources.toArray().map(function (s) {
+	      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+	    });
+	
+	    // Because we are modifying the entries (by converting string sources and
+	    // names to indices into the sources and names ArraySets), we have to make
+	    // a copy of the entry or else bad things happen. Shared mutable state
+	    // strikes again! See github issue #191.
+	
+	    var generatedMappings = aSourceMap._mappings.toArray().slice();
+	    var destGeneratedMappings = smc.__generatedMappings = [];
+	    var destOriginalMappings = smc.__originalMappings = [];
+	
+	    for (var i = 0, length = generatedMappings.length; i < length; i++) {
+	      var srcMapping = generatedMappings[i];
+	      var destMapping = new Mapping;
+	      destMapping.generatedLine = srcMapping.generatedLine;
+	      destMapping.generatedColumn = srcMapping.generatedColumn;
+	
+	      if (srcMapping.source) {
+	        destMapping.source = sources.indexOf(srcMapping.source);
+	        destMapping.originalLine = srcMapping.originalLine;
+	        destMapping.originalColumn = srcMapping.originalColumn;
+	
+	        if (srcMapping.name) {
+	          destMapping.name = names.indexOf(srcMapping.name);
+	        }
+	
+	        destOriginalMappings.push(destMapping);
+	      }
+	
+	      destGeneratedMappings.push(destMapping);
+	    }
+	
+	    quickSort(smc.__originalMappings, util.compareByOriginalPositions);
+	
+	    return smc;
+	  };
+	
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	BasicSourceMapConsumer.prototype._version = 3;
+	
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    return this._absoluteSources.slice();
+	  }
+	});
+	
+	/**
+	 * Provide the JIT with a nice shape / hidden class.
+	 */
+	function Mapping() {
+	  this.generatedLine = 0;
+	  this.generatedColumn = 0;
+	  this.source = null;
+	  this.originalLine = null;
+	  this.originalColumn = null;
+	  this.name = null;
+	}
+	
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	BasicSourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    var generatedLine = 1;
+	    var previousGeneratedColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousOriginalColumn = 0;
+	    var previousSource = 0;
+	    var previousName = 0;
+	    var length = aStr.length;
+	    var index = 0;
+	    var cachedSegments = {};
+	    var temp = {};
+	    var originalMappings = [];
+	    var generatedMappings = [];
+	    var mapping, str, segment, end, value;
+	
+	    while (index < length) {
+	      if (aStr.charAt(index) === ';') {
+	        generatedLine++;
+	        index++;
+	        previousGeneratedColumn = 0;
+	      }
+	      else if (aStr.charAt(index) === ',') {
+	        index++;
+	      }
+	      else {
+	        mapping = new Mapping();
+	        mapping.generatedLine = generatedLine;
+	
+	        // Because each offset is encoded relative to the previous one,
+	        // many segments often have the same encoding. We can exploit this
+	        // fact by caching the parsed variable length fields of each segment,
+	        // allowing us to avoid a second parse if we encounter the same
+	        // segment again.
+	        for (end = index; end < length; end++) {
+	          if (this._charIsMappingSeparator(aStr, end)) {
+	            break;
+	          }
+	        }
+	        str = aStr.slice(index, end);
+	
+	        segment = cachedSegments[str];
+	        if (segment) {
+	          index += str.length;
+	        } else {
+	          segment = [];
+	          while (index < end) {
+	            base64VLQ.decode(aStr, index, temp);
+	            value = temp.value;
+	            index = temp.rest;
+	            segment.push(value);
+	          }
+	
+	          if (segment.length === 2) {
+	            throw new Error('Found a source, but no line and column');
+	          }
+	
+	          if (segment.length === 3) {
+	            throw new Error('Found a source and line, but no column');
+	          }
+	
+	          cachedSegments[str] = segment;
+	        }
+	
+	        // Generated column.
+	        mapping.generatedColumn = previousGeneratedColumn + segment[0];
+	        previousGeneratedColumn = mapping.generatedColumn;
+	
+	        if (segment.length > 1) {
+	          // Original source.
+	          mapping.source = previousSource + segment[1];
+	          previousSource += segment[1];
+	
+	          // Original line.
+	          mapping.originalLine = previousOriginalLine + segment[2];
+	          previousOriginalLine = mapping.originalLine;
+	          // Lines are stored 0-based
+	          mapping.originalLine += 1;
+	
+	          // Original column.
+	          mapping.originalColumn = previousOriginalColumn + segment[3];
+	          previousOriginalColumn = mapping.originalColumn;
+	
+	          if (segment.length > 4) {
+	            // Original name.
+	            mapping.name = previousName + segment[4];
+	            previousName += segment[4];
+	          }
+	        }
+	
+	        generatedMappings.push(mapping);
+	        if (typeof mapping.originalLine === 'number') {
+	          originalMappings.push(mapping);
+	        }
+	      }
+	    }
+	
+	    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    this.__generatedMappings = generatedMappings;
+	
+	    quickSort(originalMappings, util.compareByOriginalPositions);
+	    this.__originalMappings = originalMappings;
+	  };
+	
+	/**
+	 * Find the mapping that best matches the hypothetical "needle" mapping that
+	 * we are searching for in the given "haystack" of mappings.
+	 */
+	BasicSourceMapConsumer.prototype._findMapping =
+	  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
+	                                         aColumnName, aComparator, aBias) {
+	    // To return the position we are searching for, we must first find the
+	    // mapping for the given position and then return the opposite position it
+	    // points to. Because the mappings are sorted, we can use binary search to
+	    // find the best mapping.
+	
+	    if (aNeedle[aLineName] <= 0) {
+	      throw new TypeError('Line must be greater than or equal to 1, got '
+	                          + aNeedle[aLineName]);
+	    }
+	    if (aNeedle[aColumnName] < 0) {
+	      throw new TypeError('Column must be greater than or equal to 0, got '
+	                          + aNeedle[aColumnName]);
+	    }
+	
+	    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+	  };
+	
+	/**
+	 * Compute the last column for each generated mapping. The last column is
+	 * inclusive.
+	 */
+	BasicSourceMapConsumer.prototype.computeColumnSpans =
+	  function SourceMapConsumer_computeColumnSpans() {
+	    for (var index = 0; index < this._generatedMappings.length; ++index) {
+	      var mapping = this._generatedMappings[index];
+	
+	      // Mappings do not contain a field for the last generated columnt. We
+	      // can come up with an optimistic estimate, however, by assuming that
+	      // mappings are contiguous (i.e. given two consecutive mappings, the
+	      // first mapping ends where the second one starts).
+	      if (index + 1 < this._generatedMappings.length) {
+	        var nextMapping = this._generatedMappings[index + 1];
+	
+	        if (mapping.generatedLine === nextMapping.generatedLine) {
+	          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+	          continue;
+	        }
+	      }
+	
+	      // The last mapping for each line spans the entire line.
+	      mapping.lastGeneratedColumn = Infinity;
+	    }
+	  };
+	
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	BasicSourceMapConsumer.prototype.originalPositionFor =
+	  function SourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+	
+	    var index = this._findMapping(
+	      needle,
+	      this._generatedMappings,
+	      "generatedLine",
+	      "generatedColumn",
+	      util.compareByGeneratedPositionsDeflated,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+	
+	    if (index >= 0) {
+	      var mapping = this._generatedMappings[index];
+	
+	      if (mapping.generatedLine === needle.generatedLine) {
+	        var source = util.getArg(mapping, 'source', null);
+	        if (source !== null) {
+	          source = this._sources.at(source);
+	          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+	        }
+	        var name = util.getArg(mapping, 'name', null);
+	        if (name !== null) {
+	          name = this._names.at(name);
+	        }
+	        return {
+	          source: source,
+	          line: util.getArg(mapping, 'originalLine', null),
+	          column: util.getArg(mapping, 'originalColumn', null),
+	          name: name
+	        };
+	      }
+	    }
+	
+	    return {
+	      source: null,
+	      line: null,
+	      column: null,
+	      name: null
+	    };
+	  };
+	
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	BasicSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function BasicSourceMapConsumer_hasContentsOfAllSources() {
+	    if (!this.sourcesContent) {
+	      return false;
+	    }
+	    return this.sourcesContent.length >= this._sources.size() &&
+	      !this.sourcesContent.some(function (sc) { return sc == null; });
+	  };
+	
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	BasicSourceMapConsumer.prototype.sourceContentFor =
+	  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    if (!this.sourcesContent) {
+	      return null;
+	    }
+	
+	    var index = this._findSourceIndex(aSource);
+	    if (index >= 0) {
+	      return this.sourcesContent[index];
+	    }
+	
+	    var relativeSource = aSource;
+	    if (this.sourceRoot != null) {
+	      relativeSource = util.relative(this.sourceRoot, relativeSource);
+	    }
+	
+	    var url;
+	    if (this.sourceRoot != null
+	        && (url = util.urlParse(this.sourceRoot))) {
+	      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+	      // many users. We can help them out when they expect file:// URIs to
+	      // behave like it would if they were running a local HTTP server. See
+	      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+	      var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+	      if (url.scheme == "file"
+	          && this._sources.has(fileUriAbsPath)) {
+	        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]
+	      }
+	
+	      if ((!url.path || url.path == "/")
+	          && this._sources.has("/" + relativeSource)) {
+	        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+	      }
+	    }
+	
+	    // This function is used recursively from
+	    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+	    // don't want to throw if we can't find the source - we just want to
+	    // return null, so we provide a flag to exit gracefully.
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+	    }
+	  };
+	
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	BasicSourceMapConsumer.prototype.generatedPositionFor =
+	  function SourceMapConsumer_generatedPositionFor(aArgs) {
+	    var source = util.getArg(aArgs, 'source');
+	    source = this._findSourceIndex(source);
+	    if (source < 0) {
+	      return {
+	        line: null,
+	        column: null,
+	        lastColumn: null
+	      };
+	    }
+	
+	    var needle = {
+	      source: source,
+	      originalLine: util.getArg(aArgs, 'line'),
+	      originalColumn: util.getArg(aArgs, 'column')
+	    };
+	
+	    var index = this._findMapping(
+	      needle,
+	      this._originalMappings,
+	      "originalLine",
+	      "originalColumn",
+	      util.compareByOriginalPositions,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+	
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+	
+	      if (mapping.source === needle.source) {
+	        return {
+	          line: util.getArg(mapping, 'generatedLine', null),
+	          column: util.getArg(mapping, 'generatedColumn', null),
+	          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	        };
+	      }
+	    }
+	
+	    return {
+	      line: null,
+	      column: null,
+	      lastColumn: null
+	    };
+	  };
+	
+	exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+	
+	/**
+	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+	 * we can query for information. It differs from BasicSourceMapConsumer in
+	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+	 * input.
+	 *
+	 * The first parameter is a raw source map (either as a JSON string, or already
+	 * parsed to an object). According to the spec for indexed source maps, they
+	 * have the following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *   - sections: A list of section definitions.
+	 *
+	 * Each value under the "sections" field has two fields:
+	 *   - offset: The offset into the original specified at which this section
+	 *       begins to apply, defined as an object with a "line" and "column"
+	 *       field.
+	 *   - map: A source map definition. This source map could also be indexed,
+	 *       but doesn't have to be.
+	 *
+	 * Instead of the "map" field, it's also possible to have a "url" field
+	 * specifying a URL to retrieve a source map from, but that's currently
+	 * unsupported.
+	 *
+	 * Here's an example source map, taken from the source map spec[0], but
+	 * modified to omit a section which uses the "url" field.
+	 *
+	 *  {
+	 *    version : 3,
+	 *    file: "app.js",
+	 *    sections: [{
+	 *      offset: {line:100, column:10},
+	 *      map: {
+	 *        version : 3,
+	 *        file: "section.js",
+	 *        sources: ["foo.js", "bar.js"],
+	 *        names: ["src", "maps", "are", "fun"],
+	 *        mappings: "AAAA,E;;ABCDE;"
+	 *      }
+	 *    }],
+	 *  }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+	 */
+	function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+	
+	  var version = util.getArg(sourceMap, 'version');
+	  var sections = util.getArg(sourceMap, 'sections');
+	
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+	
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+	
+	  var lastOffset = {
+	    line: -1,
+	    column: 0
+	  };
+	  this._sections = sections.map(function (s) {
+	    if (s.url) {
+	      // The url field will require support for asynchronicity.
+	      // See https://github.com/mozilla/source-map/issues/16
+	      throw new Error('Support for url field in sections not implemented.');
+	    }
+	    var offset = util.getArg(s, 'offset');
+	    var offsetLine = util.getArg(offset, 'line');
+	    var offsetColumn = util.getArg(offset, 'column');
+	
+	    if (offsetLine < lastOffset.line ||
+	        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+	      throw new Error('Section offsets must be ordered and non-overlapping.');
+	    }
+	    lastOffset = offset;
+	
+	    return {
+	      generatedOffset: {
+	        // The offset fields are 0-based, but we use 1-based indices when
+	        // encoding/decoding from VLQ.
+	        generatedLine: offsetLine + 1,
+	        generatedColumn: offsetColumn + 1
+	      },
+	      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
+	    }
+	  });
+	}
+	
+	IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+	
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	IndexedSourceMapConsumer.prototype._version = 3;
+	
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    var sources = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {
+	        sources.push(this._sections[i].consumer.sources[j]);
+	      }
+	    }
+	    return sources;
+	  }
+	});
+	
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	IndexedSourceMapConsumer.prototype.originalPositionFor =
+	  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+	
+	    // Find the section containing the generated position we're trying to map
+	    // to an original position.
+	    var sectionIndex = binarySearch.search(needle, this._sections,
+	      function(needle, section) {
+	        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+	        if (cmp) {
+	          return cmp;
+	        }
+	
+	        return (needle.generatedColumn -
+	                section.generatedOffset.generatedColumn);
+	      });
+	    var section = this._sections[sectionIndex];
+	
+	    if (!section) {
+	      return {
+	        source: null,
+	        line: null,
+	        column: null,
+	        name: null
+	      };
+	    }
+	
+	    return section.consumer.originalPositionFor({
+	      line: needle.generatedLine -
+	        (section.generatedOffset.generatedLine - 1),
+	      column: needle.generatedColumn -
+	        (section.generatedOffset.generatedLine === needle.generatedLine
+	         ? section.generatedOffset.generatedColumn - 1
+	         : 0),
+	      bias: aArgs.bias
+	    });
+	  };
+	
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	IndexedSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+	    return this._sections.every(function (s) {
+	      return s.consumer.hasContentsOfAllSources();
+	    });
+	  };
+	
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	IndexedSourceMapConsumer.prototype.sourceContentFor =
+	  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	
+	      var content = section.consumer.sourceContentFor(aSource, true);
+	      if (content) {
+	        return content;
+	      }
+	    }
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + aSource + '" is not in the SourceMap.');
+	    }
+	  };
+	
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based. 
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	IndexedSourceMapConsumer.prototype.generatedPositionFor =
+	  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	
+	      // Only consider this section if the requested source is in the list of
+	      // sources of the consumer.
+	      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
+	        continue;
+	      }
+	      var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+	      if (generatedPosition) {
+	        var ret = {
+	          line: generatedPosition.line +
+	            (section.generatedOffset.generatedLine - 1),
+	          column: generatedPosition.column +
+	            (section.generatedOffset.generatedLine === generatedPosition.line
+	             ? section.generatedOffset.generatedColumn - 1
+	             : 0)
+	        };
+	        return ret;
+	      }
+	    }
+	
+	    return {
+	      line: null,
+	      column: null
+	    };
+	  };
+	
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	IndexedSourceMapConsumer.prototype._parseMappings =
+	  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    this.__generatedMappings = [];
+	    this.__originalMappings = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	      var sectionMappings = section.consumer._generatedMappings;
+	      for (var j = 0; j < sectionMappings.length; j++) {
+	        var mapping = sectionMappings[j];
+	
+	        var source = section.consumer._sources.at(mapping.source);
+	        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+	        this._sources.add(source);
+	        source = this._sources.indexOf(source);
+	
+	        var name = null;
+	        if (mapping.name) {
+	          name = section.consumer._names.at(mapping.name);
+	          this._names.add(name);
+	          name = this._names.indexOf(name);
+	        }
+	
+	        // The mappings coming from the consumer for the section have
+	        // generated positions relative to the start of the section, so we
+	        // need to offset them to be relative to the start of the concatenated
+	        // generated file.
+	        var adjustedMapping = {
+	          source: source,
+	          generatedLine: mapping.generatedLine +
+	            (section.generatedOffset.generatedLine - 1),
+	          generatedColumn: mapping.generatedColumn +
+	            (section.generatedOffset.generatedLine === mapping.generatedLine
+	            ? section.generatedOffset.generatedColumn - 1
+	            : 0),
+	          originalLine: mapping.originalLine,
+	          originalColumn: mapping.originalColumn,
+	          name: name
+	        };
+	
+	        this.__generatedMappings.push(adjustedMapping);
+	        if (typeof adjustedMapping.originalLine === 'number') {
+	          this.__originalMappings.push(adjustedMapping);
+	        }
+	      }
+	    }
+	
+	    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    quickSort(this.__originalMappings, util.compareByOriginalPositions);
+	  };
+	
+	exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+
+/***/ }),
+/* 8 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	exports.GREATEST_LOWER_BOUND = 1;
+	exports.LEAST_UPPER_BOUND = 2;
+	
+	/**
+	 * Recursive implementation of binary search.
+	 *
+	 * @param aLow Indices here and lower do not contain the needle.
+	 * @param aHigh Indices here and higher do not contain the needle.
+	 * @param aNeedle The element being searched for.
+	 * @param aHaystack The non-empty array being searched.
+	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 */
+	function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+	  // This function terminates when one of the following is true:
+	  //
+	  //   1. We find the exact element we are looking for.
+	  //
+	  //   2. We did not find the exact element, but we can return the index of
+	  //      the next-closest element.
+	  //
+	  //   3. We did not find the exact element, and there is no next-closest
+	  //      element than the one we are searching for, so we return -1.
+	  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+	  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+	  if (cmp === 0) {
+	    // Found the element we are looking for.
+	    return mid;
+	  }
+	  else if (cmp > 0) {
+	    // Our needle is greater than aHaystack[mid].
+	    if (aHigh - mid > 1) {
+	      // The element is in the upper half.
+	      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+	    }
+	
+	    // The exact needle element was not found in this haystack. Determine if
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return aHigh < aHaystack.length ? aHigh : -1;
+	    } else {
+	      return mid;
+	    }
+	  }
+	  else {
+	    // Our needle is less than aHaystack[mid].
+	    if (mid - aLow > 1) {
+	      // The element is in the lower half.
+	      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+	    }
+	
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return mid;
+	    } else {
+	      return aLow < 0 ? -1 : aLow;
+	    }
+	  }
+	}
+	
+	/**
+	 * This is an implementation of binary search which will always try and return
+	 * the index of the closest element if there is no exact hit. This is because
+	 * mappings between original and generated line/col pairs are single points,
+	 * and there is an implicit region between each of them, so a miss just means
+	 * that you aren't on the very start of a region.
+	 *
+	 * @param aNeedle The element you are looking for.
+	 * @param aHaystack The array that is being searched.
+	 * @param aCompare A function which takes the needle and an element in the
+	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+	 *     than, equal to, or greater than the element, respectively.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+	 */
+	exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+	  if (aHaystack.length === 0) {
+	    return -1;
+	  }
+	
+	  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+	                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+	  if (index < 0) {
+	    return -1;
+	  }
+	
+	  // We have found either the exact element, or the next-closest element than
+	  // the one we are searching for. However, there may be more than one such
+	  // element. Make sure we always return the smallest of these.
+	  while (index - 1 >= 0) {
+	    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+	      break;
+	    }
+	    --index;
+	  }
+	
+	  return index;
+	};
+
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	// It turns out that some (most?) JavaScript engines don't self-host
+	// `Array.prototype.sort`. This makes sense because C++ will likely remain
+	// faster than JS when doing raw CPU-intensive sorting. However, when using a
+	// custom comparator function, calling back and forth between the VM's C++ and
+	// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+	// worse generated code for the comparator function than would be optimal. In
+	// fact, when sorting with a comparator, these costs outweigh the benefits of
+	// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+	// a ~3500ms mean speed-up in `bench/bench.html`.
+	
+	/**
+	 * Swap the elements indexed by `x` and `y` in the array `ary`.
+	 *
+	 * @param {Array} ary
+	 *        The array.
+	 * @param {Number} x
+	 *        The index of the first item.
+	 * @param {Number} y
+	 *        The index of the second item.
+	 */
+	function swap(ary, x, y) {
+	  var temp = ary[x];
+	  ary[x] = ary[y];
+	  ary[y] = temp;
+	}
+	
+	/**
+	 * Returns a random integer within the range `low .. high` inclusive.
+	 *
+	 * @param {Number} low
+	 *        The lower bound on the range.
+	 * @param {Number} high
+	 *        The upper bound on the range.
+	 */
+	function randomIntInRange(low, high) {
+	  return Math.round(low + (Math.random() * (high - low)));
+	}
+	
+	/**
+	 * The Quick Sort algorithm.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 * @param {Number} p
+	 *        Start index of the array
+	 * @param {Number} r
+	 *        End index of the array
+	 */
+	function doQuickSort(ary, comparator, p, r) {
+	  // If our lower bound is less than our upper bound, we (1) partition the
+	  // array into two pieces and (2) recurse on each half. If it is not, this is
+	  // the empty array and our base case.
+	
+	  if (p < r) {
+	    // (1) Partitioning.
+	    //
+	    // The partitioning chooses a pivot between `p` and `r` and moves all
+	    // elements that are less than or equal to the pivot to the before it, and
+	    // all the elements that are greater than it after it. The effect is that
+	    // once partition is done, the pivot is in the exact place it will be when
+	    // the array is put in sorted order, and it will not need to be moved
+	    // again. This runs in O(n) time.
+	
+	    // Always choose a random pivot so that an input array which is reverse
+	    // sorted does not cause O(n^2) running time.
+	    var pivotIndex = randomIntInRange(p, r);
+	    var i = p - 1;
+	
+	    swap(ary, pivotIndex, r);
+	    var pivot = ary[r];
+	
+	    // Immediately after `j` is incremented in this loop, the following hold
+	    // true:
+	    //
+	    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+	    //
+	    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+	    for (var j = p; j < r; j++) {
+	      if (comparator(ary[j], pivot) <= 0) {
+	        i += 1;
+	        swap(ary, i, j);
+	      }
+	    }
+	
+	    swap(ary, i + 1, j);
+	    var q = i + 1;
+	
+	    // (2) Recurse on each half.
+	
+	    doQuickSort(ary, comparator, p, q - 1);
+	    doQuickSort(ary, comparator, q + 1, r);
+	  }
+	}
+	
+	/**
+	 * Sort the given array in-place with the given comparator function.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 */
+	exports.quickSort = function (ary, comparator) {
+	  doQuickSort(ary, comparator, 0, ary.length - 1);
+	};
+
+
+/***/ }),
+/* 10 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	var util = __webpack_require__(4);
+	
+	// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+	// operating systems these days (capturing the result).
+	var REGEX_NEWLINE = /(\r?\n)/;
+	
+	// Newline character code for charCodeAt() comparisons
+	var NEWLINE_CODE = 10;
+	
+	// Private symbol for identifying `SourceNode`s when multiple versions of
+	// the source-map library are loaded. This MUST NOT CHANGE across
+	// versions!
+	var isSourceNode = "$$$isSourceNode$$$";
+	
+	/**
+	 * SourceNodes provide a way to abstract over interpolating/concatenating
+	 * snippets of generated JavaScript source code while maintaining the line and
+	 * column information associated with the original source code.
+	 *
+	 * @param aLine The original line number.
+	 * @param aColumn The original column number.
+	 * @param aSource The original source's filename.
+	 * @param aChunks Optional. An array of strings which are snippets of
+	 *        generated JS, or other SourceNodes.
+	 * @param aName The original identifier.
+	 */
+	function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+	  this.children = [];
+	  this.sourceContents = {};
+	  this.line = aLine == null ? null : aLine;
+	  this.column = aColumn == null ? null : aColumn;
+	  this.source = aSource == null ? null : aSource;
+	  this.name = aName == null ? null : aName;
+	  this[isSourceNode] = true;
+	  if (aChunks != null) this.add(aChunks);
+	}
+	
+	/**
+	 * Creates a SourceNode from generated code and a SourceMapConsumer.
+	 *
+	 * @param aGeneratedCode The generated code
+	 * @param aSourceMapConsumer The SourceMap for the generated code
+	 * @param aRelativePath Optional. The path that relative sources in the
+	 *        SourceMapConsumer should be relative to.
+	 */
+	SourceNode.fromStringWithSourceMap =
+	  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+	    // The SourceNode we want to fill with the generated code
+	    // and the SourceMap
+	    var node = new SourceNode();
+	
+	    // All even indices of this array are one line of the generated code,
+	    // while all odd indices are the newlines between two adjacent lines
+	    // (since `REGEX_NEWLINE` captures its match).
+	    // Processed fragments are accessed by calling `shiftNextLine`.
+	    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+	    var remainingLinesIndex = 0;
+	    var shiftNextLine = function() {
+	      var lineContents = getNextLine();
+	      // The last line of a file might not have a newline.
+	      var newLine = getNextLine() || "";
+	      return lineContents + newLine;
+	
+	      function getNextLine() {
+	        return remainingLinesIndex < remainingLines.length ?
+	            remainingLines[remainingLinesIndex++] : undefined;
+	      }
+	    };
+	
+	    // We need to remember the position of "remainingLines"
+	    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+	
+	    // The generate SourceNodes we need a code range.
+	    // To extract it current and last mapping is used.
+	    // Here we store the last mapping.
+	    var lastMapping = null;
+	
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      if (lastMapping !== null) {
+	        // We add the code from "lastMapping" to "mapping":
+	        // First check if there is a new line in between.
+	        if (lastGeneratedLine < mapping.generatedLine) {
+	          // Associate first line with "lastMapping"
+	          addMappingWithCode(lastMapping, shiftNextLine());
+	          lastGeneratedLine++;
+	          lastGeneratedColumn = 0;
+	          // The remaining code is added without mapping
+	        } else {
+	          // There is no new line in between.
+	          // Associate the code between "lastGeneratedColumn" and
+	          // "mapping.generatedColumn" with "lastMapping"
+	          var nextLine = remainingLines[remainingLinesIndex] || '';
+	          var code = nextLine.substr(0, mapping.generatedColumn -
+	                                        lastGeneratedColumn);
+	          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+	                                              lastGeneratedColumn);
+	          lastGeneratedColumn = mapping.generatedColumn;
+	          addMappingWithCode(lastMapping, code);
+	          // No more remaining code, continue
+	          lastMapping = mapping;
+	          return;
+	        }
+	      }
+	      // We add the generated code until the first mapping
+	      // to the SourceNode without any mapping.
+	      // Each line is added as separate string.
+	      while (lastGeneratedLine < mapping.generatedLine) {
+	        node.add(shiftNextLine());
+	        lastGeneratedLine++;
+	      }
+	      if (lastGeneratedColumn < mapping.generatedColumn) {
+	        var nextLine = remainingLines[remainingLinesIndex] || '';
+	        node.add(nextLine.substr(0, mapping.generatedColumn));
+	        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+	        lastGeneratedColumn = mapping.generatedColumn;
+	      }
+	      lastMapping = mapping;
+	    }, this);
+	    // We have processed all mappings.
+	    if (remainingLinesIndex < remainingLines.length) {
+	      if (lastMapping) {
+	        // Associate the remaining code in the current line with "lastMapping"
+	        addMappingWithCode(lastMapping, shiftNextLine());
+	      }
+	      // and add the remaining lines without any mapping
+	      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+	    }
+	
+	    // Copy sourcesContent into SourceNode
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aRelativePath != null) {
+	          sourceFile = util.join(aRelativePath, sourceFile);
+	        }
+	        node.setSourceContent(sourceFile, content);
+	      }
+	    });
+	
+	    return node;
+	
+	    function addMappingWithCode(mapping, code) {
+	      if (mapping === null || mapping.source === undefined) {
+	        node.add(code);
+	      } else {
+	        var source = aRelativePath
+	          ? util.join(aRelativePath, mapping.source)
+	          : mapping.source;
+	        node.add(new SourceNode(mapping.originalLine,
+	                                mapping.originalColumn,
+	                                source,
+	                                code,
+	                                mapping.name));
+	      }
+	    }
+	  };
+	
+	/**
+	 * Add a chunk of generated JS to this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.add = function SourceNode_add(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    aChunk.forEach(function (chunk) {
+	      this.add(chunk);
+	    }, this);
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    if (aChunk) {
+	      this.children.push(aChunk);
+	    }
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Add a chunk of generated JS to the beginning of this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    for (var i = aChunk.length-1; i >= 0; i--) {
+	      this.prepend(aChunk[i]);
+	    }
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    this.children.unshift(aChunk);
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Walk over the tree of JS snippets in this node and its children. The
+	 * walking function is called once for each snippet of JS and is passed that
+	 * snippet and the its original associated source's line/column location.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+	  var chunk;
+	  for (var i = 0, len = this.children.length; i < len; i++) {
+	    chunk = this.children[i];
+	    if (chunk[isSourceNode]) {
+	      chunk.walk(aFn);
+	    }
+	    else {
+	      if (chunk !== '') {
+	        aFn(chunk, { source: this.source,
+	                     line: this.line,
+	                     column: this.column,
+	                     name: this.name });
+	      }
+	    }
+	  }
+	};
+	
+	/**
+	 * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+	 * each of `this.children`.
+	 *
+	 * @param aSep The separator.
+	 */
+	SourceNode.prototype.join = function SourceNode_join(aSep) {
+	  var newChildren;
+	  var i;
+	  var len = this.children.length;
+	  if (len > 0) {
+	    newChildren = [];
+	    for (i = 0; i < len-1; i++) {
+	      newChildren.push(this.children[i]);
+	      newChildren.push(aSep);
+	    }
+	    newChildren.push(this.children[i]);
+	    this.children = newChildren;
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Call String.prototype.replace on the very right-most source snippet. Useful
+	 * for trimming whitespace from the end of a source node, etc.
+	 *
+	 * @param aPattern The pattern to replace.
+	 * @param aReplacement The thing to replace the pattern with.
+	 */
+	SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+	  var lastChild = this.children[this.children.length - 1];
+	  if (lastChild[isSourceNode]) {
+	    lastChild.replaceRight(aPattern, aReplacement);
+	  }
+	  else if (typeof lastChild === 'string') {
+	    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+	  }
+	  else {
+	    this.children.push(''.replace(aPattern, aReplacement));
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Set the source content for a source file. This will be added to the SourceMapGenerator
+	 * in the sourcesContent field.
+	 *
+	 * @param aSourceFile The filename of the source file
+	 * @param aSourceContent The content of the source file
+	 */
+	SourceNode.prototype.setSourceContent =
+	  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+	    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+	  };
+	
+	/**
+	 * Walk over the tree of SourceNodes. The walking function is called for each
+	 * source file content and is passed the filename and source content.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walkSourceContents =
+	  function SourceNode_walkSourceContents(aFn) {
+	    for (var i = 0, len = this.children.length; i < len; i++) {
+	      if (this.children[i][isSourceNode]) {
+	        this.children[i].walkSourceContents(aFn);
+	      }
+	    }
+	
+	    var sources = Object.keys(this.sourceContents);
+	    for (var i = 0, len = sources.length; i < len; i++) {
+	      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+	    }
+	  };
+	
+	/**
+	 * Return the string representation of this source node. Walks over the tree
+	 * and concatenates all the various snippets together to one string.
+	 */
+	SourceNode.prototype.toString = function SourceNode_toString() {
+	  var str = "";
+	  this.walk(function (chunk) {
+	    str += chunk;
+	  });
+	  return str;
+	};
+	
+	/**
+	 * Returns the string representation of this source node along with a source
+	 * map.
+	 */
+	SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+	  var generated = {
+	    code: "",
+	    line: 1,
+	    column: 0
+	  };
+	  var map = new SourceMapGenerator(aArgs);
+	  var sourceMappingActive = false;
+	  var lastOriginalSource = null;
+	  var lastOriginalLine = null;
+	  var lastOriginalColumn = null;
+	  var lastOriginalName = null;
+	  this.walk(function (chunk, original) {
+	    generated.code += chunk;
+	    if (original.source !== null
+	        && original.line !== null
+	        && original.column !== null) {
+	      if(lastOriginalSource !== original.source
+	         || lastOriginalLine !== original.line
+	         || lastOriginalColumn !== original.column
+	         || lastOriginalName !== original.name) {
+	        map.addMapping({
+	          source: original.source,
+	          original: {
+	            line: original.line,
+	            column: original.column
+	          },
+	          generated: {
+	            line: generated.line,
+	            column: generated.column
+	          },
+	          name: original.name
+	        });
+	      }
+	      lastOriginalSource = original.source;
+	      lastOriginalLine = original.line;
+	      lastOriginalColumn = original.column;
+	      lastOriginalName = original.name;
+	      sourceMappingActive = true;
+	    } else if (sourceMappingActive) {
+	      map.addMapping({
+	        generated: {
+	          line: generated.line,
+	          column: generated.column
+	        }
+	      });
+	      lastOriginalSource = null;
+	      sourceMappingActive = false;
+	    }
+	    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+	      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+	        generated.line++;
+	        generated.column = 0;
+	        // Mappings end at eol
+	        if (idx + 1 === length) {
+	          lastOriginalSource = null;
+	          sourceMappingActive = false;
+	        } else if (sourceMappingActive) {
+	          map.addMapping({
+	            source: original.source,
+	            original: {
+	              line: original.line,
+	              column: original.column
+	            },
+	            generated: {
+	              line: generated.line,
+	              column: generated.column
+	            },
+	            name: original.name
+	          });
+	        }
+	      } else {
+	        generated.column++;
+	      }
+	    }
+	  });
+	  this.walkSourceContents(function (sourceFile, sourceContent) {
+	    map.setSourceContent(sourceFile, sourceContent);
+	  });
+	
+	  return { code: generated.code, map: map };
+	};
+	
+	exports.SourceNode = SourceNode;
+
+
+/***/ })
+/******/ ])
+});
+;
+//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///webpack/bootstrap 1624c7299b887f7bdf64","webpack:///./source-map.js","webpack:///./lib/source-map-generator.js","webpack:///./lib/base64-vlq.js","webpack:///./lib/base64.js","webpack:///./lib/util.js","webpack:///./lib/array-set.js","webpack:///./lib/mapping-list.js","webpack:///./lib/source-map-consumer.js","webpack:///./lib/binary-search.js","webpack:///./lib/quick-sort.js","webpack:///./lib/source-node.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,O;ACVA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,uBAAe;AACf;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;ACtCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACPA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,MAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA0C,SAAS;AACnD;AACA;;AAEA;AACA;AACA;AACA,qBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;ACxaA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4DAA2D;AAC3D,qBAAoB;AACpB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;;AAEH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAG;;AAEH;AACA;AACA;;;;;;;AC3IA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,iBAAgB;AAChB,iBAAgB;;AAEhB,oBAAmB;AACnB,qBAAoB;;AAEpB,iBAAgB;AAChB,iBAAgB;;AAEhB,iBAAgB;AAChB,kBAAiB;;AAEjB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;AClEA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA,IAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA8C,QAAQ;AACtD;AACA;AACA;AACA,MAAK;AACL;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,4BAA2B,QAAQ;AACnC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,cAAa;AACb;;AAEA;AACA,eAAc;AACd;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAsC;AACtC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;ACveA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,uCAAsC,SAAS;AAC/C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;ACxHA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAgB;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;AC9EA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA,oBAAmB;AACnB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAW;;AAEX;AACA;AACA,QAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAW;;AAEX;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA2B,MAAM;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAa,kCAAkC;AAC/C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,uDAAsD,YAAY;AAClE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAmC;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,0BAAyB,cAAc;AACvC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAuB,wCAAwC;AAC/D;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAA+C,mBAAmB,EAAE;AACpE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;AACA;AACA,8BAA6B,MAAM;AACnC;AACA,QAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA,IAAG;AACH;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C,sBAAqB,+CAA+C;AACpE;AACA;AACA;AACA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C;AACA;AACA,sBAAqB,4BAA4B;AACjD;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;ACxnCA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;AC9GA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,MAAM;AACjB;AACA,YAAW,OAAO;AAClB;AACA,YAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,OAAO;AAClB;AACA,YAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,MAAM;AACjB;AACA,YAAW,SAAS;AACpB;AACA,YAAW,OAAO;AAClB;AACA,YAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,OAAO;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,MAAM;AACjB;AACA,YAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;;;;;;;ACjHA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;;AAEL;;AAEA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAiC,QAAQ;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA6C,SAAS;AACtD;AACA;AACA;AACA;AACA;AACA;AACA,qBAAoB;AACpB;AACA;AACA,uCAAsC;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAe,WAAW;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAA+C,SAAS;AACxD;AACA;AACA;AACA;;AAEA;AACA,0CAAyC,SAAS;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAW;AACX;AACA;AACA;AACA,YAAW;AACX;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA;AACA,6CAA4C,cAAc;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA,cAAa;AACb;AACA;AACA;AACA,cAAa;AACb;AACA,YAAW;AACX;AACA,QAAO;AACP;AACA;AACA;AACA,IAAG;AACH;AACA;AACA,IAAG;;AAEH,WAAU;AACV;;AAEA","file":"source-map.debug.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"sourceMap\"] = factory();\n\telse\n\t\troot[\"sourceMap\"] = factory();\n})(this, function() {\nreturn \n\n\n// WEBPACK FOOTER //\n// webpack/universalModuleDefinition"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId])\n \t\t\treturn installedModules[moduleId].exports;\n\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\texports: {},\n \t\t\tid: moduleId,\n \t\t\tloaded: false\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.loaded = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(0);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap 1624c7299b887f7bdf64","/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./source-map.js\n// module id = 0\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n *   - file: The filename of the generated source.\n *   - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n  if (!aArgs) {\n    aArgs = {};\n  }\n  this._file = util.getArg(aArgs, 'file', null);\n  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n  this._mappings = new MappingList();\n  this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n    var sourceRoot = aSourceMapConsumer.sourceRoot;\n    var generator = new SourceMapGenerator({\n      file: aSourceMapConsumer.file,\n      sourceRoot: sourceRoot\n    });\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      var newMapping = {\n        generated: {\n          line: mapping.generatedLine,\n          column: mapping.generatedColumn\n        }\n      };\n\n      if (mapping.source != null) {\n        newMapping.source = mapping.source;\n        if (sourceRoot != null) {\n          newMapping.source = util.relative(sourceRoot, newMapping.source);\n        }\n\n        newMapping.original = {\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        };\n\n        if (mapping.name != null) {\n          newMapping.name = mapping.name;\n        }\n      }\n\n      generator.addMapping(newMapping);\n    });\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var sourceRelative = sourceFile;\n      if (sourceRoot !== null) {\n        sourceRelative = util.relative(sourceRoot, sourceFile);\n      }\n\n      if (!generator._sources.has(sourceRelative)) {\n        generator._sources.add(sourceRelative);\n      }\n\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        generator.setSourceContent(sourceFile, content);\n      }\n    });\n    return generator;\n  };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n *   - generated: An object with the generated line and column positions.\n *   - original: An object with the original line and column positions.\n *   - source: The original source file (relative to the sourceRoot).\n *   - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\n    var generated = util.getArg(aArgs, 'generated');\n    var original = util.getArg(aArgs, 'original', null);\n    var source = util.getArg(aArgs, 'source', null);\n    var name = util.getArg(aArgs, 'name', null);\n\n    if (!this._skipValidation) {\n      this._validateMapping(generated, original, source, name);\n    }\n\n    if (source != null) {\n      source = String(source);\n      if (!this._sources.has(source)) {\n        this._sources.add(source);\n      }\n    }\n\n    if (name != null) {\n      name = String(name);\n      if (!this._names.has(name)) {\n        this._names.add(name);\n      }\n    }\n\n    this._mappings.add({\n      generatedLine: generated.line,\n      generatedColumn: generated.column,\n      originalLine: original != null && original.line,\n      originalColumn: original != null && original.column,\n      source: source,\n      name: name\n    });\n  };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n    var source = aSourceFile;\n    if (this._sourceRoot != null) {\n      source = util.relative(this._sourceRoot, source);\n    }\n\n    if (aSourceContent != null) {\n      // Add the source content to the _sourcesContents map.\n      // Create a new _sourcesContents map if the property is null.\n      if (!this._sourcesContents) {\n        this._sourcesContents = Object.create(null);\n      }\n      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n    } else if (this._sourcesContents) {\n      // Remove the source file from the _sourcesContents map.\n      // If the _sourcesContents map is empty, set the property to null.\n      delete this._sourcesContents[util.toSetString(source)];\n      if (Object.keys(this._sourcesContents).length === 0) {\n        this._sourcesContents = null;\n      }\n    }\n  };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n *        If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n *        to be applied. If relative, it is relative to the SourceMapConsumer.\n *        This parameter is needed when the two source maps aren't in the same\n *        directory, and the source map to be applied contains relative source\n *        paths. If so, those relative source paths need to be rewritten\n *        relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n    var sourceFile = aSourceFile;\n    // If aSourceFile is omitted, we will use the file property of the SourceMap\n    if (aSourceFile == null) {\n      if (aSourceMapConsumer.file == null) {\n        throw new Error(\n          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n          'or the source map\\'s \"file\" property. Both were omitted.'\n        );\n      }\n      sourceFile = aSourceMapConsumer.file;\n    }\n    var sourceRoot = this._sourceRoot;\n    // Make \"sourceFile\" relative if an absolute Url is passed.\n    if (sourceRoot != null) {\n      sourceFile = util.relative(sourceRoot, sourceFile);\n    }\n    // Applying the SourceMap can add and remove items from the sources and\n    // the names array.\n    var newSources = new ArraySet();\n    var newNames = new ArraySet();\n\n    // Find mappings for the \"sourceFile\"\n    this._mappings.unsortedForEach(function (mapping) {\n      if (mapping.source === sourceFile && mapping.originalLine != null) {\n        // Check if it can be mapped by the source map, then update the mapping.\n        var original = aSourceMapConsumer.originalPositionFor({\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        });\n        if (original.source != null) {\n          // Copy mapping\n          mapping.source = original.source;\n          if (aSourceMapPath != null) {\n            mapping.source = util.join(aSourceMapPath, mapping.source)\n          }\n          if (sourceRoot != null) {\n            mapping.source = util.relative(sourceRoot, mapping.source);\n          }\n          mapping.originalLine = original.line;\n          mapping.originalColumn = original.column;\n          if (original.name != null) {\n            mapping.name = original.name;\n          }\n        }\n      }\n\n      var source = mapping.source;\n      if (source != null && !newSources.has(source)) {\n        newSources.add(source);\n      }\n\n      var name = mapping.name;\n      if (name != null && !newNames.has(name)) {\n        newNames.add(name);\n      }\n\n    }, this);\n    this._sources = newSources;\n    this._names = newNames;\n\n    // Copy sourcesContents of applied map.\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aSourceMapPath != null) {\n          sourceFile = util.join(aSourceMapPath, sourceFile);\n        }\n        if (sourceRoot != null) {\n          sourceFile = util.relative(sourceRoot, sourceFile);\n        }\n        this.setSourceContent(sourceFile, content);\n      }\n    }, this);\n  };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n *   1. Just the generated position.\n *   2. The Generated position, original position, and original source.\n *   3. Generated and original position, original source, as well as a name\n *      token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\n    // When aOriginal is truthy but has empty values for .line and .column,\n    // it is most likely a programmer error. In this case we throw a very\n    // specific error message to try to guide them the right way.\n    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n        throw new Error(\n            'original.line and original.column are not numbers -- you probably meant to omit ' +\n            'the original mapping entirely and only map the generated position. If so, pass ' +\n            'null for the original mapping instead of an object with empty or null values.'\n        );\n    }\n\n    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\n      }));\n    }\n  };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n  function SourceMapGenerator_serializeMappings() {\n    var previousGeneratedColumn = 0;\n    var previousGeneratedLine = 1;\n    var previousOriginalColumn = 0;\n    var previousOriginalLine = 0;\n    var previousName = 0;\n    var previousSource = 0;\n    var result = '';\n    var next;\n    var mapping;\n    var nameIdx;\n    var sourceIdx;\n\n    var mappings = this._mappings.toArray();\n    for (var i = 0, len = mappings.length; i < len; i++) {\n      mapping = mappings[i];\n      next = ''\n\n      if (mapping.generatedLine !== previousGeneratedLine) {\n        previousGeneratedColumn = 0;\n        while (mapping.generatedLine !== previousGeneratedLine) {\n          next += ';';\n          previousGeneratedLine++;\n        }\n      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\n      previousGeneratedColumn = mapping.generatedColumn;\n\n      if (mapping.source != null) {\n        sourceIdx = this._sources.indexOf(mapping.source);\n        next += base64VLQ.encode(sourceIdx - previousSource);\n        previousSource = sourceIdx;\n\n        // lines are stored 0-based in SourceMap spec version 3\n        next += base64VLQ.encode(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\n        previousOriginalColumn = mapping.originalColumn;\n\n        if (mapping.name != null) {\n          nameIdx = this._names.indexOf(mapping.name);\n          next += base64VLQ.encode(nameIdx - previousName);\n          previousName = nameIdx;\n        }\n      }\n\n      result += next;\n    }\n\n    return result;\n  };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n    return aSources.map(function (source) {\n      if (!this._sourcesContents) {\n        return null;\n      }\n      if (aSourceRoot != null) {\n        source = util.relative(aSourceRoot, source);\n      }\n      var key = util.toSetString(source);\n      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  function SourceMapGenerator_toJSON() {\n    var map = {\n      version: this._version,\n      sources: this._sources.toArray(),\n      names: this._names.toArray(),\n      mappings: this._serializeMappings()\n    };\n    if (this._file != null) {\n      map.file = this._file;\n    }\n    if (this._sourceRoot != null) {\n      map.sourceRoot = this._sourceRoot;\n    }\n    if (this._sourcesContents) {\n      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-generator.js\n// module id = 1\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *  * Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n *  * Redistributions in binary form must reproduce the above\n *    copyright notice, this list of conditions and the following\n *    disclaimer in the documentation and/or other materials provided\n *    with the distribution.\n *  * Neither the name of Google Inc. nor the names of its\n *    contributors may be used to endorse or promote products derived\n *    from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = require('./base64');\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n//   Continuation\n//   |    Sign\n//   |    |\n//   V    V\n//   101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n  return aValue < 0\n    ? ((-aValue) << 1) + 1\n    : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n  var isNegative = (aValue & 1) === 1;\n  var shifted = aValue >> 1;\n  return isNegative\n    ? -shifted\n    : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n  var encoded = \"\";\n  var digit;\n\n  var vlq = toVLQSigned(aValue);\n\n  do {\n    digit = vlq & VLQ_BASE_MASK;\n    vlq >>>= VLQ_BASE_SHIFT;\n    if (vlq > 0) {\n      // There are still more digits in this value, so we must make sure the\n      // continuation bit is marked.\n      digit |= VLQ_CONTINUATION_BIT;\n    }\n    encoded += base64.encode(digit);\n  } while (vlq > 0);\n\n  return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n  var strLen = aStr.length;\n  var result = 0;\n  var shift = 0;\n  var continuation, digit;\n\n  do {\n    if (aIndex >= strLen) {\n      throw new Error(\"Expected more digits in base 64 VLQ value.\");\n    }\n\n    digit = base64.decode(aStr.charCodeAt(aIndex++));\n    if (digit === -1) {\n      throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n    }\n\n    continuation = !!(digit & VLQ_CONTINUATION_BIT);\n    digit &= VLQ_BASE_MASK;\n    result = result + (digit << shift);\n    shift += VLQ_BASE_SHIFT;\n  } while (continuation);\n\n  aOutParam.value = fromVLQSigned(result);\n  aOutParam.rest = aIndex;\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/base64-vlq.js\n// module id = 2\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n  if (0 <= number && number < intToCharMap.length) {\n    return intToCharMap[number];\n  }\n  throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n  var bigA = 65;     // 'A'\n  var bigZ = 90;     // 'Z'\n\n  var littleA = 97;  // 'a'\n  var littleZ = 122; // 'z'\n\n  var zero = 48;     // '0'\n  var nine = 57;     // '9'\n\n  var plus = 43;     // '+'\n  var slash = 47;    // '/'\n\n  var littleOffset = 26;\n  var numberOffset = 52;\n\n  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n  if (bigA <= charCode && charCode <= bigZ) {\n    return (charCode - bigA);\n  }\n\n  // 26 - 51: abcdefghijklmnopqrstuvwxyz\n  if (littleA <= charCode && charCode <= littleZ) {\n    return (charCode - littleA + littleOffset);\n  }\n\n  // 52 - 61: 0123456789\n  if (zero <= charCode && charCode <= nine) {\n    return (charCode - zero + numberOffset);\n  }\n\n  // 62: +\n  if (charCode == plus) {\n    return 62;\n  }\n\n  // 63: /\n  if (charCode == slash) {\n    return 63;\n  }\n\n  // Invalid base64 digit.\n  return -1;\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/base64.js\n// module id = 3\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n  if (aName in aArgs) {\n    return aArgs[aName];\n  } else if (arguments.length === 3) {\n    return aDefaultValue;\n  } else {\n    throw new Error('\"' + aName + '\" is a required argument.');\n  }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n  var match = aUrl.match(urlRegexp);\n  if (!match) {\n    return null;\n  }\n  return {\n    scheme: match[1],\n    auth: match[2],\n    host: match[3],\n    port: match[4],\n    path: match[5]\n  };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n  var url = '';\n  if (aParsedUrl.scheme) {\n    url += aParsedUrl.scheme + ':';\n  }\n  url += '//';\n  if (aParsedUrl.auth) {\n    url += aParsedUrl.auth + '@';\n  }\n  if (aParsedUrl.host) {\n    url += aParsedUrl.host;\n  }\n  if (aParsedUrl.port) {\n    url += \":\" + aParsedUrl.port\n  }\n  if (aParsedUrl.path) {\n    url += aParsedUrl.path;\n  }\n  return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n  var path = aPath;\n  var url = urlParse(aPath);\n  if (url) {\n    if (!url.path) {\n      return aPath;\n    }\n    path = url.path;\n  }\n  var isAbsolute = exports.isAbsolute(path);\n\n  var parts = path.split(/\\/+/);\n  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n    part = parts[i];\n    if (part === '.') {\n      parts.splice(i, 1);\n    } else if (part === '..') {\n      up++;\n    } else if (up > 0) {\n      if (part === '') {\n        // The first part is blank if the path is absolute. Trying to go\n        // above the root is a no-op. Therefore we can remove all '..' parts\n        // directly after the root.\n        parts.splice(i + 1, up);\n        up = 0;\n      } else {\n        parts.splice(i, 2);\n        up--;\n      }\n    }\n  }\n  path = parts.join('/');\n\n  if (path === '') {\n    path = isAbsolute ? '/' : '.';\n  }\n\n  if (url) {\n    url.path = path;\n    return urlGenerate(url);\n  }\n  return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n *   first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n *   is updated with the result and aRoot is returned. Otherwise the result\n *   is returned.\n *   - If aPath is absolute, the result is aPath.\n *   - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n  if (aPath === \"\") {\n    aPath = \".\";\n  }\n  var aPathUrl = urlParse(aPath);\n  var aRootUrl = urlParse(aRoot);\n  if (aRootUrl) {\n    aRoot = aRootUrl.path || '/';\n  }\n\n  // `join(foo, '//www.example.org')`\n  if (aPathUrl && !aPathUrl.scheme) {\n    if (aRootUrl) {\n      aPathUrl.scheme = aRootUrl.scheme;\n    }\n    return urlGenerate(aPathUrl);\n  }\n\n  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n    return aPath;\n  }\n\n  // `join('http://', 'www.example.com')`\n  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n    aRootUrl.host = aPath;\n    return urlGenerate(aRootUrl);\n  }\n\n  var joined = aPath.charAt(0) === '/'\n    ? aPath\n    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n  if (aRootUrl) {\n    aRootUrl.path = joined;\n    return urlGenerate(aRootUrl);\n  }\n  return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n\n  aRoot = aRoot.replace(/\\/$/, '');\n\n  // It is possible for the path to be above the root. In this case, simply\n  // checking whether the root is a prefix of the path won't work. Instead, we\n  // need to remove components from the root one by one, until either we find\n  // a prefix that fits, or we run out of components to remove.\n  var level = 0;\n  while (aPath.indexOf(aRoot + '/') !== 0) {\n    var index = aRoot.lastIndexOf(\"/\");\n    if (index < 0) {\n      return aPath;\n    }\n\n    // If the only part of the root that is left is the scheme (i.e. http://,\n    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n    // have exhausted all components, so the path is not relative to the root.\n    aRoot = aRoot.slice(0, index);\n    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n      return aPath;\n    }\n\n    ++level;\n  }\n\n  // Make sure we add a \"../\" for each component we removed from the root.\n  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n  return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n  if (!s) {\n    return false;\n  }\n\n  var length = s.length;\n\n  if (length < 9 /* \"__proto__\".length */) {\n    return false;\n  }\n\n  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n    return false;\n  }\n\n  for (var i = length - 10; i >= 0; i--) {\n    if (s.charCodeAt(i) !== 36 /* '$' */) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n  if (aStr1 === aStr2) {\n    return 0;\n  }\n\n  if (aStr1 === null) {\n    return 1; // aStr2 !== null\n  }\n\n  if (aStr2 === null) {\n    return -1; // aStr1 !== null\n  }\n\n  if (aStr1 > aStr2) {\n    return 1;\n  }\n\n  return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n      sourceRoot += '/';\n    }\n    // The spec says:\n    //   Line 4: An optional source root, useful for relocating source\n    //   files on a server or removing repeated values in the\n    //   “sources” entry.  This value is prepended to the individual\n    //   entries in the “source” field.\n    sourceURL = sourceRoot + sourceURL;\n  }\n\n  // Historically, SourceMapConsumer did not take the sourceMapURL as\n  // a parameter.  This mode is still somewhat supported, which is why\n  // this code block is conditional.  However, it's preferable to pass\n  // the source map URL to SourceMapConsumer, so that this function\n  // can implement the source URL resolution algorithm as outlined in\n  // the spec.  This block is basically the equivalent of:\n  //    new URL(sourceURL, sourceMapURL).toString()\n  // ... except it avoids using URL, which wasn't available in the\n  // older releases of node still supported by this library.\n  //\n  // The spec says:\n  //   If the sources are not absolute URLs after prepending of the\n  //   “sourceRoot”, the sources are resolved relative to the\n  //   SourceMap (like resolving script src in a html document).\n  if (sourceMapURL) {\n    var parsed = urlParse(sourceMapURL);\n    if (!parsed) {\n      throw new Error(\"sourceMapURL could not be parsed\");\n    }\n    if (parsed.path) {\n      // Strip the last path component, but keep the \"/\".\n      var index = parsed.path.lastIndexOf('/');\n      if (index >= 0) {\n        parsed.path = parsed.path.substring(0, index + 1);\n      }\n    }\n    sourceURL = join(urlGenerate(parsed), sourceURL);\n  }\n\n  return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/util.js\n// module id = 4\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n  this._array = [];\n  this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n  var set = new ArraySet();\n  for (var i = 0, len = aArray.length; i < len; i++) {\n    set.add(aArray[i], aAllowDuplicates);\n  }\n  return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n  var idx = this._array.length;\n  if (!isDuplicate || aAllowDuplicates) {\n    this._array.push(aStr);\n  }\n  if (!isDuplicate) {\n    if (hasNativeMap) {\n      this._set.set(aStr, idx);\n    } else {\n      this._set[sStr] = idx;\n    }\n  }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n  if (hasNativeMap) {\n    return this._set.has(aStr);\n  } else {\n    var sStr = util.toSetString(aStr);\n    return has.call(this._set, sStr);\n  }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n  if (hasNativeMap) {\n    var idx = this._set.get(aStr);\n    if (idx >= 0) {\n        return idx;\n    }\n  } else {\n    var sStr = util.toSetString(aStr);\n    if (has.call(this._set, sStr)) {\n      return this._set[sStr];\n    }\n  }\n\n  throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n  if (aIdx >= 0 && aIdx < this._array.length) {\n    return this._array[aIdx];\n  }\n  throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n  return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/array-set.js\n// module id = 5\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n  // Optimized for most common case\n  var lineA = mappingA.generatedLine;\n  var lineB = mappingB.generatedLine;\n  var columnA = mappingA.generatedColumn;\n  var columnB = mappingB.generatedColumn;\n  return lineB > lineA || lineB == lineA && columnB >= columnA ||\n         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n  this._array = [];\n  this._sorted = true;\n  // Serves as infimum\n  this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n  function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n  };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n  if (generatedPositionAfter(this._last, aMapping)) {\n    this._last = aMapping;\n    this._array.push(aMapping);\n  } else {\n    this._sorted = false;\n    this._array.push(aMapping);\n  }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n  if (!this._sorted) {\n    this._array.sort(util.compareByGeneratedPositionsInflated);\n    this._sorted = true;\n  }\n  return this._array;\n};\n\nexports.MappingList = MappingList;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/mapping-list.js\n// module id = 6\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  return sourceMap.sections != null\n    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n//     {\n//       generatedLine: The line number in the generated code,\n//       generatedColumn: The column number in the generated code,\n//       source: The path to the original source file that generated this\n//               chunk of code,\n//       originalLine: The line number in the original source that\n//                     corresponds to this chunk of generated code,\n//       originalColumn: The column number in the original source that\n//                       corresponds to this chunk of generated code,\n//       name: The name of the original symbol which generated this chunk of\n//             code.\n//     }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__generatedMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__generatedMappings;\n  }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__originalMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__originalMappings;\n  }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n    var c = aStr.charAt(index);\n    return c === \";\" || c === \",\";\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n  };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n *        The function that is called with each mapping.\n * @param Object aContext\n *        Optional. If specified, this object will be the value of `this` every\n *        time that `aCallback` is called.\n * @param aOrder\n *        Either `SourceMapConsumer.GENERATED_ORDER` or\n *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n *        iterate over the mappings sorted by the generated file's line/column\n *        order or the original's source/line/column order, respectively. Defaults to\n *        `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n    var context = aContext || null;\n    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n    var mappings;\n    switch (order) {\n    case SourceMapConsumer.GENERATED_ORDER:\n      mappings = this._generatedMappings;\n      break;\n    case SourceMapConsumer.ORIGINAL_ORDER:\n      mappings = this._originalMappings;\n      break;\n    default:\n      throw new Error(\"Unknown order of iteration.\");\n    }\n\n    var sourceRoot = this.sourceRoot;\n    mappings.map(function (mapping) {\n      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n      return {\n        source: source,\n        generatedLine: mapping.generatedLine,\n        generatedColumn: mapping.generatedColumn,\n        originalLine: mapping.originalLine,\n        originalColumn: mapping.originalColumn,\n        name: mapping.name === null ? null : this._names.at(mapping.name)\n      };\n    }, this).forEach(aCallback, context);\n  };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number is 1-based.\n *   - column: Optional. the column number in the original source.\n *    The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *    line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *    The column number is 0-based.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n    var line = util.getArg(aArgs, 'line');\n\n    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n    // returns the index of the closest mapping less than the needle. By\n    // setting needle.originalColumn to 0, we thus find the last mapping for\n    // the given line, provided such a mapping exists.\n    var needle = {\n      source: util.getArg(aArgs, 'source'),\n      originalLine: line,\n      originalColumn: util.getArg(aArgs, 'column', 0)\n    };\n\n    needle.source = this._findSourceIndex(needle.source);\n    if (needle.source < 0) {\n      return [];\n    }\n\n    var mappings = [];\n\n    var index = this._findMapping(needle,\n                                  this._originalMappings,\n                                  \"originalLine\",\n                                  \"originalColumn\",\n                                  util.compareByOriginalPositions,\n                                  binarySearch.LEAST_UPPER_BOUND);\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (aArgs.column === undefined) {\n        var originalLine = mapping.originalLine;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we found. Since\n        // mappings are sorted, this is guaranteed to find all mappings for\n        // the line we found.\n        while (mapping && mapping.originalLine === originalLine) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      } else {\n        var originalColumn = mapping.originalColumn;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we were searching for.\n        // Since mappings are sorted, this is guaranteed to find all mappings for\n        // the line we are searching for.\n        while (mapping &&\n               mapping.originalLine === line &&\n               mapping.originalColumn == originalColumn) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      }\n    }\n\n    return mappings;\n  };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - sources: An array of URLs to the original source files.\n *   - names: An array of identifiers which can be referrenced by individual mappings.\n *   - sourceRoot: Optional. The URL root from which all sources are relative.\n *   - sourcesContent: Optional. An array of contents of the original source files.\n *   - mappings: A string of base64 VLQs which contain the actual mappings.\n *   - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n *     {\n *       version : 3,\n *       file: \"out.js\",\n *       sourceRoot : \"\",\n *       sources: [\"foo.js\", \"bar.js\"],\n *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n *       mappings: \"AA,AB;;ABCDE;\"\n *     }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sources = util.getArg(sourceMap, 'sources');\n  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n  // requires the array) to play nice here.\n  var names = util.getArg(sourceMap, 'names', []);\n  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n  var mappings = util.getArg(sourceMap, 'mappings');\n  var file = util.getArg(sourceMap, 'file', null);\n\n  // Once again, Sass deviates from the spec and supplies the version as a\n  // string rather than a number, so we use loose equality checking here.\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  if (sourceRoot) {\n    sourceRoot = util.normalize(sourceRoot);\n  }\n\n  sources = sources\n    .map(String)\n    // Some source maps produce relative source paths like \"./foo.js\" instead of\n    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n    // See bugzil.la/1090768.\n    .map(util.normalize)\n    // Always ensure that absolute sources are internally stored relative to\n    // the source root, if the source root is absolute. Not doing this would\n    // be particularly problematic when the source root is a prefix of the\n    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n    .map(function (source) {\n      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n        ? util.relative(sourceRoot, source)\n        : source;\n    });\n\n  // Pass `true` below to allow duplicate names and sources. While source maps\n  // are intended to be compressed and deduplicated, the TypeScript compiler\n  // sometimes generates source maps with duplicates in them. See Github issue\n  // #72 and bugzil.la/889492.\n  this._names = ArraySet.fromArray(names.map(String), true);\n  this._sources = ArraySet.fromArray(sources, true);\n\n  this._absoluteSources = this._sources.toArray().map(function (s) {\n    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n  });\n\n  this.sourceRoot = sourceRoot;\n  this.sourcesContent = sourcesContent;\n  this._mappings = mappings;\n  this._sourceMapURL = aSourceMapURL;\n  this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n  var relativeSource = aSource;\n  if (this.sourceRoot != null) {\n    relativeSource = util.relative(this.sourceRoot, relativeSource);\n  }\n\n  if (this._sources.has(relativeSource)) {\n    return this._sources.indexOf(relativeSource);\n  }\n\n  // Maybe aSource is an absolute URL as returned by |sources|.  In\n  // this case we can't simply undo the transform.\n  var i;\n  for (i = 0; i < this._absoluteSources.length; ++i) {\n    if (this._absoluteSources[i] == aSource) {\n      return i;\n    }\n  }\n\n  return -1;\n};\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n *        The source map that will be consumed.\n * @param String aSourceMapURL\n *        The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n                                                            smc.sourceRoot);\n    smc.file = aSourceMap._file;\n    smc._sourceMapURL = aSourceMapURL;\n    smc._absoluteSources = smc._sources.toArray().map(function (s) {\n      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n    });\n\n    // Because we are modifying the entries (by converting string sources and\n    // names to indices into the sources and names ArraySets), we have to make\n    // a copy of the entry or else bad things happen. Shared mutable state\n    // strikes again! See github issue #191.\n\n    var generatedMappings = aSourceMap._mappings.toArray().slice();\n    var destGeneratedMappings = smc.__generatedMappings = [];\n    var destOriginalMappings = smc.__originalMappings = [];\n\n    for (var i = 0, length = generatedMappings.length; i < length; i++) {\n      var srcMapping = generatedMappings[i];\n      var destMapping = new Mapping;\n      destMapping.generatedLine = srcMapping.generatedLine;\n      destMapping.generatedColumn = srcMapping.generatedColumn;\n\n      if (srcMapping.source) {\n        destMapping.source = sources.indexOf(srcMapping.source);\n        destMapping.originalLine = srcMapping.originalLine;\n        destMapping.originalColumn = srcMapping.originalColumn;\n\n        if (srcMapping.name) {\n          destMapping.name = names.indexOf(srcMapping.name);\n        }\n\n        destOriginalMappings.push(destMapping);\n      }\n\n      destGeneratedMappings.push(destMapping);\n    }\n\n    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n    return smc;\n  };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    return this._absoluteSources.slice();\n  }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n  this.generatedLine = 0;\n  this.generatedColumn = 0;\n  this.source = null;\n  this.originalLine = null;\n  this.originalColumn = null;\n  this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    var generatedLine = 1;\n    var previousGeneratedColumn = 0;\n    var previousOriginalLine = 0;\n    var previousOriginalColumn = 0;\n    var previousSource = 0;\n    var previousName = 0;\n    var length = aStr.length;\n    var index = 0;\n    var cachedSegments = {};\n    var temp = {};\n    var originalMappings = [];\n    var generatedMappings = [];\n    var mapping, str, segment, end, value;\n\n    while (index < length) {\n      if (aStr.charAt(index) === ';') {\n        generatedLine++;\n        index++;\n        previousGeneratedColumn = 0;\n      }\n      else if (aStr.charAt(index) === ',') {\n        index++;\n      }\n      else {\n        mapping = new Mapping();\n        mapping.generatedLine = generatedLine;\n\n        // Because each offset is encoded relative to the previous one,\n        // many segments often have the same encoding. We can exploit this\n        // fact by caching the parsed variable length fields of each segment,\n        // allowing us to avoid a second parse if we encounter the same\n        // segment again.\n        for (end = index; end < length; end++) {\n          if (this._charIsMappingSeparator(aStr, end)) {\n            break;\n          }\n        }\n        str = aStr.slice(index, end);\n\n        segment = cachedSegments[str];\n        if (segment) {\n          index += str.length;\n        } else {\n          segment = [];\n          while (index < end) {\n            base64VLQ.decode(aStr, index, temp);\n            value = temp.value;\n            index = temp.rest;\n            segment.push(value);\n          }\n\n          if (segment.length === 2) {\n            throw new Error('Found a source, but no line and column');\n          }\n\n          if (segment.length === 3) {\n            throw new Error('Found a source and line, but no column');\n          }\n\n          cachedSegments[str] = segment;\n        }\n\n        // Generated column.\n        mapping.generatedColumn = previousGeneratedColumn + segment[0];\n        previousGeneratedColumn = mapping.generatedColumn;\n\n        if (segment.length > 1) {\n          // Original source.\n          mapping.source = previousSource + segment[1];\n          previousSource += segment[1];\n\n          // Original line.\n          mapping.originalLine = previousOriginalLine + segment[2];\n          previousOriginalLine = mapping.originalLine;\n          // Lines are stored 0-based\n          mapping.originalLine += 1;\n\n          // Original column.\n          mapping.originalColumn = previousOriginalColumn + segment[3];\n          previousOriginalColumn = mapping.originalColumn;\n\n          if (segment.length > 4) {\n            // Original name.\n            mapping.name = previousName + segment[4];\n            previousName += segment[4];\n          }\n        }\n\n        generatedMappings.push(mapping);\n        if (typeof mapping.originalLine === 'number') {\n          originalMappings.push(mapping);\n        }\n      }\n    }\n\n    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n    this.__generatedMappings = generatedMappings;\n\n    quickSort(originalMappings, util.compareByOriginalPositions);\n    this.__originalMappings = originalMappings;\n  };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n                                         aColumnName, aComparator, aBias) {\n    // To return the position we are searching for, we must first find the\n    // mapping for the given position and then return the opposite position it\n    // points to. Because the mappings are sorted, we can use binary search to\n    // find the best mapping.\n\n    if (aNeedle[aLineName] <= 0) {\n      throw new TypeError('Line must be greater than or equal to 1, got '\n                          + aNeedle[aLineName]);\n    }\n    if (aNeedle[aColumnName] < 0) {\n      throw new TypeError('Column must be greater than or equal to 0, got '\n                          + aNeedle[aColumnName]);\n    }\n\n    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n  };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n  function SourceMapConsumer_computeColumnSpans() {\n    for (var index = 0; index < this._generatedMappings.length; ++index) {\n      var mapping = this._generatedMappings[index];\n\n      // Mappings do not contain a field for the last generated columnt. We\n      // can come up with an optimistic estimate, however, by assuming that\n      // mappings are contiguous (i.e. given two consecutive mappings, the\n      // first mapping ends where the second one starts).\n      if (index + 1 < this._generatedMappings.length) {\n        var nextMapping = this._generatedMappings[index + 1];\n\n        if (mapping.generatedLine === nextMapping.generatedLine) {\n          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n          continue;\n        }\n      }\n\n      // The last mapping for each line spans the entire line.\n      mapping.lastGeneratedColumn = Infinity;\n    }\n  };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n  function SourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._generatedMappings,\n      \"generatedLine\",\n      \"generatedColumn\",\n      util.compareByGeneratedPositionsDeflated,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._generatedMappings[index];\n\n      if (mapping.generatedLine === needle.generatedLine) {\n        var source = util.getArg(mapping, 'source', null);\n        if (source !== null) {\n          source = this._sources.at(source);\n          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n        }\n        var name = util.getArg(mapping, 'name', null);\n        if (name !== null) {\n          name = this._names.at(name);\n        }\n        return {\n          source: source,\n          line: util.getArg(mapping, 'originalLine', null),\n          column: util.getArg(mapping, 'originalColumn', null),\n          name: name\n        };\n      }\n    }\n\n    return {\n      source: null,\n      line: null,\n      column: null,\n      name: null\n    };\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) {\n      return false;\n    }\n    return this.sourcesContent.length >= this._sources.size() &&\n      !this.sourcesContent.some(function (sc) { return sc == null; });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    if (!this.sourcesContent) {\n      return null;\n    }\n\n    var index = this._findSourceIndex(aSource);\n    if (index >= 0) {\n      return this.sourcesContent[index];\n    }\n\n    var relativeSource = aSource;\n    if (this.sourceRoot != null) {\n      relativeSource = util.relative(this.sourceRoot, relativeSource);\n    }\n\n    var url;\n    if (this.sourceRoot != null\n        && (url = util.urlParse(this.sourceRoot))) {\n      // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n      // many users. We can help them out when they expect file:// URIs to\n      // behave like it would if they were running a local HTTP server. See\n      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n      var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n      if (url.scheme == \"file\"\n          && this._sources.has(fileUriAbsPath)) {\n        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n      }\n\n      if ((!url.path || url.path == \"/\")\n          && this._sources.has(\"/\" + relativeSource)) {\n        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n      }\n    }\n\n    // This function is used recursively from\n    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n    // don't want to throw if we can't find the source - we just want to\n    // return null, so we provide a flag to exit gracefully.\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n  function SourceMapConsumer_generatedPositionFor(aArgs) {\n    var source = util.getArg(aArgs, 'source');\n    source = this._findSourceIndex(source);\n    if (source < 0) {\n      return {\n        line: null,\n        column: null,\n        lastColumn: null\n      };\n    }\n\n    var needle = {\n      source: source,\n      originalLine: util.getArg(aArgs, 'line'),\n      originalColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._originalMappings,\n      \"originalLine\",\n      \"originalColumn\",\n      util.compareByOriginalPositions,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (mapping.source === needle.source) {\n        return {\n          line: util.getArg(mapping, 'generatedLine', null),\n          column: util.getArg(mapping, 'generatedColumn', null),\n          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n        };\n      }\n    }\n\n    return {\n      line: null,\n      column: null,\n      lastColumn: null\n    };\n  };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - file: Optional. The generated file this source map is associated with.\n *   - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n *   - offset: The offset into the original specified at which this section\n *       begins to apply, defined as an object with a \"line\" and \"column\"\n *       field.\n *   - map: A source map definition. This source map could also be indexed,\n *       but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n *  {\n *    version : 3,\n *    file: \"app.js\",\n *    sections: [{\n *      offset: {line:100, column:10},\n *      map: {\n *        version : 3,\n *        file: \"section.js\",\n *        sources: [\"foo.js\", \"bar.js\"],\n *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n *        mappings: \"AAAA,E;;ABCDE;\"\n *      }\n *    }],\n *  }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sections = util.getArg(sourceMap, 'sections');\n\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n\n  var lastOffset = {\n    line: -1,\n    column: 0\n  };\n  this._sections = sections.map(function (s) {\n    if (s.url) {\n      // The url field will require support for asynchronicity.\n      // See https://github.com/mozilla/source-map/issues/16\n      throw new Error('Support for url field in sections not implemented.');\n    }\n    var offset = util.getArg(s, 'offset');\n    var offsetLine = util.getArg(offset, 'line');\n    var offsetColumn = util.getArg(offset, 'column');\n\n    if (offsetLine < lastOffset.line ||\n        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n      throw new Error('Section offsets must be ordered and non-overlapping.');\n    }\n    lastOffset = offset;\n\n    return {\n      generatedOffset: {\n        // The offset fields are 0-based, but we use 1-based indices when\n        // encoding/decoding from VLQ.\n        generatedLine: offsetLine + 1,\n        generatedColumn: offsetColumn + 1\n      },\n      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n    }\n  });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    var sources = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n        sources.push(this._sections[i].consumer.sources[j]);\n      }\n    }\n    return sources;\n  }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    // Find the section containing the generated position we're trying to map\n    // to an original position.\n    var sectionIndex = binarySearch.search(needle, this._sections,\n      function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) {\n          return cmp;\n        }\n\n        return (needle.generatedColumn -\n                section.generatedOffset.generatedColumn);\n      });\n    var section = this._sections[sectionIndex];\n\n    if (!section) {\n      return {\n        source: null,\n        line: null,\n        column: null,\n        name: null\n      };\n    }\n\n    return section.consumer.originalPositionFor({\n      line: needle.generatedLine -\n        (section.generatedOffset.generatedLine - 1),\n      column: needle.generatedColumn -\n        (section.generatedOffset.generatedLine === needle.generatedLine\n         ? section.generatedOffset.generatedColumn - 1\n         : 0),\n      bias: aArgs.bias\n    });\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n    return this._sections.every(function (s) {\n      return s.consumer.hasContentsOfAllSources();\n    });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      var content = section.consumer.sourceContentFor(aSource, true);\n      if (content) {\n        return content;\n      }\n    }\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based. \n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      // Only consider this section if the requested source is in the list of\n      // sources of the consumer.\n      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n        continue;\n      }\n      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n      if (generatedPosition) {\n        var ret = {\n          line: generatedPosition.line +\n            (section.generatedOffset.generatedLine - 1),\n          column: generatedPosition.column +\n            (section.generatedOffset.generatedLine === generatedPosition.line\n             ? section.generatedOffset.generatedColumn - 1\n             : 0)\n        };\n        return ret;\n      }\n    }\n\n    return {\n      line: null,\n      column: null\n    };\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    this.__generatedMappings = [];\n    this.__originalMappings = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n      var sectionMappings = section.consumer._generatedMappings;\n      for (var j = 0; j < sectionMappings.length; j++) {\n        var mapping = sectionMappings[j];\n\n        var source = section.consumer._sources.at(mapping.source);\n        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n        this._sources.add(source);\n        source = this._sources.indexOf(source);\n\n        var name = null;\n        if (mapping.name) {\n          name = section.consumer._names.at(mapping.name);\n          this._names.add(name);\n          name = this._names.indexOf(name);\n        }\n\n        // The mappings coming from the consumer for the section have\n        // generated positions relative to the start of the section, so we\n        // need to offset them to be relative to the start of the concatenated\n        // generated file.\n        var adjustedMapping = {\n          source: source,\n          generatedLine: mapping.generatedLine +\n            (section.generatedOffset.generatedLine - 1),\n          generatedColumn: mapping.generatedColumn +\n            (section.generatedOffset.generatedLine === mapping.generatedLine\n            ? section.generatedOffset.generatedColumn - 1\n            : 0),\n          originalLine: mapping.originalLine,\n          originalColumn: mapping.originalColumn,\n          name: name\n        };\n\n        this.__generatedMappings.push(adjustedMapping);\n        if (typeof adjustedMapping.originalLine === 'number') {\n          this.__originalMappings.push(adjustedMapping);\n        }\n      }\n    }\n\n    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n  };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-consumer.js\n// module id = 7\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n  // This function terminates when one of the following is true:\n  //\n  //   1. We find the exact element we are looking for.\n  //\n  //   2. We did not find the exact element, but we can return the index of\n  //      the next-closest element.\n  //\n  //   3. We did not find the exact element, and there is no next-closest\n  //      element than the one we are searching for, so we return -1.\n  var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n  var cmp = aCompare(aNeedle, aHaystack[mid], true);\n  if (cmp === 0) {\n    // Found the element we are looking for.\n    return mid;\n  }\n  else if (cmp > 0) {\n    // Our needle is greater than aHaystack[mid].\n    if (aHigh - mid > 1) {\n      // The element is in the upper half.\n      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // The exact needle element was not found in this haystack. Determine if\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return aHigh < aHaystack.length ? aHigh : -1;\n    } else {\n      return mid;\n    }\n  }\n  else {\n    // Our needle is less than aHaystack[mid].\n    if (mid - aLow > 1) {\n      // The element is in the lower half.\n      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return mid;\n    } else {\n      return aLow < 0 ? -1 : aLow;\n    }\n  }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n *     array and returns -1, 0, or 1 depending on whether the needle is less\n *     than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n  if (aHaystack.length === 0) {\n    return -1;\n  }\n\n  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n  if (index < 0) {\n    return -1;\n  }\n\n  // We have found either the exact element, or the next-closest element than\n  // the one we are searching for. However, there may be more than one such\n  // element. Make sure we always return the smallest of these.\n  while (index - 1 >= 0) {\n    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n      break;\n    }\n    --index;\n  }\n\n  return index;\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/binary-search.js\n// module id = 8\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n *        The array.\n * @param {Number} x\n *        The index of the first item.\n * @param {Number} y\n *        The index of the second item.\n */\nfunction swap(ary, x, y) {\n  var temp = ary[x];\n  ary[x] = ary[y];\n  ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n *        The lower bound on the range.\n * @param {Number} high\n *        The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n  return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n * @param {Number} p\n *        Start index of the array\n * @param {Number} r\n *        End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n  // If our lower bound is less than our upper bound, we (1) partition the\n  // array into two pieces and (2) recurse on each half. If it is not, this is\n  // the empty array and our base case.\n\n  if (p < r) {\n    // (1) Partitioning.\n    //\n    // The partitioning chooses a pivot between `p` and `r` and moves all\n    // elements that are less than or equal to the pivot to the before it, and\n    // all the elements that are greater than it after it. The effect is that\n    // once partition is done, the pivot is in the exact place it will be when\n    // the array is put in sorted order, and it will not need to be moved\n    // again. This runs in O(n) time.\n\n    // Always choose a random pivot so that an input array which is reverse\n    // sorted does not cause O(n^2) running time.\n    var pivotIndex = randomIntInRange(p, r);\n    var i = p - 1;\n\n    swap(ary, pivotIndex, r);\n    var pivot = ary[r];\n\n    // Immediately after `j` is incremented in this loop, the following hold\n    // true:\n    //\n    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.\n    //\n    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n    for (var j = p; j < r; j++) {\n      if (comparator(ary[j], pivot) <= 0) {\n        i += 1;\n        swap(ary, i, j);\n      }\n    }\n\n    swap(ary, i + 1, j);\n    var q = i + 1;\n\n    // (2) Recurse on each half.\n\n    doQuickSort(ary, comparator, p, q - 1);\n    doQuickSort(ary, comparator, q + 1, r);\n  }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n  doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/quick-sort.js\n// module id = 9\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar util = require('./util');\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n *        generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n  this.children = [];\n  this.sourceContents = {};\n  this.line = aLine == null ? null : aLine;\n  this.column = aColumn == null ? null : aColumn;\n  this.source = aSource == null ? null : aSource;\n  this.name = aName == null ? null : aName;\n  this[isSourceNode] = true;\n  if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n *        SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n    // The SourceNode we want to fill with the generated code\n    // and the SourceMap\n    var node = new SourceNode();\n\n    // All even indices of this array are one line of the generated code,\n    // while all odd indices are the newlines between two adjacent lines\n    // (since `REGEX_NEWLINE` captures its match).\n    // Processed fragments are accessed by calling `shiftNextLine`.\n    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n    var remainingLinesIndex = 0;\n    var shiftNextLine = function() {\n      var lineContents = getNextLine();\n      // The last line of a file might not have a newline.\n      var newLine = getNextLine() || \"\";\n      return lineContents + newLine;\n\n      function getNextLine() {\n        return remainingLinesIndex < remainingLines.length ?\n            remainingLines[remainingLinesIndex++] : undefined;\n      }\n    };\n\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n    // The generate SourceNodes we need a code range.\n    // To extract it current and last mapping is used.\n    // Here we store the last mapping.\n    var lastMapping = null;\n\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      if (lastMapping !== null) {\n        // We add the code from \"lastMapping\" to \"mapping\":\n        // First check if there is a new line in between.\n        if (lastGeneratedLine < mapping.generatedLine) {\n          // Associate first line with \"lastMapping\"\n          addMappingWithCode(lastMapping, shiftNextLine());\n          lastGeneratedLine++;\n          lastGeneratedColumn = 0;\n          // The remaining code is added without mapping\n        } else {\n          // There is no new line in between.\n          // Associate the code between \"lastGeneratedColumn\" and\n          // \"mapping.generatedColumn\" with \"lastMapping\"\n          var nextLine = remainingLines[remainingLinesIndex] || '';\n          var code = nextLine.substr(0, mapping.generatedColumn -\n                                        lastGeneratedColumn);\n          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n                                              lastGeneratedColumn);\n          lastGeneratedColumn = mapping.generatedColumn;\n          addMappingWithCode(lastMapping, code);\n          // No more remaining code, continue\n          lastMapping = mapping;\n          return;\n        }\n      }\n      // We add the generated code until the first mapping\n      // to the SourceNode without any mapping.\n      // Each line is added as separate string.\n      while (lastGeneratedLine < mapping.generatedLine) {\n        node.add(shiftNextLine());\n        lastGeneratedLine++;\n      }\n      if (lastGeneratedColumn < mapping.generatedColumn) {\n        var nextLine = remainingLines[remainingLinesIndex] || '';\n        node.add(nextLine.substr(0, mapping.generatedColumn));\n        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n        lastGeneratedColumn = mapping.generatedColumn;\n      }\n      lastMapping = mapping;\n    }, this);\n    // We have processed all mappings.\n    if (remainingLinesIndex < remainingLines.length) {\n      if (lastMapping) {\n        // Associate the remaining code in the current line with \"lastMapping\"\n        addMappingWithCode(lastMapping, shiftNextLine());\n      }\n      // and add the remaining lines without any mapping\n      node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n    }\n\n    // Copy sourcesContent into SourceNode\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aRelativePath != null) {\n          sourceFile = util.join(aRelativePath, sourceFile);\n        }\n        node.setSourceContent(sourceFile, content);\n      }\n    });\n\n    return node;\n\n    function addMappingWithCode(mapping, code) {\n      if (mapping === null || mapping.source === undefined) {\n        node.add(code);\n      } else {\n        var source = aRelativePath\n          ? util.join(aRelativePath, mapping.source)\n          : mapping.source;\n        node.add(new SourceNode(mapping.originalLine,\n                                mapping.originalColumn,\n                                source,\n                                code,\n                                mapping.name));\n      }\n    }\n  };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n  if (Array.isArray(aChunk)) {\n    aChunk.forEach(function (chunk) {\n      this.add(chunk);\n    }, this);\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    if (aChunk) {\n      this.children.push(aChunk);\n    }\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n  if (Array.isArray(aChunk)) {\n    for (var i = aChunk.length-1; i >= 0; i--) {\n      this.prepend(aChunk[i]);\n    }\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    this.children.unshift(aChunk);\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n  var chunk;\n  for (var i = 0, len = this.children.length; i < len; i++) {\n    chunk = this.children[i];\n    if (chunk[isSourceNode]) {\n      chunk.walk(aFn);\n    }\n    else {\n      if (chunk !== '') {\n        aFn(chunk, { source: this.source,\n                     line: this.line,\n                     column: this.column,\n                     name: this.name });\n      }\n    }\n  }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n  var newChildren;\n  var i;\n  var len = this.children.length;\n  if (len > 0) {\n    newChildren = [];\n    for (i = 0; i < len-1; i++) {\n      newChildren.push(this.children[i]);\n      newChildren.push(aSep);\n    }\n    newChildren.push(this.children[i]);\n    this.children = newChildren;\n  }\n  return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n  var lastChild = this.children[this.children.length - 1];\n  if (lastChild[isSourceNode]) {\n    lastChild.replaceRight(aPattern, aReplacement);\n  }\n  else if (typeof lastChild === 'string') {\n    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n  }\n  else {\n    this.children.push(''.replace(aPattern, aReplacement));\n  }\n  return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n  };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n  function SourceNode_walkSourceContents(aFn) {\n    for (var i = 0, len = this.children.length; i < len; i++) {\n      if (this.children[i][isSourceNode]) {\n        this.children[i].walkSourceContents(aFn);\n      }\n    }\n\n    var sources = Object.keys(this.sourceContents);\n    for (var i = 0, len = sources.length; i < len; i++) {\n      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n    }\n  };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n  var str = \"\";\n  this.walk(function (chunk) {\n    str += chunk;\n  });\n  return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n  var generated = {\n    code: \"\",\n    line: 1,\n    column: 0\n  };\n  var map = new SourceMapGenerator(aArgs);\n  var sourceMappingActive = false;\n  var lastOriginalSource = null;\n  var lastOriginalLine = null;\n  var lastOriginalColumn = null;\n  var lastOriginalName = null;\n  this.walk(function (chunk, original) {\n    generated.code += chunk;\n    if (original.source !== null\n        && original.line !== null\n        && original.column !== null) {\n      if(lastOriginalSource !== original.source\n         || lastOriginalLine !== original.line\n         || lastOriginalColumn !== original.column\n         || lastOriginalName !== original.name) {\n        map.addMapping({\n          source: original.source,\n          original: {\n            line: original.line,\n            column: original.column\n          },\n          generated: {\n            line: generated.line,\n            column: generated.column\n          },\n          name: original.name\n        });\n      }\n      lastOriginalSource = original.source;\n      lastOriginalLine = original.line;\n      lastOriginalColumn = original.column;\n      lastOriginalName = original.name;\n      sourceMappingActive = true;\n    } else if (sourceMappingActive) {\n      map.addMapping({\n        generated: {\n          line: generated.line,\n          column: generated.column\n        }\n      });\n      lastOriginalSource = null;\n      sourceMappingActive = false;\n    }\n    for (var idx = 0, length = chunk.length; idx < length; idx++) {\n      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n        generated.line++;\n        generated.column = 0;\n        // Mappings end at eol\n        if (idx + 1 === length) {\n          lastOriginalSource = null;\n          sourceMappingActive = false;\n        } else if (sourceMappingActive) {\n          map.addMapping({\n            source: original.source,\n            original: {\n              line: original.line,\n              column: original.column\n            },\n            generated: {\n              line: generated.line,\n              column: generated.column\n            },\n            name: original.name\n          });\n        }\n      } else {\n        generated.column++;\n      }\n    }\n  });\n  this.walkSourceContents(function (sourceFile, sourceContent) {\n    map.setSourceContent(sourceFile, sourceContent);\n  });\n\n  return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-node.js\n// module id = 10\n// module chunks = 0"],"sourceRoot":""}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.js b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.js
new file mode 100644
index 0000000..b4eb087
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.js
@@ -0,0 +1,3233 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory();
+	else if(typeof define === 'function' && define.amd)
+		define([], factory);
+	else if(typeof exports === 'object')
+		exports["sourceMap"] = factory();
+	else
+		root["sourceMap"] = factory();
+})(this, function() {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId])
+/******/ 			return installedModules[moduleId].exports;
+
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			exports: {},
+/******/ 			id: moduleId,
+/******/ 			loaded: false
+/******/ 		};
+
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+
+/******/ 		// Flag the module as loaded
+/******/ 		module.loaded = true;
+
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+
+
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(0);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/*
+	 * Copyright 2009-2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE.txt or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	exports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	exports.SourceMapConsumer = __webpack_require__(7).SourceMapConsumer;
+	exports.SourceNode = __webpack_require__(10).SourceNode;
+
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var base64VLQ = __webpack_require__(2);
+	var util = __webpack_require__(4);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var MappingList = __webpack_require__(6).MappingList;
+
+	/**
+	 * An instance of the SourceMapGenerator represents a source map which is
+	 * being built incrementally. You may pass an object with the following
+	 * properties:
+	 *
+	 *   - file: The filename of the generated source.
+	 *   - sourceRoot: A root for all relative URLs in this source map.
+	 */
+	function SourceMapGenerator(aArgs) {
+	  if (!aArgs) {
+	    aArgs = {};
+	  }
+	  this._file = util.getArg(aArgs, 'file', null);
+	  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+	  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+	  this._mappings = new MappingList();
+	  this._sourcesContents = null;
+	}
+
+	SourceMapGenerator.prototype._version = 3;
+
+	/**
+	 * Creates a new SourceMapGenerator based on a SourceMapConsumer
+	 *
+	 * @param aSourceMapConsumer The SourceMap.
+	 */
+	SourceMapGenerator.fromSourceMap =
+	  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+	    var sourceRoot = aSourceMapConsumer.sourceRoot;
+	    var generator = new SourceMapGenerator({
+	      file: aSourceMapConsumer.file,
+	      sourceRoot: sourceRoot
+	    });
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      var newMapping = {
+	        generated: {
+	          line: mapping.generatedLine,
+	          column: mapping.generatedColumn
+	        }
+	      };
+
+	      if (mapping.source != null) {
+	        newMapping.source = mapping.source;
+	        if (sourceRoot != null) {
+	          newMapping.source = util.relative(sourceRoot, newMapping.source);
+	        }
+
+	        newMapping.original = {
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        };
+
+	        if (mapping.name != null) {
+	          newMapping.name = mapping.name;
+	        }
+	      }
+
+	      generator.addMapping(newMapping);
+	    });
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var sourceRelative = sourceFile;
+	      if (sourceRoot !== null) {
+	        sourceRelative = util.relative(sourceRoot, sourceFile);
+	      }
+
+	      if (!generator._sources.has(sourceRelative)) {
+	        generator._sources.add(sourceRelative);
+	      }
+
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        generator.setSourceContent(sourceFile, content);
+	      }
+	    });
+	    return generator;
+	  };
+
+	/**
+	 * Add a single mapping from original source line and column to the generated
+	 * source's line and column for this source map being created. The mapping
+	 * object should have the following properties:
+	 *
+	 *   - generated: An object with the generated line and column positions.
+	 *   - original: An object with the original line and column positions.
+	 *   - source: The original source file (relative to the sourceRoot).
+	 *   - name: An optional original token name for this mapping.
+	 */
+	SourceMapGenerator.prototype.addMapping =
+	  function SourceMapGenerator_addMapping(aArgs) {
+	    var generated = util.getArg(aArgs, 'generated');
+	    var original = util.getArg(aArgs, 'original', null);
+	    var source = util.getArg(aArgs, 'source', null);
+	    var name = util.getArg(aArgs, 'name', null);
+
+	    if (!this._skipValidation) {
+	      this._validateMapping(generated, original, source, name);
+	    }
+
+	    if (source != null) {
+	      source = String(source);
+	      if (!this._sources.has(source)) {
+	        this._sources.add(source);
+	      }
+	    }
+
+	    if (name != null) {
+	      name = String(name);
+	      if (!this._names.has(name)) {
+	        this._names.add(name);
+	      }
+	    }
+
+	    this._mappings.add({
+	      generatedLine: generated.line,
+	      generatedColumn: generated.column,
+	      originalLine: original != null && original.line,
+	      originalColumn: original != null && original.column,
+	      source: source,
+	      name: name
+	    });
+	  };
+
+	/**
+	 * Set the source content for a source file.
+	 */
+	SourceMapGenerator.prototype.setSourceContent =
+	  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+	    var source = aSourceFile;
+	    if (this._sourceRoot != null) {
+	      source = util.relative(this._sourceRoot, source);
+	    }
+
+	    if (aSourceContent != null) {
+	      // Add the source content to the _sourcesContents map.
+	      // Create a new _sourcesContents map if the property is null.
+	      if (!this._sourcesContents) {
+	        this._sourcesContents = Object.create(null);
+	      }
+	      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+	    } else if (this._sourcesContents) {
+	      // Remove the source file from the _sourcesContents map.
+	      // If the _sourcesContents map is empty, set the property to null.
+	      delete this._sourcesContents[util.toSetString(source)];
+	      if (Object.keys(this._sourcesContents).length === 0) {
+	        this._sourcesContents = null;
+	      }
+	    }
+	  };
+
+	/**
+	 * Applies the mappings of a sub-source-map for a specific source file to the
+	 * source map being generated. Each mapping to the supplied source file is
+	 * rewritten using the supplied source map. Note: The resolution for the
+	 * resulting mappings is the minimium of this map and the supplied map.
+	 *
+	 * @param aSourceMapConsumer The source map to be applied.
+	 * @param aSourceFile Optional. The filename of the source file.
+	 *        If omitted, SourceMapConsumer's file property will be used.
+	 * @param aSourceMapPath Optional. The dirname of the path to the source map
+	 *        to be applied. If relative, it is relative to the SourceMapConsumer.
+	 *        This parameter is needed when the two source maps aren't in the same
+	 *        directory, and the source map to be applied contains relative source
+	 *        paths. If so, those relative source paths need to be rewritten
+	 *        relative to the SourceMapGenerator.
+	 */
+	SourceMapGenerator.prototype.applySourceMap =
+	  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+	    var sourceFile = aSourceFile;
+	    // If aSourceFile is omitted, we will use the file property of the SourceMap
+	    if (aSourceFile == null) {
+	      if (aSourceMapConsumer.file == null) {
+	        throw new Error(
+	          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+	          'or the source map\'s "file" property. Both were omitted.'
+	        );
+	      }
+	      sourceFile = aSourceMapConsumer.file;
+	    }
+	    var sourceRoot = this._sourceRoot;
+	    // Make "sourceFile" relative if an absolute Url is passed.
+	    if (sourceRoot != null) {
+	      sourceFile = util.relative(sourceRoot, sourceFile);
+	    }
+	    // Applying the SourceMap can add and remove items from the sources and
+	    // the names array.
+	    var newSources = new ArraySet();
+	    var newNames = new ArraySet();
+
+	    // Find mappings for the "sourceFile"
+	    this._mappings.unsortedForEach(function (mapping) {
+	      if (mapping.source === sourceFile && mapping.originalLine != null) {
+	        // Check if it can be mapped by the source map, then update the mapping.
+	        var original = aSourceMapConsumer.originalPositionFor({
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        });
+	        if (original.source != null) {
+	          // Copy mapping
+	          mapping.source = original.source;
+	          if (aSourceMapPath != null) {
+	            mapping.source = util.join(aSourceMapPath, mapping.source)
+	          }
+	          if (sourceRoot != null) {
+	            mapping.source = util.relative(sourceRoot, mapping.source);
+	          }
+	          mapping.originalLine = original.line;
+	          mapping.originalColumn = original.column;
+	          if (original.name != null) {
+	            mapping.name = original.name;
+	          }
+	        }
+	      }
+
+	      var source = mapping.source;
+	      if (source != null && !newSources.has(source)) {
+	        newSources.add(source);
+	      }
+
+	      var name = mapping.name;
+	      if (name != null && !newNames.has(name)) {
+	        newNames.add(name);
+	      }
+
+	    }, this);
+	    this._sources = newSources;
+	    this._names = newNames;
+
+	    // Copy sourcesContents of applied map.
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aSourceMapPath != null) {
+	          sourceFile = util.join(aSourceMapPath, sourceFile);
+	        }
+	        if (sourceRoot != null) {
+	          sourceFile = util.relative(sourceRoot, sourceFile);
+	        }
+	        this.setSourceContent(sourceFile, content);
+	      }
+	    }, this);
+	  };
+
+	/**
+	 * A mapping can have one of the three levels of data:
+	 *
+	 *   1. Just the generated position.
+	 *   2. The Generated position, original position, and original source.
+	 *   3. Generated and original position, original source, as well as a name
+	 *      token.
+	 *
+	 * To maintain consistency, we validate that any new mapping being added falls
+	 * in to one of these categories.
+	 */
+	SourceMapGenerator.prototype._validateMapping =
+	  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+	                                              aName) {
+	    // When aOriginal is truthy but has empty values for .line and .column,
+	    // it is most likely a programmer error. In this case we throw a very
+	    // specific error message to try to guide them the right way.
+	    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+	    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+	        throw new Error(
+	            'original.line and original.column are not numbers -- you probably meant to omit ' +
+	            'the original mapping entirely and only map the generated position. If so, pass ' +
+	            'null for the original mapping instead of an object with empty or null values.'
+	        );
+	    }
+
+	    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	        && aGenerated.line > 0 && aGenerated.column >= 0
+	        && !aOriginal && !aSource && !aName) {
+	      // Case 1.
+	      return;
+	    }
+	    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+	             && aGenerated.line > 0 && aGenerated.column >= 0
+	             && aOriginal.line > 0 && aOriginal.column >= 0
+	             && aSource) {
+	      // Cases 2 and 3.
+	      return;
+	    }
+	    else {
+	      throw new Error('Invalid mapping: ' + JSON.stringify({
+	        generated: aGenerated,
+	        source: aSource,
+	        original: aOriginal,
+	        name: aName
+	      }));
+	    }
+	  };
+
+	/**
+	 * Serialize the accumulated mappings in to the stream of base 64 VLQs
+	 * specified by the source map format.
+	 */
+	SourceMapGenerator.prototype._serializeMappings =
+	  function SourceMapGenerator_serializeMappings() {
+	    var previousGeneratedColumn = 0;
+	    var previousGeneratedLine = 1;
+	    var previousOriginalColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousName = 0;
+	    var previousSource = 0;
+	    var result = '';
+	    var next;
+	    var mapping;
+	    var nameIdx;
+	    var sourceIdx;
+
+	    var mappings = this._mappings.toArray();
+	    for (var i = 0, len = mappings.length; i < len; i++) {
+	      mapping = mappings[i];
+	      next = ''
+
+	      if (mapping.generatedLine !== previousGeneratedLine) {
+	        previousGeneratedColumn = 0;
+	        while (mapping.generatedLine !== previousGeneratedLine) {
+	          next += ';';
+	          previousGeneratedLine++;
+	        }
+	      }
+	      else {
+	        if (i > 0) {
+	          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+	            continue;
+	          }
+	          next += ',';
+	        }
+	      }
+
+	      next += base64VLQ.encode(mapping.generatedColumn
+	                                 - previousGeneratedColumn);
+	      previousGeneratedColumn = mapping.generatedColumn;
+
+	      if (mapping.source != null) {
+	        sourceIdx = this._sources.indexOf(mapping.source);
+	        next += base64VLQ.encode(sourceIdx - previousSource);
+	        previousSource = sourceIdx;
+
+	        // lines are stored 0-based in SourceMap spec version 3
+	        next += base64VLQ.encode(mapping.originalLine - 1
+	                                   - previousOriginalLine);
+	        previousOriginalLine = mapping.originalLine - 1;
+
+	        next += base64VLQ.encode(mapping.originalColumn
+	                                   - previousOriginalColumn);
+	        previousOriginalColumn = mapping.originalColumn;
+
+	        if (mapping.name != null) {
+	          nameIdx = this._names.indexOf(mapping.name);
+	          next += base64VLQ.encode(nameIdx - previousName);
+	          previousName = nameIdx;
+	        }
+	      }
+
+	      result += next;
+	    }
+
+	    return result;
+	  };
+
+	SourceMapGenerator.prototype._generateSourcesContent =
+	  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+	    return aSources.map(function (source) {
+	      if (!this._sourcesContents) {
+	        return null;
+	      }
+	      if (aSourceRoot != null) {
+	        source = util.relative(aSourceRoot, source);
+	      }
+	      var key = util.toSetString(source);
+	      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+	        ? this._sourcesContents[key]
+	        : null;
+	    }, this);
+	  };
+
+	/**
+	 * Externalize the source map.
+	 */
+	SourceMapGenerator.prototype.toJSON =
+	  function SourceMapGenerator_toJSON() {
+	    var map = {
+	      version: this._version,
+	      sources: this._sources.toArray(),
+	      names: this._names.toArray(),
+	      mappings: this._serializeMappings()
+	    };
+	    if (this._file != null) {
+	      map.file = this._file;
+	    }
+	    if (this._sourceRoot != null) {
+	      map.sourceRoot = this._sourceRoot;
+	    }
+	    if (this._sourcesContents) {
+	      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+	    }
+
+	    return map;
+	  };
+
+	/**
+	 * Render the source map being generated to a string.
+	 */
+	SourceMapGenerator.prototype.toString =
+	  function SourceMapGenerator_toString() {
+	    return JSON.stringify(this.toJSON());
+	  };
+
+	exports.SourceMapGenerator = SourceMapGenerator;
+
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 *
+	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+	 *
+	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+	 * Redistribution and use in source and binary forms, with or without
+	 * modification, are permitted provided that the following conditions are
+	 * met:
+	 *
+	 *  * Redistributions of source code must retain the above copyright
+	 *    notice, this list of conditions and the following disclaimer.
+	 *  * Redistributions in binary form must reproduce the above
+	 *    copyright notice, this list of conditions and the following
+	 *    disclaimer in the documentation and/or other materials provided
+	 *    with the distribution.
+	 *  * Neither the name of Google Inc. nor the names of its
+	 *    contributors may be used to endorse or promote products derived
+	 *    from this software without specific prior written permission.
+	 *
+	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	 */
+
+	var base64 = __webpack_require__(3);
+
+	// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+	// length quantities we use in the source map spec, the first bit is the sign,
+	// the next four bits are the actual value, and the 6th bit is the
+	// continuation bit. The continuation bit tells us whether there are more
+	// digits in this value following this digit.
+	//
+	//   Continuation
+	//   |    Sign
+	//   |    |
+	//   V    V
+	//   101011
+
+	var VLQ_BASE_SHIFT = 5;
+
+	// binary: 100000
+	var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+	// binary: 011111
+	var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+	// binary: 100000
+	var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+	/**
+	 * Converts from a two-complement value to a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	 */
+	function toVLQSigned(aValue) {
+	  return aValue < 0
+	    ? ((-aValue) << 1) + 1
+	    : (aValue << 1) + 0;
+	}
+
+	/**
+	 * Converts to a two-complement value from a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+	 *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+	 */
+	function fromVLQSigned(aValue) {
+	  var isNegative = (aValue & 1) === 1;
+	  var shifted = aValue >> 1;
+	  return isNegative
+	    ? -shifted
+	    : shifted;
+	}
+
+	/**
+	 * Returns the base 64 VLQ encoded value.
+	 */
+	exports.encode = function base64VLQ_encode(aValue) {
+	  var encoded = "";
+	  var digit;
+
+	  var vlq = toVLQSigned(aValue);
+
+	  do {
+	    digit = vlq & VLQ_BASE_MASK;
+	    vlq >>>= VLQ_BASE_SHIFT;
+	    if (vlq > 0) {
+	      // There are still more digits in this value, so we must make sure the
+	      // continuation bit is marked.
+	      digit |= VLQ_CONTINUATION_BIT;
+	    }
+	    encoded += base64.encode(digit);
+	  } while (vlq > 0);
+
+	  return encoded;
+	};
+
+	/**
+	 * Decodes the next base 64 VLQ value from the given string and returns the
+	 * value and the rest of the string via the out parameter.
+	 */
+	exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+	  var strLen = aStr.length;
+	  var result = 0;
+	  var shift = 0;
+	  var continuation, digit;
+
+	  do {
+	    if (aIndex >= strLen) {
+	      throw new Error("Expected more digits in base 64 VLQ value.");
+	    }
+
+	    digit = base64.decode(aStr.charCodeAt(aIndex++));
+	    if (digit === -1) {
+	      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+	    }
+
+	    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+	    digit &= VLQ_BASE_MASK;
+	    result = result + (digit << shift);
+	    shift += VLQ_BASE_SHIFT;
+	  } while (continuation);
+
+	  aOutParam.value = fromVLQSigned(result);
+	  aOutParam.rest = aIndex;
+	};
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+
+	/**
+	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+	 */
+	exports.encode = function (number) {
+	  if (0 <= number && number < intToCharMap.length) {
+	    return intToCharMap[number];
+	  }
+	  throw new TypeError("Must be between 0 and 63: " + number);
+	};
+
+	/**
+	 * Decode a single base 64 character code digit to an integer. Returns -1 on
+	 * failure.
+	 */
+	exports.decode = function (charCode) {
+	  var bigA = 65;     // 'A'
+	  var bigZ = 90;     // 'Z'
+
+	  var littleA = 97;  // 'a'
+	  var littleZ = 122; // 'z'
+
+	  var zero = 48;     // '0'
+	  var nine = 57;     // '9'
+
+	  var plus = 43;     // '+'
+	  var slash = 47;    // '/'
+
+	  var littleOffset = 26;
+	  var numberOffset = 52;
+
+	  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+	  if (bigA <= charCode && charCode <= bigZ) {
+	    return (charCode - bigA);
+	  }
+
+	  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+	  if (littleA <= charCode && charCode <= littleZ) {
+	    return (charCode - littleA + littleOffset);
+	  }
+
+	  // 52 - 61: 0123456789
+	  if (zero <= charCode && charCode <= nine) {
+	    return (charCode - zero + numberOffset);
+	  }
+
+	  // 62: +
+	  if (charCode == plus) {
+	    return 62;
+	  }
+
+	  // 63: /
+	  if (charCode == slash) {
+	    return 63;
+	  }
+
+	  // Invalid base64 digit.
+	  return -1;
+	};
+
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	/**
+	 * This is a helper function for getting values from parameter/options
+	 * objects.
+	 *
+	 * @param args The object we are extracting values from
+	 * @param name The name of the property we are getting.
+	 * @param defaultValue An optional value to return if the property is missing
+	 * from the object. If this is not specified and the property is missing, an
+	 * error will be thrown.
+	 */
+	function getArg(aArgs, aName, aDefaultValue) {
+	  if (aName in aArgs) {
+	    return aArgs[aName];
+	  } else if (arguments.length === 3) {
+	    return aDefaultValue;
+	  } else {
+	    throw new Error('"' + aName + '" is a required argument.');
+	  }
+	}
+	exports.getArg = getArg;
+
+	var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+	var dataUrlRegexp = /^data:.+\,.+$/;
+
+	function urlParse(aUrl) {
+	  var match = aUrl.match(urlRegexp);
+	  if (!match) {
+	    return null;
+	  }
+	  return {
+	    scheme: match[1],
+	    auth: match[2],
+	    host: match[3],
+	    port: match[4],
+	    path: match[5]
+	  };
+	}
+	exports.urlParse = urlParse;
+
+	function urlGenerate(aParsedUrl) {
+	  var url = '';
+	  if (aParsedUrl.scheme) {
+	    url += aParsedUrl.scheme + ':';
+	  }
+	  url += '//';
+	  if (aParsedUrl.auth) {
+	    url += aParsedUrl.auth + '@';
+	  }
+	  if (aParsedUrl.host) {
+	    url += aParsedUrl.host;
+	  }
+	  if (aParsedUrl.port) {
+	    url += ":" + aParsedUrl.port
+	  }
+	  if (aParsedUrl.path) {
+	    url += aParsedUrl.path;
+	  }
+	  return url;
+	}
+	exports.urlGenerate = urlGenerate;
+
+	/**
+	 * Normalizes a path, or the path portion of a URL:
+	 *
+	 * - Replaces consecutive slashes with one slash.
+	 * - Removes unnecessary '.' parts.
+	 * - Removes unnecessary '<dir>/..' parts.
+	 *
+	 * Based on code in the Node.js 'path' core module.
+	 *
+	 * @param aPath The path or url to normalize.
+	 */
+	function normalize(aPath) {
+	  var path = aPath;
+	  var url = urlParse(aPath);
+	  if (url) {
+	    if (!url.path) {
+	      return aPath;
+	    }
+	    path = url.path;
+	  }
+	  var isAbsolute = exports.isAbsolute(path);
+
+	  var parts = path.split(/\/+/);
+	  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+	    part = parts[i];
+	    if (part === '.') {
+	      parts.splice(i, 1);
+	    } else if (part === '..') {
+	      up++;
+	    } else if (up > 0) {
+	      if (part === '') {
+	        // The first part is blank if the path is absolute. Trying to go
+	        // above the root is a no-op. Therefore we can remove all '..' parts
+	        // directly after the root.
+	        parts.splice(i + 1, up);
+	        up = 0;
+	      } else {
+	        parts.splice(i, 2);
+	        up--;
+	      }
+	    }
+	  }
+	  path = parts.join('/');
+
+	  if (path === '') {
+	    path = isAbsolute ? '/' : '.';
+	  }
+
+	  if (url) {
+	    url.path = path;
+	    return urlGenerate(url);
+	  }
+	  return path;
+	}
+	exports.normalize = normalize;
+
+	/**
+	 * Joins two paths/URLs.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be joined with the root.
+	 *
+	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+	 *   first.
+	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+	 *   is updated with the result and aRoot is returned. Otherwise the result
+	 *   is returned.
+	 *   - If aPath is absolute, the result is aPath.
+	 *   - Otherwise the two paths are joined with a slash.
+	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+	 */
+	function join(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	  if (aPath === "") {
+	    aPath = ".";
+	  }
+	  var aPathUrl = urlParse(aPath);
+	  var aRootUrl = urlParse(aRoot);
+	  if (aRootUrl) {
+	    aRoot = aRootUrl.path || '/';
+	  }
+
+	  // `join(foo, '//www.example.org')`
+	  if (aPathUrl && !aPathUrl.scheme) {
+	    if (aRootUrl) {
+	      aPathUrl.scheme = aRootUrl.scheme;
+	    }
+	    return urlGenerate(aPathUrl);
+	  }
+
+	  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+	    return aPath;
+	  }
+
+	  // `join('http://', 'www.example.com')`
+	  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+	    aRootUrl.host = aPath;
+	    return urlGenerate(aRootUrl);
+	  }
+
+	  var joined = aPath.charAt(0) === '/'
+	    ? aPath
+	    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+
+	  if (aRootUrl) {
+	    aRootUrl.path = joined;
+	    return urlGenerate(aRootUrl);
+	  }
+	  return joined;
+	}
+	exports.join = join;
+
+	exports.isAbsolute = function (aPath) {
+	  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+	};
+
+	/**
+	 * Make a path relative to a URL or another path.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be made relative to aRoot.
+	 */
+	function relative(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+
+	  aRoot = aRoot.replace(/\/$/, '');
+
+	  // It is possible for the path to be above the root. In this case, simply
+	  // checking whether the root is a prefix of the path won't work. Instead, we
+	  // need to remove components from the root one by one, until either we find
+	  // a prefix that fits, or we run out of components to remove.
+	  var level = 0;
+	  while (aPath.indexOf(aRoot + '/') !== 0) {
+	    var index = aRoot.lastIndexOf("/");
+	    if (index < 0) {
+	      return aPath;
+	    }
+
+	    // If the only part of the root that is left is the scheme (i.e. http://,
+	    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+	    // have exhausted all components, so the path is not relative to the root.
+	    aRoot = aRoot.slice(0, index);
+	    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+	      return aPath;
+	    }
+
+	    ++level;
+	  }
+
+	  // Make sure we add a "../" for each component we removed from the root.
+	  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+	}
+	exports.relative = relative;
+
+	var supportsNullProto = (function () {
+	  var obj = Object.create(null);
+	  return !('__proto__' in obj);
+	}());
+
+	function identity (s) {
+	  return s;
+	}
+
+	/**
+	 * Because behavior goes wacky when you set `__proto__` on objects, we
+	 * have to prefix all the strings in our set with an arbitrary character.
+	 *
+	 * See https://github.com/mozilla/source-map/pull/31 and
+	 * https://github.com/mozilla/source-map/issues/30
+	 *
+	 * @param String aStr
+	 */
+	function toSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return '$' + aStr;
+	  }
+
+	  return aStr;
+	}
+	exports.toSetString = supportsNullProto ? identity : toSetString;
+
+	function fromSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return aStr.slice(1);
+	  }
+
+	  return aStr;
+	}
+	exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+	function isProtoString(s) {
+	  if (!s) {
+	    return false;
+	  }
+
+	  var length = s.length;
+
+	  if (length < 9 /* "__proto__".length */) {
+	    return false;
+	  }
+
+	  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+	      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+	      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+	      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+	    return false;
+	  }
+
+	  for (var i = length - 10; i >= 0; i--) {
+	    if (s.charCodeAt(i) !== 36 /* '$' */) {
+	      return false;
+	    }
+	  }
+
+	  return true;
+	}
+
+	/**
+	 * Comparator between two mappings where the original positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same original source/line/column, but different generated
+	 * line and column the same. Useful when searching for a mapping with a
+	 * stubbed out mapping.
+	 */
+	function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+	  var cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0 || onlyCompareOriginal) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositions = compareByOriginalPositions;
+
+	/**
+	 * Comparator between two mappings with deflated source and name indices where
+	 * the generated positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same generated line and column, but different
+	 * source/name/original line and column the same. Useful when searching for a
+	 * mapping with a stubbed out mapping.
+	 */
+	function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0 || onlyCompareGenerated) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+	function strcmp(aStr1, aStr2) {
+	  if (aStr1 === aStr2) {
+	    return 0;
+	  }
+
+	  if (aStr1 === null) {
+	    return 1; // aStr2 !== null
+	  }
+
+	  if (aStr2 === null) {
+	    return -1; // aStr1 !== null
+	  }
+
+	  if (aStr1 > aStr2) {
+	    return 1;
+	  }
+
+	  return -1;
+	}
+
+	/**
+	 * Comparator between two mappings with inflated source and name strings where
+	 * the generated positions are compared.
+	 */
+	function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+	/**
+	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+	 * in the source maps specification), and then parse the string as
+	 * JSON.
+	 */
+	function parseSourceMapInput(str) {
+	  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+	}
+	exports.parseSourceMapInput = parseSourceMapInput;
+
+	/**
+	 * Compute the URL of a source given the the source root, the source's
+	 * URL, and the source map's URL.
+	 */
+	function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+	  sourceURL = sourceURL || '';
+
+	  if (sourceRoot) {
+	    // This follows what Chrome does.
+	    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+	      sourceRoot += '/';
+	    }
+	    // The spec says:
+	    //   Line 4: An optional source root, useful for relocating source
+	    //   files on a server or removing repeated values in the
+	    //   “sources” entry.  This value is prepended to the individual
+	    //   entries in the “source” field.
+	    sourceURL = sourceRoot + sourceURL;
+	  }
+
+	  // Historically, SourceMapConsumer did not take the sourceMapURL as
+	  // a parameter.  This mode is still somewhat supported, which is why
+	  // this code block is conditional.  However, it's preferable to pass
+	  // the source map URL to SourceMapConsumer, so that this function
+	  // can implement the source URL resolution algorithm as outlined in
+	  // the spec.  This block is basically the equivalent of:
+	  //    new URL(sourceURL, sourceMapURL).toString()
+	  // ... except it avoids using URL, which wasn't available in the
+	  // older releases of node still supported by this library.
+	  //
+	  // The spec says:
+	  //   If the sources are not absolute URLs after prepending of the
+	  //   “sourceRoot”, the sources are resolved relative to the
+	  //   SourceMap (like resolving script src in a html document).
+	  if (sourceMapURL) {
+	    var parsed = urlParse(sourceMapURL);
+	    if (!parsed) {
+	      throw new Error("sourceMapURL could not be parsed");
+	    }
+	    if (parsed.path) {
+	      // Strip the last path component, but keep the "/".
+	      var index = parsed.path.lastIndexOf('/');
+	      if (index >= 0) {
+	        parsed.path = parsed.path.substring(0, index + 1);
+	      }
+	    }
+	    sourceURL = join(urlGenerate(parsed), sourceURL);
+	  }
+
+	  return normalize(sourceURL);
+	}
+	exports.computeSourceURL = computeSourceURL;
+
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var util = __webpack_require__(4);
+	var has = Object.prototype.hasOwnProperty;
+	var hasNativeMap = typeof Map !== "undefined";
+
+	/**
+	 * A data structure which is a combination of an array and a set. Adding a new
+	 * member is O(1), testing for membership is O(1), and finding the index of an
+	 * element is O(1). Removing elements from the set is not supported. Only
+	 * strings are supported for membership.
+	 */
+	function ArraySet() {
+	  this._array = [];
+	  this._set = hasNativeMap ? new Map() : Object.create(null);
+	}
+
+	/**
+	 * Static method for creating ArraySet instances from an existing array.
+	 */
+	ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+	  var set = new ArraySet();
+	  for (var i = 0, len = aArray.length; i < len; i++) {
+	    set.add(aArray[i], aAllowDuplicates);
+	  }
+	  return set;
+	};
+
+	/**
+	 * Return how many unique items are in this ArraySet. If duplicates have been
+	 * added, than those do not count towards the size.
+	 *
+	 * @returns Number
+	 */
+	ArraySet.prototype.size = function ArraySet_size() {
+	  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+	};
+
+	/**
+	 * Add the given string to this set.
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+	  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+	  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+	  var idx = this._array.length;
+	  if (!isDuplicate || aAllowDuplicates) {
+	    this._array.push(aStr);
+	  }
+	  if (!isDuplicate) {
+	    if (hasNativeMap) {
+	      this._set.set(aStr, idx);
+	    } else {
+	      this._set[sStr] = idx;
+	    }
+	  }
+	};
+
+	/**
+	 * Is the given string a member of this set?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.has = function ArraySet_has(aStr) {
+	  if (hasNativeMap) {
+	    return this._set.has(aStr);
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    return has.call(this._set, sStr);
+	  }
+	};
+
+	/**
+	 * What is the index of the given string in the array?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+	  if (hasNativeMap) {
+	    var idx = this._set.get(aStr);
+	    if (idx >= 0) {
+	        return idx;
+	    }
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    if (has.call(this._set, sStr)) {
+	      return this._set[sStr];
+	    }
+	  }
+
+	  throw new Error('"' + aStr + '" is not in the set.');
+	};
+
+	/**
+	 * What is the element at the given index?
+	 *
+	 * @param Number aIdx
+	 */
+	ArraySet.prototype.at = function ArraySet_at(aIdx) {
+	  if (aIdx >= 0 && aIdx < this._array.length) {
+	    return this._array[aIdx];
+	  }
+	  throw new Error('No element indexed by ' + aIdx);
+	};
+
+	/**
+	 * Returns the array representation of this set (which has the proper indices
+	 * indicated by indexOf). Note that this is a copy of the internal array used
+	 * for storing the members so that no one can mess with internal state.
+	 */
+	ArraySet.prototype.toArray = function ArraySet_toArray() {
+	  return this._array.slice();
+	};
+
+	exports.ArraySet = ArraySet;
+
+
+/***/ }),
+/* 6 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2014 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var util = __webpack_require__(4);
+
+	/**
+	 * Determine whether mappingB is after mappingA with respect to generated
+	 * position.
+	 */
+	function generatedPositionAfter(mappingA, mappingB) {
+	  // Optimized for most common case
+	  var lineA = mappingA.generatedLine;
+	  var lineB = mappingB.generatedLine;
+	  var columnA = mappingA.generatedColumn;
+	  var columnB = mappingB.generatedColumn;
+	  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+	         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+	}
+
+	/**
+	 * A data structure to provide a sorted view of accumulated mappings in a
+	 * performance conscious manner. It trades a neglibable overhead in general
+	 * case for a large speedup in case of mappings being added in order.
+	 */
+	function MappingList() {
+	  this._array = [];
+	  this._sorted = true;
+	  // Serves as infimum
+	  this._last = {generatedLine: -1, generatedColumn: 0};
+	}
+
+	/**
+	 * Iterate through internal items. This method takes the same arguments that
+	 * `Array.prototype.forEach` takes.
+	 *
+	 * NOTE: The order of the mappings is NOT guaranteed.
+	 */
+	MappingList.prototype.unsortedForEach =
+	  function MappingList_forEach(aCallback, aThisArg) {
+	    this._array.forEach(aCallback, aThisArg);
+	  };
+
+	/**
+	 * Add the given source mapping.
+	 *
+	 * @param Object aMapping
+	 */
+	MappingList.prototype.add = function MappingList_add(aMapping) {
+	  if (generatedPositionAfter(this._last, aMapping)) {
+	    this._last = aMapping;
+	    this._array.push(aMapping);
+	  } else {
+	    this._sorted = false;
+	    this._array.push(aMapping);
+	  }
+	};
+
+	/**
+	 * Returns the flat, sorted array of mappings. The mappings are sorted by
+	 * generated position.
+	 *
+	 * WARNING: This method returns internal data without copying, for
+	 * performance. The return value must NOT be mutated, and should be treated as
+	 * an immutable borrow. If you want to take ownership, you must make your own
+	 * copy.
+	 */
+	MappingList.prototype.toArray = function MappingList_toArray() {
+	  if (!this._sorted) {
+	    this._array.sort(util.compareByGeneratedPositionsInflated);
+	    this._sorted = true;
+	  }
+	  return this._array;
+	};
+
+	exports.MappingList = MappingList;
+
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var util = __webpack_require__(4);
+	var binarySearch = __webpack_require__(8);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var base64VLQ = __webpack_require__(2);
+	var quickSort = __webpack_require__(9).quickSort;
+
+	function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  return sourceMap.sections != null
+	    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+	    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+	}
+
+	SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+	  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+	}
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	SourceMapConsumer.prototype._version = 3;
+
+	// `__generatedMappings` and `__originalMappings` are arrays that hold the
+	// parsed mapping coordinates from the source map's "mappings" attribute. They
+	// are lazily instantiated, accessed via the `_generatedMappings` and
+	// `_originalMappings` getters respectively, and we only parse the mappings
+	// and create these arrays once queried for a source location. We jump through
+	// these hoops because there can be many thousands of mappings, and parsing
+	// them is expensive, so we only want to do it if we must.
+	//
+	// Each object in the arrays is of the form:
+	//
+	//     {
+	//       generatedLine: The line number in the generated code,
+	//       generatedColumn: The column number in the generated code,
+	//       source: The path to the original source file that generated this
+	//               chunk of code,
+	//       originalLine: The line number in the original source that
+	//                     corresponds to this chunk of generated code,
+	//       originalColumn: The column number in the original source that
+	//                       corresponds to this chunk of generated code,
+	//       name: The name of the original symbol which generated this chunk of
+	//             code.
+	//     }
+	//
+	// All properties except for `generatedLine` and `generatedColumn` can be
+	// `null`.
+	//
+	// `_generatedMappings` is ordered by the generated positions.
+	//
+	// `_originalMappings` is ordered by the original positions.
+
+	SourceMapConsumer.prototype.__generatedMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__generatedMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__generatedMappings;
+	  }
+	});
+
+	SourceMapConsumer.prototype.__originalMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__originalMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__originalMappings;
+	  }
+	});
+
+	SourceMapConsumer.prototype._charIsMappingSeparator =
+	  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+	    var c = aStr.charAt(index);
+	    return c === ";" || c === ",";
+	  };
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	SourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    throw new Error("Subclasses must implement _parseMappings");
+	  };
+
+	SourceMapConsumer.GENERATED_ORDER = 1;
+	SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+	SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+	SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * Iterate over each mapping between an original source/line/column and a
+	 * generated line/column in this source map.
+	 *
+	 * @param Function aCallback
+	 *        The function that is called with each mapping.
+	 * @param Object aContext
+	 *        Optional. If specified, this object will be the value of `this` every
+	 *        time that `aCallback` is called.
+	 * @param aOrder
+	 *        Either `SourceMapConsumer.GENERATED_ORDER` or
+	 *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+	 *        iterate over the mappings sorted by the generated file's line/column
+	 *        order or the original's source/line/column order, respectively. Defaults to
+	 *        `SourceMapConsumer.GENERATED_ORDER`.
+	 */
+	SourceMapConsumer.prototype.eachMapping =
+	  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+	    var context = aContext || null;
+	    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+	    var mappings;
+	    switch (order) {
+	    case SourceMapConsumer.GENERATED_ORDER:
+	      mappings = this._generatedMappings;
+	      break;
+	    case SourceMapConsumer.ORIGINAL_ORDER:
+	      mappings = this._originalMappings;
+	      break;
+	    default:
+	      throw new Error("Unknown order of iteration.");
+	    }
+
+	    var sourceRoot = this.sourceRoot;
+	    mappings.map(function (mapping) {
+	      var source = mapping.source === null ? null : this._sources.at(mapping.source);
+	      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+	      return {
+	        source: source,
+	        generatedLine: mapping.generatedLine,
+	        generatedColumn: mapping.generatedColumn,
+	        originalLine: mapping.originalLine,
+	        originalColumn: mapping.originalColumn,
+	        name: mapping.name === null ? null : this._names.at(mapping.name)
+	      };
+	    }, this).forEach(aCallback, context);
+	  };
+
+	/**
+	 * Returns all generated line and column information for the original source,
+	 * line, and column provided. If no column is provided, returns all mappings
+	 * corresponding to a either the line we are searching for or the next
+	 * closest line that has any mappings. Otherwise, returns all mappings
+	 * corresponding to the given line and either the column we are searching for
+	 * or the next closest column that has any offsets.
+	 *
+	 * The only argument is an object with the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number is 1-based.
+	 *   - column: Optional. the column number in the original source.
+	 *    The column number is 0-based.
+	 *
+	 * and an array of objects is returned, each with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *    line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *    The column number is 0-based.
+	 */
+	SourceMapConsumer.prototype.allGeneratedPositionsFor =
+	  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+	    var line = util.getArg(aArgs, 'line');
+
+	    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+	    // returns the index of the closest mapping less than the needle. By
+	    // setting needle.originalColumn to 0, we thus find the last mapping for
+	    // the given line, provided such a mapping exists.
+	    var needle = {
+	      source: util.getArg(aArgs, 'source'),
+	      originalLine: line,
+	      originalColumn: util.getArg(aArgs, 'column', 0)
+	    };
+
+	    needle.source = this._findSourceIndex(needle.source);
+	    if (needle.source < 0) {
+	      return [];
+	    }
+
+	    var mappings = [];
+
+	    var index = this._findMapping(needle,
+	                                  this._originalMappings,
+	                                  "originalLine",
+	                                  "originalColumn",
+	                                  util.compareByOriginalPositions,
+	                                  binarySearch.LEAST_UPPER_BOUND);
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+
+	      if (aArgs.column === undefined) {
+	        var originalLine = mapping.originalLine;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we found. Since
+	        // mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we found.
+	        while (mapping && mapping.originalLine === originalLine) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      } else {
+	        var originalColumn = mapping.originalColumn;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we were searching for.
+	        // Since mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we are searching for.
+	        while (mapping &&
+	               mapping.originalLine === line &&
+	               mapping.originalColumn == originalColumn) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      }
+	    }
+
+	    return mappings;
+	  };
+
+	exports.SourceMapConsumer = SourceMapConsumer;
+
+	/**
+	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+	 * query for information about the original file positions by giving it a file
+	 * position in the generated source.
+	 *
+	 * The first parameter is the raw source map (either as a JSON string, or
+	 * already parsed to an object). According to the spec, source maps have the
+	 * following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - sources: An array of URLs to the original source files.
+	 *   - names: An array of identifiers which can be referrenced by individual mappings.
+	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+	 *   - sourcesContent: Optional. An array of contents of the original source files.
+	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *
+	 * Here is an example source map, taken from the source map spec[0]:
+	 *
+	 *     {
+	 *       version : 3,
+	 *       file: "out.js",
+	 *       sourceRoot : "",
+	 *       sources: ["foo.js", "bar.js"],
+	 *       names: ["src", "maps", "are", "fun"],
+	 *       mappings: "AA,AB;;ABCDE;"
+	 *     }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+	 */
+	function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  var version = util.getArg(sourceMap, 'version');
+	  var sources = util.getArg(sourceMap, 'sources');
+	  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+	  // requires the array) to play nice here.
+	  var names = util.getArg(sourceMap, 'names', []);
+	  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+	  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+	  var mappings = util.getArg(sourceMap, 'mappings');
+	  var file = util.getArg(sourceMap, 'file', null);
+
+	  // Once again, Sass deviates from the spec and supplies the version as a
+	  // string rather than a number, so we use loose equality checking here.
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+
+	  if (sourceRoot) {
+	    sourceRoot = util.normalize(sourceRoot);
+	  }
+
+	  sources = sources
+	    .map(String)
+	    // Some source maps produce relative source paths like "./foo.js" instead of
+	    // "foo.js".  Normalize these first so that future comparisons will succeed.
+	    // See bugzil.la/1090768.
+	    .map(util.normalize)
+	    // Always ensure that absolute sources are internally stored relative to
+	    // the source root, if the source root is absolute. Not doing this would
+	    // be particularly problematic when the source root is a prefix of the
+	    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+	    .map(function (source) {
+	      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+	        ? util.relative(sourceRoot, source)
+	        : source;
+	    });
+
+	  // Pass `true` below to allow duplicate names and sources. While source maps
+	  // are intended to be compressed and deduplicated, the TypeScript compiler
+	  // sometimes generates source maps with duplicates in them. See Github issue
+	  // #72 and bugzil.la/889492.
+	  this._names = ArraySet.fromArray(names.map(String), true);
+	  this._sources = ArraySet.fromArray(sources, true);
+
+	  this._absoluteSources = this._sources.toArray().map(function (s) {
+	    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+	  });
+
+	  this.sourceRoot = sourceRoot;
+	  this.sourcesContent = sourcesContent;
+	  this._mappings = mappings;
+	  this._sourceMapURL = aSourceMapURL;
+	  this.file = file;
+	}
+
+	BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+
+	/**
+	 * Utility function to find the index of a source.  Returns -1 if not
+	 * found.
+	 */
+	BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+	  var relativeSource = aSource;
+	  if (this.sourceRoot != null) {
+	    relativeSource = util.relative(this.sourceRoot, relativeSource);
+	  }
+
+	  if (this._sources.has(relativeSource)) {
+	    return this._sources.indexOf(relativeSource);
+	  }
+
+	  // Maybe aSource is an absolute URL as returned by |sources|.  In
+	  // this case we can't simply undo the transform.
+	  var i;
+	  for (i = 0; i < this._absoluteSources.length; ++i) {
+	    if (this._absoluteSources[i] == aSource) {
+	      return i;
+	    }
+	  }
+
+	  return -1;
+	};
+
+	/**
+	 * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+	 *
+	 * @param SourceMapGenerator aSourceMap
+	 *        The source map that will be consumed.
+	 * @param String aSourceMapURL
+	 *        The URL at which the source map can be found (optional)
+	 * @returns BasicSourceMapConsumer
+	 */
+	BasicSourceMapConsumer.fromSourceMap =
+	  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+	    var smc = Object.create(BasicSourceMapConsumer.prototype);
+
+	    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);
+	    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);
+	    smc.sourceRoot = aSourceMap._sourceRoot;
+	    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),
+	                                                            smc.sourceRoot);
+	    smc.file = aSourceMap._file;
+	    smc._sourceMapURL = aSourceMapURL;
+	    smc._absoluteSources = smc._sources.toArray().map(function (s) {
+	      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+	    });
+
+	    // Because we are modifying the entries (by converting string sources and
+	    // names to indices into the sources and names ArraySets), we have to make
+	    // a copy of the entry or else bad things happen. Shared mutable state
+	    // strikes again! See github issue #191.
+
+	    var generatedMappings = aSourceMap._mappings.toArray().slice();
+	    var destGeneratedMappings = smc.__generatedMappings = [];
+	    var destOriginalMappings = smc.__originalMappings = [];
+
+	    for (var i = 0, length = generatedMappings.length; i < length; i++) {
+	      var srcMapping = generatedMappings[i];
+	      var destMapping = new Mapping;
+	      destMapping.generatedLine = srcMapping.generatedLine;
+	      destMapping.generatedColumn = srcMapping.generatedColumn;
+
+	      if (srcMapping.source) {
+	        destMapping.source = sources.indexOf(srcMapping.source);
+	        destMapping.originalLine = srcMapping.originalLine;
+	        destMapping.originalColumn = srcMapping.originalColumn;
+
+	        if (srcMapping.name) {
+	          destMapping.name = names.indexOf(srcMapping.name);
+	        }
+
+	        destOriginalMappings.push(destMapping);
+	      }
+
+	      destGeneratedMappings.push(destMapping);
+	    }
+
+	    quickSort(smc.__originalMappings, util.compareByOriginalPositions);
+
+	    return smc;
+	  };
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	BasicSourceMapConsumer.prototype._version = 3;
+
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    return this._absoluteSources.slice();
+	  }
+	});
+
+	/**
+	 * Provide the JIT with a nice shape / hidden class.
+	 */
+	function Mapping() {
+	  this.generatedLine = 0;
+	  this.generatedColumn = 0;
+	  this.source = null;
+	  this.originalLine = null;
+	  this.originalColumn = null;
+	  this.name = null;
+	}
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	BasicSourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    var generatedLine = 1;
+	    var previousGeneratedColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousOriginalColumn = 0;
+	    var previousSource = 0;
+	    var previousName = 0;
+	    var length = aStr.length;
+	    var index = 0;
+	    var cachedSegments = {};
+	    var temp = {};
+	    var originalMappings = [];
+	    var generatedMappings = [];
+	    var mapping, str, segment, end, value;
+
+	    while (index < length) {
+	      if (aStr.charAt(index) === ';') {
+	        generatedLine++;
+	        index++;
+	        previousGeneratedColumn = 0;
+	      }
+	      else if (aStr.charAt(index) === ',') {
+	        index++;
+	      }
+	      else {
+	        mapping = new Mapping();
+	        mapping.generatedLine = generatedLine;
+
+	        // Because each offset is encoded relative to the previous one,
+	        // many segments often have the same encoding. We can exploit this
+	        // fact by caching the parsed variable length fields of each segment,
+	        // allowing us to avoid a second parse if we encounter the same
+	        // segment again.
+	        for (end = index; end < length; end++) {
+	          if (this._charIsMappingSeparator(aStr, end)) {
+	            break;
+	          }
+	        }
+	        str = aStr.slice(index, end);
+
+	        segment = cachedSegments[str];
+	        if (segment) {
+	          index += str.length;
+	        } else {
+	          segment = [];
+	          while (index < end) {
+	            base64VLQ.decode(aStr, index, temp);
+	            value = temp.value;
+	            index = temp.rest;
+	            segment.push(value);
+	          }
+
+	          if (segment.length === 2) {
+	            throw new Error('Found a source, but no line and column');
+	          }
+
+	          if (segment.length === 3) {
+	            throw new Error('Found a source and line, but no column');
+	          }
+
+	          cachedSegments[str] = segment;
+	        }
+
+	        // Generated column.
+	        mapping.generatedColumn = previousGeneratedColumn + segment[0];
+	        previousGeneratedColumn = mapping.generatedColumn;
+
+	        if (segment.length > 1) {
+	          // Original source.
+	          mapping.source = previousSource + segment[1];
+	          previousSource += segment[1];
+
+	          // Original line.
+	          mapping.originalLine = previousOriginalLine + segment[2];
+	          previousOriginalLine = mapping.originalLine;
+	          // Lines are stored 0-based
+	          mapping.originalLine += 1;
+
+	          // Original column.
+	          mapping.originalColumn = previousOriginalColumn + segment[3];
+	          previousOriginalColumn = mapping.originalColumn;
+
+	          if (segment.length > 4) {
+	            // Original name.
+	            mapping.name = previousName + segment[4];
+	            previousName += segment[4];
+	          }
+	        }
+
+	        generatedMappings.push(mapping);
+	        if (typeof mapping.originalLine === 'number') {
+	          originalMappings.push(mapping);
+	        }
+	      }
+	    }
+
+	    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    this.__generatedMappings = generatedMappings;
+
+	    quickSort(originalMappings, util.compareByOriginalPositions);
+	    this.__originalMappings = originalMappings;
+	  };
+
+	/**
+	 * Find the mapping that best matches the hypothetical "needle" mapping that
+	 * we are searching for in the given "haystack" of mappings.
+	 */
+	BasicSourceMapConsumer.prototype._findMapping =
+	  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
+	                                         aColumnName, aComparator, aBias) {
+	    // To return the position we are searching for, we must first find the
+	    // mapping for the given position and then return the opposite position it
+	    // points to. Because the mappings are sorted, we can use binary search to
+	    // find the best mapping.
+
+	    if (aNeedle[aLineName] <= 0) {
+	      throw new TypeError('Line must be greater than or equal to 1, got '
+	                          + aNeedle[aLineName]);
+	    }
+	    if (aNeedle[aColumnName] < 0) {
+	      throw new TypeError('Column must be greater than or equal to 0, got '
+	                          + aNeedle[aColumnName]);
+	    }
+
+	    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+	  };
+
+	/**
+	 * Compute the last column for each generated mapping. The last column is
+	 * inclusive.
+	 */
+	BasicSourceMapConsumer.prototype.computeColumnSpans =
+	  function SourceMapConsumer_computeColumnSpans() {
+	    for (var index = 0; index < this._generatedMappings.length; ++index) {
+	      var mapping = this._generatedMappings[index];
+
+	      // Mappings do not contain a field for the last generated columnt. We
+	      // can come up with an optimistic estimate, however, by assuming that
+	      // mappings are contiguous (i.e. given two consecutive mappings, the
+	      // first mapping ends where the second one starts).
+	      if (index + 1 < this._generatedMappings.length) {
+	        var nextMapping = this._generatedMappings[index + 1];
+
+	        if (mapping.generatedLine === nextMapping.generatedLine) {
+	          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+	          continue;
+	        }
+	      }
+
+	      // The last mapping for each line spans the entire line.
+	      mapping.lastGeneratedColumn = Infinity;
+	    }
+	  };
+
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	BasicSourceMapConsumer.prototype.originalPositionFor =
+	  function SourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    var index = this._findMapping(
+	      needle,
+	      this._generatedMappings,
+	      "generatedLine",
+	      "generatedColumn",
+	      util.compareByGeneratedPositionsDeflated,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+
+	    if (index >= 0) {
+	      var mapping = this._generatedMappings[index];
+
+	      if (mapping.generatedLine === needle.generatedLine) {
+	        var source = util.getArg(mapping, 'source', null);
+	        if (source !== null) {
+	          source = this._sources.at(source);
+	          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+	        }
+	        var name = util.getArg(mapping, 'name', null);
+	        if (name !== null) {
+	          name = this._names.at(name);
+	        }
+	        return {
+	          source: source,
+	          line: util.getArg(mapping, 'originalLine', null),
+	          column: util.getArg(mapping, 'originalColumn', null),
+	          name: name
+	        };
+	      }
+	    }
+
+	    return {
+	      source: null,
+	      line: null,
+	      column: null,
+	      name: null
+	    };
+	  };
+
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	BasicSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function BasicSourceMapConsumer_hasContentsOfAllSources() {
+	    if (!this.sourcesContent) {
+	      return false;
+	    }
+	    return this.sourcesContent.length >= this._sources.size() &&
+	      !this.sourcesContent.some(function (sc) { return sc == null; });
+	  };
+
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	BasicSourceMapConsumer.prototype.sourceContentFor =
+	  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    if (!this.sourcesContent) {
+	      return null;
+	    }
+
+	    var index = this._findSourceIndex(aSource);
+	    if (index >= 0) {
+	      return this.sourcesContent[index];
+	    }
+
+	    var relativeSource = aSource;
+	    if (this.sourceRoot != null) {
+	      relativeSource = util.relative(this.sourceRoot, relativeSource);
+	    }
+
+	    var url;
+	    if (this.sourceRoot != null
+	        && (url = util.urlParse(this.sourceRoot))) {
+	      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+	      // many users. We can help them out when they expect file:// URIs to
+	      // behave like it would if they were running a local HTTP server. See
+	      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+	      var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+	      if (url.scheme == "file"
+	          && this._sources.has(fileUriAbsPath)) {
+	        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]
+	      }
+
+	      if ((!url.path || url.path == "/")
+	          && this._sources.has("/" + relativeSource)) {
+	        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+	      }
+	    }
+
+	    // This function is used recursively from
+	    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+	    // don't want to throw if we can't find the source - we just want to
+	    // return null, so we provide a flag to exit gracefully.
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+	    }
+	  };
+
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	BasicSourceMapConsumer.prototype.generatedPositionFor =
+	  function SourceMapConsumer_generatedPositionFor(aArgs) {
+	    var source = util.getArg(aArgs, 'source');
+	    source = this._findSourceIndex(source);
+	    if (source < 0) {
+	      return {
+	        line: null,
+	        column: null,
+	        lastColumn: null
+	      };
+	    }
+
+	    var needle = {
+	      source: source,
+	      originalLine: util.getArg(aArgs, 'line'),
+	      originalColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    var index = this._findMapping(
+	      needle,
+	      this._originalMappings,
+	      "originalLine",
+	      "originalColumn",
+	      util.compareByOriginalPositions,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+
+	      if (mapping.source === needle.source) {
+	        return {
+	          line: util.getArg(mapping, 'generatedLine', null),
+	          column: util.getArg(mapping, 'generatedColumn', null),
+	          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	        };
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null,
+	      lastColumn: null
+	    };
+	  };
+
+	exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+	/**
+	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+	 * we can query for information. It differs from BasicSourceMapConsumer in
+	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+	 * input.
+	 *
+	 * The first parameter is a raw source map (either as a JSON string, or already
+	 * parsed to an object). According to the spec for indexed source maps, they
+	 * have the following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *   - sections: A list of section definitions.
+	 *
+	 * Each value under the "sections" field has two fields:
+	 *   - offset: The offset into the original specified at which this section
+	 *       begins to apply, defined as an object with a "line" and "column"
+	 *       field.
+	 *   - map: A source map definition. This source map could also be indexed,
+	 *       but doesn't have to be.
+	 *
+	 * Instead of the "map" field, it's also possible to have a "url" field
+	 * specifying a URL to retrieve a source map from, but that's currently
+	 * unsupported.
+	 *
+	 * Here's an example source map, taken from the source map spec[0], but
+	 * modified to omit a section which uses the "url" field.
+	 *
+	 *  {
+	 *    version : 3,
+	 *    file: "app.js",
+	 *    sections: [{
+	 *      offset: {line:100, column:10},
+	 *      map: {
+	 *        version : 3,
+	 *        file: "section.js",
+	 *        sources: ["foo.js", "bar.js"],
+	 *        names: ["src", "maps", "are", "fun"],
+	 *        mappings: "AAAA,E;;ABCDE;"
+	 *      }
+	 *    }],
+	 *  }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+	 */
+	function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  var version = util.getArg(sourceMap, 'version');
+	  var sections = util.getArg(sourceMap, 'sections');
+
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+
+	  var lastOffset = {
+	    line: -1,
+	    column: 0
+	  };
+	  this._sections = sections.map(function (s) {
+	    if (s.url) {
+	      // The url field will require support for asynchronicity.
+	      // See https://github.com/mozilla/source-map/issues/16
+	      throw new Error('Support for url field in sections not implemented.');
+	    }
+	    var offset = util.getArg(s, 'offset');
+	    var offsetLine = util.getArg(offset, 'line');
+	    var offsetColumn = util.getArg(offset, 'column');
+
+	    if (offsetLine < lastOffset.line ||
+	        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+	      throw new Error('Section offsets must be ordered and non-overlapping.');
+	    }
+	    lastOffset = offset;
+
+	    return {
+	      generatedOffset: {
+	        // The offset fields are 0-based, but we use 1-based indices when
+	        // encoding/decoding from VLQ.
+	        generatedLine: offsetLine + 1,
+	        generatedColumn: offsetColumn + 1
+	      },
+	      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
+	    }
+	  });
+	}
+
+	IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	IndexedSourceMapConsumer.prototype._version = 3;
+
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    var sources = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {
+	        sources.push(this._sections[i].consumer.sources[j]);
+	      }
+	    }
+	    return sources;
+	  }
+	});
+
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	IndexedSourceMapConsumer.prototype.originalPositionFor =
+	  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    // Find the section containing the generated position we're trying to map
+	    // to an original position.
+	    var sectionIndex = binarySearch.search(needle, this._sections,
+	      function(needle, section) {
+	        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+	        if (cmp) {
+	          return cmp;
+	        }
+
+	        return (needle.generatedColumn -
+	                section.generatedOffset.generatedColumn);
+	      });
+	    var section = this._sections[sectionIndex];
+
+	    if (!section) {
+	      return {
+	        source: null,
+	        line: null,
+	        column: null,
+	        name: null
+	      };
+	    }
+
+	    return section.consumer.originalPositionFor({
+	      line: needle.generatedLine -
+	        (section.generatedOffset.generatedLine - 1),
+	      column: needle.generatedColumn -
+	        (section.generatedOffset.generatedLine === needle.generatedLine
+	         ? section.generatedOffset.generatedColumn - 1
+	         : 0),
+	      bias: aArgs.bias
+	    });
+	  };
+
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	IndexedSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+	    return this._sections.every(function (s) {
+	      return s.consumer.hasContentsOfAllSources();
+	    });
+	  };
+
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	IndexedSourceMapConsumer.prototype.sourceContentFor =
+	  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+
+	      var content = section.consumer.sourceContentFor(aSource, true);
+	      if (content) {
+	        return content;
+	      }
+	    }
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + aSource + '" is not in the SourceMap.');
+	    }
+	  };
+
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based. 
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	IndexedSourceMapConsumer.prototype.generatedPositionFor =
+	  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+
+	      // Only consider this section if the requested source is in the list of
+	      // sources of the consumer.
+	      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
+	        continue;
+	      }
+	      var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+	      if (generatedPosition) {
+	        var ret = {
+	          line: generatedPosition.line +
+	            (section.generatedOffset.generatedLine - 1),
+	          column: generatedPosition.column +
+	            (section.generatedOffset.generatedLine === generatedPosition.line
+	             ? section.generatedOffset.generatedColumn - 1
+	             : 0)
+	        };
+	        return ret;
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null
+	    };
+	  };
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	IndexedSourceMapConsumer.prototype._parseMappings =
+	  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    this.__generatedMappings = [];
+	    this.__originalMappings = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	      var sectionMappings = section.consumer._generatedMappings;
+	      for (var j = 0; j < sectionMappings.length; j++) {
+	        var mapping = sectionMappings[j];
+
+	        var source = section.consumer._sources.at(mapping.source);
+	        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+	        this._sources.add(source);
+	        source = this._sources.indexOf(source);
+
+	        var name = null;
+	        if (mapping.name) {
+	          name = section.consumer._names.at(mapping.name);
+	          this._names.add(name);
+	          name = this._names.indexOf(name);
+	        }
+
+	        // The mappings coming from the consumer for the section have
+	        // generated positions relative to the start of the section, so we
+	        // need to offset them to be relative to the start of the concatenated
+	        // generated file.
+	        var adjustedMapping = {
+	          source: source,
+	          generatedLine: mapping.generatedLine +
+	            (section.generatedOffset.generatedLine - 1),
+	          generatedColumn: mapping.generatedColumn +
+	            (section.generatedOffset.generatedLine === mapping.generatedLine
+	            ? section.generatedOffset.generatedColumn - 1
+	            : 0),
+	          originalLine: mapping.originalLine,
+	          originalColumn: mapping.originalColumn,
+	          name: name
+	        };
+
+	        this.__generatedMappings.push(adjustedMapping);
+	        if (typeof adjustedMapping.originalLine === 'number') {
+	          this.__originalMappings.push(adjustedMapping);
+	        }
+	      }
+	    }
+
+	    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    quickSort(this.__originalMappings, util.compareByOriginalPositions);
+	  };
+
+	exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+
+/***/ }),
+/* 8 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	exports.GREATEST_LOWER_BOUND = 1;
+	exports.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * Recursive implementation of binary search.
+	 *
+	 * @param aLow Indices here and lower do not contain the needle.
+	 * @param aHigh Indices here and higher do not contain the needle.
+	 * @param aNeedle The element being searched for.
+	 * @param aHaystack The non-empty array being searched.
+	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 */
+	function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+	  // This function terminates when one of the following is true:
+	  //
+	  //   1. We find the exact element we are looking for.
+	  //
+	  //   2. We did not find the exact element, but we can return the index of
+	  //      the next-closest element.
+	  //
+	  //   3. We did not find the exact element, and there is no next-closest
+	  //      element than the one we are searching for, so we return -1.
+	  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+	  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+	  if (cmp === 0) {
+	    // Found the element we are looking for.
+	    return mid;
+	  }
+	  else if (cmp > 0) {
+	    // Our needle is greater than aHaystack[mid].
+	    if (aHigh - mid > 1) {
+	      // The element is in the upper half.
+	      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+	    }
+
+	    // The exact needle element was not found in this haystack. Determine if
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return aHigh < aHaystack.length ? aHigh : -1;
+	    } else {
+	      return mid;
+	    }
+	  }
+	  else {
+	    // Our needle is less than aHaystack[mid].
+	    if (mid - aLow > 1) {
+	      // The element is in the lower half.
+	      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+	    }
+
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return mid;
+	    } else {
+	      return aLow < 0 ? -1 : aLow;
+	    }
+	  }
+	}
+
+	/**
+	 * This is an implementation of binary search which will always try and return
+	 * the index of the closest element if there is no exact hit. This is because
+	 * mappings between original and generated line/col pairs are single points,
+	 * and there is an implicit region between each of them, so a miss just means
+	 * that you aren't on the very start of a region.
+	 *
+	 * @param aNeedle The element you are looking for.
+	 * @param aHaystack The array that is being searched.
+	 * @param aCompare A function which takes the needle and an element in the
+	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+	 *     than, equal to, or greater than the element, respectively.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+	 */
+	exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+	  if (aHaystack.length === 0) {
+	    return -1;
+	  }
+
+	  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+	                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+	  if (index < 0) {
+	    return -1;
+	  }
+
+	  // We have found either the exact element, or the next-closest element than
+	  // the one we are searching for. However, there may be more than one such
+	  // element. Make sure we always return the smallest of these.
+	  while (index - 1 >= 0) {
+	    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+	      break;
+	    }
+	    --index;
+	  }
+
+	  return index;
+	};
+
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	// It turns out that some (most?) JavaScript engines don't self-host
+	// `Array.prototype.sort`. This makes sense because C++ will likely remain
+	// faster than JS when doing raw CPU-intensive sorting. However, when using a
+	// custom comparator function, calling back and forth between the VM's C++ and
+	// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+	// worse generated code for the comparator function than would be optimal. In
+	// fact, when sorting with a comparator, these costs outweigh the benefits of
+	// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+	// a ~3500ms mean speed-up in `bench/bench.html`.
+
+	/**
+	 * Swap the elements indexed by `x` and `y` in the array `ary`.
+	 *
+	 * @param {Array} ary
+	 *        The array.
+	 * @param {Number} x
+	 *        The index of the first item.
+	 * @param {Number} y
+	 *        The index of the second item.
+	 */
+	function swap(ary, x, y) {
+	  var temp = ary[x];
+	  ary[x] = ary[y];
+	  ary[y] = temp;
+	}
+
+	/**
+	 * Returns a random integer within the range `low .. high` inclusive.
+	 *
+	 * @param {Number} low
+	 *        The lower bound on the range.
+	 * @param {Number} high
+	 *        The upper bound on the range.
+	 */
+	function randomIntInRange(low, high) {
+	  return Math.round(low + (Math.random() * (high - low)));
+	}
+
+	/**
+	 * The Quick Sort algorithm.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 * @param {Number} p
+	 *        Start index of the array
+	 * @param {Number} r
+	 *        End index of the array
+	 */
+	function doQuickSort(ary, comparator, p, r) {
+	  // If our lower bound is less than our upper bound, we (1) partition the
+	  // array into two pieces and (2) recurse on each half. If it is not, this is
+	  // the empty array and our base case.
+
+	  if (p < r) {
+	    // (1) Partitioning.
+	    //
+	    // The partitioning chooses a pivot between `p` and `r` and moves all
+	    // elements that are less than or equal to the pivot to the before it, and
+	    // all the elements that are greater than it after it. The effect is that
+	    // once partition is done, the pivot is in the exact place it will be when
+	    // the array is put in sorted order, and it will not need to be moved
+	    // again. This runs in O(n) time.
+
+	    // Always choose a random pivot so that an input array which is reverse
+	    // sorted does not cause O(n^2) running time.
+	    var pivotIndex = randomIntInRange(p, r);
+	    var i = p - 1;
+
+	    swap(ary, pivotIndex, r);
+	    var pivot = ary[r];
+
+	    // Immediately after `j` is incremented in this loop, the following hold
+	    // true:
+	    //
+	    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+	    //
+	    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+	    for (var j = p; j < r; j++) {
+	      if (comparator(ary[j], pivot) <= 0) {
+	        i += 1;
+	        swap(ary, i, j);
+	      }
+	    }
+
+	    swap(ary, i + 1, j);
+	    var q = i + 1;
+
+	    // (2) Recurse on each half.
+
+	    doQuickSort(ary, comparator, p, q - 1);
+	    doQuickSort(ary, comparator, q + 1, r);
+	  }
+	}
+
+	/**
+	 * Sort the given array in-place with the given comparator function.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 */
+	exports.quickSort = function (ary, comparator) {
+	  doQuickSort(ary, comparator, 0, ary.length - 1);
+	};
+
+
+/***/ }),
+/* 10 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	var util = __webpack_require__(4);
+
+	// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+	// operating systems these days (capturing the result).
+	var REGEX_NEWLINE = /(\r?\n)/;
+
+	// Newline character code for charCodeAt() comparisons
+	var NEWLINE_CODE = 10;
+
+	// Private symbol for identifying `SourceNode`s when multiple versions of
+	// the source-map library are loaded. This MUST NOT CHANGE across
+	// versions!
+	var isSourceNode = "$$$isSourceNode$$$";
+
+	/**
+	 * SourceNodes provide a way to abstract over interpolating/concatenating
+	 * snippets of generated JavaScript source code while maintaining the line and
+	 * column information associated with the original source code.
+	 *
+	 * @param aLine The original line number.
+	 * @param aColumn The original column number.
+	 * @param aSource The original source's filename.
+	 * @param aChunks Optional. An array of strings which are snippets of
+	 *        generated JS, or other SourceNodes.
+	 * @param aName The original identifier.
+	 */
+	function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+	  this.children = [];
+	  this.sourceContents = {};
+	  this.line = aLine == null ? null : aLine;
+	  this.column = aColumn == null ? null : aColumn;
+	  this.source = aSource == null ? null : aSource;
+	  this.name = aName == null ? null : aName;
+	  this[isSourceNode] = true;
+	  if (aChunks != null) this.add(aChunks);
+	}
+
+	/**
+	 * Creates a SourceNode from generated code and a SourceMapConsumer.
+	 *
+	 * @param aGeneratedCode The generated code
+	 * @param aSourceMapConsumer The SourceMap for the generated code
+	 * @param aRelativePath Optional. The path that relative sources in the
+	 *        SourceMapConsumer should be relative to.
+	 */
+	SourceNode.fromStringWithSourceMap =
+	  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+	    // The SourceNode we want to fill with the generated code
+	    // and the SourceMap
+	    var node = new SourceNode();
+
+	    // All even indices of this array are one line of the generated code,
+	    // while all odd indices are the newlines between two adjacent lines
+	    // (since `REGEX_NEWLINE` captures its match).
+	    // Processed fragments are accessed by calling `shiftNextLine`.
+	    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+	    var remainingLinesIndex = 0;
+	    var shiftNextLine = function() {
+	      var lineContents = getNextLine();
+	      // The last line of a file might not have a newline.
+	      var newLine = getNextLine() || "";
+	      return lineContents + newLine;
+
+	      function getNextLine() {
+	        return remainingLinesIndex < remainingLines.length ?
+	            remainingLines[remainingLinesIndex++] : undefined;
+	      }
+	    };
+
+	    // We need to remember the position of "remainingLines"
+	    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+	    // The generate SourceNodes we need a code range.
+	    // To extract it current and last mapping is used.
+	    // Here we store the last mapping.
+	    var lastMapping = null;
+
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      if (lastMapping !== null) {
+	        // We add the code from "lastMapping" to "mapping":
+	        // First check if there is a new line in between.
+	        if (lastGeneratedLine < mapping.generatedLine) {
+	          // Associate first line with "lastMapping"
+	          addMappingWithCode(lastMapping, shiftNextLine());
+	          lastGeneratedLine++;
+	          lastGeneratedColumn = 0;
+	          // The remaining code is added without mapping
+	        } else {
+	          // There is no new line in between.
+	          // Associate the code between "lastGeneratedColumn" and
+	          // "mapping.generatedColumn" with "lastMapping"
+	          var nextLine = remainingLines[remainingLinesIndex] || '';
+	          var code = nextLine.substr(0, mapping.generatedColumn -
+	                                        lastGeneratedColumn);
+	          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+	                                              lastGeneratedColumn);
+	          lastGeneratedColumn = mapping.generatedColumn;
+	          addMappingWithCode(lastMapping, code);
+	          // No more remaining code, continue
+	          lastMapping = mapping;
+	          return;
+	        }
+	      }
+	      // We add the generated code until the first mapping
+	      // to the SourceNode without any mapping.
+	      // Each line is added as separate string.
+	      while (lastGeneratedLine < mapping.generatedLine) {
+	        node.add(shiftNextLine());
+	        lastGeneratedLine++;
+	      }
+	      if (lastGeneratedColumn < mapping.generatedColumn) {
+	        var nextLine = remainingLines[remainingLinesIndex] || '';
+	        node.add(nextLine.substr(0, mapping.generatedColumn));
+	        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+	        lastGeneratedColumn = mapping.generatedColumn;
+	      }
+	      lastMapping = mapping;
+	    }, this);
+	    // We have processed all mappings.
+	    if (remainingLinesIndex < remainingLines.length) {
+	      if (lastMapping) {
+	        // Associate the remaining code in the current line with "lastMapping"
+	        addMappingWithCode(lastMapping, shiftNextLine());
+	      }
+	      // and add the remaining lines without any mapping
+	      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+	    }
+
+	    // Copy sourcesContent into SourceNode
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aRelativePath != null) {
+	          sourceFile = util.join(aRelativePath, sourceFile);
+	        }
+	        node.setSourceContent(sourceFile, content);
+	      }
+	    });
+
+	    return node;
+
+	    function addMappingWithCode(mapping, code) {
+	      if (mapping === null || mapping.source === undefined) {
+	        node.add(code);
+	      } else {
+	        var source = aRelativePath
+	          ? util.join(aRelativePath, mapping.source)
+	          : mapping.source;
+	        node.add(new SourceNode(mapping.originalLine,
+	                                mapping.originalColumn,
+	                                source,
+	                                code,
+	                                mapping.name));
+	      }
+	    }
+	  };
+
+	/**
+	 * Add a chunk of generated JS to this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.add = function SourceNode_add(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    aChunk.forEach(function (chunk) {
+	      this.add(chunk);
+	    }, this);
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    if (aChunk) {
+	      this.children.push(aChunk);
+	    }
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+
+	/**
+	 * Add a chunk of generated JS to the beginning of this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    for (var i = aChunk.length-1; i >= 0; i--) {
+	      this.prepend(aChunk[i]);
+	    }
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    this.children.unshift(aChunk);
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+
+	/**
+	 * Walk over the tree of JS snippets in this node and its children. The
+	 * walking function is called once for each snippet of JS and is passed that
+	 * snippet and the its original associated source's line/column location.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+	  var chunk;
+	  for (var i = 0, len = this.children.length; i < len; i++) {
+	    chunk = this.children[i];
+	    if (chunk[isSourceNode]) {
+	      chunk.walk(aFn);
+	    }
+	    else {
+	      if (chunk !== '') {
+	        aFn(chunk, { source: this.source,
+	                     line: this.line,
+	                     column: this.column,
+	                     name: this.name });
+	      }
+	    }
+	  }
+	};
+
+	/**
+	 * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+	 * each of `this.children`.
+	 *
+	 * @param aSep The separator.
+	 */
+	SourceNode.prototype.join = function SourceNode_join(aSep) {
+	  var newChildren;
+	  var i;
+	  var len = this.children.length;
+	  if (len > 0) {
+	    newChildren = [];
+	    for (i = 0; i < len-1; i++) {
+	      newChildren.push(this.children[i]);
+	      newChildren.push(aSep);
+	    }
+	    newChildren.push(this.children[i]);
+	    this.children = newChildren;
+	  }
+	  return this;
+	};
+
+	/**
+	 * Call String.prototype.replace on the very right-most source snippet. Useful
+	 * for trimming whitespace from the end of a source node, etc.
+	 *
+	 * @param aPattern The pattern to replace.
+	 * @param aReplacement The thing to replace the pattern with.
+	 */
+	SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+	  var lastChild = this.children[this.children.length - 1];
+	  if (lastChild[isSourceNode]) {
+	    lastChild.replaceRight(aPattern, aReplacement);
+	  }
+	  else if (typeof lastChild === 'string') {
+	    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+	  }
+	  else {
+	    this.children.push(''.replace(aPattern, aReplacement));
+	  }
+	  return this;
+	};
+
+	/**
+	 * Set the source content for a source file. This will be added to the SourceMapGenerator
+	 * in the sourcesContent field.
+	 *
+	 * @param aSourceFile The filename of the source file
+	 * @param aSourceContent The content of the source file
+	 */
+	SourceNode.prototype.setSourceContent =
+	  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+	    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+	  };
+
+	/**
+	 * Walk over the tree of SourceNodes. The walking function is called for each
+	 * source file content and is passed the filename and source content.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walkSourceContents =
+	  function SourceNode_walkSourceContents(aFn) {
+	    for (var i = 0, len = this.children.length; i < len; i++) {
+	      if (this.children[i][isSourceNode]) {
+	        this.children[i].walkSourceContents(aFn);
+	      }
+	    }
+
+	    var sources = Object.keys(this.sourceContents);
+	    for (var i = 0, len = sources.length; i < len; i++) {
+	      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+	    }
+	  };
+
+	/**
+	 * Return the string representation of this source node. Walks over the tree
+	 * and concatenates all the various snippets together to one string.
+	 */
+	SourceNode.prototype.toString = function SourceNode_toString() {
+	  var str = "";
+	  this.walk(function (chunk) {
+	    str += chunk;
+	  });
+	  return str;
+	};
+
+	/**
+	 * Returns the string representation of this source node along with a source
+	 * map.
+	 */
+	SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+	  var generated = {
+	    code: "",
+	    line: 1,
+	    column: 0
+	  };
+	  var map = new SourceMapGenerator(aArgs);
+	  var sourceMappingActive = false;
+	  var lastOriginalSource = null;
+	  var lastOriginalLine = null;
+	  var lastOriginalColumn = null;
+	  var lastOriginalName = null;
+	  this.walk(function (chunk, original) {
+	    generated.code += chunk;
+	    if (original.source !== null
+	        && original.line !== null
+	        && original.column !== null) {
+	      if(lastOriginalSource !== original.source
+	         || lastOriginalLine !== original.line
+	         || lastOriginalColumn !== original.column
+	         || lastOriginalName !== original.name) {
+	        map.addMapping({
+	          source: original.source,
+	          original: {
+	            line: original.line,
+	            column: original.column
+	          },
+	          generated: {
+	            line: generated.line,
+	            column: generated.column
+	          },
+	          name: original.name
+	        });
+	      }
+	      lastOriginalSource = original.source;
+	      lastOriginalLine = original.line;
+	      lastOriginalColumn = original.column;
+	      lastOriginalName = original.name;
+	      sourceMappingActive = true;
+	    } else if (sourceMappingActive) {
+	      map.addMapping({
+	        generated: {
+	          line: generated.line,
+	          column: generated.column
+	        }
+	      });
+	      lastOriginalSource = null;
+	      sourceMappingActive = false;
+	    }
+	    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+	      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+	        generated.line++;
+	        generated.column = 0;
+	        // Mappings end at eol
+	        if (idx + 1 === length) {
+	          lastOriginalSource = null;
+	          sourceMappingActive = false;
+	        } else if (sourceMappingActive) {
+	          map.addMapping({
+	            source: original.source,
+	            original: {
+	              line: original.line,
+	              column: original.column
+	            },
+	            generated: {
+	              line: generated.line,
+	              column: generated.column
+	            },
+	            name: original.name
+	          });
+	        }
+	      } else {
+	        generated.column++;
+	      }
+	    }
+	  });
+	  this.walkSourceContents(function (sourceFile, sourceContent) {
+	    map.setSourceContent(sourceFile, sourceContent);
+	  });
+
+	  return { code: generated.code, map: map };
+	};
+
+	exports.SourceNode = SourceNode;
+
+
+/***/ })
+/******/ ])
+});
+;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.min.js b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.min.js
new file mode 100644
index 0000000..c7c72da
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.min.js
@@ -0,0 +1,2 @@
+!function(e,n){"object"==typeof exports&&"object"==typeof module?module.exports=n():"function"==typeof define&&define.amd?define([],n):"object"==typeof exports?exports.sourceMap=n():e.sourceMap=n()}(this,function(){return function(e){function n(t){if(r[t])return r[t].exports;var o=r[t]={exports:{},id:t,loaded:!1};return e[t].call(o.exports,o,o.exports,n),o.loaded=!0,o.exports}var r={};return n.m=e,n.c=r,n.p="",n(0)}([function(e,n,r){n.SourceMapGenerator=r(1).SourceMapGenerator,n.SourceMapConsumer=r(7).SourceMapConsumer,n.SourceNode=r(10).SourceNode},function(e,n,r){function t(e){e||(e={}),this._file=i.getArg(e,"file",null),this._sourceRoot=i.getArg(e,"sourceRoot",null),this._skipValidation=i.getArg(e,"skipValidation",!1),this._sources=new s,this._names=new s,this._mappings=new a,this._sourcesContents=null}var o=r(2),i=r(4),s=r(5).ArraySet,a=r(6).MappingList;t.prototype._version=3,t.fromSourceMap=function(e){var n=e.sourceRoot,r=new t({file:e.file,sourceRoot:n});return e.eachMapping(function(e){var t={generated:{line:e.generatedLine,column:e.generatedColumn}};null!=e.source&&(t.source=e.source,null!=n&&(t.source=i.relative(n,t.source)),t.original={line:e.originalLine,column:e.originalColumn},null!=e.name&&(t.name=e.name)),r.addMapping(t)}),e.sources.forEach(function(t){var o=t;null!==n&&(o=i.relative(n,t)),r._sources.has(o)||r._sources.add(o);var s=e.sourceContentFor(t);null!=s&&r.setSourceContent(t,s)}),r},t.prototype.addMapping=function(e){var n=i.getArg(e,"generated"),r=i.getArg(e,"original",null),t=i.getArg(e,"source",null),o=i.getArg(e,"name",null);this._skipValidation||this._validateMapping(n,r,t,o),null!=t&&(t=String(t),this._sources.has(t)||this._sources.add(t)),null!=o&&(o=String(o),this._names.has(o)||this._names.add(o)),this._mappings.add({generatedLine:n.line,generatedColumn:n.column,originalLine:null!=r&&r.line,originalColumn:null!=r&&r.column,source:t,name:o})},t.prototype.setSourceContent=function(e,n){var r=e;null!=this._sourceRoot&&(r=i.relative(this._sourceRoot,r)),null!=n?(this._sourcesContents||(this._sourcesContents=Object.create(null)),this._sourcesContents[i.toSetString(r)]=n):this._sourcesContents&&(delete this._sourcesContents[i.toSetString(r)],0===Object.keys(this._sourcesContents).length&&(this._sourcesContents=null))},t.prototype.applySourceMap=function(e,n,r){var t=n;if(null==n){if(null==e.file)throw new Error('SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, or the source map\'s "file" property. Both were omitted.');t=e.file}var o=this._sourceRoot;null!=o&&(t=i.relative(o,t));var a=new s,u=new s;this._mappings.unsortedForEach(function(n){if(n.source===t&&null!=n.originalLine){var s=e.originalPositionFor({line:n.originalLine,column:n.originalColumn});null!=s.source&&(n.source=s.source,null!=r&&(n.source=i.join(r,n.source)),null!=o&&(n.source=i.relative(o,n.source)),n.originalLine=s.line,n.originalColumn=s.column,null!=s.name&&(n.name=s.name))}var l=n.source;null==l||a.has(l)||a.add(l);var c=n.name;null==c||u.has(c)||u.add(c)},this),this._sources=a,this._names=u,e.sources.forEach(function(n){var t=e.sourceContentFor(n);null!=t&&(null!=r&&(n=i.join(r,n)),null!=o&&(n=i.relative(o,n)),this.setSourceContent(n,t))},this)},t.prototype._validateMapping=function(e,n,r,t){if(n&&"number"!=typeof n.line&&"number"!=typeof n.column)throw new Error("original.line and original.column are not numbers -- you probably meant to omit the original mapping entirely and only map the generated position. If so, pass null for the original mapping instead of an object with empty or null values.");if((!(e&&"line"in e&&"column"in e&&e.line>0&&e.column>=0)||n||r||t)&&!(e&&"line"in e&&"column"in e&&n&&"line"in n&&"column"in n&&e.line>0&&e.column>=0&&n.line>0&&n.column>=0&&r))throw new Error("Invalid mapping: "+JSON.stringify({generated:e,source:r,original:n,name:t}))},t.prototype._serializeMappings=function(){for(var e,n,r,t,s=0,a=1,u=0,l=0,c=0,g=0,p="",h=this._mappings.toArray(),f=0,d=h.length;f<d;f++){if(n=h[f],e="",n.generatedLine!==a)for(s=0;n.generatedLine!==a;)e+=";",a++;else if(f>0){if(!i.compareByGeneratedPositionsInflated(n,h[f-1]))continue;e+=","}e+=o.encode(n.generatedColumn-s),s=n.generatedColumn,null!=n.source&&(t=this._sources.indexOf(n.source),e+=o.encode(t-g),g=t,e+=o.encode(n.originalLine-1-l),l=n.originalLine-1,e+=o.encode(n.originalColumn-u),u=n.originalColumn,null!=n.name&&(r=this._names.indexOf(n.name),e+=o.encode(r-c),c=r)),p+=e}return p},t.prototype._generateSourcesContent=function(e,n){return e.map(function(e){if(!this._sourcesContents)return null;null!=n&&(e=i.relative(n,e));var r=i.toSetString(e);return Object.prototype.hasOwnProperty.call(this._sourcesContents,r)?this._sourcesContents[r]:null},this)},t.prototype.toJSON=function(){var e={version:this._version,sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};return null!=this._file&&(e.file=this._file),null!=this._sourceRoot&&(e.sourceRoot=this._sourceRoot),this._sourcesContents&&(e.sourcesContent=this._generateSourcesContent(e.sources,e.sourceRoot)),e},t.prototype.toString=function(){return JSON.stringify(this.toJSON())},n.SourceMapGenerator=t},function(e,n,r){function t(e){return e<0?(-e<<1)+1:(e<<1)+0}function o(e){var n=1===(1&e),r=e>>1;return n?-r:r}var i=r(3),s=5,a=1<<s,u=a-1,l=a;n.encode=function(e){var n,r="",o=t(e);do n=o&u,o>>>=s,o>0&&(n|=l),r+=i.encode(n);while(o>0);return r},n.decode=function(e,n,r){var t,a,c=e.length,g=0,p=0;do{if(n>=c)throw new Error("Expected more digits in base 64 VLQ value.");if(a=i.decode(e.charCodeAt(n++)),a===-1)throw new Error("Invalid base64 digit: "+e.charAt(n-1));t=!!(a&l),a&=u,g+=a<<p,p+=s}while(t);r.value=o(g),r.rest=n}},function(e,n){var r="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");n.encode=function(e){if(0<=e&&e<r.length)return r[e];throw new TypeError("Must be between 0 and 63: "+e)},n.decode=function(e){var n=65,r=90,t=97,o=122,i=48,s=57,a=43,u=47,l=26,c=52;return n<=e&&e<=r?e-n:t<=e&&e<=o?e-t+l:i<=e&&e<=s?e-i+c:e==a?62:e==u?63:-1}},function(e,n){function r(e,n,r){if(n in e)return e[n];if(3===arguments.length)return r;throw new Error('"'+n+'" is a required argument.')}function t(e){var n=e.match(v);return n?{scheme:n[1],auth:n[2],host:n[3],port:n[4],path:n[5]}:null}function o(e){var n="";return e.scheme&&(n+=e.scheme+":"),n+="//",e.auth&&(n+=e.auth+"@"),e.host&&(n+=e.host),e.port&&(n+=":"+e.port),e.path&&(n+=e.path),n}function i(e){var r=e,i=t(e);if(i){if(!i.path)return e;r=i.path}for(var s,a=n.isAbsolute(r),u=r.split(/\/+/),l=0,c=u.length-1;c>=0;c--)s=u[c],"."===s?u.splice(c,1):".."===s?l++:l>0&&(""===s?(u.splice(c+1,l),l=0):(u.splice(c,2),l--));return r=u.join("/"),""===r&&(r=a?"/":"."),i?(i.path=r,o(i)):r}function s(e,n){""===e&&(e="."),""===n&&(n=".");var r=t(n),s=t(e);if(s&&(e=s.path||"/"),r&&!r.scheme)return s&&(r.scheme=s.scheme),o(r);if(r||n.match(y))return n;if(s&&!s.host&&!s.path)return s.host=n,o(s);var a="/"===n.charAt(0)?n:i(e.replace(/\/+$/,"")+"/"+n);return s?(s.path=a,o(s)):a}function a(e,n){""===e&&(e="."),e=e.replace(/\/$/,"");for(var r=0;0!==n.indexOf(e+"/");){var t=e.lastIndexOf("/");if(t<0)return n;if(e=e.slice(0,t),e.match(/^([^\/]+:\/)?\/*$/))return n;++r}return Array(r+1).join("../")+n.substr(e.length+1)}function u(e){return e}function l(e){return g(e)?"$"+e:e}function c(e){return g(e)?e.slice(1):e}function g(e){if(!e)return!1;var n=e.length;if(n<9)return!1;if(95!==e.charCodeAt(n-1)||95!==e.charCodeAt(n-2)||111!==e.charCodeAt(n-3)||116!==e.charCodeAt(n-4)||111!==e.charCodeAt(n-5)||114!==e.charCodeAt(n-6)||112!==e.charCodeAt(n-7)||95!==e.charCodeAt(n-8)||95!==e.charCodeAt(n-9))return!1;for(var r=n-10;r>=0;r--)if(36!==e.charCodeAt(r))return!1;return!0}function p(e,n,r){var t=f(e.source,n.source);return 0!==t?t:(t=e.originalLine-n.originalLine,0!==t?t:(t=e.originalColumn-n.originalColumn,0!==t||r?t:(t=e.generatedColumn-n.generatedColumn,0!==t?t:(t=e.generatedLine-n.generatedLine,0!==t?t:f(e.name,n.name)))))}function h(e,n,r){var t=e.generatedLine-n.generatedLine;return 0!==t?t:(t=e.generatedColumn-n.generatedColumn,0!==t||r?t:(t=f(e.source,n.source),0!==t?t:(t=e.originalLine-n.originalLine,0!==t?t:(t=e.originalColumn-n.originalColumn,0!==t?t:f(e.name,n.name)))))}function f(e,n){return e===n?0:null===e?1:null===n?-1:e>n?1:-1}function d(e,n){var r=e.generatedLine-n.generatedLine;return 0!==r?r:(r=e.generatedColumn-n.generatedColumn,0!==r?r:(r=f(e.source,n.source),0!==r?r:(r=e.originalLine-n.originalLine,0!==r?r:(r=e.originalColumn-n.originalColumn,0!==r?r:f(e.name,n.name)))))}function m(e){return JSON.parse(e.replace(/^\)]}'[^\n]*\n/,""))}function _(e,n,r){if(n=n||"",e&&("/"!==e[e.length-1]&&"/"!==n[0]&&(e+="/"),n=e+n),r){var a=t(r);if(!a)throw new Error("sourceMapURL could not be parsed");if(a.path){var u=a.path.lastIndexOf("/");u>=0&&(a.path=a.path.substring(0,u+1))}n=s(o(a),n)}return i(n)}n.getArg=r;var v=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/,y=/^data:.+\,.+$/;n.urlParse=t,n.urlGenerate=o,n.normalize=i,n.join=s,n.isAbsolute=function(e){return"/"===e.charAt(0)||v.test(e)},n.relative=a;var C=function(){var e=Object.create(null);return!("__proto__"in e)}();n.toSetString=C?u:l,n.fromSetString=C?u:c,n.compareByOriginalPositions=p,n.compareByGeneratedPositionsDeflated=h,n.compareByGeneratedPositionsInflated=d,n.parseSourceMapInput=m,n.computeSourceURL=_},function(e,n,r){function t(){this._array=[],this._set=s?new Map:Object.create(null)}var o=r(4),i=Object.prototype.hasOwnProperty,s="undefined"!=typeof Map;t.fromArray=function(e,n){for(var r=new t,o=0,i=e.length;o<i;o++)r.add(e[o],n);return r},t.prototype.size=function(){return s?this._set.size:Object.getOwnPropertyNames(this._set).length},t.prototype.add=function(e,n){var r=s?e:o.toSetString(e),t=s?this.has(e):i.call(this._set,r),a=this._array.length;t&&!n||this._array.push(e),t||(s?this._set.set(e,a):this._set[r]=a)},t.prototype.has=function(e){if(s)return this._set.has(e);var n=o.toSetString(e);return i.call(this._set,n)},t.prototype.indexOf=function(e){if(s){var n=this._set.get(e);if(n>=0)return n}else{var r=o.toSetString(e);if(i.call(this._set,r))return this._set[r]}throw new Error('"'+e+'" is not in the set.')},t.prototype.at=function(e){if(e>=0&&e<this._array.length)return this._array[e];throw new Error("No element indexed by "+e)},t.prototype.toArray=function(){return this._array.slice()},n.ArraySet=t},function(e,n,r){function t(e,n){var r=e.generatedLine,t=n.generatedLine,o=e.generatedColumn,s=n.generatedColumn;return t>r||t==r&&s>=o||i.compareByGeneratedPositionsInflated(e,n)<=0}function o(){this._array=[],this._sorted=!0,this._last={generatedLine:-1,generatedColumn:0}}var i=r(4);o.prototype.unsortedForEach=function(e,n){this._array.forEach(e,n)},o.prototype.add=function(e){t(this._last,e)?(this._last=e,this._array.push(e)):(this._sorted=!1,this._array.push(e))},o.prototype.toArray=function(){return this._sorted||(this._array.sort(i.compareByGeneratedPositionsInflated),this._sorted=!0),this._array},n.MappingList=o},function(e,n,r){function t(e,n){var r=e;return"string"==typeof e&&(r=a.parseSourceMapInput(e)),null!=r.sections?new s(r,n):new o(r,n)}function o(e,n){var r=e;"string"==typeof e&&(r=a.parseSourceMapInput(e));var t=a.getArg(r,"version"),o=a.getArg(r,"sources"),i=a.getArg(r,"names",[]),s=a.getArg(r,"sourceRoot",null),u=a.getArg(r,"sourcesContent",null),c=a.getArg(r,"mappings"),g=a.getArg(r,"file",null);if(t!=this._version)throw new Error("Unsupported version: "+t);s&&(s=a.normalize(s)),o=o.map(String).map(a.normalize).map(function(e){return s&&a.isAbsolute(s)&&a.isAbsolute(e)?a.relative(s,e):e}),this._names=l.fromArray(i.map(String),!0),this._sources=l.fromArray(o,!0),this._absoluteSources=this._sources.toArray().map(function(e){return a.computeSourceURL(s,e,n)}),this.sourceRoot=s,this.sourcesContent=u,this._mappings=c,this._sourceMapURL=n,this.file=g}function i(){this.generatedLine=0,this.generatedColumn=0,this.source=null,this.originalLine=null,this.originalColumn=null,this.name=null}function s(e,n){var r=e;"string"==typeof e&&(r=a.parseSourceMapInput(e));var o=a.getArg(r,"version"),i=a.getArg(r,"sections");if(o!=this._version)throw new Error("Unsupported version: "+o);this._sources=new l,this._names=new l;var s={line:-1,column:0};this._sections=i.map(function(e){if(e.url)throw new Error("Support for url field in sections not implemented.");var r=a.getArg(e,"offset"),o=a.getArg(r,"line"),i=a.getArg(r,"column");if(o<s.line||o===s.line&&i<s.column)throw new Error("Section offsets must be ordered and non-overlapping.");return s=r,{generatedOffset:{generatedLine:o+1,generatedColumn:i+1},consumer:new t(a.getArg(e,"map"),n)}})}var a=r(4),u=r(8),l=r(5).ArraySet,c=r(2),g=r(9).quickSort;t.fromSourceMap=function(e,n){return o.fromSourceMap(e,n)},t.prototype._version=3,t.prototype.__generatedMappings=null,Object.defineProperty(t.prototype,"_generatedMappings",{configurable:!0,enumerable:!0,get:function(){return this.__generatedMappings||this._parseMappings(this._mappings,this.sourceRoot),this.__generatedMappings}}),t.prototype.__originalMappings=null,Object.defineProperty(t.prototype,"_originalMappings",{configurable:!0,enumerable:!0,get:function(){return this.__originalMappings||this._parseMappings(this._mappings,this.sourceRoot),this.__originalMappings}}),t.prototype._charIsMappingSeparator=function(e,n){var r=e.charAt(n);return";"===r||","===r},t.prototype._parseMappings=function(e,n){throw new Error("Subclasses must implement _parseMappings")},t.GENERATED_ORDER=1,t.ORIGINAL_ORDER=2,t.GREATEST_LOWER_BOUND=1,t.LEAST_UPPER_BOUND=2,t.prototype.eachMapping=function(e,n,r){var o,i=n||null,s=r||t.GENERATED_ORDER;switch(s){case t.GENERATED_ORDER:o=this._generatedMappings;break;case t.ORIGINAL_ORDER:o=this._originalMappings;break;default:throw new Error("Unknown order of iteration.")}var u=this.sourceRoot;o.map(function(e){var n=null===e.source?null:this._sources.at(e.source);return n=a.computeSourceURL(u,n,this._sourceMapURL),{source:n,generatedLine:e.generatedLine,generatedColumn:e.generatedColumn,originalLine:e.originalLine,originalColumn:e.originalColumn,name:null===e.name?null:this._names.at(e.name)}},this).forEach(e,i)},t.prototype.allGeneratedPositionsFor=function(e){var n=a.getArg(e,"line"),r={source:a.getArg(e,"source"),originalLine:n,originalColumn:a.getArg(e,"column",0)};if(r.source=this._findSourceIndex(r.source),r.source<0)return[];var t=[],o=this._findMapping(r,this._originalMappings,"originalLine","originalColumn",a.compareByOriginalPositions,u.LEAST_UPPER_BOUND);if(o>=0){var i=this._originalMappings[o];if(void 0===e.column)for(var s=i.originalLine;i&&i.originalLine===s;)t.push({line:a.getArg(i,"generatedLine",null),column:a.getArg(i,"generatedColumn",null),lastColumn:a.getArg(i,"lastGeneratedColumn",null)}),i=this._originalMappings[++o];else for(var l=i.originalColumn;i&&i.originalLine===n&&i.originalColumn==l;)t.push({line:a.getArg(i,"generatedLine",null),column:a.getArg(i,"generatedColumn",null),lastColumn:a.getArg(i,"lastGeneratedColumn",null)}),i=this._originalMappings[++o]}return t},n.SourceMapConsumer=t,o.prototype=Object.create(t.prototype),o.prototype.consumer=t,o.prototype._findSourceIndex=function(e){var n=e;if(null!=this.sourceRoot&&(n=a.relative(this.sourceRoot,n)),this._sources.has(n))return this._sources.indexOf(n);var r;for(r=0;r<this._absoluteSources.length;++r)if(this._absoluteSources[r]==e)return r;return-1},o.fromSourceMap=function(e,n){var r=Object.create(o.prototype),t=r._names=l.fromArray(e._names.toArray(),!0),s=r._sources=l.fromArray(e._sources.toArray(),!0);r.sourceRoot=e._sourceRoot,r.sourcesContent=e._generateSourcesContent(r._sources.toArray(),r.sourceRoot),r.file=e._file,r._sourceMapURL=n,r._absoluteSources=r._sources.toArray().map(function(e){return a.computeSourceURL(r.sourceRoot,e,n)});for(var u=e._mappings.toArray().slice(),c=r.__generatedMappings=[],p=r.__originalMappings=[],h=0,f=u.length;h<f;h++){var d=u[h],m=new i;m.generatedLine=d.generatedLine,m.generatedColumn=d.generatedColumn,d.source&&(m.source=s.indexOf(d.source),m.originalLine=d.originalLine,m.originalColumn=d.originalColumn,d.name&&(m.name=t.indexOf(d.name)),p.push(m)),c.push(m)}return g(r.__originalMappings,a.compareByOriginalPositions),r},o.prototype._version=3,Object.defineProperty(o.prototype,"sources",{get:function(){return this._absoluteSources.slice()}}),o.prototype._parseMappings=function(e,n){for(var r,t,o,s,u,l=1,p=0,h=0,f=0,d=0,m=0,_=e.length,v=0,y={},C={},S=[],A=[];v<_;)if(";"===e.charAt(v))l++,v++,p=0;else if(","===e.charAt(v))v++;else{for(r=new i,r.generatedLine=l,s=v;s<_&&!this._charIsMappingSeparator(e,s);s++);if(t=e.slice(v,s),o=y[t])v+=t.length;else{for(o=[];v<s;)c.decode(e,v,C),u=C.value,v=C.rest,o.push(u);if(2===o.length)throw new Error("Found a source, but no line and column");if(3===o.length)throw new Error("Found a source and line, but no column");y[t]=o}r.generatedColumn=p+o[0],p=r.generatedColumn,o.length>1&&(r.source=d+o[1],d+=o[1],r.originalLine=h+o[2],h=r.originalLine,r.originalLine+=1,r.originalColumn=f+o[3],f=r.originalColumn,o.length>4&&(r.name=m+o[4],m+=o[4])),A.push(r),"number"==typeof r.originalLine&&S.push(r)}g(A,a.compareByGeneratedPositionsDeflated),this.__generatedMappings=A,g(S,a.compareByOriginalPositions),this.__originalMappings=S},o.prototype._findMapping=function(e,n,r,t,o,i){if(e[r]<=0)throw new TypeError("Line must be greater than or equal to 1, got "+e[r]);if(e[t]<0)throw new TypeError("Column must be greater than or equal to 0, got "+e[t]);return u.search(e,n,o,i)},o.prototype.computeColumnSpans=function(){for(var e=0;e<this._generatedMappings.length;++e){var n=this._generatedMappings[e];if(e+1<this._generatedMappings.length){var r=this._generatedMappings[e+1];if(n.generatedLine===r.generatedLine){n.lastGeneratedColumn=r.generatedColumn-1;continue}}n.lastGeneratedColumn=1/0}},o.prototype.originalPositionFor=function(e){var n={generatedLine:a.getArg(e,"line"),generatedColumn:a.getArg(e,"column")},r=this._findMapping(n,this._generatedMappings,"generatedLine","generatedColumn",a.compareByGeneratedPositionsDeflated,a.getArg(e,"bias",t.GREATEST_LOWER_BOUND));if(r>=0){var o=this._generatedMappings[r];if(o.generatedLine===n.generatedLine){var i=a.getArg(o,"source",null);null!==i&&(i=this._sources.at(i),i=a.computeSourceURL(this.sourceRoot,i,this._sourceMapURL));var s=a.getArg(o,"name",null);return null!==s&&(s=this._names.at(s)),{source:i,line:a.getArg(o,"originalLine",null),column:a.getArg(o,"originalColumn",null),name:s}}}return{source:null,line:null,column:null,name:null}},o.prototype.hasContentsOfAllSources=function(){return!!this.sourcesContent&&(this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(e){return null==e}))},o.prototype.sourceContentFor=function(e,n){if(!this.sourcesContent)return null;var r=this._findSourceIndex(e);if(r>=0)return this.sourcesContent[r];var t=e;null!=this.sourceRoot&&(t=a.relative(this.sourceRoot,t));var o;if(null!=this.sourceRoot&&(o=a.urlParse(this.sourceRoot))){var i=t.replace(/^file:\/\//,"");if("file"==o.scheme&&this._sources.has(i))return this.sourcesContent[this._sources.indexOf(i)];if((!o.path||"/"==o.path)&&this._sources.has("/"+t))return this.sourcesContent[this._sources.indexOf("/"+t)]}if(n)return null;throw new Error('"'+t+'" is not in the SourceMap.')},o.prototype.generatedPositionFor=function(e){var n=a.getArg(e,"source");if(n=this._findSourceIndex(n),n<0)return{line:null,column:null,lastColumn:null};var r={source:n,originalLine:a.getArg(e,"line"),originalColumn:a.getArg(e,"column")},o=this._findMapping(r,this._originalMappings,"originalLine","originalColumn",a.compareByOriginalPositions,a.getArg(e,"bias",t.GREATEST_LOWER_BOUND));if(o>=0){var i=this._originalMappings[o];if(i.source===r.source)return{line:a.getArg(i,"generatedLine",null),column:a.getArg(i,"generatedColumn",null),lastColumn:a.getArg(i,"lastGeneratedColumn",null)}}return{line:null,column:null,lastColumn:null}},n.BasicSourceMapConsumer=o,s.prototype=Object.create(t.prototype),s.prototype.constructor=t,s.prototype._version=3,Object.defineProperty(s.prototype,"sources",{get:function(){for(var e=[],n=0;n<this._sections.length;n++)for(var r=0;r<this._sections[n].consumer.sources.length;r++)e.push(this._sections[n].consumer.sources[r]);return e}}),s.prototype.originalPositionFor=function(e){var n={generatedLine:a.getArg(e,"line"),generatedColumn:a.getArg(e,"column")},r=u.search(n,this._sections,function(e,n){var r=e.generatedLine-n.generatedOffset.generatedLine;return r?r:e.generatedColumn-n.generatedOffset.generatedColumn}),t=this._sections[r];return t?t.consumer.originalPositionFor({line:n.generatedLine-(t.generatedOffset.generatedLine-1),column:n.generatedColumn-(t.generatedOffset.generatedLine===n.generatedLine?t.generatedOffset.generatedColumn-1:0),bias:e.bias}):{source:null,line:null,column:null,name:null}},s.prototype.hasContentsOfAllSources=function(){return this._sections.every(function(e){return e.consumer.hasContentsOfAllSources()})},s.prototype.sourceContentFor=function(e,n){for(var r=0;r<this._sections.length;r++){var t=this._sections[r],o=t.consumer.sourceContentFor(e,!0);if(o)return o}if(n)return null;throw new Error('"'+e+'" is not in the SourceMap.')},s.prototype.generatedPositionFor=function(e){for(var n=0;n<this._sections.length;n++){var r=this._sections[n];if(r.consumer._findSourceIndex(a.getArg(e,"source"))!==-1){var t=r.consumer.generatedPositionFor(e);if(t){var o={line:t.line+(r.generatedOffset.generatedLine-1),column:t.column+(r.generatedOffset.generatedLine===t.line?r.generatedOffset.generatedColumn-1:0)};return o}}}return{line:null,column:null}},s.prototype._parseMappings=function(e,n){this.__generatedMappings=[],this.__originalMappings=[];for(var r=0;r<this._sections.length;r++)for(var t=this._sections[r],o=t.consumer._generatedMappings,i=0;i<o.length;i++){var s=o[i],u=t.consumer._sources.at(s.source);u=a.computeSourceURL(t.consumer.sourceRoot,u,this._sourceMapURL),this._sources.add(u),u=this._sources.indexOf(u);var l=null;s.name&&(l=t.consumer._names.at(s.name),this._names.add(l),l=this._names.indexOf(l));var c={source:u,generatedLine:s.generatedLine+(t.generatedOffset.generatedLine-1),generatedColumn:s.generatedColumn+(t.generatedOffset.generatedLine===s.generatedLine?t.generatedOffset.generatedColumn-1:0),originalLine:s.originalLine,originalColumn:s.originalColumn,name:l};this.__generatedMappings.push(c),"number"==typeof c.originalLine&&this.__originalMappings.push(c)}g(this.__generatedMappings,a.compareByGeneratedPositionsDeflated),g(this.__originalMappings,a.compareByOriginalPositions)},n.IndexedSourceMapConsumer=s},function(e,n){function r(e,t,o,i,s,a){var u=Math.floor((t-e)/2)+e,l=s(o,i[u],!0);return 0===l?u:l>0?t-u>1?r(u,t,o,i,s,a):a==n.LEAST_UPPER_BOUND?t<i.length?t:-1:u:u-e>1?r(e,u,o,i,s,a):a==n.LEAST_UPPER_BOUND?u:e<0?-1:e}n.GREATEST_LOWER_BOUND=1,n.LEAST_UPPER_BOUND=2,n.search=function(e,t,o,i){if(0===t.length)return-1;var s=r(-1,t.length,e,t,o,i||n.GREATEST_LOWER_BOUND);if(s<0)return-1;for(;s-1>=0&&0===o(t[s],t[s-1],!0);)--s;return s}},function(e,n){function r(e,n,r){var t=e[n];e[n]=e[r],e[r]=t}function t(e,n){return Math.round(e+Math.random()*(n-e))}function o(e,n,i,s){if(i<s){var a=t(i,s),u=i-1;r(e,a,s);for(var l=e[s],c=i;c<s;c++)n(e[c],l)<=0&&(u+=1,r(e,u,c));r(e,u+1,c);var g=u+1;o(e,n,i,g-1),o(e,n,g+1,s)}}n.quickSort=function(e,n){o(e,n,0,e.length-1)}},function(e,n,r){function t(e,n,r,t,o){this.children=[],this.sourceContents={},this.line=null==e?null:e,this.column=null==n?null:n,this.source=null==r?null:r,this.name=null==o?null:o,this[u]=!0,null!=t&&this.add(t)}var o=r(1).SourceMapGenerator,i=r(4),s=/(\r?\n)/,a=10,u="$$$isSourceNode$$$";t.fromStringWithSourceMap=function(e,n,r){function o(e,n){if(null===e||void 0===e.source)a.add(n);else{var o=r?i.join(r,e.source):e.source;a.add(new t(e.originalLine,e.originalColumn,o,n,e.name))}}var a=new t,u=e.split(s),l=0,c=function(){function e(){return l<u.length?u[l++]:void 0}var n=e(),r=e()||"";return n+r},g=1,p=0,h=null;return n.eachMapping(function(e){if(null!==h){if(!(g<e.generatedLine)){var n=u[l]||"",r=n.substr(0,e.generatedColumn-p);return u[l]=n.substr(e.generatedColumn-p),p=e.generatedColumn,o(h,r),void(h=e)}o(h,c()),g++,p=0}for(;g<e.generatedLine;)a.add(c()),g++;if(p<e.generatedColumn){var n=u[l]||"";a.add(n.substr(0,e.generatedColumn)),u[l]=n.substr(e.generatedColumn),p=e.generatedColumn}h=e},this),l<u.length&&(h&&o(h,c()),a.add(u.splice(l).join(""))),n.sources.forEach(function(e){var t=n.sourceContentFor(e);null!=t&&(null!=r&&(e=i.join(r,e)),a.setSourceContent(e,t))}),a},t.prototype.add=function(e){if(Array.isArray(e))e.forEach(function(e){this.add(e)},this);else{if(!e[u]&&"string"!=typeof e)throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+e);e&&this.children.push(e)}return this},t.prototype.prepend=function(e){if(Array.isArray(e))for(var n=e.length-1;n>=0;n--)this.prepend(e[n]);else{if(!e[u]&&"string"!=typeof e)throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+e);this.children.unshift(e)}return this},t.prototype.walk=function(e){for(var n,r=0,t=this.children.length;r<t;r++)n=this.children[r],n[u]?n.walk(e):""!==n&&e(n,{source:this.source,line:this.line,column:this.column,name:this.name})},t.prototype.join=function(e){var n,r,t=this.children.length;if(t>0){for(n=[],r=0;r<t-1;r++)n.push(this.children[r]),n.push(e);n.push(this.children[r]),this.children=n}return this},t.prototype.replaceRight=function(e,n){var r=this.children[this.children.length-1];return r[u]?r.replaceRight(e,n):"string"==typeof r?this.children[this.children.length-1]=r.replace(e,n):this.children.push("".replace(e,n)),this},t.prototype.setSourceContent=function(e,n){this.sourceContents[i.toSetString(e)]=n},t.prototype.walkSourceContents=function(e){for(var n=0,r=this.children.length;n<r;n++)this.children[n][u]&&this.children[n].walkSourceContents(e);for(var t=Object.keys(this.sourceContents),n=0,r=t.length;n<r;n++)e(i.fromSetString(t[n]),this.sourceContents[t[n]])},t.prototype.toString=function(){var e="";return this.walk(function(n){e+=n}),e},t.prototype.toStringWithSourceMap=function(e){var n={code:"",line:1,column:0},r=new o(e),t=!1,i=null,s=null,u=null,l=null;return this.walk(function(e,o){n.code+=e,null!==o.source&&null!==o.line&&null!==o.column?(i===o.source&&s===o.line&&u===o.column&&l===o.name||r.addMapping({source:o.source,original:{line:o.line,column:o.column},generated:{line:n.line,column:n.column},name:o.name}),i=o.source,s=o.line,u=o.column,l=o.name,t=!0):t&&(r.addMapping({generated:{line:n.line,column:n.column}}),i=null,t=!1);for(var c=0,g=e.length;c<g;c++)e.charCodeAt(c)===a?(n.line++,n.column=0,c+1===g?(i=null,t=!1):t&&r.addMapping({source:o.source,original:{line:o.line,column:o.column},generated:{line:n.line,column:n.column},name:o.name})):n.column++}),this.walkSourceContents(function(e,n){r.setSourceContent(e,n)}),{code:n.code,map:r}},n.SourceNode=t}])});
+//# sourceMappingURL=source-map.min.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.min.js.map b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.min.js.map
new file mode 100644
index 0000000..d2cc86e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/dist/source-map.min.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///source-map.min.js","webpack:///webpack/bootstrap 0fd5815da764db5fb9fe","webpack:///./source-map.js","webpack:///./lib/source-map-generator.js","webpack:///./lib/base64-vlq.js","webpack:///./lib/base64.js","webpack:///./lib/util.js","webpack:///./lib/array-set.js","webpack:///./lib/mapping-list.js","webpack:///./lib/source-map-consumer.js","webpack:///./lib/binary-search.js","webpack:///./lib/quick-sort.js","webpack:///./lib/source-node.js"],"names":["root","factory","exports","module","define","amd","this","modules","__webpack_require__","moduleId","installedModules","id","loaded","call","m","c","p","SourceMapGenerator","SourceMapConsumer","SourceNode","aArgs","_file","util","getArg","_sourceRoot","_skipValidation","_sources","ArraySet","_names","_mappings","MappingList","_sourcesContents","base64VLQ","prototype","_version","fromSourceMap","aSourceMapConsumer","sourceRoot","generator","file","eachMapping","mapping","newMapping","generated","line","generatedLine","column","generatedColumn","source","relative","original","originalLine","originalColumn","name","addMapping","sources","forEach","sourceFile","sourceRelative","has","add","content","sourceContentFor","setSourceContent","_validateMapping","String","aSourceFile","aSourceContent","Object","create","toSetString","keys","length","applySourceMap","aSourceMapPath","Error","newSources","newNames","unsortedForEach","originalPositionFor","join","aGenerated","aOriginal","aSource","aName","JSON","stringify","_serializeMappings","next","nameIdx","sourceIdx","previousGeneratedColumn","previousGeneratedLine","previousOriginalColumn","previousOriginalLine","previousName","previousSource","result","mappings","toArray","i","len","compareByGeneratedPositionsInflated","encode","indexOf","_generateSourcesContent","aSources","aSourceRoot","map","key","hasOwnProperty","toJSON","version","names","sourcesContent","toString","toVLQSigned","aValue","fromVLQSigned","isNegative","shifted","base64","VLQ_BASE_SHIFT","VLQ_BASE","VLQ_BASE_MASK","VLQ_CONTINUATION_BIT","digit","encoded","vlq","decode","aStr","aIndex","aOutParam","continuation","strLen","shift","charCodeAt","charAt","value","rest","intToCharMap","split","number","TypeError","charCode","bigA","bigZ","littleA","littleZ","zero","nine","plus","slash","littleOffset","numberOffset","aDefaultValue","arguments","urlParse","aUrl","match","urlRegexp","scheme","auth","host","port","path","urlGenerate","aParsedUrl","url","normalize","aPath","part","isAbsolute","parts","up","splice","aRoot","aPathUrl","aRootUrl","dataUrlRegexp","joined","replace","level","index","lastIndexOf","slice","Array","substr","identity","s","isProtoString","fromSetString","compareByOriginalPositions","mappingA","mappingB","onlyCompareOriginal","cmp","strcmp","compareByGeneratedPositionsDeflated","onlyCompareGenerated","aStr1","aStr2","parseSourceMapInput","str","parse","computeSourceURL","sourceURL","sourceMapURL","parsed","substring","test","supportsNullProto","obj","_array","_set","hasNativeMap","Map","fromArray","aArray","aAllowDuplicates","set","size","getOwnPropertyNames","sStr","isDuplicate","idx","push","get","at","aIdx","generatedPositionAfter","lineA","lineB","columnA","columnB","_sorted","_last","aCallback","aThisArg","aMapping","sort","aSourceMap","aSourceMapURL","sourceMap","sections","IndexedSourceMapConsumer","BasicSourceMapConsumer","_absoluteSources","_sourceMapURL","Mapping","lastOffset","_sections","offset","offsetLine","offsetColumn","generatedOffset","consumer","binarySearch","quickSort","__generatedMappings","defineProperty","configurable","enumerable","_parseMappings","__originalMappings","_charIsMappingSeparator","GENERATED_ORDER","ORIGINAL_ORDER","GREATEST_LOWER_BOUND","LEAST_UPPER_BOUND","aContext","aOrder","context","order","_generatedMappings","_originalMappings","allGeneratedPositionsFor","needle","_findSourceIndex","_findMapping","undefined","lastColumn","relativeSource","smc","generatedMappings","destGeneratedMappings","destOriginalMappings","srcMapping","destMapping","segment","end","cachedSegments","temp","originalMappings","aNeedle","aMappings","aLineName","aColumnName","aComparator","aBias","search","computeColumnSpans","nextMapping","lastGeneratedColumn","Infinity","hasContentsOfAllSources","some","sc","nullOnMissing","fileUriAbsPath","generatedPositionFor","constructor","j","sectionIndex","section","bias","every","generatedPosition","ret","sectionMappings","adjustedMapping","recursiveSearch","aLow","aHigh","aHaystack","aCompare","mid","Math","floor","swap","ary","x","y","randomIntInRange","low","high","round","random","doQuickSort","comparator","r","pivotIndex","pivot","q","aLine","aColumn","aChunks","children","sourceContents","isSourceNode","REGEX_NEWLINE","NEWLINE_CODE","fromStringWithSourceMap","aGeneratedCode","aRelativePath","addMappingWithCode","code","node","remainingLines","remainingLinesIndex","shiftNextLine","getNextLine","lineContents","newLine","lastGeneratedLine","lastMapping","nextLine","aChunk","isArray","chunk","prepend","unshift","walk","aFn","aSep","newChildren","replaceRight","aPattern","aReplacement","lastChild","walkSourceContents","toStringWithSourceMap","sourceMappingActive","lastOriginalSource","lastOriginalLine","lastOriginalColumn","lastOriginalName","sourceContent"],"mappings":"CAAA,SAAAA,EAAAC,GACA,gBAAAC,UAAA,gBAAAC,QACAA,OAAAD,QAAAD,IACA,kBAAAG,gBAAAC,IACAD,UAAAH,GACA,gBAAAC,SACAA,QAAA,UAAAD,IAEAD,EAAA,UAAAC,KACCK,KAAA,WACD,MCAgB,UAAUC,GCN1B,QAAAC,GAAAC,GAGA,GAAAC,EAAAD,GACA,MAAAC,GAAAD,GAAAP,OAGA,IAAAC,GAAAO,EAAAD,IACAP,WACAS,GAAAF,EACAG,QAAA,EAUA,OANAL,GAAAE,GAAAI,KAAAV,EAAAD,QAAAC,IAAAD,QAAAM,GAGAL,EAAAS,QAAA,EAGAT,EAAAD,QAvBA,GAAAQ,KAqCA,OATAF,GAAAM,EAAAP,EAGAC,EAAAO,EAAAL,EAGAF,EAAAQ,EAAA,GAGAR,EAAA,KDgBM,SAAUL,EAAQD,EAASM,GEjDjCN,EAAAe,mBAAAT,EAAA,GAAAS,mBACAf,EAAAgB,kBAAAV,EAAA,GAAAU,kBACAhB,EAAAiB,WAAAX,EAAA,IAAAW,YF6DM,SAAUhB,EAAQD,EAASM,GGhDjC,QAAAS,GAAAG,GACAA,IACAA,MAEAd,KAAAe,MAAAC,EAAAC,OAAAH,EAAA,aACAd,KAAAkB,YAAAF,EAAAC,OAAAH,EAAA,mBACAd,KAAAmB,gBAAAH,EAAAC,OAAAH,EAAA,qBACAd,KAAAoB,SAAA,GAAAC,GACArB,KAAAsB,OAAA,GAAAD,GACArB,KAAAuB,UAAA,GAAAC,GACAxB,KAAAyB,iBAAA,KAvBA,GAAAC,GAAAxB,EAAA,GACAc,EAAAd,EAAA,GACAmB,EAAAnB,EAAA,GAAAmB,SACAG,EAAAtB,EAAA,GAAAsB,WAuBAb,GAAAgB,UAAAC,SAAA,EAOAjB,EAAAkB,cACA,SAAAC,GACA,GAAAC,GAAAD,EAAAC,WACAC,EAAA,GAAArB,IACAsB,KAAAH,EAAAG,KACAF,cA2CA,OAzCAD,GAAAI,YAAA,SAAAC,GACA,GAAAC,IACAC,WACAC,KAAAH,EAAAI,cACAC,OAAAL,EAAAM,iBAIA,OAAAN,EAAAO,SACAN,EAAAM,OAAAP,EAAAO,OACA,MAAAX,IACAK,EAAAM,OAAA1B,EAAA2B,SAAAZ,EAAAK,EAAAM,SAGAN,EAAAQ,UACAN,KAAAH,EAAAU,aACAL,OAAAL,EAAAW,gBAGA,MAAAX,EAAAY,OACAX,EAAAW,KAAAZ,EAAAY,OAIAf,EAAAgB,WAAAZ,KAEAN,EAAAmB,QAAAC,QAAA,SAAAC,GACA,GAAAC,GAAAD,CACA,QAAApB,IACAqB,EAAApC,EAAA2B,SAAAZ,EAAAoB,IAGAnB,EAAAZ,SAAAiC,IAAAD,IACApB,EAAAZ,SAAAkC,IAAAF,EAGA,IAAAG,GAAAzB,EAAA0B,iBAAAL,EACA,OAAAI,GACAvB,EAAAyB,iBAAAN,EAAAI,KAGAvB,GAaArB,EAAAgB,UAAAqB,WACA,SAAAlC,GACA,GAAAuB,GAAArB,EAAAC,OAAAH,EAAA,aACA8B,EAAA5B,EAAAC,OAAAH,EAAA,iBACA4B,EAAA1B,EAAAC,OAAAH,EAAA,eACAiC,EAAA/B,EAAAC,OAAAH,EAAA,YAEAd,MAAAmB,iBACAnB,KAAA0D,iBAAArB,EAAAO,EAAAF,EAAAK,GAGA,MAAAL,IACAA,EAAAiB,OAAAjB,GACA1C,KAAAoB,SAAAiC,IAAAX,IACA1C,KAAAoB,SAAAkC,IAAAZ,IAIA,MAAAK,IACAA,EAAAY,OAAAZ,GACA/C,KAAAsB,OAAA+B,IAAAN,IACA/C,KAAAsB,OAAAgC,IAAAP,IAIA/C,KAAAuB,UAAA+B,KACAf,cAAAF,EAAAC,KACAG,gBAAAJ,EAAAG,OACAK,aAAA,MAAAD,KAAAN,KACAQ,eAAA,MAAAF,KAAAJ,OACAE,SACAK,UAOApC,EAAAgB,UAAA8B,iBACA,SAAAG,EAAAC,GACA,GAAAnB,GAAAkB,CACA,OAAA5D,KAAAkB,cACAwB,EAAA1B,EAAA2B,SAAA3C,KAAAkB,YAAAwB,IAGA,MAAAmB,GAGA7D,KAAAyB,mBACAzB,KAAAyB,iBAAAqC,OAAAC,OAAA,OAEA/D,KAAAyB,iBAAAT,EAAAgD,YAAAtB,IAAAmB,GACK7D,KAAAyB,yBAGLzB,MAAAyB,iBAAAT,EAAAgD,YAAAtB,IACA,IAAAoB,OAAAG,KAAAjE,KAAAyB,kBAAAyC,SACAlE,KAAAyB,iBAAA,QAqBAd,EAAAgB,UAAAwC,eACA,SAAArC,EAAA8B,EAAAQ,GACA,GAAAjB,GAAAS,CAEA,UAAAA,EAAA,CACA,SAAA9B,EAAAG,KACA,SAAAoC,OACA,gJAIAlB,GAAArB,EAAAG,KAEA,GAAAF,GAAA/B,KAAAkB,WAEA,OAAAa,IACAoB,EAAAnC,EAAA2B,SAAAZ,EAAAoB,GAIA,IAAAmB,GAAA,GAAAjD,GACAkD,EAAA,GAAAlD,EAGArB,MAAAuB,UAAAiD,gBAAA,SAAArC,GACA,GAAAA,EAAAO,SAAAS,GAAA,MAAAhB,EAAAU,aAAA,CAEA,GAAAD,GAAAd,EAAA2C,qBACAnC,KAAAH,EAAAU,aACAL,OAAAL,EAAAW,gBAEA,OAAAF,EAAAF,SAEAP,EAAAO,OAAAE,EAAAF,OACA,MAAA0B,IACAjC,EAAAO,OAAA1B,EAAA0D,KAAAN,EAAAjC,EAAAO,SAEA,MAAAX,IACAI,EAAAO,OAAA1B,EAAA2B,SAAAZ,EAAAI,EAAAO,SAEAP,EAAAU,aAAAD,EAAAN,KACAH,EAAAW,eAAAF,EAAAJ,OACA,MAAAI,EAAAG,OACAZ,EAAAY,KAAAH,EAAAG,OAKA,GAAAL,GAAAP,EAAAO,MACA,OAAAA,GAAA4B,EAAAjB,IAAAX,IACA4B,EAAAhB,IAAAZ,EAGA,IAAAK,GAAAZ,EAAAY,IACA,OAAAA,GAAAwB,EAAAlB,IAAAN,IACAwB,EAAAjB,IAAAP,IAGK/C,MACLA,KAAAoB,SAAAkD,EACAtE,KAAAsB,OAAAiD,EAGAzC,EAAAmB,QAAAC,QAAA,SAAAC,GACA,GAAAI,GAAAzB,EAAA0B,iBAAAL,EACA,OAAAI,IACA,MAAAa,IACAjB,EAAAnC,EAAA0D,KAAAN,EAAAjB,IAEA,MAAApB,IACAoB,EAAAnC,EAAA2B,SAAAZ,EAAAoB,IAEAnD,KAAAyD,iBAAAN,EAAAI,KAEKvD,OAcLW,EAAAgB,UAAA+B,iBACA,SAAAiB,EAAAC,EAAAC,EACAC,GAKA,GAAAF,GAAA,gBAAAA,GAAAtC,MAAA,gBAAAsC,GAAApC,OACA,SAAA6B,OACA,+OAMA,OAAAM,GAAA,QAAAA,IAAA,UAAAA,IACAA,EAAArC,KAAA,GAAAqC,EAAAnC,QAAA,IACAoC,GAAAC,GAAAC,MAIAH,GAAA,QAAAA,IAAA,UAAAA,IACAC,GAAA,QAAAA,IAAA,UAAAA,IACAD,EAAArC,KAAA,GAAAqC,EAAAnC,QAAA,GACAoC,EAAAtC,KAAA,GAAAsC,EAAApC,QAAA,GACAqC,GAKA,SAAAR,OAAA,oBAAAU,KAAAC,WACA3C,UAAAsC,EACAjC,OAAAmC,EACAjC,SAAAgC,EACA7B,KAAA+B,MASAnE,EAAAgB,UAAAsD,mBACA,WAcA,OANAC,GACA/C,EACAgD,EACAC,EAVAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,GAMAC,EAAA5F,KAAAuB,UAAAsE,UACAC,EAAA,EAAAC,EAAAH,EAAA1B,OAA0C4B,EAAAC,EAASD,IAAA,CAInD,GAHA3D,EAAAyD,EAAAE,GACAZ,EAAA,GAEA/C,EAAAI,gBAAA+C,EAEA,IADAD,EAAA,EACAlD,EAAAI,gBAAA+C,GACAJ,GAAA,IACAI,QAIA,IAAAQ,EAAA,GACA,IAAA9E,EAAAgF,oCAAA7D,EAAAyD,EAAAE,EAAA,IACA,QAEAZ,IAAA,IAIAA,GAAAxD,EAAAuE,OAAA9D,EAAAM,gBACA4C,GACAA,EAAAlD,EAAAM,gBAEA,MAAAN,EAAAO,SACA0C,EAAApF,KAAAoB,SAAA8E,QAAA/D,EAAAO,QACAwC,GAAAxD,EAAAuE,OAAAb,EAAAM,GACAA,EAAAN,EAGAF,GAAAxD,EAAAuE,OAAA9D,EAAAU,aAAA,EACA2C,GACAA,EAAArD,EAAAU,aAAA,EAEAqC,GAAAxD,EAAAuE,OAAA9D,EAAAW,eACAyC,GACAA,EAAApD,EAAAW,eAEA,MAAAX,EAAAY,OACAoC,EAAAnF,KAAAsB,OAAA4E,QAAA/D,EAAAY,MACAmC,GAAAxD,EAAAuE,OAAAd,EAAAM,GACAA,EAAAN,IAIAQ,GAAAT,EAGA,MAAAS,IAGAhF,EAAAgB,UAAAwE,wBACA,SAAAC,EAAAC,GACA,MAAAD,GAAAE,IAAA,SAAA5D,GACA,IAAA1C,KAAAyB,iBACA,WAEA,OAAA4E,IACA3D,EAAA1B,EAAA2B,SAAA0D,EAAA3D,GAEA,IAAA6D,GAAAvF,EAAAgD,YAAAtB,EACA,OAAAoB,QAAAnC,UAAA6E,eAAAjG,KAAAP,KAAAyB,iBAAA8E,GACAvG,KAAAyB,iBAAA8E,GACA,MACKvG,OAMLW,EAAAgB,UAAA8E,OACA,WACA,GAAAH,IACAI,QAAA1G,KAAA4B,SACAqB,QAAAjD,KAAAoB,SAAAyE,UACAc,MAAA3G,KAAAsB,OAAAuE,UACAD,SAAA5F,KAAAiF,qBAYA,OAVA,OAAAjF,KAAAe,QACAuF,EAAArE,KAAAjC,KAAAe,OAEA,MAAAf,KAAAkB,cACAoF,EAAAvE,WAAA/B,KAAAkB,aAEAlB,KAAAyB,mBACA6E,EAAAM,eAAA5G,KAAAmG,wBAAAG,EAAArD,QAAAqD,EAAAvE,aAGAuE,GAMA3F,EAAAgB,UAAAkF,SACA,WACA,MAAA9B,MAAAC,UAAAhF,KAAAyG,WAGA7G,EAAAe,sBH2EM,SAAUd,EAAQD,EAASM,GI/ajC,QAAA4G,GAAAC,GACA,MAAAA,GAAA,IACAA,GAAA,MACAA,GAAA,KASA,QAAAC,GAAAD,GACA,GAAAE,GAAA,OAAAF,GACAG,EAAAH,GAAA,CACA,OAAAE,IACAC,EACAA,EAhDA,GAAAC,GAAAjH,EAAA,GAcAkH,EAAA,EAGAC,EAAA,GAAAD,EAGAE,EAAAD,EAAA,EAGAE,EAAAF,CA+BAzH,GAAAqG,OAAA,SAAAc,GACA,GACAS,GADAC,EAAA,GAGAC,EAAAZ,EAAAC,EAEA,GACAS,GAAAE,EAAAJ,EACAI,KAAAN,EACAM,EAAA,IAGAF,GAAAD,GAEAE,GAAAN,EAAAlB,OAAAuB,SACGE,EAAA,EAEH,OAAAD,IAOA7H,EAAA+H,OAAA,SAAAC,EAAAC,EAAAC,GACA,GAGAC,GAAAP,EAHAQ,EAAAJ,EAAA1D,OACAyB,EAAA,EACAsC,EAAA,CAGA,IACA,GAAAJ,GAAAG,EACA,SAAA3D,OAAA,6CAIA,IADAmD,EAAAL,EAAAQ,OAAAC,EAAAM,WAAAL,MACAL,KAAA,EACA,SAAAnD,OAAA,yBAAAuD,EAAAO,OAAAN,EAAA,GAGAE,MAAAP,EAAAD,GACAC,GAAAF,EACA3B,GAAA6B,GAAAS,EACAA,GAAAb,QACGW,EAEHD,GAAAM,MAAApB,EAAArB,GACAmC,EAAAO,KAAAR,IJ2fM,SAAUhI,EAAQD,GK9nBxB,GAAA0I,GAAA,mEAAAC,MAAA,GAKA3I,GAAAqG,OAAA,SAAAuC,GACA,MAAAA,KAAAF,EAAApE,OACA,MAAAoE,GAAAE,EAEA,UAAAC,WAAA,6BAAAD,IAOA5I,EAAA+H,OAAA,SAAAe,GACA,GAAAC,GAAA,GACAC,EAAA,GAEAC,EAAA,GACAC,EAAA,IAEAC,EAAA,GACAC,EAAA,GAEAC,EAAA,GACAC,EAAA,GAEAC,EAAA,GACAC,EAAA,EAGA,OAAAT,IAAAD,MAAAE,EACAF,EAAAC,EAIAE,GAAAH,MAAAI,EACAJ,EAAAG,EAAAM,EAIAJ,GAAAL,MAAAM,EACAN,EAAAK,EAAAK,EAIAV,GAAAO,EACA,GAIAP,GAAAQ,EACA,IAIA,IL6oBM,SAAUrJ,EAAQD,GM7rBxB,QAAAqB,GAAAH,EAAAgE,EAAAuE,GACA,GAAAvE,IAAAhE,GACA,MAAAA,GAAAgE,EACG,QAAAwE,UAAApF,OACH,MAAAmF,EAEA,UAAAhF,OAAA,IAAAS,EAAA,6BAQA,QAAAyE,GAAAC,GACA,GAAAC,GAAAD,EAAAC,MAAAC,EACA,OAAAD,IAIAE,OAAAF,EAAA,GACAG,KAAAH,EAAA,GACAI,KAAAJ,EAAA,GACAK,KAAAL,EAAA,GACAM,KAAAN,EAAA,IAPA,KAYA,QAAAO,GAAAC,GACA,GAAAC,GAAA,EAiBA,OAhBAD,GAAAN,SACAO,GAAAD,EAAAN,OAAA,KAEAO,GAAA,KACAD,EAAAL,OACAM,GAAAD,EAAAL,KAAA,KAEAK,EAAAJ,OACAK,GAAAD,EAAAJ,MAEAI,EAAAH,OACAI,GAAA,IAAAD,EAAAH,MAEAG,EAAAF,OACAG,GAAAD,EAAAF,MAEAG,EAeA,QAAAC,GAAAC,GACA,GAAAL,GAAAK,EACAF,EAAAX,EAAAa,EACA,IAAAF,EAAA,CACA,IAAAA,EAAAH,KACA,MAAAK,EAEAL,GAAAG,EAAAH,KAKA,OAAAM,GAHAC,EAAA1K,EAAA0K,WAAAP,GAEAQ,EAAAR,EAAAxB,MAAA,OACAiC,EAAA,EAAA1E,EAAAyE,EAAArG,OAAA,EAA8C4B,GAAA,EAAQA,IACtDuE,EAAAE,EAAAzE,GACA,MAAAuE,EACAE,EAAAE,OAAA3E,EAAA,GACK,OAAAuE,EACLG,IACKA,EAAA,IACL,KAAAH,GAIAE,EAAAE,OAAA3E,EAAA,EAAA0E,GACAA,EAAA,IAEAD,EAAAE,OAAA3E,EAAA,GACA0E,KAUA,OANAT,GAAAQ,EAAA7F,KAAA,KAEA,KAAAqF,IACAA,EAAAO,EAAA,SAGAJ,GACAA,EAAAH,OACAC,EAAAE,IAEAH,EAoBA,QAAArF,GAAAgG,EAAAN,GACA,KAAAM,IACAA,EAAA,KAEA,KAAAN,IACAA,EAAA,IAEA,IAAAO,GAAApB,EAAAa,GACAQ,EAAArB,EAAAmB,EAMA,IALAE,IACAF,EAAAE,EAAAb,MAAA,KAIAY,MAAAhB,OAIA,MAHAiB,KACAD,EAAAhB,OAAAiB,EAAAjB,QAEAK,EAAAW,EAGA,IAAAA,GAAAP,EAAAX,MAAAoB,GACA,MAAAT,EAIA,IAAAQ,MAAAf,OAAAe,EAAAb,KAEA,MADAa,GAAAf,KAAAO,EACAJ,EAAAY,EAGA,IAAAE,GAAA,MAAAV,EAAAjC,OAAA,GACAiC,EACAD,EAAAO,EAAAK,QAAA,eAAAX,EAEA,OAAAQ,IACAA,EAAAb,KAAAe,EACAd,EAAAY,IAEAE,EAcA,QAAAnI,GAAA+H,EAAAN,GACA,KAAAM,IACAA,EAAA,KAGAA,IAAAK,QAAA,SAOA,KADA,GAAAC,GAAA,EACA,IAAAZ,EAAAlE,QAAAwE,EAAA,OACA,GAAAO,GAAAP,EAAAQ,YAAA,IACA,IAAAD,EAAA,EACA,MAAAb,EAOA,IADAM,IAAAS,MAAA,EAAAF,GACAP,EAAAjB,MAAA,qBACA,MAAAW,KAGAY,EAIA,MAAAI,OAAAJ,EAAA,GAAAtG,KAAA,OAAA0F,EAAAiB,OAAAX,EAAAxG,OAAA,GASA,QAAAoH,GAAAC,GACA,MAAAA,GAYA,QAAAvH,GAAA4D,GACA,MAAA4D,GAAA5D,GACA,IAAAA,EAGAA,EAIA,QAAA6D,GAAA7D,GACA,MAAA4D,GAAA5D,GACAA,EAAAuD,MAAA,GAGAvD,EAIA,QAAA4D,GAAAD,GACA,IAAAA,EACA,QAGA,IAAArH,GAAAqH,EAAArH,MAEA,IAAAA,EAAA,EACA,QAGA,SAAAqH,EAAArD,WAAAhE,EAAA,IACA,KAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,KAAAqH,EAAArD,WAAAhE,EAAA,IACA,KAAAqH,EAAArD,WAAAhE,EAAA,GACA,QAGA,QAAA4B,GAAA5B,EAAA,GAA2B4B,GAAA,EAAQA,IACnC,QAAAyF,EAAArD,WAAApC,GACA,QAIA,UAWA,QAAA4F,GAAAC,EAAAC,EAAAC,GACA,GAAAC,GAAAC,EAAAJ,EAAAjJ,OAAAkJ,EAAAlJ,OACA,YAAAoJ,EACAA,GAGAA,EAAAH,EAAA9I,aAAA+I,EAAA/I,aACA,IAAAiJ,EACAA,GAGAA,EAAAH,EAAA7I,eAAA8I,EAAA9I,eACA,IAAAgJ,GAAAD,EACAC,GAGAA,EAAAH,EAAAlJ,gBAAAmJ,EAAAnJ,gBACA,IAAAqJ,EACAA,GAGAA,EAAAH,EAAApJ,cAAAqJ,EAAArJ,cACA,IAAAuJ,EACAA,EAGAC,EAAAJ,EAAA5I,KAAA6I,EAAA7I,UAaA,QAAAiJ,GAAAL,EAAAC,EAAAK,GACA,GAAAH,GAAAH,EAAApJ,cAAAqJ,EAAArJ,aACA,YAAAuJ,EACAA,GAGAA,EAAAH,EAAAlJ,gBAAAmJ,EAAAnJ,gBACA,IAAAqJ,GAAAG,EACAH,GAGAA,EAAAC,EAAAJ,EAAAjJ,OAAAkJ,EAAAlJ,QACA,IAAAoJ,EACAA,GAGAA,EAAAH,EAAA9I,aAAA+I,EAAA/I,aACA,IAAAiJ,EACAA,GAGAA,EAAAH,EAAA7I,eAAA8I,EAAA9I,eACA,IAAAgJ,EACAA,EAGAC,EAAAJ,EAAA5I,KAAA6I,EAAA7I,UAIA,QAAAgJ,GAAAG,EAAAC,GACA,MAAAD,KAAAC,EACA,EAGA,OAAAD,EACA,EAGA,OAAAC,GACA,EAGAD,EAAAC,EACA,GAGA,EAOA,QAAAnG,GAAA2F,EAAAC,GACA,GAAAE,GAAAH,EAAApJ,cAAAqJ,EAAArJ,aACA,YAAAuJ,EACAA,GAGAA,EAAAH,EAAAlJ,gBAAAmJ,EAAAnJ,gBACA,IAAAqJ,EACAA,GAGAA,EAAAC,EAAAJ,EAAAjJ,OAAAkJ,EAAAlJ,QACA,IAAAoJ,EACAA,GAGAA,EAAAH,EAAA9I,aAAA+I,EAAA/I,aACA,IAAAiJ,EACAA,GAGAA,EAAAH,EAAA7I,eAAA8I,EAAA9I,eACA,IAAAgJ,EACAA,EAGAC,EAAAJ,EAAA5I,KAAA6I,EAAA7I,UASA,QAAAqJ,GAAAC,GACA,MAAAtH,MAAAuH,MAAAD,EAAAtB,QAAA,iBAAsC,KAQtC,QAAAwB,GAAAxK,EAAAyK,EAAAC,GA8BA,GA7BAD,KAAA,GAEAzK,IAEA,MAAAA,IAAAmC,OAAA,UAAAsI,EAAA,KACAzK,GAAA,KAOAyK,EAAAzK,EAAAyK,GAiBAC,EAAA,CACA,GAAAC,GAAAnD,EAAAkD,EACA,KAAAC,EACA,SAAArI,OAAA,mCAEA,IAAAqI,EAAA3C,KAAA,CAEA,GAAAkB,GAAAyB,EAAA3C,KAAAmB,YAAA,IACAD,IAAA,IACAyB,EAAA3C,KAAA2C,EAAA3C,KAAA4C,UAAA,EAAA1B,EAAA,IAGAuB,EAAA9H,EAAAsF,EAAA0C,GAAAF,GAGA,MAAArC,GAAAqC,GA3cA5M,EAAAqB,QAEA,IAAAyI,GAAA,iEACAmB,EAAA,eAeAjL,GAAA2J,WAsBA3J,EAAAoK,cAwDApK,EAAAuK,YA2DAvK,EAAA8E,OAEA9E,EAAA0K,WAAA,SAAAF,GACA,YAAAA,EAAAjC,OAAA,IAAAuB,EAAAkD,KAAAxC,IAyCAxK,EAAA+C,UAEA,IAAAkK,GAAA,WACA,GAAAC,GAAAhJ,OAAAC,OAAA,KACA,sBAAA+I,MAuBAlN,GAAAoE,YAAA6I,EAAAvB,EAAAtH,EASApE,EAAA6L,cAAAoB,EAAAvB,EAAAG,EAsEA7L,EAAA8L,6BAuCA9L,EAAAoM,sCAsDApM,EAAAoG,sCAUApG,EAAAwM,sBAqDAxM,EAAA2M,oBNqtBM,SAAU1M,EAAQD,EAASM,GO3qCjC,QAAAmB,KACArB,KAAA+M,UACA/M,KAAAgN,KAAAC,EAAA,GAAAC,KAAApJ,OAAAC,OAAA,MAZA,GAAA/C,GAAAd,EAAA,GACAmD,EAAAS,OAAAnC,UAAA6E,eACAyG,EAAA,mBAAAC,IAgBA7L,GAAA8L,UAAA,SAAAC,EAAAC,GAEA,OADAC,GAAA,GAAAjM,GACAyE,EAAA,EAAAC,EAAAqH,EAAAlJ,OAAsC4B,EAAAC,EAASD,IAC/CwH,EAAAhK,IAAA8J,EAAAtH,GAAAuH,EAEA,OAAAC,IASAjM,EAAAM,UAAA4L,KAAA,WACA,MAAAN,GAAAjN,KAAAgN,KAAAO,KAAAzJ,OAAA0J,oBAAAxN,KAAAgN,MAAA9I,QAQA7C,EAAAM,UAAA2B,IAAA,SAAAsE,EAAAyF,GACA,GAAAI,GAAAR,EAAArF,EAAA5G,EAAAgD,YAAA4D,GACA8F,EAAAT,EAAAjN,KAAAqD,IAAAuE,GAAAvE,EAAA9C,KAAAP,KAAAgN,KAAAS,GACAE,EAAA3N,KAAA+M,OAAA7I,MACAwJ,KAAAL,GACArN,KAAA+M,OAAAa,KAAAhG,GAEA8F,IACAT,EACAjN,KAAAgN,KAAAM,IAAA1F,EAAA+F,GAEA3N,KAAAgN,KAAAS,GAAAE,IAUAtM,EAAAM,UAAA0B,IAAA,SAAAuE,GACA,GAAAqF,EACA,MAAAjN,MAAAgN,KAAA3J,IAAAuE,EAEA,IAAA6F,GAAAzM,EAAAgD,YAAA4D,EACA,OAAAvE,GAAA9C,KAAAP,KAAAgN,KAAAS,IASApM,EAAAM,UAAAuE,QAAA,SAAA0B,GACA,GAAAqF,EAAA,CACA,GAAAU,GAAA3N,KAAAgN,KAAAa,IAAAjG,EACA,IAAA+F,GAAA,EACA,MAAAA,OAEG,CACH,GAAAF,GAAAzM,EAAAgD,YAAA4D,EACA,IAAAvE,EAAA9C,KAAAP,KAAAgN,KAAAS,GACA,MAAAzN,MAAAgN,KAAAS,GAIA,SAAApJ,OAAA,IAAAuD,EAAA,yBAQAvG,EAAAM,UAAAmM,GAAA,SAAAC,GACA,GAAAA,GAAA,GAAAA,EAAA/N,KAAA+M,OAAA7I,OACA,MAAAlE,MAAA+M,OAAAgB,EAEA,UAAA1J,OAAA,yBAAA0J,IAQA1M,EAAAM,UAAAkE,QAAA,WACA,MAAA7F,MAAA+M,OAAA5B,SAGAvL,EAAAyB,YPmsCM,SAAUxB,EAAQD,EAASM,GQ9yCjC,QAAA8N,GAAArC,EAAAC,GAEA,GAAAqC,GAAAtC,EAAApJ,cACA2L,EAAAtC,EAAArJ,cACA4L,EAAAxC,EAAAlJ,gBACA2L,EAAAxC,EAAAnJ,eACA,OAAAyL,GAAAD,GAAAC,GAAAD,GAAAG,GAAAD,GACAnN,EAAAgF,oCAAA2F,EAAAC,IAAA,EAQA,QAAApK,KACAxB,KAAA+M,UACA/M,KAAAqO,SAAA,EAEArO,KAAAsO,OAAgB/L,eAAA,EAAAE,gBAAA,GAzBhB,GAAAzB,GAAAd,EAAA,EAkCAsB,GAAAG,UAAA6C,gBACA,SAAA+J,EAAAC,GACAxO,KAAA+M,OAAA7J,QAAAqL,EAAAC,IAQAhN,EAAAG,UAAA2B,IAAA,SAAAmL,GACAT,EAAAhO,KAAAsO,MAAAG,IACAzO,KAAAsO,MAAAG,EACAzO,KAAA+M,OAAAa,KAAAa,KAEAzO,KAAAqO,SAAA,EACArO,KAAA+M,OAAAa,KAAAa,KAaAjN,EAAAG,UAAAkE,QAAA,WAKA,MAJA7F,MAAAqO,UACArO,KAAA+M,OAAA2B,KAAA1N,EAAAgF,qCACAhG,KAAAqO,SAAA,GAEArO,KAAA+M,QAGAnN,EAAA4B,eRk0CM,SAAU3B,EAAQD,EAASM,GSn4CjC,QAAAU,GAAA+N,EAAAC,GACA,GAAAC,GAAAF,CAKA,OAJA,gBAAAA,KACAE,EAAA7N,EAAAoL,oBAAAuC,IAGA,MAAAE,EAAAC,SACA,GAAAC,GAAAF,EAAAD,GACA,GAAAI,GAAAH,EAAAD,GA0QA,QAAAI,GAAAL,EAAAC,GACA,GAAAC,GAAAF,CACA,iBAAAA,KACAE,EAAA7N,EAAAoL,oBAAAuC,GAGA,IAAAjI,GAAA1F,EAAAC,OAAA4N,EAAA,WACA5L,EAAAjC,EAAAC,OAAA4N,EAAA,WAGAlI,EAAA3F,EAAAC,OAAA4N,EAAA,YACA9M,EAAAf,EAAAC,OAAA4N,EAAA,mBACAjI,EAAA5F,EAAAC,OAAA4N,EAAA,uBACAjJ,EAAA5E,EAAAC,OAAA4N,EAAA,YACA5M,EAAAjB,EAAAC,OAAA4N,EAAA,YAIA,IAAAnI,GAAA1G,KAAA4B,SACA,SAAAyC,OAAA,wBAAAqC,EAGA3E,KACAA,EAAAf,EAAAmJ,UAAApI,IAGAkB,IACAqD,IAAA3C,QAIA2C,IAAAtF,EAAAmJ,WAKA7D,IAAA,SAAA5D,GACA,MAAAX,IAAAf,EAAAsJ,WAAAvI,IAAAf,EAAAsJ,WAAA5H,GACA1B,EAAA2B,SAAAZ,EAAAW,GACAA,IAOA1C,KAAAsB,OAAAD,EAAA8L,UAAAxG,EAAAL,IAAA3C,SAAA,GACA3D,KAAAoB,SAAAC,EAAA8L,UAAAlK,GAAA,GAEAjD,KAAAiP,iBAAAjP,KAAAoB,SAAAyE,UAAAS,IAAA,SAAAiF,GACA,MAAAvK,GAAAuL,iBAAAxK,EAAAwJ,EAAAqD,KAGA5O,KAAA+B,aACA/B,KAAA4G,iBACA5G,KAAAuB,UAAAqE,EACA5F,KAAAkP,cAAAN,EACA5O,KAAAiC,OA4GA,QAAAkN,KACAnP,KAAAuC,cAAA,EACAvC,KAAAyC,gBAAA,EACAzC,KAAA0C,OAAA,KACA1C,KAAA6C,aAAA,KACA7C,KAAA8C,eAAA,KACA9C,KAAA+C,KAAA,KAkaA,QAAAgM,GAAAJ,EAAAC,GACA,GAAAC,GAAAF,CACA,iBAAAA,KACAE,EAAA7N,EAAAoL,oBAAAuC,GAGA,IAAAjI,GAAA1F,EAAAC,OAAA4N,EAAA,WACAC,EAAA9N,EAAAC,OAAA4N,EAAA,WAEA,IAAAnI,GAAA1G,KAAA4B,SACA,SAAAyC,OAAA,wBAAAqC,EAGA1G,MAAAoB,SAAA,GAAAC,GACArB,KAAAsB,OAAA,GAAAD,EAEA,IAAA+N,IACA9M,MAAA,EACAE,OAAA,EAEAxC,MAAAqP,UAAAP,EAAAxI,IAAA,SAAAiF,GACA,GAAAA,EAAArB,IAGA,SAAA7F,OAAA,qDAEA,IAAAiL,GAAAtO,EAAAC,OAAAsK,EAAA,UACAgE,EAAAvO,EAAAC,OAAAqO,EAAA,QACAE,EAAAxO,EAAAC,OAAAqO,EAAA,SAEA,IAAAC,EAAAH,EAAA9M,MACAiN,IAAAH,EAAA9M,MAAAkN,EAAAJ,EAAA5M,OACA,SAAA6B,OAAA,uDAIA,OAFA+K,GAAAE,GAGAG,iBAGAlN,cAAAgN,EAAA,EACA9M,gBAAA+M,EAAA,GAEAE,SAAA,GAAA9O,GAAAI,EAAAC,OAAAsK,EAAA,OAAAqD,MAh5BA,GAAA5N,GAAAd,EAAA,GACAyP,EAAAzP,EAAA,GACAmB,EAAAnB,EAAA,GAAAmB,SACAK,EAAAxB,EAAA,GACA0P,EAAA1P,EAAA,GAAA0P,SAaAhP,GAAAiB,cAAA,SAAA8M,EAAAC,GACA,MAAAI,GAAAnN,cAAA8M,EAAAC,IAMAhO,EAAAe,UAAAC,SAAA,EAgCAhB,EAAAe,UAAAkO,oBAAA,KACA/L,OAAAgM,eAAAlP,EAAAe,UAAA,sBACAoO,cAAA,EACAC,YAAA,EACAnC,IAAA,WAKA,MAJA7N,MAAA6P,qBACA7P,KAAAiQ,eAAAjQ,KAAAuB,UAAAvB,KAAA+B,YAGA/B,KAAA6P,uBAIAjP,EAAAe,UAAAuO,mBAAA,KACApM,OAAAgM,eAAAlP,EAAAe,UAAA,qBACAoO,cAAA,EACAC,YAAA,EACAnC,IAAA,WAKA,MAJA7N,MAAAkQ,oBACAlQ,KAAAiQ,eAAAjQ,KAAAuB,UAAAvB,KAAA+B,YAGA/B,KAAAkQ,sBAIAtP,EAAAe,UAAAwO,wBACA,SAAAvI,EAAAqD,GACA,GAAAxK,GAAAmH,EAAAO,OAAA8C,EACA,aAAAxK,GAAmB,MAAAA,GAQnBG,EAAAe,UAAAsO,eACA,SAAArI,EAAAvB,GACA,SAAAhC,OAAA,6CAGAzD,EAAAwP,gBAAA,EACAxP,EAAAyP,eAAA,EAEAzP,EAAA0P,qBAAA,EACA1P,EAAA2P,kBAAA,EAkBA3P,EAAAe,UAAAO,YACA,SAAAqM,EAAAiC,EAAAC,GACA,GAGA7K,GAHA8K,EAAAF,GAAA,KACAG,EAAAF,GAAA7P,EAAAwP,eAGA,QAAAO,GACA,IAAA/P,GAAAwP,gBACAxK,EAAA5F,KAAA4Q,kBACA,MACA,KAAAhQ,GAAAyP,eACAzK,EAAA5F,KAAA6Q,iBACA,MACA,SACA,SAAAxM,OAAA,+BAGA,GAAAtC,GAAA/B,KAAA+B,UACA6D,GAAAU,IAAA,SAAAnE,GACA,GAAAO,GAAA,OAAAP,EAAAO,OAAA,KAAA1C,KAAAoB,SAAA0M,GAAA3L,EAAAO,OAEA,OADAA,GAAA1B,EAAAuL,iBAAAxK,EAAAW,EAAA1C,KAAAkP,gBAEAxM,SACAH,cAAAJ,EAAAI,cACAE,gBAAAN,EAAAM,gBACAI,aAAAV,EAAAU,aACAC,eAAAX,EAAAW,eACAC,KAAA,OAAAZ,EAAAY,KAAA,KAAA/C,KAAAsB,OAAAwM,GAAA3L,EAAAY,QAEK/C,MAAAkD,QAAAqL,EAAAmC,IAyBL9P,EAAAe,UAAAmP,yBACA,SAAAhQ,GACA,GAAAwB,GAAAtB,EAAAC,OAAAH,EAAA,QAMAiQ,GACArO,OAAA1B,EAAAC,OAAAH,EAAA,UACA+B,aAAAP,EACAQ,eAAA9B,EAAAC,OAAAH,EAAA,YAIA,IADAiQ,EAAArO,OAAA1C,KAAAgR,iBAAAD,EAAArO,QACAqO,EAAArO,OAAA,EACA,QAGA,IAAAkD,MAEAqF,EAAAjL,KAAAiR,aAAAF,EACA/Q,KAAA6Q,kBACA,eACA,iBACA7P,EAAA0K,2BACAiE,EAAAY,kBACA,IAAAtF,GAAA,GACA,GAAA9I,GAAAnC,KAAA6Q,kBAAA5F,EAEA,IAAAiG,SAAApQ,EAAA0B,OAOA,IANA,GAAAK,GAAAV,EAAAU,aAMAV,KAAAU,kBACA+C,EAAAgI,MACAtL,KAAAtB,EAAAC,OAAAkB,EAAA,sBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,wBACAgP,WAAAnQ,EAAAC,OAAAkB,EAAA,8BAGAA,EAAAnC,KAAA6Q,oBAAA5F,OASA,KANA,GAAAnI,GAAAX,EAAAW,eAMAX,GACAA,EAAAU,eAAAP,GACAH,EAAAW,mBACA8C,EAAAgI,MACAtL,KAAAtB,EAAAC,OAAAkB,EAAA,sBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,wBACAgP,WAAAnQ,EAAAC,OAAAkB,EAAA,8BAGAA,EAAAnC,KAAA6Q,oBAAA5F,GAKA,MAAArF,IAGAhG,EAAAgB,oBAgGAoO,EAAArN,UAAAmC,OAAAC,OAAAnD,EAAAe,WACAqN,EAAArN,UAAA+N,SAAA9O,EAMAoO,EAAArN,UAAAqP,iBAAA,SAAAnM,GACA,GAAAuM,GAAAvM,CAKA,IAJA,MAAA7E,KAAA+B,aACAqP,EAAApQ,EAAA2B,SAAA3C,KAAA+B,WAAAqP,IAGApR,KAAAoB,SAAAiC,IAAA+N,GACA,MAAApR,MAAAoB,SAAA8E,QAAAkL,EAKA,IAAAtL,EACA,KAAAA,EAAA,EAAaA,EAAA9F,KAAAiP,iBAAA/K,SAAkC4B,EAC/C,GAAA9F,KAAAiP,iBAAAnJ,IAAAjB,EACA,MAAAiB,EAIA,WAYAkJ,EAAAnN,cACA,SAAA8M,EAAAC,GACA,GAAAyC,GAAAvN,OAAAC,OAAAiL,EAAArN,WAEAgF,EAAA0K,EAAA/P,OAAAD,EAAA8L,UAAAwB,EAAArN,OAAAuE,WAAA,GACA5C,EAAAoO,EAAAjQ,SAAAC,EAAA8L,UAAAwB,EAAAvN,SAAAyE,WAAA,EACAwL,GAAAtP,WAAA4M,EAAAzN,YACAmQ,EAAAzK,eAAA+H,EAAAxI,wBAAAkL,EAAAjQ,SAAAyE,UACAwL,EAAAtP,YACAsP,EAAApP,KAAA0M,EAAA5N,MACAsQ,EAAAnC,cAAAN,EACAyC,EAAApC,iBAAAoC,EAAAjQ,SAAAyE,UAAAS,IAAA,SAAAiF,GACA,MAAAvK,GAAAuL,iBAAA8E,EAAAtP,WAAAwJ,EAAAqD,IAYA,QAJA0C,GAAA3C,EAAApN,UAAAsE,UAAAsF,QACAoG,EAAAF,EAAAxB,uBACA2B,EAAAH,EAAAnB,sBAEApK,EAAA,EAAA5B,EAAAoN,EAAApN,OAAsD4B,EAAA5B,EAAY4B,IAAA,CAClE,GAAA2L,GAAAH,EAAAxL,GACA4L,EAAA,GAAAvC,EACAuC,GAAAnP,cAAAkP,EAAAlP,cACAmP,EAAAjP,gBAAAgP,EAAAhP,gBAEAgP,EAAA/O,SACAgP,EAAAhP,OAAAO,EAAAiD,QAAAuL,EAAA/O,QACAgP,EAAA7O,aAAA4O,EAAA5O,aACA6O,EAAA5O,eAAA2O,EAAA3O,eAEA2O,EAAA1O,OACA2O,EAAA3O,KAAA4D,EAAAT,QAAAuL,EAAA1O,OAGAyO,EAAA5D,KAAA8D,IAGAH,EAAA3D,KAAA8D,GAKA,MAFA9B,GAAAyB,EAAAnB,mBAAAlP,EAAA0K,4BAEA2F,GAMArC,EAAArN,UAAAC,SAAA,EAKAkC,OAAAgM,eAAAd,EAAArN,UAAA,WACAkM,IAAA,WACA,MAAA7N,MAAAiP,iBAAA9D,WAqBA6D,EAAArN,UAAAsO,eACA,SAAArI,EAAAvB,GAeA,IAdA,GAYAlE,GAAAkK,EAAAsF,EAAAC,EAAAxJ,EAZA7F,EAAA,EACA8C,EAAA,EACAG,EAAA,EACAD,EAAA,EACAG,EAAA,EACAD,EAAA,EACAvB,EAAA0D,EAAA1D,OACA+G,EAAA,EACA4G,KACAC,KACAC,KACAT,KAGArG,EAAA/G,GACA,SAAA0D,EAAAO,OAAA8C,GACA1I,IACA0I,IACA5F,EAAA,MAEA,UAAAuC,EAAAO,OAAA8C,GACAA,QAEA,CASA,IARA9I,EAAA,GAAAgN,GACAhN,EAAAI,gBAOAqP,EAAA3G,EAAyB2G,EAAA1N,IACzBlE,KAAAmQ,wBAAAvI,EAAAgK,GADuCA,KAQvC,GAHAvF,EAAAzE,EAAAuD,MAAAF,EAAA2G,GAEAD,EAAAE,EAAAxF,GAEApB,GAAAoB,EAAAnI,WACS,CAET,IADAyN,KACA1G,EAAA2G,GACAlQ,EAAAiG,OAAAC,EAAAqD,EAAA6G,GACA1J,EAAA0J,EAAA1J,MACA6C,EAAA6G,EAAAzJ,KACAsJ,EAAA/D,KAAAxF,EAGA,QAAAuJ,EAAAzN,OACA,SAAAG,OAAA,yCAGA,QAAAsN,EAAAzN,OACA,SAAAG,OAAA,yCAGAwN,GAAAxF,GAAAsF,EAIAxP,EAAAM,gBAAA4C,EAAAsM,EAAA,GACAtM,EAAAlD,EAAAM,gBAEAkP,EAAAzN,OAAA,IAEA/B,EAAAO,OAAAgD,EAAAiM,EAAA,GACAjM,GAAAiM,EAAA,GAGAxP,EAAAU,aAAA2C,EAAAmM,EAAA,GACAnM,EAAArD,EAAAU,aAEAV,EAAAU,cAAA,EAGAV,EAAAW,eAAAyC,EAAAoM,EAAA,GACApM,EAAApD,EAAAW,eAEA6O,EAAAzN,OAAA,IAEA/B,EAAAY,KAAA0C,EAAAkM,EAAA,GACAlM,GAAAkM,EAAA,KAIAL,EAAA1D,KAAAzL,GACA,gBAAAA,GAAAU,cACAkP,EAAAnE,KAAAzL,GAKAyN,EAAA0B,EAAAtQ,EAAAgL,qCACAhM,KAAA6P,oBAAAyB,EAEA1B,EAAAmC,EAAA/Q,EAAA0K,4BACA1L,KAAAkQ,mBAAA6B,GAOA/C,EAAArN,UAAAsP,aACA,SAAAe,EAAAC,EAAAC,EACAC,EAAAC,EAAAC,GAMA,GAAAL,EAAAE,IAAA,EACA,SAAAzJ,WAAA,gDACAuJ,EAAAE,GAEA,IAAAF,EAAAG,GAAA,EACA,SAAA1J,WAAA,kDACAuJ,EAAAG,GAGA,OAAAxC,GAAA2C,OAAAN,EAAAC,EAAAG,EAAAC,IAOArD,EAAArN,UAAA4Q,mBACA,WACA,OAAAtH,GAAA,EAAuBA,EAAAjL,KAAA4Q,mBAAA1M,SAAwC+G,EAAA,CAC/D,GAAA9I,GAAAnC,KAAA4Q,mBAAA3F,EAMA,IAAAA,EAAA,EAAAjL,KAAA4Q,mBAAA1M,OAAA,CACA,GAAAsO,GAAAxS,KAAA4Q,mBAAA3F,EAAA,EAEA,IAAA9I,EAAAI,gBAAAiQ,EAAAjQ,cAAA,CACAJ,EAAAsQ,oBAAAD,EAAA/P,gBAAA,CACA,WAKAN,EAAAsQ,oBAAAC,MA4BA1D,EAAArN,UAAA8C,oBACA,SAAA3D,GACA,GAAAiQ,IACAxO,cAAAvB,EAAAC,OAAAH,EAAA,QACA2B,gBAAAzB,EAAAC,OAAAH,EAAA,WAGAmK,EAAAjL,KAAAiR,aACAF,EACA/Q,KAAA4Q,mBACA,gBACA,kBACA5P,EAAAgL,oCACAhL,EAAAC,OAAAH,EAAA,OAAAF,EAAA0P,sBAGA,IAAArF,GAAA,GACA,GAAA9I,GAAAnC,KAAA4Q,mBAAA3F,EAEA,IAAA9I,EAAAI,gBAAAwO,EAAAxO,cAAA,CACA,GAAAG,GAAA1B,EAAAC,OAAAkB,EAAA,cACA,QAAAO,IACAA,EAAA1C,KAAAoB,SAAA0M,GAAApL,GACAA,EAAA1B,EAAAuL,iBAAAvM,KAAA+B,WAAAW,EAAA1C,KAAAkP,eAEA,IAAAnM,GAAA/B,EAAAC,OAAAkB,EAAA,YAIA,OAHA,QAAAY,IACAA,EAAA/C,KAAAsB,OAAAwM,GAAA/K,KAGAL,SACAJ,KAAAtB,EAAAC,OAAAkB,EAAA,qBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,uBACAY,SAKA,OACAL,OAAA,KACAJ,KAAA,KACAE,OAAA,KACAO,KAAA,OAQAiM,EAAArN,UAAAgR,wBACA,WACA,QAAA3S,KAAA4G,iBAGA5G,KAAA4G,eAAA1C,QAAAlE,KAAAoB,SAAAmM,SACAvN,KAAA4G,eAAAgM,KAAA,SAAAC,GAA+C,aAAAA,MAQ/C7D,EAAArN,UAAA6B,iBACA,SAAAqB,EAAAiO,GACA,IAAA9S,KAAA4G,eACA,WAGA,IAAAqE,GAAAjL,KAAAgR,iBAAAnM,EACA,IAAAoG,GAAA,EACA,MAAAjL,MAAA4G,eAAAqE,EAGA,IAAAmG,GAAAvM,CACA,OAAA7E,KAAA+B,aACAqP,EAAApQ,EAAA2B,SAAA3C,KAAA+B,WAAAqP,GAGA,IAAAlH,EACA,UAAAlK,KAAA+B,aACAmI,EAAAlJ,EAAAuI,SAAAvJ,KAAA+B,aAAA,CAKA,GAAAgR,GAAA3B,EAAArG,QAAA,gBACA,YAAAb,EAAAP,QACA3J,KAAAoB,SAAAiC,IAAA0P,GACA,MAAA/S,MAAA4G,eAAA5G,KAAAoB,SAAA8E,QAAA6M,GAGA,MAAA7I,EAAAH,MAAA,KAAAG,EAAAH,OACA/J,KAAAoB,SAAAiC,IAAA,IAAA+N,GACA,MAAApR,MAAA4G,eAAA5G,KAAAoB,SAAA8E,QAAA,IAAAkL,IAQA,GAAA0B,EACA,WAGA,UAAAzO,OAAA,IAAA+M,EAAA,+BA2BApC,EAAArN,UAAAqR,qBACA,SAAAlS,GACA,GAAA4B,GAAA1B,EAAAC,OAAAH,EAAA,SAEA,IADA4B,EAAA1C,KAAAgR,iBAAAtO,GACAA,EAAA,EACA,OACAJ,KAAA,KACAE,OAAA,KACA2O,WAAA,KAIA,IAAAJ,IACArO,SACAG,aAAA7B,EAAAC,OAAAH,EAAA,QACAgC,eAAA9B,EAAAC,OAAAH,EAAA,WAGAmK,EAAAjL,KAAAiR,aACAF,EACA/Q,KAAA6Q,kBACA,eACA,iBACA7P,EAAA0K,2BACA1K,EAAAC,OAAAH,EAAA,OAAAF,EAAA0P,sBAGA,IAAArF,GAAA,GACA,GAAA9I,GAAAnC,KAAA6Q,kBAAA5F,EAEA,IAAA9I,EAAAO,SAAAqO,EAAArO,OACA,OACAJ,KAAAtB,EAAAC,OAAAkB,EAAA,sBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,wBACAgP,WAAAnQ,EAAAC,OAAAkB,EAAA,6BAKA,OACAG,KAAA,KACAE,OAAA,KACA2O,WAAA,OAIAvR,EAAAoP,yBAmGAD,EAAApN,UAAAmC,OAAAC,OAAAnD,EAAAe,WACAoN,EAAApN,UAAAsR,YAAArS,EAKAmO,EAAApN,UAAAC,SAAA,EAKAkC,OAAAgM,eAAAf,EAAApN,UAAA,WACAkM,IAAA,WAEA,OADA5K,MACA6C,EAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAC9C,OAAAoN,GAAA,EAAqBA,EAAAlT,KAAAqP,UAAAvJ,GAAA4J,SAAAzM,QAAAiB,OAA+CgP,IACpEjQ,EAAA2K,KAAA5N,KAAAqP,UAAAvJ,GAAA4J,SAAAzM,QAAAiQ,GAGA,OAAAjQ,MAuBA8L,EAAApN,UAAA8C,oBACA,SAAA3D,GACA,GAAAiQ,IACAxO,cAAAvB,EAAAC,OAAAH,EAAA,QACA2B,gBAAAzB,EAAAC,OAAAH,EAAA,WAKAqS,EAAAxD,EAAA2C,OAAAvB,EAAA/Q,KAAAqP,UACA,SAAA0B,EAAAqC,GACA,GAAAtH,GAAAiF,EAAAxO,cAAA6Q,EAAA3D,gBAAAlN,aACA,OAAAuJ,GACAA,EAGAiF,EAAAtO,gBACA2Q,EAAA3D,gBAAAhN,kBAEA2Q,EAAApT,KAAAqP,UAAA8D,EAEA,OAAAC,GASAA,EAAA1D,SAAAjL,qBACAnC,KAAAyO,EAAAxO,eACA6Q,EAAA3D,gBAAAlN,cAAA,GACAC,OAAAuO,EAAAtO,iBACA2Q,EAAA3D,gBAAAlN,gBAAAwO,EAAAxO,cACA6Q,EAAA3D,gBAAAhN,gBAAA,EACA,GACA4Q,KAAAvS,EAAAuS,QAdA3Q,OAAA,KACAJ,KAAA,KACAE,OAAA,KACAO,KAAA,OAmBAgM,EAAApN,UAAAgR,wBACA,WACA,MAAA3S,MAAAqP,UAAAiE,MAAA,SAAA/H,GACA,MAAAA,GAAAmE,SAAAiD,6BASA5D,EAAApN,UAAA6B,iBACA,SAAAqB,EAAAiO,GACA,OAAAhN,GAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAAA,CAC9C,GAAAsN,GAAApT,KAAAqP,UAAAvJ,GAEAvC,EAAA6P,EAAA1D,SAAAlM,iBAAAqB,GAAA,EACA,IAAAtB,EACA,MAAAA,GAGA,GAAAuP,EACA,WAGA,UAAAzO,OAAA,IAAAQ,EAAA,+BAsBAkK,EAAApN,UAAAqR,qBACA,SAAAlS,GACA,OAAAgF,GAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAAA,CAC9C,GAAAsN,GAAApT,KAAAqP,UAAAvJ,EAIA,IAAAsN,EAAA1D,SAAAsB,iBAAAhQ,EAAAC,OAAAH,EAAA,iBAGA,GAAAyS,GAAAH,EAAA1D,SAAAsD,qBAAAlS,EACA,IAAAyS,EAAA,CACA,GAAAC,IACAlR,KAAAiR,EAAAjR,MACA8Q,EAAA3D,gBAAAlN,cAAA,GACAC,OAAA+Q,EAAA/Q,QACA4Q,EAAA3D,gBAAAlN,gBAAAgR,EAAAjR,KACA8Q,EAAA3D,gBAAAhN,gBAAA,EACA,GAEA,OAAA+Q,KAIA,OACAlR,KAAA,KACAE,OAAA,OASAuM,EAAApN,UAAAsO,eACA,SAAArI,EAAAvB,GACArG,KAAA6P,uBACA7P,KAAAkQ,qBACA,QAAApK,GAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAG9C,OAFAsN,GAAApT,KAAAqP,UAAAvJ,GACA2N,EAAAL,EAAA1D,SAAAkB,mBACAsC,EAAA,EAAqBA,EAAAO,EAAAvP,OAA4BgP,IAAA,CACjD,GAAA/Q,GAAAsR,EAAAP,GAEAxQ,EAAA0Q,EAAA1D,SAAAtO,SAAA0M,GAAA3L,EAAAO,OACAA,GAAA1B,EAAAuL,iBAAA6G,EAAA1D,SAAA3N,WAAAW,EAAA1C,KAAAkP,eACAlP,KAAAoB,SAAAkC,IAAAZ,GACAA,EAAA1C,KAAAoB,SAAA8E,QAAAxD,EAEA,IAAAK,GAAA,IACAZ,GAAAY,OACAA,EAAAqQ,EAAA1D,SAAApO,OAAAwM,GAAA3L,EAAAY,MACA/C,KAAAsB,OAAAgC,IAAAP,GACAA,EAAA/C,KAAAsB,OAAA4E,QAAAnD,GAOA,IAAA2Q,IACAhR,SACAH,cAAAJ,EAAAI,eACA6Q,EAAA3D,gBAAAlN,cAAA,GACAE,gBAAAN,EAAAM,iBACA2Q,EAAA3D,gBAAAlN,gBAAAJ,EAAAI,cACA6Q,EAAA3D,gBAAAhN,gBAAA,EACA,GACAI,aAAAV,EAAAU,aACAC,eAAAX,EAAAW,eACAC,OAGA/C,MAAA6P,oBAAAjC,KAAA8F,GACA,gBAAAA,GAAA7Q,cACA7C,KAAAkQ,mBAAAtC,KAAA8F,GAKA9D,EAAA5P,KAAA6P,oBAAA7O,EAAAgL,qCACA4D,EAAA5P,KAAAkQ,mBAAAlP,EAAA0K,6BAGA9L,EAAAmP,4BTu5CM,SAAUlP,EAAQD,GUx/ExB,QAAA+T,GAAAC,EAAAC,EAAA7B,EAAA8B,EAAAC,EAAA1B,GAUA,GAAA2B,GAAAC,KAAAC,OAAAL,EAAAD,GAAA,GAAAA,EACA9H,EAAAiI,EAAA/B,EAAA8B,EAAAE,IAAA,EACA,YAAAlI,EAEAkI,EAEAlI,EAAA,EAEA+H,EAAAG,EAAA,EAEAL,EAAAK,EAAAH,EAAA7B,EAAA8B,EAAAC,EAAA1B,GAKAA,GAAAzS,EAAA2Q,kBACAsD,EAAAC,EAAA5P,OAAA2P,GAAA,EAEAG,EAKAA,EAAAJ,EAAA,EAEAD,EAAAC,EAAAI,EAAAhC,EAAA8B,EAAAC,EAAA1B,GAIAA,GAAAzS,EAAA2Q,kBACAyD,EAEAJ,EAAA,KAAAA,EA1DAhU,EAAA0Q,qBAAA,EACA1Q,EAAA2Q,kBAAA,EAgFA3Q,EAAA0S,OAAA,SAAAN,EAAA8B,EAAAC,EAAA1B,GACA,OAAAyB,EAAA5P,OACA,QAGA,IAAA+G,GAAA0I,GAAA,EAAAG,EAAA5P,OAAA8N,EAAA8B,EACAC,EAAA1B,GAAAzS,EAAA0Q,qBACA,IAAArF,EAAA,EACA,QAMA,MAAAA,EAAA,MACA,IAAA8I,EAAAD,EAAA7I,GAAA6I,EAAA7I,EAAA,UAGAA,CAGA,OAAAA,KVuhFM,SAAUpL,EAAQD,GWzmFxB,QAAAuU,GAAAC,EAAAC,EAAAC,GACA,GAAAxC,GAAAsC,EAAAC,EACAD,GAAAC,GAAAD,EAAAE,GACAF,EAAAE,GAAAxC,EAWA,QAAAyC,GAAAC,EAAAC,GACA,MAAAR,MAAAS,MAAAF,EAAAP,KAAAU,UAAAF,EAAAD,IAeA,QAAAI,GAAAR,EAAAS,EAAAnU,EAAAoU,GAKA,GAAApU,EAAAoU,EAAA,CAYA,GAAAC,GAAAR,EAAA7T,EAAAoU,GACAhP,EAAApF,EAAA,CAEAyT,GAAAC,EAAAW,EAAAD,EASA,QARAE,GAAAZ,EAAAU,GAQA5B,EAAAxS,EAAmBwS,EAAA4B,EAAO5B,IAC1B2B,EAAAT,EAAAlB,GAAA8B,IAAA,IACAlP,GAAA,EACAqO,EAAAC,EAAAtO,EAAAoN,GAIAiB,GAAAC,EAAAtO,EAAA,EAAAoN,EACA,IAAA+B,GAAAnP,EAAA,CAIA8O,GAAAR,EAAAS,EAAAnU,EAAAuU,EAAA,GACAL,EAAAR,EAAAS,EAAAI,EAAA,EAAAH,IAYAlV,EAAAgQ,UAAA,SAAAwE,EAAAS,GACAD,EAAAR,EAAAS,EAAA,EAAAT,EAAAlQ,OAAA,KX4oFM,SAAUrE,EAAQD,EAASM,GY1tFjC,QAAAW,GAAAqU,EAAAC,EAAAtQ,EAAAuQ,EAAAtQ,GACA9E,KAAAqV,YACArV,KAAAsV,kBACAtV,KAAAsC,KAAA,MAAA4S,EAAA,KAAAA,EACAlV,KAAAwC,OAAA,MAAA2S,EAAA,KAAAA,EACAnV,KAAA0C,OAAA,MAAAmC,EAAA,KAAAA,EACA7E,KAAA+C,KAAA,MAAA+B,EAAA,KAAAA,EACA9E,KAAAuV,IAAA,EACA,MAAAH,GAAApV,KAAAsD,IAAA8R,GAnCA,GAAAzU,GAAAT,EAAA,GAAAS,mBACAK,EAAAd,EAAA,GAIAsV,EAAA,UAGAC,EAAA,GAKAF,EAAA,oBAiCA1U,GAAA6U,wBACA,SAAAC,EAAA7T,EAAA8T,GA+FA,QAAAC,GAAA1T,EAAA2T,GACA,UAAA3T,GAAA+O,SAAA/O,EAAAO,OACAqT,EAAAzS,IAAAwS,OACO,CACP,GAAApT,GAAAkT,EACA5U,EAAA0D,KAAAkR,EAAAzT,EAAAO,QACAP,EAAAO,MACAqT,GAAAzS,IAAA,GAAAzC,GAAAsB,EAAAU,aACAV,EAAAW,eACAJ,EACAoT,EACA3T,EAAAY,QAvGA,GAAAgT,GAAA,GAAAlV,GAMAmV,EAAAL,EAAApN,MAAAiN,GACAS,EAAA,EACAC,EAAA,WAMA,QAAAC,KACA,MAAAF,GAAAD,EAAA9R,OACA8R,EAAAC,KAAA/E,OAPA,GAAAkF,GAAAD,IAEAE,EAAAF,KAAA,EACA,OAAAC,GAAAC,GASAC,EAAA,EAAA7D,EAAA,EAKA8D,EAAA,IAgEA,OA9DAzU,GAAAI,YAAA,SAAAC,GACA,UAAAoU,EAAA,CAGA,KAAAD,EAAAnU,EAAAI,eAMS,CAIT,GAAAiU,GAAAR,EAAAC,IAAA,GACAH,EAAAU,EAAAnL,OAAA,EAAAlJ,EAAAM,gBACAgQ,EAOA,OANAuD,GAAAC,GAAAO,EAAAnL,OAAAlJ,EAAAM,gBACAgQ,GACAA,EAAAtQ,EAAAM,gBACAoT,EAAAU,EAAAT,QAEAS,EAAApU,GAhBA0T,EAAAU,EAAAL,KACAI,IACA7D,EAAA,EAqBA,KAAA6D,EAAAnU,EAAAI,eACAwT,EAAAzS,IAAA4S,KACAI,GAEA,IAAA7D,EAAAtQ,EAAAM,gBAAA,CACA,GAAA+T,GAAAR,EAAAC,IAAA,EACAF,GAAAzS,IAAAkT,EAAAnL,OAAA,EAAAlJ,EAAAM,kBACAuT,EAAAC,GAAAO,EAAAnL,OAAAlJ,EAAAM,iBACAgQ,EAAAtQ,EAAAM,gBAEA8T,EAAApU,GACKnC,MAELiW,EAAAD,EAAA9R,SACAqS,GAEAV,EAAAU,EAAAL,KAGAH,EAAAzS,IAAA0S,EAAAvL,OAAAwL,GAAAvR,KAAA,MAIA5C,EAAAmB,QAAAC,QAAA,SAAAC,GACA,GAAAI,GAAAzB,EAAA0B,iBAAAL,EACA,OAAAI,IACA,MAAAqS,IACAzS,EAAAnC,EAAA0D,KAAAkR,EAAAzS,IAEA4S,EAAAtS,iBAAAN,EAAAI,MAIAwS,GAwBAlV,EAAAc,UAAA2B,IAAA,SAAAmT,GACA,GAAArL,MAAAsL,QAAAD,GACAA,EAAAvT,QAAA,SAAAyT,GACA3W,KAAAsD,IAAAqT,IACK3W,UAEL,KAAAyW,EAAAlB,IAAA,gBAAAkB,GAMA,SAAAhO,WACA,8EAAAgO,EANAA,IACAzW,KAAAqV,SAAAzH,KAAA6I,GAQA,MAAAzW,OASAa,EAAAc,UAAAiV,QAAA,SAAAH,GACA,GAAArL,MAAAsL,QAAAD,GACA,OAAA3Q,GAAA2Q,EAAAvS,OAAA,EAAiC4B,GAAA,EAAQA,IACzC9F,KAAA4W,QAAAH,EAAA3Q,QAGA,KAAA2Q,EAAAlB,IAAA,gBAAAkB,GAIA,SAAAhO,WACA,8EAAAgO,EAJAzW,MAAAqV,SAAAwB,QAAAJ,GAOA,MAAAzW,OAUAa,EAAAc,UAAAmV,KAAA,SAAAC,GAEA,OADAJ,GACA7Q,EAAA,EAAAC,EAAA/F,KAAAqV,SAAAnR,OAA6C4B,EAAAC,EAASD,IACtD6Q,EAAA3W,KAAAqV,SAAAvP,GACA6Q,EAAApB,GACAoB,EAAAG,KAAAC,GAGA,KAAAJ,GACAI,EAAAJ,GAAoBjU,OAAA1C,KAAA0C,OACpBJ,KAAAtC,KAAAsC,KACAE,OAAAxC,KAAAwC,OACAO,KAAA/C,KAAA+C,QAYAlC,EAAAc,UAAA+C,KAAA,SAAAsS,GACA,GAAAC,GACAnR,EACAC,EAAA/F,KAAAqV,SAAAnR,MACA,IAAA6B,EAAA,GAEA,IADAkR,KACAnR,EAAA,EAAeA,EAAAC,EAAA,EAAWD,IAC1BmR,EAAArJ,KAAA5N,KAAAqV,SAAAvP,IACAmR,EAAArJ,KAAAoJ,EAEAC,GAAArJ,KAAA5N,KAAAqV,SAAAvP,IACA9F,KAAAqV,SAAA4B,EAEA,MAAAjX,OAUAa,EAAAc,UAAAuV,aAAA,SAAAC,EAAAC,GACA,GAAAC,GAAArX,KAAAqV,SAAArV,KAAAqV,SAAAnR,OAAA,EAUA,OATAmT,GAAA9B,GACA8B,EAAAH,aAAAC,EAAAC,GAEA,gBAAAC,GACArX,KAAAqV,SAAArV,KAAAqV,SAAAnR,OAAA,GAAAmT,EAAAtM,QAAAoM,EAAAC,GAGApX,KAAAqV,SAAAzH,KAAA,GAAA7C,QAAAoM,EAAAC,IAEApX,MAUAa,EAAAc,UAAA8B,iBACA,SAAAG,EAAAC,GACA7D,KAAAsV,eAAAtU,EAAAgD,YAAAJ,IAAAC,GASAhD,EAAAc,UAAA2V,mBACA,SAAAP,GACA,OAAAjR,GAAA,EAAAC,EAAA/F,KAAAqV,SAAAnR,OAA+C4B,EAAAC,EAASD,IACxD9F,KAAAqV,SAAAvP,GAAAyP,IACAvV,KAAAqV,SAAAvP,GAAAwR,mBAAAP,EAKA,QADA9T,GAAAa,OAAAG,KAAAjE,KAAAsV,gBACAxP,EAAA,EAAAC,EAAA9C,EAAAiB,OAAyC4B,EAAAC,EAASD,IAClDiR,EAAA/V,EAAAyK,cAAAxI,EAAA6C,IAAA9F,KAAAsV,eAAArS,EAAA6C,MAQAjF,EAAAc,UAAAkF,SAAA,WACA,GAAAwF,GAAA,EAIA,OAHArM,MAAA8W,KAAA,SAAAH,GACAtK,GAAAsK,IAEAtK,GAOAxL,EAAAc,UAAA4V,sBAAA,SAAAzW,GACA,GAAAuB,IACAyT,KAAA,GACAxT,KAAA,EACAE,OAAA,GAEA8D,EAAA,GAAA3F,GAAAG,GACA0W,GAAA,EACAC,EAAA,KACAC,EAAA,KACAC,EAAA,KACAC,EAAA,IAqEA,OApEA5X,MAAA8W,KAAA,SAAAH,EAAA/T,GACAP,EAAAyT,MAAAa,EACA,OAAA/T,EAAAF,QACA,OAAAE,EAAAN,MACA,OAAAM,EAAAJ,QACAiV,IAAA7U,EAAAF,QACAgV,IAAA9U,EAAAN,MACAqV,IAAA/U,EAAAJ,QACAoV,IAAAhV,EAAAG,MACAuD,EAAAtD,YACAN,OAAAE,EAAAF,OACAE,UACAN,KAAAM,EAAAN,KACAE,OAAAI,EAAAJ,QAEAH,WACAC,KAAAD,EAAAC,KACAE,OAAAH,EAAAG,QAEAO,KAAAH,EAAAG,OAGA0U,EAAA7U,EAAAF,OACAgV,EAAA9U,EAAAN,KACAqV,EAAA/U,EAAAJ,OACAoV,EAAAhV,EAAAG,KACAyU,GAAA,GACKA,IACLlR,EAAAtD,YACAX,WACAC,KAAAD,EAAAC,KACAE,OAAAH,EAAAG,UAGAiV,EAAA,KACAD,GAAA,EAEA,QAAA7J,GAAA,EAAAzJ,EAAAyS,EAAAzS,OAA4CyJ,EAAAzJ,EAAcyJ,IAC1DgJ,EAAAzO,WAAAyF,KAAA8H,GACApT,EAAAC,OACAD,EAAAG,OAAA,EAEAmL,EAAA,IAAAzJ,GACAuT,EAAA,KACAD,GAAA,GACSA,GACTlR,EAAAtD,YACAN,OAAAE,EAAAF,OACAE,UACAN,KAAAM,EAAAN,KACAE,OAAAI,EAAAJ,QAEAH,WACAC,KAAAD,EAAAC,KACAE,OAAAH,EAAAG,QAEAO,KAAAH,EAAAG,QAIAV,EAAAG,WAIAxC,KAAAsX,mBAAA,SAAAnU,EAAA0U,GACAvR,EAAA7C,iBAAAN,EAAA0U,MAGU/B,KAAAzT,EAAAyT,KAAAxP,QAGV1G,EAAAiB","file":"source-map.min.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"sourceMap\"] = factory();\n\telse\n\t\troot[\"sourceMap\"] = factory();\n})(this, function() {\nreturn \n\n\n// WEBPACK FOOTER //\n// webpack/universalModuleDefinition","(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"sourceMap\"] = factory();\n\telse\n\t\troot[\"sourceMap\"] = factory();\n})(this, function() {\nreturn /******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId])\n/******/ \t\t\treturn installedModules[moduleId].exports;\n/******/\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\texports: {},\n/******/ \t\t\tid: moduleId,\n/******/ \t\t\tloaded: false\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.loaded = true;\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/******/\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n/******/\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n/******/\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"\";\n/******/\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(0);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/*\n\t * Copyright 2009-2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE.txt or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\texports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;\n\texports.SourceMapConsumer = __webpack_require__(7).SourceMapConsumer;\n\texports.SourceNode = __webpack_require__(10).SourceNode;\n\n\n/***/ }),\n/* 1 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar base64VLQ = __webpack_require__(2);\n\tvar util = __webpack_require__(4);\n\tvar ArraySet = __webpack_require__(5).ArraySet;\n\tvar MappingList = __webpack_require__(6).MappingList;\n\t\n\t/**\n\t * An instance of the SourceMapGenerator represents a source map which is\n\t * being built incrementally. You may pass an object with the following\n\t * properties:\n\t *\n\t *   - file: The filename of the generated source.\n\t *   - sourceRoot: A root for all relative URLs in this source map.\n\t */\n\tfunction SourceMapGenerator(aArgs) {\n\t  if (!aArgs) {\n\t    aArgs = {};\n\t  }\n\t  this._file = util.getArg(aArgs, 'file', null);\n\t  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n\t  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n\t  this._sources = new ArraySet();\n\t  this._names = new ArraySet();\n\t  this._mappings = new MappingList();\n\t  this._sourcesContents = null;\n\t}\n\t\n\tSourceMapGenerator.prototype._version = 3;\n\t\n\t/**\n\t * Creates a new SourceMapGenerator based on a SourceMapConsumer\n\t *\n\t * @param aSourceMapConsumer The SourceMap.\n\t */\n\tSourceMapGenerator.fromSourceMap =\n\t  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n\t    var sourceRoot = aSourceMapConsumer.sourceRoot;\n\t    var generator = new SourceMapGenerator({\n\t      file: aSourceMapConsumer.file,\n\t      sourceRoot: sourceRoot\n\t    });\n\t    aSourceMapConsumer.eachMapping(function (mapping) {\n\t      var newMapping = {\n\t        generated: {\n\t          line: mapping.generatedLine,\n\t          column: mapping.generatedColumn\n\t        }\n\t      };\n\t\n\t      if (mapping.source != null) {\n\t        newMapping.source = mapping.source;\n\t        if (sourceRoot != null) {\n\t          newMapping.source = util.relative(sourceRoot, newMapping.source);\n\t        }\n\t\n\t        newMapping.original = {\n\t          line: mapping.originalLine,\n\t          column: mapping.originalColumn\n\t        };\n\t\n\t        if (mapping.name != null) {\n\t          newMapping.name = mapping.name;\n\t        }\n\t      }\n\t\n\t      generator.addMapping(newMapping);\n\t    });\n\t    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n\t      var sourceRelative = sourceFile;\n\t      if (sourceRoot !== null) {\n\t        sourceRelative = util.relative(sourceRoot, sourceFile);\n\t      }\n\t\n\t      if (!generator._sources.has(sourceRelative)) {\n\t        generator._sources.add(sourceRelative);\n\t      }\n\t\n\t      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n\t      if (content != null) {\n\t        generator.setSourceContent(sourceFile, content);\n\t      }\n\t    });\n\t    return generator;\n\t  };\n\t\n\t/**\n\t * Add a single mapping from original source line and column to the generated\n\t * source's line and column for this source map being created. The mapping\n\t * object should have the following properties:\n\t *\n\t *   - generated: An object with the generated line and column positions.\n\t *   - original: An object with the original line and column positions.\n\t *   - source: The original source file (relative to the sourceRoot).\n\t *   - name: An optional original token name for this mapping.\n\t */\n\tSourceMapGenerator.prototype.addMapping =\n\t  function SourceMapGenerator_addMapping(aArgs) {\n\t    var generated = util.getArg(aArgs, 'generated');\n\t    var original = util.getArg(aArgs, 'original', null);\n\t    var source = util.getArg(aArgs, 'source', null);\n\t    var name = util.getArg(aArgs, 'name', null);\n\t\n\t    if (!this._skipValidation) {\n\t      this._validateMapping(generated, original, source, name);\n\t    }\n\t\n\t    if (source != null) {\n\t      source = String(source);\n\t      if (!this._sources.has(source)) {\n\t        this._sources.add(source);\n\t      }\n\t    }\n\t\n\t    if (name != null) {\n\t      name = String(name);\n\t      if (!this._names.has(name)) {\n\t        this._names.add(name);\n\t      }\n\t    }\n\t\n\t    this._mappings.add({\n\t      generatedLine: generated.line,\n\t      generatedColumn: generated.column,\n\t      originalLine: original != null && original.line,\n\t      originalColumn: original != null && original.column,\n\t      source: source,\n\t      name: name\n\t    });\n\t  };\n\t\n\t/**\n\t * Set the source content for a source file.\n\t */\n\tSourceMapGenerator.prototype.setSourceContent =\n\t  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n\t    var source = aSourceFile;\n\t    if (this._sourceRoot != null) {\n\t      source = util.relative(this._sourceRoot, source);\n\t    }\n\t\n\t    if (aSourceContent != null) {\n\t      // Add the source content to the _sourcesContents map.\n\t      // Create a new _sourcesContents map if the property is null.\n\t      if (!this._sourcesContents) {\n\t        this._sourcesContents = Object.create(null);\n\t      }\n\t      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n\t    } else if (this._sourcesContents) {\n\t      // Remove the source file from the _sourcesContents map.\n\t      // If the _sourcesContents map is empty, set the property to null.\n\t      delete this._sourcesContents[util.toSetString(source)];\n\t      if (Object.keys(this._sourcesContents).length === 0) {\n\t        this._sourcesContents = null;\n\t      }\n\t    }\n\t  };\n\t\n\t/**\n\t * Applies the mappings of a sub-source-map for a specific source file to the\n\t * source map being generated. Each mapping to the supplied source file is\n\t * rewritten using the supplied source map. Note: The resolution for the\n\t * resulting mappings is the minimium of this map and the supplied map.\n\t *\n\t * @param aSourceMapConsumer The source map to be applied.\n\t * @param aSourceFile Optional. The filename of the source file.\n\t *        If omitted, SourceMapConsumer's file property will be used.\n\t * @param aSourceMapPath Optional. The dirname of the path to the source map\n\t *        to be applied. If relative, it is relative to the SourceMapConsumer.\n\t *        This parameter is needed when the two source maps aren't in the same\n\t *        directory, and the source map to be applied contains relative source\n\t *        paths. If so, those relative source paths need to be rewritten\n\t *        relative to the SourceMapGenerator.\n\t */\n\tSourceMapGenerator.prototype.applySourceMap =\n\t  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n\t    var sourceFile = aSourceFile;\n\t    // If aSourceFile is omitted, we will use the file property of the SourceMap\n\t    if (aSourceFile == null) {\n\t      if (aSourceMapConsumer.file == null) {\n\t        throw new Error(\n\t          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n\t          'or the source map\\'s \"file\" property. Both were omitted.'\n\t        );\n\t      }\n\t      sourceFile = aSourceMapConsumer.file;\n\t    }\n\t    var sourceRoot = this._sourceRoot;\n\t    // Make \"sourceFile\" relative if an absolute Url is passed.\n\t    if (sourceRoot != null) {\n\t      sourceFile = util.relative(sourceRoot, sourceFile);\n\t    }\n\t    // Applying the SourceMap can add and remove items from the sources and\n\t    // the names array.\n\t    var newSources = new ArraySet();\n\t    var newNames = new ArraySet();\n\t\n\t    // Find mappings for the \"sourceFile\"\n\t    this._mappings.unsortedForEach(function (mapping) {\n\t      if (mapping.source === sourceFile && mapping.originalLine != null) {\n\t        // Check if it can be mapped by the source map, then update the mapping.\n\t        var original = aSourceMapConsumer.originalPositionFor({\n\t          line: mapping.originalLine,\n\t          column: mapping.originalColumn\n\t        });\n\t        if (original.source != null) {\n\t          // Copy mapping\n\t          mapping.source = original.source;\n\t          if (aSourceMapPath != null) {\n\t            mapping.source = util.join(aSourceMapPath, mapping.source)\n\t          }\n\t          if (sourceRoot != null) {\n\t            mapping.source = util.relative(sourceRoot, mapping.source);\n\t          }\n\t          mapping.originalLine = original.line;\n\t          mapping.originalColumn = original.column;\n\t          if (original.name != null) {\n\t            mapping.name = original.name;\n\t          }\n\t        }\n\t      }\n\t\n\t      var source = mapping.source;\n\t      if (source != null && !newSources.has(source)) {\n\t        newSources.add(source);\n\t      }\n\t\n\t      var name = mapping.name;\n\t      if (name != null && !newNames.has(name)) {\n\t        newNames.add(name);\n\t      }\n\t\n\t    }, this);\n\t    this._sources = newSources;\n\t    this._names = newNames;\n\t\n\t    // Copy sourcesContents of applied map.\n\t    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n\t      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n\t      if (content != null) {\n\t        if (aSourceMapPath != null) {\n\t          sourceFile = util.join(aSourceMapPath, sourceFile);\n\t        }\n\t        if (sourceRoot != null) {\n\t          sourceFile = util.relative(sourceRoot, sourceFile);\n\t        }\n\t        this.setSourceContent(sourceFile, content);\n\t      }\n\t    }, this);\n\t  };\n\t\n\t/**\n\t * A mapping can have one of the three levels of data:\n\t *\n\t *   1. Just the generated position.\n\t *   2. The Generated position, original position, and original source.\n\t *   3. Generated and original position, original source, as well as a name\n\t *      token.\n\t *\n\t * To maintain consistency, we validate that any new mapping being added falls\n\t * in to one of these categories.\n\t */\n\tSourceMapGenerator.prototype._validateMapping =\n\t  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n\t                                              aName) {\n\t    // When aOriginal is truthy but has empty values for .line and .column,\n\t    // it is most likely a programmer error. In this case we throw a very\n\t    // specific error message to try to guide them the right way.\n\t    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n\t    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n\t        throw new Error(\n\t            'original.line and original.column are not numbers -- you probably meant to omit ' +\n\t            'the original mapping entirely and only map the generated position. If so, pass ' +\n\t            'null for the original mapping instead of an object with empty or null values.'\n\t        );\n\t    }\n\t\n\t    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n\t        && aGenerated.line > 0 && aGenerated.column >= 0\n\t        && !aOriginal && !aSource && !aName) {\n\t      // Case 1.\n\t      return;\n\t    }\n\t    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n\t             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n\t             && aGenerated.line > 0 && aGenerated.column >= 0\n\t             && aOriginal.line > 0 && aOriginal.column >= 0\n\t             && aSource) {\n\t      // Cases 2 and 3.\n\t      return;\n\t    }\n\t    else {\n\t      throw new Error('Invalid mapping: ' + JSON.stringify({\n\t        generated: aGenerated,\n\t        source: aSource,\n\t        original: aOriginal,\n\t        name: aName\n\t      }));\n\t    }\n\t  };\n\t\n\t/**\n\t * Serialize the accumulated mappings in to the stream of base 64 VLQs\n\t * specified by the source map format.\n\t */\n\tSourceMapGenerator.prototype._serializeMappings =\n\t  function SourceMapGenerator_serializeMappings() {\n\t    var previousGeneratedColumn = 0;\n\t    var previousGeneratedLine = 1;\n\t    var previousOriginalColumn = 0;\n\t    var previousOriginalLine = 0;\n\t    var previousName = 0;\n\t    var previousSource = 0;\n\t    var result = '';\n\t    var next;\n\t    var mapping;\n\t    var nameIdx;\n\t    var sourceIdx;\n\t\n\t    var mappings = this._mappings.toArray();\n\t    for (var i = 0, len = mappings.length; i < len; i++) {\n\t      mapping = mappings[i];\n\t      next = ''\n\t\n\t      if (mapping.generatedLine !== previousGeneratedLine) {\n\t        previousGeneratedColumn = 0;\n\t        while (mapping.generatedLine !== previousGeneratedLine) {\n\t          next += ';';\n\t          previousGeneratedLine++;\n\t        }\n\t      }\n\t      else {\n\t        if (i > 0) {\n\t          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n\t            continue;\n\t          }\n\t          next += ',';\n\t        }\n\t      }\n\t\n\t      next += base64VLQ.encode(mapping.generatedColumn\n\t                                 - previousGeneratedColumn);\n\t      previousGeneratedColumn = mapping.generatedColumn;\n\t\n\t      if (mapping.source != null) {\n\t        sourceIdx = this._sources.indexOf(mapping.source);\n\t        next += base64VLQ.encode(sourceIdx - previousSource);\n\t        previousSource = sourceIdx;\n\t\n\t        // lines are stored 0-based in SourceMap spec version 3\n\t        next += base64VLQ.encode(mapping.originalLine - 1\n\t                                   - previousOriginalLine);\n\t        previousOriginalLine = mapping.originalLine - 1;\n\t\n\t        next += base64VLQ.encode(mapping.originalColumn\n\t                                   - previousOriginalColumn);\n\t        previousOriginalColumn = mapping.originalColumn;\n\t\n\t        if (mapping.name != null) {\n\t          nameIdx = this._names.indexOf(mapping.name);\n\t          next += base64VLQ.encode(nameIdx - previousName);\n\t          previousName = nameIdx;\n\t        }\n\t      }\n\t\n\t      result += next;\n\t    }\n\t\n\t    return result;\n\t  };\n\t\n\tSourceMapGenerator.prototype._generateSourcesContent =\n\t  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n\t    return aSources.map(function (source) {\n\t      if (!this._sourcesContents) {\n\t        return null;\n\t      }\n\t      if (aSourceRoot != null) {\n\t        source = util.relative(aSourceRoot, source);\n\t      }\n\t      var key = util.toSetString(source);\n\t      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n\t        ? this._sourcesContents[key]\n\t        : null;\n\t    }, this);\n\t  };\n\t\n\t/**\n\t * Externalize the source map.\n\t */\n\tSourceMapGenerator.prototype.toJSON =\n\t  function SourceMapGenerator_toJSON() {\n\t    var map = {\n\t      version: this._version,\n\t      sources: this._sources.toArray(),\n\t      names: this._names.toArray(),\n\t      mappings: this._serializeMappings()\n\t    };\n\t    if (this._file != null) {\n\t      map.file = this._file;\n\t    }\n\t    if (this._sourceRoot != null) {\n\t      map.sourceRoot = this._sourceRoot;\n\t    }\n\t    if (this._sourcesContents) {\n\t      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n\t    }\n\t\n\t    return map;\n\t  };\n\t\n\t/**\n\t * Render the source map being generated to a string.\n\t */\n\tSourceMapGenerator.prototype.toString =\n\t  function SourceMapGenerator_toString() {\n\t    return JSON.stringify(this.toJSON());\n\t  };\n\t\n\texports.SourceMapGenerator = SourceMapGenerator;\n\n\n/***/ }),\n/* 2 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t *\n\t * Based on the Base 64 VLQ implementation in Closure Compiler:\n\t * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n\t *\n\t * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n\t * Redistribution and use in source and binary forms, with or without\n\t * modification, are permitted provided that the following conditions are\n\t * met:\n\t *\n\t *  * Redistributions of source code must retain the above copyright\n\t *    notice, this list of conditions and the following disclaimer.\n\t *  * Redistributions in binary form must reproduce the above\n\t *    copyright notice, this list of conditions and the following\n\t *    disclaimer in the documentation and/or other materials provided\n\t *    with the distribution.\n\t *  * Neither the name of Google Inc. nor the names of its\n\t *    contributors may be used to endorse or promote products derived\n\t *    from this software without specific prior written permission.\n\t *\n\t * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\t * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\t * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\t * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\t * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\t * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\t * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\t * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\t * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\t * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\t * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\t */\n\t\n\tvar base64 = __webpack_require__(3);\n\t\n\t// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n\t// length quantities we use in the source map spec, the first bit is the sign,\n\t// the next four bits are the actual value, and the 6th bit is the\n\t// continuation bit. The continuation bit tells us whether there are more\n\t// digits in this value following this digit.\n\t//\n\t//   Continuation\n\t//   |    Sign\n\t//   |    |\n\t//   V    V\n\t//   101011\n\t\n\tvar VLQ_BASE_SHIFT = 5;\n\t\n\t// binary: 100000\n\tvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\t\n\t// binary: 011111\n\tvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\t\n\t// binary: 100000\n\tvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\t\n\t/**\n\t * Converts from a two-complement value to a value where the sign bit is\n\t * placed in the least significant bit.  For example, as decimals:\n\t *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n\t *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n\t */\n\tfunction toVLQSigned(aValue) {\n\t  return aValue < 0\n\t    ? ((-aValue) << 1) + 1\n\t    : (aValue << 1) + 0;\n\t}\n\t\n\t/**\n\t * Converts to a two-complement value from a value where the sign bit is\n\t * placed in the least significant bit.  For example, as decimals:\n\t *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n\t *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n\t */\n\tfunction fromVLQSigned(aValue) {\n\t  var isNegative = (aValue & 1) === 1;\n\t  var shifted = aValue >> 1;\n\t  return isNegative\n\t    ? -shifted\n\t    : shifted;\n\t}\n\t\n\t/**\n\t * Returns the base 64 VLQ encoded value.\n\t */\n\texports.encode = function base64VLQ_encode(aValue) {\n\t  var encoded = \"\";\n\t  var digit;\n\t\n\t  var vlq = toVLQSigned(aValue);\n\t\n\t  do {\n\t    digit = vlq & VLQ_BASE_MASK;\n\t    vlq >>>= VLQ_BASE_SHIFT;\n\t    if (vlq > 0) {\n\t      // There are still more digits in this value, so we must make sure the\n\t      // continuation bit is marked.\n\t      digit |= VLQ_CONTINUATION_BIT;\n\t    }\n\t    encoded += base64.encode(digit);\n\t  } while (vlq > 0);\n\t\n\t  return encoded;\n\t};\n\t\n\t/**\n\t * Decodes the next base 64 VLQ value from the given string and returns the\n\t * value and the rest of the string via the out parameter.\n\t */\n\texports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n\t  var strLen = aStr.length;\n\t  var result = 0;\n\t  var shift = 0;\n\t  var continuation, digit;\n\t\n\t  do {\n\t    if (aIndex >= strLen) {\n\t      throw new Error(\"Expected more digits in base 64 VLQ value.\");\n\t    }\n\t\n\t    digit = base64.decode(aStr.charCodeAt(aIndex++));\n\t    if (digit === -1) {\n\t      throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n\t    }\n\t\n\t    continuation = !!(digit & VLQ_CONTINUATION_BIT);\n\t    digit &= VLQ_BASE_MASK;\n\t    result = result + (digit << shift);\n\t    shift += VLQ_BASE_SHIFT;\n\t  } while (continuation);\n\t\n\t  aOutParam.value = fromVLQSigned(result);\n\t  aOutParam.rest = aIndex;\n\t};\n\n\n/***/ }),\n/* 3 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\t\n\t/**\n\t * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n\t */\n\texports.encode = function (number) {\n\t  if (0 <= number && number < intToCharMap.length) {\n\t    return intToCharMap[number];\n\t  }\n\t  throw new TypeError(\"Must be between 0 and 63: \" + number);\n\t};\n\t\n\t/**\n\t * Decode a single base 64 character code digit to an integer. Returns -1 on\n\t * failure.\n\t */\n\texports.decode = function (charCode) {\n\t  var bigA = 65;     // 'A'\n\t  var bigZ = 90;     // 'Z'\n\t\n\t  var littleA = 97;  // 'a'\n\t  var littleZ = 122; // 'z'\n\t\n\t  var zero = 48;     // '0'\n\t  var nine = 57;     // '9'\n\t\n\t  var plus = 43;     // '+'\n\t  var slash = 47;    // '/'\n\t\n\t  var littleOffset = 26;\n\t  var numberOffset = 52;\n\t\n\t  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n\t  if (bigA <= charCode && charCode <= bigZ) {\n\t    return (charCode - bigA);\n\t  }\n\t\n\t  // 26 - 51: abcdefghijklmnopqrstuvwxyz\n\t  if (littleA <= charCode && charCode <= littleZ) {\n\t    return (charCode - littleA + littleOffset);\n\t  }\n\t\n\t  // 52 - 61: 0123456789\n\t  if (zero <= charCode && charCode <= nine) {\n\t    return (charCode - zero + numberOffset);\n\t  }\n\t\n\t  // 62: +\n\t  if (charCode == plus) {\n\t    return 62;\n\t  }\n\t\n\t  // 63: /\n\t  if (charCode == slash) {\n\t    return 63;\n\t  }\n\t\n\t  // Invalid base64 digit.\n\t  return -1;\n\t};\n\n\n/***/ }),\n/* 4 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\t/**\n\t * This is a helper function for getting values from parameter/options\n\t * objects.\n\t *\n\t * @param args The object we are extracting values from\n\t * @param name The name of the property we are getting.\n\t * @param defaultValue An optional value to return if the property is missing\n\t * from the object. If this is not specified and the property is missing, an\n\t * error will be thrown.\n\t */\n\tfunction getArg(aArgs, aName, aDefaultValue) {\n\t  if (aName in aArgs) {\n\t    return aArgs[aName];\n\t  } else if (arguments.length === 3) {\n\t    return aDefaultValue;\n\t  } else {\n\t    throw new Error('\"' + aName + '\" is a required argument.');\n\t  }\n\t}\n\texports.getArg = getArg;\n\t\n\tvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\n\tvar dataUrlRegexp = /^data:.+\\,.+$/;\n\t\n\tfunction urlParse(aUrl) {\n\t  var match = aUrl.match(urlRegexp);\n\t  if (!match) {\n\t    return null;\n\t  }\n\t  return {\n\t    scheme: match[1],\n\t    auth: match[2],\n\t    host: match[3],\n\t    port: match[4],\n\t    path: match[5]\n\t  };\n\t}\n\texports.urlParse = urlParse;\n\t\n\tfunction urlGenerate(aParsedUrl) {\n\t  var url = '';\n\t  if (aParsedUrl.scheme) {\n\t    url += aParsedUrl.scheme + ':';\n\t  }\n\t  url += '//';\n\t  if (aParsedUrl.auth) {\n\t    url += aParsedUrl.auth + '@';\n\t  }\n\t  if (aParsedUrl.host) {\n\t    url += aParsedUrl.host;\n\t  }\n\t  if (aParsedUrl.port) {\n\t    url += \":\" + aParsedUrl.port\n\t  }\n\t  if (aParsedUrl.path) {\n\t    url += aParsedUrl.path;\n\t  }\n\t  return url;\n\t}\n\texports.urlGenerate = urlGenerate;\n\t\n\t/**\n\t * Normalizes a path, or the path portion of a URL:\n\t *\n\t * - Replaces consecutive slashes with one slash.\n\t * - Removes unnecessary '.' parts.\n\t * - Removes unnecessary '<dir>/..' parts.\n\t *\n\t * Based on code in the Node.js 'path' core module.\n\t *\n\t * @param aPath The path or url to normalize.\n\t */\n\tfunction normalize(aPath) {\n\t  var path = aPath;\n\t  var url = urlParse(aPath);\n\t  if (url) {\n\t    if (!url.path) {\n\t      return aPath;\n\t    }\n\t    path = url.path;\n\t  }\n\t  var isAbsolute = exports.isAbsolute(path);\n\t\n\t  var parts = path.split(/\\/+/);\n\t  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n\t    part = parts[i];\n\t    if (part === '.') {\n\t      parts.splice(i, 1);\n\t    } else if (part === '..') {\n\t      up++;\n\t    } else if (up > 0) {\n\t      if (part === '') {\n\t        // The first part is blank if the path is absolute. Trying to go\n\t        // above the root is a no-op. Therefore we can remove all '..' parts\n\t        // directly after the root.\n\t        parts.splice(i + 1, up);\n\t        up = 0;\n\t      } else {\n\t        parts.splice(i, 2);\n\t        up--;\n\t      }\n\t    }\n\t  }\n\t  path = parts.join('/');\n\t\n\t  if (path === '') {\n\t    path = isAbsolute ? '/' : '.';\n\t  }\n\t\n\t  if (url) {\n\t    url.path = path;\n\t    return urlGenerate(url);\n\t  }\n\t  return path;\n\t}\n\texports.normalize = normalize;\n\t\n\t/**\n\t * Joins two paths/URLs.\n\t *\n\t * @param aRoot The root path or URL.\n\t * @param aPath The path or URL to be joined with the root.\n\t *\n\t * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n\t *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n\t *   first.\n\t * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n\t *   is updated with the result and aRoot is returned. Otherwise the result\n\t *   is returned.\n\t *   - If aPath is absolute, the result is aPath.\n\t *   - Otherwise the two paths are joined with a slash.\n\t * - Joining for example 'http://' and 'www.example.com' is also supported.\n\t */\n\tfunction join(aRoot, aPath) {\n\t  if (aRoot === \"\") {\n\t    aRoot = \".\";\n\t  }\n\t  if (aPath === \"\") {\n\t    aPath = \".\";\n\t  }\n\t  var aPathUrl = urlParse(aPath);\n\t  var aRootUrl = urlParse(aRoot);\n\t  if (aRootUrl) {\n\t    aRoot = aRootUrl.path || '/';\n\t  }\n\t\n\t  // `join(foo, '//www.example.org')`\n\t  if (aPathUrl && !aPathUrl.scheme) {\n\t    if (aRootUrl) {\n\t      aPathUrl.scheme = aRootUrl.scheme;\n\t    }\n\t    return urlGenerate(aPathUrl);\n\t  }\n\t\n\t  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n\t    return aPath;\n\t  }\n\t\n\t  // `join('http://', 'www.example.com')`\n\t  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n\t    aRootUrl.host = aPath;\n\t    return urlGenerate(aRootUrl);\n\t  }\n\t\n\t  var joined = aPath.charAt(0) === '/'\n\t    ? aPath\n\t    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\t\n\t  if (aRootUrl) {\n\t    aRootUrl.path = joined;\n\t    return urlGenerate(aRootUrl);\n\t  }\n\t  return joined;\n\t}\n\texports.join = join;\n\t\n\texports.isAbsolute = function (aPath) {\n\t  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n\t};\n\t\n\t/**\n\t * Make a path relative to a URL or another path.\n\t *\n\t * @param aRoot The root path or URL.\n\t * @param aPath The path or URL to be made relative to aRoot.\n\t */\n\tfunction relative(aRoot, aPath) {\n\t  if (aRoot === \"\") {\n\t    aRoot = \".\";\n\t  }\n\t\n\t  aRoot = aRoot.replace(/\\/$/, '');\n\t\n\t  // It is possible for the path to be above the root. In this case, simply\n\t  // checking whether the root is a prefix of the path won't work. Instead, we\n\t  // need to remove components from the root one by one, until either we find\n\t  // a prefix that fits, or we run out of components to remove.\n\t  var level = 0;\n\t  while (aPath.indexOf(aRoot + '/') !== 0) {\n\t    var index = aRoot.lastIndexOf(\"/\");\n\t    if (index < 0) {\n\t      return aPath;\n\t    }\n\t\n\t    // If the only part of the root that is left is the scheme (i.e. http://,\n\t    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n\t    // have exhausted all components, so the path is not relative to the root.\n\t    aRoot = aRoot.slice(0, index);\n\t    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n\t      return aPath;\n\t    }\n\t\n\t    ++level;\n\t  }\n\t\n\t  // Make sure we add a \"../\" for each component we removed from the root.\n\t  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n\t}\n\texports.relative = relative;\n\t\n\tvar supportsNullProto = (function () {\n\t  var obj = Object.create(null);\n\t  return !('__proto__' in obj);\n\t}());\n\t\n\tfunction identity (s) {\n\t  return s;\n\t}\n\t\n\t/**\n\t * Because behavior goes wacky when you set `__proto__` on objects, we\n\t * have to prefix all the strings in our set with an arbitrary character.\n\t *\n\t * See https://github.com/mozilla/source-map/pull/31 and\n\t * https://github.com/mozilla/source-map/issues/30\n\t *\n\t * @param String aStr\n\t */\n\tfunction toSetString(aStr) {\n\t  if (isProtoString(aStr)) {\n\t    return '$' + aStr;\n\t  }\n\t\n\t  return aStr;\n\t}\n\texports.toSetString = supportsNullProto ? identity : toSetString;\n\t\n\tfunction fromSetString(aStr) {\n\t  if (isProtoString(aStr)) {\n\t    return aStr.slice(1);\n\t  }\n\t\n\t  return aStr;\n\t}\n\texports.fromSetString = supportsNullProto ? identity : fromSetString;\n\t\n\tfunction isProtoString(s) {\n\t  if (!s) {\n\t    return false;\n\t  }\n\t\n\t  var length = s.length;\n\t\n\t  if (length < 9 /* \"__proto__\".length */) {\n\t    return false;\n\t  }\n\t\n\t  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n\t      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n\t      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n\t      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n\t      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n\t      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n\t      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n\t      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n\t      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n\t    return false;\n\t  }\n\t\n\t  for (var i = length - 10; i >= 0; i--) {\n\t    if (s.charCodeAt(i) !== 36 /* '$' */) {\n\t      return false;\n\t    }\n\t  }\n\t\n\t  return true;\n\t}\n\t\n\t/**\n\t * Comparator between two mappings where the original positions are compared.\n\t *\n\t * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n\t * mappings with the same original source/line/column, but different generated\n\t * line and column the same. Useful when searching for a mapping with a\n\t * stubbed out mapping.\n\t */\n\tfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n\t  var cmp = strcmp(mappingA.source, mappingB.source);\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalLine - mappingB.originalLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalColumn - mappingB.originalColumn;\n\t  if (cmp !== 0 || onlyCompareOriginal) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedLine - mappingB.generatedLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  return strcmp(mappingA.name, mappingB.name);\n\t}\n\texports.compareByOriginalPositions = compareByOriginalPositions;\n\t\n\t/**\n\t * Comparator between two mappings with deflated source and name indices where\n\t * the generated positions are compared.\n\t *\n\t * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n\t * mappings with the same generated line and column, but different\n\t * source/name/original line and column the same. Useful when searching for a\n\t * mapping with a stubbed out mapping.\n\t */\n\tfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n\t  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n\t  if (cmp !== 0 || onlyCompareGenerated) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = strcmp(mappingA.source, mappingB.source);\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalLine - mappingB.originalLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalColumn - mappingB.originalColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  return strcmp(mappingA.name, mappingB.name);\n\t}\n\texports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\t\n\tfunction strcmp(aStr1, aStr2) {\n\t  if (aStr1 === aStr2) {\n\t    return 0;\n\t  }\n\t\n\t  if (aStr1 === null) {\n\t    return 1; // aStr2 !== null\n\t  }\n\t\n\t  if (aStr2 === null) {\n\t    return -1; // aStr1 !== null\n\t  }\n\t\n\t  if (aStr1 > aStr2) {\n\t    return 1;\n\t  }\n\t\n\t  return -1;\n\t}\n\t\n\t/**\n\t * Comparator between two mappings with inflated source and name strings where\n\t * the generated positions are compared.\n\t */\n\tfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n\t  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = strcmp(mappingA.source, mappingB.source);\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalLine - mappingB.originalLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalColumn - mappingB.originalColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  return strcmp(mappingA.name, mappingB.name);\n\t}\n\texports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\t\n\t/**\n\t * Strip any JSON XSSI avoidance prefix from the string (as documented\n\t * in the source maps specification), and then parse the string as\n\t * JSON.\n\t */\n\tfunction parseSourceMapInput(str) {\n\t  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n\t}\n\texports.parseSourceMapInput = parseSourceMapInput;\n\t\n\t/**\n\t * Compute the URL of a source given the the source root, the source's\n\t * URL, and the source map's URL.\n\t */\n\tfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n\t  sourceURL = sourceURL || '';\n\t\n\t  if (sourceRoot) {\n\t    // This follows what Chrome does.\n\t    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n\t      sourceRoot += '/';\n\t    }\n\t    // The spec says:\n\t    //   Line 4: An optional source root, useful for relocating source\n\t    //   files on a server or removing repeated values in the\n\t    //   “sources” entry.  This value is prepended to the individual\n\t    //   entries in the “source” field.\n\t    sourceURL = sourceRoot + sourceURL;\n\t  }\n\t\n\t  // Historically, SourceMapConsumer did not take the sourceMapURL as\n\t  // a parameter.  This mode is still somewhat supported, which is why\n\t  // this code block is conditional.  However, it's preferable to pass\n\t  // the source map URL to SourceMapConsumer, so that this function\n\t  // can implement the source URL resolution algorithm as outlined in\n\t  // the spec.  This block is basically the equivalent of:\n\t  //    new URL(sourceURL, sourceMapURL).toString()\n\t  // ... except it avoids using URL, which wasn't available in the\n\t  // older releases of node still supported by this library.\n\t  //\n\t  // The spec says:\n\t  //   If the sources are not absolute URLs after prepending of the\n\t  //   “sourceRoot”, the sources are resolved relative to the\n\t  //   SourceMap (like resolving script src in a html document).\n\t  if (sourceMapURL) {\n\t    var parsed = urlParse(sourceMapURL);\n\t    if (!parsed) {\n\t      throw new Error(\"sourceMapURL could not be parsed\");\n\t    }\n\t    if (parsed.path) {\n\t      // Strip the last path component, but keep the \"/\".\n\t      var index = parsed.path.lastIndexOf('/');\n\t      if (index >= 0) {\n\t        parsed.path = parsed.path.substring(0, index + 1);\n\t      }\n\t    }\n\t    sourceURL = join(urlGenerate(parsed), sourceURL);\n\t  }\n\t\n\t  return normalize(sourceURL);\n\t}\n\texports.computeSourceURL = computeSourceURL;\n\n\n/***/ }),\n/* 5 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar util = __webpack_require__(4);\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar hasNativeMap = typeof Map !== \"undefined\";\n\t\n\t/**\n\t * A data structure which is a combination of an array and a set. Adding a new\n\t * member is O(1), testing for membership is O(1), and finding the index of an\n\t * element is O(1). Removing elements from the set is not supported. Only\n\t * strings are supported for membership.\n\t */\n\tfunction ArraySet() {\n\t  this._array = [];\n\t  this._set = hasNativeMap ? new Map() : Object.create(null);\n\t}\n\t\n\t/**\n\t * Static method for creating ArraySet instances from an existing array.\n\t */\n\tArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n\t  var set = new ArraySet();\n\t  for (var i = 0, len = aArray.length; i < len; i++) {\n\t    set.add(aArray[i], aAllowDuplicates);\n\t  }\n\t  return set;\n\t};\n\t\n\t/**\n\t * Return how many unique items are in this ArraySet. If duplicates have been\n\t * added, than those do not count towards the size.\n\t *\n\t * @returns Number\n\t */\n\tArraySet.prototype.size = function ArraySet_size() {\n\t  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n\t};\n\t\n\t/**\n\t * Add the given string to this set.\n\t *\n\t * @param String aStr\n\t */\n\tArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n\t  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n\t  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n\t  var idx = this._array.length;\n\t  if (!isDuplicate || aAllowDuplicates) {\n\t    this._array.push(aStr);\n\t  }\n\t  if (!isDuplicate) {\n\t    if (hasNativeMap) {\n\t      this._set.set(aStr, idx);\n\t    } else {\n\t      this._set[sStr] = idx;\n\t    }\n\t  }\n\t};\n\t\n\t/**\n\t * Is the given string a member of this set?\n\t *\n\t * @param String aStr\n\t */\n\tArraySet.prototype.has = function ArraySet_has(aStr) {\n\t  if (hasNativeMap) {\n\t    return this._set.has(aStr);\n\t  } else {\n\t    var sStr = util.toSetString(aStr);\n\t    return has.call(this._set, sStr);\n\t  }\n\t};\n\t\n\t/**\n\t * What is the index of the given string in the array?\n\t *\n\t * @param String aStr\n\t */\n\tArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n\t  if (hasNativeMap) {\n\t    var idx = this._set.get(aStr);\n\t    if (idx >= 0) {\n\t        return idx;\n\t    }\n\t  } else {\n\t    var sStr = util.toSetString(aStr);\n\t    if (has.call(this._set, sStr)) {\n\t      return this._set[sStr];\n\t    }\n\t  }\n\t\n\t  throw new Error('\"' + aStr + '\" is not in the set.');\n\t};\n\t\n\t/**\n\t * What is the element at the given index?\n\t *\n\t * @param Number aIdx\n\t */\n\tArraySet.prototype.at = function ArraySet_at(aIdx) {\n\t  if (aIdx >= 0 && aIdx < this._array.length) {\n\t    return this._array[aIdx];\n\t  }\n\t  throw new Error('No element indexed by ' + aIdx);\n\t};\n\t\n\t/**\n\t * Returns the array representation of this set (which has the proper indices\n\t * indicated by indexOf). Note that this is a copy of the internal array used\n\t * for storing the members so that no one can mess with internal state.\n\t */\n\tArraySet.prototype.toArray = function ArraySet_toArray() {\n\t  return this._array.slice();\n\t};\n\t\n\texports.ArraySet = ArraySet;\n\n\n/***/ }),\n/* 6 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2014 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar util = __webpack_require__(4);\n\t\n\t/**\n\t * Determine whether mappingB is after mappingA with respect to generated\n\t * position.\n\t */\n\tfunction generatedPositionAfter(mappingA, mappingB) {\n\t  // Optimized for most common case\n\t  var lineA = mappingA.generatedLine;\n\t  var lineB = mappingB.generatedLine;\n\t  var columnA = mappingA.generatedColumn;\n\t  var columnB = mappingB.generatedColumn;\n\t  return lineB > lineA || lineB == lineA && columnB >= columnA ||\n\t         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n\t}\n\t\n\t/**\n\t * A data structure to provide a sorted view of accumulated mappings in a\n\t * performance conscious manner. It trades a neglibable overhead in general\n\t * case for a large speedup in case of mappings being added in order.\n\t */\n\tfunction MappingList() {\n\t  this._array = [];\n\t  this._sorted = true;\n\t  // Serves as infimum\n\t  this._last = {generatedLine: -1, generatedColumn: 0};\n\t}\n\t\n\t/**\n\t * Iterate through internal items. This method takes the same arguments that\n\t * `Array.prototype.forEach` takes.\n\t *\n\t * NOTE: The order of the mappings is NOT guaranteed.\n\t */\n\tMappingList.prototype.unsortedForEach =\n\t  function MappingList_forEach(aCallback, aThisArg) {\n\t    this._array.forEach(aCallback, aThisArg);\n\t  };\n\t\n\t/**\n\t * Add the given source mapping.\n\t *\n\t * @param Object aMapping\n\t */\n\tMappingList.prototype.add = function MappingList_add(aMapping) {\n\t  if (generatedPositionAfter(this._last, aMapping)) {\n\t    this._last = aMapping;\n\t    this._array.push(aMapping);\n\t  } else {\n\t    this._sorted = false;\n\t    this._array.push(aMapping);\n\t  }\n\t};\n\t\n\t/**\n\t * Returns the flat, sorted array of mappings. The mappings are sorted by\n\t * generated position.\n\t *\n\t * WARNING: This method returns internal data without copying, for\n\t * performance. The return value must NOT be mutated, and should be treated as\n\t * an immutable borrow. If you want to take ownership, you must make your own\n\t * copy.\n\t */\n\tMappingList.prototype.toArray = function MappingList_toArray() {\n\t  if (!this._sorted) {\n\t    this._array.sort(util.compareByGeneratedPositionsInflated);\n\t    this._sorted = true;\n\t  }\n\t  return this._array;\n\t};\n\t\n\texports.MappingList = MappingList;\n\n\n/***/ }),\n/* 7 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar util = __webpack_require__(4);\n\tvar binarySearch = __webpack_require__(8);\n\tvar ArraySet = __webpack_require__(5).ArraySet;\n\tvar base64VLQ = __webpack_require__(2);\n\tvar quickSort = __webpack_require__(9).quickSort;\n\t\n\tfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n\t  var sourceMap = aSourceMap;\n\t  if (typeof aSourceMap === 'string') {\n\t    sourceMap = util.parseSourceMapInput(aSourceMap);\n\t  }\n\t\n\t  return sourceMap.sections != null\n\t    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n\t    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n\t}\n\t\n\tSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n\t  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n\t}\n\t\n\t/**\n\t * The version of the source mapping spec that we are consuming.\n\t */\n\tSourceMapConsumer.prototype._version = 3;\n\t\n\t// `__generatedMappings` and `__originalMappings` are arrays that hold the\n\t// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n\t// are lazily instantiated, accessed via the `_generatedMappings` and\n\t// `_originalMappings` getters respectively, and we only parse the mappings\n\t// and create these arrays once queried for a source location. We jump through\n\t// these hoops because there can be many thousands of mappings, and parsing\n\t// them is expensive, so we only want to do it if we must.\n\t//\n\t// Each object in the arrays is of the form:\n\t//\n\t//     {\n\t//       generatedLine: The line number in the generated code,\n\t//       generatedColumn: The column number in the generated code,\n\t//       source: The path to the original source file that generated this\n\t//               chunk of code,\n\t//       originalLine: The line number in the original source that\n\t//                     corresponds to this chunk of generated code,\n\t//       originalColumn: The column number in the original source that\n\t//                       corresponds to this chunk of generated code,\n\t//       name: The name of the original symbol which generated this chunk of\n\t//             code.\n\t//     }\n\t//\n\t// All properties except for `generatedLine` and `generatedColumn` can be\n\t// `null`.\n\t//\n\t// `_generatedMappings` is ordered by the generated positions.\n\t//\n\t// `_originalMappings` is ordered by the original positions.\n\t\n\tSourceMapConsumer.prototype.__generatedMappings = null;\n\tObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n\t  configurable: true,\n\t  enumerable: true,\n\t  get: function () {\n\t    if (!this.__generatedMappings) {\n\t      this._parseMappings(this._mappings, this.sourceRoot);\n\t    }\n\t\n\t    return this.__generatedMappings;\n\t  }\n\t});\n\t\n\tSourceMapConsumer.prototype.__originalMappings = null;\n\tObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n\t  configurable: true,\n\t  enumerable: true,\n\t  get: function () {\n\t    if (!this.__originalMappings) {\n\t      this._parseMappings(this._mappings, this.sourceRoot);\n\t    }\n\t\n\t    return this.__originalMappings;\n\t  }\n\t});\n\t\n\tSourceMapConsumer.prototype._charIsMappingSeparator =\n\t  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n\t    var c = aStr.charAt(index);\n\t    return c === \";\" || c === \",\";\n\t  };\n\t\n\t/**\n\t * Parse the mappings in a string in to a data structure which we can easily\n\t * query (the ordered arrays in the `this.__generatedMappings` and\n\t * `this.__originalMappings` properties).\n\t */\n\tSourceMapConsumer.prototype._parseMappings =\n\t  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n\t    throw new Error(\"Subclasses must implement _parseMappings\");\n\t  };\n\t\n\tSourceMapConsumer.GENERATED_ORDER = 1;\n\tSourceMapConsumer.ORIGINAL_ORDER = 2;\n\t\n\tSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\n\tSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\t\n\t/**\n\t * Iterate over each mapping between an original source/line/column and a\n\t * generated line/column in this source map.\n\t *\n\t * @param Function aCallback\n\t *        The function that is called with each mapping.\n\t * @param Object aContext\n\t *        Optional. If specified, this object will be the value of `this` every\n\t *        time that `aCallback` is called.\n\t * @param aOrder\n\t *        Either `SourceMapConsumer.GENERATED_ORDER` or\n\t *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n\t *        iterate over the mappings sorted by the generated file's line/column\n\t *        order or the original's source/line/column order, respectively. Defaults to\n\t *        `SourceMapConsumer.GENERATED_ORDER`.\n\t */\n\tSourceMapConsumer.prototype.eachMapping =\n\t  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n\t    var context = aContext || null;\n\t    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\t\n\t    var mappings;\n\t    switch (order) {\n\t    case SourceMapConsumer.GENERATED_ORDER:\n\t      mappings = this._generatedMappings;\n\t      break;\n\t    case SourceMapConsumer.ORIGINAL_ORDER:\n\t      mappings = this._originalMappings;\n\t      break;\n\t    default:\n\t      throw new Error(\"Unknown order of iteration.\");\n\t    }\n\t\n\t    var sourceRoot = this.sourceRoot;\n\t    mappings.map(function (mapping) {\n\t      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n\t      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n\t      return {\n\t        source: source,\n\t        generatedLine: mapping.generatedLine,\n\t        generatedColumn: mapping.generatedColumn,\n\t        originalLine: mapping.originalLine,\n\t        originalColumn: mapping.originalColumn,\n\t        name: mapping.name === null ? null : this._names.at(mapping.name)\n\t      };\n\t    }, this).forEach(aCallback, context);\n\t  };\n\t\n\t/**\n\t * Returns all generated line and column information for the original source,\n\t * line, and column provided. If no column is provided, returns all mappings\n\t * corresponding to a either the line we are searching for or the next\n\t * closest line that has any mappings. Otherwise, returns all mappings\n\t * corresponding to the given line and either the column we are searching for\n\t * or the next closest column that has any offsets.\n\t *\n\t * The only argument is an object with the following properties:\n\t *\n\t *   - source: The filename of the original source.\n\t *   - line: The line number in the original source.  The line number is 1-based.\n\t *   - column: Optional. the column number in the original source.\n\t *    The column number is 0-based.\n\t *\n\t * and an array of objects is returned, each with the following properties:\n\t *\n\t *   - line: The line number in the generated source, or null.  The\n\t *    line number is 1-based.\n\t *   - column: The column number in the generated source, or null.\n\t *    The column number is 0-based.\n\t */\n\tSourceMapConsumer.prototype.allGeneratedPositionsFor =\n\t  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n\t    var line = util.getArg(aArgs, 'line');\n\t\n\t    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n\t    // returns the index of the closest mapping less than the needle. By\n\t    // setting needle.originalColumn to 0, we thus find the last mapping for\n\t    // the given line, provided such a mapping exists.\n\t    var needle = {\n\t      source: util.getArg(aArgs, 'source'),\n\t      originalLine: line,\n\t      originalColumn: util.getArg(aArgs, 'column', 0)\n\t    };\n\t\n\t    needle.source = this._findSourceIndex(needle.source);\n\t    if (needle.source < 0) {\n\t      return [];\n\t    }\n\t\n\t    var mappings = [];\n\t\n\t    var index = this._findMapping(needle,\n\t                                  this._originalMappings,\n\t                                  \"originalLine\",\n\t                                  \"originalColumn\",\n\t                                  util.compareByOriginalPositions,\n\t                                  binarySearch.LEAST_UPPER_BOUND);\n\t    if (index >= 0) {\n\t      var mapping = this._originalMappings[index];\n\t\n\t      if (aArgs.column === undefined) {\n\t        var originalLine = mapping.originalLine;\n\t\n\t        // Iterate until either we run out of mappings, or we run into\n\t        // a mapping for a different line than the one we found. Since\n\t        // mappings are sorted, this is guaranteed to find all mappings for\n\t        // the line we found.\n\t        while (mapping && mapping.originalLine === originalLine) {\n\t          mappings.push({\n\t            line: util.getArg(mapping, 'generatedLine', null),\n\t            column: util.getArg(mapping, 'generatedColumn', null),\n\t            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n\t          });\n\t\n\t          mapping = this._originalMappings[++index];\n\t        }\n\t      } else {\n\t        var originalColumn = mapping.originalColumn;\n\t\n\t        // Iterate until either we run out of mappings, or we run into\n\t        // a mapping for a different line than the one we were searching for.\n\t        // Since mappings are sorted, this is guaranteed to find all mappings for\n\t        // the line we are searching for.\n\t        while (mapping &&\n\t               mapping.originalLine === line &&\n\t               mapping.originalColumn == originalColumn) {\n\t          mappings.push({\n\t            line: util.getArg(mapping, 'generatedLine', null),\n\t            column: util.getArg(mapping, 'generatedColumn', null),\n\t            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n\t          });\n\t\n\t          mapping = this._originalMappings[++index];\n\t        }\n\t      }\n\t    }\n\t\n\t    return mappings;\n\t  };\n\t\n\texports.SourceMapConsumer = SourceMapConsumer;\n\t\n\t/**\n\t * A BasicSourceMapConsumer instance represents a parsed source map which we can\n\t * query for information about the original file positions by giving it a file\n\t * position in the generated source.\n\t *\n\t * The first parameter is the raw source map (either as a JSON string, or\n\t * already parsed to an object). According to the spec, source maps have the\n\t * following attributes:\n\t *\n\t *   - version: Which version of the source map spec this map is following.\n\t *   - sources: An array of URLs to the original source files.\n\t *   - names: An array of identifiers which can be referrenced by individual mappings.\n\t *   - sourceRoot: Optional. The URL root from which all sources are relative.\n\t *   - sourcesContent: Optional. An array of contents of the original source files.\n\t *   - mappings: A string of base64 VLQs which contain the actual mappings.\n\t *   - file: Optional. The generated file this source map is associated with.\n\t *\n\t * Here is an example source map, taken from the source map spec[0]:\n\t *\n\t *     {\n\t *       version : 3,\n\t *       file: \"out.js\",\n\t *       sourceRoot : \"\",\n\t *       sources: [\"foo.js\", \"bar.js\"],\n\t *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n\t *       mappings: \"AA,AB;;ABCDE;\"\n\t *     }\n\t *\n\t * The second parameter, if given, is a string whose value is the URL\n\t * at which the source map was found.  This URL is used to compute the\n\t * sources array.\n\t *\n\t * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n\t */\n\tfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n\t  var sourceMap = aSourceMap;\n\t  if (typeof aSourceMap === 'string') {\n\t    sourceMap = util.parseSourceMapInput(aSourceMap);\n\t  }\n\t\n\t  var version = util.getArg(sourceMap, 'version');\n\t  var sources = util.getArg(sourceMap, 'sources');\n\t  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n\t  // requires the array) to play nice here.\n\t  var names = util.getArg(sourceMap, 'names', []);\n\t  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n\t  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n\t  var mappings = util.getArg(sourceMap, 'mappings');\n\t  var file = util.getArg(sourceMap, 'file', null);\n\t\n\t  // Once again, Sass deviates from the spec and supplies the version as a\n\t  // string rather than a number, so we use loose equality checking here.\n\t  if (version != this._version) {\n\t    throw new Error('Unsupported version: ' + version);\n\t  }\n\t\n\t  if (sourceRoot) {\n\t    sourceRoot = util.normalize(sourceRoot);\n\t  }\n\t\n\t  sources = sources\n\t    .map(String)\n\t    // Some source maps produce relative source paths like \"./foo.js\" instead of\n\t    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n\t    // See bugzil.la/1090768.\n\t    .map(util.normalize)\n\t    // Always ensure that absolute sources are internally stored relative to\n\t    // the source root, if the source root is absolute. Not doing this would\n\t    // be particularly problematic when the source root is a prefix of the\n\t    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n\t    .map(function (source) {\n\t      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n\t        ? util.relative(sourceRoot, source)\n\t        : source;\n\t    });\n\t\n\t  // Pass `true` below to allow duplicate names and sources. While source maps\n\t  // are intended to be compressed and deduplicated, the TypeScript compiler\n\t  // sometimes generates source maps with duplicates in them. See Github issue\n\t  // #72 and bugzil.la/889492.\n\t  this._names = ArraySet.fromArray(names.map(String), true);\n\t  this._sources = ArraySet.fromArray(sources, true);\n\t\n\t  this._absoluteSources = this._sources.toArray().map(function (s) {\n\t    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n\t  });\n\t\n\t  this.sourceRoot = sourceRoot;\n\t  this.sourcesContent = sourcesContent;\n\t  this._mappings = mappings;\n\t  this._sourceMapURL = aSourceMapURL;\n\t  this.file = file;\n\t}\n\t\n\tBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\n\tBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\t\n\t/**\n\t * Utility function to find the index of a source.  Returns -1 if not\n\t * found.\n\t */\n\tBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n\t  var relativeSource = aSource;\n\t  if (this.sourceRoot != null) {\n\t    relativeSource = util.relative(this.sourceRoot, relativeSource);\n\t  }\n\t\n\t  if (this._sources.has(relativeSource)) {\n\t    return this._sources.indexOf(relativeSource);\n\t  }\n\t\n\t  // Maybe aSource is an absolute URL as returned by |sources|.  In\n\t  // this case we can't simply undo the transform.\n\t  var i;\n\t  for (i = 0; i < this._absoluteSources.length; ++i) {\n\t    if (this._absoluteSources[i] == aSource) {\n\t      return i;\n\t    }\n\t  }\n\t\n\t  return -1;\n\t};\n\t\n\t/**\n\t * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n\t *\n\t * @param SourceMapGenerator aSourceMap\n\t *        The source map that will be consumed.\n\t * @param String aSourceMapURL\n\t *        The URL at which the source map can be found (optional)\n\t * @returns BasicSourceMapConsumer\n\t */\n\tBasicSourceMapConsumer.fromSourceMap =\n\t  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n\t    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\t\n\t    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n\t    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n\t    smc.sourceRoot = aSourceMap._sourceRoot;\n\t    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n\t                                                            smc.sourceRoot);\n\t    smc.file = aSourceMap._file;\n\t    smc._sourceMapURL = aSourceMapURL;\n\t    smc._absoluteSources = smc._sources.toArray().map(function (s) {\n\t      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n\t    });\n\t\n\t    // Because we are modifying the entries (by converting string sources and\n\t    // names to indices into the sources and names ArraySets), we have to make\n\t    // a copy of the entry or else bad things happen. Shared mutable state\n\t    // strikes again! See github issue #191.\n\t\n\t    var generatedMappings = aSourceMap._mappings.toArray().slice();\n\t    var destGeneratedMappings = smc.__generatedMappings = [];\n\t    var destOriginalMappings = smc.__originalMappings = [];\n\t\n\t    for (var i = 0, length = generatedMappings.length; i < length; i++) {\n\t      var srcMapping = generatedMappings[i];\n\t      var destMapping = new Mapping;\n\t      destMapping.generatedLine = srcMapping.generatedLine;\n\t      destMapping.generatedColumn = srcMapping.generatedColumn;\n\t\n\t      if (srcMapping.source) {\n\t        destMapping.source = sources.indexOf(srcMapping.source);\n\t        destMapping.originalLine = srcMapping.originalLine;\n\t        destMapping.originalColumn = srcMapping.originalColumn;\n\t\n\t        if (srcMapping.name) {\n\t          destMapping.name = names.indexOf(srcMapping.name);\n\t        }\n\t\n\t        destOriginalMappings.push(destMapping);\n\t      }\n\t\n\t      destGeneratedMappings.push(destMapping);\n\t    }\n\t\n\t    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\t\n\t    return smc;\n\t  };\n\t\n\t/**\n\t * The version of the source mapping spec that we are consuming.\n\t */\n\tBasicSourceMapConsumer.prototype._version = 3;\n\t\n\t/**\n\t * The list of original sources.\n\t */\n\tObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n\t  get: function () {\n\t    return this._absoluteSources.slice();\n\t  }\n\t});\n\t\n\t/**\n\t * Provide the JIT with a nice shape / hidden class.\n\t */\n\tfunction Mapping() {\n\t  this.generatedLine = 0;\n\t  this.generatedColumn = 0;\n\t  this.source = null;\n\t  this.originalLine = null;\n\t  this.originalColumn = null;\n\t  this.name = null;\n\t}\n\t\n\t/**\n\t * Parse the mappings in a string in to a data structure which we can easily\n\t * query (the ordered arrays in the `this.__generatedMappings` and\n\t * `this.__originalMappings` properties).\n\t */\n\tBasicSourceMapConsumer.prototype._parseMappings =\n\t  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n\t    var generatedLine = 1;\n\t    var previousGeneratedColumn = 0;\n\t    var previousOriginalLine = 0;\n\t    var previousOriginalColumn = 0;\n\t    var previousSource = 0;\n\t    var previousName = 0;\n\t    var length = aStr.length;\n\t    var index = 0;\n\t    var cachedSegments = {};\n\t    var temp = {};\n\t    var originalMappings = [];\n\t    var generatedMappings = [];\n\t    var mapping, str, segment, end, value;\n\t\n\t    while (index < length) {\n\t      if (aStr.charAt(index) === ';') {\n\t        generatedLine++;\n\t        index++;\n\t        previousGeneratedColumn = 0;\n\t      }\n\t      else if (aStr.charAt(index) === ',') {\n\t        index++;\n\t      }\n\t      else {\n\t        mapping = new Mapping();\n\t        mapping.generatedLine = generatedLine;\n\t\n\t        // Because each offset is encoded relative to the previous one,\n\t        // many segments often have the same encoding. We can exploit this\n\t        // fact by caching the parsed variable length fields of each segment,\n\t        // allowing us to avoid a second parse if we encounter the same\n\t        // segment again.\n\t        for (end = index; end < length; end++) {\n\t          if (this._charIsMappingSeparator(aStr, end)) {\n\t            break;\n\t          }\n\t        }\n\t        str = aStr.slice(index, end);\n\t\n\t        segment = cachedSegments[str];\n\t        if (segment) {\n\t          index += str.length;\n\t        } else {\n\t          segment = [];\n\t          while (index < end) {\n\t            base64VLQ.decode(aStr, index, temp);\n\t            value = temp.value;\n\t            index = temp.rest;\n\t            segment.push(value);\n\t          }\n\t\n\t          if (segment.length === 2) {\n\t            throw new Error('Found a source, but no line and column');\n\t          }\n\t\n\t          if (segment.length === 3) {\n\t            throw new Error('Found a source and line, but no column');\n\t          }\n\t\n\t          cachedSegments[str] = segment;\n\t        }\n\t\n\t        // Generated column.\n\t        mapping.generatedColumn = previousGeneratedColumn + segment[0];\n\t        previousGeneratedColumn = mapping.generatedColumn;\n\t\n\t        if (segment.length > 1) {\n\t          // Original source.\n\t          mapping.source = previousSource + segment[1];\n\t          previousSource += segment[1];\n\t\n\t          // Original line.\n\t          mapping.originalLine = previousOriginalLine + segment[2];\n\t          previousOriginalLine = mapping.originalLine;\n\t          // Lines are stored 0-based\n\t          mapping.originalLine += 1;\n\t\n\t          // Original column.\n\t          mapping.originalColumn = previousOriginalColumn + segment[3];\n\t          previousOriginalColumn = mapping.originalColumn;\n\t\n\t          if (segment.length > 4) {\n\t            // Original name.\n\t            mapping.name = previousName + segment[4];\n\t            previousName += segment[4];\n\t          }\n\t        }\n\t\n\t        generatedMappings.push(mapping);\n\t        if (typeof mapping.originalLine === 'number') {\n\t          originalMappings.push(mapping);\n\t        }\n\t      }\n\t    }\n\t\n\t    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n\t    this.__generatedMappings = generatedMappings;\n\t\n\t    quickSort(originalMappings, util.compareByOriginalPositions);\n\t    this.__originalMappings = originalMappings;\n\t  };\n\t\n\t/**\n\t * Find the mapping that best matches the hypothetical \"needle\" mapping that\n\t * we are searching for in the given \"haystack\" of mappings.\n\t */\n\tBasicSourceMapConsumer.prototype._findMapping =\n\t  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n\t                                         aColumnName, aComparator, aBias) {\n\t    // To return the position we are searching for, we must first find the\n\t    // mapping for the given position and then return the opposite position it\n\t    // points to. Because the mappings are sorted, we can use binary search to\n\t    // find the best mapping.\n\t\n\t    if (aNeedle[aLineName] <= 0) {\n\t      throw new TypeError('Line must be greater than or equal to 1, got '\n\t                          + aNeedle[aLineName]);\n\t    }\n\t    if (aNeedle[aColumnName] < 0) {\n\t      throw new TypeError('Column must be greater than or equal to 0, got '\n\t                          + aNeedle[aColumnName]);\n\t    }\n\t\n\t    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n\t  };\n\t\n\t/**\n\t * Compute the last column for each generated mapping. The last column is\n\t * inclusive.\n\t */\n\tBasicSourceMapConsumer.prototype.computeColumnSpans =\n\t  function SourceMapConsumer_computeColumnSpans() {\n\t    for (var index = 0; index < this._generatedMappings.length; ++index) {\n\t      var mapping = this._generatedMappings[index];\n\t\n\t      // Mappings do not contain a field for the last generated columnt. We\n\t      // can come up with an optimistic estimate, however, by assuming that\n\t      // mappings are contiguous (i.e. given two consecutive mappings, the\n\t      // first mapping ends where the second one starts).\n\t      if (index + 1 < this._generatedMappings.length) {\n\t        var nextMapping = this._generatedMappings[index + 1];\n\t\n\t        if (mapping.generatedLine === nextMapping.generatedLine) {\n\t          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n\t          continue;\n\t        }\n\t      }\n\t\n\t      // The last mapping for each line spans the entire line.\n\t      mapping.lastGeneratedColumn = Infinity;\n\t    }\n\t  };\n\t\n\t/**\n\t * Returns the original source, line, and column information for the generated\n\t * source's line and column positions provided. The only argument is an object\n\t * with the following properties:\n\t *\n\t *   - line: The line number in the generated source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the generated source.  The column\n\t *     number is 0-based.\n\t *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n\t *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - source: The original source file, or null.\n\t *   - line: The line number in the original source, or null.  The\n\t *     line number is 1-based.\n\t *   - column: The column number in the original source, or null.  The\n\t *     column number is 0-based.\n\t *   - name: The original identifier, or null.\n\t */\n\tBasicSourceMapConsumer.prototype.originalPositionFor =\n\t  function SourceMapConsumer_originalPositionFor(aArgs) {\n\t    var needle = {\n\t      generatedLine: util.getArg(aArgs, 'line'),\n\t      generatedColumn: util.getArg(aArgs, 'column')\n\t    };\n\t\n\t    var index = this._findMapping(\n\t      needle,\n\t      this._generatedMappings,\n\t      \"generatedLine\",\n\t      \"generatedColumn\",\n\t      util.compareByGeneratedPositionsDeflated,\n\t      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n\t    );\n\t\n\t    if (index >= 0) {\n\t      var mapping = this._generatedMappings[index];\n\t\n\t      if (mapping.generatedLine === needle.generatedLine) {\n\t        var source = util.getArg(mapping, 'source', null);\n\t        if (source !== null) {\n\t          source = this._sources.at(source);\n\t          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n\t        }\n\t        var name = util.getArg(mapping, 'name', null);\n\t        if (name !== null) {\n\t          name = this._names.at(name);\n\t        }\n\t        return {\n\t          source: source,\n\t          line: util.getArg(mapping, 'originalLine', null),\n\t          column: util.getArg(mapping, 'originalColumn', null),\n\t          name: name\n\t        };\n\t      }\n\t    }\n\t\n\t    return {\n\t      source: null,\n\t      line: null,\n\t      column: null,\n\t      name: null\n\t    };\n\t  };\n\t\n\t/**\n\t * Return true if we have the source content for every source in the source\n\t * map, false otherwise.\n\t */\n\tBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n\t  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n\t    if (!this.sourcesContent) {\n\t      return false;\n\t    }\n\t    return this.sourcesContent.length >= this._sources.size() &&\n\t      !this.sourcesContent.some(function (sc) { return sc == null; });\n\t  };\n\t\n\t/**\n\t * Returns the original source content. The only argument is the url of the\n\t * original source file. Returns null if no original source content is\n\t * available.\n\t */\n\tBasicSourceMapConsumer.prototype.sourceContentFor =\n\t  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n\t    if (!this.sourcesContent) {\n\t      return null;\n\t    }\n\t\n\t    var index = this._findSourceIndex(aSource);\n\t    if (index >= 0) {\n\t      return this.sourcesContent[index];\n\t    }\n\t\n\t    var relativeSource = aSource;\n\t    if (this.sourceRoot != null) {\n\t      relativeSource = util.relative(this.sourceRoot, relativeSource);\n\t    }\n\t\n\t    var url;\n\t    if (this.sourceRoot != null\n\t        && (url = util.urlParse(this.sourceRoot))) {\n\t      // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n\t      // many users. We can help them out when they expect file:// URIs to\n\t      // behave like it would if they were running a local HTTP server. See\n\t      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n\t      var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n\t      if (url.scheme == \"file\"\n\t          && this._sources.has(fileUriAbsPath)) {\n\t        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n\t      }\n\t\n\t      if ((!url.path || url.path == \"/\")\n\t          && this._sources.has(\"/\" + relativeSource)) {\n\t        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n\t      }\n\t    }\n\t\n\t    // This function is used recursively from\n\t    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n\t    // don't want to throw if we can't find the source - we just want to\n\t    // return null, so we provide a flag to exit gracefully.\n\t    if (nullOnMissing) {\n\t      return null;\n\t    }\n\t    else {\n\t      throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n\t    }\n\t  };\n\t\n\t/**\n\t * Returns the generated line and column information for the original source,\n\t * line, and column positions provided. The only argument is an object with\n\t * the following properties:\n\t *\n\t *   - source: The filename of the original source.\n\t *   - line: The line number in the original source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the original source.  The column\n\t *     number is 0-based.\n\t *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n\t *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - line: The line number in the generated source, or null.  The\n\t *     line number is 1-based.\n\t *   - column: The column number in the generated source, or null.\n\t *     The column number is 0-based.\n\t */\n\tBasicSourceMapConsumer.prototype.generatedPositionFor =\n\t  function SourceMapConsumer_generatedPositionFor(aArgs) {\n\t    var source = util.getArg(aArgs, 'source');\n\t    source = this._findSourceIndex(source);\n\t    if (source < 0) {\n\t      return {\n\t        line: null,\n\t        column: null,\n\t        lastColumn: null\n\t      };\n\t    }\n\t\n\t    var needle = {\n\t      source: source,\n\t      originalLine: util.getArg(aArgs, 'line'),\n\t      originalColumn: util.getArg(aArgs, 'column')\n\t    };\n\t\n\t    var index = this._findMapping(\n\t      needle,\n\t      this._originalMappings,\n\t      \"originalLine\",\n\t      \"originalColumn\",\n\t      util.compareByOriginalPositions,\n\t      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n\t    );\n\t\n\t    if (index >= 0) {\n\t      var mapping = this._originalMappings[index];\n\t\n\t      if (mapping.source === needle.source) {\n\t        return {\n\t          line: util.getArg(mapping, 'generatedLine', null),\n\t          column: util.getArg(mapping, 'generatedColumn', null),\n\t          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n\t        };\n\t      }\n\t    }\n\t\n\t    return {\n\t      line: null,\n\t      column: null,\n\t      lastColumn: null\n\t    };\n\t  };\n\t\n\texports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\t\n\t/**\n\t * An IndexedSourceMapConsumer instance represents a parsed source map which\n\t * we can query for information. It differs from BasicSourceMapConsumer in\n\t * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n\t * input.\n\t *\n\t * The first parameter is a raw source map (either as a JSON string, or already\n\t * parsed to an object). According to the spec for indexed source maps, they\n\t * have the following attributes:\n\t *\n\t *   - version: Which version of the source map spec this map is following.\n\t *   - file: Optional. The generated file this source map is associated with.\n\t *   - sections: A list of section definitions.\n\t *\n\t * Each value under the \"sections\" field has two fields:\n\t *   - offset: The offset into the original specified at which this section\n\t *       begins to apply, defined as an object with a \"line\" and \"column\"\n\t *       field.\n\t *   - map: A source map definition. This source map could also be indexed,\n\t *       but doesn't have to be.\n\t *\n\t * Instead of the \"map\" field, it's also possible to have a \"url\" field\n\t * specifying a URL to retrieve a source map from, but that's currently\n\t * unsupported.\n\t *\n\t * Here's an example source map, taken from the source map spec[0], but\n\t * modified to omit a section which uses the \"url\" field.\n\t *\n\t *  {\n\t *    version : 3,\n\t *    file: \"app.js\",\n\t *    sections: [{\n\t *      offset: {line:100, column:10},\n\t *      map: {\n\t *        version : 3,\n\t *        file: \"section.js\",\n\t *        sources: [\"foo.js\", \"bar.js\"],\n\t *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n\t *        mappings: \"AAAA,E;;ABCDE;\"\n\t *      }\n\t *    }],\n\t *  }\n\t *\n\t * The second parameter, if given, is a string whose value is the URL\n\t * at which the source map was found.  This URL is used to compute the\n\t * sources array.\n\t *\n\t * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n\t */\n\tfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n\t  var sourceMap = aSourceMap;\n\t  if (typeof aSourceMap === 'string') {\n\t    sourceMap = util.parseSourceMapInput(aSourceMap);\n\t  }\n\t\n\t  var version = util.getArg(sourceMap, 'version');\n\t  var sections = util.getArg(sourceMap, 'sections');\n\t\n\t  if (version != this._version) {\n\t    throw new Error('Unsupported version: ' + version);\n\t  }\n\t\n\t  this._sources = new ArraySet();\n\t  this._names = new ArraySet();\n\t\n\t  var lastOffset = {\n\t    line: -1,\n\t    column: 0\n\t  };\n\t  this._sections = sections.map(function (s) {\n\t    if (s.url) {\n\t      // The url field will require support for asynchronicity.\n\t      // See https://github.com/mozilla/source-map/issues/16\n\t      throw new Error('Support for url field in sections not implemented.');\n\t    }\n\t    var offset = util.getArg(s, 'offset');\n\t    var offsetLine = util.getArg(offset, 'line');\n\t    var offsetColumn = util.getArg(offset, 'column');\n\t\n\t    if (offsetLine < lastOffset.line ||\n\t        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n\t      throw new Error('Section offsets must be ordered and non-overlapping.');\n\t    }\n\t    lastOffset = offset;\n\t\n\t    return {\n\t      generatedOffset: {\n\t        // The offset fields are 0-based, but we use 1-based indices when\n\t        // encoding/decoding from VLQ.\n\t        generatedLine: offsetLine + 1,\n\t        generatedColumn: offsetColumn + 1\n\t      },\n\t      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n\t    }\n\t  });\n\t}\n\t\n\tIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\n\tIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\t\n\t/**\n\t * The version of the source mapping spec that we are consuming.\n\t */\n\tIndexedSourceMapConsumer.prototype._version = 3;\n\t\n\t/**\n\t * The list of original sources.\n\t */\n\tObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n\t  get: function () {\n\t    var sources = [];\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n\t        sources.push(this._sections[i].consumer.sources[j]);\n\t      }\n\t    }\n\t    return sources;\n\t  }\n\t});\n\t\n\t/**\n\t * Returns the original source, line, and column information for the generated\n\t * source's line and column positions provided. The only argument is an object\n\t * with the following properties:\n\t *\n\t *   - line: The line number in the generated source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the generated source.  The column\n\t *     number is 0-based.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - source: The original source file, or null.\n\t *   - line: The line number in the original source, or null.  The\n\t *     line number is 1-based.\n\t *   - column: The column number in the original source, or null.  The\n\t *     column number is 0-based.\n\t *   - name: The original identifier, or null.\n\t */\n\tIndexedSourceMapConsumer.prototype.originalPositionFor =\n\t  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n\t    var needle = {\n\t      generatedLine: util.getArg(aArgs, 'line'),\n\t      generatedColumn: util.getArg(aArgs, 'column')\n\t    };\n\t\n\t    // Find the section containing the generated position we're trying to map\n\t    // to an original position.\n\t    var sectionIndex = binarySearch.search(needle, this._sections,\n\t      function(needle, section) {\n\t        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n\t        if (cmp) {\n\t          return cmp;\n\t        }\n\t\n\t        return (needle.generatedColumn -\n\t                section.generatedOffset.generatedColumn);\n\t      });\n\t    var section = this._sections[sectionIndex];\n\t\n\t    if (!section) {\n\t      return {\n\t        source: null,\n\t        line: null,\n\t        column: null,\n\t        name: null\n\t      };\n\t    }\n\t\n\t    return section.consumer.originalPositionFor({\n\t      line: needle.generatedLine -\n\t        (section.generatedOffset.generatedLine - 1),\n\t      column: needle.generatedColumn -\n\t        (section.generatedOffset.generatedLine === needle.generatedLine\n\t         ? section.generatedOffset.generatedColumn - 1\n\t         : 0),\n\t      bias: aArgs.bias\n\t    });\n\t  };\n\t\n\t/**\n\t * Return true if we have the source content for every source in the source\n\t * map, false otherwise.\n\t */\n\tIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n\t  function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n\t    return this._sections.every(function (s) {\n\t      return s.consumer.hasContentsOfAllSources();\n\t    });\n\t  };\n\t\n\t/**\n\t * Returns the original source content. The only argument is the url of the\n\t * original source file. Returns null if no original source content is\n\t * available.\n\t */\n\tIndexedSourceMapConsumer.prototype.sourceContentFor =\n\t  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      var section = this._sections[i];\n\t\n\t      var content = section.consumer.sourceContentFor(aSource, true);\n\t      if (content) {\n\t        return content;\n\t      }\n\t    }\n\t    if (nullOnMissing) {\n\t      return null;\n\t    }\n\t    else {\n\t      throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n\t    }\n\t  };\n\t\n\t/**\n\t * Returns the generated line and column information for the original source,\n\t * line, and column positions provided. The only argument is an object with\n\t * the following properties:\n\t *\n\t *   - source: The filename of the original source.\n\t *   - line: The line number in the original source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the original source.  The column\n\t *     number is 0-based.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - line: The line number in the generated source, or null.  The\n\t *     line number is 1-based. \n\t *   - column: The column number in the generated source, or null.\n\t *     The column number is 0-based.\n\t */\n\tIndexedSourceMapConsumer.prototype.generatedPositionFor =\n\t  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      var section = this._sections[i];\n\t\n\t      // Only consider this section if the requested source is in the list of\n\t      // sources of the consumer.\n\t      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n\t        continue;\n\t      }\n\t      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n\t      if (generatedPosition) {\n\t        var ret = {\n\t          line: generatedPosition.line +\n\t            (section.generatedOffset.generatedLine - 1),\n\t          column: generatedPosition.column +\n\t            (section.generatedOffset.generatedLine === generatedPosition.line\n\t             ? section.generatedOffset.generatedColumn - 1\n\t             : 0)\n\t        };\n\t        return ret;\n\t      }\n\t    }\n\t\n\t    return {\n\t      line: null,\n\t      column: null\n\t    };\n\t  };\n\t\n\t/**\n\t * Parse the mappings in a string in to a data structure which we can easily\n\t * query (the ordered arrays in the `this.__generatedMappings` and\n\t * `this.__originalMappings` properties).\n\t */\n\tIndexedSourceMapConsumer.prototype._parseMappings =\n\t  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n\t    this.__generatedMappings = [];\n\t    this.__originalMappings = [];\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      var section = this._sections[i];\n\t      var sectionMappings = section.consumer._generatedMappings;\n\t      for (var j = 0; j < sectionMappings.length; j++) {\n\t        var mapping = sectionMappings[j];\n\t\n\t        var source = section.consumer._sources.at(mapping.source);\n\t        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n\t        this._sources.add(source);\n\t        source = this._sources.indexOf(source);\n\t\n\t        var name = null;\n\t        if (mapping.name) {\n\t          name = section.consumer._names.at(mapping.name);\n\t          this._names.add(name);\n\t          name = this._names.indexOf(name);\n\t        }\n\t\n\t        // The mappings coming from the consumer for the section have\n\t        // generated positions relative to the start of the section, so we\n\t        // need to offset them to be relative to the start of the concatenated\n\t        // generated file.\n\t        var adjustedMapping = {\n\t          source: source,\n\t          generatedLine: mapping.generatedLine +\n\t            (section.generatedOffset.generatedLine - 1),\n\t          generatedColumn: mapping.generatedColumn +\n\t            (section.generatedOffset.generatedLine === mapping.generatedLine\n\t            ? section.generatedOffset.generatedColumn - 1\n\t            : 0),\n\t          originalLine: mapping.originalLine,\n\t          originalColumn: mapping.originalColumn,\n\t          name: name\n\t        };\n\t\n\t        this.__generatedMappings.push(adjustedMapping);\n\t        if (typeof adjustedMapping.originalLine === 'number') {\n\t          this.__originalMappings.push(adjustedMapping);\n\t        }\n\t      }\n\t    }\n\t\n\t    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n\t    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n\t  };\n\t\n\texports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n/***/ }),\n/* 8 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\texports.GREATEST_LOWER_BOUND = 1;\n\texports.LEAST_UPPER_BOUND = 2;\n\t\n\t/**\n\t * Recursive implementation of binary search.\n\t *\n\t * @param aLow Indices here and lower do not contain the needle.\n\t * @param aHigh Indices here and higher do not contain the needle.\n\t * @param aNeedle The element being searched for.\n\t * @param aHaystack The non-empty array being searched.\n\t * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n\t * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n\t *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t */\n\tfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n\t  // This function terminates when one of the following is true:\n\t  //\n\t  //   1. We find the exact element we are looking for.\n\t  //\n\t  //   2. We did not find the exact element, but we can return the index of\n\t  //      the next-closest element.\n\t  //\n\t  //   3. We did not find the exact element, and there is no next-closest\n\t  //      element than the one we are searching for, so we return -1.\n\t  var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n\t  var cmp = aCompare(aNeedle, aHaystack[mid], true);\n\t  if (cmp === 0) {\n\t    // Found the element we are looking for.\n\t    return mid;\n\t  }\n\t  else if (cmp > 0) {\n\t    // Our needle is greater than aHaystack[mid].\n\t    if (aHigh - mid > 1) {\n\t      // The element is in the upper half.\n\t      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n\t    }\n\t\n\t    // The exact needle element was not found in this haystack. Determine if\n\t    // we are in termination case (3) or (2) and return the appropriate thing.\n\t    if (aBias == exports.LEAST_UPPER_BOUND) {\n\t      return aHigh < aHaystack.length ? aHigh : -1;\n\t    } else {\n\t      return mid;\n\t    }\n\t  }\n\t  else {\n\t    // Our needle is less than aHaystack[mid].\n\t    if (mid - aLow > 1) {\n\t      // The element is in the lower half.\n\t      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n\t    }\n\t\n\t    // we are in termination case (3) or (2) and return the appropriate thing.\n\t    if (aBias == exports.LEAST_UPPER_BOUND) {\n\t      return mid;\n\t    } else {\n\t      return aLow < 0 ? -1 : aLow;\n\t    }\n\t  }\n\t}\n\t\n\t/**\n\t * This is an implementation of binary search which will always try and return\n\t * the index of the closest element if there is no exact hit. This is because\n\t * mappings between original and generated line/col pairs are single points,\n\t * and there is an implicit region between each of them, so a miss just means\n\t * that you aren't on the very start of a region.\n\t *\n\t * @param aNeedle The element you are looking for.\n\t * @param aHaystack The array that is being searched.\n\t * @param aCompare A function which takes the needle and an element in the\n\t *     array and returns -1, 0, or 1 depending on whether the needle is less\n\t *     than, equal to, or greater than the element, respectively.\n\t * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n\t *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n\t */\n\texports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n\t  if (aHaystack.length === 0) {\n\t    return -1;\n\t  }\n\t\n\t  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n\t                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n\t  if (index < 0) {\n\t    return -1;\n\t  }\n\t\n\t  // We have found either the exact element, or the next-closest element than\n\t  // the one we are searching for. However, there may be more than one such\n\t  // element. Make sure we always return the smallest of these.\n\t  while (index - 1 >= 0) {\n\t    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n\t      break;\n\t    }\n\t    --index;\n\t  }\n\t\n\t  return index;\n\t};\n\n\n/***/ }),\n/* 9 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\t// It turns out that some (most?) JavaScript engines don't self-host\n\t// `Array.prototype.sort`. This makes sense because C++ will likely remain\n\t// faster than JS when doing raw CPU-intensive sorting. However, when using a\n\t// custom comparator function, calling back and forth between the VM's C++ and\n\t// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n\t// worse generated code for the comparator function than would be optimal. In\n\t// fact, when sorting with a comparator, these costs outweigh the benefits of\n\t// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n\t// a ~3500ms mean speed-up in `bench/bench.html`.\n\t\n\t/**\n\t * Swap the elements indexed by `x` and `y` in the array `ary`.\n\t *\n\t * @param {Array} ary\n\t *        The array.\n\t * @param {Number} x\n\t *        The index of the first item.\n\t * @param {Number} y\n\t *        The index of the second item.\n\t */\n\tfunction swap(ary, x, y) {\n\t  var temp = ary[x];\n\t  ary[x] = ary[y];\n\t  ary[y] = temp;\n\t}\n\t\n\t/**\n\t * Returns a random integer within the range `low .. high` inclusive.\n\t *\n\t * @param {Number} low\n\t *        The lower bound on the range.\n\t * @param {Number} high\n\t *        The upper bound on the range.\n\t */\n\tfunction randomIntInRange(low, high) {\n\t  return Math.round(low + (Math.random() * (high - low)));\n\t}\n\t\n\t/**\n\t * The Quick Sort algorithm.\n\t *\n\t * @param {Array} ary\n\t *        An array to sort.\n\t * @param {function} comparator\n\t *        Function to use to compare two items.\n\t * @param {Number} p\n\t *        Start index of the array\n\t * @param {Number} r\n\t *        End index of the array\n\t */\n\tfunction doQuickSort(ary, comparator, p, r) {\n\t  // If our lower bound is less than our upper bound, we (1) partition the\n\t  // array into two pieces and (2) recurse on each half. If it is not, this is\n\t  // the empty array and our base case.\n\t\n\t  if (p < r) {\n\t    // (1) Partitioning.\n\t    //\n\t    // The partitioning chooses a pivot between `p` and `r` and moves all\n\t    // elements that are less than or equal to the pivot to the before it, and\n\t    // all the elements that are greater than it after it. The effect is that\n\t    // once partition is done, the pivot is in the exact place it will be when\n\t    // the array is put in sorted order, and it will not need to be moved\n\t    // again. This runs in O(n) time.\n\t\n\t    // Always choose a random pivot so that an input array which is reverse\n\t    // sorted does not cause O(n^2) running time.\n\t    var pivotIndex = randomIntInRange(p, r);\n\t    var i = p - 1;\n\t\n\t    swap(ary, pivotIndex, r);\n\t    var pivot = ary[r];\n\t\n\t    // Immediately after `j` is incremented in this loop, the following hold\n\t    // true:\n\t    //\n\t    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.\n\t    //\n\t    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n\t    for (var j = p; j < r; j++) {\n\t      if (comparator(ary[j], pivot) <= 0) {\n\t        i += 1;\n\t        swap(ary, i, j);\n\t      }\n\t    }\n\t\n\t    swap(ary, i + 1, j);\n\t    var q = i + 1;\n\t\n\t    // (2) Recurse on each half.\n\t\n\t    doQuickSort(ary, comparator, p, q - 1);\n\t    doQuickSort(ary, comparator, q + 1, r);\n\t  }\n\t}\n\t\n\t/**\n\t * Sort the given array in-place with the given comparator function.\n\t *\n\t * @param {Array} ary\n\t *        An array to sort.\n\t * @param {function} comparator\n\t *        Function to use to compare two items.\n\t */\n\texports.quickSort = function (ary, comparator) {\n\t  doQuickSort(ary, comparator, 0, ary.length - 1);\n\t};\n\n\n/***/ }),\n/* 10 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;\n\tvar util = __webpack_require__(4);\n\t\n\t// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n\t// operating systems these days (capturing the result).\n\tvar REGEX_NEWLINE = /(\\r?\\n)/;\n\t\n\t// Newline character code for charCodeAt() comparisons\n\tvar NEWLINE_CODE = 10;\n\t\n\t// Private symbol for identifying `SourceNode`s when multiple versions of\n\t// the source-map library are loaded. This MUST NOT CHANGE across\n\t// versions!\n\tvar isSourceNode = \"$$$isSourceNode$$$\";\n\t\n\t/**\n\t * SourceNodes provide a way to abstract over interpolating/concatenating\n\t * snippets of generated JavaScript source code while maintaining the line and\n\t * column information associated with the original source code.\n\t *\n\t * @param aLine The original line number.\n\t * @param aColumn The original column number.\n\t * @param aSource The original source's filename.\n\t * @param aChunks Optional. An array of strings which are snippets of\n\t *        generated JS, or other SourceNodes.\n\t * @param aName The original identifier.\n\t */\n\tfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n\t  this.children = [];\n\t  this.sourceContents = {};\n\t  this.line = aLine == null ? null : aLine;\n\t  this.column = aColumn == null ? null : aColumn;\n\t  this.source = aSource == null ? null : aSource;\n\t  this.name = aName == null ? null : aName;\n\t  this[isSourceNode] = true;\n\t  if (aChunks != null) this.add(aChunks);\n\t}\n\t\n\t/**\n\t * Creates a SourceNode from generated code and a SourceMapConsumer.\n\t *\n\t * @param aGeneratedCode The generated code\n\t * @param aSourceMapConsumer The SourceMap for the generated code\n\t * @param aRelativePath Optional. The path that relative sources in the\n\t *        SourceMapConsumer should be relative to.\n\t */\n\tSourceNode.fromStringWithSourceMap =\n\t  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n\t    // The SourceNode we want to fill with the generated code\n\t    // and the SourceMap\n\t    var node = new SourceNode();\n\t\n\t    // All even indices of this array are one line of the generated code,\n\t    // while all odd indices are the newlines between two adjacent lines\n\t    // (since `REGEX_NEWLINE` captures its match).\n\t    // Processed fragments are accessed by calling `shiftNextLine`.\n\t    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n\t    var remainingLinesIndex = 0;\n\t    var shiftNextLine = function() {\n\t      var lineContents = getNextLine();\n\t      // The last line of a file might not have a newline.\n\t      var newLine = getNextLine() || \"\";\n\t      return lineContents + newLine;\n\t\n\t      function getNextLine() {\n\t        return remainingLinesIndex < remainingLines.length ?\n\t            remainingLines[remainingLinesIndex++] : undefined;\n\t      }\n\t    };\n\t\n\t    // We need to remember the position of \"remainingLines\"\n\t    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\t\n\t    // The generate SourceNodes we need a code range.\n\t    // To extract it current and last mapping is used.\n\t    // Here we store the last mapping.\n\t    var lastMapping = null;\n\t\n\t    aSourceMapConsumer.eachMapping(function (mapping) {\n\t      if (lastMapping !== null) {\n\t        // We add the code from \"lastMapping\" to \"mapping\":\n\t        // First check if there is a new line in between.\n\t        if (lastGeneratedLine < mapping.generatedLine) {\n\t          // Associate first line with \"lastMapping\"\n\t          addMappingWithCode(lastMapping, shiftNextLine());\n\t          lastGeneratedLine++;\n\t          lastGeneratedColumn = 0;\n\t          // The remaining code is added without mapping\n\t        } else {\n\t          // There is no new line in between.\n\t          // Associate the code between \"lastGeneratedColumn\" and\n\t          // \"mapping.generatedColumn\" with \"lastMapping\"\n\t          var nextLine = remainingLines[remainingLinesIndex] || '';\n\t          var code = nextLine.substr(0, mapping.generatedColumn -\n\t                                        lastGeneratedColumn);\n\t          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n\t                                              lastGeneratedColumn);\n\t          lastGeneratedColumn = mapping.generatedColumn;\n\t          addMappingWithCode(lastMapping, code);\n\t          // No more remaining code, continue\n\t          lastMapping = mapping;\n\t          return;\n\t        }\n\t      }\n\t      // We add the generated code until the first mapping\n\t      // to the SourceNode without any mapping.\n\t      // Each line is added as separate string.\n\t      while (lastGeneratedLine < mapping.generatedLine) {\n\t        node.add(shiftNextLine());\n\t        lastGeneratedLine++;\n\t      }\n\t      if (lastGeneratedColumn < mapping.generatedColumn) {\n\t        var nextLine = remainingLines[remainingLinesIndex] || '';\n\t        node.add(nextLine.substr(0, mapping.generatedColumn));\n\t        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n\t        lastGeneratedColumn = mapping.generatedColumn;\n\t      }\n\t      lastMapping = mapping;\n\t    }, this);\n\t    // We have processed all mappings.\n\t    if (remainingLinesIndex < remainingLines.length) {\n\t      if (lastMapping) {\n\t        // Associate the remaining code in the current line with \"lastMapping\"\n\t        addMappingWithCode(lastMapping, shiftNextLine());\n\t      }\n\t      // and add the remaining lines without any mapping\n\t      node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n\t    }\n\t\n\t    // Copy sourcesContent into SourceNode\n\t    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n\t      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n\t      if (content != null) {\n\t        if (aRelativePath != null) {\n\t          sourceFile = util.join(aRelativePath, sourceFile);\n\t        }\n\t        node.setSourceContent(sourceFile, content);\n\t      }\n\t    });\n\t\n\t    return node;\n\t\n\t    function addMappingWithCode(mapping, code) {\n\t      if (mapping === null || mapping.source === undefined) {\n\t        node.add(code);\n\t      } else {\n\t        var source = aRelativePath\n\t          ? util.join(aRelativePath, mapping.source)\n\t          : mapping.source;\n\t        node.add(new SourceNode(mapping.originalLine,\n\t                                mapping.originalColumn,\n\t                                source,\n\t                                code,\n\t                                mapping.name));\n\t      }\n\t    }\n\t  };\n\t\n\t/**\n\t * Add a chunk of generated JS to this source node.\n\t *\n\t * @param aChunk A string snippet of generated JS code, another instance of\n\t *        SourceNode, or an array where each member is one of those things.\n\t */\n\tSourceNode.prototype.add = function SourceNode_add(aChunk) {\n\t  if (Array.isArray(aChunk)) {\n\t    aChunk.forEach(function (chunk) {\n\t      this.add(chunk);\n\t    }, this);\n\t  }\n\t  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n\t    if (aChunk) {\n\t      this.children.push(aChunk);\n\t    }\n\t  }\n\t  else {\n\t    throw new TypeError(\n\t      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n\t    );\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Add a chunk of generated JS to the beginning of this source node.\n\t *\n\t * @param aChunk A string snippet of generated JS code, another instance of\n\t *        SourceNode, or an array where each member is one of those things.\n\t */\n\tSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n\t  if (Array.isArray(aChunk)) {\n\t    for (var i = aChunk.length-1; i >= 0; i--) {\n\t      this.prepend(aChunk[i]);\n\t    }\n\t  }\n\t  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n\t    this.children.unshift(aChunk);\n\t  }\n\t  else {\n\t    throw new TypeError(\n\t      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n\t    );\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Walk over the tree of JS snippets in this node and its children. The\n\t * walking function is called once for each snippet of JS and is passed that\n\t * snippet and the its original associated source's line/column location.\n\t *\n\t * @param aFn The traversal function.\n\t */\n\tSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n\t  var chunk;\n\t  for (var i = 0, len = this.children.length; i < len; i++) {\n\t    chunk = this.children[i];\n\t    if (chunk[isSourceNode]) {\n\t      chunk.walk(aFn);\n\t    }\n\t    else {\n\t      if (chunk !== '') {\n\t        aFn(chunk, { source: this.source,\n\t                     line: this.line,\n\t                     column: this.column,\n\t                     name: this.name });\n\t      }\n\t    }\n\t  }\n\t};\n\t\n\t/**\n\t * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n\t * each of `this.children`.\n\t *\n\t * @param aSep The separator.\n\t */\n\tSourceNode.prototype.join = function SourceNode_join(aSep) {\n\t  var newChildren;\n\t  var i;\n\t  var len = this.children.length;\n\t  if (len > 0) {\n\t    newChildren = [];\n\t    for (i = 0; i < len-1; i++) {\n\t      newChildren.push(this.children[i]);\n\t      newChildren.push(aSep);\n\t    }\n\t    newChildren.push(this.children[i]);\n\t    this.children = newChildren;\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Call String.prototype.replace on the very right-most source snippet. Useful\n\t * for trimming whitespace from the end of a source node, etc.\n\t *\n\t * @param aPattern The pattern to replace.\n\t * @param aReplacement The thing to replace the pattern with.\n\t */\n\tSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n\t  var lastChild = this.children[this.children.length - 1];\n\t  if (lastChild[isSourceNode]) {\n\t    lastChild.replaceRight(aPattern, aReplacement);\n\t  }\n\t  else if (typeof lastChild === 'string') {\n\t    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n\t  }\n\t  else {\n\t    this.children.push(''.replace(aPattern, aReplacement));\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Set the source content for a source file. This will be added to the SourceMapGenerator\n\t * in the sourcesContent field.\n\t *\n\t * @param aSourceFile The filename of the source file\n\t * @param aSourceContent The content of the source file\n\t */\n\tSourceNode.prototype.setSourceContent =\n\t  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n\t    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n\t  };\n\t\n\t/**\n\t * Walk over the tree of SourceNodes. The walking function is called for each\n\t * source file content and is passed the filename and source content.\n\t *\n\t * @param aFn The traversal function.\n\t */\n\tSourceNode.prototype.walkSourceContents =\n\t  function SourceNode_walkSourceContents(aFn) {\n\t    for (var i = 0, len = this.children.length; i < len; i++) {\n\t      if (this.children[i][isSourceNode]) {\n\t        this.children[i].walkSourceContents(aFn);\n\t      }\n\t    }\n\t\n\t    var sources = Object.keys(this.sourceContents);\n\t    for (var i = 0, len = sources.length; i < len; i++) {\n\t      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n\t    }\n\t  };\n\t\n\t/**\n\t * Return the string representation of this source node. Walks over the tree\n\t * and concatenates all the various snippets together to one string.\n\t */\n\tSourceNode.prototype.toString = function SourceNode_toString() {\n\t  var str = \"\";\n\t  this.walk(function (chunk) {\n\t    str += chunk;\n\t  });\n\t  return str;\n\t};\n\t\n\t/**\n\t * Returns the string representation of this source node along with a source\n\t * map.\n\t */\n\tSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n\t  var generated = {\n\t    code: \"\",\n\t    line: 1,\n\t    column: 0\n\t  };\n\t  var map = new SourceMapGenerator(aArgs);\n\t  var sourceMappingActive = false;\n\t  var lastOriginalSource = null;\n\t  var lastOriginalLine = null;\n\t  var lastOriginalColumn = null;\n\t  var lastOriginalName = null;\n\t  this.walk(function (chunk, original) {\n\t    generated.code += chunk;\n\t    if (original.source !== null\n\t        && original.line !== null\n\t        && original.column !== null) {\n\t      if(lastOriginalSource !== original.source\n\t         || lastOriginalLine !== original.line\n\t         || lastOriginalColumn !== original.column\n\t         || lastOriginalName !== original.name) {\n\t        map.addMapping({\n\t          source: original.source,\n\t          original: {\n\t            line: original.line,\n\t            column: original.column\n\t          },\n\t          generated: {\n\t            line: generated.line,\n\t            column: generated.column\n\t          },\n\t          name: original.name\n\t        });\n\t      }\n\t      lastOriginalSource = original.source;\n\t      lastOriginalLine = original.line;\n\t      lastOriginalColumn = original.column;\n\t      lastOriginalName = original.name;\n\t      sourceMappingActive = true;\n\t    } else if (sourceMappingActive) {\n\t      map.addMapping({\n\t        generated: {\n\t          line: generated.line,\n\t          column: generated.column\n\t        }\n\t      });\n\t      lastOriginalSource = null;\n\t      sourceMappingActive = false;\n\t    }\n\t    for (var idx = 0, length = chunk.length; idx < length; idx++) {\n\t      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n\t        generated.line++;\n\t        generated.column = 0;\n\t        // Mappings end at eol\n\t        if (idx + 1 === length) {\n\t          lastOriginalSource = null;\n\t          sourceMappingActive = false;\n\t        } else if (sourceMappingActive) {\n\t          map.addMapping({\n\t            source: original.source,\n\t            original: {\n\t              line: original.line,\n\t              column: original.column\n\t            },\n\t            generated: {\n\t              line: generated.line,\n\t              column: generated.column\n\t            },\n\t            name: original.name\n\t          });\n\t        }\n\t      } else {\n\t        generated.column++;\n\t      }\n\t    }\n\t  });\n\t  this.walkSourceContents(function (sourceFile, sourceContent) {\n\t    map.setSourceContent(sourceFile, sourceContent);\n\t  });\n\t\n\t  return { code: generated.code, map: map };\n\t};\n\t\n\texports.SourceNode = SourceNode;\n\n\n/***/ })\n/******/ ])\n});\n;\n\n\n// WEBPACK FOOTER //\n// source-map.min.js"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId])\n \t\t\treturn installedModules[moduleId].exports;\n\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\texports: {},\n \t\t\tid: moduleId,\n \t\t\tloaded: false\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.loaded = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(0);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap 0fd5815da764db5fb9fe","/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./source-map.js\n// module id = 0\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n *   - file: The filename of the generated source.\n *   - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n  if (!aArgs) {\n    aArgs = {};\n  }\n  this._file = util.getArg(aArgs, 'file', null);\n  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n  this._mappings = new MappingList();\n  this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n    var sourceRoot = aSourceMapConsumer.sourceRoot;\n    var generator = new SourceMapGenerator({\n      file: aSourceMapConsumer.file,\n      sourceRoot: sourceRoot\n    });\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      var newMapping = {\n        generated: {\n          line: mapping.generatedLine,\n          column: mapping.generatedColumn\n        }\n      };\n\n      if (mapping.source != null) {\n        newMapping.source = mapping.source;\n        if (sourceRoot != null) {\n          newMapping.source = util.relative(sourceRoot, newMapping.source);\n        }\n\n        newMapping.original = {\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        };\n\n        if (mapping.name != null) {\n          newMapping.name = mapping.name;\n        }\n      }\n\n      generator.addMapping(newMapping);\n    });\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var sourceRelative = sourceFile;\n      if (sourceRoot !== null) {\n        sourceRelative = util.relative(sourceRoot, sourceFile);\n      }\n\n      if (!generator._sources.has(sourceRelative)) {\n        generator._sources.add(sourceRelative);\n      }\n\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        generator.setSourceContent(sourceFile, content);\n      }\n    });\n    return generator;\n  };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n *   - generated: An object with the generated line and column positions.\n *   - original: An object with the original line and column positions.\n *   - source: The original source file (relative to the sourceRoot).\n *   - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\n    var generated = util.getArg(aArgs, 'generated');\n    var original = util.getArg(aArgs, 'original', null);\n    var source = util.getArg(aArgs, 'source', null);\n    var name = util.getArg(aArgs, 'name', null);\n\n    if (!this._skipValidation) {\n      this._validateMapping(generated, original, source, name);\n    }\n\n    if (source != null) {\n      source = String(source);\n      if (!this._sources.has(source)) {\n        this._sources.add(source);\n      }\n    }\n\n    if (name != null) {\n      name = String(name);\n      if (!this._names.has(name)) {\n        this._names.add(name);\n      }\n    }\n\n    this._mappings.add({\n      generatedLine: generated.line,\n      generatedColumn: generated.column,\n      originalLine: original != null && original.line,\n      originalColumn: original != null && original.column,\n      source: source,\n      name: name\n    });\n  };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n    var source = aSourceFile;\n    if (this._sourceRoot != null) {\n      source = util.relative(this._sourceRoot, source);\n    }\n\n    if (aSourceContent != null) {\n      // Add the source content to the _sourcesContents map.\n      // Create a new _sourcesContents map if the property is null.\n      if (!this._sourcesContents) {\n        this._sourcesContents = Object.create(null);\n      }\n      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n    } else if (this._sourcesContents) {\n      // Remove the source file from the _sourcesContents map.\n      // If the _sourcesContents map is empty, set the property to null.\n      delete this._sourcesContents[util.toSetString(source)];\n      if (Object.keys(this._sourcesContents).length === 0) {\n        this._sourcesContents = null;\n      }\n    }\n  };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n *        If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n *        to be applied. If relative, it is relative to the SourceMapConsumer.\n *        This parameter is needed when the two source maps aren't in the same\n *        directory, and the source map to be applied contains relative source\n *        paths. If so, those relative source paths need to be rewritten\n *        relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n    var sourceFile = aSourceFile;\n    // If aSourceFile is omitted, we will use the file property of the SourceMap\n    if (aSourceFile == null) {\n      if (aSourceMapConsumer.file == null) {\n        throw new Error(\n          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n          'or the source map\\'s \"file\" property. Both were omitted.'\n        );\n      }\n      sourceFile = aSourceMapConsumer.file;\n    }\n    var sourceRoot = this._sourceRoot;\n    // Make \"sourceFile\" relative if an absolute Url is passed.\n    if (sourceRoot != null) {\n      sourceFile = util.relative(sourceRoot, sourceFile);\n    }\n    // Applying the SourceMap can add and remove items from the sources and\n    // the names array.\n    var newSources = new ArraySet();\n    var newNames = new ArraySet();\n\n    // Find mappings for the \"sourceFile\"\n    this._mappings.unsortedForEach(function (mapping) {\n      if (mapping.source === sourceFile && mapping.originalLine != null) {\n        // Check if it can be mapped by the source map, then update the mapping.\n        var original = aSourceMapConsumer.originalPositionFor({\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        });\n        if (original.source != null) {\n          // Copy mapping\n          mapping.source = original.source;\n          if (aSourceMapPath != null) {\n            mapping.source = util.join(aSourceMapPath, mapping.source)\n          }\n          if (sourceRoot != null) {\n            mapping.source = util.relative(sourceRoot, mapping.source);\n          }\n          mapping.originalLine = original.line;\n          mapping.originalColumn = original.column;\n          if (original.name != null) {\n            mapping.name = original.name;\n          }\n        }\n      }\n\n      var source = mapping.source;\n      if (source != null && !newSources.has(source)) {\n        newSources.add(source);\n      }\n\n      var name = mapping.name;\n      if (name != null && !newNames.has(name)) {\n        newNames.add(name);\n      }\n\n    }, this);\n    this._sources = newSources;\n    this._names = newNames;\n\n    // Copy sourcesContents of applied map.\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aSourceMapPath != null) {\n          sourceFile = util.join(aSourceMapPath, sourceFile);\n        }\n        if (sourceRoot != null) {\n          sourceFile = util.relative(sourceRoot, sourceFile);\n        }\n        this.setSourceContent(sourceFile, content);\n      }\n    }, this);\n  };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n *   1. Just the generated position.\n *   2. The Generated position, original position, and original source.\n *   3. Generated and original position, original source, as well as a name\n *      token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\n    // When aOriginal is truthy but has empty values for .line and .column,\n    // it is most likely a programmer error. In this case we throw a very\n    // specific error message to try to guide them the right way.\n    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n        throw new Error(\n            'original.line and original.column are not numbers -- you probably meant to omit ' +\n            'the original mapping entirely and only map the generated position. If so, pass ' +\n            'null for the original mapping instead of an object with empty or null values.'\n        );\n    }\n\n    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\n      }));\n    }\n  };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n  function SourceMapGenerator_serializeMappings() {\n    var previousGeneratedColumn = 0;\n    var previousGeneratedLine = 1;\n    var previousOriginalColumn = 0;\n    var previousOriginalLine = 0;\n    var previousName = 0;\n    var previousSource = 0;\n    var result = '';\n    var next;\n    var mapping;\n    var nameIdx;\n    var sourceIdx;\n\n    var mappings = this._mappings.toArray();\n    for (var i = 0, len = mappings.length; i < len; i++) {\n      mapping = mappings[i];\n      next = ''\n\n      if (mapping.generatedLine !== previousGeneratedLine) {\n        previousGeneratedColumn = 0;\n        while (mapping.generatedLine !== previousGeneratedLine) {\n          next += ';';\n          previousGeneratedLine++;\n        }\n      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\n      previousGeneratedColumn = mapping.generatedColumn;\n\n      if (mapping.source != null) {\n        sourceIdx = this._sources.indexOf(mapping.source);\n        next += base64VLQ.encode(sourceIdx - previousSource);\n        previousSource = sourceIdx;\n\n        // lines are stored 0-based in SourceMap spec version 3\n        next += base64VLQ.encode(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\n        previousOriginalColumn = mapping.originalColumn;\n\n        if (mapping.name != null) {\n          nameIdx = this._names.indexOf(mapping.name);\n          next += base64VLQ.encode(nameIdx - previousName);\n          previousName = nameIdx;\n        }\n      }\n\n      result += next;\n    }\n\n    return result;\n  };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n    return aSources.map(function (source) {\n      if (!this._sourcesContents) {\n        return null;\n      }\n      if (aSourceRoot != null) {\n        source = util.relative(aSourceRoot, source);\n      }\n      var key = util.toSetString(source);\n      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  function SourceMapGenerator_toJSON() {\n    var map = {\n      version: this._version,\n      sources: this._sources.toArray(),\n      names: this._names.toArray(),\n      mappings: this._serializeMappings()\n    };\n    if (this._file != null) {\n      map.file = this._file;\n    }\n    if (this._sourceRoot != null) {\n      map.sourceRoot = this._sourceRoot;\n    }\n    if (this._sourcesContents) {\n      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-generator.js\n// module id = 1\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *  * Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n *  * Redistributions in binary form must reproduce the above\n *    copyright notice, this list of conditions and the following\n *    disclaimer in the documentation and/or other materials provided\n *    with the distribution.\n *  * Neither the name of Google Inc. nor the names of its\n *    contributors may be used to endorse or promote products derived\n *    from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = require('./base64');\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n//   Continuation\n//   |    Sign\n//   |    |\n//   V    V\n//   101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n  return aValue < 0\n    ? ((-aValue) << 1) + 1\n    : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n  var isNegative = (aValue & 1) === 1;\n  var shifted = aValue >> 1;\n  return isNegative\n    ? -shifted\n    : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n  var encoded = \"\";\n  var digit;\n\n  var vlq = toVLQSigned(aValue);\n\n  do {\n    digit = vlq & VLQ_BASE_MASK;\n    vlq >>>= VLQ_BASE_SHIFT;\n    if (vlq > 0) {\n      // There are still more digits in this value, so we must make sure the\n      // continuation bit is marked.\n      digit |= VLQ_CONTINUATION_BIT;\n    }\n    encoded += base64.encode(digit);\n  } while (vlq > 0);\n\n  return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n  var strLen = aStr.length;\n  var result = 0;\n  var shift = 0;\n  var continuation, digit;\n\n  do {\n    if (aIndex >= strLen) {\n      throw new Error(\"Expected more digits in base 64 VLQ value.\");\n    }\n\n    digit = base64.decode(aStr.charCodeAt(aIndex++));\n    if (digit === -1) {\n      throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n    }\n\n    continuation = !!(digit & VLQ_CONTINUATION_BIT);\n    digit &= VLQ_BASE_MASK;\n    result = result + (digit << shift);\n    shift += VLQ_BASE_SHIFT;\n  } while (continuation);\n\n  aOutParam.value = fromVLQSigned(result);\n  aOutParam.rest = aIndex;\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/base64-vlq.js\n// module id = 2\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n  if (0 <= number && number < intToCharMap.length) {\n    return intToCharMap[number];\n  }\n  throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n  var bigA = 65;     // 'A'\n  var bigZ = 90;     // 'Z'\n\n  var littleA = 97;  // 'a'\n  var littleZ = 122; // 'z'\n\n  var zero = 48;     // '0'\n  var nine = 57;     // '9'\n\n  var plus = 43;     // '+'\n  var slash = 47;    // '/'\n\n  var littleOffset = 26;\n  var numberOffset = 52;\n\n  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n  if (bigA <= charCode && charCode <= bigZ) {\n    return (charCode - bigA);\n  }\n\n  // 26 - 51: abcdefghijklmnopqrstuvwxyz\n  if (littleA <= charCode && charCode <= littleZ) {\n    return (charCode - littleA + littleOffset);\n  }\n\n  // 52 - 61: 0123456789\n  if (zero <= charCode && charCode <= nine) {\n    return (charCode - zero + numberOffset);\n  }\n\n  // 62: +\n  if (charCode == plus) {\n    return 62;\n  }\n\n  // 63: /\n  if (charCode == slash) {\n    return 63;\n  }\n\n  // Invalid base64 digit.\n  return -1;\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/base64.js\n// module id = 3\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n  if (aName in aArgs) {\n    return aArgs[aName];\n  } else if (arguments.length === 3) {\n    return aDefaultValue;\n  } else {\n    throw new Error('\"' + aName + '\" is a required argument.');\n  }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n  var match = aUrl.match(urlRegexp);\n  if (!match) {\n    return null;\n  }\n  return {\n    scheme: match[1],\n    auth: match[2],\n    host: match[3],\n    port: match[4],\n    path: match[5]\n  };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n  var url = '';\n  if (aParsedUrl.scheme) {\n    url += aParsedUrl.scheme + ':';\n  }\n  url += '//';\n  if (aParsedUrl.auth) {\n    url += aParsedUrl.auth + '@';\n  }\n  if (aParsedUrl.host) {\n    url += aParsedUrl.host;\n  }\n  if (aParsedUrl.port) {\n    url += \":\" + aParsedUrl.port\n  }\n  if (aParsedUrl.path) {\n    url += aParsedUrl.path;\n  }\n  return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n  var path = aPath;\n  var url = urlParse(aPath);\n  if (url) {\n    if (!url.path) {\n      return aPath;\n    }\n    path = url.path;\n  }\n  var isAbsolute = exports.isAbsolute(path);\n\n  var parts = path.split(/\\/+/);\n  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n    part = parts[i];\n    if (part === '.') {\n      parts.splice(i, 1);\n    } else if (part === '..') {\n      up++;\n    } else if (up > 0) {\n      if (part === '') {\n        // The first part is blank if the path is absolute. Trying to go\n        // above the root is a no-op. Therefore we can remove all '..' parts\n        // directly after the root.\n        parts.splice(i + 1, up);\n        up = 0;\n      } else {\n        parts.splice(i, 2);\n        up--;\n      }\n    }\n  }\n  path = parts.join('/');\n\n  if (path === '') {\n    path = isAbsolute ? '/' : '.';\n  }\n\n  if (url) {\n    url.path = path;\n    return urlGenerate(url);\n  }\n  return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n *   first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n *   is updated with the result and aRoot is returned. Otherwise the result\n *   is returned.\n *   - If aPath is absolute, the result is aPath.\n *   - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n  if (aPath === \"\") {\n    aPath = \".\";\n  }\n  var aPathUrl = urlParse(aPath);\n  var aRootUrl = urlParse(aRoot);\n  if (aRootUrl) {\n    aRoot = aRootUrl.path || '/';\n  }\n\n  // `join(foo, '//www.example.org')`\n  if (aPathUrl && !aPathUrl.scheme) {\n    if (aRootUrl) {\n      aPathUrl.scheme = aRootUrl.scheme;\n    }\n    return urlGenerate(aPathUrl);\n  }\n\n  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n    return aPath;\n  }\n\n  // `join('http://', 'www.example.com')`\n  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n    aRootUrl.host = aPath;\n    return urlGenerate(aRootUrl);\n  }\n\n  var joined = aPath.charAt(0) === '/'\n    ? aPath\n    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n  if (aRootUrl) {\n    aRootUrl.path = joined;\n    return urlGenerate(aRootUrl);\n  }\n  return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n\n  aRoot = aRoot.replace(/\\/$/, '');\n\n  // It is possible for the path to be above the root. In this case, simply\n  // checking whether the root is a prefix of the path won't work. Instead, we\n  // need to remove components from the root one by one, until either we find\n  // a prefix that fits, or we run out of components to remove.\n  var level = 0;\n  while (aPath.indexOf(aRoot + '/') !== 0) {\n    var index = aRoot.lastIndexOf(\"/\");\n    if (index < 0) {\n      return aPath;\n    }\n\n    // If the only part of the root that is left is the scheme (i.e. http://,\n    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n    // have exhausted all components, so the path is not relative to the root.\n    aRoot = aRoot.slice(0, index);\n    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n      return aPath;\n    }\n\n    ++level;\n  }\n\n  // Make sure we add a \"../\" for each component we removed from the root.\n  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n  return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n  if (!s) {\n    return false;\n  }\n\n  var length = s.length;\n\n  if (length < 9 /* \"__proto__\".length */) {\n    return false;\n  }\n\n  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n    return false;\n  }\n\n  for (var i = length - 10; i >= 0; i--) {\n    if (s.charCodeAt(i) !== 36 /* '$' */) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n  if (aStr1 === aStr2) {\n    return 0;\n  }\n\n  if (aStr1 === null) {\n    return 1; // aStr2 !== null\n  }\n\n  if (aStr2 === null) {\n    return -1; // aStr1 !== null\n  }\n\n  if (aStr1 > aStr2) {\n    return 1;\n  }\n\n  return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n      sourceRoot += '/';\n    }\n    // The spec says:\n    //   Line 4: An optional source root, useful for relocating source\n    //   files on a server or removing repeated values in the\n    //   “sources” entry.  This value is prepended to the individual\n    //   entries in the “source” field.\n    sourceURL = sourceRoot + sourceURL;\n  }\n\n  // Historically, SourceMapConsumer did not take the sourceMapURL as\n  // a parameter.  This mode is still somewhat supported, which is why\n  // this code block is conditional.  However, it's preferable to pass\n  // the source map URL to SourceMapConsumer, so that this function\n  // can implement the source URL resolution algorithm as outlined in\n  // the spec.  This block is basically the equivalent of:\n  //    new URL(sourceURL, sourceMapURL).toString()\n  // ... except it avoids using URL, which wasn't available in the\n  // older releases of node still supported by this library.\n  //\n  // The spec says:\n  //   If the sources are not absolute URLs after prepending of the\n  //   “sourceRoot”, the sources are resolved relative to the\n  //   SourceMap (like resolving script src in a html document).\n  if (sourceMapURL) {\n    var parsed = urlParse(sourceMapURL);\n    if (!parsed) {\n      throw new Error(\"sourceMapURL could not be parsed\");\n    }\n    if (parsed.path) {\n      // Strip the last path component, but keep the \"/\".\n      var index = parsed.path.lastIndexOf('/');\n      if (index >= 0) {\n        parsed.path = parsed.path.substring(0, index + 1);\n      }\n    }\n    sourceURL = join(urlGenerate(parsed), sourceURL);\n  }\n\n  return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/util.js\n// module id = 4\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n  this._array = [];\n  this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n  var set = new ArraySet();\n  for (var i = 0, len = aArray.length; i < len; i++) {\n    set.add(aArray[i], aAllowDuplicates);\n  }\n  return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n  var idx = this._array.length;\n  if (!isDuplicate || aAllowDuplicates) {\n    this._array.push(aStr);\n  }\n  if (!isDuplicate) {\n    if (hasNativeMap) {\n      this._set.set(aStr, idx);\n    } else {\n      this._set[sStr] = idx;\n    }\n  }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n  if (hasNativeMap) {\n    return this._set.has(aStr);\n  } else {\n    var sStr = util.toSetString(aStr);\n    return has.call(this._set, sStr);\n  }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n  if (hasNativeMap) {\n    var idx = this._set.get(aStr);\n    if (idx >= 0) {\n        return idx;\n    }\n  } else {\n    var sStr = util.toSetString(aStr);\n    if (has.call(this._set, sStr)) {\n      return this._set[sStr];\n    }\n  }\n\n  throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n  if (aIdx >= 0 && aIdx < this._array.length) {\n    return this._array[aIdx];\n  }\n  throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n  return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/array-set.js\n// module id = 5\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n  // Optimized for most common case\n  var lineA = mappingA.generatedLine;\n  var lineB = mappingB.generatedLine;\n  var columnA = mappingA.generatedColumn;\n  var columnB = mappingB.generatedColumn;\n  return lineB > lineA || lineB == lineA && columnB >= columnA ||\n         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n  this._array = [];\n  this._sorted = true;\n  // Serves as infimum\n  this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n  function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n  };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n  if (generatedPositionAfter(this._last, aMapping)) {\n    this._last = aMapping;\n    this._array.push(aMapping);\n  } else {\n    this._sorted = false;\n    this._array.push(aMapping);\n  }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n  if (!this._sorted) {\n    this._array.sort(util.compareByGeneratedPositionsInflated);\n    this._sorted = true;\n  }\n  return this._array;\n};\n\nexports.MappingList = MappingList;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/mapping-list.js\n// module id = 6\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  return sourceMap.sections != null\n    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n//     {\n//       generatedLine: The line number in the generated code,\n//       generatedColumn: The column number in the generated code,\n//       source: The path to the original source file that generated this\n//               chunk of code,\n//       originalLine: The line number in the original source that\n//                     corresponds to this chunk of generated code,\n//       originalColumn: The column number in the original source that\n//                       corresponds to this chunk of generated code,\n//       name: The name of the original symbol which generated this chunk of\n//             code.\n//     }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__generatedMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__generatedMappings;\n  }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__originalMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__originalMappings;\n  }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n    var c = aStr.charAt(index);\n    return c === \";\" || c === \",\";\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n  };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n *        The function that is called with each mapping.\n * @param Object aContext\n *        Optional. If specified, this object will be the value of `this` every\n *        time that `aCallback` is called.\n * @param aOrder\n *        Either `SourceMapConsumer.GENERATED_ORDER` or\n *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n *        iterate over the mappings sorted by the generated file's line/column\n *        order or the original's source/line/column order, respectively. Defaults to\n *        `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n    var context = aContext || null;\n    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n    var mappings;\n    switch (order) {\n    case SourceMapConsumer.GENERATED_ORDER:\n      mappings = this._generatedMappings;\n      break;\n    case SourceMapConsumer.ORIGINAL_ORDER:\n      mappings = this._originalMappings;\n      break;\n    default:\n      throw new Error(\"Unknown order of iteration.\");\n    }\n\n    var sourceRoot = this.sourceRoot;\n    mappings.map(function (mapping) {\n      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n      return {\n        source: source,\n        generatedLine: mapping.generatedLine,\n        generatedColumn: mapping.generatedColumn,\n        originalLine: mapping.originalLine,\n        originalColumn: mapping.originalColumn,\n        name: mapping.name === null ? null : this._names.at(mapping.name)\n      };\n    }, this).forEach(aCallback, context);\n  };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number is 1-based.\n *   - column: Optional. the column number in the original source.\n *    The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *    line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *    The column number is 0-based.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n    var line = util.getArg(aArgs, 'line');\n\n    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n    // returns the index of the closest mapping less than the needle. By\n    // setting needle.originalColumn to 0, we thus find the last mapping for\n    // the given line, provided such a mapping exists.\n    var needle = {\n      source: util.getArg(aArgs, 'source'),\n      originalLine: line,\n      originalColumn: util.getArg(aArgs, 'column', 0)\n    };\n\n    needle.source = this._findSourceIndex(needle.source);\n    if (needle.source < 0) {\n      return [];\n    }\n\n    var mappings = [];\n\n    var index = this._findMapping(needle,\n                                  this._originalMappings,\n                                  \"originalLine\",\n                                  \"originalColumn\",\n                                  util.compareByOriginalPositions,\n                                  binarySearch.LEAST_UPPER_BOUND);\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (aArgs.column === undefined) {\n        var originalLine = mapping.originalLine;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we found. Since\n        // mappings are sorted, this is guaranteed to find all mappings for\n        // the line we found.\n        while (mapping && mapping.originalLine === originalLine) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      } else {\n        var originalColumn = mapping.originalColumn;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we were searching for.\n        // Since mappings are sorted, this is guaranteed to find all mappings for\n        // the line we are searching for.\n        while (mapping &&\n               mapping.originalLine === line &&\n               mapping.originalColumn == originalColumn) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      }\n    }\n\n    return mappings;\n  };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - sources: An array of URLs to the original source files.\n *   - names: An array of identifiers which can be referrenced by individual mappings.\n *   - sourceRoot: Optional. The URL root from which all sources are relative.\n *   - sourcesContent: Optional. An array of contents of the original source files.\n *   - mappings: A string of base64 VLQs which contain the actual mappings.\n *   - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n *     {\n *       version : 3,\n *       file: \"out.js\",\n *       sourceRoot : \"\",\n *       sources: [\"foo.js\", \"bar.js\"],\n *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n *       mappings: \"AA,AB;;ABCDE;\"\n *     }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sources = util.getArg(sourceMap, 'sources');\n  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n  // requires the array) to play nice here.\n  var names = util.getArg(sourceMap, 'names', []);\n  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n  var mappings = util.getArg(sourceMap, 'mappings');\n  var file = util.getArg(sourceMap, 'file', null);\n\n  // Once again, Sass deviates from the spec and supplies the version as a\n  // string rather than a number, so we use loose equality checking here.\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  if (sourceRoot) {\n    sourceRoot = util.normalize(sourceRoot);\n  }\n\n  sources = sources\n    .map(String)\n    // Some source maps produce relative source paths like \"./foo.js\" instead of\n    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n    // See bugzil.la/1090768.\n    .map(util.normalize)\n    // Always ensure that absolute sources are internally stored relative to\n    // the source root, if the source root is absolute. Not doing this would\n    // be particularly problematic when the source root is a prefix of the\n    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n    .map(function (source) {\n      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n        ? util.relative(sourceRoot, source)\n        : source;\n    });\n\n  // Pass `true` below to allow duplicate names and sources. While source maps\n  // are intended to be compressed and deduplicated, the TypeScript compiler\n  // sometimes generates source maps with duplicates in them. See Github issue\n  // #72 and bugzil.la/889492.\n  this._names = ArraySet.fromArray(names.map(String), true);\n  this._sources = ArraySet.fromArray(sources, true);\n\n  this._absoluteSources = this._sources.toArray().map(function (s) {\n    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n  });\n\n  this.sourceRoot = sourceRoot;\n  this.sourcesContent = sourcesContent;\n  this._mappings = mappings;\n  this._sourceMapURL = aSourceMapURL;\n  this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n  var relativeSource = aSource;\n  if (this.sourceRoot != null) {\n    relativeSource = util.relative(this.sourceRoot, relativeSource);\n  }\n\n  if (this._sources.has(relativeSource)) {\n    return this._sources.indexOf(relativeSource);\n  }\n\n  // Maybe aSource is an absolute URL as returned by |sources|.  In\n  // this case we can't simply undo the transform.\n  var i;\n  for (i = 0; i < this._absoluteSources.length; ++i) {\n    if (this._absoluteSources[i] == aSource) {\n      return i;\n    }\n  }\n\n  return -1;\n};\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n *        The source map that will be consumed.\n * @param String aSourceMapURL\n *        The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n                                                            smc.sourceRoot);\n    smc.file = aSourceMap._file;\n    smc._sourceMapURL = aSourceMapURL;\n    smc._absoluteSources = smc._sources.toArray().map(function (s) {\n      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n    });\n\n    // Because we are modifying the entries (by converting string sources and\n    // names to indices into the sources and names ArraySets), we have to make\n    // a copy of the entry or else bad things happen. Shared mutable state\n    // strikes again! See github issue #191.\n\n    var generatedMappings = aSourceMap._mappings.toArray().slice();\n    var destGeneratedMappings = smc.__generatedMappings = [];\n    var destOriginalMappings = smc.__originalMappings = [];\n\n    for (var i = 0, length = generatedMappings.length; i < length; i++) {\n      var srcMapping = generatedMappings[i];\n      var destMapping = new Mapping;\n      destMapping.generatedLine = srcMapping.generatedLine;\n      destMapping.generatedColumn = srcMapping.generatedColumn;\n\n      if (srcMapping.source) {\n        destMapping.source = sources.indexOf(srcMapping.source);\n        destMapping.originalLine = srcMapping.originalLine;\n        destMapping.originalColumn = srcMapping.originalColumn;\n\n        if (srcMapping.name) {\n          destMapping.name = names.indexOf(srcMapping.name);\n        }\n\n        destOriginalMappings.push(destMapping);\n      }\n\n      destGeneratedMappings.push(destMapping);\n    }\n\n    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n    return smc;\n  };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    return this._absoluteSources.slice();\n  }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n  this.generatedLine = 0;\n  this.generatedColumn = 0;\n  this.source = null;\n  this.originalLine = null;\n  this.originalColumn = null;\n  this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    var generatedLine = 1;\n    var previousGeneratedColumn = 0;\n    var previousOriginalLine = 0;\n    var previousOriginalColumn = 0;\n    var previousSource = 0;\n    var previousName = 0;\n    var length = aStr.length;\n    var index = 0;\n    var cachedSegments = {};\n    var temp = {};\n    var originalMappings = [];\n    var generatedMappings = [];\n    var mapping, str, segment, end, value;\n\n    while (index < length) {\n      if (aStr.charAt(index) === ';') {\n        generatedLine++;\n        index++;\n        previousGeneratedColumn = 0;\n      }\n      else if (aStr.charAt(index) === ',') {\n        index++;\n      }\n      else {\n        mapping = new Mapping();\n        mapping.generatedLine = generatedLine;\n\n        // Because each offset is encoded relative to the previous one,\n        // many segments often have the same encoding. We can exploit this\n        // fact by caching the parsed variable length fields of each segment,\n        // allowing us to avoid a second parse if we encounter the same\n        // segment again.\n        for (end = index; end < length; end++) {\n          if (this._charIsMappingSeparator(aStr, end)) {\n            break;\n          }\n        }\n        str = aStr.slice(index, end);\n\n        segment = cachedSegments[str];\n        if (segment) {\n          index += str.length;\n        } else {\n          segment = [];\n          while (index < end) {\n            base64VLQ.decode(aStr, index, temp);\n            value = temp.value;\n            index = temp.rest;\n            segment.push(value);\n          }\n\n          if (segment.length === 2) {\n            throw new Error('Found a source, but no line and column');\n          }\n\n          if (segment.length === 3) {\n            throw new Error('Found a source and line, but no column');\n          }\n\n          cachedSegments[str] = segment;\n        }\n\n        // Generated column.\n        mapping.generatedColumn = previousGeneratedColumn + segment[0];\n        previousGeneratedColumn = mapping.generatedColumn;\n\n        if (segment.length > 1) {\n          // Original source.\n          mapping.source = previousSource + segment[1];\n          previousSource += segment[1];\n\n          // Original line.\n          mapping.originalLine = previousOriginalLine + segment[2];\n          previousOriginalLine = mapping.originalLine;\n          // Lines are stored 0-based\n          mapping.originalLine += 1;\n\n          // Original column.\n          mapping.originalColumn = previousOriginalColumn + segment[3];\n          previousOriginalColumn = mapping.originalColumn;\n\n          if (segment.length > 4) {\n            // Original name.\n            mapping.name = previousName + segment[4];\n            previousName += segment[4];\n          }\n        }\n\n        generatedMappings.push(mapping);\n        if (typeof mapping.originalLine === 'number') {\n          originalMappings.push(mapping);\n        }\n      }\n    }\n\n    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n    this.__generatedMappings = generatedMappings;\n\n    quickSort(originalMappings, util.compareByOriginalPositions);\n    this.__originalMappings = originalMappings;\n  };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n                                         aColumnName, aComparator, aBias) {\n    // To return the position we are searching for, we must first find the\n    // mapping for the given position and then return the opposite position it\n    // points to. Because the mappings are sorted, we can use binary search to\n    // find the best mapping.\n\n    if (aNeedle[aLineName] <= 0) {\n      throw new TypeError('Line must be greater than or equal to 1, got '\n                          + aNeedle[aLineName]);\n    }\n    if (aNeedle[aColumnName] < 0) {\n      throw new TypeError('Column must be greater than or equal to 0, got '\n                          + aNeedle[aColumnName]);\n    }\n\n    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n  };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n  function SourceMapConsumer_computeColumnSpans() {\n    for (var index = 0; index < this._generatedMappings.length; ++index) {\n      var mapping = this._generatedMappings[index];\n\n      // Mappings do not contain a field for the last generated columnt. We\n      // can come up with an optimistic estimate, however, by assuming that\n      // mappings are contiguous (i.e. given two consecutive mappings, the\n      // first mapping ends where the second one starts).\n      if (index + 1 < this._generatedMappings.length) {\n        var nextMapping = this._generatedMappings[index + 1];\n\n        if (mapping.generatedLine === nextMapping.generatedLine) {\n          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n          continue;\n        }\n      }\n\n      // The last mapping for each line spans the entire line.\n      mapping.lastGeneratedColumn = Infinity;\n    }\n  };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n  function SourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._generatedMappings,\n      \"generatedLine\",\n      \"generatedColumn\",\n      util.compareByGeneratedPositionsDeflated,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._generatedMappings[index];\n\n      if (mapping.generatedLine === needle.generatedLine) {\n        var source = util.getArg(mapping, 'source', null);\n        if (source !== null) {\n          source = this._sources.at(source);\n          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n        }\n        var name = util.getArg(mapping, 'name', null);\n        if (name !== null) {\n          name = this._names.at(name);\n        }\n        return {\n          source: source,\n          line: util.getArg(mapping, 'originalLine', null),\n          column: util.getArg(mapping, 'originalColumn', null),\n          name: name\n        };\n      }\n    }\n\n    return {\n      source: null,\n      line: null,\n      column: null,\n      name: null\n    };\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) {\n      return false;\n    }\n    return this.sourcesContent.length >= this._sources.size() &&\n      !this.sourcesContent.some(function (sc) { return sc == null; });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    if (!this.sourcesContent) {\n      return null;\n    }\n\n    var index = this._findSourceIndex(aSource);\n    if (index >= 0) {\n      return this.sourcesContent[index];\n    }\n\n    var relativeSource = aSource;\n    if (this.sourceRoot != null) {\n      relativeSource = util.relative(this.sourceRoot, relativeSource);\n    }\n\n    var url;\n    if (this.sourceRoot != null\n        && (url = util.urlParse(this.sourceRoot))) {\n      // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n      // many users. We can help them out when they expect file:// URIs to\n      // behave like it would if they were running a local HTTP server. See\n      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n      var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n      if (url.scheme == \"file\"\n          && this._sources.has(fileUriAbsPath)) {\n        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n      }\n\n      if ((!url.path || url.path == \"/\")\n          && this._sources.has(\"/\" + relativeSource)) {\n        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n      }\n    }\n\n    // This function is used recursively from\n    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n    // don't want to throw if we can't find the source - we just want to\n    // return null, so we provide a flag to exit gracefully.\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n  function SourceMapConsumer_generatedPositionFor(aArgs) {\n    var source = util.getArg(aArgs, 'source');\n    source = this._findSourceIndex(source);\n    if (source < 0) {\n      return {\n        line: null,\n        column: null,\n        lastColumn: null\n      };\n    }\n\n    var needle = {\n      source: source,\n      originalLine: util.getArg(aArgs, 'line'),\n      originalColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._originalMappings,\n      \"originalLine\",\n      \"originalColumn\",\n      util.compareByOriginalPositions,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (mapping.source === needle.source) {\n        return {\n          line: util.getArg(mapping, 'generatedLine', null),\n          column: util.getArg(mapping, 'generatedColumn', null),\n          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n        };\n      }\n    }\n\n    return {\n      line: null,\n      column: null,\n      lastColumn: null\n    };\n  };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - file: Optional. The generated file this source map is associated with.\n *   - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n *   - offset: The offset into the original specified at which this section\n *       begins to apply, defined as an object with a \"line\" and \"column\"\n *       field.\n *   - map: A source map definition. This source map could also be indexed,\n *       but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n *  {\n *    version : 3,\n *    file: \"app.js\",\n *    sections: [{\n *      offset: {line:100, column:10},\n *      map: {\n *        version : 3,\n *        file: \"section.js\",\n *        sources: [\"foo.js\", \"bar.js\"],\n *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n *        mappings: \"AAAA,E;;ABCDE;\"\n *      }\n *    }],\n *  }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sections = util.getArg(sourceMap, 'sections');\n\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n\n  var lastOffset = {\n    line: -1,\n    column: 0\n  };\n  this._sections = sections.map(function (s) {\n    if (s.url) {\n      // The url field will require support for asynchronicity.\n      // See https://github.com/mozilla/source-map/issues/16\n      throw new Error('Support for url field in sections not implemented.');\n    }\n    var offset = util.getArg(s, 'offset');\n    var offsetLine = util.getArg(offset, 'line');\n    var offsetColumn = util.getArg(offset, 'column');\n\n    if (offsetLine < lastOffset.line ||\n        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n      throw new Error('Section offsets must be ordered and non-overlapping.');\n    }\n    lastOffset = offset;\n\n    return {\n      generatedOffset: {\n        // The offset fields are 0-based, but we use 1-based indices when\n        // encoding/decoding from VLQ.\n        generatedLine: offsetLine + 1,\n        generatedColumn: offsetColumn + 1\n      },\n      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n    }\n  });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    var sources = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n        sources.push(this._sections[i].consumer.sources[j]);\n      }\n    }\n    return sources;\n  }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    // Find the section containing the generated position we're trying to map\n    // to an original position.\n    var sectionIndex = binarySearch.search(needle, this._sections,\n      function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) {\n          return cmp;\n        }\n\n        return (needle.generatedColumn -\n                section.generatedOffset.generatedColumn);\n      });\n    var section = this._sections[sectionIndex];\n\n    if (!section) {\n      return {\n        source: null,\n        line: null,\n        column: null,\n        name: null\n      };\n    }\n\n    return section.consumer.originalPositionFor({\n      line: needle.generatedLine -\n        (section.generatedOffset.generatedLine - 1),\n      column: needle.generatedColumn -\n        (section.generatedOffset.generatedLine === needle.generatedLine\n         ? section.generatedOffset.generatedColumn - 1\n         : 0),\n      bias: aArgs.bias\n    });\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n    return this._sections.every(function (s) {\n      return s.consumer.hasContentsOfAllSources();\n    });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      var content = section.consumer.sourceContentFor(aSource, true);\n      if (content) {\n        return content;\n      }\n    }\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based. \n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      // Only consider this section if the requested source is in the list of\n      // sources of the consumer.\n      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n        continue;\n      }\n      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n      if (generatedPosition) {\n        var ret = {\n          line: generatedPosition.line +\n            (section.generatedOffset.generatedLine - 1),\n          column: generatedPosition.column +\n            (section.generatedOffset.generatedLine === generatedPosition.line\n             ? section.generatedOffset.generatedColumn - 1\n             : 0)\n        };\n        return ret;\n      }\n    }\n\n    return {\n      line: null,\n      column: null\n    };\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    this.__generatedMappings = [];\n    this.__originalMappings = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n      var sectionMappings = section.consumer._generatedMappings;\n      for (var j = 0; j < sectionMappings.length; j++) {\n        var mapping = sectionMappings[j];\n\n        var source = section.consumer._sources.at(mapping.source);\n        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n        this._sources.add(source);\n        source = this._sources.indexOf(source);\n\n        var name = null;\n        if (mapping.name) {\n          name = section.consumer._names.at(mapping.name);\n          this._names.add(name);\n          name = this._names.indexOf(name);\n        }\n\n        // The mappings coming from the consumer for the section have\n        // generated positions relative to the start of the section, so we\n        // need to offset them to be relative to the start of the concatenated\n        // generated file.\n        var adjustedMapping = {\n          source: source,\n          generatedLine: mapping.generatedLine +\n            (section.generatedOffset.generatedLine - 1),\n          generatedColumn: mapping.generatedColumn +\n            (section.generatedOffset.generatedLine === mapping.generatedLine\n            ? section.generatedOffset.generatedColumn - 1\n            : 0),\n          originalLine: mapping.originalLine,\n          originalColumn: mapping.originalColumn,\n          name: name\n        };\n\n        this.__generatedMappings.push(adjustedMapping);\n        if (typeof adjustedMapping.originalLine === 'number') {\n          this.__originalMappings.push(adjustedMapping);\n        }\n      }\n    }\n\n    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n  };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-consumer.js\n// module id = 7\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n  // This function terminates when one of the following is true:\n  //\n  //   1. We find the exact element we are looking for.\n  //\n  //   2. We did not find the exact element, but we can return the index of\n  //      the next-closest element.\n  //\n  //   3. We did not find the exact element, and there is no next-closest\n  //      element than the one we are searching for, so we return -1.\n  var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n  var cmp = aCompare(aNeedle, aHaystack[mid], true);\n  if (cmp === 0) {\n    // Found the element we are looking for.\n    return mid;\n  }\n  else if (cmp > 0) {\n    // Our needle is greater than aHaystack[mid].\n    if (aHigh - mid > 1) {\n      // The element is in the upper half.\n      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // The exact needle element was not found in this haystack. Determine if\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return aHigh < aHaystack.length ? aHigh : -1;\n    } else {\n      return mid;\n    }\n  }\n  else {\n    // Our needle is less than aHaystack[mid].\n    if (mid - aLow > 1) {\n      // The element is in the lower half.\n      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return mid;\n    } else {\n      return aLow < 0 ? -1 : aLow;\n    }\n  }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n *     array and returns -1, 0, or 1 depending on whether the needle is less\n *     than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n  if (aHaystack.length === 0) {\n    return -1;\n  }\n\n  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n  if (index < 0) {\n    return -1;\n  }\n\n  // We have found either the exact element, or the next-closest element than\n  // the one we are searching for. However, there may be more than one such\n  // element. Make sure we always return the smallest of these.\n  while (index - 1 >= 0) {\n    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n      break;\n    }\n    --index;\n  }\n\n  return index;\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/binary-search.js\n// module id = 8\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n *        The array.\n * @param {Number} x\n *        The index of the first item.\n * @param {Number} y\n *        The index of the second item.\n */\nfunction swap(ary, x, y) {\n  var temp = ary[x];\n  ary[x] = ary[y];\n  ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n *        The lower bound on the range.\n * @param {Number} high\n *        The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n  return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n * @param {Number} p\n *        Start index of the array\n * @param {Number} r\n *        End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n  // If our lower bound is less than our upper bound, we (1) partition the\n  // array into two pieces and (2) recurse on each half. If it is not, this is\n  // the empty array and our base case.\n\n  if (p < r) {\n    // (1) Partitioning.\n    //\n    // The partitioning chooses a pivot between `p` and `r` and moves all\n    // elements that are less than or equal to the pivot to the before it, and\n    // all the elements that are greater than it after it. The effect is that\n    // once partition is done, the pivot is in the exact place it will be when\n    // the array is put in sorted order, and it will not need to be moved\n    // again. This runs in O(n) time.\n\n    // Always choose a random pivot so that an input array which is reverse\n    // sorted does not cause O(n^2) running time.\n    var pivotIndex = randomIntInRange(p, r);\n    var i = p - 1;\n\n    swap(ary, pivotIndex, r);\n    var pivot = ary[r];\n\n    // Immediately after `j` is incremented in this loop, the following hold\n    // true:\n    //\n    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.\n    //\n    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n    for (var j = p; j < r; j++) {\n      if (comparator(ary[j], pivot) <= 0) {\n        i += 1;\n        swap(ary, i, j);\n      }\n    }\n\n    swap(ary, i + 1, j);\n    var q = i + 1;\n\n    // (2) Recurse on each half.\n\n    doQuickSort(ary, comparator, p, q - 1);\n    doQuickSort(ary, comparator, q + 1, r);\n  }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n  doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/quick-sort.js\n// module id = 9\n// module chunks = 0","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar util = require('./util');\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n *        generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n  this.children = [];\n  this.sourceContents = {};\n  this.line = aLine == null ? null : aLine;\n  this.column = aColumn == null ? null : aColumn;\n  this.source = aSource == null ? null : aSource;\n  this.name = aName == null ? null : aName;\n  this[isSourceNode] = true;\n  if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n *        SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n    // The SourceNode we want to fill with the generated code\n    // and the SourceMap\n    var node = new SourceNode();\n\n    // All even indices of this array are one line of the generated code,\n    // while all odd indices are the newlines between two adjacent lines\n    // (since `REGEX_NEWLINE` captures its match).\n    // Processed fragments are accessed by calling `shiftNextLine`.\n    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n    var remainingLinesIndex = 0;\n    var shiftNextLine = function() {\n      var lineContents = getNextLine();\n      // The last line of a file might not have a newline.\n      var newLine = getNextLine() || \"\";\n      return lineContents + newLine;\n\n      function getNextLine() {\n        return remainingLinesIndex < remainingLines.length ?\n            remainingLines[remainingLinesIndex++] : undefined;\n      }\n    };\n\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n    // The generate SourceNodes we need a code range.\n    // To extract it current and last mapping is used.\n    // Here we store the last mapping.\n    var lastMapping = null;\n\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      if (lastMapping !== null) {\n        // We add the code from \"lastMapping\" to \"mapping\":\n        // First check if there is a new line in between.\n        if (lastGeneratedLine < mapping.generatedLine) {\n          // Associate first line with \"lastMapping\"\n          addMappingWithCode(lastMapping, shiftNextLine());\n          lastGeneratedLine++;\n          lastGeneratedColumn = 0;\n          // The remaining code is added without mapping\n        } else {\n          // There is no new line in between.\n          // Associate the code between \"lastGeneratedColumn\" and\n          // \"mapping.generatedColumn\" with \"lastMapping\"\n          var nextLine = remainingLines[remainingLinesIndex] || '';\n          var code = nextLine.substr(0, mapping.generatedColumn -\n                                        lastGeneratedColumn);\n          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n                                              lastGeneratedColumn);\n          lastGeneratedColumn = mapping.generatedColumn;\n          addMappingWithCode(lastMapping, code);\n          // No more remaining code, continue\n          lastMapping = mapping;\n          return;\n        }\n      }\n      // We add the generated code until the first mapping\n      // to the SourceNode without any mapping.\n      // Each line is added as separate string.\n      while (lastGeneratedLine < mapping.generatedLine) {\n        node.add(shiftNextLine());\n        lastGeneratedLine++;\n      }\n      if (lastGeneratedColumn < mapping.generatedColumn) {\n        var nextLine = remainingLines[remainingLinesIndex] || '';\n        node.add(nextLine.substr(0, mapping.generatedColumn));\n        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n        lastGeneratedColumn = mapping.generatedColumn;\n      }\n      lastMapping = mapping;\n    }, this);\n    // We have processed all mappings.\n    if (remainingLinesIndex < remainingLines.length) {\n      if (lastMapping) {\n        // Associate the remaining code in the current line with \"lastMapping\"\n        addMappingWithCode(lastMapping, shiftNextLine());\n      }\n      // and add the remaining lines without any mapping\n      node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n    }\n\n    // Copy sourcesContent into SourceNode\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aRelativePath != null) {\n          sourceFile = util.join(aRelativePath, sourceFile);\n        }\n        node.setSourceContent(sourceFile, content);\n      }\n    });\n\n    return node;\n\n    function addMappingWithCode(mapping, code) {\n      if (mapping === null || mapping.source === undefined) {\n        node.add(code);\n      } else {\n        var source = aRelativePath\n          ? util.join(aRelativePath, mapping.source)\n          : mapping.source;\n        node.add(new SourceNode(mapping.originalLine,\n                                mapping.originalColumn,\n                                source,\n                                code,\n                                mapping.name));\n      }\n    }\n  };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n  if (Array.isArray(aChunk)) {\n    aChunk.forEach(function (chunk) {\n      this.add(chunk);\n    }, this);\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    if (aChunk) {\n      this.children.push(aChunk);\n    }\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n  if (Array.isArray(aChunk)) {\n    for (var i = aChunk.length-1; i >= 0; i--) {\n      this.prepend(aChunk[i]);\n    }\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    this.children.unshift(aChunk);\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n  var chunk;\n  for (var i = 0, len = this.children.length; i < len; i++) {\n    chunk = this.children[i];\n    if (chunk[isSourceNode]) {\n      chunk.walk(aFn);\n    }\n    else {\n      if (chunk !== '') {\n        aFn(chunk, { source: this.source,\n                     line: this.line,\n                     column: this.column,\n                     name: this.name });\n      }\n    }\n  }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n  var newChildren;\n  var i;\n  var len = this.children.length;\n  if (len > 0) {\n    newChildren = [];\n    for (i = 0; i < len-1; i++) {\n      newChildren.push(this.children[i]);\n      newChildren.push(aSep);\n    }\n    newChildren.push(this.children[i]);\n    this.children = newChildren;\n  }\n  return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n  var lastChild = this.children[this.children.length - 1];\n  if (lastChild[isSourceNode]) {\n    lastChild.replaceRight(aPattern, aReplacement);\n  }\n  else if (typeof lastChild === 'string') {\n    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n  }\n  else {\n    this.children.push(''.replace(aPattern, aReplacement));\n  }\n  return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n  };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n  function SourceNode_walkSourceContents(aFn) {\n    for (var i = 0, len = this.children.length; i < len; i++) {\n      if (this.children[i][isSourceNode]) {\n        this.children[i].walkSourceContents(aFn);\n      }\n    }\n\n    var sources = Object.keys(this.sourceContents);\n    for (var i = 0, len = sources.length; i < len; i++) {\n      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n    }\n  };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n  var str = \"\";\n  this.walk(function (chunk) {\n    str += chunk;\n  });\n  return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n  var generated = {\n    code: \"\",\n    line: 1,\n    column: 0\n  };\n  var map = new SourceMapGenerator(aArgs);\n  var sourceMappingActive = false;\n  var lastOriginalSource = null;\n  var lastOriginalLine = null;\n  var lastOriginalColumn = null;\n  var lastOriginalName = null;\n  this.walk(function (chunk, original) {\n    generated.code += chunk;\n    if (original.source !== null\n        && original.line !== null\n        && original.column !== null) {\n      if(lastOriginalSource !== original.source\n         || lastOriginalLine !== original.line\n         || lastOriginalColumn !== original.column\n         || lastOriginalName !== original.name) {\n        map.addMapping({\n          source: original.source,\n          original: {\n            line: original.line,\n            column: original.column\n          },\n          generated: {\n            line: generated.line,\n            column: generated.column\n          },\n          name: original.name\n        });\n      }\n      lastOriginalSource = original.source;\n      lastOriginalLine = original.line;\n      lastOriginalColumn = original.column;\n      lastOriginalName = original.name;\n      sourceMappingActive = true;\n    } else if (sourceMappingActive) {\n      map.addMapping({\n        generated: {\n          line: generated.line,\n          column: generated.column\n        }\n      });\n      lastOriginalSource = null;\n      sourceMappingActive = false;\n    }\n    for (var idx = 0, length = chunk.length; idx < length; idx++) {\n      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n        generated.line++;\n        generated.column = 0;\n        // Mappings end at eol\n        if (idx + 1 === length) {\n          lastOriginalSource = null;\n          sourceMappingActive = false;\n        } else if (sourceMappingActive) {\n          map.addMapping({\n            source: original.source,\n            original: {\n              line: original.line,\n              column: original.column\n            },\n            generated: {\n              line: generated.line,\n              column: generated.column\n            },\n            name: original.name\n          });\n        }\n      } else {\n        generated.column++;\n      }\n    }\n  });\n  this.walkSourceContents(function (sourceFile, sourceContent) {\n    map.setSourceContent(sourceFile, sourceContent);\n  });\n\n  return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-node.js\n// module id = 10\n// module chunks = 0"],"sourceRoot":""}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/array-set.js b/node_modules/mathjs/examples/node_modules/source-map/lib/array-set.js
new file mode 100644
index 0000000..fbd5c81
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/array-set.js
@@ -0,0 +1,121 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+var has = Object.prototype.hasOwnProperty;
+var hasNativeMap = typeof Map !== "undefined";
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+function ArraySet() {
+  this._array = [];
+  this._set = hasNativeMap ? new Map() : Object.create(null);
+}
+
+/**
+ * Static method for creating ArraySet instances from an existing array.
+ */
+ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+  var set = new ArraySet();
+  for (var i = 0, len = aArray.length; i < len; i++) {
+    set.add(aArray[i], aAllowDuplicates);
+  }
+  return set;
+};
+
+/**
+ * Return how many unique items are in this ArraySet. If duplicates have been
+ * added, than those do not count towards the size.
+ *
+ * @returns Number
+ */
+ArraySet.prototype.size = function ArraySet_size() {
+  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+};
+
+/**
+ * Add the given string to this set.
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+  var idx = this._array.length;
+  if (!isDuplicate || aAllowDuplicates) {
+    this._array.push(aStr);
+  }
+  if (!isDuplicate) {
+    if (hasNativeMap) {
+      this._set.set(aStr, idx);
+    } else {
+      this._set[sStr] = idx;
+    }
+  }
+};
+
+/**
+ * Is the given string a member of this set?
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.has = function ArraySet_has(aStr) {
+  if (hasNativeMap) {
+    return this._set.has(aStr);
+  } else {
+    var sStr = util.toSetString(aStr);
+    return has.call(this._set, sStr);
+  }
+};
+
+/**
+ * What is the index of the given string in the array?
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+  if (hasNativeMap) {
+    var idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+  } else {
+    var sStr = util.toSetString(aStr);
+    if (has.call(this._set, sStr)) {
+      return this._set[sStr];
+    }
+  }
+
+  throw new Error('"' + aStr + '" is not in the set.');
+};
+
+/**
+ * What is the element at the given index?
+ *
+ * @param Number aIdx
+ */
+ArraySet.prototype.at = function ArraySet_at(aIdx) {
+  if (aIdx >= 0 && aIdx < this._array.length) {
+    return this._array[aIdx];
+  }
+  throw new Error('No element indexed by ' + aIdx);
+};
+
+/**
+ * Returns the array representation of this set (which has the proper indices
+ * indicated by indexOf). Note that this is a copy of the internal array used
+ * for storing the members so that no one can mess with internal state.
+ */
+ArraySet.prototype.toArray = function ArraySet_toArray() {
+  return this._array.slice();
+};
+
+exports.ArraySet = ArraySet;
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/base64-vlq.js b/node_modules/mathjs/examples/node_modules/source-map/lib/base64-vlq.js
new file mode 100644
index 0000000..612b404
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/base64-vlq.js
@@ -0,0 +1,140 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+var base64 = require('./base64');
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+var VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+function fromVLQSigned(aValue) {
+  var isNegative = (aValue & 1) === 1;
+  var shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+exports.encode = function base64VLQ_encode(aValue) {
+  var encoded = "";
+  var digit;
+
+  var vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
+
+/**
+ * Decodes the next base 64 VLQ value from the given string and returns the
+ * value and the rest of the string via the out parameter.
+ */
+exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+  var strLen = aStr.length;
+  var result = 0;
+  var shift = 0;
+  var continuation, digit;
+
+  do {
+    if (aIndex >= strLen) {
+      throw new Error("Expected more digits in base 64 VLQ value.");
+    }
+
+    digit = base64.decode(aStr.charCodeAt(aIndex++));
+    if (digit === -1) {
+      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+    }
+
+    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+    digit &= VLQ_BASE_MASK;
+    result = result + (digit << shift);
+    shift += VLQ_BASE_SHIFT;
+  } while (continuation);
+
+  aOutParam.value = fromVLQSigned(result);
+  aOutParam.rest = aIndex;
+};
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/base64.js b/node_modules/mathjs/examples/node_modules/source-map/lib/base64.js
new file mode 100644
index 0000000..8aa86b3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/base64.js
@@ -0,0 +1,67 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+exports.encode = function (number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
+
+/**
+ * Decode a single base 64 character code digit to an integer. Returns -1 on
+ * failure.
+ */
+exports.decode = function (charCode) {
+  var bigA = 65;     // 'A'
+  var bigZ = 90;     // 'Z'
+
+  var littleA = 97;  // 'a'
+  var littleZ = 122; // 'z'
+
+  var zero = 48;     // '0'
+  var nine = 57;     // '9'
+
+  var plus = 43;     // '+'
+  var slash = 47;    // '/'
+
+  var littleOffset = 26;
+  var numberOffset = 52;
+
+  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+  if (bigA <= charCode && charCode <= bigZ) {
+    return (charCode - bigA);
+  }
+
+  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+  if (littleA <= charCode && charCode <= littleZ) {
+    return (charCode - littleA + littleOffset);
+  }
+
+  // 52 - 61: 0123456789
+  if (zero <= charCode && charCode <= nine) {
+    return (charCode - zero + numberOffset);
+  }
+
+  // 62: +
+  if (charCode == plus) {
+    return 62;
+  }
+
+  // 63: /
+  if (charCode == slash) {
+    return 63;
+  }
+
+  // Invalid base64 digit.
+  return -1;
+};
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/binary-search.js b/node_modules/mathjs/examples/node_modules/source-map/lib/binary-search.js
new file mode 100644
index 0000000..010ac94
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/binary-search.js
@@ -0,0 +1,111 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+exports.GREATEST_LOWER_BOUND = 1;
+exports.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Recursive implementation of binary search.
+ *
+ * @param aLow Indices here and lower do not contain the needle.
+ * @param aHigh Indices here and higher do not contain the needle.
+ * @param aNeedle The element being searched for.
+ * @param aHaystack The non-empty array being searched.
+ * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ */
+function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+  // This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+  if (cmp === 0) {
+    // Found the element we are looking for.
+    return mid;
+  }
+  else if (cmp > 0) {
+    // Our needle is greater than aHaystack[mid].
+    if (aHigh - mid > 1) {
+      // The element is in the upper half.
+      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // The exact needle element was not found in this haystack. Determine if
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return aHigh < aHaystack.length ? aHigh : -1;
+    } else {
+      return mid;
+    }
+  }
+  else {
+    // Our needle is less than aHaystack[mid].
+    if (mid - aLow > 1) {
+      // The element is in the lower half.
+      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return mid;
+    } else {
+      return aLow < 0 ? -1 : aLow;
+    }
+  }
+}
+
+/**
+ * This is an implementation of binary search which will always try and return
+ * the index of the closest element if there is no exact hit. This is because
+ * mappings between original and generated line/col pairs are single points,
+ * and there is an implicit region between each of them, so a miss just means
+ * that you aren't on the very start of a region.
+ *
+ * @param aNeedle The element you are looking for.
+ * @param aHaystack The array that is being searched.
+ * @param aCompare A function which takes the needle and an element in the
+ *     array and returns -1, 0, or 1 depending on whether the needle is less
+ *     than, equal to, or greater than the element, respectively.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+ */
+exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+  if (aHaystack.length === 0) {
+    return -1;
+  }
+
+  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+  if (index < 0) {
+    return -1;
+  }
+
+  // We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while (index - 1 >= 0) {
+    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+      break;
+    }
+    --index;
+  }
+
+  return index;
+};
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/mapping-list.js b/node_modules/mathjs/examples/node_modules/source-map/lib/mapping-list.js
new file mode 100644
index 0000000..06d1274
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/mapping-list.js
@@ -0,0 +1,79 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2014 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+
+/**
+ * Determine whether mappingB is after mappingA with respect to generated
+ * position.
+ */
+function generatedPositionAfter(mappingA, mappingB) {
+  // Optimized for most common case
+  var lineA = mappingA.generatedLine;
+  var lineB = mappingB.generatedLine;
+  var columnA = mappingA.generatedColumn;
+  var columnB = mappingB.generatedColumn;
+  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+}
+
+/**
+ * A data structure to provide a sorted view of accumulated mappings in a
+ * performance conscious manner. It trades a neglibable overhead in general
+ * case for a large speedup in case of mappings being added in order.
+ */
+function MappingList() {
+  this._array = [];
+  this._sorted = true;
+  // Serves as infimum
+  this._last = {generatedLine: -1, generatedColumn: 0};
+}
+
+/**
+ * Iterate through internal items. This method takes the same arguments that
+ * `Array.prototype.forEach` takes.
+ *
+ * NOTE: The order of the mappings is NOT guaranteed.
+ */
+MappingList.prototype.unsortedForEach =
+  function MappingList_forEach(aCallback, aThisArg) {
+    this._array.forEach(aCallback, aThisArg);
+  };
+
+/**
+ * Add the given source mapping.
+ *
+ * @param Object aMapping
+ */
+MappingList.prototype.add = function MappingList_add(aMapping) {
+  if (generatedPositionAfter(this._last, aMapping)) {
+    this._last = aMapping;
+    this._array.push(aMapping);
+  } else {
+    this._sorted = false;
+    this._array.push(aMapping);
+  }
+};
+
+/**
+ * Returns the flat, sorted array of mappings. The mappings are sorted by
+ * generated position.
+ *
+ * WARNING: This method returns internal data without copying, for
+ * performance. The return value must NOT be mutated, and should be treated as
+ * an immutable borrow. If you want to take ownership, you must make your own
+ * copy.
+ */
+MappingList.prototype.toArray = function MappingList_toArray() {
+  if (!this._sorted) {
+    this._array.sort(util.compareByGeneratedPositionsInflated);
+    this._sorted = true;
+  }
+  return this._array;
+};
+
+exports.MappingList = MappingList;
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/quick-sort.js b/node_modules/mathjs/examples/node_modules/source-map/lib/quick-sort.js
new file mode 100644
index 0000000..6a7caad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/quick-sort.js
@@ -0,0 +1,114 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+// It turns out that some (most?) JavaScript engines don't self-host
+// `Array.prototype.sort`. This makes sense because C++ will likely remain
+// faster than JS when doing raw CPU-intensive sorting. However, when using a
+// custom comparator function, calling back and forth between the VM's C++ and
+// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+// worse generated code for the comparator function than would be optimal. In
+// fact, when sorting with a comparator, these costs outweigh the benefits of
+// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+// a ~3500ms mean speed-up in `bench/bench.html`.
+
+/**
+ * Swap the elements indexed by `x` and `y` in the array `ary`.
+ *
+ * @param {Array} ary
+ *        The array.
+ * @param {Number} x
+ *        The index of the first item.
+ * @param {Number} y
+ *        The index of the second item.
+ */
+function swap(ary, x, y) {
+  var temp = ary[x];
+  ary[x] = ary[y];
+  ary[y] = temp;
+}
+
+/**
+ * Returns a random integer within the range `low .. high` inclusive.
+ *
+ * @param {Number} low
+ *        The lower bound on the range.
+ * @param {Number} high
+ *        The upper bound on the range.
+ */
+function randomIntInRange(low, high) {
+  return Math.round(low + (Math.random() * (high - low)));
+}
+
+/**
+ * The Quick Sort algorithm.
+ *
+ * @param {Array} ary
+ *        An array to sort.
+ * @param {function} comparator
+ *        Function to use to compare two items.
+ * @param {Number} p
+ *        Start index of the array
+ * @param {Number} r
+ *        End index of the array
+ */
+function doQuickSort(ary, comparator, p, r) {
+  // If our lower bound is less than our upper bound, we (1) partition the
+  // array into two pieces and (2) recurse on each half. If it is not, this is
+  // the empty array and our base case.
+
+  if (p < r) {
+    // (1) Partitioning.
+    //
+    // The partitioning chooses a pivot between `p` and `r` and moves all
+    // elements that are less than or equal to the pivot to the before it, and
+    // all the elements that are greater than it after it. The effect is that
+    // once partition is done, the pivot is in the exact place it will be when
+    // the array is put in sorted order, and it will not need to be moved
+    // again. This runs in O(n) time.
+
+    // Always choose a random pivot so that an input array which is reverse
+    // sorted does not cause O(n^2) running time.
+    var pivotIndex = randomIntInRange(p, r);
+    var i = p - 1;
+
+    swap(ary, pivotIndex, r);
+    var pivot = ary[r];
+
+    // Immediately after `j` is incremented in this loop, the following hold
+    // true:
+    //
+    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+    //
+    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+    for (var j = p; j < r; j++) {
+      if (comparator(ary[j], pivot) <= 0) {
+        i += 1;
+        swap(ary, i, j);
+      }
+    }
+
+    swap(ary, i + 1, j);
+    var q = i + 1;
+
+    // (2) Recurse on each half.
+
+    doQuickSort(ary, comparator, p, q - 1);
+    doQuickSort(ary, comparator, q + 1, r);
+  }
+}
+
+/**
+ * Sort the given array in-place with the given comparator function.
+ *
+ * @param {Array} ary
+ *        An array to sort.
+ * @param {function} comparator
+ *        Function to use to compare two items.
+ */
+exports.quickSort = function (ary, comparator) {
+  doQuickSort(ary, comparator, 0, ary.length - 1);
+};
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/source-map-consumer.js b/node_modules/mathjs/examples/node_modules/source-map/lib/source-map-consumer.js
new file mode 100644
index 0000000..7b99d1d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/source-map-consumer.js
@@ -0,0 +1,1145 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+var binarySearch = require('./binary-search');
+var ArraySet = require('./array-set').ArraySet;
+var base64VLQ = require('./base64-vlq');
+var quickSort = require('./quick-sort').quickSort;
+
+function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+  var sourceMap = aSourceMap;
+  if (typeof aSourceMap === 'string') {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  return sourceMap.sections != null
+    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+}
+
+SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+}
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+SourceMapConsumer.prototype._version = 3;
+
+// `__generatedMappings` and `__originalMappings` are arrays that hold the
+// parsed mapping coordinates from the source map's "mappings" attribute. They
+// are lazily instantiated, accessed via the `_generatedMappings` and
+// `_originalMappings` getters respectively, and we only parse the mappings
+// and create these arrays once queried for a source location. We jump through
+// these hoops because there can be many thousands of mappings, and parsing
+// them is expensive, so we only want to do it if we must.
+//
+// Each object in the arrays is of the form:
+//
+//     {
+//       generatedLine: The line number in the generated code,
+//       generatedColumn: The column number in the generated code,
+//       source: The path to the original source file that generated this
+//               chunk of code,
+//       originalLine: The line number in the original source that
+//                     corresponds to this chunk of generated code,
+//       originalColumn: The column number in the original source that
+//                       corresponds to this chunk of generated code,
+//       name: The name of the original symbol which generated this chunk of
+//             code.
+//     }
+//
+// All properties except for `generatedLine` and `generatedColumn` can be
+// `null`.
+//
+// `_generatedMappings` is ordered by the generated positions.
+//
+// `_originalMappings` is ordered by the original positions.
+
+SourceMapConsumer.prototype.__generatedMappings = null;
+Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
+  configurable: true,
+  enumerable: true,
+  get: function () {
+    if (!this.__generatedMappings) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__generatedMappings;
+  }
+});
+
+SourceMapConsumer.prototype.__originalMappings = null;
+Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
+  configurable: true,
+  enumerable: true,
+  get: function () {
+    if (!this.__originalMappings) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__originalMappings;
+  }
+});
+
+SourceMapConsumer.prototype._charIsMappingSeparator =
+  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+    var c = aStr.charAt(index);
+    return c === ";" || c === ",";
+  };
+
+/**
+ * Parse the mappings in a string in to a data structure which we can easily
+ * query (the ordered arrays in the `this.__generatedMappings` and
+ * `this.__originalMappings` properties).
+ */
+SourceMapConsumer.prototype._parseMappings =
+  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+    throw new Error("Subclasses must implement _parseMappings");
+  };
+
+SourceMapConsumer.GENERATED_ORDER = 1;
+SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Iterate over each mapping between an original source/line/column and a
+ * generated line/column in this source map.
+ *
+ * @param Function aCallback
+ *        The function that is called with each mapping.
+ * @param Object aContext
+ *        Optional. If specified, this object will be the value of `this` every
+ *        time that `aCallback` is called.
+ * @param aOrder
+ *        Either `SourceMapConsumer.GENERATED_ORDER` or
+ *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+ *        iterate over the mappings sorted by the generated file's line/column
+ *        order or the original's source/line/column order, respectively. Defaults to
+ *        `SourceMapConsumer.GENERATED_ORDER`.
+ */
+SourceMapConsumer.prototype.eachMapping =
+  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+    var context = aContext || null;
+    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+    var mappings;
+    switch (order) {
+    case SourceMapConsumer.GENERATED_ORDER:
+      mappings = this._generatedMappings;
+      break;
+    case SourceMapConsumer.ORIGINAL_ORDER:
+      mappings = this._originalMappings;
+      break;
+    default:
+      throw new Error("Unknown order of iteration.");
+    }
+
+    var sourceRoot = this.sourceRoot;
+    mappings.map(function (mapping) {
+      var source = mapping.source === null ? null : this._sources.at(mapping.source);
+      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+      return {
+        source: source,
+        generatedLine: mapping.generatedLine,
+        generatedColumn: mapping.generatedColumn,
+        originalLine: mapping.originalLine,
+        originalColumn: mapping.originalColumn,
+        name: mapping.name === null ? null : this._names.at(mapping.name)
+      };
+    }, this).forEach(aCallback, context);
+  };
+
+/**
+ * Returns all generated line and column information for the original source,
+ * line, and column provided. If no column is provided, returns all mappings
+ * corresponding to a either the line we are searching for or the next
+ * closest line that has any mappings. Otherwise, returns all mappings
+ * corresponding to the given line and either the column we are searching for
+ * or the next closest column that has any offsets.
+ *
+ * The only argument is an object with the following properties:
+ *
+ *   - source: The filename of the original source.
+ *   - line: The line number in the original source.  The line number is 1-based.
+ *   - column: Optional. the column number in the original source.
+ *    The column number is 0-based.
+ *
+ * and an array of objects is returned, each with the following properties:
+ *
+ *   - line: The line number in the generated source, or null.  The
+ *    line number is 1-based.
+ *   - column: The column number in the generated source, or null.
+ *    The column number is 0-based.
+ */
+SourceMapConsumer.prototype.allGeneratedPositionsFor =
+  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+    var line = util.getArg(aArgs, 'line');
+
+    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+    // returns the index of the closest mapping less than the needle. By
+    // setting needle.originalColumn to 0, we thus find the last mapping for
+    // the given line, provided such a mapping exists.
+    var needle = {
+      source: util.getArg(aArgs, 'source'),
+      originalLine: line,
+      originalColumn: util.getArg(aArgs, 'column', 0)
+    };
+
+    needle.source = this._findSourceIndex(needle.source);
+    if (needle.source < 0) {
+      return [];
+    }
+
+    var mappings = [];
+
+    var index = this._findMapping(needle,
+                                  this._originalMappings,
+                                  "originalLine",
+                                  "originalColumn",
+                                  util.compareByOriginalPositions,
+                                  binarySearch.LEAST_UPPER_BOUND);
+    if (index >= 0) {
+      var mapping = this._originalMappings[index];
+
+      if (aArgs.column === undefined) {
+        var originalLine = mapping.originalLine;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we found. Since
+        // mappings are sorted, this is guaranteed to find all mappings for
+        // the line we found.
+        while (mapping && mapping.originalLine === originalLine) {
+          mappings.push({
+            line: util.getArg(mapping, 'generatedLine', null),
+            column: util.getArg(mapping, 'generatedColumn', null),
+            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      } else {
+        var originalColumn = mapping.originalColumn;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we were searching for.
+        // Since mappings are sorted, this is guaranteed to find all mappings for
+        // the line we are searching for.
+        while (mapping &&
+               mapping.originalLine === line &&
+               mapping.originalColumn == originalColumn) {
+          mappings.push({
+            line: util.getArg(mapping, 'generatedLine', null),
+            column: util.getArg(mapping, 'generatedColumn', null),
+            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      }
+    }
+
+    return mappings;
+  };
+
+exports.SourceMapConsumer = SourceMapConsumer;
+
+/**
+ * A BasicSourceMapConsumer instance represents a parsed source map which we can
+ * query for information about the original file positions by giving it a file
+ * position in the generated source.
+ *
+ * The first parameter is the raw source map (either as a JSON string, or
+ * already parsed to an object). According to the spec, source maps have the
+ * following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - sources: An array of URLs to the original source files.
+ *   - names: An array of identifiers which can be referrenced by individual mappings.
+ *   - sourceRoot: Optional. The URL root from which all sources are relative.
+ *   - sourcesContent: Optional. An array of contents of the original source files.
+ *   - mappings: A string of base64 VLQs which contain the actual mappings.
+ *   - file: Optional. The generated file this source map is associated with.
+ *
+ * Here is an example source map, taken from the source map spec[0]:
+ *
+ *     {
+ *       version : 3,
+ *       file: "out.js",
+ *       sourceRoot : "",
+ *       sources: ["foo.js", "bar.js"],
+ *       names: ["src", "maps", "are", "fun"],
+ *       mappings: "AA,AB;;ABCDE;"
+ *     }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+ */
+function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+  var sourceMap = aSourceMap;
+  if (typeof aSourceMap === 'string') {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  var version = util.getArg(sourceMap, 'version');
+  var sources = util.getArg(sourceMap, 'sources');
+  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+  // requires the array) to play nice here.
+  var names = util.getArg(sourceMap, 'names', []);
+  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+  var mappings = util.getArg(sourceMap, 'mappings');
+  var file = util.getArg(sourceMap, 'file', null);
+
+  // Once again, Sass deviates from the spec and supplies the version as a
+  // string rather than a number, so we use loose equality checking here.
+  if (version != this._version) {
+    throw new Error('Unsupported version: ' + version);
+  }
+
+  if (sourceRoot) {
+    sourceRoot = util.normalize(sourceRoot);
+  }
+
+  sources = sources
+    .map(String)
+    // Some source maps produce relative source paths like "./foo.js" instead of
+    // "foo.js".  Normalize these first so that future comparisons will succeed.
+    // See bugzil.la/1090768.
+    .map(util.normalize)
+    // Always ensure that absolute sources are internally stored relative to
+    // the source root, if the source root is absolute. Not doing this would
+    // be particularly problematic when the source root is a prefix of the
+    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+    .map(function (source) {
+      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+        ? util.relative(sourceRoot, source)
+        : source;
+    });
+
+  // Pass `true` below to allow duplicate names and sources. While source maps
+  // are intended to be compressed and deduplicated, the TypeScript compiler
+  // sometimes generates source maps with duplicates in them. See Github issue
+  // #72 and bugzil.la/889492.
+  this._names = ArraySet.fromArray(names.map(String), true);
+  this._sources = ArraySet.fromArray(sources, true);
+
+  this._absoluteSources = this._sources.toArray().map(function (s) {
+    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+  });
+
+  this.sourceRoot = sourceRoot;
+  this.sourcesContent = sourcesContent;
+  this._mappings = mappings;
+  this._sourceMapURL = aSourceMapURL;
+  this.file = file;
+}
+
+BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+
+/**
+ * Utility function to find the index of a source.  Returns -1 if not
+ * found.
+ */
+BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+  var relativeSource = aSource;
+  if (this.sourceRoot != null) {
+    relativeSource = util.relative(this.sourceRoot, relativeSource);
+  }
+
+  if (this._sources.has(relativeSource)) {
+    return this._sources.indexOf(relativeSource);
+  }
+
+  // Maybe aSource is an absolute URL as returned by |sources|.  In
+  // this case we can't simply undo the transform.
+  var i;
+  for (i = 0; i < this._absoluteSources.length; ++i) {
+    if (this._absoluteSources[i] == aSource) {
+      return i;
+    }
+  }
+
+  return -1;
+};
+
+/**
+ * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+ *
+ * @param SourceMapGenerator aSourceMap
+ *        The source map that will be consumed.
+ * @param String aSourceMapURL
+ *        The URL at which the source map can be found (optional)
+ * @returns BasicSourceMapConsumer
+ */
+BasicSourceMapConsumer.fromSourceMap =
+  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+    var smc = Object.create(BasicSourceMapConsumer.prototype);
+
+    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);
+    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);
+    smc.sourceRoot = aSourceMap._sourceRoot;
+    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),
+                                                            smc.sourceRoot);
+    smc.file = aSourceMap._file;
+    smc._sourceMapURL = aSourceMapURL;
+    smc._absoluteSources = smc._sources.toArray().map(function (s) {
+      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+    });
+
+    // Because we are modifying the entries (by converting string sources and
+    // names to indices into the sources and names ArraySets), we have to make
+    // a copy of the entry or else bad things happen. Shared mutable state
+    // strikes again! See github issue #191.
+
+    var generatedMappings = aSourceMap._mappings.toArray().slice();
+    var destGeneratedMappings = smc.__generatedMappings = [];
+    var destOriginalMappings = smc.__originalMappings = [];
+
+    for (var i = 0, length = generatedMappings.length; i < length; i++) {
+      var srcMapping = generatedMappings[i];
+      var destMapping = new Mapping;
+      destMapping.generatedLine = srcMapping.generatedLine;
+      destMapping.generatedColumn = srcMapping.generatedColumn;
+
+      if (srcMapping.source) {
+        destMapping.source = sources.indexOf(srcMapping.source);
+        destMapping.originalLine = srcMapping.originalLine;
+        destMapping.originalColumn = srcMapping.originalColumn;
+
+        if (srcMapping.name) {
+          destMapping.name = names.indexOf(srcMapping.name);
+        }
+
+        destOriginalMappings.push(destMapping);
+      }
+
+      destGeneratedMappings.push(destMapping);
+    }
+
+    quickSort(smc.__originalMappings, util.compareByOriginalPositions);
+
+    return smc;
+  };
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+BasicSourceMapConsumer.prototype._version = 3;
+
+/**
+ * The list of original sources.
+ */
+Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {
+  get: function () {
+    return this._absoluteSources.slice();
+  }
+});
+
+/**
+ * Provide the JIT with a nice shape / hidden class.
+ */
+function Mapping() {
+  this.generatedLine = 0;
+  this.generatedColumn = 0;
+  this.source = null;
+  this.originalLine = null;
+  this.originalColumn = null;
+  this.name = null;
+}
+
+/**
+ * Parse the mappings in a string in to a data structure which we can easily
+ * query (the ordered arrays in the `this.__generatedMappings` and
+ * `this.__originalMappings` properties).
+ */
+BasicSourceMapConsumer.prototype._parseMappings =
+  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+    var generatedLine = 1;
+    var previousGeneratedColumn = 0;
+    var previousOriginalLine = 0;
+    var previousOriginalColumn = 0;
+    var previousSource = 0;
+    var previousName = 0;
+    var length = aStr.length;
+    var index = 0;
+    var cachedSegments = {};
+    var temp = {};
+    var originalMappings = [];
+    var generatedMappings = [];
+    var mapping, str, segment, end, value;
+
+    while (index < length) {
+      if (aStr.charAt(index) === ';') {
+        generatedLine++;
+        index++;
+        previousGeneratedColumn = 0;
+      }
+      else if (aStr.charAt(index) === ',') {
+        index++;
+      }
+      else {
+        mapping = new Mapping();
+        mapping.generatedLine = generatedLine;
+
+        // Because each offset is encoded relative to the previous one,
+        // many segments often have the same encoding. We can exploit this
+        // fact by caching the parsed variable length fields of each segment,
+        // allowing us to avoid a second parse if we encounter the same
+        // segment again.
+        for (end = index; end < length; end++) {
+          if (this._charIsMappingSeparator(aStr, end)) {
+            break;
+          }
+        }
+        str = aStr.slice(index, end);
+
+        segment = cachedSegments[str];
+        if (segment) {
+          index += str.length;
+        } else {
+          segment = [];
+          while (index < end) {
+            base64VLQ.decode(aStr, index, temp);
+            value = temp.value;
+            index = temp.rest;
+            segment.push(value);
+          }
+
+          if (segment.length === 2) {
+            throw new Error('Found a source, but no line and column');
+          }
+
+          if (segment.length === 3) {
+            throw new Error('Found a source and line, but no column');
+          }
+
+          cachedSegments[str] = segment;
+        }
+
+        // Generated column.
+        mapping.generatedColumn = previousGeneratedColumn + segment[0];
+        previousGeneratedColumn = mapping.generatedColumn;
+
+        if (segment.length > 1) {
+          // Original source.
+          mapping.source = previousSource + segment[1];
+          previousSource += segment[1];
+
+          // Original line.
+          mapping.originalLine = previousOriginalLine + segment[2];
+          previousOriginalLine = mapping.originalLine;
+          // Lines are stored 0-based
+          mapping.originalLine += 1;
+
+          // Original column.
+          mapping.originalColumn = previousOriginalColumn + segment[3];
+          previousOriginalColumn = mapping.originalColumn;
+
+          if (segment.length > 4) {
+            // Original name.
+            mapping.name = previousName + segment[4];
+            previousName += segment[4];
+          }
+        }
+
+        generatedMappings.push(mapping);
+        if (typeof mapping.originalLine === 'number') {
+          originalMappings.push(mapping);
+        }
+      }
+    }
+
+    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);
+    this.__generatedMappings = generatedMappings;
+
+    quickSort(originalMappings, util.compareByOriginalPositions);
+    this.__originalMappings = originalMappings;
+  };
+
+/**
+ * Find the mapping that best matches the hypothetical "needle" mapping that
+ * we are searching for in the given "haystack" of mappings.
+ */
+BasicSourceMapConsumer.prototype._findMapping =
+  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
+                                         aColumnName, aComparator, aBias) {
+    // To return the position we are searching for, we must first find the
+    // mapping for the given position and then return the opposite position it
+    // points to. Because the mappings are sorted, we can use binary search to
+    // find the best mapping.
+
+    if (aNeedle[aLineName] <= 0) {
+      throw new TypeError('Line must be greater than or equal to 1, got '
+                          + aNeedle[aLineName]);
+    }
+    if (aNeedle[aColumnName] < 0) {
+      throw new TypeError('Column must be greater than or equal to 0, got '
+                          + aNeedle[aColumnName]);
+    }
+
+    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+  };
+
+/**
+ * Compute the last column for each generated mapping. The last column is
+ * inclusive.
+ */
+BasicSourceMapConsumer.prototype.computeColumnSpans =
+  function SourceMapConsumer_computeColumnSpans() {
+    for (var index = 0; index < this._generatedMappings.length; ++index) {
+      var mapping = this._generatedMappings[index];
+
+      // Mappings do not contain a field for the last generated columnt. We
+      // can come up with an optimistic estimate, however, by assuming that
+      // mappings are contiguous (i.e. given two consecutive mappings, the
+      // first mapping ends where the second one starts).
+      if (index + 1 < this._generatedMappings.length) {
+        var nextMapping = this._generatedMappings[index + 1];
+
+        if (mapping.generatedLine === nextMapping.generatedLine) {
+          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+          continue;
+        }
+      }
+
+      // The last mapping for each line spans the entire line.
+      mapping.lastGeneratedColumn = Infinity;
+    }
+  };
+
+/**
+ * Returns the original source, line, and column information for the generated
+ * source's line and column positions provided. The only argument is an object
+ * with the following properties:
+ *
+ *   - line: The line number in the generated source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the generated source.  The column
+ *     number is 0-based.
+ *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+ *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - source: The original source file, or null.
+ *   - line: The line number in the original source, or null.  The
+ *     line number is 1-based.
+ *   - column: The column number in the original source, or null.  The
+ *     column number is 0-based.
+ *   - name: The original identifier, or null.
+ */
+BasicSourceMapConsumer.prototype.originalPositionFor =
+  function SourceMapConsumer_originalPositionFor(aArgs) {
+    var needle = {
+      generatedLine: util.getArg(aArgs, 'line'),
+      generatedColumn: util.getArg(aArgs, 'column')
+    };
+
+    var index = this._findMapping(
+      needle,
+      this._generatedMappings,
+      "generatedLine",
+      "generatedColumn",
+      util.compareByGeneratedPositionsDeflated,
+      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+    );
+
+    if (index >= 0) {
+      var mapping = this._generatedMappings[index];
+
+      if (mapping.generatedLine === needle.generatedLine) {
+        var source = util.getArg(mapping, 'source', null);
+        if (source !== null) {
+          source = this._sources.at(source);
+          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+        }
+        var name = util.getArg(mapping, 'name', null);
+        if (name !== null) {
+          name = this._names.at(name);
+        }
+        return {
+          source: source,
+          line: util.getArg(mapping, 'originalLine', null),
+          column: util.getArg(mapping, 'originalColumn', null),
+          name: name
+        };
+      }
+    }
+
+    return {
+      source: null,
+      line: null,
+      column: null,
+      name: null
+    };
+  };
+
+/**
+ * Return true if we have the source content for every source in the source
+ * map, false otherwise.
+ */
+BasicSourceMapConsumer.prototype.hasContentsOfAllSources =
+  function BasicSourceMapConsumer_hasContentsOfAllSources() {
+    if (!this.sourcesContent) {
+      return false;
+    }
+    return this.sourcesContent.length >= this._sources.size() &&
+      !this.sourcesContent.some(function (sc) { return sc == null; });
+  };
+
+/**
+ * Returns the original source content. The only argument is the url of the
+ * original source file. Returns null if no original source content is
+ * available.
+ */
+BasicSourceMapConsumer.prototype.sourceContentFor =
+  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+    if (!this.sourcesContent) {
+      return null;
+    }
+
+    var index = this._findSourceIndex(aSource);
+    if (index >= 0) {
+      return this.sourcesContent[index];
+    }
+
+    var relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    var url;
+    if (this.sourceRoot != null
+        && (url = util.urlParse(this.sourceRoot))) {
+      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+      // many users. We can help them out when they expect file:// URIs to
+      // behave like it would if they were running a local HTTP server. See
+      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+      var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+      if (url.scheme == "file"
+          && this._sources.has(fileUriAbsPath)) {
+        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]
+      }
+
+      if ((!url.path || url.path == "/")
+          && this._sources.has("/" + relativeSource)) {
+        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+      }
+    }
+
+    // This function is used recursively from
+    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+    // don't want to throw if we can't find the source - we just want to
+    // return null, so we provide a flag to exit gracefully.
+    if (nullOnMissing) {
+      return null;
+    }
+    else {
+      throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+    }
+  };
+
+/**
+ * Returns the generated line and column information for the original source,
+ * line, and column positions provided. The only argument is an object with
+ * the following properties:
+ *
+ *   - source: The filename of the original source.
+ *   - line: The line number in the original source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the original source.  The column
+ *     number is 0-based.
+ *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+ *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - line: The line number in the generated source, or null.  The
+ *     line number is 1-based.
+ *   - column: The column number in the generated source, or null.
+ *     The column number is 0-based.
+ */
+BasicSourceMapConsumer.prototype.generatedPositionFor =
+  function SourceMapConsumer_generatedPositionFor(aArgs) {
+    var source = util.getArg(aArgs, 'source');
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return {
+        line: null,
+        column: null,
+        lastColumn: null
+      };
+    }
+
+    var needle = {
+      source: source,
+      originalLine: util.getArg(aArgs, 'line'),
+      originalColumn: util.getArg(aArgs, 'column')
+    };
+
+    var index = this._findMapping(
+      needle,
+      this._originalMappings,
+      "originalLine",
+      "originalColumn",
+      util.compareByOriginalPositions,
+      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+    );
+
+    if (index >= 0) {
+      var mapping = this._originalMappings[index];
+
+      if (mapping.source === needle.source) {
+        return {
+          line: util.getArg(mapping, 'generatedLine', null),
+          column: util.getArg(mapping, 'generatedColumn', null),
+          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+        };
+      }
+    }
+
+    return {
+      line: null,
+      column: null,
+      lastColumn: null
+    };
+  };
+
+exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+/**
+ * An IndexedSourceMapConsumer instance represents a parsed source map which
+ * we can query for information. It differs from BasicSourceMapConsumer in
+ * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+ * input.
+ *
+ * The first parameter is a raw source map (either as a JSON string, or already
+ * parsed to an object). According to the spec for indexed source maps, they
+ * have the following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - file: Optional. The generated file this source map is associated with.
+ *   - sections: A list of section definitions.
+ *
+ * Each value under the "sections" field has two fields:
+ *   - offset: The offset into the original specified at which this section
+ *       begins to apply, defined as an object with a "line" and "column"
+ *       field.
+ *   - map: A source map definition. This source map could also be indexed,
+ *       but doesn't have to be.
+ *
+ * Instead of the "map" field, it's also possible to have a "url" field
+ * specifying a URL to retrieve a source map from, but that's currently
+ * unsupported.
+ *
+ * Here's an example source map, taken from the source map spec[0], but
+ * modified to omit a section which uses the "url" field.
+ *
+ *  {
+ *    version : 3,
+ *    file: "app.js",
+ *    sections: [{
+ *      offset: {line:100, column:10},
+ *      map: {
+ *        version : 3,
+ *        file: "section.js",
+ *        sources: ["foo.js", "bar.js"],
+ *        names: ["src", "maps", "are", "fun"],
+ *        mappings: "AAAA,E;;ABCDE;"
+ *      }
+ *    }],
+ *  }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+ */
+function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+  var sourceMap = aSourceMap;
+  if (typeof aSourceMap === 'string') {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  var version = util.getArg(sourceMap, 'version');
+  var sections = util.getArg(sourceMap, 'sections');
+
+  if (version != this._version) {
+    throw new Error('Unsupported version: ' + version);
+  }
+
+  this._sources = new ArraySet();
+  this._names = new ArraySet();
+
+  var lastOffset = {
+    line: -1,
+    column: 0
+  };
+  this._sections = sections.map(function (s) {
+    if (s.url) {
+      // The url field will require support for asynchronicity.
+      // See https://github.com/mozilla/source-map/issues/16
+      throw new Error('Support for url field in sections not implemented.');
+    }
+    var offset = util.getArg(s, 'offset');
+    var offsetLine = util.getArg(offset, 'line');
+    var offsetColumn = util.getArg(offset, 'column');
+
+    if (offsetLine < lastOffset.line ||
+        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+      throw new Error('Section offsets must be ordered and non-overlapping.');
+    }
+    lastOffset = offset;
+
+    return {
+      generatedOffset: {
+        // The offset fields are 0-based, but we use 1-based indices when
+        // encoding/decoding from VLQ.
+        generatedLine: offsetLine + 1,
+        generatedColumn: offsetColumn + 1
+      },
+      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
+    }
+  });
+}
+
+IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+IndexedSourceMapConsumer.prototype._version = 3;
+
+/**
+ * The list of original sources.
+ */
+Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
+  get: function () {
+    var sources = [];
+    for (var i = 0; i < this._sections.length; i++) {
+      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {
+        sources.push(this._sections[i].consumer.sources[j]);
+      }
+    }
+    return sources;
+  }
+});
+
+/**
+ * Returns the original source, line, and column information for the generated
+ * source's line and column positions provided. The only argument is an object
+ * with the following properties:
+ *
+ *   - line: The line number in the generated source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the generated source.  The column
+ *     number is 0-based.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - source: The original source file, or null.
+ *   - line: The line number in the original source, or null.  The
+ *     line number is 1-based.
+ *   - column: The column number in the original source, or null.  The
+ *     column number is 0-based.
+ *   - name: The original identifier, or null.
+ */
+IndexedSourceMapConsumer.prototype.originalPositionFor =
+  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+    var needle = {
+      generatedLine: util.getArg(aArgs, 'line'),
+      generatedColumn: util.getArg(aArgs, 'column')
+    };
+
+    // Find the section containing the generated position we're trying to map
+    // to an original position.
+    var sectionIndex = binarySearch.search(needle, this._sections,
+      function(needle, section) {
+        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+        if (cmp) {
+          return cmp;
+        }
+
+        return (needle.generatedColumn -
+                section.generatedOffset.generatedColumn);
+      });
+    var section = this._sections[sectionIndex];
+
+    if (!section) {
+      return {
+        source: null,
+        line: null,
+        column: null,
+        name: null
+      };
+    }
+
+    return section.consumer.originalPositionFor({
+      line: needle.generatedLine -
+        (section.generatedOffset.generatedLine - 1),
+      column: needle.generatedColumn -
+        (section.generatedOffset.generatedLine === needle.generatedLine
+         ? section.generatedOffset.generatedColumn - 1
+         : 0),
+      bias: aArgs.bias
+    });
+  };
+
+/**
+ * Return true if we have the source content for every source in the source
+ * map, false otherwise.
+ */
+IndexedSourceMapConsumer.prototype.hasContentsOfAllSources =
+  function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+    return this._sections.every(function (s) {
+      return s.consumer.hasContentsOfAllSources();
+    });
+  };
+
+/**
+ * Returns the original source content. The only argument is the url of the
+ * original source file. Returns null if no original source content is
+ * available.
+ */
+IndexedSourceMapConsumer.prototype.sourceContentFor =
+  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+    for (var i = 0; i < this._sections.length; i++) {
+      var section = this._sections[i];
+
+      var content = section.consumer.sourceContentFor(aSource, true);
+      if (content) {
+        return content;
+      }
+    }
+    if (nullOnMissing) {
+      return null;
+    }
+    else {
+      throw new Error('"' + aSource + '" is not in the SourceMap.');
+    }
+  };
+
+/**
+ * Returns the generated line and column information for the original source,
+ * line, and column positions provided. The only argument is an object with
+ * the following properties:
+ *
+ *   - source: The filename of the original source.
+ *   - line: The line number in the original source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the original source.  The column
+ *     number is 0-based.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - line: The line number in the generated source, or null.  The
+ *     line number is 1-based. 
+ *   - column: The column number in the generated source, or null.
+ *     The column number is 0-based.
+ */
+IndexedSourceMapConsumer.prototype.generatedPositionFor =
+  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+    for (var i = 0; i < this._sections.length; i++) {
+      var section = this._sections[i];
+
+      // Only consider this section if the requested source is in the list of
+      // sources of the consumer.
+      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
+        continue;
+      }
+      var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+      if (generatedPosition) {
+        var ret = {
+          line: generatedPosition.line +
+            (section.generatedOffset.generatedLine - 1),
+          column: generatedPosition.column +
+            (section.generatedOffset.generatedLine === generatedPosition.line
+             ? section.generatedOffset.generatedColumn - 1
+             : 0)
+        };
+        return ret;
+      }
+    }
+
+    return {
+      line: null,
+      column: null
+    };
+  };
+
+/**
+ * Parse the mappings in a string in to a data structure which we can easily
+ * query (the ordered arrays in the `this.__generatedMappings` and
+ * `this.__originalMappings` properties).
+ */
+IndexedSourceMapConsumer.prototype._parseMappings =
+  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+    this.__generatedMappings = [];
+    this.__originalMappings = [];
+    for (var i = 0; i < this._sections.length; i++) {
+      var section = this._sections[i];
+      var sectionMappings = section.consumer._generatedMappings;
+      for (var j = 0; j < sectionMappings.length; j++) {
+        var mapping = sectionMappings[j];
+
+        var source = section.consumer._sources.at(mapping.source);
+        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+        this._sources.add(source);
+        source = this._sources.indexOf(source);
+
+        var name = null;
+        if (mapping.name) {
+          name = section.consumer._names.at(mapping.name);
+          this._names.add(name);
+          name = this._names.indexOf(name);
+        }
+
+        // The mappings coming from the consumer for the section have
+        // generated positions relative to the start of the section, so we
+        // need to offset them to be relative to the start of the concatenated
+        // generated file.
+        var adjustedMapping = {
+          source: source,
+          generatedLine: mapping.generatedLine +
+            (section.generatedOffset.generatedLine - 1),
+          generatedColumn: mapping.generatedColumn +
+            (section.generatedOffset.generatedLine === mapping.generatedLine
+            ? section.generatedOffset.generatedColumn - 1
+            : 0),
+          originalLine: mapping.originalLine,
+          originalColumn: mapping.originalColumn,
+          name: name
+        };
+
+        this.__generatedMappings.push(adjustedMapping);
+        if (typeof adjustedMapping.originalLine === 'number') {
+          this.__originalMappings.push(adjustedMapping);
+        }
+      }
+    }
+
+    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+    quickSort(this.__originalMappings, util.compareByOriginalPositions);
+  };
+
+exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/source-map-generator.js b/node_modules/mathjs/examples/node_modules/source-map/lib/source-map-generator.js
new file mode 100644
index 0000000..508bcfb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/source-map-generator.js
@@ -0,0 +1,425 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var base64VLQ = require('./base64-vlq');
+var util = require('./util');
+var ArraySet = require('./array-set').ArraySet;
+var MappingList = require('./mapping-list').MappingList;
+
+/**
+ * An instance of the SourceMapGenerator represents a source map which is
+ * being built incrementally. You may pass an object with the following
+ * properties:
+ *
+ *   - file: The filename of the generated source.
+ *   - sourceRoot: A root for all relative URLs in this source map.
+ */
+function SourceMapGenerator(aArgs) {
+  if (!aArgs) {
+    aArgs = {};
+  }
+  this._file = util.getArg(aArgs, 'file', null);
+  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+  this._sources = new ArraySet();
+  this._names = new ArraySet();
+  this._mappings = new MappingList();
+  this._sourcesContents = null;
+}
+
+SourceMapGenerator.prototype._version = 3;
+
+/**
+ * Creates a new SourceMapGenerator based on a SourceMapConsumer
+ *
+ * @param aSourceMapConsumer The SourceMap.
+ */
+SourceMapGenerator.fromSourceMap =
+  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+    var sourceRoot = aSourceMapConsumer.sourceRoot;
+    var generator = new SourceMapGenerator({
+      file: aSourceMapConsumer.file,
+      sourceRoot: sourceRoot
+    });
+    aSourceMapConsumer.eachMapping(function (mapping) {
+      var newMapping = {
+        generated: {
+          line: mapping.generatedLine,
+          column: mapping.generatedColumn
+        }
+      };
+
+      if (mapping.source != null) {
+        newMapping.source = mapping.source;
+        if (sourceRoot != null) {
+          newMapping.source = util.relative(sourceRoot, newMapping.source);
+        }
+
+        newMapping.original = {
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        };
+
+        if (mapping.name != null) {
+          newMapping.name = mapping.name;
+        }
+      }
+
+      generator.addMapping(newMapping);
+    });
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var sourceRelative = sourceFile;
+      if (sourceRoot !== null) {
+        sourceRelative = util.relative(sourceRoot, sourceFile);
+      }
+
+      if (!generator._sources.has(sourceRelative)) {
+        generator._sources.add(sourceRelative);
+      }
+
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        generator.setSourceContent(sourceFile, content);
+      }
+    });
+    return generator;
+  };
+
+/**
+ * Add a single mapping from original source line and column to the generated
+ * source's line and column for this source map being created. The mapping
+ * object should have the following properties:
+ *
+ *   - generated: An object with the generated line and column positions.
+ *   - original: An object with the original line and column positions.
+ *   - source: The original source file (relative to the sourceRoot).
+ *   - name: An optional original token name for this mapping.
+ */
+SourceMapGenerator.prototype.addMapping =
+  function SourceMapGenerator_addMapping(aArgs) {
+    var generated = util.getArg(aArgs, 'generated');
+    var original = util.getArg(aArgs, 'original', null);
+    var source = util.getArg(aArgs, 'source', null);
+    var name = util.getArg(aArgs, 'name', null);
+
+    if (!this._skipValidation) {
+      this._validateMapping(generated, original, source, name);
+    }
+
+    if (source != null) {
+      source = String(source);
+      if (!this._sources.has(source)) {
+        this._sources.add(source);
+      }
+    }
+
+    if (name != null) {
+      name = String(name);
+      if (!this._names.has(name)) {
+        this._names.add(name);
+      }
+    }
+
+    this._mappings.add({
+      generatedLine: generated.line,
+      generatedColumn: generated.column,
+      originalLine: original != null && original.line,
+      originalColumn: original != null && original.column,
+      source: source,
+      name: name
+    });
+  };
+
+/**
+ * Set the source content for a source file.
+ */
+SourceMapGenerator.prototype.setSourceContent =
+  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+    var source = aSourceFile;
+    if (this._sourceRoot != null) {
+      source = util.relative(this._sourceRoot, source);
+    }
+
+    if (aSourceContent != null) {
+      // Add the source content to the _sourcesContents map.
+      // Create a new _sourcesContents map if the property is null.
+      if (!this._sourcesContents) {
+        this._sourcesContents = Object.create(null);
+      }
+      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+    } else if (this._sourcesContents) {
+      // Remove the source file from the _sourcesContents map.
+      // If the _sourcesContents map is empty, set the property to null.
+      delete this._sourcesContents[util.toSetString(source)];
+      if (Object.keys(this._sourcesContents).length === 0) {
+        this._sourcesContents = null;
+      }
+    }
+  };
+
+/**
+ * Applies the mappings of a sub-source-map for a specific source file to the
+ * source map being generated. Each mapping to the supplied source file is
+ * rewritten using the supplied source map. Note: The resolution for the
+ * resulting mappings is the minimium of this map and the supplied map.
+ *
+ * @param aSourceMapConsumer The source map to be applied.
+ * @param aSourceFile Optional. The filename of the source file.
+ *        If omitted, SourceMapConsumer's file property will be used.
+ * @param aSourceMapPath Optional. The dirname of the path to the source map
+ *        to be applied. If relative, it is relative to the SourceMapConsumer.
+ *        This parameter is needed when the two source maps aren't in the same
+ *        directory, and the source map to be applied contains relative source
+ *        paths. If so, those relative source paths need to be rewritten
+ *        relative to the SourceMapGenerator.
+ */
+SourceMapGenerator.prototype.applySourceMap =
+  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+    var sourceFile = aSourceFile;
+    // If aSourceFile is omitted, we will use the file property of the SourceMap
+    if (aSourceFile == null) {
+      if (aSourceMapConsumer.file == null) {
+        throw new Error(
+          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+          'or the source map\'s "file" property. Both were omitted.'
+        );
+      }
+      sourceFile = aSourceMapConsumer.file;
+    }
+    var sourceRoot = this._sourceRoot;
+    // Make "sourceFile" relative if an absolute Url is passed.
+    if (sourceRoot != null) {
+      sourceFile = util.relative(sourceRoot, sourceFile);
+    }
+    // Applying the SourceMap can add and remove items from the sources and
+    // the names array.
+    var newSources = new ArraySet();
+    var newNames = new ArraySet();
+
+    // Find mappings for the "sourceFile"
+    this._mappings.unsortedForEach(function (mapping) {
+      if (mapping.source === sourceFile && mapping.originalLine != null) {
+        // Check if it can be mapped by the source map, then update the mapping.
+        var original = aSourceMapConsumer.originalPositionFor({
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        });
+        if (original.source != null) {
+          // Copy mapping
+          mapping.source = original.source;
+          if (aSourceMapPath != null) {
+            mapping.source = util.join(aSourceMapPath, mapping.source)
+          }
+          if (sourceRoot != null) {
+            mapping.source = util.relative(sourceRoot, mapping.source);
+          }
+          mapping.originalLine = original.line;
+          mapping.originalColumn = original.column;
+          if (original.name != null) {
+            mapping.name = original.name;
+          }
+        }
+      }
+
+      var source = mapping.source;
+      if (source != null && !newSources.has(source)) {
+        newSources.add(source);
+      }
+
+      var name = mapping.name;
+      if (name != null && !newNames.has(name)) {
+        newNames.add(name);
+      }
+
+    }, this);
+    this._sources = newSources;
+    this._names = newNames;
+
+    // Copy sourcesContents of applied map.
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aSourceMapPath != null) {
+          sourceFile = util.join(aSourceMapPath, sourceFile);
+        }
+        if (sourceRoot != null) {
+          sourceFile = util.relative(sourceRoot, sourceFile);
+        }
+        this.setSourceContent(sourceFile, content);
+      }
+    }, this);
+  };
+
+/**
+ * A mapping can have one of the three levels of data:
+ *
+ *   1. Just the generated position.
+ *   2. The Generated position, original position, and original source.
+ *   3. Generated and original position, original source, as well as a name
+ *      token.
+ *
+ * To maintain consistency, we validate that any new mapping being added falls
+ * in to one of these categories.
+ */
+SourceMapGenerator.prototype._validateMapping =
+  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+                                              aName) {
+    // When aOriginal is truthy but has empty values for .line and .column,
+    // it is most likely a programmer error. In this case we throw a very
+    // specific error message to try to guide them the right way.
+    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+        throw new Error(
+            'original.line and original.column are not numbers -- you probably meant to omit ' +
+            'the original mapping entirely and only map the generated position. If so, pass ' +
+            'null for the original mapping instead of an object with empty or null values.'
+        );
+    }
+
+    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+        && aGenerated.line > 0 && aGenerated.column >= 0
+        && !aOriginal && !aSource && !aName) {
+      // Case 1.
+      return;
+    }
+    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+             && aGenerated.line > 0 && aGenerated.column >= 0
+             && aOriginal.line > 0 && aOriginal.column >= 0
+             && aSource) {
+      // Cases 2 and 3.
+      return;
+    }
+    else {
+      throw new Error('Invalid mapping: ' + JSON.stringify({
+        generated: aGenerated,
+        source: aSource,
+        original: aOriginal,
+        name: aName
+      }));
+    }
+  };
+
+/**
+ * Serialize the accumulated mappings in to the stream of base 64 VLQs
+ * specified by the source map format.
+ */
+SourceMapGenerator.prototype._serializeMappings =
+  function SourceMapGenerator_serializeMappings() {
+    var previousGeneratedColumn = 0;
+    var previousGeneratedLine = 1;
+    var previousOriginalColumn = 0;
+    var previousOriginalLine = 0;
+    var previousName = 0;
+    var previousSource = 0;
+    var result = '';
+    var next;
+    var mapping;
+    var nameIdx;
+    var sourceIdx;
+
+    var mappings = this._mappings.toArray();
+    for (var i = 0, len = mappings.length; i < len; i++) {
+      mapping = mappings[i];
+      next = ''
+
+      if (mapping.generatedLine !== previousGeneratedLine) {
+        previousGeneratedColumn = 0;
+        while (mapping.generatedLine !== previousGeneratedLine) {
+          next += ';';
+          previousGeneratedLine++;
+        }
+      }
+      else {
+        if (i > 0) {
+          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+            continue;
+          }
+          next += ',';
+        }
+      }
+
+      next += base64VLQ.encode(mapping.generatedColumn
+                                 - previousGeneratedColumn);
+      previousGeneratedColumn = mapping.generatedColumn;
+
+      if (mapping.source != null) {
+        sourceIdx = this._sources.indexOf(mapping.source);
+        next += base64VLQ.encode(sourceIdx - previousSource);
+        previousSource = sourceIdx;
+
+        // lines are stored 0-based in SourceMap spec version 3
+        next += base64VLQ.encode(mapping.originalLine - 1
+                                   - previousOriginalLine);
+        previousOriginalLine = mapping.originalLine - 1;
+
+        next += base64VLQ.encode(mapping.originalColumn
+                                   - previousOriginalColumn);
+        previousOriginalColumn = mapping.originalColumn;
+
+        if (mapping.name != null) {
+          nameIdx = this._names.indexOf(mapping.name);
+          next += base64VLQ.encode(nameIdx - previousName);
+          previousName = nameIdx;
+        }
+      }
+
+      result += next;
+    }
+
+    return result;
+  };
+
+SourceMapGenerator.prototype._generateSourcesContent =
+  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+    return aSources.map(function (source) {
+      if (!this._sourcesContents) {
+        return null;
+      }
+      if (aSourceRoot != null) {
+        source = util.relative(aSourceRoot, source);
+      }
+      var key = util.toSetString(source);
+      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+        ? this._sourcesContents[key]
+        : null;
+    }, this);
+  };
+
+/**
+ * Externalize the source map.
+ */
+SourceMapGenerator.prototype.toJSON =
+  function SourceMapGenerator_toJSON() {
+    var map = {
+      version: this._version,
+      sources: this._sources.toArray(),
+      names: this._names.toArray(),
+      mappings: this._serializeMappings()
+    };
+    if (this._file != null) {
+      map.file = this._file;
+    }
+    if (this._sourceRoot != null) {
+      map.sourceRoot = this._sourceRoot;
+    }
+    if (this._sourcesContents) {
+      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+    }
+
+    return map;
+  };
+
+/**
+ * Render the source map being generated to a string.
+ */
+SourceMapGenerator.prototype.toString =
+  function SourceMapGenerator_toString() {
+    return JSON.stringify(this.toJSON());
+  };
+
+exports.SourceMapGenerator = SourceMapGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/source-node.js b/node_modules/mathjs/examples/node_modules/source-map/lib/source-node.js
new file mode 100644
index 0000000..8bcdbe3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/source-node.js
@@ -0,0 +1,413 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;
+var util = require('./util');
+
+// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+// operating systems these days (capturing the result).
+var REGEX_NEWLINE = /(\r?\n)/;
+
+// Newline character code for charCodeAt() comparisons
+var NEWLINE_CODE = 10;
+
+// Private symbol for identifying `SourceNode`s when multiple versions of
+// the source-map library are loaded. This MUST NOT CHANGE across
+// versions!
+var isSourceNode = "$$$isSourceNode$$$";
+
+/**
+ * SourceNodes provide a way to abstract over interpolating/concatenating
+ * snippets of generated JavaScript source code while maintaining the line and
+ * column information associated with the original source code.
+ *
+ * @param aLine The original line number.
+ * @param aColumn The original column number.
+ * @param aSource The original source's filename.
+ * @param aChunks Optional. An array of strings which are snippets of
+ *        generated JS, or other SourceNodes.
+ * @param aName The original identifier.
+ */
+function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+  this.children = [];
+  this.sourceContents = {};
+  this.line = aLine == null ? null : aLine;
+  this.column = aColumn == null ? null : aColumn;
+  this.source = aSource == null ? null : aSource;
+  this.name = aName == null ? null : aName;
+  this[isSourceNode] = true;
+  if (aChunks != null) this.add(aChunks);
+}
+
+/**
+ * Creates a SourceNode from generated code and a SourceMapConsumer.
+ *
+ * @param aGeneratedCode The generated code
+ * @param aSourceMapConsumer The SourceMap for the generated code
+ * @param aRelativePath Optional. The path that relative sources in the
+ *        SourceMapConsumer should be relative to.
+ */
+SourceNode.fromStringWithSourceMap =
+  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+    // The SourceNode we want to fill with the generated code
+    // and the SourceMap
+    var node = new SourceNode();
+
+    // All even indices of this array are one line of the generated code,
+    // while all odd indices are the newlines between two adjacent lines
+    // (since `REGEX_NEWLINE` captures its match).
+    // Processed fragments are accessed by calling `shiftNextLine`.
+    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+    var remainingLinesIndex = 0;
+    var shiftNextLine = function() {
+      var lineContents = getNextLine();
+      // The last line of a file might not have a newline.
+      var newLine = getNextLine() || "";
+      return lineContents + newLine;
+
+      function getNextLine() {
+        return remainingLinesIndex < remainingLines.length ?
+            remainingLines[remainingLinesIndex++] : undefined;
+      }
+    };
+
+    // We need to remember the position of "remainingLines"
+    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+    // The generate SourceNodes we need a code range.
+    // To extract it current and last mapping is used.
+    // Here we store the last mapping.
+    var lastMapping = null;
+
+    aSourceMapConsumer.eachMapping(function (mapping) {
+      if (lastMapping !== null) {
+        // We add the code from "lastMapping" to "mapping":
+        // First check if there is a new line in between.
+        if (lastGeneratedLine < mapping.generatedLine) {
+          // Associate first line with "lastMapping"
+          addMappingWithCode(lastMapping, shiftNextLine());
+          lastGeneratedLine++;
+          lastGeneratedColumn = 0;
+          // The remaining code is added without mapping
+        } else {
+          // There is no new line in between.
+          // Associate the code between "lastGeneratedColumn" and
+          // "mapping.generatedColumn" with "lastMapping"
+          var nextLine = remainingLines[remainingLinesIndex] || '';
+          var code = nextLine.substr(0, mapping.generatedColumn -
+                                        lastGeneratedColumn);
+          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+                                              lastGeneratedColumn);
+          lastGeneratedColumn = mapping.generatedColumn;
+          addMappingWithCode(lastMapping, code);
+          // No more remaining code, continue
+          lastMapping = mapping;
+          return;
+        }
+      }
+      // We add the generated code until the first mapping
+      // to the SourceNode without any mapping.
+      // Each line is added as separate string.
+      while (lastGeneratedLine < mapping.generatedLine) {
+        node.add(shiftNextLine());
+        lastGeneratedLine++;
+      }
+      if (lastGeneratedColumn < mapping.generatedColumn) {
+        var nextLine = remainingLines[remainingLinesIndex] || '';
+        node.add(nextLine.substr(0, mapping.generatedColumn));
+        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+        lastGeneratedColumn = mapping.generatedColumn;
+      }
+      lastMapping = mapping;
+    }, this);
+    // We have processed all mappings.
+    if (remainingLinesIndex < remainingLines.length) {
+      if (lastMapping) {
+        // Associate the remaining code in the current line with "lastMapping"
+        addMappingWithCode(lastMapping, shiftNextLine());
+      }
+      // and add the remaining lines without any mapping
+      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+    }
+
+    // Copy sourcesContent into SourceNode
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aRelativePath != null) {
+          sourceFile = util.join(aRelativePath, sourceFile);
+        }
+        node.setSourceContent(sourceFile, content);
+      }
+    });
+
+    return node;
+
+    function addMappingWithCode(mapping, code) {
+      if (mapping === null || mapping.source === undefined) {
+        node.add(code);
+      } else {
+        var source = aRelativePath
+          ? util.join(aRelativePath, mapping.source)
+          : mapping.source;
+        node.add(new SourceNode(mapping.originalLine,
+                                mapping.originalColumn,
+                                source,
+                                code,
+                                mapping.name));
+      }
+    }
+  };
+
+/**
+ * Add a chunk of generated JS to this source node.
+ *
+ * @param aChunk A string snippet of generated JS code, another instance of
+ *        SourceNode, or an array where each member is one of those things.
+ */
+SourceNode.prototype.add = function SourceNode_add(aChunk) {
+  if (Array.isArray(aChunk)) {
+    aChunk.forEach(function (chunk) {
+      this.add(chunk);
+    }, this);
+  }
+  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+    if (aChunk) {
+      this.children.push(aChunk);
+    }
+  }
+  else {
+    throw new TypeError(
+      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+    );
+  }
+  return this;
+};
+
+/**
+ * Add a chunk of generated JS to the beginning of this source node.
+ *
+ * @param aChunk A string snippet of generated JS code, another instance of
+ *        SourceNode, or an array where each member is one of those things.
+ */
+SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+  if (Array.isArray(aChunk)) {
+    for (var i = aChunk.length-1; i >= 0; i--) {
+      this.prepend(aChunk[i]);
+    }
+  }
+  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+    this.children.unshift(aChunk);
+  }
+  else {
+    throw new TypeError(
+      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+    );
+  }
+  return this;
+};
+
+/**
+ * Walk over the tree of JS snippets in this node and its children. The
+ * walking function is called once for each snippet of JS and is passed that
+ * snippet and the its original associated source's line/column location.
+ *
+ * @param aFn The traversal function.
+ */
+SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+  var chunk;
+  for (var i = 0, len = this.children.length; i < len; i++) {
+    chunk = this.children[i];
+    if (chunk[isSourceNode]) {
+      chunk.walk(aFn);
+    }
+    else {
+      if (chunk !== '') {
+        aFn(chunk, { source: this.source,
+                     line: this.line,
+                     column: this.column,
+                     name: this.name });
+      }
+    }
+  }
+};
+
+/**
+ * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+ * each of `this.children`.
+ *
+ * @param aSep The separator.
+ */
+SourceNode.prototype.join = function SourceNode_join(aSep) {
+  var newChildren;
+  var i;
+  var len = this.children.length;
+  if (len > 0) {
+    newChildren = [];
+    for (i = 0; i < len-1; i++) {
+      newChildren.push(this.children[i]);
+      newChildren.push(aSep);
+    }
+    newChildren.push(this.children[i]);
+    this.children = newChildren;
+  }
+  return this;
+};
+
+/**
+ * Call String.prototype.replace on the very right-most source snippet. Useful
+ * for trimming whitespace from the end of a source node, etc.
+ *
+ * @param aPattern The pattern to replace.
+ * @param aReplacement The thing to replace the pattern with.
+ */
+SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+  var lastChild = this.children[this.children.length - 1];
+  if (lastChild[isSourceNode]) {
+    lastChild.replaceRight(aPattern, aReplacement);
+  }
+  else if (typeof lastChild === 'string') {
+    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+  }
+  else {
+    this.children.push(''.replace(aPattern, aReplacement));
+  }
+  return this;
+};
+
+/**
+ * Set the source content for a source file. This will be added to the SourceMapGenerator
+ * in the sourcesContent field.
+ *
+ * @param aSourceFile The filename of the source file
+ * @param aSourceContent The content of the source file
+ */
+SourceNode.prototype.setSourceContent =
+  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+  };
+
+/**
+ * Walk over the tree of SourceNodes. The walking function is called for each
+ * source file content and is passed the filename and source content.
+ *
+ * @param aFn The traversal function.
+ */
+SourceNode.prototype.walkSourceContents =
+  function SourceNode_walkSourceContents(aFn) {
+    for (var i = 0, len = this.children.length; i < len; i++) {
+      if (this.children[i][isSourceNode]) {
+        this.children[i].walkSourceContents(aFn);
+      }
+    }
+
+    var sources = Object.keys(this.sourceContents);
+    for (var i = 0, len = sources.length; i < len; i++) {
+      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+    }
+  };
+
+/**
+ * Return the string representation of this source node. Walks over the tree
+ * and concatenates all the various snippets together to one string.
+ */
+SourceNode.prototype.toString = function SourceNode_toString() {
+  var str = "";
+  this.walk(function (chunk) {
+    str += chunk;
+  });
+  return str;
+};
+
+/**
+ * Returns the string representation of this source node along with a source
+ * map.
+ */
+SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+  var generated = {
+    code: "",
+    line: 1,
+    column: 0
+  };
+  var map = new SourceMapGenerator(aArgs);
+  var sourceMappingActive = false;
+  var lastOriginalSource = null;
+  var lastOriginalLine = null;
+  var lastOriginalColumn = null;
+  var lastOriginalName = null;
+  this.walk(function (chunk, original) {
+    generated.code += chunk;
+    if (original.source !== null
+        && original.line !== null
+        && original.column !== null) {
+      if(lastOriginalSource !== original.source
+         || lastOriginalLine !== original.line
+         || lastOriginalColumn !== original.column
+         || lastOriginalName !== original.name) {
+        map.addMapping({
+          source: original.source,
+          original: {
+            line: original.line,
+            column: original.column
+          },
+          generated: {
+            line: generated.line,
+            column: generated.column
+          },
+          name: original.name
+        });
+      }
+      lastOriginalSource = original.source;
+      lastOriginalLine = original.line;
+      lastOriginalColumn = original.column;
+      lastOriginalName = original.name;
+      sourceMappingActive = true;
+    } else if (sourceMappingActive) {
+      map.addMapping({
+        generated: {
+          line: generated.line,
+          column: generated.column
+        }
+      });
+      lastOriginalSource = null;
+      sourceMappingActive = false;
+    }
+    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+        generated.line++;
+        generated.column = 0;
+        // Mappings end at eol
+        if (idx + 1 === length) {
+          lastOriginalSource = null;
+          sourceMappingActive = false;
+        } else if (sourceMappingActive) {
+          map.addMapping({
+            source: original.source,
+            original: {
+              line: original.line,
+              column: original.column
+            },
+            generated: {
+              line: generated.line,
+              column: generated.column
+            },
+            name: original.name
+          });
+        }
+      } else {
+        generated.column++;
+      }
+    }
+  });
+  this.walkSourceContents(function (sourceFile, sourceContent) {
+    map.setSourceContent(sourceFile, sourceContent);
+  });
+
+  return { code: generated.code, map: map };
+};
+
+exports.SourceNode = SourceNode;
diff --git a/node_modules/mathjs/examples/node_modules/source-map/lib/util.js b/node_modules/mathjs/examples/node_modules/source-map/lib/util.js
new file mode 100644
index 0000000..3ca92e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/lib/util.js
@@ -0,0 +1,488 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * This is a helper function for getting values from parameter/options
+ * objects.
+ *
+ * @param args The object we are extracting values from
+ * @param name The name of the property we are getting.
+ * @param defaultValue An optional value to return if the property is missing
+ * from the object. If this is not specified and the property is missing, an
+ * error will be thrown.
+ */
+function getArg(aArgs, aName, aDefaultValue) {
+  if (aName in aArgs) {
+    return aArgs[aName];
+  } else if (arguments.length === 3) {
+    return aDefaultValue;
+  } else {
+    throw new Error('"' + aName + '" is a required argument.');
+  }
+}
+exports.getArg = getArg;
+
+var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+var dataUrlRegexp = /^data:.+\,.+$/;
+
+function urlParse(aUrl) {
+  var match = aUrl.match(urlRegexp);
+  if (!match) {
+    return null;
+  }
+  return {
+    scheme: match[1],
+    auth: match[2],
+    host: match[3],
+    port: match[4],
+    path: match[5]
+  };
+}
+exports.urlParse = urlParse;
+
+function urlGenerate(aParsedUrl) {
+  var url = '';
+  if (aParsedUrl.scheme) {
+    url += aParsedUrl.scheme + ':';
+  }
+  url += '//';
+  if (aParsedUrl.auth) {
+    url += aParsedUrl.auth + '@';
+  }
+  if (aParsedUrl.host) {
+    url += aParsedUrl.host;
+  }
+  if (aParsedUrl.port) {
+    url += ":" + aParsedUrl.port
+  }
+  if (aParsedUrl.path) {
+    url += aParsedUrl.path;
+  }
+  return url;
+}
+exports.urlGenerate = urlGenerate;
+
+/**
+ * Normalizes a path, or the path portion of a URL:
+ *
+ * - Replaces consecutive slashes with one slash.
+ * - Removes unnecessary '.' parts.
+ * - Removes unnecessary '<dir>/..' parts.
+ *
+ * Based on code in the Node.js 'path' core module.
+ *
+ * @param aPath The path or url to normalize.
+ */
+function normalize(aPath) {
+  var path = aPath;
+  var url = urlParse(aPath);
+  if (url) {
+    if (!url.path) {
+      return aPath;
+    }
+    path = url.path;
+  }
+  var isAbsolute = exports.isAbsolute(path);
+
+  var parts = path.split(/\/+/);
+  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+    part = parts[i];
+    if (part === '.') {
+      parts.splice(i, 1);
+    } else if (part === '..') {
+      up++;
+    } else if (up > 0) {
+      if (part === '') {
+        // The first part is blank if the path is absolute. Trying to go
+        // above the root is a no-op. Therefore we can remove all '..' parts
+        // directly after the root.
+        parts.splice(i + 1, up);
+        up = 0;
+      } else {
+        parts.splice(i, 2);
+        up--;
+      }
+    }
+  }
+  path = parts.join('/');
+
+  if (path === '') {
+    path = isAbsolute ? '/' : '.';
+  }
+
+  if (url) {
+    url.path = path;
+    return urlGenerate(url);
+  }
+  return path;
+}
+exports.normalize = normalize;
+
+/**
+ * Joins two paths/URLs.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be joined with the root.
+ *
+ * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+ *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+ *   first.
+ * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+ *   is updated with the result and aRoot is returned. Otherwise the result
+ *   is returned.
+ *   - If aPath is absolute, the result is aPath.
+ *   - Otherwise the two paths are joined with a slash.
+ * - Joining for example 'http://' and 'www.example.com' is also supported.
+ */
+function join(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+  if (aPath === "") {
+    aPath = ".";
+  }
+  var aPathUrl = urlParse(aPath);
+  var aRootUrl = urlParse(aRoot);
+  if (aRootUrl) {
+    aRoot = aRootUrl.path || '/';
+  }
+
+  // `join(foo, '//www.example.org')`
+  if (aPathUrl && !aPathUrl.scheme) {
+    if (aRootUrl) {
+      aPathUrl.scheme = aRootUrl.scheme;
+    }
+    return urlGenerate(aPathUrl);
+  }
+
+  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+    return aPath;
+  }
+
+  // `join('http://', 'www.example.com')`
+  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+    aRootUrl.host = aPath;
+    return urlGenerate(aRootUrl);
+  }
+
+  var joined = aPath.charAt(0) === '/'
+    ? aPath
+    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+
+  if (aRootUrl) {
+    aRootUrl.path = joined;
+    return urlGenerate(aRootUrl);
+  }
+  return joined;
+}
+exports.join = join;
+
+exports.isAbsolute = function (aPath) {
+  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+};
+
+/**
+ * Make a path relative to a URL or another path.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be made relative to aRoot.
+ */
+function relative(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+
+  aRoot = aRoot.replace(/\/$/, '');
+
+  // It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  var level = 0;
+  while (aPath.indexOf(aRoot + '/') !== 0) {
+    var index = aRoot.lastIndexOf("/");
+    if (index < 0) {
+      return aPath;
+    }
+
+    // If the only part of the root that is left is the scheme (i.e. http://,
+    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+    // have exhausted all components, so the path is not relative to the root.
+    aRoot = aRoot.slice(0, index);
+    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+      return aPath;
+    }
+
+    ++level;
+  }
+
+  // Make sure we add a "../" for each component we removed from the root.
+  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+}
+exports.relative = relative;
+
+var supportsNullProto = (function () {
+  var obj = Object.create(null);
+  return !('__proto__' in obj);
+}());
+
+function identity (s) {
+  return s;
+}
+
+/**
+ * Because behavior goes wacky when you set `__proto__` on objects, we
+ * have to prefix all the strings in our set with an arbitrary character.
+ *
+ * See https://github.com/mozilla/source-map/pull/31 and
+ * https://github.com/mozilla/source-map/issues/30
+ *
+ * @param String aStr
+ */
+function toSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return '$' + aStr;
+  }
+
+  return aStr;
+}
+exports.toSetString = supportsNullProto ? identity : toSetString;
+
+function fromSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return aStr.slice(1);
+  }
+
+  return aStr;
+}
+exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+function isProtoString(s) {
+  if (!s) {
+    return false;
+  }
+
+  var length = s.length;
+
+  if (length < 9 /* "__proto__".length */) {
+    return false;
+  }
+
+  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+    return false;
+  }
+
+  for (var i = length - 10; i >= 0; i--) {
+    if (s.charCodeAt(i) !== 36 /* '$' */) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+/**
+ * Comparator between two mappings where the original positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same original source/line/column, but different generated
+ * line and column the same. Useful when searching for a mapping with a
+ * stubbed out mapping.
+ */
+function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+  var cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositions = compareByOriginalPositions;
+
+/**
+ * Comparator between two mappings with deflated source and name indices where
+ * the generated positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same generated line and column, but different
+ * source/name/original line and column the same. Useful when searching for a
+ * mapping with a stubbed out mapping.
+ */
+function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+function strcmp(aStr1, aStr2) {
+  if (aStr1 === aStr2) {
+    return 0;
+  }
+
+  if (aStr1 === null) {
+    return 1; // aStr2 !== null
+  }
+
+  if (aStr2 === null) {
+    return -1; // aStr1 !== null
+  }
+
+  if (aStr1 > aStr2) {
+    return 1;
+  }
+
+  return -1;
+}
+
+/**
+ * Comparator between two mappings with inflated source and name strings where
+ * the generated positions are compared.
+ */
+function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+/**
+ * Strip any JSON XSSI avoidance prefix from the string (as documented
+ * in the source maps specification), and then parse the string as
+ * JSON.
+ */
+function parseSourceMapInput(str) {
+  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+}
+exports.parseSourceMapInput = parseSourceMapInput;
+
+/**
+ * Compute the URL of a source given the the source root, the source's
+ * URL, and the source map's URL.
+ */
+function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+  sourceURL = sourceURL || '';
+
+  if (sourceRoot) {
+    // This follows what Chrome does.
+    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+      sourceRoot += '/';
+    }
+    // The spec says:
+    //   Line 4: An optional source root, useful for relocating source
+    //   files on a server or removing repeated values in the
+    //   “sources” entry.  This value is prepended to the individual
+    //   entries in the “source” field.
+    sourceURL = sourceRoot + sourceURL;
+  }
+
+  // Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if (sourceMapURL) {
+    var parsed = urlParse(sourceMapURL);
+    if (!parsed) {
+      throw new Error("sourceMapURL could not be parsed");
+    }
+    if (parsed.path) {
+      // Strip the last path component, but keep the "/".
+      var index = parsed.path.lastIndexOf('/');
+      if (index >= 0) {
+        parsed.path = parsed.path.substring(0, index + 1);
+      }
+    }
+    sourceURL = join(urlGenerate(parsed), sourceURL);
+  }
+
+  return normalize(sourceURL);
+}
+exports.computeSourceURL = computeSourceURL;
diff --git a/node_modules/mathjs/examples/node_modules/source-map/package.json b/node_modules/mathjs/examples/node_modules/source-map/package.json
new file mode 100644
index 0000000..2466341
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/package.json
@@ -0,0 +1,73 @@
+{
+  "name": "source-map",
+  "description": "Generates and consumes source maps",
+  "version": "0.6.1",
+  "homepage": "https://github.com/mozilla/source-map",
+  "author": "Nick Fitzgerald <nfitzgerald@mozilla.com>",
+  "contributors": [
+    "Tobias Koppers <tobias.koppers@googlemail.com>",
+    "Duncan Beevers <duncan@dweebd.com>",
+    "Stephen Crane <scrane@mozilla.com>",
+    "Ryan Seddon <seddon.ryan@gmail.com>",
+    "Miles Elam <miles.elam@deem.com>",
+    "Mihai Bazon <mihai.bazon@gmail.com>",
+    "Michael Ficarra <github.public.email@michael.ficarra.me>",
+    "Todd Wolfson <todd@twolfson.com>",
+    "Alexander Solovyov <alexander@solovyov.net>",
+    "Felix Gnass <fgnass@gmail.com>",
+    "Conrad Irwin <conrad.irwin@gmail.com>",
+    "usrbincc <usrbincc@yahoo.com>",
+    "David Glasser <glasser@davidglasser.net>",
+    "Chase Douglas <chase@newrelic.com>",
+    "Evan Wallace <evan.exe@gmail.com>",
+    "Heather Arthur <fayearthur@gmail.com>",
+    "Hugh Kennedy <hughskennedy@gmail.com>",
+    "David Glasser <glasser@davidglasser.net>",
+    "Simon Lydell <simon.lydell@gmail.com>",
+    "Jmeas Smith <jellyes2@gmail.com>",
+    "Michael Z Goddard <mzgoddard@gmail.com>",
+    "azu <azu@users.noreply.github.com>",
+    "John Gozde <john@gozde.ca>",
+    "Adam Kirkton <akirkton@truefitinnovation.com>",
+    "Chris Montgomery <christopher.montgomery@dowjones.com>",
+    "J. Ryan Stinnett <jryans@gmail.com>",
+    "Jack Herrington <jherrington@walmartlabs.com>",
+    "Chris Truter <jeffpalentine@gmail.com>",
+    "Daniel Espeset <daniel@danielespeset.com>",
+    "Jamie Wong <jamie.lf.wong@gmail.com>",
+    "Eddy Bruël <ejpbruel@mozilla.com>",
+    "Hawken Rives <hawkrives@gmail.com>",
+    "Gilad Peleg <giladp007@gmail.com>",
+    "djchie <djchie.dev@gmail.com>",
+    "Gary Ye <garysye@gmail.com>",
+    "Nicolas Lalevée <nicolas.lalevee@hibnet.org>"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/mozilla/source-map.git"
+  },
+  "main": "./source-map.js",
+  "files": [
+    "source-map.js",
+    "source-map.d.ts",
+    "lib/",
+    "dist/source-map.debug.js",
+    "dist/source-map.js",
+    "dist/source-map.min.js",
+    "dist/source-map.min.js.map"
+  ],
+  "engines": {
+    "node": ">=0.10.0"
+  },
+  "license": "BSD-3-Clause",
+  "scripts": {
+    "test": "npm run build && node test/run-tests.js",
+    "build": "webpack --color",
+    "toc": "doctoc --title '## Table of Contents' README.md && doctoc --title '## Table of Contents' CONTRIBUTING.md"
+  },
+  "devDependencies": {
+    "doctoc": "^0.15.0",
+    "webpack": "^1.12.0"
+  },
+  "typings": "source-map"
+}
diff --git a/node_modules/mathjs/examples/node_modules/source-map/source-map.d.ts b/node_modules/mathjs/examples/node_modules/source-map/source-map.d.ts
new file mode 100644
index 0000000..8f972b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/source-map.d.ts
@@ -0,0 +1,98 @@
+export interface StartOfSourceMap {
+    file?: string;
+    sourceRoot?: string;
+}
+
+export interface RawSourceMap extends StartOfSourceMap {
+    version: string;
+    sources: string[];
+    names: string[];
+    sourcesContent?: string[];
+    mappings: string;
+}
+
+export interface Position {
+    line: number;
+    column: number;
+}
+
+export interface LineRange extends Position {
+    lastColumn: number;
+}
+
+export interface FindPosition extends Position {
+    // SourceMapConsumer.GREATEST_LOWER_BOUND or SourceMapConsumer.LEAST_UPPER_BOUND
+    bias?: number;
+}
+
+export interface SourceFindPosition extends FindPosition {
+    source: string;
+}
+
+export interface MappedPosition extends Position {
+    source: string;
+    name?: string;
+}
+
+export interface MappingItem {
+    source: string;
+    generatedLine: number;
+    generatedColumn: number;
+    originalLine: number;
+    originalColumn: number;
+    name: string;
+}
+
+export class SourceMapConsumer {
+    static GENERATED_ORDER: number;
+    static ORIGINAL_ORDER: number;
+
+    static GREATEST_LOWER_BOUND: number;
+    static LEAST_UPPER_BOUND: number;
+
+    constructor(rawSourceMap: RawSourceMap);
+    computeColumnSpans(): void;
+    originalPositionFor(generatedPosition: FindPosition): MappedPosition;
+    generatedPositionFor(originalPosition: SourceFindPosition): LineRange;
+    allGeneratedPositionsFor(originalPosition: MappedPosition): Position[];
+    hasContentsOfAllSources(): boolean;
+    sourceContentFor(source: string, returnNullOnMissing?: boolean): string;
+    eachMapping(callback: (mapping: MappingItem) => void, context?: any, order?: number): void;
+}
+
+export interface Mapping {
+    generated: Position;
+    original: Position;
+    source: string;
+    name?: string;
+}
+
+export class SourceMapGenerator {
+    constructor(startOfSourceMap?: StartOfSourceMap);
+    static fromSourceMap(sourceMapConsumer: SourceMapConsumer): SourceMapGenerator;
+    addMapping(mapping: Mapping): void;
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+    applySourceMap(sourceMapConsumer: SourceMapConsumer, sourceFile?: string, sourceMapPath?: string): void;
+    toString(): string;
+}
+
+export interface CodeWithSourceMap {
+    code: string;
+    map: SourceMapGenerator;
+}
+
+export class SourceNode {
+    constructor();
+    constructor(line: number, column: number, source: string);
+    constructor(line: number, column: number, source: string, chunk?: string, name?: string);
+    static fromStringWithSourceMap(code: string, sourceMapConsumer: SourceMapConsumer, relativePath?: string): SourceNode;
+    add(chunk: string): void;
+    prepend(chunk: string): void;
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+    walk(fn: (chunk: string, mapping: MappedPosition) => void): void;
+    walkSourceContents(fn: (file: string, content: string) => void): void;
+    join(sep: string): SourceNode;
+    replaceRight(pattern: string, replacement: string): SourceNode;
+    toString(): string;
+    toStringWithSourceMap(startOfSourceMap?: StartOfSourceMap): CodeWithSourceMap;
+}
diff --git a/node_modules/mathjs/examples/node_modules/source-map/source-map.js b/node_modules/mathjs/examples/node_modules/source-map/source-map.js
new file mode 100644
index 0000000..bc88fe8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/source-map/source-map.js
@@ -0,0 +1,8 @@
+/*
+ * Copyright 2009-2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE.txt or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+exports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;
+exports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;
+exports.SourceNode = require('./lib/source-node').SourceNode;
diff --git a/node_modules/mathjs/examples/node_modules/strip-final-newline/index.js b/node_modules/mathjs/examples/node_modules/strip-final-newline/index.js
new file mode 100644
index 0000000..78fc0c5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/strip-final-newline/index.js
@@ -0,0 +1,16 @@
+'use strict';
+
+module.exports = input => {
+	const LF = typeof input === 'string' ? '\n' : '\n'.charCodeAt();
+	const CR = typeof input === 'string' ? '\r' : '\r'.charCodeAt();
+
+	if (input[input.length - 1] === LF) {
+		input = input.slice(0, input.length - 1);
+	}
+
+	if (input[input.length - 1] === CR) {
+		input = input.slice(0, input.length - 1);
+	}
+
+	return input;
+};
diff --git a/node_modules/mathjs/examples/node_modules/strip-final-newline/license b/node_modules/mathjs/examples/node_modules/strip-final-newline/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/strip-final-newline/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/strip-final-newline/package.json b/node_modules/mathjs/examples/node_modules/strip-final-newline/package.json
new file mode 100644
index 0000000..d9f2a6c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/strip-final-newline/package.json
@@ -0,0 +1,40 @@
+{
+	"name": "strip-final-newline",
+	"version": "2.0.0",
+	"description": "Strip the final newline character from a string/buffer",
+	"license": "MIT",
+	"repository": "sindresorhus/strip-final-newline",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=6"
+	},
+	"scripts": {
+		"test": "xo && ava"
+	},
+	"files": [
+		"index.js"
+	],
+	"keywords": [
+		"strip",
+		"trim",
+		"remove",
+		"delete",
+		"final",
+		"last",
+		"end",
+		"file",
+		"newline",
+		"linebreak",
+		"character",
+		"string",
+		"buffer"
+	],
+	"devDependencies": {
+		"ava": "^0.25.0",
+		"xo": "^0.23.0"
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/strip-final-newline/readme.md b/node_modules/mathjs/examples/node_modules/strip-final-newline/readme.md
new file mode 100644
index 0000000..32dfd50
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/strip-final-newline/readme.md
@@ -0,0 +1,30 @@
+# strip-final-newline [![Build Status](https://travis-ci.com/sindresorhus/strip-final-newline.svg?branch=master)](https://travis-ci.com/sindresorhus/strip-final-newline)
+
+> Strip the final [newline character](https://en.wikipedia.org/wiki/Newline) from a string/buffer
+
+Can be useful when parsing the output of, for example, `ChildProcess#execFile`, as [binaries usually output a newline at the end](https://stackoverflow.com/questions/729692/why-should-text-files-end-with-a-newline). Normally, you would use `stdout.trim()`, but that would also remove newlines at the start and whitespace.
+
+
+## Install
+
+```
+$ npm install strip-final-newline
+```
+
+
+## Usage
+
+```js
+const stripFinalNewline = require('strip-final-newline');
+
+stripFinalNewline('foo\nbar\n\n');
+//=> 'foo\nbar\n'
+
+stripFinalNewline(Buffer.from('foo\nbar\n\n')).toString();
+//=> 'foo\nbar\n'
+```
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)
diff --git a/node_modules/mathjs/examples/node_modules/supports-color/browser.js b/node_modules/mathjs/examples/node_modules/supports-color/browser.js
new file mode 100644
index 0000000..f097aec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-color/browser.js
@@ -0,0 +1,24 @@
+/* eslint-env browser */
+'use strict';
+
+function getChromeVersion() {
+	const matches = /(Chrome|Chromium)\/(?<chromeVersion>\d+)\./.exec(navigator.userAgent);
+
+	if (!matches) {
+		return;
+	}
+
+	return Number.parseInt(matches.groups.chromeVersion, 10);
+}
+
+const colorSupport = getChromeVersion() >= 69 ? {
+	level: 1,
+	hasBasic: true,
+	has256: false,
+	has16m: false
+} : false;
+
+module.exports = {
+	stdout: colorSupport,
+	stderr: colorSupport
+};
diff --git a/node_modules/mathjs/examples/node_modules/supports-color/index.js b/node_modules/mathjs/examples/node_modules/supports-color/index.js
new file mode 100644
index 0000000..2dd2fcb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-color/index.js
@@ -0,0 +1,152 @@
+'use strict';
+const os = require('os');
+const tty = require('tty');
+const hasFlag = require('has-flag');
+
+const {env} = process;
+
+let flagForceColor;
+if (hasFlag('no-color') ||
+	hasFlag('no-colors') ||
+	hasFlag('color=false') ||
+	hasFlag('color=never')) {
+	flagForceColor = 0;
+} else if (hasFlag('color') ||
+	hasFlag('colors') ||
+	hasFlag('color=true') ||
+	hasFlag('color=always')) {
+	flagForceColor = 1;
+}
+
+function envForceColor() {
+	if ('FORCE_COLOR' in env) {
+		if (env.FORCE_COLOR === 'true') {
+			return 1;
+		}
+
+		if (env.FORCE_COLOR === 'false') {
+			return 0;
+		}
+
+		return env.FORCE_COLOR.length === 0 ? 1 : Math.min(Number.parseInt(env.FORCE_COLOR, 10), 3);
+	}
+}
+
+function translateLevel(level) {
+	if (level === 0) {
+		return false;
+	}
+
+	return {
+		level,
+		hasBasic: true,
+		has256: level >= 2,
+		has16m: level >= 3
+	};
+}
+
+function supportsColor(haveStream, {streamIsTTY, sniffFlags = true} = {}) {
+	const noFlagForceColor = envForceColor();
+	if (noFlagForceColor !== undefined) {
+		flagForceColor = noFlagForceColor;
+	}
+
+	const forceColor = sniffFlags ? flagForceColor : noFlagForceColor;
+
+	if (forceColor === 0) {
+		return 0;
+	}
+
+	if (sniffFlags) {
+		if (hasFlag('color=16m') ||
+			hasFlag('color=full') ||
+			hasFlag('color=truecolor')) {
+			return 3;
+		}
+
+		if (hasFlag('color=256')) {
+			return 2;
+		}
+	}
+
+	if (haveStream && !streamIsTTY && forceColor === undefined) {
+		return 0;
+	}
+
+	const min = forceColor || 0;
+
+	if (env.TERM === 'dumb') {
+		return min;
+	}
+
+	if (process.platform === 'win32') {
+		// Windows 10 build 10586 is the first Windows release that supports 256 colors.
+		// Windows 10 build 14931 is the first release that supports 16m/TrueColor.
+		const osRelease = os.release().split('.');
+		if (
+			Number(osRelease[0]) >= 10 &&
+			Number(osRelease[2]) >= 10586
+		) {
+			return Number(osRelease[2]) >= 14931 ? 3 : 2;
+		}
+
+		return 1;
+	}
+
+	if ('CI' in env) {
+		if (['TRAVIS', 'CIRCLECI', 'APPVEYOR', 'GITLAB_CI', 'GITHUB_ACTIONS', 'BUILDKITE', 'DRONE'].some(sign => sign in env) || env.CI_NAME === 'codeship') {
+			return 1;
+		}
+
+		return min;
+	}
+
+	if ('TEAMCITY_VERSION' in env) {
+		return /^(9\.(0*[1-9]\d*)\.|\d{2,}\.)/.test(env.TEAMCITY_VERSION) ? 1 : 0;
+	}
+
+	if (env.COLORTERM === 'truecolor') {
+		return 3;
+	}
+
+	if ('TERM_PROGRAM' in env) {
+		const version = Number.parseInt((env.TERM_PROGRAM_VERSION || '').split('.')[0], 10);
+
+		switch (env.TERM_PROGRAM) {
+			case 'iTerm.app':
+				return version >= 3 ? 3 : 2;
+			case 'Apple_Terminal':
+				return 2;
+			// No default
+		}
+	}
+
+	if (/-256(color)?$/i.test(env.TERM)) {
+		return 2;
+	}
+
+	if (/^screen|^xterm|^vt100|^vt220|^rxvt|color|ansi|cygwin|linux/i.test(env.TERM)) {
+		return 1;
+	}
+
+	if ('COLORTERM' in env) {
+		return 1;
+	}
+
+	return min;
+}
+
+function getSupportLevel(stream, options = {}) {
+	const level = supportsColor(stream, {
+		streamIsTTY: stream && stream.isTTY,
+		...options
+	});
+
+	return translateLevel(level);
+}
+
+module.exports = {
+	supportsColor: getSupportLevel,
+	stdout: getSupportLevel({isTTY: tty.isatty(1)}),
+	stderr: getSupportLevel({isTTY: tty.isatty(2)})
+};
diff --git a/node_modules/mathjs/examples/node_modules/supports-color/license b/node_modules/mathjs/examples/node_modules/supports-color/license
new file mode 100644
index 0000000..fa7ceba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-color/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/supports-color/package.json b/node_modules/mathjs/examples/node_modules/supports-color/package.json
new file mode 100644
index 0000000..a97bf2a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-color/package.json
@@ -0,0 +1,58 @@
+{
+	"name": "supports-color",
+	"version": "8.1.1",
+	"description": "Detect whether a terminal supports color",
+	"license": "MIT",
+	"repository": "chalk/supports-color",
+	"funding": "https://github.com/chalk/supports-color?sponsor=1",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=10"
+	},
+	"scripts": {
+		"test": "xo && ava"
+	},
+	"files": [
+		"index.js",
+		"browser.js"
+	],
+	"exports": {
+		"node": "./index.js",
+		"default": "./browser.js"
+	},
+	"keywords": [
+		"color",
+		"colour",
+		"colors",
+		"terminal",
+		"console",
+		"cli",
+		"ansi",
+		"styles",
+		"tty",
+		"rgb",
+		"256",
+		"shell",
+		"xterm",
+		"command-line",
+		"support",
+		"supports",
+		"capability",
+		"detect",
+		"truecolor",
+		"16m"
+	],
+	"dependencies": {
+		"has-flag": "^4.0.0"
+	},
+	"devDependencies": {
+		"ava": "^2.4.0",
+		"import-fresh": "^3.2.2",
+		"xo": "^0.35.0"
+	},
+	"browser": "browser.js"
+}
diff --git a/node_modules/mathjs/examples/node_modules/supports-color/readme.md b/node_modules/mathjs/examples/node_modules/supports-color/readme.md
new file mode 100644
index 0000000..3eedd1c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-color/readme.md
@@ -0,0 +1,77 @@
+# supports-color
+
+> Detect whether a terminal supports color
+
+## Install
+
+```
+$ npm install supports-color
+```
+
+## Usage
+
+```js
+const supportsColor = require('supports-color');
+
+if (supportsColor.stdout) {
+	console.log('Terminal stdout supports color');
+}
+
+if (supportsColor.stdout.has256) {
+	console.log('Terminal stdout supports 256 colors');
+}
+
+if (supportsColor.stderr.has16m) {
+	console.log('Terminal stderr supports 16 million colors (truecolor)');
+}
+```
+
+## API
+
+Returns an `Object` with a `stdout` and `stderr` property for testing either streams. Each property is an `Object`, or `false` if color is not supported.
+
+The `stdout`/`stderr` objects specifies a level of support for color through a `.level` property and a corresponding flag:
+
+- `.level = 1` and `.hasBasic = true`: Basic color support (16 colors)
+- `.level = 2` and `.has256 = true`: 256 color support
+- `.level = 3` and `.has16m = true`: Truecolor support (16 million colors)
+
+### `require('supports-color').supportsColor(stream, options?)`
+
+Additionally, `supports-color` exposes the `.supportsColor()` function that takes an arbitrary write stream (e.g. `process.stdout`) and an optional options object to (re-)evaluate color support for an arbitrary stream.
+
+For example, `require('supports-color').stdout` is the equivalent of `require('supports-color').supportsColor(process.stdout)`.
+
+The options object supports a single boolean property `sniffFlags`. By default it is `true`, which instructs `supportsColor()` to sniff `process.argv` for the multitude of `--color` flags (see _Info_ below). If `false`, then `process.argv` is not considered when determining color support.
+
+## Info
+
+It obeys the `--color` and `--no-color` CLI flags.
+
+For situations where using `--color` is not possible, use the environment variable `FORCE_COLOR=1` (level 1), `FORCE_COLOR=2` (level 2), or `FORCE_COLOR=3` (level 3) to forcefully enable color, or `FORCE_COLOR=0` to forcefully disable. The use of `FORCE_COLOR` overrides all other color support checks.
+
+Explicit 256/Truecolor mode can be enabled using the `--color=256` and `--color=16m` flags, respectively.
+
+## Related
+
+- [supports-color-cli](https://github.com/chalk/supports-color-cli) - CLI for this module
+- [chalk](https://github.com/chalk/chalk) - Terminal string styling done right
+
+## Maintainers
+
+- [Sindre Sorhus](https://github.com/sindresorhus)
+- [Josh Junon](https://github.com/qix-)
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-supports-color?utm_source=npm-supports-color&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
+
+---
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.eslintrc b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.eslintrc
new file mode 100644
index 0000000..346ffec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.eslintrc
@@ -0,0 +1,14 @@
+{
+	"root": true,
+
+	"extends": "@ljharb",
+
+	"env": {
+		"browser": true,
+		"node": true,
+	},
+
+	"rules": {
+		"id-length": "off",
+	},
+}
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.github/FUNDING.yml b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.github/FUNDING.yml
new file mode 100644
index 0000000..e8d64f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.github/FUNDING.yml
@@ -0,0 +1,12 @@
+# These are supported funding model platforms
+
+github: [ljharb]
+patreon: # Replace with a single Patreon username
+open_collective: # Replace with a single Open Collective username
+ko_fi: # Replace with a single Ko-fi username
+tidelift: npm/supports-preserve-symlink-flag
+community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
+liberapay: # Replace with a single Liberapay username
+issuehunt: # Replace with a single IssueHunt username
+otechie: # Replace with a single Otechie username
+custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.nycrc b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.nycrc
new file mode 100644
index 0000000..bdd626c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/.nycrc
@@ -0,0 +1,9 @@
+{
+	"all": true,
+	"check-coverage": false,
+	"reporter": ["text-summary", "text", "html", "json"],
+	"exclude": [
+		"coverage",
+		"test"
+	]
+}
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/CHANGELOG.md
new file mode 100644
index 0000000..61f607f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/CHANGELOG.md
@@ -0,0 +1,22 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/)
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## v1.0.0 - 2022-01-02
+
+### Commits
+
+- Tests [`e2f59ad`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/e2f59ad74e2ae0f5f4899fcde6a6f693ab7cc074)
+- Initial commit [`dc222aa`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/dc222aad3c0b940d8d3af1ca9937d108bd2dc4b9)
+- [meta] do not publish workflow files [`5ef77f7`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/5ef77f7cb6946d16ee38672be9ec0f1bbdf63262)
+- npm init [`992b068`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/992b068503a461f7e8676f40ca2aab255fd8d6ff)
+- read me [`6c9afa9`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/6c9afa9fabc8eaf0814aaed6dd01e6df0931b76d)
+- Initial implementation [`2f98925`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/2f9892546396d4ab0ad9f1ff83e76c3f01234ae8)
+- [meta] add `auto-changelog` [`6c476ae`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/6c476ae1ed7ce68b0480344f090ac2844f35509d)
+- [Dev Deps] add `eslint`, `@ljharb/eslint-config` [`d0fffc8`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/d0fffc886d25fba119355520750a909d64da0087)
+- Only apps should have lockfiles [`ab318ed`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/ab318ed7ae62f6c2c0e80a50398d40912afd8f69)
+- [meta] add `safe-publish-latest` [`2bb23b3`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/2bb23b3ebab02dc4135c4cdf0217db82835b9fca)
+- [meta] add `sideEffects` flag [`600223b`](https://github.com/inspect-js/node-supports-preserve-symlinks-flag/commit/600223ba24f30779f209d9097721eff35ed62741)
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/LICENSE b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/LICENSE
new file mode 100644
index 0000000..2e7b9a3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2022 Inspect JS
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/README.md b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/README.md
new file mode 100644
index 0000000..eb05b12
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/README.md
@@ -0,0 +1,42 @@
+# node-supports-preserve-symlinks-flag <sup>[![Version Badge][npm-version-svg]][package-url]</sup>
+
+[![github actions][actions-image]][actions-url]
+[![coverage][codecov-image]][codecov-url]
+[![dependency status][deps-svg]][deps-url]
+[![dev dependency status][dev-deps-svg]][dev-deps-url]
+[![License][license-image]][license-url]
+[![Downloads][downloads-image]][downloads-url]
+
+[![npm badge][npm-badge-png]][package-url]
+
+Determine if the current node version supports the `--preserve-symlinks` flag.
+
+## Example
+
+```js
+var supportsPreserveSymlinks = require('node-supports-preserve-symlinks-flag');
+var assert = require('assert');
+
+assert.equal(supportsPreserveSymlinks, null); // in a browser
+assert.equal(supportsPreserveSymlinks, false); // in node < v6.2
+assert.equal(supportsPreserveSymlinks, true); // in node v6.2+
+```
+
+## Tests
+Simply clone the repo, `npm install`, and run `npm test`
+
+[package-url]: https://npmjs.org/package/node-supports-preserve-symlinks-flag
+[npm-version-svg]: https://versionbadg.es/inspect-js/node-supports-preserve-symlinks-flag.svg
+[deps-svg]: https://david-dm.org/inspect-js/node-supports-preserve-symlinks-flag.svg
+[deps-url]: https://david-dm.org/inspect-js/node-supports-preserve-symlinks-flag
+[dev-deps-svg]: https://david-dm.org/inspect-js/node-supports-preserve-symlinks-flag/dev-status.svg
+[dev-deps-url]: https://david-dm.org/inspect-js/node-supports-preserve-symlinks-flag#info=devDependencies
+[npm-badge-png]: https://nodei.co/npm/node-supports-preserve-symlinks-flag.png?downloads=true&stars=true
+[license-image]: https://img.shields.io/npm/l/node-supports-preserve-symlinks-flag.svg
+[license-url]: LICENSE
+[downloads-image]: https://img.shields.io/npm/dm/node-supports-preserve-symlinks-flag.svg
+[downloads-url]: https://npm-stat.com/charts.html?package=node-supports-preserve-symlinks-flag
+[codecov-image]: https://codecov.io/gh/inspect-js/node-supports-preserve-symlinks-flag/branch/main/graphs/badge.svg
+[codecov-url]: https://app.codecov.io/gh/inspect-js/node-supports-preserve-symlinks-flag/
+[actions-image]: https://img.shields.io/endpoint?url=https://github-actions-badge-u3jn4tfpocch.runkit.sh/inspect-js/node-supports-preserve-symlinks-flag
+[actions-url]: https://github.com/inspect-js/node-supports-preserve-symlinks-flag/actions
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/browser.js b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/browser.js
new file mode 100644
index 0000000..087be1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/browser.js
@@ -0,0 +1,3 @@
+'use strict';
+
+module.exports = null;
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/index.js b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/index.js
new file mode 100644
index 0000000..86fd5d3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/index.js
@@ -0,0 +1,9 @@
+'use strict';
+
+module.exports = (
+// node 12+
+	process.allowedNodeEnvironmentFlags && process.allowedNodeEnvironmentFlags.has('--preserve-symlinks')
+) || (
+// node v6.2 - v11
+	String(module.constructor._findPath).indexOf('preserveSymlinks') >= 0 // eslint-disable-line no-underscore-dangle
+);
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/package.json b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/package.json
new file mode 100644
index 0000000..56edadc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/package.json
@@ -0,0 +1,70 @@
+{
+	"name": "supports-preserve-symlinks-flag",
+	"version": "1.0.0",
+	"description": "Determine if the current node version supports the `--preserve-symlinks` flag.",
+	"main": "./index.js",
+	"browser": "./browser.js",
+	"exports": {
+		".": [
+			{
+				"browser": "./browser.js",
+				"default": "./index.js"
+			},
+			"./index.js"
+		],
+		"./package.json": "./package.json"
+	},
+	"sideEffects": false,
+	"scripts": {
+		"prepublishOnly": "safe-publish-latest",
+		"prepublish": "not-in-publish || npm run prepublishOnly",
+		"lint": "eslint --ext=js,mjs .",
+		"pretest": "npm run lint",
+		"tests-only": "nyc tape 'test/**/*.js'",
+		"test": "npm run tests-only",
+		"posttest": "aud --production",
+		"version": "auto-changelog && git add CHANGELOG.md",
+		"postversion": "auto-changelog && git add CHANGELOG.md && git commit --no-edit --amend && git tag -f \"v$(node -e \"console.log(require('./package.json').version)\")\""
+	},
+	"repository": {
+		"type": "git",
+		"url": "git+https://github.com/inspect-js/node-supports-preserve-symlinks-flag.git"
+	},
+	"keywords": [
+		"node",
+		"flag",
+		"symlink",
+		"symlinks",
+		"preserve-symlinks"
+	],
+	"author": "Jordan Harband <ljharb@gmail.com>",
+	"funding": {
+		"url": "https://github.com/sponsors/ljharb"
+	},
+	"license": "MIT",
+	"bugs": {
+		"url": "https://github.com/inspect-js/node-supports-preserve-symlinks-flag/issues"
+	},
+	"homepage": "https://github.com/inspect-js/node-supports-preserve-symlinks-flag#readme",
+	"devDependencies": {
+		"@ljharb/eslint-config": "^20.1.0",
+		"aud": "^1.1.5",
+		"auto-changelog": "^2.3.0",
+		"eslint": "^8.6.0",
+		"nyc": "^10.3.2",
+		"safe-publish-latest": "^2.0.0",
+		"semver": "^6.3.0",
+		"tape": "^5.4.0"
+	},
+	"engines": {
+		"node": ">= 0.4"
+	},
+	"auto-changelog": {
+		"output": "CHANGELOG.md",
+		"template": "keepachangelog",
+		"unreleased": false,
+		"commitLimit": false,
+		"backfillLimit": false,
+		"hideCredit": true
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/test/index.js b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/test/index.js
new file mode 100644
index 0000000..9938d67
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/supports-preserve-symlinks-flag/test/index.js
@@ -0,0 +1,29 @@
+'use strict';
+
+var test = require('tape');
+var semver = require('semver');
+
+var supportsPreserveSymlinks = require('../');
+var browser = require('../browser');
+
+test('supportsPreserveSymlinks', function (t) {
+	t.equal(typeof supportsPreserveSymlinks, 'boolean', 'is a boolean');
+
+	t.equal(browser, null, 'browser file is `null`');
+	t.equal(
+		supportsPreserveSymlinks,
+		null,
+		'in a browser, is null',
+		{ skip: typeof window === 'undefined' }
+	);
+
+	var expected = semver.satisfies(process.version, '>= 6.2');
+	t.equal(
+		supportsPreserveSymlinks,
+		expected,
+		'is true in node v6.2+, false otherwise (actual: ' + supportsPreserveSymlinks + ', expected ' + expected + ')',
+		{ skip: typeof window !== 'undefined' }
+	);
+
+	t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/tapable/LICENSE b/node_modules/mathjs/examples/node_modules/tapable/LICENSE
new file mode 100644
index 0000000..03c083c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/LICENSE
@@ -0,0 +1,21 @@
+The MIT License
+
+Copyright JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/tapable/README.md b/node_modules/mathjs/examples/node_modules/tapable/README.md
new file mode 100644
index 0000000..1377197
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/README.md
@@ -0,0 +1,296 @@
+# Tapable
+
+The tapable package expose many Hook classes, which can be used to create hooks for plugins.
+
+``` javascript
+const {
+	SyncHook,
+	SyncBailHook,
+	SyncWaterfallHook,
+	SyncLoopHook,
+	AsyncParallelHook,
+	AsyncParallelBailHook,
+	AsyncSeriesHook,
+	AsyncSeriesBailHook,
+	AsyncSeriesWaterfallHook
+ } = require("tapable");
+```
+
+## Installation
+
+``` shell
+npm install --save tapable
+```
+
+## Usage
+
+All Hook constructors take one optional argument, which is a list of argument names as strings.
+
+``` js
+const hook = new SyncHook(["arg1", "arg2", "arg3"]);
+```
+
+The best practice is to expose all hooks of a class in a `hooks` property:
+
+``` js
+class Car {
+	constructor() {
+		this.hooks = {
+			accelerate: new SyncHook(["newSpeed"]),
+			brake: new SyncHook(),
+			calculateRoutes: new AsyncParallelHook(["source", "target", "routesList"])
+		};
+	}
+
+	/* ... */
+}
+```
+
+Other people can now use these hooks:
+
+``` js
+const myCar = new Car();
+
+// Use the tap method to add a consument
+myCar.hooks.brake.tap("WarningLampPlugin", () => warningLamp.on());
+```
+
+It's required to pass a name to identify the plugin/reason.
+
+You may receive arguments:
+
+``` js
+myCar.hooks.accelerate.tap("LoggerPlugin", newSpeed => console.log(`Accelerating to ${newSpeed}`));
+```
+
+For sync hooks, `tap` is the only valid method to add a plugin. Async hooks also support async plugins:
+
+``` js
+myCar.hooks.calculateRoutes.tapPromise("GoogleMapsPlugin", (source, target, routesList) => {
+	// return a promise
+	return google.maps.findRoute(source, target).then(route => {
+		routesList.add(route);
+	});
+});
+myCar.hooks.calculateRoutes.tapAsync("BingMapsPlugin", (source, target, routesList, callback) => {
+	bing.findRoute(source, target, (err, route) => {
+		if(err) return callback(err);
+		routesList.add(route);
+		// call the callback
+		callback();
+	});
+});
+
+// You can still use sync plugins
+myCar.hooks.calculateRoutes.tap("CachedRoutesPlugin", (source, target, routesList) => {
+	const cachedRoute = cache.get(source, target);
+	if(cachedRoute)
+		routesList.add(cachedRoute);
+})
+```
+The class declaring these hooks need to call them:
+
+``` js
+class Car {
+	/**
+	  * You won't get returned value from SyncHook or AsyncParallelHook,
+	  * to do that, use SyncWaterfallHook and AsyncSeriesWaterfallHook respectively
+	 **/
+
+	setSpeed(newSpeed) {
+		// following call returns undefined even when you returned values
+		this.hooks.accelerate.call(newSpeed);
+	}
+
+	useNavigationSystemPromise(source, target) {
+		const routesList = new List();
+		return this.hooks.calculateRoutes.promise(source, target, routesList).then((res) => {
+			// res is undefined for AsyncParallelHook
+			return routesList.getRoutes();
+		});
+	}
+
+	useNavigationSystemAsync(source, target, callback) {
+		const routesList = new List();
+		this.hooks.calculateRoutes.callAsync(source, target, routesList, err => {
+			if(err) return callback(err);
+			callback(null, routesList.getRoutes());
+		});
+	}
+}
+```
+
+The Hook will compile a method with the most efficient way of running your plugins. It generates code depending on:
+* The number of registered plugins (none, one, many)
+* The kind of registered plugins (sync, async, promise)
+* The used call method (sync, async, promise)
+* The number of arguments
+* Whether interception is used
+
+This ensures fastest possible execution.
+
+## Hook types
+
+Each hook can be tapped with one or several functions. How they are executed depends on the hook type:
+
+* Basic hook (without “Waterfall”, “Bail” or “Loop” in its name). This hook simply calls every function it tapped in a row.
+
+* __Waterfall__. A waterfall hook also calls each tapped function in a row. Unlike the basic hook, it passes a return value from each function to the next function.
+
+* __Bail__. A bail hook allows exiting early. When any of the tapped function returns anything, the bail hook will stop executing the remaining ones.
+
+* __Loop__. When a plugin in a loop hook returns a non-undefined value the hook will restart from the first plugin. It will loop until all plugins return undefined.
+
+Additionally, hooks can be synchronous or asynchronous. To reflect this, there’re “Sync”, “AsyncSeries”, and “AsyncParallel” hook classes:
+
+* __Sync__. A sync hook can only be tapped with synchronous functions (using `myHook.tap()`).
+
+* __AsyncSeries__. An async-series hook can be tapped with synchronous, callback-based and promise-based functions (using `myHook.tap()`, `myHook.tapAsync()` and `myHook.tapPromise()`). They call each async method in a row.
+
+* __AsyncParallel__. An async-parallel hook can also be tapped with synchronous, callback-based and promise-based functions (using `myHook.tap()`, `myHook.tapAsync()` and `myHook.tapPromise()`). However, they run each async method in parallel.
+
+The hook type is reflected in its class name. E.g., `AsyncSeriesWaterfallHook` allows asynchronous functions and runs them in series, passing each function’s return value into the next function.
+
+
+## Interception
+
+All Hooks offer an additional interception API:
+
+``` js
+myCar.hooks.calculateRoutes.intercept({
+	call: (source, target, routesList) => {
+		console.log("Starting to calculate routes");
+	},
+	register: (tapInfo) => {
+		// tapInfo = { type: "promise", name: "GoogleMapsPlugin", fn: ... }
+		console.log(`${tapInfo.name} is doing its job`);
+		return tapInfo; // may return a new tapInfo object
+	}
+})
+```
+
+**call**: `(...args) => void` Adding `call` to your interceptor will trigger when hooks are triggered. You have access to the hooks arguments.
+
+**tap**: `(tap: Tap) => void` Adding `tap` to your interceptor will trigger when a plugin taps into a hook. Provided is the `Tap` object. `Tap` object can't be changed.
+
+**loop**: `(...args) => void` Adding `loop` to your interceptor will trigger for each loop of a looping hook.
+
+**register**: `(tap: Tap) => Tap | undefined` Adding `register` to your interceptor will trigger for each added `Tap` and allows to modify it.
+
+## Context
+
+Plugins and interceptors can opt-in to access an optional `context` object, which can be used to pass arbitrary values to subsequent plugins and interceptors.
+
+``` js
+myCar.hooks.accelerate.intercept({
+	context: true,
+	tap: (context, tapInfo) => {
+		// tapInfo = { type: "sync", name: "NoisePlugin", fn: ... }
+		console.log(`${tapInfo.name} is doing it's job`);
+
+		// `context` starts as an empty object if at least one plugin uses `context: true`.
+		// If no plugins use `context: true`, then `context` is undefined.
+		if (context) {
+			// Arbitrary properties can be added to `context`, which plugins can then access.
+			context.hasMuffler = true;
+		}
+	}
+});
+
+myCar.hooks.accelerate.tap({
+	name: "NoisePlugin",
+	context: true
+}, (context, newSpeed) => {
+	if (context && context.hasMuffler) {
+		console.log("Silence...");
+	} else {
+		console.log("Vroom!");
+	}
+});
+```
+
+## HookMap
+
+A HookMap is a helper class for a Map with Hooks
+
+``` js
+const keyedHook = new HookMap(key => new SyncHook(["arg"]))
+```
+
+``` js
+keyedHook.for("some-key").tap("MyPlugin", (arg) => { /* ... */ });
+keyedHook.for("some-key").tapAsync("MyPlugin", (arg, callback) => { /* ... */ });
+keyedHook.for("some-key").tapPromise("MyPlugin", (arg) => { /* ... */ });
+```
+
+``` js
+const hook = keyedHook.get("some-key");
+if(hook !== undefined) {
+	hook.callAsync("arg", err => { /* ... */ });
+}
+```
+
+## Hook/HookMap interface
+
+Public:
+
+``` ts
+interface Hook {
+	tap: (name: string | Tap, fn: (context?, ...args) => Result) => void,
+	tapAsync: (name: string | Tap, fn: (context?, ...args, callback: (err, result: Result) => void) => void) => void,
+	tapPromise: (name: string | Tap, fn: (context?, ...args) => Promise<Result>) => void,
+	intercept: (interceptor: HookInterceptor) => void
+}
+
+interface HookInterceptor {
+	call: (context?, ...args) => void,
+	loop: (context?, ...args) => void,
+	tap: (context?, tap: Tap) => void,
+	register: (tap: Tap) => Tap,
+	context: boolean
+}
+
+interface HookMap {
+	for: (key: any) => Hook,
+	intercept: (interceptor: HookMapInterceptor) => void
+}
+
+interface HookMapInterceptor {
+	factory: (key: any, hook: Hook) => Hook
+}
+
+interface Tap {
+	name: string,
+	type: string
+	fn: Function,
+	stage: number,
+	context: boolean,
+	before?: string | Array
+}
+```
+
+Protected (only for the class containing the hook):
+
+``` ts
+interface Hook {
+	isUsed: () => boolean,
+	call: (...args) => Result,
+	promise: (...args) => Promise<Result>,
+	callAsync: (...args, callback: (err, result: Result) => void) => void,
+}
+
+interface HookMap {
+	get: (key: any) => Hook | undefined,
+	for: (key: any) => Hook
+}
+```
+
+## MultiHook
+
+A helper Hook-like class to redirect taps to multiple other hooks:
+
+``` js
+const { MultiHook } = require("tapable");
+
+this.hooks.allHooks = new MultiHook([this.hooks.hookA, this.hooks.hookB]);
+```
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncParallelBailHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncParallelBailHook.js
new file mode 100644
index 0000000..45eca33
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncParallelBailHook.js
@@ -0,0 +1,85 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class AsyncParallelBailHookCodeFactory extends HookCodeFactory {
+	content({ onError, onResult, onDone }) {
+		let code = "";
+		code += `var _results = new Array(${this.options.taps.length});\n`;
+		code += "var _checkDone = function() {\n";
+		code += "for(var i = 0; i < _results.length; i++) {\n";
+		code += "var item = _results[i];\n";
+		code += "if(item === undefined) return false;\n";
+		code += "if(item.result !== undefined) {\n";
+		code += onResult("item.result");
+		code += "return true;\n";
+		code += "}\n";
+		code += "if(item.error) {\n";
+		code += onError("item.error");
+		code += "return true;\n";
+		code += "}\n";
+		code += "}\n";
+		code += "return false;\n";
+		code += "}\n";
+		code += this.callTapsParallel({
+			onError: (i, err, done, doneBreak) => {
+				let code = "";
+				code += `if(${i} < _results.length && ((_results.length = ${i +
+					1}), (_results[${i}] = { error: ${err} }), _checkDone())) {\n`;
+				code += doneBreak(true);
+				code += "} else {\n";
+				code += done();
+				code += "}\n";
+				return code;
+			},
+			onResult: (i, result, done, doneBreak) => {
+				let code = "";
+				code += `if(${i} < _results.length && (${result} !== undefined && (_results.length = ${i +
+					1}), (_results[${i}] = { result: ${result} }), _checkDone())) {\n`;
+				code += doneBreak(true);
+				code += "} else {\n";
+				code += done();
+				code += "}\n";
+				return code;
+			},
+			onTap: (i, run, done, doneBreak) => {
+				let code = "";
+				if (i > 0) {
+					code += `if(${i} >= _results.length) {\n`;
+					code += done();
+					code += "} else {\n";
+				}
+				code += run();
+				if (i > 0) code += "}\n";
+				return code;
+			},
+			onDone
+		});
+		return code;
+	}
+}
+
+const factory = new AsyncParallelBailHookCodeFactory();
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function AsyncParallelBailHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = AsyncParallelBailHook;
+	hook.compile = COMPILE;
+	hook._call = undefined;
+	hook.call = undefined;
+	return hook;
+}
+
+AsyncParallelBailHook.prototype = null;
+
+module.exports = AsyncParallelBailHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncParallelHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncParallelHook.js
new file mode 100644
index 0000000..b7a3631
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncParallelHook.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class AsyncParallelHookCodeFactory extends HookCodeFactory {
+	content({ onError, onDone }) {
+		return this.callTapsParallel({
+			onError: (i, err, done, doneBreak) => onError(err) + doneBreak(true),
+			onDone
+		});
+	}
+}
+
+const factory = new AsyncParallelHookCodeFactory();
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function AsyncParallelHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = AsyncParallelHook;
+	hook.compile = COMPILE;
+	hook._call = undefined;
+	hook.call = undefined;
+	return hook;
+}
+
+AsyncParallelHook.prototype = null;
+
+module.exports = AsyncParallelHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesBailHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesBailHook.js
new file mode 100644
index 0000000..5df66df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesBailHook.js
@@ -0,0 +1,42 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class AsyncSeriesBailHookCodeFactory extends HookCodeFactory {
+	content({ onError, onResult, resultReturns, onDone }) {
+		return this.callTapsSeries({
+			onError: (i, err, next, doneBreak) => onError(err) + doneBreak(true),
+			onResult: (i, result, next) =>
+				`if(${result} !== undefined) {\n${onResult(
+					result
+				)}\n} else {\n${next()}}\n`,
+			resultReturns,
+			onDone
+		});
+	}
+}
+
+const factory = new AsyncSeriesBailHookCodeFactory();
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function AsyncSeriesBailHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = AsyncSeriesBailHook;
+	hook.compile = COMPILE;
+	hook._call = undefined;
+	hook.call = undefined;
+	return hook;
+}
+
+AsyncSeriesBailHook.prototype = null;
+
+module.exports = AsyncSeriesBailHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesHook.js
new file mode 100644
index 0000000..3edad00
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesHook.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class AsyncSeriesHookCodeFactory extends HookCodeFactory {
+	content({ onError, onDone }) {
+		return this.callTapsSeries({
+			onError: (i, err, next, doneBreak) => onError(err) + doneBreak(true),
+			onDone
+		});
+	}
+}
+
+const factory = new AsyncSeriesHookCodeFactory();
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function AsyncSeriesHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = AsyncSeriesHook;
+	hook.compile = COMPILE;
+	hook._call = undefined;
+	hook.call = undefined;
+	return hook;
+}
+
+AsyncSeriesHook.prototype = null;
+
+module.exports = AsyncSeriesHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesLoopHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesLoopHook.js
new file mode 100644
index 0000000..fb5f067
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesLoopHook.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class AsyncSeriesLoopHookCodeFactory extends HookCodeFactory {
+	content({ onError, onDone }) {
+		return this.callTapsLooping({
+			onError: (i, err, next, doneBreak) => onError(err) + doneBreak(true),
+			onDone
+		});
+	}
+}
+
+const factory = new AsyncSeriesLoopHookCodeFactory();
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function AsyncSeriesLoopHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = AsyncSeriesLoopHook;
+	hook.compile = COMPILE;
+	hook._call = undefined;
+	hook.call = undefined;
+	return hook;
+}
+
+AsyncSeriesLoopHook.prototype = null;
+
+module.exports = AsyncSeriesLoopHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesWaterfallHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesWaterfallHook.js
new file mode 100644
index 0000000..910b536
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/AsyncSeriesWaterfallHook.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class AsyncSeriesWaterfallHookCodeFactory extends HookCodeFactory {
+	content({ onError, onResult, onDone }) {
+		return this.callTapsSeries({
+			onError: (i, err, next, doneBreak) => onError(err) + doneBreak(true),
+			onResult: (i, result, next) => {
+				let code = "";
+				code += `if(${result} !== undefined) {\n`;
+				code += `${this._args[0]} = ${result};\n`;
+				code += `}\n`;
+				code += next();
+				return code;
+			},
+			onDone: () => onResult(this._args[0])
+		});
+	}
+}
+
+const factory = new AsyncSeriesWaterfallHookCodeFactory();
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function AsyncSeriesWaterfallHook(args = [], name = undefined) {
+	if (args.length < 1)
+		throw new Error("Waterfall hooks must have at least one argument");
+	const hook = new Hook(args, name);
+	hook.constructor = AsyncSeriesWaterfallHook;
+	hook.compile = COMPILE;
+	hook._call = undefined;
+	hook.call = undefined;
+	return hook;
+}
+
+AsyncSeriesWaterfallHook.prototype = null;
+
+module.exports = AsyncSeriesWaterfallHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/Hook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/Hook.js
new file mode 100644
index 0000000..db04426
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/Hook.js
@@ -0,0 +1,175 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const util = require("util");
+
+const deprecateContext = util.deprecate(() => {},
+"Hook.context is deprecated and will be removed");
+
+const CALL_DELEGATE = function(...args) {
+	this.call = this._createCall("sync");
+	return this.call(...args);
+};
+const CALL_ASYNC_DELEGATE = function(...args) {
+	this.callAsync = this._createCall("async");
+	return this.callAsync(...args);
+};
+const PROMISE_DELEGATE = function(...args) {
+	this.promise = this._createCall("promise");
+	return this.promise(...args);
+};
+
+class Hook {
+	constructor(args = [], name = undefined) {
+		this._args = args;
+		this.name = name;
+		this.taps = [];
+		this.interceptors = [];
+		this._call = CALL_DELEGATE;
+		this.call = CALL_DELEGATE;
+		this._callAsync = CALL_ASYNC_DELEGATE;
+		this.callAsync = CALL_ASYNC_DELEGATE;
+		this._promise = PROMISE_DELEGATE;
+		this.promise = PROMISE_DELEGATE;
+		this._x = undefined;
+
+		this.compile = this.compile;
+		this.tap = this.tap;
+		this.tapAsync = this.tapAsync;
+		this.tapPromise = this.tapPromise;
+	}
+
+	compile(options) {
+		throw new Error("Abstract: should be overridden");
+	}
+
+	_createCall(type) {
+		return this.compile({
+			taps: this.taps,
+			interceptors: this.interceptors,
+			args: this._args,
+			type: type
+		});
+	}
+
+	_tap(type, options, fn) {
+		if (typeof options === "string") {
+			options = {
+				name: options.trim()
+			};
+		} else if (typeof options !== "object" || options === null) {
+			throw new Error("Invalid tap options");
+		}
+		if (typeof options.name !== "string" || options.name === "") {
+			throw new Error("Missing name for tap");
+		}
+		if (typeof options.context !== "undefined") {
+			deprecateContext();
+		}
+		options = Object.assign({ type, fn }, options);
+		options = this._runRegisterInterceptors(options);
+		this._insert(options);
+	}
+
+	tap(options, fn) {
+		this._tap("sync", options, fn);
+	}
+
+	tapAsync(options, fn) {
+		this._tap("async", options, fn);
+	}
+
+	tapPromise(options, fn) {
+		this._tap("promise", options, fn);
+	}
+
+	_runRegisterInterceptors(options) {
+		for (const interceptor of this.interceptors) {
+			if (interceptor.register) {
+				const newOptions = interceptor.register(options);
+				if (newOptions !== undefined) {
+					options = newOptions;
+				}
+			}
+		}
+		return options;
+	}
+
+	withOptions(options) {
+		const mergeOptions = opt =>
+			Object.assign({}, options, typeof opt === "string" ? { name: opt } : opt);
+
+		return {
+			name: this.name,
+			tap: (opt, fn) => this.tap(mergeOptions(opt), fn),
+			tapAsync: (opt, fn) => this.tapAsync(mergeOptions(opt), fn),
+			tapPromise: (opt, fn) => this.tapPromise(mergeOptions(opt), fn),
+			intercept: interceptor => this.intercept(interceptor),
+			isUsed: () => this.isUsed(),
+			withOptions: opt => this.withOptions(mergeOptions(opt))
+		};
+	}
+
+	isUsed() {
+		return this.taps.length > 0 || this.interceptors.length > 0;
+	}
+
+	intercept(interceptor) {
+		this._resetCompilation();
+		this.interceptors.push(Object.assign({}, interceptor));
+		if (interceptor.register) {
+			for (let i = 0; i < this.taps.length; i++) {
+				this.taps[i] = interceptor.register(this.taps[i]);
+			}
+		}
+	}
+
+	_resetCompilation() {
+		this.call = this._call;
+		this.callAsync = this._callAsync;
+		this.promise = this._promise;
+	}
+
+	_insert(item) {
+		this._resetCompilation();
+		let before;
+		if (typeof item.before === "string") {
+			before = new Set([item.before]);
+		} else if (Array.isArray(item.before)) {
+			before = new Set(item.before);
+		}
+		let stage = 0;
+		if (typeof item.stage === "number") {
+			stage = item.stage;
+		}
+		let i = this.taps.length;
+		while (i > 0) {
+			i--;
+			const x = this.taps[i];
+			this.taps[i + 1] = x;
+			const xStage = x.stage || 0;
+			if (before) {
+				if (before.has(x.name)) {
+					before.delete(x.name);
+					continue;
+				}
+				if (before.size > 0) {
+					continue;
+				}
+			}
+			if (xStage > stage) {
+				continue;
+			}
+			i++;
+			break;
+		}
+		this.taps[i] = item;
+	}
+}
+
+Object.setPrototypeOf(Hook.prototype, null);
+
+module.exports = Hook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/HookCodeFactory.js b/node_modules/mathjs/examples/node_modules/tapable/lib/HookCodeFactory.js
new file mode 100644
index 0000000..c9f5340
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/HookCodeFactory.js
@@ -0,0 +1,468 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+class HookCodeFactory {
+	constructor(config) {
+		this.config = config;
+		this.options = undefined;
+		this._args = undefined;
+	}
+
+	create(options) {
+		this.init(options);
+		let fn;
+		switch (this.options.type) {
+			case "sync":
+				fn = new Function(
+					this.args(),
+					'"use strict";\n' +
+						this.header() +
+						this.contentWithInterceptors({
+							onError: err => `throw ${err};\n`,
+							onResult: result => `return ${result};\n`,
+							resultReturns: true,
+							onDone: () => "",
+							rethrowIfPossible: true
+						})
+				);
+				break;
+			case "async":
+				fn = new Function(
+					this.args({
+						after: "_callback"
+					}),
+					'"use strict";\n' +
+						this.header() +
+						this.contentWithInterceptors({
+							onError: err => `_callback(${err});\n`,
+							onResult: result => `_callback(null, ${result});\n`,
+							onDone: () => "_callback();\n"
+						})
+				);
+				break;
+			case "promise":
+				let errorHelperUsed = false;
+				const content = this.contentWithInterceptors({
+					onError: err => {
+						errorHelperUsed = true;
+						return `_error(${err});\n`;
+					},
+					onResult: result => `_resolve(${result});\n`,
+					onDone: () => "_resolve();\n"
+				});
+				let code = "";
+				code += '"use strict";\n';
+				code += this.header();
+				code += "return new Promise((function(_resolve, _reject) {\n";
+				if (errorHelperUsed) {
+					code += "var _sync = true;\n";
+					code += "function _error(_err) {\n";
+					code += "if(_sync)\n";
+					code +=
+						"_resolve(Promise.resolve().then((function() { throw _err; })));\n";
+					code += "else\n";
+					code += "_reject(_err);\n";
+					code += "};\n";
+				}
+				code += content;
+				if (errorHelperUsed) {
+					code += "_sync = false;\n";
+				}
+				code += "}));\n";
+				fn = new Function(this.args(), code);
+				break;
+		}
+		this.deinit();
+		return fn;
+	}
+
+	setup(instance, options) {
+		instance._x = options.taps.map(t => t.fn);
+	}
+
+	/**
+	 * @param {{ type: "sync" | "promise" | "async", taps: Array<Tap>, interceptors: Array<Interceptor> }} options
+	 */
+	init(options) {
+		this.options = options;
+		this._args = options.args.slice();
+	}
+
+	deinit() {
+		this.options = undefined;
+		this._args = undefined;
+	}
+
+	contentWithInterceptors(options) {
+		if (this.options.interceptors.length > 0) {
+			const onError = options.onError;
+			const onResult = options.onResult;
+			const onDone = options.onDone;
+			let code = "";
+			for (let i = 0; i < this.options.interceptors.length; i++) {
+				const interceptor = this.options.interceptors[i];
+				if (interceptor.call) {
+					code += `${this.getInterceptor(i)}.call(${this.args({
+						before: interceptor.context ? "_context" : undefined
+					})});\n`;
+				}
+			}
+			code += this.content(
+				Object.assign(options, {
+					onError:
+						onError &&
+						(err => {
+							let code = "";
+							for (let i = 0; i < this.options.interceptors.length; i++) {
+								const interceptor = this.options.interceptors[i];
+								if (interceptor.error) {
+									code += `${this.getInterceptor(i)}.error(${err});\n`;
+								}
+							}
+							code += onError(err);
+							return code;
+						}),
+					onResult:
+						onResult &&
+						(result => {
+							let code = "";
+							for (let i = 0; i < this.options.interceptors.length; i++) {
+								const interceptor = this.options.interceptors[i];
+								if (interceptor.result) {
+									code += `${this.getInterceptor(i)}.result(${result});\n`;
+								}
+							}
+							code += onResult(result);
+							return code;
+						}),
+					onDone:
+						onDone &&
+						(() => {
+							let code = "";
+							for (let i = 0; i < this.options.interceptors.length; i++) {
+								const interceptor = this.options.interceptors[i];
+								if (interceptor.done) {
+									code += `${this.getInterceptor(i)}.done();\n`;
+								}
+							}
+							code += onDone();
+							return code;
+						})
+				})
+			);
+			return code;
+		} else {
+			return this.content(options);
+		}
+	}
+
+	header() {
+		let code = "";
+		if (this.needContext()) {
+			code += "var _context = {};\n";
+		} else {
+			code += "var _context;\n";
+		}
+		code += "var _x = this._x;\n";
+		if (this.options.interceptors.length > 0) {
+			code += "var _taps = this.taps;\n";
+			code += "var _interceptors = this.interceptors;\n";
+		}
+		return code;
+	}
+
+	needContext() {
+		for (const tap of this.options.taps) if (tap.context) return true;
+		return false;
+	}
+
+	callTap(tapIndex, { onError, onResult, onDone, rethrowIfPossible }) {
+		let code = "";
+		let hasTapCached = false;
+		for (let i = 0; i < this.options.interceptors.length; i++) {
+			const interceptor = this.options.interceptors[i];
+			if (interceptor.tap) {
+				if (!hasTapCached) {
+					code += `var _tap${tapIndex} = ${this.getTap(tapIndex)};\n`;
+					hasTapCached = true;
+				}
+				code += `${this.getInterceptor(i)}.tap(${
+					interceptor.context ? "_context, " : ""
+				}_tap${tapIndex});\n`;
+			}
+		}
+		code += `var _fn${tapIndex} = ${this.getTapFn(tapIndex)};\n`;
+		const tap = this.options.taps[tapIndex];
+		switch (tap.type) {
+			case "sync":
+				if (!rethrowIfPossible) {
+					code += `var _hasError${tapIndex} = false;\n`;
+					code += "try {\n";
+				}
+				if (onResult) {
+					code += `var _result${tapIndex} = _fn${tapIndex}(${this.args({
+						before: tap.context ? "_context" : undefined
+					})});\n`;
+				} else {
+					code += `_fn${tapIndex}(${this.args({
+						before: tap.context ? "_context" : undefined
+					})});\n`;
+				}
+				if (!rethrowIfPossible) {
+					code += "} catch(_err) {\n";
+					code += `_hasError${tapIndex} = true;\n`;
+					code += onError("_err");
+					code += "}\n";
+					code += `if(!_hasError${tapIndex}) {\n`;
+				}
+				if (onResult) {
+					code += onResult(`_result${tapIndex}`);
+				}
+				if (onDone) {
+					code += onDone();
+				}
+				if (!rethrowIfPossible) {
+					code += "}\n";
+				}
+				break;
+			case "async":
+				let cbCode = "";
+				if (onResult)
+					cbCode += `(function(_err${tapIndex}, _result${tapIndex}) {\n`;
+				else cbCode += `(function(_err${tapIndex}) {\n`;
+				cbCode += `if(_err${tapIndex}) {\n`;
+				cbCode += onError(`_err${tapIndex}`);
+				cbCode += "} else {\n";
+				if (onResult) {
+					cbCode += onResult(`_result${tapIndex}`);
+				}
+				if (onDone) {
+					cbCode += onDone();
+				}
+				cbCode += "}\n";
+				cbCode += "})";
+				code += `_fn${tapIndex}(${this.args({
+					before: tap.context ? "_context" : undefined,
+					after: cbCode
+				})});\n`;
+				break;
+			case "promise":
+				code += `var _hasResult${tapIndex} = false;\n`;
+				code += `var _promise${tapIndex} = _fn${tapIndex}(${this.args({
+					before: tap.context ? "_context" : undefined
+				})});\n`;
+				code += `if (!_promise${tapIndex} || !_promise${tapIndex}.then)\n`;
+				code += `  throw new Error('Tap function (tapPromise) did not return promise (returned ' + _promise${tapIndex} + ')');\n`;
+				code += `_promise${tapIndex}.then((function(_result${tapIndex}) {\n`;
+				code += `_hasResult${tapIndex} = true;\n`;
+				if (onResult) {
+					code += onResult(`_result${tapIndex}`);
+				}
+				if (onDone) {
+					code += onDone();
+				}
+				code += `}), function(_err${tapIndex}) {\n`;
+				code += `if(_hasResult${tapIndex}) throw _err${tapIndex};\n`;
+				code += onError(`_err${tapIndex}`);
+				code += "});\n";
+				break;
+		}
+		return code;
+	}
+
+	callTapsSeries({
+		onError,
+		onResult,
+		resultReturns,
+		onDone,
+		doneReturns,
+		rethrowIfPossible
+	}) {
+		if (this.options.taps.length === 0) return onDone();
+		const firstAsync = this.options.taps.findIndex(t => t.type !== "sync");
+		const somethingReturns = resultReturns || doneReturns;
+		let code = "";
+		let current = onDone;
+		let unrollCounter = 0;
+		for (let j = this.options.taps.length - 1; j >= 0; j--) {
+			const i = j;
+			const unroll =
+				current !== onDone &&
+				(this.options.taps[i].type !== "sync" || unrollCounter++ > 20);
+			if (unroll) {
+				unrollCounter = 0;
+				code += `function _next${i}() {\n`;
+				code += current();
+				code += `}\n`;
+				current = () => `${somethingReturns ? "return " : ""}_next${i}();\n`;
+			}
+			const done = current;
+			const doneBreak = skipDone => {
+				if (skipDone) return "";
+				return onDone();
+			};
+			const content = this.callTap(i, {
+				onError: error => onError(i, error, done, doneBreak),
+				onResult:
+					onResult &&
+					(result => {
+						return onResult(i, result, done, doneBreak);
+					}),
+				onDone: !onResult && done,
+				rethrowIfPossible:
+					rethrowIfPossible && (firstAsync < 0 || i < firstAsync)
+			});
+			current = () => content;
+		}
+		code += current();
+		return code;
+	}
+
+	callTapsLooping({ onError, onDone, rethrowIfPossible }) {
+		if (this.options.taps.length === 0) return onDone();
+		const syncOnly = this.options.taps.every(t => t.type === "sync");
+		let code = "";
+		if (!syncOnly) {
+			code += "var _looper = (function() {\n";
+			code += "var _loopAsync = false;\n";
+		}
+		code += "var _loop;\n";
+		code += "do {\n";
+		code += "_loop = false;\n";
+		for (let i = 0; i < this.options.interceptors.length; i++) {
+			const interceptor = this.options.interceptors[i];
+			if (interceptor.loop) {
+				code += `${this.getInterceptor(i)}.loop(${this.args({
+					before: interceptor.context ? "_context" : undefined
+				})});\n`;
+			}
+		}
+		code += this.callTapsSeries({
+			onError,
+			onResult: (i, result, next, doneBreak) => {
+				let code = "";
+				code += `if(${result} !== undefined) {\n`;
+				code += "_loop = true;\n";
+				if (!syncOnly) code += "if(_loopAsync) _looper();\n";
+				code += doneBreak(true);
+				code += `} else {\n`;
+				code += next();
+				code += `}\n`;
+				return code;
+			},
+			onDone:
+				onDone &&
+				(() => {
+					let code = "";
+					code += "if(!_loop) {\n";
+					code += onDone();
+					code += "}\n";
+					return code;
+				}),
+			rethrowIfPossible: rethrowIfPossible && syncOnly
+		});
+		code += "} while(_loop);\n";
+		if (!syncOnly) {
+			code += "_loopAsync = true;\n";
+			code += "});\n";
+			code += "_looper();\n";
+		}
+		return code;
+	}
+
+	callTapsParallel({
+		onError,
+		onResult,
+		onDone,
+		rethrowIfPossible,
+		onTap = (i, run) => run()
+	}) {
+		if (this.options.taps.length <= 1) {
+			return this.callTapsSeries({
+				onError,
+				onResult,
+				onDone,
+				rethrowIfPossible
+			});
+		}
+		let code = "";
+		code += "do {\n";
+		code += `var _counter = ${this.options.taps.length};\n`;
+		if (onDone) {
+			code += "var _done = (function() {\n";
+			code += onDone();
+			code += "});\n";
+		}
+		for (let i = 0; i < this.options.taps.length; i++) {
+			const done = () => {
+				if (onDone) return "if(--_counter === 0) _done();\n";
+				else return "--_counter;";
+			};
+			const doneBreak = skipDone => {
+				if (skipDone || !onDone) return "_counter = 0;\n";
+				else return "_counter = 0;\n_done();\n";
+			};
+			code += "if(_counter <= 0) break;\n";
+			code += onTap(
+				i,
+				() =>
+					this.callTap(i, {
+						onError: error => {
+							let code = "";
+							code += "if(_counter > 0) {\n";
+							code += onError(i, error, done, doneBreak);
+							code += "}\n";
+							return code;
+						},
+						onResult:
+							onResult &&
+							(result => {
+								let code = "";
+								code += "if(_counter > 0) {\n";
+								code += onResult(i, result, done, doneBreak);
+								code += "}\n";
+								return code;
+							}),
+						onDone:
+							!onResult &&
+							(() => {
+								return done();
+							}),
+						rethrowIfPossible
+					}),
+				done,
+				doneBreak
+			);
+		}
+		code += "} while(false);\n";
+		return code;
+	}
+
+	args({ before, after } = {}) {
+		let allArgs = this._args;
+		if (before) allArgs = [before].concat(allArgs);
+		if (after) allArgs = allArgs.concat(after);
+		if (allArgs.length === 0) {
+			return "";
+		} else {
+			return allArgs.join(", ");
+		}
+	}
+
+	getTapFn(idx) {
+		return `_x[${idx}]`;
+	}
+
+	getTap(idx) {
+		return `_taps[${idx}]`;
+	}
+
+	getInterceptor(idx) {
+		return `_interceptors[${idx}]`;
+	}
+}
+
+module.exports = HookCodeFactory;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/HookMap.js b/node_modules/mathjs/examples/node_modules/tapable/lib/HookMap.js
new file mode 100644
index 0000000..129ad6a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/HookMap.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const util = require("util");
+
+const defaultFactory = (key, hook) => hook;
+
+class HookMap {
+	constructor(factory, name = undefined) {
+		this._map = new Map();
+		this.name = name;
+		this._factory = factory;
+		this._interceptors = [];
+	}
+
+	get(key) {
+		return this._map.get(key);
+	}
+
+	for(key) {
+		const hook = this.get(key);
+		if (hook !== undefined) {
+			return hook;
+		}
+		let newHook = this._factory(key);
+		const interceptors = this._interceptors;
+		for (let i = 0; i < interceptors.length; i++) {
+			newHook = interceptors[i].factory(key, newHook);
+		}
+		this._map.set(key, newHook);
+		return newHook;
+	}
+
+	intercept(interceptor) {
+		this._interceptors.push(
+			Object.assign(
+				{
+					factory: defaultFactory
+				},
+				interceptor
+			)
+		);
+	}
+}
+
+HookMap.prototype.tap = util.deprecate(function(key, options, fn) {
+	return this.for(key).tap(options, fn);
+}, "HookMap#tap(key,…) is deprecated. Use HookMap#for(key).tap(…) instead.");
+
+HookMap.prototype.tapAsync = util.deprecate(function(key, options, fn) {
+	return this.for(key).tapAsync(options, fn);
+}, "HookMap#tapAsync(key,…) is deprecated. Use HookMap#for(key).tapAsync(…) instead.");
+
+HookMap.prototype.tapPromise = util.deprecate(function(key, options, fn) {
+	return this.for(key).tapPromise(options, fn);
+}, "HookMap#tapPromise(key,…) is deprecated. Use HookMap#for(key).tapPromise(…) instead.");
+
+module.exports = HookMap;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/MultiHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/MultiHook.js
new file mode 100644
index 0000000..e4fc2ce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/MultiHook.js
@@ -0,0 +1,54 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+
+class MultiHook {
+	constructor(hooks, name = undefined) {
+		this.hooks = hooks;
+		this.name = name;
+	}
+
+	tap(options, fn) {
+		for (const hook of this.hooks) {
+			hook.tap(options, fn);
+		}
+	}
+
+	tapAsync(options, fn) {
+		for (const hook of this.hooks) {
+			hook.tapAsync(options, fn);
+		}
+	}
+
+	tapPromise(options, fn) {
+		for (const hook of this.hooks) {
+			hook.tapPromise(options, fn);
+		}
+	}
+
+	isUsed() {
+		for (const hook of this.hooks) {
+			if (hook.isUsed()) return true;
+		}
+		return false;
+	}
+
+	intercept(interceptor) {
+		for (const hook of this.hooks) {
+			hook.intercept(interceptor);
+		}
+	}
+
+	withOptions(options) {
+		return new MultiHook(
+			this.hooks.map(h => h.withOptions(options)),
+			this.name
+		);
+	}
+}
+
+module.exports = MultiHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/SyncBailHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncBailHook.js
new file mode 100644
index 0000000..bdd5b45
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncBailHook.js
@@ -0,0 +1,51 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class SyncBailHookCodeFactory extends HookCodeFactory {
+	content({ onError, onResult, resultReturns, onDone, rethrowIfPossible }) {
+		return this.callTapsSeries({
+			onError: (i, err) => onError(err),
+			onResult: (i, result, next) =>
+				`if(${result} !== undefined) {\n${onResult(
+					result
+				)};\n} else {\n${next()}}\n`,
+			resultReturns,
+			onDone,
+			rethrowIfPossible
+		});
+	}
+}
+
+const factory = new SyncBailHookCodeFactory();
+
+const TAP_ASYNC = () => {
+	throw new Error("tapAsync is not supported on a SyncBailHook");
+};
+
+const TAP_PROMISE = () => {
+	throw new Error("tapPromise is not supported on a SyncBailHook");
+};
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function SyncBailHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = SyncBailHook;
+	hook.tapAsync = TAP_ASYNC;
+	hook.tapPromise = TAP_PROMISE;
+	hook.compile = COMPILE;
+	return hook;
+}
+
+SyncBailHook.prototype = null;
+
+module.exports = SyncBailHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/SyncHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncHook.js
new file mode 100644
index 0000000..e2512be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncHook.js
@@ -0,0 +1,46 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class SyncHookCodeFactory extends HookCodeFactory {
+	content({ onError, onDone, rethrowIfPossible }) {
+		return this.callTapsSeries({
+			onError: (i, err) => onError(err),
+			onDone,
+			rethrowIfPossible
+		});
+	}
+}
+
+const factory = new SyncHookCodeFactory();
+
+const TAP_ASYNC = () => {
+	throw new Error("tapAsync is not supported on a SyncHook");
+};
+
+const TAP_PROMISE = () => {
+	throw new Error("tapPromise is not supported on a SyncHook");
+};
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function SyncHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = SyncHook;
+	hook.tapAsync = TAP_ASYNC;
+	hook.tapPromise = TAP_PROMISE;
+	hook.compile = COMPILE;
+	return hook;
+}
+
+SyncHook.prototype = null;
+
+module.exports = SyncHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/SyncLoopHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncLoopHook.js
new file mode 100644
index 0000000..be0e4fd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncLoopHook.js
@@ -0,0 +1,46 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class SyncLoopHookCodeFactory extends HookCodeFactory {
+	content({ onError, onDone, rethrowIfPossible }) {
+		return this.callTapsLooping({
+			onError: (i, err) => onError(err),
+			onDone,
+			rethrowIfPossible
+		});
+	}
+}
+
+const factory = new SyncLoopHookCodeFactory();
+
+const TAP_ASYNC = () => {
+	throw new Error("tapAsync is not supported on a SyncLoopHook");
+};
+
+const TAP_PROMISE = () => {
+	throw new Error("tapPromise is not supported on a SyncLoopHook");
+};
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function SyncLoopHook(args = [], name = undefined) {
+	const hook = new Hook(args, name);
+	hook.constructor = SyncLoopHook;
+	hook.tapAsync = TAP_ASYNC;
+	hook.tapPromise = TAP_PROMISE;
+	hook.compile = COMPILE;
+	return hook;
+}
+
+SyncLoopHook.prototype = null;
+
+module.exports = SyncLoopHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/SyncWaterfallHook.js b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncWaterfallHook.js
new file mode 100644
index 0000000..c878b7f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/SyncWaterfallHook.js
@@ -0,0 +1,57 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Hook = require("./Hook");
+const HookCodeFactory = require("./HookCodeFactory");
+
+class SyncWaterfallHookCodeFactory extends HookCodeFactory {
+	content({ onError, onResult, resultReturns, rethrowIfPossible }) {
+		return this.callTapsSeries({
+			onError: (i, err) => onError(err),
+			onResult: (i, result, next) => {
+				let code = "";
+				code += `if(${result} !== undefined) {\n`;
+				code += `${this._args[0]} = ${result};\n`;
+				code += `}\n`;
+				code += next();
+				return code;
+			},
+			onDone: () => onResult(this._args[0]),
+			doneReturns: resultReturns,
+			rethrowIfPossible
+		});
+	}
+}
+
+const factory = new SyncWaterfallHookCodeFactory();
+
+const TAP_ASYNC = () => {
+	throw new Error("tapAsync is not supported on a SyncWaterfallHook");
+};
+
+const TAP_PROMISE = () => {
+	throw new Error("tapPromise is not supported on a SyncWaterfallHook");
+};
+
+const COMPILE = function(options) {
+	factory.setup(this, options);
+	return factory.create(options);
+};
+
+function SyncWaterfallHook(args = [], name = undefined) {
+	if (args.length < 1)
+		throw new Error("Waterfall hooks must have at least one argument");
+	const hook = new Hook(args, name);
+	hook.constructor = SyncWaterfallHook;
+	hook.tapAsync = TAP_ASYNC;
+	hook.tapPromise = TAP_PROMISE;
+	hook.compile = COMPILE;
+	return hook;
+}
+
+SyncWaterfallHook.prototype = null;
+
+module.exports = SyncWaterfallHook;
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/index.js b/node_modules/mathjs/examples/node_modules/tapable/lib/index.js
new file mode 100644
index 0000000..0a94a53
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/index.js
@@ -0,0 +1,19 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+exports.__esModule = true;
+exports.SyncHook = require("./SyncHook");
+exports.SyncBailHook = require("./SyncBailHook");
+exports.SyncWaterfallHook = require("./SyncWaterfallHook");
+exports.SyncLoopHook = require("./SyncLoopHook");
+exports.AsyncParallelHook = require("./AsyncParallelHook");
+exports.AsyncParallelBailHook = require("./AsyncParallelBailHook");
+exports.AsyncSeriesHook = require("./AsyncSeriesHook");
+exports.AsyncSeriesBailHook = require("./AsyncSeriesBailHook");
+exports.AsyncSeriesLoopHook = require("./AsyncSeriesLoopHook");
+exports.AsyncSeriesWaterfallHook = require("./AsyncSeriesWaterfallHook");
+exports.HookMap = require("./HookMap");
+exports.MultiHook = require("./MultiHook");
diff --git a/node_modules/mathjs/examples/node_modules/tapable/lib/util-browser.js b/node_modules/mathjs/examples/node_modules/tapable/lib/util-browser.js
new file mode 100644
index 0000000..ee4fb9a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/lib/util-browser.js
@@ -0,0 +1,16 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+exports.deprecate = (fn, msg) => {
+	let once = true;
+	return function() {
+		if (once) {
+			console.warn("DeprecationWarning: " + msg);
+			once = false;
+		}
+		return fn.apply(this, arguments);
+	};
+};
diff --git a/node_modules/mathjs/examples/node_modules/tapable/package.json b/node_modules/mathjs/examples/node_modules/tapable/package.json
new file mode 100644
index 0000000..3c13120
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/package.json
@@ -0,0 +1,44 @@
+{
+  "name": "tapable",
+  "version": "2.2.1",
+  "author": "Tobias Koppers @sokra",
+  "description": "Just a little module for plugins.",
+  "license": "MIT",
+  "homepage": "https://github.com/webpack/tapable",
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/webpack/tapable.git"
+  },
+  "devDependencies": {
+    "@babel/core": "^7.4.4",
+    "@babel/preset-env": "^7.4.4",
+    "babel-jest": "^24.8.0",
+    "codecov": "^3.5.0",
+    "jest": "^24.8.0",
+    "prettier": "^1.17.1"
+  },
+  "engines": {
+    "node": ">=6"
+  },
+  "files": [
+    "lib",
+    "!lib/__tests__",
+    "tapable.d.ts"
+  ],
+  "main": "lib/index.js",
+  "types": "./tapable.d.ts",
+  "browser": {
+    "util": "./lib/util-browser.js"
+  },
+  "scripts": {
+    "test": "jest",
+    "travis": "yarn pretty-lint && jest --coverage && codecov",
+    "pretty-lint": "prettier --check lib/*.js lib/__tests__/*.js",
+    "pretty": "prettier --loglevel warn --write lib/*.js lib/__tests__/*.js"
+  },
+  "jest": {
+    "transform": {
+      "__tests__[\\\\/].+\\.js$": "babel-jest"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/tapable/tapable.d.ts b/node_modules/mathjs/examples/node_modules/tapable/tapable.d.ts
new file mode 100644
index 0000000..0201c9a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/tapable/tapable.d.ts
@@ -0,0 +1,116 @@
+type FixedSizeArray<T extends number, U> = T extends 0
+	? void[]
+	: ReadonlyArray<U> & {
+			0: U;
+			length: T;
+	  };
+type Measure<T extends number> = T extends 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8
+	? T
+	: never;
+type Append<T extends any[], U> = {
+	0: [U];
+	1: [T[0], U];
+	2: [T[0], T[1], U];
+	3: [T[0], T[1], T[2], U];
+	4: [T[0], T[1], T[2], T[3], U];
+	5: [T[0], T[1], T[2], T[3], T[4], U];
+	6: [T[0], T[1], T[2], T[3], T[4], T[5], U];
+	7: [T[0], T[1], T[2], T[3], T[4], T[5], T[6], U];
+	8: [T[0], T[1], T[2], T[3], T[4], T[5], T[6], T[7], U];
+}[Measure<T["length"]>];
+type AsArray<T> = T extends any[] ? T : [T];
+
+declare class UnsetAdditionalOptions {
+	_UnsetAdditionalOptions: true
+}
+type IfSet<X> = X extends UnsetAdditionalOptions ? {} : X;
+
+type Callback<E, T> = (error: E | null, result?: T) => void;
+type InnerCallback<E, T> = (error?: E | null | false, result?: T) => void;
+
+type FullTap = Tap & {
+	type: "sync" | "async" | "promise",
+	fn: Function
+}
+
+type Tap = TapOptions & {
+	name: string;
+};
+
+type TapOptions = {
+	before?: string;
+	stage?: number;
+};
+
+interface HookInterceptor<T, R, AdditionalOptions = UnsetAdditionalOptions> {
+	name?: string;
+	tap?: (tap: FullTap & IfSet<AdditionalOptions>) => void;
+	call?: (...args: any[]) => void;
+	loop?: (...args: any[]) => void;
+	error?: (err: Error) => void;
+	result?: (result: R) => void;
+	done?: () => void;
+	register?: (tap: FullTap & IfSet<AdditionalOptions>) => FullTap & IfSet<AdditionalOptions>;
+}
+
+type ArgumentNames<T extends any[]> = FixedSizeArray<T["length"], string>;
+
+declare class Hook<T, R, AdditionalOptions = UnsetAdditionalOptions> {
+	constructor(args?: ArgumentNames<AsArray<T>>, name?: string);
+	name: string | undefined;
+	taps: FullTap[];
+	intercept(interceptor: HookInterceptor<T, R, AdditionalOptions>): void;
+	isUsed(): boolean;
+	callAsync(...args: Append<AsArray<T>, Callback<Error, R>>): void;
+	promise(...args: AsArray<T>): Promise<R>;
+	tap(options: string | Tap & IfSet<AdditionalOptions>, fn: (...args: AsArray<T>) => R): void;
+	withOptions(options: TapOptions & IfSet<AdditionalOptions>): Omit<this, "call" | "callAsync" | "promise">;
+}
+
+export class SyncHook<T, R = void, AdditionalOptions = UnsetAdditionalOptions> extends Hook<T, R, AdditionalOptions> {
+	call(...args: AsArray<T>): R;
+}
+
+export class SyncBailHook<T, R, AdditionalOptions = UnsetAdditionalOptions> extends SyncHook<T, R, AdditionalOptions> {}
+export class SyncLoopHook<T, AdditionalOptions = UnsetAdditionalOptions> extends SyncHook<T, void, AdditionalOptions> {}
+export class SyncWaterfallHook<T, AdditionalOptions = UnsetAdditionalOptions> extends SyncHook<T, AsArray<T>[0], AdditionalOptions> {}
+
+declare class AsyncHook<T, R, AdditionalOptions = UnsetAdditionalOptions> extends Hook<T, R, AdditionalOptions> {
+	tapAsync(
+		options: string | Tap & IfSet<AdditionalOptions>,
+		fn: (...args: Append<AsArray<T>, InnerCallback<Error, R>>) => void
+	): void;
+	tapPromise(
+		options: string | Tap & IfSet<AdditionalOptions>,
+		fn: (...args: AsArray<T>) => Promise<R>
+	): void;
+}
+
+export class AsyncParallelHook<T, AdditionalOptions = UnsetAdditionalOptions> extends AsyncHook<T, void, AdditionalOptions> {}
+export class AsyncParallelBailHook<T, R, AdditionalOptions = UnsetAdditionalOptions> extends AsyncHook<T, R, AdditionalOptions> {}
+export class AsyncSeriesHook<T, AdditionalOptions = UnsetAdditionalOptions> extends AsyncHook<T, void, AdditionalOptions> {}
+export class AsyncSeriesBailHook<T, R, AdditionalOptions = UnsetAdditionalOptions> extends AsyncHook<T, R, AdditionalOptions> {}
+export class AsyncSeriesLoopHook<T, AdditionalOptions = UnsetAdditionalOptions> extends AsyncHook<T, void, AdditionalOptions> {}
+export class AsyncSeriesWaterfallHook<T, AdditionalOptions = UnsetAdditionalOptions> extends AsyncHook<T, AsArray<T>[0], AdditionalOptions> {}
+
+type HookFactory<H> = (key: any, hook?: H) => H;
+
+interface HookMapInterceptor<H> {
+	factory?: HookFactory<H>;
+}
+
+export class HookMap<H> {
+	constructor(factory: HookFactory<H>, name?: string);
+	name: string | undefined;
+	get(key: any): H | undefined;
+	for(key: any): H;
+	intercept(interceptor: HookMapInterceptor<H>): void;
+}
+
+export class MultiHook<H> {
+	constructor(hooks: H[], name?: string);
+	name: string | undefined;
+	tap(options: string | Tap, fn?: Function): void;
+	tapAsync(options: string | Tap, fn?: Function): void;
+	tapPromise(options: string | Tap, fn?: Function): void;
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/LICENSE b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/LICENSE
new file mode 100644
index 0000000..8c11fc7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/LICENSE
@@ -0,0 +1,20 @@
+Copyright JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/README.md b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/README.md
new file mode 100644
index 0000000..9687223
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/README.md
@@ -0,0 +1,742 @@
+<div align="center">
+  <a href="https://github.com/webpack/webpack">
+    <img width="200" height="200" src="https://webpack.js.org/assets/icon-square-big.svg">
+  </a>
+</div>
+
+[![npm][npm]][npm-url]
+[![node][node]][node-url]
+[![deps][deps]][deps-url]
+[![tests][tests]][tests-url]
+[![cover][cover]][cover-url]
+[![chat][chat]][chat-url]
+[![size][size]][size-url]
+
+# terser-webpack-plugin
+
+This plugin uses [terser](https://github.com/terser/terser) to minify/minimize your JavaScript.
+
+## Getting Started
+
+Webpack v5 comes with the latest `terser-webpack-plugin` out of the box. If you are using Webpack v5 or above and wish to customize the options, you will still need to install `terser-webpack-plugin`. Using Webpack v4, you have to install `terser-webpack-plugin` v4.
+
+To begin, you'll need to install `terser-webpack-plugin`:
+
+```console
+$ npm install terser-webpack-plugin --save-dev
+```
+
+Then add the plugin to your `webpack` config. For example:
+
+**webpack.config.js**
+
+```js
+const TerserPlugin = require("terser-webpack-plugin");
+
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [new TerserPlugin()],
+  },
+};
+```
+
+And run `webpack` via your preferred method.
+
+## Note about source maps
+
+**Works only with `source-map`, `inline-source-map`, `hidden-source-map` and `nosources-source-map` values for the [`devtool`](https://webpack.js.org/configuration/devtool/) option.**
+
+Why?
+
+- `eval` wraps modules in `eval("string")` and the minimizer does not handle strings.
+- `cheap` has not column information and minimizer generate only a single line, which leave only a single mapping.
+
+Using supported `devtool` values enable source map generation.
+
+## Options
+
+|                   Name                    |                                      Type                                       |                           Default                            | Description                                                               |
+| :---------------------------------------: | :-----------------------------------------------------------------------------: | :----------------------------------------------------------: | :------------------------------------------------------------------------ |
+|            **[`test`](#test)**            |                     `String\|RegExp\|Array<String\|RegExp>`                     |                     `/\.m?js(\?.*)?$/i`                      | Test to match files against.                                              |
+|         **[`include`](#include)**         |                     `String\|RegExp\|Array<String\|RegExp>`                     |                         `undefined`                          | Files to include.                                                         |
+|         **[`exclude`](#exclude)**         |                     `String\|RegExp\|Array<String\|RegExp>`                     |                         `undefined`                          | Files to exclude.                                                         |
+|        **[`parallel`](#parallel)**        |                                `Boolean\|Number`                                |                            `true`                            | Use multi-process parallel running to improve the build speed.            |
+|          **[`minify`](#minify)**          |                                   `Function`                                    |                 `TerserPlugin.terserMinify`                  | Allows you to override default minify function.                           |
+|   **[`terserOptions`](#terseroptions)**   |                                    `Object`                                     | [`default`](https://github.com/terser/terser#minify-options) | Terser [minify options](https://github.com/terser/terser#minify-options). |
+| **[`extractComments`](#extractcomments)** | `Boolean\|String\|RegExp\|Function<(node, comment) -> Boolean\|Object>\|Object` |                            `true`                            | Whether comments shall be extracted to a separate file.                   |
+
+### `test`
+
+Type: `String|RegExp|Array<String|RegExp>`
+Default: `/\.m?js(\?.*)?$/i`
+
+Test to match files against.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        test: /\.js(\?.*)?$/i,
+      }),
+    ],
+  },
+};
+```
+
+### `include`
+
+Type: `String|RegExp|Array<String|RegExp>`
+Default: `undefined`
+
+Files to include.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        include: /\/includes/,
+      }),
+    ],
+  },
+};
+```
+
+### `exclude`
+
+Type: `String|RegExp|Array<String|RegExp>`
+Default: `undefined`
+
+Files to exclude.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        exclude: /\/excludes/,
+      }),
+    ],
+  },
+};
+```
+
+### `parallel`
+
+Type: `Boolean|Number`
+Default: `true`
+
+Use multi-process parallel running to improve the build speed.
+Default number of concurrent runs: `os.cpus().length - 1`.
+
+> ℹ️ Parallelization can speedup your build significantly and is therefore **highly recommended**.
+
+> ⚠️ If you use **Circle CI** or any other environment that doesn't provide real available count of CPUs then you need to setup explicitly number of CPUs to avoid `Error: Call retries were exceeded` (see [#143](https://github.com/webpack-contrib/terser-webpack-plugin/issues/143), [#202](https://github.com/webpack-contrib/terser-webpack-plugin/issues/202)).
+
+#### `Boolean`
+
+Enable/disable multi-process parallel running.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        parallel: true,
+      }),
+    ],
+  },
+};
+```
+
+#### `Number`
+
+Enable multi-process parallel running and set number of concurrent runs.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        parallel: 4,
+      }),
+    ],
+  },
+};
+```
+
+### `minify`
+
+Type: `Function`
+Default: `TerserPlugin.terserMinify`
+
+Allows you to override default minify function.
+By default plugin uses [terser](https://github.com/terser/terser) package.
+Useful for using and testing unpublished versions or forks.
+
+> ⚠️ **Always use `require` inside `minify` function when `parallel` option enabled**.
+
+**webpack.config.js**
+
+```js
+// Can be async
+const minify = (input, sourceMap, minimizerOptions, extractsComments) => {
+  // The `minimizerOptions` option contains option from the `terserOptions` option
+  // You can use `minimizerOptions.myCustomOption`
+
+  // Custom logic for extract comments
+  const { map, code } = require("uglify-module") // Or require('./path/to/uglify-module')
+    .minify(input, {
+      /* Your options for minification */
+    });
+
+  return { map, code, warnings: [], errors: [], extractedComments: [] };
+};
+
+// Used to regenerate `fullhash`/`chunkhash` between different implementation
+// Example: you fix a bug in custom minimizer/custom function, but unfortunately webpack doesn't know about it, so you will get the same fullhash/chunkhash
+// to avoid this you can provide version of your custom minimizer
+// You don't need if you use only `contenthash`
+minify.getMinimizerVersion = () => {
+  let packageJson;
+
+  try {
+    // eslint-disable-next-line global-require, import/no-extraneous-dependencies
+    packageJson = require("uglify-module/package.json");
+  } catch (error) {
+    // Ignore
+  }
+
+  return packageJson && packageJson.version;
+};
+
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        terserOptions: {
+          myCustomOption: true,
+        },
+        minify,
+      }),
+    ],
+  },
+};
+```
+
+### `terserOptions`
+
+Type: `Object`
+Default: [default](https://github.com/terser/terser#minify-options)
+
+Terser [options](https://github.com/terser/terser#minify-options).
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        terserOptions: {
+          ecma: undefined,
+          parse: {},
+          compress: {},
+          mangle: true, // Note `mangle.properties` is `false` by default.
+          module: false,
+          // Deprecated
+          output: null,
+          format: null,
+          toplevel: false,
+          nameCache: null,
+          ie8: false,
+          keep_classnames: undefined,
+          keep_fnames: false,
+          safari10: false,
+        },
+      }),
+    ],
+  },
+};
+```
+
+### `extractComments`
+
+Type: `Boolean|String|RegExp|Function<(node, comment) -> Boolean|Object>|Object`
+Default: `true`
+
+Whether comments shall be extracted to a separate file, (see [details](https://github.com/webpack/webpack/commit/71933e979e51c533b432658d5e37917f9e71595a)).
+By default extract only comments using `/^\**!|@preserve|@license|@cc_on/i` regexp condition and remove remaining comments.
+If the original file is named `foo.js`, then the comments will be stored to `foo.js.LICENSE.txt`.
+The `terserOptions.format.comments` option specifies whether the comment will be preserved, i.e. it is possible to preserve some comments (e.g. annotations) while extracting others or even preserving comments that have been extracted.
+
+#### `Boolean`
+
+Enable/disable extracting comments.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: true,
+      }),
+    ],
+  },
+};
+```
+
+#### `String`
+
+Extract `all` or `some` (use `/^\**!|@preserve|@license|@cc_on/i` RegExp) comments.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: "all",
+      }),
+    ],
+  },
+};
+```
+
+#### `RegExp`
+
+All comments that match the given expression will be extracted to the separate file.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: /@extract/i,
+      }),
+    ],
+  },
+};
+```
+
+#### `Function<(node, comment) -> Boolean>`
+
+All comments that match the given expression will be extracted to the separate file.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: (astNode, comment) => {
+          if (/@extract/i.test(comment.value)) {
+            return true;
+          }
+
+          return false;
+        },
+      }),
+    ],
+  },
+};
+```
+
+#### `Object`
+
+Allow to customize condition for extract comments, specify extracted file name and banner.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: {
+          condition: /^\**!|@preserve|@license|@cc_on/i,
+          filename: (fileData) => {
+            // The "fileData" argument contains object with "filename", "basename", "query" and "hash"
+            return `${fileData.filename}.LICENSE.txt${fileData.query}`;
+          },
+          banner: (licenseFile) => {
+            return `License information can be found in ${licenseFile}`;
+          },
+        },
+      }),
+    ],
+  },
+};
+```
+
+##### `condition`
+
+Type: `Boolean|String|RegExp|Function<(node, comment) -> Boolean|Object>`
+
+Condition what comments you need extract.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: {
+          condition: "some",
+          filename: (fileData) => {
+            // The "fileData" argument contains object with "filename", "basename", "query" and "hash"
+            return `${fileData.filename}.LICENSE.txt${fileData.query}`;
+          },
+          banner: (licenseFile) => {
+            return `License information can be found in ${licenseFile}`;
+          },
+        },
+      }),
+    ],
+  },
+};
+```
+
+##### `filename`
+
+Type: `String|Function<(string) -> String>`
+Default: `[file].LICENSE.txt[query]`
+
+Available placeholders: `[file]`, `[query]` and `[filebase]` (`[base]` for webpack 5).
+
+The file where the extracted comments will be stored.
+Default is to append the suffix `.LICENSE.txt` to the original filename.
+
+> ⚠️ We highly recommend using the `txt` extension. Using `js`/`cjs`/`mjs` extensions may conflict with existing assets which leads to broken code.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: {
+          condition: /^\**!|@preserve|@license|@cc_on/i,
+          filename: "extracted-comments.js",
+          banner: (licenseFile) => {
+            return `License information can be found in ${licenseFile}`;
+          },
+        },
+      }),
+    ],
+  },
+};
+```
+
+##### `banner`
+
+Type: `Boolean|String|Function<(string) -> String>`
+Default: `/*! For license information please see ${commentsFile} */`
+
+The banner text that points to the extracted file and will be added on top of the original file.
+Can be `false` (no banner), a `String`, or a `Function<(string) -> String>` that will be called with the filename where extracted comments have been stored.
+Will be wrapped into comment.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        extractComments: {
+          condition: true,
+          filename: (fileData) => {
+            // The "fileData" argument contains object with "filename", "basename", "query" and "hash"
+            return `${fileData.filename}.LICENSE.txt${fileData.query}`;
+          },
+          banner: (commentsFile) => {
+            return `My custom banner about license information ${commentsFile}`;
+          },
+        },
+      }),
+    ],
+  },
+};
+```
+
+## Examples
+
+### Preserve Comments
+
+Extract all legal comments (i.e. `/^\**!|@preserve|@license|@cc_on/i`) and preserve `/@license/i` comments.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        terserOptions: {
+          format: {
+            comments: /@license/i,
+          },
+        },
+        extractComments: true,
+      }),
+    ],
+  },
+};
+```
+
+### Remove Comments
+
+If you avoid building with comments, use this config:
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        terserOptions: {
+          format: {
+            comments: false,
+          },
+        },
+        extractComments: false,
+      }),
+    ],
+  },
+};
+```
+
+### [`uglify-js`](https://github.com/mishoo/UglifyJS)
+
+[`UglifyJS`](https://github.com/mishoo/UglifyJS) is a JavaScript parser, minifier, compressor and beautifier toolkit.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        minify: TerserPlugin.uglifyJsMinify,
+        // `terserOptions` options will be passed to `uglify-js`
+        // Link to options - https://github.com/mishoo/UglifyJS#minify-options
+        terserOptions: {},
+      }),
+    ],
+  },
+};
+```
+
+### [`swc`](https://github.com/swc-project/swc)
+
+[`swc`](https://github.com/swc-project/swc) is a super-fast compiler written in rust; producing widely-supported javascript from modern standards and typescript.
+
+> ⚠ the `extractComments` option is not supported and all comments will be removed by default, it will be fixed in future
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        minify: TerserPlugin.swcMinify,
+        // `terserOptions` options will be passed to `swc` (`@swc/core`)
+        // Link to options - https://swc.rs/docs/config-js-minify
+        terserOptions: {},
+      }),
+    ],
+  },
+};
+```
+
+### [`esbuild`](https://github.com/evanw/esbuild)
+
+[`esbuild`](https://github.com/evanw/esbuild) is an extremely fast JavaScript bundler and minifier.
+
+> ⚠ the `extractComments` option is not supported and all legal comments (i.e. copyright, licenses and etc) will be preserved
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        minify: TerserPlugin.esbuildMinify,
+        // `terserOptions` options will be passed to `esbuild`
+        // Link to options - https://esbuild.github.io/api/#minify
+        // Note: the `minify` options is true by default (and override other `minify*` options), so if you want to disable the `minifyIdentifiers` option (or other `minify*` options) please use:
+        // terserOptions: {
+        //   minify: false,
+        //   minifyWhitespace: true,
+        //   minifyIdentifiers: false,
+        //   minifySyntax: true,
+        // },
+        terserOptions: {},
+      }),
+    ],
+  },
+};
+```
+
+### Custom Minify Function
+
+Override default minify function - use `uglify-js` for minification.
+
+**webpack.config.js**
+
+```js
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        minify: (file, sourceMap) => {
+          // https://github.com/mishoo/UglifyJS2#minify-options
+          const uglifyJsOptions = {
+            /* your `uglify-js` package options */
+          };
+
+          if (sourceMap) {
+            uglifyJsOptions.sourceMap = {
+              content: sourceMap,
+            };
+          }
+
+          return require("uglify-js").minify(file, uglifyJsOptions);
+        },
+      }),
+    ],
+  },
+};
+```
+
+### Typescript
+
+With default terser minify function:
+
+```ts
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin({
+        terserOptions: {
+          compress: true,
+        },
+      }),
+    ],
+  },
+};
+```
+
+With built-in minify functions:
+
+```ts
+import type { JsMinifyOptions as SwcOptions } from "@swc/core";
+import type { MinifyOptions as UglifyJSOptions } from "uglify-js";
+import type { TransformOptions as EsbuildOptions } from "esbuild";
+import type { MinifyOptions as TerserOptions } from "terser";
+
+module.exports = {
+  optimization: {
+    minimize: true,
+    minimizer: [
+      new TerserPlugin<SwcOptions>({
+        minify: TerserPlugin.swcMinify,
+        terserOptions: {
+          // `swc` options
+        },
+      }),
+      new TerserPlugin<UglifyJSOptions>({
+        minify: TerserPlugin.uglifyJsMinify,
+        terserOptions: {
+          // `uglif-js` options
+        },
+      }),
+      new TerserPlugin<EsbuildOptions>({
+        minify: TerserPlugin.esbuildMinify,
+        terserOptions: {
+          // `esbuild` options
+        },
+      }),
+
+      // Alternative usage:
+      new TerserPlugin<TerserOptions>({
+        minify: TerserPlugin.terserMinify,
+        terserOptions: {
+          // `terser` options
+        },
+      }),
+    ],
+  },
+};
+```
+
+## Contributing
+
+Please take a moment to read our contributing guidelines if you haven't yet done so.
+
+[CONTRIBUTING](./.github/CONTRIBUTING.md)
+
+## License
+
+[MIT](./LICENSE)
+
+[npm]: https://img.shields.io/npm/v/terser-webpack-plugin.svg
+[npm-url]: https://npmjs.com/package/terser-webpack-plugin
+[node]: https://img.shields.io/node/v/terser-webpack-plugin.svg
+[node-url]: https://nodejs.org
+[deps]: https://david-dm.org/webpack-contrib/terser-webpack-plugin.svg
+[deps-url]: https://david-dm.org/webpack-contrib/terser-webpack-plugin
+[tests]: https://github.com/webpack-contrib/terser-webpack-plugin/workflows/terser-webpack-plugin/badge.svg
+[tests-url]: https://github.com/webpack-contrib/terser-webpack-plugin/actions
+[cover]: https://codecov.io/gh/webpack-contrib/terser-webpack-plugin/branch/master/graph/badge.svg
+[cover-url]: https://codecov.io/gh/webpack-contrib/terser-webpack-plugin
+[chat]: https://img.shields.io/badge/gitter-webpack%2Fwebpack-brightgreen.svg
+[chat-url]: https://gitter.im/webpack/webpack
+[size]: https://packagephobia.now.sh/badge?p=terser-webpack-plugin
+[size-url]: https://packagephobia.now.sh/result?p=terser-webpack-plugin
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/index.js b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/index.js
new file mode 100644
index 0000000..ec69fad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/index.js
@@ -0,0 +1,798 @@
+"use strict";
+
+const path = require("path");
+
+const os = require("os");
+
+const {
+  SourceMapConsumer
+} = require("source-map");
+
+const {
+  validate
+} = require("schema-utils");
+
+const serialize = require("serialize-javascript");
+
+const {
+  Worker
+} = require("jest-worker");
+
+const {
+  throttleAll,
+  terserMinify,
+  uglifyJsMinify,
+  swcMinify,
+  esbuildMinify
+} = require("./utils");
+
+const schema = require("./options.json");
+
+const {
+  minify
+} = require("./minify");
+/** @typedef {import("schema-utils/declarations/validate").Schema} Schema */
+
+/** @typedef {import("webpack").Compiler} Compiler */
+
+/** @typedef {import("webpack").Compilation} Compilation */
+
+/** @typedef {import("webpack").WebpackError} WebpackError */
+
+/** @typedef {import("webpack").Asset} Asset */
+
+/** @typedef {import("./utils.js").TerserECMA} TerserECMA */
+
+/** @typedef {import("./utils.js").TerserOptions} TerserOptions */
+
+/** @typedef {import("jest-worker").Worker} JestWorker */
+
+/** @typedef {import("source-map").RawSourceMap} RawSourceMap */
+
+/** @typedef {RegExp | string} Rule */
+
+/** @typedef {Rule[] | Rule} Rules */
+
+/**
+ * @callback ExtractCommentsFunction
+ * @param {any} astNode
+ * @param {{ value: string, type: 'comment1' | 'comment2' | 'comment3' | 'comment4', pos: number, line: number, col: number }} comment
+ * @returns {boolean}
+ */
+
+/**
+ * @typedef {boolean | 'all' | 'some' | RegExp | ExtractCommentsFunction} ExtractCommentsCondition
+ */
+
+/**
+ * @typedef {string | ((fileData: any) => string)} ExtractCommentsFilename
+ */
+
+/**
+ * @typedef {boolean | string | ((commentsFile: string) => string)} ExtractCommentsBanner
+ */
+
+/**
+ * @typedef {Object} ExtractCommentsObject
+ * @property {ExtractCommentsCondition} [condition]
+ * @property {ExtractCommentsFilename} [filename]
+ * @property {ExtractCommentsBanner} [banner]
+ */
+
+/**
+ * @typedef {ExtractCommentsCondition | ExtractCommentsObject} ExtractCommentsOptions
+ */
+
+/**
+ * @typedef {Object} MinimizedResult
+ * @property {string} code
+ * @property {RawSourceMap} [map]
+ * @property {Array<Error | string>} [errors]
+ * @property {Array<Error | string>} [warnings]
+ * @property {Array<string>} [extractedComments]
+ */
+
+/**
+ * @typedef {{ [file: string]: string }} Input
+ */
+
+/**
+ * @typedef {{ [key: string]: any }} CustomOptions
+ */
+
+/**
+ * @template T
+ * @typedef {T extends infer U ? U : CustomOptions} InferDefaultType
+ */
+
+/**
+ * @typedef {Object} PredefinedOptions
+ * @property {boolean} [module]
+ * @property {TerserECMA} [ecma]
+ */
+
+/**
+ * @template T
+ * @typedef {PredefinedOptions & InferDefaultType<T>} MinimizerOptions
+ */
+
+/**
+ * @template T
+ * @callback BasicMinimizerImplementation
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {MinimizerOptions<T>} minifyOptions
+ * @param {ExtractCommentsOptions | undefined} extractComments
+ * @returns {Promise<MinimizedResult>}
+ */
+
+/**
+ * @typedef {object} MinimizeFunctionHelpers
+ * @property {() => string | undefined} [getMinimizerVersion]
+ */
+
+/**
+ * @template T
+ * @typedef {BasicMinimizerImplementation<T> & MinimizeFunctionHelpers} MinimizerImplementation
+ */
+
+/**
+ * @template T
+ * @typedef {Object} InternalOptions
+ * @property {string} name
+ * @property {string} input
+ * @property {RawSourceMap | undefined} inputSourceMap
+ * @property {ExtractCommentsOptions | undefined} extractComments
+ * @property {{ implementation: MinimizerImplementation<T>, options: MinimizerOptions<T> }} minimizer
+ */
+
+/**
+ * @template T
+ * @typedef {JestWorker & { transform: (options: string) => MinimizedResult, minify: (options: InternalOptions<T>) => MinimizedResult }} MinimizerWorker
+ */
+
+/**
+ * @typedef {undefined | boolean | number} Parallel
+ */
+
+/**
+ * @typedef {Object} BasePluginOptions
+ * @property {Rules} [test]
+ * @property {Rules} [include]
+ * @property {Rules} [exclude]
+ * @property {ExtractCommentsOptions} [extractComments]
+ * @property {Parallel} [parallel]
+ */
+
+/**
+ * @template T
+ * @typedef {T extends TerserOptions ? { minify?: MinimizerImplementation<T> | undefined, terserOptions?: MinimizerOptions<T> | undefined } : { minify: MinimizerImplementation<T>, terserOptions?: MinimizerOptions<T> | undefined }} DefinedDefaultMinimizerAndOptions
+ */
+
+/**
+ * @template T
+ * @typedef {BasePluginOptions & { minimizer: { implementation: MinimizerImplementation<T>, options: MinimizerOptions<T> } }} InternalPluginOptions
+ */
+
+/**
+ * @template [T=TerserOptions]
+ */
+
+
+class TerserPlugin {
+  /**
+   * @param {BasePluginOptions & DefinedDefaultMinimizerAndOptions<T>} [options]
+   */
+  constructor(options) {
+    validate(
+    /** @type {Schema} */
+    schema, options || {}, {
+      name: "Terser Plugin",
+      baseDataPath: "options"
+    }); // TODO make `minimizer` option instead `minify` and `terserOptions` in the next major release, also rename `terserMinify` to `terserMinimize`
+
+    const {
+      minify =
+      /** @type {MinimizerImplementation<T>} */
+      terserMinify,
+      terserOptions =
+      /** @type {MinimizerOptions<T>} */
+      {},
+      test = /\.[cm]?js(\?.*)?$/i,
+      extractComments = true,
+      parallel = true,
+      include,
+      exclude
+    } = options || {};
+    /**
+     * @private
+     * @type {InternalPluginOptions<T>}
+     */
+
+    this.options = {
+      test,
+      extractComments,
+      parallel,
+      include,
+      exclude,
+      minimizer: {
+        implementation: minify,
+        options: terserOptions
+      }
+    };
+  }
+  /**
+   * @private
+   * @param {any} input
+   * @returns {boolean}
+   */
+
+
+  static isSourceMap(input) {
+    // All required options for `new SourceMapConsumer(...options)`
+    // https://github.com/mozilla/source-map#new-sourcemapconsumerrawsourcemap
+    return Boolean(input && input.version && input.sources && Array.isArray(input.sources) && typeof input.mappings === "string");
+  }
+  /**
+   * @private
+   * @param {unknown} warning
+   * @param {string} file
+   * @returns {Error}
+   */
+
+
+  static buildWarning(warning, file) {
+    /**
+     * @type {Error & { hideStack: true, file: string }}
+     */
+    // @ts-ignore
+    const builtWarning = new Error(warning.toString());
+    builtWarning.name = "Warning";
+    builtWarning.hideStack = true;
+    builtWarning.file = file;
+    return builtWarning;
+  }
+  /**
+   * @private
+   * @param {any} error
+   * @param {string} file
+   * @param {SourceMapConsumer} [sourceMap]
+   * @param {Compilation["requestShortener"]} [requestShortener]
+   * @returns {Error}
+   */
+
+
+  static buildError(error, file, sourceMap, requestShortener) {
+    /**
+     * @type {Error & { file?: string }}
+     */
+    let builtError;
+
+    if (typeof error === "string") {
+      builtError = new Error(`${file} from Terser plugin\n${error}`);
+      builtError.file = file;
+      return builtError;
+    }
+
+    if (error.line) {
+      const original = sourceMap && sourceMap.originalPositionFor({
+        line: error.line,
+        column: error.col
+      });
+
+      if (original && original.source && requestShortener) {
+        builtError = new Error(`${file} from Terser plugin\n${error.message} [${requestShortener.shorten(original.source)}:${original.line},${original.column}][${file}:${error.line},${error.col}]${error.stack ? `\n${error.stack.split("\n").slice(1).join("\n")}` : ""}`);
+        builtError.file = file;
+        return builtError;
+      }
+
+      builtError = new Error(`${file} from Terser plugin\n${error.message} [${file}:${error.line},${error.col}]${error.stack ? `\n${error.stack.split("\n").slice(1).join("\n")}` : ""}`);
+      builtError.file = file;
+      return builtError;
+    }
+
+    if (error.stack) {
+      builtError = new Error(`${file} from Terser plugin\n${typeof error.message !== "undefined" ? error.message : ""}\n${error.stack}`);
+      builtError.file = file;
+      return builtError;
+    }
+
+    builtError = new Error(`${file} from Terser plugin\n${error.message}`);
+    builtError.file = file;
+    return builtError;
+  }
+  /**
+   * @private
+   * @param {Parallel} parallel
+   * @returns {number}
+   */
+
+
+  static getAvailableNumberOfCores(parallel) {
+    // In some cases cpus() returns undefined
+    // https://github.com/nodejs/node/issues/19022
+    const cpus = os.cpus() || {
+      length: 1
+    };
+    return parallel === true ? cpus.length - 1 : Math.min(Number(parallel) || 0, cpus.length - 1);
+  }
+  /**
+   * @private
+   * @param {Compiler} compiler
+   * @param {Compilation} compilation
+   * @param {Record<string, import("webpack").sources.Source>} assets
+   * @param {{availableNumberOfCores: number}} optimizeOptions
+   * @returns {Promise<void>}
+   */
+
+
+  async optimize(compiler, compilation, assets, optimizeOptions) {
+    const cache = compilation.getCache("TerserWebpackPlugin");
+    let numberOfAssets = 0;
+    const assetsForMinify = await Promise.all(Object.keys(assets).filter(name => {
+      const {
+        info
+      } =
+      /** @type {Asset} */
+      compilation.getAsset(name);
+
+      if ( // Skip double minimize assets from child compilation
+      info.minimized || // Skip minimizing for extracted comments assets
+      info.extractedComments) {
+        return false;
+      }
+
+      if (!compiler.webpack.ModuleFilenameHelpers.matchObject.bind( // eslint-disable-next-line no-undefined
+      undefined, this.options)(name)) {
+        return false;
+      }
+
+      return true;
+    }).map(async name => {
+      const {
+        info,
+        source
+      } =
+      /** @type {Asset} */
+      compilation.getAsset(name);
+      const eTag = cache.getLazyHashedEtag(source);
+      const cacheItem = cache.getItemCache(name, eTag);
+      const output = await cacheItem.getPromise();
+
+      if (!output) {
+        numberOfAssets += 1;
+      }
+
+      return {
+        name,
+        info,
+        inputSource: source,
+        output,
+        cacheItem
+      };
+    }));
+
+    if (assetsForMinify.length === 0) {
+      return;
+    }
+    /** @type {undefined | (() => MinimizerWorker<T>)} */
+
+
+    let getWorker;
+    /** @type {undefined | MinimizerWorker<T>} */
+
+    let initializedWorker;
+    /** @type {undefined | number} */
+
+    let numberOfWorkers;
+
+    if (optimizeOptions.availableNumberOfCores > 0) {
+      // Do not create unnecessary workers when the number of files is less than the available cores, it saves memory
+      numberOfWorkers = Math.min(numberOfAssets, optimizeOptions.availableNumberOfCores); // eslint-disable-next-line consistent-return
+
+      getWorker = () => {
+        if (initializedWorker) {
+          return initializedWorker;
+        }
+
+        initializedWorker =
+        /** @type {MinimizerWorker<T>} */
+        new Worker(require.resolve("./minify"), {
+          numWorkers: numberOfWorkers,
+          enableWorkerThreads: true
+        }); // https://github.com/facebook/jest/issues/8872#issuecomment-524822081
+
+        const workerStdout = initializedWorker.getStdout();
+
+        if (workerStdout) {
+          workerStdout.on("data", chunk => process.stdout.write(chunk));
+        }
+
+        const workerStderr = initializedWorker.getStderr();
+
+        if (workerStderr) {
+          workerStderr.on("data", chunk => process.stderr.write(chunk));
+        }
+
+        return initializedWorker;
+      };
+    }
+
+    const {
+      SourceMapSource,
+      ConcatSource,
+      RawSource
+    } = compiler.webpack.sources;
+    /** @typedef {{ extractedCommentsSource : import("webpack").sources.RawSource, commentsFilename: string }} ExtractedCommentsInfo */
+
+    /** @type {Map<string, ExtractedCommentsInfo>} */
+
+    const allExtractedComments = new Map();
+    const scheduledTasks = [];
+
+    for (const asset of assetsForMinify) {
+      scheduledTasks.push(async () => {
+        const {
+          name,
+          inputSource,
+          info,
+          cacheItem
+        } = asset;
+        let {
+          output
+        } = asset;
+
+        if (!output) {
+          let input;
+          /** @type {RawSourceMap | undefined} */
+
+          let inputSourceMap;
+          const {
+            source: sourceFromInputSource,
+            map
+          } = inputSource.sourceAndMap();
+          input = sourceFromInputSource;
+
+          if (map) {
+            if (!TerserPlugin.isSourceMap(map)) {
+              compilation.warnings.push(
+              /** @type {WebpackError} */
+              new Error(`${name} contains invalid source map`));
+            } else {
+              inputSourceMap =
+              /** @type {RawSourceMap} */
+              map;
+            }
+          }
+
+          if (Buffer.isBuffer(input)) {
+            input = input.toString();
+          }
+          /**
+           * @type {InternalOptions<T>}
+           */
+
+
+          const options = {
+            name,
+            input,
+            inputSourceMap,
+            minimizer: {
+              implementation: this.options.minimizer.implementation,
+              // @ts-ignore https://github.com/Microsoft/TypeScript/issues/10727
+              options: { ...this.options.minimizer.options
+              }
+            },
+            extractComments: this.options.extractComments
+          };
+
+          if (typeof options.minimizer.options.module === "undefined") {
+            if (typeof info.javascriptModule !== "undefined") {
+              options.minimizer.options.module = info.javascriptModule;
+            } else if (/\.mjs(\?.*)?$/i.test(name)) {
+              options.minimizer.options.module = true;
+            } else if (/\.cjs(\?.*)?$/i.test(name)) {
+              options.minimizer.options.module = false;
+            }
+          }
+
+          if (typeof options.minimizer.options.ecma === "undefined") {
+            options.minimizer.options.ecma = TerserPlugin.getEcmaVersion(compiler.options.output.environment || {});
+          }
+
+          try {
+            output = await (getWorker ? getWorker().transform(serialize(options)) : minify(options));
+          } catch (error) {
+            const hasSourceMap = inputSourceMap && TerserPlugin.isSourceMap(inputSourceMap);
+            compilation.errors.push(
+            /** @type {WebpackError} */
+            TerserPlugin.buildError(error, name, hasSourceMap ? new SourceMapConsumer(
+            /** @type {RawSourceMap} */
+            inputSourceMap) : // eslint-disable-next-line no-undefined
+            undefined, // eslint-disable-next-line no-undefined
+            hasSourceMap ? compilation.requestShortener : undefined));
+            return;
+          }
+
+          if (typeof output.code === "undefined") {
+            compilation.errors.push(
+            /** @type {WebpackError} */
+            new Error(`${name} from Terser plugin\nMinimizer doesn't return result`));
+            return;
+          }
+
+          if (output.warnings && output.warnings.length > 0) {
+            output.warnings = output.warnings.map(
+            /**
+             * @param {Error | string} item
+             */
+            item => TerserPlugin.buildWarning(item, name));
+          }
+
+          if (output.errors && output.errors.length > 0) {
+            const hasSourceMap = inputSourceMap && TerserPlugin.isSourceMap(inputSourceMap);
+            output.errors = output.errors.map(
+            /**
+             * @param {Error | string} item
+             */
+            item => TerserPlugin.buildError(item, name, hasSourceMap ? new SourceMapConsumer(
+            /** @type {RawSourceMap} */
+            inputSourceMap) : // eslint-disable-next-line no-undefined
+            undefined, // eslint-disable-next-line no-undefined
+            hasSourceMap ? compilation.requestShortener : undefined));
+          }
+
+          let shebang;
+
+          if (
+          /** @type {ExtractCommentsObject} */
+          this.options.extractComments.banner !== false && output.extractedComments && output.extractedComments.length > 0 && output.code.startsWith("#!")) {
+            const firstNewlinePosition = output.code.indexOf("\n");
+            shebang = output.code.substring(0, firstNewlinePosition);
+            output.code = output.code.substring(firstNewlinePosition + 1);
+          }
+
+          if (output.map) {
+            output.source = new SourceMapSource(output.code, name, output.map, input,
+            /** @type {RawSourceMap} */
+            inputSourceMap, true);
+          } else {
+            output.source = new RawSource(output.code);
+          }
+
+          if (output.extractedComments && output.extractedComments.length > 0) {
+            const commentsFilename =
+            /** @type {ExtractCommentsObject} */
+            this.options.extractComments.filename || "[file].LICENSE.txt[query]";
+            let query = "";
+            let filename = name;
+            const querySplit = filename.indexOf("?");
+
+            if (querySplit >= 0) {
+              query = filename.substr(querySplit);
+              filename = filename.substr(0, querySplit);
+            }
+
+            const lastSlashIndex = filename.lastIndexOf("/");
+            const basename = lastSlashIndex === -1 ? filename : filename.substr(lastSlashIndex + 1);
+            const data = {
+              filename,
+              basename,
+              query
+            };
+            output.commentsFilename = compilation.getPath(commentsFilename, data);
+            let banner; // Add a banner to the original file
+
+            if (
+            /** @type {ExtractCommentsObject} */
+            this.options.extractComments.banner !== false) {
+              banner =
+              /** @type {ExtractCommentsObject} */
+              this.options.extractComments.banner || `For license information please see ${path.relative(path.dirname(name), output.commentsFilename).replace(/\\/g, "/")}`;
+
+              if (typeof banner === "function") {
+                banner = banner(output.commentsFilename);
+              }
+
+              if (banner) {
+                output.source = new ConcatSource(shebang ? `${shebang}\n` : "", `/*! ${banner} */\n`, output.source);
+              }
+            }
+
+            const extractedCommentsString = output.extractedComments.sort().join("\n\n");
+            output.extractedCommentsSource = new RawSource(`${extractedCommentsString}\n`);
+          }
+
+          await cacheItem.storePromise({
+            source: output.source,
+            errors: output.errors,
+            warnings: output.warnings,
+            commentsFilename: output.commentsFilename,
+            extractedCommentsSource: output.extractedCommentsSource
+          });
+        }
+
+        if (output.warnings && output.warnings.length > 0) {
+          for (const warning of output.warnings) {
+            compilation.warnings.push(
+            /** @type {WebpackError} */
+            warning);
+          }
+        }
+
+        if (output.errors && output.errors.length > 0) {
+          for (const error of output.errors) {
+            compilation.errors.push(
+            /** @type {WebpackError} */
+            error);
+          }
+        }
+        /** @type {Record<string, any>} */
+
+
+        const newInfo = {
+          minimized: true
+        };
+        const {
+          source,
+          extractedCommentsSource
+        } = output; // Write extracted comments to commentsFilename
+
+        if (extractedCommentsSource) {
+          const {
+            commentsFilename
+          } = output;
+          newInfo.related = {
+            license: commentsFilename
+          };
+          allExtractedComments.set(name, {
+            extractedCommentsSource,
+            commentsFilename
+          });
+        }
+
+        compilation.updateAsset(name, source, newInfo);
+      });
+    }
+
+    const limit = getWorker && numberOfAssets > 0 ?
+    /** @type {number} */
+    numberOfWorkers : scheduledTasks.length;
+    await throttleAll(limit, scheduledTasks);
+
+    if (initializedWorker) {
+      await initializedWorker.end();
+    }
+    /** @typedef {{ source: import("webpack").sources.Source, commentsFilename: string, from: string }} ExtractedCommentsInfoWIthFrom */
+
+
+    await Array.from(allExtractedComments).sort().reduce(
+    /**
+     * @param {Promise<unknown>} previousPromise
+     * @param {[string, ExtractedCommentsInfo]} extractedComments
+     * @returns {Promise<ExtractedCommentsInfoWIthFrom>}
+     */
+    async (previousPromise, [from, value]) => {
+      const previous =
+      /** @type {ExtractedCommentsInfoWIthFrom | undefined} **/
+      await previousPromise;
+      const {
+        commentsFilename,
+        extractedCommentsSource
+      } = value;
+
+      if (previous && previous.commentsFilename === commentsFilename) {
+        const {
+          from: previousFrom,
+          source: prevSource
+        } = previous;
+        const mergedName = `${previousFrom}|${from}`;
+        const name = `${commentsFilename}|${mergedName}`;
+        const eTag = [prevSource, extractedCommentsSource].map(item => cache.getLazyHashedEtag(item)).reduce((previousValue, currentValue) => cache.mergeEtags(previousValue, currentValue));
+        let source = await cache.getPromise(name, eTag);
+
+        if (!source) {
+          source = new ConcatSource(Array.from(new Set([...
+          /** @type {string}*/
+          prevSource.source().split("\n\n"), ...
+          /** @type {string}*/
+          extractedCommentsSource.source().split("\n\n")])).join("\n\n"));
+          await cache.storePromise(name, eTag, source);
+        }
+
+        compilation.updateAsset(commentsFilename, source);
+        return {
+          source,
+          commentsFilename,
+          from: mergedName
+        };
+      }
+
+      const existingAsset = compilation.getAsset(commentsFilename);
+
+      if (existingAsset) {
+        return {
+          source: existingAsset.source,
+          commentsFilename,
+          from: commentsFilename
+        };
+      }
+
+      compilation.emitAsset(commentsFilename, extractedCommentsSource, {
+        extractedComments: true
+      });
+      return {
+        source: extractedCommentsSource,
+        commentsFilename,
+        from
+      };
+    },
+    /** @type {Promise<unknown>} */
+    Promise.resolve());
+  }
+  /**
+   * @private
+   * @param {any} environment
+   * @returns {TerserECMA}
+   */
+
+
+  static getEcmaVersion(environment) {
+    // ES 6th
+    if (environment.arrowFunction || environment.const || environment.destructuring || environment.forOf || environment.module) {
+      return 2015;
+    } // ES 11th
+
+
+    if (environment.bigIntLiteral || environment.dynamicImport) {
+      return 2020;
+    }
+
+    return 5;
+  }
+  /**
+   * @param {Compiler} compiler
+   * @returns {void}
+   */
+
+
+  apply(compiler) {
+    const pluginName = this.constructor.name;
+    const availableNumberOfCores = TerserPlugin.getAvailableNumberOfCores(this.options.parallel);
+    compiler.hooks.compilation.tap(pluginName, compilation => {
+      const hooks = compiler.webpack.javascript.JavascriptModulesPlugin.getCompilationHooks(compilation);
+      const data = serialize({
+        minimizer: typeof this.options.minimizer.implementation.getMinimizerVersion !== "undefined" ? this.options.minimizer.implementation.getMinimizerVersion() || "0.0.0" : "0.0.0",
+        options: this.options.minimizer.options
+      });
+      hooks.chunkHash.tap(pluginName, (chunk, hash) => {
+        hash.update("TerserPlugin");
+        hash.update(data);
+      });
+      compilation.hooks.processAssets.tapPromise({
+        name: pluginName,
+        stage: compiler.webpack.Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_SIZE,
+        additionalAssets: true
+      }, assets => this.optimize(compiler, compilation, assets, {
+        availableNumberOfCores
+      }));
+      compilation.hooks.statsPrinter.tap(pluginName, stats => {
+        stats.hooks.print.for("asset.info.minimized").tap("terser-webpack-plugin", (minimized, {
+          green,
+          formatFlag
+        }) => minimized ?
+        /** @type {Function} */
+        green(
+        /** @type {Function} */
+        formatFlag("minimized")) : "");
+      });
+    });
+  }
+
+}
+
+TerserPlugin.terserMinify = terserMinify;
+TerserPlugin.uglifyJsMinify = uglifyJsMinify;
+TerserPlugin.swcMinify = swcMinify;
+TerserPlugin.esbuildMinify = esbuildMinify;
+module.exports = TerserPlugin;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/minify.js b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/minify.js
new file mode 100644
index 0000000..7cf6b5a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/minify.js
@@ -0,0 +1,50 @@
+"use strict";
+
+/** @typedef {import("./index.js").MinimizedResult} MinimizedResult */
+
+/** @typedef {import("./index.js").CustomOptions} CustomOptions */
+
+/**
+ * @template T
+ * @param {import("./index.js").InternalOptions<T>} options
+ * @returns {Promise<MinimizedResult>}
+ */
+async function minify(options) {
+  const {
+    name,
+    input,
+    inputSourceMap,
+    extractComments
+  } = options;
+  const {
+    implementation,
+    options: minimizerOptions
+  } = options.minimizer;
+  return implementation({
+    [name]: input
+  }, inputSourceMap, minimizerOptions, extractComments);
+}
+/**
+ * @param {string} options
+ * @returns {Promise<MinimizedResult>}
+ */
+
+
+async function transform(options) {
+  // 'use strict' => this === undefined (Clean Scope)
+  // Safer for possible security issues, albeit not critical at all here
+  // eslint-disable-next-line no-param-reassign
+  const evaluatedOptions =
+  /**
+   * @template T
+   * @type {import("./index.js").InternalOptions<T>}
+   * */
+  // eslint-disable-next-line no-new-func
+  new Function("exports", "require", "module", "__filename", "__dirname", `'use strict'\nreturn ${options}`)(exports, require, module, __filename, __dirname);
+  return minify(evaluatedOptions);
+}
+
+module.exports = {
+  minify,
+  transform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/options.json b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/options.json
new file mode 100644
index 0000000..83d2cfd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/options.json
@@ -0,0 +1,164 @@
+{
+  "definitions": {
+    "Rule": {
+      "description": "Filtering rule as regex or string.",
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "Rules": {
+      "description": "Filtering rules.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "A rule condition.",
+            "oneOf": [
+              {
+                "$ref": "#/definitions/Rule"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/Rule"
+        }
+      ]
+    }
+  },
+  "title": "TerserPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "test": {
+      "description": "Include all modules that pass test assertion.",
+      "link": "https://github.com/webpack-contrib/terser-webpack-plugin#test",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/Rules"
+        }
+      ]
+    },
+    "include": {
+      "description": "Include all modules matching any of these conditions.",
+      "link": "https://github.com/webpack-contrib/terser-webpack-plugin#include",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/Rules"
+        }
+      ]
+    },
+    "exclude": {
+      "description": "Exclude all modules matching any of these conditions.",
+      "link": "https://github.com/webpack-contrib/terser-webpack-plugin#exclude",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/Rules"
+        }
+      ]
+    },
+    "terserOptions": {
+      "description": "Options for `terser` (by default) or custom `minify` function.",
+      "link": "https://github.com/webpack-contrib/terser-webpack-plugin#terseroptions",
+      "additionalProperties": true,
+      "type": "object"
+    },
+    "extractComments": {
+      "description": "Whether comments shall be extracted to a separate file.",
+      "link": "https://github.com/webpack-contrib/terser-webpack-plugin#extractcomments",
+      "anyOf": [
+        {
+          "type": "boolean"
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "instanceof": "RegExp"
+        },
+        {
+          "instanceof": "Function"
+        },
+        {
+          "additionalProperties": false,
+          "properties": {
+            "condition": {
+              "anyOf": [
+                {
+                  "type": "boolean"
+                },
+                {
+                  "type": "string",
+                  "minLength": 1
+                },
+                {
+                  "instanceof": "RegExp"
+                },
+                {
+                  "instanceof": "Function"
+                }
+              ],
+              "description": "Condition what comments you need extract.",
+              "link": "https://github.com/webpack-contrib/terser-webpack-plugin#condition"
+            },
+            "filename": {
+              "anyOf": [
+                {
+                  "type": "string",
+                  "minLength": 1
+                },
+                {
+                  "instanceof": "Function"
+                }
+              ],
+              "description": "The file where the extracted comments will be stored. Default is to append the suffix .LICENSE.txt to the original filename.",
+              "link": "https://github.com/webpack-contrib/terser-webpack-plugin#filename"
+            },
+            "banner": {
+              "anyOf": [
+                {
+                  "type": "boolean"
+                },
+                {
+                  "type": "string",
+                  "minLength": 1
+                },
+                {
+                  "instanceof": "Function"
+                }
+              ],
+              "description": "The banner text that points to the extracted file and will be added on top of the original file",
+              "link": "https://github.com/webpack-contrib/terser-webpack-plugin#banner"
+            }
+          },
+          "type": "object"
+        }
+      ]
+    },
+    "parallel": {
+      "description": "Use multi-process parallel running to improve the build speed.",
+      "link": "https://github.com/webpack-contrib/terser-webpack-plugin#parallel",
+      "anyOf": [
+        {
+          "type": "boolean"
+        },
+        {
+          "type": "integer"
+        }
+      ]
+    },
+    "minify": {
+      "description": "Allows you to override default minify function.",
+      "link": "https://github.com/webpack-contrib/terser-webpack-plugin#number",
+      "instanceof": "Function"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/utils.js b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/utils.js
new file mode 100644
index 0000000..79dd425
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/dist/utils.js
@@ -0,0 +1,687 @@
+"use strict";
+
+/** @typedef {import("source-map").RawSourceMap} RawSourceMap */
+
+/** @typedef {import("terser").FormatOptions} TerserFormatOptions */
+
+/** @typedef {import("terser").MinifyOptions} TerserOptions */
+
+/** @typedef {import("terser").ECMA} TerserECMA */
+
+/** @typedef {import("./index.js").ExtractCommentsOptions} ExtractCommentsOptions */
+
+/** @typedef {import("./index.js").ExtractCommentsFunction} ExtractCommentsFunction */
+
+/** @typedef {import("./index.js").ExtractCommentsCondition} ExtractCommentsCondition */
+
+/** @typedef {import("./index.js").Input} Input */
+
+/** @typedef {import("./index.js").MinimizedResult} MinimizedResult */
+
+/** @typedef {import("./index.js").PredefinedOptions} PredefinedOptions */
+
+/** @typedef {import("./index.js").CustomOptions} CustomOptions */
+
+/**
+ * @typedef {Array<string>} ExtractedComments
+ */
+const notSettled = Symbol(`not-settled`);
+/**
+ * @template T
+ * @typedef {() => Promise<T>} Task
+ */
+
+/**
+ * Run tasks with limited concurency.
+ * @template T
+ * @param {number} limit - Limit of tasks that run at once.
+ * @param {Task<T>[]} tasks - List of tasks to run.
+ * @returns {Promise<T[]>} A promise that fulfills to an array of the results
+ */
+
+function throttleAll(limit, tasks) {
+  if (!Number.isInteger(limit) || limit < 1) {
+    throw new TypeError(`Expected \`limit\` to be a finite number > 0, got \`${limit}\` (${typeof limit})`);
+  }
+
+  if (!Array.isArray(tasks) || !tasks.every(task => typeof task === `function`)) {
+    throw new TypeError(`Expected \`tasks\` to be a list of functions returning a promise`);
+  }
+
+  return new Promise((resolve, reject) => {
+    const result = Array(tasks.length).fill(notSettled);
+    const entries = tasks.entries();
+
+    const next = () => {
+      const {
+        done,
+        value
+      } = entries.next();
+
+      if (done) {
+        const isLast = !result.includes(notSettled);
+        if (isLast) resolve(
+        /** @type{T[]} **/
+        result);
+        return;
+      }
+
+      const [index, task] = value;
+      /**
+       * @param {T} x
+       */
+
+      const onFulfilled = x => {
+        result[index] = x;
+        next();
+      };
+
+      task().then(onFulfilled, reject);
+    };
+
+    Array(limit).fill(0).forEach(next);
+  });
+}
+/* istanbul ignore next */
+
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @param {ExtractCommentsOptions | undefined} extractComments
+ * @return {Promise<MinimizedResult>}
+ */
+
+
+async function terserMinify(input, sourceMap, minimizerOptions, extractComments) {
+  /**
+   * @param {any} value
+   * @returns {boolean}
+   */
+  const isObject = value => {
+    const type = typeof value;
+    return value != null && (type === "object" || type === "function");
+  };
+  /**
+   * @param {TerserOptions & { sourceMap: undefined } & ({ output: TerserFormatOptions & { beautify: boolean } } | { format: TerserFormatOptions & { beautify: boolean } })} terserOptions
+   * @param {ExtractedComments} extractedComments
+   * @returns {ExtractCommentsFunction}
+   */
+
+
+  const buildComments = (terserOptions, extractedComments) => {
+    /** @type {{ [index: string]: ExtractCommentsCondition }} */
+    const condition = {};
+    let comments;
+
+    if (terserOptions.format) {
+      ({
+        comments
+      } = terserOptions.format);
+    } else if (terserOptions.output) {
+      ({
+        comments
+      } = terserOptions.output);
+    }
+
+    condition.preserve = typeof comments !== "undefined" ? comments : false;
+
+    if (typeof extractComments === "boolean" && extractComments) {
+      condition.extract = "some";
+    } else if (typeof extractComments === "string" || extractComments instanceof RegExp) {
+      condition.extract = extractComments;
+    } else if (typeof extractComments === "function") {
+      condition.extract = extractComments;
+    } else if (extractComments && isObject(extractComments)) {
+      condition.extract = typeof extractComments.condition === "boolean" && extractComments.condition ? "some" : typeof extractComments.condition !== "undefined" ? extractComments.condition : "some";
+    } else {
+      // No extract
+      // Preserve using "commentsOpts" or "some"
+      condition.preserve = typeof comments !== "undefined" ? comments : "some";
+      condition.extract = false;
+    } // Ensure that both conditions are functions
+
+
+    ["preserve", "extract"].forEach(key => {
+      /** @type {undefined | string} */
+      let regexStr;
+      /** @type {undefined | RegExp} */
+
+      let regex;
+
+      switch (typeof condition[key]) {
+        case "boolean":
+          condition[key] = condition[key] ? () => true : () => false;
+          break;
+
+        case "function":
+          break;
+
+        case "string":
+          if (condition[key] === "all") {
+            condition[key] = () => true;
+
+            break;
+          }
+
+          if (condition[key] === "some") {
+            condition[key] =
+            /** @type {ExtractCommentsFunction} */
+            (astNode, comment) => (comment.type === "comment2" || comment.type === "comment1") && /@preserve|@lic|@cc_on|^\**!/i.test(comment.value);
+
+            break;
+          }
+
+          regexStr =
+          /** @type {string} */
+          condition[key];
+
+          condition[key] =
+          /** @type {ExtractCommentsFunction} */
+          (astNode, comment) => new RegExp(
+          /** @type {string} */
+          regexStr).test(comment.value);
+
+          break;
+
+        default:
+          regex =
+          /** @type {RegExp} */
+          condition[key];
+
+          condition[key] =
+          /** @type {ExtractCommentsFunction} */
+          (astNode, comment) =>
+          /** @type {RegExp} */
+          regex.test(comment.value);
+
+      }
+    }); // Redefine the comments function to extract and preserve
+    // comments according to the two conditions
+
+    return (astNode, comment) => {
+      if (
+      /** @type {{ extract: ExtractCommentsFunction }} */
+      condition.extract(astNode, comment)) {
+        const commentText = comment.type === "comment2" ? `/*${comment.value}*/` : `//${comment.value}`; // Don't include duplicate comments
+
+        if (!extractedComments.includes(commentText)) {
+          extractedComments.push(commentText);
+        }
+      }
+
+      return (
+        /** @type {{ preserve: ExtractCommentsFunction }} */
+        condition.preserve(astNode, comment)
+      );
+    };
+  };
+  /**
+   * @param {PredefinedOptions & TerserOptions} [terserOptions={}]
+   * @returns {TerserOptions & { sourceMap: undefined } & ({ output: TerserFormatOptions & { beautify: boolean } } | { format: TerserFormatOptions & { beautify: boolean } })}
+   */
+
+
+  const buildTerserOptions = (terserOptions = {}) => {
+    // Need deep copy objects to avoid https://github.com/terser/terser/issues/366
+    return { ...terserOptions,
+      compress: typeof terserOptions.compress === "boolean" ? terserOptions.compress : { ...terserOptions.compress
+      },
+      // ecma: terserOptions.ecma,
+      // ie8: terserOptions.ie8,
+      // keep_classnames: terserOptions.keep_classnames,
+      // keep_fnames: terserOptions.keep_fnames,
+      mangle: terserOptions.mangle == null ? true : typeof terserOptions.mangle === "boolean" ? terserOptions.mangle : { ...terserOptions.mangle
+      },
+      // module: terserOptions.module,
+      // nameCache: { ...terserOptions.toplevel },
+      // the `output` option is deprecated
+      ...(terserOptions.format ? {
+        format: {
+          beautify: false,
+          ...terserOptions.format
+        }
+      } : {
+        output: {
+          beautify: false,
+          ...terserOptions.output
+        }
+      }),
+      parse: { ...terserOptions.parse
+      },
+      // safari10: terserOptions.safari10,
+      // Ignoring sourceMap from options
+      // eslint-disable-next-line no-undefined
+      sourceMap: undefined // toplevel: terserOptions.toplevel
+
+    };
+  }; // eslint-disable-next-line global-require
+
+
+  const {
+    minify
+  } = require("terser"); // Copy `terser` options
+
+
+  const terserOptions = buildTerserOptions(minimizerOptions); // Let terser generate a SourceMap
+
+  if (sourceMap) {
+    // @ts-ignore
+    terserOptions.sourceMap = {
+      asObject: true
+    };
+  }
+  /** @type {ExtractedComments} */
+
+
+  const extractedComments = [];
+
+  if (terserOptions.output) {
+    terserOptions.output.comments = buildComments(terserOptions, extractedComments);
+  } else if (terserOptions.format) {
+    terserOptions.format.comments = buildComments(terserOptions, extractedComments);
+  }
+
+  const [[filename, code]] = Object.entries(input);
+  const result = await minify({
+    [filename]: code
+  }, terserOptions);
+  return {
+    code:
+    /** @type {string} **/
+    result.code,
+    // @ts-ignore
+    // eslint-disable-next-line no-undefined
+    map: result.map ?
+    /** @type {RawSourceMap} **/
+    result.map : undefined,
+    extractedComments
+  };
+}
+/**
+ * @returns {string | undefined}
+ */
+
+
+terserMinify.getMinimizerVersion = () => {
+  let packageJson;
+
+  try {
+    // eslint-disable-next-line global-require
+    packageJson = require("terser/package.json");
+  } catch (error) {// Ignore
+  }
+
+  return packageJson && packageJson.version;
+};
+/* istanbul ignore next */
+
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @param {ExtractCommentsOptions | undefined} extractComments
+ * @return {Promise<MinimizedResult>}
+ */
+
+
+async function uglifyJsMinify(input, sourceMap, minimizerOptions, extractComments) {
+  /**
+   * @param {any} value
+   * @returns {boolean}
+   */
+  const isObject = value => {
+    const type = typeof value;
+    return value != null && (type === "object" || type === "function");
+  };
+  /**
+   * @param {import("uglify-js").MinifyOptions & { sourceMap: undefined } & { output: import("uglify-js").OutputOptions & { beautify: boolean }}} uglifyJsOptions
+   * @param {ExtractedComments} extractedComments
+   * @returns {ExtractCommentsFunction}
+   */
+
+
+  const buildComments = (uglifyJsOptions, extractedComments) => {
+    /** @type {{ [index: string]: ExtractCommentsCondition }} */
+    const condition = {};
+    const {
+      comments
+    } = uglifyJsOptions.output;
+    condition.preserve = typeof comments !== "undefined" ? comments : false;
+
+    if (typeof extractComments === "boolean" && extractComments) {
+      condition.extract = "some";
+    } else if (typeof extractComments === "string" || extractComments instanceof RegExp) {
+      condition.extract = extractComments;
+    } else if (typeof extractComments === "function") {
+      condition.extract = extractComments;
+    } else if (extractComments && isObject(extractComments)) {
+      condition.extract = typeof extractComments.condition === "boolean" && extractComments.condition ? "some" : typeof extractComments.condition !== "undefined" ? extractComments.condition : "some";
+    } else {
+      // No extract
+      // Preserve using "commentsOpts" or "some"
+      condition.preserve = typeof comments !== "undefined" ? comments : "some";
+      condition.extract = false;
+    } // Ensure that both conditions are functions
+
+
+    ["preserve", "extract"].forEach(key => {
+      /** @type {undefined | string} */
+      let regexStr;
+      /** @type {undefined | RegExp} */
+
+      let regex;
+
+      switch (typeof condition[key]) {
+        case "boolean":
+          condition[key] = condition[key] ? () => true : () => false;
+          break;
+
+        case "function":
+          break;
+
+        case "string":
+          if (condition[key] === "all") {
+            condition[key] = () => true;
+
+            break;
+          }
+
+          if (condition[key] === "some") {
+            condition[key] =
+            /** @type {ExtractCommentsFunction} */
+            (astNode, comment) => (comment.type === "comment2" || comment.type === "comment1") && /@preserve|@lic|@cc_on|^\**!/i.test(comment.value);
+
+            break;
+          }
+
+          regexStr =
+          /** @type {string} */
+          condition[key];
+
+          condition[key] =
+          /** @type {ExtractCommentsFunction} */
+          (astNode, comment) => new RegExp(
+          /** @type {string} */
+          regexStr).test(comment.value);
+
+          break;
+
+        default:
+          regex =
+          /** @type {RegExp} */
+          condition[key];
+
+          condition[key] =
+          /** @type {ExtractCommentsFunction} */
+          (astNode, comment) =>
+          /** @type {RegExp} */
+          regex.test(comment.value);
+
+      }
+    }); // Redefine the comments function to extract and preserve
+    // comments according to the two conditions
+
+    return (astNode, comment) => {
+      if (
+      /** @type {{ extract: ExtractCommentsFunction }} */
+      condition.extract(astNode, comment)) {
+        const commentText = comment.type === "comment2" ? `/*${comment.value}*/` : `//${comment.value}`; // Don't include duplicate comments
+
+        if (!extractedComments.includes(commentText)) {
+          extractedComments.push(commentText);
+        }
+      }
+
+      return (
+        /** @type {{ preserve: ExtractCommentsFunction }} */
+        condition.preserve(astNode, comment)
+      );
+    };
+  };
+  /**
+   * @param {PredefinedOptions & import("uglify-js").MinifyOptions} [uglifyJsOptions={}]
+   * @returns {import("uglify-js").MinifyOptions & { sourceMap: undefined } & { output: import("uglify-js").OutputOptions & { beautify: boolean }}}
+   */
+
+
+  const buildUglifyJsOptions = (uglifyJsOptions = {}) => {
+    // eslint-disable-next-line no-param-reassign
+    delete minimizerOptions.ecma; // eslint-disable-next-line no-param-reassign
+
+    delete minimizerOptions.module; // Need deep copy objects to avoid https://github.com/terser/terser/issues/366
+
+    return { ...uglifyJsOptions,
+      // warnings: uglifyJsOptions.warnings,
+      parse: { ...uglifyJsOptions.parse
+      },
+      compress: typeof uglifyJsOptions.compress === "boolean" ? uglifyJsOptions.compress : { ...uglifyJsOptions.compress
+      },
+      mangle: uglifyJsOptions.mangle == null ? true : typeof uglifyJsOptions.mangle === "boolean" ? uglifyJsOptions.mangle : { ...uglifyJsOptions.mangle
+      },
+      output: {
+        beautify: false,
+        ...uglifyJsOptions.output
+      },
+      // Ignoring sourceMap from options
+      // eslint-disable-next-line no-undefined
+      sourceMap: undefined // toplevel: uglifyJsOptions.toplevel
+      // nameCache: { ...uglifyJsOptions.toplevel },
+      // ie8: uglifyJsOptions.ie8,
+      // keep_fnames: uglifyJsOptions.keep_fnames,
+
+    };
+  }; // eslint-disable-next-line global-require, import/no-extraneous-dependencies
+
+
+  const {
+    minify
+  } = require("uglify-js"); // Copy `uglify-js` options
+
+
+  const uglifyJsOptions = buildUglifyJsOptions(minimizerOptions); // Let terser generate a SourceMap
+
+  if (sourceMap) {
+    // @ts-ignore
+    uglifyJsOptions.sourceMap = true;
+  }
+  /** @type {ExtractedComments} */
+
+
+  const extractedComments = []; // @ts-ignore
+
+  uglifyJsOptions.output.comments = buildComments(uglifyJsOptions, extractedComments);
+  const [[filename, code]] = Object.entries(input);
+  const result = await minify({
+    [filename]: code
+  }, uglifyJsOptions);
+  return {
+    code: result.code,
+    // eslint-disable-next-line no-undefined
+    map: result.map ? JSON.parse(result.map) : undefined,
+    errors: result.error ? [result.error] : [],
+    warnings: result.warnings || [],
+    extractedComments
+  };
+}
+/**
+ * @returns {string | undefined}
+ */
+
+
+uglifyJsMinify.getMinimizerVersion = () => {
+  let packageJson;
+
+  try {
+    // eslint-disable-next-line global-require, import/no-extraneous-dependencies
+    packageJson = require("uglify-js/package.json");
+  } catch (error) {// Ignore
+  }
+
+  return packageJson && packageJson.version;
+};
+/* istanbul ignore next */
+
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @return {Promise<MinimizedResult>}
+ */
+
+
+async function swcMinify(input, sourceMap, minimizerOptions) {
+  /**
+   * @param {PredefinedOptions & import("@swc/core").JsMinifyOptions} [swcOptions={}]
+   * @returns {import("@swc/core").JsMinifyOptions & { sourceMap: undefined }}
+   */
+  const buildSwcOptions = (swcOptions = {}) => {
+    // Need deep copy objects to avoid https://github.com/terser/terser/issues/366
+    return { ...swcOptions,
+      compress: typeof swcOptions.compress === "boolean" ? swcOptions.compress : { ...swcOptions.compress
+      },
+      mangle: swcOptions.mangle == null ? true : typeof swcOptions.mangle === "boolean" ? swcOptions.mangle : { ...swcOptions.mangle
+      },
+      // ecma: swcOptions.ecma,
+      // keep_classnames: swcOptions.keep_classnames,
+      // keep_fnames: swcOptions.keep_fnames,
+      // module: swcOptions.module,
+      // safari10: swcOptions.safari10,
+      // toplevel: swcOptions.toplevel
+      // eslint-disable-next-line no-undefined
+      sourceMap: undefined
+    };
+  }; // eslint-disable-next-line import/no-extraneous-dependencies, global-require
+
+
+  const swc = require("@swc/core"); // Copy `swc` options
+
+
+  const swcOptions = buildSwcOptions(minimizerOptions); // Let `swc` generate a SourceMap
+
+  if (sourceMap) {
+    // @ts-ignore
+    swcOptions.sourceMap = true;
+  }
+
+  const [[filename, code]] = Object.entries(input);
+  const result = await swc.minify(code, swcOptions);
+  let map;
+
+  if (result.map) {
+    map = JSON.parse(result.map); // TODO workaround for swc because `filename` is not preset as in `swc` signature as for `terser`
+
+    map.sources = [filename];
+    delete map.sourcesContent;
+  }
+
+  return {
+    code: result.code,
+    map
+  };
+}
+/**
+ * @returns {string | undefined}
+ */
+
+
+swcMinify.getMinimizerVersion = () => {
+  let packageJson;
+
+  try {
+    // eslint-disable-next-line global-require, import/no-extraneous-dependencies
+    packageJson = require("@swc/core/package.json");
+  } catch (error) {// Ignore
+  }
+
+  return packageJson && packageJson.version;
+};
+/* istanbul ignore next */
+
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @return {Promise<MinimizedResult>}
+ */
+
+
+async function esbuildMinify(input, sourceMap, minimizerOptions) {
+  /**
+   * @param {PredefinedOptions & import("esbuild").TransformOptions} [esbuildOptions={}]
+   * @returns {import("esbuild").TransformOptions}
+   */
+  const buildEsbuildOptions = (esbuildOptions = {}) => {
+    // eslint-disable-next-line no-param-reassign
+    delete esbuildOptions.ecma;
+
+    if (esbuildOptions.module) {
+      // eslint-disable-next-line no-param-reassign
+      esbuildOptions.format = "esm";
+    } // eslint-disable-next-line no-param-reassign
+
+
+    delete esbuildOptions.module; // Need deep copy objects to avoid https://github.com/terser/terser/issues/366
+
+    return {
+      minify: true,
+      legalComments: "inline",
+      ...esbuildOptions,
+      sourcemap: false
+    };
+  }; // eslint-disable-next-line import/no-extraneous-dependencies, global-require
+
+
+  const esbuild = require("esbuild"); // Copy `esbuild` options
+
+
+  const esbuildOptions = buildEsbuildOptions(minimizerOptions); // Let `esbuild` generate a SourceMap
+
+  if (sourceMap) {
+    esbuildOptions.sourcemap = true;
+    esbuildOptions.sourcesContent = false;
+  }
+
+  const [[filename, code]] = Object.entries(input);
+  esbuildOptions.sourcefile = filename;
+  const result = await esbuild.transform(code, esbuildOptions);
+  return {
+    code: result.code,
+    // eslint-disable-next-line no-undefined
+    map: result.map ? JSON.parse(result.map) : undefined,
+    warnings: result.warnings.length > 0 ? result.warnings.map(item => {
+      return {
+        name: "Warning",
+        source: item.location && item.location.file,
+        line: item.location && item.location.line,
+        column: item.location && item.location.column,
+        plugin: item.pluginName,
+        message: `${item.text}${item.detail ? `\nDetails:\n${item.detail}` : ""}${item.notes.length > 0 ? `\n\nNotes:\n${item.notes.map(note => `${note.location ? `[${note.location.file}:${note.location.line}:${note.location.column}] ` : ""}${note.text}${note.location ? `\nSuggestion: ${note.location.suggestion}` : ""}${note.location ? `\nLine text:\n${note.location.lineText}\n` : ""}`).join("\n")}` : ""}`
+      };
+    }) : []
+  };
+}
+/**
+ * @returns {string | undefined}
+ */
+
+
+esbuildMinify.getMinimizerVersion = () => {
+  let packageJson;
+
+  try {
+    // eslint-disable-next-line global-require, import/no-extraneous-dependencies
+    packageJson = require("esbuild/package.json");
+  } catch (error) {// Ignore
+  }
+
+  return packageJson && packageJson.version;
+};
+
+module.exports = {
+  throttleAll,
+  terserMinify,
+  uglifyJsMinify,
+  swcMinify,
+  esbuildMinify
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/package.json b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/package.json
new file mode 100644
index 0000000..5708a9b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/package.json
@@ -0,0 +1,114 @@
+{
+  "name": "terser-webpack-plugin",
+  "version": "5.3.1",
+  "description": "Terser plugin for webpack",
+  "license": "MIT",
+  "repository": "webpack-contrib/terser-webpack-plugin",
+  "author": "webpack Contrib Team",
+  "homepage": "https://github.com/webpack-contrib/terser-webpack-plugin",
+  "bugs": "https://github.com/webpack-contrib/terser-webpack-plugin/issues",
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/webpack"
+  },
+  "main": "dist/index.js",
+  "types": "types/index.d.ts",
+  "engines": {
+    "node": ">= 10.13.0"
+  },
+  "scripts": {
+    "clean": "del-cli dist types",
+    "prebuild": "npm run clean",
+    "build:types": "tsc --declaration --emitDeclarationOnly --outDir types && prettier \"types/**/*.ts\" --write",
+    "build:code": "cross-env NODE_ENV=production babel src -d dist --copy-files",
+    "build": "npm-run-all -p \"build:**\"",
+    "commitlint": "commitlint --from=master",
+    "security": "npm audit --production",
+    "lint:prettier": "prettier --list-different .",
+    "lint:js": "eslint --cache .",
+    "lint:types": "tsc --pretty --noEmit",
+    "lint": "npm-run-all -l -p \"lint:**\"",
+    "test:only": "cross-env NODE_ENV=test jest",
+    "test:watch": "npm run test:only -- --watch",
+    "test:coverage": "npm run test:only -- --collectCoverageFrom=\"src/**/*.js\" --coverage",
+    "pretest": "npm run lint",
+    "test": "npm run test:coverage",
+    "prepare": "husky install && npm run build",
+    "release": "standard-version"
+  },
+  "files": [
+    "dist",
+    "types"
+  ],
+  "peerDependencies": {
+    "webpack": "^5.1.0"
+  },
+  "peerDependenciesMeta": {
+    "@swc/core": {
+      "optional": true
+    },
+    "uglify-js": {
+      "optional": true
+    },
+    "esbuild": {
+      "optional": true
+    }
+  },
+  "dependencies": {
+    "jest-worker": "^27.4.5",
+    "schema-utils": "^3.1.1",
+    "serialize-javascript": "^6.0.0",
+    "source-map": "^0.6.1",
+    "terser": "^5.7.2"
+  },
+  "devDependencies": {
+    "@babel/cli": "^7.16.7",
+    "@babel/core": "^7.16.7",
+    "@babel/preset-env": "^7.16.7",
+    "@commitlint/cli": "^15.0.0",
+    "@commitlint/config-conventional": "^15.0.0",
+    "@swc/core": "^1.2.126",
+    "@types/serialize-javascript": "^5.0.2",
+    "@types/uglify-js": "^3.13.1",
+    "@webpack-contrib/eslint-config-webpack": "^3.0.0",
+    "babel-jest": "^27.4.5",
+    "copy-webpack-plugin": "^9.0.1",
+    "cross-env": "^7.0.3",
+    "del": "^6.0.0",
+    "del-cli": "^3.0.1",
+    "esbuild": "^0.14.10",
+    "eslint": "^7.32.0",
+    "eslint-config-prettier": "^8.3.0",
+    "eslint-plugin-import": "^2.25.4",
+    "file-loader": "^6.2.0",
+    "husky": "^7.0.2",
+    "jest": "^27.4.5",
+    "lint-staged": "^11.0.1",
+    "memfs": "^3.4.1",
+    "npm-run-all": "^4.1.5",
+    "prettier": "^2.3.2",
+    "standard-version": "^9.3.1",
+    "typescript": "^4.5.4",
+    "uglify-js": "^3.14.5",
+    "webpack": "^5.48.0",
+    "webpack-cli": "^4.9.1",
+    "worker-loader": "^3.0.8"
+  },
+  "keywords": [
+    "uglify",
+    "uglify-js",
+    "uglify-es",
+    "terser",
+    "webpack",
+    "webpack-plugin",
+    "minification",
+    "compress",
+    "compressor",
+    "min",
+    "minification",
+    "minifier",
+    "minify",
+    "optimize",
+    "optimizer"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/index.d.ts b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/index.d.ts
new file mode 100644
index 0000000..7adb303
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/index.d.ts
@@ -0,0 +1,329 @@
+export = TerserPlugin;
+/** @typedef {import("schema-utils/declarations/validate").Schema} Schema */
+/** @typedef {import("webpack").Compiler} Compiler */
+/** @typedef {import("webpack").Compilation} Compilation */
+/** @typedef {import("webpack").WebpackError} WebpackError */
+/** @typedef {import("webpack").Asset} Asset */
+/** @typedef {import("./utils.js").TerserECMA} TerserECMA */
+/** @typedef {import("./utils.js").TerserOptions} TerserOptions */
+/** @typedef {import("jest-worker").Worker} JestWorker */
+/** @typedef {import("source-map").RawSourceMap} RawSourceMap */
+/** @typedef {RegExp | string} Rule */
+/** @typedef {Rule[] | Rule} Rules */
+/**
+ * @callback ExtractCommentsFunction
+ * @param {any} astNode
+ * @param {{ value: string, type: 'comment1' | 'comment2' | 'comment3' | 'comment4', pos: number, line: number, col: number }} comment
+ * @returns {boolean}
+ */
+/**
+ * @typedef {boolean | 'all' | 'some' | RegExp | ExtractCommentsFunction} ExtractCommentsCondition
+ */
+/**
+ * @typedef {string | ((fileData: any) => string)} ExtractCommentsFilename
+ */
+/**
+ * @typedef {boolean | string | ((commentsFile: string) => string)} ExtractCommentsBanner
+ */
+/**
+ * @typedef {Object} ExtractCommentsObject
+ * @property {ExtractCommentsCondition} [condition]
+ * @property {ExtractCommentsFilename} [filename]
+ * @property {ExtractCommentsBanner} [banner]
+ */
+/**
+ * @typedef {ExtractCommentsCondition | ExtractCommentsObject} ExtractCommentsOptions
+ */
+/**
+ * @typedef {Object} MinimizedResult
+ * @property {string} code
+ * @property {RawSourceMap} [map]
+ * @property {Array<Error | string>} [errors]
+ * @property {Array<Error | string>} [warnings]
+ * @property {Array<string>} [extractedComments]
+ */
+/**
+ * @typedef {{ [file: string]: string }} Input
+ */
+/**
+ * @typedef {{ [key: string]: any }} CustomOptions
+ */
+/**
+ * @template T
+ * @typedef {T extends infer U ? U : CustomOptions} InferDefaultType
+ */
+/**
+ * @typedef {Object} PredefinedOptions
+ * @property {boolean} [module]
+ * @property {TerserECMA} [ecma]
+ */
+/**
+ * @template T
+ * @typedef {PredefinedOptions & InferDefaultType<T>} MinimizerOptions
+ */
+/**
+ * @template T
+ * @callback BasicMinimizerImplementation
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {MinimizerOptions<T>} minifyOptions
+ * @param {ExtractCommentsOptions | undefined} extractComments
+ * @returns {Promise<MinimizedResult>}
+ */
+/**
+ * @typedef {object} MinimizeFunctionHelpers
+ * @property {() => string | undefined} [getMinimizerVersion]
+ */
+/**
+ * @template T
+ * @typedef {BasicMinimizerImplementation<T> & MinimizeFunctionHelpers} MinimizerImplementation
+ */
+/**
+ * @template T
+ * @typedef {Object} InternalOptions
+ * @property {string} name
+ * @property {string} input
+ * @property {RawSourceMap | undefined} inputSourceMap
+ * @property {ExtractCommentsOptions | undefined} extractComments
+ * @property {{ implementation: MinimizerImplementation<T>, options: MinimizerOptions<T> }} minimizer
+ */
+/**
+ * @template T
+ * @typedef {JestWorker & { transform: (options: string) => MinimizedResult, minify: (options: InternalOptions<T>) => MinimizedResult }} MinimizerWorker
+ */
+/**
+ * @typedef {undefined | boolean | number} Parallel
+ */
+/**
+ * @typedef {Object} BasePluginOptions
+ * @property {Rules} [test]
+ * @property {Rules} [include]
+ * @property {Rules} [exclude]
+ * @property {ExtractCommentsOptions} [extractComments]
+ * @property {Parallel} [parallel]
+ */
+/**
+ * @template T
+ * @typedef {T extends TerserOptions ? { minify?: MinimizerImplementation<T> | undefined, terserOptions?: MinimizerOptions<T> | undefined } : { minify: MinimizerImplementation<T>, terserOptions?: MinimizerOptions<T> | undefined }} DefinedDefaultMinimizerAndOptions
+ */
+/**
+ * @template T
+ * @typedef {BasePluginOptions & { minimizer: { implementation: MinimizerImplementation<T>, options: MinimizerOptions<T> } }} InternalPluginOptions
+ */
+/**
+ * @template [T=TerserOptions]
+ */
+declare class TerserPlugin<T = import("terser").MinifyOptions> {
+  /**
+   * @private
+   * @param {any} input
+   * @returns {boolean}
+   */
+  private static isSourceMap;
+  /**
+   * @private
+   * @param {unknown} warning
+   * @param {string} file
+   * @returns {Error}
+   */
+  private static buildWarning;
+  /**
+   * @private
+   * @param {any} error
+   * @param {string} file
+   * @param {SourceMapConsumer} [sourceMap]
+   * @param {Compilation["requestShortener"]} [requestShortener]
+   * @returns {Error}
+   */
+  private static buildError;
+  /**
+   * @private
+   * @param {Parallel} parallel
+   * @returns {number}
+   */
+  private static getAvailableNumberOfCores;
+  /**
+   * @private
+   * @param {any} environment
+   * @returns {TerserECMA}
+   */
+  private static getEcmaVersion;
+  /**
+   * @param {BasePluginOptions & DefinedDefaultMinimizerAndOptions<T>} [options]
+   */
+  constructor(
+    options?:
+      | (BasePluginOptions & DefinedDefaultMinimizerAndOptions<T>)
+      | undefined
+  );
+  /**
+   * @private
+   * @type {InternalPluginOptions<T>}
+   */
+  private options;
+  /**
+   * @private
+   * @param {Compiler} compiler
+   * @param {Compilation} compilation
+   * @param {Record<string, import("webpack").sources.Source>} assets
+   * @param {{availableNumberOfCores: number}} optimizeOptions
+   * @returns {Promise<void>}
+   */
+  private optimize;
+  /**
+   * @param {Compiler} compiler
+   * @returns {void}
+   */
+  apply(compiler: Compiler): void;
+}
+declare namespace TerserPlugin {
+  export {
+    terserMinify,
+    uglifyJsMinify,
+    swcMinify,
+    esbuildMinify,
+    Schema,
+    Compiler,
+    Compilation,
+    WebpackError,
+    Asset,
+    TerserECMA,
+    TerserOptions,
+    JestWorker,
+    RawSourceMap,
+    Rule,
+    Rules,
+    ExtractCommentsFunction,
+    ExtractCommentsCondition,
+    ExtractCommentsFilename,
+    ExtractCommentsBanner,
+    ExtractCommentsObject,
+    ExtractCommentsOptions,
+    MinimizedResult,
+    Input,
+    CustomOptions,
+    InferDefaultType,
+    PredefinedOptions,
+    MinimizerOptions,
+    BasicMinimizerImplementation,
+    MinimizeFunctionHelpers,
+    MinimizerImplementation,
+    InternalOptions,
+    MinimizerWorker,
+    Parallel,
+    BasePluginOptions,
+    DefinedDefaultMinimizerAndOptions,
+    InternalPluginOptions,
+  };
+}
+type Compiler = import("webpack").Compiler;
+type BasePluginOptions = {
+  test?: Rules | undefined;
+  include?: Rules | undefined;
+  exclude?: Rules | undefined;
+  extractComments?: ExtractCommentsOptions | undefined;
+  parallel?: Parallel;
+};
+type DefinedDefaultMinimizerAndOptions<T> = T extends TerserOptions
+  ? {
+      minify?: MinimizerImplementation<T> | undefined;
+      terserOptions?: MinimizerOptions<T> | undefined;
+    }
+  : {
+      minify: MinimizerImplementation<T>;
+      terserOptions?: MinimizerOptions<T> | undefined;
+    };
+import { terserMinify } from "./utils";
+import { uglifyJsMinify } from "./utils";
+import { swcMinify } from "./utils";
+import { esbuildMinify } from "./utils";
+type Schema = import("schema-utils/declarations/validate").Schema;
+type Compilation = import("webpack").Compilation;
+type WebpackError = import("webpack").WebpackError;
+type Asset = import("webpack").Asset;
+type TerserECMA = import("./utils.js").TerserECMA;
+type TerserOptions = import("./utils.js").TerserOptions;
+type JestWorker = import("jest-worker").Worker;
+type RawSourceMap = import("source-map").RawSourceMap;
+type Rule = RegExp | string;
+type Rules = Rule[] | Rule;
+type ExtractCommentsFunction = (
+  astNode: any,
+  comment: {
+    value: string;
+    type: "comment1" | "comment2" | "comment3" | "comment4";
+    pos: number;
+    line: number;
+    col: number;
+  }
+) => boolean;
+type ExtractCommentsCondition =
+  | boolean
+  | "all"
+  | "some"
+  | RegExp
+  | ExtractCommentsFunction;
+type ExtractCommentsFilename = string | ((fileData: any) => string);
+type ExtractCommentsBanner =
+  | string
+  | boolean
+  | ((commentsFile: string) => string);
+type ExtractCommentsObject = {
+  condition?: ExtractCommentsCondition | undefined;
+  filename?: ExtractCommentsFilename | undefined;
+  banner?: ExtractCommentsBanner | undefined;
+};
+type ExtractCommentsOptions = ExtractCommentsCondition | ExtractCommentsObject;
+type MinimizedResult = {
+  code: string;
+  map?: import("source-map").RawSourceMap | undefined;
+  errors?: (string | Error)[] | undefined;
+  warnings?: (string | Error)[] | undefined;
+  extractedComments?: string[] | undefined;
+};
+type Input = {
+  [file: string]: string;
+};
+type CustomOptions = {
+  [key: string]: any;
+};
+type InferDefaultType<T> = T extends infer U ? U : CustomOptions;
+type PredefinedOptions = {
+  module?: boolean | undefined;
+  ecma?: import("terser").ECMA | undefined;
+};
+type MinimizerOptions<T> = PredefinedOptions & InferDefaultType<T>;
+type BasicMinimizerImplementation<T> = (
+  input: Input,
+  sourceMap: RawSourceMap | undefined,
+  minifyOptions: MinimizerOptions<T>,
+  extractComments: ExtractCommentsOptions | undefined
+) => Promise<MinimizedResult>;
+type MinimizeFunctionHelpers = {
+  getMinimizerVersion?: (() => string | undefined) | undefined;
+};
+type MinimizerImplementation<T> = BasicMinimizerImplementation<T> &
+  MinimizeFunctionHelpers;
+type InternalOptions<T> = {
+  name: string;
+  input: string;
+  inputSourceMap: RawSourceMap | undefined;
+  extractComments: ExtractCommentsOptions | undefined;
+  minimizer: {
+    implementation: MinimizerImplementation<T>;
+    options: MinimizerOptions<T>;
+  };
+};
+type MinimizerWorker<T> = Worker & {
+  transform: (options: string) => MinimizedResult;
+  minify: (options: InternalOptions<T>) => MinimizedResult;
+};
+type Parallel = undefined | boolean | number;
+type InternalPluginOptions<T> = BasePluginOptions & {
+  minimizer: {
+    implementation: MinimizerImplementation<T>;
+    options: MinimizerOptions<T>;
+  };
+};
+import { minify } from "./minify";
+import { Worker } from "jest-worker";
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/minify.d.ts b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/minify.d.ts
new file mode 100644
index 0000000..0213d74
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/minify.d.ts
@@ -0,0 +1,17 @@
+export type MinimizedResult = import("./index.js").MinimizedResult;
+export type CustomOptions = import("./index.js").CustomOptions;
+/** @typedef {import("./index.js").MinimizedResult} MinimizedResult */
+/** @typedef {import("./index.js").CustomOptions} CustomOptions */
+/**
+ * @template T
+ * @param {import("./index.js").InternalOptions<T>} options
+ * @returns {Promise<MinimizedResult>}
+ */
+export function minify<T>(
+  options: import("./index.js").InternalOptions<T>
+): Promise<MinimizedResult>;
+/**
+ * @param {string} options
+ * @returns {Promise<MinimizedResult>}
+ */
+export function transform(options: string): Promise<MinimizedResult>;
diff --git a/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/utils.d.ts b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/utils.d.ts
new file mode 100644
index 0000000..141b5ac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser-webpack-plugin/types/utils.d.ts
@@ -0,0 +1,100 @@
+export type Task<T> = () => Promise<T>;
+export type RawSourceMap = import("source-map").RawSourceMap;
+export type TerserFormatOptions = import("terser").FormatOptions;
+export type TerserOptions = import("terser").MinifyOptions;
+export type TerserECMA = import("terser").ECMA;
+export type ExtractCommentsOptions =
+  import("./index.js").ExtractCommentsOptions;
+export type ExtractCommentsFunction =
+  import("./index.js").ExtractCommentsFunction;
+export type ExtractCommentsCondition =
+  import("./index.js").ExtractCommentsCondition;
+export type Input = import("./index.js").Input;
+export type MinimizedResult = import("./index.js").MinimizedResult;
+export type PredefinedOptions = import("./index.js").PredefinedOptions;
+export type CustomOptions = import("./index.js").CustomOptions;
+export type ExtractedComments = Array<string>;
+/**
+ * @template T
+ * @typedef {() => Promise<T>} Task
+ */
+/**
+ * Run tasks with limited concurency.
+ * @template T
+ * @param {number} limit - Limit of tasks that run at once.
+ * @param {Task<T>[]} tasks - List of tasks to run.
+ * @returns {Promise<T[]>} A promise that fulfills to an array of the results
+ */
+export function throttleAll<T>(limit: number, tasks: Task<T>[]): Promise<T[]>;
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @param {ExtractCommentsOptions | undefined} extractComments
+ * @return {Promise<MinimizedResult>}
+ */
+export function terserMinify(
+  input: Input,
+  sourceMap: RawSourceMap | undefined,
+  minimizerOptions: PredefinedOptions & CustomOptions,
+  extractComments: ExtractCommentsOptions | undefined
+): Promise<MinimizedResult>;
+export namespace terserMinify {
+  /**
+   * @returns {string | undefined}
+   */
+  function getMinimizerVersion(): string | undefined;
+}
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @param {ExtractCommentsOptions | undefined} extractComments
+ * @return {Promise<MinimizedResult>}
+ */
+export function uglifyJsMinify(
+  input: Input,
+  sourceMap: RawSourceMap | undefined,
+  minimizerOptions: PredefinedOptions & CustomOptions,
+  extractComments: ExtractCommentsOptions | undefined
+): Promise<MinimizedResult>;
+export namespace uglifyJsMinify {
+  /**
+   * @returns {string | undefined}
+   */
+  function getMinimizerVersion(): string | undefined;
+}
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @return {Promise<MinimizedResult>}
+ */
+export function swcMinify(
+  input: Input,
+  sourceMap: RawSourceMap | undefined,
+  minimizerOptions: PredefinedOptions & CustomOptions
+): Promise<MinimizedResult>;
+export namespace swcMinify {
+  /**
+   * @returns {string | undefined}
+   */
+  function getMinimizerVersion(): string | undefined;
+}
+/**
+ * @param {Input} input
+ * @param {RawSourceMap | undefined} sourceMap
+ * @param {PredefinedOptions & CustomOptions} minimizerOptions
+ * @return {Promise<MinimizedResult>}
+ */
+export function esbuildMinify(
+  input: Input,
+  sourceMap: RawSourceMap | undefined,
+  minimizerOptions: PredefinedOptions & CustomOptions
+): Promise<MinimizedResult>;
+export namespace esbuildMinify {
+  /**
+   * @returns {string | undefined}
+   */
+  function getMinimizerVersion(): string | undefined;
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/terser/CHANGELOG.md
new file mode 100644
index 0000000..2ae1a24
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/CHANGELOG.md
@@ -0,0 +1,480 @@
+# Changelog
+
+## v5.12.1
+
+ - Fixed an issue with function definitions inside blocks (#1155)
+ - Fixed parens of `new` in some situations (closes #1159)
+
+## v5.12.0
+
+ - `TERSER_DEBUG_DIR` environment variable
+ - @copyright comments are now preserved with the comments="some" option (#1153)
+
+## v5.11.0
+
+ - Unicode code point escapes (`\u{abcde}`) are not emitted inside RegExp literals anymore (#1147)
+ - acorn is now a regular dependency
+
+## v5.10.0
+
+ - Massive optimization to max_line_len (#1109)
+ - Basic support for import assertions
+ - Marked ES2022 Object.hasOwn as a pure function
+ - Fix `delete optional?.property`
+ - New CI/CD pipeline with github actions (#1057)
+ - Fix reordering of switch branches (#1092), (#1084)
+ - Fix error when creating a class property called `get`
+ - Acorn dependency is now an optional peerDependency
+ - Fix mangling collision with exported variables (#1072)
+ - Fix an issue with `return someVariable = (async () => { ... })()` (#1073)
+
+## v5.9.0
+
+ - Collapsing switch cases with the same bodies (even if they're not next to each other) (#1070).
+ - Fix evaluation of optional chain expressions (#1062)
+ - Fix mangling collision in ESM exports (#1063)
+ - Fix issue with mutating function objects after a second pass (#1047)
+ - Fix for inlining object spread `{ ...obj }` (#1071)
+ - Typescript typings fix (#1069)
+
+## v5.8.0
+
+ - Fixed shadowing variables while moving code in some cases (#1065)
+ - Stop mangling computed & quoted properties when keep_quoted is enabled.
+ - Fix for mangling private getter/setter and .#private access (#1060, #1068)
+ - Array.from has a new optimization when the unsafe option is set (#737)
+ - Mangle/propmangle let you generate your own identifiers through the nth_identifier option (#1061)
+ - More optimizations to switch statements (#1044)
+
+## v5.7.2
+
+ - Fixed issues with compressing functions defined in `global_defs` option (#1036)
+ - New recipe for using Terser in gulp was added to RECIPES.md (#1035)
+ - Fixed issues with `??` and `?.` (#1045)
+ - Future reserved words such as `package` no longer require you to disable strict mode to be used as names.
+ - Refactored huge compressor file into multiple more focused files.
+ - Avoided unparenthesized `in` operator in some for loops (it breaks parsing because of for..in loops)
+ - Improved documentation (#1021, #1025)
+ - More type definitions (#1021)
+
+## v5.7.1
+
+ - Avoided collapsing assignments together if it would place a chain assignment on the left hand side, which is invalid syntax (`a?.b = c`)
+ - Removed undefined from object expansions (`{ ...void 0 }` -> `{}`)
+ - Fix crash when checking if something is nullish or undefined (#1009)
+ - Fixed comparison of private class properties (#1015)
+ - Minor performance improvements (#993)
+ - Fixed scope of function defs in strict mode (they are block scoped)
+
+## v5.7.0
+
+ - Several compile-time evaluation and inlining fixes
+ - Allow `reduce_funcs` to be disabled again.
+ - Add `spidermonkey` options to parse and format (#974)
+ - Accept `{get = "default val"}` and `{set = "default val"}` in destructuring arguments.
+ - Change package.json export map to help require.resolve (#971)
+ - Improve docs
+ - Fix `export default` of an anonymous class with `extends`
+
+## v5.6.1
+
+ - Mark assignments to the `.prototype` of a class as pure
+ - Parenthesize `await` on the left of `**` (while accepting legacy non-parenthesised input)
+ - Avoided outputting NUL bytes in optimized RegExps, to stop the output from breaking other tools
+ - Added `exports` to domprops (#939)
+ - Fixed a crash when spreading `...this`
+ - Fixed the computed size of arrow functions, which improves their inlining
+
+## v5.6.0
+
+ - Added top-level await
+ - Beautify option has been removed in #895
+ - Private properties, getters and setters have been added in #913 and some more commits
+ - Docs improvements: #896, #903, #916
+
+## v5.5.1
+
+ - Fixed object properties with unicode surrogates on safari.
+
+## v5.5.0
+
+ - Fixed crash when inlining uninitialized variable into template string.
+ - The sourcemap for dist was removed for being too large.
+
+## v5.4.0
+
+ - Logical assignment
+ - Change `let x = undefined` to just `let x`
+ - Removed some optimizations for template strings, placing them behind `unsafe` options. Reason: adding strings is not equivalent to template strings, due to valueOf differences.
+ - The AST_Token class was slimmed down in order to use less memory.
+
+## v5.3.8
+
+ - Restore node 13 support
+
+## v5.3.7
+
+Hotfix release, fixes package.json "engines" syntax
+
+## v5.3.6
+
+ - Fixed parentheses when outputting `??` mixed with `||` and `&&`
+ - Improved hygiene of the symbol generator
+
+## v5.3.5
+
+ - Avoid moving named functions into default exports.
+ - Enabled transform() for chain expressions. This allows AST transformers to reach inside chain expressions.
+
+## v5.3.4
+
+ - Fixed a crash when hoisting (with `hoist_vars`) a destructuring variable declaration
+
+## v5.3.3
+
+ - `source-map` library has been updated, bringing memory usage and CPU time improvements when reading input source maps (the SourceMapConsumer is now WASM based).
+ - The `wrap_func_args` option now also wraps arrow functions, as opposed to only function expressions.
+
+## v5.3.2
+
+ - Prevented spread operations from being expanded when the expanded array/object contains getters, setters, or array holes.
+ - Fixed _very_ slow self-recursion in some cases of removing extraneous parentheses from `+` operations.
+
+## v5.3.1
+
+ - An issue with destructuring declarations when `pure_getters` is enabled has been fixed
+ - Fixed a crash when chain expressions need to be shallowly compared
+ - Made inlining functions more conservative to make sure a function that contains a reference to itself isn't moved into a place that can create multiple instances of itself.
+
+## v5.3.0
+
+ - Fixed a crash when compressing object spreads in some cases
+ - Fixed compiletime evaluation of optional chains (caused typeof a?.b to always return "object")
+ - domprops has been updated to contain every single possible prop
+
+## v5.2.1
+
+ - The parse step now doesn't accept an `ecma` option, so that all ES code is accepted.
+ - Optional dotted chains now accept keywords, just like dotted expressions (`foo?.default`)
+
+## v5.2.0
+
+ - Optional chaining syntax is now supported.
+ - Consecutive await expressions don't have unnecessary parens
+ - Taking the variable name's length (after mangling) into consideration when deciding to inline
+
+## v5.1.0
+
+ - `import.meta` is now supported
+ - Typescript typings have been improved
+
+## v5.0.0
+
+ - `in` operator now taken into account during property mangle.
+ - Fixed infinite loop in face of a reference loop in some situations.
+ - Kept exports and imports around even if there's something which will throw before them.
+ - The main exported bundle for commonjs, dist/bundle.min.js is no longer minified.
+
+## v5.0.0-beta.0
+
+ - BREAKING: `minify()` is now async and rejects a promise instead of returning an error.
+ - BREAKING: Internal AST is no longer exposed, so that it can be improved without releasing breaking changes.
+ - BREAKING: Lowest supported node version is 10
+ - BREAKING: There are no more warnings being emitted
+ - Module is now distributed as a dual package - You can `import` and `require()` too.
+ - Inline improvements were made
+
+## v4.8.0
+
+ - Support for numeric separators (`million = 1_000_000`) was added.
+ - Assigning properties to a class is now assumed to be pure.
+ - Fixed bug where `yield` wasn't considered a valid property key in generators.
+
+## v4.7.0
+
+ - A bug was fixed where an arrow function would have the wrong size
+ - `arguments` object is now considered safe to retrieve properties from (useful for `length`, or `0`) even when `pure_getters` is not set.
+ - Fixed erroneous `const` declarations without value (which is invalid) in some corner cases when using `collapse_vars`.
+
+## v4.6.13
+
+ - Fixed issue where ES5 object properties were being turned into ES6 object properties due to more lax unicode rules.
+ - Fixed parsing of BigInt with lowercase `e` in them.
+
+## v4.6.12
+
+ - Fixed subtree comparison code, making it see that `[1,[2, 3]]` is different from `[1, 2, [3]]`
+ - Printing of unicode identifiers has been improved
+
+## v4.6.11
+
+ - Read unused classes' properties and method keys, to figure out if they use other variables.
+ - Prevent inlining into block scopes when there are name collisions
+ - Functions are no longer inlined into parameter defaults, because they live in their own special scope.
+ - When inlining identity functions, take into account the fact they may be used to drop `this` in function calls.
+ - Nullish coalescing operator (`x ?? y`), plus basic optimization for it.
+ - Template literals in binary expressions such as `+` have been further optimized
+
+## v4.6.10
+
+ - Do not use reduce_vars when classes are present
+
+## v4.6.9
+
+ - Check if block scopes actually exist in blocks
+
+## v4.6.8
+
+ - Take into account "executed bits" of classes like static properties or computed keys, when checking if a class evaluation might throw or have side effects.
+
+## v4.6.7
+
+ - Some new performance gains through a `AST_Node.size()` method which measures a node's source code length without printing it to a string first.
+ - An issue with setting `--comments` to `false` in the CLI has been fixed.
+ - Fixed some issues with inlining
+ - `unsafe_symbols` compress option was added, which turns `Symbol("name")` into just `Symbol()`
+ - Brought back compress performance improvement through the `AST_Node.equivalent_to(other)` method (which was reverted in v4.6.6).
+
+## v4.6.6
+
+(hotfix release)
+
+ - Reverted code to 4.6.4 to allow for more time to investigate an issue.
+
+## v4.6.5 (REVERTED)
+
+ - Improved compress performance through using a new method to see if two nodes are equivalent, instead of printing them to a string.
+
+## v4.6.4
+
+ - The `"some"` value in the `comments` output option now preserves `@lic` and other important comments when using `//`
+ - `</script>` is now better escaped in regex, and in comments, when using the `inline_script` output option
+ - Fixed an issue when transforming `new RegExp` into `/.../` when slashes are included in the source
+ - `AST_Node.prototype.constructor` now exists, allowing for easier debugging of crashes
+ - Multiple if statements with the same consequents are now collapsed
+ - Typescript typings improvements
+ - Optimizations while looking for surrogate pairs in strings
+
+## v4.6.3
+
+ - Annotations such as `/*#__NOINLINE__*/` and `/*#__PURE__*/` may now be preserved using the `preserve_annotations` output option
+ - A TypeScript definition update for the `keep_quoted` output option.
+
+## v4.6.2
+
+ - A bug where functions were inlined into other functions with scope conflicts has been fixed.
+ - `/*#__NOINLINE__*/` annotation fixed for more use cases where inlining happens.
+
+## v4.6.1
+
+ - Fixed an issue where a class is duplicated by reduce_vars when there's a recursive reference to the class.
+
+## v4.6.0
+
+ - Fixed issues with recursive class references.
+ - BigInt evaluation has been prevented, stopping Terser from evaluating BigInts like it would do regular numbers.
+ - Class property support has been added
+
+## v4.5.1
+
+(hotfix release)
+
+ - Fixed issue where `() => ({})[something]` was not parenthesised correctly.
+
+## v4.5.0
+
+ - Inlining has been improved
+ - An issue where keep_fnames combined with functions declared through variables was causing name shadowing has been fixed
+ - You can now set the ES version through their year
+ - The output option `keep_numbers` has been added, which prevents Terser from turning `1000` into `1e3` and such
+ - Internal small optimisations and refactors
+
+## v4.4.3
+
+ - Number and BigInt parsing has been fixed
+ - `/*#__INLINE__*/` annotation fixed for arrow functions with non-block bodies.
+ - Functional tests have been added, using [this repository](https://github.com/terser/terser-functional-tests).
+ - A memory leak, where the entire AST lives on after compression, has been plugged.
+
+## v4.4.2
+
+ - Fixed a problem with inlining identity functions
+
+## v4.4.1
+
+*note:* This introduced a feature, therefore it should have been a minor release.
+
+ - Fixed a crash when `unsafe` was enabled.
+ - An issue has been fixed where `let` statements might be collapsed out of their scope.
+ - Some error messages have been improved by adding quotes around variable names.
+
+## v4.4.0
+
+ - Added `/*#__INLINE__*/` and `/*#__NOINLINE__*/` annotations for calls. If a call has one of these, it either forces or forbids inlining.
+
+## v4.3.11
+
+ - Fixed a problem where `window` was considered safe to access, even though there are situations where it isn't (Node.js, workers...)
+ - Fixed an error where `++` and `--` were considered side-effect free
+ - `Number(x)` now needs both `unsafe` and and `unsafe_math` to be compressed into `+x` because `x` might be a `BigInt`
+ - `keep_fnames` now correctly supports regexes when the function is in a variable declaration
+
+## v4.3.10
+
+ - Fixed syntax error when repeated semicolons were encountered in classes
+ - Fixed invalid output caused by the creation of empty sequences internally
+ - Scopes are now updated when scopes are inlined into them
+
+## v4.3.9
+ - Fixed issue with mangle's `keep_fnames` option, introduced when adding code to keep variable names of anonymous functions
+
+## v4.3.8
+
+ - Typescript typings fix
+
+## v4.3.7
+
+ - Parsing of regex options in the CLI (which broke in v4.3.5) was fixed.
+ - typescript definition updates
+
+## v4.3.6
+
+(crash hotfix)
+
+## v4.3.5
+
+ - Fixed an issue with DOS line endings strings separated by `\` and a new line.
+ - Improved fix for the output size regression related to unused references within the extends section of a class.
+ - Variable names of anonymous functions (eg: `const x = () => { ... }` or `var func = function () {...}`) are now preserved when keep_fnames is true.
+ - Fixed performance degradation introduced for large payloads in v4.2.0
+
+## v4.3.4
+
+ - Fixed a regression where the output size was increased when unused classes were referred to in the extends clause of a class.
+ - Small typescript typings fixes.
+ - Comments with `@preserve`, `@license`, `@cc_on` as well as comments starting with `/*!` and `/**!` are now preserved by default.
+
+## v4.3.3
+
+ - Fixed a problem where parsing template strings would mix up octal notation and a slash followed by a zero representing a null character.
+ - Started accepting the name `async` in destructuring arguments with default value.
+ - Now Terser takes into account side effects inside class `extends` clauses.
+ - Added parens whenever there's a comment between a return statement and the returned value, to prevent issues with ASI.
+ - Stopped using raw RegExp objects, since the spec is going to continue to evolve. This ensures Terser is able to process new, unknown RegExp flags and features. This is a breaking change in the AST node AST_RegExp.
+
+## v4.3.2
+
+ - Typescript typing fix
+ - Ensure that functions can't be inlined, by reduce_vars, into places where they're accessing variables with the same name, but from somewhere else.
+
+## v4.3.1
+
+ - Fixed an issue from 4.3.0 where any block scope within a for loop erroneously had its parent set to the function scopee
+ - Fixed an issue where compressing IIFEs with argument expansions would result in some parameters becoming undefined
+ - addEventListener options argument's properties are now part of the DOM properties list.
+
+## v4.3.0
+
+ - Do not drop computed object keys with side effects
+ - Functions passed to other functions in calls are now wrapped in parentheses by default, which speeds up loading most modules
+ - Objects with computed properties are now less likely to be hoisted
+ - Speed and memory efficiency optimizations
+ - Fixed scoping issues with `try` and `switch`
+
+## v4.2.1
+
+ - Minor refactors
+ - Fixed a bug similar to #369 in collapse_vars
+ - Functions can no longer be inlined into a place where they're going to be compared with themselves.
+ - reduce_funcs option is now legacy, as using reduce_vars without reduce_funcs caused some weird corner cases. As a result, it is now implied in reduce_vars and can't be turned off without turning off reduce_vars.
+ - Bug which would cause a random stack overflow has now been fixed.
+
+## v4.2.0
+
+ - When the source map URL is `inline`, don't write it to a file.
+ - Fixed output parens when a lambda literal is the tag on a tagged template string.
+ - The `mangle.properties.undeclared` option was added. This enables the property mangler to mangle properties of variables which can be found in the name cache, but whose properties are not known to this Terser run.
+ - The v8 bug where the toString and source representations of regexes like `RegExp("\\\n")` includes an actual newline is now fixed.
+ - Now we're guaranteed to not have duplicate comments in the output
+ - Domprops updates
+
+## v4.1.4
+
+ - Fixed a crash when inlining a function into somewhere else when it has interdependent, non-removable variables.
+
+## v4.1.3
+
+ - Several issues with the `reduce_vars` option were fixed.
+ - Starting this version, we only have a dist/bundle.min.js
+
+## v4.1.2
+
+ - The hotfix was hotfixed
+
+## v4.1.1
+
+ - Fixed a bug where toplevel scopes were being mixed up with lambda scopes
+
+## v4.1.0
+
+ - Internal functions were replaced by `Object.assign`, `Array.prototype.some`, `Array.prototype.find` and `Array.prototype.every`.
+ - A serious issue where some ESM-native code was broken was fixed.
+ - Performance improvements were made.
+ - Support for BigInt was added.
+ - Inline efficiency was improved. Functions are now being inlined more proactively instead of being inlined only after another Compressor pass.
+
+## v4.0.2
+
+(Hotfix release. Reverts unmapped segments PR [#342](https://github.com/terser/terser/pull/342), which will be put back on Terser when the upstream issue is resolved)
+
+## v4.0.1
+
+ - Collisions between the arguments of inlined functions and names in the outer scope are now being avoided while inlining
+ - Unmapped segments are now preserved when compressing a file which has source maps
+ - Default values of functions are now correctly converted from Mozilla AST to Terser AST
+ - JSON ⊂ ECMAScript spec (if you don't know what this is you don't need to)
+ - Export AST_* classes to library users
+ - Fixed issue with `collapse_vars` when functions are created with the same name as a variable which already exists
+ - Added `MutationObserverInit` (Object with options for initialising a mutation observer) properties to the DOM property list
+ - Custom `Error` subclasses are now internally used instead of old-school Error inheritance hacks.
+ - Documentation fixes
+ - Performance optimizations
+
+## v4.0.0
+
+ - **breaking change**: The `variables` property of all scopes has become a standard JavaScript `Map` as opposed to the old bespoke `Dictionary` object.
+ - Typescript definitions were fixed
+ - `terser --help` was fixed
+ - The public interface was cleaned up
+ - Fixed optimisation of `Array` and `new Array`
+ - Added the `keep_quoted=strict` mode to mangle_props, which behaves more like Google Closure Compiler by mangling all unquoted property names, instead of reserving quoted property names automatically.
+ - Fixed parent functions' parameters being shadowed in some cases
+ - Allowed Terser to run in a situation where there are custom functions attached to Object.prototype
+ - And more bug fixes, optimisations and internal changes
+
+## v3.17.0
+
+ - More DOM properties added to --mangle-properties's DOM property list
+ - Closed issue where if 2 functions had the same argument name, Terser would not inline them together properly
+ - Fixed issue with `hasOwnProperty.call`
+ - You can now list files to minify in a Terser config file
+ - Started replacing `new Array(<number>)` with an array literal
+ - Started using ES6 capabilities like `Set` and the `includes` method for strings and arrays
+
+## v3.16.1
+
+ - Fixed issue where Terser being imported with `import` would cause it not to work due to the `__esModule` property. (PR #254 was submitted, which was nice, but since it wasn't a pure commonJS approach I decided to go with my own solution)
+
+## v3.16.0
+
+ - No longer leaves names like Array or Object or window as a SimpleStatement (statement which is just a single expression).
+ - Add support for sections sourcemaps (IndexedSourceMapConsumer)
+ - Drops node.js v4 and starts using commonJS
+ - Is now built with rollup
+
+## v3.15.0
+
+ - Inlined spread syntax (`[...[1, 2, 3], 4, 5] => [1, 2, 3, 4, 5]`) in arrays and objects.
+ - Fixed typo in compressor warning
+ - Fixed inline source map input bug
+ - Fixed parsing of template literals with unnecessary escapes (Like `\\a`)
diff --git a/node_modules/mathjs/examples/node_modules/terser/LICENSE b/node_modules/mathjs/examples/node_modules/terser/LICENSE
new file mode 100644
index 0000000..f99e1fb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/LICENSE
@@ -0,0 +1,29 @@
+Terser is released under the BSD license:
+
+Copyright 2012-2018 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+    * Redistributions of source code must retain the above
+      copyright notice, this list of conditions and the following
+      disclaimer.
+
+    * Redistributions in binary form must reproduce the above
+      copyright notice, this list of conditions and the following
+      disclaimer in the documentation and/or other materials
+      provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/terser/PATRONS.md b/node_modules/mathjs/examples/node_modules/terser/PATRONS.md
new file mode 100644
index 0000000..b2c8949
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/PATRONS.md
@@ -0,0 +1,15 @@
+# Our patrons
+
+These are the first-tier patrons from [Patreon](https://www.patreon.com/fabiosantoscode). My appreciation goes to everyone on this list for supporting the project!
+
+ * 38elements
+ * Alan Orozco
+ * Aria Buckles
+ * CKEditor
+ * Mariusz Nowak
+ * Nakshatra Mukhopadhyay
+ * Philippe Léger
+ * Piotrek Koszuliński
+ * Serhiy Shyyko
+ * Viktor Hubert
+ * 龙腾道
diff --git a/node_modules/mathjs/examples/node_modules/terser/README.md b/node_modules/mathjs/examples/node_modules/terser/README.md
new file mode 100644
index 0000000..2e19701
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/README.md
@@ -0,0 +1,1374 @@
+<h1><img src="https://terser.org/img/terser-banner-logo.png" alt="Terser" width="400"></h1>
+
+  [![NPM Version][npm-image]][npm-url]
+  [![NPM Downloads][downloads-image]][downloads-url]
+  [![Travis Build][travis-image]][travis-url]
+  [![Opencollective financial contributors][opencollective-contributors]][opencollective-url]
+
+A JavaScript mangler/compressor toolkit for ES6+.
+
+*note*: You can support this project on patreon: <a target="_blank" rel="nofollow" href="https://www.patreon.com/fabiosantoscode"><img src="https://c5.patreon.com/external/logo/become_a_patron_button@2x.png" alt="patron" width="100px" height="auto"></a>. Check out [PATRONS.md](https://github.com/terser/terser/blob/master/PATRONS.md) for our first-tier patrons.
+
+Terser recommends you use RollupJS to bundle your modules, as that produces smaller code overall.
+
+*Beautification* has been undocumented and is *being removed* from terser, we recommend you use [prettier](https://npmjs.com/package/prettier).
+
+Find the changelog in [CHANGELOG.md](https://github.com/terser/terser/blob/master/CHANGELOG.md)
+
+
+
+[npm-image]: https://img.shields.io/npm/v/terser.svg
+[npm-url]: https://npmjs.org/package/terser
+[downloads-image]: https://img.shields.io/npm/dm/terser.svg
+[downloads-url]: https://npmjs.org/package/terser
+[travis-image]: https://app.travis-ci.com/terser/terser.svg?branch=master
+[travis-url]: https://app.travis-ci.com/github/terser/terser
+[opencollective-contributors]: https://opencollective.com/terser/tiers/badge.svg
+[opencollective-url]: https://opencollective.com/terser
+
+Why choose terser?
+------------------
+
+`uglify-es` is [no longer maintained](https://github.com/mishoo/UglifyJS2/issues/3156#issuecomment-392943058) and `uglify-js` does not support ES6+.
+
+**`terser`** is a fork of `uglify-es` that mostly retains API and CLI compatibility
+with `uglify-es` and `uglify-js@3`.
+
+Install
+-------
+
+First make sure you have installed the latest version of [node.js](http://nodejs.org/)
+(You may need to restart your computer after this step).
+
+From NPM for use as a command line app:
+
+    npm install terser -g
+
+From NPM for programmatic use:
+
+    npm install terser
+
+# Command line usage
+
+<!-- CLI_USAGE:START -->
+
+    terser [input files] [options]
+
+Terser can take multiple input files.  It's recommended that you pass the
+input files first, then pass the options.  Terser will parse input files
+in sequence and apply any compression options.  The files are parsed in the
+same global scope, that is, a reference from a file to some
+variable/function declared in another file will be matched properly.
+
+Command line arguments that take options (like --parse, --compress, --mangle and
+--format) can take in a comma-separated list of default option overrides. For
+instance:
+
+    terser input.js --compress ecma=2015,computed_props=false
+
+If no input file is specified, Terser will read from STDIN.
+
+If you wish to pass your options before the input files, separate the two with
+a double dash to prevent input files being used as option arguments:
+
+    terser --compress --mangle -- input.js
+
+### Command line options
+
+```
+    -h, --help                  Print usage information.
+                                `--help options` for details on available options.
+    -V, --version               Print version number.
+    -p, --parse <options>       Specify parser options:
+                                `acorn`  Use Acorn for parsing.
+                                `bare_returns`  Allow return outside of functions.
+                                                Useful when minifying CommonJS
+                                                modules and Userscripts that may
+                                                be anonymous function wrapped (IIFE)
+                                                by the .user.js engine `caller`.
+                                `expression`  Parse a single expression, rather than
+                                              a program (for parsing JSON).
+                                `spidermonkey`  Assume input files are SpiderMonkey
+                                                AST format (as JSON).
+    -c, --compress [options]    Enable compressor/specify compressor options:
+                                `pure_funcs`  List of functions that can be safely
+                                              removed when their return values are
+                                              not used.
+    -m, --mangle [options]      Mangle names/specify mangler options:
+                                `reserved`  List of names that should not be mangled.
+    --mangle-props [options]    Mangle properties/specify mangler options:
+                                `builtins`  Mangle property names that overlaps
+                                            with standard JavaScript globals and DOM
+                                            API props.
+                                `debug`  Add debug prefix and suffix.
+                                `keep_quoted`  Only mangle unquoted properties, quoted
+                                               properties are automatically reserved.
+                                               `strict` disables quoted properties
+                                               being automatically reserved.
+                                `regex`  Only mangle matched property names.
+                                `reserved`  List of names that should not be mangled.
+    -f, --format [options]      Specify format options.
+                                `preamble`  Preamble to prepend to the output. You
+                                            can use this to insert a comment, for
+                                            example for licensing information.
+                                            This will not be parsed, but the source
+                                            map will adjust for its presence.
+                                `quote_style`  Quote style:
+                                               0 - auto
+                                               1 - single
+                                               2 - double
+                                               3 - original
+                                `wrap_iife`  Wrap IIFEs in parenthesis. Note: you may
+                                             want to disable `negate_iife` under
+                                             compressor options.
+                                `wrap_func_args`  Wrap function arguments in parenthesis.
+    -o, --output <file>         Output file path (default STDOUT). Specify `ast` or
+                                `spidermonkey` to write Terser or SpiderMonkey AST
+                                as JSON to STDOUT respectively.
+    --comments [filter]         Preserve copyright comments in the output. By
+                                default this works like Google Closure, keeping
+                                JSDoc-style comments that contain e.g. "@license",
+                                or start with "!". You can optionally pass one of the
+                                following arguments to this flag:
+                                - "all" to keep all comments
+                                - `false` to omit comments in the output
+                                - a valid JS RegExp like `/foo/` or `/^!/` to
+                                keep only matching comments.
+                                Note that currently not *all* comments can be
+                                kept when compression is on, because of dead
+                                code removal or cascading statements into
+                                sequences.
+    --config-file <file>        Read `minify()` options from JSON file.
+    -d, --define <expr>[=value] Global definitions.
+    --ecma <version>            Specify ECMAScript release: 5, 2015, 2016, etc.
+    -e, --enclose [arg[:value]] Embed output in a big function with configurable
+                                arguments and values.
+    --ie8                       Support non-standard Internet Explorer 8.
+                                Equivalent to setting `ie8: true` in `minify()`
+                                for `compress`, `mangle` and `format` options.
+                                By default Terser will not try to be IE-proof.
+    --keep-classnames           Do not mangle/drop class names.
+    --keep-fnames               Do not mangle/drop function names.  Useful for
+                                code relying on Function.prototype.name.
+    --module                    Input is an ES6 module. If `compress` or `mangle` is
+                                enabled then the `toplevel` option will be enabled.
+    --name-cache <file>         File to hold mangled name mappings.
+    --safari10                  Support non-standard Safari 10/11.
+                                Equivalent to setting `safari10: true` in `minify()`
+                                for `mangle` and `format` options.
+                                By default `terser` will not work around
+                                Safari 10/11 bugs.
+    --source-map [options]      Enable source map/specify source map options:
+                                `base`  Path to compute relative paths from input files.
+                                `content`  Input source map, useful if you're compressing
+                                           JS that was generated from some other original
+                                           code. Specify "inline" if the source map is
+                                           included within the sources.
+                                `filename`  Name and/or location of the output source.
+                                `includeSources`  Pass this flag if you want to include
+                                                  the content of source files in the
+                                                  source map as sourcesContent property.
+                                `root`  Path to the original source to be included in
+                                        the source map.
+                                `url`  If specified, path to the source map to append in
+                                       `//# sourceMappingURL`.
+    --timings                   Display operations run time on STDERR.
+    --toplevel                  Compress and/or mangle variables in top level scope.
+    --wrap <name>               Embed everything in a big function, making the
+                                “exports” and “global” variables available. You
+                                need to pass an argument to this option to
+                                specify the name that your module will take
+                                when included in, say, a browser.
+```
+
+Specify `--output` (`-o`) to declare the output file.  Otherwise the output
+goes to STDOUT.
+
+## CLI source map options
+
+Terser can generate a source map file, which is highly useful for
+debugging your compressed JavaScript.  To get a source map, pass
+`--source-map --output output.js` (source map will be written out to
+`output.js.map`).
+
+Additional options:
+
+- `--source-map "filename='<NAME>'"` to specify the name of the source map.
+
+- `--source-map "root='<URL>'"` to pass the URL where the original files can be found.
+
+- `--source-map "url='<URL>'"` to specify the URL where the source map can be found.
+  Otherwise Terser assumes HTTP `X-SourceMap` is being used and will omit the
+  `//# sourceMappingURL=` directive.
+
+For example:
+
+    terser js/file1.js js/file2.js \
+             -o foo.min.js -c -m \
+             --source-map "root='http://foo.com/src',url='foo.min.js.map'"
+
+The above will compress and mangle `file1.js` and `file2.js`, will drop the
+output in `foo.min.js` and the source map in `foo.min.js.map`.  The source
+mapping will refer to `http://foo.com/src/js/file1.js` and
+`http://foo.com/src/js/file2.js` (in fact it will list `http://foo.com/src`
+as the source map root, and the original files as `js/file1.js` and
+`js/file2.js`).
+
+### Composed source map
+
+When you're compressing JS code that was output by a compiler such as
+CoffeeScript, mapping to the JS code won't be too helpful.  Instead, you'd
+like to map back to the original code (i.e. CoffeeScript).  Terser has an
+option to take an input source map.  Assuming you have a mapping from
+CoffeeScript → compiled JS, Terser can generate a map from CoffeeScript →
+compressed JS by mapping every token in the compiled JS to its original
+location.
+
+To use this feature pass `--source-map "content='/path/to/input/source.map'"`
+or `--source-map "content=inline"` if the source map is included inline with
+the sources.
+
+## CLI compress options
+
+You need to pass `--compress` (`-c`) to enable the compressor.  Optionally
+you can pass a comma-separated list of [compress options](#compress-options).
+
+Options are in the form `foo=bar`, or just `foo` (the latter implies
+a boolean option that you want to set `true`; it's effectively a
+shortcut for `foo=true`).
+
+Example:
+
+    terser file.js -c toplevel,sequences=false
+
+## CLI mangle options
+
+To enable the mangler you need to pass `--mangle` (`-m`).  The following
+(comma-separated) options are supported:
+
+- `toplevel` (default `false`) -- mangle names declared in the top level scope.
+
+- `eval` (default `false`) -- mangle names visible in scopes where `eval` or `with` are used.
+
+When mangling is enabled but you want to prevent certain names from being
+mangled, you can declare those names with `--mangle reserved` — pass a
+comma-separated list of names.  For example:
+
+    terser ... -m reserved=['$','require','exports']
+
+to prevent the `require`, `exports` and `$` names from being changed.
+
+### CLI mangling property names (`--mangle-props`)
+
+**Note:** THIS **WILL** BREAK YOUR CODE. A good rule of thumb is not to use this unless you know exactly what you're doing and how this works and read this section until the end.
+
+Mangling property names is a separate step, different from variable name mangling.  Pass
+`--mangle-props` to enable it. The least dangerous
+way to use this is to use the `regex` option like so:
+
+```
+terser example.js -c -m --mangle-props regex=/_$/
+```
+
+This will mangle all properties that end with an
+underscore. So you can use it to mangle internal methods.
+
+By default, it will mangle all properties in the
+input code with the exception of built in DOM properties and properties
+in core JavaScript classes, which is what will break your code if you don't:
+
+1. Control all the code you're mangling
+2. Avoid using a module bundler, as they usually will call Terser on each file individually, making it impossible to pass mangled objects between modules.
+3. Avoid calling functions like `defineProperty` or `hasOwnProperty`, because they refer to object properties using strings and will break your code if you don't know what you are doing.
+
+An example:
+
+```javascript
+// example.js
+var x = {
+    baz_: 0,
+    foo_: 1,
+    calc: function() {
+        return this.foo_ + this.baz_;
+    }
+};
+x.bar_ = 2;
+x["baz_"] = 3;
+console.log(x.calc());
+```
+Mangle all properties (except for JavaScript `builtins`) (**very** unsafe):
+```bash
+$ terser example.js -c passes=2 -m --mangle-props
+```
+```javascript
+var x={o:3,t:1,i:function(){return this.t+this.o},s:2};console.log(x.i());
+```
+Mangle all properties except for `reserved` properties (still very unsafe):
+```bash
+$ terser example.js -c passes=2 -m --mangle-props reserved=[foo_,bar_]
+```
+```javascript
+var x={o:3,foo_:1,t:function(){return this.foo_+this.o},bar_:2};console.log(x.t());
+```
+Mangle all properties matching a `regex` (not as unsafe but still unsafe):
+```bash
+$ terser example.js -c passes=2 -m --mangle-props regex=/_$/
+```
+```javascript
+var x={o:3,t:1,calc:function(){return this.t+this.o},i:2};console.log(x.calc());
+```
+
+Combining mangle properties options:
+```bash
+$ terser example.js -c passes=2 -m --mangle-props regex=/_$/,reserved=[bar_]
+```
+```javascript
+var x={o:3,t:1,calc:function(){return this.t+this.o},bar_:2};console.log(x.calc());
+```
+
+In order for this to be of any use, we avoid mangling standard JS names and DOM
+API properties by default (`--mangle-props builtins` to override).
+
+A regular expression can be used to define which property names should be
+mangled.  For example, `--mangle-props regex=/^_/` will only mangle property
+names that start with an underscore.
+
+When you compress multiple files using this option, in order for them to
+work together in the end we need to ensure somehow that one property gets
+mangled to the same name in all of them.  For this, pass `--name-cache filename.json`
+and Terser will maintain these mappings in a file which can then be reused.
+It should be initially empty.  Example:
+
+```bash
+$ rm -f /tmp/cache.json  # start fresh
+$ terser file1.js file2.js --mangle-props --name-cache /tmp/cache.json -o part1.js
+$ terser file3.js file4.js --mangle-props --name-cache /tmp/cache.json -o part2.js
+```
+
+Now, `part1.js` and `part2.js` will be consistent with each other in terms
+of mangled property names.
+
+Using the name cache is not necessary if you compress all your files in a
+single call to Terser.
+
+### Mangling unquoted names (`--mangle-props keep_quoted`)
+
+Using quoted property name (`o["foo"]`) reserves the property name (`foo`)
+so that it is not mangled throughout the entire script even when used in an
+unquoted style (`o.foo`). Example:
+
+```javascript
+// stuff.js
+var o = {
+    "foo": 1,
+    bar: 3
+};
+o.foo += o.bar;
+console.log(o.foo);
+```
+```bash
+$ terser stuff.js --mangle-props keep_quoted -c -m
+```
+```javascript
+var o={foo:1,o:3};o.foo+=o.o,console.log(o.foo);
+```
+
+### Debugging property name mangling
+
+You can also pass `--mangle-props debug` in order to mangle property names
+without completely obscuring them. For example the property `o.foo`
+would mangle to `o._$foo$_` with this option. This allows property mangling
+of a large codebase while still being able to debug the code and identify
+where mangling is breaking things.
+
+```bash
+$ terser stuff.js --mangle-props debug -c -m
+```
+```javascript
+var o={_$foo$_:1,_$bar$_:3};o._$foo$_+=o._$bar$_,console.log(o._$foo$_);
+```
+
+You can also pass a custom suffix using `--mangle-props debug=XYZ`. This would then
+mangle `o.foo` to `o._$foo$XYZ_`. You can change this each time you compile a
+script to identify how a property got mangled. One technique is to pass a
+random number on every compile to simulate mangling changing with different
+inputs (e.g. as you update the input script with new properties), and to help
+identify mistakes like writing mangled keys to storage.
+
+<!-- CLI_USAGE:END -->
+
+# API Reference
+
+<!-- API_REFERENCE:START -->
+
+Assuming installation via NPM, you can load Terser in your application
+like this:
+
+```javascript
+const { minify } = require("terser");
+```
+
+Or,
+
+```javascript
+import { minify } from "terser";
+```
+
+Browser loading is also supported:
+```html
+<script src="https://cdn.jsdelivr.net/npm/source-map@0.7.3/dist/source-map.js"></script>
+<script src="https://cdn.jsdelivr.net/npm/terser/dist/bundle.min.js"></script>
+```
+
+There is a single async high level function, **`async minify(code, options)`**,
+which will perform all minification [phases](#minify-options) in a configurable
+manner. By default `minify()` will enable [`compress`](#compress-options)
+and [`mangle`](#mangle-options). Example:
+```javascript
+var code = "function add(first, second) { return first + second; }";
+var result = await minify(code, { sourceMap: true });
+console.log(result.code);  // minified output: function add(n,d){return n+d}
+console.log(result.map);  // source map
+```
+
+You can `minify` more than one JavaScript file at a time by using an object
+for the first argument where the keys are file names and the values are source
+code:
+```javascript
+var code = {
+    "file1.js": "function add(first, second) { return first + second; }",
+    "file2.js": "console.log(add(1 + 2, 3 + 4));"
+};
+var result = await minify(code);
+console.log(result.code);
+// function add(d,n){return d+n}console.log(add(3,7));
+```
+
+The `toplevel` option:
+```javascript
+var code = {
+    "file1.js": "function add(first, second) { return first + second; }",
+    "file2.js": "console.log(add(1 + 2, 3 + 4));"
+};
+var options = { toplevel: true };
+var result = await minify(code, options);
+console.log(result.code);
+// console.log(3+7);
+```
+
+The `nameCache` option:
+```javascript
+var options = {
+    mangle: {
+        toplevel: true,
+    },
+    nameCache: {}
+};
+var result1 = await minify({
+    "file1.js": "function add(first, second) { return first + second; }"
+}, options);
+var result2 = await minify({
+    "file2.js": "console.log(add(1 + 2, 3 + 4));"
+}, options);
+console.log(result1.code);
+// function n(n,r){return n+r}
+console.log(result2.code);
+// console.log(n(3,7));
+```
+
+You may persist the name cache to the file system in the following way:
+```javascript
+var cacheFileName = "/tmp/cache.json";
+var options = {
+    mangle: {
+        properties: true,
+    },
+    nameCache: JSON.parse(fs.readFileSync(cacheFileName, "utf8"))
+};
+fs.writeFileSync("part1.js", await minify({
+    "file1.js": fs.readFileSync("file1.js", "utf8"),
+    "file2.js": fs.readFileSync("file2.js", "utf8")
+}, options).code, "utf8");
+fs.writeFileSync("part2.js", await minify({
+    "file3.js": fs.readFileSync("file3.js", "utf8"),
+    "file4.js": fs.readFileSync("file4.js", "utf8")
+}, options).code, "utf8");
+fs.writeFileSync(cacheFileName, JSON.stringify(options.nameCache), "utf8");
+```
+
+An example of a combination of `minify()` options:
+```javascript
+var code = {
+    "file1.js": "function add(first, second) { return first + second; }",
+    "file2.js": "console.log(add(1 + 2, 3 + 4));"
+};
+var options = {
+    toplevel: true,
+    compress: {
+        global_defs: {
+            "@console.log": "alert"
+        },
+        passes: 2
+    },
+    format: {
+        preamble: "/* minified */"
+    }
+};
+var result = await minify(code, options);
+console.log(result.code);
+// /* minified */
+// alert(10);"
+```
+
+An error example:
+```javascript
+try {
+    const result = await minify({"foo.js" : "if (0) else console.log(1);"});
+    // Do something with result
+} catch (error) {
+    const { message, filename, line, col, pos } = error;
+    // Do something with error
+}
+```
+
+## Minify options
+
+- `ecma` (default `undefined`) - pass `5`, `2015`, `2016`, etc to override
+  `compress` and `format`'s `ecma` options.
+
+- `enclose` (default `false`) - pass `true`, or a string in the format
+  of `"args[:values]"`, where `args` and `values` are comma-separated
+  argument names and values, respectively, to embed the output in a big
+  function with the configurable arguments and values.
+
+- `parse` (default `{}`) — pass an object if you wish to specify some
+  additional [parse options](#parse-options).
+
+- `compress` (default `{}`) — pass `false` to skip compressing entirely.
+  Pass an object to specify custom [compress options](#compress-options).
+
+- `mangle` (default `true`) — pass `false` to skip mangling names, or pass
+  an object to specify [mangle options](#mangle-options) (see below).
+
+  - `mangle.properties` (default `false`) — a subcategory of the mangle option.
+    Pass an object to specify custom [mangle property options](#mangle-properties-options).
+
+- `module` (default `false`) — Use when minifying an ES6 module. "use strict"
+  is implied and names can be mangled on the top scope. If `compress` or
+  `mangle` is enabled then the `toplevel` option will be enabled.
+
+- `format` or `output` (default `null`) — pass an object if you wish to specify
+  additional [format options](#format-options).  The defaults are optimized
+  for best compression.
+
+- `sourceMap` (default `false`) - pass an object if you wish to specify
+  [source map options](#source-map-options).
+
+- `toplevel` (default `false`) - set to `true` if you wish to enable top level
+  variable and function name mangling and to drop unused variables and functions.
+
+- `nameCache` (default `null`) - pass an empty object `{}` or a previously
+  used `nameCache` object if you wish to cache mangled variable and
+  property names across multiple invocations of `minify()`. Note: this is
+  a read/write property. `minify()` will read the name cache state of this
+  object and update it during minification so that it may be
+  reused or externally persisted by the user.
+
+- `ie8` (default `false`) - set to `true` to support IE8.
+
+- `keep_classnames` (default: `undefined`) - pass `true` to prevent discarding or mangling
+  of class names. Pass a regular expression to only keep class names matching that regex.
+
+- `keep_fnames` (default: `false`) - pass `true` to prevent discarding or mangling
+  of function names. Pass a regular expression to only keep function names matching that regex.
+  Useful for code relying on `Function.prototype.name`. If the top level minify option
+  `keep_classnames` is `undefined` it will be overridden with the value of the top level
+  minify option `keep_fnames`.
+
+- `safari10` (default: `false`) - pass `true` to work around Safari 10/11 bugs in
+  loop scoping and `await`. See `safari10` options in [`mangle`](#mangle-options)
+  and [`format`](#format-options) for details.
+
+## Minify options structure
+
+```javascript
+{
+    parse: {
+        // parse options
+    },
+    compress: {
+        // compress options
+    },
+    mangle: {
+        // mangle options
+
+        properties: {
+            // mangle property options
+        }
+    },
+    format: {
+        // format options (can also use `output` for backwards compatibility)
+    },
+    sourceMap: {
+        // source map options
+    },
+    ecma: 5, // specify one of: 5, 2015, 2016, etc.
+    enclose: false, // or specify true, or "args:values"
+    keep_classnames: false,
+    keep_fnames: false,
+    ie8: false,
+    module: false,
+    nameCache: null, // or specify a name cache object
+    safari10: false,
+    toplevel: false
+}
+```
+
+### Source map options
+
+To generate a source map:
+```javascript
+var result = await minify({"file1.js": "var a = function() {};"}, {
+    sourceMap: {
+        filename: "out.js",
+        url: "out.js.map"
+    }
+});
+console.log(result.code); // minified output
+console.log(result.map);  // source map
+```
+
+Note that the source map is not saved in a file, it's just returned in
+`result.map`.  The value passed for `sourceMap.url` is only used to set
+`//# sourceMappingURL=out.js.map` in `result.code`. The value of
+`filename` is only used to set `file` attribute (see [the spec][sm-spec])
+in source map file.
+
+You can set option `sourceMap.url` to be `"inline"` and source map will
+be appended to code.
+
+You can also specify sourceRoot property to be included in source map:
+```javascript
+var result = await minify({"file1.js": "var a = function() {};"}, {
+    sourceMap: {
+        root: "http://example.com/src",
+        url: "out.js.map"
+    }
+});
+```
+
+If you're compressing compiled JavaScript and have a source map for it, you
+can use `sourceMap.content`:
+```javascript
+var result = await minify({"compiled.js": "compiled code"}, {
+    sourceMap: {
+        content: "content from compiled.js.map",
+        url: "minified.js.map"
+    }
+});
+// same as before, it returns `code` and `map`
+```
+
+If you're using the `X-SourceMap` header instead, you can just omit `sourceMap.url`.
+
+If you happen to need the source map as a raw object, set `sourceMap.asObject` to `true`.
+
+## Parse options
+
+- `bare_returns` (default `false`) -- support top level `return` statements
+
+- `html5_comments` (default `true`)
+
+- `shebang` (default `true`) -- support `#!command` as the first line
+
+- `spidermonkey` (default `false`) -- accept a Spidermonkey (Mozilla) AST
+
+## Compress options
+
+- `defaults` (default: `true`) -- Pass `false` to disable most default
+  enabled `compress` transforms. Useful when you only want to enable a few
+  `compress` options while disabling the rest.
+
+- `arrows` (default: `true`) -- Class and object literal methods are converted
+  will also be converted to arrow expressions if the resultant code is shorter:
+  `m(){return x}` becomes `m:()=>x`. To do this to regular ES5 functions which
+  don't use `this` or `arguments`, see `unsafe_arrows`.
+
+- `arguments` (default: `false`) -- replace `arguments[index]` with function
+  parameter name whenever possible.
+
+- `booleans` (default: `true`) -- various optimizations for boolean context,
+  for example `!!a ? b : c → a ? b : c`
+
+- `booleans_as_integers` (default: `false`) -- Turn booleans into 0 and 1, also
+  makes comparisons with booleans use `==` and `!=` instead of `===` and `!==`.
+
+- `collapse_vars` (default: `true`) -- Collapse single-use non-constant variables,
+  side effects permitting.
+
+- `comparisons` (default: `true`) -- apply certain optimizations to binary nodes,
+  e.g. `!(a <= b) → a > b` (only when `unsafe_comps`), attempts to negate binary
+  nodes, e.g. `a = !b && !c && !d && !e → a=!(b||c||d||e)` etc.
+
+- `computed_props` (default: `true`) -- Transforms constant computed properties
+  into regular ones: `{["computed"]: 1}` is converted to `{computed: 1}`.
+
+- `conditionals` (default: `true`) -- apply optimizations for `if`-s and conditional
+  expressions
+
+- `dead_code` (default: `true`) -- remove unreachable code
+
+- `directives` (default: `true`) -- remove redundant or non-standard directives
+
+- `drop_console` (default: `false`) -- Pass `true` to discard calls to
+  `console.*` functions. If you wish to drop a specific function call
+  such as `console.info` and/or retain side effects from function arguments
+  after dropping the function call then use `pure_funcs` instead.
+
+- `drop_debugger` (default: `true`) -- remove `debugger;` statements
+
+- `ecma` (default: `5`) -- Pass `2015` or greater to enable `compress` options that
+  will transform ES5 code into smaller ES6+ equivalent forms.
+
+- `evaluate` (default: `true`) -- attempt to evaluate constant expressions
+
+- `expression` (default: `false`) -- Pass `true` to preserve completion values
+  from terminal statements without `return`, e.g. in bookmarklets.
+
+- `global_defs` (default: `{}`) -- see [conditional compilation](#conditional-compilation)
+
+- `hoist_funs` (default: `false`) -- hoist function declarations
+
+- `hoist_props` (default: `true`) -- hoist properties from constant object and
+  array literals into regular variables subject to a set of constraints. For example:
+  `var o={p:1, q:2}; f(o.p, o.q);` is converted to `f(1, 2);`. Note: `hoist_props`
+  works best with `mangle` enabled, the `compress` option `passes` set to `2` or higher,
+  and the `compress` option `toplevel` enabled.
+
+- `hoist_vars` (default: `false`) -- hoist `var` declarations (this is `false`
+  by default because it seems to increase the size of the output in general)
+
+- `if_return` (default: `true`) -- optimizations for if/return and if/continue
+
+- `inline` (default: `true`) -- inline calls to function with simple/`return` statement:
+  - `false` -- same as `0`
+  - `0` -- disabled inlining
+  - `1` -- inline simple functions
+  - `2` -- inline functions with arguments
+  - `3` -- inline functions with arguments and variables
+  - `true` -- same as `3`
+
+- `join_vars` (default: `true`) -- join consecutive `var` statements
+
+- `keep_classnames` (default: `false`) -- Pass `true` to prevent the compressor from
+  discarding class names. Pass a regular expression to only keep class names matching
+  that regex. See also: the `keep_classnames` [mangle option](#mangle-options).
+
+- `keep_fargs` (default: `true`) -- Prevents the compressor from discarding unused
+  function arguments.  You need this for code which relies on `Function.length`.
+
+- `keep_fnames` (default: `false`) -- Pass `true` to prevent the
+  compressor from discarding function names. Pass a regular expression to only keep
+  function names matching that regex. Useful for code relying on `Function.prototype.name`.
+  See also: the `keep_fnames` [mangle option](#mangle-options).
+
+- `keep_infinity` (default: `false`) -- Pass `true` to prevent `Infinity` from
+  being compressed into `1/0`, which may cause performance issues on Chrome.
+
+- `loops` (default: `true`) -- optimizations for `do`, `while` and `for` loops
+  when we can statically determine the condition.
+
+- `module` (default `false`) -- Pass `true` when compressing an ES6 module. Strict
+  mode is implied and the `toplevel` option as well.
+
+- `negate_iife` (default: `true`) -- negate "Immediately-Called Function Expressions"
+  where the return value is discarded, to avoid the parens that the
+  code generator would insert.
+
+- `passes` (default: `1`) -- The maximum number of times to run compress.
+  In some cases more than one pass leads to further compressed code.  Keep in
+  mind more passes will take more time.
+
+- `properties` (default: `true`) -- rewrite property access using the dot notation, for
+  example `foo["bar"] → foo.bar`
+
+- `pure_funcs` (default: `null`) -- You can pass an array of names and
+  Terser will assume that those functions do not produce side
+  effects.  DANGER: will not check if the name is redefined in scope.
+  An example case here, for instance `var q = Math.floor(a/b)`.  If
+  variable `q` is not used elsewhere, Terser will drop it, but will
+  still keep the `Math.floor(a/b)`, not knowing what it does.  You can
+  pass `pure_funcs: [ 'Math.floor' ]` to let it know that this
+  function won't produce any side effect, in which case the whole
+  statement would get discarded.  The current implementation adds some
+  overhead (compression will be slower).
+
+- `pure_getters` (default: `"strict"`) -- If you pass `true` for
+  this, Terser will assume that object property access
+  (e.g. `foo.bar` or `foo["bar"]`) doesn't have any side effects.
+  Specify `"strict"` to treat `foo.bar` as side-effect-free only when
+  `foo` is certain to not throw, i.e. not `null` or `undefined`.
+
+- `reduce_vars` (default: `true`) -- Improve optimization on variables assigned with and
+  used as constant values.
+
+- `reduce_funcs` (default: `true`) -- Inline single-use functions when
+  possible. Depends on `reduce_vars` being enabled.  Disabling this option
+  sometimes improves performance of the output code.
+
+- `sequences` (default: `true`) -- join consecutive simple statements using the
+  comma operator.  May be set to a positive integer to specify the maximum number
+  of consecutive comma sequences that will be generated. If this option is set to
+  `true` then the default `sequences` limit is `200`. Set option to `false` or `0`
+  to disable. The smallest `sequences` length is `2`. A `sequences` value of `1`
+  is grandfathered to be equivalent to `true` and as such means `200`. On rare
+  occasions the default sequences limit leads to very slow compress times in which
+  case a value of `20` or less is recommended.
+
+- `side_effects` (default: `true`) -- Remove expressions which have no side effects
+  and whose results aren't used.
+
+- `switches` (default: `true`) -- de-duplicate and remove unreachable `switch` branches
+
+- `toplevel` (default: `false`) -- drop unreferenced functions (`"funcs"`) and/or
+  variables (`"vars"`) in the top level scope (`false` by default, `true` to drop
+  both unreferenced functions and variables)
+
+- `top_retain` (default: `null`) -- prevent specific toplevel functions and
+  variables from `unused` removal (can be array, comma-separated, RegExp or
+  function. Implies `toplevel`)
+
+- `typeofs` (default: `true`) -- Transforms `typeof foo == "undefined"` into
+  `foo === void 0`.  Note: recommend to set this value to `false` for IE10 and
+  earlier versions due to known issues.
+
+- `unsafe` (default: `false`) -- apply "unsafe" transformations
+  ([details](#the-unsafe-compress-option)).
+
+- `unsafe_arrows` (default: `false`) -- Convert ES5 style anonymous function
+  expressions to arrow functions if the function body does not reference `this`.
+  Note: it is not always safe to perform this conversion if code relies on the
+  the function having a `prototype`, which arrow functions lack.
+  This transform requires that the `ecma` compress option is set to `2015` or greater.
+
+- `unsafe_comps` (default: `false`) -- Reverse `<` and `<=` to `>` and `>=` to
+  allow improved compression. This might be unsafe when an at least one of two
+  operands is an object with computed values due the use of methods like `get`,
+  or `valueOf`. This could cause change in execution order after operands in the
+  comparison are switching. Compression only works if both `comparisons` and
+  `unsafe_comps` are both set to true.
+
+- `unsafe_Function` (default: `false`) -- compress and mangle `Function(args, code)`
+  when both `args` and `code` are string literals.
+
+- `unsafe_math` (default: `false`) -- optimize numerical expressions like
+  `2 * x * 3` into `6 * x`, which may give imprecise floating point results.
+
+- `unsafe_symbols` (default: `false`) -- removes keys from native Symbol
+  declarations, e.g `Symbol("kDog")` becomes `Symbol()`.
+
+- `unsafe_methods` (default: false) -- Converts `{ m: function(){} }` to
+  `{ m(){} }`. `ecma` must be set to `6` or greater to enable this transform.
+  If `unsafe_methods` is a RegExp then key/value pairs with keys matching the
+  RegExp will be converted to concise methods.
+  Note: if enabled there is a risk of getting a "`<method name>` is not a
+  constructor" TypeError should any code try to `new` the former function.
+
+- `unsafe_proto` (default: `false`) -- optimize expressions like
+  `Array.prototype.slice.call(a)` into `[].slice.call(a)`
+
+- `unsafe_regexp` (default: `false`) -- enable substitutions of variables with
+  `RegExp` values the same way as if they are constants.
+
+- `unsafe_undefined` (default: `false`) -- substitute `void 0` if there is a
+  variable named `undefined` in scope (variable name will be mangled, typically
+  reduced to a single character)
+
+- `unused` (default: `true`) -- drop unreferenced functions and variables (simple
+  direct variable assignments do not count as references unless set to `"keep_assign"`)
+
+## Mangle options
+
+- `eval` (default `false`) -- Pass `true` to mangle names visible in scopes
+  where `eval` or `with` are used.
+
+- `keep_classnames` (default `false`) -- Pass `true` to not mangle class names.
+  Pass a regular expression to only keep class names matching that regex.
+  See also: the `keep_classnames` [compress option](#compress-options).
+
+- `keep_fnames` (default `false`) -- Pass `true` to not mangle function names.
+  Pass a regular expression to only keep function names matching that regex.
+  Useful for code relying on `Function.prototype.name`. See also: the `keep_fnames`
+  [compress option](#compress-options).
+
+- `module` (default `false`) -- Pass `true` an ES6 modules, where the toplevel
+  scope is not the global scope. Implies `toplevel`.
+
+- `nth_identifier` (default: an internal mangler that weights based on character
+  frequency analysis) -- Pass an object with a `get(n)` function that converts an
+  ordinal into the nth most favored (usually shortest) identifier.
+  Optionally also provide `reset()`, `sort()`, and `consider(chars, delta)` to
+  use character frequency analysis of the source code.
+
+- `reserved` (default `[]`) -- Pass an array of identifiers that should be
+  excluded from mangling. Example: `["foo", "bar"]`.
+
+- `toplevel` (default `false`) -- Pass `true` to mangle names declared in the
+  top level scope.
+
+- `safari10` (default `false`) -- Pass `true` to work around the Safari 10 loop
+  iterator [bug](https://bugs.webkit.org/show_bug.cgi?id=171041)
+  "Cannot declare a let variable twice".
+  See also: the `safari10` [format option](#format-options).
+
+Examples:
+
+```javascript
+// test.js
+var globalVar;
+function funcName(firstLongName, anotherLongName) {
+    var myVariable = firstLongName +  anotherLongName;
+}
+```
+```javascript
+var code = fs.readFileSync("test.js", "utf8");
+
+await minify(code).code;
+// 'function funcName(a,n){}var globalVar;'
+
+await minify(code, { mangle: { reserved: ['firstLongName'] } }).code;
+// 'function funcName(firstLongName,a){}var globalVar;'
+
+await minify(code, { mangle: { toplevel: true } }).code;
+// 'function n(n,a){}var a;'
+```
+
+### Mangle properties options
+
+- `builtins` (default: `false`) — Use `true` to allow the mangling of builtin
+  DOM properties. Not recommended to override this setting.
+
+- `debug` (default: `false`) — Mangle names with the original name still present.
+  Pass an empty string `""` to enable, or a non-empty string to set the debug suffix.
+
+- `keep_quoted` (default: `false`) — How quoting properties (`{"prop": ...}` and `obj["prop"]`) controls what gets mangled.
+  - `"strict"` (recommended) -- `obj.prop` is mangled.
+  - `false` -- `obj["prop"]` is mangled.
+  - `true` -- `obj.prop` is mangled unless there is `obj["prop"]` elsewhere in the code.
+
+- `nth_identifer` (default: an internal mangler that weights based on character
+  frequency analysis) -- Pass an object with a `get(n)` function that converts an
+  ordinal into the nth most favored (usually shortest) identifier.
+  Optionally also provide `reset()`, `sort()`, and `consider(chars, delta)` to
+  use character frequency analysis of the source code.
+
+- `regex` (default: `null`) — Pass a [RegExp literal or pattern string](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp) to only mangle property matching the regular expression.
+
+- `reserved` (default: `[]`) — Do not mangle property names listed in the
+  `reserved` array.
+
+- `undeclared` (default: `false`) - Mangle those names when they are accessed
+  as properties of known top level variables but their declarations are never
+  found in input code. May be useful when only minifying parts of a project.
+  See [#397](https://github.com/terser/terser/issues/397) for more details.
+
+
+## Format options
+
+These options control the format of Terser's output code. Previously known
+as "output options".
+
+- `ascii_only` (default `false`) -- escape Unicode characters in strings and
+  regexps (affects directives with non-ascii characters becoming invalid)
+
+- `beautify` (default `false`) -- (DEPRECATED) whether to beautify the output.
+  When using the legacy `-b` CLI flag, this is set to true by default.
+
+- `braces` (default `false`) -- always insert braces in `if`, `for`,
+  `do`, `while` or `with` statements, even if their body is a single
+  statement.
+
+- `comments` (default `"some"`) -- by default it keeps JSDoc-style comments
+  that contain "@license", "@copyright", "@preserve" or start with `!`, pass `true`
+  or `"all"` to preserve all comments, `false` to omit comments in the output,
+  a regular expression string (e.g. `/^!/`) or a function.
+
+- `ecma` (default `5`) -- set desired EcmaScript standard version for output.
+  Set `ecma` to `2015` or greater to emit shorthand object properties - i.e.:
+  `{a}` instead of `{a: a}`.  The `ecma` option will only change the output in
+  direct control of the beautifier. Non-compatible features in your input will
+  still be output as is. For example: an `ecma` setting of `5` will **not**
+  convert modern code to ES5.
+
+- `indent_level` (default `4`)
+
+- `indent_start` (default `0`) -- prefix all lines by that many spaces
+
+- `inline_script` (default `true`) -- escape HTML comments and the slash in
+  occurrences of `</script>` in strings
+
+- `keep_numbers` (default `false`) -- keep number literals as it was in original code
+ (disables optimizations like converting `1000000` into `1e6`)
+
+- `keep_quoted_props` (default `false`) -- when turned on, prevents stripping
+  quotes from property names in object literals.
+
+- `max_line_len` (default `false`) -- maximum line length (for minified code)
+
+- `preamble` (default `null`) -- when passed it must be a string and
+  it will be prepended to the output literally.  The source map will
+  adjust for this text.  Can be used to insert a comment containing
+  licensing information, for example.
+
+- `quote_keys` (default `false`) -- pass `true` to quote all keys in literal
+  objects
+
+- `quote_style` (default `0`) -- preferred quote style for strings (affects
+  quoted property names and directives as well):
+  - `0` -- prefers double quotes, switches to single quotes when there are
+    more double quotes in the string itself. `0` is best for gzip size.
+  - `1` -- always use single quotes
+  - `2` -- always use double quotes
+  - `3` -- always use the original quotes
+
+- `preserve_annotations` -- (default `false`) -- Preserve [Terser annotations](#annotations) in the output.
+
+- `safari10` (default `false`) -- set this option to `true` to work around
+  the [Safari 10/11 await bug](https://bugs.webkit.org/show_bug.cgi?id=176685).
+  See also: the `safari10` [mangle option](#mangle-options).
+
+- `semicolons` (default `true`) -- separate statements with semicolons.  If
+  you pass `false` then whenever possible we will use a newline instead of a
+  semicolon, leading to more readable output of minified code (size before
+  gzip could be smaller; size after gzip insignificantly larger).
+
+- `shebang` (default `true`) -- preserve shebang `#!` in preamble (bash scripts)
+
+- `spidermonkey` (default `false`) -- produce a Spidermonkey (Mozilla) AST
+
+- `webkit` (default `false`) -- enable workarounds for WebKit bugs.
+  PhantomJS users should set this option to `true`.
+
+- `wrap_iife` (default `false`) -- pass `true` to wrap immediately invoked
+  function expressions. See
+  [#640](https://github.com/mishoo/UglifyJS2/issues/640) for more details.
+
+- `wrap_func_args` (default `true`) -- pass `false` if you do not want to wrap
+  function expressions that are passed as arguments, in parenthesis. See
+  [OptimizeJS](https://github.com/nolanlawson/optimize-js) for more details.
+
+# Miscellaneous
+
+### Keeping copyright notices or other comments
+
+You can pass `--comments` to retain certain comments in the output.  By
+default it will keep comments starting with "!" and JSDoc-style comments that
+contain "@preserve", "@copyright", "@license" or "@cc_on" (conditional compilation for IE).
+You can pass `--comments all` to keep all the comments, or a valid JavaScript regexp to
+keep only comments that match this regexp.  For example `--comments /^!/`
+will keep comments like `/*! Copyright Notice */`.
+
+Note, however, that there might be situations where comments are lost.  For
+example:
+```javascript
+function f() {
+    /** @preserve Foo Bar */
+    function g() {
+        // this function is never called
+    }
+    return something();
+}
+```
+
+Even though it has "@preserve", the comment will be lost because the inner
+function `g` (which is the AST node to which the comment is attached to) is
+discarded by the compressor as not referenced.
+
+The safest comments where to place copyright information (or other info that
+needs to be kept in the output) are comments attached to toplevel nodes.
+
+### The `unsafe` `compress` option
+
+It enables some transformations that *might* break code logic in certain
+contrived cases, but should be fine for most code.  It assumes that standard
+built-in ECMAScript functions and classes have not been altered or replaced.
+You might want to try it on your own code; it should reduce the minified size.
+Some examples of the optimizations made when this option is enabled:
+
+- `new Array(1, 2, 3)` or `Array(1, 2, 3)` → `[ 1, 2, 3 ]`
+- `Array.from([1, 2, 3])` → `[1, 2, 3]`
+- `new Object()` → `{}`
+- `String(exp)` or `exp.toString()` → `"" + exp`
+- `new Object/RegExp/Function/Error/Array (...)` → we discard the `new`
+- `"foo bar".substr(4)` → `"bar"`
+
+### Conditional compilation
+
+You can use the `--define` (`-d`) switch in order to declare global
+variables that Terser will assume to be constants (unless defined in
+scope).  For example if you pass `--define DEBUG=false` then, coupled with
+dead code removal Terser will discard the following from the output:
+```javascript
+if (DEBUG) {
+    console.log("debug stuff");
+}
+```
+
+You can specify nested constants in the form of `--define env.DEBUG=false`.
+
+Another way of doing that is to declare your globals as constants in a
+separate file and include it into the build.  For example you can have a
+`build/defines.js` file with the following:
+```javascript
+var DEBUG = false;
+var PRODUCTION = true;
+// etc.
+```
+
+and build your code like this:
+
+    terser build/defines.js js/foo.js js/bar.js... -c
+
+Terser will notice the constants and, since they cannot be altered, it
+will evaluate references to them to the value itself and drop unreachable
+code as usual.  The build will contain the `const` declarations if you use
+them. If you are targeting < ES6 environments which does not support `const`,
+using `var` with `reduce_vars` (enabled by default) should suffice.
+
+### Conditional compilation API
+
+You can also use conditional compilation via the programmatic API. With the difference that the
+property name is `global_defs` and is a compressor property:
+
+```javascript
+var result = await minify(fs.readFileSync("input.js", "utf8"), {
+    compress: {
+        dead_code: true,
+        global_defs: {
+            DEBUG: false
+        }
+    }
+});
+```
+
+To replace an identifier with an arbitrary non-constant expression it is
+necessary to prefix the `global_defs` key with `"@"` to instruct Terser
+to parse the value as an expression:
+```javascript
+await minify("alert('hello');", {
+    compress: {
+        global_defs: {
+            "@alert": "console.log"
+        }
+    }
+}).code;
+// returns: 'console.log("hello");'
+```
+
+Otherwise it would be replaced as string literal:
+```javascript
+await minify("alert('hello');", {
+    compress: {
+        global_defs: {
+            "alert": "console.log"
+        }
+    }
+}).code;
+// returns: '"console.log"("hello");'
+```
+
+### Annotations
+
+Annotations in Terser are a way to tell it to treat a certain function call differently. The following annotations are available:
+
+ * `/*@__INLINE__*/` - forces a function to be inlined somewhere.
+ * `/*@__NOINLINE__*/` - Makes sure the called function is not inlined into the call site.
+ * `/*@__PURE__*/` - Marks a function call as pure. That means, it can safely be dropped.
+
+You can use either a `@` sign at the start, or a `#`.
+
+Here are some examples on how to use them:
+
+```javascript
+/*@__INLINE__*/
+function_always_inlined_here()
+
+/*#__NOINLINE__*/
+function_cant_be_inlined_into_here()
+
+const x = /*#__PURE__*/i_am_dropped_if_x_is_not_used()
+```
+
+### ESTree / SpiderMonkey AST
+
+Terser has its own abstract syntax tree format; for
+[practical reasons](http://lisperator.net/blog/uglifyjs-why-not-switching-to-spidermonkey-ast/)
+we can't easily change to using the SpiderMonkey AST internally.  However,
+Terser now has a converter which can import a SpiderMonkey AST.
+
+For example [Acorn][acorn] is a super-fast parser that produces a
+SpiderMonkey AST.  It has a small CLI utility that parses one file and dumps
+the AST in JSON on the standard output.  To use Terser to mangle and
+compress that:
+
+    acorn file.js | terser -p spidermonkey -m -c
+
+The `-p spidermonkey` option tells Terser that all input files are not
+JavaScript, but JS code described in SpiderMonkey AST in JSON.  Therefore we
+don't use our own parser in this case, but just transform that AST into our
+internal AST.
+
+`spidermonkey` is also available in `minify` as `parse` and `format` options to
+accept and/or produce a spidermonkey AST.
+
+### Use Acorn for parsing
+
+More for fun, I added the `-p acorn` option which will use Acorn to do all
+the parsing.  If you pass this option, Terser will `require("acorn")`.
+
+Acorn is really fast (e.g. 250ms instead of 380ms on some 650K code), but
+converting the SpiderMonkey tree that Acorn produces takes another 150ms so
+in total it's a bit more than just using Terser's own parser.
+
+[acorn]: https://github.com/ternjs/acorn
+[sm-spec]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k
+
+### Terser Fast Minify Mode
+
+It's not well known, but whitespace removal and symbol mangling accounts
+for 95% of the size reduction in minified code for most JavaScript - not
+elaborate code transforms. One can simply disable `compress` to speed up
+Terser builds by 3 to 4 times.
+
+| d3.js | size | gzip size | time (s) |
+|   --- | ---: |      ---: |     ---: |
+| original                                    | 451,131 | 108,733 |     - |
+| terser@3.7.5 mangle=false, compress=false   | 316,600 |  85,245 |  0.82 |
+| terser@3.7.5 mangle=true, compress=false    | 220,216 |  72,730 |  1.45 |
+| terser@3.7.5 mangle=true, compress=true     | 212,046 |  70,954 |  5.87 |
+| babili@0.1.4                                | 210,713 |  72,140 | 12.64 |
+| babel-minify@0.4.3                          | 210,321 |  72,242 | 48.67 |
+| babel-minify@0.5.0-alpha.01eac1c3           | 210,421 |  72,238 | 14.17 |
+
+To enable fast minify mode from the CLI use:
+```
+terser file.js -m
+```
+To enable fast minify mode with the API use:
+```js
+await minify(code, { compress: false, mangle: true });
+```
+
+#### Source maps and debugging
+
+Various `compress` transforms that simplify, rearrange, inline and remove code
+are known to have an adverse effect on debugging with source maps. This is
+expected as code is optimized and mappings are often simply not possible as
+some code no longer exists. For highest fidelity in source map debugging
+disable the `compress` option and just use `mangle`.
+
+### Compiler assumptions
+
+To allow for better optimizations, the compiler makes various assumptions:
+
+- `.toString()` and `.valueOf()` don't have side effects, and for built-in
+  objects they have not been overridden.
+- `undefined`, `NaN` and `Infinity` have not been externally redefined.
+- `arguments.callee`, `arguments.caller` and `Function.prototype.caller` are not used.
+- The code doesn't expect the contents of `Function.prototype.toString()` or
+  `Error.prototype.stack` to be anything in particular.
+- Getting and setting properties on a plain object does not cause other side effects
+  (using `.watch()` or `Proxy`).
+- Object properties can be added, removed and modified (not prevented with
+  `Object.defineProperty()`, `Object.defineProperties()`, `Object.freeze()`,
+  `Object.preventExtensions()` or `Object.seal()`).
+- `document.all` is not `== null`
+- Assigning properties to a class doesn't have side effects and does not throw.
+
+### Build Tools and Adaptors using Terser
+
+https://www.npmjs.com/browse/depended/terser
+
+### Replacing `uglify-es` with `terser` in a project using `yarn`
+
+A number of JS bundlers and uglify wrappers are still using buggy versions
+of `uglify-es` and have not yet upgraded to `terser`. If you are using `yarn`
+you can add the following alias to your project's `package.json` file:
+
+```js
+  "resolutions": {
+    "uglify-es": "npm:terser"
+  }
+```
+
+to use `terser` instead of `uglify-es` in all deeply nested dependencies
+without changing any code.
+
+Note: for this change to take effect you must run the following commands
+to remove the existing `yarn` lock file and reinstall all packages:
+
+```
+$ rm -rf node_modules yarn.lock
+$ yarn
+```
+
+<!-- API_REFERENCE:END -->
+
+# Reporting issues
+
+In the terser CLI we use [source-map-support](https://npmjs.com/source-map-support) to produce good error stacks. In your own app, you're expected to enable source-map-support (read their docs) to have nice stack traces that will help you write good issues.
+
+## Obtaining the source code given to Terser
+
+Because users often don't control the call to `await minify()` or its arguments, Terser provides a `TERSER_DEBUG_DIR` environment variable to make terser output some debug logs. If you're using a bundler or a project that includes a bundler and are not sure what went wrong with your code, pass that variable like so:
+
+```
+$ TERSER_DEBUG_DIR=/path/to/logs command-that-uses-terser
+$ ls /path/to/logs
+terser-debug-123456.log
+```
+
+If you're not sure how to set an environment variable on your shell (the above example works in bash), you can try using cross-env:
+
+```
+> npx cross-env TERSER_DEBUG_DIR=/path/to/logs command-that-uses-terser
+```
+
+# README.md Patrons:
+
+*note*: You can support this project on patreon: <a target="_blank" rel="nofollow" href="https://www.patreon.com/fabiosantoscode"><img src="https://c5.patreon.com/external/logo/become_a_patron_button@2x.png" alt="patron" width="100px" height="auto"></a>. Check out [PATRONS.md](https://github.com/terser/terser/blob/master/PATRONS.md) for our first-tier patrons.
+
+These are the second-tier patrons. Great thanks for your support!
+
+ * CKEditor ![](https://c10.patreonusercontent.com/3/eyJoIjoxMDAsInciOjEwMH0%3D/patreon-media/p/user/15452278/f8548dcf48d740619071e8d614459280/1?token-time=2145916800&token-hash=SIQ54PhIPHv3M7CVz9LxS8_8v4sOw4H304HaXsXj8MM%3D)
+ * 38elements ![](https://c10.patreonusercontent.com/3/eyJ3IjoyMDB9/patreon-media/p/user/12501844/88e7fc5dd62d45c6a5626533bbd48cfb/1?token-time=2145916800&token-hash=c3AsQ5T0IQWic0zKxFHu-bGGQJkXQFvafvJ4bPerFR4%3D)
+
+## Contributors
+
+### Code Contributors
+
+This project exists thanks to all the people who contribute. [[Contribute](CONTRIBUTING.md)].
+<a href="https://github.com/terser/terser/graphs/contributors"><img src="https://opencollective.com/terser/contributors.svg?width=890&button=false" /></a>
+
+### Financial Contributors
+
+Become a financial contributor and help us sustain our community. [[Contribute](https://opencollective.com/terser/contribute)]
+
+#### Individuals
+
+<a href="https://opencollective.com/terser"><img src="https://opencollective.com/terser/individuals.svg?width=890"></a>
+
+#### Organizations
+
+Support this project with your organization. Your logo will show up here with a link to your website. [[Contribute](https://opencollective.com/terser/contribute)]
+
+<a href="https://opencollective.com/terser/organization/0/website"><img src="https://opencollective.com/terser/organization/0/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/1/website"><img src="https://opencollective.com/terser/organization/1/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/2/website"><img src="https://opencollective.com/terser/organization/2/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/3/website"><img src="https://opencollective.com/terser/organization/3/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/4/website"><img src="https://opencollective.com/terser/organization/4/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/5/website"><img src="https://opencollective.com/terser/organization/5/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/6/website"><img src="https://opencollective.com/terser/organization/6/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/7/website"><img src="https://opencollective.com/terser/organization/7/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/8/website"><img src="https://opencollective.com/terser/organization/8/avatar.svg"></a>
+<a href="https://opencollective.com/terser/organization/9/website"><img src="https://opencollective.com/terser/organization/9/avatar.svg"></a>
diff --git a/node_modules/mathjs/examples/node_modules/terser/bin/package.json b/node_modules/mathjs/examples/node_modules/terser/bin/package.json
new file mode 100644
index 0000000..d937a6f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/bin/package.json
@@ -0,0 +1,10 @@
+{
+  "name": "bin",
+  "private": true,
+  "version": "1.0.0",
+  "main": "terser",
+  "type": "commonjs",
+  "author": "",
+  "license": "BSD-2-Clause",
+  "description": "A package to hold the Terser bin bundle as commonjs while keeping the rest of it ESM."
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/bin/terser b/node_modules/mathjs/examples/node_modules/terser/bin/terser
new file mode 100644
index 0000000..b0cdc7c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/bin/terser
@@ -0,0 +1,21 @@
+#!/usr/bin/env node
+
+"use strict";
+
+require("../tools/exit.cjs");
+
+try {
+    require("source-map-support").install();
+} catch (err) {}
+
+const fs = require("fs");
+const path = require("path");
+const program = require("commander");
+
+const packageJson = require("../package.json");
+const { _run_cli: run_cli } = require("..");
+
+run_cli({ program, packageJson, fs, path }).catch((error) => {
+    console.error(error);
+    process.exitCode = 1;
+});
diff --git a/node_modules/mathjs/examples/node_modules/terser/bin/uglifyjs b/node_modules/mathjs/examples/node_modules/terser/bin/uglifyjs
new file mode 100644
index 0000000..f193025
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/bin/uglifyjs
@@ -0,0 +1,10 @@
+#!/usr/bin/env node
+// -*- js -*-
+/* eslint-env node */
+
+"use strict";
+
+process.stderr.write( "DEPRECATION WARNING: uglifyjs binary will soon be discontinued!\n");
+process.stderr.write("Please use \"terser\" instead.\n\n");
+
+require("./terser");
diff --git a/node_modules/mathjs/examples/node_modules/terser/dist/.gitkeep b/node_modules/mathjs/examples/node_modules/terser/dist/.gitkeep
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/examples/node_modules/terser/dist/bundle.min.js b/node_modules/mathjs/examples/node_modules/terser/dist/bundle.min.js
new file mode 100644
index 0000000..b8e48eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/dist/bundle.min.js
@@ -0,0 +1,28332 @@
+(function (global, factory) {
+typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('source-map')) :
+typeof define === 'function' && define.amd ? define(['exports', 'source-map'], factory) :
+(global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.Terser = {}, global.sourceMap));
+}(this, (function (exports, MOZ_SourceMap) { 'use strict';
+
+function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }
+
+var MOZ_SourceMap__default = /*#__PURE__*/_interopDefaultLegacy(MOZ_SourceMap);
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+function characters(str) {
+    return str.split("");
+}
+
+function member(name, array) {
+    return array.includes(name);
+}
+
+class DefaultsError extends Error {
+    constructor(msg, defs) {
+        super();
+
+        this.name = "DefaultsError";
+        this.message = msg;
+        this.defs = defs;
+    }
+}
+
+function defaults(args, defs, croak) {
+    if (args === true) {
+        args = {};
+    } else if (args != null && typeof args === "object") {
+        args = {...args};
+    }
+
+    const ret = args || {};
+
+    if (croak) for (const i in ret) if (HOP(ret, i) && !HOP(defs, i)) {
+        throw new DefaultsError("`" + i + "` is not a supported option", defs);
+    }
+
+    for (const i in defs) if (HOP(defs, i)) {
+        if (!args || !HOP(args, i)) {
+            ret[i] = defs[i];
+        } else if (i === "ecma") {
+            let ecma = args[i] | 0;
+            if (ecma > 5 && ecma < 2015) ecma += 2009;
+            ret[i] = ecma;
+        } else {
+            ret[i] = (args && HOP(args, i)) ? args[i] : defs[i];
+        }
+    }
+
+    return ret;
+}
+
+function noop() {}
+function return_false() { return false; }
+function return_true() { return true; }
+function return_this() { return this; }
+function return_null() { return null; }
+
+var MAP = (function() {
+    function MAP(a, f, backwards) {
+        var ret = [], top = [], i;
+        function doit() {
+            var val = f(a[i], i);
+            var is_last = val instanceof Last;
+            if (is_last) val = val.v;
+            if (val instanceof AtTop) {
+                val = val.v;
+                if (val instanceof Splice) {
+                    top.push.apply(top, backwards ? val.v.slice().reverse() : val.v);
+                } else {
+                    top.push(val);
+                }
+            } else if (val !== skip) {
+                if (val instanceof Splice) {
+                    ret.push.apply(ret, backwards ? val.v.slice().reverse() : val.v);
+                } else {
+                    ret.push(val);
+                }
+            }
+            return is_last;
+        }
+        if (Array.isArray(a)) {
+            if (backwards) {
+                for (i = a.length; --i >= 0;) if (doit()) break;
+                ret.reverse();
+                top.reverse();
+            } else {
+                for (i = 0; i < a.length; ++i) if (doit()) break;
+            }
+        } else {
+            for (i in a) if (HOP(a, i)) if (doit()) break;
+        }
+        return top.concat(ret);
+    }
+    MAP.at_top = function(val) { return new AtTop(val); };
+    MAP.splice = function(val) { return new Splice(val); };
+    MAP.last = function(val) { return new Last(val); };
+    var skip = MAP.skip = {};
+    function AtTop(val) { this.v = val; }
+    function Splice(val) { this.v = val; }
+    function Last(val) { this.v = val; }
+    return MAP;
+})();
+
+function make_node(ctor, orig, props) {
+    if (!props) props = {};
+    if (orig) {
+        if (!props.start) props.start = orig.start;
+        if (!props.end) props.end = orig.end;
+    }
+    return new ctor(props);
+}
+
+function push_uniq(array, el) {
+    if (!array.includes(el))
+        array.push(el);
+}
+
+function string_template(text, props) {
+    return text.replace(/{(.+?)}/g, function(str, p) {
+        return props && props[p];
+    });
+}
+
+function remove(array, el) {
+    for (var i = array.length; --i >= 0;) {
+        if (array[i] === el) array.splice(i, 1);
+    }
+}
+
+function mergeSort(array, cmp) {
+    if (array.length < 2) return array.slice();
+    function merge(a, b) {
+        var r = [], ai = 0, bi = 0, i = 0;
+        while (ai < a.length && bi < b.length) {
+            cmp(a[ai], b[bi]) <= 0
+                ? r[i++] = a[ai++]
+                : r[i++] = b[bi++];
+        }
+        if (ai < a.length) r.push.apply(r, a.slice(ai));
+        if (bi < b.length) r.push.apply(r, b.slice(bi));
+        return r;
+    }
+    function _ms(a) {
+        if (a.length <= 1)
+            return a;
+        var m = Math.floor(a.length / 2), left = a.slice(0, m), right = a.slice(m);
+        left = _ms(left);
+        right = _ms(right);
+        return merge(left, right);
+    }
+    return _ms(array);
+}
+
+function makePredicate(words) {
+    if (!Array.isArray(words)) words = words.split(" ");
+
+    return new Set(words.sort());
+}
+
+function map_add(map, key, value) {
+    if (map.has(key)) {
+        map.get(key).push(value);
+    } else {
+        map.set(key, [ value ]);
+    }
+}
+
+function map_from_object(obj) {
+    var map = new Map();
+    for (var key in obj) {
+        if (HOP(obj, key) && key.charAt(0) === "$") {
+            map.set(key.substr(1), obj[key]);
+        }
+    }
+    return map;
+}
+
+function map_to_object(map) {
+    var obj = Object.create(null);
+    map.forEach(function (value, key) {
+        obj["$" + key] = value;
+    });
+    return obj;
+}
+
+function HOP(obj, prop) {
+    return Object.prototype.hasOwnProperty.call(obj, prop);
+}
+
+function keep_name(keep_setting, name) {
+    return keep_setting === true
+        || (keep_setting instanceof RegExp && keep_setting.test(name));
+}
+
+var lineTerminatorEscape = {
+    "\0": "0",
+    "\n": "n",
+    "\r": "r",
+    "\u2028": "u2028",
+    "\u2029": "u2029",
+};
+function regexp_source_fix(source) {
+    // V8 does not escape line terminators in regexp patterns in node 12
+    // We'll also remove literal \0
+    return source.replace(/[\0\n\r\u2028\u2029]/g, function (match, offset) {
+        var escaped = source[offset - 1] == "\\"
+            && (source[offset - 2] != "\\"
+            || /(?:^|[^\\])(?:\\{2})*$/.test(source.slice(0, offset - 1)));
+        return (escaped ? "" : "\\") + lineTerminatorEscape[match];
+    });
+}
+const all_flags = "gimuy";
+function sort_regexp_flags(flags) {
+    const existing_flags = new Set(flags.split(""));
+    let out = "";
+    for (const flag of all_flags) {
+        if (existing_flags.has(flag)) {
+            out += flag;
+            existing_flags.delete(flag);
+        }
+    }
+    if (existing_flags.size) {
+        // Flags Terser doesn't know about
+        existing_flags.forEach(flag => { out += flag; });
+    }
+    return out;
+}
+
+function has_annotation(node, annotation) {
+    return node._annotations & annotation;
+}
+
+function set_annotation(node, annotation) {
+    node._annotations |= annotation;
+}
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+    Parser based on parse-js (http://marijn.haverbeke.nl/parse-js/).
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+var LATEST_RAW = "";  // Only used for numbers and template strings
+var LATEST_TEMPLATE_END = true;
+
+var KEYWORDS = "break case catch class const continue debugger default delete do else export extends finally for function if in instanceof let new return switch throw try typeof var void while with";
+var KEYWORDS_ATOM = "false null true";
+var RESERVED_WORDS = "enum import super this " + KEYWORDS_ATOM + " " + KEYWORDS;
+var ALL_RESERVED_WORDS = "implements interface package private protected public static " + RESERVED_WORDS;
+var KEYWORDS_BEFORE_EXPRESSION = "return new delete throw else case yield await";
+
+KEYWORDS = makePredicate(KEYWORDS);
+RESERVED_WORDS = makePredicate(RESERVED_WORDS);
+KEYWORDS_BEFORE_EXPRESSION = makePredicate(KEYWORDS_BEFORE_EXPRESSION);
+KEYWORDS_ATOM = makePredicate(KEYWORDS_ATOM);
+ALL_RESERVED_WORDS = makePredicate(ALL_RESERVED_WORDS);
+
+var OPERATOR_CHARS = makePredicate(characters("+-*&%=<>!?|~^"));
+
+var RE_NUM_LITERAL = /[0-9a-f]/i;
+var RE_HEX_NUMBER = /^0x[0-9a-f]+$/i;
+var RE_OCT_NUMBER = /^0[0-7]+$/;
+var RE_ES6_OCT_NUMBER = /^0o[0-7]+$/i;
+var RE_BIN_NUMBER = /^0b[01]+$/i;
+var RE_DEC_NUMBER = /^\d*\.?\d*(?:e[+-]?\d*(?:\d\.?|\.?\d)\d*)?$/i;
+var RE_BIG_INT = /^(0[xob])?[0-9a-f]+n$/i;
+
+var OPERATORS = makePredicate([
+    "in",
+    "instanceof",
+    "typeof",
+    "new",
+    "void",
+    "delete",
+    "++",
+    "--",
+    "+",
+    "-",
+    "!",
+    "~",
+    "&",
+    "|",
+    "^",
+    "*",
+    "**",
+    "/",
+    "%",
+    ">>",
+    "<<",
+    ">>>",
+    "<",
+    ">",
+    "<=",
+    ">=",
+    "==",
+    "===",
+    "!=",
+    "!==",
+    "?",
+    "=",
+    "+=",
+    "-=",
+    "||=",
+    "&&=",
+    "??=",
+    "/=",
+    "*=",
+    "**=",
+    "%=",
+    ">>=",
+    "<<=",
+    ">>>=",
+    "|=",
+    "^=",
+    "&=",
+    "&&",
+    "??",
+    "||",
+]);
+
+var WHITESPACE_CHARS = makePredicate(characters(" \u00a0\n\r\t\f\u000b\u200b\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u2028\u2029\u202f\u205f\u3000\uFEFF"));
+
+var NEWLINE_CHARS = makePredicate(characters("\n\r\u2028\u2029"));
+
+var PUNC_AFTER_EXPRESSION = makePredicate(characters(";]),:"));
+
+var PUNC_BEFORE_EXPRESSION = makePredicate(characters("[{(,;:"));
+
+var PUNC_CHARS = makePredicate(characters("[]{}(),;:"));
+
+/* -----[ Tokenizer ]----- */
+
+// surrogate safe regexps adapted from https://github.com/mathiasbynens/unicode-8.0.0/tree/89b412d8a71ecca9ed593d9e9fa073ab64acfebe/Binary_Property
+var UNICODE = {
+    ID_Start: /[$A-Z_a-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\u0561-\u0587\u05D0-\u05EA\u05F0-\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\u08A0-\u08B4\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\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\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\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\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\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\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\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\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\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-\uAB65\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\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\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-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\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[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDF00-\uDF19]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\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]|\uD83A[\uDC00-\uDCC4]|\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-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]/,
+    ID_Continue: /(?:[$0-9A-Z_a-z\xAA\xB5\xB7\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B4\u08E3-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0AF9\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58-\u0C5A\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D5F-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\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\u135D-\u135F\u1369-\u1371\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19DA\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\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\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA8FD\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2F\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\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\uDD40-\uDD74\uDDFD\uDE80-\uDE9C\uDEA0-\uDED0\uDEE0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF7A\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCA0-\uDCA9\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\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-\uDE03\uDE05\uDE06\uDE0C-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE38-\uDE3A\uDE3F\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE6\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC00-\uDC46\uDC66-\uDC6F\uDC7F-\uDCBA\uDCD0-\uDCE8\uDCF0-\uDCF9\uDD00-\uDD34\uDD36-\uDD3F\uDD50-\uDD73\uDD76\uDD80-\uDDC4\uDDCA-\uDDCC\uDDD0-\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE37\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEEA\uDEF0-\uDEF9\uDF00-\uDF03\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3C-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF50\uDF57\uDF5D-\uDF63\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC80-\uDCC5\uDCC7\uDCD0-\uDCD9\uDD80-\uDDB5\uDDB8-\uDDC0\uDDD8-\uDDDD\uDE00-\uDE40\uDE44\uDE50-\uDE59\uDE80-\uDEB7\uDEC0-\uDEC9\uDF00-\uDF19\uDF1D-\uDF2B\uDF30-\uDF39]|\uD806[\uDCA0-\uDCE9\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE60-\uDE69\uDED0-\uDEED\uDEF0-\uDEF4\uDF00-\uDF36\uDF40-\uDF43\uDF50-\uDF59\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50-\uDF7E\uDF8F-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99\uDC9D\uDC9E]|\uD834[\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\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\uDFCE-\uDFFF]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD83A[\uDC00-\uDCC4\uDCD0-\uDCD6]|\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-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]|\uDB40[\uDD00-\uDDEF])+/,
+};
+
+function get_full_char(str, pos) {
+    if (is_surrogate_pair_head(str.charCodeAt(pos))) {
+        if (is_surrogate_pair_tail(str.charCodeAt(pos + 1))) {
+            return str.charAt(pos) + str.charAt(pos + 1);
+        }
+    } else if (is_surrogate_pair_tail(str.charCodeAt(pos))) {
+        if (is_surrogate_pair_head(str.charCodeAt(pos - 1))) {
+            return str.charAt(pos - 1) + str.charAt(pos);
+        }
+    }
+    return str.charAt(pos);
+}
+
+function get_full_char_code(str, pos) {
+    // https://en.wikipedia.org/wiki/Universal_Character_Set_characters#Surrogates
+    if (is_surrogate_pair_head(str.charCodeAt(pos))) {
+        return 0x10000 + (str.charCodeAt(pos) - 0xd800 << 10) + str.charCodeAt(pos + 1) - 0xdc00;
+    }
+    return str.charCodeAt(pos);
+}
+
+function get_full_char_length(str) {
+    var surrogates = 0;
+
+    for (var i = 0; i < str.length; i++) {
+        if (is_surrogate_pair_head(str.charCodeAt(i)) && is_surrogate_pair_tail(str.charCodeAt(i + 1))) {
+            surrogates++;
+            i++;
+        }
+    }
+
+    return str.length - surrogates;
+}
+
+function from_char_code(code) {
+    // Based on https://github.com/mathiasbynens/String.fromCodePoint/blob/master/fromcodepoint.js
+    if (code > 0xFFFF) {
+        code -= 0x10000;
+        return (String.fromCharCode((code >> 10) + 0xD800) +
+            String.fromCharCode((code % 0x400) + 0xDC00));
+    }
+    return String.fromCharCode(code);
+}
+
+function is_surrogate_pair_head(code) {
+    return code >= 0xd800 && code <= 0xdbff;
+}
+
+function is_surrogate_pair_tail(code) {
+    return code >= 0xdc00 && code <= 0xdfff;
+}
+
+function is_digit(code) {
+    return code >= 48 && code <= 57;
+}
+
+function is_identifier_start(ch) {
+    return UNICODE.ID_Start.test(ch);
+}
+
+function is_identifier_char(ch) {
+    return UNICODE.ID_Continue.test(ch);
+}
+
+const BASIC_IDENT = /^[a-z_$][a-z0-9_$]*$/i;
+
+function is_basic_identifier_string(str) {
+    return BASIC_IDENT.test(str);
+}
+
+function is_identifier_string(str, allow_surrogates) {
+    if (BASIC_IDENT.test(str)) {
+        return true;
+    }
+    if (!allow_surrogates && /[\ud800-\udfff]/.test(str)) {
+        return false;
+    }
+    var match = UNICODE.ID_Start.exec(str);
+    if (!match || match.index !== 0) {
+        return false;
+    }
+
+    str = str.slice(match[0].length);
+    if (!str) {
+        return true;
+    }
+
+    match = UNICODE.ID_Continue.exec(str);
+    return !!match && match[0].length === str.length;
+}
+
+function parse_js_number(num, allow_e = true) {
+    if (!allow_e && num.includes("e")) {
+        return NaN;
+    }
+    if (RE_HEX_NUMBER.test(num)) {
+        return parseInt(num.substr(2), 16);
+    } else if (RE_OCT_NUMBER.test(num)) {
+        return parseInt(num.substr(1), 8);
+    } else if (RE_ES6_OCT_NUMBER.test(num)) {
+        return parseInt(num.substr(2), 8);
+    } else if (RE_BIN_NUMBER.test(num)) {
+        return parseInt(num.substr(2), 2);
+    } else if (RE_DEC_NUMBER.test(num)) {
+        return parseFloat(num);
+    } else {
+        var val = parseFloat(num);
+        if (val == num) return val;
+    }
+}
+
+class JS_Parse_Error extends Error {
+    constructor(message, filename, line, col, pos) {
+        super();
+
+        this.name = "SyntaxError";
+        this.message = message;
+        this.filename = filename;
+        this.line = line;
+        this.col = col;
+        this.pos = pos;
+    }
+}
+
+function js_error(message, filename, line, col, pos) {
+    throw new JS_Parse_Error(message, filename, line, col, pos);
+}
+
+function is_token(token, type, val) {
+    return token.type == type && (val == null || token.value == val);
+}
+
+var EX_EOF = {};
+
+function tokenizer($TEXT, filename, html5_comments, shebang) {
+    var S = {
+        text            : $TEXT,
+        filename        : filename,
+        pos             : 0,
+        tokpos          : 0,
+        line            : 1,
+        tokline         : 0,
+        col             : 0,
+        tokcol          : 0,
+        newline_before  : false,
+        regex_allowed   : false,
+        brace_counter   : 0,
+        template_braces : [],
+        comments_before : [],
+        directives      : {},
+        directive_stack : []
+    };
+
+    function peek() { return get_full_char(S.text, S.pos); }
+
+    // Used because parsing ?. involves a lookahead for a digit
+    function is_option_chain_op() {
+        const must_be_dot = S.text.charCodeAt(S.pos + 1) === 46;
+        if (!must_be_dot) return false;
+
+        const cannot_be_digit = S.text.charCodeAt(S.pos + 2);
+        return cannot_be_digit < 48 || cannot_be_digit > 57;
+    }
+
+    function next(signal_eof, in_string) {
+        var ch = get_full_char(S.text, S.pos++);
+        if (signal_eof && !ch)
+            throw EX_EOF;
+        if (NEWLINE_CHARS.has(ch)) {
+            S.newline_before = S.newline_before || !in_string;
+            ++S.line;
+            S.col = 0;
+            if (ch == "\r" && peek() == "\n") {
+                // treat a \r\n sequence as a single \n
+                ++S.pos;
+                ch = "\n";
+            }
+        } else {
+            if (ch.length > 1) {
+                ++S.pos;
+                ++S.col;
+            }
+            ++S.col;
+        }
+        return ch;
+    }
+
+    function forward(i) {
+        while (i--) next();
+    }
+
+    function looking_at(str) {
+        return S.text.substr(S.pos, str.length) == str;
+    }
+
+    function find_eol() {
+        var text = S.text;
+        for (var i = S.pos, n = S.text.length; i < n; ++i) {
+            var ch = text[i];
+            if (NEWLINE_CHARS.has(ch))
+                return i;
+        }
+        return -1;
+    }
+
+    function find(what, signal_eof) {
+        var pos = S.text.indexOf(what, S.pos);
+        if (signal_eof && pos == -1) throw EX_EOF;
+        return pos;
+    }
+
+    function start_token() {
+        S.tokline = S.line;
+        S.tokcol = S.col;
+        S.tokpos = S.pos;
+    }
+
+    var prev_was_dot = false;
+    var previous_token = null;
+    function token(type, value, is_comment) {
+        S.regex_allowed = ((type == "operator" && !UNARY_POSTFIX.has(value)) ||
+                           (type == "keyword" && KEYWORDS_BEFORE_EXPRESSION.has(value)) ||
+                           (type == "punc" && PUNC_BEFORE_EXPRESSION.has(value))) ||
+                           (type == "arrow");
+        if (type == "punc" && (value == "." || value == "?.")) {
+            prev_was_dot = true;
+        } else if (!is_comment) {
+            prev_was_dot = false;
+        }
+        const line     = S.tokline;
+        const col      = S.tokcol;
+        const pos      = S.tokpos;
+        const nlb      = S.newline_before;
+        const file     = filename;
+        let comments_before = [];
+        let comments_after  = [];
+
+        if (!is_comment) {
+            comments_before = S.comments_before;
+            comments_after = S.comments_before = [];
+        }
+        S.newline_before = false;
+        const tok = new AST_Token(type, value, line, col, pos, nlb, comments_before, comments_after, file);
+
+        if (!is_comment) previous_token = tok;
+        return tok;
+    }
+
+    function skip_whitespace() {
+        while (WHITESPACE_CHARS.has(peek()))
+            next();
+    }
+
+    function read_while(pred) {
+        var ret = "", ch, i = 0;
+        while ((ch = peek()) && pred(ch, i++))
+            ret += next();
+        return ret;
+    }
+
+    function parse_error(err) {
+        js_error(err, filename, S.tokline, S.tokcol, S.tokpos);
+    }
+
+    function read_num(prefix) {
+        var has_e = false, after_e = false, has_x = false, has_dot = prefix == ".", is_big_int = false, numeric_separator = false;
+        var num = read_while(function(ch, i) {
+            if (is_big_int) return false;
+
+            var code = ch.charCodeAt(0);
+            switch (code) {
+              case 95: // _
+                return (numeric_separator = true);
+              case 98: case 66: // bB
+                return (has_x = true); // Can occur in hex sequence, don't return false yet
+              case 111: case 79: // oO
+              case 120: case 88: // xX
+                return has_x ? false : (has_x = true);
+              case 101: case 69: // eE
+                return has_x ? true : has_e ? false : (has_e = after_e = true);
+              case 45: // -
+                return after_e || (i == 0 && !prefix);
+              case 43: // +
+                return after_e;
+              case (after_e = false, 46): // .
+                return (!has_dot && !has_x && !has_e) ? (has_dot = true) : false;
+            }
+
+            if (ch === "n") {
+                is_big_int = true;
+
+                return true;
+            }
+
+            return RE_NUM_LITERAL.test(ch);
+        });
+        if (prefix) num = prefix + num;
+
+        LATEST_RAW = num;
+
+        if (RE_OCT_NUMBER.test(num) && next_token.has_directive("use strict")) {
+            parse_error("Legacy octal literals are not allowed in strict mode");
+        }
+        if (numeric_separator) {
+            if (num.endsWith("_")) {
+                parse_error("Numeric separators are not allowed at the end of numeric literals");
+            } else if (num.includes("__")) {
+                parse_error("Only one underscore is allowed as numeric separator");
+            }
+            num = num.replace(/_/g, "");
+        }
+        if (num.endsWith("n")) {
+            const without_n = num.slice(0, -1);
+            const allow_e = RE_HEX_NUMBER.test(without_n);
+            const valid = parse_js_number(without_n, allow_e);
+            if (!has_dot && RE_BIG_INT.test(num) && !isNaN(valid))
+                return token("big_int", without_n);
+            parse_error("Invalid or unexpected token");
+        }
+        var valid = parse_js_number(num);
+        if (!isNaN(valid)) {
+            return token("num", valid);
+        } else {
+            parse_error("Invalid syntax: " + num);
+        }
+    }
+
+    function is_octal(ch) {
+        return ch >= "0" && ch <= "7";
+    }
+
+    function read_escaped_char(in_string, strict_hex, template_string) {
+        var ch = next(true, in_string);
+        switch (ch.charCodeAt(0)) {
+          case 110 : return "\n";
+          case 114 : return "\r";
+          case 116 : return "\t";
+          case 98  : return "\b";
+          case 118 : return "\u000b"; // \v
+          case 102 : return "\f";
+          case 120 : return String.fromCharCode(hex_bytes(2, strict_hex)); // \x
+          case 117 : // \u
+            if (peek() == "{") {
+                next(true);
+                if (peek() === "}")
+                    parse_error("Expecting hex-character between {}");
+                while (peek() == "0") next(true); // No significance
+                var result, length = find("}", true) - S.pos;
+                // Avoid 32 bit integer overflow (1 << 32 === 1)
+                // We know first character isn't 0 and thus out of range anyway
+                if (length > 6 || (result = hex_bytes(length, strict_hex)) > 0x10FFFF) {
+                    parse_error("Unicode reference out of bounds");
+                }
+                next(true);
+                return from_char_code(result);
+            }
+            return String.fromCharCode(hex_bytes(4, strict_hex));
+          case 10  : return ""; // newline
+          case 13  :            // \r
+            if (peek() == "\n") { // DOS newline
+                next(true, in_string);
+                return "";
+            }
+        }
+        if (is_octal(ch)) {
+            if (template_string && strict_hex) {
+                const represents_null_character = ch === "0" && !is_octal(peek());
+                if (!represents_null_character) {
+                    parse_error("Octal escape sequences are not allowed in template strings");
+                }
+            }
+            return read_octal_escape_sequence(ch, strict_hex);
+        }
+        return ch;
+    }
+
+    function read_octal_escape_sequence(ch, strict_octal) {
+        // Read
+        var p = peek();
+        if (p >= "0" && p <= "7") {
+            ch += next(true);
+            if (ch[0] <= "3" && (p = peek()) >= "0" && p <= "7")
+                ch += next(true);
+        }
+
+        // Parse
+        if (ch === "0") return "\0";
+        if (ch.length > 0 && next_token.has_directive("use strict") && strict_octal)
+            parse_error("Legacy octal escape sequences are not allowed in strict mode");
+        return String.fromCharCode(parseInt(ch, 8));
+    }
+
+    function hex_bytes(n, strict_hex) {
+        var num = 0;
+        for (; n > 0; --n) {
+            if (!strict_hex && isNaN(parseInt(peek(), 16))) {
+                return parseInt(num, 16) || "";
+            }
+            var digit = next(true);
+            if (isNaN(parseInt(digit, 16)))
+                parse_error("Invalid hex-character pattern in string");
+            num += digit;
+        }
+        return parseInt(num, 16);
+    }
+
+    var read_string = with_eof_error("Unterminated string constant", function() {
+        const start_pos = S.pos;
+        var quote = next(), ret = [];
+        for (;;) {
+            var ch = next(true, true);
+            if (ch == "\\") ch = read_escaped_char(true, true);
+            else if (ch == "\r" || ch == "\n") parse_error("Unterminated string constant");
+            else if (ch == quote) break;
+            ret.push(ch);
+        }
+        var tok = token("string", ret.join(""));
+        LATEST_RAW = S.text.slice(start_pos, S.pos);
+        tok.quote = quote;
+        return tok;
+    });
+
+    var read_template_characters = with_eof_error("Unterminated template", function(begin) {
+        if (begin) {
+            S.template_braces.push(S.brace_counter);
+        }
+        var content = "", raw = "", ch, tok;
+        next(true, true);
+        while ((ch = next(true, true)) != "`") {
+            if (ch == "\r") {
+                if (peek() == "\n") ++S.pos;
+                ch = "\n";
+            } else if (ch == "$" && peek() == "{") {
+                next(true, true);
+                S.brace_counter++;
+                tok = token(begin ? "template_head" : "template_substitution", content);
+                LATEST_RAW = raw;
+                LATEST_TEMPLATE_END = false;
+                return tok;
+            }
+
+            raw += ch;
+            if (ch == "\\") {
+                var tmp = S.pos;
+                var prev_is_tag = previous_token && (previous_token.type === "name" || previous_token.type === "punc" && (previous_token.value === ")" || previous_token.value === "]"));
+                ch = read_escaped_char(true, !prev_is_tag, true);
+                raw += S.text.substr(tmp, S.pos - tmp);
+            }
+
+            content += ch;
+        }
+        S.template_braces.pop();
+        tok = token(begin ? "template_head" : "template_substitution", content);
+        LATEST_RAW = raw;
+        LATEST_TEMPLATE_END = true;
+        return tok;
+    });
+
+    function skip_line_comment(type) {
+        var regex_allowed = S.regex_allowed;
+        var i = find_eol(), ret;
+        if (i == -1) {
+            ret = S.text.substr(S.pos);
+            S.pos = S.text.length;
+        } else {
+            ret = S.text.substring(S.pos, i);
+            S.pos = i;
+        }
+        S.col = S.tokcol + (S.pos - S.tokpos);
+        S.comments_before.push(token(type, ret, true));
+        S.regex_allowed = regex_allowed;
+        return next_token;
+    }
+
+    var skip_multiline_comment = with_eof_error("Unterminated multiline comment", function() {
+        var regex_allowed = S.regex_allowed;
+        var i = find("*/", true);
+        var text = S.text.substring(S.pos, i).replace(/\r\n|\r|\u2028|\u2029/g, "\n");
+        // update stream position
+        forward(get_full_char_length(text) /* text length doesn't count \r\n as 2 char while S.pos - i does */ + 2);
+        S.comments_before.push(token("comment2", text, true));
+        S.newline_before = S.newline_before || text.includes("\n");
+        S.regex_allowed = regex_allowed;
+        return next_token;
+    });
+
+    var read_name = with_eof_error("Unterminated identifier name", function() {
+        var name = [], ch, escaped = false;
+        var read_escaped_identifier_char = function() {
+            escaped = true;
+            next();
+            if (peek() !== "u") {
+                parse_error("Expecting UnicodeEscapeSequence -- uXXXX or u{XXXX}");
+            }
+            return read_escaped_char(false, true);
+        };
+
+        // Read first character (ID_Start)
+        if ((ch = peek()) === "\\") {
+            ch = read_escaped_identifier_char();
+            if (!is_identifier_start(ch)) {
+                parse_error("First identifier char is an invalid identifier char");
+            }
+        } else if (is_identifier_start(ch)) {
+            next();
+        } else {
+            return "";
+        }
+
+        name.push(ch);
+
+        // Read ID_Continue
+        while ((ch = peek()) != null) {
+            if ((ch = peek()) === "\\") {
+                ch = read_escaped_identifier_char();
+                if (!is_identifier_char(ch)) {
+                    parse_error("Invalid escaped identifier char");
+                }
+            } else {
+                if (!is_identifier_char(ch)) {
+                    break;
+                }
+                next();
+            }
+            name.push(ch);
+        }
+        const name_str = name.join("");
+        if (RESERVED_WORDS.has(name_str) && escaped) {
+            parse_error("Escaped characters are not allowed in keywords");
+        }
+        return name_str;
+    });
+
+    var read_regexp = with_eof_error("Unterminated regular expression", function(source) {
+        var prev_backslash = false, ch, in_class = false;
+        while ((ch = next(true))) if (NEWLINE_CHARS.has(ch)) {
+            parse_error("Unexpected line terminator");
+        } else if (prev_backslash) {
+            source += "\\" + ch;
+            prev_backslash = false;
+        } else if (ch == "[") {
+            in_class = true;
+            source += ch;
+        } else if (ch == "]" && in_class) {
+            in_class = false;
+            source += ch;
+        } else if (ch == "/" && !in_class) {
+            break;
+        } else if (ch == "\\") {
+            prev_backslash = true;
+        } else {
+            source += ch;
+        }
+        const flags = read_name();
+        return token("regexp", "/" + source + "/" + flags);
+    });
+
+    function read_operator(prefix) {
+        function grow(op) {
+            if (!peek()) return op;
+            var bigger = op + peek();
+            if (OPERATORS.has(bigger)) {
+                next();
+                return grow(bigger);
+            } else {
+                return op;
+            }
+        }
+        return token("operator", grow(prefix || next()));
+    }
+
+    function handle_slash() {
+        next();
+        switch (peek()) {
+          case "/":
+            next();
+            return skip_line_comment("comment1");
+          case "*":
+            next();
+            return skip_multiline_comment();
+        }
+        return S.regex_allowed ? read_regexp("") : read_operator("/");
+    }
+
+    function handle_eq_sign() {
+        next();
+        if (peek() === ">") {
+            next();
+            return token("arrow", "=>");
+        } else {
+            return read_operator("=");
+        }
+    }
+
+    function handle_dot() {
+        next();
+        if (is_digit(peek().charCodeAt(0))) {
+            return read_num(".");
+        }
+        if (peek() === ".") {
+            next();  // Consume second dot
+            next();  // Consume third dot
+            return token("expand", "...");
+        }
+
+        return token("punc", ".");
+    }
+
+    function read_word() {
+        var word = read_name();
+        if (prev_was_dot) return token("name", word);
+        return KEYWORDS_ATOM.has(word) ? token("atom", word)
+            : !KEYWORDS.has(word) ? token("name", word)
+            : OPERATORS.has(word) ? token("operator", word)
+            : token("keyword", word);
+    }
+
+    function read_private_word() {
+        next();
+        return token("privatename", read_name());
+    }
+
+    function with_eof_error(eof_error, cont) {
+        return function(x) {
+            try {
+                return cont(x);
+            } catch(ex) {
+                if (ex === EX_EOF) parse_error(eof_error);
+                else throw ex;
+            }
+        };
+    }
+
+    function next_token(force_regexp) {
+        if (force_regexp != null)
+            return read_regexp(force_regexp);
+        if (shebang && S.pos == 0 && looking_at("#!")) {
+            start_token();
+            forward(2);
+            skip_line_comment("comment5");
+        }
+        for (;;) {
+            skip_whitespace();
+            start_token();
+            if (html5_comments) {
+                if (looking_at("<!--")) {
+                    forward(4);
+                    skip_line_comment("comment3");
+                    continue;
+                }
+                if (looking_at("-->") && S.newline_before) {
+                    forward(3);
+                    skip_line_comment("comment4");
+                    continue;
+                }
+            }
+            var ch = peek();
+            if (!ch) return token("eof");
+            var code = ch.charCodeAt(0);
+            switch (code) {
+              case 34: case 39: return read_string();
+              case 46: return handle_dot();
+              case 47: {
+                  var tok = handle_slash();
+                  if (tok === next_token) continue;
+                  return tok;
+              }
+              case 61: return handle_eq_sign();
+              case 63: {
+                  if (!is_option_chain_op()) break;  // Handled below
+
+                  next(); // ?
+                  next(); // .
+
+                  return token("punc", "?.");
+              }
+              case 96: return read_template_characters(true);
+              case 123:
+                S.brace_counter++;
+                break;
+              case 125:
+                S.brace_counter--;
+                if (S.template_braces.length > 0
+                    && S.template_braces[S.template_braces.length - 1] === S.brace_counter)
+                    return read_template_characters(false);
+                break;
+            }
+            if (is_digit(code)) return read_num();
+            if (PUNC_CHARS.has(ch)) return token("punc", next());
+            if (OPERATOR_CHARS.has(ch)) return read_operator();
+            if (code == 92 || is_identifier_start(ch)) return read_word();
+            if (code == 35) return read_private_word();
+            break;
+        }
+        parse_error("Unexpected character '" + ch + "'");
+    }
+
+    next_token.next = next;
+    next_token.peek = peek;
+
+    next_token.context = function(nc) {
+        if (nc) S = nc;
+        return S;
+    };
+
+    next_token.add_directive = function(directive) {
+        S.directive_stack[S.directive_stack.length - 1].push(directive);
+
+        if (S.directives[directive] === undefined) {
+            S.directives[directive] = 1;
+        } else {
+            S.directives[directive]++;
+        }
+    };
+
+    next_token.push_directives_stack = function() {
+        S.directive_stack.push([]);
+    };
+
+    next_token.pop_directives_stack = function() {
+        var directives = S.directive_stack[S.directive_stack.length - 1];
+
+        for (var i = 0; i < directives.length; i++) {
+            S.directives[directives[i]]--;
+        }
+
+        S.directive_stack.pop();
+    };
+
+    next_token.has_directive = function(directive) {
+        return S.directives[directive] > 0;
+    };
+
+    return next_token;
+
+}
+
+/* -----[ Parser (constants) ]----- */
+
+var UNARY_PREFIX = makePredicate([
+    "typeof",
+    "void",
+    "delete",
+    "--",
+    "++",
+    "!",
+    "~",
+    "-",
+    "+"
+]);
+
+var UNARY_POSTFIX = makePredicate([ "--", "++" ]);
+
+var ASSIGNMENT = makePredicate([ "=", "+=", "-=", "??=", "&&=", "||=", "/=", "*=", "**=", "%=", ">>=", "<<=", ">>>=", "|=", "^=", "&=" ]);
+
+var LOGICAL_ASSIGNMENT = makePredicate([ "??=", "&&=", "||=" ]);
+
+var PRECEDENCE = (function(a, ret) {
+    for (var i = 0; i < a.length; ++i) {
+        var b = a[i];
+        for (var j = 0; j < b.length; ++j) {
+            ret[b[j]] = i + 1;
+        }
+    }
+    return ret;
+})(
+    [
+        ["||"],
+        ["??"],
+        ["&&"],
+        ["|"],
+        ["^"],
+        ["&"],
+        ["==", "===", "!=", "!=="],
+        ["<", ">", "<=", ">=", "in", "instanceof"],
+        [">>", "<<", ">>>"],
+        ["+", "-"],
+        ["*", "/", "%"],
+        ["**"]
+    ],
+    {}
+);
+
+var ATOMIC_START_TOKEN = makePredicate([ "atom", "num", "big_int", "string", "regexp", "name" ]);
+
+/* -----[ Parser ]----- */
+
+function parse($TEXT, options) {
+    // maps start tokens to count of comments found outside of their parens
+    // Example: /* I count */ ( /* I don't */ foo() )
+    // Useful because comments_before property of call with parens outside
+    // contains both comments inside and outside these parens. Used to find the
+    
+    const outer_comments_before_counts = new WeakMap();
+
+    options = defaults(options, {
+        bare_returns   : false,
+        ecma           : null,  // Legacy
+        expression     : false,
+        filename       : null,
+        html5_comments : true,
+        module         : false,
+        shebang        : true,
+        strict         : false,
+        toplevel       : null,
+    }, true);
+
+    var S = {
+        input         : (typeof $TEXT == "string"
+                         ? tokenizer($TEXT, options.filename,
+                                     options.html5_comments, options.shebang)
+                         : $TEXT),
+        token         : null,
+        prev          : null,
+        peeked        : null,
+        in_function   : 0,
+        in_async      : -1,
+        in_generator  : -1,
+        in_directives : true,
+        in_loop       : 0,
+        labels        : []
+    };
+
+    S.token = next();
+
+    function is(type, value) {
+        return is_token(S.token, type, value);
+    }
+
+    function peek() { return S.peeked || (S.peeked = S.input()); }
+
+    function next() {
+        S.prev = S.token;
+
+        if (!S.peeked) peek();
+        S.token = S.peeked;
+        S.peeked = null;
+        S.in_directives = S.in_directives && (
+            S.token.type == "string" || is("punc", ";")
+        );
+        return S.token;
+    }
+
+    function prev() {
+        return S.prev;
+    }
+
+    function croak(msg, line, col, pos) {
+        var ctx = S.input.context();
+        js_error(msg,
+                 ctx.filename,
+                 line != null ? line : ctx.tokline,
+                 col != null ? col : ctx.tokcol,
+                 pos != null ? pos : ctx.tokpos);
+    }
+
+    function token_error(token, msg) {
+        croak(msg, token.line, token.col);
+    }
+
+    function unexpected(token) {
+        if (token == null)
+            token = S.token;
+        token_error(token, "Unexpected token: " + token.type + " (" + token.value + ")");
+    }
+
+    function expect_token(type, val) {
+        if (is(type, val)) {
+            return next();
+        }
+        token_error(S.token, "Unexpected token " + S.token.type + " «" + S.token.value + "»" + ", expected " + type + " «" + val + "»");
+    }
+
+    function expect(punc) { return expect_token("punc", punc); }
+
+    function has_newline_before(token) {
+        return token.nlb || !token.comments_before.every((comment) => !comment.nlb);
+    }
+
+    function can_insert_semicolon() {
+        return !options.strict
+            && (is("eof") || is("punc", "}") || has_newline_before(S.token));
+    }
+
+    function is_in_generator() {
+        return S.in_generator === S.in_function;
+    }
+
+    function is_in_async() {
+        return S.in_async === S.in_function;
+    }
+
+    function can_await() {
+        return (
+            S.in_async === S.in_function
+            || S.in_function === 0 && S.input.has_directive("use strict")
+        );
+    }
+
+    function semicolon(optional) {
+        if (is("punc", ";")) next();
+        else if (!optional && !can_insert_semicolon()) unexpected();
+    }
+
+    function parenthesised() {
+        expect("(");
+        var exp = expression(true);
+        expect(")");
+        return exp;
+    }
+
+    function embed_tokens(parser) {
+        return function _embed_tokens_wrapper(...args) {
+            const start = S.token;
+            const expr = parser(...args);
+            expr.start = start;
+            expr.end = prev();
+            return expr;
+        };
+    }
+
+    function handle_regexp() {
+        if (is("operator", "/") || is("operator", "/=")) {
+            S.peeked = null;
+            S.token = S.input(S.token.value.substr(1)); // force regexp
+        }
+    }
+
+    var statement = embed_tokens(function statement(is_export_default, is_for_body, is_if_body) {
+        handle_regexp();
+        switch (S.token.type) {
+          case "string":
+            if (S.in_directives) {
+                var token = peek();
+                if (!LATEST_RAW.includes("\\")
+                    && (is_token(token, "punc", ";")
+                        || is_token(token, "punc", "}")
+                        || has_newline_before(token)
+                        || is_token(token, "eof"))) {
+                    S.input.add_directive(S.token.value);
+                } else {
+                    S.in_directives = false;
+                }
+            }
+            var dir = S.in_directives, stat = simple_statement();
+            return dir && stat.body instanceof AST_String ? new AST_Directive(stat.body) : stat;
+          case "template_head":
+          case "num":
+          case "big_int":
+          case "regexp":
+          case "operator":
+          case "atom":
+            return simple_statement();
+
+          case "name":
+            if (S.token.value == "async" && is_token(peek(), "keyword", "function")) {
+                next();
+                next();
+                if (is_for_body) {
+                    croak("functions are not allowed as the body of a loop");
+                }
+                return function_(AST_Defun, false, true, is_export_default);
+            }
+            if (S.token.value == "import" && !is_token(peek(), "punc", "(") && !is_token(peek(), "punc", ".")) {
+                next();
+                var node = import_statement();
+                semicolon();
+                return node;
+            }
+            return is_token(peek(), "punc", ":")
+                ? labeled_statement()
+                : simple_statement();
+
+          case "punc":
+            switch (S.token.value) {
+              case "{":
+                return new AST_BlockStatement({
+                    start : S.token,
+                    body  : block_(),
+                    end   : prev()
+                });
+              case "[":
+              case "(":
+                return simple_statement();
+              case ";":
+                S.in_directives = false;
+                next();
+                return new AST_EmptyStatement();
+              default:
+                unexpected();
+            }
+
+          case "keyword":
+            switch (S.token.value) {
+              case "break":
+                next();
+                return break_cont(AST_Break);
+
+              case "continue":
+                next();
+                return break_cont(AST_Continue);
+
+              case "debugger":
+                next();
+                semicolon();
+                return new AST_Debugger();
+
+              case "do":
+                next();
+                var body = in_loop(statement);
+                expect_token("keyword", "while");
+                var condition = parenthesised();
+                semicolon(true);
+                return new AST_Do({
+                    body      : body,
+                    condition : condition
+                });
+
+              case "while":
+                next();
+                return new AST_While({
+                    condition : parenthesised(),
+                    body      : in_loop(function() { return statement(false, true); })
+                });
+
+              case "for":
+                next();
+                return for_();
+
+              case "class":
+                next();
+                if (is_for_body) {
+                    croak("classes are not allowed as the body of a loop");
+                }
+                if (is_if_body) {
+                    croak("classes are not allowed as the body of an if");
+                }
+                return class_(AST_DefClass, is_export_default);
+
+              case "function":
+                next();
+                if (is_for_body) {
+                    croak("functions are not allowed as the body of a loop");
+                }
+                return function_(AST_Defun, false, false, is_export_default);
+
+              case "if":
+                next();
+                return if_();
+
+              case "return":
+                if (S.in_function == 0 && !options.bare_returns)
+                    croak("'return' outside of function");
+                next();
+                var value = null;
+                if (is("punc", ";")) {
+                    next();
+                } else if (!can_insert_semicolon()) {
+                    value = expression(true);
+                    semicolon();
+                }
+                return new AST_Return({
+                    value: value
+                });
+
+              case "switch":
+                next();
+                return new AST_Switch({
+                    expression : parenthesised(),
+                    body       : in_loop(switch_body_)
+                });
+
+              case "throw":
+                next();
+                if (has_newline_before(S.token))
+                    croak("Illegal newline after 'throw'");
+                var value = expression(true);
+                semicolon();
+                return new AST_Throw({
+                    value: value
+                });
+
+              case "try":
+                next();
+                return try_();
+
+              case "var":
+                next();
+                var node = var_();
+                semicolon();
+                return node;
+
+              case "let":
+                next();
+                var node = let_();
+                semicolon();
+                return node;
+
+              case "const":
+                next();
+                var node = const_();
+                semicolon();
+                return node;
+
+              case "with":
+                if (S.input.has_directive("use strict")) {
+                    croak("Strict mode may not include a with statement");
+                }
+                next();
+                return new AST_With({
+                    expression : parenthesised(),
+                    body       : statement()
+                });
+
+              case "export":
+                if (!is_token(peek(), "punc", "(")) {
+                    next();
+                    var node = export_statement();
+                    if (is("punc", ";")) semicolon();
+                    return node;
+                }
+            }
+        }
+        unexpected();
+    });
+
+    function labeled_statement() {
+        var label = as_symbol(AST_Label);
+        if (label.name === "await" && is_in_async()) {
+            token_error(S.prev, "await cannot be used as label inside async function");
+        }
+        if (S.labels.some((l) => l.name === label.name)) {
+            // ECMA-262, 12.12: An ECMAScript program is considered
+            // syntactically incorrect if it contains a
+            // LabelledStatement that is enclosed by a
+            // LabelledStatement with the same Identifier as label.
+            croak("Label " + label.name + " defined twice");
+        }
+        expect(":");
+        S.labels.push(label);
+        var stat = statement();
+        S.labels.pop();
+        if (!(stat instanceof AST_IterationStatement)) {
+            // check for `continue` that refers to this label.
+            // those should be reported as syntax errors.
+            // https://github.com/mishoo/UglifyJS2/issues/287
+            label.references.forEach(function(ref) {
+                if (ref instanceof AST_Continue) {
+                    ref = ref.label.start;
+                    croak("Continue label `" + label.name + "` refers to non-IterationStatement.",
+                          ref.line, ref.col, ref.pos);
+                }
+            });
+        }
+        return new AST_LabeledStatement({ body: stat, label: label });
+    }
+
+    function simple_statement(tmp) {
+        return new AST_SimpleStatement({ body: (tmp = expression(true), semicolon(), tmp) });
+    }
+
+    function break_cont(type) {
+        var label = null, ldef;
+        if (!can_insert_semicolon()) {
+            label = as_symbol(AST_LabelRef, true);
+        }
+        if (label != null) {
+            ldef = S.labels.find((l) => l.name === label.name);
+            if (!ldef)
+                croak("Undefined label " + label.name);
+            label.thedef = ldef;
+        } else if (S.in_loop == 0)
+            croak(type.TYPE + " not inside a loop or switch");
+        semicolon();
+        var stat = new type({ label: label });
+        if (ldef) ldef.references.push(stat);
+        return stat;
+    }
+
+    function for_() {
+        var for_await_error = "`for await` invalid in this context";
+        var await_tok = S.token;
+        if (await_tok.type == "name" && await_tok.value == "await") {
+            if (!can_await()) {
+                token_error(await_tok, for_await_error);
+            }
+            next();
+        } else {
+            await_tok = false;
+        }
+        expect("(");
+        var init = null;
+        if (!is("punc", ";")) {
+            init =
+                is("keyword", "var") ? (next(), var_(true)) :
+                is("keyword", "let") ? (next(), let_(true)) :
+                is("keyword", "const") ? (next(), const_(true)) :
+                                       expression(true, true);
+            var is_in = is("operator", "in");
+            var is_of = is("name", "of");
+            if (await_tok && !is_of) {
+                token_error(await_tok, for_await_error);
+            }
+            if (is_in || is_of) {
+                if (init instanceof AST_Definitions) {
+                    if (init.definitions.length > 1)
+                        token_error(init.start, "Only one variable declaration allowed in for..in loop");
+                } else if (!(is_assignable(init) || (init = to_destructuring(init)) instanceof AST_Destructuring)) {
+                    token_error(init.start, "Invalid left-hand side in for..in loop");
+                }
+                next();
+                if (is_in) {
+                    return for_in(init);
+                } else {
+                    return for_of(init, !!await_tok);
+                }
+            }
+        } else if (await_tok) {
+            token_error(await_tok, for_await_error);
+        }
+        return regular_for(init);
+    }
+
+    function regular_for(init) {
+        expect(";");
+        var test = is("punc", ";") ? null : expression(true);
+        expect(";");
+        var step = is("punc", ")") ? null : expression(true);
+        expect(")");
+        return new AST_For({
+            init      : init,
+            condition : test,
+            step      : step,
+            body      : in_loop(function() { return statement(false, true); })
+        });
+    }
+
+    function for_of(init, is_await) {
+        var lhs = init instanceof AST_Definitions ? init.definitions[0].name : null;
+        var obj = expression(true);
+        expect(")");
+        return new AST_ForOf({
+            await  : is_await,
+            init   : init,
+            name   : lhs,
+            object : obj,
+            body   : in_loop(function() { return statement(false, true); })
+        });
+    }
+
+    function for_in(init) {
+        var obj = expression(true);
+        expect(")");
+        return new AST_ForIn({
+            init   : init,
+            object : obj,
+            body   : in_loop(function() { return statement(false, true); })
+        });
+    }
+
+    var arrow_function = function(start, argnames, is_async) {
+        if (has_newline_before(S.token)) {
+            croak("Unexpected newline before arrow (=>)");
+        }
+
+        expect_token("arrow", "=>");
+
+        var body = _function_body(is("punc", "{"), false, is_async);
+
+        var end =
+            body instanceof Array && body.length ? body[body.length - 1].end :
+            body instanceof Array ? start :
+                body.end;
+
+        return new AST_Arrow({
+            start    : start,
+            end      : end,
+            async    : is_async,
+            argnames : argnames,
+            body     : body
+        });
+    };
+
+    var function_ = function(ctor, is_generator_property, is_async, is_export_default) {
+        var in_statement = ctor === AST_Defun;
+        var is_generator = is("operator", "*");
+        if (is_generator) {
+            next();
+        }
+
+        var name = is("name") ? as_symbol(in_statement ? AST_SymbolDefun : AST_SymbolLambda) : null;
+        if (in_statement && !name) {
+            if (is_export_default) {
+                ctor = AST_Function;
+            } else {
+                unexpected();
+            }
+        }
+
+        if (name && ctor !== AST_Accessor && !(name instanceof AST_SymbolDeclaration))
+            unexpected(prev());
+
+        var args = [];
+        var body = _function_body(true, is_generator || is_generator_property, is_async, name, args);
+        return new ctor({
+            start : args.start,
+            end   : body.end,
+            is_generator: is_generator,
+            async : is_async,
+            name  : name,
+            argnames: args,
+            body  : body
+        });
+    };
+
+    function track_used_binding_identifiers(is_parameter, strict) {
+        var parameters = new Set();
+        var duplicate = false;
+        var default_assignment = false;
+        var spread = false;
+        var strict_mode = !!strict;
+        var tracker = {
+            add_parameter: function(token) {
+                if (parameters.has(token.value)) {
+                    if (duplicate === false) {
+                        duplicate = token;
+                    }
+                    tracker.check_strict();
+                } else {
+                    parameters.add(token.value);
+                    if (is_parameter) {
+                        switch (token.value) {
+                          case "arguments":
+                          case "eval":
+                          case "yield":
+                            if (strict_mode) {
+                                token_error(token, "Unexpected " + token.value + " identifier as parameter inside strict mode");
+                            }
+                            break;
+                          default:
+                            if (RESERVED_WORDS.has(token.value)) {
+                                unexpected();
+                            }
+                        }
+                    }
+                }
+            },
+            mark_default_assignment: function(token) {
+                if (default_assignment === false) {
+                    default_assignment = token;
+                }
+            },
+            mark_spread: function(token) {
+                if (spread === false) {
+                    spread = token;
+                }
+            },
+            mark_strict_mode: function() {
+                strict_mode = true;
+            },
+            is_strict: function() {
+                return default_assignment !== false || spread !== false || strict_mode;
+            },
+            check_strict: function() {
+                if (tracker.is_strict() && duplicate !== false) {
+                    token_error(duplicate, "Parameter " + duplicate.value + " was used already");
+                }
+            }
+        };
+
+        return tracker;
+    }
+
+    function parameters(params) {
+        var used_parameters = track_used_binding_identifiers(true, S.input.has_directive("use strict"));
+
+        expect("(");
+
+        while (!is("punc", ")")) {
+            var param = parameter(used_parameters);
+            params.push(param);
+
+            if (!is("punc", ")")) {
+                expect(",");
+            }
+
+            if (param instanceof AST_Expansion) {
+                break;
+            }
+        }
+
+        next();
+    }
+
+    function parameter(used_parameters, symbol_type) {
+        var param;
+        var expand = false;
+        if (used_parameters === undefined) {
+            used_parameters = track_used_binding_identifiers(true, S.input.has_directive("use strict"));
+        }
+        if (is("expand", "...")) {
+            expand = S.token;
+            used_parameters.mark_spread(S.token);
+            next();
+        }
+        param = binding_element(used_parameters, symbol_type);
+
+        if (is("operator", "=") && expand === false) {
+            used_parameters.mark_default_assignment(S.token);
+            next();
+            param = new AST_DefaultAssign({
+                start: param.start,
+                left: param,
+                operator: "=",
+                right: expression(false),
+                end: S.token
+            });
+        }
+
+        if (expand !== false) {
+            if (!is("punc", ")")) {
+                unexpected();
+            }
+            param = new AST_Expansion({
+                start: expand,
+                expression: param,
+                end: expand
+            });
+        }
+        used_parameters.check_strict();
+
+        return param;
+    }
+
+    function binding_element(used_parameters, symbol_type) {
+        var elements = [];
+        var first = true;
+        var is_expand = false;
+        var expand_token;
+        var first_token = S.token;
+        if (used_parameters === undefined) {
+            used_parameters = track_used_binding_identifiers(false, S.input.has_directive("use strict"));
+        }
+        symbol_type = symbol_type === undefined ? AST_SymbolFunarg : symbol_type;
+        if (is("punc", "[")) {
+            next();
+            while (!is("punc", "]")) {
+                if (first) {
+                    first = false;
+                } else {
+                    expect(",");
+                }
+
+                if (is("expand", "...")) {
+                    is_expand = true;
+                    expand_token = S.token;
+                    used_parameters.mark_spread(S.token);
+                    next();
+                }
+                if (is("punc")) {
+                    switch (S.token.value) {
+                      case ",":
+                        elements.push(new AST_Hole({
+                            start: S.token,
+                            end: S.token
+                        }));
+                        continue;
+                      case "]": // Trailing comma after last element
+                        break;
+                      case "[":
+                      case "{":
+                        elements.push(binding_element(used_parameters, symbol_type));
+                        break;
+                      default:
+                        unexpected();
+                    }
+                } else if (is("name")) {
+                    used_parameters.add_parameter(S.token);
+                    elements.push(as_symbol(symbol_type));
+                } else {
+                    croak("Invalid function parameter");
+                }
+                if (is("operator", "=") && is_expand === false) {
+                    used_parameters.mark_default_assignment(S.token);
+                    next();
+                    elements[elements.length - 1] = new AST_DefaultAssign({
+                        start: elements[elements.length - 1].start,
+                        left: elements[elements.length - 1],
+                        operator: "=",
+                        right: expression(false),
+                        end: S.token
+                    });
+                }
+                if (is_expand) {
+                    if (!is("punc", "]")) {
+                        croak("Rest element must be last element");
+                    }
+                    elements[elements.length - 1] = new AST_Expansion({
+                        start: expand_token,
+                        expression: elements[elements.length - 1],
+                        end: expand_token
+                    });
+                }
+            }
+            expect("]");
+            used_parameters.check_strict();
+            return new AST_Destructuring({
+                start: first_token,
+                names: elements,
+                is_array: true,
+                end: prev()
+            });
+        } else if (is("punc", "{")) {
+            next();
+            while (!is("punc", "}")) {
+                if (first) {
+                    first = false;
+                } else {
+                    expect(",");
+                }
+                if (is("expand", "...")) {
+                    is_expand = true;
+                    expand_token = S.token;
+                    used_parameters.mark_spread(S.token);
+                    next();
+                }
+                if (is("name") && (is_token(peek(), "punc") || is_token(peek(), "operator")) && [",", "}", "="].includes(peek().value)) {
+                    used_parameters.add_parameter(S.token);
+                    var start = prev();
+                    var value = as_symbol(symbol_type);
+                    if (is_expand) {
+                        elements.push(new AST_Expansion({
+                            start: expand_token,
+                            expression: value,
+                            end: value.end,
+                        }));
+                    } else {
+                        elements.push(new AST_ObjectKeyVal({
+                            start: start,
+                            key: value.name,
+                            value: value,
+                            end: value.end,
+                        }));
+                    }
+                } else if (is("punc", "}")) {
+                    continue; // Allow trailing hole
+                } else {
+                    var property_token = S.token;
+                    var property = as_property_name();
+                    if (property === null) {
+                        unexpected(prev());
+                    } else if (prev().type === "name" && !is("punc", ":")) {
+                        elements.push(new AST_ObjectKeyVal({
+                            start: prev(),
+                            key: property,
+                            value: new symbol_type({
+                                start: prev(),
+                                name: property,
+                                end: prev()
+                            }),
+                            end: prev()
+                        }));
+                    } else {
+                        expect(":");
+                        elements.push(new AST_ObjectKeyVal({
+                            start: property_token,
+                            quote: property_token.quote,
+                            key: property,
+                            value: binding_element(used_parameters, symbol_type),
+                            end: prev()
+                        }));
+                    }
+                }
+                if (is_expand) {
+                    if (!is("punc", "}")) {
+                        croak("Rest element must be last element");
+                    }
+                } else if (is("operator", "=")) {
+                    used_parameters.mark_default_assignment(S.token);
+                    next();
+                    elements[elements.length - 1].value = new AST_DefaultAssign({
+                        start: elements[elements.length - 1].value.start,
+                        left: elements[elements.length - 1].value,
+                        operator: "=",
+                        right: expression(false),
+                        end: S.token
+                    });
+                }
+            }
+            expect("}");
+            used_parameters.check_strict();
+            return new AST_Destructuring({
+                start: first_token,
+                names: elements,
+                is_array: false,
+                end: prev()
+            });
+        } else if (is("name")) {
+            used_parameters.add_parameter(S.token);
+            return as_symbol(symbol_type);
+        } else {
+            croak("Invalid function parameter");
+        }
+    }
+
+    function params_or_seq_(allow_arrows, maybe_sequence) {
+        var spread_token;
+        var invalid_sequence;
+        var trailing_comma;
+        var a = [];
+        expect("(");
+        while (!is("punc", ")")) {
+            if (spread_token) unexpected(spread_token);
+            if (is("expand", "...")) {
+                spread_token = S.token;
+                if (maybe_sequence) invalid_sequence = S.token;
+                next();
+                a.push(new AST_Expansion({
+                    start: prev(),
+                    expression: expression(),
+                    end: S.token,
+                }));
+            } else {
+                a.push(expression());
+            }
+            if (!is("punc", ")")) {
+                expect(",");
+                if (is("punc", ")")) {
+                    trailing_comma = prev();
+                    if (maybe_sequence) invalid_sequence = trailing_comma;
+                }
+            }
+        }
+        expect(")");
+        if (allow_arrows && is("arrow", "=>")) {
+            if (spread_token && trailing_comma) unexpected(trailing_comma);
+        } else if (invalid_sequence) {
+            unexpected(invalid_sequence);
+        }
+        return a;
+    }
+
+    function _function_body(block, generator, is_async, name, args) {
+        var loop = S.in_loop;
+        var labels = S.labels;
+        var current_generator = S.in_generator;
+        var current_async = S.in_async;
+        ++S.in_function;
+        if (generator)
+            S.in_generator = S.in_function;
+        if (is_async)
+            S.in_async = S.in_function;
+        if (args) parameters(args);
+        if (block)
+            S.in_directives = true;
+        S.in_loop = 0;
+        S.labels = [];
+        if (block) {
+            S.input.push_directives_stack();
+            var a = block_();
+            if (name) _verify_symbol(name);
+            if (args) args.forEach(_verify_symbol);
+            S.input.pop_directives_stack();
+        } else {
+            var a = [new AST_Return({
+                start: S.token,
+                value: expression(false),
+                end: S.token
+            })];
+        }
+        --S.in_function;
+        S.in_loop = loop;
+        S.labels = labels;
+        S.in_generator = current_generator;
+        S.in_async = current_async;
+        return a;
+    }
+
+    function _await_expression() {
+        // Previous token must be "await" and not be interpreted as an identifier
+        if (!can_await()) {
+            croak("Unexpected await expression outside async function",
+                S.prev.line, S.prev.col, S.prev.pos);
+        }
+        // the await expression is parsed as a unary expression in Babel
+        return new AST_Await({
+            start: prev(),
+            end: S.token,
+            expression : maybe_unary(true),
+        });
+    }
+
+    function _yield_expression() {
+        // Previous token must be keyword yield and not be interpret as an identifier
+        if (!is_in_generator()) {
+            croak("Unexpected yield expression outside generator function",
+                S.prev.line, S.prev.col, S.prev.pos);
+        }
+        var start = S.token;
+        var star = false;
+        var has_expression = true;
+
+        // Attempt to get expression or star (and then the mandatory expression)
+        // behind yield on the same line.
+        //
+        // If nothing follows on the same line of the yieldExpression,
+        // it should default to the value `undefined` for yield to return.
+        // In that case, the `undefined` stored as `null` in ast.
+        //
+        // Note 1: It isn't allowed for yield* to close without an expression
+        // Note 2: If there is a nlb between yield and star, it is interpret as
+        //         yield <explicit undefined> <inserted automatic semicolon> *
+        if (can_insert_semicolon() ||
+            (is("punc") && PUNC_AFTER_EXPRESSION.has(S.token.value))) {
+            has_expression = false;
+
+        } else if (is("operator", "*")) {
+            star = true;
+            next();
+        }
+
+        return new AST_Yield({
+            start      : start,
+            is_star    : star,
+            expression : has_expression ? expression() : null,
+            end        : prev()
+        });
+    }
+
+    function if_() {
+        var cond = parenthesised(), body = statement(false, false, true), belse = null;
+        if (is("keyword", "else")) {
+            next();
+            belse = statement(false, false, true);
+        }
+        return new AST_If({
+            condition   : cond,
+            body        : body,
+            alternative : belse
+        });
+    }
+
+    function block_() {
+        expect("{");
+        var a = [];
+        while (!is("punc", "}")) {
+            if (is("eof")) unexpected();
+            a.push(statement());
+        }
+        next();
+        return a;
+    }
+
+    function switch_body_() {
+        expect("{");
+        var a = [], cur = null, branch = null, tmp;
+        while (!is("punc", "}")) {
+            if (is("eof")) unexpected();
+            if (is("keyword", "case")) {
+                if (branch) branch.end = prev();
+                cur = [];
+                branch = new AST_Case({
+                    start      : (tmp = S.token, next(), tmp),
+                    expression : expression(true),
+                    body       : cur
+                });
+                a.push(branch);
+                expect(":");
+            } else if (is("keyword", "default")) {
+                if (branch) branch.end = prev();
+                cur = [];
+                branch = new AST_Default({
+                    start : (tmp = S.token, next(), expect(":"), tmp),
+                    body  : cur
+                });
+                a.push(branch);
+            } else {
+                if (!cur) unexpected();
+                cur.push(statement());
+            }
+        }
+        if (branch) branch.end = prev();
+        next();
+        return a;
+    }
+
+    function try_() {
+        var body = block_(), bcatch = null, bfinally = null;
+        if (is("keyword", "catch")) {
+            var start = S.token;
+            next();
+            if (is("punc", "{")) {
+                var name = null;
+            } else {
+                expect("(");
+                var name = parameter(undefined, AST_SymbolCatch);
+                expect(")");
+            }
+            bcatch = new AST_Catch({
+                start   : start,
+                argname : name,
+                body    : block_(),
+                end     : prev()
+            });
+        }
+        if (is("keyword", "finally")) {
+            var start = S.token;
+            next();
+            bfinally = new AST_Finally({
+                start : start,
+                body  : block_(),
+                end   : prev()
+            });
+        }
+        if (!bcatch && !bfinally)
+            croak("Missing catch/finally blocks");
+        return new AST_Try({
+            body     : body,
+            bcatch   : bcatch,
+            bfinally : bfinally
+        });
+    }
+
+    function vardefs(no_in, kind) {
+        var a = [];
+        var def;
+        for (;;) {
+            var sym_type =
+                kind === "var" ? AST_SymbolVar :
+                kind === "const" ? AST_SymbolConst :
+                kind === "let" ? AST_SymbolLet : null;
+            if (is("punc", "{") || is("punc", "[")) {
+                def = new AST_VarDef({
+                    start: S.token,
+                    name: binding_element(undefined ,sym_type),
+                    value: is("operator", "=") ? (expect_token("operator", "="), expression(false, no_in)) : null,
+                    end: prev()
+                });
+            } else {
+                def = new AST_VarDef({
+                    start : S.token,
+                    name  : as_symbol(sym_type),
+                    value : is("operator", "=")
+                        ? (next(), expression(false, no_in))
+                        : !no_in && kind === "const"
+                            ? croak("Missing initializer in const declaration") : null,
+                    end   : prev()
+                });
+                if (def.name.name == "import") croak("Unexpected token: import");
+            }
+            a.push(def);
+            if (!is("punc", ","))
+                break;
+            next();
+        }
+        return a;
+    }
+
+    var var_ = function(no_in) {
+        return new AST_Var({
+            start       : prev(),
+            definitions : vardefs(no_in, "var"),
+            end         : prev()
+        });
+    };
+
+    var let_ = function(no_in) {
+        return new AST_Let({
+            start       : prev(),
+            definitions : vardefs(no_in, "let"),
+            end         : prev()
+        });
+    };
+
+    var const_ = function(no_in) {
+        return new AST_Const({
+            start       : prev(),
+            definitions : vardefs(no_in, "const"),
+            end         : prev()
+        });
+    };
+
+    var new_ = function(allow_calls) {
+        var start = S.token;
+        expect_token("operator", "new");
+        if (is("punc", ".")) {
+            next();
+            expect_token("name", "target");
+            return subscripts(new AST_NewTarget({
+                start : start,
+                end   : prev()
+            }), allow_calls);
+        }
+        var newexp = expr_atom(false), args;
+        if (is("punc", "(")) {
+            next();
+            args = expr_list(")", true);
+        } else {
+            args = [];
+        }
+        var call = new AST_New({
+            start      : start,
+            expression : newexp,
+            args       : args,
+            end        : prev()
+        });
+        annotate(call);
+        return subscripts(call, allow_calls);
+    };
+
+    function as_atom_node() {
+        var tok = S.token, ret;
+        switch (tok.type) {
+          case "name":
+            ret = _make_symbol(AST_SymbolRef);
+            break;
+          case "num":
+            ret = new AST_Number({
+                start: tok,
+                end: tok,
+                value: tok.value,
+                raw: LATEST_RAW
+            });
+            break;
+          case "big_int":
+            ret = new AST_BigInt({ start: tok, end: tok, value: tok.value });
+            break;
+          case "string":
+            ret = new AST_String({
+                start : tok,
+                end   : tok,
+                value : tok.value,
+                quote : tok.quote
+            });
+            break;
+          case "regexp":
+            const [_, source, flags] = tok.value.match(/^\/(.*)\/(\w*)$/);
+
+            ret = new AST_RegExp({ start: tok, end: tok, value: { source, flags } });
+            break;
+          case "atom":
+            switch (tok.value) {
+              case "false":
+                ret = new AST_False({ start: tok, end: tok });
+                break;
+              case "true":
+                ret = new AST_True({ start: tok, end: tok });
+                break;
+              case "null":
+                ret = new AST_Null({ start: tok, end: tok });
+                break;
+            }
+            break;
+        }
+        next();
+        return ret;
+    }
+
+    function to_fun_args(ex, default_seen_above) {
+        var insert_default = function(ex, default_value) {
+            if (default_value) {
+                return new AST_DefaultAssign({
+                    start: ex.start,
+                    left: ex,
+                    operator: "=",
+                    right: default_value,
+                    end: default_value.end
+                });
+            }
+            return ex;
+        };
+        if (ex instanceof AST_Object) {
+            return insert_default(new AST_Destructuring({
+                start: ex.start,
+                end: ex.end,
+                is_array: false,
+                names: ex.properties.map(prop => to_fun_args(prop))
+            }), default_seen_above);
+        } else if (ex instanceof AST_ObjectKeyVal) {
+            ex.value = to_fun_args(ex.value);
+            return insert_default(ex, default_seen_above);
+        } else if (ex instanceof AST_Hole) {
+            return ex;
+        } else if (ex instanceof AST_Destructuring) {
+            ex.names = ex.names.map(name => to_fun_args(name));
+            return insert_default(ex, default_seen_above);
+        } else if (ex instanceof AST_SymbolRef) {
+            return insert_default(new AST_SymbolFunarg({
+                name: ex.name,
+                start: ex.start,
+                end: ex.end
+            }), default_seen_above);
+        } else if (ex instanceof AST_Expansion) {
+            ex.expression = to_fun_args(ex.expression);
+            return insert_default(ex, default_seen_above);
+        } else if (ex instanceof AST_Array) {
+            return insert_default(new AST_Destructuring({
+                start: ex.start,
+                end: ex.end,
+                is_array: true,
+                names: ex.elements.map(elm => to_fun_args(elm))
+            }), default_seen_above);
+        } else if (ex instanceof AST_Assign) {
+            return insert_default(to_fun_args(ex.left, ex.right), default_seen_above);
+        } else if (ex instanceof AST_DefaultAssign) {
+            ex.left = to_fun_args(ex.left);
+            return ex;
+        } else {
+            croak("Invalid function parameter", ex.start.line, ex.start.col);
+        }
+    }
+
+    var expr_atom = function(allow_calls, allow_arrows) {
+        if (is("operator", "new")) {
+            return new_(allow_calls);
+        }
+        if (is("operator", "import")) {
+            return import_meta();
+        }
+        var start = S.token;
+        var peeked;
+        var async = is("name", "async")
+            && (peeked = peek()).value != "["
+            && peeked.type != "arrow"
+            && as_atom_node();
+        if (is("punc")) {
+            switch (S.token.value) {
+              case "(":
+                if (async && !allow_calls) break;
+                var exprs = params_or_seq_(allow_arrows, !async);
+                if (allow_arrows && is("arrow", "=>")) {
+                    return arrow_function(start, exprs.map(e => to_fun_args(e)), !!async);
+                }
+                var ex = async ? new AST_Call({
+                    expression: async,
+                    args: exprs
+                }) : exprs.length == 1 ? exprs[0] : new AST_Sequence({
+                    expressions: exprs
+                });
+                if (ex.start) {
+                    const outer_comments_before = start.comments_before.length;
+                    outer_comments_before_counts.set(start, outer_comments_before);
+                    ex.start.comments_before.unshift(...start.comments_before);
+                    start.comments_before = ex.start.comments_before;
+                    if (outer_comments_before == 0 && start.comments_before.length > 0) {
+                        var comment = start.comments_before[0];
+                        if (!comment.nlb) {
+                            comment.nlb = start.nlb;
+                            start.nlb = false;
+                        }
+                    }
+                    start.comments_after = ex.start.comments_after;
+                }
+                ex.start = start;
+                var end = prev();
+                if (ex.end) {
+                    end.comments_before = ex.end.comments_before;
+                    ex.end.comments_after.push(...end.comments_after);
+                    end.comments_after = ex.end.comments_after;
+                }
+                ex.end = end;
+                if (ex instanceof AST_Call) annotate(ex);
+                return subscripts(ex, allow_calls);
+              case "[":
+                return subscripts(array_(), allow_calls);
+              case "{":
+                return subscripts(object_or_destructuring_(), allow_calls);
+            }
+            if (!async) unexpected();
+        }
+        if (allow_arrows && is("name") && is_token(peek(), "arrow")) {
+            var param = new AST_SymbolFunarg({
+                name: S.token.value,
+                start: start,
+                end: start,
+            });
+            next();
+            return arrow_function(start, [param], !!async);
+        }
+        if (is("keyword", "function")) {
+            next();
+            var func = function_(AST_Function, false, !!async);
+            func.start = start;
+            func.end = prev();
+            return subscripts(func, allow_calls);
+        }
+        if (async) return subscripts(async, allow_calls);
+        if (is("keyword", "class")) {
+            next();
+            var cls = class_(AST_ClassExpression);
+            cls.start = start;
+            cls.end = prev();
+            return subscripts(cls, allow_calls);
+        }
+        if (is("template_head")) {
+            return subscripts(template_string(), allow_calls);
+        }
+        if (ATOMIC_START_TOKEN.has(S.token.type)) {
+            return subscripts(as_atom_node(), allow_calls);
+        }
+        unexpected();
+    };
+
+    function template_string() {
+        var segments = [], start = S.token;
+
+        segments.push(new AST_TemplateSegment({
+            start: S.token,
+            raw: LATEST_RAW,
+            value: S.token.value,
+            end: S.token
+        }));
+
+        while (!LATEST_TEMPLATE_END) {
+            next();
+            handle_regexp();
+            segments.push(expression(true));
+
+            segments.push(new AST_TemplateSegment({
+                start: S.token,
+                raw: LATEST_RAW,
+                value: S.token.value,
+                end: S.token
+            }));
+        }
+        next();
+
+        return new AST_TemplateString({
+            start: start,
+            segments: segments,
+            end: S.token
+        });
+    }
+
+    function expr_list(closing, allow_trailing_comma, allow_empty) {
+        var first = true, a = [];
+        while (!is("punc", closing)) {
+            if (first) first = false; else expect(",");
+            if (allow_trailing_comma && is("punc", closing)) break;
+            if (is("punc", ",") && allow_empty) {
+                a.push(new AST_Hole({ start: S.token, end: S.token }));
+            } else if (is("expand", "...")) {
+                next();
+                a.push(new AST_Expansion({start: prev(), expression: expression(),end: S.token}));
+            } else {
+                a.push(expression(false));
+            }
+        }
+        next();
+        return a;
+    }
+
+    var array_ = embed_tokens(function() {
+        expect("[");
+        return new AST_Array({
+            elements: expr_list("]", !options.strict, true)
+        });
+    });
+
+    var create_accessor = embed_tokens((is_generator, is_async) => {
+        return function_(AST_Accessor, is_generator, is_async);
+    });
+
+    var object_or_destructuring_ = embed_tokens(function object_or_destructuring_() {
+        var start = S.token, first = true, a = [];
+        expect("{");
+        while (!is("punc", "}")) {
+            if (first) first = false; else expect(",");
+            if (!options.strict && is("punc", "}"))
+                // allow trailing comma
+                break;
+
+            start = S.token;
+            if (start.type == "expand") {
+                next();
+                a.push(new AST_Expansion({
+                    start: start,
+                    expression: expression(false),
+                    end: prev(),
+                }));
+                continue;
+            }
+
+            var name = as_property_name();
+            var value;
+
+            // Check property and fetch value
+            if (!is("punc", ":")) {
+                var concise = concise_method_or_getset(name, start);
+                if (concise) {
+                    a.push(concise);
+                    continue;
+                }
+
+                value = new AST_SymbolRef({
+                    start: prev(),
+                    name: name,
+                    end: prev()
+                });
+            } else if (name === null) {
+                unexpected(prev());
+            } else {
+                next(); // `:` - see first condition
+                value = expression(false);
+            }
+
+            // Check for default value and alter value accordingly if necessary
+            if (is("operator", "=")) {
+                next();
+                value = new AST_Assign({
+                    start: start,
+                    left: value,
+                    operator: "=",
+                    right: expression(false),
+                    logical: false,
+                    end: prev()
+                });
+            }
+
+            // Create property
+            a.push(new AST_ObjectKeyVal({
+                start: start,
+                quote: start.quote,
+                key: name instanceof AST_Node ? name : "" + name,
+                value: value,
+                end: prev()
+            }));
+        }
+        next();
+        return new AST_Object({ properties: a });
+    });
+
+    function class_(KindOfClass, is_export_default) {
+        var start, method, class_name, extends_, a = [];
+
+        S.input.push_directives_stack(); // Push directive stack, but not scope stack
+        S.input.add_directive("use strict");
+
+        if (S.token.type == "name" && S.token.value != "extends") {
+            class_name = as_symbol(KindOfClass === AST_DefClass ? AST_SymbolDefClass : AST_SymbolClass);
+        }
+
+        if (KindOfClass === AST_DefClass && !class_name) {
+            if (is_export_default) {
+                KindOfClass = AST_ClassExpression;
+            } else {
+                unexpected();
+            }
+        }
+
+        if (S.token.value == "extends") {
+            next();
+            extends_ = expression(true);
+        }
+
+        expect("{");
+
+        while (is("punc", ";")) { next(); }  // Leading semicolons are okay in class bodies.
+        while (!is("punc", "}")) {
+            start = S.token;
+            method = concise_method_or_getset(as_property_name(), start, true);
+            if (!method) { unexpected(); }
+            a.push(method);
+            while (is("punc", ";")) { next(); }
+        }
+
+        S.input.pop_directives_stack();
+
+        next();
+
+        return new KindOfClass({
+            start: start,
+            name: class_name,
+            extends: extends_,
+            properties: a,
+            end: prev(),
+        });
+    }
+
+    function concise_method_or_getset(name, start, is_class) {
+        const get_symbol_ast = (name, SymbolClass = AST_SymbolMethod) => {
+            if (typeof name === "string" || typeof name === "number") {
+                return new SymbolClass({
+                    start,
+                    name: "" + name,
+                    end: prev()
+                });
+            } else if (name === null) {
+                unexpected();
+            }
+            return name;
+        };
+
+        const is_not_method_start = () =>
+            !is("punc", "(") && !is("punc", ",") && !is("punc", "}") && !is("punc", ";") && !is("operator", "=");
+
+        var is_async = false;
+        var is_static = false;
+        var is_generator = false;
+        var is_private = false;
+        var accessor_type = null;
+
+        if (is_class && name === "static" && is_not_method_start()) {
+            is_static = true;
+            name = as_property_name();
+        }
+        if (name === "async" && is_not_method_start()) {
+            is_async = true;
+            name = as_property_name();
+        }
+        if (prev().type === "operator" && prev().value === "*") {
+            is_generator = true;
+            name = as_property_name();
+        }
+        if ((name === "get" || name === "set") && is_not_method_start()) {
+            accessor_type = name;
+            name = as_property_name();
+        }
+        if (prev().type === "privatename") {
+            is_private = true;
+        }
+
+        const property_token = prev();
+
+        if (accessor_type != null) {
+            if (!is_private) {
+                const AccessorClass = accessor_type === "get"
+                    ? AST_ObjectGetter
+                    : AST_ObjectSetter;
+
+                name = get_symbol_ast(name);
+                return new AccessorClass({
+                    start,
+                    static: is_static,
+                    key: name,
+                    quote: name instanceof AST_SymbolMethod ? property_token.quote : undefined,
+                    value: create_accessor(),
+                    end: prev()
+                });
+            } else {
+                const AccessorClass = accessor_type === "get"
+                    ? AST_PrivateGetter
+                    : AST_PrivateSetter;
+
+                return new AccessorClass({
+                    start,
+                    static: is_static,
+                    key: get_symbol_ast(name),
+                    value: create_accessor(),
+                    end: prev(),
+                });
+            }
+        }
+
+        if (is("punc", "(")) {
+            name = get_symbol_ast(name);
+            const AST_MethodVariant = is_private
+                ? AST_PrivateMethod
+                : AST_ConciseMethod;
+            var node = new AST_MethodVariant({
+                start       : start,
+                static      : is_static,
+                is_generator: is_generator,
+                async       : is_async,
+                key         : name,
+                quote       : name instanceof AST_SymbolMethod ?
+                              property_token.quote : undefined,
+                value       : create_accessor(is_generator, is_async),
+                end         : prev()
+            });
+            return node;
+        }
+
+        if (is_class) {
+            const key = get_symbol_ast(name, AST_SymbolClassProperty);
+            const quote = key instanceof AST_SymbolClassProperty
+                ? property_token.quote
+                : undefined;
+            const AST_ClassPropertyVariant = is_private
+                ? AST_ClassPrivateProperty
+                : AST_ClassProperty;
+            if (is("operator", "=")) {
+                next();
+                return new AST_ClassPropertyVariant({
+                    start,
+                    static: is_static,
+                    quote,
+                    key,
+                    value: expression(false),
+                    end: prev()
+                });
+            } else if (
+                is("name")
+                || is("privatename")
+                || is("operator", "*")
+                || is("punc", ";")
+                || is("punc", "}")
+            ) {
+                return new AST_ClassPropertyVariant({
+                    start,
+                    static: is_static,
+                    quote,
+                    key,
+                    end: prev()
+                });
+            }
+        }
+    }
+
+    function maybe_import_assertion() {
+        if (is("name", "assert") && !has_newline_before(S.token)) {
+            next();
+            return object_or_destructuring_();
+        }
+        return null;
+    }
+
+    function import_statement() {
+        var start = prev();
+
+        var imported_name;
+        var imported_names;
+        if (is("name")) {
+            imported_name = as_symbol(AST_SymbolImport);
+        }
+
+        if (is("punc", ",")) {
+            next();
+        }
+
+        imported_names = map_names(true);
+
+        if (imported_names || imported_name) {
+            expect_token("name", "from");
+        }
+        var mod_str = S.token;
+        if (mod_str.type !== "string") {
+            unexpected();
+        }
+        next();
+
+        const assert_clause = maybe_import_assertion();
+
+        return new AST_Import({
+            start,
+            imported_name,
+            imported_names,
+            module_name: new AST_String({
+                start: mod_str,
+                value: mod_str.value,
+                quote: mod_str.quote,
+                end: mod_str,
+            }),
+            assert_clause,
+            end: S.token,
+        });
+    }
+
+    function import_meta() {
+        var start = S.token;
+        expect_token("operator", "import");
+        expect_token("punc", ".");
+        expect_token("name", "meta");
+        return subscripts(new AST_ImportMeta({
+            start: start,
+            end: prev()
+        }), false);
+    }
+
+    function map_name(is_import) {
+        function make_symbol(type) {
+            return new type({
+                name: as_property_name(),
+                start: prev(),
+                end: prev()
+            });
+        }
+
+        var foreign_type = is_import ? AST_SymbolImportForeign : AST_SymbolExportForeign;
+        var type = is_import ? AST_SymbolImport : AST_SymbolExport;
+        var start = S.token;
+        var foreign_name;
+        var name;
+
+        if (is_import) {
+            foreign_name = make_symbol(foreign_type);
+        } else {
+            name = make_symbol(type);
+        }
+        if (is("name", "as")) {
+            next();  // The "as" word
+            if (is_import) {
+                name = make_symbol(type);
+            } else {
+                foreign_name = make_symbol(foreign_type);
+            }
+        } else if (is_import) {
+            name = new type(foreign_name);
+        } else {
+            foreign_name = new foreign_type(name);
+        }
+
+        return new AST_NameMapping({
+            start: start,
+            foreign_name: foreign_name,
+            name: name,
+            end: prev(),
+        });
+    }
+
+    function map_nameAsterisk(is_import, name) {
+        var foreign_type = is_import ? AST_SymbolImportForeign : AST_SymbolExportForeign;
+        var type = is_import ? AST_SymbolImport : AST_SymbolExport;
+        var start = S.token;
+        var foreign_name;
+        var end = prev();
+
+        name = name || new type({
+            name: "*",
+            start: start,
+            end: end,
+        });
+
+        foreign_name = new foreign_type({
+            name: "*",
+            start: start,
+            end: end,
+        });
+
+        return new AST_NameMapping({
+            start: start,
+            foreign_name: foreign_name,
+            name: name,
+            end: end,
+        });
+    }
+
+    function map_names(is_import) {
+        var names;
+        if (is("punc", "{")) {
+            next();
+            names = [];
+            while (!is("punc", "}")) {
+                names.push(map_name(is_import));
+                if (is("punc", ",")) {
+                    next();
+                }
+            }
+            next();
+        } else if (is("operator", "*")) {
+            var name;
+            next();
+            if (is_import && is("name", "as")) {
+                next();  // The "as" word
+                name = as_symbol(is_import ? AST_SymbolImport : AST_SymbolExportForeign);
+            }
+            names = [map_nameAsterisk(is_import, name)];
+        }
+        return names;
+    }
+
+    function export_statement() {
+        var start = S.token;
+        var is_default;
+        var exported_names;
+
+        if (is("keyword", "default")) {
+            is_default = true;
+            next();
+        } else if (exported_names = map_names(false)) {
+            if (is("name", "from")) {
+                next();
+
+                var mod_str = S.token;
+                if (mod_str.type !== "string") {
+                    unexpected();
+                }
+                next();
+
+                const assert_clause = maybe_import_assertion();
+
+                return new AST_Export({
+                    start: start,
+                    is_default: is_default,
+                    exported_names: exported_names,
+                    module_name: new AST_String({
+                        start: mod_str,
+                        value: mod_str.value,
+                        quote: mod_str.quote,
+                        end: mod_str,
+                    }),
+                    end: prev(),
+                    assert_clause
+                });
+            } else {
+                return new AST_Export({
+                    start: start,
+                    is_default: is_default,
+                    exported_names: exported_names,
+                    end: prev(),
+                });
+            }
+        }
+
+        var node;
+        var exported_value;
+        var exported_definition;
+        if (is("punc", "{")
+            || is_default
+                && (is("keyword", "class") || is("keyword", "function"))
+                && is_token(peek(), "punc")) {
+            exported_value = expression(false);
+            semicolon();
+        } else if ((node = statement(is_default)) instanceof AST_Definitions && is_default) {
+            unexpected(node.start);
+        } else if (
+            node instanceof AST_Definitions
+            || node instanceof AST_Defun
+            || node instanceof AST_DefClass
+        ) {
+            exported_definition = node;
+        } else if (
+            node instanceof AST_ClassExpression
+            || node instanceof AST_Function
+        ) {
+            exported_value = node;
+        } else if (node instanceof AST_SimpleStatement) {
+            exported_value = node.body;
+        } else {
+            unexpected(node.start);
+        }
+
+        return new AST_Export({
+            start: start,
+            is_default: is_default,
+            exported_value: exported_value,
+            exported_definition: exported_definition,
+            end: prev(),
+            assert_clause: null
+        });
+    }
+
+    function as_property_name() {
+        var tmp = S.token;
+        switch (tmp.type) {
+          case "punc":
+            if (tmp.value === "[") {
+                next();
+                var ex = expression(false);
+                expect("]");
+                return ex;
+            } else unexpected(tmp);
+          case "operator":
+            if (tmp.value === "*") {
+                next();
+                return null;
+            }
+            if (!["delete", "in", "instanceof", "new", "typeof", "void"].includes(tmp.value)) {
+                unexpected(tmp);
+            }
+            /* falls through */
+          case "name":
+          case "privatename":
+          case "string":
+          case "num":
+          case "big_int":
+          case "keyword":
+          case "atom":
+            next();
+            return tmp.value;
+          default:
+            unexpected(tmp);
+        }
+    }
+
+    function as_name() {
+        var tmp = S.token;
+        if (tmp.type != "name" && tmp.type != "privatename") unexpected();
+        next();
+        return tmp.value;
+    }
+
+    function _make_symbol(type) {
+        var name = S.token.value;
+        return new (name == "this" ? AST_This :
+                    name == "super" ? AST_Super :
+                    type)({
+            name  : String(name),
+            start : S.token,
+            end   : S.token
+        });
+    }
+
+    function _verify_symbol(sym) {
+        var name = sym.name;
+        if (is_in_generator() && name == "yield") {
+            token_error(sym.start, "Yield cannot be used as identifier inside generators");
+        }
+        if (S.input.has_directive("use strict")) {
+            if (name == "yield") {
+                token_error(sym.start, "Unexpected yield identifier inside strict mode");
+            }
+            if (sym instanceof AST_SymbolDeclaration && (name == "arguments" || name == "eval")) {
+                token_error(sym.start, "Unexpected " + name + " in strict mode");
+            }
+        }
+    }
+
+    function as_symbol(type, noerror) {
+        if (!is("name")) {
+            if (!noerror) croak("Name expected");
+            return null;
+        }
+        var sym = _make_symbol(type);
+        _verify_symbol(sym);
+        next();
+        return sym;
+    }
+
+    // Annotate AST_Call, AST_Lambda or AST_New with the special comments
+    function annotate(node) {
+        var start = node.start;
+        var comments = start.comments_before;
+        const comments_outside_parens = outer_comments_before_counts.get(start);
+        var i = comments_outside_parens != null ? comments_outside_parens : comments.length;
+        while (--i >= 0) {
+            var comment = comments[i];
+            if (/[@#]__/.test(comment.value)) {
+                if (/[@#]__PURE__/.test(comment.value)) {
+                    set_annotation(node, _PURE);
+                    break;
+                }
+                if (/[@#]__INLINE__/.test(comment.value)) {
+                    set_annotation(node, _INLINE);
+                    break;
+                }
+                if (/[@#]__NOINLINE__/.test(comment.value)) {
+                    set_annotation(node, _NOINLINE);
+                    break;
+                }
+            }
+        }
+    }
+
+    var subscripts = function(expr, allow_calls, is_chain) {
+        var start = expr.start;
+        if (is("punc", ".")) {
+            next();
+            const AST_DotVariant = is("privatename") ? AST_DotHash : AST_Dot;
+            return subscripts(new AST_DotVariant({
+                start      : start,
+                expression : expr,
+                optional   : false,
+                property   : as_name(),
+                end        : prev()
+            }), allow_calls, is_chain);
+        }
+        if (is("punc", "[")) {
+            next();
+            var prop = expression(true);
+            expect("]");
+            return subscripts(new AST_Sub({
+                start      : start,
+                expression : expr,
+                optional   : false,
+                property   : prop,
+                end        : prev()
+            }), allow_calls, is_chain);
+        }
+        if (allow_calls && is("punc", "(")) {
+            next();
+            var call = new AST_Call({
+                start      : start,
+                expression : expr,
+                optional   : false,
+                args       : call_args(),
+                end        : prev()
+            });
+            annotate(call);
+            return subscripts(call, true, is_chain);
+        }
+
+        if (is("punc", "?.")) {
+            next();
+
+            let chain_contents;
+
+            if (allow_calls && is("punc", "(")) {
+                next();
+
+                const call = new AST_Call({
+                    start,
+                    optional: true,
+                    expression: expr,
+                    args: call_args(),
+                    end: prev()
+                });
+                annotate(call);
+
+                chain_contents = subscripts(call, true, true);
+            } else if (is("name") || is("privatename")) {
+                const AST_DotVariant = is("privatename") ? AST_DotHash : AST_Dot;
+                chain_contents = subscripts(new AST_DotVariant({
+                    start,
+                    expression: expr,
+                    optional: true,
+                    property: as_name(),
+                    end: prev()
+                }), allow_calls, true);
+            } else if (is("punc", "[")) {
+                next();
+                const property = expression(true);
+                expect("]");
+                chain_contents = subscripts(new AST_Sub({
+                    start,
+                    expression: expr,
+                    optional: true,
+                    property,
+                    end: prev()
+                }), allow_calls, true);
+            }
+
+            if (!chain_contents) unexpected();
+
+            if (chain_contents instanceof AST_Chain) return chain_contents;
+
+            return new AST_Chain({
+                start,
+                expression: chain_contents,
+                end: prev()
+            });
+        }
+
+        if (is("template_head")) {
+            if (is_chain) {
+                // a?.b`c` is a syntax error
+                unexpected();
+            }
+
+            return subscripts(new AST_PrefixedTemplateString({
+                start: start,
+                prefix: expr,
+                template_string: template_string(),
+                end: prev()
+            }), allow_calls);
+        }
+
+        return expr;
+    };
+
+    function call_args() {
+        var args = [];
+        while (!is("punc", ")")) {
+            if (is("expand", "...")) {
+                next();
+                args.push(new AST_Expansion({
+                    start: prev(),
+                    expression: expression(false),
+                    end: prev()
+                }));
+            } else {
+                args.push(expression(false));
+            }
+            if (!is("punc", ")")) {
+                expect(",");
+            }
+        }
+        next();
+        return args;
+    }
+
+    var maybe_unary = function(allow_calls, allow_arrows) {
+        var start = S.token;
+        if (start.type == "name" && start.value == "await" && can_await()) {
+            next();
+            return _await_expression();
+        }
+        if (is("operator") && UNARY_PREFIX.has(start.value)) {
+            next();
+            handle_regexp();
+            var ex = make_unary(AST_UnaryPrefix, start, maybe_unary(allow_calls));
+            ex.start = start;
+            ex.end = prev();
+            return ex;
+        }
+        var val = expr_atom(allow_calls, allow_arrows);
+        while (is("operator") && UNARY_POSTFIX.has(S.token.value) && !has_newline_before(S.token)) {
+            if (val instanceof AST_Arrow) unexpected();
+            val = make_unary(AST_UnaryPostfix, S.token, val);
+            val.start = start;
+            val.end = S.token;
+            next();
+        }
+        return val;
+    };
+
+    function make_unary(ctor, token, expr) {
+        var op = token.value;
+        switch (op) {
+          case "++":
+          case "--":
+            if (!is_assignable(expr))
+                croak("Invalid use of " + op + " operator", token.line, token.col, token.pos);
+            break;
+          case "delete":
+            if (expr instanceof AST_SymbolRef && S.input.has_directive("use strict"))
+                croak("Calling delete on expression not allowed in strict mode", expr.start.line, expr.start.col, expr.start.pos);
+            break;
+        }
+        return new ctor({ operator: op, expression: expr });
+    }
+
+    var expr_op = function(left, min_prec, no_in) {
+        var op = is("operator") ? S.token.value : null;
+        if (op == "in" && no_in) op = null;
+        if (op == "**" && left instanceof AST_UnaryPrefix
+            /* unary token in front not allowed - parenthesis required */
+            && !is_token(left.start, "punc", "(")
+            && left.operator !== "--" && left.operator !== "++")
+                unexpected(left.start);
+        var prec = op != null ? PRECEDENCE[op] : null;
+        if (prec != null && (prec > min_prec || (op === "**" && min_prec === prec))) {
+            next();
+            var right = expr_op(maybe_unary(true), prec, no_in);
+            return expr_op(new AST_Binary({
+                start    : left.start,
+                left     : left,
+                operator : op,
+                right    : right,
+                end      : right.end
+            }), min_prec, no_in);
+        }
+        return left;
+    };
+
+    function expr_ops(no_in) {
+        return expr_op(maybe_unary(true, true), 0, no_in);
+    }
+
+    var maybe_conditional = function(no_in) {
+        var start = S.token;
+        var expr = expr_ops(no_in);
+        if (is("operator", "?")) {
+            next();
+            var yes = expression(false);
+            expect(":");
+            return new AST_Conditional({
+                start       : start,
+                condition   : expr,
+                consequent  : yes,
+                alternative : expression(false, no_in),
+                end         : prev()
+            });
+        }
+        return expr;
+    };
+
+    function is_assignable(expr) {
+        return expr instanceof AST_PropAccess || expr instanceof AST_SymbolRef;
+    }
+
+    function to_destructuring(node) {
+        if (node instanceof AST_Object) {
+            node = new AST_Destructuring({
+                start: node.start,
+                names: node.properties.map(to_destructuring),
+                is_array: false,
+                end: node.end
+            });
+        } else if (node instanceof AST_Array) {
+            var names = [];
+
+            for (var i = 0; i < node.elements.length; i++) {
+                // Only allow expansion as last element
+                if (node.elements[i] instanceof AST_Expansion) {
+                    if (i + 1 !== node.elements.length) {
+                        token_error(node.elements[i].start, "Spread must the be last element in destructuring array");
+                    }
+                    node.elements[i].expression = to_destructuring(node.elements[i].expression);
+                }
+
+                names.push(to_destructuring(node.elements[i]));
+            }
+
+            node = new AST_Destructuring({
+                start: node.start,
+                names: names,
+                is_array: true,
+                end: node.end
+            });
+        } else if (node instanceof AST_ObjectProperty) {
+            node.value = to_destructuring(node.value);
+        } else if (node instanceof AST_Assign) {
+            node = new AST_DefaultAssign({
+                start: node.start,
+                left: node.left,
+                operator: "=",
+                right: node.right,
+                end: node.end
+            });
+        }
+        return node;
+    }
+
+    // In ES6, AssignmentExpression can also be an ArrowFunction
+    var maybe_assign = function(no_in) {
+        handle_regexp();
+        var start = S.token;
+
+        if (start.type == "name" && start.value == "yield") {
+            if (is_in_generator()) {
+                next();
+                return _yield_expression();
+            } else if (S.input.has_directive("use strict")) {
+                token_error(S.token, "Unexpected yield identifier inside strict mode");
+            }
+        }
+
+        var left = maybe_conditional(no_in);
+        var val = S.token.value;
+
+        if (is("operator") && ASSIGNMENT.has(val)) {
+            if (is_assignable(left) || (left = to_destructuring(left)) instanceof AST_Destructuring) {
+                next();
+
+                return new AST_Assign({
+                    start    : start,
+                    left     : left,
+                    operator : val,
+                    right    : maybe_assign(no_in),
+                    logical  : LOGICAL_ASSIGNMENT.has(val),
+                    end      : prev()
+                });
+            }
+            croak("Invalid assignment");
+        }
+        return left;
+    };
+
+    var expression = function(commas, no_in) {
+        var start = S.token;
+        var exprs = [];
+        while (true) {
+            exprs.push(maybe_assign(no_in));
+            if (!commas || !is("punc", ",")) break;
+            next();
+            commas = true;
+        }
+        return exprs.length == 1 ? exprs[0] : new AST_Sequence({
+            start       : start,
+            expressions : exprs,
+            end         : peek()
+        });
+    };
+
+    function in_loop(cont) {
+        ++S.in_loop;
+        var ret = cont();
+        --S.in_loop;
+        return ret;
+    }
+
+    if (options.expression) {
+        return expression(true);
+    }
+
+    return (function parse_toplevel() {
+        var start = S.token;
+        var body = [];
+        S.input.push_directives_stack();
+        if (options.module) S.input.add_directive("use strict");
+        while (!is("eof")) {
+            body.push(statement());
+        }
+        S.input.pop_directives_stack();
+        var end = prev();
+        var toplevel = options.toplevel;
+        if (toplevel) {
+            toplevel.body = toplevel.body.concat(body);
+            toplevel.end = end;
+        } else {
+            toplevel = new AST_Toplevel({ start: start, body: body, end: end });
+        }
+        return toplevel;
+    })();
+
+}
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+function DEFNODE(type, props, methods, base = AST_Node) {
+    if (!props) props = [];
+    else props = props.split(/\s+/);
+    var self_props = props;
+    if (base && base.PROPS)
+        props = props.concat(base.PROPS);
+    var code = "return function AST_" + type + "(props){ if (props) { ";
+    for (var i = props.length; --i >= 0;) {
+        code += "this." + props[i] + " = props." + props[i] + ";";
+    }
+    const proto = base && Object.create(base.prototype);
+    if (proto && proto.initialize || (methods && methods.initialize))
+        code += "this.initialize();";
+    code += "}";
+    code += "this.flags = 0;";
+    code += "}";
+    var ctor = new Function(code)();
+    if (proto) {
+        ctor.prototype = proto;
+        ctor.BASE = base;
+    }
+    if (base) base.SUBCLASSES.push(ctor);
+    ctor.prototype.CTOR = ctor;
+    ctor.prototype.constructor = ctor;
+    ctor.PROPS = props || null;
+    ctor.SELF_PROPS = self_props;
+    ctor.SUBCLASSES = [];
+    if (type) {
+        ctor.prototype.TYPE = ctor.TYPE = type;
+    }
+    if (methods) for (i in methods) if (HOP(methods, i)) {
+        if (i[0] === "$") {
+            ctor[i.substr(1)] = methods[i];
+        } else {
+            ctor.prototype[i] = methods[i];
+        }
+    }
+    ctor.DEFMETHOD = function(name, method) {
+        this.prototype[name] = method;
+    };
+    return ctor;
+}
+
+const has_tok_flag = (tok, flag) => Boolean(tok.flags & flag);
+const set_tok_flag = (tok, flag, truth) => {
+    if (truth) {
+        tok.flags |= flag;
+    } else {
+        tok.flags &= ~flag;
+    }
+};
+
+const TOK_FLAG_NLB          = 0b0001;
+const TOK_FLAG_QUOTE_SINGLE = 0b0010;
+const TOK_FLAG_QUOTE_EXISTS = 0b0100;
+
+class AST_Token {
+    constructor(type, value, line, col, pos, nlb, comments_before, comments_after, file) {
+        this.flags = (nlb ? 1 : 0);
+
+        this.type = type;
+        this.value = value;
+        this.line = line;
+        this.col = col;
+        this.pos = pos;
+        this.comments_before = comments_before;
+        this.comments_after = comments_after;
+        this.file = file;
+
+        Object.seal(this);
+    }
+
+    get nlb() {
+        return has_tok_flag(this, TOK_FLAG_NLB);
+    }
+
+    set nlb(new_nlb) {
+        set_tok_flag(this, TOK_FLAG_NLB, new_nlb);
+    }
+
+    get quote() {
+        return !has_tok_flag(this, TOK_FLAG_QUOTE_EXISTS)
+            ? ""
+            : (has_tok_flag(this, TOK_FLAG_QUOTE_SINGLE) ? "'" : '"');
+    }
+
+    set quote(quote_type) {
+        set_tok_flag(this, TOK_FLAG_QUOTE_SINGLE, quote_type === "'");
+        set_tok_flag(this, TOK_FLAG_QUOTE_EXISTS, !!quote_type);
+    }
+}
+
+var AST_Node = DEFNODE("Node", "start end", {
+    _clone: function(deep) {
+        if (deep) {
+            var self = this.clone();
+            return self.transform(new TreeTransformer(function(node) {
+                if (node !== self) {
+                    return node.clone(true);
+                }
+            }));
+        }
+        return new this.CTOR(this);
+    },
+    clone: function(deep) {
+        return this._clone(deep);
+    },
+    $documentation: "Base class of all AST nodes",
+    $propdoc: {
+        start: "[AST_Token] The first token of this node",
+        end: "[AST_Token] The last token of this node"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this);
+    },
+    walk: function(visitor) {
+        return this._walk(visitor); // not sure the indirection will be any help
+    },
+    _children_backwards: () => {}
+}, null);
+
+/* -----[ statements ]----- */
+
+var AST_Statement = DEFNODE("Statement", null, {
+    $documentation: "Base class of all statements",
+});
+
+var AST_Debugger = DEFNODE("Debugger", null, {
+    $documentation: "Represents a debugger statement",
+}, AST_Statement);
+
+var AST_Directive = DEFNODE("Directive", "value quote", {
+    $documentation: "Represents a directive, like \"use strict\";",
+    $propdoc: {
+        value: "[string] The value of this directive as a plain string (it's not an AST_String!)",
+        quote: "[string] the original quote character"
+    },
+}, AST_Statement);
+
+var AST_SimpleStatement = DEFNODE("SimpleStatement", "body", {
+    $documentation: "A statement consisting of an expression, i.e. a = 1 + 2",
+    $propdoc: {
+        body: "[AST_Node] an expression node (should not be instanceof AST_Statement)"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+    }
+}, AST_Statement);
+
+function walk_body(node, visitor) {
+    const body = node.body;
+    for (var i = 0, len = body.length; i < len; i++) {
+        body[i]._walk(visitor);
+    }
+}
+
+function clone_block_scope(deep) {
+    var clone = this._clone(deep);
+    if (this.block_scope) {
+        clone.block_scope = this.block_scope.clone();
+    }
+    return clone;
+}
+
+var AST_Block = DEFNODE("Block", "body block_scope", {
+    $documentation: "A body of statements (usually braced)",
+    $propdoc: {
+        body: "[AST_Statement*] an array of statements",
+        block_scope: "[AST_Scope] the block scope"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+    },
+    clone: clone_block_scope
+}, AST_Statement);
+
+var AST_BlockStatement = DEFNODE("BlockStatement", null, {
+    $documentation: "A block statement",
+}, AST_Block);
+
+var AST_EmptyStatement = DEFNODE("EmptyStatement", null, {
+    $documentation: "The empty statement (empty block or simply a semicolon)"
+}, AST_Statement);
+
+var AST_StatementWithBody = DEFNODE("StatementWithBody", "body", {
+    $documentation: "Base class for all statements that contain one nested body: `For`, `ForIn`, `Do`, `While`, `With`",
+    $propdoc: {
+        body: "[AST_Statement] the body; this should always be present, even if it's an AST_EmptyStatement"
+    }
+}, AST_Statement);
+
+var AST_LabeledStatement = DEFNODE("LabeledStatement", "label", {
+    $documentation: "Statement with a label",
+    $propdoc: {
+        label: "[AST_Label] a label definition"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.label._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        push(this.label);
+    },
+    clone: function(deep) {
+        var node = this._clone(deep);
+        if (deep) {
+            var label = node.label;
+            var def = this.label;
+            node.walk(new TreeWalker(function(node) {
+                if (node instanceof AST_LoopControl
+                    && node.label && node.label.thedef === def) {
+                    node.label.thedef = label;
+                    label.references.push(node);
+                }
+            }));
+        }
+        return node;
+    }
+}, AST_StatementWithBody);
+
+var AST_IterationStatement = DEFNODE("IterationStatement", "block_scope", {
+    $documentation: "Internal class.  All loops inherit from it.",
+    $propdoc: {
+        block_scope: "[AST_Scope] the block scope for this iteration statement."
+    },
+    clone: clone_block_scope
+}, AST_StatementWithBody);
+
+var AST_DWLoop = DEFNODE("DWLoop", "condition", {
+    $documentation: "Base class for do/while statements",
+    $propdoc: {
+        condition: "[AST_Node] the loop condition.  Should not be instanceof AST_Statement"
+    }
+}, AST_IterationStatement);
+
+var AST_Do = DEFNODE("Do", null, {
+    $documentation: "A `do` statement",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.body._walk(visitor);
+            this.condition._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.condition);
+        push(this.body);
+    }
+}, AST_DWLoop);
+
+var AST_While = DEFNODE("While", null, {
+    $documentation: "A `while` statement",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.condition._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        push(this.condition);
+    },
+}, AST_DWLoop);
+
+var AST_For = DEFNODE("For", "init condition step", {
+    $documentation: "A `for` statement",
+    $propdoc: {
+        init: "[AST_Node?] the `for` initialization code, or null if empty",
+        condition: "[AST_Node?] the `for` termination clause, or null if empty",
+        step: "[AST_Node?] the `for` update clause, or null if empty"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.init) this.init._walk(visitor);
+            if (this.condition) this.condition._walk(visitor);
+            if (this.step) this.step._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        if (this.step) push(this.step);
+        if (this.condition) push(this.condition);
+        if (this.init) push(this.init);
+    },
+}, AST_IterationStatement);
+
+var AST_ForIn = DEFNODE("ForIn", "init object", {
+    $documentation: "A `for ... in` statement",
+    $propdoc: {
+        init: "[AST_Node] the `for/in` initialization code",
+        object: "[AST_Node] the object that we're looping through"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.init._walk(visitor);
+            this.object._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        if (this.object) push(this.object);
+        if (this.init) push(this.init);
+    },
+}, AST_IterationStatement);
+
+var AST_ForOf = DEFNODE("ForOf", "await", {
+    $documentation: "A `for ... of` statement",
+}, AST_ForIn);
+
+var AST_With = DEFNODE("With", "expression", {
+    $documentation: "A `with` statement",
+    $propdoc: {
+        expression: "[AST_Node] the `with` expression"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        push(this.expression);
+    },
+}, AST_StatementWithBody);
+
+/* -----[ scope and functions ]----- */
+
+var AST_Scope = DEFNODE("Scope", "variables functions uses_with uses_eval parent_scope enclosed cname", {
+    $documentation: "Base class for all statements introducing a lexical scope",
+    $propdoc: {
+        variables: "[Map/S] a map of name -> SymbolDef for all variables/functions defined in this scope",
+        uses_with: "[boolean/S] tells whether this scope uses the `with` statement",
+        uses_eval: "[boolean/S] tells whether this scope contains a direct call to the global `eval`",
+        parent_scope: "[AST_Scope?/S] link to the parent scope",
+        enclosed: "[SymbolDef*/S] a list of all symbol definitions that are accessed from this scope or any subscopes",
+        cname: "[integer/S] current index for mangling variables (used internally by the mangler)",
+    },
+    get_defun_scope: function() {
+        var self = this;
+        while (self.is_block_scope()) {
+            self = self.parent_scope;
+        }
+        return self;
+    },
+    clone: function(deep, toplevel) {
+        var node = this._clone(deep);
+        if (deep && this.variables && toplevel && !this._block_scope) {
+            node.figure_out_scope({}, {
+                toplevel: toplevel,
+                parent_scope: this.parent_scope
+            });
+        } else {
+            if (this.variables) node.variables = new Map(this.variables);
+            if (this.enclosed) node.enclosed = this.enclosed.slice();
+            if (this._block_scope) node._block_scope = this._block_scope;
+        }
+        return node;
+    },
+    pinned: function() {
+        return this.uses_eval || this.uses_with;
+    }
+}, AST_Block);
+
+var AST_Toplevel = DEFNODE("Toplevel", "globals", {
+    $documentation: "The toplevel scope",
+    $propdoc: {
+        globals: "[Map/S] a map of name -> SymbolDef for all undeclared names",
+    },
+    wrap_commonjs: function(name) {
+        var body = this.body;
+        var wrapped_tl = "(function(exports){'$ORIG';})(typeof " + name + "=='undefined'?(" + name + "={}):" + name + ");";
+        wrapped_tl = parse(wrapped_tl);
+        wrapped_tl = wrapped_tl.transform(new TreeTransformer(function(node) {
+            if (node instanceof AST_Directive && node.value == "$ORIG") {
+                return MAP.splice(body);
+            }
+        }));
+        return wrapped_tl;
+    },
+    wrap_enclose: function(args_values) {
+        if (typeof args_values != "string") args_values = "";
+        var index = args_values.indexOf(":");
+        if (index < 0) index = args_values.length;
+        var body = this.body;
+        return parse([
+            "(function(",
+            args_values.slice(0, index),
+            '){"$ORIG"})(',
+            args_values.slice(index + 1),
+            ")"
+        ].join("")).transform(new TreeTransformer(function(node) {
+            if (node instanceof AST_Directive && node.value == "$ORIG") {
+                return MAP.splice(body);
+            }
+        }));
+    }
+}, AST_Scope);
+
+var AST_Expansion = DEFNODE("Expansion", "expression", {
+    $documentation: "An expandible argument, such as ...rest, a splat, such as [1,2,...all], or an expansion in a variable declaration, such as var [first, ...rest] = list",
+    $propdoc: {
+        expression: "[AST_Node] the thing to be expanded"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression.walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_Lambda = DEFNODE("Lambda", "name argnames uses_arguments is_generator async", {
+    $documentation: "Base class for functions",
+    $propdoc: {
+        name: "[AST_SymbolDeclaration?] the name of this function",
+        argnames: "[AST_SymbolFunarg|AST_Destructuring|AST_Expansion|AST_DefaultAssign*] array of function arguments, destructurings, or expanding arguments",
+        uses_arguments: "[boolean/S] tells whether this function accesses the arguments array",
+        is_generator: "[boolean] is this a generator method",
+        async: "[boolean] is this method async",
+    },
+    args_as_names: function () {
+        var out = [];
+        for (var i = 0; i < this.argnames.length; i++) {
+            if (this.argnames[i] instanceof AST_Destructuring) {
+                out.push(...this.argnames[i].all_symbols());
+            } else {
+                out.push(this.argnames[i]);
+            }
+        }
+        return out;
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.name) this.name._walk(visitor);
+            var argnames = this.argnames;
+            for (var i = 0, len = argnames.length; i < len; i++) {
+                argnames[i]._walk(visitor);
+            }
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+
+        i = this.argnames.length;
+        while (i--) push(this.argnames[i]);
+
+        if (this.name) push(this.name);
+    },
+    is_braceless() {
+        return this.body[0] instanceof AST_Return && this.body[0].value;
+    },
+    // Default args and expansion don't count, so .argnames.length doesn't cut it
+    length_property() {
+        let length = 0;
+
+        for (const arg of this.argnames) {
+            if (arg instanceof AST_SymbolFunarg || arg instanceof AST_Destructuring) {
+                length++;
+            }
+        }
+
+        return length;
+    }
+}, AST_Scope);
+
+var AST_Accessor = DEFNODE("Accessor", null, {
+    $documentation: "A setter/getter function.  The `name` property is always null."
+}, AST_Lambda);
+
+var AST_Function = DEFNODE("Function", null, {
+    $documentation: "A function expression"
+}, AST_Lambda);
+
+var AST_Arrow = DEFNODE("Arrow", null, {
+    $documentation: "An ES6 Arrow function ((a) => b)"
+}, AST_Lambda);
+
+var AST_Defun = DEFNODE("Defun", null, {
+    $documentation: "A function definition"
+}, AST_Lambda);
+
+/* -----[ DESTRUCTURING ]----- */
+var AST_Destructuring = DEFNODE("Destructuring", "names is_array", {
+    $documentation: "A destructuring of several names. Used in destructuring assignment and with destructuring function argument names",
+    $propdoc: {
+        "names": "[AST_Node*] Array of properties or elements",
+        "is_array": "[Boolean] Whether the destructuring represents an object or array"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.names.forEach(function(name) {
+                name._walk(visitor);
+            });
+        });
+    },
+    _children_backwards(push) {
+        let i = this.names.length;
+        while (i--) push(this.names[i]);
+    },
+    all_symbols: function() {
+        var out = [];
+        this.walk(new TreeWalker(function (node) {
+            if (node instanceof AST_Symbol) {
+                out.push(node);
+            }
+        }));
+        return out;
+    }
+});
+
+var AST_PrefixedTemplateString = DEFNODE("PrefixedTemplateString", "template_string prefix", {
+    $documentation: "A templatestring with a prefix, such as String.raw`foobarbaz`",
+    $propdoc: {
+        template_string: "[AST_TemplateString] The template string",
+        prefix: "[AST_Node] The prefix, which will get called."
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function () {
+            this.prefix._walk(visitor);
+            this.template_string._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.template_string);
+        push(this.prefix);
+    },
+});
+
+var AST_TemplateString = DEFNODE("TemplateString", "segments", {
+    $documentation: "A template string literal",
+    $propdoc: {
+        segments: "[AST_Node*] One or more segments, starting with AST_TemplateSegment. AST_Node may follow AST_TemplateSegment, but each AST_Node must be followed by AST_TemplateSegment."
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.segments.forEach(function(seg) {
+                seg._walk(visitor);
+            });
+        });
+    },
+    _children_backwards(push) {
+        let i = this.segments.length;
+        while (i--) push(this.segments[i]);
+    }
+});
+
+var AST_TemplateSegment = DEFNODE("TemplateSegment", "value raw", {
+    $documentation: "A segment of a template string literal",
+    $propdoc: {
+        value: "Content of the segment",
+        raw: "Raw source of the segment",
+    }
+});
+
+/* -----[ JUMPS ]----- */
+
+var AST_Jump = DEFNODE("Jump", null, {
+    $documentation: "Base class for “jumps” (for now that's `return`, `throw`, `break` and `continue`)"
+}, AST_Statement);
+
+var AST_Exit = DEFNODE("Exit", "value", {
+    $documentation: "Base class for “exits” (`return` and `throw`)",
+    $propdoc: {
+        value: "[AST_Node?] the value returned or thrown by this statement; could be null for AST_Return"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, this.value && function() {
+            this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.value) push(this.value);
+    },
+}, AST_Jump);
+
+var AST_Return = DEFNODE("Return", null, {
+    $documentation: "A `return` statement"
+}, AST_Exit);
+
+var AST_Throw = DEFNODE("Throw", null, {
+    $documentation: "A `throw` statement"
+}, AST_Exit);
+
+var AST_LoopControl = DEFNODE("LoopControl", "label", {
+    $documentation: "Base class for loop control statements (`break` and `continue`)",
+    $propdoc: {
+        label: "[AST_LabelRef?] the label, or null if none",
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, this.label && function() {
+            this.label._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.label) push(this.label);
+    },
+}, AST_Jump);
+
+var AST_Break = DEFNODE("Break", null, {
+    $documentation: "A `break` statement"
+}, AST_LoopControl);
+
+var AST_Continue = DEFNODE("Continue", null, {
+    $documentation: "A `continue` statement"
+}, AST_LoopControl);
+
+var AST_Await = DEFNODE("Await", "expression", {
+    $documentation: "An `await` statement",
+    $propdoc: {
+        expression: "[AST_Node] the mandatory expression being awaited",
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_Yield = DEFNODE("Yield", "expression is_star", {
+    $documentation: "A `yield` statement",
+    $propdoc: {
+        expression: "[AST_Node?] the value returned or thrown by this statement; could be null (representing undefined) but only when is_star is set to false",
+        is_star: "[Boolean] Whether this is a yield or yield* statement"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, this.expression && function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.expression) push(this.expression);
+    }
+});
+
+/* -----[ IF ]----- */
+
+var AST_If = DEFNODE("If", "condition alternative", {
+    $documentation: "A `if` statement",
+    $propdoc: {
+        condition: "[AST_Node] the `if` condition",
+        alternative: "[AST_Statement?] the `else` part, or null if not present"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.condition._walk(visitor);
+            this.body._walk(visitor);
+            if (this.alternative) this.alternative._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.alternative) {
+            push(this.alternative);
+        }
+        push(this.body);
+        push(this.condition);
+    }
+}, AST_StatementWithBody);
+
+/* -----[ SWITCH ]----- */
+
+var AST_Switch = DEFNODE("Switch", "expression", {
+    $documentation: "A `switch` statement",
+    $propdoc: {
+        expression: "[AST_Node] the `switch` “discriminant”"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+        push(this.expression);
+    }
+}, AST_Block);
+
+var AST_SwitchBranch = DEFNODE("SwitchBranch", null, {
+    $documentation: "Base class for `switch` branches",
+}, AST_Block);
+
+var AST_Default = DEFNODE("Default", null, {
+    $documentation: "A `default` switch branch",
+}, AST_SwitchBranch);
+
+var AST_Case = DEFNODE("Case", "expression", {
+    $documentation: "A `case` switch branch",
+    $propdoc: {
+        expression: "[AST_Node] the `case` expression"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+        push(this.expression);
+    },
+}, AST_SwitchBranch);
+
+/* -----[ EXCEPTIONS ]----- */
+
+var AST_Try = DEFNODE("Try", "bcatch bfinally", {
+    $documentation: "A `try` statement",
+    $propdoc: {
+        bcatch: "[AST_Catch?] the catch block, or null if not present",
+        bfinally: "[AST_Finally?] the finally block, or null if not present"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            walk_body(this, visitor);
+            if (this.bcatch) this.bcatch._walk(visitor);
+            if (this.bfinally) this.bfinally._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.bfinally) push(this.bfinally);
+        if (this.bcatch) push(this.bcatch);
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+    },
+}, AST_Block);
+
+var AST_Catch = DEFNODE("Catch", "argname", {
+    $documentation: "A `catch` node; only makes sense as part of a `try` statement",
+    $propdoc: {
+        argname: "[AST_SymbolCatch|AST_Destructuring|AST_Expansion|AST_DefaultAssign] symbol for the exception"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.argname) this.argname._walk(visitor);
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+        if (this.argname) push(this.argname);
+    },
+}, AST_Block);
+
+var AST_Finally = DEFNODE("Finally", null, {
+    $documentation: "A `finally` node; only makes sense as part of a `try` statement"
+}, AST_Block);
+
+/* -----[ VAR/CONST ]----- */
+
+var AST_Definitions = DEFNODE("Definitions", "definitions", {
+    $documentation: "Base class for `var` or `const` nodes (variable declarations/initializations)",
+    $propdoc: {
+        definitions: "[AST_VarDef*] array of variable definitions"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            var definitions = this.definitions;
+            for (var i = 0, len = definitions.length; i < len; i++) {
+                definitions[i]._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        let i = this.definitions.length;
+        while (i--) push(this.definitions[i]);
+    },
+}, AST_Statement);
+
+var AST_Var = DEFNODE("Var", null, {
+    $documentation: "A `var` statement"
+}, AST_Definitions);
+
+var AST_Let = DEFNODE("Let", null, {
+    $documentation: "A `let` statement"
+}, AST_Definitions);
+
+var AST_Const = DEFNODE("Const", null, {
+    $documentation: "A `const` statement"
+}, AST_Definitions);
+
+var AST_VarDef = DEFNODE("VarDef", "name value", {
+    $documentation: "A variable declaration; only appears in a AST_Definitions node",
+    $propdoc: {
+        name: "[AST_Destructuring|AST_SymbolConst|AST_SymbolLet|AST_SymbolVar] name of the variable",
+        value: "[AST_Node?] initializer, or null of there's no initializer"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.name._walk(visitor);
+            if (this.value) this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.value) push(this.value);
+        push(this.name);
+    },
+});
+
+var AST_NameMapping = DEFNODE("NameMapping", "foreign_name name", {
+    $documentation: "The part of the export/import statement that declare names from a module.",
+    $propdoc: {
+        foreign_name: "[AST_SymbolExportForeign|AST_SymbolImportForeign] The name being exported/imported (as specified in the module)",
+        name: "[AST_SymbolExport|AST_SymbolImport] The name as it is visible to this module."
+    },
+    _walk: function (visitor) {
+        return visitor._visit(this, function() {
+            this.foreign_name._walk(visitor);
+            this.name._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.name);
+        push(this.foreign_name);
+    },
+});
+
+var AST_Import = DEFNODE("Import", "imported_name imported_names module_name assert_clause", {
+    $documentation: "An `import` statement",
+    $propdoc: {
+        imported_name: "[AST_SymbolImport] The name of the variable holding the module's default export.",
+        imported_names: "[AST_NameMapping*] The names of non-default imported variables",
+        module_name: "[AST_String] String literal describing where this module came from",
+        assert_clause: "[AST_Object?] The import assertion"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.imported_name) {
+                this.imported_name._walk(visitor);
+            }
+            if (this.imported_names) {
+                this.imported_names.forEach(function(name_import) {
+                    name_import._walk(visitor);
+                });
+            }
+            this.module_name._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.module_name);
+        if (this.imported_names) {
+            let i = this.imported_names.length;
+            while (i--) push(this.imported_names[i]);
+        }
+        if (this.imported_name) push(this.imported_name);
+    },
+});
+
+var AST_ImportMeta = DEFNODE("ImportMeta", null, {
+    $documentation: "A reference to import.meta",
+});
+
+var AST_Export = DEFNODE("Export", "exported_definition exported_value is_default exported_names module_name assert_clause", {
+    $documentation: "An `export` statement",
+    $propdoc: {
+        exported_definition: "[AST_Defun|AST_Definitions|AST_DefClass?] An exported definition",
+        exported_value: "[AST_Node?] An exported value",
+        exported_names: "[AST_NameMapping*?] List of exported names",
+        module_name: "[AST_String?] Name of the file to load exports from",
+        is_default: "[Boolean] Whether this is the default exported value of this module",
+        assert_clause: "[AST_Object?] The import assertion"
+    },
+    _walk: function (visitor) {
+        return visitor._visit(this, function () {
+            if (this.exported_definition) {
+                this.exported_definition._walk(visitor);
+            }
+            if (this.exported_value) {
+                this.exported_value._walk(visitor);
+            }
+            if (this.exported_names) {
+                this.exported_names.forEach(function(name_export) {
+                    name_export._walk(visitor);
+                });
+            }
+            if (this.module_name) {
+                this.module_name._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        if (this.module_name) push(this.module_name);
+        if (this.exported_names) {
+            let i = this.exported_names.length;
+            while (i--) push(this.exported_names[i]);
+        }
+        if (this.exported_value) push(this.exported_value);
+        if (this.exported_definition) push(this.exported_definition);
+    }
+}, AST_Statement);
+
+/* -----[ OTHER ]----- */
+
+var AST_Call = DEFNODE("Call", "expression args optional _annotations", {
+    $documentation: "A function call expression",
+    $propdoc: {
+        expression: "[AST_Node] expression to invoke as function",
+        args: "[AST_Node*] array of arguments",
+        optional: "[boolean] whether this is an optional call (IE ?.() )",
+        _annotations: "[number] bitfield containing information about the call"
+    },
+    initialize() {
+        if (this._annotations == null) this._annotations = 0;
+    },
+    _walk(visitor) {
+        return visitor._visit(this, function() {
+            var args = this.args;
+            for (var i = 0, len = args.length; i < len; i++) {
+                args[i]._walk(visitor);
+            }
+            this.expression._walk(visitor);  // TODO why do we need to crawl this last?
+        });
+    },
+    _children_backwards(push) {
+        let i = this.args.length;
+        while (i--) push(this.args[i]);
+        push(this.expression);
+    },
+});
+
+var AST_New = DEFNODE("New", null, {
+    $documentation: "An object instantiation.  Derives from a function call since it has exactly the same properties"
+}, AST_Call);
+
+var AST_Sequence = DEFNODE("Sequence", "expressions", {
+    $documentation: "A sequence expression (comma-separated expressions)",
+    $propdoc: {
+        expressions: "[AST_Node*] array of expressions (at least two)"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expressions.forEach(function(node) {
+                node._walk(visitor);
+            });
+        });
+    },
+    _children_backwards(push) {
+        let i = this.expressions.length;
+        while (i--) push(this.expressions[i]);
+    },
+});
+
+var AST_PropAccess = DEFNODE("PropAccess", "expression property optional", {
+    $documentation: "Base class for property access expressions, i.e. `a.foo` or `a[\"foo\"]`",
+    $propdoc: {
+        expression: "[AST_Node] the “container” expression",
+        property: "[AST_Node|string] the property to access.  For AST_Dot & AST_DotHash this is always a plain string, while for AST_Sub it's an arbitrary AST_Node",
+
+        optional: "[boolean] whether this is an optional property access (IE ?.)"
+    }
+});
+
+var AST_Dot = DEFNODE("Dot", "quote", {
+    $documentation: "A dotted property access expression",
+    $propdoc: {
+        quote: "[string] the original quote character when transformed from AST_Sub",
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+}, AST_PropAccess);
+
+var AST_DotHash = DEFNODE("DotHash", "", {
+    $documentation: "A dotted property access to a private property",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+}, AST_PropAccess);
+
+var AST_Sub = DEFNODE("Sub", null, {
+    $documentation: "Index-style property access, i.e. `a[\"foo\"]`",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            this.property._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.property);
+        push(this.expression);
+    },
+}, AST_PropAccess);
+
+var AST_Chain = DEFNODE("Chain", "expression", {
+    $documentation: "A chain expression like a?.b?.(c)?.[d]",
+    $propdoc: {
+        expression: "[AST_Call|AST_Dot|AST_DotHash|AST_Sub] chain element."
+    },
+    _walk: function (visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_Unary = DEFNODE("Unary", "operator expression", {
+    $documentation: "Base class for unary expressions",
+    $propdoc: {
+        operator: "[string] the operator",
+        expression: "[AST_Node] expression that this unary operator applies to"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_UnaryPrefix = DEFNODE("UnaryPrefix", null, {
+    $documentation: "Unary prefix expression, i.e. `typeof i` or `++i`"
+}, AST_Unary);
+
+var AST_UnaryPostfix = DEFNODE("UnaryPostfix", null, {
+    $documentation: "Unary postfix expression, i.e. `i++`"
+}, AST_Unary);
+
+var AST_Binary = DEFNODE("Binary", "operator left right", {
+    $documentation: "Binary expression, i.e. `a + b`",
+    $propdoc: {
+        left: "[AST_Node] left-hand side expression",
+        operator: "[string] the operator",
+        right: "[AST_Node] right-hand side expression"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.left._walk(visitor);
+            this.right._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.right);
+        push(this.left);
+    },
+});
+
+var AST_Conditional = DEFNODE("Conditional", "condition consequent alternative", {
+    $documentation: "Conditional expression using the ternary operator, i.e. `a ? b : c`",
+    $propdoc: {
+        condition: "[AST_Node]",
+        consequent: "[AST_Node]",
+        alternative: "[AST_Node]"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.condition._walk(visitor);
+            this.consequent._walk(visitor);
+            this.alternative._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.alternative);
+        push(this.consequent);
+        push(this.condition);
+    },
+});
+
+var AST_Assign = DEFNODE("Assign", "logical", {
+    $documentation: "An assignment expression — `a = b + 5`",
+    $propdoc: {
+        logical: "Whether it's a logical assignment"
+    }
+}, AST_Binary);
+
+var AST_DefaultAssign = DEFNODE("DefaultAssign", null, {
+    $documentation: "A default assignment expression like in `(a = 3) => a`"
+}, AST_Binary);
+
+/* -----[ LITERALS ]----- */
+
+var AST_Array = DEFNODE("Array", "elements", {
+    $documentation: "An array literal",
+    $propdoc: {
+        elements: "[AST_Node*] array of elements"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            var elements = this.elements;
+            for (var i = 0, len = elements.length; i < len; i++) {
+                elements[i]._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        let i = this.elements.length;
+        while (i--) push(this.elements[i]);
+    },
+});
+
+var AST_Object = DEFNODE("Object", "properties", {
+    $documentation: "An object literal",
+    $propdoc: {
+        properties: "[AST_ObjectProperty*] array of properties"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            var properties = this.properties;
+            for (var i = 0, len = properties.length; i < len; i++) {
+                properties[i]._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        let i = this.properties.length;
+        while (i--) push(this.properties[i]);
+    },
+});
+
+var AST_ObjectProperty = DEFNODE("ObjectProperty", "key value", {
+    $documentation: "Base class for literal object properties",
+    $propdoc: {
+        key: "[string|AST_Node] property name. For ObjectKeyVal this is a string. For getters, setters and computed property this is an AST_Node.",
+        value: "[AST_Node] property value.  For getters and setters this is an AST_Accessor."
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.key instanceof AST_Node)
+                this.key._walk(visitor);
+            this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.value);
+        if (this.key instanceof AST_Node) push(this.key);
+    }
+});
+
+var AST_ObjectKeyVal = DEFNODE("ObjectKeyVal", "quote", {
+    $documentation: "A key: value object property",
+    $propdoc: {
+        quote: "[string] the original quote character"
+    },
+    computed_key() {
+        return this.key instanceof AST_Node;
+    }
+}, AST_ObjectProperty);
+
+var AST_PrivateSetter = DEFNODE("PrivateSetter", "static", {
+    $propdoc: {
+        static: "[boolean] whether this is a static private setter"
+    },
+    $documentation: "A private setter property",
+    computed_key() {
+        return false;
+    }
+}, AST_ObjectProperty);
+
+var AST_PrivateGetter = DEFNODE("PrivateGetter", "static", {
+    $propdoc: {
+        static: "[boolean] whether this is a static private getter"
+    },
+    $documentation: "A private getter property",
+    computed_key() {
+        return false;
+    }
+}, AST_ObjectProperty);
+
+var AST_ObjectSetter = DEFNODE("ObjectSetter", "quote static", {
+    $propdoc: {
+        quote: "[string|undefined] the original quote character, if any",
+        static: "[boolean] whether this is a static setter (classes only)"
+    },
+    $documentation: "An object setter property",
+    computed_key() {
+        return !(this.key instanceof AST_SymbolMethod);
+    }
+}, AST_ObjectProperty);
+
+var AST_ObjectGetter = DEFNODE("ObjectGetter", "quote static", {
+    $propdoc: {
+        quote: "[string|undefined] the original quote character, if any",
+        static: "[boolean] whether this is a static getter (classes only)"
+    },
+    $documentation: "An object getter property",
+    computed_key() {
+        return !(this.key instanceof AST_SymbolMethod);
+    }
+}, AST_ObjectProperty);
+
+var AST_ConciseMethod = DEFNODE("ConciseMethod", "quote static is_generator async", {
+    $propdoc: {
+        quote: "[string|undefined] the original quote character, if any",
+        static: "[boolean] is this method static (classes only)",
+        is_generator: "[boolean] is this a generator method",
+        async: "[boolean] is this method async",
+    },
+    $documentation: "An ES6 concise method inside an object or class",
+    computed_key() {
+        return !(this.key instanceof AST_SymbolMethod);
+    }
+}, AST_ObjectProperty);
+
+var AST_PrivateMethod = DEFNODE("PrivateMethod", "", {
+    $documentation: "A private class method inside a class",
+}, AST_ConciseMethod);
+
+var AST_Class = DEFNODE("Class", "name extends properties", {
+    $propdoc: {
+        name: "[AST_SymbolClass|AST_SymbolDefClass?] optional class name.",
+        extends: "[AST_Node]? optional parent class",
+        properties: "[AST_ObjectProperty*] array of properties"
+    },
+    $documentation: "An ES6 class",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.name) {
+                this.name._walk(visitor);
+            }
+            if (this.extends) {
+                this.extends._walk(visitor);
+            }
+            this.properties.forEach((prop) => prop._walk(visitor));
+        });
+    },
+    _children_backwards(push) {
+        let i = this.properties.length;
+        while (i--) push(this.properties[i]);
+        if (this.extends) push(this.extends);
+        if (this.name) push(this.name);
+    },
+}, AST_Scope /* TODO a class might have a scope but it's not a scope */);
+
+var AST_ClassProperty = DEFNODE("ClassProperty", "static quote", {
+    $documentation: "A class property",
+    $propdoc: {
+        static: "[boolean] whether this is a static key",
+        quote: "[string] which quote is being used"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.key instanceof AST_Node)
+                this.key._walk(visitor);
+            if (this.value instanceof AST_Node)
+                this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.value instanceof AST_Node) push(this.value);
+        if (this.key instanceof AST_Node) push(this.key);
+    },
+    computed_key() {
+        return !(this.key instanceof AST_SymbolClassProperty);
+    }
+}, AST_ObjectProperty);
+
+var AST_ClassPrivateProperty = DEFNODE("ClassPrivateProperty", "", {
+    $documentation: "A class property for a private property",
+}, AST_ClassProperty);
+
+var AST_DefClass = DEFNODE("DefClass", null, {
+    $documentation: "A class definition",
+}, AST_Class);
+
+var AST_ClassExpression = DEFNODE("ClassExpression", null, {
+    $documentation: "A class expression."
+}, AST_Class);
+
+var AST_Symbol = DEFNODE("Symbol", "scope name thedef", {
+    $propdoc: {
+        name: "[string] name of this symbol",
+        scope: "[AST_Scope/S] the current scope (not necessarily the definition scope)",
+        thedef: "[SymbolDef/S] the definition of this symbol"
+    },
+    $documentation: "Base class for all symbols"
+});
+
+var AST_NewTarget = DEFNODE("NewTarget", null, {
+    $documentation: "A reference to new.target"
+});
+
+var AST_SymbolDeclaration = DEFNODE("SymbolDeclaration", "init", {
+    $documentation: "A declaration symbol (symbol in var/const, function name or argument, symbol in catch)",
+}, AST_Symbol);
+
+var AST_SymbolVar = DEFNODE("SymbolVar", null, {
+    $documentation: "Symbol defining a variable",
+}, AST_SymbolDeclaration);
+
+var AST_SymbolBlockDeclaration = DEFNODE("SymbolBlockDeclaration", null, {
+    $documentation: "Base class for block-scoped declaration symbols"
+}, AST_SymbolDeclaration);
+
+var AST_SymbolConst = DEFNODE("SymbolConst", null, {
+    $documentation: "A constant declaration"
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolLet = DEFNODE("SymbolLet", null, {
+    $documentation: "A block-scoped `let` declaration"
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolFunarg = DEFNODE("SymbolFunarg", null, {
+    $documentation: "Symbol naming a function argument",
+}, AST_SymbolVar);
+
+var AST_SymbolDefun = DEFNODE("SymbolDefun", null, {
+    $documentation: "Symbol defining a function",
+}, AST_SymbolDeclaration);
+
+var AST_SymbolMethod = DEFNODE("SymbolMethod", null, {
+    $documentation: "Symbol in an object defining a method",
+}, AST_Symbol);
+
+var AST_SymbolClassProperty = DEFNODE("SymbolClassProperty", null, {
+    $documentation: "Symbol for a class property",
+}, AST_Symbol);
+
+var AST_SymbolLambda = DEFNODE("SymbolLambda", null, {
+    $documentation: "Symbol naming a function expression",
+}, AST_SymbolDeclaration);
+
+var AST_SymbolDefClass = DEFNODE("SymbolDefClass", null, {
+    $documentation: "Symbol naming a class's name in a class declaration. Lexically scoped to its containing scope, and accessible within the class."
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolClass = DEFNODE("SymbolClass", null, {
+    $documentation: "Symbol naming a class's name. Lexically scoped to the class."
+}, AST_SymbolDeclaration);
+
+var AST_SymbolCatch = DEFNODE("SymbolCatch", null, {
+    $documentation: "Symbol naming the exception in catch",
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolImport = DEFNODE("SymbolImport", null, {
+    $documentation: "Symbol referring to an imported name",
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolImportForeign = DEFNODE("SymbolImportForeign", null, {
+    $documentation: "A symbol imported from a module, but it is defined in the other module, and its real name is irrelevant for this module's purposes",
+}, AST_Symbol);
+
+var AST_Label = DEFNODE("Label", "references", {
+    $documentation: "Symbol naming a label (declaration)",
+    $propdoc: {
+        references: "[AST_LoopControl*] a list of nodes referring to this label"
+    },
+    initialize: function() {
+        this.references = [];
+        this.thedef = this;
+    }
+}, AST_Symbol);
+
+var AST_SymbolRef = DEFNODE("SymbolRef", null, {
+    $documentation: "Reference to some symbol (not definition/declaration)",
+}, AST_Symbol);
+
+var AST_SymbolExport = DEFNODE("SymbolExport", null, {
+    $documentation: "Symbol referring to a name to export",
+}, AST_SymbolRef);
+
+var AST_SymbolExportForeign = DEFNODE("SymbolExportForeign", null, {
+    $documentation: "A symbol exported from this module, but it is used in the other module, and its real name is irrelevant for this module's purposes",
+}, AST_Symbol);
+
+var AST_LabelRef = DEFNODE("LabelRef", null, {
+    $documentation: "Reference to a label symbol",
+}, AST_Symbol);
+
+var AST_This = DEFNODE("This", null, {
+    $documentation: "The `this` symbol",
+}, AST_Symbol);
+
+var AST_Super = DEFNODE("Super", null, {
+    $documentation: "The `super` symbol",
+}, AST_This);
+
+var AST_Constant = DEFNODE("Constant", null, {
+    $documentation: "Base class for all constants",
+    getValue: function() {
+        return this.value;
+    }
+});
+
+var AST_String = DEFNODE("String", "value quote", {
+    $documentation: "A string literal",
+    $propdoc: {
+        value: "[string] the contents of this string",
+        quote: "[string] the original quote character"
+    }
+}, AST_Constant);
+
+var AST_Number = DEFNODE("Number", "value raw", {
+    $documentation: "A number literal",
+    $propdoc: {
+        value: "[number] the numeric value",
+        raw: "[string] numeric value as string"
+    }
+}, AST_Constant);
+
+var AST_BigInt = DEFNODE("BigInt", "value", {
+    $documentation: "A big int literal",
+    $propdoc: {
+        value: "[string] big int value"
+    }
+}, AST_Constant);
+
+var AST_RegExp = DEFNODE("RegExp", "value", {
+    $documentation: "A regexp literal",
+    $propdoc: {
+        value: "[RegExp] the actual regexp",
+    }
+}, AST_Constant);
+
+var AST_Atom = DEFNODE("Atom", null, {
+    $documentation: "Base class for atoms",
+}, AST_Constant);
+
+var AST_Null = DEFNODE("Null", null, {
+    $documentation: "The `null` atom",
+    value: null
+}, AST_Atom);
+
+var AST_NaN = DEFNODE("NaN", null, {
+    $documentation: "The impossible value",
+    value: 0/0
+}, AST_Atom);
+
+var AST_Undefined = DEFNODE("Undefined", null, {
+    $documentation: "The `undefined` value",
+    value: (function() {}())
+}, AST_Atom);
+
+var AST_Hole = DEFNODE("Hole", null, {
+    $documentation: "A hole in an array",
+    value: (function() {}())
+}, AST_Atom);
+
+var AST_Infinity = DEFNODE("Infinity", null, {
+    $documentation: "The `Infinity` value",
+    value: 1/0
+}, AST_Atom);
+
+var AST_Boolean = DEFNODE("Boolean", null, {
+    $documentation: "Base class for booleans",
+}, AST_Atom);
+
+var AST_False = DEFNODE("False", null, {
+    $documentation: "The `false` atom",
+    value: false
+}, AST_Boolean);
+
+var AST_True = DEFNODE("True", null, {
+    $documentation: "The `true` atom",
+    value: true
+}, AST_Boolean);
+
+/* -----[ Walk function ]---- */
+
+/**
+ * Walk nodes in depth-first search fashion.
+ * Callback can return `walk_abort` symbol to stop iteration.
+ * It can also return `true` to stop iteration just for child nodes.
+ * Iteration can be stopped and continued by passing the `to_visit` argument,
+ * which is given to the callback in the second argument.
+ **/
+function walk(node, cb, to_visit = [node]) {
+    const push = to_visit.push.bind(to_visit);
+    while (to_visit.length) {
+        const node = to_visit.pop();
+        const ret = cb(node, to_visit);
+
+        if (ret) {
+            if (ret === walk_abort) return true;
+            continue;
+        }
+
+        node._children_backwards(push);
+    }
+    return false;
+}
+
+function walk_parent(node, cb, initial_stack) {
+    const to_visit = [node];
+    const push = to_visit.push.bind(to_visit);
+    const stack = initial_stack ? initial_stack.slice() : [];
+    const parent_pop_indices = [];
+
+    let current;
+
+    const info = {
+        parent: (n = 0) => {
+            if (n === -1) {
+                return current;
+            }
+
+            // [ p1 p0 ] [ 1 0 ]
+            if (initial_stack && n >= stack.length) {
+                n -= stack.length;
+                return initial_stack[
+                    initial_stack.length - (n + 1)
+                ];
+            }
+
+            return stack[stack.length - (1 + n)];
+        },
+    };
+
+    while (to_visit.length) {
+        current = to_visit.pop();
+
+        while (
+            parent_pop_indices.length &&
+            to_visit.length == parent_pop_indices[parent_pop_indices.length - 1]
+        ) {
+            stack.pop();
+            parent_pop_indices.pop();
+        }
+
+        const ret = cb(current, info);
+
+        if (ret) {
+            if (ret === walk_abort) return true;
+            continue;
+        }
+
+        const visit_length = to_visit.length;
+
+        current._children_backwards(push);
+
+        // Push only if we're going to traverse the children
+        if (to_visit.length > visit_length) {
+            stack.push(current);
+            parent_pop_indices.push(visit_length - 1);
+        }
+    }
+
+    return false;
+}
+
+const walk_abort = Symbol("abort walk");
+
+/* -----[ TreeWalker ]----- */
+
+class TreeWalker {
+    constructor(callback) {
+        this.visit = callback;
+        this.stack = [];
+        this.directives = Object.create(null);
+    }
+
+    _visit(node, descend) {
+        this.push(node);
+        var ret = this.visit(node, descend ? function() {
+            descend.call(node);
+        } : noop);
+        if (!ret && descend) {
+            descend.call(node);
+        }
+        this.pop();
+        return ret;
+    }
+
+    parent(n) {
+        return this.stack[this.stack.length - 2 - (n || 0)];
+    }
+
+    push(node) {
+        if (node instanceof AST_Lambda) {
+            this.directives = Object.create(this.directives);
+        } else if (node instanceof AST_Directive && !this.directives[node.value]) {
+            this.directives[node.value] = node;
+        } else if (node instanceof AST_Class) {
+            this.directives = Object.create(this.directives);
+            if (!this.directives["use strict"]) {
+                this.directives["use strict"] = node;
+            }
+        }
+        this.stack.push(node);
+    }
+
+    pop() {
+        var node = this.stack.pop();
+        if (node instanceof AST_Lambda || node instanceof AST_Class) {
+            this.directives = Object.getPrototypeOf(this.directives);
+        }
+    }
+
+    self() {
+        return this.stack[this.stack.length - 1];
+    }
+
+    find_parent(type) {
+        var stack = this.stack;
+        for (var i = stack.length; --i >= 0;) {
+            var x = stack[i];
+            if (x instanceof type) return x;
+        }
+    }
+
+    has_directive(type) {
+        var dir = this.directives[type];
+        if (dir) return dir;
+        var node = this.stack[this.stack.length - 1];
+        if (node instanceof AST_Scope && node.body) {
+            for (var i = 0; i < node.body.length; ++i) {
+                var st = node.body[i];
+                if (!(st instanceof AST_Directive)) break;
+                if (st.value == type) return st;
+            }
+        }
+    }
+
+    loopcontrol_target(node) {
+        var stack = this.stack;
+        if (node.label) for (var i = stack.length; --i >= 0;) {
+            var x = stack[i];
+            if (x instanceof AST_LabeledStatement && x.label.name == node.label.name)
+                return x.body;
+        } else for (var i = stack.length; --i >= 0;) {
+            var x = stack[i];
+            if (x instanceof AST_IterationStatement
+                || node instanceof AST_Break && x instanceof AST_Switch)
+                return x;
+        }
+    }
+}
+
+// Tree transformer helpers.
+class TreeTransformer extends TreeWalker {
+    constructor(before, after) {
+        super();
+        this.before = before;
+        this.after = after;
+    }
+}
+
+const _PURE     = 0b00000001;
+const _INLINE   = 0b00000010;
+const _NOINLINE = 0b00000100;
+
+var ast = /*#__PURE__*/Object.freeze({
+__proto__: null,
+AST_Accessor: AST_Accessor,
+AST_Array: AST_Array,
+AST_Arrow: AST_Arrow,
+AST_Assign: AST_Assign,
+AST_Atom: AST_Atom,
+AST_Await: AST_Await,
+AST_BigInt: AST_BigInt,
+AST_Binary: AST_Binary,
+AST_Block: AST_Block,
+AST_BlockStatement: AST_BlockStatement,
+AST_Boolean: AST_Boolean,
+AST_Break: AST_Break,
+AST_Call: AST_Call,
+AST_Case: AST_Case,
+AST_Catch: AST_Catch,
+AST_Chain: AST_Chain,
+AST_Class: AST_Class,
+AST_ClassExpression: AST_ClassExpression,
+AST_ClassPrivateProperty: AST_ClassPrivateProperty,
+AST_ClassProperty: AST_ClassProperty,
+AST_ConciseMethod: AST_ConciseMethod,
+AST_Conditional: AST_Conditional,
+AST_Const: AST_Const,
+AST_Constant: AST_Constant,
+AST_Continue: AST_Continue,
+AST_Debugger: AST_Debugger,
+AST_Default: AST_Default,
+AST_DefaultAssign: AST_DefaultAssign,
+AST_DefClass: AST_DefClass,
+AST_Definitions: AST_Definitions,
+AST_Defun: AST_Defun,
+AST_Destructuring: AST_Destructuring,
+AST_Directive: AST_Directive,
+AST_Do: AST_Do,
+AST_Dot: AST_Dot,
+AST_DotHash: AST_DotHash,
+AST_DWLoop: AST_DWLoop,
+AST_EmptyStatement: AST_EmptyStatement,
+AST_Exit: AST_Exit,
+AST_Expansion: AST_Expansion,
+AST_Export: AST_Export,
+AST_False: AST_False,
+AST_Finally: AST_Finally,
+AST_For: AST_For,
+AST_ForIn: AST_ForIn,
+AST_ForOf: AST_ForOf,
+AST_Function: AST_Function,
+AST_Hole: AST_Hole,
+AST_If: AST_If,
+AST_Import: AST_Import,
+AST_ImportMeta: AST_ImportMeta,
+AST_Infinity: AST_Infinity,
+AST_IterationStatement: AST_IterationStatement,
+AST_Jump: AST_Jump,
+AST_Label: AST_Label,
+AST_LabeledStatement: AST_LabeledStatement,
+AST_LabelRef: AST_LabelRef,
+AST_Lambda: AST_Lambda,
+AST_Let: AST_Let,
+AST_LoopControl: AST_LoopControl,
+AST_NameMapping: AST_NameMapping,
+AST_NaN: AST_NaN,
+AST_New: AST_New,
+AST_NewTarget: AST_NewTarget,
+AST_Node: AST_Node,
+AST_Null: AST_Null,
+AST_Number: AST_Number,
+AST_Object: AST_Object,
+AST_ObjectGetter: AST_ObjectGetter,
+AST_ObjectKeyVal: AST_ObjectKeyVal,
+AST_ObjectProperty: AST_ObjectProperty,
+AST_ObjectSetter: AST_ObjectSetter,
+AST_PrefixedTemplateString: AST_PrefixedTemplateString,
+AST_PrivateGetter: AST_PrivateGetter,
+AST_PrivateMethod: AST_PrivateMethod,
+AST_PrivateSetter: AST_PrivateSetter,
+AST_PropAccess: AST_PropAccess,
+AST_RegExp: AST_RegExp,
+AST_Return: AST_Return,
+AST_Scope: AST_Scope,
+AST_Sequence: AST_Sequence,
+AST_SimpleStatement: AST_SimpleStatement,
+AST_Statement: AST_Statement,
+AST_StatementWithBody: AST_StatementWithBody,
+AST_String: AST_String,
+AST_Sub: AST_Sub,
+AST_Super: AST_Super,
+AST_Switch: AST_Switch,
+AST_SwitchBranch: AST_SwitchBranch,
+AST_Symbol: AST_Symbol,
+AST_SymbolBlockDeclaration: AST_SymbolBlockDeclaration,
+AST_SymbolCatch: AST_SymbolCatch,
+AST_SymbolClass: AST_SymbolClass,
+AST_SymbolClassProperty: AST_SymbolClassProperty,
+AST_SymbolConst: AST_SymbolConst,
+AST_SymbolDeclaration: AST_SymbolDeclaration,
+AST_SymbolDefClass: AST_SymbolDefClass,
+AST_SymbolDefun: AST_SymbolDefun,
+AST_SymbolExport: AST_SymbolExport,
+AST_SymbolExportForeign: AST_SymbolExportForeign,
+AST_SymbolFunarg: AST_SymbolFunarg,
+AST_SymbolImport: AST_SymbolImport,
+AST_SymbolImportForeign: AST_SymbolImportForeign,
+AST_SymbolLambda: AST_SymbolLambda,
+AST_SymbolLet: AST_SymbolLet,
+AST_SymbolMethod: AST_SymbolMethod,
+AST_SymbolRef: AST_SymbolRef,
+AST_SymbolVar: AST_SymbolVar,
+AST_TemplateSegment: AST_TemplateSegment,
+AST_TemplateString: AST_TemplateString,
+AST_This: AST_This,
+AST_Throw: AST_Throw,
+AST_Token: AST_Token,
+AST_Toplevel: AST_Toplevel,
+AST_True: AST_True,
+AST_Try: AST_Try,
+AST_Unary: AST_Unary,
+AST_UnaryPostfix: AST_UnaryPostfix,
+AST_UnaryPrefix: AST_UnaryPrefix,
+AST_Undefined: AST_Undefined,
+AST_Var: AST_Var,
+AST_VarDef: AST_VarDef,
+AST_While: AST_While,
+AST_With: AST_With,
+AST_Yield: AST_Yield,
+TreeTransformer: TreeTransformer,
+TreeWalker: TreeWalker,
+walk: walk,
+walk_abort: walk_abort,
+walk_body: walk_body,
+walk_parent: walk_parent,
+_INLINE: _INLINE,
+_NOINLINE: _NOINLINE,
+_PURE: _PURE
+});
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+function def_transform(node, descend) {
+    node.DEFMETHOD("transform", function(tw, in_list) {
+        let transformed = undefined;
+        tw.push(this);
+        if (tw.before) transformed = tw.before(this, descend, in_list);
+        if (transformed === undefined) {
+            transformed = this;
+            descend(transformed, tw);
+            if (tw.after) {
+                const after_ret = tw.after(transformed, in_list);
+                if (after_ret !== undefined) transformed = after_ret;
+            }
+        }
+        tw.pop();
+        return transformed;
+    });
+}
+
+function do_list(list, tw) {
+    return MAP(list, function(node) {
+        return node.transform(tw, true);
+    });
+}
+
+def_transform(AST_Node, noop);
+
+def_transform(AST_LabeledStatement, function(self, tw) {
+    self.label = self.label.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_SimpleStatement, function(self, tw) {
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_Block, function(self, tw) {
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Do, function(self, tw) {
+    self.body = self.body.transform(tw);
+    self.condition = self.condition.transform(tw);
+});
+
+def_transform(AST_While, function(self, tw) {
+    self.condition = self.condition.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_For, function(self, tw) {
+    if (self.init) self.init = self.init.transform(tw);
+    if (self.condition) self.condition = self.condition.transform(tw);
+    if (self.step) self.step = self.step.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_ForIn, function(self, tw) {
+    self.init = self.init.transform(tw);
+    self.object = self.object.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_With, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_Exit, function(self, tw) {
+    if (self.value) self.value = self.value.transform(tw);
+});
+
+def_transform(AST_LoopControl, function(self, tw) {
+    if (self.label) self.label = self.label.transform(tw);
+});
+
+def_transform(AST_If, function(self, tw) {
+    self.condition = self.condition.transform(tw);
+    self.body = self.body.transform(tw);
+    if (self.alternative) self.alternative = self.alternative.transform(tw);
+});
+
+def_transform(AST_Switch, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Case, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Try, function(self, tw) {
+    self.body = do_list(self.body, tw);
+    if (self.bcatch) self.bcatch = self.bcatch.transform(tw);
+    if (self.bfinally) self.bfinally = self.bfinally.transform(tw);
+});
+
+def_transform(AST_Catch, function(self, tw) {
+    if (self.argname) self.argname = self.argname.transform(tw);
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Definitions, function(self, tw) {
+    self.definitions = do_list(self.definitions, tw);
+});
+
+def_transform(AST_VarDef, function(self, tw) {
+    self.name = self.name.transform(tw);
+    if (self.value) self.value = self.value.transform(tw);
+});
+
+def_transform(AST_Destructuring, function(self, tw) {
+    self.names = do_list(self.names, tw);
+});
+
+def_transform(AST_Lambda, function(self, tw) {
+    if (self.name) self.name = self.name.transform(tw);
+    self.argnames = do_list(self.argnames, tw);
+    if (self.body instanceof AST_Node) {
+        self.body = self.body.transform(tw);
+    } else {
+        self.body = do_list(self.body, tw);
+    }
+});
+
+def_transform(AST_Call, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.args = do_list(self.args, tw);
+});
+
+def_transform(AST_Sequence, function(self, tw) {
+    const result = do_list(self.expressions, tw);
+    self.expressions = result.length
+        ? result
+        : [new AST_Number({ value: 0 })];
+});
+
+def_transform(AST_PropAccess, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Sub, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.property = self.property.transform(tw);
+});
+
+def_transform(AST_Chain, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Yield, function(self, tw) {
+    if (self.expression) self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Await, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Unary, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Binary, function(self, tw) {
+    self.left = self.left.transform(tw);
+    self.right = self.right.transform(tw);
+});
+
+def_transform(AST_Conditional, function(self, tw) {
+    self.condition = self.condition.transform(tw);
+    self.consequent = self.consequent.transform(tw);
+    self.alternative = self.alternative.transform(tw);
+});
+
+def_transform(AST_Array, function(self, tw) {
+    self.elements = do_list(self.elements, tw);
+});
+
+def_transform(AST_Object, function(self, tw) {
+    self.properties = do_list(self.properties, tw);
+});
+
+def_transform(AST_ObjectProperty, function(self, tw) {
+    if (self.key instanceof AST_Node) {
+        self.key = self.key.transform(tw);
+    }
+    if (self.value) self.value = self.value.transform(tw);
+});
+
+def_transform(AST_Class, function(self, tw) {
+    if (self.name) self.name = self.name.transform(tw);
+    if (self.extends) self.extends = self.extends.transform(tw);
+    self.properties = do_list(self.properties, tw);
+});
+
+def_transform(AST_Expansion, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_NameMapping, function(self, tw) {
+    self.foreign_name = self.foreign_name.transform(tw);
+    self.name = self.name.transform(tw);
+});
+
+def_transform(AST_Import, function(self, tw) {
+    if (self.imported_name) self.imported_name = self.imported_name.transform(tw);
+    if (self.imported_names) do_list(self.imported_names, tw);
+    self.module_name = self.module_name.transform(tw);
+});
+
+def_transform(AST_Export, function(self, tw) {
+    if (self.exported_definition) self.exported_definition = self.exported_definition.transform(tw);
+    if (self.exported_value) self.exported_value = self.exported_value.transform(tw);
+    if (self.exported_names) do_list(self.exported_names, tw);
+    if (self.module_name) self.module_name = self.module_name.transform(tw);
+});
+
+def_transform(AST_TemplateString, function(self, tw) {
+    self.segments = do_list(self.segments, tw);
+});
+
+def_transform(AST_PrefixedTemplateString, function(self, tw) {
+    self.prefix = self.prefix.transform(tw);
+    self.template_string = self.template_string.transform(tw);
+});
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+(function() {
+
+    var normalize_directives = function(body) {
+        var in_directive = true;
+
+        for (var i = 0; i < body.length; i++) {
+            if (in_directive && body[i] instanceof AST_Statement && body[i].body instanceof AST_String) {
+                body[i] = new AST_Directive({
+                    start: body[i].start,
+                    end: body[i].end,
+                    value: body[i].body.value
+                });
+            } else if (in_directive && !(body[i] instanceof AST_Statement && body[i].body instanceof AST_String)) {
+                in_directive = false;
+            }
+        }
+
+        return body;
+    };
+
+    const assert_clause_from_moz = (assertions) => {
+        if (assertions && assertions.length > 0) {
+            return new AST_Object({
+                start: my_start_token(assertions),
+                end: my_end_token(assertions),
+                properties: assertions.map((assertion_kv) =>
+                    new AST_ObjectKeyVal({
+                        start: my_start_token(assertion_kv),
+                        end: my_end_token(assertion_kv),
+                        key: assertion_kv.key.name || assertion_kv.key.value,
+                        value: from_moz(assertion_kv.value)
+                    })
+                )
+            });
+        }
+        return null;
+    };
+
+    var MOZ_TO_ME = {
+        Program: function(M) {
+            return new AST_Toplevel({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                body: normalize_directives(M.body.map(from_moz))
+            });
+        },
+        ArrayPattern: function(M) {
+            return new AST_Destructuring({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                names: M.elements.map(function(elm) {
+                    if (elm === null) {
+                        return new AST_Hole();
+                    }
+                    return from_moz(elm);
+                }),
+                is_array: true
+            });
+        },
+        ObjectPattern: function(M) {
+            return new AST_Destructuring({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                names: M.properties.map(from_moz),
+                is_array: false
+            });
+        },
+        AssignmentPattern: function(M) {
+            return new AST_DefaultAssign({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                left: from_moz(M.left),
+                operator: "=",
+                right: from_moz(M.right)
+            });
+        },
+        SpreadElement: function(M) {
+            return new AST_Expansion({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                expression: from_moz(M.argument)
+            });
+        },
+        RestElement: function(M) {
+            return new AST_Expansion({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                expression: from_moz(M.argument)
+            });
+        },
+        TemplateElement: function(M) {
+            return new AST_TemplateSegment({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                value: M.value.cooked,
+                raw: M.value.raw
+            });
+        },
+        TemplateLiteral: function(M) {
+            var segments = [];
+            for (var i = 0; i < M.quasis.length; i++) {
+                segments.push(from_moz(M.quasis[i]));
+                if (M.expressions[i]) {
+                    segments.push(from_moz(M.expressions[i]));
+                }
+            }
+            return new AST_TemplateString({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                segments: segments
+            });
+        },
+        TaggedTemplateExpression: function(M) {
+            return new AST_PrefixedTemplateString({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                template_string: from_moz(M.quasi),
+                prefix: from_moz(M.tag)
+            });
+        },
+        FunctionDeclaration: function(M) {
+            return new AST_Defun({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                name: from_moz(M.id),
+                argnames: M.params.map(from_moz),
+                is_generator: M.generator,
+                async: M.async,
+                body: normalize_directives(from_moz(M.body).body)
+            });
+        },
+        FunctionExpression: function(M) {
+            return new AST_Function({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                name: from_moz(M.id),
+                argnames: M.params.map(from_moz),
+                is_generator: M.generator,
+                async: M.async,
+                body: normalize_directives(from_moz(M.body).body)
+            });
+        },
+        ArrowFunctionExpression: function(M) {
+            const body = M.body.type === "BlockStatement"
+                ? from_moz(M.body).body
+                : [make_node(AST_Return, {}, { value: from_moz(M.body) })];
+            return new AST_Arrow({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                argnames: M.params.map(from_moz),
+                body,
+                async: M.async,
+            });
+        },
+        ExpressionStatement: function(M) {
+            return new AST_SimpleStatement({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                body: from_moz(M.expression)
+            });
+        },
+        TryStatement: function(M) {
+            var handlers = M.handlers || [M.handler];
+            if (handlers.length > 1 || M.guardedHandlers && M.guardedHandlers.length) {
+                throw new Error("Multiple catch clauses are not supported.");
+            }
+            return new AST_Try({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                body     : from_moz(M.block).body,
+                bcatch   : from_moz(handlers[0]),
+                bfinally : M.finalizer ? new AST_Finally(from_moz(M.finalizer)) : null
+            });
+        },
+        Property: function(M) {
+            var key = M.key;
+            var args = {
+                start    : my_start_token(key || M.value),
+                end      : my_end_token(M.value),
+                key      : key.type == "Identifier" ? key.name : key.value,
+                value    : from_moz(M.value)
+            };
+            if (M.computed) {
+                args.key = from_moz(M.key);
+            }
+            if (M.method) {
+                args.is_generator = M.value.generator;
+                args.async = M.value.async;
+                if (!M.computed) {
+                    args.key = new AST_SymbolMethod({ name: args.key });
+                } else {
+                    args.key = from_moz(M.key);
+                }
+                return new AST_ConciseMethod(args);
+            }
+            if (M.kind == "init") {
+                if (key.type != "Identifier" && key.type != "Literal") {
+                    args.key = from_moz(key);
+                }
+                return new AST_ObjectKeyVal(args);
+            }
+            if (typeof args.key === "string" || typeof args.key === "number") {
+                args.key = new AST_SymbolMethod({
+                    name: args.key
+                });
+            }
+            args.value = new AST_Accessor(args.value);
+            if (M.kind == "get") return new AST_ObjectGetter(args);
+            if (M.kind == "set") return new AST_ObjectSetter(args);
+            if (M.kind == "method") {
+                args.async = M.value.async;
+                args.is_generator = M.value.generator;
+                args.quote = M.computed ? "\"" : null;
+                return new AST_ConciseMethod(args);
+            }
+        },
+        MethodDefinition: function(M) {
+            var args = {
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                key      : M.computed ? from_moz(M.key) : new AST_SymbolMethod({ name: M.key.name || M.key.value }),
+                value    : from_moz(M.value),
+                static   : M.static,
+            };
+            if (M.kind == "get") {
+                return new AST_ObjectGetter(args);
+            }
+            if (M.kind == "set") {
+                return new AST_ObjectSetter(args);
+            }
+            args.is_generator = M.value.generator;
+            args.async = M.value.async;
+            return new AST_ConciseMethod(args);
+        },
+        FieldDefinition: function(M) {
+            let key;
+            if (M.computed) {
+                key = from_moz(M.key);
+            } else {
+                if (M.key.type !== "Identifier") throw new Error("Non-Identifier key in FieldDefinition");
+                key = from_moz(M.key);
+            }
+            return new AST_ClassProperty({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                key,
+                value    : from_moz(M.value),
+                static   : M.static,
+            });
+        },
+        PropertyDefinition: function(M) {
+            let key;
+            if (M.computed) {
+                key = from_moz(M.key);
+            } else {
+                if (M.key.type !== "Identifier") throw new Error("Non-Identifier key in PropertyDefinition");
+                key = from_moz(M.key);
+            }
+
+            return new AST_ClassProperty({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                key,
+                value    : from_moz(M.value),
+                static   : M.static,
+            });
+        },
+        ArrayExpression: function(M) {
+            return new AST_Array({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                elements : M.elements.map(function(elem) {
+                    return elem === null ? new AST_Hole() : from_moz(elem);
+                })
+            });
+        },
+        ObjectExpression: function(M) {
+            return new AST_Object({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                properties : M.properties.map(function(prop) {
+                    if (prop.type === "SpreadElement") {
+                        return from_moz(prop);
+                    }
+                    prop.type = "Property";
+                    return from_moz(prop);
+                })
+            });
+        },
+        SequenceExpression: function(M) {
+            return new AST_Sequence({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                expressions: M.expressions.map(from_moz)
+            });
+        },
+        MemberExpression: function(M) {
+            return new (M.computed ? AST_Sub : AST_Dot)({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                property   : M.computed ? from_moz(M.property) : M.property.name,
+                expression : from_moz(M.object),
+                optional   : M.optional || false
+            });
+        },
+        ChainExpression: function(M) {
+            return new AST_Chain({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                expression : from_moz(M.expression)
+            });
+        },
+        SwitchCase: function(M) {
+            return new (M.test ? AST_Case : AST_Default)({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                expression : from_moz(M.test),
+                body       : M.consequent.map(from_moz)
+            });
+        },
+        VariableDeclaration: function(M) {
+            return new (M.kind === "const" ? AST_Const :
+                        M.kind === "let" ? AST_Let : AST_Var)({
+                start       : my_start_token(M),
+                end         : my_end_token(M),
+                definitions : M.declarations.map(from_moz)
+            });
+        },
+
+        ImportDeclaration: function(M) {
+            var imported_name = null;
+            var imported_names = null;
+            M.specifiers.forEach(function (specifier) {
+                if (specifier.type === "ImportSpecifier") {
+                    if (!imported_names) { imported_names = []; }
+                    imported_names.push(new AST_NameMapping({
+                        start: my_start_token(specifier),
+                        end: my_end_token(specifier),
+                        foreign_name: from_moz(specifier.imported),
+                        name: from_moz(specifier.local)
+                    }));
+                } else if (specifier.type === "ImportDefaultSpecifier") {
+                    imported_name = from_moz(specifier.local);
+                } else if (specifier.type === "ImportNamespaceSpecifier") {
+                    if (!imported_names) { imported_names = []; }
+                    imported_names.push(new AST_NameMapping({
+                        start: my_start_token(specifier),
+                        end: my_end_token(specifier),
+                        foreign_name: new AST_SymbolImportForeign({ name: "*" }),
+                        name: from_moz(specifier.local)
+                    }));
+                }
+            });
+            return new AST_Import({
+                start       : my_start_token(M),
+                end         : my_end_token(M),
+                imported_name: imported_name,
+                imported_names : imported_names,
+                module_name : from_moz(M.source),
+                assert_clause: assert_clause_from_moz(M.assertions)
+            });
+        },
+        ExportAllDeclaration: function(M) {
+            return new AST_Export({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                exported_names: [
+                    new AST_NameMapping({
+                        name: new AST_SymbolExportForeign({ name: "*" }),
+                        foreign_name: new AST_SymbolExportForeign({ name: "*" })
+                    })
+                ],
+                module_name: from_moz(M.source),
+                assert_clause: assert_clause_from_moz(M.assertions)
+            });
+        },
+        ExportNamedDeclaration: function(M) {
+            return new AST_Export({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                exported_definition: from_moz(M.declaration),
+                exported_names: M.specifiers && M.specifiers.length ? M.specifiers.map(function (specifier) {
+                    return new AST_NameMapping({
+                        foreign_name: from_moz(specifier.exported),
+                        name: from_moz(specifier.local)
+                    });
+                }) : null,
+                module_name: from_moz(M.source),
+                assert_clause: assert_clause_from_moz(M.assertions)
+            });
+        },
+        ExportDefaultDeclaration: function(M) {
+            return new AST_Export({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                exported_value: from_moz(M.declaration),
+                is_default: true
+            });
+        },
+        Literal: function(M) {
+            var val = M.value, args = {
+                start  : my_start_token(M),
+                end    : my_end_token(M)
+            };
+            var rx = M.regex;
+            if (rx && rx.pattern) {
+                // RegExpLiteral as per ESTree AST spec
+                args.value = {
+                    source: rx.pattern,
+                    flags: rx.flags
+                };
+                return new AST_RegExp(args);
+            } else if (rx) {
+                // support legacy RegExp
+                const rx_source = M.raw || val;
+                const match = rx_source.match(/^\/(.*)\/(\w*)$/);
+                if (!match) throw new Error("Invalid regex source " + rx_source);
+                const [_, source, flags] = match;
+                args.value = { source, flags };
+                return new AST_RegExp(args);
+            }
+            if (val === null) return new AST_Null(args);
+            switch (typeof val) {
+              case "string":
+                args.value = val;
+                return new AST_String(args);
+              case "number":
+                args.value = val;
+                args.raw = M.raw || val.toString();
+                return new AST_Number(args);
+              case "boolean":
+                return new (val ? AST_True : AST_False)(args);
+            }
+        },
+        MetaProperty: function(M) {
+            if (M.meta.name === "new" && M.property.name === "target") {
+                return new AST_NewTarget({
+                    start: my_start_token(M),
+                    end: my_end_token(M)
+                });
+            } else if (M.meta.name === "import" && M.property.name === "meta") {
+                return new AST_ImportMeta({
+                    start: my_start_token(M),
+                    end: my_end_token(M)
+                });
+            }
+        },
+        Identifier: function(M) {
+            var p = FROM_MOZ_STACK[FROM_MOZ_STACK.length - 2];
+            return new (  p.type == "LabeledStatement" ? AST_Label
+                        : p.type == "VariableDeclarator" && p.id === M ? (p.kind == "const" ? AST_SymbolConst : p.kind == "let" ? AST_SymbolLet : AST_SymbolVar)
+                        : /Import.*Specifier/.test(p.type) ? (p.local === M ? AST_SymbolImport : AST_SymbolImportForeign)
+                        : p.type == "ExportSpecifier" ? (p.local === M ? AST_SymbolExport : AST_SymbolExportForeign)
+                        : p.type == "FunctionExpression" ? (p.id === M ? AST_SymbolLambda : AST_SymbolFunarg)
+                        : p.type == "FunctionDeclaration" ? (p.id === M ? AST_SymbolDefun : AST_SymbolFunarg)
+                        : p.type == "ArrowFunctionExpression" ? (p.params.includes(M)) ? AST_SymbolFunarg : AST_SymbolRef
+                        : p.type == "ClassExpression" ? (p.id === M ? AST_SymbolClass : AST_SymbolRef)
+                        : p.type == "Property" ? (p.key === M && p.computed || p.value === M ? AST_SymbolRef : AST_SymbolMethod)
+                        : p.type == "PropertyDefinition" || p.type === "FieldDefinition" ? (p.key === M && p.computed || p.value === M ? AST_SymbolRef : AST_SymbolClassProperty)
+                        : p.type == "ClassDeclaration" ? (p.id === M ? AST_SymbolDefClass : AST_SymbolRef)
+                        : p.type == "MethodDefinition" ? (p.computed ? AST_SymbolRef : AST_SymbolMethod)
+                        : p.type == "CatchClause" ? AST_SymbolCatch
+                        : p.type == "BreakStatement" || p.type == "ContinueStatement" ? AST_LabelRef
+                        : AST_SymbolRef)({
+                            start : my_start_token(M),
+                            end   : my_end_token(M),
+                            name  : M.name
+                        });
+        },
+        BigIntLiteral(M) {
+            return new AST_BigInt({
+                start : my_start_token(M),
+                end   : my_end_token(M),
+                value : M.value
+            });
+        }
+    };
+
+    MOZ_TO_ME.UpdateExpression =
+    MOZ_TO_ME.UnaryExpression = function To_Moz_Unary(M) {
+        var prefix = "prefix" in M ? M.prefix
+            : M.type == "UnaryExpression" ? true : false;
+        return new (prefix ? AST_UnaryPrefix : AST_UnaryPostfix)({
+            start      : my_start_token(M),
+            end        : my_end_token(M),
+            operator   : M.operator,
+            expression : from_moz(M.argument)
+        });
+    };
+
+    MOZ_TO_ME.ClassDeclaration =
+    MOZ_TO_ME.ClassExpression = function From_Moz_Class(M) {
+        return new (M.type === "ClassDeclaration" ? AST_DefClass : AST_ClassExpression)({
+            start    : my_start_token(M),
+            end      : my_end_token(M),
+            name     : from_moz(M.id),
+            extends  : from_moz(M.superClass),
+            properties: M.body.body.map(from_moz)
+        });
+    };
+
+    map("EmptyStatement", AST_EmptyStatement);
+    map("BlockStatement", AST_BlockStatement, "body@body");
+    map("IfStatement", AST_If, "test>condition, consequent>body, alternate>alternative");
+    map("LabeledStatement", AST_LabeledStatement, "label>label, body>body");
+    map("BreakStatement", AST_Break, "label>label");
+    map("ContinueStatement", AST_Continue, "label>label");
+    map("WithStatement", AST_With, "object>expression, body>body");
+    map("SwitchStatement", AST_Switch, "discriminant>expression, cases@body");
+    map("ReturnStatement", AST_Return, "argument>value");
+    map("ThrowStatement", AST_Throw, "argument>value");
+    map("WhileStatement", AST_While, "test>condition, body>body");
+    map("DoWhileStatement", AST_Do, "test>condition, body>body");
+    map("ForStatement", AST_For, "init>init, test>condition, update>step, body>body");
+    map("ForInStatement", AST_ForIn, "left>init, right>object, body>body");
+    map("ForOfStatement", AST_ForOf, "left>init, right>object, body>body, await=await");
+    map("AwaitExpression", AST_Await, "argument>expression");
+    map("YieldExpression", AST_Yield, "argument>expression, delegate=is_star");
+    map("DebuggerStatement", AST_Debugger);
+    map("VariableDeclarator", AST_VarDef, "id>name, init>value");
+    map("CatchClause", AST_Catch, "param>argname, body%body");
+
+    map("ThisExpression", AST_This);
+    map("Super", AST_Super);
+    map("BinaryExpression", AST_Binary, "operator=operator, left>left, right>right");
+    map("LogicalExpression", AST_Binary, "operator=operator, left>left, right>right");
+    map("AssignmentExpression", AST_Assign, "operator=operator, left>left, right>right");
+    map("ConditionalExpression", AST_Conditional, "test>condition, consequent>consequent, alternate>alternative");
+    map("NewExpression", AST_New, "callee>expression, arguments@args");
+    map("CallExpression", AST_Call, "callee>expression, optional=optional, arguments@args");
+
+    def_to_moz(AST_Toplevel, function To_Moz_Program(M) {
+        return to_moz_scope("Program", M);
+    });
+
+    def_to_moz(AST_Expansion, function To_Moz_Spread(M) {
+        return {
+            type: to_moz_in_destructuring() ? "RestElement" : "SpreadElement",
+            argument: to_moz(M.expression)
+        };
+    });
+
+    def_to_moz(AST_PrefixedTemplateString, function To_Moz_TaggedTemplateExpression(M) {
+        return {
+            type: "TaggedTemplateExpression",
+            tag: to_moz(M.prefix),
+            quasi: to_moz(M.template_string)
+        };
+    });
+
+    def_to_moz(AST_TemplateString, function To_Moz_TemplateLiteral(M) {
+        var quasis = [];
+        var expressions = [];
+        for (var i = 0; i < M.segments.length; i++) {
+            if (i % 2 !== 0) {
+                expressions.push(to_moz(M.segments[i]));
+            } else {
+                quasis.push({
+                    type: "TemplateElement",
+                    value: {
+                        raw: M.segments[i].raw,
+                        cooked: M.segments[i].value
+                    },
+                    tail: i === M.segments.length - 1
+                });
+            }
+        }
+        return {
+            type: "TemplateLiteral",
+            quasis: quasis,
+            expressions: expressions
+        };
+    });
+
+    def_to_moz(AST_Defun, function To_Moz_FunctionDeclaration(M) {
+        return {
+            type: "FunctionDeclaration",
+            id: to_moz(M.name),
+            params: M.argnames.map(to_moz),
+            generator: M.is_generator,
+            async: M.async,
+            body: to_moz_scope("BlockStatement", M)
+        };
+    });
+
+    def_to_moz(AST_Function, function To_Moz_FunctionExpression(M, parent) {
+        var is_generator = parent.is_generator !== undefined ?
+            parent.is_generator : M.is_generator;
+        return {
+            type: "FunctionExpression",
+            id: to_moz(M.name),
+            params: M.argnames.map(to_moz),
+            generator: is_generator,
+            async: M.async,
+            body: to_moz_scope("BlockStatement", M)
+        };
+    });
+
+    def_to_moz(AST_Arrow, function To_Moz_ArrowFunctionExpression(M) {
+        var body = {
+            type: "BlockStatement",
+            body: M.body.map(to_moz)
+        };
+        return {
+            type: "ArrowFunctionExpression",
+            params: M.argnames.map(to_moz),
+            async: M.async,
+            body: body
+        };
+    });
+
+    def_to_moz(AST_Destructuring, function To_Moz_ObjectPattern(M) {
+        if (M.is_array) {
+            return {
+                type: "ArrayPattern",
+                elements: M.names.map(to_moz)
+            };
+        }
+        return {
+            type: "ObjectPattern",
+            properties: M.names.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_Directive, function To_Moz_Directive(M) {
+        return {
+            type: "ExpressionStatement",
+            expression: {
+                type: "Literal",
+                value: M.value,
+                raw: M.print_to_string()
+            },
+            directive: M.value
+        };
+    });
+
+    def_to_moz(AST_SimpleStatement, function To_Moz_ExpressionStatement(M) {
+        return {
+            type: "ExpressionStatement",
+            expression: to_moz(M.body)
+        };
+    });
+
+    def_to_moz(AST_SwitchBranch, function To_Moz_SwitchCase(M) {
+        return {
+            type: "SwitchCase",
+            test: to_moz(M.expression),
+            consequent: M.body.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_Try, function To_Moz_TryStatement(M) {
+        return {
+            type: "TryStatement",
+            block: to_moz_block(M),
+            handler: to_moz(M.bcatch),
+            guardedHandlers: [],
+            finalizer: to_moz(M.bfinally)
+        };
+    });
+
+    def_to_moz(AST_Catch, function To_Moz_CatchClause(M) {
+        return {
+            type: "CatchClause",
+            param: to_moz(M.argname),
+            guard: null,
+            body: to_moz_block(M)
+        };
+    });
+
+    def_to_moz(AST_Definitions, function To_Moz_VariableDeclaration(M) {
+        return {
+            type: "VariableDeclaration",
+            kind:
+                M instanceof AST_Const ? "const" :
+                M instanceof AST_Let ? "let" : "var",
+            declarations: M.definitions.map(to_moz)
+        };
+    });
+
+    const assert_clause_to_moz = assert_clause => {
+        const assertions = [];
+        if (assert_clause) {
+            for (const { key, value } of assert_clause.properties) {
+                const key_moz = is_basic_identifier_string(key)
+                    ? { type: "Identifier", name: key }
+                    : { type: "Literal", value: key, raw: JSON.stringify(key) };
+                assertions.push({
+                    type: "ImportAttribute",
+                    key: key_moz,
+                    value: to_moz(value)
+                });
+            }
+        }
+        return assertions;
+    };
+
+    def_to_moz(AST_Export, function To_Moz_ExportDeclaration(M) {
+        if (M.exported_names) {
+            if (M.exported_names[0].name.name === "*") {
+                return {
+                    type: "ExportAllDeclaration",
+                    source: to_moz(M.module_name),
+                    assertions: assert_clause_to_moz(M.assert_clause)
+                };
+            }
+            return {
+                type: "ExportNamedDeclaration",
+                specifiers: M.exported_names.map(function (name_mapping) {
+                    return {
+                        type: "ExportSpecifier",
+                        exported: to_moz(name_mapping.foreign_name),
+                        local: to_moz(name_mapping.name)
+                    };
+                }),
+                declaration: to_moz(M.exported_definition),
+                source: to_moz(M.module_name),
+                assertions: assert_clause_to_moz(M.assert_clause)
+            };
+        }
+        return {
+            type: M.is_default ? "ExportDefaultDeclaration" : "ExportNamedDeclaration",
+            declaration: to_moz(M.exported_value || M.exported_definition)
+        };
+    });
+
+    def_to_moz(AST_Import, function To_Moz_ImportDeclaration(M) {
+        var specifiers = [];
+        if (M.imported_name) {
+            specifiers.push({
+                type: "ImportDefaultSpecifier",
+                local: to_moz(M.imported_name)
+            });
+        }
+        if (M.imported_names && M.imported_names[0].foreign_name.name === "*") {
+            specifiers.push({
+                type: "ImportNamespaceSpecifier",
+                local: to_moz(M.imported_names[0].name)
+            });
+        } else if (M.imported_names) {
+            M.imported_names.forEach(function(name_mapping) {
+                specifiers.push({
+                    type: "ImportSpecifier",
+                    local: to_moz(name_mapping.name),
+                    imported: to_moz(name_mapping.foreign_name)
+                });
+            });
+        }
+        return {
+            type: "ImportDeclaration",
+            specifiers: specifiers,
+            source: to_moz(M.module_name),
+            assertions: assert_clause_to_moz(M.assert_clause)
+        };
+    });
+
+    def_to_moz(AST_ImportMeta, function To_Moz_MetaProperty() {
+        return {
+            type: "MetaProperty",
+            meta: {
+                type: "Identifier",
+                name: "import"
+            },
+            property: {
+                type: "Identifier",
+                name: "meta"
+            }
+        };
+    });
+
+    def_to_moz(AST_Sequence, function To_Moz_SequenceExpression(M) {
+        return {
+            type: "SequenceExpression",
+            expressions: M.expressions.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_DotHash, function To_Moz_PrivateMemberExpression(M) {
+        return {
+            type: "MemberExpression",
+            object: to_moz(M.expression),
+            computed: false,
+            property: {
+                type: "PrivateIdentifier",
+                name: M.property
+            },
+            optional: M.optional
+        };
+    });
+
+    def_to_moz(AST_PropAccess, function To_Moz_MemberExpression(M) {
+        var isComputed = M instanceof AST_Sub;
+        return {
+            type: "MemberExpression",
+            object: to_moz(M.expression),
+            computed: isComputed,
+            property: isComputed ? to_moz(M.property) : {type: "Identifier", name: M.property},
+            optional: M.optional
+        };
+    });
+
+    def_to_moz(AST_Chain, function To_Moz_ChainExpression(M) {
+        return {
+            type: "ChainExpression",
+            expression: to_moz(M.expression)
+        };
+    });
+
+    def_to_moz(AST_Unary, function To_Moz_Unary(M) {
+        return {
+            type: M.operator == "++" || M.operator == "--" ? "UpdateExpression" : "UnaryExpression",
+            operator: M.operator,
+            prefix: M instanceof AST_UnaryPrefix,
+            argument: to_moz(M.expression)
+        };
+    });
+
+    def_to_moz(AST_Binary, function To_Moz_BinaryExpression(M) {
+        if (M.operator == "=" && to_moz_in_destructuring()) {
+            return {
+                type: "AssignmentPattern",
+                left: to_moz(M.left),
+                right: to_moz(M.right)
+            };
+        }
+
+        const type = M.operator == "&&" || M.operator == "||" || M.operator === "??"
+            ? "LogicalExpression"
+            : "BinaryExpression";
+
+        return {
+            type,
+            left: to_moz(M.left),
+            operator: M.operator,
+            right: to_moz(M.right)
+        };
+    });
+
+    def_to_moz(AST_Array, function To_Moz_ArrayExpression(M) {
+        return {
+            type: "ArrayExpression",
+            elements: M.elements.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_Object, function To_Moz_ObjectExpression(M) {
+        return {
+            type: "ObjectExpression",
+            properties: M.properties.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_ObjectProperty, function To_Moz_Property(M, parent) {
+        var key = M.key instanceof AST_Node ? to_moz(M.key) : {
+            type: "Identifier",
+            value: M.key
+        };
+        if (typeof M.key === "number") {
+            key = {
+                type: "Literal",
+                value: Number(M.key)
+            };
+        }
+        if (typeof M.key === "string") {
+            key = {
+                type: "Identifier",
+                name: M.key
+            };
+        }
+        var kind;
+        var string_or_num = typeof M.key === "string" || typeof M.key === "number";
+        var computed = string_or_num ? false : !(M.key instanceof AST_Symbol) || M.key instanceof AST_SymbolRef;
+        if (M instanceof AST_ObjectKeyVal) {
+            kind = "init";
+            computed = !string_or_num;
+        } else
+        if (M instanceof AST_ObjectGetter) {
+            kind = "get";
+        } else
+        if (M instanceof AST_ObjectSetter) {
+            kind = "set";
+        }
+        if (M instanceof AST_PrivateGetter || M instanceof AST_PrivateSetter) {
+            const kind = M instanceof AST_PrivateGetter ? "get" : "set";
+            return {
+                type: "MethodDefinition",
+                computed: false,
+                kind: kind,
+                static: M.static,
+                key: {
+                    type: "PrivateIdentifier",
+                    name: M.key.name
+                },
+                value: to_moz(M.value)
+            };
+        }
+        if (M instanceof AST_ClassPrivateProperty) {
+            return {
+                type: "PropertyDefinition",
+                key: {
+                    type: "PrivateIdentifier",
+                    name: M.key.name
+                },
+                value: to_moz(M.value),
+                computed: false,
+                static: M.static
+            };
+        }
+        if (M instanceof AST_ClassProperty) {
+            return {
+                type: "PropertyDefinition",
+                key,
+                value: to_moz(M.value),
+                computed,
+                static: M.static
+            };
+        }
+        if (parent instanceof AST_Class) {
+            return {
+                type: "MethodDefinition",
+                computed: computed,
+                kind: kind,
+                static: M.static,
+                key: to_moz(M.key),
+                value: to_moz(M.value)
+            };
+        }
+        return {
+            type: "Property",
+            computed: computed,
+            kind: kind,
+            key: key,
+            value: to_moz(M.value)
+        };
+    });
+
+    def_to_moz(AST_ConciseMethod, function To_Moz_MethodDefinition(M, parent) {
+        if (parent instanceof AST_Object) {
+            return {
+                type: "Property",
+                computed: !(M.key instanceof AST_Symbol) || M.key instanceof AST_SymbolRef,
+                kind: "init",
+                method: true,
+                shorthand: false,
+                key: to_moz(M.key),
+                value: to_moz(M.value)
+            };
+        }
+
+        const key = M instanceof AST_PrivateMethod
+            ? {
+                type: "PrivateIdentifier",
+                name: M.key.name
+            }
+            : to_moz(M.key);
+
+        return {
+            type: "MethodDefinition",
+            kind: M.key === "constructor" ? "constructor" : "method",
+            key,
+            value: to_moz(M.value),
+            computed: !(M.key instanceof AST_Symbol) || M.key instanceof AST_SymbolRef,
+            static: M.static,
+        };
+    });
+
+    def_to_moz(AST_Class, function To_Moz_Class(M) {
+        var type = M instanceof AST_ClassExpression ? "ClassExpression" : "ClassDeclaration";
+        return {
+            type: type,
+            superClass: to_moz(M.extends),
+            id: M.name ? to_moz(M.name) : null,
+            body: {
+                type: "ClassBody",
+                body: M.properties.map(to_moz)
+            }
+        };
+    });
+
+    def_to_moz(AST_NewTarget, function To_Moz_MetaProperty() {
+        return {
+            type: "MetaProperty",
+            meta: {
+                type: "Identifier",
+                name: "new"
+            },
+            property: {
+                type: "Identifier",
+                name: "target"
+            }
+        };
+    });
+
+    def_to_moz(AST_Symbol, function To_Moz_Identifier(M, parent) {
+        if (M instanceof AST_SymbolMethod && parent.quote) {
+            return {
+                type: "Literal",
+                value: M.name
+            };
+        }
+        var def = M.definition();
+        return {
+            type: "Identifier",
+            name: def ? def.mangled_name || def.name : M.name
+        };
+    });
+
+    def_to_moz(AST_RegExp, function To_Moz_RegExpLiteral(M) {
+        const pattern = M.value.source;
+        const flags = M.value.flags;
+        return {
+            type: "Literal",
+            value: null,
+            raw: M.print_to_string(),
+            regex: { pattern, flags }
+        };
+    });
+
+    def_to_moz(AST_Constant, function To_Moz_Literal(M) {
+        var value = M.value;
+        return {
+            type: "Literal",
+            value: value,
+            raw: M.raw || M.print_to_string()
+        };
+    });
+
+    def_to_moz(AST_Atom, function To_Moz_Atom(M) {
+        return {
+            type: "Identifier",
+            name: String(M.value)
+        };
+    });
+
+    def_to_moz(AST_BigInt, M => ({
+        type: "BigIntLiteral",
+        value: M.value
+    }));
+
+    AST_Boolean.DEFMETHOD("to_mozilla_ast", AST_Constant.prototype.to_mozilla_ast);
+    AST_Null.DEFMETHOD("to_mozilla_ast", AST_Constant.prototype.to_mozilla_ast);
+    AST_Hole.DEFMETHOD("to_mozilla_ast", function To_Moz_ArrayHole() { return null; });
+
+    AST_Block.DEFMETHOD("to_mozilla_ast", AST_BlockStatement.prototype.to_mozilla_ast);
+    AST_Lambda.DEFMETHOD("to_mozilla_ast", AST_Function.prototype.to_mozilla_ast);
+
+    /* -----[ tools ]----- */
+
+    function my_start_token(moznode) {
+        var loc = moznode.loc, start = loc && loc.start;
+        var range = moznode.range;
+        return new AST_Token(
+            "",
+            "",
+            start && start.line || 0,
+            start && start.column || 0,
+            range ? range [0] : moznode.start,
+            false,
+            [],
+            [],
+            loc && loc.source,
+        );
+    }
+
+    function my_end_token(moznode) {
+        var loc = moznode.loc, end = loc && loc.end;
+        var range = moznode.range;
+        return new AST_Token(
+            "",
+            "",
+            end && end.line || 0,
+            end && end.column || 0,
+            range ? range [0] : moznode.end,
+            false,
+            [],
+            [],
+            loc && loc.source,
+        );
+    }
+
+    function map(moztype, mytype, propmap) {
+        var moz_to_me = "function From_Moz_" + moztype + "(M){\n";
+        moz_to_me += "return new U2." + mytype.name + "({\n" +
+            "start: my_start_token(M),\n" +
+            "end: my_end_token(M)";
+
+        var me_to_moz = "function To_Moz_" + moztype + "(M){\n";
+        me_to_moz += "return {\n" +
+            "type: " + JSON.stringify(moztype);
+
+        if (propmap) propmap.split(/\s*,\s*/).forEach(function(prop) {
+            var m = /([a-z0-9$_]+)([=@>%])([a-z0-9$_]+)/i.exec(prop);
+            if (!m) throw new Error("Can't understand property map: " + prop);
+            var moz = m[1], how = m[2], my = m[3];
+            moz_to_me += ",\n" + my + ": ";
+            me_to_moz += ",\n" + moz + ": ";
+            switch (how) {
+                case "@":
+                    moz_to_me += "M." + moz + ".map(from_moz)";
+                    me_to_moz += "M." +  my + ".map(to_moz)";
+                    break;
+                case ">":
+                    moz_to_me += "from_moz(M." + moz + ")";
+                    me_to_moz += "to_moz(M." + my + ")";
+                    break;
+                case "=":
+                    moz_to_me += "M." + moz;
+                    me_to_moz += "M." + my;
+                    break;
+                case "%":
+                    moz_to_me += "from_moz(M." + moz + ").body";
+                    me_to_moz += "to_moz_block(M)";
+                    break;
+                default:
+                    throw new Error("Can't understand operator in propmap: " + prop);
+            }
+        });
+
+        moz_to_me += "\n})\n}";
+        me_to_moz += "\n}\n}";
+
+        moz_to_me = new Function("U2", "my_start_token", "my_end_token", "from_moz", "return(" + moz_to_me + ")")(
+            ast, my_start_token, my_end_token, from_moz
+        );
+        me_to_moz = new Function("to_moz", "to_moz_block", "to_moz_scope", "return(" + me_to_moz + ")")(
+            to_moz, to_moz_block, to_moz_scope
+        );
+        MOZ_TO_ME[moztype] = moz_to_me;
+        def_to_moz(mytype, me_to_moz);
+    }
+
+    var FROM_MOZ_STACK = null;
+
+    function from_moz(node) {
+        FROM_MOZ_STACK.push(node);
+        var ret = node != null ? MOZ_TO_ME[node.type](node) : null;
+        FROM_MOZ_STACK.pop();
+        return ret;
+    }
+
+    AST_Node.from_mozilla_ast = function(node) {
+        var save_stack = FROM_MOZ_STACK;
+        FROM_MOZ_STACK = [];
+        var ast = from_moz(node);
+        FROM_MOZ_STACK = save_stack;
+        return ast;
+    };
+
+    function set_moz_loc(mynode, moznode) {
+        var start = mynode.start;
+        var end = mynode.end;
+        if (!(start && end)) {
+            return moznode;
+        }
+        if (start.pos != null && end.endpos != null) {
+            moznode.range = [start.pos, end.endpos];
+        }
+        if (start.line) {
+            moznode.loc = {
+                start: {line: start.line, column: start.col},
+                end: end.endline ? {line: end.endline, column: end.endcol} : null
+            };
+            if (start.file) {
+                moznode.loc.source = start.file;
+            }
+        }
+        return moznode;
+    }
+
+    function def_to_moz(mytype, handler) {
+        mytype.DEFMETHOD("to_mozilla_ast", function(parent) {
+            return set_moz_loc(this, handler(this, parent));
+        });
+    }
+
+    var TO_MOZ_STACK = null;
+
+    function to_moz(node) {
+        if (TO_MOZ_STACK === null) { TO_MOZ_STACK = []; }
+        TO_MOZ_STACK.push(node);
+        var ast = node != null ? node.to_mozilla_ast(TO_MOZ_STACK[TO_MOZ_STACK.length - 2]) : null;
+        TO_MOZ_STACK.pop();
+        if (TO_MOZ_STACK.length === 0) { TO_MOZ_STACK = null; }
+        return ast;
+    }
+
+    function to_moz_in_destructuring() {
+        var i = TO_MOZ_STACK.length;
+        while (i--) {
+            if (TO_MOZ_STACK[i] instanceof AST_Destructuring) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    function to_moz_block(node) {
+        return {
+            type: "BlockStatement",
+            body: node.body.map(to_moz)
+        };
+    }
+
+    function to_moz_scope(type, node) {
+        var body = node.body.map(to_moz);
+        if (node.body[0] instanceof AST_SimpleStatement && node.body[0].body instanceof AST_String) {
+            body.unshift(to_moz(new AST_EmptyStatement(node.body[0])));
+        }
+        return {
+            type: type,
+            body: body
+        };
+    }
+})();
+
+// return true if the node at the top of the stack (that means the
+// innermost node in the current output) is lexically the first in
+// a statement.
+function first_in_statement(stack) {
+    let node = stack.parent(-1);
+    for (let i = 0, p; p = stack.parent(i); i++) {
+        if (p instanceof AST_Statement && p.body === node)
+            return true;
+        if ((p instanceof AST_Sequence && p.expressions[0] === node) ||
+            (p.TYPE === "Call" && p.expression === node) ||
+            (p instanceof AST_PrefixedTemplateString && p.prefix === node) ||
+            (p instanceof AST_Dot && p.expression === node) ||
+            (p instanceof AST_Sub && p.expression === node) ||
+            (p instanceof AST_Conditional && p.condition === node) ||
+            (p instanceof AST_Binary && p.left === node) ||
+            (p instanceof AST_UnaryPostfix && p.expression === node)
+        ) {
+            node = p;
+        } else {
+            return false;
+        }
+    }
+}
+
+// Returns whether the leftmost item in the expression is an object
+function left_is_object(node) {
+    if (node instanceof AST_Object) return true;
+    if (node instanceof AST_Sequence) return left_is_object(node.expressions[0]);
+    if (node.TYPE === "Call") return left_is_object(node.expression);
+    if (node instanceof AST_PrefixedTemplateString) return left_is_object(node.prefix);
+    if (node instanceof AST_Dot || node instanceof AST_Sub) return left_is_object(node.expression);
+    if (node instanceof AST_Conditional) return left_is_object(node.condition);
+    if (node instanceof AST_Binary) return left_is_object(node.left);
+    if (node instanceof AST_UnaryPostfix) return left_is_object(node.expression);
+    return false;
+}
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+const EXPECT_DIRECTIVE = /^$|[;{][\s\n]*$/;
+const CODE_LINE_BREAK = 10;
+const CODE_SPACE = 32;
+
+const r_annotation = /[@#]__(PURE|INLINE|NOINLINE)__/g;
+
+function is_some_comments(comment) {
+    // multiline comment
+    return (
+        (comment.type === "comment2" || comment.type === "comment1")
+        && /@preserve|@copyright|@lic|@cc_on|^\**!/i.test(comment.value)
+    );
+}
+
+class Rope {
+    constructor() {
+        this.committed = "";
+        this.current = "";
+    }
+
+    append(str) {
+        this.current += str;
+    }
+
+    insertAt(char, index) {
+        const { committed, current } = this;
+        if (index < committed.length) {
+            this.committed = committed.slice(0, index) + char + committed.slice(index);
+        } else if (index === committed.length) {
+            this.committed += char;
+        } else {
+            index -= committed.length;
+            this.committed += current.slice(0, index) + char;
+            this.current = current.slice(index);
+        }
+    }
+
+    charAt(index) {
+        const { committed } = this;
+        if (index < committed.length) return committed[index];
+        return this.current[index - committed.length];
+    }
+
+    curLength() {
+        return this.current.length;
+    }
+
+    length() {
+        return this.committed.length + this.current.length;
+    }
+
+    toString() {
+        return this.committed + this.current;
+    }
+}
+
+function OutputStream(options) {
+
+    var readonly = !options;
+    options = defaults(options, {
+        ascii_only           : false,
+        beautify             : false,
+        braces               : false,
+        comments             : "some",
+        ecma                 : 5,
+        ie8                  : false,
+        indent_level         : 4,
+        indent_start         : 0,
+        inline_script        : true,
+        keep_numbers         : false,
+        keep_quoted_props    : false,
+        max_line_len         : false,
+        preamble             : null,
+        preserve_annotations : false,
+        quote_keys           : false,
+        quote_style          : 0,
+        safari10             : false,
+        semicolons           : true,
+        shebang              : true,
+        shorthand            : undefined,
+        source_map           : null,
+        webkit               : false,
+        width                : 80,
+        wrap_iife            : false,
+        wrap_func_args       : true,
+    }, true);
+
+    if (options.shorthand === undefined)
+        options.shorthand = options.ecma > 5;
+
+    // Convert comment option to RegExp if neccessary and set up comments filter
+    var comment_filter = return_false; // Default case, throw all comments away
+    if (options.comments) {
+        let comments = options.comments;
+        if (typeof options.comments === "string" && /^\/.*\/[a-zA-Z]*$/.test(options.comments)) {
+            var regex_pos = options.comments.lastIndexOf("/");
+            comments = new RegExp(
+                options.comments.substr(1, regex_pos - 1),
+                options.comments.substr(regex_pos + 1)
+            );
+        }
+        if (comments instanceof RegExp) {
+            comment_filter = function(comment) {
+                return comment.type != "comment5" && comments.test(comment.value);
+            };
+        } else if (typeof comments === "function") {
+            comment_filter = function(comment) {
+                return comment.type != "comment5" && comments(this, comment);
+            };
+        } else if (comments === "some") {
+            comment_filter = is_some_comments;
+        } else { // NOTE includes "all" option
+            comment_filter = return_true;
+        }
+    }
+
+    var indentation = 0;
+    var current_col = 0;
+    var current_line = 1;
+    var current_pos = 0;
+    var OUTPUT = new Rope();
+    let printed_comments = new Set();
+
+    var to_utf8 = options.ascii_only ? function(str, identifier = false, regexp = false) {
+        if (options.ecma >= 2015 && !options.safari10 && !regexp) {
+            str = str.replace(/[\ud800-\udbff][\udc00-\udfff]/g, function(ch) {
+                var code = get_full_char_code(ch, 0).toString(16);
+                return "\\u{" + code + "}";
+            });
+        }
+        return str.replace(/[\u0000-\u001f\u007f-\uffff]/g, function(ch) {
+            var code = ch.charCodeAt(0).toString(16);
+            if (code.length <= 2 && !identifier) {
+                while (code.length < 2) code = "0" + code;
+                return "\\x" + code;
+            } else {
+                while (code.length < 4) code = "0" + code;
+                return "\\u" + code;
+            }
+        });
+    } : function(str) {
+        return str.replace(/[\ud800-\udbff][\udc00-\udfff]|([\ud800-\udbff]|[\udc00-\udfff])/g, function(match, lone) {
+            if (lone) {
+                return "\\u" + lone.charCodeAt(0).toString(16);
+            }
+            return match;
+        });
+    };
+
+    function make_string(str, quote) {
+        var dq = 0, sq = 0;
+        str = str.replace(/[\\\b\f\n\r\v\t\x22\x27\u2028\u2029\0\ufeff]/g,
+          function(s, i) {
+            switch (s) {
+              case '"': ++dq; return '"';
+              case "'": ++sq; return "'";
+              case "\\": return "\\\\";
+              case "\n": return "\\n";
+              case "\r": return "\\r";
+              case "\t": return "\\t";
+              case "\b": return "\\b";
+              case "\f": return "\\f";
+              case "\x0B": return options.ie8 ? "\\x0B" : "\\v";
+              case "\u2028": return "\\u2028";
+              case "\u2029": return "\\u2029";
+              case "\ufeff": return "\\ufeff";
+              case "\0":
+                  return /[0-9]/.test(get_full_char(str, i+1)) ? "\\x00" : "\\0";
+            }
+            return s;
+        });
+        function quote_single() {
+            return "'" + str.replace(/\x27/g, "\\'") + "'";
+        }
+        function quote_double() {
+            return '"' + str.replace(/\x22/g, '\\"') + '"';
+        }
+        function quote_template() {
+            return "`" + str.replace(/`/g, "\\`") + "`";
+        }
+        str = to_utf8(str);
+        if (quote === "`") return quote_template();
+        switch (options.quote_style) {
+          case 1:
+            return quote_single();
+          case 2:
+            return quote_double();
+          case 3:
+            return quote == "'" ? quote_single() : quote_double();
+          default:
+            return dq > sq ? quote_single() : quote_double();
+        }
+    }
+
+    function encode_string(str, quote) {
+        var ret = make_string(str, quote);
+        if (options.inline_script) {
+            ret = ret.replace(/<\x2f(script)([>\/\t\n\f\r ])/gi, "<\\/$1$2");
+            ret = ret.replace(/\x3c!--/g, "\\x3c!--");
+            ret = ret.replace(/--\x3e/g, "--\\x3e");
+        }
+        return ret;
+    }
+
+    function make_name(name) {
+        name = name.toString();
+        name = to_utf8(name, true);
+        return name;
+    }
+
+    function make_indent(back) {
+        return " ".repeat(options.indent_start + indentation - back * options.indent_level);
+    }
+
+    /* -----[ beautification/minification ]----- */
+
+    var has_parens = false;
+    var might_need_space = false;
+    var might_need_semicolon = false;
+    var might_add_newline = 0;
+    var need_newline_indented = false;
+    var need_space = false;
+    var newline_insert = -1;
+    var last = "";
+    var mapping_token, mapping_name, mappings = options.source_map && [];
+
+    var do_add_mapping = mappings ? function() {
+        mappings.forEach(function(mapping) {
+            try {
+                let { name, token } = mapping;
+                if (token.type == "name" || token.type === "privatename") {
+                    name = token.value;
+                } else if (name instanceof AST_Symbol) {
+                    name = token.type === "string" ? token.value : name.name;
+                }
+                options.source_map.add(
+                    mapping.token.file,
+                    mapping.line, mapping.col,
+                    mapping.token.line, mapping.token.col,
+                    is_basic_identifier_string(name) ? name : undefined
+                );
+            } catch(ex) {
+                // Ignore bad mapping
+            }
+        });
+        mappings = [];
+    } : noop;
+
+    var ensure_line_len = options.max_line_len ? function() {
+        if (current_col > options.max_line_len) {
+            if (might_add_newline) {
+                OUTPUT.insertAt("\n", might_add_newline);
+                const curLength = OUTPUT.curLength();
+                if (mappings) {
+                    var delta = curLength - current_col;
+                    mappings.forEach(function(mapping) {
+                        mapping.line++;
+                        mapping.col += delta;
+                    });
+                }
+                current_line++;
+                current_pos++;
+                current_col = curLength;
+            }
+        }
+        if (might_add_newline) {
+            might_add_newline = 0;
+            do_add_mapping();
+        }
+    } : noop;
+
+    var requireSemicolonChars = makePredicate("( [ + * / - , . `");
+
+    function print(str) {
+        str = String(str);
+        var ch = get_full_char(str, 0);
+        if (need_newline_indented && ch) {
+            need_newline_indented = false;
+            if (ch !== "\n") {
+                print("\n");
+                indent();
+            }
+        }
+        if (need_space && ch) {
+            need_space = false;
+            if (!/[\s;})]/.test(ch)) {
+                space();
+            }
+        }
+        newline_insert = -1;
+        var prev = last.charAt(last.length - 1);
+        if (might_need_semicolon) {
+            might_need_semicolon = false;
+
+            if (prev === ":" && ch === "}" || (!ch || !";}".includes(ch)) && prev !== ";") {
+                if (options.semicolons || requireSemicolonChars.has(ch)) {
+                    OUTPUT.append(";");
+                    current_col++;
+                    current_pos++;
+                } else {
+                    ensure_line_len();
+                    if (current_col > 0) {
+                        OUTPUT.append("\n");
+                        current_pos++;
+                        current_line++;
+                        current_col = 0;
+                    }
+
+                    if (/^\s+$/.test(str)) {
+                        // reset the semicolon flag, since we didn't print one
+                        // now and might still have to later
+                        might_need_semicolon = true;
+                    }
+                }
+
+                if (!options.beautify)
+                    might_need_space = false;
+            }
+        }
+
+        if (might_need_space) {
+            if ((is_identifier_char(prev)
+                    && (is_identifier_char(ch) || ch == "\\"))
+                || (ch == "/" && ch == prev)
+                || ((ch == "+" || ch == "-") && ch == last)
+            ) {
+                OUTPUT.append(" ");
+                current_col++;
+                current_pos++;
+            }
+            might_need_space = false;
+        }
+
+        if (mapping_token) {
+            mappings.push({
+                token: mapping_token,
+                name: mapping_name,
+                line: current_line,
+                col: current_col
+            });
+            mapping_token = false;
+            if (!might_add_newline) do_add_mapping();
+        }
+
+        OUTPUT.append(str);
+        has_parens = str[str.length - 1] == "(";
+        current_pos += str.length;
+        var a = str.split(/\r?\n/), n = a.length - 1;
+        current_line += n;
+        current_col += a[0].length;
+        if (n > 0) {
+            ensure_line_len();
+            current_col = a[n].length;
+        }
+        last = str;
+    }
+
+    var star = function() {
+        print("*");
+    };
+
+    var space = options.beautify ? function() {
+        print(" ");
+    } : function() {
+        might_need_space = true;
+    };
+
+    var indent = options.beautify ? function(half) {
+        if (options.beautify) {
+            print(make_indent(half ? 0.5 : 0));
+        }
+    } : noop;
+
+    var with_indent = options.beautify ? function(col, cont) {
+        if (col === true) col = next_indent();
+        var save_indentation = indentation;
+        indentation = col;
+        var ret = cont();
+        indentation = save_indentation;
+        return ret;
+    } : function(col, cont) { return cont(); };
+
+    var newline = options.beautify ? function() {
+        if (newline_insert < 0) return print("\n");
+        if (OUTPUT.charAt(newline_insert) != "\n") {
+            OUTPUT.insertAt("\n", newline_insert);
+            current_pos++;
+            current_line++;
+        }
+        newline_insert++;
+    } : options.max_line_len ? function() {
+        ensure_line_len();
+        might_add_newline = OUTPUT.length();
+    } : noop;
+
+    var semicolon = options.beautify ? function() {
+        print(";");
+    } : function() {
+        might_need_semicolon = true;
+    };
+
+    function force_semicolon() {
+        might_need_semicolon = false;
+        print(";");
+    }
+
+    function next_indent() {
+        return indentation + options.indent_level;
+    }
+
+    function with_block(cont) {
+        var ret;
+        print("{");
+        newline();
+        with_indent(next_indent(), function() {
+            ret = cont();
+        });
+        indent();
+        print("}");
+        return ret;
+    }
+
+    function with_parens(cont) {
+        print("(");
+        //XXX: still nice to have that for argument lists
+        //var ret = with_indent(current_col, cont);
+        var ret = cont();
+        print(")");
+        return ret;
+    }
+
+    function with_square(cont) {
+        print("[");
+        //var ret = with_indent(current_col, cont);
+        var ret = cont();
+        print("]");
+        return ret;
+    }
+
+    function comma() {
+        print(",");
+        space();
+    }
+
+    function colon() {
+        print(":");
+        space();
+    }
+
+    var add_mapping = mappings ? function(token, name) {
+        mapping_token = token;
+        mapping_name = name;
+    } : noop;
+
+    function get() {
+        if (might_add_newline) {
+            ensure_line_len();
+        }
+        return OUTPUT.toString();
+    }
+
+    function has_nlb() {
+        const output = OUTPUT.toString();
+        let n = output.length - 1;
+        while (n >= 0) {
+            const code = output.charCodeAt(n);
+            if (code === CODE_LINE_BREAK) {
+                return true;
+            }
+
+            if (code !== CODE_SPACE) {
+                return false;
+            }
+            n--;
+        }
+        return true;
+    }
+
+    function filter_comment(comment) {
+        if (!options.preserve_annotations) {
+            comment = comment.replace(r_annotation, " ");
+        }
+        if (/^\s*$/.test(comment)) {
+            return "";
+        }
+        return comment.replace(/(<\s*\/\s*)(script)/i, "<\\/$2");
+    }
+
+    function prepend_comments(node) {
+        var self = this;
+        var start = node.start;
+        if (!start) return;
+        var printed_comments = self.printed_comments;
+
+        // There cannot be a newline between return and its value.
+        const return_with_value = node instanceof AST_Exit && node.value;
+
+        if (
+            start.comments_before
+            && printed_comments.has(start.comments_before)
+        ) {
+            if (return_with_value) {
+                start.comments_before = [];
+            } else {
+                return;
+            }
+        }
+
+        var comments = start.comments_before;
+        if (!comments) {
+            comments = start.comments_before = [];
+        }
+        printed_comments.add(comments);
+
+        if (return_with_value) {
+            var tw = new TreeWalker(function(node) {
+                var parent = tw.parent();
+                if (parent instanceof AST_Exit
+                    || parent instanceof AST_Binary && parent.left === node
+                    || parent.TYPE == "Call" && parent.expression === node
+                    || parent instanceof AST_Conditional && parent.condition === node
+                    || parent instanceof AST_Dot && parent.expression === node
+                    || parent instanceof AST_Sequence && parent.expressions[0] === node
+                    || parent instanceof AST_Sub && parent.expression === node
+                    || parent instanceof AST_UnaryPostfix) {
+                    if (!node.start) return;
+                    var text = node.start.comments_before;
+                    if (text && !printed_comments.has(text)) {
+                        printed_comments.add(text);
+                        comments = comments.concat(text);
+                    }
+                } else {
+                    return true;
+                }
+            });
+            tw.push(node);
+            node.value.walk(tw);
+        }
+
+        if (current_pos == 0) {
+            if (comments.length > 0 && options.shebang && comments[0].type === "comment5"
+                && !printed_comments.has(comments[0])) {
+                print("#!" + comments.shift().value + "\n");
+                indent();
+            }
+            var preamble = options.preamble;
+            if (preamble) {
+                print(preamble.replace(/\r\n?|[\n\u2028\u2029]|\s*$/g, "\n"));
+            }
+        }
+
+        comments = comments.filter(comment_filter, node).filter(c => !printed_comments.has(c));
+        if (comments.length == 0) return;
+        var last_nlb = has_nlb();
+        comments.forEach(function(c, i) {
+            printed_comments.add(c);
+            if (!last_nlb) {
+                if (c.nlb) {
+                    print("\n");
+                    indent();
+                    last_nlb = true;
+                } else if (i > 0) {
+                    space();
+                }
+            }
+
+            if (/comment[134]/.test(c.type)) {
+                var value = filter_comment(c.value);
+                if (value) {
+                    print("//" + value + "\n");
+                    indent();
+                }
+                last_nlb = true;
+            } else if (c.type == "comment2") {
+                var value = filter_comment(c.value);
+                if (value) {
+                    print("/*" + value + "*/");
+                }
+                last_nlb = false;
+            }
+        });
+        if (!last_nlb) {
+            if (start.nlb) {
+                print("\n");
+                indent();
+            } else {
+                space();
+            }
+        }
+    }
+
+    function append_comments(node, tail) {
+        var self = this;
+        var token = node.end;
+        if (!token) return;
+        var printed_comments = self.printed_comments;
+        var comments = token[tail ? "comments_before" : "comments_after"];
+        if (!comments || printed_comments.has(comments)) return;
+        if (!(node instanceof AST_Statement || comments.every((c) =>
+            !/comment[134]/.test(c.type)
+        ))) return;
+        printed_comments.add(comments);
+        var insert = OUTPUT.length();
+        comments.filter(comment_filter, node).forEach(function(c, i) {
+            if (printed_comments.has(c)) return;
+            printed_comments.add(c);
+            need_space = false;
+            if (need_newline_indented) {
+                print("\n");
+                indent();
+                need_newline_indented = false;
+            } else if (c.nlb && (i > 0 || !has_nlb())) {
+                print("\n");
+                indent();
+            } else if (i > 0 || !tail) {
+                space();
+            }
+            if (/comment[134]/.test(c.type)) {
+                const value = filter_comment(c.value);
+                if (value) {
+                    print("//" + value);
+                }
+                need_newline_indented = true;
+            } else if (c.type == "comment2") {
+                const value = filter_comment(c.value);
+                if (value) {
+                    print("/*" + value + "*/");
+                }
+                need_space = true;
+            }
+        });
+        if (OUTPUT.length() > insert) newline_insert = insert;
+    }
+
+    var stack = [];
+    return {
+        get             : get,
+        toString        : get,
+        indent          : indent,
+        in_directive    : false,
+        use_asm         : null,
+        active_scope    : null,
+        indentation     : function() { return indentation; },
+        current_width   : function() { return current_col - indentation; },
+        should_break    : function() { return options.width && this.current_width() >= options.width; },
+        has_parens      : function() { return has_parens; },
+        newline         : newline,
+        print           : print,
+        star            : star,
+        space           : space,
+        comma           : comma,
+        colon           : colon,
+        last            : function() { return last; },
+        semicolon       : semicolon,
+        force_semicolon : force_semicolon,
+        to_utf8         : to_utf8,
+        print_name      : function(name) { print(make_name(name)); },
+        print_string    : function(str, quote, escape_directive) {
+            var encoded = encode_string(str, quote);
+            if (escape_directive === true && !encoded.includes("\\")) {
+                // Insert semicolons to break directive prologue
+                if (!EXPECT_DIRECTIVE.test(OUTPUT.toString())) {
+                    force_semicolon();
+                }
+                force_semicolon();
+            }
+            print(encoded);
+        },
+        print_template_string_chars: function(str) {
+            var encoded = encode_string(str, "`").replace(/\${/g, "\\${");
+            return print(encoded.substr(1, encoded.length - 2));
+        },
+        encode_string   : encode_string,
+        next_indent     : next_indent,
+        with_indent     : with_indent,
+        with_block      : with_block,
+        with_parens     : with_parens,
+        with_square     : with_square,
+        add_mapping     : add_mapping,
+        option          : function(opt) { return options[opt]; },
+        printed_comments: printed_comments,
+        prepend_comments: readonly ? noop : prepend_comments,
+        append_comments : readonly || comment_filter === return_false ? noop : append_comments,
+        line            : function() { return current_line; },
+        col             : function() { return current_col; },
+        pos             : function() { return current_pos; },
+        push_node       : function(node) { stack.push(node); },
+        pop_node        : function() { return stack.pop(); },
+        parent          : function(n) {
+            return stack[stack.length - 2 - (n || 0)];
+        }
+    };
+
+}
+
+/* -----[ code generators ]----- */
+
+(function() {
+
+    /* -----[ utils ]----- */
+
+    function DEFPRINT(nodetype, generator) {
+        nodetype.DEFMETHOD("_codegen", generator);
+    }
+
+    AST_Node.DEFMETHOD("print", function(output, force_parens) {
+        var self = this, generator = self._codegen;
+        if (self instanceof AST_Scope) {
+            output.active_scope = self;
+        } else if (!output.use_asm && self instanceof AST_Directive && self.value == "use asm") {
+            output.use_asm = output.active_scope;
+        }
+        function doit() {
+            output.prepend_comments(self);
+            self.add_source_map(output);
+            generator(self, output);
+            output.append_comments(self);
+        }
+        output.push_node(self);
+        if (force_parens || self.needs_parens(output)) {
+            output.with_parens(doit);
+        } else {
+            doit();
+        }
+        output.pop_node();
+        if (self === output.use_asm) {
+            output.use_asm = null;
+        }
+    });
+    AST_Node.DEFMETHOD("_print", AST_Node.prototype.print);
+
+    AST_Node.DEFMETHOD("print_to_string", function(options) {
+        var output = OutputStream(options);
+        this.print(output);
+        return output.get();
+    });
+
+    /* -----[ PARENTHESES ]----- */
+
+    function PARENS(nodetype, func) {
+        if (Array.isArray(nodetype)) {
+            nodetype.forEach(function(nodetype) {
+                PARENS(nodetype, func);
+            });
+        } else {
+            nodetype.DEFMETHOD("needs_parens", func);
+        }
+    }
+
+    PARENS(AST_Node, return_false);
+
+    // a function expression needs parens around it when it's provably
+    // the first token to appear in a statement.
+    PARENS(AST_Function, function(output) {
+        if (!output.has_parens() && first_in_statement(output)) {
+            return true;
+        }
+
+        if (output.option("webkit")) {
+            var p = output.parent();
+            if (p instanceof AST_PropAccess && p.expression === this) {
+                return true;
+            }
+        }
+
+        if (output.option("wrap_iife")) {
+            var p = output.parent();
+            if (p instanceof AST_Call && p.expression === this) {
+                return true;
+            }
+        }
+
+        if (output.option("wrap_func_args")) {
+            var p = output.parent();
+            if (p instanceof AST_Call && p.args.includes(this)) {
+                return true;
+            }
+        }
+
+        return false;
+    });
+
+    PARENS(AST_Arrow, function(output) {
+        var p = output.parent();
+
+        if (
+            output.option("wrap_func_args")
+            && p instanceof AST_Call
+            && p.args.includes(this)
+        ) {
+            return true;
+        }
+        return p instanceof AST_PropAccess && p.expression === this;
+    });
+
+    // same goes for an object literal (as in AST_Function), because
+    // otherwise {...} would be interpreted as a block of code.
+    PARENS(AST_Object, function(output) {
+        return !output.has_parens() && first_in_statement(output);
+    });
+
+    PARENS(AST_ClassExpression, first_in_statement);
+
+    PARENS(AST_Unary, function(output) {
+        var p = output.parent();
+        return p instanceof AST_PropAccess && p.expression === this
+            || p instanceof AST_Call && p.expression === this
+            || p instanceof AST_Binary
+                && p.operator === "**"
+                && this instanceof AST_UnaryPrefix
+                && p.left === this
+                && this.operator !== "++"
+                && this.operator !== "--";
+    });
+
+    PARENS(AST_Await, function(output) {
+        var p = output.parent();
+        return p instanceof AST_PropAccess && p.expression === this
+            || p instanceof AST_Call && p.expression === this
+            || p instanceof AST_Binary && p.operator === "**" && p.left === this
+            || output.option("safari10") && p instanceof AST_UnaryPrefix;
+    });
+
+    PARENS(AST_Sequence, function(output) {
+        var p = output.parent();
+        return p instanceof AST_Call                          // (foo, bar)() or foo(1, (2, 3), 4)
+            || p instanceof AST_Unary                         // !(foo, bar, baz)
+            || p instanceof AST_Binary                        // 1 + (2, 3) + 4 ==> 8
+            || p instanceof AST_VarDef                        // var a = (1, 2), b = a + a; ==> b == 4
+            || p instanceof AST_PropAccess                    // (1, {foo:2}).foo or (1, {foo:2})["foo"] ==> 2
+            || p instanceof AST_Array                         // [ 1, (2, 3), 4 ] ==> [ 1, 3, 4 ]
+            || p instanceof AST_ObjectProperty                // { foo: (1, 2) }.foo ==> 2
+            || p instanceof AST_Conditional                   /* (false, true) ? (a = 10, b = 20) : (c = 30)
+                                                               * ==> 20 (side effect, set a := 10 and b := 20) */
+            || p instanceof AST_Arrow                         // x => (x, x)
+            || p instanceof AST_DefaultAssign                 // x => (x = (0, function(){}))
+            || p instanceof AST_Expansion                     // [...(a, b)]
+            || p instanceof AST_ForOf && this === p.object    // for (e of (foo, bar)) {}
+            || p instanceof AST_Yield                         // yield (foo, bar)
+            || p instanceof AST_Export                        // export default (foo, bar)
+        ;
+    });
+
+    PARENS(AST_Binary, function(output) {
+        var p = output.parent();
+        // (foo && bar)()
+        if (p instanceof AST_Call && p.expression === this)
+            return true;
+        // typeof (foo && bar)
+        if (p instanceof AST_Unary)
+            return true;
+        // (foo && bar)["prop"], (foo && bar).prop
+        if (p instanceof AST_PropAccess && p.expression === this)
+            return true;
+        // this deals with precedence: 3 * (2 + 1)
+        if (p instanceof AST_Binary) {
+            const po = p.operator;
+            const so = this.operator;
+
+            if (so === "??" && (po === "||" || po === "&&")) {
+                return true;
+            }
+
+            if (po === "??" && (so === "||" || so === "&&")) {
+                return true;
+            }
+
+            const pp = PRECEDENCE[po];
+            const sp = PRECEDENCE[so];
+            if (pp > sp
+                || (pp == sp
+                    && (this === p.right || po == "**"))) {
+                return true;
+            }
+        }
+    });
+
+    PARENS(AST_Yield, function(output) {
+        var p = output.parent();
+        // (yield 1) + (yield 2)
+        // a = yield 3
+        if (p instanceof AST_Binary && p.operator !== "=")
+            return true;
+        // (yield 1)()
+        // new (yield 1)()
+        if (p instanceof AST_Call && p.expression === this)
+            return true;
+        // (yield 1) ? yield 2 : yield 3
+        if (p instanceof AST_Conditional && p.condition === this)
+            return true;
+        // -(yield 4)
+        if (p instanceof AST_Unary)
+            return true;
+        // (yield x).foo
+        // (yield x)['foo']
+        if (p instanceof AST_PropAccess && p.expression === this)
+            return true;
+    });
+
+    PARENS(AST_PropAccess, function(output) {
+        var p = output.parent();
+        if (p instanceof AST_New && p.expression === this) {
+            // i.e. new (foo.bar().baz)
+            //
+            // if there's one call into this subtree, then we need
+            // parens around it too, otherwise the call will be
+            // interpreted as passing the arguments to the upper New
+            // expression.
+            return walk(this, node => {
+                if (node instanceof AST_Scope) return true;
+                if (node instanceof AST_Call) {
+                    return walk_abort;  // makes walk() return true.
+                }
+            });
+        }
+    });
+
+    PARENS(AST_Call, function(output) {
+        var p = output.parent(), p1;
+        if (p instanceof AST_New && p.expression === this
+            || p instanceof AST_Export && p.is_default && this.expression instanceof AST_Function)
+            return true;
+
+        // workaround for Safari bug.
+        // https://bugs.webkit.org/show_bug.cgi?id=123506
+        return this.expression instanceof AST_Function
+            && p instanceof AST_PropAccess
+            && p.expression === this
+            && (p1 = output.parent(1)) instanceof AST_Assign
+            && p1.left === p;
+    });
+
+    PARENS(AST_New, function(output) {
+        var p = output.parent();
+        if (this.args.length === 0
+            && (p instanceof AST_PropAccess // (new Date).getTime(), (new Date)["getTime"]()
+                || p instanceof AST_Call && p.expression === this
+                || p instanceof AST_PrefixedTemplateString && p.prefix === this)) // (new foo)(bar)
+            return true;
+    });
+
+    PARENS(AST_Number, function(output) {
+        var p = output.parent();
+        if (p instanceof AST_PropAccess && p.expression === this) {
+            var value = this.getValue();
+            if (value < 0 || /^0/.test(make_num(value))) {
+                return true;
+            }
+        }
+    });
+
+    PARENS(AST_BigInt, function(output) {
+        var p = output.parent();
+        if (p instanceof AST_PropAccess && p.expression === this) {
+            var value = this.getValue();
+            if (value.startsWith("-")) {
+                return true;
+            }
+        }
+    });
+
+    PARENS([ AST_Assign, AST_Conditional ], function(output) {
+        var p = output.parent();
+        // !(a = false) → true
+        if (p instanceof AST_Unary)
+            return true;
+        // 1 + (a = 2) + 3 → 6, side effect setting a = 2
+        if (p instanceof AST_Binary && !(p instanceof AST_Assign))
+            return true;
+        // (a = func)() —or— new (a = Object)()
+        if (p instanceof AST_Call && p.expression === this)
+            return true;
+        // (a = foo) ? bar : baz
+        if (p instanceof AST_Conditional && p.condition === this)
+            return true;
+        // (a = foo)["prop"] —or— (a = foo).prop
+        if (p instanceof AST_PropAccess && p.expression === this)
+            return true;
+        // ({a, b} = {a: 1, b: 2}), a destructuring assignment
+        if (this instanceof AST_Assign && this.left instanceof AST_Destructuring && this.left.is_array === false)
+            return true;
+    });
+
+    /* -----[ PRINTERS ]----- */
+
+    DEFPRINT(AST_Directive, function(self, output) {
+        output.print_string(self.value, self.quote);
+        output.semicolon();
+    });
+
+    DEFPRINT(AST_Expansion, function (self, output) {
+        output.print("...");
+        self.expression.print(output);
+    });
+
+    DEFPRINT(AST_Destructuring, function (self, output) {
+        output.print(self.is_array ? "[" : "{");
+        var len = self.names.length;
+        self.names.forEach(function (name, i) {
+            if (i > 0) output.comma();
+            name.print(output);
+            // If the final element is a hole, we need to make sure it
+            // doesn't look like a trailing comma, by inserting an actual
+            // trailing comma.
+            if (i == len - 1 && name instanceof AST_Hole) output.comma();
+        });
+        output.print(self.is_array ? "]" : "}");
+    });
+
+    DEFPRINT(AST_Debugger, function(self, output) {
+        output.print("debugger");
+        output.semicolon();
+    });
+
+    /* -----[ statements ]----- */
+
+    function display_body(body, is_toplevel, output, allow_directives) {
+        var last = body.length - 1;
+        output.in_directive = allow_directives;
+        body.forEach(function(stmt, i) {
+            if (output.in_directive === true && !(stmt instanceof AST_Directive ||
+                stmt instanceof AST_EmptyStatement ||
+                (stmt instanceof AST_SimpleStatement && stmt.body instanceof AST_String)
+            )) {
+                output.in_directive = false;
+            }
+            if (!(stmt instanceof AST_EmptyStatement)) {
+                output.indent();
+                stmt.print(output);
+                if (!(i == last && is_toplevel)) {
+                    output.newline();
+                    if (is_toplevel) output.newline();
+                }
+            }
+            if (output.in_directive === true &&
+                stmt instanceof AST_SimpleStatement &&
+                stmt.body instanceof AST_String
+            ) {
+                output.in_directive = false;
+            }
+        });
+        output.in_directive = false;
+    }
+
+    AST_StatementWithBody.DEFMETHOD("_do_print_body", function(output) {
+        force_statement(this.body, output);
+    });
+
+    DEFPRINT(AST_Statement, function(self, output) {
+        self.body.print(output);
+        output.semicolon();
+    });
+    DEFPRINT(AST_Toplevel, function(self, output) {
+        display_body(self.body, true, output, true);
+        output.print("");
+    });
+    DEFPRINT(AST_LabeledStatement, function(self, output) {
+        self.label.print(output);
+        output.colon();
+        self.body.print(output);
+    });
+    DEFPRINT(AST_SimpleStatement, function(self, output) {
+        self.body.print(output);
+        output.semicolon();
+    });
+    function print_braced_empty(self, output) {
+        output.print("{");
+        output.with_indent(output.next_indent(), function() {
+            output.append_comments(self, true);
+        });
+        output.print("}");
+    }
+    function print_braced(self, output, allow_directives) {
+        if (self.body.length > 0) {
+            output.with_block(function() {
+                display_body(self.body, false, output, allow_directives);
+            });
+        } else print_braced_empty(self, output);
+    }
+    DEFPRINT(AST_BlockStatement, function(self, output) {
+        print_braced(self, output);
+    });
+    DEFPRINT(AST_EmptyStatement, function(self, output) {
+        output.semicolon();
+    });
+    DEFPRINT(AST_Do, function(self, output) {
+        output.print("do");
+        output.space();
+        make_block(self.body, output);
+        output.space();
+        output.print("while");
+        output.space();
+        output.with_parens(function() {
+            self.condition.print(output);
+        });
+        output.semicolon();
+    });
+    DEFPRINT(AST_While, function(self, output) {
+        output.print("while");
+        output.space();
+        output.with_parens(function() {
+            self.condition.print(output);
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_For, function(self, output) {
+        output.print("for");
+        output.space();
+        output.with_parens(function() {
+            if (self.init) {
+                if (self.init instanceof AST_Definitions) {
+                    self.init.print(output);
+                } else {
+                    parenthesize_for_noin(self.init, output, true);
+                }
+                output.print(";");
+                output.space();
+            } else {
+                output.print(";");
+            }
+            if (self.condition) {
+                self.condition.print(output);
+                output.print(";");
+                output.space();
+            } else {
+                output.print(";");
+            }
+            if (self.step) {
+                self.step.print(output);
+            }
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_ForIn, function(self, output) {
+        output.print("for");
+        if (self.await) {
+            output.space();
+            output.print("await");
+        }
+        output.space();
+        output.with_parens(function() {
+            self.init.print(output);
+            output.space();
+            output.print(self instanceof AST_ForOf ? "of" : "in");
+            output.space();
+            self.object.print(output);
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_With, function(self, output) {
+        output.print("with");
+        output.space();
+        output.with_parens(function() {
+            self.expression.print(output);
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+
+    /* -----[ functions ]----- */
+    AST_Lambda.DEFMETHOD("_do_print", function(output, nokeyword) {
+        var self = this;
+        if (!nokeyword) {
+            if (self.async) {
+                output.print("async");
+                output.space();
+            }
+            output.print("function");
+            if (self.is_generator) {
+                output.star();
+            }
+            if (self.name) {
+                output.space();
+            }
+        }
+        if (self.name instanceof AST_Symbol) {
+            self.name.print(output);
+        } else if (nokeyword && self.name instanceof AST_Node) {
+            output.with_square(function() {
+                self.name.print(output); // Computed method name
+            });
+        }
+        output.with_parens(function() {
+            self.argnames.forEach(function(arg, i) {
+                if (i) output.comma();
+                arg.print(output);
+            });
+        });
+        output.space();
+        print_braced(self, output, true);
+    });
+    DEFPRINT(AST_Lambda, function(self, output) {
+        self._do_print(output);
+    });
+
+    DEFPRINT(AST_PrefixedTemplateString, function(self, output) {
+        var tag = self.prefix;
+        var parenthesize_tag = tag instanceof AST_Lambda
+            || tag instanceof AST_Binary
+            || tag instanceof AST_Conditional
+            || tag instanceof AST_Sequence
+            || tag instanceof AST_Unary
+            || tag instanceof AST_Dot && tag.expression instanceof AST_Object;
+        if (parenthesize_tag) output.print("(");
+        self.prefix.print(output);
+        if (parenthesize_tag) output.print(")");
+        self.template_string.print(output);
+    });
+    DEFPRINT(AST_TemplateString, function(self, output) {
+        var is_tagged = output.parent() instanceof AST_PrefixedTemplateString;
+
+        output.print("`");
+        for (var i = 0; i < self.segments.length; i++) {
+            if (!(self.segments[i] instanceof AST_TemplateSegment)) {
+                output.print("${");
+                self.segments[i].print(output);
+                output.print("}");
+            } else if (is_tagged) {
+                output.print(self.segments[i].raw);
+            } else {
+                output.print_template_string_chars(self.segments[i].value);
+            }
+        }
+        output.print("`");
+    });
+    DEFPRINT(AST_TemplateSegment, function(self, output) {
+        output.print_template_string_chars(self.value);
+    });
+
+    AST_Arrow.DEFMETHOD("_do_print", function(output) {
+        var self = this;
+        var parent = output.parent();
+        var needs_parens = (parent instanceof AST_Binary && !(parent instanceof AST_Assign)) ||
+            parent instanceof AST_Unary ||
+            (parent instanceof AST_Call && self === parent.expression);
+        if (needs_parens) { output.print("("); }
+        if (self.async) {
+            output.print("async");
+            output.space();
+        }
+        if (self.argnames.length === 1 && self.argnames[0] instanceof AST_Symbol) {
+            self.argnames[0].print(output);
+        } else {
+            output.with_parens(function() {
+                self.argnames.forEach(function(arg, i) {
+                    if (i) output.comma();
+                    arg.print(output);
+                });
+            });
+        }
+        output.space();
+        output.print("=>");
+        output.space();
+        const first_statement = self.body[0];
+        if (
+            self.body.length === 1
+            && first_statement instanceof AST_Return
+        ) {
+            const returned = first_statement.value;
+            if (!returned) {
+                output.print("{}");
+            } else if (left_is_object(returned)) {
+                output.print("(");
+                returned.print(output);
+                output.print(")");
+            } else {
+                returned.print(output);
+            }
+        } else {
+            print_braced(self, output);
+        }
+        if (needs_parens) { output.print(")"); }
+    });
+
+    /* -----[ exits ]----- */
+    AST_Exit.DEFMETHOD("_do_print", function(output, kind) {
+        output.print(kind);
+        if (this.value) {
+            output.space();
+            const comments = this.value.start.comments_before;
+            if (comments && comments.length && !output.printed_comments.has(comments)) {
+                output.print("(");
+                this.value.print(output);
+                output.print(")");
+            } else {
+                this.value.print(output);
+            }
+        }
+        output.semicolon();
+    });
+    DEFPRINT(AST_Return, function(self, output) {
+        self._do_print(output, "return");
+    });
+    DEFPRINT(AST_Throw, function(self, output) {
+        self._do_print(output, "throw");
+    });
+
+    /* -----[ yield ]----- */
+
+    DEFPRINT(AST_Yield, function(self, output) {
+        var star = self.is_star ? "*" : "";
+        output.print("yield" + star);
+        if (self.expression) {
+            output.space();
+            self.expression.print(output);
+        }
+    });
+
+    DEFPRINT(AST_Await, function(self, output) {
+        output.print("await");
+        output.space();
+        var e = self.expression;
+        var parens = !(
+               e instanceof AST_Call
+            || e instanceof AST_SymbolRef
+            || e instanceof AST_PropAccess
+            || e instanceof AST_Unary
+            || e instanceof AST_Constant
+            || e instanceof AST_Await
+            || e instanceof AST_Object
+        );
+        if (parens) output.print("(");
+        self.expression.print(output);
+        if (parens) output.print(")");
+    });
+
+    /* -----[ loop control ]----- */
+    AST_LoopControl.DEFMETHOD("_do_print", function(output, kind) {
+        output.print(kind);
+        if (this.label) {
+            output.space();
+            this.label.print(output);
+        }
+        output.semicolon();
+    });
+    DEFPRINT(AST_Break, function(self, output) {
+        self._do_print(output, "break");
+    });
+    DEFPRINT(AST_Continue, function(self, output) {
+        self._do_print(output, "continue");
+    });
+
+    /* -----[ if ]----- */
+    function make_then(self, output) {
+        var b = self.body;
+        if (output.option("braces")
+            || output.option("ie8") && b instanceof AST_Do)
+            return make_block(b, output);
+        // The squeezer replaces "block"-s that contain only a single
+        // statement with the statement itself; technically, the AST
+        // is correct, but this can create problems when we output an
+        // IF having an ELSE clause where the THEN clause ends in an
+        // IF *without* an ELSE block (then the outer ELSE would refer
+        // to the inner IF).  This function checks for this case and
+        // adds the block braces if needed.
+        if (!b) return output.force_semicolon();
+        while (true) {
+            if (b instanceof AST_If) {
+                if (!b.alternative) {
+                    make_block(self.body, output);
+                    return;
+                }
+                b = b.alternative;
+            } else if (b instanceof AST_StatementWithBody) {
+                b = b.body;
+            } else break;
+        }
+        force_statement(self.body, output);
+    }
+    DEFPRINT(AST_If, function(self, output) {
+        output.print("if");
+        output.space();
+        output.with_parens(function() {
+            self.condition.print(output);
+        });
+        output.space();
+        if (self.alternative) {
+            make_then(self, output);
+            output.space();
+            output.print("else");
+            output.space();
+            if (self.alternative instanceof AST_If)
+                self.alternative.print(output);
+            else
+                force_statement(self.alternative, output);
+        } else {
+            self._do_print_body(output);
+        }
+    });
+
+    /* -----[ switch ]----- */
+    DEFPRINT(AST_Switch, function(self, output) {
+        output.print("switch");
+        output.space();
+        output.with_parens(function() {
+            self.expression.print(output);
+        });
+        output.space();
+        var last = self.body.length - 1;
+        if (last < 0) print_braced_empty(self, output);
+        else output.with_block(function() {
+            self.body.forEach(function(branch, i) {
+                output.indent(true);
+                branch.print(output);
+                if (i < last && branch.body.length > 0)
+                    output.newline();
+            });
+        });
+    });
+    AST_SwitchBranch.DEFMETHOD("_do_print_body", function(output) {
+        output.newline();
+        this.body.forEach(function(stmt) {
+            output.indent();
+            stmt.print(output);
+            output.newline();
+        });
+    });
+    DEFPRINT(AST_Default, function(self, output) {
+        output.print("default:");
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_Case, function(self, output) {
+        output.print("case");
+        output.space();
+        self.expression.print(output);
+        output.print(":");
+        self._do_print_body(output);
+    });
+
+    /* -----[ exceptions ]----- */
+    DEFPRINT(AST_Try, function(self, output) {
+        output.print("try");
+        output.space();
+        print_braced(self, output);
+        if (self.bcatch) {
+            output.space();
+            self.bcatch.print(output);
+        }
+        if (self.bfinally) {
+            output.space();
+            self.bfinally.print(output);
+        }
+    });
+    DEFPRINT(AST_Catch, function(self, output) {
+        output.print("catch");
+        if (self.argname) {
+            output.space();
+            output.with_parens(function() {
+                self.argname.print(output);
+            });
+        }
+        output.space();
+        print_braced(self, output);
+    });
+    DEFPRINT(AST_Finally, function(self, output) {
+        output.print("finally");
+        output.space();
+        print_braced(self, output);
+    });
+
+    /* -----[ var/const ]----- */
+    AST_Definitions.DEFMETHOD("_do_print", function(output, kind) {
+        output.print(kind);
+        output.space();
+        this.definitions.forEach(function(def, i) {
+            if (i) output.comma();
+            def.print(output);
+        });
+        var p = output.parent();
+        var in_for = p instanceof AST_For || p instanceof AST_ForIn;
+        var output_semicolon = !in_for || p && p.init !== this;
+        if (output_semicolon)
+            output.semicolon();
+    });
+    DEFPRINT(AST_Let, function(self, output) {
+        self._do_print(output, "let");
+    });
+    DEFPRINT(AST_Var, function(self, output) {
+        self._do_print(output, "var");
+    });
+    DEFPRINT(AST_Const, function(self, output) {
+        self._do_print(output, "const");
+    });
+    DEFPRINT(AST_Import, function(self, output) {
+        output.print("import");
+        output.space();
+        if (self.imported_name) {
+            self.imported_name.print(output);
+        }
+        if (self.imported_name && self.imported_names) {
+            output.print(",");
+            output.space();
+        }
+        if (self.imported_names) {
+            if (self.imported_names.length === 1 && self.imported_names[0].foreign_name.name === "*") {
+                self.imported_names[0].print(output);
+            } else {
+                output.print("{");
+                self.imported_names.forEach(function (name_import, i) {
+                    output.space();
+                    name_import.print(output);
+                    if (i < self.imported_names.length - 1) {
+                        output.print(",");
+                    }
+                });
+                output.space();
+                output.print("}");
+            }
+        }
+        if (self.imported_name || self.imported_names) {
+            output.space();
+            output.print("from");
+            output.space();
+        }
+        self.module_name.print(output);
+        if (self.assert_clause) {
+            output.print("assert");
+            self.assert_clause.print(output);
+        }
+        output.semicolon();
+    });
+    DEFPRINT(AST_ImportMeta, function(self, output) {
+        output.print("import.meta");
+    });
+
+    DEFPRINT(AST_NameMapping, function(self, output) {
+        var is_import = output.parent() instanceof AST_Import;
+        var definition = self.name.definition();
+        var names_are_different =
+            (definition && definition.mangled_name || self.name.name) !==
+            self.foreign_name.name;
+        if (names_are_different) {
+            if (is_import) {
+                output.print(self.foreign_name.name);
+            } else {
+                self.name.print(output);
+            }
+            output.space();
+            output.print("as");
+            output.space();
+            if (is_import) {
+                self.name.print(output);
+            } else {
+                output.print(self.foreign_name.name);
+            }
+        } else {
+            self.name.print(output);
+        }
+    });
+
+    DEFPRINT(AST_Export, function(self, output) {
+        output.print("export");
+        output.space();
+        if (self.is_default) {
+            output.print("default");
+            output.space();
+        }
+        if (self.exported_names) {
+            if (self.exported_names.length === 1 && self.exported_names[0].name.name === "*") {
+                self.exported_names[0].print(output);
+            } else {
+                output.print("{");
+                self.exported_names.forEach(function(name_export, i) {
+                    output.space();
+                    name_export.print(output);
+                    if (i < self.exported_names.length - 1) {
+                        output.print(",");
+                    }
+                });
+                output.space();
+                output.print("}");
+            }
+        } else if (self.exported_value) {
+            self.exported_value.print(output);
+        } else if (self.exported_definition) {
+            self.exported_definition.print(output);
+            if (self.exported_definition instanceof AST_Definitions) return;
+        }
+        if (self.module_name) {
+            output.space();
+            output.print("from");
+            output.space();
+            self.module_name.print(output);
+        }
+        if (self.assert_clause) {
+            output.print("assert");
+            self.assert_clause.print(output);
+        }
+        if (self.exported_value
+                && !(self.exported_value instanceof AST_Defun ||
+                    self.exported_value instanceof AST_Function ||
+                    self.exported_value instanceof AST_Class)
+            || self.module_name
+            || self.exported_names
+        ) {
+            output.semicolon();
+        }
+    });
+
+    function parenthesize_for_noin(node, output, noin) {
+        var parens = false;
+        // need to take some precautions here:
+        //    https://github.com/mishoo/UglifyJS2/issues/60
+        if (noin) {
+            parens = walk(node, node => {
+                // Don't go into scopes -- except arrow functions:
+                // https://github.com/terser/terser/issues/1019#issuecomment-877642607
+                if (node instanceof AST_Scope && !(node instanceof AST_Arrow)) {
+                    return true;
+                }
+                if (node instanceof AST_Binary && node.operator == "in") {
+                    return walk_abort;  // makes walk() return true
+                }
+            });
+        }
+        node.print(output, parens);
+    }
+
+    DEFPRINT(AST_VarDef, function(self, output) {
+        self.name.print(output);
+        if (self.value) {
+            output.space();
+            output.print("=");
+            output.space();
+            var p = output.parent(1);
+            var noin = p instanceof AST_For || p instanceof AST_ForIn;
+            parenthesize_for_noin(self.value, output, noin);
+        }
+    });
+
+    /* -----[ other expressions ]----- */
+    DEFPRINT(AST_Call, function(self, output) {
+        self.expression.print(output);
+        if (self instanceof AST_New && self.args.length === 0)
+            return;
+        if (self.expression instanceof AST_Call || self.expression instanceof AST_Lambda) {
+            output.add_mapping(self.start);
+        }
+        if (self.optional) output.print("?.");
+        output.with_parens(function() {
+            self.args.forEach(function(expr, i) {
+                if (i) output.comma();
+                expr.print(output);
+            });
+        });
+    });
+    DEFPRINT(AST_New, function(self, output) {
+        output.print("new");
+        output.space();
+        AST_Call.prototype._codegen(self, output);
+    });
+
+    AST_Sequence.DEFMETHOD("_do_print", function(output) {
+        this.expressions.forEach(function(node, index) {
+            if (index > 0) {
+                output.comma();
+                if (output.should_break()) {
+                    output.newline();
+                    output.indent();
+                }
+            }
+            node.print(output);
+        });
+    });
+    DEFPRINT(AST_Sequence, function(self, output) {
+        self._do_print(output);
+        // var p = output.parent();
+        // if (p instanceof AST_Statement) {
+        //     output.with_indent(output.next_indent(), function(){
+        //         self._do_print(output);
+        //     });
+        // } else {
+        //     self._do_print(output);
+        // }
+    });
+    DEFPRINT(AST_Dot, function(self, output) {
+        var expr = self.expression;
+        expr.print(output);
+        var prop = self.property;
+        var print_computed = ALL_RESERVED_WORDS.has(prop)
+            ? output.option("ie8")
+            : !is_identifier_string(
+                prop,
+                output.option("ecma") >= 2015 || output.option("safari10")
+            );
+
+        if (self.optional) output.print("?.");
+
+        if (print_computed) {
+            output.print("[");
+            output.add_mapping(self.end);
+            output.print_string(prop);
+            output.print("]");
+        } else {
+            if (expr instanceof AST_Number && expr.getValue() >= 0) {
+                if (!/[xa-f.)]/i.test(output.last())) {
+                    output.print(".");
+                }
+            }
+            if (!self.optional) output.print(".");
+            // the name after dot would be mapped about here.
+            output.add_mapping(self.end);
+            output.print_name(prop);
+        }
+    });
+    DEFPRINT(AST_DotHash, function(self, output) {
+        var expr = self.expression;
+        expr.print(output);
+        var prop = self.property;
+
+        if (self.optional) output.print("?");
+        output.print(".#");
+        output.add_mapping(self.end);
+        output.print_name(prop);
+    });
+    DEFPRINT(AST_Sub, function(self, output) {
+        self.expression.print(output);
+        if (self.optional) output.print("?.");
+        output.print("[");
+        self.property.print(output);
+        output.print("]");
+    });
+    DEFPRINT(AST_Chain, function(self, output) {
+        self.expression.print(output);
+    });
+    DEFPRINT(AST_UnaryPrefix, function(self, output) {
+        var op = self.operator;
+        output.print(op);
+        if (/^[a-z]/i.test(op)
+            || (/[+-]$/.test(op)
+                && self.expression instanceof AST_UnaryPrefix
+                && /^[+-]/.test(self.expression.operator))) {
+            output.space();
+        }
+        self.expression.print(output);
+    });
+    DEFPRINT(AST_UnaryPostfix, function(self, output) {
+        self.expression.print(output);
+        output.print(self.operator);
+    });
+    DEFPRINT(AST_Binary, function(self, output) {
+        var op = self.operator;
+        self.left.print(output);
+        if (op[0] == ">" /* ">>" ">>>" ">" ">=" */
+            && self.left instanceof AST_UnaryPostfix
+            && self.left.operator == "--") {
+            // space is mandatory to avoid outputting -->
+            output.print(" ");
+        } else {
+            // the space is optional depending on "beautify"
+            output.space();
+        }
+        output.print(op);
+        if ((op == "<" || op == "<<")
+            && self.right instanceof AST_UnaryPrefix
+            && self.right.operator == "!"
+            && self.right.expression instanceof AST_UnaryPrefix
+            && self.right.expression.operator == "--") {
+            // space is mandatory to avoid outputting <!--
+            output.print(" ");
+        } else {
+            // the space is optional depending on "beautify"
+            output.space();
+        }
+        self.right.print(output);
+    });
+    DEFPRINT(AST_Conditional, function(self, output) {
+        self.condition.print(output);
+        output.space();
+        output.print("?");
+        output.space();
+        self.consequent.print(output);
+        output.space();
+        output.colon();
+        self.alternative.print(output);
+    });
+
+    /* -----[ literals ]----- */
+    DEFPRINT(AST_Array, function(self, output) {
+        output.with_square(function() {
+            var a = self.elements, len = a.length;
+            if (len > 0) output.space();
+            a.forEach(function(exp, i) {
+                if (i) output.comma();
+                exp.print(output);
+                // If the final element is a hole, we need to make sure it
+                // doesn't look like a trailing comma, by inserting an actual
+                // trailing comma.
+                if (i === len - 1 && exp instanceof AST_Hole)
+                  output.comma();
+            });
+            if (len > 0) output.space();
+        });
+    });
+    DEFPRINT(AST_Object, function(self, output) {
+        if (self.properties.length > 0) output.with_block(function() {
+            self.properties.forEach(function(prop, i) {
+                if (i) {
+                    output.print(",");
+                    output.newline();
+                }
+                output.indent();
+                prop.print(output);
+            });
+            output.newline();
+        });
+        else print_braced_empty(self, output);
+    });
+    DEFPRINT(AST_Class, function(self, output) {
+        output.print("class");
+        output.space();
+        if (self.name) {
+            self.name.print(output);
+            output.space();
+        }
+        if (self.extends) {
+            var parens = (
+                   !(self.extends instanceof AST_SymbolRef)
+                && !(self.extends instanceof AST_PropAccess)
+                && !(self.extends instanceof AST_ClassExpression)
+                && !(self.extends instanceof AST_Function)
+            );
+            output.print("extends");
+            if (parens) {
+                output.print("(");
+            } else {
+                output.space();
+            }
+            self.extends.print(output);
+            if (parens) {
+                output.print(")");
+            } else {
+                output.space();
+            }
+        }
+        if (self.properties.length > 0) output.with_block(function() {
+            self.properties.forEach(function(prop, i) {
+                if (i) {
+                    output.newline();
+                }
+                output.indent();
+                prop.print(output);
+            });
+            output.newline();
+        });
+        else output.print("{}");
+    });
+    DEFPRINT(AST_NewTarget, function(self, output) {
+        output.print("new.target");
+    });
+
+    function print_property_name(key, quote, output) {
+        if (output.option("quote_keys")) {
+            return output.print_string(key);
+        }
+        if ("" + +key == key && key >= 0) {
+            if (output.option("keep_numbers")) {
+                return output.print(key);
+            }
+            return output.print(make_num(key));
+        }
+        var print_string = ALL_RESERVED_WORDS.has(key)
+            ? output.option("ie8")
+            : (
+                output.option("ecma") < 2015 || output.option("safari10")
+                    ? !is_basic_identifier_string(key)
+                    : !is_identifier_string(key, true)
+            );
+        if (print_string || (quote && output.option("keep_quoted_props"))) {
+            return output.print_string(key, quote);
+        }
+        return output.print_name(key);
+    }
+
+    DEFPRINT(AST_ObjectKeyVal, function(self, output) {
+        function get_name(self) {
+            var def = self.definition();
+            return def ? def.mangled_name || def.name : self.name;
+        }
+
+        var allowShortHand = output.option("shorthand");
+        if (allowShortHand &&
+            self.value instanceof AST_Symbol &&
+            is_identifier_string(
+                self.key,
+                output.option("ecma") >= 2015 || output.option("safari10")
+            ) &&
+            get_name(self.value) === self.key &&
+            !ALL_RESERVED_WORDS.has(self.key)
+        ) {
+            print_property_name(self.key, self.quote, output);
+
+        } else if (allowShortHand &&
+            self.value instanceof AST_DefaultAssign &&
+            self.value.left instanceof AST_Symbol &&
+            is_identifier_string(
+                self.key,
+                output.option("ecma") >= 2015 || output.option("safari10")
+            ) &&
+            get_name(self.value.left) === self.key
+        ) {
+            print_property_name(self.key, self.quote, output);
+            output.space();
+            output.print("=");
+            output.space();
+            self.value.right.print(output);
+        } else {
+            if (!(self.key instanceof AST_Node)) {
+                print_property_name(self.key, self.quote, output);
+            } else {
+                output.with_square(function() {
+                    self.key.print(output);
+                });
+            }
+            output.colon();
+            self.value.print(output);
+        }
+    });
+    DEFPRINT(AST_ClassPrivateProperty, (self, output) => {
+        if (self.static) {
+            output.print("static");
+            output.space();
+        }
+
+        output.print("#");
+        
+        print_property_name(self.key.name, self.quote, output);
+
+        if (self.value) {
+            output.print("=");
+            self.value.print(output);
+        }
+
+        output.semicolon();
+    });
+    DEFPRINT(AST_ClassProperty, (self, output) => {
+        if (self.static) {
+            output.print("static");
+            output.space();
+        }
+
+        if (self.key instanceof AST_SymbolClassProperty) {
+            print_property_name(self.key.name, self.quote, output);
+        } else {
+            output.print("[");
+            self.key.print(output);
+            output.print("]");
+        }
+
+        if (self.value) {
+            output.print("=");
+            self.value.print(output);
+        }
+
+        output.semicolon();
+    });
+    AST_ObjectProperty.DEFMETHOD("_print_getter_setter", function(type, is_private, output) {
+        var self = this;
+        if (self.static) {
+            output.print("static");
+            output.space();
+        }
+        if (type) {
+            output.print(type);
+            output.space();
+        }
+        if (self.key instanceof AST_SymbolMethod) {
+            if (is_private) output.print("#");
+            print_property_name(self.key.name, self.quote, output);
+        } else {
+            output.with_square(function() {
+                self.key.print(output);
+            });
+        }
+        self.value._do_print(output, true);
+    });
+    DEFPRINT(AST_ObjectSetter, function(self, output) {
+        self._print_getter_setter("set", false, output);
+    });
+    DEFPRINT(AST_ObjectGetter, function(self, output) {
+        self._print_getter_setter("get", false, output);
+    });
+    DEFPRINT(AST_PrivateSetter, function(self, output) {
+        self._print_getter_setter("set", true, output);
+    });
+    DEFPRINT(AST_PrivateGetter, function(self, output) {
+        self._print_getter_setter("get", true, output);
+    });
+    DEFPRINT(AST_PrivateMethod, function(self, output) {
+        var type;
+        if (self.is_generator && self.async) {
+            type = "async*";
+        } else if (self.is_generator) {
+            type = "*";
+        } else if (self.async) {
+            type = "async";
+        }
+        self._print_getter_setter(type, true, output);
+    });
+    DEFPRINT(AST_ConciseMethod, function(self, output) {
+        var type;
+        if (self.is_generator && self.async) {
+            type = "async*";
+        } else if (self.is_generator) {
+            type = "*";
+        } else if (self.async) {
+            type = "async";
+        }
+        self._print_getter_setter(type, false, output);
+    });
+    AST_Symbol.DEFMETHOD("_do_print", function(output) {
+        var def = this.definition();
+        output.print_name(def ? def.mangled_name || def.name : this.name);
+    });
+    DEFPRINT(AST_Symbol, function (self, output) {
+        self._do_print(output);
+    });
+    DEFPRINT(AST_Hole, noop);
+    DEFPRINT(AST_This, function(self, output) {
+        output.print("this");
+    });
+    DEFPRINT(AST_Super, function(self, output) {
+        output.print("super");
+    });
+    DEFPRINT(AST_Constant, function(self, output) {
+        output.print(self.getValue());
+    });
+    DEFPRINT(AST_String, function(self, output) {
+        output.print_string(self.getValue(), self.quote, output.in_directive);
+    });
+    DEFPRINT(AST_Number, function(self, output) {
+        if ((output.option("keep_numbers") || output.use_asm) && self.raw) {
+            output.print(self.raw);
+        } else {
+            output.print(make_num(self.getValue()));
+        }
+    });
+    DEFPRINT(AST_BigInt, function(self, output) {
+        output.print(self.getValue() + "n");
+    });
+
+    const r_slash_script = /(<\s*\/\s*script)/i;
+    const slash_script_replace = (_, $1) => $1.replace("/", "\\/");
+    DEFPRINT(AST_RegExp, function(self, output) {
+        let { source, flags } = self.getValue();
+        source = regexp_source_fix(source);
+        flags = flags ? sort_regexp_flags(flags) : "";
+        source = source.replace(r_slash_script, slash_script_replace);
+
+        output.print(output.to_utf8(`/${source}/${flags}`, false, true));
+
+        const parent = output.parent();
+        if (
+            parent instanceof AST_Binary
+            && /^\w/.test(parent.operator)
+            && parent.left === self
+        ) {
+            output.print(" ");
+        }
+    });
+
+    function force_statement(stat, output) {
+        if (output.option("braces")) {
+            make_block(stat, output);
+        } else {
+            if (!stat || stat instanceof AST_EmptyStatement)
+                output.force_semicolon();
+            else
+                stat.print(output);
+        }
+    }
+
+    function best_of(a) {
+        var best = a[0], len = best.length;
+        for (var i = 1; i < a.length; ++i) {
+            if (a[i].length < len) {
+                best = a[i];
+                len = best.length;
+            }
+        }
+        return best;
+    }
+
+    function make_num(num) {
+        var str = num.toString(10).replace(/^0\./, ".").replace("e+", "e");
+        var candidates = [ str ];
+        if (Math.floor(num) === num) {
+            if (num < 0) {
+                candidates.push("-0x" + (-num).toString(16).toLowerCase());
+            } else {
+                candidates.push("0x" + num.toString(16).toLowerCase());
+            }
+        }
+        var match, len, digits;
+        if (match = /^\.0+/.exec(str)) {
+            len = match[0].length;
+            digits = str.slice(len);
+            candidates.push(digits + "e-" + (digits.length + len - 1));
+        } else if (match = /0+$/.exec(str)) {
+            len = match[0].length;
+            candidates.push(str.slice(0, -len) + "e" + len);
+        } else if (match = /^(\d)\.(\d+)e(-?\d+)$/.exec(str)) {
+            candidates.push(match[1] + match[2] + "e" + (match[3] - match[2].length));
+        }
+        return best_of(candidates);
+    }
+
+    function make_block(stmt, output) {
+        if (!stmt || stmt instanceof AST_EmptyStatement)
+            output.print("{}");
+        else if (stmt instanceof AST_BlockStatement)
+            stmt.print(output);
+        else output.with_block(function() {
+            output.indent();
+            stmt.print(output);
+            output.newline();
+        });
+    }
+
+    /* -----[ source map generators ]----- */
+
+    function DEFMAP(nodetype, generator) {
+        nodetype.forEach(function(nodetype) {
+            nodetype.DEFMETHOD("add_source_map", generator);
+        });
+    }
+
+    DEFMAP([
+        // We could easily add info for ALL nodes, but it seems to me that
+        // would be quite wasteful, hence this noop in the base class.
+        AST_Node,
+        // since the label symbol will mark it
+        AST_LabeledStatement,
+        AST_Toplevel,
+    ], noop);
+
+    // XXX: I'm not exactly sure if we need it for all of these nodes,
+    // or if we should add even more.
+    DEFMAP([
+        AST_Array,
+        AST_BlockStatement,
+        AST_Catch,
+        AST_Class,
+        AST_Constant,
+        AST_Debugger,
+        AST_Definitions,
+        AST_Directive,
+        AST_Finally,
+        AST_Jump,
+        AST_Lambda,
+        AST_New,
+        AST_Object,
+        AST_StatementWithBody,
+        AST_Symbol,
+        AST_Switch,
+        AST_SwitchBranch,
+        AST_TemplateString,
+        AST_TemplateSegment,
+        AST_Try,
+    ], function(output) {
+        output.add_mapping(this.start);
+    });
+
+    DEFMAP([
+        AST_ObjectGetter,
+        AST_ObjectSetter,
+        AST_PrivateGetter,
+        AST_PrivateSetter,
+    ], function(output) {
+        output.add_mapping(this.key.end, this.key.name);
+    });
+
+    DEFMAP([ AST_ObjectProperty ], function(output) {
+        output.add_mapping(this.start, this.key);
+    });
+})();
+
+const shallow_cmp = (node1, node2) => {
+    return (
+        node1 === null && node2 === null
+        || node1.TYPE === node2.TYPE && node1.shallow_cmp(node2)
+    );
+};
+
+const equivalent_to = (tree1, tree2) => {
+    if (!shallow_cmp(tree1, tree2)) return false;
+    const walk_1_state = [tree1];
+    const walk_2_state = [tree2];
+
+    const walk_1_push = walk_1_state.push.bind(walk_1_state);
+    const walk_2_push = walk_2_state.push.bind(walk_2_state);
+
+    while (walk_1_state.length && walk_2_state.length) {
+        const node_1 = walk_1_state.pop();
+        const node_2 = walk_2_state.pop();
+
+        if (!shallow_cmp(node_1, node_2)) return false;
+
+        node_1._children_backwards(walk_1_push);
+        node_2._children_backwards(walk_2_push);
+
+        if (walk_1_state.length !== walk_2_state.length) {
+            // Different number of children
+            return false;
+        }
+    }
+
+    return walk_1_state.length == 0 && walk_2_state.length == 0;
+};
+
+// Creates a shallow compare function
+const mkshallow = (props) => {
+    const comparisons = Object
+        .keys(props)
+        .map(key => {
+            if (props[key] === "eq") {
+                return `this.${key} === other.${key}`;
+            } else if (props[key] === "exist") {
+                return `(this.${key} == null ? other.${key} == null : this.${key} === other.${key})`;
+            } else {
+                throw new Error(`mkshallow: Unexpected instruction: ${props[key]}`);
+            }
+        })
+        .join(" && ");
+
+    return new Function("other", "return " + comparisons);
+};
+
+const pass_through = () => true;
+
+AST_Node.prototype.shallow_cmp = function () {
+    throw new Error("did not find a shallow_cmp function for " + this.constructor.name);
+};
+
+AST_Debugger.prototype.shallow_cmp = pass_through;
+
+AST_Directive.prototype.shallow_cmp = mkshallow({ value: "eq" });
+
+AST_SimpleStatement.prototype.shallow_cmp = pass_through;
+
+AST_Block.prototype.shallow_cmp = pass_through;
+
+AST_EmptyStatement.prototype.shallow_cmp = pass_through;
+
+AST_LabeledStatement.prototype.shallow_cmp = mkshallow({ "label.name": "eq" });
+
+AST_Do.prototype.shallow_cmp = pass_through;
+
+AST_While.prototype.shallow_cmp = pass_through;
+
+AST_For.prototype.shallow_cmp = mkshallow({
+    init: "exist",
+    condition: "exist",
+    step: "exist"
+});
+
+AST_ForIn.prototype.shallow_cmp = pass_through;
+
+AST_ForOf.prototype.shallow_cmp = pass_through;
+
+AST_With.prototype.shallow_cmp = pass_through;
+
+AST_Toplevel.prototype.shallow_cmp = pass_through;
+
+AST_Expansion.prototype.shallow_cmp = pass_through;
+
+AST_Lambda.prototype.shallow_cmp = mkshallow({
+    is_generator: "eq",
+    async: "eq"
+});
+
+AST_Destructuring.prototype.shallow_cmp = mkshallow({
+    is_array: "eq"
+});
+
+AST_PrefixedTemplateString.prototype.shallow_cmp = pass_through;
+
+AST_TemplateString.prototype.shallow_cmp = pass_through;
+
+AST_TemplateSegment.prototype.shallow_cmp = mkshallow({
+    "value": "eq"
+});
+
+AST_Jump.prototype.shallow_cmp = pass_through;
+
+AST_LoopControl.prototype.shallow_cmp = pass_through;
+
+AST_Await.prototype.shallow_cmp = pass_through;
+
+AST_Yield.prototype.shallow_cmp = mkshallow({
+    is_star: "eq"
+});
+
+AST_If.prototype.shallow_cmp = mkshallow({
+    alternative: "exist"
+});
+
+AST_Switch.prototype.shallow_cmp = pass_through;
+
+AST_SwitchBranch.prototype.shallow_cmp = pass_through;
+
+AST_Try.prototype.shallow_cmp = mkshallow({
+    bcatch: "exist",
+    bfinally: "exist"
+});
+
+AST_Catch.prototype.shallow_cmp = mkshallow({
+    argname: "exist"
+});
+
+AST_Finally.prototype.shallow_cmp = pass_through;
+
+AST_Definitions.prototype.shallow_cmp = pass_through;
+
+AST_VarDef.prototype.shallow_cmp = mkshallow({
+    value: "exist"
+});
+
+AST_NameMapping.prototype.shallow_cmp = pass_through;
+
+AST_Import.prototype.shallow_cmp = mkshallow({
+    imported_name: "exist",
+    imported_names: "exist"
+});
+
+AST_ImportMeta.prototype.shallow_cmp = pass_through;
+
+AST_Export.prototype.shallow_cmp = mkshallow({
+    exported_definition: "exist",
+    exported_value: "exist",
+    exported_names: "exist",
+    module_name: "eq",
+    is_default: "eq",
+});
+
+AST_Call.prototype.shallow_cmp = pass_through;
+
+AST_Sequence.prototype.shallow_cmp = pass_through;
+
+AST_PropAccess.prototype.shallow_cmp = pass_through;
+
+AST_Chain.prototype.shallow_cmp = pass_through;
+
+AST_Dot.prototype.shallow_cmp = mkshallow({
+    property: "eq"
+});
+
+AST_DotHash.prototype.shallow_cmp = mkshallow({
+    property: "eq"
+});
+
+AST_Unary.prototype.shallow_cmp = mkshallow({
+    operator: "eq"
+});
+
+AST_Binary.prototype.shallow_cmp = mkshallow({
+    operator: "eq"
+});
+
+AST_Conditional.prototype.shallow_cmp = pass_through;
+
+AST_Array.prototype.shallow_cmp = pass_through;
+
+AST_Object.prototype.shallow_cmp = pass_through;
+
+AST_ObjectProperty.prototype.shallow_cmp = pass_through;
+
+AST_ObjectKeyVal.prototype.shallow_cmp = mkshallow({
+    key: "eq"
+});
+
+AST_ObjectSetter.prototype.shallow_cmp = mkshallow({
+    static: "eq"
+});
+
+AST_ObjectGetter.prototype.shallow_cmp = mkshallow({
+    static: "eq"
+});
+
+AST_ConciseMethod.prototype.shallow_cmp = mkshallow({
+    static: "eq",
+    is_generator: "eq",
+    async: "eq",
+});
+
+AST_Class.prototype.shallow_cmp = mkshallow({
+    name: "exist",
+    extends: "exist",
+});
+
+AST_ClassProperty.prototype.shallow_cmp = mkshallow({
+    static: "eq"
+});
+
+AST_Symbol.prototype.shallow_cmp = mkshallow({
+    name: "eq"
+});
+
+AST_NewTarget.prototype.shallow_cmp = pass_through;
+
+AST_This.prototype.shallow_cmp = pass_through;
+
+AST_Super.prototype.shallow_cmp = pass_through;
+
+AST_String.prototype.shallow_cmp = mkshallow({
+    value: "eq"
+});
+
+AST_Number.prototype.shallow_cmp = mkshallow({
+    value: "eq"
+});
+
+AST_BigInt.prototype.shallow_cmp = mkshallow({
+    value: "eq"
+});
+
+AST_RegExp.prototype.shallow_cmp = function (other) {
+    return (
+        this.value.flags === other.value.flags
+        && this.value.source === other.value.source
+    );
+};
+
+AST_Atom.prototype.shallow_cmp = pass_through;
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+const MASK_EXPORT_DONT_MANGLE = 1 << 0;
+const MASK_EXPORT_WANT_MANGLE = 1 << 1;
+
+let function_defs = null;
+let unmangleable_names = null;
+/**
+ * When defined, there is a function declaration somewhere that's inside of a block.
+ * See https://tc39.es/ecma262/multipage/additional-ecmascript-features-for-web-browsers.html#sec-block-level-function-declarations-web-legacy-compatibility-semantics
+*/
+let scopes_with_block_defuns = null;
+
+class SymbolDef {
+    constructor(scope, orig, init) {
+        this.name = orig.name;
+        this.orig = [ orig ];
+        this.init = init;
+        this.eliminated = 0;
+        this.assignments = 0;
+        this.scope = scope;
+        this.replaced = 0;
+        this.global = false;
+        this.export = 0;
+        this.mangled_name = null;
+        this.undeclared = false;
+        this.id = SymbolDef.next_id++;
+        this.chained = false;
+        this.direct_access = false;
+        this.escaped = 0;
+        this.recursive_refs = 0;
+        this.references = [];
+        this.should_replace = undefined;
+        this.single_use = false;
+        this.fixed = false;
+        Object.seal(this);
+    }
+    fixed_value() {
+        if (!this.fixed || this.fixed instanceof AST_Node) return this.fixed;
+        return this.fixed();
+    }
+    unmangleable(options) {
+        if (!options) options = {};
+
+        if (
+            function_defs &&
+            function_defs.has(this.id) &&
+            keep_name(options.keep_fnames, this.orig[0].name)
+        ) return true;
+
+        return this.global && !options.toplevel
+            || (this.export & MASK_EXPORT_DONT_MANGLE)
+            || this.undeclared
+            || !options.eval && this.scope.pinned()
+            || (this.orig[0] instanceof AST_SymbolLambda
+                  || this.orig[0] instanceof AST_SymbolDefun) && keep_name(options.keep_fnames, this.orig[0].name)
+            || this.orig[0] instanceof AST_SymbolMethod
+            || (this.orig[0] instanceof AST_SymbolClass
+                  || this.orig[0] instanceof AST_SymbolDefClass) && keep_name(options.keep_classnames, this.orig[0].name);
+    }
+    mangle(options) {
+        const cache = options.cache && options.cache.props;
+        if (this.global && cache && cache.has(this.name)) {
+            this.mangled_name = cache.get(this.name);
+        } else if (!this.mangled_name && !this.unmangleable(options)) {
+            var s = this.scope;
+            var sym = this.orig[0];
+            if (options.ie8 && sym instanceof AST_SymbolLambda)
+                s = s.parent_scope;
+            const redefinition = redefined_catch_def(this);
+            this.mangled_name = redefinition
+                ? redefinition.mangled_name || redefinition.name
+                : s.next_mangled(options, this);
+            if (this.global && cache) {
+                cache.set(this.name, this.mangled_name);
+            }
+        }
+    }
+}
+
+SymbolDef.next_id = 1;
+
+function redefined_catch_def(def) {
+    if (def.orig[0] instanceof AST_SymbolCatch
+        && def.scope.is_block_scope()
+    ) {
+        return def.scope.get_defun_scope().variables.get(def.name);
+    }
+}
+
+AST_Scope.DEFMETHOD("figure_out_scope", function(options, { parent_scope = null, toplevel = this } = {}) {
+    options = defaults(options, {
+        cache: null,
+        ie8: false,
+        safari10: false,
+    });
+
+    if (!(toplevel instanceof AST_Toplevel)) {
+        throw new Error("Invalid toplevel scope");
+    }
+
+    // pass 1: setup scope chaining and handle definitions
+    var scope = this.parent_scope = parent_scope;
+    var labels = new Map();
+    var defun = null;
+    var in_destructuring = null;
+    var for_scopes = [];
+    var tw = new TreeWalker((node, descend) => {
+        if (node.is_block_scope()) {
+            const save_scope = scope;
+            node.block_scope = scope = new AST_Scope(node);
+            scope._block_scope = true;
+            // AST_Try in the AST sadly *is* (not has) a body itself,
+            // and its catch and finally branches are children of the AST_Try itself
+            const parent_scope = node instanceof AST_Catch
+                ? save_scope.parent_scope
+                : save_scope;
+            scope.init_scope_vars(parent_scope);
+            scope.uses_with = save_scope.uses_with;
+            scope.uses_eval = save_scope.uses_eval;
+            if (options.safari10) {
+                if (node instanceof AST_For || node instanceof AST_ForIn) {
+                    for_scopes.push(scope);
+                }
+            }
+
+            if (node instanceof AST_Switch) {
+                // XXX: HACK! Ensure the switch expression gets the correct scope (the parent scope) and the body gets the contained scope
+                // AST_Switch has a scope within the body, but it itself "is a block scope"
+                // This means the switched expression has to belong to the outer scope
+                // while the body inside belongs to the switch itself.
+                // This is pretty nasty and warrants an AST change similar to AST_Try (read above)
+                const the_block_scope = scope;
+                scope = save_scope;
+                node.expression.walk(tw);
+                scope = the_block_scope;
+                for (let i = 0; i < node.body.length; i++) {
+                    node.body[i].walk(tw);
+                }
+            } else {
+                descend();
+            }
+            scope = save_scope;
+            return true;
+        }
+        if (node instanceof AST_Destructuring) {
+            const save_destructuring = in_destructuring;
+            in_destructuring = node;
+            descend();
+            in_destructuring = save_destructuring;
+            return true;
+        }
+        if (node instanceof AST_Scope) {
+            node.init_scope_vars(scope);
+            var save_scope = scope;
+            var save_defun = defun;
+            var save_labels = labels;
+            defun = scope = node;
+            labels = new Map();
+            descend();
+            scope = save_scope;
+            defun = save_defun;
+            labels = save_labels;
+            return true;        // don't descend again in TreeWalker
+        }
+        if (node instanceof AST_LabeledStatement) {
+            var l = node.label;
+            if (labels.has(l.name)) {
+                throw new Error(string_template("Label {name} defined twice", l));
+            }
+            labels.set(l.name, l);
+            descend();
+            labels.delete(l.name);
+            return true;        // no descend again
+        }
+        if (node instanceof AST_With) {
+            for (var s = scope; s; s = s.parent_scope)
+                s.uses_with = true;
+            return;
+        }
+        if (node instanceof AST_Symbol) {
+            node.scope = scope;
+        }
+        if (node instanceof AST_Label) {
+            node.thedef = node;
+            node.references = [];
+        }
+        if (node instanceof AST_SymbolLambda) {
+            defun.def_function(node, node.name == "arguments" ? undefined : defun);
+        } else if (node instanceof AST_SymbolDefun) {
+            // Careful here, the scope where this should be defined is
+            // the parent scope.  The reason is that we enter a new
+            // scope when we encounter the AST_Defun node (which is
+            // instanceof AST_Scope) but we get to the symbol a bit
+            // later.
+            const closest_scope = defun.parent_scope;
+
+            // In strict mode, function definitions are block-scoped
+            node.scope = tw.directives["use strict"]
+                ? closest_scope
+                : closest_scope.get_defun_scope();
+
+            mark_export(node.scope.def_function(node, defun), 1);
+        } else if (node instanceof AST_SymbolClass) {
+            mark_export(defun.def_variable(node, defun), 1);
+        } else if (node instanceof AST_SymbolImport) {
+            scope.def_variable(node);
+        } else if (node instanceof AST_SymbolDefClass) {
+            // This deals with the name of the class being available
+            // inside the class.
+            mark_export((node.scope = defun.parent_scope).def_function(node, defun), 1);
+        } else if (
+            node instanceof AST_SymbolVar
+            || node instanceof AST_SymbolLet
+            || node instanceof AST_SymbolConst
+            || node instanceof AST_SymbolCatch
+        ) {
+            var def;
+            if (node instanceof AST_SymbolBlockDeclaration) {
+                def = scope.def_variable(node, null);
+            } else {
+                def = defun.def_variable(node, node.TYPE == "SymbolVar" ? null : undefined);
+            }
+            if (!def.orig.every((sym) => {
+                if (sym === node) return true;
+                if (node instanceof AST_SymbolBlockDeclaration) {
+                    return sym instanceof AST_SymbolLambda;
+                }
+                return !(sym instanceof AST_SymbolLet || sym instanceof AST_SymbolConst);
+            })) {
+                js_error(
+                    `"${node.name}" is redeclared`,
+                    node.start.file,
+                    node.start.line,
+                    node.start.col,
+                    node.start.pos
+                );
+            }
+            if (!(node instanceof AST_SymbolFunarg)) mark_export(def, 2);
+            if (defun !== scope) {
+                node.mark_enclosed();
+                var def = scope.find_variable(node);
+                if (node.thedef !== def) {
+                    node.thedef = def;
+                    node.reference();
+                }
+            }
+        } else if (node instanceof AST_LabelRef) {
+            var sym = labels.get(node.name);
+            if (!sym) throw new Error(string_template("Undefined label {name} [{line},{col}]", {
+                name: node.name,
+                line: node.start.line,
+                col: node.start.col
+            }));
+            node.thedef = sym;
+        }
+        if (!(scope instanceof AST_Toplevel) && (node instanceof AST_Export || node instanceof AST_Import)) {
+            js_error(
+                `"${node.TYPE}" statement may only appear at the top level`,
+                node.start.file,
+                node.start.line,
+                node.start.col,
+                node.start.pos
+            );
+        }
+    });
+    this.walk(tw);
+
+    function mark_export(def, level) {
+        if (in_destructuring) {
+            var i = 0;
+            do {
+                level++;
+            } while (tw.parent(i++) !== in_destructuring);
+        }
+        var node = tw.parent(level);
+        if (def.export = node instanceof AST_Export ? MASK_EXPORT_DONT_MANGLE : 0) {
+            var exported = node.exported_definition;
+            if ((exported instanceof AST_Defun || exported instanceof AST_DefClass) && node.is_default) {
+                def.export = MASK_EXPORT_WANT_MANGLE;
+            }
+        }
+    }
+
+    // pass 2: find back references and eval
+    const is_toplevel = this instanceof AST_Toplevel;
+    if (is_toplevel) {
+        this.globals = new Map();
+    }
+
+    var tw = new TreeWalker(node => {
+        if (node instanceof AST_LoopControl && node.label) {
+            node.label.thedef.references.push(node);
+            return true;
+        }
+        if (node instanceof AST_SymbolRef) {
+            var name = node.name;
+            if (name == "eval" && tw.parent() instanceof AST_Call) {
+                for (var s = node.scope; s && !s.uses_eval; s = s.parent_scope) {
+                    s.uses_eval = true;
+                }
+            }
+            var sym;
+            if (tw.parent() instanceof AST_NameMapping && tw.parent(1).module_name
+                || !(sym = node.scope.find_variable(name))) {
+
+                sym = toplevel.def_global(node);
+                if (node instanceof AST_SymbolExport) sym.export = MASK_EXPORT_DONT_MANGLE;
+            } else if (sym.scope instanceof AST_Lambda && name == "arguments") {
+                sym.scope.uses_arguments = true;
+            }
+            node.thedef = sym;
+            node.reference();
+            if (node.scope.is_block_scope()
+                && !(sym.orig[0] instanceof AST_SymbolBlockDeclaration)) {
+                node.scope = node.scope.get_defun_scope();
+            }
+            return true;
+        }
+        // ensure mangling works if catch reuses a scope variable
+        var def;
+        if (node instanceof AST_SymbolCatch && (def = redefined_catch_def(node.definition()))) {
+            var s = node.scope;
+            while (s) {
+                push_uniq(s.enclosed, def);
+                if (s === def.scope) break;
+                s = s.parent_scope;
+            }
+        }
+    });
+    this.walk(tw);
+
+    // pass 3: work around IE8 and Safari catch scope bugs
+    if (options.ie8 || options.safari10) {
+        walk(this, node => {
+            if (node instanceof AST_SymbolCatch) {
+                var name = node.name;
+                var refs = node.thedef.references;
+                var scope = node.scope.get_defun_scope();
+                var def = scope.find_variable(name)
+                    || toplevel.globals.get(name)
+                    || scope.def_variable(node);
+                refs.forEach(function(ref) {
+                    ref.thedef = def;
+                    ref.reference();
+                });
+                node.thedef = def;
+                node.reference();
+                return true;
+            }
+        });
+    }
+
+    // pass 4: add symbol definitions to loop scopes
+    // Safari/Webkit bug workaround - loop init let variable shadowing argument.
+    // https://github.com/mishoo/UglifyJS2/issues/1753
+    // https://bugs.webkit.org/show_bug.cgi?id=171041
+    if (options.safari10) {
+        for (const scope of for_scopes) {
+            scope.parent_scope.variables.forEach(function(def) {
+                push_uniq(scope.enclosed, def);
+            });
+        }
+    }
+});
+
+AST_Toplevel.DEFMETHOD("def_global", function(node) {
+    var globals = this.globals, name = node.name;
+    if (globals.has(name)) {
+        return globals.get(name);
+    } else {
+        var g = new SymbolDef(this, node);
+        g.undeclared = true;
+        g.global = true;
+        globals.set(name, g);
+        return g;
+    }
+});
+
+AST_Scope.DEFMETHOD("init_scope_vars", function(parent_scope) {
+    this.variables = new Map();         // map name to AST_SymbolVar (variables defined in this scope; includes functions)
+    this.uses_with = false;             // will be set to true if this or some nested scope uses the `with` statement
+    this.uses_eval = false;             // will be set to true if this or nested scope uses the global `eval`
+    this.parent_scope = parent_scope;   // the parent scope
+    this.enclosed = [];                 // a list of variables from this or outer scope(s) that are referenced from this or inner scopes
+    this.cname = -1;                    // the current index for mangling functions/variables
+});
+
+AST_Scope.DEFMETHOD("conflicting_def", function (name) {
+    return (
+        this.enclosed.find(def => def.name === name)
+        || this.variables.has(name)
+        || (this.parent_scope && this.parent_scope.conflicting_def(name))
+    );
+});
+
+AST_Scope.DEFMETHOD("conflicting_def_shallow", function (name) {
+    return (
+        this.enclosed.find(def => def.name === name)
+        || this.variables.has(name)
+    );
+});
+
+AST_Scope.DEFMETHOD("add_child_scope", function (scope) {
+    // `scope` is going to be moved into `this` right now.
+    // Update the required scopes' information
+
+    if (scope.parent_scope === this) return;
+
+    scope.parent_scope = this;
+
+    // TODO uses_with, uses_eval, etc
+
+    const scope_ancestry = (() => {
+        const ancestry = [];
+        let cur = this;
+        do {
+            ancestry.push(cur);
+        } while ((cur = cur.parent_scope));
+        ancestry.reverse();
+        return ancestry;
+    })();
+
+    const new_scope_enclosed_set = new Set(scope.enclosed);
+    const to_enclose = [];
+    for (const scope_topdown of scope_ancestry) {
+        to_enclose.forEach(e => push_uniq(scope_topdown.enclosed, e));
+        for (const def of scope_topdown.variables.values()) {
+            if (new_scope_enclosed_set.has(def)) {
+                push_uniq(to_enclose, def);
+                push_uniq(scope_topdown.enclosed, def);
+            }
+        }
+    }
+});
+
+function find_scopes_visible_from(scopes) {
+    const found_scopes = new Set();
+
+    for (const scope of new Set(scopes)) {
+        (function bubble_up(scope) {
+            if (scope == null || found_scopes.has(scope)) return;
+
+            found_scopes.add(scope);
+
+            bubble_up(scope.parent_scope);
+        })(scope);
+    }
+
+    return [...found_scopes];
+}
+
+// Creates a symbol during compression
+AST_Scope.DEFMETHOD("create_symbol", function(SymClass, {
+    source,
+    tentative_name,
+    scope,
+    conflict_scopes = [scope],
+    init = null
+} = {}) {
+    let symbol_name;
+
+    conflict_scopes = find_scopes_visible_from(conflict_scopes);
+
+    if (tentative_name) {
+        // Implement hygiene (no new names are conflicting with existing names)
+        tentative_name =
+            symbol_name =
+            tentative_name.replace(/(?:^[^a-z_$]|[^a-z0-9_$])/ig, "_");
+
+        let i = 0;
+        while (conflict_scopes.find(s => s.conflicting_def_shallow(symbol_name))) {
+            symbol_name = tentative_name + "$" + i++;
+        }
+    }
+
+    if (!symbol_name) {
+        throw new Error("No symbol name could be generated in create_symbol()");
+    }
+
+    const symbol = make_node(SymClass, source, {
+        name: symbol_name,
+        scope
+    });
+
+    this.def_variable(symbol, init || null);
+
+    symbol.mark_enclosed();
+
+    return symbol;
+});
+
+
+AST_Node.DEFMETHOD("is_block_scope", return_false);
+AST_Class.DEFMETHOD("is_block_scope", return_false);
+AST_Lambda.DEFMETHOD("is_block_scope", return_false);
+AST_Toplevel.DEFMETHOD("is_block_scope", return_false);
+AST_SwitchBranch.DEFMETHOD("is_block_scope", return_false);
+AST_Block.DEFMETHOD("is_block_scope", return_true);
+AST_Scope.DEFMETHOD("is_block_scope", function () {
+    return this._block_scope || false;
+});
+AST_IterationStatement.DEFMETHOD("is_block_scope", return_true);
+
+AST_Lambda.DEFMETHOD("init_scope_vars", function() {
+    AST_Scope.prototype.init_scope_vars.apply(this, arguments);
+    this.uses_arguments = false;
+    this.def_variable(new AST_SymbolFunarg({
+        name: "arguments",
+        start: this.start,
+        end: this.end
+    }));
+});
+
+AST_Arrow.DEFMETHOD("init_scope_vars", function() {
+    AST_Scope.prototype.init_scope_vars.apply(this, arguments);
+    this.uses_arguments = false;
+});
+
+AST_Symbol.DEFMETHOD("mark_enclosed", function() {
+    var def = this.definition();
+    var s = this.scope;
+    while (s) {
+        push_uniq(s.enclosed, def);
+        if (s === def.scope) break;
+        s = s.parent_scope;
+    }
+});
+
+AST_Symbol.DEFMETHOD("reference", function() {
+    this.definition().references.push(this);
+    this.mark_enclosed();
+});
+
+AST_Scope.DEFMETHOD("find_variable", function(name) {
+    if (name instanceof AST_Symbol) name = name.name;
+    return this.variables.get(name)
+        || (this.parent_scope && this.parent_scope.find_variable(name));
+});
+
+AST_Scope.DEFMETHOD("def_function", function(symbol, init) {
+    var def = this.def_variable(symbol, init);
+    if (!def.init || def.init instanceof AST_Defun) def.init = init;
+    return def;
+});
+
+AST_Scope.DEFMETHOD("def_variable", function(symbol, init) {
+    var def = this.variables.get(symbol.name);
+    if (def) {
+        def.orig.push(symbol);
+        if (def.init && (def.scope !== symbol.scope || def.init instanceof AST_Function)) {
+            def.init = init;
+        }
+    } else {
+        def = new SymbolDef(this, symbol, init);
+        this.variables.set(symbol.name, def);
+        def.global = !this.parent_scope;
+    }
+    return symbol.thedef = def;
+});
+
+function next_mangled(scope, options) {
+    let defun_scope;
+    if (
+        scopes_with_block_defuns
+        && (defun_scope = scope.get_defun_scope())
+        && scopes_with_block_defuns.has(defun_scope)
+    ) {
+        scope = defun_scope;
+    }
+
+    var ext = scope.enclosed;
+    var nth_identifier = options.nth_identifier;
+    out: while (true) {
+        var m = nth_identifier.get(++scope.cname);
+        if (ALL_RESERVED_WORDS.has(m)) continue; // skip over "do"
+
+        // https://github.com/mishoo/UglifyJS2/issues/242 -- do not
+        // shadow a name reserved from mangling.
+        if (options.reserved.has(m)) continue;
+
+        // Functions with short names might collide with base54 output
+        // and therefore cause collisions when keep_fnames is true.
+        if (unmangleable_names && unmangleable_names.has(m)) continue out;
+
+        // we must ensure that the mangled name does not shadow a name
+        // from some parent scope that is referenced in this or in
+        // inner scopes.
+        for (let i = ext.length; --i >= 0;) {
+            const def = ext[i];
+            const name = def.mangled_name || (def.unmangleable(options) && def.name);
+            if (m == name) continue out;
+        }
+        return m;
+    }
+}
+
+AST_Scope.DEFMETHOD("next_mangled", function(options) {
+    return next_mangled(this, options);
+});
+
+AST_Toplevel.DEFMETHOD("next_mangled", function(options) {
+    let name;
+    const mangled_names = this.mangled_names;
+    do {
+        name = next_mangled(this, options);
+    } while (mangled_names.has(name));
+    return name;
+});
+
+AST_Function.DEFMETHOD("next_mangled", function(options, def) {
+    // #179, #326
+    // in Safari strict mode, something like (function x(x){...}) is a syntax error;
+    // a function expression's argument cannot shadow the function expression's name
+
+    var tricky_def = def.orig[0] instanceof AST_SymbolFunarg && this.name && this.name.definition();
+
+    // the function's mangled_name is null when keep_fnames is true
+    var tricky_name = tricky_def ? tricky_def.mangled_name || tricky_def.name : null;
+
+    while (true) {
+        var name = next_mangled(this, options);
+        if (!tricky_name || tricky_name != name)
+            return name;
+    }
+});
+
+AST_Symbol.DEFMETHOD("unmangleable", function(options) {
+    var def = this.definition();
+    return !def || def.unmangleable(options);
+});
+
+// labels are always mangleable
+AST_Label.DEFMETHOD("unmangleable", return_false);
+
+AST_Symbol.DEFMETHOD("unreferenced", function() {
+    return !this.definition().references.length && !this.scope.pinned();
+});
+
+AST_Symbol.DEFMETHOD("definition", function() {
+    return this.thedef;
+});
+
+AST_Symbol.DEFMETHOD("global", function() {
+    return this.thedef.global;
+});
+
+AST_Toplevel.DEFMETHOD("_default_mangler_options", function(options) {
+    options = defaults(options, {
+        eval        : false,
+        nth_identifier : base54,
+        ie8         : false,
+        keep_classnames: false,
+        keep_fnames : false,
+        module      : false,
+        reserved    : [],
+        toplevel    : false,
+    });
+    if (options.module) options.toplevel = true;
+    if (!Array.isArray(options.reserved)
+        && !(options.reserved instanceof Set)
+    ) {
+        options.reserved = [];
+    }
+    options.reserved = new Set(options.reserved);
+    // Never mangle arguments
+    options.reserved.add("arguments");
+    return options;
+});
+
+AST_Toplevel.DEFMETHOD("mangle_names", function(options) {
+    options = this._default_mangler_options(options);
+    var nth_identifier = options.nth_identifier;
+
+    // We only need to mangle declaration nodes.  Special logic wired
+    // into the code generator will display the mangled name if it's
+    // present (and for AST_SymbolRef-s it'll use the mangled name of
+    // the AST_SymbolDeclaration that it points to).
+    var lname = -1;
+    var to_mangle = [];
+
+    if (options.keep_fnames) {
+        function_defs = new Set();
+    }
+
+    const mangled_names = this.mangled_names = new Set();
+    unmangleable_names = new Set();
+
+    if (options.cache) {
+        this.globals.forEach(collect);
+        if (options.cache.props) {
+            options.cache.props.forEach(function(mangled_name) {
+                mangled_names.add(mangled_name);
+            });
+        }
+    }
+
+    var tw = new TreeWalker(function(node, descend) {
+        if (node instanceof AST_LabeledStatement) {
+            // lname is incremented when we get to the AST_Label
+            var save_nesting = lname;
+            descend();
+            lname = save_nesting;
+            return true;        // don't descend again in TreeWalker
+        }
+        if (
+            node instanceof AST_Defun
+            && !(tw.parent() instanceof AST_Scope)
+        ) {
+            scopes_with_block_defuns = scopes_with_block_defuns || new Set();
+            scopes_with_block_defuns.add(node.parent_scope.get_defun_scope());
+        }
+        if (node instanceof AST_Scope) {
+            node.variables.forEach(collect);
+            return;
+        }
+        if (node.is_block_scope()) {
+            node.block_scope.variables.forEach(collect);
+            return;
+        }
+        if (
+            function_defs
+            && node instanceof AST_VarDef
+            && node.value instanceof AST_Lambda
+            && !node.value.name
+            && keep_name(options.keep_fnames, node.name.name)
+        ) {
+            function_defs.add(node.name.definition().id);
+            return;
+        }
+        if (node instanceof AST_Label) {
+            let name;
+            do {
+                name = nth_identifier.get(++lname);
+            } while (ALL_RESERVED_WORDS.has(name));
+            node.mangled_name = name;
+            return true;
+        }
+        if (!(options.ie8 || options.safari10) && node instanceof AST_SymbolCatch) {
+            to_mangle.push(node.definition());
+            return;
+        }
+    });
+
+    this.walk(tw);
+
+    if (options.keep_fnames || options.keep_classnames) {
+        // Collect a set of short names which are unmangleable,
+        // for use in avoiding collisions in next_mangled.
+        to_mangle.forEach(def => {
+            if (def.name.length < 6 && def.unmangleable(options)) {
+                unmangleable_names.add(def.name);
+            }
+        });
+    }
+
+    to_mangle.forEach(def => { def.mangle(options); });
+
+    function_defs = null;
+    unmangleable_names = null;
+    scopes_with_block_defuns = null;
+
+    function collect(symbol) {
+        if (symbol.export & MASK_EXPORT_DONT_MANGLE) {
+            unmangleable_names.add(symbol.name);
+        } else if (!options.reserved.has(symbol.name)) {
+            to_mangle.push(symbol);
+        }
+    }
+});
+
+AST_Toplevel.DEFMETHOD("find_colliding_names", function(options) {
+    const cache = options.cache && options.cache.props;
+    const avoid = new Set();
+    options.reserved.forEach(to_avoid);
+    this.globals.forEach(add_def);
+    this.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_Scope) node.variables.forEach(add_def);
+        if (node instanceof AST_SymbolCatch) add_def(node.definition());
+    }));
+    return avoid;
+
+    function to_avoid(name) {
+        avoid.add(name);
+    }
+
+    function add_def(def) {
+        var name = def.name;
+        if (def.global && cache && cache.has(name)) name = cache.get(name);
+        else if (!def.unmangleable(options)) return;
+        to_avoid(name);
+    }
+});
+
+AST_Toplevel.DEFMETHOD("expand_names", function(options) {
+    options = this._default_mangler_options(options);
+    var nth_identifier = options.nth_identifier;
+    if (nth_identifier.reset && nth_identifier.sort) {
+        nth_identifier.reset();
+        nth_identifier.sort();
+    }
+    var avoid = this.find_colliding_names(options);
+    var cname = 0;
+    this.globals.forEach(rename);
+    this.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_Scope) node.variables.forEach(rename);
+        if (node instanceof AST_SymbolCatch) rename(node.definition());
+    }));
+
+    function next_name() {
+        var name;
+        do {
+            name = nth_identifier.get(cname++);
+        } while (avoid.has(name) || ALL_RESERVED_WORDS.has(name));
+        return name;
+    }
+
+    function rename(def) {
+        if (def.global && options.cache) return;
+        if (def.unmangleable(options)) return;
+        if (options.reserved.has(def.name)) return;
+        const redefinition = redefined_catch_def(def);
+        const name = def.name = redefinition ? redefinition.name : next_name();
+        def.orig.forEach(function(sym) {
+            sym.name = name;
+        });
+        def.references.forEach(function(sym) {
+            sym.name = name;
+        });
+    }
+});
+
+AST_Node.DEFMETHOD("tail_node", return_this);
+AST_Sequence.DEFMETHOD("tail_node", function() {
+    return this.expressions[this.expressions.length - 1];
+});
+
+AST_Toplevel.DEFMETHOD("compute_char_frequency", function(options) {
+    options = this._default_mangler_options(options);
+    var nth_identifier = options.nth_identifier;
+    if (!nth_identifier.reset || !nth_identifier.consider || !nth_identifier.sort) {
+        // If the identifier mangler is invariant, skip computing character frequency.
+        return;
+    }
+    nth_identifier.reset();
+
+    try {
+        AST_Node.prototype.print = function(stream, force_parens) {
+            this._print(stream, force_parens);
+            if (this instanceof AST_Symbol && !this.unmangleable(options)) {
+                nth_identifier.consider(this.name, -1);
+            } else if (options.properties) {
+                if (this instanceof AST_DotHash) {
+                    nth_identifier.consider("#" + this.property, -1);
+                } else if (this instanceof AST_Dot) {
+                    nth_identifier.consider(this.property, -1);
+                } else if (this instanceof AST_Sub) {
+                    skip_string(this.property);
+                }
+            }
+        };
+        nth_identifier.consider(this.print_to_string(), 1);
+    } finally {
+        AST_Node.prototype.print = AST_Node.prototype._print;
+    }
+    nth_identifier.sort();
+
+    function skip_string(node) {
+        if (node instanceof AST_String) {
+            nth_identifier.consider(node.value, -1);
+        } else if (node instanceof AST_Conditional) {
+            skip_string(node.consequent);
+            skip_string(node.alternative);
+        } else if (node instanceof AST_Sequence) {
+            skip_string(node.tail_node());
+        }
+    }
+});
+
+const base54 = (() => {
+    const leading = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_".split("");
+    const digits = "0123456789".split("");
+    let chars;
+    let frequency;
+    function reset() {
+        frequency = new Map();
+        leading.forEach(function(ch) {
+            frequency.set(ch, 0);
+        });
+        digits.forEach(function(ch) {
+            frequency.set(ch, 0);
+        });
+    }
+    function consider(str, delta) {
+        for (var i = str.length; --i >= 0;) {
+            frequency.set(str[i], frequency.get(str[i]) + delta);
+        }
+    }
+    function compare(a, b) {
+        return frequency.get(b) - frequency.get(a);
+    }
+    function sort() {
+        chars = mergeSort(leading, compare).concat(mergeSort(digits, compare));
+    }
+    // Ensure this is in a usable initial state.
+    reset();
+    sort();
+    function base54(num) {
+        var ret = "", base = 54;
+        num++;
+        do {
+            num--;
+            ret += chars[num % base];
+            num = Math.floor(num / base);
+            base = 64;
+        } while (num > 0);
+        return ret;
+    }
+
+    return {
+        get: base54,
+        consider,
+        reset,
+        sort
+    };
+})();
+
+let mangle_options = undefined;
+AST_Node.prototype.size = function (compressor, stack) {
+    mangle_options = compressor && compressor.mangle_options;
+
+    let size = 0;
+    walk_parent(this, (node, info) => {
+        size += node._size(info);
+
+        // Braceless arrow functions have fake "return" statements
+        if (node instanceof AST_Arrow && node.is_braceless()) {
+            size += node.body[0].value._size(info);
+            return true;
+        }
+    }, stack || (compressor && compressor.stack));
+
+    // just to save a bit of memory
+    mangle_options = undefined;
+
+    return size;
+};
+
+AST_Node.prototype._size = () => 0;
+
+AST_Debugger.prototype._size = () => 8;
+
+AST_Directive.prototype._size = function () {
+    // TODO string encoding stuff
+    return 2 + this.value.length;
+};
+
+const list_overhead = (array) => array.length && array.length - 1;
+
+AST_Block.prototype._size = function () {
+    return 2 + list_overhead(this.body);
+};
+
+AST_Toplevel.prototype._size = function() {
+    return list_overhead(this.body);
+};
+
+AST_EmptyStatement.prototype._size = () => 1;
+
+AST_LabeledStatement.prototype._size = () => 2;  // x:
+
+AST_Do.prototype._size = () => 9;
+
+AST_While.prototype._size = () => 7;
+
+AST_For.prototype._size = () => 8;
+
+AST_ForIn.prototype._size = () => 8;
+// AST_ForOf inherits ^
+
+AST_With.prototype._size = () => 6;
+
+AST_Expansion.prototype._size = () => 3;
+
+const lambda_modifiers = func =>
+    (func.is_generator ? 1 : 0) + (func.async ? 6 : 0);
+
+AST_Accessor.prototype._size = function () {
+    return lambda_modifiers(this) + 4 + list_overhead(this.argnames) + list_overhead(this.body);
+};
+
+AST_Function.prototype._size = function (info) {
+    const first = !!first_in_statement(info);
+    return (first * 2) + lambda_modifiers(this) + 12 + list_overhead(this.argnames) + list_overhead(this.body);
+};
+
+AST_Defun.prototype._size = function () {
+    return lambda_modifiers(this) + 13 + list_overhead(this.argnames) + list_overhead(this.body);
+};
+
+AST_Arrow.prototype._size = function () {
+    let args_and_arrow = 2 + list_overhead(this.argnames);
+
+    if (
+        !(
+            this.argnames.length === 1
+            && this.argnames[0] instanceof AST_Symbol
+        )
+    ) {
+        args_and_arrow += 2;
+    }
+
+    const body_overhead = this.is_braceless() ? 0 : list_overhead(this.body) + 2;
+
+    return lambda_modifiers(this) + args_and_arrow + body_overhead;
+};
+
+AST_Destructuring.prototype._size = () => 2;
+
+AST_TemplateString.prototype._size = function () {
+    return 2 + (Math.floor(this.segments.length / 2) * 3);  /* "${}" */
+};
+
+AST_TemplateSegment.prototype._size = function () {
+    return this.value.length;
+};
+
+AST_Return.prototype._size = function () {
+    return this.value ? 7 : 6;
+};
+
+AST_Throw.prototype._size = () => 6;
+
+AST_Break.prototype._size = function () {
+    return this.label ? 6 : 5;
+};
+
+AST_Continue.prototype._size = function () {
+    return this.label ? 9 : 8;
+};
+
+AST_If.prototype._size = () => 4;
+
+AST_Switch.prototype._size = function () {
+    return 8 + list_overhead(this.body);
+};
+
+AST_Case.prototype._size = function () {
+    return 5 + list_overhead(this.body);
+};
+
+AST_Default.prototype._size = function () {
+    return 8 + list_overhead(this.body);
+};
+
+AST_Try.prototype._size = function () {
+    return 3 + list_overhead(this.body);
+};
+
+AST_Catch.prototype._size = function () {
+    let size = 7 + list_overhead(this.body);
+    if (this.argname) {
+        size += 2;
+    }
+    return size;
+};
+
+AST_Finally.prototype._size = function () {
+    return 7 + list_overhead(this.body);
+};
+
+/*#__INLINE__*/
+const def_size = (size, def) => size + list_overhead(def.definitions);
+
+AST_Var.prototype._size = function () {
+    return def_size(4, this);
+};
+
+AST_Let.prototype._size = function () {
+    return def_size(4, this);
+};
+
+AST_Const.prototype._size = function () {
+    return def_size(6, this);
+};
+
+AST_VarDef.prototype._size = function () {
+    return this.value ? 1 : 0;
+};
+
+AST_NameMapping.prototype._size = function () {
+    // foreign name isn't mangled
+    return this.name ? 4 : 0;
+};
+
+AST_Import.prototype._size = function () {
+    // import
+    let size = 6;
+
+    if (this.imported_name) size += 1;
+
+    // from
+    if (this.imported_name || this.imported_names) size += 5;
+
+    // braces, and the commas
+    if (this.imported_names) {
+        size += 2 + list_overhead(this.imported_names);
+    }
+
+    return size;
+};
+
+AST_ImportMeta.prototype._size = () => 11;
+
+AST_Export.prototype._size = function () {
+    let size = 7 + (this.is_default ? 8 : 0);
+
+    if (this.exported_value) {
+        size += this.exported_value._size();
+    }
+
+    if (this.exported_names) {
+        // Braces and commas
+        size += 2 + list_overhead(this.exported_names);
+    }
+
+    if (this.module_name) {
+        // "from "
+        size += 5;
+    }
+
+    return size;
+};
+
+AST_Call.prototype._size = function () {
+    if (this.optional) {
+        return 4 + list_overhead(this.args);
+    }
+    return 2 + list_overhead(this.args);
+};
+
+AST_New.prototype._size = function () {
+    return 6 + list_overhead(this.args);
+};
+
+AST_Sequence.prototype._size = function () {
+    return list_overhead(this.expressions);
+};
+
+AST_Dot.prototype._size = function () {
+    if (this.optional) {
+        return this.property.length + 2;
+    }
+    return this.property.length + 1;
+};
+
+AST_DotHash.prototype._size = function () {
+    if (this.optional) {
+        return this.property.length + 3;
+    }
+    return this.property.length + 2;
+};
+
+AST_Sub.prototype._size = function () {
+    return this.optional ? 4 : 2;
+};
+
+AST_Unary.prototype._size = function () {
+    if (this.operator === "typeof") return 7;
+    if (this.operator === "void") return 5;
+    return this.operator.length;
+};
+
+AST_Binary.prototype._size = function (info) {
+    if (this.operator === "in") return 4;
+
+    let size = this.operator.length;
+
+    if (
+        (this.operator === "+" || this.operator === "-")
+        && this.right instanceof AST_Unary && this.right.operator === this.operator
+    ) {
+        // 1+ +a > needs space between the +
+        size += 1;
+    }
+
+    if (this.needs_parens(info)) {
+        size += 2;
+    }
+
+    return size;
+};
+
+AST_Conditional.prototype._size = () => 3;
+
+AST_Array.prototype._size = function () {
+    return 2 + list_overhead(this.elements);
+};
+
+AST_Object.prototype._size = function (info) {
+    let base = 2;
+    if (first_in_statement(info)) {
+        base += 2; // parens
+    }
+    return base + list_overhead(this.properties);
+};
+
+/*#__INLINE__*/
+const key_size = key =>
+    typeof key === "string" ? key.length : 0;
+
+AST_ObjectKeyVal.prototype._size = function () {
+    return key_size(this.key) + 1;
+};
+
+/*#__INLINE__*/
+const static_size = is_static => is_static ? 7 : 0;
+
+AST_ObjectGetter.prototype._size = function () {
+    return 5 + static_size(this.static) + key_size(this.key);
+};
+
+AST_ObjectSetter.prototype._size = function () {
+    return 5 + static_size(this.static) + key_size(this.key);
+};
+
+AST_ConciseMethod.prototype._size = function () {
+    return static_size(this.static) + key_size(this.key) + lambda_modifiers(this);
+};
+
+AST_PrivateMethod.prototype._size = function () {
+    return AST_ConciseMethod.prototype._size.call(this) + 1;
+};
+
+AST_PrivateGetter.prototype._size = AST_PrivateSetter.prototype._size = function () {
+    return AST_ConciseMethod.prototype._size.call(this) + 4;
+};
+
+AST_Class.prototype._size = function () {
+    return (
+        (this.name ? 8 : 7)
+        + (this.extends ? 8 : 0)
+    );
+};
+
+AST_ClassProperty.prototype._size = function () {
+    return (
+        static_size(this.static)
+        + (typeof this.key === "string" ? this.key.length + 2 : 0)
+        + (this.value ? 1 : 0)
+    );
+};
+
+AST_ClassPrivateProperty.prototype._size = function () {
+    return AST_ClassProperty.prototype._size.call(this) + 1;
+};
+
+AST_Symbol.prototype._size = function () {
+    return !mangle_options || this.definition().unmangleable(mangle_options)
+        ? this.name.length
+        : 1;
+};
+
+// TODO take propmangle into account
+AST_SymbolClassProperty.prototype._size = function () {
+    return this.name.length;
+};
+
+AST_SymbolRef.prototype._size = AST_SymbolDeclaration.prototype._size = function () {
+    const { name, thedef } = this;
+
+    if (thedef && thedef.global) return name.length;
+
+    if (name === "arguments") return 9;
+
+    return AST_Symbol.prototype._size.call(this);
+};
+
+AST_NewTarget.prototype._size = () => 10;
+
+AST_SymbolImportForeign.prototype._size = function () {
+    return this.name.length;
+};
+
+AST_SymbolExportForeign.prototype._size = function () {
+    return this.name.length;
+};
+
+AST_This.prototype._size = () => 4;
+
+AST_Super.prototype._size = () => 5;
+
+AST_String.prototype._size = function () {
+    return this.value.length + 2;
+};
+
+AST_Number.prototype._size = function () {
+    const { value } = this;
+    if (value === 0) return 1;
+    if (value > 0 && Math.floor(value) === value) {
+        return Math.floor(Math.log10(value) + 1);
+    }
+    return value.toString().length;
+};
+
+AST_BigInt.prototype._size = function () {
+    return this.value.length;
+};
+
+AST_RegExp.prototype._size = function () {
+    return this.value.toString().length;
+};
+
+AST_Null.prototype._size = () => 4;
+
+AST_NaN.prototype._size = () => 3;
+
+AST_Undefined.prototype._size = () => 6; // "void 0"
+
+AST_Hole.prototype._size = () => 0;  // comma is taken into account
+
+AST_Infinity.prototype._size = () => 8;
+
+AST_True.prototype._size = () => 4;
+
+AST_False.prototype._size = () => 5;
+
+AST_Await.prototype._size = () => 6;
+
+AST_Yield.prototype._size = () => 6;
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+function merge_sequence(array, node) {
+    if (node instanceof AST_Sequence) {
+        array.push(...node.expressions);
+    } else {
+        array.push(node);
+    }
+    return array;
+}
+
+function make_sequence(orig, expressions) {
+    if (expressions.length == 1) return expressions[0];
+    if (expressions.length == 0) throw new Error("trying to create a sequence with length zero!");
+    return make_node(AST_Sequence, orig, {
+        expressions: expressions.reduce(merge_sequence, [])
+    });
+}
+
+function make_node_from_constant(val, orig) {
+    switch (typeof val) {
+      case "string":
+        return make_node(AST_String, orig, {
+            value: val
+        });
+      case "number":
+        if (isNaN(val)) return make_node(AST_NaN, orig);
+        if (isFinite(val)) {
+            return 1 / val < 0 ? make_node(AST_UnaryPrefix, orig, {
+                operator: "-",
+                expression: make_node(AST_Number, orig, { value: -val })
+            }) : make_node(AST_Number, orig, { value: val });
+        }
+        return val < 0 ? make_node(AST_UnaryPrefix, orig, {
+            operator: "-",
+            expression: make_node(AST_Infinity, orig)
+        }) : make_node(AST_Infinity, orig);
+      case "boolean":
+        return make_node(val ? AST_True : AST_False, orig);
+      case "undefined":
+        return make_node(AST_Undefined, orig);
+      default:
+        if (val === null) {
+            return make_node(AST_Null, orig, { value: null });
+        }
+        if (val instanceof RegExp) {
+            return make_node(AST_RegExp, orig, {
+                value: {
+                    source: regexp_source_fix(val.source),
+                    flags: val.flags
+                }
+            });
+        }
+        throw new Error(string_template("Can't handle constant of type: {type}", {
+            type: typeof val
+        }));
+    }
+}
+
+function best_of_expression(ast1, ast2) {
+    return ast1.size() > ast2.size() ? ast2 : ast1;
+}
+
+function best_of_statement(ast1, ast2) {
+    return best_of_expression(
+        make_node(AST_SimpleStatement, ast1, {
+            body: ast1
+        }),
+        make_node(AST_SimpleStatement, ast2, {
+            body: ast2
+        })
+    ).body;
+}
+
+/** Find which node is smaller, and return that */
+function best_of(compressor, ast1, ast2) {
+    if (first_in_statement(compressor)) {
+        return best_of_statement(ast1, ast2);
+    } else {
+        return best_of_expression(ast1, ast2);
+    }
+}
+
+/** Simplify an object property's key, if possible */
+function get_simple_key(key) {
+    if (key instanceof AST_Constant) {
+        return key.getValue();
+    }
+    if (key instanceof AST_UnaryPrefix
+        && key.operator == "void"
+        && key.expression instanceof AST_Constant) {
+        return;
+    }
+    return key;
+}
+
+function read_property(obj, key) {
+    key = get_simple_key(key);
+    if (key instanceof AST_Node) return;
+
+    var value;
+    if (obj instanceof AST_Array) {
+        var elements = obj.elements;
+        if (key == "length") return make_node_from_constant(elements.length, obj);
+        if (typeof key == "number" && key in elements) value = elements[key];
+    } else if (obj instanceof AST_Object) {
+        key = "" + key;
+        var props = obj.properties;
+        for (var i = props.length; --i >= 0;) {
+            var prop = props[i];
+            if (!(prop instanceof AST_ObjectKeyVal)) return;
+            if (!value && props[i].key === key) value = props[i].value;
+        }
+    }
+
+    return value instanceof AST_SymbolRef && value.fixed_value() || value;
+}
+
+function has_break_or_continue(loop, parent) {
+    var found = false;
+    var tw = new TreeWalker(function(node) {
+        if (found || node instanceof AST_Scope) return true;
+        if (node instanceof AST_LoopControl && tw.loopcontrol_target(node) === loop) {
+            return found = true;
+        }
+    });
+    if (parent instanceof AST_LabeledStatement) tw.push(parent);
+    tw.push(loop);
+    loop.body.walk(tw);
+    return found;
+}
+
+// we shouldn't compress (1,func)(something) to
+// func(something) because that changes the meaning of
+// the func (becomes lexical instead of global).
+function maintain_this_binding(parent, orig, val) {
+    if (
+        parent instanceof AST_UnaryPrefix && parent.operator == "delete"
+        || parent instanceof AST_Call && parent.expression === orig
+            && (
+                val instanceof AST_PropAccess
+                || val instanceof AST_SymbolRef && val.name == "eval"
+            )
+    ) {
+        const zero = make_node(AST_Number, orig, { value: 0 });
+        return make_sequence(orig, [ zero, val ]);
+    } else {
+        return val;
+    }
+}
+
+function is_func_expr(node) {
+    return node instanceof AST_Arrow || node instanceof AST_Function;
+}
+
+function is_iife_call(node) {
+    // Used to determine whether the node can benefit from negation.
+    // Not the case with arrow functions (you need an extra set of parens).
+    if (node.TYPE != "Call") return false;
+    return node.expression instanceof AST_Function || is_iife_call(node.expression);
+}
+
+const identifier_atom = makePredicate("Infinity NaN undefined");
+function is_identifier_atom(node) {
+    return node instanceof AST_Infinity
+        || node instanceof AST_NaN
+        || node instanceof AST_Undefined;
+}
+
+/** Check if this is a SymbolRef node which has one def of a certain AST type */
+function is_ref_of(ref, type) {
+    if (!(ref instanceof AST_SymbolRef)) return false;
+    var orig = ref.definition().orig;
+    for (var i = orig.length; --i >= 0;) {
+        if (orig[i] instanceof type) return true;
+    }
+}
+
+// Can we turn { block contents... } into just the block contents ?
+// Not if one of these is inside.
+function can_be_evicted_from_block(node) {
+    return !(
+        node instanceof AST_DefClass ||
+        node instanceof AST_Defun ||
+        node instanceof AST_Let ||
+        node instanceof AST_Const ||
+        node instanceof AST_Export ||
+        node instanceof AST_Import
+    );
+}
+
+function as_statement_array(thing) {
+    if (thing === null) return [];
+    if (thing instanceof AST_BlockStatement) return thing.body;
+    if (thing instanceof AST_EmptyStatement) return [];
+    if (thing instanceof AST_Statement) return [ thing ];
+    throw new Error("Can't convert thing to statement array");
+}
+
+/** Check if a ref refers to the name of a function/class it's defined within */
+function is_recursive_ref(compressor, def) {
+    var node;
+    for (var i = 0; node = compressor.parent(i); i++) {
+        if (node instanceof AST_Lambda || node instanceof AST_Class) {
+            var name = node.name;
+            if (name && name.definition() === def) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// bitfield flags to be stored in node.flags.
+// These are set and unset during compression, and store information in the node without requiring multiple fields.
+const UNUSED = 0b00000001;
+const TRUTHY = 0b00000010;
+const FALSY = 0b00000100;
+const UNDEFINED = 0b00001000;
+const INLINED = 0b00010000;
+
+// Nodes to which values are ever written. Used when keep_assign is part of the unused option string.
+const WRITE_ONLY = 0b00100000;
+
+// information specific to a single compression pass
+const SQUEEZED = 0b0000000100000000;
+const OPTIMIZED = 0b0000001000000000;
+const TOP = 0b0000010000000000;
+const CLEAR_BETWEEN_PASSES = SQUEEZED | OPTIMIZED | TOP;
+
+const has_flag = (node, flag) => node.flags & flag;
+const set_flag = (node, flag) => { node.flags |= flag; };
+const clear_flag = (node, flag) => { node.flags &= ~flag; };
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// Lists of native methods, useful for `unsafe` option which assumes they exist.
+// Note: Lots of methods and functions are missing here, in case they aren't pure
+// or not available in all JS environments.
+
+function make_nested_lookup(obj) {
+    const out = new Map();
+    for (var key of Object.keys(obj)) {
+        out.set(key, makePredicate(obj[key]));
+    }
+
+    const does_have = (global_name, fname) => {
+        const inner_map = out.get(global_name);
+        return inner_map != null && inner_map.has(fname);
+    };
+    return does_have;
+}
+
+// Objects which are safe to access without throwing or causing a side effect.
+// Usually we'd check the `unsafe` option first but these are way too common for that
+const pure_prop_access_globals = new Set([
+    "Number",
+    "String",
+    "Array",
+    "Object",
+    "Function",
+    "Promise",
+]);
+
+const object_methods = [
+    "constructor",
+    "toString",
+    "valueOf",
+];
+
+const is_pure_native_method = make_nested_lookup({
+    Array: [
+        "indexOf",
+        "join",
+        "lastIndexOf",
+        "slice",
+        ...object_methods,
+    ],
+    Boolean: object_methods,
+    Function: object_methods,
+    Number: [
+        "toExponential",
+        "toFixed",
+        "toPrecision",
+        ...object_methods,
+    ],
+    Object: object_methods,
+    RegExp: [
+        "test",
+        ...object_methods,
+    ],
+    String: [
+        "charAt",
+        "charCodeAt",
+        "concat",
+        "indexOf",
+        "italics",
+        "lastIndexOf",
+        "match",
+        "replace",
+        "search",
+        "slice",
+        "split",
+        "substr",
+        "substring",
+        "toLowerCase",
+        "toUpperCase",
+        "trim",
+        ...object_methods,
+    ],
+});
+
+const is_pure_native_fn = make_nested_lookup({
+    Array: [
+        "isArray",
+    ],
+    Math: [
+        "abs",
+        "acos",
+        "asin",
+        "atan",
+        "ceil",
+        "cos",
+        "exp",
+        "floor",
+        "log",
+        "round",
+        "sin",
+        "sqrt",
+        "tan",
+        "atan2",
+        "pow",
+        "max",
+        "min",
+    ],
+    Number: [
+        "isFinite",
+        "isNaN",
+    ],
+    Object: [
+        "create",
+        "getOwnPropertyDescriptor",
+        "getOwnPropertyNames",
+        "getPrototypeOf",
+        "isExtensible",
+        "isFrozen",
+        "isSealed",
+        "hasOwn",
+        "keys",
+    ],
+    String: [
+        "fromCharCode",
+    ],
+});
+
+// Known numeric values which come with JS environments
+const is_pure_native_value = make_nested_lookup({
+    Math: [
+        "E",
+        "LN10",
+        "LN2",
+        "LOG2E",
+        "LOG10E",
+        "PI",
+        "SQRT1_2",
+        "SQRT2",
+    ],
+    Number: [
+        "MAX_VALUE",
+        "MIN_VALUE",
+        "NaN",
+        "NEGATIVE_INFINITY",
+        "POSITIVE_INFINITY",
+    ],
+});
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// Functions and methods to infer certain facts about expressions
+// It's not always possible to be 100% sure about something just by static analysis,
+// so `true` means yes, and `false` means maybe
+
+const is_undeclared_ref = (node) =>
+    node instanceof AST_SymbolRef && node.definition().undeclared;
+
+const lazy_op = makePredicate("&& || ??");
+const unary_side_effects = makePredicate("delete ++ --");
+
+// methods to determine whether an expression has a boolean result type
+(function(def_is_boolean) {
+    const unary_bool = makePredicate("! delete");
+    const binary_bool = makePredicate("in instanceof == != === !== < <= >= >");
+    def_is_boolean(AST_Node, return_false);
+    def_is_boolean(AST_UnaryPrefix, function() {
+        return unary_bool.has(this.operator);
+    });
+    def_is_boolean(AST_Binary, function() {
+        return binary_bool.has(this.operator)
+            || lazy_op.has(this.operator)
+                && this.left.is_boolean()
+                && this.right.is_boolean();
+    });
+    def_is_boolean(AST_Conditional, function() {
+        return this.consequent.is_boolean() && this.alternative.is_boolean();
+    });
+    def_is_boolean(AST_Assign, function() {
+        return this.operator == "=" && this.right.is_boolean();
+    });
+    def_is_boolean(AST_Sequence, function() {
+        return this.tail_node().is_boolean();
+    });
+    def_is_boolean(AST_True, return_true);
+    def_is_boolean(AST_False, return_true);
+})(function(node, func) {
+    node.DEFMETHOD("is_boolean", func);
+});
+
+// methods to determine if an expression has a numeric result type
+(function(def_is_number) {
+    def_is_number(AST_Node, return_false);
+    def_is_number(AST_Number, return_true);
+    const unary = makePredicate("+ - ~ ++ --");
+    def_is_number(AST_Unary, function() {
+        return unary.has(this.operator);
+    });
+    const numeric_ops = makePredicate("- * / % & | ^ << >> >>>");
+    def_is_number(AST_Binary, function(compressor) {
+        return numeric_ops.has(this.operator) || this.operator == "+"
+            && this.left.is_number(compressor)
+            && this.right.is_number(compressor);
+    });
+    def_is_number(AST_Assign, function(compressor) {
+        return numeric_ops.has(this.operator.slice(0, -1))
+            || this.operator == "=" && this.right.is_number(compressor);
+    });
+    def_is_number(AST_Sequence, function(compressor) {
+        return this.tail_node().is_number(compressor);
+    });
+    def_is_number(AST_Conditional, function(compressor) {
+        return this.consequent.is_number(compressor) && this.alternative.is_number(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("is_number", func);
+});
+
+// methods to determine if an expression has a string result type
+(function(def_is_string) {
+    def_is_string(AST_Node, return_false);
+    def_is_string(AST_String, return_true);
+    def_is_string(AST_TemplateString, return_true);
+    def_is_string(AST_UnaryPrefix, function() {
+        return this.operator == "typeof";
+    });
+    def_is_string(AST_Binary, function(compressor) {
+        return this.operator == "+" &&
+            (this.left.is_string(compressor) || this.right.is_string(compressor));
+    });
+    def_is_string(AST_Assign, function(compressor) {
+        return (this.operator == "=" || this.operator == "+=") && this.right.is_string(compressor);
+    });
+    def_is_string(AST_Sequence, function(compressor) {
+        return this.tail_node().is_string(compressor);
+    });
+    def_is_string(AST_Conditional, function(compressor) {
+        return this.consequent.is_string(compressor) && this.alternative.is_string(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("is_string", func);
+});
+
+function is_undefined(node, compressor) {
+    return (
+        has_flag(node, UNDEFINED)
+        || node instanceof AST_Undefined
+        || node instanceof AST_UnaryPrefix
+            && node.operator == "void"
+            && !node.expression.has_side_effects(compressor)
+    );
+}
+
+// Is the node explicitly null or undefined.
+function is_null_or_undefined(node, compressor) {
+    let fixed;
+    return (
+        node instanceof AST_Null
+        || is_undefined(node, compressor)
+        || (
+            node instanceof AST_SymbolRef
+            && (fixed = node.definition().fixed) instanceof AST_Node
+            && is_nullish(fixed, compressor)
+        )
+    );
+}
+
+// Find out if this expression is optionally chained from a base-point that we
+// can statically analyze as null or undefined.
+function is_nullish_shortcircuited(node, compressor) {
+    if (node instanceof AST_PropAccess || node instanceof AST_Call) {
+        return (
+            (node.optional && is_null_or_undefined(node.expression, compressor))
+            || is_nullish_shortcircuited(node.expression, compressor)
+        );
+    }
+    if (node instanceof AST_Chain) return is_nullish_shortcircuited(node.expression, compressor);
+    return false;
+}
+
+// Find out if something is == null, or can short circuit into nullish.
+// Used to optimize ?. and ??
+function is_nullish(node, compressor) {
+    if (is_null_or_undefined(node, compressor)) return true;
+    return is_nullish_shortcircuited(node, compressor);
+}
+
+// Determine if expression might cause side effects
+// If there's a possibility that a node may change something when it's executed, this returns true
+(function(def_has_side_effects) {
+    def_has_side_effects(AST_Node, return_true);
+
+    def_has_side_effects(AST_EmptyStatement, return_false);
+    def_has_side_effects(AST_Constant, return_false);
+    def_has_side_effects(AST_This, return_false);
+
+    function any(list, compressor) {
+        for (var i = list.length; --i >= 0;)
+            if (list[i].has_side_effects(compressor))
+                return true;
+        return false;
+    }
+
+    def_has_side_effects(AST_Block, function(compressor) {
+        return any(this.body, compressor);
+    });
+    def_has_side_effects(AST_Call, function(compressor) {
+        if (
+            !this.is_callee_pure(compressor)
+            && (!this.expression.is_call_pure(compressor)
+                || this.expression.has_side_effects(compressor))
+        ) {
+            return true;
+        }
+        return any(this.args, compressor);
+    });
+    def_has_side_effects(AST_Switch, function(compressor) {
+        return this.expression.has_side_effects(compressor)
+            || any(this.body, compressor);
+    });
+    def_has_side_effects(AST_Case, function(compressor) {
+        return this.expression.has_side_effects(compressor)
+            || any(this.body, compressor);
+    });
+    def_has_side_effects(AST_Try, function(compressor) {
+        return any(this.body, compressor)
+            || this.bcatch && this.bcatch.has_side_effects(compressor)
+            || this.bfinally && this.bfinally.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_If, function(compressor) {
+        return this.condition.has_side_effects(compressor)
+            || this.body && this.body.has_side_effects(compressor)
+            || this.alternative && this.alternative.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_LabeledStatement, function(compressor) {
+        return this.body.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_SimpleStatement, function(compressor) {
+        return this.body.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Lambda, return_false);
+    def_has_side_effects(AST_Class, function (compressor) {
+        if (this.extends && this.extends.has_side_effects(compressor)) {
+            return true;
+        }
+        return any(this.properties, compressor);
+    });
+    def_has_side_effects(AST_Binary, function(compressor) {
+        return this.left.has_side_effects(compressor)
+            || this.right.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Assign, return_true);
+    def_has_side_effects(AST_Conditional, function(compressor) {
+        return this.condition.has_side_effects(compressor)
+            || this.consequent.has_side_effects(compressor)
+            || this.alternative.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Unary, function(compressor) {
+        return unary_side_effects.has(this.operator)
+            || this.expression.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_SymbolRef, function(compressor) {
+        return !this.is_declared(compressor) && !pure_prop_access_globals.has(this.name);
+    });
+    def_has_side_effects(AST_SymbolClassProperty, return_false);
+    def_has_side_effects(AST_SymbolDeclaration, return_false);
+    def_has_side_effects(AST_Object, function(compressor) {
+        return any(this.properties, compressor);
+    });
+    def_has_side_effects(AST_ObjectProperty, function(compressor) {
+        return (
+            this.computed_key() && this.key.has_side_effects(compressor)
+            || this.value && this.value.has_side_effects(compressor)
+        );
+    });
+    def_has_side_effects(AST_ClassProperty, function(compressor) {
+        return (
+            this.computed_key() && this.key.has_side_effects(compressor)
+            || this.static && this.value && this.value.has_side_effects(compressor)
+        );
+    });
+    def_has_side_effects(AST_ConciseMethod, function(compressor) {
+        return this.computed_key() && this.key.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_ObjectGetter, function(compressor) {
+        return this.computed_key() && this.key.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_ObjectSetter, function(compressor) {
+        return this.computed_key() && this.key.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Array, function(compressor) {
+        return any(this.elements, compressor);
+    });
+    def_has_side_effects(AST_Dot, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Sub, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.has_side_effects(compressor)
+            || this.property.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Chain, function (compressor) {
+        return this.expression.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Sequence, function(compressor) {
+        return any(this.expressions, compressor);
+    });
+    def_has_side_effects(AST_Definitions, function(compressor) {
+        return any(this.definitions, compressor);
+    });
+    def_has_side_effects(AST_VarDef, function() {
+        return this.value;
+    });
+    def_has_side_effects(AST_TemplateSegment, return_false);
+    def_has_side_effects(AST_TemplateString, function(compressor) {
+        return any(this.segments, compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("has_side_effects", func);
+});
+
+// determine if expression may throw
+(function(def_may_throw) {
+    def_may_throw(AST_Node, return_true);
+
+    def_may_throw(AST_Constant, return_false);
+    def_may_throw(AST_EmptyStatement, return_false);
+    def_may_throw(AST_Lambda, return_false);
+    def_may_throw(AST_SymbolDeclaration, return_false);
+    def_may_throw(AST_This, return_false);
+
+    function any(list, compressor) {
+        for (var i = list.length; --i >= 0;)
+            if (list[i].may_throw(compressor))
+                return true;
+        return false;
+    }
+
+    def_may_throw(AST_Class, function(compressor) {
+        if (this.extends && this.extends.may_throw(compressor)) return true;
+        return any(this.properties, compressor);
+    });
+
+    def_may_throw(AST_Array, function(compressor) {
+        return any(this.elements, compressor);
+    });
+    def_may_throw(AST_Assign, function(compressor) {
+        if (this.right.may_throw(compressor)) return true;
+        if (!compressor.has_directive("use strict")
+            && this.operator == "="
+            && this.left instanceof AST_SymbolRef) {
+            return false;
+        }
+        return this.left.may_throw(compressor);
+    });
+    def_may_throw(AST_Binary, function(compressor) {
+        return this.left.may_throw(compressor)
+            || this.right.may_throw(compressor);
+    });
+    def_may_throw(AST_Block, function(compressor) {
+        return any(this.body, compressor);
+    });
+    def_may_throw(AST_Call, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        if (any(this.args, compressor)) return true;
+        if (this.is_callee_pure(compressor)) return false;
+        if (this.expression.may_throw(compressor)) return true;
+        return !(this.expression instanceof AST_Lambda)
+            || any(this.expression.body, compressor);
+    });
+    def_may_throw(AST_Case, function(compressor) {
+        return this.expression.may_throw(compressor)
+            || any(this.body, compressor);
+    });
+    def_may_throw(AST_Conditional, function(compressor) {
+        return this.condition.may_throw(compressor)
+            || this.consequent.may_throw(compressor)
+            || this.alternative.may_throw(compressor);
+    });
+    def_may_throw(AST_Definitions, function(compressor) {
+        return any(this.definitions, compressor);
+    });
+    def_may_throw(AST_If, function(compressor) {
+        return this.condition.may_throw(compressor)
+            || this.body && this.body.may_throw(compressor)
+            || this.alternative && this.alternative.may_throw(compressor);
+    });
+    def_may_throw(AST_LabeledStatement, function(compressor) {
+        return this.body.may_throw(compressor);
+    });
+    def_may_throw(AST_Object, function(compressor) {
+        return any(this.properties, compressor);
+    });
+    def_may_throw(AST_ObjectProperty, function(compressor) {
+        // TODO key may throw too
+        return this.value ? this.value.may_throw(compressor) : false;
+    });
+    def_may_throw(AST_ClassProperty, function(compressor) {
+        return (
+            this.computed_key() && this.key.may_throw(compressor)
+            || this.static && this.value && this.value.may_throw(compressor)
+        );
+    });
+    def_may_throw(AST_ConciseMethod, function(compressor) {
+        return this.computed_key() && this.key.may_throw(compressor);
+    });
+    def_may_throw(AST_ObjectGetter, function(compressor) {
+        return this.computed_key() && this.key.may_throw(compressor);
+    });
+    def_may_throw(AST_ObjectSetter, function(compressor) {
+        return this.computed_key() && this.key.may_throw(compressor);
+    });
+    def_may_throw(AST_Return, function(compressor) {
+        return this.value && this.value.may_throw(compressor);
+    });
+    def_may_throw(AST_Sequence, function(compressor) {
+        return any(this.expressions, compressor);
+    });
+    def_may_throw(AST_SimpleStatement, function(compressor) {
+        return this.body.may_throw(compressor);
+    });
+    def_may_throw(AST_Dot, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.may_throw(compressor);
+    });
+    def_may_throw(AST_Sub, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.may_throw(compressor)
+            || this.property.may_throw(compressor);
+    });
+    def_may_throw(AST_Chain, function(compressor) {
+        return this.expression.may_throw(compressor);
+    });
+    def_may_throw(AST_Switch, function(compressor) {
+        return this.expression.may_throw(compressor)
+            || any(this.body, compressor);
+    });
+    def_may_throw(AST_SymbolRef, function(compressor) {
+        return !this.is_declared(compressor) && !pure_prop_access_globals.has(this.name);
+    });
+    def_may_throw(AST_SymbolClassProperty, return_false);
+    def_may_throw(AST_Try, function(compressor) {
+        return this.bcatch ? this.bcatch.may_throw(compressor) : any(this.body, compressor)
+            || this.bfinally && this.bfinally.may_throw(compressor);
+    });
+    def_may_throw(AST_Unary, function(compressor) {
+        if (this.operator == "typeof" && this.expression instanceof AST_SymbolRef)
+            return false;
+        return this.expression.may_throw(compressor);
+    });
+    def_may_throw(AST_VarDef, function(compressor) {
+        if (!this.value) return false;
+        return this.value.may_throw(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("may_throw", func);
+});
+
+// determine if expression is constant
+(function(def_is_constant_expression) {
+    function all_refs_local(scope) {
+        let result = true;
+        walk(this, node => {
+            if (node instanceof AST_SymbolRef) {
+                if (has_flag(this, INLINED)) {
+                    result = false;
+                    return walk_abort;
+                }
+                var def = node.definition();
+                if (
+                    member(def, this.enclosed)
+                    && !this.variables.has(def.name)
+                ) {
+                    if (scope) {
+                        var scope_def = scope.find_variable(node);
+                        if (def.undeclared ? !scope_def : scope_def === def) {
+                            result = "f";
+                            return true;
+                        }
+                    }
+                    result = false;
+                    return walk_abort;
+                }
+                return true;
+            }
+            if (node instanceof AST_This && this instanceof AST_Arrow) {
+                // TODO check arguments too!
+                result = false;
+                return walk_abort;
+            }
+        });
+        return result;
+    }
+
+    def_is_constant_expression(AST_Node, return_false);
+    def_is_constant_expression(AST_Constant, return_true);
+    def_is_constant_expression(AST_Class, function(scope) {
+        if (this.extends && !this.extends.is_constant_expression(scope)) {
+            return false;
+        }
+
+        for (const prop of this.properties) {
+            if (prop.computed_key() && !prop.key.is_constant_expression(scope)) {
+                return false;
+            }
+            if (prop.static && prop.value && !prop.value.is_constant_expression(scope)) {
+                return false;
+            }
+        }
+
+        return all_refs_local.call(this, scope);
+    });
+    def_is_constant_expression(AST_Lambda, all_refs_local);
+    def_is_constant_expression(AST_Unary, function() {
+        return this.expression.is_constant_expression();
+    });
+    def_is_constant_expression(AST_Binary, function() {
+        return this.left.is_constant_expression()
+            && this.right.is_constant_expression();
+    });
+    def_is_constant_expression(AST_Array, function() {
+        return this.elements.every((l) => l.is_constant_expression());
+    });
+    def_is_constant_expression(AST_Object, function() {
+        return this.properties.every((l) => l.is_constant_expression());
+    });
+    def_is_constant_expression(AST_ObjectProperty, function() {
+        return !!(!(this.key instanceof AST_Node) && this.value && this.value.is_constant_expression());
+    });
+})(function(node, func) {
+    node.DEFMETHOD("is_constant_expression", func);
+});
+
+
+// may_throw_on_access()
+// returns true if this node may be null, undefined or contain `AST_Accessor`
+(function(def_may_throw_on_access) {
+    AST_Node.DEFMETHOD("may_throw_on_access", function(compressor) {
+        return !compressor.option("pure_getters")
+            || this._dot_throw(compressor);
+    });
+
+    function is_strict(compressor) {
+        return /strict/.test(compressor.option("pure_getters"));
+    }
+
+    def_may_throw_on_access(AST_Node, is_strict);
+    def_may_throw_on_access(AST_Null, return_true);
+    def_may_throw_on_access(AST_Undefined, return_true);
+    def_may_throw_on_access(AST_Constant, return_false);
+    def_may_throw_on_access(AST_Array, return_false);
+    def_may_throw_on_access(AST_Object, function(compressor) {
+        if (!is_strict(compressor)) return false;
+        for (var i = this.properties.length; --i >=0;)
+            if (this.properties[i]._dot_throw(compressor)) return true;
+        return false;
+    });
+    // Do not be as strict with classes as we are with objects.
+    // Hopefully the community is not going to abuse static getters and setters.
+    // https://github.com/terser/terser/issues/724#issuecomment-643655656
+    def_may_throw_on_access(AST_Class, return_false);
+    def_may_throw_on_access(AST_ObjectProperty, return_false);
+    def_may_throw_on_access(AST_ObjectGetter, return_true);
+    def_may_throw_on_access(AST_Expansion, function(compressor) {
+        return this.expression._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Function, return_false);
+    def_may_throw_on_access(AST_Arrow, return_false);
+    def_may_throw_on_access(AST_UnaryPostfix, return_false);
+    def_may_throw_on_access(AST_UnaryPrefix, function() {
+        return this.operator == "void";
+    });
+    def_may_throw_on_access(AST_Binary, function(compressor) {
+        return (this.operator == "&&" || this.operator == "||" || this.operator == "??")
+            && (this.left._dot_throw(compressor) || this.right._dot_throw(compressor));
+    });
+    def_may_throw_on_access(AST_Assign, function(compressor) {
+        if (this.logical) return true;
+
+        return this.operator == "="
+            && this.right._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Conditional, function(compressor) {
+        return this.consequent._dot_throw(compressor)
+            || this.alternative._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Dot, function(compressor) {
+        if (!is_strict(compressor)) return false;
+
+        if (this.property == "prototype") {
+            return !(
+                this.expression instanceof AST_Function
+                || this.expression instanceof AST_Class
+            );
+        }
+        return true;
+    });
+    def_may_throw_on_access(AST_Chain, function(compressor) {
+        return this.expression._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Sequence, function(compressor) {
+        return this.tail_node()._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_SymbolRef, function(compressor) {
+        if (this.name === "arguments") return false;
+        if (has_flag(this, UNDEFINED)) return true;
+        if (!is_strict(compressor)) return false;
+        if (is_undeclared_ref(this) && this.is_declared(compressor)) return false;
+        if (this.is_immutable()) return false;
+        var fixed = this.fixed_value();
+        return !fixed || fixed._dot_throw(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("_dot_throw", func);
+});
+
+function is_lhs(node, parent) {
+    if (parent instanceof AST_Unary && unary_side_effects.has(parent.operator)) return parent.expression;
+    if (parent instanceof AST_Assign && parent.left === node) return node;
+}
+
+(function(def_find_defs) {
+    function to_node(value, orig) {
+        if (value instanceof AST_Node) {
+            if (!(value instanceof AST_Constant)) {
+                // Value may be a function, an array including functions and even a complex assign / block expression,
+                // so it should never be shared in different places.
+                // Otherwise wrong information may be used in the compression phase
+                value = value.clone(true);
+            }
+            return make_node(value.CTOR, orig, value);
+        }
+        if (Array.isArray(value)) return make_node(AST_Array, orig, {
+            elements: value.map(function(value) {
+                return to_node(value, orig);
+            })
+        });
+        if (value && typeof value == "object") {
+            var props = [];
+            for (var key in value) if (HOP(value, key)) {
+                props.push(make_node(AST_ObjectKeyVal, orig, {
+                    key: key,
+                    value: to_node(value[key], orig)
+                }));
+            }
+            return make_node(AST_Object, orig, {
+                properties: props
+            });
+        }
+        return make_node_from_constant(value, orig);
+    }
+
+    AST_Toplevel.DEFMETHOD("resolve_defines", function(compressor) {
+        if (!compressor.option("global_defs")) return this;
+        this.figure_out_scope({ ie8: compressor.option("ie8") });
+        return this.transform(new TreeTransformer(function(node) {
+            var def = node._find_defs(compressor, "");
+            if (!def) return;
+            var level = 0, child = node, parent;
+            while (parent = this.parent(level++)) {
+                if (!(parent instanceof AST_PropAccess)) break;
+                if (parent.expression !== child) break;
+                child = parent;
+            }
+            if (is_lhs(child, parent)) {
+                return;
+            }
+            return def;
+        }));
+    });
+    def_find_defs(AST_Node, noop);
+    def_find_defs(AST_Chain, function(compressor, suffix) {
+        return this.expression._find_defs(compressor, suffix);
+    });
+    def_find_defs(AST_Dot, function(compressor, suffix) {
+        return this.expression._find_defs(compressor, "." + this.property + suffix);
+    });
+    def_find_defs(AST_SymbolDeclaration, function() {
+        if (!this.global()) return;
+    });
+    def_find_defs(AST_SymbolRef, function(compressor, suffix) {
+        if (!this.global()) return;
+        var defines = compressor.option("global_defs");
+        var name = this.name + suffix;
+        if (HOP(defines, name)) return to_node(defines[name], this);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("_find_defs", func);
+});
+
+// method to negate an expression
+(function(def_negate) {
+    function basic_negation(exp) {
+        return make_node(AST_UnaryPrefix, exp, {
+            operator: "!",
+            expression: exp
+        });
+    }
+    function best(orig, alt, first_in_statement) {
+        var negated = basic_negation(orig);
+        if (first_in_statement) {
+            var stat = make_node(AST_SimpleStatement, alt, {
+                body: alt
+            });
+            return best_of_expression(negated, stat) === stat ? alt : negated;
+        }
+        return best_of_expression(negated, alt);
+    }
+    def_negate(AST_Node, function() {
+        return basic_negation(this);
+    });
+    def_negate(AST_Statement, function() {
+        throw new Error("Cannot negate a statement");
+    });
+    def_negate(AST_Function, function() {
+        return basic_negation(this);
+    });
+    def_negate(AST_Arrow, function() {
+        return basic_negation(this);
+    });
+    def_negate(AST_UnaryPrefix, function() {
+        if (this.operator == "!")
+            return this.expression;
+        return basic_negation(this);
+    });
+    def_negate(AST_Sequence, function(compressor) {
+        var expressions = this.expressions.slice();
+        expressions.push(expressions.pop().negate(compressor));
+        return make_sequence(this, expressions);
+    });
+    def_negate(AST_Conditional, function(compressor, first_in_statement) {
+        var self = this.clone();
+        self.consequent = self.consequent.negate(compressor);
+        self.alternative = self.alternative.negate(compressor);
+        return best(this, self, first_in_statement);
+    });
+    def_negate(AST_Binary, function(compressor, first_in_statement) {
+        var self = this.clone(), op = this.operator;
+        if (compressor.option("unsafe_comps")) {
+            switch (op) {
+              case "<=" : self.operator = ">"  ; return self;
+              case "<"  : self.operator = ">=" ; return self;
+              case ">=" : self.operator = "<"  ; return self;
+              case ">"  : self.operator = "<=" ; return self;
+            }
+        }
+        switch (op) {
+          case "==" : self.operator = "!="; return self;
+          case "!=" : self.operator = "=="; return self;
+          case "===": self.operator = "!=="; return self;
+          case "!==": self.operator = "==="; return self;
+          case "&&":
+            self.operator = "||";
+            self.left = self.left.negate(compressor, first_in_statement);
+            self.right = self.right.negate(compressor);
+            return best(this, self, first_in_statement);
+          case "||":
+            self.operator = "&&";
+            self.left = self.left.negate(compressor, first_in_statement);
+            self.right = self.right.negate(compressor);
+            return best(this, self, first_in_statement);
+        }
+        return basic_negation(this);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("negate", function(compressor, first_in_statement) {
+        return func.call(this, compressor, first_in_statement);
+    });
+});
+
+// Is the callee of this function pure?
+var global_pure_fns = makePredicate("Boolean decodeURI decodeURIComponent Date encodeURI encodeURIComponent Error escape EvalError isFinite isNaN Number Object parseFloat parseInt RangeError ReferenceError String SyntaxError TypeError unescape URIError");
+AST_Call.DEFMETHOD("is_callee_pure", function(compressor) {
+    if (compressor.option("unsafe")) {
+        var expr = this.expression;
+        var first_arg = (this.args && this.args[0] && this.args[0].evaluate(compressor));
+        if (
+            expr.expression && expr.expression.name === "hasOwnProperty" &&
+            (first_arg == null || first_arg.thedef && first_arg.thedef.undeclared)
+        ) {
+            return false;
+        }
+        if (is_undeclared_ref(expr) && global_pure_fns.has(expr.name)) return true;
+        if (
+            expr instanceof AST_Dot
+            && is_undeclared_ref(expr.expression)
+            && is_pure_native_fn(expr.expression.name, expr.property)
+        ) {
+            return true;
+        }
+    }
+    return !!has_annotation(this, _PURE) || !compressor.pure_funcs(this);
+});
+
+// If I call this, is it a pure function?
+AST_Node.DEFMETHOD("is_call_pure", return_false);
+AST_Dot.DEFMETHOD("is_call_pure", function(compressor) {
+    if (!compressor.option("unsafe")) return;
+    const expr = this.expression;
+
+    let native_obj;
+    if (expr instanceof AST_Array) {
+        native_obj = "Array";
+    } else if (expr.is_boolean()) {
+        native_obj = "Boolean";
+    } else if (expr.is_number(compressor)) {
+        native_obj = "Number";
+    } else if (expr instanceof AST_RegExp) {
+        native_obj = "RegExp";
+    } else if (expr.is_string(compressor)) {
+        native_obj = "String";
+    } else if (!this.may_throw_on_access(compressor)) {
+        native_obj = "Object";
+    }
+    return native_obj != null && is_pure_native_method(native_obj, this.property);
+});
+
+// tell me if a statement aborts
+const aborts = (thing) => thing && thing.aborts();
+
+(function(def_aborts) {
+    def_aborts(AST_Statement, return_null);
+    def_aborts(AST_Jump, return_this);
+    function block_aborts() {
+        for (var i = 0; i < this.body.length; i++) {
+            if (aborts(this.body[i])) {
+                return this.body[i];
+            }
+        }
+        return null;
+    }
+    def_aborts(AST_Import, function() { return null; });
+    def_aborts(AST_BlockStatement, block_aborts);
+    def_aborts(AST_SwitchBranch, block_aborts);
+    def_aborts(AST_If, function() {
+        return this.alternative && aborts(this.body) && aborts(this.alternative) && this;
+    });
+})(function(node, func) {
+    node.DEFMETHOD("aborts", func);
+});
+
+function is_modified(compressor, tw, node, value, level, immutable) {
+    var parent = tw.parent(level);
+    var lhs = is_lhs(node, parent);
+    if (lhs) return lhs;
+    if (!immutable
+        && parent instanceof AST_Call
+        && parent.expression === node
+        && !(value instanceof AST_Arrow)
+        && !(value instanceof AST_Class)
+        && !parent.is_callee_pure(compressor)
+        && (!(value instanceof AST_Function)
+            || !(parent instanceof AST_New) && value.contains_this())) {
+        return true;
+    }
+    if (parent instanceof AST_Array) {
+        return is_modified(compressor, tw, parent, parent, level + 1);
+    }
+    if (parent instanceof AST_ObjectKeyVal && node === parent.value) {
+        var obj = tw.parent(level + 1);
+        return is_modified(compressor, tw, obj, obj, level + 2);
+    }
+    if (parent instanceof AST_PropAccess && parent.expression === node) {
+        var prop = read_property(value, parent.property);
+        return !immutable && is_modified(compressor, tw, parent, prop, level + 1);
+    }
+}
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// methods to evaluate a constant expression
+
+function def_eval(node, func) {
+    node.DEFMETHOD("_eval", func);
+}
+
+// Used to propagate a nullish short-circuit signal upwards through the chain.
+const nullish = Symbol("This AST_Chain is nullish");
+
+// If the node has been successfully reduced to a constant,
+// then its value is returned; otherwise the element itself
+// is returned.
+// They can be distinguished as constant value is never a
+// descendant of AST_Node.
+AST_Node.DEFMETHOD("evaluate", function (compressor) {
+    if (!compressor.option("evaluate"))
+        return this;
+    var val = this._eval(compressor, 1);
+    if (!val || val instanceof RegExp)
+        return val;
+    if (typeof val == "function" || typeof val == "object" || val == nullish)
+        return this;
+    return val;
+});
+
+var unaryPrefix = makePredicate("! ~ - + void");
+AST_Node.DEFMETHOD("is_constant", function () {
+    // Accomodate when compress option evaluate=false
+    // as well as the common constant expressions !0 and -1
+    if (this instanceof AST_Constant) {
+        return !(this instanceof AST_RegExp);
+    } else {
+        return this instanceof AST_UnaryPrefix
+            && this.expression instanceof AST_Constant
+            && unaryPrefix.has(this.operator);
+    }
+});
+
+def_eval(AST_Statement, function () {
+    throw new Error(string_template("Cannot evaluate a statement [{file}:{line},{col}]", this.start));
+});
+
+def_eval(AST_Lambda, return_this);
+def_eval(AST_Class, return_this);
+def_eval(AST_Node, return_this);
+def_eval(AST_Constant, function () {
+    return this.getValue();
+});
+
+def_eval(AST_BigInt, return_this);
+
+def_eval(AST_RegExp, function (compressor) {
+    let evaluated = compressor.evaluated_regexps.get(this);
+    if (evaluated === undefined) {
+        try {
+            evaluated = (0, eval)(this.print_to_string());
+        } catch (e) {
+            evaluated = null;
+        }
+        compressor.evaluated_regexps.set(this, evaluated);
+    }
+    return evaluated || this;
+});
+
+def_eval(AST_TemplateString, function () {
+    if (this.segments.length !== 1) return this;
+    return this.segments[0].value;
+});
+
+def_eval(AST_Function, function (compressor) {
+    if (compressor.option("unsafe")) {
+        var fn = function () { };
+        fn.node = this;
+        fn.toString = () => this.print_to_string();
+        return fn;
+    }
+    return this;
+});
+
+def_eval(AST_Array, function (compressor, depth) {
+    if (compressor.option("unsafe")) {
+        var elements = [];
+        for (var i = 0, len = this.elements.length; i < len; i++) {
+            var element = this.elements[i];
+            var value = element._eval(compressor, depth);
+            if (element === value)
+                return this;
+            elements.push(value);
+        }
+        return elements;
+    }
+    return this;
+});
+
+def_eval(AST_Object, function (compressor, depth) {
+    if (compressor.option("unsafe")) {
+        var val = {};
+        for (var i = 0, len = this.properties.length; i < len; i++) {
+            var prop = this.properties[i];
+            if (prop instanceof AST_Expansion)
+                return this;
+            var key = prop.key;
+            if (key instanceof AST_Symbol) {
+                key = key.name;
+            } else if (key instanceof AST_Node) {
+                key = key._eval(compressor, depth);
+                if (key === prop.key)
+                    return this;
+            }
+            if (typeof Object.prototype[key] === "function") {
+                return this;
+            }
+            if (prop.value instanceof AST_Function)
+                continue;
+            val[key] = prop.value._eval(compressor, depth);
+            if (val[key] === prop.value)
+                return this;
+        }
+        return val;
+    }
+    return this;
+});
+
+var non_converting_unary = makePredicate("! typeof void");
+def_eval(AST_UnaryPrefix, function (compressor, depth) {
+    var e = this.expression;
+    // Function would be evaluated to an array and so typeof would
+    // incorrectly return 'object'. Hence making is a special case.
+    if (compressor.option("typeofs")
+        && this.operator == "typeof"
+        && (e instanceof AST_Lambda
+            || e instanceof AST_SymbolRef
+            && e.fixed_value() instanceof AST_Lambda)) {
+        return typeof function () { };
+    }
+    if (!non_converting_unary.has(this.operator))
+        depth++;
+    e = e._eval(compressor, depth);
+    if (e === this.expression)
+        return this;
+    switch (this.operator) {
+        case "!": return !e;
+        case "typeof":
+            // typeof <RegExp> returns "object" or "function" on different platforms
+            // so cannot evaluate reliably
+            if (e instanceof RegExp)
+                return this;
+            return typeof e;
+        case "void": return void e;
+        case "~": return ~e;
+        case "-": return -e;
+        case "+": return +e;
+    }
+    return this;
+});
+
+var non_converting_binary = makePredicate("&& || ?? === !==");
+const identity_comparison = makePredicate("== != === !==");
+const has_identity = value => typeof value === "object"
+    || typeof value === "function"
+    || typeof value === "symbol";
+
+def_eval(AST_Binary, function (compressor, depth) {
+    if (!non_converting_binary.has(this.operator))
+        depth++;
+
+    var left = this.left._eval(compressor, depth);
+    if (left === this.left)
+        return this;
+    var right = this.right._eval(compressor, depth);
+    if (right === this.right)
+        return this;
+    var result;
+
+    if (left != null
+        && right != null
+        && identity_comparison.has(this.operator)
+        && has_identity(left)
+        && has_identity(right)
+        && typeof left === typeof right) {
+        // Do not compare by reference
+        return this;
+    }
+
+    switch (this.operator) {
+        case "&&": result = left && right; break;
+        case "||": result = left || right; break;
+        case "??": result = left != null ? left : right; break;
+        case "|": result = left | right; break;
+        case "&": result = left & right; break;
+        case "^": result = left ^ right; break;
+        case "+": result = left + right; break;
+        case "*": result = left * right; break;
+        case "**": result = Math.pow(left, right); break;
+        case "/": result = left / right; break;
+        case "%": result = left % right; break;
+        case "-": result = left - right; break;
+        case "<<": result = left << right; break;
+        case ">>": result = left >> right; break;
+        case ">>>": result = left >>> right; break;
+        case "==": result = left == right; break;
+        case "===": result = left === right; break;
+        case "!=": result = left != right; break;
+        case "!==": result = left !== right; break;
+        case "<": result = left < right; break;
+        case "<=": result = left <= right; break;
+        case ">": result = left > right; break;
+        case ">=": result = left >= right; break;
+        default:
+            return this;
+    }
+    if (isNaN(result) && compressor.find_parent(AST_With)) {
+        // leave original expression as is
+        return this;
+    }
+    return result;
+});
+
+def_eval(AST_Conditional, function (compressor, depth) {
+    var condition = this.condition._eval(compressor, depth);
+    if (condition === this.condition)
+        return this;
+    var node = condition ? this.consequent : this.alternative;
+    var value = node._eval(compressor, depth);
+    return value === node ? this : value;
+});
+
+// Set of AST_SymbolRef which are currently being evaluated.
+// Avoids infinite recursion of ._eval()
+const reentrant_ref_eval = new Set();
+def_eval(AST_SymbolRef, function (compressor, depth) {
+    if (reentrant_ref_eval.has(this))
+        return this;
+
+    var fixed = this.fixed_value();
+    if (!fixed)
+        return this;
+
+    reentrant_ref_eval.add(this);
+    const value = fixed._eval(compressor, depth);
+    reentrant_ref_eval.delete(this);
+
+    if (value === fixed)
+        return this;
+
+    if (value && typeof value == "object") {
+        var escaped = this.definition().escaped;
+        if (escaped && depth > escaped)
+            return this;
+    }
+    return value;
+});
+
+const global_objs = { Array, Math, Number, Object, String };
+
+const regexp_flags = new Set([
+    "dotAll",
+    "global",
+    "ignoreCase",
+    "multiline",
+    "sticky",
+    "unicode",
+]);
+
+def_eval(AST_PropAccess, function (compressor, depth) {
+    const obj = this.expression._eval(compressor, depth);
+    if (obj === nullish || (this.optional && obj == null)) return nullish;
+    if (compressor.option("unsafe")) {
+        var key = this.property;
+        if (key instanceof AST_Node) {
+            key = key._eval(compressor, depth);
+            if (key === this.property)
+                return this;
+        }
+        var exp = this.expression;
+        var val;
+        if (is_undeclared_ref(exp)) {
+
+            var aa;
+            var first_arg = exp.name === "hasOwnProperty"
+                && key === "call"
+                && (aa = compressor.parent() && compressor.parent().args)
+                && (aa && aa[0]
+                    && aa[0].evaluate(compressor));
+
+            first_arg = first_arg instanceof AST_Dot ? first_arg.expression : first_arg;
+
+            if (first_arg == null || first_arg.thedef && first_arg.thedef.undeclared) {
+                return this.clone();
+            }
+            if (!is_pure_native_value(exp.name, key))
+                return this;
+            val = global_objs[exp.name];
+        } else {
+            val = exp._eval(compressor, depth + 1);
+            if (val instanceof RegExp) {
+                if (key == "source") {
+                    return regexp_source_fix(val.source);
+                } else if (key == "flags" || regexp_flags.has(key)) {
+                    return val[key];
+                }
+            }
+            if (!val || val === exp || !HOP(val, key))
+                return this;
+            if (typeof val == "function")
+                switch (key) {
+                    case "name":
+                        return val.node.name ? val.node.name.name : "";
+                    case "length":
+                        return val.node.length_property();
+                    default:
+                        return this;
+                }
+        }
+        return val[key];
+    }
+    return this;
+});
+
+def_eval(AST_Chain, function (compressor, depth) {
+    const evaluated = this.expression._eval(compressor, depth);
+    return evaluated === nullish
+        ? undefined
+        : evaluated === this.expression
+          ? this
+          : evaluated;
+});
+
+def_eval(AST_Call, function (compressor, depth) {
+    var exp = this.expression;
+
+    const callee = exp._eval(compressor, depth);
+    if (callee === nullish || (this.optional && callee == null)) return nullish;
+
+    if (compressor.option("unsafe") && exp instanceof AST_PropAccess) {
+        var key = exp.property;
+        if (key instanceof AST_Node) {
+            key = key._eval(compressor, depth);
+            if (key === exp.property)
+                return this;
+        }
+        var val;
+        var e = exp.expression;
+        if (is_undeclared_ref(e)) {
+            var first_arg = e.name === "hasOwnProperty" &&
+                key === "call" &&
+                (this.args[0] && this.args[0].evaluate(compressor));
+
+            first_arg = first_arg instanceof AST_Dot ? first_arg.expression : first_arg;
+
+            if ((first_arg == null || first_arg.thedef && first_arg.thedef.undeclared)) {
+                return this.clone();
+            }
+            if (!is_pure_native_fn(e.name, key)) return this;
+            val = global_objs[e.name];
+        } else {
+            val = e._eval(compressor, depth + 1);
+            if (val === e || !val)
+                return this;
+            if (!is_pure_native_method(val.constructor.name, key))
+                return this;
+        }
+        var args = [];
+        for (var i = 0, len = this.args.length; i < len; i++) {
+            var arg = this.args[i];
+            var value = arg._eval(compressor, depth);
+            if (arg === value)
+                return this;
+            if (arg instanceof AST_Lambda)
+                return this;
+            args.push(value);
+        }
+        try {
+            return val[key].apply(val, args);
+        } catch (ex) {
+            // We don't really care
+        }
+    }
+    return this;
+});
+
+// Also a subclass of AST_Call
+def_eval(AST_New, return_this);
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// AST_Node#drop_side_effect_free() gets called when we don't care about the value,
+// only about side effects. We'll be defining this method for each node type in this module
+//
+// Examples:
+// foo++ -> foo++
+// 1 + func() -> func()
+// 10 -> (nothing)
+// knownPureFunc(foo++) -> foo++
+
+function def_drop_side_effect_free(node, func) {
+    node.DEFMETHOD("drop_side_effect_free", func);
+}
+
+// Drop side-effect-free elements from an array of expressions.
+// Returns an array of expressions with side-effects or null
+// if all elements were dropped. Note: original array may be
+// returned if nothing changed.
+function trim(nodes, compressor, first_in_statement) {
+    var len = nodes.length;
+    if (!len)  return null;
+
+    var ret = [], changed = false;
+    for (var i = 0; i < len; i++) {
+        var node = nodes[i].drop_side_effect_free(compressor, first_in_statement);
+        changed |= node !== nodes[i];
+        if (node) {
+            ret.push(node);
+            first_in_statement = false;
+        }
+    }
+    return changed ? ret.length ? ret : null : nodes;
+}
+
+def_drop_side_effect_free(AST_Node, return_this);
+def_drop_side_effect_free(AST_Constant, return_null);
+def_drop_side_effect_free(AST_This, return_null);
+
+def_drop_side_effect_free(AST_Call, function (compressor, first_in_statement) {
+    if (is_nullish_shortcircuited(this, compressor)) {
+        return this.expression.drop_side_effect_free(compressor, first_in_statement);
+    }
+
+    if (!this.is_callee_pure(compressor)) {
+        if (this.expression.is_call_pure(compressor)) {
+            var exprs = this.args.slice();
+            exprs.unshift(this.expression.expression);
+            exprs = trim(exprs, compressor, first_in_statement);
+            return exprs && make_sequence(this, exprs);
+        }
+        if (is_func_expr(this.expression)
+            && (!this.expression.name || !this.expression.name.definition().references.length)) {
+            var node = this.clone();
+            node.expression.process_expression(false, compressor);
+            return node;
+        }
+        return this;
+    }
+
+    var args = trim(this.args, compressor, first_in_statement);
+    return args && make_sequence(this, args);
+});
+
+def_drop_side_effect_free(AST_Accessor, return_null);
+
+def_drop_side_effect_free(AST_Function, return_null);
+
+def_drop_side_effect_free(AST_Arrow, return_null);
+
+def_drop_side_effect_free(AST_Class, function (compressor) {
+    const with_effects = [];
+    const trimmed_extends = this.extends && this.extends.drop_side_effect_free(compressor);
+    if (trimmed_extends)
+        with_effects.push(trimmed_extends);
+    for (const prop of this.properties) {
+        const trimmed_prop = prop.drop_side_effect_free(compressor);
+        if (trimmed_prop)
+            with_effects.push(trimmed_prop);
+    }
+    if (!with_effects.length)
+        return null;
+    return make_sequence(this, with_effects);
+});
+
+def_drop_side_effect_free(AST_Binary, function (compressor, first_in_statement) {
+    var right = this.right.drop_side_effect_free(compressor);
+    if (!right)
+        return this.left.drop_side_effect_free(compressor, first_in_statement);
+    if (lazy_op.has(this.operator)) {
+        if (right === this.right)
+            return this;
+        var node = this.clone();
+        node.right = right;
+        return node;
+    } else {
+        var left = this.left.drop_side_effect_free(compressor, first_in_statement);
+        if (!left)
+            return this.right.drop_side_effect_free(compressor, first_in_statement);
+        return make_sequence(this, [left, right]);
+    }
+});
+
+def_drop_side_effect_free(AST_Assign, function (compressor) {
+    if (this.logical)
+        return this;
+
+    var left = this.left;
+    if (left.has_side_effects(compressor)
+        || compressor.has_directive("use strict")
+        && left instanceof AST_PropAccess
+        && left.expression.is_constant()) {
+        return this;
+    }
+    set_flag(this, WRITE_ONLY);
+    while (left instanceof AST_PropAccess) {
+        left = left.expression;
+    }
+    if (left.is_constant_expression(compressor.find_parent(AST_Scope))) {
+        return this.right.drop_side_effect_free(compressor);
+    }
+    return this;
+});
+
+def_drop_side_effect_free(AST_Conditional, function (compressor) {
+    var consequent = this.consequent.drop_side_effect_free(compressor);
+    var alternative = this.alternative.drop_side_effect_free(compressor);
+    if (consequent === this.consequent && alternative === this.alternative)
+        return this;
+    if (!consequent)
+        return alternative ? make_node(AST_Binary, this, {
+            operator: "||",
+            left: this.condition,
+            right: alternative
+        }) : this.condition.drop_side_effect_free(compressor);
+    if (!alternative)
+        return make_node(AST_Binary, this, {
+            operator: "&&",
+            left: this.condition,
+            right: consequent
+        });
+    var node = this.clone();
+    node.consequent = consequent;
+    node.alternative = alternative;
+    return node;
+});
+
+def_drop_side_effect_free(AST_Unary, function (compressor, first_in_statement) {
+    if (unary_side_effects.has(this.operator)) {
+        if (!this.expression.has_side_effects(compressor)) {
+            set_flag(this, WRITE_ONLY);
+        } else {
+            clear_flag(this, WRITE_ONLY);
+        }
+        return this;
+    }
+    if (this.operator == "typeof" && this.expression instanceof AST_SymbolRef)
+        return null;
+    var expression = this.expression.drop_side_effect_free(compressor, first_in_statement);
+    if (first_in_statement && expression && is_iife_call(expression)) {
+        if (expression === this.expression && this.operator == "!")
+            return this;
+        return expression.negate(compressor, first_in_statement);
+    }
+    return expression;
+});
+
+def_drop_side_effect_free(AST_SymbolRef, function (compressor) {
+    const safe_access = this.is_declared(compressor)
+        || pure_prop_access_globals.has(this.name);
+    return safe_access ? null : this;
+});
+
+def_drop_side_effect_free(AST_Object, function (compressor, first_in_statement) {
+    var values = trim(this.properties, compressor, first_in_statement);
+    return values && make_sequence(this, values);
+});
+
+def_drop_side_effect_free(AST_ObjectProperty, function (compressor, first_in_statement) {
+    const computed_key = this instanceof AST_ObjectKeyVal && this.key instanceof AST_Node;
+    const key = computed_key && this.key.drop_side_effect_free(compressor, first_in_statement);
+    const value = this.value && this.value.drop_side_effect_free(compressor, first_in_statement);
+    if (key && value) {
+        return make_sequence(this, [key, value]);
+    }
+    return key || value;
+});
+
+def_drop_side_effect_free(AST_ClassProperty, function (compressor) {
+    const key = this.computed_key() && this.key.drop_side_effect_free(compressor);
+
+    const value = this.static && this.value
+        && this.value.drop_side_effect_free(compressor);
+
+    if (key && value)
+        return make_sequence(this, [key, value]);
+    return key || value || null;
+});
+
+def_drop_side_effect_free(AST_ConciseMethod, function () {
+    return this.computed_key() ? this.key : null;
+});
+
+def_drop_side_effect_free(AST_ObjectGetter, function () {
+    return this.computed_key() ? this.key : null;
+});
+
+def_drop_side_effect_free(AST_ObjectSetter, function () {
+    return this.computed_key() ? this.key : null;
+});
+
+def_drop_side_effect_free(AST_Array, function (compressor, first_in_statement) {
+    var values = trim(this.elements, compressor, first_in_statement);
+    return values && make_sequence(this, values);
+});
+
+def_drop_side_effect_free(AST_Dot, function (compressor, first_in_statement) {
+    if (is_nullish_shortcircuited(this, compressor)) {
+        return this.expression.drop_side_effect_free(compressor, first_in_statement);
+    }
+    if (this.expression.may_throw_on_access(compressor)) return this;
+
+    return this.expression.drop_side_effect_free(compressor, first_in_statement);
+});
+
+def_drop_side_effect_free(AST_Sub, function (compressor, first_in_statement) {
+    if (is_nullish_shortcircuited(this, compressor)) {
+        return this.expression.drop_side_effect_free(compressor, first_in_statement);
+    }
+    if (this.expression.may_throw_on_access(compressor)) return this;
+
+    var expression = this.expression.drop_side_effect_free(compressor, first_in_statement);
+    if (!expression)
+        return this.property.drop_side_effect_free(compressor, first_in_statement);
+    var property = this.property.drop_side_effect_free(compressor);
+    if (!property)
+        return expression;
+    return make_sequence(this, [expression, property]);
+});
+
+def_drop_side_effect_free(AST_Chain, function (compressor, first_in_statement) {
+    return this.expression.drop_side_effect_free(compressor, first_in_statement);
+});
+
+def_drop_side_effect_free(AST_Sequence, function (compressor) {
+    var last = this.tail_node();
+    var expr = last.drop_side_effect_free(compressor);
+    if (expr === last)
+        return this;
+    var expressions = this.expressions.slice(0, -1);
+    if (expr)
+        expressions.push(expr);
+    if (!expressions.length) {
+        return make_node(AST_Number, this, { value: 0 });
+    }
+    return make_sequence(this, expressions);
+});
+
+def_drop_side_effect_free(AST_Expansion, function (compressor, first_in_statement) {
+    return this.expression.drop_side_effect_free(compressor, first_in_statement);
+});
+
+def_drop_side_effect_free(AST_TemplateSegment, return_null);
+
+def_drop_side_effect_free(AST_TemplateString, function (compressor) {
+    var values = trim(this.segments, compressor, first_in_statement);
+    return values && make_sequence(this, values);
+});
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// Define the method AST_Node#reduce_vars, which goes through the AST in
+// execution order to perform basic flow analysis
+
+function def_reduce_vars(node, func) {
+    node.DEFMETHOD("reduce_vars", func);
+}
+
+def_reduce_vars(AST_Node, noop);
+
+function reset_def(compressor, def) {
+    def.assignments = 0;
+    def.chained = false;
+    def.direct_access = false;
+    def.escaped = 0;
+    def.recursive_refs = 0;
+    def.references = [];
+    def.single_use = undefined;
+    if (def.scope.pinned()) {
+        def.fixed = false;
+    } else if (def.orig[0] instanceof AST_SymbolConst || !compressor.exposed(def)) {
+        def.fixed = def.init;
+    } else {
+        def.fixed = false;
+    }
+}
+
+function reset_variables(tw, compressor, node) {
+    node.variables.forEach(function(def) {
+        reset_def(compressor, def);
+        if (def.fixed === null) {
+            tw.defs_to_safe_ids.set(def.id, tw.safe_ids);
+            mark(tw, def, true);
+        } else if (def.fixed) {
+            tw.loop_ids.set(def.id, tw.in_loop);
+            mark(tw, def, true);
+        }
+    });
+}
+
+function reset_block_variables(compressor, node) {
+    if (node.block_scope) node.block_scope.variables.forEach((def) => {
+        reset_def(compressor, def);
+    });
+}
+
+function push(tw) {
+    tw.safe_ids = Object.create(tw.safe_ids);
+}
+
+function pop(tw) {
+    tw.safe_ids = Object.getPrototypeOf(tw.safe_ids);
+}
+
+function mark(tw, def, safe) {
+    tw.safe_ids[def.id] = safe;
+}
+
+function safe_to_read(tw, def) {
+    if (def.single_use == "m") return false;
+    if (tw.safe_ids[def.id]) {
+        if (def.fixed == null) {
+            var orig = def.orig[0];
+            if (orig instanceof AST_SymbolFunarg || orig.name == "arguments") return false;
+            def.fixed = make_node(AST_Undefined, orig);
+        }
+        return true;
+    }
+    return def.fixed instanceof AST_Defun;
+}
+
+function safe_to_assign(tw, def, scope, value) {
+    if (def.fixed === undefined) return true;
+    let def_safe_ids;
+    if (def.fixed === null
+        && (def_safe_ids = tw.defs_to_safe_ids.get(def.id))
+    ) {
+        def_safe_ids[def.id] = false;
+        tw.defs_to_safe_ids.delete(def.id);
+        return true;
+    }
+    if (!HOP(tw.safe_ids, def.id)) return false;
+    if (!safe_to_read(tw, def)) return false;
+    if (def.fixed === false) return false;
+    if (def.fixed != null && (!value || def.references.length > def.assignments)) return false;
+    if (def.fixed instanceof AST_Defun) {
+        return value instanceof AST_Node && def.fixed.parent_scope === scope;
+    }
+    return def.orig.every((sym) => {
+        return !(sym instanceof AST_SymbolConst
+            || sym instanceof AST_SymbolDefun
+            || sym instanceof AST_SymbolLambda);
+    });
+}
+
+function ref_once(tw, compressor, def) {
+    return compressor.option("unused")
+        && !def.scope.pinned()
+        && def.references.length - def.recursive_refs == 1
+        && tw.loop_ids.get(def.id) === tw.in_loop;
+}
+
+function is_immutable(value) {
+    if (!value) return false;
+    return value.is_constant()
+        || value instanceof AST_Lambda
+        || value instanceof AST_This;
+}
+
+// A definition "escapes" when its value can leave the point of use.
+// Example: `a = b || c`
+// In this example, "b" and "c" are escaping, because they're going into "a"
+//
+// def.escaped is != 0 when it escapes.
+//
+// When greater than 1, it means that N chained properties will be read off
+// of that def before an escape occurs. This is useful for evaluating
+// property accesses, where you need to know when to stop.
+function mark_escaped(tw, d, scope, node, value, level = 0, depth = 1) {
+    var parent = tw.parent(level);
+    if (value) {
+        if (value.is_constant()) return;
+        if (value instanceof AST_ClassExpression) return;
+    }
+
+    if (
+        parent instanceof AST_Assign && (parent.operator === "=" || parent.logical) && node === parent.right
+        || parent instanceof AST_Call && (node !== parent.expression || parent instanceof AST_New)
+        || parent instanceof AST_Exit && node === parent.value && node.scope !== d.scope
+        || parent instanceof AST_VarDef && node === parent.value
+        || parent instanceof AST_Yield && node === parent.value && node.scope !== d.scope
+    ) {
+        if (depth > 1 && !(value && value.is_constant_expression(scope))) depth = 1;
+        if (!d.escaped || d.escaped > depth) d.escaped = depth;
+        return;
+    } else if (
+        parent instanceof AST_Array
+        || parent instanceof AST_Await
+        || parent instanceof AST_Binary && lazy_op.has(parent.operator)
+        || parent instanceof AST_Conditional && node !== parent.condition
+        || parent instanceof AST_Expansion
+        || parent instanceof AST_Sequence && node === parent.tail_node()
+    ) {
+        mark_escaped(tw, d, scope, parent, parent, level + 1, depth);
+    } else if (parent instanceof AST_ObjectKeyVal && node === parent.value) {
+        var obj = tw.parent(level + 1);
+
+        mark_escaped(tw, d, scope, obj, obj, level + 2, depth);
+    } else if (parent instanceof AST_PropAccess && node === parent.expression) {
+        value = read_property(value, parent.property);
+
+        mark_escaped(tw, d, scope, parent, value, level + 1, depth + 1);
+        if (value) return;
+    }
+
+    if (level > 0) return;
+    if (parent instanceof AST_Sequence && node !== parent.tail_node()) return;
+    if (parent instanceof AST_SimpleStatement) return;
+
+    d.direct_access = true;
+}
+
+const suppress = node => walk(node, node => {
+    if (!(node instanceof AST_Symbol)) return;
+    var d = node.definition();
+    if (!d) return;
+    if (node instanceof AST_SymbolRef) d.references.push(node);
+    d.fixed = false;
+});
+
+def_reduce_vars(AST_Accessor, function(tw, descend, compressor) {
+    push(tw);
+    reset_variables(tw, compressor, this);
+    descend();
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Assign, function(tw, descend, compressor) {
+    var node = this;
+    if (node.left instanceof AST_Destructuring) {
+        suppress(node.left);
+        return;
+    }
+
+    const finish_walk = () => {
+        if (node.logical) {
+            node.left.walk(tw);
+
+            push(tw);
+            node.right.walk(tw);
+            pop(tw);
+
+            return true;
+        }
+    };
+
+    var sym = node.left;
+    if (!(sym instanceof AST_SymbolRef)) return finish_walk();
+
+    var def = sym.definition();
+    var safe = safe_to_assign(tw, def, sym.scope, node.right);
+    def.assignments++;
+    if (!safe) return finish_walk();
+
+    var fixed = def.fixed;
+    if (!fixed && node.operator != "=" && !node.logical) return finish_walk();
+
+    var eq = node.operator == "=";
+    var value = eq ? node.right : node;
+    if (is_modified(compressor, tw, node, value, 0)) return finish_walk();
+
+    def.references.push(sym);
+
+    if (!node.logical) {
+        if (!eq) def.chained = true;
+
+        def.fixed = eq ? function() {
+            return node.right;
+        } : function() {
+            return make_node(AST_Binary, node, {
+                operator: node.operator.slice(0, -1),
+                left: fixed instanceof AST_Node ? fixed : fixed(),
+                right: node.right
+            });
+        };
+    }
+
+    if (node.logical) {
+        mark(tw, def, false);
+        push(tw);
+        node.right.walk(tw);
+        pop(tw);
+        return true;
+    }
+
+    mark(tw, def, false);
+    node.right.walk(tw);
+    mark(tw, def, true);
+
+    mark_escaped(tw, def, sym.scope, node, value, 0, 1);
+
+    return true;
+});
+
+def_reduce_vars(AST_Binary, function(tw) {
+    if (!lazy_op.has(this.operator)) return;
+    this.left.walk(tw);
+    push(tw);
+    this.right.walk(tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Block, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+});
+
+def_reduce_vars(AST_Case, function(tw) {
+    push(tw);
+    this.expression.walk(tw);
+    pop(tw);
+    push(tw);
+    walk_body(this, tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Class, function(tw, descend) {
+    clear_flag(this, INLINED);
+    push(tw);
+    descend();
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Conditional, function(tw) {
+    this.condition.walk(tw);
+    push(tw);
+    this.consequent.walk(tw);
+    pop(tw);
+    push(tw);
+    this.alternative.walk(tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Chain, function(tw, descend) {
+    // Chains' conditions apply left-to-right, cumulatively.
+    // If we walk normally we don't go in that order because we would pop before pushing again
+    // Solution: AST_PropAccess and AST_Call push when they are optional, and never pop.
+    // Then we pop everything when they are done being walked.
+    const safe_ids = tw.safe_ids;
+
+    descend();
+
+    // Unroll back to start
+    tw.safe_ids = safe_ids;
+    return true;
+});
+
+def_reduce_vars(AST_Call, function (tw) {
+    this.expression.walk(tw);
+
+    if (this.optional) {
+        // Never pop -- it's popped at AST_Chain above
+        push(tw);
+    }
+
+    for (const arg of this.args) arg.walk(tw);
+
+    return true;
+});
+
+def_reduce_vars(AST_PropAccess, function (tw) {
+    if (!this.optional) return;
+
+    this.expression.walk(tw);
+
+    // Never pop -- it's popped at AST_Chain above
+    push(tw);
+
+    if (this.property instanceof AST_Node) this.property.walk(tw);
+
+    return true;
+});
+
+def_reduce_vars(AST_Default, function(tw, descend) {
+    push(tw);
+    descend();
+    pop(tw);
+    return true;
+});
+
+function mark_lambda(tw, descend, compressor) {
+    clear_flag(this, INLINED);
+    push(tw);
+    reset_variables(tw, compressor, this);
+    if (this.uses_arguments) {
+        descend();
+        pop(tw);
+        return;
+    }
+    var iife;
+    if (!this.name
+        && (iife = tw.parent()) instanceof AST_Call
+        && iife.expression === this
+        && !iife.args.some(arg => arg instanceof AST_Expansion)
+        && this.argnames.every(arg_name => arg_name instanceof AST_Symbol)
+    ) {
+        // Virtually turn IIFE parameters into variable definitions:
+        //   (function(a,b) {...})(c,d) => (function() {var a=c,b=d; ...})()
+        // So existing transformation rules can work on them.
+        this.argnames.forEach((arg, i) => {
+            if (!arg.definition) return;
+            var d = arg.definition();
+            // Avoid setting fixed when there's more than one origin for a variable value
+            if (d.orig.length > 1) return;
+            if (d.fixed === undefined && (!this.uses_arguments || tw.has_directive("use strict"))) {
+                d.fixed = function() {
+                    return iife.args[i] || make_node(AST_Undefined, iife);
+                };
+                tw.loop_ids.set(d.id, tw.in_loop);
+                mark(tw, d, true);
+            } else {
+                d.fixed = false;
+            }
+        });
+    }
+    descend();
+    pop(tw);
+    return true;
+}
+
+def_reduce_vars(AST_Lambda, mark_lambda);
+
+def_reduce_vars(AST_Do, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    this.body.walk(tw);
+    if (has_break_or_continue(this)) {
+        pop(tw);
+        push(tw);
+    }
+    this.condition.walk(tw);
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
+
+def_reduce_vars(AST_For, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    if (this.init) this.init.walk(tw);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    if (this.condition) this.condition.walk(tw);
+    this.body.walk(tw);
+    if (this.step) {
+        if (has_break_or_continue(this)) {
+            pop(tw);
+            push(tw);
+        }
+        this.step.walk(tw);
+    }
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
+
+def_reduce_vars(AST_ForIn, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    suppress(this.init);
+    this.object.walk(tw);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    this.body.walk(tw);
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
+
+def_reduce_vars(AST_If, function(tw) {
+    this.condition.walk(tw);
+    push(tw);
+    this.body.walk(tw);
+    pop(tw);
+    if (this.alternative) {
+        push(tw);
+        this.alternative.walk(tw);
+        pop(tw);
+    }
+    return true;
+});
+
+def_reduce_vars(AST_LabeledStatement, function(tw) {
+    push(tw);
+    this.body.walk(tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_SymbolCatch, function() {
+    this.definition().fixed = false;
+});
+
+def_reduce_vars(AST_SymbolRef, function(tw, descend, compressor) {
+    var d = this.definition();
+    d.references.push(this);
+    if (d.references.length == 1
+        && !d.fixed
+        && d.orig[0] instanceof AST_SymbolDefun) {
+        tw.loop_ids.set(d.id, tw.in_loop);
+    }
+    var fixed_value;
+    if (d.fixed === undefined || !safe_to_read(tw, d)) {
+        d.fixed = false;
+    } else if (d.fixed) {
+        fixed_value = this.fixed_value();
+        if (
+            fixed_value instanceof AST_Lambda
+            && is_recursive_ref(tw, d)
+        ) {
+            d.recursive_refs++;
+        } else if (fixed_value
+            && !compressor.exposed(d)
+            && ref_once(tw, compressor, d)
+        ) {
+            d.single_use =
+                fixed_value instanceof AST_Lambda && !fixed_value.pinned()
+                || fixed_value instanceof AST_Class
+                || d.scope === this.scope && fixed_value.is_constant_expression();
+        } else {
+            d.single_use = false;
+        }
+        if (is_modified(compressor, tw, this, fixed_value, 0, is_immutable(fixed_value))) {
+            if (d.single_use) {
+                d.single_use = "m";
+            } else {
+                d.fixed = false;
+            }
+        }
+    }
+    mark_escaped(tw, d, this.scope, this, fixed_value, 0, 1);
+});
+
+def_reduce_vars(AST_Toplevel, function(tw, descend, compressor) {
+    this.globals.forEach(function(def) {
+        reset_def(compressor, def);
+    });
+    reset_variables(tw, compressor, this);
+});
+
+def_reduce_vars(AST_Try, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    push(tw);
+    walk_body(this, tw);
+    pop(tw);
+    if (this.bcatch) {
+        push(tw);
+        this.bcatch.walk(tw);
+        pop(tw);
+    }
+    if (this.bfinally) this.bfinally.walk(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Unary, function(tw) {
+    var node = this;
+    if (node.operator !== "++" && node.operator !== "--") return;
+    var exp = node.expression;
+    if (!(exp instanceof AST_SymbolRef)) return;
+    var def = exp.definition();
+    var safe = safe_to_assign(tw, def, exp.scope, true);
+    def.assignments++;
+    if (!safe) return;
+    var fixed = def.fixed;
+    if (!fixed) return;
+    def.references.push(exp);
+    def.chained = true;
+    def.fixed = function() {
+        return make_node(AST_Binary, node, {
+            operator: node.operator.slice(0, -1),
+            left: make_node(AST_UnaryPrefix, node, {
+                operator: "+",
+                expression: fixed instanceof AST_Node ? fixed : fixed()
+            }),
+            right: make_node(AST_Number, node, {
+                value: 1
+            })
+        });
+    };
+    mark(tw, def, true);
+    return true;
+});
+
+def_reduce_vars(AST_VarDef, function(tw, descend) {
+    var node = this;
+    if (node.name instanceof AST_Destructuring) {
+        suppress(node.name);
+        return;
+    }
+    var d = node.name.definition();
+    if (node.value) {
+        if (safe_to_assign(tw, d, node.name.scope, node.value)) {
+            d.fixed = function() {
+                return node.value;
+            };
+            tw.loop_ids.set(d.id, tw.in_loop);
+            mark(tw, d, false);
+            descend();
+            mark(tw, d, true);
+            return true;
+        } else {
+            d.fixed = false;
+        }
+    }
+});
+
+def_reduce_vars(AST_While, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    descend();
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+function loop_body(x) {
+    if (x instanceof AST_IterationStatement) {
+        return x.body instanceof AST_BlockStatement ? x.body : x;
+    }
+    return x;
+}
+
+function is_lhs_read_only(lhs) {
+    if (lhs instanceof AST_This) return true;
+    if (lhs instanceof AST_SymbolRef) return lhs.definition().orig[0] instanceof AST_SymbolLambda;
+    if (lhs instanceof AST_PropAccess) {
+        lhs = lhs.expression;
+        if (lhs instanceof AST_SymbolRef) {
+            if (lhs.is_immutable()) return false;
+            lhs = lhs.fixed_value();
+        }
+        if (!lhs) return true;
+        if (lhs instanceof AST_RegExp) return false;
+        if (lhs instanceof AST_Constant) return true;
+        return is_lhs_read_only(lhs);
+    }
+    return false;
+}
+
+// Remove code which we know is unreachable.
+function trim_unreachable_code(compressor, stat, target) {
+    walk(stat, node => {
+        if (node instanceof AST_Var) {
+            node.remove_initializers();
+            target.push(node);
+            return true;
+        }
+        if (
+            node instanceof AST_Defun
+            && (node === stat || !compressor.has_directive("use strict"))
+        ) {
+            target.push(node === stat ? node : make_node(AST_Var, node, {
+                definitions: [
+                    make_node(AST_VarDef, node, {
+                        name: make_node(AST_SymbolVar, node.name, node.name),
+                        value: null
+                    })
+                ]
+            }));
+            return true;
+        }
+        if (node instanceof AST_Export || node instanceof AST_Import) {
+            target.push(node);
+            return true;
+        }
+        if (node instanceof AST_Scope) {
+            return true;
+        }
+    });
+}
+
+// Tighten a bunch of statements together, and perform statement-level optimization.
+function tighten_body(statements, compressor) {
+    var in_loop, in_try;
+    var scope = compressor.find_parent(AST_Scope).get_defun_scope();
+    find_loop_scope_try();
+    var CHANGED, max_iter = 10;
+    do {
+        CHANGED = false;
+        eliminate_spurious_blocks(statements);
+        if (compressor.option("dead_code")) {
+            eliminate_dead_code(statements, compressor);
+        }
+        if (compressor.option("if_return")) {
+            handle_if_return(statements, compressor);
+        }
+        if (compressor.sequences_limit > 0) {
+            sequencesize(statements, compressor);
+            sequencesize_2(statements, compressor);
+        }
+        if (compressor.option("join_vars")) {
+            join_consecutive_vars(statements);
+        }
+        if (compressor.option("collapse_vars")) {
+            collapse(statements, compressor);
+        }
+    } while (CHANGED && max_iter-- > 0);
+
+    function find_loop_scope_try() {
+        var node = compressor.self(), level = 0;
+        do {
+            if (node instanceof AST_Catch || node instanceof AST_Finally) {
+                level++;
+            } else if (node instanceof AST_IterationStatement) {
+                in_loop = true;
+            } else if (node instanceof AST_Scope) {
+                scope = node;
+                break;
+            } else if (node instanceof AST_Try) {
+                in_try = true;
+            }
+        } while (node = compressor.parent(level++));
+    }
+
+    // Search from right to left for assignment-like expressions:
+    // - `var a = x;`
+    // - `a = x;`
+    // - `++a`
+    // For each candidate, scan from left to right for first usage, then try
+    // to fold assignment into the site for compression.
+    // Will not attempt to collapse assignments into or past code blocks
+    // which are not sequentially executed, e.g. loops and conditionals.
+    function collapse(statements, compressor) {
+        if (scope.pinned())
+            return statements;
+        var args;
+        var candidates = [];
+        var stat_index = statements.length;
+        var scanner = new TreeTransformer(function (node) {
+            if (abort)
+                return node;
+            // Skip nodes before `candidate` as quickly as possible
+            if (!hit) {
+                if (node !== hit_stack[hit_index])
+                    return node;
+                hit_index++;
+                if (hit_index < hit_stack.length)
+                    return handle_custom_scan_order(node);
+                hit = true;
+                stop_after = find_stop(node, 0);
+                if (stop_after === node)
+                    abort = true;
+                return node;
+            }
+            // Stop immediately if these node types are encountered
+            var parent = scanner.parent();
+            if (node instanceof AST_Assign
+                    && (node.logical || node.operator != "=" && lhs.equivalent_to(node.left))
+                || node instanceof AST_Await
+                || node instanceof AST_Call && lhs instanceof AST_PropAccess && lhs.equivalent_to(node.expression)
+                || node instanceof AST_Debugger
+                || node instanceof AST_Destructuring
+                || node instanceof AST_Expansion
+                    && node.expression instanceof AST_Symbol
+                    && (
+                        node.expression instanceof AST_This
+                        || node.expression.definition().references.length > 1
+                    )
+                || node instanceof AST_IterationStatement && !(node instanceof AST_For)
+                || node instanceof AST_LoopControl
+                || node instanceof AST_Try
+                || node instanceof AST_With
+                || node instanceof AST_Yield
+                || node instanceof AST_Export
+                || node instanceof AST_Class
+                || parent instanceof AST_For && node !== parent.init
+                || !replace_all
+                    && (
+                        node instanceof AST_SymbolRef
+                        && !node.is_declared(compressor)
+                        && !pure_prop_access_globals.has(node)
+                    )
+                || node instanceof AST_SymbolRef
+                    && parent instanceof AST_Call
+                    && has_annotation(parent, _NOINLINE)
+            ) {
+                abort = true;
+                return node;
+            }
+            // Stop only if candidate is found within conditional branches
+            if (!stop_if_hit && (!lhs_local || !replace_all)
+                && (parent instanceof AST_Binary && lazy_op.has(parent.operator) && parent.left !== node
+                    || parent instanceof AST_Conditional && parent.condition !== node
+                    || parent instanceof AST_If && parent.condition !== node)) {
+                stop_if_hit = parent;
+            }
+            // Replace variable with assignment when found
+            if (can_replace
+                && !(node instanceof AST_SymbolDeclaration)
+                && lhs.equivalent_to(node)
+                && !shadows(node.scope, lvalues)
+            ) {
+                if (stop_if_hit) {
+                    abort = true;
+                    return node;
+                }
+                if (is_lhs(node, parent)) {
+                    if (value_def)
+                        replaced++;
+                    return node;
+                } else {
+                    replaced++;
+                    if (value_def && candidate instanceof AST_VarDef)
+                        return node;
+                }
+                CHANGED = abort = true;
+                if (candidate instanceof AST_UnaryPostfix) {
+                    return make_node(AST_UnaryPrefix, candidate, candidate);
+                }
+                if (candidate instanceof AST_VarDef) {
+                    var def = candidate.name.definition();
+                    var value = candidate.value;
+                    if (def.references.length - def.replaced == 1 && !compressor.exposed(def)) {
+                        def.replaced++;
+                        if (funarg && is_identifier_atom(value)) {
+                            return value.transform(compressor);
+                        } else {
+                            return maintain_this_binding(parent, node, value);
+                        }
+                    }
+                    return make_node(AST_Assign, candidate, {
+                        operator: "=",
+                        logical: false,
+                        left: make_node(AST_SymbolRef, candidate.name, candidate.name),
+                        right: value
+                    });
+                }
+                clear_flag(candidate, WRITE_ONLY);
+                return candidate;
+            }
+            // These node types have child nodes that execute sequentially,
+            // but are otherwise not safe to scan into or beyond them.
+            var sym;
+            if (node instanceof AST_Call
+                || node instanceof AST_Exit
+                && (side_effects || lhs instanceof AST_PropAccess || may_modify(lhs))
+                || node instanceof AST_PropAccess
+                && (side_effects || node.expression.may_throw_on_access(compressor))
+                || node instanceof AST_SymbolRef
+                && ((lvalues.has(node.name) && lvalues.get(node.name).modified) || side_effects && may_modify(node))
+                || node instanceof AST_VarDef && node.value
+                && (lvalues.has(node.name.name) || side_effects && may_modify(node.name))
+                || (sym = is_lhs(node.left, node))
+                && (sym instanceof AST_PropAccess || lvalues.has(sym.name))
+                || may_throw
+                && (in_try ? node.has_side_effects(compressor) : side_effects_external(node))) {
+                stop_after = node;
+                if (node instanceof AST_Scope)
+                    abort = true;
+            }
+            return handle_custom_scan_order(node);
+        }, function (node) {
+            if (abort)
+                return;
+            if (stop_after === node)
+                abort = true;
+            if (stop_if_hit === node)
+                stop_if_hit = null;
+        });
+
+        var multi_replacer = new TreeTransformer(function (node) {
+            if (abort)
+                return node;
+            // Skip nodes before `candidate` as quickly as possible
+            if (!hit) {
+                if (node !== hit_stack[hit_index])
+                    return node;
+                hit_index++;
+                if (hit_index < hit_stack.length)
+                    return;
+                hit = true;
+                return node;
+            }
+            // Replace variable when found
+            if (node instanceof AST_SymbolRef
+                && node.name == def.name) {
+                if (!--replaced)
+                    abort = true;
+                if (is_lhs(node, multi_replacer.parent()))
+                    return node;
+                def.replaced++;
+                value_def.replaced--;
+                return candidate.value;
+            }
+            // Skip (non-executed) functions and (leading) default case in switch statements
+            if (node instanceof AST_Default || node instanceof AST_Scope)
+                return node;
+        });
+
+        while (--stat_index >= 0) {
+            // Treat parameters as collapsible in IIFE, i.e.
+            //   function(a, b){ ... }(x());
+            // would be translated into equivalent assignments:
+            //   var a = x(), b = undefined;
+            if (stat_index == 0 && compressor.option("unused"))
+                extract_args();
+            // Find collapsible assignments
+            var hit_stack = [];
+            extract_candidates(statements[stat_index]);
+            while (candidates.length > 0) {
+                hit_stack = candidates.pop();
+                var hit_index = 0;
+                var candidate = hit_stack[hit_stack.length - 1];
+                var value_def = null;
+                var stop_after = null;
+                var stop_if_hit = null;
+                var lhs = get_lhs(candidate);
+                if (!lhs || is_lhs_read_only(lhs) || lhs.has_side_effects(compressor))
+                    continue;
+                // Locate symbols which may execute code outside of scanning range
+                var lvalues = get_lvalues(candidate);
+                var lhs_local = is_lhs_local(lhs);
+                if (lhs instanceof AST_SymbolRef) {
+                    lvalues.set(lhs.name, { def: lhs.definition(), modified: false });
+                }
+                var side_effects = value_has_side_effects(candidate);
+                var replace_all = replace_all_symbols();
+                var may_throw = candidate.may_throw(compressor);
+                var funarg = candidate.name instanceof AST_SymbolFunarg;
+                var hit = funarg;
+                var abort = false, replaced = 0, can_replace = !args || !hit;
+                if (!can_replace) {
+                    for (var j = compressor.self().argnames.lastIndexOf(candidate.name) + 1; !abort && j < args.length; j++) {
+                        args[j].transform(scanner);
+                    }
+                    can_replace = true;
+                }
+                for (var i = stat_index; !abort && i < statements.length; i++) {
+                    statements[i].transform(scanner);
+                }
+                if (value_def) {
+                    var def = candidate.name.definition();
+                    if (abort && def.references.length - def.replaced > replaced)
+                        replaced = false;
+                    else {
+                        abort = false;
+                        hit_index = 0;
+                        hit = funarg;
+                        for (var i = stat_index; !abort && i < statements.length; i++) {
+                            statements[i].transform(multi_replacer);
+                        }
+                        value_def.single_use = false;
+                    }
+                }
+                if (replaced && !remove_candidate(candidate))
+                    statements.splice(stat_index, 1);
+            }
+        }
+
+        function handle_custom_scan_order(node) {
+            // Skip (non-executed) functions
+            if (node instanceof AST_Scope)
+                return node;
+
+            // Scan case expressions first in a switch statement
+            if (node instanceof AST_Switch) {
+                node.expression = node.expression.transform(scanner);
+                for (var i = 0, len = node.body.length; !abort && i < len; i++) {
+                    var branch = node.body[i];
+                    if (branch instanceof AST_Case) {
+                        if (!hit) {
+                            if (branch !== hit_stack[hit_index])
+                                continue;
+                            hit_index++;
+                        }
+                        branch.expression = branch.expression.transform(scanner);
+                        if (!replace_all)
+                            break;
+                    }
+                }
+                abort = true;
+                return node;
+            }
+        }
+
+        function redefined_within_scope(def, scope) {
+            if (def.global)
+                return false;
+            let cur_scope = def.scope;
+            while (cur_scope && cur_scope !== scope) {
+                if (cur_scope.variables.has(def.name)) {
+                    return true;
+                }
+                cur_scope = cur_scope.parent_scope;
+            }
+            return false;
+        }
+
+        function has_overlapping_symbol(fn, arg, fn_strict) {
+            var found = false, scan_this = !(fn instanceof AST_Arrow);
+            arg.walk(new TreeWalker(function (node, descend) {
+                if (found)
+                    return true;
+                if (node instanceof AST_SymbolRef && (fn.variables.has(node.name) || redefined_within_scope(node.definition(), fn))) {
+                    var s = node.definition().scope;
+                    if (s !== scope)
+                        while (s = s.parent_scope) {
+                            if (s === scope)
+                                return true;
+                        }
+                    return found = true;
+                }
+                if ((fn_strict || scan_this) && node instanceof AST_This) {
+                    return found = true;
+                }
+                if (node instanceof AST_Scope && !(node instanceof AST_Arrow)) {
+                    var prev = scan_this;
+                    scan_this = false;
+                    descend();
+                    scan_this = prev;
+                    return true;
+                }
+            }));
+            return found;
+        }
+
+        function extract_args() {
+            var iife, fn = compressor.self();
+            if (is_func_expr(fn)
+                && !fn.name
+                && !fn.uses_arguments
+                && !fn.pinned()
+                && (iife = compressor.parent()) instanceof AST_Call
+                && iife.expression === fn
+                && iife.args.every((arg) => !(arg instanceof AST_Expansion))) {
+                var fn_strict = compressor.has_directive("use strict");
+                if (fn_strict && !member(fn_strict, fn.body))
+                    fn_strict = false;
+                var len = fn.argnames.length;
+                args = iife.args.slice(len);
+                var names = new Set();
+                for (var i = len; --i >= 0;) {
+                    var sym = fn.argnames[i];
+                    var arg = iife.args[i];
+                    // The following two line fix is a duplicate of the fix at
+                    // https://github.com/terser/terser/commit/011d3eb08cefe6922c7d1bdfa113fc4aeaca1b75
+                    // This might mean that these two pieces of code (one here in collapse_vars and another in reduce_vars
+                    // Might be doing the exact same thing.
+                    const def = sym.definition && sym.definition();
+                    const is_reassigned = def && def.orig.length > 1;
+                    if (is_reassigned)
+                        continue;
+                    args.unshift(make_node(AST_VarDef, sym, {
+                        name: sym,
+                        value: arg
+                    }));
+                    if (names.has(sym.name))
+                        continue;
+                    names.add(sym.name);
+                    if (sym instanceof AST_Expansion) {
+                        var elements = iife.args.slice(i);
+                        if (elements.every((arg) => !has_overlapping_symbol(fn, arg, fn_strict)
+                        )) {
+                            candidates.unshift([make_node(AST_VarDef, sym, {
+                                name: sym.expression,
+                                value: make_node(AST_Array, iife, {
+                                    elements: elements
+                                })
+                            })]);
+                        }
+                    } else {
+                        if (!arg) {
+                            arg = make_node(AST_Undefined, sym).transform(compressor);
+                        } else if (arg instanceof AST_Lambda && arg.pinned()
+                            || has_overlapping_symbol(fn, arg, fn_strict)) {
+                            arg = null;
+                        }
+                        if (arg)
+                            candidates.unshift([make_node(AST_VarDef, sym, {
+                                name: sym,
+                                value: arg
+                            })]);
+                    }
+                }
+            }
+        }
+
+        function extract_candidates(expr) {
+            hit_stack.push(expr);
+            if (expr instanceof AST_Assign) {
+                if (!expr.left.has_side_effects(compressor)
+                    && !(expr.right instanceof AST_Chain)) {
+                    candidates.push(hit_stack.slice());
+                }
+                extract_candidates(expr.right);
+            } else if (expr instanceof AST_Binary) {
+                extract_candidates(expr.left);
+                extract_candidates(expr.right);
+            } else if (expr instanceof AST_Call && !has_annotation(expr, _NOINLINE)) {
+                extract_candidates(expr.expression);
+                expr.args.forEach(extract_candidates);
+            } else if (expr instanceof AST_Case) {
+                extract_candidates(expr.expression);
+            } else if (expr instanceof AST_Conditional) {
+                extract_candidates(expr.condition);
+                extract_candidates(expr.consequent);
+                extract_candidates(expr.alternative);
+            } else if (expr instanceof AST_Definitions) {
+                var len = expr.definitions.length;
+                // limit number of trailing variable definitions for consideration
+                var i = len - 200;
+                if (i < 0)
+                    i = 0;
+                for (; i < len; i++) {
+                    extract_candidates(expr.definitions[i]);
+                }
+            } else if (expr instanceof AST_DWLoop) {
+                extract_candidates(expr.condition);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+            } else if (expr instanceof AST_Exit) {
+                if (expr.value)
+                    extract_candidates(expr.value);
+            } else if (expr instanceof AST_For) {
+                if (expr.init)
+                    extract_candidates(expr.init);
+                if (expr.condition)
+                    extract_candidates(expr.condition);
+                if (expr.step)
+                    extract_candidates(expr.step);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+            } else if (expr instanceof AST_ForIn) {
+                extract_candidates(expr.object);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+            } else if (expr instanceof AST_If) {
+                extract_candidates(expr.condition);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+                if (expr.alternative && !(expr.alternative instanceof AST_Block)) {
+                    extract_candidates(expr.alternative);
+                }
+            } else if (expr instanceof AST_Sequence) {
+                expr.expressions.forEach(extract_candidates);
+            } else if (expr instanceof AST_SimpleStatement) {
+                extract_candidates(expr.body);
+            } else if (expr instanceof AST_Switch) {
+                extract_candidates(expr.expression);
+                expr.body.forEach(extract_candidates);
+            } else if (expr instanceof AST_Unary) {
+                if (expr.operator == "++" || expr.operator == "--") {
+                    candidates.push(hit_stack.slice());
+                }
+            } else if (expr instanceof AST_VarDef) {
+                if (expr.value && !(expr.value instanceof AST_Chain)) {
+                    candidates.push(hit_stack.slice());
+                    extract_candidates(expr.value);
+                }
+            }
+            hit_stack.pop();
+        }
+
+        function find_stop(node, level, write_only) {
+            var parent = scanner.parent(level);
+            if (parent instanceof AST_Assign) {
+                if (write_only
+                    && !parent.logical
+                    && !(parent.left instanceof AST_PropAccess
+                        || lvalues.has(parent.left.name))) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_Binary) {
+                if (write_only && (!lazy_op.has(parent.operator) || parent.left === node)) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_Call)
+                return node;
+            if (parent instanceof AST_Case)
+                return node;
+            if (parent instanceof AST_Conditional) {
+                if (write_only && parent.condition === node) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_Definitions) {
+                return find_stop(parent, level + 1, true);
+            }
+            if (parent instanceof AST_Exit) {
+                return write_only ? find_stop(parent, level + 1, write_only) : node;
+            }
+            if (parent instanceof AST_If) {
+                if (write_only && parent.condition === node) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_IterationStatement)
+                return node;
+            if (parent instanceof AST_Sequence) {
+                return find_stop(parent, level + 1, parent.tail_node() !== node);
+            }
+            if (parent instanceof AST_SimpleStatement) {
+                return find_stop(parent, level + 1, true);
+            }
+            if (parent instanceof AST_Switch)
+                return node;
+            if (parent instanceof AST_VarDef)
+                return node;
+            return null;
+        }
+
+        function mangleable_var(var_def) {
+            var value = var_def.value;
+            if (!(value instanceof AST_SymbolRef))
+                return;
+            if (value.name == "arguments")
+                return;
+            var def = value.definition();
+            if (def.undeclared)
+                return;
+            return value_def = def;
+        }
+
+        function get_lhs(expr) {
+            if (expr instanceof AST_Assign && expr.logical) {
+                return false;
+            } else if (expr instanceof AST_VarDef && expr.name instanceof AST_SymbolDeclaration) {
+                var def = expr.name.definition();
+                if (!member(expr.name, def.orig))
+                    return;
+                var referenced = def.references.length - def.replaced;
+                if (!referenced)
+                    return;
+                var declared = def.orig.length - def.eliminated;
+                if (declared > 1 && !(expr.name instanceof AST_SymbolFunarg)
+                    || (referenced > 1 ? mangleable_var(expr) : !compressor.exposed(def))) {
+                    return make_node(AST_SymbolRef, expr.name, expr.name);
+                }
+            } else {
+                const lhs = expr instanceof AST_Assign
+                    ? expr.left
+                    : expr.expression;
+                return !is_ref_of(lhs, AST_SymbolConst)
+                    && !is_ref_of(lhs, AST_SymbolLet) && lhs;
+            }
+        }
+
+        function get_rvalue(expr) {
+            if (expr instanceof AST_Assign) {
+                return expr.right;
+            } else {
+                return expr.value;
+            }
+        }
+
+        function get_lvalues(expr) {
+            var lvalues = new Map();
+            if (expr instanceof AST_Unary)
+                return lvalues;
+            var tw = new TreeWalker(function (node) {
+                var sym = node;
+                while (sym instanceof AST_PropAccess)
+                    sym = sym.expression;
+                if (sym instanceof AST_SymbolRef) {
+                    const prev = lvalues.get(sym.name);
+                    if (!prev || !prev.modified) {
+                        lvalues.set(sym.name, {
+                            def: sym.definition(),
+                            modified: is_modified(compressor, tw, node, node, 0)
+                        });
+                    }
+                }
+            });
+            get_rvalue(expr).walk(tw);
+            return lvalues;
+        }
+
+        function remove_candidate(expr) {
+            if (expr.name instanceof AST_SymbolFunarg) {
+                var iife = compressor.parent(), argnames = compressor.self().argnames;
+                var index = argnames.indexOf(expr.name);
+                if (index < 0) {
+                    iife.args.length = Math.min(iife.args.length, argnames.length - 1);
+                } else {
+                    var args = iife.args;
+                    if (args[index])
+                        args[index] = make_node(AST_Number, args[index], {
+                            value: 0
+                        });
+                }
+                return true;
+            }
+            var found = false;
+            return statements[stat_index].transform(new TreeTransformer(function (node, descend, in_list) {
+                if (found)
+                    return node;
+                if (node === expr || node.body === expr) {
+                    found = true;
+                    if (node instanceof AST_VarDef) {
+                        node.value = node.name instanceof AST_SymbolConst
+                            ? make_node(AST_Undefined, node.value) // `const` always needs value.
+                            : null;
+                        return node;
+                    }
+                    return in_list ? MAP.skip : null;
+                }
+            }, function (node) {
+                if (node instanceof AST_Sequence)
+                    switch (node.expressions.length) {
+                        case 0: return null;
+                        case 1: return node.expressions[0];
+                    }
+            }));
+        }
+
+        function is_lhs_local(lhs) {
+            while (lhs instanceof AST_PropAccess)
+                lhs = lhs.expression;
+            return lhs instanceof AST_SymbolRef
+                && lhs.definition().scope === scope
+                && !(in_loop
+                    && (lvalues.has(lhs.name)
+                        || candidate instanceof AST_Unary
+                        || (candidate instanceof AST_Assign
+                            && !candidate.logical
+                            && candidate.operator != "=")));
+        }
+
+        function value_has_side_effects(expr) {
+            if (expr instanceof AST_Unary)
+                return unary_side_effects.has(expr.operator);
+            return get_rvalue(expr).has_side_effects(compressor);
+        }
+
+        function replace_all_symbols() {
+            if (side_effects)
+                return false;
+            if (value_def)
+                return true;
+            if (lhs instanceof AST_SymbolRef) {
+                var def = lhs.definition();
+                if (def.references.length - def.replaced == (candidate instanceof AST_VarDef ? 1 : 2)) {
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        function may_modify(sym) {
+            if (!sym.definition)
+                return true; // AST_Destructuring
+            var def = sym.definition();
+            if (def.orig.length == 1 && def.orig[0] instanceof AST_SymbolDefun)
+                return false;
+            if (def.scope.get_defun_scope() !== scope)
+                return true;
+            return !def.references.every((ref) => {
+                var s = ref.scope.get_defun_scope();
+                // "block" scope within AST_Catch
+                if (s.TYPE == "Scope")
+                    s = s.parent_scope;
+                return s === scope;
+            });
+        }
+
+        function side_effects_external(node, lhs) {
+            if (node instanceof AST_Assign)
+                return side_effects_external(node.left, true);
+            if (node instanceof AST_Unary)
+                return side_effects_external(node.expression, true);
+            if (node instanceof AST_VarDef)
+                return node.value && side_effects_external(node.value);
+            if (lhs) {
+                if (node instanceof AST_Dot)
+                    return side_effects_external(node.expression, true);
+                if (node instanceof AST_Sub)
+                    return side_effects_external(node.expression, true);
+                if (node instanceof AST_SymbolRef)
+                    return node.definition().scope !== scope;
+            }
+            return false;
+        }
+
+        function shadows(newScope, lvalues) {
+            for (const {def} of lvalues.values()) {
+                let current = newScope;
+                while (current && current !== def.scope) {
+                    let nested_def = current.variables.get(def.name);
+                    if (nested_def && nested_def !== def) return true;
+                    current = current.parent_scope;
+                }
+            }
+            return false;
+        }
+    }
+
+    function eliminate_spurious_blocks(statements) {
+        var seen_dirs = [];
+        for (var i = 0; i < statements.length;) {
+            var stat = statements[i];
+            if (stat instanceof AST_BlockStatement && stat.body.every(can_be_evicted_from_block)) {
+                CHANGED = true;
+                eliminate_spurious_blocks(stat.body);
+                statements.splice(i, 1, ...stat.body);
+                i += stat.body.length;
+            } else if (stat instanceof AST_EmptyStatement) {
+                CHANGED = true;
+                statements.splice(i, 1);
+            } else if (stat instanceof AST_Directive) {
+                if (seen_dirs.indexOf(stat.value) < 0) {
+                    i++;
+                    seen_dirs.push(stat.value);
+                } else {
+                    CHANGED = true;
+                    statements.splice(i, 1);
+                }
+            } else
+                i++;
+        }
+    }
+
+    function handle_if_return(statements, compressor) {
+        var self = compressor.self();
+        var multiple_if_returns = has_multiple_if_returns(statements);
+        var in_lambda = self instanceof AST_Lambda;
+        for (var i = statements.length; --i >= 0;) {
+            var stat = statements[i];
+            var j = next_index(i);
+            var next = statements[j];
+
+            if (in_lambda && !next && stat instanceof AST_Return) {
+                if (!stat.value) {
+                    CHANGED = true;
+                    statements.splice(i, 1);
+                    continue;
+                }
+                if (stat.value instanceof AST_UnaryPrefix && stat.value.operator == "void") {
+                    CHANGED = true;
+                    statements[i] = make_node(AST_SimpleStatement, stat, {
+                        body: stat.value.expression
+                    });
+                    continue;
+                }
+            }
+
+            if (stat instanceof AST_If) {
+                var ab = aborts(stat.body);
+                if (can_merge_flow(ab)) {
+                    if (ab.label) {
+                        remove(ab.label.thedef.references, ab);
+                    }
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.condition = stat.condition.negate(compressor);
+                    var body = as_statement_array_with_return(stat.body, ab);
+                    stat.body = make_node(AST_BlockStatement, stat, {
+                        body: as_statement_array(stat.alternative).concat(extract_functions())
+                    });
+                    stat.alternative = make_node(AST_BlockStatement, stat, {
+                        body: body
+                    });
+                    statements[i] = stat.transform(compressor);
+                    continue;
+                }
+
+                var ab = aborts(stat.alternative);
+                if (can_merge_flow(ab)) {
+                    if (ab.label) {
+                        remove(ab.label.thedef.references, ab);
+                    }
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.body = make_node(AST_BlockStatement, stat.body, {
+                        body: as_statement_array(stat.body).concat(extract_functions())
+                    });
+                    var body = as_statement_array_with_return(stat.alternative, ab);
+                    stat.alternative = make_node(AST_BlockStatement, stat.alternative, {
+                        body: body
+                    });
+                    statements[i] = stat.transform(compressor);
+                    continue;
+                }
+            }
+
+            if (stat instanceof AST_If && stat.body instanceof AST_Return) {
+                var value = stat.body.value;
+                //---
+                // pretty silly case, but:
+                // if (foo()) return; return; ==> foo(); return;
+                if (!value && !stat.alternative
+                    && (in_lambda && !next || next instanceof AST_Return && !next.value)) {
+                    CHANGED = true;
+                    statements[i] = make_node(AST_SimpleStatement, stat.condition, {
+                        body: stat.condition
+                    });
+                    continue;
+                }
+                //---
+                // if (foo()) return x; return y; ==> return foo() ? x : y;
+                if (value && !stat.alternative && next instanceof AST_Return && next.value) {
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.alternative = next;
+                    statements[i] = stat.transform(compressor);
+                    statements.splice(j, 1);
+                    continue;
+                }
+                //---
+                // if (foo()) return x; [ return ; ] ==> return foo() ? x : undefined;
+                if (value && !stat.alternative
+                    && (!next && in_lambda && multiple_if_returns
+                        || next instanceof AST_Return)) {
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.alternative = next || make_node(AST_Return, stat, {
+                        value: null
+                    });
+                    statements[i] = stat.transform(compressor);
+                    if (next)
+                        statements.splice(j, 1);
+                    continue;
+                }
+                //---
+                // if (a) return b; if (c) return d; e; ==> return a ? b : c ? d : void e;
+                //
+                // if sequences is not enabled, this can lead to an endless loop (issue #866).
+                // however, with sequences on this helps producing slightly better output for
+                // the example code.
+                var prev = statements[prev_index(i)];
+                if (compressor.option("sequences") && in_lambda && !stat.alternative
+                    && prev instanceof AST_If && prev.body instanceof AST_Return
+                    && next_index(j) == statements.length && next instanceof AST_SimpleStatement) {
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.alternative = make_node(AST_BlockStatement, next, {
+                        body: [
+                            next,
+                            make_node(AST_Return, next, {
+                                value: null
+                            })
+                        ]
+                    });
+                    statements[i] = stat.transform(compressor);
+                    statements.splice(j, 1);
+                    continue;
+                }
+            }
+        }
+
+        function has_multiple_if_returns(statements) {
+            var n = 0;
+            for (var i = statements.length; --i >= 0;) {
+                var stat = statements[i];
+                if (stat instanceof AST_If && stat.body instanceof AST_Return) {
+                    if (++n > 1)
+                        return true;
+                }
+            }
+            return false;
+        }
+
+        function is_return_void(value) {
+            return !value || value instanceof AST_UnaryPrefix && value.operator == "void";
+        }
+
+        function can_merge_flow(ab) {
+            if (!ab)
+                return false;
+            for (var j = i + 1, len = statements.length; j < len; j++) {
+                var stat = statements[j];
+                if (stat instanceof AST_Const || stat instanceof AST_Let)
+                    return false;
+            }
+            var lct = ab instanceof AST_LoopControl ? compressor.loopcontrol_target(ab) : null;
+            return ab instanceof AST_Return && in_lambda && is_return_void(ab.value)
+                || ab instanceof AST_Continue && self === loop_body(lct)
+                || ab instanceof AST_Break && lct instanceof AST_BlockStatement && self === lct;
+        }
+
+        function extract_functions() {
+            var tail = statements.slice(i + 1);
+            statements.length = i + 1;
+            return tail.filter(function (stat) {
+                if (stat instanceof AST_Defun) {
+                    statements.push(stat);
+                    return false;
+                }
+                return true;
+            });
+        }
+
+        function as_statement_array_with_return(node, ab) {
+            var body = as_statement_array(node).slice(0, -1);
+            if (ab.value) {
+                body.push(make_node(AST_SimpleStatement, ab.value, {
+                    body: ab.value.expression
+                }));
+            }
+            return body;
+        }
+
+        function next_index(i) {
+            for (var j = i + 1, len = statements.length; j < len; j++) {
+                var stat = statements[j];
+                if (!(stat instanceof AST_Var && declarations_only(stat))) {
+                    break;
+                }
+            }
+            return j;
+        }
+
+        function prev_index(i) {
+            for (var j = i; --j >= 0;) {
+                var stat = statements[j];
+                if (!(stat instanceof AST_Var && declarations_only(stat))) {
+                    break;
+                }
+            }
+            return j;
+        }
+    }
+
+    function eliminate_dead_code(statements, compressor) {
+        var has_quit;
+        var self = compressor.self();
+        for (var i = 0, n = 0, len = statements.length; i < len; i++) {
+            var stat = statements[i];
+            if (stat instanceof AST_LoopControl) {
+                var lct = compressor.loopcontrol_target(stat);
+                if (stat instanceof AST_Break
+                    && !(lct instanceof AST_IterationStatement)
+                    && loop_body(lct) === self
+                    || stat instanceof AST_Continue
+                    && loop_body(lct) === self) {
+                    if (stat.label) {
+                        remove(stat.label.thedef.references, stat);
+                    }
+                } else {
+                    statements[n++] = stat;
+                }
+            } else {
+                statements[n++] = stat;
+            }
+            if (aborts(stat)) {
+                has_quit = statements.slice(i + 1);
+                break;
+            }
+        }
+        statements.length = n;
+        CHANGED = n != len;
+        if (has_quit)
+            has_quit.forEach(function (stat) {
+                trim_unreachable_code(compressor, stat, statements);
+            });
+    }
+
+    function declarations_only(node) {
+        return node.definitions.every((var_def) => !var_def.value
+        );
+    }
+
+    function sequencesize(statements, compressor) {
+        if (statements.length < 2)
+            return;
+        var seq = [], n = 0;
+        function push_seq() {
+            if (!seq.length)
+                return;
+            var body = make_sequence(seq[0], seq);
+            statements[n++] = make_node(AST_SimpleStatement, body, { body: body });
+            seq = [];
+        }
+        for (var i = 0, len = statements.length; i < len; i++) {
+            var stat = statements[i];
+            if (stat instanceof AST_SimpleStatement) {
+                if (seq.length >= compressor.sequences_limit)
+                    push_seq();
+                var body = stat.body;
+                if (seq.length > 0)
+                    body = body.drop_side_effect_free(compressor);
+                if (body)
+                    merge_sequence(seq, body);
+            } else if (stat instanceof AST_Definitions && declarations_only(stat)
+                || stat instanceof AST_Defun) {
+                statements[n++] = stat;
+            } else {
+                push_seq();
+                statements[n++] = stat;
+            }
+        }
+        push_seq();
+        statements.length = n;
+        if (n != len)
+            CHANGED = true;
+    }
+
+    function to_simple_statement(block, decls) {
+        if (!(block instanceof AST_BlockStatement))
+            return block;
+        var stat = null;
+        for (var i = 0, len = block.body.length; i < len; i++) {
+            var line = block.body[i];
+            if (line instanceof AST_Var && declarations_only(line)) {
+                decls.push(line);
+            } else if (stat) {
+                return false;
+            } else {
+                stat = line;
+            }
+        }
+        return stat;
+    }
+
+    function sequencesize_2(statements, compressor) {
+        function cons_seq(right) {
+            n--;
+            CHANGED = true;
+            var left = prev.body;
+            return make_sequence(left, [left, right]).transform(compressor);
+        }
+        var n = 0, prev;
+        for (var i = 0; i < statements.length; i++) {
+            var stat = statements[i];
+            if (prev) {
+                if (stat instanceof AST_Exit) {
+                    stat.value = cons_seq(stat.value || make_node(AST_Undefined, stat).transform(compressor));
+                } else if (stat instanceof AST_For) {
+                    if (!(stat.init instanceof AST_Definitions)) {
+                        const abort = walk(prev.body, node => {
+                            if (node instanceof AST_Scope)
+                                return true;
+                            if (node instanceof AST_Binary
+                                && node.operator === "in") {
+                                return walk_abort;
+                            }
+                        });
+                        if (!abort) {
+                            if (stat.init)
+                                stat.init = cons_seq(stat.init);
+                            else {
+                                stat.init = prev.body;
+                                n--;
+                                CHANGED = true;
+                            }
+                        }
+                    }
+                } else if (stat instanceof AST_ForIn) {
+                    if (!(stat.init instanceof AST_Const) && !(stat.init instanceof AST_Let)) {
+                        stat.object = cons_seq(stat.object);
+                    }
+                } else if (stat instanceof AST_If) {
+                    stat.condition = cons_seq(stat.condition);
+                } else if (stat instanceof AST_Switch) {
+                    stat.expression = cons_seq(stat.expression);
+                } else if (stat instanceof AST_With) {
+                    stat.expression = cons_seq(stat.expression);
+                }
+            }
+            if (compressor.option("conditionals") && stat instanceof AST_If) {
+                var decls = [];
+                var body = to_simple_statement(stat.body, decls);
+                var alt = to_simple_statement(stat.alternative, decls);
+                if (body !== false && alt !== false && decls.length > 0) {
+                    var len = decls.length;
+                    decls.push(make_node(AST_If, stat, {
+                        condition: stat.condition,
+                        body: body || make_node(AST_EmptyStatement, stat.body),
+                        alternative: alt
+                    }));
+                    decls.unshift(n, 1);
+                    [].splice.apply(statements, decls);
+                    i += len;
+                    n += len + 1;
+                    prev = null;
+                    CHANGED = true;
+                    continue;
+                }
+            }
+            statements[n++] = stat;
+            prev = stat instanceof AST_SimpleStatement ? stat : null;
+        }
+        statements.length = n;
+    }
+
+    function join_object_assignments(defn, body) {
+        if (!(defn instanceof AST_Definitions))
+            return;
+        var def = defn.definitions[defn.definitions.length - 1];
+        if (!(def.value instanceof AST_Object))
+            return;
+        var exprs;
+        if (body instanceof AST_Assign && !body.logical) {
+            exprs = [body];
+        } else if (body instanceof AST_Sequence) {
+            exprs = body.expressions.slice();
+        }
+        if (!exprs)
+            return;
+        var trimmed = false;
+        do {
+            var node = exprs[0];
+            if (!(node instanceof AST_Assign))
+                break;
+            if (node.operator != "=")
+                break;
+            if (!(node.left instanceof AST_PropAccess))
+                break;
+            var sym = node.left.expression;
+            if (!(sym instanceof AST_SymbolRef))
+                break;
+            if (def.name.name != sym.name)
+                break;
+            if (!node.right.is_constant_expression(scope))
+                break;
+            var prop = node.left.property;
+            if (prop instanceof AST_Node) {
+                prop = prop.evaluate(compressor);
+            }
+            if (prop instanceof AST_Node)
+                break;
+            prop = "" + prop;
+            var diff = compressor.option("ecma") < 2015
+                && compressor.has_directive("use strict") ? function (node) {
+                    return node.key != prop && (node.key && node.key.name != prop);
+                } : function (node) {
+                    return node.key && node.key.name != prop;
+                };
+            if (!def.value.properties.every(diff))
+                break;
+            var p = def.value.properties.filter(function (p) { return p.key === prop; })[0];
+            if (!p) {
+                def.value.properties.push(make_node(AST_ObjectKeyVal, node, {
+                    key: prop,
+                    value: node.right
+                }));
+            } else {
+                p.value = new AST_Sequence({
+                    start: p.start,
+                    expressions: [p.value.clone(), node.right.clone()],
+                    end: p.end
+                });
+            }
+            exprs.shift();
+            trimmed = true;
+        } while (exprs.length);
+        return trimmed && exprs;
+    }
+
+    function join_consecutive_vars(statements) {
+        var defs;
+        for (var i = 0, j = -1, len = statements.length; i < len; i++) {
+            var stat = statements[i];
+            var prev = statements[j];
+            if (stat instanceof AST_Definitions) {
+                if (prev && prev.TYPE == stat.TYPE) {
+                    prev.definitions = prev.definitions.concat(stat.definitions);
+                    CHANGED = true;
+                } else if (defs && defs.TYPE == stat.TYPE && declarations_only(stat)) {
+                    defs.definitions = defs.definitions.concat(stat.definitions);
+                    CHANGED = true;
+                } else {
+                    statements[++j] = stat;
+                    defs = stat;
+                }
+            } else if (stat instanceof AST_Exit) {
+                stat.value = extract_object_assignments(stat.value);
+            } else if (stat instanceof AST_For) {
+                var exprs = join_object_assignments(prev, stat.init);
+                if (exprs) {
+                    CHANGED = true;
+                    stat.init = exprs.length ? make_sequence(stat.init, exprs) : null;
+                    statements[++j] = stat;
+                } else if (prev instanceof AST_Var && (!stat.init || stat.init.TYPE == prev.TYPE)) {
+                    if (stat.init) {
+                        prev.definitions = prev.definitions.concat(stat.init.definitions);
+                    }
+                    stat.init = prev;
+                    statements[j] = stat;
+                    CHANGED = true;
+                } else if (defs && stat.init && defs.TYPE == stat.init.TYPE && declarations_only(stat.init)) {
+                    defs.definitions = defs.definitions.concat(stat.init.definitions);
+                    stat.init = null;
+                    statements[++j] = stat;
+                    CHANGED = true;
+                } else {
+                    statements[++j] = stat;
+                }
+            } else if (stat instanceof AST_ForIn) {
+                stat.object = extract_object_assignments(stat.object);
+            } else if (stat instanceof AST_If) {
+                stat.condition = extract_object_assignments(stat.condition);
+            } else if (stat instanceof AST_SimpleStatement) {
+                var exprs = join_object_assignments(prev, stat.body);
+                if (exprs) {
+                    CHANGED = true;
+                    if (!exprs.length)
+                        continue;
+                    stat.body = make_sequence(stat.body, exprs);
+                }
+                statements[++j] = stat;
+            } else if (stat instanceof AST_Switch) {
+                stat.expression = extract_object_assignments(stat.expression);
+            } else if (stat instanceof AST_With) {
+                stat.expression = extract_object_assignments(stat.expression);
+            } else {
+                statements[++j] = stat;
+            }
+        }
+        statements.length = j + 1;
+
+        function extract_object_assignments(value) {
+            statements[++j] = stat;
+            var exprs = join_object_assignments(prev, value);
+            if (exprs) {
+                CHANGED = true;
+                if (exprs.length) {
+                    return make_sequence(value, exprs);
+                } else if (value instanceof AST_Sequence) {
+                    return value.tail_node().left;
+                } else {
+                    return value.left;
+                }
+            }
+            return value;
+        }
+    }
+}
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+class Compressor extends TreeWalker {
+    constructor(options, { false_by_default = false, mangle_options = false }) {
+        super();
+        if (options.defaults !== undefined && !options.defaults) false_by_default = true;
+        this.options = defaults(options, {
+            arguments     : false,
+            arrows        : !false_by_default,
+            booleans      : !false_by_default,
+            booleans_as_integers : false,
+            collapse_vars : !false_by_default,
+            comparisons   : !false_by_default,
+            computed_props: !false_by_default,
+            conditionals  : !false_by_default,
+            dead_code     : !false_by_default,
+            defaults      : true,
+            directives    : !false_by_default,
+            drop_console  : false,
+            drop_debugger : !false_by_default,
+            ecma          : 5,
+            evaluate      : !false_by_default,
+            expression    : false,
+            global_defs   : false,
+            hoist_funs    : false,
+            hoist_props   : !false_by_default,
+            hoist_vars    : false,
+            ie8           : false,
+            if_return     : !false_by_default,
+            inline        : !false_by_default,
+            join_vars     : !false_by_default,
+            keep_classnames: false,
+            keep_fargs    : true,
+            keep_fnames   : false,
+            keep_infinity : false,
+            loops         : !false_by_default,
+            module        : false,
+            negate_iife   : !false_by_default,
+            passes        : 1,
+            properties    : !false_by_default,
+            pure_getters  : !false_by_default && "strict",
+            pure_funcs    : null,
+            reduce_funcs  : !false_by_default,
+            reduce_vars   : !false_by_default,
+            sequences     : !false_by_default,
+            side_effects  : !false_by_default,
+            switches      : !false_by_default,
+            top_retain    : null,
+            toplevel      : !!(options && options["top_retain"]),
+            typeofs       : !false_by_default,
+            unsafe        : false,
+            unsafe_arrows : false,
+            unsafe_comps  : false,
+            unsafe_Function: false,
+            unsafe_math   : false,
+            unsafe_symbols: false,
+            unsafe_methods: false,
+            unsafe_proto  : false,
+            unsafe_regexp : false,
+            unsafe_undefined: false,
+            unused        : !false_by_default,
+            warnings      : false  // legacy
+        }, true);
+        var global_defs = this.options["global_defs"];
+        if (typeof global_defs == "object") for (var key in global_defs) {
+            if (key[0] === "@" && HOP(global_defs, key)) {
+                global_defs[key.slice(1)] = parse(global_defs[key], {
+                    expression: true
+                });
+            }
+        }
+        if (this.options["inline"] === true) this.options["inline"] = 3;
+        var pure_funcs = this.options["pure_funcs"];
+        if (typeof pure_funcs == "function") {
+            this.pure_funcs = pure_funcs;
+        } else {
+            this.pure_funcs = pure_funcs ? function(node) {
+                return !pure_funcs.includes(node.expression.print_to_string());
+            } : return_true;
+        }
+        var top_retain = this.options["top_retain"];
+        if (top_retain instanceof RegExp) {
+            this.top_retain = function(def) {
+                return top_retain.test(def.name);
+            };
+        } else if (typeof top_retain == "function") {
+            this.top_retain = top_retain;
+        } else if (top_retain) {
+            if (typeof top_retain == "string") {
+                top_retain = top_retain.split(/,/);
+            }
+            this.top_retain = function(def) {
+                return top_retain.includes(def.name);
+            };
+        }
+        if (this.options["module"]) {
+            this.directives["use strict"] = true;
+            this.options["toplevel"] = true;
+        }
+        var toplevel = this.options["toplevel"];
+        this.toplevel = typeof toplevel == "string" ? {
+            funcs: /funcs/.test(toplevel),
+            vars: /vars/.test(toplevel)
+        } : {
+            funcs: toplevel,
+            vars: toplevel
+        };
+        var sequences = this.options["sequences"];
+        this.sequences_limit = sequences == 1 ? 800 : sequences | 0;
+        this.evaluated_regexps = new Map();
+        this._toplevel = undefined;
+        this.mangle_options = mangle_options;
+    }
+
+    option(key) {
+        return this.options[key];
+    }
+
+    exposed(def) {
+        if (def.export) return true;
+        if (def.global) for (var i = 0, len = def.orig.length; i < len; i++)
+            if (!this.toplevel[def.orig[i] instanceof AST_SymbolDefun ? "funcs" : "vars"])
+                return true;
+        return false;
+    }
+
+    in_boolean_context() {
+        if (!this.option("booleans")) return false;
+        var self = this.self();
+        for (var i = 0, p; p = this.parent(i); i++) {
+            if (p instanceof AST_SimpleStatement
+                || p instanceof AST_Conditional && p.condition === self
+                || p instanceof AST_DWLoop && p.condition === self
+                || p instanceof AST_For && p.condition === self
+                || p instanceof AST_If && p.condition === self
+                || p instanceof AST_UnaryPrefix && p.operator == "!" && p.expression === self) {
+                return true;
+            }
+            if (
+                p instanceof AST_Binary
+                    && (
+                        p.operator == "&&"
+                        || p.operator == "||"
+                        || p.operator == "??"
+                    )
+                || p instanceof AST_Conditional
+                || p.tail_node() === self
+            ) {
+                self = p;
+            } else {
+                return false;
+            }
+        }
+    }
+
+    get_toplevel() {
+        return this._toplevel;
+    }
+
+    compress(toplevel) {
+        toplevel = toplevel.resolve_defines(this);
+        this._toplevel = toplevel;
+        if (this.option("expression")) {
+            this._toplevel.process_expression(true);
+        }
+        var passes = +this.options.passes || 1;
+        var min_count = 1 / 0;
+        var stopping = false;
+        var nth_identifier = this.mangle_options && this.mangle_options.nth_identifier || base54;
+        var mangle = { ie8: this.option("ie8"), nth_identifier: nth_identifier };
+        for (var pass = 0; pass < passes; pass++) {
+            this._toplevel.figure_out_scope(mangle);
+            if (pass === 0 && this.option("drop_console")) {
+                // must be run before reduce_vars and compress pass
+                this._toplevel = this._toplevel.drop_console();
+            }
+            if (pass > 0 || this.option("reduce_vars")) {
+                this._toplevel.reset_opt_flags(this);
+            }
+            this._toplevel = this._toplevel.transform(this);
+            if (passes > 1) {
+                let count = 0;
+                walk(this._toplevel, () => { count++; });
+                if (count < min_count) {
+                    min_count = count;
+                    stopping = false;
+                } else if (stopping) {
+                    break;
+                } else {
+                    stopping = true;
+                }
+            }
+        }
+        if (this.option("expression")) {
+            this._toplevel.process_expression(false);
+        }
+        toplevel = this._toplevel;
+        this._toplevel = undefined;
+        return toplevel;
+    }
+
+    before(node, descend) {
+        if (has_flag(node, SQUEEZED)) return node;
+        var was_scope = false;
+        if (node instanceof AST_Scope) {
+            node = node.hoist_properties(this);
+            node = node.hoist_declarations(this);
+            was_scope = true;
+        }
+        // Before https://github.com/mishoo/UglifyJS2/pull/1602 AST_Node.optimize()
+        // would call AST_Node.transform() if a different instance of AST_Node is
+        // produced after def_optimize().
+        // This corrupts TreeWalker.stack, which cause AST look-ups to malfunction.
+        // Migrate and defer all children's AST_Node.transform() to below, which
+        // will now happen after this parent AST_Node has been properly substituted
+        // thus gives a consistent AST snapshot.
+        descend(node, this);
+        // Existing code relies on how AST_Node.optimize() worked, and omitting the
+        // following replacement call would result in degraded efficiency of both
+        // output and performance.
+        descend(node, this);
+        var opt = node.optimize(this);
+        if (was_scope && opt instanceof AST_Scope) {
+            opt.drop_unused(this);
+            descend(opt, this);
+        }
+        if (opt === node) set_flag(opt, SQUEEZED);
+        return opt;
+    }
+}
+
+function def_optimize(node, optimizer) {
+    node.DEFMETHOD("optimize", function(compressor) {
+        var self = this;
+        if (has_flag(self, OPTIMIZED)) return self;
+        if (compressor.has_directive("use asm")) return self;
+        var opt = optimizer(self, compressor);
+        set_flag(opt, OPTIMIZED);
+        return opt;
+    });
+}
+
+def_optimize(AST_Node, function(self) {
+    return self;
+});
+
+AST_Toplevel.DEFMETHOD("drop_console", function() {
+    return this.transform(new TreeTransformer(function(self) {
+        if (self.TYPE == "Call") {
+            var exp = self.expression;
+            if (exp instanceof AST_PropAccess) {
+                var name = exp.expression;
+                while (name.expression) {
+                    name = name.expression;
+                }
+                if (is_undeclared_ref(name) && name.name == "console") {
+                    return make_node(AST_Undefined, self);
+                }
+            }
+        }
+    }));
+});
+
+AST_Node.DEFMETHOD("equivalent_to", function(node) {
+    return equivalent_to(this, node);
+});
+
+AST_Scope.DEFMETHOD("process_expression", function(insert, compressor) {
+    var self = this;
+    var tt = new TreeTransformer(function(node) {
+        if (insert && node instanceof AST_SimpleStatement) {
+            return make_node(AST_Return, node, {
+                value: node.body
+            });
+        }
+        if (!insert && node instanceof AST_Return) {
+            if (compressor) {
+                var value = node.value && node.value.drop_side_effect_free(compressor, true);
+                return value
+                    ? make_node(AST_SimpleStatement, node, { body: value })
+                    : make_node(AST_EmptyStatement, node);
+            }
+            return make_node(AST_SimpleStatement, node, {
+                body: node.value || make_node(AST_UnaryPrefix, node, {
+                    operator: "void",
+                    expression: make_node(AST_Number, node, {
+                        value: 0
+                    })
+                })
+            });
+        }
+        if (node instanceof AST_Class || node instanceof AST_Lambda && node !== self) {
+            return node;
+        }
+        if (node instanceof AST_Block) {
+            var index = node.body.length - 1;
+            if (index >= 0) {
+                node.body[index] = node.body[index].transform(tt);
+            }
+        } else if (node instanceof AST_If) {
+            node.body = node.body.transform(tt);
+            if (node.alternative) {
+                node.alternative = node.alternative.transform(tt);
+            }
+        } else if (node instanceof AST_With) {
+            node.body = node.body.transform(tt);
+        }
+        return node;
+    });
+    self.transform(tt);
+});
+
+AST_Toplevel.DEFMETHOD("reset_opt_flags", function(compressor) {
+    const self = this;
+    const reduce_vars = compressor.option("reduce_vars");
+
+    const preparation = new TreeWalker(function(node, descend) {
+        clear_flag(node, CLEAR_BETWEEN_PASSES);
+        if (reduce_vars) {
+            if (compressor.top_retain
+                && node instanceof AST_Defun  // Only functions are retained
+                && preparation.parent() === self
+            ) {
+                set_flag(node, TOP);
+            }
+            return node.reduce_vars(preparation, descend, compressor);
+        }
+    });
+    // Stack of look-up tables to keep track of whether a `SymbolDef` has been
+    // properly assigned before use:
+    // - `push()` & `pop()` when visiting conditional branches
+    preparation.safe_ids = Object.create(null);
+    preparation.in_loop = null;
+    preparation.loop_ids = new Map();
+    preparation.defs_to_safe_ids = new Map();
+    self.walk(preparation);
+});
+
+AST_Symbol.DEFMETHOD("fixed_value", function() {
+    var fixed = this.thedef.fixed;
+    if (!fixed || fixed instanceof AST_Node) return fixed;
+    return fixed();
+});
+
+AST_SymbolRef.DEFMETHOD("is_immutable", function() {
+    var orig = this.definition().orig;
+    return orig.length == 1 && orig[0] instanceof AST_SymbolLambda;
+});
+
+function find_scope(tw) {
+    for (let i = 0;;i++) {
+        const p = tw.parent(i);
+        if (p instanceof AST_Toplevel) return p;
+        if (p instanceof AST_Lambda) return p;
+        if (p.block_scope) return p.block_scope;
+    }
+}
+
+function find_variable(compressor, name) {
+    var scope, i = 0;
+    while (scope = compressor.parent(i++)) {
+        if (scope instanceof AST_Scope) break;
+        if (scope instanceof AST_Catch && scope.argname) {
+            scope = scope.argname.definition().scope;
+            break;
+        }
+    }
+    return scope.find_variable(name);
+}
+
+function is_empty(thing) {
+    if (thing === null) return true;
+    if (thing instanceof AST_EmptyStatement) return true;
+    if (thing instanceof AST_BlockStatement) return thing.body.length == 0;
+    return false;
+}
+
+var global_names = makePredicate("Array Boolean clearInterval clearTimeout console Date decodeURI decodeURIComponent encodeURI encodeURIComponent Error escape eval EvalError Function isFinite isNaN JSON Math Number parseFloat parseInt RangeError ReferenceError RegExp Object setInterval setTimeout String SyntaxError TypeError unescape URIError");
+AST_SymbolRef.DEFMETHOD("is_declared", function(compressor) {
+    return !this.definition().undeclared
+        || compressor.option("unsafe") && global_names.has(this.name);
+});
+
+/* -----[ optimizers ]----- */
+
+var directives = new Set(["use asm", "use strict"]);
+def_optimize(AST_Directive, function(self, compressor) {
+    if (compressor.option("directives")
+        && (!directives.has(self.value) || compressor.has_directive(self.value) !== self)) {
+        return make_node(AST_EmptyStatement, self);
+    }
+    return self;
+});
+
+def_optimize(AST_Debugger, function(self, compressor) {
+    if (compressor.option("drop_debugger"))
+        return make_node(AST_EmptyStatement, self);
+    return self;
+});
+
+def_optimize(AST_LabeledStatement, function(self, compressor) {
+    if (self.body instanceof AST_Break
+        && compressor.loopcontrol_target(self.body) === self.body) {
+        return make_node(AST_EmptyStatement, self);
+    }
+    return self.label.references.length == 0 ? self.body : self;
+});
+
+def_optimize(AST_Block, function(self, compressor) {
+    tighten_body(self.body, compressor);
+    return self;
+});
+
+function can_be_extracted_from_if_block(node) {
+    return !(
+        node instanceof AST_Const
+        || node instanceof AST_Let
+        || node instanceof AST_Class
+    );
+}
+
+def_optimize(AST_BlockStatement, function(self, compressor) {
+    tighten_body(self.body, compressor);
+    switch (self.body.length) {
+      case 1:
+        if (!compressor.has_directive("use strict")
+            && compressor.parent() instanceof AST_If
+            && can_be_extracted_from_if_block(self.body[0])
+            || can_be_evicted_from_block(self.body[0])) {
+            return self.body[0];
+        }
+        break;
+      case 0: return make_node(AST_EmptyStatement, self);
+    }
+    return self;
+});
+
+function opt_AST_Lambda(self, compressor) {
+    tighten_body(self.body, compressor);
+    if (compressor.option("side_effects")
+        && self.body.length == 1
+        && self.body[0] === compressor.has_directive("use strict")) {
+        self.body.length = 0;
+    }
+    return self;
+}
+def_optimize(AST_Lambda, opt_AST_Lambda);
+
+const r_keep_assign = /keep_assign/;
+AST_Scope.DEFMETHOD("drop_unused", function(compressor) {
+    if (!compressor.option("unused")) return;
+    if (compressor.has_directive("use asm")) return;
+    var self = this;
+    if (self.pinned()) return;
+    var drop_funcs = !(self instanceof AST_Toplevel) || compressor.toplevel.funcs;
+    var drop_vars = !(self instanceof AST_Toplevel) || compressor.toplevel.vars;
+    const assign_as_unused = r_keep_assign.test(compressor.option("unused")) ? return_false : function(node) {
+        if (node instanceof AST_Assign
+            && !node.logical
+            && (has_flag(node, WRITE_ONLY) || node.operator == "=")
+        ) {
+            return node.left;
+        }
+        if (node instanceof AST_Unary && has_flag(node, WRITE_ONLY)) {
+            return node.expression;
+        }
+    };
+    var in_use_ids = new Map();
+    var fixed_ids = new Map();
+    if (self instanceof AST_Toplevel && compressor.top_retain) {
+        self.variables.forEach(function(def) {
+            if (compressor.top_retain(def) && !in_use_ids.has(def.id)) {
+                in_use_ids.set(def.id, def);
+            }
+        });
+    }
+    var var_defs_by_id = new Map();
+    var initializations = new Map();
+    // pass 1: find out which symbols are directly used in
+    // this scope (not in nested scopes).
+    var scope = this;
+    var tw = new TreeWalker(function(node, descend) {
+        if (node instanceof AST_Lambda && node.uses_arguments && !tw.has_directive("use strict")) {
+            node.argnames.forEach(function(argname) {
+                if (!(argname instanceof AST_SymbolDeclaration)) return;
+                var def = argname.definition();
+                if (!in_use_ids.has(def.id)) {
+                    in_use_ids.set(def.id, def);
+                }
+            });
+        }
+        if (node === self) return;
+        if (node instanceof AST_Defun || node instanceof AST_DefClass) {
+            var node_def = node.name.definition();
+            const in_export = tw.parent() instanceof AST_Export;
+            if (in_export || !drop_funcs && scope === self) {
+                if (node_def.global && !in_use_ids.has(node_def.id)) {
+                    in_use_ids.set(node_def.id, node_def);
+                }
+            }
+            if (node instanceof AST_DefClass) {
+                if (
+                    node.extends
+                    && (node.extends.has_side_effects(compressor)
+                    || node.extends.may_throw(compressor))
+                ) {
+                    node.extends.walk(tw);
+                }
+                for (const prop of node.properties) {
+                    if (
+                        prop.has_side_effects(compressor) ||
+                        prop.may_throw(compressor)
+                    ) {
+                        prop.walk(tw);
+                    }
+                }
+            }
+            map_add(initializations, node_def.id, node);
+            return true; // don't go in nested scopes
+        }
+        if (node instanceof AST_SymbolFunarg && scope === self) {
+            map_add(var_defs_by_id, node.definition().id, node);
+        }
+        if (node instanceof AST_Definitions && scope === self) {
+            const in_export = tw.parent() instanceof AST_Export;
+            node.definitions.forEach(function(def) {
+                if (def.name instanceof AST_SymbolVar) {
+                    map_add(var_defs_by_id, def.name.definition().id, def);
+                }
+                if (in_export || !drop_vars) {
+                    walk(def.name, node => {
+                        if (node instanceof AST_SymbolDeclaration) {
+                            const def = node.definition();
+                            if (
+                                (in_export || def.global)
+                                && !in_use_ids.has(def.id)
+                            ) {
+                                in_use_ids.set(def.id, def);
+                            }
+                        }
+                    });
+                }
+                if (def.value) {
+                    if (def.name instanceof AST_Destructuring) {
+                        def.walk(tw);
+                    } else {
+                        var node_def = def.name.definition();
+                        map_add(initializations, node_def.id, def.value);
+                        if (!node_def.chained && def.name.fixed_value() === def.value) {
+                            fixed_ids.set(node_def.id, def);
+                        }
+                    }
+                    if (def.value.has_side_effects(compressor)) {
+                        def.value.walk(tw);
+                    }
+                }
+            });
+            return true;
+        }
+        return scan_ref_scoped(node, descend);
+    });
+    self.walk(tw);
+    // pass 2: for every used symbol we need to walk its
+    // initialization code to figure out if it uses other
+    // symbols (that may not be in_use).
+    tw = new TreeWalker(scan_ref_scoped);
+    in_use_ids.forEach(function (def) {
+        var init = initializations.get(def.id);
+        if (init) init.forEach(function(init) {
+            init.walk(tw);
+        });
+    });
+    // pass 3: we should drop declarations not in_use
+    var tt = new TreeTransformer(
+        function before(node, descend, in_list) {
+            var parent = tt.parent();
+            if (drop_vars) {
+                const sym = assign_as_unused(node);
+                if (sym instanceof AST_SymbolRef) {
+                    var def = sym.definition();
+                    var in_use = in_use_ids.has(def.id);
+                    if (node instanceof AST_Assign) {
+                        if (!in_use || fixed_ids.has(def.id) && fixed_ids.get(def.id) !== node) {
+                            return maintain_this_binding(parent, node, node.right.transform(tt));
+                        }
+                    } else if (!in_use) return in_list ? MAP.skip : make_node(AST_Number, node, {
+                        value: 0
+                    });
+                }
+            }
+            if (scope !== self) return;
+            var def;
+            if (node.name
+                && (node instanceof AST_ClassExpression
+                    && !keep_name(compressor.option("keep_classnames"), (def = node.name.definition()).name)
+                || node instanceof AST_Function
+                    && !keep_name(compressor.option("keep_fnames"), (def = node.name.definition()).name))) {
+                // any declarations with same name will overshadow
+                // name of this anonymous function and can therefore
+                // never be used anywhere
+                if (!in_use_ids.has(def.id) || def.orig.length > 1) node.name = null;
+            }
+            if (node instanceof AST_Lambda && !(node instanceof AST_Accessor)) {
+                var trim = !compressor.option("keep_fargs");
+                for (var a = node.argnames, i = a.length; --i >= 0;) {
+                    var sym = a[i];
+                    if (sym instanceof AST_Expansion) {
+                        sym = sym.expression;
+                    }
+                    if (sym instanceof AST_DefaultAssign) {
+                        sym = sym.left;
+                    }
+                    // Do not drop destructuring arguments.
+                    // They constitute a type assertion, so dropping
+                    // them would stop that TypeError which would happen
+                    // if someone called it with an incorrectly formatted
+                    // parameter.
+                    if (!(sym instanceof AST_Destructuring) && !in_use_ids.has(sym.definition().id)) {
+                        set_flag(sym, UNUSED);
+                        if (trim) {
+                            a.pop();
+                        }
+                    } else {
+                        trim = false;
+                    }
+                }
+            }
+            if ((node instanceof AST_Defun || node instanceof AST_DefClass) && node !== self) {
+                const def = node.name.definition();
+                let keep = def.global && !drop_funcs || in_use_ids.has(def.id);
+                if (!keep) {
+                    def.eliminated++;
+                    if (node instanceof AST_DefClass) {
+                        // Classes might have extends with side effects
+                        const side_effects = node.drop_side_effect_free(compressor);
+                        if (side_effects) {
+                            return make_node(AST_SimpleStatement, node, {
+                                body: side_effects
+                            });
+                        }
+                    }
+                    return in_list ? MAP.skip : make_node(AST_EmptyStatement, node);
+                }
+            }
+            if (node instanceof AST_Definitions && !(parent instanceof AST_ForIn && parent.init === node)) {
+                var drop_block = !(parent instanceof AST_Toplevel) && !(node instanceof AST_Var);
+                // place uninitialized names at the start
+                var body = [], head = [], tail = [];
+                // for unused names whose initialization has
+                // side effects, we can cascade the init. code
+                // into the next one, or next statement.
+                var side_effects = [];
+                node.definitions.forEach(function(def) {
+                    if (def.value) def.value = def.value.transform(tt);
+                    var is_destructure = def.name instanceof AST_Destructuring;
+                    var sym = is_destructure
+                        ? new SymbolDef(null, { name: "<destructure>" }) /* fake SymbolDef */
+                        : def.name.definition();
+                    if (drop_block && sym.global) return tail.push(def);
+                    if (!(drop_vars || drop_block)
+                        || is_destructure
+                            && (def.name.names.length
+                                || def.name.is_array
+                                || compressor.option("pure_getters") != true)
+                        || in_use_ids.has(sym.id)
+                    ) {
+                        if (def.value && fixed_ids.has(sym.id) && fixed_ids.get(sym.id) !== def) {
+                            def.value = def.value.drop_side_effect_free(compressor);
+                        }
+                        if (def.name instanceof AST_SymbolVar) {
+                            var var_defs = var_defs_by_id.get(sym.id);
+                            if (var_defs.length > 1 && (!def.value || sym.orig.indexOf(def.name) > sym.eliminated)) {
+                                if (def.value) {
+                                    var ref = make_node(AST_SymbolRef, def.name, def.name);
+                                    sym.references.push(ref);
+                                    var assign = make_node(AST_Assign, def, {
+                                        operator: "=",
+                                        logical: false,
+                                        left: ref,
+                                        right: def.value
+                                    });
+                                    if (fixed_ids.get(sym.id) === def) {
+                                        fixed_ids.set(sym.id, assign);
+                                    }
+                                    side_effects.push(assign.transform(tt));
+                                }
+                                remove(var_defs, def);
+                                sym.eliminated++;
+                                return;
+                            }
+                        }
+                        if (def.value) {
+                            if (side_effects.length > 0) {
+                                if (tail.length > 0) {
+                                    side_effects.push(def.value);
+                                    def.value = make_sequence(def.value, side_effects);
+                                } else {
+                                    body.push(make_node(AST_SimpleStatement, node, {
+                                        body: make_sequence(node, side_effects)
+                                    }));
+                                }
+                                side_effects = [];
+                            }
+                            tail.push(def);
+                        } else {
+                            head.push(def);
+                        }
+                    } else if (sym.orig[0] instanceof AST_SymbolCatch) {
+                        var value = def.value && def.value.drop_side_effect_free(compressor);
+                        if (value) side_effects.push(value);
+                        def.value = null;
+                        head.push(def);
+                    } else {
+                        var value = def.value && def.value.drop_side_effect_free(compressor);
+                        if (value) {
+                            side_effects.push(value);
+                        }
+                        sym.eliminated++;
+                    }
+                });
+                if (head.length > 0 || tail.length > 0) {
+                    node.definitions = head.concat(tail);
+                    body.push(node);
+                }
+                if (side_effects.length > 0) {
+                    body.push(make_node(AST_SimpleStatement, node, {
+                        body: make_sequence(node, side_effects)
+                    }));
+                }
+                switch (body.length) {
+                  case 0:
+                    return in_list ? MAP.skip : make_node(AST_EmptyStatement, node);
+                  case 1:
+                    return body[0];
+                  default:
+                    return in_list ? MAP.splice(body) : make_node(AST_BlockStatement, node, {
+                        body: body
+                    });
+                }
+            }
+            // certain combination of unused name + side effect leads to:
+            //    https://github.com/mishoo/UglifyJS2/issues/44
+            //    https://github.com/mishoo/UglifyJS2/issues/1830
+            //    https://github.com/mishoo/UglifyJS2/issues/1838
+            // that's an invalid AST.
+            // We fix it at this stage by moving the `var` outside the `for`.
+            if (node instanceof AST_For) {
+                descend(node, this);
+                var block;
+                if (node.init instanceof AST_BlockStatement) {
+                    block = node.init;
+                    node.init = block.body.pop();
+                    block.body.push(node);
+                }
+                if (node.init instanceof AST_SimpleStatement) {
+                    node.init = node.init.body;
+                } else if (is_empty(node.init)) {
+                    node.init = null;
+                }
+                return !block ? node : in_list ? MAP.splice(block.body) : block;
+            }
+            if (node instanceof AST_LabeledStatement
+                && node.body instanceof AST_For
+            ) {
+                descend(node, this);
+                if (node.body instanceof AST_BlockStatement) {
+                    var block = node.body;
+                    node.body = block.body.pop();
+                    block.body.push(node);
+                    return in_list ? MAP.splice(block.body) : block;
+                }
+                return node;
+            }
+            if (node instanceof AST_BlockStatement) {
+                descend(node, this);
+                if (in_list && node.body.every(can_be_evicted_from_block)) {
+                    return MAP.splice(node.body);
+                }
+                return node;
+            }
+            if (node instanceof AST_Scope) {
+                const save_scope = scope;
+                scope = node;
+                descend(node, this);
+                scope = save_scope;
+                return node;
+            }
+        }
+    );
+
+    self.transform(tt);
+
+    function scan_ref_scoped(node, descend) {
+        var node_def;
+        const sym = assign_as_unused(node);
+        if (sym instanceof AST_SymbolRef
+            && !is_ref_of(node.left, AST_SymbolBlockDeclaration)
+            && self.variables.get(sym.name) === (node_def = sym.definition())
+        ) {
+            if (node instanceof AST_Assign) {
+                node.right.walk(tw);
+                if (!node_def.chained && node.left.fixed_value() === node.right) {
+                    fixed_ids.set(node_def.id, node);
+                }
+            }
+            return true;
+        }
+        if (node instanceof AST_SymbolRef) {
+            node_def = node.definition();
+            if (!in_use_ids.has(node_def.id)) {
+                in_use_ids.set(node_def.id, node_def);
+                if (node_def.orig[0] instanceof AST_SymbolCatch) {
+                    const redef = node_def.scope.is_block_scope()
+                        && node_def.scope.get_defun_scope().variables.get(node_def.name);
+                    if (redef) in_use_ids.set(redef.id, redef);
+                }
+            }
+            return true;
+        }
+        if (node instanceof AST_Scope) {
+            var save_scope = scope;
+            scope = node;
+            descend();
+            scope = save_scope;
+            return true;
+        }
+    }
+});
+
+AST_Scope.DEFMETHOD("hoist_declarations", function(compressor) {
+    var self = this;
+    if (compressor.has_directive("use asm")) return self;
+    // Hoisting makes no sense in an arrow func
+    if (!Array.isArray(self.body)) return self;
+
+    var hoist_funs = compressor.option("hoist_funs");
+    var hoist_vars = compressor.option("hoist_vars");
+
+    if (hoist_funs || hoist_vars) {
+        var dirs = [];
+        var hoisted = [];
+        var vars = new Map(), vars_found = 0, var_decl = 0;
+        // let's count var_decl first, we seem to waste a lot of
+        // space if we hoist `var` when there's only one.
+        walk(self, node => {
+            if (node instanceof AST_Scope && node !== self)
+                return true;
+            if (node instanceof AST_Var) {
+                ++var_decl;
+                return true;
+            }
+        });
+        hoist_vars = hoist_vars && var_decl > 1;
+        var tt = new TreeTransformer(
+            function before(node) {
+                if (node !== self) {
+                    if (node instanceof AST_Directive) {
+                        dirs.push(node);
+                        return make_node(AST_EmptyStatement, node);
+                    }
+                    if (hoist_funs && node instanceof AST_Defun
+                        && !(tt.parent() instanceof AST_Export)
+                        && tt.parent() === self) {
+                        hoisted.push(node);
+                        return make_node(AST_EmptyStatement, node);
+                    }
+                    if (
+                        hoist_vars
+                        && node instanceof AST_Var
+                        && !node.definitions.some(def => def.name instanceof AST_Destructuring)
+                    ) {
+                        node.definitions.forEach(function(def) {
+                            vars.set(def.name.name, def);
+                            ++vars_found;
+                        });
+                        var seq = node.to_assignments(compressor);
+                        var p = tt.parent();
+                        if (p instanceof AST_ForIn && p.init === node) {
+                            if (seq == null) {
+                                var def = node.definitions[0].name;
+                                return make_node(AST_SymbolRef, def, def);
+                            }
+                            return seq;
+                        }
+                        if (p instanceof AST_For && p.init === node) {
+                            return seq;
+                        }
+                        if (!seq) return make_node(AST_EmptyStatement, node);
+                        return make_node(AST_SimpleStatement, node, {
+                            body: seq
+                        });
+                    }
+                    if (node instanceof AST_Scope)
+                        return node; // to avoid descending in nested scopes
+                }
+            }
+        );
+        self = self.transform(tt);
+        if (vars_found > 0) {
+            // collect only vars which don't show up in self's arguments list
+            var defs = [];
+            const is_lambda = self instanceof AST_Lambda;
+            const args_as_names = is_lambda ? self.args_as_names() : null;
+            vars.forEach((def, name) => {
+                if (is_lambda && args_as_names.some((x) => x.name === def.name.name)) {
+                    vars.delete(name);
+                } else {
+                    def = def.clone();
+                    def.value = null;
+                    defs.push(def);
+                    vars.set(name, def);
+                }
+            });
+            if (defs.length > 0) {
+                // try to merge in assignments
+                for (var i = 0; i < self.body.length;) {
+                    if (self.body[i] instanceof AST_SimpleStatement) {
+                        var expr = self.body[i].body, sym, assign;
+                        if (expr instanceof AST_Assign
+                            && expr.operator == "="
+                            && (sym = expr.left) instanceof AST_Symbol
+                            && vars.has(sym.name)
+                        ) {
+                            var def = vars.get(sym.name);
+                            if (def.value) break;
+                            def.value = expr.right;
+                            remove(defs, def);
+                            defs.push(def);
+                            self.body.splice(i, 1);
+                            continue;
+                        }
+                        if (expr instanceof AST_Sequence
+                            && (assign = expr.expressions[0]) instanceof AST_Assign
+                            && assign.operator == "="
+                            && (sym = assign.left) instanceof AST_Symbol
+                            && vars.has(sym.name)
+                        ) {
+                            var def = vars.get(sym.name);
+                            if (def.value) break;
+                            def.value = assign.right;
+                            remove(defs, def);
+                            defs.push(def);
+                            self.body[i].body = make_sequence(expr, expr.expressions.slice(1));
+                            continue;
+                        }
+                    }
+                    if (self.body[i] instanceof AST_EmptyStatement) {
+                        self.body.splice(i, 1);
+                        continue;
+                    }
+                    if (self.body[i] instanceof AST_BlockStatement) {
+                        self.body.splice(i, 1, ...self.body[i].body);
+                        continue;
+                    }
+                    break;
+                }
+                defs = make_node(AST_Var, self, {
+                    definitions: defs
+                });
+                hoisted.push(defs);
+            }
+        }
+        self.body = dirs.concat(hoisted, self.body);
+    }
+    return self;
+});
+
+AST_Scope.DEFMETHOD("hoist_properties", function(compressor) {
+    var self = this;
+    if (!compressor.option("hoist_props") || compressor.has_directive("use asm")) return self;
+    var top_retain = self instanceof AST_Toplevel && compressor.top_retain || return_false;
+    var defs_by_id = new Map();
+    var hoister = new TreeTransformer(function(node, descend) {
+        if (node instanceof AST_Definitions
+            && hoister.parent() instanceof AST_Export) return node;
+        if (node instanceof AST_VarDef) {
+            const sym = node.name;
+            let def;
+            let value;
+            if (sym.scope === self
+                && (def = sym.definition()).escaped != 1
+                && !def.assignments
+                && !def.direct_access
+                && !def.single_use
+                && !compressor.exposed(def)
+                && !top_retain(def)
+                && (value = sym.fixed_value()) === node.value
+                && value instanceof AST_Object
+                && !value.properties.some(prop =>
+                    prop instanceof AST_Expansion || prop.computed_key()
+                )
+            ) {
+                descend(node, this);
+                const defs = new Map();
+                const assignments = [];
+                value.properties.forEach(({ key, value }) => {
+                    const scope = find_scope(hoister);
+                    const symbol = self.create_symbol(sym.CTOR, {
+                        source: sym,
+                        scope,
+                        conflict_scopes: new Set([
+                            scope,
+                            ...sym.definition().references.map(ref => ref.scope)
+                        ]),
+                        tentative_name: sym.name + "_" + key
+                    });
+
+                    defs.set(String(key), symbol.definition());
+
+                    assignments.push(make_node(AST_VarDef, node, {
+                        name: symbol,
+                        value
+                    }));
+                });
+                defs_by_id.set(def.id, defs);
+                return MAP.splice(assignments);
+            }
+        } else if (node instanceof AST_PropAccess
+            && node.expression instanceof AST_SymbolRef
+        ) {
+            const defs = defs_by_id.get(node.expression.definition().id);
+            if (defs) {
+                const def = defs.get(String(get_simple_key(node.property)));
+                const sym = make_node(AST_SymbolRef, node, {
+                    name: def.name,
+                    scope: node.expression.scope,
+                    thedef: def
+                });
+                sym.reference({});
+                return sym;
+            }
+        }
+    });
+    return self.transform(hoister);
+});
+
+def_optimize(AST_SimpleStatement, function(self, compressor) {
+    if (compressor.option("side_effects")) {
+        var body = self.body;
+        var node = body.drop_side_effect_free(compressor, true);
+        if (!node) {
+            return make_node(AST_EmptyStatement, self);
+        }
+        if (node !== body) {
+            return make_node(AST_SimpleStatement, self, { body: node });
+        }
+    }
+    return self;
+});
+
+def_optimize(AST_While, function(self, compressor) {
+    return compressor.option("loops") ? make_node(AST_For, self, self).optimize(compressor) : self;
+});
+
+def_optimize(AST_Do, function(self, compressor) {
+    if (!compressor.option("loops")) return self;
+    var cond = self.condition.tail_node().evaluate(compressor);
+    if (!(cond instanceof AST_Node)) {
+        if (cond) return make_node(AST_For, self, {
+            body: make_node(AST_BlockStatement, self.body, {
+                body: [
+                    self.body,
+                    make_node(AST_SimpleStatement, self.condition, {
+                        body: self.condition
+                    })
+                ]
+            })
+        }).optimize(compressor);
+        if (!has_break_or_continue(self, compressor.parent())) {
+            return make_node(AST_BlockStatement, self.body, {
+                body: [
+                    self.body,
+                    make_node(AST_SimpleStatement, self.condition, {
+                        body: self.condition
+                    })
+                ]
+            }).optimize(compressor);
+        }
+    }
+    return self;
+});
+
+function if_break_in_loop(self, compressor) {
+    var first = self.body instanceof AST_BlockStatement ? self.body.body[0] : self.body;
+    if (compressor.option("dead_code") && is_break(first)) {
+        var body = [];
+        if (self.init instanceof AST_Statement) {
+            body.push(self.init);
+        } else if (self.init) {
+            body.push(make_node(AST_SimpleStatement, self.init, {
+                body: self.init
+            }));
+        }
+        if (self.condition) {
+            body.push(make_node(AST_SimpleStatement, self.condition, {
+                body: self.condition
+            }));
+        }
+        trim_unreachable_code(compressor, self.body, body);
+        return make_node(AST_BlockStatement, self, {
+            body: body
+        });
+    }
+    if (first instanceof AST_If) {
+        if (is_break(first.body)) {
+            if (self.condition) {
+                self.condition = make_node(AST_Binary, self.condition, {
+                    left: self.condition,
+                    operator: "&&",
+                    right: first.condition.negate(compressor),
+                });
+            } else {
+                self.condition = first.condition.negate(compressor);
+            }
+            drop_it(first.alternative);
+        } else if (is_break(first.alternative)) {
+            if (self.condition) {
+                self.condition = make_node(AST_Binary, self.condition, {
+                    left: self.condition,
+                    operator: "&&",
+                    right: first.condition,
+                });
+            } else {
+                self.condition = first.condition;
+            }
+            drop_it(first.body);
+        }
+    }
+    return self;
+
+    function is_break(node) {
+        return node instanceof AST_Break
+            && compressor.loopcontrol_target(node) === compressor.self();
+    }
+
+    function drop_it(rest) {
+        rest = as_statement_array(rest);
+        if (self.body instanceof AST_BlockStatement) {
+            self.body = self.body.clone();
+            self.body.body = rest.concat(self.body.body.slice(1));
+            self.body = self.body.transform(compressor);
+        } else {
+            self.body = make_node(AST_BlockStatement, self.body, {
+                body: rest
+            }).transform(compressor);
+        }
+        self = if_break_in_loop(self, compressor);
+    }
+}
+
+def_optimize(AST_For, function(self, compressor) {
+    if (!compressor.option("loops")) return self;
+    if (compressor.option("side_effects") && self.init) {
+        self.init = self.init.drop_side_effect_free(compressor);
+    }
+    if (self.condition) {
+        var cond = self.condition.evaluate(compressor);
+        if (!(cond instanceof AST_Node)) {
+            if (cond) self.condition = null;
+            else if (!compressor.option("dead_code")) {
+                var orig = self.condition;
+                self.condition = make_node_from_constant(cond, self.condition);
+                self.condition = best_of_expression(self.condition.transform(compressor), orig);
+            }
+        }
+        if (compressor.option("dead_code")) {
+            if (cond instanceof AST_Node) cond = self.condition.tail_node().evaluate(compressor);
+            if (!cond) {
+                var body = [];
+                trim_unreachable_code(compressor, self.body, body);
+                if (self.init instanceof AST_Statement) {
+                    body.push(self.init);
+                } else if (self.init) {
+                    body.push(make_node(AST_SimpleStatement, self.init, {
+                        body: self.init
+                    }));
+                }
+                body.push(make_node(AST_SimpleStatement, self.condition, {
+                    body: self.condition
+                }));
+                return make_node(AST_BlockStatement, self, { body: body }).optimize(compressor);
+            }
+        }
+    }
+    return if_break_in_loop(self, compressor);
+});
+
+def_optimize(AST_If, function(self, compressor) {
+    if (is_empty(self.alternative)) self.alternative = null;
+
+    if (!compressor.option("conditionals")) return self;
+    // if condition can be statically determined, drop
+    // one of the blocks.  note, statically determined implies
+    // “has no side effects”; also it doesn't work for cases like
+    // `x && true`, though it probably should.
+    var cond = self.condition.evaluate(compressor);
+    if (!compressor.option("dead_code") && !(cond instanceof AST_Node)) {
+        var orig = self.condition;
+        self.condition = make_node_from_constant(cond, orig);
+        self.condition = best_of_expression(self.condition.transform(compressor), orig);
+    }
+    if (compressor.option("dead_code")) {
+        if (cond instanceof AST_Node) cond = self.condition.tail_node().evaluate(compressor);
+        if (!cond) {
+            var body = [];
+            trim_unreachable_code(compressor, self.body, body);
+            body.push(make_node(AST_SimpleStatement, self.condition, {
+                body: self.condition
+            }));
+            if (self.alternative) body.push(self.alternative);
+            return make_node(AST_BlockStatement, self, { body: body }).optimize(compressor);
+        } else if (!(cond instanceof AST_Node)) {
+            var body = [];
+            body.push(make_node(AST_SimpleStatement, self.condition, {
+                body: self.condition
+            }));
+            body.push(self.body);
+            if (self.alternative) {
+                trim_unreachable_code(compressor, self.alternative, body);
+            }
+            return make_node(AST_BlockStatement, self, { body: body }).optimize(compressor);
+        }
+    }
+    var negated = self.condition.negate(compressor);
+    var self_condition_length = self.condition.size();
+    var negated_length = negated.size();
+    var negated_is_best = negated_length < self_condition_length;
+    if (self.alternative && negated_is_best) {
+        negated_is_best = false; // because we already do the switch here.
+        // no need to swap values of self_condition_length and negated_length
+        // here because they are only used in an equality comparison later on.
+        self.condition = negated;
+        var tmp = self.body;
+        self.body = self.alternative || make_node(AST_EmptyStatement, self);
+        self.alternative = tmp;
+    }
+    if (is_empty(self.body) && is_empty(self.alternative)) {
+        return make_node(AST_SimpleStatement, self.condition, {
+            body: self.condition.clone()
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_SimpleStatement
+        && self.alternative instanceof AST_SimpleStatement) {
+        return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Conditional, self, {
+                condition   : self.condition,
+                consequent  : self.body.body,
+                alternative : self.alternative.body
+            })
+        }).optimize(compressor);
+    }
+    if (is_empty(self.alternative) && self.body instanceof AST_SimpleStatement) {
+        if (self_condition_length === negated_length && !negated_is_best
+            && self.condition instanceof AST_Binary && self.condition.operator == "||") {
+            // although the code length of self.condition and negated are the same,
+            // negated does not require additional surrounding parentheses.
+            // see https://github.com/mishoo/UglifyJS2/issues/979
+            negated_is_best = true;
+        }
+        if (negated_is_best) return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Binary, self, {
+                operator : "||",
+                left     : negated,
+                right    : self.body.body
+            })
+        }).optimize(compressor);
+        return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Binary, self, {
+                operator : "&&",
+                left     : self.condition,
+                right    : self.body.body
+            })
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_EmptyStatement
+        && self.alternative instanceof AST_SimpleStatement) {
+        return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Binary, self, {
+                operator : "||",
+                left     : self.condition,
+                right    : self.alternative.body
+            })
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_Exit
+        && self.alternative instanceof AST_Exit
+        && self.body.TYPE == self.alternative.TYPE) {
+        return make_node(self.body.CTOR, self, {
+            value: make_node(AST_Conditional, self, {
+                condition   : self.condition,
+                consequent  : self.body.value || make_node(AST_Undefined, self.body),
+                alternative : self.alternative.value || make_node(AST_Undefined, self.alternative)
+            }).transform(compressor)
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_If
+        && !self.body.alternative
+        && !self.alternative) {
+        self = make_node(AST_If, self, {
+            condition: make_node(AST_Binary, self.condition, {
+                operator: "&&",
+                left: self.condition,
+                right: self.body.condition
+            }),
+            body: self.body.body,
+            alternative: null
+        });
+    }
+    if (aborts(self.body)) {
+        if (self.alternative) {
+            var alt = self.alternative;
+            self.alternative = null;
+            return make_node(AST_BlockStatement, self, {
+                body: [ self, alt ]
+            }).optimize(compressor);
+        }
+    }
+    if (aborts(self.alternative)) {
+        var body = self.body;
+        self.body = self.alternative;
+        self.condition = negated_is_best ? negated : self.condition.negate(compressor);
+        self.alternative = null;
+        return make_node(AST_BlockStatement, self, {
+            body: [ self, body ]
+        }).optimize(compressor);
+    }
+    return self;
+});
+
+def_optimize(AST_Switch, function(self, compressor) {
+    if (!compressor.option("switches")) return self;
+    var branch;
+    var value = self.expression.evaluate(compressor);
+    if (!(value instanceof AST_Node)) {
+        var orig = self.expression;
+        self.expression = make_node_from_constant(value, orig);
+        self.expression = best_of_expression(self.expression.transform(compressor), orig);
+    }
+    if (!compressor.option("dead_code")) return self;
+    if (value instanceof AST_Node) {
+        value = self.expression.tail_node().evaluate(compressor);
+    }
+    var decl = [];
+    var body = [];
+    var default_branch;
+    var exact_match;
+    for (var i = 0, len = self.body.length; i < len && !exact_match; i++) {
+        branch = self.body[i];
+        if (branch instanceof AST_Default) {
+            if (!default_branch) {
+                default_branch = branch;
+            } else {
+                eliminate_branch(branch, body[body.length - 1]);
+            }
+        } else if (!(value instanceof AST_Node)) {
+            var exp = branch.expression.evaluate(compressor);
+            if (!(exp instanceof AST_Node) && exp !== value) {
+                eliminate_branch(branch, body[body.length - 1]);
+                continue;
+            }
+            if (exp instanceof AST_Node) exp = branch.expression.tail_node().evaluate(compressor);
+            if (exp === value) {
+                exact_match = branch;
+                if (default_branch) {
+                    var default_index = body.indexOf(default_branch);
+                    body.splice(default_index, 1);
+                    eliminate_branch(default_branch, body[default_index - 1]);
+                    default_branch = null;
+                }
+            }
+        }
+        body.push(branch);
+    }
+    while (i < len) eliminate_branch(self.body[i++], body[body.length - 1]);
+    self.body = body;
+
+    let default_or_exact = default_branch || exact_match;
+    default_branch = null;
+    exact_match = null;
+
+    // group equivalent branches so they will be located next to each other,
+    // that way the next micro-optimization will merge them.
+    // ** bail micro-optimization if not a simple switch case with breaks
+    if (body.every((branch, i) =>
+        (branch === default_or_exact || branch.expression instanceof AST_Constant)
+        && (branch.body.length === 0 || aborts(branch) || body.length - 1 === i))
+    ) {
+        for (let i = 0; i < body.length; i++) {
+            const branch = body[i];
+            for (let j = i + 1; j < body.length; j++) {
+                const next = body[j];
+                if (next.body.length === 0) continue;
+                const last_branch = j === (body.length - 1);
+                const equivalentBranch = branches_equivalent(next, branch, false);
+                if (equivalentBranch || (last_branch && branches_equivalent(next, branch, true))) {
+                    if (!equivalentBranch && last_branch) {
+                        next.body.push(make_node(AST_Break));
+                    }
+
+                    // let's find previous siblings with inert fallthrough...
+                    let x = j - 1;
+                    let fallthroughDepth = 0;
+                    while (x > i) {
+                        if (is_inert_body(body[x--])) {
+                            fallthroughDepth++;
+                        } else {
+                            break;
+                        }
+                    }
+
+                    const plucked = body.splice(j - fallthroughDepth, 1 + fallthroughDepth);
+                    body.splice(i + 1, 0, ...plucked);
+                    i += plucked.length;
+                }
+            }
+        }
+    }
+
+    // merge equivalent branches in a row
+    for (let i = 0; i < body.length; i++) {
+        let branch = body[i];
+        if (branch.body.length === 0) continue;
+        if (!aborts(branch)) continue;
+
+        for (let j = i + 1; j < body.length; i++, j++) {
+            let next = body[j];
+            if (next.body.length === 0) continue;
+            if (
+                branches_equivalent(next, branch, false)
+                || (j === body.length - 1 && branches_equivalent(next, branch, true))
+            ) {
+                branch.body = [];
+                branch = next;
+                continue;
+            }
+            break;
+        }
+    }
+
+    // Prune any empty branches at the end of the switch statement.
+    {
+        let i = body.length - 1;
+        for (; i >= 0; i--) {
+            let bbody = body[i].body;
+            if (is_break(bbody[bbody.length - 1], compressor)) bbody.pop();
+            if (!is_inert_body(body[i])) break;
+        }
+        // i now points to the index of a branch that contains a body. By incrementing, it's
+        // pointing to the first branch that's empty.
+        i++;
+        if (!default_or_exact || body.indexOf(default_or_exact) >= i) {
+            // The default behavior is to do nothing. We can take advantage of that to
+            // remove all case expressions that are side-effect free that also do
+            // nothing, since they'll default to doing nothing. But we can't remove any
+            // case expressions before one that would side-effect, since they may cause
+            // the side-effect to be skipped.
+            for (let j = body.length - 1; j >= i; j--) {
+                let branch = body[j];
+                if (branch === default_or_exact) {
+                    default_or_exact = null;
+                    body.pop();
+                } else if (!branch.expression.has_side_effects(compressor)) {
+                    body.pop();
+                } else {
+                    break;
+                }
+            }
+        }
+    }
+
+
+    // Prune side-effect free branches that fall into default.
+    DEFAULT: if (default_or_exact) {
+        let default_index = body.indexOf(default_or_exact);
+        let default_body_index = default_index;
+        for (; default_body_index < body.length - 1; default_body_index++) {
+            if (!is_inert_body(body[default_body_index])) break;
+        }
+        if (default_body_index < body.length - 1) {
+            break DEFAULT;
+        }
+
+        let side_effect_index = body.length - 1;
+        for (; side_effect_index >= 0; side_effect_index--) {
+            let branch = body[side_effect_index];
+            if (branch === default_or_exact) continue;
+            if (branch.expression.has_side_effects(compressor)) break;
+        }
+        // If the default behavior comes after any side-effect case expressions,
+        // then we can fold all side-effect free cases into the default branch.
+        // If the side-effect case is after the default, then any side-effect
+        // free cases could prevent the side-effect from occurring.
+        if (default_body_index > side_effect_index) {
+            let prev_body_index = default_index - 1;
+            for (; prev_body_index >= 0; prev_body_index--) {
+                if (!is_inert_body(body[prev_body_index])) break;
+            }
+            let before = Math.max(side_effect_index, prev_body_index) + 1;
+            let after = default_index;
+            if (side_effect_index > default_index) {
+                // If the default falls into the same body as a side-effect
+                // case, then we need preserve that case and only prune the
+                // cases after it.
+                after = side_effect_index;
+                body[side_effect_index].body = body[default_body_index].body;
+            } else {
+                // The default will be the last branch.
+                default_or_exact.body = body[default_body_index].body;
+            }
+
+            // Prune everything after the default (or last side-effect case)
+            // until the next case with a body.
+            body.splice(after + 1, default_body_index - after);
+            // Prune everything before the default that falls into it.
+            body.splice(before, default_index - before);
+        }
+    }
+
+    // See if we can remove the switch entirely if all cases (the default) fall into the same case body.
+    DEFAULT: if (default_or_exact) {
+        let i = body.findIndex(branch => !is_inert_body(branch));
+        let caseBody;
+        // `i` is equal to one of the following:
+        // - `-1`, there is no body in the switch statement.
+        // - `body.length - 1`, all cases fall into the same body.
+        // - anything else, there are multiple bodies in the switch.
+        if (i === body.length - 1) {
+            // All cases fall into the case body.
+            let branch = body[i];
+            if (has_nested_break(self)) break DEFAULT;
+
+            // This is the last case body, and we've already pruned any breaks, so it's
+            // safe to hoist.
+            caseBody = make_node(AST_BlockStatement, branch, {
+                body: branch.body
+            });
+            branch.body = [];
+        } else if (i !== -1) {
+            // If there are multiple bodies, then we cannot optimize anything.
+            break DEFAULT;
+        }
+
+        let sideEffect = body.find(branch => {
+            return (
+                branch !== default_or_exact
+                && branch.expression.has_side_effects(compressor)
+            );
+        });
+        // If no cases cause a side-effect, we can eliminate the switch entirely.
+        if (!sideEffect) {
+            return make_node(AST_BlockStatement, self, {
+                body: decl.concat(
+                    statement(self.expression),
+                    default_or_exact.expression ? statement(default_or_exact.expression) : [],
+                    caseBody || []
+                )
+            }).optimize(compressor);
+        }
+
+        // If we're this far, either there was no body or all cases fell into the same body.
+        // If there was no body, then we don't need a default branch (because the default is
+        // do nothing). If there was a body, we'll extract it to after the switch, so the
+        // switch's new default is to do nothing and we can still prune it.
+        const default_index = body.indexOf(default_or_exact);
+        body.splice(default_index, 1);
+        default_or_exact = null;
+
+        if (caseBody) {
+            // Recurse into switch statement one more time so that we can append the case body
+            // outside of the switch. This recursion will only happen once since we've pruned
+            // the default case.
+            return make_node(AST_BlockStatement, self, {
+                body: decl.concat(self, caseBody)
+            }).optimize(compressor);
+        }
+        // If we fall here, there is a default branch somewhere, there are no case bodies,
+        // and there's a side-effect somewhere. Just let the below paths take care of it.
+    }
+
+    if (body.length > 0) {
+        body[0].body = decl.concat(body[0].body);
+    }
+
+    if (body.length == 0) {
+        return make_node(AST_BlockStatement, self, {
+            body: decl.concat(statement(self.expression))
+        }).optimize(compressor);
+    }
+    if (body.length == 1 && !has_nested_break(self)) {
+        // This is the last case body, and we've already pruned any breaks, so it's
+        // safe to hoist.
+        let branch = body[0];
+        return make_node(AST_If, self, {
+            condition: make_node(AST_Binary, self, {
+                operator: "===",
+                left: self.expression,
+                right: branch.expression,
+            }),
+            body: make_node(AST_BlockStatement, branch, {
+                body: branch.body
+            }),
+            alternative: null
+        }).optimize(compressor);
+    }
+    if (body.length === 2 && default_or_exact && !has_nested_break(self)) {
+        let branch = body[0] === default_or_exact ? body[1] : body[0];
+        let exact_exp = default_or_exact.expression && statement(default_or_exact.expression);
+        if (aborts(body[0])) {
+            // Only the first branch body could have a break (at the last statement)
+            let first = body[0];
+            if (is_break(first.body[first.body.length - 1], compressor)) {
+                first.body.pop();
+            }
+            return make_node(AST_If, self, {
+                condition: make_node(AST_Binary, self, {
+                    operator: "===",
+                    left: self.expression,
+                    right: branch.expression,
+                }),
+                body: make_node(AST_BlockStatement, branch, {
+                    body: branch.body
+                }),
+                alternative: make_node(AST_BlockStatement, default_or_exact, {
+                    body: [].concat(
+                        exact_exp || [],
+                        default_or_exact.body
+                    )
+                })
+            }).optimize(compressor);
+        }
+        let operator = "===";
+        let consequent = make_node(AST_BlockStatement, branch, {
+            body: branch.body,
+        });
+        let always = make_node(AST_BlockStatement, default_or_exact, {
+            body: [].concat(
+                exact_exp || [],
+                default_or_exact.body
+            )
+        });
+        if (body[0] === default_or_exact) {
+            operator = "!==";
+            let tmp = always;
+            always = consequent;
+            consequent = tmp;
+        }
+        return make_node(AST_BlockStatement, self, {
+            body: [
+                make_node(AST_If, self, {
+                    condition: make_node(AST_Binary, self, {
+                        operator: operator,
+                        left: self.expression,
+                        right: branch.expression,
+                    }),
+                    body: consequent,
+                    alternative: null
+                })
+            ].concat(always)
+        }).optimize(compressor);
+    }
+    return self;
+
+    function eliminate_branch(branch, prev) {
+        if (prev && !aborts(prev)) {
+            prev.body = prev.body.concat(branch.body);
+        } else {
+            trim_unreachable_code(compressor, branch, decl);
+        }
+    }
+    function branches_equivalent(branch, prev, insertBreak) {
+        let bbody = branch.body;
+        let pbody = prev.body;
+        if (insertBreak) {
+            bbody = bbody.concat(make_node(AST_Break));
+        }
+        if (bbody.length !== pbody.length) return false;
+        let bblock = make_node(AST_BlockStatement, branch, { body: bbody });
+        let pblock = make_node(AST_BlockStatement, prev, { body: pbody });
+        return bblock.equivalent_to(pblock);
+    }
+    function statement(expression) {
+        return make_node(AST_SimpleStatement, expression, {
+            body: expression
+        });
+    }
+    function has_nested_break(root) {
+        let has_break = false;
+        let tw = new TreeWalker(node => {
+            if (has_break) return true;
+            if (node instanceof AST_Lambda) return true;
+            if (node instanceof AST_SimpleStatement) return true;
+            if (!is_break(node, tw)) return;
+            let parent = tw.parent();
+            if (
+                parent instanceof AST_SwitchBranch
+                && parent.body[parent.body.length - 1] === node
+            ) {
+                return;
+            }
+            has_break = true;
+        });
+        root.walk(tw);
+        return has_break;
+    }
+    function is_break(node, stack) {
+        return node instanceof AST_Break
+            && stack.loopcontrol_target(node) === self;
+    }
+    function is_inert_body(branch) {
+        return !aborts(branch) && !make_node(AST_BlockStatement, branch, {
+            body: branch.body
+        }).has_side_effects(compressor);
+    }
+});
+
+def_optimize(AST_Try, function(self, compressor) {
+    tighten_body(self.body, compressor);
+    if (self.bcatch && self.bfinally && self.bfinally.body.every(is_empty)) self.bfinally = null;
+    if (compressor.option("dead_code") && self.body.every(is_empty)) {
+        var body = [];
+        if (self.bcatch) {
+            trim_unreachable_code(compressor, self.bcatch, body);
+        }
+        if (self.bfinally) body.push(...self.bfinally.body);
+        return make_node(AST_BlockStatement, self, {
+            body: body
+        }).optimize(compressor);
+    }
+    return self;
+});
+
+AST_Definitions.DEFMETHOD("remove_initializers", function() {
+    var decls = [];
+    this.definitions.forEach(function(def) {
+        if (def.name instanceof AST_SymbolDeclaration) {
+            def.value = null;
+            decls.push(def);
+        } else {
+            walk(def.name, node => {
+                if (node instanceof AST_SymbolDeclaration) {
+                    decls.push(make_node(AST_VarDef, def, {
+                        name: node,
+                        value: null
+                    }));
+                }
+            });
+        }
+    });
+    this.definitions = decls;
+});
+
+AST_Definitions.DEFMETHOD("to_assignments", function(compressor) {
+    var reduce_vars = compressor.option("reduce_vars");
+    var assignments = [];
+
+    for (const def of this.definitions) {
+        if (def.value) {
+            var name = make_node(AST_SymbolRef, def.name, def.name);
+            assignments.push(make_node(AST_Assign, def, {
+                operator : "=",
+                logical: false,
+                left     : name,
+                right    : def.value
+            }));
+            if (reduce_vars) name.definition().fixed = false;
+        } else if (def.value) {
+            // Because it's a destructuring, do not turn into an assignment.
+            var varDef = make_node(AST_VarDef, def, {
+                name: def.name,
+                value: def.value
+            });
+            var var_ = make_node(AST_Var, def, {
+                definitions: [ varDef ]
+            });
+            assignments.push(var_);
+        }
+        const thedef = def.name.definition();
+        thedef.eliminated++;
+        thedef.replaced--;
+    }
+
+    if (assignments.length == 0) return null;
+    return make_sequence(this, assignments);
+});
+
+def_optimize(AST_Definitions, function(self) {
+    if (self.definitions.length == 0)
+        return make_node(AST_EmptyStatement, self);
+    return self;
+});
+
+def_optimize(AST_VarDef, function(self, compressor) {
+    if (
+        self.name instanceof AST_SymbolLet
+        && self.value != null
+        && is_undefined(self.value, compressor)
+    ) {
+        self.value = null;
+    }
+    return self;
+});
+
+def_optimize(AST_Import, function(self) {
+    return self;
+});
+
+// TODO this only works with AST_Defun, shouldn't it work for other ways of defining functions?
+function retain_top_func(fn, compressor) {
+    return compressor.top_retain
+        && fn instanceof AST_Defun
+        && has_flag(fn, TOP)
+        && fn.name
+        && compressor.top_retain(fn.name);
+}
+
+def_optimize(AST_Call, function(self, compressor) {
+    var exp = self.expression;
+    var fn = exp;
+    inline_array_like_spread(self.args);
+    var simple_args = self.args.every((arg) =>
+        !(arg instanceof AST_Expansion)
+    );
+
+    if (compressor.option("reduce_vars")
+        && fn instanceof AST_SymbolRef
+        && !has_annotation(self, _NOINLINE)
+    ) {
+        const fixed = fn.fixed_value();
+        if (!retain_top_func(fixed, compressor)) {
+            fn = fixed;
+        }
+    }
+
+    var is_func = fn instanceof AST_Lambda;
+
+    if (is_func && fn.pinned()) return self;
+
+    if (compressor.option("unused")
+        && simple_args
+        && is_func
+        && !fn.uses_arguments) {
+        var pos = 0, last = 0;
+        for (var i = 0, len = self.args.length; i < len; i++) {
+            if (fn.argnames[i] instanceof AST_Expansion) {
+                if (has_flag(fn.argnames[i].expression, UNUSED)) while (i < len) {
+                    var node = self.args[i++].drop_side_effect_free(compressor);
+                    if (node) {
+                        self.args[pos++] = node;
+                    }
+                } else while (i < len) {
+                    self.args[pos++] = self.args[i++];
+                }
+                last = pos;
+                break;
+            }
+            var trim = i >= fn.argnames.length;
+            if (trim || has_flag(fn.argnames[i], UNUSED)) {
+                var node = self.args[i].drop_side_effect_free(compressor);
+                if (node) {
+                    self.args[pos++] = node;
+                } else if (!trim) {
+                    self.args[pos++] = make_node(AST_Number, self.args[i], {
+                        value: 0
+                    });
+                    continue;
+                }
+            } else {
+                self.args[pos++] = self.args[i];
+            }
+            last = pos;
+        }
+        self.args.length = last;
+    }
+
+    if (compressor.option("unsafe")) {
+        if (exp instanceof AST_Dot && exp.start.value === "Array" && exp.property === "from" && self.args.length === 1) {
+            const [argument] = self.args;
+            if (argument instanceof AST_Array) {
+                return make_node(AST_Array, argument, {
+                    elements: argument.elements
+                }).optimize(compressor);
+            }
+        }
+        if (is_undeclared_ref(exp)) switch (exp.name) {
+          case "Array":
+            if (self.args.length != 1) {
+                return make_node(AST_Array, self, {
+                    elements: self.args
+                }).optimize(compressor);
+            } else if (self.args[0] instanceof AST_Number && self.args[0].value <= 11) {
+                const elements = [];
+                for (let i = 0; i < self.args[0].value; i++) elements.push(new AST_Hole);
+                return new AST_Array({ elements });
+            }
+            break;
+          case "Object":
+            if (self.args.length == 0) {
+                return make_node(AST_Object, self, {
+                    properties: []
+                });
+            }
+            break;
+          case "String":
+            if (self.args.length == 0) return make_node(AST_String, self, {
+                value: ""
+            });
+            if (self.args.length <= 1) return make_node(AST_Binary, self, {
+                left: self.args[0],
+                operator: "+",
+                right: make_node(AST_String, self, { value: "" })
+            }).optimize(compressor);
+            break;
+          case "Number":
+            if (self.args.length == 0) return make_node(AST_Number, self, {
+                value: 0
+            });
+            if (self.args.length == 1 && compressor.option("unsafe_math")) {
+                return make_node(AST_UnaryPrefix, self, {
+                    expression: self.args[0],
+                    operator: "+"
+                }).optimize(compressor);
+            }
+            break;
+          case "Symbol":
+            if (self.args.length == 1 && self.args[0] instanceof AST_String && compressor.option("unsafe_symbols"))
+                self.args.length = 0;
+                break;
+          case "Boolean":
+            if (self.args.length == 0) return make_node(AST_False, self);
+            if (self.args.length == 1) return make_node(AST_UnaryPrefix, self, {
+                expression: make_node(AST_UnaryPrefix, self, {
+                    expression: self.args[0],
+                    operator: "!"
+                }),
+                operator: "!"
+            }).optimize(compressor);
+            break;
+          case "RegExp":
+            var params = [];
+            if (self.args.length >= 1
+                && self.args.length <= 2
+                && self.args.every((arg) => {
+                    var value = arg.evaluate(compressor);
+                    params.push(value);
+                    return arg !== value;
+                })
+            ) {
+                let [ source, flags ] = params;
+                source = regexp_source_fix(new RegExp(source).source);
+                const rx = make_node(AST_RegExp, self, {
+                    value: { source, flags }
+                });
+                if (rx._eval(compressor) !== rx) {
+                    return rx;
+                }
+            }
+            break;
+        } else if (exp instanceof AST_Dot) switch(exp.property) {
+          case "toString":
+            if (self.args.length == 0 && !exp.expression.may_throw_on_access(compressor)) {
+                return make_node(AST_Binary, self, {
+                    left: make_node(AST_String, self, { value: "" }),
+                    operator: "+",
+                    right: exp.expression
+                }).optimize(compressor);
+            }
+            break;
+          case "join":
+            if (exp.expression instanceof AST_Array) EXIT: {
+                var separator;
+                if (self.args.length > 0) {
+                    separator = self.args[0].evaluate(compressor);
+                    if (separator === self.args[0]) break EXIT; // not a constant
+                }
+                var elements = [];
+                var consts = [];
+                for (var i = 0, len = exp.expression.elements.length; i < len; i++) {
+                    var el = exp.expression.elements[i];
+                    if (el instanceof AST_Expansion) break EXIT;
+                    var value = el.evaluate(compressor);
+                    if (value !== el) {
+                        consts.push(value);
+                    } else {
+                        if (consts.length > 0) {
+                            elements.push(make_node(AST_String, self, {
+                                value: consts.join(separator)
+                            }));
+                            consts.length = 0;
+                        }
+                        elements.push(el);
+                    }
+                }
+                if (consts.length > 0) {
+                    elements.push(make_node(AST_String, self, {
+                        value: consts.join(separator)
+                    }));
+                }
+                if (elements.length == 0) return make_node(AST_String, self, { value: "" });
+                if (elements.length == 1) {
+                    if (elements[0].is_string(compressor)) {
+                        return elements[0];
+                    }
+                    return make_node(AST_Binary, elements[0], {
+                        operator : "+",
+                        left     : make_node(AST_String, self, { value: "" }),
+                        right    : elements[0]
+                    });
+                }
+                if (separator == "") {
+                    var first;
+                    if (elements[0].is_string(compressor)
+                        || elements[1].is_string(compressor)) {
+                        first = elements.shift();
+                    } else {
+                        first = make_node(AST_String, self, { value: "" });
+                    }
+                    return elements.reduce(function(prev, el) {
+                        return make_node(AST_Binary, el, {
+                            operator : "+",
+                            left     : prev,
+                            right    : el
+                        });
+                    }, first).optimize(compressor);
+                }
+                // need this awkward cloning to not affect original element
+                // best_of will decide which one to get through.
+                var node = self.clone();
+                node.expression = node.expression.clone();
+                node.expression.expression = node.expression.expression.clone();
+                node.expression.expression.elements = elements;
+                return best_of(compressor, self, node);
+            }
+            break;
+          case "charAt":
+            if (exp.expression.is_string(compressor)) {
+                var arg = self.args[0];
+                var index = arg ? arg.evaluate(compressor) : 0;
+                if (index !== arg) {
+                    return make_node(AST_Sub, exp, {
+                        expression: exp.expression,
+                        property: make_node_from_constant(index | 0, arg || exp)
+                    }).optimize(compressor);
+                }
+            }
+            break;
+          case "apply":
+            if (self.args.length == 2 && self.args[1] instanceof AST_Array) {
+                var args = self.args[1].elements.slice();
+                args.unshift(self.args[0]);
+                return make_node(AST_Call, self, {
+                    expression: make_node(AST_Dot, exp, {
+                        expression: exp.expression,
+                        optional: false,
+                        property: "call"
+                    }),
+                    args: args
+                }).optimize(compressor);
+            }
+            break;
+          case "call":
+            var func = exp.expression;
+            if (func instanceof AST_SymbolRef) {
+                func = func.fixed_value();
+            }
+            if (func instanceof AST_Lambda && !func.contains_this()) {
+                return (self.args.length ? make_sequence(this, [
+                    self.args[0],
+                    make_node(AST_Call, self, {
+                        expression: exp.expression,
+                        args: self.args.slice(1)
+                    })
+                ]) : make_node(AST_Call, self, {
+                    expression: exp.expression,
+                    args: []
+                })).optimize(compressor);
+            }
+            break;
+        }
+    }
+
+    if (compressor.option("unsafe_Function")
+        && is_undeclared_ref(exp)
+        && exp.name == "Function") {
+        // new Function() => function(){}
+        if (self.args.length == 0) return make_node(AST_Function, self, {
+            argnames: [],
+            body: []
+        }).optimize(compressor);
+        var nth_identifier = compressor.mangle_options && compressor.mangle_options.nth_identifier || base54;
+        if (self.args.every((x) => x instanceof AST_String)) {
+            // quite a corner-case, but we can handle it:
+            //   https://github.com/mishoo/UglifyJS2/issues/203
+            // if the code argument is a constant, then we can minify it.
+            try {
+                var code = "n(function(" + self.args.slice(0, -1).map(function(arg) {
+                    return arg.value;
+                }).join(",") + "){" + self.args[self.args.length - 1].value + "})";
+                var ast = parse(code);
+                var mangle = { ie8: compressor.option("ie8"), nth_identifier: nth_identifier };
+                ast.figure_out_scope(mangle);
+                var comp = new Compressor(compressor.options, {
+                    mangle_options: compressor.mangle_options
+                });
+                ast = ast.transform(comp);
+                ast.figure_out_scope(mangle);
+                ast.compute_char_frequency(mangle);
+                ast.mangle_names(mangle);
+                var fun;
+                walk(ast, node => {
+                    if (is_func_expr(node)) {
+                        fun = node;
+                        return walk_abort;
+                    }
+                });
+                var code = OutputStream();
+                AST_BlockStatement.prototype._codegen.call(fun, fun, code);
+                self.args = [
+                    make_node(AST_String, self, {
+                        value: fun.argnames.map(function(arg) {
+                            return arg.print_to_string();
+                        }).join(",")
+                    }),
+                    make_node(AST_String, self.args[self.args.length - 1], {
+                        value: code.get().replace(/^{|}$/g, "")
+                    })
+                ];
+                return self;
+            } catch (ex) {
+                if (!(ex instanceof JS_Parse_Error)) {
+                    throw ex;
+                }
+
+                // Otherwise, it crashes at runtime. Or maybe it's nonstandard syntax.
+            }
+        }
+    }
+
+    var stat = is_func && fn.body[0];
+    var is_regular_func = is_func && !fn.is_generator && !fn.async;
+    var can_inline = is_regular_func && compressor.option("inline") && !self.is_callee_pure(compressor);
+    if (can_inline && stat instanceof AST_Return) {
+        let returned = stat.value;
+        if (!returned || returned.is_constant_expression()) {
+            if (returned) {
+                returned = returned.clone(true);
+            } else {
+                returned = make_node(AST_Undefined, self);
+            }
+            const args = self.args.concat(returned);
+            return make_sequence(self, args).optimize(compressor);
+        }
+
+        // optimize identity function
+        if (
+            fn.argnames.length === 1
+            && (fn.argnames[0] instanceof AST_SymbolFunarg)
+            && self.args.length < 2
+            && returned instanceof AST_SymbolRef
+            && returned.name === fn.argnames[0].name
+        ) {
+            const replacement =
+                (self.args[0] || make_node(AST_Undefined)).optimize(compressor);
+
+            let parent;
+            if (
+                replacement instanceof AST_PropAccess
+                && (parent = compressor.parent()) instanceof AST_Call
+                && parent.expression === self
+            ) {
+                // identity function was being used to remove `this`, like in
+                //
+                // id(bag.no_this)(...)
+                //
+                // Replace with a larger but more effish (0, bag.no_this) wrapper.
+
+                return make_sequence(self, [
+                    make_node(AST_Number, self, { value: 0 }),
+                    replacement
+                ]);
+            }
+            // replace call with first argument or undefined if none passed
+            return replacement;
+        }
+    }
+
+    if (can_inline) {
+        var scope, in_loop, level = -1;
+        let def;
+        let returned_value;
+        let nearest_scope;
+        if (simple_args
+            && !fn.uses_arguments
+            && !(compressor.parent() instanceof AST_Class)
+            && !(fn.name && fn instanceof AST_Function)
+            && (returned_value = can_flatten_body(stat))
+            && (exp === fn
+                || has_annotation(self, _INLINE)
+                || compressor.option("unused")
+                    && (def = exp.definition()).references.length == 1
+                    && !is_recursive_ref(compressor, def)
+                    && fn.is_constant_expression(exp.scope))
+            && !has_annotation(self, _PURE | _NOINLINE)
+            && !fn.contains_this()
+            && can_inject_symbols()
+            && (nearest_scope = find_scope(compressor))
+            && !scope_encloses_variables_in_this_scope(nearest_scope, fn)
+            && !(function in_default_assign() {
+                    // Due to the fact function parameters have their own scope
+                    // which can't use `var something` in the function body within,
+                    // we simply don't inline into DefaultAssign.
+                    let i = 0;
+                    let p;
+                    while ((p = compressor.parent(i++))) {
+                        if (p instanceof AST_DefaultAssign) return true;
+                        if (p instanceof AST_Block) break;
+                    }
+                    return false;
+                })()
+            && !(scope instanceof AST_Class)
+        ) {
+            set_flag(fn, SQUEEZED);
+            nearest_scope.add_child_scope(fn);
+            return make_sequence(self, flatten_fn(returned_value)).optimize(compressor);
+        }
+    }
+
+    if (can_inline && has_annotation(self, _INLINE)) {
+        set_flag(fn, SQUEEZED);
+        fn = make_node(fn.CTOR === AST_Defun ? AST_Function : fn.CTOR, fn, fn);
+        fn = fn.clone(true);
+        fn.figure_out_scope({}, {
+            parent_scope: find_scope(compressor),
+            toplevel: compressor.get_toplevel()
+        });
+
+        return make_node(AST_Call, self, {
+            expression: fn,
+            args: self.args,
+        }).optimize(compressor);
+    }
+
+    const can_drop_this_call = is_regular_func && compressor.option("side_effects") && fn.body.every(is_empty);
+    if (can_drop_this_call) {
+        var args = self.args.concat(make_node(AST_Undefined, self));
+        return make_sequence(self, args).optimize(compressor);
+    }
+
+    if (compressor.option("negate_iife")
+        && compressor.parent() instanceof AST_SimpleStatement
+        && is_iife_call(self)) {
+        return self.negate(compressor, true);
+    }
+
+    var ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+
+    return self;
+
+    function return_value(stat) {
+        if (!stat) return make_node(AST_Undefined, self);
+        if (stat instanceof AST_Return) {
+            if (!stat.value) return make_node(AST_Undefined, self);
+            return stat.value.clone(true);
+        }
+        if (stat instanceof AST_SimpleStatement) {
+            return make_node(AST_UnaryPrefix, stat, {
+                operator: "void",
+                expression: stat.body.clone(true)
+            });
+        }
+    }
+
+    function can_flatten_body(stat) {
+        var body = fn.body;
+        var len = body.length;
+        if (compressor.option("inline") < 3) {
+            return len == 1 && return_value(stat);
+        }
+        stat = null;
+        for (var i = 0; i < len; i++) {
+            var line = body[i];
+            if (line instanceof AST_Var) {
+                if (stat && !line.definitions.every((var_def) =>
+                    !var_def.value
+                )) {
+                    return false;
+                }
+            } else if (stat) {
+                return false;
+            } else if (!(line instanceof AST_EmptyStatement)) {
+                stat = line;
+            }
+        }
+        return return_value(stat);
+    }
+
+    function can_inject_args(block_scoped, safe_to_inject) {
+        for (var i = 0, len = fn.argnames.length; i < len; i++) {
+            var arg = fn.argnames[i];
+            if (arg instanceof AST_DefaultAssign) {
+                if (has_flag(arg.left, UNUSED)) continue;
+                return false;
+            }
+            if (arg instanceof AST_Destructuring) return false;
+            if (arg instanceof AST_Expansion) {
+                if (has_flag(arg.expression, UNUSED)) continue;
+                return false;
+            }
+            if (has_flag(arg, UNUSED)) continue;
+            if (!safe_to_inject
+                || block_scoped.has(arg.name)
+                || identifier_atom.has(arg.name)
+                || scope.conflicting_def(arg.name)) {
+                return false;
+            }
+            if (in_loop) in_loop.push(arg.definition());
+        }
+        return true;
+    }
+
+    function can_inject_vars(block_scoped, safe_to_inject) {
+        var len = fn.body.length;
+        for (var i = 0; i < len; i++) {
+            var stat = fn.body[i];
+            if (!(stat instanceof AST_Var)) continue;
+            if (!safe_to_inject) return false;
+            for (var j = stat.definitions.length; --j >= 0;) {
+                var name = stat.definitions[j].name;
+                if (name instanceof AST_Destructuring
+                    || block_scoped.has(name.name)
+                    || identifier_atom.has(name.name)
+                    || scope.conflicting_def(name.name)) {
+                    return false;
+                }
+                if (in_loop) in_loop.push(name.definition());
+            }
+        }
+        return true;
+    }
+
+    function can_inject_symbols() {
+        var block_scoped = new Set();
+        do {
+            scope = compressor.parent(++level);
+            if (scope.is_block_scope() && scope.block_scope) {
+                // TODO this is sometimes undefined during compression.
+                // But it should always have a value!
+                scope.block_scope.variables.forEach(function (variable) {
+                    block_scoped.add(variable.name);
+                });
+            }
+            if (scope instanceof AST_Catch) {
+                // TODO can we delete? AST_Catch is a block scope.
+                if (scope.argname) {
+                    block_scoped.add(scope.argname.name);
+                }
+            } else if (scope instanceof AST_IterationStatement) {
+                in_loop = [];
+            } else if (scope instanceof AST_SymbolRef) {
+                if (scope.fixed_value() instanceof AST_Scope) return false;
+            }
+        } while (!(scope instanceof AST_Scope));
+
+        var safe_to_inject = !(scope instanceof AST_Toplevel) || compressor.toplevel.vars;
+        var inline = compressor.option("inline");
+        if (!can_inject_vars(block_scoped, inline >= 3 && safe_to_inject)) return false;
+        if (!can_inject_args(block_scoped, inline >= 2 && safe_to_inject)) return false;
+        return !in_loop || in_loop.length == 0 || !is_reachable(fn, in_loop);
+    }
+
+    function append_var(decls, expressions, name, value) {
+        var def = name.definition();
+
+        // Name already exists, only when a function argument had the same name
+        const already_appended = scope.variables.has(name.name);
+        if (!already_appended) {
+            scope.variables.set(name.name, def);
+            scope.enclosed.push(def);
+            decls.push(make_node(AST_VarDef, name, {
+                name: name,
+                value: null
+            }));
+        }
+
+        var sym = make_node(AST_SymbolRef, name, name);
+        def.references.push(sym);
+        if (value) expressions.push(make_node(AST_Assign, self, {
+            operator: "=",
+            logical: false,
+            left: sym,
+            right: value.clone()
+        }));
+    }
+
+    function flatten_args(decls, expressions) {
+        var len = fn.argnames.length;
+        for (var i = self.args.length; --i >= len;) {
+            expressions.push(self.args[i]);
+        }
+        for (i = len; --i >= 0;) {
+            var name = fn.argnames[i];
+            var value = self.args[i];
+            if (has_flag(name, UNUSED) || !name.name || scope.conflicting_def(name.name)) {
+                if (value) expressions.push(value);
+            } else {
+                var symbol = make_node(AST_SymbolVar, name, name);
+                name.definition().orig.push(symbol);
+                if (!value && in_loop) value = make_node(AST_Undefined, self);
+                append_var(decls, expressions, symbol, value);
+            }
+        }
+        decls.reverse();
+        expressions.reverse();
+    }
+
+    function flatten_vars(decls, expressions) {
+        var pos = expressions.length;
+        for (var i = 0, lines = fn.body.length; i < lines; i++) {
+            var stat = fn.body[i];
+            if (!(stat instanceof AST_Var)) continue;
+            for (var j = 0, defs = stat.definitions.length; j < defs; j++) {
+                var var_def = stat.definitions[j];
+                var name = var_def.name;
+                append_var(decls, expressions, name, var_def.value);
+                if (in_loop && fn.argnames.every((argname) =>
+                    argname.name != name.name
+                )) {
+                    var def = fn.variables.get(name.name);
+                    var sym = make_node(AST_SymbolRef, name, name);
+                    def.references.push(sym);
+                    expressions.splice(pos++, 0, make_node(AST_Assign, var_def, {
+                        operator: "=",
+                        logical: false,
+                        left: sym,
+                        right: make_node(AST_Undefined, name)
+                    }));
+                }
+            }
+        }
+    }
+
+    function flatten_fn(returned_value) {
+        var decls = [];
+        var expressions = [];
+        flatten_args(decls, expressions);
+        flatten_vars(decls, expressions);
+        expressions.push(returned_value);
+
+        if (decls.length) {
+            const i = scope.body.indexOf(compressor.parent(level - 1)) + 1;
+            scope.body.splice(i, 0, make_node(AST_Var, fn, {
+                definitions: decls
+            }));
+        }
+
+        return expressions.map(exp => exp.clone(true));
+    }
+});
+
+def_optimize(AST_New, function(self, compressor) {
+    if (
+        compressor.option("unsafe") &&
+        is_undeclared_ref(self.expression) &&
+        ["Object", "RegExp", "Function", "Error", "Array"].includes(self.expression.name)
+    ) return make_node(AST_Call, self, self).transform(compressor);
+    return self;
+});
+
+def_optimize(AST_Sequence, function(self, compressor) {
+    if (!compressor.option("side_effects")) return self;
+    var expressions = [];
+    filter_for_side_effects();
+    var end = expressions.length - 1;
+    trim_right_for_undefined();
+    if (end == 0) {
+        self = maintain_this_binding(compressor.parent(), compressor.self(), expressions[0]);
+        if (!(self instanceof AST_Sequence)) self = self.optimize(compressor);
+        return self;
+    }
+    self.expressions = expressions;
+    return self;
+
+    function filter_for_side_effects() {
+        var first = first_in_statement(compressor);
+        var last = self.expressions.length - 1;
+        self.expressions.forEach(function(expr, index) {
+            if (index < last) expr = expr.drop_side_effect_free(compressor, first);
+            if (expr) {
+                merge_sequence(expressions, expr);
+                first = false;
+            }
+        });
+    }
+
+    function trim_right_for_undefined() {
+        while (end > 0 && is_undefined(expressions[end], compressor)) end--;
+        if (end < expressions.length - 1) {
+            expressions[end] = make_node(AST_UnaryPrefix, self, {
+                operator   : "void",
+                expression : expressions[end]
+            });
+            expressions.length = end + 1;
+        }
+    }
+});
+
+AST_Unary.DEFMETHOD("lift_sequences", function(compressor) {
+    if (compressor.option("sequences")) {
+        if (this.expression instanceof AST_Sequence) {
+            var x = this.expression.expressions.slice();
+            var e = this.clone();
+            e.expression = x.pop();
+            x.push(e);
+            return make_sequence(this, x).optimize(compressor);
+        }
+    }
+    return this;
+});
+
+def_optimize(AST_UnaryPostfix, function(self, compressor) {
+    return self.lift_sequences(compressor);
+});
+
+def_optimize(AST_UnaryPrefix, function(self, compressor) {
+    var e = self.expression;
+    if (
+        self.operator == "delete" &&
+        !(
+            e instanceof AST_SymbolRef ||
+            e instanceof AST_PropAccess ||
+            e instanceof AST_Chain ||
+            is_identifier_atom(e)
+        )
+    ) {
+        return make_sequence(self, [e, make_node(AST_True, self)]).optimize(compressor);
+    }
+    var seq = self.lift_sequences(compressor);
+    if (seq !== self) {
+        return seq;
+    }
+    if (compressor.option("side_effects") && self.operator == "void") {
+        e = e.drop_side_effect_free(compressor);
+        if (e) {
+            self.expression = e;
+            return self;
+        } else {
+            return make_node(AST_Undefined, self).optimize(compressor);
+        }
+    }
+    if (compressor.in_boolean_context()) {
+        switch (self.operator) {
+          case "!":
+            if (e instanceof AST_UnaryPrefix && e.operator == "!") {
+                // !!foo ==> foo, if we're in boolean context
+                return e.expression;
+            }
+            if (e instanceof AST_Binary) {
+                self = best_of(compressor, self, e.negate(compressor, first_in_statement(compressor)));
+            }
+            break;
+          case "typeof":
+            // typeof always returns a non-empty string, thus it's
+            // always true in booleans
+            // And we don't need to check if it's undeclared, because in typeof, that's OK
+            return (e instanceof AST_SymbolRef ? make_node(AST_True, self) : make_sequence(self, [
+                e,
+                make_node(AST_True, self)
+            ])).optimize(compressor);
+        }
+    }
+    if (self.operator == "-" && e instanceof AST_Infinity) {
+        e = e.transform(compressor);
+    }
+    if (e instanceof AST_Binary
+        && (self.operator == "+" || self.operator == "-")
+        && (e.operator == "*" || e.operator == "/" || e.operator == "%")) {
+        return make_node(AST_Binary, self, {
+            operator: e.operator,
+            left: make_node(AST_UnaryPrefix, e.left, {
+                operator: self.operator,
+                expression: e.left
+            }),
+            right: e.right
+        });
+    }
+    // avoids infinite recursion of numerals
+    if (self.operator != "-"
+        || !(e instanceof AST_Number || e instanceof AST_Infinity || e instanceof AST_BigInt)) {
+        var ev = self.evaluate(compressor);
+        if (ev !== self) {
+            ev = make_node_from_constant(ev, self).optimize(compressor);
+            return best_of(compressor, ev, self);
+        }
+    }
+    return self;
+});
+
+AST_Binary.DEFMETHOD("lift_sequences", function(compressor) {
+    if (compressor.option("sequences")) {
+        if (this.left instanceof AST_Sequence) {
+            var x = this.left.expressions.slice();
+            var e = this.clone();
+            e.left = x.pop();
+            x.push(e);
+            return make_sequence(this, x).optimize(compressor);
+        }
+        if (this.right instanceof AST_Sequence && !this.left.has_side_effects(compressor)) {
+            var assign = this.operator == "=" && this.left instanceof AST_SymbolRef;
+            var x = this.right.expressions;
+            var last = x.length - 1;
+            for (var i = 0; i < last; i++) {
+                if (!assign && x[i].has_side_effects(compressor)) break;
+            }
+            if (i == last) {
+                x = x.slice();
+                var e = this.clone();
+                e.right = x.pop();
+                x.push(e);
+                return make_sequence(this, x).optimize(compressor);
+            } else if (i > 0) {
+                var e = this.clone();
+                e.right = make_sequence(this.right, x.slice(i));
+                x = x.slice(0, i);
+                x.push(e);
+                return make_sequence(this, x).optimize(compressor);
+            }
+        }
+    }
+    return this;
+});
+
+var commutativeOperators = makePredicate("== === != !== * & | ^");
+function is_object(node) {
+    return node instanceof AST_Array
+        || node instanceof AST_Lambda
+        || node instanceof AST_Object
+        || node instanceof AST_Class;
+}
+
+def_optimize(AST_Binary, function(self, compressor) {
+    function reversible() {
+        return self.left.is_constant()
+            || self.right.is_constant()
+            || !self.left.has_side_effects(compressor)
+                && !self.right.has_side_effects(compressor);
+    }
+    function reverse(op) {
+        if (reversible()) {
+            if (op) self.operator = op;
+            var tmp = self.left;
+            self.left = self.right;
+            self.right = tmp;
+        }
+    }
+    if (commutativeOperators.has(self.operator)) {
+        if (self.right.is_constant()
+            && !self.left.is_constant()) {
+            // if right is a constant, whatever side effects the
+            // left side might have could not influence the
+            // result.  hence, force switch.
+
+            if (!(self.left instanceof AST_Binary
+                  && PRECEDENCE[self.left.operator] >= PRECEDENCE[self.operator])) {
+                reverse();
+            }
+        }
+    }
+    self = self.lift_sequences(compressor);
+    if (compressor.option("comparisons")) switch (self.operator) {
+      case "===":
+      case "!==":
+        var is_strict_comparison = true;
+        if ((self.left.is_string(compressor) && self.right.is_string(compressor)) ||
+            (self.left.is_number(compressor) && self.right.is_number(compressor)) ||
+            (self.left.is_boolean() && self.right.is_boolean()) ||
+            self.left.equivalent_to(self.right)) {
+            self.operator = self.operator.substr(0, 2);
+        }
+        // XXX: intentionally falling down to the next case
+      case "==":
+      case "!=":
+        // void 0 == x => null == x
+        if (!is_strict_comparison && is_undefined(self.left, compressor)) {
+            self.left = make_node(AST_Null, self.left);
+        } else if (compressor.option("typeofs")
+            // "undefined" == typeof x => undefined === x
+            && self.left instanceof AST_String
+            && self.left.value == "undefined"
+            && self.right instanceof AST_UnaryPrefix
+            && self.right.operator == "typeof") {
+            var expr = self.right.expression;
+            if (expr instanceof AST_SymbolRef ? expr.is_declared(compressor)
+                : !(expr instanceof AST_PropAccess && compressor.option("ie8"))) {
+                self.right = expr;
+                self.left = make_node(AST_Undefined, self.left).optimize(compressor);
+                if (self.operator.length == 2) self.operator += "=";
+            }
+        } else if (self.left instanceof AST_SymbolRef
+            // obj !== obj => false
+            && self.right instanceof AST_SymbolRef
+            && self.left.definition() === self.right.definition()
+            && is_object(self.left.fixed_value())) {
+            return make_node(self.operator[0] == "=" ? AST_True : AST_False, self);
+        }
+        break;
+      case "&&":
+      case "||":
+        var lhs = self.left;
+        if (lhs.operator == self.operator) {
+            lhs = lhs.right;
+        }
+        if (lhs instanceof AST_Binary
+            && lhs.operator == (self.operator == "&&" ? "!==" : "===")
+            && self.right instanceof AST_Binary
+            && lhs.operator == self.right.operator
+            && (is_undefined(lhs.left, compressor) && self.right.left instanceof AST_Null
+                || lhs.left instanceof AST_Null && is_undefined(self.right.left, compressor))
+            && !lhs.right.has_side_effects(compressor)
+            && lhs.right.equivalent_to(self.right.right)) {
+            var combined = make_node(AST_Binary, self, {
+                operator: lhs.operator.slice(0, -1),
+                left: make_node(AST_Null, self),
+                right: lhs.right
+            });
+            if (lhs !== self.left) {
+                combined = make_node(AST_Binary, self, {
+                    operator: self.operator,
+                    left: self.left.left,
+                    right: combined
+                });
+            }
+            return combined;
+        }
+        break;
+    }
+    if (self.operator == "+" && compressor.in_boolean_context()) {
+        var ll = self.left.evaluate(compressor);
+        var rr = self.right.evaluate(compressor);
+        if (ll && typeof ll == "string") {
+            return make_sequence(self, [
+                self.right,
+                make_node(AST_True, self)
+            ]).optimize(compressor);
+        }
+        if (rr && typeof rr == "string") {
+            return make_sequence(self, [
+                self.left,
+                make_node(AST_True, self)
+            ]).optimize(compressor);
+        }
+    }
+    if (compressor.option("comparisons") && self.is_boolean()) {
+        if (!(compressor.parent() instanceof AST_Binary)
+            || compressor.parent() instanceof AST_Assign) {
+            var negated = make_node(AST_UnaryPrefix, self, {
+                operator: "!",
+                expression: self.negate(compressor, first_in_statement(compressor))
+            });
+            self = best_of(compressor, self, negated);
+        }
+        if (compressor.option("unsafe_comps")) {
+            switch (self.operator) {
+              case "<": reverse(">"); break;
+              case "<=": reverse(">="); break;
+            }
+        }
+    }
+    if (self.operator == "+") {
+        if (self.right instanceof AST_String
+            && self.right.getValue() == ""
+            && self.left.is_string(compressor)) {
+            return self.left;
+        }
+        if (self.left instanceof AST_String
+            && self.left.getValue() == ""
+            && self.right.is_string(compressor)) {
+            return self.right;
+        }
+        if (self.left instanceof AST_Binary
+            && self.left.operator == "+"
+            && self.left.left instanceof AST_String
+            && self.left.left.getValue() == ""
+            && self.right.is_string(compressor)) {
+            self.left = self.left.right;
+            return self;
+        }
+    }
+    if (compressor.option("evaluate")) {
+        switch (self.operator) {
+          case "&&":
+            var ll = has_flag(self.left, TRUTHY)
+                ? true
+                : has_flag(self.left, FALSY)
+                    ? false
+                    : self.left.evaluate(compressor);
+            if (!ll) {
+                return maintain_this_binding(compressor.parent(), compressor.self(), self.left).optimize(compressor);
+            } else if (!(ll instanceof AST_Node)) {
+                return make_sequence(self, [ self.left, self.right ]).optimize(compressor);
+            }
+            var rr = self.right.evaluate(compressor);
+            if (!rr) {
+                if (compressor.in_boolean_context()) {
+                    return make_sequence(self, [
+                        self.left,
+                        make_node(AST_False, self)
+                    ]).optimize(compressor);
+                } else {
+                    set_flag(self, FALSY);
+                }
+            } else if (!(rr instanceof AST_Node)) {
+                var parent = compressor.parent();
+                if (parent.operator == "&&" && parent.left === compressor.self() || compressor.in_boolean_context()) {
+                    return self.left.optimize(compressor);
+                }
+            }
+            // x || false && y ---> x ? y : false
+            if (self.left.operator == "||") {
+                var lr = self.left.right.evaluate(compressor);
+                if (!lr) return make_node(AST_Conditional, self, {
+                    condition: self.left.left,
+                    consequent: self.right,
+                    alternative: self.left.right
+                }).optimize(compressor);
+            }
+            break;
+          case "||":
+            var ll = has_flag(self.left, TRUTHY)
+              ? true
+              : has_flag(self.left, FALSY)
+                ? false
+                : self.left.evaluate(compressor);
+            if (!ll) {
+                return make_sequence(self, [ self.left, self.right ]).optimize(compressor);
+            } else if (!(ll instanceof AST_Node)) {
+                return maintain_this_binding(compressor.parent(), compressor.self(), self.left).optimize(compressor);
+            }
+            var rr = self.right.evaluate(compressor);
+            if (!rr) {
+                var parent = compressor.parent();
+                if (parent.operator == "||" && parent.left === compressor.self() || compressor.in_boolean_context()) {
+                    return self.left.optimize(compressor);
+                }
+            } else if (!(rr instanceof AST_Node)) {
+                if (compressor.in_boolean_context()) {
+                    return make_sequence(self, [
+                        self.left,
+                        make_node(AST_True, self)
+                    ]).optimize(compressor);
+                } else {
+                    set_flag(self, TRUTHY);
+                }
+            }
+            if (self.left.operator == "&&") {
+                var lr = self.left.right.evaluate(compressor);
+                if (lr && !(lr instanceof AST_Node)) return make_node(AST_Conditional, self, {
+                    condition: self.left.left,
+                    consequent: self.left.right,
+                    alternative: self.right
+                }).optimize(compressor);
+            }
+            break;
+          case "??":
+            if (is_nullish(self.left, compressor)) {
+                return self.right;
+            }
+
+            var ll = self.left.evaluate(compressor);
+            if (!(ll instanceof AST_Node)) {
+                // if we know the value for sure we can simply compute right away.
+                return ll == null ? self.right : self.left;
+            }
+
+            if (compressor.in_boolean_context()) {
+                const rr = self.right.evaluate(compressor);
+                if (!(rr instanceof AST_Node) && !rr) {
+                    return self.left;
+                }
+            }
+        }
+        var associative = true;
+        switch (self.operator) {
+          case "+":
+            // (x + "foo") + "bar" => x + "foobar"
+            if (self.right instanceof AST_Constant
+                && self.left instanceof AST_Binary
+                && self.left.operator == "+"
+                && self.left.is_string(compressor)) {
+                var binary = make_node(AST_Binary, self, {
+                    operator: "+",
+                    left: self.left.right,
+                    right: self.right,
+                });
+                var r = binary.optimize(compressor);
+                if (binary !== r) {
+                    self = make_node(AST_Binary, self, {
+                        operator: "+",
+                        left: self.left.left,
+                        right: r
+                    });
+                }
+            }
+            // (x + "foo") + ("bar" + y) => (x + "foobar") + y
+            if (self.left instanceof AST_Binary
+                && self.left.operator == "+"
+                && self.left.is_string(compressor)
+                && self.right instanceof AST_Binary
+                && self.right.operator == "+"
+                && self.right.is_string(compressor)) {
+                var binary = make_node(AST_Binary, self, {
+                    operator: "+",
+                    left: self.left.right,
+                    right: self.right.left,
+                });
+                var m = binary.optimize(compressor);
+                if (binary !== m) {
+                    self = make_node(AST_Binary, self, {
+                        operator: "+",
+                        left: make_node(AST_Binary, self.left, {
+                            operator: "+",
+                            left: self.left.left,
+                            right: m
+                        }),
+                        right: self.right.right
+                    });
+                }
+            }
+            // a + -b => a - b
+            if (self.right instanceof AST_UnaryPrefix
+                && self.right.operator == "-"
+                && self.left.is_number(compressor)) {
+                self = make_node(AST_Binary, self, {
+                    operator: "-",
+                    left: self.left,
+                    right: self.right.expression
+                });
+                break;
+            }
+            // -a + b => b - a
+            if (self.left instanceof AST_UnaryPrefix
+                && self.left.operator == "-"
+                && reversible()
+                && self.right.is_number(compressor)) {
+                self = make_node(AST_Binary, self, {
+                    operator: "-",
+                    left: self.right,
+                    right: self.left.expression
+                });
+                break;
+            }
+            // `foo${bar}baz` + 1 => `foo${bar}baz1`
+            if (self.left instanceof AST_TemplateString) {
+                var l = self.left;
+                var r = self.right.evaluate(compressor);
+                if (r != self.right) {
+                    l.segments[l.segments.length - 1].value += String(r);
+                    return l;
+                }
+            }
+            // 1 + `foo${bar}baz` => `1foo${bar}baz`
+            if (self.right instanceof AST_TemplateString) {
+                var r = self.right;
+                var l = self.left.evaluate(compressor);
+                if (l != self.left) {
+                    r.segments[0].value = String(l) + r.segments[0].value;
+                    return r;
+                }
+            }
+            // `1${bar}2` + `foo${bar}baz` => `1${bar}2foo${bar}baz`
+            if (self.left instanceof AST_TemplateString
+                && self.right instanceof AST_TemplateString) {
+                var l = self.left;
+                var segments = l.segments;
+                var r = self.right;
+                segments[segments.length - 1].value += r.segments[0].value;
+                for (var i = 1; i < r.segments.length; i++) {
+                    segments.push(r.segments[i]);
+                }
+                return l;
+            }
+          case "*":
+            associative = compressor.option("unsafe_math");
+          case "&":
+          case "|":
+          case "^":
+            // a + +b => +b + a
+            if (self.left.is_number(compressor)
+                && self.right.is_number(compressor)
+                && reversible()
+                && !(self.left instanceof AST_Binary
+                    && self.left.operator != self.operator
+                    && PRECEDENCE[self.left.operator] >= PRECEDENCE[self.operator])) {
+                var reversed = make_node(AST_Binary, self, {
+                    operator: self.operator,
+                    left: self.right,
+                    right: self.left
+                });
+                if (self.right instanceof AST_Constant
+                    && !(self.left instanceof AST_Constant)) {
+                    self = best_of(compressor, reversed, self);
+                } else {
+                    self = best_of(compressor, self, reversed);
+                }
+            }
+            if (associative && self.is_number(compressor)) {
+                // a + (b + c) => (a + b) + c
+                if (self.right instanceof AST_Binary
+                    && self.right.operator == self.operator) {
+                    self = make_node(AST_Binary, self, {
+                        operator: self.operator,
+                        left: make_node(AST_Binary, self.left, {
+                            operator: self.operator,
+                            left: self.left,
+                            right: self.right.left,
+                            start: self.left.start,
+                            end: self.right.left.end
+                        }),
+                        right: self.right.right
+                    });
+                }
+                // (n + 2) + 3 => 5 + n
+                // (2 * n) * 3 => 6 + n
+                if (self.right instanceof AST_Constant
+                    && self.left instanceof AST_Binary
+                    && self.left.operator == self.operator) {
+                    if (self.left.left instanceof AST_Constant) {
+                        self = make_node(AST_Binary, self, {
+                            operator: self.operator,
+                            left: make_node(AST_Binary, self.left, {
+                                operator: self.operator,
+                                left: self.left.left,
+                                right: self.right,
+                                start: self.left.left.start,
+                                end: self.right.end
+                            }),
+                            right: self.left.right
+                        });
+                    } else if (self.left.right instanceof AST_Constant) {
+                        self = make_node(AST_Binary, self, {
+                            operator: self.operator,
+                            left: make_node(AST_Binary, self.left, {
+                                operator: self.operator,
+                                left: self.left.right,
+                                right: self.right,
+                                start: self.left.right.start,
+                                end: self.right.end
+                            }),
+                            right: self.left.left
+                        });
+                    }
+                }
+                // (a | 1) | (2 | d) => (3 | a) | b
+                if (self.left instanceof AST_Binary
+                    && self.left.operator == self.operator
+                    && self.left.right instanceof AST_Constant
+                    && self.right instanceof AST_Binary
+                    && self.right.operator == self.operator
+                    && self.right.left instanceof AST_Constant) {
+                    self = make_node(AST_Binary, self, {
+                        operator: self.operator,
+                        left: make_node(AST_Binary, self.left, {
+                            operator: self.operator,
+                            left: make_node(AST_Binary, self.left.left, {
+                                operator: self.operator,
+                                left: self.left.right,
+                                right: self.right.left,
+                                start: self.left.right.start,
+                                end: self.right.left.end
+                            }),
+                            right: self.left.left
+                        }),
+                        right: self.right.right
+                    });
+                }
+            }
+        }
+    }
+    // x && (y && z)  ==>  x && y && z
+    // x || (y || z)  ==>  x || y || z
+    // x + ("y" + z)  ==>  x + "y" + z
+    // "x" + (y + "z")==>  "x" + y + "z"
+    if (self.right instanceof AST_Binary
+        && self.right.operator == self.operator
+        && (lazy_op.has(self.operator)
+            || (self.operator == "+"
+                && (self.right.left.is_string(compressor)
+                    || (self.left.is_string(compressor)
+                        && self.right.right.is_string(compressor)))))
+    ) {
+        self.left = make_node(AST_Binary, self.left, {
+            operator : self.operator,
+            left     : self.left.transform(compressor),
+            right    : self.right.left.transform(compressor)
+        });
+        self.right = self.right.right.transform(compressor);
+        return self.transform(compressor);
+    }
+    var ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+    return self;
+});
+
+def_optimize(AST_SymbolExport, function(self) {
+    return self;
+});
+
+function within_array_or_object_literal(compressor) {
+    var node, level = 0;
+    while (node = compressor.parent(level++)) {
+        if (node instanceof AST_Statement) return false;
+        if (node instanceof AST_Array
+            || node instanceof AST_ObjectKeyVal
+            || node instanceof AST_Object) {
+            return true;
+        }
+    }
+    return false;
+}
+
+def_optimize(AST_SymbolRef, function(self, compressor) {
+    if (
+        !compressor.option("ie8")
+        && is_undeclared_ref(self)
+        && !compressor.find_parent(AST_With)
+    ) {
+        switch (self.name) {
+          case "undefined":
+            return make_node(AST_Undefined, self).optimize(compressor);
+          case "NaN":
+            return make_node(AST_NaN, self).optimize(compressor);
+          case "Infinity":
+            return make_node(AST_Infinity, self).optimize(compressor);
+        }
+    }
+
+    const parent = compressor.parent();
+    if (compressor.option("reduce_vars") && is_lhs(self, parent) !== self) {
+        const def = self.definition();
+        const nearest_scope = find_scope(compressor);
+        if (compressor.top_retain && def.global && compressor.top_retain(def)) {
+            def.fixed = false;
+            def.single_use = false;
+            return self;
+        }
+
+        let fixed = self.fixed_value();
+        let single_use = def.single_use
+            && !(parent instanceof AST_Call
+                && (parent.is_callee_pure(compressor))
+                    || has_annotation(parent, _NOINLINE))
+            && !(parent instanceof AST_Export
+                && fixed instanceof AST_Lambda
+                && fixed.name);
+
+        if (single_use && fixed instanceof AST_Node) {
+            single_use =
+                !fixed.has_side_effects(compressor)
+                && !fixed.may_throw(compressor);
+        }
+
+        if (single_use && (fixed instanceof AST_Lambda || fixed instanceof AST_Class)) {
+            if (retain_top_func(fixed, compressor)) {
+                single_use = false;
+            } else if (def.scope !== self.scope
+                && (def.escaped == 1
+                    || has_flag(fixed, INLINED)
+                    || within_array_or_object_literal(compressor)
+                    || !compressor.option("reduce_funcs"))) {
+                single_use = false;
+            } else if (is_recursive_ref(compressor, def)) {
+                single_use = false;
+            } else if (def.scope !== self.scope || def.orig[0] instanceof AST_SymbolFunarg) {
+                single_use = fixed.is_constant_expression(self.scope);
+                if (single_use == "f") {
+                    var scope = self.scope;
+                    do {
+                        if (scope instanceof AST_Defun || is_func_expr(scope)) {
+                            set_flag(scope, INLINED);
+                        }
+                    } while (scope = scope.parent_scope);
+                }
+            }
+        }
+
+        if (single_use && fixed instanceof AST_Lambda) {
+            single_use =
+                def.scope === self.scope
+                    && !scope_encloses_variables_in_this_scope(nearest_scope, fixed)
+                || parent instanceof AST_Call
+                    && parent.expression === self
+                    && !scope_encloses_variables_in_this_scope(nearest_scope, fixed)
+                    && !(fixed.name && fixed.name.definition().recursive_refs > 0);
+        }
+
+        if (single_use && fixed) {
+            if (fixed instanceof AST_DefClass) {
+                set_flag(fixed, SQUEEZED);
+                fixed = make_node(AST_ClassExpression, fixed, fixed);
+            }
+            if (fixed instanceof AST_Defun) {
+                set_flag(fixed, SQUEEZED);
+                fixed = make_node(AST_Function, fixed, fixed);
+            }
+            if (def.recursive_refs > 0 && fixed.name instanceof AST_SymbolDefun) {
+                const defun_def = fixed.name.definition();
+                let lambda_def = fixed.variables.get(fixed.name.name);
+                let name = lambda_def && lambda_def.orig[0];
+                if (!(name instanceof AST_SymbolLambda)) {
+                    name = make_node(AST_SymbolLambda, fixed.name, fixed.name);
+                    name.scope = fixed;
+                    fixed.name = name;
+                    lambda_def = fixed.def_function(name);
+                }
+                walk(fixed, node => {
+                    if (node instanceof AST_SymbolRef && node.definition() === defun_def) {
+                        node.thedef = lambda_def;
+                        lambda_def.references.push(node);
+                    }
+                });
+            }
+            if (
+                (fixed instanceof AST_Lambda || fixed instanceof AST_Class)
+                && fixed.parent_scope !== nearest_scope
+            ) {
+                fixed = fixed.clone(true, compressor.get_toplevel());
+
+                nearest_scope.add_child_scope(fixed);
+            }
+            return fixed.optimize(compressor);
+        }
+
+        // multiple uses
+        if (fixed) {
+            let replace;
+
+            if (fixed instanceof AST_This) {
+                if (!(def.orig[0] instanceof AST_SymbolFunarg)
+                    && def.references.every((ref) =>
+                        def.scope === ref.scope
+                    )) {
+                    replace = fixed;
+                }
+            } else {
+                var ev = fixed.evaluate(compressor);
+                if (
+                    ev !== fixed
+                    && (compressor.option("unsafe_regexp") || !(ev instanceof RegExp))
+                ) {
+                    replace = make_node_from_constant(ev, fixed);
+                }
+            }
+
+            if (replace) {
+                const name_length = self.size(compressor);
+                const replace_size = replace.size(compressor);
+
+                let overhead = 0;
+                if (compressor.option("unused") && !compressor.exposed(def)) {
+                    overhead =
+                        (name_length + 2 + replace_size) /
+                        (def.references.length - def.assignments);
+                }
+
+                if (replace_size <= name_length + overhead) {
+                    return replace;
+                }
+            }
+        }
+    }
+
+    return self;
+});
+
+function scope_encloses_variables_in_this_scope(scope, pulled_scope) {
+    for (const enclosed of pulled_scope.enclosed) {
+        if (pulled_scope.variables.has(enclosed.name)) {
+            continue;
+        }
+        const looked_up = scope.find_variable(enclosed.name);
+        if (looked_up) {
+            if (looked_up === enclosed) continue;
+            return true;
+        }
+    }
+    return false;
+}
+
+function is_atomic(lhs, self) {
+    return lhs instanceof AST_SymbolRef || lhs.TYPE === self.TYPE;
+}
+
+def_optimize(AST_Undefined, function(self, compressor) {
+    if (compressor.option("unsafe_undefined")) {
+        var undef = find_variable(compressor, "undefined");
+        if (undef) {
+            var ref = make_node(AST_SymbolRef, self, {
+                name   : "undefined",
+                scope  : undef.scope,
+                thedef : undef
+            });
+            set_flag(ref, UNDEFINED);
+            return ref;
+        }
+    }
+    var lhs = is_lhs(compressor.self(), compressor.parent());
+    if (lhs && is_atomic(lhs, self)) return self;
+    return make_node(AST_UnaryPrefix, self, {
+        operator: "void",
+        expression: make_node(AST_Number, self, {
+            value: 0
+        })
+    });
+});
+
+def_optimize(AST_Infinity, function(self, compressor) {
+    var lhs = is_lhs(compressor.self(), compressor.parent());
+    if (lhs && is_atomic(lhs, self)) return self;
+    if (
+        compressor.option("keep_infinity")
+        && !(lhs && !is_atomic(lhs, self))
+        && !find_variable(compressor, "Infinity")
+    ) {
+        return self;
+    }
+    return make_node(AST_Binary, self, {
+        operator: "/",
+        left: make_node(AST_Number, self, {
+            value: 1
+        }),
+        right: make_node(AST_Number, self, {
+            value: 0
+        })
+    });
+});
+
+def_optimize(AST_NaN, function(self, compressor) {
+    var lhs = is_lhs(compressor.self(), compressor.parent());
+    if (lhs && !is_atomic(lhs, self)
+        || find_variable(compressor, "NaN")) {
+        return make_node(AST_Binary, self, {
+            operator: "/",
+            left: make_node(AST_Number, self, {
+                value: 0
+            }),
+            right: make_node(AST_Number, self, {
+                value: 0
+            })
+        });
+    }
+    return self;
+});
+
+function is_reachable(self, defs) {
+    const find_ref = node => {
+        if (node instanceof AST_SymbolRef && member(node.definition(), defs)) {
+            return walk_abort;
+        }
+    };
+
+    return walk_parent(self, (node, info) => {
+        if (node instanceof AST_Scope && node !== self) {
+            var parent = info.parent();
+
+            if (
+                parent instanceof AST_Call
+                && parent.expression === node
+                // Async/Generators aren't guaranteed to sync evaluate all of
+                // their body steps, so it's possible they close over the variable.
+                && !(node.async || node.is_generator)
+            ) {
+                return;
+            }
+
+            if (walk(node, find_ref)) return walk_abort;
+
+            return true;
+        }
+    });
+}
+
+const ASSIGN_OPS = makePredicate("+ - / * % >> << >>> | ^ &");
+const ASSIGN_OPS_COMMUTATIVE = makePredicate("* | ^ &");
+def_optimize(AST_Assign, function(self, compressor) {
+    if (self.logical) {
+        return self.lift_sequences(compressor);
+    }
+
+    var def;
+    if (compressor.option("dead_code")
+        && self.left instanceof AST_SymbolRef
+        && (def = self.left.definition()).scope === compressor.find_parent(AST_Lambda)) {
+        var level = 0, node, parent = self;
+        do {
+            node = parent;
+            parent = compressor.parent(level++);
+            if (parent instanceof AST_Exit) {
+                if (in_try(level, parent)) break;
+                if (is_reachable(def.scope, [ def ])) break;
+                if (self.operator == "=") return self.right;
+                def.fixed = false;
+                return make_node(AST_Binary, self, {
+                    operator: self.operator.slice(0, -1),
+                    left: self.left,
+                    right: self.right
+                }).optimize(compressor);
+            }
+        } while (parent instanceof AST_Binary && parent.right === node
+            || parent instanceof AST_Sequence && parent.tail_node() === node);
+    }
+    self = self.lift_sequences(compressor);
+    if (self.operator == "=" && self.left instanceof AST_SymbolRef && self.right instanceof AST_Binary) {
+        // x = expr1 OP expr2
+        if (self.right.left instanceof AST_SymbolRef
+            && self.right.left.name == self.left.name
+            && ASSIGN_OPS.has(self.right.operator)) {
+            // x = x - 2  --->  x -= 2
+            self.operator = self.right.operator + "=";
+            self.right = self.right.right;
+        } else if (self.right.right instanceof AST_SymbolRef
+            && self.right.right.name == self.left.name
+            && ASSIGN_OPS_COMMUTATIVE.has(self.right.operator)
+            && !self.right.left.has_side_effects(compressor)) {
+            // x = 2 & x  --->  x &= 2
+            self.operator = self.right.operator + "=";
+            self.right = self.right.left;
+        }
+    }
+    return self;
+
+    function in_try(level, node) {
+        var right = self.right;
+        self.right = make_node(AST_Null, right);
+        var may_throw = node.may_throw(compressor);
+        self.right = right;
+        var scope = self.left.definition().scope;
+        var parent;
+        while ((parent = compressor.parent(level++)) !== scope) {
+            if (parent instanceof AST_Try) {
+                if (parent.bfinally) return true;
+                if (may_throw && parent.bcatch) return true;
+            }
+        }
+    }
+});
+
+def_optimize(AST_DefaultAssign, function(self, compressor) {
+    if (!compressor.option("evaluate")) {
+        return self;
+    }
+    var evaluateRight = self.right.evaluate(compressor);
+
+    // `[x = undefined] = foo` ---> `[x] = foo`
+    if (evaluateRight === undefined) {
+        self = self.left;
+    } else if (evaluateRight !== self.right) {
+        evaluateRight = make_node_from_constant(evaluateRight, self.right);
+        self.right = best_of_expression(evaluateRight, self.right);
+    }
+
+    return self;
+});
+
+function is_nullish_check(check, check_subject, compressor) {
+    if (check_subject.may_throw(compressor)) return false;
+
+    let nullish_side;
+
+    // foo == null
+    if (
+        check instanceof AST_Binary
+        && check.operator === "=="
+        // which side is nullish?
+        && (
+            (nullish_side = is_nullish(check.left, compressor) && check.left)
+            || (nullish_side = is_nullish(check.right, compressor) && check.right)
+        )
+        // is the other side the same as the check_subject
+        && (
+            nullish_side === check.left
+                ? check.right
+                : check.left
+        ).equivalent_to(check_subject)
+    ) {
+        return true;
+    }
+
+    // foo === null || foo === undefined
+    if (check instanceof AST_Binary && check.operator === "||") {
+        let null_cmp;
+        let undefined_cmp;
+
+        const find_comparison = cmp => {
+            if (!(
+                cmp instanceof AST_Binary
+                && (cmp.operator === "===" || cmp.operator === "==")
+            )) {
+                return false;
+            }
+
+            let found = 0;
+            let defined_side;
+
+            if (cmp.left instanceof AST_Null) {
+                found++;
+                null_cmp = cmp;
+                defined_side = cmp.right;
+            }
+            if (cmp.right instanceof AST_Null) {
+                found++;
+                null_cmp = cmp;
+                defined_side = cmp.left;
+            }
+            if (is_undefined(cmp.left, compressor)) {
+                found++;
+                undefined_cmp = cmp;
+                defined_side = cmp.right;
+            }
+            if (is_undefined(cmp.right, compressor)) {
+                found++;
+                undefined_cmp = cmp;
+                defined_side = cmp.left;
+            }
+
+            if (found !== 1) {
+                return false;
+            }
+
+            if (!defined_side.equivalent_to(check_subject)) {
+                return false;
+            }
+
+            return true;
+        };
+
+        if (!find_comparison(check.left)) return false;
+        if (!find_comparison(check.right)) return false;
+
+        if (null_cmp && undefined_cmp && null_cmp !== undefined_cmp) {
+            return true;
+        }
+    }
+
+    return false;
+}
+
+def_optimize(AST_Conditional, function(self, compressor) {
+    if (!compressor.option("conditionals")) return self;
+    // This looks like lift_sequences(), should probably be under "sequences"
+    if (self.condition instanceof AST_Sequence) {
+        var expressions = self.condition.expressions.slice();
+        self.condition = expressions.pop();
+        expressions.push(self);
+        return make_sequence(self, expressions);
+    }
+    var cond = self.condition.evaluate(compressor);
+    if (cond !== self.condition) {
+        if (cond) {
+            return maintain_this_binding(compressor.parent(), compressor.self(), self.consequent);
+        } else {
+            return maintain_this_binding(compressor.parent(), compressor.self(), self.alternative);
+        }
+    }
+    var negated = cond.negate(compressor, first_in_statement(compressor));
+    if (best_of(compressor, cond, negated) === negated) {
+        self = make_node(AST_Conditional, self, {
+            condition: negated,
+            consequent: self.alternative,
+            alternative: self.consequent
+        });
+    }
+    var condition = self.condition;
+    var consequent = self.consequent;
+    var alternative = self.alternative;
+    // x?x:y --> x||y
+    if (condition instanceof AST_SymbolRef
+        && consequent instanceof AST_SymbolRef
+        && condition.definition() === consequent.definition()) {
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: condition,
+            right: alternative
+        });
+    }
+    // if (foo) exp = something; else exp = something_else;
+    //                   |
+    //                   v
+    // exp = foo ? something : something_else;
+    if (
+        consequent instanceof AST_Assign
+        && alternative instanceof AST_Assign
+        && consequent.operator === alternative.operator
+        && consequent.logical === alternative.logical
+        && consequent.left.equivalent_to(alternative.left)
+        && (!self.condition.has_side_effects(compressor)
+            || consequent.operator == "="
+                && !consequent.left.has_side_effects(compressor))
+    ) {
+        return make_node(AST_Assign, self, {
+            operator: consequent.operator,
+            left: consequent.left,
+            logical: consequent.logical,
+            right: make_node(AST_Conditional, self, {
+                condition: self.condition,
+                consequent: consequent.right,
+                alternative: alternative.right
+            })
+        });
+    }
+    // x ? y(a) : y(b) --> y(x ? a : b)
+    var arg_index;
+    if (consequent instanceof AST_Call
+        && alternative.TYPE === consequent.TYPE
+        && consequent.args.length > 0
+        && consequent.args.length == alternative.args.length
+        && consequent.expression.equivalent_to(alternative.expression)
+        && !self.condition.has_side_effects(compressor)
+        && !consequent.expression.has_side_effects(compressor)
+        && typeof (arg_index = single_arg_diff()) == "number") {
+        var node = consequent.clone();
+        node.args[arg_index] = make_node(AST_Conditional, self, {
+            condition: self.condition,
+            consequent: consequent.args[arg_index],
+            alternative: alternative.args[arg_index]
+        });
+        return node;
+    }
+    // a ? b : c ? b : d --> (a || c) ? b : d
+    if (alternative instanceof AST_Conditional
+        && consequent.equivalent_to(alternative.consequent)) {
+        return make_node(AST_Conditional, self, {
+            condition: make_node(AST_Binary, self, {
+                operator: "||",
+                left: condition,
+                right: alternative.condition
+            }),
+            consequent: consequent,
+            alternative: alternative.alternative
+        }).optimize(compressor);
+    }
+
+    // a == null ? b : a -> a ?? b
+    if (
+        compressor.option("ecma") >= 2020 &&
+        is_nullish_check(condition, alternative, compressor)
+    ) {
+        return make_node(AST_Binary, self, {
+            operator: "??",
+            left: alternative,
+            right: consequent
+        }).optimize(compressor);
+    }
+
+    // a ? b : (c, b) --> (a || c), b
+    if (alternative instanceof AST_Sequence
+        && consequent.equivalent_to(alternative.expressions[alternative.expressions.length - 1])) {
+        return make_sequence(self, [
+            make_node(AST_Binary, self, {
+                operator: "||",
+                left: condition,
+                right: make_sequence(self, alternative.expressions.slice(0, -1))
+            }),
+            consequent
+        ]).optimize(compressor);
+    }
+    // a ? b : (c && b) --> (a || c) && b
+    if (alternative instanceof AST_Binary
+        && alternative.operator == "&&"
+        && consequent.equivalent_to(alternative.right)) {
+        return make_node(AST_Binary, self, {
+            operator: "&&",
+            left: make_node(AST_Binary, self, {
+                operator: "||",
+                left: condition,
+                right: alternative.left
+            }),
+            right: consequent
+        }).optimize(compressor);
+    }
+    // x?y?z:a:a --> x&&y?z:a
+    if (consequent instanceof AST_Conditional
+        && consequent.alternative.equivalent_to(alternative)) {
+        return make_node(AST_Conditional, self, {
+            condition: make_node(AST_Binary, self, {
+                left: self.condition,
+                operator: "&&",
+                right: consequent.condition
+            }),
+            consequent: consequent.consequent,
+            alternative: alternative
+        });
+    }
+    // x ? y : y --> x, y
+    if (consequent.equivalent_to(alternative)) {
+        return make_sequence(self, [
+            self.condition,
+            consequent
+        ]).optimize(compressor);
+    }
+    // x ? y || z : z --> x && y || z
+    if (consequent instanceof AST_Binary
+        && consequent.operator == "||"
+        && consequent.right.equivalent_to(alternative)) {
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: make_node(AST_Binary, self, {
+                operator: "&&",
+                left: self.condition,
+                right: consequent.left
+            }),
+            right: alternative
+        }).optimize(compressor);
+    }
+
+    const in_bool = compressor.in_boolean_context();
+    if (is_true(self.consequent)) {
+        if (is_false(self.alternative)) {
+            // c ? true : false ---> !!c
+            return booleanize(self.condition);
+        }
+        // c ? true : x ---> !!c || x
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: booleanize(self.condition),
+            right: self.alternative
+        });
+    }
+    if (is_false(self.consequent)) {
+        if (is_true(self.alternative)) {
+            // c ? false : true ---> !c
+            return booleanize(self.condition.negate(compressor));
+        }
+        // c ? false : x ---> !c && x
+        return make_node(AST_Binary, self, {
+            operator: "&&",
+            left: booleanize(self.condition.negate(compressor)),
+            right: self.alternative
+        });
+    }
+    if (is_true(self.alternative)) {
+        // c ? x : true ---> !c || x
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: booleanize(self.condition.negate(compressor)),
+            right: self.consequent
+        });
+    }
+    if (is_false(self.alternative)) {
+        // c ? x : false ---> !!c && x
+        return make_node(AST_Binary, self, {
+            operator: "&&",
+            left: booleanize(self.condition),
+            right: self.consequent
+        });
+    }
+
+    return self;
+
+    function booleanize(node) {
+        if (node.is_boolean()) return node;
+        // !!expression
+        return make_node(AST_UnaryPrefix, node, {
+            operator: "!",
+            expression: node.negate(compressor)
+        });
+    }
+
+    // AST_True or !0
+    function is_true(node) {
+        return node instanceof AST_True
+            || in_bool
+                && node instanceof AST_Constant
+                && node.getValue()
+            || (node instanceof AST_UnaryPrefix
+                && node.operator == "!"
+                && node.expression instanceof AST_Constant
+                && !node.expression.getValue());
+    }
+    // AST_False or !1
+    function is_false(node) {
+        return node instanceof AST_False
+            || in_bool
+                && node instanceof AST_Constant
+                && !node.getValue()
+            || (node instanceof AST_UnaryPrefix
+                && node.operator == "!"
+                && node.expression instanceof AST_Constant
+                && node.expression.getValue());
+    }
+
+    function single_arg_diff() {
+        var a = consequent.args;
+        var b = alternative.args;
+        for (var i = 0, len = a.length; i < len; i++) {
+            if (a[i] instanceof AST_Expansion) return;
+            if (!a[i].equivalent_to(b[i])) {
+                if (b[i] instanceof AST_Expansion) return;
+                for (var j = i + 1; j < len; j++) {
+                    if (a[j] instanceof AST_Expansion) return;
+                    if (!a[j].equivalent_to(b[j])) return;
+                }
+                return i;
+            }
+        }
+    }
+});
+
+def_optimize(AST_Boolean, function(self, compressor) {
+    if (compressor.in_boolean_context()) return make_node(AST_Number, self, {
+        value: +self.value
+    });
+    var p = compressor.parent();
+    if (compressor.option("booleans_as_integers")) {
+        if (p instanceof AST_Binary && (p.operator == "===" || p.operator == "!==")) {
+            p.operator = p.operator.replace(/=$/, "");
+        }
+        return make_node(AST_Number, self, {
+            value: +self.value
+        });
+    }
+    if (compressor.option("booleans")) {
+        if (p instanceof AST_Binary && (p.operator == "=="
+                                        || p.operator == "!=")) {
+            return make_node(AST_Number, self, {
+                value: +self.value
+            });
+        }
+        return make_node(AST_UnaryPrefix, self, {
+            operator: "!",
+            expression: make_node(AST_Number, self, {
+                value: 1 - self.value
+            })
+        });
+    }
+    return self;
+});
+
+function safe_to_flatten(value, compressor) {
+    if (value instanceof AST_SymbolRef) {
+        value = value.fixed_value();
+    }
+    if (!value) return false;
+    if (!(value instanceof AST_Lambda || value instanceof AST_Class)) return true;
+    if (!(value instanceof AST_Lambda && value.contains_this())) return true;
+    return compressor.parent() instanceof AST_New;
+}
+
+AST_PropAccess.DEFMETHOD("flatten_object", function(key, compressor) {
+    if (!compressor.option("properties")) return;
+    if (key === "__proto__") return;
+
+    var arrows = compressor.option("unsafe_arrows") && compressor.option("ecma") >= 2015;
+    var expr = this.expression;
+    if (expr instanceof AST_Object) {
+        var props = expr.properties;
+
+        for (var i = props.length; --i >= 0;) {
+            var prop = props[i];
+
+            if ("" + (prop instanceof AST_ConciseMethod ? prop.key.name : prop.key) == key) {
+                const all_props_flattenable = props.every((p) =>
+                    (p instanceof AST_ObjectKeyVal
+                        || arrows && p instanceof AST_ConciseMethod && !p.is_generator
+                    )
+                    && !p.computed_key()
+                );
+
+                if (!all_props_flattenable) return;
+                if (!safe_to_flatten(prop.value, compressor)) return;
+
+                return make_node(AST_Sub, this, {
+                    expression: make_node(AST_Array, expr, {
+                        elements: props.map(function(prop) {
+                            var v = prop.value;
+                            if (v instanceof AST_Accessor) {
+                                v = make_node(AST_Function, v, v);
+                            }
+
+                            var k = prop.key;
+                            if (k instanceof AST_Node && !(k instanceof AST_SymbolMethod)) {
+                                return make_sequence(prop, [ k, v ]);
+                            }
+
+                            return v;
+                        })
+                    }),
+                    property: make_node(AST_Number, this, {
+                        value: i
+                    })
+                });
+            }
+        }
+    }
+});
+
+def_optimize(AST_Sub, function(self, compressor) {
+    var expr = self.expression;
+    var prop = self.property;
+    if (compressor.option("properties")) {
+        var key = prop.evaluate(compressor);
+        if (key !== prop) {
+            if (typeof key == "string") {
+                if (key == "undefined") {
+                    key = undefined;
+                } else {
+                    var value = parseFloat(key);
+                    if (value.toString() == key) {
+                        key = value;
+                    }
+                }
+            }
+            prop = self.property = best_of_expression(prop, make_node_from_constant(key, prop).transform(compressor));
+            var property = "" + key;
+            if (is_basic_identifier_string(property)
+                && property.length <= prop.size() + 1) {
+                return make_node(AST_Dot, self, {
+                    expression: expr,
+                    optional: self.optional,
+                    property: property,
+                    quote: prop.quote,
+                }).optimize(compressor);
+            }
+        }
+    }
+    var fn;
+    OPT_ARGUMENTS: if (compressor.option("arguments")
+        && expr instanceof AST_SymbolRef
+        && expr.name == "arguments"
+        && expr.definition().orig.length == 1
+        && (fn = expr.scope) instanceof AST_Lambda
+        && fn.uses_arguments
+        && !(fn instanceof AST_Arrow)
+        && prop instanceof AST_Number) {
+        var index = prop.getValue();
+        var params = new Set();
+        var argnames = fn.argnames;
+        for (var n = 0; n < argnames.length; n++) {
+            if (!(argnames[n] instanceof AST_SymbolFunarg)) {
+                break OPT_ARGUMENTS; // destructuring parameter - bail
+            }
+            var param = argnames[n].name;
+            if (params.has(param)) {
+                break OPT_ARGUMENTS; // duplicate parameter - bail
+            }
+            params.add(param);
+        }
+        var argname = fn.argnames[index];
+        if (argname && compressor.has_directive("use strict")) {
+            var def = argname.definition();
+            if (!compressor.option("reduce_vars") || def.assignments || def.orig.length > 1) {
+                argname = null;
+            }
+        } else if (!argname && !compressor.option("keep_fargs") && index < fn.argnames.length + 5) {
+            while (index >= fn.argnames.length) {
+                argname = fn.create_symbol(AST_SymbolFunarg, {
+                    source: fn,
+                    scope: fn,
+                    tentative_name: "argument_" + fn.argnames.length,
+                });
+                fn.argnames.push(argname);
+            }
+        }
+        if (argname) {
+            var sym = make_node(AST_SymbolRef, self, argname);
+            sym.reference({});
+            clear_flag(argname, UNUSED);
+            return sym;
+        }
+    }
+    if (is_lhs(self, compressor.parent())) return self;
+    if (key !== prop) {
+        var sub = self.flatten_object(property, compressor);
+        if (sub) {
+            expr = self.expression = sub.expression;
+            prop = self.property = sub.property;
+        }
+    }
+    if (compressor.option("properties") && compressor.option("side_effects")
+        && prop instanceof AST_Number && expr instanceof AST_Array) {
+        var index = prop.getValue();
+        var elements = expr.elements;
+        var retValue = elements[index];
+        FLATTEN: if (safe_to_flatten(retValue, compressor)) {
+            var flatten = true;
+            var values = [];
+            for (var i = elements.length; --i > index;) {
+                var value = elements[i].drop_side_effect_free(compressor);
+                if (value) {
+                    values.unshift(value);
+                    if (flatten && value.has_side_effects(compressor)) flatten = false;
+                }
+            }
+            if (retValue instanceof AST_Expansion) break FLATTEN;
+            retValue = retValue instanceof AST_Hole ? make_node(AST_Undefined, retValue) : retValue;
+            if (!flatten) values.unshift(retValue);
+            while (--i >= 0) {
+                var value = elements[i];
+                if (value instanceof AST_Expansion) break FLATTEN;
+                value = value.drop_side_effect_free(compressor);
+                if (value) values.unshift(value);
+                else index--;
+            }
+            if (flatten) {
+                values.push(retValue);
+                return make_sequence(self, values).optimize(compressor);
+            } else return make_node(AST_Sub, self, {
+                expression: make_node(AST_Array, expr, {
+                    elements: values
+                }),
+                property: make_node(AST_Number, prop, {
+                    value: index
+                })
+            });
+        }
+    }
+    var ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+    return self;
+});
+
+def_optimize(AST_Chain, function (self, compressor) {
+    if (is_nullish(self.expression, compressor)) {
+        let parent = compressor.parent();
+        // It's valid to delete a nullish optional chain, but if we optimized
+        // this to `delete undefined` then it would appear to be a syntax error
+        // when we try to optimize the delete. Thankfully, `delete 0` is fine.
+        if (parent instanceof AST_UnaryPrefix && parent.operator === "delete") {
+            return make_node_from_constant(0, self);
+        }
+        return make_node(AST_Undefined, self);
+    }
+    return self;
+});
+
+AST_Lambda.DEFMETHOD("contains_this", function() {
+    return walk(this, node => {
+        if (node instanceof AST_This) return walk_abort;
+        if (
+            node !== this
+            && node instanceof AST_Scope
+            && !(node instanceof AST_Arrow)
+        ) {
+            return true;
+        }
+    });
+});
+
+def_optimize(AST_Dot, function(self, compressor) {
+    const parent = compressor.parent();
+    if (is_lhs(self, parent)) return self;
+    if (compressor.option("unsafe_proto")
+        && self.expression instanceof AST_Dot
+        && self.expression.property == "prototype") {
+        var exp = self.expression.expression;
+        if (is_undeclared_ref(exp)) switch (exp.name) {
+          case "Array":
+            self.expression = make_node(AST_Array, self.expression, {
+                elements: []
+            });
+            break;
+          case "Function":
+            self.expression = make_node(AST_Function, self.expression, {
+                argnames: [],
+                body: []
+            });
+            break;
+          case "Number":
+            self.expression = make_node(AST_Number, self.expression, {
+                value: 0
+            });
+            break;
+          case "Object":
+            self.expression = make_node(AST_Object, self.expression, {
+                properties: []
+            });
+            break;
+          case "RegExp":
+            self.expression = make_node(AST_RegExp, self.expression, {
+                value: { source: "t", flags: "" }
+            });
+            break;
+          case "String":
+            self.expression = make_node(AST_String, self.expression, {
+                value: ""
+            });
+            break;
+        }
+    }
+    if (!(parent instanceof AST_Call) || !has_annotation(parent, _NOINLINE)) {
+        const sub = self.flatten_object(self.property, compressor);
+        if (sub) return sub.optimize(compressor);
+    }
+    let ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+    return self;
+});
+
+function literals_in_boolean_context(self, compressor) {
+    if (compressor.in_boolean_context()) {
+        return best_of(compressor, self, make_sequence(self, [
+            self,
+            make_node(AST_True, self)
+        ]).optimize(compressor));
+    }
+    return self;
+}
+
+function inline_array_like_spread(elements) {
+    for (var i = 0; i < elements.length; i++) {
+        var el = elements[i];
+        if (el instanceof AST_Expansion) {
+            var expr = el.expression;
+            if (
+                expr instanceof AST_Array
+                && !expr.elements.some(elm => elm instanceof AST_Hole)
+            ) {
+                elements.splice(i, 1, ...expr.elements);
+                // Step back one, as the element at i is now new.
+                i--;
+            }
+            // In array-like spread, spreading a non-iterable value is TypeError.
+            // We therefore can’t optimize anything else, unlike with object spread.
+        }
+    }
+}
+
+def_optimize(AST_Array, function(self, compressor) {
+    var optimized = literals_in_boolean_context(self, compressor);
+    if (optimized !== self) {
+        return optimized;
+    }
+    inline_array_like_spread(self.elements);
+    return self;
+});
+
+function inline_object_prop_spread(props, compressor) {
+    for (var i = 0; i < props.length; i++) {
+        var prop = props[i];
+        if (prop instanceof AST_Expansion) {
+            const expr = prop.expression;
+            if (
+                expr instanceof AST_Object
+                && expr.properties.every(prop => prop instanceof AST_ObjectKeyVal)
+            ) {
+                props.splice(i, 1, ...expr.properties);
+                // Step back one, as the property at i is now new.
+                i--;
+            } else if (expr instanceof AST_Constant
+                && !(expr instanceof AST_String)) {
+                // Unlike array-like spread, in object spread, spreading a
+                // non-iterable value silently does nothing; it is thus safe
+                // to remove. AST_String is the only iterable AST_Constant.
+                props.splice(i, 1);
+                i--;
+            } else if (is_nullish(expr, compressor)) {
+                // Likewise, null and undefined can be silently removed.
+                props.splice(i, 1);
+                i--;
+            }
+        }
+    }
+}
+
+def_optimize(AST_Object, function(self, compressor) {
+    var optimized = literals_in_boolean_context(self, compressor);
+    if (optimized !== self) {
+        return optimized;
+    }
+    inline_object_prop_spread(self.properties, compressor);
+    return self;
+});
+
+def_optimize(AST_RegExp, literals_in_boolean_context);
+
+def_optimize(AST_Return, function(self, compressor) {
+    if (self.value && is_undefined(self.value, compressor)) {
+        self.value = null;
+    }
+    return self;
+});
+
+def_optimize(AST_Arrow, opt_AST_Lambda);
+
+def_optimize(AST_Function, function(self, compressor) {
+    self = opt_AST_Lambda(self, compressor);
+    if (compressor.option("unsafe_arrows")
+        && compressor.option("ecma") >= 2015
+        && !self.name
+        && !self.is_generator
+        && !self.uses_arguments
+        && !self.pinned()) {
+        const uses_this = walk(self, node => {
+            if (node instanceof AST_This) return walk_abort;
+        });
+        if (!uses_this) return make_node(AST_Arrow, self, self).optimize(compressor);
+    }
+    return self;
+});
+
+def_optimize(AST_Class, function(self) {
+    // HACK to avoid compress failure.
+    // AST_Class is not really an AST_Scope/AST_Block as it lacks a body.
+    return self;
+});
+
+def_optimize(AST_Yield, function(self, compressor) {
+    if (self.expression && !self.is_star && is_undefined(self.expression, compressor)) {
+        self.expression = null;
+    }
+    return self;
+});
+
+def_optimize(AST_TemplateString, function(self, compressor) {
+    if (
+        !compressor.option("evaluate")
+        || compressor.parent() instanceof AST_PrefixedTemplateString
+    ) {
+        return self;
+    }
+
+    var segments = [];
+    for (var i = 0; i < self.segments.length; i++) {
+        var segment = self.segments[i];
+        if (segment instanceof AST_Node) {
+            var result = segment.evaluate(compressor);
+            // Evaluate to constant value
+            // Constant value shorter than ${segment}
+            if (result !== segment && (result + "").length <= segment.size() + "${}".length) {
+                // There should always be a previous and next segment if segment is a node
+                segments[segments.length - 1].value = segments[segments.length - 1].value + result + self.segments[++i].value;
+                continue;
+            }
+            // `before ${`innerBefore ${any} innerAfter`} after` => `before innerBefore ${any} innerAfter after`
+            // TODO:
+            // `before ${'test' + foo} after` => `before innerBefore ${any} innerAfter after`
+            // `before ${foo + 'test} after` => `before innerBefore ${any} innerAfter after`
+            if (segment instanceof AST_TemplateString) {
+                var inners = segment.segments;
+                segments[segments.length - 1].value += inners[0].value;
+                for (var j = 1; j < inners.length; j++) {
+                    segment = inners[j];
+                    segments.push(segment);
+                }
+                continue;
+            }
+        }
+        segments.push(segment);
+    }
+    self.segments = segments;
+
+    // `foo` => "foo"
+    if (segments.length == 1) {
+        return make_node(AST_String, self, segments[0]);
+    }
+
+    if (
+        segments.length === 3
+        && segments[1] instanceof AST_Node
+        && (
+            segments[1].is_string(compressor)
+            || segments[1].is_number(compressor)
+            || is_nullish(segments[1], compressor)
+            || compressor.option("unsafe")
+        )
+    ) {
+        // `foo${bar}` => "foo" + bar
+        if (segments[2].value === "") {
+            return make_node(AST_Binary, self, {
+                operator: "+",
+                left: make_node(AST_String, self, {
+                    value: segments[0].value,
+                }),
+                right: segments[1],
+            });
+        }
+        // `${bar}baz` => bar + "baz"
+        if (segments[0].value === "") {
+            return make_node(AST_Binary, self, {
+                operator: "+",
+                left: segments[1],
+                right: make_node(AST_String, self, {
+                    value: segments[2].value,
+                }),
+            });
+        }
+    }
+    return self;
+});
+
+def_optimize(AST_PrefixedTemplateString, function(self) {
+    return self;
+});
+
+// ["p"]:1 ---> p:1
+// [42]:1 ---> 42:1
+function lift_key(self, compressor) {
+    if (!compressor.option("computed_props")) return self;
+    // save a comparison in the typical case
+    if (!(self.key instanceof AST_Constant)) return self;
+    // allow certain acceptable props as not all AST_Constants are true constants
+    if (self.key instanceof AST_String || self.key instanceof AST_Number) {
+        if (self.key.value === "__proto__") return self;
+        if (self.key.value == "constructor"
+            && compressor.parent() instanceof AST_Class) return self;
+        if (self instanceof AST_ObjectKeyVal) {
+            self.quote = self.key.quote;
+            self.key = self.key.value;
+        } else if (self instanceof AST_ClassProperty) {
+            self.quote = self.key.quote;
+            self.key = make_node(AST_SymbolClassProperty, self.key, {
+                name: self.key.value
+            });
+        } else {
+            self.quote = self.key.quote;
+            self.key = make_node(AST_SymbolMethod, self.key, {
+                name: self.key.value
+            });
+        }
+    }
+    return self;
+}
+
+def_optimize(AST_ObjectProperty, lift_key);
+
+def_optimize(AST_ConciseMethod, function(self, compressor) {
+    lift_key(self, compressor);
+    // p(){return x;} ---> p:()=>x
+    if (compressor.option("arrows")
+        && compressor.parent() instanceof AST_Object
+        && !self.is_generator
+        && !self.value.uses_arguments
+        && !self.value.pinned()
+        && self.value.body.length == 1
+        && self.value.body[0] instanceof AST_Return
+        && self.value.body[0].value
+        && !self.value.contains_this()) {
+        var arrow = make_node(AST_Arrow, self.value, self.value);
+        arrow.async = self.async;
+        arrow.is_generator = self.is_generator;
+        return make_node(AST_ObjectKeyVal, self, {
+            key: self.key instanceof AST_SymbolMethod ? self.key.name : self.key,
+            value: arrow,
+            quote: self.quote,
+        });
+    }
+    return self;
+});
+
+def_optimize(AST_ObjectKeyVal, function(self, compressor) {
+    lift_key(self, compressor);
+    // p:function(){} ---> p(){}
+    // p:function*(){} ---> *p(){}
+    // p:async function(){} ---> async p(){}
+    // p:()=>{} ---> p(){}
+    // p:async()=>{} ---> async p(){}
+    var unsafe_methods = compressor.option("unsafe_methods");
+    if (unsafe_methods
+        && compressor.option("ecma") >= 2015
+        && (!(unsafe_methods instanceof RegExp) || unsafe_methods.test(self.key + ""))) {
+        var key = self.key;
+        var value = self.value;
+        var is_arrow_with_block = value instanceof AST_Arrow
+            && Array.isArray(value.body)
+            && !value.contains_this();
+        if ((is_arrow_with_block || value instanceof AST_Function) && !value.name) {
+            return make_node(AST_ConciseMethod, self, {
+                async: value.async,
+                is_generator: value.is_generator,
+                key: key instanceof AST_Node ? key : make_node(AST_SymbolMethod, self, {
+                    name: key,
+                }),
+                value: make_node(AST_Accessor, value, value),
+                quote: self.quote,
+            });
+        }
+    }
+    return self;
+});
+
+def_optimize(AST_Destructuring, function(self, compressor) {
+    if (compressor.option("pure_getters") == true
+        && compressor.option("unused")
+        && !self.is_array
+        && Array.isArray(self.names)
+        && !is_destructuring_export_decl(compressor)
+        && !(self.names[self.names.length - 1] instanceof AST_Expansion)) {
+        var keep = [];
+        for (var i = 0; i < self.names.length; i++) {
+            var elem = self.names[i];
+            if (!(elem instanceof AST_ObjectKeyVal
+                && typeof elem.key == "string"
+                && elem.value instanceof AST_SymbolDeclaration
+                && !should_retain(compressor, elem.value.definition()))) {
+                keep.push(elem);
+            }
+        }
+        if (keep.length != self.names.length) {
+            self.names = keep;
+        }
+    }
+    return self;
+
+    function is_destructuring_export_decl(compressor) {
+        var ancestors = [/^VarDef$/, /^(Const|Let|Var)$/, /^Export$/];
+        for (var a = 0, p = 0, len = ancestors.length; a < len; p++) {
+            var parent = compressor.parent(p);
+            if (!parent) return false;
+            if (a === 0 && parent.TYPE == "Destructuring") continue;
+            if (!ancestors[a].test(parent.TYPE)) {
+                return false;
+            }
+            a++;
+        }
+        return true;
+    }
+
+    function should_retain(compressor, def) {
+        if (def.references.length) return true;
+        if (!def.global) return false;
+        if (compressor.toplevel.vars) {
+             if (compressor.top_retain) {
+                 return compressor.top_retain(def);
+             }
+             return false;
+        }
+        return true;
+    }
+});
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// a small wrapper around fitzgen's source-map library
+async function SourceMap(options) {
+    options = defaults(options, {
+        file : null,
+        root : null,
+        orig : null,
+
+        orig_line_diff : 0,
+        dest_line_diff : 0,
+    });
+
+    var orig_map;
+    var generator = new MOZ_SourceMap__default['default'].SourceMapGenerator({
+        file       : options.file,
+        sourceRoot : options.root
+    });
+
+    if (options.orig) {
+        orig_map = await new MOZ_SourceMap__default['default'].SourceMapConsumer(options.orig);
+        orig_map.sources.forEach(function(source) {
+            var sourceContent = orig_map.sourceContentFor(source, true);
+            if (sourceContent) {
+                generator.setSourceContent(source, sourceContent);
+            }
+        });
+    }
+
+    function add(source, gen_line, gen_col, orig_line, orig_col, name) {
+        if (orig_map) {
+            var info = orig_map.originalPositionFor({
+                line: orig_line,
+                column: orig_col
+            });
+            if (info.source === null) {
+                return;
+            }
+            source = info.source;
+            orig_line = info.line;
+            orig_col = info.column;
+            name = info.name || name;
+        }
+        generator.addMapping({
+            generated : { line: gen_line + options.dest_line_diff, column: gen_col },
+            original  : { line: orig_line + options.orig_line_diff, column: orig_col },
+            source    : source,
+            name      : name
+        });
+    }
+
+    return {
+        add        : add,
+        get        : function() { return generator; },
+        toString   : function() { return generator.toString(); },
+        destroy    : function () {
+            if (orig_map && orig_map.destroy) {
+                orig_map.destroy();
+            }
+        }
+    };
+}
+
+var domprops = [
+    "$&",
+    "$'",
+    "$*",
+    "$+",
+    "$1",
+    "$2",
+    "$3",
+    "$4",
+    "$5",
+    "$6",
+    "$7",
+    "$8",
+    "$9",
+    "$_",
+    "$`",
+    "$input",
+    "-moz-animation",
+    "-moz-animation-delay",
+    "-moz-animation-direction",
+    "-moz-animation-duration",
+    "-moz-animation-fill-mode",
+    "-moz-animation-iteration-count",
+    "-moz-animation-name",
+    "-moz-animation-play-state",
+    "-moz-animation-timing-function",
+    "-moz-appearance",
+    "-moz-backface-visibility",
+    "-moz-border-end",
+    "-moz-border-end-color",
+    "-moz-border-end-style",
+    "-moz-border-end-width",
+    "-moz-border-image",
+    "-moz-border-start",
+    "-moz-border-start-color",
+    "-moz-border-start-style",
+    "-moz-border-start-width",
+    "-moz-box-align",
+    "-moz-box-direction",
+    "-moz-box-flex",
+    "-moz-box-ordinal-group",
+    "-moz-box-orient",
+    "-moz-box-pack",
+    "-moz-box-sizing",
+    "-moz-float-edge",
+    "-moz-font-feature-settings",
+    "-moz-font-language-override",
+    "-moz-force-broken-image-icon",
+    "-moz-hyphens",
+    "-moz-image-region",
+    "-moz-margin-end",
+    "-moz-margin-start",
+    "-moz-orient",
+    "-moz-osx-font-smoothing",
+    "-moz-outline-radius",
+    "-moz-outline-radius-bottomleft",
+    "-moz-outline-radius-bottomright",
+    "-moz-outline-radius-topleft",
+    "-moz-outline-radius-topright",
+    "-moz-padding-end",
+    "-moz-padding-start",
+    "-moz-perspective",
+    "-moz-perspective-origin",
+    "-moz-tab-size",
+    "-moz-text-size-adjust",
+    "-moz-transform",
+    "-moz-transform-origin",
+    "-moz-transform-style",
+    "-moz-transition",
+    "-moz-transition-delay",
+    "-moz-transition-duration",
+    "-moz-transition-property",
+    "-moz-transition-timing-function",
+    "-moz-user-focus",
+    "-moz-user-input",
+    "-moz-user-modify",
+    "-moz-user-select",
+    "-moz-window-dragging",
+    "-webkit-align-content",
+    "-webkit-align-items",
+    "-webkit-align-self",
+    "-webkit-animation",
+    "-webkit-animation-delay",
+    "-webkit-animation-direction",
+    "-webkit-animation-duration",
+    "-webkit-animation-fill-mode",
+    "-webkit-animation-iteration-count",
+    "-webkit-animation-name",
+    "-webkit-animation-play-state",
+    "-webkit-animation-timing-function",
+    "-webkit-appearance",
+    "-webkit-backface-visibility",
+    "-webkit-background-clip",
+    "-webkit-background-origin",
+    "-webkit-background-size",
+    "-webkit-border-bottom-left-radius",
+    "-webkit-border-bottom-right-radius",
+    "-webkit-border-image",
+    "-webkit-border-radius",
+    "-webkit-border-top-left-radius",
+    "-webkit-border-top-right-radius",
+    "-webkit-box-align",
+    "-webkit-box-direction",
+    "-webkit-box-flex",
+    "-webkit-box-ordinal-group",
+    "-webkit-box-orient",
+    "-webkit-box-pack",
+    "-webkit-box-shadow",
+    "-webkit-box-sizing",
+    "-webkit-filter",
+    "-webkit-flex",
+    "-webkit-flex-basis",
+    "-webkit-flex-direction",
+    "-webkit-flex-flow",
+    "-webkit-flex-grow",
+    "-webkit-flex-shrink",
+    "-webkit-flex-wrap",
+    "-webkit-justify-content",
+    "-webkit-line-clamp",
+    "-webkit-mask",
+    "-webkit-mask-clip",
+    "-webkit-mask-composite",
+    "-webkit-mask-image",
+    "-webkit-mask-origin",
+    "-webkit-mask-position",
+    "-webkit-mask-position-x",
+    "-webkit-mask-position-y",
+    "-webkit-mask-repeat",
+    "-webkit-mask-size",
+    "-webkit-order",
+    "-webkit-perspective",
+    "-webkit-perspective-origin",
+    "-webkit-text-fill-color",
+    "-webkit-text-size-adjust",
+    "-webkit-text-stroke",
+    "-webkit-text-stroke-color",
+    "-webkit-text-stroke-width",
+    "-webkit-transform",
+    "-webkit-transform-origin",
+    "-webkit-transform-style",
+    "-webkit-transition",
+    "-webkit-transition-delay",
+    "-webkit-transition-duration",
+    "-webkit-transition-property",
+    "-webkit-transition-timing-function",
+    "-webkit-user-select",
+    "0",
+    "1",
+    "10",
+    "11",
+    "12",
+    "13",
+    "14",
+    "15",
+    "16",
+    "17",
+    "18",
+    "19",
+    "2",
+    "20",
+    "3",
+    "4",
+    "5",
+    "6",
+    "7",
+    "8",
+    "9",
+    "@@iterator",
+    "ABORT_ERR",
+    "ACTIVE",
+    "ACTIVE_ATTRIBUTES",
+    "ACTIVE_TEXTURE",
+    "ACTIVE_UNIFORMS",
+    "ACTIVE_UNIFORM_BLOCKS",
+    "ADDITION",
+    "ALIASED_LINE_WIDTH_RANGE",
+    "ALIASED_POINT_SIZE_RANGE",
+    "ALLOW_KEYBOARD_INPUT",
+    "ALLPASS",
+    "ALPHA",
+    "ALPHA_BITS",
+    "ALREADY_SIGNALED",
+    "ALT_MASK",
+    "ALWAYS",
+    "ANY_SAMPLES_PASSED",
+    "ANY_SAMPLES_PASSED_CONSERVATIVE",
+    "ANY_TYPE",
+    "ANY_UNORDERED_NODE_TYPE",
+    "ARRAY_BUFFER",
+    "ARRAY_BUFFER_BINDING",
+    "ATTACHED_SHADERS",
+    "ATTRIBUTE_NODE",
+    "AT_TARGET",
+    "AbortController",
+    "AbortSignal",
+    "AbsoluteOrientationSensor",
+    "AbstractRange",
+    "Accelerometer",
+    "AddSearchProvider",
+    "AggregateError",
+    "AnalyserNode",
+    "Animation",
+    "AnimationEffect",
+    "AnimationEvent",
+    "AnimationPlaybackEvent",
+    "AnimationTimeline",
+    "AnonXMLHttpRequest",
+    "Any",
+    "ApplicationCache",
+    "ApplicationCacheErrorEvent",
+    "Array",
+    "ArrayBuffer",
+    "ArrayType",
+    "Atomics",
+    "Attr",
+    "Audio",
+    "AudioBuffer",
+    "AudioBufferSourceNode",
+    "AudioContext",
+    "AudioDestinationNode",
+    "AudioListener",
+    "AudioNode",
+    "AudioParam",
+    "AudioParamMap",
+    "AudioProcessingEvent",
+    "AudioScheduledSourceNode",
+    "AudioStreamTrack",
+    "AudioWorklet",
+    "AudioWorkletNode",
+    "AuthenticatorAssertionResponse",
+    "AuthenticatorAttestationResponse",
+    "AuthenticatorResponse",
+    "AutocompleteErrorEvent",
+    "BACK",
+    "BAD_BOUNDARYPOINTS_ERR",
+    "BAD_REQUEST",
+    "BANDPASS",
+    "BLEND",
+    "BLEND_COLOR",
+    "BLEND_DST_ALPHA",
+    "BLEND_DST_RGB",
+    "BLEND_EQUATION",
+    "BLEND_EQUATION_ALPHA",
+    "BLEND_EQUATION_RGB",
+    "BLEND_SRC_ALPHA",
+    "BLEND_SRC_RGB",
+    "BLUE_BITS",
+    "BLUR",
+    "BOOL",
+    "BOOLEAN_TYPE",
+    "BOOL_VEC2",
+    "BOOL_VEC3",
+    "BOOL_VEC4",
+    "BOTH",
+    "BROWSER_DEFAULT_WEBGL",
+    "BUBBLING_PHASE",
+    "BUFFER_SIZE",
+    "BUFFER_USAGE",
+    "BYTE",
+    "BYTES_PER_ELEMENT",
+    "BackgroundFetchManager",
+    "BackgroundFetchRecord",
+    "BackgroundFetchRegistration",
+    "BarProp",
+    "BarcodeDetector",
+    "BaseAudioContext",
+    "BaseHref",
+    "BatteryManager",
+    "BeforeInstallPromptEvent",
+    "BeforeLoadEvent",
+    "BeforeUnloadEvent",
+    "BigInt",
+    "BigInt64Array",
+    "BigUint64Array",
+    "BiquadFilterNode",
+    "Blob",
+    "BlobEvent",
+    "Bluetooth",
+    "BluetoothCharacteristicProperties",
+    "BluetoothDevice",
+    "BluetoothRemoteGATTCharacteristic",
+    "BluetoothRemoteGATTDescriptor",
+    "BluetoothRemoteGATTServer",
+    "BluetoothRemoteGATTService",
+    "BluetoothUUID",
+    "Boolean",
+    "BroadcastChannel",
+    "ByteLengthQueuingStrategy",
+    "CAPTURING_PHASE",
+    "CCW",
+    "CDATASection",
+    "CDATA_SECTION_NODE",
+    "CHANGE",
+    "CHARSET_RULE",
+    "CHECKING",
+    "CLAMP_TO_EDGE",
+    "CLICK",
+    "CLOSED",
+    "CLOSING",
+    "COLOR",
+    "COLOR_ATTACHMENT0",
+    "COLOR_ATTACHMENT1",
+    "COLOR_ATTACHMENT10",
+    "COLOR_ATTACHMENT11",
+    "COLOR_ATTACHMENT12",
+    "COLOR_ATTACHMENT13",
+    "COLOR_ATTACHMENT14",
+    "COLOR_ATTACHMENT15",
+    "COLOR_ATTACHMENT2",
+    "COLOR_ATTACHMENT3",
+    "COLOR_ATTACHMENT4",
+    "COLOR_ATTACHMENT5",
+    "COLOR_ATTACHMENT6",
+    "COLOR_ATTACHMENT7",
+    "COLOR_ATTACHMENT8",
+    "COLOR_ATTACHMENT9",
+    "COLOR_BUFFER_BIT",
+    "COLOR_CLEAR_VALUE",
+    "COLOR_WRITEMASK",
+    "COMMENT_NODE",
+    "COMPARE_REF_TO_TEXTURE",
+    "COMPILE_STATUS",
+    "COMPRESSED_RGBA_S3TC_DXT1_EXT",
+    "COMPRESSED_RGBA_S3TC_DXT3_EXT",
+    "COMPRESSED_RGBA_S3TC_DXT5_EXT",
+    "COMPRESSED_RGB_S3TC_DXT1_EXT",
+    "COMPRESSED_TEXTURE_FORMATS",
+    "CONDITION_SATISFIED",
+    "CONFIGURATION_UNSUPPORTED",
+    "CONNECTING",
+    "CONSTANT_ALPHA",
+    "CONSTANT_COLOR",
+    "CONSTRAINT_ERR",
+    "CONTEXT_LOST_WEBGL",
+    "CONTROL_MASK",
+    "COPY_READ_BUFFER",
+    "COPY_READ_BUFFER_BINDING",
+    "COPY_WRITE_BUFFER",
+    "COPY_WRITE_BUFFER_BINDING",
+    "COUNTER_STYLE_RULE",
+    "CSS",
+    "CSS2Properties",
+    "CSSAnimation",
+    "CSSCharsetRule",
+    "CSSConditionRule",
+    "CSSCounterStyleRule",
+    "CSSFontFaceRule",
+    "CSSFontFeatureValuesRule",
+    "CSSGroupingRule",
+    "CSSImageValue",
+    "CSSImportRule",
+    "CSSKeyframeRule",
+    "CSSKeyframesRule",
+    "CSSKeywordValue",
+    "CSSMathInvert",
+    "CSSMathMax",
+    "CSSMathMin",
+    "CSSMathNegate",
+    "CSSMathProduct",
+    "CSSMathSum",
+    "CSSMathValue",
+    "CSSMatrixComponent",
+    "CSSMediaRule",
+    "CSSMozDocumentRule",
+    "CSSNameSpaceRule",
+    "CSSNamespaceRule",
+    "CSSNumericArray",
+    "CSSNumericValue",
+    "CSSPageRule",
+    "CSSPerspective",
+    "CSSPositionValue",
+    "CSSPrimitiveValue",
+    "CSSRotate",
+    "CSSRule",
+    "CSSRuleList",
+    "CSSScale",
+    "CSSSkew",
+    "CSSSkewX",
+    "CSSSkewY",
+    "CSSStyleDeclaration",
+    "CSSStyleRule",
+    "CSSStyleSheet",
+    "CSSStyleValue",
+    "CSSSupportsRule",
+    "CSSTransformComponent",
+    "CSSTransformValue",
+    "CSSTransition",
+    "CSSTranslate",
+    "CSSUnitValue",
+    "CSSUnknownRule",
+    "CSSUnparsedValue",
+    "CSSValue",
+    "CSSValueList",
+    "CSSVariableReferenceValue",
+    "CSSVariablesDeclaration",
+    "CSSVariablesRule",
+    "CSSViewportRule",
+    "CSS_ATTR",
+    "CSS_CM",
+    "CSS_COUNTER",
+    "CSS_CUSTOM",
+    "CSS_DEG",
+    "CSS_DIMENSION",
+    "CSS_EMS",
+    "CSS_EXS",
+    "CSS_FILTER_BLUR",
+    "CSS_FILTER_BRIGHTNESS",
+    "CSS_FILTER_CONTRAST",
+    "CSS_FILTER_CUSTOM",
+    "CSS_FILTER_DROP_SHADOW",
+    "CSS_FILTER_GRAYSCALE",
+    "CSS_FILTER_HUE_ROTATE",
+    "CSS_FILTER_INVERT",
+    "CSS_FILTER_OPACITY",
+    "CSS_FILTER_REFERENCE",
+    "CSS_FILTER_SATURATE",
+    "CSS_FILTER_SEPIA",
+    "CSS_GRAD",
+    "CSS_HZ",
+    "CSS_IDENT",
+    "CSS_IN",
+    "CSS_INHERIT",
+    "CSS_KHZ",
+    "CSS_MATRIX",
+    "CSS_MATRIX3D",
+    "CSS_MM",
+    "CSS_MS",
+    "CSS_NUMBER",
+    "CSS_PC",
+    "CSS_PERCENTAGE",
+    "CSS_PERSPECTIVE",
+    "CSS_PRIMITIVE_VALUE",
+    "CSS_PT",
+    "CSS_PX",
+    "CSS_RAD",
+    "CSS_RECT",
+    "CSS_RGBCOLOR",
+    "CSS_ROTATE",
+    "CSS_ROTATE3D",
+    "CSS_ROTATEX",
+    "CSS_ROTATEY",
+    "CSS_ROTATEZ",
+    "CSS_S",
+    "CSS_SCALE",
+    "CSS_SCALE3D",
+    "CSS_SCALEX",
+    "CSS_SCALEY",
+    "CSS_SCALEZ",
+    "CSS_SKEW",
+    "CSS_SKEWX",
+    "CSS_SKEWY",
+    "CSS_STRING",
+    "CSS_TRANSLATE",
+    "CSS_TRANSLATE3D",
+    "CSS_TRANSLATEX",
+    "CSS_TRANSLATEY",
+    "CSS_TRANSLATEZ",
+    "CSS_UNKNOWN",
+    "CSS_URI",
+    "CSS_VALUE_LIST",
+    "CSS_VH",
+    "CSS_VMAX",
+    "CSS_VMIN",
+    "CSS_VW",
+    "CULL_FACE",
+    "CULL_FACE_MODE",
+    "CURRENT_PROGRAM",
+    "CURRENT_QUERY",
+    "CURRENT_VERTEX_ATTRIB",
+    "CUSTOM",
+    "CW",
+    "Cache",
+    "CacheStorage",
+    "CanvasCaptureMediaStream",
+    "CanvasCaptureMediaStreamTrack",
+    "CanvasGradient",
+    "CanvasPattern",
+    "CanvasRenderingContext2D",
+    "CaretPosition",
+    "ChannelMergerNode",
+    "ChannelSplitterNode",
+    "CharacterData",
+    "ClientRect",
+    "ClientRectList",
+    "Clipboard",
+    "ClipboardEvent",
+    "ClipboardItem",
+    "CloseEvent",
+    "Collator",
+    "CommandEvent",
+    "Comment",
+    "CompileError",
+    "CompositionEvent",
+    "CompressionStream",
+    "Console",
+    "ConstantSourceNode",
+    "Controllers",
+    "ConvolverNode",
+    "CountQueuingStrategy",
+    "Counter",
+    "Credential",
+    "CredentialsContainer",
+    "Crypto",
+    "CryptoKey",
+    "CustomElementRegistry",
+    "CustomEvent",
+    "DATABASE_ERR",
+    "DATA_CLONE_ERR",
+    "DATA_ERR",
+    "DBLCLICK",
+    "DECR",
+    "DECR_WRAP",
+    "DELETE_STATUS",
+    "DEPTH",
+    "DEPTH24_STENCIL8",
+    "DEPTH32F_STENCIL8",
+    "DEPTH_ATTACHMENT",
+    "DEPTH_BITS",
+    "DEPTH_BUFFER_BIT",
+    "DEPTH_CLEAR_VALUE",
+    "DEPTH_COMPONENT",
+    "DEPTH_COMPONENT16",
+    "DEPTH_COMPONENT24",
+    "DEPTH_COMPONENT32F",
+    "DEPTH_FUNC",
+    "DEPTH_RANGE",
+    "DEPTH_STENCIL",
+    "DEPTH_STENCIL_ATTACHMENT",
+    "DEPTH_TEST",
+    "DEPTH_WRITEMASK",
+    "DEVICE_INELIGIBLE",
+    "DIRECTION_DOWN",
+    "DIRECTION_LEFT",
+    "DIRECTION_RIGHT",
+    "DIRECTION_UP",
+    "DISABLED",
+    "DISPATCH_REQUEST_ERR",
+    "DITHER",
+    "DOCUMENT_FRAGMENT_NODE",
+    "DOCUMENT_NODE",
+    "DOCUMENT_POSITION_CONTAINED_BY",
+    "DOCUMENT_POSITION_CONTAINS",
+    "DOCUMENT_POSITION_DISCONNECTED",
+    "DOCUMENT_POSITION_FOLLOWING",
+    "DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC",
+    "DOCUMENT_POSITION_PRECEDING",
+    "DOCUMENT_TYPE_NODE",
+    "DOMCursor",
+    "DOMError",
+    "DOMException",
+    "DOMImplementation",
+    "DOMImplementationLS",
+    "DOMMatrix",
+    "DOMMatrixReadOnly",
+    "DOMParser",
+    "DOMPoint",
+    "DOMPointReadOnly",
+    "DOMQuad",
+    "DOMRect",
+    "DOMRectList",
+    "DOMRectReadOnly",
+    "DOMRequest",
+    "DOMSTRING_SIZE_ERR",
+    "DOMSettableTokenList",
+    "DOMStringList",
+    "DOMStringMap",
+    "DOMTokenList",
+    "DOMTransactionEvent",
+    "DOM_DELTA_LINE",
+    "DOM_DELTA_PAGE",
+    "DOM_DELTA_PIXEL",
+    "DOM_INPUT_METHOD_DROP",
+    "DOM_INPUT_METHOD_HANDWRITING",
+    "DOM_INPUT_METHOD_IME",
+    "DOM_INPUT_METHOD_KEYBOARD",
+    "DOM_INPUT_METHOD_MULTIMODAL",
+    "DOM_INPUT_METHOD_OPTION",
+    "DOM_INPUT_METHOD_PASTE",
+    "DOM_INPUT_METHOD_SCRIPT",
+    "DOM_INPUT_METHOD_UNKNOWN",
+    "DOM_INPUT_METHOD_VOICE",
+    "DOM_KEY_LOCATION_JOYSTICK",
+    "DOM_KEY_LOCATION_LEFT",
+    "DOM_KEY_LOCATION_MOBILE",
+    "DOM_KEY_LOCATION_NUMPAD",
+    "DOM_KEY_LOCATION_RIGHT",
+    "DOM_KEY_LOCATION_STANDARD",
+    "DOM_VK_0",
+    "DOM_VK_1",
+    "DOM_VK_2",
+    "DOM_VK_3",
+    "DOM_VK_4",
+    "DOM_VK_5",
+    "DOM_VK_6",
+    "DOM_VK_7",
+    "DOM_VK_8",
+    "DOM_VK_9",
+    "DOM_VK_A",
+    "DOM_VK_ACCEPT",
+    "DOM_VK_ADD",
+    "DOM_VK_ALT",
+    "DOM_VK_ALTGR",
+    "DOM_VK_AMPERSAND",
+    "DOM_VK_ASTERISK",
+    "DOM_VK_AT",
+    "DOM_VK_ATTN",
+    "DOM_VK_B",
+    "DOM_VK_BACKSPACE",
+    "DOM_VK_BACK_QUOTE",
+    "DOM_VK_BACK_SLASH",
+    "DOM_VK_BACK_SPACE",
+    "DOM_VK_C",
+    "DOM_VK_CANCEL",
+    "DOM_VK_CAPS_LOCK",
+    "DOM_VK_CIRCUMFLEX",
+    "DOM_VK_CLEAR",
+    "DOM_VK_CLOSE_BRACKET",
+    "DOM_VK_CLOSE_CURLY_BRACKET",
+    "DOM_VK_CLOSE_PAREN",
+    "DOM_VK_COLON",
+    "DOM_VK_COMMA",
+    "DOM_VK_CONTEXT_MENU",
+    "DOM_VK_CONTROL",
+    "DOM_VK_CONVERT",
+    "DOM_VK_CRSEL",
+    "DOM_VK_CTRL",
+    "DOM_VK_D",
+    "DOM_VK_DECIMAL",
+    "DOM_VK_DELETE",
+    "DOM_VK_DIVIDE",
+    "DOM_VK_DOLLAR",
+    "DOM_VK_DOUBLE_QUOTE",
+    "DOM_VK_DOWN",
+    "DOM_VK_E",
+    "DOM_VK_EISU",
+    "DOM_VK_END",
+    "DOM_VK_ENTER",
+    "DOM_VK_EQUALS",
+    "DOM_VK_EREOF",
+    "DOM_VK_ESCAPE",
+    "DOM_VK_EXCLAMATION",
+    "DOM_VK_EXECUTE",
+    "DOM_VK_EXSEL",
+    "DOM_VK_F",
+    "DOM_VK_F1",
+    "DOM_VK_F10",
+    "DOM_VK_F11",
+    "DOM_VK_F12",
+    "DOM_VK_F13",
+    "DOM_VK_F14",
+    "DOM_VK_F15",
+    "DOM_VK_F16",
+    "DOM_VK_F17",
+    "DOM_VK_F18",
+    "DOM_VK_F19",
+    "DOM_VK_F2",
+    "DOM_VK_F20",
+    "DOM_VK_F21",
+    "DOM_VK_F22",
+    "DOM_VK_F23",
+    "DOM_VK_F24",
+    "DOM_VK_F25",
+    "DOM_VK_F26",
+    "DOM_VK_F27",
+    "DOM_VK_F28",
+    "DOM_VK_F29",
+    "DOM_VK_F3",
+    "DOM_VK_F30",
+    "DOM_VK_F31",
+    "DOM_VK_F32",
+    "DOM_VK_F33",
+    "DOM_VK_F34",
+    "DOM_VK_F35",
+    "DOM_VK_F36",
+    "DOM_VK_F4",
+    "DOM_VK_F5",
+    "DOM_VK_F6",
+    "DOM_VK_F7",
+    "DOM_VK_F8",
+    "DOM_VK_F9",
+    "DOM_VK_FINAL",
+    "DOM_VK_FRONT",
+    "DOM_VK_G",
+    "DOM_VK_GREATER_THAN",
+    "DOM_VK_H",
+    "DOM_VK_HANGUL",
+    "DOM_VK_HANJA",
+    "DOM_VK_HASH",
+    "DOM_VK_HELP",
+    "DOM_VK_HK_TOGGLE",
+    "DOM_VK_HOME",
+    "DOM_VK_HYPHEN_MINUS",
+    "DOM_VK_I",
+    "DOM_VK_INSERT",
+    "DOM_VK_J",
+    "DOM_VK_JUNJA",
+    "DOM_VK_K",
+    "DOM_VK_KANA",
+    "DOM_VK_KANJI",
+    "DOM_VK_L",
+    "DOM_VK_LEFT",
+    "DOM_VK_LEFT_TAB",
+    "DOM_VK_LESS_THAN",
+    "DOM_VK_M",
+    "DOM_VK_META",
+    "DOM_VK_MODECHANGE",
+    "DOM_VK_MULTIPLY",
+    "DOM_VK_N",
+    "DOM_VK_NONCONVERT",
+    "DOM_VK_NUMPAD0",
+    "DOM_VK_NUMPAD1",
+    "DOM_VK_NUMPAD2",
+    "DOM_VK_NUMPAD3",
+    "DOM_VK_NUMPAD4",
+    "DOM_VK_NUMPAD5",
+    "DOM_VK_NUMPAD6",
+    "DOM_VK_NUMPAD7",
+    "DOM_VK_NUMPAD8",
+    "DOM_VK_NUMPAD9",
+    "DOM_VK_NUM_LOCK",
+    "DOM_VK_O",
+    "DOM_VK_OEM_1",
+    "DOM_VK_OEM_102",
+    "DOM_VK_OEM_2",
+    "DOM_VK_OEM_3",
+    "DOM_VK_OEM_4",
+    "DOM_VK_OEM_5",
+    "DOM_VK_OEM_6",
+    "DOM_VK_OEM_7",
+    "DOM_VK_OEM_8",
+    "DOM_VK_OEM_COMMA",
+    "DOM_VK_OEM_MINUS",
+    "DOM_VK_OEM_PERIOD",
+    "DOM_VK_OEM_PLUS",
+    "DOM_VK_OPEN_BRACKET",
+    "DOM_VK_OPEN_CURLY_BRACKET",
+    "DOM_VK_OPEN_PAREN",
+    "DOM_VK_P",
+    "DOM_VK_PA1",
+    "DOM_VK_PAGEDOWN",
+    "DOM_VK_PAGEUP",
+    "DOM_VK_PAGE_DOWN",
+    "DOM_VK_PAGE_UP",
+    "DOM_VK_PAUSE",
+    "DOM_VK_PERCENT",
+    "DOM_VK_PERIOD",
+    "DOM_VK_PIPE",
+    "DOM_VK_PLAY",
+    "DOM_VK_PLUS",
+    "DOM_VK_PRINT",
+    "DOM_VK_PRINTSCREEN",
+    "DOM_VK_PROCESSKEY",
+    "DOM_VK_PROPERITES",
+    "DOM_VK_Q",
+    "DOM_VK_QUESTION_MARK",
+    "DOM_VK_QUOTE",
+    "DOM_VK_R",
+    "DOM_VK_REDO",
+    "DOM_VK_RETURN",
+    "DOM_VK_RIGHT",
+    "DOM_VK_S",
+    "DOM_VK_SCROLL_LOCK",
+    "DOM_VK_SELECT",
+    "DOM_VK_SEMICOLON",
+    "DOM_VK_SEPARATOR",
+    "DOM_VK_SHIFT",
+    "DOM_VK_SLASH",
+    "DOM_VK_SLEEP",
+    "DOM_VK_SPACE",
+    "DOM_VK_SUBTRACT",
+    "DOM_VK_T",
+    "DOM_VK_TAB",
+    "DOM_VK_TILDE",
+    "DOM_VK_U",
+    "DOM_VK_UNDERSCORE",
+    "DOM_VK_UNDO",
+    "DOM_VK_UNICODE",
+    "DOM_VK_UP",
+    "DOM_VK_V",
+    "DOM_VK_VOLUME_DOWN",
+    "DOM_VK_VOLUME_MUTE",
+    "DOM_VK_VOLUME_UP",
+    "DOM_VK_W",
+    "DOM_VK_WIN",
+    "DOM_VK_WINDOW",
+    "DOM_VK_WIN_ICO_00",
+    "DOM_VK_WIN_ICO_CLEAR",
+    "DOM_VK_WIN_ICO_HELP",
+    "DOM_VK_WIN_OEM_ATTN",
+    "DOM_VK_WIN_OEM_AUTO",
+    "DOM_VK_WIN_OEM_BACKTAB",
+    "DOM_VK_WIN_OEM_CLEAR",
+    "DOM_VK_WIN_OEM_COPY",
+    "DOM_VK_WIN_OEM_CUSEL",
+    "DOM_VK_WIN_OEM_ENLW",
+    "DOM_VK_WIN_OEM_FINISH",
+    "DOM_VK_WIN_OEM_FJ_JISHO",
+    "DOM_VK_WIN_OEM_FJ_LOYA",
+    "DOM_VK_WIN_OEM_FJ_MASSHOU",
+    "DOM_VK_WIN_OEM_FJ_ROYA",
+    "DOM_VK_WIN_OEM_FJ_TOUROKU",
+    "DOM_VK_WIN_OEM_JUMP",
+    "DOM_VK_WIN_OEM_PA1",
+    "DOM_VK_WIN_OEM_PA2",
+    "DOM_VK_WIN_OEM_PA3",
+    "DOM_VK_WIN_OEM_RESET",
+    "DOM_VK_WIN_OEM_WSCTRL",
+    "DOM_VK_X",
+    "DOM_VK_XF86XK_ADD_FAVORITE",
+    "DOM_VK_XF86XK_APPLICATION_LEFT",
+    "DOM_VK_XF86XK_APPLICATION_RIGHT",
+    "DOM_VK_XF86XK_AUDIO_CYCLE_TRACK",
+    "DOM_VK_XF86XK_AUDIO_FORWARD",
+    "DOM_VK_XF86XK_AUDIO_LOWER_VOLUME",
+    "DOM_VK_XF86XK_AUDIO_MEDIA",
+    "DOM_VK_XF86XK_AUDIO_MUTE",
+    "DOM_VK_XF86XK_AUDIO_NEXT",
+    "DOM_VK_XF86XK_AUDIO_PAUSE",
+    "DOM_VK_XF86XK_AUDIO_PLAY",
+    "DOM_VK_XF86XK_AUDIO_PREV",
+    "DOM_VK_XF86XK_AUDIO_RAISE_VOLUME",
+    "DOM_VK_XF86XK_AUDIO_RANDOM_PLAY",
+    "DOM_VK_XF86XK_AUDIO_RECORD",
+    "DOM_VK_XF86XK_AUDIO_REPEAT",
+    "DOM_VK_XF86XK_AUDIO_REWIND",
+    "DOM_VK_XF86XK_AUDIO_STOP",
+    "DOM_VK_XF86XK_AWAY",
+    "DOM_VK_XF86XK_BACK",
+    "DOM_VK_XF86XK_BACK_FORWARD",
+    "DOM_VK_XF86XK_BATTERY",
+    "DOM_VK_XF86XK_BLUE",
+    "DOM_VK_XF86XK_BLUETOOTH",
+    "DOM_VK_XF86XK_BOOK",
+    "DOM_VK_XF86XK_BRIGHTNESS_ADJUST",
+    "DOM_VK_XF86XK_CALCULATOR",
+    "DOM_VK_XF86XK_CALENDAR",
+    "DOM_VK_XF86XK_CD",
+    "DOM_VK_XF86XK_CLOSE",
+    "DOM_VK_XF86XK_COMMUNITY",
+    "DOM_VK_XF86XK_CONTRAST_ADJUST",
+    "DOM_VK_XF86XK_COPY",
+    "DOM_VK_XF86XK_CUT",
+    "DOM_VK_XF86XK_CYCLE_ANGLE",
+    "DOM_VK_XF86XK_DISPLAY",
+    "DOM_VK_XF86XK_DOCUMENTS",
+    "DOM_VK_XF86XK_DOS",
+    "DOM_VK_XF86XK_EJECT",
+    "DOM_VK_XF86XK_EXCEL",
+    "DOM_VK_XF86XK_EXPLORER",
+    "DOM_VK_XF86XK_FAVORITES",
+    "DOM_VK_XF86XK_FINANCE",
+    "DOM_VK_XF86XK_FORWARD",
+    "DOM_VK_XF86XK_FRAME_BACK",
+    "DOM_VK_XF86XK_FRAME_FORWARD",
+    "DOM_VK_XF86XK_GAME",
+    "DOM_VK_XF86XK_GO",
+    "DOM_VK_XF86XK_GREEN",
+    "DOM_VK_XF86XK_HIBERNATE",
+    "DOM_VK_XF86XK_HISTORY",
+    "DOM_VK_XF86XK_HOME_PAGE",
+    "DOM_VK_XF86XK_HOT_LINKS",
+    "DOM_VK_XF86XK_I_TOUCH",
+    "DOM_VK_XF86XK_KBD_BRIGHTNESS_DOWN",
+    "DOM_VK_XF86XK_KBD_BRIGHTNESS_UP",
+    "DOM_VK_XF86XK_KBD_LIGHT_ON_OFF",
+    "DOM_VK_XF86XK_LAUNCH0",
+    "DOM_VK_XF86XK_LAUNCH1",
+    "DOM_VK_XF86XK_LAUNCH2",
+    "DOM_VK_XF86XK_LAUNCH3",
+    "DOM_VK_XF86XK_LAUNCH4",
+    "DOM_VK_XF86XK_LAUNCH5",
+    "DOM_VK_XF86XK_LAUNCH6",
+    "DOM_VK_XF86XK_LAUNCH7",
+    "DOM_VK_XF86XK_LAUNCH8",
+    "DOM_VK_XF86XK_LAUNCH9",
+    "DOM_VK_XF86XK_LAUNCH_A",
+    "DOM_VK_XF86XK_LAUNCH_B",
+    "DOM_VK_XF86XK_LAUNCH_C",
+    "DOM_VK_XF86XK_LAUNCH_D",
+    "DOM_VK_XF86XK_LAUNCH_E",
+    "DOM_VK_XF86XK_LAUNCH_F",
+    "DOM_VK_XF86XK_LIGHT_BULB",
+    "DOM_VK_XF86XK_LOG_OFF",
+    "DOM_VK_XF86XK_MAIL",
+    "DOM_VK_XF86XK_MAIL_FORWARD",
+    "DOM_VK_XF86XK_MARKET",
+    "DOM_VK_XF86XK_MEETING",
+    "DOM_VK_XF86XK_MEMO",
+    "DOM_VK_XF86XK_MENU_KB",
+    "DOM_VK_XF86XK_MENU_PB",
+    "DOM_VK_XF86XK_MESSENGER",
+    "DOM_VK_XF86XK_MON_BRIGHTNESS_DOWN",
+    "DOM_VK_XF86XK_MON_BRIGHTNESS_UP",
+    "DOM_VK_XF86XK_MUSIC",
+    "DOM_VK_XF86XK_MY_COMPUTER",
+    "DOM_VK_XF86XK_MY_SITES",
+    "DOM_VK_XF86XK_NEW",
+    "DOM_VK_XF86XK_NEWS",
+    "DOM_VK_XF86XK_OFFICE_HOME",
+    "DOM_VK_XF86XK_OPEN",
+    "DOM_VK_XF86XK_OPEN_URL",
+    "DOM_VK_XF86XK_OPTION",
+    "DOM_VK_XF86XK_PASTE",
+    "DOM_VK_XF86XK_PHONE",
+    "DOM_VK_XF86XK_PICTURES",
+    "DOM_VK_XF86XK_POWER_DOWN",
+    "DOM_VK_XF86XK_POWER_OFF",
+    "DOM_VK_XF86XK_RED",
+    "DOM_VK_XF86XK_REFRESH",
+    "DOM_VK_XF86XK_RELOAD",
+    "DOM_VK_XF86XK_REPLY",
+    "DOM_VK_XF86XK_ROCKER_DOWN",
+    "DOM_VK_XF86XK_ROCKER_ENTER",
+    "DOM_VK_XF86XK_ROCKER_UP",
+    "DOM_VK_XF86XK_ROTATE_WINDOWS",
+    "DOM_VK_XF86XK_ROTATION_KB",
+    "DOM_VK_XF86XK_ROTATION_PB",
+    "DOM_VK_XF86XK_SAVE",
+    "DOM_VK_XF86XK_SCREEN_SAVER",
+    "DOM_VK_XF86XK_SCROLL_CLICK",
+    "DOM_VK_XF86XK_SCROLL_DOWN",
+    "DOM_VK_XF86XK_SCROLL_UP",
+    "DOM_VK_XF86XK_SEARCH",
+    "DOM_VK_XF86XK_SEND",
+    "DOM_VK_XF86XK_SHOP",
+    "DOM_VK_XF86XK_SPELL",
+    "DOM_VK_XF86XK_SPLIT_SCREEN",
+    "DOM_VK_XF86XK_STANDBY",
+    "DOM_VK_XF86XK_START",
+    "DOM_VK_XF86XK_STOP",
+    "DOM_VK_XF86XK_SUBTITLE",
+    "DOM_VK_XF86XK_SUPPORT",
+    "DOM_VK_XF86XK_SUSPEND",
+    "DOM_VK_XF86XK_TASK_PANE",
+    "DOM_VK_XF86XK_TERMINAL",
+    "DOM_VK_XF86XK_TIME",
+    "DOM_VK_XF86XK_TOOLS",
+    "DOM_VK_XF86XK_TOP_MENU",
+    "DOM_VK_XF86XK_TO_DO_LIST",
+    "DOM_VK_XF86XK_TRAVEL",
+    "DOM_VK_XF86XK_USER1KB",
+    "DOM_VK_XF86XK_USER2KB",
+    "DOM_VK_XF86XK_USER_PB",
+    "DOM_VK_XF86XK_UWB",
+    "DOM_VK_XF86XK_VENDOR_HOME",
+    "DOM_VK_XF86XK_VIDEO",
+    "DOM_VK_XF86XK_VIEW",
+    "DOM_VK_XF86XK_WAKE_UP",
+    "DOM_VK_XF86XK_WEB_CAM",
+    "DOM_VK_XF86XK_WHEEL_BUTTON",
+    "DOM_VK_XF86XK_WLAN",
+    "DOM_VK_XF86XK_WORD",
+    "DOM_VK_XF86XK_WWW",
+    "DOM_VK_XF86XK_XFER",
+    "DOM_VK_XF86XK_YELLOW",
+    "DOM_VK_XF86XK_ZOOM_IN",
+    "DOM_VK_XF86XK_ZOOM_OUT",
+    "DOM_VK_Y",
+    "DOM_VK_Z",
+    "DOM_VK_ZOOM",
+    "DONE",
+    "DONT_CARE",
+    "DOWNLOADING",
+    "DRAGDROP",
+    "DRAW_BUFFER0",
+    "DRAW_BUFFER1",
+    "DRAW_BUFFER10",
+    "DRAW_BUFFER11",
+    "DRAW_BUFFER12",
+    "DRAW_BUFFER13",
+    "DRAW_BUFFER14",
+    "DRAW_BUFFER15",
+    "DRAW_BUFFER2",
+    "DRAW_BUFFER3",
+    "DRAW_BUFFER4",
+    "DRAW_BUFFER5",
+    "DRAW_BUFFER6",
+    "DRAW_BUFFER7",
+    "DRAW_BUFFER8",
+    "DRAW_BUFFER9",
+    "DRAW_FRAMEBUFFER",
+    "DRAW_FRAMEBUFFER_BINDING",
+    "DST_ALPHA",
+    "DST_COLOR",
+    "DYNAMIC_COPY",
+    "DYNAMIC_DRAW",
+    "DYNAMIC_READ",
+    "DataChannel",
+    "DataTransfer",
+    "DataTransferItem",
+    "DataTransferItemList",
+    "DataView",
+    "Date",
+    "DateTimeFormat",
+    "DecompressionStream",
+    "DelayNode",
+    "DeprecationReportBody",
+    "DesktopNotification",
+    "DesktopNotificationCenter",
+    "DeviceLightEvent",
+    "DeviceMotionEvent",
+    "DeviceMotionEventAcceleration",
+    "DeviceMotionEventRotationRate",
+    "DeviceOrientationEvent",
+    "DeviceProximityEvent",
+    "DeviceStorage",
+    "DeviceStorageChangeEvent",
+    "Directory",
+    "DisplayNames",
+    "Document",
+    "DocumentFragment",
+    "DocumentTimeline",
+    "DocumentType",
+    "DragEvent",
+    "DynamicsCompressorNode",
+    "E",
+    "ELEMENT_ARRAY_BUFFER",
+    "ELEMENT_ARRAY_BUFFER_BINDING",
+    "ELEMENT_NODE",
+    "EMPTY",
+    "ENCODING_ERR",
+    "ENDED",
+    "END_TO_END",
+    "END_TO_START",
+    "ENTITY_NODE",
+    "ENTITY_REFERENCE_NODE",
+    "EPSILON",
+    "EQUAL",
+    "EQUALPOWER",
+    "ERROR",
+    "EXPONENTIAL_DISTANCE",
+    "Element",
+    "ElementInternals",
+    "ElementQuery",
+    "EnterPictureInPictureEvent",
+    "Entity",
+    "EntityReference",
+    "Error",
+    "ErrorEvent",
+    "EvalError",
+    "Event",
+    "EventException",
+    "EventSource",
+    "EventTarget",
+    "External",
+    "FASTEST",
+    "FIDOSDK",
+    "FILTER_ACCEPT",
+    "FILTER_INTERRUPT",
+    "FILTER_REJECT",
+    "FILTER_SKIP",
+    "FINISHED_STATE",
+    "FIRST_ORDERED_NODE_TYPE",
+    "FLOAT",
+    "FLOAT_32_UNSIGNED_INT_24_8_REV",
+    "FLOAT_MAT2",
+    "FLOAT_MAT2x3",
+    "FLOAT_MAT2x4",
+    "FLOAT_MAT3",
+    "FLOAT_MAT3x2",
+    "FLOAT_MAT3x4",
+    "FLOAT_MAT4",
+    "FLOAT_MAT4x2",
+    "FLOAT_MAT4x3",
+    "FLOAT_VEC2",
+    "FLOAT_VEC3",
+    "FLOAT_VEC4",
+    "FOCUS",
+    "FONT_FACE_RULE",
+    "FONT_FEATURE_VALUES_RULE",
+    "FRAGMENT_SHADER",
+    "FRAGMENT_SHADER_DERIVATIVE_HINT",
+    "FRAGMENT_SHADER_DERIVATIVE_HINT_OES",
+    "FRAMEBUFFER",
+    "FRAMEBUFFER_ATTACHMENT_ALPHA_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_BLUE_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_COLOR_ENCODING",
+    "FRAMEBUFFER_ATTACHMENT_COMPONENT_TYPE",
+    "FRAMEBUFFER_ATTACHMENT_DEPTH_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_GREEN_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_OBJECT_NAME",
+    "FRAMEBUFFER_ATTACHMENT_OBJECT_TYPE",
+    "FRAMEBUFFER_ATTACHMENT_RED_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_STENCIL_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_TEXTURE_CUBE_MAP_FACE",
+    "FRAMEBUFFER_ATTACHMENT_TEXTURE_LAYER",
+    "FRAMEBUFFER_ATTACHMENT_TEXTURE_LEVEL",
+    "FRAMEBUFFER_BINDING",
+    "FRAMEBUFFER_COMPLETE",
+    "FRAMEBUFFER_DEFAULT",
+    "FRAMEBUFFER_INCOMPLETE_ATTACHMENT",
+    "FRAMEBUFFER_INCOMPLETE_DIMENSIONS",
+    "FRAMEBUFFER_INCOMPLETE_MISSING_ATTACHMENT",
+    "FRAMEBUFFER_INCOMPLETE_MULTISAMPLE",
+    "FRAMEBUFFER_UNSUPPORTED",
+    "FRONT",
+    "FRONT_AND_BACK",
+    "FRONT_FACE",
+    "FUNC_ADD",
+    "FUNC_REVERSE_SUBTRACT",
+    "FUNC_SUBTRACT",
+    "FeaturePolicy",
+    "FeaturePolicyViolationReportBody",
+    "FederatedCredential",
+    "Feed",
+    "FeedEntry",
+    "File",
+    "FileError",
+    "FileList",
+    "FileReader",
+    "FileSystem",
+    "FileSystemDirectoryEntry",
+    "FileSystemDirectoryReader",
+    "FileSystemEntry",
+    "FileSystemFileEntry",
+    "FinalizationRegistry",
+    "FindInPage",
+    "Float32Array",
+    "Float64Array",
+    "FocusEvent",
+    "FontFace",
+    "FontFaceSet",
+    "FontFaceSetLoadEvent",
+    "FormData",
+    "FormDataEvent",
+    "FragmentDirective",
+    "Function",
+    "GENERATE_MIPMAP_HINT",
+    "GEQUAL",
+    "GREATER",
+    "GREEN_BITS",
+    "GainNode",
+    "Gamepad",
+    "GamepadAxisMoveEvent",
+    "GamepadButton",
+    "GamepadButtonEvent",
+    "GamepadEvent",
+    "GamepadHapticActuator",
+    "GamepadPose",
+    "Geolocation",
+    "GeolocationCoordinates",
+    "GeolocationPosition",
+    "GeolocationPositionError",
+    "GestureEvent",
+    "Global",
+    "Gyroscope",
+    "HALF_FLOAT",
+    "HAVE_CURRENT_DATA",
+    "HAVE_ENOUGH_DATA",
+    "HAVE_FUTURE_DATA",
+    "HAVE_METADATA",
+    "HAVE_NOTHING",
+    "HEADERS_RECEIVED",
+    "HIDDEN",
+    "HIERARCHY_REQUEST_ERR",
+    "HIGHPASS",
+    "HIGHSHELF",
+    "HIGH_FLOAT",
+    "HIGH_INT",
+    "HORIZONTAL",
+    "HORIZONTAL_AXIS",
+    "HRTF",
+    "HTMLAllCollection",
+    "HTMLAnchorElement",
+    "HTMLAppletElement",
+    "HTMLAreaElement",
+    "HTMLAudioElement",
+    "HTMLBRElement",
+    "HTMLBaseElement",
+    "HTMLBaseFontElement",
+    "HTMLBlockquoteElement",
+    "HTMLBodyElement",
+    "HTMLButtonElement",
+    "HTMLCanvasElement",
+    "HTMLCollection",
+    "HTMLCommandElement",
+    "HTMLContentElement",
+    "HTMLDListElement",
+    "HTMLDataElement",
+    "HTMLDataListElement",
+    "HTMLDetailsElement",
+    "HTMLDialogElement",
+    "HTMLDirectoryElement",
+    "HTMLDivElement",
+    "HTMLDocument",
+    "HTMLElement",
+    "HTMLEmbedElement",
+    "HTMLFieldSetElement",
+    "HTMLFontElement",
+    "HTMLFormControlsCollection",
+    "HTMLFormElement",
+    "HTMLFrameElement",
+    "HTMLFrameSetElement",
+    "HTMLHRElement",
+    "HTMLHeadElement",
+    "HTMLHeadingElement",
+    "HTMLHtmlElement",
+    "HTMLIFrameElement",
+    "HTMLImageElement",
+    "HTMLInputElement",
+    "HTMLIsIndexElement",
+    "HTMLKeygenElement",
+    "HTMLLIElement",
+    "HTMLLabelElement",
+    "HTMLLegendElement",
+    "HTMLLinkElement",
+    "HTMLMapElement",
+    "HTMLMarqueeElement",
+    "HTMLMediaElement",
+    "HTMLMenuElement",
+    "HTMLMenuItemElement",
+    "HTMLMetaElement",
+    "HTMLMeterElement",
+    "HTMLModElement",
+    "HTMLOListElement",
+    "HTMLObjectElement",
+    "HTMLOptGroupElement",
+    "HTMLOptionElement",
+    "HTMLOptionsCollection",
+    "HTMLOutputElement",
+    "HTMLParagraphElement",
+    "HTMLParamElement",
+    "HTMLPictureElement",
+    "HTMLPreElement",
+    "HTMLProgressElement",
+    "HTMLPropertiesCollection",
+    "HTMLQuoteElement",
+    "HTMLScriptElement",
+    "HTMLSelectElement",
+    "HTMLShadowElement",
+    "HTMLSlotElement",
+    "HTMLSourceElement",
+    "HTMLSpanElement",
+    "HTMLStyleElement",
+    "HTMLTableCaptionElement",
+    "HTMLTableCellElement",
+    "HTMLTableColElement",
+    "HTMLTableElement",
+    "HTMLTableRowElement",
+    "HTMLTableSectionElement",
+    "HTMLTemplateElement",
+    "HTMLTextAreaElement",
+    "HTMLTimeElement",
+    "HTMLTitleElement",
+    "HTMLTrackElement",
+    "HTMLUListElement",
+    "HTMLUnknownElement",
+    "HTMLVideoElement",
+    "HashChangeEvent",
+    "Headers",
+    "History",
+    "Hz",
+    "ICE_CHECKING",
+    "ICE_CLOSED",
+    "ICE_COMPLETED",
+    "ICE_CONNECTED",
+    "ICE_FAILED",
+    "ICE_GATHERING",
+    "ICE_WAITING",
+    "IDBCursor",
+    "IDBCursorWithValue",
+    "IDBDatabase",
+    "IDBDatabaseException",
+    "IDBFactory",
+    "IDBFileHandle",
+    "IDBFileRequest",
+    "IDBIndex",
+    "IDBKeyRange",
+    "IDBMutableFile",
+    "IDBObjectStore",
+    "IDBOpenDBRequest",
+    "IDBRequest",
+    "IDBTransaction",
+    "IDBVersionChangeEvent",
+    "IDLE",
+    "IIRFilterNode",
+    "IMPLEMENTATION_COLOR_READ_FORMAT",
+    "IMPLEMENTATION_COLOR_READ_TYPE",
+    "IMPORT_RULE",
+    "INCR",
+    "INCR_WRAP",
+    "INDEX_SIZE_ERR",
+    "INT",
+    "INTERLEAVED_ATTRIBS",
+    "INT_2_10_10_10_REV",
+    "INT_SAMPLER_2D",
+    "INT_SAMPLER_2D_ARRAY",
+    "INT_SAMPLER_3D",
+    "INT_SAMPLER_CUBE",
+    "INT_VEC2",
+    "INT_VEC3",
+    "INT_VEC4",
+    "INUSE_ATTRIBUTE_ERR",
+    "INVALID_ACCESS_ERR",
+    "INVALID_CHARACTER_ERR",
+    "INVALID_ENUM",
+    "INVALID_EXPRESSION_ERR",
+    "INVALID_FRAMEBUFFER_OPERATION",
+    "INVALID_INDEX",
+    "INVALID_MODIFICATION_ERR",
+    "INVALID_NODE_TYPE_ERR",
+    "INVALID_OPERATION",
+    "INVALID_STATE_ERR",
+    "INVALID_VALUE",
+    "INVERSE_DISTANCE",
+    "INVERT",
+    "IceCandidate",
+    "IdleDeadline",
+    "Image",
+    "ImageBitmap",
+    "ImageBitmapRenderingContext",
+    "ImageCapture",
+    "ImageData",
+    "Infinity",
+    "InputDeviceCapabilities",
+    "InputDeviceInfo",
+    "InputEvent",
+    "InputMethodContext",
+    "InstallTrigger",
+    "InstallTriggerImpl",
+    "Instance",
+    "Int16Array",
+    "Int32Array",
+    "Int8Array",
+    "Intent",
+    "InternalError",
+    "IntersectionObserver",
+    "IntersectionObserverEntry",
+    "Intl",
+    "IsSearchProviderInstalled",
+    "Iterator",
+    "JSON",
+    "KEEP",
+    "KEYDOWN",
+    "KEYFRAMES_RULE",
+    "KEYFRAME_RULE",
+    "KEYPRESS",
+    "KEYUP",
+    "KeyEvent",
+    "Keyboard",
+    "KeyboardEvent",
+    "KeyboardLayoutMap",
+    "KeyframeEffect",
+    "LENGTHADJUST_SPACING",
+    "LENGTHADJUST_SPACINGANDGLYPHS",
+    "LENGTHADJUST_UNKNOWN",
+    "LEQUAL",
+    "LESS",
+    "LINEAR",
+    "LINEAR_DISTANCE",
+    "LINEAR_MIPMAP_LINEAR",
+    "LINEAR_MIPMAP_NEAREST",
+    "LINES",
+    "LINE_LOOP",
+    "LINE_STRIP",
+    "LINE_WIDTH",
+    "LINK_STATUS",
+    "LIVE",
+    "LN10",
+    "LN2",
+    "LOADED",
+    "LOADING",
+    "LOG10E",
+    "LOG2E",
+    "LOWPASS",
+    "LOWSHELF",
+    "LOW_FLOAT",
+    "LOW_INT",
+    "LSException",
+    "LSParserFilter",
+    "LUMINANCE",
+    "LUMINANCE_ALPHA",
+    "LargestContentfulPaint",
+    "LayoutShift",
+    "LayoutShiftAttribution",
+    "LinearAccelerationSensor",
+    "LinkError",
+    "ListFormat",
+    "LocalMediaStream",
+    "Locale",
+    "Location",
+    "Lock",
+    "LockManager",
+    "MAX",
+    "MAX_3D_TEXTURE_SIZE",
+    "MAX_ARRAY_TEXTURE_LAYERS",
+    "MAX_CLIENT_WAIT_TIMEOUT_WEBGL",
+    "MAX_COLOR_ATTACHMENTS",
+    "MAX_COMBINED_FRAGMENT_UNIFORM_COMPONENTS",
+    "MAX_COMBINED_TEXTURE_IMAGE_UNITS",
+    "MAX_COMBINED_UNIFORM_BLOCKS",
+    "MAX_COMBINED_VERTEX_UNIFORM_COMPONENTS",
+    "MAX_CUBE_MAP_TEXTURE_SIZE",
+    "MAX_DRAW_BUFFERS",
+    "MAX_ELEMENTS_INDICES",
+    "MAX_ELEMENTS_VERTICES",
+    "MAX_ELEMENT_INDEX",
+    "MAX_FRAGMENT_INPUT_COMPONENTS",
+    "MAX_FRAGMENT_UNIFORM_BLOCKS",
+    "MAX_FRAGMENT_UNIFORM_COMPONENTS",
+    "MAX_FRAGMENT_UNIFORM_VECTORS",
+    "MAX_PROGRAM_TEXEL_OFFSET",
+    "MAX_RENDERBUFFER_SIZE",
+    "MAX_SAFE_INTEGER",
+    "MAX_SAMPLES",
+    "MAX_SERVER_WAIT_TIMEOUT",
+    "MAX_TEXTURE_IMAGE_UNITS",
+    "MAX_TEXTURE_LOD_BIAS",
+    "MAX_TEXTURE_MAX_ANISOTROPY_EXT",
+    "MAX_TEXTURE_SIZE",
+    "MAX_TRANSFORM_FEEDBACK_INTERLEAVED_COMPONENTS",
+    "MAX_TRANSFORM_FEEDBACK_SEPARATE_ATTRIBS",
+    "MAX_TRANSFORM_FEEDBACK_SEPARATE_COMPONENTS",
+    "MAX_UNIFORM_BLOCK_SIZE",
+    "MAX_UNIFORM_BUFFER_BINDINGS",
+    "MAX_VALUE",
+    "MAX_VARYING_COMPONENTS",
+    "MAX_VARYING_VECTORS",
+    "MAX_VERTEX_ATTRIBS",
+    "MAX_VERTEX_OUTPUT_COMPONENTS",
+    "MAX_VERTEX_TEXTURE_IMAGE_UNITS",
+    "MAX_VERTEX_UNIFORM_BLOCKS",
+    "MAX_VERTEX_UNIFORM_COMPONENTS",
+    "MAX_VERTEX_UNIFORM_VECTORS",
+    "MAX_VIEWPORT_DIMS",
+    "MEDIA_ERR_ABORTED",
+    "MEDIA_ERR_DECODE",
+    "MEDIA_ERR_ENCRYPTED",
+    "MEDIA_ERR_NETWORK",
+    "MEDIA_ERR_SRC_NOT_SUPPORTED",
+    "MEDIA_KEYERR_CLIENT",
+    "MEDIA_KEYERR_DOMAIN",
+    "MEDIA_KEYERR_HARDWARECHANGE",
+    "MEDIA_KEYERR_OUTPUT",
+    "MEDIA_KEYERR_SERVICE",
+    "MEDIA_KEYERR_UNKNOWN",
+    "MEDIA_RULE",
+    "MEDIUM_FLOAT",
+    "MEDIUM_INT",
+    "META_MASK",
+    "MIDIAccess",
+    "MIDIConnectionEvent",
+    "MIDIInput",
+    "MIDIInputMap",
+    "MIDIMessageEvent",
+    "MIDIOutput",
+    "MIDIOutputMap",
+    "MIDIPort",
+    "MIN",
+    "MIN_PROGRAM_TEXEL_OFFSET",
+    "MIN_SAFE_INTEGER",
+    "MIN_VALUE",
+    "MIRRORED_REPEAT",
+    "MODE_ASYNCHRONOUS",
+    "MODE_SYNCHRONOUS",
+    "MODIFICATION",
+    "MOUSEDOWN",
+    "MOUSEDRAG",
+    "MOUSEMOVE",
+    "MOUSEOUT",
+    "MOUSEOVER",
+    "MOUSEUP",
+    "MOZ_KEYFRAMES_RULE",
+    "MOZ_KEYFRAME_RULE",
+    "MOZ_SOURCE_CURSOR",
+    "MOZ_SOURCE_ERASER",
+    "MOZ_SOURCE_KEYBOARD",
+    "MOZ_SOURCE_MOUSE",
+    "MOZ_SOURCE_PEN",
+    "MOZ_SOURCE_TOUCH",
+    "MOZ_SOURCE_UNKNOWN",
+    "MSGESTURE_FLAG_BEGIN",
+    "MSGESTURE_FLAG_CANCEL",
+    "MSGESTURE_FLAG_END",
+    "MSGESTURE_FLAG_INERTIA",
+    "MSGESTURE_FLAG_NONE",
+    "MSPOINTER_TYPE_MOUSE",
+    "MSPOINTER_TYPE_PEN",
+    "MSPOINTER_TYPE_TOUCH",
+    "MS_ASYNC_CALLBACK_STATUS_ASSIGN_DELEGATE",
+    "MS_ASYNC_CALLBACK_STATUS_CANCEL",
+    "MS_ASYNC_CALLBACK_STATUS_CHOOSEANY",
+    "MS_ASYNC_CALLBACK_STATUS_ERROR",
+    "MS_ASYNC_CALLBACK_STATUS_JOIN",
+    "MS_ASYNC_OP_STATUS_CANCELED",
+    "MS_ASYNC_OP_STATUS_ERROR",
+    "MS_ASYNC_OP_STATUS_SUCCESS",
+    "MS_MANIPULATION_STATE_ACTIVE",
+    "MS_MANIPULATION_STATE_CANCELLED",
+    "MS_MANIPULATION_STATE_COMMITTED",
+    "MS_MANIPULATION_STATE_DRAGGING",
+    "MS_MANIPULATION_STATE_INERTIA",
+    "MS_MANIPULATION_STATE_PRESELECT",
+    "MS_MANIPULATION_STATE_SELECTING",
+    "MS_MANIPULATION_STATE_STOPPED",
+    "MS_MEDIA_ERR_ENCRYPTED",
+    "MS_MEDIA_KEYERR_CLIENT",
+    "MS_MEDIA_KEYERR_DOMAIN",
+    "MS_MEDIA_KEYERR_HARDWARECHANGE",
+    "MS_MEDIA_KEYERR_OUTPUT",
+    "MS_MEDIA_KEYERR_SERVICE",
+    "MS_MEDIA_KEYERR_UNKNOWN",
+    "Map",
+    "Math",
+    "MathMLElement",
+    "MediaCapabilities",
+    "MediaCapabilitiesInfo",
+    "MediaController",
+    "MediaDeviceInfo",
+    "MediaDevices",
+    "MediaElementAudioSourceNode",
+    "MediaEncryptedEvent",
+    "MediaError",
+    "MediaKeyError",
+    "MediaKeyEvent",
+    "MediaKeyMessageEvent",
+    "MediaKeyNeededEvent",
+    "MediaKeySession",
+    "MediaKeyStatusMap",
+    "MediaKeySystemAccess",
+    "MediaKeys",
+    "MediaList",
+    "MediaMetadata",
+    "MediaQueryList",
+    "MediaQueryListEvent",
+    "MediaRecorder",
+    "MediaRecorderErrorEvent",
+    "MediaSession",
+    "MediaSettingsRange",
+    "MediaSource",
+    "MediaStream",
+    "MediaStreamAudioDestinationNode",
+    "MediaStreamAudioSourceNode",
+    "MediaStreamEvent",
+    "MediaStreamTrack",
+    "MediaStreamTrackAudioSourceNode",
+    "MediaStreamTrackEvent",
+    "Memory",
+    "MessageChannel",
+    "MessageEvent",
+    "MessagePort",
+    "Methods",
+    "MimeType",
+    "MimeTypeArray",
+    "Module",
+    "MouseEvent",
+    "MouseScrollEvent",
+    "MozAnimation",
+    "MozAnimationDelay",
+    "MozAnimationDirection",
+    "MozAnimationDuration",
+    "MozAnimationFillMode",
+    "MozAnimationIterationCount",
+    "MozAnimationName",
+    "MozAnimationPlayState",
+    "MozAnimationTimingFunction",
+    "MozAppearance",
+    "MozBackfaceVisibility",
+    "MozBinding",
+    "MozBorderBottomColors",
+    "MozBorderEnd",
+    "MozBorderEndColor",
+    "MozBorderEndStyle",
+    "MozBorderEndWidth",
+    "MozBorderImage",
+    "MozBorderLeftColors",
+    "MozBorderRightColors",
+    "MozBorderStart",
+    "MozBorderStartColor",
+    "MozBorderStartStyle",
+    "MozBorderStartWidth",
+    "MozBorderTopColors",
+    "MozBoxAlign",
+    "MozBoxDirection",
+    "MozBoxFlex",
+    "MozBoxOrdinalGroup",
+    "MozBoxOrient",
+    "MozBoxPack",
+    "MozBoxSizing",
+    "MozCSSKeyframeRule",
+    "MozCSSKeyframesRule",
+    "MozColumnCount",
+    "MozColumnFill",
+    "MozColumnGap",
+    "MozColumnRule",
+    "MozColumnRuleColor",
+    "MozColumnRuleStyle",
+    "MozColumnRuleWidth",
+    "MozColumnWidth",
+    "MozColumns",
+    "MozContactChangeEvent",
+    "MozFloatEdge",
+    "MozFontFeatureSettings",
+    "MozFontLanguageOverride",
+    "MozForceBrokenImageIcon",
+    "MozHyphens",
+    "MozImageRegion",
+    "MozMarginEnd",
+    "MozMarginStart",
+    "MozMmsEvent",
+    "MozMmsMessage",
+    "MozMobileMessageThread",
+    "MozOSXFontSmoothing",
+    "MozOrient",
+    "MozOsxFontSmoothing",
+    "MozOutlineRadius",
+    "MozOutlineRadiusBottomleft",
+    "MozOutlineRadiusBottomright",
+    "MozOutlineRadiusTopleft",
+    "MozOutlineRadiusTopright",
+    "MozPaddingEnd",
+    "MozPaddingStart",
+    "MozPerspective",
+    "MozPerspectiveOrigin",
+    "MozPowerManager",
+    "MozSettingsEvent",
+    "MozSmsEvent",
+    "MozSmsMessage",
+    "MozStackSizing",
+    "MozTabSize",
+    "MozTextAlignLast",
+    "MozTextDecorationColor",
+    "MozTextDecorationLine",
+    "MozTextDecorationStyle",
+    "MozTextSizeAdjust",
+    "MozTransform",
+    "MozTransformOrigin",
+    "MozTransformStyle",
+    "MozTransition",
+    "MozTransitionDelay",
+    "MozTransitionDuration",
+    "MozTransitionProperty",
+    "MozTransitionTimingFunction",
+    "MozUserFocus",
+    "MozUserInput",
+    "MozUserModify",
+    "MozUserSelect",
+    "MozWindowDragging",
+    "MozWindowShadow",
+    "MutationEvent",
+    "MutationObserver",
+    "MutationRecord",
+    "NAMESPACE_ERR",
+    "NAMESPACE_RULE",
+    "NEAREST",
+    "NEAREST_MIPMAP_LINEAR",
+    "NEAREST_MIPMAP_NEAREST",
+    "NEGATIVE_INFINITY",
+    "NETWORK_EMPTY",
+    "NETWORK_ERR",
+    "NETWORK_IDLE",
+    "NETWORK_LOADED",
+    "NETWORK_LOADING",
+    "NETWORK_NO_SOURCE",
+    "NEVER",
+    "NEW",
+    "NEXT",
+    "NEXT_NO_DUPLICATE",
+    "NICEST",
+    "NODE_AFTER",
+    "NODE_BEFORE",
+    "NODE_BEFORE_AND_AFTER",
+    "NODE_INSIDE",
+    "NONE",
+    "NON_TRANSIENT_ERR",
+    "NOTATION_NODE",
+    "NOTCH",
+    "NOTEQUAL",
+    "NOT_ALLOWED_ERR",
+    "NOT_FOUND_ERR",
+    "NOT_READABLE_ERR",
+    "NOT_SUPPORTED_ERR",
+    "NO_DATA_ALLOWED_ERR",
+    "NO_ERR",
+    "NO_ERROR",
+    "NO_MODIFICATION_ALLOWED_ERR",
+    "NUMBER_TYPE",
+    "NUM_COMPRESSED_TEXTURE_FORMATS",
+    "NaN",
+    "NamedNodeMap",
+    "NavigationPreloadManager",
+    "Navigator",
+    "NearbyLinks",
+    "NetworkInformation",
+    "Node",
+    "NodeFilter",
+    "NodeIterator",
+    "NodeList",
+    "Notation",
+    "Notification",
+    "NotifyPaintEvent",
+    "Number",
+    "NumberFormat",
+    "OBJECT_TYPE",
+    "OBSOLETE",
+    "OK",
+    "ONE",
+    "ONE_MINUS_CONSTANT_ALPHA",
+    "ONE_MINUS_CONSTANT_COLOR",
+    "ONE_MINUS_DST_ALPHA",
+    "ONE_MINUS_DST_COLOR",
+    "ONE_MINUS_SRC_ALPHA",
+    "ONE_MINUS_SRC_COLOR",
+    "OPEN",
+    "OPENED",
+    "OPENING",
+    "ORDERED_NODE_ITERATOR_TYPE",
+    "ORDERED_NODE_SNAPSHOT_TYPE",
+    "OTHER_ERROR",
+    "OUT_OF_MEMORY",
+    "Object",
+    "OfflineAudioCompletionEvent",
+    "OfflineAudioContext",
+    "OfflineResourceList",
+    "OffscreenCanvas",
+    "OffscreenCanvasRenderingContext2D",
+    "Option",
+    "OrientationSensor",
+    "OscillatorNode",
+    "OverconstrainedError",
+    "OverflowEvent",
+    "PACK_ALIGNMENT",
+    "PACK_ROW_LENGTH",
+    "PACK_SKIP_PIXELS",
+    "PACK_SKIP_ROWS",
+    "PAGE_RULE",
+    "PARSE_ERR",
+    "PATHSEG_ARC_ABS",
+    "PATHSEG_ARC_REL",
+    "PATHSEG_CLOSEPATH",
+    "PATHSEG_CURVETO_CUBIC_ABS",
+    "PATHSEG_CURVETO_CUBIC_REL",
+    "PATHSEG_CURVETO_CUBIC_SMOOTH_ABS",
+    "PATHSEG_CURVETO_CUBIC_SMOOTH_REL",
+    "PATHSEG_CURVETO_QUADRATIC_ABS",
+    "PATHSEG_CURVETO_QUADRATIC_REL",
+    "PATHSEG_CURVETO_QUADRATIC_SMOOTH_ABS",
+    "PATHSEG_CURVETO_QUADRATIC_SMOOTH_REL",
+    "PATHSEG_LINETO_ABS",
+    "PATHSEG_LINETO_HORIZONTAL_ABS",
+    "PATHSEG_LINETO_HORIZONTAL_REL",
+    "PATHSEG_LINETO_REL",
+    "PATHSEG_LINETO_VERTICAL_ABS",
+    "PATHSEG_LINETO_VERTICAL_REL",
+    "PATHSEG_MOVETO_ABS",
+    "PATHSEG_MOVETO_REL",
+    "PATHSEG_UNKNOWN",
+    "PATH_EXISTS_ERR",
+    "PEAKING",
+    "PERMISSION_DENIED",
+    "PERSISTENT",
+    "PI",
+    "PIXEL_PACK_BUFFER",
+    "PIXEL_PACK_BUFFER_BINDING",
+    "PIXEL_UNPACK_BUFFER",
+    "PIXEL_UNPACK_BUFFER_BINDING",
+    "PLAYING_STATE",
+    "POINTS",
+    "POLYGON_OFFSET_FACTOR",
+    "POLYGON_OFFSET_FILL",
+    "POLYGON_OFFSET_UNITS",
+    "POSITION_UNAVAILABLE",
+    "POSITIVE_INFINITY",
+    "PREV",
+    "PREV_NO_DUPLICATE",
+    "PROCESSING_INSTRUCTION_NODE",
+    "PageChangeEvent",
+    "PageTransitionEvent",
+    "PaintRequest",
+    "PaintRequestList",
+    "PannerNode",
+    "PasswordCredential",
+    "Path2D",
+    "PaymentAddress",
+    "PaymentInstruments",
+    "PaymentManager",
+    "PaymentMethodChangeEvent",
+    "PaymentRequest",
+    "PaymentRequestUpdateEvent",
+    "PaymentResponse",
+    "Performance",
+    "PerformanceElementTiming",
+    "PerformanceEntry",
+    "PerformanceEventTiming",
+    "PerformanceLongTaskTiming",
+    "PerformanceMark",
+    "PerformanceMeasure",
+    "PerformanceNavigation",
+    "PerformanceNavigationTiming",
+    "PerformanceObserver",
+    "PerformanceObserverEntryList",
+    "PerformancePaintTiming",
+    "PerformanceResourceTiming",
+    "PerformanceServerTiming",
+    "PerformanceTiming",
+    "PeriodicSyncManager",
+    "PeriodicWave",
+    "PermissionStatus",
+    "Permissions",
+    "PhotoCapabilities",
+    "PictureInPictureWindow",
+    "Plugin",
+    "PluginArray",
+    "PluralRules",
+    "PointerEvent",
+    "PopStateEvent",
+    "PopupBlockedEvent",
+    "Presentation",
+    "PresentationAvailability",
+    "PresentationConnection",
+    "PresentationConnectionAvailableEvent",
+    "PresentationConnectionCloseEvent",
+    "PresentationConnectionList",
+    "PresentationReceiver",
+    "PresentationRequest",
+    "ProcessingInstruction",
+    "ProgressEvent",
+    "Promise",
+    "PromiseRejectionEvent",
+    "PropertyNodeList",
+    "Proxy",
+    "PublicKeyCredential",
+    "PushManager",
+    "PushSubscription",
+    "PushSubscriptionOptions",
+    "Q",
+    "QUERY_RESULT",
+    "QUERY_RESULT_AVAILABLE",
+    "QUOTA_ERR",
+    "QUOTA_EXCEEDED_ERR",
+    "QueryInterface",
+    "R11F_G11F_B10F",
+    "R16F",
+    "R16I",
+    "R16UI",
+    "R32F",
+    "R32I",
+    "R32UI",
+    "R8",
+    "R8I",
+    "R8UI",
+    "R8_SNORM",
+    "RASTERIZER_DISCARD",
+    "READ_BUFFER",
+    "READ_FRAMEBUFFER",
+    "READ_FRAMEBUFFER_BINDING",
+    "READ_ONLY",
+    "READ_ONLY_ERR",
+    "READ_WRITE",
+    "RED",
+    "RED_BITS",
+    "RED_INTEGER",
+    "REMOVAL",
+    "RENDERBUFFER",
+    "RENDERBUFFER_ALPHA_SIZE",
+    "RENDERBUFFER_BINDING",
+    "RENDERBUFFER_BLUE_SIZE",
+    "RENDERBUFFER_DEPTH_SIZE",
+    "RENDERBUFFER_GREEN_SIZE",
+    "RENDERBUFFER_HEIGHT",
+    "RENDERBUFFER_INTERNAL_FORMAT",
+    "RENDERBUFFER_RED_SIZE",
+    "RENDERBUFFER_SAMPLES",
+    "RENDERBUFFER_STENCIL_SIZE",
+    "RENDERBUFFER_WIDTH",
+    "RENDERER",
+    "RENDERING_INTENT_ABSOLUTE_COLORIMETRIC",
+    "RENDERING_INTENT_AUTO",
+    "RENDERING_INTENT_PERCEPTUAL",
+    "RENDERING_INTENT_RELATIVE_COLORIMETRIC",
+    "RENDERING_INTENT_SATURATION",
+    "RENDERING_INTENT_UNKNOWN",
+    "REPEAT",
+    "REPLACE",
+    "RG",
+    "RG16F",
+    "RG16I",
+    "RG16UI",
+    "RG32F",
+    "RG32I",
+    "RG32UI",
+    "RG8",
+    "RG8I",
+    "RG8UI",
+    "RG8_SNORM",
+    "RGB",
+    "RGB10_A2",
+    "RGB10_A2UI",
+    "RGB16F",
+    "RGB16I",
+    "RGB16UI",
+    "RGB32F",
+    "RGB32I",
+    "RGB32UI",
+    "RGB565",
+    "RGB5_A1",
+    "RGB8",
+    "RGB8I",
+    "RGB8UI",
+    "RGB8_SNORM",
+    "RGB9_E5",
+    "RGBA",
+    "RGBA16F",
+    "RGBA16I",
+    "RGBA16UI",
+    "RGBA32F",
+    "RGBA32I",
+    "RGBA32UI",
+    "RGBA4",
+    "RGBA8",
+    "RGBA8I",
+    "RGBA8UI",
+    "RGBA8_SNORM",
+    "RGBA_INTEGER",
+    "RGBColor",
+    "RGB_INTEGER",
+    "RG_INTEGER",
+    "ROTATION_CLOCKWISE",
+    "ROTATION_COUNTERCLOCKWISE",
+    "RTCCertificate",
+    "RTCDTMFSender",
+    "RTCDTMFToneChangeEvent",
+    "RTCDataChannel",
+    "RTCDataChannelEvent",
+    "RTCDtlsTransport",
+    "RTCError",
+    "RTCErrorEvent",
+    "RTCIceCandidate",
+    "RTCIceTransport",
+    "RTCPeerConnection",
+    "RTCPeerConnectionIceErrorEvent",
+    "RTCPeerConnectionIceEvent",
+    "RTCRtpReceiver",
+    "RTCRtpSender",
+    "RTCRtpTransceiver",
+    "RTCSctpTransport",
+    "RTCSessionDescription",
+    "RTCStatsReport",
+    "RTCTrackEvent",
+    "RadioNodeList",
+    "Range",
+    "RangeError",
+    "RangeException",
+    "ReadableStream",
+    "ReadableStreamDefaultReader",
+    "RecordErrorEvent",
+    "Rect",
+    "ReferenceError",
+    "Reflect",
+    "RegExp",
+    "RelativeOrientationSensor",
+    "RelativeTimeFormat",
+    "RemotePlayback",
+    "Report",
+    "ReportBody",
+    "ReportingObserver",
+    "Request",
+    "ResizeObserver",
+    "ResizeObserverEntry",
+    "ResizeObserverSize",
+    "Response",
+    "RuntimeError",
+    "SAMPLER_2D",
+    "SAMPLER_2D_ARRAY",
+    "SAMPLER_2D_ARRAY_SHADOW",
+    "SAMPLER_2D_SHADOW",
+    "SAMPLER_3D",
+    "SAMPLER_BINDING",
+    "SAMPLER_CUBE",
+    "SAMPLER_CUBE_SHADOW",
+    "SAMPLES",
+    "SAMPLE_ALPHA_TO_COVERAGE",
+    "SAMPLE_BUFFERS",
+    "SAMPLE_COVERAGE",
+    "SAMPLE_COVERAGE_INVERT",
+    "SAMPLE_COVERAGE_VALUE",
+    "SAWTOOTH",
+    "SCHEDULED_STATE",
+    "SCISSOR_BOX",
+    "SCISSOR_TEST",
+    "SCROLL_PAGE_DOWN",
+    "SCROLL_PAGE_UP",
+    "SDP_ANSWER",
+    "SDP_OFFER",
+    "SDP_PRANSWER",
+    "SECURITY_ERR",
+    "SELECT",
+    "SEPARATE_ATTRIBS",
+    "SERIALIZE_ERR",
+    "SEVERITY_ERROR",
+    "SEVERITY_FATAL_ERROR",
+    "SEVERITY_WARNING",
+    "SHADER_COMPILER",
+    "SHADER_TYPE",
+    "SHADING_LANGUAGE_VERSION",
+    "SHIFT_MASK",
+    "SHORT",
+    "SHOWING",
+    "SHOW_ALL",
+    "SHOW_ATTRIBUTE",
+    "SHOW_CDATA_SECTION",
+    "SHOW_COMMENT",
+    "SHOW_DOCUMENT",
+    "SHOW_DOCUMENT_FRAGMENT",
+    "SHOW_DOCUMENT_TYPE",
+    "SHOW_ELEMENT",
+    "SHOW_ENTITY",
+    "SHOW_ENTITY_REFERENCE",
+    "SHOW_NOTATION",
+    "SHOW_PROCESSING_INSTRUCTION",
+    "SHOW_TEXT",
+    "SIGNALED",
+    "SIGNED_NORMALIZED",
+    "SINE",
+    "SOUNDFIELD",
+    "SQLException",
+    "SQRT1_2",
+    "SQRT2",
+    "SQUARE",
+    "SRC_ALPHA",
+    "SRC_ALPHA_SATURATE",
+    "SRC_COLOR",
+    "SRGB",
+    "SRGB8",
+    "SRGB8_ALPHA8",
+    "START_TO_END",
+    "START_TO_START",
+    "STATIC_COPY",
+    "STATIC_DRAW",
+    "STATIC_READ",
+    "STENCIL",
+    "STENCIL_ATTACHMENT",
+    "STENCIL_BACK_FAIL",
+    "STENCIL_BACK_FUNC",
+    "STENCIL_BACK_PASS_DEPTH_FAIL",
+    "STENCIL_BACK_PASS_DEPTH_PASS",
+    "STENCIL_BACK_REF",
+    "STENCIL_BACK_VALUE_MASK",
+    "STENCIL_BACK_WRITEMASK",
+    "STENCIL_BITS",
+    "STENCIL_BUFFER_BIT",
+    "STENCIL_CLEAR_VALUE",
+    "STENCIL_FAIL",
+    "STENCIL_FUNC",
+    "STENCIL_INDEX",
+    "STENCIL_INDEX8",
+    "STENCIL_PASS_DEPTH_FAIL",
+    "STENCIL_PASS_DEPTH_PASS",
+    "STENCIL_REF",
+    "STENCIL_TEST",
+    "STENCIL_VALUE_MASK",
+    "STENCIL_WRITEMASK",
+    "STREAM_COPY",
+    "STREAM_DRAW",
+    "STREAM_READ",
+    "STRING_TYPE",
+    "STYLE_RULE",
+    "SUBPIXEL_BITS",
+    "SUPPORTS_RULE",
+    "SVGAElement",
+    "SVGAltGlyphDefElement",
+    "SVGAltGlyphElement",
+    "SVGAltGlyphItemElement",
+    "SVGAngle",
+    "SVGAnimateColorElement",
+    "SVGAnimateElement",
+    "SVGAnimateMotionElement",
+    "SVGAnimateTransformElement",
+    "SVGAnimatedAngle",
+    "SVGAnimatedBoolean",
+    "SVGAnimatedEnumeration",
+    "SVGAnimatedInteger",
+    "SVGAnimatedLength",
+    "SVGAnimatedLengthList",
+    "SVGAnimatedNumber",
+    "SVGAnimatedNumberList",
+    "SVGAnimatedPreserveAspectRatio",
+    "SVGAnimatedRect",
+    "SVGAnimatedString",
+    "SVGAnimatedTransformList",
+    "SVGAnimationElement",
+    "SVGCircleElement",
+    "SVGClipPathElement",
+    "SVGColor",
+    "SVGComponentTransferFunctionElement",
+    "SVGCursorElement",
+    "SVGDefsElement",
+    "SVGDescElement",
+    "SVGDiscardElement",
+    "SVGDocument",
+    "SVGElement",
+    "SVGElementInstance",
+    "SVGElementInstanceList",
+    "SVGEllipseElement",
+    "SVGException",
+    "SVGFEBlendElement",
+    "SVGFEColorMatrixElement",
+    "SVGFEComponentTransferElement",
+    "SVGFECompositeElement",
+    "SVGFEConvolveMatrixElement",
+    "SVGFEDiffuseLightingElement",
+    "SVGFEDisplacementMapElement",
+    "SVGFEDistantLightElement",
+    "SVGFEDropShadowElement",
+    "SVGFEFloodElement",
+    "SVGFEFuncAElement",
+    "SVGFEFuncBElement",
+    "SVGFEFuncGElement",
+    "SVGFEFuncRElement",
+    "SVGFEGaussianBlurElement",
+    "SVGFEImageElement",
+    "SVGFEMergeElement",
+    "SVGFEMergeNodeElement",
+    "SVGFEMorphologyElement",
+    "SVGFEOffsetElement",
+    "SVGFEPointLightElement",
+    "SVGFESpecularLightingElement",
+    "SVGFESpotLightElement",
+    "SVGFETileElement",
+    "SVGFETurbulenceElement",
+    "SVGFilterElement",
+    "SVGFontElement",
+    "SVGFontFaceElement",
+    "SVGFontFaceFormatElement",
+    "SVGFontFaceNameElement",
+    "SVGFontFaceSrcElement",
+    "SVGFontFaceUriElement",
+    "SVGForeignObjectElement",
+    "SVGGElement",
+    "SVGGeometryElement",
+    "SVGGlyphElement",
+    "SVGGlyphRefElement",
+    "SVGGradientElement",
+    "SVGGraphicsElement",
+    "SVGHKernElement",
+    "SVGImageElement",
+    "SVGLength",
+    "SVGLengthList",
+    "SVGLineElement",
+    "SVGLinearGradientElement",
+    "SVGMPathElement",
+    "SVGMarkerElement",
+    "SVGMaskElement",
+    "SVGMatrix",
+    "SVGMetadataElement",
+    "SVGMissingGlyphElement",
+    "SVGNumber",
+    "SVGNumberList",
+    "SVGPaint",
+    "SVGPathElement",
+    "SVGPathSeg",
+    "SVGPathSegArcAbs",
+    "SVGPathSegArcRel",
+    "SVGPathSegClosePath",
+    "SVGPathSegCurvetoCubicAbs",
+    "SVGPathSegCurvetoCubicRel",
+    "SVGPathSegCurvetoCubicSmoothAbs",
+    "SVGPathSegCurvetoCubicSmoothRel",
+    "SVGPathSegCurvetoQuadraticAbs",
+    "SVGPathSegCurvetoQuadraticRel",
+    "SVGPathSegCurvetoQuadraticSmoothAbs",
+    "SVGPathSegCurvetoQuadraticSmoothRel",
+    "SVGPathSegLinetoAbs",
+    "SVGPathSegLinetoHorizontalAbs",
+    "SVGPathSegLinetoHorizontalRel",
+    "SVGPathSegLinetoRel",
+    "SVGPathSegLinetoVerticalAbs",
+    "SVGPathSegLinetoVerticalRel",
+    "SVGPathSegList",
+    "SVGPathSegMovetoAbs",
+    "SVGPathSegMovetoRel",
+    "SVGPatternElement",
+    "SVGPoint",
+    "SVGPointList",
+    "SVGPolygonElement",
+    "SVGPolylineElement",
+    "SVGPreserveAspectRatio",
+    "SVGRadialGradientElement",
+    "SVGRect",
+    "SVGRectElement",
+    "SVGRenderingIntent",
+    "SVGSVGElement",
+    "SVGScriptElement",
+    "SVGSetElement",
+    "SVGStopElement",
+    "SVGStringList",
+    "SVGStyleElement",
+    "SVGSwitchElement",
+    "SVGSymbolElement",
+    "SVGTRefElement",
+    "SVGTSpanElement",
+    "SVGTextContentElement",
+    "SVGTextElement",
+    "SVGTextPathElement",
+    "SVGTextPositioningElement",
+    "SVGTitleElement",
+    "SVGTransform",
+    "SVGTransformList",
+    "SVGUnitTypes",
+    "SVGUseElement",
+    "SVGVKernElement",
+    "SVGViewElement",
+    "SVGViewSpec",
+    "SVGZoomAndPan",
+    "SVGZoomEvent",
+    "SVG_ANGLETYPE_DEG",
+    "SVG_ANGLETYPE_GRAD",
+    "SVG_ANGLETYPE_RAD",
+    "SVG_ANGLETYPE_UNKNOWN",
+    "SVG_ANGLETYPE_UNSPECIFIED",
+    "SVG_CHANNEL_A",
+    "SVG_CHANNEL_B",
+    "SVG_CHANNEL_G",
+    "SVG_CHANNEL_R",
+    "SVG_CHANNEL_UNKNOWN",
+    "SVG_COLORTYPE_CURRENTCOLOR",
+    "SVG_COLORTYPE_RGBCOLOR",
+    "SVG_COLORTYPE_RGBCOLOR_ICCCOLOR",
+    "SVG_COLORTYPE_UNKNOWN",
+    "SVG_EDGEMODE_DUPLICATE",
+    "SVG_EDGEMODE_NONE",
+    "SVG_EDGEMODE_UNKNOWN",
+    "SVG_EDGEMODE_WRAP",
+    "SVG_FEBLEND_MODE_COLOR",
+    "SVG_FEBLEND_MODE_COLOR_BURN",
+    "SVG_FEBLEND_MODE_COLOR_DODGE",
+    "SVG_FEBLEND_MODE_DARKEN",
+    "SVG_FEBLEND_MODE_DIFFERENCE",
+    "SVG_FEBLEND_MODE_EXCLUSION",
+    "SVG_FEBLEND_MODE_HARD_LIGHT",
+    "SVG_FEBLEND_MODE_HUE",
+    "SVG_FEBLEND_MODE_LIGHTEN",
+    "SVG_FEBLEND_MODE_LUMINOSITY",
+    "SVG_FEBLEND_MODE_MULTIPLY",
+    "SVG_FEBLEND_MODE_NORMAL",
+    "SVG_FEBLEND_MODE_OVERLAY",
+    "SVG_FEBLEND_MODE_SATURATION",
+    "SVG_FEBLEND_MODE_SCREEN",
+    "SVG_FEBLEND_MODE_SOFT_LIGHT",
+    "SVG_FEBLEND_MODE_UNKNOWN",
+    "SVG_FECOLORMATRIX_TYPE_HUEROTATE",
+    "SVG_FECOLORMATRIX_TYPE_LUMINANCETOALPHA",
+    "SVG_FECOLORMATRIX_TYPE_MATRIX",
+    "SVG_FECOLORMATRIX_TYPE_SATURATE",
+    "SVG_FECOLORMATRIX_TYPE_UNKNOWN",
+    "SVG_FECOMPONENTTRANSFER_TYPE_DISCRETE",
+    "SVG_FECOMPONENTTRANSFER_TYPE_GAMMA",
+    "SVG_FECOMPONENTTRANSFER_TYPE_IDENTITY",
+    "SVG_FECOMPONENTTRANSFER_TYPE_LINEAR",
+    "SVG_FECOMPONENTTRANSFER_TYPE_TABLE",
+    "SVG_FECOMPONENTTRANSFER_TYPE_UNKNOWN",
+    "SVG_FECOMPOSITE_OPERATOR_ARITHMETIC",
+    "SVG_FECOMPOSITE_OPERATOR_ATOP",
+    "SVG_FECOMPOSITE_OPERATOR_IN",
+    "SVG_FECOMPOSITE_OPERATOR_OUT",
+    "SVG_FECOMPOSITE_OPERATOR_OVER",
+    "SVG_FECOMPOSITE_OPERATOR_UNKNOWN",
+    "SVG_FECOMPOSITE_OPERATOR_XOR",
+    "SVG_INVALID_VALUE_ERR",
+    "SVG_LENGTHTYPE_CM",
+    "SVG_LENGTHTYPE_EMS",
+    "SVG_LENGTHTYPE_EXS",
+    "SVG_LENGTHTYPE_IN",
+    "SVG_LENGTHTYPE_MM",
+    "SVG_LENGTHTYPE_NUMBER",
+    "SVG_LENGTHTYPE_PC",
+    "SVG_LENGTHTYPE_PERCENTAGE",
+    "SVG_LENGTHTYPE_PT",
+    "SVG_LENGTHTYPE_PX",
+    "SVG_LENGTHTYPE_UNKNOWN",
+    "SVG_MARKERUNITS_STROKEWIDTH",
+    "SVG_MARKERUNITS_UNKNOWN",
+    "SVG_MARKERUNITS_USERSPACEONUSE",
+    "SVG_MARKER_ORIENT_ANGLE",
+    "SVG_MARKER_ORIENT_AUTO",
+    "SVG_MARKER_ORIENT_UNKNOWN",
+    "SVG_MASKTYPE_ALPHA",
+    "SVG_MASKTYPE_LUMINANCE",
+    "SVG_MATRIX_NOT_INVERTABLE",
+    "SVG_MEETORSLICE_MEET",
+    "SVG_MEETORSLICE_SLICE",
+    "SVG_MEETORSLICE_UNKNOWN",
+    "SVG_MORPHOLOGY_OPERATOR_DILATE",
+    "SVG_MORPHOLOGY_OPERATOR_ERODE",
+    "SVG_MORPHOLOGY_OPERATOR_UNKNOWN",
+    "SVG_PAINTTYPE_CURRENTCOLOR",
+    "SVG_PAINTTYPE_NONE",
+    "SVG_PAINTTYPE_RGBCOLOR",
+    "SVG_PAINTTYPE_RGBCOLOR_ICCCOLOR",
+    "SVG_PAINTTYPE_UNKNOWN",
+    "SVG_PAINTTYPE_URI",
+    "SVG_PAINTTYPE_URI_CURRENTCOLOR",
+    "SVG_PAINTTYPE_URI_NONE",
+    "SVG_PAINTTYPE_URI_RGBCOLOR",
+    "SVG_PAINTTYPE_URI_RGBCOLOR_ICCCOLOR",
+    "SVG_PRESERVEASPECTRATIO_NONE",
+    "SVG_PRESERVEASPECTRATIO_UNKNOWN",
+    "SVG_PRESERVEASPECTRATIO_XMAXYMAX",
+    "SVG_PRESERVEASPECTRATIO_XMAXYMID",
+    "SVG_PRESERVEASPECTRATIO_XMAXYMIN",
+    "SVG_PRESERVEASPECTRATIO_XMIDYMAX",
+    "SVG_PRESERVEASPECTRATIO_XMIDYMID",
+    "SVG_PRESERVEASPECTRATIO_XMIDYMIN",
+    "SVG_PRESERVEASPECTRATIO_XMINYMAX",
+    "SVG_PRESERVEASPECTRATIO_XMINYMID",
+    "SVG_PRESERVEASPECTRATIO_XMINYMIN",
+    "SVG_SPREADMETHOD_PAD",
+    "SVG_SPREADMETHOD_REFLECT",
+    "SVG_SPREADMETHOD_REPEAT",
+    "SVG_SPREADMETHOD_UNKNOWN",
+    "SVG_STITCHTYPE_NOSTITCH",
+    "SVG_STITCHTYPE_STITCH",
+    "SVG_STITCHTYPE_UNKNOWN",
+    "SVG_TRANSFORM_MATRIX",
+    "SVG_TRANSFORM_ROTATE",
+    "SVG_TRANSFORM_SCALE",
+    "SVG_TRANSFORM_SKEWX",
+    "SVG_TRANSFORM_SKEWY",
+    "SVG_TRANSFORM_TRANSLATE",
+    "SVG_TRANSFORM_UNKNOWN",
+    "SVG_TURBULENCE_TYPE_FRACTALNOISE",
+    "SVG_TURBULENCE_TYPE_TURBULENCE",
+    "SVG_TURBULENCE_TYPE_UNKNOWN",
+    "SVG_UNIT_TYPE_OBJECTBOUNDINGBOX",
+    "SVG_UNIT_TYPE_UNKNOWN",
+    "SVG_UNIT_TYPE_USERSPACEONUSE",
+    "SVG_WRONG_TYPE_ERR",
+    "SVG_ZOOMANDPAN_DISABLE",
+    "SVG_ZOOMANDPAN_MAGNIFY",
+    "SVG_ZOOMANDPAN_UNKNOWN",
+    "SYNC_CONDITION",
+    "SYNC_FENCE",
+    "SYNC_FLAGS",
+    "SYNC_FLUSH_COMMANDS_BIT",
+    "SYNC_GPU_COMMANDS_COMPLETE",
+    "SYNC_STATUS",
+    "SYNTAX_ERR",
+    "SavedPages",
+    "Screen",
+    "ScreenOrientation",
+    "Script",
+    "ScriptProcessorNode",
+    "ScrollAreaEvent",
+    "SecurityPolicyViolationEvent",
+    "Selection",
+    "Sensor",
+    "SensorErrorEvent",
+    "ServiceWorker",
+    "ServiceWorkerContainer",
+    "ServiceWorkerRegistration",
+    "SessionDescription",
+    "Set",
+    "ShadowRoot",
+    "SharedArrayBuffer",
+    "SharedWorker",
+    "SimpleGestureEvent",
+    "SourceBuffer",
+    "SourceBufferList",
+    "SpeechSynthesis",
+    "SpeechSynthesisErrorEvent",
+    "SpeechSynthesisEvent",
+    "SpeechSynthesisUtterance",
+    "SpeechSynthesisVoice",
+    "StaticRange",
+    "StereoPannerNode",
+    "StopIteration",
+    "Storage",
+    "StorageEvent",
+    "StorageManager",
+    "String",
+    "StructType",
+    "StylePropertyMap",
+    "StylePropertyMapReadOnly",
+    "StyleSheet",
+    "StyleSheetList",
+    "SubmitEvent",
+    "SubtleCrypto",
+    "Symbol",
+    "SyncManager",
+    "SyntaxError",
+    "TEMPORARY",
+    "TEXTPATH_METHODTYPE_ALIGN",
+    "TEXTPATH_METHODTYPE_STRETCH",
+    "TEXTPATH_METHODTYPE_UNKNOWN",
+    "TEXTPATH_SPACINGTYPE_AUTO",
+    "TEXTPATH_SPACINGTYPE_EXACT",
+    "TEXTPATH_SPACINGTYPE_UNKNOWN",
+    "TEXTURE",
+    "TEXTURE0",
+    "TEXTURE1",
+    "TEXTURE10",
+    "TEXTURE11",
+    "TEXTURE12",
+    "TEXTURE13",
+    "TEXTURE14",
+    "TEXTURE15",
+    "TEXTURE16",
+    "TEXTURE17",
+    "TEXTURE18",
+    "TEXTURE19",
+    "TEXTURE2",
+    "TEXTURE20",
+    "TEXTURE21",
+    "TEXTURE22",
+    "TEXTURE23",
+    "TEXTURE24",
+    "TEXTURE25",
+    "TEXTURE26",
+    "TEXTURE27",
+    "TEXTURE28",
+    "TEXTURE29",
+    "TEXTURE3",
+    "TEXTURE30",
+    "TEXTURE31",
+    "TEXTURE4",
+    "TEXTURE5",
+    "TEXTURE6",
+    "TEXTURE7",
+    "TEXTURE8",
+    "TEXTURE9",
+    "TEXTURE_2D",
+    "TEXTURE_2D_ARRAY",
+    "TEXTURE_3D",
+    "TEXTURE_BASE_LEVEL",
+    "TEXTURE_BINDING_2D",
+    "TEXTURE_BINDING_2D_ARRAY",
+    "TEXTURE_BINDING_3D",
+    "TEXTURE_BINDING_CUBE_MAP",
+    "TEXTURE_COMPARE_FUNC",
+    "TEXTURE_COMPARE_MODE",
+    "TEXTURE_CUBE_MAP",
+    "TEXTURE_CUBE_MAP_NEGATIVE_X",
+    "TEXTURE_CUBE_MAP_NEGATIVE_Y",
+    "TEXTURE_CUBE_MAP_NEGATIVE_Z",
+    "TEXTURE_CUBE_MAP_POSITIVE_X",
+    "TEXTURE_CUBE_MAP_POSITIVE_Y",
+    "TEXTURE_CUBE_MAP_POSITIVE_Z",
+    "TEXTURE_IMMUTABLE_FORMAT",
+    "TEXTURE_IMMUTABLE_LEVELS",
+    "TEXTURE_MAG_FILTER",
+    "TEXTURE_MAX_ANISOTROPY_EXT",
+    "TEXTURE_MAX_LEVEL",
+    "TEXTURE_MAX_LOD",
+    "TEXTURE_MIN_FILTER",
+    "TEXTURE_MIN_LOD",
+    "TEXTURE_WRAP_R",
+    "TEXTURE_WRAP_S",
+    "TEXTURE_WRAP_T",
+    "TEXT_NODE",
+    "TIMEOUT",
+    "TIMEOUT_ERR",
+    "TIMEOUT_EXPIRED",
+    "TIMEOUT_IGNORED",
+    "TOO_LARGE_ERR",
+    "TRANSACTION_INACTIVE_ERR",
+    "TRANSFORM_FEEDBACK",
+    "TRANSFORM_FEEDBACK_ACTIVE",
+    "TRANSFORM_FEEDBACK_BINDING",
+    "TRANSFORM_FEEDBACK_BUFFER",
+    "TRANSFORM_FEEDBACK_BUFFER_BINDING",
+    "TRANSFORM_FEEDBACK_BUFFER_MODE",
+    "TRANSFORM_FEEDBACK_BUFFER_SIZE",
+    "TRANSFORM_FEEDBACK_BUFFER_START",
+    "TRANSFORM_FEEDBACK_PAUSED",
+    "TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN",
+    "TRANSFORM_FEEDBACK_VARYINGS",
+    "TRIANGLE",
+    "TRIANGLES",
+    "TRIANGLE_FAN",
+    "TRIANGLE_STRIP",
+    "TYPE_BACK_FORWARD",
+    "TYPE_ERR",
+    "TYPE_MISMATCH_ERR",
+    "TYPE_NAVIGATE",
+    "TYPE_RELOAD",
+    "TYPE_RESERVED",
+    "Table",
+    "TaskAttributionTiming",
+    "Text",
+    "TextDecoder",
+    "TextDecoderStream",
+    "TextEncoder",
+    "TextEncoderStream",
+    "TextEvent",
+    "TextMetrics",
+    "TextTrack",
+    "TextTrackCue",
+    "TextTrackCueList",
+    "TextTrackList",
+    "TimeEvent",
+    "TimeRanges",
+    "Touch",
+    "TouchEvent",
+    "TouchList",
+    "TrackEvent",
+    "TransformStream",
+    "TransitionEvent",
+    "TreeWalker",
+    "TrustedHTML",
+    "TrustedScript",
+    "TrustedScriptURL",
+    "TrustedTypePolicy",
+    "TrustedTypePolicyFactory",
+    "TypeError",
+    "TypedObject",
+    "U2F",
+    "UIEvent",
+    "UNCACHED",
+    "UNIFORM_ARRAY_STRIDE",
+    "UNIFORM_BLOCK_ACTIVE_UNIFORMS",
+    "UNIFORM_BLOCK_ACTIVE_UNIFORM_INDICES",
+    "UNIFORM_BLOCK_BINDING",
+    "UNIFORM_BLOCK_DATA_SIZE",
+    "UNIFORM_BLOCK_INDEX",
+    "UNIFORM_BLOCK_REFERENCED_BY_FRAGMENT_SHADER",
+    "UNIFORM_BLOCK_REFERENCED_BY_VERTEX_SHADER",
+    "UNIFORM_BUFFER",
+    "UNIFORM_BUFFER_BINDING",
+    "UNIFORM_BUFFER_OFFSET_ALIGNMENT",
+    "UNIFORM_BUFFER_SIZE",
+    "UNIFORM_BUFFER_START",
+    "UNIFORM_IS_ROW_MAJOR",
+    "UNIFORM_MATRIX_STRIDE",
+    "UNIFORM_OFFSET",
+    "UNIFORM_SIZE",
+    "UNIFORM_TYPE",
+    "UNKNOWN_ERR",
+    "UNKNOWN_RULE",
+    "UNMASKED_RENDERER_WEBGL",
+    "UNMASKED_VENDOR_WEBGL",
+    "UNORDERED_NODE_ITERATOR_TYPE",
+    "UNORDERED_NODE_SNAPSHOT_TYPE",
+    "UNPACK_ALIGNMENT",
+    "UNPACK_COLORSPACE_CONVERSION_WEBGL",
+    "UNPACK_FLIP_Y_WEBGL",
+    "UNPACK_IMAGE_HEIGHT",
+    "UNPACK_PREMULTIPLY_ALPHA_WEBGL",
+    "UNPACK_ROW_LENGTH",
+    "UNPACK_SKIP_IMAGES",
+    "UNPACK_SKIP_PIXELS",
+    "UNPACK_SKIP_ROWS",
+    "UNSCHEDULED_STATE",
+    "UNSENT",
+    "UNSIGNALED",
+    "UNSIGNED_BYTE",
+    "UNSIGNED_INT",
+    "UNSIGNED_INT_10F_11F_11F_REV",
+    "UNSIGNED_INT_24_8",
+    "UNSIGNED_INT_2_10_10_10_REV",
+    "UNSIGNED_INT_5_9_9_9_REV",
+    "UNSIGNED_INT_SAMPLER_2D",
+    "UNSIGNED_INT_SAMPLER_2D_ARRAY",
+    "UNSIGNED_INT_SAMPLER_3D",
+    "UNSIGNED_INT_SAMPLER_CUBE",
+    "UNSIGNED_INT_VEC2",
+    "UNSIGNED_INT_VEC3",
+    "UNSIGNED_INT_VEC4",
+    "UNSIGNED_NORMALIZED",
+    "UNSIGNED_SHORT",
+    "UNSIGNED_SHORT_4_4_4_4",
+    "UNSIGNED_SHORT_5_5_5_1",
+    "UNSIGNED_SHORT_5_6_5",
+    "UNSPECIFIED_EVENT_TYPE_ERR",
+    "UPDATEREADY",
+    "URIError",
+    "URL",
+    "URLSearchParams",
+    "URLUnencoded",
+    "URL_MISMATCH_ERR",
+    "USB",
+    "USBAlternateInterface",
+    "USBConfiguration",
+    "USBConnectionEvent",
+    "USBDevice",
+    "USBEndpoint",
+    "USBInTransferResult",
+    "USBInterface",
+    "USBIsochronousInTransferPacket",
+    "USBIsochronousInTransferResult",
+    "USBIsochronousOutTransferPacket",
+    "USBIsochronousOutTransferResult",
+    "USBOutTransferResult",
+    "UTC",
+    "Uint16Array",
+    "Uint32Array",
+    "Uint8Array",
+    "Uint8ClampedArray",
+    "UserActivation",
+    "UserMessageHandler",
+    "UserMessageHandlersNamespace",
+    "UserProximityEvent",
+    "VALIDATE_STATUS",
+    "VALIDATION_ERR",
+    "VARIABLES_RULE",
+    "VENDOR",
+    "VERSION",
+    "VERSION_CHANGE",
+    "VERSION_ERR",
+    "VERTEX_ARRAY_BINDING",
+    "VERTEX_ATTRIB_ARRAY_BUFFER_BINDING",
+    "VERTEX_ATTRIB_ARRAY_DIVISOR",
+    "VERTEX_ATTRIB_ARRAY_DIVISOR_ANGLE",
+    "VERTEX_ATTRIB_ARRAY_ENABLED",
+    "VERTEX_ATTRIB_ARRAY_INTEGER",
+    "VERTEX_ATTRIB_ARRAY_NORMALIZED",
+    "VERTEX_ATTRIB_ARRAY_POINTER",
+    "VERTEX_ATTRIB_ARRAY_SIZE",
+    "VERTEX_ATTRIB_ARRAY_STRIDE",
+    "VERTEX_ATTRIB_ARRAY_TYPE",
+    "VERTEX_SHADER",
+    "VERTICAL",
+    "VERTICAL_AXIS",
+    "VER_ERR",
+    "VIEWPORT",
+    "VIEWPORT_RULE",
+    "VRDisplay",
+    "VRDisplayCapabilities",
+    "VRDisplayEvent",
+    "VREyeParameters",
+    "VRFieldOfView",
+    "VRFrameData",
+    "VRPose",
+    "VRStageParameters",
+    "VTTCue",
+    "VTTRegion",
+    "ValidityState",
+    "VideoPlaybackQuality",
+    "VideoStreamTrack",
+    "VisualViewport",
+    "WAIT_FAILED",
+    "WEBKIT_FILTER_RULE",
+    "WEBKIT_KEYFRAMES_RULE",
+    "WEBKIT_KEYFRAME_RULE",
+    "WEBKIT_REGION_RULE",
+    "WRONG_DOCUMENT_ERR",
+    "WakeLock",
+    "WakeLockSentinel",
+    "WasmAnyRef",
+    "WaveShaperNode",
+    "WeakMap",
+    "WeakRef",
+    "WeakSet",
+    "WebAssembly",
+    "WebGL2RenderingContext",
+    "WebGLActiveInfo",
+    "WebGLBuffer",
+    "WebGLContextEvent",
+    "WebGLFramebuffer",
+    "WebGLProgram",
+    "WebGLQuery",
+    "WebGLRenderbuffer",
+    "WebGLRenderingContext",
+    "WebGLSampler",
+    "WebGLShader",
+    "WebGLShaderPrecisionFormat",
+    "WebGLSync",
+    "WebGLTexture",
+    "WebGLTransformFeedback",
+    "WebGLUniformLocation",
+    "WebGLVertexArray",
+    "WebGLVertexArrayObject",
+    "WebKitAnimationEvent",
+    "WebKitBlobBuilder",
+    "WebKitCSSFilterRule",
+    "WebKitCSSFilterValue",
+    "WebKitCSSKeyframeRule",
+    "WebKitCSSKeyframesRule",
+    "WebKitCSSMatrix",
+    "WebKitCSSRegionRule",
+    "WebKitCSSTransformValue",
+    "WebKitDataCue",
+    "WebKitGamepad",
+    "WebKitMediaKeyError",
+    "WebKitMediaKeyMessageEvent",
+    "WebKitMediaKeySession",
+    "WebKitMediaKeys",
+    "WebKitMediaSource",
+    "WebKitMutationObserver",
+    "WebKitNamespace",
+    "WebKitPlaybackTargetAvailabilityEvent",
+    "WebKitPoint",
+    "WebKitShadowRoot",
+    "WebKitSourceBuffer",
+    "WebKitSourceBufferList",
+    "WebKitTransitionEvent",
+    "WebSocket",
+    "WebkitAlignContent",
+    "WebkitAlignItems",
+    "WebkitAlignSelf",
+    "WebkitAnimation",
+    "WebkitAnimationDelay",
+    "WebkitAnimationDirection",
+    "WebkitAnimationDuration",
+    "WebkitAnimationFillMode",
+    "WebkitAnimationIterationCount",
+    "WebkitAnimationName",
+    "WebkitAnimationPlayState",
+    "WebkitAnimationTimingFunction",
+    "WebkitAppearance",
+    "WebkitBackfaceVisibility",
+    "WebkitBackgroundClip",
+    "WebkitBackgroundOrigin",
+    "WebkitBackgroundSize",
+    "WebkitBorderBottomLeftRadius",
+    "WebkitBorderBottomRightRadius",
+    "WebkitBorderImage",
+    "WebkitBorderRadius",
+    "WebkitBorderTopLeftRadius",
+    "WebkitBorderTopRightRadius",
+    "WebkitBoxAlign",
+    "WebkitBoxDirection",
+    "WebkitBoxFlex",
+    "WebkitBoxOrdinalGroup",
+    "WebkitBoxOrient",
+    "WebkitBoxPack",
+    "WebkitBoxShadow",
+    "WebkitBoxSizing",
+    "WebkitFilter",
+    "WebkitFlex",
+    "WebkitFlexBasis",
+    "WebkitFlexDirection",
+    "WebkitFlexFlow",
+    "WebkitFlexGrow",
+    "WebkitFlexShrink",
+    "WebkitFlexWrap",
+    "WebkitJustifyContent",
+    "WebkitLineClamp",
+    "WebkitMask",
+    "WebkitMaskClip",
+    "WebkitMaskComposite",
+    "WebkitMaskImage",
+    "WebkitMaskOrigin",
+    "WebkitMaskPosition",
+    "WebkitMaskPositionX",
+    "WebkitMaskPositionY",
+    "WebkitMaskRepeat",
+    "WebkitMaskSize",
+    "WebkitOrder",
+    "WebkitPerspective",
+    "WebkitPerspectiveOrigin",
+    "WebkitTextFillColor",
+    "WebkitTextSizeAdjust",
+    "WebkitTextStroke",
+    "WebkitTextStrokeColor",
+    "WebkitTextStrokeWidth",
+    "WebkitTransform",
+    "WebkitTransformOrigin",
+    "WebkitTransformStyle",
+    "WebkitTransition",
+    "WebkitTransitionDelay",
+    "WebkitTransitionDuration",
+    "WebkitTransitionProperty",
+    "WebkitTransitionTimingFunction",
+    "WebkitUserSelect",
+    "WheelEvent",
+    "Window",
+    "Worker",
+    "Worklet",
+    "WritableStream",
+    "WritableStreamDefaultWriter",
+    "XMLDocument",
+    "XMLHttpRequest",
+    "XMLHttpRequestEventTarget",
+    "XMLHttpRequestException",
+    "XMLHttpRequestProgressEvent",
+    "XMLHttpRequestUpload",
+    "XMLSerializer",
+    "XMLStylesheetProcessingInstruction",
+    "XPathEvaluator",
+    "XPathException",
+    "XPathExpression",
+    "XPathNSResolver",
+    "XPathResult",
+    "XRBoundedReferenceSpace",
+    "XRDOMOverlayState",
+    "XRFrame",
+    "XRHitTestResult",
+    "XRHitTestSource",
+    "XRInputSource",
+    "XRInputSourceArray",
+    "XRInputSourceEvent",
+    "XRInputSourcesChangeEvent",
+    "XRLayer",
+    "XRPose",
+    "XRRay",
+    "XRReferenceSpace",
+    "XRReferenceSpaceEvent",
+    "XRRenderState",
+    "XRRigidTransform",
+    "XRSession",
+    "XRSessionEvent",
+    "XRSpace",
+    "XRSystem",
+    "XRTransientInputHitTestResult",
+    "XRTransientInputHitTestSource",
+    "XRView",
+    "XRViewerPose",
+    "XRViewport",
+    "XRWebGLLayer",
+    "XSLTProcessor",
+    "ZERO",
+    "_XD0M_",
+    "_YD0M_",
+    "__defineGetter__",
+    "__defineSetter__",
+    "__lookupGetter__",
+    "__lookupSetter__",
+    "__opera",
+    "__proto__",
+    "_browserjsran",
+    "a",
+    "aLink",
+    "abbr",
+    "abort",
+    "aborted",
+    "abs",
+    "absolute",
+    "acceleration",
+    "accelerationIncludingGravity",
+    "accelerator",
+    "accept",
+    "acceptCharset",
+    "acceptNode",
+    "accessKey",
+    "accessKeyLabel",
+    "accuracy",
+    "acos",
+    "acosh",
+    "action",
+    "actionURL",
+    "actions",
+    "activated",
+    "active",
+    "activeCues",
+    "activeElement",
+    "activeSourceBuffers",
+    "activeSourceCount",
+    "activeTexture",
+    "activeVRDisplays",
+    "actualBoundingBoxAscent",
+    "actualBoundingBoxDescent",
+    "actualBoundingBoxLeft",
+    "actualBoundingBoxRight",
+    "add",
+    "addAll",
+    "addBehavior",
+    "addCandidate",
+    "addColorStop",
+    "addCue",
+    "addElement",
+    "addEventListener",
+    "addFilter",
+    "addFromString",
+    "addFromUri",
+    "addIceCandidate",
+    "addImport",
+    "addListener",
+    "addModule",
+    "addNamed",
+    "addPageRule",
+    "addPath",
+    "addPointer",
+    "addRange",
+    "addRegion",
+    "addRule",
+    "addSearchEngine",
+    "addSourceBuffer",
+    "addStream",
+    "addTextTrack",
+    "addTrack",
+    "addTransceiver",
+    "addWakeLockListener",
+    "added",
+    "addedNodes",
+    "additionalName",
+    "additiveSymbols",
+    "addons",
+    "address",
+    "addressLine",
+    "adoptNode",
+    "adoptedStyleSheets",
+    "adr",
+    "advance",
+    "after",
+    "album",
+    "alert",
+    "algorithm",
+    "align",
+    "align-content",
+    "align-items",
+    "align-self",
+    "alignContent",
+    "alignItems",
+    "alignSelf",
+    "alignmentBaseline",
+    "alinkColor",
+    "all",
+    "allSettled",
+    "allow",
+    "allowFullscreen",
+    "allowPaymentRequest",
+    "allowedDirections",
+    "allowedFeatures",
+    "allowedToPlay",
+    "allowsFeature",
+    "alpha",
+    "alt",
+    "altGraphKey",
+    "altHtml",
+    "altKey",
+    "altLeft",
+    "alternate",
+    "alternateSetting",
+    "alternates",
+    "altitude",
+    "altitudeAccuracy",
+    "amplitude",
+    "ancestorOrigins",
+    "anchor",
+    "anchorNode",
+    "anchorOffset",
+    "anchors",
+    "and",
+    "angle",
+    "angularAcceleration",
+    "angularVelocity",
+    "animVal",
+    "animate",
+    "animatedInstanceRoot",
+    "animatedNormalizedPathSegList",
+    "animatedPathSegList",
+    "animatedPoints",
+    "animation",
+    "animation-delay",
+    "animation-direction",
+    "animation-duration",
+    "animation-fill-mode",
+    "animation-iteration-count",
+    "animation-name",
+    "animation-play-state",
+    "animation-timing-function",
+    "animationDelay",
+    "animationDirection",
+    "animationDuration",
+    "animationFillMode",
+    "animationIterationCount",
+    "animationName",
+    "animationPlayState",
+    "animationStartTime",
+    "animationTimingFunction",
+    "animationsPaused",
+    "anniversary",
+    "antialias",
+    "anticipatedRemoval",
+    "any",
+    "app",
+    "appCodeName",
+    "appMinorVersion",
+    "appName",
+    "appNotifications",
+    "appVersion",
+    "appearance",
+    "append",
+    "appendBuffer",
+    "appendChild",
+    "appendData",
+    "appendItem",
+    "appendMedium",
+    "appendNamed",
+    "appendRule",
+    "appendStream",
+    "appendWindowEnd",
+    "appendWindowStart",
+    "applets",
+    "applicationCache",
+    "applicationServerKey",
+    "apply",
+    "applyConstraints",
+    "applyElement",
+    "arc",
+    "arcTo",
+    "archive",
+    "areas",
+    "arguments",
+    "ariaAtomic",
+    "ariaAutoComplete",
+    "ariaBusy",
+    "ariaChecked",
+    "ariaColCount",
+    "ariaColIndex",
+    "ariaColSpan",
+    "ariaCurrent",
+    "ariaDescription",
+    "ariaDisabled",
+    "ariaExpanded",
+    "ariaHasPopup",
+    "ariaHidden",
+    "ariaKeyShortcuts",
+    "ariaLabel",
+    "ariaLevel",
+    "ariaLive",
+    "ariaModal",
+    "ariaMultiLine",
+    "ariaMultiSelectable",
+    "ariaOrientation",
+    "ariaPlaceholder",
+    "ariaPosInSet",
+    "ariaPressed",
+    "ariaReadOnly",
+    "ariaRelevant",
+    "ariaRequired",
+    "ariaRoleDescription",
+    "ariaRowCount",
+    "ariaRowIndex",
+    "ariaRowSpan",
+    "ariaSelected",
+    "ariaSetSize",
+    "ariaSort",
+    "ariaValueMax",
+    "ariaValueMin",
+    "ariaValueNow",
+    "ariaValueText",
+    "arrayBuffer",
+    "artist",
+    "artwork",
+    "as",
+    "asIntN",
+    "asUintN",
+    "asin",
+    "asinh",
+    "assert",
+    "assign",
+    "assignedElements",
+    "assignedNodes",
+    "assignedSlot",
+    "async",
+    "asyncIterator",
+    "atEnd",
+    "atan",
+    "atan2",
+    "atanh",
+    "atob",
+    "attachEvent",
+    "attachInternals",
+    "attachShader",
+    "attachShadow",
+    "attachments",
+    "attack",
+    "attestationObject",
+    "attrChange",
+    "attrName",
+    "attributeFilter",
+    "attributeName",
+    "attributeNamespace",
+    "attributeOldValue",
+    "attributeStyleMap",
+    "attributes",
+    "attribution",
+    "audioBitsPerSecond",
+    "audioTracks",
+    "audioWorklet",
+    "authenticatedSignedWrites",
+    "authenticatorData",
+    "autoIncrement",
+    "autobuffer",
+    "autocapitalize",
+    "autocomplete",
+    "autocorrect",
+    "autofocus",
+    "automationRate",
+    "autoplay",
+    "availHeight",
+    "availLeft",
+    "availTop",
+    "availWidth",
+    "availability",
+    "available",
+    "aversion",
+    "ax",
+    "axes",
+    "axis",
+    "ay",
+    "azimuth",
+    "b",
+    "back",
+    "backface-visibility",
+    "backfaceVisibility",
+    "background",
+    "background-attachment",
+    "background-blend-mode",
+    "background-clip",
+    "background-color",
+    "background-image",
+    "background-origin",
+    "background-position",
+    "background-position-x",
+    "background-position-y",
+    "background-repeat",
+    "background-size",
+    "backgroundAttachment",
+    "backgroundBlendMode",
+    "backgroundClip",
+    "backgroundColor",
+    "backgroundFetch",
+    "backgroundImage",
+    "backgroundOrigin",
+    "backgroundPosition",
+    "backgroundPositionX",
+    "backgroundPositionY",
+    "backgroundRepeat",
+    "backgroundSize",
+    "badInput",
+    "badge",
+    "balance",
+    "baseFrequencyX",
+    "baseFrequencyY",
+    "baseLatency",
+    "baseLayer",
+    "baseNode",
+    "baseOffset",
+    "baseURI",
+    "baseVal",
+    "baselineShift",
+    "battery",
+    "bday",
+    "before",
+    "beginElement",
+    "beginElementAt",
+    "beginPath",
+    "beginQuery",
+    "beginTransformFeedback",
+    "behavior",
+    "behaviorCookie",
+    "behaviorPart",
+    "behaviorUrns",
+    "beta",
+    "bezierCurveTo",
+    "bgColor",
+    "bgProperties",
+    "bias",
+    "big",
+    "bigint64",
+    "biguint64",
+    "binaryType",
+    "bind",
+    "bindAttribLocation",
+    "bindBuffer",
+    "bindBufferBase",
+    "bindBufferRange",
+    "bindFramebuffer",
+    "bindRenderbuffer",
+    "bindSampler",
+    "bindTexture",
+    "bindTransformFeedback",
+    "bindVertexArray",
+    "blendColor",
+    "blendEquation",
+    "blendEquationSeparate",
+    "blendFunc",
+    "blendFuncSeparate",
+    "blink",
+    "blitFramebuffer",
+    "blob",
+    "block-size",
+    "blockDirection",
+    "blockSize",
+    "blockedURI",
+    "blue",
+    "bluetooth",
+    "blur",
+    "body",
+    "bodyUsed",
+    "bold",
+    "bookmarks",
+    "booleanValue",
+    "border",
+    "border-block",
+    "border-block-color",
+    "border-block-end",
+    "border-block-end-color",
+    "border-block-end-style",
+    "border-block-end-width",
+    "border-block-start",
+    "border-block-start-color",
+    "border-block-start-style",
+    "border-block-start-width",
+    "border-block-style",
+    "border-block-width",
+    "border-bottom",
+    "border-bottom-color",
+    "border-bottom-left-radius",
+    "border-bottom-right-radius",
+    "border-bottom-style",
+    "border-bottom-width",
+    "border-collapse",
+    "border-color",
+    "border-end-end-radius",
+    "border-end-start-radius",
+    "border-image",
+    "border-image-outset",
+    "border-image-repeat",
+    "border-image-slice",
+    "border-image-source",
+    "border-image-width",
+    "border-inline",
+    "border-inline-color",
+    "border-inline-end",
+    "border-inline-end-color",
+    "border-inline-end-style",
+    "border-inline-end-width",
+    "border-inline-start",
+    "border-inline-start-color",
+    "border-inline-start-style",
+    "border-inline-start-width",
+    "border-inline-style",
+    "border-inline-width",
+    "border-left",
+    "border-left-color",
+    "border-left-style",
+    "border-left-width",
+    "border-radius",
+    "border-right",
+    "border-right-color",
+    "border-right-style",
+    "border-right-width",
+    "border-spacing",
+    "border-start-end-radius",
+    "border-start-start-radius",
+    "border-style",
+    "border-top",
+    "border-top-color",
+    "border-top-left-radius",
+    "border-top-right-radius",
+    "border-top-style",
+    "border-top-width",
+    "border-width",
+    "borderBlock",
+    "borderBlockColor",
+    "borderBlockEnd",
+    "borderBlockEndColor",
+    "borderBlockEndStyle",
+    "borderBlockEndWidth",
+    "borderBlockStart",
+    "borderBlockStartColor",
+    "borderBlockStartStyle",
+    "borderBlockStartWidth",
+    "borderBlockStyle",
+    "borderBlockWidth",
+    "borderBottom",
+    "borderBottomColor",
+    "borderBottomLeftRadius",
+    "borderBottomRightRadius",
+    "borderBottomStyle",
+    "borderBottomWidth",
+    "borderBoxSize",
+    "borderCollapse",
+    "borderColor",
+    "borderColorDark",
+    "borderColorLight",
+    "borderEndEndRadius",
+    "borderEndStartRadius",
+    "borderImage",
+    "borderImageOutset",
+    "borderImageRepeat",
+    "borderImageSlice",
+    "borderImageSource",
+    "borderImageWidth",
+    "borderInline",
+    "borderInlineColor",
+    "borderInlineEnd",
+    "borderInlineEndColor",
+    "borderInlineEndStyle",
+    "borderInlineEndWidth",
+    "borderInlineStart",
+    "borderInlineStartColor",
+    "borderInlineStartStyle",
+    "borderInlineStartWidth",
+    "borderInlineStyle",
+    "borderInlineWidth",
+    "borderLeft",
+    "borderLeftColor",
+    "borderLeftStyle",
+    "borderLeftWidth",
+    "borderRadius",
+    "borderRight",
+    "borderRightColor",
+    "borderRightStyle",
+    "borderRightWidth",
+    "borderSpacing",
+    "borderStartEndRadius",
+    "borderStartStartRadius",
+    "borderStyle",
+    "borderTop",
+    "borderTopColor",
+    "borderTopLeftRadius",
+    "borderTopRightRadius",
+    "borderTopStyle",
+    "borderTopWidth",
+    "borderWidth",
+    "bottom",
+    "bottomMargin",
+    "bound",
+    "boundElements",
+    "boundingClientRect",
+    "boundingHeight",
+    "boundingLeft",
+    "boundingTop",
+    "boundingWidth",
+    "bounds",
+    "boundsGeometry",
+    "box-decoration-break",
+    "box-shadow",
+    "box-sizing",
+    "boxDecorationBreak",
+    "boxShadow",
+    "boxSizing",
+    "break-after",
+    "break-before",
+    "break-inside",
+    "breakAfter",
+    "breakBefore",
+    "breakInside",
+    "broadcast",
+    "browserLanguage",
+    "btoa",
+    "bubbles",
+    "buffer",
+    "bufferData",
+    "bufferDepth",
+    "bufferSize",
+    "bufferSubData",
+    "buffered",
+    "bufferedAmount",
+    "bufferedAmountLowThreshold",
+    "buildID",
+    "buildNumber",
+    "button",
+    "buttonID",
+    "buttons",
+    "byteLength",
+    "byteOffset",
+    "bytesWritten",
+    "c",
+    "cache",
+    "caches",
+    "call",
+    "caller",
+    "canBeFormatted",
+    "canBeMounted",
+    "canBeShared",
+    "canHaveChildren",
+    "canHaveHTML",
+    "canInsertDTMF",
+    "canMakePayment",
+    "canPlayType",
+    "canPresent",
+    "canTrickleIceCandidates",
+    "cancel",
+    "cancelAndHoldAtTime",
+    "cancelAnimationFrame",
+    "cancelBubble",
+    "cancelIdleCallback",
+    "cancelScheduledValues",
+    "cancelVideoFrameCallback",
+    "cancelWatchAvailability",
+    "cancelable",
+    "candidate",
+    "canonicalUUID",
+    "canvas",
+    "capabilities",
+    "caption",
+    "caption-side",
+    "captionSide",
+    "capture",
+    "captureEvents",
+    "captureStackTrace",
+    "captureStream",
+    "caret-color",
+    "caretBidiLevel",
+    "caretColor",
+    "caretPositionFromPoint",
+    "caretRangeFromPoint",
+    "cast",
+    "catch",
+    "category",
+    "cbrt",
+    "cd",
+    "ceil",
+    "cellIndex",
+    "cellPadding",
+    "cellSpacing",
+    "cells",
+    "ch",
+    "chOff",
+    "chain",
+    "challenge",
+    "changeType",
+    "changedTouches",
+    "channel",
+    "channelCount",
+    "channelCountMode",
+    "channelInterpretation",
+    "char",
+    "charAt",
+    "charCode",
+    "charCodeAt",
+    "charIndex",
+    "charLength",
+    "characterData",
+    "characterDataOldValue",
+    "characterSet",
+    "characteristic",
+    "charging",
+    "chargingTime",
+    "charset",
+    "check",
+    "checkEnclosure",
+    "checkFramebufferStatus",
+    "checkIntersection",
+    "checkValidity",
+    "checked",
+    "childElementCount",
+    "childList",
+    "childNodes",
+    "children",
+    "chrome",
+    "ciphertext",
+    "cite",
+    "city",
+    "claimInterface",
+    "claimed",
+    "classList",
+    "className",
+    "classid",
+    "clear",
+    "clearAppBadge",
+    "clearAttributes",
+    "clearBufferfi",
+    "clearBufferfv",
+    "clearBufferiv",
+    "clearBufferuiv",
+    "clearColor",
+    "clearData",
+    "clearDepth",
+    "clearHalt",
+    "clearImmediate",
+    "clearInterval",
+    "clearLiveSeekableRange",
+    "clearMarks",
+    "clearMaxGCPauseAccumulator",
+    "clearMeasures",
+    "clearParameters",
+    "clearRect",
+    "clearResourceTimings",
+    "clearShadow",
+    "clearStencil",
+    "clearTimeout",
+    "clearWatch",
+    "click",
+    "clickCount",
+    "clientDataJSON",
+    "clientHeight",
+    "clientInformation",
+    "clientLeft",
+    "clientRect",
+    "clientRects",
+    "clientTop",
+    "clientWaitSync",
+    "clientWidth",
+    "clientX",
+    "clientY",
+    "clip",
+    "clip-path",
+    "clip-rule",
+    "clipBottom",
+    "clipLeft",
+    "clipPath",
+    "clipPathUnits",
+    "clipRight",
+    "clipRule",
+    "clipTop",
+    "clipboard",
+    "clipboardData",
+    "clone",
+    "cloneContents",
+    "cloneNode",
+    "cloneRange",
+    "close",
+    "closePath",
+    "closed",
+    "closest",
+    "clz",
+    "clz32",
+    "cm",
+    "cmp",
+    "code",
+    "codeBase",
+    "codePointAt",
+    "codeType",
+    "colSpan",
+    "collapse",
+    "collapseToEnd",
+    "collapseToStart",
+    "collapsed",
+    "collect",
+    "colno",
+    "color",
+    "color-adjust",
+    "color-interpolation",
+    "color-interpolation-filters",
+    "colorAdjust",
+    "colorDepth",
+    "colorInterpolation",
+    "colorInterpolationFilters",
+    "colorMask",
+    "colorType",
+    "cols",
+    "column-count",
+    "column-fill",
+    "column-gap",
+    "column-rule",
+    "column-rule-color",
+    "column-rule-style",
+    "column-rule-width",
+    "column-span",
+    "column-width",
+    "columnCount",
+    "columnFill",
+    "columnGap",
+    "columnNumber",
+    "columnRule",
+    "columnRuleColor",
+    "columnRuleStyle",
+    "columnRuleWidth",
+    "columnSpan",
+    "columnWidth",
+    "columns",
+    "command",
+    "commit",
+    "commitPreferences",
+    "commitStyles",
+    "commonAncestorContainer",
+    "compact",
+    "compareBoundaryPoints",
+    "compareDocumentPosition",
+    "compareEndPoints",
+    "compareExchange",
+    "compareNode",
+    "comparePoint",
+    "compatMode",
+    "compatible",
+    "compile",
+    "compileShader",
+    "compileStreaming",
+    "complete",
+    "component",
+    "componentFromPoint",
+    "composed",
+    "composedPath",
+    "composite",
+    "compositionEndOffset",
+    "compositionStartOffset",
+    "compressedTexImage2D",
+    "compressedTexImage3D",
+    "compressedTexSubImage2D",
+    "compressedTexSubImage3D",
+    "computedStyleMap",
+    "concat",
+    "conditionText",
+    "coneInnerAngle",
+    "coneOuterAngle",
+    "coneOuterGain",
+    "configuration",
+    "configurationName",
+    "configurationValue",
+    "configurations",
+    "confirm",
+    "confirmComposition",
+    "confirmSiteSpecificTrackingException",
+    "confirmWebWideTrackingException",
+    "connect",
+    "connectEnd",
+    "connectShark",
+    "connectStart",
+    "connected",
+    "connection",
+    "connectionList",
+    "connectionSpeed",
+    "connectionState",
+    "connections",
+    "console",
+    "consolidate",
+    "constraint",
+    "constrictionActive",
+    "construct",
+    "constructor",
+    "contactID",
+    "contain",
+    "containerId",
+    "containerName",
+    "containerSrc",
+    "containerType",
+    "contains",
+    "containsNode",
+    "content",
+    "contentBoxSize",
+    "contentDocument",
+    "contentEditable",
+    "contentHint",
+    "contentOverflow",
+    "contentRect",
+    "contentScriptType",
+    "contentStyleType",
+    "contentType",
+    "contentWindow",
+    "context",
+    "contextMenu",
+    "contextmenu",
+    "continue",
+    "continuePrimaryKey",
+    "continuous",
+    "control",
+    "controlTransferIn",
+    "controlTransferOut",
+    "controller",
+    "controls",
+    "controlsList",
+    "convertPointFromNode",
+    "convertQuadFromNode",
+    "convertRectFromNode",
+    "convertToBlob",
+    "convertToSpecifiedUnits",
+    "cookie",
+    "cookieEnabled",
+    "coords",
+    "copyBufferSubData",
+    "copyFromChannel",
+    "copyTexImage2D",
+    "copyTexSubImage2D",
+    "copyTexSubImage3D",
+    "copyToChannel",
+    "copyWithin",
+    "correspondingElement",
+    "correspondingUseElement",
+    "corruptedVideoFrames",
+    "cos",
+    "cosh",
+    "count",
+    "countReset",
+    "counter-increment",
+    "counter-reset",
+    "counter-set",
+    "counterIncrement",
+    "counterReset",
+    "counterSet",
+    "country",
+    "cpuClass",
+    "cpuSleepAllowed",
+    "create",
+    "createAnalyser",
+    "createAnswer",
+    "createAttribute",
+    "createAttributeNS",
+    "createBiquadFilter",
+    "createBuffer",
+    "createBufferSource",
+    "createCDATASection",
+    "createCSSStyleSheet",
+    "createCaption",
+    "createChannelMerger",
+    "createChannelSplitter",
+    "createComment",
+    "createConstantSource",
+    "createContextualFragment",
+    "createControlRange",
+    "createConvolver",
+    "createDTMFSender",
+    "createDataChannel",
+    "createDelay",
+    "createDelayNode",
+    "createDocument",
+    "createDocumentFragment",
+    "createDocumentType",
+    "createDynamicsCompressor",
+    "createElement",
+    "createElementNS",
+    "createEntityReference",
+    "createEvent",
+    "createEventObject",
+    "createExpression",
+    "createFramebuffer",
+    "createFunction",
+    "createGain",
+    "createGainNode",
+    "createHTML",
+    "createHTMLDocument",
+    "createIIRFilter",
+    "createImageBitmap",
+    "createImageData",
+    "createIndex",
+    "createJavaScriptNode",
+    "createLinearGradient",
+    "createMediaElementSource",
+    "createMediaKeys",
+    "createMediaStreamDestination",
+    "createMediaStreamSource",
+    "createMediaStreamTrackSource",
+    "createMutableFile",
+    "createNSResolver",
+    "createNodeIterator",
+    "createNotification",
+    "createObjectStore",
+    "createObjectURL",
+    "createOffer",
+    "createOscillator",
+    "createPanner",
+    "createPattern",
+    "createPeriodicWave",
+    "createPolicy",
+    "createPopup",
+    "createProcessingInstruction",
+    "createProgram",
+    "createQuery",
+    "createRadialGradient",
+    "createRange",
+    "createRangeCollection",
+    "createReader",
+    "createRenderbuffer",
+    "createSVGAngle",
+    "createSVGLength",
+    "createSVGMatrix",
+    "createSVGNumber",
+    "createSVGPathSegArcAbs",
+    "createSVGPathSegArcRel",
+    "createSVGPathSegClosePath",
+    "createSVGPathSegCurvetoCubicAbs",
+    "createSVGPathSegCurvetoCubicRel",
+    "createSVGPathSegCurvetoCubicSmoothAbs",
+    "createSVGPathSegCurvetoCubicSmoothRel",
+    "createSVGPathSegCurvetoQuadraticAbs",
+    "createSVGPathSegCurvetoQuadraticRel",
+    "createSVGPathSegCurvetoQuadraticSmoothAbs",
+    "createSVGPathSegCurvetoQuadraticSmoothRel",
+    "createSVGPathSegLinetoAbs",
+    "createSVGPathSegLinetoHorizontalAbs",
+    "createSVGPathSegLinetoHorizontalRel",
+    "createSVGPathSegLinetoRel",
+    "createSVGPathSegLinetoVerticalAbs",
+    "createSVGPathSegLinetoVerticalRel",
+    "createSVGPathSegMovetoAbs",
+    "createSVGPathSegMovetoRel",
+    "createSVGPoint",
+    "createSVGRect",
+    "createSVGTransform",
+    "createSVGTransformFromMatrix",
+    "createSampler",
+    "createScript",
+    "createScriptProcessor",
+    "createScriptURL",
+    "createSession",
+    "createShader",
+    "createShadowRoot",
+    "createStereoPanner",
+    "createStyleSheet",
+    "createTBody",
+    "createTFoot",
+    "createTHead",
+    "createTextNode",
+    "createTextRange",
+    "createTexture",
+    "createTouch",
+    "createTouchList",
+    "createTransformFeedback",
+    "createTreeWalker",
+    "createVertexArray",
+    "createWaveShaper",
+    "creationTime",
+    "credentials",
+    "crossOrigin",
+    "crossOriginIsolated",
+    "crypto",
+    "csi",
+    "csp",
+    "cssFloat",
+    "cssRules",
+    "cssText",
+    "cssValueType",
+    "ctrlKey",
+    "ctrlLeft",
+    "cues",
+    "cullFace",
+    "currentDirection",
+    "currentLocalDescription",
+    "currentNode",
+    "currentPage",
+    "currentRect",
+    "currentRemoteDescription",
+    "currentScale",
+    "currentScript",
+    "currentSrc",
+    "currentState",
+    "currentStyle",
+    "currentTarget",
+    "currentTime",
+    "currentTranslate",
+    "currentView",
+    "cursor",
+    "curve",
+    "customElements",
+    "customError",
+    "cx",
+    "cy",
+    "d",
+    "data",
+    "dataFld",
+    "dataFormatAs",
+    "dataLoss",
+    "dataLossMessage",
+    "dataPageSize",
+    "dataSrc",
+    "dataTransfer",
+    "database",
+    "databases",
+    "dataset",
+    "dateTime",
+    "db",
+    "debug",
+    "debuggerEnabled",
+    "declare",
+    "decode",
+    "decodeAudioData",
+    "decodeURI",
+    "decodeURIComponent",
+    "decodedBodySize",
+    "decoding",
+    "decodingInfo",
+    "decrypt",
+    "default",
+    "defaultCharset",
+    "defaultChecked",
+    "defaultMuted",
+    "defaultPlaybackRate",
+    "defaultPolicy",
+    "defaultPrevented",
+    "defaultRequest",
+    "defaultSelected",
+    "defaultStatus",
+    "defaultURL",
+    "defaultValue",
+    "defaultView",
+    "defaultstatus",
+    "defer",
+    "define",
+    "defineMagicFunction",
+    "defineMagicVariable",
+    "defineProperties",
+    "defineProperty",
+    "deg",
+    "delay",
+    "delayTime",
+    "delegatesFocus",
+    "delete",
+    "deleteBuffer",
+    "deleteCaption",
+    "deleteCell",
+    "deleteContents",
+    "deleteData",
+    "deleteDatabase",
+    "deleteFramebuffer",
+    "deleteFromDocument",
+    "deleteIndex",
+    "deleteMedium",
+    "deleteObjectStore",
+    "deleteProgram",
+    "deleteProperty",
+    "deleteQuery",
+    "deleteRenderbuffer",
+    "deleteRow",
+    "deleteRule",
+    "deleteSampler",
+    "deleteShader",
+    "deleteSync",
+    "deleteTFoot",
+    "deleteTHead",
+    "deleteTexture",
+    "deleteTransformFeedback",
+    "deleteVertexArray",
+    "deliverChangeRecords",
+    "delivery",
+    "deliveryInfo",
+    "deliveryStatus",
+    "deliveryTimestamp",
+    "delta",
+    "deltaMode",
+    "deltaX",
+    "deltaY",
+    "deltaZ",
+    "dependentLocality",
+    "depthFar",
+    "depthFunc",
+    "depthMask",
+    "depthNear",
+    "depthRange",
+    "deref",
+    "deriveBits",
+    "deriveKey",
+    "description",
+    "deselectAll",
+    "designMode",
+    "desiredSize",
+    "destination",
+    "destinationURL",
+    "detach",
+    "detachEvent",
+    "detachShader",
+    "detail",
+    "details",
+    "detect",
+    "detune",
+    "device",
+    "deviceClass",
+    "deviceId",
+    "deviceMemory",
+    "devicePixelContentBoxSize",
+    "devicePixelRatio",
+    "deviceProtocol",
+    "deviceSubclass",
+    "deviceVersionMajor",
+    "deviceVersionMinor",
+    "deviceVersionSubminor",
+    "deviceXDPI",
+    "deviceYDPI",
+    "didTimeout",
+    "diffuseConstant",
+    "digest",
+    "dimensions",
+    "dir",
+    "dirName",
+    "direction",
+    "dirxml",
+    "disable",
+    "disablePictureInPicture",
+    "disableRemotePlayback",
+    "disableVertexAttribArray",
+    "disabled",
+    "dischargingTime",
+    "disconnect",
+    "disconnectShark",
+    "dispatchEvent",
+    "display",
+    "displayId",
+    "displayName",
+    "disposition",
+    "distanceModel",
+    "div",
+    "divisor",
+    "djsapi",
+    "djsproxy",
+    "doImport",
+    "doNotTrack",
+    "doScroll",
+    "doctype",
+    "document",
+    "documentElement",
+    "documentMode",
+    "documentURI",
+    "dolphin",
+    "dolphinGameCenter",
+    "dolphininfo",
+    "dolphinmeta",
+    "domComplete",
+    "domContentLoadedEventEnd",
+    "domContentLoadedEventStart",
+    "domInteractive",
+    "domLoading",
+    "domOverlayState",
+    "domain",
+    "domainLookupEnd",
+    "domainLookupStart",
+    "dominant-baseline",
+    "dominantBaseline",
+    "done",
+    "dopplerFactor",
+    "dotAll",
+    "downDegrees",
+    "downlink",
+    "download",
+    "downloadTotal",
+    "downloaded",
+    "dpcm",
+    "dpi",
+    "dppx",
+    "dragDrop",
+    "draggable",
+    "drawArrays",
+    "drawArraysInstanced",
+    "drawArraysInstancedANGLE",
+    "drawBuffers",
+    "drawCustomFocusRing",
+    "drawElements",
+    "drawElementsInstanced",
+    "drawElementsInstancedANGLE",
+    "drawFocusIfNeeded",
+    "drawImage",
+    "drawImageFromRect",
+    "drawRangeElements",
+    "drawSystemFocusRing",
+    "drawingBufferHeight",
+    "drawingBufferWidth",
+    "dropEffect",
+    "droppedVideoFrames",
+    "dropzone",
+    "dtmf",
+    "dump",
+    "dumpProfile",
+    "duplicate",
+    "durability",
+    "duration",
+    "dvname",
+    "dvnum",
+    "dx",
+    "dy",
+    "dynsrc",
+    "e",
+    "edgeMode",
+    "effect",
+    "effectAllowed",
+    "effectiveDirective",
+    "effectiveType",
+    "elapsedTime",
+    "element",
+    "elementFromPoint",
+    "elementTiming",
+    "elements",
+    "elementsFromPoint",
+    "elevation",
+    "ellipse",
+    "em",
+    "email",
+    "embeds",
+    "emma",
+    "empty",
+    "empty-cells",
+    "emptyCells",
+    "emptyHTML",
+    "emptyScript",
+    "emulatedPosition",
+    "enable",
+    "enableBackground",
+    "enableDelegations",
+    "enableStyleSheetsForSet",
+    "enableVertexAttribArray",
+    "enabled",
+    "enabledPlugin",
+    "encode",
+    "encodeInto",
+    "encodeURI",
+    "encodeURIComponent",
+    "encodedBodySize",
+    "encoding",
+    "encodingInfo",
+    "encrypt",
+    "enctype",
+    "end",
+    "endContainer",
+    "endElement",
+    "endElementAt",
+    "endOfStream",
+    "endOffset",
+    "endQuery",
+    "endTime",
+    "endTransformFeedback",
+    "ended",
+    "endpoint",
+    "endpointNumber",
+    "endpoints",
+    "endsWith",
+    "enterKeyHint",
+    "entities",
+    "entries",
+    "entryType",
+    "enumerate",
+    "enumerateDevices",
+    "enumerateEditable",
+    "environmentBlendMode",
+    "equals",
+    "error",
+    "errorCode",
+    "errorDetail",
+    "errorText",
+    "escape",
+    "estimate",
+    "eval",
+    "evaluate",
+    "event",
+    "eventPhase",
+    "every",
+    "ex",
+    "exception",
+    "exchange",
+    "exec",
+    "execCommand",
+    "execCommandShowHelp",
+    "execScript",
+    "exitFullscreen",
+    "exitPictureInPicture",
+    "exitPointerLock",
+    "exitPresent",
+    "exp",
+    "expand",
+    "expandEntityReferences",
+    "expando",
+    "expansion",
+    "expiration",
+    "expirationTime",
+    "expires",
+    "expiryDate",
+    "explicitOriginalTarget",
+    "expm1",
+    "exponent",
+    "exponentialRampToValueAtTime",
+    "exportKey",
+    "exports",
+    "extend",
+    "extensions",
+    "extentNode",
+    "extentOffset",
+    "external",
+    "externalResourcesRequired",
+    "extractContents",
+    "extractable",
+    "eye",
+    "f",
+    "face",
+    "factoryReset",
+    "failureReason",
+    "fallback",
+    "family",
+    "familyName",
+    "farthestViewportElement",
+    "fastSeek",
+    "fatal",
+    "featureId",
+    "featurePolicy",
+    "featureSettings",
+    "features",
+    "fenceSync",
+    "fetch",
+    "fetchStart",
+    "fftSize",
+    "fgColor",
+    "fieldOfView",
+    "file",
+    "fileCreatedDate",
+    "fileHandle",
+    "fileModifiedDate",
+    "fileName",
+    "fileSize",
+    "fileUpdatedDate",
+    "filename",
+    "files",
+    "filesystem",
+    "fill",
+    "fill-opacity",
+    "fill-rule",
+    "fillLightMode",
+    "fillOpacity",
+    "fillRect",
+    "fillRule",
+    "fillStyle",
+    "fillText",
+    "filter",
+    "filterResX",
+    "filterResY",
+    "filterUnits",
+    "filters",
+    "finally",
+    "find",
+    "findIndex",
+    "findRule",
+    "findText",
+    "finish",
+    "finished",
+    "fireEvent",
+    "firesTouchEvents",
+    "firstChild",
+    "firstElementChild",
+    "firstPage",
+    "fixed",
+    "flags",
+    "flat",
+    "flatMap",
+    "flex",
+    "flex-basis",
+    "flex-direction",
+    "flex-flow",
+    "flex-grow",
+    "flex-shrink",
+    "flex-wrap",
+    "flexBasis",
+    "flexDirection",
+    "flexFlow",
+    "flexGrow",
+    "flexShrink",
+    "flexWrap",
+    "flipX",
+    "flipY",
+    "float",
+    "float32",
+    "float64",
+    "flood-color",
+    "flood-opacity",
+    "floodColor",
+    "floodOpacity",
+    "floor",
+    "flush",
+    "focus",
+    "focusNode",
+    "focusOffset",
+    "font",
+    "font-family",
+    "font-feature-settings",
+    "font-kerning",
+    "font-language-override",
+    "font-optical-sizing",
+    "font-size",
+    "font-size-adjust",
+    "font-stretch",
+    "font-style",
+    "font-synthesis",
+    "font-variant",
+    "font-variant-alternates",
+    "font-variant-caps",
+    "font-variant-east-asian",
+    "font-variant-ligatures",
+    "font-variant-numeric",
+    "font-variant-position",
+    "font-variation-settings",
+    "font-weight",
+    "fontFamily",
+    "fontFeatureSettings",
+    "fontKerning",
+    "fontLanguageOverride",
+    "fontOpticalSizing",
+    "fontSize",
+    "fontSizeAdjust",
+    "fontSmoothingEnabled",
+    "fontStretch",
+    "fontStyle",
+    "fontSynthesis",
+    "fontVariant",
+    "fontVariantAlternates",
+    "fontVariantCaps",
+    "fontVariantEastAsian",
+    "fontVariantLigatures",
+    "fontVariantNumeric",
+    "fontVariantPosition",
+    "fontVariationSettings",
+    "fontWeight",
+    "fontcolor",
+    "fontfaces",
+    "fonts",
+    "fontsize",
+    "for",
+    "forEach",
+    "force",
+    "forceRedraw",
+    "form",
+    "formAction",
+    "formData",
+    "formEnctype",
+    "formMethod",
+    "formNoValidate",
+    "formTarget",
+    "format",
+    "formatToParts",
+    "forms",
+    "forward",
+    "forwardX",
+    "forwardY",
+    "forwardZ",
+    "foundation",
+    "fr",
+    "fragmentDirective",
+    "frame",
+    "frameBorder",
+    "frameElement",
+    "frameSpacing",
+    "framebuffer",
+    "framebufferHeight",
+    "framebufferRenderbuffer",
+    "framebufferTexture2D",
+    "framebufferTextureLayer",
+    "framebufferWidth",
+    "frames",
+    "freeSpace",
+    "freeze",
+    "frequency",
+    "frequencyBinCount",
+    "from",
+    "fromCharCode",
+    "fromCodePoint",
+    "fromElement",
+    "fromEntries",
+    "fromFloat32Array",
+    "fromFloat64Array",
+    "fromMatrix",
+    "fromPoint",
+    "fromQuad",
+    "fromRect",
+    "frontFace",
+    "fround",
+    "fullPath",
+    "fullScreen",
+    "fullscreen",
+    "fullscreenElement",
+    "fullscreenEnabled",
+    "fx",
+    "fy",
+    "gain",
+    "gamepad",
+    "gamma",
+    "gap",
+    "gatheringState",
+    "gatt",
+    "genderIdentity",
+    "generateCertificate",
+    "generateKey",
+    "generateMipmap",
+    "generateRequest",
+    "geolocation",
+    "gestureObject",
+    "get",
+    "getActiveAttrib",
+    "getActiveUniform",
+    "getActiveUniformBlockName",
+    "getActiveUniformBlockParameter",
+    "getActiveUniforms",
+    "getAdjacentText",
+    "getAll",
+    "getAllKeys",
+    "getAllResponseHeaders",
+    "getAllowlistForFeature",
+    "getAnimations",
+    "getAsFile",
+    "getAsString",
+    "getAttachedShaders",
+    "getAttribLocation",
+    "getAttribute",
+    "getAttributeNS",
+    "getAttributeNames",
+    "getAttributeNode",
+    "getAttributeNodeNS",
+    "getAttributeType",
+    "getAudioTracks",
+    "getAvailability",
+    "getBBox",
+    "getBattery",
+    "getBigInt64",
+    "getBigUint64",
+    "getBlob",
+    "getBookmark",
+    "getBoundingClientRect",
+    "getBounds",
+    "getBoxQuads",
+    "getBufferParameter",
+    "getBufferSubData",
+    "getByteFrequencyData",
+    "getByteTimeDomainData",
+    "getCSSCanvasContext",
+    "getCTM",
+    "getCandidateWindowClientRect",
+    "getCanonicalLocales",
+    "getCapabilities",
+    "getChannelData",
+    "getCharNumAtPosition",
+    "getCharacteristic",
+    "getCharacteristics",
+    "getClientExtensionResults",
+    "getClientRect",
+    "getClientRects",
+    "getCoalescedEvents",
+    "getCompositionAlternatives",
+    "getComputedStyle",
+    "getComputedTextLength",
+    "getComputedTiming",
+    "getConfiguration",
+    "getConstraints",
+    "getContext",
+    "getContextAttributes",
+    "getContributingSources",
+    "getCounterValue",
+    "getCueAsHTML",
+    "getCueById",
+    "getCurrentPosition",
+    "getCurrentTime",
+    "getData",
+    "getDatabaseNames",
+    "getDate",
+    "getDay",
+    "getDefaultComputedStyle",
+    "getDescriptor",
+    "getDescriptors",
+    "getDestinationInsertionPoints",
+    "getDevices",
+    "getDirectory",
+    "getDisplayMedia",
+    "getDistributedNodes",
+    "getEditable",
+    "getElementById",
+    "getElementsByClassName",
+    "getElementsByName",
+    "getElementsByTagName",
+    "getElementsByTagNameNS",
+    "getEnclosureList",
+    "getEndPositionOfChar",
+    "getEntries",
+    "getEntriesByName",
+    "getEntriesByType",
+    "getError",
+    "getExtension",
+    "getExtentOfChar",
+    "getEyeParameters",
+    "getFeature",
+    "getFile",
+    "getFiles",
+    "getFilesAndDirectories",
+    "getFingerprints",
+    "getFloat32",
+    "getFloat64",
+    "getFloatFrequencyData",
+    "getFloatTimeDomainData",
+    "getFloatValue",
+    "getFragDataLocation",
+    "getFrameData",
+    "getFramebufferAttachmentParameter",
+    "getFrequencyResponse",
+    "getFullYear",
+    "getGamepads",
+    "getHitTestResults",
+    "getHitTestResultsForTransientInput",
+    "getHours",
+    "getIdentityAssertion",
+    "getIds",
+    "getImageData",
+    "getIndexedParameter",
+    "getInstalledRelatedApps",
+    "getInt16",
+    "getInt32",
+    "getInt8",
+    "getInternalformatParameter",
+    "getIntersectionList",
+    "getItem",
+    "getItems",
+    "getKey",
+    "getKeyframes",
+    "getLayers",
+    "getLayoutMap",
+    "getLineDash",
+    "getLocalCandidates",
+    "getLocalParameters",
+    "getLocalStreams",
+    "getMarks",
+    "getMatchedCSSRules",
+    "getMaxGCPauseSinceClear",
+    "getMeasures",
+    "getMetadata",
+    "getMilliseconds",
+    "getMinutes",
+    "getModifierState",
+    "getMonth",
+    "getNamedItem",
+    "getNamedItemNS",
+    "getNativeFramebufferScaleFactor",
+    "getNotifications",
+    "getNotifier",
+    "getNumberOfChars",
+    "getOffsetReferenceSpace",
+    "getOutputTimestamp",
+    "getOverrideHistoryNavigationMode",
+    "getOverrideStyle",
+    "getOwnPropertyDescriptor",
+    "getOwnPropertyDescriptors",
+    "getOwnPropertyNames",
+    "getOwnPropertySymbols",
+    "getParameter",
+    "getParameters",
+    "getParent",
+    "getPathSegAtLength",
+    "getPhotoCapabilities",
+    "getPhotoSettings",
+    "getPointAtLength",
+    "getPose",
+    "getPredictedEvents",
+    "getPreference",
+    "getPreferenceDefault",
+    "getPresentationAttribute",
+    "getPreventDefault",
+    "getPrimaryService",
+    "getPrimaryServices",
+    "getProgramInfoLog",
+    "getProgramParameter",
+    "getPropertyCSSValue",
+    "getPropertyPriority",
+    "getPropertyShorthand",
+    "getPropertyType",
+    "getPropertyValue",
+    "getPrototypeOf",
+    "getQuery",
+    "getQueryParameter",
+    "getRGBColorValue",
+    "getRandomValues",
+    "getRangeAt",
+    "getReader",
+    "getReceivers",
+    "getRectValue",
+    "getRegistration",
+    "getRegistrations",
+    "getRemoteCandidates",
+    "getRemoteCertificates",
+    "getRemoteParameters",
+    "getRemoteStreams",
+    "getRenderbufferParameter",
+    "getResponseHeader",
+    "getRoot",
+    "getRootNode",
+    "getRotationOfChar",
+    "getSVGDocument",
+    "getSamplerParameter",
+    "getScreenCTM",
+    "getSeconds",
+    "getSelectedCandidatePair",
+    "getSelection",
+    "getSenders",
+    "getService",
+    "getSettings",
+    "getShaderInfoLog",
+    "getShaderParameter",
+    "getShaderPrecisionFormat",
+    "getShaderSource",
+    "getSimpleDuration",
+    "getSiteIcons",
+    "getSources",
+    "getSpeculativeParserUrls",
+    "getStartPositionOfChar",
+    "getStartTime",
+    "getState",
+    "getStats",
+    "getStatusForPolicy",
+    "getStorageUpdates",
+    "getStreamById",
+    "getStringValue",
+    "getSubStringLength",
+    "getSubscription",
+    "getSupportedConstraints",
+    "getSupportedExtensions",
+    "getSupportedFormats",
+    "getSyncParameter",
+    "getSynchronizationSources",
+    "getTags",
+    "getTargetRanges",
+    "getTexParameter",
+    "getTime",
+    "getTimezoneOffset",
+    "getTiming",
+    "getTotalLength",
+    "getTrackById",
+    "getTracks",
+    "getTransceivers",
+    "getTransform",
+    "getTransformFeedbackVarying",
+    "getTransformToElement",
+    "getTransports",
+    "getType",
+    "getTypeMapping",
+    "getUTCDate",
+    "getUTCDay",
+    "getUTCFullYear",
+    "getUTCHours",
+    "getUTCMilliseconds",
+    "getUTCMinutes",
+    "getUTCMonth",
+    "getUTCSeconds",
+    "getUint16",
+    "getUint32",
+    "getUint8",
+    "getUniform",
+    "getUniformBlockIndex",
+    "getUniformIndices",
+    "getUniformLocation",
+    "getUserMedia",
+    "getVRDisplays",
+    "getValues",
+    "getVarDate",
+    "getVariableValue",
+    "getVertexAttrib",
+    "getVertexAttribOffset",
+    "getVideoPlaybackQuality",
+    "getVideoTracks",
+    "getViewerPose",
+    "getViewport",
+    "getVoices",
+    "getWakeLockState",
+    "getWriter",
+    "getYear",
+    "givenName",
+    "global",
+    "globalAlpha",
+    "globalCompositeOperation",
+    "globalThis",
+    "glyphOrientationHorizontal",
+    "glyphOrientationVertical",
+    "glyphRef",
+    "go",
+    "grabFrame",
+    "grad",
+    "gradientTransform",
+    "gradientUnits",
+    "grammars",
+    "green",
+    "grid",
+    "grid-area",
+    "grid-auto-columns",
+    "grid-auto-flow",
+    "grid-auto-rows",
+    "grid-column",
+    "grid-column-end",
+    "grid-column-gap",
+    "grid-column-start",
+    "grid-gap",
+    "grid-row",
+    "grid-row-end",
+    "grid-row-gap",
+    "grid-row-start",
+    "grid-template",
+    "grid-template-areas",
+    "grid-template-columns",
+    "grid-template-rows",
+    "gridArea",
+    "gridAutoColumns",
+    "gridAutoFlow",
+    "gridAutoRows",
+    "gridColumn",
+    "gridColumnEnd",
+    "gridColumnGap",
+    "gridColumnStart",
+    "gridGap",
+    "gridRow",
+    "gridRowEnd",
+    "gridRowGap",
+    "gridRowStart",
+    "gridTemplate",
+    "gridTemplateAreas",
+    "gridTemplateColumns",
+    "gridTemplateRows",
+    "gripSpace",
+    "group",
+    "groupCollapsed",
+    "groupEnd",
+    "groupId",
+    "hadRecentInput",
+    "hand",
+    "handedness",
+    "hapticActuators",
+    "hardwareConcurrency",
+    "has",
+    "hasAttribute",
+    "hasAttributeNS",
+    "hasAttributes",
+    "hasBeenActive",
+    "hasChildNodes",
+    "hasComposition",
+    "hasEnrolledInstrument",
+    "hasExtension",
+    "hasExternalDisplay",
+    "hasFeature",
+    "hasFocus",
+    "hasInstance",
+    "hasLayout",
+    "hasOrientation",
+    "hasOwnProperty",
+    "hasPointerCapture",
+    "hasPosition",
+    "hasReading",
+    "hasStorageAccess",
+    "hash",
+    "head",
+    "headers",
+    "heading",
+    "height",
+    "hidden",
+    "hide",
+    "hideFocus",
+    "high",
+    "highWaterMark",
+    "hint",
+    "history",
+    "honorificPrefix",
+    "honorificSuffix",
+    "horizontalOverflow",
+    "host",
+    "hostCandidate",
+    "hostname",
+    "href",
+    "hrefTranslate",
+    "hreflang",
+    "hspace",
+    "html5TagCheckInerface",
+    "htmlFor",
+    "htmlText",
+    "httpEquiv",
+    "httpRequestStatusCode",
+    "hwTimestamp",
+    "hyphens",
+    "hypot",
+    "iccId",
+    "iceConnectionState",
+    "iceGatheringState",
+    "iceTransport",
+    "icon",
+    "iconURL",
+    "id",
+    "identifier",
+    "identity",
+    "idpLoginUrl",
+    "ignoreBOM",
+    "ignoreCase",
+    "ignoreDepthValues",
+    "image-orientation",
+    "image-rendering",
+    "imageHeight",
+    "imageOrientation",
+    "imageRendering",
+    "imageSizes",
+    "imageSmoothingEnabled",
+    "imageSmoothingQuality",
+    "imageSrcset",
+    "imageWidth",
+    "images",
+    "ime-mode",
+    "imeMode",
+    "implementation",
+    "importKey",
+    "importNode",
+    "importStylesheet",
+    "imports",
+    "impp",
+    "imul",
+    "in",
+    "in1",
+    "in2",
+    "inBandMetadataTrackDispatchType",
+    "inRange",
+    "includes",
+    "incremental",
+    "indeterminate",
+    "index",
+    "indexNames",
+    "indexOf",
+    "indexedDB",
+    "indicate",
+    "inertiaDestinationX",
+    "inertiaDestinationY",
+    "info",
+    "init",
+    "initAnimationEvent",
+    "initBeforeLoadEvent",
+    "initClipboardEvent",
+    "initCloseEvent",
+    "initCommandEvent",
+    "initCompositionEvent",
+    "initCustomEvent",
+    "initData",
+    "initDataType",
+    "initDeviceMotionEvent",
+    "initDeviceOrientationEvent",
+    "initDragEvent",
+    "initErrorEvent",
+    "initEvent",
+    "initFocusEvent",
+    "initGestureEvent",
+    "initHashChangeEvent",
+    "initKeyEvent",
+    "initKeyboardEvent",
+    "initMSManipulationEvent",
+    "initMessageEvent",
+    "initMouseEvent",
+    "initMouseScrollEvent",
+    "initMouseWheelEvent",
+    "initMutationEvent",
+    "initNSMouseEvent",
+    "initOverflowEvent",
+    "initPageEvent",
+    "initPageTransitionEvent",
+    "initPointerEvent",
+    "initPopStateEvent",
+    "initProgressEvent",
+    "initScrollAreaEvent",
+    "initSimpleGestureEvent",
+    "initStorageEvent",
+    "initTextEvent",
+    "initTimeEvent",
+    "initTouchEvent",
+    "initTransitionEvent",
+    "initUIEvent",
+    "initWebKitAnimationEvent",
+    "initWebKitTransitionEvent",
+    "initWebKitWheelEvent",
+    "initWheelEvent",
+    "initialTime",
+    "initialize",
+    "initiatorType",
+    "inline-size",
+    "inlineSize",
+    "inlineVerticalFieldOfView",
+    "inner",
+    "innerHTML",
+    "innerHeight",
+    "innerText",
+    "innerWidth",
+    "input",
+    "inputBuffer",
+    "inputEncoding",
+    "inputMethod",
+    "inputMode",
+    "inputSource",
+    "inputSources",
+    "inputType",
+    "inputs",
+    "insertAdjacentElement",
+    "insertAdjacentHTML",
+    "insertAdjacentText",
+    "insertBefore",
+    "insertCell",
+    "insertDTMF",
+    "insertData",
+    "insertItemBefore",
+    "insertNode",
+    "insertRow",
+    "insertRule",
+    "inset",
+    "inset-block",
+    "inset-block-end",
+    "inset-block-start",
+    "inset-inline",
+    "inset-inline-end",
+    "inset-inline-start",
+    "insetBlock",
+    "insetBlockEnd",
+    "insetBlockStart",
+    "insetInline",
+    "insetInlineEnd",
+    "insetInlineStart",
+    "installing",
+    "instanceRoot",
+    "instantiate",
+    "instantiateStreaming",
+    "instruments",
+    "int16",
+    "int32",
+    "int8",
+    "integrity",
+    "interactionMode",
+    "intercept",
+    "interfaceClass",
+    "interfaceName",
+    "interfaceNumber",
+    "interfaceProtocol",
+    "interfaceSubclass",
+    "interfaces",
+    "interimResults",
+    "internalSubset",
+    "interpretation",
+    "intersectionRatio",
+    "intersectionRect",
+    "intersectsNode",
+    "interval",
+    "invalidIteratorState",
+    "invalidateFramebuffer",
+    "invalidateSubFramebuffer",
+    "inverse",
+    "invertSelf",
+    "is",
+    "is2D",
+    "isActive",
+    "isAlternate",
+    "isArray",
+    "isBingCurrentSearchDefault",
+    "isBuffer",
+    "isCandidateWindowVisible",
+    "isChar",
+    "isCollapsed",
+    "isComposing",
+    "isConcatSpreadable",
+    "isConnected",
+    "isContentEditable",
+    "isContentHandlerRegistered",
+    "isContextLost",
+    "isDefaultNamespace",
+    "isDirectory",
+    "isDisabled",
+    "isEnabled",
+    "isEqual",
+    "isEqualNode",
+    "isExtensible",
+    "isExternalCTAP2SecurityKeySupported",
+    "isFile",
+    "isFinite",
+    "isFramebuffer",
+    "isFrozen",
+    "isGenerator",
+    "isHTML",
+    "isHistoryNavigation",
+    "isId",
+    "isIdentity",
+    "isInjected",
+    "isInteger",
+    "isIntersecting",
+    "isLockFree",
+    "isMap",
+    "isMultiLine",
+    "isNaN",
+    "isOpen",
+    "isPointInFill",
+    "isPointInPath",
+    "isPointInRange",
+    "isPointInStroke",
+    "isPrefAlternate",
+    "isPresenting",
+    "isPrimary",
+    "isProgram",
+    "isPropertyImplicit",
+    "isProtocolHandlerRegistered",
+    "isPrototypeOf",
+    "isQuery",
+    "isRenderbuffer",
+    "isSafeInteger",
+    "isSameNode",
+    "isSampler",
+    "isScript",
+    "isScriptURL",
+    "isSealed",
+    "isSecureContext",
+    "isSessionSupported",
+    "isShader",
+    "isSupported",
+    "isSync",
+    "isTextEdit",
+    "isTexture",
+    "isTransformFeedback",
+    "isTrusted",
+    "isTypeSupported",
+    "isUserVerifyingPlatformAuthenticatorAvailable",
+    "isVertexArray",
+    "isView",
+    "isVisible",
+    "isochronousTransferIn",
+    "isochronousTransferOut",
+    "isolation",
+    "italics",
+    "item",
+    "itemId",
+    "itemProp",
+    "itemRef",
+    "itemScope",
+    "itemType",
+    "itemValue",
+    "items",
+    "iterateNext",
+    "iterationComposite",
+    "iterator",
+    "javaEnabled",
+    "jobTitle",
+    "join",
+    "json",
+    "justify-content",
+    "justify-items",
+    "justify-self",
+    "justifyContent",
+    "justifyItems",
+    "justifySelf",
+    "k1",
+    "k2",
+    "k3",
+    "k4",
+    "kHz",
+    "keepalive",
+    "kernelMatrix",
+    "kernelUnitLengthX",
+    "kernelUnitLengthY",
+    "kerning",
+    "key",
+    "keyCode",
+    "keyFor",
+    "keyIdentifier",
+    "keyLightEnabled",
+    "keyLocation",
+    "keyPath",
+    "keyStatuses",
+    "keySystem",
+    "keyText",
+    "keyUsage",
+    "keyboard",
+    "keys",
+    "keytype",
+    "kind",
+    "knee",
+    "label",
+    "labels",
+    "lang",
+    "language",
+    "languages",
+    "largeArcFlag",
+    "lastChild",
+    "lastElementChild",
+    "lastEventId",
+    "lastIndex",
+    "lastIndexOf",
+    "lastInputTime",
+    "lastMatch",
+    "lastMessageSubject",
+    "lastMessageType",
+    "lastModified",
+    "lastModifiedDate",
+    "lastPage",
+    "lastParen",
+    "lastState",
+    "lastStyleSheetSet",
+    "latitude",
+    "layerX",
+    "layerY",
+    "layoutFlow",
+    "layoutGrid",
+    "layoutGridChar",
+    "layoutGridLine",
+    "layoutGridMode",
+    "layoutGridType",
+    "lbound",
+    "left",
+    "leftContext",
+    "leftDegrees",
+    "leftMargin",
+    "leftProjectionMatrix",
+    "leftViewMatrix",
+    "length",
+    "lengthAdjust",
+    "lengthComputable",
+    "letter-spacing",
+    "letterSpacing",
+    "level",
+    "lighting-color",
+    "lightingColor",
+    "limitingConeAngle",
+    "line",
+    "line-break",
+    "line-height",
+    "lineAlign",
+    "lineBreak",
+    "lineCap",
+    "lineDashOffset",
+    "lineHeight",
+    "lineJoin",
+    "lineNumber",
+    "lineTo",
+    "lineWidth",
+    "linearAcceleration",
+    "linearRampToValueAtTime",
+    "linearVelocity",
+    "lineno",
+    "lines",
+    "link",
+    "linkColor",
+    "linkProgram",
+    "links",
+    "list",
+    "list-style",
+    "list-style-image",
+    "list-style-position",
+    "list-style-type",
+    "listStyle",
+    "listStyleImage",
+    "listStylePosition",
+    "listStyleType",
+    "listener",
+    "load",
+    "loadEventEnd",
+    "loadEventStart",
+    "loadTime",
+    "loadTimes",
+    "loaded",
+    "loading",
+    "localDescription",
+    "localName",
+    "localService",
+    "localStorage",
+    "locale",
+    "localeCompare",
+    "location",
+    "locationbar",
+    "lock",
+    "locked",
+    "lockedFile",
+    "locks",
+    "log",
+    "log10",
+    "log1p",
+    "log2",
+    "logicalXDPI",
+    "logicalYDPI",
+    "longDesc",
+    "longitude",
+    "lookupNamespaceURI",
+    "lookupPrefix",
+    "loop",
+    "loopEnd",
+    "loopStart",
+    "looping",
+    "low",
+    "lower",
+    "lowerBound",
+    "lowerOpen",
+    "lowsrc",
+    "m11",
+    "m12",
+    "m13",
+    "m14",
+    "m21",
+    "m22",
+    "m23",
+    "m24",
+    "m31",
+    "m32",
+    "m33",
+    "m34",
+    "m41",
+    "m42",
+    "m43",
+    "m44",
+    "makeXRCompatible",
+    "manifest",
+    "manufacturer",
+    "manufacturerName",
+    "map",
+    "mapping",
+    "margin",
+    "margin-block",
+    "margin-block-end",
+    "margin-block-start",
+    "margin-bottom",
+    "margin-inline",
+    "margin-inline-end",
+    "margin-inline-start",
+    "margin-left",
+    "margin-right",
+    "margin-top",
+    "marginBlock",
+    "marginBlockEnd",
+    "marginBlockStart",
+    "marginBottom",
+    "marginHeight",
+    "marginInline",
+    "marginInlineEnd",
+    "marginInlineStart",
+    "marginLeft",
+    "marginRight",
+    "marginTop",
+    "marginWidth",
+    "mark",
+    "marker",
+    "marker-end",
+    "marker-mid",
+    "marker-offset",
+    "marker-start",
+    "markerEnd",
+    "markerHeight",
+    "markerMid",
+    "markerOffset",
+    "markerStart",
+    "markerUnits",
+    "markerWidth",
+    "marks",
+    "mask",
+    "mask-clip",
+    "mask-composite",
+    "mask-image",
+    "mask-mode",
+    "mask-origin",
+    "mask-position",
+    "mask-position-x",
+    "mask-position-y",
+    "mask-repeat",
+    "mask-size",
+    "mask-type",
+    "maskClip",
+    "maskComposite",
+    "maskContentUnits",
+    "maskImage",
+    "maskMode",
+    "maskOrigin",
+    "maskPosition",
+    "maskPositionX",
+    "maskPositionY",
+    "maskRepeat",
+    "maskSize",
+    "maskType",
+    "maskUnits",
+    "match",
+    "matchAll",
+    "matchMedia",
+    "matchMedium",
+    "matches",
+    "matrix",
+    "matrixTransform",
+    "max",
+    "max-block-size",
+    "max-height",
+    "max-inline-size",
+    "max-width",
+    "maxActions",
+    "maxAlternatives",
+    "maxBlockSize",
+    "maxChannelCount",
+    "maxChannels",
+    "maxConnectionsPerServer",
+    "maxDecibels",
+    "maxDistance",
+    "maxHeight",
+    "maxInlineSize",
+    "maxLayers",
+    "maxLength",
+    "maxMessageSize",
+    "maxPacketLifeTime",
+    "maxRetransmits",
+    "maxTouchPoints",
+    "maxValue",
+    "maxWidth",
+    "measure",
+    "measureText",
+    "media",
+    "mediaCapabilities",
+    "mediaDevices",
+    "mediaElement",
+    "mediaGroup",
+    "mediaKeys",
+    "mediaSession",
+    "mediaStream",
+    "mediaText",
+    "meetOrSlice",
+    "memory",
+    "menubar",
+    "mergeAttributes",
+    "message",
+    "messageClass",
+    "messageHandlers",
+    "messageType",
+    "metaKey",
+    "metadata",
+    "method",
+    "methodDetails",
+    "methodName",
+    "mid",
+    "mimeType",
+    "mimeTypes",
+    "min",
+    "min-block-size",
+    "min-height",
+    "min-inline-size",
+    "min-width",
+    "minBlockSize",
+    "minDecibels",
+    "minHeight",
+    "minInlineSize",
+    "minLength",
+    "minValue",
+    "minWidth",
+    "miterLimit",
+    "mix-blend-mode",
+    "mixBlendMode",
+    "mm",
+    "mode",
+    "modify",
+    "mount",
+    "move",
+    "moveBy",
+    "moveEnd",
+    "moveFirst",
+    "moveFocusDown",
+    "moveFocusLeft",
+    "moveFocusRight",
+    "moveFocusUp",
+    "moveNext",
+    "moveRow",
+    "moveStart",
+    "moveTo",
+    "moveToBookmark",
+    "moveToElementText",
+    "moveToPoint",
+    "movementX",
+    "movementY",
+    "mozAdd",
+    "mozAnimationStartTime",
+    "mozAnon",
+    "mozApps",
+    "mozAudioCaptured",
+    "mozAudioChannelType",
+    "mozAutoplayEnabled",
+    "mozCancelAnimationFrame",
+    "mozCancelFullScreen",
+    "mozCancelRequestAnimationFrame",
+    "mozCaptureStream",
+    "mozCaptureStreamUntilEnded",
+    "mozClearDataAt",
+    "mozContact",
+    "mozContacts",
+    "mozCreateFileHandle",
+    "mozCurrentTransform",
+    "mozCurrentTransformInverse",
+    "mozCursor",
+    "mozDash",
+    "mozDashOffset",
+    "mozDecodedFrames",
+    "mozExitPointerLock",
+    "mozFillRule",
+    "mozFragmentEnd",
+    "mozFrameDelay",
+    "mozFullScreen",
+    "mozFullScreenElement",
+    "mozFullScreenEnabled",
+    "mozGetAll",
+    "mozGetAllKeys",
+    "mozGetAsFile",
+    "mozGetDataAt",
+    "mozGetMetadata",
+    "mozGetUserMedia",
+    "mozHasAudio",
+    "mozHasItem",
+    "mozHidden",
+    "mozImageSmoothingEnabled",
+    "mozIndexedDB",
+    "mozInnerScreenX",
+    "mozInnerScreenY",
+    "mozInputSource",
+    "mozIsTextField",
+    "mozItem",
+    "mozItemCount",
+    "mozItems",
+    "mozLength",
+    "mozLockOrientation",
+    "mozMatchesSelector",
+    "mozMovementX",
+    "mozMovementY",
+    "mozOpaque",
+    "mozOrientation",
+    "mozPaintCount",
+    "mozPaintedFrames",
+    "mozParsedFrames",
+    "mozPay",
+    "mozPointerLockElement",
+    "mozPresentedFrames",
+    "mozPreservesPitch",
+    "mozPressure",
+    "mozPrintCallback",
+    "mozRTCIceCandidate",
+    "mozRTCPeerConnection",
+    "mozRTCSessionDescription",
+    "mozRemove",
+    "mozRequestAnimationFrame",
+    "mozRequestFullScreen",
+    "mozRequestPointerLock",
+    "mozSetDataAt",
+    "mozSetImageElement",
+    "mozSourceNode",
+    "mozSrcObject",
+    "mozSystem",
+    "mozTCPSocket",
+    "mozTextStyle",
+    "mozTypesAt",
+    "mozUnlockOrientation",
+    "mozUserCancelled",
+    "mozVisibilityState",
+    "ms",
+    "msAnimation",
+    "msAnimationDelay",
+    "msAnimationDirection",
+    "msAnimationDuration",
+    "msAnimationFillMode",
+    "msAnimationIterationCount",
+    "msAnimationName",
+    "msAnimationPlayState",
+    "msAnimationStartTime",
+    "msAnimationTimingFunction",
+    "msBackfaceVisibility",
+    "msBlockProgression",
+    "msCSSOMElementFloatMetrics",
+    "msCaching",
+    "msCachingEnabled",
+    "msCancelRequestAnimationFrame",
+    "msCapsLockWarningOff",
+    "msClearImmediate",
+    "msClose",
+    "msContentZoomChaining",
+    "msContentZoomFactor",
+    "msContentZoomLimit",
+    "msContentZoomLimitMax",
+    "msContentZoomLimitMin",
+    "msContentZoomSnap",
+    "msContentZoomSnapPoints",
+    "msContentZoomSnapType",
+    "msContentZooming",
+    "msConvertURL",
+    "msCrypto",
+    "msDoNotTrack",
+    "msElementsFromPoint",
+    "msElementsFromRect",
+    "msExitFullscreen",
+    "msExtendedCode",
+    "msFillRule",
+    "msFirstPaint",
+    "msFlex",
+    "msFlexAlign",
+    "msFlexDirection",
+    "msFlexFlow",
+    "msFlexItemAlign",
+    "msFlexLinePack",
+    "msFlexNegative",
+    "msFlexOrder",
+    "msFlexPack",
+    "msFlexPositive",
+    "msFlexPreferredSize",
+    "msFlexWrap",
+    "msFlowFrom",
+    "msFlowInto",
+    "msFontFeatureSettings",
+    "msFullscreenElement",
+    "msFullscreenEnabled",
+    "msGetInputContext",
+    "msGetRegionContent",
+    "msGetUntransformedBounds",
+    "msGraphicsTrustStatus",
+    "msGridColumn",
+    "msGridColumnAlign",
+    "msGridColumnSpan",
+    "msGridColumns",
+    "msGridRow",
+    "msGridRowAlign",
+    "msGridRowSpan",
+    "msGridRows",
+    "msHidden",
+    "msHighContrastAdjust",
+    "msHyphenateLimitChars",
+    "msHyphenateLimitLines",
+    "msHyphenateLimitZone",
+    "msHyphens",
+    "msImageSmoothingEnabled",
+    "msImeAlign",
+    "msIndexedDB",
+    "msInterpolationMode",
+    "msIsStaticHTML",
+    "msKeySystem",
+    "msKeys",
+    "msLaunchUri",
+    "msLockOrientation",
+    "msManipulationViewsEnabled",
+    "msMatchMedia",
+    "msMatchesSelector",
+    "msMaxTouchPoints",
+    "msOrientation",
+    "msOverflowStyle",
+    "msPerspective",
+    "msPerspectiveOrigin",
+    "msPlayToDisabled",
+    "msPlayToPreferredSourceUri",
+    "msPlayToPrimary",
+    "msPointerEnabled",
+    "msRegionOverflow",
+    "msReleasePointerCapture",
+    "msRequestAnimationFrame",
+    "msRequestFullscreen",
+    "msSaveBlob",
+    "msSaveOrOpenBlob",
+    "msScrollChaining",
+    "msScrollLimit",
+    "msScrollLimitXMax",
+    "msScrollLimitXMin",
+    "msScrollLimitYMax",
+    "msScrollLimitYMin",
+    "msScrollRails",
+    "msScrollSnapPointsX",
+    "msScrollSnapPointsY",
+    "msScrollSnapType",
+    "msScrollSnapX",
+    "msScrollSnapY",
+    "msScrollTranslation",
+    "msSetImmediate",
+    "msSetMediaKeys",
+    "msSetPointerCapture",
+    "msTextCombineHorizontal",
+    "msTextSizeAdjust",
+    "msToBlob",
+    "msTouchAction",
+    "msTouchSelect",
+    "msTraceAsyncCallbackCompleted",
+    "msTraceAsyncCallbackStarting",
+    "msTraceAsyncOperationCompleted",
+    "msTraceAsyncOperationStarting",
+    "msTransform",
+    "msTransformOrigin",
+    "msTransformStyle",
+    "msTransition",
+    "msTransitionDelay",
+    "msTransitionDuration",
+    "msTransitionProperty",
+    "msTransitionTimingFunction",
+    "msUnlockOrientation",
+    "msUpdateAsyncCallbackRelation",
+    "msUserSelect",
+    "msVisibilityState",
+    "msWrapFlow",
+    "msWrapMargin",
+    "msWrapThrough",
+    "msWriteProfilerMark",
+    "msZoom",
+    "msZoomTo",
+    "mt",
+    "mul",
+    "multiEntry",
+    "multiSelectionObj",
+    "multiline",
+    "multiple",
+    "multiply",
+    "multiplySelf",
+    "mutableFile",
+    "muted",
+    "n",
+    "name",
+    "nameProp",
+    "namedItem",
+    "namedRecordset",
+    "names",
+    "namespaceURI",
+    "namespaces",
+    "naturalHeight",
+    "naturalWidth",
+    "navigate",
+    "navigation",
+    "navigationMode",
+    "navigationPreload",
+    "navigationStart",
+    "navigator",
+    "near",
+    "nearestViewportElement",
+    "negative",
+    "negotiated",
+    "netscape",
+    "networkState",
+    "newScale",
+    "newTranslate",
+    "newURL",
+    "newValue",
+    "newValueSpecifiedUnits",
+    "newVersion",
+    "newhome",
+    "next",
+    "nextElementSibling",
+    "nextHopProtocol",
+    "nextNode",
+    "nextPage",
+    "nextSibling",
+    "nickname",
+    "noHref",
+    "noModule",
+    "noResize",
+    "noShade",
+    "noValidate",
+    "noWrap",
+    "node",
+    "nodeName",
+    "nodeType",
+    "nodeValue",
+    "nonce",
+    "normalize",
+    "normalizedPathSegList",
+    "notationName",
+    "notations",
+    "note",
+    "noteGrainOn",
+    "noteOff",
+    "noteOn",
+    "notify",
+    "now",
+    "numOctaves",
+    "number",
+    "numberOfChannels",
+    "numberOfInputs",
+    "numberOfItems",
+    "numberOfOutputs",
+    "numberValue",
+    "oMatchesSelector",
+    "object",
+    "object-fit",
+    "object-position",
+    "objectFit",
+    "objectPosition",
+    "objectStore",
+    "objectStoreNames",
+    "objectType",
+    "observe",
+    "of",
+    "offscreenBuffering",
+    "offset",
+    "offset-anchor",
+    "offset-distance",
+    "offset-path",
+    "offset-rotate",
+    "offsetAnchor",
+    "offsetDistance",
+    "offsetHeight",
+    "offsetLeft",
+    "offsetNode",
+    "offsetParent",
+    "offsetPath",
+    "offsetRotate",
+    "offsetTop",
+    "offsetWidth",
+    "offsetX",
+    "offsetY",
+    "ok",
+    "oldURL",
+    "oldValue",
+    "oldVersion",
+    "olderShadowRoot",
+    "onLine",
+    "onabort",
+    "onabsolutedeviceorientation",
+    "onactivate",
+    "onactive",
+    "onaddsourcebuffer",
+    "onaddstream",
+    "onaddtrack",
+    "onafterprint",
+    "onafterscriptexecute",
+    "onafterupdate",
+    "onanimationcancel",
+    "onanimationend",
+    "onanimationiteration",
+    "onanimationstart",
+    "onappinstalled",
+    "onaudioend",
+    "onaudioprocess",
+    "onaudiostart",
+    "onautocomplete",
+    "onautocompleteerror",
+    "onauxclick",
+    "onbeforeactivate",
+    "onbeforecopy",
+    "onbeforecut",
+    "onbeforedeactivate",
+    "onbeforeeditfocus",
+    "onbeforeinstallprompt",
+    "onbeforepaste",
+    "onbeforeprint",
+    "onbeforescriptexecute",
+    "onbeforeunload",
+    "onbeforeupdate",
+    "onbeforexrselect",
+    "onbegin",
+    "onblocked",
+    "onblur",
+    "onbounce",
+    "onboundary",
+    "onbufferedamountlow",
+    "oncached",
+    "oncancel",
+    "oncandidatewindowhide",
+    "oncandidatewindowshow",
+    "oncandidatewindowupdate",
+    "oncanplay",
+    "oncanplaythrough",
+    "once",
+    "oncellchange",
+    "onchange",
+    "oncharacteristicvaluechanged",
+    "onchargingchange",
+    "onchargingtimechange",
+    "onchecking",
+    "onclick",
+    "onclose",
+    "onclosing",
+    "oncompassneedscalibration",
+    "oncomplete",
+    "onconnect",
+    "onconnecting",
+    "onconnectionavailable",
+    "onconnectionstatechange",
+    "oncontextmenu",
+    "oncontrollerchange",
+    "oncontrolselect",
+    "oncopy",
+    "oncuechange",
+    "oncut",
+    "ondataavailable",
+    "ondatachannel",
+    "ondatasetchanged",
+    "ondatasetcomplete",
+    "ondblclick",
+    "ondeactivate",
+    "ondevicechange",
+    "ondevicelight",
+    "ondevicemotion",
+    "ondeviceorientation",
+    "ondeviceorientationabsolute",
+    "ondeviceproximity",
+    "ondischargingtimechange",
+    "ondisconnect",
+    "ondisplay",
+    "ondownloading",
+    "ondrag",
+    "ondragend",
+    "ondragenter",
+    "ondragexit",
+    "ondragleave",
+    "ondragover",
+    "ondragstart",
+    "ondrop",
+    "ondurationchange",
+    "onemptied",
+    "onencrypted",
+    "onend",
+    "onended",
+    "onenter",
+    "onenterpictureinpicture",
+    "onerror",
+    "onerrorupdate",
+    "onexit",
+    "onfilterchange",
+    "onfinish",
+    "onfocus",
+    "onfocusin",
+    "onfocusout",
+    "onformdata",
+    "onfreeze",
+    "onfullscreenchange",
+    "onfullscreenerror",
+    "ongatheringstatechange",
+    "ongattserverdisconnected",
+    "ongesturechange",
+    "ongestureend",
+    "ongesturestart",
+    "ongotpointercapture",
+    "onhashchange",
+    "onhelp",
+    "onicecandidate",
+    "onicecandidateerror",
+    "oniceconnectionstatechange",
+    "onicegatheringstatechange",
+    "oninactive",
+    "oninput",
+    "oninputsourceschange",
+    "oninvalid",
+    "onkeydown",
+    "onkeypress",
+    "onkeystatuseschange",
+    "onkeyup",
+    "onlanguagechange",
+    "onlayoutcomplete",
+    "onleavepictureinpicture",
+    "onlevelchange",
+    "onload",
+    "onloadeddata",
+    "onloadedmetadata",
+    "onloadend",
+    "onloading",
+    "onloadingdone",
+    "onloadingerror",
+    "onloadstart",
+    "onlosecapture",
+    "onlostpointercapture",
+    "only",
+    "onmark",
+    "onmessage",
+    "onmessageerror",
+    "onmidimessage",
+    "onmousedown",
+    "onmouseenter",
+    "onmouseleave",
+    "onmousemove",
+    "onmouseout",
+    "onmouseover",
+    "onmouseup",
+    "onmousewheel",
+    "onmove",
+    "onmoveend",
+    "onmovestart",
+    "onmozfullscreenchange",
+    "onmozfullscreenerror",
+    "onmozorientationchange",
+    "onmozpointerlockchange",
+    "onmozpointerlockerror",
+    "onmscontentzoom",
+    "onmsfullscreenchange",
+    "onmsfullscreenerror",
+    "onmsgesturechange",
+    "onmsgesturedoubletap",
+    "onmsgestureend",
+    "onmsgesturehold",
+    "onmsgesturestart",
+    "onmsgesturetap",
+    "onmsgotpointercapture",
+    "onmsinertiastart",
+    "onmslostpointercapture",
+    "onmsmanipulationstatechanged",
+    "onmsneedkey",
+    "onmsorientationchange",
+    "onmspointercancel",
+    "onmspointerdown",
+    "onmspointerenter",
+    "onmspointerhover",
+    "onmspointerleave",
+    "onmspointermove",
+    "onmspointerout",
+    "onmspointerover",
+    "onmspointerup",
+    "onmssitemodejumplistitemremoved",
+    "onmsthumbnailclick",
+    "onmute",
+    "onnegotiationneeded",
+    "onnomatch",
+    "onnoupdate",
+    "onobsolete",
+    "onoffline",
+    "ononline",
+    "onopen",
+    "onorientationchange",
+    "onpagechange",
+    "onpagehide",
+    "onpageshow",
+    "onpaste",
+    "onpause",
+    "onpayerdetailchange",
+    "onpaymentmethodchange",
+    "onplay",
+    "onplaying",
+    "onpluginstreamstart",
+    "onpointercancel",
+    "onpointerdown",
+    "onpointerenter",
+    "onpointerleave",
+    "onpointerlockchange",
+    "onpointerlockerror",
+    "onpointermove",
+    "onpointerout",
+    "onpointerover",
+    "onpointerrawupdate",
+    "onpointerup",
+    "onpopstate",
+    "onprocessorerror",
+    "onprogress",
+    "onpropertychange",
+    "onratechange",
+    "onreading",
+    "onreadystatechange",
+    "onrejectionhandled",
+    "onrelease",
+    "onremove",
+    "onremovesourcebuffer",
+    "onremovestream",
+    "onremovetrack",
+    "onrepeat",
+    "onreset",
+    "onresize",
+    "onresizeend",
+    "onresizestart",
+    "onresourcetimingbufferfull",
+    "onresult",
+    "onresume",
+    "onrowenter",
+    "onrowexit",
+    "onrowsdelete",
+    "onrowsinserted",
+    "onscroll",
+    "onsearch",
+    "onsecuritypolicyviolation",
+    "onseeked",
+    "onseeking",
+    "onselect",
+    "onselectedcandidatepairchange",
+    "onselectend",
+    "onselectionchange",
+    "onselectstart",
+    "onshippingaddresschange",
+    "onshippingoptionchange",
+    "onshow",
+    "onsignalingstatechange",
+    "onsoundend",
+    "onsoundstart",
+    "onsourceclose",
+    "onsourceclosed",
+    "onsourceended",
+    "onsourceopen",
+    "onspeechend",
+    "onspeechstart",
+    "onsqueeze",
+    "onsqueezeend",
+    "onsqueezestart",
+    "onstalled",
+    "onstart",
+    "onstatechange",
+    "onstop",
+    "onstorage",
+    "onstoragecommit",
+    "onsubmit",
+    "onsuccess",
+    "onsuspend",
+    "onterminate",
+    "ontextinput",
+    "ontimeout",
+    "ontimeupdate",
+    "ontoggle",
+    "ontonechange",
+    "ontouchcancel",
+    "ontouchend",
+    "ontouchmove",
+    "ontouchstart",
+    "ontrack",
+    "ontransitioncancel",
+    "ontransitionend",
+    "ontransitionrun",
+    "ontransitionstart",
+    "onunhandledrejection",
+    "onunload",
+    "onunmute",
+    "onupdate",
+    "onupdateend",
+    "onupdatefound",
+    "onupdateready",
+    "onupdatestart",
+    "onupgradeneeded",
+    "onuserproximity",
+    "onversionchange",
+    "onvisibilitychange",
+    "onvoiceschanged",
+    "onvolumechange",
+    "onvrdisplayactivate",
+    "onvrdisplayconnect",
+    "onvrdisplaydeactivate",
+    "onvrdisplaydisconnect",
+    "onvrdisplaypresentchange",
+    "onwaiting",
+    "onwaitingforkey",
+    "onwarning",
+    "onwebkitanimationend",
+    "onwebkitanimationiteration",
+    "onwebkitanimationstart",
+    "onwebkitcurrentplaybacktargetiswirelesschanged",
+    "onwebkitfullscreenchange",
+    "onwebkitfullscreenerror",
+    "onwebkitkeyadded",
+    "onwebkitkeyerror",
+    "onwebkitkeymessage",
+    "onwebkitneedkey",
+    "onwebkitorientationchange",
+    "onwebkitplaybacktargetavailabilitychanged",
+    "onwebkitpointerlockchange",
+    "onwebkitpointerlockerror",
+    "onwebkitresourcetimingbufferfull",
+    "onwebkittransitionend",
+    "onwheel",
+    "onzoom",
+    "opacity",
+    "open",
+    "openCursor",
+    "openDatabase",
+    "openKeyCursor",
+    "opened",
+    "opener",
+    "opera",
+    "operationType",
+    "operator",
+    "opr",
+    "optimum",
+    "options",
+    "or",
+    "order",
+    "orderX",
+    "orderY",
+    "ordered",
+    "org",
+    "organization",
+    "orient",
+    "orientAngle",
+    "orientType",
+    "orientation",
+    "orientationX",
+    "orientationY",
+    "orientationZ",
+    "origin",
+    "originalPolicy",
+    "originalTarget",
+    "orphans",
+    "oscpu",
+    "outerHTML",
+    "outerHeight",
+    "outerText",
+    "outerWidth",
+    "outline",
+    "outline-color",
+    "outline-offset",
+    "outline-style",
+    "outline-width",
+    "outlineColor",
+    "outlineOffset",
+    "outlineStyle",
+    "outlineWidth",
+    "outputBuffer",
+    "outputLatency",
+    "outputs",
+    "overflow",
+    "overflow-anchor",
+    "overflow-block",
+    "overflow-inline",
+    "overflow-wrap",
+    "overflow-x",
+    "overflow-y",
+    "overflowAnchor",
+    "overflowBlock",
+    "overflowInline",
+    "overflowWrap",
+    "overflowX",
+    "overflowY",
+    "overrideMimeType",
+    "oversample",
+    "overscroll-behavior",
+    "overscroll-behavior-block",
+    "overscroll-behavior-inline",
+    "overscroll-behavior-x",
+    "overscroll-behavior-y",
+    "overscrollBehavior",
+    "overscrollBehaviorBlock",
+    "overscrollBehaviorInline",
+    "overscrollBehaviorX",
+    "overscrollBehaviorY",
+    "ownKeys",
+    "ownerDocument",
+    "ownerElement",
+    "ownerNode",
+    "ownerRule",
+    "ownerSVGElement",
+    "owningElement",
+    "p1",
+    "p2",
+    "p3",
+    "p4",
+    "packetSize",
+    "packets",
+    "pad",
+    "padEnd",
+    "padStart",
+    "padding",
+    "padding-block",
+    "padding-block-end",
+    "padding-block-start",
+    "padding-bottom",
+    "padding-inline",
+    "padding-inline-end",
+    "padding-inline-start",
+    "padding-left",
+    "padding-right",
+    "padding-top",
+    "paddingBlock",
+    "paddingBlockEnd",
+    "paddingBlockStart",
+    "paddingBottom",
+    "paddingInline",
+    "paddingInlineEnd",
+    "paddingInlineStart",
+    "paddingLeft",
+    "paddingRight",
+    "paddingTop",
+    "page",
+    "page-break-after",
+    "page-break-before",
+    "page-break-inside",
+    "pageBreakAfter",
+    "pageBreakBefore",
+    "pageBreakInside",
+    "pageCount",
+    "pageLeft",
+    "pageTop",
+    "pageX",
+    "pageXOffset",
+    "pageY",
+    "pageYOffset",
+    "pages",
+    "paint-order",
+    "paintOrder",
+    "paintRequests",
+    "paintType",
+    "paintWorklet",
+    "palette",
+    "pan",
+    "panningModel",
+    "parameters",
+    "parent",
+    "parentElement",
+    "parentNode",
+    "parentRule",
+    "parentStyleSheet",
+    "parentTextEdit",
+    "parentWindow",
+    "parse",
+    "parseAll",
+    "parseFloat",
+    "parseFromString",
+    "parseInt",
+    "part",
+    "participants",
+    "passive",
+    "password",
+    "pasteHTML",
+    "path",
+    "pathLength",
+    "pathSegList",
+    "pathSegType",
+    "pathSegTypeAsLetter",
+    "pathname",
+    "pattern",
+    "patternContentUnits",
+    "patternMismatch",
+    "patternTransform",
+    "patternUnits",
+    "pause",
+    "pauseAnimations",
+    "pauseOnExit",
+    "pauseProfilers",
+    "pauseTransformFeedback",
+    "paused",
+    "payerEmail",
+    "payerName",
+    "payerPhone",
+    "paymentManager",
+    "pc",
+    "peerIdentity",
+    "pending",
+    "pendingLocalDescription",
+    "pendingRemoteDescription",
+    "percent",
+    "performance",
+    "periodicSync",
+    "permission",
+    "permissionState",
+    "permissions",
+    "persist",
+    "persisted",
+    "personalbar",
+    "perspective",
+    "perspective-origin",
+    "perspectiveOrigin",
+    "phone",
+    "phoneticFamilyName",
+    "phoneticGivenName",
+    "photo",
+    "pictureInPictureElement",
+    "pictureInPictureEnabled",
+    "pictureInPictureWindow",
+    "ping",
+    "pipeThrough",
+    "pipeTo",
+    "pitch",
+    "pixelBottom",
+    "pixelDepth",
+    "pixelHeight",
+    "pixelLeft",
+    "pixelRight",
+    "pixelStorei",
+    "pixelTop",
+    "pixelUnitToMillimeterX",
+    "pixelUnitToMillimeterY",
+    "pixelWidth",
+    "place-content",
+    "place-items",
+    "place-self",
+    "placeContent",
+    "placeItems",
+    "placeSelf",
+    "placeholder",
+    "platform",
+    "platforms",
+    "play",
+    "playEffect",
+    "playState",
+    "playbackRate",
+    "playbackState",
+    "playbackTime",
+    "played",
+    "playoutDelayHint",
+    "playsInline",
+    "plugins",
+    "pluginspage",
+    "pname",
+    "pointer-events",
+    "pointerBeforeReferenceNode",
+    "pointerEnabled",
+    "pointerEvents",
+    "pointerId",
+    "pointerLockElement",
+    "pointerType",
+    "points",
+    "pointsAtX",
+    "pointsAtY",
+    "pointsAtZ",
+    "polygonOffset",
+    "pop",
+    "populateMatrix",
+    "popupWindowFeatures",
+    "popupWindowName",
+    "popupWindowURI",
+    "port",
+    "port1",
+    "port2",
+    "ports",
+    "posBottom",
+    "posHeight",
+    "posLeft",
+    "posRight",
+    "posTop",
+    "posWidth",
+    "pose",
+    "position",
+    "positionAlign",
+    "positionX",
+    "positionY",
+    "positionZ",
+    "postError",
+    "postMessage",
+    "postalCode",
+    "poster",
+    "pow",
+    "powerEfficient",
+    "powerOff",
+    "preMultiplySelf",
+    "precision",
+    "preferredStyleSheetSet",
+    "preferredStylesheetSet",
+    "prefix",
+    "preload",
+    "prepend",
+    "presentation",
+    "preserveAlpha",
+    "preserveAspectRatio",
+    "preserveAspectRatioString",
+    "pressed",
+    "pressure",
+    "prevValue",
+    "preventDefault",
+    "preventExtensions",
+    "preventSilentAccess",
+    "previousElementSibling",
+    "previousNode",
+    "previousPage",
+    "previousRect",
+    "previousScale",
+    "previousSibling",
+    "previousTranslate",
+    "primaryKey",
+    "primitiveType",
+    "primitiveUnits",
+    "principals",
+    "print",
+    "priority",
+    "privateKey",
+    "probablySupportsContext",
+    "process",
+    "processIceMessage",
+    "processingEnd",
+    "processingStart",
+    "product",
+    "productId",
+    "productName",
+    "productSub",
+    "profile",
+    "profileEnd",
+    "profiles",
+    "projectionMatrix",
+    "promise",
+    "prompt",
+    "properties",
+    "propertyIsEnumerable",
+    "propertyName",
+    "protocol",
+    "protocolLong",
+    "prototype",
+    "provider",
+    "pseudoClass",
+    "pseudoElement",
+    "pt",
+    "publicId",
+    "publicKey",
+    "published",
+    "pulse",
+    "push",
+    "pushManager",
+    "pushNotification",
+    "pushState",
+    "put",
+    "putImageData",
+    "px",
+    "quadraticCurveTo",
+    "qualifier",
+    "quaternion",
+    "query",
+    "queryCommandEnabled",
+    "queryCommandIndeterm",
+    "queryCommandState",
+    "queryCommandSupported",
+    "queryCommandText",
+    "queryCommandValue",
+    "querySelector",
+    "querySelectorAll",
+    "queueMicrotask",
+    "quote",
+    "quotes",
+    "r",
+    "r1",
+    "r2",
+    "race",
+    "rad",
+    "radiogroup",
+    "radiusX",
+    "radiusY",
+    "random",
+    "range",
+    "rangeCount",
+    "rangeMax",
+    "rangeMin",
+    "rangeOffset",
+    "rangeOverflow",
+    "rangeParent",
+    "rangeUnderflow",
+    "rate",
+    "ratio",
+    "raw",
+    "rawId",
+    "read",
+    "readAsArrayBuffer",
+    "readAsBinaryString",
+    "readAsBlob",
+    "readAsDataURL",
+    "readAsText",
+    "readBuffer",
+    "readEntries",
+    "readOnly",
+    "readPixels",
+    "readReportRequested",
+    "readText",
+    "readValue",
+    "readable",
+    "ready",
+    "readyState",
+    "reason",
+    "reboot",
+    "receivedAlert",
+    "receiver",
+    "receivers",
+    "recipient",
+    "reconnect",
+    "recordNumber",
+    "recordsAvailable",
+    "recordset",
+    "rect",
+    "red",
+    "redEyeReduction",
+    "redirect",
+    "redirectCount",
+    "redirectEnd",
+    "redirectStart",
+    "redirected",
+    "reduce",
+    "reduceRight",
+    "reduction",
+    "refDistance",
+    "refX",
+    "refY",
+    "referenceNode",
+    "referenceSpace",
+    "referrer",
+    "referrerPolicy",
+    "refresh",
+    "region",
+    "regionAnchorX",
+    "regionAnchorY",
+    "regionId",
+    "regions",
+    "register",
+    "registerContentHandler",
+    "registerElement",
+    "registerProperty",
+    "registerProtocolHandler",
+    "reject",
+    "rel",
+    "relList",
+    "relatedAddress",
+    "relatedNode",
+    "relatedPort",
+    "relatedTarget",
+    "release",
+    "releaseCapture",
+    "releaseEvents",
+    "releaseInterface",
+    "releaseLock",
+    "releasePointerCapture",
+    "releaseShaderCompiler",
+    "reliable",
+    "reliableWrite",
+    "reload",
+    "rem",
+    "remainingSpace",
+    "remote",
+    "remoteDescription",
+    "remove",
+    "removeAllRanges",
+    "removeAttribute",
+    "removeAttributeNS",
+    "removeAttributeNode",
+    "removeBehavior",
+    "removeChild",
+    "removeCue",
+    "removeEventListener",
+    "removeFilter",
+    "removeImport",
+    "removeItem",
+    "removeListener",
+    "removeNamedItem",
+    "removeNamedItemNS",
+    "removeNode",
+    "removeParameter",
+    "removeProperty",
+    "removeRange",
+    "removeRegion",
+    "removeRule",
+    "removeSiteSpecificTrackingException",
+    "removeSourceBuffer",
+    "removeStream",
+    "removeTrack",
+    "removeVariable",
+    "removeWakeLockListener",
+    "removeWebWideTrackingException",
+    "removed",
+    "removedNodes",
+    "renderHeight",
+    "renderState",
+    "renderTime",
+    "renderWidth",
+    "renderbufferStorage",
+    "renderbufferStorageMultisample",
+    "renderedBuffer",
+    "renderingMode",
+    "renotify",
+    "repeat",
+    "replace",
+    "replaceAdjacentText",
+    "replaceAll",
+    "replaceChild",
+    "replaceChildren",
+    "replaceData",
+    "replaceId",
+    "replaceItem",
+    "replaceNode",
+    "replaceState",
+    "replaceSync",
+    "replaceTrack",
+    "replaceWholeText",
+    "replaceWith",
+    "reportValidity",
+    "request",
+    "requestAnimationFrame",
+    "requestAutocomplete",
+    "requestData",
+    "requestDevice",
+    "requestFrame",
+    "requestFullscreen",
+    "requestHitTestSource",
+    "requestHitTestSourceForTransientInput",
+    "requestId",
+    "requestIdleCallback",
+    "requestMIDIAccess",
+    "requestMediaKeySystemAccess",
+    "requestPermission",
+    "requestPictureInPicture",
+    "requestPointerLock",
+    "requestPresent",
+    "requestReferenceSpace",
+    "requestSession",
+    "requestStart",
+    "requestStorageAccess",
+    "requestSubmit",
+    "requestVideoFrameCallback",
+    "requestingWindow",
+    "requireInteraction",
+    "required",
+    "requiredExtensions",
+    "requiredFeatures",
+    "reset",
+    "resetPose",
+    "resetTransform",
+    "resize",
+    "resizeBy",
+    "resizeTo",
+    "resolve",
+    "response",
+    "responseBody",
+    "responseEnd",
+    "responseReady",
+    "responseStart",
+    "responseText",
+    "responseType",
+    "responseURL",
+    "responseXML",
+    "restartIce",
+    "restore",
+    "result",
+    "resultIndex",
+    "resultType",
+    "results",
+    "resume",
+    "resumeProfilers",
+    "resumeTransformFeedback",
+    "retry",
+    "returnValue",
+    "rev",
+    "reverse",
+    "reversed",
+    "revocable",
+    "revokeObjectURL",
+    "rgbColor",
+    "right",
+    "rightContext",
+    "rightDegrees",
+    "rightMargin",
+    "rightProjectionMatrix",
+    "rightViewMatrix",
+    "role",
+    "rolloffFactor",
+    "root",
+    "rootBounds",
+    "rootElement",
+    "rootMargin",
+    "rotate",
+    "rotateAxisAngle",
+    "rotateAxisAngleSelf",
+    "rotateFromVector",
+    "rotateFromVectorSelf",
+    "rotateSelf",
+    "rotation",
+    "rotationAngle",
+    "rotationRate",
+    "round",
+    "row-gap",
+    "rowGap",
+    "rowIndex",
+    "rowSpan",
+    "rows",
+    "rtcpTransport",
+    "rtt",
+    "ruby-align",
+    "ruby-position",
+    "rubyAlign",
+    "rubyOverhang",
+    "rubyPosition",
+    "rules",
+    "runtime",
+    "runtimeStyle",
+    "rx",
+    "ry",
+    "s",
+    "safari",
+    "sample",
+    "sampleCoverage",
+    "sampleRate",
+    "samplerParameterf",
+    "samplerParameteri",
+    "sandbox",
+    "save",
+    "saveData",
+    "scale",
+    "scale3d",
+    "scale3dSelf",
+    "scaleNonUniform",
+    "scaleNonUniformSelf",
+    "scaleSelf",
+    "scheme",
+    "scissor",
+    "scope",
+    "scopeName",
+    "scoped",
+    "screen",
+    "screenBrightness",
+    "screenEnabled",
+    "screenLeft",
+    "screenPixelToMillimeterX",
+    "screenPixelToMillimeterY",
+    "screenTop",
+    "screenX",
+    "screenY",
+    "scriptURL",
+    "scripts",
+    "scroll",
+    "scroll-behavior",
+    "scroll-margin",
+    "scroll-margin-block",
+    "scroll-margin-block-end",
+    "scroll-margin-block-start",
+    "scroll-margin-bottom",
+    "scroll-margin-inline",
+    "scroll-margin-inline-end",
+    "scroll-margin-inline-start",
+    "scroll-margin-left",
+    "scroll-margin-right",
+    "scroll-margin-top",
+    "scroll-padding",
+    "scroll-padding-block",
+    "scroll-padding-block-end",
+    "scroll-padding-block-start",
+    "scroll-padding-bottom",
+    "scroll-padding-inline",
+    "scroll-padding-inline-end",
+    "scroll-padding-inline-start",
+    "scroll-padding-left",
+    "scroll-padding-right",
+    "scroll-padding-top",
+    "scroll-snap-align",
+    "scroll-snap-type",
+    "scrollAmount",
+    "scrollBehavior",
+    "scrollBy",
+    "scrollByLines",
+    "scrollByPages",
+    "scrollDelay",
+    "scrollHeight",
+    "scrollIntoView",
+    "scrollIntoViewIfNeeded",
+    "scrollLeft",
+    "scrollLeftMax",
+    "scrollMargin",
+    "scrollMarginBlock",
+    "scrollMarginBlockEnd",
+    "scrollMarginBlockStart",
+    "scrollMarginBottom",
+    "scrollMarginInline",
+    "scrollMarginInlineEnd",
+    "scrollMarginInlineStart",
+    "scrollMarginLeft",
+    "scrollMarginRight",
+    "scrollMarginTop",
+    "scrollMaxX",
+    "scrollMaxY",
+    "scrollPadding",
+    "scrollPaddingBlock",
+    "scrollPaddingBlockEnd",
+    "scrollPaddingBlockStart",
+    "scrollPaddingBottom",
+    "scrollPaddingInline",
+    "scrollPaddingInlineEnd",
+    "scrollPaddingInlineStart",
+    "scrollPaddingLeft",
+    "scrollPaddingRight",
+    "scrollPaddingTop",
+    "scrollRestoration",
+    "scrollSnapAlign",
+    "scrollSnapType",
+    "scrollTo",
+    "scrollTop",
+    "scrollTopMax",
+    "scrollWidth",
+    "scrollX",
+    "scrollY",
+    "scrollbar-color",
+    "scrollbar-width",
+    "scrollbar3dLightColor",
+    "scrollbarArrowColor",
+    "scrollbarBaseColor",
+    "scrollbarColor",
+    "scrollbarDarkShadowColor",
+    "scrollbarFaceColor",
+    "scrollbarHighlightColor",
+    "scrollbarShadowColor",
+    "scrollbarTrackColor",
+    "scrollbarWidth",
+    "scrollbars",
+    "scrolling",
+    "scrollingElement",
+    "sctp",
+    "sctpCauseCode",
+    "sdp",
+    "sdpLineNumber",
+    "sdpMLineIndex",
+    "sdpMid",
+    "seal",
+    "search",
+    "searchBox",
+    "searchBoxJavaBridge_",
+    "searchParams",
+    "sectionRowIndex",
+    "secureConnectionStart",
+    "security",
+    "seed",
+    "seekToNextFrame",
+    "seekable",
+    "seeking",
+    "select",
+    "selectAllChildren",
+    "selectAlternateInterface",
+    "selectConfiguration",
+    "selectNode",
+    "selectNodeContents",
+    "selectNodes",
+    "selectSingleNode",
+    "selectSubString",
+    "selected",
+    "selectedIndex",
+    "selectedOptions",
+    "selectedStyleSheetSet",
+    "selectedStylesheetSet",
+    "selection",
+    "selectionDirection",
+    "selectionEnd",
+    "selectionStart",
+    "selector",
+    "selectorText",
+    "self",
+    "send",
+    "sendAsBinary",
+    "sendBeacon",
+    "sender",
+    "sentAlert",
+    "sentTimestamp",
+    "separator",
+    "serialNumber",
+    "serializeToString",
+    "serverTiming",
+    "service",
+    "serviceWorker",
+    "session",
+    "sessionId",
+    "sessionStorage",
+    "set",
+    "setActionHandler",
+    "setActive",
+    "setAlpha",
+    "setAppBadge",
+    "setAttribute",
+    "setAttributeNS",
+    "setAttributeNode",
+    "setAttributeNodeNS",
+    "setBaseAndExtent",
+    "setBigInt64",
+    "setBigUint64",
+    "setBingCurrentSearchDefault",
+    "setCapture",
+    "setCodecPreferences",
+    "setColor",
+    "setCompositeOperation",
+    "setConfiguration",
+    "setCurrentTime",
+    "setCustomValidity",
+    "setData",
+    "setDate",
+    "setDragImage",
+    "setEnd",
+    "setEndAfter",
+    "setEndBefore",
+    "setEndPoint",
+    "setFillColor",
+    "setFilterRes",
+    "setFloat32",
+    "setFloat64",
+    "setFloatValue",
+    "setFormValue",
+    "setFullYear",
+    "setHeaderValue",
+    "setHours",
+    "setIdentityProvider",
+    "setImmediate",
+    "setInt16",
+    "setInt32",
+    "setInt8",
+    "setInterval",
+    "setItem",
+    "setKeyframes",
+    "setLineCap",
+    "setLineDash",
+    "setLineJoin",
+    "setLineWidth",
+    "setLiveSeekableRange",
+    "setLocalDescription",
+    "setMatrix",
+    "setMatrixValue",
+    "setMediaKeys",
+    "setMilliseconds",
+    "setMinutes",
+    "setMiterLimit",
+    "setMonth",
+    "setNamedItem",
+    "setNamedItemNS",
+    "setNonUserCodeExceptions",
+    "setOrientToAngle",
+    "setOrientToAuto",
+    "setOrientation",
+    "setOverrideHistoryNavigationMode",
+    "setPaint",
+    "setParameter",
+    "setParameters",
+    "setPeriodicWave",
+    "setPointerCapture",
+    "setPosition",
+    "setPositionState",
+    "setPreference",
+    "setProperty",
+    "setPrototypeOf",
+    "setRGBColor",
+    "setRGBColorICCColor",
+    "setRadius",
+    "setRangeText",
+    "setRemoteDescription",
+    "setRequestHeader",
+    "setResizable",
+    "setResourceTimingBufferSize",
+    "setRotate",
+    "setScale",
+    "setSeconds",
+    "setSelectionRange",
+    "setServerCertificate",
+    "setShadow",
+    "setSinkId",
+    "setSkewX",
+    "setSkewY",
+    "setStart",
+    "setStartAfter",
+    "setStartBefore",
+    "setStdDeviation",
+    "setStreams",
+    "setStringValue",
+    "setStrokeColor",
+    "setSuggestResult",
+    "setTargetAtTime",
+    "setTargetValueAtTime",
+    "setTime",
+    "setTimeout",
+    "setTransform",
+    "setTranslate",
+    "setUTCDate",
+    "setUTCFullYear",
+    "setUTCHours",
+    "setUTCMilliseconds",
+    "setUTCMinutes",
+    "setUTCMonth",
+    "setUTCSeconds",
+    "setUint16",
+    "setUint32",
+    "setUint8",
+    "setUri",
+    "setValidity",
+    "setValueAtTime",
+    "setValueCurveAtTime",
+    "setVariable",
+    "setVelocity",
+    "setVersion",
+    "setYear",
+    "settingName",
+    "settingValue",
+    "sex",
+    "shaderSource",
+    "shadowBlur",
+    "shadowColor",
+    "shadowOffsetX",
+    "shadowOffsetY",
+    "shadowRoot",
+    "shape",
+    "shape-image-threshold",
+    "shape-margin",
+    "shape-outside",
+    "shape-rendering",
+    "shapeImageThreshold",
+    "shapeMargin",
+    "shapeOutside",
+    "shapeRendering",
+    "sheet",
+    "shift",
+    "shiftKey",
+    "shiftLeft",
+    "shippingAddress",
+    "shippingOption",
+    "shippingType",
+    "show",
+    "showHelp",
+    "showModal",
+    "showModalDialog",
+    "showModelessDialog",
+    "showNotification",
+    "sidebar",
+    "sign",
+    "signal",
+    "signalingState",
+    "signature",
+    "silent",
+    "sin",
+    "singleNodeValue",
+    "sinh",
+    "sinkId",
+    "sittingToStandingTransform",
+    "size",
+    "sizeToContent",
+    "sizeX",
+    "sizeZ",
+    "sizes",
+    "skewX",
+    "skewXSelf",
+    "skewY",
+    "skewYSelf",
+    "slice",
+    "slope",
+    "slot",
+    "small",
+    "smil",
+    "smooth",
+    "smoothingTimeConstant",
+    "snapToLines",
+    "snapshotItem",
+    "snapshotLength",
+    "some",
+    "sort",
+    "sortingCode",
+    "source",
+    "sourceBuffer",
+    "sourceBuffers",
+    "sourceCapabilities",
+    "sourceFile",
+    "sourceIndex",
+    "sources",
+    "spacing",
+    "span",
+    "speak",
+    "speakAs",
+    "speaking",
+    "species",
+    "specified",
+    "specularConstant",
+    "specularExponent",
+    "speechSynthesis",
+    "speed",
+    "speedOfSound",
+    "spellcheck",
+    "splice",
+    "split",
+    "splitText",
+    "spreadMethod",
+    "sqrt",
+    "src",
+    "srcElement",
+    "srcFilter",
+    "srcObject",
+    "srcUrn",
+    "srcdoc",
+    "srclang",
+    "srcset",
+    "stack",
+    "stackTraceLimit",
+    "stacktrace",
+    "stageParameters",
+    "standalone",
+    "standby",
+    "start",
+    "startContainer",
+    "startIce",
+    "startMessages",
+    "startNotifications",
+    "startOffset",
+    "startProfiling",
+    "startRendering",
+    "startShark",
+    "startTime",
+    "startsWith",
+    "state",
+    "status",
+    "statusCode",
+    "statusMessage",
+    "statusText",
+    "statusbar",
+    "stdDeviationX",
+    "stdDeviationY",
+    "stencilFunc",
+    "stencilFuncSeparate",
+    "stencilMask",
+    "stencilMaskSeparate",
+    "stencilOp",
+    "stencilOpSeparate",
+    "step",
+    "stepDown",
+    "stepMismatch",
+    "stepUp",
+    "sticky",
+    "stitchTiles",
+    "stop",
+    "stop-color",
+    "stop-opacity",
+    "stopColor",
+    "stopImmediatePropagation",
+    "stopNotifications",
+    "stopOpacity",
+    "stopProfiling",
+    "stopPropagation",
+    "stopShark",
+    "stopped",
+    "storage",
+    "storageArea",
+    "storageName",
+    "storageStatus",
+    "store",
+    "storeSiteSpecificTrackingException",
+    "storeWebWideTrackingException",
+    "stpVersion",
+    "stream",
+    "streams",
+    "stretch",
+    "strike",
+    "string",
+    "stringValue",
+    "stringify",
+    "stroke",
+    "stroke-dasharray",
+    "stroke-dashoffset",
+    "stroke-linecap",
+    "stroke-linejoin",
+    "stroke-miterlimit",
+    "stroke-opacity",
+    "stroke-width",
+    "strokeDasharray",
+    "strokeDashoffset",
+    "strokeLinecap",
+    "strokeLinejoin",
+    "strokeMiterlimit",
+    "strokeOpacity",
+    "strokeRect",
+    "strokeStyle",
+    "strokeText",
+    "strokeWidth",
+    "style",
+    "styleFloat",
+    "styleMap",
+    "styleMedia",
+    "styleSheet",
+    "styleSheetSets",
+    "styleSheets",
+    "sub",
+    "subarray",
+    "subject",
+    "submit",
+    "submitFrame",
+    "submitter",
+    "subscribe",
+    "substr",
+    "substring",
+    "substringData",
+    "subtle",
+    "subtree",
+    "suffix",
+    "suffixes",
+    "summary",
+    "sup",
+    "supported",
+    "supportedContentEncodings",
+    "supportedEntryTypes",
+    "supports",
+    "supportsSession",
+    "surfaceScale",
+    "surroundContents",
+    "suspend",
+    "suspendRedraw",
+    "swapCache",
+    "swapNode",
+    "sweepFlag",
+    "symbols",
+    "sync",
+    "sysexEnabled",
+    "system",
+    "systemCode",
+    "systemId",
+    "systemLanguage",
+    "systemXDPI",
+    "systemYDPI",
+    "tBodies",
+    "tFoot",
+    "tHead",
+    "tabIndex",
+    "table",
+    "table-layout",
+    "tableLayout",
+    "tableValues",
+    "tag",
+    "tagName",
+    "tagUrn",
+    "tags",
+    "taintEnabled",
+    "takePhoto",
+    "takeRecords",
+    "tan",
+    "tangentialPressure",
+    "tanh",
+    "target",
+    "targetElement",
+    "targetRayMode",
+    "targetRaySpace",
+    "targetTouches",
+    "targetX",
+    "targetY",
+    "tcpType",
+    "tee",
+    "tel",
+    "terminate",
+    "test",
+    "texImage2D",
+    "texImage3D",
+    "texParameterf",
+    "texParameteri",
+    "texStorage2D",
+    "texStorage3D",
+    "texSubImage2D",
+    "texSubImage3D",
+    "text",
+    "text-align",
+    "text-align-last",
+    "text-anchor",
+    "text-combine-upright",
+    "text-decoration",
+    "text-decoration-color",
+    "text-decoration-line",
+    "text-decoration-skip-ink",
+    "text-decoration-style",
+    "text-decoration-thickness",
+    "text-emphasis",
+    "text-emphasis-color",
+    "text-emphasis-position",
+    "text-emphasis-style",
+    "text-indent",
+    "text-justify",
+    "text-orientation",
+    "text-overflow",
+    "text-rendering",
+    "text-shadow",
+    "text-transform",
+    "text-underline-offset",
+    "text-underline-position",
+    "textAlign",
+    "textAlignLast",
+    "textAnchor",
+    "textAutospace",
+    "textBaseline",
+    "textCombineUpright",
+    "textContent",
+    "textDecoration",
+    "textDecorationBlink",
+    "textDecorationColor",
+    "textDecorationLine",
+    "textDecorationLineThrough",
+    "textDecorationNone",
+    "textDecorationOverline",
+    "textDecorationSkipInk",
+    "textDecorationStyle",
+    "textDecorationThickness",
+    "textDecorationUnderline",
+    "textEmphasis",
+    "textEmphasisColor",
+    "textEmphasisPosition",
+    "textEmphasisStyle",
+    "textIndent",
+    "textJustify",
+    "textJustifyTrim",
+    "textKashida",
+    "textKashidaSpace",
+    "textLength",
+    "textOrientation",
+    "textOverflow",
+    "textRendering",
+    "textShadow",
+    "textTracks",
+    "textTransform",
+    "textUnderlineOffset",
+    "textUnderlinePosition",
+    "then",
+    "threadId",
+    "threshold",
+    "thresholds",
+    "tiltX",
+    "tiltY",
+    "time",
+    "timeEnd",
+    "timeLog",
+    "timeOrigin",
+    "timeRemaining",
+    "timeStamp",
+    "timecode",
+    "timeline",
+    "timelineTime",
+    "timeout",
+    "timestamp",
+    "timestampOffset",
+    "timing",
+    "title",
+    "to",
+    "toArray",
+    "toBlob",
+    "toDataURL",
+    "toDateString",
+    "toElement",
+    "toExponential",
+    "toFixed",
+    "toFloat32Array",
+    "toFloat64Array",
+    "toGMTString",
+    "toISOString",
+    "toJSON",
+    "toLocaleDateString",
+    "toLocaleFormat",
+    "toLocaleLowerCase",
+    "toLocaleString",
+    "toLocaleTimeString",
+    "toLocaleUpperCase",
+    "toLowerCase",
+    "toMatrix",
+    "toMethod",
+    "toPrecision",
+    "toPrimitive",
+    "toSdp",
+    "toSource",
+    "toStaticHTML",
+    "toString",
+    "toStringTag",
+    "toSum",
+    "toTimeString",
+    "toUTCString",
+    "toUpperCase",
+    "toggle",
+    "toggleAttribute",
+    "toggleLongPressEnabled",
+    "tone",
+    "toneBuffer",
+    "tooLong",
+    "tooShort",
+    "toolbar",
+    "top",
+    "topMargin",
+    "total",
+    "totalFrameDelay",
+    "totalVideoFrames",
+    "touch-action",
+    "touchAction",
+    "touched",
+    "touches",
+    "trace",
+    "track",
+    "trackVisibility",
+    "transaction",
+    "transactions",
+    "transceiver",
+    "transferControlToOffscreen",
+    "transferFromImageBitmap",
+    "transferImageBitmap",
+    "transferIn",
+    "transferOut",
+    "transferSize",
+    "transferToImageBitmap",
+    "transform",
+    "transform-box",
+    "transform-origin",
+    "transform-style",
+    "transformBox",
+    "transformFeedbackVaryings",
+    "transformOrigin",
+    "transformPoint",
+    "transformString",
+    "transformStyle",
+    "transformToDocument",
+    "transformToFragment",
+    "transition",
+    "transition-delay",
+    "transition-duration",
+    "transition-property",
+    "transition-timing-function",
+    "transitionDelay",
+    "transitionDuration",
+    "transitionProperty",
+    "transitionTimingFunction",
+    "translate",
+    "translateSelf",
+    "translationX",
+    "translationY",
+    "transport",
+    "trim",
+    "trimEnd",
+    "trimLeft",
+    "trimRight",
+    "trimStart",
+    "trueSpeed",
+    "trunc",
+    "truncate",
+    "trustedTypes",
+    "turn",
+    "twist",
+    "type",
+    "typeDetail",
+    "typeMismatch",
+    "typeMustMatch",
+    "types",
+    "u2f",
+    "ubound",
+    "uint16",
+    "uint32",
+    "uint8",
+    "uint8Clamped",
+    "undefined",
+    "unescape",
+    "uneval",
+    "unicode",
+    "unicode-bidi",
+    "unicodeBidi",
+    "unicodeRange",
+    "uniform1f",
+    "uniform1fv",
+    "uniform1i",
+    "uniform1iv",
+    "uniform1ui",
+    "uniform1uiv",
+    "uniform2f",
+    "uniform2fv",
+    "uniform2i",
+    "uniform2iv",
+    "uniform2ui",
+    "uniform2uiv",
+    "uniform3f",
+    "uniform3fv",
+    "uniform3i",
+    "uniform3iv",
+    "uniform3ui",
+    "uniform3uiv",
+    "uniform4f",
+    "uniform4fv",
+    "uniform4i",
+    "uniform4iv",
+    "uniform4ui",
+    "uniform4uiv",
+    "uniformBlockBinding",
+    "uniformMatrix2fv",
+    "uniformMatrix2x3fv",
+    "uniformMatrix2x4fv",
+    "uniformMatrix3fv",
+    "uniformMatrix3x2fv",
+    "uniformMatrix3x4fv",
+    "uniformMatrix4fv",
+    "uniformMatrix4x2fv",
+    "uniformMatrix4x3fv",
+    "unique",
+    "uniqueID",
+    "uniqueNumber",
+    "unit",
+    "unitType",
+    "units",
+    "unloadEventEnd",
+    "unloadEventStart",
+    "unlock",
+    "unmount",
+    "unobserve",
+    "unpause",
+    "unpauseAnimations",
+    "unreadCount",
+    "unregister",
+    "unregisterContentHandler",
+    "unregisterProtocolHandler",
+    "unscopables",
+    "unselectable",
+    "unshift",
+    "unsubscribe",
+    "unsuspendRedraw",
+    "unsuspendRedrawAll",
+    "unwatch",
+    "unwrapKey",
+    "upDegrees",
+    "upX",
+    "upY",
+    "upZ",
+    "update",
+    "updateCommands",
+    "updateIce",
+    "updateInterval",
+    "updatePlaybackRate",
+    "updateRenderState",
+    "updateSettings",
+    "updateTiming",
+    "updateViaCache",
+    "updateWith",
+    "updated",
+    "updating",
+    "upgrade",
+    "upload",
+    "uploadTotal",
+    "uploaded",
+    "upper",
+    "upperBound",
+    "upperOpen",
+    "uri",
+    "url",
+    "urn",
+    "urns",
+    "usages",
+    "usb",
+    "usbVersionMajor",
+    "usbVersionMinor",
+    "usbVersionSubminor",
+    "useCurrentView",
+    "useMap",
+    "useProgram",
+    "usedSpace",
+    "user-select",
+    "userActivation",
+    "userAgent",
+    "userChoice",
+    "userHandle",
+    "userHint",
+    "userLanguage",
+    "userSelect",
+    "userVisibleOnly",
+    "username",
+    "usernameFragment",
+    "utterance",
+    "uuid",
+    "v8BreakIterator",
+    "vAlign",
+    "vLink",
+    "valid",
+    "validate",
+    "validateProgram",
+    "validationMessage",
+    "validity",
+    "value",
+    "valueAsDate",
+    "valueAsNumber",
+    "valueAsString",
+    "valueInSpecifiedUnits",
+    "valueMissing",
+    "valueOf",
+    "valueText",
+    "valueType",
+    "values",
+    "variable",
+    "variant",
+    "variationSettings",
+    "vector-effect",
+    "vectorEffect",
+    "velocityAngular",
+    "velocityExpansion",
+    "velocityX",
+    "velocityY",
+    "vendor",
+    "vendorId",
+    "vendorSub",
+    "verify",
+    "version",
+    "vertexAttrib1f",
+    "vertexAttrib1fv",
+    "vertexAttrib2f",
+    "vertexAttrib2fv",
+    "vertexAttrib3f",
+    "vertexAttrib3fv",
+    "vertexAttrib4f",
+    "vertexAttrib4fv",
+    "vertexAttribDivisor",
+    "vertexAttribDivisorANGLE",
+    "vertexAttribI4i",
+    "vertexAttribI4iv",
+    "vertexAttribI4ui",
+    "vertexAttribI4uiv",
+    "vertexAttribIPointer",
+    "vertexAttribPointer",
+    "vertical",
+    "vertical-align",
+    "verticalAlign",
+    "verticalOverflow",
+    "vh",
+    "vibrate",
+    "vibrationActuator",
+    "videoBitsPerSecond",
+    "videoHeight",
+    "videoTracks",
+    "videoWidth",
+    "view",
+    "viewBox",
+    "viewBoxString",
+    "viewTarget",
+    "viewTargetString",
+    "viewport",
+    "viewportAnchorX",
+    "viewportAnchorY",
+    "viewportElement",
+    "views",
+    "violatedDirective",
+    "visibility",
+    "visibilityState",
+    "visible",
+    "visualViewport",
+    "vlinkColor",
+    "vmax",
+    "vmin",
+    "voice",
+    "voiceURI",
+    "volume",
+    "vrml",
+    "vspace",
+    "vw",
+    "w",
+    "wait",
+    "waitSync",
+    "waiting",
+    "wake",
+    "wakeLock",
+    "wand",
+    "warn",
+    "wasClean",
+    "wasDiscarded",
+    "watch",
+    "watchAvailability",
+    "watchPosition",
+    "webdriver",
+    "webkitAddKey",
+    "webkitAlignContent",
+    "webkitAlignItems",
+    "webkitAlignSelf",
+    "webkitAnimation",
+    "webkitAnimationDelay",
+    "webkitAnimationDirection",
+    "webkitAnimationDuration",
+    "webkitAnimationFillMode",
+    "webkitAnimationIterationCount",
+    "webkitAnimationName",
+    "webkitAnimationPlayState",
+    "webkitAnimationTimingFunction",
+    "webkitAppearance",
+    "webkitAudioContext",
+    "webkitAudioDecodedByteCount",
+    "webkitAudioPannerNode",
+    "webkitBackfaceVisibility",
+    "webkitBackground",
+    "webkitBackgroundAttachment",
+    "webkitBackgroundClip",
+    "webkitBackgroundColor",
+    "webkitBackgroundImage",
+    "webkitBackgroundOrigin",
+    "webkitBackgroundPosition",
+    "webkitBackgroundPositionX",
+    "webkitBackgroundPositionY",
+    "webkitBackgroundRepeat",
+    "webkitBackgroundSize",
+    "webkitBackingStorePixelRatio",
+    "webkitBorderBottomLeftRadius",
+    "webkitBorderBottomRightRadius",
+    "webkitBorderImage",
+    "webkitBorderImageOutset",
+    "webkitBorderImageRepeat",
+    "webkitBorderImageSlice",
+    "webkitBorderImageSource",
+    "webkitBorderImageWidth",
+    "webkitBorderRadius",
+    "webkitBorderTopLeftRadius",
+    "webkitBorderTopRightRadius",
+    "webkitBoxAlign",
+    "webkitBoxDirection",
+    "webkitBoxFlex",
+    "webkitBoxOrdinalGroup",
+    "webkitBoxOrient",
+    "webkitBoxPack",
+    "webkitBoxShadow",
+    "webkitBoxSizing",
+    "webkitCancelAnimationFrame",
+    "webkitCancelFullScreen",
+    "webkitCancelKeyRequest",
+    "webkitCancelRequestAnimationFrame",
+    "webkitClearResourceTimings",
+    "webkitClosedCaptionsVisible",
+    "webkitConvertPointFromNodeToPage",
+    "webkitConvertPointFromPageToNode",
+    "webkitCreateShadowRoot",
+    "webkitCurrentFullScreenElement",
+    "webkitCurrentPlaybackTargetIsWireless",
+    "webkitDecodedFrameCount",
+    "webkitDirectionInvertedFromDevice",
+    "webkitDisplayingFullscreen",
+    "webkitDroppedFrameCount",
+    "webkitEnterFullScreen",
+    "webkitEnterFullscreen",
+    "webkitEntries",
+    "webkitExitFullScreen",
+    "webkitExitFullscreen",
+    "webkitExitPointerLock",
+    "webkitFilter",
+    "webkitFlex",
+    "webkitFlexBasis",
+    "webkitFlexDirection",
+    "webkitFlexFlow",
+    "webkitFlexGrow",
+    "webkitFlexShrink",
+    "webkitFlexWrap",
+    "webkitFullScreenKeyboardInputAllowed",
+    "webkitFullscreenElement",
+    "webkitFullscreenEnabled",
+    "webkitGenerateKeyRequest",
+    "webkitGetAsEntry",
+    "webkitGetDatabaseNames",
+    "webkitGetEntries",
+    "webkitGetEntriesByName",
+    "webkitGetEntriesByType",
+    "webkitGetFlowByName",
+    "webkitGetGamepads",
+    "webkitGetImageDataHD",
+    "webkitGetNamedFlows",
+    "webkitGetRegionFlowRanges",
+    "webkitGetUserMedia",
+    "webkitHasClosedCaptions",
+    "webkitHidden",
+    "webkitIDBCursor",
+    "webkitIDBDatabase",
+    "webkitIDBDatabaseError",
+    "webkitIDBDatabaseException",
+    "webkitIDBFactory",
+    "webkitIDBIndex",
+    "webkitIDBKeyRange",
+    "webkitIDBObjectStore",
+    "webkitIDBRequest",
+    "webkitIDBTransaction",
+    "webkitImageSmoothingEnabled",
+    "webkitIndexedDB",
+    "webkitInitMessageEvent",
+    "webkitIsFullScreen",
+    "webkitJustifyContent",
+    "webkitKeys",
+    "webkitLineClamp",
+    "webkitLineDashOffset",
+    "webkitLockOrientation",
+    "webkitMask",
+    "webkitMaskClip",
+    "webkitMaskComposite",
+    "webkitMaskImage",
+    "webkitMaskOrigin",
+    "webkitMaskPosition",
+    "webkitMaskPositionX",
+    "webkitMaskPositionY",
+    "webkitMaskRepeat",
+    "webkitMaskSize",
+    "webkitMatchesSelector",
+    "webkitMediaStream",
+    "webkitNotifications",
+    "webkitOfflineAudioContext",
+    "webkitOrder",
+    "webkitOrientation",
+    "webkitPeerConnection00",
+    "webkitPersistentStorage",
+    "webkitPerspective",
+    "webkitPerspectiveOrigin",
+    "webkitPointerLockElement",
+    "webkitPostMessage",
+    "webkitPreservesPitch",
+    "webkitPutImageDataHD",
+    "webkitRTCPeerConnection",
+    "webkitRegionOverset",
+    "webkitRelativePath",
+    "webkitRequestAnimationFrame",
+    "webkitRequestFileSystem",
+    "webkitRequestFullScreen",
+    "webkitRequestFullscreen",
+    "webkitRequestPointerLock",
+    "webkitResolveLocalFileSystemURL",
+    "webkitSetMediaKeys",
+    "webkitSetResourceTimingBufferSize",
+    "webkitShadowRoot",
+    "webkitShowPlaybackTargetPicker",
+    "webkitSlice",
+    "webkitSpeechGrammar",
+    "webkitSpeechGrammarList",
+    "webkitSpeechRecognition",
+    "webkitSpeechRecognitionError",
+    "webkitSpeechRecognitionEvent",
+    "webkitStorageInfo",
+    "webkitSupportsFullscreen",
+    "webkitTemporaryStorage",
+    "webkitTextFillColor",
+    "webkitTextSizeAdjust",
+    "webkitTextStroke",
+    "webkitTextStrokeColor",
+    "webkitTextStrokeWidth",
+    "webkitTransform",
+    "webkitTransformOrigin",
+    "webkitTransformStyle",
+    "webkitTransition",
+    "webkitTransitionDelay",
+    "webkitTransitionDuration",
+    "webkitTransitionProperty",
+    "webkitTransitionTimingFunction",
+    "webkitURL",
+    "webkitUnlockOrientation",
+    "webkitUserSelect",
+    "webkitVideoDecodedByteCount",
+    "webkitVisibilityState",
+    "webkitWirelessVideoPlaybackDisabled",
+    "webkitdirectory",
+    "webkitdropzone",
+    "webstore",
+    "weight",
+    "whatToShow",
+    "wheelDelta",
+    "wheelDeltaX",
+    "wheelDeltaY",
+    "whenDefined",
+    "which",
+    "white-space",
+    "whiteSpace",
+    "wholeText",
+    "widows",
+    "width",
+    "will-change",
+    "willChange",
+    "willValidate",
+    "window",
+    "withCredentials",
+    "word-break",
+    "word-spacing",
+    "word-wrap",
+    "wordBreak",
+    "wordSpacing",
+    "wordWrap",
+    "workerStart",
+    "wrap",
+    "wrapKey",
+    "writable",
+    "writableAuxiliaries",
+    "write",
+    "writeText",
+    "writeValue",
+    "writeWithoutResponse",
+    "writeln",
+    "writing-mode",
+    "writingMode",
+    "x",
+    "x1",
+    "x2",
+    "xChannelSelector",
+    "xmlEncoding",
+    "xmlStandalone",
+    "xmlVersion",
+    "xmlbase",
+    "xmllang",
+    "xmlspace",
+    "xor",
+    "xr",
+    "y",
+    "y1",
+    "y2",
+    "yChannelSelector",
+    "yandex",
+    "z",
+    "z-index",
+    "zIndex",
+    "zoom",
+    "zoomAndPan",
+    "zoomRectScreen",
+];
+
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+function find_builtins(reserved) {
+    domprops.forEach(add);
+
+    // Compatibility fix for some standard defined globals not defined on every js environment
+    var new_globals = ["Symbol", "Map", "Promise", "Proxy", "Reflect", "Set", "WeakMap", "WeakSet"];
+    var objects = {};
+    var global_ref = typeof global === "object" ? global : self;
+
+    new_globals.forEach(function (new_global) {
+        objects[new_global] = global_ref[new_global] || new Function();
+    });
+
+    [
+        "null",
+        "true",
+        "false",
+        "NaN",
+        "Infinity",
+        "-Infinity",
+        "undefined",
+    ].forEach(add);
+    [ Object, Array, Function, Number,
+      String, Boolean, Error, Math,
+      Date, RegExp, objects.Symbol, ArrayBuffer,
+      DataView, decodeURI, decodeURIComponent,
+      encodeURI, encodeURIComponent, eval, EvalError,
+      Float32Array, Float64Array, Int8Array, Int16Array,
+      Int32Array, isFinite, isNaN, JSON, objects.Map, parseFloat,
+      parseInt, objects.Promise, objects.Proxy, RangeError, ReferenceError,
+      objects.Reflect, objects.Set, SyntaxError, TypeError, Uint8Array,
+      Uint8ClampedArray, Uint16Array, Uint32Array, URIError,
+      objects.WeakMap, objects.WeakSet
+    ].forEach(function(ctor) {
+        Object.getOwnPropertyNames(ctor).map(add);
+        if (ctor.prototype) {
+            Object.getOwnPropertyNames(ctor.prototype).map(add);
+        }
+    });
+    function add(name) {
+        reserved.add(name);
+    }
+}
+
+function reserve_quoted_keys(ast, reserved) {
+    function add(name) {
+        push_uniq(reserved, name);
+    }
+
+    ast.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_ObjectKeyVal && node.quote) {
+            add(node.key);
+        } else if (node instanceof AST_ObjectProperty && node.quote) {
+            add(node.key.name);
+        } else if (node instanceof AST_Sub) {
+            addStrings(node.property, add);
+        }
+    }));
+}
+
+function addStrings(node, add) {
+    node.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_Sequence) {
+            addStrings(node.tail_node(), add);
+        } else if (node instanceof AST_String) {
+            add(node.value);
+        } else if (node instanceof AST_Conditional) {
+            addStrings(node.consequent, add);
+            addStrings(node.alternative, add);
+        }
+        return true;
+    }));
+}
+
+function mangle_private_properties(ast, options) {
+    var cprivate = -1;
+    var private_cache = new Map();
+    var nth_identifier = options.nth_identifier || base54;
+
+    ast =  ast.transform(new TreeTransformer(function(node) {
+        if (
+            node instanceof AST_ClassPrivateProperty
+            || node instanceof AST_PrivateMethod
+            || node instanceof AST_PrivateGetter
+            || node instanceof AST_PrivateSetter
+        ) {
+            node.key.name = mangle_private(node.key.name);
+        } else if (node instanceof AST_DotHash) {
+            node.property = mangle_private(node.property);
+        }
+    }));
+    return ast;
+
+    function mangle_private(name) {
+        let mangled = private_cache.get(name);
+        if (!mangled) {
+            mangled = nth_identifier.get(++cprivate);
+            private_cache.set(name, mangled);
+        }
+
+        return mangled;
+    }
+}
+
+function mangle_properties(ast, options) {
+    options = defaults(options, {
+        builtins: false,
+        cache: null,
+        debug: false,
+        keep_quoted: false,
+        nth_identifier: base54,
+        only_cache: false,
+        regex: null,
+        reserved: null,
+        undeclared: false,
+    }, true);
+
+    var nth_identifier = options.nth_identifier;
+
+    var reserved_option = options.reserved;
+    if (!Array.isArray(reserved_option)) reserved_option = [reserved_option];
+    var reserved = new Set(reserved_option);
+    if (!options.builtins) find_builtins(reserved);
+
+    var cname = -1;
+
+    var cache;
+    if (options.cache) {
+        cache = options.cache.props;
+    } else {
+        cache = new Map();
+    }
+
+    var regex = options.regex && new RegExp(options.regex);
+
+    // note debug is either false (disabled), or a string of the debug suffix to use (enabled).
+    // note debug may be enabled as an empty string, which is falsey. Also treat passing 'true'
+    // the same as passing an empty string.
+    var debug = options.debug !== false;
+    var debug_name_suffix;
+    if (debug) {
+        debug_name_suffix = (options.debug === true ? "" : options.debug);
+    }
+
+    var names_to_mangle = new Set();
+    var unmangleable = new Set();
+    // Track each already-mangled name to prevent nth_identifier from generating
+    // the same name.
+    cache.forEach((mangled_name) => unmangleable.add(mangled_name));
+
+    var keep_quoted = !!options.keep_quoted;
+
+    // step 1: find candidates to mangle
+    ast.walk(new TreeWalker(function(node) {
+        if (
+            node instanceof AST_ClassPrivateProperty
+            || node instanceof AST_PrivateMethod
+            || node instanceof AST_PrivateGetter
+            || node instanceof AST_PrivateSetter
+            || node instanceof AST_DotHash
+        ) ; else if (node instanceof AST_ObjectKeyVal) {
+            if (typeof node.key == "string" && (!keep_quoted || !node.quote)) {
+                add(node.key);
+            }
+        } else if (node instanceof AST_ObjectProperty) {
+            // setter or getter, since KeyVal is handled above
+            if (!keep_quoted || !node.quote) {
+                add(node.key.name);
+            }
+        } else if (node instanceof AST_Dot) {
+            var declared = !!options.undeclared;
+            if (!declared) {
+                var root = node;
+                while (root.expression) {
+                    root = root.expression;
+                }
+                declared = !(root.thedef && root.thedef.undeclared);
+            }
+            if (declared &&
+                (!keep_quoted || !node.quote)) {
+                add(node.property);
+            }
+        } else if (node instanceof AST_Sub) {
+            if (!keep_quoted) {
+                addStrings(node.property, add);
+            }
+        } else if (node instanceof AST_Call
+            && node.expression.print_to_string() == "Object.defineProperty") {
+            addStrings(node.args[1], add);
+        } else if (node instanceof AST_Binary && node.operator === "in") {
+            addStrings(node.left, add);
+        }
+    }));
+
+    // step 2: transform the tree, renaming properties
+    return ast.transform(new TreeTransformer(function(node) {
+        if (
+            node instanceof AST_ClassPrivateProperty
+            || node instanceof AST_PrivateMethod
+            || node instanceof AST_PrivateGetter
+            || node instanceof AST_PrivateSetter
+            || node instanceof AST_DotHash
+        ) ; else if (node instanceof AST_ObjectKeyVal) {
+            if (typeof node.key == "string" && (!keep_quoted || !node.quote)) {
+                node.key = mangle(node.key);
+            }
+        } else if (node instanceof AST_ObjectProperty) {
+            // setter, getter, method or class field
+            if (!keep_quoted || !node.quote) {
+                node.key.name = mangle(node.key.name);
+            }
+        } else if (node instanceof AST_Dot) {
+            if (!keep_quoted || !node.quote) {
+                node.property = mangle(node.property);
+            }
+        } else if (!keep_quoted && node instanceof AST_Sub) {
+            node.property = mangleStrings(node.property);
+        } else if (node instanceof AST_Call
+            && node.expression.print_to_string() == "Object.defineProperty") {
+            node.args[1] = mangleStrings(node.args[1]);
+        } else if (node instanceof AST_Binary && node.operator === "in") {
+            node.left = mangleStrings(node.left);
+        }
+    }));
+
+    // only function declarations after this line
+
+    function can_mangle(name) {
+        if (unmangleable.has(name)) return false;
+        if (reserved.has(name)) return false;
+        if (options.only_cache) {
+            return cache.has(name);
+        }
+        if (/^-?[0-9]+(\.[0-9]+)?(e[+-][0-9]+)?$/.test(name)) return false;
+        return true;
+    }
+
+    function should_mangle(name) {
+        if (regex && !regex.test(name)) return false;
+        if (reserved.has(name)) return false;
+        return cache.has(name)
+            || names_to_mangle.has(name);
+    }
+
+    function add(name) {
+        if (can_mangle(name))
+            names_to_mangle.add(name);
+
+        if (!should_mangle(name)) {
+            unmangleable.add(name);
+        }
+    }
+
+    function mangle(name) {
+        if (!should_mangle(name)) {
+            return name;
+        }
+
+        var mangled = cache.get(name);
+        if (!mangled) {
+            if (debug) {
+                // debug mode: use a prefix and suffix to preserve readability, e.g. o.foo -> o._$foo$NNN_.
+                var debug_mangled = "_$" + name + "$" + debug_name_suffix + "_";
+
+                if (can_mangle(debug_mangled)) {
+                    mangled = debug_mangled;
+                }
+            }
+
+            // either debug mode is off, or it is on and we could not use the mangled name
+            if (!mangled) {
+                do {
+                    mangled = nth_identifier.get(++cname);
+                } while (!can_mangle(mangled));
+            }
+
+            cache.set(name, mangled);
+        }
+        return mangled;
+    }
+
+    function mangleStrings(node) {
+        return node.transform(new TreeTransformer(function(node) {
+            if (node instanceof AST_Sequence) {
+                var last = node.expressions.length - 1;
+                node.expressions[last] = mangleStrings(node.expressions[last]);
+            } else if (node instanceof AST_String) {
+                node.value = mangle(node.value);
+            } else if (node instanceof AST_Conditional) {
+                node.consequent = mangleStrings(node.consequent);
+                node.alternative = mangleStrings(node.alternative);
+            }
+            return node;
+        }));
+    }
+}
+
+var to_ascii = typeof atob == "undefined" ? function(b64) {
+    return Buffer.from(b64, "base64").toString();
+} : atob;
+var to_base64 = typeof btoa == "undefined" ? function(str) {
+    return Buffer.from(str).toString("base64");
+} : btoa;
+
+function read_source_map(code) {
+    var match = /(?:^|[^.])\/\/# sourceMappingURL=data:application\/json(;[\w=-]*)?;base64,([+/0-9A-Za-z]*=*)\s*$/.exec(code);
+    if (!match) {
+        console.warn("inline source map not found");
+        return null;
+    }
+    return to_ascii(match[2]);
+}
+
+function set_shorthand(name, options, keys) {
+    if (options[name]) {
+        keys.forEach(function(key) {
+            if (options[key]) {
+                if (typeof options[key] != "object") options[key] = {};
+                if (!(name in options[key])) options[key][name] = options[name];
+            }
+        });
+    }
+}
+
+function init_cache(cache) {
+    if (!cache) return;
+    if (!("props" in cache)) {
+        cache.props = new Map();
+    } else if (!(cache.props instanceof Map)) {
+        cache.props = map_from_object(cache.props);
+    }
+}
+
+function cache_to_json(cache) {
+    return {
+        props: map_to_object(cache.props)
+    };
+}
+
+function log_input(files, options, fs, debug_folder) {
+    if (!(fs && fs.writeFileSync && fs.mkdirSync)) {
+        return;
+    }
+
+    try {
+        fs.mkdirSync(debug_folder);
+    } catch (e) {
+        if (e.code !== "EEXIST") throw e;
+    }
+
+    const log_path = `${debug_folder}/terser-debug-${(Math.random() * 9999999) | 0}.log`;
+
+    options = options || {};
+
+    const options_str = JSON.stringify(options, (_key, thing) => {
+        if (typeof thing === "function") return "[Function " + thing.toString() + "]";
+        if (thing instanceof RegExp) return "[RegExp " + thing.toString() + "]";
+        return thing;
+    }, 4);
+
+    const files_str = (file) => {
+        if (typeof file === "object" && options.parse && options.parse.spidermonkey) {
+            return JSON.stringify(file, null, 2);
+        } else if (typeof file === "object") {
+            return Object.keys(file)
+                .map((key) => key + ": " + files_str(file[key]))
+                .join("\n\n");
+        } else if (typeof file === "string") {
+            return "```\n" + file + "\n```";
+        } else {
+            return file; // What do?
+        }
+    };
+
+    fs.writeFileSync(log_path, "Options: \n" + options_str + "\n\nInput files:\n\n" + files_str(files) + "\n");
+}
+
+async function minify(files, options, _fs_module) {
+    if (
+        _fs_module
+        && typeof process === "object"
+        && process.env
+        && typeof process.env.TERSER_DEBUG_DIR === "string"
+    ) {
+        log_input(files, options, _fs_module, process.env.TERSER_DEBUG_DIR);
+    }
+
+    options = defaults(options, {
+        compress: {},
+        ecma: undefined,
+        enclose: false,
+        ie8: false,
+        keep_classnames: undefined,
+        keep_fnames: false,
+        mangle: {},
+        module: false,
+        nameCache: null,
+        output: null,
+        format: null,
+        parse: {},
+        rename: undefined,
+        safari10: false,
+        sourceMap: false,
+        spidermonkey: false,
+        timings: false,
+        toplevel: false,
+        warnings: false,
+        wrap: false,
+    }, true);
+
+    var timings = options.timings && {
+        start: Date.now()
+    };
+    if (options.keep_classnames === undefined) {
+        options.keep_classnames = options.keep_fnames;
+    }
+    if (options.rename === undefined) {
+        options.rename = options.compress && options.mangle;
+    }
+    if (options.output && options.format) {
+        throw new Error("Please only specify either output or format option, preferrably format.");
+    }
+    options.format = options.format || options.output || {};
+    set_shorthand("ecma", options, [ "parse", "compress", "format" ]);
+    set_shorthand("ie8", options, [ "compress", "mangle", "format" ]);
+    set_shorthand("keep_classnames", options, [ "compress", "mangle" ]);
+    set_shorthand("keep_fnames", options, [ "compress", "mangle" ]);
+    set_shorthand("module", options, [ "parse", "compress", "mangle" ]);
+    set_shorthand("safari10", options, [ "mangle", "format" ]);
+    set_shorthand("toplevel", options, [ "compress", "mangle" ]);
+    set_shorthand("warnings", options, [ "compress" ]); // legacy
+    var quoted_props;
+    if (options.mangle) {
+        options.mangle = defaults(options.mangle, {
+            cache: options.nameCache && (options.nameCache.vars || {}),
+            eval: false,
+            ie8: false,
+            keep_classnames: false,
+            keep_fnames: false,
+            module: false,
+            nth_identifier: base54,
+            properties: false,
+            reserved: [],
+            safari10: false,
+            toplevel: false,
+        }, true);
+        if (options.mangle.properties) {
+            if (typeof options.mangle.properties != "object") {
+                options.mangle.properties = {};
+            }
+            if (options.mangle.properties.keep_quoted) {
+                quoted_props = options.mangle.properties.reserved;
+                if (!Array.isArray(quoted_props)) quoted_props = [];
+                options.mangle.properties.reserved = quoted_props;
+            }
+            if (options.nameCache && !("cache" in options.mangle.properties)) {
+                options.mangle.properties.cache = options.nameCache.props || {};
+            }
+        }
+        init_cache(options.mangle.cache);
+        init_cache(options.mangle.properties.cache);
+    }
+    if (options.sourceMap) {
+        options.sourceMap = defaults(options.sourceMap, {
+            asObject: false,
+            content: null,
+            filename: null,
+            includeSources: false,
+            root: null,
+            url: null,
+        }, true);
+    }
+    if (timings) timings.parse = Date.now();
+    var toplevel;
+    if (files instanceof AST_Toplevel) {
+        toplevel = files;
+    } else {
+        if (typeof files == "string" || (options.parse.spidermonkey && !Array.isArray(files))) {
+            files = [ files ];
+        }
+        options.parse = options.parse || {};
+        options.parse.toplevel = null;
+
+        if (options.parse.spidermonkey) {
+            options.parse.toplevel = AST_Node.from_mozilla_ast(Object.keys(files).reduce(function(toplevel, name) {
+                if (!toplevel) return files[name];
+                toplevel.body = toplevel.body.concat(files[name].body);
+                return toplevel;
+            }, null));
+        } else {
+            delete options.parse.spidermonkey;
+
+            for (var name in files) if (HOP(files, name)) {
+                options.parse.filename = name;
+                options.parse.toplevel = parse(files[name], options.parse);
+                if (options.sourceMap && options.sourceMap.content == "inline") {
+                    if (Object.keys(files).length > 1)
+                        throw new Error("inline source map only works with singular input");
+                    options.sourceMap.content = read_source_map(files[name]);
+                }
+            }
+        }
+
+        toplevel = options.parse.toplevel;
+    }
+    if (quoted_props && options.mangle.properties.keep_quoted !== "strict") {
+        reserve_quoted_keys(toplevel, quoted_props);
+    }
+    if (options.wrap) {
+        toplevel = toplevel.wrap_commonjs(options.wrap);
+    }
+    if (options.enclose) {
+        toplevel = toplevel.wrap_enclose(options.enclose);
+    }
+    if (timings) timings.rename = Date.now();
+    if (timings) timings.compress = Date.now();
+    if (options.compress) {
+        toplevel = new Compressor(options.compress, {
+            mangle_options: options.mangle
+        }).compress(toplevel);
+    }
+    if (timings) timings.scope = Date.now();
+    if (options.mangle) toplevel.figure_out_scope(options.mangle);
+    if (timings) timings.mangle = Date.now();
+    if (options.mangle) {
+        toplevel.compute_char_frequency(options.mangle);
+        toplevel.mangle_names(options.mangle);
+        toplevel = mangle_private_properties(toplevel, options.mangle);
+    }
+    if (timings) timings.properties = Date.now();
+    if (options.mangle && options.mangle.properties) {
+        toplevel = mangle_properties(toplevel, options.mangle.properties);
+    }
+    if (timings) timings.format = Date.now();
+    var result = {};
+    if (options.format.ast) {
+        result.ast = toplevel;
+    }
+    if (options.format.spidermonkey) {
+        result.ast = toplevel.to_mozilla_ast();
+    }
+    if (!HOP(options.format, "code") || options.format.code) {
+        if (options.sourceMap) {
+            options.format.source_map = await SourceMap({
+                file: options.sourceMap.filename,
+                orig: options.sourceMap.content,
+                root: options.sourceMap.root
+            });
+            if (options.sourceMap.includeSources) {
+                if (files instanceof AST_Toplevel) {
+                    throw new Error("original source content unavailable");
+                } else for (var name in files) if (HOP(files, name)) {
+                    options.format.source_map.get().setSourceContent(name, files[name]);
+                }
+            }
+        }
+        delete options.format.ast;
+        delete options.format.code;
+        delete options.format.spidermonkey;
+        var stream = OutputStream(options.format);
+        toplevel.print(stream);
+        result.code = stream.get();
+        if (options.sourceMap) {
+            if(options.sourceMap.asObject) {
+                result.map = options.format.source_map.get().toJSON();
+            } else {
+                result.map = options.format.source_map.toString();
+            }
+            if (options.sourceMap.url == "inline") {
+                var sourceMap = typeof result.map === "object" ? JSON.stringify(result.map) : result.map;
+                result.code += "\n//# sourceMappingURL=data:application/json;charset=utf-8;base64," + to_base64(sourceMap);
+            } else if (options.sourceMap.url) {
+                result.code += "\n//# sourceMappingURL=" + options.sourceMap.url;
+            }
+        }
+    }
+    if (options.nameCache && options.mangle) {
+        if (options.mangle.cache) options.nameCache.vars = cache_to_json(options.mangle.cache);
+        if (options.mangle.properties && options.mangle.properties.cache) {
+            options.nameCache.props = cache_to_json(options.mangle.properties.cache);
+        }
+    }
+    if (options.format && options.format.source_map) {
+        options.format.source_map.destroy();
+    }
+    if (timings) {
+        timings.end = Date.now();
+        result.timings = {
+            parse: 1e-3 * (timings.rename - timings.parse),
+            rename: 1e-3 * (timings.compress - timings.rename),
+            compress: 1e-3 * (timings.scope - timings.compress),
+            scope: 1e-3 * (timings.mangle - timings.scope),
+            mangle: 1e-3 * (timings.properties - timings.mangle),
+            properties: 1e-3 * (timings.format - timings.properties),
+            format: 1e-3 * (timings.end - timings.format),
+            total: 1e-3 * (timings.end - timings.start)
+        };
+    }
+    return result;
+}
+
+async function run_cli({ program, packageJson, fs, path }) {
+    const skip_keys = new Set([ "cname", "parent_scope", "scope", "uses_eval", "uses_with" ]);
+    var files = {};
+    var options = {
+        compress: false,
+        mangle: false
+    };
+    const default_options = await _default_options();
+    program.version(packageJson.name + " " + packageJson.version);
+    program.parseArgv = program.parse;
+    program.parse = undefined;
+
+    if (process.argv.includes("ast")) program.helpInformation = describe_ast;
+    else if (process.argv.includes("options")) program.helpInformation = function() {
+        var text = [];
+        for (var option in default_options) {
+            text.push("--" + (option === "sourceMap" ? "source-map" : option) + " options:");
+            text.push(format_object(default_options[option]));
+            text.push("");
+        }
+        return text.join("\n");
+    };
+
+    program.option("-p, --parse <options>", "Specify parser options.", parse_js());
+    program.option("-c, --compress [options]", "Enable compressor/specify compressor options.", parse_js());
+    program.option("-m, --mangle [options]", "Mangle names/specify mangler options.", parse_js());
+    program.option("--mangle-props [options]", "Mangle properties/specify mangler options.", parse_js());
+    program.option("-f, --format [options]", "Format options.", parse_js());
+    program.option("-b, --beautify [options]", "Alias for --format.", parse_js());
+    program.option("-o, --output <file>", "Output file (default STDOUT).");
+    program.option("--comments [filter]", "Preserve copyright comments in the output.");
+    program.option("--config-file <file>", "Read minify() options from JSON file.");
+    program.option("-d, --define <expr>[=value]", "Global definitions.", parse_js("define"));
+    program.option("--ecma <version>", "Specify ECMAScript release: 5, 2015, 2016 or 2017...");
+    program.option("-e, --enclose [arg[,...][:value[,...]]]", "Embed output in a big function with configurable arguments and values.");
+    program.option("--ie8", "Support non-standard Internet Explorer 8.");
+    program.option("--keep-classnames", "Do not mangle/drop class names.");
+    program.option("--keep-fnames", "Do not mangle/drop function names. Useful for code relying on Function.prototype.name.");
+    program.option("--module", "Input is an ES6 module");
+    program.option("--name-cache <file>", "File to hold mangled name mappings.");
+    program.option("--rename", "Force symbol expansion.");
+    program.option("--no-rename", "Disable symbol expansion.");
+    program.option("--safari10", "Support non-standard Safari 10.");
+    program.option("--source-map [options]", "Enable source map/specify source map options.", parse_js());
+    program.option("--timings", "Display operations run time on STDERR.");
+    program.option("--toplevel", "Compress and/or mangle variables in toplevel scope.");
+    program.option("--wrap <name>", "Embed everything as a function with “exports” corresponding to “name” globally.");
+    program.arguments("[files...]").parseArgv(process.argv);
+    if (program.configFile) {
+        options = JSON.parse(read_file(program.configFile));
+    }
+    if (!program.output && program.sourceMap && program.sourceMap.url != "inline") {
+        fatal("ERROR: cannot write source map to STDOUT");
+    }
+
+    [
+        "compress",
+        "enclose",
+        "ie8",
+        "mangle",
+        "module",
+        "safari10",
+        "sourceMap",
+        "toplevel",
+        "wrap"
+    ].forEach(function(name) {
+        if (name in program) {
+            options[name] = program[name];
+        }
+    });
+
+    if ("ecma" in program) {
+        if (program.ecma != (program.ecma | 0)) fatal("ERROR: ecma must be an integer");
+        const ecma = program.ecma | 0;
+        if (ecma > 5 && ecma < 2015)
+            options.ecma = ecma + 2009;
+        else
+            options.ecma = ecma;
+    }
+    if (program.format || program.beautify) {
+        const chosenOption = program.format || program.beautify;
+        options.format = typeof chosenOption === "object" ? chosenOption : {};
+    }
+    if (program.comments) {
+        if (typeof options.format != "object") options.format = {};
+        options.format.comments = typeof program.comments == "string" ? (program.comments == "false" ? false : program.comments) : "some";
+    }
+    if (program.define) {
+        if (typeof options.compress != "object") options.compress = {};
+        if (typeof options.compress.global_defs != "object") options.compress.global_defs = {};
+        for (var expr in program.define) {
+            options.compress.global_defs[expr] = program.define[expr];
+        }
+    }
+    if (program.keepClassnames) {
+        options.keep_classnames = true;
+    }
+    if (program.keepFnames) {
+        options.keep_fnames = true;
+    }
+    if (program.mangleProps) {
+        if (program.mangleProps.domprops) {
+            delete program.mangleProps.domprops;
+        } else {
+            if (typeof program.mangleProps != "object") program.mangleProps = {};
+            if (!Array.isArray(program.mangleProps.reserved)) program.mangleProps.reserved = [];
+        }
+        if (typeof options.mangle != "object") options.mangle = {};
+        options.mangle.properties = program.mangleProps;
+    }
+    if (program.nameCache) {
+        options.nameCache = JSON.parse(read_file(program.nameCache, "{}"));
+    }
+    if (program.output == "ast") {
+        options.format = {
+            ast: true,
+            code: false
+        };
+    }
+    if (program.parse) {
+        if (!program.parse.acorn && !program.parse.spidermonkey) {
+            options.parse = program.parse;
+        } else if (program.sourceMap && program.sourceMap.content == "inline") {
+            fatal("ERROR: inline source map only works with built-in parser");
+        }
+    }
+    if (~program.rawArgs.indexOf("--rename")) {
+        options.rename = true;
+    } else if (!program.rename) {
+        options.rename = false;
+    }
+
+    let convert_path = name => name;
+    if (typeof program.sourceMap == "object" && "base" in program.sourceMap) {
+        convert_path = function() {
+            var base = program.sourceMap.base;
+            delete options.sourceMap.base;
+            return function(name) {
+                return path.relative(base, name);
+            };
+        }();
+    }
+
+    let filesList;
+    if (options.files && options.files.length) {
+        filesList = options.files;
+
+        delete options.files;
+    } else if (program.args.length) {
+        filesList = program.args;
+    }
+
+    if (filesList) {
+        simple_glob(filesList).forEach(function(name) {
+            files[convert_path(name)] = read_file(name);
+        });
+    } else {
+        await new Promise((resolve) => {
+            var chunks = [];
+            process.stdin.setEncoding("utf8");
+            process.stdin.on("data", function(chunk) {
+                chunks.push(chunk);
+            }).on("end", function() {
+                files = [ chunks.join("") ];
+                resolve();
+            });
+            process.stdin.resume();
+        });
+    }
+
+    await run_cli();
+
+    function convert_ast(fn) {
+        return AST_Node.from_mozilla_ast(Object.keys(files).reduce(fn, null));
+    }
+
+    async function run_cli() {
+        var content = program.sourceMap && program.sourceMap.content;
+        if (content && content !== "inline") {
+            options.sourceMap.content = read_file(content, content);
+        }
+        if (program.timings) options.timings = true;
+
+        try {
+            if (program.parse) {
+                if (program.parse.acorn) {
+                    files = convert_ast(function(toplevel, name) {
+                        return require("acorn").parse(files[name], {
+                            ecmaVersion: 2018,
+                            locations: true,
+                            program: toplevel,
+                            sourceFile: name,
+                            sourceType: options.module || program.parse.module ? "module" : "script"
+                        });
+                    });
+                } else if (program.parse.spidermonkey) {
+                    files = convert_ast(function(toplevel, name) {
+                        var obj = JSON.parse(files[name]);
+                        if (!toplevel) return obj;
+                        toplevel.body = toplevel.body.concat(obj.body);
+                        return toplevel;
+                    });
+                }
+            }
+        } catch (ex) {
+            fatal(ex);
+        }
+
+        let result;
+        try {
+            result = await minify(files, options, fs);
+        } catch (ex) {
+            if (ex.name == "SyntaxError") {
+                print_error("Parse error at " + ex.filename + ":" + ex.line + "," + ex.col);
+                var col = ex.col;
+                var lines = files[ex.filename].split(/\r?\n/);
+                var line = lines[ex.line - 1];
+                if (!line && !col) {
+                    line = lines[ex.line - 2];
+                    col = line.length;
+                }
+                if (line) {
+                    var limit = 70;
+                    if (col > limit) {
+                        line = line.slice(col - limit);
+                        col = limit;
+                    }
+                    print_error(line.slice(0, 80));
+                    print_error(line.slice(0, col).replace(/\S/g, " ") + "^");
+                }
+            }
+            if (ex.defs) {
+                print_error("Supported options:");
+                print_error(format_object(ex.defs));
+            }
+            fatal(ex);
+            return;
+        }
+
+        if (program.output == "ast") {
+            if (!options.compress && !options.mangle) {
+                result.ast.figure_out_scope({});
+            }
+            console.log(JSON.stringify(result.ast, function(key, value) {
+                if (value) switch (key) {
+                  case "thedef":
+                    return symdef(value);
+                  case "enclosed":
+                    return value.length ? value.map(symdef) : undefined;
+                  case "variables":
+                  case "globals":
+                    return value.size ? collect_from_map(value, symdef) : undefined;
+                }
+                if (skip_keys.has(key)) return;
+                if (value instanceof AST_Token) return;
+                if (value instanceof Map) return;
+                if (value instanceof AST_Node) {
+                    var result = {
+                        _class: "AST_" + value.TYPE
+                    };
+                    if (value.block_scope) {
+                        result.variables = value.block_scope.variables;
+                        result.enclosed = value.block_scope.enclosed;
+                    }
+                    value.CTOR.PROPS.forEach(function(prop) {
+                        result[prop] = value[prop];
+                    });
+                    return result;
+                }
+                return value;
+            }, 2));
+        } else if (program.output == "spidermonkey") {
+            try {
+                const minified = await minify(
+                    result.code,
+                    {
+                        compress: false,
+                        mangle: false,
+                        format: {
+                            ast: true,
+                            code: false
+                        }
+                    },
+                    fs
+                );
+                console.log(JSON.stringify(minified.ast.to_mozilla_ast(), null, 2));
+            } catch (ex) {
+                fatal(ex);
+                return;
+            }
+        } else if (program.output) {
+            fs.writeFileSync(program.output, result.code);
+            if (options.sourceMap && options.sourceMap.url !== "inline" && result.map) {
+                fs.writeFileSync(program.output + ".map", result.map);
+            }
+        } else {
+            console.log(result.code);
+        }
+        if (program.nameCache) {
+            fs.writeFileSync(program.nameCache, JSON.stringify(options.nameCache));
+        }
+        if (result.timings) for (var phase in result.timings) {
+            print_error("- " + phase + ": " + result.timings[phase].toFixed(3) + "s");
+        }
+    }
+
+    function fatal(message) {
+        if (message instanceof Error) message = message.stack.replace(/^\S*?Error:/, "ERROR:");
+        print_error(message);
+        process.exit(1);
+    }
+
+    // A file glob function that only supports "*" and "?" wildcards in the basename.
+    // Example: "foo/bar/*baz??.*.js"
+    // Argument `glob` may be a string or an array of strings.
+    // Returns an array of strings. Garbage in, garbage out.
+    function simple_glob(glob) {
+        if (Array.isArray(glob)) {
+            return [].concat.apply([], glob.map(simple_glob));
+        }
+        if (glob && glob.match(/[*?]/)) {
+            var dir = path.dirname(glob);
+            try {
+                var entries = fs.readdirSync(dir);
+            } catch (ex) {}
+            if (entries) {
+                var pattern = "^" + path.basename(glob)
+                    .replace(/[.+^$[\]\\(){}]/g, "\\$&")
+                    .replace(/\*/g, "[^/\\\\]*")
+                    .replace(/\?/g, "[^/\\\\]") + "$";
+                var mod = process.platform === "win32" ? "i" : "";
+                var rx = new RegExp(pattern, mod);
+                var results = entries.filter(function(name) {
+                    return rx.test(name);
+                }).map(function(name) {
+                    return path.join(dir, name);
+                });
+                if (results.length) return results;
+            }
+        }
+        return [ glob ];
+    }
+
+    function read_file(path, default_value) {
+        try {
+            return fs.readFileSync(path, "utf8");
+        } catch (ex) {
+            if ((ex.code == "ENOENT" || ex.code == "ENAMETOOLONG") && default_value != null) return default_value;
+            fatal(ex);
+        }
+    }
+
+    function parse_js(flag) {
+        return function(value, options) {
+            options = options || {};
+            try {
+                walk(parse(value, { expression: true }), node => {
+                    if (node instanceof AST_Assign) {
+                        var name = node.left.print_to_string();
+                        var value = node.right;
+                        if (flag) {
+                            options[name] = value;
+                        } else if (value instanceof AST_Array) {
+                            options[name] = value.elements.map(to_string);
+                        } else if (value instanceof AST_RegExp) {
+                            value = value.value;
+                            options[name] = new RegExp(value.source, value.flags);
+                        } else {
+                            options[name] = to_string(value);
+                        }
+                        return true;
+                    }
+                    if (node instanceof AST_Symbol || node instanceof AST_PropAccess) {
+                        var name = node.print_to_string();
+                        options[name] = true;
+                        return true;
+                    }
+                    if (!(node instanceof AST_Sequence)) throw node;
+
+                    function to_string(value) {
+                        return value instanceof AST_Constant ? value.getValue() : value.print_to_string({
+                            quote_keys: true
+                        });
+                    }
+                });
+            } catch(ex) {
+                if (flag) {
+                    fatal("Error parsing arguments for '" + flag + "': " + value);
+                } else {
+                    options[value] = null;
+                }
+            }
+            return options;
+        };
+    }
+
+    function symdef(def) {
+        var ret = (1e6 + def.id) + " " + def.name;
+        if (def.mangled_name) ret += " " + def.mangled_name;
+        return ret;
+    }
+
+    function collect_from_map(map, callback) {
+        var result = [];
+        map.forEach(function (def) {
+            result.push(callback(def));
+        });
+        return result;
+    }
+
+    function format_object(obj) {
+        var lines = [];
+        var padding = "";
+        Object.keys(obj).map(function(name) {
+            if (padding.length < name.length) padding = Array(name.length + 1).join(" ");
+            return [ name, JSON.stringify(obj[name]) ];
+        }).forEach(function(tokens) {
+            lines.push("  " + tokens[0] + padding.slice(tokens[0].length - 2) + tokens[1]);
+        });
+        return lines.join("\n");
+    }
+
+    function print_error(msg) {
+        process.stderr.write(msg);
+        process.stderr.write("\n");
+    }
+
+    function describe_ast() {
+        var out = OutputStream({ beautify: true });
+        function doitem(ctor) {
+            out.print("AST_" + ctor.TYPE);
+            const props = ctor.SELF_PROPS.filter(prop => !/^\$/.test(prop));
+
+            if (props.length > 0) {
+                out.space();
+                out.with_parens(function() {
+                    props.forEach(function(prop, i) {
+                        if (i) out.space();
+                        out.print(prop);
+                    });
+                });
+            }
+
+            if (ctor.documentation) {
+                out.space();
+                out.print_string(ctor.documentation);
+            }
+
+            if (ctor.SUBCLASSES.length > 0) {
+                out.space();
+                out.with_block(function() {
+                    ctor.SUBCLASSES.forEach(function(ctor) {
+                        out.indent();
+                        doitem(ctor);
+                        out.newline();
+                    });
+                });
+            }
+        }
+        doitem(AST_Node);
+        return out + "\n";
+    }
+}
+
+async function _default_options() {
+    const defs = {};
+
+    Object.keys(infer_options({ 0: 0 })).forEach((component) => {
+        const options = infer_options({
+            [component]: {0: 0}
+        });
+
+        if (options) defs[component] = options;
+    });
+    return defs;
+}
+
+async function infer_options(options) {
+    try {
+        await minify("", options);
+    } catch (error) {
+        return error.defs;
+    }
+}
+
+exports._default_options = _default_options;
+exports._run_cli = run_cli;
+exports.minify = minify;
+
+})));
diff --git a/node_modules/mathjs/examples/node_modules/terser/dist/package.json b/node_modules/mathjs/examples/node_modules/terser/dist/package.json
new file mode 100644
index 0000000..a4cb7d1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/dist/package.json
@@ -0,0 +1,10 @@
+{
+  "name": "dist",
+  "private": true,
+  "version": "1.0.0",
+  "main": "bundle.min.js",
+  "type": "commonjs",
+  "author": "",
+  "license": "BSD-2-Clause",
+  "description": "A package to hold the Terser dist bundle as commonjs while keeping the rest of it ESM. Nothing to see here."
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/ast.js b/node_modules/mathjs/examples/node_modules/terser/lib/ast.js
new file mode 100644
index 0000000..07f2b50
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/ast.js
@@ -0,0 +1,1858 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+    HOP,
+    MAP,
+    noop
+} from "./utils/index.js";
+import { parse } from "./parse.js";
+
+function DEFNODE(type, props, methods, base = AST_Node) {
+    if (!props) props = [];
+    else props = props.split(/\s+/);
+    var self_props = props;
+    if (base && base.PROPS)
+        props = props.concat(base.PROPS);
+    var code = "return function AST_" + type + "(props){ if (props) { ";
+    for (var i = props.length; --i >= 0;) {
+        code += "this." + props[i] + " = props." + props[i] + ";";
+    }
+    const proto = base && Object.create(base.prototype);
+    if (proto && proto.initialize || (methods && methods.initialize))
+        code += "this.initialize();";
+    code += "}";
+    code += "this.flags = 0;";
+    code += "}";
+    var ctor = new Function(code)();
+    if (proto) {
+        ctor.prototype = proto;
+        ctor.BASE = base;
+    }
+    if (base) base.SUBCLASSES.push(ctor);
+    ctor.prototype.CTOR = ctor;
+    ctor.prototype.constructor = ctor;
+    ctor.PROPS = props || null;
+    ctor.SELF_PROPS = self_props;
+    ctor.SUBCLASSES = [];
+    if (type) {
+        ctor.prototype.TYPE = ctor.TYPE = type;
+    }
+    if (methods) for (i in methods) if (HOP(methods, i)) {
+        if (i[0] === "$") {
+            ctor[i.substr(1)] = methods[i];
+        } else {
+            ctor.prototype[i] = methods[i];
+        }
+    }
+    ctor.DEFMETHOD = function(name, method) {
+        this.prototype[name] = method;
+    };
+    return ctor;
+}
+
+const has_tok_flag = (tok, flag) => Boolean(tok.flags & flag);
+const set_tok_flag = (tok, flag, truth) => {
+    if (truth) {
+        tok.flags |= flag;
+    } else {
+        tok.flags &= ~flag;
+    }
+};
+
+const TOK_FLAG_NLB          = 0b0001;
+const TOK_FLAG_QUOTE_SINGLE = 0b0010;
+const TOK_FLAG_QUOTE_EXISTS = 0b0100;
+
+class AST_Token {
+    constructor(type, value, line, col, pos, nlb, comments_before, comments_after, file) {
+        this.flags = (nlb ? 1 : 0);
+
+        this.type = type;
+        this.value = value;
+        this.line = line;
+        this.col = col;
+        this.pos = pos;
+        this.comments_before = comments_before;
+        this.comments_after = comments_after;
+        this.file = file;
+
+        Object.seal(this);
+    }
+
+    get nlb() {
+        return has_tok_flag(this, TOK_FLAG_NLB);
+    }
+
+    set nlb(new_nlb) {
+        set_tok_flag(this, TOK_FLAG_NLB, new_nlb);
+    }
+
+    get quote() {
+        return !has_tok_flag(this, TOK_FLAG_QUOTE_EXISTS)
+            ? ""
+            : (has_tok_flag(this, TOK_FLAG_QUOTE_SINGLE) ? "'" : '"');
+    }
+
+    set quote(quote_type) {
+        set_tok_flag(this, TOK_FLAG_QUOTE_SINGLE, quote_type === "'");
+        set_tok_flag(this, TOK_FLAG_QUOTE_EXISTS, !!quote_type);
+    }
+}
+
+var AST_Node = DEFNODE("Node", "start end", {
+    _clone: function(deep) {
+        if (deep) {
+            var self = this.clone();
+            return self.transform(new TreeTransformer(function(node) {
+                if (node !== self) {
+                    return node.clone(true);
+                }
+            }));
+        }
+        return new this.CTOR(this);
+    },
+    clone: function(deep) {
+        return this._clone(deep);
+    },
+    $documentation: "Base class of all AST nodes",
+    $propdoc: {
+        start: "[AST_Token] The first token of this node",
+        end: "[AST_Token] The last token of this node"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this);
+    },
+    walk: function(visitor) {
+        return this._walk(visitor); // not sure the indirection will be any help
+    },
+    _children_backwards: () => {}
+}, null);
+
+/* -----[ statements ]----- */
+
+var AST_Statement = DEFNODE("Statement", null, {
+    $documentation: "Base class of all statements",
+});
+
+var AST_Debugger = DEFNODE("Debugger", null, {
+    $documentation: "Represents a debugger statement",
+}, AST_Statement);
+
+var AST_Directive = DEFNODE("Directive", "value quote", {
+    $documentation: "Represents a directive, like \"use strict\";",
+    $propdoc: {
+        value: "[string] The value of this directive as a plain string (it's not an AST_String!)",
+        quote: "[string] the original quote character"
+    },
+}, AST_Statement);
+
+var AST_SimpleStatement = DEFNODE("SimpleStatement", "body", {
+    $documentation: "A statement consisting of an expression, i.e. a = 1 + 2",
+    $propdoc: {
+        body: "[AST_Node] an expression node (should not be instanceof AST_Statement)"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+    }
+}, AST_Statement);
+
+function walk_body(node, visitor) {
+    const body = node.body;
+    for (var i = 0, len = body.length; i < len; i++) {
+        body[i]._walk(visitor);
+    }
+}
+
+function clone_block_scope(deep) {
+    var clone = this._clone(deep);
+    if (this.block_scope) {
+        clone.block_scope = this.block_scope.clone();
+    }
+    return clone;
+}
+
+var AST_Block = DEFNODE("Block", "body block_scope", {
+    $documentation: "A body of statements (usually braced)",
+    $propdoc: {
+        body: "[AST_Statement*] an array of statements",
+        block_scope: "[AST_Scope] the block scope"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+    },
+    clone: clone_block_scope
+}, AST_Statement);
+
+var AST_BlockStatement = DEFNODE("BlockStatement", null, {
+    $documentation: "A block statement",
+}, AST_Block);
+
+var AST_EmptyStatement = DEFNODE("EmptyStatement", null, {
+    $documentation: "The empty statement (empty block or simply a semicolon)"
+}, AST_Statement);
+
+var AST_StatementWithBody = DEFNODE("StatementWithBody", "body", {
+    $documentation: "Base class for all statements that contain one nested body: `For`, `ForIn`, `Do`, `While`, `With`",
+    $propdoc: {
+        body: "[AST_Statement] the body; this should always be present, even if it's an AST_EmptyStatement"
+    }
+}, AST_Statement);
+
+var AST_LabeledStatement = DEFNODE("LabeledStatement", "label", {
+    $documentation: "Statement with a label",
+    $propdoc: {
+        label: "[AST_Label] a label definition"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.label._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        push(this.label);
+    },
+    clone: function(deep) {
+        var node = this._clone(deep);
+        if (deep) {
+            var label = node.label;
+            var def = this.label;
+            node.walk(new TreeWalker(function(node) {
+                if (node instanceof AST_LoopControl
+                    && node.label && node.label.thedef === def) {
+                    node.label.thedef = label;
+                    label.references.push(node);
+                }
+            }));
+        }
+        return node;
+    }
+}, AST_StatementWithBody);
+
+var AST_IterationStatement = DEFNODE("IterationStatement", "block_scope", {
+    $documentation: "Internal class.  All loops inherit from it.",
+    $propdoc: {
+        block_scope: "[AST_Scope] the block scope for this iteration statement."
+    },
+    clone: clone_block_scope
+}, AST_StatementWithBody);
+
+var AST_DWLoop = DEFNODE("DWLoop", "condition", {
+    $documentation: "Base class for do/while statements",
+    $propdoc: {
+        condition: "[AST_Node] the loop condition.  Should not be instanceof AST_Statement"
+    }
+}, AST_IterationStatement);
+
+var AST_Do = DEFNODE("Do", null, {
+    $documentation: "A `do` statement",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.body._walk(visitor);
+            this.condition._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.condition);
+        push(this.body);
+    }
+}, AST_DWLoop);
+
+var AST_While = DEFNODE("While", null, {
+    $documentation: "A `while` statement",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.condition._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        push(this.condition);
+    },
+}, AST_DWLoop);
+
+var AST_For = DEFNODE("For", "init condition step", {
+    $documentation: "A `for` statement",
+    $propdoc: {
+        init: "[AST_Node?] the `for` initialization code, or null if empty",
+        condition: "[AST_Node?] the `for` termination clause, or null if empty",
+        step: "[AST_Node?] the `for` update clause, or null if empty"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.init) this.init._walk(visitor);
+            if (this.condition) this.condition._walk(visitor);
+            if (this.step) this.step._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        if (this.step) push(this.step);
+        if (this.condition) push(this.condition);
+        if (this.init) push(this.init);
+    },
+}, AST_IterationStatement);
+
+var AST_ForIn = DEFNODE("ForIn", "init object", {
+    $documentation: "A `for ... in` statement",
+    $propdoc: {
+        init: "[AST_Node] the `for/in` initialization code",
+        object: "[AST_Node] the object that we're looping through"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.init._walk(visitor);
+            this.object._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        if (this.object) push(this.object);
+        if (this.init) push(this.init);
+    },
+}, AST_IterationStatement);
+
+var AST_ForOf = DEFNODE("ForOf", "await", {
+    $documentation: "A `for ... of` statement",
+}, AST_ForIn);
+
+var AST_With = DEFNODE("With", "expression", {
+    $documentation: "A `with` statement",
+    $propdoc: {
+        expression: "[AST_Node] the `with` expression"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            this.body._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.body);
+        push(this.expression);
+    },
+}, AST_StatementWithBody);
+
+/* -----[ scope and functions ]----- */
+
+var AST_Scope = DEFNODE("Scope", "variables functions uses_with uses_eval parent_scope enclosed cname", {
+    $documentation: "Base class for all statements introducing a lexical scope",
+    $propdoc: {
+        variables: "[Map/S] a map of name -> SymbolDef for all variables/functions defined in this scope",
+        uses_with: "[boolean/S] tells whether this scope uses the `with` statement",
+        uses_eval: "[boolean/S] tells whether this scope contains a direct call to the global `eval`",
+        parent_scope: "[AST_Scope?/S] link to the parent scope",
+        enclosed: "[SymbolDef*/S] a list of all symbol definitions that are accessed from this scope or any subscopes",
+        cname: "[integer/S] current index for mangling variables (used internally by the mangler)",
+    },
+    get_defun_scope: function() {
+        var self = this;
+        while (self.is_block_scope()) {
+            self = self.parent_scope;
+        }
+        return self;
+    },
+    clone: function(deep, toplevel) {
+        var node = this._clone(deep);
+        if (deep && this.variables && toplevel && !this._block_scope) {
+            node.figure_out_scope({}, {
+                toplevel: toplevel,
+                parent_scope: this.parent_scope
+            });
+        } else {
+            if (this.variables) node.variables = new Map(this.variables);
+            if (this.enclosed) node.enclosed = this.enclosed.slice();
+            if (this._block_scope) node._block_scope = this._block_scope;
+        }
+        return node;
+    },
+    pinned: function() {
+        return this.uses_eval || this.uses_with;
+    }
+}, AST_Block);
+
+var AST_Toplevel = DEFNODE("Toplevel", "globals", {
+    $documentation: "The toplevel scope",
+    $propdoc: {
+        globals: "[Map/S] a map of name -> SymbolDef for all undeclared names",
+    },
+    wrap_commonjs: function(name) {
+        var body = this.body;
+        var wrapped_tl = "(function(exports){'$ORIG';})(typeof " + name + "=='undefined'?(" + name + "={}):" + name + ");";
+        wrapped_tl = parse(wrapped_tl);
+        wrapped_tl = wrapped_tl.transform(new TreeTransformer(function(node) {
+            if (node instanceof AST_Directive && node.value == "$ORIG") {
+                return MAP.splice(body);
+            }
+        }));
+        return wrapped_tl;
+    },
+    wrap_enclose: function(args_values) {
+        if (typeof args_values != "string") args_values = "";
+        var index = args_values.indexOf(":");
+        if (index < 0) index = args_values.length;
+        var body = this.body;
+        return parse([
+            "(function(",
+            args_values.slice(0, index),
+            '){"$ORIG"})(',
+            args_values.slice(index + 1),
+            ")"
+        ].join("")).transform(new TreeTransformer(function(node) {
+            if (node instanceof AST_Directive && node.value == "$ORIG") {
+                return MAP.splice(body);
+            }
+        }));
+    }
+}, AST_Scope);
+
+var AST_Expansion = DEFNODE("Expansion", "expression", {
+    $documentation: "An expandible argument, such as ...rest, a splat, such as [1,2,...all], or an expansion in a variable declaration, such as var [first, ...rest] = list",
+    $propdoc: {
+        expression: "[AST_Node] the thing to be expanded"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression.walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_Lambda = DEFNODE("Lambda", "name argnames uses_arguments is_generator async", {
+    $documentation: "Base class for functions",
+    $propdoc: {
+        name: "[AST_SymbolDeclaration?] the name of this function",
+        argnames: "[AST_SymbolFunarg|AST_Destructuring|AST_Expansion|AST_DefaultAssign*] array of function arguments, destructurings, or expanding arguments",
+        uses_arguments: "[boolean/S] tells whether this function accesses the arguments array",
+        is_generator: "[boolean] is this a generator method",
+        async: "[boolean] is this method async",
+    },
+    args_as_names: function () {
+        var out = [];
+        for (var i = 0; i < this.argnames.length; i++) {
+            if (this.argnames[i] instanceof AST_Destructuring) {
+                out.push(...this.argnames[i].all_symbols());
+            } else {
+                out.push(this.argnames[i]);
+            }
+        }
+        return out;
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.name) this.name._walk(visitor);
+            var argnames = this.argnames;
+            for (var i = 0, len = argnames.length; i < len; i++) {
+                argnames[i]._walk(visitor);
+            }
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+
+        i = this.argnames.length;
+        while (i--) push(this.argnames[i]);
+
+        if (this.name) push(this.name);
+    },
+    is_braceless() {
+        return this.body[0] instanceof AST_Return && this.body[0].value;
+    },
+    // Default args and expansion don't count, so .argnames.length doesn't cut it
+    length_property() {
+        let length = 0;
+
+        for (const arg of this.argnames) {
+            if (arg instanceof AST_SymbolFunarg || arg instanceof AST_Destructuring) {
+                length++;
+            }
+        }
+
+        return length;
+    }
+}, AST_Scope);
+
+var AST_Accessor = DEFNODE("Accessor", null, {
+    $documentation: "A setter/getter function.  The `name` property is always null."
+}, AST_Lambda);
+
+var AST_Function = DEFNODE("Function", null, {
+    $documentation: "A function expression"
+}, AST_Lambda);
+
+var AST_Arrow = DEFNODE("Arrow", null, {
+    $documentation: "An ES6 Arrow function ((a) => b)"
+}, AST_Lambda);
+
+var AST_Defun = DEFNODE("Defun", null, {
+    $documentation: "A function definition"
+}, AST_Lambda);
+
+/* -----[ DESTRUCTURING ]----- */
+var AST_Destructuring = DEFNODE("Destructuring", "names is_array", {
+    $documentation: "A destructuring of several names. Used in destructuring assignment and with destructuring function argument names",
+    $propdoc: {
+        "names": "[AST_Node*] Array of properties or elements",
+        "is_array": "[Boolean] Whether the destructuring represents an object or array"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.names.forEach(function(name) {
+                name._walk(visitor);
+            });
+        });
+    },
+    _children_backwards(push) {
+        let i = this.names.length;
+        while (i--) push(this.names[i]);
+    },
+    all_symbols: function() {
+        var out = [];
+        this.walk(new TreeWalker(function (node) {
+            if (node instanceof AST_Symbol) {
+                out.push(node);
+            }
+        }));
+        return out;
+    }
+});
+
+var AST_PrefixedTemplateString = DEFNODE("PrefixedTemplateString", "template_string prefix", {
+    $documentation: "A templatestring with a prefix, such as String.raw`foobarbaz`",
+    $propdoc: {
+        template_string: "[AST_TemplateString] The template string",
+        prefix: "[AST_Node] The prefix, which will get called."
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function () {
+            this.prefix._walk(visitor);
+            this.template_string._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.template_string);
+        push(this.prefix);
+    },
+});
+
+var AST_TemplateString = DEFNODE("TemplateString", "segments", {
+    $documentation: "A template string literal",
+    $propdoc: {
+        segments: "[AST_Node*] One or more segments, starting with AST_TemplateSegment. AST_Node may follow AST_TemplateSegment, but each AST_Node must be followed by AST_TemplateSegment."
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.segments.forEach(function(seg) {
+                seg._walk(visitor);
+            });
+        });
+    },
+    _children_backwards(push) {
+        let i = this.segments.length;
+        while (i--) push(this.segments[i]);
+    }
+});
+
+var AST_TemplateSegment = DEFNODE("TemplateSegment", "value raw", {
+    $documentation: "A segment of a template string literal",
+    $propdoc: {
+        value: "Content of the segment",
+        raw: "Raw source of the segment",
+    }
+});
+
+/* -----[ JUMPS ]----- */
+
+var AST_Jump = DEFNODE("Jump", null, {
+    $documentation: "Base class for “jumps” (for now that's `return`, `throw`, `break` and `continue`)"
+}, AST_Statement);
+
+var AST_Exit = DEFNODE("Exit", "value", {
+    $documentation: "Base class for “exits” (`return` and `throw`)",
+    $propdoc: {
+        value: "[AST_Node?] the value returned or thrown by this statement; could be null for AST_Return"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, this.value && function() {
+            this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.value) push(this.value);
+    },
+}, AST_Jump);
+
+var AST_Return = DEFNODE("Return", null, {
+    $documentation: "A `return` statement"
+}, AST_Exit);
+
+var AST_Throw = DEFNODE("Throw", null, {
+    $documentation: "A `throw` statement"
+}, AST_Exit);
+
+var AST_LoopControl = DEFNODE("LoopControl", "label", {
+    $documentation: "Base class for loop control statements (`break` and `continue`)",
+    $propdoc: {
+        label: "[AST_LabelRef?] the label, or null if none",
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, this.label && function() {
+            this.label._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.label) push(this.label);
+    },
+}, AST_Jump);
+
+var AST_Break = DEFNODE("Break", null, {
+    $documentation: "A `break` statement"
+}, AST_LoopControl);
+
+var AST_Continue = DEFNODE("Continue", null, {
+    $documentation: "A `continue` statement"
+}, AST_LoopControl);
+
+var AST_Await = DEFNODE("Await", "expression", {
+    $documentation: "An `await` statement",
+    $propdoc: {
+        expression: "[AST_Node] the mandatory expression being awaited",
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_Yield = DEFNODE("Yield", "expression is_star", {
+    $documentation: "A `yield` statement",
+    $propdoc: {
+        expression: "[AST_Node?] the value returned or thrown by this statement; could be null (representing undefined) but only when is_star is set to false",
+        is_star: "[Boolean] Whether this is a yield or yield* statement"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, this.expression && function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.expression) push(this.expression);
+    }
+});
+
+/* -----[ IF ]----- */
+
+var AST_If = DEFNODE("If", "condition alternative", {
+    $documentation: "A `if` statement",
+    $propdoc: {
+        condition: "[AST_Node] the `if` condition",
+        alternative: "[AST_Statement?] the `else` part, or null if not present"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.condition._walk(visitor);
+            this.body._walk(visitor);
+            if (this.alternative) this.alternative._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.alternative) {
+            push(this.alternative);
+        }
+        push(this.body);
+        push(this.condition);
+    }
+}, AST_StatementWithBody);
+
+/* -----[ SWITCH ]----- */
+
+var AST_Switch = DEFNODE("Switch", "expression", {
+    $documentation: "A `switch` statement",
+    $propdoc: {
+        expression: "[AST_Node] the `switch` “discriminant”"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+        push(this.expression);
+    }
+}, AST_Block);
+
+var AST_SwitchBranch = DEFNODE("SwitchBranch", null, {
+    $documentation: "Base class for `switch` branches",
+}, AST_Block);
+
+var AST_Default = DEFNODE("Default", null, {
+    $documentation: "A `default` switch branch",
+}, AST_SwitchBranch);
+
+var AST_Case = DEFNODE("Case", "expression", {
+    $documentation: "A `case` switch branch",
+    $propdoc: {
+        expression: "[AST_Node] the `case` expression"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+        push(this.expression);
+    },
+}, AST_SwitchBranch);
+
+/* -----[ EXCEPTIONS ]----- */
+
+var AST_Try = DEFNODE("Try", "bcatch bfinally", {
+    $documentation: "A `try` statement",
+    $propdoc: {
+        bcatch: "[AST_Catch?] the catch block, or null if not present",
+        bfinally: "[AST_Finally?] the finally block, or null if not present"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            walk_body(this, visitor);
+            if (this.bcatch) this.bcatch._walk(visitor);
+            if (this.bfinally) this.bfinally._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.bfinally) push(this.bfinally);
+        if (this.bcatch) push(this.bcatch);
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+    },
+}, AST_Block);
+
+var AST_Catch = DEFNODE("Catch", "argname", {
+    $documentation: "A `catch` node; only makes sense as part of a `try` statement",
+    $propdoc: {
+        argname: "[AST_SymbolCatch|AST_Destructuring|AST_Expansion|AST_DefaultAssign] symbol for the exception"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.argname) this.argname._walk(visitor);
+            walk_body(this, visitor);
+        });
+    },
+    _children_backwards(push) {
+        let i = this.body.length;
+        while (i--) push(this.body[i]);
+        if (this.argname) push(this.argname);
+    },
+}, AST_Block);
+
+var AST_Finally = DEFNODE("Finally", null, {
+    $documentation: "A `finally` node; only makes sense as part of a `try` statement"
+}, AST_Block);
+
+/* -----[ VAR/CONST ]----- */
+
+var AST_Definitions = DEFNODE("Definitions", "definitions", {
+    $documentation: "Base class for `var` or `const` nodes (variable declarations/initializations)",
+    $propdoc: {
+        definitions: "[AST_VarDef*] array of variable definitions"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            var definitions = this.definitions;
+            for (var i = 0, len = definitions.length; i < len; i++) {
+                definitions[i]._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        let i = this.definitions.length;
+        while (i--) push(this.definitions[i]);
+    },
+}, AST_Statement);
+
+var AST_Var = DEFNODE("Var", null, {
+    $documentation: "A `var` statement"
+}, AST_Definitions);
+
+var AST_Let = DEFNODE("Let", null, {
+    $documentation: "A `let` statement"
+}, AST_Definitions);
+
+var AST_Const = DEFNODE("Const", null, {
+    $documentation: "A `const` statement"
+}, AST_Definitions);
+
+var AST_VarDef = DEFNODE("VarDef", "name value", {
+    $documentation: "A variable declaration; only appears in a AST_Definitions node",
+    $propdoc: {
+        name: "[AST_Destructuring|AST_SymbolConst|AST_SymbolLet|AST_SymbolVar] name of the variable",
+        value: "[AST_Node?] initializer, or null of there's no initializer"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.name._walk(visitor);
+            if (this.value) this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.value) push(this.value);
+        push(this.name);
+    },
+});
+
+var AST_NameMapping = DEFNODE("NameMapping", "foreign_name name", {
+    $documentation: "The part of the export/import statement that declare names from a module.",
+    $propdoc: {
+        foreign_name: "[AST_SymbolExportForeign|AST_SymbolImportForeign] The name being exported/imported (as specified in the module)",
+        name: "[AST_SymbolExport|AST_SymbolImport] The name as it is visible to this module."
+    },
+    _walk: function (visitor) {
+        return visitor._visit(this, function() {
+            this.foreign_name._walk(visitor);
+            this.name._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.name);
+        push(this.foreign_name);
+    },
+});
+
+var AST_Import = DEFNODE("Import", "imported_name imported_names module_name assert_clause", {
+    $documentation: "An `import` statement",
+    $propdoc: {
+        imported_name: "[AST_SymbolImport] The name of the variable holding the module's default export.",
+        imported_names: "[AST_NameMapping*] The names of non-default imported variables",
+        module_name: "[AST_String] String literal describing where this module came from",
+        assert_clause: "[AST_Object?] The import assertion"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.imported_name) {
+                this.imported_name._walk(visitor);
+            }
+            if (this.imported_names) {
+                this.imported_names.forEach(function(name_import) {
+                    name_import._walk(visitor);
+                });
+            }
+            this.module_name._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.module_name);
+        if (this.imported_names) {
+            let i = this.imported_names.length;
+            while (i--) push(this.imported_names[i]);
+        }
+        if (this.imported_name) push(this.imported_name);
+    },
+});
+
+var AST_ImportMeta = DEFNODE("ImportMeta", null, {
+    $documentation: "A reference to import.meta",
+});
+
+var AST_Export = DEFNODE("Export", "exported_definition exported_value is_default exported_names module_name assert_clause", {
+    $documentation: "An `export` statement",
+    $propdoc: {
+        exported_definition: "[AST_Defun|AST_Definitions|AST_DefClass?] An exported definition",
+        exported_value: "[AST_Node?] An exported value",
+        exported_names: "[AST_NameMapping*?] List of exported names",
+        module_name: "[AST_String?] Name of the file to load exports from",
+        is_default: "[Boolean] Whether this is the default exported value of this module",
+        assert_clause: "[AST_Object?] The import assertion"
+    },
+    _walk: function (visitor) {
+        return visitor._visit(this, function () {
+            if (this.exported_definition) {
+                this.exported_definition._walk(visitor);
+            }
+            if (this.exported_value) {
+                this.exported_value._walk(visitor);
+            }
+            if (this.exported_names) {
+                this.exported_names.forEach(function(name_export) {
+                    name_export._walk(visitor);
+                });
+            }
+            if (this.module_name) {
+                this.module_name._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        if (this.module_name) push(this.module_name);
+        if (this.exported_names) {
+            let i = this.exported_names.length;
+            while (i--) push(this.exported_names[i]);
+        }
+        if (this.exported_value) push(this.exported_value);
+        if (this.exported_definition) push(this.exported_definition);
+    }
+}, AST_Statement);
+
+/* -----[ OTHER ]----- */
+
+var AST_Call = DEFNODE("Call", "expression args optional _annotations", {
+    $documentation: "A function call expression",
+    $propdoc: {
+        expression: "[AST_Node] expression to invoke as function",
+        args: "[AST_Node*] array of arguments",
+        optional: "[boolean] whether this is an optional call (IE ?.() )",
+        _annotations: "[number] bitfield containing information about the call"
+    },
+    initialize() {
+        if (this._annotations == null) this._annotations = 0;
+    },
+    _walk(visitor) {
+        return visitor._visit(this, function() {
+            var args = this.args;
+            for (var i = 0, len = args.length; i < len; i++) {
+                args[i]._walk(visitor);
+            }
+            this.expression._walk(visitor);  // TODO why do we need to crawl this last?
+        });
+    },
+    _children_backwards(push) {
+        let i = this.args.length;
+        while (i--) push(this.args[i]);
+        push(this.expression);
+    },
+});
+
+var AST_New = DEFNODE("New", null, {
+    $documentation: "An object instantiation.  Derives from a function call since it has exactly the same properties"
+}, AST_Call);
+
+var AST_Sequence = DEFNODE("Sequence", "expressions", {
+    $documentation: "A sequence expression (comma-separated expressions)",
+    $propdoc: {
+        expressions: "[AST_Node*] array of expressions (at least two)"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expressions.forEach(function(node) {
+                node._walk(visitor);
+            });
+        });
+    },
+    _children_backwards(push) {
+        let i = this.expressions.length;
+        while (i--) push(this.expressions[i]);
+    },
+});
+
+var AST_PropAccess = DEFNODE("PropAccess", "expression property optional", {
+    $documentation: "Base class for property access expressions, i.e. `a.foo` or `a[\"foo\"]`",
+    $propdoc: {
+        expression: "[AST_Node] the “container” expression",
+        property: "[AST_Node|string] the property to access.  For AST_Dot & AST_DotHash this is always a plain string, while for AST_Sub it's an arbitrary AST_Node",
+
+        optional: "[boolean] whether this is an optional property access (IE ?.)"
+    }
+});
+
+var AST_Dot = DEFNODE("Dot", "quote", {
+    $documentation: "A dotted property access expression",
+    $propdoc: {
+        quote: "[string] the original quote character when transformed from AST_Sub",
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+}, AST_PropAccess);
+
+var AST_DotHash = DEFNODE("DotHash", "", {
+    $documentation: "A dotted property access to a private property",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+}, AST_PropAccess);
+
+var AST_Sub = DEFNODE("Sub", null, {
+    $documentation: "Index-style property access, i.e. `a[\"foo\"]`",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+            this.property._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.property);
+        push(this.expression);
+    },
+}, AST_PropAccess);
+
+var AST_Chain = DEFNODE("Chain", "expression", {
+    $documentation: "A chain expression like a?.b?.(c)?.[d]",
+    $propdoc: {
+        expression: "[AST_Call|AST_Dot|AST_DotHash|AST_Sub] chain element."
+    },
+    _walk: function (visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_Unary = DEFNODE("Unary", "operator expression", {
+    $documentation: "Base class for unary expressions",
+    $propdoc: {
+        operator: "[string] the operator",
+        expression: "[AST_Node] expression that this unary operator applies to"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.expression._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.expression);
+    },
+});
+
+var AST_UnaryPrefix = DEFNODE("UnaryPrefix", null, {
+    $documentation: "Unary prefix expression, i.e. `typeof i` or `++i`"
+}, AST_Unary);
+
+var AST_UnaryPostfix = DEFNODE("UnaryPostfix", null, {
+    $documentation: "Unary postfix expression, i.e. `i++`"
+}, AST_Unary);
+
+var AST_Binary = DEFNODE("Binary", "operator left right", {
+    $documentation: "Binary expression, i.e. `a + b`",
+    $propdoc: {
+        left: "[AST_Node] left-hand side expression",
+        operator: "[string] the operator",
+        right: "[AST_Node] right-hand side expression"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.left._walk(visitor);
+            this.right._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.right);
+        push(this.left);
+    },
+});
+
+var AST_Conditional = DEFNODE("Conditional", "condition consequent alternative", {
+    $documentation: "Conditional expression using the ternary operator, i.e. `a ? b : c`",
+    $propdoc: {
+        condition: "[AST_Node]",
+        consequent: "[AST_Node]",
+        alternative: "[AST_Node]"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            this.condition._walk(visitor);
+            this.consequent._walk(visitor);
+            this.alternative._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.alternative);
+        push(this.consequent);
+        push(this.condition);
+    },
+});
+
+var AST_Assign = DEFNODE("Assign", "logical", {
+    $documentation: "An assignment expression — `a = b + 5`",
+    $propdoc: {
+        logical: "Whether it's a logical assignment"
+    }
+}, AST_Binary);
+
+var AST_DefaultAssign = DEFNODE("DefaultAssign", null, {
+    $documentation: "A default assignment expression like in `(a = 3) => a`"
+}, AST_Binary);
+
+/* -----[ LITERALS ]----- */
+
+var AST_Array = DEFNODE("Array", "elements", {
+    $documentation: "An array literal",
+    $propdoc: {
+        elements: "[AST_Node*] array of elements"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            var elements = this.elements;
+            for (var i = 0, len = elements.length; i < len; i++) {
+                elements[i]._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        let i = this.elements.length;
+        while (i--) push(this.elements[i]);
+    },
+});
+
+var AST_Object = DEFNODE("Object", "properties", {
+    $documentation: "An object literal",
+    $propdoc: {
+        properties: "[AST_ObjectProperty*] array of properties"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            var properties = this.properties;
+            for (var i = 0, len = properties.length; i < len; i++) {
+                properties[i]._walk(visitor);
+            }
+        });
+    },
+    _children_backwards(push) {
+        let i = this.properties.length;
+        while (i--) push(this.properties[i]);
+    },
+});
+
+var AST_ObjectProperty = DEFNODE("ObjectProperty", "key value", {
+    $documentation: "Base class for literal object properties",
+    $propdoc: {
+        key: "[string|AST_Node] property name. For ObjectKeyVal this is a string. For getters, setters and computed property this is an AST_Node.",
+        value: "[AST_Node] property value.  For getters and setters this is an AST_Accessor."
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.key instanceof AST_Node)
+                this.key._walk(visitor);
+            this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        push(this.value);
+        if (this.key instanceof AST_Node) push(this.key);
+    }
+});
+
+var AST_ObjectKeyVal = DEFNODE("ObjectKeyVal", "quote", {
+    $documentation: "A key: value object property",
+    $propdoc: {
+        quote: "[string] the original quote character"
+    },
+    computed_key() {
+        return this.key instanceof AST_Node;
+    }
+}, AST_ObjectProperty);
+
+var AST_PrivateSetter = DEFNODE("PrivateSetter", "static", {
+    $propdoc: {
+        static: "[boolean] whether this is a static private setter"
+    },
+    $documentation: "A private setter property",
+    computed_key() {
+        return false;
+    }
+}, AST_ObjectProperty);
+
+var AST_PrivateGetter = DEFNODE("PrivateGetter", "static", {
+    $propdoc: {
+        static: "[boolean] whether this is a static private getter"
+    },
+    $documentation: "A private getter property",
+    computed_key() {
+        return false;
+    }
+}, AST_ObjectProperty);
+
+var AST_ObjectSetter = DEFNODE("ObjectSetter", "quote static", {
+    $propdoc: {
+        quote: "[string|undefined] the original quote character, if any",
+        static: "[boolean] whether this is a static setter (classes only)"
+    },
+    $documentation: "An object setter property",
+    computed_key() {
+        return !(this.key instanceof AST_SymbolMethod);
+    }
+}, AST_ObjectProperty);
+
+var AST_ObjectGetter = DEFNODE("ObjectGetter", "quote static", {
+    $propdoc: {
+        quote: "[string|undefined] the original quote character, if any",
+        static: "[boolean] whether this is a static getter (classes only)"
+    },
+    $documentation: "An object getter property",
+    computed_key() {
+        return !(this.key instanceof AST_SymbolMethod);
+    }
+}, AST_ObjectProperty);
+
+var AST_ConciseMethod = DEFNODE("ConciseMethod", "quote static is_generator async", {
+    $propdoc: {
+        quote: "[string|undefined] the original quote character, if any",
+        static: "[boolean] is this method static (classes only)",
+        is_generator: "[boolean] is this a generator method",
+        async: "[boolean] is this method async",
+    },
+    $documentation: "An ES6 concise method inside an object or class",
+    computed_key() {
+        return !(this.key instanceof AST_SymbolMethod);
+    }
+}, AST_ObjectProperty);
+
+var AST_PrivateMethod = DEFNODE("PrivateMethod", "", {
+    $documentation: "A private class method inside a class",
+}, AST_ConciseMethod);
+
+var AST_Class = DEFNODE("Class", "name extends properties", {
+    $propdoc: {
+        name: "[AST_SymbolClass|AST_SymbolDefClass?] optional class name.",
+        extends: "[AST_Node]? optional parent class",
+        properties: "[AST_ObjectProperty*] array of properties"
+    },
+    $documentation: "An ES6 class",
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.name) {
+                this.name._walk(visitor);
+            }
+            if (this.extends) {
+                this.extends._walk(visitor);
+            }
+            this.properties.forEach((prop) => prop._walk(visitor));
+        });
+    },
+    _children_backwards(push) {
+        let i = this.properties.length;
+        while (i--) push(this.properties[i]);
+        if (this.extends) push(this.extends);
+        if (this.name) push(this.name);
+    },
+}, AST_Scope /* TODO a class might have a scope but it's not a scope */);
+
+var AST_ClassProperty = DEFNODE("ClassProperty", "static quote", {
+    $documentation: "A class property",
+    $propdoc: {
+        static: "[boolean] whether this is a static key",
+        quote: "[string] which quote is being used"
+    },
+    _walk: function(visitor) {
+        return visitor._visit(this, function() {
+            if (this.key instanceof AST_Node)
+                this.key._walk(visitor);
+            if (this.value instanceof AST_Node)
+                this.value._walk(visitor);
+        });
+    },
+    _children_backwards(push) {
+        if (this.value instanceof AST_Node) push(this.value);
+        if (this.key instanceof AST_Node) push(this.key);
+    },
+    computed_key() {
+        return !(this.key instanceof AST_SymbolClassProperty);
+    }
+}, AST_ObjectProperty);
+
+var AST_ClassPrivateProperty = DEFNODE("ClassPrivateProperty", "", {
+    $documentation: "A class property for a private property",
+}, AST_ClassProperty);
+
+var AST_DefClass = DEFNODE("DefClass", null, {
+    $documentation: "A class definition",
+}, AST_Class);
+
+var AST_ClassExpression = DEFNODE("ClassExpression", null, {
+    $documentation: "A class expression."
+}, AST_Class);
+
+var AST_Symbol = DEFNODE("Symbol", "scope name thedef", {
+    $propdoc: {
+        name: "[string] name of this symbol",
+        scope: "[AST_Scope/S] the current scope (not necessarily the definition scope)",
+        thedef: "[SymbolDef/S] the definition of this symbol"
+    },
+    $documentation: "Base class for all symbols"
+});
+
+var AST_NewTarget = DEFNODE("NewTarget", null, {
+    $documentation: "A reference to new.target"
+});
+
+var AST_SymbolDeclaration = DEFNODE("SymbolDeclaration", "init", {
+    $documentation: "A declaration symbol (symbol in var/const, function name or argument, symbol in catch)",
+}, AST_Symbol);
+
+var AST_SymbolVar = DEFNODE("SymbolVar", null, {
+    $documentation: "Symbol defining a variable",
+}, AST_SymbolDeclaration);
+
+var AST_SymbolBlockDeclaration = DEFNODE("SymbolBlockDeclaration", null, {
+    $documentation: "Base class for block-scoped declaration symbols"
+}, AST_SymbolDeclaration);
+
+var AST_SymbolConst = DEFNODE("SymbolConst", null, {
+    $documentation: "A constant declaration"
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolLet = DEFNODE("SymbolLet", null, {
+    $documentation: "A block-scoped `let` declaration"
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolFunarg = DEFNODE("SymbolFunarg", null, {
+    $documentation: "Symbol naming a function argument",
+}, AST_SymbolVar);
+
+var AST_SymbolDefun = DEFNODE("SymbolDefun", null, {
+    $documentation: "Symbol defining a function",
+}, AST_SymbolDeclaration);
+
+var AST_SymbolMethod = DEFNODE("SymbolMethod", null, {
+    $documentation: "Symbol in an object defining a method",
+}, AST_Symbol);
+
+var AST_SymbolClassProperty = DEFNODE("SymbolClassProperty", null, {
+    $documentation: "Symbol for a class property",
+}, AST_Symbol);
+
+var AST_SymbolLambda = DEFNODE("SymbolLambda", null, {
+    $documentation: "Symbol naming a function expression",
+}, AST_SymbolDeclaration);
+
+var AST_SymbolDefClass = DEFNODE("SymbolDefClass", null, {
+    $documentation: "Symbol naming a class's name in a class declaration. Lexically scoped to its containing scope, and accessible within the class."
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolClass = DEFNODE("SymbolClass", null, {
+    $documentation: "Symbol naming a class's name. Lexically scoped to the class."
+}, AST_SymbolDeclaration);
+
+var AST_SymbolCatch = DEFNODE("SymbolCatch", null, {
+    $documentation: "Symbol naming the exception in catch",
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolImport = DEFNODE("SymbolImport", null, {
+    $documentation: "Symbol referring to an imported name",
+}, AST_SymbolBlockDeclaration);
+
+var AST_SymbolImportForeign = DEFNODE("SymbolImportForeign", null, {
+    $documentation: "A symbol imported from a module, but it is defined in the other module, and its real name is irrelevant for this module's purposes",
+}, AST_Symbol);
+
+var AST_Label = DEFNODE("Label", "references", {
+    $documentation: "Symbol naming a label (declaration)",
+    $propdoc: {
+        references: "[AST_LoopControl*] a list of nodes referring to this label"
+    },
+    initialize: function() {
+        this.references = [];
+        this.thedef = this;
+    }
+}, AST_Symbol);
+
+var AST_SymbolRef = DEFNODE("SymbolRef", null, {
+    $documentation: "Reference to some symbol (not definition/declaration)",
+}, AST_Symbol);
+
+var AST_SymbolExport = DEFNODE("SymbolExport", null, {
+    $documentation: "Symbol referring to a name to export",
+}, AST_SymbolRef);
+
+var AST_SymbolExportForeign = DEFNODE("SymbolExportForeign", null, {
+    $documentation: "A symbol exported from this module, but it is used in the other module, and its real name is irrelevant for this module's purposes",
+}, AST_Symbol);
+
+var AST_LabelRef = DEFNODE("LabelRef", null, {
+    $documentation: "Reference to a label symbol",
+}, AST_Symbol);
+
+var AST_This = DEFNODE("This", null, {
+    $documentation: "The `this` symbol",
+}, AST_Symbol);
+
+var AST_Super = DEFNODE("Super", null, {
+    $documentation: "The `super` symbol",
+}, AST_This);
+
+var AST_Constant = DEFNODE("Constant", null, {
+    $documentation: "Base class for all constants",
+    getValue: function() {
+        return this.value;
+    }
+});
+
+var AST_String = DEFNODE("String", "value quote", {
+    $documentation: "A string literal",
+    $propdoc: {
+        value: "[string] the contents of this string",
+        quote: "[string] the original quote character"
+    }
+}, AST_Constant);
+
+var AST_Number = DEFNODE("Number", "value raw", {
+    $documentation: "A number literal",
+    $propdoc: {
+        value: "[number] the numeric value",
+        raw: "[string] numeric value as string"
+    }
+}, AST_Constant);
+
+var AST_BigInt = DEFNODE("BigInt", "value", {
+    $documentation: "A big int literal",
+    $propdoc: {
+        value: "[string] big int value"
+    }
+}, AST_Constant);
+
+var AST_RegExp = DEFNODE("RegExp", "value", {
+    $documentation: "A regexp literal",
+    $propdoc: {
+        value: "[RegExp] the actual regexp",
+    }
+}, AST_Constant);
+
+var AST_Atom = DEFNODE("Atom", null, {
+    $documentation: "Base class for atoms",
+}, AST_Constant);
+
+var AST_Null = DEFNODE("Null", null, {
+    $documentation: "The `null` atom",
+    value: null
+}, AST_Atom);
+
+var AST_NaN = DEFNODE("NaN", null, {
+    $documentation: "The impossible value",
+    value: 0/0
+}, AST_Atom);
+
+var AST_Undefined = DEFNODE("Undefined", null, {
+    $documentation: "The `undefined` value",
+    value: (function() {}())
+}, AST_Atom);
+
+var AST_Hole = DEFNODE("Hole", null, {
+    $documentation: "A hole in an array",
+    value: (function() {}())
+}, AST_Atom);
+
+var AST_Infinity = DEFNODE("Infinity", null, {
+    $documentation: "The `Infinity` value",
+    value: 1/0
+}, AST_Atom);
+
+var AST_Boolean = DEFNODE("Boolean", null, {
+    $documentation: "Base class for booleans",
+}, AST_Atom);
+
+var AST_False = DEFNODE("False", null, {
+    $documentation: "The `false` atom",
+    value: false
+}, AST_Boolean);
+
+var AST_True = DEFNODE("True", null, {
+    $documentation: "The `true` atom",
+    value: true
+}, AST_Boolean);
+
+/* -----[ Walk function ]---- */
+
+/**
+ * Walk nodes in depth-first search fashion.
+ * Callback can return `walk_abort` symbol to stop iteration.
+ * It can also return `true` to stop iteration just for child nodes.
+ * Iteration can be stopped and continued by passing the `to_visit` argument,
+ * which is given to the callback in the second argument.
+ **/
+function walk(node, cb, to_visit = [node]) {
+    const push = to_visit.push.bind(to_visit);
+    while (to_visit.length) {
+        const node = to_visit.pop();
+        const ret = cb(node, to_visit);
+
+        if (ret) {
+            if (ret === walk_abort) return true;
+            continue;
+        }
+
+        node._children_backwards(push);
+    }
+    return false;
+}
+
+function walk_parent(node, cb, initial_stack) {
+    const to_visit = [node];
+    const push = to_visit.push.bind(to_visit);
+    const stack = initial_stack ? initial_stack.slice() : [];
+    const parent_pop_indices = [];
+
+    let current;
+
+    const info = {
+        parent: (n = 0) => {
+            if (n === -1) {
+                return current;
+            }
+
+            // [ p1 p0 ] [ 1 0 ]
+            if (initial_stack && n >= stack.length) {
+                n -= stack.length;
+                return initial_stack[
+                    initial_stack.length - (n + 1)
+                ];
+            }
+
+            return stack[stack.length - (1 + n)];
+        },
+    };
+
+    while (to_visit.length) {
+        current = to_visit.pop();
+
+        while (
+            parent_pop_indices.length &&
+            to_visit.length == parent_pop_indices[parent_pop_indices.length - 1]
+        ) {
+            stack.pop();
+            parent_pop_indices.pop();
+        }
+
+        const ret = cb(current, info);
+
+        if (ret) {
+            if (ret === walk_abort) return true;
+            continue;
+        }
+
+        const visit_length = to_visit.length;
+
+        current._children_backwards(push);
+
+        // Push only if we're going to traverse the children
+        if (to_visit.length > visit_length) {
+            stack.push(current);
+            parent_pop_indices.push(visit_length - 1);
+        }
+    }
+
+    return false;
+}
+
+const walk_abort = Symbol("abort walk");
+
+/* -----[ TreeWalker ]----- */
+
+class TreeWalker {
+    constructor(callback) {
+        this.visit = callback;
+        this.stack = [];
+        this.directives = Object.create(null);
+    }
+
+    _visit(node, descend) {
+        this.push(node);
+        var ret = this.visit(node, descend ? function() {
+            descend.call(node);
+        } : noop);
+        if (!ret && descend) {
+            descend.call(node);
+        }
+        this.pop();
+        return ret;
+    }
+
+    parent(n) {
+        return this.stack[this.stack.length - 2 - (n || 0)];
+    }
+
+    push(node) {
+        if (node instanceof AST_Lambda) {
+            this.directives = Object.create(this.directives);
+        } else if (node instanceof AST_Directive && !this.directives[node.value]) {
+            this.directives[node.value] = node;
+        } else if (node instanceof AST_Class) {
+            this.directives = Object.create(this.directives);
+            if (!this.directives["use strict"]) {
+                this.directives["use strict"] = node;
+            }
+        }
+        this.stack.push(node);
+    }
+
+    pop() {
+        var node = this.stack.pop();
+        if (node instanceof AST_Lambda || node instanceof AST_Class) {
+            this.directives = Object.getPrototypeOf(this.directives);
+        }
+    }
+
+    self() {
+        return this.stack[this.stack.length - 1];
+    }
+
+    find_parent(type) {
+        var stack = this.stack;
+        for (var i = stack.length; --i >= 0;) {
+            var x = stack[i];
+            if (x instanceof type) return x;
+        }
+    }
+
+    has_directive(type) {
+        var dir = this.directives[type];
+        if (dir) return dir;
+        var node = this.stack[this.stack.length - 1];
+        if (node instanceof AST_Scope && node.body) {
+            for (var i = 0; i < node.body.length; ++i) {
+                var st = node.body[i];
+                if (!(st instanceof AST_Directive)) break;
+                if (st.value == type) return st;
+            }
+        }
+    }
+
+    loopcontrol_target(node) {
+        var stack = this.stack;
+        if (node.label) for (var i = stack.length; --i >= 0;) {
+            var x = stack[i];
+            if (x instanceof AST_LabeledStatement && x.label.name == node.label.name)
+                return x.body;
+        } else for (var i = stack.length; --i >= 0;) {
+            var x = stack[i];
+            if (x instanceof AST_IterationStatement
+                || node instanceof AST_Break && x instanceof AST_Switch)
+                return x;
+        }
+    }
+}
+
+// Tree transformer helpers.
+class TreeTransformer extends TreeWalker {
+    constructor(before, after) {
+        super();
+        this.before = before;
+        this.after = after;
+    }
+}
+
+const _PURE     = 0b00000001;
+const _INLINE   = 0b00000010;
+const _NOINLINE = 0b00000100;
+
+export {
+    AST_Accessor,
+    AST_Array,
+    AST_Arrow,
+    AST_Assign,
+    AST_Atom,
+    AST_Await,
+    AST_BigInt,
+    AST_Binary,
+    AST_Block,
+    AST_BlockStatement,
+    AST_Boolean,
+    AST_Break,
+    AST_Call,
+    AST_Case,
+    AST_Catch,
+    AST_Chain,
+    AST_Class,
+    AST_ClassExpression,
+    AST_ClassPrivateProperty,
+    AST_ClassProperty,
+    AST_ConciseMethod,
+    AST_Conditional,
+    AST_Const,
+    AST_Constant,
+    AST_Continue,
+    AST_Debugger,
+    AST_Default,
+    AST_DefaultAssign,
+    AST_DefClass,
+    AST_Definitions,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Do,
+    AST_Dot,
+    AST_DotHash,
+    AST_DWLoop,
+    AST_EmptyStatement,
+    AST_Exit,
+    AST_Expansion,
+    AST_Export,
+    AST_False,
+    AST_Finally,
+    AST_For,
+    AST_ForIn,
+    AST_ForOf,
+    AST_Function,
+    AST_Hole,
+    AST_If,
+    AST_Import,
+    AST_ImportMeta,
+    AST_Infinity,
+    AST_IterationStatement,
+    AST_Jump,
+    AST_Label,
+    AST_LabeledStatement,
+    AST_LabelRef,
+    AST_Lambda,
+    AST_Let,
+    AST_LoopControl,
+    AST_NameMapping,
+    AST_NaN,
+    AST_New,
+    AST_NewTarget,
+    AST_Node,
+    AST_Null,
+    AST_Number,
+    AST_Object,
+    AST_ObjectGetter,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_ObjectSetter,
+    AST_PrefixedTemplateString,
+    AST_PrivateGetter,
+    AST_PrivateMethod,
+    AST_PrivateSetter,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Return,
+    AST_Scope,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Statement,
+    AST_StatementWithBody,
+    AST_String,
+    AST_Sub,
+    AST_Super,
+    AST_Switch,
+    AST_SwitchBranch,
+    AST_Symbol,
+    AST_SymbolBlockDeclaration,
+    AST_SymbolCatch,
+    AST_SymbolClass,
+    AST_SymbolClassProperty,
+    AST_SymbolConst,
+    AST_SymbolDeclaration,
+    AST_SymbolDefClass,
+    AST_SymbolDefun,
+    AST_SymbolExport,
+    AST_SymbolExportForeign,
+    AST_SymbolFunarg,
+    AST_SymbolImport,
+    AST_SymbolImportForeign,
+    AST_SymbolLambda,
+    AST_SymbolLet,
+    AST_SymbolMethod,
+    AST_SymbolRef,
+    AST_SymbolVar,
+    AST_TemplateSegment,
+    AST_TemplateString,
+    AST_This,
+    AST_Throw,
+    AST_Token,
+    AST_Toplevel,
+    AST_True,
+    AST_Try,
+    AST_Unary,
+    AST_UnaryPostfix,
+    AST_UnaryPrefix,
+    AST_Undefined,
+    AST_Var,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield,
+
+    // Walkers
+    TreeTransformer,
+    TreeWalker,
+    walk,
+    walk_abort,
+    walk_body,
+    walk_parent,
+
+    // annotations
+    _INLINE,
+    _NOINLINE,
+    _PURE,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/cli.js b/node_modules/mathjs/examples/node_modules/terser/lib/cli.js
new file mode 100644
index 0000000..1929813
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/cli.js
@@ -0,0 +1,479 @@
+import { minify, _default_options } from "../main.js";
+import { parse } from "./parse.js";
+import {
+    AST_Assign,
+    AST_Array,
+    AST_Constant,
+    AST_Node,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Sequence,
+    AST_Symbol,
+    AST_Token,
+    walk
+} from "./ast.js";
+import { OutputStream } from "./output.js";
+
+export async function run_cli({ program, packageJson, fs, path }) {
+    const skip_keys = new Set([ "cname", "parent_scope", "scope", "uses_eval", "uses_with" ]);
+    var files = {};
+    var options = {
+        compress: false,
+        mangle: false
+    };
+    const default_options = await _default_options();
+    program.version(packageJson.name + " " + packageJson.version);
+    program.parseArgv = program.parse;
+    program.parse = undefined;
+
+    if (process.argv.includes("ast")) program.helpInformation = describe_ast;
+    else if (process.argv.includes("options")) program.helpInformation = function() {
+        var text = [];
+        for (var option in default_options) {
+            text.push("--" + (option === "sourceMap" ? "source-map" : option) + " options:");
+            text.push(format_object(default_options[option]));
+            text.push("");
+        }
+        return text.join("\n");
+    };
+
+    program.option("-p, --parse <options>", "Specify parser options.", parse_js());
+    program.option("-c, --compress [options]", "Enable compressor/specify compressor options.", parse_js());
+    program.option("-m, --mangle [options]", "Mangle names/specify mangler options.", parse_js());
+    program.option("--mangle-props [options]", "Mangle properties/specify mangler options.", parse_js());
+    program.option("-f, --format [options]", "Format options.", parse_js());
+    program.option("-b, --beautify [options]", "Alias for --format.", parse_js());
+    program.option("-o, --output <file>", "Output file (default STDOUT).");
+    program.option("--comments [filter]", "Preserve copyright comments in the output.");
+    program.option("--config-file <file>", "Read minify() options from JSON file.");
+    program.option("-d, --define <expr>[=value]", "Global definitions.", parse_js("define"));
+    program.option("--ecma <version>", "Specify ECMAScript release: 5, 2015, 2016 or 2017...");
+    program.option("-e, --enclose [arg[,...][:value[,...]]]", "Embed output in a big function with configurable arguments and values.");
+    program.option("--ie8", "Support non-standard Internet Explorer 8.");
+    program.option("--keep-classnames", "Do not mangle/drop class names.");
+    program.option("--keep-fnames", "Do not mangle/drop function names. Useful for code relying on Function.prototype.name.");
+    program.option("--module", "Input is an ES6 module");
+    program.option("--name-cache <file>", "File to hold mangled name mappings.");
+    program.option("--rename", "Force symbol expansion.");
+    program.option("--no-rename", "Disable symbol expansion.");
+    program.option("--safari10", "Support non-standard Safari 10.");
+    program.option("--source-map [options]", "Enable source map/specify source map options.", parse_js());
+    program.option("--timings", "Display operations run time on STDERR.");
+    program.option("--toplevel", "Compress and/or mangle variables in toplevel scope.");
+    program.option("--wrap <name>", "Embed everything as a function with “exports” corresponding to “name” globally.");
+    program.arguments("[files...]").parseArgv(process.argv);
+    if (program.configFile) {
+        options = JSON.parse(read_file(program.configFile));
+    }
+    if (!program.output && program.sourceMap && program.sourceMap.url != "inline") {
+        fatal("ERROR: cannot write source map to STDOUT");
+    }
+
+    [
+        "compress",
+        "enclose",
+        "ie8",
+        "mangle",
+        "module",
+        "safari10",
+        "sourceMap",
+        "toplevel",
+        "wrap"
+    ].forEach(function(name) {
+        if (name in program) {
+            options[name] = program[name];
+        }
+    });
+
+    if ("ecma" in program) {
+        if (program.ecma != (program.ecma | 0)) fatal("ERROR: ecma must be an integer");
+        const ecma = program.ecma | 0;
+        if (ecma > 5 && ecma < 2015)
+            options.ecma = ecma + 2009;
+        else
+            options.ecma = ecma;
+    }
+    if (program.format || program.beautify) {
+        const chosenOption = program.format || program.beautify;
+        options.format = typeof chosenOption === "object" ? chosenOption : {};
+    }
+    if (program.comments) {
+        if (typeof options.format != "object") options.format = {};
+        options.format.comments = typeof program.comments == "string" ? (program.comments == "false" ? false : program.comments) : "some";
+    }
+    if (program.define) {
+        if (typeof options.compress != "object") options.compress = {};
+        if (typeof options.compress.global_defs != "object") options.compress.global_defs = {};
+        for (var expr in program.define) {
+            options.compress.global_defs[expr] = program.define[expr];
+        }
+    }
+    if (program.keepClassnames) {
+        options.keep_classnames = true;
+    }
+    if (program.keepFnames) {
+        options.keep_fnames = true;
+    }
+    if (program.mangleProps) {
+        if (program.mangleProps.domprops) {
+            delete program.mangleProps.domprops;
+        } else {
+            if (typeof program.mangleProps != "object") program.mangleProps = {};
+            if (!Array.isArray(program.mangleProps.reserved)) program.mangleProps.reserved = [];
+        }
+        if (typeof options.mangle != "object") options.mangle = {};
+        options.mangle.properties = program.mangleProps;
+    }
+    if (program.nameCache) {
+        options.nameCache = JSON.parse(read_file(program.nameCache, "{}"));
+    }
+    if (program.output == "ast") {
+        options.format = {
+            ast: true,
+            code: false
+        };
+    }
+    if (program.parse) {
+        if (!program.parse.acorn && !program.parse.spidermonkey) {
+            options.parse = program.parse;
+        } else if (program.sourceMap && program.sourceMap.content == "inline") {
+            fatal("ERROR: inline source map only works with built-in parser");
+        }
+    }
+    if (~program.rawArgs.indexOf("--rename")) {
+        options.rename = true;
+    } else if (!program.rename) {
+        options.rename = false;
+    }
+
+    let convert_path = name => name;
+    if (typeof program.sourceMap == "object" && "base" in program.sourceMap) {
+        convert_path = function() {
+            var base = program.sourceMap.base;
+            delete options.sourceMap.base;
+            return function(name) {
+                return path.relative(base, name);
+            };
+        }();
+    }
+
+    let filesList;
+    if (options.files && options.files.length) {
+        filesList = options.files;
+
+        delete options.files;
+    } else if (program.args.length) {
+        filesList = program.args;
+    }
+
+    if (filesList) {
+        simple_glob(filesList).forEach(function(name) {
+            files[convert_path(name)] = read_file(name);
+        });
+    } else {
+        await new Promise((resolve) => {
+            var chunks = [];
+            process.stdin.setEncoding("utf8");
+            process.stdin.on("data", function(chunk) {
+                chunks.push(chunk);
+            }).on("end", function() {
+                files = [ chunks.join("") ];
+                resolve();
+            });
+            process.stdin.resume();
+        });
+    }
+
+    await run_cli();
+
+    function convert_ast(fn) {
+        return AST_Node.from_mozilla_ast(Object.keys(files).reduce(fn, null));
+    }
+
+    async function run_cli() {
+        var content = program.sourceMap && program.sourceMap.content;
+        if (content && content !== "inline") {
+            options.sourceMap.content = read_file(content, content);
+        }
+        if (program.timings) options.timings = true;
+
+        try {
+            if (program.parse) {
+                if (program.parse.acorn) {
+                    files = convert_ast(function(toplevel, name) {
+                        return require("acorn").parse(files[name], {
+                            ecmaVersion: 2018,
+                            locations: true,
+                            program: toplevel,
+                            sourceFile: name,
+                            sourceType: options.module || program.parse.module ? "module" : "script"
+                        });
+                    });
+                } else if (program.parse.spidermonkey) {
+                    files = convert_ast(function(toplevel, name) {
+                        var obj = JSON.parse(files[name]);
+                        if (!toplevel) return obj;
+                        toplevel.body = toplevel.body.concat(obj.body);
+                        return toplevel;
+                    });
+                }
+            }
+        } catch (ex) {
+            fatal(ex);
+        }
+
+        let result;
+        try {
+            result = await minify(files, options, fs);
+        } catch (ex) {
+            if (ex.name == "SyntaxError") {
+                print_error("Parse error at " + ex.filename + ":" + ex.line + "," + ex.col);
+                var col = ex.col;
+                var lines = files[ex.filename].split(/\r?\n/);
+                var line = lines[ex.line - 1];
+                if (!line && !col) {
+                    line = lines[ex.line - 2];
+                    col = line.length;
+                }
+                if (line) {
+                    var limit = 70;
+                    if (col > limit) {
+                        line = line.slice(col - limit);
+                        col = limit;
+                    }
+                    print_error(line.slice(0, 80));
+                    print_error(line.slice(0, col).replace(/\S/g, " ") + "^");
+                }
+            }
+            if (ex.defs) {
+                print_error("Supported options:");
+                print_error(format_object(ex.defs));
+            }
+            fatal(ex);
+            return;
+        }
+
+        if (program.output == "ast") {
+            if (!options.compress && !options.mangle) {
+                result.ast.figure_out_scope({});
+            }
+            console.log(JSON.stringify(result.ast, function(key, value) {
+                if (value) switch (key) {
+                  case "thedef":
+                    return symdef(value);
+                  case "enclosed":
+                    return value.length ? value.map(symdef) : undefined;
+                  case "variables":
+                  case "globals":
+                    return value.size ? collect_from_map(value, symdef) : undefined;
+                }
+                if (skip_keys.has(key)) return;
+                if (value instanceof AST_Token) return;
+                if (value instanceof Map) return;
+                if (value instanceof AST_Node) {
+                    var result = {
+                        _class: "AST_" + value.TYPE
+                    };
+                    if (value.block_scope) {
+                        result.variables = value.block_scope.variables;
+                        result.enclosed = value.block_scope.enclosed;
+                    }
+                    value.CTOR.PROPS.forEach(function(prop) {
+                        result[prop] = value[prop];
+                    });
+                    return result;
+                }
+                return value;
+            }, 2));
+        } else if (program.output == "spidermonkey") {
+            try {
+                const minified = await minify(
+                    result.code,
+                    {
+                        compress: false,
+                        mangle: false,
+                        format: {
+                            ast: true,
+                            code: false
+                        }
+                    },
+                    fs
+                );
+                console.log(JSON.stringify(minified.ast.to_mozilla_ast(), null, 2));
+            } catch (ex) {
+                fatal(ex);
+                return;
+            }
+        } else if (program.output) {
+            fs.writeFileSync(program.output, result.code);
+            if (options.sourceMap && options.sourceMap.url !== "inline" && result.map) {
+                fs.writeFileSync(program.output + ".map", result.map);
+            }
+        } else {
+            console.log(result.code);
+        }
+        if (program.nameCache) {
+            fs.writeFileSync(program.nameCache, JSON.stringify(options.nameCache));
+        }
+        if (result.timings) for (var phase in result.timings) {
+            print_error("- " + phase + ": " + result.timings[phase].toFixed(3) + "s");
+        }
+    }
+
+    function fatal(message) {
+        if (message instanceof Error) message = message.stack.replace(/^\S*?Error:/, "ERROR:");
+        print_error(message);
+        process.exit(1);
+    }
+
+    // A file glob function that only supports "*" and "?" wildcards in the basename.
+    // Example: "foo/bar/*baz??.*.js"
+    // Argument `glob` may be a string or an array of strings.
+    // Returns an array of strings. Garbage in, garbage out.
+    function simple_glob(glob) {
+        if (Array.isArray(glob)) {
+            return [].concat.apply([], glob.map(simple_glob));
+        }
+        if (glob && glob.match(/[*?]/)) {
+            var dir = path.dirname(glob);
+            try {
+                var entries = fs.readdirSync(dir);
+            } catch (ex) {}
+            if (entries) {
+                var pattern = "^" + path.basename(glob)
+                    .replace(/[.+^$[\]\\(){}]/g, "\\$&")
+                    .replace(/\*/g, "[^/\\\\]*")
+                    .replace(/\?/g, "[^/\\\\]") + "$";
+                var mod = process.platform === "win32" ? "i" : "";
+                var rx = new RegExp(pattern, mod);
+                var results = entries.filter(function(name) {
+                    return rx.test(name);
+                }).map(function(name) {
+                    return path.join(dir, name);
+                });
+                if (results.length) return results;
+            }
+        }
+        return [ glob ];
+    }
+
+    function read_file(path, default_value) {
+        try {
+            return fs.readFileSync(path, "utf8");
+        } catch (ex) {
+            if ((ex.code == "ENOENT" || ex.code == "ENAMETOOLONG") && default_value != null) return default_value;
+            fatal(ex);
+        }
+    }
+
+    function parse_js(flag) {
+        return function(value, options) {
+            options = options || {};
+            try {
+                walk(parse(value, { expression: true }), node => {
+                    if (node instanceof AST_Assign) {
+                        var name = node.left.print_to_string();
+                        var value = node.right;
+                        if (flag) {
+                            options[name] = value;
+                        } else if (value instanceof AST_Array) {
+                            options[name] = value.elements.map(to_string);
+                        } else if (value instanceof AST_RegExp) {
+                            value = value.value;
+                            options[name] = new RegExp(value.source, value.flags);
+                        } else {
+                            options[name] = to_string(value);
+                        }
+                        return true;
+                    }
+                    if (node instanceof AST_Symbol || node instanceof AST_PropAccess) {
+                        var name = node.print_to_string();
+                        options[name] = true;
+                        return true;
+                    }
+                    if (!(node instanceof AST_Sequence)) throw node;
+
+                    function to_string(value) {
+                        return value instanceof AST_Constant ? value.getValue() : value.print_to_string({
+                            quote_keys: true
+                        });
+                    }
+                });
+            } catch(ex) {
+                if (flag) {
+                    fatal("Error parsing arguments for '" + flag + "': " + value);
+                } else {
+                    options[value] = null;
+                }
+            }
+            return options;
+        };
+    }
+
+    function symdef(def) {
+        var ret = (1e6 + def.id) + " " + def.name;
+        if (def.mangled_name) ret += " " + def.mangled_name;
+        return ret;
+    }
+
+    function collect_from_map(map, callback) {
+        var result = [];
+        map.forEach(function (def) {
+            result.push(callback(def));
+        });
+        return result;
+    }
+
+    function format_object(obj) {
+        var lines = [];
+        var padding = "";
+        Object.keys(obj).map(function(name) {
+            if (padding.length < name.length) padding = Array(name.length + 1).join(" ");
+            return [ name, JSON.stringify(obj[name]) ];
+        }).forEach(function(tokens) {
+            lines.push("  " + tokens[0] + padding.slice(tokens[0].length - 2) + tokens[1]);
+        });
+        return lines.join("\n");
+    }
+
+    function print_error(msg) {
+        process.stderr.write(msg);
+        process.stderr.write("\n");
+    }
+
+    function describe_ast() {
+        var out = OutputStream({ beautify: true });
+        function doitem(ctor) {
+            out.print("AST_" + ctor.TYPE);
+            const props = ctor.SELF_PROPS.filter(prop => !/^\$/.test(prop));
+
+            if (props.length > 0) {
+                out.space();
+                out.with_parens(function() {
+                    props.forEach(function(prop, i) {
+                        if (i) out.space();
+                        out.print(prop);
+                    });
+                });
+            }
+
+            if (ctor.documentation) {
+                out.space();
+                out.print_string(ctor.documentation);
+            }
+
+            if (ctor.SUBCLASSES.length > 0) {
+                out.space();
+                out.with_block(function() {
+                    ctor.SUBCLASSES.forEach(function(ctor) {
+                        out.indent();
+                        doitem(ctor);
+                        out.newline();
+                    });
+                });
+            }
+        }
+        doitem(AST_Node);
+        return out + "\n";
+    }
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/common.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/common.js
new file mode 100644
index 0000000..75b12d2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/common.js
@@ -0,0 +1,296 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+    AST_Array,
+    AST_Arrow,
+    AST_BlockStatement,
+    AST_Call,
+    AST_Class,
+    AST_Const,
+    AST_Constant,
+    AST_DefClass,
+    AST_Defun,
+    AST_EmptyStatement,
+    AST_Export,
+    AST_False,
+    AST_Function,
+    AST_Import,
+    AST_Infinity,
+    AST_LabeledStatement,
+    AST_Lambda,
+    AST_Let,
+    AST_LoopControl,
+    AST_NaN,
+    AST_Node,
+    AST_Null,
+    AST_Number,
+    AST_Object,
+    AST_ObjectKeyVal,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Scope,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Statement,
+    AST_String,
+    AST_SymbolRef,
+    AST_True,
+    AST_UnaryPrefix,
+    AST_Undefined,
+
+    TreeWalker,
+} from "../ast.js";
+import { make_node, regexp_source_fix, string_template, makePredicate } from "../utils/index.js";
+import { first_in_statement } from "../utils/first_in_statement.js";
+
+export function merge_sequence(array, node) {
+    if (node instanceof AST_Sequence) {
+        array.push(...node.expressions);
+    } else {
+        array.push(node);
+    }
+    return array;
+}
+
+export function make_sequence(orig, expressions) {
+    if (expressions.length == 1) return expressions[0];
+    if (expressions.length == 0) throw new Error("trying to create a sequence with length zero!");
+    return make_node(AST_Sequence, orig, {
+        expressions: expressions.reduce(merge_sequence, [])
+    });
+}
+
+export function make_node_from_constant(val, orig) {
+    switch (typeof val) {
+      case "string":
+        return make_node(AST_String, orig, {
+            value: val
+        });
+      case "number":
+        if (isNaN(val)) return make_node(AST_NaN, orig);
+        if (isFinite(val)) {
+            return 1 / val < 0 ? make_node(AST_UnaryPrefix, orig, {
+                operator: "-",
+                expression: make_node(AST_Number, orig, { value: -val })
+            }) : make_node(AST_Number, orig, { value: val });
+        }
+        return val < 0 ? make_node(AST_UnaryPrefix, orig, {
+            operator: "-",
+            expression: make_node(AST_Infinity, orig)
+        }) : make_node(AST_Infinity, orig);
+      case "boolean":
+        return make_node(val ? AST_True : AST_False, orig);
+      case "undefined":
+        return make_node(AST_Undefined, orig);
+      default:
+        if (val === null) {
+            return make_node(AST_Null, orig, { value: null });
+        }
+        if (val instanceof RegExp) {
+            return make_node(AST_RegExp, orig, {
+                value: {
+                    source: regexp_source_fix(val.source),
+                    flags: val.flags
+                }
+            });
+        }
+        throw new Error(string_template("Can't handle constant of type: {type}", {
+            type: typeof val
+        }));
+    }
+}
+
+export function best_of_expression(ast1, ast2) {
+    return ast1.size() > ast2.size() ? ast2 : ast1;
+}
+
+export function best_of_statement(ast1, ast2) {
+    return best_of_expression(
+        make_node(AST_SimpleStatement, ast1, {
+            body: ast1
+        }),
+        make_node(AST_SimpleStatement, ast2, {
+            body: ast2
+        })
+    ).body;
+}
+
+/** Find which node is smaller, and return that */
+export function best_of(compressor, ast1, ast2) {
+    if (first_in_statement(compressor)) {
+        return best_of_statement(ast1, ast2);
+    } else {
+        return best_of_expression(ast1, ast2);
+    }
+}
+
+/** Simplify an object property's key, if possible */
+export function get_simple_key(key) {
+    if (key instanceof AST_Constant) {
+        return key.getValue();
+    }
+    if (key instanceof AST_UnaryPrefix
+        && key.operator == "void"
+        && key.expression instanceof AST_Constant) {
+        return;
+    }
+    return key;
+}
+
+export function read_property(obj, key) {
+    key = get_simple_key(key);
+    if (key instanceof AST_Node) return;
+
+    var value;
+    if (obj instanceof AST_Array) {
+        var elements = obj.elements;
+        if (key == "length") return make_node_from_constant(elements.length, obj);
+        if (typeof key == "number" && key in elements) value = elements[key];
+    } else if (obj instanceof AST_Object) {
+        key = "" + key;
+        var props = obj.properties;
+        for (var i = props.length; --i >= 0;) {
+            var prop = props[i];
+            if (!(prop instanceof AST_ObjectKeyVal)) return;
+            if (!value && props[i].key === key) value = props[i].value;
+        }
+    }
+
+    return value instanceof AST_SymbolRef && value.fixed_value() || value;
+}
+
+export function has_break_or_continue(loop, parent) {
+    var found = false;
+    var tw = new TreeWalker(function(node) {
+        if (found || node instanceof AST_Scope) return true;
+        if (node instanceof AST_LoopControl && tw.loopcontrol_target(node) === loop) {
+            return found = true;
+        }
+    });
+    if (parent instanceof AST_LabeledStatement) tw.push(parent);
+    tw.push(loop);
+    loop.body.walk(tw);
+    return found;
+}
+
+// we shouldn't compress (1,func)(something) to
+// func(something) because that changes the meaning of
+// the func (becomes lexical instead of global).
+export function maintain_this_binding(parent, orig, val) {
+    if (
+        parent instanceof AST_UnaryPrefix && parent.operator == "delete"
+        || parent instanceof AST_Call && parent.expression === orig
+            && (
+                val instanceof AST_PropAccess
+                || val instanceof AST_SymbolRef && val.name == "eval"
+            )
+    ) {
+        const zero = make_node(AST_Number, orig, { value: 0 });
+        return make_sequence(orig, [ zero, val ]);
+    } else {
+        return val;
+    }
+}
+
+export function is_func_expr(node) {
+    return node instanceof AST_Arrow || node instanceof AST_Function;
+}
+
+export function is_iife_call(node) {
+    // Used to determine whether the node can benefit from negation.
+    // Not the case with arrow functions (you need an extra set of parens).
+    if (node.TYPE != "Call") return false;
+    return node.expression instanceof AST_Function || is_iife_call(node.expression);
+}
+
+export const identifier_atom = makePredicate("Infinity NaN undefined");
+export function is_identifier_atom(node) {
+    return node instanceof AST_Infinity
+        || node instanceof AST_NaN
+        || node instanceof AST_Undefined;
+}
+
+/** Check if this is a SymbolRef node which has one def of a certain AST type */
+export function is_ref_of(ref, type) {
+    if (!(ref instanceof AST_SymbolRef)) return false;
+    var orig = ref.definition().orig;
+    for (var i = orig.length; --i >= 0;) {
+        if (orig[i] instanceof type) return true;
+    }
+}
+
+// Can we turn { block contents... } into just the block contents ?
+// Not if one of these is inside.
+export function can_be_evicted_from_block(node) {
+    return !(
+        node instanceof AST_DefClass ||
+        node instanceof AST_Defun ||
+        node instanceof AST_Let ||
+        node instanceof AST_Const ||
+        node instanceof AST_Export ||
+        node instanceof AST_Import
+    );
+}
+
+export function as_statement_array(thing) {
+    if (thing === null) return [];
+    if (thing instanceof AST_BlockStatement) return thing.body;
+    if (thing instanceof AST_EmptyStatement) return [];
+    if (thing instanceof AST_Statement) return [ thing ];
+    throw new Error("Can't convert thing to statement array");
+}
+
+/** Check if a ref refers to the name of a function/class it's defined within */
+export function is_recursive_ref(compressor, def) {
+    var node;
+    for (var i = 0; node = compressor.parent(i); i++) {
+        if (node instanceof AST_Lambda || node instanceof AST_Class) {
+            var name = node.name;
+            if (name && name.definition() === def) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/compressor-flags.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/compressor-flags.js
new file mode 100644
index 0000000..1341658
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/compressor-flags.js
@@ -0,0 +1,63 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+// bitfield flags to be stored in node.flags.
+// These are set and unset during compression, and store information in the node without requiring multiple fields.
+export const UNUSED = 0b00000001;
+export const TRUTHY = 0b00000010;
+export const FALSY = 0b00000100;
+export const UNDEFINED = 0b00001000;
+export const INLINED = 0b00010000;
+
+// Nodes to which values are ever written. Used when keep_assign is part of the unused option string.
+export const WRITE_ONLY = 0b00100000;
+
+// information specific to a single compression pass
+export const SQUEEZED = 0b0000000100000000;
+export const OPTIMIZED = 0b0000001000000000;
+export const TOP = 0b0000010000000000;
+export const CLEAR_BETWEEN_PASSES = SQUEEZED | OPTIMIZED | TOP;
+
+export const has_flag = (node, flag) => node.flags & flag;
+export const set_flag = (node, flag) => { node.flags |= flag; };
+export const clear_flag = (node, flag) => { node.flags &= ~flag; };
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/drop-side-effect-free.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/drop-side-effect-free.js
new file mode 100644
index 0000000..60ee014
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/drop-side-effect-free.js
@@ -0,0 +1,350 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+    AST_Accessor,
+    AST_Array,
+    AST_Arrow,
+    AST_Assign,
+    AST_Binary,
+    AST_Call,
+    AST_Chain,
+    AST_Class,
+    AST_ClassProperty,
+    AST_ConciseMethod,
+    AST_Conditional,
+    AST_Constant,
+    AST_Dot,
+    AST_Expansion,
+    AST_Function,
+    AST_Node,
+    AST_Number,
+    AST_Object,
+    AST_ObjectGetter,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_ObjectSetter,
+    AST_PropAccess,
+    AST_Scope,
+    AST_Sequence,
+    AST_Sub,
+    AST_SymbolRef,
+    AST_TemplateSegment,
+    AST_TemplateString,
+    AST_This,
+    AST_Unary,
+} from "../ast.js";
+import { make_node, return_null, return_this } from "../utils/index.js";
+import { first_in_statement } from "../utils/first_in_statement.js";
+
+import { pure_prop_access_globals } from "./native-objects.js";
+import { lazy_op, unary_side_effects, is_nullish_shortcircuited } from "./inference.js";
+import { WRITE_ONLY, set_flag, clear_flag } from "./compressor-flags.js";
+import { make_sequence, is_func_expr, is_iife_call } from "./common.js";
+
+// AST_Node#drop_side_effect_free() gets called when we don't care about the value,
+// only about side effects. We'll be defining this method for each node type in this module
+//
+// Examples:
+// foo++ -> foo++
+// 1 + func() -> func()
+// 10 -> (nothing)
+// knownPureFunc(foo++) -> foo++
+
+function def_drop_side_effect_free(node, func) {
+    node.DEFMETHOD("drop_side_effect_free", func);
+}
+
+// Drop side-effect-free elements from an array of expressions.
+// Returns an array of expressions with side-effects or null
+// if all elements were dropped. Note: original array may be
+// returned if nothing changed.
+function trim(nodes, compressor, first_in_statement) {
+    var len = nodes.length;
+    if (!len)  return null;
+
+    var ret = [], changed = false;
+    for (var i = 0; i < len; i++) {
+        var node = nodes[i].drop_side_effect_free(compressor, first_in_statement);
+        changed |= node !== nodes[i];
+        if (node) {
+            ret.push(node);
+            first_in_statement = false;
+        }
+    }
+    return changed ? ret.length ? ret : null : nodes;
+}
+
+def_drop_side_effect_free(AST_Node, return_this);
+def_drop_side_effect_free(AST_Constant, return_null);
+def_drop_side_effect_free(AST_This, return_null);
+
+def_drop_side_effect_free(AST_Call, function (compressor, first_in_statement) {
+    if (is_nullish_shortcircuited(this, compressor)) {
+        return this.expression.drop_side_effect_free(compressor, first_in_statement);
+    }
+
+    if (!this.is_callee_pure(compressor)) {
+        if (this.expression.is_call_pure(compressor)) {
+            var exprs = this.args.slice();
+            exprs.unshift(this.expression.expression);
+            exprs = trim(exprs, compressor, first_in_statement);
+            return exprs && make_sequence(this, exprs);
+        }
+        if (is_func_expr(this.expression)
+            && (!this.expression.name || !this.expression.name.definition().references.length)) {
+            var node = this.clone();
+            node.expression.process_expression(false, compressor);
+            return node;
+        }
+        return this;
+    }
+
+    var args = trim(this.args, compressor, first_in_statement);
+    return args && make_sequence(this, args);
+});
+
+def_drop_side_effect_free(AST_Accessor, return_null);
+
+def_drop_side_effect_free(AST_Function, return_null);
+
+def_drop_side_effect_free(AST_Arrow, return_null);
+
+def_drop_side_effect_free(AST_Class, function (compressor) {
+    const with_effects = [];
+    const trimmed_extends = this.extends && this.extends.drop_side_effect_free(compressor);
+    if (trimmed_extends)
+        with_effects.push(trimmed_extends);
+    for (const prop of this.properties) {
+        const trimmed_prop = prop.drop_side_effect_free(compressor);
+        if (trimmed_prop)
+            with_effects.push(trimmed_prop);
+    }
+    if (!with_effects.length)
+        return null;
+    return make_sequence(this, with_effects);
+});
+
+def_drop_side_effect_free(AST_Binary, function (compressor, first_in_statement) {
+    var right = this.right.drop_side_effect_free(compressor);
+    if (!right)
+        return this.left.drop_side_effect_free(compressor, first_in_statement);
+    if (lazy_op.has(this.operator)) {
+        if (right === this.right)
+            return this;
+        var node = this.clone();
+        node.right = right;
+        return node;
+    } else {
+        var left = this.left.drop_side_effect_free(compressor, first_in_statement);
+        if (!left)
+            return this.right.drop_side_effect_free(compressor, first_in_statement);
+        return make_sequence(this, [left, right]);
+    }
+});
+
+def_drop_side_effect_free(AST_Assign, function (compressor) {
+    if (this.logical)
+        return this;
+
+    var left = this.left;
+    if (left.has_side_effects(compressor)
+        || compressor.has_directive("use strict")
+        && left instanceof AST_PropAccess
+        && left.expression.is_constant()) {
+        return this;
+    }
+    set_flag(this, WRITE_ONLY);
+    while (left instanceof AST_PropAccess) {
+        left = left.expression;
+    }
+    if (left.is_constant_expression(compressor.find_parent(AST_Scope))) {
+        return this.right.drop_side_effect_free(compressor);
+    }
+    return this;
+});
+
+def_drop_side_effect_free(AST_Conditional, function (compressor) {
+    var consequent = this.consequent.drop_side_effect_free(compressor);
+    var alternative = this.alternative.drop_side_effect_free(compressor);
+    if (consequent === this.consequent && alternative === this.alternative)
+        return this;
+    if (!consequent)
+        return alternative ? make_node(AST_Binary, this, {
+            operator: "||",
+            left: this.condition,
+            right: alternative
+        }) : this.condition.drop_side_effect_free(compressor);
+    if (!alternative)
+        return make_node(AST_Binary, this, {
+            operator: "&&",
+            left: this.condition,
+            right: consequent
+        });
+    var node = this.clone();
+    node.consequent = consequent;
+    node.alternative = alternative;
+    return node;
+});
+
+def_drop_side_effect_free(AST_Unary, function (compressor, first_in_statement) {
+    if (unary_side_effects.has(this.operator)) {
+        if (!this.expression.has_side_effects(compressor)) {
+            set_flag(this, WRITE_ONLY);
+        } else {
+            clear_flag(this, WRITE_ONLY);
+        }
+        return this;
+    }
+    if (this.operator == "typeof" && this.expression instanceof AST_SymbolRef)
+        return null;
+    var expression = this.expression.drop_side_effect_free(compressor, first_in_statement);
+    if (first_in_statement && expression && is_iife_call(expression)) {
+        if (expression === this.expression && this.operator == "!")
+            return this;
+        return expression.negate(compressor, first_in_statement);
+    }
+    return expression;
+});
+
+def_drop_side_effect_free(AST_SymbolRef, function (compressor) {
+    const safe_access = this.is_declared(compressor)
+        || pure_prop_access_globals.has(this.name);
+    return safe_access ? null : this;
+});
+
+def_drop_side_effect_free(AST_Object, function (compressor, first_in_statement) {
+    var values = trim(this.properties, compressor, first_in_statement);
+    return values && make_sequence(this, values);
+});
+
+def_drop_side_effect_free(AST_ObjectProperty, function (compressor, first_in_statement) {
+    const computed_key = this instanceof AST_ObjectKeyVal && this.key instanceof AST_Node;
+    const key = computed_key && this.key.drop_side_effect_free(compressor, first_in_statement);
+    const value = this.value && this.value.drop_side_effect_free(compressor, first_in_statement);
+    if (key && value) {
+        return make_sequence(this, [key, value]);
+    }
+    return key || value;
+});
+
+def_drop_side_effect_free(AST_ClassProperty, function (compressor) {
+    const key = this.computed_key() && this.key.drop_side_effect_free(compressor);
+
+    const value = this.static && this.value
+        && this.value.drop_side_effect_free(compressor);
+
+    if (key && value)
+        return make_sequence(this, [key, value]);
+    return key || value || null;
+});
+
+def_drop_side_effect_free(AST_ConciseMethod, function () {
+    return this.computed_key() ? this.key : null;
+});
+
+def_drop_side_effect_free(AST_ObjectGetter, function () {
+    return this.computed_key() ? this.key : null;
+});
+
+def_drop_side_effect_free(AST_ObjectSetter, function () {
+    return this.computed_key() ? this.key : null;
+});
+
+def_drop_side_effect_free(AST_Array, function (compressor, first_in_statement) {
+    var values = trim(this.elements, compressor, first_in_statement);
+    return values && make_sequence(this, values);
+});
+
+def_drop_side_effect_free(AST_Dot, function (compressor, first_in_statement) {
+    if (is_nullish_shortcircuited(this, compressor)) {
+        return this.expression.drop_side_effect_free(compressor, first_in_statement);
+    }
+    if (this.expression.may_throw_on_access(compressor)) return this;
+
+    return this.expression.drop_side_effect_free(compressor, first_in_statement);
+});
+
+def_drop_side_effect_free(AST_Sub, function (compressor, first_in_statement) {
+    if (is_nullish_shortcircuited(this, compressor)) {
+        return this.expression.drop_side_effect_free(compressor, first_in_statement);
+    }
+    if (this.expression.may_throw_on_access(compressor)) return this;
+
+    var expression = this.expression.drop_side_effect_free(compressor, first_in_statement);
+    if (!expression)
+        return this.property.drop_side_effect_free(compressor, first_in_statement);
+    var property = this.property.drop_side_effect_free(compressor);
+    if (!property)
+        return expression;
+    return make_sequence(this, [expression, property]);
+});
+
+def_drop_side_effect_free(AST_Chain, function (compressor, first_in_statement) {
+    return this.expression.drop_side_effect_free(compressor, first_in_statement);
+});
+
+def_drop_side_effect_free(AST_Sequence, function (compressor) {
+    var last = this.tail_node();
+    var expr = last.drop_side_effect_free(compressor);
+    if (expr === last)
+        return this;
+    var expressions = this.expressions.slice(0, -1);
+    if (expr)
+        expressions.push(expr);
+    if (!expressions.length) {
+        return make_node(AST_Number, this, { value: 0 });
+    }
+    return make_sequence(this, expressions);
+});
+
+def_drop_side_effect_free(AST_Expansion, function (compressor, first_in_statement) {
+    return this.expression.drop_side_effect_free(compressor, first_in_statement);
+});
+
+def_drop_side_effect_free(AST_TemplateSegment, return_null);
+
+def_drop_side_effect_free(AST_TemplateString, function (compressor) {
+    var values = trim(this.segments, compressor, first_in_statement);
+    return values && make_sequence(this, values);
+});
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/evaluate.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/evaluate.js
new file mode 100644
index 0000000..a9c52e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/evaluate.js
@@ -0,0 +1,461 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+    HOP,
+    makePredicate,
+    return_this,
+    string_template,
+    regexp_source_fix
+} from "../utils/index.js";
+import {
+    AST_Array,
+    AST_BigInt,
+    AST_Binary,
+    AST_Call,
+    AST_Chain,
+    AST_Class,
+    AST_Conditional,
+    AST_Constant,
+    AST_Dot,
+    AST_Expansion,
+    AST_Function,
+    AST_Lambda,
+    AST_New,
+    AST_Node,
+    AST_Object,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Statement,
+    AST_Symbol,
+    AST_SymbolRef,
+    AST_TemplateString,
+    AST_UnaryPrefix,
+    AST_With,
+} from "../ast.js";
+import { is_undeclared_ref} from "./inference.js";
+import { is_pure_native_value, is_pure_native_fn, is_pure_native_method } from "./native-objects.js";
+
+// methods to evaluate a constant expression
+
+function def_eval(node, func) {
+    node.DEFMETHOD("_eval", func);
+}
+
+// Used to propagate a nullish short-circuit signal upwards through the chain.
+export const nullish = Symbol("This AST_Chain is nullish");
+
+// If the node has been successfully reduced to a constant,
+// then its value is returned; otherwise the element itself
+// is returned.
+// They can be distinguished as constant value is never a
+// descendant of AST_Node.
+AST_Node.DEFMETHOD("evaluate", function (compressor) {
+    if (!compressor.option("evaluate"))
+        return this;
+    var val = this._eval(compressor, 1);
+    if (!val || val instanceof RegExp)
+        return val;
+    if (typeof val == "function" || typeof val == "object" || val == nullish)
+        return this;
+    return val;
+});
+
+var unaryPrefix = makePredicate("! ~ - + void");
+AST_Node.DEFMETHOD("is_constant", function () {
+    // Accomodate when compress option evaluate=false
+    // as well as the common constant expressions !0 and -1
+    if (this instanceof AST_Constant) {
+        return !(this instanceof AST_RegExp);
+    } else {
+        return this instanceof AST_UnaryPrefix
+            && this.expression instanceof AST_Constant
+            && unaryPrefix.has(this.operator);
+    }
+});
+
+def_eval(AST_Statement, function () {
+    throw new Error(string_template("Cannot evaluate a statement [{file}:{line},{col}]", this.start));
+});
+
+def_eval(AST_Lambda, return_this);
+def_eval(AST_Class, return_this);
+def_eval(AST_Node, return_this);
+def_eval(AST_Constant, function () {
+    return this.getValue();
+});
+
+def_eval(AST_BigInt, return_this);
+
+def_eval(AST_RegExp, function (compressor) {
+    let evaluated = compressor.evaluated_regexps.get(this);
+    if (evaluated === undefined) {
+        try {
+            evaluated = (0, eval)(this.print_to_string());
+        } catch (e) {
+            evaluated = null;
+        }
+        compressor.evaluated_regexps.set(this, evaluated);
+    }
+    return evaluated || this;
+});
+
+def_eval(AST_TemplateString, function () {
+    if (this.segments.length !== 1) return this;
+    return this.segments[0].value;
+});
+
+def_eval(AST_Function, function (compressor) {
+    if (compressor.option("unsafe")) {
+        var fn = function () { };
+        fn.node = this;
+        fn.toString = () => this.print_to_string();
+        return fn;
+    }
+    return this;
+});
+
+def_eval(AST_Array, function (compressor, depth) {
+    if (compressor.option("unsafe")) {
+        var elements = [];
+        for (var i = 0, len = this.elements.length; i < len; i++) {
+            var element = this.elements[i];
+            var value = element._eval(compressor, depth);
+            if (element === value)
+                return this;
+            elements.push(value);
+        }
+        return elements;
+    }
+    return this;
+});
+
+def_eval(AST_Object, function (compressor, depth) {
+    if (compressor.option("unsafe")) {
+        var val = {};
+        for (var i = 0, len = this.properties.length; i < len; i++) {
+            var prop = this.properties[i];
+            if (prop instanceof AST_Expansion)
+                return this;
+            var key = prop.key;
+            if (key instanceof AST_Symbol) {
+                key = key.name;
+            } else if (key instanceof AST_Node) {
+                key = key._eval(compressor, depth);
+                if (key === prop.key)
+                    return this;
+            }
+            if (typeof Object.prototype[key] === "function") {
+                return this;
+            }
+            if (prop.value instanceof AST_Function)
+                continue;
+            val[key] = prop.value._eval(compressor, depth);
+            if (val[key] === prop.value)
+                return this;
+        }
+        return val;
+    }
+    return this;
+});
+
+var non_converting_unary = makePredicate("! typeof void");
+def_eval(AST_UnaryPrefix, function (compressor, depth) {
+    var e = this.expression;
+    // Function would be evaluated to an array and so typeof would
+    // incorrectly return 'object'. Hence making is a special case.
+    if (compressor.option("typeofs")
+        && this.operator == "typeof"
+        && (e instanceof AST_Lambda
+            || e instanceof AST_SymbolRef
+            && e.fixed_value() instanceof AST_Lambda)) {
+        return typeof function () { };
+    }
+    if (!non_converting_unary.has(this.operator))
+        depth++;
+    e = e._eval(compressor, depth);
+    if (e === this.expression)
+        return this;
+    switch (this.operator) {
+        case "!": return !e;
+        case "typeof":
+            // typeof <RegExp> returns "object" or "function" on different platforms
+            // so cannot evaluate reliably
+            if (e instanceof RegExp)
+                return this;
+            return typeof e;
+        case "void": return void e;
+        case "~": return ~e;
+        case "-": return -e;
+        case "+": return +e;
+    }
+    return this;
+});
+
+var non_converting_binary = makePredicate("&& || ?? === !==");
+const identity_comparison = makePredicate("== != === !==");
+const has_identity = value => typeof value === "object"
+    || typeof value === "function"
+    || typeof value === "symbol";
+
+def_eval(AST_Binary, function (compressor, depth) {
+    if (!non_converting_binary.has(this.operator))
+        depth++;
+
+    var left = this.left._eval(compressor, depth);
+    if (left === this.left)
+        return this;
+    var right = this.right._eval(compressor, depth);
+    if (right === this.right)
+        return this;
+    var result;
+
+    if (left != null
+        && right != null
+        && identity_comparison.has(this.operator)
+        && has_identity(left)
+        && has_identity(right)
+        && typeof left === typeof right) {
+        // Do not compare by reference
+        return this;
+    }
+
+    switch (this.operator) {
+        case "&&": result = left && right; break;
+        case "||": result = left || right; break;
+        case "??": result = left != null ? left : right; break;
+        case "|": result = left | right; break;
+        case "&": result = left & right; break;
+        case "^": result = left ^ right; break;
+        case "+": result = left + right; break;
+        case "*": result = left * right; break;
+        case "**": result = Math.pow(left, right); break;
+        case "/": result = left / right; break;
+        case "%": result = left % right; break;
+        case "-": result = left - right; break;
+        case "<<": result = left << right; break;
+        case ">>": result = left >> right; break;
+        case ">>>": result = left >>> right; break;
+        case "==": result = left == right; break;
+        case "===": result = left === right; break;
+        case "!=": result = left != right; break;
+        case "!==": result = left !== right; break;
+        case "<": result = left < right; break;
+        case "<=": result = left <= right; break;
+        case ">": result = left > right; break;
+        case ">=": result = left >= right; break;
+        default:
+            return this;
+    }
+    if (isNaN(result) && compressor.find_parent(AST_With)) {
+        // leave original expression as is
+        return this;
+    }
+    return result;
+});
+
+def_eval(AST_Conditional, function (compressor, depth) {
+    var condition = this.condition._eval(compressor, depth);
+    if (condition === this.condition)
+        return this;
+    var node = condition ? this.consequent : this.alternative;
+    var value = node._eval(compressor, depth);
+    return value === node ? this : value;
+});
+
+// Set of AST_SymbolRef which are currently being evaluated.
+// Avoids infinite recursion of ._eval()
+const reentrant_ref_eval = new Set();
+def_eval(AST_SymbolRef, function (compressor, depth) {
+    if (reentrant_ref_eval.has(this))
+        return this;
+
+    var fixed = this.fixed_value();
+    if (!fixed)
+        return this;
+
+    reentrant_ref_eval.add(this);
+    const value = fixed._eval(compressor, depth);
+    reentrant_ref_eval.delete(this);
+
+    if (value === fixed)
+        return this;
+
+    if (value && typeof value == "object") {
+        var escaped = this.definition().escaped;
+        if (escaped && depth > escaped)
+            return this;
+    }
+    return value;
+});
+
+const global_objs = { Array, Math, Number, Object, String };
+
+const regexp_flags = new Set([
+    "dotAll",
+    "global",
+    "ignoreCase",
+    "multiline",
+    "sticky",
+    "unicode",
+]);
+
+def_eval(AST_PropAccess, function (compressor, depth) {
+    const obj = this.expression._eval(compressor, depth);
+    if (obj === nullish || (this.optional && obj == null)) return nullish;
+    if (compressor.option("unsafe")) {
+        var key = this.property;
+        if (key instanceof AST_Node) {
+            key = key._eval(compressor, depth);
+            if (key === this.property)
+                return this;
+        }
+        var exp = this.expression;
+        var val;
+        if (is_undeclared_ref(exp)) {
+
+            var aa;
+            var first_arg = exp.name === "hasOwnProperty"
+                && key === "call"
+                && (aa = compressor.parent() && compressor.parent().args)
+                && (aa && aa[0]
+                    && aa[0].evaluate(compressor));
+
+            first_arg = first_arg instanceof AST_Dot ? first_arg.expression : first_arg;
+
+            if (first_arg == null || first_arg.thedef && first_arg.thedef.undeclared) {
+                return this.clone();
+            }
+            if (!is_pure_native_value(exp.name, key))
+                return this;
+            val = global_objs[exp.name];
+        } else {
+            val = exp._eval(compressor, depth + 1);
+            if (val instanceof RegExp) {
+                if (key == "source") {
+                    return regexp_source_fix(val.source);
+                } else if (key == "flags" || regexp_flags.has(key)) {
+                    return val[key];
+                }
+            }
+            if (!val || val === exp || !HOP(val, key))
+                return this;
+            if (typeof val == "function")
+                switch (key) {
+                    case "name":
+                        return val.node.name ? val.node.name.name : "";
+                    case "length":
+                        return val.node.length_property();
+                    default:
+                        return this;
+                }
+        }
+        return val[key];
+    }
+    return this;
+});
+
+def_eval(AST_Chain, function (compressor, depth) {
+    const evaluated = this.expression._eval(compressor, depth);
+    return evaluated === nullish
+        ? undefined
+        : evaluated === this.expression
+          ? this
+          : evaluated;
+});
+
+def_eval(AST_Call, function (compressor, depth) {
+    var exp = this.expression;
+
+    const callee = exp._eval(compressor, depth);
+    if (callee === nullish || (this.optional && callee == null)) return nullish;
+
+    if (compressor.option("unsafe") && exp instanceof AST_PropAccess) {
+        var key = exp.property;
+        if (key instanceof AST_Node) {
+            key = key._eval(compressor, depth);
+            if (key === exp.property)
+                return this;
+        }
+        var val;
+        var e = exp.expression;
+        if (is_undeclared_ref(e)) {
+            var first_arg = e.name === "hasOwnProperty" &&
+                key === "call" &&
+                (this.args[0] && this.args[0].evaluate(compressor));
+
+            first_arg = first_arg instanceof AST_Dot ? first_arg.expression : first_arg;
+
+            if ((first_arg == null || first_arg.thedef && first_arg.thedef.undeclared)) {
+                return this.clone();
+            }
+            if (!is_pure_native_fn(e.name, key)) return this;
+            val = global_objs[e.name];
+        } else {
+            val = e._eval(compressor, depth + 1);
+            if (val === e || !val)
+                return this;
+            if (!is_pure_native_method(val.constructor.name, key))
+                return this;
+        }
+        var args = [];
+        for (var i = 0, len = this.args.length; i < len; i++) {
+            var arg = this.args[i];
+            var value = arg._eval(compressor, depth);
+            if (arg === value)
+                return this;
+            if (arg instanceof AST_Lambda)
+                return this;
+            args.push(value);
+        }
+        try {
+            return val[key].apply(val, args);
+        } catch (ex) {
+            // We don't really care
+        }
+    }
+    return this;
+});
+
+// Also a subclass of AST_Call
+def_eval(AST_New, return_this);
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/index.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/index.js
new file mode 100644
index 0000000..8b901a3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/index.js
@@ -0,0 +1,4667 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+    AST_Accessor,
+    AST_Array,
+    AST_Arrow,
+    AST_Assign,
+    AST_BigInt,
+    AST_Binary,
+    AST_Block,
+    AST_BlockStatement,
+    AST_Boolean,
+    AST_Break,
+    AST_Call,
+    AST_Catch,
+    AST_Chain,
+    AST_Class,
+    AST_ClassExpression,
+    AST_ClassProperty,
+    AST_ConciseMethod,
+    AST_Conditional,
+    AST_Const,
+    AST_Constant,
+    AST_Debugger,
+    AST_Default,
+    AST_DefaultAssign,
+    AST_DefClass,
+    AST_Definitions,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Do,
+    AST_Dot,
+    AST_DWLoop,
+    AST_EmptyStatement,
+    AST_Exit,
+    AST_Expansion,
+    AST_Export,
+    AST_False,
+    AST_For,
+    AST_ForIn,
+    AST_Function,
+    AST_Hole,
+    AST_If,
+    AST_Import,
+    AST_Infinity,
+    AST_IterationStatement,
+    AST_LabeledStatement,
+    AST_Lambda,
+    AST_Let,
+    AST_NaN,
+    AST_New,
+    AST_Node,
+    AST_Null,
+    AST_Number,
+    AST_Object,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_PrefixedTemplateString,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Return,
+    AST_Scope,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Statement,
+    AST_String,
+    AST_Sub,
+    AST_Switch,
+    AST_SwitchBranch,
+    AST_Symbol,
+    AST_SymbolBlockDeclaration,
+    AST_SymbolCatch,
+    AST_SymbolClassProperty,
+    AST_SymbolDeclaration,
+    AST_SymbolDefun,
+    AST_SymbolExport,
+    AST_SymbolFunarg,
+    AST_SymbolLambda,
+    AST_SymbolLet,
+    AST_SymbolMethod,
+    AST_SymbolRef,
+    AST_SymbolVar,
+    AST_TemplateString,
+    AST_This,
+    AST_Toplevel,
+    AST_True,
+    AST_Try,
+    AST_Unary,
+    AST_UnaryPostfix,
+    AST_UnaryPrefix,
+    AST_Undefined,
+    AST_Var,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield,
+
+    TreeTransformer,
+    TreeWalker,
+    walk,
+    walk_abort,
+    walk_parent,
+
+    _INLINE,
+    _NOINLINE,
+    _PURE
+} from "../ast.js";
+import {
+    defaults,
+    HOP,
+    keep_name,
+    make_node,
+    makePredicate,
+    map_add,
+    MAP,
+    member,
+    remove,
+    return_false,
+    return_true,
+    regexp_source_fix,
+    has_annotation
+} from "../utils/index.js";
+import { first_in_statement } from "../utils/first_in_statement.js";
+import { equivalent_to } from "../equivalent-to.js";
+import {
+    is_basic_identifier_string,
+    JS_Parse_Error,
+    parse,
+    PRECEDENCE,
+} from "../parse.js";
+import { OutputStream } from "../output.js";
+import {
+    base54,
+    SymbolDef,
+} from "../scope.js";
+import "../size.js";
+
+import "./evaluate.js";
+import "./drop-side-effect-free.js";
+import "./reduce-vars.js";
+import {
+    is_undeclared_ref,
+    lazy_op,
+    is_nullish,
+    is_undefined,
+    is_lhs,
+    aborts,
+} from "./inference.js";
+import {
+    SQUEEZED,
+    OPTIMIZED,
+    INLINED,
+    CLEAR_BETWEEN_PASSES,
+    TOP,
+    WRITE_ONLY,
+    UNDEFINED,
+    UNUSED,
+    TRUTHY,
+    FALSY,
+
+    has_flag,
+    set_flag,
+    clear_flag,
+} from "./compressor-flags.js";
+import {
+    make_sequence,
+    best_of,
+    best_of_expression,
+    make_node_from_constant,
+    merge_sequence,
+    get_simple_key,
+    has_break_or_continue,
+    maintain_this_binding,
+    identifier_atom,
+    is_identifier_atom,
+    is_func_expr,
+    is_ref_of,
+    can_be_evicted_from_block,
+    as_statement_array,
+    is_iife_call,
+    is_recursive_ref
+} from "./common.js";
+import { tighten_body, trim_unreachable_code } from "./tighten-body.js";
+
+class Compressor extends TreeWalker {
+    constructor(options, { false_by_default = false, mangle_options = false }) {
+        super();
+        if (options.defaults !== undefined && !options.defaults) false_by_default = true;
+        this.options = defaults(options, {
+            arguments     : false,
+            arrows        : !false_by_default,
+            booleans      : !false_by_default,
+            booleans_as_integers : false,
+            collapse_vars : !false_by_default,
+            comparisons   : !false_by_default,
+            computed_props: !false_by_default,
+            conditionals  : !false_by_default,
+            dead_code     : !false_by_default,
+            defaults      : true,
+            directives    : !false_by_default,
+            drop_console  : false,
+            drop_debugger : !false_by_default,
+            ecma          : 5,
+            evaluate      : !false_by_default,
+            expression    : false,
+            global_defs   : false,
+            hoist_funs    : false,
+            hoist_props   : !false_by_default,
+            hoist_vars    : false,
+            ie8           : false,
+            if_return     : !false_by_default,
+            inline        : !false_by_default,
+            join_vars     : !false_by_default,
+            keep_classnames: false,
+            keep_fargs    : true,
+            keep_fnames   : false,
+            keep_infinity : false,
+            loops         : !false_by_default,
+            module        : false,
+            negate_iife   : !false_by_default,
+            passes        : 1,
+            properties    : !false_by_default,
+            pure_getters  : !false_by_default && "strict",
+            pure_funcs    : null,
+            reduce_funcs  : !false_by_default,
+            reduce_vars   : !false_by_default,
+            sequences     : !false_by_default,
+            side_effects  : !false_by_default,
+            switches      : !false_by_default,
+            top_retain    : null,
+            toplevel      : !!(options && options["top_retain"]),
+            typeofs       : !false_by_default,
+            unsafe        : false,
+            unsafe_arrows : false,
+            unsafe_comps  : false,
+            unsafe_Function: false,
+            unsafe_math   : false,
+            unsafe_symbols: false,
+            unsafe_methods: false,
+            unsafe_proto  : false,
+            unsafe_regexp : false,
+            unsafe_undefined: false,
+            unused        : !false_by_default,
+            warnings      : false  // legacy
+        }, true);
+        var global_defs = this.options["global_defs"];
+        if (typeof global_defs == "object") for (var key in global_defs) {
+            if (key[0] === "@" && HOP(global_defs, key)) {
+                global_defs[key.slice(1)] = parse(global_defs[key], {
+                    expression: true
+                });
+            }
+        }
+        if (this.options["inline"] === true) this.options["inline"] = 3;
+        var pure_funcs = this.options["pure_funcs"];
+        if (typeof pure_funcs == "function") {
+            this.pure_funcs = pure_funcs;
+        } else {
+            this.pure_funcs = pure_funcs ? function(node) {
+                return !pure_funcs.includes(node.expression.print_to_string());
+            } : return_true;
+        }
+        var top_retain = this.options["top_retain"];
+        if (top_retain instanceof RegExp) {
+            this.top_retain = function(def) {
+                return top_retain.test(def.name);
+            };
+        } else if (typeof top_retain == "function") {
+            this.top_retain = top_retain;
+        } else if (top_retain) {
+            if (typeof top_retain == "string") {
+                top_retain = top_retain.split(/,/);
+            }
+            this.top_retain = function(def) {
+                return top_retain.includes(def.name);
+            };
+        }
+        if (this.options["module"]) {
+            this.directives["use strict"] = true;
+            this.options["toplevel"] = true;
+        }
+        var toplevel = this.options["toplevel"];
+        this.toplevel = typeof toplevel == "string" ? {
+            funcs: /funcs/.test(toplevel),
+            vars: /vars/.test(toplevel)
+        } : {
+            funcs: toplevel,
+            vars: toplevel
+        };
+        var sequences = this.options["sequences"];
+        this.sequences_limit = sequences == 1 ? 800 : sequences | 0;
+        this.evaluated_regexps = new Map();
+        this._toplevel = undefined;
+        this.mangle_options = mangle_options;
+    }
+
+    option(key) {
+        return this.options[key];
+    }
+
+    exposed(def) {
+        if (def.export) return true;
+        if (def.global) for (var i = 0, len = def.orig.length; i < len; i++)
+            if (!this.toplevel[def.orig[i] instanceof AST_SymbolDefun ? "funcs" : "vars"])
+                return true;
+        return false;
+    }
+
+    in_boolean_context() {
+        if (!this.option("booleans")) return false;
+        var self = this.self();
+        for (var i = 0, p; p = this.parent(i); i++) {
+            if (p instanceof AST_SimpleStatement
+                || p instanceof AST_Conditional && p.condition === self
+                || p instanceof AST_DWLoop && p.condition === self
+                || p instanceof AST_For && p.condition === self
+                || p instanceof AST_If && p.condition === self
+                || p instanceof AST_UnaryPrefix && p.operator == "!" && p.expression === self) {
+                return true;
+            }
+            if (
+                p instanceof AST_Binary
+                    && (
+                        p.operator == "&&"
+                        || p.operator == "||"
+                        || p.operator == "??"
+                    )
+                || p instanceof AST_Conditional
+                || p.tail_node() === self
+            ) {
+                self = p;
+            } else {
+                return false;
+            }
+        }
+    }
+
+    get_toplevel() {
+        return this._toplevel;
+    }
+
+    compress(toplevel) {
+        toplevel = toplevel.resolve_defines(this);
+        this._toplevel = toplevel;
+        if (this.option("expression")) {
+            this._toplevel.process_expression(true);
+        }
+        var passes = +this.options.passes || 1;
+        var min_count = 1 / 0;
+        var stopping = false;
+        var nth_identifier = this.mangle_options && this.mangle_options.nth_identifier || base54;
+        var mangle = { ie8: this.option("ie8"), nth_identifier: nth_identifier };
+        for (var pass = 0; pass < passes; pass++) {
+            this._toplevel.figure_out_scope(mangle);
+            if (pass === 0 && this.option("drop_console")) {
+                // must be run before reduce_vars and compress pass
+                this._toplevel = this._toplevel.drop_console();
+            }
+            if (pass > 0 || this.option("reduce_vars")) {
+                this._toplevel.reset_opt_flags(this);
+            }
+            this._toplevel = this._toplevel.transform(this);
+            if (passes > 1) {
+                let count = 0;
+                walk(this._toplevel, () => { count++; });
+                if (count < min_count) {
+                    min_count = count;
+                    stopping = false;
+                } else if (stopping) {
+                    break;
+                } else {
+                    stopping = true;
+                }
+            }
+        }
+        if (this.option("expression")) {
+            this._toplevel.process_expression(false);
+        }
+        toplevel = this._toplevel;
+        this._toplevel = undefined;
+        return toplevel;
+    }
+
+    before(node, descend) {
+        if (has_flag(node, SQUEEZED)) return node;
+        var was_scope = false;
+        if (node instanceof AST_Scope) {
+            node = node.hoist_properties(this);
+            node = node.hoist_declarations(this);
+            was_scope = true;
+        }
+        // Before https://github.com/mishoo/UglifyJS2/pull/1602 AST_Node.optimize()
+        // would call AST_Node.transform() if a different instance of AST_Node is
+        // produced after def_optimize().
+        // This corrupts TreeWalker.stack, which cause AST look-ups to malfunction.
+        // Migrate and defer all children's AST_Node.transform() to below, which
+        // will now happen after this parent AST_Node has been properly substituted
+        // thus gives a consistent AST snapshot.
+        descend(node, this);
+        // Existing code relies on how AST_Node.optimize() worked, and omitting the
+        // following replacement call would result in degraded efficiency of both
+        // output and performance.
+        descend(node, this);
+        var opt = node.optimize(this);
+        if (was_scope && opt instanceof AST_Scope) {
+            opt.drop_unused(this);
+            descend(opt, this);
+        }
+        if (opt === node) set_flag(opt, SQUEEZED);
+        return opt;
+    }
+}
+
+function def_optimize(node, optimizer) {
+    node.DEFMETHOD("optimize", function(compressor) {
+        var self = this;
+        if (has_flag(self, OPTIMIZED)) return self;
+        if (compressor.has_directive("use asm")) return self;
+        var opt = optimizer(self, compressor);
+        set_flag(opt, OPTIMIZED);
+        return opt;
+    });
+}
+
+def_optimize(AST_Node, function(self) {
+    return self;
+});
+
+AST_Toplevel.DEFMETHOD("drop_console", function() {
+    return this.transform(new TreeTransformer(function(self) {
+        if (self.TYPE == "Call") {
+            var exp = self.expression;
+            if (exp instanceof AST_PropAccess) {
+                var name = exp.expression;
+                while (name.expression) {
+                    name = name.expression;
+                }
+                if (is_undeclared_ref(name) && name.name == "console") {
+                    return make_node(AST_Undefined, self);
+                }
+            }
+        }
+    }));
+});
+
+AST_Node.DEFMETHOD("equivalent_to", function(node) {
+    return equivalent_to(this, node);
+});
+
+AST_Scope.DEFMETHOD("process_expression", function(insert, compressor) {
+    var self = this;
+    var tt = new TreeTransformer(function(node) {
+        if (insert && node instanceof AST_SimpleStatement) {
+            return make_node(AST_Return, node, {
+                value: node.body
+            });
+        }
+        if (!insert && node instanceof AST_Return) {
+            if (compressor) {
+                var value = node.value && node.value.drop_side_effect_free(compressor, true);
+                return value
+                    ? make_node(AST_SimpleStatement, node, { body: value })
+                    : make_node(AST_EmptyStatement, node);
+            }
+            return make_node(AST_SimpleStatement, node, {
+                body: node.value || make_node(AST_UnaryPrefix, node, {
+                    operator: "void",
+                    expression: make_node(AST_Number, node, {
+                        value: 0
+                    })
+                })
+            });
+        }
+        if (node instanceof AST_Class || node instanceof AST_Lambda && node !== self) {
+            return node;
+        }
+        if (node instanceof AST_Block) {
+            var index = node.body.length - 1;
+            if (index >= 0) {
+                node.body[index] = node.body[index].transform(tt);
+            }
+        } else if (node instanceof AST_If) {
+            node.body = node.body.transform(tt);
+            if (node.alternative) {
+                node.alternative = node.alternative.transform(tt);
+            }
+        } else if (node instanceof AST_With) {
+            node.body = node.body.transform(tt);
+        }
+        return node;
+    });
+    self.transform(tt);
+});
+
+AST_Toplevel.DEFMETHOD("reset_opt_flags", function(compressor) {
+    const self = this;
+    const reduce_vars = compressor.option("reduce_vars");
+
+    const preparation = new TreeWalker(function(node, descend) {
+        clear_flag(node, CLEAR_BETWEEN_PASSES);
+        if (reduce_vars) {
+            if (compressor.top_retain
+                && node instanceof AST_Defun  // Only functions are retained
+                && preparation.parent() === self
+            ) {
+                set_flag(node, TOP);
+            }
+            return node.reduce_vars(preparation, descend, compressor);
+        }
+    });
+    // Stack of look-up tables to keep track of whether a `SymbolDef` has been
+    // properly assigned before use:
+    // - `push()` & `pop()` when visiting conditional branches
+    preparation.safe_ids = Object.create(null);
+    preparation.in_loop = null;
+    preparation.loop_ids = new Map();
+    preparation.defs_to_safe_ids = new Map();
+    self.walk(preparation);
+});
+
+AST_Symbol.DEFMETHOD("fixed_value", function() {
+    var fixed = this.thedef.fixed;
+    if (!fixed || fixed instanceof AST_Node) return fixed;
+    return fixed();
+});
+
+AST_SymbolRef.DEFMETHOD("is_immutable", function() {
+    var orig = this.definition().orig;
+    return orig.length == 1 && orig[0] instanceof AST_SymbolLambda;
+});
+
+function find_scope(tw) {
+    for (let i = 0;;i++) {
+        const p = tw.parent(i);
+        if (p instanceof AST_Toplevel) return p;
+        if (p instanceof AST_Lambda) return p;
+        if (p.block_scope) return p.block_scope;
+    }
+}
+
+function find_variable(compressor, name) {
+    var scope, i = 0;
+    while (scope = compressor.parent(i++)) {
+        if (scope instanceof AST_Scope) break;
+        if (scope instanceof AST_Catch && scope.argname) {
+            scope = scope.argname.definition().scope;
+            break;
+        }
+    }
+    return scope.find_variable(name);
+}
+
+function is_empty(thing) {
+    if (thing === null) return true;
+    if (thing instanceof AST_EmptyStatement) return true;
+    if (thing instanceof AST_BlockStatement) return thing.body.length == 0;
+    return false;
+}
+
+var global_names = makePredicate("Array Boolean clearInterval clearTimeout console Date decodeURI decodeURIComponent encodeURI encodeURIComponent Error escape eval EvalError Function isFinite isNaN JSON Math Number parseFloat parseInt RangeError ReferenceError RegExp Object setInterval setTimeout String SyntaxError TypeError unescape URIError");
+AST_SymbolRef.DEFMETHOD("is_declared", function(compressor) {
+    return !this.definition().undeclared
+        || compressor.option("unsafe") && global_names.has(this.name);
+});
+
+/* -----[ optimizers ]----- */
+
+var directives = new Set(["use asm", "use strict"]);
+def_optimize(AST_Directive, function(self, compressor) {
+    if (compressor.option("directives")
+        && (!directives.has(self.value) || compressor.has_directive(self.value) !== self)) {
+        return make_node(AST_EmptyStatement, self);
+    }
+    return self;
+});
+
+def_optimize(AST_Debugger, function(self, compressor) {
+    if (compressor.option("drop_debugger"))
+        return make_node(AST_EmptyStatement, self);
+    return self;
+});
+
+def_optimize(AST_LabeledStatement, function(self, compressor) {
+    if (self.body instanceof AST_Break
+        && compressor.loopcontrol_target(self.body) === self.body) {
+        return make_node(AST_EmptyStatement, self);
+    }
+    return self.label.references.length == 0 ? self.body : self;
+});
+
+def_optimize(AST_Block, function(self, compressor) {
+    tighten_body(self.body, compressor);
+    return self;
+});
+
+function can_be_extracted_from_if_block(node) {
+    return !(
+        node instanceof AST_Const
+        || node instanceof AST_Let
+        || node instanceof AST_Class
+    );
+}
+
+def_optimize(AST_BlockStatement, function(self, compressor) {
+    tighten_body(self.body, compressor);
+    switch (self.body.length) {
+      case 1:
+        if (!compressor.has_directive("use strict")
+            && compressor.parent() instanceof AST_If
+            && can_be_extracted_from_if_block(self.body[0])
+            || can_be_evicted_from_block(self.body[0])) {
+            return self.body[0];
+        }
+        break;
+      case 0: return make_node(AST_EmptyStatement, self);
+    }
+    return self;
+});
+
+function opt_AST_Lambda(self, compressor) {
+    tighten_body(self.body, compressor);
+    if (compressor.option("side_effects")
+        && self.body.length == 1
+        && self.body[0] === compressor.has_directive("use strict")) {
+        self.body.length = 0;
+    }
+    return self;
+}
+def_optimize(AST_Lambda, opt_AST_Lambda);
+
+const r_keep_assign = /keep_assign/;
+AST_Scope.DEFMETHOD("drop_unused", function(compressor) {
+    if (!compressor.option("unused")) return;
+    if (compressor.has_directive("use asm")) return;
+    var self = this;
+    if (self.pinned()) return;
+    var drop_funcs = !(self instanceof AST_Toplevel) || compressor.toplevel.funcs;
+    var drop_vars = !(self instanceof AST_Toplevel) || compressor.toplevel.vars;
+    const assign_as_unused = r_keep_assign.test(compressor.option("unused")) ? return_false : function(node) {
+        if (node instanceof AST_Assign
+            && !node.logical
+            && (has_flag(node, WRITE_ONLY) || node.operator == "=")
+        ) {
+            return node.left;
+        }
+        if (node instanceof AST_Unary && has_flag(node, WRITE_ONLY)) {
+            return node.expression;
+        }
+    };
+    var in_use_ids = new Map();
+    var fixed_ids = new Map();
+    if (self instanceof AST_Toplevel && compressor.top_retain) {
+        self.variables.forEach(function(def) {
+            if (compressor.top_retain(def) && !in_use_ids.has(def.id)) {
+                in_use_ids.set(def.id, def);
+            }
+        });
+    }
+    var var_defs_by_id = new Map();
+    var initializations = new Map();
+    // pass 1: find out which symbols are directly used in
+    // this scope (not in nested scopes).
+    var scope = this;
+    var tw = new TreeWalker(function(node, descend) {
+        if (node instanceof AST_Lambda && node.uses_arguments && !tw.has_directive("use strict")) {
+            node.argnames.forEach(function(argname) {
+                if (!(argname instanceof AST_SymbolDeclaration)) return;
+                var def = argname.definition();
+                if (!in_use_ids.has(def.id)) {
+                    in_use_ids.set(def.id, def);
+                }
+            });
+        }
+        if (node === self) return;
+        if (node instanceof AST_Defun || node instanceof AST_DefClass) {
+            var node_def = node.name.definition();
+            const in_export = tw.parent() instanceof AST_Export;
+            if (in_export || !drop_funcs && scope === self) {
+                if (node_def.global && !in_use_ids.has(node_def.id)) {
+                    in_use_ids.set(node_def.id, node_def);
+                }
+            }
+            if (node instanceof AST_DefClass) {
+                if (
+                    node.extends
+                    && (node.extends.has_side_effects(compressor)
+                    || node.extends.may_throw(compressor))
+                ) {
+                    node.extends.walk(tw);
+                }
+                for (const prop of node.properties) {
+                    if (
+                        prop.has_side_effects(compressor) ||
+                        prop.may_throw(compressor)
+                    ) {
+                        prop.walk(tw);
+                    }
+                }
+            }
+            map_add(initializations, node_def.id, node);
+            return true; // don't go in nested scopes
+        }
+        if (node instanceof AST_SymbolFunarg && scope === self) {
+            map_add(var_defs_by_id, node.definition().id, node);
+        }
+        if (node instanceof AST_Definitions && scope === self) {
+            const in_export = tw.parent() instanceof AST_Export;
+            node.definitions.forEach(function(def) {
+                if (def.name instanceof AST_SymbolVar) {
+                    map_add(var_defs_by_id, def.name.definition().id, def);
+                }
+                if (in_export || !drop_vars) {
+                    walk(def.name, node => {
+                        if (node instanceof AST_SymbolDeclaration) {
+                            const def = node.definition();
+                            if (
+                                (in_export || def.global)
+                                && !in_use_ids.has(def.id)
+                            ) {
+                                in_use_ids.set(def.id, def);
+                            }
+                        }
+                    });
+                }
+                if (def.value) {
+                    if (def.name instanceof AST_Destructuring) {
+                        def.walk(tw);
+                    } else {
+                        var node_def = def.name.definition();
+                        map_add(initializations, node_def.id, def.value);
+                        if (!node_def.chained && def.name.fixed_value() === def.value) {
+                            fixed_ids.set(node_def.id, def);
+                        }
+                    }
+                    if (def.value.has_side_effects(compressor)) {
+                        def.value.walk(tw);
+                    }
+                }
+            });
+            return true;
+        }
+        return scan_ref_scoped(node, descend);
+    });
+    self.walk(tw);
+    // pass 2: for every used symbol we need to walk its
+    // initialization code to figure out if it uses other
+    // symbols (that may not be in_use).
+    tw = new TreeWalker(scan_ref_scoped);
+    in_use_ids.forEach(function (def) {
+        var init = initializations.get(def.id);
+        if (init) init.forEach(function(init) {
+            init.walk(tw);
+        });
+    });
+    // pass 3: we should drop declarations not in_use
+    var tt = new TreeTransformer(
+        function before(node, descend, in_list) {
+            var parent = tt.parent();
+            if (drop_vars) {
+                const sym = assign_as_unused(node);
+                if (sym instanceof AST_SymbolRef) {
+                    var def = sym.definition();
+                    var in_use = in_use_ids.has(def.id);
+                    if (node instanceof AST_Assign) {
+                        if (!in_use || fixed_ids.has(def.id) && fixed_ids.get(def.id) !== node) {
+                            return maintain_this_binding(parent, node, node.right.transform(tt));
+                        }
+                    } else if (!in_use) return in_list ? MAP.skip : make_node(AST_Number, node, {
+                        value: 0
+                    });
+                }
+            }
+            if (scope !== self) return;
+            var def;
+            if (node.name
+                && (node instanceof AST_ClassExpression
+                    && !keep_name(compressor.option("keep_classnames"), (def = node.name.definition()).name)
+                || node instanceof AST_Function
+                    && !keep_name(compressor.option("keep_fnames"), (def = node.name.definition()).name))) {
+                // any declarations with same name will overshadow
+                // name of this anonymous function and can therefore
+                // never be used anywhere
+                if (!in_use_ids.has(def.id) || def.orig.length > 1) node.name = null;
+            }
+            if (node instanceof AST_Lambda && !(node instanceof AST_Accessor)) {
+                var trim = !compressor.option("keep_fargs");
+                for (var a = node.argnames, i = a.length; --i >= 0;) {
+                    var sym = a[i];
+                    if (sym instanceof AST_Expansion) {
+                        sym = sym.expression;
+                    }
+                    if (sym instanceof AST_DefaultAssign) {
+                        sym = sym.left;
+                    }
+                    // Do not drop destructuring arguments.
+                    // They constitute a type assertion, so dropping
+                    // them would stop that TypeError which would happen
+                    // if someone called it with an incorrectly formatted
+                    // parameter.
+                    if (!(sym instanceof AST_Destructuring) && !in_use_ids.has(sym.definition().id)) {
+                        set_flag(sym, UNUSED);
+                        if (trim) {
+                            a.pop();
+                        }
+                    } else {
+                        trim = false;
+                    }
+                }
+            }
+            if ((node instanceof AST_Defun || node instanceof AST_DefClass) && node !== self) {
+                const def = node.name.definition();
+                let keep = def.global && !drop_funcs || in_use_ids.has(def.id);
+                if (!keep) {
+                    def.eliminated++;
+                    if (node instanceof AST_DefClass) {
+                        // Classes might have extends with side effects
+                        const side_effects = node.drop_side_effect_free(compressor);
+                        if (side_effects) {
+                            return make_node(AST_SimpleStatement, node, {
+                                body: side_effects
+                            });
+                        }
+                    }
+                    return in_list ? MAP.skip : make_node(AST_EmptyStatement, node);
+                }
+            }
+            if (node instanceof AST_Definitions && !(parent instanceof AST_ForIn && parent.init === node)) {
+                var drop_block = !(parent instanceof AST_Toplevel) && !(node instanceof AST_Var);
+                // place uninitialized names at the start
+                var body = [], head = [], tail = [];
+                // for unused names whose initialization has
+                // side effects, we can cascade the init. code
+                // into the next one, or next statement.
+                var side_effects = [];
+                node.definitions.forEach(function(def) {
+                    if (def.value) def.value = def.value.transform(tt);
+                    var is_destructure = def.name instanceof AST_Destructuring;
+                    var sym = is_destructure
+                        ? new SymbolDef(null, { name: "<destructure>" }) /* fake SymbolDef */
+                        : def.name.definition();
+                    if (drop_block && sym.global) return tail.push(def);
+                    if (!(drop_vars || drop_block)
+                        || is_destructure
+                            && (def.name.names.length
+                                || def.name.is_array
+                                || compressor.option("pure_getters") != true)
+                        || in_use_ids.has(sym.id)
+                    ) {
+                        if (def.value && fixed_ids.has(sym.id) && fixed_ids.get(sym.id) !== def) {
+                            def.value = def.value.drop_side_effect_free(compressor);
+                        }
+                        if (def.name instanceof AST_SymbolVar) {
+                            var var_defs = var_defs_by_id.get(sym.id);
+                            if (var_defs.length > 1 && (!def.value || sym.orig.indexOf(def.name) > sym.eliminated)) {
+                                if (def.value) {
+                                    var ref = make_node(AST_SymbolRef, def.name, def.name);
+                                    sym.references.push(ref);
+                                    var assign = make_node(AST_Assign, def, {
+                                        operator: "=",
+                                        logical: false,
+                                        left: ref,
+                                        right: def.value
+                                    });
+                                    if (fixed_ids.get(sym.id) === def) {
+                                        fixed_ids.set(sym.id, assign);
+                                    }
+                                    side_effects.push(assign.transform(tt));
+                                }
+                                remove(var_defs, def);
+                                sym.eliminated++;
+                                return;
+                            }
+                        }
+                        if (def.value) {
+                            if (side_effects.length > 0) {
+                                if (tail.length > 0) {
+                                    side_effects.push(def.value);
+                                    def.value = make_sequence(def.value, side_effects);
+                                } else {
+                                    body.push(make_node(AST_SimpleStatement, node, {
+                                        body: make_sequence(node, side_effects)
+                                    }));
+                                }
+                                side_effects = [];
+                            }
+                            tail.push(def);
+                        } else {
+                            head.push(def);
+                        }
+                    } else if (sym.orig[0] instanceof AST_SymbolCatch) {
+                        var value = def.value && def.value.drop_side_effect_free(compressor);
+                        if (value) side_effects.push(value);
+                        def.value = null;
+                        head.push(def);
+                    } else {
+                        var value = def.value && def.value.drop_side_effect_free(compressor);
+                        if (value) {
+                            side_effects.push(value);
+                        }
+                        sym.eliminated++;
+                    }
+                });
+                if (head.length > 0 || tail.length > 0) {
+                    node.definitions = head.concat(tail);
+                    body.push(node);
+                }
+                if (side_effects.length > 0) {
+                    body.push(make_node(AST_SimpleStatement, node, {
+                        body: make_sequence(node, side_effects)
+                    }));
+                }
+                switch (body.length) {
+                  case 0:
+                    return in_list ? MAP.skip : make_node(AST_EmptyStatement, node);
+                  case 1:
+                    return body[0];
+                  default:
+                    return in_list ? MAP.splice(body) : make_node(AST_BlockStatement, node, {
+                        body: body
+                    });
+                }
+            }
+            // certain combination of unused name + side effect leads to:
+            //    https://github.com/mishoo/UglifyJS2/issues/44
+            //    https://github.com/mishoo/UglifyJS2/issues/1830
+            //    https://github.com/mishoo/UglifyJS2/issues/1838
+            // that's an invalid AST.
+            // We fix it at this stage by moving the `var` outside the `for`.
+            if (node instanceof AST_For) {
+                descend(node, this);
+                var block;
+                if (node.init instanceof AST_BlockStatement) {
+                    block = node.init;
+                    node.init = block.body.pop();
+                    block.body.push(node);
+                }
+                if (node.init instanceof AST_SimpleStatement) {
+                    node.init = node.init.body;
+                } else if (is_empty(node.init)) {
+                    node.init = null;
+                }
+                return !block ? node : in_list ? MAP.splice(block.body) : block;
+            }
+            if (node instanceof AST_LabeledStatement
+                && node.body instanceof AST_For
+            ) {
+                descend(node, this);
+                if (node.body instanceof AST_BlockStatement) {
+                    var block = node.body;
+                    node.body = block.body.pop();
+                    block.body.push(node);
+                    return in_list ? MAP.splice(block.body) : block;
+                }
+                return node;
+            }
+            if (node instanceof AST_BlockStatement) {
+                descend(node, this);
+                if (in_list && node.body.every(can_be_evicted_from_block)) {
+                    return MAP.splice(node.body);
+                }
+                return node;
+            }
+            if (node instanceof AST_Scope) {
+                const save_scope = scope;
+                scope = node;
+                descend(node, this);
+                scope = save_scope;
+                return node;
+            }
+        }
+    );
+
+    self.transform(tt);
+
+    function scan_ref_scoped(node, descend) {
+        var node_def;
+        const sym = assign_as_unused(node);
+        if (sym instanceof AST_SymbolRef
+            && !is_ref_of(node.left, AST_SymbolBlockDeclaration)
+            && self.variables.get(sym.name) === (node_def = sym.definition())
+        ) {
+            if (node instanceof AST_Assign) {
+                node.right.walk(tw);
+                if (!node_def.chained && node.left.fixed_value() === node.right) {
+                    fixed_ids.set(node_def.id, node);
+                }
+            }
+            return true;
+        }
+        if (node instanceof AST_SymbolRef) {
+            node_def = node.definition();
+            if (!in_use_ids.has(node_def.id)) {
+                in_use_ids.set(node_def.id, node_def);
+                if (node_def.orig[0] instanceof AST_SymbolCatch) {
+                    const redef = node_def.scope.is_block_scope()
+                        && node_def.scope.get_defun_scope().variables.get(node_def.name);
+                    if (redef) in_use_ids.set(redef.id, redef);
+                }
+            }
+            return true;
+        }
+        if (node instanceof AST_Scope) {
+            var save_scope = scope;
+            scope = node;
+            descend();
+            scope = save_scope;
+            return true;
+        }
+    }
+});
+
+AST_Scope.DEFMETHOD("hoist_declarations", function(compressor) {
+    var self = this;
+    if (compressor.has_directive("use asm")) return self;
+    // Hoisting makes no sense in an arrow func
+    if (!Array.isArray(self.body)) return self;
+
+    var hoist_funs = compressor.option("hoist_funs");
+    var hoist_vars = compressor.option("hoist_vars");
+
+    if (hoist_funs || hoist_vars) {
+        var dirs = [];
+        var hoisted = [];
+        var vars = new Map(), vars_found = 0, var_decl = 0;
+        // let's count var_decl first, we seem to waste a lot of
+        // space if we hoist `var` when there's only one.
+        walk(self, node => {
+            if (node instanceof AST_Scope && node !== self)
+                return true;
+            if (node instanceof AST_Var) {
+                ++var_decl;
+                return true;
+            }
+        });
+        hoist_vars = hoist_vars && var_decl > 1;
+        var tt = new TreeTransformer(
+            function before(node) {
+                if (node !== self) {
+                    if (node instanceof AST_Directive) {
+                        dirs.push(node);
+                        return make_node(AST_EmptyStatement, node);
+                    }
+                    if (hoist_funs && node instanceof AST_Defun
+                        && !(tt.parent() instanceof AST_Export)
+                        && tt.parent() === self) {
+                        hoisted.push(node);
+                        return make_node(AST_EmptyStatement, node);
+                    }
+                    if (
+                        hoist_vars
+                        && node instanceof AST_Var
+                        && !node.definitions.some(def => def.name instanceof AST_Destructuring)
+                    ) {
+                        node.definitions.forEach(function(def) {
+                            vars.set(def.name.name, def);
+                            ++vars_found;
+                        });
+                        var seq = node.to_assignments(compressor);
+                        var p = tt.parent();
+                        if (p instanceof AST_ForIn && p.init === node) {
+                            if (seq == null) {
+                                var def = node.definitions[0].name;
+                                return make_node(AST_SymbolRef, def, def);
+                            }
+                            return seq;
+                        }
+                        if (p instanceof AST_For && p.init === node) {
+                            return seq;
+                        }
+                        if (!seq) return make_node(AST_EmptyStatement, node);
+                        return make_node(AST_SimpleStatement, node, {
+                            body: seq
+                        });
+                    }
+                    if (node instanceof AST_Scope)
+                        return node; // to avoid descending in nested scopes
+                }
+            }
+        );
+        self = self.transform(tt);
+        if (vars_found > 0) {
+            // collect only vars which don't show up in self's arguments list
+            var defs = [];
+            const is_lambda = self instanceof AST_Lambda;
+            const args_as_names = is_lambda ? self.args_as_names() : null;
+            vars.forEach((def, name) => {
+                if (is_lambda && args_as_names.some((x) => x.name === def.name.name)) {
+                    vars.delete(name);
+                } else {
+                    def = def.clone();
+                    def.value = null;
+                    defs.push(def);
+                    vars.set(name, def);
+                }
+            });
+            if (defs.length > 0) {
+                // try to merge in assignments
+                for (var i = 0; i < self.body.length;) {
+                    if (self.body[i] instanceof AST_SimpleStatement) {
+                        var expr = self.body[i].body, sym, assign;
+                        if (expr instanceof AST_Assign
+                            && expr.operator == "="
+                            && (sym = expr.left) instanceof AST_Symbol
+                            && vars.has(sym.name)
+                        ) {
+                            var def = vars.get(sym.name);
+                            if (def.value) break;
+                            def.value = expr.right;
+                            remove(defs, def);
+                            defs.push(def);
+                            self.body.splice(i, 1);
+                            continue;
+                        }
+                        if (expr instanceof AST_Sequence
+                            && (assign = expr.expressions[0]) instanceof AST_Assign
+                            && assign.operator == "="
+                            && (sym = assign.left) instanceof AST_Symbol
+                            && vars.has(sym.name)
+                        ) {
+                            var def = vars.get(sym.name);
+                            if (def.value) break;
+                            def.value = assign.right;
+                            remove(defs, def);
+                            defs.push(def);
+                            self.body[i].body = make_sequence(expr, expr.expressions.slice(1));
+                            continue;
+                        }
+                    }
+                    if (self.body[i] instanceof AST_EmptyStatement) {
+                        self.body.splice(i, 1);
+                        continue;
+                    }
+                    if (self.body[i] instanceof AST_BlockStatement) {
+                        self.body.splice(i, 1, ...self.body[i].body);
+                        continue;
+                    }
+                    break;
+                }
+                defs = make_node(AST_Var, self, {
+                    definitions: defs
+                });
+                hoisted.push(defs);
+            }
+        }
+        self.body = dirs.concat(hoisted, self.body);
+    }
+    return self;
+});
+
+AST_Scope.DEFMETHOD("hoist_properties", function(compressor) {
+    var self = this;
+    if (!compressor.option("hoist_props") || compressor.has_directive("use asm")) return self;
+    var top_retain = self instanceof AST_Toplevel && compressor.top_retain || return_false;
+    var defs_by_id = new Map();
+    var hoister = new TreeTransformer(function(node, descend) {
+        if (node instanceof AST_Definitions
+            && hoister.parent() instanceof AST_Export) return node;
+        if (node instanceof AST_VarDef) {
+            const sym = node.name;
+            let def;
+            let value;
+            if (sym.scope === self
+                && (def = sym.definition()).escaped != 1
+                && !def.assignments
+                && !def.direct_access
+                && !def.single_use
+                && !compressor.exposed(def)
+                && !top_retain(def)
+                && (value = sym.fixed_value()) === node.value
+                && value instanceof AST_Object
+                && !value.properties.some(prop =>
+                    prop instanceof AST_Expansion || prop.computed_key()
+                )
+            ) {
+                descend(node, this);
+                const defs = new Map();
+                const assignments = [];
+                value.properties.forEach(({ key, value }) => {
+                    const scope = find_scope(hoister);
+                    const symbol = self.create_symbol(sym.CTOR, {
+                        source: sym,
+                        scope,
+                        conflict_scopes: new Set([
+                            scope,
+                            ...sym.definition().references.map(ref => ref.scope)
+                        ]),
+                        tentative_name: sym.name + "_" + key
+                    });
+
+                    defs.set(String(key), symbol.definition());
+
+                    assignments.push(make_node(AST_VarDef, node, {
+                        name: symbol,
+                        value
+                    }));
+                });
+                defs_by_id.set(def.id, defs);
+                return MAP.splice(assignments);
+            }
+        } else if (node instanceof AST_PropAccess
+            && node.expression instanceof AST_SymbolRef
+        ) {
+            const defs = defs_by_id.get(node.expression.definition().id);
+            if (defs) {
+                const def = defs.get(String(get_simple_key(node.property)));
+                const sym = make_node(AST_SymbolRef, node, {
+                    name: def.name,
+                    scope: node.expression.scope,
+                    thedef: def
+                });
+                sym.reference({});
+                return sym;
+            }
+        }
+    });
+    return self.transform(hoister);
+});
+
+def_optimize(AST_SimpleStatement, function(self, compressor) {
+    if (compressor.option("side_effects")) {
+        var body = self.body;
+        var node = body.drop_side_effect_free(compressor, true);
+        if (!node) {
+            return make_node(AST_EmptyStatement, self);
+        }
+        if (node !== body) {
+            return make_node(AST_SimpleStatement, self, { body: node });
+        }
+    }
+    return self;
+});
+
+def_optimize(AST_While, function(self, compressor) {
+    return compressor.option("loops") ? make_node(AST_For, self, self).optimize(compressor) : self;
+});
+
+def_optimize(AST_Do, function(self, compressor) {
+    if (!compressor.option("loops")) return self;
+    var cond = self.condition.tail_node().evaluate(compressor);
+    if (!(cond instanceof AST_Node)) {
+        if (cond) return make_node(AST_For, self, {
+            body: make_node(AST_BlockStatement, self.body, {
+                body: [
+                    self.body,
+                    make_node(AST_SimpleStatement, self.condition, {
+                        body: self.condition
+                    })
+                ]
+            })
+        }).optimize(compressor);
+        if (!has_break_or_continue(self, compressor.parent())) {
+            return make_node(AST_BlockStatement, self.body, {
+                body: [
+                    self.body,
+                    make_node(AST_SimpleStatement, self.condition, {
+                        body: self.condition
+                    })
+                ]
+            }).optimize(compressor);
+        }
+    }
+    return self;
+});
+
+function if_break_in_loop(self, compressor) {
+    var first = self.body instanceof AST_BlockStatement ? self.body.body[0] : self.body;
+    if (compressor.option("dead_code") && is_break(first)) {
+        var body = [];
+        if (self.init instanceof AST_Statement) {
+            body.push(self.init);
+        } else if (self.init) {
+            body.push(make_node(AST_SimpleStatement, self.init, {
+                body: self.init
+            }));
+        }
+        if (self.condition) {
+            body.push(make_node(AST_SimpleStatement, self.condition, {
+                body: self.condition
+            }));
+        }
+        trim_unreachable_code(compressor, self.body, body);
+        return make_node(AST_BlockStatement, self, {
+            body: body
+        });
+    }
+    if (first instanceof AST_If) {
+        if (is_break(first.body)) {
+            if (self.condition) {
+                self.condition = make_node(AST_Binary, self.condition, {
+                    left: self.condition,
+                    operator: "&&",
+                    right: first.condition.negate(compressor),
+                });
+            } else {
+                self.condition = first.condition.negate(compressor);
+            }
+            drop_it(first.alternative);
+        } else if (is_break(first.alternative)) {
+            if (self.condition) {
+                self.condition = make_node(AST_Binary, self.condition, {
+                    left: self.condition,
+                    operator: "&&",
+                    right: first.condition,
+                });
+            } else {
+                self.condition = first.condition;
+            }
+            drop_it(first.body);
+        }
+    }
+    return self;
+
+    function is_break(node) {
+        return node instanceof AST_Break
+            && compressor.loopcontrol_target(node) === compressor.self();
+    }
+
+    function drop_it(rest) {
+        rest = as_statement_array(rest);
+        if (self.body instanceof AST_BlockStatement) {
+            self.body = self.body.clone();
+            self.body.body = rest.concat(self.body.body.slice(1));
+            self.body = self.body.transform(compressor);
+        } else {
+            self.body = make_node(AST_BlockStatement, self.body, {
+                body: rest
+            }).transform(compressor);
+        }
+        self = if_break_in_loop(self, compressor);
+    }
+}
+
+def_optimize(AST_For, function(self, compressor) {
+    if (!compressor.option("loops")) return self;
+    if (compressor.option("side_effects") && self.init) {
+        self.init = self.init.drop_side_effect_free(compressor);
+    }
+    if (self.condition) {
+        var cond = self.condition.evaluate(compressor);
+        if (!(cond instanceof AST_Node)) {
+            if (cond) self.condition = null;
+            else if (!compressor.option("dead_code")) {
+                var orig = self.condition;
+                self.condition = make_node_from_constant(cond, self.condition);
+                self.condition = best_of_expression(self.condition.transform(compressor), orig);
+            }
+        }
+        if (compressor.option("dead_code")) {
+            if (cond instanceof AST_Node) cond = self.condition.tail_node().evaluate(compressor);
+            if (!cond) {
+                var body = [];
+                trim_unreachable_code(compressor, self.body, body);
+                if (self.init instanceof AST_Statement) {
+                    body.push(self.init);
+                } else if (self.init) {
+                    body.push(make_node(AST_SimpleStatement, self.init, {
+                        body: self.init
+                    }));
+                }
+                body.push(make_node(AST_SimpleStatement, self.condition, {
+                    body: self.condition
+                }));
+                return make_node(AST_BlockStatement, self, { body: body }).optimize(compressor);
+            }
+        }
+    }
+    return if_break_in_loop(self, compressor);
+});
+
+def_optimize(AST_If, function(self, compressor) {
+    if (is_empty(self.alternative)) self.alternative = null;
+
+    if (!compressor.option("conditionals")) return self;
+    // if condition can be statically determined, drop
+    // one of the blocks.  note, statically determined implies
+    // “has no side effects”; also it doesn't work for cases like
+    // `x && true`, though it probably should.
+    var cond = self.condition.evaluate(compressor);
+    if (!compressor.option("dead_code") && !(cond instanceof AST_Node)) {
+        var orig = self.condition;
+        self.condition = make_node_from_constant(cond, orig);
+        self.condition = best_of_expression(self.condition.transform(compressor), orig);
+    }
+    if (compressor.option("dead_code")) {
+        if (cond instanceof AST_Node) cond = self.condition.tail_node().evaluate(compressor);
+        if (!cond) {
+            var body = [];
+            trim_unreachable_code(compressor, self.body, body);
+            body.push(make_node(AST_SimpleStatement, self.condition, {
+                body: self.condition
+            }));
+            if (self.alternative) body.push(self.alternative);
+            return make_node(AST_BlockStatement, self, { body: body }).optimize(compressor);
+        } else if (!(cond instanceof AST_Node)) {
+            var body = [];
+            body.push(make_node(AST_SimpleStatement, self.condition, {
+                body: self.condition
+            }));
+            body.push(self.body);
+            if (self.alternative) {
+                trim_unreachable_code(compressor, self.alternative, body);
+            }
+            return make_node(AST_BlockStatement, self, { body: body }).optimize(compressor);
+        }
+    }
+    var negated = self.condition.negate(compressor);
+    var self_condition_length = self.condition.size();
+    var negated_length = negated.size();
+    var negated_is_best = negated_length < self_condition_length;
+    if (self.alternative && negated_is_best) {
+        negated_is_best = false; // because we already do the switch here.
+        // no need to swap values of self_condition_length and negated_length
+        // here because they are only used in an equality comparison later on.
+        self.condition = negated;
+        var tmp = self.body;
+        self.body = self.alternative || make_node(AST_EmptyStatement, self);
+        self.alternative = tmp;
+    }
+    if (is_empty(self.body) && is_empty(self.alternative)) {
+        return make_node(AST_SimpleStatement, self.condition, {
+            body: self.condition.clone()
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_SimpleStatement
+        && self.alternative instanceof AST_SimpleStatement) {
+        return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Conditional, self, {
+                condition   : self.condition,
+                consequent  : self.body.body,
+                alternative : self.alternative.body
+            })
+        }).optimize(compressor);
+    }
+    if (is_empty(self.alternative) && self.body instanceof AST_SimpleStatement) {
+        if (self_condition_length === negated_length && !negated_is_best
+            && self.condition instanceof AST_Binary && self.condition.operator == "||") {
+            // although the code length of self.condition and negated are the same,
+            // negated does not require additional surrounding parentheses.
+            // see https://github.com/mishoo/UglifyJS2/issues/979
+            negated_is_best = true;
+        }
+        if (negated_is_best) return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Binary, self, {
+                operator : "||",
+                left     : negated,
+                right    : self.body.body
+            })
+        }).optimize(compressor);
+        return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Binary, self, {
+                operator : "&&",
+                left     : self.condition,
+                right    : self.body.body
+            })
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_EmptyStatement
+        && self.alternative instanceof AST_SimpleStatement) {
+        return make_node(AST_SimpleStatement, self, {
+            body: make_node(AST_Binary, self, {
+                operator : "||",
+                left     : self.condition,
+                right    : self.alternative.body
+            })
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_Exit
+        && self.alternative instanceof AST_Exit
+        && self.body.TYPE == self.alternative.TYPE) {
+        return make_node(self.body.CTOR, self, {
+            value: make_node(AST_Conditional, self, {
+                condition   : self.condition,
+                consequent  : self.body.value || make_node(AST_Undefined, self.body),
+                alternative : self.alternative.value || make_node(AST_Undefined, self.alternative)
+            }).transform(compressor)
+        }).optimize(compressor);
+    }
+    if (self.body instanceof AST_If
+        && !self.body.alternative
+        && !self.alternative) {
+        self = make_node(AST_If, self, {
+            condition: make_node(AST_Binary, self.condition, {
+                operator: "&&",
+                left: self.condition,
+                right: self.body.condition
+            }),
+            body: self.body.body,
+            alternative: null
+        });
+    }
+    if (aborts(self.body)) {
+        if (self.alternative) {
+            var alt = self.alternative;
+            self.alternative = null;
+            return make_node(AST_BlockStatement, self, {
+                body: [ self, alt ]
+            }).optimize(compressor);
+        }
+    }
+    if (aborts(self.alternative)) {
+        var body = self.body;
+        self.body = self.alternative;
+        self.condition = negated_is_best ? negated : self.condition.negate(compressor);
+        self.alternative = null;
+        return make_node(AST_BlockStatement, self, {
+            body: [ self, body ]
+        }).optimize(compressor);
+    }
+    return self;
+});
+
+def_optimize(AST_Switch, function(self, compressor) {
+    if (!compressor.option("switches")) return self;
+    var branch;
+    var value = self.expression.evaluate(compressor);
+    if (!(value instanceof AST_Node)) {
+        var orig = self.expression;
+        self.expression = make_node_from_constant(value, orig);
+        self.expression = best_of_expression(self.expression.transform(compressor), orig);
+    }
+    if (!compressor.option("dead_code")) return self;
+    if (value instanceof AST_Node) {
+        value = self.expression.tail_node().evaluate(compressor);
+    }
+    var decl = [];
+    var body = [];
+    var default_branch;
+    var exact_match;
+    for (var i = 0, len = self.body.length; i < len && !exact_match; i++) {
+        branch = self.body[i];
+        if (branch instanceof AST_Default) {
+            if (!default_branch) {
+                default_branch = branch;
+            } else {
+                eliminate_branch(branch, body[body.length - 1]);
+            }
+        } else if (!(value instanceof AST_Node)) {
+            var exp = branch.expression.evaluate(compressor);
+            if (!(exp instanceof AST_Node) && exp !== value) {
+                eliminate_branch(branch, body[body.length - 1]);
+                continue;
+            }
+            if (exp instanceof AST_Node) exp = branch.expression.tail_node().evaluate(compressor);
+            if (exp === value) {
+                exact_match = branch;
+                if (default_branch) {
+                    var default_index = body.indexOf(default_branch);
+                    body.splice(default_index, 1);
+                    eliminate_branch(default_branch, body[default_index - 1]);
+                    default_branch = null;
+                }
+            }
+        }
+        body.push(branch);
+    }
+    while (i < len) eliminate_branch(self.body[i++], body[body.length - 1]);
+    self.body = body;
+
+    let default_or_exact = default_branch || exact_match;
+    default_branch = null;
+    exact_match = null;
+
+    // group equivalent branches so they will be located next to each other,
+    // that way the next micro-optimization will merge them.
+    // ** bail micro-optimization if not a simple switch case with breaks
+    if (body.every((branch, i) =>
+        (branch === default_or_exact || branch.expression instanceof AST_Constant)
+        && (branch.body.length === 0 || aborts(branch) || body.length - 1 === i))
+    ) {
+        for (let i = 0; i < body.length; i++) {
+            const branch = body[i];
+            for (let j = i + 1; j < body.length; j++) {
+                const next = body[j];
+                if (next.body.length === 0) continue;
+                const last_branch = j === (body.length - 1);
+                const equivalentBranch = branches_equivalent(next, branch, false);
+                if (equivalentBranch || (last_branch && branches_equivalent(next, branch, true))) {
+                    if (!equivalentBranch && last_branch) {
+                        next.body.push(make_node(AST_Break));
+                    }
+
+                    // let's find previous siblings with inert fallthrough...
+                    let x = j - 1;
+                    let fallthroughDepth = 0;
+                    while (x > i) {
+                        if (is_inert_body(body[x--])) {
+                            fallthroughDepth++;
+                        } else {
+                            break;
+                        }
+                    }
+
+                    const plucked = body.splice(j - fallthroughDepth, 1 + fallthroughDepth);
+                    body.splice(i + 1, 0, ...plucked);
+                    i += plucked.length;
+                }
+            }
+        }
+    }
+
+    // merge equivalent branches in a row
+    for (let i = 0; i < body.length; i++) {
+        let branch = body[i];
+        if (branch.body.length === 0) continue;
+        if (!aborts(branch)) continue;
+
+        for (let j = i + 1; j < body.length; i++, j++) {
+            let next = body[j];
+            if (next.body.length === 0) continue;
+            if (
+                branches_equivalent(next, branch, false)
+                || (j === body.length - 1 && branches_equivalent(next, branch, true))
+            ) {
+                branch.body = [];
+                branch = next;
+                continue;
+            }
+            break;
+        }
+    }
+
+    // Prune any empty branches at the end of the switch statement.
+    {
+        let i = body.length - 1;
+        for (; i >= 0; i--) {
+            let bbody = body[i].body;
+            if (is_break(bbody[bbody.length - 1], compressor)) bbody.pop();
+            if (!is_inert_body(body[i])) break;
+        }
+        // i now points to the index of a branch that contains a body. By incrementing, it's
+        // pointing to the first branch that's empty.
+        i++;
+        if (!default_or_exact || body.indexOf(default_or_exact) >= i) {
+            // The default behavior is to do nothing. We can take advantage of that to
+            // remove all case expressions that are side-effect free that also do
+            // nothing, since they'll default to doing nothing. But we can't remove any
+            // case expressions before one that would side-effect, since they may cause
+            // the side-effect to be skipped.
+            for (let j = body.length - 1; j >= i; j--) {
+                let branch = body[j];
+                if (branch === default_or_exact) {
+                    default_or_exact = null;
+                    body.pop();
+                } else if (!branch.expression.has_side_effects(compressor)) {
+                    body.pop();
+                } else {
+                    break;
+                }
+            }
+        }
+    }
+
+
+    // Prune side-effect free branches that fall into default.
+    DEFAULT: if (default_or_exact) {
+        let default_index = body.indexOf(default_or_exact);
+        let default_body_index = default_index;
+        for (; default_body_index < body.length - 1; default_body_index++) {
+            if (!is_inert_body(body[default_body_index])) break;
+        }
+        if (default_body_index < body.length - 1) {
+            break DEFAULT;
+        }
+
+        let side_effect_index = body.length - 1;
+        for (; side_effect_index >= 0; side_effect_index--) {
+            let branch = body[side_effect_index];
+            if (branch === default_or_exact) continue;
+            if (branch.expression.has_side_effects(compressor)) break;
+        }
+        // If the default behavior comes after any side-effect case expressions,
+        // then we can fold all side-effect free cases into the default branch.
+        // If the side-effect case is after the default, then any side-effect
+        // free cases could prevent the side-effect from occurring.
+        if (default_body_index > side_effect_index) {
+            let prev_body_index = default_index - 1;
+            for (; prev_body_index >= 0; prev_body_index--) {
+                if (!is_inert_body(body[prev_body_index])) break;
+            }
+            let before = Math.max(side_effect_index, prev_body_index) + 1;
+            let after = default_index;
+            if (side_effect_index > default_index) {
+                // If the default falls into the same body as a side-effect
+                // case, then we need preserve that case and only prune the
+                // cases after it.
+                after = side_effect_index;
+                body[side_effect_index].body = body[default_body_index].body;
+            } else {
+                // The default will be the last branch.
+                default_or_exact.body = body[default_body_index].body;
+            }
+
+            // Prune everything after the default (or last side-effect case)
+            // until the next case with a body.
+            body.splice(after + 1, default_body_index - after);
+            // Prune everything before the default that falls into it.
+            body.splice(before, default_index - before);
+        }
+    }
+
+    // See if we can remove the switch entirely if all cases (the default) fall into the same case body.
+    DEFAULT: if (default_or_exact) {
+        let i = body.findIndex(branch => !is_inert_body(branch));
+        let caseBody;
+        // `i` is equal to one of the following:
+        // - `-1`, there is no body in the switch statement.
+        // - `body.length - 1`, all cases fall into the same body.
+        // - anything else, there are multiple bodies in the switch.
+        if (i === body.length - 1) {
+            // All cases fall into the case body.
+            let branch = body[i];
+            if (has_nested_break(self)) break DEFAULT;
+
+            // This is the last case body, and we've already pruned any breaks, so it's
+            // safe to hoist.
+            caseBody = make_node(AST_BlockStatement, branch, {
+                body: branch.body
+            });
+            branch.body = [];
+        } else if (i !== -1) {
+            // If there are multiple bodies, then we cannot optimize anything.
+            break DEFAULT;
+        }
+
+        let sideEffect = body.find(branch => {
+            return (
+                branch !== default_or_exact
+                && branch.expression.has_side_effects(compressor)
+            );
+        });
+        // If no cases cause a side-effect, we can eliminate the switch entirely.
+        if (!sideEffect) {
+            return make_node(AST_BlockStatement, self, {
+                body: decl.concat(
+                    statement(self.expression),
+                    default_or_exact.expression ? statement(default_or_exact.expression) : [],
+                    caseBody || []
+                )
+            }).optimize(compressor);
+        }
+
+        // If we're this far, either there was no body or all cases fell into the same body.
+        // If there was no body, then we don't need a default branch (because the default is
+        // do nothing). If there was a body, we'll extract it to after the switch, so the
+        // switch's new default is to do nothing and we can still prune it.
+        const default_index = body.indexOf(default_or_exact);
+        body.splice(default_index, 1);
+        default_or_exact = null;
+
+        if (caseBody) {
+            // Recurse into switch statement one more time so that we can append the case body
+            // outside of the switch. This recursion will only happen once since we've pruned
+            // the default case.
+            return make_node(AST_BlockStatement, self, {
+                body: decl.concat(self, caseBody)
+            }).optimize(compressor);
+        }
+        // If we fall here, there is a default branch somewhere, there are no case bodies,
+        // and there's a side-effect somewhere. Just let the below paths take care of it.
+    }
+
+    if (body.length > 0) {
+        body[0].body = decl.concat(body[0].body);
+    }
+
+    if (body.length == 0) {
+        return make_node(AST_BlockStatement, self, {
+            body: decl.concat(statement(self.expression))
+        }).optimize(compressor);
+    }
+    if (body.length == 1 && !has_nested_break(self)) {
+        // This is the last case body, and we've already pruned any breaks, so it's
+        // safe to hoist.
+        let branch = body[0];
+        return make_node(AST_If, self, {
+            condition: make_node(AST_Binary, self, {
+                operator: "===",
+                left: self.expression,
+                right: branch.expression,
+            }),
+            body: make_node(AST_BlockStatement, branch, {
+                body: branch.body
+            }),
+            alternative: null
+        }).optimize(compressor);
+    }
+    if (body.length === 2 && default_or_exact && !has_nested_break(self)) {
+        let branch = body[0] === default_or_exact ? body[1] : body[0];
+        let exact_exp = default_or_exact.expression && statement(default_or_exact.expression);
+        if (aborts(body[0])) {
+            // Only the first branch body could have a break (at the last statement)
+            let first = body[0];
+            if (is_break(first.body[first.body.length - 1], compressor)) {
+                first.body.pop();
+            }
+            return make_node(AST_If, self, {
+                condition: make_node(AST_Binary, self, {
+                    operator: "===",
+                    left: self.expression,
+                    right: branch.expression,
+                }),
+                body: make_node(AST_BlockStatement, branch, {
+                    body: branch.body
+                }),
+                alternative: make_node(AST_BlockStatement, default_or_exact, {
+                    body: [].concat(
+                        exact_exp || [],
+                        default_or_exact.body
+                    )
+                })
+            }).optimize(compressor);
+        }
+        let operator = "===";
+        let consequent = make_node(AST_BlockStatement, branch, {
+            body: branch.body,
+        });
+        let always = make_node(AST_BlockStatement, default_or_exact, {
+            body: [].concat(
+                exact_exp || [],
+                default_or_exact.body
+            )
+        });
+        if (body[0] === default_or_exact) {
+            operator = "!==";
+            let tmp = always;
+            always = consequent;
+            consequent = tmp;
+        }
+        return make_node(AST_BlockStatement, self, {
+            body: [
+                make_node(AST_If, self, {
+                    condition: make_node(AST_Binary, self, {
+                        operator: operator,
+                        left: self.expression,
+                        right: branch.expression,
+                    }),
+                    body: consequent,
+                    alternative: null
+                })
+            ].concat(always)
+        }).optimize(compressor);
+    }
+    return self;
+
+    function eliminate_branch(branch, prev) {
+        if (prev && !aborts(prev)) {
+            prev.body = prev.body.concat(branch.body);
+        } else {
+            trim_unreachable_code(compressor, branch, decl);
+        }
+    }
+    function branches_equivalent(branch, prev, insertBreak) {
+        let bbody = branch.body;
+        let pbody = prev.body;
+        if (insertBreak) {
+            bbody = bbody.concat(make_node(AST_Break));
+        }
+        if (bbody.length !== pbody.length) return false;
+        let bblock = make_node(AST_BlockStatement, branch, { body: bbody });
+        let pblock = make_node(AST_BlockStatement, prev, { body: pbody });
+        return bblock.equivalent_to(pblock);
+    }
+    function statement(expression) {
+        return make_node(AST_SimpleStatement, expression, {
+            body: expression
+        });
+    }
+    function has_nested_break(root) {
+        let has_break = false;
+        let tw = new TreeWalker(node => {
+            if (has_break) return true;
+            if (node instanceof AST_Lambda) return true;
+            if (node instanceof AST_SimpleStatement) return true;
+            if (!is_break(node, tw)) return;
+            let parent = tw.parent();
+            if (
+                parent instanceof AST_SwitchBranch
+                && parent.body[parent.body.length - 1] === node
+            ) {
+                return;
+            }
+            has_break = true;
+        });
+        root.walk(tw);
+        return has_break;
+    }
+    function is_break(node, stack) {
+        return node instanceof AST_Break
+            && stack.loopcontrol_target(node) === self;
+    }
+    function is_inert_body(branch) {
+        return !aborts(branch) && !make_node(AST_BlockStatement, branch, {
+            body: branch.body
+        }).has_side_effects(compressor);
+    }
+});
+
+def_optimize(AST_Try, function(self, compressor) {
+    tighten_body(self.body, compressor);
+    if (self.bcatch && self.bfinally && self.bfinally.body.every(is_empty)) self.bfinally = null;
+    if (compressor.option("dead_code") && self.body.every(is_empty)) {
+        var body = [];
+        if (self.bcatch) {
+            trim_unreachable_code(compressor, self.bcatch, body);
+        }
+        if (self.bfinally) body.push(...self.bfinally.body);
+        return make_node(AST_BlockStatement, self, {
+            body: body
+        }).optimize(compressor);
+    }
+    return self;
+});
+
+AST_Definitions.DEFMETHOD("remove_initializers", function() {
+    var decls = [];
+    this.definitions.forEach(function(def) {
+        if (def.name instanceof AST_SymbolDeclaration) {
+            def.value = null;
+            decls.push(def);
+        } else {
+            walk(def.name, node => {
+                if (node instanceof AST_SymbolDeclaration) {
+                    decls.push(make_node(AST_VarDef, def, {
+                        name: node,
+                        value: null
+                    }));
+                }
+            });
+        }
+    });
+    this.definitions = decls;
+});
+
+AST_Definitions.DEFMETHOD("to_assignments", function(compressor) {
+    var reduce_vars = compressor.option("reduce_vars");
+    var assignments = [];
+
+    for (const def of this.definitions) {
+        if (def.value) {
+            var name = make_node(AST_SymbolRef, def.name, def.name);
+            assignments.push(make_node(AST_Assign, def, {
+                operator : "=",
+                logical: false,
+                left     : name,
+                right    : def.value
+            }));
+            if (reduce_vars) name.definition().fixed = false;
+        } else if (def.value) {
+            // Because it's a destructuring, do not turn into an assignment.
+            var varDef = make_node(AST_VarDef, def, {
+                name: def.name,
+                value: def.value
+            });
+            var var_ = make_node(AST_Var, def, {
+                definitions: [ varDef ]
+            });
+            assignments.push(var_);
+        }
+        const thedef = def.name.definition();
+        thedef.eliminated++;
+        thedef.replaced--;
+    }
+
+    if (assignments.length == 0) return null;
+    return make_sequence(this, assignments);
+});
+
+def_optimize(AST_Definitions, function(self) {
+    if (self.definitions.length == 0)
+        return make_node(AST_EmptyStatement, self);
+    return self;
+});
+
+def_optimize(AST_VarDef, function(self, compressor) {
+    if (
+        self.name instanceof AST_SymbolLet
+        && self.value != null
+        && is_undefined(self.value, compressor)
+    ) {
+        self.value = null;
+    }
+    return self;
+});
+
+def_optimize(AST_Import, function(self) {
+    return self;
+});
+
+// TODO this only works with AST_Defun, shouldn't it work for other ways of defining functions?
+function retain_top_func(fn, compressor) {
+    return compressor.top_retain
+        && fn instanceof AST_Defun
+        && has_flag(fn, TOP)
+        && fn.name
+        && compressor.top_retain(fn.name);
+}
+
+def_optimize(AST_Call, function(self, compressor) {
+    var exp = self.expression;
+    var fn = exp;
+    inline_array_like_spread(self.args);
+    var simple_args = self.args.every((arg) =>
+        !(arg instanceof AST_Expansion)
+    );
+
+    if (compressor.option("reduce_vars")
+        && fn instanceof AST_SymbolRef
+        && !has_annotation(self, _NOINLINE)
+    ) {
+        const fixed = fn.fixed_value();
+        if (!retain_top_func(fixed, compressor)) {
+            fn = fixed;
+        }
+    }
+
+    var is_func = fn instanceof AST_Lambda;
+
+    if (is_func && fn.pinned()) return self;
+
+    if (compressor.option("unused")
+        && simple_args
+        && is_func
+        && !fn.uses_arguments) {
+        var pos = 0, last = 0;
+        for (var i = 0, len = self.args.length; i < len; i++) {
+            if (fn.argnames[i] instanceof AST_Expansion) {
+                if (has_flag(fn.argnames[i].expression, UNUSED)) while (i < len) {
+                    var node = self.args[i++].drop_side_effect_free(compressor);
+                    if (node) {
+                        self.args[pos++] = node;
+                    }
+                } else while (i < len) {
+                    self.args[pos++] = self.args[i++];
+                }
+                last = pos;
+                break;
+            }
+            var trim = i >= fn.argnames.length;
+            if (trim || has_flag(fn.argnames[i], UNUSED)) {
+                var node = self.args[i].drop_side_effect_free(compressor);
+                if (node) {
+                    self.args[pos++] = node;
+                } else if (!trim) {
+                    self.args[pos++] = make_node(AST_Number, self.args[i], {
+                        value: 0
+                    });
+                    continue;
+                }
+            } else {
+                self.args[pos++] = self.args[i];
+            }
+            last = pos;
+        }
+        self.args.length = last;
+    }
+
+    if (compressor.option("unsafe")) {
+        if (exp instanceof AST_Dot && exp.start.value === "Array" && exp.property === "from" && self.args.length === 1) {
+            const [argument] = self.args;
+            if (argument instanceof AST_Array) {
+                return make_node(AST_Array, argument, {
+                    elements: argument.elements
+                }).optimize(compressor);
+            }
+        }
+        if (is_undeclared_ref(exp)) switch (exp.name) {
+          case "Array":
+            if (self.args.length != 1) {
+                return make_node(AST_Array, self, {
+                    elements: self.args
+                }).optimize(compressor);
+            } else if (self.args[0] instanceof AST_Number && self.args[0].value <= 11) {
+                const elements = [];
+                for (let i = 0; i < self.args[0].value; i++) elements.push(new AST_Hole);
+                return new AST_Array({ elements });
+            }
+            break;
+          case "Object":
+            if (self.args.length == 0) {
+                return make_node(AST_Object, self, {
+                    properties: []
+                });
+            }
+            break;
+          case "String":
+            if (self.args.length == 0) return make_node(AST_String, self, {
+                value: ""
+            });
+            if (self.args.length <= 1) return make_node(AST_Binary, self, {
+                left: self.args[0],
+                operator: "+",
+                right: make_node(AST_String, self, { value: "" })
+            }).optimize(compressor);
+            break;
+          case "Number":
+            if (self.args.length == 0) return make_node(AST_Number, self, {
+                value: 0
+            });
+            if (self.args.length == 1 && compressor.option("unsafe_math")) {
+                return make_node(AST_UnaryPrefix, self, {
+                    expression: self.args[0],
+                    operator: "+"
+                }).optimize(compressor);
+            }
+            break;
+          case "Symbol":
+            if (self.args.length == 1 && self.args[0] instanceof AST_String && compressor.option("unsafe_symbols"))
+                self.args.length = 0;
+                break;
+          case "Boolean":
+            if (self.args.length == 0) return make_node(AST_False, self);
+            if (self.args.length == 1) return make_node(AST_UnaryPrefix, self, {
+                expression: make_node(AST_UnaryPrefix, self, {
+                    expression: self.args[0],
+                    operator: "!"
+                }),
+                operator: "!"
+            }).optimize(compressor);
+            break;
+          case "RegExp":
+            var params = [];
+            if (self.args.length >= 1
+                && self.args.length <= 2
+                && self.args.every((arg) => {
+                    var value = arg.evaluate(compressor);
+                    params.push(value);
+                    return arg !== value;
+                })
+            ) {
+                let [ source, flags ] = params;
+                source = regexp_source_fix(new RegExp(source).source);
+                const rx = make_node(AST_RegExp, self, {
+                    value: { source, flags }
+                });
+                if (rx._eval(compressor) !== rx) {
+                    return rx;
+                }
+            }
+            break;
+        } else if (exp instanceof AST_Dot) switch(exp.property) {
+          case "toString":
+            if (self.args.length == 0 && !exp.expression.may_throw_on_access(compressor)) {
+                return make_node(AST_Binary, self, {
+                    left: make_node(AST_String, self, { value: "" }),
+                    operator: "+",
+                    right: exp.expression
+                }).optimize(compressor);
+            }
+            break;
+          case "join":
+            if (exp.expression instanceof AST_Array) EXIT: {
+                var separator;
+                if (self.args.length > 0) {
+                    separator = self.args[0].evaluate(compressor);
+                    if (separator === self.args[0]) break EXIT; // not a constant
+                }
+                var elements = [];
+                var consts = [];
+                for (var i = 0, len = exp.expression.elements.length; i < len; i++) {
+                    var el = exp.expression.elements[i];
+                    if (el instanceof AST_Expansion) break EXIT;
+                    var value = el.evaluate(compressor);
+                    if (value !== el) {
+                        consts.push(value);
+                    } else {
+                        if (consts.length > 0) {
+                            elements.push(make_node(AST_String, self, {
+                                value: consts.join(separator)
+                            }));
+                            consts.length = 0;
+                        }
+                        elements.push(el);
+                    }
+                }
+                if (consts.length > 0) {
+                    elements.push(make_node(AST_String, self, {
+                        value: consts.join(separator)
+                    }));
+                }
+                if (elements.length == 0) return make_node(AST_String, self, { value: "" });
+                if (elements.length == 1) {
+                    if (elements[0].is_string(compressor)) {
+                        return elements[0];
+                    }
+                    return make_node(AST_Binary, elements[0], {
+                        operator : "+",
+                        left     : make_node(AST_String, self, { value: "" }),
+                        right    : elements[0]
+                    });
+                }
+                if (separator == "") {
+                    var first;
+                    if (elements[0].is_string(compressor)
+                        || elements[1].is_string(compressor)) {
+                        first = elements.shift();
+                    } else {
+                        first = make_node(AST_String, self, { value: "" });
+                    }
+                    return elements.reduce(function(prev, el) {
+                        return make_node(AST_Binary, el, {
+                            operator : "+",
+                            left     : prev,
+                            right    : el
+                        });
+                    }, first).optimize(compressor);
+                }
+                // need this awkward cloning to not affect original element
+                // best_of will decide which one to get through.
+                var node = self.clone();
+                node.expression = node.expression.clone();
+                node.expression.expression = node.expression.expression.clone();
+                node.expression.expression.elements = elements;
+                return best_of(compressor, self, node);
+            }
+            break;
+          case "charAt":
+            if (exp.expression.is_string(compressor)) {
+                var arg = self.args[0];
+                var index = arg ? arg.evaluate(compressor) : 0;
+                if (index !== arg) {
+                    return make_node(AST_Sub, exp, {
+                        expression: exp.expression,
+                        property: make_node_from_constant(index | 0, arg || exp)
+                    }).optimize(compressor);
+                }
+            }
+            break;
+          case "apply":
+            if (self.args.length == 2 && self.args[1] instanceof AST_Array) {
+                var args = self.args[1].elements.slice();
+                args.unshift(self.args[0]);
+                return make_node(AST_Call, self, {
+                    expression: make_node(AST_Dot, exp, {
+                        expression: exp.expression,
+                        optional: false,
+                        property: "call"
+                    }),
+                    args: args
+                }).optimize(compressor);
+            }
+            break;
+          case "call":
+            var func = exp.expression;
+            if (func instanceof AST_SymbolRef) {
+                func = func.fixed_value();
+            }
+            if (func instanceof AST_Lambda && !func.contains_this()) {
+                return (self.args.length ? make_sequence(this, [
+                    self.args[0],
+                    make_node(AST_Call, self, {
+                        expression: exp.expression,
+                        args: self.args.slice(1)
+                    })
+                ]) : make_node(AST_Call, self, {
+                    expression: exp.expression,
+                    args: []
+                })).optimize(compressor);
+            }
+            break;
+        }
+    }
+
+    if (compressor.option("unsafe_Function")
+        && is_undeclared_ref(exp)
+        && exp.name == "Function") {
+        // new Function() => function(){}
+        if (self.args.length == 0) return make_node(AST_Function, self, {
+            argnames: [],
+            body: []
+        }).optimize(compressor);
+        var nth_identifier = compressor.mangle_options && compressor.mangle_options.nth_identifier || base54;
+        if (self.args.every((x) => x instanceof AST_String)) {
+            // quite a corner-case, but we can handle it:
+            //   https://github.com/mishoo/UglifyJS2/issues/203
+            // if the code argument is a constant, then we can minify it.
+            try {
+                var code = "n(function(" + self.args.slice(0, -1).map(function(arg) {
+                    return arg.value;
+                }).join(",") + "){" + self.args[self.args.length - 1].value + "})";
+                var ast = parse(code);
+                var mangle = { ie8: compressor.option("ie8"), nth_identifier: nth_identifier };
+                ast.figure_out_scope(mangle);
+                var comp = new Compressor(compressor.options, {
+                    mangle_options: compressor.mangle_options
+                });
+                ast = ast.transform(comp);
+                ast.figure_out_scope(mangle);
+                ast.compute_char_frequency(mangle);
+                ast.mangle_names(mangle);
+                var fun;
+                walk(ast, node => {
+                    if (is_func_expr(node)) {
+                        fun = node;
+                        return walk_abort;
+                    }
+                });
+                var code = OutputStream();
+                AST_BlockStatement.prototype._codegen.call(fun, fun, code);
+                self.args = [
+                    make_node(AST_String, self, {
+                        value: fun.argnames.map(function(arg) {
+                            return arg.print_to_string();
+                        }).join(",")
+                    }),
+                    make_node(AST_String, self.args[self.args.length - 1], {
+                        value: code.get().replace(/^{|}$/g, "")
+                    })
+                ];
+                return self;
+            } catch (ex) {
+                if (!(ex instanceof JS_Parse_Error)) {
+                    throw ex;
+                }
+
+                // Otherwise, it crashes at runtime. Or maybe it's nonstandard syntax.
+            }
+        }
+    }
+
+    var stat = is_func && fn.body[0];
+    var is_regular_func = is_func && !fn.is_generator && !fn.async;
+    var can_inline = is_regular_func && compressor.option("inline") && !self.is_callee_pure(compressor);
+    if (can_inline && stat instanceof AST_Return) {
+        let returned = stat.value;
+        if (!returned || returned.is_constant_expression()) {
+            if (returned) {
+                returned = returned.clone(true);
+            } else {
+                returned = make_node(AST_Undefined, self);
+            }
+            const args = self.args.concat(returned);
+            return make_sequence(self, args).optimize(compressor);
+        }
+
+        // optimize identity function
+        if (
+            fn.argnames.length === 1
+            && (fn.argnames[0] instanceof AST_SymbolFunarg)
+            && self.args.length < 2
+            && returned instanceof AST_SymbolRef
+            && returned.name === fn.argnames[0].name
+        ) {
+            const replacement =
+                (self.args[0] || make_node(AST_Undefined)).optimize(compressor);
+
+            let parent;
+            if (
+                replacement instanceof AST_PropAccess
+                && (parent = compressor.parent()) instanceof AST_Call
+                && parent.expression === self
+            ) {
+                // identity function was being used to remove `this`, like in
+                //
+                // id(bag.no_this)(...)
+                //
+                // Replace with a larger but more effish (0, bag.no_this) wrapper.
+
+                return make_sequence(self, [
+                    make_node(AST_Number, self, { value: 0 }),
+                    replacement
+                ]);
+            }
+            // replace call with first argument or undefined if none passed
+            return replacement;
+        }
+    }
+
+    if (can_inline) {
+        var scope, in_loop, level = -1;
+        let def;
+        let returned_value;
+        let nearest_scope;
+        if (simple_args
+            && !fn.uses_arguments
+            && !(compressor.parent() instanceof AST_Class)
+            && !(fn.name && fn instanceof AST_Function)
+            && (returned_value = can_flatten_body(stat))
+            && (exp === fn
+                || has_annotation(self, _INLINE)
+                || compressor.option("unused")
+                    && (def = exp.definition()).references.length == 1
+                    && !is_recursive_ref(compressor, def)
+                    && fn.is_constant_expression(exp.scope))
+            && !has_annotation(self, _PURE | _NOINLINE)
+            && !fn.contains_this()
+            && can_inject_symbols()
+            && (nearest_scope = find_scope(compressor))
+            && !scope_encloses_variables_in_this_scope(nearest_scope, fn)
+            && !(function in_default_assign() {
+                    // Due to the fact function parameters have their own scope
+                    // which can't use `var something` in the function body within,
+                    // we simply don't inline into DefaultAssign.
+                    let i = 0;
+                    let p;
+                    while ((p = compressor.parent(i++))) {
+                        if (p instanceof AST_DefaultAssign) return true;
+                        if (p instanceof AST_Block) break;
+                    }
+                    return false;
+                })()
+            && !(scope instanceof AST_Class)
+        ) {
+            set_flag(fn, SQUEEZED);
+            nearest_scope.add_child_scope(fn);
+            return make_sequence(self, flatten_fn(returned_value)).optimize(compressor);
+        }
+    }
+
+    if (can_inline && has_annotation(self, _INLINE)) {
+        set_flag(fn, SQUEEZED);
+        fn = make_node(fn.CTOR === AST_Defun ? AST_Function : fn.CTOR, fn, fn);
+        fn = fn.clone(true);
+        fn.figure_out_scope({}, {
+            parent_scope: find_scope(compressor),
+            toplevel: compressor.get_toplevel()
+        });
+
+        return make_node(AST_Call, self, {
+            expression: fn,
+            args: self.args,
+        }).optimize(compressor);
+    }
+
+    const can_drop_this_call = is_regular_func && compressor.option("side_effects") && fn.body.every(is_empty);
+    if (can_drop_this_call) {
+        var args = self.args.concat(make_node(AST_Undefined, self));
+        return make_sequence(self, args).optimize(compressor);
+    }
+
+    if (compressor.option("negate_iife")
+        && compressor.parent() instanceof AST_SimpleStatement
+        && is_iife_call(self)) {
+        return self.negate(compressor, true);
+    }
+
+    var ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+
+    return self;
+
+    function return_value(stat) {
+        if (!stat) return make_node(AST_Undefined, self);
+        if (stat instanceof AST_Return) {
+            if (!stat.value) return make_node(AST_Undefined, self);
+            return stat.value.clone(true);
+        }
+        if (stat instanceof AST_SimpleStatement) {
+            return make_node(AST_UnaryPrefix, stat, {
+                operator: "void",
+                expression: stat.body.clone(true)
+            });
+        }
+    }
+
+    function can_flatten_body(stat) {
+        var body = fn.body;
+        var len = body.length;
+        if (compressor.option("inline") < 3) {
+            return len == 1 && return_value(stat);
+        }
+        stat = null;
+        for (var i = 0; i < len; i++) {
+            var line = body[i];
+            if (line instanceof AST_Var) {
+                if (stat && !line.definitions.every((var_def) =>
+                    !var_def.value
+                )) {
+                    return false;
+                }
+            } else if (stat) {
+                return false;
+            } else if (!(line instanceof AST_EmptyStatement)) {
+                stat = line;
+            }
+        }
+        return return_value(stat);
+    }
+
+    function can_inject_args(block_scoped, safe_to_inject) {
+        for (var i = 0, len = fn.argnames.length; i < len; i++) {
+            var arg = fn.argnames[i];
+            if (arg instanceof AST_DefaultAssign) {
+                if (has_flag(arg.left, UNUSED)) continue;
+                return false;
+            }
+            if (arg instanceof AST_Destructuring) return false;
+            if (arg instanceof AST_Expansion) {
+                if (has_flag(arg.expression, UNUSED)) continue;
+                return false;
+            }
+            if (has_flag(arg, UNUSED)) continue;
+            if (!safe_to_inject
+                || block_scoped.has(arg.name)
+                || identifier_atom.has(arg.name)
+                || scope.conflicting_def(arg.name)) {
+                return false;
+            }
+            if (in_loop) in_loop.push(arg.definition());
+        }
+        return true;
+    }
+
+    function can_inject_vars(block_scoped, safe_to_inject) {
+        var len = fn.body.length;
+        for (var i = 0; i < len; i++) {
+            var stat = fn.body[i];
+            if (!(stat instanceof AST_Var)) continue;
+            if (!safe_to_inject) return false;
+            for (var j = stat.definitions.length; --j >= 0;) {
+                var name = stat.definitions[j].name;
+                if (name instanceof AST_Destructuring
+                    || block_scoped.has(name.name)
+                    || identifier_atom.has(name.name)
+                    || scope.conflicting_def(name.name)) {
+                    return false;
+                }
+                if (in_loop) in_loop.push(name.definition());
+            }
+        }
+        return true;
+    }
+
+    function can_inject_symbols() {
+        var block_scoped = new Set();
+        do {
+            scope = compressor.parent(++level);
+            if (scope.is_block_scope() && scope.block_scope) {
+                // TODO this is sometimes undefined during compression.
+                // But it should always have a value!
+                scope.block_scope.variables.forEach(function (variable) {
+                    block_scoped.add(variable.name);
+                });
+            }
+            if (scope instanceof AST_Catch) {
+                // TODO can we delete? AST_Catch is a block scope.
+                if (scope.argname) {
+                    block_scoped.add(scope.argname.name);
+                }
+            } else if (scope instanceof AST_IterationStatement) {
+                in_loop = [];
+            } else if (scope instanceof AST_SymbolRef) {
+                if (scope.fixed_value() instanceof AST_Scope) return false;
+            }
+        } while (!(scope instanceof AST_Scope));
+
+        var safe_to_inject = !(scope instanceof AST_Toplevel) || compressor.toplevel.vars;
+        var inline = compressor.option("inline");
+        if (!can_inject_vars(block_scoped, inline >= 3 && safe_to_inject)) return false;
+        if (!can_inject_args(block_scoped, inline >= 2 && safe_to_inject)) return false;
+        return !in_loop || in_loop.length == 0 || !is_reachable(fn, in_loop);
+    }
+
+    function append_var(decls, expressions, name, value) {
+        var def = name.definition();
+
+        // Name already exists, only when a function argument had the same name
+        const already_appended = scope.variables.has(name.name);
+        if (!already_appended) {
+            scope.variables.set(name.name, def);
+            scope.enclosed.push(def);
+            decls.push(make_node(AST_VarDef, name, {
+                name: name,
+                value: null
+            }));
+        }
+
+        var sym = make_node(AST_SymbolRef, name, name);
+        def.references.push(sym);
+        if (value) expressions.push(make_node(AST_Assign, self, {
+            operator: "=",
+            logical: false,
+            left: sym,
+            right: value.clone()
+        }));
+    }
+
+    function flatten_args(decls, expressions) {
+        var len = fn.argnames.length;
+        for (var i = self.args.length; --i >= len;) {
+            expressions.push(self.args[i]);
+        }
+        for (i = len; --i >= 0;) {
+            var name = fn.argnames[i];
+            var value = self.args[i];
+            if (has_flag(name, UNUSED) || !name.name || scope.conflicting_def(name.name)) {
+                if (value) expressions.push(value);
+            } else {
+                var symbol = make_node(AST_SymbolVar, name, name);
+                name.definition().orig.push(symbol);
+                if (!value && in_loop) value = make_node(AST_Undefined, self);
+                append_var(decls, expressions, symbol, value);
+            }
+        }
+        decls.reverse();
+        expressions.reverse();
+    }
+
+    function flatten_vars(decls, expressions) {
+        var pos = expressions.length;
+        for (var i = 0, lines = fn.body.length; i < lines; i++) {
+            var stat = fn.body[i];
+            if (!(stat instanceof AST_Var)) continue;
+            for (var j = 0, defs = stat.definitions.length; j < defs; j++) {
+                var var_def = stat.definitions[j];
+                var name = var_def.name;
+                append_var(decls, expressions, name, var_def.value);
+                if (in_loop && fn.argnames.every((argname) =>
+                    argname.name != name.name
+                )) {
+                    var def = fn.variables.get(name.name);
+                    var sym = make_node(AST_SymbolRef, name, name);
+                    def.references.push(sym);
+                    expressions.splice(pos++, 0, make_node(AST_Assign, var_def, {
+                        operator: "=",
+                        logical: false,
+                        left: sym,
+                        right: make_node(AST_Undefined, name)
+                    }));
+                }
+            }
+        }
+    }
+
+    function flatten_fn(returned_value) {
+        var decls = [];
+        var expressions = [];
+        flatten_args(decls, expressions);
+        flatten_vars(decls, expressions);
+        expressions.push(returned_value);
+
+        if (decls.length) {
+            const i = scope.body.indexOf(compressor.parent(level - 1)) + 1;
+            scope.body.splice(i, 0, make_node(AST_Var, fn, {
+                definitions: decls
+            }));
+        }
+
+        return expressions.map(exp => exp.clone(true));
+    }
+});
+
+def_optimize(AST_New, function(self, compressor) {
+    if (
+        compressor.option("unsafe") &&
+        is_undeclared_ref(self.expression) &&
+        ["Object", "RegExp", "Function", "Error", "Array"].includes(self.expression.name)
+    ) return make_node(AST_Call, self, self).transform(compressor);
+    return self;
+});
+
+def_optimize(AST_Sequence, function(self, compressor) {
+    if (!compressor.option("side_effects")) return self;
+    var expressions = [];
+    filter_for_side_effects();
+    var end = expressions.length - 1;
+    trim_right_for_undefined();
+    if (end == 0) {
+        self = maintain_this_binding(compressor.parent(), compressor.self(), expressions[0]);
+        if (!(self instanceof AST_Sequence)) self = self.optimize(compressor);
+        return self;
+    }
+    self.expressions = expressions;
+    return self;
+
+    function filter_for_side_effects() {
+        var first = first_in_statement(compressor);
+        var last = self.expressions.length - 1;
+        self.expressions.forEach(function(expr, index) {
+            if (index < last) expr = expr.drop_side_effect_free(compressor, first);
+            if (expr) {
+                merge_sequence(expressions, expr);
+                first = false;
+            }
+        });
+    }
+
+    function trim_right_for_undefined() {
+        while (end > 0 && is_undefined(expressions[end], compressor)) end--;
+        if (end < expressions.length - 1) {
+            expressions[end] = make_node(AST_UnaryPrefix, self, {
+                operator   : "void",
+                expression : expressions[end]
+            });
+            expressions.length = end + 1;
+        }
+    }
+});
+
+AST_Unary.DEFMETHOD("lift_sequences", function(compressor) {
+    if (compressor.option("sequences")) {
+        if (this.expression instanceof AST_Sequence) {
+            var x = this.expression.expressions.slice();
+            var e = this.clone();
+            e.expression = x.pop();
+            x.push(e);
+            return make_sequence(this, x).optimize(compressor);
+        }
+    }
+    return this;
+});
+
+def_optimize(AST_UnaryPostfix, function(self, compressor) {
+    return self.lift_sequences(compressor);
+});
+
+def_optimize(AST_UnaryPrefix, function(self, compressor) {
+    var e = self.expression;
+    if (
+        self.operator == "delete" &&
+        !(
+            e instanceof AST_SymbolRef ||
+            e instanceof AST_PropAccess ||
+            e instanceof AST_Chain ||
+            is_identifier_atom(e)
+        )
+    ) {
+        return make_sequence(self, [e, make_node(AST_True, self)]).optimize(compressor);
+    }
+    var seq = self.lift_sequences(compressor);
+    if (seq !== self) {
+        return seq;
+    }
+    if (compressor.option("side_effects") && self.operator == "void") {
+        e = e.drop_side_effect_free(compressor);
+        if (e) {
+            self.expression = e;
+            return self;
+        } else {
+            return make_node(AST_Undefined, self).optimize(compressor);
+        }
+    }
+    if (compressor.in_boolean_context()) {
+        switch (self.operator) {
+          case "!":
+            if (e instanceof AST_UnaryPrefix && e.operator == "!") {
+                // !!foo ==> foo, if we're in boolean context
+                return e.expression;
+            }
+            if (e instanceof AST_Binary) {
+                self = best_of(compressor, self, e.negate(compressor, first_in_statement(compressor)));
+            }
+            break;
+          case "typeof":
+            // typeof always returns a non-empty string, thus it's
+            // always true in booleans
+            // And we don't need to check if it's undeclared, because in typeof, that's OK
+            return (e instanceof AST_SymbolRef ? make_node(AST_True, self) : make_sequence(self, [
+                e,
+                make_node(AST_True, self)
+            ])).optimize(compressor);
+        }
+    }
+    if (self.operator == "-" && e instanceof AST_Infinity) {
+        e = e.transform(compressor);
+    }
+    if (e instanceof AST_Binary
+        && (self.operator == "+" || self.operator == "-")
+        && (e.operator == "*" || e.operator == "/" || e.operator == "%")) {
+        return make_node(AST_Binary, self, {
+            operator: e.operator,
+            left: make_node(AST_UnaryPrefix, e.left, {
+                operator: self.operator,
+                expression: e.left
+            }),
+            right: e.right
+        });
+    }
+    // avoids infinite recursion of numerals
+    if (self.operator != "-"
+        || !(e instanceof AST_Number || e instanceof AST_Infinity || e instanceof AST_BigInt)) {
+        var ev = self.evaluate(compressor);
+        if (ev !== self) {
+            ev = make_node_from_constant(ev, self).optimize(compressor);
+            return best_of(compressor, ev, self);
+        }
+    }
+    return self;
+});
+
+AST_Binary.DEFMETHOD("lift_sequences", function(compressor) {
+    if (compressor.option("sequences")) {
+        if (this.left instanceof AST_Sequence) {
+            var x = this.left.expressions.slice();
+            var e = this.clone();
+            e.left = x.pop();
+            x.push(e);
+            return make_sequence(this, x).optimize(compressor);
+        }
+        if (this.right instanceof AST_Sequence && !this.left.has_side_effects(compressor)) {
+            var assign = this.operator == "=" && this.left instanceof AST_SymbolRef;
+            var x = this.right.expressions;
+            var last = x.length - 1;
+            for (var i = 0; i < last; i++) {
+                if (!assign && x[i].has_side_effects(compressor)) break;
+            }
+            if (i == last) {
+                x = x.slice();
+                var e = this.clone();
+                e.right = x.pop();
+                x.push(e);
+                return make_sequence(this, x).optimize(compressor);
+            } else if (i > 0) {
+                var e = this.clone();
+                e.right = make_sequence(this.right, x.slice(i));
+                x = x.slice(0, i);
+                x.push(e);
+                return make_sequence(this, x).optimize(compressor);
+            }
+        }
+    }
+    return this;
+});
+
+var commutativeOperators = makePredicate("== === != !== * & | ^");
+function is_object(node) {
+    return node instanceof AST_Array
+        || node instanceof AST_Lambda
+        || node instanceof AST_Object
+        || node instanceof AST_Class;
+}
+
+def_optimize(AST_Binary, function(self, compressor) {
+    function reversible() {
+        return self.left.is_constant()
+            || self.right.is_constant()
+            || !self.left.has_side_effects(compressor)
+                && !self.right.has_side_effects(compressor);
+    }
+    function reverse(op) {
+        if (reversible()) {
+            if (op) self.operator = op;
+            var tmp = self.left;
+            self.left = self.right;
+            self.right = tmp;
+        }
+    }
+    if (commutativeOperators.has(self.operator)) {
+        if (self.right.is_constant()
+            && !self.left.is_constant()) {
+            // if right is a constant, whatever side effects the
+            // left side might have could not influence the
+            // result.  hence, force switch.
+
+            if (!(self.left instanceof AST_Binary
+                  && PRECEDENCE[self.left.operator] >= PRECEDENCE[self.operator])) {
+                reverse();
+            }
+        }
+    }
+    self = self.lift_sequences(compressor);
+    if (compressor.option("comparisons")) switch (self.operator) {
+      case "===":
+      case "!==":
+        var is_strict_comparison = true;
+        if ((self.left.is_string(compressor) && self.right.is_string(compressor)) ||
+            (self.left.is_number(compressor) && self.right.is_number(compressor)) ||
+            (self.left.is_boolean() && self.right.is_boolean()) ||
+            self.left.equivalent_to(self.right)) {
+            self.operator = self.operator.substr(0, 2);
+        }
+        // XXX: intentionally falling down to the next case
+      case "==":
+      case "!=":
+        // void 0 == x => null == x
+        if (!is_strict_comparison && is_undefined(self.left, compressor)) {
+            self.left = make_node(AST_Null, self.left);
+        } else if (compressor.option("typeofs")
+            // "undefined" == typeof x => undefined === x
+            && self.left instanceof AST_String
+            && self.left.value == "undefined"
+            && self.right instanceof AST_UnaryPrefix
+            && self.right.operator == "typeof") {
+            var expr = self.right.expression;
+            if (expr instanceof AST_SymbolRef ? expr.is_declared(compressor)
+                : !(expr instanceof AST_PropAccess && compressor.option("ie8"))) {
+                self.right = expr;
+                self.left = make_node(AST_Undefined, self.left).optimize(compressor);
+                if (self.operator.length == 2) self.operator += "=";
+            }
+        } else if (self.left instanceof AST_SymbolRef
+            // obj !== obj => false
+            && self.right instanceof AST_SymbolRef
+            && self.left.definition() === self.right.definition()
+            && is_object(self.left.fixed_value())) {
+            return make_node(self.operator[0] == "=" ? AST_True : AST_False, self);
+        }
+        break;
+      case "&&":
+      case "||":
+        var lhs = self.left;
+        if (lhs.operator == self.operator) {
+            lhs = lhs.right;
+        }
+        if (lhs instanceof AST_Binary
+            && lhs.operator == (self.operator == "&&" ? "!==" : "===")
+            && self.right instanceof AST_Binary
+            && lhs.operator == self.right.operator
+            && (is_undefined(lhs.left, compressor) && self.right.left instanceof AST_Null
+                || lhs.left instanceof AST_Null && is_undefined(self.right.left, compressor))
+            && !lhs.right.has_side_effects(compressor)
+            && lhs.right.equivalent_to(self.right.right)) {
+            var combined = make_node(AST_Binary, self, {
+                operator: lhs.operator.slice(0, -1),
+                left: make_node(AST_Null, self),
+                right: lhs.right
+            });
+            if (lhs !== self.left) {
+                combined = make_node(AST_Binary, self, {
+                    operator: self.operator,
+                    left: self.left.left,
+                    right: combined
+                });
+            }
+            return combined;
+        }
+        break;
+    }
+    if (self.operator == "+" && compressor.in_boolean_context()) {
+        var ll = self.left.evaluate(compressor);
+        var rr = self.right.evaluate(compressor);
+        if (ll && typeof ll == "string") {
+            return make_sequence(self, [
+                self.right,
+                make_node(AST_True, self)
+            ]).optimize(compressor);
+        }
+        if (rr && typeof rr == "string") {
+            return make_sequence(self, [
+                self.left,
+                make_node(AST_True, self)
+            ]).optimize(compressor);
+        }
+    }
+    if (compressor.option("comparisons") && self.is_boolean()) {
+        if (!(compressor.parent() instanceof AST_Binary)
+            || compressor.parent() instanceof AST_Assign) {
+            var negated = make_node(AST_UnaryPrefix, self, {
+                operator: "!",
+                expression: self.negate(compressor, first_in_statement(compressor))
+            });
+            self = best_of(compressor, self, negated);
+        }
+        if (compressor.option("unsafe_comps")) {
+            switch (self.operator) {
+              case "<": reverse(">"); break;
+              case "<=": reverse(">="); break;
+            }
+        }
+    }
+    if (self.operator == "+") {
+        if (self.right instanceof AST_String
+            && self.right.getValue() == ""
+            && self.left.is_string(compressor)) {
+            return self.left;
+        }
+        if (self.left instanceof AST_String
+            && self.left.getValue() == ""
+            && self.right.is_string(compressor)) {
+            return self.right;
+        }
+        if (self.left instanceof AST_Binary
+            && self.left.operator == "+"
+            && self.left.left instanceof AST_String
+            && self.left.left.getValue() == ""
+            && self.right.is_string(compressor)) {
+            self.left = self.left.right;
+            return self;
+        }
+    }
+    if (compressor.option("evaluate")) {
+        switch (self.operator) {
+          case "&&":
+            var ll = has_flag(self.left, TRUTHY)
+                ? true
+                : has_flag(self.left, FALSY)
+                    ? false
+                    : self.left.evaluate(compressor);
+            if (!ll) {
+                return maintain_this_binding(compressor.parent(), compressor.self(), self.left).optimize(compressor);
+            } else if (!(ll instanceof AST_Node)) {
+                return make_sequence(self, [ self.left, self.right ]).optimize(compressor);
+            }
+            var rr = self.right.evaluate(compressor);
+            if (!rr) {
+                if (compressor.in_boolean_context()) {
+                    return make_sequence(self, [
+                        self.left,
+                        make_node(AST_False, self)
+                    ]).optimize(compressor);
+                } else {
+                    set_flag(self, FALSY);
+                }
+            } else if (!(rr instanceof AST_Node)) {
+                var parent = compressor.parent();
+                if (parent.operator == "&&" && parent.left === compressor.self() || compressor.in_boolean_context()) {
+                    return self.left.optimize(compressor);
+                }
+            }
+            // x || false && y ---> x ? y : false
+            if (self.left.operator == "||") {
+                var lr = self.left.right.evaluate(compressor);
+                if (!lr) return make_node(AST_Conditional, self, {
+                    condition: self.left.left,
+                    consequent: self.right,
+                    alternative: self.left.right
+                }).optimize(compressor);
+            }
+            break;
+          case "||":
+            var ll = has_flag(self.left, TRUTHY)
+              ? true
+              : has_flag(self.left, FALSY)
+                ? false
+                : self.left.evaluate(compressor);
+            if (!ll) {
+                return make_sequence(self, [ self.left, self.right ]).optimize(compressor);
+            } else if (!(ll instanceof AST_Node)) {
+                return maintain_this_binding(compressor.parent(), compressor.self(), self.left).optimize(compressor);
+            }
+            var rr = self.right.evaluate(compressor);
+            if (!rr) {
+                var parent = compressor.parent();
+                if (parent.operator == "||" && parent.left === compressor.self() || compressor.in_boolean_context()) {
+                    return self.left.optimize(compressor);
+                }
+            } else if (!(rr instanceof AST_Node)) {
+                if (compressor.in_boolean_context()) {
+                    return make_sequence(self, [
+                        self.left,
+                        make_node(AST_True, self)
+                    ]).optimize(compressor);
+                } else {
+                    set_flag(self, TRUTHY);
+                }
+            }
+            if (self.left.operator == "&&") {
+                var lr = self.left.right.evaluate(compressor);
+                if (lr && !(lr instanceof AST_Node)) return make_node(AST_Conditional, self, {
+                    condition: self.left.left,
+                    consequent: self.left.right,
+                    alternative: self.right
+                }).optimize(compressor);
+            }
+            break;
+          case "??":
+            if (is_nullish(self.left, compressor)) {
+                return self.right;
+            }
+
+            var ll = self.left.evaluate(compressor);
+            if (!(ll instanceof AST_Node)) {
+                // if we know the value for sure we can simply compute right away.
+                return ll == null ? self.right : self.left;
+            }
+
+            if (compressor.in_boolean_context()) {
+                const rr = self.right.evaluate(compressor);
+                if (!(rr instanceof AST_Node) && !rr) {
+                    return self.left;
+                }
+            }
+        }
+        var associative = true;
+        switch (self.operator) {
+          case "+":
+            // (x + "foo") + "bar" => x + "foobar"
+            if (self.right instanceof AST_Constant
+                && self.left instanceof AST_Binary
+                && self.left.operator == "+"
+                && self.left.is_string(compressor)) {
+                var binary = make_node(AST_Binary, self, {
+                    operator: "+",
+                    left: self.left.right,
+                    right: self.right,
+                });
+                var r = binary.optimize(compressor);
+                if (binary !== r) {
+                    self = make_node(AST_Binary, self, {
+                        operator: "+",
+                        left: self.left.left,
+                        right: r
+                    });
+                }
+            }
+            // (x + "foo") + ("bar" + y) => (x + "foobar") + y
+            if (self.left instanceof AST_Binary
+                && self.left.operator == "+"
+                && self.left.is_string(compressor)
+                && self.right instanceof AST_Binary
+                && self.right.operator == "+"
+                && self.right.is_string(compressor)) {
+                var binary = make_node(AST_Binary, self, {
+                    operator: "+",
+                    left: self.left.right,
+                    right: self.right.left,
+                });
+                var m = binary.optimize(compressor);
+                if (binary !== m) {
+                    self = make_node(AST_Binary, self, {
+                        operator: "+",
+                        left: make_node(AST_Binary, self.left, {
+                            operator: "+",
+                            left: self.left.left,
+                            right: m
+                        }),
+                        right: self.right.right
+                    });
+                }
+            }
+            // a + -b => a - b
+            if (self.right instanceof AST_UnaryPrefix
+                && self.right.operator == "-"
+                && self.left.is_number(compressor)) {
+                self = make_node(AST_Binary, self, {
+                    operator: "-",
+                    left: self.left,
+                    right: self.right.expression
+                });
+                break;
+            }
+            // -a + b => b - a
+            if (self.left instanceof AST_UnaryPrefix
+                && self.left.operator == "-"
+                && reversible()
+                && self.right.is_number(compressor)) {
+                self = make_node(AST_Binary, self, {
+                    operator: "-",
+                    left: self.right,
+                    right: self.left.expression
+                });
+                break;
+            }
+            // `foo${bar}baz` + 1 => `foo${bar}baz1`
+            if (self.left instanceof AST_TemplateString) {
+                var l = self.left;
+                var r = self.right.evaluate(compressor);
+                if (r != self.right) {
+                    l.segments[l.segments.length - 1].value += String(r);
+                    return l;
+                }
+            }
+            // 1 + `foo${bar}baz` => `1foo${bar}baz`
+            if (self.right instanceof AST_TemplateString) {
+                var r = self.right;
+                var l = self.left.evaluate(compressor);
+                if (l != self.left) {
+                    r.segments[0].value = String(l) + r.segments[0].value;
+                    return r;
+                }
+            }
+            // `1${bar}2` + `foo${bar}baz` => `1${bar}2foo${bar}baz`
+            if (self.left instanceof AST_TemplateString
+                && self.right instanceof AST_TemplateString) {
+                var l = self.left;
+                var segments = l.segments;
+                var r = self.right;
+                segments[segments.length - 1].value += r.segments[0].value;
+                for (var i = 1; i < r.segments.length; i++) {
+                    segments.push(r.segments[i]);
+                }
+                return l;
+            }
+          case "*":
+            associative = compressor.option("unsafe_math");
+          case "&":
+          case "|":
+          case "^":
+            // a + +b => +b + a
+            if (self.left.is_number(compressor)
+                && self.right.is_number(compressor)
+                && reversible()
+                && !(self.left instanceof AST_Binary
+                    && self.left.operator != self.operator
+                    && PRECEDENCE[self.left.operator] >= PRECEDENCE[self.operator])) {
+                var reversed = make_node(AST_Binary, self, {
+                    operator: self.operator,
+                    left: self.right,
+                    right: self.left
+                });
+                if (self.right instanceof AST_Constant
+                    && !(self.left instanceof AST_Constant)) {
+                    self = best_of(compressor, reversed, self);
+                } else {
+                    self = best_of(compressor, self, reversed);
+                }
+            }
+            if (associative && self.is_number(compressor)) {
+                // a + (b + c) => (a + b) + c
+                if (self.right instanceof AST_Binary
+                    && self.right.operator == self.operator) {
+                    self = make_node(AST_Binary, self, {
+                        operator: self.operator,
+                        left: make_node(AST_Binary, self.left, {
+                            operator: self.operator,
+                            left: self.left,
+                            right: self.right.left,
+                            start: self.left.start,
+                            end: self.right.left.end
+                        }),
+                        right: self.right.right
+                    });
+                }
+                // (n + 2) + 3 => 5 + n
+                // (2 * n) * 3 => 6 + n
+                if (self.right instanceof AST_Constant
+                    && self.left instanceof AST_Binary
+                    && self.left.operator == self.operator) {
+                    if (self.left.left instanceof AST_Constant) {
+                        self = make_node(AST_Binary, self, {
+                            operator: self.operator,
+                            left: make_node(AST_Binary, self.left, {
+                                operator: self.operator,
+                                left: self.left.left,
+                                right: self.right,
+                                start: self.left.left.start,
+                                end: self.right.end
+                            }),
+                            right: self.left.right
+                        });
+                    } else if (self.left.right instanceof AST_Constant) {
+                        self = make_node(AST_Binary, self, {
+                            operator: self.operator,
+                            left: make_node(AST_Binary, self.left, {
+                                operator: self.operator,
+                                left: self.left.right,
+                                right: self.right,
+                                start: self.left.right.start,
+                                end: self.right.end
+                            }),
+                            right: self.left.left
+                        });
+                    }
+                }
+                // (a | 1) | (2 | d) => (3 | a) | b
+                if (self.left instanceof AST_Binary
+                    && self.left.operator == self.operator
+                    && self.left.right instanceof AST_Constant
+                    && self.right instanceof AST_Binary
+                    && self.right.operator == self.operator
+                    && self.right.left instanceof AST_Constant) {
+                    self = make_node(AST_Binary, self, {
+                        operator: self.operator,
+                        left: make_node(AST_Binary, self.left, {
+                            operator: self.operator,
+                            left: make_node(AST_Binary, self.left.left, {
+                                operator: self.operator,
+                                left: self.left.right,
+                                right: self.right.left,
+                                start: self.left.right.start,
+                                end: self.right.left.end
+                            }),
+                            right: self.left.left
+                        }),
+                        right: self.right.right
+                    });
+                }
+            }
+        }
+    }
+    // x && (y && z)  ==>  x && y && z
+    // x || (y || z)  ==>  x || y || z
+    // x + ("y" + z)  ==>  x + "y" + z
+    // "x" + (y + "z")==>  "x" + y + "z"
+    if (self.right instanceof AST_Binary
+        && self.right.operator == self.operator
+        && (lazy_op.has(self.operator)
+            || (self.operator == "+"
+                && (self.right.left.is_string(compressor)
+                    || (self.left.is_string(compressor)
+                        && self.right.right.is_string(compressor)))))
+    ) {
+        self.left = make_node(AST_Binary, self.left, {
+            operator : self.operator,
+            left     : self.left.transform(compressor),
+            right    : self.right.left.transform(compressor)
+        });
+        self.right = self.right.right.transform(compressor);
+        return self.transform(compressor);
+    }
+    var ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+    return self;
+});
+
+def_optimize(AST_SymbolExport, function(self) {
+    return self;
+});
+
+function within_array_or_object_literal(compressor) {
+    var node, level = 0;
+    while (node = compressor.parent(level++)) {
+        if (node instanceof AST_Statement) return false;
+        if (node instanceof AST_Array
+            || node instanceof AST_ObjectKeyVal
+            || node instanceof AST_Object) {
+            return true;
+        }
+    }
+    return false;
+}
+
+def_optimize(AST_SymbolRef, function(self, compressor) {
+    if (
+        !compressor.option("ie8")
+        && is_undeclared_ref(self)
+        && !compressor.find_parent(AST_With)
+    ) {
+        switch (self.name) {
+          case "undefined":
+            return make_node(AST_Undefined, self).optimize(compressor);
+          case "NaN":
+            return make_node(AST_NaN, self).optimize(compressor);
+          case "Infinity":
+            return make_node(AST_Infinity, self).optimize(compressor);
+        }
+    }
+
+    const parent = compressor.parent();
+    if (compressor.option("reduce_vars") && is_lhs(self, parent) !== self) {
+        const def = self.definition();
+        const nearest_scope = find_scope(compressor);
+        if (compressor.top_retain && def.global && compressor.top_retain(def)) {
+            def.fixed = false;
+            def.single_use = false;
+            return self;
+        }
+
+        let fixed = self.fixed_value();
+        let single_use = def.single_use
+            && !(parent instanceof AST_Call
+                && (parent.is_callee_pure(compressor))
+                    || has_annotation(parent, _NOINLINE))
+            && !(parent instanceof AST_Export
+                && fixed instanceof AST_Lambda
+                && fixed.name);
+
+        if (single_use && fixed instanceof AST_Node) {
+            single_use =
+                !fixed.has_side_effects(compressor)
+                && !fixed.may_throw(compressor);
+        }
+
+        if (single_use && (fixed instanceof AST_Lambda || fixed instanceof AST_Class)) {
+            if (retain_top_func(fixed, compressor)) {
+                single_use = false;
+            } else if (def.scope !== self.scope
+                && (def.escaped == 1
+                    || has_flag(fixed, INLINED)
+                    || within_array_or_object_literal(compressor)
+                    || !compressor.option("reduce_funcs"))) {
+                single_use = false;
+            } else if (is_recursive_ref(compressor, def)) {
+                single_use = false;
+            } else if (def.scope !== self.scope || def.orig[0] instanceof AST_SymbolFunarg) {
+                single_use = fixed.is_constant_expression(self.scope);
+                if (single_use == "f") {
+                    var scope = self.scope;
+                    do {
+                        if (scope instanceof AST_Defun || is_func_expr(scope)) {
+                            set_flag(scope, INLINED);
+                        }
+                    } while (scope = scope.parent_scope);
+                }
+            }
+        }
+
+        if (single_use && fixed instanceof AST_Lambda) {
+            single_use =
+                def.scope === self.scope
+                    && !scope_encloses_variables_in_this_scope(nearest_scope, fixed)
+                || parent instanceof AST_Call
+                    && parent.expression === self
+                    && !scope_encloses_variables_in_this_scope(nearest_scope, fixed)
+                    && !(fixed.name && fixed.name.definition().recursive_refs > 0);
+        }
+
+        if (single_use && fixed) {
+            if (fixed instanceof AST_DefClass) {
+                set_flag(fixed, SQUEEZED);
+                fixed = make_node(AST_ClassExpression, fixed, fixed);
+            }
+            if (fixed instanceof AST_Defun) {
+                set_flag(fixed, SQUEEZED);
+                fixed = make_node(AST_Function, fixed, fixed);
+            }
+            if (def.recursive_refs > 0 && fixed.name instanceof AST_SymbolDefun) {
+                const defun_def = fixed.name.definition();
+                let lambda_def = fixed.variables.get(fixed.name.name);
+                let name = lambda_def && lambda_def.orig[0];
+                if (!(name instanceof AST_SymbolLambda)) {
+                    name = make_node(AST_SymbolLambda, fixed.name, fixed.name);
+                    name.scope = fixed;
+                    fixed.name = name;
+                    lambda_def = fixed.def_function(name);
+                }
+                walk(fixed, node => {
+                    if (node instanceof AST_SymbolRef && node.definition() === defun_def) {
+                        node.thedef = lambda_def;
+                        lambda_def.references.push(node);
+                    }
+                });
+            }
+            if (
+                (fixed instanceof AST_Lambda || fixed instanceof AST_Class)
+                && fixed.parent_scope !== nearest_scope
+            ) {
+                fixed = fixed.clone(true, compressor.get_toplevel());
+
+                nearest_scope.add_child_scope(fixed);
+            }
+            return fixed.optimize(compressor);
+        }
+
+        // multiple uses
+        if (fixed) {
+            let replace;
+
+            if (fixed instanceof AST_This) {
+                if (!(def.orig[0] instanceof AST_SymbolFunarg)
+                    && def.references.every((ref) =>
+                        def.scope === ref.scope
+                    )) {
+                    replace = fixed;
+                }
+            } else {
+                var ev = fixed.evaluate(compressor);
+                if (
+                    ev !== fixed
+                    && (compressor.option("unsafe_regexp") || !(ev instanceof RegExp))
+                ) {
+                    replace = make_node_from_constant(ev, fixed);
+                }
+            }
+
+            if (replace) {
+                const name_length = self.size(compressor);
+                const replace_size = replace.size(compressor);
+
+                let overhead = 0;
+                if (compressor.option("unused") && !compressor.exposed(def)) {
+                    overhead =
+                        (name_length + 2 + replace_size) /
+                        (def.references.length - def.assignments);
+                }
+
+                if (replace_size <= name_length + overhead) {
+                    return replace;
+                }
+            }
+        }
+    }
+
+    return self;
+});
+
+function scope_encloses_variables_in_this_scope(scope, pulled_scope) {
+    for (const enclosed of pulled_scope.enclosed) {
+        if (pulled_scope.variables.has(enclosed.name)) {
+            continue;
+        }
+        const looked_up = scope.find_variable(enclosed.name);
+        if (looked_up) {
+            if (looked_up === enclosed) continue;
+            return true;
+        }
+    }
+    return false;
+}
+
+function is_atomic(lhs, self) {
+    return lhs instanceof AST_SymbolRef || lhs.TYPE === self.TYPE;
+}
+
+def_optimize(AST_Undefined, function(self, compressor) {
+    if (compressor.option("unsafe_undefined")) {
+        var undef = find_variable(compressor, "undefined");
+        if (undef) {
+            var ref = make_node(AST_SymbolRef, self, {
+                name   : "undefined",
+                scope  : undef.scope,
+                thedef : undef
+            });
+            set_flag(ref, UNDEFINED);
+            return ref;
+        }
+    }
+    var lhs = is_lhs(compressor.self(), compressor.parent());
+    if (lhs && is_atomic(lhs, self)) return self;
+    return make_node(AST_UnaryPrefix, self, {
+        operator: "void",
+        expression: make_node(AST_Number, self, {
+            value: 0
+        })
+    });
+});
+
+def_optimize(AST_Infinity, function(self, compressor) {
+    var lhs = is_lhs(compressor.self(), compressor.parent());
+    if (lhs && is_atomic(lhs, self)) return self;
+    if (
+        compressor.option("keep_infinity")
+        && !(lhs && !is_atomic(lhs, self))
+        && !find_variable(compressor, "Infinity")
+    ) {
+        return self;
+    }
+    return make_node(AST_Binary, self, {
+        operator: "/",
+        left: make_node(AST_Number, self, {
+            value: 1
+        }),
+        right: make_node(AST_Number, self, {
+            value: 0
+        })
+    });
+});
+
+def_optimize(AST_NaN, function(self, compressor) {
+    var lhs = is_lhs(compressor.self(), compressor.parent());
+    if (lhs && !is_atomic(lhs, self)
+        || find_variable(compressor, "NaN")) {
+        return make_node(AST_Binary, self, {
+            operator: "/",
+            left: make_node(AST_Number, self, {
+                value: 0
+            }),
+            right: make_node(AST_Number, self, {
+                value: 0
+            })
+        });
+    }
+    return self;
+});
+
+function is_reachable(self, defs) {
+    const find_ref = node => {
+        if (node instanceof AST_SymbolRef && member(node.definition(), defs)) {
+            return walk_abort;
+        }
+    };
+
+    return walk_parent(self, (node, info) => {
+        if (node instanceof AST_Scope && node !== self) {
+            var parent = info.parent();
+
+            if (
+                parent instanceof AST_Call
+                && parent.expression === node
+                // Async/Generators aren't guaranteed to sync evaluate all of
+                // their body steps, so it's possible they close over the variable.
+                && !(node.async || node.is_generator)
+            ) {
+                return;
+            }
+
+            if (walk(node, find_ref)) return walk_abort;
+
+            return true;
+        }
+    });
+}
+
+const ASSIGN_OPS = makePredicate("+ - / * % >> << >>> | ^ &");
+const ASSIGN_OPS_COMMUTATIVE = makePredicate("* | ^ &");
+def_optimize(AST_Assign, function(self, compressor) {
+    if (self.logical) {
+        return self.lift_sequences(compressor);
+    }
+
+    var def;
+    if (compressor.option("dead_code")
+        && self.left instanceof AST_SymbolRef
+        && (def = self.left.definition()).scope === compressor.find_parent(AST_Lambda)) {
+        var level = 0, node, parent = self;
+        do {
+            node = parent;
+            parent = compressor.parent(level++);
+            if (parent instanceof AST_Exit) {
+                if (in_try(level, parent)) break;
+                if (is_reachable(def.scope, [ def ])) break;
+                if (self.operator == "=") return self.right;
+                def.fixed = false;
+                return make_node(AST_Binary, self, {
+                    operator: self.operator.slice(0, -1),
+                    left: self.left,
+                    right: self.right
+                }).optimize(compressor);
+            }
+        } while (parent instanceof AST_Binary && parent.right === node
+            || parent instanceof AST_Sequence && parent.tail_node() === node);
+    }
+    self = self.lift_sequences(compressor);
+    if (self.operator == "=" && self.left instanceof AST_SymbolRef && self.right instanceof AST_Binary) {
+        // x = expr1 OP expr2
+        if (self.right.left instanceof AST_SymbolRef
+            && self.right.left.name == self.left.name
+            && ASSIGN_OPS.has(self.right.operator)) {
+            // x = x - 2  --->  x -= 2
+            self.operator = self.right.operator + "=";
+            self.right = self.right.right;
+        } else if (self.right.right instanceof AST_SymbolRef
+            && self.right.right.name == self.left.name
+            && ASSIGN_OPS_COMMUTATIVE.has(self.right.operator)
+            && !self.right.left.has_side_effects(compressor)) {
+            // x = 2 & x  --->  x &= 2
+            self.operator = self.right.operator + "=";
+            self.right = self.right.left;
+        }
+    }
+    return self;
+
+    function in_try(level, node) {
+        var right = self.right;
+        self.right = make_node(AST_Null, right);
+        var may_throw = node.may_throw(compressor);
+        self.right = right;
+        var scope = self.left.definition().scope;
+        var parent;
+        while ((parent = compressor.parent(level++)) !== scope) {
+            if (parent instanceof AST_Try) {
+                if (parent.bfinally) return true;
+                if (may_throw && parent.bcatch) return true;
+            }
+        }
+    }
+});
+
+def_optimize(AST_DefaultAssign, function(self, compressor) {
+    if (!compressor.option("evaluate")) {
+        return self;
+    }
+    var evaluateRight = self.right.evaluate(compressor);
+
+    // `[x = undefined] = foo` ---> `[x] = foo`
+    if (evaluateRight === undefined) {
+        self = self.left;
+    } else if (evaluateRight !== self.right) {
+        evaluateRight = make_node_from_constant(evaluateRight, self.right);
+        self.right = best_of_expression(evaluateRight, self.right);
+    }
+
+    return self;
+});
+
+function is_nullish_check(check, check_subject, compressor) {
+    if (check_subject.may_throw(compressor)) return false;
+
+    let nullish_side;
+
+    // foo == null
+    if (
+        check instanceof AST_Binary
+        && check.operator === "=="
+        // which side is nullish?
+        && (
+            (nullish_side = is_nullish(check.left, compressor) && check.left)
+            || (nullish_side = is_nullish(check.right, compressor) && check.right)
+        )
+        // is the other side the same as the check_subject
+        && (
+            nullish_side === check.left
+                ? check.right
+                : check.left
+        ).equivalent_to(check_subject)
+    ) {
+        return true;
+    }
+
+    // foo === null || foo === undefined
+    if (check instanceof AST_Binary && check.operator === "||") {
+        let null_cmp;
+        let undefined_cmp;
+
+        const find_comparison = cmp => {
+            if (!(
+                cmp instanceof AST_Binary
+                && (cmp.operator === "===" || cmp.operator === "==")
+            )) {
+                return false;
+            }
+
+            let found = 0;
+            let defined_side;
+
+            if (cmp.left instanceof AST_Null) {
+                found++;
+                null_cmp = cmp;
+                defined_side = cmp.right;
+            }
+            if (cmp.right instanceof AST_Null) {
+                found++;
+                null_cmp = cmp;
+                defined_side = cmp.left;
+            }
+            if (is_undefined(cmp.left, compressor)) {
+                found++;
+                undefined_cmp = cmp;
+                defined_side = cmp.right;
+            }
+            if (is_undefined(cmp.right, compressor)) {
+                found++;
+                undefined_cmp = cmp;
+                defined_side = cmp.left;
+            }
+
+            if (found !== 1) {
+                return false;
+            }
+
+            if (!defined_side.equivalent_to(check_subject)) {
+                return false;
+            }
+
+            return true;
+        };
+
+        if (!find_comparison(check.left)) return false;
+        if (!find_comparison(check.right)) return false;
+
+        if (null_cmp && undefined_cmp && null_cmp !== undefined_cmp) {
+            return true;
+        }
+    }
+
+    return false;
+}
+
+def_optimize(AST_Conditional, function(self, compressor) {
+    if (!compressor.option("conditionals")) return self;
+    // This looks like lift_sequences(), should probably be under "sequences"
+    if (self.condition instanceof AST_Sequence) {
+        var expressions = self.condition.expressions.slice();
+        self.condition = expressions.pop();
+        expressions.push(self);
+        return make_sequence(self, expressions);
+    }
+    var cond = self.condition.evaluate(compressor);
+    if (cond !== self.condition) {
+        if (cond) {
+            return maintain_this_binding(compressor.parent(), compressor.self(), self.consequent);
+        } else {
+            return maintain_this_binding(compressor.parent(), compressor.self(), self.alternative);
+        }
+    }
+    var negated = cond.negate(compressor, first_in_statement(compressor));
+    if (best_of(compressor, cond, negated) === negated) {
+        self = make_node(AST_Conditional, self, {
+            condition: negated,
+            consequent: self.alternative,
+            alternative: self.consequent
+        });
+    }
+    var condition = self.condition;
+    var consequent = self.consequent;
+    var alternative = self.alternative;
+    // x?x:y --> x||y
+    if (condition instanceof AST_SymbolRef
+        && consequent instanceof AST_SymbolRef
+        && condition.definition() === consequent.definition()) {
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: condition,
+            right: alternative
+        });
+    }
+    // if (foo) exp = something; else exp = something_else;
+    //                   |
+    //                   v
+    // exp = foo ? something : something_else;
+    if (
+        consequent instanceof AST_Assign
+        && alternative instanceof AST_Assign
+        && consequent.operator === alternative.operator
+        && consequent.logical === alternative.logical
+        && consequent.left.equivalent_to(alternative.left)
+        && (!self.condition.has_side_effects(compressor)
+            || consequent.operator == "="
+                && !consequent.left.has_side_effects(compressor))
+    ) {
+        return make_node(AST_Assign, self, {
+            operator: consequent.operator,
+            left: consequent.left,
+            logical: consequent.logical,
+            right: make_node(AST_Conditional, self, {
+                condition: self.condition,
+                consequent: consequent.right,
+                alternative: alternative.right
+            })
+        });
+    }
+    // x ? y(a) : y(b) --> y(x ? a : b)
+    var arg_index;
+    if (consequent instanceof AST_Call
+        && alternative.TYPE === consequent.TYPE
+        && consequent.args.length > 0
+        && consequent.args.length == alternative.args.length
+        && consequent.expression.equivalent_to(alternative.expression)
+        && !self.condition.has_side_effects(compressor)
+        && !consequent.expression.has_side_effects(compressor)
+        && typeof (arg_index = single_arg_diff()) == "number") {
+        var node = consequent.clone();
+        node.args[arg_index] = make_node(AST_Conditional, self, {
+            condition: self.condition,
+            consequent: consequent.args[arg_index],
+            alternative: alternative.args[arg_index]
+        });
+        return node;
+    }
+    // a ? b : c ? b : d --> (a || c) ? b : d
+    if (alternative instanceof AST_Conditional
+        && consequent.equivalent_to(alternative.consequent)) {
+        return make_node(AST_Conditional, self, {
+            condition: make_node(AST_Binary, self, {
+                operator: "||",
+                left: condition,
+                right: alternative.condition
+            }),
+            consequent: consequent,
+            alternative: alternative.alternative
+        }).optimize(compressor);
+    }
+
+    // a == null ? b : a -> a ?? b
+    if (
+        compressor.option("ecma") >= 2020 &&
+        is_nullish_check(condition, alternative, compressor)
+    ) {
+        return make_node(AST_Binary, self, {
+            operator: "??",
+            left: alternative,
+            right: consequent
+        }).optimize(compressor);
+    }
+
+    // a ? b : (c, b) --> (a || c), b
+    if (alternative instanceof AST_Sequence
+        && consequent.equivalent_to(alternative.expressions[alternative.expressions.length - 1])) {
+        return make_sequence(self, [
+            make_node(AST_Binary, self, {
+                operator: "||",
+                left: condition,
+                right: make_sequence(self, alternative.expressions.slice(0, -1))
+            }),
+            consequent
+        ]).optimize(compressor);
+    }
+    // a ? b : (c && b) --> (a || c) && b
+    if (alternative instanceof AST_Binary
+        && alternative.operator == "&&"
+        && consequent.equivalent_to(alternative.right)) {
+        return make_node(AST_Binary, self, {
+            operator: "&&",
+            left: make_node(AST_Binary, self, {
+                operator: "||",
+                left: condition,
+                right: alternative.left
+            }),
+            right: consequent
+        }).optimize(compressor);
+    }
+    // x?y?z:a:a --> x&&y?z:a
+    if (consequent instanceof AST_Conditional
+        && consequent.alternative.equivalent_to(alternative)) {
+        return make_node(AST_Conditional, self, {
+            condition: make_node(AST_Binary, self, {
+                left: self.condition,
+                operator: "&&",
+                right: consequent.condition
+            }),
+            consequent: consequent.consequent,
+            alternative: alternative
+        });
+    }
+    // x ? y : y --> x, y
+    if (consequent.equivalent_to(alternative)) {
+        return make_sequence(self, [
+            self.condition,
+            consequent
+        ]).optimize(compressor);
+    }
+    // x ? y || z : z --> x && y || z
+    if (consequent instanceof AST_Binary
+        && consequent.operator == "||"
+        && consequent.right.equivalent_to(alternative)) {
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: make_node(AST_Binary, self, {
+                operator: "&&",
+                left: self.condition,
+                right: consequent.left
+            }),
+            right: alternative
+        }).optimize(compressor);
+    }
+
+    const in_bool = compressor.in_boolean_context();
+    if (is_true(self.consequent)) {
+        if (is_false(self.alternative)) {
+            // c ? true : false ---> !!c
+            return booleanize(self.condition);
+        }
+        // c ? true : x ---> !!c || x
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: booleanize(self.condition),
+            right: self.alternative
+        });
+    }
+    if (is_false(self.consequent)) {
+        if (is_true(self.alternative)) {
+            // c ? false : true ---> !c
+            return booleanize(self.condition.negate(compressor));
+        }
+        // c ? false : x ---> !c && x
+        return make_node(AST_Binary, self, {
+            operator: "&&",
+            left: booleanize(self.condition.negate(compressor)),
+            right: self.alternative
+        });
+    }
+    if (is_true(self.alternative)) {
+        // c ? x : true ---> !c || x
+        return make_node(AST_Binary, self, {
+            operator: "||",
+            left: booleanize(self.condition.negate(compressor)),
+            right: self.consequent
+        });
+    }
+    if (is_false(self.alternative)) {
+        // c ? x : false ---> !!c && x
+        return make_node(AST_Binary, self, {
+            operator: "&&",
+            left: booleanize(self.condition),
+            right: self.consequent
+        });
+    }
+
+    return self;
+
+    function booleanize(node) {
+        if (node.is_boolean()) return node;
+        // !!expression
+        return make_node(AST_UnaryPrefix, node, {
+            operator: "!",
+            expression: node.negate(compressor)
+        });
+    }
+
+    // AST_True or !0
+    function is_true(node) {
+        return node instanceof AST_True
+            || in_bool
+                && node instanceof AST_Constant
+                && node.getValue()
+            || (node instanceof AST_UnaryPrefix
+                && node.operator == "!"
+                && node.expression instanceof AST_Constant
+                && !node.expression.getValue());
+    }
+    // AST_False or !1
+    function is_false(node) {
+        return node instanceof AST_False
+            || in_bool
+                && node instanceof AST_Constant
+                && !node.getValue()
+            || (node instanceof AST_UnaryPrefix
+                && node.operator == "!"
+                && node.expression instanceof AST_Constant
+                && node.expression.getValue());
+    }
+
+    function single_arg_diff() {
+        var a = consequent.args;
+        var b = alternative.args;
+        for (var i = 0, len = a.length; i < len; i++) {
+            if (a[i] instanceof AST_Expansion) return;
+            if (!a[i].equivalent_to(b[i])) {
+                if (b[i] instanceof AST_Expansion) return;
+                for (var j = i + 1; j < len; j++) {
+                    if (a[j] instanceof AST_Expansion) return;
+                    if (!a[j].equivalent_to(b[j])) return;
+                }
+                return i;
+            }
+        }
+    }
+});
+
+def_optimize(AST_Boolean, function(self, compressor) {
+    if (compressor.in_boolean_context()) return make_node(AST_Number, self, {
+        value: +self.value
+    });
+    var p = compressor.parent();
+    if (compressor.option("booleans_as_integers")) {
+        if (p instanceof AST_Binary && (p.operator == "===" || p.operator == "!==")) {
+            p.operator = p.operator.replace(/=$/, "");
+        }
+        return make_node(AST_Number, self, {
+            value: +self.value
+        });
+    }
+    if (compressor.option("booleans")) {
+        if (p instanceof AST_Binary && (p.operator == "=="
+                                        || p.operator == "!=")) {
+            return make_node(AST_Number, self, {
+                value: +self.value
+            });
+        }
+        return make_node(AST_UnaryPrefix, self, {
+            operator: "!",
+            expression: make_node(AST_Number, self, {
+                value: 1 - self.value
+            })
+        });
+    }
+    return self;
+});
+
+function safe_to_flatten(value, compressor) {
+    if (value instanceof AST_SymbolRef) {
+        value = value.fixed_value();
+    }
+    if (!value) return false;
+    if (!(value instanceof AST_Lambda || value instanceof AST_Class)) return true;
+    if (!(value instanceof AST_Lambda && value.contains_this())) return true;
+    return compressor.parent() instanceof AST_New;
+}
+
+AST_PropAccess.DEFMETHOD("flatten_object", function(key, compressor) {
+    if (!compressor.option("properties")) return;
+    if (key === "__proto__") return;
+
+    var arrows = compressor.option("unsafe_arrows") && compressor.option("ecma") >= 2015;
+    var expr = this.expression;
+    if (expr instanceof AST_Object) {
+        var props = expr.properties;
+
+        for (var i = props.length; --i >= 0;) {
+            var prop = props[i];
+
+            if ("" + (prop instanceof AST_ConciseMethod ? prop.key.name : prop.key) == key) {
+                const all_props_flattenable = props.every((p) =>
+                    (p instanceof AST_ObjectKeyVal
+                        || arrows && p instanceof AST_ConciseMethod && !p.is_generator
+                    )
+                    && !p.computed_key()
+                );
+
+                if (!all_props_flattenable) return;
+                if (!safe_to_flatten(prop.value, compressor)) return;
+
+                return make_node(AST_Sub, this, {
+                    expression: make_node(AST_Array, expr, {
+                        elements: props.map(function(prop) {
+                            var v = prop.value;
+                            if (v instanceof AST_Accessor) {
+                                v = make_node(AST_Function, v, v);
+                            }
+
+                            var k = prop.key;
+                            if (k instanceof AST_Node && !(k instanceof AST_SymbolMethod)) {
+                                return make_sequence(prop, [ k, v ]);
+                            }
+
+                            return v;
+                        })
+                    }),
+                    property: make_node(AST_Number, this, {
+                        value: i
+                    })
+                });
+            }
+        }
+    }
+});
+
+def_optimize(AST_Sub, function(self, compressor) {
+    var expr = self.expression;
+    var prop = self.property;
+    if (compressor.option("properties")) {
+        var key = prop.evaluate(compressor);
+        if (key !== prop) {
+            if (typeof key == "string") {
+                if (key == "undefined") {
+                    key = undefined;
+                } else {
+                    var value = parseFloat(key);
+                    if (value.toString() == key) {
+                        key = value;
+                    }
+                }
+            }
+            prop = self.property = best_of_expression(prop, make_node_from_constant(key, prop).transform(compressor));
+            var property = "" + key;
+            if (is_basic_identifier_string(property)
+                && property.length <= prop.size() + 1) {
+                return make_node(AST_Dot, self, {
+                    expression: expr,
+                    optional: self.optional,
+                    property: property,
+                    quote: prop.quote,
+                }).optimize(compressor);
+            }
+        }
+    }
+    var fn;
+    OPT_ARGUMENTS: if (compressor.option("arguments")
+        && expr instanceof AST_SymbolRef
+        && expr.name == "arguments"
+        && expr.definition().orig.length == 1
+        && (fn = expr.scope) instanceof AST_Lambda
+        && fn.uses_arguments
+        && !(fn instanceof AST_Arrow)
+        && prop instanceof AST_Number) {
+        var index = prop.getValue();
+        var params = new Set();
+        var argnames = fn.argnames;
+        for (var n = 0; n < argnames.length; n++) {
+            if (!(argnames[n] instanceof AST_SymbolFunarg)) {
+                break OPT_ARGUMENTS; // destructuring parameter - bail
+            }
+            var param = argnames[n].name;
+            if (params.has(param)) {
+                break OPT_ARGUMENTS; // duplicate parameter - bail
+            }
+            params.add(param);
+        }
+        var argname = fn.argnames[index];
+        if (argname && compressor.has_directive("use strict")) {
+            var def = argname.definition();
+            if (!compressor.option("reduce_vars") || def.assignments || def.orig.length > 1) {
+                argname = null;
+            }
+        } else if (!argname && !compressor.option("keep_fargs") && index < fn.argnames.length + 5) {
+            while (index >= fn.argnames.length) {
+                argname = fn.create_symbol(AST_SymbolFunarg, {
+                    source: fn,
+                    scope: fn,
+                    tentative_name: "argument_" + fn.argnames.length,
+                });
+                fn.argnames.push(argname);
+            }
+        }
+        if (argname) {
+            var sym = make_node(AST_SymbolRef, self, argname);
+            sym.reference({});
+            clear_flag(argname, UNUSED);
+            return sym;
+        }
+    }
+    if (is_lhs(self, compressor.parent())) return self;
+    if (key !== prop) {
+        var sub = self.flatten_object(property, compressor);
+        if (sub) {
+            expr = self.expression = sub.expression;
+            prop = self.property = sub.property;
+        }
+    }
+    if (compressor.option("properties") && compressor.option("side_effects")
+        && prop instanceof AST_Number && expr instanceof AST_Array) {
+        var index = prop.getValue();
+        var elements = expr.elements;
+        var retValue = elements[index];
+        FLATTEN: if (safe_to_flatten(retValue, compressor)) {
+            var flatten = true;
+            var values = [];
+            for (var i = elements.length; --i > index;) {
+                var value = elements[i].drop_side_effect_free(compressor);
+                if (value) {
+                    values.unshift(value);
+                    if (flatten && value.has_side_effects(compressor)) flatten = false;
+                }
+            }
+            if (retValue instanceof AST_Expansion) break FLATTEN;
+            retValue = retValue instanceof AST_Hole ? make_node(AST_Undefined, retValue) : retValue;
+            if (!flatten) values.unshift(retValue);
+            while (--i >= 0) {
+                var value = elements[i];
+                if (value instanceof AST_Expansion) break FLATTEN;
+                value = value.drop_side_effect_free(compressor);
+                if (value) values.unshift(value);
+                else index--;
+            }
+            if (flatten) {
+                values.push(retValue);
+                return make_sequence(self, values).optimize(compressor);
+            } else return make_node(AST_Sub, self, {
+                expression: make_node(AST_Array, expr, {
+                    elements: values
+                }),
+                property: make_node(AST_Number, prop, {
+                    value: index
+                })
+            });
+        }
+    }
+    var ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+    return self;
+});
+
+def_optimize(AST_Chain, function (self, compressor) {
+    if (is_nullish(self.expression, compressor)) {
+        let parent = compressor.parent();
+        // It's valid to delete a nullish optional chain, but if we optimized
+        // this to `delete undefined` then it would appear to be a syntax error
+        // when we try to optimize the delete. Thankfully, `delete 0` is fine.
+        if (parent instanceof AST_UnaryPrefix && parent.operator === "delete") {
+            return make_node_from_constant(0, self);
+        }
+        return make_node(AST_Undefined, self);
+    }
+    return self;
+});
+
+AST_Lambda.DEFMETHOD("contains_this", function() {
+    return walk(this, node => {
+        if (node instanceof AST_This) return walk_abort;
+        if (
+            node !== this
+            && node instanceof AST_Scope
+            && !(node instanceof AST_Arrow)
+        ) {
+            return true;
+        }
+    });
+});
+
+def_optimize(AST_Dot, function(self, compressor) {
+    const parent = compressor.parent();
+    if (is_lhs(self, parent)) return self;
+    if (compressor.option("unsafe_proto")
+        && self.expression instanceof AST_Dot
+        && self.expression.property == "prototype") {
+        var exp = self.expression.expression;
+        if (is_undeclared_ref(exp)) switch (exp.name) {
+          case "Array":
+            self.expression = make_node(AST_Array, self.expression, {
+                elements: []
+            });
+            break;
+          case "Function":
+            self.expression = make_node(AST_Function, self.expression, {
+                argnames: [],
+                body: []
+            });
+            break;
+          case "Number":
+            self.expression = make_node(AST_Number, self.expression, {
+                value: 0
+            });
+            break;
+          case "Object":
+            self.expression = make_node(AST_Object, self.expression, {
+                properties: []
+            });
+            break;
+          case "RegExp":
+            self.expression = make_node(AST_RegExp, self.expression, {
+                value: { source: "t", flags: "" }
+            });
+            break;
+          case "String":
+            self.expression = make_node(AST_String, self.expression, {
+                value: ""
+            });
+            break;
+        }
+    }
+    if (!(parent instanceof AST_Call) || !has_annotation(parent, _NOINLINE)) {
+        const sub = self.flatten_object(self.property, compressor);
+        if (sub) return sub.optimize(compressor);
+    }
+    let ev = self.evaluate(compressor);
+    if (ev !== self) {
+        ev = make_node_from_constant(ev, self).optimize(compressor);
+        return best_of(compressor, ev, self);
+    }
+    return self;
+});
+
+function literals_in_boolean_context(self, compressor) {
+    if (compressor.in_boolean_context()) {
+        return best_of(compressor, self, make_sequence(self, [
+            self,
+            make_node(AST_True, self)
+        ]).optimize(compressor));
+    }
+    return self;
+}
+
+function inline_array_like_spread(elements) {
+    for (var i = 0; i < elements.length; i++) {
+        var el = elements[i];
+        if (el instanceof AST_Expansion) {
+            var expr = el.expression;
+            if (
+                expr instanceof AST_Array
+                && !expr.elements.some(elm => elm instanceof AST_Hole)
+            ) {
+                elements.splice(i, 1, ...expr.elements);
+                // Step back one, as the element at i is now new.
+                i--;
+            }
+            // In array-like spread, spreading a non-iterable value is TypeError.
+            // We therefore can’t optimize anything else, unlike with object spread.
+        }
+    }
+}
+
+def_optimize(AST_Array, function(self, compressor) {
+    var optimized = literals_in_boolean_context(self, compressor);
+    if (optimized !== self) {
+        return optimized;
+    }
+    inline_array_like_spread(self.elements);
+    return self;
+});
+
+function inline_object_prop_spread(props, compressor) {
+    for (var i = 0; i < props.length; i++) {
+        var prop = props[i];
+        if (prop instanceof AST_Expansion) {
+            const expr = prop.expression;
+            if (
+                expr instanceof AST_Object
+                && expr.properties.every(prop => prop instanceof AST_ObjectKeyVal)
+            ) {
+                props.splice(i, 1, ...expr.properties);
+                // Step back one, as the property at i is now new.
+                i--;
+            } else if (expr instanceof AST_Constant
+                && !(expr instanceof AST_String)) {
+                // Unlike array-like spread, in object spread, spreading a
+                // non-iterable value silently does nothing; it is thus safe
+                // to remove. AST_String is the only iterable AST_Constant.
+                props.splice(i, 1);
+                i--;
+            } else if (is_nullish(expr, compressor)) {
+                // Likewise, null and undefined can be silently removed.
+                props.splice(i, 1);
+                i--;
+            }
+        }
+    }
+}
+
+def_optimize(AST_Object, function(self, compressor) {
+    var optimized = literals_in_boolean_context(self, compressor);
+    if (optimized !== self) {
+        return optimized;
+    }
+    inline_object_prop_spread(self.properties, compressor);
+    return self;
+});
+
+def_optimize(AST_RegExp, literals_in_boolean_context);
+
+def_optimize(AST_Return, function(self, compressor) {
+    if (self.value && is_undefined(self.value, compressor)) {
+        self.value = null;
+    }
+    return self;
+});
+
+def_optimize(AST_Arrow, opt_AST_Lambda);
+
+def_optimize(AST_Function, function(self, compressor) {
+    self = opt_AST_Lambda(self, compressor);
+    if (compressor.option("unsafe_arrows")
+        && compressor.option("ecma") >= 2015
+        && !self.name
+        && !self.is_generator
+        && !self.uses_arguments
+        && !self.pinned()) {
+        const uses_this = walk(self, node => {
+            if (node instanceof AST_This) return walk_abort;
+        });
+        if (!uses_this) return make_node(AST_Arrow, self, self).optimize(compressor);
+    }
+    return self;
+});
+
+def_optimize(AST_Class, function(self) {
+    // HACK to avoid compress failure.
+    // AST_Class is not really an AST_Scope/AST_Block as it lacks a body.
+    return self;
+});
+
+def_optimize(AST_Yield, function(self, compressor) {
+    if (self.expression && !self.is_star && is_undefined(self.expression, compressor)) {
+        self.expression = null;
+    }
+    return self;
+});
+
+def_optimize(AST_TemplateString, function(self, compressor) {
+    if (
+        !compressor.option("evaluate")
+        || compressor.parent() instanceof AST_PrefixedTemplateString
+    ) {
+        return self;
+    }
+
+    var segments = [];
+    for (var i = 0; i < self.segments.length; i++) {
+        var segment = self.segments[i];
+        if (segment instanceof AST_Node) {
+            var result = segment.evaluate(compressor);
+            // Evaluate to constant value
+            // Constant value shorter than ${segment}
+            if (result !== segment && (result + "").length <= segment.size() + "${}".length) {
+                // There should always be a previous and next segment if segment is a node
+                segments[segments.length - 1].value = segments[segments.length - 1].value + result + self.segments[++i].value;
+                continue;
+            }
+            // `before ${`innerBefore ${any} innerAfter`} after` => `before innerBefore ${any} innerAfter after`
+            // TODO:
+            // `before ${'test' + foo} after` => `before innerBefore ${any} innerAfter after`
+            // `before ${foo + 'test} after` => `before innerBefore ${any} innerAfter after`
+            if (segment instanceof AST_TemplateString) {
+                var inners = segment.segments;
+                segments[segments.length - 1].value += inners[0].value;
+                for (var j = 1; j < inners.length; j++) {
+                    segment = inners[j];
+                    segments.push(segment);
+                }
+                continue;
+            }
+        }
+        segments.push(segment);
+    }
+    self.segments = segments;
+
+    // `foo` => "foo"
+    if (segments.length == 1) {
+        return make_node(AST_String, self, segments[0]);
+    }
+
+    if (
+        segments.length === 3
+        && segments[1] instanceof AST_Node
+        && (
+            segments[1].is_string(compressor)
+            || segments[1].is_number(compressor)
+            || is_nullish(segments[1], compressor)
+            || compressor.option("unsafe")
+        )
+    ) {
+        // `foo${bar}` => "foo" + bar
+        if (segments[2].value === "") {
+            return make_node(AST_Binary, self, {
+                operator: "+",
+                left: make_node(AST_String, self, {
+                    value: segments[0].value,
+                }),
+                right: segments[1],
+            });
+        }
+        // `${bar}baz` => bar + "baz"
+        if (segments[0].value === "") {
+            return make_node(AST_Binary, self, {
+                operator: "+",
+                left: segments[1],
+                right: make_node(AST_String, self, {
+                    value: segments[2].value,
+                }),
+            });
+        }
+    }
+    return self;
+});
+
+def_optimize(AST_PrefixedTemplateString, function(self) {
+    return self;
+});
+
+// ["p"]:1 ---> p:1
+// [42]:1 ---> 42:1
+function lift_key(self, compressor) {
+    if (!compressor.option("computed_props")) return self;
+    // save a comparison in the typical case
+    if (!(self.key instanceof AST_Constant)) return self;
+    // allow certain acceptable props as not all AST_Constants are true constants
+    if (self.key instanceof AST_String || self.key instanceof AST_Number) {
+        if (self.key.value === "__proto__") return self;
+        if (self.key.value == "constructor"
+            && compressor.parent() instanceof AST_Class) return self;
+        if (self instanceof AST_ObjectKeyVal) {
+            self.quote = self.key.quote;
+            self.key = self.key.value;
+        } else if (self instanceof AST_ClassProperty) {
+            self.quote = self.key.quote;
+            self.key = make_node(AST_SymbolClassProperty, self.key, {
+                name: self.key.value
+            });
+        } else {
+            self.quote = self.key.quote;
+            self.key = make_node(AST_SymbolMethod, self.key, {
+                name: self.key.value
+            });
+        }
+    }
+    return self;
+}
+
+def_optimize(AST_ObjectProperty, lift_key);
+
+def_optimize(AST_ConciseMethod, function(self, compressor) {
+    lift_key(self, compressor);
+    // p(){return x;} ---> p:()=>x
+    if (compressor.option("arrows")
+        && compressor.parent() instanceof AST_Object
+        && !self.is_generator
+        && !self.value.uses_arguments
+        && !self.value.pinned()
+        && self.value.body.length == 1
+        && self.value.body[0] instanceof AST_Return
+        && self.value.body[0].value
+        && !self.value.contains_this()) {
+        var arrow = make_node(AST_Arrow, self.value, self.value);
+        arrow.async = self.async;
+        arrow.is_generator = self.is_generator;
+        return make_node(AST_ObjectKeyVal, self, {
+            key: self.key instanceof AST_SymbolMethod ? self.key.name : self.key,
+            value: arrow,
+            quote: self.quote,
+        });
+    }
+    return self;
+});
+
+def_optimize(AST_ObjectKeyVal, function(self, compressor) {
+    lift_key(self, compressor);
+    // p:function(){} ---> p(){}
+    // p:function*(){} ---> *p(){}
+    // p:async function(){} ---> async p(){}
+    // p:()=>{} ---> p(){}
+    // p:async()=>{} ---> async p(){}
+    var unsafe_methods = compressor.option("unsafe_methods");
+    if (unsafe_methods
+        && compressor.option("ecma") >= 2015
+        && (!(unsafe_methods instanceof RegExp) || unsafe_methods.test(self.key + ""))) {
+        var key = self.key;
+        var value = self.value;
+        var is_arrow_with_block = value instanceof AST_Arrow
+            && Array.isArray(value.body)
+            && !value.contains_this();
+        if ((is_arrow_with_block || value instanceof AST_Function) && !value.name) {
+            return make_node(AST_ConciseMethod, self, {
+                async: value.async,
+                is_generator: value.is_generator,
+                key: key instanceof AST_Node ? key : make_node(AST_SymbolMethod, self, {
+                    name: key,
+                }),
+                value: make_node(AST_Accessor, value, value),
+                quote: self.quote,
+            });
+        }
+    }
+    return self;
+});
+
+def_optimize(AST_Destructuring, function(self, compressor) {
+    if (compressor.option("pure_getters") == true
+        && compressor.option("unused")
+        && !self.is_array
+        && Array.isArray(self.names)
+        && !is_destructuring_export_decl(compressor)
+        && !(self.names[self.names.length - 1] instanceof AST_Expansion)) {
+        var keep = [];
+        for (var i = 0; i < self.names.length; i++) {
+            var elem = self.names[i];
+            if (!(elem instanceof AST_ObjectKeyVal
+                && typeof elem.key == "string"
+                && elem.value instanceof AST_SymbolDeclaration
+                && !should_retain(compressor, elem.value.definition()))) {
+                keep.push(elem);
+            }
+        }
+        if (keep.length != self.names.length) {
+            self.names = keep;
+        }
+    }
+    return self;
+
+    function is_destructuring_export_decl(compressor) {
+        var ancestors = [/^VarDef$/, /^(Const|Let|Var)$/, /^Export$/];
+        for (var a = 0, p = 0, len = ancestors.length; a < len; p++) {
+            var parent = compressor.parent(p);
+            if (!parent) return false;
+            if (a === 0 && parent.TYPE == "Destructuring") continue;
+            if (!ancestors[a].test(parent.TYPE)) {
+                return false;
+            }
+            a++;
+        }
+        return true;
+    }
+
+    function should_retain(compressor, def) {
+        if (def.references.length) return true;
+        if (!def.global) return false;
+        if (compressor.toplevel.vars) {
+             if (compressor.top_retain) {
+                 return compressor.top_retain(def);
+             }
+             return false;
+        }
+        return true;
+    }
+});
+
+export {
+    Compressor,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/inference.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/inference.js
new file mode 100644
index 0000000..0b2c982
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/inference.js
@@ -0,0 +1,948 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+  AST_Array,
+  AST_Arrow,
+  AST_Assign,
+  AST_Binary,
+  AST_Block,
+  AST_BlockStatement,
+  AST_Call,
+  AST_Case,
+  AST_Chain,
+  AST_Class,
+  AST_ClassProperty,
+  AST_ConciseMethod,
+  AST_Conditional,
+  AST_Constant,
+  AST_Definitions,
+  AST_Dot,
+  AST_EmptyStatement,
+  AST_Expansion,
+  AST_False,
+  AST_Function,
+  AST_If,
+  AST_Import,
+  AST_Jump,
+  AST_LabeledStatement,
+  AST_Lambda,
+  AST_New,
+  AST_Node,
+  AST_Null,
+  AST_Number,
+  AST_Object,
+  AST_ObjectGetter,
+  AST_ObjectKeyVal,
+  AST_ObjectProperty,
+  AST_ObjectSetter,
+  AST_PropAccess,
+  AST_RegExp,
+  AST_Return,
+  AST_Sequence,
+  AST_SimpleStatement,
+  AST_Statement,
+  AST_String,
+  AST_Sub,
+  AST_Switch,
+  AST_SwitchBranch,
+  AST_SymbolClassProperty,
+  AST_SymbolDeclaration,
+  AST_SymbolRef,
+  AST_TemplateSegment,
+  AST_TemplateString,
+  AST_This,
+  AST_Toplevel,
+  AST_True,
+  AST_Try,
+  AST_Unary,
+  AST_UnaryPostfix,
+  AST_UnaryPrefix,
+  AST_Undefined,
+  AST_VarDef,
+
+  TreeTransformer,
+  walk,
+  walk_abort,
+
+  _PURE
+} from "../ast.js";
+import {
+    makePredicate,
+    return_true,
+    return_false,
+    return_null,
+    return_this,
+    make_node,
+    member,
+    noop,
+    has_annotation,
+    HOP
+} from "../utils/index.js";
+import { make_node_from_constant, make_sequence, best_of_expression, read_property } from "./common.js";
+
+import { INLINED, UNDEFINED, has_flag } from "./compressor-flags.js";
+import { pure_prop_access_globals, is_pure_native_fn, is_pure_native_method } from "./native-objects.js";
+
+// Functions and methods to infer certain facts about expressions
+// It's not always possible to be 100% sure about something just by static analysis,
+// so `true` means yes, and `false` means maybe
+
+export const is_undeclared_ref = (node) =>
+    node instanceof AST_SymbolRef && node.definition().undeclared;
+
+export const lazy_op = makePredicate("&& || ??");
+export const unary_side_effects = makePredicate("delete ++ --");
+
+// methods to determine whether an expression has a boolean result type
+(function(def_is_boolean) {
+    const unary_bool = makePredicate("! delete");
+    const binary_bool = makePredicate("in instanceof == != === !== < <= >= >");
+    def_is_boolean(AST_Node, return_false);
+    def_is_boolean(AST_UnaryPrefix, function() {
+        return unary_bool.has(this.operator);
+    });
+    def_is_boolean(AST_Binary, function() {
+        return binary_bool.has(this.operator)
+            || lazy_op.has(this.operator)
+                && this.left.is_boolean()
+                && this.right.is_boolean();
+    });
+    def_is_boolean(AST_Conditional, function() {
+        return this.consequent.is_boolean() && this.alternative.is_boolean();
+    });
+    def_is_boolean(AST_Assign, function() {
+        return this.operator == "=" && this.right.is_boolean();
+    });
+    def_is_boolean(AST_Sequence, function() {
+        return this.tail_node().is_boolean();
+    });
+    def_is_boolean(AST_True, return_true);
+    def_is_boolean(AST_False, return_true);
+})(function(node, func) {
+    node.DEFMETHOD("is_boolean", func);
+});
+
+// methods to determine if an expression has a numeric result type
+(function(def_is_number) {
+    def_is_number(AST_Node, return_false);
+    def_is_number(AST_Number, return_true);
+    const unary = makePredicate("+ - ~ ++ --");
+    def_is_number(AST_Unary, function() {
+        return unary.has(this.operator);
+    });
+    const numeric_ops = makePredicate("- * / % & | ^ << >> >>>");
+    def_is_number(AST_Binary, function(compressor) {
+        return numeric_ops.has(this.operator) || this.operator == "+"
+            && this.left.is_number(compressor)
+            && this.right.is_number(compressor);
+    });
+    def_is_number(AST_Assign, function(compressor) {
+        return numeric_ops.has(this.operator.slice(0, -1))
+            || this.operator == "=" && this.right.is_number(compressor);
+    });
+    def_is_number(AST_Sequence, function(compressor) {
+        return this.tail_node().is_number(compressor);
+    });
+    def_is_number(AST_Conditional, function(compressor) {
+        return this.consequent.is_number(compressor) && this.alternative.is_number(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("is_number", func);
+});
+
+// methods to determine if an expression has a string result type
+(function(def_is_string) {
+    def_is_string(AST_Node, return_false);
+    def_is_string(AST_String, return_true);
+    def_is_string(AST_TemplateString, return_true);
+    def_is_string(AST_UnaryPrefix, function() {
+        return this.operator == "typeof";
+    });
+    def_is_string(AST_Binary, function(compressor) {
+        return this.operator == "+" &&
+            (this.left.is_string(compressor) || this.right.is_string(compressor));
+    });
+    def_is_string(AST_Assign, function(compressor) {
+        return (this.operator == "=" || this.operator == "+=") && this.right.is_string(compressor);
+    });
+    def_is_string(AST_Sequence, function(compressor) {
+        return this.tail_node().is_string(compressor);
+    });
+    def_is_string(AST_Conditional, function(compressor) {
+        return this.consequent.is_string(compressor) && this.alternative.is_string(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("is_string", func);
+});
+
+export function is_undefined(node, compressor) {
+    return (
+        has_flag(node, UNDEFINED)
+        || node instanceof AST_Undefined
+        || node instanceof AST_UnaryPrefix
+            && node.operator == "void"
+            && !node.expression.has_side_effects(compressor)
+    );
+}
+
+// Is the node explicitly null or undefined.
+function is_null_or_undefined(node, compressor) {
+    let fixed;
+    return (
+        node instanceof AST_Null
+        || is_undefined(node, compressor)
+        || (
+            node instanceof AST_SymbolRef
+            && (fixed = node.definition().fixed) instanceof AST_Node
+            && is_nullish(fixed, compressor)
+        )
+    );
+}
+
+// Find out if this expression is optionally chained from a base-point that we
+// can statically analyze as null or undefined.
+export function is_nullish_shortcircuited(node, compressor) {
+    if (node instanceof AST_PropAccess || node instanceof AST_Call) {
+        return (
+            (node.optional && is_null_or_undefined(node.expression, compressor))
+            || is_nullish_shortcircuited(node.expression, compressor)
+        );
+    }
+    if (node instanceof AST_Chain) return is_nullish_shortcircuited(node.expression, compressor);
+    return false;
+}
+
+// Find out if something is == null, or can short circuit into nullish.
+// Used to optimize ?. and ??
+export function is_nullish(node, compressor) {
+    if (is_null_or_undefined(node, compressor)) return true;
+    return is_nullish_shortcircuited(node, compressor);
+}
+
+// Determine if expression might cause side effects
+// If there's a possibility that a node may change something when it's executed, this returns true
+(function(def_has_side_effects) {
+    def_has_side_effects(AST_Node, return_true);
+
+    def_has_side_effects(AST_EmptyStatement, return_false);
+    def_has_side_effects(AST_Constant, return_false);
+    def_has_side_effects(AST_This, return_false);
+
+    function any(list, compressor) {
+        for (var i = list.length; --i >= 0;)
+            if (list[i].has_side_effects(compressor))
+                return true;
+        return false;
+    }
+
+    def_has_side_effects(AST_Block, function(compressor) {
+        return any(this.body, compressor);
+    });
+    def_has_side_effects(AST_Call, function(compressor) {
+        if (
+            !this.is_callee_pure(compressor)
+            && (!this.expression.is_call_pure(compressor)
+                || this.expression.has_side_effects(compressor))
+        ) {
+            return true;
+        }
+        return any(this.args, compressor);
+    });
+    def_has_side_effects(AST_Switch, function(compressor) {
+        return this.expression.has_side_effects(compressor)
+            || any(this.body, compressor);
+    });
+    def_has_side_effects(AST_Case, function(compressor) {
+        return this.expression.has_side_effects(compressor)
+            || any(this.body, compressor);
+    });
+    def_has_side_effects(AST_Try, function(compressor) {
+        return any(this.body, compressor)
+            || this.bcatch && this.bcatch.has_side_effects(compressor)
+            || this.bfinally && this.bfinally.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_If, function(compressor) {
+        return this.condition.has_side_effects(compressor)
+            || this.body && this.body.has_side_effects(compressor)
+            || this.alternative && this.alternative.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_LabeledStatement, function(compressor) {
+        return this.body.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_SimpleStatement, function(compressor) {
+        return this.body.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Lambda, return_false);
+    def_has_side_effects(AST_Class, function (compressor) {
+        if (this.extends && this.extends.has_side_effects(compressor)) {
+            return true;
+        }
+        return any(this.properties, compressor);
+    });
+    def_has_side_effects(AST_Binary, function(compressor) {
+        return this.left.has_side_effects(compressor)
+            || this.right.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Assign, return_true);
+    def_has_side_effects(AST_Conditional, function(compressor) {
+        return this.condition.has_side_effects(compressor)
+            || this.consequent.has_side_effects(compressor)
+            || this.alternative.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Unary, function(compressor) {
+        return unary_side_effects.has(this.operator)
+            || this.expression.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_SymbolRef, function(compressor) {
+        return !this.is_declared(compressor) && !pure_prop_access_globals.has(this.name);
+    });
+    def_has_side_effects(AST_SymbolClassProperty, return_false);
+    def_has_side_effects(AST_SymbolDeclaration, return_false);
+    def_has_side_effects(AST_Object, function(compressor) {
+        return any(this.properties, compressor);
+    });
+    def_has_side_effects(AST_ObjectProperty, function(compressor) {
+        return (
+            this.computed_key() && this.key.has_side_effects(compressor)
+            || this.value && this.value.has_side_effects(compressor)
+        );
+    });
+    def_has_side_effects(AST_ClassProperty, function(compressor) {
+        return (
+            this.computed_key() && this.key.has_side_effects(compressor)
+            || this.static && this.value && this.value.has_side_effects(compressor)
+        );
+    });
+    def_has_side_effects(AST_ConciseMethod, function(compressor) {
+        return this.computed_key() && this.key.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_ObjectGetter, function(compressor) {
+        return this.computed_key() && this.key.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_ObjectSetter, function(compressor) {
+        return this.computed_key() && this.key.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Array, function(compressor) {
+        return any(this.elements, compressor);
+    });
+    def_has_side_effects(AST_Dot, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Sub, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.has_side_effects(compressor)
+            || this.property.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Chain, function (compressor) {
+        return this.expression.has_side_effects(compressor);
+    });
+    def_has_side_effects(AST_Sequence, function(compressor) {
+        return any(this.expressions, compressor);
+    });
+    def_has_side_effects(AST_Definitions, function(compressor) {
+        return any(this.definitions, compressor);
+    });
+    def_has_side_effects(AST_VarDef, function() {
+        return this.value;
+    });
+    def_has_side_effects(AST_TemplateSegment, return_false);
+    def_has_side_effects(AST_TemplateString, function(compressor) {
+        return any(this.segments, compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("has_side_effects", func);
+});
+
+// determine if expression may throw
+(function(def_may_throw) {
+    def_may_throw(AST_Node, return_true);
+
+    def_may_throw(AST_Constant, return_false);
+    def_may_throw(AST_EmptyStatement, return_false);
+    def_may_throw(AST_Lambda, return_false);
+    def_may_throw(AST_SymbolDeclaration, return_false);
+    def_may_throw(AST_This, return_false);
+
+    function any(list, compressor) {
+        for (var i = list.length; --i >= 0;)
+            if (list[i].may_throw(compressor))
+                return true;
+        return false;
+    }
+
+    def_may_throw(AST_Class, function(compressor) {
+        if (this.extends && this.extends.may_throw(compressor)) return true;
+        return any(this.properties, compressor);
+    });
+
+    def_may_throw(AST_Array, function(compressor) {
+        return any(this.elements, compressor);
+    });
+    def_may_throw(AST_Assign, function(compressor) {
+        if (this.right.may_throw(compressor)) return true;
+        if (!compressor.has_directive("use strict")
+            && this.operator == "="
+            && this.left instanceof AST_SymbolRef) {
+            return false;
+        }
+        return this.left.may_throw(compressor);
+    });
+    def_may_throw(AST_Binary, function(compressor) {
+        return this.left.may_throw(compressor)
+            || this.right.may_throw(compressor);
+    });
+    def_may_throw(AST_Block, function(compressor) {
+        return any(this.body, compressor);
+    });
+    def_may_throw(AST_Call, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        if (any(this.args, compressor)) return true;
+        if (this.is_callee_pure(compressor)) return false;
+        if (this.expression.may_throw(compressor)) return true;
+        return !(this.expression instanceof AST_Lambda)
+            || any(this.expression.body, compressor);
+    });
+    def_may_throw(AST_Case, function(compressor) {
+        return this.expression.may_throw(compressor)
+            || any(this.body, compressor);
+    });
+    def_may_throw(AST_Conditional, function(compressor) {
+        return this.condition.may_throw(compressor)
+            || this.consequent.may_throw(compressor)
+            || this.alternative.may_throw(compressor);
+    });
+    def_may_throw(AST_Definitions, function(compressor) {
+        return any(this.definitions, compressor);
+    });
+    def_may_throw(AST_If, function(compressor) {
+        return this.condition.may_throw(compressor)
+            || this.body && this.body.may_throw(compressor)
+            || this.alternative && this.alternative.may_throw(compressor);
+    });
+    def_may_throw(AST_LabeledStatement, function(compressor) {
+        return this.body.may_throw(compressor);
+    });
+    def_may_throw(AST_Object, function(compressor) {
+        return any(this.properties, compressor);
+    });
+    def_may_throw(AST_ObjectProperty, function(compressor) {
+        // TODO key may throw too
+        return this.value ? this.value.may_throw(compressor) : false;
+    });
+    def_may_throw(AST_ClassProperty, function(compressor) {
+        return (
+            this.computed_key() && this.key.may_throw(compressor)
+            || this.static && this.value && this.value.may_throw(compressor)
+        );
+    });
+    def_may_throw(AST_ConciseMethod, function(compressor) {
+        return this.computed_key() && this.key.may_throw(compressor);
+    });
+    def_may_throw(AST_ObjectGetter, function(compressor) {
+        return this.computed_key() && this.key.may_throw(compressor);
+    });
+    def_may_throw(AST_ObjectSetter, function(compressor) {
+        return this.computed_key() && this.key.may_throw(compressor);
+    });
+    def_may_throw(AST_Return, function(compressor) {
+        return this.value && this.value.may_throw(compressor);
+    });
+    def_may_throw(AST_Sequence, function(compressor) {
+        return any(this.expressions, compressor);
+    });
+    def_may_throw(AST_SimpleStatement, function(compressor) {
+        return this.body.may_throw(compressor);
+    });
+    def_may_throw(AST_Dot, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.may_throw(compressor);
+    });
+    def_may_throw(AST_Sub, function(compressor) {
+        if (is_nullish(this, compressor)) return false;
+        return !this.optional && this.expression.may_throw_on_access(compressor)
+            || this.expression.may_throw(compressor)
+            || this.property.may_throw(compressor);
+    });
+    def_may_throw(AST_Chain, function(compressor) {
+        return this.expression.may_throw(compressor);
+    });
+    def_may_throw(AST_Switch, function(compressor) {
+        return this.expression.may_throw(compressor)
+            || any(this.body, compressor);
+    });
+    def_may_throw(AST_SymbolRef, function(compressor) {
+        return !this.is_declared(compressor) && !pure_prop_access_globals.has(this.name);
+    });
+    def_may_throw(AST_SymbolClassProperty, return_false);
+    def_may_throw(AST_Try, function(compressor) {
+        return this.bcatch ? this.bcatch.may_throw(compressor) : any(this.body, compressor)
+            || this.bfinally && this.bfinally.may_throw(compressor);
+    });
+    def_may_throw(AST_Unary, function(compressor) {
+        if (this.operator == "typeof" && this.expression instanceof AST_SymbolRef)
+            return false;
+        return this.expression.may_throw(compressor);
+    });
+    def_may_throw(AST_VarDef, function(compressor) {
+        if (!this.value) return false;
+        return this.value.may_throw(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("may_throw", func);
+});
+
+// determine if expression is constant
+(function(def_is_constant_expression) {
+    function all_refs_local(scope) {
+        let result = true;
+        walk(this, node => {
+            if (node instanceof AST_SymbolRef) {
+                if (has_flag(this, INLINED)) {
+                    result = false;
+                    return walk_abort;
+                }
+                var def = node.definition();
+                if (
+                    member(def, this.enclosed)
+                    && !this.variables.has(def.name)
+                ) {
+                    if (scope) {
+                        var scope_def = scope.find_variable(node);
+                        if (def.undeclared ? !scope_def : scope_def === def) {
+                            result = "f";
+                            return true;
+                        }
+                    }
+                    result = false;
+                    return walk_abort;
+                }
+                return true;
+            }
+            if (node instanceof AST_This && this instanceof AST_Arrow) {
+                // TODO check arguments too!
+                result = false;
+                return walk_abort;
+            }
+        });
+        return result;
+    }
+
+    def_is_constant_expression(AST_Node, return_false);
+    def_is_constant_expression(AST_Constant, return_true);
+    def_is_constant_expression(AST_Class, function(scope) {
+        if (this.extends && !this.extends.is_constant_expression(scope)) {
+            return false;
+        }
+
+        for (const prop of this.properties) {
+            if (prop.computed_key() && !prop.key.is_constant_expression(scope)) {
+                return false;
+            }
+            if (prop.static && prop.value && !prop.value.is_constant_expression(scope)) {
+                return false;
+            }
+        }
+
+        return all_refs_local.call(this, scope);
+    });
+    def_is_constant_expression(AST_Lambda, all_refs_local);
+    def_is_constant_expression(AST_Unary, function() {
+        return this.expression.is_constant_expression();
+    });
+    def_is_constant_expression(AST_Binary, function() {
+        return this.left.is_constant_expression()
+            && this.right.is_constant_expression();
+    });
+    def_is_constant_expression(AST_Array, function() {
+        return this.elements.every((l) => l.is_constant_expression());
+    });
+    def_is_constant_expression(AST_Object, function() {
+        return this.properties.every((l) => l.is_constant_expression());
+    });
+    def_is_constant_expression(AST_ObjectProperty, function() {
+        return !!(!(this.key instanceof AST_Node) && this.value && this.value.is_constant_expression());
+    });
+})(function(node, func) {
+    node.DEFMETHOD("is_constant_expression", func);
+});
+
+
+// may_throw_on_access()
+// returns true if this node may be null, undefined or contain `AST_Accessor`
+(function(def_may_throw_on_access) {
+    AST_Node.DEFMETHOD("may_throw_on_access", function(compressor) {
+        return !compressor.option("pure_getters")
+            || this._dot_throw(compressor);
+    });
+
+    function is_strict(compressor) {
+        return /strict/.test(compressor.option("pure_getters"));
+    }
+
+    def_may_throw_on_access(AST_Node, is_strict);
+    def_may_throw_on_access(AST_Null, return_true);
+    def_may_throw_on_access(AST_Undefined, return_true);
+    def_may_throw_on_access(AST_Constant, return_false);
+    def_may_throw_on_access(AST_Array, return_false);
+    def_may_throw_on_access(AST_Object, function(compressor) {
+        if (!is_strict(compressor)) return false;
+        for (var i = this.properties.length; --i >=0;)
+            if (this.properties[i]._dot_throw(compressor)) return true;
+        return false;
+    });
+    // Do not be as strict with classes as we are with objects.
+    // Hopefully the community is not going to abuse static getters and setters.
+    // https://github.com/terser/terser/issues/724#issuecomment-643655656
+    def_may_throw_on_access(AST_Class, return_false);
+    def_may_throw_on_access(AST_ObjectProperty, return_false);
+    def_may_throw_on_access(AST_ObjectGetter, return_true);
+    def_may_throw_on_access(AST_Expansion, function(compressor) {
+        return this.expression._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Function, return_false);
+    def_may_throw_on_access(AST_Arrow, return_false);
+    def_may_throw_on_access(AST_UnaryPostfix, return_false);
+    def_may_throw_on_access(AST_UnaryPrefix, function() {
+        return this.operator == "void";
+    });
+    def_may_throw_on_access(AST_Binary, function(compressor) {
+        return (this.operator == "&&" || this.operator == "||" || this.operator == "??")
+            && (this.left._dot_throw(compressor) || this.right._dot_throw(compressor));
+    });
+    def_may_throw_on_access(AST_Assign, function(compressor) {
+        if (this.logical) return true;
+
+        return this.operator == "="
+            && this.right._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Conditional, function(compressor) {
+        return this.consequent._dot_throw(compressor)
+            || this.alternative._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Dot, function(compressor) {
+        if (!is_strict(compressor)) return false;
+
+        if (this.property == "prototype") {
+            return !(
+                this.expression instanceof AST_Function
+                || this.expression instanceof AST_Class
+            );
+        }
+        return true;
+    });
+    def_may_throw_on_access(AST_Chain, function(compressor) {
+        return this.expression._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_Sequence, function(compressor) {
+        return this.tail_node()._dot_throw(compressor);
+    });
+    def_may_throw_on_access(AST_SymbolRef, function(compressor) {
+        if (this.name === "arguments") return false;
+        if (has_flag(this, UNDEFINED)) return true;
+        if (!is_strict(compressor)) return false;
+        if (is_undeclared_ref(this) && this.is_declared(compressor)) return false;
+        if (this.is_immutable()) return false;
+        var fixed = this.fixed_value();
+        return !fixed || fixed._dot_throw(compressor);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("_dot_throw", func);
+});
+
+export function is_lhs(node, parent) {
+    if (parent instanceof AST_Unary && unary_side_effects.has(parent.operator)) return parent.expression;
+    if (parent instanceof AST_Assign && parent.left === node) return node;
+}
+
+(function(def_find_defs) {
+    function to_node(value, orig) {
+        if (value instanceof AST_Node) {
+            if (!(value instanceof AST_Constant)) {
+                // Value may be a function, an array including functions and even a complex assign / block expression,
+                // so it should never be shared in different places.
+                // Otherwise wrong information may be used in the compression phase
+                value = value.clone(true);
+            }
+            return make_node(value.CTOR, orig, value);
+        }
+        if (Array.isArray(value)) return make_node(AST_Array, orig, {
+            elements: value.map(function(value) {
+                return to_node(value, orig);
+            })
+        });
+        if (value && typeof value == "object") {
+            var props = [];
+            for (var key in value) if (HOP(value, key)) {
+                props.push(make_node(AST_ObjectKeyVal, orig, {
+                    key: key,
+                    value: to_node(value[key], orig)
+                }));
+            }
+            return make_node(AST_Object, orig, {
+                properties: props
+            });
+        }
+        return make_node_from_constant(value, orig);
+    }
+
+    AST_Toplevel.DEFMETHOD("resolve_defines", function(compressor) {
+        if (!compressor.option("global_defs")) return this;
+        this.figure_out_scope({ ie8: compressor.option("ie8") });
+        return this.transform(new TreeTransformer(function(node) {
+            var def = node._find_defs(compressor, "");
+            if (!def) return;
+            var level = 0, child = node, parent;
+            while (parent = this.parent(level++)) {
+                if (!(parent instanceof AST_PropAccess)) break;
+                if (parent.expression !== child) break;
+                child = parent;
+            }
+            if (is_lhs(child, parent)) {
+                return;
+            }
+            return def;
+        }));
+    });
+    def_find_defs(AST_Node, noop);
+    def_find_defs(AST_Chain, function(compressor, suffix) {
+        return this.expression._find_defs(compressor, suffix);
+    });
+    def_find_defs(AST_Dot, function(compressor, suffix) {
+        return this.expression._find_defs(compressor, "." + this.property + suffix);
+    });
+    def_find_defs(AST_SymbolDeclaration, function() {
+        if (!this.global()) return;
+    });
+    def_find_defs(AST_SymbolRef, function(compressor, suffix) {
+        if (!this.global()) return;
+        var defines = compressor.option("global_defs");
+        var name = this.name + suffix;
+        if (HOP(defines, name)) return to_node(defines[name], this);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("_find_defs", func);
+});
+
+// method to negate an expression
+(function(def_negate) {
+    function basic_negation(exp) {
+        return make_node(AST_UnaryPrefix, exp, {
+            operator: "!",
+            expression: exp
+        });
+    }
+    function best(orig, alt, first_in_statement) {
+        var negated = basic_negation(orig);
+        if (first_in_statement) {
+            var stat = make_node(AST_SimpleStatement, alt, {
+                body: alt
+            });
+            return best_of_expression(negated, stat) === stat ? alt : negated;
+        }
+        return best_of_expression(negated, alt);
+    }
+    def_negate(AST_Node, function() {
+        return basic_negation(this);
+    });
+    def_negate(AST_Statement, function() {
+        throw new Error("Cannot negate a statement");
+    });
+    def_negate(AST_Function, function() {
+        return basic_negation(this);
+    });
+    def_negate(AST_Arrow, function() {
+        return basic_negation(this);
+    });
+    def_negate(AST_UnaryPrefix, function() {
+        if (this.operator == "!")
+            return this.expression;
+        return basic_negation(this);
+    });
+    def_negate(AST_Sequence, function(compressor) {
+        var expressions = this.expressions.slice();
+        expressions.push(expressions.pop().negate(compressor));
+        return make_sequence(this, expressions);
+    });
+    def_negate(AST_Conditional, function(compressor, first_in_statement) {
+        var self = this.clone();
+        self.consequent = self.consequent.negate(compressor);
+        self.alternative = self.alternative.negate(compressor);
+        return best(this, self, first_in_statement);
+    });
+    def_negate(AST_Binary, function(compressor, first_in_statement) {
+        var self = this.clone(), op = this.operator;
+        if (compressor.option("unsafe_comps")) {
+            switch (op) {
+              case "<=" : self.operator = ">"  ; return self;
+              case "<"  : self.operator = ">=" ; return self;
+              case ">=" : self.operator = "<"  ; return self;
+              case ">"  : self.operator = "<=" ; return self;
+            }
+        }
+        switch (op) {
+          case "==" : self.operator = "!="; return self;
+          case "!=" : self.operator = "=="; return self;
+          case "===": self.operator = "!=="; return self;
+          case "!==": self.operator = "==="; return self;
+          case "&&":
+            self.operator = "||";
+            self.left = self.left.negate(compressor, first_in_statement);
+            self.right = self.right.negate(compressor);
+            return best(this, self, first_in_statement);
+          case "||":
+            self.operator = "&&";
+            self.left = self.left.negate(compressor, first_in_statement);
+            self.right = self.right.negate(compressor);
+            return best(this, self, first_in_statement);
+        }
+        return basic_negation(this);
+    });
+})(function(node, func) {
+    node.DEFMETHOD("negate", function(compressor, first_in_statement) {
+        return func.call(this, compressor, first_in_statement);
+    });
+});
+
+// Is the callee of this function pure?
+var global_pure_fns = makePredicate("Boolean decodeURI decodeURIComponent Date encodeURI encodeURIComponent Error escape EvalError isFinite isNaN Number Object parseFloat parseInt RangeError ReferenceError String SyntaxError TypeError unescape URIError");
+AST_Call.DEFMETHOD("is_callee_pure", function(compressor) {
+    if (compressor.option("unsafe")) {
+        var expr = this.expression;
+        var first_arg = (this.args && this.args[0] && this.args[0].evaluate(compressor));
+        if (
+            expr.expression && expr.expression.name === "hasOwnProperty" &&
+            (first_arg == null || first_arg.thedef && first_arg.thedef.undeclared)
+        ) {
+            return false;
+        }
+        if (is_undeclared_ref(expr) && global_pure_fns.has(expr.name)) return true;
+        if (
+            expr instanceof AST_Dot
+            && is_undeclared_ref(expr.expression)
+            && is_pure_native_fn(expr.expression.name, expr.property)
+        ) {
+            return true;
+        }
+    }
+    return !!has_annotation(this, _PURE) || !compressor.pure_funcs(this);
+});
+
+// If I call this, is it a pure function?
+AST_Node.DEFMETHOD("is_call_pure", return_false);
+AST_Dot.DEFMETHOD("is_call_pure", function(compressor) {
+    if (!compressor.option("unsafe")) return;
+    const expr = this.expression;
+
+    let native_obj;
+    if (expr instanceof AST_Array) {
+        native_obj = "Array";
+    } else if (expr.is_boolean()) {
+        native_obj = "Boolean";
+    } else if (expr.is_number(compressor)) {
+        native_obj = "Number";
+    } else if (expr instanceof AST_RegExp) {
+        native_obj = "RegExp";
+    } else if (expr.is_string(compressor)) {
+        native_obj = "String";
+    } else if (!this.may_throw_on_access(compressor)) {
+        native_obj = "Object";
+    }
+    return native_obj != null && is_pure_native_method(native_obj, this.property);
+});
+
+// tell me if a statement aborts
+export const aborts = (thing) => thing && thing.aborts();
+
+(function(def_aborts) {
+    def_aborts(AST_Statement, return_null);
+    def_aborts(AST_Jump, return_this);
+    function block_aborts() {
+        for (var i = 0; i < this.body.length; i++) {
+            if (aborts(this.body[i])) {
+                return this.body[i];
+            }
+        }
+        return null;
+    }
+    def_aborts(AST_Import, function() { return null; });
+    def_aborts(AST_BlockStatement, block_aborts);
+    def_aborts(AST_SwitchBranch, block_aborts);
+    def_aborts(AST_If, function() {
+        return this.alternative && aborts(this.body) && aborts(this.alternative) && this;
+    });
+})(function(node, func) {
+    node.DEFMETHOD("aborts", func);
+});
+
+export function is_modified(compressor, tw, node, value, level, immutable) {
+    var parent = tw.parent(level);
+    var lhs = is_lhs(node, parent);
+    if (lhs) return lhs;
+    if (!immutable
+        && parent instanceof AST_Call
+        && parent.expression === node
+        && !(value instanceof AST_Arrow)
+        && !(value instanceof AST_Class)
+        && !parent.is_callee_pure(compressor)
+        && (!(value instanceof AST_Function)
+            || !(parent instanceof AST_New) && value.contains_this())) {
+        return true;
+    }
+    if (parent instanceof AST_Array) {
+        return is_modified(compressor, tw, parent, parent, level + 1);
+    }
+    if (parent instanceof AST_ObjectKeyVal && node === parent.value) {
+        var obj = tw.parent(level + 1);
+        return is_modified(compressor, tw, obj, obj, level + 2);
+    }
+    if (parent instanceof AST_PropAccess && parent.expression === node) {
+        var prop = read_property(value, parent.property);
+        return !immutable && is_modified(compressor, tw, parent, prop, level + 1);
+    }
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/native-objects.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/native-objects.js
new file mode 100644
index 0000000..3d81a03
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/native-objects.js
@@ -0,0 +1,184 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import { makePredicate } from "../utils/index.js";
+
+// Lists of native methods, useful for `unsafe` option which assumes they exist.
+// Note: Lots of methods and functions are missing here, in case they aren't pure
+// or not available in all JS environments.
+
+function make_nested_lookup(obj) {
+    const out = new Map();
+    for (var key of Object.keys(obj)) {
+        out.set(key, makePredicate(obj[key]));
+    }
+
+    const does_have = (global_name, fname) => {
+        const inner_map = out.get(global_name);
+        return inner_map != null && inner_map.has(fname);
+    };
+    return does_have;
+}
+
+// Objects which are safe to access without throwing or causing a side effect.
+// Usually we'd check the `unsafe` option first but these are way too common for that
+export const pure_prop_access_globals = new Set([
+    "Number",
+    "String",
+    "Array",
+    "Object",
+    "Function",
+    "Promise",
+]);
+
+const object_methods = [
+    "constructor",
+    "toString",
+    "valueOf",
+];
+
+export const is_pure_native_method = make_nested_lookup({
+    Array: [
+        "indexOf",
+        "join",
+        "lastIndexOf",
+        "slice",
+        ...object_methods,
+    ],
+    Boolean: object_methods,
+    Function: object_methods,
+    Number: [
+        "toExponential",
+        "toFixed",
+        "toPrecision",
+        ...object_methods,
+    ],
+    Object: object_methods,
+    RegExp: [
+        "test",
+        ...object_methods,
+    ],
+    String: [
+        "charAt",
+        "charCodeAt",
+        "concat",
+        "indexOf",
+        "italics",
+        "lastIndexOf",
+        "match",
+        "replace",
+        "search",
+        "slice",
+        "split",
+        "substr",
+        "substring",
+        "toLowerCase",
+        "toUpperCase",
+        "trim",
+        ...object_methods,
+    ],
+});
+
+export const is_pure_native_fn = make_nested_lookup({
+    Array: [
+        "isArray",
+    ],
+    Math: [
+        "abs",
+        "acos",
+        "asin",
+        "atan",
+        "ceil",
+        "cos",
+        "exp",
+        "floor",
+        "log",
+        "round",
+        "sin",
+        "sqrt",
+        "tan",
+        "atan2",
+        "pow",
+        "max",
+        "min",
+    ],
+    Number: [
+        "isFinite",
+        "isNaN",
+    ],
+    Object: [
+        "create",
+        "getOwnPropertyDescriptor",
+        "getOwnPropertyNames",
+        "getPrototypeOf",
+        "isExtensible",
+        "isFrozen",
+        "isSealed",
+        "hasOwn",
+        "keys",
+    ],
+    String: [
+        "fromCharCode",
+    ],
+});
+
+// Known numeric values which come with JS environments
+export const is_pure_native_value = make_nested_lookup({
+    Math: [
+        "E",
+        "LN10",
+        "LN2",
+        "LOG2E",
+        "LOG10E",
+        "PI",
+        "SQRT1_2",
+        "SQRT2",
+    ],
+    Number: [
+        "MAX_VALUE",
+        "MIN_VALUE",
+        "NaN",
+        "NEGATIVE_INFINITY",
+        "POSITIVE_INFINITY",
+    ],
+});
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/reduce-vars.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/reduce-vars.js
new file mode 100644
index 0000000..3764845
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/reduce-vars.js
@@ -0,0 +1,675 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+    AST_Accessor,
+    AST_Array,
+    AST_Assign,
+    AST_Await,
+    AST_Binary,
+    AST_Block,
+    AST_Call,
+    AST_Case,
+    AST_Chain,
+    AST_Class,
+    AST_ClassExpression,
+    AST_Conditional,
+    AST_Default,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Do,
+    AST_Exit,
+    AST_Expansion,
+    AST_For,
+    AST_ForIn,
+    AST_If,
+    AST_LabeledStatement,
+    AST_Lambda,
+    AST_New,
+    AST_Node,
+    AST_Number,
+    AST_ObjectKeyVal,
+    AST_PropAccess,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Symbol,
+    AST_SymbolCatch,
+    AST_SymbolConst,
+    AST_SymbolDefun,
+    AST_SymbolFunarg,
+    AST_SymbolLambda,
+    AST_SymbolRef,
+    AST_This,
+    AST_Toplevel,
+    AST_Try,
+    AST_Unary,
+    AST_UnaryPrefix,
+    AST_Undefined,
+    AST_VarDef,
+    AST_While,
+    AST_Yield,
+
+    walk,
+    walk_body,
+
+    _INLINE,
+    _NOINLINE,
+    _PURE
+} from "../ast.js";
+import { HOP, make_node, noop } from "../utils/index.js";
+
+import { lazy_op, is_modified } from "./inference.js";
+import { INLINED, clear_flag } from "./compressor-flags.js";
+import { read_property, has_break_or_continue, is_recursive_ref } from "./common.js";
+
+// Define the method AST_Node#reduce_vars, which goes through the AST in
+// execution order to perform basic flow analysis
+
+function def_reduce_vars(node, func) {
+    node.DEFMETHOD("reduce_vars", func);
+}
+
+def_reduce_vars(AST_Node, noop);
+
+function reset_def(compressor, def) {
+    def.assignments = 0;
+    def.chained = false;
+    def.direct_access = false;
+    def.escaped = 0;
+    def.recursive_refs = 0;
+    def.references = [];
+    def.single_use = undefined;
+    if (def.scope.pinned()) {
+        def.fixed = false;
+    } else if (def.orig[0] instanceof AST_SymbolConst || !compressor.exposed(def)) {
+        def.fixed = def.init;
+    } else {
+        def.fixed = false;
+    }
+}
+
+function reset_variables(tw, compressor, node) {
+    node.variables.forEach(function(def) {
+        reset_def(compressor, def);
+        if (def.fixed === null) {
+            tw.defs_to_safe_ids.set(def.id, tw.safe_ids);
+            mark(tw, def, true);
+        } else if (def.fixed) {
+            tw.loop_ids.set(def.id, tw.in_loop);
+            mark(tw, def, true);
+        }
+    });
+}
+
+function reset_block_variables(compressor, node) {
+    if (node.block_scope) node.block_scope.variables.forEach((def) => {
+        reset_def(compressor, def);
+    });
+}
+
+function push(tw) {
+    tw.safe_ids = Object.create(tw.safe_ids);
+}
+
+function pop(tw) {
+    tw.safe_ids = Object.getPrototypeOf(tw.safe_ids);
+}
+
+function mark(tw, def, safe) {
+    tw.safe_ids[def.id] = safe;
+}
+
+function safe_to_read(tw, def) {
+    if (def.single_use == "m") return false;
+    if (tw.safe_ids[def.id]) {
+        if (def.fixed == null) {
+            var orig = def.orig[0];
+            if (orig instanceof AST_SymbolFunarg || orig.name == "arguments") return false;
+            def.fixed = make_node(AST_Undefined, orig);
+        }
+        return true;
+    }
+    return def.fixed instanceof AST_Defun;
+}
+
+function safe_to_assign(tw, def, scope, value) {
+    if (def.fixed === undefined) return true;
+    let def_safe_ids;
+    if (def.fixed === null
+        && (def_safe_ids = tw.defs_to_safe_ids.get(def.id))
+    ) {
+        def_safe_ids[def.id] = false;
+        tw.defs_to_safe_ids.delete(def.id);
+        return true;
+    }
+    if (!HOP(tw.safe_ids, def.id)) return false;
+    if (!safe_to_read(tw, def)) return false;
+    if (def.fixed === false) return false;
+    if (def.fixed != null && (!value || def.references.length > def.assignments)) return false;
+    if (def.fixed instanceof AST_Defun) {
+        return value instanceof AST_Node && def.fixed.parent_scope === scope;
+    }
+    return def.orig.every((sym) => {
+        return !(sym instanceof AST_SymbolConst
+            || sym instanceof AST_SymbolDefun
+            || sym instanceof AST_SymbolLambda);
+    });
+}
+
+function ref_once(tw, compressor, def) {
+    return compressor.option("unused")
+        && !def.scope.pinned()
+        && def.references.length - def.recursive_refs == 1
+        && tw.loop_ids.get(def.id) === tw.in_loop;
+}
+
+function is_immutable(value) {
+    if (!value) return false;
+    return value.is_constant()
+        || value instanceof AST_Lambda
+        || value instanceof AST_This;
+}
+
+// A definition "escapes" when its value can leave the point of use.
+// Example: `a = b || c`
+// In this example, "b" and "c" are escaping, because they're going into "a"
+//
+// def.escaped is != 0 when it escapes.
+//
+// When greater than 1, it means that N chained properties will be read off
+// of that def before an escape occurs. This is useful for evaluating
+// property accesses, where you need to know when to stop.
+function mark_escaped(tw, d, scope, node, value, level = 0, depth = 1) {
+    var parent = tw.parent(level);
+    if (value) {
+        if (value.is_constant()) return;
+        if (value instanceof AST_ClassExpression) return;
+    }
+
+    if (
+        parent instanceof AST_Assign && (parent.operator === "=" || parent.logical) && node === parent.right
+        || parent instanceof AST_Call && (node !== parent.expression || parent instanceof AST_New)
+        || parent instanceof AST_Exit && node === parent.value && node.scope !== d.scope
+        || parent instanceof AST_VarDef && node === parent.value
+        || parent instanceof AST_Yield && node === parent.value && node.scope !== d.scope
+    ) {
+        if (depth > 1 && !(value && value.is_constant_expression(scope))) depth = 1;
+        if (!d.escaped || d.escaped > depth) d.escaped = depth;
+        return;
+    } else if (
+        parent instanceof AST_Array
+        || parent instanceof AST_Await
+        || parent instanceof AST_Binary && lazy_op.has(parent.operator)
+        || parent instanceof AST_Conditional && node !== parent.condition
+        || parent instanceof AST_Expansion
+        || parent instanceof AST_Sequence && node === parent.tail_node()
+    ) {
+        mark_escaped(tw, d, scope, parent, parent, level + 1, depth);
+    } else if (parent instanceof AST_ObjectKeyVal && node === parent.value) {
+        var obj = tw.parent(level + 1);
+
+        mark_escaped(tw, d, scope, obj, obj, level + 2, depth);
+    } else if (parent instanceof AST_PropAccess && node === parent.expression) {
+        value = read_property(value, parent.property);
+
+        mark_escaped(tw, d, scope, parent, value, level + 1, depth + 1);
+        if (value) return;
+    }
+
+    if (level > 0) return;
+    if (parent instanceof AST_Sequence && node !== parent.tail_node()) return;
+    if (parent instanceof AST_SimpleStatement) return;
+
+    d.direct_access = true;
+}
+
+const suppress = node => walk(node, node => {
+    if (!(node instanceof AST_Symbol)) return;
+    var d = node.definition();
+    if (!d) return;
+    if (node instanceof AST_SymbolRef) d.references.push(node);
+    d.fixed = false;
+});
+
+def_reduce_vars(AST_Accessor, function(tw, descend, compressor) {
+    push(tw);
+    reset_variables(tw, compressor, this);
+    descend();
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Assign, function(tw, descend, compressor) {
+    var node = this;
+    if (node.left instanceof AST_Destructuring) {
+        suppress(node.left);
+        return;
+    }
+
+    const finish_walk = () => {
+        if (node.logical) {
+            node.left.walk(tw);
+
+            push(tw);
+            node.right.walk(tw);
+            pop(tw);
+
+            return true;
+        }
+    };
+
+    var sym = node.left;
+    if (!(sym instanceof AST_SymbolRef)) return finish_walk();
+
+    var def = sym.definition();
+    var safe = safe_to_assign(tw, def, sym.scope, node.right);
+    def.assignments++;
+    if (!safe) return finish_walk();
+
+    var fixed = def.fixed;
+    if (!fixed && node.operator != "=" && !node.logical) return finish_walk();
+
+    var eq = node.operator == "=";
+    var value = eq ? node.right : node;
+    if (is_modified(compressor, tw, node, value, 0)) return finish_walk();
+
+    def.references.push(sym);
+
+    if (!node.logical) {
+        if (!eq) def.chained = true;
+
+        def.fixed = eq ? function() {
+            return node.right;
+        } : function() {
+            return make_node(AST_Binary, node, {
+                operator: node.operator.slice(0, -1),
+                left: fixed instanceof AST_Node ? fixed : fixed(),
+                right: node.right
+            });
+        };
+    }
+
+    if (node.logical) {
+        mark(tw, def, false);
+        push(tw);
+        node.right.walk(tw);
+        pop(tw);
+        return true;
+    }
+
+    mark(tw, def, false);
+    node.right.walk(tw);
+    mark(tw, def, true);
+
+    mark_escaped(tw, def, sym.scope, node, value, 0, 1);
+
+    return true;
+});
+
+def_reduce_vars(AST_Binary, function(tw) {
+    if (!lazy_op.has(this.operator)) return;
+    this.left.walk(tw);
+    push(tw);
+    this.right.walk(tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Block, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+});
+
+def_reduce_vars(AST_Case, function(tw) {
+    push(tw);
+    this.expression.walk(tw);
+    pop(tw);
+    push(tw);
+    walk_body(this, tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Class, function(tw, descend) {
+    clear_flag(this, INLINED);
+    push(tw);
+    descend();
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Conditional, function(tw) {
+    this.condition.walk(tw);
+    push(tw);
+    this.consequent.walk(tw);
+    pop(tw);
+    push(tw);
+    this.alternative.walk(tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Chain, function(tw, descend) {
+    // Chains' conditions apply left-to-right, cumulatively.
+    // If we walk normally we don't go in that order because we would pop before pushing again
+    // Solution: AST_PropAccess and AST_Call push when they are optional, and never pop.
+    // Then we pop everything when they are done being walked.
+    const safe_ids = tw.safe_ids;
+
+    descend();
+
+    // Unroll back to start
+    tw.safe_ids = safe_ids;
+    return true;
+});
+
+def_reduce_vars(AST_Call, function (tw) {
+    this.expression.walk(tw);
+
+    if (this.optional) {
+        // Never pop -- it's popped at AST_Chain above
+        push(tw);
+    }
+
+    for (const arg of this.args) arg.walk(tw);
+
+    return true;
+});
+
+def_reduce_vars(AST_PropAccess, function (tw) {
+    if (!this.optional) return;
+
+    this.expression.walk(tw);
+
+    // Never pop -- it's popped at AST_Chain above
+    push(tw);
+
+    if (this.property instanceof AST_Node) this.property.walk(tw);
+
+    return true;
+});
+
+def_reduce_vars(AST_Default, function(tw, descend) {
+    push(tw);
+    descend();
+    pop(tw);
+    return true;
+});
+
+function mark_lambda(tw, descend, compressor) {
+    clear_flag(this, INLINED);
+    push(tw);
+    reset_variables(tw, compressor, this);
+    if (this.uses_arguments) {
+        descend();
+        pop(tw);
+        return;
+    }
+    var iife;
+    if (!this.name
+        && (iife = tw.parent()) instanceof AST_Call
+        && iife.expression === this
+        && !iife.args.some(arg => arg instanceof AST_Expansion)
+        && this.argnames.every(arg_name => arg_name instanceof AST_Symbol)
+    ) {
+        // Virtually turn IIFE parameters into variable definitions:
+        //   (function(a,b) {...})(c,d) => (function() {var a=c,b=d; ...})()
+        // So existing transformation rules can work on them.
+        this.argnames.forEach((arg, i) => {
+            if (!arg.definition) return;
+            var d = arg.definition();
+            // Avoid setting fixed when there's more than one origin for a variable value
+            if (d.orig.length > 1) return;
+            if (d.fixed === undefined && (!this.uses_arguments || tw.has_directive("use strict"))) {
+                d.fixed = function() {
+                    return iife.args[i] || make_node(AST_Undefined, iife);
+                };
+                tw.loop_ids.set(d.id, tw.in_loop);
+                mark(tw, d, true);
+            } else {
+                d.fixed = false;
+            }
+        });
+    }
+    descend();
+    pop(tw);
+    return true;
+}
+
+def_reduce_vars(AST_Lambda, mark_lambda);
+
+def_reduce_vars(AST_Do, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    this.body.walk(tw);
+    if (has_break_or_continue(this)) {
+        pop(tw);
+        push(tw);
+    }
+    this.condition.walk(tw);
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
+
+def_reduce_vars(AST_For, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    if (this.init) this.init.walk(tw);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    if (this.condition) this.condition.walk(tw);
+    this.body.walk(tw);
+    if (this.step) {
+        if (has_break_or_continue(this)) {
+            pop(tw);
+            push(tw);
+        }
+        this.step.walk(tw);
+    }
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
+
+def_reduce_vars(AST_ForIn, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    suppress(this.init);
+    this.object.walk(tw);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    this.body.walk(tw);
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
+
+def_reduce_vars(AST_If, function(tw) {
+    this.condition.walk(tw);
+    push(tw);
+    this.body.walk(tw);
+    pop(tw);
+    if (this.alternative) {
+        push(tw);
+        this.alternative.walk(tw);
+        pop(tw);
+    }
+    return true;
+});
+
+def_reduce_vars(AST_LabeledStatement, function(tw) {
+    push(tw);
+    this.body.walk(tw);
+    pop(tw);
+    return true;
+});
+
+def_reduce_vars(AST_SymbolCatch, function() {
+    this.definition().fixed = false;
+});
+
+def_reduce_vars(AST_SymbolRef, function(tw, descend, compressor) {
+    var d = this.definition();
+    d.references.push(this);
+    if (d.references.length == 1
+        && !d.fixed
+        && d.orig[0] instanceof AST_SymbolDefun) {
+        tw.loop_ids.set(d.id, tw.in_loop);
+    }
+    var fixed_value;
+    if (d.fixed === undefined || !safe_to_read(tw, d)) {
+        d.fixed = false;
+    } else if (d.fixed) {
+        fixed_value = this.fixed_value();
+        if (
+            fixed_value instanceof AST_Lambda
+            && is_recursive_ref(tw, d)
+        ) {
+            d.recursive_refs++;
+        } else if (fixed_value
+            && !compressor.exposed(d)
+            && ref_once(tw, compressor, d)
+        ) {
+            d.single_use =
+                fixed_value instanceof AST_Lambda && !fixed_value.pinned()
+                || fixed_value instanceof AST_Class
+                || d.scope === this.scope && fixed_value.is_constant_expression();
+        } else {
+            d.single_use = false;
+        }
+        if (is_modified(compressor, tw, this, fixed_value, 0, is_immutable(fixed_value))) {
+            if (d.single_use) {
+                d.single_use = "m";
+            } else {
+                d.fixed = false;
+            }
+        }
+    }
+    mark_escaped(tw, d, this.scope, this, fixed_value, 0, 1);
+});
+
+def_reduce_vars(AST_Toplevel, function(tw, descend, compressor) {
+    this.globals.forEach(function(def) {
+        reset_def(compressor, def);
+    });
+    reset_variables(tw, compressor, this);
+});
+
+def_reduce_vars(AST_Try, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    push(tw);
+    walk_body(this, tw);
+    pop(tw);
+    if (this.bcatch) {
+        push(tw);
+        this.bcatch.walk(tw);
+        pop(tw);
+    }
+    if (this.bfinally) this.bfinally.walk(tw);
+    return true;
+});
+
+def_reduce_vars(AST_Unary, function(tw) {
+    var node = this;
+    if (node.operator !== "++" && node.operator !== "--") return;
+    var exp = node.expression;
+    if (!(exp instanceof AST_SymbolRef)) return;
+    var def = exp.definition();
+    var safe = safe_to_assign(tw, def, exp.scope, true);
+    def.assignments++;
+    if (!safe) return;
+    var fixed = def.fixed;
+    if (!fixed) return;
+    def.references.push(exp);
+    def.chained = true;
+    def.fixed = function() {
+        return make_node(AST_Binary, node, {
+            operator: node.operator.slice(0, -1),
+            left: make_node(AST_UnaryPrefix, node, {
+                operator: "+",
+                expression: fixed instanceof AST_Node ? fixed : fixed()
+            }),
+            right: make_node(AST_Number, node, {
+                value: 1
+            })
+        });
+    };
+    mark(tw, def, true);
+    return true;
+});
+
+def_reduce_vars(AST_VarDef, function(tw, descend) {
+    var node = this;
+    if (node.name instanceof AST_Destructuring) {
+        suppress(node.name);
+        return;
+    }
+    var d = node.name.definition();
+    if (node.value) {
+        if (safe_to_assign(tw, d, node.name.scope, node.value)) {
+            d.fixed = function() {
+                return node.value;
+            };
+            tw.loop_ids.set(d.id, tw.in_loop);
+            mark(tw, d, false);
+            descend();
+            mark(tw, d, true);
+            return true;
+        } else {
+            d.fixed = false;
+        }
+    }
+});
+
+def_reduce_vars(AST_While, function(tw, descend, compressor) {
+    reset_block_variables(compressor, this);
+    const saved_loop = tw.in_loop;
+    tw.in_loop = this;
+    push(tw);
+    descend();
+    pop(tw);
+    tw.in_loop = saved_loop;
+    return true;
+});
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/compress/tighten-body.js b/node_modules/mathjs/examples/node_modules/terser/lib/compress/tighten-body.js
new file mode 100644
index 0000000..151383e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/compress/tighten-body.js
@@ -0,0 +1,1461 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import {
+    AST_Array,
+    AST_Arrow,
+    AST_Assign,
+    AST_Await,
+    AST_Binary,
+    AST_Block,
+    AST_BlockStatement,
+    AST_Break,
+    AST_Call,
+    AST_Case,
+    AST_Catch,
+    AST_Chain,
+    AST_Class,
+    AST_Conditional,
+    AST_Const,
+    AST_Constant,
+    AST_Continue,
+    AST_Debugger,
+    AST_Default,
+    AST_Definitions,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Dot,
+    AST_DWLoop,
+    AST_EmptyStatement,
+    AST_Exit,
+    AST_Expansion,
+    AST_Export,
+    AST_Finally,
+    AST_For,
+    AST_ForIn,
+    AST_If,
+    AST_Import,
+    AST_IterationStatement,
+    AST_Lambda,
+    AST_Let,
+    AST_LoopControl,
+    AST_Node,
+    AST_Number,
+    AST_Object,
+    AST_ObjectKeyVal,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Return,
+    AST_Scope,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Sub,
+    AST_Switch,
+    AST_Symbol,
+    AST_SymbolConst,
+    AST_SymbolDeclaration,
+    AST_SymbolDefun,
+    AST_SymbolFunarg,
+    AST_SymbolLambda,
+    AST_SymbolLet,
+    AST_SymbolRef,
+    AST_SymbolVar,
+    AST_This,
+    AST_Try,
+    AST_Unary,
+    AST_UnaryPostfix,
+    AST_UnaryPrefix,
+    AST_Undefined,
+    AST_Var,
+    AST_VarDef,
+    AST_With,
+    AST_Yield,
+
+    TreeTransformer,
+    TreeWalker,
+    walk,
+    walk_abort,
+
+    _NOINLINE
+} from "../ast.js";
+import {
+    make_node,
+    MAP,
+    member,
+    remove,
+    has_annotation
+} from "../utils/index.js";
+
+import { pure_prop_access_globals } from "./native-objects.js";
+import {
+    lazy_op,
+    unary_side_effects,
+    is_modified,
+    is_lhs,
+    aborts
+} from "./inference.js";
+import { WRITE_ONLY, clear_flag } from "./compressor-flags.js";
+import {
+    make_sequence,
+    merge_sequence,
+    maintain_this_binding,
+    is_func_expr,
+    is_identifier_atom,
+    is_ref_of,
+    can_be_evicted_from_block,
+    as_statement_array,
+} from "./common.js";
+
+function loop_body(x) {
+    if (x instanceof AST_IterationStatement) {
+        return x.body instanceof AST_BlockStatement ? x.body : x;
+    }
+    return x;
+}
+
+function is_lhs_read_only(lhs) {
+    if (lhs instanceof AST_This) return true;
+    if (lhs instanceof AST_SymbolRef) return lhs.definition().orig[0] instanceof AST_SymbolLambda;
+    if (lhs instanceof AST_PropAccess) {
+        lhs = lhs.expression;
+        if (lhs instanceof AST_SymbolRef) {
+            if (lhs.is_immutable()) return false;
+            lhs = lhs.fixed_value();
+        }
+        if (!lhs) return true;
+        if (lhs instanceof AST_RegExp) return false;
+        if (lhs instanceof AST_Constant) return true;
+        return is_lhs_read_only(lhs);
+    }
+    return false;
+}
+
+// Remove code which we know is unreachable.
+export function trim_unreachable_code(compressor, stat, target) {
+    walk(stat, node => {
+        if (node instanceof AST_Var) {
+            node.remove_initializers();
+            target.push(node);
+            return true;
+        }
+        if (
+            node instanceof AST_Defun
+            && (node === stat || !compressor.has_directive("use strict"))
+        ) {
+            target.push(node === stat ? node : make_node(AST_Var, node, {
+                definitions: [
+                    make_node(AST_VarDef, node, {
+                        name: make_node(AST_SymbolVar, node.name, node.name),
+                        value: null
+                    })
+                ]
+            }));
+            return true;
+        }
+        if (node instanceof AST_Export || node instanceof AST_Import) {
+            target.push(node);
+            return true;
+        }
+        if (node instanceof AST_Scope) {
+            return true;
+        }
+    });
+}
+
+// Tighten a bunch of statements together, and perform statement-level optimization.
+export function tighten_body(statements, compressor) {
+    var in_loop, in_try;
+    var scope = compressor.find_parent(AST_Scope).get_defun_scope();
+    find_loop_scope_try();
+    var CHANGED, max_iter = 10;
+    do {
+        CHANGED = false;
+        eliminate_spurious_blocks(statements);
+        if (compressor.option("dead_code")) {
+            eliminate_dead_code(statements, compressor);
+        }
+        if (compressor.option("if_return")) {
+            handle_if_return(statements, compressor);
+        }
+        if (compressor.sequences_limit > 0) {
+            sequencesize(statements, compressor);
+            sequencesize_2(statements, compressor);
+        }
+        if (compressor.option("join_vars")) {
+            join_consecutive_vars(statements);
+        }
+        if (compressor.option("collapse_vars")) {
+            collapse(statements, compressor);
+        }
+    } while (CHANGED && max_iter-- > 0);
+
+    function find_loop_scope_try() {
+        var node = compressor.self(), level = 0;
+        do {
+            if (node instanceof AST_Catch || node instanceof AST_Finally) {
+                level++;
+            } else if (node instanceof AST_IterationStatement) {
+                in_loop = true;
+            } else if (node instanceof AST_Scope) {
+                scope = node;
+                break;
+            } else if (node instanceof AST_Try) {
+                in_try = true;
+            }
+        } while (node = compressor.parent(level++));
+    }
+
+    // Search from right to left for assignment-like expressions:
+    // - `var a = x;`
+    // - `a = x;`
+    // - `++a`
+    // For each candidate, scan from left to right for first usage, then try
+    // to fold assignment into the site for compression.
+    // Will not attempt to collapse assignments into or past code blocks
+    // which are not sequentially executed, e.g. loops and conditionals.
+    function collapse(statements, compressor) {
+        if (scope.pinned())
+            return statements;
+        var args;
+        var candidates = [];
+        var stat_index = statements.length;
+        var scanner = new TreeTransformer(function (node) {
+            if (abort)
+                return node;
+            // Skip nodes before `candidate` as quickly as possible
+            if (!hit) {
+                if (node !== hit_stack[hit_index])
+                    return node;
+                hit_index++;
+                if (hit_index < hit_stack.length)
+                    return handle_custom_scan_order(node);
+                hit = true;
+                stop_after = find_stop(node, 0);
+                if (stop_after === node)
+                    abort = true;
+                return node;
+            }
+            // Stop immediately if these node types are encountered
+            var parent = scanner.parent();
+            if (node instanceof AST_Assign
+                    && (node.logical || node.operator != "=" && lhs.equivalent_to(node.left))
+                || node instanceof AST_Await
+                || node instanceof AST_Call && lhs instanceof AST_PropAccess && lhs.equivalent_to(node.expression)
+                || node instanceof AST_Debugger
+                || node instanceof AST_Destructuring
+                || node instanceof AST_Expansion
+                    && node.expression instanceof AST_Symbol
+                    && (
+                        node.expression instanceof AST_This
+                        || node.expression.definition().references.length > 1
+                    )
+                || node instanceof AST_IterationStatement && !(node instanceof AST_For)
+                || node instanceof AST_LoopControl
+                || node instanceof AST_Try
+                || node instanceof AST_With
+                || node instanceof AST_Yield
+                || node instanceof AST_Export
+                || node instanceof AST_Class
+                || parent instanceof AST_For && node !== parent.init
+                || !replace_all
+                    && (
+                        node instanceof AST_SymbolRef
+                        && !node.is_declared(compressor)
+                        && !pure_prop_access_globals.has(node)
+                    )
+                || node instanceof AST_SymbolRef
+                    && parent instanceof AST_Call
+                    && has_annotation(parent, _NOINLINE)
+            ) {
+                abort = true;
+                return node;
+            }
+            // Stop only if candidate is found within conditional branches
+            if (!stop_if_hit && (!lhs_local || !replace_all)
+                && (parent instanceof AST_Binary && lazy_op.has(parent.operator) && parent.left !== node
+                    || parent instanceof AST_Conditional && parent.condition !== node
+                    || parent instanceof AST_If && parent.condition !== node)) {
+                stop_if_hit = parent;
+            }
+            // Replace variable with assignment when found
+            if (can_replace
+                && !(node instanceof AST_SymbolDeclaration)
+                && lhs.equivalent_to(node)
+                && !shadows(node.scope, lvalues)
+            ) {
+                if (stop_if_hit) {
+                    abort = true;
+                    return node;
+                }
+                if (is_lhs(node, parent)) {
+                    if (value_def)
+                        replaced++;
+                    return node;
+                } else {
+                    replaced++;
+                    if (value_def && candidate instanceof AST_VarDef)
+                        return node;
+                }
+                CHANGED = abort = true;
+                if (candidate instanceof AST_UnaryPostfix) {
+                    return make_node(AST_UnaryPrefix, candidate, candidate);
+                }
+                if (candidate instanceof AST_VarDef) {
+                    var def = candidate.name.definition();
+                    var value = candidate.value;
+                    if (def.references.length - def.replaced == 1 && !compressor.exposed(def)) {
+                        def.replaced++;
+                        if (funarg && is_identifier_atom(value)) {
+                            return value.transform(compressor);
+                        } else {
+                            return maintain_this_binding(parent, node, value);
+                        }
+                    }
+                    return make_node(AST_Assign, candidate, {
+                        operator: "=",
+                        logical: false,
+                        left: make_node(AST_SymbolRef, candidate.name, candidate.name),
+                        right: value
+                    });
+                }
+                clear_flag(candidate, WRITE_ONLY);
+                return candidate;
+            }
+            // These node types have child nodes that execute sequentially,
+            // but are otherwise not safe to scan into or beyond them.
+            var sym;
+            if (node instanceof AST_Call
+                || node instanceof AST_Exit
+                && (side_effects || lhs instanceof AST_PropAccess || may_modify(lhs))
+                || node instanceof AST_PropAccess
+                && (side_effects || node.expression.may_throw_on_access(compressor))
+                || node instanceof AST_SymbolRef
+                && ((lvalues.has(node.name) && lvalues.get(node.name).modified) || side_effects && may_modify(node))
+                || node instanceof AST_VarDef && node.value
+                && (lvalues.has(node.name.name) || side_effects && may_modify(node.name))
+                || (sym = is_lhs(node.left, node))
+                && (sym instanceof AST_PropAccess || lvalues.has(sym.name))
+                || may_throw
+                && (in_try ? node.has_side_effects(compressor) : side_effects_external(node))) {
+                stop_after = node;
+                if (node instanceof AST_Scope)
+                    abort = true;
+            }
+            return handle_custom_scan_order(node);
+        }, function (node) {
+            if (abort)
+                return;
+            if (stop_after === node)
+                abort = true;
+            if (stop_if_hit === node)
+                stop_if_hit = null;
+        });
+
+        var multi_replacer = new TreeTransformer(function (node) {
+            if (abort)
+                return node;
+            // Skip nodes before `candidate` as quickly as possible
+            if (!hit) {
+                if (node !== hit_stack[hit_index])
+                    return node;
+                hit_index++;
+                if (hit_index < hit_stack.length)
+                    return;
+                hit = true;
+                return node;
+            }
+            // Replace variable when found
+            if (node instanceof AST_SymbolRef
+                && node.name == def.name) {
+                if (!--replaced)
+                    abort = true;
+                if (is_lhs(node, multi_replacer.parent()))
+                    return node;
+                def.replaced++;
+                value_def.replaced--;
+                return candidate.value;
+            }
+            // Skip (non-executed) functions and (leading) default case in switch statements
+            if (node instanceof AST_Default || node instanceof AST_Scope)
+                return node;
+        });
+
+        while (--stat_index >= 0) {
+            // Treat parameters as collapsible in IIFE, i.e.
+            //   function(a, b){ ... }(x());
+            // would be translated into equivalent assignments:
+            //   var a = x(), b = undefined;
+            if (stat_index == 0 && compressor.option("unused"))
+                extract_args();
+            // Find collapsible assignments
+            var hit_stack = [];
+            extract_candidates(statements[stat_index]);
+            while (candidates.length > 0) {
+                hit_stack = candidates.pop();
+                var hit_index = 0;
+                var candidate = hit_stack[hit_stack.length - 1];
+                var value_def = null;
+                var stop_after = null;
+                var stop_if_hit = null;
+                var lhs = get_lhs(candidate);
+                if (!lhs || is_lhs_read_only(lhs) || lhs.has_side_effects(compressor))
+                    continue;
+                // Locate symbols which may execute code outside of scanning range
+                var lvalues = get_lvalues(candidate);
+                var lhs_local = is_lhs_local(lhs);
+                if (lhs instanceof AST_SymbolRef) {
+                    lvalues.set(lhs.name, { def: lhs.definition(), modified: false });
+                }
+                var side_effects = value_has_side_effects(candidate);
+                var replace_all = replace_all_symbols();
+                var may_throw = candidate.may_throw(compressor);
+                var funarg = candidate.name instanceof AST_SymbolFunarg;
+                var hit = funarg;
+                var abort = false, replaced = 0, can_replace = !args || !hit;
+                if (!can_replace) {
+                    for (var j = compressor.self().argnames.lastIndexOf(candidate.name) + 1; !abort && j < args.length; j++) {
+                        args[j].transform(scanner);
+                    }
+                    can_replace = true;
+                }
+                for (var i = stat_index; !abort && i < statements.length; i++) {
+                    statements[i].transform(scanner);
+                }
+                if (value_def) {
+                    var def = candidate.name.definition();
+                    if (abort && def.references.length - def.replaced > replaced)
+                        replaced = false;
+                    else {
+                        abort = false;
+                        hit_index = 0;
+                        hit = funarg;
+                        for (var i = stat_index; !abort && i < statements.length; i++) {
+                            statements[i].transform(multi_replacer);
+                        }
+                        value_def.single_use = false;
+                    }
+                }
+                if (replaced && !remove_candidate(candidate))
+                    statements.splice(stat_index, 1);
+            }
+        }
+
+        function handle_custom_scan_order(node) {
+            // Skip (non-executed) functions
+            if (node instanceof AST_Scope)
+                return node;
+
+            // Scan case expressions first in a switch statement
+            if (node instanceof AST_Switch) {
+                node.expression = node.expression.transform(scanner);
+                for (var i = 0, len = node.body.length; !abort && i < len; i++) {
+                    var branch = node.body[i];
+                    if (branch instanceof AST_Case) {
+                        if (!hit) {
+                            if (branch !== hit_stack[hit_index])
+                                continue;
+                            hit_index++;
+                        }
+                        branch.expression = branch.expression.transform(scanner);
+                        if (!replace_all)
+                            break;
+                    }
+                }
+                abort = true;
+                return node;
+            }
+        }
+
+        function redefined_within_scope(def, scope) {
+            if (def.global)
+                return false;
+            let cur_scope = def.scope;
+            while (cur_scope && cur_scope !== scope) {
+                if (cur_scope.variables.has(def.name)) {
+                    return true;
+                }
+                cur_scope = cur_scope.parent_scope;
+            }
+            return false;
+        }
+
+        function has_overlapping_symbol(fn, arg, fn_strict) {
+            var found = false, scan_this = !(fn instanceof AST_Arrow);
+            arg.walk(new TreeWalker(function (node, descend) {
+                if (found)
+                    return true;
+                if (node instanceof AST_SymbolRef && (fn.variables.has(node.name) || redefined_within_scope(node.definition(), fn))) {
+                    var s = node.definition().scope;
+                    if (s !== scope)
+                        while (s = s.parent_scope) {
+                            if (s === scope)
+                                return true;
+                        }
+                    return found = true;
+                }
+                if ((fn_strict || scan_this) && node instanceof AST_This) {
+                    return found = true;
+                }
+                if (node instanceof AST_Scope && !(node instanceof AST_Arrow)) {
+                    var prev = scan_this;
+                    scan_this = false;
+                    descend();
+                    scan_this = prev;
+                    return true;
+                }
+            }));
+            return found;
+        }
+
+        function extract_args() {
+            var iife, fn = compressor.self();
+            if (is_func_expr(fn)
+                && !fn.name
+                && !fn.uses_arguments
+                && !fn.pinned()
+                && (iife = compressor.parent()) instanceof AST_Call
+                && iife.expression === fn
+                && iife.args.every((arg) => !(arg instanceof AST_Expansion))) {
+                var fn_strict = compressor.has_directive("use strict");
+                if (fn_strict && !member(fn_strict, fn.body))
+                    fn_strict = false;
+                var len = fn.argnames.length;
+                args = iife.args.slice(len);
+                var names = new Set();
+                for (var i = len; --i >= 0;) {
+                    var sym = fn.argnames[i];
+                    var arg = iife.args[i];
+                    // The following two line fix is a duplicate of the fix at
+                    // https://github.com/terser/terser/commit/011d3eb08cefe6922c7d1bdfa113fc4aeaca1b75
+                    // This might mean that these two pieces of code (one here in collapse_vars and another in reduce_vars
+                    // Might be doing the exact same thing.
+                    const def = sym.definition && sym.definition();
+                    const is_reassigned = def && def.orig.length > 1;
+                    if (is_reassigned)
+                        continue;
+                    args.unshift(make_node(AST_VarDef, sym, {
+                        name: sym,
+                        value: arg
+                    }));
+                    if (names.has(sym.name))
+                        continue;
+                    names.add(sym.name);
+                    if (sym instanceof AST_Expansion) {
+                        var elements = iife.args.slice(i);
+                        if (elements.every((arg) => !has_overlapping_symbol(fn, arg, fn_strict)
+                        )) {
+                            candidates.unshift([make_node(AST_VarDef, sym, {
+                                name: sym.expression,
+                                value: make_node(AST_Array, iife, {
+                                    elements: elements
+                                })
+                            })]);
+                        }
+                    } else {
+                        if (!arg) {
+                            arg = make_node(AST_Undefined, sym).transform(compressor);
+                        } else if (arg instanceof AST_Lambda && arg.pinned()
+                            || has_overlapping_symbol(fn, arg, fn_strict)) {
+                            arg = null;
+                        }
+                        if (arg)
+                            candidates.unshift([make_node(AST_VarDef, sym, {
+                                name: sym,
+                                value: arg
+                            })]);
+                    }
+                }
+            }
+        }
+
+        function extract_candidates(expr) {
+            hit_stack.push(expr);
+            if (expr instanceof AST_Assign) {
+                if (!expr.left.has_side_effects(compressor)
+                    && !(expr.right instanceof AST_Chain)) {
+                    candidates.push(hit_stack.slice());
+                }
+                extract_candidates(expr.right);
+            } else if (expr instanceof AST_Binary) {
+                extract_candidates(expr.left);
+                extract_candidates(expr.right);
+            } else if (expr instanceof AST_Call && !has_annotation(expr, _NOINLINE)) {
+                extract_candidates(expr.expression);
+                expr.args.forEach(extract_candidates);
+            } else if (expr instanceof AST_Case) {
+                extract_candidates(expr.expression);
+            } else if (expr instanceof AST_Conditional) {
+                extract_candidates(expr.condition);
+                extract_candidates(expr.consequent);
+                extract_candidates(expr.alternative);
+            } else if (expr instanceof AST_Definitions) {
+                var len = expr.definitions.length;
+                // limit number of trailing variable definitions for consideration
+                var i = len - 200;
+                if (i < 0)
+                    i = 0;
+                for (; i < len; i++) {
+                    extract_candidates(expr.definitions[i]);
+                }
+            } else if (expr instanceof AST_DWLoop) {
+                extract_candidates(expr.condition);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+            } else if (expr instanceof AST_Exit) {
+                if (expr.value)
+                    extract_candidates(expr.value);
+            } else if (expr instanceof AST_For) {
+                if (expr.init)
+                    extract_candidates(expr.init);
+                if (expr.condition)
+                    extract_candidates(expr.condition);
+                if (expr.step)
+                    extract_candidates(expr.step);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+            } else if (expr instanceof AST_ForIn) {
+                extract_candidates(expr.object);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+            } else if (expr instanceof AST_If) {
+                extract_candidates(expr.condition);
+                if (!(expr.body instanceof AST_Block)) {
+                    extract_candidates(expr.body);
+                }
+                if (expr.alternative && !(expr.alternative instanceof AST_Block)) {
+                    extract_candidates(expr.alternative);
+                }
+            } else if (expr instanceof AST_Sequence) {
+                expr.expressions.forEach(extract_candidates);
+            } else if (expr instanceof AST_SimpleStatement) {
+                extract_candidates(expr.body);
+            } else if (expr instanceof AST_Switch) {
+                extract_candidates(expr.expression);
+                expr.body.forEach(extract_candidates);
+            } else if (expr instanceof AST_Unary) {
+                if (expr.operator == "++" || expr.operator == "--") {
+                    candidates.push(hit_stack.slice());
+                }
+            } else if (expr instanceof AST_VarDef) {
+                if (expr.value && !(expr.value instanceof AST_Chain)) {
+                    candidates.push(hit_stack.slice());
+                    extract_candidates(expr.value);
+                }
+            }
+            hit_stack.pop();
+        }
+
+        function find_stop(node, level, write_only) {
+            var parent = scanner.parent(level);
+            if (parent instanceof AST_Assign) {
+                if (write_only
+                    && !parent.logical
+                    && !(parent.left instanceof AST_PropAccess
+                        || lvalues.has(parent.left.name))) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_Binary) {
+                if (write_only && (!lazy_op.has(parent.operator) || parent.left === node)) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_Call)
+                return node;
+            if (parent instanceof AST_Case)
+                return node;
+            if (parent instanceof AST_Conditional) {
+                if (write_only && parent.condition === node) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_Definitions) {
+                return find_stop(parent, level + 1, true);
+            }
+            if (parent instanceof AST_Exit) {
+                return write_only ? find_stop(parent, level + 1, write_only) : node;
+            }
+            if (parent instanceof AST_If) {
+                if (write_only && parent.condition === node) {
+                    return find_stop(parent, level + 1, write_only);
+                }
+                return node;
+            }
+            if (parent instanceof AST_IterationStatement)
+                return node;
+            if (parent instanceof AST_Sequence) {
+                return find_stop(parent, level + 1, parent.tail_node() !== node);
+            }
+            if (parent instanceof AST_SimpleStatement) {
+                return find_stop(parent, level + 1, true);
+            }
+            if (parent instanceof AST_Switch)
+                return node;
+            if (parent instanceof AST_VarDef)
+                return node;
+            return null;
+        }
+
+        function mangleable_var(var_def) {
+            var value = var_def.value;
+            if (!(value instanceof AST_SymbolRef))
+                return;
+            if (value.name == "arguments")
+                return;
+            var def = value.definition();
+            if (def.undeclared)
+                return;
+            return value_def = def;
+        }
+
+        function get_lhs(expr) {
+            if (expr instanceof AST_Assign && expr.logical) {
+                return false;
+            } else if (expr instanceof AST_VarDef && expr.name instanceof AST_SymbolDeclaration) {
+                var def = expr.name.definition();
+                if (!member(expr.name, def.orig))
+                    return;
+                var referenced = def.references.length - def.replaced;
+                if (!referenced)
+                    return;
+                var declared = def.orig.length - def.eliminated;
+                if (declared > 1 && !(expr.name instanceof AST_SymbolFunarg)
+                    || (referenced > 1 ? mangleable_var(expr) : !compressor.exposed(def))) {
+                    return make_node(AST_SymbolRef, expr.name, expr.name);
+                }
+            } else {
+                const lhs = expr instanceof AST_Assign
+                    ? expr.left
+                    : expr.expression;
+                return !is_ref_of(lhs, AST_SymbolConst)
+                    && !is_ref_of(lhs, AST_SymbolLet) && lhs;
+            }
+        }
+
+        function get_rvalue(expr) {
+            if (expr instanceof AST_Assign) {
+                return expr.right;
+            } else {
+                return expr.value;
+            }
+        }
+
+        function get_lvalues(expr) {
+            var lvalues = new Map();
+            if (expr instanceof AST_Unary)
+                return lvalues;
+            var tw = new TreeWalker(function (node) {
+                var sym = node;
+                while (sym instanceof AST_PropAccess)
+                    sym = sym.expression;
+                if (sym instanceof AST_SymbolRef) {
+                    const prev = lvalues.get(sym.name);
+                    if (!prev || !prev.modified) {
+                        lvalues.set(sym.name, {
+                            def: sym.definition(),
+                            modified: is_modified(compressor, tw, node, node, 0)
+                        });
+                    }
+                }
+            });
+            get_rvalue(expr).walk(tw);
+            return lvalues;
+        }
+
+        function remove_candidate(expr) {
+            if (expr.name instanceof AST_SymbolFunarg) {
+                var iife = compressor.parent(), argnames = compressor.self().argnames;
+                var index = argnames.indexOf(expr.name);
+                if (index < 0) {
+                    iife.args.length = Math.min(iife.args.length, argnames.length - 1);
+                } else {
+                    var args = iife.args;
+                    if (args[index])
+                        args[index] = make_node(AST_Number, args[index], {
+                            value: 0
+                        });
+                }
+                return true;
+            }
+            var found = false;
+            return statements[stat_index].transform(new TreeTransformer(function (node, descend, in_list) {
+                if (found)
+                    return node;
+                if (node === expr || node.body === expr) {
+                    found = true;
+                    if (node instanceof AST_VarDef) {
+                        node.value = node.name instanceof AST_SymbolConst
+                            ? make_node(AST_Undefined, node.value) // `const` always needs value.
+                            : null;
+                        return node;
+                    }
+                    return in_list ? MAP.skip : null;
+                }
+            }, function (node) {
+                if (node instanceof AST_Sequence)
+                    switch (node.expressions.length) {
+                        case 0: return null;
+                        case 1: return node.expressions[0];
+                    }
+            }));
+        }
+
+        function is_lhs_local(lhs) {
+            while (lhs instanceof AST_PropAccess)
+                lhs = lhs.expression;
+            return lhs instanceof AST_SymbolRef
+                && lhs.definition().scope === scope
+                && !(in_loop
+                    && (lvalues.has(lhs.name)
+                        || candidate instanceof AST_Unary
+                        || (candidate instanceof AST_Assign
+                            && !candidate.logical
+                            && candidate.operator != "=")));
+        }
+
+        function value_has_side_effects(expr) {
+            if (expr instanceof AST_Unary)
+                return unary_side_effects.has(expr.operator);
+            return get_rvalue(expr).has_side_effects(compressor);
+        }
+
+        function replace_all_symbols() {
+            if (side_effects)
+                return false;
+            if (value_def)
+                return true;
+            if (lhs instanceof AST_SymbolRef) {
+                var def = lhs.definition();
+                if (def.references.length - def.replaced == (candidate instanceof AST_VarDef ? 1 : 2)) {
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        function may_modify(sym) {
+            if (!sym.definition)
+                return true; // AST_Destructuring
+            var def = sym.definition();
+            if (def.orig.length == 1 && def.orig[0] instanceof AST_SymbolDefun)
+                return false;
+            if (def.scope.get_defun_scope() !== scope)
+                return true;
+            return !def.references.every((ref) => {
+                var s = ref.scope.get_defun_scope();
+                // "block" scope within AST_Catch
+                if (s.TYPE == "Scope")
+                    s = s.parent_scope;
+                return s === scope;
+            });
+        }
+
+        function side_effects_external(node, lhs) {
+            if (node instanceof AST_Assign)
+                return side_effects_external(node.left, true);
+            if (node instanceof AST_Unary)
+                return side_effects_external(node.expression, true);
+            if (node instanceof AST_VarDef)
+                return node.value && side_effects_external(node.value);
+            if (lhs) {
+                if (node instanceof AST_Dot)
+                    return side_effects_external(node.expression, true);
+                if (node instanceof AST_Sub)
+                    return side_effects_external(node.expression, true);
+                if (node instanceof AST_SymbolRef)
+                    return node.definition().scope !== scope;
+            }
+            return false;
+        }
+
+        function shadows(newScope, lvalues) {
+            for (const {def} of lvalues.values()) {
+                let current = newScope;
+                while (current && current !== def.scope) {
+                    let nested_def = current.variables.get(def.name);
+                    if (nested_def && nested_def !== def) return true;
+                    current = current.parent_scope;
+                }
+            }
+            return false;
+        }
+    }
+
+    function eliminate_spurious_blocks(statements) {
+        var seen_dirs = [];
+        for (var i = 0; i < statements.length;) {
+            var stat = statements[i];
+            if (stat instanceof AST_BlockStatement && stat.body.every(can_be_evicted_from_block)) {
+                CHANGED = true;
+                eliminate_spurious_blocks(stat.body);
+                statements.splice(i, 1, ...stat.body);
+                i += stat.body.length;
+            } else if (stat instanceof AST_EmptyStatement) {
+                CHANGED = true;
+                statements.splice(i, 1);
+            } else if (stat instanceof AST_Directive) {
+                if (seen_dirs.indexOf(stat.value) < 0) {
+                    i++;
+                    seen_dirs.push(stat.value);
+                } else {
+                    CHANGED = true;
+                    statements.splice(i, 1);
+                }
+            } else
+                i++;
+        }
+    }
+
+    function handle_if_return(statements, compressor) {
+        var self = compressor.self();
+        var multiple_if_returns = has_multiple_if_returns(statements);
+        var in_lambda = self instanceof AST_Lambda;
+        for (var i = statements.length; --i >= 0;) {
+            var stat = statements[i];
+            var j = next_index(i);
+            var next = statements[j];
+
+            if (in_lambda && !next && stat instanceof AST_Return) {
+                if (!stat.value) {
+                    CHANGED = true;
+                    statements.splice(i, 1);
+                    continue;
+                }
+                if (stat.value instanceof AST_UnaryPrefix && stat.value.operator == "void") {
+                    CHANGED = true;
+                    statements[i] = make_node(AST_SimpleStatement, stat, {
+                        body: stat.value.expression
+                    });
+                    continue;
+                }
+            }
+
+            if (stat instanceof AST_If) {
+                var ab = aborts(stat.body);
+                if (can_merge_flow(ab)) {
+                    if (ab.label) {
+                        remove(ab.label.thedef.references, ab);
+                    }
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.condition = stat.condition.negate(compressor);
+                    var body = as_statement_array_with_return(stat.body, ab);
+                    stat.body = make_node(AST_BlockStatement, stat, {
+                        body: as_statement_array(stat.alternative).concat(extract_functions())
+                    });
+                    stat.alternative = make_node(AST_BlockStatement, stat, {
+                        body: body
+                    });
+                    statements[i] = stat.transform(compressor);
+                    continue;
+                }
+
+                var ab = aborts(stat.alternative);
+                if (can_merge_flow(ab)) {
+                    if (ab.label) {
+                        remove(ab.label.thedef.references, ab);
+                    }
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.body = make_node(AST_BlockStatement, stat.body, {
+                        body: as_statement_array(stat.body).concat(extract_functions())
+                    });
+                    var body = as_statement_array_with_return(stat.alternative, ab);
+                    stat.alternative = make_node(AST_BlockStatement, stat.alternative, {
+                        body: body
+                    });
+                    statements[i] = stat.transform(compressor);
+                    continue;
+                }
+            }
+
+            if (stat instanceof AST_If && stat.body instanceof AST_Return) {
+                var value = stat.body.value;
+                //---
+                // pretty silly case, but:
+                // if (foo()) return; return; ==> foo(); return;
+                if (!value && !stat.alternative
+                    && (in_lambda && !next || next instanceof AST_Return && !next.value)) {
+                    CHANGED = true;
+                    statements[i] = make_node(AST_SimpleStatement, stat.condition, {
+                        body: stat.condition
+                    });
+                    continue;
+                }
+                //---
+                // if (foo()) return x; return y; ==> return foo() ? x : y;
+                if (value && !stat.alternative && next instanceof AST_Return && next.value) {
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.alternative = next;
+                    statements[i] = stat.transform(compressor);
+                    statements.splice(j, 1);
+                    continue;
+                }
+                //---
+                // if (foo()) return x; [ return ; ] ==> return foo() ? x : undefined;
+                if (value && !stat.alternative
+                    && (!next && in_lambda && multiple_if_returns
+                        || next instanceof AST_Return)) {
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.alternative = next || make_node(AST_Return, stat, {
+                        value: null
+                    });
+                    statements[i] = stat.transform(compressor);
+                    if (next)
+                        statements.splice(j, 1);
+                    continue;
+                }
+                //---
+                // if (a) return b; if (c) return d; e; ==> return a ? b : c ? d : void e;
+                //
+                // if sequences is not enabled, this can lead to an endless loop (issue #866).
+                // however, with sequences on this helps producing slightly better output for
+                // the example code.
+                var prev = statements[prev_index(i)];
+                if (compressor.option("sequences") && in_lambda && !stat.alternative
+                    && prev instanceof AST_If && prev.body instanceof AST_Return
+                    && next_index(j) == statements.length && next instanceof AST_SimpleStatement) {
+                    CHANGED = true;
+                    stat = stat.clone();
+                    stat.alternative = make_node(AST_BlockStatement, next, {
+                        body: [
+                            next,
+                            make_node(AST_Return, next, {
+                                value: null
+                            })
+                        ]
+                    });
+                    statements[i] = stat.transform(compressor);
+                    statements.splice(j, 1);
+                    continue;
+                }
+            }
+        }
+
+        function has_multiple_if_returns(statements) {
+            var n = 0;
+            for (var i = statements.length; --i >= 0;) {
+                var stat = statements[i];
+                if (stat instanceof AST_If && stat.body instanceof AST_Return) {
+                    if (++n > 1)
+                        return true;
+                }
+            }
+            return false;
+        }
+
+        function is_return_void(value) {
+            return !value || value instanceof AST_UnaryPrefix && value.operator == "void";
+        }
+
+        function can_merge_flow(ab) {
+            if (!ab)
+                return false;
+            for (var j = i + 1, len = statements.length; j < len; j++) {
+                var stat = statements[j];
+                if (stat instanceof AST_Const || stat instanceof AST_Let)
+                    return false;
+            }
+            var lct = ab instanceof AST_LoopControl ? compressor.loopcontrol_target(ab) : null;
+            return ab instanceof AST_Return && in_lambda && is_return_void(ab.value)
+                || ab instanceof AST_Continue && self === loop_body(lct)
+                || ab instanceof AST_Break && lct instanceof AST_BlockStatement && self === lct;
+        }
+
+        function extract_functions() {
+            var tail = statements.slice(i + 1);
+            statements.length = i + 1;
+            return tail.filter(function (stat) {
+                if (stat instanceof AST_Defun) {
+                    statements.push(stat);
+                    return false;
+                }
+                return true;
+            });
+        }
+
+        function as_statement_array_with_return(node, ab) {
+            var body = as_statement_array(node).slice(0, -1);
+            if (ab.value) {
+                body.push(make_node(AST_SimpleStatement, ab.value, {
+                    body: ab.value.expression
+                }));
+            }
+            return body;
+        }
+
+        function next_index(i) {
+            for (var j = i + 1, len = statements.length; j < len; j++) {
+                var stat = statements[j];
+                if (!(stat instanceof AST_Var && declarations_only(stat))) {
+                    break;
+                }
+            }
+            return j;
+        }
+
+        function prev_index(i) {
+            for (var j = i; --j >= 0;) {
+                var stat = statements[j];
+                if (!(stat instanceof AST_Var && declarations_only(stat))) {
+                    break;
+                }
+            }
+            return j;
+        }
+    }
+
+    function eliminate_dead_code(statements, compressor) {
+        var has_quit;
+        var self = compressor.self();
+        for (var i = 0, n = 0, len = statements.length; i < len; i++) {
+            var stat = statements[i];
+            if (stat instanceof AST_LoopControl) {
+                var lct = compressor.loopcontrol_target(stat);
+                if (stat instanceof AST_Break
+                    && !(lct instanceof AST_IterationStatement)
+                    && loop_body(lct) === self
+                    || stat instanceof AST_Continue
+                    && loop_body(lct) === self) {
+                    if (stat.label) {
+                        remove(stat.label.thedef.references, stat);
+                    }
+                } else {
+                    statements[n++] = stat;
+                }
+            } else {
+                statements[n++] = stat;
+            }
+            if (aborts(stat)) {
+                has_quit = statements.slice(i + 1);
+                break;
+            }
+        }
+        statements.length = n;
+        CHANGED = n != len;
+        if (has_quit)
+            has_quit.forEach(function (stat) {
+                trim_unreachable_code(compressor, stat, statements);
+            });
+    }
+
+    function declarations_only(node) {
+        return node.definitions.every((var_def) => !var_def.value
+        );
+    }
+
+    function sequencesize(statements, compressor) {
+        if (statements.length < 2)
+            return;
+        var seq = [], n = 0;
+        function push_seq() {
+            if (!seq.length)
+                return;
+            var body = make_sequence(seq[0], seq);
+            statements[n++] = make_node(AST_SimpleStatement, body, { body: body });
+            seq = [];
+        }
+        for (var i = 0, len = statements.length; i < len; i++) {
+            var stat = statements[i];
+            if (stat instanceof AST_SimpleStatement) {
+                if (seq.length >= compressor.sequences_limit)
+                    push_seq();
+                var body = stat.body;
+                if (seq.length > 0)
+                    body = body.drop_side_effect_free(compressor);
+                if (body)
+                    merge_sequence(seq, body);
+            } else if (stat instanceof AST_Definitions && declarations_only(stat)
+                || stat instanceof AST_Defun) {
+                statements[n++] = stat;
+            } else {
+                push_seq();
+                statements[n++] = stat;
+            }
+        }
+        push_seq();
+        statements.length = n;
+        if (n != len)
+            CHANGED = true;
+    }
+
+    function to_simple_statement(block, decls) {
+        if (!(block instanceof AST_BlockStatement))
+            return block;
+        var stat = null;
+        for (var i = 0, len = block.body.length; i < len; i++) {
+            var line = block.body[i];
+            if (line instanceof AST_Var && declarations_only(line)) {
+                decls.push(line);
+            } else if (stat) {
+                return false;
+            } else {
+                stat = line;
+            }
+        }
+        return stat;
+    }
+
+    function sequencesize_2(statements, compressor) {
+        function cons_seq(right) {
+            n--;
+            CHANGED = true;
+            var left = prev.body;
+            return make_sequence(left, [left, right]).transform(compressor);
+        }
+        var n = 0, prev;
+        for (var i = 0; i < statements.length; i++) {
+            var stat = statements[i];
+            if (prev) {
+                if (stat instanceof AST_Exit) {
+                    stat.value = cons_seq(stat.value || make_node(AST_Undefined, stat).transform(compressor));
+                } else if (stat instanceof AST_For) {
+                    if (!(stat.init instanceof AST_Definitions)) {
+                        const abort = walk(prev.body, node => {
+                            if (node instanceof AST_Scope)
+                                return true;
+                            if (node instanceof AST_Binary
+                                && node.operator === "in") {
+                                return walk_abort;
+                            }
+                        });
+                        if (!abort) {
+                            if (stat.init)
+                                stat.init = cons_seq(stat.init);
+                            else {
+                                stat.init = prev.body;
+                                n--;
+                                CHANGED = true;
+                            }
+                        }
+                    }
+                } else if (stat instanceof AST_ForIn) {
+                    if (!(stat.init instanceof AST_Const) && !(stat.init instanceof AST_Let)) {
+                        stat.object = cons_seq(stat.object);
+                    }
+                } else if (stat instanceof AST_If) {
+                    stat.condition = cons_seq(stat.condition);
+                } else if (stat instanceof AST_Switch) {
+                    stat.expression = cons_seq(stat.expression);
+                } else if (stat instanceof AST_With) {
+                    stat.expression = cons_seq(stat.expression);
+                }
+            }
+            if (compressor.option("conditionals") && stat instanceof AST_If) {
+                var decls = [];
+                var body = to_simple_statement(stat.body, decls);
+                var alt = to_simple_statement(stat.alternative, decls);
+                if (body !== false && alt !== false && decls.length > 0) {
+                    var len = decls.length;
+                    decls.push(make_node(AST_If, stat, {
+                        condition: stat.condition,
+                        body: body || make_node(AST_EmptyStatement, stat.body),
+                        alternative: alt
+                    }));
+                    decls.unshift(n, 1);
+                    [].splice.apply(statements, decls);
+                    i += len;
+                    n += len + 1;
+                    prev = null;
+                    CHANGED = true;
+                    continue;
+                }
+            }
+            statements[n++] = stat;
+            prev = stat instanceof AST_SimpleStatement ? stat : null;
+        }
+        statements.length = n;
+    }
+
+    function join_object_assignments(defn, body) {
+        if (!(defn instanceof AST_Definitions))
+            return;
+        var def = defn.definitions[defn.definitions.length - 1];
+        if (!(def.value instanceof AST_Object))
+            return;
+        var exprs;
+        if (body instanceof AST_Assign && !body.logical) {
+            exprs = [body];
+        } else if (body instanceof AST_Sequence) {
+            exprs = body.expressions.slice();
+        }
+        if (!exprs)
+            return;
+        var trimmed = false;
+        do {
+            var node = exprs[0];
+            if (!(node instanceof AST_Assign))
+                break;
+            if (node.operator != "=")
+                break;
+            if (!(node.left instanceof AST_PropAccess))
+                break;
+            var sym = node.left.expression;
+            if (!(sym instanceof AST_SymbolRef))
+                break;
+            if (def.name.name != sym.name)
+                break;
+            if (!node.right.is_constant_expression(scope))
+                break;
+            var prop = node.left.property;
+            if (prop instanceof AST_Node) {
+                prop = prop.evaluate(compressor);
+            }
+            if (prop instanceof AST_Node)
+                break;
+            prop = "" + prop;
+            var diff = compressor.option("ecma") < 2015
+                && compressor.has_directive("use strict") ? function (node) {
+                    return node.key != prop && (node.key && node.key.name != prop);
+                } : function (node) {
+                    return node.key && node.key.name != prop;
+                };
+            if (!def.value.properties.every(diff))
+                break;
+            var p = def.value.properties.filter(function (p) { return p.key === prop; })[0];
+            if (!p) {
+                def.value.properties.push(make_node(AST_ObjectKeyVal, node, {
+                    key: prop,
+                    value: node.right
+                }));
+            } else {
+                p.value = new AST_Sequence({
+                    start: p.start,
+                    expressions: [p.value.clone(), node.right.clone()],
+                    end: p.end
+                });
+            }
+            exprs.shift();
+            trimmed = true;
+        } while (exprs.length);
+        return trimmed && exprs;
+    }
+
+    function join_consecutive_vars(statements) {
+        var defs;
+        for (var i = 0, j = -1, len = statements.length; i < len; i++) {
+            var stat = statements[i];
+            var prev = statements[j];
+            if (stat instanceof AST_Definitions) {
+                if (prev && prev.TYPE == stat.TYPE) {
+                    prev.definitions = prev.definitions.concat(stat.definitions);
+                    CHANGED = true;
+                } else if (defs && defs.TYPE == stat.TYPE && declarations_only(stat)) {
+                    defs.definitions = defs.definitions.concat(stat.definitions);
+                    CHANGED = true;
+                } else {
+                    statements[++j] = stat;
+                    defs = stat;
+                }
+            } else if (stat instanceof AST_Exit) {
+                stat.value = extract_object_assignments(stat.value);
+            } else if (stat instanceof AST_For) {
+                var exprs = join_object_assignments(prev, stat.init);
+                if (exprs) {
+                    CHANGED = true;
+                    stat.init = exprs.length ? make_sequence(stat.init, exprs) : null;
+                    statements[++j] = stat;
+                } else if (prev instanceof AST_Var && (!stat.init || stat.init.TYPE == prev.TYPE)) {
+                    if (stat.init) {
+                        prev.definitions = prev.definitions.concat(stat.init.definitions);
+                    }
+                    stat.init = prev;
+                    statements[j] = stat;
+                    CHANGED = true;
+                } else if (defs && stat.init && defs.TYPE == stat.init.TYPE && declarations_only(stat.init)) {
+                    defs.definitions = defs.definitions.concat(stat.init.definitions);
+                    stat.init = null;
+                    statements[++j] = stat;
+                    CHANGED = true;
+                } else {
+                    statements[++j] = stat;
+                }
+            } else if (stat instanceof AST_ForIn) {
+                stat.object = extract_object_assignments(stat.object);
+            } else if (stat instanceof AST_If) {
+                stat.condition = extract_object_assignments(stat.condition);
+            } else if (stat instanceof AST_SimpleStatement) {
+                var exprs = join_object_assignments(prev, stat.body);
+                if (exprs) {
+                    CHANGED = true;
+                    if (!exprs.length)
+                        continue;
+                    stat.body = make_sequence(stat.body, exprs);
+                }
+                statements[++j] = stat;
+            } else if (stat instanceof AST_Switch) {
+                stat.expression = extract_object_assignments(stat.expression);
+            } else if (stat instanceof AST_With) {
+                stat.expression = extract_object_assignments(stat.expression);
+            } else {
+                statements[++j] = stat;
+            }
+        }
+        statements.length = j + 1;
+
+        function extract_object_assignments(value) {
+            statements[++j] = stat;
+            var exprs = join_object_assignments(prev, value);
+            if (exprs) {
+                CHANGED = true;
+                if (exprs.length) {
+                    return make_sequence(value, exprs);
+                } else if (value instanceof AST_Sequence) {
+                    return value.tail_node().left;
+                } else {
+                    return value.left;
+                }
+            }
+            return value;
+        }
+    }
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/equivalent-to.js b/node_modules/mathjs/examples/node_modules/terser/lib/equivalent-to.js
new file mode 100644
index 0000000..0597621
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/equivalent-to.js
@@ -0,0 +1,313 @@
+import {
+    AST_Array,
+    AST_Atom,
+    AST_Await,
+    AST_BigInt,
+    AST_Binary,
+    AST_Block,
+    AST_Call,
+    AST_Catch,
+    AST_Chain,
+    AST_Class,
+    AST_ClassProperty,
+    AST_ConciseMethod,
+    AST_Conditional,
+    AST_Debugger,
+    AST_Definitions,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Do,
+    AST_Dot,
+    AST_DotHash,
+    AST_EmptyStatement,
+    AST_Expansion,
+    AST_Export,
+    AST_Finally,
+    AST_For,
+    AST_ForIn,
+    AST_ForOf,
+    AST_If,
+    AST_Import,
+    AST_ImportMeta,
+    AST_Jump,
+    AST_LabeledStatement,
+    AST_Lambda,
+    AST_LoopControl,
+    AST_NameMapping,
+    AST_NewTarget,
+    AST_Node,
+    AST_Number,
+    AST_Object,
+    AST_ObjectGetter,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_ObjectSetter,
+    AST_PrefixedTemplateString,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_String,
+    AST_Super,
+    AST_Switch,
+    AST_SwitchBranch,
+    AST_Symbol,
+    AST_TemplateSegment,
+    AST_TemplateString,
+    AST_This,
+    AST_Toplevel,
+    AST_Try,
+    AST_Unary,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield
+} from "./ast.js";
+
+const shallow_cmp = (node1, node2) => {
+    return (
+        node1 === null && node2 === null
+        || node1.TYPE === node2.TYPE && node1.shallow_cmp(node2)
+    );
+};
+
+export const equivalent_to = (tree1, tree2) => {
+    if (!shallow_cmp(tree1, tree2)) return false;
+    const walk_1_state = [tree1];
+    const walk_2_state = [tree2];
+
+    const walk_1_push = walk_1_state.push.bind(walk_1_state);
+    const walk_2_push = walk_2_state.push.bind(walk_2_state);
+
+    while (walk_1_state.length && walk_2_state.length) {
+        const node_1 = walk_1_state.pop();
+        const node_2 = walk_2_state.pop();
+
+        if (!shallow_cmp(node_1, node_2)) return false;
+
+        node_1._children_backwards(walk_1_push);
+        node_2._children_backwards(walk_2_push);
+
+        if (walk_1_state.length !== walk_2_state.length) {
+            // Different number of children
+            return false;
+        }
+    }
+
+    return walk_1_state.length == 0 && walk_2_state.length == 0;
+};
+
+// Creates a shallow compare function
+const mkshallow = (props) => {
+    const comparisons = Object
+        .keys(props)
+        .map(key => {
+            if (props[key] === "eq") {
+                return `this.${key} === other.${key}`;
+            } else if (props[key] === "exist") {
+                return `(this.${key} == null ? other.${key} == null : this.${key} === other.${key})`;
+            } else {
+                throw new Error(`mkshallow: Unexpected instruction: ${props[key]}`);
+            }
+        })
+        .join(" && ");
+
+    return new Function("other", "return " + comparisons);
+};
+
+const pass_through = () => true;
+
+AST_Node.prototype.shallow_cmp = function () {
+    throw new Error("did not find a shallow_cmp function for " + this.constructor.name);
+};
+
+AST_Debugger.prototype.shallow_cmp = pass_through;
+
+AST_Directive.prototype.shallow_cmp = mkshallow({ value: "eq" });
+
+AST_SimpleStatement.prototype.shallow_cmp = pass_through;
+
+AST_Block.prototype.shallow_cmp = pass_through;
+
+AST_EmptyStatement.prototype.shallow_cmp = pass_through;
+
+AST_LabeledStatement.prototype.shallow_cmp = mkshallow({ "label.name": "eq" });
+
+AST_Do.prototype.shallow_cmp = pass_through;
+
+AST_While.prototype.shallow_cmp = pass_through;
+
+AST_For.prototype.shallow_cmp = mkshallow({
+    init: "exist",
+    condition: "exist",
+    step: "exist"
+});
+
+AST_ForIn.prototype.shallow_cmp = pass_through;
+
+AST_ForOf.prototype.shallow_cmp = pass_through;
+
+AST_With.prototype.shallow_cmp = pass_through;
+
+AST_Toplevel.prototype.shallow_cmp = pass_through;
+
+AST_Expansion.prototype.shallow_cmp = pass_through;
+
+AST_Lambda.prototype.shallow_cmp = mkshallow({
+    is_generator: "eq",
+    async: "eq"
+});
+
+AST_Destructuring.prototype.shallow_cmp = mkshallow({
+    is_array: "eq"
+});
+
+AST_PrefixedTemplateString.prototype.shallow_cmp = pass_through;
+
+AST_TemplateString.prototype.shallow_cmp = pass_through;
+
+AST_TemplateSegment.prototype.shallow_cmp = mkshallow({
+    "value": "eq"
+});
+
+AST_Jump.prototype.shallow_cmp = pass_through;
+
+AST_LoopControl.prototype.shallow_cmp = pass_through;
+
+AST_Await.prototype.shallow_cmp = pass_through;
+
+AST_Yield.prototype.shallow_cmp = mkshallow({
+    is_star: "eq"
+});
+
+AST_If.prototype.shallow_cmp = mkshallow({
+    alternative: "exist"
+});
+
+AST_Switch.prototype.shallow_cmp = pass_through;
+
+AST_SwitchBranch.prototype.shallow_cmp = pass_through;
+
+AST_Try.prototype.shallow_cmp = mkshallow({
+    bcatch: "exist",
+    bfinally: "exist"
+});
+
+AST_Catch.prototype.shallow_cmp = mkshallow({
+    argname: "exist"
+});
+
+AST_Finally.prototype.shallow_cmp = pass_through;
+
+AST_Definitions.prototype.shallow_cmp = pass_through;
+
+AST_VarDef.prototype.shallow_cmp = mkshallow({
+    value: "exist"
+});
+
+AST_NameMapping.prototype.shallow_cmp = pass_through;
+
+AST_Import.prototype.shallow_cmp = mkshallow({
+    imported_name: "exist",
+    imported_names: "exist"
+});
+
+AST_ImportMeta.prototype.shallow_cmp = pass_through;
+
+AST_Export.prototype.shallow_cmp = mkshallow({
+    exported_definition: "exist",
+    exported_value: "exist",
+    exported_names: "exist",
+    module_name: "eq",
+    is_default: "eq",
+});
+
+AST_Call.prototype.shallow_cmp = pass_through;
+
+AST_Sequence.prototype.shallow_cmp = pass_through;
+
+AST_PropAccess.prototype.shallow_cmp = pass_through;
+
+AST_Chain.prototype.shallow_cmp = pass_through;
+
+AST_Dot.prototype.shallow_cmp = mkshallow({
+    property: "eq"
+});
+
+AST_DotHash.prototype.shallow_cmp = mkshallow({
+    property: "eq"
+});
+
+AST_Unary.prototype.shallow_cmp = mkshallow({
+    operator: "eq"
+});
+
+AST_Binary.prototype.shallow_cmp = mkshallow({
+    operator: "eq"
+});
+
+AST_Conditional.prototype.shallow_cmp = pass_through;
+
+AST_Array.prototype.shallow_cmp = pass_through;
+
+AST_Object.prototype.shallow_cmp = pass_through;
+
+AST_ObjectProperty.prototype.shallow_cmp = pass_through;
+
+AST_ObjectKeyVal.prototype.shallow_cmp = mkshallow({
+    key: "eq"
+});
+
+AST_ObjectSetter.prototype.shallow_cmp = mkshallow({
+    static: "eq"
+});
+
+AST_ObjectGetter.prototype.shallow_cmp = mkshallow({
+    static: "eq"
+});
+
+AST_ConciseMethod.prototype.shallow_cmp = mkshallow({
+    static: "eq",
+    is_generator: "eq",
+    async: "eq",
+});
+
+AST_Class.prototype.shallow_cmp = mkshallow({
+    name: "exist",
+    extends: "exist",
+});
+
+AST_ClassProperty.prototype.shallow_cmp = mkshallow({
+    static: "eq"
+});
+
+AST_Symbol.prototype.shallow_cmp = mkshallow({
+    name: "eq"
+});
+
+AST_NewTarget.prototype.shallow_cmp = pass_through;
+
+AST_This.prototype.shallow_cmp = pass_through;
+
+AST_Super.prototype.shallow_cmp = pass_through;
+
+AST_String.prototype.shallow_cmp = mkshallow({
+    value: "eq"
+});
+
+AST_Number.prototype.shallow_cmp = mkshallow({
+    value: "eq"
+});
+
+AST_BigInt.prototype.shallow_cmp = mkshallow({
+    value: "eq"
+});
+
+AST_RegExp.prototype.shallow_cmp = function (other) {
+    return (
+        this.value.flags === other.value.flags
+        && this.value.source === other.value.source
+    );
+};
+
+AST_Atom.prototype.shallow_cmp = pass_through;
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/minify.js b/node_modules/mathjs/examples/node_modules/terser/lib/minify.js
new file mode 100644
index 0000000..82d9ca3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/minify.js
@@ -0,0 +1,335 @@
+"use strict";
+/* eslint-env browser, es6, node */
+
+import {
+    defaults,
+    map_from_object,
+    map_to_object,
+    HOP,
+} from "./utils/index.js";
+import { AST_Toplevel, AST_Node } from "./ast.js";
+import { parse } from "./parse.js";
+import { OutputStream } from "./output.js";
+import { Compressor } from "./compress/index.js";
+import { base54 } from "./scope.js";
+import { SourceMap } from "./sourcemap.js";
+import {
+    mangle_properties,
+    mangle_private_properties,
+    reserve_quoted_keys,
+} from "./propmangle.js";
+
+var to_ascii = typeof atob == "undefined" ? function(b64) {
+    return Buffer.from(b64, "base64").toString();
+} : atob;
+var to_base64 = typeof btoa == "undefined" ? function(str) {
+    return Buffer.from(str).toString("base64");
+} : btoa;
+
+function read_source_map(code) {
+    var match = /(?:^|[^.])\/\/# sourceMappingURL=data:application\/json(;[\w=-]*)?;base64,([+/0-9A-Za-z]*=*)\s*$/.exec(code);
+    if (!match) {
+        console.warn("inline source map not found");
+        return null;
+    }
+    return to_ascii(match[2]);
+}
+
+function set_shorthand(name, options, keys) {
+    if (options[name]) {
+        keys.forEach(function(key) {
+            if (options[key]) {
+                if (typeof options[key] != "object") options[key] = {};
+                if (!(name in options[key])) options[key][name] = options[name];
+            }
+        });
+    }
+}
+
+function init_cache(cache) {
+    if (!cache) return;
+    if (!("props" in cache)) {
+        cache.props = new Map();
+    } else if (!(cache.props instanceof Map)) {
+        cache.props = map_from_object(cache.props);
+    }
+}
+
+function cache_to_json(cache) {
+    return {
+        props: map_to_object(cache.props)
+    };
+}
+
+function log_input(files, options, fs, debug_folder) {
+    if (!(fs && fs.writeFileSync && fs.mkdirSync)) {
+        return;
+    }
+
+    try {
+        fs.mkdirSync(debug_folder);
+    } catch (e) {
+        if (e.code !== "EEXIST") throw e;
+    }
+
+    const log_path = `${debug_folder}/terser-debug-${(Math.random() * 9999999) | 0}.log`;
+
+    options = options || {};
+
+    const options_str = JSON.stringify(options, (_key, thing) => {
+        if (typeof thing === "function") return "[Function " + thing.toString() + "]";
+        if (thing instanceof RegExp) return "[RegExp " + thing.toString() + "]";
+        return thing;
+    }, 4);
+
+    const files_str = (file) => {
+        if (typeof file === "object" && options.parse && options.parse.spidermonkey) {
+            return JSON.stringify(file, null, 2);
+        } else if (typeof file === "object") {
+            return Object.keys(file)
+                .map((key) => key + ": " + files_str(file[key]))
+                .join("\n\n");
+        } else if (typeof file === "string") {
+            return "```\n" + file + "\n```";
+        } else {
+            return file; // What do?
+        }
+    };
+
+    fs.writeFileSync(log_path, "Options: \n" + options_str + "\n\nInput files:\n\n" + files_str(files) + "\n");
+}
+
+async function minify(files, options, _fs_module) {
+    if (
+        _fs_module
+        && typeof process === "object"
+        && process.env
+        && typeof process.env.TERSER_DEBUG_DIR === "string"
+    ) {
+        log_input(files, options, _fs_module, process.env.TERSER_DEBUG_DIR);
+    }
+
+    options = defaults(options, {
+        compress: {},
+        ecma: undefined,
+        enclose: false,
+        ie8: false,
+        keep_classnames: undefined,
+        keep_fnames: false,
+        mangle: {},
+        module: false,
+        nameCache: null,
+        output: null,
+        format: null,
+        parse: {},
+        rename: undefined,
+        safari10: false,
+        sourceMap: false,
+        spidermonkey: false,
+        timings: false,
+        toplevel: false,
+        warnings: false,
+        wrap: false,
+    }, true);
+
+    var timings = options.timings && {
+        start: Date.now()
+    };
+    if (options.keep_classnames === undefined) {
+        options.keep_classnames = options.keep_fnames;
+    }
+    if (options.rename === undefined) {
+        options.rename = options.compress && options.mangle;
+    }
+    if (options.output && options.format) {
+        throw new Error("Please only specify either output or format option, preferrably format.");
+    }
+    options.format = options.format || options.output || {};
+    set_shorthand("ecma", options, [ "parse", "compress", "format" ]);
+    set_shorthand("ie8", options, [ "compress", "mangle", "format" ]);
+    set_shorthand("keep_classnames", options, [ "compress", "mangle" ]);
+    set_shorthand("keep_fnames", options, [ "compress", "mangle" ]);
+    set_shorthand("module", options, [ "parse", "compress", "mangle" ]);
+    set_shorthand("safari10", options, [ "mangle", "format" ]);
+    set_shorthand("toplevel", options, [ "compress", "mangle" ]);
+    set_shorthand("warnings", options, [ "compress" ]); // legacy
+    var quoted_props;
+    if (options.mangle) {
+        options.mangle = defaults(options.mangle, {
+            cache: options.nameCache && (options.nameCache.vars || {}),
+            eval: false,
+            ie8: false,
+            keep_classnames: false,
+            keep_fnames: false,
+            module: false,
+            nth_identifier: base54,
+            properties: false,
+            reserved: [],
+            safari10: false,
+            toplevel: false,
+        }, true);
+        if (options.mangle.properties) {
+            if (typeof options.mangle.properties != "object") {
+                options.mangle.properties = {};
+            }
+            if (options.mangle.properties.keep_quoted) {
+                quoted_props = options.mangle.properties.reserved;
+                if (!Array.isArray(quoted_props)) quoted_props = [];
+                options.mangle.properties.reserved = quoted_props;
+            }
+            if (options.nameCache && !("cache" in options.mangle.properties)) {
+                options.mangle.properties.cache = options.nameCache.props || {};
+            }
+        }
+        init_cache(options.mangle.cache);
+        init_cache(options.mangle.properties.cache);
+    }
+    if (options.sourceMap) {
+        options.sourceMap = defaults(options.sourceMap, {
+            asObject: false,
+            content: null,
+            filename: null,
+            includeSources: false,
+            root: null,
+            url: null,
+        }, true);
+    }
+    if (timings) timings.parse = Date.now();
+    var toplevel;
+    if (files instanceof AST_Toplevel) {
+        toplevel = files;
+    } else {
+        if (typeof files == "string" || (options.parse.spidermonkey && !Array.isArray(files))) {
+            files = [ files ];
+        }
+        options.parse = options.parse || {};
+        options.parse.toplevel = null;
+
+        if (options.parse.spidermonkey) {
+            options.parse.toplevel = AST_Node.from_mozilla_ast(Object.keys(files).reduce(function(toplevel, name) {
+                if (!toplevel) return files[name];
+                toplevel.body = toplevel.body.concat(files[name].body);
+                return toplevel;
+            }, null));
+        } else {
+            delete options.parse.spidermonkey;
+
+            for (var name in files) if (HOP(files, name)) {
+                options.parse.filename = name;
+                options.parse.toplevel = parse(files[name], options.parse);
+                if (options.sourceMap && options.sourceMap.content == "inline") {
+                    if (Object.keys(files).length > 1)
+                        throw new Error("inline source map only works with singular input");
+                    options.sourceMap.content = read_source_map(files[name]);
+                }
+            }
+        }
+
+        toplevel = options.parse.toplevel;
+    }
+    if (quoted_props && options.mangle.properties.keep_quoted !== "strict") {
+        reserve_quoted_keys(toplevel, quoted_props);
+    }
+    if (options.wrap) {
+        toplevel = toplevel.wrap_commonjs(options.wrap);
+    }
+    if (options.enclose) {
+        toplevel = toplevel.wrap_enclose(options.enclose);
+    }
+    if (timings) timings.rename = Date.now();
+    // disable rename on harmony due to expand_names bug in for-of loops
+    // https://github.com/mishoo/UglifyJS2/issues/2794
+    if (0 && options.rename) {
+        toplevel.figure_out_scope(options.mangle);
+        toplevel.expand_names(options.mangle);
+    }
+    if (timings) timings.compress = Date.now();
+    if (options.compress) {
+        toplevel = new Compressor(options.compress, {
+            mangle_options: options.mangle
+        }).compress(toplevel);
+    }
+    if (timings) timings.scope = Date.now();
+    if (options.mangle) toplevel.figure_out_scope(options.mangle);
+    if (timings) timings.mangle = Date.now();
+    if (options.mangle) {
+        toplevel.compute_char_frequency(options.mangle);
+        toplevel.mangle_names(options.mangle);
+        toplevel = mangle_private_properties(toplevel, options.mangle);
+    }
+    if (timings) timings.properties = Date.now();
+    if (options.mangle && options.mangle.properties) {
+        toplevel = mangle_properties(toplevel, options.mangle.properties);
+    }
+    if (timings) timings.format = Date.now();
+    var result = {};
+    if (options.format.ast) {
+        result.ast = toplevel;
+    }
+    if (options.format.spidermonkey) {
+        result.ast = toplevel.to_mozilla_ast();
+    }
+    if (!HOP(options.format, "code") || options.format.code) {
+        if (options.sourceMap) {
+            options.format.source_map = await SourceMap({
+                file: options.sourceMap.filename,
+                orig: options.sourceMap.content,
+                root: options.sourceMap.root
+            });
+            if (options.sourceMap.includeSources) {
+                if (files instanceof AST_Toplevel) {
+                    throw new Error("original source content unavailable");
+                } else for (var name in files) if (HOP(files, name)) {
+                    options.format.source_map.get().setSourceContent(name, files[name]);
+                }
+            }
+        }
+        delete options.format.ast;
+        delete options.format.code;
+        delete options.format.spidermonkey;
+        var stream = OutputStream(options.format);
+        toplevel.print(stream);
+        result.code = stream.get();
+        if (options.sourceMap) {
+            if(options.sourceMap.asObject) {
+                result.map = options.format.source_map.get().toJSON();
+            } else {
+                result.map = options.format.source_map.toString();
+            }
+            if (options.sourceMap.url == "inline") {
+                var sourceMap = typeof result.map === "object" ? JSON.stringify(result.map) : result.map;
+                result.code += "\n//# sourceMappingURL=data:application/json;charset=utf-8;base64," + to_base64(sourceMap);
+            } else if (options.sourceMap.url) {
+                result.code += "\n//# sourceMappingURL=" + options.sourceMap.url;
+            }
+        }
+    }
+    if (options.nameCache && options.mangle) {
+        if (options.mangle.cache) options.nameCache.vars = cache_to_json(options.mangle.cache);
+        if (options.mangle.properties && options.mangle.properties.cache) {
+            options.nameCache.props = cache_to_json(options.mangle.properties.cache);
+        }
+    }
+    if (options.format && options.format.source_map) {
+        options.format.source_map.destroy();
+    }
+    if (timings) {
+        timings.end = Date.now();
+        result.timings = {
+            parse: 1e-3 * (timings.rename - timings.parse),
+            rename: 1e-3 * (timings.compress - timings.rename),
+            compress: 1e-3 * (timings.scope - timings.compress),
+            scope: 1e-3 * (timings.mangle - timings.scope),
+            mangle: 1e-3 * (timings.properties - timings.mangle),
+            properties: 1e-3 * (timings.format - timings.properties),
+            format: 1e-3 * (timings.end - timings.format),
+            total: 1e-3 * (timings.end - timings.start)
+        };
+    }
+    return result;
+}
+
+export {
+  minify,
+  to_ascii,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/mozilla-ast.js b/node_modules/mathjs/examples/node_modules/terser/lib/mozilla-ast.js
new file mode 100644
index 0000000..b790e55
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/mozilla-ast.js
@@ -0,0 +1,1376 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+import * as ast from "./ast.js";
+import { make_node } from "./utils/index.js";
+import {
+    AST_Accessor,
+    AST_Array,
+    AST_Arrow,
+    AST_Assign,
+    AST_Atom,
+    AST_Await,
+    AST_BigInt,
+    AST_Binary,
+    AST_Block,
+    AST_BlockStatement,
+    AST_Boolean,
+    AST_Break,
+    AST_Call,
+    AST_Case,
+    AST_Catch,
+    AST_Chain,
+    AST_Class,
+    AST_ClassExpression,
+    AST_ClassProperty,
+    AST_ClassPrivateProperty,
+    AST_ConciseMethod,
+    AST_Conditional,
+    AST_Const,
+    AST_Constant,
+    AST_Continue,
+    AST_Debugger,
+    AST_Default,
+    AST_DefaultAssign,
+    AST_DefClass,
+    AST_Definitions,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Do,
+    AST_Dot,
+    AST_DotHash,
+    AST_EmptyStatement,
+    AST_Expansion,
+    AST_Export,
+    AST_False,
+    AST_Finally,
+    AST_For,
+    AST_ForIn,
+    AST_ForOf,
+    AST_Function,
+    AST_Hole,
+    AST_If,
+    AST_Import,
+    AST_ImportMeta,
+    AST_Label,
+    AST_LabeledStatement,
+    AST_LabelRef,
+    AST_Lambda,
+    AST_Let,
+    AST_NameMapping,
+    AST_New,
+    AST_NewTarget,
+    AST_Node,
+    AST_Null,
+    AST_Number,
+    AST_Object,
+    AST_ObjectGetter,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_ObjectSetter,
+    AST_PrefixedTemplateString,
+    AST_PrivateGetter,
+    AST_PrivateMethod,
+    AST_PrivateSetter,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Return,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Statement,
+    AST_String,
+    AST_Sub,
+    AST_Super,
+    AST_Switch,
+    AST_SwitchBranch,
+    AST_Symbol,
+    AST_SymbolCatch,
+    AST_SymbolClass,
+    AST_SymbolClassProperty,
+    AST_SymbolConst,
+    AST_SymbolDefClass,
+    AST_SymbolDefun,
+    AST_SymbolExport,
+    AST_SymbolExportForeign,
+    AST_SymbolFunarg,
+    AST_SymbolImport,
+    AST_SymbolImportForeign,
+    AST_SymbolLambda,
+    AST_SymbolLet,
+    AST_SymbolMethod,
+    AST_SymbolRef,
+    AST_SymbolVar,
+    AST_TemplateSegment,
+    AST_TemplateString,
+    AST_This,
+    AST_Throw,
+    AST_Token,
+    AST_Toplevel,
+    AST_True,
+    AST_Try,
+    AST_Unary,
+    AST_UnaryPostfix,
+    AST_UnaryPrefix,
+    AST_Var,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield,
+} from "./ast.js";
+import { is_basic_identifier_string } from "./parse.js";
+
+(function() {
+
+    var normalize_directives = function(body) {
+        var in_directive = true;
+
+        for (var i = 0; i < body.length; i++) {
+            if (in_directive && body[i] instanceof AST_Statement && body[i].body instanceof AST_String) {
+                body[i] = new AST_Directive({
+                    start: body[i].start,
+                    end: body[i].end,
+                    value: body[i].body.value
+                });
+            } else if (in_directive && !(body[i] instanceof AST_Statement && body[i].body instanceof AST_String)) {
+                in_directive = false;
+            }
+        }
+
+        return body;
+    };
+
+    const assert_clause_from_moz = (assertions) => {
+        if (assertions && assertions.length > 0) {
+            return new AST_Object({
+                start: my_start_token(assertions),
+                end: my_end_token(assertions),
+                properties: assertions.map((assertion_kv) =>
+                    new AST_ObjectKeyVal({
+                        start: my_start_token(assertion_kv),
+                        end: my_end_token(assertion_kv),
+                        key: assertion_kv.key.name || assertion_kv.key.value,
+                        value: from_moz(assertion_kv.value)
+                    })
+                )
+            });
+        }
+        return null;
+    };
+
+    var MOZ_TO_ME = {
+        Program: function(M) {
+            return new AST_Toplevel({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                body: normalize_directives(M.body.map(from_moz))
+            });
+        },
+        ArrayPattern: function(M) {
+            return new AST_Destructuring({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                names: M.elements.map(function(elm) {
+                    if (elm === null) {
+                        return new AST_Hole();
+                    }
+                    return from_moz(elm);
+                }),
+                is_array: true
+            });
+        },
+        ObjectPattern: function(M) {
+            return new AST_Destructuring({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                names: M.properties.map(from_moz),
+                is_array: false
+            });
+        },
+        AssignmentPattern: function(M) {
+            return new AST_DefaultAssign({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                left: from_moz(M.left),
+                operator: "=",
+                right: from_moz(M.right)
+            });
+        },
+        SpreadElement: function(M) {
+            return new AST_Expansion({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                expression: from_moz(M.argument)
+            });
+        },
+        RestElement: function(M) {
+            return new AST_Expansion({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                expression: from_moz(M.argument)
+            });
+        },
+        TemplateElement: function(M) {
+            return new AST_TemplateSegment({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                value: M.value.cooked,
+                raw: M.value.raw
+            });
+        },
+        TemplateLiteral: function(M) {
+            var segments = [];
+            for (var i = 0; i < M.quasis.length; i++) {
+                segments.push(from_moz(M.quasis[i]));
+                if (M.expressions[i]) {
+                    segments.push(from_moz(M.expressions[i]));
+                }
+            }
+            return new AST_TemplateString({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                segments: segments
+            });
+        },
+        TaggedTemplateExpression: function(M) {
+            return new AST_PrefixedTemplateString({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                template_string: from_moz(M.quasi),
+                prefix: from_moz(M.tag)
+            });
+        },
+        FunctionDeclaration: function(M) {
+            return new AST_Defun({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                name: from_moz(M.id),
+                argnames: M.params.map(from_moz),
+                is_generator: M.generator,
+                async: M.async,
+                body: normalize_directives(from_moz(M.body).body)
+            });
+        },
+        FunctionExpression: function(M) {
+            return new AST_Function({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                name: from_moz(M.id),
+                argnames: M.params.map(from_moz),
+                is_generator: M.generator,
+                async: M.async,
+                body: normalize_directives(from_moz(M.body).body)
+            });
+        },
+        ArrowFunctionExpression: function(M) {
+            const body = M.body.type === "BlockStatement"
+                ? from_moz(M.body).body
+                : [make_node(AST_Return, {}, { value: from_moz(M.body) })];
+            return new AST_Arrow({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                argnames: M.params.map(from_moz),
+                body,
+                async: M.async,
+            });
+        },
+        ExpressionStatement: function(M) {
+            return new AST_SimpleStatement({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                body: from_moz(M.expression)
+            });
+        },
+        TryStatement: function(M) {
+            var handlers = M.handlers || [M.handler];
+            if (handlers.length > 1 || M.guardedHandlers && M.guardedHandlers.length) {
+                throw new Error("Multiple catch clauses are not supported.");
+            }
+            return new AST_Try({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                body     : from_moz(M.block).body,
+                bcatch   : from_moz(handlers[0]),
+                bfinally : M.finalizer ? new AST_Finally(from_moz(M.finalizer)) : null
+            });
+        },
+        Property: function(M) {
+            var key = M.key;
+            var args = {
+                start    : my_start_token(key || M.value),
+                end      : my_end_token(M.value),
+                key      : key.type == "Identifier" ? key.name : key.value,
+                value    : from_moz(M.value)
+            };
+            if (M.computed) {
+                args.key = from_moz(M.key);
+            }
+            if (M.method) {
+                args.is_generator = M.value.generator;
+                args.async = M.value.async;
+                if (!M.computed) {
+                    args.key = new AST_SymbolMethod({ name: args.key });
+                } else {
+                    args.key = from_moz(M.key);
+                }
+                return new AST_ConciseMethod(args);
+            }
+            if (M.kind == "init") {
+                if (key.type != "Identifier" && key.type != "Literal") {
+                    args.key = from_moz(key);
+                }
+                return new AST_ObjectKeyVal(args);
+            }
+            if (typeof args.key === "string" || typeof args.key === "number") {
+                args.key = new AST_SymbolMethod({
+                    name: args.key
+                });
+            }
+            args.value = new AST_Accessor(args.value);
+            if (M.kind == "get") return new AST_ObjectGetter(args);
+            if (M.kind == "set") return new AST_ObjectSetter(args);
+            if (M.kind == "method") {
+                args.async = M.value.async;
+                args.is_generator = M.value.generator;
+                args.quote = M.computed ? "\"" : null;
+                return new AST_ConciseMethod(args);
+            }
+        },
+        MethodDefinition: function(M) {
+            var args = {
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                key      : M.computed ? from_moz(M.key) : new AST_SymbolMethod({ name: M.key.name || M.key.value }),
+                value    : from_moz(M.value),
+                static   : M.static,
+            };
+            if (M.kind == "get") {
+                return new AST_ObjectGetter(args);
+            }
+            if (M.kind == "set") {
+                return new AST_ObjectSetter(args);
+            }
+            args.is_generator = M.value.generator;
+            args.async = M.value.async;
+            return new AST_ConciseMethod(args);
+        },
+        FieldDefinition: function(M) {
+            let key;
+            if (M.computed) {
+                key = from_moz(M.key);
+            } else {
+                if (M.key.type !== "Identifier") throw new Error("Non-Identifier key in FieldDefinition");
+                key = from_moz(M.key);
+            }
+            return new AST_ClassProperty({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                key,
+                value    : from_moz(M.value),
+                static   : M.static,
+            });
+        },
+        PropertyDefinition: function(M) {
+            let key;
+            if (M.computed) {
+                key = from_moz(M.key);
+            } else {
+                if (M.key.type !== "Identifier") throw new Error("Non-Identifier key in PropertyDefinition");
+                key = from_moz(M.key);
+            }
+
+            return new AST_ClassProperty({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                key,
+                value    : from_moz(M.value),
+                static   : M.static,
+            });
+        },
+        ArrayExpression: function(M) {
+            return new AST_Array({
+                start    : my_start_token(M),
+                end      : my_end_token(M),
+                elements : M.elements.map(function(elem) {
+                    return elem === null ? new AST_Hole() : from_moz(elem);
+                })
+            });
+        },
+        ObjectExpression: function(M) {
+            return new AST_Object({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                properties : M.properties.map(function(prop) {
+                    if (prop.type === "SpreadElement") {
+                        return from_moz(prop);
+                    }
+                    prop.type = "Property";
+                    return from_moz(prop);
+                })
+            });
+        },
+        SequenceExpression: function(M) {
+            return new AST_Sequence({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                expressions: M.expressions.map(from_moz)
+            });
+        },
+        MemberExpression: function(M) {
+            return new (M.computed ? AST_Sub : AST_Dot)({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                property   : M.computed ? from_moz(M.property) : M.property.name,
+                expression : from_moz(M.object),
+                optional   : M.optional || false
+            });
+        },
+        ChainExpression: function(M) {
+            return new AST_Chain({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                expression : from_moz(M.expression)
+            });
+        },
+        SwitchCase: function(M) {
+            return new (M.test ? AST_Case : AST_Default)({
+                start      : my_start_token(M),
+                end        : my_end_token(M),
+                expression : from_moz(M.test),
+                body       : M.consequent.map(from_moz)
+            });
+        },
+        VariableDeclaration: function(M) {
+            return new (M.kind === "const" ? AST_Const :
+                        M.kind === "let" ? AST_Let : AST_Var)({
+                start       : my_start_token(M),
+                end         : my_end_token(M),
+                definitions : M.declarations.map(from_moz)
+            });
+        },
+
+        ImportDeclaration: function(M) {
+            var imported_name = null;
+            var imported_names = null;
+            M.specifiers.forEach(function (specifier) {
+                if (specifier.type === "ImportSpecifier") {
+                    if (!imported_names) { imported_names = []; }
+                    imported_names.push(new AST_NameMapping({
+                        start: my_start_token(specifier),
+                        end: my_end_token(specifier),
+                        foreign_name: from_moz(specifier.imported),
+                        name: from_moz(specifier.local)
+                    }));
+                } else if (specifier.type === "ImportDefaultSpecifier") {
+                    imported_name = from_moz(specifier.local);
+                } else if (specifier.type === "ImportNamespaceSpecifier") {
+                    if (!imported_names) { imported_names = []; }
+                    imported_names.push(new AST_NameMapping({
+                        start: my_start_token(specifier),
+                        end: my_end_token(specifier),
+                        foreign_name: new AST_SymbolImportForeign({ name: "*" }),
+                        name: from_moz(specifier.local)
+                    }));
+                }
+            });
+            return new AST_Import({
+                start       : my_start_token(M),
+                end         : my_end_token(M),
+                imported_name: imported_name,
+                imported_names : imported_names,
+                module_name : from_moz(M.source),
+                assert_clause: assert_clause_from_moz(M.assertions)
+            });
+        },
+        ExportAllDeclaration: function(M) {
+            return new AST_Export({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                exported_names: [
+                    new AST_NameMapping({
+                        name: new AST_SymbolExportForeign({ name: "*" }),
+                        foreign_name: new AST_SymbolExportForeign({ name: "*" })
+                    })
+                ],
+                module_name: from_moz(M.source),
+                assert_clause: assert_clause_from_moz(M.assertions)
+            });
+        },
+        ExportNamedDeclaration: function(M) {
+            return new AST_Export({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                exported_definition: from_moz(M.declaration),
+                exported_names: M.specifiers && M.specifiers.length ? M.specifiers.map(function (specifier) {
+                    return new AST_NameMapping({
+                        foreign_name: from_moz(specifier.exported),
+                        name: from_moz(specifier.local)
+                    });
+                }) : null,
+                module_name: from_moz(M.source),
+                assert_clause: assert_clause_from_moz(M.assertions)
+            });
+        },
+        ExportDefaultDeclaration: function(M) {
+            return new AST_Export({
+                start: my_start_token(M),
+                end: my_end_token(M),
+                exported_value: from_moz(M.declaration),
+                is_default: true
+            });
+        },
+        Literal: function(M) {
+            var val = M.value, args = {
+                start  : my_start_token(M),
+                end    : my_end_token(M)
+            };
+            var rx = M.regex;
+            if (rx && rx.pattern) {
+                // RegExpLiteral as per ESTree AST spec
+                args.value = {
+                    source: rx.pattern,
+                    flags: rx.flags
+                };
+                return new AST_RegExp(args);
+            } else if (rx) {
+                // support legacy RegExp
+                const rx_source = M.raw || val;
+                const match = rx_source.match(/^\/(.*)\/(\w*)$/);
+                if (!match) throw new Error("Invalid regex source " + rx_source);
+                const [_, source, flags] = match;
+                args.value = { source, flags };
+                return new AST_RegExp(args);
+            }
+            if (val === null) return new AST_Null(args);
+            switch (typeof val) {
+              case "string":
+                args.value = val;
+                return new AST_String(args);
+              case "number":
+                args.value = val;
+                args.raw = M.raw || val.toString();
+                return new AST_Number(args);
+              case "boolean":
+                return new (val ? AST_True : AST_False)(args);
+            }
+        },
+        MetaProperty: function(M) {
+            if (M.meta.name === "new" && M.property.name === "target") {
+                return new AST_NewTarget({
+                    start: my_start_token(M),
+                    end: my_end_token(M)
+                });
+            } else if (M.meta.name === "import" && M.property.name === "meta") {
+                return new AST_ImportMeta({
+                    start: my_start_token(M),
+                    end: my_end_token(M)
+                });
+            }
+        },
+        Identifier: function(M) {
+            var p = FROM_MOZ_STACK[FROM_MOZ_STACK.length - 2];
+            return new (  p.type == "LabeledStatement" ? AST_Label
+                        : p.type == "VariableDeclarator" && p.id === M ? (p.kind == "const" ? AST_SymbolConst : p.kind == "let" ? AST_SymbolLet : AST_SymbolVar)
+                        : /Import.*Specifier/.test(p.type) ? (p.local === M ? AST_SymbolImport : AST_SymbolImportForeign)
+                        : p.type == "ExportSpecifier" ? (p.local === M ? AST_SymbolExport : AST_SymbolExportForeign)
+                        : p.type == "FunctionExpression" ? (p.id === M ? AST_SymbolLambda : AST_SymbolFunarg)
+                        : p.type == "FunctionDeclaration" ? (p.id === M ? AST_SymbolDefun : AST_SymbolFunarg)
+                        : p.type == "ArrowFunctionExpression" ? (p.params.includes(M)) ? AST_SymbolFunarg : AST_SymbolRef
+                        : p.type == "ClassExpression" ? (p.id === M ? AST_SymbolClass : AST_SymbolRef)
+                        : p.type == "Property" ? (p.key === M && p.computed || p.value === M ? AST_SymbolRef : AST_SymbolMethod)
+                        : p.type == "PropertyDefinition" || p.type === "FieldDefinition" ? (p.key === M && p.computed || p.value === M ? AST_SymbolRef : AST_SymbolClassProperty)
+                        : p.type == "ClassDeclaration" ? (p.id === M ? AST_SymbolDefClass : AST_SymbolRef)
+                        : p.type == "MethodDefinition" ? (p.computed ? AST_SymbolRef : AST_SymbolMethod)
+                        : p.type == "CatchClause" ? AST_SymbolCatch
+                        : p.type == "BreakStatement" || p.type == "ContinueStatement" ? AST_LabelRef
+                        : AST_SymbolRef)({
+                            start : my_start_token(M),
+                            end   : my_end_token(M),
+                            name  : M.name
+                        });
+        },
+        BigIntLiteral(M) {
+            return new AST_BigInt({
+                start : my_start_token(M),
+                end   : my_end_token(M),
+                value : M.value
+            });
+        }
+    };
+
+    MOZ_TO_ME.UpdateExpression =
+    MOZ_TO_ME.UnaryExpression = function To_Moz_Unary(M) {
+        var prefix = "prefix" in M ? M.prefix
+            : M.type == "UnaryExpression" ? true : false;
+        return new (prefix ? AST_UnaryPrefix : AST_UnaryPostfix)({
+            start      : my_start_token(M),
+            end        : my_end_token(M),
+            operator   : M.operator,
+            expression : from_moz(M.argument)
+        });
+    };
+
+    MOZ_TO_ME.ClassDeclaration =
+    MOZ_TO_ME.ClassExpression = function From_Moz_Class(M) {
+        return new (M.type === "ClassDeclaration" ? AST_DefClass : AST_ClassExpression)({
+            start    : my_start_token(M),
+            end      : my_end_token(M),
+            name     : from_moz(M.id),
+            extends  : from_moz(M.superClass),
+            properties: M.body.body.map(from_moz)
+        });
+    };
+
+    map("EmptyStatement", AST_EmptyStatement);
+    map("BlockStatement", AST_BlockStatement, "body@body");
+    map("IfStatement", AST_If, "test>condition, consequent>body, alternate>alternative");
+    map("LabeledStatement", AST_LabeledStatement, "label>label, body>body");
+    map("BreakStatement", AST_Break, "label>label");
+    map("ContinueStatement", AST_Continue, "label>label");
+    map("WithStatement", AST_With, "object>expression, body>body");
+    map("SwitchStatement", AST_Switch, "discriminant>expression, cases@body");
+    map("ReturnStatement", AST_Return, "argument>value");
+    map("ThrowStatement", AST_Throw, "argument>value");
+    map("WhileStatement", AST_While, "test>condition, body>body");
+    map("DoWhileStatement", AST_Do, "test>condition, body>body");
+    map("ForStatement", AST_For, "init>init, test>condition, update>step, body>body");
+    map("ForInStatement", AST_ForIn, "left>init, right>object, body>body");
+    map("ForOfStatement", AST_ForOf, "left>init, right>object, body>body, await=await");
+    map("AwaitExpression", AST_Await, "argument>expression");
+    map("YieldExpression", AST_Yield, "argument>expression, delegate=is_star");
+    map("DebuggerStatement", AST_Debugger);
+    map("VariableDeclarator", AST_VarDef, "id>name, init>value");
+    map("CatchClause", AST_Catch, "param>argname, body%body");
+
+    map("ThisExpression", AST_This);
+    map("Super", AST_Super);
+    map("BinaryExpression", AST_Binary, "operator=operator, left>left, right>right");
+    map("LogicalExpression", AST_Binary, "operator=operator, left>left, right>right");
+    map("AssignmentExpression", AST_Assign, "operator=operator, left>left, right>right");
+    map("ConditionalExpression", AST_Conditional, "test>condition, consequent>consequent, alternate>alternative");
+    map("NewExpression", AST_New, "callee>expression, arguments@args");
+    map("CallExpression", AST_Call, "callee>expression, optional=optional, arguments@args");
+
+    def_to_moz(AST_Toplevel, function To_Moz_Program(M) {
+        return to_moz_scope("Program", M);
+    });
+
+    def_to_moz(AST_Expansion, function To_Moz_Spread(M) {
+        return {
+            type: to_moz_in_destructuring() ? "RestElement" : "SpreadElement",
+            argument: to_moz(M.expression)
+        };
+    });
+
+    def_to_moz(AST_PrefixedTemplateString, function To_Moz_TaggedTemplateExpression(M) {
+        return {
+            type: "TaggedTemplateExpression",
+            tag: to_moz(M.prefix),
+            quasi: to_moz(M.template_string)
+        };
+    });
+
+    def_to_moz(AST_TemplateString, function To_Moz_TemplateLiteral(M) {
+        var quasis = [];
+        var expressions = [];
+        for (var i = 0; i < M.segments.length; i++) {
+            if (i % 2 !== 0) {
+                expressions.push(to_moz(M.segments[i]));
+            } else {
+                quasis.push({
+                    type: "TemplateElement",
+                    value: {
+                        raw: M.segments[i].raw,
+                        cooked: M.segments[i].value
+                    },
+                    tail: i === M.segments.length - 1
+                });
+            }
+        }
+        return {
+            type: "TemplateLiteral",
+            quasis: quasis,
+            expressions: expressions
+        };
+    });
+
+    def_to_moz(AST_Defun, function To_Moz_FunctionDeclaration(M) {
+        return {
+            type: "FunctionDeclaration",
+            id: to_moz(M.name),
+            params: M.argnames.map(to_moz),
+            generator: M.is_generator,
+            async: M.async,
+            body: to_moz_scope("BlockStatement", M)
+        };
+    });
+
+    def_to_moz(AST_Function, function To_Moz_FunctionExpression(M, parent) {
+        var is_generator = parent.is_generator !== undefined ?
+            parent.is_generator : M.is_generator;
+        return {
+            type: "FunctionExpression",
+            id: to_moz(M.name),
+            params: M.argnames.map(to_moz),
+            generator: is_generator,
+            async: M.async,
+            body: to_moz_scope("BlockStatement", M)
+        };
+    });
+
+    def_to_moz(AST_Arrow, function To_Moz_ArrowFunctionExpression(M) {
+        var body = {
+            type: "BlockStatement",
+            body: M.body.map(to_moz)
+        };
+        return {
+            type: "ArrowFunctionExpression",
+            params: M.argnames.map(to_moz),
+            async: M.async,
+            body: body
+        };
+    });
+
+    def_to_moz(AST_Destructuring, function To_Moz_ObjectPattern(M) {
+        if (M.is_array) {
+            return {
+                type: "ArrayPattern",
+                elements: M.names.map(to_moz)
+            };
+        }
+        return {
+            type: "ObjectPattern",
+            properties: M.names.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_Directive, function To_Moz_Directive(M) {
+        return {
+            type: "ExpressionStatement",
+            expression: {
+                type: "Literal",
+                value: M.value,
+                raw: M.print_to_string()
+            },
+            directive: M.value
+        };
+    });
+
+    def_to_moz(AST_SimpleStatement, function To_Moz_ExpressionStatement(M) {
+        return {
+            type: "ExpressionStatement",
+            expression: to_moz(M.body)
+        };
+    });
+
+    def_to_moz(AST_SwitchBranch, function To_Moz_SwitchCase(M) {
+        return {
+            type: "SwitchCase",
+            test: to_moz(M.expression),
+            consequent: M.body.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_Try, function To_Moz_TryStatement(M) {
+        return {
+            type: "TryStatement",
+            block: to_moz_block(M),
+            handler: to_moz(M.bcatch),
+            guardedHandlers: [],
+            finalizer: to_moz(M.bfinally)
+        };
+    });
+
+    def_to_moz(AST_Catch, function To_Moz_CatchClause(M) {
+        return {
+            type: "CatchClause",
+            param: to_moz(M.argname),
+            guard: null,
+            body: to_moz_block(M)
+        };
+    });
+
+    def_to_moz(AST_Definitions, function To_Moz_VariableDeclaration(M) {
+        return {
+            type: "VariableDeclaration",
+            kind:
+                M instanceof AST_Const ? "const" :
+                M instanceof AST_Let ? "let" : "var",
+            declarations: M.definitions.map(to_moz)
+        };
+    });
+
+    const assert_clause_to_moz = assert_clause => {
+        const assertions = [];
+        if (assert_clause) {
+            for (const { key, value } of assert_clause.properties) {
+                const key_moz = is_basic_identifier_string(key)
+                    ? { type: "Identifier", name: key }
+                    : { type: "Literal", value: key, raw: JSON.stringify(key) };
+                assertions.push({
+                    type: "ImportAttribute",
+                    key: key_moz,
+                    value: to_moz(value)
+                });
+            }
+        }
+        return assertions;
+    };
+
+    def_to_moz(AST_Export, function To_Moz_ExportDeclaration(M) {
+        if (M.exported_names) {
+            if (M.exported_names[0].name.name === "*") {
+                return {
+                    type: "ExportAllDeclaration",
+                    source: to_moz(M.module_name),
+                    assertions: assert_clause_to_moz(M.assert_clause)
+                };
+            }
+            return {
+                type: "ExportNamedDeclaration",
+                specifiers: M.exported_names.map(function (name_mapping) {
+                    return {
+                        type: "ExportSpecifier",
+                        exported: to_moz(name_mapping.foreign_name),
+                        local: to_moz(name_mapping.name)
+                    };
+                }),
+                declaration: to_moz(M.exported_definition),
+                source: to_moz(M.module_name),
+                assertions: assert_clause_to_moz(M.assert_clause)
+            };
+        }
+        return {
+            type: M.is_default ? "ExportDefaultDeclaration" : "ExportNamedDeclaration",
+            declaration: to_moz(M.exported_value || M.exported_definition)
+        };
+    });
+
+    def_to_moz(AST_Import, function To_Moz_ImportDeclaration(M) {
+        var specifiers = [];
+        if (M.imported_name) {
+            specifiers.push({
+                type: "ImportDefaultSpecifier",
+                local: to_moz(M.imported_name)
+            });
+        }
+        if (M.imported_names && M.imported_names[0].foreign_name.name === "*") {
+            specifiers.push({
+                type: "ImportNamespaceSpecifier",
+                local: to_moz(M.imported_names[0].name)
+            });
+        } else if (M.imported_names) {
+            M.imported_names.forEach(function(name_mapping) {
+                specifiers.push({
+                    type: "ImportSpecifier",
+                    local: to_moz(name_mapping.name),
+                    imported: to_moz(name_mapping.foreign_name)
+                });
+            });
+        }
+        return {
+            type: "ImportDeclaration",
+            specifiers: specifiers,
+            source: to_moz(M.module_name),
+            assertions: assert_clause_to_moz(M.assert_clause)
+        };
+    });
+
+    def_to_moz(AST_ImportMeta, function To_Moz_MetaProperty() {
+        return {
+            type: "MetaProperty",
+            meta: {
+                type: "Identifier",
+                name: "import"
+            },
+            property: {
+                type: "Identifier",
+                name: "meta"
+            }
+        };
+    });
+
+    def_to_moz(AST_Sequence, function To_Moz_SequenceExpression(M) {
+        return {
+            type: "SequenceExpression",
+            expressions: M.expressions.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_DotHash, function To_Moz_PrivateMemberExpression(M) {
+        return {
+            type: "MemberExpression",
+            object: to_moz(M.expression),
+            computed: false,
+            property: {
+                type: "PrivateIdentifier",
+                name: M.property
+            },
+            optional: M.optional
+        };
+    });
+
+    def_to_moz(AST_PropAccess, function To_Moz_MemberExpression(M) {
+        var isComputed = M instanceof AST_Sub;
+        return {
+            type: "MemberExpression",
+            object: to_moz(M.expression),
+            computed: isComputed,
+            property: isComputed ? to_moz(M.property) : {type: "Identifier", name: M.property},
+            optional: M.optional
+        };
+    });
+
+    def_to_moz(AST_Chain, function To_Moz_ChainExpression(M) {
+        return {
+            type: "ChainExpression",
+            expression: to_moz(M.expression)
+        };
+    });
+
+    def_to_moz(AST_Unary, function To_Moz_Unary(M) {
+        return {
+            type: M.operator == "++" || M.operator == "--" ? "UpdateExpression" : "UnaryExpression",
+            operator: M.operator,
+            prefix: M instanceof AST_UnaryPrefix,
+            argument: to_moz(M.expression)
+        };
+    });
+
+    def_to_moz(AST_Binary, function To_Moz_BinaryExpression(M) {
+        if (M.operator == "=" && to_moz_in_destructuring()) {
+            return {
+                type: "AssignmentPattern",
+                left: to_moz(M.left),
+                right: to_moz(M.right)
+            };
+        }
+
+        const type = M.operator == "&&" || M.operator == "||" || M.operator === "??"
+            ? "LogicalExpression"
+            : "BinaryExpression";
+
+        return {
+            type,
+            left: to_moz(M.left),
+            operator: M.operator,
+            right: to_moz(M.right)
+        };
+    });
+
+    def_to_moz(AST_Array, function To_Moz_ArrayExpression(M) {
+        return {
+            type: "ArrayExpression",
+            elements: M.elements.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_Object, function To_Moz_ObjectExpression(M) {
+        return {
+            type: "ObjectExpression",
+            properties: M.properties.map(to_moz)
+        };
+    });
+
+    def_to_moz(AST_ObjectProperty, function To_Moz_Property(M, parent) {
+        var key = M.key instanceof AST_Node ? to_moz(M.key) : {
+            type: "Identifier",
+            value: M.key
+        };
+        if (typeof M.key === "number") {
+            key = {
+                type: "Literal",
+                value: Number(M.key)
+            };
+        }
+        if (typeof M.key === "string") {
+            key = {
+                type: "Identifier",
+                name: M.key
+            };
+        }
+        var kind;
+        var string_or_num = typeof M.key === "string" || typeof M.key === "number";
+        var computed = string_or_num ? false : !(M.key instanceof AST_Symbol) || M.key instanceof AST_SymbolRef;
+        if (M instanceof AST_ObjectKeyVal) {
+            kind = "init";
+            computed = !string_or_num;
+        } else
+        if (M instanceof AST_ObjectGetter) {
+            kind = "get";
+        } else
+        if (M instanceof AST_ObjectSetter) {
+            kind = "set";
+        }
+        if (M instanceof AST_PrivateGetter || M instanceof AST_PrivateSetter) {
+            const kind = M instanceof AST_PrivateGetter ? "get" : "set";
+            return {
+                type: "MethodDefinition",
+                computed: false,
+                kind: kind,
+                static: M.static,
+                key: {
+                    type: "PrivateIdentifier",
+                    name: M.key.name
+                },
+                value: to_moz(M.value)
+            };
+        }
+        if (M instanceof AST_ClassPrivateProperty) {
+            return {
+                type: "PropertyDefinition",
+                key: {
+                    type: "PrivateIdentifier",
+                    name: M.key.name
+                },
+                value: to_moz(M.value),
+                computed: false,
+                static: M.static
+            };
+        }
+        if (M instanceof AST_ClassProperty) {
+            return {
+                type: "PropertyDefinition",
+                key,
+                value: to_moz(M.value),
+                computed,
+                static: M.static
+            };
+        }
+        if (parent instanceof AST_Class) {
+            return {
+                type: "MethodDefinition",
+                computed: computed,
+                kind: kind,
+                static: M.static,
+                key: to_moz(M.key),
+                value: to_moz(M.value)
+            };
+        }
+        return {
+            type: "Property",
+            computed: computed,
+            kind: kind,
+            key: key,
+            value: to_moz(M.value)
+        };
+    });
+
+    def_to_moz(AST_ConciseMethod, function To_Moz_MethodDefinition(M, parent) {
+        if (parent instanceof AST_Object) {
+            return {
+                type: "Property",
+                computed: !(M.key instanceof AST_Symbol) || M.key instanceof AST_SymbolRef,
+                kind: "init",
+                method: true,
+                shorthand: false,
+                key: to_moz(M.key),
+                value: to_moz(M.value)
+            };
+        }
+
+        const key = M instanceof AST_PrivateMethod
+            ? {
+                type: "PrivateIdentifier",
+                name: M.key.name
+            }
+            : to_moz(M.key);
+
+        return {
+            type: "MethodDefinition",
+            kind: M.key === "constructor" ? "constructor" : "method",
+            key,
+            value: to_moz(M.value),
+            computed: !(M.key instanceof AST_Symbol) || M.key instanceof AST_SymbolRef,
+            static: M.static,
+        };
+    });
+
+    def_to_moz(AST_Class, function To_Moz_Class(M) {
+        var type = M instanceof AST_ClassExpression ? "ClassExpression" : "ClassDeclaration";
+        return {
+            type: type,
+            superClass: to_moz(M.extends),
+            id: M.name ? to_moz(M.name) : null,
+            body: {
+                type: "ClassBody",
+                body: M.properties.map(to_moz)
+            }
+        };
+    });
+
+    def_to_moz(AST_NewTarget, function To_Moz_MetaProperty() {
+        return {
+            type: "MetaProperty",
+            meta: {
+                type: "Identifier",
+                name: "new"
+            },
+            property: {
+                type: "Identifier",
+                name: "target"
+            }
+        };
+    });
+
+    def_to_moz(AST_Symbol, function To_Moz_Identifier(M, parent) {
+        if (M instanceof AST_SymbolMethod && parent.quote) {
+            return {
+                type: "Literal",
+                value: M.name
+            };
+        }
+        var def = M.definition();
+        return {
+            type: "Identifier",
+            name: def ? def.mangled_name || def.name : M.name
+        };
+    });
+
+    def_to_moz(AST_RegExp, function To_Moz_RegExpLiteral(M) {
+        const pattern = M.value.source;
+        const flags = M.value.flags;
+        return {
+            type: "Literal",
+            value: null,
+            raw: M.print_to_string(),
+            regex: { pattern, flags }
+        };
+    });
+
+    def_to_moz(AST_Constant, function To_Moz_Literal(M) {
+        var value = M.value;
+        return {
+            type: "Literal",
+            value: value,
+            raw: M.raw || M.print_to_string()
+        };
+    });
+
+    def_to_moz(AST_Atom, function To_Moz_Atom(M) {
+        return {
+            type: "Identifier",
+            name: String(M.value)
+        };
+    });
+
+    def_to_moz(AST_BigInt, M => ({
+        type: "BigIntLiteral",
+        value: M.value
+    }));
+
+    AST_Boolean.DEFMETHOD("to_mozilla_ast", AST_Constant.prototype.to_mozilla_ast);
+    AST_Null.DEFMETHOD("to_mozilla_ast", AST_Constant.prototype.to_mozilla_ast);
+    AST_Hole.DEFMETHOD("to_mozilla_ast", function To_Moz_ArrayHole() { return null; });
+
+    AST_Block.DEFMETHOD("to_mozilla_ast", AST_BlockStatement.prototype.to_mozilla_ast);
+    AST_Lambda.DEFMETHOD("to_mozilla_ast", AST_Function.prototype.to_mozilla_ast);
+
+    /* -----[ tools ]----- */
+
+    function my_start_token(moznode) {
+        var loc = moznode.loc, start = loc && loc.start;
+        var range = moznode.range;
+        return new AST_Token(
+            "",
+            "",
+            start && start.line || 0,
+            start && start.column || 0,
+            range ? range [0] : moznode.start,
+            false,
+            [],
+            [],
+            loc && loc.source,
+        );
+    }
+
+    function my_end_token(moznode) {
+        var loc = moznode.loc, end = loc && loc.end;
+        var range = moznode.range;
+        return new AST_Token(
+            "",
+            "",
+            end && end.line || 0,
+            end && end.column || 0,
+            range ? range [0] : moznode.end,
+            false,
+            [],
+            [],
+            loc && loc.source,
+        );
+    }
+
+    function map(moztype, mytype, propmap) {
+        var moz_to_me = "function From_Moz_" + moztype + "(M){\n";
+        moz_to_me += "return new U2." + mytype.name + "({\n" +
+            "start: my_start_token(M),\n" +
+            "end: my_end_token(M)";
+
+        var me_to_moz = "function To_Moz_" + moztype + "(M){\n";
+        me_to_moz += "return {\n" +
+            "type: " + JSON.stringify(moztype);
+
+        if (propmap) propmap.split(/\s*,\s*/).forEach(function(prop) {
+            var m = /([a-z0-9$_]+)([=@>%])([a-z0-9$_]+)/i.exec(prop);
+            if (!m) throw new Error("Can't understand property map: " + prop);
+            var moz = m[1], how = m[2], my = m[3];
+            moz_to_me += ",\n" + my + ": ";
+            me_to_moz += ",\n" + moz + ": ";
+            switch (how) {
+                case "@":
+                    moz_to_me += "M." + moz + ".map(from_moz)";
+                    me_to_moz += "M." +  my + ".map(to_moz)";
+                    break;
+                case ">":
+                    moz_to_me += "from_moz(M." + moz + ")";
+                    me_to_moz += "to_moz(M." + my + ")";
+                    break;
+                case "=":
+                    moz_to_me += "M." + moz;
+                    me_to_moz += "M." + my;
+                    break;
+                case "%":
+                    moz_to_me += "from_moz(M." + moz + ").body";
+                    me_to_moz += "to_moz_block(M)";
+                    break;
+                default:
+                    throw new Error("Can't understand operator in propmap: " + prop);
+            }
+        });
+
+        moz_to_me += "\n})\n}";
+        me_to_moz += "\n}\n}";
+
+        moz_to_me = new Function("U2", "my_start_token", "my_end_token", "from_moz", "return(" + moz_to_me + ")")(
+            ast, my_start_token, my_end_token, from_moz
+        );
+        me_to_moz = new Function("to_moz", "to_moz_block", "to_moz_scope", "return(" + me_to_moz + ")")(
+            to_moz, to_moz_block, to_moz_scope
+        );
+        MOZ_TO_ME[moztype] = moz_to_me;
+        def_to_moz(mytype, me_to_moz);
+    }
+
+    var FROM_MOZ_STACK = null;
+
+    function from_moz(node) {
+        FROM_MOZ_STACK.push(node);
+        var ret = node != null ? MOZ_TO_ME[node.type](node) : null;
+        FROM_MOZ_STACK.pop();
+        return ret;
+    }
+
+    AST_Node.from_mozilla_ast = function(node) {
+        var save_stack = FROM_MOZ_STACK;
+        FROM_MOZ_STACK = [];
+        var ast = from_moz(node);
+        FROM_MOZ_STACK = save_stack;
+        return ast;
+    };
+
+    function set_moz_loc(mynode, moznode) {
+        var start = mynode.start;
+        var end = mynode.end;
+        if (!(start && end)) {
+            return moznode;
+        }
+        if (start.pos != null && end.endpos != null) {
+            moznode.range = [start.pos, end.endpos];
+        }
+        if (start.line) {
+            moznode.loc = {
+                start: {line: start.line, column: start.col},
+                end: end.endline ? {line: end.endline, column: end.endcol} : null
+            };
+            if (start.file) {
+                moznode.loc.source = start.file;
+            }
+        }
+        return moznode;
+    }
+
+    function def_to_moz(mytype, handler) {
+        mytype.DEFMETHOD("to_mozilla_ast", function(parent) {
+            return set_moz_loc(this, handler(this, parent));
+        });
+    }
+
+    var TO_MOZ_STACK = null;
+
+    function to_moz(node) {
+        if (TO_MOZ_STACK === null) { TO_MOZ_STACK = []; }
+        TO_MOZ_STACK.push(node);
+        var ast = node != null ? node.to_mozilla_ast(TO_MOZ_STACK[TO_MOZ_STACK.length - 2]) : null;
+        TO_MOZ_STACK.pop();
+        if (TO_MOZ_STACK.length === 0) { TO_MOZ_STACK = null; }
+        return ast;
+    }
+
+    function to_moz_in_destructuring() {
+        var i = TO_MOZ_STACK.length;
+        while (i--) {
+            if (TO_MOZ_STACK[i] instanceof AST_Destructuring) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    function to_moz_block(node) {
+        return {
+            type: "BlockStatement",
+            body: node.body.map(to_moz)
+        };
+    }
+
+    function to_moz_scope(type, node) {
+        var body = node.body.map(to_moz);
+        if (node.body[0] instanceof AST_SimpleStatement && node.body[0].body instanceof AST_String) {
+            body.unshift(to_moz(new AST_EmptyStatement(node.body[0])));
+        }
+        return {
+            type: type,
+            body: body
+        };
+    }
+})();
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/output.js b/node_modules/mathjs/examples/node_modules/terser/lib/output.js
new file mode 100644
index 0000000..05d3e62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/output.js
@@ -0,0 +1,2347 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+
+import {
+    defaults,
+    makePredicate,
+    noop,
+    regexp_source_fix,
+    sort_regexp_flags,
+    return_false,
+    return_true,
+} from "./utils/index.js";
+import { first_in_statement, left_is_object } from "./utils/first_in_statement.js";
+import {
+    AST_Array,
+    AST_Arrow,
+    AST_Assign,
+    AST_Await,
+    AST_BigInt,
+    AST_Binary,
+    AST_BlockStatement,
+    AST_Break,
+    AST_Call,
+    AST_Case,
+    AST_Catch,
+    AST_Chain,
+    AST_Class,
+    AST_ClassExpression,
+    AST_ClassPrivateProperty,
+    AST_ClassProperty,
+    AST_ConciseMethod,
+    AST_PrivateGetter,
+    AST_PrivateMethod,
+    AST_PrivateSetter,
+    AST_Conditional,
+    AST_Const,
+    AST_Constant,
+    AST_Continue,
+    AST_Debugger,
+    AST_Default,
+    AST_DefaultAssign,
+    AST_Definitions,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Do,
+    AST_Dot,
+    AST_DotHash,
+    AST_EmptyStatement,
+    AST_Exit,
+    AST_Expansion,
+    AST_Export,
+    AST_Finally,
+    AST_For,
+    AST_ForIn,
+    AST_ForOf,
+    AST_Function,
+    AST_Hole,
+    AST_If,
+    AST_Import,
+    AST_ImportMeta,
+    AST_Jump,
+    AST_LabeledStatement,
+    AST_Lambda,
+    AST_Let,
+    AST_LoopControl,
+    AST_NameMapping,
+    AST_New,
+    AST_NewTarget,
+    AST_Node,
+    AST_Number,
+    AST_Object,
+    AST_ObjectGetter,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_ObjectSetter,
+    AST_PrefixedTemplateString,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Return,
+    AST_Scope,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Statement,
+    AST_StatementWithBody,
+    AST_String,
+    AST_Sub,
+    AST_Super,
+    AST_Switch,
+    AST_SwitchBranch,
+    AST_Symbol,
+    AST_SymbolClassProperty,
+    AST_SymbolMethod,
+    AST_SymbolRef,
+    AST_TemplateSegment,
+    AST_TemplateString,
+    AST_This,
+    AST_Throw,
+    AST_Toplevel,
+    AST_Try,
+    AST_Unary,
+    AST_UnaryPostfix,
+    AST_UnaryPrefix,
+    AST_Var,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield,
+    TreeWalker,
+    walk,
+    walk_abort
+} from "./ast.js";
+import {
+    get_full_char_code,
+    get_full_char,
+    is_identifier_char,
+    is_basic_identifier_string,
+    is_identifier_string,
+    PRECEDENCE,
+    ALL_RESERVED_WORDS,
+} from "./parse.js";
+
+const EXPECT_DIRECTIVE = /^$|[;{][\s\n]*$/;
+const CODE_LINE_BREAK = 10;
+const CODE_SPACE = 32;
+
+const r_annotation = /[@#]__(PURE|INLINE|NOINLINE)__/g;
+
+function is_some_comments(comment) {
+    // multiline comment
+    return (
+        (comment.type === "comment2" || comment.type === "comment1")
+        && /@preserve|@copyright|@lic|@cc_on|^\**!/i.test(comment.value)
+    );
+}
+
+class Rope {
+    constructor() {
+        this.committed = "";
+        this.current = "";
+    }
+
+    append(str) {
+        this.current += str;
+    }
+
+    insertAt(char, index) {
+        const { committed, current } = this;
+        if (index < committed.length) {
+            this.committed = committed.slice(0, index) + char + committed.slice(index);
+        } else if (index === committed.length) {
+            this.committed += char;
+        } else {
+            index -= committed.length;
+            this.committed += current.slice(0, index) + char;
+            this.current = current.slice(index);
+        }
+    }
+
+    charAt(index) {
+        const { committed } = this;
+        if (index < committed.length) return committed[index];
+        return this.current[index - committed.length];
+    }
+
+    curLength() {
+        return this.current.length;
+    }
+
+    length() {
+        return this.committed.length + this.current.length;
+    }
+
+    toString() {
+        return this.committed + this.current;
+    }
+}
+
+function OutputStream(options) {
+
+    var readonly = !options;
+    options = defaults(options, {
+        ascii_only           : false,
+        beautify             : false,
+        braces               : false,
+        comments             : "some",
+        ecma                 : 5,
+        ie8                  : false,
+        indent_level         : 4,
+        indent_start         : 0,
+        inline_script        : true,
+        keep_numbers         : false,
+        keep_quoted_props    : false,
+        max_line_len         : false,
+        preamble             : null,
+        preserve_annotations : false,
+        quote_keys           : false,
+        quote_style          : 0,
+        safari10             : false,
+        semicolons           : true,
+        shebang              : true,
+        shorthand            : undefined,
+        source_map           : null,
+        webkit               : false,
+        width                : 80,
+        wrap_iife            : false,
+        wrap_func_args       : true,
+    }, true);
+
+    if (options.shorthand === undefined)
+        options.shorthand = options.ecma > 5;
+
+    // Convert comment option to RegExp if neccessary and set up comments filter
+    var comment_filter = return_false; // Default case, throw all comments away
+    if (options.comments) {
+        let comments = options.comments;
+        if (typeof options.comments === "string" && /^\/.*\/[a-zA-Z]*$/.test(options.comments)) {
+            var regex_pos = options.comments.lastIndexOf("/");
+            comments = new RegExp(
+                options.comments.substr(1, regex_pos - 1),
+                options.comments.substr(regex_pos + 1)
+            );
+        }
+        if (comments instanceof RegExp) {
+            comment_filter = function(comment) {
+                return comment.type != "comment5" && comments.test(comment.value);
+            };
+        } else if (typeof comments === "function") {
+            comment_filter = function(comment) {
+                return comment.type != "comment5" && comments(this, comment);
+            };
+        } else if (comments === "some") {
+            comment_filter = is_some_comments;
+        } else { // NOTE includes "all" option
+            comment_filter = return_true;
+        }
+    }
+
+    var indentation = 0;
+    var current_col = 0;
+    var current_line = 1;
+    var current_pos = 0;
+    var OUTPUT = new Rope();
+    let printed_comments = new Set();
+
+    var to_utf8 = options.ascii_only ? function(str, identifier = false, regexp = false) {
+        if (options.ecma >= 2015 && !options.safari10 && !regexp) {
+            str = str.replace(/[\ud800-\udbff][\udc00-\udfff]/g, function(ch) {
+                var code = get_full_char_code(ch, 0).toString(16);
+                return "\\u{" + code + "}";
+            });
+        }
+        return str.replace(/[\u0000-\u001f\u007f-\uffff]/g, function(ch) {
+            var code = ch.charCodeAt(0).toString(16);
+            if (code.length <= 2 && !identifier) {
+                while (code.length < 2) code = "0" + code;
+                return "\\x" + code;
+            } else {
+                while (code.length < 4) code = "0" + code;
+                return "\\u" + code;
+            }
+        });
+    } : function(str) {
+        return str.replace(/[\ud800-\udbff][\udc00-\udfff]|([\ud800-\udbff]|[\udc00-\udfff])/g, function(match, lone) {
+            if (lone) {
+                return "\\u" + lone.charCodeAt(0).toString(16);
+            }
+            return match;
+        });
+    };
+
+    function make_string(str, quote) {
+        var dq = 0, sq = 0;
+        str = str.replace(/[\\\b\f\n\r\v\t\x22\x27\u2028\u2029\0\ufeff]/g,
+          function(s, i) {
+            switch (s) {
+              case '"': ++dq; return '"';
+              case "'": ++sq; return "'";
+              case "\\": return "\\\\";
+              case "\n": return "\\n";
+              case "\r": return "\\r";
+              case "\t": return "\\t";
+              case "\b": return "\\b";
+              case "\f": return "\\f";
+              case "\x0B": return options.ie8 ? "\\x0B" : "\\v";
+              case "\u2028": return "\\u2028";
+              case "\u2029": return "\\u2029";
+              case "\ufeff": return "\\ufeff";
+              case "\0":
+                  return /[0-9]/.test(get_full_char(str, i+1)) ? "\\x00" : "\\0";
+            }
+            return s;
+        });
+        function quote_single() {
+            return "'" + str.replace(/\x27/g, "\\'") + "'";
+        }
+        function quote_double() {
+            return '"' + str.replace(/\x22/g, '\\"') + '"';
+        }
+        function quote_template() {
+            return "`" + str.replace(/`/g, "\\`") + "`";
+        }
+        str = to_utf8(str);
+        if (quote === "`") return quote_template();
+        switch (options.quote_style) {
+          case 1:
+            return quote_single();
+          case 2:
+            return quote_double();
+          case 3:
+            return quote == "'" ? quote_single() : quote_double();
+          default:
+            return dq > sq ? quote_single() : quote_double();
+        }
+    }
+
+    function encode_string(str, quote) {
+        var ret = make_string(str, quote);
+        if (options.inline_script) {
+            ret = ret.replace(/<\x2f(script)([>\/\t\n\f\r ])/gi, "<\\/$1$2");
+            ret = ret.replace(/\x3c!--/g, "\\x3c!--");
+            ret = ret.replace(/--\x3e/g, "--\\x3e");
+        }
+        return ret;
+    }
+
+    function make_name(name) {
+        name = name.toString();
+        name = to_utf8(name, true);
+        return name;
+    }
+
+    function make_indent(back) {
+        return " ".repeat(options.indent_start + indentation - back * options.indent_level);
+    }
+
+    /* -----[ beautification/minification ]----- */
+
+    var has_parens = false;
+    var might_need_space = false;
+    var might_need_semicolon = false;
+    var might_add_newline = 0;
+    var need_newline_indented = false;
+    var need_space = false;
+    var newline_insert = -1;
+    var last = "";
+    var mapping_token, mapping_name, mappings = options.source_map && [];
+
+    var do_add_mapping = mappings ? function() {
+        mappings.forEach(function(mapping) {
+            try {
+                let { name, token } = mapping;
+                if (token.type == "name" || token.type === "privatename") {
+                    name = token.value;
+                } else if (name instanceof AST_Symbol) {
+                    name = token.type === "string" ? token.value : name.name;
+                }
+                options.source_map.add(
+                    mapping.token.file,
+                    mapping.line, mapping.col,
+                    mapping.token.line, mapping.token.col,
+                    is_basic_identifier_string(name) ? name : undefined
+                );
+            } catch(ex) {
+                // Ignore bad mapping
+            }
+        });
+        mappings = [];
+    } : noop;
+
+    var ensure_line_len = options.max_line_len ? function() {
+        if (current_col > options.max_line_len) {
+            if (might_add_newline) {
+                OUTPUT.insertAt("\n", might_add_newline);
+                const curLength = OUTPUT.curLength();
+                if (mappings) {
+                    var delta = curLength - current_col;
+                    mappings.forEach(function(mapping) {
+                        mapping.line++;
+                        mapping.col += delta;
+                    });
+                }
+                current_line++;
+                current_pos++;
+                current_col = curLength;
+            }
+        }
+        if (might_add_newline) {
+            might_add_newline = 0;
+            do_add_mapping();
+        }
+    } : noop;
+
+    var requireSemicolonChars = makePredicate("( [ + * / - , . `");
+
+    function print(str) {
+        str = String(str);
+        var ch = get_full_char(str, 0);
+        if (need_newline_indented && ch) {
+            need_newline_indented = false;
+            if (ch !== "\n") {
+                print("\n");
+                indent();
+            }
+        }
+        if (need_space && ch) {
+            need_space = false;
+            if (!/[\s;})]/.test(ch)) {
+                space();
+            }
+        }
+        newline_insert = -1;
+        var prev = last.charAt(last.length - 1);
+        if (might_need_semicolon) {
+            might_need_semicolon = false;
+
+            if (prev === ":" && ch === "}" || (!ch || !";}".includes(ch)) && prev !== ";") {
+                if (options.semicolons || requireSemicolonChars.has(ch)) {
+                    OUTPUT.append(";");
+                    current_col++;
+                    current_pos++;
+                } else {
+                    ensure_line_len();
+                    if (current_col > 0) {
+                        OUTPUT.append("\n");
+                        current_pos++;
+                        current_line++;
+                        current_col = 0;
+                    }
+
+                    if (/^\s+$/.test(str)) {
+                        // reset the semicolon flag, since we didn't print one
+                        // now and might still have to later
+                        might_need_semicolon = true;
+                    }
+                }
+
+                if (!options.beautify)
+                    might_need_space = false;
+            }
+        }
+
+        if (might_need_space) {
+            if ((is_identifier_char(prev)
+                    && (is_identifier_char(ch) || ch == "\\"))
+                || (ch == "/" && ch == prev)
+                || ((ch == "+" || ch == "-") && ch == last)
+            ) {
+                OUTPUT.append(" ");
+                current_col++;
+                current_pos++;
+            }
+            might_need_space = false;
+        }
+
+        if (mapping_token) {
+            mappings.push({
+                token: mapping_token,
+                name: mapping_name,
+                line: current_line,
+                col: current_col
+            });
+            mapping_token = false;
+            if (!might_add_newline) do_add_mapping();
+        }
+
+        OUTPUT.append(str);
+        has_parens = str[str.length - 1] == "(";
+        current_pos += str.length;
+        var a = str.split(/\r?\n/), n = a.length - 1;
+        current_line += n;
+        current_col += a[0].length;
+        if (n > 0) {
+            ensure_line_len();
+            current_col = a[n].length;
+        }
+        last = str;
+    }
+
+    var star = function() {
+        print("*");
+    };
+
+    var space = options.beautify ? function() {
+        print(" ");
+    } : function() {
+        might_need_space = true;
+    };
+
+    var indent = options.beautify ? function(half) {
+        if (options.beautify) {
+            print(make_indent(half ? 0.5 : 0));
+        }
+    } : noop;
+
+    var with_indent = options.beautify ? function(col, cont) {
+        if (col === true) col = next_indent();
+        var save_indentation = indentation;
+        indentation = col;
+        var ret = cont();
+        indentation = save_indentation;
+        return ret;
+    } : function(col, cont) { return cont(); };
+
+    var newline = options.beautify ? function() {
+        if (newline_insert < 0) return print("\n");
+        if (OUTPUT.charAt(newline_insert) != "\n") {
+            OUTPUT.insertAt("\n", newline_insert);
+            current_pos++;
+            current_line++;
+        }
+        newline_insert++;
+    } : options.max_line_len ? function() {
+        ensure_line_len();
+        might_add_newline = OUTPUT.length();
+    } : noop;
+
+    var semicolon = options.beautify ? function() {
+        print(";");
+    } : function() {
+        might_need_semicolon = true;
+    };
+
+    function force_semicolon() {
+        might_need_semicolon = false;
+        print(";");
+    }
+
+    function next_indent() {
+        return indentation + options.indent_level;
+    }
+
+    function with_block(cont) {
+        var ret;
+        print("{");
+        newline();
+        with_indent(next_indent(), function() {
+            ret = cont();
+        });
+        indent();
+        print("}");
+        return ret;
+    }
+
+    function with_parens(cont) {
+        print("(");
+        //XXX: still nice to have that for argument lists
+        //var ret = with_indent(current_col, cont);
+        var ret = cont();
+        print(")");
+        return ret;
+    }
+
+    function with_square(cont) {
+        print("[");
+        //var ret = with_indent(current_col, cont);
+        var ret = cont();
+        print("]");
+        return ret;
+    }
+
+    function comma() {
+        print(",");
+        space();
+    }
+
+    function colon() {
+        print(":");
+        space();
+    }
+
+    var add_mapping = mappings ? function(token, name) {
+        mapping_token = token;
+        mapping_name = name;
+    } : noop;
+
+    function get() {
+        if (might_add_newline) {
+            ensure_line_len();
+        }
+        return OUTPUT.toString();
+    }
+
+    function has_nlb() {
+        const output = OUTPUT.toString();
+        let n = output.length - 1;
+        while (n >= 0) {
+            const code = output.charCodeAt(n);
+            if (code === CODE_LINE_BREAK) {
+                return true;
+            }
+
+            if (code !== CODE_SPACE) {
+                return false;
+            }
+            n--;
+        }
+        return true;
+    }
+
+    function filter_comment(comment) {
+        if (!options.preserve_annotations) {
+            comment = comment.replace(r_annotation, " ");
+        }
+        if (/^\s*$/.test(comment)) {
+            return "";
+        }
+        return comment.replace(/(<\s*\/\s*)(script)/i, "<\\/$2");
+    }
+
+    function prepend_comments(node) {
+        var self = this;
+        var start = node.start;
+        if (!start) return;
+        var printed_comments = self.printed_comments;
+
+        // There cannot be a newline between return and its value.
+        const return_with_value = node instanceof AST_Exit && node.value;
+
+        if (
+            start.comments_before
+            && printed_comments.has(start.comments_before)
+        ) {
+            if (return_with_value) {
+                start.comments_before = [];
+            } else {
+                return;
+            }
+        }
+
+        var comments = start.comments_before;
+        if (!comments) {
+            comments = start.comments_before = [];
+        }
+        printed_comments.add(comments);
+
+        if (return_with_value) {
+            var tw = new TreeWalker(function(node) {
+                var parent = tw.parent();
+                if (parent instanceof AST_Exit
+                    || parent instanceof AST_Binary && parent.left === node
+                    || parent.TYPE == "Call" && parent.expression === node
+                    || parent instanceof AST_Conditional && parent.condition === node
+                    || parent instanceof AST_Dot && parent.expression === node
+                    || parent instanceof AST_Sequence && parent.expressions[0] === node
+                    || parent instanceof AST_Sub && parent.expression === node
+                    || parent instanceof AST_UnaryPostfix) {
+                    if (!node.start) return;
+                    var text = node.start.comments_before;
+                    if (text && !printed_comments.has(text)) {
+                        printed_comments.add(text);
+                        comments = comments.concat(text);
+                    }
+                } else {
+                    return true;
+                }
+            });
+            tw.push(node);
+            node.value.walk(tw);
+        }
+
+        if (current_pos == 0) {
+            if (comments.length > 0 && options.shebang && comments[0].type === "comment5"
+                && !printed_comments.has(comments[0])) {
+                print("#!" + comments.shift().value + "\n");
+                indent();
+            }
+            var preamble = options.preamble;
+            if (preamble) {
+                print(preamble.replace(/\r\n?|[\n\u2028\u2029]|\s*$/g, "\n"));
+            }
+        }
+
+        comments = comments.filter(comment_filter, node).filter(c => !printed_comments.has(c));
+        if (comments.length == 0) return;
+        var last_nlb = has_nlb();
+        comments.forEach(function(c, i) {
+            printed_comments.add(c);
+            if (!last_nlb) {
+                if (c.nlb) {
+                    print("\n");
+                    indent();
+                    last_nlb = true;
+                } else if (i > 0) {
+                    space();
+                }
+            }
+
+            if (/comment[134]/.test(c.type)) {
+                var value = filter_comment(c.value);
+                if (value) {
+                    print("//" + value + "\n");
+                    indent();
+                }
+                last_nlb = true;
+            } else if (c.type == "comment2") {
+                var value = filter_comment(c.value);
+                if (value) {
+                    print("/*" + value + "*/");
+                }
+                last_nlb = false;
+            }
+        });
+        if (!last_nlb) {
+            if (start.nlb) {
+                print("\n");
+                indent();
+            } else {
+                space();
+            }
+        }
+    }
+
+    function append_comments(node, tail) {
+        var self = this;
+        var token = node.end;
+        if (!token) return;
+        var printed_comments = self.printed_comments;
+        var comments = token[tail ? "comments_before" : "comments_after"];
+        if (!comments || printed_comments.has(comments)) return;
+        if (!(node instanceof AST_Statement || comments.every((c) =>
+            !/comment[134]/.test(c.type)
+        ))) return;
+        printed_comments.add(comments);
+        var insert = OUTPUT.length();
+        comments.filter(comment_filter, node).forEach(function(c, i) {
+            if (printed_comments.has(c)) return;
+            printed_comments.add(c);
+            need_space = false;
+            if (need_newline_indented) {
+                print("\n");
+                indent();
+                need_newline_indented = false;
+            } else if (c.nlb && (i > 0 || !has_nlb())) {
+                print("\n");
+                indent();
+            } else if (i > 0 || !tail) {
+                space();
+            }
+            if (/comment[134]/.test(c.type)) {
+                const value = filter_comment(c.value);
+                if (value) {
+                    print("//" + value);
+                }
+                need_newline_indented = true;
+            } else if (c.type == "comment2") {
+                const value = filter_comment(c.value);
+                if (value) {
+                    print("/*" + value + "*/");
+                }
+                need_space = true;
+            }
+        });
+        if (OUTPUT.length() > insert) newline_insert = insert;
+    }
+
+    var stack = [];
+    return {
+        get             : get,
+        toString        : get,
+        indent          : indent,
+        in_directive    : false,
+        use_asm         : null,
+        active_scope    : null,
+        indentation     : function() { return indentation; },
+        current_width   : function() { return current_col - indentation; },
+        should_break    : function() { return options.width && this.current_width() >= options.width; },
+        has_parens      : function() { return has_parens; },
+        newline         : newline,
+        print           : print,
+        star            : star,
+        space           : space,
+        comma           : comma,
+        colon           : colon,
+        last            : function() { return last; },
+        semicolon       : semicolon,
+        force_semicolon : force_semicolon,
+        to_utf8         : to_utf8,
+        print_name      : function(name) { print(make_name(name)); },
+        print_string    : function(str, quote, escape_directive) {
+            var encoded = encode_string(str, quote);
+            if (escape_directive === true && !encoded.includes("\\")) {
+                // Insert semicolons to break directive prologue
+                if (!EXPECT_DIRECTIVE.test(OUTPUT.toString())) {
+                    force_semicolon();
+                }
+                force_semicolon();
+            }
+            print(encoded);
+        },
+        print_template_string_chars: function(str) {
+            var encoded = encode_string(str, "`").replace(/\${/g, "\\${");
+            return print(encoded.substr(1, encoded.length - 2));
+        },
+        encode_string   : encode_string,
+        next_indent     : next_indent,
+        with_indent     : with_indent,
+        with_block      : with_block,
+        with_parens     : with_parens,
+        with_square     : with_square,
+        add_mapping     : add_mapping,
+        option          : function(opt) { return options[opt]; },
+        printed_comments: printed_comments,
+        prepend_comments: readonly ? noop : prepend_comments,
+        append_comments : readonly || comment_filter === return_false ? noop : append_comments,
+        line            : function() { return current_line; },
+        col             : function() { return current_col; },
+        pos             : function() { return current_pos; },
+        push_node       : function(node) { stack.push(node); },
+        pop_node        : function() { return stack.pop(); },
+        parent          : function(n) {
+            return stack[stack.length - 2 - (n || 0)];
+        }
+    };
+
+}
+
+/* -----[ code generators ]----- */
+
+(function() {
+
+    /* -----[ utils ]----- */
+
+    function DEFPRINT(nodetype, generator) {
+        nodetype.DEFMETHOD("_codegen", generator);
+    }
+
+    AST_Node.DEFMETHOD("print", function(output, force_parens) {
+        var self = this, generator = self._codegen;
+        if (self instanceof AST_Scope) {
+            output.active_scope = self;
+        } else if (!output.use_asm && self instanceof AST_Directive && self.value == "use asm") {
+            output.use_asm = output.active_scope;
+        }
+        function doit() {
+            output.prepend_comments(self);
+            self.add_source_map(output);
+            generator(self, output);
+            output.append_comments(self);
+        }
+        output.push_node(self);
+        if (force_parens || self.needs_parens(output)) {
+            output.with_parens(doit);
+        } else {
+            doit();
+        }
+        output.pop_node();
+        if (self === output.use_asm) {
+            output.use_asm = null;
+        }
+    });
+    AST_Node.DEFMETHOD("_print", AST_Node.prototype.print);
+
+    AST_Node.DEFMETHOD("print_to_string", function(options) {
+        var output = OutputStream(options);
+        this.print(output);
+        return output.get();
+    });
+
+    /* -----[ PARENTHESES ]----- */
+
+    function PARENS(nodetype, func) {
+        if (Array.isArray(nodetype)) {
+            nodetype.forEach(function(nodetype) {
+                PARENS(nodetype, func);
+            });
+        } else {
+            nodetype.DEFMETHOD("needs_parens", func);
+        }
+    }
+
+    PARENS(AST_Node, return_false);
+
+    // a function expression needs parens around it when it's provably
+    // the first token to appear in a statement.
+    PARENS(AST_Function, function(output) {
+        if (!output.has_parens() && first_in_statement(output)) {
+            return true;
+        }
+
+        if (output.option("webkit")) {
+            var p = output.parent();
+            if (p instanceof AST_PropAccess && p.expression === this) {
+                return true;
+            }
+        }
+
+        if (output.option("wrap_iife")) {
+            var p = output.parent();
+            if (p instanceof AST_Call && p.expression === this) {
+                return true;
+            }
+        }
+
+        if (output.option("wrap_func_args")) {
+            var p = output.parent();
+            if (p instanceof AST_Call && p.args.includes(this)) {
+                return true;
+            }
+        }
+
+        return false;
+    });
+
+    PARENS(AST_Arrow, function(output) {
+        var p = output.parent();
+
+        if (
+            output.option("wrap_func_args")
+            && p instanceof AST_Call
+            && p.args.includes(this)
+        ) {
+            return true;
+        }
+        return p instanceof AST_PropAccess && p.expression === this;
+    });
+
+    // same goes for an object literal (as in AST_Function), because
+    // otherwise {...} would be interpreted as a block of code.
+    PARENS(AST_Object, function(output) {
+        return !output.has_parens() && first_in_statement(output);
+    });
+
+    PARENS(AST_ClassExpression, first_in_statement);
+
+    PARENS(AST_Unary, function(output) {
+        var p = output.parent();
+        return p instanceof AST_PropAccess && p.expression === this
+            || p instanceof AST_Call && p.expression === this
+            || p instanceof AST_Binary
+                && p.operator === "**"
+                && this instanceof AST_UnaryPrefix
+                && p.left === this
+                && this.operator !== "++"
+                && this.operator !== "--";
+    });
+
+    PARENS(AST_Await, function(output) {
+        var p = output.parent();
+        return p instanceof AST_PropAccess && p.expression === this
+            || p instanceof AST_Call && p.expression === this
+            || p instanceof AST_Binary && p.operator === "**" && p.left === this
+            || output.option("safari10") && p instanceof AST_UnaryPrefix;
+    });
+
+    PARENS(AST_Sequence, function(output) {
+        var p = output.parent();
+        return p instanceof AST_Call                          // (foo, bar)() or foo(1, (2, 3), 4)
+            || p instanceof AST_Unary                         // !(foo, bar, baz)
+            || p instanceof AST_Binary                        // 1 + (2, 3) + 4 ==> 8
+            || p instanceof AST_VarDef                        // var a = (1, 2), b = a + a; ==> b == 4
+            || p instanceof AST_PropAccess                    // (1, {foo:2}).foo or (1, {foo:2})["foo"] ==> 2
+            || p instanceof AST_Array                         // [ 1, (2, 3), 4 ] ==> [ 1, 3, 4 ]
+            || p instanceof AST_ObjectProperty                // { foo: (1, 2) }.foo ==> 2
+            || p instanceof AST_Conditional                   /* (false, true) ? (a = 10, b = 20) : (c = 30)
+                                                               * ==> 20 (side effect, set a := 10 and b := 20) */
+            || p instanceof AST_Arrow                         // x => (x, x)
+            || p instanceof AST_DefaultAssign                 // x => (x = (0, function(){}))
+            || p instanceof AST_Expansion                     // [...(a, b)]
+            || p instanceof AST_ForOf && this === p.object    // for (e of (foo, bar)) {}
+            || p instanceof AST_Yield                         // yield (foo, bar)
+            || p instanceof AST_Export                        // export default (foo, bar)
+        ;
+    });
+
+    PARENS(AST_Binary, function(output) {
+        var p = output.parent();
+        // (foo && bar)()
+        if (p instanceof AST_Call && p.expression === this)
+            return true;
+        // typeof (foo && bar)
+        if (p instanceof AST_Unary)
+            return true;
+        // (foo && bar)["prop"], (foo && bar).prop
+        if (p instanceof AST_PropAccess && p.expression === this)
+            return true;
+        // this deals with precedence: 3 * (2 + 1)
+        if (p instanceof AST_Binary) {
+            const po = p.operator;
+            const so = this.operator;
+
+            if (so === "??" && (po === "||" || po === "&&")) {
+                return true;
+            }
+
+            if (po === "??" && (so === "||" || so === "&&")) {
+                return true;
+            }
+
+            const pp = PRECEDENCE[po];
+            const sp = PRECEDENCE[so];
+            if (pp > sp
+                || (pp == sp
+                    && (this === p.right || po == "**"))) {
+                return true;
+            }
+        }
+    });
+
+    PARENS(AST_Yield, function(output) {
+        var p = output.parent();
+        // (yield 1) + (yield 2)
+        // a = yield 3
+        if (p instanceof AST_Binary && p.operator !== "=")
+            return true;
+        // (yield 1)()
+        // new (yield 1)()
+        if (p instanceof AST_Call && p.expression === this)
+            return true;
+        // (yield 1) ? yield 2 : yield 3
+        if (p instanceof AST_Conditional && p.condition === this)
+            return true;
+        // -(yield 4)
+        if (p instanceof AST_Unary)
+            return true;
+        // (yield x).foo
+        // (yield x)['foo']
+        if (p instanceof AST_PropAccess && p.expression === this)
+            return true;
+    });
+
+    PARENS(AST_PropAccess, function(output) {
+        var p = output.parent();
+        if (p instanceof AST_New && p.expression === this) {
+            // i.e. new (foo.bar().baz)
+            //
+            // if there's one call into this subtree, then we need
+            // parens around it too, otherwise the call will be
+            // interpreted as passing the arguments to the upper New
+            // expression.
+            return walk(this, node => {
+                if (node instanceof AST_Scope) return true;
+                if (node instanceof AST_Call) {
+                    return walk_abort;  // makes walk() return true.
+                }
+            });
+        }
+    });
+
+    PARENS(AST_Call, function(output) {
+        var p = output.parent(), p1;
+        if (p instanceof AST_New && p.expression === this
+            || p instanceof AST_Export && p.is_default && this.expression instanceof AST_Function)
+            return true;
+
+        // workaround for Safari bug.
+        // https://bugs.webkit.org/show_bug.cgi?id=123506
+        return this.expression instanceof AST_Function
+            && p instanceof AST_PropAccess
+            && p.expression === this
+            && (p1 = output.parent(1)) instanceof AST_Assign
+            && p1.left === p;
+    });
+
+    PARENS(AST_New, function(output) {
+        var p = output.parent();
+        if (this.args.length === 0
+            && (p instanceof AST_PropAccess // (new Date).getTime(), (new Date)["getTime"]()
+                || p instanceof AST_Call && p.expression === this
+                || p instanceof AST_PrefixedTemplateString && p.prefix === this)) // (new foo)(bar)
+            return true;
+    });
+
+    PARENS(AST_Number, function(output) {
+        var p = output.parent();
+        if (p instanceof AST_PropAccess && p.expression === this) {
+            var value = this.getValue();
+            if (value < 0 || /^0/.test(make_num(value))) {
+                return true;
+            }
+        }
+    });
+
+    PARENS(AST_BigInt, function(output) {
+        var p = output.parent();
+        if (p instanceof AST_PropAccess && p.expression === this) {
+            var value = this.getValue();
+            if (value.startsWith("-")) {
+                return true;
+            }
+        }
+    });
+
+    PARENS([ AST_Assign, AST_Conditional ], function(output) {
+        var p = output.parent();
+        // !(a = false) → true
+        if (p instanceof AST_Unary)
+            return true;
+        // 1 + (a = 2) + 3 → 6, side effect setting a = 2
+        if (p instanceof AST_Binary && !(p instanceof AST_Assign))
+            return true;
+        // (a = func)() —or— new (a = Object)()
+        if (p instanceof AST_Call && p.expression === this)
+            return true;
+        // (a = foo) ? bar : baz
+        if (p instanceof AST_Conditional && p.condition === this)
+            return true;
+        // (a = foo)["prop"] —or— (a = foo).prop
+        if (p instanceof AST_PropAccess && p.expression === this)
+            return true;
+        // ({a, b} = {a: 1, b: 2}), a destructuring assignment
+        if (this instanceof AST_Assign && this.left instanceof AST_Destructuring && this.left.is_array === false)
+            return true;
+    });
+
+    /* -----[ PRINTERS ]----- */
+
+    DEFPRINT(AST_Directive, function(self, output) {
+        output.print_string(self.value, self.quote);
+        output.semicolon();
+    });
+
+    DEFPRINT(AST_Expansion, function (self, output) {
+        output.print("...");
+        self.expression.print(output);
+    });
+
+    DEFPRINT(AST_Destructuring, function (self, output) {
+        output.print(self.is_array ? "[" : "{");
+        var len = self.names.length;
+        self.names.forEach(function (name, i) {
+            if (i > 0) output.comma();
+            name.print(output);
+            // If the final element is a hole, we need to make sure it
+            // doesn't look like a trailing comma, by inserting an actual
+            // trailing comma.
+            if (i == len - 1 && name instanceof AST_Hole) output.comma();
+        });
+        output.print(self.is_array ? "]" : "}");
+    });
+
+    DEFPRINT(AST_Debugger, function(self, output) {
+        output.print("debugger");
+        output.semicolon();
+    });
+
+    /* -----[ statements ]----- */
+
+    function display_body(body, is_toplevel, output, allow_directives) {
+        var last = body.length - 1;
+        output.in_directive = allow_directives;
+        body.forEach(function(stmt, i) {
+            if (output.in_directive === true && !(stmt instanceof AST_Directive ||
+                stmt instanceof AST_EmptyStatement ||
+                (stmt instanceof AST_SimpleStatement && stmt.body instanceof AST_String)
+            )) {
+                output.in_directive = false;
+            }
+            if (!(stmt instanceof AST_EmptyStatement)) {
+                output.indent();
+                stmt.print(output);
+                if (!(i == last && is_toplevel)) {
+                    output.newline();
+                    if (is_toplevel) output.newline();
+                }
+            }
+            if (output.in_directive === true &&
+                stmt instanceof AST_SimpleStatement &&
+                stmt.body instanceof AST_String
+            ) {
+                output.in_directive = false;
+            }
+        });
+        output.in_directive = false;
+    }
+
+    AST_StatementWithBody.DEFMETHOD("_do_print_body", function(output) {
+        force_statement(this.body, output);
+    });
+
+    DEFPRINT(AST_Statement, function(self, output) {
+        self.body.print(output);
+        output.semicolon();
+    });
+    DEFPRINT(AST_Toplevel, function(self, output) {
+        display_body(self.body, true, output, true);
+        output.print("");
+    });
+    DEFPRINT(AST_LabeledStatement, function(self, output) {
+        self.label.print(output);
+        output.colon();
+        self.body.print(output);
+    });
+    DEFPRINT(AST_SimpleStatement, function(self, output) {
+        self.body.print(output);
+        output.semicolon();
+    });
+    function print_braced_empty(self, output) {
+        output.print("{");
+        output.with_indent(output.next_indent(), function() {
+            output.append_comments(self, true);
+        });
+        output.print("}");
+    }
+    function print_braced(self, output, allow_directives) {
+        if (self.body.length > 0) {
+            output.with_block(function() {
+                display_body(self.body, false, output, allow_directives);
+            });
+        } else print_braced_empty(self, output);
+    }
+    DEFPRINT(AST_BlockStatement, function(self, output) {
+        print_braced(self, output);
+    });
+    DEFPRINT(AST_EmptyStatement, function(self, output) {
+        output.semicolon();
+    });
+    DEFPRINT(AST_Do, function(self, output) {
+        output.print("do");
+        output.space();
+        make_block(self.body, output);
+        output.space();
+        output.print("while");
+        output.space();
+        output.with_parens(function() {
+            self.condition.print(output);
+        });
+        output.semicolon();
+    });
+    DEFPRINT(AST_While, function(self, output) {
+        output.print("while");
+        output.space();
+        output.with_parens(function() {
+            self.condition.print(output);
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_For, function(self, output) {
+        output.print("for");
+        output.space();
+        output.with_parens(function() {
+            if (self.init) {
+                if (self.init instanceof AST_Definitions) {
+                    self.init.print(output);
+                } else {
+                    parenthesize_for_noin(self.init, output, true);
+                }
+                output.print(";");
+                output.space();
+            } else {
+                output.print(";");
+            }
+            if (self.condition) {
+                self.condition.print(output);
+                output.print(";");
+                output.space();
+            } else {
+                output.print(";");
+            }
+            if (self.step) {
+                self.step.print(output);
+            }
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_ForIn, function(self, output) {
+        output.print("for");
+        if (self.await) {
+            output.space();
+            output.print("await");
+        }
+        output.space();
+        output.with_parens(function() {
+            self.init.print(output);
+            output.space();
+            output.print(self instanceof AST_ForOf ? "of" : "in");
+            output.space();
+            self.object.print(output);
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_With, function(self, output) {
+        output.print("with");
+        output.space();
+        output.with_parens(function() {
+            self.expression.print(output);
+        });
+        output.space();
+        self._do_print_body(output);
+    });
+
+    /* -----[ functions ]----- */
+    AST_Lambda.DEFMETHOD("_do_print", function(output, nokeyword) {
+        var self = this;
+        if (!nokeyword) {
+            if (self.async) {
+                output.print("async");
+                output.space();
+            }
+            output.print("function");
+            if (self.is_generator) {
+                output.star();
+            }
+            if (self.name) {
+                output.space();
+            }
+        }
+        if (self.name instanceof AST_Symbol) {
+            self.name.print(output);
+        } else if (nokeyword && self.name instanceof AST_Node) {
+            output.with_square(function() {
+                self.name.print(output); // Computed method name
+            });
+        }
+        output.with_parens(function() {
+            self.argnames.forEach(function(arg, i) {
+                if (i) output.comma();
+                arg.print(output);
+            });
+        });
+        output.space();
+        print_braced(self, output, true);
+    });
+    DEFPRINT(AST_Lambda, function(self, output) {
+        self._do_print(output);
+    });
+
+    DEFPRINT(AST_PrefixedTemplateString, function(self, output) {
+        var tag = self.prefix;
+        var parenthesize_tag = tag instanceof AST_Lambda
+            || tag instanceof AST_Binary
+            || tag instanceof AST_Conditional
+            || tag instanceof AST_Sequence
+            || tag instanceof AST_Unary
+            || tag instanceof AST_Dot && tag.expression instanceof AST_Object;
+        if (parenthesize_tag) output.print("(");
+        self.prefix.print(output);
+        if (parenthesize_tag) output.print(")");
+        self.template_string.print(output);
+    });
+    DEFPRINT(AST_TemplateString, function(self, output) {
+        var is_tagged = output.parent() instanceof AST_PrefixedTemplateString;
+
+        output.print("`");
+        for (var i = 0; i < self.segments.length; i++) {
+            if (!(self.segments[i] instanceof AST_TemplateSegment)) {
+                output.print("${");
+                self.segments[i].print(output);
+                output.print("}");
+            } else if (is_tagged) {
+                output.print(self.segments[i].raw);
+            } else {
+                output.print_template_string_chars(self.segments[i].value);
+            }
+        }
+        output.print("`");
+    });
+    DEFPRINT(AST_TemplateSegment, function(self, output) {
+        output.print_template_string_chars(self.value);
+    });
+
+    AST_Arrow.DEFMETHOD("_do_print", function(output) {
+        var self = this;
+        var parent = output.parent();
+        var needs_parens = (parent instanceof AST_Binary && !(parent instanceof AST_Assign)) ||
+            parent instanceof AST_Unary ||
+            (parent instanceof AST_Call && self === parent.expression);
+        if (needs_parens) { output.print("("); }
+        if (self.async) {
+            output.print("async");
+            output.space();
+        }
+        if (self.argnames.length === 1 && self.argnames[0] instanceof AST_Symbol) {
+            self.argnames[0].print(output);
+        } else {
+            output.with_parens(function() {
+                self.argnames.forEach(function(arg, i) {
+                    if (i) output.comma();
+                    arg.print(output);
+                });
+            });
+        }
+        output.space();
+        output.print("=>");
+        output.space();
+        const first_statement = self.body[0];
+        if (
+            self.body.length === 1
+            && first_statement instanceof AST_Return
+        ) {
+            const returned = first_statement.value;
+            if (!returned) {
+                output.print("{}");
+            } else if (left_is_object(returned)) {
+                output.print("(");
+                returned.print(output);
+                output.print(")");
+            } else {
+                returned.print(output);
+            }
+        } else {
+            print_braced(self, output);
+        }
+        if (needs_parens) { output.print(")"); }
+    });
+
+    /* -----[ exits ]----- */
+    AST_Exit.DEFMETHOD("_do_print", function(output, kind) {
+        output.print(kind);
+        if (this.value) {
+            output.space();
+            const comments = this.value.start.comments_before;
+            if (comments && comments.length && !output.printed_comments.has(comments)) {
+                output.print("(");
+                this.value.print(output);
+                output.print(")");
+            } else {
+                this.value.print(output);
+            }
+        }
+        output.semicolon();
+    });
+    DEFPRINT(AST_Return, function(self, output) {
+        self._do_print(output, "return");
+    });
+    DEFPRINT(AST_Throw, function(self, output) {
+        self._do_print(output, "throw");
+    });
+
+    /* -----[ yield ]----- */
+
+    DEFPRINT(AST_Yield, function(self, output) {
+        var star = self.is_star ? "*" : "";
+        output.print("yield" + star);
+        if (self.expression) {
+            output.space();
+            self.expression.print(output);
+        }
+    });
+
+    DEFPRINT(AST_Await, function(self, output) {
+        output.print("await");
+        output.space();
+        var e = self.expression;
+        var parens = !(
+               e instanceof AST_Call
+            || e instanceof AST_SymbolRef
+            || e instanceof AST_PropAccess
+            || e instanceof AST_Unary
+            || e instanceof AST_Constant
+            || e instanceof AST_Await
+            || e instanceof AST_Object
+        );
+        if (parens) output.print("(");
+        self.expression.print(output);
+        if (parens) output.print(")");
+    });
+
+    /* -----[ loop control ]----- */
+    AST_LoopControl.DEFMETHOD("_do_print", function(output, kind) {
+        output.print(kind);
+        if (this.label) {
+            output.space();
+            this.label.print(output);
+        }
+        output.semicolon();
+    });
+    DEFPRINT(AST_Break, function(self, output) {
+        self._do_print(output, "break");
+    });
+    DEFPRINT(AST_Continue, function(self, output) {
+        self._do_print(output, "continue");
+    });
+
+    /* -----[ if ]----- */
+    function make_then(self, output) {
+        var b = self.body;
+        if (output.option("braces")
+            || output.option("ie8") && b instanceof AST_Do)
+            return make_block(b, output);
+        // The squeezer replaces "block"-s that contain only a single
+        // statement with the statement itself; technically, the AST
+        // is correct, but this can create problems when we output an
+        // IF having an ELSE clause where the THEN clause ends in an
+        // IF *without* an ELSE block (then the outer ELSE would refer
+        // to the inner IF).  This function checks for this case and
+        // adds the block braces if needed.
+        if (!b) return output.force_semicolon();
+        while (true) {
+            if (b instanceof AST_If) {
+                if (!b.alternative) {
+                    make_block(self.body, output);
+                    return;
+                }
+                b = b.alternative;
+            } else if (b instanceof AST_StatementWithBody) {
+                b = b.body;
+            } else break;
+        }
+        force_statement(self.body, output);
+    }
+    DEFPRINT(AST_If, function(self, output) {
+        output.print("if");
+        output.space();
+        output.with_parens(function() {
+            self.condition.print(output);
+        });
+        output.space();
+        if (self.alternative) {
+            make_then(self, output);
+            output.space();
+            output.print("else");
+            output.space();
+            if (self.alternative instanceof AST_If)
+                self.alternative.print(output);
+            else
+                force_statement(self.alternative, output);
+        } else {
+            self._do_print_body(output);
+        }
+    });
+
+    /* -----[ switch ]----- */
+    DEFPRINT(AST_Switch, function(self, output) {
+        output.print("switch");
+        output.space();
+        output.with_parens(function() {
+            self.expression.print(output);
+        });
+        output.space();
+        var last = self.body.length - 1;
+        if (last < 0) print_braced_empty(self, output);
+        else output.with_block(function() {
+            self.body.forEach(function(branch, i) {
+                output.indent(true);
+                branch.print(output);
+                if (i < last && branch.body.length > 0)
+                    output.newline();
+            });
+        });
+    });
+    AST_SwitchBranch.DEFMETHOD("_do_print_body", function(output) {
+        output.newline();
+        this.body.forEach(function(stmt) {
+            output.indent();
+            stmt.print(output);
+            output.newline();
+        });
+    });
+    DEFPRINT(AST_Default, function(self, output) {
+        output.print("default:");
+        self._do_print_body(output);
+    });
+    DEFPRINT(AST_Case, function(self, output) {
+        output.print("case");
+        output.space();
+        self.expression.print(output);
+        output.print(":");
+        self._do_print_body(output);
+    });
+
+    /* -----[ exceptions ]----- */
+    DEFPRINT(AST_Try, function(self, output) {
+        output.print("try");
+        output.space();
+        print_braced(self, output);
+        if (self.bcatch) {
+            output.space();
+            self.bcatch.print(output);
+        }
+        if (self.bfinally) {
+            output.space();
+            self.bfinally.print(output);
+        }
+    });
+    DEFPRINT(AST_Catch, function(self, output) {
+        output.print("catch");
+        if (self.argname) {
+            output.space();
+            output.with_parens(function() {
+                self.argname.print(output);
+            });
+        }
+        output.space();
+        print_braced(self, output);
+    });
+    DEFPRINT(AST_Finally, function(self, output) {
+        output.print("finally");
+        output.space();
+        print_braced(self, output);
+    });
+
+    /* -----[ var/const ]----- */
+    AST_Definitions.DEFMETHOD("_do_print", function(output, kind) {
+        output.print(kind);
+        output.space();
+        this.definitions.forEach(function(def, i) {
+            if (i) output.comma();
+            def.print(output);
+        });
+        var p = output.parent();
+        var in_for = p instanceof AST_For || p instanceof AST_ForIn;
+        var output_semicolon = !in_for || p && p.init !== this;
+        if (output_semicolon)
+            output.semicolon();
+    });
+    DEFPRINT(AST_Let, function(self, output) {
+        self._do_print(output, "let");
+    });
+    DEFPRINT(AST_Var, function(self, output) {
+        self._do_print(output, "var");
+    });
+    DEFPRINT(AST_Const, function(self, output) {
+        self._do_print(output, "const");
+    });
+    DEFPRINT(AST_Import, function(self, output) {
+        output.print("import");
+        output.space();
+        if (self.imported_name) {
+            self.imported_name.print(output);
+        }
+        if (self.imported_name && self.imported_names) {
+            output.print(",");
+            output.space();
+        }
+        if (self.imported_names) {
+            if (self.imported_names.length === 1 && self.imported_names[0].foreign_name.name === "*") {
+                self.imported_names[0].print(output);
+            } else {
+                output.print("{");
+                self.imported_names.forEach(function (name_import, i) {
+                    output.space();
+                    name_import.print(output);
+                    if (i < self.imported_names.length - 1) {
+                        output.print(",");
+                    }
+                });
+                output.space();
+                output.print("}");
+            }
+        }
+        if (self.imported_name || self.imported_names) {
+            output.space();
+            output.print("from");
+            output.space();
+        }
+        self.module_name.print(output);
+        if (self.assert_clause) {
+            output.print("assert");
+            self.assert_clause.print(output);
+        }
+        output.semicolon();
+    });
+    DEFPRINT(AST_ImportMeta, function(self, output) {
+        output.print("import.meta");
+    });
+
+    DEFPRINT(AST_NameMapping, function(self, output) {
+        var is_import = output.parent() instanceof AST_Import;
+        var definition = self.name.definition();
+        var names_are_different =
+            (definition && definition.mangled_name || self.name.name) !==
+            self.foreign_name.name;
+        if (names_are_different) {
+            if (is_import) {
+                output.print(self.foreign_name.name);
+            } else {
+                self.name.print(output);
+            }
+            output.space();
+            output.print("as");
+            output.space();
+            if (is_import) {
+                self.name.print(output);
+            } else {
+                output.print(self.foreign_name.name);
+            }
+        } else {
+            self.name.print(output);
+        }
+    });
+
+    DEFPRINT(AST_Export, function(self, output) {
+        output.print("export");
+        output.space();
+        if (self.is_default) {
+            output.print("default");
+            output.space();
+        }
+        if (self.exported_names) {
+            if (self.exported_names.length === 1 && self.exported_names[0].name.name === "*") {
+                self.exported_names[0].print(output);
+            } else {
+                output.print("{");
+                self.exported_names.forEach(function(name_export, i) {
+                    output.space();
+                    name_export.print(output);
+                    if (i < self.exported_names.length - 1) {
+                        output.print(",");
+                    }
+                });
+                output.space();
+                output.print("}");
+            }
+        } else if (self.exported_value) {
+            self.exported_value.print(output);
+        } else if (self.exported_definition) {
+            self.exported_definition.print(output);
+            if (self.exported_definition instanceof AST_Definitions) return;
+        }
+        if (self.module_name) {
+            output.space();
+            output.print("from");
+            output.space();
+            self.module_name.print(output);
+        }
+        if (self.assert_clause) {
+            output.print("assert");
+            self.assert_clause.print(output);
+        }
+        if (self.exported_value
+                && !(self.exported_value instanceof AST_Defun ||
+                    self.exported_value instanceof AST_Function ||
+                    self.exported_value instanceof AST_Class)
+            || self.module_name
+            || self.exported_names
+        ) {
+            output.semicolon();
+        }
+    });
+
+    function parenthesize_for_noin(node, output, noin) {
+        var parens = false;
+        // need to take some precautions here:
+        //    https://github.com/mishoo/UglifyJS2/issues/60
+        if (noin) {
+            parens = walk(node, node => {
+                // Don't go into scopes -- except arrow functions:
+                // https://github.com/terser/terser/issues/1019#issuecomment-877642607
+                if (node instanceof AST_Scope && !(node instanceof AST_Arrow)) {
+                    return true;
+                }
+                if (node instanceof AST_Binary && node.operator == "in") {
+                    return walk_abort;  // makes walk() return true
+                }
+            });
+        }
+        node.print(output, parens);
+    }
+
+    DEFPRINT(AST_VarDef, function(self, output) {
+        self.name.print(output);
+        if (self.value) {
+            output.space();
+            output.print("=");
+            output.space();
+            var p = output.parent(1);
+            var noin = p instanceof AST_For || p instanceof AST_ForIn;
+            parenthesize_for_noin(self.value, output, noin);
+        }
+    });
+
+    /* -----[ other expressions ]----- */
+    DEFPRINT(AST_Call, function(self, output) {
+        self.expression.print(output);
+        if (self instanceof AST_New && self.args.length === 0)
+            return;
+        if (self.expression instanceof AST_Call || self.expression instanceof AST_Lambda) {
+            output.add_mapping(self.start);
+        }
+        if (self.optional) output.print("?.");
+        output.with_parens(function() {
+            self.args.forEach(function(expr, i) {
+                if (i) output.comma();
+                expr.print(output);
+            });
+        });
+    });
+    DEFPRINT(AST_New, function(self, output) {
+        output.print("new");
+        output.space();
+        AST_Call.prototype._codegen(self, output);
+    });
+
+    AST_Sequence.DEFMETHOD("_do_print", function(output) {
+        this.expressions.forEach(function(node, index) {
+            if (index > 0) {
+                output.comma();
+                if (output.should_break()) {
+                    output.newline();
+                    output.indent();
+                }
+            }
+            node.print(output);
+        });
+    });
+    DEFPRINT(AST_Sequence, function(self, output) {
+        self._do_print(output);
+        // var p = output.parent();
+        // if (p instanceof AST_Statement) {
+        //     output.with_indent(output.next_indent(), function(){
+        //         self._do_print(output);
+        //     });
+        // } else {
+        //     self._do_print(output);
+        // }
+    });
+    DEFPRINT(AST_Dot, function(self, output) {
+        var expr = self.expression;
+        expr.print(output);
+        var prop = self.property;
+        var print_computed = ALL_RESERVED_WORDS.has(prop)
+            ? output.option("ie8")
+            : !is_identifier_string(
+                prop,
+                output.option("ecma") >= 2015 || output.option("safari10")
+            );
+
+        if (self.optional) output.print("?.");
+
+        if (print_computed) {
+            output.print("[");
+            output.add_mapping(self.end);
+            output.print_string(prop);
+            output.print("]");
+        } else {
+            if (expr instanceof AST_Number && expr.getValue() >= 0) {
+                if (!/[xa-f.)]/i.test(output.last())) {
+                    output.print(".");
+                }
+            }
+            if (!self.optional) output.print(".");
+            // the name after dot would be mapped about here.
+            output.add_mapping(self.end);
+            output.print_name(prop);
+        }
+    });
+    DEFPRINT(AST_DotHash, function(self, output) {
+        var expr = self.expression;
+        expr.print(output);
+        var prop = self.property;
+
+        if (self.optional) output.print("?");
+        output.print(".#");
+        output.add_mapping(self.end);
+        output.print_name(prop);
+    });
+    DEFPRINT(AST_Sub, function(self, output) {
+        self.expression.print(output);
+        if (self.optional) output.print("?.");
+        output.print("[");
+        self.property.print(output);
+        output.print("]");
+    });
+    DEFPRINT(AST_Chain, function(self, output) {
+        self.expression.print(output);
+    });
+    DEFPRINT(AST_UnaryPrefix, function(self, output) {
+        var op = self.operator;
+        output.print(op);
+        if (/^[a-z]/i.test(op)
+            || (/[+-]$/.test(op)
+                && self.expression instanceof AST_UnaryPrefix
+                && /^[+-]/.test(self.expression.operator))) {
+            output.space();
+        }
+        self.expression.print(output);
+    });
+    DEFPRINT(AST_UnaryPostfix, function(self, output) {
+        self.expression.print(output);
+        output.print(self.operator);
+    });
+    DEFPRINT(AST_Binary, function(self, output) {
+        var op = self.operator;
+        self.left.print(output);
+        if (op[0] == ">" /* ">>" ">>>" ">" ">=" */
+            && self.left instanceof AST_UnaryPostfix
+            && self.left.operator == "--") {
+            // space is mandatory to avoid outputting -->
+            output.print(" ");
+        } else {
+            // the space is optional depending on "beautify"
+            output.space();
+        }
+        output.print(op);
+        if ((op == "<" || op == "<<")
+            && self.right instanceof AST_UnaryPrefix
+            && self.right.operator == "!"
+            && self.right.expression instanceof AST_UnaryPrefix
+            && self.right.expression.operator == "--") {
+            // space is mandatory to avoid outputting <!--
+            output.print(" ");
+        } else {
+            // the space is optional depending on "beautify"
+            output.space();
+        }
+        self.right.print(output);
+    });
+    DEFPRINT(AST_Conditional, function(self, output) {
+        self.condition.print(output);
+        output.space();
+        output.print("?");
+        output.space();
+        self.consequent.print(output);
+        output.space();
+        output.colon();
+        self.alternative.print(output);
+    });
+
+    /* -----[ literals ]----- */
+    DEFPRINT(AST_Array, function(self, output) {
+        output.with_square(function() {
+            var a = self.elements, len = a.length;
+            if (len > 0) output.space();
+            a.forEach(function(exp, i) {
+                if (i) output.comma();
+                exp.print(output);
+                // If the final element is a hole, we need to make sure it
+                // doesn't look like a trailing comma, by inserting an actual
+                // trailing comma.
+                if (i === len - 1 && exp instanceof AST_Hole)
+                  output.comma();
+            });
+            if (len > 0) output.space();
+        });
+    });
+    DEFPRINT(AST_Object, function(self, output) {
+        if (self.properties.length > 0) output.with_block(function() {
+            self.properties.forEach(function(prop, i) {
+                if (i) {
+                    output.print(",");
+                    output.newline();
+                }
+                output.indent();
+                prop.print(output);
+            });
+            output.newline();
+        });
+        else print_braced_empty(self, output);
+    });
+    DEFPRINT(AST_Class, function(self, output) {
+        output.print("class");
+        output.space();
+        if (self.name) {
+            self.name.print(output);
+            output.space();
+        }
+        if (self.extends) {
+            var parens = (
+                   !(self.extends instanceof AST_SymbolRef)
+                && !(self.extends instanceof AST_PropAccess)
+                && !(self.extends instanceof AST_ClassExpression)
+                && !(self.extends instanceof AST_Function)
+            );
+            output.print("extends");
+            if (parens) {
+                output.print("(");
+            } else {
+                output.space();
+            }
+            self.extends.print(output);
+            if (parens) {
+                output.print(")");
+            } else {
+                output.space();
+            }
+        }
+        if (self.properties.length > 0) output.with_block(function() {
+            self.properties.forEach(function(prop, i) {
+                if (i) {
+                    output.newline();
+                }
+                output.indent();
+                prop.print(output);
+            });
+            output.newline();
+        });
+        else output.print("{}");
+    });
+    DEFPRINT(AST_NewTarget, function(self, output) {
+        output.print("new.target");
+    });
+
+    function print_property_name(key, quote, output) {
+        if (output.option("quote_keys")) {
+            return output.print_string(key);
+        }
+        if ("" + +key == key && key >= 0) {
+            if (output.option("keep_numbers")) {
+                return output.print(key);
+            }
+            return output.print(make_num(key));
+        }
+        var print_string = ALL_RESERVED_WORDS.has(key)
+            ? output.option("ie8")
+            : (
+                output.option("ecma") < 2015 || output.option("safari10")
+                    ? !is_basic_identifier_string(key)
+                    : !is_identifier_string(key, true)
+            );
+        if (print_string || (quote && output.option("keep_quoted_props"))) {
+            return output.print_string(key, quote);
+        }
+        return output.print_name(key);
+    }
+
+    DEFPRINT(AST_ObjectKeyVal, function(self, output) {
+        function get_name(self) {
+            var def = self.definition();
+            return def ? def.mangled_name || def.name : self.name;
+        }
+
+        var allowShortHand = output.option("shorthand");
+        if (allowShortHand &&
+            self.value instanceof AST_Symbol &&
+            is_identifier_string(
+                self.key,
+                output.option("ecma") >= 2015 || output.option("safari10")
+            ) &&
+            get_name(self.value) === self.key &&
+            !ALL_RESERVED_WORDS.has(self.key)
+        ) {
+            print_property_name(self.key, self.quote, output);
+
+        } else if (allowShortHand &&
+            self.value instanceof AST_DefaultAssign &&
+            self.value.left instanceof AST_Symbol &&
+            is_identifier_string(
+                self.key,
+                output.option("ecma") >= 2015 || output.option("safari10")
+            ) &&
+            get_name(self.value.left) === self.key
+        ) {
+            print_property_name(self.key, self.quote, output);
+            output.space();
+            output.print("=");
+            output.space();
+            self.value.right.print(output);
+        } else {
+            if (!(self.key instanceof AST_Node)) {
+                print_property_name(self.key, self.quote, output);
+            } else {
+                output.with_square(function() {
+                    self.key.print(output);
+                });
+            }
+            output.colon();
+            self.value.print(output);
+        }
+    });
+    DEFPRINT(AST_ClassPrivateProperty, (self, output) => {
+        if (self.static) {
+            output.print("static");
+            output.space();
+        }
+
+        output.print("#");
+        
+        print_property_name(self.key.name, self.quote, output);
+
+        if (self.value) {
+            output.print("=");
+            self.value.print(output);
+        }
+
+        output.semicolon();
+    });
+    DEFPRINT(AST_ClassProperty, (self, output) => {
+        if (self.static) {
+            output.print("static");
+            output.space();
+        }
+
+        if (self.key instanceof AST_SymbolClassProperty) {
+            print_property_name(self.key.name, self.quote, output);
+        } else {
+            output.print("[");
+            self.key.print(output);
+            output.print("]");
+        }
+
+        if (self.value) {
+            output.print("=");
+            self.value.print(output);
+        }
+
+        output.semicolon();
+    });
+    AST_ObjectProperty.DEFMETHOD("_print_getter_setter", function(type, is_private, output) {
+        var self = this;
+        if (self.static) {
+            output.print("static");
+            output.space();
+        }
+        if (type) {
+            output.print(type);
+            output.space();
+        }
+        if (self.key instanceof AST_SymbolMethod) {
+            if (is_private) output.print("#");
+            print_property_name(self.key.name, self.quote, output);
+        } else {
+            output.with_square(function() {
+                self.key.print(output);
+            });
+        }
+        self.value._do_print(output, true);
+    });
+    DEFPRINT(AST_ObjectSetter, function(self, output) {
+        self._print_getter_setter("set", false, output);
+    });
+    DEFPRINT(AST_ObjectGetter, function(self, output) {
+        self._print_getter_setter("get", false, output);
+    });
+    DEFPRINT(AST_PrivateSetter, function(self, output) {
+        self._print_getter_setter("set", true, output);
+    });
+    DEFPRINT(AST_PrivateGetter, function(self, output) {
+        self._print_getter_setter("get", true, output);
+    });
+    DEFPRINT(AST_PrivateMethod, function(self, output) {
+        var type;
+        if (self.is_generator && self.async) {
+            type = "async*";
+        } else if (self.is_generator) {
+            type = "*";
+        } else if (self.async) {
+            type = "async";
+        }
+        self._print_getter_setter(type, true, output);
+    });
+    DEFPRINT(AST_ConciseMethod, function(self, output) {
+        var type;
+        if (self.is_generator && self.async) {
+            type = "async*";
+        } else if (self.is_generator) {
+            type = "*";
+        } else if (self.async) {
+            type = "async";
+        }
+        self._print_getter_setter(type, false, output);
+    });
+    AST_Symbol.DEFMETHOD("_do_print", function(output) {
+        var def = this.definition();
+        output.print_name(def ? def.mangled_name || def.name : this.name);
+    });
+    DEFPRINT(AST_Symbol, function (self, output) {
+        self._do_print(output);
+    });
+    DEFPRINT(AST_Hole, noop);
+    DEFPRINT(AST_This, function(self, output) {
+        output.print("this");
+    });
+    DEFPRINT(AST_Super, function(self, output) {
+        output.print("super");
+    });
+    DEFPRINT(AST_Constant, function(self, output) {
+        output.print(self.getValue());
+    });
+    DEFPRINT(AST_String, function(self, output) {
+        output.print_string(self.getValue(), self.quote, output.in_directive);
+    });
+    DEFPRINT(AST_Number, function(self, output) {
+        if ((output.option("keep_numbers") || output.use_asm) && self.raw) {
+            output.print(self.raw);
+        } else {
+            output.print(make_num(self.getValue()));
+        }
+    });
+    DEFPRINT(AST_BigInt, function(self, output) {
+        output.print(self.getValue() + "n");
+    });
+
+    const r_slash_script = /(<\s*\/\s*script)/i;
+    const slash_script_replace = (_, $1) => $1.replace("/", "\\/");
+    DEFPRINT(AST_RegExp, function(self, output) {
+        let { source, flags } = self.getValue();
+        source = regexp_source_fix(source);
+        flags = flags ? sort_regexp_flags(flags) : "";
+        source = source.replace(r_slash_script, slash_script_replace);
+
+        output.print(output.to_utf8(`/${source}/${flags}`, false, true));
+
+        const parent = output.parent();
+        if (
+            parent instanceof AST_Binary
+            && /^\w/.test(parent.operator)
+            && parent.left === self
+        ) {
+            output.print(" ");
+        }
+    });
+
+    function force_statement(stat, output) {
+        if (output.option("braces")) {
+            make_block(stat, output);
+        } else {
+            if (!stat || stat instanceof AST_EmptyStatement)
+                output.force_semicolon();
+            else
+                stat.print(output);
+        }
+    }
+
+    function best_of(a) {
+        var best = a[0], len = best.length;
+        for (var i = 1; i < a.length; ++i) {
+            if (a[i].length < len) {
+                best = a[i];
+                len = best.length;
+            }
+        }
+        return best;
+    }
+
+    function make_num(num) {
+        var str = num.toString(10).replace(/^0\./, ".").replace("e+", "e");
+        var candidates = [ str ];
+        if (Math.floor(num) === num) {
+            if (num < 0) {
+                candidates.push("-0x" + (-num).toString(16).toLowerCase());
+            } else {
+                candidates.push("0x" + num.toString(16).toLowerCase());
+            }
+        }
+        var match, len, digits;
+        if (match = /^\.0+/.exec(str)) {
+            len = match[0].length;
+            digits = str.slice(len);
+            candidates.push(digits + "e-" + (digits.length + len - 1));
+        } else if (match = /0+$/.exec(str)) {
+            len = match[0].length;
+            candidates.push(str.slice(0, -len) + "e" + len);
+        } else if (match = /^(\d)\.(\d+)e(-?\d+)$/.exec(str)) {
+            candidates.push(match[1] + match[2] + "e" + (match[3] - match[2].length));
+        }
+        return best_of(candidates);
+    }
+
+    function make_block(stmt, output) {
+        if (!stmt || stmt instanceof AST_EmptyStatement)
+            output.print("{}");
+        else if (stmt instanceof AST_BlockStatement)
+            stmt.print(output);
+        else output.with_block(function() {
+            output.indent();
+            stmt.print(output);
+            output.newline();
+        });
+    }
+
+    /* -----[ source map generators ]----- */
+
+    function DEFMAP(nodetype, generator) {
+        nodetype.forEach(function(nodetype) {
+            nodetype.DEFMETHOD("add_source_map", generator);
+        });
+    }
+
+    DEFMAP([
+        // We could easily add info for ALL nodes, but it seems to me that
+        // would be quite wasteful, hence this noop in the base class.
+        AST_Node,
+        // since the label symbol will mark it
+        AST_LabeledStatement,
+        AST_Toplevel,
+    ], noop);
+
+    // XXX: I'm not exactly sure if we need it for all of these nodes,
+    // or if we should add even more.
+    DEFMAP([
+        AST_Array,
+        AST_BlockStatement,
+        AST_Catch,
+        AST_Class,
+        AST_Constant,
+        AST_Debugger,
+        AST_Definitions,
+        AST_Directive,
+        AST_Finally,
+        AST_Jump,
+        AST_Lambda,
+        AST_New,
+        AST_Object,
+        AST_StatementWithBody,
+        AST_Symbol,
+        AST_Switch,
+        AST_SwitchBranch,
+        AST_TemplateString,
+        AST_TemplateSegment,
+        AST_Try,
+    ], function(output) {
+        output.add_mapping(this.start);
+    });
+
+    DEFMAP([
+        AST_ObjectGetter,
+        AST_ObjectSetter,
+        AST_PrivateGetter,
+        AST_PrivateSetter,
+    ], function(output) {
+        output.add_mapping(this.key.end, this.key.name);
+    });
+
+    DEFMAP([ AST_ObjectProperty ], function(output) {
+        output.add_mapping(this.start, this.key);
+    });
+})();
+
+export {
+    OutputStream,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/parse.js b/node_modules/mathjs/examples/node_modules/terser/lib/parse.js
new file mode 100644
index 0000000..5b52d6d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/parse.js
@@ -0,0 +1,3362 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+    Parser based on parse-js (http://marijn.haverbeke.nl/parse-js/).
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+
+import {
+    characters,
+    defaults,
+    makePredicate,
+    set_annotation,
+} from "./utils/index.js";
+import {
+    AST_Accessor,
+    AST_Array,
+    AST_Arrow,
+    AST_Assign,
+    AST_Await,
+    AST_BigInt,
+    AST_Binary,
+    AST_BlockStatement,
+    AST_Break,
+    AST_Call,
+    AST_Case,
+    AST_Catch,
+    AST_Chain,
+    AST_ClassExpression,
+    AST_ClassPrivateProperty,
+    AST_ClassProperty,
+    AST_ConciseMethod,
+    AST_PrivateGetter,
+    AST_PrivateMethod,
+    AST_PrivateSetter,
+    AST_Conditional,
+    AST_Const,
+    AST_Continue,
+    AST_Debugger,
+    AST_Default,
+    AST_DefaultAssign,
+    AST_DefClass,
+    AST_Definitions,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Do,
+    AST_Dot,
+    AST_DotHash,
+    AST_EmptyStatement,
+    AST_Expansion,
+    AST_Export,
+    AST_False,
+    AST_Finally,
+    AST_For,
+    AST_ForIn,
+    AST_ForOf,
+    AST_Function,
+    AST_Hole,
+    AST_If,
+    AST_Import,
+    AST_ImportMeta,
+    AST_IterationStatement,
+    AST_Label,
+    AST_LabeledStatement,
+    AST_LabelRef,
+    AST_Let,
+    AST_NameMapping,
+    AST_New,
+    AST_NewTarget,
+    AST_Node,
+    AST_Null,
+    AST_Number,
+    AST_Object,
+    AST_ObjectGetter,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_ObjectSetter,
+    AST_PrefixedTemplateString,
+    AST_PropAccess,
+    AST_RegExp,
+    AST_Return,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_String,
+    AST_Sub,
+    AST_Super,
+    AST_Switch,
+    AST_SymbolCatch,
+    AST_SymbolClass,
+    AST_SymbolClassProperty,
+    AST_SymbolConst,
+    AST_SymbolDeclaration,
+    AST_SymbolDefClass,
+    AST_SymbolDefun,
+    AST_SymbolExport,
+    AST_SymbolExportForeign,
+    AST_SymbolFunarg,
+    AST_SymbolImport,
+    AST_SymbolImportForeign,
+    AST_SymbolLambda,
+    AST_SymbolLet,
+    AST_SymbolMethod,
+    AST_SymbolRef,
+    AST_SymbolVar,
+    AST_TemplateSegment,
+    AST_TemplateString,
+    AST_This,
+    AST_Throw,
+    AST_Token,
+    AST_Toplevel,
+    AST_True,
+    AST_Try,
+    AST_UnaryPostfix,
+    AST_UnaryPrefix,
+    AST_Var,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield,
+    _INLINE,
+    _NOINLINE,
+    _PURE
+} from "./ast.js";
+
+var LATEST_RAW = "";  // Only used for numbers and template strings
+var LATEST_TEMPLATE_END = true;
+
+var KEYWORDS = "break case catch class const continue debugger default delete do else export extends finally for function if in instanceof let new return switch throw try typeof var void while with";
+var KEYWORDS_ATOM = "false null true";
+var RESERVED_WORDS = "enum import super this " + KEYWORDS_ATOM + " " + KEYWORDS;
+var ALL_RESERVED_WORDS = "implements interface package private protected public static " + RESERVED_WORDS;
+var KEYWORDS_BEFORE_EXPRESSION = "return new delete throw else case yield await";
+
+KEYWORDS = makePredicate(KEYWORDS);
+RESERVED_WORDS = makePredicate(RESERVED_WORDS);
+KEYWORDS_BEFORE_EXPRESSION = makePredicate(KEYWORDS_BEFORE_EXPRESSION);
+KEYWORDS_ATOM = makePredicate(KEYWORDS_ATOM);
+ALL_RESERVED_WORDS = makePredicate(ALL_RESERVED_WORDS);
+
+var OPERATOR_CHARS = makePredicate(characters("+-*&%=<>!?|~^"));
+
+var RE_NUM_LITERAL = /[0-9a-f]/i;
+var RE_HEX_NUMBER = /^0x[0-9a-f]+$/i;
+var RE_OCT_NUMBER = /^0[0-7]+$/;
+var RE_ES6_OCT_NUMBER = /^0o[0-7]+$/i;
+var RE_BIN_NUMBER = /^0b[01]+$/i;
+var RE_DEC_NUMBER = /^\d*\.?\d*(?:e[+-]?\d*(?:\d\.?|\.?\d)\d*)?$/i;
+var RE_BIG_INT = /^(0[xob])?[0-9a-f]+n$/i;
+
+var OPERATORS = makePredicate([
+    "in",
+    "instanceof",
+    "typeof",
+    "new",
+    "void",
+    "delete",
+    "++",
+    "--",
+    "+",
+    "-",
+    "!",
+    "~",
+    "&",
+    "|",
+    "^",
+    "*",
+    "**",
+    "/",
+    "%",
+    ">>",
+    "<<",
+    ">>>",
+    "<",
+    ">",
+    "<=",
+    ">=",
+    "==",
+    "===",
+    "!=",
+    "!==",
+    "?",
+    "=",
+    "+=",
+    "-=",
+    "||=",
+    "&&=",
+    "??=",
+    "/=",
+    "*=",
+    "**=",
+    "%=",
+    ">>=",
+    "<<=",
+    ">>>=",
+    "|=",
+    "^=",
+    "&=",
+    "&&",
+    "??",
+    "||",
+]);
+
+var WHITESPACE_CHARS = makePredicate(characters(" \u00a0\n\r\t\f\u000b\u200b\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u2028\u2029\u202f\u205f\u3000\uFEFF"));
+
+var NEWLINE_CHARS = makePredicate(characters("\n\r\u2028\u2029"));
+
+var PUNC_AFTER_EXPRESSION = makePredicate(characters(";]),:"));
+
+var PUNC_BEFORE_EXPRESSION = makePredicate(characters("[{(,;:"));
+
+var PUNC_CHARS = makePredicate(characters("[]{}(),;:"));
+
+/* -----[ Tokenizer ]----- */
+
+// surrogate safe regexps adapted from https://github.com/mathiasbynens/unicode-8.0.0/tree/89b412d8a71ecca9ed593d9e9fa073ab64acfebe/Binary_Property
+var UNICODE = {
+    ID_Start: /[$A-Z_a-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\u0561-\u0587\u05D0-\u05EA\u05F0-\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\u08A0-\u08B4\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\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\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\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\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\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\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\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\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\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-\uAB65\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\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\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-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\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[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDF00-\uDF19]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\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]|\uD83A[\uDC00-\uDCC4]|\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-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]/,
+    ID_Continue: /(?:[$0-9A-Z_a-z\xAA\xB5\xB7\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B4\u08E3-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0AF9\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58-\u0C5A\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D5F-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\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\u135D-\u135F\u1369-\u1371\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19DA\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\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\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA8FD\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2F\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\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\uDD40-\uDD74\uDDFD\uDE80-\uDE9C\uDEA0-\uDED0\uDEE0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF7A\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCA0-\uDCA9\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\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-\uDE03\uDE05\uDE06\uDE0C-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE38-\uDE3A\uDE3F\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE6\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC00-\uDC46\uDC66-\uDC6F\uDC7F-\uDCBA\uDCD0-\uDCE8\uDCF0-\uDCF9\uDD00-\uDD34\uDD36-\uDD3F\uDD50-\uDD73\uDD76\uDD80-\uDDC4\uDDCA-\uDDCC\uDDD0-\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE37\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEEA\uDEF0-\uDEF9\uDF00-\uDF03\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3C-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF50\uDF57\uDF5D-\uDF63\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC80-\uDCC5\uDCC7\uDCD0-\uDCD9\uDD80-\uDDB5\uDDB8-\uDDC0\uDDD8-\uDDDD\uDE00-\uDE40\uDE44\uDE50-\uDE59\uDE80-\uDEB7\uDEC0-\uDEC9\uDF00-\uDF19\uDF1D-\uDF2B\uDF30-\uDF39]|\uD806[\uDCA0-\uDCE9\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE60-\uDE69\uDED0-\uDEED\uDEF0-\uDEF4\uDF00-\uDF36\uDF40-\uDF43\uDF50-\uDF59\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50-\uDF7E\uDF8F-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99\uDC9D\uDC9E]|\uD834[\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\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\uDFCE-\uDFFF]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD83A[\uDC00-\uDCC4\uDCD0-\uDCD6]|\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-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]|\uDB40[\uDD00-\uDDEF])+/,
+};
+
+function get_full_char(str, pos) {
+    if (is_surrogate_pair_head(str.charCodeAt(pos))) {
+        if (is_surrogate_pair_tail(str.charCodeAt(pos + 1))) {
+            return str.charAt(pos) + str.charAt(pos + 1);
+        }
+    } else if (is_surrogate_pair_tail(str.charCodeAt(pos))) {
+        if (is_surrogate_pair_head(str.charCodeAt(pos - 1))) {
+            return str.charAt(pos - 1) + str.charAt(pos);
+        }
+    }
+    return str.charAt(pos);
+}
+
+function get_full_char_code(str, pos) {
+    // https://en.wikipedia.org/wiki/Universal_Character_Set_characters#Surrogates
+    if (is_surrogate_pair_head(str.charCodeAt(pos))) {
+        return 0x10000 + (str.charCodeAt(pos) - 0xd800 << 10) + str.charCodeAt(pos + 1) - 0xdc00;
+    }
+    return str.charCodeAt(pos);
+}
+
+function get_full_char_length(str) {
+    var surrogates = 0;
+
+    for (var i = 0; i < str.length; i++) {
+        if (is_surrogate_pair_head(str.charCodeAt(i)) && is_surrogate_pair_tail(str.charCodeAt(i + 1))) {
+            surrogates++;
+            i++;
+        }
+    }
+
+    return str.length - surrogates;
+}
+
+function from_char_code(code) {
+    // Based on https://github.com/mathiasbynens/String.fromCodePoint/blob/master/fromcodepoint.js
+    if (code > 0xFFFF) {
+        code -= 0x10000;
+        return (String.fromCharCode((code >> 10) + 0xD800) +
+            String.fromCharCode((code % 0x400) + 0xDC00));
+    }
+    return String.fromCharCode(code);
+}
+
+function is_surrogate_pair_head(code) {
+    return code >= 0xd800 && code <= 0xdbff;
+}
+
+function is_surrogate_pair_tail(code) {
+    return code >= 0xdc00 && code <= 0xdfff;
+}
+
+function is_digit(code) {
+    return code >= 48 && code <= 57;
+}
+
+function is_identifier_start(ch) {
+    return UNICODE.ID_Start.test(ch);
+}
+
+function is_identifier_char(ch) {
+    return UNICODE.ID_Continue.test(ch);
+}
+
+const BASIC_IDENT = /^[a-z_$][a-z0-9_$]*$/i;
+
+function is_basic_identifier_string(str) {
+    return BASIC_IDENT.test(str);
+}
+
+function is_identifier_string(str, allow_surrogates) {
+    if (BASIC_IDENT.test(str)) {
+        return true;
+    }
+    if (!allow_surrogates && /[\ud800-\udfff]/.test(str)) {
+        return false;
+    }
+    var match = UNICODE.ID_Start.exec(str);
+    if (!match || match.index !== 0) {
+        return false;
+    }
+
+    str = str.slice(match[0].length);
+    if (!str) {
+        return true;
+    }
+
+    match = UNICODE.ID_Continue.exec(str);
+    return !!match && match[0].length === str.length;
+}
+
+function parse_js_number(num, allow_e = true) {
+    if (!allow_e && num.includes("e")) {
+        return NaN;
+    }
+    if (RE_HEX_NUMBER.test(num)) {
+        return parseInt(num.substr(2), 16);
+    } else if (RE_OCT_NUMBER.test(num)) {
+        return parseInt(num.substr(1), 8);
+    } else if (RE_ES6_OCT_NUMBER.test(num)) {
+        return parseInt(num.substr(2), 8);
+    } else if (RE_BIN_NUMBER.test(num)) {
+        return parseInt(num.substr(2), 2);
+    } else if (RE_DEC_NUMBER.test(num)) {
+        return parseFloat(num);
+    } else {
+        var val = parseFloat(num);
+        if (val == num) return val;
+    }
+}
+
+class JS_Parse_Error extends Error {
+    constructor(message, filename, line, col, pos) {
+        super();
+
+        this.name = "SyntaxError";
+        this.message = message;
+        this.filename = filename;
+        this.line = line;
+        this.col = col;
+        this.pos = pos;
+    }
+}
+
+function js_error(message, filename, line, col, pos) {
+    throw new JS_Parse_Error(message, filename, line, col, pos);
+}
+
+function is_token(token, type, val) {
+    return token.type == type && (val == null || token.value == val);
+}
+
+var EX_EOF = {};
+
+function tokenizer($TEXT, filename, html5_comments, shebang) {
+    var S = {
+        text            : $TEXT,
+        filename        : filename,
+        pos             : 0,
+        tokpos          : 0,
+        line            : 1,
+        tokline         : 0,
+        col             : 0,
+        tokcol          : 0,
+        newline_before  : false,
+        regex_allowed   : false,
+        brace_counter   : 0,
+        template_braces : [],
+        comments_before : [],
+        directives      : {},
+        directive_stack : []
+    };
+
+    function peek() { return get_full_char(S.text, S.pos); }
+
+    // Used because parsing ?. involves a lookahead for a digit
+    function is_option_chain_op() {
+        const must_be_dot = S.text.charCodeAt(S.pos + 1) === 46;
+        if (!must_be_dot) return false;
+
+        const cannot_be_digit = S.text.charCodeAt(S.pos + 2);
+        return cannot_be_digit < 48 || cannot_be_digit > 57;
+    }
+
+    function next(signal_eof, in_string) {
+        var ch = get_full_char(S.text, S.pos++);
+        if (signal_eof && !ch)
+            throw EX_EOF;
+        if (NEWLINE_CHARS.has(ch)) {
+            S.newline_before = S.newline_before || !in_string;
+            ++S.line;
+            S.col = 0;
+            if (ch == "\r" && peek() == "\n") {
+                // treat a \r\n sequence as a single \n
+                ++S.pos;
+                ch = "\n";
+            }
+        } else {
+            if (ch.length > 1) {
+                ++S.pos;
+                ++S.col;
+            }
+            ++S.col;
+        }
+        return ch;
+    }
+
+    function forward(i) {
+        while (i--) next();
+    }
+
+    function looking_at(str) {
+        return S.text.substr(S.pos, str.length) == str;
+    }
+
+    function find_eol() {
+        var text = S.text;
+        for (var i = S.pos, n = S.text.length; i < n; ++i) {
+            var ch = text[i];
+            if (NEWLINE_CHARS.has(ch))
+                return i;
+        }
+        return -1;
+    }
+
+    function find(what, signal_eof) {
+        var pos = S.text.indexOf(what, S.pos);
+        if (signal_eof && pos == -1) throw EX_EOF;
+        return pos;
+    }
+
+    function start_token() {
+        S.tokline = S.line;
+        S.tokcol = S.col;
+        S.tokpos = S.pos;
+    }
+
+    var prev_was_dot = false;
+    var previous_token = null;
+    function token(type, value, is_comment) {
+        S.regex_allowed = ((type == "operator" && !UNARY_POSTFIX.has(value)) ||
+                           (type == "keyword" && KEYWORDS_BEFORE_EXPRESSION.has(value)) ||
+                           (type == "punc" && PUNC_BEFORE_EXPRESSION.has(value))) ||
+                           (type == "arrow");
+        if (type == "punc" && (value == "." || value == "?.")) {
+            prev_was_dot = true;
+        } else if (!is_comment) {
+            prev_was_dot = false;
+        }
+        const line     = S.tokline;
+        const col      = S.tokcol;
+        const pos      = S.tokpos;
+        const nlb      = S.newline_before;
+        const file     = filename;
+        let comments_before = [];
+        let comments_after  = [];
+
+        if (!is_comment) {
+            comments_before = S.comments_before;
+            comments_after = S.comments_before = [];
+        }
+        S.newline_before = false;
+        const tok = new AST_Token(type, value, line, col, pos, nlb, comments_before, comments_after, file);
+
+        if (!is_comment) previous_token = tok;
+        return tok;
+    }
+
+    function skip_whitespace() {
+        while (WHITESPACE_CHARS.has(peek()))
+            next();
+    }
+
+    function read_while(pred) {
+        var ret = "", ch, i = 0;
+        while ((ch = peek()) && pred(ch, i++))
+            ret += next();
+        return ret;
+    }
+
+    function parse_error(err) {
+        js_error(err, filename, S.tokline, S.tokcol, S.tokpos);
+    }
+
+    function read_num(prefix) {
+        var has_e = false, after_e = false, has_x = false, has_dot = prefix == ".", is_big_int = false, numeric_separator = false;
+        var num = read_while(function(ch, i) {
+            if (is_big_int) return false;
+
+            var code = ch.charCodeAt(0);
+            switch (code) {
+              case 95: // _
+                return (numeric_separator = true);
+              case 98: case 66: // bB
+                return (has_x = true); // Can occur in hex sequence, don't return false yet
+              case 111: case 79: // oO
+              case 120: case 88: // xX
+                return has_x ? false : (has_x = true);
+              case 101: case 69: // eE
+                return has_x ? true : has_e ? false : (has_e = after_e = true);
+              case 45: // -
+                return after_e || (i == 0 && !prefix);
+              case 43: // +
+                return after_e;
+              case (after_e = false, 46): // .
+                return (!has_dot && !has_x && !has_e) ? (has_dot = true) : false;
+            }
+
+            if (ch === "n") {
+                is_big_int = true;
+
+                return true;
+            }
+
+            return RE_NUM_LITERAL.test(ch);
+        });
+        if (prefix) num = prefix + num;
+
+        LATEST_RAW = num;
+
+        if (RE_OCT_NUMBER.test(num) && next_token.has_directive("use strict")) {
+            parse_error("Legacy octal literals are not allowed in strict mode");
+        }
+        if (numeric_separator) {
+            if (num.endsWith("_")) {
+                parse_error("Numeric separators are not allowed at the end of numeric literals");
+            } else if (num.includes("__")) {
+                parse_error("Only one underscore is allowed as numeric separator");
+            }
+            num = num.replace(/_/g, "");
+        }
+        if (num.endsWith("n")) {
+            const without_n = num.slice(0, -1);
+            const allow_e = RE_HEX_NUMBER.test(without_n);
+            const valid = parse_js_number(without_n, allow_e);
+            if (!has_dot && RE_BIG_INT.test(num) && !isNaN(valid))
+                return token("big_int", without_n);
+            parse_error("Invalid or unexpected token");
+        }
+        var valid = parse_js_number(num);
+        if (!isNaN(valid)) {
+            return token("num", valid);
+        } else {
+            parse_error("Invalid syntax: " + num);
+        }
+    }
+
+    function is_octal(ch) {
+        return ch >= "0" && ch <= "7";
+    }
+
+    function read_escaped_char(in_string, strict_hex, template_string) {
+        var ch = next(true, in_string);
+        switch (ch.charCodeAt(0)) {
+          case 110 : return "\n";
+          case 114 : return "\r";
+          case 116 : return "\t";
+          case 98  : return "\b";
+          case 118 : return "\u000b"; // \v
+          case 102 : return "\f";
+          case 120 : return String.fromCharCode(hex_bytes(2, strict_hex)); // \x
+          case 117 : // \u
+            if (peek() == "{") {
+                next(true);
+                if (peek() === "}")
+                    parse_error("Expecting hex-character between {}");
+                while (peek() == "0") next(true); // No significance
+                var result, length = find("}", true) - S.pos;
+                // Avoid 32 bit integer overflow (1 << 32 === 1)
+                // We know first character isn't 0 and thus out of range anyway
+                if (length > 6 || (result = hex_bytes(length, strict_hex)) > 0x10FFFF) {
+                    parse_error("Unicode reference out of bounds");
+                }
+                next(true);
+                return from_char_code(result);
+            }
+            return String.fromCharCode(hex_bytes(4, strict_hex));
+          case 10  : return ""; // newline
+          case 13  :            // \r
+            if (peek() == "\n") { // DOS newline
+                next(true, in_string);
+                return "";
+            }
+        }
+        if (is_octal(ch)) {
+            if (template_string && strict_hex) {
+                const represents_null_character = ch === "0" && !is_octal(peek());
+                if (!represents_null_character) {
+                    parse_error("Octal escape sequences are not allowed in template strings");
+                }
+            }
+            return read_octal_escape_sequence(ch, strict_hex);
+        }
+        return ch;
+    }
+
+    function read_octal_escape_sequence(ch, strict_octal) {
+        // Read
+        var p = peek();
+        if (p >= "0" && p <= "7") {
+            ch += next(true);
+            if (ch[0] <= "3" && (p = peek()) >= "0" && p <= "7")
+                ch += next(true);
+        }
+
+        // Parse
+        if (ch === "0") return "\0";
+        if (ch.length > 0 && next_token.has_directive("use strict") && strict_octal)
+            parse_error("Legacy octal escape sequences are not allowed in strict mode");
+        return String.fromCharCode(parseInt(ch, 8));
+    }
+
+    function hex_bytes(n, strict_hex) {
+        var num = 0;
+        for (; n > 0; --n) {
+            if (!strict_hex && isNaN(parseInt(peek(), 16))) {
+                return parseInt(num, 16) || "";
+            }
+            var digit = next(true);
+            if (isNaN(parseInt(digit, 16)))
+                parse_error("Invalid hex-character pattern in string");
+            num += digit;
+        }
+        return parseInt(num, 16);
+    }
+
+    var read_string = with_eof_error("Unterminated string constant", function() {
+        const start_pos = S.pos;
+        var quote = next(), ret = [];
+        for (;;) {
+            var ch = next(true, true);
+            if (ch == "\\") ch = read_escaped_char(true, true);
+            else if (ch == "\r" || ch == "\n") parse_error("Unterminated string constant");
+            else if (ch == quote) break;
+            ret.push(ch);
+        }
+        var tok = token("string", ret.join(""));
+        LATEST_RAW = S.text.slice(start_pos, S.pos);
+        tok.quote = quote;
+        return tok;
+    });
+
+    var read_template_characters = with_eof_error("Unterminated template", function(begin) {
+        if (begin) {
+            S.template_braces.push(S.brace_counter);
+        }
+        var content = "", raw = "", ch, tok;
+        next(true, true);
+        while ((ch = next(true, true)) != "`") {
+            if (ch == "\r") {
+                if (peek() == "\n") ++S.pos;
+                ch = "\n";
+            } else if (ch == "$" && peek() == "{") {
+                next(true, true);
+                S.brace_counter++;
+                tok = token(begin ? "template_head" : "template_substitution", content);
+                LATEST_RAW = raw;
+                LATEST_TEMPLATE_END = false;
+                return tok;
+            }
+
+            raw += ch;
+            if (ch == "\\") {
+                var tmp = S.pos;
+                var prev_is_tag = previous_token && (previous_token.type === "name" || previous_token.type === "punc" && (previous_token.value === ")" || previous_token.value === "]"));
+                ch = read_escaped_char(true, !prev_is_tag, true);
+                raw += S.text.substr(tmp, S.pos - tmp);
+            }
+
+            content += ch;
+        }
+        S.template_braces.pop();
+        tok = token(begin ? "template_head" : "template_substitution", content);
+        LATEST_RAW = raw;
+        LATEST_TEMPLATE_END = true;
+        return tok;
+    });
+
+    function skip_line_comment(type) {
+        var regex_allowed = S.regex_allowed;
+        var i = find_eol(), ret;
+        if (i == -1) {
+            ret = S.text.substr(S.pos);
+            S.pos = S.text.length;
+        } else {
+            ret = S.text.substring(S.pos, i);
+            S.pos = i;
+        }
+        S.col = S.tokcol + (S.pos - S.tokpos);
+        S.comments_before.push(token(type, ret, true));
+        S.regex_allowed = regex_allowed;
+        return next_token;
+    }
+
+    var skip_multiline_comment = with_eof_error("Unterminated multiline comment", function() {
+        var regex_allowed = S.regex_allowed;
+        var i = find("*/", true);
+        var text = S.text.substring(S.pos, i).replace(/\r\n|\r|\u2028|\u2029/g, "\n");
+        // update stream position
+        forward(get_full_char_length(text) /* text length doesn't count \r\n as 2 char while S.pos - i does */ + 2);
+        S.comments_before.push(token("comment2", text, true));
+        S.newline_before = S.newline_before || text.includes("\n");
+        S.regex_allowed = regex_allowed;
+        return next_token;
+    });
+
+    var read_name = with_eof_error("Unterminated identifier name", function() {
+        var name = [], ch, escaped = false;
+        var read_escaped_identifier_char = function() {
+            escaped = true;
+            next();
+            if (peek() !== "u") {
+                parse_error("Expecting UnicodeEscapeSequence -- uXXXX or u{XXXX}");
+            }
+            return read_escaped_char(false, true);
+        };
+
+        // Read first character (ID_Start)
+        if ((ch = peek()) === "\\") {
+            ch = read_escaped_identifier_char();
+            if (!is_identifier_start(ch)) {
+                parse_error("First identifier char is an invalid identifier char");
+            }
+        } else if (is_identifier_start(ch)) {
+            next();
+        } else {
+            return "";
+        }
+
+        name.push(ch);
+
+        // Read ID_Continue
+        while ((ch = peek()) != null) {
+            if ((ch = peek()) === "\\") {
+                ch = read_escaped_identifier_char();
+                if (!is_identifier_char(ch)) {
+                    parse_error("Invalid escaped identifier char");
+                }
+            } else {
+                if (!is_identifier_char(ch)) {
+                    break;
+                }
+                next();
+            }
+            name.push(ch);
+        }
+        const name_str = name.join("");
+        if (RESERVED_WORDS.has(name_str) && escaped) {
+            parse_error("Escaped characters are not allowed in keywords");
+        }
+        return name_str;
+    });
+
+    var read_regexp = with_eof_error("Unterminated regular expression", function(source) {
+        var prev_backslash = false, ch, in_class = false;
+        while ((ch = next(true))) if (NEWLINE_CHARS.has(ch)) {
+            parse_error("Unexpected line terminator");
+        } else if (prev_backslash) {
+            source += "\\" + ch;
+            prev_backslash = false;
+        } else if (ch == "[") {
+            in_class = true;
+            source += ch;
+        } else if (ch == "]" && in_class) {
+            in_class = false;
+            source += ch;
+        } else if (ch == "/" && !in_class) {
+            break;
+        } else if (ch == "\\") {
+            prev_backslash = true;
+        } else {
+            source += ch;
+        }
+        const flags = read_name();
+        return token("regexp", "/" + source + "/" + flags);
+    });
+
+    function read_operator(prefix) {
+        function grow(op) {
+            if (!peek()) return op;
+            var bigger = op + peek();
+            if (OPERATORS.has(bigger)) {
+                next();
+                return grow(bigger);
+            } else {
+                return op;
+            }
+        }
+        return token("operator", grow(prefix || next()));
+    }
+
+    function handle_slash() {
+        next();
+        switch (peek()) {
+          case "/":
+            next();
+            return skip_line_comment("comment1");
+          case "*":
+            next();
+            return skip_multiline_comment();
+        }
+        return S.regex_allowed ? read_regexp("") : read_operator("/");
+    }
+
+    function handle_eq_sign() {
+        next();
+        if (peek() === ">") {
+            next();
+            return token("arrow", "=>");
+        } else {
+            return read_operator("=");
+        }
+    }
+
+    function handle_dot() {
+        next();
+        if (is_digit(peek().charCodeAt(0))) {
+            return read_num(".");
+        }
+        if (peek() === ".") {
+            next();  // Consume second dot
+            next();  // Consume third dot
+            return token("expand", "...");
+        }
+
+        return token("punc", ".");
+    }
+
+    function read_word() {
+        var word = read_name();
+        if (prev_was_dot) return token("name", word);
+        return KEYWORDS_ATOM.has(word) ? token("atom", word)
+            : !KEYWORDS.has(word) ? token("name", word)
+            : OPERATORS.has(word) ? token("operator", word)
+            : token("keyword", word);
+    }
+
+    function read_private_word() {
+        next();
+        return token("privatename", read_name());
+    }
+
+    function with_eof_error(eof_error, cont) {
+        return function(x) {
+            try {
+                return cont(x);
+            } catch(ex) {
+                if (ex === EX_EOF) parse_error(eof_error);
+                else throw ex;
+            }
+        };
+    }
+
+    function next_token(force_regexp) {
+        if (force_regexp != null)
+            return read_regexp(force_regexp);
+        if (shebang && S.pos == 0 && looking_at("#!")) {
+            start_token();
+            forward(2);
+            skip_line_comment("comment5");
+        }
+        for (;;) {
+            skip_whitespace();
+            start_token();
+            if (html5_comments) {
+                if (looking_at("<!--")) {
+                    forward(4);
+                    skip_line_comment("comment3");
+                    continue;
+                }
+                if (looking_at("-->") && S.newline_before) {
+                    forward(3);
+                    skip_line_comment("comment4");
+                    continue;
+                }
+            }
+            var ch = peek();
+            if (!ch) return token("eof");
+            var code = ch.charCodeAt(0);
+            switch (code) {
+              case 34: case 39: return read_string();
+              case 46: return handle_dot();
+              case 47: {
+                  var tok = handle_slash();
+                  if (tok === next_token) continue;
+                  return tok;
+              }
+              case 61: return handle_eq_sign();
+              case 63: {
+                  if (!is_option_chain_op()) break;  // Handled below
+
+                  next(); // ?
+                  next(); // .
+
+                  return token("punc", "?.");
+              }
+              case 96: return read_template_characters(true);
+              case 123:
+                S.brace_counter++;
+                break;
+              case 125:
+                S.brace_counter--;
+                if (S.template_braces.length > 0
+                    && S.template_braces[S.template_braces.length - 1] === S.brace_counter)
+                    return read_template_characters(false);
+                break;
+            }
+            if (is_digit(code)) return read_num();
+            if (PUNC_CHARS.has(ch)) return token("punc", next());
+            if (OPERATOR_CHARS.has(ch)) return read_operator();
+            if (code == 92 || is_identifier_start(ch)) return read_word();
+            if (code == 35) return read_private_word();
+            break;
+        }
+        parse_error("Unexpected character '" + ch + "'");
+    }
+
+    next_token.next = next;
+    next_token.peek = peek;
+
+    next_token.context = function(nc) {
+        if (nc) S = nc;
+        return S;
+    };
+
+    next_token.add_directive = function(directive) {
+        S.directive_stack[S.directive_stack.length - 1].push(directive);
+
+        if (S.directives[directive] === undefined) {
+            S.directives[directive] = 1;
+        } else {
+            S.directives[directive]++;
+        }
+    };
+
+    next_token.push_directives_stack = function() {
+        S.directive_stack.push([]);
+    };
+
+    next_token.pop_directives_stack = function() {
+        var directives = S.directive_stack[S.directive_stack.length - 1];
+
+        for (var i = 0; i < directives.length; i++) {
+            S.directives[directives[i]]--;
+        }
+
+        S.directive_stack.pop();
+    };
+
+    next_token.has_directive = function(directive) {
+        return S.directives[directive] > 0;
+    };
+
+    return next_token;
+
+}
+
+/* -----[ Parser (constants) ]----- */
+
+var UNARY_PREFIX = makePredicate([
+    "typeof",
+    "void",
+    "delete",
+    "--",
+    "++",
+    "!",
+    "~",
+    "-",
+    "+"
+]);
+
+var UNARY_POSTFIX = makePredicate([ "--", "++" ]);
+
+var ASSIGNMENT = makePredicate([ "=", "+=", "-=", "??=", "&&=", "||=", "/=", "*=", "**=", "%=", ">>=", "<<=", ">>>=", "|=", "^=", "&=" ]);
+
+var LOGICAL_ASSIGNMENT = makePredicate([ "??=", "&&=", "||=" ]);
+
+var PRECEDENCE = (function(a, ret) {
+    for (var i = 0; i < a.length; ++i) {
+        var b = a[i];
+        for (var j = 0; j < b.length; ++j) {
+            ret[b[j]] = i + 1;
+        }
+    }
+    return ret;
+})(
+    [
+        ["||"],
+        ["??"],
+        ["&&"],
+        ["|"],
+        ["^"],
+        ["&"],
+        ["==", "===", "!=", "!=="],
+        ["<", ">", "<=", ">=", "in", "instanceof"],
+        [">>", "<<", ">>>"],
+        ["+", "-"],
+        ["*", "/", "%"],
+        ["**"]
+    ],
+    {}
+);
+
+var ATOMIC_START_TOKEN = makePredicate([ "atom", "num", "big_int", "string", "regexp", "name" ]);
+
+/* -----[ Parser ]----- */
+
+function parse($TEXT, options) {
+    // maps start tokens to count of comments found outside of their parens
+    // Example: /* I count */ ( /* I don't */ foo() )
+    // Useful because comments_before property of call with parens outside
+    // contains both comments inside and outside these parens. Used to find the
+    // right #__PURE__ comments for an expression
+    const outer_comments_before_counts = new WeakMap();
+
+    options = defaults(options, {
+        bare_returns   : false,
+        ecma           : null,  // Legacy
+        expression     : false,
+        filename       : null,
+        html5_comments : true,
+        module         : false,
+        shebang        : true,
+        strict         : false,
+        toplevel       : null,
+    }, true);
+
+    var S = {
+        input         : (typeof $TEXT == "string"
+                         ? tokenizer($TEXT, options.filename,
+                                     options.html5_comments, options.shebang)
+                         : $TEXT),
+        token         : null,
+        prev          : null,
+        peeked        : null,
+        in_function   : 0,
+        in_async      : -1,
+        in_generator  : -1,
+        in_directives : true,
+        in_loop       : 0,
+        labels        : []
+    };
+
+    S.token = next();
+
+    function is(type, value) {
+        return is_token(S.token, type, value);
+    }
+
+    function peek() { return S.peeked || (S.peeked = S.input()); }
+
+    function next() {
+        S.prev = S.token;
+
+        if (!S.peeked) peek();
+        S.token = S.peeked;
+        S.peeked = null;
+        S.in_directives = S.in_directives && (
+            S.token.type == "string" || is("punc", ";")
+        );
+        return S.token;
+    }
+
+    function prev() {
+        return S.prev;
+    }
+
+    function croak(msg, line, col, pos) {
+        var ctx = S.input.context();
+        js_error(msg,
+                 ctx.filename,
+                 line != null ? line : ctx.tokline,
+                 col != null ? col : ctx.tokcol,
+                 pos != null ? pos : ctx.tokpos);
+    }
+
+    function token_error(token, msg) {
+        croak(msg, token.line, token.col);
+    }
+
+    function unexpected(token) {
+        if (token == null)
+            token = S.token;
+        token_error(token, "Unexpected token: " + token.type + " (" + token.value + ")");
+    }
+
+    function expect_token(type, val) {
+        if (is(type, val)) {
+            return next();
+        }
+        token_error(S.token, "Unexpected token " + S.token.type + " «" + S.token.value + "»" + ", expected " + type + " «" + val + "»");
+    }
+
+    function expect(punc) { return expect_token("punc", punc); }
+
+    function has_newline_before(token) {
+        return token.nlb || !token.comments_before.every((comment) => !comment.nlb);
+    }
+
+    function can_insert_semicolon() {
+        return !options.strict
+            && (is("eof") || is("punc", "}") || has_newline_before(S.token));
+    }
+
+    function is_in_generator() {
+        return S.in_generator === S.in_function;
+    }
+
+    function is_in_async() {
+        return S.in_async === S.in_function;
+    }
+
+    function can_await() {
+        return (
+            S.in_async === S.in_function
+            || S.in_function === 0 && S.input.has_directive("use strict")
+        );
+    }
+
+    function semicolon(optional) {
+        if (is("punc", ";")) next();
+        else if (!optional && !can_insert_semicolon()) unexpected();
+    }
+
+    function parenthesised() {
+        expect("(");
+        var exp = expression(true);
+        expect(")");
+        return exp;
+    }
+
+    function embed_tokens(parser) {
+        return function _embed_tokens_wrapper(...args) {
+            const start = S.token;
+            const expr = parser(...args);
+            expr.start = start;
+            expr.end = prev();
+            return expr;
+        };
+    }
+
+    function handle_regexp() {
+        if (is("operator", "/") || is("operator", "/=")) {
+            S.peeked = null;
+            S.token = S.input(S.token.value.substr(1)); // force regexp
+        }
+    }
+
+    var statement = embed_tokens(function statement(is_export_default, is_for_body, is_if_body) {
+        handle_regexp();
+        switch (S.token.type) {
+          case "string":
+            if (S.in_directives) {
+                var token = peek();
+                if (!LATEST_RAW.includes("\\")
+                    && (is_token(token, "punc", ";")
+                        || is_token(token, "punc", "}")
+                        || has_newline_before(token)
+                        || is_token(token, "eof"))) {
+                    S.input.add_directive(S.token.value);
+                } else {
+                    S.in_directives = false;
+                }
+            }
+            var dir = S.in_directives, stat = simple_statement();
+            return dir && stat.body instanceof AST_String ? new AST_Directive(stat.body) : stat;
+          case "template_head":
+          case "num":
+          case "big_int":
+          case "regexp":
+          case "operator":
+          case "atom":
+            return simple_statement();
+
+          case "name":
+            if (S.token.value == "async" && is_token(peek(), "keyword", "function")) {
+                next();
+                next();
+                if (is_for_body) {
+                    croak("functions are not allowed as the body of a loop");
+                }
+                return function_(AST_Defun, false, true, is_export_default);
+            }
+            if (S.token.value == "import" && !is_token(peek(), "punc", "(") && !is_token(peek(), "punc", ".")) {
+                next();
+                var node = import_statement();
+                semicolon();
+                return node;
+            }
+            return is_token(peek(), "punc", ":")
+                ? labeled_statement()
+                : simple_statement();
+
+          case "punc":
+            switch (S.token.value) {
+              case "{":
+                return new AST_BlockStatement({
+                    start : S.token,
+                    body  : block_(),
+                    end   : prev()
+                });
+              case "[":
+              case "(":
+                return simple_statement();
+              case ";":
+                S.in_directives = false;
+                next();
+                return new AST_EmptyStatement();
+              default:
+                unexpected();
+            }
+
+          case "keyword":
+            switch (S.token.value) {
+              case "break":
+                next();
+                return break_cont(AST_Break);
+
+              case "continue":
+                next();
+                return break_cont(AST_Continue);
+
+              case "debugger":
+                next();
+                semicolon();
+                return new AST_Debugger();
+
+              case "do":
+                next();
+                var body = in_loop(statement);
+                expect_token("keyword", "while");
+                var condition = parenthesised();
+                semicolon(true);
+                return new AST_Do({
+                    body      : body,
+                    condition : condition
+                });
+
+              case "while":
+                next();
+                return new AST_While({
+                    condition : parenthesised(),
+                    body      : in_loop(function() { return statement(false, true); })
+                });
+
+              case "for":
+                next();
+                return for_();
+
+              case "class":
+                next();
+                if (is_for_body) {
+                    croak("classes are not allowed as the body of a loop");
+                }
+                if (is_if_body) {
+                    croak("classes are not allowed as the body of an if");
+                }
+                return class_(AST_DefClass, is_export_default);
+
+              case "function":
+                next();
+                if (is_for_body) {
+                    croak("functions are not allowed as the body of a loop");
+                }
+                return function_(AST_Defun, false, false, is_export_default);
+
+              case "if":
+                next();
+                return if_();
+
+              case "return":
+                if (S.in_function == 0 && !options.bare_returns)
+                    croak("'return' outside of function");
+                next();
+                var value = null;
+                if (is("punc", ";")) {
+                    next();
+                } else if (!can_insert_semicolon()) {
+                    value = expression(true);
+                    semicolon();
+                }
+                return new AST_Return({
+                    value: value
+                });
+
+              case "switch":
+                next();
+                return new AST_Switch({
+                    expression : parenthesised(),
+                    body       : in_loop(switch_body_)
+                });
+
+              case "throw":
+                next();
+                if (has_newline_before(S.token))
+                    croak("Illegal newline after 'throw'");
+                var value = expression(true);
+                semicolon();
+                return new AST_Throw({
+                    value: value
+                });
+
+              case "try":
+                next();
+                return try_();
+
+              case "var":
+                next();
+                var node = var_();
+                semicolon();
+                return node;
+
+              case "let":
+                next();
+                var node = let_();
+                semicolon();
+                return node;
+
+              case "const":
+                next();
+                var node = const_();
+                semicolon();
+                return node;
+
+              case "with":
+                if (S.input.has_directive("use strict")) {
+                    croak("Strict mode may not include a with statement");
+                }
+                next();
+                return new AST_With({
+                    expression : parenthesised(),
+                    body       : statement()
+                });
+
+              case "export":
+                if (!is_token(peek(), "punc", "(")) {
+                    next();
+                    var node = export_statement();
+                    if (is("punc", ";")) semicolon();
+                    return node;
+                }
+            }
+        }
+        unexpected();
+    });
+
+    function labeled_statement() {
+        var label = as_symbol(AST_Label);
+        if (label.name === "await" && is_in_async()) {
+            token_error(S.prev, "await cannot be used as label inside async function");
+        }
+        if (S.labels.some((l) => l.name === label.name)) {
+            // ECMA-262, 12.12: An ECMAScript program is considered
+            // syntactically incorrect if it contains a
+            // LabelledStatement that is enclosed by a
+            // LabelledStatement with the same Identifier as label.
+            croak("Label " + label.name + " defined twice");
+        }
+        expect(":");
+        S.labels.push(label);
+        var stat = statement();
+        S.labels.pop();
+        if (!(stat instanceof AST_IterationStatement)) {
+            // check for `continue` that refers to this label.
+            // those should be reported as syntax errors.
+            // https://github.com/mishoo/UglifyJS2/issues/287
+            label.references.forEach(function(ref) {
+                if (ref instanceof AST_Continue) {
+                    ref = ref.label.start;
+                    croak("Continue label `" + label.name + "` refers to non-IterationStatement.",
+                          ref.line, ref.col, ref.pos);
+                }
+            });
+        }
+        return new AST_LabeledStatement({ body: stat, label: label });
+    }
+
+    function simple_statement(tmp) {
+        return new AST_SimpleStatement({ body: (tmp = expression(true), semicolon(), tmp) });
+    }
+
+    function break_cont(type) {
+        var label = null, ldef;
+        if (!can_insert_semicolon()) {
+            label = as_symbol(AST_LabelRef, true);
+        }
+        if (label != null) {
+            ldef = S.labels.find((l) => l.name === label.name);
+            if (!ldef)
+                croak("Undefined label " + label.name);
+            label.thedef = ldef;
+        } else if (S.in_loop == 0)
+            croak(type.TYPE + " not inside a loop or switch");
+        semicolon();
+        var stat = new type({ label: label });
+        if (ldef) ldef.references.push(stat);
+        return stat;
+    }
+
+    function for_() {
+        var for_await_error = "`for await` invalid in this context";
+        var await_tok = S.token;
+        if (await_tok.type == "name" && await_tok.value == "await") {
+            if (!can_await()) {
+                token_error(await_tok, for_await_error);
+            }
+            next();
+        } else {
+            await_tok = false;
+        }
+        expect("(");
+        var init = null;
+        if (!is("punc", ";")) {
+            init =
+                is("keyword", "var") ? (next(), var_(true)) :
+                is("keyword", "let") ? (next(), let_(true)) :
+                is("keyword", "const") ? (next(), const_(true)) :
+                                       expression(true, true);
+            var is_in = is("operator", "in");
+            var is_of = is("name", "of");
+            if (await_tok && !is_of) {
+                token_error(await_tok, for_await_error);
+            }
+            if (is_in || is_of) {
+                if (init instanceof AST_Definitions) {
+                    if (init.definitions.length > 1)
+                        token_error(init.start, "Only one variable declaration allowed in for..in loop");
+                } else if (!(is_assignable(init) || (init = to_destructuring(init)) instanceof AST_Destructuring)) {
+                    token_error(init.start, "Invalid left-hand side in for..in loop");
+                }
+                next();
+                if (is_in) {
+                    return for_in(init);
+                } else {
+                    return for_of(init, !!await_tok);
+                }
+            }
+        } else if (await_tok) {
+            token_error(await_tok, for_await_error);
+        }
+        return regular_for(init);
+    }
+
+    function regular_for(init) {
+        expect(";");
+        var test = is("punc", ";") ? null : expression(true);
+        expect(";");
+        var step = is("punc", ")") ? null : expression(true);
+        expect(")");
+        return new AST_For({
+            init      : init,
+            condition : test,
+            step      : step,
+            body      : in_loop(function() { return statement(false, true); })
+        });
+    }
+
+    function for_of(init, is_await) {
+        var lhs = init instanceof AST_Definitions ? init.definitions[0].name : null;
+        var obj = expression(true);
+        expect(")");
+        return new AST_ForOf({
+            await  : is_await,
+            init   : init,
+            name   : lhs,
+            object : obj,
+            body   : in_loop(function() { return statement(false, true); })
+        });
+    }
+
+    function for_in(init) {
+        var obj = expression(true);
+        expect(")");
+        return new AST_ForIn({
+            init   : init,
+            object : obj,
+            body   : in_loop(function() { return statement(false, true); })
+        });
+    }
+
+    var arrow_function = function(start, argnames, is_async) {
+        if (has_newline_before(S.token)) {
+            croak("Unexpected newline before arrow (=>)");
+        }
+
+        expect_token("arrow", "=>");
+
+        var body = _function_body(is("punc", "{"), false, is_async);
+
+        var end =
+            body instanceof Array && body.length ? body[body.length - 1].end :
+            body instanceof Array ? start :
+                body.end;
+
+        return new AST_Arrow({
+            start    : start,
+            end      : end,
+            async    : is_async,
+            argnames : argnames,
+            body     : body
+        });
+    };
+
+    var function_ = function(ctor, is_generator_property, is_async, is_export_default) {
+        var in_statement = ctor === AST_Defun;
+        var is_generator = is("operator", "*");
+        if (is_generator) {
+            next();
+        }
+
+        var name = is("name") ? as_symbol(in_statement ? AST_SymbolDefun : AST_SymbolLambda) : null;
+        if (in_statement && !name) {
+            if (is_export_default) {
+                ctor = AST_Function;
+            } else {
+                unexpected();
+            }
+        }
+
+        if (name && ctor !== AST_Accessor && !(name instanceof AST_SymbolDeclaration))
+            unexpected(prev());
+
+        var args = [];
+        var body = _function_body(true, is_generator || is_generator_property, is_async, name, args);
+        return new ctor({
+            start : args.start,
+            end   : body.end,
+            is_generator: is_generator,
+            async : is_async,
+            name  : name,
+            argnames: args,
+            body  : body
+        });
+    };
+
+    function track_used_binding_identifiers(is_parameter, strict) {
+        var parameters = new Set();
+        var duplicate = false;
+        var default_assignment = false;
+        var spread = false;
+        var strict_mode = !!strict;
+        var tracker = {
+            add_parameter: function(token) {
+                if (parameters.has(token.value)) {
+                    if (duplicate === false) {
+                        duplicate = token;
+                    }
+                    tracker.check_strict();
+                } else {
+                    parameters.add(token.value);
+                    if (is_parameter) {
+                        switch (token.value) {
+                          case "arguments":
+                          case "eval":
+                          case "yield":
+                            if (strict_mode) {
+                                token_error(token, "Unexpected " + token.value + " identifier as parameter inside strict mode");
+                            }
+                            break;
+                          default:
+                            if (RESERVED_WORDS.has(token.value)) {
+                                unexpected();
+                            }
+                        }
+                    }
+                }
+            },
+            mark_default_assignment: function(token) {
+                if (default_assignment === false) {
+                    default_assignment = token;
+                }
+            },
+            mark_spread: function(token) {
+                if (spread === false) {
+                    spread = token;
+                }
+            },
+            mark_strict_mode: function() {
+                strict_mode = true;
+            },
+            is_strict: function() {
+                return default_assignment !== false || spread !== false || strict_mode;
+            },
+            check_strict: function() {
+                if (tracker.is_strict() && duplicate !== false) {
+                    token_error(duplicate, "Parameter " + duplicate.value + " was used already");
+                }
+            }
+        };
+
+        return tracker;
+    }
+
+    function parameters(params) {
+        var used_parameters = track_used_binding_identifiers(true, S.input.has_directive("use strict"));
+
+        expect("(");
+
+        while (!is("punc", ")")) {
+            var param = parameter(used_parameters);
+            params.push(param);
+
+            if (!is("punc", ")")) {
+                expect(",");
+            }
+
+            if (param instanceof AST_Expansion) {
+                break;
+            }
+        }
+
+        next();
+    }
+
+    function parameter(used_parameters, symbol_type) {
+        var param;
+        var expand = false;
+        if (used_parameters === undefined) {
+            used_parameters = track_used_binding_identifiers(true, S.input.has_directive("use strict"));
+        }
+        if (is("expand", "...")) {
+            expand = S.token;
+            used_parameters.mark_spread(S.token);
+            next();
+        }
+        param = binding_element(used_parameters, symbol_type);
+
+        if (is("operator", "=") && expand === false) {
+            used_parameters.mark_default_assignment(S.token);
+            next();
+            param = new AST_DefaultAssign({
+                start: param.start,
+                left: param,
+                operator: "=",
+                right: expression(false),
+                end: S.token
+            });
+        }
+
+        if (expand !== false) {
+            if (!is("punc", ")")) {
+                unexpected();
+            }
+            param = new AST_Expansion({
+                start: expand,
+                expression: param,
+                end: expand
+            });
+        }
+        used_parameters.check_strict();
+
+        return param;
+    }
+
+    function binding_element(used_parameters, symbol_type) {
+        var elements = [];
+        var first = true;
+        var is_expand = false;
+        var expand_token;
+        var first_token = S.token;
+        if (used_parameters === undefined) {
+            used_parameters = track_used_binding_identifiers(false, S.input.has_directive("use strict"));
+        }
+        symbol_type = symbol_type === undefined ? AST_SymbolFunarg : symbol_type;
+        if (is("punc", "[")) {
+            next();
+            while (!is("punc", "]")) {
+                if (first) {
+                    first = false;
+                } else {
+                    expect(",");
+                }
+
+                if (is("expand", "...")) {
+                    is_expand = true;
+                    expand_token = S.token;
+                    used_parameters.mark_spread(S.token);
+                    next();
+                }
+                if (is("punc")) {
+                    switch (S.token.value) {
+                      case ",":
+                        elements.push(new AST_Hole({
+                            start: S.token,
+                            end: S.token
+                        }));
+                        continue;
+                      case "]": // Trailing comma after last element
+                        break;
+                      case "[":
+                      case "{":
+                        elements.push(binding_element(used_parameters, symbol_type));
+                        break;
+                      default:
+                        unexpected();
+                    }
+                } else if (is("name")) {
+                    used_parameters.add_parameter(S.token);
+                    elements.push(as_symbol(symbol_type));
+                } else {
+                    croak("Invalid function parameter");
+                }
+                if (is("operator", "=") && is_expand === false) {
+                    used_parameters.mark_default_assignment(S.token);
+                    next();
+                    elements[elements.length - 1] = new AST_DefaultAssign({
+                        start: elements[elements.length - 1].start,
+                        left: elements[elements.length - 1],
+                        operator: "=",
+                        right: expression(false),
+                        end: S.token
+                    });
+                }
+                if (is_expand) {
+                    if (!is("punc", "]")) {
+                        croak("Rest element must be last element");
+                    }
+                    elements[elements.length - 1] = new AST_Expansion({
+                        start: expand_token,
+                        expression: elements[elements.length - 1],
+                        end: expand_token
+                    });
+                }
+            }
+            expect("]");
+            used_parameters.check_strict();
+            return new AST_Destructuring({
+                start: first_token,
+                names: elements,
+                is_array: true,
+                end: prev()
+            });
+        } else if (is("punc", "{")) {
+            next();
+            while (!is("punc", "}")) {
+                if (first) {
+                    first = false;
+                } else {
+                    expect(",");
+                }
+                if (is("expand", "...")) {
+                    is_expand = true;
+                    expand_token = S.token;
+                    used_parameters.mark_spread(S.token);
+                    next();
+                }
+                if (is("name") && (is_token(peek(), "punc") || is_token(peek(), "operator")) && [",", "}", "="].includes(peek().value)) {
+                    used_parameters.add_parameter(S.token);
+                    var start = prev();
+                    var value = as_symbol(symbol_type);
+                    if (is_expand) {
+                        elements.push(new AST_Expansion({
+                            start: expand_token,
+                            expression: value,
+                            end: value.end,
+                        }));
+                    } else {
+                        elements.push(new AST_ObjectKeyVal({
+                            start: start,
+                            key: value.name,
+                            value: value,
+                            end: value.end,
+                        }));
+                    }
+                } else if (is("punc", "}")) {
+                    continue; // Allow trailing hole
+                } else {
+                    var property_token = S.token;
+                    var property = as_property_name();
+                    if (property === null) {
+                        unexpected(prev());
+                    } else if (prev().type === "name" && !is("punc", ":")) {
+                        elements.push(new AST_ObjectKeyVal({
+                            start: prev(),
+                            key: property,
+                            value: new symbol_type({
+                                start: prev(),
+                                name: property,
+                                end: prev()
+                            }),
+                            end: prev()
+                        }));
+                    } else {
+                        expect(":");
+                        elements.push(new AST_ObjectKeyVal({
+                            start: property_token,
+                            quote: property_token.quote,
+                            key: property,
+                            value: binding_element(used_parameters, symbol_type),
+                            end: prev()
+                        }));
+                    }
+                }
+                if (is_expand) {
+                    if (!is("punc", "}")) {
+                        croak("Rest element must be last element");
+                    }
+                } else if (is("operator", "=")) {
+                    used_parameters.mark_default_assignment(S.token);
+                    next();
+                    elements[elements.length - 1].value = new AST_DefaultAssign({
+                        start: elements[elements.length - 1].value.start,
+                        left: elements[elements.length - 1].value,
+                        operator: "=",
+                        right: expression(false),
+                        end: S.token
+                    });
+                }
+            }
+            expect("}");
+            used_parameters.check_strict();
+            return new AST_Destructuring({
+                start: first_token,
+                names: elements,
+                is_array: false,
+                end: prev()
+            });
+        } else if (is("name")) {
+            used_parameters.add_parameter(S.token);
+            return as_symbol(symbol_type);
+        } else {
+            croak("Invalid function parameter");
+        }
+    }
+
+    function params_or_seq_(allow_arrows, maybe_sequence) {
+        var spread_token;
+        var invalid_sequence;
+        var trailing_comma;
+        var a = [];
+        expect("(");
+        while (!is("punc", ")")) {
+            if (spread_token) unexpected(spread_token);
+            if (is("expand", "...")) {
+                spread_token = S.token;
+                if (maybe_sequence) invalid_sequence = S.token;
+                next();
+                a.push(new AST_Expansion({
+                    start: prev(),
+                    expression: expression(),
+                    end: S.token,
+                }));
+            } else {
+                a.push(expression());
+            }
+            if (!is("punc", ")")) {
+                expect(",");
+                if (is("punc", ")")) {
+                    trailing_comma = prev();
+                    if (maybe_sequence) invalid_sequence = trailing_comma;
+                }
+            }
+        }
+        expect(")");
+        if (allow_arrows && is("arrow", "=>")) {
+            if (spread_token && trailing_comma) unexpected(trailing_comma);
+        } else if (invalid_sequence) {
+            unexpected(invalid_sequence);
+        }
+        return a;
+    }
+
+    function _function_body(block, generator, is_async, name, args) {
+        var loop = S.in_loop;
+        var labels = S.labels;
+        var current_generator = S.in_generator;
+        var current_async = S.in_async;
+        ++S.in_function;
+        if (generator)
+            S.in_generator = S.in_function;
+        if (is_async)
+            S.in_async = S.in_function;
+        if (args) parameters(args);
+        if (block)
+            S.in_directives = true;
+        S.in_loop = 0;
+        S.labels = [];
+        if (block) {
+            S.input.push_directives_stack();
+            var a = block_();
+            if (name) _verify_symbol(name);
+            if (args) args.forEach(_verify_symbol);
+            S.input.pop_directives_stack();
+        } else {
+            var a = [new AST_Return({
+                start: S.token,
+                value: expression(false),
+                end: S.token
+            })];
+        }
+        --S.in_function;
+        S.in_loop = loop;
+        S.labels = labels;
+        S.in_generator = current_generator;
+        S.in_async = current_async;
+        return a;
+    }
+
+    function _await_expression() {
+        // Previous token must be "await" and not be interpreted as an identifier
+        if (!can_await()) {
+            croak("Unexpected await expression outside async function",
+                S.prev.line, S.prev.col, S.prev.pos);
+        }
+        // the await expression is parsed as a unary expression in Babel
+        return new AST_Await({
+            start: prev(),
+            end: S.token,
+            expression : maybe_unary(true),
+        });
+    }
+
+    function _yield_expression() {
+        // Previous token must be keyword yield and not be interpret as an identifier
+        if (!is_in_generator()) {
+            croak("Unexpected yield expression outside generator function",
+                S.prev.line, S.prev.col, S.prev.pos);
+        }
+        var start = S.token;
+        var star = false;
+        var has_expression = true;
+
+        // Attempt to get expression or star (and then the mandatory expression)
+        // behind yield on the same line.
+        //
+        // If nothing follows on the same line of the yieldExpression,
+        // it should default to the value `undefined` for yield to return.
+        // In that case, the `undefined` stored as `null` in ast.
+        //
+        // Note 1: It isn't allowed for yield* to close without an expression
+        // Note 2: If there is a nlb between yield and star, it is interpret as
+        //         yield <explicit undefined> <inserted automatic semicolon> *
+        if (can_insert_semicolon() ||
+            (is("punc") && PUNC_AFTER_EXPRESSION.has(S.token.value))) {
+            has_expression = false;
+
+        } else if (is("operator", "*")) {
+            star = true;
+            next();
+        }
+
+        return new AST_Yield({
+            start      : start,
+            is_star    : star,
+            expression : has_expression ? expression() : null,
+            end        : prev()
+        });
+    }
+
+    function if_() {
+        var cond = parenthesised(), body = statement(false, false, true), belse = null;
+        if (is("keyword", "else")) {
+            next();
+            belse = statement(false, false, true);
+        }
+        return new AST_If({
+            condition   : cond,
+            body        : body,
+            alternative : belse
+        });
+    }
+
+    function block_() {
+        expect("{");
+        var a = [];
+        while (!is("punc", "}")) {
+            if (is("eof")) unexpected();
+            a.push(statement());
+        }
+        next();
+        return a;
+    }
+
+    function switch_body_() {
+        expect("{");
+        var a = [], cur = null, branch = null, tmp;
+        while (!is("punc", "}")) {
+            if (is("eof")) unexpected();
+            if (is("keyword", "case")) {
+                if (branch) branch.end = prev();
+                cur = [];
+                branch = new AST_Case({
+                    start      : (tmp = S.token, next(), tmp),
+                    expression : expression(true),
+                    body       : cur
+                });
+                a.push(branch);
+                expect(":");
+            } else if (is("keyword", "default")) {
+                if (branch) branch.end = prev();
+                cur = [];
+                branch = new AST_Default({
+                    start : (tmp = S.token, next(), expect(":"), tmp),
+                    body  : cur
+                });
+                a.push(branch);
+            } else {
+                if (!cur) unexpected();
+                cur.push(statement());
+            }
+        }
+        if (branch) branch.end = prev();
+        next();
+        return a;
+    }
+
+    function try_() {
+        var body = block_(), bcatch = null, bfinally = null;
+        if (is("keyword", "catch")) {
+            var start = S.token;
+            next();
+            if (is("punc", "{")) {
+                var name = null;
+            } else {
+                expect("(");
+                var name = parameter(undefined, AST_SymbolCatch);
+                expect(")");
+            }
+            bcatch = new AST_Catch({
+                start   : start,
+                argname : name,
+                body    : block_(),
+                end     : prev()
+            });
+        }
+        if (is("keyword", "finally")) {
+            var start = S.token;
+            next();
+            bfinally = new AST_Finally({
+                start : start,
+                body  : block_(),
+                end   : prev()
+            });
+        }
+        if (!bcatch && !bfinally)
+            croak("Missing catch/finally blocks");
+        return new AST_Try({
+            body     : body,
+            bcatch   : bcatch,
+            bfinally : bfinally
+        });
+    }
+
+    function vardefs(no_in, kind) {
+        var a = [];
+        var def;
+        for (;;) {
+            var sym_type =
+                kind === "var" ? AST_SymbolVar :
+                kind === "const" ? AST_SymbolConst :
+                kind === "let" ? AST_SymbolLet : null;
+            if (is("punc", "{") || is("punc", "[")) {
+                def = new AST_VarDef({
+                    start: S.token,
+                    name: binding_element(undefined ,sym_type),
+                    value: is("operator", "=") ? (expect_token("operator", "="), expression(false, no_in)) : null,
+                    end: prev()
+                });
+            } else {
+                def = new AST_VarDef({
+                    start : S.token,
+                    name  : as_symbol(sym_type),
+                    value : is("operator", "=")
+                        ? (next(), expression(false, no_in))
+                        : !no_in && kind === "const"
+                            ? croak("Missing initializer in const declaration") : null,
+                    end   : prev()
+                });
+                if (def.name.name == "import") croak("Unexpected token: import");
+            }
+            a.push(def);
+            if (!is("punc", ","))
+                break;
+            next();
+        }
+        return a;
+    }
+
+    var var_ = function(no_in) {
+        return new AST_Var({
+            start       : prev(),
+            definitions : vardefs(no_in, "var"),
+            end         : prev()
+        });
+    };
+
+    var let_ = function(no_in) {
+        return new AST_Let({
+            start       : prev(),
+            definitions : vardefs(no_in, "let"),
+            end         : prev()
+        });
+    };
+
+    var const_ = function(no_in) {
+        return new AST_Const({
+            start       : prev(),
+            definitions : vardefs(no_in, "const"),
+            end         : prev()
+        });
+    };
+
+    var new_ = function(allow_calls) {
+        var start = S.token;
+        expect_token("operator", "new");
+        if (is("punc", ".")) {
+            next();
+            expect_token("name", "target");
+            return subscripts(new AST_NewTarget({
+                start : start,
+                end   : prev()
+            }), allow_calls);
+        }
+        var newexp = expr_atom(false), args;
+        if (is("punc", "(")) {
+            next();
+            args = expr_list(")", true);
+        } else {
+            args = [];
+        }
+        var call = new AST_New({
+            start      : start,
+            expression : newexp,
+            args       : args,
+            end        : prev()
+        });
+        annotate(call);
+        return subscripts(call, allow_calls);
+    };
+
+    function as_atom_node() {
+        var tok = S.token, ret;
+        switch (tok.type) {
+          case "name":
+            ret = _make_symbol(AST_SymbolRef);
+            break;
+          case "num":
+            ret = new AST_Number({
+                start: tok,
+                end: tok,
+                value: tok.value,
+                raw: LATEST_RAW
+            });
+            break;
+          case "big_int":
+            ret = new AST_BigInt({ start: tok, end: tok, value: tok.value });
+            break;
+          case "string":
+            ret = new AST_String({
+                start : tok,
+                end   : tok,
+                value : tok.value,
+                quote : tok.quote
+            });
+            break;
+          case "regexp":
+            const [_, source, flags] = tok.value.match(/^\/(.*)\/(\w*)$/);
+
+            ret = new AST_RegExp({ start: tok, end: tok, value: { source, flags } });
+            break;
+          case "atom":
+            switch (tok.value) {
+              case "false":
+                ret = new AST_False({ start: tok, end: tok });
+                break;
+              case "true":
+                ret = new AST_True({ start: tok, end: tok });
+                break;
+              case "null":
+                ret = new AST_Null({ start: tok, end: tok });
+                break;
+            }
+            break;
+        }
+        next();
+        return ret;
+    }
+
+    function to_fun_args(ex, default_seen_above) {
+        var insert_default = function(ex, default_value) {
+            if (default_value) {
+                return new AST_DefaultAssign({
+                    start: ex.start,
+                    left: ex,
+                    operator: "=",
+                    right: default_value,
+                    end: default_value.end
+                });
+            }
+            return ex;
+        };
+        if (ex instanceof AST_Object) {
+            return insert_default(new AST_Destructuring({
+                start: ex.start,
+                end: ex.end,
+                is_array: false,
+                names: ex.properties.map(prop => to_fun_args(prop))
+            }), default_seen_above);
+        } else if (ex instanceof AST_ObjectKeyVal) {
+            ex.value = to_fun_args(ex.value);
+            return insert_default(ex, default_seen_above);
+        } else if (ex instanceof AST_Hole) {
+            return ex;
+        } else if (ex instanceof AST_Destructuring) {
+            ex.names = ex.names.map(name => to_fun_args(name));
+            return insert_default(ex, default_seen_above);
+        } else if (ex instanceof AST_SymbolRef) {
+            return insert_default(new AST_SymbolFunarg({
+                name: ex.name,
+                start: ex.start,
+                end: ex.end
+            }), default_seen_above);
+        } else if (ex instanceof AST_Expansion) {
+            ex.expression = to_fun_args(ex.expression);
+            return insert_default(ex, default_seen_above);
+        } else if (ex instanceof AST_Array) {
+            return insert_default(new AST_Destructuring({
+                start: ex.start,
+                end: ex.end,
+                is_array: true,
+                names: ex.elements.map(elm => to_fun_args(elm))
+            }), default_seen_above);
+        } else if (ex instanceof AST_Assign) {
+            return insert_default(to_fun_args(ex.left, ex.right), default_seen_above);
+        } else if (ex instanceof AST_DefaultAssign) {
+            ex.left = to_fun_args(ex.left);
+            return ex;
+        } else {
+            croak("Invalid function parameter", ex.start.line, ex.start.col);
+        }
+    }
+
+    var expr_atom = function(allow_calls, allow_arrows) {
+        if (is("operator", "new")) {
+            return new_(allow_calls);
+        }
+        if (is("operator", "import")) {
+            return import_meta();
+        }
+        var start = S.token;
+        var peeked;
+        var async = is("name", "async")
+            && (peeked = peek()).value != "["
+            && peeked.type != "arrow"
+            && as_atom_node();
+        if (is("punc")) {
+            switch (S.token.value) {
+              case "(":
+                if (async && !allow_calls) break;
+                var exprs = params_or_seq_(allow_arrows, !async);
+                if (allow_arrows && is("arrow", "=>")) {
+                    return arrow_function(start, exprs.map(e => to_fun_args(e)), !!async);
+                }
+                var ex = async ? new AST_Call({
+                    expression: async,
+                    args: exprs
+                }) : exprs.length == 1 ? exprs[0] : new AST_Sequence({
+                    expressions: exprs
+                });
+                if (ex.start) {
+                    const outer_comments_before = start.comments_before.length;
+                    outer_comments_before_counts.set(start, outer_comments_before);
+                    ex.start.comments_before.unshift(...start.comments_before);
+                    start.comments_before = ex.start.comments_before;
+                    if (outer_comments_before == 0 && start.comments_before.length > 0) {
+                        var comment = start.comments_before[0];
+                        if (!comment.nlb) {
+                            comment.nlb = start.nlb;
+                            start.nlb = false;
+                        }
+                    }
+                    start.comments_after = ex.start.comments_after;
+                }
+                ex.start = start;
+                var end = prev();
+                if (ex.end) {
+                    end.comments_before = ex.end.comments_before;
+                    ex.end.comments_after.push(...end.comments_after);
+                    end.comments_after = ex.end.comments_after;
+                }
+                ex.end = end;
+                if (ex instanceof AST_Call) annotate(ex);
+                return subscripts(ex, allow_calls);
+              case "[":
+                return subscripts(array_(), allow_calls);
+              case "{":
+                return subscripts(object_or_destructuring_(), allow_calls);
+            }
+            if (!async) unexpected();
+        }
+        if (allow_arrows && is("name") && is_token(peek(), "arrow")) {
+            var param = new AST_SymbolFunarg({
+                name: S.token.value,
+                start: start,
+                end: start,
+            });
+            next();
+            return arrow_function(start, [param], !!async);
+        }
+        if (is("keyword", "function")) {
+            next();
+            var func = function_(AST_Function, false, !!async);
+            func.start = start;
+            func.end = prev();
+            return subscripts(func, allow_calls);
+        }
+        if (async) return subscripts(async, allow_calls);
+        if (is("keyword", "class")) {
+            next();
+            var cls = class_(AST_ClassExpression);
+            cls.start = start;
+            cls.end = prev();
+            return subscripts(cls, allow_calls);
+        }
+        if (is("template_head")) {
+            return subscripts(template_string(), allow_calls);
+        }
+        if (ATOMIC_START_TOKEN.has(S.token.type)) {
+            return subscripts(as_atom_node(), allow_calls);
+        }
+        unexpected();
+    };
+
+    function template_string() {
+        var segments = [], start = S.token;
+
+        segments.push(new AST_TemplateSegment({
+            start: S.token,
+            raw: LATEST_RAW,
+            value: S.token.value,
+            end: S.token
+        }));
+
+        while (!LATEST_TEMPLATE_END) {
+            next();
+            handle_regexp();
+            segments.push(expression(true));
+
+            segments.push(new AST_TemplateSegment({
+                start: S.token,
+                raw: LATEST_RAW,
+                value: S.token.value,
+                end: S.token
+            }));
+        }
+        next();
+
+        return new AST_TemplateString({
+            start: start,
+            segments: segments,
+            end: S.token
+        });
+    }
+
+    function expr_list(closing, allow_trailing_comma, allow_empty) {
+        var first = true, a = [];
+        while (!is("punc", closing)) {
+            if (first) first = false; else expect(",");
+            if (allow_trailing_comma && is("punc", closing)) break;
+            if (is("punc", ",") && allow_empty) {
+                a.push(new AST_Hole({ start: S.token, end: S.token }));
+            } else if (is("expand", "...")) {
+                next();
+                a.push(new AST_Expansion({start: prev(), expression: expression(),end: S.token}));
+            } else {
+                a.push(expression(false));
+            }
+        }
+        next();
+        return a;
+    }
+
+    var array_ = embed_tokens(function() {
+        expect("[");
+        return new AST_Array({
+            elements: expr_list("]", !options.strict, true)
+        });
+    });
+
+    var create_accessor = embed_tokens((is_generator, is_async) => {
+        return function_(AST_Accessor, is_generator, is_async);
+    });
+
+    var object_or_destructuring_ = embed_tokens(function object_or_destructuring_() {
+        var start = S.token, first = true, a = [];
+        expect("{");
+        while (!is("punc", "}")) {
+            if (first) first = false; else expect(",");
+            if (!options.strict && is("punc", "}"))
+                // allow trailing comma
+                break;
+
+            start = S.token;
+            if (start.type == "expand") {
+                next();
+                a.push(new AST_Expansion({
+                    start: start,
+                    expression: expression(false),
+                    end: prev(),
+                }));
+                continue;
+            }
+
+            var name = as_property_name();
+            var value;
+
+            // Check property and fetch value
+            if (!is("punc", ":")) {
+                var concise = concise_method_or_getset(name, start);
+                if (concise) {
+                    a.push(concise);
+                    continue;
+                }
+
+                value = new AST_SymbolRef({
+                    start: prev(),
+                    name: name,
+                    end: prev()
+                });
+            } else if (name === null) {
+                unexpected(prev());
+            } else {
+                next(); // `:` - see first condition
+                value = expression(false);
+            }
+
+            // Check for default value and alter value accordingly if necessary
+            if (is("operator", "=")) {
+                next();
+                value = new AST_Assign({
+                    start: start,
+                    left: value,
+                    operator: "=",
+                    right: expression(false),
+                    logical: false,
+                    end: prev()
+                });
+            }
+
+            // Create property
+            a.push(new AST_ObjectKeyVal({
+                start: start,
+                quote: start.quote,
+                key: name instanceof AST_Node ? name : "" + name,
+                value: value,
+                end: prev()
+            }));
+        }
+        next();
+        return new AST_Object({ properties: a });
+    });
+
+    function class_(KindOfClass, is_export_default) {
+        var start, method, class_name, extends_, a = [];
+
+        S.input.push_directives_stack(); // Push directive stack, but not scope stack
+        S.input.add_directive("use strict");
+
+        if (S.token.type == "name" && S.token.value != "extends") {
+            class_name = as_symbol(KindOfClass === AST_DefClass ? AST_SymbolDefClass : AST_SymbolClass);
+        }
+
+        if (KindOfClass === AST_DefClass && !class_name) {
+            if (is_export_default) {
+                KindOfClass = AST_ClassExpression;
+            } else {
+                unexpected();
+            }
+        }
+
+        if (S.token.value == "extends") {
+            next();
+            extends_ = expression(true);
+        }
+
+        expect("{");
+
+        while (is("punc", ";")) { next(); }  // Leading semicolons are okay in class bodies.
+        while (!is("punc", "}")) {
+            start = S.token;
+            method = concise_method_or_getset(as_property_name(), start, true);
+            if (!method) { unexpected(); }
+            a.push(method);
+            while (is("punc", ";")) { next(); }
+        }
+
+        S.input.pop_directives_stack();
+
+        next();
+
+        return new KindOfClass({
+            start: start,
+            name: class_name,
+            extends: extends_,
+            properties: a,
+            end: prev(),
+        });
+    }
+
+    function concise_method_or_getset(name, start, is_class) {
+        const get_symbol_ast = (name, SymbolClass = AST_SymbolMethod) => {
+            if (typeof name === "string" || typeof name === "number") {
+                return new SymbolClass({
+                    start,
+                    name: "" + name,
+                    end: prev()
+                });
+            } else if (name === null) {
+                unexpected();
+            }
+            return name;
+        };
+
+        const is_not_method_start = () =>
+            !is("punc", "(") && !is("punc", ",") && !is("punc", "}") && !is("punc", ";") && !is("operator", "=");
+
+        var is_async = false;
+        var is_static = false;
+        var is_generator = false;
+        var is_private = false;
+        var accessor_type = null;
+
+        if (is_class && name === "static" && is_not_method_start()) {
+            is_static = true;
+            name = as_property_name();
+        }
+        if (name === "async" && is_not_method_start()) {
+            is_async = true;
+            name = as_property_name();
+        }
+        if (prev().type === "operator" && prev().value === "*") {
+            is_generator = true;
+            name = as_property_name();
+        }
+        if ((name === "get" || name === "set") && is_not_method_start()) {
+            accessor_type = name;
+            name = as_property_name();
+        }
+        if (prev().type === "privatename") {
+            is_private = true;
+        }
+
+        const property_token = prev();
+
+        if (accessor_type != null) {
+            if (!is_private) {
+                const AccessorClass = accessor_type === "get"
+                    ? AST_ObjectGetter
+                    : AST_ObjectSetter;
+
+                name = get_symbol_ast(name);
+                return new AccessorClass({
+                    start,
+                    static: is_static,
+                    key: name,
+                    quote: name instanceof AST_SymbolMethod ? property_token.quote : undefined,
+                    value: create_accessor(),
+                    end: prev()
+                });
+            } else {
+                const AccessorClass = accessor_type === "get"
+                    ? AST_PrivateGetter
+                    : AST_PrivateSetter;
+
+                return new AccessorClass({
+                    start,
+                    static: is_static,
+                    key: get_symbol_ast(name),
+                    value: create_accessor(),
+                    end: prev(),
+                });
+            }
+        }
+
+        if (is("punc", "(")) {
+            name = get_symbol_ast(name);
+            const AST_MethodVariant = is_private
+                ? AST_PrivateMethod
+                : AST_ConciseMethod;
+            var node = new AST_MethodVariant({
+                start       : start,
+                static      : is_static,
+                is_generator: is_generator,
+                async       : is_async,
+                key         : name,
+                quote       : name instanceof AST_SymbolMethod ?
+                              property_token.quote : undefined,
+                value       : create_accessor(is_generator, is_async),
+                end         : prev()
+            });
+            return node;
+        }
+
+        if (is_class) {
+            const key = get_symbol_ast(name, AST_SymbolClassProperty);
+            const quote = key instanceof AST_SymbolClassProperty
+                ? property_token.quote
+                : undefined;
+            const AST_ClassPropertyVariant = is_private
+                ? AST_ClassPrivateProperty
+                : AST_ClassProperty;
+            if (is("operator", "=")) {
+                next();
+                return new AST_ClassPropertyVariant({
+                    start,
+                    static: is_static,
+                    quote,
+                    key,
+                    value: expression(false),
+                    end: prev()
+                });
+            } else if (
+                is("name")
+                || is("privatename")
+                || is("operator", "*")
+                || is("punc", ";")
+                || is("punc", "}")
+            ) {
+                return new AST_ClassPropertyVariant({
+                    start,
+                    static: is_static,
+                    quote,
+                    key,
+                    end: prev()
+                });
+            }
+        }
+    }
+
+    function maybe_import_assertion() {
+        if (is("name", "assert") && !has_newline_before(S.token)) {
+            next();
+            return object_or_destructuring_();
+        }
+        return null;
+    }
+
+    function import_statement() {
+        var start = prev();
+
+        var imported_name;
+        var imported_names;
+        if (is("name")) {
+            imported_name = as_symbol(AST_SymbolImport);
+        }
+
+        if (is("punc", ",")) {
+            next();
+        }
+
+        imported_names = map_names(true);
+
+        if (imported_names || imported_name) {
+            expect_token("name", "from");
+        }
+        var mod_str = S.token;
+        if (mod_str.type !== "string") {
+            unexpected();
+        }
+        next();
+
+        const assert_clause = maybe_import_assertion();
+
+        return new AST_Import({
+            start,
+            imported_name,
+            imported_names,
+            module_name: new AST_String({
+                start: mod_str,
+                value: mod_str.value,
+                quote: mod_str.quote,
+                end: mod_str,
+            }),
+            assert_clause,
+            end: S.token,
+        });
+    }
+
+    function import_meta() {
+        var start = S.token;
+        expect_token("operator", "import");
+        expect_token("punc", ".");
+        expect_token("name", "meta");
+        return subscripts(new AST_ImportMeta({
+            start: start,
+            end: prev()
+        }), false);
+    }
+
+    function map_name(is_import) {
+        function make_symbol(type) {
+            return new type({
+                name: as_property_name(),
+                start: prev(),
+                end: prev()
+            });
+        }
+
+        var foreign_type = is_import ? AST_SymbolImportForeign : AST_SymbolExportForeign;
+        var type = is_import ? AST_SymbolImport : AST_SymbolExport;
+        var start = S.token;
+        var foreign_name;
+        var name;
+
+        if (is_import) {
+            foreign_name = make_symbol(foreign_type);
+        } else {
+            name = make_symbol(type);
+        }
+        if (is("name", "as")) {
+            next();  // The "as" word
+            if (is_import) {
+                name = make_symbol(type);
+            } else {
+                foreign_name = make_symbol(foreign_type);
+            }
+        } else if (is_import) {
+            name = new type(foreign_name);
+        } else {
+            foreign_name = new foreign_type(name);
+        }
+
+        return new AST_NameMapping({
+            start: start,
+            foreign_name: foreign_name,
+            name: name,
+            end: prev(),
+        });
+    }
+
+    function map_nameAsterisk(is_import, name) {
+        var foreign_type = is_import ? AST_SymbolImportForeign : AST_SymbolExportForeign;
+        var type = is_import ? AST_SymbolImport : AST_SymbolExport;
+        var start = S.token;
+        var foreign_name;
+        var end = prev();
+
+        name = name || new type({
+            name: "*",
+            start: start,
+            end: end,
+        });
+
+        foreign_name = new foreign_type({
+            name: "*",
+            start: start,
+            end: end,
+        });
+
+        return new AST_NameMapping({
+            start: start,
+            foreign_name: foreign_name,
+            name: name,
+            end: end,
+        });
+    }
+
+    function map_names(is_import) {
+        var names;
+        if (is("punc", "{")) {
+            next();
+            names = [];
+            while (!is("punc", "}")) {
+                names.push(map_name(is_import));
+                if (is("punc", ",")) {
+                    next();
+                }
+            }
+            next();
+        } else if (is("operator", "*")) {
+            var name;
+            next();
+            if (is_import && is("name", "as")) {
+                next();  // The "as" word
+                name = as_symbol(is_import ? AST_SymbolImport : AST_SymbolExportForeign);
+            }
+            names = [map_nameAsterisk(is_import, name)];
+        }
+        return names;
+    }
+
+    function export_statement() {
+        var start = S.token;
+        var is_default;
+        var exported_names;
+
+        if (is("keyword", "default")) {
+            is_default = true;
+            next();
+        } else if (exported_names = map_names(false)) {
+            if (is("name", "from")) {
+                next();
+
+                var mod_str = S.token;
+                if (mod_str.type !== "string") {
+                    unexpected();
+                }
+                next();
+
+                const assert_clause = maybe_import_assertion();
+
+                return new AST_Export({
+                    start: start,
+                    is_default: is_default,
+                    exported_names: exported_names,
+                    module_name: new AST_String({
+                        start: mod_str,
+                        value: mod_str.value,
+                        quote: mod_str.quote,
+                        end: mod_str,
+                    }),
+                    end: prev(),
+                    assert_clause
+                });
+            } else {
+                return new AST_Export({
+                    start: start,
+                    is_default: is_default,
+                    exported_names: exported_names,
+                    end: prev(),
+                });
+            }
+        }
+
+        var node;
+        var exported_value;
+        var exported_definition;
+        if (is("punc", "{")
+            || is_default
+                && (is("keyword", "class") || is("keyword", "function"))
+                && is_token(peek(), "punc")) {
+            exported_value = expression(false);
+            semicolon();
+        } else if ((node = statement(is_default)) instanceof AST_Definitions && is_default) {
+            unexpected(node.start);
+        } else if (
+            node instanceof AST_Definitions
+            || node instanceof AST_Defun
+            || node instanceof AST_DefClass
+        ) {
+            exported_definition = node;
+        } else if (
+            node instanceof AST_ClassExpression
+            || node instanceof AST_Function
+        ) {
+            exported_value = node;
+        } else if (node instanceof AST_SimpleStatement) {
+            exported_value = node.body;
+        } else {
+            unexpected(node.start);
+        }
+
+        return new AST_Export({
+            start: start,
+            is_default: is_default,
+            exported_value: exported_value,
+            exported_definition: exported_definition,
+            end: prev(),
+            assert_clause: null
+        });
+    }
+
+    function as_property_name() {
+        var tmp = S.token;
+        switch (tmp.type) {
+          case "punc":
+            if (tmp.value === "[") {
+                next();
+                var ex = expression(false);
+                expect("]");
+                return ex;
+            } else unexpected(tmp);
+          case "operator":
+            if (tmp.value === "*") {
+                next();
+                return null;
+            }
+            if (!["delete", "in", "instanceof", "new", "typeof", "void"].includes(tmp.value)) {
+                unexpected(tmp);
+            }
+            /* falls through */
+          case "name":
+          case "privatename":
+          case "string":
+          case "num":
+          case "big_int":
+          case "keyword":
+          case "atom":
+            next();
+            return tmp.value;
+          default:
+            unexpected(tmp);
+        }
+    }
+
+    function as_name() {
+        var tmp = S.token;
+        if (tmp.type != "name" && tmp.type != "privatename") unexpected();
+        next();
+        return tmp.value;
+    }
+
+    function _make_symbol(type) {
+        var name = S.token.value;
+        return new (name == "this" ? AST_This :
+                    name == "super" ? AST_Super :
+                    type)({
+            name  : String(name),
+            start : S.token,
+            end   : S.token
+        });
+    }
+
+    function _verify_symbol(sym) {
+        var name = sym.name;
+        if (is_in_generator() && name == "yield") {
+            token_error(sym.start, "Yield cannot be used as identifier inside generators");
+        }
+        if (S.input.has_directive("use strict")) {
+            if (name == "yield") {
+                token_error(sym.start, "Unexpected yield identifier inside strict mode");
+            }
+            if (sym instanceof AST_SymbolDeclaration && (name == "arguments" || name == "eval")) {
+                token_error(sym.start, "Unexpected " + name + " in strict mode");
+            }
+        }
+    }
+
+    function as_symbol(type, noerror) {
+        if (!is("name")) {
+            if (!noerror) croak("Name expected");
+            return null;
+        }
+        var sym = _make_symbol(type);
+        _verify_symbol(sym);
+        next();
+        return sym;
+    }
+
+    // Annotate AST_Call, AST_Lambda or AST_New with the special comments
+    function annotate(node) {
+        var start = node.start;
+        var comments = start.comments_before;
+        const comments_outside_parens = outer_comments_before_counts.get(start);
+        var i = comments_outside_parens != null ? comments_outside_parens : comments.length;
+        while (--i >= 0) {
+            var comment = comments[i];
+            if (/[@#]__/.test(comment.value)) {
+                if (/[@#]__PURE__/.test(comment.value)) {
+                    set_annotation(node, _PURE);
+                    break;
+                }
+                if (/[@#]__INLINE__/.test(comment.value)) {
+                    set_annotation(node, _INLINE);
+                    break;
+                }
+                if (/[@#]__NOINLINE__/.test(comment.value)) {
+                    set_annotation(node, _NOINLINE);
+                    break;
+                }
+            }
+        }
+    }
+
+    var subscripts = function(expr, allow_calls, is_chain) {
+        var start = expr.start;
+        if (is("punc", ".")) {
+            next();
+            const AST_DotVariant = is("privatename") ? AST_DotHash : AST_Dot;
+            return subscripts(new AST_DotVariant({
+                start      : start,
+                expression : expr,
+                optional   : false,
+                property   : as_name(),
+                end        : prev()
+            }), allow_calls, is_chain);
+        }
+        if (is("punc", "[")) {
+            next();
+            var prop = expression(true);
+            expect("]");
+            return subscripts(new AST_Sub({
+                start      : start,
+                expression : expr,
+                optional   : false,
+                property   : prop,
+                end        : prev()
+            }), allow_calls, is_chain);
+        }
+        if (allow_calls && is("punc", "(")) {
+            next();
+            var call = new AST_Call({
+                start      : start,
+                expression : expr,
+                optional   : false,
+                args       : call_args(),
+                end        : prev()
+            });
+            annotate(call);
+            return subscripts(call, true, is_chain);
+        }
+
+        if (is("punc", "?.")) {
+            next();
+
+            let chain_contents;
+
+            if (allow_calls && is("punc", "(")) {
+                next();
+
+                const call = new AST_Call({
+                    start,
+                    optional: true,
+                    expression: expr,
+                    args: call_args(),
+                    end: prev()
+                });
+                annotate(call);
+
+                chain_contents = subscripts(call, true, true);
+            } else if (is("name") || is("privatename")) {
+                const AST_DotVariant = is("privatename") ? AST_DotHash : AST_Dot;
+                chain_contents = subscripts(new AST_DotVariant({
+                    start,
+                    expression: expr,
+                    optional: true,
+                    property: as_name(),
+                    end: prev()
+                }), allow_calls, true);
+            } else if (is("punc", "[")) {
+                next();
+                const property = expression(true);
+                expect("]");
+                chain_contents = subscripts(new AST_Sub({
+                    start,
+                    expression: expr,
+                    optional: true,
+                    property,
+                    end: prev()
+                }), allow_calls, true);
+            }
+
+            if (!chain_contents) unexpected();
+
+            if (chain_contents instanceof AST_Chain) return chain_contents;
+
+            return new AST_Chain({
+                start,
+                expression: chain_contents,
+                end: prev()
+            });
+        }
+
+        if (is("template_head")) {
+            if (is_chain) {
+                // a?.b`c` is a syntax error
+                unexpected();
+            }
+
+            return subscripts(new AST_PrefixedTemplateString({
+                start: start,
+                prefix: expr,
+                template_string: template_string(),
+                end: prev()
+            }), allow_calls);
+        }
+
+        return expr;
+    };
+
+    function call_args() {
+        var args = [];
+        while (!is("punc", ")")) {
+            if (is("expand", "...")) {
+                next();
+                args.push(new AST_Expansion({
+                    start: prev(),
+                    expression: expression(false),
+                    end: prev()
+                }));
+            } else {
+                args.push(expression(false));
+            }
+            if (!is("punc", ")")) {
+                expect(",");
+            }
+        }
+        next();
+        return args;
+    }
+
+    var maybe_unary = function(allow_calls, allow_arrows) {
+        var start = S.token;
+        if (start.type == "name" && start.value == "await" && can_await()) {
+            next();
+            return _await_expression();
+        }
+        if (is("operator") && UNARY_PREFIX.has(start.value)) {
+            next();
+            handle_regexp();
+            var ex = make_unary(AST_UnaryPrefix, start, maybe_unary(allow_calls));
+            ex.start = start;
+            ex.end = prev();
+            return ex;
+        }
+        var val = expr_atom(allow_calls, allow_arrows);
+        while (is("operator") && UNARY_POSTFIX.has(S.token.value) && !has_newline_before(S.token)) {
+            if (val instanceof AST_Arrow) unexpected();
+            val = make_unary(AST_UnaryPostfix, S.token, val);
+            val.start = start;
+            val.end = S.token;
+            next();
+        }
+        return val;
+    };
+
+    function make_unary(ctor, token, expr) {
+        var op = token.value;
+        switch (op) {
+          case "++":
+          case "--":
+            if (!is_assignable(expr))
+                croak("Invalid use of " + op + " operator", token.line, token.col, token.pos);
+            break;
+          case "delete":
+            if (expr instanceof AST_SymbolRef && S.input.has_directive("use strict"))
+                croak("Calling delete on expression not allowed in strict mode", expr.start.line, expr.start.col, expr.start.pos);
+            break;
+        }
+        return new ctor({ operator: op, expression: expr });
+    }
+
+    var expr_op = function(left, min_prec, no_in) {
+        var op = is("operator") ? S.token.value : null;
+        if (op == "in" && no_in) op = null;
+        if (op == "**" && left instanceof AST_UnaryPrefix
+            /* unary token in front not allowed - parenthesis required */
+            && !is_token(left.start, "punc", "(")
+            && left.operator !== "--" && left.operator !== "++")
+                unexpected(left.start);
+        var prec = op != null ? PRECEDENCE[op] : null;
+        if (prec != null && (prec > min_prec || (op === "**" && min_prec === prec))) {
+            next();
+            var right = expr_op(maybe_unary(true), prec, no_in);
+            return expr_op(new AST_Binary({
+                start    : left.start,
+                left     : left,
+                operator : op,
+                right    : right,
+                end      : right.end
+            }), min_prec, no_in);
+        }
+        return left;
+    };
+
+    function expr_ops(no_in) {
+        return expr_op(maybe_unary(true, true), 0, no_in);
+    }
+
+    var maybe_conditional = function(no_in) {
+        var start = S.token;
+        var expr = expr_ops(no_in);
+        if (is("operator", "?")) {
+            next();
+            var yes = expression(false);
+            expect(":");
+            return new AST_Conditional({
+                start       : start,
+                condition   : expr,
+                consequent  : yes,
+                alternative : expression(false, no_in),
+                end         : prev()
+            });
+        }
+        return expr;
+    };
+
+    function is_assignable(expr) {
+        return expr instanceof AST_PropAccess || expr instanceof AST_SymbolRef;
+    }
+
+    function to_destructuring(node) {
+        if (node instanceof AST_Object) {
+            node = new AST_Destructuring({
+                start: node.start,
+                names: node.properties.map(to_destructuring),
+                is_array: false,
+                end: node.end
+            });
+        } else if (node instanceof AST_Array) {
+            var names = [];
+
+            for (var i = 0; i < node.elements.length; i++) {
+                // Only allow expansion as last element
+                if (node.elements[i] instanceof AST_Expansion) {
+                    if (i + 1 !== node.elements.length) {
+                        token_error(node.elements[i].start, "Spread must the be last element in destructuring array");
+                    }
+                    node.elements[i].expression = to_destructuring(node.elements[i].expression);
+                }
+
+                names.push(to_destructuring(node.elements[i]));
+            }
+
+            node = new AST_Destructuring({
+                start: node.start,
+                names: names,
+                is_array: true,
+                end: node.end
+            });
+        } else if (node instanceof AST_ObjectProperty) {
+            node.value = to_destructuring(node.value);
+        } else if (node instanceof AST_Assign) {
+            node = new AST_DefaultAssign({
+                start: node.start,
+                left: node.left,
+                operator: "=",
+                right: node.right,
+                end: node.end
+            });
+        }
+        return node;
+    }
+
+    // In ES6, AssignmentExpression can also be an ArrowFunction
+    var maybe_assign = function(no_in) {
+        handle_regexp();
+        var start = S.token;
+
+        if (start.type == "name" && start.value == "yield") {
+            if (is_in_generator()) {
+                next();
+                return _yield_expression();
+            } else if (S.input.has_directive("use strict")) {
+                token_error(S.token, "Unexpected yield identifier inside strict mode");
+            }
+        }
+
+        var left = maybe_conditional(no_in);
+        var val = S.token.value;
+
+        if (is("operator") && ASSIGNMENT.has(val)) {
+            if (is_assignable(left) || (left = to_destructuring(left)) instanceof AST_Destructuring) {
+                next();
+
+                return new AST_Assign({
+                    start    : start,
+                    left     : left,
+                    operator : val,
+                    right    : maybe_assign(no_in),
+                    logical  : LOGICAL_ASSIGNMENT.has(val),
+                    end      : prev()
+                });
+            }
+            croak("Invalid assignment");
+        }
+        return left;
+    };
+
+    var expression = function(commas, no_in) {
+        var start = S.token;
+        var exprs = [];
+        while (true) {
+            exprs.push(maybe_assign(no_in));
+            if (!commas || !is("punc", ",")) break;
+            next();
+            commas = true;
+        }
+        return exprs.length == 1 ? exprs[0] : new AST_Sequence({
+            start       : start,
+            expressions : exprs,
+            end         : peek()
+        });
+    };
+
+    function in_loop(cont) {
+        ++S.in_loop;
+        var ret = cont();
+        --S.in_loop;
+        return ret;
+    }
+
+    if (options.expression) {
+        return expression(true);
+    }
+
+    return (function parse_toplevel() {
+        var start = S.token;
+        var body = [];
+        S.input.push_directives_stack();
+        if (options.module) S.input.add_directive("use strict");
+        while (!is("eof")) {
+            body.push(statement());
+        }
+        S.input.pop_directives_stack();
+        var end = prev();
+        var toplevel = options.toplevel;
+        if (toplevel) {
+            toplevel.body = toplevel.body.concat(body);
+            toplevel.end = end;
+        } else {
+            toplevel = new AST_Toplevel({ start: start, body: body, end: end });
+        }
+        return toplevel;
+    })();
+
+}
+
+export {
+    get_full_char_code,
+    get_full_char,
+    is_identifier_char,
+    is_basic_identifier_string,
+    is_identifier_string,
+    is_surrogate_pair_head,
+    is_surrogate_pair_tail,
+    js_error,
+    JS_Parse_Error,
+    parse,
+    PRECEDENCE,
+    ALL_RESERVED_WORDS,
+    tokenizer,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/propmangle.js b/node_modules/mathjs/examples/node_modules/terser/lib/propmangle.js
new file mode 100644
index 0000000..27df236
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/propmangle.js
@@ -0,0 +1,376 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+/* global global, self */
+
+import {
+    defaults,
+    push_uniq,
+} from "./utils/index.js";
+import { base54 } from "./scope.js";
+import {
+    AST_Binary,
+    AST_Call,
+    AST_ClassPrivateProperty,
+    AST_Conditional,
+    AST_Dot,
+    AST_DotHash,
+    AST_ObjectKeyVal,
+    AST_ObjectProperty,
+    AST_PrivateMethod,
+    AST_PrivateGetter,
+    AST_PrivateSetter,
+    AST_Sequence,
+    AST_String,
+    AST_Sub,
+    TreeTransformer,
+    TreeWalker,
+} from "./ast.js";
+import { domprops } from "../tools/domprops.js";
+
+function find_builtins(reserved) {
+    domprops.forEach(add);
+
+    // Compatibility fix for some standard defined globals not defined on every js environment
+    var new_globals = ["Symbol", "Map", "Promise", "Proxy", "Reflect", "Set", "WeakMap", "WeakSet"];
+    var objects = {};
+    var global_ref = typeof global === "object" ? global : self;
+
+    new_globals.forEach(function (new_global) {
+        objects[new_global] = global_ref[new_global] || new Function();
+    });
+
+    [
+        "null",
+        "true",
+        "false",
+        "NaN",
+        "Infinity",
+        "-Infinity",
+        "undefined",
+    ].forEach(add);
+    [ Object, Array, Function, Number,
+      String, Boolean, Error, Math,
+      Date, RegExp, objects.Symbol, ArrayBuffer,
+      DataView, decodeURI, decodeURIComponent,
+      encodeURI, encodeURIComponent, eval, EvalError,
+      Float32Array, Float64Array, Int8Array, Int16Array,
+      Int32Array, isFinite, isNaN, JSON, objects.Map, parseFloat,
+      parseInt, objects.Promise, objects.Proxy, RangeError, ReferenceError,
+      objects.Reflect, objects.Set, SyntaxError, TypeError, Uint8Array,
+      Uint8ClampedArray, Uint16Array, Uint32Array, URIError,
+      objects.WeakMap, objects.WeakSet
+    ].forEach(function(ctor) {
+        Object.getOwnPropertyNames(ctor).map(add);
+        if (ctor.prototype) {
+            Object.getOwnPropertyNames(ctor.prototype).map(add);
+        }
+    });
+    function add(name) {
+        reserved.add(name);
+    }
+}
+
+function reserve_quoted_keys(ast, reserved) {
+    function add(name) {
+        push_uniq(reserved, name);
+    }
+
+    ast.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_ObjectKeyVal && node.quote) {
+            add(node.key);
+        } else if (node instanceof AST_ObjectProperty && node.quote) {
+            add(node.key.name);
+        } else if (node instanceof AST_Sub) {
+            addStrings(node.property, add);
+        }
+    }));
+}
+
+function addStrings(node, add) {
+    node.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_Sequence) {
+            addStrings(node.tail_node(), add);
+        } else if (node instanceof AST_String) {
+            add(node.value);
+        } else if (node instanceof AST_Conditional) {
+            addStrings(node.consequent, add);
+            addStrings(node.alternative, add);
+        }
+        return true;
+    }));
+}
+
+function mangle_private_properties(ast, options) {
+    var cprivate = -1;
+    var private_cache = new Map();
+    var nth_identifier = options.nth_identifier || base54;
+
+    ast =  ast.transform(new TreeTransformer(function(node) {
+        if (
+            node instanceof AST_ClassPrivateProperty
+            || node instanceof AST_PrivateMethod
+            || node instanceof AST_PrivateGetter
+            || node instanceof AST_PrivateSetter
+        ) {
+            node.key.name = mangle_private(node.key.name);
+        } else if (node instanceof AST_DotHash) {
+            node.property = mangle_private(node.property);
+        }
+    }));
+    return ast;
+
+    function mangle_private(name) {
+        let mangled = private_cache.get(name);
+        if (!mangled) {
+            mangled = nth_identifier.get(++cprivate);
+            private_cache.set(name, mangled);
+        }
+
+        return mangled;
+    }
+}
+
+function mangle_properties(ast, options) {
+    options = defaults(options, {
+        builtins: false,
+        cache: null,
+        debug: false,
+        keep_quoted: false,
+        nth_identifier: base54,
+        only_cache: false,
+        regex: null,
+        reserved: null,
+        undeclared: false,
+    }, true);
+
+    var nth_identifier = options.nth_identifier;
+
+    var reserved_option = options.reserved;
+    if (!Array.isArray(reserved_option)) reserved_option = [reserved_option];
+    var reserved = new Set(reserved_option);
+    if (!options.builtins) find_builtins(reserved);
+
+    var cname = -1;
+
+    var cache;
+    if (options.cache) {
+        cache = options.cache.props;
+    } else {
+        cache = new Map();
+    }
+
+    var regex = options.regex && new RegExp(options.regex);
+
+    // note debug is either false (disabled), or a string of the debug suffix to use (enabled).
+    // note debug may be enabled as an empty string, which is falsey. Also treat passing 'true'
+    // the same as passing an empty string.
+    var debug = options.debug !== false;
+    var debug_name_suffix;
+    if (debug) {
+        debug_name_suffix = (options.debug === true ? "" : options.debug);
+    }
+
+    var names_to_mangle = new Set();
+    var unmangleable = new Set();
+    // Track each already-mangled name to prevent nth_identifier from generating
+    // the same name.
+    cache.forEach((mangled_name) => unmangleable.add(mangled_name));
+
+    var keep_quoted = !!options.keep_quoted;
+
+    // step 1: find candidates to mangle
+    ast.walk(new TreeWalker(function(node) {
+        if (
+            node instanceof AST_ClassPrivateProperty
+            || node instanceof AST_PrivateMethod
+            || node instanceof AST_PrivateGetter
+            || node instanceof AST_PrivateSetter
+            || node instanceof AST_DotHash
+        ) {
+            // handled by mangle_private_properties
+        } else if (node instanceof AST_ObjectKeyVal) {
+            if (typeof node.key == "string" && (!keep_quoted || !node.quote)) {
+                add(node.key);
+            }
+        } else if (node instanceof AST_ObjectProperty) {
+            // setter or getter, since KeyVal is handled above
+            if (!keep_quoted || !node.quote) {
+                add(node.key.name);
+            }
+        } else if (node instanceof AST_Dot) {
+            var declared = !!options.undeclared;
+            if (!declared) {
+                var root = node;
+                while (root.expression) {
+                    root = root.expression;
+                }
+                declared = !(root.thedef && root.thedef.undeclared);
+            }
+            if (declared &&
+                (!keep_quoted || !node.quote)) {
+                add(node.property);
+            }
+        } else if (node instanceof AST_Sub) {
+            if (!keep_quoted) {
+                addStrings(node.property, add);
+            }
+        } else if (node instanceof AST_Call
+            && node.expression.print_to_string() == "Object.defineProperty") {
+            addStrings(node.args[1], add);
+        } else if (node instanceof AST_Binary && node.operator === "in") {
+            addStrings(node.left, add);
+        }
+    }));
+
+    // step 2: transform the tree, renaming properties
+    return ast.transform(new TreeTransformer(function(node) {
+        if (
+            node instanceof AST_ClassPrivateProperty
+            || node instanceof AST_PrivateMethod
+            || node instanceof AST_PrivateGetter
+            || node instanceof AST_PrivateSetter
+            || node instanceof AST_DotHash
+        ) {
+            // handled by mangle_private_properties
+        } else if (node instanceof AST_ObjectKeyVal) {
+            if (typeof node.key == "string" && (!keep_quoted || !node.quote)) {
+                node.key = mangle(node.key);
+            }
+        } else if (node instanceof AST_ObjectProperty) {
+            // setter, getter, method or class field
+            if (!keep_quoted || !node.quote) {
+                node.key.name = mangle(node.key.name);
+            }
+        } else if (node instanceof AST_Dot) {
+            if (!keep_quoted || !node.quote) {
+                node.property = mangle(node.property);
+            }
+        } else if (!keep_quoted && node instanceof AST_Sub) {
+            node.property = mangleStrings(node.property);
+        } else if (node instanceof AST_Call
+            && node.expression.print_to_string() == "Object.defineProperty") {
+            node.args[1] = mangleStrings(node.args[1]);
+        } else if (node instanceof AST_Binary && node.operator === "in") {
+            node.left = mangleStrings(node.left);
+        }
+    }));
+
+    // only function declarations after this line
+
+    function can_mangle(name) {
+        if (unmangleable.has(name)) return false;
+        if (reserved.has(name)) return false;
+        if (options.only_cache) {
+            return cache.has(name);
+        }
+        if (/^-?[0-9]+(\.[0-9]+)?(e[+-][0-9]+)?$/.test(name)) return false;
+        return true;
+    }
+
+    function should_mangle(name) {
+        if (regex && !regex.test(name)) return false;
+        if (reserved.has(name)) return false;
+        return cache.has(name)
+            || names_to_mangle.has(name);
+    }
+
+    function add(name) {
+        if (can_mangle(name))
+            names_to_mangle.add(name);
+
+        if (!should_mangle(name)) {
+            unmangleable.add(name);
+        }
+    }
+
+    function mangle(name) {
+        if (!should_mangle(name)) {
+            return name;
+        }
+
+        var mangled = cache.get(name);
+        if (!mangled) {
+            if (debug) {
+                // debug mode: use a prefix and suffix to preserve readability, e.g. o.foo -> o._$foo$NNN_.
+                var debug_mangled = "_$" + name + "$" + debug_name_suffix + "_";
+
+                if (can_mangle(debug_mangled)) {
+                    mangled = debug_mangled;
+                }
+            }
+
+            // either debug mode is off, or it is on and we could not use the mangled name
+            if (!mangled) {
+                do {
+                    mangled = nth_identifier.get(++cname);
+                } while (!can_mangle(mangled));
+            }
+
+            cache.set(name, mangled);
+        }
+        return mangled;
+    }
+
+    function mangleStrings(node) {
+        return node.transform(new TreeTransformer(function(node) {
+            if (node instanceof AST_Sequence) {
+                var last = node.expressions.length - 1;
+                node.expressions[last] = mangleStrings(node.expressions[last]);
+            } else if (node instanceof AST_String) {
+                node.value = mangle(node.value);
+            } else if (node instanceof AST_Conditional) {
+                node.consequent = mangleStrings(node.consequent);
+                node.alternative = mangleStrings(node.alternative);
+            }
+            return node;
+        }));
+    }
+}
+
+export {
+    reserve_quoted_keys,
+    mangle_properties,
+    mangle_private_properties,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/scope.js b/node_modules/mathjs/examples/node_modules/terser/lib/scope.js
new file mode 100644
index 0000000..ab822f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/scope.js
@@ -0,0 +1,1042 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+
+import {
+    defaults,
+    keep_name,
+    mergeSort,
+    push_uniq,
+    make_node,
+    return_false,
+    return_this,
+    return_true,
+    string_template,
+} from "./utils/index.js";
+import {
+    AST_Arrow,
+    AST_Block,
+    AST_Call,
+    AST_Catch,
+    AST_Class,
+    AST_Conditional,
+    AST_DefClass,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Dot,
+    AST_DotHash,
+    AST_Export,
+    AST_For,
+    AST_ForIn,
+    AST_Function,
+    AST_Import,
+    AST_IterationStatement,
+    AST_Label,
+    AST_LabeledStatement,
+    AST_LabelRef,
+    AST_Lambda,
+    AST_LoopControl,
+    AST_NameMapping,
+    AST_Node,
+    AST_Scope,
+    AST_Sequence,
+    AST_String,
+    AST_Sub,
+    AST_Switch,
+    AST_SwitchBranch,
+    AST_Symbol,
+    AST_SymbolBlockDeclaration,
+    AST_SymbolCatch,
+    AST_SymbolClass,
+    AST_SymbolConst,
+    AST_SymbolDefClass,
+    AST_SymbolDefun,
+    AST_SymbolExport,
+    AST_SymbolFunarg,
+    AST_SymbolImport,
+    AST_SymbolLambda,
+    AST_SymbolLet,
+    AST_SymbolMethod,
+    AST_SymbolRef,
+    AST_SymbolVar,
+    AST_Toplevel,
+    AST_VarDef,
+    AST_With,
+    TreeWalker,
+    walk
+} from "./ast.js";
+import {
+    ALL_RESERVED_WORDS,
+    js_error,
+} from "./parse.js";
+
+const MASK_EXPORT_DONT_MANGLE = 1 << 0;
+const MASK_EXPORT_WANT_MANGLE = 1 << 1;
+
+let function_defs = null;
+let unmangleable_names = null;
+/**
+ * When defined, there is a function declaration somewhere that's inside of a block.
+ * See https://tc39.es/ecma262/multipage/additional-ecmascript-features-for-web-browsers.html#sec-block-level-function-declarations-web-legacy-compatibility-semantics
+*/
+let scopes_with_block_defuns = null;
+
+class SymbolDef {
+    constructor(scope, orig, init) {
+        this.name = orig.name;
+        this.orig = [ orig ];
+        this.init = init;
+        this.eliminated = 0;
+        this.assignments = 0;
+        this.scope = scope;
+        this.replaced = 0;
+        this.global = false;
+        this.export = 0;
+        this.mangled_name = null;
+        this.undeclared = false;
+        this.id = SymbolDef.next_id++;
+        this.chained = false;
+        this.direct_access = false;
+        this.escaped = 0;
+        this.recursive_refs = 0;
+        this.references = [];
+        this.should_replace = undefined;
+        this.single_use = false;
+        this.fixed = false;
+        Object.seal(this);
+    }
+    fixed_value() {
+        if (!this.fixed || this.fixed instanceof AST_Node) return this.fixed;
+        return this.fixed();
+    }
+    unmangleable(options) {
+        if (!options) options = {};
+
+        if (
+            function_defs &&
+            function_defs.has(this.id) &&
+            keep_name(options.keep_fnames, this.orig[0].name)
+        ) return true;
+
+        return this.global && !options.toplevel
+            || (this.export & MASK_EXPORT_DONT_MANGLE)
+            || this.undeclared
+            || !options.eval && this.scope.pinned()
+            || (this.orig[0] instanceof AST_SymbolLambda
+                  || this.orig[0] instanceof AST_SymbolDefun) && keep_name(options.keep_fnames, this.orig[0].name)
+            || this.orig[0] instanceof AST_SymbolMethod
+            || (this.orig[0] instanceof AST_SymbolClass
+                  || this.orig[0] instanceof AST_SymbolDefClass) && keep_name(options.keep_classnames, this.orig[0].name);
+    }
+    mangle(options) {
+        const cache = options.cache && options.cache.props;
+        if (this.global && cache && cache.has(this.name)) {
+            this.mangled_name = cache.get(this.name);
+        } else if (!this.mangled_name && !this.unmangleable(options)) {
+            var s = this.scope;
+            var sym = this.orig[0];
+            if (options.ie8 && sym instanceof AST_SymbolLambda)
+                s = s.parent_scope;
+            const redefinition = redefined_catch_def(this);
+            this.mangled_name = redefinition
+                ? redefinition.mangled_name || redefinition.name
+                : s.next_mangled(options, this);
+            if (this.global && cache) {
+                cache.set(this.name, this.mangled_name);
+            }
+        }
+    }
+}
+
+SymbolDef.next_id = 1;
+
+function redefined_catch_def(def) {
+    if (def.orig[0] instanceof AST_SymbolCatch
+        && def.scope.is_block_scope()
+    ) {
+        return def.scope.get_defun_scope().variables.get(def.name);
+    }
+}
+
+AST_Scope.DEFMETHOD("figure_out_scope", function(options, { parent_scope = null, toplevel = this } = {}) {
+    options = defaults(options, {
+        cache: null,
+        ie8: false,
+        safari10: false,
+    });
+
+    if (!(toplevel instanceof AST_Toplevel)) {
+        throw new Error("Invalid toplevel scope");
+    }
+
+    // pass 1: setup scope chaining and handle definitions
+    var scope = this.parent_scope = parent_scope;
+    var labels = new Map();
+    var defun = null;
+    var in_destructuring = null;
+    var for_scopes = [];
+    var tw = new TreeWalker((node, descend) => {
+        if (node.is_block_scope()) {
+            const save_scope = scope;
+            node.block_scope = scope = new AST_Scope(node);
+            scope._block_scope = true;
+            // AST_Try in the AST sadly *is* (not has) a body itself,
+            // and its catch and finally branches are children of the AST_Try itself
+            const parent_scope = node instanceof AST_Catch
+                ? save_scope.parent_scope
+                : save_scope;
+            scope.init_scope_vars(parent_scope);
+            scope.uses_with = save_scope.uses_with;
+            scope.uses_eval = save_scope.uses_eval;
+            if (options.safari10) {
+                if (node instanceof AST_For || node instanceof AST_ForIn) {
+                    for_scopes.push(scope);
+                }
+            }
+
+            if (node instanceof AST_Switch) {
+                // XXX: HACK! Ensure the switch expression gets the correct scope (the parent scope) and the body gets the contained scope
+                // AST_Switch has a scope within the body, but it itself "is a block scope"
+                // This means the switched expression has to belong to the outer scope
+                // while the body inside belongs to the switch itself.
+                // This is pretty nasty and warrants an AST change similar to AST_Try (read above)
+                const the_block_scope = scope;
+                scope = save_scope;
+                node.expression.walk(tw);
+                scope = the_block_scope;
+                for (let i = 0; i < node.body.length; i++) {
+                    node.body[i].walk(tw);
+                }
+            } else {
+                descend();
+            }
+            scope = save_scope;
+            return true;
+        }
+        if (node instanceof AST_Destructuring) {
+            const save_destructuring = in_destructuring;
+            in_destructuring = node;
+            descend();
+            in_destructuring = save_destructuring;
+            return true;
+        }
+        if (node instanceof AST_Scope) {
+            node.init_scope_vars(scope);
+            var save_scope = scope;
+            var save_defun = defun;
+            var save_labels = labels;
+            defun = scope = node;
+            labels = new Map();
+            descend();
+            scope = save_scope;
+            defun = save_defun;
+            labels = save_labels;
+            return true;        // don't descend again in TreeWalker
+        }
+        if (node instanceof AST_LabeledStatement) {
+            var l = node.label;
+            if (labels.has(l.name)) {
+                throw new Error(string_template("Label {name} defined twice", l));
+            }
+            labels.set(l.name, l);
+            descend();
+            labels.delete(l.name);
+            return true;        // no descend again
+        }
+        if (node instanceof AST_With) {
+            for (var s = scope; s; s = s.parent_scope)
+                s.uses_with = true;
+            return;
+        }
+        if (node instanceof AST_Symbol) {
+            node.scope = scope;
+        }
+        if (node instanceof AST_Label) {
+            node.thedef = node;
+            node.references = [];
+        }
+        if (node instanceof AST_SymbolLambda) {
+            defun.def_function(node, node.name == "arguments" ? undefined : defun);
+        } else if (node instanceof AST_SymbolDefun) {
+            // Careful here, the scope where this should be defined is
+            // the parent scope.  The reason is that we enter a new
+            // scope when we encounter the AST_Defun node (which is
+            // instanceof AST_Scope) but we get to the symbol a bit
+            // later.
+            const closest_scope = defun.parent_scope;
+
+            // In strict mode, function definitions are block-scoped
+            node.scope = tw.directives["use strict"]
+                ? closest_scope
+                : closest_scope.get_defun_scope();
+
+            mark_export(node.scope.def_function(node, defun), 1);
+        } else if (node instanceof AST_SymbolClass) {
+            mark_export(defun.def_variable(node, defun), 1);
+        } else if (node instanceof AST_SymbolImport) {
+            scope.def_variable(node);
+        } else if (node instanceof AST_SymbolDefClass) {
+            // This deals with the name of the class being available
+            // inside the class.
+            mark_export((node.scope = defun.parent_scope).def_function(node, defun), 1);
+        } else if (
+            node instanceof AST_SymbolVar
+            || node instanceof AST_SymbolLet
+            || node instanceof AST_SymbolConst
+            || node instanceof AST_SymbolCatch
+        ) {
+            var def;
+            if (node instanceof AST_SymbolBlockDeclaration) {
+                def = scope.def_variable(node, null);
+            } else {
+                def = defun.def_variable(node, node.TYPE == "SymbolVar" ? null : undefined);
+            }
+            if (!def.orig.every((sym) => {
+                if (sym === node) return true;
+                if (node instanceof AST_SymbolBlockDeclaration) {
+                    return sym instanceof AST_SymbolLambda;
+                }
+                return !(sym instanceof AST_SymbolLet || sym instanceof AST_SymbolConst);
+            })) {
+                js_error(
+                    `"${node.name}" is redeclared`,
+                    node.start.file,
+                    node.start.line,
+                    node.start.col,
+                    node.start.pos
+                );
+            }
+            if (!(node instanceof AST_SymbolFunarg)) mark_export(def, 2);
+            if (defun !== scope) {
+                node.mark_enclosed();
+                var def = scope.find_variable(node);
+                if (node.thedef !== def) {
+                    node.thedef = def;
+                    node.reference();
+                }
+            }
+        } else if (node instanceof AST_LabelRef) {
+            var sym = labels.get(node.name);
+            if (!sym) throw new Error(string_template("Undefined label {name} [{line},{col}]", {
+                name: node.name,
+                line: node.start.line,
+                col: node.start.col
+            }));
+            node.thedef = sym;
+        }
+        if (!(scope instanceof AST_Toplevel) && (node instanceof AST_Export || node instanceof AST_Import)) {
+            js_error(
+                `"${node.TYPE}" statement may only appear at the top level`,
+                node.start.file,
+                node.start.line,
+                node.start.col,
+                node.start.pos
+            );
+        }
+    });
+    this.walk(tw);
+
+    function mark_export(def, level) {
+        if (in_destructuring) {
+            var i = 0;
+            do {
+                level++;
+            } while (tw.parent(i++) !== in_destructuring);
+        }
+        var node = tw.parent(level);
+        if (def.export = node instanceof AST_Export ? MASK_EXPORT_DONT_MANGLE : 0) {
+            var exported = node.exported_definition;
+            if ((exported instanceof AST_Defun || exported instanceof AST_DefClass) && node.is_default) {
+                def.export = MASK_EXPORT_WANT_MANGLE;
+            }
+        }
+    }
+
+    // pass 2: find back references and eval
+    const is_toplevel = this instanceof AST_Toplevel;
+    if (is_toplevel) {
+        this.globals = new Map();
+    }
+
+    var tw = new TreeWalker(node => {
+        if (node instanceof AST_LoopControl && node.label) {
+            node.label.thedef.references.push(node);
+            return true;
+        }
+        if (node instanceof AST_SymbolRef) {
+            var name = node.name;
+            if (name == "eval" && tw.parent() instanceof AST_Call) {
+                for (var s = node.scope; s && !s.uses_eval; s = s.parent_scope) {
+                    s.uses_eval = true;
+                }
+            }
+            var sym;
+            if (tw.parent() instanceof AST_NameMapping && tw.parent(1).module_name
+                || !(sym = node.scope.find_variable(name))) {
+
+                sym = toplevel.def_global(node);
+                if (node instanceof AST_SymbolExport) sym.export = MASK_EXPORT_DONT_MANGLE;
+            } else if (sym.scope instanceof AST_Lambda && name == "arguments") {
+                sym.scope.uses_arguments = true;
+            }
+            node.thedef = sym;
+            node.reference();
+            if (node.scope.is_block_scope()
+                && !(sym.orig[0] instanceof AST_SymbolBlockDeclaration)) {
+                node.scope = node.scope.get_defun_scope();
+            }
+            return true;
+        }
+        // ensure mangling works if catch reuses a scope variable
+        var def;
+        if (node instanceof AST_SymbolCatch && (def = redefined_catch_def(node.definition()))) {
+            var s = node.scope;
+            while (s) {
+                push_uniq(s.enclosed, def);
+                if (s === def.scope) break;
+                s = s.parent_scope;
+            }
+        }
+    });
+    this.walk(tw);
+
+    // pass 3: work around IE8 and Safari catch scope bugs
+    if (options.ie8 || options.safari10) {
+        walk(this, node => {
+            if (node instanceof AST_SymbolCatch) {
+                var name = node.name;
+                var refs = node.thedef.references;
+                var scope = node.scope.get_defun_scope();
+                var def = scope.find_variable(name)
+                    || toplevel.globals.get(name)
+                    || scope.def_variable(node);
+                refs.forEach(function(ref) {
+                    ref.thedef = def;
+                    ref.reference();
+                });
+                node.thedef = def;
+                node.reference();
+                return true;
+            }
+        });
+    }
+
+    // pass 4: add symbol definitions to loop scopes
+    // Safari/Webkit bug workaround - loop init let variable shadowing argument.
+    // https://github.com/mishoo/UglifyJS2/issues/1753
+    // https://bugs.webkit.org/show_bug.cgi?id=171041
+    if (options.safari10) {
+        for (const scope of for_scopes) {
+            scope.parent_scope.variables.forEach(function(def) {
+                push_uniq(scope.enclosed, def);
+            });
+        }
+    }
+});
+
+AST_Toplevel.DEFMETHOD("def_global", function(node) {
+    var globals = this.globals, name = node.name;
+    if (globals.has(name)) {
+        return globals.get(name);
+    } else {
+        var g = new SymbolDef(this, node);
+        g.undeclared = true;
+        g.global = true;
+        globals.set(name, g);
+        return g;
+    }
+});
+
+AST_Scope.DEFMETHOD("init_scope_vars", function(parent_scope) {
+    this.variables = new Map();         // map name to AST_SymbolVar (variables defined in this scope; includes functions)
+    this.uses_with = false;             // will be set to true if this or some nested scope uses the `with` statement
+    this.uses_eval = false;             // will be set to true if this or nested scope uses the global `eval`
+    this.parent_scope = parent_scope;   // the parent scope
+    this.enclosed = [];                 // a list of variables from this or outer scope(s) that are referenced from this or inner scopes
+    this.cname = -1;                    // the current index for mangling functions/variables
+});
+
+AST_Scope.DEFMETHOD("conflicting_def", function (name) {
+    return (
+        this.enclosed.find(def => def.name === name)
+        || this.variables.has(name)
+        || (this.parent_scope && this.parent_scope.conflicting_def(name))
+    );
+});
+
+AST_Scope.DEFMETHOD("conflicting_def_shallow", function (name) {
+    return (
+        this.enclosed.find(def => def.name === name)
+        || this.variables.has(name)
+    );
+});
+
+AST_Scope.DEFMETHOD("add_child_scope", function (scope) {
+    // `scope` is going to be moved into `this` right now.
+    // Update the required scopes' information
+
+    if (scope.parent_scope === this) return;
+
+    scope.parent_scope = this;
+
+    // TODO uses_with, uses_eval, etc
+
+    const scope_ancestry = (() => {
+        const ancestry = [];
+        let cur = this;
+        do {
+            ancestry.push(cur);
+        } while ((cur = cur.parent_scope));
+        ancestry.reverse();
+        return ancestry;
+    })();
+
+    const new_scope_enclosed_set = new Set(scope.enclosed);
+    const to_enclose = [];
+    for (const scope_topdown of scope_ancestry) {
+        to_enclose.forEach(e => push_uniq(scope_topdown.enclosed, e));
+        for (const def of scope_topdown.variables.values()) {
+            if (new_scope_enclosed_set.has(def)) {
+                push_uniq(to_enclose, def);
+                push_uniq(scope_topdown.enclosed, def);
+            }
+        }
+    }
+});
+
+function find_scopes_visible_from(scopes) {
+    const found_scopes = new Set();
+
+    for (const scope of new Set(scopes)) {
+        (function bubble_up(scope) {
+            if (scope == null || found_scopes.has(scope)) return;
+
+            found_scopes.add(scope);
+
+            bubble_up(scope.parent_scope);
+        })(scope);
+    }
+
+    return [...found_scopes];
+}
+
+// Creates a symbol during compression
+AST_Scope.DEFMETHOD("create_symbol", function(SymClass, {
+    source,
+    tentative_name,
+    scope,
+    conflict_scopes = [scope],
+    init = null
+} = {}) {
+    let symbol_name;
+
+    conflict_scopes = find_scopes_visible_from(conflict_scopes);
+
+    if (tentative_name) {
+        // Implement hygiene (no new names are conflicting with existing names)
+        tentative_name =
+            symbol_name =
+            tentative_name.replace(/(?:^[^a-z_$]|[^a-z0-9_$])/ig, "_");
+
+        let i = 0;
+        while (conflict_scopes.find(s => s.conflicting_def_shallow(symbol_name))) {
+            symbol_name = tentative_name + "$" + i++;
+        }
+    }
+
+    if (!symbol_name) {
+        throw new Error("No symbol name could be generated in create_symbol()");
+    }
+
+    const symbol = make_node(SymClass, source, {
+        name: symbol_name,
+        scope
+    });
+
+    this.def_variable(symbol, init || null);
+
+    symbol.mark_enclosed();
+
+    return symbol;
+});
+
+
+AST_Node.DEFMETHOD("is_block_scope", return_false);
+AST_Class.DEFMETHOD("is_block_scope", return_false);
+AST_Lambda.DEFMETHOD("is_block_scope", return_false);
+AST_Toplevel.DEFMETHOD("is_block_scope", return_false);
+AST_SwitchBranch.DEFMETHOD("is_block_scope", return_false);
+AST_Block.DEFMETHOD("is_block_scope", return_true);
+AST_Scope.DEFMETHOD("is_block_scope", function () {
+    return this._block_scope || false;
+});
+AST_IterationStatement.DEFMETHOD("is_block_scope", return_true);
+
+AST_Lambda.DEFMETHOD("init_scope_vars", function() {
+    AST_Scope.prototype.init_scope_vars.apply(this, arguments);
+    this.uses_arguments = false;
+    this.def_variable(new AST_SymbolFunarg({
+        name: "arguments",
+        start: this.start,
+        end: this.end
+    }));
+});
+
+AST_Arrow.DEFMETHOD("init_scope_vars", function() {
+    AST_Scope.prototype.init_scope_vars.apply(this, arguments);
+    this.uses_arguments = false;
+});
+
+AST_Symbol.DEFMETHOD("mark_enclosed", function() {
+    var def = this.definition();
+    var s = this.scope;
+    while (s) {
+        push_uniq(s.enclosed, def);
+        if (s === def.scope) break;
+        s = s.parent_scope;
+    }
+});
+
+AST_Symbol.DEFMETHOD("reference", function() {
+    this.definition().references.push(this);
+    this.mark_enclosed();
+});
+
+AST_Scope.DEFMETHOD("find_variable", function(name) {
+    if (name instanceof AST_Symbol) name = name.name;
+    return this.variables.get(name)
+        || (this.parent_scope && this.parent_scope.find_variable(name));
+});
+
+AST_Scope.DEFMETHOD("def_function", function(symbol, init) {
+    var def = this.def_variable(symbol, init);
+    if (!def.init || def.init instanceof AST_Defun) def.init = init;
+    return def;
+});
+
+AST_Scope.DEFMETHOD("def_variable", function(symbol, init) {
+    var def = this.variables.get(symbol.name);
+    if (def) {
+        def.orig.push(symbol);
+        if (def.init && (def.scope !== symbol.scope || def.init instanceof AST_Function)) {
+            def.init = init;
+        }
+    } else {
+        def = new SymbolDef(this, symbol, init);
+        this.variables.set(symbol.name, def);
+        def.global = !this.parent_scope;
+    }
+    return symbol.thedef = def;
+});
+
+function next_mangled(scope, options) {
+    let defun_scope;
+    if (
+        scopes_with_block_defuns
+        && (defun_scope = scope.get_defun_scope())
+        && scopes_with_block_defuns.has(defun_scope)
+    ) {
+        scope = defun_scope;
+    }
+
+    var ext = scope.enclosed;
+    var nth_identifier = options.nth_identifier;
+    out: while (true) {
+        var m = nth_identifier.get(++scope.cname);
+        if (ALL_RESERVED_WORDS.has(m)) continue; // skip over "do"
+
+        // https://github.com/mishoo/UglifyJS2/issues/242 -- do not
+        // shadow a name reserved from mangling.
+        if (options.reserved.has(m)) continue;
+
+        // Functions with short names might collide with base54 output
+        // and therefore cause collisions when keep_fnames is true.
+        if (unmangleable_names && unmangleable_names.has(m)) continue out;
+
+        // we must ensure that the mangled name does not shadow a name
+        // from some parent scope that is referenced in this or in
+        // inner scopes.
+        for (let i = ext.length; --i >= 0;) {
+            const def = ext[i];
+            const name = def.mangled_name || (def.unmangleable(options) && def.name);
+            if (m == name) continue out;
+        }
+        return m;
+    }
+}
+
+AST_Scope.DEFMETHOD("next_mangled", function(options) {
+    return next_mangled(this, options);
+});
+
+AST_Toplevel.DEFMETHOD("next_mangled", function(options) {
+    let name;
+    const mangled_names = this.mangled_names;
+    do {
+        name = next_mangled(this, options);
+    } while (mangled_names.has(name));
+    return name;
+});
+
+AST_Function.DEFMETHOD("next_mangled", function(options, def) {
+    // #179, #326
+    // in Safari strict mode, something like (function x(x){...}) is a syntax error;
+    // a function expression's argument cannot shadow the function expression's name
+
+    var tricky_def = def.orig[0] instanceof AST_SymbolFunarg && this.name && this.name.definition();
+
+    // the function's mangled_name is null when keep_fnames is true
+    var tricky_name = tricky_def ? tricky_def.mangled_name || tricky_def.name : null;
+
+    while (true) {
+        var name = next_mangled(this, options);
+        if (!tricky_name || tricky_name != name)
+            return name;
+    }
+});
+
+AST_Symbol.DEFMETHOD("unmangleable", function(options) {
+    var def = this.definition();
+    return !def || def.unmangleable(options);
+});
+
+// labels are always mangleable
+AST_Label.DEFMETHOD("unmangleable", return_false);
+
+AST_Symbol.DEFMETHOD("unreferenced", function() {
+    return !this.definition().references.length && !this.scope.pinned();
+});
+
+AST_Symbol.DEFMETHOD("definition", function() {
+    return this.thedef;
+});
+
+AST_Symbol.DEFMETHOD("global", function() {
+    return this.thedef.global;
+});
+
+AST_Toplevel.DEFMETHOD("_default_mangler_options", function(options) {
+    options = defaults(options, {
+        eval        : false,
+        nth_identifier : base54,
+        ie8         : false,
+        keep_classnames: false,
+        keep_fnames : false,
+        module      : false,
+        reserved    : [],
+        toplevel    : false,
+    });
+    if (options.module) options.toplevel = true;
+    if (!Array.isArray(options.reserved)
+        && !(options.reserved instanceof Set)
+    ) {
+        options.reserved = [];
+    }
+    options.reserved = new Set(options.reserved);
+    // Never mangle arguments
+    options.reserved.add("arguments");
+    return options;
+});
+
+AST_Toplevel.DEFMETHOD("mangle_names", function(options) {
+    options = this._default_mangler_options(options);
+    var nth_identifier = options.nth_identifier;
+
+    // We only need to mangle declaration nodes.  Special logic wired
+    // into the code generator will display the mangled name if it's
+    // present (and for AST_SymbolRef-s it'll use the mangled name of
+    // the AST_SymbolDeclaration that it points to).
+    var lname = -1;
+    var to_mangle = [];
+
+    if (options.keep_fnames) {
+        function_defs = new Set();
+    }
+
+    const mangled_names = this.mangled_names = new Set();
+    unmangleable_names = new Set();
+
+    if (options.cache) {
+        this.globals.forEach(collect);
+        if (options.cache.props) {
+            options.cache.props.forEach(function(mangled_name) {
+                mangled_names.add(mangled_name);
+            });
+        }
+    }
+
+    var tw = new TreeWalker(function(node, descend) {
+        if (node instanceof AST_LabeledStatement) {
+            // lname is incremented when we get to the AST_Label
+            var save_nesting = lname;
+            descend();
+            lname = save_nesting;
+            return true;        // don't descend again in TreeWalker
+        }
+        if (
+            node instanceof AST_Defun
+            && !(tw.parent() instanceof AST_Scope)
+        ) {
+            scopes_with_block_defuns = scopes_with_block_defuns || new Set();
+            scopes_with_block_defuns.add(node.parent_scope.get_defun_scope());
+        }
+        if (node instanceof AST_Scope) {
+            node.variables.forEach(collect);
+            return;
+        }
+        if (node.is_block_scope()) {
+            node.block_scope.variables.forEach(collect);
+            return;
+        }
+        if (
+            function_defs
+            && node instanceof AST_VarDef
+            && node.value instanceof AST_Lambda
+            && !node.value.name
+            && keep_name(options.keep_fnames, node.name.name)
+        ) {
+            function_defs.add(node.name.definition().id);
+            return;
+        }
+        if (node instanceof AST_Label) {
+            let name;
+            do {
+                name = nth_identifier.get(++lname);
+            } while (ALL_RESERVED_WORDS.has(name));
+            node.mangled_name = name;
+            return true;
+        }
+        if (!(options.ie8 || options.safari10) && node instanceof AST_SymbolCatch) {
+            to_mangle.push(node.definition());
+            return;
+        }
+    });
+
+    this.walk(tw);
+
+    if (options.keep_fnames || options.keep_classnames) {
+        // Collect a set of short names which are unmangleable,
+        // for use in avoiding collisions in next_mangled.
+        to_mangle.forEach(def => {
+            if (def.name.length < 6 && def.unmangleable(options)) {
+                unmangleable_names.add(def.name);
+            }
+        });
+    }
+
+    to_mangle.forEach(def => { def.mangle(options); });
+
+    function_defs = null;
+    unmangleable_names = null;
+    scopes_with_block_defuns = null;
+
+    function collect(symbol) {
+        if (symbol.export & MASK_EXPORT_DONT_MANGLE) {
+            unmangleable_names.add(symbol.name);
+        } else if (!options.reserved.has(symbol.name)) {
+            to_mangle.push(symbol);
+        }
+    }
+});
+
+AST_Toplevel.DEFMETHOD("find_colliding_names", function(options) {
+    const cache = options.cache && options.cache.props;
+    const avoid = new Set();
+    options.reserved.forEach(to_avoid);
+    this.globals.forEach(add_def);
+    this.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_Scope) node.variables.forEach(add_def);
+        if (node instanceof AST_SymbolCatch) add_def(node.definition());
+    }));
+    return avoid;
+
+    function to_avoid(name) {
+        avoid.add(name);
+    }
+
+    function add_def(def) {
+        var name = def.name;
+        if (def.global && cache && cache.has(name)) name = cache.get(name);
+        else if (!def.unmangleable(options)) return;
+        to_avoid(name);
+    }
+});
+
+AST_Toplevel.DEFMETHOD("expand_names", function(options) {
+    options = this._default_mangler_options(options);
+    var nth_identifier = options.nth_identifier;
+    if (nth_identifier.reset && nth_identifier.sort) {
+        nth_identifier.reset();
+        nth_identifier.sort();
+    }
+    var avoid = this.find_colliding_names(options);
+    var cname = 0;
+    this.globals.forEach(rename);
+    this.walk(new TreeWalker(function(node) {
+        if (node instanceof AST_Scope) node.variables.forEach(rename);
+        if (node instanceof AST_SymbolCatch) rename(node.definition());
+    }));
+
+    function next_name() {
+        var name;
+        do {
+            name = nth_identifier.get(cname++);
+        } while (avoid.has(name) || ALL_RESERVED_WORDS.has(name));
+        return name;
+    }
+
+    function rename(def) {
+        if (def.global && options.cache) return;
+        if (def.unmangleable(options)) return;
+        if (options.reserved.has(def.name)) return;
+        const redefinition = redefined_catch_def(def);
+        const name = def.name = redefinition ? redefinition.name : next_name();
+        def.orig.forEach(function(sym) {
+            sym.name = name;
+        });
+        def.references.forEach(function(sym) {
+            sym.name = name;
+        });
+    }
+});
+
+AST_Node.DEFMETHOD("tail_node", return_this);
+AST_Sequence.DEFMETHOD("tail_node", function() {
+    return this.expressions[this.expressions.length - 1];
+});
+
+AST_Toplevel.DEFMETHOD("compute_char_frequency", function(options) {
+    options = this._default_mangler_options(options);
+    var nth_identifier = options.nth_identifier;
+    if (!nth_identifier.reset || !nth_identifier.consider || !nth_identifier.sort) {
+        // If the identifier mangler is invariant, skip computing character frequency.
+        return;
+    }
+    nth_identifier.reset();
+
+    try {
+        AST_Node.prototype.print = function(stream, force_parens) {
+            this._print(stream, force_parens);
+            if (this instanceof AST_Symbol && !this.unmangleable(options)) {
+                nth_identifier.consider(this.name, -1);
+            } else if (options.properties) {
+                if (this instanceof AST_DotHash) {
+                    nth_identifier.consider("#" + this.property, -1);
+                } else if (this instanceof AST_Dot) {
+                    nth_identifier.consider(this.property, -1);
+                } else if (this instanceof AST_Sub) {
+                    skip_string(this.property);
+                }
+            }
+        };
+        nth_identifier.consider(this.print_to_string(), 1);
+    } finally {
+        AST_Node.prototype.print = AST_Node.prototype._print;
+    }
+    nth_identifier.sort();
+
+    function skip_string(node) {
+        if (node instanceof AST_String) {
+            nth_identifier.consider(node.value, -1);
+        } else if (node instanceof AST_Conditional) {
+            skip_string(node.consequent);
+            skip_string(node.alternative);
+        } else if (node instanceof AST_Sequence) {
+            skip_string(node.tail_node());
+        }
+    }
+});
+
+const base54 = (() => {
+    const leading = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_".split("");
+    const digits = "0123456789".split("");
+    let chars;
+    let frequency;
+    function reset() {
+        frequency = new Map();
+        leading.forEach(function(ch) {
+            frequency.set(ch, 0);
+        });
+        digits.forEach(function(ch) {
+            frequency.set(ch, 0);
+        });
+    }
+    function consider(str, delta) {
+        for (var i = str.length; --i >= 0;) {
+            frequency.set(str[i], frequency.get(str[i]) + delta);
+        }
+    }
+    function compare(a, b) {
+        return frequency.get(b) - frequency.get(a);
+    }
+    function sort() {
+        chars = mergeSort(leading, compare).concat(mergeSort(digits, compare));
+    }
+    // Ensure this is in a usable initial state.
+    reset();
+    sort();
+    function base54(num) {
+        var ret = "", base = 54;
+        num++;
+        do {
+            num--;
+            ret += chars[num % base];
+            num = Math.floor(num / base);
+            base = 64;
+        } while (num > 0);
+        return ret;
+    }
+
+    return {
+        get: base54,
+        consider,
+        reset,
+        sort
+    };
+})();
+
+export {
+    base54,
+    SymbolDef,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/size.js b/node_modules/mathjs/examples/node_modules/terser/lib/size.js
new file mode 100644
index 0000000..24ee39a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/size.js
@@ -0,0 +1,490 @@
+import {
+    AST_Accessor,
+    AST_Array,
+    AST_Arrow,
+    AST_Await,
+    AST_BigInt,
+    AST_Binary,
+    AST_Block,
+    AST_Break,
+    AST_Call,
+    AST_Case,
+    AST_Class,
+    AST_ClassPrivateProperty,
+    AST_ClassProperty,
+    AST_ConciseMethod,
+    AST_Conditional,
+    AST_Const,
+    AST_Continue,
+    AST_Debugger,
+    AST_Default,
+    AST_Defun,
+    AST_Destructuring,
+    AST_Directive,
+    AST_Do,
+    AST_Dot,
+    AST_DotHash,
+    AST_EmptyStatement,
+    AST_Expansion,
+    AST_Export,
+    AST_False,
+    AST_For,
+    AST_ForIn,
+    AST_Function,
+    AST_Hole,
+    AST_If,
+    AST_Import,
+    AST_ImportMeta,
+    AST_Infinity,
+    AST_LabeledStatement,
+    AST_Let,
+    AST_NameMapping,
+    AST_NaN,
+    AST_New,
+    AST_NewTarget,
+    AST_Node,
+    AST_Null,
+    AST_Number,
+    AST_Object,
+    AST_ObjectKeyVal,
+    AST_ObjectGetter,
+    AST_ObjectSetter,
+    AST_PrivateGetter,
+    AST_PrivateMethod,
+    AST_PrivateSetter,
+    AST_RegExp,
+    AST_Return,
+    AST_Sequence,
+    AST_String,
+    AST_Sub,
+    AST_Super,
+    AST_Switch,
+    AST_Symbol,
+    AST_SymbolClassProperty,
+    AST_SymbolExportForeign,
+    AST_SymbolImportForeign,
+    AST_SymbolRef,
+    AST_SymbolDeclaration,
+    AST_TemplateSegment,
+    AST_TemplateString,
+    AST_This,
+    AST_Throw,
+    AST_Toplevel,
+    AST_True,
+    AST_Try,
+    AST_Catch,
+    AST_Finally,
+    AST_Unary,
+    AST_Undefined,
+    AST_Var,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield,
+    walk_parent
+} from "./ast.js";
+import { first_in_statement } from "./utils/first_in_statement.js";
+
+let mangle_options = undefined;
+AST_Node.prototype.size = function (compressor, stack) {
+    mangle_options = compressor && compressor.mangle_options;
+
+    let size = 0;
+    walk_parent(this, (node, info) => {
+        size += node._size(info);
+
+        // Braceless arrow functions have fake "return" statements
+        if (node instanceof AST_Arrow && node.is_braceless()) {
+            size += node.body[0].value._size(info);
+            return true;
+        }
+    }, stack || (compressor && compressor.stack));
+
+    // just to save a bit of memory
+    mangle_options = undefined;
+
+    return size;
+};
+
+AST_Node.prototype._size = () => 0;
+
+AST_Debugger.prototype._size = () => 8;
+
+AST_Directive.prototype._size = function () {
+    // TODO string encoding stuff
+    return 2 + this.value.length;
+};
+
+const list_overhead = (array) => array.length && array.length - 1;
+
+AST_Block.prototype._size = function () {
+    return 2 + list_overhead(this.body);
+};
+
+AST_Toplevel.prototype._size = function() {
+    return list_overhead(this.body);
+};
+
+AST_EmptyStatement.prototype._size = () => 1;
+
+AST_LabeledStatement.prototype._size = () => 2;  // x:
+
+AST_Do.prototype._size = () => 9;
+
+AST_While.prototype._size = () => 7;
+
+AST_For.prototype._size = () => 8;
+
+AST_ForIn.prototype._size = () => 8;
+// AST_ForOf inherits ^
+
+AST_With.prototype._size = () => 6;
+
+AST_Expansion.prototype._size = () => 3;
+
+const lambda_modifiers = func =>
+    (func.is_generator ? 1 : 0) + (func.async ? 6 : 0);
+
+AST_Accessor.prototype._size = function () {
+    return lambda_modifiers(this) + 4 + list_overhead(this.argnames) + list_overhead(this.body);
+};
+
+AST_Function.prototype._size = function (info) {
+    const first = !!first_in_statement(info);
+    return (first * 2) + lambda_modifiers(this) + 12 + list_overhead(this.argnames) + list_overhead(this.body);
+};
+
+AST_Defun.prototype._size = function () {
+    return lambda_modifiers(this) + 13 + list_overhead(this.argnames) + list_overhead(this.body);
+};
+
+AST_Arrow.prototype._size = function () {
+    let args_and_arrow = 2 + list_overhead(this.argnames);
+
+    if (
+        !(
+            this.argnames.length === 1
+            && this.argnames[0] instanceof AST_Symbol
+        )
+    ) {
+        args_and_arrow += 2;
+    }
+
+    const body_overhead = this.is_braceless() ? 0 : list_overhead(this.body) + 2;
+
+    return lambda_modifiers(this) + args_and_arrow + body_overhead;
+};
+
+AST_Destructuring.prototype._size = () => 2;
+
+AST_TemplateString.prototype._size = function () {
+    return 2 + (Math.floor(this.segments.length / 2) * 3);  /* "${}" */
+};
+
+AST_TemplateSegment.prototype._size = function () {
+    return this.value.length;
+};
+
+AST_Return.prototype._size = function () {
+    return this.value ? 7 : 6;
+};
+
+AST_Throw.prototype._size = () => 6;
+
+AST_Break.prototype._size = function () {
+    return this.label ? 6 : 5;
+};
+
+AST_Continue.prototype._size = function () {
+    return this.label ? 9 : 8;
+};
+
+AST_If.prototype._size = () => 4;
+
+AST_Switch.prototype._size = function () {
+    return 8 + list_overhead(this.body);
+};
+
+AST_Case.prototype._size = function () {
+    return 5 + list_overhead(this.body);
+};
+
+AST_Default.prototype._size = function () {
+    return 8 + list_overhead(this.body);
+};
+
+AST_Try.prototype._size = function () {
+    return 3 + list_overhead(this.body);
+};
+
+AST_Catch.prototype._size = function () {
+    let size = 7 + list_overhead(this.body);
+    if (this.argname) {
+        size += 2;
+    }
+    return size;
+};
+
+AST_Finally.prototype._size = function () {
+    return 7 + list_overhead(this.body);
+};
+
+/*#__INLINE__*/
+const def_size = (size, def) => size + list_overhead(def.definitions);
+
+AST_Var.prototype._size = function () {
+    return def_size(4, this);
+};
+
+AST_Let.prototype._size = function () {
+    return def_size(4, this);
+};
+
+AST_Const.prototype._size = function () {
+    return def_size(6, this);
+};
+
+AST_VarDef.prototype._size = function () {
+    return this.value ? 1 : 0;
+};
+
+AST_NameMapping.prototype._size = function () {
+    // foreign name isn't mangled
+    return this.name ? 4 : 0;
+};
+
+AST_Import.prototype._size = function () {
+    // import
+    let size = 6;
+
+    if (this.imported_name) size += 1;
+
+    // from
+    if (this.imported_name || this.imported_names) size += 5;
+
+    // braces, and the commas
+    if (this.imported_names) {
+        size += 2 + list_overhead(this.imported_names);
+    }
+
+    return size;
+};
+
+AST_ImportMeta.prototype._size = () => 11;
+
+AST_Export.prototype._size = function () {
+    let size = 7 + (this.is_default ? 8 : 0);
+
+    if (this.exported_value) {
+        size += this.exported_value._size();
+    }
+
+    if (this.exported_names) {
+        // Braces and commas
+        size += 2 + list_overhead(this.exported_names);
+    }
+
+    if (this.module_name) {
+        // "from "
+        size += 5;
+    }
+
+    return size;
+};
+
+AST_Call.prototype._size = function () {
+    if (this.optional) {
+        return 4 + list_overhead(this.args);
+    }
+    return 2 + list_overhead(this.args);
+};
+
+AST_New.prototype._size = function () {
+    return 6 + list_overhead(this.args);
+};
+
+AST_Sequence.prototype._size = function () {
+    return list_overhead(this.expressions);
+};
+
+AST_Dot.prototype._size = function () {
+    if (this.optional) {
+        return this.property.length + 2;
+    }
+    return this.property.length + 1;
+};
+
+AST_DotHash.prototype._size = function () {
+    if (this.optional) {
+        return this.property.length + 3;
+    }
+    return this.property.length + 2;
+};
+
+AST_Sub.prototype._size = function () {
+    return this.optional ? 4 : 2;
+};
+
+AST_Unary.prototype._size = function () {
+    if (this.operator === "typeof") return 7;
+    if (this.operator === "void") return 5;
+    return this.operator.length;
+};
+
+AST_Binary.prototype._size = function (info) {
+    if (this.operator === "in") return 4;
+
+    let size = this.operator.length;
+
+    if (
+        (this.operator === "+" || this.operator === "-")
+        && this.right instanceof AST_Unary && this.right.operator === this.operator
+    ) {
+        // 1+ +a > needs space between the +
+        size += 1;
+    }
+
+    if (this.needs_parens(info)) {
+        size += 2;
+    }
+
+    return size;
+};
+
+AST_Conditional.prototype._size = () => 3;
+
+AST_Array.prototype._size = function () {
+    return 2 + list_overhead(this.elements);
+};
+
+AST_Object.prototype._size = function (info) {
+    let base = 2;
+    if (first_in_statement(info)) {
+        base += 2; // parens
+    }
+    return base + list_overhead(this.properties);
+};
+
+/*#__INLINE__*/
+const key_size = key =>
+    typeof key === "string" ? key.length : 0;
+
+AST_ObjectKeyVal.prototype._size = function () {
+    return key_size(this.key) + 1;
+};
+
+/*#__INLINE__*/
+const static_size = is_static => is_static ? 7 : 0;
+
+AST_ObjectGetter.prototype._size = function () {
+    return 5 + static_size(this.static) + key_size(this.key);
+};
+
+AST_ObjectSetter.prototype._size = function () {
+    return 5 + static_size(this.static) + key_size(this.key);
+};
+
+AST_ConciseMethod.prototype._size = function () {
+    return static_size(this.static) + key_size(this.key) + lambda_modifiers(this);
+};
+
+AST_PrivateMethod.prototype._size = function () {
+    return AST_ConciseMethod.prototype._size.call(this) + 1;
+};
+
+AST_PrivateGetter.prototype._size = AST_PrivateSetter.prototype._size = function () {
+    return AST_ConciseMethod.prototype._size.call(this) + 4;
+};
+
+AST_Class.prototype._size = function () {
+    return (
+        (this.name ? 8 : 7)
+        + (this.extends ? 8 : 0)
+    );
+};
+
+AST_ClassProperty.prototype._size = function () {
+    return (
+        static_size(this.static)
+        + (typeof this.key === "string" ? this.key.length + 2 : 0)
+        + (this.value ? 1 : 0)
+    );
+};
+
+AST_ClassPrivateProperty.prototype._size = function () {
+    return AST_ClassProperty.prototype._size.call(this) + 1;
+};
+
+AST_Symbol.prototype._size = function () {
+    return !mangle_options || this.definition().unmangleable(mangle_options)
+        ? this.name.length
+        : 1;
+};
+
+// TODO take propmangle into account
+AST_SymbolClassProperty.prototype._size = function () {
+    return this.name.length;
+};
+
+AST_SymbolRef.prototype._size = AST_SymbolDeclaration.prototype._size = function () {
+    const { name, thedef } = this;
+
+    if (thedef && thedef.global) return name.length;
+
+    if (name === "arguments") return 9;
+
+    return AST_Symbol.prototype._size.call(this);
+};
+
+AST_NewTarget.prototype._size = () => 10;
+
+AST_SymbolImportForeign.prototype._size = function () {
+    return this.name.length;
+};
+
+AST_SymbolExportForeign.prototype._size = function () {
+    return this.name.length;
+};
+
+AST_This.prototype._size = () => 4;
+
+AST_Super.prototype._size = () => 5;
+
+AST_String.prototype._size = function () {
+    return this.value.length + 2;
+};
+
+AST_Number.prototype._size = function () {
+    const { value } = this;
+    if (value === 0) return 1;
+    if (value > 0 && Math.floor(value) === value) {
+        return Math.floor(Math.log10(value) + 1);
+    }
+    return value.toString().length;
+};
+
+AST_BigInt.prototype._size = function () {
+    return this.value.length;
+};
+
+AST_RegExp.prototype._size = function () {
+    return this.value.toString().length;
+};
+
+AST_Null.prototype._size = () => 4;
+
+AST_NaN.prototype._size = () => 3;
+
+AST_Undefined.prototype._size = () => 6; // "void 0"
+
+AST_Hole.prototype._size = () => 0;  // comma is taken into account
+
+AST_Infinity.prototype._size = () => 8;
+
+AST_True.prototype._size = () => 4;
+
+AST_False.prototype._size = () => 5;
+
+AST_Await.prototype._size = () => 6;
+
+AST_Yield.prototype._size = () => 6;
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/sourcemap.js b/node_modules/mathjs/examples/node_modules/terser/lib/sourcemap.js
new file mode 100644
index 0000000..178a208
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/sourcemap.js
@@ -0,0 +1,114 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+
+import MOZ_SourceMap from "source-map";
+import {
+    defaults,
+} from "./utils/index.js";
+
+// a small wrapper around fitzgen's source-map library
+async function SourceMap(options) {
+    options = defaults(options, {
+        file : null,
+        root : null,
+        orig : null,
+
+        orig_line_diff : 0,
+        dest_line_diff : 0,
+    });
+
+    var orig_map;
+    var generator = new MOZ_SourceMap.SourceMapGenerator({
+        file       : options.file,
+        sourceRoot : options.root
+    });
+
+    if (options.orig) {
+        orig_map = await new MOZ_SourceMap.SourceMapConsumer(options.orig);
+        orig_map.sources.forEach(function(source) {
+            var sourceContent = orig_map.sourceContentFor(source, true);
+            if (sourceContent) {
+                generator.setSourceContent(source, sourceContent);
+            }
+        });
+    }
+
+    function add(source, gen_line, gen_col, orig_line, orig_col, name) {
+        if (orig_map) {
+            var info = orig_map.originalPositionFor({
+                line: orig_line,
+                column: orig_col
+            });
+            if (info.source === null) {
+                return;
+            }
+            source = info.source;
+            orig_line = info.line;
+            orig_col = info.column;
+            name = info.name || name;
+        }
+        generator.addMapping({
+            generated : { line: gen_line + options.dest_line_diff, column: gen_col },
+            original  : { line: orig_line + options.orig_line_diff, column: orig_col },
+            source    : source,
+            name      : name
+        });
+    }
+
+    return {
+        add        : add,
+        get        : function() { return generator; },
+        toString   : function() { return generator.toString(); },
+        destroy    : function () {
+            if (orig_map && orig_map.destroy) {
+                orig_map.destroy();
+            }
+        }
+    };
+}
+
+export {
+    SourceMap,
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/transform.js b/node_modules/mathjs/examples/node_modules/terser/lib/transform.js
new file mode 100644
index 0000000..346ae59
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/transform.js
@@ -0,0 +1,318 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+
+import {
+    AST_Array,
+    AST_Await,
+    AST_Binary,
+    AST_Block,
+    AST_Call,
+    AST_Case,
+    AST_Catch,
+    AST_Chain,
+    AST_Class,
+    AST_Conditional,
+    AST_Definitions,
+    AST_Destructuring,
+    AST_Do,
+    AST_Exit,
+    AST_Expansion,
+    AST_Export,
+    AST_For,
+    AST_ForIn,
+    AST_If,
+    AST_Import,
+    AST_LabeledStatement,
+    AST_Lambda,
+    AST_LoopControl,
+    AST_NameMapping,
+    AST_Node,
+    AST_Number,
+    AST_Object,
+    AST_ObjectProperty,
+    AST_PrefixedTemplateString,
+    AST_PropAccess,
+    AST_Sequence,
+    AST_SimpleStatement,
+    AST_Sub,
+    AST_Switch,
+    AST_TemplateString,
+    AST_Try,
+    AST_Unary,
+    AST_VarDef,
+    AST_While,
+    AST_With,
+    AST_Yield,
+} from "./ast.js";
+import {
+    MAP,
+    noop,
+} from "./utils/index.js";
+
+function def_transform(node, descend) {
+    node.DEFMETHOD("transform", function(tw, in_list) {
+        let transformed = undefined;
+        tw.push(this);
+        if (tw.before) transformed = tw.before(this, descend, in_list);
+        if (transformed === undefined) {
+            transformed = this;
+            descend(transformed, tw);
+            if (tw.after) {
+                const after_ret = tw.after(transformed, in_list);
+                if (after_ret !== undefined) transformed = after_ret;
+            }
+        }
+        tw.pop();
+        return transformed;
+    });
+}
+
+function do_list(list, tw) {
+    return MAP(list, function(node) {
+        return node.transform(tw, true);
+    });
+}
+
+def_transform(AST_Node, noop);
+
+def_transform(AST_LabeledStatement, function(self, tw) {
+    self.label = self.label.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_SimpleStatement, function(self, tw) {
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_Block, function(self, tw) {
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Do, function(self, tw) {
+    self.body = self.body.transform(tw);
+    self.condition = self.condition.transform(tw);
+});
+
+def_transform(AST_While, function(self, tw) {
+    self.condition = self.condition.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_For, function(self, tw) {
+    if (self.init) self.init = self.init.transform(tw);
+    if (self.condition) self.condition = self.condition.transform(tw);
+    if (self.step) self.step = self.step.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_ForIn, function(self, tw) {
+    self.init = self.init.transform(tw);
+    self.object = self.object.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_With, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.body = self.body.transform(tw);
+});
+
+def_transform(AST_Exit, function(self, tw) {
+    if (self.value) self.value = self.value.transform(tw);
+});
+
+def_transform(AST_LoopControl, function(self, tw) {
+    if (self.label) self.label = self.label.transform(tw);
+});
+
+def_transform(AST_If, function(self, tw) {
+    self.condition = self.condition.transform(tw);
+    self.body = self.body.transform(tw);
+    if (self.alternative) self.alternative = self.alternative.transform(tw);
+});
+
+def_transform(AST_Switch, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Case, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Try, function(self, tw) {
+    self.body = do_list(self.body, tw);
+    if (self.bcatch) self.bcatch = self.bcatch.transform(tw);
+    if (self.bfinally) self.bfinally = self.bfinally.transform(tw);
+});
+
+def_transform(AST_Catch, function(self, tw) {
+    if (self.argname) self.argname = self.argname.transform(tw);
+    self.body = do_list(self.body, tw);
+});
+
+def_transform(AST_Definitions, function(self, tw) {
+    self.definitions = do_list(self.definitions, tw);
+});
+
+def_transform(AST_VarDef, function(self, tw) {
+    self.name = self.name.transform(tw);
+    if (self.value) self.value = self.value.transform(tw);
+});
+
+def_transform(AST_Destructuring, function(self, tw) {
+    self.names = do_list(self.names, tw);
+});
+
+def_transform(AST_Lambda, function(self, tw) {
+    if (self.name) self.name = self.name.transform(tw);
+    self.argnames = do_list(self.argnames, tw);
+    if (self.body instanceof AST_Node) {
+        self.body = self.body.transform(tw);
+    } else {
+        self.body = do_list(self.body, tw);
+    }
+});
+
+def_transform(AST_Call, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.args = do_list(self.args, tw);
+});
+
+def_transform(AST_Sequence, function(self, tw) {
+    const result = do_list(self.expressions, tw);
+    self.expressions = result.length
+        ? result
+        : [new AST_Number({ value: 0 })];
+});
+
+def_transform(AST_PropAccess, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Sub, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+    self.property = self.property.transform(tw);
+});
+
+def_transform(AST_Chain, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Yield, function(self, tw) {
+    if (self.expression) self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Await, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Unary, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_Binary, function(self, tw) {
+    self.left = self.left.transform(tw);
+    self.right = self.right.transform(tw);
+});
+
+def_transform(AST_Conditional, function(self, tw) {
+    self.condition = self.condition.transform(tw);
+    self.consequent = self.consequent.transform(tw);
+    self.alternative = self.alternative.transform(tw);
+});
+
+def_transform(AST_Array, function(self, tw) {
+    self.elements = do_list(self.elements, tw);
+});
+
+def_transform(AST_Object, function(self, tw) {
+    self.properties = do_list(self.properties, tw);
+});
+
+def_transform(AST_ObjectProperty, function(self, tw) {
+    if (self.key instanceof AST_Node) {
+        self.key = self.key.transform(tw);
+    }
+    if (self.value) self.value = self.value.transform(tw);
+});
+
+def_transform(AST_Class, function(self, tw) {
+    if (self.name) self.name = self.name.transform(tw);
+    if (self.extends) self.extends = self.extends.transform(tw);
+    self.properties = do_list(self.properties, tw);
+});
+
+def_transform(AST_Expansion, function(self, tw) {
+    self.expression = self.expression.transform(tw);
+});
+
+def_transform(AST_NameMapping, function(self, tw) {
+    self.foreign_name = self.foreign_name.transform(tw);
+    self.name = self.name.transform(tw);
+});
+
+def_transform(AST_Import, function(self, tw) {
+    if (self.imported_name) self.imported_name = self.imported_name.transform(tw);
+    if (self.imported_names) do_list(self.imported_names, tw);
+    self.module_name = self.module_name.transform(tw);
+});
+
+def_transform(AST_Export, function(self, tw) {
+    if (self.exported_definition) self.exported_definition = self.exported_definition.transform(tw);
+    if (self.exported_value) self.exported_value = self.exported_value.transform(tw);
+    if (self.exported_names) do_list(self.exported_names, tw);
+    if (self.module_name) self.module_name = self.module_name.transform(tw);
+});
+
+def_transform(AST_TemplateString, function(self, tw) {
+    self.segments = do_list(self.segments, tw);
+});
+
+def_transform(AST_PrefixedTemplateString, function(self, tw) {
+    self.prefix = self.prefix.transform(tw);
+    self.template_string = self.template_string.transform(tw);
+});
+
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/utils/first_in_statement.js b/node_modules/mathjs/examples/node_modules/terser/lib/utils/first_in_statement.js
new file mode 100644
index 0000000..19228b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/utils/first_in_statement.js
@@ -0,0 +1,50 @@
+import {
+    AST_Binary,
+    AST_Conditional,
+    AST_Dot,
+    AST_Object,
+    AST_Sequence,
+    AST_Statement,
+    AST_Sub,
+    AST_UnaryPostfix,
+    AST_PrefixedTemplateString
+} from "../ast.js";
+
+// return true if the node at the top of the stack (that means the
+// innermost node in the current output) is lexically the first in
+// a statement.
+function first_in_statement(stack) {
+    let node = stack.parent(-1);
+    for (let i = 0, p; p = stack.parent(i); i++) {
+        if (p instanceof AST_Statement && p.body === node)
+            return true;
+        if ((p instanceof AST_Sequence && p.expressions[0] === node) ||
+            (p.TYPE === "Call" && p.expression === node) ||
+            (p instanceof AST_PrefixedTemplateString && p.prefix === node) ||
+            (p instanceof AST_Dot && p.expression === node) ||
+            (p instanceof AST_Sub && p.expression === node) ||
+            (p instanceof AST_Conditional && p.condition === node) ||
+            (p instanceof AST_Binary && p.left === node) ||
+            (p instanceof AST_UnaryPostfix && p.expression === node)
+        ) {
+            node = p;
+        } else {
+            return false;
+        }
+    }
+}
+
+// Returns whether the leftmost item in the expression is an object
+function left_is_object(node) {
+    if (node instanceof AST_Object) return true;
+    if (node instanceof AST_Sequence) return left_is_object(node.expressions[0]);
+    if (node.TYPE === "Call") return left_is_object(node.expression);
+    if (node instanceof AST_PrefixedTemplateString) return left_is_object(node.prefix);
+    if (node instanceof AST_Dot || node instanceof AST_Sub) return left_is_object(node.expression);
+    if (node instanceof AST_Conditional) return left_is_object(node.condition);
+    if (node instanceof AST_Binary) return left_is_object(node.left);
+    if (node instanceof AST_UnaryPostfix) return left_is_object(node.expression);
+    return false;
+}
+
+export { first_in_statement, left_is_object };
diff --git a/node_modules/mathjs/examples/node_modules/terser/lib/utils/index.js b/node_modules/mathjs/examples/node_modules/terser/lib/utils/index.js
new file mode 100644
index 0000000..df86464
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/lib/utils/index.js
@@ -0,0 +1,302 @@
+/***********************************************************************
+
+  A JavaScript tokenizer / parser / beautifier / compressor.
+  https://github.com/mishoo/UglifyJS2
+
+  -------------------------------- (C) ---------------------------------
+
+                           Author: Mihai Bazon
+                         <mihai.bazon@gmail.com>
+                       http://mihai.bazon.net/blog
+
+  Distributed under the BSD license:
+
+    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+        * Redistributions of source code must retain the above
+          copyright notice, this list of conditions and the following
+          disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials
+          provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+
+function characters(str) {
+    return str.split("");
+}
+
+function member(name, array) {
+    return array.includes(name);
+}
+
+class DefaultsError extends Error {
+    constructor(msg, defs) {
+        super();
+
+        this.name = "DefaultsError";
+        this.message = msg;
+        this.defs = defs;
+    }
+}
+
+function defaults(args, defs, croak) {
+    if (args === true) {
+        args = {};
+    } else if (args != null && typeof args === "object") {
+        args = {...args};
+    }
+
+    const ret = args || {};
+
+    if (croak) for (const i in ret) if (HOP(ret, i) && !HOP(defs, i)) {
+        throw new DefaultsError("`" + i + "` is not a supported option", defs);
+    }
+
+    for (const i in defs) if (HOP(defs, i)) {
+        if (!args || !HOP(args, i)) {
+            ret[i] = defs[i];
+        } else if (i === "ecma") {
+            let ecma = args[i] | 0;
+            if (ecma > 5 && ecma < 2015) ecma += 2009;
+            ret[i] = ecma;
+        } else {
+            ret[i] = (args && HOP(args, i)) ? args[i] : defs[i];
+        }
+    }
+
+    return ret;
+}
+
+function noop() {}
+function return_false() { return false; }
+function return_true() { return true; }
+function return_this() { return this; }
+function return_null() { return null; }
+
+var MAP = (function() {
+    function MAP(a, f, backwards) {
+        var ret = [], top = [], i;
+        function doit() {
+            var val = f(a[i], i);
+            var is_last = val instanceof Last;
+            if (is_last) val = val.v;
+            if (val instanceof AtTop) {
+                val = val.v;
+                if (val instanceof Splice) {
+                    top.push.apply(top, backwards ? val.v.slice().reverse() : val.v);
+                } else {
+                    top.push(val);
+                }
+            } else if (val !== skip) {
+                if (val instanceof Splice) {
+                    ret.push.apply(ret, backwards ? val.v.slice().reverse() : val.v);
+                } else {
+                    ret.push(val);
+                }
+            }
+            return is_last;
+        }
+        if (Array.isArray(a)) {
+            if (backwards) {
+                for (i = a.length; --i >= 0;) if (doit()) break;
+                ret.reverse();
+                top.reverse();
+            } else {
+                for (i = 0; i < a.length; ++i) if (doit()) break;
+            }
+        } else {
+            for (i in a) if (HOP(a, i)) if (doit()) break;
+        }
+        return top.concat(ret);
+    }
+    MAP.at_top = function(val) { return new AtTop(val); };
+    MAP.splice = function(val) { return new Splice(val); };
+    MAP.last = function(val) { return new Last(val); };
+    var skip = MAP.skip = {};
+    function AtTop(val) { this.v = val; }
+    function Splice(val) { this.v = val; }
+    function Last(val) { this.v = val; }
+    return MAP;
+})();
+
+function make_node(ctor, orig, props) {
+    if (!props) props = {};
+    if (orig) {
+        if (!props.start) props.start = orig.start;
+        if (!props.end) props.end = orig.end;
+    }
+    return new ctor(props);
+}
+
+function push_uniq(array, el) {
+    if (!array.includes(el))
+        array.push(el);
+}
+
+function string_template(text, props) {
+    return text.replace(/{(.+?)}/g, function(str, p) {
+        return props && props[p];
+    });
+}
+
+function remove(array, el) {
+    for (var i = array.length; --i >= 0;) {
+        if (array[i] === el) array.splice(i, 1);
+    }
+}
+
+function mergeSort(array, cmp) {
+    if (array.length < 2) return array.slice();
+    function merge(a, b) {
+        var r = [], ai = 0, bi = 0, i = 0;
+        while (ai < a.length && bi < b.length) {
+            cmp(a[ai], b[bi]) <= 0
+                ? r[i++] = a[ai++]
+                : r[i++] = b[bi++];
+        }
+        if (ai < a.length) r.push.apply(r, a.slice(ai));
+        if (bi < b.length) r.push.apply(r, b.slice(bi));
+        return r;
+    }
+    function _ms(a) {
+        if (a.length <= 1)
+            return a;
+        var m = Math.floor(a.length / 2), left = a.slice(0, m), right = a.slice(m);
+        left = _ms(left);
+        right = _ms(right);
+        return merge(left, right);
+    }
+    return _ms(array);
+}
+
+function makePredicate(words) {
+    if (!Array.isArray(words)) words = words.split(" ");
+
+    return new Set(words.sort());
+}
+
+function map_add(map, key, value) {
+    if (map.has(key)) {
+        map.get(key).push(value);
+    } else {
+        map.set(key, [ value ]);
+    }
+}
+
+function map_from_object(obj) {
+    var map = new Map();
+    for (var key in obj) {
+        if (HOP(obj, key) && key.charAt(0) === "$") {
+            map.set(key.substr(1), obj[key]);
+        }
+    }
+    return map;
+}
+
+function map_to_object(map) {
+    var obj = Object.create(null);
+    map.forEach(function (value, key) {
+        obj["$" + key] = value;
+    });
+    return obj;
+}
+
+function HOP(obj, prop) {
+    return Object.prototype.hasOwnProperty.call(obj, prop);
+}
+
+function keep_name(keep_setting, name) {
+    return keep_setting === true
+        || (keep_setting instanceof RegExp && keep_setting.test(name));
+}
+
+var lineTerminatorEscape = {
+    "\0": "0",
+    "\n": "n",
+    "\r": "r",
+    "\u2028": "u2028",
+    "\u2029": "u2029",
+};
+function regexp_source_fix(source) {
+    // V8 does not escape line terminators in regexp patterns in node 12
+    // We'll also remove literal \0
+    return source.replace(/[\0\n\r\u2028\u2029]/g, function (match, offset) {
+        var escaped = source[offset - 1] == "\\"
+            && (source[offset - 2] != "\\"
+            || /(?:^|[^\\])(?:\\{2})*$/.test(source.slice(0, offset - 1)));
+        return (escaped ? "" : "\\") + lineTerminatorEscape[match];
+    });
+}
+const all_flags = "gimuy";
+function sort_regexp_flags(flags) {
+    const existing_flags = new Set(flags.split(""));
+    let out = "";
+    for (const flag of all_flags) {
+        if (existing_flags.has(flag)) {
+            out += flag;
+            existing_flags.delete(flag);
+        }
+    }
+    if (existing_flags.size) {
+        // Flags Terser doesn't know about
+        existing_flags.forEach(flag => { out += flag; });
+    }
+    return out;
+}
+
+function has_annotation(node, annotation) {
+    return node._annotations & annotation;
+}
+
+function set_annotation(node, annotation) {
+    node._annotations |= annotation;
+}
+
+export {
+    characters,
+    defaults,
+    HOP,
+    keep_name,
+    make_node,
+    makePredicate,
+    map_add,
+    map_from_object,
+    map_to_object,
+    MAP,
+    member,
+    mergeSort,
+    noop,
+    push_uniq,
+    regexp_source_fix,
+    remove,
+    return_false,
+    return_null,
+    return_this,
+    return_true,
+    sort_regexp_flags,
+    string_template,
+    has_annotation,
+    set_annotation
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/main.js b/node_modules/mathjs/examples/node_modules/terser/main.js
new file mode 100644
index 0000000..0a10db5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/main.js
@@ -0,0 +1,27 @@
+import "./lib/transform.js";
+import "./lib/mozilla-ast.js";
+import { minify } from "./lib/minify.js";
+
+export { minify } from "./lib/minify.js";
+export { run_cli as _run_cli } from "./lib/cli.js";
+
+export async function _default_options() {
+    const defs = {};
+
+    Object.keys(infer_options({ 0: 0 })).forEach((component) => {
+        const options = infer_options({
+            [component]: {0: 0}
+        });
+
+        if (options) defs[component] = options;
+    });
+    return defs;
+}
+
+async function infer_options(options) {
+    try {
+        await minify("", options);
+    } catch (error) {
+        return error.defs;
+    }
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/CHANGELOG.md
new file mode 100644
index 0000000..ef31a09
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/CHANGELOG.md
@@ -0,0 +1,344 @@
+# Change Log
+
+## 0.7.3
+
+* Fix a bug where nested uses of `SourceMapConsumer` could result in a
+  `TypeError`. [#338](https://github.com/mozilla/source-map/issues/338)
+  [#330](https://github.com/mozilla/source-map/issues/330)
+  [#319](https://github.com/mozilla/source-map/issues/319)
+
+## 0.7.2
+
+* Another 3x speed up in `SourceMapConsumer`. Read about it here:
+  http://fitzgeraldnick.com/2018/02/26/speed-without-wizardry.html
+
+## 0.7.1
+
+* Updated TypeScript typings. [#321][]
+
+[#321]: https://github.com/mozilla/source-map/pull/321
+
+## 0.7.0
+
+* `SourceMapConsumer` now uses WebAssembly, and is **much** faster! Read about
+  it here:
+  https://hacks.mozilla.org/2018/01/oxidizing-source-maps-with-rust-and-webassembly/
+
+* **Breaking change:** `new SourceMapConsumer` now returns a `Promise` object
+  that resolves to the newly constructed `SourceMapConsumer` instance, rather
+  than returning the new instance immediately.
+
+* **Breaking change:** when you're done using a `SourceMapConsumer` instance,
+  you must call `SourceMapConsumer.prototype.destroy` on it. After calling
+  `destroy`, you must not use the instance again.
+
+* **Breaking change:** `SourceMapConsumer` used to be able to handle lines,
+  columns numbers and source and name indices up to `2^53 - 1` (aka
+  `Number.MAX_SAFE_INTEGER`). It can now only handle them up to `2^32 - 1`.
+
+* **Breaking change:** The `source-map` library now uses modern ECMAScript-isms:
+  `let`, arrow functions, `async`, etc. Use Babel to compile it down to
+  ECMAScript 5 if you need to support older JavaScript environments.
+
+* **Breaking change:** Drop support for Node < 8. If you want to support older
+versions of node, please use v0.6 or below.
+
+## 0.5.6
+
+* Fix for regression when people were using numbers as names in source maps. See
+  #236.
+
+## 0.5.5
+
+* Fix "regression" of unsupported, implementation behavior that half the world
+  happens to have come to depend on. See #235.
+
+* Fix regression involving function hoisting in SpiderMonkey. See #233.
+
+## 0.5.4
+
+* Large performance improvements to source-map serialization. See #228 and #229.
+
+## 0.5.3
+
+* Do not include unnecessary distribution files. See
+  commit ef7006f8d1647e0a83fdc60f04f5a7ca54886f86.
+
+## 0.5.2
+
+* Include browser distributions of the library in package.json's `files`. See
+  issue #212.
+
+## 0.5.1
+
+* Fix latent bugs in IndexedSourceMapConsumer.prototype._parseMappings. See
+  ff05274becc9e6e1295ed60f3ea090d31d843379.
+
+## 0.5.0
+
+* Node 0.8 is no longer supported.
+
+* Use webpack instead of dryice for bundling.
+
+* Big speedups serializing source maps. See pull request #203.
+
+* Fix a bug with `SourceMapConsumer.prototype.sourceContentFor` and sources that
+  explicitly start with the source root. See issue #199.
+
+## 0.4.4
+
+* Fix an issue where using a `SourceMapGenerator` after having created a
+  `SourceMapConsumer` from it via `SourceMapConsumer.fromSourceMap` failed. See
+  issue #191.
+
+* Fix an issue with where `SourceMapGenerator` would mistakenly consider
+  different mappings as duplicates of each other and avoid generating them. See
+  issue #192.
+
+## 0.4.3
+
+* A very large number of performance improvements, particularly when parsing
+  source maps. Collectively about 75% of time shaved off of the source map
+  parsing benchmark!
+
+* Fix a bug in `SourceMapConsumer.prototype.allGeneratedPositionsFor` and fuzzy
+  searching in the presence of a column option. See issue #177.
+
+* Fix a bug with joining a source and its source root when the source is above
+  the root. See issue #182.
+
+* Add the `SourceMapConsumer.prototype.hasContentsOfAllSources` method to
+  determine when all sources' contents are inlined into the source map. See
+  issue #190.
+
+## 0.4.2
+
+* Add an `.npmignore` file so that the benchmarks aren't pulled down by
+  dependent projects. Issue #169.
+
+* Add an optional `column` argument to
+  `SourceMapConsumer.prototype.allGeneratedPositionsFor` and better handle lines
+  with no mappings. Issues #172 and #173.
+
+## 0.4.1
+
+* Fix accidentally defining a global variable. #170.
+
+## 0.4.0
+
+* The default direction for fuzzy searching was changed back to its original
+  direction. See #164.
+
+* There is now a `bias` option you can supply to `SourceMapConsumer` to control
+  the fuzzy searching direction. See #167.
+
+* About an 8% speed up in parsing source maps. See #159.
+
+* Added a benchmark for parsing and generating source maps.
+
+## 0.3.0
+
+* Change the default direction that searching for positions fuzzes when there is
+  not an exact match. See #154.
+
+* Support for environments using json2.js for JSON serialization. See #156.
+
+## 0.2.0
+
+* Support for consuming "indexed" source maps which do not have any remote
+  sections. See pull request #127. This introduces a minor backwards
+  incompatibility if you are monkey patching `SourceMapConsumer.prototype`
+  methods.
+
+## 0.1.43
+
+* Performance improvements for `SourceMapGenerator` and `SourceNode`. See issue
+  #148 for some discussion and issues #150, #151, and #152 for implementations.
+
+## 0.1.42
+
+* Fix an issue where `SourceNode`s from different versions of the source-map
+  library couldn't be used in conjunction with each other. See issue #142.
+
+## 0.1.41
+
+* Fix a bug with getting the source content of relative sources with a "./"
+  prefix. See issue #145 and [Bug 1090768](bugzil.la/1090768).
+
+* Add the `SourceMapConsumer.prototype.computeColumnSpans` method to compute the
+  column span of each mapping.
+
+* Add the `SourceMapConsumer.prototype.allGeneratedPositionsFor` method to find
+  all generated positions associated with a given original source and line.
+
+## 0.1.40
+
+* Performance improvements for parsing source maps in SourceMapConsumer.
+
+## 0.1.39
+
+* Fix a bug where setting a source's contents to null before any source content
+  had been set before threw a TypeError. See issue #131.
+
+## 0.1.38
+
+* Fix a bug where finding relative paths from an empty path were creating
+  absolute paths. See issue #129.
+
+## 0.1.37
+
+* Fix a bug where if the source root was an empty string, relative source paths
+  would turn into absolute source paths. Issue #124.
+
+## 0.1.36
+
+* Allow the `names` mapping property to be an empty string. Issue #121.
+
+## 0.1.35
+
+* A third optional parameter was added to `SourceNode.fromStringWithSourceMap`
+  to specify a path that relative sources in the second parameter should be
+  relative to. Issue #105.
+
+* If no file property is given to a `SourceMapGenerator`, then the resulting
+  source map will no longer have a `null` file property. The property will
+  simply not exist. Issue #104.
+
+* Fixed a bug where consecutive newlines were ignored in `SourceNode`s.
+  Issue #116.
+
+## 0.1.34
+
+* Make `SourceNode` work with windows style ("\r\n") newlines. Issue #103.
+
+* Fix bug involving source contents and the
+  `SourceMapGenerator.prototype.applySourceMap`. Issue #100.
+
+## 0.1.33
+
+* Fix some edge cases surrounding path joining and URL resolution.
+
+* Add a third parameter for relative path to
+  `SourceMapGenerator.prototype.applySourceMap`.
+
+* Fix issues with mappings and EOLs.
+
+## 0.1.32
+
+* Fixed a bug where SourceMapConsumer couldn't handle negative relative columns
+  (issue 92).
+
+* Fixed test runner to actually report number of failed tests as its process
+  exit code.
+
+* Fixed a typo when reporting bad mappings (issue 87).
+
+## 0.1.31
+
+* Delay parsing the mappings in SourceMapConsumer until queried for a source
+  location.
+
+* Support Sass source maps (which at the time of writing deviate from the spec
+  in small ways) in SourceMapConsumer.
+
+## 0.1.30
+
+* Do not join source root with a source, when the source is a data URI.
+
+* Extend the test runner to allow running single specific test files at a time.
+
+* Performance improvements in `SourceNode.prototype.walk` and
+  `SourceMapConsumer.prototype.eachMapping`.
+
+* Source map browser builds will now work inside Workers.
+
+* Better error messages when attempting to add an invalid mapping to a
+  `SourceMapGenerator`.
+
+## 0.1.29
+
+* Allow duplicate entries in the `names` and `sources` arrays of source maps
+  (usually from TypeScript) we are parsing. Fixes github issue 72.
+
+## 0.1.28
+
+* Skip duplicate mappings when creating source maps from SourceNode; github
+  issue 75.
+
+## 0.1.27
+
+* Don't throw an error when the `file` property is missing in SourceMapConsumer,
+  we don't use it anyway.
+
+## 0.1.26
+
+* Fix SourceNode.fromStringWithSourceMap for empty maps. Fixes github issue 70.
+
+## 0.1.25
+
+* Make compatible with browserify
+
+## 0.1.24
+
+* Fix issue with absolute paths and `file://` URIs. See
+  https://bugzilla.mozilla.org/show_bug.cgi?id=885597
+
+## 0.1.23
+
+* Fix issue with absolute paths and sourcesContent, github issue 64.
+
+## 0.1.22
+
+* Ignore duplicate mappings in SourceMapGenerator. Fixes github issue 21.
+
+## 0.1.21
+
+* Fixed handling of sources that start with a slash so that they are relative to
+  the source root's host.
+
+## 0.1.20
+
+* Fixed github issue #43: absolute URLs aren't joined with the source root
+  anymore.
+
+## 0.1.19
+
+* Using Travis CI to run tests.
+
+## 0.1.18
+
+* Fixed a bug in the handling of sourceRoot.
+
+## 0.1.17
+
+* Added SourceNode.fromStringWithSourceMap.
+
+## 0.1.16
+
+* Added missing documentation.
+
+* Fixed the generating of empty mappings in SourceNode.
+
+## 0.1.15
+
+* Added SourceMapGenerator.applySourceMap.
+
+## 0.1.14
+
+* The sourceRoot is now handled consistently.
+
+## 0.1.13
+
+* Added SourceMapGenerator.fromSourceMap.
+
+## 0.1.12
+
+* SourceNode now generates empty mappings too.
+
+## 0.1.11
+
+* Added name support to SourceNode.
+
+## 0.1.10
+
+* Added sourcesContent support to the customer and generator.
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/LICENSE b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/LICENSE
new file mode 100644
index 0000000..ed1b7cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/LICENSE
@@ -0,0 +1,28 @@
+
+Copyright (c) 2009-2011, Mozilla Foundation and contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the names of the Mozilla Foundation nor the names of project
+  contributors may be used to endorse or promote products derived from this
+  software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/README.md b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/README.md
new file mode 100644
index 0000000..db20846
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/README.md
@@ -0,0 +1,822 @@
+# Source Map
+
+[![Build Status](https://travis-ci.org/mozilla/source-map.png?branch=master)](https://travis-ci.org/mozilla/source-map)
+
+[![Coverage Status](https://coveralls.io/repos/github/mozilla/source-map/badge.svg)](https://coveralls.io/github/mozilla/source-map)
+
+[![NPM](https://nodei.co/npm/source-map.png?downloads=true&downloadRank=true)](https://www.npmjs.com/package/source-map)
+
+This is a library to generate and consume the source map format
+[described here][format].
+
+[format]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit
+
+## Use with Node
+
+    $ npm install source-map
+
+## Use on the Web
+
+    <script src="https://unpkg.com/source-map@0.7.3/dist/source-map.js"></script>
+    <script>
+        sourceMap.SourceMapConsumer.initialize({
+            "lib/mappings.wasm": "https://unpkg.com/source-map@0.7.3/lib/mappings.wasm"
+        });
+    </script>
+
+--------------------------------------------------------------------------------
+
+<!-- `npm run toc` to regenerate the Table of Contents -->
+
+<!-- START doctoc generated TOC please keep comment here to allow auto update -->
+<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN doctoc TO UPDATE -->
+## Table of Contents
+
+- [Examples](#examples)
+  - [Consuming a source map](#consuming-a-source-map)
+  - [Generating a source map](#generating-a-source-map)
+    - [With SourceNode (high level API)](#with-sourcenode-high-level-api)
+    - [With SourceMapGenerator (low level API)](#with-sourcemapgenerator-low-level-api)
+- [API](#api)
+  - [SourceMapConsumer](#sourcemapconsumer)
+    - [SourceMapConsumer.initialize(options)](#sourcemapconsumerinitializeoptions)
+    - [new SourceMapConsumer(rawSourceMap)](#new-sourcemapconsumerrawsourcemap)
+    - [SourceMapConsumer.with](#sourcemapconsumerwith)
+    - [SourceMapConsumer.prototype.destroy()](#sourcemapconsumerprototypedestroy)
+    - [SourceMapConsumer.prototype.computeColumnSpans()](#sourcemapconsumerprototypecomputecolumnspans)
+    - [SourceMapConsumer.prototype.originalPositionFor(generatedPosition)](#sourcemapconsumerprototypeoriginalpositionforgeneratedposition)
+    - [SourceMapConsumer.prototype.generatedPositionFor(originalPosition)](#sourcemapconsumerprototypegeneratedpositionfororiginalposition)
+    - [SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)](#sourcemapconsumerprototypeallgeneratedpositionsfororiginalposition)
+    - [SourceMapConsumer.prototype.hasContentsOfAllSources()](#sourcemapconsumerprototypehascontentsofallsources)
+    - [SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])](#sourcemapconsumerprototypesourcecontentforsource-returnnullonmissing)
+    - [SourceMapConsumer.prototype.eachMapping(callback, context, order)](#sourcemapconsumerprototypeeachmappingcallback-context-order)
+  - [SourceMapGenerator](#sourcemapgenerator)
+    - [new SourceMapGenerator([startOfSourceMap])](#new-sourcemapgeneratorstartofsourcemap)
+    - [SourceMapGenerator.fromSourceMap(sourceMapConsumer)](#sourcemapgeneratorfromsourcemapsourcemapconsumer)
+    - [SourceMapGenerator.prototype.addMapping(mapping)](#sourcemapgeneratorprototypeaddmappingmapping)
+    - [SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)](#sourcemapgeneratorprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])](#sourcemapgeneratorprototypeapplysourcemapsourcemapconsumer-sourcefile-sourcemappath)
+    - [SourceMapGenerator.prototype.toString()](#sourcemapgeneratorprototypetostring)
+  - [SourceNode](#sourcenode)
+    - [new SourceNode([line, column, source[, chunk[, name]]])](#new-sourcenodeline-column-source-chunk-name)
+    - [SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])](#sourcenodefromstringwithsourcemapcode-sourcemapconsumer-relativepath)
+    - [SourceNode.prototype.add(chunk)](#sourcenodeprototypeaddchunk)
+    - [SourceNode.prototype.prepend(chunk)](#sourcenodeprototypeprependchunk)
+    - [SourceNode.prototype.setSourceContent(sourceFile, sourceContent)](#sourcenodeprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceNode.prototype.walk(fn)](#sourcenodeprototypewalkfn)
+    - [SourceNode.prototype.walkSourceContents(fn)](#sourcenodeprototypewalksourcecontentsfn)
+    - [SourceNode.prototype.join(sep)](#sourcenodeprototypejoinsep)
+    - [SourceNode.prototype.replaceRight(pattern, replacement)](#sourcenodeprototypereplacerightpattern-replacement)
+    - [SourceNode.prototype.toString()](#sourcenodeprototypetostring)
+    - [SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])](#sourcenodeprototypetostringwithsourcemapstartofsourcemap)
+
+<!-- END doctoc generated TOC please keep comment here to allow auto update -->
+
+## Examples
+
+### Consuming a source map
+
+```js
+const rawSourceMap = {
+  version: 3,
+  file: 'min.js',
+  names: ['bar', 'baz', 'n'],
+  sources: ['one.js', 'two.js'],
+  sourceRoot: 'http://example.com/www/js/',
+  mappings: 'CAAC,IAAI,IAAM,SAAUA,GAClB,OAAOC,IAAID;CCDb,IAAI,IAAM,SAAUE,GAClB,OAAOA'
+};
+
+const whatever = await SourceMapConsumer.with(rawSourceMap, null, consumer => {
+
+  console.log(consumer.sources);
+  // [ 'http://example.com/www/js/one.js',
+  //   'http://example.com/www/js/two.js' ]
+
+  console.log(consumer.originalPositionFor({
+    line: 2,
+    column: 28
+  }));
+  // { source: 'http://example.com/www/js/two.js',
+  //   line: 2,
+  //   column: 10,
+  //   name: 'n' }
+
+  console.log(consumer.generatedPositionFor({
+    source: 'http://example.com/www/js/two.js',
+    line: 2,
+    column: 10
+  }));
+  // { line: 2, column: 28 }
+
+  consumer.eachMapping(function (m) {
+    // ...
+  });
+
+  return computeWhatever();
+});
+```
+
+### Generating a source map
+
+In depth guide:
+[**Compiling to JavaScript, and Debugging with Source Maps**](https://hacks.mozilla.org/2013/05/compiling-to-javascript-and-debugging-with-source-maps/)
+
+#### With SourceNode (high level API)
+
+```js
+function compile(ast) {
+  switch (ast.type) {
+  case 'BinaryExpression':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      [compile(ast.left), " + ", compile(ast.right)]
+    );
+  case 'Literal':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      String(ast.value)
+    );
+  // ...
+  default:
+    throw new Error("Bad AST");
+  }
+}
+
+var ast = parse("40 + 2", "add.js");
+console.log(compile(ast).toStringWithSourceMap({
+  file: 'add.js'
+}));
+// { code: '40 + 2',
+//   map: [object SourceMapGenerator] }
+```
+
+#### With SourceMapGenerator (low level API)
+
+```js
+var map = new SourceMapGenerator({
+  file: "source-mapped.js"
+});
+
+map.addMapping({
+  generated: {
+    line: 10,
+    column: 35
+  },
+  source: "foo.js",
+  original: {
+    line: 33,
+    column: 2
+  },
+  name: "christopher"
+});
+
+console.log(map.toString());
+// '{"version":3,"file":"source-mapped.js","sources":["foo.js"],"names":["christopher"],"mappings":";;;;;;;;;mCAgCEA"}'
+```
+
+## API
+
+Get a reference to the module:
+
+```js
+// Node.js
+var sourceMap = require('source-map');
+
+// Browser builds
+var sourceMap = window.sourceMap;
+
+// Inside Firefox
+const sourceMap = require("devtools/toolkit/sourcemap/source-map.js");
+```
+
+### SourceMapConsumer
+
+A `SourceMapConsumer` instance represents a parsed source map which we can query
+for information about the original file positions by giving it a file position
+in the generated source.
+
+#### SourceMapConsumer.initialize(options)
+
+When using `SourceMapConsumer` outside of node.js, for example on the Web, it
+needs to know from what URL to load `lib/mappings.wasm`. You must inform it by
+calling `initialize` before constructing any `SourceMapConsumer`s.
+
+The options object has the following properties:
+
+* `"lib/mappings.wasm"`: A `String` containing the URL of the
+  `lib/mappings.wasm` file.
+
+```js
+sourceMap.SourceMapConsumer.initialize({
+  "lib/mappings.wasm": "https://example.com/source-map/lib/mappings.wasm"
+});
+```
+
+#### new SourceMapConsumer(rawSourceMap)
+
+The only parameter is the raw source map (either as a string which can be
+`JSON.parse`'d, or an object). According to the spec, source maps have the
+following attributes:
+
+* `version`: Which version of the source map spec this map is following.
+
+* `sources`: An array of URLs to the original source files.
+
+* `names`: An array of identifiers which can be referenced by individual
+  mappings.
+
+* `sourceRoot`: Optional. The URL root from which all sources are relative.
+
+* `sourcesContent`: Optional. An array of contents of the original source files.
+
+* `mappings`: A string of base64 VLQs which contain the actual mappings.
+
+* `file`: Optional. The generated filename this source map is associated with.
+
+The promise of the constructed souce map consumer is returned.
+
+When the `SourceMapConsumer` will no longer be used anymore, you must call its
+`destroy` method.
+
+```js
+const consumer = await new sourceMap.SourceMapConsumer(rawSourceMapJsonData);
+doStuffWith(consumer);
+consumer.destroy();
+```
+
+Alternatively, you can use `SourceMapConsumer.with` to avoid needing to remember
+to call `destroy`.
+
+#### SourceMapConsumer.with
+
+Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+(see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+value.
+
+You must not use the consumer after `f` completes!
+
+By using `with`, you do not have to remember to manually call `destroy` on
+the consumer, since it will be called automatically once `f` completes.
+
+```js
+const xSquared = await SourceMapConsumer.with(
+  myRawSourceMap,
+  null,
+  async function (consumer) {
+    // Use `consumer` inside here and don't worry about remembering
+    // to call `destroy`.
+
+    const x = await whatever(consumer);
+    return x * x;
+  }
+);
+
+// You may not use that `consumer` anymore out here; it has
+// been destroyed. But you can use `xSquared`.
+console.log(xSquared);
+```
+
+#### SourceMapConsumer.prototype.destroy()
+
+Free this source map consumer's associated wasm data that is manually-managed.
+
+```js
+consumer.destroy();
+```
+
+Alternatively, you can use `SourceMapConsumer.with` to avoid needing to remember
+to call `destroy`.
+
+#### SourceMapConsumer.prototype.computeColumnSpans()
+
+Compute the last column for each generated mapping. The last column is
+inclusive.
+
+```js
+// Before:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+
+consumer.computeColumnSpans();
+
+// After:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1,
+//     lastColumn: 9 },
+//   { line: 2,
+//     column: 10,
+//     lastColumn: 19 },
+//   { line: 2,
+//     column: 20,
+//     lastColumn: Infinity } ]
+```
+
+#### SourceMapConsumer.prototype.originalPositionFor(generatedPosition)
+
+Returns the original source, line, and column information for the generated
+source's line and column positions provided. The only argument is an object with
+the following properties:
+
+* `line`: The line number in the generated source.  Line numbers in
+  this library are 1-based (note that the underlying source map
+  specification uses 0-based line numbers -- this library handles the
+  translation).
+
+* `column`: The column number in the generated source.  Column numbers
+  in this library are 0-based.
+
+* `bias`: Either `SourceMapConsumer.GREATEST_LOWER_BOUND` or
+  `SourceMapConsumer.LEAST_UPPER_BOUND`. Specifies whether to return the closest
+  element that is smaller than or greater than the one we are searching for,
+  respectively, if the exact element cannot be found.  Defaults to
+  `SourceMapConsumer.GREATEST_LOWER_BOUND`.
+
+and an object is returned with the following properties:
+
+* `source`: The original source file, or null if this information is not
+  available.
+
+* `line`: The line number in the original source, or null if this information is
+  not available.  The line number is 1-based.
+
+* `column`: The column number in the original source, or null if this
+  information is not available.  The column number is 0-based.
+
+* `name`: The original identifier, or null if this information is not available.
+
+```js
+consumer.originalPositionFor({ line: 2, column: 10 })
+// { source: 'foo.coffee',
+//   line: 2,
+//   column: 2,
+//   name: null }
+
+consumer.originalPositionFor({ line: 99999999999999999, column: 999999999999999 })
+// { source: null,
+//   line: null,
+//   column: null,
+//   name: null }
+```
+
+#### SourceMapConsumer.prototype.generatedPositionFor(originalPosition)
+
+Returns the generated line and column information for the original source,
+line, and column positions provided. The only argument is an object with
+the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: The column number in the original source.  The column
+  number is 0-based.
+
+and an object is returned with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.generatedPositionFor({ source: "example.js", line: 2, column: 10 })
+// { line: 1,
+//   column: 56 }
+```
+
+#### SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)
+
+Returns all generated line and column information for the original source, line,
+and column provided. If no column is provided, returns all mappings
+corresponding to a either the line we are searching for or the next closest line
+that has any mappings. Otherwise, returns all mappings corresponding to the
+given line and either the column we are searching for or the next closest column
+that has any offsets.
+
+The only argument is an object with the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: Optional. The column number in the original source.  The
+  column number is 0-based.
+
+and an array of objects is returned, each with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.allGeneratedpositionsfor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+```
+
+#### SourceMapConsumer.prototype.hasContentsOfAllSources()
+
+Return true if we have the embedded source content for every source listed in
+the source map, false otherwise.
+
+In other words, if this method returns `true`, then
+`consumer.sourceContentFor(s)` will succeed for every source `s` in
+`consumer.sources`.
+
+```js
+// ...
+if (consumer.hasContentsOfAllSources()) {
+  consumerReadyCallback(consumer);
+} else {
+  fetchSources(consumer, consumerReadyCallback);
+}
+// ...
+```
+
+#### SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])
+
+Returns the original source content for the source provided. The only
+argument is the URL of the original source file.
+
+If the source content for the given source is not found, then an error is
+thrown. Optionally, pass `true` as the second param to have `null` returned
+instead.
+
+```js
+consumer.sources
+// [ "my-cool-lib.clj" ]
+
+consumer.sourceContentFor("my-cool-lib.clj")
+// "..."
+
+consumer.sourceContentFor("this is not in the source map");
+// Error: "this is not in the source map" is not in the source map
+
+consumer.sourceContentFor("this is not in the source map", true);
+// null
+```
+
+#### SourceMapConsumer.prototype.eachMapping(callback, context, order)
+
+Iterate over each mapping between an original source/line/column and a
+generated line/column in this source map.
+
+* `callback`: The function that is called with each mapping. Mappings have the
+  form `{ source, generatedLine, generatedColumn, originalLine, originalColumn,
+  name }`
+
+* `context`: Optional. If specified, this object will be the value of `this`
+  every time that `callback` is called.
+
+* `order`: Either `SourceMapConsumer.GENERATED_ORDER` or
+  `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to iterate over
+  the mappings sorted by the generated file's line/column order or the
+  original's source/line/column order, respectively. Defaults to
+  `SourceMapConsumer.GENERATED_ORDER`.
+
+```js
+consumer.eachMapping(function (m) { console.log(m); })
+// ...
+// { source: 'illmatic.js',
+//   generatedLine: 1,
+//   generatedColumn: 0,
+//   originalLine: 1,
+//   originalColumn: 0,
+//   name: null }
+// { source: 'illmatic.js',
+//   generatedLine: 2,
+//   generatedColumn: 0,
+//   originalLine: 2,
+//   originalColumn: 0,
+//   name: null }
+// ...
+```
+### SourceMapGenerator
+
+An instance of the SourceMapGenerator represents a source map which is being
+built incrementally.
+
+#### new SourceMapGenerator([startOfSourceMap])
+
+You may pass an object with the following properties:
+
+* `file`: The filename of the generated source that this source map is
+  associated with.
+
+* `sourceRoot`: A root for all relative URLs in this source map.
+
+* `skipValidation`: Optional. When `true`, disables validation of mappings as
+  they are added. This can improve performance but should be used with
+  discretion, as a last resort. Even then, one should avoid using this flag when
+  running tests, if possible.
+
+```js
+var generator = new sourceMap.SourceMapGenerator({
+  file: "my-generated-javascript-file.js",
+  sourceRoot: "http://example.com/app/js/"
+});
+```
+
+#### SourceMapGenerator.fromSourceMap(sourceMapConsumer)
+
+Creates a new `SourceMapGenerator` from an existing `SourceMapConsumer` instance.
+
+* `sourceMapConsumer` The SourceMap.
+
+```js
+var generator = sourceMap.SourceMapGenerator.fromSourceMap(consumer);
+```
+
+#### SourceMapGenerator.prototype.addMapping(mapping)
+
+Add a single mapping from original source line and column to the generated
+source's line and column for this source map being created. The mapping object
+should have the following properties:
+
+* `generated`: An object with the generated line and column positions.
+
+* `original`: An object with the original line and column positions.
+
+* `source`: The original source file (relative to the sourceRoot).
+
+* `name`: An optional original token name for this mapping.
+
+```js
+generator.addMapping({
+  source: "module-one.scm",
+  original: { line: 128, column: 0 },
+  generated: { line: 3, column: 456 }
+})
+```
+
+#### SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for an original source file.
+
+* `sourceFile` the URL of the original source file.
+
+* `sourceContent` the content of the source file.
+
+```js
+generator.setSourceContent("module-one.scm",
+                           fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])
+
+Applies a SourceMap for a source file to the SourceMap.
+Each mapping to the supplied source file is rewritten using the
+supplied SourceMap. Note: The resolution for the resulting mappings
+is the minimum of this map and the supplied map.
+
+* `sourceMapConsumer`: The SourceMap to be applied.
+
+* `sourceFile`: Optional. The filename of the source file.
+  If omitted, sourceMapConsumer.file will be used, if it exists.
+  Otherwise an error will be thrown.
+
+* `sourceMapPath`: Optional. The dirname of the path to the SourceMap
+  to be applied. If relative, it is relative to the SourceMap.
+
+  This parameter is needed when the two SourceMaps aren't in the same
+  directory, and the SourceMap to be applied contains relative source
+  paths. If so, those relative source paths need to be rewritten
+  relative to the SourceMap.
+
+  If omitted, it is assumed that both SourceMaps are in the same directory,
+  thus not needing any rewriting. (Supplying `'.'` has the same effect.)
+
+#### SourceMapGenerator.prototype.toString()
+
+Renders the source map being generated to a string.
+
+```js
+generator.toString()
+// '{"version":3,"sources":["module-one.scm"],"names":[],"mappings":"...snip...","file":"my-generated-javascript-file.js","sourceRoot":"http://example.com/app/js/"}'
+```
+
+### SourceNode
+
+SourceNodes provide a way to abstract over interpolating and/or concatenating
+snippets of generated JavaScript source code, while maintaining the line and
+column information associated between those snippets and the original source
+code. This is useful as the final intermediate representation a compiler might
+use before outputting the generated JS and source map.
+
+#### new SourceNode([line, column, source[, chunk[, name]]])
+
+* `line`: The original line number associated with this source node, or null if
+  it isn't associated with an original line.  The line number is 1-based.
+
+* `column`: The original column number associated with this source node, or null
+  if it isn't associated with an original column.  The column number
+  is 0-based.
+
+* `source`: The original source's filename; null if no filename is provided.
+
+* `chunk`: Optional. Is immediately passed to `SourceNode.prototype.add`, see
+  below.
+
+* `name`: Optional. The original identifier.
+
+```js
+var node = new SourceNode(1, 2, "a.cpp", [
+  new SourceNode(3, 4, "b.cpp", "extern int status;\n"),
+  new SourceNode(5, 6, "c.cpp", "std::string* make_string(size_t n);\n"),
+  new SourceNode(7, 8, "d.cpp", "int main(int argc, char** argv) {}\n"),
+]);
+```
+
+#### SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])
+
+Creates a SourceNode from generated code and a SourceMapConsumer.
+
+* `code`: The generated code
+
+* `sourceMapConsumer` The SourceMap for the generated code
+
+* `relativePath` The optional path that relative sources in `sourceMapConsumer`
+  should be relative to.
+
+```js
+const consumer = await new SourceMapConsumer(fs.readFileSync("path/to/my-file.js.map", "utf8"));
+const node = SourceNode.fromStringWithSourceMap(fs.readFileSync("path/to/my-file.js"), consumer);
+```
+
+#### SourceNode.prototype.add(chunk)
+
+Add a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.add(" + ");
+node.add(otherNode);
+node.add([leftHandOperandNode, " + ", rightHandOperandNode]);
+```
+
+#### SourceNode.prototype.prepend(chunk)
+
+Prepend a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.prepend("/** Build Id: f783haef86324gf **/\n\n");
+```
+
+#### SourceNode.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for a source file. This will be added to the
+`SourceMap` in the `sourcesContent` field.
+
+* `sourceFile`: The filename of the source file
+
+* `sourceContent`: The content of the source file
+
+```js
+node.setSourceContent("module-one.scm",
+                      fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceNode.prototype.walk(fn)
+
+Walk over the tree of JS snippets in this node and its children. The walking
+function is called once for each snippet of JS and is passed that snippet and
+the its original associated source's line/column location.
+
+* `fn`: The traversal function.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.walk(function (code, loc) { console.log("WALK:", code, loc); })
+// WALK: uno { source: 'b.js', line: 3, column: 4, name: null }
+// WALK: dos { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: tres { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: quatro { source: 'c.js', line: 5, column: 6, name: null }
+```
+
+#### SourceNode.prototype.walkSourceContents(fn)
+
+Walk over the tree of SourceNodes. The walking function is called for each
+source file content and is passed the filename and source content.
+
+* `fn`: The traversal function.
+
+```js
+var a = new SourceNode(1, 2, "a.js", "generated from a");
+a.setSourceContent("a.js", "original a");
+var b = new SourceNode(1, 2, "b.js", "generated from b");
+b.setSourceContent("b.js", "original b");
+var c = new SourceNode(1, 2, "c.js", "generated from c");
+c.setSourceContent("c.js", "original c");
+
+var node = new SourceNode(null, null, null, [a, b, c]);
+node.walkSourceContents(function (source, contents) { console.log("WALK:", source, ":", contents); })
+// WALK: a.js : original a
+// WALK: b.js : original b
+// WALK: c.js : original c
+```
+
+#### SourceNode.prototype.join(sep)
+
+Like `Array.prototype.join` except for SourceNodes. Inserts the separator
+between each of this source node's children.
+
+* `sep`: The separator.
+
+```js
+var lhs = new SourceNode(1, 2, "a.rs", "my_copy");
+var operand = new SourceNode(3, 4, "a.rs", "=");
+var rhs = new SourceNode(5, 6, "a.rs", "orig.clone()");
+
+var node = new SourceNode(null, null, null, [ lhs, operand, rhs ]);
+var joinedNode = node.join(" ");
+```
+
+#### SourceNode.prototype.replaceRight(pattern, replacement)
+
+Call `String.prototype.replace` on the very right-most source snippet. Useful
+for trimming white space from the end of a source node, etc.
+
+* `pattern`: The pattern to replace.
+
+* `replacement`: The thing to replace the pattern with.
+
+```js
+// Trim trailing white space.
+node.replaceRight(/\s*$/, "");
+```
+
+#### SourceNode.prototype.toString()
+
+Return the string representation of this source node. Walks over the tree and
+concatenates all the various snippets together to one string.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toString()
+// 'unodostresquatro'
+```
+
+#### SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])
+
+Returns the string representation of this tree of source nodes, plus a
+SourceMapGenerator which contains all the mappings between the generated and
+original sources.
+
+The arguments are the same as those to `new SourceMapGenerator`.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toStringWithSourceMap({ file: "my-output-file.js" })
+// { code: 'unodostresquatro',
+//   map: [object SourceMapGenerator] }
+```
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/dist/source-map.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/dist/source-map.js
new file mode 100644
index 0000000..a947957
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/dist/source-map.js
@@ -0,0 +1,3351 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory(require("fs"), require("path"));
+	else if(typeof define === 'function' && define.amd)
+		define(["fs", "path"], factory);
+	else if(typeof exports === 'object')
+		exports["sourceMap"] = factory(require("fs"), require("path"));
+	else
+		root["sourceMap"] = factory(root["fs"], root["path"]);
+})(typeof self !== 'undefined' ? self : this, function(__WEBPACK_EXTERNAL_MODULE_10__, __WEBPACK_EXTERNAL_MODULE_11__) {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+/******/
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+/******/
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId]) {
+/******/ 			return installedModules[moduleId].exports;
+/******/ 		}
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			i: moduleId,
+/******/ 			l: false,
+/******/ 			exports: {}
+/******/ 		};
+/******/
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+/******/
+/******/ 		// Flag the module as loaded
+/******/ 		module.l = true;
+/******/
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+/******/
+/******/
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+/******/
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+/******/
+/******/ 	// define getter function for harmony exports
+/******/ 	__webpack_require__.d = function(exports, name, getter) {
+/******/ 		if(!__webpack_require__.o(exports, name)) {
+/******/ 			Object.defineProperty(exports, name, {
+/******/ 				configurable: false,
+/******/ 				enumerable: true,
+/******/ 				get: getter
+/******/ 			});
+/******/ 		}
+/******/ 	};
+/******/
+/******/ 	// getDefaultExport function for compatibility with non-harmony modules
+/******/ 	__webpack_require__.n = function(module) {
+/******/ 		var getter = module && module.__esModule ?
+/******/ 			function getDefault() { return module['default']; } :
+/******/ 			function getModuleExports() { return module; };
+/******/ 		__webpack_require__.d(getter, 'a', getter);
+/******/ 		return getter;
+/******/ 	};
+/******/
+/******/ 	// Object.prototype.hasOwnProperty.call
+/******/ 	__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
+/******/
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+/******/
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(__webpack_require__.s = 5);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * This is a helper function for getting values from parameter/options
+ * objects.
+ *
+ * @param args The object we are extracting values from
+ * @param name The name of the property we are getting.
+ * @param defaultValue An optional value to return if the property is missing
+ * from the object. If this is not specified and the property is missing, an
+ * error will be thrown.
+ */
+function getArg(aArgs, aName, aDefaultValue) {
+  if (aName in aArgs) {
+    return aArgs[aName];
+  } else if (arguments.length === 3) {
+    return aDefaultValue;
+  }
+    throw new Error('"' + aName + '" is a required argument.');
+
+}
+exports.getArg = getArg;
+
+const urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+const dataUrlRegexp = /^data:.+\,.+$/;
+
+function urlParse(aUrl) {
+  const match = aUrl.match(urlRegexp);
+  if (!match) {
+    return null;
+  }
+  return {
+    scheme: match[1],
+    auth: match[2],
+    host: match[3],
+    port: match[4],
+    path: match[5]
+  };
+}
+exports.urlParse = urlParse;
+
+function urlGenerate(aParsedUrl) {
+  let url = "";
+  if (aParsedUrl.scheme) {
+    url += aParsedUrl.scheme + ":";
+  }
+  url += "//";
+  if (aParsedUrl.auth) {
+    url += aParsedUrl.auth + "@";
+  }
+  if (aParsedUrl.host) {
+    url += aParsedUrl.host;
+  }
+  if (aParsedUrl.port) {
+    url += ":" + aParsedUrl.port;
+  }
+  if (aParsedUrl.path) {
+    url += aParsedUrl.path;
+  }
+  return url;
+}
+exports.urlGenerate = urlGenerate;
+
+const MAX_CACHED_INPUTS = 32;
+
+/**
+ * Takes some function `f(input) -> result` and returns a memoized version of
+ * `f`.
+ *
+ * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+ * memoization is a dumb-simple, linear least-recently-used cache.
+ */
+function lruMemoize(f) {
+  const cache = [];
+
+  return function(input) {
+    for (let i = 0; i < cache.length; i++) {
+      if (cache[i].input === input) {
+        const temp = cache[0];
+        cache[0] = cache[i];
+        cache[i] = temp;
+        return cache[0].result;
+      }
+    }
+
+    const result = f(input);
+
+    cache.unshift({
+      input,
+      result,
+    });
+
+    if (cache.length > MAX_CACHED_INPUTS) {
+      cache.pop();
+    }
+
+    return result;
+  };
+}
+
+/**
+ * Normalizes a path, or the path portion of a URL:
+ *
+ * - Replaces consecutive slashes with one slash.
+ * - Removes unnecessary '.' parts.
+ * - Removes unnecessary '<dir>/..' parts.
+ *
+ * Based on code in the Node.js 'path' core module.
+ *
+ * @param aPath The path or url to normalize.
+ */
+const normalize = lruMemoize(function normalize(aPath) {
+  let path = aPath;
+  const url = urlParse(aPath);
+  if (url) {
+    if (!url.path) {
+      return aPath;
+    }
+    path = url.path;
+  }
+  const isAbsolute = exports.isAbsolute(path);
+
+  // Split the path into parts between `/` characters. This is much faster than
+  // using `.split(/\/+/g)`.
+  const parts = [];
+  let start = 0;
+  let i = 0;
+  while (true) {
+    start = i;
+    i = path.indexOf("/", start);
+    if (i === -1) {
+      parts.push(path.slice(start));
+      break;
+    } else {
+      parts.push(path.slice(start, i));
+      while (i < path.length && path[i] === "/") {
+        i++;
+      }
+    }
+  }
+
+  let up = 0;
+  for (i = parts.length - 1; i >= 0; i--) {
+    const part = parts[i];
+    if (part === ".") {
+      parts.splice(i, 1);
+    } else if (part === "..") {
+      up++;
+    } else if (up > 0) {
+      if (part === "") {
+        // The first part is blank if the path is absolute. Trying to go
+        // above the root is a no-op. Therefore we can remove all '..' parts
+        // directly after the root.
+        parts.splice(i + 1, up);
+        up = 0;
+      } else {
+        parts.splice(i, 2);
+        up--;
+      }
+    }
+  }
+  path = parts.join("/");
+
+  if (path === "") {
+    path = isAbsolute ? "/" : ".";
+  }
+
+  if (url) {
+    url.path = path;
+    return urlGenerate(url);
+  }
+  return path;
+});
+exports.normalize = normalize;
+
+/**
+ * Joins two paths/URLs.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be joined with the root.
+ *
+ * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+ *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+ *   first.
+ * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+ *   is updated with the result and aRoot is returned. Otherwise the result
+ *   is returned.
+ *   - If aPath is absolute, the result is aPath.
+ *   - Otherwise the two paths are joined with a slash.
+ * - Joining for example 'http://' and 'www.example.com' is also supported.
+ */
+function join(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+  if (aPath === "") {
+    aPath = ".";
+  }
+  const aPathUrl = urlParse(aPath);
+  const aRootUrl = urlParse(aRoot);
+  if (aRootUrl) {
+    aRoot = aRootUrl.path || "/";
+  }
+
+  // `join(foo, '//www.example.org')`
+  if (aPathUrl && !aPathUrl.scheme) {
+    if (aRootUrl) {
+      aPathUrl.scheme = aRootUrl.scheme;
+    }
+    return urlGenerate(aPathUrl);
+  }
+
+  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+    return aPath;
+  }
+
+  // `join('http://', 'www.example.com')`
+  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+    aRootUrl.host = aPath;
+    return urlGenerate(aRootUrl);
+  }
+
+  const joined = aPath.charAt(0) === "/"
+    ? aPath
+    : normalize(aRoot.replace(/\/+$/, "") + "/" + aPath);
+
+  if (aRootUrl) {
+    aRootUrl.path = joined;
+    return urlGenerate(aRootUrl);
+  }
+  return joined;
+}
+exports.join = join;
+
+exports.isAbsolute = function(aPath) {
+  return aPath.charAt(0) === "/" || urlRegexp.test(aPath);
+};
+
+/**
+ * Make a path relative to a URL or another path.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be made relative to aRoot.
+ */
+function relative(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+
+  aRoot = aRoot.replace(/\/$/, "");
+
+  // It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  let level = 0;
+  while (aPath.indexOf(aRoot + "/") !== 0) {
+    const index = aRoot.lastIndexOf("/");
+    if (index < 0) {
+      return aPath;
+    }
+
+    // If the only part of the root that is left is the scheme (i.e. http://,
+    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+    // have exhausted all components, so the path is not relative to the root.
+    aRoot = aRoot.slice(0, index);
+    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+      return aPath;
+    }
+
+    ++level;
+  }
+
+  // Make sure we add a "../" for each component we removed from the root.
+  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+}
+exports.relative = relative;
+
+const supportsNullProto = (function() {
+  const obj = Object.create(null);
+  return !("__proto__" in obj);
+}());
+
+function identity(s) {
+  return s;
+}
+
+/**
+ * Because behavior goes wacky when you set `__proto__` on objects, we
+ * have to prefix all the strings in our set with an arbitrary character.
+ *
+ * See https://github.com/mozilla/source-map/pull/31 and
+ * https://github.com/mozilla/source-map/issues/30
+ *
+ * @param String aStr
+ */
+function toSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return "$" + aStr;
+  }
+
+  return aStr;
+}
+exports.toSetString = supportsNullProto ? identity : toSetString;
+
+function fromSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return aStr.slice(1);
+  }
+
+  return aStr;
+}
+exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+function isProtoString(s) {
+  if (!s) {
+    return false;
+  }
+
+  const length = s.length;
+
+  if (length < 9 /* "__proto__".length */) {
+    return false;
+  }
+
+  /* eslint-disable no-multi-spaces */
+  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+    return false;
+  }
+  /* eslint-enable no-multi-spaces */
+
+  for (let i = length - 10; i >= 0; i--) {
+    if (s.charCodeAt(i) !== 36 /* '$' */) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+/**
+ * Comparator between two mappings where the original positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same original source/line/column, but different generated
+ * line and column the same. Useful when searching for a mapping with a
+ * stubbed out mapping.
+ */
+function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+  let cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositions = compareByOriginalPositions;
+
+/**
+ * Comparator between two mappings with deflated source and name indices where
+ * the generated positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same generated line and column, but different
+ * source/name/original line and column the same. Useful when searching for a
+ * mapping with a stubbed out mapping.
+ */
+function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+function strcmp(aStr1, aStr2) {
+  if (aStr1 === aStr2) {
+    return 0;
+  }
+
+  if (aStr1 === null) {
+    return 1; // aStr2 !== null
+  }
+
+  if (aStr2 === null) {
+    return -1; // aStr1 !== null
+  }
+
+  if (aStr1 > aStr2) {
+    return 1;
+  }
+
+  return -1;
+}
+
+/**
+ * Comparator between two mappings with inflated source and name strings where
+ * the generated positions are compared.
+ */
+function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+/**
+ * Strip any JSON XSSI avoidance prefix from the string (as documented
+ * in the source maps specification), and then parse the string as
+ * JSON.
+ */
+function parseSourceMapInput(str) {
+  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ""));
+}
+exports.parseSourceMapInput = parseSourceMapInput;
+
+/**
+ * Compute the URL of a source given the the source root, the source's
+ * URL, and the source map's URL.
+ */
+function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+  sourceURL = sourceURL || "";
+
+  if (sourceRoot) {
+    // This follows what Chrome does.
+    if (sourceRoot[sourceRoot.length - 1] !== "/" && sourceURL[0] !== "/") {
+      sourceRoot += "/";
+    }
+    // The spec says:
+    //   Line 4: An optional source root, useful for relocating source
+    //   files on a server or removing repeated values in the
+    //   “sources” entry.  This value is prepended to the individual
+    //   entries in the “source” field.
+    sourceURL = sourceRoot + sourceURL;
+  }
+
+  // Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if (sourceMapURL) {
+    const parsed = urlParse(sourceMapURL);
+    if (!parsed) {
+      throw new Error("sourceMapURL could not be parsed");
+    }
+    if (parsed.path) {
+      // Strip the last path component, but keep the "/".
+      const index = parsed.path.lastIndexOf("/");
+      if (index >= 0) {
+        parsed.path = parsed.path.substring(0, index + 1);
+      }
+    }
+    sourceURL = join(urlGenerate(parsed), sourceURL);
+  }
+
+  return normalize(sourceURL);
+}
+exports.computeSourceURL = computeSourceURL;
+
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const base64VLQ = __webpack_require__(2);
+const util = __webpack_require__(0);
+const ArraySet = __webpack_require__(3).ArraySet;
+const MappingList = __webpack_require__(7).MappingList;
+
+/**
+ * An instance of the SourceMapGenerator represents a source map which is
+ * being built incrementally. You may pass an object with the following
+ * properties:
+ *
+ *   - file: The filename of the generated source.
+ *   - sourceRoot: A root for all relative URLs in this source map.
+ */
+class SourceMapGenerator {
+  constructor(aArgs) {
+    if (!aArgs) {
+      aArgs = {};
+    }
+    this._file = util.getArg(aArgs, "file", null);
+    this._sourceRoot = util.getArg(aArgs, "sourceRoot", null);
+    this._skipValidation = util.getArg(aArgs, "skipValidation", false);
+    this._sources = new ArraySet();
+    this._names = new ArraySet();
+    this._mappings = new MappingList();
+    this._sourcesContents = null;
+  }
+
+  /**
+   * Creates a new SourceMapGenerator based on a SourceMapConsumer
+   *
+   * @param aSourceMapConsumer The SourceMap.
+   */
+  static fromSourceMap(aSourceMapConsumer) {
+    const sourceRoot = aSourceMapConsumer.sourceRoot;
+    const generator = new SourceMapGenerator({
+      file: aSourceMapConsumer.file,
+      sourceRoot
+    });
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      const newMapping = {
+        generated: {
+          line: mapping.generatedLine,
+          column: mapping.generatedColumn
+        }
+      };
+
+      if (mapping.source != null) {
+        newMapping.source = mapping.source;
+        if (sourceRoot != null) {
+          newMapping.source = util.relative(sourceRoot, newMapping.source);
+        }
+
+        newMapping.original = {
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        };
+
+        if (mapping.name != null) {
+          newMapping.name = mapping.name;
+        }
+      }
+
+      generator.addMapping(newMapping);
+    });
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      let sourceRelative = sourceFile;
+      if (sourceRoot !== null) {
+        sourceRelative = util.relative(sourceRoot, sourceFile);
+      }
+
+      if (!generator._sources.has(sourceRelative)) {
+        generator._sources.add(sourceRelative);
+      }
+
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        generator.setSourceContent(sourceFile, content);
+      }
+    });
+    return generator;
+  }
+
+  /**
+   * Add a single mapping from original source line and column to the generated
+   * source's line and column for this source map being created. The mapping
+   * object should have the following properties:
+   *
+   *   - generated: An object with the generated line and column positions.
+   *   - original: An object with the original line and column positions.
+   *   - source: The original source file (relative to the sourceRoot).
+   *   - name: An optional original token name for this mapping.
+   */
+  addMapping(aArgs) {
+    const generated = util.getArg(aArgs, "generated");
+    const original = util.getArg(aArgs, "original", null);
+    let source = util.getArg(aArgs, "source", null);
+    let name = util.getArg(aArgs, "name", null);
+
+    if (!this._skipValidation) {
+      this._validateMapping(generated, original, source, name);
+    }
+
+    if (source != null) {
+      source = String(source);
+      if (!this._sources.has(source)) {
+        this._sources.add(source);
+      }
+    }
+
+    if (name != null) {
+      name = String(name);
+      if (!this._names.has(name)) {
+        this._names.add(name);
+      }
+    }
+
+    this._mappings.add({
+      generatedLine: generated.line,
+      generatedColumn: generated.column,
+      originalLine: original != null && original.line,
+      originalColumn: original != null && original.column,
+      source,
+      name
+    });
+  }
+
+  /**
+   * Set the source content for a source file.
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    let source = aSourceFile;
+    if (this._sourceRoot != null) {
+      source = util.relative(this._sourceRoot, source);
+    }
+
+    if (aSourceContent != null) {
+      // Add the source content to the _sourcesContents map.
+      // Create a new _sourcesContents map if the property is null.
+      if (!this._sourcesContents) {
+        this._sourcesContents = Object.create(null);
+      }
+      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+    } else if (this._sourcesContents) {
+      // Remove the source file from the _sourcesContents map.
+      // If the _sourcesContents map is empty, set the property to null.
+      delete this._sourcesContents[util.toSetString(source)];
+      if (Object.keys(this._sourcesContents).length === 0) {
+        this._sourcesContents = null;
+      }
+    }
+  }
+
+  /**
+   * Applies the mappings of a sub-source-map for a specific source file to the
+   * source map being generated. Each mapping to the supplied source file is
+   * rewritten using the supplied source map. Note: The resolution for the
+   * resulting mappings is the minimium of this map and the supplied map.
+   *
+   * @param aSourceMapConsumer The source map to be applied.
+   * @param aSourceFile Optional. The filename of the source file.
+   *        If omitted, SourceMapConsumer's file property will be used.
+   * @param aSourceMapPath Optional. The dirname of the path to the source map
+   *        to be applied. If relative, it is relative to the SourceMapConsumer.
+   *        This parameter is needed when the two source maps aren't in the same
+   *        directory, and the source map to be applied contains relative source
+   *        paths. If so, those relative source paths need to be rewritten
+   *        relative to the SourceMapGenerator.
+   */
+  applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+    let sourceFile = aSourceFile;
+    // If aSourceFile is omitted, we will use the file property of the SourceMap
+    if (aSourceFile == null) {
+      if (aSourceMapConsumer.file == null) {
+        throw new Error(
+          "SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, " +
+          'or the source map\'s "file" property. Both were omitted.'
+        );
+      }
+      sourceFile = aSourceMapConsumer.file;
+    }
+    const sourceRoot = this._sourceRoot;
+    // Make "sourceFile" relative if an absolute Url is passed.
+    if (sourceRoot != null) {
+      sourceFile = util.relative(sourceRoot, sourceFile);
+    }
+    // Applying the SourceMap can add and remove items from the sources and
+    // the names array.
+    const newSources = this._mappings.toArray().length > 0
+      ? new ArraySet()
+      : this._sources;
+    const newNames = new ArraySet();
+
+    // Find mappings for the "sourceFile"
+    this._mappings.unsortedForEach(function(mapping) {
+      if (mapping.source === sourceFile && mapping.originalLine != null) {
+        // Check if it can be mapped by the source map, then update the mapping.
+        const original = aSourceMapConsumer.originalPositionFor({
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        });
+        if (original.source != null) {
+          // Copy mapping
+          mapping.source = original.source;
+          if (aSourceMapPath != null) {
+            mapping.source = util.join(aSourceMapPath, mapping.source);
+          }
+          if (sourceRoot != null) {
+            mapping.source = util.relative(sourceRoot, mapping.source);
+          }
+          mapping.originalLine = original.line;
+          mapping.originalColumn = original.column;
+          if (original.name != null) {
+            mapping.name = original.name;
+          }
+        }
+      }
+
+      const source = mapping.source;
+      if (source != null && !newSources.has(source)) {
+        newSources.add(source);
+      }
+
+      const name = mapping.name;
+      if (name != null && !newNames.has(name)) {
+        newNames.add(name);
+      }
+
+    }, this);
+    this._sources = newSources;
+    this._names = newNames;
+
+    // Copy sourcesContents of applied map.
+    aSourceMapConsumer.sources.forEach(function(srcFile) {
+      const content = aSourceMapConsumer.sourceContentFor(srcFile);
+      if (content != null) {
+        if (aSourceMapPath != null) {
+          srcFile = util.join(aSourceMapPath, srcFile);
+        }
+        if (sourceRoot != null) {
+          srcFile = util.relative(sourceRoot, srcFile);
+        }
+        this.setSourceContent(srcFile, content);
+      }
+    }, this);
+  }
+
+  /**
+   * A mapping can have one of the three levels of data:
+   *
+   *   1. Just the generated position.
+   *   2. The Generated position, original position, and original source.
+   *   3. Generated and original position, original source, as well as a name
+   *      token.
+   *
+   * To maintain consistency, we validate that any new mapping being added falls
+   * in to one of these categories.
+   */
+  _validateMapping(aGenerated, aOriginal, aSource, aName) {
+    // When aOriginal is truthy but has empty values for .line and .column,
+    // it is most likely a programmer error. In this case we throw a very
+    // specific error message to try to guide them the right way.
+    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+    if (aOriginal && typeof aOriginal.line !== "number" && typeof aOriginal.column !== "number") {
+        throw new Error(
+            "original.line and original.column are not numbers -- you probably meant to omit " +
+            "the original mapping entirely and only map the generated position. If so, pass " +
+            "null for the original mapping instead of an object with empty or null values."
+        );
+    }
+
+    if (aGenerated && "line" in aGenerated && "column" in aGenerated
+        && aGenerated.line > 0 && aGenerated.column >= 0
+        && !aOriginal && !aSource && !aName) {
+      // Case 1.
+
+    } else if (aGenerated && "line" in aGenerated && "column" in aGenerated
+             && aOriginal && "line" in aOriginal && "column" in aOriginal
+             && aGenerated.line > 0 && aGenerated.column >= 0
+             && aOriginal.line > 0 && aOriginal.column >= 0
+             && aSource) {
+      // Cases 2 and 3.
+
+    } else {
+      throw new Error("Invalid mapping: " + JSON.stringify({
+        generated: aGenerated,
+        source: aSource,
+        original: aOriginal,
+        name: aName
+      }));
+    }
+  }
+
+  /**
+   * Serialize the accumulated mappings in to the stream of base 64 VLQs
+   * specified by the source map format.
+   */
+  _serializeMappings() {
+    let previousGeneratedColumn = 0;
+    let previousGeneratedLine = 1;
+    let previousOriginalColumn = 0;
+    let previousOriginalLine = 0;
+    let previousName = 0;
+    let previousSource = 0;
+    let result = "";
+    let next;
+    let mapping;
+    let nameIdx;
+    let sourceIdx;
+
+    const mappings = this._mappings.toArray();
+    for (let i = 0, len = mappings.length; i < len; i++) {
+      mapping = mappings[i];
+      next = "";
+
+      if (mapping.generatedLine !== previousGeneratedLine) {
+        previousGeneratedColumn = 0;
+        while (mapping.generatedLine !== previousGeneratedLine) {
+          next += ";";
+          previousGeneratedLine++;
+        }
+      } else if (i > 0) {
+        if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+          continue;
+        }
+        next += ",";
+      }
+
+      next += base64VLQ.encode(mapping.generatedColumn
+                                 - previousGeneratedColumn);
+      previousGeneratedColumn = mapping.generatedColumn;
+
+      if (mapping.source != null) {
+        sourceIdx = this._sources.indexOf(mapping.source);
+        next += base64VLQ.encode(sourceIdx - previousSource);
+        previousSource = sourceIdx;
+
+        // lines are stored 0-based in SourceMap spec version 3
+        next += base64VLQ.encode(mapping.originalLine - 1
+                                   - previousOriginalLine);
+        previousOriginalLine = mapping.originalLine - 1;
+
+        next += base64VLQ.encode(mapping.originalColumn
+                                   - previousOriginalColumn);
+        previousOriginalColumn = mapping.originalColumn;
+
+        if (mapping.name != null) {
+          nameIdx = this._names.indexOf(mapping.name);
+          next += base64VLQ.encode(nameIdx - previousName);
+          previousName = nameIdx;
+        }
+      }
+
+      result += next;
+    }
+
+    return result;
+  }
+
+  _generateSourcesContent(aSources, aSourceRoot) {
+    return aSources.map(function(source) {
+      if (!this._sourcesContents) {
+        return null;
+      }
+      if (aSourceRoot != null) {
+        source = util.relative(aSourceRoot, source);
+      }
+      const key = util.toSetString(source);
+      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+        ? this._sourcesContents[key]
+        : null;
+    }, this);
+  }
+
+  /**
+   * Externalize the source map.
+   */
+  toJSON() {
+    const map = {
+      version: this._version,
+      sources: this._sources.toArray(),
+      names: this._names.toArray(),
+      mappings: this._serializeMappings()
+    };
+    if (this._file != null) {
+      map.file = this._file;
+    }
+    if (this._sourceRoot != null) {
+      map.sourceRoot = this._sourceRoot;
+    }
+    if (this._sourcesContents) {
+      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+    }
+
+    return map;
+  }
+
+  /**
+   * Render the source map being generated to a string.
+   */
+  toString() {
+    return JSON.stringify(this.toJSON());
+  }
+}
+
+SourceMapGenerator.prototype._version = 3;
+exports.SourceMapGenerator = SourceMapGenerator;
+
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+const base64 = __webpack_require__(6);
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+const VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+const VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+const VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+const VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+// eslint-disable-next-line no-unused-vars
+function fromVLQSigned(aValue) {
+  const isNegative = (aValue & 1) === 1;
+  const shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+exports.encode = function base64VLQ_encode(aValue) {
+  let encoded = "";
+  let digit;
+
+  let vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+class ArraySet {
+  constructor() {
+    this._array = [];
+    this._set = new Map();
+  }
+
+  /**
+   * Static method for creating ArraySet instances from an existing array.
+   */
+  static fromArray(aArray, aAllowDuplicates) {
+    const set = new ArraySet();
+    for (let i = 0, len = aArray.length; i < len; i++) {
+      set.add(aArray[i], aAllowDuplicates);
+    }
+    return set;
+  }
+
+  /**
+   * Return how many unique items are in this ArraySet. If duplicates have been
+   * added, than those do not count towards the size.
+   *
+   * @returns Number
+   */
+  size() {
+    return this._set.size;
+  }
+
+  /**
+   * Add the given string to this set.
+   *
+   * @param String aStr
+   */
+  add(aStr, aAllowDuplicates) {
+    const isDuplicate = this.has(aStr);
+    const idx = this._array.length;
+    if (!isDuplicate || aAllowDuplicates) {
+      this._array.push(aStr);
+    }
+    if (!isDuplicate) {
+      this._set.set(aStr, idx);
+    }
+  }
+
+  /**
+   * Is the given string a member of this set?
+   *
+   * @param String aStr
+   */
+  has(aStr) {
+      return this._set.has(aStr);
+  }
+
+  /**
+   * What is the index of the given string in the array?
+   *
+   * @param String aStr
+   */
+  indexOf(aStr) {
+    const idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+    throw new Error('"' + aStr + '" is not in the set.');
+  }
+
+  /**
+   * What is the element at the given index?
+   *
+   * @param Number aIdx
+   */
+  at(aIdx) {
+    if (aIdx >= 0 && aIdx < this._array.length) {
+      return this._array[aIdx];
+    }
+    throw new Error("No element indexed by " + aIdx);
+  }
+
+  /**
+   * Returns the array representation of this set (which has the proper indices
+   * indicated by indexOf). Note that this is a copy of the internal array used
+   * for storing the members so that no one can mess with internal state.
+   */
+  toArray() {
+    return this._array.slice();
+  }
+}
+exports.ArraySet = ArraySet;
+
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* WEBPACK VAR INJECTION */(function(__dirname) {if (typeof fetch === "function") {
+  // Web version of reading a wasm file into an array buffer.
+
+  let mappingsWasmUrl = null;
+
+  module.exports = function readWasm() {
+    if (typeof mappingsWasmUrl !== "string") {
+      throw new Error("You must provide the URL of lib/mappings.wasm by calling " +
+                      "SourceMapConsumer.initialize({ 'lib/mappings.wasm': ... }) " +
+                      "before using SourceMapConsumer");
+    }
+
+    return fetch(mappingsWasmUrl)
+      .then(response => response.arrayBuffer());
+  };
+
+  module.exports.initialize = url => mappingsWasmUrl = url;
+} else {
+  // Node version of reading a wasm file into an array buffer.
+  const fs = __webpack_require__(10);
+  const path = __webpack_require__(11);
+
+  module.exports = function readWasm() {
+    return new Promise((resolve, reject) => {
+      const wasmPath = path.join(__dirname, "mappings.wasm");
+      fs.readFile(wasmPath, null, (error, data) => {
+        if (error) {
+          reject(error);
+          return;
+        }
+
+        resolve(data.buffer);
+      });
+    });
+  };
+
+  module.exports.initialize = _ => {
+    console.debug("SourceMapConsumer.initialize is a no-op when running in node.js");
+  };
+}
+
+/* WEBPACK VAR INJECTION */}.call(exports, "/"))
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/*
+ * Copyright 2009-2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE.txt or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+exports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+exports.SourceMapConsumer = __webpack_require__(8).SourceMapConsumer;
+exports.SourceNode = __webpack_require__(13).SourceNode;
+
+
+/***/ }),
+/* 6 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const intToCharMap = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+exports.encode = function(number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
+
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2014 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = __webpack_require__(0);
+
+/**
+ * Determine whether mappingB is after mappingA with respect to generated
+ * position.
+ */
+function generatedPositionAfter(mappingA, mappingB) {
+  // Optimized for most common case
+  const lineA = mappingA.generatedLine;
+  const lineB = mappingB.generatedLine;
+  const columnA = mappingA.generatedColumn;
+  const columnB = mappingB.generatedColumn;
+  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+}
+
+/**
+ * A data structure to provide a sorted view of accumulated mappings in a
+ * performance conscious manner. It trades a negligible overhead in general
+ * case for a large speedup in case of mappings being added in order.
+ */
+class MappingList {
+  constructor() {
+    this._array = [];
+    this._sorted = true;
+    // Serves as infimum
+    this._last = {generatedLine: -1, generatedColumn: 0};
+  }
+
+  /**
+   * Iterate through internal items. This method takes the same arguments that
+   * `Array.prototype.forEach` takes.
+   *
+   * NOTE: The order of the mappings is NOT guaranteed.
+   */
+  unsortedForEach(aCallback, aThisArg) {
+    this._array.forEach(aCallback, aThisArg);
+  }
+
+  /**
+   * Add the given source mapping.
+   *
+   * @param Object aMapping
+   */
+  add(aMapping) {
+    if (generatedPositionAfter(this._last, aMapping)) {
+      this._last = aMapping;
+      this._array.push(aMapping);
+    } else {
+      this._sorted = false;
+      this._array.push(aMapping);
+    }
+  }
+
+  /**
+   * Returns the flat, sorted array of mappings. The mappings are sorted by
+   * generated position.
+   *
+   * WARNING: This method returns internal data without copying, for
+   * performance. The return value must NOT be mutated, and should be treated as
+   * an immutable borrow. If you want to take ownership, you must make your own
+   * copy.
+   */
+  toArray() {
+    if (!this._sorted) {
+      this._array.sort(util.compareByGeneratedPositionsInflated);
+      this._sorted = true;
+    }
+    return this._array;
+  }
+}
+
+exports.MappingList = MappingList;
+
+
+/***/ }),
+/* 8 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = __webpack_require__(0);
+const binarySearch = __webpack_require__(9);
+const ArraySet = __webpack_require__(3).ArraySet;
+const base64VLQ = __webpack_require__(2); // eslint-disable-line no-unused-vars
+const readWasm = __webpack_require__(4);
+const wasm = __webpack_require__(12);
+
+const INTERNAL = Symbol("smcInternal");
+
+class SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    // If the constructor was called by super(), just return Promise<this>.
+    // Yes, this is a hack to retain the pre-existing API of the base-class
+    // constructor also being an async factory function.
+    if (aSourceMap == INTERNAL) {
+      return Promise.resolve(this);
+    }
+
+    return _factory(aSourceMap, aSourceMapURL);
+  }
+
+  static initialize(opts) {
+    readWasm.initialize(opts["lib/mappings.wasm"]);
+  }
+
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return _factoryBSM(aSourceMap, aSourceMapURL);
+  }
+
+  /**
+   * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+   * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+   * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+   * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+   * value.
+   *
+   * You must not use the consumer after `f` completes!
+   *
+   * By using `with`, you do not have to remember to manually call `destroy` on
+   * the consumer, since it will be called automatically once `f` completes.
+   *
+   * ```js
+   * const xSquared = await SourceMapConsumer.with(
+   *   myRawSourceMap,
+   *   null,
+   *   async function (consumer) {
+   *     // Use `consumer` inside here and don't worry about remembering
+   *     // to call `destroy`.
+   *
+   *     const x = await whatever(consumer);
+   *     return x * x;
+   *   }
+   * );
+   *
+   * // You may not use that `consumer` anymore out here; it has
+   * // been destroyed. But you can use `xSquared`.
+   * console.log(xSquared);
+   * ```
+   */
+  static with(rawSourceMap, sourceMapUrl, f) {
+    // Note: The `acorn` version that `webpack` currently depends on doesn't
+    // support `async` functions, and the nodes that we support don't all have
+    // `.finally`. Therefore, this is written a bit more convolutedly than it
+    // should really be.
+
+    let consumer = null;
+    const promise = new SourceMapConsumer(rawSourceMap, sourceMapUrl);
+    return promise
+      .then(c => {
+        consumer = c;
+        return f(c);
+      })
+      .then(x => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        return x;
+      }, e => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        throw e;
+      });
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    throw new Error("Subclasses must implement _parseMappings");
+  }
+
+  /**
+   * Iterate over each mapping between an original source/line/column and a
+   * generated line/column in this source map.
+   *
+   * @param Function aCallback
+   *        The function that is called with each mapping.
+   * @param Object aContext
+   *        Optional. If specified, this object will be the value of `this` every
+   *        time that `aCallback` is called.
+   * @param aOrder
+   *        Either `SourceMapConsumer.GENERATED_ORDER` or
+   *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+   *        iterate over the mappings sorted by the generated file's line/column
+   *        order or the original's source/line/column order, respectively. Defaults to
+   *        `SourceMapConsumer.GENERATED_ORDER`.
+   */
+  eachMapping(aCallback, aContext, aOrder) {
+    throw new Error("Subclasses must implement eachMapping");
+  }
+
+  /**
+   * Returns all generated line and column information for the original source,
+   * line, and column provided. If no column is provided, returns all mappings
+   * corresponding to a either the line we are searching for or the next
+   * closest line that has any mappings. Otherwise, returns all mappings
+   * corresponding to the given line and either the column we are searching for
+   * or the next closest column that has any offsets.
+   *
+   * The only argument is an object with the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number is 1-based.
+   *   - column: Optional. the column number in the original source.
+   *    The column number is 0-based.
+   *
+   * and an array of objects is returned, each with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *    line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *    The column number is 0-based.
+   */
+  allGeneratedPositionsFor(aArgs) {
+    throw new Error("Subclasses must implement allGeneratedPositionsFor");
+  }
+
+  destroy() {
+    throw new Error("Subclasses must implement destroy");
+  }
+}
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+SourceMapConsumer.prototype._version = 3;
+SourceMapConsumer.GENERATED_ORDER = 1;
+SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+exports.SourceMapConsumer = SourceMapConsumer;
+
+/**
+ * A BasicSourceMapConsumer instance represents a parsed source map which we can
+ * query for information about the original file positions by giving it a file
+ * position in the generated source.
+ *
+ * The first parameter is the raw source map (either as a JSON string, or
+ * already parsed to an object). According to the spec, source maps have the
+ * following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - sources: An array of URLs to the original source files.
+ *   - names: An array of identifiers which can be referenced by individual mappings.
+ *   - sourceRoot: Optional. The URL root from which all sources are relative.
+ *   - sourcesContent: Optional. An array of contents of the original source files.
+ *   - mappings: A string of base64 VLQs which contain the actual mappings.
+ *   - file: Optional. The generated file this source map is associated with.
+ *
+ * Here is an example source map, taken from the source map spec[0]:
+ *
+ *     {
+ *       version : 3,
+ *       file: "out.js",
+ *       sourceRoot : "",
+ *       sources: ["foo.js", "bar.js"],
+ *       names: ["src", "maps", "are", "fun"],
+ *       mappings: "AA,AB;;ABCDE;"
+ *     }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+ */
+class BasicSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      let sources = util.getArg(sourceMap, "sources");
+      // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+      // requires the array) to play nice here.
+      const names = util.getArg(sourceMap, "names", []);
+      let sourceRoot = util.getArg(sourceMap, "sourceRoot", null);
+      const sourcesContent = util.getArg(sourceMap, "sourcesContent", null);
+      const mappings = util.getArg(sourceMap, "mappings");
+      const file = util.getArg(sourceMap, "file", null);
+
+      // Once again, Sass deviates from the spec and supplies the version as a
+      // string rather than a number, so we use loose equality checking here.
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      if (sourceRoot) {
+        sourceRoot = util.normalize(sourceRoot);
+      }
+
+      sources = sources
+        .map(String)
+        // Some source maps produce relative source paths like "./foo.js" instead of
+        // "foo.js".  Normalize these first so that future comparisons will succeed.
+        // See bugzil.la/1090768.
+        .map(util.normalize)
+        // Always ensure that absolute sources are internally stored relative to
+        // the source root, if the source root is absolute. Not doing this would
+        // be particularly problematic when the source root is a prefix of the
+        // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+        .map(function(source) {
+          return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+            ? util.relative(sourceRoot, source)
+            : source;
+        });
+
+      // Pass `true` below to allow duplicate names and sources. While source maps
+      // are intended to be compressed and deduplicated, the TypeScript compiler
+      // sometimes generates source maps with duplicates in them. See Github issue
+      // #72 and bugzil.la/889492.
+      that._names = ArraySet.fromArray(names.map(String), true);
+      that._sources = ArraySet.fromArray(sources, true);
+
+      that._absoluteSources = that._sources.toArray().map(function(s) {
+        return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+      });
+
+      that.sourceRoot = sourceRoot;
+      that.sourcesContent = sourcesContent;
+      that._mappings = mappings;
+      that._sourceMapURL = aSourceMapURL;
+      that.file = file;
+
+      that._computedColumnSpans = false;
+      that._mappingsPtr = 0;
+      that._wasm = null;
+
+      return wasm().then(w => {
+        that._wasm = w;
+        return that;
+      });
+    });
+  }
+
+  /**
+   * Utility function to find the index of a source.  Returns -1 if not
+   * found.
+   */
+  _findSourceIndex(aSource) {
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    if (this._sources.has(relativeSource)) {
+      return this._sources.indexOf(relativeSource);
+    }
+
+    // Maybe aSource is an absolute URL as returned by |sources|.  In
+    // this case we can't simply undo the transform.
+    for (let i = 0; i < this._absoluteSources.length; ++i) {
+      if (this._absoluteSources[i] == aSource) {
+        return i;
+      }
+    }
+
+    return -1;
+  }
+
+  /**
+   * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+   *
+   * @param SourceMapGenerator aSourceMap
+   *        The source map that will be consumed.
+   * @param String aSourceMapURL
+   *        The URL at which the source map can be found (optional)
+   * @returns BasicSourceMapConsumer
+   */
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return new BasicSourceMapConsumer(aSourceMap.toString());
+  }
+
+  get sources() {
+    return this._absoluteSources.slice();
+  }
+
+  _getMappingsPtr() {
+    if (this._mappingsPtr === 0) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this._mappingsPtr;
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const size = aStr.length;
+
+    const mappingsBufPtr = this._wasm.exports.allocate_mappings(size);
+    const mappingsBuf = new Uint8Array(this._wasm.exports.memory.buffer, mappingsBufPtr, size);
+    for (let i = 0; i < size; i++) {
+      mappingsBuf[i] = aStr.charCodeAt(i);
+    }
+
+    const mappingsPtr = this._wasm.exports.parse_mappings(mappingsBufPtr);
+
+    if (!mappingsPtr) {
+      const error = this._wasm.exports.get_last_error();
+      let msg = `Error parsing mappings (code ${error}): `;
+
+      // XXX: keep these error codes in sync with `fitzgen/source-map-mappings`.
+      switch (error) {
+        case 1:
+          msg += "the mappings contained a negative line, column, source index, or name index";
+          break;
+        case 2:
+          msg += "the mappings contained a number larger than 2**32";
+          break;
+        case 3:
+          msg += "reached EOF while in the middle of parsing a VLQ";
+          break;
+        case 4:
+          msg += "invalid base 64 character while parsing a VLQ";
+          break;
+        default:
+          msg += "unknown error code";
+          break;
+      }
+
+      throw new Error(msg);
+    }
+
+    this._mappingsPtr = mappingsPtr;
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+    const sourceRoot = this.sourceRoot;
+
+    this._wasm.withMappingCallback(
+      mapping => {
+        if (mapping.source !== null) {
+          mapping.source = this._sources.at(mapping.source);
+          mapping.source = util.computeSourceURL(sourceRoot, mapping.source, this._sourceMapURL);
+
+          if (mapping.name !== null) {
+            mapping.name = this._names.at(mapping.name);
+          }
+        }
+
+        aCallback.call(context, mapping);
+      },
+      () => {
+        switch (order) {
+        case SourceMapConsumer.GENERATED_ORDER:
+          this._wasm.exports.by_generated_location(this._getMappingsPtr());
+          break;
+        case SourceMapConsumer.ORIGINAL_ORDER:
+          this._wasm.exports.by_original_location(this._getMappingsPtr());
+          break;
+        default:
+          throw new Error("Unknown order of iteration.");
+        }
+      }
+    );
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    const originalLine = util.getArg(aArgs, "line");
+    const originalColumn = aArgs.column || 0;
+
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return [];
+    }
+
+    if (originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    this._wasm.withMappingCallback(
+      m => {
+        let lastColumn = m.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        mappings.push({
+          line: m.generatedLine,
+          column: m.generatedColumn,
+          lastColumn,
+        });
+      }, () => {
+        this._wasm.exports.all_generated_locations_for(
+          this._getMappingsPtr(),
+          source,
+          originalLine - 1,
+          "column" in aArgs,
+          originalColumn
+        );
+      }
+    );
+
+    return mappings;
+  }
+
+  destroy() {
+    if (this._mappingsPtr !== 0) {
+      this._wasm.exports.free_mappings(this._mappingsPtr);
+      this._mappingsPtr = 0;
+    }
+  }
+
+  /**
+   * Compute the last column for each generated mapping. The last column is
+   * inclusive.
+   */
+  computeColumnSpans() {
+    if (this._computedColumnSpans) {
+      return;
+    }
+
+    this._wasm.exports.compute_column_spans(this._getMappingsPtr());
+    this._computedColumnSpans = true;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.generatedLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.generatedColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.original_location_for(
+        this._getMappingsPtr(),
+        needle.generatedLine - 1,
+        needle.generatedColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.generatedLine === needle.generatedLine) {
+        let source = util.getArg(mapping, "source", null);
+        if (source !== null) {
+          source = this._sources.at(source);
+          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+        }
+
+        let name = util.getArg(mapping, "name", null);
+        if (name !== null) {
+          name = this._names.at(name);
+        }
+
+        return {
+          source,
+          line: util.getArg(mapping, "originalLine", null),
+          column: util.getArg(mapping, "originalColumn", null),
+          name
+        };
+      }
+    }
+
+    return {
+      source: null,
+      line: null,
+      column: null,
+      name: null
+    };
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    if (!this.sourcesContent) {
+      return false;
+    }
+    return this.sourcesContent.length >= this._sources.size() &&
+      !this.sourcesContent.some(function(sc) { return sc == null; });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    if (!this.sourcesContent) {
+      return null;
+    }
+
+    const index = this._findSourceIndex(aSource);
+    if (index >= 0) {
+      return this.sourcesContent[index];
+    }
+
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    let url;
+    if (this.sourceRoot != null
+        && (url = util.urlParse(this.sourceRoot))) {
+      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+      // many users. We can help them out when they expect file:// URIs to
+      // behave like it would if they were running a local HTTP server. See
+      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+      const fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+      if (url.scheme == "file"
+          && this._sources.has(fileUriAbsPath)) {
+        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];
+      }
+
+      if ((!url.path || url.path == "/")
+          && this._sources.has("/" + relativeSource)) {
+        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+      }
+    }
+
+    // This function is used recursively from
+    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+    // don't want to throw if we can't find the source - we just want to
+    // return null, so we provide a flag to exit gracefully.
+    if (nullOnMissing) {
+      return null;
+    }
+
+    throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return {
+        line: null,
+        column: null,
+        lastColumn: null
+      };
+    }
+
+    const needle = {
+      source,
+      originalLine: util.getArg(aArgs, "line"),
+      originalColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.generated_location_for(
+        this._getMappingsPtr(),
+        needle.source,
+        needle.originalLine - 1,
+        needle.originalColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.source === needle.source) {
+        let lastColumn = mapping.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        return {
+          line: util.getArg(mapping, "generatedLine", null),
+          column: util.getArg(mapping, "generatedColumn", null),
+          lastColumn,
+        };
+      }
+    }
+
+    return {
+      line: null,
+      column: null,
+      lastColumn: null
+    };
+  }
+}
+
+BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+/**
+ * An IndexedSourceMapConsumer instance represents a parsed source map which
+ * we can query for information. It differs from BasicSourceMapConsumer in
+ * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+ * input.
+ *
+ * The first parameter is a raw source map (either as a JSON string, or already
+ * parsed to an object). According to the spec for indexed source maps, they
+ * have the following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - file: Optional. The generated file this source map is associated with.
+ *   - sections: A list of section definitions.
+ *
+ * Each value under the "sections" field has two fields:
+ *   - offset: The offset into the original specified at which this section
+ *       begins to apply, defined as an object with a "line" and "column"
+ *       field.
+ *   - map: A source map definition. This source map could also be indexed,
+ *       but doesn't have to be.
+ *
+ * Instead of the "map" field, it's also possible to have a "url" field
+ * specifying a URL to retrieve a source map from, but that's currently
+ * unsupported.
+ *
+ * Here's an example source map, taken from the source map spec[0], but
+ * modified to omit a section which uses the "url" field.
+ *
+ *  {
+ *    version : 3,
+ *    file: "app.js",
+ *    sections: [{
+ *      offset: {line:100, column:10},
+ *      map: {
+ *        version : 3,
+ *        file: "section.js",
+ *        sources: ["foo.js", "bar.js"],
+ *        names: ["src", "maps", "are", "fun"],
+ *        mappings: "AAAA,E;;ABCDE;"
+ *      }
+ *    }],
+ *  }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+ */
+class IndexedSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      const sections = util.getArg(sourceMap, "sections");
+
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      that._sources = new ArraySet();
+      that._names = new ArraySet();
+      that.__generatedMappings = null;
+      that.__originalMappings = null;
+      that.__generatedMappingsUnsorted = null;
+      that.__originalMappingsUnsorted = null;
+
+      let lastOffset = {
+        line: -1,
+        column: 0
+      };
+      return Promise.all(sections.map(s => {
+        if (s.url) {
+          // The url field will require support for asynchronicity.
+          // See https://github.com/mozilla/source-map/issues/16
+          throw new Error("Support for url field in sections not implemented.");
+        }
+        const offset = util.getArg(s, "offset");
+        const offsetLine = util.getArg(offset, "line");
+        const offsetColumn = util.getArg(offset, "column");
+
+        if (offsetLine < lastOffset.line ||
+            (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+          throw new Error("Section offsets must be ordered and non-overlapping.");
+        }
+        lastOffset = offset;
+
+        const cons = new SourceMapConsumer(util.getArg(s, "map"), aSourceMapURL);
+        return cons.then(consumer => {
+          return {
+            generatedOffset: {
+              // The offset fields are 0-based, but we use 1-based indices when
+              // encoding/decoding from VLQ.
+              generatedLine: offsetLine + 1,
+              generatedColumn: offsetColumn + 1
+            },
+            consumer
+          };
+        });
+      })).then(s => {
+        that._sections = s;
+        return that;
+      });
+    });
+  }
+
+  // `__generatedMappings` and `__originalMappings` are arrays that hold the
+  // parsed mapping coordinates from the source map's "mappings" attribute. They
+  // are lazily instantiated, accessed via the `_generatedMappings` and
+  // `_originalMappings` getters respectively, and we only parse the mappings
+  // and create these arrays once queried for a source location. We jump through
+  // these hoops because there can be many thousands of mappings, and parsing
+  // them is expensive, so we only want to do it if we must.
+  //
+  // Each object in the arrays is of the form:
+  //
+  //     {
+  //       generatedLine: The line number in the generated code,
+  //       generatedColumn: The column number in the generated code,
+  //       source: The path to the original source file that generated this
+  //               chunk of code,
+  //       originalLine: The line number in the original source that
+  //                     corresponds to this chunk of generated code,
+  //       originalColumn: The column number in the original source that
+  //                       corresponds to this chunk of generated code,
+  //       name: The name of the original symbol which generated this chunk of
+  //             code.
+  //     }
+  //
+  // All properties except for `generatedLine` and `generatedColumn` can be
+  // `null`.
+  //
+  // `_generatedMappings` is ordered by the generated positions.
+  //
+  // `_originalMappings` is ordered by the original positions.
+  get _generatedMappings() {
+    if (!this.__generatedMappings) {
+      this._sortGeneratedMappings();
+    }
+
+    return this.__generatedMappings;
+  }
+
+  get _originalMappings() {
+    if (!this.__originalMappings) {
+      this._sortOriginalMappings();
+    }
+
+    return this.__originalMappings;
+  }
+
+  get _generatedMappingsUnsorted() {
+    if (!this.__generatedMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__generatedMappingsUnsorted;
+  }
+
+  get _originalMappingsUnsorted() {
+    if (!this.__originalMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__originalMappingsUnsorted;
+  }
+
+  _sortGeneratedMappings() {
+    const mappings = this._generatedMappingsUnsorted;
+    mappings.sort(util.compareByGeneratedPositionsDeflated);
+    this.__generatedMappings = mappings;
+  }
+
+  _sortOriginalMappings() {
+    const mappings = this._originalMappingsUnsorted;
+    mappings.sort(util.compareByOriginalPositions);
+    this.__originalMappings = mappings;
+  }
+
+  /**
+   * The list of original sources.
+   */
+  get sources() {
+    const sources = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      for (let j = 0; j < this._sections[i].consumer.sources.length; j++) {
+        sources.push(this._sections[i].consumer.sources[j]);
+      }
+    }
+    return sources;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    // Find the section containing the generated position we're trying to map
+    // to an original position.
+    const sectionIndex = binarySearch.search(needle, this._sections,
+      function(aNeedle, section) {
+        const cmp = aNeedle.generatedLine - section.generatedOffset.generatedLine;
+        if (cmp) {
+          return cmp;
+        }
+
+        return (aNeedle.generatedColumn -
+                section.generatedOffset.generatedColumn);
+      });
+    const section = this._sections[sectionIndex];
+
+    if (!section) {
+      return {
+        source: null,
+        line: null,
+        column: null,
+        name: null
+      };
+    }
+
+    return section.consumer.originalPositionFor({
+      line: needle.generatedLine -
+        (section.generatedOffset.generatedLine - 1),
+      column: needle.generatedColumn -
+        (section.generatedOffset.generatedLine === needle.generatedLine
+         ? section.generatedOffset.generatedColumn - 1
+         : 0),
+      bias: aArgs.bias
+    });
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    return this._sections.every(function(s) {
+      return s.consumer.hasContentsOfAllSources();
+    });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const content = section.consumer.sourceContentFor(aSource, true);
+      if (content) {
+        return content;
+      }
+    }
+    if (nullOnMissing) {
+      return null;
+    }
+    throw new Error('"' + aSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      // Only consider this section if the requested source is in the list of
+      // sources of the consumer.
+      if (section.consumer._findSourceIndex(util.getArg(aArgs, "source")) === -1) {
+        continue;
+      }
+      const generatedPosition = section.consumer.generatedPositionFor(aArgs);
+      if (generatedPosition) {
+        const ret = {
+          line: generatedPosition.line +
+            (section.generatedOffset.generatedLine - 1),
+          column: generatedPosition.column +
+            (section.generatedOffset.generatedLine === generatedPosition.line
+             ? section.generatedOffset.generatedColumn - 1
+             : 0)
+        };
+        return ret;
+      }
+    }
+
+    return {
+      line: null,
+      column: null
+    };
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const generatedMappings = this.__generatedMappingsUnsorted = [];
+    const originalMappings = this.__originalMappingsUnsorted = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const sectionMappings = [];
+      section.consumer.eachMapping(m => sectionMappings.push(m));
+
+      for (let j = 0; j < sectionMappings.length; j++) {
+        const mapping = sectionMappings[j];
+
+        // TODO: test if null is correct here.  The original code used
+        // `source`, which would actually have gotten used as null because
+        // var's get hoisted.
+        // See: https://github.com/mozilla/source-map/issues/333
+        let source = util.computeSourceURL(section.consumer.sourceRoot, null, this._sourceMapURL);
+        this._sources.add(source);
+        source = this._sources.indexOf(source);
+
+        let name = null;
+        if (mapping.name) {
+          this._names.add(mapping.name);
+          name = this._names.indexOf(mapping.name);
+        }
+
+        // The mappings coming from the consumer for the section have
+        // generated positions relative to the start of the section, so we
+        // need to offset them to be relative to the start of the concatenated
+        // generated file.
+        const adjustedMapping = {
+          source,
+          generatedLine: mapping.generatedLine +
+            (section.generatedOffset.generatedLine - 1),
+          generatedColumn: mapping.generatedColumn +
+            (section.generatedOffset.generatedLine === mapping.generatedLine
+            ? section.generatedOffset.generatedColumn - 1
+            : 0),
+          originalLine: mapping.originalLine,
+          originalColumn: mapping.originalColumn,
+          name
+        };
+
+        generatedMappings.push(adjustedMapping);
+        if (typeof adjustedMapping.originalLine === "number") {
+          originalMappings.push(adjustedMapping);
+        }
+      }
+    }
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+    let mappings;
+    switch (order) {
+    case SourceMapConsumer.GENERATED_ORDER:
+      mappings = this._generatedMappings;
+      break;
+    case SourceMapConsumer.ORIGINAL_ORDER:
+      mappings = this._originalMappings;
+      break;
+    default:
+      throw new Error("Unknown order of iteration.");
+    }
+
+    const sourceRoot = this.sourceRoot;
+    mappings.map(function(mapping) {
+      let source = null;
+      if (mapping.source !== null) {
+        source = this._sources.at(mapping.source);
+        source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+      }
+      return {
+        source,
+        generatedLine: mapping.generatedLine,
+        generatedColumn: mapping.generatedColumn,
+        originalLine: mapping.originalLine,
+        originalColumn: mapping.originalColumn,
+        name: mapping.name === null ? null : this._names.at(mapping.name)
+      };
+    }, this).forEach(aCallback, context);
+  }
+
+  /**
+   * Find the mapping that best matches the hypothetical "needle" mapping that
+   * we are searching for in the given "haystack" of mappings.
+   */
+  _findMapping(aNeedle, aMappings, aLineName,
+              aColumnName, aComparator, aBias) {
+    // To return the position we are searching for, we must first find the
+    // mapping for the given position and then return the opposite position it
+    // points to. Because the mappings are sorted, we can use binary search to
+    // find the best mapping.
+
+    if (aNeedle[aLineName] <= 0) {
+      throw new TypeError("Line must be greater than or equal to 1, got "
+                          + aNeedle[aLineName]);
+    }
+    if (aNeedle[aColumnName] < 0) {
+      throw new TypeError("Column must be greater than or equal to 0, got "
+                          + aNeedle[aColumnName]);
+    }
+
+    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    const line = util.getArg(aArgs, "line");
+
+    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+    // returns the index of the closest mapping less than the needle. By
+    // setting needle.originalColumn to 0, we thus find the last mapping for
+    // the given line, provided such a mapping exists.
+    const needle = {
+      source: util.getArg(aArgs, "source"),
+      originalLine: line,
+      originalColumn: util.getArg(aArgs, "column", 0)
+    };
+
+    needle.source = this._findSourceIndex(needle.source);
+    if (needle.source < 0) {
+      return [];
+    }
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    let index = this._findMapping(needle,
+                                  this._originalMappings,
+                                  "originalLine",
+                                  "originalColumn",
+                                  util.compareByOriginalPositions,
+                                  binarySearch.LEAST_UPPER_BOUND);
+    if (index >= 0) {
+      let mapping = this._originalMappings[index];
+
+      if (aArgs.column === undefined) {
+        const originalLine = mapping.originalLine;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we found. Since
+        // mappings are sorted, this is guaranteed to find all mappings for
+        // the line we found.
+        while (mapping && mapping.originalLine === originalLine) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      } else {
+        const originalColumn = mapping.originalColumn;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we were searching for.
+        // Since mappings are sorted, this is guaranteed to find all mappings for
+        // the line we are searching for.
+        while (mapping &&
+               mapping.originalLine === line &&
+               mapping.originalColumn == originalColumn) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      }
+    }
+
+    return mappings;
+  }
+
+  destroy() {
+    for (let i = 0; i < this._sections.length; i++) {
+      this._sections[i].consumer.destroy();
+    }
+  }
+}
+exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+/*
+ * Cheat to get around inter-twingled classes.  `factory()` can be at the end
+ * where it has access to non-hoisted classes, but it gets hoisted itself.
+ */
+function _factory(aSourceMap, aSourceMapURL) {
+  let sourceMap = aSourceMap;
+  if (typeof aSourceMap === "string") {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  const consumer = sourceMap.sections != null
+      ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+      : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+  return Promise.resolve(consumer);
+}
+
+function _factoryBSM(aSourceMap, aSourceMapURL) {
+  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+}
+
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+exports.GREATEST_LOWER_BOUND = 1;
+exports.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Recursive implementation of binary search.
+ *
+ * @param aLow Indices here and lower do not contain the needle.
+ * @param aHigh Indices here and higher do not contain the needle.
+ * @param aNeedle The element being searched for.
+ * @param aHaystack The non-empty array being searched.
+ * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ */
+function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+  // This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  const mid = Math.floor((aHigh - aLow) / 2) + aLow;
+  const cmp = aCompare(aNeedle, aHaystack[mid], true);
+  if (cmp === 0) {
+    // Found the element we are looking for.
+    return mid;
+  } else if (cmp > 0) {
+    // Our needle is greater than aHaystack[mid].
+    if (aHigh - mid > 1) {
+      // The element is in the upper half.
+      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // The exact needle element was not found in this haystack. Determine if
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return aHigh < aHaystack.length ? aHigh : -1;
+    }
+    return mid;
+  }
+
+  // Our needle is less than aHaystack[mid].
+  if (mid - aLow > 1) {
+    // The element is in the lower half.
+    return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+  }
+
+  // we are in termination case (3) or (2) and return the appropriate thing.
+  if (aBias == exports.LEAST_UPPER_BOUND) {
+    return mid;
+  }
+  return aLow < 0 ? -1 : aLow;
+}
+
+/**
+ * This is an implementation of binary search which will always try and return
+ * the index of the closest element if there is no exact hit. This is because
+ * mappings between original and generated line/col pairs are single points,
+ * and there is an implicit region between each of them, so a miss just means
+ * that you aren't on the very start of a region.
+ *
+ * @param aNeedle The element you are looking for.
+ * @param aHaystack The array that is being searched.
+ * @param aCompare A function which takes the needle and an element in the
+ *     array and returns -1, 0, or 1 depending on whether the needle is less
+ *     than, equal to, or greater than the element, respectively.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+ */
+exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+  if (aHaystack.length === 0) {
+    return -1;
+  }
+
+  let index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+  if (index < 0) {
+    return -1;
+  }
+
+  // We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while (index - 1 >= 0) {
+    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+      break;
+    }
+    --index;
+  }
+
+  return index;
+};
+
+
+/***/ }),
+/* 10 */
+/***/ (function(module, exports) {
+
+module.exports = __WEBPACK_EXTERNAL_MODULE_10__;
+
+/***/ }),
+/* 11 */
+/***/ (function(module, exports) {
+
+module.exports = __WEBPACK_EXTERNAL_MODULE_11__;
+
+/***/ }),
+/* 12 */
+/***/ (function(module, exports, __webpack_require__) {
+
+const readWasm = __webpack_require__(4);
+
+/**
+ * Provide the JIT with a nice shape / hidden class.
+ */
+function Mapping() {
+  this.generatedLine = 0;
+  this.generatedColumn = 0;
+  this.lastGeneratedColumn = null;
+  this.source = null;
+  this.originalLine = null;
+  this.originalColumn = null;
+  this.name = null;
+}
+
+let cachedWasm = null;
+
+module.exports = function wasm() {
+  if (cachedWasm) {
+    return cachedWasm;
+  }
+
+  const callbackStack = [];
+
+  cachedWasm = readWasm().then(buffer => {
+      return WebAssembly.instantiate(buffer, {
+        env: {
+          mapping_callback(
+            generatedLine,
+            generatedColumn,
+
+            hasLastGeneratedColumn,
+            lastGeneratedColumn,
+
+            hasOriginal,
+            source,
+            originalLine,
+            originalColumn,
+
+            hasName,
+            name
+          ) {
+            const mapping = new Mapping();
+            // JS uses 1-based line numbers, wasm uses 0-based.
+            mapping.generatedLine = generatedLine + 1;
+            mapping.generatedColumn = generatedColumn;
+
+            if (hasLastGeneratedColumn) {
+              // JS uses inclusive last generated column, wasm uses exclusive.
+              mapping.lastGeneratedColumn = lastGeneratedColumn - 1;
+            }
+
+            if (hasOriginal) {
+              mapping.source = source;
+              // JS uses 1-based line numbers, wasm uses 0-based.
+              mapping.originalLine = originalLine + 1;
+              mapping.originalColumn = originalColumn;
+
+              if (hasName) {
+                mapping.name = name;
+              }
+            }
+
+            callbackStack[callbackStack.length - 1](mapping);
+          },
+
+          start_all_generated_locations_for() { console.time("all_generated_locations_for"); },
+          end_all_generated_locations_for() { console.timeEnd("all_generated_locations_for"); },
+
+          start_compute_column_spans() { console.time("compute_column_spans"); },
+          end_compute_column_spans() { console.timeEnd("compute_column_spans"); },
+
+          start_generated_location_for() { console.time("generated_location_for"); },
+          end_generated_location_for() { console.timeEnd("generated_location_for"); },
+
+          start_original_location_for() { console.time("original_location_for"); },
+          end_original_location_for() { console.timeEnd("original_location_for"); },
+
+          start_parse_mappings() { console.time("parse_mappings"); },
+          end_parse_mappings() { console.timeEnd("parse_mappings"); },
+
+          start_sort_by_generated_location() { console.time("sort_by_generated_location"); },
+          end_sort_by_generated_location() { console.timeEnd("sort_by_generated_location"); },
+
+          start_sort_by_original_location() { console.time("sort_by_original_location"); },
+          end_sort_by_original_location() { console.timeEnd("sort_by_original_location"); },
+        }
+      });
+  }).then(Wasm => {
+    return {
+      exports: Wasm.instance.exports,
+      withMappingCallback: (mappingCallback, f) => {
+        callbackStack.push(mappingCallback);
+        try {
+          f();
+        } finally {
+          callbackStack.pop();
+        }
+      }
+    };
+  }).then(null, e => {
+    cachedWasm = null;
+    throw e;
+  });
+
+  return cachedWasm;
+};
+
+
+/***/ }),
+/* 13 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+const util = __webpack_require__(0);
+
+// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+// operating systems these days (capturing the result).
+const REGEX_NEWLINE = /(\r?\n)/;
+
+// Newline character code for charCodeAt() comparisons
+const NEWLINE_CODE = 10;
+
+// Private symbol for identifying `SourceNode`s when multiple versions of
+// the source-map library are loaded. This MUST NOT CHANGE across
+// versions!
+const isSourceNode = "$$$isSourceNode$$$";
+
+/**
+ * SourceNodes provide a way to abstract over interpolating/concatenating
+ * snippets of generated JavaScript source code while maintaining the line and
+ * column information associated with the original source code.
+ *
+ * @param aLine The original line number.
+ * @param aColumn The original column number.
+ * @param aSource The original source's filename.
+ * @param aChunks Optional. An array of strings which are snippets of
+ *        generated JS, or other SourceNodes.
+ * @param aName The original identifier.
+ */
+class SourceNode {
+  constructor(aLine, aColumn, aSource, aChunks, aName) {
+    this.children = [];
+    this.sourceContents = {};
+    this.line = aLine == null ? null : aLine;
+    this.column = aColumn == null ? null : aColumn;
+    this.source = aSource == null ? null : aSource;
+    this.name = aName == null ? null : aName;
+    this[isSourceNode] = true;
+    if (aChunks != null) this.add(aChunks);
+  }
+
+  /**
+   * Creates a SourceNode from generated code and a SourceMapConsumer.
+   *
+   * @param aGeneratedCode The generated code
+   * @param aSourceMapConsumer The SourceMap for the generated code
+   * @param aRelativePath Optional. The path that relative sources in the
+   *        SourceMapConsumer should be relative to.
+   */
+  static fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+    // The SourceNode we want to fill with the generated code
+    // and the SourceMap
+    const node = new SourceNode();
+
+    // All even indices of this array are one line of the generated code,
+    // while all odd indices are the newlines between two adjacent lines
+    // (since `REGEX_NEWLINE` captures its match).
+    // Processed fragments are accessed by calling `shiftNextLine`.
+    const remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+    let remainingLinesIndex = 0;
+    const shiftNextLine = function() {
+      const lineContents = getNextLine();
+      // The last line of a file might not have a newline.
+      const newLine = getNextLine() || "";
+      return lineContents + newLine;
+
+      function getNextLine() {
+        return remainingLinesIndex < remainingLines.length ?
+            remainingLines[remainingLinesIndex++] : undefined;
+      }
+    };
+
+    // We need to remember the position of "remainingLines"
+    let lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+    // The generate SourceNodes we need a code range.
+    // To extract it current and last mapping is used.
+    // Here we store the last mapping.
+    let lastMapping = null;
+    let nextLine;
+
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      if (lastMapping !== null) {
+        // We add the code from "lastMapping" to "mapping":
+        // First check if there is a new line in between.
+        if (lastGeneratedLine < mapping.generatedLine) {
+          // Associate first line with "lastMapping"
+          addMappingWithCode(lastMapping, shiftNextLine());
+          lastGeneratedLine++;
+          lastGeneratedColumn = 0;
+          // The remaining code is added without mapping
+        } else {
+          // There is no new line in between.
+          // Associate the code between "lastGeneratedColumn" and
+          // "mapping.generatedColumn" with "lastMapping"
+          nextLine = remainingLines[remainingLinesIndex] || "";
+          const code = nextLine.substr(0, mapping.generatedColumn -
+                                        lastGeneratedColumn);
+          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+                                              lastGeneratedColumn);
+          lastGeneratedColumn = mapping.generatedColumn;
+          addMappingWithCode(lastMapping, code);
+          // No more remaining code, continue
+          lastMapping = mapping;
+          return;
+        }
+      }
+      // We add the generated code until the first mapping
+      // to the SourceNode without any mapping.
+      // Each line is added as separate string.
+      while (lastGeneratedLine < mapping.generatedLine) {
+        node.add(shiftNextLine());
+        lastGeneratedLine++;
+      }
+      if (lastGeneratedColumn < mapping.generatedColumn) {
+        nextLine = remainingLines[remainingLinesIndex] || "";
+        node.add(nextLine.substr(0, mapping.generatedColumn));
+        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+        lastGeneratedColumn = mapping.generatedColumn;
+      }
+      lastMapping = mapping;
+    }, this);
+    // We have processed all mappings.
+    if (remainingLinesIndex < remainingLines.length) {
+      if (lastMapping) {
+        // Associate the remaining code in the current line with "lastMapping"
+        addMappingWithCode(lastMapping, shiftNextLine());
+      }
+      // and add the remaining lines without any mapping
+      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+    }
+
+    // Copy sourcesContent into SourceNode
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aRelativePath != null) {
+          sourceFile = util.join(aRelativePath, sourceFile);
+        }
+        node.setSourceContent(sourceFile, content);
+      }
+    });
+
+    return node;
+
+    function addMappingWithCode(mapping, code) {
+      if (mapping === null || mapping.source === undefined) {
+        node.add(code);
+      } else {
+        const source = aRelativePath
+          ? util.join(aRelativePath, mapping.source)
+          : mapping.source;
+        node.add(new SourceNode(mapping.originalLine,
+                                mapping.originalColumn,
+                                source,
+                                code,
+                                mapping.name));
+      }
+    }
+  }
+
+  /**
+   * Add a chunk of generated JS to this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  add(aChunk) {
+    if (Array.isArray(aChunk)) {
+      aChunk.forEach(function(chunk) {
+        this.add(chunk);
+      }, this);
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      if (aChunk) {
+        this.children.push(aChunk);
+      }
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Add a chunk of generated JS to the beginning of this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  prepend(aChunk) {
+    if (Array.isArray(aChunk)) {
+      for (let i = aChunk.length - 1; i >= 0; i--) {
+        this.prepend(aChunk[i]);
+      }
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      this.children.unshift(aChunk);
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Walk over the tree of JS snippets in this node and its children. The
+   * walking function is called once for each snippet of JS and is passed that
+   * snippet and the its original associated source's line/column location.
+   *
+   * @param aFn The traversal function.
+   */
+  walk(aFn) {
+    let chunk;
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      chunk = this.children[i];
+      if (chunk[isSourceNode]) {
+        chunk.walk(aFn);
+      } else if (chunk !== "") {
+        aFn(chunk, { source: this.source,
+                      line: this.line,
+                      column: this.column,
+                      name: this.name });
+      }
+    }
+  }
+
+  /**
+   * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+   * each of `this.children`.
+   *
+   * @param aSep The separator.
+   */
+  join(aSep) {
+    let newChildren;
+    let i;
+    const len = this.children.length;
+    if (len > 0) {
+      newChildren = [];
+      for (i = 0; i < len - 1; i++) {
+        newChildren.push(this.children[i]);
+        newChildren.push(aSep);
+      }
+      newChildren.push(this.children[i]);
+      this.children = newChildren;
+    }
+    return this;
+  }
+
+  /**
+   * Call String.prototype.replace on the very right-most source snippet. Useful
+   * for trimming whitespace from the end of a source node, etc.
+   *
+   * @param aPattern The pattern to replace.
+   * @param aReplacement The thing to replace the pattern with.
+   */
+  replaceRight(aPattern, aReplacement) {
+    const lastChild = this.children[this.children.length - 1];
+    if (lastChild[isSourceNode]) {
+      lastChild.replaceRight(aPattern, aReplacement);
+    } else if (typeof lastChild === "string") {
+      this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+    } else {
+      this.children.push("".replace(aPattern, aReplacement));
+    }
+    return this;
+  }
+
+  /**
+   * Set the source content for a source file. This will be added to the SourceMapGenerator
+   * in the sourcesContent field.
+   *
+   * @param aSourceFile The filename of the source file
+   * @param aSourceContent The content of the source file
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+  }
+
+  /**
+   * Walk over the tree of SourceNodes. The walking function is called for each
+   * source file content and is passed the filename and source content.
+   *
+   * @param aFn The traversal function.
+   */
+  walkSourceContents(aFn) {
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      if (this.children[i][isSourceNode]) {
+        this.children[i].walkSourceContents(aFn);
+      }
+    }
+
+    const sources = Object.keys(this.sourceContents);
+    for (let i = 0, len = sources.length; i < len; i++) {
+      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+    }
+  }
+
+  /**
+   * Return the string representation of this source node. Walks over the tree
+   * and concatenates all the various snippets together to one string.
+   */
+  toString() {
+    let str = "";
+    this.walk(function(chunk) {
+      str += chunk;
+    });
+    return str;
+  }
+
+  /**
+   * Returns the string representation of this source node along with a source
+   * map.
+   */
+  toStringWithSourceMap(aArgs) {
+    const generated = {
+      code: "",
+      line: 1,
+      column: 0
+    };
+    const map = new SourceMapGenerator(aArgs);
+    let sourceMappingActive = false;
+    let lastOriginalSource = null;
+    let lastOriginalLine = null;
+    let lastOriginalColumn = null;
+    let lastOriginalName = null;
+    this.walk(function(chunk, original) {
+      generated.code += chunk;
+      if (original.source !== null
+          && original.line !== null
+          && original.column !== null) {
+        if (lastOriginalSource !== original.source
+          || lastOriginalLine !== original.line
+          || lastOriginalColumn !== original.column
+          || lastOriginalName !== original.name) {
+          map.addMapping({
+            source: original.source,
+            original: {
+              line: original.line,
+              column: original.column
+            },
+            generated: {
+              line: generated.line,
+              column: generated.column
+            },
+            name: original.name
+          });
+        }
+        lastOriginalSource = original.source;
+        lastOriginalLine = original.line;
+        lastOriginalColumn = original.column;
+        lastOriginalName = original.name;
+        sourceMappingActive = true;
+      } else if (sourceMappingActive) {
+        map.addMapping({
+          generated: {
+            line: generated.line,
+            column: generated.column
+          }
+        });
+        lastOriginalSource = null;
+        sourceMappingActive = false;
+      }
+      for (let idx = 0, length = chunk.length; idx < length; idx++) {
+        if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+          generated.line++;
+          generated.column = 0;
+          // Mappings end at eol
+          if (idx + 1 === length) {
+            lastOriginalSource = null;
+            sourceMappingActive = false;
+          } else if (sourceMappingActive) {
+            map.addMapping({
+              source: original.source,
+              original: {
+                line: original.line,
+                column: original.column
+              },
+              generated: {
+                line: generated.line,
+                column: generated.column
+              },
+              name: original.name
+            });
+          }
+        } else {
+          generated.column++;
+        }
+      }
+    });
+    this.walkSourceContents(function(sourceFile, sourceContent) {
+      map.setSourceContent(sourceFile, sourceContent);
+    });
+
+    return { code: generated.code, map };
+  }
+}
+
+exports.SourceNode = SourceNode;
+
+
+/***/ })
+/******/ ]);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/array-set.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/array-set.js
new file mode 100644
index 0000000..40171b9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/array-set.js
@@ -0,0 +1,100 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+class ArraySet {
+  constructor() {
+    this._array = [];
+    this._set = new Map();
+  }
+
+  /**
+   * Static method for creating ArraySet instances from an existing array.
+   */
+  static fromArray(aArray, aAllowDuplicates) {
+    const set = new ArraySet();
+    for (let i = 0, len = aArray.length; i < len; i++) {
+      set.add(aArray[i], aAllowDuplicates);
+    }
+    return set;
+  }
+
+  /**
+   * Return how many unique items are in this ArraySet. If duplicates have been
+   * added, than those do not count towards the size.
+   *
+   * @returns Number
+   */
+  size() {
+    return this._set.size;
+  }
+
+  /**
+   * Add the given string to this set.
+   *
+   * @param String aStr
+   */
+  add(aStr, aAllowDuplicates) {
+    const isDuplicate = this.has(aStr);
+    const idx = this._array.length;
+    if (!isDuplicate || aAllowDuplicates) {
+      this._array.push(aStr);
+    }
+    if (!isDuplicate) {
+      this._set.set(aStr, idx);
+    }
+  }
+
+  /**
+   * Is the given string a member of this set?
+   *
+   * @param String aStr
+   */
+  has(aStr) {
+      return this._set.has(aStr);
+  }
+
+  /**
+   * What is the index of the given string in the array?
+   *
+   * @param String aStr
+   */
+  indexOf(aStr) {
+    const idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+    throw new Error('"' + aStr + '" is not in the set.');
+  }
+
+  /**
+   * What is the element at the given index?
+   *
+   * @param Number aIdx
+   */
+  at(aIdx) {
+    if (aIdx >= 0 && aIdx < this._array.length) {
+      return this._array[aIdx];
+    }
+    throw new Error("No element indexed by " + aIdx);
+  }
+
+  /**
+   * Returns the array representation of this set (which has the proper indices
+   * indicated by indexOf). Note that this is a copy of the internal array used
+   * for storing the members so that no one can mess with internal state.
+   */
+  toArray() {
+    return this._array.slice();
+  }
+}
+exports.ArraySet = ArraySet;
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/base64-vlq.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/base64-vlq.js
new file mode 100644
index 0000000..fc1049c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/base64-vlq.js
@@ -0,0 +1,111 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+const base64 = require("./base64");
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+const VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+const VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+const VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+const VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+// eslint-disable-next-line no-unused-vars
+function fromVLQSigned(aValue) {
+  const isNegative = (aValue & 1) === 1;
+  const shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+exports.encode = function base64VLQ_encode(aValue) {
+  let encoded = "";
+  let digit;
+
+  let vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/base64.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/base64.js
new file mode 100644
index 0000000..b9ca319
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/base64.js
@@ -0,0 +1,18 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const intToCharMap = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+exports.encode = function(number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/binary-search.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/binary-search.js
new file mode 100644
index 0000000..d6f898e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/binary-search.js
@@ -0,0 +1,107 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+exports.GREATEST_LOWER_BOUND = 1;
+exports.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Recursive implementation of binary search.
+ *
+ * @param aLow Indices here and lower do not contain the needle.
+ * @param aHigh Indices here and higher do not contain the needle.
+ * @param aNeedle The element being searched for.
+ * @param aHaystack The non-empty array being searched.
+ * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ */
+function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+  // This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  const mid = Math.floor((aHigh - aLow) / 2) + aLow;
+  const cmp = aCompare(aNeedle, aHaystack[mid], true);
+  if (cmp === 0) {
+    // Found the element we are looking for.
+    return mid;
+  } else if (cmp > 0) {
+    // Our needle is greater than aHaystack[mid].
+    if (aHigh - mid > 1) {
+      // The element is in the upper half.
+      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // The exact needle element was not found in this haystack. Determine if
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return aHigh < aHaystack.length ? aHigh : -1;
+    }
+    return mid;
+  }
+
+  // Our needle is less than aHaystack[mid].
+  if (mid - aLow > 1) {
+    // The element is in the lower half.
+    return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+  }
+
+  // we are in termination case (3) or (2) and return the appropriate thing.
+  if (aBias == exports.LEAST_UPPER_BOUND) {
+    return mid;
+  }
+  return aLow < 0 ? -1 : aLow;
+}
+
+/**
+ * This is an implementation of binary search which will always try and return
+ * the index of the closest element if there is no exact hit. This is because
+ * mappings between original and generated line/col pairs are single points,
+ * and there is an implicit region between each of them, so a miss just means
+ * that you aren't on the very start of a region.
+ *
+ * @param aNeedle The element you are looking for.
+ * @param aHaystack The array that is being searched.
+ * @param aCompare A function which takes the needle and an element in the
+ *     array and returns -1, 0, or 1 depending on whether the needle is less
+ *     than, equal to, or greater than the element, respectively.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+ */
+exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+  if (aHaystack.length === 0) {
+    return -1;
+  }
+
+  let index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+  if (index < 0) {
+    return -1;
+  }
+
+  // We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while (index - 1 >= 0) {
+    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+      break;
+    }
+    --index;
+  }
+
+  return index;
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/mapping-list.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/mapping-list.js
new file mode 100644
index 0000000..7056861
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/mapping-list.js
@@ -0,0 +1,80 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2014 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = require("./util");
+
+/**
+ * Determine whether mappingB is after mappingA with respect to generated
+ * position.
+ */
+function generatedPositionAfter(mappingA, mappingB) {
+  // Optimized for most common case
+  const lineA = mappingA.generatedLine;
+  const lineB = mappingB.generatedLine;
+  const columnA = mappingA.generatedColumn;
+  const columnB = mappingB.generatedColumn;
+  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+}
+
+/**
+ * A data structure to provide a sorted view of accumulated mappings in a
+ * performance conscious manner. It trades a negligible overhead in general
+ * case for a large speedup in case of mappings being added in order.
+ */
+class MappingList {
+  constructor() {
+    this._array = [];
+    this._sorted = true;
+    // Serves as infimum
+    this._last = {generatedLine: -1, generatedColumn: 0};
+  }
+
+  /**
+   * Iterate through internal items. This method takes the same arguments that
+   * `Array.prototype.forEach` takes.
+   *
+   * NOTE: The order of the mappings is NOT guaranteed.
+   */
+  unsortedForEach(aCallback, aThisArg) {
+    this._array.forEach(aCallback, aThisArg);
+  }
+
+  /**
+   * Add the given source mapping.
+   *
+   * @param Object aMapping
+   */
+  add(aMapping) {
+    if (generatedPositionAfter(this._last, aMapping)) {
+      this._last = aMapping;
+      this._array.push(aMapping);
+    } else {
+      this._sorted = false;
+      this._array.push(aMapping);
+    }
+  }
+
+  /**
+   * Returns the flat, sorted array of mappings. The mappings are sorted by
+   * generated position.
+   *
+   * WARNING: This method returns internal data without copying, for
+   * performance. The return value must NOT be mutated, and should be treated as
+   * an immutable borrow. If you want to take ownership, you must make your own
+   * copy.
+   */
+  toArray() {
+    if (!this._sorted) {
+      this._array.sort(util.compareByGeneratedPositionsInflated);
+      this._sorted = true;
+    }
+    return this._array;
+  }
+}
+
+exports.MappingList = MappingList;
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/mappings.wasm b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/mappings.wasm
new file mode 100644
index 0000000..3515370
Binary files /dev/null and b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/mappings.wasm differ
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/read-wasm.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/read-wasm.js
new file mode 100644
index 0000000..9bb6492
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/read-wasm.js
@@ -0,0 +1,40 @@
+if (typeof fetch === "function") {
+  // Web version of reading a wasm file into an array buffer.
+
+  let mappingsWasmUrl = null;
+
+  module.exports = function readWasm() {
+    if (typeof mappingsWasmUrl !== "string") {
+      throw new Error("You must provide the URL of lib/mappings.wasm by calling " +
+                      "SourceMapConsumer.initialize({ 'lib/mappings.wasm': ... }) " +
+                      "before using SourceMapConsumer");
+    }
+
+    return fetch(mappingsWasmUrl)
+      .then(response => response.arrayBuffer());
+  };
+
+  module.exports.initialize = url => mappingsWasmUrl = url;
+} else {
+  // Node version of reading a wasm file into an array buffer.
+  const fs = require("fs");
+  const path = require("path");
+
+  module.exports = function readWasm() {
+    return new Promise((resolve, reject) => {
+      const wasmPath = path.join(__dirname, "mappings.wasm");
+      fs.readFile(wasmPath, null, (error, data) => {
+        if (error) {
+          reject(error);
+          return;
+        }
+
+        resolve(data.buffer);
+      });
+    });
+  };
+
+  module.exports.initialize = _ => {
+    console.debug("SourceMapConsumer.initialize is a no-op when running in node.js");
+  };
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-map-consumer.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-map-consumer.js
new file mode 100644
index 0000000..43ea1a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-map-consumer.js
@@ -0,0 +1,1254 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = require("./util");
+const binarySearch = require("./binary-search");
+const ArraySet = require("./array-set").ArraySet;
+const base64VLQ = require("./base64-vlq"); // eslint-disable-line no-unused-vars
+const readWasm = require("../lib/read-wasm");
+const wasm = require("./wasm");
+
+const INTERNAL = Symbol("smcInternal");
+
+class SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    // If the constructor was called by super(), just return Promise<this>.
+    // Yes, this is a hack to retain the pre-existing API of the base-class
+    // constructor also being an async factory function.
+    if (aSourceMap == INTERNAL) {
+      return Promise.resolve(this);
+    }
+
+    return _factory(aSourceMap, aSourceMapURL);
+  }
+
+  static initialize(opts) {
+    readWasm.initialize(opts["lib/mappings.wasm"]);
+  }
+
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return _factoryBSM(aSourceMap, aSourceMapURL);
+  }
+
+  /**
+   * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+   * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+   * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+   * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+   * value.
+   *
+   * You must not use the consumer after `f` completes!
+   *
+   * By using `with`, you do not have to remember to manually call `destroy` on
+   * the consumer, since it will be called automatically once `f` completes.
+   *
+   * ```js
+   * const xSquared = await SourceMapConsumer.with(
+   *   myRawSourceMap,
+   *   null,
+   *   async function (consumer) {
+   *     // Use `consumer` inside here and don't worry about remembering
+   *     // to call `destroy`.
+   *
+   *     const x = await whatever(consumer);
+   *     return x * x;
+   *   }
+   * );
+   *
+   * // You may not use that `consumer` anymore out here; it has
+   * // been destroyed. But you can use `xSquared`.
+   * console.log(xSquared);
+   * ```
+   */
+  static with(rawSourceMap, sourceMapUrl, f) {
+    // Note: The `acorn` version that `webpack` currently depends on doesn't
+    // support `async` functions, and the nodes that we support don't all have
+    // `.finally`. Therefore, this is written a bit more convolutedly than it
+    // should really be.
+
+    let consumer = null;
+    const promise = new SourceMapConsumer(rawSourceMap, sourceMapUrl);
+    return promise
+      .then(c => {
+        consumer = c;
+        return f(c);
+      })
+      .then(x => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        return x;
+      }, e => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        throw e;
+      });
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    throw new Error("Subclasses must implement _parseMappings");
+  }
+
+  /**
+   * Iterate over each mapping between an original source/line/column and a
+   * generated line/column in this source map.
+   *
+   * @param Function aCallback
+   *        The function that is called with each mapping.
+   * @param Object aContext
+   *        Optional. If specified, this object will be the value of `this` every
+   *        time that `aCallback` is called.
+   * @param aOrder
+   *        Either `SourceMapConsumer.GENERATED_ORDER` or
+   *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+   *        iterate over the mappings sorted by the generated file's line/column
+   *        order or the original's source/line/column order, respectively. Defaults to
+   *        `SourceMapConsumer.GENERATED_ORDER`.
+   */
+  eachMapping(aCallback, aContext, aOrder) {
+    throw new Error("Subclasses must implement eachMapping");
+  }
+
+  /**
+   * Returns all generated line and column information for the original source,
+   * line, and column provided. If no column is provided, returns all mappings
+   * corresponding to a either the line we are searching for or the next
+   * closest line that has any mappings. Otherwise, returns all mappings
+   * corresponding to the given line and either the column we are searching for
+   * or the next closest column that has any offsets.
+   *
+   * The only argument is an object with the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number is 1-based.
+   *   - column: Optional. the column number in the original source.
+   *    The column number is 0-based.
+   *
+   * and an array of objects is returned, each with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *    line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *    The column number is 0-based.
+   */
+  allGeneratedPositionsFor(aArgs) {
+    throw new Error("Subclasses must implement allGeneratedPositionsFor");
+  }
+
+  destroy() {
+    throw new Error("Subclasses must implement destroy");
+  }
+}
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+SourceMapConsumer.prototype._version = 3;
+SourceMapConsumer.GENERATED_ORDER = 1;
+SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+exports.SourceMapConsumer = SourceMapConsumer;
+
+/**
+ * A BasicSourceMapConsumer instance represents a parsed source map which we can
+ * query for information about the original file positions by giving it a file
+ * position in the generated source.
+ *
+ * The first parameter is the raw source map (either as a JSON string, or
+ * already parsed to an object). According to the spec, source maps have the
+ * following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - sources: An array of URLs to the original source files.
+ *   - names: An array of identifiers which can be referenced by individual mappings.
+ *   - sourceRoot: Optional. The URL root from which all sources are relative.
+ *   - sourcesContent: Optional. An array of contents of the original source files.
+ *   - mappings: A string of base64 VLQs which contain the actual mappings.
+ *   - file: Optional. The generated file this source map is associated with.
+ *
+ * Here is an example source map, taken from the source map spec[0]:
+ *
+ *     {
+ *       version : 3,
+ *       file: "out.js",
+ *       sourceRoot : "",
+ *       sources: ["foo.js", "bar.js"],
+ *       names: ["src", "maps", "are", "fun"],
+ *       mappings: "AA,AB;;ABCDE;"
+ *     }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+ */
+class BasicSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      let sources = util.getArg(sourceMap, "sources");
+      // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+      // requires the array) to play nice here.
+      const names = util.getArg(sourceMap, "names", []);
+      let sourceRoot = util.getArg(sourceMap, "sourceRoot", null);
+      const sourcesContent = util.getArg(sourceMap, "sourcesContent", null);
+      const mappings = util.getArg(sourceMap, "mappings");
+      const file = util.getArg(sourceMap, "file", null);
+
+      // Once again, Sass deviates from the spec and supplies the version as a
+      // string rather than a number, so we use loose equality checking here.
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      if (sourceRoot) {
+        sourceRoot = util.normalize(sourceRoot);
+      }
+
+      sources = sources
+        .map(String)
+        // Some source maps produce relative source paths like "./foo.js" instead of
+        // "foo.js".  Normalize these first so that future comparisons will succeed.
+        // See bugzil.la/1090768.
+        .map(util.normalize)
+        // Always ensure that absolute sources are internally stored relative to
+        // the source root, if the source root is absolute. Not doing this would
+        // be particularly problematic when the source root is a prefix of the
+        // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+        .map(function(source) {
+          return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+            ? util.relative(sourceRoot, source)
+            : source;
+        });
+
+      // Pass `true` below to allow duplicate names and sources. While source maps
+      // are intended to be compressed and deduplicated, the TypeScript compiler
+      // sometimes generates source maps with duplicates in them. See Github issue
+      // #72 and bugzil.la/889492.
+      that._names = ArraySet.fromArray(names.map(String), true);
+      that._sources = ArraySet.fromArray(sources, true);
+
+      that._absoluteSources = that._sources.toArray().map(function(s) {
+        return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+      });
+
+      that.sourceRoot = sourceRoot;
+      that.sourcesContent = sourcesContent;
+      that._mappings = mappings;
+      that._sourceMapURL = aSourceMapURL;
+      that.file = file;
+
+      that._computedColumnSpans = false;
+      that._mappingsPtr = 0;
+      that._wasm = null;
+
+      return wasm().then(w => {
+        that._wasm = w;
+        return that;
+      });
+    });
+  }
+
+  /**
+   * Utility function to find the index of a source.  Returns -1 if not
+   * found.
+   */
+  _findSourceIndex(aSource) {
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    if (this._sources.has(relativeSource)) {
+      return this._sources.indexOf(relativeSource);
+    }
+
+    // Maybe aSource is an absolute URL as returned by |sources|.  In
+    // this case we can't simply undo the transform.
+    for (let i = 0; i < this._absoluteSources.length; ++i) {
+      if (this._absoluteSources[i] == aSource) {
+        return i;
+      }
+    }
+
+    return -1;
+  }
+
+  /**
+   * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+   *
+   * @param SourceMapGenerator aSourceMap
+   *        The source map that will be consumed.
+   * @param String aSourceMapURL
+   *        The URL at which the source map can be found (optional)
+   * @returns BasicSourceMapConsumer
+   */
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return new BasicSourceMapConsumer(aSourceMap.toString());
+  }
+
+  get sources() {
+    return this._absoluteSources.slice();
+  }
+
+  _getMappingsPtr() {
+    if (this._mappingsPtr === 0) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this._mappingsPtr;
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const size = aStr.length;
+
+    const mappingsBufPtr = this._wasm.exports.allocate_mappings(size);
+    const mappingsBuf = new Uint8Array(this._wasm.exports.memory.buffer, mappingsBufPtr, size);
+    for (let i = 0; i < size; i++) {
+      mappingsBuf[i] = aStr.charCodeAt(i);
+    }
+
+    const mappingsPtr = this._wasm.exports.parse_mappings(mappingsBufPtr);
+
+    if (!mappingsPtr) {
+      const error = this._wasm.exports.get_last_error();
+      let msg = `Error parsing mappings (code ${error}): `;
+
+      // XXX: keep these error codes in sync with `fitzgen/source-map-mappings`.
+      switch (error) {
+        case 1:
+          msg += "the mappings contained a negative line, column, source index, or name index";
+          break;
+        case 2:
+          msg += "the mappings contained a number larger than 2**32";
+          break;
+        case 3:
+          msg += "reached EOF while in the middle of parsing a VLQ";
+          break;
+        case 4:
+          msg += "invalid base 64 character while parsing a VLQ";
+          break;
+        default:
+          msg += "unknown error code";
+          break;
+      }
+
+      throw new Error(msg);
+    }
+
+    this._mappingsPtr = mappingsPtr;
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+    const sourceRoot = this.sourceRoot;
+
+    this._wasm.withMappingCallback(
+      mapping => {
+        if (mapping.source !== null) {
+          mapping.source = this._sources.at(mapping.source);
+          mapping.source = util.computeSourceURL(sourceRoot, mapping.source, this._sourceMapURL);
+
+          if (mapping.name !== null) {
+            mapping.name = this._names.at(mapping.name);
+          }
+        }
+
+        aCallback.call(context, mapping);
+      },
+      () => {
+        switch (order) {
+        case SourceMapConsumer.GENERATED_ORDER:
+          this._wasm.exports.by_generated_location(this._getMappingsPtr());
+          break;
+        case SourceMapConsumer.ORIGINAL_ORDER:
+          this._wasm.exports.by_original_location(this._getMappingsPtr());
+          break;
+        default:
+          throw new Error("Unknown order of iteration.");
+        }
+      }
+    );
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    const originalLine = util.getArg(aArgs, "line");
+    const originalColumn = aArgs.column || 0;
+
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return [];
+    }
+
+    if (originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    this._wasm.withMappingCallback(
+      m => {
+        let lastColumn = m.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        mappings.push({
+          line: m.generatedLine,
+          column: m.generatedColumn,
+          lastColumn,
+        });
+      }, () => {
+        this._wasm.exports.all_generated_locations_for(
+          this._getMappingsPtr(),
+          source,
+          originalLine - 1,
+          "column" in aArgs,
+          originalColumn
+        );
+      }
+    );
+
+    return mappings;
+  }
+
+  destroy() {
+    if (this._mappingsPtr !== 0) {
+      this._wasm.exports.free_mappings(this._mappingsPtr);
+      this._mappingsPtr = 0;
+    }
+  }
+
+  /**
+   * Compute the last column for each generated mapping. The last column is
+   * inclusive.
+   */
+  computeColumnSpans() {
+    if (this._computedColumnSpans) {
+      return;
+    }
+
+    this._wasm.exports.compute_column_spans(this._getMappingsPtr());
+    this._computedColumnSpans = true;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.generatedLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.generatedColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.original_location_for(
+        this._getMappingsPtr(),
+        needle.generatedLine - 1,
+        needle.generatedColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.generatedLine === needle.generatedLine) {
+        let source = util.getArg(mapping, "source", null);
+        if (source !== null) {
+          source = this._sources.at(source);
+          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+        }
+
+        let name = util.getArg(mapping, "name", null);
+        if (name !== null) {
+          name = this._names.at(name);
+        }
+
+        return {
+          source,
+          line: util.getArg(mapping, "originalLine", null),
+          column: util.getArg(mapping, "originalColumn", null),
+          name
+        };
+      }
+    }
+
+    return {
+      source: null,
+      line: null,
+      column: null,
+      name: null
+    };
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    if (!this.sourcesContent) {
+      return false;
+    }
+    return this.sourcesContent.length >= this._sources.size() &&
+      !this.sourcesContent.some(function(sc) { return sc == null; });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    if (!this.sourcesContent) {
+      return null;
+    }
+
+    const index = this._findSourceIndex(aSource);
+    if (index >= 0) {
+      return this.sourcesContent[index];
+    }
+
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    let url;
+    if (this.sourceRoot != null
+        && (url = util.urlParse(this.sourceRoot))) {
+      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+      // many users. We can help them out when they expect file:// URIs to
+      // behave like it would if they were running a local HTTP server. See
+      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+      const fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+      if (url.scheme == "file"
+          && this._sources.has(fileUriAbsPath)) {
+        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];
+      }
+
+      if ((!url.path || url.path == "/")
+          && this._sources.has("/" + relativeSource)) {
+        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+      }
+    }
+
+    // This function is used recursively from
+    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+    // don't want to throw if we can't find the source - we just want to
+    // return null, so we provide a flag to exit gracefully.
+    if (nullOnMissing) {
+      return null;
+    }
+
+    throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return {
+        line: null,
+        column: null,
+        lastColumn: null
+      };
+    }
+
+    const needle = {
+      source,
+      originalLine: util.getArg(aArgs, "line"),
+      originalColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.generated_location_for(
+        this._getMappingsPtr(),
+        needle.source,
+        needle.originalLine - 1,
+        needle.originalColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.source === needle.source) {
+        let lastColumn = mapping.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        return {
+          line: util.getArg(mapping, "generatedLine", null),
+          column: util.getArg(mapping, "generatedColumn", null),
+          lastColumn,
+        };
+      }
+    }
+
+    return {
+      line: null,
+      column: null,
+      lastColumn: null
+    };
+  }
+}
+
+BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+/**
+ * An IndexedSourceMapConsumer instance represents a parsed source map which
+ * we can query for information. It differs from BasicSourceMapConsumer in
+ * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+ * input.
+ *
+ * The first parameter is a raw source map (either as a JSON string, or already
+ * parsed to an object). According to the spec for indexed source maps, they
+ * have the following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - file: Optional. The generated file this source map is associated with.
+ *   - sections: A list of section definitions.
+ *
+ * Each value under the "sections" field has two fields:
+ *   - offset: The offset into the original specified at which this section
+ *       begins to apply, defined as an object with a "line" and "column"
+ *       field.
+ *   - map: A source map definition. This source map could also be indexed,
+ *       but doesn't have to be.
+ *
+ * Instead of the "map" field, it's also possible to have a "url" field
+ * specifying a URL to retrieve a source map from, but that's currently
+ * unsupported.
+ *
+ * Here's an example source map, taken from the source map spec[0], but
+ * modified to omit a section which uses the "url" field.
+ *
+ *  {
+ *    version : 3,
+ *    file: "app.js",
+ *    sections: [{
+ *      offset: {line:100, column:10},
+ *      map: {
+ *        version : 3,
+ *        file: "section.js",
+ *        sources: ["foo.js", "bar.js"],
+ *        names: ["src", "maps", "are", "fun"],
+ *        mappings: "AAAA,E;;ABCDE;"
+ *      }
+ *    }],
+ *  }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+ */
+class IndexedSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      const sections = util.getArg(sourceMap, "sections");
+
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      that._sources = new ArraySet();
+      that._names = new ArraySet();
+      that.__generatedMappings = null;
+      that.__originalMappings = null;
+      that.__generatedMappingsUnsorted = null;
+      that.__originalMappingsUnsorted = null;
+
+      let lastOffset = {
+        line: -1,
+        column: 0
+      };
+      return Promise.all(sections.map(s => {
+        if (s.url) {
+          // The url field will require support for asynchronicity.
+          // See https://github.com/mozilla/source-map/issues/16
+          throw new Error("Support for url field in sections not implemented.");
+        }
+        const offset = util.getArg(s, "offset");
+        const offsetLine = util.getArg(offset, "line");
+        const offsetColumn = util.getArg(offset, "column");
+
+        if (offsetLine < lastOffset.line ||
+            (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+          throw new Error("Section offsets must be ordered and non-overlapping.");
+        }
+        lastOffset = offset;
+
+        const cons = new SourceMapConsumer(util.getArg(s, "map"), aSourceMapURL);
+        return cons.then(consumer => {
+          return {
+            generatedOffset: {
+              // The offset fields are 0-based, but we use 1-based indices when
+              // encoding/decoding from VLQ.
+              generatedLine: offsetLine + 1,
+              generatedColumn: offsetColumn + 1
+            },
+            consumer
+          };
+        });
+      })).then(s => {
+        that._sections = s;
+        return that;
+      });
+    });
+  }
+
+  // `__generatedMappings` and `__originalMappings` are arrays that hold the
+  // parsed mapping coordinates from the source map's "mappings" attribute. They
+  // are lazily instantiated, accessed via the `_generatedMappings` and
+  // `_originalMappings` getters respectively, and we only parse the mappings
+  // and create these arrays once queried for a source location. We jump through
+  // these hoops because there can be many thousands of mappings, and parsing
+  // them is expensive, so we only want to do it if we must.
+  //
+  // Each object in the arrays is of the form:
+  //
+  //     {
+  //       generatedLine: The line number in the generated code,
+  //       generatedColumn: The column number in the generated code,
+  //       source: The path to the original source file that generated this
+  //               chunk of code,
+  //       originalLine: The line number in the original source that
+  //                     corresponds to this chunk of generated code,
+  //       originalColumn: The column number in the original source that
+  //                       corresponds to this chunk of generated code,
+  //       name: The name of the original symbol which generated this chunk of
+  //             code.
+  //     }
+  //
+  // All properties except for `generatedLine` and `generatedColumn` can be
+  // `null`.
+  //
+  // `_generatedMappings` is ordered by the generated positions.
+  //
+  // `_originalMappings` is ordered by the original positions.
+  get _generatedMappings() {
+    if (!this.__generatedMappings) {
+      this._sortGeneratedMappings();
+    }
+
+    return this.__generatedMappings;
+  }
+
+  get _originalMappings() {
+    if (!this.__originalMappings) {
+      this._sortOriginalMappings();
+    }
+
+    return this.__originalMappings;
+  }
+
+  get _generatedMappingsUnsorted() {
+    if (!this.__generatedMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__generatedMappingsUnsorted;
+  }
+
+  get _originalMappingsUnsorted() {
+    if (!this.__originalMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__originalMappingsUnsorted;
+  }
+
+  _sortGeneratedMappings() {
+    const mappings = this._generatedMappingsUnsorted;
+    mappings.sort(util.compareByGeneratedPositionsDeflated);
+    this.__generatedMappings = mappings;
+  }
+
+  _sortOriginalMappings() {
+    const mappings = this._originalMappingsUnsorted;
+    mappings.sort(util.compareByOriginalPositions);
+    this.__originalMappings = mappings;
+  }
+
+  /**
+   * The list of original sources.
+   */
+  get sources() {
+    const sources = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      for (let j = 0; j < this._sections[i].consumer.sources.length; j++) {
+        sources.push(this._sections[i].consumer.sources[j]);
+      }
+    }
+    return sources;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    // Find the section containing the generated position we're trying to map
+    // to an original position.
+    const sectionIndex = binarySearch.search(needle, this._sections,
+      function(aNeedle, section) {
+        const cmp = aNeedle.generatedLine - section.generatedOffset.generatedLine;
+        if (cmp) {
+          return cmp;
+        }
+
+        return (aNeedle.generatedColumn -
+                section.generatedOffset.generatedColumn);
+      });
+    const section = this._sections[sectionIndex];
+
+    if (!section) {
+      return {
+        source: null,
+        line: null,
+        column: null,
+        name: null
+      };
+    }
+
+    return section.consumer.originalPositionFor({
+      line: needle.generatedLine -
+        (section.generatedOffset.generatedLine - 1),
+      column: needle.generatedColumn -
+        (section.generatedOffset.generatedLine === needle.generatedLine
+         ? section.generatedOffset.generatedColumn - 1
+         : 0),
+      bias: aArgs.bias
+    });
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    return this._sections.every(function(s) {
+      return s.consumer.hasContentsOfAllSources();
+    });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const content = section.consumer.sourceContentFor(aSource, true);
+      if (content) {
+        return content;
+      }
+    }
+    if (nullOnMissing) {
+      return null;
+    }
+    throw new Error('"' + aSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      // Only consider this section if the requested source is in the list of
+      // sources of the consumer.
+      if (section.consumer._findSourceIndex(util.getArg(aArgs, "source")) === -1) {
+        continue;
+      }
+      const generatedPosition = section.consumer.generatedPositionFor(aArgs);
+      if (generatedPosition) {
+        const ret = {
+          line: generatedPosition.line +
+            (section.generatedOffset.generatedLine - 1),
+          column: generatedPosition.column +
+            (section.generatedOffset.generatedLine === generatedPosition.line
+             ? section.generatedOffset.generatedColumn - 1
+             : 0)
+        };
+        return ret;
+      }
+    }
+
+    return {
+      line: null,
+      column: null
+    };
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const generatedMappings = this.__generatedMappingsUnsorted = [];
+    const originalMappings = this.__originalMappingsUnsorted = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const sectionMappings = [];
+      section.consumer.eachMapping(m => sectionMappings.push(m));
+
+      for (let j = 0; j < sectionMappings.length; j++) {
+        const mapping = sectionMappings[j];
+
+        // TODO: test if null is correct here.  The original code used
+        // `source`, which would actually have gotten used as null because
+        // var's get hoisted.
+        // See: https://github.com/mozilla/source-map/issues/333
+        let source = util.computeSourceURL(section.consumer.sourceRoot, null, this._sourceMapURL);
+        this._sources.add(source);
+        source = this._sources.indexOf(source);
+
+        let name = null;
+        if (mapping.name) {
+          this._names.add(mapping.name);
+          name = this._names.indexOf(mapping.name);
+        }
+
+        // The mappings coming from the consumer for the section have
+        // generated positions relative to the start of the section, so we
+        // need to offset them to be relative to the start of the concatenated
+        // generated file.
+        const adjustedMapping = {
+          source,
+          generatedLine: mapping.generatedLine +
+            (section.generatedOffset.generatedLine - 1),
+          generatedColumn: mapping.generatedColumn +
+            (section.generatedOffset.generatedLine === mapping.generatedLine
+            ? section.generatedOffset.generatedColumn - 1
+            : 0),
+          originalLine: mapping.originalLine,
+          originalColumn: mapping.originalColumn,
+          name
+        };
+
+        generatedMappings.push(adjustedMapping);
+        if (typeof adjustedMapping.originalLine === "number") {
+          originalMappings.push(adjustedMapping);
+        }
+      }
+    }
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+    let mappings;
+    switch (order) {
+    case SourceMapConsumer.GENERATED_ORDER:
+      mappings = this._generatedMappings;
+      break;
+    case SourceMapConsumer.ORIGINAL_ORDER:
+      mappings = this._originalMappings;
+      break;
+    default:
+      throw new Error("Unknown order of iteration.");
+    }
+
+    const sourceRoot = this.sourceRoot;
+    mappings.map(function(mapping) {
+      let source = null;
+      if (mapping.source !== null) {
+        source = this._sources.at(mapping.source);
+        source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+      }
+      return {
+        source,
+        generatedLine: mapping.generatedLine,
+        generatedColumn: mapping.generatedColumn,
+        originalLine: mapping.originalLine,
+        originalColumn: mapping.originalColumn,
+        name: mapping.name === null ? null : this._names.at(mapping.name)
+      };
+    }, this).forEach(aCallback, context);
+  }
+
+  /**
+   * Find the mapping that best matches the hypothetical "needle" mapping that
+   * we are searching for in the given "haystack" of mappings.
+   */
+  _findMapping(aNeedle, aMappings, aLineName,
+              aColumnName, aComparator, aBias) {
+    // To return the position we are searching for, we must first find the
+    // mapping for the given position and then return the opposite position it
+    // points to. Because the mappings are sorted, we can use binary search to
+    // find the best mapping.
+
+    if (aNeedle[aLineName] <= 0) {
+      throw new TypeError("Line must be greater than or equal to 1, got "
+                          + aNeedle[aLineName]);
+    }
+    if (aNeedle[aColumnName] < 0) {
+      throw new TypeError("Column must be greater than or equal to 0, got "
+                          + aNeedle[aColumnName]);
+    }
+
+    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    const line = util.getArg(aArgs, "line");
+
+    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+    // returns the index of the closest mapping less than the needle. By
+    // setting needle.originalColumn to 0, we thus find the last mapping for
+    // the given line, provided such a mapping exists.
+    const needle = {
+      source: util.getArg(aArgs, "source"),
+      originalLine: line,
+      originalColumn: util.getArg(aArgs, "column", 0)
+    };
+
+    needle.source = this._findSourceIndex(needle.source);
+    if (needle.source < 0) {
+      return [];
+    }
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    let index = this._findMapping(needle,
+                                  this._originalMappings,
+                                  "originalLine",
+                                  "originalColumn",
+                                  util.compareByOriginalPositions,
+                                  binarySearch.LEAST_UPPER_BOUND);
+    if (index >= 0) {
+      let mapping = this._originalMappings[index];
+
+      if (aArgs.column === undefined) {
+        const originalLine = mapping.originalLine;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we found. Since
+        // mappings are sorted, this is guaranteed to find all mappings for
+        // the line we found.
+        while (mapping && mapping.originalLine === originalLine) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      } else {
+        const originalColumn = mapping.originalColumn;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we were searching for.
+        // Since mappings are sorted, this is guaranteed to find all mappings for
+        // the line we are searching for.
+        while (mapping &&
+               mapping.originalLine === line &&
+               mapping.originalColumn == originalColumn) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      }
+    }
+
+    return mappings;
+  }
+
+  destroy() {
+    for (let i = 0; i < this._sections.length; i++) {
+      this._sections[i].consumer.destroy();
+    }
+  }
+}
+exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+/*
+ * Cheat to get around inter-twingled classes.  `factory()` can be at the end
+ * where it has access to non-hoisted classes, but it gets hoisted itself.
+ */
+function _factory(aSourceMap, aSourceMapURL) {
+  let sourceMap = aSourceMap;
+  if (typeof aSourceMap === "string") {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  const consumer = sourceMap.sections != null
+      ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+      : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+  return Promise.resolve(consumer);
+}
+
+function _factoryBSM(aSourceMap, aSourceMapURL) {
+  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-map-generator.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-map-generator.js
new file mode 100644
index 0000000..8111e06
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-map-generator.js
@@ -0,0 +1,413 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const base64VLQ = require("./base64-vlq");
+const util = require("./util");
+const ArraySet = require("./array-set").ArraySet;
+const MappingList = require("./mapping-list").MappingList;
+
+/**
+ * An instance of the SourceMapGenerator represents a source map which is
+ * being built incrementally. You may pass an object with the following
+ * properties:
+ *
+ *   - file: The filename of the generated source.
+ *   - sourceRoot: A root for all relative URLs in this source map.
+ */
+class SourceMapGenerator {
+  constructor(aArgs) {
+    if (!aArgs) {
+      aArgs = {};
+    }
+    this._file = util.getArg(aArgs, "file", null);
+    this._sourceRoot = util.getArg(aArgs, "sourceRoot", null);
+    this._skipValidation = util.getArg(aArgs, "skipValidation", false);
+    this._sources = new ArraySet();
+    this._names = new ArraySet();
+    this._mappings = new MappingList();
+    this._sourcesContents = null;
+  }
+
+  /**
+   * Creates a new SourceMapGenerator based on a SourceMapConsumer
+   *
+   * @param aSourceMapConsumer The SourceMap.
+   */
+  static fromSourceMap(aSourceMapConsumer) {
+    const sourceRoot = aSourceMapConsumer.sourceRoot;
+    const generator = new SourceMapGenerator({
+      file: aSourceMapConsumer.file,
+      sourceRoot
+    });
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      const newMapping = {
+        generated: {
+          line: mapping.generatedLine,
+          column: mapping.generatedColumn
+        }
+      };
+
+      if (mapping.source != null) {
+        newMapping.source = mapping.source;
+        if (sourceRoot != null) {
+          newMapping.source = util.relative(sourceRoot, newMapping.source);
+        }
+
+        newMapping.original = {
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        };
+
+        if (mapping.name != null) {
+          newMapping.name = mapping.name;
+        }
+      }
+
+      generator.addMapping(newMapping);
+    });
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      let sourceRelative = sourceFile;
+      if (sourceRoot !== null) {
+        sourceRelative = util.relative(sourceRoot, sourceFile);
+      }
+
+      if (!generator._sources.has(sourceRelative)) {
+        generator._sources.add(sourceRelative);
+      }
+
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        generator.setSourceContent(sourceFile, content);
+      }
+    });
+    return generator;
+  }
+
+  /**
+   * Add a single mapping from original source line and column to the generated
+   * source's line and column for this source map being created. The mapping
+   * object should have the following properties:
+   *
+   *   - generated: An object with the generated line and column positions.
+   *   - original: An object with the original line and column positions.
+   *   - source: The original source file (relative to the sourceRoot).
+   *   - name: An optional original token name for this mapping.
+   */
+  addMapping(aArgs) {
+    const generated = util.getArg(aArgs, "generated");
+    const original = util.getArg(aArgs, "original", null);
+    let source = util.getArg(aArgs, "source", null);
+    let name = util.getArg(aArgs, "name", null);
+
+    if (!this._skipValidation) {
+      this._validateMapping(generated, original, source, name);
+    }
+
+    if (source != null) {
+      source = String(source);
+      if (!this._sources.has(source)) {
+        this._sources.add(source);
+      }
+    }
+
+    if (name != null) {
+      name = String(name);
+      if (!this._names.has(name)) {
+        this._names.add(name);
+      }
+    }
+
+    this._mappings.add({
+      generatedLine: generated.line,
+      generatedColumn: generated.column,
+      originalLine: original != null && original.line,
+      originalColumn: original != null && original.column,
+      source,
+      name
+    });
+  }
+
+  /**
+   * Set the source content for a source file.
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    let source = aSourceFile;
+    if (this._sourceRoot != null) {
+      source = util.relative(this._sourceRoot, source);
+    }
+
+    if (aSourceContent != null) {
+      // Add the source content to the _sourcesContents map.
+      // Create a new _sourcesContents map if the property is null.
+      if (!this._sourcesContents) {
+        this._sourcesContents = Object.create(null);
+      }
+      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+    } else if (this._sourcesContents) {
+      // Remove the source file from the _sourcesContents map.
+      // If the _sourcesContents map is empty, set the property to null.
+      delete this._sourcesContents[util.toSetString(source)];
+      if (Object.keys(this._sourcesContents).length === 0) {
+        this._sourcesContents = null;
+      }
+    }
+  }
+
+  /**
+   * Applies the mappings of a sub-source-map for a specific source file to the
+   * source map being generated. Each mapping to the supplied source file is
+   * rewritten using the supplied source map. Note: The resolution for the
+   * resulting mappings is the minimium of this map and the supplied map.
+   *
+   * @param aSourceMapConsumer The source map to be applied.
+   * @param aSourceFile Optional. The filename of the source file.
+   *        If omitted, SourceMapConsumer's file property will be used.
+   * @param aSourceMapPath Optional. The dirname of the path to the source map
+   *        to be applied. If relative, it is relative to the SourceMapConsumer.
+   *        This parameter is needed when the two source maps aren't in the same
+   *        directory, and the source map to be applied contains relative source
+   *        paths. If so, those relative source paths need to be rewritten
+   *        relative to the SourceMapGenerator.
+   */
+  applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+    let sourceFile = aSourceFile;
+    // If aSourceFile is omitted, we will use the file property of the SourceMap
+    if (aSourceFile == null) {
+      if (aSourceMapConsumer.file == null) {
+        throw new Error(
+          "SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, " +
+          'or the source map\'s "file" property. Both were omitted.'
+        );
+      }
+      sourceFile = aSourceMapConsumer.file;
+    }
+    const sourceRoot = this._sourceRoot;
+    // Make "sourceFile" relative if an absolute Url is passed.
+    if (sourceRoot != null) {
+      sourceFile = util.relative(sourceRoot, sourceFile);
+    }
+    // Applying the SourceMap can add and remove items from the sources and
+    // the names array.
+    const newSources = this._mappings.toArray().length > 0
+      ? new ArraySet()
+      : this._sources;
+    const newNames = new ArraySet();
+
+    // Find mappings for the "sourceFile"
+    this._mappings.unsortedForEach(function(mapping) {
+      if (mapping.source === sourceFile && mapping.originalLine != null) {
+        // Check if it can be mapped by the source map, then update the mapping.
+        const original = aSourceMapConsumer.originalPositionFor({
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        });
+        if (original.source != null) {
+          // Copy mapping
+          mapping.source = original.source;
+          if (aSourceMapPath != null) {
+            mapping.source = util.join(aSourceMapPath, mapping.source);
+          }
+          if (sourceRoot != null) {
+            mapping.source = util.relative(sourceRoot, mapping.source);
+          }
+          mapping.originalLine = original.line;
+          mapping.originalColumn = original.column;
+          if (original.name != null) {
+            mapping.name = original.name;
+          }
+        }
+      }
+
+      const source = mapping.source;
+      if (source != null && !newSources.has(source)) {
+        newSources.add(source);
+      }
+
+      const name = mapping.name;
+      if (name != null && !newNames.has(name)) {
+        newNames.add(name);
+      }
+
+    }, this);
+    this._sources = newSources;
+    this._names = newNames;
+
+    // Copy sourcesContents of applied map.
+    aSourceMapConsumer.sources.forEach(function(srcFile) {
+      const content = aSourceMapConsumer.sourceContentFor(srcFile);
+      if (content != null) {
+        if (aSourceMapPath != null) {
+          srcFile = util.join(aSourceMapPath, srcFile);
+        }
+        if (sourceRoot != null) {
+          srcFile = util.relative(sourceRoot, srcFile);
+        }
+        this.setSourceContent(srcFile, content);
+      }
+    }, this);
+  }
+
+  /**
+   * A mapping can have one of the three levels of data:
+   *
+   *   1. Just the generated position.
+   *   2. The Generated position, original position, and original source.
+   *   3. Generated and original position, original source, as well as a name
+   *      token.
+   *
+   * To maintain consistency, we validate that any new mapping being added falls
+   * in to one of these categories.
+   */
+  _validateMapping(aGenerated, aOriginal, aSource, aName) {
+    // When aOriginal is truthy but has empty values for .line and .column,
+    // it is most likely a programmer error. In this case we throw a very
+    // specific error message to try to guide them the right way.
+    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+    if (aOriginal && typeof aOriginal.line !== "number" && typeof aOriginal.column !== "number") {
+        throw new Error(
+            "original.line and original.column are not numbers -- you probably meant to omit " +
+            "the original mapping entirely and only map the generated position. If so, pass " +
+            "null for the original mapping instead of an object with empty or null values."
+        );
+    }
+
+    if (aGenerated && "line" in aGenerated && "column" in aGenerated
+        && aGenerated.line > 0 && aGenerated.column >= 0
+        && !aOriginal && !aSource && !aName) {
+      // Case 1.
+
+    } else if (aGenerated && "line" in aGenerated && "column" in aGenerated
+             && aOriginal && "line" in aOriginal && "column" in aOriginal
+             && aGenerated.line > 0 && aGenerated.column >= 0
+             && aOriginal.line > 0 && aOriginal.column >= 0
+             && aSource) {
+      // Cases 2 and 3.
+
+    } else {
+      throw new Error("Invalid mapping: " + JSON.stringify({
+        generated: aGenerated,
+        source: aSource,
+        original: aOriginal,
+        name: aName
+      }));
+    }
+  }
+
+  /**
+   * Serialize the accumulated mappings in to the stream of base 64 VLQs
+   * specified by the source map format.
+   */
+  _serializeMappings() {
+    let previousGeneratedColumn = 0;
+    let previousGeneratedLine = 1;
+    let previousOriginalColumn = 0;
+    let previousOriginalLine = 0;
+    let previousName = 0;
+    let previousSource = 0;
+    let result = "";
+    let next;
+    let mapping;
+    let nameIdx;
+    let sourceIdx;
+
+    const mappings = this._mappings.toArray();
+    for (let i = 0, len = mappings.length; i < len; i++) {
+      mapping = mappings[i];
+      next = "";
+
+      if (mapping.generatedLine !== previousGeneratedLine) {
+        previousGeneratedColumn = 0;
+        while (mapping.generatedLine !== previousGeneratedLine) {
+          next += ";";
+          previousGeneratedLine++;
+        }
+      } else if (i > 0) {
+        if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+          continue;
+        }
+        next += ",";
+      }
+
+      next += base64VLQ.encode(mapping.generatedColumn
+                                 - previousGeneratedColumn);
+      previousGeneratedColumn = mapping.generatedColumn;
+
+      if (mapping.source != null) {
+        sourceIdx = this._sources.indexOf(mapping.source);
+        next += base64VLQ.encode(sourceIdx - previousSource);
+        previousSource = sourceIdx;
+
+        // lines are stored 0-based in SourceMap spec version 3
+        next += base64VLQ.encode(mapping.originalLine - 1
+                                   - previousOriginalLine);
+        previousOriginalLine = mapping.originalLine - 1;
+
+        next += base64VLQ.encode(mapping.originalColumn
+                                   - previousOriginalColumn);
+        previousOriginalColumn = mapping.originalColumn;
+
+        if (mapping.name != null) {
+          nameIdx = this._names.indexOf(mapping.name);
+          next += base64VLQ.encode(nameIdx - previousName);
+          previousName = nameIdx;
+        }
+      }
+
+      result += next;
+    }
+
+    return result;
+  }
+
+  _generateSourcesContent(aSources, aSourceRoot) {
+    return aSources.map(function(source) {
+      if (!this._sourcesContents) {
+        return null;
+      }
+      if (aSourceRoot != null) {
+        source = util.relative(aSourceRoot, source);
+      }
+      const key = util.toSetString(source);
+      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+        ? this._sourcesContents[key]
+        : null;
+    }, this);
+  }
+
+  /**
+   * Externalize the source map.
+   */
+  toJSON() {
+    const map = {
+      version: this._version,
+      sources: this._sources.toArray(),
+      names: this._names.toArray(),
+      mappings: this._serializeMappings()
+    };
+    if (this._file != null) {
+      map.file = this._file;
+    }
+    if (this._sourceRoot != null) {
+      map.sourceRoot = this._sourceRoot;
+    }
+    if (this._sourcesContents) {
+      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+    }
+
+    return map;
+  }
+
+  /**
+   * Render the source map being generated to a string.
+   */
+  toString() {
+    return JSON.stringify(this.toJSON());
+  }
+}
+
+SourceMapGenerator.prototype._version = 3;
+exports.SourceMapGenerator = SourceMapGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-node.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-node.js
new file mode 100644
index 0000000..8a7a157
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/source-node.js
@@ -0,0 +1,404 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const SourceMapGenerator = require("./source-map-generator").SourceMapGenerator;
+const util = require("./util");
+
+// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+// operating systems these days (capturing the result).
+const REGEX_NEWLINE = /(\r?\n)/;
+
+// Newline character code for charCodeAt() comparisons
+const NEWLINE_CODE = 10;
+
+// Private symbol for identifying `SourceNode`s when multiple versions of
+// the source-map library are loaded. This MUST NOT CHANGE across
+// versions!
+const isSourceNode = "$$$isSourceNode$$$";
+
+/**
+ * SourceNodes provide a way to abstract over interpolating/concatenating
+ * snippets of generated JavaScript source code while maintaining the line and
+ * column information associated with the original source code.
+ *
+ * @param aLine The original line number.
+ * @param aColumn The original column number.
+ * @param aSource The original source's filename.
+ * @param aChunks Optional. An array of strings which are snippets of
+ *        generated JS, or other SourceNodes.
+ * @param aName The original identifier.
+ */
+class SourceNode {
+  constructor(aLine, aColumn, aSource, aChunks, aName) {
+    this.children = [];
+    this.sourceContents = {};
+    this.line = aLine == null ? null : aLine;
+    this.column = aColumn == null ? null : aColumn;
+    this.source = aSource == null ? null : aSource;
+    this.name = aName == null ? null : aName;
+    this[isSourceNode] = true;
+    if (aChunks != null) this.add(aChunks);
+  }
+
+  /**
+   * Creates a SourceNode from generated code and a SourceMapConsumer.
+   *
+   * @param aGeneratedCode The generated code
+   * @param aSourceMapConsumer The SourceMap for the generated code
+   * @param aRelativePath Optional. The path that relative sources in the
+   *        SourceMapConsumer should be relative to.
+   */
+  static fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+    // The SourceNode we want to fill with the generated code
+    // and the SourceMap
+    const node = new SourceNode();
+
+    // All even indices of this array are one line of the generated code,
+    // while all odd indices are the newlines between two adjacent lines
+    // (since `REGEX_NEWLINE` captures its match).
+    // Processed fragments are accessed by calling `shiftNextLine`.
+    const remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+    let remainingLinesIndex = 0;
+    const shiftNextLine = function() {
+      const lineContents = getNextLine();
+      // The last line of a file might not have a newline.
+      const newLine = getNextLine() || "";
+      return lineContents + newLine;
+
+      function getNextLine() {
+        return remainingLinesIndex < remainingLines.length ?
+            remainingLines[remainingLinesIndex++] : undefined;
+      }
+    };
+
+    // We need to remember the position of "remainingLines"
+    let lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+    // The generate SourceNodes we need a code range.
+    // To extract it current and last mapping is used.
+    // Here we store the last mapping.
+    let lastMapping = null;
+    let nextLine;
+
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      if (lastMapping !== null) {
+        // We add the code from "lastMapping" to "mapping":
+        // First check if there is a new line in between.
+        if (lastGeneratedLine < mapping.generatedLine) {
+          // Associate first line with "lastMapping"
+          addMappingWithCode(lastMapping, shiftNextLine());
+          lastGeneratedLine++;
+          lastGeneratedColumn = 0;
+          // The remaining code is added without mapping
+        } else {
+          // There is no new line in between.
+          // Associate the code between "lastGeneratedColumn" and
+          // "mapping.generatedColumn" with "lastMapping"
+          nextLine = remainingLines[remainingLinesIndex] || "";
+          const code = nextLine.substr(0, mapping.generatedColumn -
+                                        lastGeneratedColumn);
+          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+                                              lastGeneratedColumn);
+          lastGeneratedColumn = mapping.generatedColumn;
+          addMappingWithCode(lastMapping, code);
+          // No more remaining code, continue
+          lastMapping = mapping;
+          return;
+        }
+      }
+      // We add the generated code until the first mapping
+      // to the SourceNode without any mapping.
+      // Each line is added as separate string.
+      while (lastGeneratedLine < mapping.generatedLine) {
+        node.add(shiftNextLine());
+        lastGeneratedLine++;
+      }
+      if (lastGeneratedColumn < mapping.generatedColumn) {
+        nextLine = remainingLines[remainingLinesIndex] || "";
+        node.add(nextLine.substr(0, mapping.generatedColumn));
+        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+        lastGeneratedColumn = mapping.generatedColumn;
+      }
+      lastMapping = mapping;
+    }, this);
+    // We have processed all mappings.
+    if (remainingLinesIndex < remainingLines.length) {
+      if (lastMapping) {
+        // Associate the remaining code in the current line with "lastMapping"
+        addMappingWithCode(lastMapping, shiftNextLine());
+      }
+      // and add the remaining lines without any mapping
+      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+    }
+
+    // Copy sourcesContent into SourceNode
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aRelativePath != null) {
+          sourceFile = util.join(aRelativePath, sourceFile);
+        }
+        node.setSourceContent(sourceFile, content);
+      }
+    });
+
+    return node;
+
+    function addMappingWithCode(mapping, code) {
+      if (mapping === null || mapping.source === undefined) {
+        node.add(code);
+      } else {
+        const source = aRelativePath
+          ? util.join(aRelativePath, mapping.source)
+          : mapping.source;
+        node.add(new SourceNode(mapping.originalLine,
+                                mapping.originalColumn,
+                                source,
+                                code,
+                                mapping.name));
+      }
+    }
+  }
+
+  /**
+   * Add a chunk of generated JS to this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  add(aChunk) {
+    if (Array.isArray(aChunk)) {
+      aChunk.forEach(function(chunk) {
+        this.add(chunk);
+      }, this);
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      if (aChunk) {
+        this.children.push(aChunk);
+      }
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Add a chunk of generated JS to the beginning of this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  prepend(aChunk) {
+    if (Array.isArray(aChunk)) {
+      for (let i = aChunk.length - 1; i >= 0; i--) {
+        this.prepend(aChunk[i]);
+      }
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      this.children.unshift(aChunk);
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Walk over the tree of JS snippets in this node and its children. The
+   * walking function is called once for each snippet of JS and is passed that
+   * snippet and the its original associated source's line/column location.
+   *
+   * @param aFn The traversal function.
+   */
+  walk(aFn) {
+    let chunk;
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      chunk = this.children[i];
+      if (chunk[isSourceNode]) {
+        chunk.walk(aFn);
+      } else if (chunk !== "") {
+        aFn(chunk, { source: this.source,
+                      line: this.line,
+                      column: this.column,
+                      name: this.name });
+      }
+    }
+  }
+
+  /**
+   * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+   * each of `this.children`.
+   *
+   * @param aSep The separator.
+   */
+  join(aSep) {
+    let newChildren;
+    let i;
+    const len = this.children.length;
+    if (len > 0) {
+      newChildren = [];
+      for (i = 0; i < len - 1; i++) {
+        newChildren.push(this.children[i]);
+        newChildren.push(aSep);
+      }
+      newChildren.push(this.children[i]);
+      this.children = newChildren;
+    }
+    return this;
+  }
+
+  /**
+   * Call String.prototype.replace on the very right-most source snippet. Useful
+   * for trimming whitespace from the end of a source node, etc.
+   *
+   * @param aPattern The pattern to replace.
+   * @param aReplacement The thing to replace the pattern with.
+   */
+  replaceRight(aPattern, aReplacement) {
+    const lastChild = this.children[this.children.length - 1];
+    if (lastChild[isSourceNode]) {
+      lastChild.replaceRight(aPattern, aReplacement);
+    } else if (typeof lastChild === "string") {
+      this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+    } else {
+      this.children.push("".replace(aPattern, aReplacement));
+    }
+    return this;
+  }
+
+  /**
+   * Set the source content for a source file. This will be added to the SourceMapGenerator
+   * in the sourcesContent field.
+   *
+   * @param aSourceFile The filename of the source file
+   * @param aSourceContent The content of the source file
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+  }
+
+  /**
+   * Walk over the tree of SourceNodes. The walking function is called for each
+   * source file content and is passed the filename and source content.
+   *
+   * @param aFn The traversal function.
+   */
+  walkSourceContents(aFn) {
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      if (this.children[i][isSourceNode]) {
+        this.children[i].walkSourceContents(aFn);
+      }
+    }
+
+    const sources = Object.keys(this.sourceContents);
+    for (let i = 0, len = sources.length; i < len; i++) {
+      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+    }
+  }
+
+  /**
+   * Return the string representation of this source node. Walks over the tree
+   * and concatenates all the various snippets together to one string.
+   */
+  toString() {
+    let str = "";
+    this.walk(function(chunk) {
+      str += chunk;
+    });
+    return str;
+  }
+
+  /**
+   * Returns the string representation of this source node along with a source
+   * map.
+   */
+  toStringWithSourceMap(aArgs) {
+    const generated = {
+      code: "",
+      line: 1,
+      column: 0
+    };
+    const map = new SourceMapGenerator(aArgs);
+    let sourceMappingActive = false;
+    let lastOriginalSource = null;
+    let lastOriginalLine = null;
+    let lastOriginalColumn = null;
+    let lastOriginalName = null;
+    this.walk(function(chunk, original) {
+      generated.code += chunk;
+      if (original.source !== null
+          && original.line !== null
+          && original.column !== null) {
+        if (lastOriginalSource !== original.source
+          || lastOriginalLine !== original.line
+          || lastOriginalColumn !== original.column
+          || lastOriginalName !== original.name) {
+          map.addMapping({
+            source: original.source,
+            original: {
+              line: original.line,
+              column: original.column
+            },
+            generated: {
+              line: generated.line,
+              column: generated.column
+            },
+            name: original.name
+          });
+        }
+        lastOriginalSource = original.source;
+        lastOriginalLine = original.line;
+        lastOriginalColumn = original.column;
+        lastOriginalName = original.name;
+        sourceMappingActive = true;
+      } else if (sourceMappingActive) {
+        map.addMapping({
+          generated: {
+            line: generated.line,
+            column: generated.column
+          }
+        });
+        lastOriginalSource = null;
+        sourceMappingActive = false;
+      }
+      for (let idx = 0, length = chunk.length; idx < length; idx++) {
+        if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+          generated.line++;
+          generated.column = 0;
+          // Mappings end at eol
+          if (idx + 1 === length) {
+            lastOriginalSource = null;
+            sourceMappingActive = false;
+          } else if (sourceMappingActive) {
+            map.addMapping({
+              source: original.source,
+              original: {
+                line: original.line,
+                column: original.column
+              },
+              generated: {
+                line: generated.line,
+                column: generated.column
+              },
+              name: original.name
+            });
+          }
+        } else {
+          generated.column++;
+        }
+      }
+    });
+    this.walkSourceContents(function(sourceFile, sourceContent) {
+      map.setSourceContent(sourceFile, sourceContent);
+    });
+
+    return { code: generated.code, map };
+  }
+}
+
+exports.SourceNode = SourceNode;
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/util.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/util.js
new file mode 100644
index 0000000..35bd93d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/util.js
@@ -0,0 +1,546 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * This is a helper function for getting values from parameter/options
+ * objects.
+ *
+ * @param args The object we are extracting values from
+ * @param name The name of the property we are getting.
+ * @param defaultValue An optional value to return if the property is missing
+ * from the object. If this is not specified and the property is missing, an
+ * error will be thrown.
+ */
+function getArg(aArgs, aName, aDefaultValue) {
+  if (aName in aArgs) {
+    return aArgs[aName];
+  } else if (arguments.length === 3) {
+    return aDefaultValue;
+  }
+    throw new Error('"' + aName + '" is a required argument.');
+
+}
+exports.getArg = getArg;
+
+const urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+const dataUrlRegexp = /^data:.+\,.+$/;
+
+function urlParse(aUrl) {
+  const match = aUrl.match(urlRegexp);
+  if (!match) {
+    return null;
+  }
+  return {
+    scheme: match[1],
+    auth: match[2],
+    host: match[3],
+    port: match[4],
+    path: match[5]
+  };
+}
+exports.urlParse = urlParse;
+
+function urlGenerate(aParsedUrl) {
+  let url = "";
+  if (aParsedUrl.scheme) {
+    url += aParsedUrl.scheme + ":";
+  }
+  url += "//";
+  if (aParsedUrl.auth) {
+    url += aParsedUrl.auth + "@";
+  }
+  if (aParsedUrl.host) {
+    url += aParsedUrl.host;
+  }
+  if (aParsedUrl.port) {
+    url += ":" + aParsedUrl.port;
+  }
+  if (aParsedUrl.path) {
+    url += aParsedUrl.path;
+  }
+  return url;
+}
+exports.urlGenerate = urlGenerate;
+
+const MAX_CACHED_INPUTS = 32;
+
+/**
+ * Takes some function `f(input) -> result` and returns a memoized version of
+ * `f`.
+ *
+ * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+ * memoization is a dumb-simple, linear least-recently-used cache.
+ */
+function lruMemoize(f) {
+  const cache = [];
+
+  return function(input) {
+    for (let i = 0; i < cache.length; i++) {
+      if (cache[i].input === input) {
+        const temp = cache[0];
+        cache[0] = cache[i];
+        cache[i] = temp;
+        return cache[0].result;
+      }
+    }
+
+    const result = f(input);
+
+    cache.unshift({
+      input,
+      result,
+    });
+
+    if (cache.length > MAX_CACHED_INPUTS) {
+      cache.pop();
+    }
+
+    return result;
+  };
+}
+
+/**
+ * Normalizes a path, or the path portion of a URL:
+ *
+ * - Replaces consecutive slashes with one slash.
+ * - Removes unnecessary '.' parts.
+ * - Removes unnecessary '<dir>/..' parts.
+ *
+ * Based on code in the Node.js 'path' core module.
+ *
+ * @param aPath The path or url to normalize.
+ */
+const normalize = lruMemoize(function normalize(aPath) {
+  let path = aPath;
+  const url = urlParse(aPath);
+  if (url) {
+    if (!url.path) {
+      return aPath;
+    }
+    path = url.path;
+  }
+  const isAbsolute = exports.isAbsolute(path);
+
+  // Split the path into parts between `/` characters. This is much faster than
+  // using `.split(/\/+/g)`.
+  const parts = [];
+  let start = 0;
+  let i = 0;
+  while (true) {
+    start = i;
+    i = path.indexOf("/", start);
+    if (i === -1) {
+      parts.push(path.slice(start));
+      break;
+    } else {
+      parts.push(path.slice(start, i));
+      while (i < path.length && path[i] === "/") {
+        i++;
+      }
+    }
+  }
+
+  let up = 0;
+  for (i = parts.length - 1; i >= 0; i--) {
+    const part = parts[i];
+    if (part === ".") {
+      parts.splice(i, 1);
+    } else if (part === "..") {
+      up++;
+    } else if (up > 0) {
+      if (part === "") {
+        // The first part is blank if the path is absolute. Trying to go
+        // above the root is a no-op. Therefore we can remove all '..' parts
+        // directly after the root.
+        parts.splice(i + 1, up);
+        up = 0;
+      } else {
+        parts.splice(i, 2);
+        up--;
+      }
+    }
+  }
+  path = parts.join("/");
+
+  if (path === "") {
+    path = isAbsolute ? "/" : ".";
+  }
+
+  if (url) {
+    url.path = path;
+    return urlGenerate(url);
+  }
+  return path;
+});
+exports.normalize = normalize;
+
+/**
+ * Joins two paths/URLs.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be joined with the root.
+ *
+ * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+ *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+ *   first.
+ * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+ *   is updated with the result and aRoot is returned. Otherwise the result
+ *   is returned.
+ *   - If aPath is absolute, the result is aPath.
+ *   - Otherwise the two paths are joined with a slash.
+ * - Joining for example 'http://' and 'www.example.com' is also supported.
+ */
+function join(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+  if (aPath === "") {
+    aPath = ".";
+  }
+  const aPathUrl = urlParse(aPath);
+  const aRootUrl = urlParse(aRoot);
+  if (aRootUrl) {
+    aRoot = aRootUrl.path || "/";
+  }
+
+  // `join(foo, '//www.example.org')`
+  if (aPathUrl && !aPathUrl.scheme) {
+    if (aRootUrl) {
+      aPathUrl.scheme = aRootUrl.scheme;
+    }
+    return urlGenerate(aPathUrl);
+  }
+
+  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+    return aPath;
+  }
+
+  // `join('http://', 'www.example.com')`
+  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+    aRootUrl.host = aPath;
+    return urlGenerate(aRootUrl);
+  }
+
+  const joined = aPath.charAt(0) === "/"
+    ? aPath
+    : normalize(aRoot.replace(/\/+$/, "") + "/" + aPath);
+
+  if (aRootUrl) {
+    aRootUrl.path = joined;
+    return urlGenerate(aRootUrl);
+  }
+  return joined;
+}
+exports.join = join;
+
+exports.isAbsolute = function(aPath) {
+  return aPath.charAt(0) === "/" || urlRegexp.test(aPath);
+};
+
+/**
+ * Make a path relative to a URL or another path.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be made relative to aRoot.
+ */
+function relative(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+
+  aRoot = aRoot.replace(/\/$/, "");
+
+  // It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  let level = 0;
+  while (aPath.indexOf(aRoot + "/") !== 0) {
+    const index = aRoot.lastIndexOf("/");
+    if (index < 0) {
+      return aPath;
+    }
+
+    // If the only part of the root that is left is the scheme (i.e. http://,
+    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+    // have exhausted all components, so the path is not relative to the root.
+    aRoot = aRoot.slice(0, index);
+    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+      return aPath;
+    }
+
+    ++level;
+  }
+
+  // Make sure we add a "../" for each component we removed from the root.
+  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+}
+exports.relative = relative;
+
+const supportsNullProto = (function() {
+  const obj = Object.create(null);
+  return !("__proto__" in obj);
+}());
+
+function identity(s) {
+  return s;
+}
+
+/**
+ * Because behavior goes wacky when you set `__proto__` on objects, we
+ * have to prefix all the strings in our set with an arbitrary character.
+ *
+ * See https://github.com/mozilla/source-map/pull/31 and
+ * https://github.com/mozilla/source-map/issues/30
+ *
+ * @param String aStr
+ */
+function toSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return "$" + aStr;
+  }
+
+  return aStr;
+}
+exports.toSetString = supportsNullProto ? identity : toSetString;
+
+function fromSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return aStr.slice(1);
+  }
+
+  return aStr;
+}
+exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+function isProtoString(s) {
+  if (!s) {
+    return false;
+  }
+
+  const length = s.length;
+
+  if (length < 9 /* "__proto__".length */) {
+    return false;
+  }
+
+  /* eslint-disable no-multi-spaces */
+  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+    return false;
+  }
+  /* eslint-enable no-multi-spaces */
+
+  for (let i = length - 10; i >= 0; i--) {
+    if (s.charCodeAt(i) !== 36 /* '$' */) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+/**
+ * Comparator between two mappings where the original positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same original source/line/column, but different generated
+ * line and column the same. Useful when searching for a mapping with a
+ * stubbed out mapping.
+ */
+function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+  let cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositions = compareByOriginalPositions;
+
+/**
+ * Comparator between two mappings with deflated source and name indices where
+ * the generated positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same generated line and column, but different
+ * source/name/original line and column the same. Useful when searching for a
+ * mapping with a stubbed out mapping.
+ */
+function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+function strcmp(aStr1, aStr2) {
+  if (aStr1 === aStr2) {
+    return 0;
+  }
+
+  if (aStr1 === null) {
+    return 1; // aStr2 !== null
+  }
+
+  if (aStr2 === null) {
+    return -1; // aStr1 !== null
+  }
+
+  if (aStr1 > aStr2) {
+    return 1;
+  }
+
+  return -1;
+}
+
+/**
+ * Comparator between two mappings with inflated source and name strings where
+ * the generated positions are compared.
+ */
+function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+/**
+ * Strip any JSON XSSI avoidance prefix from the string (as documented
+ * in the source maps specification), and then parse the string as
+ * JSON.
+ */
+function parseSourceMapInput(str) {
+  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ""));
+}
+exports.parseSourceMapInput = parseSourceMapInput;
+
+/**
+ * Compute the URL of a source given the the source root, the source's
+ * URL, and the source map's URL.
+ */
+function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+  sourceURL = sourceURL || "";
+
+  if (sourceRoot) {
+    // This follows what Chrome does.
+    if (sourceRoot[sourceRoot.length - 1] !== "/" && sourceURL[0] !== "/") {
+      sourceRoot += "/";
+    }
+    // The spec says:
+    //   Line 4: An optional source root, useful for relocating source
+    //   files on a server or removing repeated values in the
+    //   “sources” entry.  This value is prepended to the individual
+    //   entries in the “source” field.
+    sourceURL = sourceRoot + sourceURL;
+  }
+
+  // Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if (sourceMapURL) {
+    const parsed = urlParse(sourceMapURL);
+    if (!parsed) {
+      throw new Error("sourceMapURL could not be parsed");
+    }
+    if (parsed.path) {
+      // Strip the last path component, but keep the "/".
+      const index = parsed.path.lastIndexOf("/");
+      if (index >= 0) {
+        parsed.path = parsed.path.substring(0, index + 1);
+      }
+    }
+    sourceURL = join(urlGenerate(parsed), sourceURL);
+  }
+
+  return normalize(sourceURL);
+}
+exports.computeSourceURL = computeSourceURL;
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/wasm.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/wasm.js
new file mode 100644
index 0000000..88b18be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/lib/wasm.js
@@ -0,0 +1,107 @@
+const readWasm = require("../lib/read-wasm");
+
+/**
+ * Provide the JIT with a nice shape / hidden class.
+ */
+function Mapping() {
+  this.generatedLine = 0;
+  this.generatedColumn = 0;
+  this.lastGeneratedColumn = null;
+  this.source = null;
+  this.originalLine = null;
+  this.originalColumn = null;
+  this.name = null;
+}
+
+let cachedWasm = null;
+
+module.exports = function wasm() {
+  if (cachedWasm) {
+    return cachedWasm;
+  }
+
+  const callbackStack = [];
+
+  cachedWasm = readWasm().then(buffer => {
+      return WebAssembly.instantiate(buffer, {
+        env: {
+          mapping_callback(
+            generatedLine,
+            generatedColumn,
+
+            hasLastGeneratedColumn,
+            lastGeneratedColumn,
+
+            hasOriginal,
+            source,
+            originalLine,
+            originalColumn,
+
+            hasName,
+            name
+          ) {
+            const mapping = new Mapping();
+            // JS uses 1-based line numbers, wasm uses 0-based.
+            mapping.generatedLine = generatedLine + 1;
+            mapping.generatedColumn = generatedColumn;
+
+            if (hasLastGeneratedColumn) {
+              // JS uses inclusive last generated column, wasm uses exclusive.
+              mapping.lastGeneratedColumn = lastGeneratedColumn - 1;
+            }
+
+            if (hasOriginal) {
+              mapping.source = source;
+              // JS uses 1-based line numbers, wasm uses 0-based.
+              mapping.originalLine = originalLine + 1;
+              mapping.originalColumn = originalColumn;
+
+              if (hasName) {
+                mapping.name = name;
+              }
+            }
+
+            callbackStack[callbackStack.length - 1](mapping);
+          },
+
+          start_all_generated_locations_for() { console.time("all_generated_locations_for"); },
+          end_all_generated_locations_for() { console.timeEnd("all_generated_locations_for"); },
+
+          start_compute_column_spans() { console.time("compute_column_spans"); },
+          end_compute_column_spans() { console.timeEnd("compute_column_spans"); },
+
+          start_generated_location_for() { console.time("generated_location_for"); },
+          end_generated_location_for() { console.timeEnd("generated_location_for"); },
+
+          start_original_location_for() { console.time("original_location_for"); },
+          end_original_location_for() { console.timeEnd("original_location_for"); },
+
+          start_parse_mappings() { console.time("parse_mappings"); },
+          end_parse_mappings() { console.timeEnd("parse_mappings"); },
+
+          start_sort_by_generated_location() { console.time("sort_by_generated_location"); },
+          end_sort_by_generated_location() { console.timeEnd("sort_by_generated_location"); },
+
+          start_sort_by_original_location() { console.time("sort_by_original_location"); },
+          end_sort_by_original_location() { console.timeEnd("sort_by_original_location"); },
+        }
+      });
+  }).then(Wasm => {
+    return {
+      exports: Wasm.instance.exports,
+      withMappingCallback: (mappingCallback, f) => {
+        callbackStack.push(mappingCallback);
+        try {
+          f();
+        } finally {
+          callbackStack.pop();
+        }
+      }
+    };
+  }).then(null, e => {
+    cachedWasm = null;
+    throw e;
+  });
+
+  return cachedWasm;
+};
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/package.json b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/package.json
new file mode 100644
index 0000000..35476da
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/package.json
@@ -0,0 +1,90 @@
+{
+  "name": "source-map",
+  "description": "Generates and consumes source maps",
+  "version": "0.7.3",
+  "homepage": "https://github.com/mozilla/source-map",
+  "author": "Nick Fitzgerald <nfitzgerald@mozilla.com>",
+  "contributors": [
+    "Tobias Koppers <tobias.koppers@googlemail.com>",
+    "Duncan Beevers <duncan@dweebd.com>",
+    "Stephen Crane <scrane@mozilla.com>",
+    "Ryan Seddon <seddon.ryan@gmail.com>",
+    "Miles Elam <miles.elam@deem.com>",
+    "Mihai Bazon <mihai.bazon@gmail.com>",
+    "Michael Ficarra <github.public.email@michael.ficarra.me>",
+    "Todd Wolfson <todd@twolfson.com>",
+    "Alexander Solovyov <alexander@solovyov.net>",
+    "Felix Gnass <fgnass@gmail.com>",
+    "Conrad Irwin <conrad.irwin@gmail.com>",
+    "usrbincc <usrbincc@yahoo.com>",
+    "David Glasser <glasser@davidglasser.net>",
+    "Chase Douglas <chase@newrelic.com>",
+    "Evan Wallace <evan.exe@gmail.com>",
+    "Heather Arthur <fayearthur@gmail.com>",
+    "Hugh Kennedy <hughskennedy@gmail.com>",
+    "David Glasser <glasser@davidglasser.net>",
+    "Simon Lydell <simon.lydell@gmail.com>",
+    "Jmeas Smith <jellyes2@gmail.com>",
+    "Michael Z Goddard <mzgoddard@gmail.com>",
+    "azu <azu@users.noreply.github.com>",
+    "John Gozde <john@gozde.ca>",
+    "Adam Kirkton <akirkton@truefitinnovation.com>",
+    "Chris Montgomery <christopher.montgomery@dowjones.com>",
+    "J. Ryan Stinnett <jryans@gmail.com>",
+    "Jack Herrington <jherrington@walmartlabs.com>",
+    "Chris Truter <jeffpalentine@gmail.com>",
+    "Daniel Espeset <daniel@danielespeset.com>",
+    "Jamie Wong <jamie.lf.wong@gmail.com>",
+    "Eddy Bruël <ejpbruel@mozilla.com>",
+    "Hawken Rives <hawkrives@gmail.com>",
+    "Gilad Peleg <giladp007@gmail.com>",
+    "djchie <djchie.dev@gmail.com>",
+    "Gary Ye <garysye@gmail.com>",
+    "Nicolas Lalevée <nicolas.lalevee@hibnet.org>"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/mozilla/source-map.git"
+  },
+  "main": "./source-map.js",
+  "types": "./source-map.d.ts",
+  "files": [
+    "source-map.js",
+    "source-map.d.ts",
+    "lib/",
+    "dist/source-map.js"
+  ],
+  "engines": {
+    "node": ">= 8"
+  },
+  "license": "BSD-3-Clause",
+  "scripts": {
+    "lint": "eslint *.js lib/ test/",
+    "prebuild": "npm run lint",
+    "build": "webpack --color",
+    "pretest": "npm run build",
+    "test": "node test/run-tests.js",
+    "precoverage": "npm run build",
+    "coverage": "nyc node test/run-tests.js",
+    "setup": "mkdir -p coverage && cp -n .waiting.html coverage/index.html || true",
+    "dev:live": "live-server --port=4103 --ignorePattern='(js|css|png)$' coverage",
+    "dev:watch": "watch 'npm run coverage' lib/ test/",
+    "predev": "npm run setup",
+    "dev": "npm-run-all -p --silent dev:*",
+    "clean": "rm -rf coverage .nyc_output",
+    "toc": "doctoc --title '## Table of Contents' README.md && doctoc --title '## Table of Contents' CONTRIBUTING.md"
+  },
+  "devDependencies": {
+    "doctoc": "^0.15.0",
+    "eslint": "^4.19.1",
+    "live-server": "^1.2.0",
+    "npm-run-all": "^4.1.2",
+    "nyc": "^11.7.1",
+    "watch": "^1.0.2",
+    "webpack": "^3.10"
+  },
+  "nyc": {
+    "reporter": "html"
+  },
+  "typings": "source-map"
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/source-map.d.ts b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/source-map.d.ts
new file mode 100644
index 0000000..2459391
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/source-map.d.ts
@@ -0,0 +1,369 @@
+// Type definitions for source-map 0.7
+// Project: https://github.com/mozilla/source-map
+// Definitions by: Morten Houston Ludvigsen <https://github.com/MortenHoustonLudvigsen>,
+//                 Ron Buckton <https://github.com/rbuckton>,
+//                 John Vilk <https://github.com/jvilk>
+// Definitions: https://github.com/mozilla/source-map
+export type SourceMapUrl = string;
+
+export interface StartOfSourceMap {
+    file?: string;
+    sourceRoot?: string;
+    skipValidation?: boolean;
+}
+
+export interface RawSourceMap {
+    version: number;
+    sources: string[];
+    names: string[];
+    sourceRoot?: string;
+    sourcesContent?: string[];
+    mappings: string;
+    file: string;
+}
+
+export interface RawIndexMap extends StartOfSourceMap {
+    version: number;
+    sections: RawSection[];
+}
+
+export interface RawSection {
+    offset: Position;
+    map: RawSourceMap;
+}
+
+export interface Position {
+    line: number;
+    column: number;
+}
+
+export interface NullablePosition {
+    line: number | null;
+    column: number | null;
+    lastColumn: number | null;
+}
+
+export interface MappedPosition {
+    source: string;
+    line: number;
+    column: number;
+    name?: string;
+}
+
+export interface NullableMappedPosition {
+    source: string | null;
+    line: number | null;
+    column: number | null;
+    name: string | null;
+}
+
+export interface MappingItem {
+    source: string;
+    generatedLine: number;
+    generatedColumn: number;
+    originalLine: number;
+    originalColumn: number;
+    name: string;
+}
+
+export interface Mapping {
+    generated: Position;
+    original: Position;
+    source: string;
+    name?: string;
+}
+
+export interface CodeWithSourceMap {
+    code: string;
+    map: SourceMapGenerator;
+}
+
+export interface SourceMapConsumer {
+    /**
+     * Compute the last column for each generated mapping. The last column is
+     * inclusive.
+     */
+    computeColumnSpans(): void;
+
+    /**
+     * Returns the original source, line, and column information for the generated
+     * source's line and column positions provided. The only argument is an object
+     * with the following properties:
+     *
+     *   - line: The line number in the generated source.
+     *   - column: The column number in the generated source.
+     *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+     *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+     *     closest element that is smaller than or greater than the one we are
+     *     searching for, respectively, if the exact element cannot be found.
+     *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+     *
+     * and an object is returned with the following properties:
+     *
+     *   - source: The original source file, or null.
+     *   - line: The line number in the original source, or null.
+     *   - column: The column number in the original source, or null.
+     *   - name: The original identifier, or null.
+     */
+    originalPositionFor(generatedPosition: Position & { bias?: number }): NullableMappedPosition;
+
+    /**
+     * Returns the generated line and column information for the original source,
+     * line, and column positions provided. The only argument is an object with
+     * the following properties:
+     *
+     *   - source: The filename of the original source.
+     *   - line: The line number in the original source.
+     *   - column: The column number in the original source.
+     *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+     *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+     *     closest element that is smaller than or greater than the one we are
+     *     searching for, respectively, if the exact element cannot be found.
+     *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+     *
+     * and an object is returned with the following properties:
+     *
+     *   - line: The line number in the generated source, or null.
+     *   - column: The column number in the generated source, or null.
+     */
+    generatedPositionFor(originalPosition: MappedPosition & { bias?: number }): NullablePosition;
+
+    /**
+     * Returns all generated line and column information for the original source,
+     * line, and column provided. If no column is provided, returns all mappings
+     * corresponding to a either the line we are searching for or the next
+     * closest line that has any mappings. Otherwise, returns all mappings
+     * corresponding to the given line and either the column we are searching for
+     * or the next closest column that has any offsets.
+     *
+     * The only argument is an object with the following properties:
+     *
+     *   - source: The filename of the original source.
+     *   - line: The line number in the original source.
+     *   - column: Optional. the column number in the original source.
+     *
+     * and an array of objects is returned, each with the following properties:
+     *
+     *   - line: The line number in the generated source, or null.
+     *   - column: The column number in the generated source, or null.
+     */
+    allGeneratedPositionsFor(originalPosition: MappedPosition): NullablePosition[];
+
+    /**
+     * Return true if we have the source content for every source in the source
+     * map, false otherwise.
+     */
+    hasContentsOfAllSources(): boolean;
+
+    /**
+     * Returns the original source content. The only argument is the url of the
+     * original source file. Returns null if no original source content is
+     * available.
+     */
+    sourceContentFor(source: string, returnNullOnMissing?: boolean): string | null;
+
+    /**
+     * Iterate over each mapping between an original source/line/column and a
+     * generated line/column in this source map.
+     *
+     * @param callback
+     *        The function that is called with each mapping.
+     * @param context
+     *        Optional. If specified, this object will be the value of `this` every
+     *        time that `aCallback` is called.
+     * @param order
+     *        Either `SourceMapConsumer.GENERATED_ORDER` or
+     *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+     *        iterate over the mappings sorted by the generated file's line/column
+     *        order or the original's source/line/column order, respectively. Defaults to
+     *        `SourceMapConsumer.GENERATED_ORDER`.
+     */
+    eachMapping(callback: (mapping: MappingItem) => void, context?: any, order?: number): void;
+    /**
+     * Free this source map consumer's associated wasm data that is manually-managed.
+     * Alternatively, you can use SourceMapConsumer.with to avoid needing to remember to call destroy.
+     */
+    destroy(): void;
+}
+
+export interface SourceMapConsumerConstructor {
+    prototype: SourceMapConsumer;
+
+    GENERATED_ORDER: number;
+    ORIGINAL_ORDER: number;
+    GREATEST_LOWER_BOUND: number;
+    LEAST_UPPER_BOUND: number;
+
+    new (rawSourceMap: RawSourceMap, sourceMapUrl?: SourceMapUrl): Promise<BasicSourceMapConsumer>;
+    new (rawSourceMap: RawIndexMap, sourceMapUrl?: SourceMapUrl): Promise<IndexedSourceMapConsumer>;
+    new (rawSourceMap: RawSourceMap | RawIndexMap | string, sourceMapUrl?: SourceMapUrl): Promise<BasicSourceMapConsumer | IndexedSourceMapConsumer>;
+
+    /**
+     * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+     *
+     * @param sourceMap
+     *        The source map that will be consumed.
+     */
+    fromSourceMap(sourceMap: SourceMapGenerator, sourceMapUrl?: SourceMapUrl): Promise<BasicSourceMapConsumer>;
+
+    /**
+     * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+     * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+     * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+     * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+     * value.
+     *
+     * You must not use the consumer after `f` completes!
+     *
+     * By using `with`, you do not have to remember to manually call `destroy` on
+     * the consumer, since it will be called automatically once `f` completes.
+     *
+     * ```js
+     * const xSquared = await SourceMapConsumer.with(
+     *   myRawSourceMap,
+     *   null,
+     *   async function (consumer) {
+     *     // Use `consumer` inside here and don't worry about remembering
+     *     // to call `destroy`.
+     *
+     *     const x = await whatever(consumer);
+     *     return x * x;
+     *   }
+     * );
+     *
+     * // You may not use that `consumer` anymore out here; it has
+     * // been destroyed. But you can use `xSquared`.
+     * console.log(xSquared);
+     * ```
+     */
+    with<T>(rawSourceMap: RawSourceMap | RawIndexMap | string, sourceMapUrl: SourceMapUrl | null | undefined, callback: (consumer: BasicSourceMapConsumer | IndexedSourceMapConsumer) => Promise<T> | T): Promise<T>;
+}
+
+export const SourceMapConsumer: SourceMapConsumerConstructor;
+
+export interface BasicSourceMapConsumer extends SourceMapConsumer {
+    file: string;
+    sourceRoot: string;
+    sources: string[];
+    sourcesContent: string[];
+}
+
+export interface BasicSourceMapConsumerConstructor {
+    prototype: BasicSourceMapConsumer;
+
+    new (rawSourceMap: RawSourceMap | string): Promise<BasicSourceMapConsumer>;
+
+    /**
+     * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+     *
+     * @param sourceMap
+     *        The source map that will be consumed.
+     */
+    fromSourceMap(sourceMap: SourceMapGenerator): Promise<BasicSourceMapConsumer>;
+}
+
+export const BasicSourceMapConsumer: BasicSourceMapConsumerConstructor;
+
+export interface IndexedSourceMapConsumer extends SourceMapConsumer {
+    sources: string[];
+}
+
+export interface IndexedSourceMapConsumerConstructor {
+    prototype: IndexedSourceMapConsumer;
+
+    new (rawSourceMap: RawIndexMap | string): Promise<IndexedSourceMapConsumer>;
+}
+
+export const IndexedSourceMapConsumer: IndexedSourceMapConsumerConstructor;
+
+export class SourceMapGenerator {
+    constructor(startOfSourceMap?: StartOfSourceMap);
+
+    /**
+     * Creates a new SourceMapGenerator based on a SourceMapConsumer
+     *
+     * @param sourceMapConsumer The SourceMap.
+     */
+    static fromSourceMap(sourceMapConsumer: SourceMapConsumer): SourceMapGenerator;
+
+    /**
+     * Add a single mapping from original source line and column to the generated
+     * source's line and column for this source map being created. The mapping
+     * object should have the following properties:
+     *
+     *   - generated: An object with the generated line and column positions.
+     *   - original: An object with the original line and column positions.
+     *   - source: The original source file (relative to the sourceRoot).
+     *   - name: An optional original token name for this mapping.
+     */
+    addMapping(mapping: Mapping): void;
+
+    /**
+     * Set the source content for a source file.
+     */
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+
+    /**
+     * Applies the mappings of a sub-source-map for a specific source file to the
+     * source map being generated. Each mapping to the supplied source file is
+     * rewritten using the supplied source map. Note: The resolution for the
+     * resulting mappings is the minimium of this map and the supplied map.
+     *
+     * @param sourceMapConsumer The source map to be applied.
+     * @param sourceFile Optional. The filename of the source file.
+     *        If omitted, SourceMapConsumer's file property will be used.
+     * @param sourceMapPath Optional. The dirname of the path to the source map
+     *        to be applied. If relative, it is relative to the SourceMapConsumer.
+     *        This parameter is needed when the two source maps aren't in the same
+     *        directory, and the source map to be applied contains relative source
+     *        paths. If so, those relative source paths need to be rewritten
+     *        relative to the SourceMapGenerator.
+     */
+    applySourceMap(sourceMapConsumer: SourceMapConsumer, sourceFile?: string, sourceMapPath?: string): void;
+
+    toString(): string;
+
+    toJSON(): RawSourceMap;
+}
+
+export class SourceNode {
+    children: SourceNode[];
+    sourceContents: any;
+    line: number;
+    column: number;
+    source: string;
+    name: string;
+
+    constructor();
+    constructor(
+        line: number | null,
+        column: number | null,
+        source: string | null,
+        chunks?: Array<(string | SourceNode)> | SourceNode | string,
+        name?: string
+    );
+
+    static fromStringWithSourceMap(
+        code: string,
+        sourceMapConsumer: SourceMapConsumer,
+        relativePath?: string
+    ): SourceNode;
+
+    add(chunk: Array<(string | SourceNode)> | SourceNode | string): SourceNode;
+
+    prepend(chunk: Array<(string | SourceNode)> | SourceNode | string): SourceNode;
+
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+
+    walk(fn: (chunk: string, mapping: MappedPosition) => void): void;
+
+    walkSourceContents(fn: (file: string, content: string) => void): void;
+
+    join(sep: string): SourceNode;
+
+    replaceRight(pattern: string, replacement: string): SourceNode;
+
+    toString(): string;
+
+    toStringWithSourceMap(startOfSourceMap?: StartOfSourceMap): CodeWithSourceMap;
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/source-map.js b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/source-map.js
new file mode 100644
index 0000000..a84abf1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/node_modules/source-map/source-map.js
@@ -0,0 +1,8 @@
+/*
+ * Copyright 2009-2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE.txt or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+exports.SourceMapGenerator = require("./lib/source-map-generator").SourceMapGenerator;
+exports.SourceMapConsumer = require("./lib/source-map-consumer").SourceMapConsumer;
+exports.SourceNode = require("./lib/source-node").SourceNode;
diff --git a/node_modules/mathjs/examples/node_modules/terser/package.json b/node_modules/mathjs/examples/node_modules/terser/package.json
new file mode 100644
index 0000000..9bea454
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/package.json
@@ -0,0 +1,152 @@
+{
+  "name": "terser",
+  "description": "JavaScript parser, mangler/compressor and beautifier toolkit for ES6+",
+  "homepage": "https://terser.org",
+  "author": "Mihai Bazon <mihai.bazon@gmail.com> (http://lisperator.net/)",
+  "license": "BSD-2-Clause",
+  "version": "5.12.1",
+  "engines": {
+    "node": ">=10"
+  },
+  "maintainers": [
+    "Fábio Santos <fabiosantosart@gmail.com>"
+  ],
+  "repository": "https://github.com/terser/terser",
+  "main": "dist/bundle.min.js",
+  "type": "module",
+  "module": "./main.js",
+  "exports": {
+    ".": [
+      {
+        "import": "./main.js",
+        "require": "./dist/bundle.min.js"
+      },
+      "./dist/bundle.min.js"
+    ],
+    "./package": "./package.json",
+    "./package.json": "./package.json",
+    "./bin/terser": "./bin/terser"
+  },
+  "types": "tools/terser.d.ts",
+  "bin": {
+    "terser": "bin/terser"
+  },
+  "files": [
+    "bin",
+    "dist",
+    "lib",
+    "tools",
+    "LICENSE",
+    "README.md",
+    "CHANGELOG.md",
+    "PATRONS.md",
+    "main.js"
+  ],
+  "dependencies": {
+    "acorn": "^8.5.0",
+    "commander": "^2.20.0",
+    "source-map": "~0.7.2",
+    "source-map-support": "~0.5.20"
+  },
+  "devDependencies": {
+    "@ls-lint/ls-lint": "^1.10.0",
+    "astring": "^1.7.5",
+    "eslint": "^7.32.0",
+    "eslump": "^3.0.0",
+    "esm": "^3.2.25",
+    "mocha": "^9.2.0",
+    "pre-commit": "^1.2.2",
+    "rimraf": "^3.0.2",
+    "rollup": "2.56.3",
+    "semver": "^7.3.4"
+  },
+  "scripts": {
+    "test": "node test/compress.js && mocha test/mocha",
+    "test:compress": "node test/compress.js",
+    "test:mocha": "mocha test/mocha",
+    "lint": "eslint lib",
+    "lint-fix": "eslint --fix lib",
+    "ls-lint": "ls-lint",
+    "build": "rimraf dist/bundle* && rollup --config --silent",
+    "prepare": "npm run build",
+    "postversion": "echo 'Remember to update the changelog!'"
+  },
+  "keywords": [
+    "uglify",
+    "terser",
+    "uglify-es",
+    "uglify-js",
+    "minify",
+    "minifier",
+    "javascript",
+    "ecmascript",
+    "es5",
+    "es6",
+    "es7",
+    "es8",
+    "es2015",
+    "es2016",
+    "es2017",
+    "async",
+    "await"
+  ],
+  "eslintConfig": {
+    "parserOptions": {
+      "sourceType": "module",
+      "ecmaVersion": 2020
+    },
+    "env": {
+      "node": true,
+      "browser": true,
+      "es2020": true
+    },
+    "globals": {
+      "describe": false,
+      "it": false,
+      "require": false,
+      "before": false,
+      "after": false,
+      "global": false,
+      "process": false
+    },
+    "rules": {
+      "brace-style": [
+        "error",
+        "1tbs",
+        {
+          "allowSingleLine": true
+        }
+      ],
+      "quotes": [
+        "error",
+        "double",
+        "avoid-escape"
+      ],
+      "no-debugger": "error",
+      "no-undef": "error",
+      "no-unused-vars": [
+        "error",
+        {
+          "varsIgnorePattern": "^_"
+        }
+      ],
+      "no-tabs": "error",
+      "semi": [
+        "error",
+        "always"
+      ],
+      "no-extra-semi": "error",
+      "no-irregular-whitespace": "error",
+      "space-before-blocks": [
+        "error",
+        "always"
+      ]
+    }
+  },
+  "pre-commit": [
+    "build",
+    "lint-fix",
+    "ls-lint",
+    "test"
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/terser/tools/domprops.js b/node_modules/mathjs/examples/node_modules/terser/tools/domprops.js
new file mode 100644
index 0000000..aa51fb6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/tools/domprops.js
@@ -0,0 +1,7771 @@
+export var domprops = [
+    "$&",
+    "$'",
+    "$*",
+    "$+",
+    "$1",
+    "$2",
+    "$3",
+    "$4",
+    "$5",
+    "$6",
+    "$7",
+    "$8",
+    "$9",
+    "$_",
+    "$`",
+    "$input",
+    "-moz-animation",
+    "-moz-animation-delay",
+    "-moz-animation-direction",
+    "-moz-animation-duration",
+    "-moz-animation-fill-mode",
+    "-moz-animation-iteration-count",
+    "-moz-animation-name",
+    "-moz-animation-play-state",
+    "-moz-animation-timing-function",
+    "-moz-appearance",
+    "-moz-backface-visibility",
+    "-moz-border-end",
+    "-moz-border-end-color",
+    "-moz-border-end-style",
+    "-moz-border-end-width",
+    "-moz-border-image",
+    "-moz-border-start",
+    "-moz-border-start-color",
+    "-moz-border-start-style",
+    "-moz-border-start-width",
+    "-moz-box-align",
+    "-moz-box-direction",
+    "-moz-box-flex",
+    "-moz-box-ordinal-group",
+    "-moz-box-orient",
+    "-moz-box-pack",
+    "-moz-box-sizing",
+    "-moz-float-edge",
+    "-moz-font-feature-settings",
+    "-moz-font-language-override",
+    "-moz-force-broken-image-icon",
+    "-moz-hyphens",
+    "-moz-image-region",
+    "-moz-margin-end",
+    "-moz-margin-start",
+    "-moz-orient",
+    "-moz-osx-font-smoothing",
+    "-moz-outline-radius",
+    "-moz-outline-radius-bottomleft",
+    "-moz-outline-radius-bottomright",
+    "-moz-outline-radius-topleft",
+    "-moz-outline-radius-topright",
+    "-moz-padding-end",
+    "-moz-padding-start",
+    "-moz-perspective",
+    "-moz-perspective-origin",
+    "-moz-tab-size",
+    "-moz-text-size-adjust",
+    "-moz-transform",
+    "-moz-transform-origin",
+    "-moz-transform-style",
+    "-moz-transition",
+    "-moz-transition-delay",
+    "-moz-transition-duration",
+    "-moz-transition-property",
+    "-moz-transition-timing-function",
+    "-moz-user-focus",
+    "-moz-user-input",
+    "-moz-user-modify",
+    "-moz-user-select",
+    "-moz-window-dragging",
+    "-webkit-align-content",
+    "-webkit-align-items",
+    "-webkit-align-self",
+    "-webkit-animation",
+    "-webkit-animation-delay",
+    "-webkit-animation-direction",
+    "-webkit-animation-duration",
+    "-webkit-animation-fill-mode",
+    "-webkit-animation-iteration-count",
+    "-webkit-animation-name",
+    "-webkit-animation-play-state",
+    "-webkit-animation-timing-function",
+    "-webkit-appearance",
+    "-webkit-backface-visibility",
+    "-webkit-background-clip",
+    "-webkit-background-origin",
+    "-webkit-background-size",
+    "-webkit-border-bottom-left-radius",
+    "-webkit-border-bottom-right-radius",
+    "-webkit-border-image",
+    "-webkit-border-radius",
+    "-webkit-border-top-left-radius",
+    "-webkit-border-top-right-radius",
+    "-webkit-box-align",
+    "-webkit-box-direction",
+    "-webkit-box-flex",
+    "-webkit-box-ordinal-group",
+    "-webkit-box-orient",
+    "-webkit-box-pack",
+    "-webkit-box-shadow",
+    "-webkit-box-sizing",
+    "-webkit-filter",
+    "-webkit-flex",
+    "-webkit-flex-basis",
+    "-webkit-flex-direction",
+    "-webkit-flex-flow",
+    "-webkit-flex-grow",
+    "-webkit-flex-shrink",
+    "-webkit-flex-wrap",
+    "-webkit-justify-content",
+    "-webkit-line-clamp",
+    "-webkit-mask",
+    "-webkit-mask-clip",
+    "-webkit-mask-composite",
+    "-webkit-mask-image",
+    "-webkit-mask-origin",
+    "-webkit-mask-position",
+    "-webkit-mask-position-x",
+    "-webkit-mask-position-y",
+    "-webkit-mask-repeat",
+    "-webkit-mask-size",
+    "-webkit-order",
+    "-webkit-perspective",
+    "-webkit-perspective-origin",
+    "-webkit-text-fill-color",
+    "-webkit-text-size-adjust",
+    "-webkit-text-stroke",
+    "-webkit-text-stroke-color",
+    "-webkit-text-stroke-width",
+    "-webkit-transform",
+    "-webkit-transform-origin",
+    "-webkit-transform-style",
+    "-webkit-transition",
+    "-webkit-transition-delay",
+    "-webkit-transition-duration",
+    "-webkit-transition-property",
+    "-webkit-transition-timing-function",
+    "-webkit-user-select",
+    "0",
+    "1",
+    "10",
+    "11",
+    "12",
+    "13",
+    "14",
+    "15",
+    "16",
+    "17",
+    "18",
+    "19",
+    "2",
+    "20",
+    "3",
+    "4",
+    "5",
+    "6",
+    "7",
+    "8",
+    "9",
+    "@@iterator",
+    "ABORT_ERR",
+    "ACTIVE",
+    "ACTIVE_ATTRIBUTES",
+    "ACTIVE_TEXTURE",
+    "ACTIVE_UNIFORMS",
+    "ACTIVE_UNIFORM_BLOCKS",
+    "ADDITION",
+    "ALIASED_LINE_WIDTH_RANGE",
+    "ALIASED_POINT_SIZE_RANGE",
+    "ALLOW_KEYBOARD_INPUT",
+    "ALLPASS",
+    "ALPHA",
+    "ALPHA_BITS",
+    "ALREADY_SIGNALED",
+    "ALT_MASK",
+    "ALWAYS",
+    "ANY_SAMPLES_PASSED",
+    "ANY_SAMPLES_PASSED_CONSERVATIVE",
+    "ANY_TYPE",
+    "ANY_UNORDERED_NODE_TYPE",
+    "ARRAY_BUFFER",
+    "ARRAY_BUFFER_BINDING",
+    "ATTACHED_SHADERS",
+    "ATTRIBUTE_NODE",
+    "AT_TARGET",
+    "AbortController",
+    "AbortSignal",
+    "AbsoluteOrientationSensor",
+    "AbstractRange",
+    "Accelerometer",
+    "AddSearchProvider",
+    "AggregateError",
+    "AnalyserNode",
+    "Animation",
+    "AnimationEffect",
+    "AnimationEvent",
+    "AnimationPlaybackEvent",
+    "AnimationTimeline",
+    "AnonXMLHttpRequest",
+    "Any",
+    "ApplicationCache",
+    "ApplicationCacheErrorEvent",
+    "Array",
+    "ArrayBuffer",
+    "ArrayType",
+    "Atomics",
+    "Attr",
+    "Audio",
+    "AudioBuffer",
+    "AudioBufferSourceNode",
+    "AudioContext",
+    "AudioDestinationNode",
+    "AudioListener",
+    "AudioNode",
+    "AudioParam",
+    "AudioParamMap",
+    "AudioProcessingEvent",
+    "AudioScheduledSourceNode",
+    "AudioStreamTrack",
+    "AudioWorklet",
+    "AudioWorkletNode",
+    "AuthenticatorAssertionResponse",
+    "AuthenticatorAttestationResponse",
+    "AuthenticatorResponse",
+    "AutocompleteErrorEvent",
+    "BACK",
+    "BAD_BOUNDARYPOINTS_ERR",
+    "BAD_REQUEST",
+    "BANDPASS",
+    "BLEND",
+    "BLEND_COLOR",
+    "BLEND_DST_ALPHA",
+    "BLEND_DST_RGB",
+    "BLEND_EQUATION",
+    "BLEND_EQUATION_ALPHA",
+    "BLEND_EQUATION_RGB",
+    "BLEND_SRC_ALPHA",
+    "BLEND_SRC_RGB",
+    "BLUE_BITS",
+    "BLUR",
+    "BOOL",
+    "BOOLEAN_TYPE",
+    "BOOL_VEC2",
+    "BOOL_VEC3",
+    "BOOL_VEC4",
+    "BOTH",
+    "BROWSER_DEFAULT_WEBGL",
+    "BUBBLING_PHASE",
+    "BUFFER_SIZE",
+    "BUFFER_USAGE",
+    "BYTE",
+    "BYTES_PER_ELEMENT",
+    "BackgroundFetchManager",
+    "BackgroundFetchRecord",
+    "BackgroundFetchRegistration",
+    "BarProp",
+    "BarcodeDetector",
+    "BaseAudioContext",
+    "BaseHref",
+    "BatteryManager",
+    "BeforeInstallPromptEvent",
+    "BeforeLoadEvent",
+    "BeforeUnloadEvent",
+    "BigInt",
+    "BigInt64Array",
+    "BigUint64Array",
+    "BiquadFilterNode",
+    "Blob",
+    "BlobEvent",
+    "Bluetooth",
+    "BluetoothCharacteristicProperties",
+    "BluetoothDevice",
+    "BluetoothRemoteGATTCharacteristic",
+    "BluetoothRemoteGATTDescriptor",
+    "BluetoothRemoteGATTServer",
+    "BluetoothRemoteGATTService",
+    "BluetoothUUID",
+    "Boolean",
+    "BroadcastChannel",
+    "ByteLengthQueuingStrategy",
+    "CAPTURING_PHASE",
+    "CCW",
+    "CDATASection",
+    "CDATA_SECTION_NODE",
+    "CHANGE",
+    "CHARSET_RULE",
+    "CHECKING",
+    "CLAMP_TO_EDGE",
+    "CLICK",
+    "CLOSED",
+    "CLOSING",
+    "COLOR",
+    "COLOR_ATTACHMENT0",
+    "COLOR_ATTACHMENT1",
+    "COLOR_ATTACHMENT10",
+    "COLOR_ATTACHMENT11",
+    "COLOR_ATTACHMENT12",
+    "COLOR_ATTACHMENT13",
+    "COLOR_ATTACHMENT14",
+    "COLOR_ATTACHMENT15",
+    "COLOR_ATTACHMENT2",
+    "COLOR_ATTACHMENT3",
+    "COLOR_ATTACHMENT4",
+    "COLOR_ATTACHMENT5",
+    "COLOR_ATTACHMENT6",
+    "COLOR_ATTACHMENT7",
+    "COLOR_ATTACHMENT8",
+    "COLOR_ATTACHMENT9",
+    "COLOR_BUFFER_BIT",
+    "COLOR_CLEAR_VALUE",
+    "COLOR_WRITEMASK",
+    "COMMENT_NODE",
+    "COMPARE_REF_TO_TEXTURE",
+    "COMPILE_STATUS",
+    "COMPRESSED_RGBA_S3TC_DXT1_EXT",
+    "COMPRESSED_RGBA_S3TC_DXT3_EXT",
+    "COMPRESSED_RGBA_S3TC_DXT5_EXT",
+    "COMPRESSED_RGB_S3TC_DXT1_EXT",
+    "COMPRESSED_TEXTURE_FORMATS",
+    "CONDITION_SATISFIED",
+    "CONFIGURATION_UNSUPPORTED",
+    "CONNECTING",
+    "CONSTANT_ALPHA",
+    "CONSTANT_COLOR",
+    "CONSTRAINT_ERR",
+    "CONTEXT_LOST_WEBGL",
+    "CONTROL_MASK",
+    "COPY_READ_BUFFER",
+    "COPY_READ_BUFFER_BINDING",
+    "COPY_WRITE_BUFFER",
+    "COPY_WRITE_BUFFER_BINDING",
+    "COUNTER_STYLE_RULE",
+    "CSS",
+    "CSS2Properties",
+    "CSSAnimation",
+    "CSSCharsetRule",
+    "CSSConditionRule",
+    "CSSCounterStyleRule",
+    "CSSFontFaceRule",
+    "CSSFontFeatureValuesRule",
+    "CSSGroupingRule",
+    "CSSImageValue",
+    "CSSImportRule",
+    "CSSKeyframeRule",
+    "CSSKeyframesRule",
+    "CSSKeywordValue",
+    "CSSMathInvert",
+    "CSSMathMax",
+    "CSSMathMin",
+    "CSSMathNegate",
+    "CSSMathProduct",
+    "CSSMathSum",
+    "CSSMathValue",
+    "CSSMatrixComponent",
+    "CSSMediaRule",
+    "CSSMozDocumentRule",
+    "CSSNameSpaceRule",
+    "CSSNamespaceRule",
+    "CSSNumericArray",
+    "CSSNumericValue",
+    "CSSPageRule",
+    "CSSPerspective",
+    "CSSPositionValue",
+    "CSSPrimitiveValue",
+    "CSSRotate",
+    "CSSRule",
+    "CSSRuleList",
+    "CSSScale",
+    "CSSSkew",
+    "CSSSkewX",
+    "CSSSkewY",
+    "CSSStyleDeclaration",
+    "CSSStyleRule",
+    "CSSStyleSheet",
+    "CSSStyleValue",
+    "CSSSupportsRule",
+    "CSSTransformComponent",
+    "CSSTransformValue",
+    "CSSTransition",
+    "CSSTranslate",
+    "CSSUnitValue",
+    "CSSUnknownRule",
+    "CSSUnparsedValue",
+    "CSSValue",
+    "CSSValueList",
+    "CSSVariableReferenceValue",
+    "CSSVariablesDeclaration",
+    "CSSVariablesRule",
+    "CSSViewportRule",
+    "CSS_ATTR",
+    "CSS_CM",
+    "CSS_COUNTER",
+    "CSS_CUSTOM",
+    "CSS_DEG",
+    "CSS_DIMENSION",
+    "CSS_EMS",
+    "CSS_EXS",
+    "CSS_FILTER_BLUR",
+    "CSS_FILTER_BRIGHTNESS",
+    "CSS_FILTER_CONTRAST",
+    "CSS_FILTER_CUSTOM",
+    "CSS_FILTER_DROP_SHADOW",
+    "CSS_FILTER_GRAYSCALE",
+    "CSS_FILTER_HUE_ROTATE",
+    "CSS_FILTER_INVERT",
+    "CSS_FILTER_OPACITY",
+    "CSS_FILTER_REFERENCE",
+    "CSS_FILTER_SATURATE",
+    "CSS_FILTER_SEPIA",
+    "CSS_GRAD",
+    "CSS_HZ",
+    "CSS_IDENT",
+    "CSS_IN",
+    "CSS_INHERIT",
+    "CSS_KHZ",
+    "CSS_MATRIX",
+    "CSS_MATRIX3D",
+    "CSS_MM",
+    "CSS_MS",
+    "CSS_NUMBER",
+    "CSS_PC",
+    "CSS_PERCENTAGE",
+    "CSS_PERSPECTIVE",
+    "CSS_PRIMITIVE_VALUE",
+    "CSS_PT",
+    "CSS_PX",
+    "CSS_RAD",
+    "CSS_RECT",
+    "CSS_RGBCOLOR",
+    "CSS_ROTATE",
+    "CSS_ROTATE3D",
+    "CSS_ROTATEX",
+    "CSS_ROTATEY",
+    "CSS_ROTATEZ",
+    "CSS_S",
+    "CSS_SCALE",
+    "CSS_SCALE3D",
+    "CSS_SCALEX",
+    "CSS_SCALEY",
+    "CSS_SCALEZ",
+    "CSS_SKEW",
+    "CSS_SKEWX",
+    "CSS_SKEWY",
+    "CSS_STRING",
+    "CSS_TRANSLATE",
+    "CSS_TRANSLATE3D",
+    "CSS_TRANSLATEX",
+    "CSS_TRANSLATEY",
+    "CSS_TRANSLATEZ",
+    "CSS_UNKNOWN",
+    "CSS_URI",
+    "CSS_VALUE_LIST",
+    "CSS_VH",
+    "CSS_VMAX",
+    "CSS_VMIN",
+    "CSS_VW",
+    "CULL_FACE",
+    "CULL_FACE_MODE",
+    "CURRENT_PROGRAM",
+    "CURRENT_QUERY",
+    "CURRENT_VERTEX_ATTRIB",
+    "CUSTOM",
+    "CW",
+    "Cache",
+    "CacheStorage",
+    "CanvasCaptureMediaStream",
+    "CanvasCaptureMediaStreamTrack",
+    "CanvasGradient",
+    "CanvasPattern",
+    "CanvasRenderingContext2D",
+    "CaretPosition",
+    "ChannelMergerNode",
+    "ChannelSplitterNode",
+    "CharacterData",
+    "ClientRect",
+    "ClientRectList",
+    "Clipboard",
+    "ClipboardEvent",
+    "ClipboardItem",
+    "CloseEvent",
+    "Collator",
+    "CommandEvent",
+    "Comment",
+    "CompileError",
+    "CompositionEvent",
+    "CompressionStream",
+    "Console",
+    "ConstantSourceNode",
+    "Controllers",
+    "ConvolverNode",
+    "CountQueuingStrategy",
+    "Counter",
+    "Credential",
+    "CredentialsContainer",
+    "Crypto",
+    "CryptoKey",
+    "CustomElementRegistry",
+    "CustomEvent",
+    "DATABASE_ERR",
+    "DATA_CLONE_ERR",
+    "DATA_ERR",
+    "DBLCLICK",
+    "DECR",
+    "DECR_WRAP",
+    "DELETE_STATUS",
+    "DEPTH",
+    "DEPTH24_STENCIL8",
+    "DEPTH32F_STENCIL8",
+    "DEPTH_ATTACHMENT",
+    "DEPTH_BITS",
+    "DEPTH_BUFFER_BIT",
+    "DEPTH_CLEAR_VALUE",
+    "DEPTH_COMPONENT",
+    "DEPTH_COMPONENT16",
+    "DEPTH_COMPONENT24",
+    "DEPTH_COMPONENT32F",
+    "DEPTH_FUNC",
+    "DEPTH_RANGE",
+    "DEPTH_STENCIL",
+    "DEPTH_STENCIL_ATTACHMENT",
+    "DEPTH_TEST",
+    "DEPTH_WRITEMASK",
+    "DEVICE_INELIGIBLE",
+    "DIRECTION_DOWN",
+    "DIRECTION_LEFT",
+    "DIRECTION_RIGHT",
+    "DIRECTION_UP",
+    "DISABLED",
+    "DISPATCH_REQUEST_ERR",
+    "DITHER",
+    "DOCUMENT_FRAGMENT_NODE",
+    "DOCUMENT_NODE",
+    "DOCUMENT_POSITION_CONTAINED_BY",
+    "DOCUMENT_POSITION_CONTAINS",
+    "DOCUMENT_POSITION_DISCONNECTED",
+    "DOCUMENT_POSITION_FOLLOWING",
+    "DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC",
+    "DOCUMENT_POSITION_PRECEDING",
+    "DOCUMENT_TYPE_NODE",
+    "DOMCursor",
+    "DOMError",
+    "DOMException",
+    "DOMImplementation",
+    "DOMImplementationLS",
+    "DOMMatrix",
+    "DOMMatrixReadOnly",
+    "DOMParser",
+    "DOMPoint",
+    "DOMPointReadOnly",
+    "DOMQuad",
+    "DOMRect",
+    "DOMRectList",
+    "DOMRectReadOnly",
+    "DOMRequest",
+    "DOMSTRING_SIZE_ERR",
+    "DOMSettableTokenList",
+    "DOMStringList",
+    "DOMStringMap",
+    "DOMTokenList",
+    "DOMTransactionEvent",
+    "DOM_DELTA_LINE",
+    "DOM_DELTA_PAGE",
+    "DOM_DELTA_PIXEL",
+    "DOM_INPUT_METHOD_DROP",
+    "DOM_INPUT_METHOD_HANDWRITING",
+    "DOM_INPUT_METHOD_IME",
+    "DOM_INPUT_METHOD_KEYBOARD",
+    "DOM_INPUT_METHOD_MULTIMODAL",
+    "DOM_INPUT_METHOD_OPTION",
+    "DOM_INPUT_METHOD_PASTE",
+    "DOM_INPUT_METHOD_SCRIPT",
+    "DOM_INPUT_METHOD_UNKNOWN",
+    "DOM_INPUT_METHOD_VOICE",
+    "DOM_KEY_LOCATION_JOYSTICK",
+    "DOM_KEY_LOCATION_LEFT",
+    "DOM_KEY_LOCATION_MOBILE",
+    "DOM_KEY_LOCATION_NUMPAD",
+    "DOM_KEY_LOCATION_RIGHT",
+    "DOM_KEY_LOCATION_STANDARD",
+    "DOM_VK_0",
+    "DOM_VK_1",
+    "DOM_VK_2",
+    "DOM_VK_3",
+    "DOM_VK_4",
+    "DOM_VK_5",
+    "DOM_VK_6",
+    "DOM_VK_7",
+    "DOM_VK_8",
+    "DOM_VK_9",
+    "DOM_VK_A",
+    "DOM_VK_ACCEPT",
+    "DOM_VK_ADD",
+    "DOM_VK_ALT",
+    "DOM_VK_ALTGR",
+    "DOM_VK_AMPERSAND",
+    "DOM_VK_ASTERISK",
+    "DOM_VK_AT",
+    "DOM_VK_ATTN",
+    "DOM_VK_B",
+    "DOM_VK_BACKSPACE",
+    "DOM_VK_BACK_QUOTE",
+    "DOM_VK_BACK_SLASH",
+    "DOM_VK_BACK_SPACE",
+    "DOM_VK_C",
+    "DOM_VK_CANCEL",
+    "DOM_VK_CAPS_LOCK",
+    "DOM_VK_CIRCUMFLEX",
+    "DOM_VK_CLEAR",
+    "DOM_VK_CLOSE_BRACKET",
+    "DOM_VK_CLOSE_CURLY_BRACKET",
+    "DOM_VK_CLOSE_PAREN",
+    "DOM_VK_COLON",
+    "DOM_VK_COMMA",
+    "DOM_VK_CONTEXT_MENU",
+    "DOM_VK_CONTROL",
+    "DOM_VK_CONVERT",
+    "DOM_VK_CRSEL",
+    "DOM_VK_CTRL",
+    "DOM_VK_D",
+    "DOM_VK_DECIMAL",
+    "DOM_VK_DELETE",
+    "DOM_VK_DIVIDE",
+    "DOM_VK_DOLLAR",
+    "DOM_VK_DOUBLE_QUOTE",
+    "DOM_VK_DOWN",
+    "DOM_VK_E",
+    "DOM_VK_EISU",
+    "DOM_VK_END",
+    "DOM_VK_ENTER",
+    "DOM_VK_EQUALS",
+    "DOM_VK_EREOF",
+    "DOM_VK_ESCAPE",
+    "DOM_VK_EXCLAMATION",
+    "DOM_VK_EXECUTE",
+    "DOM_VK_EXSEL",
+    "DOM_VK_F",
+    "DOM_VK_F1",
+    "DOM_VK_F10",
+    "DOM_VK_F11",
+    "DOM_VK_F12",
+    "DOM_VK_F13",
+    "DOM_VK_F14",
+    "DOM_VK_F15",
+    "DOM_VK_F16",
+    "DOM_VK_F17",
+    "DOM_VK_F18",
+    "DOM_VK_F19",
+    "DOM_VK_F2",
+    "DOM_VK_F20",
+    "DOM_VK_F21",
+    "DOM_VK_F22",
+    "DOM_VK_F23",
+    "DOM_VK_F24",
+    "DOM_VK_F25",
+    "DOM_VK_F26",
+    "DOM_VK_F27",
+    "DOM_VK_F28",
+    "DOM_VK_F29",
+    "DOM_VK_F3",
+    "DOM_VK_F30",
+    "DOM_VK_F31",
+    "DOM_VK_F32",
+    "DOM_VK_F33",
+    "DOM_VK_F34",
+    "DOM_VK_F35",
+    "DOM_VK_F36",
+    "DOM_VK_F4",
+    "DOM_VK_F5",
+    "DOM_VK_F6",
+    "DOM_VK_F7",
+    "DOM_VK_F8",
+    "DOM_VK_F9",
+    "DOM_VK_FINAL",
+    "DOM_VK_FRONT",
+    "DOM_VK_G",
+    "DOM_VK_GREATER_THAN",
+    "DOM_VK_H",
+    "DOM_VK_HANGUL",
+    "DOM_VK_HANJA",
+    "DOM_VK_HASH",
+    "DOM_VK_HELP",
+    "DOM_VK_HK_TOGGLE",
+    "DOM_VK_HOME",
+    "DOM_VK_HYPHEN_MINUS",
+    "DOM_VK_I",
+    "DOM_VK_INSERT",
+    "DOM_VK_J",
+    "DOM_VK_JUNJA",
+    "DOM_VK_K",
+    "DOM_VK_KANA",
+    "DOM_VK_KANJI",
+    "DOM_VK_L",
+    "DOM_VK_LEFT",
+    "DOM_VK_LEFT_TAB",
+    "DOM_VK_LESS_THAN",
+    "DOM_VK_M",
+    "DOM_VK_META",
+    "DOM_VK_MODECHANGE",
+    "DOM_VK_MULTIPLY",
+    "DOM_VK_N",
+    "DOM_VK_NONCONVERT",
+    "DOM_VK_NUMPAD0",
+    "DOM_VK_NUMPAD1",
+    "DOM_VK_NUMPAD2",
+    "DOM_VK_NUMPAD3",
+    "DOM_VK_NUMPAD4",
+    "DOM_VK_NUMPAD5",
+    "DOM_VK_NUMPAD6",
+    "DOM_VK_NUMPAD7",
+    "DOM_VK_NUMPAD8",
+    "DOM_VK_NUMPAD9",
+    "DOM_VK_NUM_LOCK",
+    "DOM_VK_O",
+    "DOM_VK_OEM_1",
+    "DOM_VK_OEM_102",
+    "DOM_VK_OEM_2",
+    "DOM_VK_OEM_3",
+    "DOM_VK_OEM_4",
+    "DOM_VK_OEM_5",
+    "DOM_VK_OEM_6",
+    "DOM_VK_OEM_7",
+    "DOM_VK_OEM_8",
+    "DOM_VK_OEM_COMMA",
+    "DOM_VK_OEM_MINUS",
+    "DOM_VK_OEM_PERIOD",
+    "DOM_VK_OEM_PLUS",
+    "DOM_VK_OPEN_BRACKET",
+    "DOM_VK_OPEN_CURLY_BRACKET",
+    "DOM_VK_OPEN_PAREN",
+    "DOM_VK_P",
+    "DOM_VK_PA1",
+    "DOM_VK_PAGEDOWN",
+    "DOM_VK_PAGEUP",
+    "DOM_VK_PAGE_DOWN",
+    "DOM_VK_PAGE_UP",
+    "DOM_VK_PAUSE",
+    "DOM_VK_PERCENT",
+    "DOM_VK_PERIOD",
+    "DOM_VK_PIPE",
+    "DOM_VK_PLAY",
+    "DOM_VK_PLUS",
+    "DOM_VK_PRINT",
+    "DOM_VK_PRINTSCREEN",
+    "DOM_VK_PROCESSKEY",
+    "DOM_VK_PROPERITES",
+    "DOM_VK_Q",
+    "DOM_VK_QUESTION_MARK",
+    "DOM_VK_QUOTE",
+    "DOM_VK_R",
+    "DOM_VK_REDO",
+    "DOM_VK_RETURN",
+    "DOM_VK_RIGHT",
+    "DOM_VK_S",
+    "DOM_VK_SCROLL_LOCK",
+    "DOM_VK_SELECT",
+    "DOM_VK_SEMICOLON",
+    "DOM_VK_SEPARATOR",
+    "DOM_VK_SHIFT",
+    "DOM_VK_SLASH",
+    "DOM_VK_SLEEP",
+    "DOM_VK_SPACE",
+    "DOM_VK_SUBTRACT",
+    "DOM_VK_T",
+    "DOM_VK_TAB",
+    "DOM_VK_TILDE",
+    "DOM_VK_U",
+    "DOM_VK_UNDERSCORE",
+    "DOM_VK_UNDO",
+    "DOM_VK_UNICODE",
+    "DOM_VK_UP",
+    "DOM_VK_V",
+    "DOM_VK_VOLUME_DOWN",
+    "DOM_VK_VOLUME_MUTE",
+    "DOM_VK_VOLUME_UP",
+    "DOM_VK_W",
+    "DOM_VK_WIN",
+    "DOM_VK_WINDOW",
+    "DOM_VK_WIN_ICO_00",
+    "DOM_VK_WIN_ICO_CLEAR",
+    "DOM_VK_WIN_ICO_HELP",
+    "DOM_VK_WIN_OEM_ATTN",
+    "DOM_VK_WIN_OEM_AUTO",
+    "DOM_VK_WIN_OEM_BACKTAB",
+    "DOM_VK_WIN_OEM_CLEAR",
+    "DOM_VK_WIN_OEM_COPY",
+    "DOM_VK_WIN_OEM_CUSEL",
+    "DOM_VK_WIN_OEM_ENLW",
+    "DOM_VK_WIN_OEM_FINISH",
+    "DOM_VK_WIN_OEM_FJ_JISHO",
+    "DOM_VK_WIN_OEM_FJ_LOYA",
+    "DOM_VK_WIN_OEM_FJ_MASSHOU",
+    "DOM_VK_WIN_OEM_FJ_ROYA",
+    "DOM_VK_WIN_OEM_FJ_TOUROKU",
+    "DOM_VK_WIN_OEM_JUMP",
+    "DOM_VK_WIN_OEM_PA1",
+    "DOM_VK_WIN_OEM_PA2",
+    "DOM_VK_WIN_OEM_PA3",
+    "DOM_VK_WIN_OEM_RESET",
+    "DOM_VK_WIN_OEM_WSCTRL",
+    "DOM_VK_X",
+    "DOM_VK_XF86XK_ADD_FAVORITE",
+    "DOM_VK_XF86XK_APPLICATION_LEFT",
+    "DOM_VK_XF86XK_APPLICATION_RIGHT",
+    "DOM_VK_XF86XK_AUDIO_CYCLE_TRACK",
+    "DOM_VK_XF86XK_AUDIO_FORWARD",
+    "DOM_VK_XF86XK_AUDIO_LOWER_VOLUME",
+    "DOM_VK_XF86XK_AUDIO_MEDIA",
+    "DOM_VK_XF86XK_AUDIO_MUTE",
+    "DOM_VK_XF86XK_AUDIO_NEXT",
+    "DOM_VK_XF86XK_AUDIO_PAUSE",
+    "DOM_VK_XF86XK_AUDIO_PLAY",
+    "DOM_VK_XF86XK_AUDIO_PREV",
+    "DOM_VK_XF86XK_AUDIO_RAISE_VOLUME",
+    "DOM_VK_XF86XK_AUDIO_RANDOM_PLAY",
+    "DOM_VK_XF86XK_AUDIO_RECORD",
+    "DOM_VK_XF86XK_AUDIO_REPEAT",
+    "DOM_VK_XF86XK_AUDIO_REWIND",
+    "DOM_VK_XF86XK_AUDIO_STOP",
+    "DOM_VK_XF86XK_AWAY",
+    "DOM_VK_XF86XK_BACK",
+    "DOM_VK_XF86XK_BACK_FORWARD",
+    "DOM_VK_XF86XK_BATTERY",
+    "DOM_VK_XF86XK_BLUE",
+    "DOM_VK_XF86XK_BLUETOOTH",
+    "DOM_VK_XF86XK_BOOK",
+    "DOM_VK_XF86XK_BRIGHTNESS_ADJUST",
+    "DOM_VK_XF86XK_CALCULATOR",
+    "DOM_VK_XF86XK_CALENDAR",
+    "DOM_VK_XF86XK_CD",
+    "DOM_VK_XF86XK_CLOSE",
+    "DOM_VK_XF86XK_COMMUNITY",
+    "DOM_VK_XF86XK_CONTRAST_ADJUST",
+    "DOM_VK_XF86XK_COPY",
+    "DOM_VK_XF86XK_CUT",
+    "DOM_VK_XF86XK_CYCLE_ANGLE",
+    "DOM_VK_XF86XK_DISPLAY",
+    "DOM_VK_XF86XK_DOCUMENTS",
+    "DOM_VK_XF86XK_DOS",
+    "DOM_VK_XF86XK_EJECT",
+    "DOM_VK_XF86XK_EXCEL",
+    "DOM_VK_XF86XK_EXPLORER",
+    "DOM_VK_XF86XK_FAVORITES",
+    "DOM_VK_XF86XK_FINANCE",
+    "DOM_VK_XF86XK_FORWARD",
+    "DOM_VK_XF86XK_FRAME_BACK",
+    "DOM_VK_XF86XK_FRAME_FORWARD",
+    "DOM_VK_XF86XK_GAME",
+    "DOM_VK_XF86XK_GO",
+    "DOM_VK_XF86XK_GREEN",
+    "DOM_VK_XF86XK_HIBERNATE",
+    "DOM_VK_XF86XK_HISTORY",
+    "DOM_VK_XF86XK_HOME_PAGE",
+    "DOM_VK_XF86XK_HOT_LINKS",
+    "DOM_VK_XF86XK_I_TOUCH",
+    "DOM_VK_XF86XK_KBD_BRIGHTNESS_DOWN",
+    "DOM_VK_XF86XK_KBD_BRIGHTNESS_UP",
+    "DOM_VK_XF86XK_KBD_LIGHT_ON_OFF",
+    "DOM_VK_XF86XK_LAUNCH0",
+    "DOM_VK_XF86XK_LAUNCH1",
+    "DOM_VK_XF86XK_LAUNCH2",
+    "DOM_VK_XF86XK_LAUNCH3",
+    "DOM_VK_XF86XK_LAUNCH4",
+    "DOM_VK_XF86XK_LAUNCH5",
+    "DOM_VK_XF86XK_LAUNCH6",
+    "DOM_VK_XF86XK_LAUNCH7",
+    "DOM_VK_XF86XK_LAUNCH8",
+    "DOM_VK_XF86XK_LAUNCH9",
+    "DOM_VK_XF86XK_LAUNCH_A",
+    "DOM_VK_XF86XK_LAUNCH_B",
+    "DOM_VK_XF86XK_LAUNCH_C",
+    "DOM_VK_XF86XK_LAUNCH_D",
+    "DOM_VK_XF86XK_LAUNCH_E",
+    "DOM_VK_XF86XK_LAUNCH_F",
+    "DOM_VK_XF86XK_LIGHT_BULB",
+    "DOM_VK_XF86XK_LOG_OFF",
+    "DOM_VK_XF86XK_MAIL",
+    "DOM_VK_XF86XK_MAIL_FORWARD",
+    "DOM_VK_XF86XK_MARKET",
+    "DOM_VK_XF86XK_MEETING",
+    "DOM_VK_XF86XK_MEMO",
+    "DOM_VK_XF86XK_MENU_KB",
+    "DOM_VK_XF86XK_MENU_PB",
+    "DOM_VK_XF86XK_MESSENGER",
+    "DOM_VK_XF86XK_MON_BRIGHTNESS_DOWN",
+    "DOM_VK_XF86XK_MON_BRIGHTNESS_UP",
+    "DOM_VK_XF86XK_MUSIC",
+    "DOM_VK_XF86XK_MY_COMPUTER",
+    "DOM_VK_XF86XK_MY_SITES",
+    "DOM_VK_XF86XK_NEW",
+    "DOM_VK_XF86XK_NEWS",
+    "DOM_VK_XF86XK_OFFICE_HOME",
+    "DOM_VK_XF86XK_OPEN",
+    "DOM_VK_XF86XK_OPEN_URL",
+    "DOM_VK_XF86XK_OPTION",
+    "DOM_VK_XF86XK_PASTE",
+    "DOM_VK_XF86XK_PHONE",
+    "DOM_VK_XF86XK_PICTURES",
+    "DOM_VK_XF86XK_POWER_DOWN",
+    "DOM_VK_XF86XK_POWER_OFF",
+    "DOM_VK_XF86XK_RED",
+    "DOM_VK_XF86XK_REFRESH",
+    "DOM_VK_XF86XK_RELOAD",
+    "DOM_VK_XF86XK_REPLY",
+    "DOM_VK_XF86XK_ROCKER_DOWN",
+    "DOM_VK_XF86XK_ROCKER_ENTER",
+    "DOM_VK_XF86XK_ROCKER_UP",
+    "DOM_VK_XF86XK_ROTATE_WINDOWS",
+    "DOM_VK_XF86XK_ROTATION_KB",
+    "DOM_VK_XF86XK_ROTATION_PB",
+    "DOM_VK_XF86XK_SAVE",
+    "DOM_VK_XF86XK_SCREEN_SAVER",
+    "DOM_VK_XF86XK_SCROLL_CLICK",
+    "DOM_VK_XF86XK_SCROLL_DOWN",
+    "DOM_VK_XF86XK_SCROLL_UP",
+    "DOM_VK_XF86XK_SEARCH",
+    "DOM_VK_XF86XK_SEND",
+    "DOM_VK_XF86XK_SHOP",
+    "DOM_VK_XF86XK_SPELL",
+    "DOM_VK_XF86XK_SPLIT_SCREEN",
+    "DOM_VK_XF86XK_STANDBY",
+    "DOM_VK_XF86XK_START",
+    "DOM_VK_XF86XK_STOP",
+    "DOM_VK_XF86XK_SUBTITLE",
+    "DOM_VK_XF86XK_SUPPORT",
+    "DOM_VK_XF86XK_SUSPEND",
+    "DOM_VK_XF86XK_TASK_PANE",
+    "DOM_VK_XF86XK_TERMINAL",
+    "DOM_VK_XF86XK_TIME",
+    "DOM_VK_XF86XK_TOOLS",
+    "DOM_VK_XF86XK_TOP_MENU",
+    "DOM_VK_XF86XK_TO_DO_LIST",
+    "DOM_VK_XF86XK_TRAVEL",
+    "DOM_VK_XF86XK_USER1KB",
+    "DOM_VK_XF86XK_USER2KB",
+    "DOM_VK_XF86XK_USER_PB",
+    "DOM_VK_XF86XK_UWB",
+    "DOM_VK_XF86XK_VENDOR_HOME",
+    "DOM_VK_XF86XK_VIDEO",
+    "DOM_VK_XF86XK_VIEW",
+    "DOM_VK_XF86XK_WAKE_UP",
+    "DOM_VK_XF86XK_WEB_CAM",
+    "DOM_VK_XF86XK_WHEEL_BUTTON",
+    "DOM_VK_XF86XK_WLAN",
+    "DOM_VK_XF86XK_WORD",
+    "DOM_VK_XF86XK_WWW",
+    "DOM_VK_XF86XK_XFER",
+    "DOM_VK_XF86XK_YELLOW",
+    "DOM_VK_XF86XK_ZOOM_IN",
+    "DOM_VK_XF86XK_ZOOM_OUT",
+    "DOM_VK_Y",
+    "DOM_VK_Z",
+    "DOM_VK_ZOOM",
+    "DONE",
+    "DONT_CARE",
+    "DOWNLOADING",
+    "DRAGDROP",
+    "DRAW_BUFFER0",
+    "DRAW_BUFFER1",
+    "DRAW_BUFFER10",
+    "DRAW_BUFFER11",
+    "DRAW_BUFFER12",
+    "DRAW_BUFFER13",
+    "DRAW_BUFFER14",
+    "DRAW_BUFFER15",
+    "DRAW_BUFFER2",
+    "DRAW_BUFFER3",
+    "DRAW_BUFFER4",
+    "DRAW_BUFFER5",
+    "DRAW_BUFFER6",
+    "DRAW_BUFFER7",
+    "DRAW_BUFFER8",
+    "DRAW_BUFFER9",
+    "DRAW_FRAMEBUFFER",
+    "DRAW_FRAMEBUFFER_BINDING",
+    "DST_ALPHA",
+    "DST_COLOR",
+    "DYNAMIC_COPY",
+    "DYNAMIC_DRAW",
+    "DYNAMIC_READ",
+    "DataChannel",
+    "DataTransfer",
+    "DataTransferItem",
+    "DataTransferItemList",
+    "DataView",
+    "Date",
+    "DateTimeFormat",
+    "DecompressionStream",
+    "DelayNode",
+    "DeprecationReportBody",
+    "DesktopNotification",
+    "DesktopNotificationCenter",
+    "DeviceLightEvent",
+    "DeviceMotionEvent",
+    "DeviceMotionEventAcceleration",
+    "DeviceMotionEventRotationRate",
+    "DeviceOrientationEvent",
+    "DeviceProximityEvent",
+    "DeviceStorage",
+    "DeviceStorageChangeEvent",
+    "Directory",
+    "DisplayNames",
+    "Document",
+    "DocumentFragment",
+    "DocumentTimeline",
+    "DocumentType",
+    "DragEvent",
+    "DynamicsCompressorNode",
+    "E",
+    "ELEMENT_ARRAY_BUFFER",
+    "ELEMENT_ARRAY_BUFFER_BINDING",
+    "ELEMENT_NODE",
+    "EMPTY",
+    "ENCODING_ERR",
+    "ENDED",
+    "END_TO_END",
+    "END_TO_START",
+    "ENTITY_NODE",
+    "ENTITY_REFERENCE_NODE",
+    "EPSILON",
+    "EQUAL",
+    "EQUALPOWER",
+    "ERROR",
+    "EXPONENTIAL_DISTANCE",
+    "Element",
+    "ElementInternals",
+    "ElementQuery",
+    "EnterPictureInPictureEvent",
+    "Entity",
+    "EntityReference",
+    "Error",
+    "ErrorEvent",
+    "EvalError",
+    "Event",
+    "EventException",
+    "EventSource",
+    "EventTarget",
+    "External",
+    "FASTEST",
+    "FIDOSDK",
+    "FILTER_ACCEPT",
+    "FILTER_INTERRUPT",
+    "FILTER_REJECT",
+    "FILTER_SKIP",
+    "FINISHED_STATE",
+    "FIRST_ORDERED_NODE_TYPE",
+    "FLOAT",
+    "FLOAT_32_UNSIGNED_INT_24_8_REV",
+    "FLOAT_MAT2",
+    "FLOAT_MAT2x3",
+    "FLOAT_MAT2x4",
+    "FLOAT_MAT3",
+    "FLOAT_MAT3x2",
+    "FLOAT_MAT3x4",
+    "FLOAT_MAT4",
+    "FLOAT_MAT4x2",
+    "FLOAT_MAT4x3",
+    "FLOAT_VEC2",
+    "FLOAT_VEC3",
+    "FLOAT_VEC4",
+    "FOCUS",
+    "FONT_FACE_RULE",
+    "FONT_FEATURE_VALUES_RULE",
+    "FRAGMENT_SHADER",
+    "FRAGMENT_SHADER_DERIVATIVE_HINT",
+    "FRAGMENT_SHADER_DERIVATIVE_HINT_OES",
+    "FRAMEBUFFER",
+    "FRAMEBUFFER_ATTACHMENT_ALPHA_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_BLUE_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_COLOR_ENCODING",
+    "FRAMEBUFFER_ATTACHMENT_COMPONENT_TYPE",
+    "FRAMEBUFFER_ATTACHMENT_DEPTH_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_GREEN_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_OBJECT_NAME",
+    "FRAMEBUFFER_ATTACHMENT_OBJECT_TYPE",
+    "FRAMEBUFFER_ATTACHMENT_RED_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_STENCIL_SIZE",
+    "FRAMEBUFFER_ATTACHMENT_TEXTURE_CUBE_MAP_FACE",
+    "FRAMEBUFFER_ATTACHMENT_TEXTURE_LAYER",
+    "FRAMEBUFFER_ATTACHMENT_TEXTURE_LEVEL",
+    "FRAMEBUFFER_BINDING",
+    "FRAMEBUFFER_COMPLETE",
+    "FRAMEBUFFER_DEFAULT",
+    "FRAMEBUFFER_INCOMPLETE_ATTACHMENT",
+    "FRAMEBUFFER_INCOMPLETE_DIMENSIONS",
+    "FRAMEBUFFER_INCOMPLETE_MISSING_ATTACHMENT",
+    "FRAMEBUFFER_INCOMPLETE_MULTISAMPLE",
+    "FRAMEBUFFER_UNSUPPORTED",
+    "FRONT",
+    "FRONT_AND_BACK",
+    "FRONT_FACE",
+    "FUNC_ADD",
+    "FUNC_REVERSE_SUBTRACT",
+    "FUNC_SUBTRACT",
+    "FeaturePolicy",
+    "FeaturePolicyViolationReportBody",
+    "FederatedCredential",
+    "Feed",
+    "FeedEntry",
+    "File",
+    "FileError",
+    "FileList",
+    "FileReader",
+    "FileSystem",
+    "FileSystemDirectoryEntry",
+    "FileSystemDirectoryReader",
+    "FileSystemEntry",
+    "FileSystemFileEntry",
+    "FinalizationRegistry",
+    "FindInPage",
+    "Float32Array",
+    "Float64Array",
+    "FocusEvent",
+    "FontFace",
+    "FontFaceSet",
+    "FontFaceSetLoadEvent",
+    "FormData",
+    "FormDataEvent",
+    "FragmentDirective",
+    "Function",
+    "GENERATE_MIPMAP_HINT",
+    "GEQUAL",
+    "GREATER",
+    "GREEN_BITS",
+    "GainNode",
+    "Gamepad",
+    "GamepadAxisMoveEvent",
+    "GamepadButton",
+    "GamepadButtonEvent",
+    "GamepadEvent",
+    "GamepadHapticActuator",
+    "GamepadPose",
+    "Geolocation",
+    "GeolocationCoordinates",
+    "GeolocationPosition",
+    "GeolocationPositionError",
+    "GestureEvent",
+    "Global",
+    "Gyroscope",
+    "HALF_FLOAT",
+    "HAVE_CURRENT_DATA",
+    "HAVE_ENOUGH_DATA",
+    "HAVE_FUTURE_DATA",
+    "HAVE_METADATA",
+    "HAVE_NOTHING",
+    "HEADERS_RECEIVED",
+    "HIDDEN",
+    "HIERARCHY_REQUEST_ERR",
+    "HIGHPASS",
+    "HIGHSHELF",
+    "HIGH_FLOAT",
+    "HIGH_INT",
+    "HORIZONTAL",
+    "HORIZONTAL_AXIS",
+    "HRTF",
+    "HTMLAllCollection",
+    "HTMLAnchorElement",
+    "HTMLAppletElement",
+    "HTMLAreaElement",
+    "HTMLAudioElement",
+    "HTMLBRElement",
+    "HTMLBaseElement",
+    "HTMLBaseFontElement",
+    "HTMLBlockquoteElement",
+    "HTMLBodyElement",
+    "HTMLButtonElement",
+    "HTMLCanvasElement",
+    "HTMLCollection",
+    "HTMLCommandElement",
+    "HTMLContentElement",
+    "HTMLDListElement",
+    "HTMLDataElement",
+    "HTMLDataListElement",
+    "HTMLDetailsElement",
+    "HTMLDialogElement",
+    "HTMLDirectoryElement",
+    "HTMLDivElement",
+    "HTMLDocument",
+    "HTMLElement",
+    "HTMLEmbedElement",
+    "HTMLFieldSetElement",
+    "HTMLFontElement",
+    "HTMLFormControlsCollection",
+    "HTMLFormElement",
+    "HTMLFrameElement",
+    "HTMLFrameSetElement",
+    "HTMLHRElement",
+    "HTMLHeadElement",
+    "HTMLHeadingElement",
+    "HTMLHtmlElement",
+    "HTMLIFrameElement",
+    "HTMLImageElement",
+    "HTMLInputElement",
+    "HTMLIsIndexElement",
+    "HTMLKeygenElement",
+    "HTMLLIElement",
+    "HTMLLabelElement",
+    "HTMLLegendElement",
+    "HTMLLinkElement",
+    "HTMLMapElement",
+    "HTMLMarqueeElement",
+    "HTMLMediaElement",
+    "HTMLMenuElement",
+    "HTMLMenuItemElement",
+    "HTMLMetaElement",
+    "HTMLMeterElement",
+    "HTMLModElement",
+    "HTMLOListElement",
+    "HTMLObjectElement",
+    "HTMLOptGroupElement",
+    "HTMLOptionElement",
+    "HTMLOptionsCollection",
+    "HTMLOutputElement",
+    "HTMLParagraphElement",
+    "HTMLParamElement",
+    "HTMLPictureElement",
+    "HTMLPreElement",
+    "HTMLProgressElement",
+    "HTMLPropertiesCollection",
+    "HTMLQuoteElement",
+    "HTMLScriptElement",
+    "HTMLSelectElement",
+    "HTMLShadowElement",
+    "HTMLSlotElement",
+    "HTMLSourceElement",
+    "HTMLSpanElement",
+    "HTMLStyleElement",
+    "HTMLTableCaptionElement",
+    "HTMLTableCellElement",
+    "HTMLTableColElement",
+    "HTMLTableElement",
+    "HTMLTableRowElement",
+    "HTMLTableSectionElement",
+    "HTMLTemplateElement",
+    "HTMLTextAreaElement",
+    "HTMLTimeElement",
+    "HTMLTitleElement",
+    "HTMLTrackElement",
+    "HTMLUListElement",
+    "HTMLUnknownElement",
+    "HTMLVideoElement",
+    "HashChangeEvent",
+    "Headers",
+    "History",
+    "Hz",
+    "ICE_CHECKING",
+    "ICE_CLOSED",
+    "ICE_COMPLETED",
+    "ICE_CONNECTED",
+    "ICE_FAILED",
+    "ICE_GATHERING",
+    "ICE_WAITING",
+    "IDBCursor",
+    "IDBCursorWithValue",
+    "IDBDatabase",
+    "IDBDatabaseException",
+    "IDBFactory",
+    "IDBFileHandle",
+    "IDBFileRequest",
+    "IDBIndex",
+    "IDBKeyRange",
+    "IDBMutableFile",
+    "IDBObjectStore",
+    "IDBOpenDBRequest",
+    "IDBRequest",
+    "IDBTransaction",
+    "IDBVersionChangeEvent",
+    "IDLE",
+    "IIRFilterNode",
+    "IMPLEMENTATION_COLOR_READ_FORMAT",
+    "IMPLEMENTATION_COLOR_READ_TYPE",
+    "IMPORT_RULE",
+    "INCR",
+    "INCR_WRAP",
+    "INDEX_SIZE_ERR",
+    "INT",
+    "INTERLEAVED_ATTRIBS",
+    "INT_2_10_10_10_REV",
+    "INT_SAMPLER_2D",
+    "INT_SAMPLER_2D_ARRAY",
+    "INT_SAMPLER_3D",
+    "INT_SAMPLER_CUBE",
+    "INT_VEC2",
+    "INT_VEC3",
+    "INT_VEC4",
+    "INUSE_ATTRIBUTE_ERR",
+    "INVALID_ACCESS_ERR",
+    "INVALID_CHARACTER_ERR",
+    "INVALID_ENUM",
+    "INVALID_EXPRESSION_ERR",
+    "INVALID_FRAMEBUFFER_OPERATION",
+    "INVALID_INDEX",
+    "INVALID_MODIFICATION_ERR",
+    "INVALID_NODE_TYPE_ERR",
+    "INVALID_OPERATION",
+    "INVALID_STATE_ERR",
+    "INVALID_VALUE",
+    "INVERSE_DISTANCE",
+    "INVERT",
+    "IceCandidate",
+    "IdleDeadline",
+    "Image",
+    "ImageBitmap",
+    "ImageBitmapRenderingContext",
+    "ImageCapture",
+    "ImageData",
+    "Infinity",
+    "InputDeviceCapabilities",
+    "InputDeviceInfo",
+    "InputEvent",
+    "InputMethodContext",
+    "InstallTrigger",
+    "InstallTriggerImpl",
+    "Instance",
+    "Int16Array",
+    "Int32Array",
+    "Int8Array",
+    "Intent",
+    "InternalError",
+    "IntersectionObserver",
+    "IntersectionObserverEntry",
+    "Intl",
+    "IsSearchProviderInstalled",
+    "Iterator",
+    "JSON",
+    "KEEP",
+    "KEYDOWN",
+    "KEYFRAMES_RULE",
+    "KEYFRAME_RULE",
+    "KEYPRESS",
+    "KEYUP",
+    "KeyEvent",
+    "Keyboard",
+    "KeyboardEvent",
+    "KeyboardLayoutMap",
+    "KeyframeEffect",
+    "LENGTHADJUST_SPACING",
+    "LENGTHADJUST_SPACINGANDGLYPHS",
+    "LENGTHADJUST_UNKNOWN",
+    "LEQUAL",
+    "LESS",
+    "LINEAR",
+    "LINEAR_DISTANCE",
+    "LINEAR_MIPMAP_LINEAR",
+    "LINEAR_MIPMAP_NEAREST",
+    "LINES",
+    "LINE_LOOP",
+    "LINE_STRIP",
+    "LINE_WIDTH",
+    "LINK_STATUS",
+    "LIVE",
+    "LN10",
+    "LN2",
+    "LOADED",
+    "LOADING",
+    "LOG10E",
+    "LOG2E",
+    "LOWPASS",
+    "LOWSHELF",
+    "LOW_FLOAT",
+    "LOW_INT",
+    "LSException",
+    "LSParserFilter",
+    "LUMINANCE",
+    "LUMINANCE_ALPHA",
+    "LargestContentfulPaint",
+    "LayoutShift",
+    "LayoutShiftAttribution",
+    "LinearAccelerationSensor",
+    "LinkError",
+    "ListFormat",
+    "LocalMediaStream",
+    "Locale",
+    "Location",
+    "Lock",
+    "LockManager",
+    "MAX",
+    "MAX_3D_TEXTURE_SIZE",
+    "MAX_ARRAY_TEXTURE_LAYERS",
+    "MAX_CLIENT_WAIT_TIMEOUT_WEBGL",
+    "MAX_COLOR_ATTACHMENTS",
+    "MAX_COMBINED_FRAGMENT_UNIFORM_COMPONENTS",
+    "MAX_COMBINED_TEXTURE_IMAGE_UNITS",
+    "MAX_COMBINED_UNIFORM_BLOCKS",
+    "MAX_COMBINED_VERTEX_UNIFORM_COMPONENTS",
+    "MAX_CUBE_MAP_TEXTURE_SIZE",
+    "MAX_DRAW_BUFFERS",
+    "MAX_ELEMENTS_INDICES",
+    "MAX_ELEMENTS_VERTICES",
+    "MAX_ELEMENT_INDEX",
+    "MAX_FRAGMENT_INPUT_COMPONENTS",
+    "MAX_FRAGMENT_UNIFORM_BLOCKS",
+    "MAX_FRAGMENT_UNIFORM_COMPONENTS",
+    "MAX_FRAGMENT_UNIFORM_VECTORS",
+    "MAX_PROGRAM_TEXEL_OFFSET",
+    "MAX_RENDERBUFFER_SIZE",
+    "MAX_SAFE_INTEGER",
+    "MAX_SAMPLES",
+    "MAX_SERVER_WAIT_TIMEOUT",
+    "MAX_TEXTURE_IMAGE_UNITS",
+    "MAX_TEXTURE_LOD_BIAS",
+    "MAX_TEXTURE_MAX_ANISOTROPY_EXT",
+    "MAX_TEXTURE_SIZE",
+    "MAX_TRANSFORM_FEEDBACK_INTERLEAVED_COMPONENTS",
+    "MAX_TRANSFORM_FEEDBACK_SEPARATE_ATTRIBS",
+    "MAX_TRANSFORM_FEEDBACK_SEPARATE_COMPONENTS",
+    "MAX_UNIFORM_BLOCK_SIZE",
+    "MAX_UNIFORM_BUFFER_BINDINGS",
+    "MAX_VALUE",
+    "MAX_VARYING_COMPONENTS",
+    "MAX_VARYING_VECTORS",
+    "MAX_VERTEX_ATTRIBS",
+    "MAX_VERTEX_OUTPUT_COMPONENTS",
+    "MAX_VERTEX_TEXTURE_IMAGE_UNITS",
+    "MAX_VERTEX_UNIFORM_BLOCKS",
+    "MAX_VERTEX_UNIFORM_COMPONENTS",
+    "MAX_VERTEX_UNIFORM_VECTORS",
+    "MAX_VIEWPORT_DIMS",
+    "MEDIA_ERR_ABORTED",
+    "MEDIA_ERR_DECODE",
+    "MEDIA_ERR_ENCRYPTED",
+    "MEDIA_ERR_NETWORK",
+    "MEDIA_ERR_SRC_NOT_SUPPORTED",
+    "MEDIA_KEYERR_CLIENT",
+    "MEDIA_KEYERR_DOMAIN",
+    "MEDIA_KEYERR_HARDWARECHANGE",
+    "MEDIA_KEYERR_OUTPUT",
+    "MEDIA_KEYERR_SERVICE",
+    "MEDIA_KEYERR_UNKNOWN",
+    "MEDIA_RULE",
+    "MEDIUM_FLOAT",
+    "MEDIUM_INT",
+    "META_MASK",
+    "MIDIAccess",
+    "MIDIConnectionEvent",
+    "MIDIInput",
+    "MIDIInputMap",
+    "MIDIMessageEvent",
+    "MIDIOutput",
+    "MIDIOutputMap",
+    "MIDIPort",
+    "MIN",
+    "MIN_PROGRAM_TEXEL_OFFSET",
+    "MIN_SAFE_INTEGER",
+    "MIN_VALUE",
+    "MIRRORED_REPEAT",
+    "MODE_ASYNCHRONOUS",
+    "MODE_SYNCHRONOUS",
+    "MODIFICATION",
+    "MOUSEDOWN",
+    "MOUSEDRAG",
+    "MOUSEMOVE",
+    "MOUSEOUT",
+    "MOUSEOVER",
+    "MOUSEUP",
+    "MOZ_KEYFRAMES_RULE",
+    "MOZ_KEYFRAME_RULE",
+    "MOZ_SOURCE_CURSOR",
+    "MOZ_SOURCE_ERASER",
+    "MOZ_SOURCE_KEYBOARD",
+    "MOZ_SOURCE_MOUSE",
+    "MOZ_SOURCE_PEN",
+    "MOZ_SOURCE_TOUCH",
+    "MOZ_SOURCE_UNKNOWN",
+    "MSGESTURE_FLAG_BEGIN",
+    "MSGESTURE_FLAG_CANCEL",
+    "MSGESTURE_FLAG_END",
+    "MSGESTURE_FLAG_INERTIA",
+    "MSGESTURE_FLAG_NONE",
+    "MSPOINTER_TYPE_MOUSE",
+    "MSPOINTER_TYPE_PEN",
+    "MSPOINTER_TYPE_TOUCH",
+    "MS_ASYNC_CALLBACK_STATUS_ASSIGN_DELEGATE",
+    "MS_ASYNC_CALLBACK_STATUS_CANCEL",
+    "MS_ASYNC_CALLBACK_STATUS_CHOOSEANY",
+    "MS_ASYNC_CALLBACK_STATUS_ERROR",
+    "MS_ASYNC_CALLBACK_STATUS_JOIN",
+    "MS_ASYNC_OP_STATUS_CANCELED",
+    "MS_ASYNC_OP_STATUS_ERROR",
+    "MS_ASYNC_OP_STATUS_SUCCESS",
+    "MS_MANIPULATION_STATE_ACTIVE",
+    "MS_MANIPULATION_STATE_CANCELLED",
+    "MS_MANIPULATION_STATE_COMMITTED",
+    "MS_MANIPULATION_STATE_DRAGGING",
+    "MS_MANIPULATION_STATE_INERTIA",
+    "MS_MANIPULATION_STATE_PRESELECT",
+    "MS_MANIPULATION_STATE_SELECTING",
+    "MS_MANIPULATION_STATE_STOPPED",
+    "MS_MEDIA_ERR_ENCRYPTED",
+    "MS_MEDIA_KEYERR_CLIENT",
+    "MS_MEDIA_KEYERR_DOMAIN",
+    "MS_MEDIA_KEYERR_HARDWARECHANGE",
+    "MS_MEDIA_KEYERR_OUTPUT",
+    "MS_MEDIA_KEYERR_SERVICE",
+    "MS_MEDIA_KEYERR_UNKNOWN",
+    "Map",
+    "Math",
+    "MathMLElement",
+    "MediaCapabilities",
+    "MediaCapabilitiesInfo",
+    "MediaController",
+    "MediaDeviceInfo",
+    "MediaDevices",
+    "MediaElementAudioSourceNode",
+    "MediaEncryptedEvent",
+    "MediaError",
+    "MediaKeyError",
+    "MediaKeyEvent",
+    "MediaKeyMessageEvent",
+    "MediaKeyNeededEvent",
+    "MediaKeySession",
+    "MediaKeyStatusMap",
+    "MediaKeySystemAccess",
+    "MediaKeys",
+    "MediaList",
+    "MediaMetadata",
+    "MediaQueryList",
+    "MediaQueryListEvent",
+    "MediaRecorder",
+    "MediaRecorderErrorEvent",
+    "MediaSession",
+    "MediaSettingsRange",
+    "MediaSource",
+    "MediaStream",
+    "MediaStreamAudioDestinationNode",
+    "MediaStreamAudioSourceNode",
+    "MediaStreamEvent",
+    "MediaStreamTrack",
+    "MediaStreamTrackAudioSourceNode",
+    "MediaStreamTrackEvent",
+    "Memory",
+    "MessageChannel",
+    "MessageEvent",
+    "MessagePort",
+    "Methods",
+    "MimeType",
+    "MimeTypeArray",
+    "Module",
+    "MouseEvent",
+    "MouseScrollEvent",
+    "MozAnimation",
+    "MozAnimationDelay",
+    "MozAnimationDirection",
+    "MozAnimationDuration",
+    "MozAnimationFillMode",
+    "MozAnimationIterationCount",
+    "MozAnimationName",
+    "MozAnimationPlayState",
+    "MozAnimationTimingFunction",
+    "MozAppearance",
+    "MozBackfaceVisibility",
+    "MozBinding",
+    "MozBorderBottomColors",
+    "MozBorderEnd",
+    "MozBorderEndColor",
+    "MozBorderEndStyle",
+    "MozBorderEndWidth",
+    "MozBorderImage",
+    "MozBorderLeftColors",
+    "MozBorderRightColors",
+    "MozBorderStart",
+    "MozBorderStartColor",
+    "MozBorderStartStyle",
+    "MozBorderStartWidth",
+    "MozBorderTopColors",
+    "MozBoxAlign",
+    "MozBoxDirection",
+    "MozBoxFlex",
+    "MozBoxOrdinalGroup",
+    "MozBoxOrient",
+    "MozBoxPack",
+    "MozBoxSizing",
+    "MozCSSKeyframeRule",
+    "MozCSSKeyframesRule",
+    "MozColumnCount",
+    "MozColumnFill",
+    "MozColumnGap",
+    "MozColumnRule",
+    "MozColumnRuleColor",
+    "MozColumnRuleStyle",
+    "MozColumnRuleWidth",
+    "MozColumnWidth",
+    "MozColumns",
+    "MozContactChangeEvent",
+    "MozFloatEdge",
+    "MozFontFeatureSettings",
+    "MozFontLanguageOverride",
+    "MozForceBrokenImageIcon",
+    "MozHyphens",
+    "MozImageRegion",
+    "MozMarginEnd",
+    "MozMarginStart",
+    "MozMmsEvent",
+    "MozMmsMessage",
+    "MozMobileMessageThread",
+    "MozOSXFontSmoothing",
+    "MozOrient",
+    "MozOsxFontSmoothing",
+    "MozOutlineRadius",
+    "MozOutlineRadiusBottomleft",
+    "MozOutlineRadiusBottomright",
+    "MozOutlineRadiusTopleft",
+    "MozOutlineRadiusTopright",
+    "MozPaddingEnd",
+    "MozPaddingStart",
+    "MozPerspective",
+    "MozPerspectiveOrigin",
+    "MozPowerManager",
+    "MozSettingsEvent",
+    "MozSmsEvent",
+    "MozSmsMessage",
+    "MozStackSizing",
+    "MozTabSize",
+    "MozTextAlignLast",
+    "MozTextDecorationColor",
+    "MozTextDecorationLine",
+    "MozTextDecorationStyle",
+    "MozTextSizeAdjust",
+    "MozTransform",
+    "MozTransformOrigin",
+    "MozTransformStyle",
+    "MozTransition",
+    "MozTransitionDelay",
+    "MozTransitionDuration",
+    "MozTransitionProperty",
+    "MozTransitionTimingFunction",
+    "MozUserFocus",
+    "MozUserInput",
+    "MozUserModify",
+    "MozUserSelect",
+    "MozWindowDragging",
+    "MozWindowShadow",
+    "MutationEvent",
+    "MutationObserver",
+    "MutationRecord",
+    "NAMESPACE_ERR",
+    "NAMESPACE_RULE",
+    "NEAREST",
+    "NEAREST_MIPMAP_LINEAR",
+    "NEAREST_MIPMAP_NEAREST",
+    "NEGATIVE_INFINITY",
+    "NETWORK_EMPTY",
+    "NETWORK_ERR",
+    "NETWORK_IDLE",
+    "NETWORK_LOADED",
+    "NETWORK_LOADING",
+    "NETWORK_NO_SOURCE",
+    "NEVER",
+    "NEW",
+    "NEXT",
+    "NEXT_NO_DUPLICATE",
+    "NICEST",
+    "NODE_AFTER",
+    "NODE_BEFORE",
+    "NODE_BEFORE_AND_AFTER",
+    "NODE_INSIDE",
+    "NONE",
+    "NON_TRANSIENT_ERR",
+    "NOTATION_NODE",
+    "NOTCH",
+    "NOTEQUAL",
+    "NOT_ALLOWED_ERR",
+    "NOT_FOUND_ERR",
+    "NOT_READABLE_ERR",
+    "NOT_SUPPORTED_ERR",
+    "NO_DATA_ALLOWED_ERR",
+    "NO_ERR",
+    "NO_ERROR",
+    "NO_MODIFICATION_ALLOWED_ERR",
+    "NUMBER_TYPE",
+    "NUM_COMPRESSED_TEXTURE_FORMATS",
+    "NaN",
+    "NamedNodeMap",
+    "NavigationPreloadManager",
+    "Navigator",
+    "NearbyLinks",
+    "NetworkInformation",
+    "Node",
+    "NodeFilter",
+    "NodeIterator",
+    "NodeList",
+    "Notation",
+    "Notification",
+    "NotifyPaintEvent",
+    "Number",
+    "NumberFormat",
+    "OBJECT_TYPE",
+    "OBSOLETE",
+    "OK",
+    "ONE",
+    "ONE_MINUS_CONSTANT_ALPHA",
+    "ONE_MINUS_CONSTANT_COLOR",
+    "ONE_MINUS_DST_ALPHA",
+    "ONE_MINUS_DST_COLOR",
+    "ONE_MINUS_SRC_ALPHA",
+    "ONE_MINUS_SRC_COLOR",
+    "OPEN",
+    "OPENED",
+    "OPENING",
+    "ORDERED_NODE_ITERATOR_TYPE",
+    "ORDERED_NODE_SNAPSHOT_TYPE",
+    "OTHER_ERROR",
+    "OUT_OF_MEMORY",
+    "Object",
+    "OfflineAudioCompletionEvent",
+    "OfflineAudioContext",
+    "OfflineResourceList",
+    "OffscreenCanvas",
+    "OffscreenCanvasRenderingContext2D",
+    "Option",
+    "OrientationSensor",
+    "OscillatorNode",
+    "OverconstrainedError",
+    "OverflowEvent",
+    "PACK_ALIGNMENT",
+    "PACK_ROW_LENGTH",
+    "PACK_SKIP_PIXELS",
+    "PACK_SKIP_ROWS",
+    "PAGE_RULE",
+    "PARSE_ERR",
+    "PATHSEG_ARC_ABS",
+    "PATHSEG_ARC_REL",
+    "PATHSEG_CLOSEPATH",
+    "PATHSEG_CURVETO_CUBIC_ABS",
+    "PATHSEG_CURVETO_CUBIC_REL",
+    "PATHSEG_CURVETO_CUBIC_SMOOTH_ABS",
+    "PATHSEG_CURVETO_CUBIC_SMOOTH_REL",
+    "PATHSEG_CURVETO_QUADRATIC_ABS",
+    "PATHSEG_CURVETO_QUADRATIC_REL",
+    "PATHSEG_CURVETO_QUADRATIC_SMOOTH_ABS",
+    "PATHSEG_CURVETO_QUADRATIC_SMOOTH_REL",
+    "PATHSEG_LINETO_ABS",
+    "PATHSEG_LINETO_HORIZONTAL_ABS",
+    "PATHSEG_LINETO_HORIZONTAL_REL",
+    "PATHSEG_LINETO_REL",
+    "PATHSEG_LINETO_VERTICAL_ABS",
+    "PATHSEG_LINETO_VERTICAL_REL",
+    "PATHSEG_MOVETO_ABS",
+    "PATHSEG_MOVETO_REL",
+    "PATHSEG_UNKNOWN",
+    "PATH_EXISTS_ERR",
+    "PEAKING",
+    "PERMISSION_DENIED",
+    "PERSISTENT",
+    "PI",
+    "PIXEL_PACK_BUFFER",
+    "PIXEL_PACK_BUFFER_BINDING",
+    "PIXEL_UNPACK_BUFFER",
+    "PIXEL_UNPACK_BUFFER_BINDING",
+    "PLAYING_STATE",
+    "POINTS",
+    "POLYGON_OFFSET_FACTOR",
+    "POLYGON_OFFSET_FILL",
+    "POLYGON_OFFSET_UNITS",
+    "POSITION_UNAVAILABLE",
+    "POSITIVE_INFINITY",
+    "PREV",
+    "PREV_NO_DUPLICATE",
+    "PROCESSING_INSTRUCTION_NODE",
+    "PageChangeEvent",
+    "PageTransitionEvent",
+    "PaintRequest",
+    "PaintRequestList",
+    "PannerNode",
+    "PasswordCredential",
+    "Path2D",
+    "PaymentAddress",
+    "PaymentInstruments",
+    "PaymentManager",
+    "PaymentMethodChangeEvent",
+    "PaymentRequest",
+    "PaymentRequestUpdateEvent",
+    "PaymentResponse",
+    "Performance",
+    "PerformanceElementTiming",
+    "PerformanceEntry",
+    "PerformanceEventTiming",
+    "PerformanceLongTaskTiming",
+    "PerformanceMark",
+    "PerformanceMeasure",
+    "PerformanceNavigation",
+    "PerformanceNavigationTiming",
+    "PerformanceObserver",
+    "PerformanceObserverEntryList",
+    "PerformancePaintTiming",
+    "PerformanceResourceTiming",
+    "PerformanceServerTiming",
+    "PerformanceTiming",
+    "PeriodicSyncManager",
+    "PeriodicWave",
+    "PermissionStatus",
+    "Permissions",
+    "PhotoCapabilities",
+    "PictureInPictureWindow",
+    "Plugin",
+    "PluginArray",
+    "PluralRules",
+    "PointerEvent",
+    "PopStateEvent",
+    "PopupBlockedEvent",
+    "Presentation",
+    "PresentationAvailability",
+    "PresentationConnection",
+    "PresentationConnectionAvailableEvent",
+    "PresentationConnectionCloseEvent",
+    "PresentationConnectionList",
+    "PresentationReceiver",
+    "PresentationRequest",
+    "ProcessingInstruction",
+    "ProgressEvent",
+    "Promise",
+    "PromiseRejectionEvent",
+    "PropertyNodeList",
+    "Proxy",
+    "PublicKeyCredential",
+    "PushManager",
+    "PushSubscription",
+    "PushSubscriptionOptions",
+    "Q",
+    "QUERY_RESULT",
+    "QUERY_RESULT_AVAILABLE",
+    "QUOTA_ERR",
+    "QUOTA_EXCEEDED_ERR",
+    "QueryInterface",
+    "R11F_G11F_B10F",
+    "R16F",
+    "R16I",
+    "R16UI",
+    "R32F",
+    "R32I",
+    "R32UI",
+    "R8",
+    "R8I",
+    "R8UI",
+    "R8_SNORM",
+    "RASTERIZER_DISCARD",
+    "READ_BUFFER",
+    "READ_FRAMEBUFFER",
+    "READ_FRAMEBUFFER_BINDING",
+    "READ_ONLY",
+    "READ_ONLY_ERR",
+    "READ_WRITE",
+    "RED",
+    "RED_BITS",
+    "RED_INTEGER",
+    "REMOVAL",
+    "RENDERBUFFER",
+    "RENDERBUFFER_ALPHA_SIZE",
+    "RENDERBUFFER_BINDING",
+    "RENDERBUFFER_BLUE_SIZE",
+    "RENDERBUFFER_DEPTH_SIZE",
+    "RENDERBUFFER_GREEN_SIZE",
+    "RENDERBUFFER_HEIGHT",
+    "RENDERBUFFER_INTERNAL_FORMAT",
+    "RENDERBUFFER_RED_SIZE",
+    "RENDERBUFFER_SAMPLES",
+    "RENDERBUFFER_STENCIL_SIZE",
+    "RENDERBUFFER_WIDTH",
+    "RENDERER",
+    "RENDERING_INTENT_ABSOLUTE_COLORIMETRIC",
+    "RENDERING_INTENT_AUTO",
+    "RENDERING_INTENT_PERCEPTUAL",
+    "RENDERING_INTENT_RELATIVE_COLORIMETRIC",
+    "RENDERING_INTENT_SATURATION",
+    "RENDERING_INTENT_UNKNOWN",
+    "REPEAT",
+    "REPLACE",
+    "RG",
+    "RG16F",
+    "RG16I",
+    "RG16UI",
+    "RG32F",
+    "RG32I",
+    "RG32UI",
+    "RG8",
+    "RG8I",
+    "RG8UI",
+    "RG8_SNORM",
+    "RGB",
+    "RGB10_A2",
+    "RGB10_A2UI",
+    "RGB16F",
+    "RGB16I",
+    "RGB16UI",
+    "RGB32F",
+    "RGB32I",
+    "RGB32UI",
+    "RGB565",
+    "RGB5_A1",
+    "RGB8",
+    "RGB8I",
+    "RGB8UI",
+    "RGB8_SNORM",
+    "RGB9_E5",
+    "RGBA",
+    "RGBA16F",
+    "RGBA16I",
+    "RGBA16UI",
+    "RGBA32F",
+    "RGBA32I",
+    "RGBA32UI",
+    "RGBA4",
+    "RGBA8",
+    "RGBA8I",
+    "RGBA8UI",
+    "RGBA8_SNORM",
+    "RGBA_INTEGER",
+    "RGBColor",
+    "RGB_INTEGER",
+    "RG_INTEGER",
+    "ROTATION_CLOCKWISE",
+    "ROTATION_COUNTERCLOCKWISE",
+    "RTCCertificate",
+    "RTCDTMFSender",
+    "RTCDTMFToneChangeEvent",
+    "RTCDataChannel",
+    "RTCDataChannelEvent",
+    "RTCDtlsTransport",
+    "RTCError",
+    "RTCErrorEvent",
+    "RTCIceCandidate",
+    "RTCIceTransport",
+    "RTCPeerConnection",
+    "RTCPeerConnectionIceErrorEvent",
+    "RTCPeerConnectionIceEvent",
+    "RTCRtpReceiver",
+    "RTCRtpSender",
+    "RTCRtpTransceiver",
+    "RTCSctpTransport",
+    "RTCSessionDescription",
+    "RTCStatsReport",
+    "RTCTrackEvent",
+    "RadioNodeList",
+    "Range",
+    "RangeError",
+    "RangeException",
+    "ReadableStream",
+    "ReadableStreamDefaultReader",
+    "RecordErrorEvent",
+    "Rect",
+    "ReferenceError",
+    "Reflect",
+    "RegExp",
+    "RelativeOrientationSensor",
+    "RelativeTimeFormat",
+    "RemotePlayback",
+    "Report",
+    "ReportBody",
+    "ReportingObserver",
+    "Request",
+    "ResizeObserver",
+    "ResizeObserverEntry",
+    "ResizeObserverSize",
+    "Response",
+    "RuntimeError",
+    "SAMPLER_2D",
+    "SAMPLER_2D_ARRAY",
+    "SAMPLER_2D_ARRAY_SHADOW",
+    "SAMPLER_2D_SHADOW",
+    "SAMPLER_3D",
+    "SAMPLER_BINDING",
+    "SAMPLER_CUBE",
+    "SAMPLER_CUBE_SHADOW",
+    "SAMPLES",
+    "SAMPLE_ALPHA_TO_COVERAGE",
+    "SAMPLE_BUFFERS",
+    "SAMPLE_COVERAGE",
+    "SAMPLE_COVERAGE_INVERT",
+    "SAMPLE_COVERAGE_VALUE",
+    "SAWTOOTH",
+    "SCHEDULED_STATE",
+    "SCISSOR_BOX",
+    "SCISSOR_TEST",
+    "SCROLL_PAGE_DOWN",
+    "SCROLL_PAGE_UP",
+    "SDP_ANSWER",
+    "SDP_OFFER",
+    "SDP_PRANSWER",
+    "SECURITY_ERR",
+    "SELECT",
+    "SEPARATE_ATTRIBS",
+    "SERIALIZE_ERR",
+    "SEVERITY_ERROR",
+    "SEVERITY_FATAL_ERROR",
+    "SEVERITY_WARNING",
+    "SHADER_COMPILER",
+    "SHADER_TYPE",
+    "SHADING_LANGUAGE_VERSION",
+    "SHIFT_MASK",
+    "SHORT",
+    "SHOWING",
+    "SHOW_ALL",
+    "SHOW_ATTRIBUTE",
+    "SHOW_CDATA_SECTION",
+    "SHOW_COMMENT",
+    "SHOW_DOCUMENT",
+    "SHOW_DOCUMENT_FRAGMENT",
+    "SHOW_DOCUMENT_TYPE",
+    "SHOW_ELEMENT",
+    "SHOW_ENTITY",
+    "SHOW_ENTITY_REFERENCE",
+    "SHOW_NOTATION",
+    "SHOW_PROCESSING_INSTRUCTION",
+    "SHOW_TEXT",
+    "SIGNALED",
+    "SIGNED_NORMALIZED",
+    "SINE",
+    "SOUNDFIELD",
+    "SQLException",
+    "SQRT1_2",
+    "SQRT2",
+    "SQUARE",
+    "SRC_ALPHA",
+    "SRC_ALPHA_SATURATE",
+    "SRC_COLOR",
+    "SRGB",
+    "SRGB8",
+    "SRGB8_ALPHA8",
+    "START_TO_END",
+    "START_TO_START",
+    "STATIC_COPY",
+    "STATIC_DRAW",
+    "STATIC_READ",
+    "STENCIL",
+    "STENCIL_ATTACHMENT",
+    "STENCIL_BACK_FAIL",
+    "STENCIL_BACK_FUNC",
+    "STENCIL_BACK_PASS_DEPTH_FAIL",
+    "STENCIL_BACK_PASS_DEPTH_PASS",
+    "STENCIL_BACK_REF",
+    "STENCIL_BACK_VALUE_MASK",
+    "STENCIL_BACK_WRITEMASK",
+    "STENCIL_BITS",
+    "STENCIL_BUFFER_BIT",
+    "STENCIL_CLEAR_VALUE",
+    "STENCIL_FAIL",
+    "STENCIL_FUNC",
+    "STENCIL_INDEX",
+    "STENCIL_INDEX8",
+    "STENCIL_PASS_DEPTH_FAIL",
+    "STENCIL_PASS_DEPTH_PASS",
+    "STENCIL_REF",
+    "STENCIL_TEST",
+    "STENCIL_VALUE_MASK",
+    "STENCIL_WRITEMASK",
+    "STREAM_COPY",
+    "STREAM_DRAW",
+    "STREAM_READ",
+    "STRING_TYPE",
+    "STYLE_RULE",
+    "SUBPIXEL_BITS",
+    "SUPPORTS_RULE",
+    "SVGAElement",
+    "SVGAltGlyphDefElement",
+    "SVGAltGlyphElement",
+    "SVGAltGlyphItemElement",
+    "SVGAngle",
+    "SVGAnimateColorElement",
+    "SVGAnimateElement",
+    "SVGAnimateMotionElement",
+    "SVGAnimateTransformElement",
+    "SVGAnimatedAngle",
+    "SVGAnimatedBoolean",
+    "SVGAnimatedEnumeration",
+    "SVGAnimatedInteger",
+    "SVGAnimatedLength",
+    "SVGAnimatedLengthList",
+    "SVGAnimatedNumber",
+    "SVGAnimatedNumberList",
+    "SVGAnimatedPreserveAspectRatio",
+    "SVGAnimatedRect",
+    "SVGAnimatedString",
+    "SVGAnimatedTransformList",
+    "SVGAnimationElement",
+    "SVGCircleElement",
+    "SVGClipPathElement",
+    "SVGColor",
+    "SVGComponentTransferFunctionElement",
+    "SVGCursorElement",
+    "SVGDefsElement",
+    "SVGDescElement",
+    "SVGDiscardElement",
+    "SVGDocument",
+    "SVGElement",
+    "SVGElementInstance",
+    "SVGElementInstanceList",
+    "SVGEllipseElement",
+    "SVGException",
+    "SVGFEBlendElement",
+    "SVGFEColorMatrixElement",
+    "SVGFEComponentTransferElement",
+    "SVGFECompositeElement",
+    "SVGFEConvolveMatrixElement",
+    "SVGFEDiffuseLightingElement",
+    "SVGFEDisplacementMapElement",
+    "SVGFEDistantLightElement",
+    "SVGFEDropShadowElement",
+    "SVGFEFloodElement",
+    "SVGFEFuncAElement",
+    "SVGFEFuncBElement",
+    "SVGFEFuncGElement",
+    "SVGFEFuncRElement",
+    "SVGFEGaussianBlurElement",
+    "SVGFEImageElement",
+    "SVGFEMergeElement",
+    "SVGFEMergeNodeElement",
+    "SVGFEMorphologyElement",
+    "SVGFEOffsetElement",
+    "SVGFEPointLightElement",
+    "SVGFESpecularLightingElement",
+    "SVGFESpotLightElement",
+    "SVGFETileElement",
+    "SVGFETurbulenceElement",
+    "SVGFilterElement",
+    "SVGFontElement",
+    "SVGFontFaceElement",
+    "SVGFontFaceFormatElement",
+    "SVGFontFaceNameElement",
+    "SVGFontFaceSrcElement",
+    "SVGFontFaceUriElement",
+    "SVGForeignObjectElement",
+    "SVGGElement",
+    "SVGGeometryElement",
+    "SVGGlyphElement",
+    "SVGGlyphRefElement",
+    "SVGGradientElement",
+    "SVGGraphicsElement",
+    "SVGHKernElement",
+    "SVGImageElement",
+    "SVGLength",
+    "SVGLengthList",
+    "SVGLineElement",
+    "SVGLinearGradientElement",
+    "SVGMPathElement",
+    "SVGMarkerElement",
+    "SVGMaskElement",
+    "SVGMatrix",
+    "SVGMetadataElement",
+    "SVGMissingGlyphElement",
+    "SVGNumber",
+    "SVGNumberList",
+    "SVGPaint",
+    "SVGPathElement",
+    "SVGPathSeg",
+    "SVGPathSegArcAbs",
+    "SVGPathSegArcRel",
+    "SVGPathSegClosePath",
+    "SVGPathSegCurvetoCubicAbs",
+    "SVGPathSegCurvetoCubicRel",
+    "SVGPathSegCurvetoCubicSmoothAbs",
+    "SVGPathSegCurvetoCubicSmoothRel",
+    "SVGPathSegCurvetoQuadraticAbs",
+    "SVGPathSegCurvetoQuadraticRel",
+    "SVGPathSegCurvetoQuadraticSmoothAbs",
+    "SVGPathSegCurvetoQuadraticSmoothRel",
+    "SVGPathSegLinetoAbs",
+    "SVGPathSegLinetoHorizontalAbs",
+    "SVGPathSegLinetoHorizontalRel",
+    "SVGPathSegLinetoRel",
+    "SVGPathSegLinetoVerticalAbs",
+    "SVGPathSegLinetoVerticalRel",
+    "SVGPathSegList",
+    "SVGPathSegMovetoAbs",
+    "SVGPathSegMovetoRel",
+    "SVGPatternElement",
+    "SVGPoint",
+    "SVGPointList",
+    "SVGPolygonElement",
+    "SVGPolylineElement",
+    "SVGPreserveAspectRatio",
+    "SVGRadialGradientElement",
+    "SVGRect",
+    "SVGRectElement",
+    "SVGRenderingIntent",
+    "SVGSVGElement",
+    "SVGScriptElement",
+    "SVGSetElement",
+    "SVGStopElement",
+    "SVGStringList",
+    "SVGStyleElement",
+    "SVGSwitchElement",
+    "SVGSymbolElement",
+    "SVGTRefElement",
+    "SVGTSpanElement",
+    "SVGTextContentElement",
+    "SVGTextElement",
+    "SVGTextPathElement",
+    "SVGTextPositioningElement",
+    "SVGTitleElement",
+    "SVGTransform",
+    "SVGTransformList",
+    "SVGUnitTypes",
+    "SVGUseElement",
+    "SVGVKernElement",
+    "SVGViewElement",
+    "SVGViewSpec",
+    "SVGZoomAndPan",
+    "SVGZoomEvent",
+    "SVG_ANGLETYPE_DEG",
+    "SVG_ANGLETYPE_GRAD",
+    "SVG_ANGLETYPE_RAD",
+    "SVG_ANGLETYPE_UNKNOWN",
+    "SVG_ANGLETYPE_UNSPECIFIED",
+    "SVG_CHANNEL_A",
+    "SVG_CHANNEL_B",
+    "SVG_CHANNEL_G",
+    "SVG_CHANNEL_R",
+    "SVG_CHANNEL_UNKNOWN",
+    "SVG_COLORTYPE_CURRENTCOLOR",
+    "SVG_COLORTYPE_RGBCOLOR",
+    "SVG_COLORTYPE_RGBCOLOR_ICCCOLOR",
+    "SVG_COLORTYPE_UNKNOWN",
+    "SVG_EDGEMODE_DUPLICATE",
+    "SVG_EDGEMODE_NONE",
+    "SVG_EDGEMODE_UNKNOWN",
+    "SVG_EDGEMODE_WRAP",
+    "SVG_FEBLEND_MODE_COLOR",
+    "SVG_FEBLEND_MODE_COLOR_BURN",
+    "SVG_FEBLEND_MODE_COLOR_DODGE",
+    "SVG_FEBLEND_MODE_DARKEN",
+    "SVG_FEBLEND_MODE_DIFFERENCE",
+    "SVG_FEBLEND_MODE_EXCLUSION",
+    "SVG_FEBLEND_MODE_HARD_LIGHT",
+    "SVG_FEBLEND_MODE_HUE",
+    "SVG_FEBLEND_MODE_LIGHTEN",
+    "SVG_FEBLEND_MODE_LUMINOSITY",
+    "SVG_FEBLEND_MODE_MULTIPLY",
+    "SVG_FEBLEND_MODE_NORMAL",
+    "SVG_FEBLEND_MODE_OVERLAY",
+    "SVG_FEBLEND_MODE_SATURATION",
+    "SVG_FEBLEND_MODE_SCREEN",
+    "SVG_FEBLEND_MODE_SOFT_LIGHT",
+    "SVG_FEBLEND_MODE_UNKNOWN",
+    "SVG_FECOLORMATRIX_TYPE_HUEROTATE",
+    "SVG_FECOLORMATRIX_TYPE_LUMINANCETOALPHA",
+    "SVG_FECOLORMATRIX_TYPE_MATRIX",
+    "SVG_FECOLORMATRIX_TYPE_SATURATE",
+    "SVG_FECOLORMATRIX_TYPE_UNKNOWN",
+    "SVG_FECOMPONENTTRANSFER_TYPE_DISCRETE",
+    "SVG_FECOMPONENTTRANSFER_TYPE_GAMMA",
+    "SVG_FECOMPONENTTRANSFER_TYPE_IDENTITY",
+    "SVG_FECOMPONENTTRANSFER_TYPE_LINEAR",
+    "SVG_FECOMPONENTTRANSFER_TYPE_TABLE",
+    "SVG_FECOMPONENTTRANSFER_TYPE_UNKNOWN",
+    "SVG_FECOMPOSITE_OPERATOR_ARITHMETIC",
+    "SVG_FECOMPOSITE_OPERATOR_ATOP",
+    "SVG_FECOMPOSITE_OPERATOR_IN",
+    "SVG_FECOMPOSITE_OPERATOR_OUT",
+    "SVG_FECOMPOSITE_OPERATOR_OVER",
+    "SVG_FECOMPOSITE_OPERATOR_UNKNOWN",
+    "SVG_FECOMPOSITE_OPERATOR_XOR",
+    "SVG_INVALID_VALUE_ERR",
+    "SVG_LENGTHTYPE_CM",
+    "SVG_LENGTHTYPE_EMS",
+    "SVG_LENGTHTYPE_EXS",
+    "SVG_LENGTHTYPE_IN",
+    "SVG_LENGTHTYPE_MM",
+    "SVG_LENGTHTYPE_NUMBER",
+    "SVG_LENGTHTYPE_PC",
+    "SVG_LENGTHTYPE_PERCENTAGE",
+    "SVG_LENGTHTYPE_PT",
+    "SVG_LENGTHTYPE_PX",
+    "SVG_LENGTHTYPE_UNKNOWN",
+    "SVG_MARKERUNITS_STROKEWIDTH",
+    "SVG_MARKERUNITS_UNKNOWN",
+    "SVG_MARKERUNITS_USERSPACEONUSE",
+    "SVG_MARKER_ORIENT_ANGLE",
+    "SVG_MARKER_ORIENT_AUTO",
+    "SVG_MARKER_ORIENT_UNKNOWN",
+    "SVG_MASKTYPE_ALPHA",
+    "SVG_MASKTYPE_LUMINANCE",
+    "SVG_MATRIX_NOT_INVERTABLE",
+    "SVG_MEETORSLICE_MEET",
+    "SVG_MEETORSLICE_SLICE",
+    "SVG_MEETORSLICE_UNKNOWN",
+    "SVG_MORPHOLOGY_OPERATOR_DILATE",
+    "SVG_MORPHOLOGY_OPERATOR_ERODE",
+    "SVG_MORPHOLOGY_OPERATOR_UNKNOWN",
+    "SVG_PAINTTYPE_CURRENTCOLOR",
+    "SVG_PAINTTYPE_NONE",
+    "SVG_PAINTTYPE_RGBCOLOR",
+    "SVG_PAINTTYPE_RGBCOLOR_ICCCOLOR",
+    "SVG_PAINTTYPE_UNKNOWN",
+    "SVG_PAINTTYPE_URI",
+    "SVG_PAINTTYPE_URI_CURRENTCOLOR",
+    "SVG_PAINTTYPE_URI_NONE",
+    "SVG_PAINTTYPE_URI_RGBCOLOR",
+    "SVG_PAINTTYPE_URI_RGBCOLOR_ICCCOLOR",
+    "SVG_PRESERVEASPECTRATIO_NONE",
+    "SVG_PRESERVEASPECTRATIO_UNKNOWN",
+    "SVG_PRESERVEASPECTRATIO_XMAXYMAX",
+    "SVG_PRESERVEASPECTRATIO_XMAXYMID",
+    "SVG_PRESERVEASPECTRATIO_XMAXYMIN",
+    "SVG_PRESERVEASPECTRATIO_XMIDYMAX",
+    "SVG_PRESERVEASPECTRATIO_XMIDYMID",
+    "SVG_PRESERVEASPECTRATIO_XMIDYMIN",
+    "SVG_PRESERVEASPECTRATIO_XMINYMAX",
+    "SVG_PRESERVEASPECTRATIO_XMINYMID",
+    "SVG_PRESERVEASPECTRATIO_XMINYMIN",
+    "SVG_SPREADMETHOD_PAD",
+    "SVG_SPREADMETHOD_REFLECT",
+    "SVG_SPREADMETHOD_REPEAT",
+    "SVG_SPREADMETHOD_UNKNOWN",
+    "SVG_STITCHTYPE_NOSTITCH",
+    "SVG_STITCHTYPE_STITCH",
+    "SVG_STITCHTYPE_UNKNOWN",
+    "SVG_TRANSFORM_MATRIX",
+    "SVG_TRANSFORM_ROTATE",
+    "SVG_TRANSFORM_SCALE",
+    "SVG_TRANSFORM_SKEWX",
+    "SVG_TRANSFORM_SKEWY",
+    "SVG_TRANSFORM_TRANSLATE",
+    "SVG_TRANSFORM_UNKNOWN",
+    "SVG_TURBULENCE_TYPE_FRACTALNOISE",
+    "SVG_TURBULENCE_TYPE_TURBULENCE",
+    "SVG_TURBULENCE_TYPE_UNKNOWN",
+    "SVG_UNIT_TYPE_OBJECTBOUNDINGBOX",
+    "SVG_UNIT_TYPE_UNKNOWN",
+    "SVG_UNIT_TYPE_USERSPACEONUSE",
+    "SVG_WRONG_TYPE_ERR",
+    "SVG_ZOOMANDPAN_DISABLE",
+    "SVG_ZOOMANDPAN_MAGNIFY",
+    "SVG_ZOOMANDPAN_UNKNOWN",
+    "SYNC_CONDITION",
+    "SYNC_FENCE",
+    "SYNC_FLAGS",
+    "SYNC_FLUSH_COMMANDS_BIT",
+    "SYNC_GPU_COMMANDS_COMPLETE",
+    "SYNC_STATUS",
+    "SYNTAX_ERR",
+    "SavedPages",
+    "Screen",
+    "ScreenOrientation",
+    "Script",
+    "ScriptProcessorNode",
+    "ScrollAreaEvent",
+    "SecurityPolicyViolationEvent",
+    "Selection",
+    "Sensor",
+    "SensorErrorEvent",
+    "ServiceWorker",
+    "ServiceWorkerContainer",
+    "ServiceWorkerRegistration",
+    "SessionDescription",
+    "Set",
+    "ShadowRoot",
+    "SharedArrayBuffer",
+    "SharedWorker",
+    "SimpleGestureEvent",
+    "SourceBuffer",
+    "SourceBufferList",
+    "SpeechSynthesis",
+    "SpeechSynthesisErrorEvent",
+    "SpeechSynthesisEvent",
+    "SpeechSynthesisUtterance",
+    "SpeechSynthesisVoice",
+    "StaticRange",
+    "StereoPannerNode",
+    "StopIteration",
+    "Storage",
+    "StorageEvent",
+    "StorageManager",
+    "String",
+    "StructType",
+    "StylePropertyMap",
+    "StylePropertyMapReadOnly",
+    "StyleSheet",
+    "StyleSheetList",
+    "SubmitEvent",
+    "SubtleCrypto",
+    "Symbol",
+    "SyncManager",
+    "SyntaxError",
+    "TEMPORARY",
+    "TEXTPATH_METHODTYPE_ALIGN",
+    "TEXTPATH_METHODTYPE_STRETCH",
+    "TEXTPATH_METHODTYPE_UNKNOWN",
+    "TEXTPATH_SPACINGTYPE_AUTO",
+    "TEXTPATH_SPACINGTYPE_EXACT",
+    "TEXTPATH_SPACINGTYPE_UNKNOWN",
+    "TEXTURE",
+    "TEXTURE0",
+    "TEXTURE1",
+    "TEXTURE10",
+    "TEXTURE11",
+    "TEXTURE12",
+    "TEXTURE13",
+    "TEXTURE14",
+    "TEXTURE15",
+    "TEXTURE16",
+    "TEXTURE17",
+    "TEXTURE18",
+    "TEXTURE19",
+    "TEXTURE2",
+    "TEXTURE20",
+    "TEXTURE21",
+    "TEXTURE22",
+    "TEXTURE23",
+    "TEXTURE24",
+    "TEXTURE25",
+    "TEXTURE26",
+    "TEXTURE27",
+    "TEXTURE28",
+    "TEXTURE29",
+    "TEXTURE3",
+    "TEXTURE30",
+    "TEXTURE31",
+    "TEXTURE4",
+    "TEXTURE5",
+    "TEXTURE6",
+    "TEXTURE7",
+    "TEXTURE8",
+    "TEXTURE9",
+    "TEXTURE_2D",
+    "TEXTURE_2D_ARRAY",
+    "TEXTURE_3D",
+    "TEXTURE_BASE_LEVEL",
+    "TEXTURE_BINDING_2D",
+    "TEXTURE_BINDING_2D_ARRAY",
+    "TEXTURE_BINDING_3D",
+    "TEXTURE_BINDING_CUBE_MAP",
+    "TEXTURE_COMPARE_FUNC",
+    "TEXTURE_COMPARE_MODE",
+    "TEXTURE_CUBE_MAP",
+    "TEXTURE_CUBE_MAP_NEGATIVE_X",
+    "TEXTURE_CUBE_MAP_NEGATIVE_Y",
+    "TEXTURE_CUBE_MAP_NEGATIVE_Z",
+    "TEXTURE_CUBE_MAP_POSITIVE_X",
+    "TEXTURE_CUBE_MAP_POSITIVE_Y",
+    "TEXTURE_CUBE_MAP_POSITIVE_Z",
+    "TEXTURE_IMMUTABLE_FORMAT",
+    "TEXTURE_IMMUTABLE_LEVELS",
+    "TEXTURE_MAG_FILTER",
+    "TEXTURE_MAX_ANISOTROPY_EXT",
+    "TEXTURE_MAX_LEVEL",
+    "TEXTURE_MAX_LOD",
+    "TEXTURE_MIN_FILTER",
+    "TEXTURE_MIN_LOD",
+    "TEXTURE_WRAP_R",
+    "TEXTURE_WRAP_S",
+    "TEXTURE_WRAP_T",
+    "TEXT_NODE",
+    "TIMEOUT",
+    "TIMEOUT_ERR",
+    "TIMEOUT_EXPIRED",
+    "TIMEOUT_IGNORED",
+    "TOO_LARGE_ERR",
+    "TRANSACTION_INACTIVE_ERR",
+    "TRANSFORM_FEEDBACK",
+    "TRANSFORM_FEEDBACK_ACTIVE",
+    "TRANSFORM_FEEDBACK_BINDING",
+    "TRANSFORM_FEEDBACK_BUFFER",
+    "TRANSFORM_FEEDBACK_BUFFER_BINDING",
+    "TRANSFORM_FEEDBACK_BUFFER_MODE",
+    "TRANSFORM_FEEDBACK_BUFFER_SIZE",
+    "TRANSFORM_FEEDBACK_BUFFER_START",
+    "TRANSFORM_FEEDBACK_PAUSED",
+    "TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN",
+    "TRANSFORM_FEEDBACK_VARYINGS",
+    "TRIANGLE",
+    "TRIANGLES",
+    "TRIANGLE_FAN",
+    "TRIANGLE_STRIP",
+    "TYPE_BACK_FORWARD",
+    "TYPE_ERR",
+    "TYPE_MISMATCH_ERR",
+    "TYPE_NAVIGATE",
+    "TYPE_RELOAD",
+    "TYPE_RESERVED",
+    "Table",
+    "TaskAttributionTiming",
+    "Text",
+    "TextDecoder",
+    "TextDecoderStream",
+    "TextEncoder",
+    "TextEncoderStream",
+    "TextEvent",
+    "TextMetrics",
+    "TextTrack",
+    "TextTrackCue",
+    "TextTrackCueList",
+    "TextTrackList",
+    "TimeEvent",
+    "TimeRanges",
+    "Touch",
+    "TouchEvent",
+    "TouchList",
+    "TrackEvent",
+    "TransformStream",
+    "TransitionEvent",
+    "TreeWalker",
+    "TrustedHTML",
+    "TrustedScript",
+    "TrustedScriptURL",
+    "TrustedTypePolicy",
+    "TrustedTypePolicyFactory",
+    "TypeError",
+    "TypedObject",
+    "U2F",
+    "UIEvent",
+    "UNCACHED",
+    "UNIFORM_ARRAY_STRIDE",
+    "UNIFORM_BLOCK_ACTIVE_UNIFORMS",
+    "UNIFORM_BLOCK_ACTIVE_UNIFORM_INDICES",
+    "UNIFORM_BLOCK_BINDING",
+    "UNIFORM_BLOCK_DATA_SIZE",
+    "UNIFORM_BLOCK_INDEX",
+    "UNIFORM_BLOCK_REFERENCED_BY_FRAGMENT_SHADER",
+    "UNIFORM_BLOCK_REFERENCED_BY_VERTEX_SHADER",
+    "UNIFORM_BUFFER",
+    "UNIFORM_BUFFER_BINDING",
+    "UNIFORM_BUFFER_OFFSET_ALIGNMENT",
+    "UNIFORM_BUFFER_SIZE",
+    "UNIFORM_BUFFER_START",
+    "UNIFORM_IS_ROW_MAJOR",
+    "UNIFORM_MATRIX_STRIDE",
+    "UNIFORM_OFFSET",
+    "UNIFORM_SIZE",
+    "UNIFORM_TYPE",
+    "UNKNOWN_ERR",
+    "UNKNOWN_RULE",
+    "UNMASKED_RENDERER_WEBGL",
+    "UNMASKED_VENDOR_WEBGL",
+    "UNORDERED_NODE_ITERATOR_TYPE",
+    "UNORDERED_NODE_SNAPSHOT_TYPE",
+    "UNPACK_ALIGNMENT",
+    "UNPACK_COLORSPACE_CONVERSION_WEBGL",
+    "UNPACK_FLIP_Y_WEBGL",
+    "UNPACK_IMAGE_HEIGHT",
+    "UNPACK_PREMULTIPLY_ALPHA_WEBGL",
+    "UNPACK_ROW_LENGTH",
+    "UNPACK_SKIP_IMAGES",
+    "UNPACK_SKIP_PIXELS",
+    "UNPACK_SKIP_ROWS",
+    "UNSCHEDULED_STATE",
+    "UNSENT",
+    "UNSIGNALED",
+    "UNSIGNED_BYTE",
+    "UNSIGNED_INT",
+    "UNSIGNED_INT_10F_11F_11F_REV",
+    "UNSIGNED_INT_24_8",
+    "UNSIGNED_INT_2_10_10_10_REV",
+    "UNSIGNED_INT_5_9_9_9_REV",
+    "UNSIGNED_INT_SAMPLER_2D",
+    "UNSIGNED_INT_SAMPLER_2D_ARRAY",
+    "UNSIGNED_INT_SAMPLER_3D",
+    "UNSIGNED_INT_SAMPLER_CUBE",
+    "UNSIGNED_INT_VEC2",
+    "UNSIGNED_INT_VEC3",
+    "UNSIGNED_INT_VEC4",
+    "UNSIGNED_NORMALIZED",
+    "UNSIGNED_SHORT",
+    "UNSIGNED_SHORT_4_4_4_4",
+    "UNSIGNED_SHORT_5_5_5_1",
+    "UNSIGNED_SHORT_5_6_5",
+    "UNSPECIFIED_EVENT_TYPE_ERR",
+    "UPDATEREADY",
+    "URIError",
+    "URL",
+    "URLSearchParams",
+    "URLUnencoded",
+    "URL_MISMATCH_ERR",
+    "USB",
+    "USBAlternateInterface",
+    "USBConfiguration",
+    "USBConnectionEvent",
+    "USBDevice",
+    "USBEndpoint",
+    "USBInTransferResult",
+    "USBInterface",
+    "USBIsochronousInTransferPacket",
+    "USBIsochronousInTransferResult",
+    "USBIsochronousOutTransferPacket",
+    "USBIsochronousOutTransferResult",
+    "USBOutTransferResult",
+    "UTC",
+    "Uint16Array",
+    "Uint32Array",
+    "Uint8Array",
+    "Uint8ClampedArray",
+    "UserActivation",
+    "UserMessageHandler",
+    "UserMessageHandlersNamespace",
+    "UserProximityEvent",
+    "VALIDATE_STATUS",
+    "VALIDATION_ERR",
+    "VARIABLES_RULE",
+    "VENDOR",
+    "VERSION",
+    "VERSION_CHANGE",
+    "VERSION_ERR",
+    "VERTEX_ARRAY_BINDING",
+    "VERTEX_ATTRIB_ARRAY_BUFFER_BINDING",
+    "VERTEX_ATTRIB_ARRAY_DIVISOR",
+    "VERTEX_ATTRIB_ARRAY_DIVISOR_ANGLE",
+    "VERTEX_ATTRIB_ARRAY_ENABLED",
+    "VERTEX_ATTRIB_ARRAY_INTEGER",
+    "VERTEX_ATTRIB_ARRAY_NORMALIZED",
+    "VERTEX_ATTRIB_ARRAY_POINTER",
+    "VERTEX_ATTRIB_ARRAY_SIZE",
+    "VERTEX_ATTRIB_ARRAY_STRIDE",
+    "VERTEX_ATTRIB_ARRAY_TYPE",
+    "VERTEX_SHADER",
+    "VERTICAL",
+    "VERTICAL_AXIS",
+    "VER_ERR",
+    "VIEWPORT",
+    "VIEWPORT_RULE",
+    "VRDisplay",
+    "VRDisplayCapabilities",
+    "VRDisplayEvent",
+    "VREyeParameters",
+    "VRFieldOfView",
+    "VRFrameData",
+    "VRPose",
+    "VRStageParameters",
+    "VTTCue",
+    "VTTRegion",
+    "ValidityState",
+    "VideoPlaybackQuality",
+    "VideoStreamTrack",
+    "VisualViewport",
+    "WAIT_FAILED",
+    "WEBKIT_FILTER_RULE",
+    "WEBKIT_KEYFRAMES_RULE",
+    "WEBKIT_KEYFRAME_RULE",
+    "WEBKIT_REGION_RULE",
+    "WRONG_DOCUMENT_ERR",
+    "WakeLock",
+    "WakeLockSentinel",
+    "WasmAnyRef",
+    "WaveShaperNode",
+    "WeakMap",
+    "WeakRef",
+    "WeakSet",
+    "WebAssembly",
+    "WebGL2RenderingContext",
+    "WebGLActiveInfo",
+    "WebGLBuffer",
+    "WebGLContextEvent",
+    "WebGLFramebuffer",
+    "WebGLProgram",
+    "WebGLQuery",
+    "WebGLRenderbuffer",
+    "WebGLRenderingContext",
+    "WebGLSampler",
+    "WebGLShader",
+    "WebGLShaderPrecisionFormat",
+    "WebGLSync",
+    "WebGLTexture",
+    "WebGLTransformFeedback",
+    "WebGLUniformLocation",
+    "WebGLVertexArray",
+    "WebGLVertexArrayObject",
+    "WebKitAnimationEvent",
+    "WebKitBlobBuilder",
+    "WebKitCSSFilterRule",
+    "WebKitCSSFilterValue",
+    "WebKitCSSKeyframeRule",
+    "WebKitCSSKeyframesRule",
+    "WebKitCSSMatrix",
+    "WebKitCSSRegionRule",
+    "WebKitCSSTransformValue",
+    "WebKitDataCue",
+    "WebKitGamepad",
+    "WebKitMediaKeyError",
+    "WebKitMediaKeyMessageEvent",
+    "WebKitMediaKeySession",
+    "WebKitMediaKeys",
+    "WebKitMediaSource",
+    "WebKitMutationObserver",
+    "WebKitNamespace",
+    "WebKitPlaybackTargetAvailabilityEvent",
+    "WebKitPoint",
+    "WebKitShadowRoot",
+    "WebKitSourceBuffer",
+    "WebKitSourceBufferList",
+    "WebKitTransitionEvent",
+    "WebSocket",
+    "WebkitAlignContent",
+    "WebkitAlignItems",
+    "WebkitAlignSelf",
+    "WebkitAnimation",
+    "WebkitAnimationDelay",
+    "WebkitAnimationDirection",
+    "WebkitAnimationDuration",
+    "WebkitAnimationFillMode",
+    "WebkitAnimationIterationCount",
+    "WebkitAnimationName",
+    "WebkitAnimationPlayState",
+    "WebkitAnimationTimingFunction",
+    "WebkitAppearance",
+    "WebkitBackfaceVisibility",
+    "WebkitBackgroundClip",
+    "WebkitBackgroundOrigin",
+    "WebkitBackgroundSize",
+    "WebkitBorderBottomLeftRadius",
+    "WebkitBorderBottomRightRadius",
+    "WebkitBorderImage",
+    "WebkitBorderRadius",
+    "WebkitBorderTopLeftRadius",
+    "WebkitBorderTopRightRadius",
+    "WebkitBoxAlign",
+    "WebkitBoxDirection",
+    "WebkitBoxFlex",
+    "WebkitBoxOrdinalGroup",
+    "WebkitBoxOrient",
+    "WebkitBoxPack",
+    "WebkitBoxShadow",
+    "WebkitBoxSizing",
+    "WebkitFilter",
+    "WebkitFlex",
+    "WebkitFlexBasis",
+    "WebkitFlexDirection",
+    "WebkitFlexFlow",
+    "WebkitFlexGrow",
+    "WebkitFlexShrink",
+    "WebkitFlexWrap",
+    "WebkitJustifyContent",
+    "WebkitLineClamp",
+    "WebkitMask",
+    "WebkitMaskClip",
+    "WebkitMaskComposite",
+    "WebkitMaskImage",
+    "WebkitMaskOrigin",
+    "WebkitMaskPosition",
+    "WebkitMaskPositionX",
+    "WebkitMaskPositionY",
+    "WebkitMaskRepeat",
+    "WebkitMaskSize",
+    "WebkitOrder",
+    "WebkitPerspective",
+    "WebkitPerspectiveOrigin",
+    "WebkitTextFillColor",
+    "WebkitTextSizeAdjust",
+    "WebkitTextStroke",
+    "WebkitTextStrokeColor",
+    "WebkitTextStrokeWidth",
+    "WebkitTransform",
+    "WebkitTransformOrigin",
+    "WebkitTransformStyle",
+    "WebkitTransition",
+    "WebkitTransitionDelay",
+    "WebkitTransitionDuration",
+    "WebkitTransitionProperty",
+    "WebkitTransitionTimingFunction",
+    "WebkitUserSelect",
+    "WheelEvent",
+    "Window",
+    "Worker",
+    "Worklet",
+    "WritableStream",
+    "WritableStreamDefaultWriter",
+    "XMLDocument",
+    "XMLHttpRequest",
+    "XMLHttpRequestEventTarget",
+    "XMLHttpRequestException",
+    "XMLHttpRequestProgressEvent",
+    "XMLHttpRequestUpload",
+    "XMLSerializer",
+    "XMLStylesheetProcessingInstruction",
+    "XPathEvaluator",
+    "XPathException",
+    "XPathExpression",
+    "XPathNSResolver",
+    "XPathResult",
+    "XRBoundedReferenceSpace",
+    "XRDOMOverlayState",
+    "XRFrame",
+    "XRHitTestResult",
+    "XRHitTestSource",
+    "XRInputSource",
+    "XRInputSourceArray",
+    "XRInputSourceEvent",
+    "XRInputSourcesChangeEvent",
+    "XRLayer",
+    "XRPose",
+    "XRRay",
+    "XRReferenceSpace",
+    "XRReferenceSpaceEvent",
+    "XRRenderState",
+    "XRRigidTransform",
+    "XRSession",
+    "XRSessionEvent",
+    "XRSpace",
+    "XRSystem",
+    "XRTransientInputHitTestResult",
+    "XRTransientInputHitTestSource",
+    "XRView",
+    "XRViewerPose",
+    "XRViewport",
+    "XRWebGLLayer",
+    "XSLTProcessor",
+    "ZERO",
+    "_XD0M_",
+    "_YD0M_",
+    "__defineGetter__",
+    "__defineSetter__",
+    "__lookupGetter__",
+    "__lookupSetter__",
+    "__opera",
+    "__proto__",
+    "_browserjsran",
+    "a",
+    "aLink",
+    "abbr",
+    "abort",
+    "aborted",
+    "abs",
+    "absolute",
+    "acceleration",
+    "accelerationIncludingGravity",
+    "accelerator",
+    "accept",
+    "acceptCharset",
+    "acceptNode",
+    "accessKey",
+    "accessKeyLabel",
+    "accuracy",
+    "acos",
+    "acosh",
+    "action",
+    "actionURL",
+    "actions",
+    "activated",
+    "active",
+    "activeCues",
+    "activeElement",
+    "activeSourceBuffers",
+    "activeSourceCount",
+    "activeTexture",
+    "activeVRDisplays",
+    "actualBoundingBoxAscent",
+    "actualBoundingBoxDescent",
+    "actualBoundingBoxLeft",
+    "actualBoundingBoxRight",
+    "add",
+    "addAll",
+    "addBehavior",
+    "addCandidate",
+    "addColorStop",
+    "addCue",
+    "addElement",
+    "addEventListener",
+    "addFilter",
+    "addFromString",
+    "addFromUri",
+    "addIceCandidate",
+    "addImport",
+    "addListener",
+    "addModule",
+    "addNamed",
+    "addPageRule",
+    "addPath",
+    "addPointer",
+    "addRange",
+    "addRegion",
+    "addRule",
+    "addSearchEngine",
+    "addSourceBuffer",
+    "addStream",
+    "addTextTrack",
+    "addTrack",
+    "addTransceiver",
+    "addWakeLockListener",
+    "added",
+    "addedNodes",
+    "additionalName",
+    "additiveSymbols",
+    "addons",
+    "address",
+    "addressLine",
+    "adoptNode",
+    "adoptedStyleSheets",
+    "adr",
+    "advance",
+    "after",
+    "album",
+    "alert",
+    "algorithm",
+    "align",
+    "align-content",
+    "align-items",
+    "align-self",
+    "alignContent",
+    "alignItems",
+    "alignSelf",
+    "alignmentBaseline",
+    "alinkColor",
+    "all",
+    "allSettled",
+    "allow",
+    "allowFullscreen",
+    "allowPaymentRequest",
+    "allowedDirections",
+    "allowedFeatures",
+    "allowedToPlay",
+    "allowsFeature",
+    "alpha",
+    "alt",
+    "altGraphKey",
+    "altHtml",
+    "altKey",
+    "altLeft",
+    "alternate",
+    "alternateSetting",
+    "alternates",
+    "altitude",
+    "altitudeAccuracy",
+    "amplitude",
+    "ancestorOrigins",
+    "anchor",
+    "anchorNode",
+    "anchorOffset",
+    "anchors",
+    "and",
+    "angle",
+    "angularAcceleration",
+    "angularVelocity",
+    "animVal",
+    "animate",
+    "animatedInstanceRoot",
+    "animatedNormalizedPathSegList",
+    "animatedPathSegList",
+    "animatedPoints",
+    "animation",
+    "animation-delay",
+    "animation-direction",
+    "animation-duration",
+    "animation-fill-mode",
+    "animation-iteration-count",
+    "animation-name",
+    "animation-play-state",
+    "animation-timing-function",
+    "animationDelay",
+    "animationDirection",
+    "animationDuration",
+    "animationFillMode",
+    "animationIterationCount",
+    "animationName",
+    "animationPlayState",
+    "animationStartTime",
+    "animationTimingFunction",
+    "animationsPaused",
+    "anniversary",
+    "antialias",
+    "anticipatedRemoval",
+    "any",
+    "app",
+    "appCodeName",
+    "appMinorVersion",
+    "appName",
+    "appNotifications",
+    "appVersion",
+    "appearance",
+    "append",
+    "appendBuffer",
+    "appendChild",
+    "appendData",
+    "appendItem",
+    "appendMedium",
+    "appendNamed",
+    "appendRule",
+    "appendStream",
+    "appendWindowEnd",
+    "appendWindowStart",
+    "applets",
+    "applicationCache",
+    "applicationServerKey",
+    "apply",
+    "applyConstraints",
+    "applyElement",
+    "arc",
+    "arcTo",
+    "archive",
+    "areas",
+    "arguments",
+    "ariaAtomic",
+    "ariaAutoComplete",
+    "ariaBusy",
+    "ariaChecked",
+    "ariaColCount",
+    "ariaColIndex",
+    "ariaColSpan",
+    "ariaCurrent",
+    "ariaDescription",
+    "ariaDisabled",
+    "ariaExpanded",
+    "ariaHasPopup",
+    "ariaHidden",
+    "ariaKeyShortcuts",
+    "ariaLabel",
+    "ariaLevel",
+    "ariaLive",
+    "ariaModal",
+    "ariaMultiLine",
+    "ariaMultiSelectable",
+    "ariaOrientation",
+    "ariaPlaceholder",
+    "ariaPosInSet",
+    "ariaPressed",
+    "ariaReadOnly",
+    "ariaRelevant",
+    "ariaRequired",
+    "ariaRoleDescription",
+    "ariaRowCount",
+    "ariaRowIndex",
+    "ariaRowSpan",
+    "ariaSelected",
+    "ariaSetSize",
+    "ariaSort",
+    "ariaValueMax",
+    "ariaValueMin",
+    "ariaValueNow",
+    "ariaValueText",
+    "arrayBuffer",
+    "artist",
+    "artwork",
+    "as",
+    "asIntN",
+    "asUintN",
+    "asin",
+    "asinh",
+    "assert",
+    "assign",
+    "assignedElements",
+    "assignedNodes",
+    "assignedSlot",
+    "async",
+    "asyncIterator",
+    "atEnd",
+    "atan",
+    "atan2",
+    "atanh",
+    "atob",
+    "attachEvent",
+    "attachInternals",
+    "attachShader",
+    "attachShadow",
+    "attachments",
+    "attack",
+    "attestationObject",
+    "attrChange",
+    "attrName",
+    "attributeFilter",
+    "attributeName",
+    "attributeNamespace",
+    "attributeOldValue",
+    "attributeStyleMap",
+    "attributes",
+    "attribution",
+    "audioBitsPerSecond",
+    "audioTracks",
+    "audioWorklet",
+    "authenticatedSignedWrites",
+    "authenticatorData",
+    "autoIncrement",
+    "autobuffer",
+    "autocapitalize",
+    "autocomplete",
+    "autocorrect",
+    "autofocus",
+    "automationRate",
+    "autoplay",
+    "availHeight",
+    "availLeft",
+    "availTop",
+    "availWidth",
+    "availability",
+    "available",
+    "aversion",
+    "ax",
+    "axes",
+    "axis",
+    "ay",
+    "azimuth",
+    "b",
+    "back",
+    "backface-visibility",
+    "backfaceVisibility",
+    "background",
+    "background-attachment",
+    "background-blend-mode",
+    "background-clip",
+    "background-color",
+    "background-image",
+    "background-origin",
+    "background-position",
+    "background-position-x",
+    "background-position-y",
+    "background-repeat",
+    "background-size",
+    "backgroundAttachment",
+    "backgroundBlendMode",
+    "backgroundClip",
+    "backgroundColor",
+    "backgroundFetch",
+    "backgroundImage",
+    "backgroundOrigin",
+    "backgroundPosition",
+    "backgroundPositionX",
+    "backgroundPositionY",
+    "backgroundRepeat",
+    "backgroundSize",
+    "badInput",
+    "badge",
+    "balance",
+    "baseFrequencyX",
+    "baseFrequencyY",
+    "baseLatency",
+    "baseLayer",
+    "baseNode",
+    "baseOffset",
+    "baseURI",
+    "baseVal",
+    "baselineShift",
+    "battery",
+    "bday",
+    "before",
+    "beginElement",
+    "beginElementAt",
+    "beginPath",
+    "beginQuery",
+    "beginTransformFeedback",
+    "behavior",
+    "behaviorCookie",
+    "behaviorPart",
+    "behaviorUrns",
+    "beta",
+    "bezierCurveTo",
+    "bgColor",
+    "bgProperties",
+    "bias",
+    "big",
+    "bigint64",
+    "biguint64",
+    "binaryType",
+    "bind",
+    "bindAttribLocation",
+    "bindBuffer",
+    "bindBufferBase",
+    "bindBufferRange",
+    "bindFramebuffer",
+    "bindRenderbuffer",
+    "bindSampler",
+    "bindTexture",
+    "bindTransformFeedback",
+    "bindVertexArray",
+    "blendColor",
+    "blendEquation",
+    "blendEquationSeparate",
+    "blendFunc",
+    "blendFuncSeparate",
+    "blink",
+    "blitFramebuffer",
+    "blob",
+    "block-size",
+    "blockDirection",
+    "blockSize",
+    "blockedURI",
+    "blue",
+    "bluetooth",
+    "blur",
+    "body",
+    "bodyUsed",
+    "bold",
+    "bookmarks",
+    "booleanValue",
+    "border",
+    "border-block",
+    "border-block-color",
+    "border-block-end",
+    "border-block-end-color",
+    "border-block-end-style",
+    "border-block-end-width",
+    "border-block-start",
+    "border-block-start-color",
+    "border-block-start-style",
+    "border-block-start-width",
+    "border-block-style",
+    "border-block-width",
+    "border-bottom",
+    "border-bottom-color",
+    "border-bottom-left-radius",
+    "border-bottom-right-radius",
+    "border-bottom-style",
+    "border-bottom-width",
+    "border-collapse",
+    "border-color",
+    "border-end-end-radius",
+    "border-end-start-radius",
+    "border-image",
+    "border-image-outset",
+    "border-image-repeat",
+    "border-image-slice",
+    "border-image-source",
+    "border-image-width",
+    "border-inline",
+    "border-inline-color",
+    "border-inline-end",
+    "border-inline-end-color",
+    "border-inline-end-style",
+    "border-inline-end-width",
+    "border-inline-start",
+    "border-inline-start-color",
+    "border-inline-start-style",
+    "border-inline-start-width",
+    "border-inline-style",
+    "border-inline-width",
+    "border-left",
+    "border-left-color",
+    "border-left-style",
+    "border-left-width",
+    "border-radius",
+    "border-right",
+    "border-right-color",
+    "border-right-style",
+    "border-right-width",
+    "border-spacing",
+    "border-start-end-radius",
+    "border-start-start-radius",
+    "border-style",
+    "border-top",
+    "border-top-color",
+    "border-top-left-radius",
+    "border-top-right-radius",
+    "border-top-style",
+    "border-top-width",
+    "border-width",
+    "borderBlock",
+    "borderBlockColor",
+    "borderBlockEnd",
+    "borderBlockEndColor",
+    "borderBlockEndStyle",
+    "borderBlockEndWidth",
+    "borderBlockStart",
+    "borderBlockStartColor",
+    "borderBlockStartStyle",
+    "borderBlockStartWidth",
+    "borderBlockStyle",
+    "borderBlockWidth",
+    "borderBottom",
+    "borderBottomColor",
+    "borderBottomLeftRadius",
+    "borderBottomRightRadius",
+    "borderBottomStyle",
+    "borderBottomWidth",
+    "borderBoxSize",
+    "borderCollapse",
+    "borderColor",
+    "borderColorDark",
+    "borderColorLight",
+    "borderEndEndRadius",
+    "borderEndStartRadius",
+    "borderImage",
+    "borderImageOutset",
+    "borderImageRepeat",
+    "borderImageSlice",
+    "borderImageSource",
+    "borderImageWidth",
+    "borderInline",
+    "borderInlineColor",
+    "borderInlineEnd",
+    "borderInlineEndColor",
+    "borderInlineEndStyle",
+    "borderInlineEndWidth",
+    "borderInlineStart",
+    "borderInlineStartColor",
+    "borderInlineStartStyle",
+    "borderInlineStartWidth",
+    "borderInlineStyle",
+    "borderInlineWidth",
+    "borderLeft",
+    "borderLeftColor",
+    "borderLeftStyle",
+    "borderLeftWidth",
+    "borderRadius",
+    "borderRight",
+    "borderRightColor",
+    "borderRightStyle",
+    "borderRightWidth",
+    "borderSpacing",
+    "borderStartEndRadius",
+    "borderStartStartRadius",
+    "borderStyle",
+    "borderTop",
+    "borderTopColor",
+    "borderTopLeftRadius",
+    "borderTopRightRadius",
+    "borderTopStyle",
+    "borderTopWidth",
+    "borderWidth",
+    "bottom",
+    "bottomMargin",
+    "bound",
+    "boundElements",
+    "boundingClientRect",
+    "boundingHeight",
+    "boundingLeft",
+    "boundingTop",
+    "boundingWidth",
+    "bounds",
+    "boundsGeometry",
+    "box-decoration-break",
+    "box-shadow",
+    "box-sizing",
+    "boxDecorationBreak",
+    "boxShadow",
+    "boxSizing",
+    "break-after",
+    "break-before",
+    "break-inside",
+    "breakAfter",
+    "breakBefore",
+    "breakInside",
+    "broadcast",
+    "browserLanguage",
+    "btoa",
+    "bubbles",
+    "buffer",
+    "bufferData",
+    "bufferDepth",
+    "bufferSize",
+    "bufferSubData",
+    "buffered",
+    "bufferedAmount",
+    "bufferedAmountLowThreshold",
+    "buildID",
+    "buildNumber",
+    "button",
+    "buttonID",
+    "buttons",
+    "byteLength",
+    "byteOffset",
+    "bytesWritten",
+    "c",
+    "cache",
+    "caches",
+    "call",
+    "caller",
+    "canBeFormatted",
+    "canBeMounted",
+    "canBeShared",
+    "canHaveChildren",
+    "canHaveHTML",
+    "canInsertDTMF",
+    "canMakePayment",
+    "canPlayType",
+    "canPresent",
+    "canTrickleIceCandidates",
+    "cancel",
+    "cancelAndHoldAtTime",
+    "cancelAnimationFrame",
+    "cancelBubble",
+    "cancelIdleCallback",
+    "cancelScheduledValues",
+    "cancelVideoFrameCallback",
+    "cancelWatchAvailability",
+    "cancelable",
+    "candidate",
+    "canonicalUUID",
+    "canvas",
+    "capabilities",
+    "caption",
+    "caption-side",
+    "captionSide",
+    "capture",
+    "captureEvents",
+    "captureStackTrace",
+    "captureStream",
+    "caret-color",
+    "caretBidiLevel",
+    "caretColor",
+    "caretPositionFromPoint",
+    "caretRangeFromPoint",
+    "cast",
+    "catch",
+    "category",
+    "cbrt",
+    "cd",
+    "ceil",
+    "cellIndex",
+    "cellPadding",
+    "cellSpacing",
+    "cells",
+    "ch",
+    "chOff",
+    "chain",
+    "challenge",
+    "changeType",
+    "changedTouches",
+    "channel",
+    "channelCount",
+    "channelCountMode",
+    "channelInterpretation",
+    "char",
+    "charAt",
+    "charCode",
+    "charCodeAt",
+    "charIndex",
+    "charLength",
+    "characterData",
+    "characterDataOldValue",
+    "characterSet",
+    "characteristic",
+    "charging",
+    "chargingTime",
+    "charset",
+    "check",
+    "checkEnclosure",
+    "checkFramebufferStatus",
+    "checkIntersection",
+    "checkValidity",
+    "checked",
+    "childElementCount",
+    "childList",
+    "childNodes",
+    "children",
+    "chrome",
+    "ciphertext",
+    "cite",
+    "city",
+    "claimInterface",
+    "claimed",
+    "classList",
+    "className",
+    "classid",
+    "clear",
+    "clearAppBadge",
+    "clearAttributes",
+    "clearBufferfi",
+    "clearBufferfv",
+    "clearBufferiv",
+    "clearBufferuiv",
+    "clearColor",
+    "clearData",
+    "clearDepth",
+    "clearHalt",
+    "clearImmediate",
+    "clearInterval",
+    "clearLiveSeekableRange",
+    "clearMarks",
+    "clearMaxGCPauseAccumulator",
+    "clearMeasures",
+    "clearParameters",
+    "clearRect",
+    "clearResourceTimings",
+    "clearShadow",
+    "clearStencil",
+    "clearTimeout",
+    "clearWatch",
+    "click",
+    "clickCount",
+    "clientDataJSON",
+    "clientHeight",
+    "clientInformation",
+    "clientLeft",
+    "clientRect",
+    "clientRects",
+    "clientTop",
+    "clientWaitSync",
+    "clientWidth",
+    "clientX",
+    "clientY",
+    "clip",
+    "clip-path",
+    "clip-rule",
+    "clipBottom",
+    "clipLeft",
+    "clipPath",
+    "clipPathUnits",
+    "clipRight",
+    "clipRule",
+    "clipTop",
+    "clipboard",
+    "clipboardData",
+    "clone",
+    "cloneContents",
+    "cloneNode",
+    "cloneRange",
+    "close",
+    "closePath",
+    "closed",
+    "closest",
+    "clz",
+    "clz32",
+    "cm",
+    "cmp",
+    "code",
+    "codeBase",
+    "codePointAt",
+    "codeType",
+    "colSpan",
+    "collapse",
+    "collapseToEnd",
+    "collapseToStart",
+    "collapsed",
+    "collect",
+    "colno",
+    "color",
+    "color-adjust",
+    "color-interpolation",
+    "color-interpolation-filters",
+    "colorAdjust",
+    "colorDepth",
+    "colorInterpolation",
+    "colorInterpolationFilters",
+    "colorMask",
+    "colorType",
+    "cols",
+    "column-count",
+    "column-fill",
+    "column-gap",
+    "column-rule",
+    "column-rule-color",
+    "column-rule-style",
+    "column-rule-width",
+    "column-span",
+    "column-width",
+    "columnCount",
+    "columnFill",
+    "columnGap",
+    "columnNumber",
+    "columnRule",
+    "columnRuleColor",
+    "columnRuleStyle",
+    "columnRuleWidth",
+    "columnSpan",
+    "columnWidth",
+    "columns",
+    "command",
+    "commit",
+    "commitPreferences",
+    "commitStyles",
+    "commonAncestorContainer",
+    "compact",
+    "compareBoundaryPoints",
+    "compareDocumentPosition",
+    "compareEndPoints",
+    "compareExchange",
+    "compareNode",
+    "comparePoint",
+    "compatMode",
+    "compatible",
+    "compile",
+    "compileShader",
+    "compileStreaming",
+    "complete",
+    "component",
+    "componentFromPoint",
+    "composed",
+    "composedPath",
+    "composite",
+    "compositionEndOffset",
+    "compositionStartOffset",
+    "compressedTexImage2D",
+    "compressedTexImage3D",
+    "compressedTexSubImage2D",
+    "compressedTexSubImage3D",
+    "computedStyleMap",
+    "concat",
+    "conditionText",
+    "coneInnerAngle",
+    "coneOuterAngle",
+    "coneOuterGain",
+    "configuration",
+    "configurationName",
+    "configurationValue",
+    "configurations",
+    "confirm",
+    "confirmComposition",
+    "confirmSiteSpecificTrackingException",
+    "confirmWebWideTrackingException",
+    "connect",
+    "connectEnd",
+    "connectShark",
+    "connectStart",
+    "connected",
+    "connection",
+    "connectionList",
+    "connectionSpeed",
+    "connectionState",
+    "connections",
+    "console",
+    "consolidate",
+    "constraint",
+    "constrictionActive",
+    "construct",
+    "constructor",
+    "contactID",
+    "contain",
+    "containerId",
+    "containerName",
+    "containerSrc",
+    "containerType",
+    "contains",
+    "containsNode",
+    "content",
+    "contentBoxSize",
+    "contentDocument",
+    "contentEditable",
+    "contentHint",
+    "contentOverflow",
+    "contentRect",
+    "contentScriptType",
+    "contentStyleType",
+    "contentType",
+    "contentWindow",
+    "context",
+    "contextMenu",
+    "contextmenu",
+    "continue",
+    "continuePrimaryKey",
+    "continuous",
+    "control",
+    "controlTransferIn",
+    "controlTransferOut",
+    "controller",
+    "controls",
+    "controlsList",
+    "convertPointFromNode",
+    "convertQuadFromNode",
+    "convertRectFromNode",
+    "convertToBlob",
+    "convertToSpecifiedUnits",
+    "cookie",
+    "cookieEnabled",
+    "coords",
+    "copyBufferSubData",
+    "copyFromChannel",
+    "copyTexImage2D",
+    "copyTexSubImage2D",
+    "copyTexSubImage3D",
+    "copyToChannel",
+    "copyWithin",
+    "correspondingElement",
+    "correspondingUseElement",
+    "corruptedVideoFrames",
+    "cos",
+    "cosh",
+    "count",
+    "countReset",
+    "counter-increment",
+    "counter-reset",
+    "counter-set",
+    "counterIncrement",
+    "counterReset",
+    "counterSet",
+    "country",
+    "cpuClass",
+    "cpuSleepAllowed",
+    "create",
+    "createAnalyser",
+    "createAnswer",
+    "createAttribute",
+    "createAttributeNS",
+    "createBiquadFilter",
+    "createBuffer",
+    "createBufferSource",
+    "createCDATASection",
+    "createCSSStyleSheet",
+    "createCaption",
+    "createChannelMerger",
+    "createChannelSplitter",
+    "createComment",
+    "createConstantSource",
+    "createContextualFragment",
+    "createControlRange",
+    "createConvolver",
+    "createDTMFSender",
+    "createDataChannel",
+    "createDelay",
+    "createDelayNode",
+    "createDocument",
+    "createDocumentFragment",
+    "createDocumentType",
+    "createDynamicsCompressor",
+    "createElement",
+    "createElementNS",
+    "createEntityReference",
+    "createEvent",
+    "createEventObject",
+    "createExpression",
+    "createFramebuffer",
+    "createFunction",
+    "createGain",
+    "createGainNode",
+    "createHTML",
+    "createHTMLDocument",
+    "createIIRFilter",
+    "createImageBitmap",
+    "createImageData",
+    "createIndex",
+    "createJavaScriptNode",
+    "createLinearGradient",
+    "createMediaElementSource",
+    "createMediaKeys",
+    "createMediaStreamDestination",
+    "createMediaStreamSource",
+    "createMediaStreamTrackSource",
+    "createMutableFile",
+    "createNSResolver",
+    "createNodeIterator",
+    "createNotification",
+    "createObjectStore",
+    "createObjectURL",
+    "createOffer",
+    "createOscillator",
+    "createPanner",
+    "createPattern",
+    "createPeriodicWave",
+    "createPolicy",
+    "createPopup",
+    "createProcessingInstruction",
+    "createProgram",
+    "createQuery",
+    "createRadialGradient",
+    "createRange",
+    "createRangeCollection",
+    "createReader",
+    "createRenderbuffer",
+    "createSVGAngle",
+    "createSVGLength",
+    "createSVGMatrix",
+    "createSVGNumber",
+    "createSVGPathSegArcAbs",
+    "createSVGPathSegArcRel",
+    "createSVGPathSegClosePath",
+    "createSVGPathSegCurvetoCubicAbs",
+    "createSVGPathSegCurvetoCubicRel",
+    "createSVGPathSegCurvetoCubicSmoothAbs",
+    "createSVGPathSegCurvetoCubicSmoothRel",
+    "createSVGPathSegCurvetoQuadraticAbs",
+    "createSVGPathSegCurvetoQuadraticRel",
+    "createSVGPathSegCurvetoQuadraticSmoothAbs",
+    "createSVGPathSegCurvetoQuadraticSmoothRel",
+    "createSVGPathSegLinetoAbs",
+    "createSVGPathSegLinetoHorizontalAbs",
+    "createSVGPathSegLinetoHorizontalRel",
+    "createSVGPathSegLinetoRel",
+    "createSVGPathSegLinetoVerticalAbs",
+    "createSVGPathSegLinetoVerticalRel",
+    "createSVGPathSegMovetoAbs",
+    "createSVGPathSegMovetoRel",
+    "createSVGPoint",
+    "createSVGRect",
+    "createSVGTransform",
+    "createSVGTransformFromMatrix",
+    "createSampler",
+    "createScript",
+    "createScriptProcessor",
+    "createScriptURL",
+    "createSession",
+    "createShader",
+    "createShadowRoot",
+    "createStereoPanner",
+    "createStyleSheet",
+    "createTBody",
+    "createTFoot",
+    "createTHead",
+    "createTextNode",
+    "createTextRange",
+    "createTexture",
+    "createTouch",
+    "createTouchList",
+    "createTransformFeedback",
+    "createTreeWalker",
+    "createVertexArray",
+    "createWaveShaper",
+    "creationTime",
+    "credentials",
+    "crossOrigin",
+    "crossOriginIsolated",
+    "crypto",
+    "csi",
+    "csp",
+    "cssFloat",
+    "cssRules",
+    "cssText",
+    "cssValueType",
+    "ctrlKey",
+    "ctrlLeft",
+    "cues",
+    "cullFace",
+    "currentDirection",
+    "currentLocalDescription",
+    "currentNode",
+    "currentPage",
+    "currentRect",
+    "currentRemoteDescription",
+    "currentScale",
+    "currentScript",
+    "currentSrc",
+    "currentState",
+    "currentStyle",
+    "currentTarget",
+    "currentTime",
+    "currentTranslate",
+    "currentView",
+    "cursor",
+    "curve",
+    "customElements",
+    "customError",
+    "cx",
+    "cy",
+    "d",
+    "data",
+    "dataFld",
+    "dataFormatAs",
+    "dataLoss",
+    "dataLossMessage",
+    "dataPageSize",
+    "dataSrc",
+    "dataTransfer",
+    "database",
+    "databases",
+    "dataset",
+    "dateTime",
+    "db",
+    "debug",
+    "debuggerEnabled",
+    "declare",
+    "decode",
+    "decodeAudioData",
+    "decodeURI",
+    "decodeURIComponent",
+    "decodedBodySize",
+    "decoding",
+    "decodingInfo",
+    "decrypt",
+    "default",
+    "defaultCharset",
+    "defaultChecked",
+    "defaultMuted",
+    "defaultPlaybackRate",
+    "defaultPolicy",
+    "defaultPrevented",
+    "defaultRequest",
+    "defaultSelected",
+    "defaultStatus",
+    "defaultURL",
+    "defaultValue",
+    "defaultView",
+    "defaultstatus",
+    "defer",
+    "define",
+    "defineMagicFunction",
+    "defineMagicVariable",
+    "defineProperties",
+    "defineProperty",
+    "deg",
+    "delay",
+    "delayTime",
+    "delegatesFocus",
+    "delete",
+    "deleteBuffer",
+    "deleteCaption",
+    "deleteCell",
+    "deleteContents",
+    "deleteData",
+    "deleteDatabase",
+    "deleteFramebuffer",
+    "deleteFromDocument",
+    "deleteIndex",
+    "deleteMedium",
+    "deleteObjectStore",
+    "deleteProgram",
+    "deleteProperty",
+    "deleteQuery",
+    "deleteRenderbuffer",
+    "deleteRow",
+    "deleteRule",
+    "deleteSampler",
+    "deleteShader",
+    "deleteSync",
+    "deleteTFoot",
+    "deleteTHead",
+    "deleteTexture",
+    "deleteTransformFeedback",
+    "deleteVertexArray",
+    "deliverChangeRecords",
+    "delivery",
+    "deliveryInfo",
+    "deliveryStatus",
+    "deliveryTimestamp",
+    "delta",
+    "deltaMode",
+    "deltaX",
+    "deltaY",
+    "deltaZ",
+    "dependentLocality",
+    "depthFar",
+    "depthFunc",
+    "depthMask",
+    "depthNear",
+    "depthRange",
+    "deref",
+    "deriveBits",
+    "deriveKey",
+    "description",
+    "deselectAll",
+    "designMode",
+    "desiredSize",
+    "destination",
+    "destinationURL",
+    "detach",
+    "detachEvent",
+    "detachShader",
+    "detail",
+    "details",
+    "detect",
+    "detune",
+    "device",
+    "deviceClass",
+    "deviceId",
+    "deviceMemory",
+    "devicePixelContentBoxSize",
+    "devicePixelRatio",
+    "deviceProtocol",
+    "deviceSubclass",
+    "deviceVersionMajor",
+    "deviceVersionMinor",
+    "deviceVersionSubminor",
+    "deviceXDPI",
+    "deviceYDPI",
+    "didTimeout",
+    "diffuseConstant",
+    "digest",
+    "dimensions",
+    "dir",
+    "dirName",
+    "direction",
+    "dirxml",
+    "disable",
+    "disablePictureInPicture",
+    "disableRemotePlayback",
+    "disableVertexAttribArray",
+    "disabled",
+    "dischargingTime",
+    "disconnect",
+    "disconnectShark",
+    "dispatchEvent",
+    "display",
+    "displayId",
+    "displayName",
+    "disposition",
+    "distanceModel",
+    "div",
+    "divisor",
+    "djsapi",
+    "djsproxy",
+    "doImport",
+    "doNotTrack",
+    "doScroll",
+    "doctype",
+    "document",
+    "documentElement",
+    "documentMode",
+    "documentURI",
+    "dolphin",
+    "dolphinGameCenter",
+    "dolphininfo",
+    "dolphinmeta",
+    "domComplete",
+    "domContentLoadedEventEnd",
+    "domContentLoadedEventStart",
+    "domInteractive",
+    "domLoading",
+    "domOverlayState",
+    "domain",
+    "domainLookupEnd",
+    "domainLookupStart",
+    "dominant-baseline",
+    "dominantBaseline",
+    "done",
+    "dopplerFactor",
+    "dotAll",
+    "downDegrees",
+    "downlink",
+    "download",
+    "downloadTotal",
+    "downloaded",
+    "dpcm",
+    "dpi",
+    "dppx",
+    "dragDrop",
+    "draggable",
+    "drawArrays",
+    "drawArraysInstanced",
+    "drawArraysInstancedANGLE",
+    "drawBuffers",
+    "drawCustomFocusRing",
+    "drawElements",
+    "drawElementsInstanced",
+    "drawElementsInstancedANGLE",
+    "drawFocusIfNeeded",
+    "drawImage",
+    "drawImageFromRect",
+    "drawRangeElements",
+    "drawSystemFocusRing",
+    "drawingBufferHeight",
+    "drawingBufferWidth",
+    "dropEffect",
+    "droppedVideoFrames",
+    "dropzone",
+    "dtmf",
+    "dump",
+    "dumpProfile",
+    "duplicate",
+    "durability",
+    "duration",
+    "dvname",
+    "dvnum",
+    "dx",
+    "dy",
+    "dynsrc",
+    "e",
+    "edgeMode",
+    "effect",
+    "effectAllowed",
+    "effectiveDirective",
+    "effectiveType",
+    "elapsedTime",
+    "element",
+    "elementFromPoint",
+    "elementTiming",
+    "elements",
+    "elementsFromPoint",
+    "elevation",
+    "ellipse",
+    "em",
+    "email",
+    "embeds",
+    "emma",
+    "empty",
+    "empty-cells",
+    "emptyCells",
+    "emptyHTML",
+    "emptyScript",
+    "emulatedPosition",
+    "enable",
+    "enableBackground",
+    "enableDelegations",
+    "enableStyleSheetsForSet",
+    "enableVertexAttribArray",
+    "enabled",
+    "enabledPlugin",
+    "encode",
+    "encodeInto",
+    "encodeURI",
+    "encodeURIComponent",
+    "encodedBodySize",
+    "encoding",
+    "encodingInfo",
+    "encrypt",
+    "enctype",
+    "end",
+    "endContainer",
+    "endElement",
+    "endElementAt",
+    "endOfStream",
+    "endOffset",
+    "endQuery",
+    "endTime",
+    "endTransformFeedback",
+    "ended",
+    "endpoint",
+    "endpointNumber",
+    "endpoints",
+    "endsWith",
+    "enterKeyHint",
+    "entities",
+    "entries",
+    "entryType",
+    "enumerate",
+    "enumerateDevices",
+    "enumerateEditable",
+    "environmentBlendMode",
+    "equals",
+    "error",
+    "errorCode",
+    "errorDetail",
+    "errorText",
+    "escape",
+    "estimate",
+    "eval",
+    "evaluate",
+    "event",
+    "eventPhase",
+    "every",
+    "ex",
+    "exception",
+    "exchange",
+    "exec",
+    "execCommand",
+    "execCommandShowHelp",
+    "execScript",
+    "exitFullscreen",
+    "exitPictureInPicture",
+    "exitPointerLock",
+    "exitPresent",
+    "exp",
+    "expand",
+    "expandEntityReferences",
+    "expando",
+    "expansion",
+    "expiration",
+    "expirationTime",
+    "expires",
+    "expiryDate",
+    "explicitOriginalTarget",
+    "expm1",
+    "exponent",
+    "exponentialRampToValueAtTime",
+    "exportKey",
+    "exports",
+    "extend",
+    "extensions",
+    "extentNode",
+    "extentOffset",
+    "external",
+    "externalResourcesRequired",
+    "extractContents",
+    "extractable",
+    "eye",
+    "f",
+    "face",
+    "factoryReset",
+    "failureReason",
+    "fallback",
+    "family",
+    "familyName",
+    "farthestViewportElement",
+    "fastSeek",
+    "fatal",
+    "featureId",
+    "featurePolicy",
+    "featureSettings",
+    "features",
+    "fenceSync",
+    "fetch",
+    "fetchStart",
+    "fftSize",
+    "fgColor",
+    "fieldOfView",
+    "file",
+    "fileCreatedDate",
+    "fileHandle",
+    "fileModifiedDate",
+    "fileName",
+    "fileSize",
+    "fileUpdatedDate",
+    "filename",
+    "files",
+    "filesystem",
+    "fill",
+    "fill-opacity",
+    "fill-rule",
+    "fillLightMode",
+    "fillOpacity",
+    "fillRect",
+    "fillRule",
+    "fillStyle",
+    "fillText",
+    "filter",
+    "filterResX",
+    "filterResY",
+    "filterUnits",
+    "filters",
+    "finally",
+    "find",
+    "findIndex",
+    "findRule",
+    "findText",
+    "finish",
+    "finished",
+    "fireEvent",
+    "firesTouchEvents",
+    "firstChild",
+    "firstElementChild",
+    "firstPage",
+    "fixed",
+    "flags",
+    "flat",
+    "flatMap",
+    "flex",
+    "flex-basis",
+    "flex-direction",
+    "flex-flow",
+    "flex-grow",
+    "flex-shrink",
+    "flex-wrap",
+    "flexBasis",
+    "flexDirection",
+    "flexFlow",
+    "flexGrow",
+    "flexShrink",
+    "flexWrap",
+    "flipX",
+    "flipY",
+    "float",
+    "float32",
+    "float64",
+    "flood-color",
+    "flood-opacity",
+    "floodColor",
+    "floodOpacity",
+    "floor",
+    "flush",
+    "focus",
+    "focusNode",
+    "focusOffset",
+    "font",
+    "font-family",
+    "font-feature-settings",
+    "font-kerning",
+    "font-language-override",
+    "font-optical-sizing",
+    "font-size",
+    "font-size-adjust",
+    "font-stretch",
+    "font-style",
+    "font-synthesis",
+    "font-variant",
+    "font-variant-alternates",
+    "font-variant-caps",
+    "font-variant-east-asian",
+    "font-variant-ligatures",
+    "font-variant-numeric",
+    "font-variant-position",
+    "font-variation-settings",
+    "font-weight",
+    "fontFamily",
+    "fontFeatureSettings",
+    "fontKerning",
+    "fontLanguageOverride",
+    "fontOpticalSizing",
+    "fontSize",
+    "fontSizeAdjust",
+    "fontSmoothingEnabled",
+    "fontStretch",
+    "fontStyle",
+    "fontSynthesis",
+    "fontVariant",
+    "fontVariantAlternates",
+    "fontVariantCaps",
+    "fontVariantEastAsian",
+    "fontVariantLigatures",
+    "fontVariantNumeric",
+    "fontVariantPosition",
+    "fontVariationSettings",
+    "fontWeight",
+    "fontcolor",
+    "fontfaces",
+    "fonts",
+    "fontsize",
+    "for",
+    "forEach",
+    "force",
+    "forceRedraw",
+    "form",
+    "formAction",
+    "formData",
+    "formEnctype",
+    "formMethod",
+    "formNoValidate",
+    "formTarget",
+    "format",
+    "formatToParts",
+    "forms",
+    "forward",
+    "forwardX",
+    "forwardY",
+    "forwardZ",
+    "foundation",
+    "fr",
+    "fragmentDirective",
+    "frame",
+    "frameBorder",
+    "frameElement",
+    "frameSpacing",
+    "framebuffer",
+    "framebufferHeight",
+    "framebufferRenderbuffer",
+    "framebufferTexture2D",
+    "framebufferTextureLayer",
+    "framebufferWidth",
+    "frames",
+    "freeSpace",
+    "freeze",
+    "frequency",
+    "frequencyBinCount",
+    "from",
+    "fromCharCode",
+    "fromCodePoint",
+    "fromElement",
+    "fromEntries",
+    "fromFloat32Array",
+    "fromFloat64Array",
+    "fromMatrix",
+    "fromPoint",
+    "fromQuad",
+    "fromRect",
+    "frontFace",
+    "fround",
+    "fullPath",
+    "fullScreen",
+    "fullscreen",
+    "fullscreenElement",
+    "fullscreenEnabled",
+    "fx",
+    "fy",
+    "gain",
+    "gamepad",
+    "gamma",
+    "gap",
+    "gatheringState",
+    "gatt",
+    "genderIdentity",
+    "generateCertificate",
+    "generateKey",
+    "generateMipmap",
+    "generateRequest",
+    "geolocation",
+    "gestureObject",
+    "get",
+    "getActiveAttrib",
+    "getActiveUniform",
+    "getActiveUniformBlockName",
+    "getActiveUniformBlockParameter",
+    "getActiveUniforms",
+    "getAdjacentText",
+    "getAll",
+    "getAllKeys",
+    "getAllResponseHeaders",
+    "getAllowlistForFeature",
+    "getAnimations",
+    "getAsFile",
+    "getAsString",
+    "getAttachedShaders",
+    "getAttribLocation",
+    "getAttribute",
+    "getAttributeNS",
+    "getAttributeNames",
+    "getAttributeNode",
+    "getAttributeNodeNS",
+    "getAttributeType",
+    "getAudioTracks",
+    "getAvailability",
+    "getBBox",
+    "getBattery",
+    "getBigInt64",
+    "getBigUint64",
+    "getBlob",
+    "getBookmark",
+    "getBoundingClientRect",
+    "getBounds",
+    "getBoxQuads",
+    "getBufferParameter",
+    "getBufferSubData",
+    "getByteFrequencyData",
+    "getByteTimeDomainData",
+    "getCSSCanvasContext",
+    "getCTM",
+    "getCandidateWindowClientRect",
+    "getCanonicalLocales",
+    "getCapabilities",
+    "getChannelData",
+    "getCharNumAtPosition",
+    "getCharacteristic",
+    "getCharacteristics",
+    "getClientExtensionResults",
+    "getClientRect",
+    "getClientRects",
+    "getCoalescedEvents",
+    "getCompositionAlternatives",
+    "getComputedStyle",
+    "getComputedTextLength",
+    "getComputedTiming",
+    "getConfiguration",
+    "getConstraints",
+    "getContext",
+    "getContextAttributes",
+    "getContributingSources",
+    "getCounterValue",
+    "getCueAsHTML",
+    "getCueById",
+    "getCurrentPosition",
+    "getCurrentTime",
+    "getData",
+    "getDatabaseNames",
+    "getDate",
+    "getDay",
+    "getDefaultComputedStyle",
+    "getDescriptor",
+    "getDescriptors",
+    "getDestinationInsertionPoints",
+    "getDevices",
+    "getDirectory",
+    "getDisplayMedia",
+    "getDistributedNodes",
+    "getEditable",
+    "getElementById",
+    "getElementsByClassName",
+    "getElementsByName",
+    "getElementsByTagName",
+    "getElementsByTagNameNS",
+    "getEnclosureList",
+    "getEndPositionOfChar",
+    "getEntries",
+    "getEntriesByName",
+    "getEntriesByType",
+    "getError",
+    "getExtension",
+    "getExtentOfChar",
+    "getEyeParameters",
+    "getFeature",
+    "getFile",
+    "getFiles",
+    "getFilesAndDirectories",
+    "getFingerprints",
+    "getFloat32",
+    "getFloat64",
+    "getFloatFrequencyData",
+    "getFloatTimeDomainData",
+    "getFloatValue",
+    "getFragDataLocation",
+    "getFrameData",
+    "getFramebufferAttachmentParameter",
+    "getFrequencyResponse",
+    "getFullYear",
+    "getGamepads",
+    "getHitTestResults",
+    "getHitTestResultsForTransientInput",
+    "getHours",
+    "getIdentityAssertion",
+    "getIds",
+    "getImageData",
+    "getIndexedParameter",
+    "getInstalledRelatedApps",
+    "getInt16",
+    "getInt32",
+    "getInt8",
+    "getInternalformatParameter",
+    "getIntersectionList",
+    "getItem",
+    "getItems",
+    "getKey",
+    "getKeyframes",
+    "getLayers",
+    "getLayoutMap",
+    "getLineDash",
+    "getLocalCandidates",
+    "getLocalParameters",
+    "getLocalStreams",
+    "getMarks",
+    "getMatchedCSSRules",
+    "getMaxGCPauseSinceClear",
+    "getMeasures",
+    "getMetadata",
+    "getMilliseconds",
+    "getMinutes",
+    "getModifierState",
+    "getMonth",
+    "getNamedItem",
+    "getNamedItemNS",
+    "getNativeFramebufferScaleFactor",
+    "getNotifications",
+    "getNotifier",
+    "getNumberOfChars",
+    "getOffsetReferenceSpace",
+    "getOutputTimestamp",
+    "getOverrideHistoryNavigationMode",
+    "getOverrideStyle",
+    "getOwnPropertyDescriptor",
+    "getOwnPropertyDescriptors",
+    "getOwnPropertyNames",
+    "getOwnPropertySymbols",
+    "getParameter",
+    "getParameters",
+    "getParent",
+    "getPathSegAtLength",
+    "getPhotoCapabilities",
+    "getPhotoSettings",
+    "getPointAtLength",
+    "getPose",
+    "getPredictedEvents",
+    "getPreference",
+    "getPreferenceDefault",
+    "getPresentationAttribute",
+    "getPreventDefault",
+    "getPrimaryService",
+    "getPrimaryServices",
+    "getProgramInfoLog",
+    "getProgramParameter",
+    "getPropertyCSSValue",
+    "getPropertyPriority",
+    "getPropertyShorthand",
+    "getPropertyType",
+    "getPropertyValue",
+    "getPrototypeOf",
+    "getQuery",
+    "getQueryParameter",
+    "getRGBColorValue",
+    "getRandomValues",
+    "getRangeAt",
+    "getReader",
+    "getReceivers",
+    "getRectValue",
+    "getRegistration",
+    "getRegistrations",
+    "getRemoteCandidates",
+    "getRemoteCertificates",
+    "getRemoteParameters",
+    "getRemoteStreams",
+    "getRenderbufferParameter",
+    "getResponseHeader",
+    "getRoot",
+    "getRootNode",
+    "getRotationOfChar",
+    "getSVGDocument",
+    "getSamplerParameter",
+    "getScreenCTM",
+    "getSeconds",
+    "getSelectedCandidatePair",
+    "getSelection",
+    "getSenders",
+    "getService",
+    "getSettings",
+    "getShaderInfoLog",
+    "getShaderParameter",
+    "getShaderPrecisionFormat",
+    "getShaderSource",
+    "getSimpleDuration",
+    "getSiteIcons",
+    "getSources",
+    "getSpeculativeParserUrls",
+    "getStartPositionOfChar",
+    "getStartTime",
+    "getState",
+    "getStats",
+    "getStatusForPolicy",
+    "getStorageUpdates",
+    "getStreamById",
+    "getStringValue",
+    "getSubStringLength",
+    "getSubscription",
+    "getSupportedConstraints",
+    "getSupportedExtensions",
+    "getSupportedFormats",
+    "getSyncParameter",
+    "getSynchronizationSources",
+    "getTags",
+    "getTargetRanges",
+    "getTexParameter",
+    "getTime",
+    "getTimezoneOffset",
+    "getTiming",
+    "getTotalLength",
+    "getTrackById",
+    "getTracks",
+    "getTransceivers",
+    "getTransform",
+    "getTransformFeedbackVarying",
+    "getTransformToElement",
+    "getTransports",
+    "getType",
+    "getTypeMapping",
+    "getUTCDate",
+    "getUTCDay",
+    "getUTCFullYear",
+    "getUTCHours",
+    "getUTCMilliseconds",
+    "getUTCMinutes",
+    "getUTCMonth",
+    "getUTCSeconds",
+    "getUint16",
+    "getUint32",
+    "getUint8",
+    "getUniform",
+    "getUniformBlockIndex",
+    "getUniformIndices",
+    "getUniformLocation",
+    "getUserMedia",
+    "getVRDisplays",
+    "getValues",
+    "getVarDate",
+    "getVariableValue",
+    "getVertexAttrib",
+    "getVertexAttribOffset",
+    "getVideoPlaybackQuality",
+    "getVideoTracks",
+    "getViewerPose",
+    "getViewport",
+    "getVoices",
+    "getWakeLockState",
+    "getWriter",
+    "getYear",
+    "givenName",
+    "global",
+    "globalAlpha",
+    "globalCompositeOperation",
+    "globalThis",
+    "glyphOrientationHorizontal",
+    "glyphOrientationVertical",
+    "glyphRef",
+    "go",
+    "grabFrame",
+    "grad",
+    "gradientTransform",
+    "gradientUnits",
+    "grammars",
+    "green",
+    "grid",
+    "grid-area",
+    "grid-auto-columns",
+    "grid-auto-flow",
+    "grid-auto-rows",
+    "grid-column",
+    "grid-column-end",
+    "grid-column-gap",
+    "grid-column-start",
+    "grid-gap",
+    "grid-row",
+    "grid-row-end",
+    "grid-row-gap",
+    "grid-row-start",
+    "grid-template",
+    "grid-template-areas",
+    "grid-template-columns",
+    "grid-template-rows",
+    "gridArea",
+    "gridAutoColumns",
+    "gridAutoFlow",
+    "gridAutoRows",
+    "gridColumn",
+    "gridColumnEnd",
+    "gridColumnGap",
+    "gridColumnStart",
+    "gridGap",
+    "gridRow",
+    "gridRowEnd",
+    "gridRowGap",
+    "gridRowStart",
+    "gridTemplate",
+    "gridTemplateAreas",
+    "gridTemplateColumns",
+    "gridTemplateRows",
+    "gripSpace",
+    "group",
+    "groupCollapsed",
+    "groupEnd",
+    "groupId",
+    "hadRecentInput",
+    "hand",
+    "handedness",
+    "hapticActuators",
+    "hardwareConcurrency",
+    "has",
+    "hasAttribute",
+    "hasAttributeNS",
+    "hasAttributes",
+    "hasBeenActive",
+    "hasChildNodes",
+    "hasComposition",
+    "hasEnrolledInstrument",
+    "hasExtension",
+    "hasExternalDisplay",
+    "hasFeature",
+    "hasFocus",
+    "hasInstance",
+    "hasLayout",
+    "hasOrientation",
+    "hasOwnProperty",
+    "hasPointerCapture",
+    "hasPosition",
+    "hasReading",
+    "hasStorageAccess",
+    "hash",
+    "head",
+    "headers",
+    "heading",
+    "height",
+    "hidden",
+    "hide",
+    "hideFocus",
+    "high",
+    "highWaterMark",
+    "hint",
+    "history",
+    "honorificPrefix",
+    "honorificSuffix",
+    "horizontalOverflow",
+    "host",
+    "hostCandidate",
+    "hostname",
+    "href",
+    "hrefTranslate",
+    "hreflang",
+    "hspace",
+    "html5TagCheckInerface",
+    "htmlFor",
+    "htmlText",
+    "httpEquiv",
+    "httpRequestStatusCode",
+    "hwTimestamp",
+    "hyphens",
+    "hypot",
+    "iccId",
+    "iceConnectionState",
+    "iceGatheringState",
+    "iceTransport",
+    "icon",
+    "iconURL",
+    "id",
+    "identifier",
+    "identity",
+    "idpLoginUrl",
+    "ignoreBOM",
+    "ignoreCase",
+    "ignoreDepthValues",
+    "image-orientation",
+    "image-rendering",
+    "imageHeight",
+    "imageOrientation",
+    "imageRendering",
+    "imageSizes",
+    "imageSmoothingEnabled",
+    "imageSmoothingQuality",
+    "imageSrcset",
+    "imageWidth",
+    "images",
+    "ime-mode",
+    "imeMode",
+    "implementation",
+    "importKey",
+    "importNode",
+    "importStylesheet",
+    "imports",
+    "impp",
+    "imul",
+    "in",
+    "in1",
+    "in2",
+    "inBandMetadataTrackDispatchType",
+    "inRange",
+    "includes",
+    "incremental",
+    "indeterminate",
+    "index",
+    "indexNames",
+    "indexOf",
+    "indexedDB",
+    "indicate",
+    "inertiaDestinationX",
+    "inertiaDestinationY",
+    "info",
+    "init",
+    "initAnimationEvent",
+    "initBeforeLoadEvent",
+    "initClipboardEvent",
+    "initCloseEvent",
+    "initCommandEvent",
+    "initCompositionEvent",
+    "initCustomEvent",
+    "initData",
+    "initDataType",
+    "initDeviceMotionEvent",
+    "initDeviceOrientationEvent",
+    "initDragEvent",
+    "initErrorEvent",
+    "initEvent",
+    "initFocusEvent",
+    "initGestureEvent",
+    "initHashChangeEvent",
+    "initKeyEvent",
+    "initKeyboardEvent",
+    "initMSManipulationEvent",
+    "initMessageEvent",
+    "initMouseEvent",
+    "initMouseScrollEvent",
+    "initMouseWheelEvent",
+    "initMutationEvent",
+    "initNSMouseEvent",
+    "initOverflowEvent",
+    "initPageEvent",
+    "initPageTransitionEvent",
+    "initPointerEvent",
+    "initPopStateEvent",
+    "initProgressEvent",
+    "initScrollAreaEvent",
+    "initSimpleGestureEvent",
+    "initStorageEvent",
+    "initTextEvent",
+    "initTimeEvent",
+    "initTouchEvent",
+    "initTransitionEvent",
+    "initUIEvent",
+    "initWebKitAnimationEvent",
+    "initWebKitTransitionEvent",
+    "initWebKitWheelEvent",
+    "initWheelEvent",
+    "initialTime",
+    "initialize",
+    "initiatorType",
+    "inline-size",
+    "inlineSize",
+    "inlineVerticalFieldOfView",
+    "inner",
+    "innerHTML",
+    "innerHeight",
+    "innerText",
+    "innerWidth",
+    "input",
+    "inputBuffer",
+    "inputEncoding",
+    "inputMethod",
+    "inputMode",
+    "inputSource",
+    "inputSources",
+    "inputType",
+    "inputs",
+    "insertAdjacentElement",
+    "insertAdjacentHTML",
+    "insertAdjacentText",
+    "insertBefore",
+    "insertCell",
+    "insertDTMF",
+    "insertData",
+    "insertItemBefore",
+    "insertNode",
+    "insertRow",
+    "insertRule",
+    "inset",
+    "inset-block",
+    "inset-block-end",
+    "inset-block-start",
+    "inset-inline",
+    "inset-inline-end",
+    "inset-inline-start",
+    "insetBlock",
+    "insetBlockEnd",
+    "insetBlockStart",
+    "insetInline",
+    "insetInlineEnd",
+    "insetInlineStart",
+    "installing",
+    "instanceRoot",
+    "instantiate",
+    "instantiateStreaming",
+    "instruments",
+    "int16",
+    "int32",
+    "int8",
+    "integrity",
+    "interactionMode",
+    "intercept",
+    "interfaceClass",
+    "interfaceName",
+    "interfaceNumber",
+    "interfaceProtocol",
+    "interfaceSubclass",
+    "interfaces",
+    "interimResults",
+    "internalSubset",
+    "interpretation",
+    "intersectionRatio",
+    "intersectionRect",
+    "intersectsNode",
+    "interval",
+    "invalidIteratorState",
+    "invalidateFramebuffer",
+    "invalidateSubFramebuffer",
+    "inverse",
+    "invertSelf",
+    "is",
+    "is2D",
+    "isActive",
+    "isAlternate",
+    "isArray",
+    "isBingCurrentSearchDefault",
+    "isBuffer",
+    "isCandidateWindowVisible",
+    "isChar",
+    "isCollapsed",
+    "isComposing",
+    "isConcatSpreadable",
+    "isConnected",
+    "isContentEditable",
+    "isContentHandlerRegistered",
+    "isContextLost",
+    "isDefaultNamespace",
+    "isDirectory",
+    "isDisabled",
+    "isEnabled",
+    "isEqual",
+    "isEqualNode",
+    "isExtensible",
+    "isExternalCTAP2SecurityKeySupported",
+    "isFile",
+    "isFinite",
+    "isFramebuffer",
+    "isFrozen",
+    "isGenerator",
+    "isHTML",
+    "isHistoryNavigation",
+    "isId",
+    "isIdentity",
+    "isInjected",
+    "isInteger",
+    "isIntersecting",
+    "isLockFree",
+    "isMap",
+    "isMultiLine",
+    "isNaN",
+    "isOpen",
+    "isPointInFill",
+    "isPointInPath",
+    "isPointInRange",
+    "isPointInStroke",
+    "isPrefAlternate",
+    "isPresenting",
+    "isPrimary",
+    "isProgram",
+    "isPropertyImplicit",
+    "isProtocolHandlerRegistered",
+    "isPrototypeOf",
+    "isQuery",
+    "isRenderbuffer",
+    "isSafeInteger",
+    "isSameNode",
+    "isSampler",
+    "isScript",
+    "isScriptURL",
+    "isSealed",
+    "isSecureContext",
+    "isSessionSupported",
+    "isShader",
+    "isSupported",
+    "isSync",
+    "isTextEdit",
+    "isTexture",
+    "isTransformFeedback",
+    "isTrusted",
+    "isTypeSupported",
+    "isUserVerifyingPlatformAuthenticatorAvailable",
+    "isVertexArray",
+    "isView",
+    "isVisible",
+    "isochronousTransferIn",
+    "isochronousTransferOut",
+    "isolation",
+    "italics",
+    "item",
+    "itemId",
+    "itemProp",
+    "itemRef",
+    "itemScope",
+    "itemType",
+    "itemValue",
+    "items",
+    "iterateNext",
+    "iterationComposite",
+    "iterator",
+    "javaEnabled",
+    "jobTitle",
+    "join",
+    "json",
+    "justify-content",
+    "justify-items",
+    "justify-self",
+    "justifyContent",
+    "justifyItems",
+    "justifySelf",
+    "k1",
+    "k2",
+    "k3",
+    "k4",
+    "kHz",
+    "keepalive",
+    "kernelMatrix",
+    "kernelUnitLengthX",
+    "kernelUnitLengthY",
+    "kerning",
+    "key",
+    "keyCode",
+    "keyFor",
+    "keyIdentifier",
+    "keyLightEnabled",
+    "keyLocation",
+    "keyPath",
+    "keyStatuses",
+    "keySystem",
+    "keyText",
+    "keyUsage",
+    "keyboard",
+    "keys",
+    "keytype",
+    "kind",
+    "knee",
+    "label",
+    "labels",
+    "lang",
+    "language",
+    "languages",
+    "largeArcFlag",
+    "lastChild",
+    "lastElementChild",
+    "lastEventId",
+    "lastIndex",
+    "lastIndexOf",
+    "lastInputTime",
+    "lastMatch",
+    "lastMessageSubject",
+    "lastMessageType",
+    "lastModified",
+    "lastModifiedDate",
+    "lastPage",
+    "lastParen",
+    "lastState",
+    "lastStyleSheetSet",
+    "latitude",
+    "layerX",
+    "layerY",
+    "layoutFlow",
+    "layoutGrid",
+    "layoutGridChar",
+    "layoutGridLine",
+    "layoutGridMode",
+    "layoutGridType",
+    "lbound",
+    "left",
+    "leftContext",
+    "leftDegrees",
+    "leftMargin",
+    "leftProjectionMatrix",
+    "leftViewMatrix",
+    "length",
+    "lengthAdjust",
+    "lengthComputable",
+    "letter-spacing",
+    "letterSpacing",
+    "level",
+    "lighting-color",
+    "lightingColor",
+    "limitingConeAngle",
+    "line",
+    "line-break",
+    "line-height",
+    "lineAlign",
+    "lineBreak",
+    "lineCap",
+    "lineDashOffset",
+    "lineHeight",
+    "lineJoin",
+    "lineNumber",
+    "lineTo",
+    "lineWidth",
+    "linearAcceleration",
+    "linearRampToValueAtTime",
+    "linearVelocity",
+    "lineno",
+    "lines",
+    "link",
+    "linkColor",
+    "linkProgram",
+    "links",
+    "list",
+    "list-style",
+    "list-style-image",
+    "list-style-position",
+    "list-style-type",
+    "listStyle",
+    "listStyleImage",
+    "listStylePosition",
+    "listStyleType",
+    "listener",
+    "load",
+    "loadEventEnd",
+    "loadEventStart",
+    "loadTime",
+    "loadTimes",
+    "loaded",
+    "loading",
+    "localDescription",
+    "localName",
+    "localService",
+    "localStorage",
+    "locale",
+    "localeCompare",
+    "location",
+    "locationbar",
+    "lock",
+    "locked",
+    "lockedFile",
+    "locks",
+    "log",
+    "log10",
+    "log1p",
+    "log2",
+    "logicalXDPI",
+    "logicalYDPI",
+    "longDesc",
+    "longitude",
+    "lookupNamespaceURI",
+    "lookupPrefix",
+    "loop",
+    "loopEnd",
+    "loopStart",
+    "looping",
+    "low",
+    "lower",
+    "lowerBound",
+    "lowerOpen",
+    "lowsrc",
+    "m11",
+    "m12",
+    "m13",
+    "m14",
+    "m21",
+    "m22",
+    "m23",
+    "m24",
+    "m31",
+    "m32",
+    "m33",
+    "m34",
+    "m41",
+    "m42",
+    "m43",
+    "m44",
+    "makeXRCompatible",
+    "manifest",
+    "manufacturer",
+    "manufacturerName",
+    "map",
+    "mapping",
+    "margin",
+    "margin-block",
+    "margin-block-end",
+    "margin-block-start",
+    "margin-bottom",
+    "margin-inline",
+    "margin-inline-end",
+    "margin-inline-start",
+    "margin-left",
+    "margin-right",
+    "margin-top",
+    "marginBlock",
+    "marginBlockEnd",
+    "marginBlockStart",
+    "marginBottom",
+    "marginHeight",
+    "marginInline",
+    "marginInlineEnd",
+    "marginInlineStart",
+    "marginLeft",
+    "marginRight",
+    "marginTop",
+    "marginWidth",
+    "mark",
+    "marker",
+    "marker-end",
+    "marker-mid",
+    "marker-offset",
+    "marker-start",
+    "markerEnd",
+    "markerHeight",
+    "markerMid",
+    "markerOffset",
+    "markerStart",
+    "markerUnits",
+    "markerWidth",
+    "marks",
+    "mask",
+    "mask-clip",
+    "mask-composite",
+    "mask-image",
+    "mask-mode",
+    "mask-origin",
+    "mask-position",
+    "mask-position-x",
+    "mask-position-y",
+    "mask-repeat",
+    "mask-size",
+    "mask-type",
+    "maskClip",
+    "maskComposite",
+    "maskContentUnits",
+    "maskImage",
+    "maskMode",
+    "maskOrigin",
+    "maskPosition",
+    "maskPositionX",
+    "maskPositionY",
+    "maskRepeat",
+    "maskSize",
+    "maskType",
+    "maskUnits",
+    "match",
+    "matchAll",
+    "matchMedia",
+    "matchMedium",
+    "matches",
+    "matrix",
+    "matrixTransform",
+    "max",
+    "max-block-size",
+    "max-height",
+    "max-inline-size",
+    "max-width",
+    "maxActions",
+    "maxAlternatives",
+    "maxBlockSize",
+    "maxChannelCount",
+    "maxChannels",
+    "maxConnectionsPerServer",
+    "maxDecibels",
+    "maxDistance",
+    "maxHeight",
+    "maxInlineSize",
+    "maxLayers",
+    "maxLength",
+    "maxMessageSize",
+    "maxPacketLifeTime",
+    "maxRetransmits",
+    "maxTouchPoints",
+    "maxValue",
+    "maxWidth",
+    "measure",
+    "measureText",
+    "media",
+    "mediaCapabilities",
+    "mediaDevices",
+    "mediaElement",
+    "mediaGroup",
+    "mediaKeys",
+    "mediaSession",
+    "mediaStream",
+    "mediaText",
+    "meetOrSlice",
+    "memory",
+    "menubar",
+    "mergeAttributes",
+    "message",
+    "messageClass",
+    "messageHandlers",
+    "messageType",
+    "metaKey",
+    "metadata",
+    "method",
+    "methodDetails",
+    "methodName",
+    "mid",
+    "mimeType",
+    "mimeTypes",
+    "min",
+    "min-block-size",
+    "min-height",
+    "min-inline-size",
+    "min-width",
+    "minBlockSize",
+    "minDecibels",
+    "minHeight",
+    "minInlineSize",
+    "minLength",
+    "minValue",
+    "minWidth",
+    "miterLimit",
+    "mix-blend-mode",
+    "mixBlendMode",
+    "mm",
+    "mode",
+    "modify",
+    "mount",
+    "move",
+    "moveBy",
+    "moveEnd",
+    "moveFirst",
+    "moveFocusDown",
+    "moveFocusLeft",
+    "moveFocusRight",
+    "moveFocusUp",
+    "moveNext",
+    "moveRow",
+    "moveStart",
+    "moveTo",
+    "moveToBookmark",
+    "moveToElementText",
+    "moveToPoint",
+    "movementX",
+    "movementY",
+    "mozAdd",
+    "mozAnimationStartTime",
+    "mozAnon",
+    "mozApps",
+    "mozAudioCaptured",
+    "mozAudioChannelType",
+    "mozAutoplayEnabled",
+    "mozCancelAnimationFrame",
+    "mozCancelFullScreen",
+    "mozCancelRequestAnimationFrame",
+    "mozCaptureStream",
+    "mozCaptureStreamUntilEnded",
+    "mozClearDataAt",
+    "mozContact",
+    "mozContacts",
+    "mozCreateFileHandle",
+    "mozCurrentTransform",
+    "mozCurrentTransformInverse",
+    "mozCursor",
+    "mozDash",
+    "mozDashOffset",
+    "mozDecodedFrames",
+    "mozExitPointerLock",
+    "mozFillRule",
+    "mozFragmentEnd",
+    "mozFrameDelay",
+    "mozFullScreen",
+    "mozFullScreenElement",
+    "mozFullScreenEnabled",
+    "mozGetAll",
+    "mozGetAllKeys",
+    "mozGetAsFile",
+    "mozGetDataAt",
+    "mozGetMetadata",
+    "mozGetUserMedia",
+    "mozHasAudio",
+    "mozHasItem",
+    "mozHidden",
+    "mozImageSmoothingEnabled",
+    "mozIndexedDB",
+    "mozInnerScreenX",
+    "mozInnerScreenY",
+    "mozInputSource",
+    "mozIsTextField",
+    "mozItem",
+    "mozItemCount",
+    "mozItems",
+    "mozLength",
+    "mozLockOrientation",
+    "mozMatchesSelector",
+    "mozMovementX",
+    "mozMovementY",
+    "mozOpaque",
+    "mozOrientation",
+    "mozPaintCount",
+    "mozPaintedFrames",
+    "mozParsedFrames",
+    "mozPay",
+    "mozPointerLockElement",
+    "mozPresentedFrames",
+    "mozPreservesPitch",
+    "mozPressure",
+    "mozPrintCallback",
+    "mozRTCIceCandidate",
+    "mozRTCPeerConnection",
+    "mozRTCSessionDescription",
+    "mozRemove",
+    "mozRequestAnimationFrame",
+    "mozRequestFullScreen",
+    "mozRequestPointerLock",
+    "mozSetDataAt",
+    "mozSetImageElement",
+    "mozSourceNode",
+    "mozSrcObject",
+    "mozSystem",
+    "mozTCPSocket",
+    "mozTextStyle",
+    "mozTypesAt",
+    "mozUnlockOrientation",
+    "mozUserCancelled",
+    "mozVisibilityState",
+    "ms",
+    "msAnimation",
+    "msAnimationDelay",
+    "msAnimationDirection",
+    "msAnimationDuration",
+    "msAnimationFillMode",
+    "msAnimationIterationCount",
+    "msAnimationName",
+    "msAnimationPlayState",
+    "msAnimationStartTime",
+    "msAnimationTimingFunction",
+    "msBackfaceVisibility",
+    "msBlockProgression",
+    "msCSSOMElementFloatMetrics",
+    "msCaching",
+    "msCachingEnabled",
+    "msCancelRequestAnimationFrame",
+    "msCapsLockWarningOff",
+    "msClearImmediate",
+    "msClose",
+    "msContentZoomChaining",
+    "msContentZoomFactor",
+    "msContentZoomLimit",
+    "msContentZoomLimitMax",
+    "msContentZoomLimitMin",
+    "msContentZoomSnap",
+    "msContentZoomSnapPoints",
+    "msContentZoomSnapType",
+    "msContentZooming",
+    "msConvertURL",
+    "msCrypto",
+    "msDoNotTrack",
+    "msElementsFromPoint",
+    "msElementsFromRect",
+    "msExitFullscreen",
+    "msExtendedCode",
+    "msFillRule",
+    "msFirstPaint",
+    "msFlex",
+    "msFlexAlign",
+    "msFlexDirection",
+    "msFlexFlow",
+    "msFlexItemAlign",
+    "msFlexLinePack",
+    "msFlexNegative",
+    "msFlexOrder",
+    "msFlexPack",
+    "msFlexPositive",
+    "msFlexPreferredSize",
+    "msFlexWrap",
+    "msFlowFrom",
+    "msFlowInto",
+    "msFontFeatureSettings",
+    "msFullscreenElement",
+    "msFullscreenEnabled",
+    "msGetInputContext",
+    "msGetRegionContent",
+    "msGetUntransformedBounds",
+    "msGraphicsTrustStatus",
+    "msGridColumn",
+    "msGridColumnAlign",
+    "msGridColumnSpan",
+    "msGridColumns",
+    "msGridRow",
+    "msGridRowAlign",
+    "msGridRowSpan",
+    "msGridRows",
+    "msHidden",
+    "msHighContrastAdjust",
+    "msHyphenateLimitChars",
+    "msHyphenateLimitLines",
+    "msHyphenateLimitZone",
+    "msHyphens",
+    "msImageSmoothingEnabled",
+    "msImeAlign",
+    "msIndexedDB",
+    "msInterpolationMode",
+    "msIsStaticHTML",
+    "msKeySystem",
+    "msKeys",
+    "msLaunchUri",
+    "msLockOrientation",
+    "msManipulationViewsEnabled",
+    "msMatchMedia",
+    "msMatchesSelector",
+    "msMaxTouchPoints",
+    "msOrientation",
+    "msOverflowStyle",
+    "msPerspective",
+    "msPerspectiveOrigin",
+    "msPlayToDisabled",
+    "msPlayToPreferredSourceUri",
+    "msPlayToPrimary",
+    "msPointerEnabled",
+    "msRegionOverflow",
+    "msReleasePointerCapture",
+    "msRequestAnimationFrame",
+    "msRequestFullscreen",
+    "msSaveBlob",
+    "msSaveOrOpenBlob",
+    "msScrollChaining",
+    "msScrollLimit",
+    "msScrollLimitXMax",
+    "msScrollLimitXMin",
+    "msScrollLimitYMax",
+    "msScrollLimitYMin",
+    "msScrollRails",
+    "msScrollSnapPointsX",
+    "msScrollSnapPointsY",
+    "msScrollSnapType",
+    "msScrollSnapX",
+    "msScrollSnapY",
+    "msScrollTranslation",
+    "msSetImmediate",
+    "msSetMediaKeys",
+    "msSetPointerCapture",
+    "msTextCombineHorizontal",
+    "msTextSizeAdjust",
+    "msToBlob",
+    "msTouchAction",
+    "msTouchSelect",
+    "msTraceAsyncCallbackCompleted",
+    "msTraceAsyncCallbackStarting",
+    "msTraceAsyncOperationCompleted",
+    "msTraceAsyncOperationStarting",
+    "msTransform",
+    "msTransformOrigin",
+    "msTransformStyle",
+    "msTransition",
+    "msTransitionDelay",
+    "msTransitionDuration",
+    "msTransitionProperty",
+    "msTransitionTimingFunction",
+    "msUnlockOrientation",
+    "msUpdateAsyncCallbackRelation",
+    "msUserSelect",
+    "msVisibilityState",
+    "msWrapFlow",
+    "msWrapMargin",
+    "msWrapThrough",
+    "msWriteProfilerMark",
+    "msZoom",
+    "msZoomTo",
+    "mt",
+    "mul",
+    "multiEntry",
+    "multiSelectionObj",
+    "multiline",
+    "multiple",
+    "multiply",
+    "multiplySelf",
+    "mutableFile",
+    "muted",
+    "n",
+    "name",
+    "nameProp",
+    "namedItem",
+    "namedRecordset",
+    "names",
+    "namespaceURI",
+    "namespaces",
+    "naturalHeight",
+    "naturalWidth",
+    "navigate",
+    "navigation",
+    "navigationMode",
+    "navigationPreload",
+    "navigationStart",
+    "navigator",
+    "near",
+    "nearestViewportElement",
+    "negative",
+    "negotiated",
+    "netscape",
+    "networkState",
+    "newScale",
+    "newTranslate",
+    "newURL",
+    "newValue",
+    "newValueSpecifiedUnits",
+    "newVersion",
+    "newhome",
+    "next",
+    "nextElementSibling",
+    "nextHopProtocol",
+    "nextNode",
+    "nextPage",
+    "nextSibling",
+    "nickname",
+    "noHref",
+    "noModule",
+    "noResize",
+    "noShade",
+    "noValidate",
+    "noWrap",
+    "node",
+    "nodeName",
+    "nodeType",
+    "nodeValue",
+    "nonce",
+    "normalize",
+    "normalizedPathSegList",
+    "notationName",
+    "notations",
+    "note",
+    "noteGrainOn",
+    "noteOff",
+    "noteOn",
+    "notify",
+    "now",
+    "numOctaves",
+    "number",
+    "numberOfChannels",
+    "numberOfInputs",
+    "numberOfItems",
+    "numberOfOutputs",
+    "numberValue",
+    "oMatchesSelector",
+    "object",
+    "object-fit",
+    "object-position",
+    "objectFit",
+    "objectPosition",
+    "objectStore",
+    "objectStoreNames",
+    "objectType",
+    "observe",
+    "of",
+    "offscreenBuffering",
+    "offset",
+    "offset-anchor",
+    "offset-distance",
+    "offset-path",
+    "offset-rotate",
+    "offsetAnchor",
+    "offsetDistance",
+    "offsetHeight",
+    "offsetLeft",
+    "offsetNode",
+    "offsetParent",
+    "offsetPath",
+    "offsetRotate",
+    "offsetTop",
+    "offsetWidth",
+    "offsetX",
+    "offsetY",
+    "ok",
+    "oldURL",
+    "oldValue",
+    "oldVersion",
+    "olderShadowRoot",
+    "onLine",
+    "onabort",
+    "onabsolutedeviceorientation",
+    "onactivate",
+    "onactive",
+    "onaddsourcebuffer",
+    "onaddstream",
+    "onaddtrack",
+    "onafterprint",
+    "onafterscriptexecute",
+    "onafterupdate",
+    "onanimationcancel",
+    "onanimationend",
+    "onanimationiteration",
+    "onanimationstart",
+    "onappinstalled",
+    "onaudioend",
+    "onaudioprocess",
+    "onaudiostart",
+    "onautocomplete",
+    "onautocompleteerror",
+    "onauxclick",
+    "onbeforeactivate",
+    "onbeforecopy",
+    "onbeforecut",
+    "onbeforedeactivate",
+    "onbeforeeditfocus",
+    "onbeforeinstallprompt",
+    "onbeforepaste",
+    "onbeforeprint",
+    "onbeforescriptexecute",
+    "onbeforeunload",
+    "onbeforeupdate",
+    "onbeforexrselect",
+    "onbegin",
+    "onblocked",
+    "onblur",
+    "onbounce",
+    "onboundary",
+    "onbufferedamountlow",
+    "oncached",
+    "oncancel",
+    "oncandidatewindowhide",
+    "oncandidatewindowshow",
+    "oncandidatewindowupdate",
+    "oncanplay",
+    "oncanplaythrough",
+    "once",
+    "oncellchange",
+    "onchange",
+    "oncharacteristicvaluechanged",
+    "onchargingchange",
+    "onchargingtimechange",
+    "onchecking",
+    "onclick",
+    "onclose",
+    "onclosing",
+    "oncompassneedscalibration",
+    "oncomplete",
+    "onconnect",
+    "onconnecting",
+    "onconnectionavailable",
+    "onconnectionstatechange",
+    "oncontextmenu",
+    "oncontrollerchange",
+    "oncontrolselect",
+    "oncopy",
+    "oncuechange",
+    "oncut",
+    "ondataavailable",
+    "ondatachannel",
+    "ondatasetchanged",
+    "ondatasetcomplete",
+    "ondblclick",
+    "ondeactivate",
+    "ondevicechange",
+    "ondevicelight",
+    "ondevicemotion",
+    "ondeviceorientation",
+    "ondeviceorientationabsolute",
+    "ondeviceproximity",
+    "ondischargingtimechange",
+    "ondisconnect",
+    "ondisplay",
+    "ondownloading",
+    "ondrag",
+    "ondragend",
+    "ondragenter",
+    "ondragexit",
+    "ondragleave",
+    "ondragover",
+    "ondragstart",
+    "ondrop",
+    "ondurationchange",
+    "onemptied",
+    "onencrypted",
+    "onend",
+    "onended",
+    "onenter",
+    "onenterpictureinpicture",
+    "onerror",
+    "onerrorupdate",
+    "onexit",
+    "onfilterchange",
+    "onfinish",
+    "onfocus",
+    "onfocusin",
+    "onfocusout",
+    "onformdata",
+    "onfreeze",
+    "onfullscreenchange",
+    "onfullscreenerror",
+    "ongatheringstatechange",
+    "ongattserverdisconnected",
+    "ongesturechange",
+    "ongestureend",
+    "ongesturestart",
+    "ongotpointercapture",
+    "onhashchange",
+    "onhelp",
+    "onicecandidate",
+    "onicecandidateerror",
+    "oniceconnectionstatechange",
+    "onicegatheringstatechange",
+    "oninactive",
+    "oninput",
+    "oninputsourceschange",
+    "oninvalid",
+    "onkeydown",
+    "onkeypress",
+    "onkeystatuseschange",
+    "onkeyup",
+    "onlanguagechange",
+    "onlayoutcomplete",
+    "onleavepictureinpicture",
+    "onlevelchange",
+    "onload",
+    "onloadeddata",
+    "onloadedmetadata",
+    "onloadend",
+    "onloading",
+    "onloadingdone",
+    "onloadingerror",
+    "onloadstart",
+    "onlosecapture",
+    "onlostpointercapture",
+    "only",
+    "onmark",
+    "onmessage",
+    "onmessageerror",
+    "onmidimessage",
+    "onmousedown",
+    "onmouseenter",
+    "onmouseleave",
+    "onmousemove",
+    "onmouseout",
+    "onmouseover",
+    "onmouseup",
+    "onmousewheel",
+    "onmove",
+    "onmoveend",
+    "onmovestart",
+    "onmozfullscreenchange",
+    "onmozfullscreenerror",
+    "onmozorientationchange",
+    "onmozpointerlockchange",
+    "onmozpointerlockerror",
+    "onmscontentzoom",
+    "onmsfullscreenchange",
+    "onmsfullscreenerror",
+    "onmsgesturechange",
+    "onmsgesturedoubletap",
+    "onmsgestureend",
+    "onmsgesturehold",
+    "onmsgesturestart",
+    "onmsgesturetap",
+    "onmsgotpointercapture",
+    "onmsinertiastart",
+    "onmslostpointercapture",
+    "onmsmanipulationstatechanged",
+    "onmsneedkey",
+    "onmsorientationchange",
+    "onmspointercancel",
+    "onmspointerdown",
+    "onmspointerenter",
+    "onmspointerhover",
+    "onmspointerleave",
+    "onmspointermove",
+    "onmspointerout",
+    "onmspointerover",
+    "onmspointerup",
+    "onmssitemodejumplistitemremoved",
+    "onmsthumbnailclick",
+    "onmute",
+    "onnegotiationneeded",
+    "onnomatch",
+    "onnoupdate",
+    "onobsolete",
+    "onoffline",
+    "ononline",
+    "onopen",
+    "onorientationchange",
+    "onpagechange",
+    "onpagehide",
+    "onpageshow",
+    "onpaste",
+    "onpause",
+    "onpayerdetailchange",
+    "onpaymentmethodchange",
+    "onplay",
+    "onplaying",
+    "onpluginstreamstart",
+    "onpointercancel",
+    "onpointerdown",
+    "onpointerenter",
+    "onpointerleave",
+    "onpointerlockchange",
+    "onpointerlockerror",
+    "onpointermove",
+    "onpointerout",
+    "onpointerover",
+    "onpointerrawupdate",
+    "onpointerup",
+    "onpopstate",
+    "onprocessorerror",
+    "onprogress",
+    "onpropertychange",
+    "onratechange",
+    "onreading",
+    "onreadystatechange",
+    "onrejectionhandled",
+    "onrelease",
+    "onremove",
+    "onremovesourcebuffer",
+    "onremovestream",
+    "onremovetrack",
+    "onrepeat",
+    "onreset",
+    "onresize",
+    "onresizeend",
+    "onresizestart",
+    "onresourcetimingbufferfull",
+    "onresult",
+    "onresume",
+    "onrowenter",
+    "onrowexit",
+    "onrowsdelete",
+    "onrowsinserted",
+    "onscroll",
+    "onsearch",
+    "onsecuritypolicyviolation",
+    "onseeked",
+    "onseeking",
+    "onselect",
+    "onselectedcandidatepairchange",
+    "onselectend",
+    "onselectionchange",
+    "onselectstart",
+    "onshippingaddresschange",
+    "onshippingoptionchange",
+    "onshow",
+    "onsignalingstatechange",
+    "onsoundend",
+    "onsoundstart",
+    "onsourceclose",
+    "onsourceclosed",
+    "onsourceended",
+    "onsourceopen",
+    "onspeechend",
+    "onspeechstart",
+    "onsqueeze",
+    "onsqueezeend",
+    "onsqueezestart",
+    "onstalled",
+    "onstart",
+    "onstatechange",
+    "onstop",
+    "onstorage",
+    "onstoragecommit",
+    "onsubmit",
+    "onsuccess",
+    "onsuspend",
+    "onterminate",
+    "ontextinput",
+    "ontimeout",
+    "ontimeupdate",
+    "ontoggle",
+    "ontonechange",
+    "ontouchcancel",
+    "ontouchend",
+    "ontouchmove",
+    "ontouchstart",
+    "ontrack",
+    "ontransitioncancel",
+    "ontransitionend",
+    "ontransitionrun",
+    "ontransitionstart",
+    "onunhandledrejection",
+    "onunload",
+    "onunmute",
+    "onupdate",
+    "onupdateend",
+    "onupdatefound",
+    "onupdateready",
+    "onupdatestart",
+    "onupgradeneeded",
+    "onuserproximity",
+    "onversionchange",
+    "onvisibilitychange",
+    "onvoiceschanged",
+    "onvolumechange",
+    "onvrdisplayactivate",
+    "onvrdisplayconnect",
+    "onvrdisplaydeactivate",
+    "onvrdisplaydisconnect",
+    "onvrdisplaypresentchange",
+    "onwaiting",
+    "onwaitingforkey",
+    "onwarning",
+    "onwebkitanimationend",
+    "onwebkitanimationiteration",
+    "onwebkitanimationstart",
+    "onwebkitcurrentplaybacktargetiswirelesschanged",
+    "onwebkitfullscreenchange",
+    "onwebkitfullscreenerror",
+    "onwebkitkeyadded",
+    "onwebkitkeyerror",
+    "onwebkitkeymessage",
+    "onwebkitneedkey",
+    "onwebkitorientationchange",
+    "onwebkitplaybacktargetavailabilitychanged",
+    "onwebkitpointerlockchange",
+    "onwebkitpointerlockerror",
+    "onwebkitresourcetimingbufferfull",
+    "onwebkittransitionend",
+    "onwheel",
+    "onzoom",
+    "opacity",
+    "open",
+    "openCursor",
+    "openDatabase",
+    "openKeyCursor",
+    "opened",
+    "opener",
+    "opera",
+    "operationType",
+    "operator",
+    "opr",
+    "optimum",
+    "options",
+    "or",
+    "order",
+    "orderX",
+    "orderY",
+    "ordered",
+    "org",
+    "organization",
+    "orient",
+    "orientAngle",
+    "orientType",
+    "orientation",
+    "orientationX",
+    "orientationY",
+    "orientationZ",
+    "origin",
+    "originalPolicy",
+    "originalTarget",
+    "orphans",
+    "oscpu",
+    "outerHTML",
+    "outerHeight",
+    "outerText",
+    "outerWidth",
+    "outline",
+    "outline-color",
+    "outline-offset",
+    "outline-style",
+    "outline-width",
+    "outlineColor",
+    "outlineOffset",
+    "outlineStyle",
+    "outlineWidth",
+    "outputBuffer",
+    "outputLatency",
+    "outputs",
+    "overflow",
+    "overflow-anchor",
+    "overflow-block",
+    "overflow-inline",
+    "overflow-wrap",
+    "overflow-x",
+    "overflow-y",
+    "overflowAnchor",
+    "overflowBlock",
+    "overflowInline",
+    "overflowWrap",
+    "overflowX",
+    "overflowY",
+    "overrideMimeType",
+    "oversample",
+    "overscroll-behavior",
+    "overscroll-behavior-block",
+    "overscroll-behavior-inline",
+    "overscroll-behavior-x",
+    "overscroll-behavior-y",
+    "overscrollBehavior",
+    "overscrollBehaviorBlock",
+    "overscrollBehaviorInline",
+    "overscrollBehaviorX",
+    "overscrollBehaviorY",
+    "ownKeys",
+    "ownerDocument",
+    "ownerElement",
+    "ownerNode",
+    "ownerRule",
+    "ownerSVGElement",
+    "owningElement",
+    "p1",
+    "p2",
+    "p3",
+    "p4",
+    "packetSize",
+    "packets",
+    "pad",
+    "padEnd",
+    "padStart",
+    "padding",
+    "padding-block",
+    "padding-block-end",
+    "padding-block-start",
+    "padding-bottom",
+    "padding-inline",
+    "padding-inline-end",
+    "padding-inline-start",
+    "padding-left",
+    "padding-right",
+    "padding-top",
+    "paddingBlock",
+    "paddingBlockEnd",
+    "paddingBlockStart",
+    "paddingBottom",
+    "paddingInline",
+    "paddingInlineEnd",
+    "paddingInlineStart",
+    "paddingLeft",
+    "paddingRight",
+    "paddingTop",
+    "page",
+    "page-break-after",
+    "page-break-before",
+    "page-break-inside",
+    "pageBreakAfter",
+    "pageBreakBefore",
+    "pageBreakInside",
+    "pageCount",
+    "pageLeft",
+    "pageTop",
+    "pageX",
+    "pageXOffset",
+    "pageY",
+    "pageYOffset",
+    "pages",
+    "paint-order",
+    "paintOrder",
+    "paintRequests",
+    "paintType",
+    "paintWorklet",
+    "palette",
+    "pan",
+    "panningModel",
+    "parameters",
+    "parent",
+    "parentElement",
+    "parentNode",
+    "parentRule",
+    "parentStyleSheet",
+    "parentTextEdit",
+    "parentWindow",
+    "parse",
+    "parseAll",
+    "parseFloat",
+    "parseFromString",
+    "parseInt",
+    "part",
+    "participants",
+    "passive",
+    "password",
+    "pasteHTML",
+    "path",
+    "pathLength",
+    "pathSegList",
+    "pathSegType",
+    "pathSegTypeAsLetter",
+    "pathname",
+    "pattern",
+    "patternContentUnits",
+    "patternMismatch",
+    "patternTransform",
+    "patternUnits",
+    "pause",
+    "pauseAnimations",
+    "pauseOnExit",
+    "pauseProfilers",
+    "pauseTransformFeedback",
+    "paused",
+    "payerEmail",
+    "payerName",
+    "payerPhone",
+    "paymentManager",
+    "pc",
+    "peerIdentity",
+    "pending",
+    "pendingLocalDescription",
+    "pendingRemoteDescription",
+    "percent",
+    "performance",
+    "periodicSync",
+    "permission",
+    "permissionState",
+    "permissions",
+    "persist",
+    "persisted",
+    "personalbar",
+    "perspective",
+    "perspective-origin",
+    "perspectiveOrigin",
+    "phone",
+    "phoneticFamilyName",
+    "phoneticGivenName",
+    "photo",
+    "pictureInPictureElement",
+    "pictureInPictureEnabled",
+    "pictureInPictureWindow",
+    "ping",
+    "pipeThrough",
+    "pipeTo",
+    "pitch",
+    "pixelBottom",
+    "pixelDepth",
+    "pixelHeight",
+    "pixelLeft",
+    "pixelRight",
+    "pixelStorei",
+    "pixelTop",
+    "pixelUnitToMillimeterX",
+    "pixelUnitToMillimeterY",
+    "pixelWidth",
+    "place-content",
+    "place-items",
+    "place-self",
+    "placeContent",
+    "placeItems",
+    "placeSelf",
+    "placeholder",
+    "platform",
+    "platforms",
+    "play",
+    "playEffect",
+    "playState",
+    "playbackRate",
+    "playbackState",
+    "playbackTime",
+    "played",
+    "playoutDelayHint",
+    "playsInline",
+    "plugins",
+    "pluginspage",
+    "pname",
+    "pointer-events",
+    "pointerBeforeReferenceNode",
+    "pointerEnabled",
+    "pointerEvents",
+    "pointerId",
+    "pointerLockElement",
+    "pointerType",
+    "points",
+    "pointsAtX",
+    "pointsAtY",
+    "pointsAtZ",
+    "polygonOffset",
+    "pop",
+    "populateMatrix",
+    "popupWindowFeatures",
+    "popupWindowName",
+    "popupWindowURI",
+    "port",
+    "port1",
+    "port2",
+    "ports",
+    "posBottom",
+    "posHeight",
+    "posLeft",
+    "posRight",
+    "posTop",
+    "posWidth",
+    "pose",
+    "position",
+    "positionAlign",
+    "positionX",
+    "positionY",
+    "positionZ",
+    "postError",
+    "postMessage",
+    "postalCode",
+    "poster",
+    "pow",
+    "powerEfficient",
+    "powerOff",
+    "preMultiplySelf",
+    "precision",
+    "preferredStyleSheetSet",
+    "preferredStylesheetSet",
+    "prefix",
+    "preload",
+    "prepend",
+    "presentation",
+    "preserveAlpha",
+    "preserveAspectRatio",
+    "preserveAspectRatioString",
+    "pressed",
+    "pressure",
+    "prevValue",
+    "preventDefault",
+    "preventExtensions",
+    "preventSilentAccess",
+    "previousElementSibling",
+    "previousNode",
+    "previousPage",
+    "previousRect",
+    "previousScale",
+    "previousSibling",
+    "previousTranslate",
+    "primaryKey",
+    "primitiveType",
+    "primitiveUnits",
+    "principals",
+    "print",
+    "priority",
+    "privateKey",
+    "probablySupportsContext",
+    "process",
+    "processIceMessage",
+    "processingEnd",
+    "processingStart",
+    "product",
+    "productId",
+    "productName",
+    "productSub",
+    "profile",
+    "profileEnd",
+    "profiles",
+    "projectionMatrix",
+    "promise",
+    "prompt",
+    "properties",
+    "propertyIsEnumerable",
+    "propertyName",
+    "protocol",
+    "protocolLong",
+    "prototype",
+    "provider",
+    "pseudoClass",
+    "pseudoElement",
+    "pt",
+    "publicId",
+    "publicKey",
+    "published",
+    "pulse",
+    "push",
+    "pushManager",
+    "pushNotification",
+    "pushState",
+    "put",
+    "putImageData",
+    "px",
+    "quadraticCurveTo",
+    "qualifier",
+    "quaternion",
+    "query",
+    "queryCommandEnabled",
+    "queryCommandIndeterm",
+    "queryCommandState",
+    "queryCommandSupported",
+    "queryCommandText",
+    "queryCommandValue",
+    "querySelector",
+    "querySelectorAll",
+    "queueMicrotask",
+    "quote",
+    "quotes",
+    "r",
+    "r1",
+    "r2",
+    "race",
+    "rad",
+    "radiogroup",
+    "radiusX",
+    "radiusY",
+    "random",
+    "range",
+    "rangeCount",
+    "rangeMax",
+    "rangeMin",
+    "rangeOffset",
+    "rangeOverflow",
+    "rangeParent",
+    "rangeUnderflow",
+    "rate",
+    "ratio",
+    "raw",
+    "rawId",
+    "read",
+    "readAsArrayBuffer",
+    "readAsBinaryString",
+    "readAsBlob",
+    "readAsDataURL",
+    "readAsText",
+    "readBuffer",
+    "readEntries",
+    "readOnly",
+    "readPixels",
+    "readReportRequested",
+    "readText",
+    "readValue",
+    "readable",
+    "ready",
+    "readyState",
+    "reason",
+    "reboot",
+    "receivedAlert",
+    "receiver",
+    "receivers",
+    "recipient",
+    "reconnect",
+    "recordNumber",
+    "recordsAvailable",
+    "recordset",
+    "rect",
+    "red",
+    "redEyeReduction",
+    "redirect",
+    "redirectCount",
+    "redirectEnd",
+    "redirectStart",
+    "redirected",
+    "reduce",
+    "reduceRight",
+    "reduction",
+    "refDistance",
+    "refX",
+    "refY",
+    "referenceNode",
+    "referenceSpace",
+    "referrer",
+    "referrerPolicy",
+    "refresh",
+    "region",
+    "regionAnchorX",
+    "regionAnchorY",
+    "regionId",
+    "regions",
+    "register",
+    "registerContentHandler",
+    "registerElement",
+    "registerProperty",
+    "registerProtocolHandler",
+    "reject",
+    "rel",
+    "relList",
+    "relatedAddress",
+    "relatedNode",
+    "relatedPort",
+    "relatedTarget",
+    "release",
+    "releaseCapture",
+    "releaseEvents",
+    "releaseInterface",
+    "releaseLock",
+    "releasePointerCapture",
+    "releaseShaderCompiler",
+    "reliable",
+    "reliableWrite",
+    "reload",
+    "rem",
+    "remainingSpace",
+    "remote",
+    "remoteDescription",
+    "remove",
+    "removeAllRanges",
+    "removeAttribute",
+    "removeAttributeNS",
+    "removeAttributeNode",
+    "removeBehavior",
+    "removeChild",
+    "removeCue",
+    "removeEventListener",
+    "removeFilter",
+    "removeImport",
+    "removeItem",
+    "removeListener",
+    "removeNamedItem",
+    "removeNamedItemNS",
+    "removeNode",
+    "removeParameter",
+    "removeProperty",
+    "removeRange",
+    "removeRegion",
+    "removeRule",
+    "removeSiteSpecificTrackingException",
+    "removeSourceBuffer",
+    "removeStream",
+    "removeTrack",
+    "removeVariable",
+    "removeWakeLockListener",
+    "removeWebWideTrackingException",
+    "removed",
+    "removedNodes",
+    "renderHeight",
+    "renderState",
+    "renderTime",
+    "renderWidth",
+    "renderbufferStorage",
+    "renderbufferStorageMultisample",
+    "renderedBuffer",
+    "renderingMode",
+    "renotify",
+    "repeat",
+    "replace",
+    "replaceAdjacentText",
+    "replaceAll",
+    "replaceChild",
+    "replaceChildren",
+    "replaceData",
+    "replaceId",
+    "replaceItem",
+    "replaceNode",
+    "replaceState",
+    "replaceSync",
+    "replaceTrack",
+    "replaceWholeText",
+    "replaceWith",
+    "reportValidity",
+    "request",
+    "requestAnimationFrame",
+    "requestAutocomplete",
+    "requestData",
+    "requestDevice",
+    "requestFrame",
+    "requestFullscreen",
+    "requestHitTestSource",
+    "requestHitTestSourceForTransientInput",
+    "requestId",
+    "requestIdleCallback",
+    "requestMIDIAccess",
+    "requestMediaKeySystemAccess",
+    "requestPermission",
+    "requestPictureInPicture",
+    "requestPointerLock",
+    "requestPresent",
+    "requestReferenceSpace",
+    "requestSession",
+    "requestStart",
+    "requestStorageAccess",
+    "requestSubmit",
+    "requestVideoFrameCallback",
+    "requestingWindow",
+    "requireInteraction",
+    "required",
+    "requiredExtensions",
+    "requiredFeatures",
+    "reset",
+    "resetPose",
+    "resetTransform",
+    "resize",
+    "resizeBy",
+    "resizeTo",
+    "resolve",
+    "response",
+    "responseBody",
+    "responseEnd",
+    "responseReady",
+    "responseStart",
+    "responseText",
+    "responseType",
+    "responseURL",
+    "responseXML",
+    "restartIce",
+    "restore",
+    "result",
+    "resultIndex",
+    "resultType",
+    "results",
+    "resume",
+    "resumeProfilers",
+    "resumeTransformFeedback",
+    "retry",
+    "returnValue",
+    "rev",
+    "reverse",
+    "reversed",
+    "revocable",
+    "revokeObjectURL",
+    "rgbColor",
+    "right",
+    "rightContext",
+    "rightDegrees",
+    "rightMargin",
+    "rightProjectionMatrix",
+    "rightViewMatrix",
+    "role",
+    "rolloffFactor",
+    "root",
+    "rootBounds",
+    "rootElement",
+    "rootMargin",
+    "rotate",
+    "rotateAxisAngle",
+    "rotateAxisAngleSelf",
+    "rotateFromVector",
+    "rotateFromVectorSelf",
+    "rotateSelf",
+    "rotation",
+    "rotationAngle",
+    "rotationRate",
+    "round",
+    "row-gap",
+    "rowGap",
+    "rowIndex",
+    "rowSpan",
+    "rows",
+    "rtcpTransport",
+    "rtt",
+    "ruby-align",
+    "ruby-position",
+    "rubyAlign",
+    "rubyOverhang",
+    "rubyPosition",
+    "rules",
+    "runtime",
+    "runtimeStyle",
+    "rx",
+    "ry",
+    "s",
+    "safari",
+    "sample",
+    "sampleCoverage",
+    "sampleRate",
+    "samplerParameterf",
+    "samplerParameteri",
+    "sandbox",
+    "save",
+    "saveData",
+    "scale",
+    "scale3d",
+    "scale3dSelf",
+    "scaleNonUniform",
+    "scaleNonUniformSelf",
+    "scaleSelf",
+    "scheme",
+    "scissor",
+    "scope",
+    "scopeName",
+    "scoped",
+    "screen",
+    "screenBrightness",
+    "screenEnabled",
+    "screenLeft",
+    "screenPixelToMillimeterX",
+    "screenPixelToMillimeterY",
+    "screenTop",
+    "screenX",
+    "screenY",
+    "scriptURL",
+    "scripts",
+    "scroll",
+    "scroll-behavior",
+    "scroll-margin",
+    "scroll-margin-block",
+    "scroll-margin-block-end",
+    "scroll-margin-block-start",
+    "scroll-margin-bottom",
+    "scroll-margin-inline",
+    "scroll-margin-inline-end",
+    "scroll-margin-inline-start",
+    "scroll-margin-left",
+    "scroll-margin-right",
+    "scroll-margin-top",
+    "scroll-padding",
+    "scroll-padding-block",
+    "scroll-padding-block-end",
+    "scroll-padding-block-start",
+    "scroll-padding-bottom",
+    "scroll-padding-inline",
+    "scroll-padding-inline-end",
+    "scroll-padding-inline-start",
+    "scroll-padding-left",
+    "scroll-padding-right",
+    "scroll-padding-top",
+    "scroll-snap-align",
+    "scroll-snap-type",
+    "scrollAmount",
+    "scrollBehavior",
+    "scrollBy",
+    "scrollByLines",
+    "scrollByPages",
+    "scrollDelay",
+    "scrollHeight",
+    "scrollIntoView",
+    "scrollIntoViewIfNeeded",
+    "scrollLeft",
+    "scrollLeftMax",
+    "scrollMargin",
+    "scrollMarginBlock",
+    "scrollMarginBlockEnd",
+    "scrollMarginBlockStart",
+    "scrollMarginBottom",
+    "scrollMarginInline",
+    "scrollMarginInlineEnd",
+    "scrollMarginInlineStart",
+    "scrollMarginLeft",
+    "scrollMarginRight",
+    "scrollMarginTop",
+    "scrollMaxX",
+    "scrollMaxY",
+    "scrollPadding",
+    "scrollPaddingBlock",
+    "scrollPaddingBlockEnd",
+    "scrollPaddingBlockStart",
+    "scrollPaddingBottom",
+    "scrollPaddingInline",
+    "scrollPaddingInlineEnd",
+    "scrollPaddingInlineStart",
+    "scrollPaddingLeft",
+    "scrollPaddingRight",
+    "scrollPaddingTop",
+    "scrollRestoration",
+    "scrollSnapAlign",
+    "scrollSnapType",
+    "scrollTo",
+    "scrollTop",
+    "scrollTopMax",
+    "scrollWidth",
+    "scrollX",
+    "scrollY",
+    "scrollbar-color",
+    "scrollbar-width",
+    "scrollbar3dLightColor",
+    "scrollbarArrowColor",
+    "scrollbarBaseColor",
+    "scrollbarColor",
+    "scrollbarDarkShadowColor",
+    "scrollbarFaceColor",
+    "scrollbarHighlightColor",
+    "scrollbarShadowColor",
+    "scrollbarTrackColor",
+    "scrollbarWidth",
+    "scrollbars",
+    "scrolling",
+    "scrollingElement",
+    "sctp",
+    "sctpCauseCode",
+    "sdp",
+    "sdpLineNumber",
+    "sdpMLineIndex",
+    "sdpMid",
+    "seal",
+    "search",
+    "searchBox",
+    "searchBoxJavaBridge_",
+    "searchParams",
+    "sectionRowIndex",
+    "secureConnectionStart",
+    "security",
+    "seed",
+    "seekToNextFrame",
+    "seekable",
+    "seeking",
+    "select",
+    "selectAllChildren",
+    "selectAlternateInterface",
+    "selectConfiguration",
+    "selectNode",
+    "selectNodeContents",
+    "selectNodes",
+    "selectSingleNode",
+    "selectSubString",
+    "selected",
+    "selectedIndex",
+    "selectedOptions",
+    "selectedStyleSheetSet",
+    "selectedStylesheetSet",
+    "selection",
+    "selectionDirection",
+    "selectionEnd",
+    "selectionStart",
+    "selector",
+    "selectorText",
+    "self",
+    "send",
+    "sendAsBinary",
+    "sendBeacon",
+    "sender",
+    "sentAlert",
+    "sentTimestamp",
+    "separator",
+    "serialNumber",
+    "serializeToString",
+    "serverTiming",
+    "service",
+    "serviceWorker",
+    "session",
+    "sessionId",
+    "sessionStorage",
+    "set",
+    "setActionHandler",
+    "setActive",
+    "setAlpha",
+    "setAppBadge",
+    "setAttribute",
+    "setAttributeNS",
+    "setAttributeNode",
+    "setAttributeNodeNS",
+    "setBaseAndExtent",
+    "setBigInt64",
+    "setBigUint64",
+    "setBingCurrentSearchDefault",
+    "setCapture",
+    "setCodecPreferences",
+    "setColor",
+    "setCompositeOperation",
+    "setConfiguration",
+    "setCurrentTime",
+    "setCustomValidity",
+    "setData",
+    "setDate",
+    "setDragImage",
+    "setEnd",
+    "setEndAfter",
+    "setEndBefore",
+    "setEndPoint",
+    "setFillColor",
+    "setFilterRes",
+    "setFloat32",
+    "setFloat64",
+    "setFloatValue",
+    "setFormValue",
+    "setFullYear",
+    "setHeaderValue",
+    "setHours",
+    "setIdentityProvider",
+    "setImmediate",
+    "setInt16",
+    "setInt32",
+    "setInt8",
+    "setInterval",
+    "setItem",
+    "setKeyframes",
+    "setLineCap",
+    "setLineDash",
+    "setLineJoin",
+    "setLineWidth",
+    "setLiveSeekableRange",
+    "setLocalDescription",
+    "setMatrix",
+    "setMatrixValue",
+    "setMediaKeys",
+    "setMilliseconds",
+    "setMinutes",
+    "setMiterLimit",
+    "setMonth",
+    "setNamedItem",
+    "setNamedItemNS",
+    "setNonUserCodeExceptions",
+    "setOrientToAngle",
+    "setOrientToAuto",
+    "setOrientation",
+    "setOverrideHistoryNavigationMode",
+    "setPaint",
+    "setParameter",
+    "setParameters",
+    "setPeriodicWave",
+    "setPointerCapture",
+    "setPosition",
+    "setPositionState",
+    "setPreference",
+    "setProperty",
+    "setPrototypeOf",
+    "setRGBColor",
+    "setRGBColorICCColor",
+    "setRadius",
+    "setRangeText",
+    "setRemoteDescription",
+    "setRequestHeader",
+    "setResizable",
+    "setResourceTimingBufferSize",
+    "setRotate",
+    "setScale",
+    "setSeconds",
+    "setSelectionRange",
+    "setServerCertificate",
+    "setShadow",
+    "setSinkId",
+    "setSkewX",
+    "setSkewY",
+    "setStart",
+    "setStartAfter",
+    "setStartBefore",
+    "setStdDeviation",
+    "setStreams",
+    "setStringValue",
+    "setStrokeColor",
+    "setSuggestResult",
+    "setTargetAtTime",
+    "setTargetValueAtTime",
+    "setTime",
+    "setTimeout",
+    "setTransform",
+    "setTranslate",
+    "setUTCDate",
+    "setUTCFullYear",
+    "setUTCHours",
+    "setUTCMilliseconds",
+    "setUTCMinutes",
+    "setUTCMonth",
+    "setUTCSeconds",
+    "setUint16",
+    "setUint32",
+    "setUint8",
+    "setUri",
+    "setValidity",
+    "setValueAtTime",
+    "setValueCurveAtTime",
+    "setVariable",
+    "setVelocity",
+    "setVersion",
+    "setYear",
+    "settingName",
+    "settingValue",
+    "sex",
+    "shaderSource",
+    "shadowBlur",
+    "shadowColor",
+    "shadowOffsetX",
+    "shadowOffsetY",
+    "shadowRoot",
+    "shape",
+    "shape-image-threshold",
+    "shape-margin",
+    "shape-outside",
+    "shape-rendering",
+    "shapeImageThreshold",
+    "shapeMargin",
+    "shapeOutside",
+    "shapeRendering",
+    "sheet",
+    "shift",
+    "shiftKey",
+    "shiftLeft",
+    "shippingAddress",
+    "shippingOption",
+    "shippingType",
+    "show",
+    "showHelp",
+    "showModal",
+    "showModalDialog",
+    "showModelessDialog",
+    "showNotification",
+    "sidebar",
+    "sign",
+    "signal",
+    "signalingState",
+    "signature",
+    "silent",
+    "sin",
+    "singleNodeValue",
+    "sinh",
+    "sinkId",
+    "sittingToStandingTransform",
+    "size",
+    "sizeToContent",
+    "sizeX",
+    "sizeZ",
+    "sizes",
+    "skewX",
+    "skewXSelf",
+    "skewY",
+    "skewYSelf",
+    "slice",
+    "slope",
+    "slot",
+    "small",
+    "smil",
+    "smooth",
+    "smoothingTimeConstant",
+    "snapToLines",
+    "snapshotItem",
+    "snapshotLength",
+    "some",
+    "sort",
+    "sortingCode",
+    "source",
+    "sourceBuffer",
+    "sourceBuffers",
+    "sourceCapabilities",
+    "sourceFile",
+    "sourceIndex",
+    "sources",
+    "spacing",
+    "span",
+    "speak",
+    "speakAs",
+    "speaking",
+    "species",
+    "specified",
+    "specularConstant",
+    "specularExponent",
+    "speechSynthesis",
+    "speed",
+    "speedOfSound",
+    "spellcheck",
+    "splice",
+    "split",
+    "splitText",
+    "spreadMethod",
+    "sqrt",
+    "src",
+    "srcElement",
+    "srcFilter",
+    "srcObject",
+    "srcUrn",
+    "srcdoc",
+    "srclang",
+    "srcset",
+    "stack",
+    "stackTraceLimit",
+    "stacktrace",
+    "stageParameters",
+    "standalone",
+    "standby",
+    "start",
+    "startContainer",
+    "startIce",
+    "startMessages",
+    "startNotifications",
+    "startOffset",
+    "startProfiling",
+    "startRendering",
+    "startShark",
+    "startTime",
+    "startsWith",
+    "state",
+    "status",
+    "statusCode",
+    "statusMessage",
+    "statusText",
+    "statusbar",
+    "stdDeviationX",
+    "stdDeviationY",
+    "stencilFunc",
+    "stencilFuncSeparate",
+    "stencilMask",
+    "stencilMaskSeparate",
+    "stencilOp",
+    "stencilOpSeparate",
+    "step",
+    "stepDown",
+    "stepMismatch",
+    "stepUp",
+    "sticky",
+    "stitchTiles",
+    "stop",
+    "stop-color",
+    "stop-opacity",
+    "stopColor",
+    "stopImmediatePropagation",
+    "stopNotifications",
+    "stopOpacity",
+    "stopProfiling",
+    "stopPropagation",
+    "stopShark",
+    "stopped",
+    "storage",
+    "storageArea",
+    "storageName",
+    "storageStatus",
+    "store",
+    "storeSiteSpecificTrackingException",
+    "storeWebWideTrackingException",
+    "stpVersion",
+    "stream",
+    "streams",
+    "stretch",
+    "strike",
+    "string",
+    "stringValue",
+    "stringify",
+    "stroke",
+    "stroke-dasharray",
+    "stroke-dashoffset",
+    "stroke-linecap",
+    "stroke-linejoin",
+    "stroke-miterlimit",
+    "stroke-opacity",
+    "stroke-width",
+    "strokeDasharray",
+    "strokeDashoffset",
+    "strokeLinecap",
+    "strokeLinejoin",
+    "strokeMiterlimit",
+    "strokeOpacity",
+    "strokeRect",
+    "strokeStyle",
+    "strokeText",
+    "strokeWidth",
+    "style",
+    "styleFloat",
+    "styleMap",
+    "styleMedia",
+    "styleSheet",
+    "styleSheetSets",
+    "styleSheets",
+    "sub",
+    "subarray",
+    "subject",
+    "submit",
+    "submitFrame",
+    "submitter",
+    "subscribe",
+    "substr",
+    "substring",
+    "substringData",
+    "subtle",
+    "subtree",
+    "suffix",
+    "suffixes",
+    "summary",
+    "sup",
+    "supported",
+    "supportedContentEncodings",
+    "supportedEntryTypes",
+    "supports",
+    "supportsSession",
+    "surfaceScale",
+    "surroundContents",
+    "suspend",
+    "suspendRedraw",
+    "swapCache",
+    "swapNode",
+    "sweepFlag",
+    "symbols",
+    "sync",
+    "sysexEnabled",
+    "system",
+    "systemCode",
+    "systemId",
+    "systemLanguage",
+    "systemXDPI",
+    "systemYDPI",
+    "tBodies",
+    "tFoot",
+    "tHead",
+    "tabIndex",
+    "table",
+    "table-layout",
+    "tableLayout",
+    "tableValues",
+    "tag",
+    "tagName",
+    "tagUrn",
+    "tags",
+    "taintEnabled",
+    "takePhoto",
+    "takeRecords",
+    "tan",
+    "tangentialPressure",
+    "tanh",
+    "target",
+    "targetElement",
+    "targetRayMode",
+    "targetRaySpace",
+    "targetTouches",
+    "targetX",
+    "targetY",
+    "tcpType",
+    "tee",
+    "tel",
+    "terminate",
+    "test",
+    "texImage2D",
+    "texImage3D",
+    "texParameterf",
+    "texParameteri",
+    "texStorage2D",
+    "texStorage3D",
+    "texSubImage2D",
+    "texSubImage3D",
+    "text",
+    "text-align",
+    "text-align-last",
+    "text-anchor",
+    "text-combine-upright",
+    "text-decoration",
+    "text-decoration-color",
+    "text-decoration-line",
+    "text-decoration-skip-ink",
+    "text-decoration-style",
+    "text-decoration-thickness",
+    "text-emphasis",
+    "text-emphasis-color",
+    "text-emphasis-position",
+    "text-emphasis-style",
+    "text-indent",
+    "text-justify",
+    "text-orientation",
+    "text-overflow",
+    "text-rendering",
+    "text-shadow",
+    "text-transform",
+    "text-underline-offset",
+    "text-underline-position",
+    "textAlign",
+    "textAlignLast",
+    "textAnchor",
+    "textAutospace",
+    "textBaseline",
+    "textCombineUpright",
+    "textContent",
+    "textDecoration",
+    "textDecorationBlink",
+    "textDecorationColor",
+    "textDecorationLine",
+    "textDecorationLineThrough",
+    "textDecorationNone",
+    "textDecorationOverline",
+    "textDecorationSkipInk",
+    "textDecorationStyle",
+    "textDecorationThickness",
+    "textDecorationUnderline",
+    "textEmphasis",
+    "textEmphasisColor",
+    "textEmphasisPosition",
+    "textEmphasisStyle",
+    "textIndent",
+    "textJustify",
+    "textJustifyTrim",
+    "textKashida",
+    "textKashidaSpace",
+    "textLength",
+    "textOrientation",
+    "textOverflow",
+    "textRendering",
+    "textShadow",
+    "textTracks",
+    "textTransform",
+    "textUnderlineOffset",
+    "textUnderlinePosition",
+    "then",
+    "threadId",
+    "threshold",
+    "thresholds",
+    "tiltX",
+    "tiltY",
+    "time",
+    "timeEnd",
+    "timeLog",
+    "timeOrigin",
+    "timeRemaining",
+    "timeStamp",
+    "timecode",
+    "timeline",
+    "timelineTime",
+    "timeout",
+    "timestamp",
+    "timestampOffset",
+    "timing",
+    "title",
+    "to",
+    "toArray",
+    "toBlob",
+    "toDataURL",
+    "toDateString",
+    "toElement",
+    "toExponential",
+    "toFixed",
+    "toFloat32Array",
+    "toFloat64Array",
+    "toGMTString",
+    "toISOString",
+    "toJSON",
+    "toLocaleDateString",
+    "toLocaleFormat",
+    "toLocaleLowerCase",
+    "toLocaleString",
+    "toLocaleTimeString",
+    "toLocaleUpperCase",
+    "toLowerCase",
+    "toMatrix",
+    "toMethod",
+    "toPrecision",
+    "toPrimitive",
+    "toSdp",
+    "toSource",
+    "toStaticHTML",
+    "toString",
+    "toStringTag",
+    "toSum",
+    "toTimeString",
+    "toUTCString",
+    "toUpperCase",
+    "toggle",
+    "toggleAttribute",
+    "toggleLongPressEnabled",
+    "tone",
+    "toneBuffer",
+    "tooLong",
+    "tooShort",
+    "toolbar",
+    "top",
+    "topMargin",
+    "total",
+    "totalFrameDelay",
+    "totalVideoFrames",
+    "touch-action",
+    "touchAction",
+    "touched",
+    "touches",
+    "trace",
+    "track",
+    "trackVisibility",
+    "transaction",
+    "transactions",
+    "transceiver",
+    "transferControlToOffscreen",
+    "transferFromImageBitmap",
+    "transferImageBitmap",
+    "transferIn",
+    "transferOut",
+    "transferSize",
+    "transferToImageBitmap",
+    "transform",
+    "transform-box",
+    "transform-origin",
+    "transform-style",
+    "transformBox",
+    "transformFeedbackVaryings",
+    "transformOrigin",
+    "transformPoint",
+    "transformString",
+    "transformStyle",
+    "transformToDocument",
+    "transformToFragment",
+    "transition",
+    "transition-delay",
+    "transition-duration",
+    "transition-property",
+    "transition-timing-function",
+    "transitionDelay",
+    "transitionDuration",
+    "transitionProperty",
+    "transitionTimingFunction",
+    "translate",
+    "translateSelf",
+    "translationX",
+    "translationY",
+    "transport",
+    "trim",
+    "trimEnd",
+    "trimLeft",
+    "trimRight",
+    "trimStart",
+    "trueSpeed",
+    "trunc",
+    "truncate",
+    "trustedTypes",
+    "turn",
+    "twist",
+    "type",
+    "typeDetail",
+    "typeMismatch",
+    "typeMustMatch",
+    "types",
+    "u2f",
+    "ubound",
+    "uint16",
+    "uint32",
+    "uint8",
+    "uint8Clamped",
+    "undefined",
+    "unescape",
+    "uneval",
+    "unicode",
+    "unicode-bidi",
+    "unicodeBidi",
+    "unicodeRange",
+    "uniform1f",
+    "uniform1fv",
+    "uniform1i",
+    "uniform1iv",
+    "uniform1ui",
+    "uniform1uiv",
+    "uniform2f",
+    "uniform2fv",
+    "uniform2i",
+    "uniform2iv",
+    "uniform2ui",
+    "uniform2uiv",
+    "uniform3f",
+    "uniform3fv",
+    "uniform3i",
+    "uniform3iv",
+    "uniform3ui",
+    "uniform3uiv",
+    "uniform4f",
+    "uniform4fv",
+    "uniform4i",
+    "uniform4iv",
+    "uniform4ui",
+    "uniform4uiv",
+    "uniformBlockBinding",
+    "uniformMatrix2fv",
+    "uniformMatrix2x3fv",
+    "uniformMatrix2x4fv",
+    "uniformMatrix3fv",
+    "uniformMatrix3x2fv",
+    "uniformMatrix3x4fv",
+    "uniformMatrix4fv",
+    "uniformMatrix4x2fv",
+    "uniformMatrix4x3fv",
+    "unique",
+    "uniqueID",
+    "uniqueNumber",
+    "unit",
+    "unitType",
+    "units",
+    "unloadEventEnd",
+    "unloadEventStart",
+    "unlock",
+    "unmount",
+    "unobserve",
+    "unpause",
+    "unpauseAnimations",
+    "unreadCount",
+    "unregister",
+    "unregisterContentHandler",
+    "unregisterProtocolHandler",
+    "unscopables",
+    "unselectable",
+    "unshift",
+    "unsubscribe",
+    "unsuspendRedraw",
+    "unsuspendRedrawAll",
+    "unwatch",
+    "unwrapKey",
+    "upDegrees",
+    "upX",
+    "upY",
+    "upZ",
+    "update",
+    "updateCommands",
+    "updateIce",
+    "updateInterval",
+    "updatePlaybackRate",
+    "updateRenderState",
+    "updateSettings",
+    "updateTiming",
+    "updateViaCache",
+    "updateWith",
+    "updated",
+    "updating",
+    "upgrade",
+    "upload",
+    "uploadTotal",
+    "uploaded",
+    "upper",
+    "upperBound",
+    "upperOpen",
+    "uri",
+    "url",
+    "urn",
+    "urns",
+    "usages",
+    "usb",
+    "usbVersionMajor",
+    "usbVersionMinor",
+    "usbVersionSubminor",
+    "useCurrentView",
+    "useMap",
+    "useProgram",
+    "usedSpace",
+    "user-select",
+    "userActivation",
+    "userAgent",
+    "userChoice",
+    "userHandle",
+    "userHint",
+    "userLanguage",
+    "userSelect",
+    "userVisibleOnly",
+    "username",
+    "usernameFragment",
+    "utterance",
+    "uuid",
+    "v8BreakIterator",
+    "vAlign",
+    "vLink",
+    "valid",
+    "validate",
+    "validateProgram",
+    "validationMessage",
+    "validity",
+    "value",
+    "valueAsDate",
+    "valueAsNumber",
+    "valueAsString",
+    "valueInSpecifiedUnits",
+    "valueMissing",
+    "valueOf",
+    "valueText",
+    "valueType",
+    "values",
+    "variable",
+    "variant",
+    "variationSettings",
+    "vector-effect",
+    "vectorEffect",
+    "velocityAngular",
+    "velocityExpansion",
+    "velocityX",
+    "velocityY",
+    "vendor",
+    "vendorId",
+    "vendorSub",
+    "verify",
+    "version",
+    "vertexAttrib1f",
+    "vertexAttrib1fv",
+    "vertexAttrib2f",
+    "vertexAttrib2fv",
+    "vertexAttrib3f",
+    "vertexAttrib3fv",
+    "vertexAttrib4f",
+    "vertexAttrib4fv",
+    "vertexAttribDivisor",
+    "vertexAttribDivisorANGLE",
+    "vertexAttribI4i",
+    "vertexAttribI4iv",
+    "vertexAttribI4ui",
+    "vertexAttribI4uiv",
+    "vertexAttribIPointer",
+    "vertexAttribPointer",
+    "vertical",
+    "vertical-align",
+    "verticalAlign",
+    "verticalOverflow",
+    "vh",
+    "vibrate",
+    "vibrationActuator",
+    "videoBitsPerSecond",
+    "videoHeight",
+    "videoTracks",
+    "videoWidth",
+    "view",
+    "viewBox",
+    "viewBoxString",
+    "viewTarget",
+    "viewTargetString",
+    "viewport",
+    "viewportAnchorX",
+    "viewportAnchorY",
+    "viewportElement",
+    "views",
+    "violatedDirective",
+    "visibility",
+    "visibilityState",
+    "visible",
+    "visualViewport",
+    "vlinkColor",
+    "vmax",
+    "vmin",
+    "voice",
+    "voiceURI",
+    "volume",
+    "vrml",
+    "vspace",
+    "vw",
+    "w",
+    "wait",
+    "waitSync",
+    "waiting",
+    "wake",
+    "wakeLock",
+    "wand",
+    "warn",
+    "wasClean",
+    "wasDiscarded",
+    "watch",
+    "watchAvailability",
+    "watchPosition",
+    "webdriver",
+    "webkitAddKey",
+    "webkitAlignContent",
+    "webkitAlignItems",
+    "webkitAlignSelf",
+    "webkitAnimation",
+    "webkitAnimationDelay",
+    "webkitAnimationDirection",
+    "webkitAnimationDuration",
+    "webkitAnimationFillMode",
+    "webkitAnimationIterationCount",
+    "webkitAnimationName",
+    "webkitAnimationPlayState",
+    "webkitAnimationTimingFunction",
+    "webkitAppearance",
+    "webkitAudioContext",
+    "webkitAudioDecodedByteCount",
+    "webkitAudioPannerNode",
+    "webkitBackfaceVisibility",
+    "webkitBackground",
+    "webkitBackgroundAttachment",
+    "webkitBackgroundClip",
+    "webkitBackgroundColor",
+    "webkitBackgroundImage",
+    "webkitBackgroundOrigin",
+    "webkitBackgroundPosition",
+    "webkitBackgroundPositionX",
+    "webkitBackgroundPositionY",
+    "webkitBackgroundRepeat",
+    "webkitBackgroundSize",
+    "webkitBackingStorePixelRatio",
+    "webkitBorderBottomLeftRadius",
+    "webkitBorderBottomRightRadius",
+    "webkitBorderImage",
+    "webkitBorderImageOutset",
+    "webkitBorderImageRepeat",
+    "webkitBorderImageSlice",
+    "webkitBorderImageSource",
+    "webkitBorderImageWidth",
+    "webkitBorderRadius",
+    "webkitBorderTopLeftRadius",
+    "webkitBorderTopRightRadius",
+    "webkitBoxAlign",
+    "webkitBoxDirection",
+    "webkitBoxFlex",
+    "webkitBoxOrdinalGroup",
+    "webkitBoxOrient",
+    "webkitBoxPack",
+    "webkitBoxShadow",
+    "webkitBoxSizing",
+    "webkitCancelAnimationFrame",
+    "webkitCancelFullScreen",
+    "webkitCancelKeyRequest",
+    "webkitCancelRequestAnimationFrame",
+    "webkitClearResourceTimings",
+    "webkitClosedCaptionsVisible",
+    "webkitConvertPointFromNodeToPage",
+    "webkitConvertPointFromPageToNode",
+    "webkitCreateShadowRoot",
+    "webkitCurrentFullScreenElement",
+    "webkitCurrentPlaybackTargetIsWireless",
+    "webkitDecodedFrameCount",
+    "webkitDirectionInvertedFromDevice",
+    "webkitDisplayingFullscreen",
+    "webkitDroppedFrameCount",
+    "webkitEnterFullScreen",
+    "webkitEnterFullscreen",
+    "webkitEntries",
+    "webkitExitFullScreen",
+    "webkitExitFullscreen",
+    "webkitExitPointerLock",
+    "webkitFilter",
+    "webkitFlex",
+    "webkitFlexBasis",
+    "webkitFlexDirection",
+    "webkitFlexFlow",
+    "webkitFlexGrow",
+    "webkitFlexShrink",
+    "webkitFlexWrap",
+    "webkitFullScreenKeyboardInputAllowed",
+    "webkitFullscreenElement",
+    "webkitFullscreenEnabled",
+    "webkitGenerateKeyRequest",
+    "webkitGetAsEntry",
+    "webkitGetDatabaseNames",
+    "webkitGetEntries",
+    "webkitGetEntriesByName",
+    "webkitGetEntriesByType",
+    "webkitGetFlowByName",
+    "webkitGetGamepads",
+    "webkitGetImageDataHD",
+    "webkitGetNamedFlows",
+    "webkitGetRegionFlowRanges",
+    "webkitGetUserMedia",
+    "webkitHasClosedCaptions",
+    "webkitHidden",
+    "webkitIDBCursor",
+    "webkitIDBDatabase",
+    "webkitIDBDatabaseError",
+    "webkitIDBDatabaseException",
+    "webkitIDBFactory",
+    "webkitIDBIndex",
+    "webkitIDBKeyRange",
+    "webkitIDBObjectStore",
+    "webkitIDBRequest",
+    "webkitIDBTransaction",
+    "webkitImageSmoothingEnabled",
+    "webkitIndexedDB",
+    "webkitInitMessageEvent",
+    "webkitIsFullScreen",
+    "webkitJustifyContent",
+    "webkitKeys",
+    "webkitLineClamp",
+    "webkitLineDashOffset",
+    "webkitLockOrientation",
+    "webkitMask",
+    "webkitMaskClip",
+    "webkitMaskComposite",
+    "webkitMaskImage",
+    "webkitMaskOrigin",
+    "webkitMaskPosition",
+    "webkitMaskPositionX",
+    "webkitMaskPositionY",
+    "webkitMaskRepeat",
+    "webkitMaskSize",
+    "webkitMatchesSelector",
+    "webkitMediaStream",
+    "webkitNotifications",
+    "webkitOfflineAudioContext",
+    "webkitOrder",
+    "webkitOrientation",
+    "webkitPeerConnection00",
+    "webkitPersistentStorage",
+    "webkitPerspective",
+    "webkitPerspectiveOrigin",
+    "webkitPointerLockElement",
+    "webkitPostMessage",
+    "webkitPreservesPitch",
+    "webkitPutImageDataHD",
+    "webkitRTCPeerConnection",
+    "webkitRegionOverset",
+    "webkitRelativePath",
+    "webkitRequestAnimationFrame",
+    "webkitRequestFileSystem",
+    "webkitRequestFullScreen",
+    "webkitRequestFullscreen",
+    "webkitRequestPointerLock",
+    "webkitResolveLocalFileSystemURL",
+    "webkitSetMediaKeys",
+    "webkitSetResourceTimingBufferSize",
+    "webkitShadowRoot",
+    "webkitShowPlaybackTargetPicker",
+    "webkitSlice",
+    "webkitSpeechGrammar",
+    "webkitSpeechGrammarList",
+    "webkitSpeechRecognition",
+    "webkitSpeechRecognitionError",
+    "webkitSpeechRecognitionEvent",
+    "webkitStorageInfo",
+    "webkitSupportsFullscreen",
+    "webkitTemporaryStorage",
+    "webkitTextFillColor",
+    "webkitTextSizeAdjust",
+    "webkitTextStroke",
+    "webkitTextStrokeColor",
+    "webkitTextStrokeWidth",
+    "webkitTransform",
+    "webkitTransformOrigin",
+    "webkitTransformStyle",
+    "webkitTransition",
+    "webkitTransitionDelay",
+    "webkitTransitionDuration",
+    "webkitTransitionProperty",
+    "webkitTransitionTimingFunction",
+    "webkitURL",
+    "webkitUnlockOrientation",
+    "webkitUserSelect",
+    "webkitVideoDecodedByteCount",
+    "webkitVisibilityState",
+    "webkitWirelessVideoPlaybackDisabled",
+    "webkitdirectory",
+    "webkitdropzone",
+    "webstore",
+    "weight",
+    "whatToShow",
+    "wheelDelta",
+    "wheelDeltaX",
+    "wheelDeltaY",
+    "whenDefined",
+    "which",
+    "white-space",
+    "whiteSpace",
+    "wholeText",
+    "widows",
+    "width",
+    "will-change",
+    "willChange",
+    "willValidate",
+    "window",
+    "withCredentials",
+    "word-break",
+    "word-spacing",
+    "word-wrap",
+    "wordBreak",
+    "wordSpacing",
+    "wordWrap",
+    "workerStart",
+    "wrap",
+    "wrapKey",
+    "writable",
+    "writableAuxiliaries",
+    "write",
+    "writeText",
+    "writeValue",
+    "writeWithoutResponse",
+    "writeln",
+    "writing-mode",
+    "writingMode",
+    "x",
+    "x1",
+    "x2",
+    "xChannelSelector",
+    "xmlEncoding",
+    "xmlStandalone",
+    "xmlVersion",
+    "xmlbase",
+    "xmllang",
+    "xmlspace",
+    "xor",
+    "xr",
+    "y",
+    "y1",
+    "y2",
+    "yChannelSelector",
+    "yandex",
+    "z",
+    "z-index",
+    "zIndex",
+    "zoom",
+    "zoomAndPan",
+    "zoomRectScreen",
+];
diff --git a/node_modules/mathjs/examples/node_modules/terser/tools/exit.cjs b/node_modules/mathjs/examples/node_modules/terser/tools/exit.cjs
new file mode 100644
index 0000000..46a970b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/tools/exit.cjs
@@ -0,0 +1,7 @@
+// workaround for tty output truncation upon process.exit()
+// https://github.com/nodejs/node/issues/6456
+
+[process.stdout, process.stderr].forEach((s) => {
+  s && s.isTTY && s._handle && s._handle.setBlocking &&
+    s._handle.setBlocking(true)
+});
diff --git a/node_modules/mathjs/examples/node_modules/terser/tools/props.html b/node_modules/mathjs/examples/node_modules/terser/tools/props.html
new file mode 100644
index 0000000..eeae8a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/tools/props.html
@@ -0,0 +1,55 @@
+<html>
+  <head>
+  </head>
+  <body>
+    <script>(function(){
+      var props = {};
+
+      function addObject(obj) {
+        if (obj == null) return;
+        try {
+          Object.getOwnPropertyNames(obj).forEach(add);
+        } catch(ex) {}
+        if (obj.prototype) {
+          Object.getOwnPropertyNames(obj.prototype).forEach(add);
+        }
+        if (typeof obj == "function") {
+          try {
+            Object.getOwnPropertyNames(new obj).forEach(add);
+          } catch(ex) {}
+        }
+      }
+
+      function add(name) {
+        props[name] = true;
+      }
+
+      Object.getOwnPropertyNames(window).forEach(function(thing){
+        addObject(window[thing]);
+      });
+
+      try {
+        addObject(new Event("click"));
+        addObject(new Event("contextmenu"));
+        addObject(new Event("mouseup"));
+        addObject(new Event("mousedown"));
+        addObject(new Event("keydown"));
+        addObject(new Event("keypress"));
+        addObject(new Event("keyup"));
+      } catch(ex) {}
+
+      var ta = document.createElement("textarea");
+      ta.style.width = "100%";
+      ta.style.height = "20em";
+      ta.style.boxSizing = "border-box";
+      ta.value = 'export var domprops = ' + JSON.stringify(Object.keys(props).sort(cmp), null, 4);
+      document.body.appendChild(ta);
+
+      function cmp(a, b) {
+        a = a.toLowerCase();
+        b = b.toLowerCase();
+        return a < b ? -1 : a > b ? 1 : 0;
+      }
+    })();</script>
+  </body>
+</html>
diff --git a/node_modules/mathjs/examples/node_modules/terser/tools/terser.d.ts b/node_modules/mathjs/examples/node_modules/terser/tools/terser.d.ts
new file mode 100644
index 0000000..af7c94d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/terser/tools/terser.d.ts
@@ -0,0 +1,207 @@
+/// <reference lib="es2015" />
+
+import { RawSourceMap } from 'source-map';
+
+export type ECMA = 5 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020;
+
+export interface ParseOptions {
+    bare_returns?: boolean;
+    ecma?: ECMA;
+    html5_comments?: boolean;
+    shebang?: boolean;
+}
+
+export interface CompressOptions {
+    arguments?: boolean;
+    arrows?: boolean;
+    booleans_as_integers?: boolean;
+    booleans?: boolean;
+    collapse_vars?: boolean;
+    comparisons?: boolean;
+    computed_props?: boolean;
+    conditionals?: boolean;
+    dead_code?: boolean;
+    defaults?: boolean;
+    directives?: boolean;
+    drop_console?: boolean;
+    drop_debugger?: boolean;
+    ecma?: ECMA;
+    evaluate?: boolean;
+    expression?: boolean;
+    global_defs?: object;
+    hoist_funs?: boolean;
+    hoist_props?: boolean;
+    hoist_vars?: boolean;
+    ie8?: boolean;
+    if_return?: boolean;
+    inline?: boolean | InlineFunctions;
+    join_vars?: boolean;
+    keep_classnames?: boolean | RegExp;
+    keep_fargs?: boolean;
+    keep_fnames?: boolean | RegExp;
+    keep_infinity?: boolean;
+    loops?: boolean;
+    module?: boolean;
+    negate_iife?: boolean;
+    passes?: number;
+    properties?: boolean;
+    pure_funcs?: string[];
+    pure_getters?: boolean | 'strict';
+    reduce_funcs?: boolean;
+    reduce_vars?: boolean;
+    sequences?: boolean | number;
+    side_effects?: boolean;
+    switches?: boolean;
+    toplevel?: boolean;
+    top_retain?: null | string | string[] | RegExp;
+    typeofs?: boolean;
+    unsafe_arrows?: boolean;
+    unsafe?: boolean;
+    unsafe_comps?: boolean;
+    unsafe_Function?: boolean;
+    unsafe_math?: boolean;
+    unsafe_symbols?: boolean;
+    unsafe_methods?: boolean;
+    unsafe_proto?: boolean;
+    unsafe_regexp?: boolean;
+    unsafe_undefined?: boolean;
+    unused?: boolean;
+}
+
+export enum InlineFunctions {
+    Disabled = 0,
+    SimpleFunctions = 1,
+    WithArguments = 2,
+    WithArgumentsAndVariables = 3
+}
+
+export interface MangleOptions {
+    eval?: boolean;
+    keep_classnames?: boolean | RegExp;
+    keep_fnames?: boolean | RegExp;
+    module?: boolean;
+    nth_identifier?: SimpleIdentifierMangler | WeightedIdentifierMangler;
+    properties?: boolean | ManglePropertiesOptions;
+    reserved?: string[];
+    safari10?: boolean;
+    toplevel?: boolean;
+}
+
+/**
+ * An identifier mangler for which the output is invariant with respect to the source code.
+ */
+export interface SimpleIdentifierMangler {
+    /**
+     * Obtains the nth most favored (usually shortest) identifier to rename a variable to.
+     * The mangler will increment n and retry until the return value is not in use in scope, and is not a reserved word.
+     * This function is expected to be stable; Evaluating get(n) === get(n) should always return true.
+     * @param n The ordinal of the identifier.
+     */
+    get(n: number): string;
+}
+
+/**
+ * An identifier mangler that leverages character frequency analysis to determine identifier precedence.
+ */
+export interface WeightedIdentifierMangler extends SimpleIdentifierMangler {
+    /**
+     * Modifies the internal weighting of the input characters by the specified delta.
+     * Will be invoked on the entire printed AST, and then deduct mangleable identifiers.
+     * @param chars The characters to modify the weighting of.
+     * @param delta The numeric weight to add to the characters.
+     */
+    consider(chars: string, delta: number): number;
+    /**
+     * Resets character weights.
+     */
+    reset(): void;
+    /**
+     * Sorts identifiers by character frequency, in preparation for calls to get(n).
+     */
+    sort(): void;
+}
+
+export interface ManglePropertiesOptions {
+    builtins?: boolean;
+    debug?: boolean;
+    keep_quoted?: boolean | 'strict';
+    nth_identifier?: SimpleIdentifierMangler | WeightedIdentifierMangler;
+    regex?: RegExp | string;
+    reserved?: string[];
+}
+
+export interface FormatOptions {
+    ascii_only?: boolean;
+    /** @deprecated Not implemented anymore */
+    beautify?: boolean;
+    braces?: boolean;
+    comments?: boolean | 'all' | 'some' | RegExp | ( (node: any, comment: {
+        value: string,
+        type: 'comment1' | 'comment2' | 'comment3' | 'comment4',
+        pos: number,
+        line: number,
+        col: number,
+    }) => boolean );
+    ecma?: ECMA;
+    ie8?: boolean;
+    indent_level?: number;
+    indent_start?: number;
+    inline_script?: boolean;
+    keep_quoted_props?: boolean;
+    max_line_len?: number | false;
+    preamble?: string;
+    preserve_annotations?: boolean;
+    quote_keys?: boolean;
+    quote_style?: OutputQuoteStyle;
+    safari10?: boolean;
+    semicolons?: boolean;
+    shebang?: boolean;
+    shorthand?: boolean;
+    source_map?: SourceMapOptions;
+    webkit?: boolean;
+    width?: number;
+    wrap_iife?: boolean;
+    wrap_func_args?: boolean;
+}
+
+export enum OutputQuoteStyle {
+    PreferDouble = 0,
+    AlwaysSingle = 1,
+    AlwaysDouble = 2,
+    AlwaysOriginal = 3
+}
+
+export interface MinifyOptions {
+    compress?: boolean | CompressOptions;
+    ecma?: ECMA;
+    enclose?: boolean | string;
+    ie8?: boolean;
+    keep_classnames?: boolean | RegExp;
+    keep_fnames?: boolean | RegExp;
+    mangle?: boolean | MangleOptions;
+    module?: boolean;
+    nameCache?: object;
+    format?: FormatOptions;
+    /** @deprecated */
+    output?: FormatOptions;
+    parse?: ParseOptions;
+    safari10?: boolean;
+    sourceMap?: boolean | SourceMapOptions;
+    toplevel?: boolean;
+}
+
+export interface MinifyOutput {
+    code?: string;
+    map?: RawSourceMap | string;
+}
+
+export interface SourceMapOptions {
+    /** Source map object, 'inline' or source map file content */
+    content?: RawSourceMap | string;
+    includeSources?: boolean;
+    filename?: string;
+    root?: string;
+    url?: string | 'inline';
+}
+
+export function minify(files: string | string[] | { [file: string]: string }, options?: MinifyOptions): Promise<MinifyOutput>;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/LICENSE b/node_modules/mathjs/examples/node_modules/uri-js/LICENSE
new file mode 100644
index 0000000..9338bde
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/LICENSE
@@ -0,0 +1,11 @@
+Copyright 2011 Gary Court. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1.	Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+2.	Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY GARY COURT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GARY COURT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+The views and conclusions contained in the software and documentation are those of the authors and should not be interpreted as representing official policies, either expressed or implied, of Gary Court.
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/README.md b/node_modules/mathjs/examples/node_modules/uri-js/README.md
new file mode 100644
index 0000000..43e648b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/README.md
@@ -0,0 +1,203 @@
+# URI.js
+
+URI.js is an [RFC 3986](http://www.ietf.org/rfc/rfc3986.txt) compliant, scheme extendable URI parsing/validating/resolving library for all JavaScript environments (browsers, Node.js, etc).
+It is also compliant with the IRI ([RFC 3987](http://www.ietf.org/rfc/rfc3987.txt)), IDNA ([RFC 5890](http://www.ietf.org/rfc/rfc5890.txt)), IPv6 Address ([RFC 5952](http://www.ietf.org/rfc/rfc5952.txt)), IPv6 Zone Identifier ([RFC 6874](http://www.ietf.org/rfc/rfc6874.txt)) specifications.
+
+URI.js has an extensive test suite, and works in all (Node.js, web) environments. It weighs in at 6.4kb (gzipped, 17kb deflated).
+
+## API
+
+### Parsing
+
+	URI.parse("uri://user:pass@example.com:123/one/two.three?q1=a1&q2=a2#body");
+	//returns:
+	//{
+	//  scheme : "uri",
+	//  userinfo : "user:pass",
+	//  host : "example.com",
+	//  port : 123,
+	//  path : "/one/two.three",
+	//  query : "q1=a1&q2=a2",
+	//  fragment : "body"
+	//}
+
+### Serializing
+
+	URI.serialize({scheme : "http", host : "example.com", fragment : "footer"}) === "http://example.com/#footer"
+
+### Resolving
+
+	URI.resolve("uri://a/b/c/d?q", "../../g") === "uri://a/g"
+
+### Normalizing
+
+	URI.normalize("HTTP://ABC.com:80/%7Esmith/home.html") === "http://abc.com/~smith/home.html"
+
+### Comparison
+
+	URI.equal("example://a/b/c/%7Bfoo%7D", "eXAMPLE://a/./b/../b/%63/%7bfoo%7d") === true
+
+### IP Support
+
+	//IPv4 normalization
+	URI.normalize("//192.068.001.000") === "//192.68.1.0"
+
+	//IPv6 normalization
+	URI.normalize("//[2001:0:0DB8::0:0001]") === "//[2001:0:db8::1]"
+
+	//IPv6 zone identifier support
+	URI.parse("//[2001:db8::7%25en1]");
+	//returns:
+	//{
+	//  host : "2001:db8::7%en1"
+	//}
+
+### IRI Support
+
+	//convert IRI to URI
+	URI.serialize(URI.parse("http://examplé.org/rosé")) === "http://xn--exampl-gva.org/ros%C3%A9"
+	//convert URI to IRI
+	URI.serialize(URI.parse("http://xn--exampl-gva.org/ros%C3%A9"), {iri:true}) === "http://examplé.org/rosé"
+
+### Options
+
+All of the above functions can accept an additional options argument that is an object that can contain one or more of the following properties:
+
+*	`scheme` (string)
+
+	Indicates the scheme that the URI should be treated as, overriding the URI's normal scheme parsing behavior.
+
+*	`reference` (string)
+
+	If set to `"suffix"`, it indicates that the URI is in the suffix format, and the validator will use the option's `scheme` property to determine the URI's scheme.
+
+*	`tolerant` (boolean, false)
+
+	If set to `true`, the parser will relax URI resolving rules.
+
+*	`absolutePath` (boolean, false)
+
+	If set to `true`, the serializer will not resolve a relative `path` component.
+
+*	`iri` (boolean, false)
+
+	If set to `true`, the serializer will unescape non-ASCII characters as per [RFC 3987](http://www.ietf.org/rfc/rfc3987.txt).
+
+*	`unicodeSupport` (boolean, false)
+
+	If set to `true`, the parser will unescape non-ASCII characters in the parsed output as per [RFC 3987](http://www.ietf.org/rfc/rfc3987.txt).
+
+*	`domainHost` (boolean, false)
+
+	If set to `true`, the library will treat the `host` component as a domain name, and convert IDNs (International Domain Names) as per [RFC 5891](http://www.ietf.org/rfc/rfc5891.txt).
+
+## Scheme Extendable
+
+URI.js supports inserting custom [scheme](http://en.wikipedia.org/wiki/URI_scheme) dependent processing rules. Currently, URI.js has built in support for the following schemes:
+
+*	http \[[RFC 2616](http://www.ietf.org/rfc/rfc2616.txt)\]
+*	https \[[RFC 2818](http://www.ietf.org/rfc/rfc2818.txt)\]
+*	ws \[[RFC 6455](http://www.ietf.org/rfc/rfc6455.txt)\]
+*	wss \[[RFC 6455](http://www.ietf.org/rfc/rfc6455.txt)\]
+*	mailto \[[RFC 6068](http://www.ietf.org/rfc/rfc6068.txt)\]
+*	urn \[[RFC 2141](http://www.ietf.org/rfc/rfc2141.txt)\]
+*	urn:uuid \[[RFC 4122](http://www.ietf.org/rfc/rfc4122.txt)\]
+
+### HTTP/HTTPS Support
+
+	URI.equal("HTTP://ABC.COM:80", "http://abc.com/") === true
+	URI.equal("https://abc.com", "HTTPS://ABC.COM:443/") === true
+
+### WS/WSS Support
+
+	URI.parse("wss://example.com/foo?bar=baz");
+	//returns:
+	//{
+	//	scheme : "wss",
+	//	host: "example.com",
+	//	resourceName: "/foo?bar=baz",
+	//	secure: true,
+	//}
+
+	URI.equal("WS://ABC.COM:80/chat#one", "ws://abc.com/chat") === true
+
+### Mailto Support
+
+	URI.parse("mailto:alpha@example.com,bravo@example.com?subject=SUBSCRIBE&body=Sign%20me%20up!");
+	//returns:
+	//{
+	//	scheme : "mailto",
+	//	to : ["alpha@example.com", "bravo@example.com"],
+	//	subject : "SUBSCRIBE",
+	//	body : "Sign me up!"
+	//}
+
+	URI.serialize({
+		scheme : "mailto",
+		to : ["alpha@example.com"],
+		subject : "REMOVE",
+		body : "Please remove me",
+		headers : {
+			cc : "charlie@example.com"
+		}
+	}) === "mailto:alpha@example.com?cc=charlie@example.com&subject=REMOVE&body=Please%20remove%20me"
+
+### URN Support
+
+	URI.parse("urn:example:foo");
+	//returns:
+	//{
+	//	scheme : "urn",
+	//	nid : "example",
+	//	nss : "foo",
+	//}
+
+#### URN UUID Support
+
+	URI.parse("urn:uuid:f81d4fae-7dec-11d0-a765-00a0c91e6bf6");
+	//returns:
+	//{
+	//	scheme : "urn",
+	//	nid : "uuid",
+	//	uuid : "f81d4fae-7dec-11d0-a765-00a0c91e6bf6",
+	//}
+
+## Usage
+
+To load in a browser, use the following tag:
+
+	<script type="text/javascript" src="uri-js/dist/es5/uri.all.min.js"></script>
+
+To load in a CommonJS/Module environment, first install with npm/yarn by running on the command line:
+
+	npm install uri-js
+	# OR
+	yarn add uri-js
+
+Then, in your code, load it using:
+
+	const URI = require("uri-js");
+
+If you are writing your code in ES6+ (ESNEXT) or TypeScript, you would load it using:
+
+	import * as URI from "uri-js";
+
+Or you can load just what you need using named exports:
+
+	import { parse, serialize, resolve, resolveComponents, normalize, equal, removeDotSegments, pctEncChar, pctDecChars, escapeComponent, unescapeComponent } from "uri-js";
+
+## Breaking changes
+
+### Breaking changes from 3.x
+
+URN parsing has been completely changed to better align with the specification. Scheme is now always `urn`, but has two new properties: `nid` which contains the Namspace Identifier, and `nss` which contains the Namespace Specific String. The `nss` property will be removed by higher order scheme handlers, such as the UUID URN scheme handler.
+
+The UUID of a URN can now be found in the `uuid` property.
+
+### Breaking changes from 2.x
+
+URI validation has been removed as it was slow, exposed a vulnerabilty, and was generally not useful.
+
+### Breaking changes from 1.x
+
+The `errors` array on parsed components is now an `error` string.
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.d.ts
new file mode 100644
index 0000000..da51e23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.d.ts
@@ -0,0 +1,59 @@
+export interface URIComponents {
+    scheme?: string;
+    userinfo?: string;
+    host?: string;
+    port?: number | string;
+    path?: string;
+    query?: string;
+    fragment?: string;
+    reference?: string;
+    error?: string;
+}
+export interface URIOptions {
+    scheme?: string;
+    reference?: string;
+    tolerant?: boolean;
+    absolutePath?: boolean;
+    iri?: boolean;
+    unicodeSupport?: boolean;
+    domainHost?: boolean;
+}
+export interface URISchemeHandler<Components extends URIComponents = URIComponents, Options extends URIOptions = URIOptions, ParentComponents extends URIComponents = URIComponents> {
+    scheme: string;
+    parse(components: ParentComponents, options: Options): Components;
+    serialize(components: Components, options: Options): ParentComponents;
+    unicodeSupport?: boolean;
+    domainHost?: boolean;
+    absolutePath?: boolean;
+}
+export interface URIRegExps {
+    NOT_SCHEME: RegExp;
+    NOT_USERINFO: RegExp;
+    NOT_HOST: RegExp;
+    NOT_PATH: RegExp;
+    NOT_PATH_NOSCHEME: RegExp;
+    NOT_QUERY: RegExp;
+    NOT_FRAGMENT: RegExp;
+    ESCAPE: RegExp;
+    UNRESERVED: RegExp;
+    OTHER_CHARS: RegExp;
+    PCT_ENCODED: RegExp;
+    IPV4ADDRESS: RegExp;
+    IPV6ADDRESS: RegExp;
+}
+export declare const SCHEMES: {
+    [scheme: string]: URISchemeHandler;
+};
+export declare function pctEncChar(chr: string): string;
+export declare function pctDecChars(str: string): string;
+export declare function parse(uriString: string, options?: URIOptions): URIComponents;
+export declare function removeDotSegments(input: string): string;
+export declare function serialize(components: URIComponents, options?: URIOptions): string;
+export declare function resolveComponents(base: URIComponents, relative: URIComponents, options?: URIOptions, skipNormalization?: boolean): URIComponents;
+export declare function resolve(baseURI: string, relativeURI: string, options?: URIOptions): string;
+export declare function normalize(uri: string, options?: URIOptions): string;
+export declare function normalize(uri: URIComponents, options?: URIOptions): URIComponents;
+export declare function equal(uriA: string, uriB: string, options?: URIOptions): boolean;
+export declare function equal(uriA: URIComponents, uriB: URIComponents, options?: URIOptions): boolean;
+export declare function escapeComponent(str: string, options?: URIOptions): string;
+export declare function unescapeComponent(str: string, options?: URIOptions): string;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.js
new file mode 100644
index 0000000..0706116
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.js
@@ -0,0 +1,1443 @@
+/** @license URI.js v4.4.1 (c) 2011 Gary Court. License: http://github.com/garycourt/uri-js */
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+	typeof define === 'function' && define.amd ? define(['exports'], factory) :
+	(factory((global.URI = global.URI || {})));
+}(this, (function (exports) { 'use strict';
+
+function merge() {
+    for (var _len = arguments.length, sets = Array(_len), _key = 0; _key < _len; _key++) {
+        sets[_key] = arguments[_key];
+    }
+
+    if (sets.length > 1) {
+        sets[0] = sets[0].slice(0, -1);
+        var xl = sets.length - 1;
+        for (var x = 1; x < xl; ++x) {
+            sets[x] = sets[x].slice(1, -1);
+        }
+        sets[xl] = sets[xl].slice(1);
+        return sets.join('');
+    } else {
+        return sets[0];
+    }
+}
+function subexp(str) {
+    return "(?:" + str + ")";
+}
+function typeOf(o) {
+    return o === undefined ? "undefined" : o === null ? "null" : Object.prototype.toString.call(o).split(" ").pop().split("]").shift().toLowerCase();
+}
+function toUpperCase(str) {
+    return str.toUpperCase();
+}
+function toArray(obj) {
+    return obj !== undefined && obj !== null ? obj instanceof Array ? obj : typeof obj.length !== "number" || obj.split || obj.setInterval || obj.call ? [obj] : Array.prototype.slice.call(obj) : [];
+}
+function assign(target, source) {
+    var obj = target;
+    if (source) {
+        for (var key in source) {
+            obj[key] = source[key];
+        }
+    }
+    return obj;
+}
+
+function buildExps(isIRI) {
+    var ALPHA$$ = "[A-Za-z]",
+        CR$ = "[\\x0D]",
+        DIGIT$$ = "[0-9]",
+        DQUOTE$$ = "[\\x22]",
+        HEXDIG$$ = merge(DIGIT$$, "[A-Fa-f]"),
+        //case-insensitive
+    LF$$ = "[\\x0A]",
+        SP$$ = "[\\x20]",
+        PCT_ENCODED$ = subexp(subexp("%[EFef]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%[89A-Fa-f]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%" + HEXDIG$$ + HEXDIG$$)),
+        //expanded
+    GEN_DELIMS$$ = "[\\:\\/\\?\\#\\[\\]\\@]",
+        SUB_DELIMS$$ = "[\\!\\$\\&\\'\\(\\)\\*\\+\\,\\;\\=]",
+        RESERVED$$ = merge(GEN_DELIMS$$, SUB_DELIMS$$),
+        UCSCHAR$$ = isIRI ? "[\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]" : "[]",
+        //subset, excludes bidi control characters
+    IPRIVATE$$ = isIRI ? "[\\uE000-\\uF8FF]" : "[]",
+        //subset
+    UNRESERVED$$ = merge(ALPHA$$, DIGIT$$, "[\\-\\.\\_\\~]", UCSCHAR$$),
+        SCHEME$ = subexp(ALPHA$$ + merge(ALPHA$$, DIGIT$$, "[\\+\\-\\.]") + "*"),
+        USERINFO$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:]")) + "*"),
+        DEC_OCTET$ = subexp(subexp("25[0-5]") + "|" + subexp("2[0-4]" + DIGIT$$) + "|" + subexp("1" + DIGIT$$ + DIGIT$$) + "|" + subexp("[1-9]" + DIGIT$$) + "|" + DIGIT$$),
+        DEC_OCTET_RELAXED$ = subexp(subexp("25[0-5]") + "|" + subexp("2[0-4]" + DIGIT$$) + "|" + subexp("1" + DIGIT$$ + DIGIT$$) + "|" + subexp("0?[1-9]" + DIGIT$$) + "|0?0?" + DIGIT$$),
+        //relaxed parsing rules
+    IPV4ADDRESS$ = subexp(DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$),
+        H16$ = subexp(HEXDIG$$ + "{1,4}"),
+        LS32$ = subexp(subexp(H16$ + "\\:" + H16$) + "|" + IPV4ADDRESS$),
+        IPV6ADDRESS1$ = subexp(subexp(H16$ + "\\:") + "{6}" + LS32$),
+        //                           6( h16 ":" ) ls32
+    IPV6ADDRESS2$ = subexp("\\:\\:" + subexp(H16$ + "\\:") + "{5}" + LS32$),
+        //                      "::" 5( h16 ":" ) ls32
+    IPV6ADDRESS3$ = subexp(subexp(H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{4}" + LS32$),
+        //[               h16 ] "::" 4( h16 ":" ) ls32
+    IPV6ADDRESS4$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,1}" + H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{3}" + LS32$),
+        //[ *1( h16 ":" ) h16 ] "::" 3( h16 ":" ) ls32
+    IPV6ADDRESS5$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,2}" + H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{2}" + LS32$),
+        //[ *2( h16 ":" ) h16 ] "::" 2( h16 ":" ) ls32
+    IPV6ADDRESS6$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,3}" + H16$) + "?\\:\\:" + H16$ + "\\:" + LS32$),
+        //[ *3( h16 ":" ) h16 ] "::"    h16 ":"   ls32
+    IPV6ADDRESS7$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,4}" + H16$) + "?\\:\\:" + LS32$),
+        //[ *4( h16 ":" ) h16 ] "::"              ls32
+    IPV6ADDRESS8$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,5}" + H16$) + "?\\:\\:" + H16$),
+        //[ *5( h16 ":" ) h16 ] "::"              h16
+    IPV6ADDRESS9$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,6}" + H16$) + "?\\:\\:"),
+        //[ *6( h16 ":" ) h16 ] "::"
+    IPV6ADDRESS$ = subexp([IPV6ADDRESS1$, IPV6ADDRESS2$, IPV6ADDRESS3$, IPV6ADDRESS4$, IPV6ADDRESS5$, IPV6ADDRESS6$, IPV6ADDRESS7$, IPV6ADDRESS8$, IPV6ADDRESS9$].join("|")),
+        ZONEID$ = subexp(subexp(UNRESERVED$$ + "|" + PCT_ENCODED$) + "+"),
+        //RFC 6874
+    IPV6ADDRZ$ = subexp(IPV6ADDRESS$ + "\\%25" + ZONEID$),
+        //RFC 6874
+    IPV6ADDRZ_RELAXED$ = subexp(IPV6ADDRESS$ + subexp("\\%25|\\%(?!" + HEXDIG$$ + "{2})") + ZONEID$),
+        //RFC 6874, with relaxed parsing rules
+    IPVFUTURE$ = subexp("[vV]" + HEXDIG$$ + "+\\." + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:]") + "+"),
+        IP_LITERAL$ = subexp("\\[" + subexp(IPV6ADDRZ_RELAXED$ + "|" + IPV6ADDRESS$ + "|" + IPVFUTURE$) + "\\]"),
+        //RFC 6874
+    REG_NAME$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$)) + "*"),
+        HOST$ = subexp(IP_LITERAL$ + "|" + IPV4ADDRESS$ + "(?!" + REG_NAME$ + ")" + "|" + REG_NAME$),
+        PORT$ = subexp(DIGIT$$ + "*"),
+        AUTHORITY$ = subexp(subexp(USERINFO$ + "@") + "?" + HOST$ + subexp("\\:" + PORT$) + "?"),
+        PCHAR$ = subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@]")),
+        SEGMENT$ = subexp(PCHAR$ + "*"),
+        SEGMENT_NZ$ = subexp(PCHAR$ + "+"),
+        SEGMENT_NZ_NC$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\@]")) + "+"),
+        PATH_ABEMPTY$ = subexp(subexp("\\/" + SEGMENT$) + "*"),
+        PATH_ABSOLUTE$ = subexp("\\/" + subexp(SEGMENT_NZ$ + PATH_ABEMPTY$) + "?"),
+        //simplified
+    PATH_NOSCHEME$ = subexp(SEGMENT_NZ_NC$ + PATH_ABEMPTY$),
+        //simplified
+    PATH_ROOTLESS$ = subexp(SEGMENT_NZ$ + PATH_ABEMPTY$),
+        //simplified
+    PATH_EMPTY$ = "(?!" + PCHAR$ + ")",
+        PATH$ = subexp(PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$),
+        QUERY$ = subexp(subexp(PCHAR$ + "|" + merge("[\\/\\?]", IPRIVATE$$)) + "*"),
+        FRAGMENT$ = subexp(subexp(PCHAR$ + "|[\\/\\?]") + "*"),
+        HIER_PART$ = subexp(subexp("\\/\\/" + AUTHORITY$ + PATH_ABEMPTY$) + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$),
+        URI$ = subexp(SCHEME$ + "\\:" + HIER_PART$ + subexp("\\?" + QUERY$) + "?" + subexp("\\#" + FRAGMENT$) + "?"),
+        RELATIVE_PART$ = subexp(subexp("\\/\\/" + AUTHORITY$ + PATH_ABEMPTY$) + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_EMPTY$),
+        RELATIVE$ = subexp(RELATIVE_PART$ + subexp("\\?" + QUERY$) + "?" + subexp("\\#" + FRAGMENT$) + "?"),
+        URI_REFERENCE$ = subexp(URI$ + "|" + RELATIVE$),
+        ABSOLUTE_URI$ = subexp(SCHEME$ + "\\:" + HIER_PART$ + subexp("\\?" + QUERY$) + "?"),
+        GENERIC_REF$ = "^(" + SCHEME$ + ")\\:" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?" + subexp("\\#(" + FRAGMENT$ + ")") + "?$",
+        RELATIVE_REF$ = "^(){0}" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?" + subexp("\\#(" + FRAGMENT$ + ")") + "?$",
+        ABSOLUTE_REF$ = "^(" + SCHEME$ + ")\\:" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?$",
+        SAMEDOC_REF$ = "^" + subexp("\\#(" + FRAGMENT$ + ")") + "?$",
+        AUTHORITY_REF$ = "^" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?$";
+    return {
+        NOT_SCHEME: new RegExp(merge("[^]", ALPHA$$, DIGIT$$, "[\\+\\-\\.]"), "g"),
+        NOT_USERINFO: new RegExp(merge("[^\\%\\:]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_HOST: new RegExp(merge("[^\\%\\[\\]\\:]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_PATH: new RegExp(merge("[^\\%\\/\\:\\@]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_PATH_NOSCHEME: new RegExp(merge("[^\\%\\/\\@]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_QUERY: new RegExp(merge("[^\\%]", UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@\\/\\?]", IPRIVATE$$), "g"),
+        NOT_FRAGMENT: new RegExp(merge("[^\\%]", UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@\\/\\?]"), "g"),
+        ESCAPE: new RegExp(merge("[^]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        UNRESERVED: new RegExp(UNRESERVED$$, "g"),
+        OTHER_CHARS: new RegExp(merge("[^\\%]", UNRESERVED$$, RESERVED$$), "g"),
+        PCT_ENCODED: new RegExp(PCT_ENCODED$, "g"),
+        IPV4ADDRESS: new RegExp("^(" + IPV4ADDRESS$ + ")$"),
+        IPV6ADDRESS: new RegExp("^\\[?(" + IPV6ADDRESS$ + ")" + subexp(subexp("\\%25|\\%(?!" + HEXDIG$$ + "{2})") + "(" + ZONEID$ + ")") + "?\\]?$") //RFC 6874, with relaxed parsing rules
+    };
+}
+var URI_PROTOCOL = buildExps(false);
+
+var IRI_PROTOCOL = buildExps(true);
+
+var slicedToArray = function () {
+  function sliceIterator(arr, i) {
+    var _arr = [];
+    var _n = true;
+    var _d = false;
+    var _e = undefined;
+
+    try {
+      for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {
+        _arr.push(_s.value);
+
+        if (i && _arr.length === i) break;
+      }
+    } catch (err) {
+      _d = true;
+      _e = err;
+    } finally {
+      try {
+        if (!_n && _i["return"]) _i["return"]();
+      } finally {
+        if (_d) throw _e;
+      }
+    }
+
+    return _arr;
+  }
+
+  return function (arr, i) {
+    if (Array.isArray(arr)) {
+      return arr;
+    } else if (Symbol.iterator in Object(arr)) {
+      return sliceIterator(arr, i);
+    } else {
+      throw new TypeError("Invalid attempt to destructure non-iterable instance");
+    }
+  };
+}();
+
+
+
+
+
+
+
+
+
+
+
+
+
+var toConsumableArray = function (arr) {
+  if (Array.isArray(arr)) {
+    for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) arr2[i] = arr[i];
+
+    return arr2;
+  } else {
+    return Array.from(arr);
+  }
+};
+
+/** Highest positive signed 32-bit float value */
+
+var maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1
+
+/** Bootstring parameters */
+var base = 36;
+var tMin = 1;
+var tMax = 26;
+var skew = 38;
+var damp = 700;
+var initialBias = 72;
+var initialN = 128; // 0x80
+var delimiter = '-'; // '\x2D'
+
+/** Regular expressions */
+var regexPunycode = /^xn--/;
+var regexNonASCII = /[^\0-\x7E]/; // non-ASCII chars
+var regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g; // RFC 3490 separators
+
+/** Error messages */
+var errors = {
+	'overflow': 'Overflow: input needs wider integers to process',
+	'not-basic': 'Illegal input >= 0x80 (not a basic code point)',
+	'invalid-input': 'Invalid input'
+};
+
+/** Convenience shortcuts */
+var baseMinusTMin = base - tMin;
+var floor = Math.floor;
+var stringFromCharCode = String.fromCharCode;
+
+/*--------------------------------------------------------------------------*/
+
+/**
+ * A generic error utility function.
+ * @private
+ * @param {String} type The error type.
+ * @returns {Error} Throws a `RangeError` with the applicable error message.
+ */
+function error$1(type) {
+	throw new RangeError(errors[type]);
+}
+
+/**
+ * A generic `Array#map` utility function.
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} callback The function that gets called for every array
+ * item.
+ * @returns {Array} A new array of values returned by the callback function.
+ */
+function map(array, fn) {
+	var result = [];
+	var length = array.length;
+	while (length--) {
+		result[length] = fn(array[length]);
+	}
+	return result;
+}
+
+/**
+ * A simple `Array#map`-like wrapper to work with domain name strings or email
+ * addresses.
+ * @private
+ * @param {String} domain The domain name or email address.
+ * @param {Function} callback The function that gets called for every
+ * character.
+ * @returns {Array} A new string of characters returned by the callback
+ * function.
+ */
+function mapDomain(string, fn) {
+	var parts = string.split('@');
+	var result = '';
+	if (parts.length > 1) {
+		// In email addresses, only the domain name should be punycoded. Leave
+		// the local part (i.e. everything up to `@`) intact.
+		result = parts[0] + '@';
+		string = parts[1];
+	}
+	// Avoid `split(regex)` for IE8 compatibility. See #17.
+	string = string.replace(regexSeparators, '\x2E');
+	var labels = string.split('.');
+	var encoded = map(labels, fn).join('.');
+	return result + encoded;
+}
+
+/**
+ * Creates an array containing the numeric code points of each Unicode
+ * character in the string. While JavaScript uses UCS-2 internally,
+ * this function will convert a pair of surrogate halves (each of which
+ * UCS-2 exposes as separate characters) into a single code point,
+ * matching UTF-16.
+ * @see `punycode.ucs2.encode`
+ * @see <https://mathiasbynens.be/notes/javascript-encoding>
+ * @memberOf punycode.ucs2
+ * @name decode
+ * @param {String} string The Unicode input string (UCS-2).
+ * @returns {Array} The new array of code points.
+ */
+function ucs2decode(string) {
+	var output = [];
+	var counter = 0;
+	var length = string.length;
+	while (counter < length) {
+		var value = string.charCodeAt(counter++);
+		if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
+			// It's a high surrogate, and there is a next character.
+			var extra = string.charCodeAt(counter++);
+			if ((extra & 0xFC00) == 0xDC00) {
+				// Low surrogate.
+				output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
+			} else {
+				// It's an unmatched surrogate; only append this code unit, in case the
+				// next code unit is the high surrogate of a surrogate pair.
+				output.push(value);
+				counter--;
+			}
+		} else {
+			output.push(value);
+		}
+	}
+	return output;
+}
+
+/**
+ * Creates a string based on an array of numeric code points.
+ * @see `punycode.ucs2.decode`
+ * @memberOf punycode.ucs2
+ * @name encode
+ * @param {Array} codePoints The array of numeric code points.
+ * @returns {String} The new Unicode string (UCS-2).
+ */
+var ucs2encode = function ucs2encode(array) {
+	return String.fromCodePoint.apply(String, toConsumableArray(array));
+};
+
+/**
+ * Converts a basic code point into a digit/integer.
+ * @see `digitToBasic()`
+ * @private
+ * @param {Number} codePoint The basic numeric code point value.
+ * @returns {Number} The numeric value of a basic code point (for use in
+ * representing integers) in the range `0` to `base - 1`, or `base` if
+ * the code point does not represent a value.
+ */
+var basicToDigit = function basicToDigit(codePoint) {
+	if (codePoint - 0x30 < 0x0A) {
+		return codePoint - 0x16;
+	}
+	if (codePoint - 0x41 < 0x1A) {
+		return codePoint - 0x41;
+	}
+	if (codePoint - 0x61 < 0x1A) {
+		return codePoint - 0x61;
+	}
+	return base;
+};
+
+/**
+ * Converts a digit/integer into a basic code point.
+ * @see `basicToDigit()`
+ * @private
+ * @param {Number} digit The numeric value of a basic code point.
+ * @returns {Number} The basic code point whose value (when used for
+ * representing integers) is `digit`, which needs to be in the range
+ * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is
+ * used; else, the lowercase form is used. The behavior is undefined
+ * if `flag` is non-zero and `digit` has no uppercase form.
+ */
+var digitToBasic = function digitToBasic(digit, flag) {
+	//  0..25 map to ASCII a..z or A..Z
+	// 26..35 map to ASCII 0..9
+	return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+};
+
+/**
+ * Bias adaptation function as per section 3.4 of RFC 3492.
+ * https://tools.ietf.org/html/rfc3492#section-3.4
+ * @private
+ */
+var adapt = function adapt(delta, numPoints, firstTime) {
+	var k = 0;
+	delta = firstTime ? floor(delta / damp) : delta >> 1;
+	delta += floor(delta / numPoints);
+	for (; /* no initialization */delta > baseMinusTMin * tMax >> 1; k += base) {
+		delta = floor(delta / baseMinusTMin);
+	}
+	return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
+};
+
+/**
+ * Converts a Punycode string of ASCII-only symbols to a string of Unicode
+ * symbols.
+ * @memberOf punycode
+ * @param {String} input The Punycode string of ASCII-only symbols.
+ * @returns {String} The resulting string of Unicode symbols.
+ */
+var decode = function decode(input) {
+	// Don't use UCS-2.
+	var output = [];
+	var inputLength = input.length;
+	var i = 0;
+	var n = initialN;
+	var bias = initialBias;
+
+	// Handle the basic code points: let `basic` be the number of input code
+	// points before the last delimiter, or `0` if there is none, then copy
+	// the first basic code points to the output.
+
+	var basic = input.lastIndexOf(delimiter);
+	if (basic < 0) {
+		basic = 0;
+	}
+
+	for (var j = 0; j < basic; ++j) {
+		// if it's not a basic code point
+		if (input.charCodeAt(j) >= 0x80) {
+			error$1('not-basic');
+		}
+		output.push(input.charCodeAt(j));
+	}
+
+	// Main decoding loop: start just after the last delimiter if any basic code
+	// points were copied; start at the beginning otherwise.
+
+	for (var index = basic > 0 ? basic + 1 : 0; index < inputLength;) /* no final expression */{
+
+		// `index` is the index of the next character to be consumed.
+		// Decode a generalized variable-length integer into `delta`,
+		// which gets added to `i`. The overflow checking is easier
+		// if we increase `i` as we go, then subtract off its starting
+		// value at the end to obtain `delta`.
+		var oldi = i;
+		for (var w = 1, k = base;; /* no condition */k += base) {
+
+			if (index >= inputLength) {
+				error$1('invalid-input');
+			}
+
+			var digit = basicToDigit(input.charCodeAt(index++));
+
+			if (digit >= base || digit > floor((maxInt - i) / w)) {
+				error$1('overflow');
+			}
+
+			i += digit * w;
+			var t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+
+			if (digit < t) {
+				break;
+			}
+
+			var baseMinusT = base - t;
+			if (w > floor(maxInt / baseMinusT)) {
+				error$1('overflow');
+			}
+
+			w *= baseMinusT;
+		}
+
+		var out = output.length + 1;
+		bias = adapt(i - oldi, out, oldi == 0);
+
+		// `i` was supposed to wrap around from `out` to `0`,
+		// incrementing `n` each time, so we'll fix that now:
+		if (floor(i / out) > maxInt - n) {
+			error$1('overflow');
+		}
+
+		n += floor(i / out);
+		i %= out;
+
+		// Insert `n` at position `i` of the output.
+		output.splice(i++, 0, n);
+	}
+
+	return String.fromCodePoint.apply(String, output);
+};
+
+/**
+ * Converts a string of Unicode symbols (e.g. a domain name label) to a
+ * Punycode string of ASCII-only symbols.
+ * @memberOf punycode
+ * @param {String} input The string of Unicode symbols.
+ * @returns {String} The resulting Punycode string of ASCII-only symbols.
+ */
+var encode = function encode(input) {
+	var output = [];
+
+	// Convert the input in UCS-2 to an array of Unicode code points.
+	input = ucs2decode(input);
+
+	// Cache the length.
+	var inputLength = input.length;
+
+	// Initialize the state.
+	var n = initialN;
+	var delta = 0;
+	var bias = initialBias;
+
+	// Handle the basic code points.
+	var _iteratorNormalCompletion = true;
+	var _didIteratorError = false;
+	var _iteratorError = undefined;
+
+	try {
+		for (var _iterator = input[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+			var _currentValue2 = _step.value;
+
+			if (_currentValue2 < 0x80) {
+				output.push(stringFromCharCode(_currentValue2));
+			}
+		}
+	} catch (err) {
+		_didIteratorError = true;
+		_iteratorError = err;
+	} finally {
+		try {
+			if (!_iteratorNormalCompletion && _iterator.return) {
+				_iterator.return();
+			}
+		} finally {
+			if (_didIteratorError) {
+				throw _iteratorError;
+			}
+		}
+	}
+
+	var basicLength = output.length;
+	var handledCPCount = basicLength;
+
+	// `handledCPCount` is the number of code points that have been handled;
+	// `basicLength` is the number of basic code points.
+
+	// Finish the basic string with a delimiter unless it's empty.
+	if (basicLength) {
+		output.push(delimiter);
+	}
+
+	// Main encoding loop:
+	while (handledCPCount < inputLength) {
+
+		// All non-basic code points < n have been handled already. Find the next
+		// larger one:
+		var m = maxInt;
+		var _iteratorNormalCompletion2 = true;
+		var _didIteratorError2 = false;
+		var _iteratorError2 = undefined;
+
+		try {
+			for (var _iterator2 = input[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
+				var currentValue = _step2.value;
+
+				if (currentValue >= n && currentValue < m) {
+					m = currentValue;
+				}
+			}
+
+			// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,
+			// but guard against overflow.
+		} catch (err) {
+			_didIteratorError2 = true;
+			_iteratorError2 = err;
+		} finally {
+			try {
+				if (!_iteratorNormalCompletion2 && _iterator2.return) {
+					_iterator2.return();
+				}
+			} finally {
+				if (_didIteratorError2) {
+					throw _iteratorError2;
+				}
+			}
+		}
+
+		var handledCPCountPlusOne = handledCPCount + 1;
+		if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
+			error$1('overflow');
+		}
+
+		delta += (m - n) * handledCPCountPlusOne;
+		n = m;
+
+		var _iteratorNormalCompletion3 = true;
+		var _didIteratorError3 = false;
+		var _iteratorError3 = undefined;
+
+		try {
+			for (var _iterator3 = input[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {
+				var _currentValue = _step3.value;
+
+				if (_currentValue < n && ++delta > maxInt) {
+					error$1('overflow');
+				}
+				if (_currentValue == n) {
+					// Represent delta as a generalized variable-length integer.
+					var q = delta;
+					for (var k = base;; /* no condition */k += base) {
+						var t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+						if (q < t) {
+							break;
+						}
+						var qMinusT = q - t;
+						var baseMinusT = base - t;
+						output.push(stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0)));
+						q = floor(qMinusT / baseMinusT);
+					}
+
+					output.push(stringFromCharCode(digitToBasic(q, 0)));
+					bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);
+					delta = 0;
+					++handledCPCount;
+				}
+			}
+		} catch (err) {
+			_didIteratorError3 = true;
+			_iteratorError3 = err;
+		} finally {
+			try {
+				if (!_iteratorNormalCompletion3 && _iterator3.return) {
+					_iterator3.return();
+				}
+			} finally {
+				if (_didIteratorError3) {
+					throw _iteratorError3;
+				}
+			}
+		}
+
+		++delta;
+		++n;
+	}
+	return output.join('');
+};
+
+/**
+ * Converts a Punycode string representing a domain name or an email address
+ * to Unicode. Only the Punycoded parts of the input will be converted, i.e.
+ * it doesn't matter if you call it on a string that has already been
+ * converted to Unicode.
+ * @memberOf punycode
+ * @param {String} input The Punycoded domain name or email address to
+ * convert to Unicode.
+ * @returns {String} The Unicode representation of the given Punycode
+ * string.
+ */
+var toUnicode = function toUnicode(input) {
+	return mapDomain(input, function (string) {
+		return regexPunycode.test(string) ? decode(string.slice(4).toLowerCase()) : string;
+	});
+};
+
+/**
+ * Converts a Unicode string representing a domain name or an email address to
+ * Punycode. Only the non-ASCII parts of the domain name will be converted,
+ * i.e. it doesn't matter if you call it with a domain that's already in
+ * ASCII.
+ * @memberOf punycode
+ * @param {String} input The domain name or email address to convert, as a
+ * Unicode string.
+ * @returns {String} The Punycode representation of the given domain name or
+ * email address.
+ */
+var toASCII = function toASCII(input) {
+	return mapDomain(input, function (string) {
+		return regexNonASCII.test(string) ? 'xn--' + encode(string) : string;
+	});
+};
+
+/*--------------------------------------------------------------------------*/
+
+/** Define the public API */
+var punycode = {
+	/**
+  * A string representing the current Punycode.js version number.
+  * @memberOf punycode
+  * @type String
+  */
+	'version': '2.1.0',
+	/**
+  * An object of methods to convert from JavaScript's internal character
+  * representation (UCS-2) to Unicode code points, and back.
+  * @see <https://mathiasbynens.be/notes/javascript-encoding>
+  * @memberOf punycode
+  * @type Object
+  */
+	'ucs2': {
+		'decode': ucs2decode,
+		'encode': ucs2encode
+	},
+	'decode': decode,
+	'encode': encode,
+	'toASCII': toASCII,
+	'toUnicode': toUnicode
+};
+
+/**
+ * URI.js
+ *
+ * @fileoverview An RFC 3986 compliant, scheme extendable URI parsing/validating/resolving library for JavaScript.
+ * @author <a href="mailto:gary.court@gmail.com">Gary Court</a>
+ * @see http://github.com/garycourt/uri-js
+ */
+/**
+ * Copyright 2011 Gary Court. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without modification, are
+ * permitted provided that the following conditions are met:
+ *
+ *    1. Redistributions of source code must retain the above copyright notice, this list of
+ *       conditions and the following disclaimer.
+ *
+ *    2. Redistributions in binary form must reproduce the above copyright notice, this list
+ *       of conditions and the following disclaimer in the documentation and/or other materials
+ *       provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY GARY COURT ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GARY COURT OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * The views and conclusions contained in the software and documentation are those of the
+ * authors and should not be interpreted as representing official policies, either expressed
+ * or implied, of Gary Court.
+ */
+var SCHEMES = {};
+function pctEncChar(chr) {
+    var c = chr.charCodeAt(0);
+    var e = void 0;
+    if (c < 16) e = "%0" + c.toString(16).toUpperCase();else if (c < 128) e = "%" + c.toString(16).toUpperCase();else if (c < 2048) e = "%" + (c >> 6 | 192).toString(16).toUpperCase() + "%" + (c & 63 | 128).toString(16).toUpperCase();else e = "%" + (c >> 12 | 224).toString(16).toUpperCase() + "%" + (c >> 6 & 63 | 128).toString(16).toUpperCase() + "%" + (c & 63 | 128).toString(16).toUpperCase();
+    return e;
+}
+function pctDecChars(str) {
+    var newStr = "";
+    var i = 0;
+    var il = str.length;
+    while (i < il) {
+        var c = parseInt(str.substr(i + 1, 2), 16);
+        if (c < 128) {
+            newStr += String.fromCharCode(c);
+            i += 3;
+        } else if (c >= 194 && c < 224) {
+            if (il - i >= 6) {
+                var c2 = parseInt(str.substr(i + 4, 2), 16);
+                newStr += String.fromCharCode((c & 31) << 6 | c2 & 63);
+            } else {
+                newStr += str.substr(i, 6);
+            }
+            i += 6;
+        } else if (c >= 224) {
+            if (il - i >= 9) {
+                var _c = parseInt(str.substr(i + 4, 2), 16);
+                var c3 = parseInt(str.substr(i + 7, 2), 16);
+                newStr += String.fromCharCode((c & 15) << 12 | (_c & 63) << 6 | c3 & 63);
+            } else {
+                newStr += str.substr(i, 9);
+            }
+            i += 9;
+        } else {
+            newStr += str.substr(i, 3);
+            i += 3;
+        }
+    }
+    return newStr;
+}
+function _normalizeComponentEncoding(components, protocol) {
+    function decodeUnreserved(str) {
+        var decStr = pctDecChars(str);
+        return !decStr.match(protocol.UNRESERVED) ? str : decStr;
+    }
+    if (components.scheme) components.scheme = String(components.scheme).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_SCHEME, "");
+    if (components.userinfo !== undefined) components.userinfo = String(components.userinfo).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_USERINFO, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.host !== undefined) components.host = String(components.host).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_HOST, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.path !== undefined) components.path = String(components.path).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(components.scheme ? protocol.NOT_PATH : protocol.NOT_PATH_NOSCHEME, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.query !== undefined) components.query = String(components.query).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_QUERY, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.fragment !== undefined) components.fragment = String(components.fragment).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_FRAGMENT, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    return components;
+}
+
+function _stripLeadingZeros(str) {
+    return str.replace(/^0*(.*)/, "$1") || "0";
+}
+function _normalizeIPv4(host, protocol) {
+    var matches = host.match(protocol.IPV4ADDRESS) || [];
+
+    var _matches = slicedToArray(matches, 2),
+        address = _matches[1];
+
+    if (address) {
+        return address.split(".").map(_stripLeadingZeros).join(".");
+    } else {
+        return host;
+    }
+}
+function _normalizeIPv6(host, protocol) {
+    var matches = host.match(protocol.IPV6ADDRESS) || [];
+
+    var _matches2 = slicedToArray(matches, 3),
+        address = _matches2[1],
+        zone = _matches2[2];
+
+    if (address) {
+        var _address$toLowerCase$ = address.toLowerCase().split('::').reverse(),
+            _address$toLowerCase$2 = slicedToArray(_address$toLowerCase$, 2),
+            last = _address$toLowerCase$2[0],
+            first = _address$toLowerCase$2[1];
+
+        var firstFields = first ? first.split(":").map(_stripLeadingZeros) : [];
+        var lastFields = last.split(":").map(_stripLeadingZeros);
+        var isLastFieldIPv4Address = protocol.IPV4ADDRESS.test(lastFields[lastFields.length - 1]);
+        var fieldCount = isLastFieldIPv4Address ? 7 : 8;
+        var lastFieldsStart = lastFields.length - fieldCount;
+        var fields = Array(fieldCount);
+        for (var x = 0; x < fieldCount; ++x) {
+            fields[x] = firstFields[x] || lastFields[lastFieldsStart + x] || '';
+        }
+        if (isLastFieldIPv4Address) {
+            fields[fieldCount - 1] = _normalizeIPv4(fields[fieldCount - 1], protocol);
+        }
+        var allZeroFields = fields.reduce(function (acc, field, index) {
+            if (!field || field === "0") {
+                var lastLongest = acc[acc.length - 1];
+                if (lastLongest && lastLongest.index + lastLongest.length === index) {
+                    lastLongest.length++;
+                } else {
+                    acc.push({ index: index, length: 1 });
+                }
+            }
+            return acc;
+        }, []);
+        var longestZeroFields = allZeroFields.sort(function (a, b) {
+            return b.length - a.length;
+        })[0];
+        var newHost = void 0;
+        if (longestZeroFields && longestZeroFields.length > 1) {
+            var newFirst = fields.slice(0, longestZeroFields.index);
+            var newLast = fields.slice(longestZeroFields.index + longestZeroFields.length);
+            newHost = newFirst.join(":") + "::" + newLast.join(":");
+        } else {
+            newHost = fields.join(":");
+        }
+        if (zone) {
+            newHost += "%" + zone;
+        }
+        return newHost;
+    } else {
+        return host;
+    }
+}
+var URI_PARSE = /^(?:([^:\/?#]+):)?(?:\/\/((?:([^\/?#@]*)@)?(\[[^\/?#\]]+\]|[^\/?#:]*)(?:\:(\d*))?))?([^?#]*)(?:\?([^#]*))?(?:#((?:.|\n|\r)*))?/i;
+var NO_MATCH_IS_UNDEFINED = "".match(/(){0}/)[1] === undefined;
+function parse(uriString) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+
+    var components = {};
+    var protocol = options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL;
+    if (options.reference === "suffix") uriString = (options.scheme ? options.scheme + ":" : "") + "//" + uriString;
+    var matches = uriString.match(URI_PARSE);
+    if (matches) {
+        if (NO_MATCH_IS_UNDEFINED) {
+            //store each component
+            components.scheme = matches[1];
+            components.userinfo = matches[3];
+            components.host = matches[4];
+            components.port = parseInt(matches[5], 10);
+            components.path = matches[6] || "";
+            components.query = matches[7];
+            components.fragment = matches[8];
+            //fix port number
+            if (isNaN(components.port)) {
+                components.port = matches[5];
+            }
+        } else {
+            //IE FIX for improper RegExp matching
+            //store each component
+            components.scheme = matches[1] || undefined;
+            components.userinfo = uriString.indexOf("@") !== -1 ? matches[3] : undefined;
+            components.host = uriString.indexOf("//") !== -1 ? matches[4] : undefined;
+            components.port = parseInt(matches[5], 10);
+            components.path = matches[6] || "";
+            components.query = uriString.indexOf("?") !== -1 ? matches[7] : undefined;
+            components.fragment = uriString.indexOf("#") !== -1 ? matches[8] : undefined;
+            //fix port number
+            if (isNaN(components.port)) {
+                components.port = uriString.match(/\/\/(?:.|\n)*\:(?:\/|\?|\#|$)/) ? matches[4] : undefined;
+            }
+        }
+        if (components.host) {
+            //normalize IP hosts
+            components.host = _normalizeIPv6(_normalizeIPv4(components.host, protocol), protocol);
+        }
+        //determine reference type
+        if (components.scheme === undefined && components.userinfo === undefined && components.host === undefined && components.port === undefined && !components.path && components.query === undefined) {
+            components.reference = "same-document";
+        } else if (components.scheme === undefined) {
+            components.reference = "relative";
+        } else if (components.fragment === undefined) {
+            components.reference = "absolute";
+        } else {
+            components.reference = "uri";
+        }
+        //check for reference errors
+        if (options.reference && options.reference !== "suffix" && options.reference !== components.reference) {
+            components.error = components.error || "URI is not a " + options.reference + " reference.";
+        }
+        //find scheme handler
+        var schemeHandler = SCHEMES[(options.scheme || components.scheme || "").toLowerCase()];
+        //check if scheme can't handle IRIs
+        if (!options.unicodeSupport && (!schemeHandler || !schemeHandler.unicodeSupport)) {
+            //if host component is a domain name
+            if (components.host && (options.domainHost || schemeHandler && schemeHandler.domainHost)) {
+                //convert Unicode IDN -> ASCII IDN
+                try {
+                    components.host = punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase());
+                } catch (e) {
+                    components.error = components.error || "Host's domain name can not be converted to ASCII via punycode: " + e;
+                }
+            }
+            //convert IRI -> URI
+            _normalizeComponentEncoding(components, URI_PROTOCOL);
+        } else {
+            //normalize encodings
+            _normalizeComponentEncoding(components, protocol);
+        }
+        //perform scheme specific parsing
+        if (schemeHandler && schemeHandler.parse) {
+            schemeHandler.parse(components, options);
+        }
+    } else {
+        components.error = components.error || "URI can not be parsed.";
+    }
+    return components;
+}
+
+function _recomposeAuthority(components, options) {
+    var protocol = options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL;
+    var uriTokens = [];
+    if (components.userinfo !== undefined) {
+        uriTokens.push(components.userinfo);
+        uriTokens.push("@");
+    }
+    if (components.host !== undefined) {
+        //normalize IP hosts, add brackets and escape zone separator for IPv6
+        uriTokens.push(_normalizeIPv6(_normalizeIPv4(String(components.host), protocol), protocol).replace(protocol.IPV6ADDRESS, function (_, $1, $2) {
+            return "[" + $1 + ($2 ? "%25" + $2 : "") + "]";
+        }));
+    }
+    if (typeof components.port === "number" || typeof components.port === "string") {
+        uriTokens.push(":");
+        uriTokens.push(String(components.port));
+    }
+    return uriTokens.length ? uriTokens.join("") : undefined;
+}
+
+var RDS1 = /^\.\.?\//;
+var RDS2 = /^\/\.(\/|$)/;
+var RDS3 = /^\/\.\.(\/|$)/;
+var RDS5 = /^\/?(?:.|\n)*?(?=\/|$)/;
+function removeDotSegments(input) {
+    var output = [];
+    while (input.length) {
+        if (input.match(RDS1)) {
+            input = input.replace(RDS1, "");
+        } else if (input.match(RDS2)) {
+            input = input.replace(RDS2, "/");
+        } else if (input.match(RDS3)) {
+            input = input.replace(RDS3, "/");
+            output.pop();
+        } else if (input === "." || input === "..") {
+            input = "";
+        } else {
+            var im = input.match(RDS5);
+            if (im) {
+                var s = im[0];
+                input = input.slice(s.length);
+                output.push(s);
+            } else {
+                throw new Error("Unexpected dot segment condition");
+            }
+        }
+    }
+    return output.join("");
+}
+
+function serialize(components) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+
+    var protocol = options.iri ? IRI_PROTOCOL : URI_PROTOCOL;
+    var uriTokens = [];
+    //find scheme handler
+    var schemeHandler = SCHEMES[(options.scheme || components.scheme || "").toLowerCase()];
+    //perform scheme specific serialization
+    if (schemeHandler && schemeHandler.serialize) schemeHandler.serialize(components, options);
+    if (components.host) {
+        //if host component is an IPv6 address
+        if (protocol.IPV6ADDRESS.test(components.host)) {}
+        //TODO: normalize IPv6 address as per RFC 5952
+
+        //if host component is a domain name
+        else if (options.domainHost || schemeHandler && schemeHandler.domainHost) {
+                //convert IDN via punycode
+                try {
+                    components.host = !options.iri ? punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase()) : punycode.toUnicode(components.host);
+                } catch (e) {
+                    components.error = components.error || "Host's domain name can not be converted to " + (!options.iri ? "ASCII" : "Unicode") + " via punycode: " + e;
+                }
+            }
+    }
+    //normalize encoding
+    _normalizeComponentEncoding(components, protocol);
+    if (options.reference !== "suffix" && components.scheme) {
+        uriTokens.push(components.scheme);
+        uriTokens.push(":");
+    }
+    var authority = _recomposeAuthority(components, options);
+    if (authority !== undefined) {
+        if (options.reference !== "suffix") {
+            uriTokens.push("//");
+        }
+        uriTokens.push(authority);
+        if (components.path && components.path.charAt(0) !== "/") {
+            uriTokens.push("/");
+        }
+    }
+    if (components.path !== undefined) {
+        var s = components.path;
+        if (!options.absolutePath && (!schemeHandler || !schemeHandler.absolutePath)) {
+            s = removeDotSegments(s);
+        }
+        if (authority === undefined) {
+            s = s.replace(/^\/\//, "/%2F"); //don't allow the path to start with "//"
+        }
+        uriTokens.push(s);
+    }
+    if (components.query !== undefined) {
+        uriTokens.push("?");
+        uriTokens.push(components.query);
+    }
+    if (components.fragment !== undefined) {
+        uriTokens.push("#");
+        uriTokens.push(components.fragment);
+    }
+    return uriTokens.join(""); //merge tokens into a string
+}
+
+function resolveComponents(base, relative) {
+    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+    var skipNormalization = arguments[3];
+
+    var target = {};
+    if (!skipNormalization) {
+        base = parse(serialize(base, options), options); //normalize base components
+        relative = parse(serialize(relative, options), options); //normalize relative components
+    }
+    options = options || {};
+    if (!options.tolerant && relative.scheme) {
+        target.scheme = relative.scheme;
+        //target.authority = relative.authority;
+        target.userinfo = relative.userinfo;
+        target.host = relative.host;
+        target.port = relative.port;
+        target.path = removeDotSegments(relative.path || "");
+        target.query = relative.query;
+    } else {
+        if (relative.userinfo !== undefined || relative.host !== undefined || relative.port !== undefined) {
+            //target.authority = relative.authority;
+            target.userinfo = relative.userinfo;
+            target.host = relative.host;
+            target.port = relative.port;
+            target.path = removeDotSegments(relative.path || "");
+            target.query = relative.query;
+        } else {
+            if (!relative.path) {
+                target.path = base.path;
+                if (relative.query !== undefined) {
+                    target.query = relative.query;
+                } else {
+                    target.query = base.query;
+                }
+            } else {
+                if (relative.path.charAt(0) === "/") {
+                    target.path = removeDotSegments(relative.path);
+                } else {
+                    if ((base.userinfo !== undefined || base.host !== undefined || base.port !== undefined) && !base.path) {
+                        target.path = "/" + relative.path;
+                    } else if (!base.path) {
+                        target.path = relative.path;
+                    } else {
+                        target.path = base.path.slice(0, base.path.lastIndexOf("/") + 1) + relative.path;
+                    }
+                    target.path = removeDotSegments(target.path);
+                }
+                target.query = relative.query;
+            }
+            //target.authority = base.authority;
+            target.userinfo = base.userinfo;
+            target.host = base.host;
+            target.port = base.port;
+        }
+        target.scheme = base.scheme;
+    }
+    target.fragment = relative.fragment;
+    return target;
+}
+
+function resolve(baseURI, relativeURI, options) {
+    var schemelessOptions = assign({ scheme: 'null' }, options);
+    return serialize(resolveComponents(parse(baseURI, schemelessOptions), parse(relativeURI, schemelessOptions), schemelessOptions, true), schemelessOptions);
+}
+
+function normalize(uri, options) {
+    if (typeof uri === "string") {
+        uri = serialize(parse(uri, options), options);
+    } else if (typeOf(uri) === "object") {
+        uri = parse(serialize(uri, options), options);
+    }
+    return uri;
+}
+
+function equal(uriA, uriB, options) {
+    if (typeof uriA === "string") {
+        uriA = serialize(parse(uriA, options), options);
+    } else if (typeOf(uriA) === "object") {
+        uriA = serialize(uriA, options);
+    }
+    if (typeof uriB === "string") {
+        uriB = serialize(parse(uriB, options), options);
+    } else if (typeOf(uriB) === "object") {
+        uriB = serialize(uriB, options);
+    }
+    return uriA === uriB;
+}
+
+function escapeComponent(str, options) {
+    return str && str.toString().replace(!options || !options.iri ? URI_PROTOCOL.ESCAPE : IRI_PROTOCOL.ESCAPE, pctEncChar);
+}
+
+function unescapeComponent(str, options) {
+    return str && str.toString().replace(!options || !options.iri ? URI_PROTOCOL.PCT_ENCODED : IRI_PROTOCOL.PCT_ENCODED, pctDecChars);
+}
+
+var handler = {
+    scheme: "http",
+    domainHost: true,
+    parse: function parse(components, options) {
+        //report missing host
+        if (!components.host) {
+            components.error = components.error || "HTTP URIs must have a host.";
+        }
+        return components;
+    },
+    serialize: function serialize(components, options) {
+        var secure = String(components.scheme).toLowerCase() === "https";
+        //normalize the default port
+        if (components.port === (secure ? 443 : 80) || components.port === "") {
+            components.port = undefined;
+        }
+        //normalize the empty path
+        if (!components.path) {
+            components.path = "/";
+        }
+        //NOTE: We do not parse query strings for HTTP URIs
+        //as WWW Form Url Encoded query strings are part of the HTML4+ spec,
+        //and not the HTTP spec.
+        return components;
+    }
+};
+
+var handler$1 = {
+    scheme: "https",
+    domainHost: handler.domainHost,
+    parse: handler.parse,
+    serialize: handler.serialize
+};
+
+function isSecure(wsComponents) {
+    return typeof wsComponents.secure === 'boolean' ? wsComponents.secure : String(wsComponents.scheme).toLowerCase() === "wss";
+}
+//RFC 6455
+var handler$2 = {
+    scheme: "ws",
+    domainHost: true,
+    parse: function parse(components, options) {
+        var wsComponents = components;
+        //indicate if the secure flag is set
+        wsComponents.secure = isSecure(wsComponents);
+        //construct resouce name
+        wsComponents.resourceName = (wsComponents.path || '/') + (wsComponents.query ? '?' + wsComponents.query : '');
+        wsComponents.path = undefined;
+        wsComponents.query = undefined;
+        return wsComponents;
+    },
+    serialize: function serialize(wsComponents, options) {
+        //normalize the default port
+        if (wsComponents.port === (isSecure(wsComponents) ? 443 : 80) || wsComponents.port === "") {
+            wsComponents.port = undefined;
+        }
+        //ensure scheme matches secure flag
+        if (typeof wsComponents.secure === 'boolean') {
+            wsComponents.scheme = wsComponents.secure ? 'wss' : 'ws';
+            wsComponents.secure = undefined;
+        }
+        //reconstruct path from resource name
+        if (wsComponents.resourceName) {
+            var _wsComponents$resourc = wsComponents.resourceName.split('?'),
+                _wsComponents$resourc2 = slicedToArray(_wsComponents$resourc, 2),
+                path = _wsComponents$resourc2[0],
+                query = _wsComponents$resourc2[1];
+
+            wsComponents.path = path && path !== '/' ? path : undefined;
+            wsComponents.query = query;
+            wsComponents.resourceName = undefined;
+        }
+        //forbid fragment component
+        wsComponents.fragment = undefined;
+        return wsComponents;
+    }
+};
+
+var handler$3 = {
+    scheme: "wss",
+    domainHost: handler$2.domainHost,
+    parse: handler$2.parse,
+    serialize: handler$2.serialize
+};
+
+var O = {};
+var isIRI = true;
+//RFC 3986
+var UNRESERVED$$ = "[A-Za-z0-9\\-\\.\\_\\~" + (isIRI ? "\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF" : "") + "]";
+var HEXDIG$$ = "[0-9A-Fa-f]"; //case-insensitive
+var PCT_ENCODED$ = subexp(subexp("%[EFef]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%[89A-Fa-f]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%" + HEXDIG$$ + HEXDIG$$)); //expanded
+//RFC 5322, except these symbols as per RFC 6068: @ : / ? # [ ] & ; =
+//const ATEXT$$ = "[A-Za-z0-9\\!\\#\\$\\%\\&\\'\\*\\+\\-\\/\\=\\?\\^\\_\\`\\{\\|\\}\\~]";
+//const WSP$$ = "[\\x20\\x09]";
+//const OBS_QTEXT$$ = "[\\x01-\\x08\\x0B\\x0C\\x0E-\\x1F\\x7F]";  //(%d1-8 / %d11-12 / %d14-31 / %d127)
+//const QTEXT$$ = merge("[\\x21\\x23-\\x5B\\x5D-\\x7E]", OBS_QTEXT$$);  //%d33 / %d35-91 / %d93-126 / obs-qtext
+//const VCHAR$$ = "[\\x21-\\x7E]";
+//const WSP$$ = "[\\x20\\x09]";
+//const OBS_QP$ = subexp("\\\\" + merge("[\\x00\\x0D\\x0A]", OBS_QTEXT$$));  //%d0 / CR / LF / obs-qtext
+//const FWS$ = subexp(subexp(WSP$$ + "*" + "\\x0D\\x0A") + "?" + WSP$$ + "+");
+//const QUOTED_PAIR$ = subexp(subexp("\\\\" + subexp(VCHAR$$ + "|" + WSP$$)) + "|" + OBS_QP$);
+//const QUOTED_STRING$ = subexp('\\"' + subexp(FWS$ + "?" + QCONTENT$) + "*" + FWS$ + "?" + '\\"');
+var ATEXT$$ = "[A-Za-z0-9\\!\\$\\%\\'\\*\\+\\-\\^\\_\\`\\{\\|\\}\\~]";
+var QTEXT$$ = "[\\!\\$\\%\\'\\(\\)\\*\\+\\,\\-\\.0-9\\<\\>A-Z\\x5E-\\x7E]";
+var VCHAR$$ = merge(QTEXT$$, "[\\\"\\\\]");
+var SOME_DELIMS$$ = "[\\!\\$\\'\\(\\)\\*\\+\\,\\;\\:\\@]";
+var UNRESERVED = new RegExp(UNRESERVED$$, "g");
+var PCT_ENCODED = new RegExp(PCT_ENCODED$, "g");
+var NOT_LOCAL_PART = new RegExp(merge("[^]", ATEXT$$, "[\\.]", '[\\"]', VCHAR$$), "g");
+var NOT_HFNAME = new RegExp(merge("[^]", UNRESERVED$$, SOME_DELIMS$$), "g");
+var NOT_HFVALUE = NOT_HFNAME;
+function decodeUnreserved(str) {
+    var decStr = pctDecChars(str);
+    return !decStr.match(UNRESERVED) ? str : decStr;
+}
+var handler$4 = {
+    scheme: "mailto",
+    parse: function parse$$1(components, options) {
+        var mailtoComponents = components;
+        var to = mailtoComponents.to = mailtoComponents.path ? mailtoComponents.path.split(",") : [];
+        mailtoComponents.path = undefined;
+        if (mailtoComponents.query) {
+            var unknownHeaders = false;
+            var headers = {};
+            var hfields = mailtoComponents.query.split("&");
+            for (var x = 0, xl = hfields.length; x < xl; ++x) {
+                var hfield = hfields[x].split("=");
+                switch (hfield[0]) {
+                    case "to":
+                        var toAddrs = hfield[1].split(",");
+                        for (var _x = 0, _xl = toAddrs.length; _x < _xl; ++_x) {
+                            to.push(toAddrs[_x]);
+                        }
+                        break;
+                    case "subject":
+                        mailtoComponents.subject = unescapeComponent(hfield[1], options);
+                        break;
+                    case "body":
+                        mailtoComponents.body = unescapeComponent(hfield[1], options);
+                        break;
+                    default:
+                        unknownHeaders = true;
+                        headers[unescapeComponent(hfield[0], options)] = unescapeComponent(hfield[1], options);
+                        break;
+                }
+            }
+            if (unknownHeaders) mailtoComponents.headers = headers;
+        }
+        mailtoComponents.query = undefined;
+        for (var _x2 = 0, _xl2 = to.length; _x2 < _xl2; ++_x2) {
+            var addr = to[_x2].split("@");
+            addr[0] = unescapeComponent(addr[0]);
+            if (!options.unicodeSupport) {
+                //convert Unicode IDN -> ASCII IDN
+                try {
+                    addr[1] = punycode.toASCII(unescapeComponent(addr[1], options).toLowerCase());
+                } catch (e) {
+                    mailtoComponents.error = mailtoComponents.error || "Email address's domain name can not be converted to ASCII via punycode: " + e;
+                }
+            } else {
+                addr[1] = unescapeComponent(addr[1], options).toLowerCase();
+            }
+            to[_x2] = addr.join("@");
+        }
+        return mailtoComponents;
+    },
+    serialize: function serialize$$1(mailtoComponents, options) {
+        var components = mailtoComponents;
+        var to = toArray(mailtoComponents.to);
+        if (to) {
+            for (var x = 0, xl = to.length; x < xl; ++x) {
+                var toAddr = String(to[x]);
+                var atIdx = toAddr.lastIndexOf("@");
+                var localPart = toAddr.slice(0, atIdx).replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_LOCAL_PART, pctEncChar);
+                var domain = toAddr.slice(atIdx + 1);
+                //convert IDN via punycode
+                try {
+                    domain = !options.iri ? punycode.toASCII(unescapeComponent(domain, options).toLowerCase()) : punycode.toUnicode(domain);
+                } catch (e) {
+                    components.error = components.error || "Email address's domain name can not be converted to " + (!options.iri ? "ASCII" : "Unicode") + " via punycode: " + e;
+                }
+                to[x] = localPart + "@" + domain;
+            }
+            components.path = to.join(",");
+        }
+        var headers = mailtoComponents.headers = mailtoComponents.headers || {};
+        if (mailtoComponents.subject) headers["subject"] = mailtoComponents.subject;
+        if (mailtoComponents.body) headers["body"] = mailtoComponents.body;
+        var fields = [];
+        for (var name in headers) {
+            if (headers[name] !== O[name]) {
+                fields.push(name.replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFNAME, pctEncChar) + "=" + headers[name].replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFVALUE, pctEncChar));
+            }
+        }
+        if (fields.length) {
+            components.query = fields.join("&");
+        }
+        return components;
+    }
+};
+
+var URN_PARSE = /^([^\:]+)\:(.*)/;
+//RFC 2141
+var handler$5 = {
+    scheme: "urn",
+    parse: function parse$$1(components, options) {
+        var matches = components.path && components.path.match(URN_PARSE);
+        var urnComponents = components;
+        if (matches) {
+            var scheme = options.scheme || urnComponents.scheme || "urn";
+            var nid = matches[1].toLowerCase();
+            var nss = matches[2];
+            var urnScheme = scheme + ":" + (options.nid || nid);
+            var schemeHandler = SCHEMES[urnScheme];
+            urnComponents.nid = nid;
+            urnComponents.nss = nss;
+            urnComponents.path = undefined;
+            if (schemeHandler) {
+                urnComponents = schemeHandler.parse(urnComponents, options);
+            }
+        } else {
+            urnComponents.error = urnComponents.error || "URN can not be parsed.";
+        }
+        return urnComponents;
+    },
+    serialize: function serialize$$1(urnComponents, options) {
+        var scheme = options.scheme || urnComponents.scheme || "urn";
+        var nid = urnComponents.nid;
+        var urnScheme = scheme + ":" + (options.nid || nid);
+        var schemeHandler = SCHEMES[urnScheme];
+        if (schemeHandler) {
+            urnComponents = schemeHandler.serialize(urnComponents, options);
+        }
+        var uriComponents = urnComponents;
+        var nss = urnComponents.nss;
+        uriComponents.path = (nid || options.nid) + ":" + nss;
+        return uriComponents;
+    }
+};
+
+var UUID = /^[0-9A-Fa-f]{8}(?:\-[0-9A-Fa-f]{4}){3}\-[0-9A-Fa-f]{12}$/;
+//RFC 4122
+var handler$6 = {
+    scheme: "urn:uuid",
+    parse: function parse(urnComponents, options) {
+        var uuidComponents = urnComponents;
+        uuidComponents.uuid = uuidComponents.nss;
+        uuidComponents.nss = undefined;
+        if (!options.tolerant && (!uuidComponents.uuid || !uuidComponents.uuid.match(UUID))) {
+            uuidComponents.error = uuidComponents.error || "UUID is not valid.";
+        }
+        return uuidComponents;
+    },
+    serialize: function serialize(uuidComponents, options) {
+        var urnComponents = uuidComponents;
+        //normalize UUID
+        urnComponents.nss = (uuidComponents.uuid || "").toLowerCase();
+        return urnComponents;
+    }
+};
+
+SCHEMES[handler.scheme] = handler;
+SCHEMES[handler$1.scheme] = handler$1;
+SCHEMES[handler$2.scheme] = handler$2;
+SCHEMES[handler$3.scheme] = handler$3;
+SCHEMES[handler$4.scheme] = handler$4;
+SCHEMES[handler$5.scheme] = handler$5;
+SCHEMES[handler$6.scheme] = handler$6;
+
+exports.SCHEMES = SCHEMES;
+exports.pctEncChar = pctEncChar;
+exports.pctDecChars = pctDecChars;
+exports.parse = parse;
+exports.removeDotSegments = removeDotSegments;
+exports.serialize = serialize;
+exports.resolveComponents = resolveComponents;
+exports.resolve = resolve;
+exports.normalize = normalize;
+exports.equal = equal;
+exports.escapeComponent = escapeComponent;
+exports.unescapeComponent = unescapeComponent;
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+})));
+//# sourceMappingURL=uri.all.js.map
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.js.map
new file mode 100644
index 0000000..5b30c4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"uri.all.js","sources":["../../src/index.ts","../../src/schemes/urn-uuid.ts","../../src/schemes/urn.ts","../../src/schemes/mailto.ts","../../src/schemes/wss.ts","../../src/schemes/ws.ts","../../src/schemes/https.ts","../../src/schemes/http.ts","../../src/uri.ts","../../node_modules/punycode/punycode.es6.js","../../src/regexps-iri.ts","../../src/regexps-uri.ts","../../src/util.ts"],"sourcesContent":["import { SCHEMES } from \"./uri\";\n\nimport http from \"./schemes/http\";\nSCHEMES[http.scheme] = http;\n\nimport https from \"./schemes/https\";\nSCHEMES[https.scheme] = https;\n\nimport ws from \"./schemes/ws\";\nSCHEMES[ws.scheme] = ws;\n\nimport wss from \"./schemes/wss\";\nSCHEMES[wss.scheme] = wss;\n\nimport mailto from \"./schemes/mailto\";\nSCHEMES[mailto.scheme] = mailto;\n\nimport urn from \"./schemes/urn\";\nSCHEMES[urn.scheme] = urn;\n\nimport uuid from \"./schemes/urn-uuid\";\nSCHEMES[uuid.scheme] = uuid;\n\nexport * from \"./uri\";\n","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport { URNComponents } from \"./urn\";\nimport { SCHEMES } from \"../uri\";\n\nexport interface UUIDComponents extends URNComponents {\n\tuuid?: string;\n}\n\nconst UUID = /^[0-9A-Fa-f]{8}(?:\\-[0-9A-Fa-f]{4}){3}\\-[0-9A-Fa-f]{12}$/;\nconst UUID_PARSE = /^[0-9A-Fa-f\\-]{36}/;\n\n//RFC 4122\nconst handler:URISchemeHandler<UUIDComponents, URIOptions, URNComponents> = {\n\tscheme : \"urn:uuid\",\n\n\tparse : function (urnComponents:URNComponents, options:URIOptions):UUIDComponents {\n\t\tconst uuidComponents = urnComponents as UUIDComponents;\n\t\tuuidComponents.uuid = uuidComponents.nss;\n\t\tuuidComponents.nss = undefined;\n\n\t\tif (!options.tolerant && (!uuidComponents.uuid || !uuidComponents.uuid.match(UUID))) {\n\t\t\tuuidComponents.error = uuidComponents.error || \"UUID is not valid.\";\n\t\t}\n\n\t\treturn uuidComponents;\n\t},\n\n\tserialize : function (uuidComponents:UUIDComponents, options:URIOptions):URNComponents {\n\t\tconst urnComponents = uuidComponents as URNComponents;\n\t\t//normalize UUID\n\t\turnComponents.nss = (uuidComponents.uuid || \"\").toLowerCase();\n\t\treturn urnComponents;\n\t},\n};\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport { pctEncChar, SCHEMES } from \"../uri\";\n\nexport interface URNComponents extends URIComponents {\n\tnid?:string;\n\tnss?:string;\n}\n\nexport interface URNOptions extends URIOptions {\n\tnid?:string;\n}\n\nconst NID$ = \"(?:[0-9A-Za-z][0-9A-Za-z\\\\-]{1,31})\";\nconst PCT_ENCODED$ = \"(?:\\\\%[0-9A-Fa-f]{2})\";\nconst TRANS$$ = \"[0-9A-Za-z\\\\(\\\\)\\\\+\\\\,\\\\-\\\\.\\\\:\\\\=\\\\@\\\\;\\\\$\\\\_\\\\!\\\\*\\\\'\\\\/\\\\?\\\\#]\";\nconst NSS$ = \"(?:(?:\" + PCT_ENCODED$ + \"|\" + TRANS$$ + \")+)\";\nconst URN_SCHEME = new RegExp(\"^urn\\\\:(\" + NID$ + \")$\");\nconst URN_PATH = new RegExp(\"^(\" + NID$ + \")\\\\:(\" + NSS$ + \")$\");\nconst URN_PARSE = /^([^\\:]+)\\:(.*)/;\nconst URN_EXCLUDED = /[\\x00-\\x20\\\\\\\"\\&\\<\\>\\[\\]\\^\\`\\{\\|\\}\\~\\x7F-\\xFF]/g;\n\n//RFC 2141\nconst handler:URISchemeHandler<URNComponents,URNOptions> = {\n\tscheme : \"urn\",\n\n\tparse : function (components:URIComponents, options:URNOptions):URNComponents {\n\t\tconst matches = components.path && components.path.match(URN_PARSE);\n\t\tlet urnComponents = components as URNComponents;\n\n\t\tif (matches) {\n\t\t\tconst scheme = options.scheme || urnComponents.scheme || \"urn\";\n\t\t\tconst nid = matches[1].toLowerCase();\n\t\t\tconst nss = matches[2];\n\t\t\tconst urnScheme = `${scheme}:${options.nid || nid}`;\n\t\t\tconst schemeHandler = SCHEMES[urnScheme];\n\n\t\t\turnComponents.nid = nid;\n\t\t\turnComponents.nss = nss;\n\t\t\turnComponents.path = undefined;\n\n\t\t\tif (schemeHandler) {\n\t\t\t\turnComponents = schemeHandler.parse(urnComponents, options) as URNComponents;\n\t\t\t}\n\t\t} else {\n\t\t\turnComponents.error = urnComponents.error || \"URN can not be parsed.\";\n\t\t}\n\n\t\treturn urnComponents;\n\t},\n\n\tserialize : function (urnComponents:URNComponents, options:URNOptions):URIComponents {\n\t\tconst scheme = options.scheme || urnComponents.scheme || \"urn\";\n\t\tconst nid = urnComponents.nid;\n\t\tconst urnScheme = `${scheme}:${options.nid || nid}`;\n\t\tconst schemeHandler = SCHEMES[urnScheme];\n\n\t\tif (schemeHandler) {\n\t\t\turnComponents = schemeHandler.serialize(urnComponents, options) as URNComponents;\n\t\t}\n\n\t\tconst uriComponents = urnComponents as URIComponents;\n\t\tconst nss = urnComponents.nss;\n\t\turiComponents.path = `${nid || options.nid}:${nss}`;\n\n\t\treturn uriComponents;\n\t},\n};\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport { pctEncChar, pctDecChars, unescapeComponent } from \"../uri\";\nimport punycode from \"punycode\";\nimport { merge, subexp, toUpperCase, toArray } from \"../util\";\n\nexport interface MailtoHeaders {\n\t[hfname:string]:string\n}\n\nexport interface MailtoComponents extends URIComponents {\n\tto:Array<string>,\n\theaders?:MailtoHeaders,\n\tsubject?:string,\n\tbody?:string\n}\n\nconst O:MailtoHeaders = {};\nconst isIRI = true;\n\n//RFC 3986\nconst UNRESERVED$$ = \"[A-Za-z0-9\\\\-\\\\.\\\\_\\\\~\" + (isIRI ? \"\\\\xA0-\\\\u200D\\\\u2010-\\\\u2029\\\\u202F-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFEF\" : \"\") + \"]\";\nconst HEXDIG$$ = \"[0-9A-Fa-f]\";  //case-insensitive\nconst PCT_ENCODED$ = subexp(subexp(\"%[EFef]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%[89A-Fa-f]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%\" + HEXDIG$$ + HEXDIG$$));  //expanded\n\n//RFC 5322, except these symbols as per RFC 6068: @ : / ? # [ ] & ; =\n//const ATEXT$$ = \"[A-Za-z0-9\\\\!\\\\#\\\\$\\\\%\\\\&\\\\'\\\\*\\\\+\\\\-\\\\/\\\\=\\\\?\\\\^\\\\_\\\\`\\\\{\\\\|\\\\}\\\\~]\";\n//const WSP$$ = \"[\\\\x20\\\\x09]\";\n//const OBS_QTEXT$$ = \"[\\\\x01-\\\\x08\\\\x0B\\\\x0C\\\\x0E-\\\\x1F\\\\x7F]\";  //(%d1-8 / %d11-12 / %d14-31 / %d127)\n//const QTEXT$$ = merge(\"[\\\\x21\\\\x23-\\\\x5B\\\\x5D-\\\\x7E]\", OBS_QTEXT$$);  //%d33 / %d35-91 / %d93-126 / obs-qtext\n//const VCHAR$$ = \"[\\\\x21-\\\\x7E]\";\n//const WSP$$ = \"[\\\\x20\\\\x09]\";\n//const OBS_QP$ = subexp(\"\\\\\\\\\" + merge(\"[\\\\x00\\\\x0D\\\\x0A]\", OBS_QTEXT$$));  //%d0 / CR / LF / obs-qtext\n//const FWS$ = subexp(subexp(WSP$$ + \"*\" + \"\\\\x0D\\\\x0A\") + \"?\" + WSP$$ + \"+\");\n//const QUOTED_PAIR$ = subexp(subexp(\"\\\\\\\\\" + subexp(VCHAR$$ + \"|\" + WSP$$)) + \"|\" + OBS_QP$);\n//const QUOTED_STRING$ = subexp('\\\\\"' + subexp(FWS$ + \"?\" + QCONTENT$) + \"*\" + FWS$ + \"?\" + '\\\\\"');\nconst ATEXT$$ = \"[A-Za-z0-9\\\\!\\\\$\\\\%\\\\'\\\\*\\\\+\\\\-\\\\^\\\\_\\\\`\\\\{\\\\|\\\\}\\\\~]\";\nconst QTEXT$$ = \"[\\\\!\\\\$\\\\%\\\\'\\\\(\\\\)\\\\*\\\\+\\\\,\\\\-\\\\.0-9\\\\<\\\\>A-Z\\\\x5E-\\\\x7E]\";\nconst VCHAR$$ = merge(QTEXT$$, \"[\\\\\\\"\\\\\\\\]\");\nconst DOT_ATOM_TEXT$ = subexp(ATEXT$$ + \"+\" + subexp(\"\\\\.\" + ATEXT$$ + \"+\") + \"*\");\nconst QUOTED_PAIR$ = subexp(\"\\\\\\\\\" + VCHAR$$);\nconst QCONTENT$ = subexp(QTEXT$$ + \"|\" + QUOTED_PAIR$);\nconst QUOTED_STRING$ = subexp('\\\\\"' + QCONTENT$ + \"*\" + '\\\\\"');\n\n//RFC 6068\nconst DTEXT_NO_OBS$$ = \"[\\\\x21-\\\\x5A\\\\x5E-\\\\x7E]\";  //%d33-90 / %d94-126\nconst SOME_DELIMS$$ = \"[\\\\!\\\\$\\\\'\\\\(\\\\)\\\\*\\\\+\\\\,\\\\;\\\\:\\\\@]\";\nconst QCHAR$ = subexp(UNRESERVED$$ + \"|\" + PCT_ENCODED$ + \"|\" + SOME_DELIMS$$);\nconst DOMAIN$ = subexp(DOT_ATOM_TEXT$ + \"|\" + \"\\\\[\" + DTEXT_NO_OBS$$ + \"*\" + \"\\\\]\");\nconst LOCAL_PART$ = subexp(DOT_ATOM_TEXT$ + \"|\" + QUOTED_STRING$);\nconst ADDR_SPEC$ = subexp(LOCAL_PART$ + \"\\\\@\" + DOMAIN$);\nconst TO$ = subexp(ADDR_SPEC$ + subexp(\"\\\\,\" + ADDR_SPEC$) + \"*\");\nconst HFNAME$ = subexp(QCHAR$ + \"*\");\nconst HFVALUE$ = HFNAME$;\nconst HFIELD$ = subexp(HFNAME$ + \"\\\\=\" + HFVALUE$);\nconst HFIELDS2$ = subexp(HFIELD$ + subexp(\"\\\\&\" + HFIELD$) + \"*\");\nconst HFIELDS$ = subexp(\"\\\\?\" + HFIELDS2$);\nconst MAILTO_URI = new RegExp(\"^mailto\\\\:\" + TO$ + \"?\" + HFIELDS$ + \"?$\");\n\nconst UNRESERVED = new RegExp(UNRESERVED$$, \"g\");\nconst PCT_ENCODED = new RegExp(PCT_ENCODED$, \"g\");\nconst NOT_LOCAL_PART = new RegExp(merge(\"[^]\", ATEXT$$, \"[\\\\.]\", '[\\\\\"]', VCHAR$$), \"g\");\nconst NOT_DOMAIN = new RegExp(merge(\"[^]\", ATEXT$$, \"[\\\\.]\", \"[\\\\[]\", DTEXT_NO_OBS$$, \"[\\\\]]\"), \"g\");\nconst NOT_HFNAME = new RegExp(merge(\"[^]\", UNRESERVED$$, SOME_DELIMS$$), \"g\");\nconst NOT_HFVALUE = NOT_HFNAME;\nconst TO = new RegExp(\"^\" + TO$ + \"$\");\nconst HFIELDS = new RegExp(\"^\" + HFIELDS2$ + \"$\");\n\nfunction decodeUnreserved(str:string):string {\n\tconst decStr = pctDecChars(str);\n\treturn (!decStr.match(UNRESERVED) ? str : decStr);\n}\n\nconst handler:URISchemeHandler<MailtoComponents> =  {\n\tscheme : \"mailto\",\n\n\tparse : function (components:URIComponents, options:URIOptions):MailtoComponents {\n\t\tconst mailtoComponents = components as MailtoComponents;\n\t\tconst to = mailtoComponents.to = (mailtoComponents.path ? mailtoComponents.path.split(\",\") : []);\n\t\tmailtoComponents.path = undefined;\n\n\t\tif (mailtoComponents.query) {\n\t\t\tlet unknownHeaders = false\n\t\t\tconst headers:MailtoHeaders = {};\n\t\t\tconst hfields = mailtoComponents.query.split(\"&\");\n\n\t\t\tfor (let x = 0, xl = hfields.length; x < xl; ++x) {\n\t\t\t\tconst hfield = hfields[x].split(\"=\");\n\n\t\t\t\tswitch (hfield[0]) {\n\t\t\t\t\tcase \"to\":\n\t\t\t\t\t\tconst toAddrs = hfield[1].split(\",\");\n\t\t\t\t\t\tfor (let x = 0, xl = toAddrs.length; x < xl; ++x) {\n\t\t\t\t\t\t\tto.push(toAddrs[x]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"subject\":\n\t\t\t\t\t\tmailtoComponents.subject = unescapeComponent(hfield[1], options);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"body\":\n\t\t\t\t\t\tmailtoComponents.body = unescapeComponent(hfield[1], options);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tunknownHeaders = true;\n\t\t\t\t\t\theaders[unescapeComponent(hfield[0], options)] = unescapeComponent(hfield[1], options);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (unknownHeaders) mailtoComponents.headers = headers;\n\t\t}\n\n\t\tmailtoComponents.query = undefined;\n\n\t\tfor (let x = 0, xl = to.length; x < xl; ++x) {\n\t\t\tconst addr = to[x].split(\"@\");\n\n\t\t\taddr[0] = unescapeComponent(addr[0]);\n\n\t\t\tif (!options.unicodeSupport) {\n\t\t\t\t//convert Unicode IDN -> ASCII IDN\n\t\t\t\ttry {\n\t\t\t\t\taddr[1] = punycode.toASCII(unescapeComponent(addr[1], options).toLowerCase());\n\t\t\t\t} catch (e) {\n\t\t\t\t\tmailtoComponents.error = mailtoComponents.error || \"Email address's domain name can not be converted to ASCII via punycode: \" + e;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\taddr[1] = unescapeComponent(addr[1], options).toLowerCase();\n\t\t\t}\n\n\t\t\tto[x] = addr.join(\"@\");\n\t\t}\n\n\t\treturn mailtoComponents;\n\t},\n\n\tserialize : function (mailtoComponents:MailtoComponents, options:URIOptions):URIComponents {\n\t\tconst components = mailtoComponents as URIComponents;\n\t\tconst to = toArray(mailtoComponents.to);\n\t\tif (to) {\n\t\t\tfor (let x = 0, xl = to.length; x < xl; ++x) {\n\t\t\t\tconst toAddr = String(to[x]);\n\t\t\t\tconst atIdx = toAddr.lastIndexOf(\"@\");\n\t\t\t\tconst localPart = (toAddr.slice(0, atIdx)).replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_LOCAL_PART, pctEncChar);\n\t\t\t\tlet domain = toAddr.slice(atIdx + 1);\n\n\t\t\t\t//convert IDN via punycode\n\t\t\t\ttry {\n\t\t\t\t\tdomain = (!options.iri ? punycode.toASCII(unescapeComponent(domain, options).toLowerCase()) : punycode.toUnicode(domain));\n\t\t\t\t} catch (e) {\n\t\t\t\t\tcomponents.error = components.error || \"Email address's domain name can not be converted to \" + (!options.iri ? \"ASCII\" : \"Unicode\") + \" via punycode: \" + e;\n\t\t\t\t}\n\n\t\t\t\tto[x] = localPart + \"@\" + domain;\n\t\t\t}\n\n\t\t\tcomponents.path = to.join(\",\");\n\t\t}\n\n\t\tconst headers = mailtoComponents.headers = mailtoComponents.headers || {};\n\n\t\tif (mailtoComponents.subject) headers[\"subject\"] = mailtoComponents.subject;\n\t\tif (mailtoComponents.body) headers[\"body\"] = mailtoComponents.body;\n\n\t\tconst fields = [];\n\t\tfor (const name in headers) {\n\t\t\tif (headers[name] !== O[name]) {\n\t\t\t\tfields.push(\n\t\t\t\t\tname.replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFNAME, pctEncChar) +\n\t\t\t\t\t\"=\" +\n\t\t\t\t\theaders[name].replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFVALUE, pctEncChar)\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tif (fields.length) {\n\t\t\tcomponents.query = fields.join(\"&\");\n\t\t}\n\n\t\treturn components;\n\t}\n}\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport ws from \"./ws\";\n\nconst handler:URISchemeHandler = {\n\tscheme : \"wss\",\n\tdomainHost : ws.domainHost,\n\tparse : ws.parse,\n\tserialize : ws.serialize\n}\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\n\nexport interface WSComponents extends URIComponents {\n\tresourceName?: string;\n\tsecure?: boolean;\n}\n\nfunction isSecure(wsComponents:WSComponents):boolean {\n\treturn typeof wsComponents.secure === 'boolean' ? wsComponents.secure : String(wsComponents.scheme).toLowerCase() === \"wss\";\n}\n\n//RFC 6455\nconst handler:URISchemeHandler = {\n\tscheme : \"ws\",\n\n\tdomainHost : true,\n\n\tparse : function (components:URIComponents, options:URIOptions):WSComponents {\n\t\tconst wsComponents = components as WSComponents;\n\n\t\t//indicate if the secure flag is set\n\t\twsComponents.secure = isSecure(wsComponents);\n\n\t\t//construct resouce name\n\t\twsComponents.resourceName = (wsComponents.path || '/') + (wsComponents.query ? '?' + wsComponents.query : '');\n\t\twsComponents.path = undefined;\n\t\twsComponents.query = undefined;\n\n\t\treturn wsComponents;\n\t},\n\n\tserialize : function (wsComponents:WSComponents, options:URIOptions):URIComponents {\n\t\t//normalize the default port\n\t\tif (wsComponents.port === (isSecure(wsComponents) ? 443 : 80) || wsComponents.port === \"\") {\n\t\t\twsComponents.port = undefined;\n\t\t}\n\n\t\t//ensure scheme matches secure flag\n\t\tif (typeof wsComponents.secure === 'boolean') {\n\t\t\twsComponents.scheme = (wsComponents.secure ? 'wss' : 'ws');\n\t\t\twsComponents.secure = undefined;\n\t\t}\n\n\t\t//reconstruct path from resource name\n\t\tif (wsComponents.resourceName) {\n\t\t\tconst [path, query] = wsComponents.resourceName.split('?');\n\t\t\twsComponents.path = (path && path !== '/' ? path : undefined);\n\t\t\twsComponents.query = query;\n\t\t\twsComponents.resourceName = undefined;\n\t\t}\n\n\t\t//forbid fragment component\n\t\twsComponents.fragment = undefined;\n\n\t\treturn wsComponents;\n\t}\n};\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport http from \"./http\";\n\nconst handler:URISchemeHandler = {\n\tscheme : \"https\",\n\tdomainHost : http.domainHost,\n\tparse : http.parse,\n\tserialize : http.serialize\n}\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\n\nconst handler:URISchemeHandler = {\n\tscheme : \"http\",\n\n\tdomainHost : true,\n\n\tparse : function (components:URIComponents, options:URIOptions):URIComponents {\n\t\t//report missing host\n\t\tif (!components.host) {\n\t\t\tcomponents.error = components.error || \"HTTP URIs must have a host.\";\n\t\t}\n\n\t\treturn components;\n\t},\n\n\tserialize : function (components:URIComponents, options:URIOptions):URIComponents {\n\t\tconst secure = String(components.scheme).toLowerCase() === \"https\";\n\n\t\t//normalize the default port\n\t\tif (components.port === (secure ? 443 : 80) || components.port === \"\") {\n\t\t\tcomponents.port = undefined;\n\t\t}\n\t\t\n\t\t//normalize the empty path\n\t\tif (!components.path) {\n\t\t\tcomponents.path = \"/\";\n\t\t}\n\n\t\t//NOTE: We do not parse query strings for HTTP URIs\n\t\t//as WWW Form Url Encoded query strings are part of the HTML4+ spec,\n\t\t//and not the HTTP spec.\n\n\t\treturn components;\n\t}\n};\n\nexport default handler;","/**\n * URI.js\n *\n * @fileoverview An RFC 3986 compliant, scheme extendable URI parsing/validating/resolving library for JavaScript.\n * @author <a href=\"mailto:gary.court@gmail.com\">Gary Court</a>\n * @see http://github.com/garycourt/uri-js\n */\n\n/**\n * Copyright 2011 Gary Court. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are\n * permitted provided that the following conditions are met:\n *\n *    1. Redistributions of source code must retain the above copyright notice, this list of\n *       conditions and the following disclaimer.\n *\n *    2. Redistributions in binary form must reproduce the above copyright notice, this list\n *       of conditions and the following disclaimer in the documentation and/or other materials\n *       provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY GARY COURT ``AS IS'' AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GARY COURT OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * The views and conclusions contained in the software and documentation are those of the\n * authors and should not be interpreted as representing official policies, either expressed\n * or implied, of Gary Court.\n */\n\nimport URI_PROTOCOL from \"./regexps-uri\";\nimport IRI_PROTOCOL from \"./regexps-iri\";\nimport punycode from \"punycode\";\nimport { toUpperCase, typeOf, assign } from \"./util\";\n\nexport interface URIComponents {\n\tscheme?:string;\n\tuserinfo?:string;\n\thost?:string;\n\tport?:number|string;\n\tpath?:string;\n\tquery?:string;\n\tfragment?:string;\n\treference?:string;\n\terror?:string;\n}\n\nexport interface URIOptions {\n\tscheme?:string;\n\treference?:string;\n\ttolerant?:boolean;\n\tabsolutePath?:boolean;\n\tiri?:boolean;\n\tunicodeSupport?:boolean;\n\tdomainHost?:boolean;\n}\n\nexport interface URISchemeHandler<Components extends URIComponents = URIComponents, Options extends URIOptions = URIOptions, ParentComponents extends URIComponents = URIComponents> {\n\tscheme:string;\n\tparse(components:ParentComponents, options:Options):Components;\n\tserialize(components:Components, options:Options):ParentComponents;\n\tunicodeSupport?:boolean;\n\tdomainHost?:boolean;\n\tabsolutePath?:boolean;\n}\n\nexport interface URIRegExps {\n\tNOT_SCHEME : RegExp,\n\tNOT_USERINFO : RegExp,\n\tNOT_HOST : RegExp,\n\tNOT_PATH : RegExp,\n\tNOT_PATH_NOSCHEME : RegExp,\n\tNOT_QUERY : RegExp,\n\tNOT_FRAGMENT : RegExp,\n\tESCAPE : RegExp,\n\tUNRESERVED : RegExp,\n\tOTHER_CHARS : RegExp,\n\tPCT_ENCODED : RegExp,\n\tIPV4ADDRESS : RegExp,\n\tIPV6ADDRESS : RegExp,\n}\n\nexport const SCHEMES:{[scheme:string]:URISchemeHandler} = {};\n\nexport function pctEncChar(chr:string):string {\n\tconst c = chr.charCodeAt(0);\n\tlet e:string;\n\n\tif (c < 16) e = \"%0\" + c.toString(16).toUpperCase();\n\telse if (c < 128) e = \"%\" + c.toString(16).toUpperCase();\n\telse if (c < 2048) e = \"%\" + ((c >> 6) | 192).toString(16).toUpperCase() + \"%\" + ((c & 63) | 128).toString(16).toUpperCase();\n\telse e = \"%\" + ((c >> 12) | 224).toString(16).toUpperCase() + \"%\" + (((c >> 6) & 63) | 128).toString(16).toUpperCase() + \"%\" + ((c & 63) | 128).toString(16).toUpperCase();\n\n\treturn e;\n}\n\nexport function pctDecChars(str:string):string {\n\tlet newStr = \"\";\n\tlet i = 0;\n\tconst il = str.length;\n\n\twhile (i < il) {\n\t\tconst c = parseInt(str.substr(i + 1, 2), 16);\n\n\t\tif (c < 128) {\n\t\t\tnewStr += String.fromCharCode(c);\n\t\t\ti += 3;\n\t\t}\n\t\telse if (c >= 194 && c < 224) {\n\t\t\tif ((il - i) >= 6) {\n\t\t\t\tconst c2 = parseInt(str.substr(i + 4, 2), 16);\n\t\t\t\tnewStr += String.fromCharCode(((c & 31) << 6) | (c2 & 63));\n\t\t\t} else {\n\t\t\t\tnewStr += str.substr(i, 6);\n\t\t\t}\n\t\t\ti += 6;\n\t\t}\n\t\telse if (c >= 224) {\n\t\t\tif ((il - i) >= 9) {\n\t\t\t\tconst c2 = parseInt(str.substr(i + 4, 2), 16);\n\t\t\t\tconst c3 = parseInt(str.substr(i + 7, 2), 16);\n\t\t\t\tnewStr += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));\n\t\t\t} else {\n\t\t\t\tnewStr += str.substr(i, 9);\n\t\t\t}\n\t\t\ti += 9;\n\t\t}\n\t\telse {\n\t\t\tnewStr += str.substr(i, 3);\n\t\t\ti += 3;\n\t\t}\n\t}\n\n\treturn newStr;\n}\n\nfunction _normalizeComponentEncoding(components:URIComponents, protocol:URIRegExps) {\n\tfunction decodeUnreserved(str:string):string {\n\t\tconst decStr = pctDecChars(str);\n\t\treturn (!decStr.match(protocol.UNRESERVED) ? str : decStr);\n\t}\n\n\tif (components.scheme) components.scheme = String(components.scheme).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_SCHEME, \"\");\n\tif (components.userinfo !== undefined) components.userinfo = String(components.userinfo).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_USERINFO, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.host !== undefined) components.host = String(components.host).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_HOST, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.path !== undefined) components.path = String(components.path).replace(protocol.PCT_ENCODED, decodeUnreserved).replace((components.scheme ? protocol.NOT_PATH : protocol.NOT_PATH_NOSCHEME), pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.query !== undefined) components.query = String(components.query).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_QUERY, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.fragment !== undefined) components.fragment = String(components.fragment).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_FRAGMENT, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\n\treturn components;\n};\n\nfunction _stripLeadingZeros(str:string):string {\n\treturn str.replace(/^0*(.*)/, \"$1\") || \"0\";\n}\n\nfunction _normalizeIPv4(host:string, protocol:URIRegExps):string {\n\tconst matches = host.match(protocol.IPV4ADDRESS) || [];\n\tconst [, address] = matches;\n\t\n\tif (address) {\n\t\treturn address.split(\".\").map(_stripLeadingZeros).join(\".\");\n\t} else {\n\t\treturn host;\n\t}\n}\n\nfunction _normalizeIPv6(host:string, protocol:URIRegExps):string {\n\tconst matches = host.match(protocol.IPV6ADDRESS) || [];\n\tconst [, address, zone] = matches;\n\n\tif (address) {\n\t\tconst [last, first] = address.toLowerCase().split('::').reverse();\n\t\tconst firstFields = first ? first.split(\":\").map(_stripLeadingZeros) : [];\n\t\tconst lastFields = last.split(\":\").map(_stripLeadingZeros);\n\t\tconst isLastFieldIPv4Address = protocol.IPV4ADDRESS.test(lastFields[lastFields.length - 1]);\n\t\tconst fieldCount = isLastFieldIPv4Address ? 7 : 8;\n\t\tconst lastFieldsStart = lastFields.length - fieldCount;\n\t\tconst fields = Array<string>(fieldCount);\n\n\t\tfor (let x = 0; x < fieldCount; ++x) {\n\t\t\tfields[x] = firstFields[x] || lastFields[lastFieldsStart + x] || '';\n\t\t}\n\n\t\tif (isLastFieldIPv4Address) {\n\t\t\tfields[fieldCount - 1] = _normalizeIPv4(fields[fieldCount - 1], protocol);\n\t\t}\n\n\t\tconst allZeroFields = fields.reduce<Array<{index:number,length:number}>>((acc, field, index) => {\n\t\t\tif (!field || field === \"0\") {\n\t\t\t\tconst lastLongest = acc[acc.length - 1];\n\t\t\t\tif (lastLongest && lastLongest.index + lastLongest.length === index) {\n\t\t\t\t\tlastLongest.length++;\n\t\t\t\t} else {\n\t\t\t\t\tacc.push({ index, length : 1 });\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn acc;\n\t\t}, []);\n\n\t\tconst longestZeroFields = allZeroFields.sort((a, b) => b.length - a.length)[0];\n\n\t\tlet newHost:string;\n\t\tif (longestZeroFields && longestZeroFields.length > 1) {\n\t\t\tconst newFirst = fields.slice(0, longestZeroFields.index) ;\n\t\t\tconst newLast = fields.slice(longestZeroFields.index + longestZeroFields.length);\n\t\t\tnewHost = newFirst.join(\":\") + \"::\" + newLast.join(\":\");\n\t\t} else {\n\t\t\tnewHost = fields.join(\":\");\n\t\t}\n\n\t\tif (zone) {\n\t\t\tnewHost += \"%\" + zone;\n\t\t}\n\n\t\treturn newHost;\n\t} else {\n\t\treturn host;\n\t}\n}\n\nconst URI_PARSE = /^(?:([^:\\/?#]+):)?(?:\\/\\/((?:([^\\/?#@]*)@)?(\\[[^\\/?#\\]]+\\]|[^\\/?#:]*)(?:\\:(\\d*))?))?([^?#]*)(?:\\?([^#]*))?(?:#((?:.|\\n|\\r)*))?/i;\nconst NO_MATCH_IS_UNDEFINED = (<RegExpMatchArray>(\"\").match(/(){0}/))[1] === undefined;\n\nexport function parse(uriString:string, options:URIOptions = {}):URIComponents {\n\tconst components:URIComponents = {};\n\tconst protocol = (options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL);\n\n\tif (options.reference === \"suffix\") uriString = (options.scheme ? options.scheme + \":\" : \"\") + \"//\" + uriString;\n\n\tconst matches = uriString.match(URI_PARSE);\n\n\tif (matches) {\n\t\tif (NO_MATCH_IS_UNDEFINED) {\n\t\t\t//store each component\n\t\t\tcomponents.scheme = matches[1];\n\t\t\tcomponents.userinfo = matches[3];\n\t\t\tcomponents.host = matches[4];\n\t\t\tcomponents.port = parseInt(matches[5], 10);\n\t\t\tcomponents.path = matches[6] || \"\";\n\t\t\tcomponents.query = matches[7];\n\t\t\tcomponents.fragment = matches[8];\n\n\t\t\t//fix port number\n\t\t\tif (isNaN(components.port)) {\n\t\t\t\tcomponents.port = matches[5];\n\t\t\t}\n\t\t} else {  //IE FIX for improper RegExp matching\n\t\t\t//store each component\n\t\t\tcomponents.scheme = matches[1] || undefined;\n\t\t\tcomponents.userinfo = (uriString.indexOf(\"@\") !== -1 ? matches[3] : undefined);\n\t\t\tcomponents.host = (uriString.indexOf(\"//\") !== -1 ? matches[4] : undefined);\n\t\t\tcomponents.port = parseInt(matches[5], 10);\n\t\t\tcomponents.path = matches[6] || \"\";\n\t\t\tcomponents.query = (uriString.indexOf(\"?\") !== -1 ? matches[7] : undefined);\n\t\t\tcomponents.fragment = (uriString.indexOf(\"#\") !== -1 ? matches[8] : undefined);\n\n\t\t\t//fix port number\n\t\t\tif (isNaN(components.port)) {\n\t\t\t\tcomponents.port = (uriString.match(/\\/\\/(?:.|\\n)*\\:(?:\\/|\\?|\\#|$)/) ? matches[4] : undefined);\n\t\t\t}\n\t\t}\n\n\t\tif (components.host) {\n\t\t\t//normalize IP hosts\n\t\t\tcomponents.host = _normalizeIPv6(_normalizeIPv4(components.host, protocol), protocol);\n\t\t}\n\n\t\t//determine reference type\n\t\tif (components.scheme === undefined && components.userinfo === undefined && components.host === undefined && components.port === undefined && !components.path && components.query === undefined) {\n\t\t\tcomponents.reference = \"same-document\";\n\t\t} else if (components.scheme === undefined) {\n\t\t\tcomponents.reference = \"relative\";\n\t\t} else if (components.fragment === undefined) {\n\t\t\tcomponents.reference = \"absolute\";\n\t\t} else {\n\t\t\tcomponents.reference = \"uri\";\n\t\t}\n\n\t\t//check for reference errors\n\t\tif (options.reference && options.reference !== \"suffix\" && options.reference !== components.reference) {\n\t\t\tcomponents.error = components.error || \"URI is not a \" + options.reference + \" reference.\";\n\t\t}\n\n\t\t//find scheme handler\n\t\tconst schemeHandler = SCHEMES[(options.scheme || components.scheme || \"\").toLowerCase()];\n\n\t\t//check if scheme can't handle IRIs\n\t\tif (!options.unicodeSupport && (!schemeHandler || !schemeHandler.unicodeSupport)) {\n\t\t\t//if host component is a domain name\n\t\t\tif (components.host && (options.domainHost || (schemeHandler && schemeHandler.domainHost))) {\n\t\t\t\t//convert Unicode IDN -> ASCII IDN\n\t\t\t\ttry {\n\t\t\t\t\tcomponents.host = punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase());\n\t\t\t\t} catch (e) {\n\t\t\t\t\tcomponents.error = components.error || \"Host's domain name can not be converted to ASCII via punycode: \" + e;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//convert IRI -> URI\n\t\t\t_normalizeComponentEncoding(components, URI_PROTOCOL);\n\t\t} else {\n\t\t\t//normalize encodings\n\t\t\t_normalizeComponentEncoding(components, protocol);\n\t\t}\n\n\t\t//perform scheme specific parsing\n\t\tif (schemeHandler && schemeHandler.parse) {\n\t\t\tschemeHandler.parse(components, options);\n\t\t}\n\t} else {\n\t\tcomponents.error = components.error || \"URI can not be parsed.\";\n\t}\n\n\treturn components;\n};\n\nfunction _recomposeAuthority(components:URIComponents, options:URIOptions):string|undefined {\n\tconst protocol = (options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL);\n\tconst uriTokens:Array<string> = [];\n\n\tif (components.userinfo !== undefined) {\n\t\turiTokens.push(components.userinfo);\n\t\turiTokens.push(\"@\");\n\t}\n\n\tif (components.host !== undefined) {\n\t\t//normalize IP hosts, add brackets and escape zone separator for IPv6\n\t\turiTokens.push(_normalizeIPv6(_normalizeIPv4(String(components.host), protocol), protocol).replace(protocol.IPV6ADDRESS, (_, $1, $2) => \"[\" + $1 + ($2 ? \"%25\" + $2 : \"\") + \"]\"));\n\t}\n\n\tif (typeof components.port === \"number\" || typeof components.port === \"string\") {\n\t\turiTokens.push(\":\");\n\t\turiTokens.push(String(components.port));\n\t}\n\n\treturn uriTokens.length ? uriTokens.join(\"\") : undefined;\n};\n\nconst RDS1 = /^\\.\\.?\\//;\nconst RDS2 = /^\\/\\.(\\/|$)/;\nconst RDS3 = /^\\/\\.\\.(\\/|$)/;\nconst RDS4 = /^\\.\\.?$/;\nconst RDS5 = /^\\/?(?:.|\\n)*?(?=\\/|$)/;\n\nexport function removeDotSegments(input:string):string {\n\tconst output:Array<string> = [];\n\n\twhile (input.length) {\n\t\tif (input.match(RDS1)) {\n\t\t\tinput = input.replace(RDS1, \"\");\n\t\t} else if (input.match(RDS2)) {\n\t\t\tinput = input.replace(RDS2, \"/\");\n\t\t} else if (input.match(RDS3)) {\n\t\t\tinput = input.replace(RDS3, \"/\");\n\t\t\toutput.pop();\n\t\t} else if (input === \".\" || input === \"..\") {\n\t\t\tinput = \"\";\n\t\t} else {\n\t\t\tconst im = input.match(RDS5);\n\t\t\tif (im) {\n\t\t\t\tconst s = im[0];\n\t\t\t\tinput = input.slice(s.length);\n\t\t\t\toutput.push(s);\n\t\t\t} else {\n\t\t\t\tthrow new Error(\"Unexpected dot segment condition\");\n\t\t\t}\n\t\t}\n\t}\n\n\treturn output.join(\"\");\n};\n\nexport function serialize(components:URIComponents, options:URIOptions = {}):string {\n\tconst protocol = (options.iri ? IRI_PROTOCOL : URI_PROTOCOL);\n\tconst uriTokens:Array<string> = [];\n\n\t//find scheme handler\n\tconst schemeHandler = SCHEMES[(options.scheme || components.scheme || \"\").toLowerCase()];\n\n\t//perform scheme specific serialization\n\tif (schemeHandler && schemeHandler.serialize) schemeHandler.serialize(components, options);\n\n\tif (components.host) {\n\t\t//if host component is an IPv6 address\n\t\tif (protocol.IPV6ADDRESS.test(components.host)) {\n\t\t\t//TODO: normalize IPv6 address as per RFC 5952\n\t\t}\n\n\t\t//if host component is a domain name\n\t\telse if (options.domainHost || (schemeHandler && schemeHandler.domainHost)) {\n\t\t\t//convert IDN via punycode\n\t\t\ttry {\n\t\t\t\tcomponents.host = (!options.iri ? punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase()) : punycode.toUnicode(components.host));\n\t\t\t} catch (e) {\n\t\t\t\tcomponents.error = components.error || \"Host's domain name can not be converted to \" + (!options.iri ? \"ASCII\" : \"Unicode\") + \" via punycode: \" + e;\n\t\t\t}\n\t\t}\n\t}\n\n\t//normalize encoding\n\t_normalizeComponentEncoding(components, protocol);\n\n\tif (options.reference !== \"suffix\" && components.scheme) {\n\t\turiTokens.push(components.scheme);\n\t\turiTokens.push(\":\");\n\t}\n\n\tconst authority = _recomposeAuthority(components, options);\n\tif (authority !== undefined) {\n\t\tif (options.reference !== \"suffix\") {\n\t\t\turiTokens.push(\"//\");\n\t\t}\n\n\t\turiTokens.push(authority);\n\n\t\tif (components.path && components.path.charAt(0) !== \"/\") {\n\t\t\turiTokens.push(\"/\");\n\t\t}\n\t}\n\n\tif (components.path !== undefined) {\n\t\tlet s = components.path;\n\n\t\tif (!options.absolutePath && (!schemeHandler || !schemeHandler.absolutePath)) {\n\t\t\ts = removeDotSegments(s);\n\t\t}\n\n\t\tif (authority === undefined) {\n\t\t\ts = s.replace(/^\\/\\//, \"/%2F\");  //don't allow the path to start with \"//\"\n\t\t}\n\n\t\turiTokens.push(s);\n\t}\n\n\tif (components.query !== undefined) {\n\t\turiTokens.push(\"?\");\n\t\turiTokens.push(components.query);\n\t}\n\n\tif (components.fragment !== undefined) {\n\t\turiTokens.push(\"#\");\n\t\turiTokens.push(components.fragment);\n\t}\n\n\treturn uriTokens.join(\"\");  //merge tokens into a string\n};\n\nexport function resolveComponents(base:URIComponents, relative:URIComponents, options:URIOptions = {}, skipNormalization?:boolean):URIComponents {\n\tconst target:URIComponents = {};\n\n\tif (!skipNormalization) {\n\t\tbase = parse(serialize(base, options), options);  //normalize base components\n\t\trelative = parse(serialize(relative, options), options);  //normalize relative components\n\t}\n\toptions = options || {};\n\n\tif (!options.tolerant && relative.scheme) {\n\t\ttarget.scheme = relative.scheme;\n\t\t//target.authority = relative.authority;\n\t\ttarget.userinfo = relative.userinfo;\n\t\ttarget.host = relative.host;\n\t\ttarget.port = relative.port;\n\t\ttarget.path = removeDotSegments(relative.path || \"\");\n\t\ttarget.query = relative.query;\n\t} else {\n\t\tif (relative.userinfo !== undefined || relative.host !== undefined || relative.port !== undefined) {\n\t\t\t//target.authority = relative.authority;\n\t\t\ttarget.userinfo = relative.userinfo;\n\t\t\ttarget.host = relative.host;\n\t\t\ttarget.port = relative.port;\n\t\t\ttarget.path = removeDotSegments(relative.path || \"\");\n\t\t\ttarget.query = relative.query;\n\t\t} else {\n\t\t\tif (!relative.path) {\n\t\t\t\ttarget.path = base.path;\n\t\t\t\tif (relative.query !== undefined) {\n\t\t\t\t\ttarget.query = relative.query;\n\t\t\t\t} else {\n\t\t\t\t\ttarget.query = base.query;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (relative.path.charAt(0) === \"/\") {\n\t\t\t\t\ttarget.path = removeDotSegments(relative.path);\n\t\t\t\t} else {\n\t\t\t\t\tif ((base.userinfo !== undefined || base.host !== undefined || base.port !== undefined) && !base.path) {\n\t\t\t\t\t\ttarget.path = \"/\" + relative.path;\n\t\t\t\t\t} else if (!base.path) {\n\t\t\t\t\t\ttarget.path = relative.path;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget.path = base.path.slice(0, base.path.lastIndexOf(\"/\") + 1) + relative.path;\n\t\t\t\t\t}\n\t\t\t\t\ttarget.path = removeDotSegments(target.path);\n\t\t\t\t}\n\t\t\t\ttarget.query = relative.query;\n\t\t\t}\n\t\t\t//target.authority = base.authority;\n\t\t\ttarget.userinfo = base.userinfo;\n\t\t\ttarget.host = base.host;\n\t\t\ttarget.port = base.port;\n\t\t}\n\t\ttarget.scheme = base.scheme;\n\t}\n\n\ttarget.fragment = relative.fragment;\n\n\treturn target;\n};\n\nexport function resolve(baseURI:string, relativeURI:string, options?:URIOptions):string {\n\tconst schemelessOptions = assign({ scheme : 'null' }, options);\n\treturn serialize(resolveComponents(parse(baseURI, schemelessOptions), parse(relativeURI, schemelessOptions), schemelessOptions, true), schemelessOptions);\n};\n\nexport function normalize(uri:string, options?:URIOptions):string;\nexport function normalize(uri:URIComponents, options?:URIOptions):URIComponents;\nexport function normalize(uri:any, options?:URIOptions):any {\n\tif (typeof uri === \"string\") {\n\t\turi = serialize(parse(uri, options), options);\n\t} else if (typeOf(uri) === \"object\") {\n\t\turi = parse(serialize(<URIComponents>uri, options), options);\n\t}\n\n\treturn uri;\n};\n\nexport function equal(uriA:string, uriB:string, options?: URIOptions):boolean;\nexport function equal(uriA:URIComponents, uriB:URIComponents, options?:URIOptions):boolean;\nexport function equal(uriA:any, uriB:any, options?:URIOptions):boolean {\n\tif (typeof uriA === \"string\") {\n\t\turiA = serialize(parse(uriA, options), options);\n\t} else if (typeOf(uriA) === \"object\") {\n\t\turiA = serialize(<URIComponents>uriA, options);\n\t}\n\n\tif (typeof uriB === \"string\") {\n\t\turiB = serialize(parse(uriB, options), options);\n\t} else if (typeOf(uriB) === \"object\") {\n\t\turiB = serialize(<URIComponents>uriB, options);\n\t}\n\n\treturn uriA === uriB;\n};\n\nexport function escapeComponent(str:string, options?:URIOptions):string {\n\treturn str && str.toString().replace((!options || !options.iri ? URI_PROTOCOL.ESCAPE : IRI_PROTOCOL.ESCAPE), pctEncChar);\n};\n\nexport function unescapeComponent(str:string, options?:URIOptions):string {\n\treturn str && str.toString().replace((!options || !options.iri ? URI_PROTOCOL.PCT_ENCODED : IRI_PROTOCOL.PCT_ENCODED), pctDecChars);\n};\n","'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7E]/; // non-ASCII chars\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n\t'overflow': 'Overflow: input needs wider integers to process',\n\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n\tthrow new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, fn) {\n\tconst result = [];\n\tlet length = array.length;\n\twhile (length--) {\n\t\tresult[length] = fn(array[length]);\n\t}\n\treturn result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {Array} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(string, fn) {\n\tconst parts = string.split('@');\n\tlet result = '';\n\tif (parts.length > 1) {\n\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t// the local part (i.e. everything up to `@`) intact.\n\t\tresult = parts[0] + '@';\n\t\tstring = parts[1];\n\t}\n\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\tstring = string.replace(regexSeparators, '\\x2E');\n\tconst labels = string.split('.');\n\tconst encoded = map(labels, fn).join('.');\n\treturn result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n\tconst output = [];\n\tlet counter = 0;\n\tconst length = string.length;\n\twhile (counter < length) {\n\t\tconst value = string.charCodeAt(counter++);\n\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t// It's a high surrogate, and there is a next character.\n\t\t\tconst extra = string.charCodeAt(counter++);\n\t\t\tif ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t} else {\n\t\t\t\t// It's an unmatched surrogate; only append this code unit, in case the\n\t\t\t\t// next code unit is the high surrogate of a surrogate pair.\n\t\t\t\toutput.push(value);\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t} else {\n\t\t\toutput.push(value);\n\t\t}\n\t}\n\treturn output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = array => String.fromCodePoint(...array);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n\tif (codePoint - 0x30 < 0x0A) {\n\t\treturn codePoint - 0x16;\n\t}\n\tif (codePoint - 0x41 < 0x1A) {\n\t\treturn codePoint - 0x41;\n\t}\n\tif (codePoint - 0x61 < 0x1A) {\n\t\treturn codePoint - 0x61;\n\t}\n\treturn base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n\t//  0..25 map to ASCII a..z or A..Z\n\t// 26..35 map to ASCII 0..9\n\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n\tlet k = 0;\n\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\tdelta += floor(delta / numPoints);\n\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\tdelta = floor(delta / baseMinusTMin);\n\t}\n\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n\t// Don't use UCS-2.\n\tconst output = [];\n\tconst inputLength = input.length;\n\tlet i = 0;\n\tlet n = initialN;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points: let `basic` be the number of input code\n\t// points before the last delimiter, or `0` if there is none, then copy\n\t// the first basic code points to the output.\n\n\tlet basic = input.lastIndexOf(delimiter);\n\tif (basic < 0) {\n\t\tbasic = 0;\n\t}\n\n\tfor (let j = 0; j < basic; ++j) {\n\t\t// if it's not a basic code point\n\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\terror('not-basic');\n\t\t}\n\t\toutput.push(input.charCodeAt(j));\n\t}\n\n\t// Main decoding loop: start just after the last delimiter if any basic code\n\t// points were copied; start at the beginning otherwise.\n\n\tfor (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t// `index` is the index of the next character to be consumed.\n\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t// which gets added to `i`. The overflow checking is easier\n\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t// value at the end to obtain `delta`.\n\t\tlet oldi = i;\n\t\tfor (let w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\tif (index >= inputLength) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\n\t\t\tconst digit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\ti += digit * w;\n\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\tif (digit < t) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst baseMinusT = base - t;\n\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tw *= baseMinusT;\n\n\t\t}\n\n\t\tconst out = output.length + 1;\n\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t// incrementing `n` each time, so we'll fix that now:\n\t\tif (floor(i / out) > maxInt - n) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tn += floor(i / out);\n\t\ti %= out;\n\n\t\t// Insert `n` at position `i` of the output.\n\t\toutput.splice(i++, 0, n);\n\n\t}\n\n\treturn String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n\tconst output = [];\n\n\t// Convert the input in UCS-2 to an array of Unicode code points.\n\tinput = ucs2decode(input);\n\n\t// Cache the length.\n\tlet inputLength = input.length;\n\n\t// Initialize the state.\n\tlet n = initialN;\n\tlet delta = 0;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points.\n\tfor (const currentValue of input) {\n\t\tif (currentValue < 0x80) {\n\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t}\n\t}\n\n\tlet basicLength = output.length;\n\tlet handledCPCount = basicLength;\n\n\t// `handledCPCount` is the number of code points that have been handled;\n\t// `basicLength` is the number of basic code points.\n\n\t// Finish the basic string with a delimiter unless it's empty.\n\tif (basicLength) {\n\t\toutput.push(delimiter);\n\t}\n\n\t// Main encoding loop:\n\twhile (handledCPCount < inputLength) {\n\n\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t// larger one:\n\t\tlet m = maxInt;\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\tm = currentValue;\n\t\t\t}\n\t\t}\n\n\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t// but guard against overflow.\n\t\tconst handledCPCountPlusOne = handledCPCount + 1;\n\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\tn = m;\n\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\t\t\tif (currentValue == n) {\n\t\t\t\t// Represent delta as a generalized variable-length integer.\n\t\t\t\tlet q = delta;\n\t\t\t\tfor (let k = base; /* no condition */; k += base) {\n\t\t\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst qMinusT = q - t;\n\t\t\t\t\tconst baseMinusT = base - t;\n\t\t\t\t\toutput.push(\n\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t);\n\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t}\n\n\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\tdelta = 0;\n\t\t\t\t++handledCPCount;\n\t\t\t}\n\t\t}\n\n\t\t++delta;\n\t\t++n;\n\n\t}\n\treturn output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexPunycode.test(string)\n\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t: string;\n\t});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexNonASCII.test(string)\n\t\t\t? 'xn--' + encode(string)\n\t\t\t: string;\n\t});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n\t/**\n\t * A string representing the current Punycode.js version number.\n\t * @memberOf punycode\n\t * @type String\n\t */\n\t'version': '2.1.0',\n\t/**\n\t * An object of methods to convert from JavaScript's internal character\n\t * representation (UCS-2) to Unicode code points, and back.\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode\n\t * @type Object\n\t */\n\t'ucs2': {\n\t\t'decode': ucs2decode,\n\t\t'encode': ucs2encode\n\t},\n\t'decode': decode,\n\t'encode': encode,\n\t'toASCII': toASCII,\n\t'toUnicode': toUnicode\n};\n\nexport default punycode;\n","import { URIRegExps } from \"./uri\";\nimport { buildExps } from \"./regexps-uri\";\n\nexport default buildExps(true);\n","import { URIRegExps } from \"./uri\";\nimport { merge, subexp } from \"./util\";\n\nexport function buildExps(isIRI:boolean):URIRegExps {\n\tconst\n\t\tALPHA$$ = \"[A-Za-z]\",\n\t\tCR$ = \"[\\\\x0D]\",\n\t\tDIGIT$$ = \"[0-9]\",\n\t\tDQUOTE$$ = \"[\\\\x22]\",\n\t\tHEXDIG$$ = merge(DIGIT$$, \"[A-Fa-f]\"),  //case-insensitive\n\t\tLF$$ = \"[\\\\x0A]\",\n\t\tSP$$ = \"[\\\\x20]\",\n\t\tPCT_ENCODED$ = subexp(subexp(\"%[EFef]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%[89A-Fa-f]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%\" + HEXDIG$$ + HEXDIG$$)),  //expanded\n\t\tGEN_DELIMS$$ = \"[\\\\:\\\\/\\\\?\\\\#\\\\[\\\\]\\\\@]\",\n\t\tSUB_DELIMS$$ = \"[\\\\!\\\\$\\\\&\\\\'\\\\(\\\\)\\\\*\\\\+\\\\,\\\\;\\\\=]\",\n\t\tRESERVED$$ = merge(GEN_DELIMS$$, SUB_DELIMS$$),\n\t\tUCSCHAR$$ = isIRI ? \"[\\\\xA0-\\\\u200D\\\\u2010-\\\\u2029\\\\u202F-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFEF]\" : \"[]\",  //subset, excludes bidi control characters\n\t\tIPRIVATE$$ = isIRI ? \"[\\\\uE000-\\\\uF8FF]\" : \"[]\",  //subset\n\t\tUNRESERVED$$ = merge(ALPHA$$, DIGIT$$, \"[\\\\-\\\\.\\\\_\\\\~]\", UCSCHAR$$),\n\t\tSCHEME$ = subexp(ALPHA$$ + merge(ALPHA$$, DIGIT$$, \"[\\\\+\\\\-\\\\.]\") + \"*\"),\n\t\tUSERINFO$ = subexp(subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:]\")) + \"*\"),\n\t\tDEC_OCTET$ = subexp(subexp(\"25[0-5]\") + \"|\" + subexp(\"2[0-4]\" + DIGIT$$) + \"|\" + subexp(\"1\" + DIGIT$$ + DIGIT$$) + \"|\" + subexp(\"[1-9]\" + DIGIT$$) + \"|\" + DIGIT$$),\n\t\tDEC_OCTET_RELAXED$ = subexp(subexp(\"25[0-5]\") + \"|\" + subexp(\"2[0-4]\" + DIGIT$$) + \"|\" + subexp(\"1\" + DIGIT$$ + DIGIT$$) + \"|\" + subexp(\"0?[1-9]\" + DIGIT$$) + \"|0?0?\" + DIGIT$$),  //relaxed parsing rules\n\t\tIPV4ADDRESS$ = subexp(DEC_OCTET_RELAXED$ + \"\\\\.\" + DEC_OCTET_RELAXED$ + \"\\\\.\" + DEC_OCTET_RELAXED$ + \"\\\\.\" + DEC_OCTET_RELAXED$),\n\t\tH16$ = subexp(HEXDIG$$ + \"{1,4}\"),\n\t\tLS32$ = subexp(subexp(H16$ + \"\\\\:\" + H16$) + \"|\" + IPV4ADDRESS$),\n\t\tIPV6ADDRESS1$ = subexp(                                                            subexp(H16$ + \"\\\\:\") + \"{6}\" + LS32$), //                           6( h16 \":\" ) ls32\n\t\tIPV6ADDRESS2$ = subexp(                                                 \"\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{5}\" + LS32$), //                      \"::\" 5( h16 \":\" ) ls32\n\t\tIPV6ADDRESS3$ = subexp(subexp(                                 H16$) + \"?\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{4}\" + LS32$), //[               h16 ] \"::\" 4( h16 \":\" ) ls32\n\t\tIPV6ADDRESS4$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,1}\" + H16$) + \"?\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{3}\" + LS32$), //[ *1( h16 \":\" ) h16 ] \"::\" 3( h16 \":\" ) ls32\n\t\tIPV6ADDRESS5$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,2}\" + H16$) + \"?\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{2}\" + LS32$), //[ *2( h16 \":\" ) h16 ] \"::\" 2( h16 \":\" ) ls32\n\t\tIPV6ADDRESS6$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,3}\" + H16$) + \"?\\\\:\\\\:\" +        H16$ + \"\\\\:\"          + LS32$), //[ *3( h16 \":\" ) h16 ] \"::\"    h16 \":\"   ls32\n\t\tIPV6ADDRESS7$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,4}\" + H16$) + \"?\\\\:\\\\:\"                                + LS32$), //[ *4( h16 \":\" ) h16 ] \"::\"              ls32\n\t\tIPV6ADDRESS8$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,5}\" + H16$) + \"?\\\\:\\\\:\"                                + H16$ ), //[ *5( h16 \":\" ) h16 ] \"::\"              h16\n\t\tIPV6ADDRESS9$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,6}\" + H16$) + \"?\\\\:\\\\:\"                                       ), //[ *6( h16 \":\" ) h16 ] \"::\"\n\t\tIPV6ADDRESS$ = subexp([IPV6ADDRESS1$, IPV6ADDRESS2$, IPV6ADDRESS3$, IPV6ADDRESS4$, IPV6ADDRESS5$, IPV6ADDRESS6$, IPV6ADDRESS7$, IPV6ADDRESS8$, IPV6ADDRESS9$].join(\"|\")),\n\t\tZONEID$ = subexp(subexp(UNRESERVED$$ + \"|\" + PCT_ENCODED$) + \"+\"),  //RFC 6874\n\t\tIPV6ADDRZ$ = subexp(IPV6ADDRESS$ + \"\\\\%25\" + ZONEID$),  //RFC 6874\n\t\tIPV6ADDRZ_RELAXED$ = subexp(IPV6ADDRESS$ + subexp(\"\\\\%25|\\\\%(?!\" + HEXDIG$$ + \"{2})\") + ZONEID$),  //RFC 6874, with relaxed parsing rules\n\t\tIPVFUTURE$ = subexp(\"[vV]\" + HEXDIG$$ + \"+\\\\.\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:]\") + \"+\"),\n\t\tIP_LITERAL$ = subexp(\"\\\\[\" + subexp(IPV6ADDRZ_RELAXED$ + \"|\" + IPV6ADDRESS$ + \"|\" + IPVFUTURE$) + \"\\\\]\"),  //RFC 6874\n\t\tREG_NAME$ = subexp(subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$)) + \"*\"),\n\t\tHOST$ = subexp(IP_LITERAL$ + \"|\" + IPV4ADDRESS$ + \"(?!\" + REG_NAME$ + \")\" + \"|\" + REG_NAME$),\n\t\tPORT$ = subexp(DIGIT$$ + \"*\"),\n\t\tAUTHORITY$ = subexp(subexp(USERINFO$ + \"@\") + \"?\" + HOST$ + subexp(\"\\\\:\" + PORT$) + \"?\"),\n\t\tPCHAR$ = subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:\\\\@]\")),\n\t\tSEGMENT$ = subexp(PCHAR$ + \"*\"),\n\t\tSEGMENT_NZ$ = subexp(PCHAR$ + \"+\"),\n\t\tSEGMENT_NZ_NC$ = subexp(subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\@]\")) + \"+\"),\n\t\tPATH_ABEMPTY$ = subexp(subexp(\"\\\\/\" + SEGMENT$) + \"*\"),\n\t\tPATH_ABSOLUTE$ = subexp(\"\\\\/\" + subexp(SEGMENT_NZ$ + PATH_ABEMPTY$) + \"?\"),  //simplified\n\t\tPATH_NOSCHEME$ = subexp(SEGMENT_NZ_NC$ + PATH_ABEMPTY$),  //simplified\n\t\tPATH_ROOTLESS$ = subexp(SEGMENT_NZ$ + PATH_ABEMPTY$),  //simplified\n\t\tPATH_EMPTY$ = \"(?!\" + PCHAR$ + \")\",\n\t\tPATH$ = subexp(PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_NOSCHEME$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$),\n\t\tQUERY$ = subexp(subexp(PCHAR$ + \"|\" + merge(\"[\\\\/\\\\?]\", IPRIVATE$$)) + \"*\"),\n\t\tFRAGMENT$ = subexp(subexp(PCHAR$ + \"|[\\\\/\\\\?]\") + \"*\"),\n\t\tHIER_PART$ = subexp(subexp(\"\\\\/\\\\/\" + AUTHORITY$ + PATH_ABEMPTY$) + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$),\n\t\tURI$ = subexp(SCHEME$ + \"\\\\:\" + HIER_PART$ + subexp(\"\\\\?\" + QUERY$) + \"?\" + subexp(\"\\\\#\" + FRAGMENT$) + \"?\"),\n\t\tRELATIVE_PART$ = subexp(subexp(\"\\\\/\\\\/\" + AUTHORITY$ + PATH_ABEMPTY$) + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_NOSCHEME$ + \"|\" + PATH_EMPTY$),\n\t\tRELATIVE$ = subexp(RELATIVE_PART$ + subexp(\"\\\\?\" + QUERY$) + \"?\" + subexp(\"\\\\#\" + FRAGMENT$) + \"?\"),\n\t\tURI_REFERENCE$ = subexp(URI$ + \"|\" + RELATIVE$),\n\t\tABSOLUTE_URI$ = subexp(SCHEME$ + \"\\\\:\" + HIER_PART$ + subexp(\"\\\\?\" + QUERY$) + \"?\"),\n\n\t\tGENERIC_REF$ = \"^(\" + SCHEME$ + \")\\\\:\" + subexp(subexp(\"\\\\/\\\\/(\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?)\") + \"?(\" + PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$ + \")\") + subexp(\"\\\\?(\" + QUERY$ + \")\") + \"?\" + subexp(\"\\\\#(\" + FRAGMENT$ + \")\") + \"?$\",\n\t\tRELATIVE_REF$ = \"^(){0}\" + subexp(subexp(\"\\\\/\\\\/(\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?)\") + \"?(\" + PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_NOSCHEME$ + \"|\" + PATH_EMPTY$ + \")\") + subexp(\"\\\\?(\" + QUERY$ + \")\") + \"?\" + subexp(\"\\\\#(\" + FRAGMENT$ + \")\") + \"?$\",\n\t\tABSOLUTE_REF$ = \"^(\" + SCHEME$ + \")\\\\:\" + subexp(subexp(\"\\\\/\\\\/(\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?)\") + \"?(\" + PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$ + \")\") + subexp(\"\\\\?(\" + QUERY$ + \")\") + \"?$\",\n\t\tSAMEDOC_REF$ = \"^\" + subexp(\"\\\\#(\" + FRAGMENT$ + \")\") + \"?$\",\n\t\tAUTHORITY_REF$ = \"^\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?$\"\n\t;\n\n\treturn {\n\t\tNOT_SCHEME : new RegExp(merge(\"[^]\", ALPHA$$, DIGIT$$, \"[\\\\+\\\\-\\\\.]\"), \"g\"),\n\t\tNOT_USERINFO : new RegExp(merge(\"[^\\\\%\\\\:]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_HOST : new RegExp(merge(\"[^\\\\%\\\\[\\\\]\\\\:]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_PATH : new RegExp(merge(\"[^\\\\%\\\\/\\\\:\\\\@]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_PATH_NOSCHEME : new RegExp(merge(\"[^\\\\%\\\\/\\\\@]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_QUERY : new RegExp(merge(\"[^\\\\%]\", UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:\\\\@\\\\/\\\\?]\", IPRIVATE$$), \"g\"),\n\t\tNOT_FRAGMENT : new RegExp(merge(\"[^\\\\%]\", UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:\\\\@\\\\/\\\\?]\"), \"g\"),\n\t\tESCAPE : new RegExp(merge(\"[^]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tUNRESERVED : new RegExp(UNRESERVED$$, \"g\"),\n\t\tOTHER_CHARS : new RegExp(merge(\"[^\\\\%]\", UNRESERVED$$, RESERVED$$), \"g\"),\n\t\tPCT_ENCODED : new RegExp(PCT_ENCODED$, \"g\"),\n\t\tIPV4ADDRESS : new RegExp(\"^(\" + IPV4ADDRESS$ + \")$\"),\n\t\tIPV6ADDRESS : new RegExp(\"^\\\\[?(\" + IPV6ADDRESS$ + \")\" + subexp(subexp(\"\\\\%25|\\\\%(?!\" + HEXDIG$$ + \"{2})\") + \"(\" + ZONEID$ + \")\") + \"?\\\\]?$\")  //RFC 6874, with relaxed parsing rules\n\t};\n}\n\nexport default buildExps(false);\n","export function merge(...sets:Array<string>):string {\n\tif (sets.length > 1) {\n\t\tsets[0] = sets[0].slice(0, -1);\n\t\tconst xl = sets.length - 1;\n\t\tfor (let x = 1; x < xl; ++x) {\n\t\t\tsets[x] = sets[x].slice(1, -1);\n\t\t}\n\t\tsets[xl] = sets[xl].slice(1);\n\t\treturn sets.join('');\n\t} else {\n\t\treturn sets[0];\n\t}\n}\n\nexport function subexp(str:string):string {\n\treturn \"(?:\" + str + \")\";\n}\n\nexport function typeOf(o:any):string {\n\treturn o === undefined ? \"undefined\" : (o === null ? \"null\" : Object.prototype.toString.call(o).split(\" \").pop().split(\"]\").shift().toLowerCase());\n}\n\nexport function toUpperCase(str:string):string {\n\treturn str.toUpperCase();\n}\n\nexport function toArray(obj:any):Array<any> {\n\treturn obj !== undefined && obj !== null ? (obj instanceof Array ? obj : (typeof obj.length !== \"number\" || obj.split || obj.setInterval || obj.call ? [obj] : Array.prototype.slice.call(obj))) : [];\n}\n\n\nexport function assign(target: object, source: any): any {\n\tconst obj = target as any;\n\tif (source) {\n\t\tfor (const key in source) {\n\t\t\tobj[key] = source[key];\n\t\t}\n\t}\n\treturn obj;\n}"],"names":["SCHEMES","uuid","scheme","urn","mailto","wss","ws","https","http","urnComponents","nss","uuidComponents","toLowerCase","options","error","tolerant","match","UUID","undefined","handler","uriComponents","path","nid","schemeHandler","serialize","urnScheme","parse","matches","components","URN_PARSE","query","fields","join","length","push","name","replace","PCT_ENCODED","decodeUnreserved","toUpperCase","NOT_HFNAME","pctEncChar","headers","NOT_HFVALUE","O","mailtoComponents","body","subject","to","x","localPart","domain","iri","e","punycode","toASCII","unescapeComponent","toUnicode","toAddr","slice","atIdx","NOT_LOCAL_PART","lastIndexOf","String","xl","toArray","addr","unicodeSupport","split","unknownHeaders","hfield","toAddrs","hfields","decStr","UNRESERVED","str","pctDecChars","RegExp","merge","UNRESERVED$$","SOME_DELIMS$$","ATEXT$$","VCHAR$$","PCT_ENCODED$","QTEXT$$","subexp","HEXDIG$$","isIRI","domainHost","wsComponents","fragment","resourceName","secure","port","isSecure","host","toString","URI_PROTOCOL","IRI_PROTOCOL","ESCAPE","escapeComponent","uriA","uriB","typeOf","equal","uri","normalize","resolveComponents","baseURI","schemelessOptions","relativeURI","assign","resolve","target","relative","base","userinfo","removeDotSegments","charAt","skipNormalization","uriTokens","s","authority","absolutePath","reference","_recomposeAuthority","protocol","IPV6ADDRESS","test","output","Error","input","im","RDS5","pop","RDS3","RDS2","RDS1","$1","$2","_normalizeIPv6","_normalizeIPv4","_","uriString","isNaN","indexOf","parseInt","NO_MATCH_IS_UNDEFINED","URI_PARSE","newHost","zone","newFirst","newLast","longestZeroFields","index","b","a","allZeroFields","sort","acc","lastLongest","field","reduce","fieldCount","isLastFieldIPv4Address","firstFields","lastFields","lastFieldsStart","Array","IPV4ADDRESS","last","map","_stripLeadingZeros","first","address","reverse","NOT_FRAGMENT","NOT_QUERY","NOT_PATH","NOT_PATH_NOSCHEME","NOT_HOST","NOT_USERINFO","NOT_SCHEME","_normalizeComponentEncoding","newStr","substr","i","fromCharCode","c","c2","c3","il","chr","charCodeAt","encode","decode","ucs2encode","ucs2decode","regexNonASCII","string","mapDomain","regexPunycode","n","delta","handledCPCount","adapt","handledCPCountPlusOne","basicLength","stringFromCharCode","digitToBasic","q","floor","qMinusT","baseMinusT","t","k","bias","tMin","tMax","currentValue","maxInt","m","inputLength","delimiter","initialBias","initialN","fromCodePoint","splice","out","oldi","w","digit","basicToDigit","basic","j","baseMinusTMin","skew","numPoints","firstTime","damp","flag","codePoint","array","value","extra","counter","result","encoded","labels","fn","regexSeparators","parts","RangeError","errors","type","Math","buildExps","IPV6ADDRESS$","ZONEID$","IPV4ADDRESS$","RESERVED$$","SUB_DELIMS$$","IPRIVATE$$","ALPHA$$","DIGIT$$","AUTHORITY_REF$","USERINFO$","HOST$","PORT$","SAMEDOC_REF$","FRAGMENT$","ABSOLUTE_REF$","SCHEME$","PATH_ABEMPTY$","PATH_ABSOLUTE$","PATH_ROOTLESS$","PATH_EMPTY$","QUERY$","RELATIVE_REF$","PATH_NOSCHEME$","GENERIC_REF$","ABSOLUTE_URI$","HIER_PART$","URI_REFERENCE$","URI$","RELATIVE$","RELATIVE_PART$","AUTHORITY$","PCHAR$","PATH$","SEGMENT_NZ$","SEGMENT_NZ_NC$","SEGMENT$","IP_LITERAL$","REG_NAME$","IPV6ADDRZ_RELAXED$","IPVFUTURE$","IPV6ADDRESS1$","IPV6ADDRESS2$","IPV6ADDRESS3$","IPV6ADDRESS4$","IPV6ADDRESS5$","IPV6ADDRESS6$","IPV6ADDRESS7$","IPV6ADDRESS8$","IPV6ADDRESS9$","H16$","LS32$","DEC_OCTET_RELAXED$","DEC_OCTET$","UCSCHAR$$","GEN_DELIMS$$","SP$$","DQUOTE$$","CR$","obj","key","source","setInterval","call","prototype","o","Object","shift","sets"],"mappings":";;;;;;;AYAA,SAAA8E,KAAA,GAAA;sCAAyBsP,IAAzB;YAAA;;;QACKA,KAAKnS,MAAL,GAAc,CAAlB,EAAqB;aACf,CAAL,IAAUmS,KAAK,CAAL,EAAQzQ,KAAR,CAAc,CAAd,EAAiB,CAAC,CAAlB,CAAV;YACMK,KAAKoQ,KAAKnS,MAAL,GAAc,CAAzB;aACK,IAAIgB,IAAI,CAAb,EAAgBA,IAAIe,EAApB,EAAwB,EAAEf,CAA1B,EAA6B;iBACvBA,CAAL,IAAUmR,KAAKnR,CAAL,EAAQU,KAAR,CAAc,CAAd,EAAiB,CAAC,CAAlB,CAAV;;aAEIK,EAAL,IAAWoQ,KAAKpQ,EAAL,EAASL,KAAT,CAAe,CAAf,CAAX;eACOyQ,KAAKpS,IAAL,CAAU,EAAV,CAAP;KAPD,MAQO;eACCoS,KAAK,CAAL,CAAP;;;AAIF,AAAA,SAAA/O,MAAA,CAAuBV,GAAvB,EAAA;WACQ,QAAQA,GAAR,GAAc,GAArB;;AAGD,AAAA,SAAA4B,MAAA,CAAuB0N,CAAvB,EAAA;WACQA,MAAM/S,SAAN,GAAkB,WAAlB,GAAiC+S,MAAM,IAAN,GAAa,MAAb,GAAsBC,OAAOF,SAAP,CAAiBhO,QAAjB,CAA0B+N,IAA1B,CAA+BE,CAA/B,EAAkC7P,KAAlC,CAAwC,GAAxC,EAA6CkE,GAA7C,GAAmDlE,KAAnD,CAAyD,GAAzD,EAA8D+P,KAA9D,GAAsEvT,WAAtE,EAA9D;;AAGD,AAAA,SAAA2B,WAAA,CAA4BoC,GAA5B,EAAA;WACQA,IAAIpC,WAAJ,EAAP;;AAGD,AAAA,SAAA0B,OAAA,CAAwB0P,GAAxB,EAAA;WACQA,QAAQzS,SAAR,IAAqByS,QAAQ,IAA7B,GAAqCA,eAAenJ,KAAf,GAAuBmJ,GAAvB,GAA8B,OAAOA,IAAI1R,MAAX,KAAsB,QAAtB,IAAkC0R,IAAIvP,KAAtC,IAA+CuP,IAAIG,WAAnD,IAAkEH,IAAII,IAAtE,GAA6E,CAACJ,GAAD,CAA7E,GAAqFnJ,MAAMwJ,SAAN,CAAgBrQ,KAAhB,CAAsBoQ,IAAtB,CAA2BJ,GAA3B,CAAxJ,GAA4L,EAAnM;;AAID,AAAA,SAAA5M,MAAA,CAAuBE,MAAvB,EAAuC4M,MAAvC,EAAA;QACOF,MAAM1M,MAAZ;QACI4M,MAAJ,EAAY;aACN,IAAMD,GAAX,IAAkBC,MAAlB,EAA0B;gBACrBD,GAAJ,IAAWC,OAAOD,GAAP,CAAX;;;WAGKD,GAAP;;;ADnCD,SAAA3D,SAAA,CAA0BzK,KAA1B,EAAA;QAEEgL,UAAU,UADX;QAECmD,MAAM,SAFP;QAGClD,UAAU,OAHX;QAICiD,WAAW,SAJZ;QAKCnO,WAAWR,MAAM0L,OAAN,EAAe,UAAf,CALZ;;WAMQ,SANR;QAOCgD,OAAO,SAPR;QAQCrO,eAAeE,OAAOA,OAAO,YAAYC,QAAZ,GAAuB,GAAvB,GAA6BA,QAA7B,GAAwCA,QAAxC,GAAmD,GAAnD,GAAyDA,QAAzD,GAAoEA,QAA3E,IAAuF,GAAvF,GAA6FD,OAAO,gBAAgBC,QAAhB,GAA2B,GAA3B,GAAiCA,QAAjC,GAA4CA,QAAnD,CAA7F,GAA4J,GAA5J,GAAkKD,OAAO,MAAMC,QAAN,GAAiBA,QAAxB,CAAzK,CARhB;;mBASgB,yBAThB;QAUC+K,eAAe,qCAVhB;QAWCD,aAAatL,MAAMyO,YAAN,EAAoBlD,YAApB,CAXd;QAYCiD,YAAY/N,QAAQ,6EAAR,GAAwF,IAZrG;;iBAacA,QAAQ,mBAAR,GAA8B,IAb5C;;mBAcgBT,MAAMyL,OAAN,EAAeC,OAAf,EAAwB,gBAAxB,EAA0C8C,SAA1C,CAdhB;QAeCtC,UAAU3L,OAAOkL,UAAUzL,MAAMyL,OAAN,EAAeC,OAAf,EAAwB,aAAxB,CAAV,GAAmD,GAA1D,CAfX;QAgBCE,YAAYrL,OAAOA,OAAOF,eAAe,GAAf,GAAqBL,MAAMC,YAAN,EAAoBsL,YAApB,EAAkC,OAAlC,CAA5B,IAA0E,GAAjF,CAhBb;QAiBCgD,aAAahO,OAAOA,OAAO,SAAP,IAAoB,GAApB,GAA0BA,OAAO,WAAWmL,OAAlB,CAA1B,GAAuD,GAAvD,GAA6DnL,OAAO,MAAMmL,OAAN,GAAgBA,OAAvB,CAA7D,GAA+F,GAA/F,GAAqGnL,OAAO,UAAUmL,OAAjB,CAArG,GAAiI,GAAjI,GAAuIA,OAA9I,CAjBd;QAkBC4C,qBAAqB/N,OAAOA,OAAO,SAAP,IAAoB,GAApB,GAA0BA,OAAO,WAAWmL,OAAlB,CAA1B,GAAuD,GAAvD,GAA6DnL,OAAO,MAAMmL,OAAN,GAAgBA,OAAvB,CAA7D,GAA+F,GAA/F,GAAqGnL,OAAO,YAAYmL,OAAnB,CAArG,GAAmI,OAAnI,GAA6IA,OAApJ,CAlBtB;;mBAmBgBnL,OAAO+N,qBAAqB,KAArB,GAA6BA,kBAA7B,GAAkD,KAAlD,GAA0DA,kBAA1D,GAA+E,KAA/E,GAAuFA,kBAA9F,CAnBhB;QAoBCF,OAAO7N,OAAOC,WAAW,OAAlB,CApBR;QAqBC6N,QAAQ9N,OAAOA,OAAO6N,OAAO,KAAP,GAAeA,IAAtB,IAA8B,GAA9B,GAAoC/C,YAA3C,CArBT;QAsBCsC,gBAAgBpN,OAAmEA,OAAO6N,OAAO,KAAd,IAAuB,KAAvB,GAA+BC,KAAlG,CAtBjB;;oBAuBiB9N,OAAwD,WAAWA,OAAO6N,OAAO,KAAd,CAAX,GAAkC,KAAlC,GAA0CC,KAAlG,CAvBjB;;oBAwBiB9N,OAAOA,OAAwC6N,IAAxC,IAAgD,SAAhD,GAA4D7N,OAAO6N,OAAO,KAAd,CAA5D,GAAmF,KAAnF,GAA2FC,KAAlG,CAxBjB;;oBAyBiB9N,OAAOA,OAAOA,OAAO6N,OAAO,KAAd,IAAuB,OAAvB,GAAiCA,IAAxC,IAAgD,SAAhD,GAA4D7N,OAAO6N,OAAO,KAAd,CAA5D,GAAmF,KAAnF,GAA2FC,KAAlG,CAzBjB;;oBA0BiB9N,OAAOA,OAAOA,OAAO6N,OAAO,KAAd,IAAuB,OAAvB,GAAiCA,IAAxC,IAAgD,SAAhD,GAA4D7N,OAAO6N,OAAO,KAAd,CAA5D,GAAmF,KAAnF,GAA2FC,KAAlG,CA1BjB;;oBA2BiB9N,OAAOA,OAAOA,OAAO6N,OAAO,KAAd,IAAuB,OAAvB,GAAiCA,IAAxC,IAAgD,SAAhD,GAAmEA,IAAnE,GAA0E,KAA1E,GAA2FC,KAAlG,CA3BjB;;oBA4BiB9N,OAAOA,OAAOA,OAAO6N,OAAO,KAAd,IAAuB,OAAvB,GAAiCA,IAAxC,IAAgD,SAAhD,GAA2FC,KAAlG,CA5BjB;;oBA6BiB9N,OAAOA,OAAOA,OAAO6N,OAAO,KAAd,IAAuB,OAAvB,GAAiCA,IAAxC,IAAgD,SAAhD,GAA2FA,IAAlG,CA7BjB;;oBA8BiB7N,OAAOA,OAAOA,OAAO6N,OAAO,KAAd,IAAuB,OAAvB,GAAiCA,IAAxC,IAAgD,SAAvD,CA9BjB;;mBA+BgB7N,OAAO,CAACoN,aAAD,EAAgBC,aAAhB,EAA+BC,aAA/B,EAA8CC,aAA9C,EAA6DC,aAA7D,EAA4EC,aAA5E,EAA2FC,aAA3F,EAA0GC,aAA1G,EAAyHC,aAAzH,EAAwIjR,IAAxI,CAA6I,GAA7I,CAAP,CA/BhB;QAgCCkO,UAAU7K,OAAOA,OAAON,eAAe,GAAf,GAAqBI,YAA5B,IAA4C,GAAnD,CAhCX;;iBAiCcE,OAAO4K,eAAe,OAAf,GAAyBC,OAAhC,CAjCd;;yBAkCsB7K,OAAO4K,eAAe5K,OAAO,iBAAiBC,QAAjB,GAA4B,MAAnC,CAAf,GAA4D4K,OAAnE,CAlCtB;;iBAmCc7K,OAAO,SAASC,QAAT,GAAoB,MAApB,GAA6BR,MAAMC,YAAN,EAAoBsL,YAApB,EAAkC,OAAlC,CAA7B,GAA0E,GAAjF,CAnCd;QAoCCgC,cAAchN,OAAO,QAAQA,OAAOkN,qBAAqB,GAArB,GAA2BtC,YAA3B,GAA0C,GAA1C,GAAgDuC,UAAvD,CAAR,GAA6E,KAApF,CApCf;;gBAqCanN,OAAOA,OAAOF,eAAe,GAAf,GAAqBL,MAAMC,YAAN,EAAoBsL,YAApB,CAA5B,IAAiE,GAAxE,CArCb;QAsCCM,QAAQtL,OAAOgN,cAAc,GAAd,GAAoBlC,YAApB,GAAmC,KAAnC,GAA2CmC,SAA3C,GAAuD,GAAvD,GAA6D,GAA7D,GAAmEA,SAA1E,CAtCT;QAuCC1B,QAAQvL,OAAOmL,UAAU,GAAjB,CAvCT;QAwCCuB,aAAa1M,OAAOA,OAAOqL,YAAY,GAAnB,IAA0B,GAA1B,GAAgCC,KAAhC,GAAwCtL,OAAO,QAAQuL,KAAf,CAAxC,GAAgE,GAAvE,CAxCd;QAyCCoB,SAAS3M,OAAOF,eAAe,GAAf,GAAqBL,MAAMC,YAAN,EAAoBsL,YAApB,EAAkC,UAAlC,CAA5B,CAzCV;QA0CC+B,WAAW/M,OAAO2M,SAAS,GAAhB,CA1CZ;QA2CCE,cAAc7M,OAAO2M,SAAS,GAAhB,CA3Cf;QA4CCG,iBAAiB9M,OAAOA,OAAOF,eAAe,GAAf,GAAqBL,MAAMC,YAAN,EAAoBsL,YAApB,EAAkC,OAAlC,CAA5B,IAA0E,GAAjF,CA5ClB;QA6CCY,gBAAgB5L,OAAOA,OAAO,QAAQ+M,QAAf,IAA2B,GAAlC,CA7CjB;QA8CClB,iBAAiB7L,OAAO,QAAQA,OAAO6M,cAAcjB,aAArB,CAAR,GAA8C,GAArD,CA9ClB;;qBA+CkB5L,OAAO8M,iBAAiBlB,aAAxB,CA/ClB;;qBAgDkB5L,OAAO6M,cAAcjB,aAArB,CAhDlB;;kBAiDe,QAAQe,MAAR,GAAiB,GAjDhC;QAkDCC,QAAQ5M,OAAO4L,gBAAgB,GAAhB,GAAsBC,cAAtB,GAAuC,GAAvC,GAA6CK,cAA7C,GAA8D,GAA9D,GAAoEJ,cAApE,GAAqF,GAArF,GAA2FC,WAAlG,CAlDT;QAmDCC,SAAShM,OAAOA,OAAO2M,SAAS,GAAT,GAAelN,MAAM,UAAN,EAAkBwL,UAAlB,CAAtB,IAAuD,GAA9D,CAnDV;QAoDCQ,YAAYzL,OAAOA,OAAO2M,SAAS,WAAhB,IAA+B,GAAtC,CApDb;QAqDCN,aAAarM,OAAOA,OAAO,WAAW0M,UAAX,GAAwBd,aAA/B,IAAgD,GAAhD,GAAsDC,cAAtD,GAAuE,GAAvE,GAA6EC,cAA7E,GAA8F,GAA9F,GAAoGC,WAA3G,CArDd;QAsDCQ,OAAOvM,OAAO2L,UAAU,KAAV,GAAkBU,UAAlB,GAA+BrM,OAAO,QAAQgM,MAAf,CAA/B,GAAwD,GAAxD,GAA8DhM,OAAO,QAAQyL,SAAf,CAA9D,GAA0F,GAAjG,CAtDR;QAuDCgB,iBAAiBzM,OAAOA,OAAO,WAAW0M,UAAX,GAAwBd,aAA/B,IAAgD,GAAhD,GAAsDC,cAAtD,GAAuE,GAAvE,GAA6EK,cAA7E,GAA8F,GAA9F,GAAoGH,WAA3G,CAvDlB;QAwDCS,YAAYxM,OAAOyM,iBAAiBzM,OAAO,QAAQgM,MAAf,CAAjB,GAA0C,GAA1C,GAAgDhM,OAAO,QAAQyL,SAAf,CAAhD,GAA4E,GAAnF,CAxDb;QAyDCa,iBAAiBtM,OAAOuM,OAAO,GAAP,GAAaC,SAApB,CAzDlB;QA0DCJ,gBAAgBpM,OAAO2L,UAAU,KAAV,GAAkBU,UAAlB,GAA+BrM,OAAO,QAAQgM,MAAf,CAA/B,GAAwD,GAA/D,CA1DjB;QA4DCG,eAAe,OAAOR,OAAP,GAAiB,MAAjB,GAA0B3L,OAAOA,OAAO,YAAYA,OAAO,MAAMqL,SAAN,GAAkB,IAAzB,CAAZ,GAA6C,IAA7C,GAAoDC,KAApD,GAA4D,GAA5D,GAAkEtL,OAAO,SAASuL,KAAT,GAAiB,GAAxB,CAAlE,GAAiG,IAAxG,IAAgH,IAAhH,GAAuHK,aAAvH,GAAuI,GAAvI,GAA6IC,cAA7I,GAA8J,GAA9J,GAAoKC,cAApK,GAAqL,GAArL,GAA2LC,WAA3L,GAAyM,GAAhN,CAA1B,GAAiP/L,OAAO,SAASgM,MAAT,GAAkB,GAAzB,CAAjP,GAAiR,GAAjR,GAAuRhM,OAAO,SAASyL,SAAT,GAAqB,GAA5B,CAAvR,GAA0T,IA5D1U;QA6DCQ,gBAAgB,WAAWjM,OAAOA,OAAO,YAAYA,OAAO,MAAMqL,SAAN,GAAkB,IAAzB,CAAZ,GAA6C,IAA7C,GAAoDC,KAApD,GAA4D,GAA5D,GAAkEtL,OAAO,SAASuL,KAAT,GAAiB,GAAxB,CAAlE,GAAiG,IAAxG,IAAgH,IAAhH,GAAuHK,aAAvH,GAAuI,GAAvI,GAA6IC,cAA7I,GAA8J,GAA9J,GAAoKK,cAApK,GAAqL,GAArL,GAA2LH,WAA3L,GAAyM,GAAhN,CAAX,GAAkO/L,OAAO,SAASgM,MAAT,GAAkB,GAAzB,CAAlO,GAAkQ,GAAlQ,GAAwQhM,OAAO,SAASyL,SAAT,GAAqB,GAA5B,CAAxQ,GAA2S,IA7D5T;QA8DCC,gBAAgB,OAAOC,OAAP,GAAiB,MAAjB,GAA0B3L,OAAOA,OAAO,YAAYA,OAAO,MAAMqL,SAAN,GAAkB,IAAzB,CAAZ,GAA6C,IAA7C,GAAoDC,KAApD,GAA4D,GAA5D,GAAkEtL,OAAO,SAASuL,KAAT,GAAiB,GAAxB,CAAlE,GAAiG,IAAxG,IAAgH,IAAhH,GAAuHK,aAAvH,GAAuI,GAAvI,GAA6IC,cAA7I,GAA8J,GAA9J,GAAoKC,cAApK,GAAqL,GAArL,GAA2LC,WAA3L,GAAyM,GAAhN,CAA1B,GAAiP/L,OAAO,SAASgM,MAAT,GAAkB,GAAzB,CAAjP,GAAiR,IA9DlS;QA+DCR,eAAe,MAAMxL,OAAO,SAASyL,SAAT,GAAqB,GAA5B,CAAN,GAAyC,IA/DzD;QAgECL,iBAAiB,MAAMpL,OAAO,MAAMqL,SAAN,GAAkB,IAAzB,CAAN,GAAuC,IAAvC,GAA8CC,KAA9C,GAAsD,GAAtD,GAA4DtL,OAAO,SAASuL,KAAT,GAAiB,GAAxB,CAA5D,GAA2F,IAhE7G;WAmEO;oBACO,IAAI/L,MAAJ,CAAWC,MAAM,KAAN,EAAayL,OAAb,EAAsBC,OAAtB,EAA+B,aAA/B,CAAX,EAA0D,GAA1D,CADP;sBAES,IAAI3L,MAAJ,CAAWC,MAAM,WAAN,EAAmBC,YAAnB,EAAiCsL,YAAjC,CAAX,EAA2D,GAA3D,CAFT;kBAGK,IAAIxL,MAAJ,CAAWC,MAAM,iBAAN,EAAyBC,YAAzB,EAAuCsL,YAAvC,CAAX,EAAiE,GAAjE,CAHL;kBAIK,IAAIxL,MAAJ,CAAWC,MAAM,iBAAN,EAAyBC,YAAzB,EAAuCsL,YAAvC,CAAX,EAAiE,GAAjE,CAJL;2BAKc,IAAIxL,MAAJ,CAAWC,MAAM,cAAN,EAAsBC,YAAtB,EAAoCsL,YAApC,CAAX,EAA8D,GAA9D,CALd;mBAMM,IAAIxL,MAAJ,CAAWC,MAAM,QAAN,EAAgBC,YAAhB,EAA8BsL,YAA9B,EAA4C,gBAA5C,EAA8DC,UAA9D,CAAX,EAAsF,GAAtF,CANN;sBAOS,IAAIzL,MAAJ,CAAWC,MAAM,QAAN,EAAgBC,YAAhB,EAA8BsL,YAA9B,EAA4C,gBAA5C,CAAX,EAA0E,GAA1E,CAPT;gBAQG,IAAIxL,MAAJ,CAAWC,MAAM,KAAN,EAAaC,YAAb,EAA2BsL,YAA3B,CAAX,EAAqD,GAArD,CARH;oBASO,IAAIxL,MAAJ,CAAWE,YAAX,EAAyB,GAAzB,CATP;qBAUQ,IAAIF,MAAJ,CAAWC,MAAM,QAAN,EAAgBC,YAAhB,EAA8BqL,UAA9B,CAAX,EAAsD,GAAtD,CAVR;qBAWQ,IAAIvL,MAAJ,CAAWM,YAAX,EAAyB,GAAzB,CAXR;qBAYQ,IAAIN,MAAJ,CAAW,OAAOsL,YAAP,GAAsB,IAAjC,CAZR;qBAaQ,IAAItL,MAAJ,CAAW,WAAWoL,YAAX,GAA0B,GAA1B,GAAgC5K,OAAOA,OAAO,iBAAiBC,QAAjB,GAA4B,MAAnC,IAA6C,GAA7C,GAAmD4K,OAAnD,GAA6D,GAApE,CAAhC,GAA2G,QAAtH,CAbR;KAAP;;AAiBD,mBAAeF,UAAU,KAAV,CAAf;;ADrFA,mBAAeA,UAAU,IAAV,CAAf;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ADDA;;AACA,IAAMpC,SAAS,UAAf;;;AAGA,IAAMzG,OAAO,EAAb;AACA,IAAMsG,OAAO,CAAb;AACA,IAAMC,OAAO,EAAb;AACA,IAAMkB,OAAO,EAAb;AACA,IAAMG,OAAO,GAAb;AACA,IAAMf,cAAc,EAApB;AACA,IAAMC,WAAW,GAAjB;AACA,IAAMF,YAAY,GAAlB;;;AAGA,IAAMtB,gBAAgB,OAAtB;AACA,IAAMH,gBAAgB,YAAtB;AACA,IAAMoD,kBAAkB,2BAAxB;;;AAGA,IAAMG,SAAS;aACF,iDADE;cAED,gDAFC;kBAGG;CAHlB;;;AAOA,IAAMlB,gBAAgBxH,OAAOsG,IAA7B;AACA,IAAMN,QAAQ4C,KAAK5C,KAAnB;AACA,IAAMH,qBAAqBjJ,OAAO4H,YAAlC;;;;;;;;;;AAUA,SAAS7K,OAAT,CAAegP,IAAf,EAAqB;OACd,IAAIF,UAAJ,CAAeC,OAAOC,IAAP,CAAf,CAAN;;;;;;;;;;;AAWD,SAASnF,GAAT,CAAauE,KAAb,EAAoBO,EAApB,EAAwB;KACjBH,SAAS,EAAf;KACIrN,SAASiN,MAAMjN,MAAnB;QACOA,QAAP,EAAiB;SACTA,MAAP,IAAiBwN,GAAGP,MAAMjN,MAAN,CAAH,CAAjB;;QAEMqN,MAAP;;;;;;;;;;;;;AAaD,SAAS9C,SAAT,CAAmBD,MAAnB,EAA2BkD,EAA3B,EAA+B;KACxBE,QAAQpD,OAAOnI,KAAP,CAAa,GAAb,CAAd;KACIkL,SAAS,EAAb;KACIK,MAAM1N,MAAN,GAAe,CAAnB,EAAsB;;;WAGZ0N,MAAM,CAAN,IAAW,GAApB;WACSA,MAAM,CAAN,CAAT;;;UAGQpD,OAAOnK,OAAP,CAAesN,eAAf,EAAgC,MAAhC,CAAT;KACMF,SAASjD,OAAOnI,KAAP,CAAa,GAAb,CAAf;KACMmL,UAAU5E,IAAI6E,MAAJ,EAAYC,EAAZ,EAAgBzN,IAAhB,CAAqB,GAArB,CAAhB;QACOsN,SAASC,OAAhB;;;;;;;;;;;;;;;;AAgBD,SAASlD,UAAT,CAAoBE,MAApB,EAA4B;KACrBtE,SAAS,EAAf;KACIoH,UAAU,CAAd;KACMpN,SAASsK,OAAOtK,MAAtB;QACOoN,UAAUpN,MAAjB,EAAyB;MAClBkN,QAAQ5C,OAAON,UAAP,CAAkBoD,SAAlB,CAAd;MACIF,SAAS,MAAT,IAAmBA,SAAS,MAA5B,IAAsCE,UAAUpN,MAApD,EAA4D;;OAErDmN,QAAQ7C,OAAON,UAAP,CAAkBoD,SAAlB,CAAd;OACI,CAACD,QAAQ,MAAT,KAAoB,MAAxB,EAAgC;;WACxBlN,IAAP,CAAY,CAAC,CAACiN,QAAQ,KAAT,KAAmB,EAApB,KAA2BC,QAAQ,KAAnC,IAA4C,OAAxD;IADD,MAEO;;;WAGClN,IAAP,CAAYiN,KAAZ;;;GARF,MAWO;UACCjN,IAAP,CAAYiN,KAAZ;;;QAGKlH,MAAP;;;;;;;;;;;AAWD,IAAMmE,aAAa,SAAbA,UAAa;QAASrI,OAAOmK,aAAP,iCAAwBgB,KAAxB,EAAT;CAAnB;;;;;;;;;;;AAWA,IAAMV,eAAe,SAAfA,YAAe,CAASS,SAAT,EAAoB;KACpCA,YAAY,IAAZ,GAAmB,IAAvB,EAA6B;SACrBA,YAAY,IAAnB;;KAEGA,YAAY,IAAZ,GAAmB,IAAvB,EAA6B;SACrBA,YAAY,IAAnB;;KAEGA,YAAY,IAAZ,GAAmB,IAAvB,EAA6B;SACrBA,YAAY,IAAnB;;QAEM9H,IAAP;CAVD;;;;;;;;;;;;;AAwBA,IAAM8F,eAAe,SAAfA,YAAe,CAASsB,KAAT,EAAgBS,IAAhB,EAAsB;;;QAGnCT,QAAQ,EAAR,GAAa,MAAMA,QAAQ,EAAd,CAAb,IAAkC,CAACS,QAAQ,CAAT,KAAe,CAAjD,CAAP;CAHD;;;;;;;AAWA,IAAMnC,QAAQ,SAARA,KAAQ,CAASF,KAAT,EAAgBkC,SAAhB,EAA2BC,SAA3B,EAAsC;KAC/CvB,IAAI,CAAR;SACQuB,YAAY3B,MAAMR,QAAQoC,IAAd,CAAZ,GAAkCpC,SAAS,CAAnD;UACSQ,MAAMR,QAAQkC,SAAd,CAAT;+BAC8BlC,QAAQgC,gBAAgBjB,IAAhB,IAAwB,CAA9D,EAAiEH,KAAKpG,IAAtE,EAA4E;UACnEgG,MAAMR,QAAQgC,aAAd,CAAR;;QAEMxB,MAAMI,IAAI,CAACoB,gBAAgB,CAAjB,IAAsBhC,KAAtB,IAA+BA,QAAQiC,IAAvC,CAAV,CAAP;CAPD;;;;;;;;;AAiBA,IAAMzC,SAAS,SAATA,MAAS,CAAShE,KAAT,EAAgB;;KAExBF,SAAS,EAAf;KACM6F,cAAc3F,MAAMlG,MAA1B;KACIyJ,IAAI,CAAR;KACIgB,IAAIuB,QAAR;KACIT,OAAOQ,WAAX;;;;;;KAMIS,QAAQtG,MAAMrE,WAAN,CAAkBiK,SAAlB,CAAZ;KACIU,QAAQ,CAAZ,EAAe;UACN,CAAR;;;MAGI,IAAIC,IAAI,CAAb,EAAgBA,IAAID,KAApB,EAA2B,EAAEC,CAA7B,EAAgC;;MAE3BvG,MAAM8D,UAAN,CAAiByC,CAAjB,KAAuB,IAA3B,EAAiC;WAC1B,WAAN;;SAEMxM,IAAP,CAAYiG,MAAM8D,UAAN,CAAiByC,CAAjB,CAAZ;;;;;;MAMI,IAAIhF,QAAQ+E,QAAQ,CAAR,GAAYA,QAAQ,CAApB,GAAwB,CAAzC,EAA4C/E,QAAQoE,WAApD,4BAA4F;;;;;;;MAOvFO,OAAO3C,CAAX;OACK,IAAI4C,IAAI,CAAR,EAAWf,IAAIpG,IAApB,qBAA8CoG,KAAKpG,IAAnD,EAAyD;;OAEpDuC,SAASoE,WAAb,EAA0B;YACnB,eAAN;;;OAGKS,QAAQC,aAAarG,MAAM8D,UAAN,CAAiBvC,OAAjB,CAAb,CAAd;;OAEI6E,SAASpH,IAAT,IAAiBoH,QAAQpB,MAAM,CAACS,SAASlC,CAAV,IAAe4C,CAArB,CAA7B,EAAsD;YAC/C,UAAN;;;QAGIC,QAAQD,CAAb;OACMhB,IAAIC,KAAKC,IAAL,GAAYC,IAAZ,GAAoBF,KAAKC,OAAOE,IAAZ,GAAmBA,IAAnB,GAA0BH,IAAIC,IAA5D;;OAEIe,QAAQjB,CAAZ,EAAe;;;;OAITD,aAAalG,OAAOmG,CAA1B;OACIgB,IAAInB,MAAMS,SAASP,UAAf,CAAR,EAAoC;YAC7B,UAAN;;;QAGIA,UAAL;;;MAIKe,MAAMnG,OAAOhG,MAAP,GAAgB,CAA5B;SACO4K,MAAMnB,IAAI2C,IAAV,EAAgBD,GAAhB,EAAqBC,QAAQ,CAA7B,CAAP;;;;MAIIlB,MAAMzB,IAAI0C,GAAV,IAAiBR,SAASlB,CAA9B,EAAiC;WAC1B,UAAN;;;OAGIS,MAAMzB,IAAI0C,GAAV,CAAL;OACKA,GAAL;;;SAGOD,MAAP,CAAczC,GAAd,EAAmB,CAAnB,EAAsBgB,CAAtB;;;QAIM3I,OAAOmK,aAAP,eAAwBjG,MAAxB,CAAP;CAjFD;;;;;;;;;AA2FA,IAAMiE,SAAS,SAATA,MAAS,CAAS/D,KAAT,EAAgB;KACxBF,SAAS,EAAf;;;SAGQoE,WAAWlE,KAAX,CAAR;;;KAGI2F,cAAc3F,MAAMlG,MAAxB;;;KAGIyK,IAAIuB,QAAR;KACItB,QAAQ,CAAZ;KACIa,OAAOQ,WAAX;;;;;;;;uBAG2B7F,KAA3B,8HAAkC;OAAvBwF,cAAuB;;OAC7BA,iBAAe,IAAnB,EAAyB;WACjBzL,IAAP,CAAY8K,mBAAmBW,cAAnB,CAAZ;;;;;;;;;;;;;;;;;;KAIEZ,cAAc9E,OAAOhG,MAAzB;KACI2K,iBAAiBG,WAArB;;;;;;KAMIA,WAAJ,EAAiB;SACT7K,IAAP,CAAY6L,SAAZ;;;;QAIMnB,iBAAiBkB,WAAxB,EAAqC;;;;MAIhCD,IAAID,MAAR;;;;;;yBAC2BzF,KAA3B,mIAAkC;QAAvBwF,YAAuB;;QAC7BA,gBAAgBjB,CAAhB,IAAqBiB,eAAeE,CAAxC,EAA2C;SACtCF,YAAJ;;;;;;;;;;;;;;;;;;;;;MAMIb,wBAAwBF,iBAAiB,CAA/C;MACIiB,IAAInB,CAAJ,GAAQS,MAAM,CAACS,SAASjB,KAAV,IAAmBG,qBAAzB,CAAZ,EAA6D;WACtD,UAAN;;;WAGQ,CAACe,IAAInB,CAAL,IAAUI,qBAAnB;MACIe,CAAJ;;;;;;;yBAE2B1F,KAA3B,mIAAkC;QAAvBwF,aAAuB;;QAC7BA,gBAAejB,CAAf,IAAoB,EAAEC,KAAF,GAAUiB,MAAlC,EAA0C;aACnC,UAAN;;QAEGD,iBAAgBjB,CAApB,EAAuB;;SAElBQ,IAAIP,KAAR;UACK,IAAIY,IAAIpG,IAAb,qBAAuCoG,KAAKpG,IAA5C,EAAkD;UAC3CmG,IAAIC,KAAKC,IAAL,GAAYC,IAAZ,GAAoBF,KAAKC,OAAOE,IAAZ,GAAmBA,IAAnB,GAA0BH,IAAIC,IAA5D;UACIN,IAAII,CAAR,EAAW;;;UAGLF,UAAUF,IAAII,CAApB;UACMD,aAAalG,OAAOmG,CAA1B;aACOpL,IAAP,CACC8K,mBAAmBC,aAAaK,IAAIF,UAAUC,UAA3B,EAAuC,CAAvC,CAAnB,CADD;UAGIF,MAAMC,UAAUC,UAAhB,CAAJ;;;YAGMnL,IAAP,CAAY8K,mBAAmBC,aAAaC,CAAb,EAAgB,CAAhB,CAAnB,CAAZ;YACOL,MAAMF,KAAN,EAAaG,qBAAb,EAAoCF,kBAAkBG,WAAtD,CAAP;aACQ,CAAR;OACEH,cAAF;;;;;;;;;;;;;;;;;;IAIAD,KAAF;IACED,CAAF;;QAGMzE,OAAOjG,IAAP,CAAY,EAAZ,CAAP;CArFD;;;;;;;;;;;;;AAmGA,IAAMyB,YAAY,SAAZA,SAAY,CAAS0E,KAAT,EAAgB;QAC1BqE,UAAUrE,KAAV,EAAiB,UAASoE,MAAT,EAAiB;SACjCE,cAAczE,IAAd,CAAmBuE,MAAnB,IACJJ,OAAOI,OAAO5I,KAAP,CAAa,CAAb,EAAgB/C,WAAhB,EAAP,CADI,GAEJ2L,MAFH;EADM,CAAP;CADD;;;;;;;;;;;;;AAmBA,IAAMhJ,UAAU,SAAVA,OAAU,CAAS4E,KAAT,EAAgB;QACxBqE,UAAUrE,KAAV,EAAiB,UAASoE,MAAT,EAAiB;SACjCD,cAActE,IAAd,CAAmBuE,MAAnB,IACJ,SAASL,OAAOK,MAAP,CADL,GAEJA,MAFH;EADM,CAAP;CADD;;;;;AAWA,IAAMjJ,WAAW;;;;;;YAML,OANK;;;;;;;;SAcR;YACG+I,UADH;YAEGD;EAhBK;WAkBND,MAlBM;WAmBND,MAnBM;YAoBL3I,OApBK;cAqBHE;CArBd,CAwBA;;ADvbA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,AACA,AACA,AACA,AAiDA,AAAO,IAAMzD,UAA6C,EAAnD;AAEP,AAAA,SAAAyC,UAAA,CAA2BuJ,GAA3B,EAAA;QACOJ,IAAII,IAAIC,UAAJ,CAAe,CAAf,CAAV;QACI5I,UAAJ;QAEIuI,IAAI,EAAR,EAAYvI,IAAI,OAAOuI,EAAE5F,QAAF,CAAW,EAAX,EAAezD,WAAf,EAAX,CAAZ,KACK,IAAIqJ,IAAI,GAAR,EAAavI,IAAI,MAAMuI,EAAE5F,QAAF,CAAW,EAAX,EAAezD,WAAf,EAAV,CAAb,KACA,IAAIqJ,IAAI,IAAR,EAAcvI,IAAI,MAAM,CAAEuI,KAAK,CAAN,GAAW,GAAZ,EAAiB5F,QAAjB,CAA0B,EAA1B,EAA8BzD,WAA9B,EAAN,GAAoD,GAApD,GAA0D,CAAEqJ,IAAI,EAAL,GAAW,GAAZ,EAAiB5F,QAAjB,CAA0B,EAA1B,EAA8BzD,WAA9B,EAA9D,CAAd,KACAc,IAAI,MAAM,CAAEuI,KAAK,EAAN,GAAY,GAAb,EAAkB5F,QAAlB,CAA2B,EAA3B,EAA+BzD,WAA/B,EAAN,GAAqD,GAArD,GAA2D,CAAGqJ,KAAK,CAAN,GAAW,EAAZ,GAAkB,GAAnB,EAAwB5F,QAAxB,CAAiC,EAAjC,EAAqCzD,WAArC,EAA3D,GAAgH,GAAhH,GAAsH,CAAEqJ,IAAI,EAAL,GAAW,GAAZ,EAAiB5F,QAAjB,CAA0B,EAA1B,EAA8BzD,WAA9B,EAA1H;WAEEc,CAAP;;AAGD,AAAA,SAAAuB,WAAA,CAA4BD,GAA5B,EAAA;QACK6G,SAAS,EAAb;QACIE,IAAI,CAAR;QACMK,KAAKpH,IAAI1C,MAAf;WAEOyJ,IAAIK,EAAX,EAAe;YACRH,IAAI1C,SAASvE,IAAI8G,MAAJ,CAAWC,IAAI,CAAf,EAAkB,CAAlB,CAAT,EAA+B,EAA/B,CAAV;YAEIE,IAAI,GAAR,EAAa;sBACF7H,OAAO4H,YAAP,CAAoBC,CAApB,CAAV;iBACK,CAAL;SAFD,MAIK,IAAIA,KAAK,GAAL,IAAYA,IAAI,GAApB,EAAyB;gBACxBG,KAAKL,CAAN,IAAY,CAAhB,EAAmB;oBACZG,KAAK3C,SAASvE,IAAI8G,MAAJ,CAAWC,IAAI,CAAf,EAAkB,CAAlB,CAAT,EAA+B,EAA/B,CAAX;0BACU3H,OAAO4H,YAAP,CAAqB,CAACC,IAAI,EAAL,KAAY,CAAb,GAAmBC,KAAK,EAA5C,CAAV;aAFD,MAGO;0BACIlH,IAAI8G,MAAJ,CAAWC,CAAX,EAAc,CAAd,CAAV;;iBAEI,CAAL;SAPI,MASA,IAAIE,KAAK,GAAT,EAAc;gBACbG,KAAKL,CAAN,IAAY,CAAhB,EAAmB;oBACZG,KAAK3C,SAASvE,IAAI8G,MAAJ,CAAWC,IAAI,CAAf,EAAkB,CAAlB,CAAT,EAA+B,EAA/B,CAAX;oBACMI,KAAK5C,SAASvE,IAAI8G,MAAJ,CAAWC,IAAI,CAAf,EAAkB,CAAlB,CAAT,EAA+B,EAA/B,CAAX;0BACU3H,OAAO4H,YAAP,CAAqB,CAACC,IAAI,EAAL,KAAY,EAAb,GAAoB,CAACC,KAAK,EAAN,KAAa,CAAjC,GAAuCC,KAAK,EAAhE,CAAV;aAHD,MAIO;0BACInH,IAAI8G,MAAJ,CAAWC,CAAX,EAAc,CAAd,CAAV;;iBAEI,CAAL;SARI,MAUA;sBACM/G,IAAI8G,MAAJ,CAAWC,CAAX,EAAc,CAAd,CAAV;iBACK,CAAL;;;WAIKF,MAAP;;AAGD,SAAAD,2BAAA,CAAqC3J,UAArC,EAA+DkG,QAA/D,EAAA;aACAxF,gBAAC,CAA0BqC,GAA1B,EAAD;YACQF,SAASG,YAAYD,GAAZ,CAAf;eACQ,CAACF,OAAOzD,KAAP,CAAa8G,SAASpD,UAAtB,CAAD,GAAqCC,GAArC,GAA2CF,MAAnD;;QAGG7C,WAAW1B,MAAf,EAAuB0B,WAAW1B,MAAX,GAAoB6D,OAAOnC,WAAW1B,MAAlB,EAA0BkC,OAA1B,CAAkC0F,SAASzF,WAA3C,EAAwDC,gBAAxD,EAA0E1B,WAA1E,GAAwFwB,OAAxF,CAAgG0F,SAASwD,UAAzG,EAAqH,EAArH,CAApB;QACnB1J,WAAWwF,QAAX,KAAwBlG,SAA5B,EAAuCU,WAAWwF,QAAX,GAAsBrD,OAAOnC,WAAWwF,QAAlB,EAA4BhF,OAA5B,CAAoC0F,SAASzF,WAA7C,EAA0DC,gBAA1D,EAA4EF,OAA5E,CAAoF0F,SAASuD,YAA7F,EAA2G5I,UAA3G,EAAuHL,OAAvH,CAA+H0F,SAASzF,WAAxI,EAAqJE,WAArJ,CAAtB;QACnCX,WAAWmE,IAAX,KAAoB7E,SAAxB,EAAmCU,WAAWmE,IAAX,GAAkBhC,OAAOnC,WAAWmE,IAAlB,EAAwB3D,OAAxB,CAAgC0F,SAASzF,WAAzC,EAAsDC,gBAAtD,EAAwE1B,WAAxE,GAAsFwB,OAAtF,CAA8F0F,SAASsD,QAAvG,EAAiH3I,UAAjH,EAA6HL,OAA7H,CAAqI0F,SAASzF,WAA9I,EAA2JE,WAA3J,CAAlB;QAC/BX,WAAWP,IAAX,KAAoBH,SAAxB,EAAmCU,WAAWP,IAAX,GAAkB0C,OAAOnC,WAAWP,IAAlB,EAAwBe,OAAxB,CAAgC0F,SAASzF,WAAzC,EAAsDC,gBAAtD,EAAwEF,OAAxE,CAAiFR,WAAW1B,MAAX,GAAoB4H,SAASoD,QAA7B,GAAwCpD,SAASqD,iBAAlI,EAAsJ1I,UAAtJ,EAAkKL,OAAlK,CAA0K0F,SAASzF,WAAnL,EAAgME,WAAhM,CAAlB;QAC/BX,WAAWE,KAAX,KAAqBZ,SAAzB,EAAoCU,WAAWE,KAAX,GAAmBiC,OAAOnC,WAAWE,KAAlB,EAAyBM,OAAzB,CAAiC0F,SAASzF,WAA1C,EAAuDC,gBAAvD,EAAyEF,OAAzE,CAAiF0F,SAASmD,SAA1F,EAAqGxI,UAArG,EAAiHL,OAAjH,CAAyH0F,SAASzF,WAAlI,EAA+IE,WAA/I,CAAnB;QAChCX,WAAW8D,QAAX,KAAwBxE,SAA5B,EAAuCU,WAAW8D,QAAX,GAAsB3B,OAAOnC,WAAW8D,QAAlB,EAA4BtD,OAA5B,CAAoC0F,SAASzF,WAA7C,EAA0DC,gBAA1D,EAA4EF,OAA5E,CAAoF0F,SAASkD,YAA7F,EAA2GvI,UAA3G,EAAuHL,OAAvH,CAA+H0F,SAASzF,WAAxI,EAAqJE,WAArJ,CAAtB;WAEhCX,UAAP;;AACA;AAED,SAAAgJ,kBAAA,CAA4BjG,GAA5B,EAAA;WACQA,IAAIvC,OAAJ,CAAY,SAAZ,EAAuB,IAAvB,KAAgC,GAAvC;;AAGD,SAAAyG,cAAA,CAAwB9C,IAAxB,EAAqC+B,QAArC,EAAA;QACOnG,UAAUoE,KAAK/E,KAAL,CAAW8G,SAAS2C,WAApB,KAAoC,EAApD;;iCACoB9I,OAFrB;QAEUmJ,OAFV;;QAIKA,OAAJ,EAAa;eACLA,QAAQ1G,KAAR,CAAc,GAAd,EAAmBuG,GAAnB,CAAuBC,kBAAvB,EAA2C5I,IAA3C,CAAgD,GAAhD,CAAP;KADD,MAEO;eACC+D,IAAP;;;AAIF,SAAA6C,cAAA,CAAwB7C,IAAxB,EAAqC+B,QAArC,EAAA;QACOnG,UAAUoE,KAAK/E,KAAL,CAAW8G,SAASC,WAApB,KAAoC,EAApD;;kCAC0BpG,OAF3B;QAEUmJ,OAFV;QAEmBxB,IAFnB;;QAIKwB,OAAJ,EAAa;oCACUA,QAAQlK,WAAR,GAAsBwD,KAAtB,CAA4B,IAA5B,EAAkC2G,OAAlC,EADV;;YACLL,IADK;YACCG,KADD;;YAENR,cAAcQ,QAAQA,MAAMzG,KAAN,CAAY,GAAZ,EAAiBuG,GAAjB,CAAqBC,kBAArB,CAAR,GAAmD,EAAvE;YACMN,aAAaI,KAAKtG,KAAL,CAAW,GAAX,EAAgBuG,GAAhB,CAAoBC,kBAApB,CAAnB;YACMR,yBAAyBtC,SAAS2C,WAAT,CAAqBzC,IAArB,CAA0BsC,WAAWA,WAAWrI,MAAX,GAAoB,CAA/B,CAA1B,CAA/B;YACMkI,aAAaC,yBAAyB,CAAzB,GAA6B,CAAhD;YACMG,kBAAkBD,WAAWrI,MAAX,GAAoBkI,UAA5C;YACMpI,SAASyI,MAAcL,UAAd,CAAf;aAEK,IAAIlH,IAAI,CAAb,EAAgBA,IAAIkH,UAApB,EAAgC,EAAElH,CAAlC,EAAqC;mBAC7BA,CAAP,IAAYoH,YAAYpH,CAAZ,KAAkBqH,WAAWC,kBAAkBtH,CAA7B,CAAlB,IAAqD,EAAjE;;YAGGmH,sBAAJ,EAA4B;mBACpBD,aAAa,CAApB,IAAyBtB,eAAe9G,OAAOoI,aAAa,CAApB,CAAf,EAAuCrC,QAAvC,CAAzB;;YAGK+B,gBAAgB9H,OAAOmI,MAAP,CAAmD,UAACH,GAAD,EAAME,KAAN,EAAaP,KAAb,EAA3E;gBACO,CAACO,KAAD,IAAUA,UAAU,GAAxB,EAA6B;oBACtBD,cAAcD,IAAIA,IAAI9H,MAAJ,GAAa,CAAjB,CAApB;oBACI+H,eAAeA,YAAYN,KAAZ,GAAoBM,YAAY/H,MAAhC,KAA2CyH,KAA9D,EAAqE;gCACxDzH,MAAZ;iBADD,MAEO;wBACFC,IAAJ,CAAS,EAAEwH,YAAF,EAASzH,QAAS,CAAlB,EAAT;;;mBAGK8H,GAAP;SATqB,EAUnB,EAVmB,CAAtB;YAYMN,oBAAoBI,cAAcC,IAAd,CAAmB,UAACF,CAAD,EAAID,CAAJ;mBAAUA,EAAE1H,MAAF,GAAW2H,EAAE3H,MAAvB;SAAnB,EAAkD,CAAlD,CAA1B;YAEIoH,gBAAJ;YACII,qBAAqBA,kBAAkBxH,MAAlB,GAA2B,CAApD,EAAuD;gBAChDsH,WAAWxH,OAAO4B,KAAP,CAAa,CAAb,EAAgB8F,kBAAkBC,KAAlC,CAAjB;gBACMF,UAAUzH,OAAO4B,KAAP,CAAa8F,kBAAkBC,KAAlB,GAA0BD,kBAAkBxH,MAAzD,CAAhB;sBACUsH,SAASvH,IAAT,CAAc,GAAd,IAAqB,IAArB,GAA4BwH,QAAQxH,IAAR,CAAa,GAAb,CAAtC;SAHD,MAIO;sBACID,OAAOC,IAAP,CAAY,GAAZ,CAAV;;YAGGsH,IAAJ,EAAU;uBACE,MAAMA,IAAjB;;eAGMD,OAAP;KA5CD,MA6CO;eACCtD,IAAP;;;AAIF,IAAMqD,YAAY,iIAAlB;AACA,IAAMD,wBAA4C,EAAD,CAAKnI,KAAL,CAAW,OAAX,EAAqB,CAArB,MAA4BE,SAA7E;AAEA,AAAA,SAAAQ,KAAA,CAAsBqH,SAAtB,EAAA;QAAwClI,OAAxC,uEAA6D,EAA7D;;QACOe,aAA2B,EAAjC;QACMkG,WAAYjH,QAAQuC,GAAR,KAAgB,KAAhB,GAAwB8C,YAAxB,GAAuCD,YAAzD;QAEIpF,QAAQ+G,SAAR,KAAsB,QAA1B,EAAoCmB,YAAY,CAAClI,QAAQX,MAAR,GAAiBW,QAAQX,MAAR,GAAiB,GAAlC,GAAwC,EAAzC,IAA+C,IAA/C,GAAsD6I,SAAlE;QAE9BpH,UAAUoH,UAAU/H,KAAV,CAAgBoI,SAAhB,CAAhB;QAEIzH,OAAJ,EAAa;YACRwH,qBAAJ,EAA2B;;uBAEfjJ,MAAX,GAAoByB,QAAQ,CAAR,CAApB;uBACWyF,QAAX,GAAsBzF,QAAQ,CAAR,CAAtB;uBACWoE,IAAX,GAAkBpE,QAAQ,CAAR,CAAlB;uBACWkE,IAAX,GAAkBqD,SAASvH,QAAQ,CAAR,CAAT,EAAqB,EAArB,CAAlB;uBACWN,IAAX,GAAkBM,QAAQ,CAAR,KAAc,EAAhC;uBACWG,KAAX,GAAmBH,QAAQ,CAAR,CAAnB;uBACW+D,QAAX,GAAsB/D,QAAQ,CAAR,CAAtB;;gBAGIqH,MAAMpH,WAAWiE,IAAjB,CAAJ,EAA4B;2BAChBA,IAAX,GAAkBlE,QAAQ,CAAR,CAAlB;;SAZF,MAcO;;;uBAEKzB,MAAX,GAAoByB,QAAQ,CAAR,KAAcT,SAAlC;uBACWkG,QAAX,GAAuB2B,UAAUE,OAAV,CAAkB,GAAlB,MAA2B,CAAC,CAA5B,GAAgCtH,QAAQ,CAAR,CAAhC,GAA6CT,SAApE;uBACW6E,IAAX,GAAmBgD,UAAUE,OAAV,CAAkB,IAAlB,MAA4B,CAAC,CAA7B,GAAiCtH,QAAQ,CAAR,CAAjC,GAA8CT,SAAjE;uBACW2E,IAAX,GAAkBqD,SAASvH,QAAQ,CAAR,CAAT,EAAqB,EAArB,CAAlB;uBACWN,IAAX,GAAkBM,QAAQ,CAAR,KAAc,EAAhC;uBACWG,KAAX,GAAoBiH,UAAUE,OAAV,CAAkB,GAAlB,MAA2B,CAAC,CAA5B,GAAgCtH,QAAQ,CAAR,CAAhC,GAA6CT,SAAjE;uBACWwE,QAAX,GAAuBqD,UAAUE,OAAV,CAAkB,GAAlB,MAA2B,CAAC,CAA5B,GAAgCtH,QAAQ,CAAR,CAAhC,GAA6CT,SAApE;;gBAGI8H,MAAMpH,WAAWiE,IAAjB,CAAJ,EAA4B;2BAChBA,IAAX,GAAmBkD,UAAU/H,KAAV,CAAgB,+BAAhB,IAAmDW,QAAQ,CAAR,CAAnD,GAAgET,SAAnF;;;YAIEU,WAAWmE,IAAf,EAAqB;;uBAETA,IAAX,GAAkB6C,eAAeC,eAAejH,WAAWmE,IAA1B,EAAgC+B,QAAhC,CAAf,EAA0DA,QAA1D,CAAlB;;;YAIGlG,WAAW1B,MAAX,KAAsBgB,SAAtB,IAAmCU,WAAWwF,QAAX,KAAwBlG,SAA3D,IAAwEU,WAAWmE,IAAX,KAAoB7E,SAA5F,IAAyGU,WAAWiE,IAAX,KAAoB3E,SAA7H,IAA0I,CAACU,WAAWP,IAAtJ,IAA8JO,WAAWE,KAAX,KAAqBZ,SAAvL,EAAkM;uBACtL0G,SAAX,GAAuB,eAAvB;SADD,MAEO,IAAIhG,WAAW1B,MAAX,KAAsBgB,SAA1B,EAAqC;uBAChC0G,SAAX,GAAuB,UAAvB;SADM,MAEA,IAAIhG,WAAW8D,QAAX,KAAwBxE,SAA5B,EAAuC;uBAClC0G,SAAX,GAAuB,UAAvB;SADM,MAEA;uBACKA,SAAX,GAAuB,KAAvB;;;YAIG/G,QAAQ+G,SAAR,IAAqB/G,QAAQ+G,SAAR,KAAsB,QAA3C,IAAuD/G,QAAQ+G,SAAR,KAAsBhG,WAAWgG,SAA5F,EAAuG;uBAC3F9G,KAAX,GAAmBc,WAAWd,KAAX,IAAoB,kBAAkBD,QAAQ+G,SAA1B,GAAsC,aAA7E;;;YAIKrG,gBAAgBvB,QAAQ,CAACa,QAAQX,MAAR,IAAkB0B,WAAW1B,MAA7B,IAAuC,EAAxC,EAA4CU,WAA5C,EAAR,CAAtB;;YAGI,CAACC,QAAQsD,cAAT,KAA4B,CAAC5C,aAAD,IAAkB,CAACA,cAAc4C,cAA7D,CAAJ,EAAkF;;gBAE7EvC,WAAWmE,IAAX,KAAoBlF,QAAQ2E,UAAR,IAAuBjE,iBAAiBA,cAAciE,UAA1E,CAAJ,EAA4F;;oBAEvF;+BACQO,IAAX,GAAkBzC,SAASC,OAAT,CAAiB3B,WAAWmE,IAAX,CAAgB3D,OAAhB,CAAwB0F,SAASzF,WAAjC,EAA8CuC,WAA9C,EAA2DhE,WAA3D,EAAjB,CAAlB;iBADD,CAEE,OAAOyC,CAAP,EAAU;+BACAvC,KAAX,GAAmBc,WAAWd,KAAX,IAAoB,oEAAoEuC,CAA3G;;;;wCAI0BzB,UAA5B,EAAwCqE,YAAxC;SAXD,MAYO;;wCAEsBrE,UAA5B,EAAwCkG,QAAxC;;;YAIGvG,iBAAiBA,cAAcG,KAAnC,EAA0C;0BAC3BA,KAAd,CAAoBE,UAApB,EAAgCf,OAAhC;;KA3EF,MA6EO;mBACKC,KAAX,GAAmBc,WAAWd,KAAX,IAAoB,wBAAvC;;WAGMc,UAAP;;AACA;AAED,SAAAiG,mBAAA,CAA6BjG,UAA7B,EAAuDf,OAAvD,EAAA;QACOiH,WAAYjH,QAAQuC,GAAR,KAAgB,KAAhB,GAAwB8C,YAAxB,GAAuCD,YAAzD;QACMuB,YAA0B,EAAhC;QAEI5F,WAAWwF,QAAX,KAAwBlG,SAA5B,EAAuC;kBAC5BgB,IAAV,CAAeN,WAAWwF,QAA1B;kBACUlF,IAAV,CAAe,GAAf;;QAGGN,WAAWmE,IAAX,KAAoB7E,SAAxB,EAAmC;;kBAExBgB,IAAV,CAAe0G,eAAeC,eAAe9E,OAAOnC,WAAWmE,IAAlB,CAAf,EAAwC+B,QAAxC,CAAf,EAAkEA,QAAlE,EAA4E1F,OAA5E,CAAoF0F,SAASC,WAA7F,EAA0G,UAACe,CAAD,EAAIJ,EAAJ,EAAQC,EAAR;mBAAe,MAAMD,EAAN,IAAYC,KAAK,QAAQA,EAAb,GAAkB,EAA9B,IAAoC,GAAnD;SAA1G,CAAf;;QAGG,OAAO/G,WAAWiE,IAAlB,KAA2B,QAA3B,IAAuC,OAAOjE,WAAWiE,IAAlB,KAA2B,QAAtE,EAAgF;kBACrE3D,IAAV,CAAe,GAAf;kBACUA,IAAV,CAAe6B,OAAOnC,WAAWiE,IAAlB,CAAf;;WAGM2B,UAAUvF,MAAV,GAAmBuF,UAAUxF,IAAV,CAAe,EAAf,CAAnB,GAAwCd,SAA/C;;AACA;AAED,IAAMuH,OAAO,UAAb;AACA,IAAMD,OAAO,aAAb;AACA,IAAMD,OAAO,eAAb;AACA,AACA,IAAMF,OAAO,wBAAb;AAEA,AAAA,SAAAhB,iBAAA,CAAkCc,KAAlC,EAAA;QACOF,SAAuB,EAA7B;WAEOE,MAAMlG,MAAb,EAAqB;YAChBkG,MAAMnH,KAAN,CAAYyH,IAAZ,CAAJ,EAAuB;oBACdN,MAAM/F,OAAN,CAAcqG,IAAd,EAAoB,EAApB,CAAR;SADD,MAEO,IAAIN,MAAMnH,KAAN,CAAYwH,IAAZ,CAAJ,EAAuB;oBACrBL,MAAM/F,OAAN,CAAcoG,IAAd,EAAoB,GAApB,CAAR;SADM,MAEA,IAAIL,MAAMnH,KAAN,CAAYuH,IAAZ,CAAJ,EAAuB;oBACrBJ,MAAM/F,OAAN,CAAcmG,IAAd,EAAoB,GAApB,CAAR;mBACOD,GAAP;SAFM,MAGA,IAAIH,UAAU,GAAV,IAAiBA,UAAU,IAA/B,EAAqC;oBACnC,EAAR;SADM,MAEA;gBACAC,KAAKD,MAAMnH,KAAN,CAAYqH,IAAZ,CAAX;gBACID,EAAJ,EAAQ;oBACDX,IAAIW,GAAG,CAAH,CAAV;wBACQD,MAAMxE,KAAN,CAAY8D,EAAExF,MAAd,CAAR;uBACOC,IAAP,CAAYuF,CAAZ;aAHD,MAIO;sBACA,IAAIS,KAAJ,CAAU,kCAAV,CAAN;;;;WAKID,OAAOjG,IAAP,CAAY,EAAZ,CAAP;;AACA;AAED,AAAA,SAAAR,SAAA,CAA0BI,UAA1B,EAAA;QAAoDf,OAApD,uEAAyE,EAAzE;;QACOiH,WAAYjH,QAAQuC,GAAR,GAAc8C,YAAd,GAA6BD,YAA/C;QACMuB,YAA0B,EAAhC;;QAGMjG,gBAAgBvB,QAAQ,CAACa,QAAQX,MAAR,IAAkB0B,WAAW1B,MAA7B,IAAuC,EAAxC,EAA4CU,WAA5C,EAAR,CAAtB;;QAGIW,iBAAiBA,cAAcC,SAAnC,EAA8CD,cAAcC,SAAd,CAAwBI,UAAxB,EAAoCf,OAApC;QAE1Ce,WAAWmE,IAAf,EAAqB;;YAEhB+B,SAASC,WAAT,CAAqBC,IAArB,CAA0BpG,WAAWmE,IAArC,CAAJ,EAAgD;;;;aAK3C,IAAIlF,QAAQ2E,UAAR,IAAuBjE,iBAAiBA,cAAciE,UAA1D,EAAuE;;oBAEvE;+BACQO,IAAX,GAAmB,CAAClF,QAAQuC,GAAT,GAAeE,SAASC,OAAT,CAAiB3B,WAAWmE,IAAX,CAAgB3D,OAAhB,CAAwB0F,SAASzF,WAAjC,EAA8CuC,WAA9C,EAA2DhE,WAA3D,EAAjB,CAAf,GAA4G0C,SAASG,SAAT,CAAmB7B,WAAWmE,IAA9B,CAA/H;iBADD,CAEE,OAAO1C,CAAP,EAAU;+BACAvC,KAAX,GAAmBc,WAAWd,KAAX,IAAoB,iDAAiD,CAACD,QAAQuC,GAAT,GAAe,OAAf,GAAyB,SAA1E,IAAuF,iBAAvF,GAA2GC,CAAlJ;;;;;gCAMyBzB,UAA5B,EAAwCkG,QAAxC;QAEIjH,QAAQ+G,SAAR,KAAsB,QAAtB,IAAkChG,WAAW1B,MAAjD,EAAyD;kBAC9CgC,IAAV,CAAeN,WAAW1B,MAA1B;kBACUgC,IAAV,CAAe,GAAf;;QAGKwF,YAAYG,oBAAoBjG,UAApB,EAAgCf,OAAhC,CAAlB;QACI6G,cAAcxG,SAAlB,EAA6B;YACxBL,QAAQ+G,SAAR,KAAsB,QAA1B,EAAoC;sBACzB1F,IAAV,CAAe,IAAf;;kBAGSA,IAAV,CAAewF,SAAf;YAEI9F,WAAWP,IAAX,IAAmBO,WAAWP,IAAX,CAAgBiG,MAAhB,CAAuB,CAAvB,MAA8B,GAArD,EAA0D;sBAC/CpF,IAAV,CAAe,GAAf;;;QAIEN,WAAWP,IAAX,KAAoBH,SAAxB,EAAmC;YAC9BuG,IAAI7F,WAAWP,IAAnB;YAEI,CAACR,QAAQ8G,YAAT,KAA0B,CAACpG,aAAD,IAAkB,CAACA,cAAcoG,YAA3D,CAAJ,EAA8E;gBACzEN,kBAAkBI,CAAlB,CAAJ;;YAGGC,cAAcxG,SAAlB,EAA6B;gBACxBuG,EAAErF,OAAF,CAAU,OAAV,EAAmB,MAAnB,CAAJ,CAD4B;;kBAInBF,IAAV,CAAeuF,CAAf;;QAGG7F,WAAWE,KAAX,KAAqBZ,SAAzB,EAAoC;kBACzBgB,IAAV,CAAe,GAAf;kBACUA,IAAV,CAAeN,WAAWE,KAA1B;;QAGGF,WAAW8D,QAAX,KAAwBxE,SAA5B,EAAuC;kBAC5BgB,IAAV,CAAe,GAAf;kBACUA,IAAV,CAAeN,WAAW8D,QAA1B;;WAGM8B,UAAUxF,IAAV,CAAe,EAAf,CAAP,CAxED;;AAyEC;AAED,AAAA,SAAA2E,iBAAA,CAAkCQ,IAAlC,EAAsDD,QAAtD,EAAA;QAA8ErG,OAA9E,uEAAmG,EAAnG;QAAuG0G,iBAAvG;;QACON,SAAuB,EAA7B;QAEI,CAACM,iBAAL,EAAwB;eAChB7F,MAAMF,UAAU2F,IAAV,EAAgBtG,OAAhB,CAAN,EAAgCA,OAAhC,CAAP,CADuB;mBAEZa,MAAMF,UAAU0F,QAAV,EAAoBrG,OAApB,CAAN,EAAoCA,OAApC,CAAX,CAFuB;;cAIdA,WAAW,EAArB;QAEI,CAACA,QAAQE,QAAT,IAAqBmG,SAAShH,MAAlC,EAA0C;eAClCA,MAAP,GAAgBgH,SAAShH,MAAzB;;eAEOkH,QAAP,GAAkBF,SAASE,QAA3B;eACOrB,IAAP,GAAcmB,SAASnB,IAAvB;eACOF,IAAP,GAAcqB,SAASrB,IAAvB;eACOxE,IAAP,GAAcgG,kBAAkBH,SAAS7F,IAAT,IAAiB,EAAnC,CAAd;eACOS,KAAP,GAAeoF,SAASpF,KAAxB;KAPD,MAQO;YACFoF,SAASE,QAAT,KAAsBlG,SAAtB,IAAmCgG,SAASnB,IAAT,KAAkB7E,SAArD,IAAkEgG,SAASrB,IAAT,KAAkB3E,SAAxF,EAAmG;;mBAE3FkG,QAAP,GAAkBF,SAASE,QAA3B;mBACOrB,IAAP,GAAcmB,SAASnB,IAAvB;mBACOF,IAAP,GAAcqB,SAASrB,IAAvB;mBACOxE,IAAP,GAAcgG,kBAAkBH,SAAS7F,IAAT,IAAiB,EAAnC,CAAd;mBACOS,KAAP,GAAeoF,SAASpF,KAAxB;SAND,MAOO;gBACF,CAACoF,SAAS7F,IAAd,EAAoB;uBACZA,IAAP,GAAc8F,KAAK9F,IAAnB;oBACI6F,SAASpF,KAAT,KAAmBZ,SAAvB,EAAkC;2BAC1BY,KAAP,GAAeoF,SAASpF,KAAxB;iBADD,MAEO;2BACCA,KAAP,GAAeqF,KAAKrF,KAApB;;aALF,MAOO;oBACFoF,SAAS7F,IAAT,CAAciG,MAAd,CAAqB,CAArB,MAA4B,GAAhC,EAAqC;2BAC7BjG,IAAP,GAAcgG,kBAAkBH,SAAS7F,IAA3B,CAAd;iBADD,MAEO;wBACF,CAAC8F,KAAKC,QAAL,KAAkBlG,SAAlB,IAA+BiG,KAAKpB,IAAL,KAAc7E,SAA7C,IAA0DiG,KAAKtB,IAAL,KAAc3E,SAAzE,KAAuF,CAACiG,KAAK9F,IAAjG,EAAuG;+BAC/FA,IAAP,GAAc,MAAM6F,SAAS7F,IAA7B;qBADD,MAEO,IAAI,CAAC8F,KAAK9F,IAAV,EAAgB;+BACfA,IAAP,GAAc6F,SAAS7F,IAAvB;qBADM,MAEA;+BACCA,IAAP,GAAc8F,KAAK9F,IAAL,CAAUsC,KAAV,CAAgB,CAAhB,EAAmBwD,KAAK9F,IAAL,CAAUyC,WAAV,CAAsB,GAAtB,IAA6B,CAAhD,IAAqDoD,SAAS7F,IAA5E;;2BAEMA,IAAP,GAAcgG,kBAAkBJ,OAAO5F,IAAzB,CAAd;;uBAEMS,KAAP,GAAeoF,SAASpF,KAAxB;;;mBAGMsF,QAAP,GAAkBD,KAAKC,QAAvB;mBACOrB,IAAP,GAAcoB,KAAKpB,IAAnB;mBACOF,IAAP,GAAcsB,KAAKtB,IAAnB;;eAEM3F,MAAP,GAAgBiH,KAAKjH,MAArB;;WAGMwF,QAAP,GAAkBwB,SAASxB,QAA3B;WAEOuB,MAAP;;AACA;AAED,AAAA,SAAAD,OAAA,CAAwBJ,OAAxB,EAAwCE,WAAxC,EAA4DjG,OAA5D,EAAA;QACOgG,oBAAoBE,OAAO,EAAE7G,QAAS,MAAX,EAAP,EAA4BW,OAA5B,CAA1B;WACOW,UAAUmF,kBAAkBjF,MAAMkF,OAAN,EAAeC,iBAAf,CAAlB,EAAqDnF,MAAMoF,WAAN,EAAmBD,iBAAnB,CAArD,EAA4FA,iBAA5F,EAA+G,IAA/G,CAAV,EAAgIA,iBAAhI,CAAP;;AACA;AAID,AAAA,SAAAH,SAAA,CAA0BD,GAA1B,EAAmC5F,OAAnC,EAAA;QACK,OAAO4F,GAAP,KAAe,QAAnB,EAA6B;cACtBjF,UAAUE,MAAM+E,GAAN,EAAW5F,OAAX,CAAV,EAA+BA,OAA/B,CAAN;KADD,MAEO,IAAI0F,OAAOE,GAAP,MAAgB,QAApB,EAA8B;cAC9B/E,MAAMF,UAAyBiF,GAAzB,EAA8B5F,OAA9B,CAAN,EAA8CA,OAA9C,CAAN;;WAGM4F,GAAP;;AACA;AAID,AAAA,SAAAD,KAAA,CAAsBH,IAAtB,EAAgCC,IAAhC,EAA0CzF,OAA1C,EAAA;QACK,OAAOwF,IAAP,KAAgB,QAApB,EAA8B;eACtB7E,UAAUE,MAAM2E,IAAN,EAAYxF,OAAZ,CAAV,EAAgCA,OAAhC,CAAP;KADD,MAEO,IAAI0F,OAAOF,IAAP,MAAiB,QAArB,EAA+B;eAC9B7E,UAAyB6E,IAAzB,EAA+BxF,OAA/B,CAAP;;QAGG,OAAOyF,IAAP,KAAgB,QAApB,EAA8B;eACtB9E,UAAUE,MAAM4E,IAAN,EAAYzF,OAAZ,CAAV,EAAgCA,OAAhC,CAAP;KADD,MAEO,IAAI0F,OAAOD,IAAP,MAAiB,QAArB,EAA+B;eAC9B9E,UAAyB8E,IAAzB,EAA+BzF,OAA/B,CAAP;;WAGMwF,SAASC,IAAhB;;AACA;AAED,AAAA,SAAAF,eAAA,CAAgCzB,GAAhC,EAA4C9D,OAA5C,EAAA;WACQ8D,OAAOA,IAAIqB,QAAJ,GAAe5D,OAAf,CAAwB,CAACvB,OAAD,IAAY,CAACA,QAAQuC,GAArB,GAA2B6C,aAAaE,MAAxC,GAAiDD,aAAaC,MAAtF,EAA+F1D,UAA/F,CAAd;;AACA;AAED,AAAA,SAAAe,iBAAA,CAAkCmB,GAAlC,EAA8C9D,OAA9C,EAAA;WACQ8D,OAAOA,IAAIqB,QAAJ,GAAe5D,OAAf,CAAwB,CAACvB,OAAD,IAAY,CAACA,QAAQuC,GAArB,GAA2B6C,aAAa5D,WAAxC,GAAsD6D,aAAa7D,WAA3F,EAAyGuC,WAAzG,CAAd;CACA;;ADziBD,IAAMzD,UAA2B;YACvB,MADuB;gBAGnB,IAHmB;WAKxB,eAAUS,UAAV,EAAoCf,OAApC,EAAT;;YAEM,CAACe,WAAWmE,IAAhB,EAAsB;uBACVjF,KAAX,GAAmBc,WAAWd,KAAX,IAAoB,6BAAvC;;eAGMc,UAAP;KAX+B;eAcpB,mBAAUA,UAAV,EAAoCf,OAApC,EAAb;YACQ+E,SAAS7B,OAAOnC,WAAW1B,MAAlB,EAA0BU,WAA1B,OAA4C,OAA3D;;YAGIgB,WAAWiE,IAAX,MAAqBD,SAAS,GAAT,GAAe,EAApC,KAA2ChE,WAAWiE,IAAX,KAAoB,EAAnE,EAAuE;uBAC3DA,IAAX,GAAkB3E,SAAlB;;;YAIG,CAACU,WAAWP,IAAhB,EAAsB;uBACVA,IAAX,GAAkB,GAAlB;;;;;eAOMO,UAAP;;CA/BF,CAmCA;;ADlCA,IAAMT,YAA2B;YACvB,OADuB;gBAEnBX,QAAKgF,UAFc;WAGxBhF,QAAKkB,KAHmB;eAIpBlB,QAAKgB;CAJlB,CAOA;;ADHA,SAAAsE,QAAA,CAAkBL,YAAlB,EAAA;WACQ,OAAOA,aAAaG,MAApB,KAA+B,SAA/B,GAA2CH,aAAaG,MAAxD,GAAiE7B,OAAO0B,aAAavF,MAApB,EAA4BU,WAA5B,OAA8C,KAAtH;;;AAID,IAAMO,YAA2B;YACvB,IADuB;gBAGnB,IAHmB;WAKxB,eAAUS,UAAV,EAAoCf,OAApC,EAAT;YACQ4E,eAAe7D,UAArB;;qBAGagE,MAAb,GAAsBE,SAASL,YAAT,CAAtB;;qBAGaE,YAAb,GAA4B,CAACF,aAAapE,IAAb,IAAqB,GAAtB,KAA8BoE,aAAa3D,KAAb,GAAqB,MAAM2D,aAAa3D,KAAxC,GAAgD,EAA9E,CAA5B;qBACaT,IAAb,GAAoBH,SAApB;qBACaY,KAAb,GAAqBZ,SAArB;eAEOuE,YAAP;KAhB+B;eAmBpB,mBAAUA,YAAV,EAAqC5E,OAArC,EAAb;;YAEM4E,aAAaI,IAAb,MAAuBC,SAASL,YAAT,IAAyB,GAAzB,GAA+B,EAAtD,KAA6DA,aAAaI,IAAb,KAAsB,EAAvF,EAA2F;yBAC7EA,IAAb,GAAoB3E,SAApB;;;YAIG,OAAOuE,aAAaG,MAApB,KAA+B,SAAnC,EAA8C;yBAChC1F,MAAb,GAAuBuF,aAAaG,MAAb,GAAsB,KAAtB,GAA8B,IAArD;yBACaA,MAAb,GAAsB1E,SAAtB;;;YAIGuE,aAAaE,YAAjB,EAA+B;wCACRF,aAAaE,YAAb,CAA0BvB,KAA1B,CAAgC,GAAhC,CADQ;;gBACvB/C,IADuB;gBACjBS,KADiB;;yBAEjBT,IAAb,GAAqBA,QAAQA,SAAS,GAAjB,GAAuBA,IAAvB,GAA8BH,SAAnD;yBACaY,KAAb,GAAqBA,KAArB;yBACa6D,YAAb,GAA4BzE,SAA5B;;;qBAIYwE,QAAb,GAAwBxE,SAAxB;eAEOuE,YAAP;;CA1CF,CA8CA;;ADvDA,IAAMtE,YAA2B;YACvB,KADuB;gBAEnBb,UAAGkF,UAFgB;WAGxBlF,UAAGoB,KAHqB;eAIpBpB,UAAGkB;CAJhB,CAOA;;ADMA,IAAMoB,IAAkB,EAAxB;AACA,IAAM2C,QAAQ,IAAd;;AAGA,IAAMR,eAAe,4BAA4BQ,QAAQ,2EAAR,GAAsF,EAAlH,IAAwH,GAA7I;AACA,IAAMD,WAAW,aAAjB;AACA,IAAMH,eAAeE,OAAOA,OAAO,YAAYC,QAAZ,GAAuB,GAAvB,GAA6BA,QAA7B,GAAwCA,QAAxC,GAAmD,GAAnD,GAAyDA,QAAzD,GAAoEA,QAA3E,IAAuF,GAAvF,GAA6FD,OAAO,gBAAgBC,QAAhB,GAA2B,GAA3B,GAAiCA,QAAjC,GAA4CA,QAAnD,CAA7F,GAA4J,GAA5J,GAAkKD,OAAO,MAAMC,QAAN,GAAiBA,QAAxB,CAAzK,CAArB;;;;;;;;;;;;AAaA,IAAML,UAAU,uDAAhB;AACA,IAAMG,UAAU,4DAAhB;AACA,IAAMF,UAAUJ,MAAMM,OAAN,EAAe,YAAf,CAAhB;AACA,AACA,AACA,AACA,AAEA,AAEA,IAAMJ,gBAAgB,qCAAtB;AACA,AACA,AACA,AACA,AACA,AACA,AACA,AACA,AACA,AACA,AACA,AAEA,IAAMN,aAAa,IAAIG,MAAJ,CAAWE,YAAX,EAAyB,GAAzB,CAAnB;AACA,IAAM1C,cAAc,IAAIwC,MAAJ,CAAWM,YAAX,EAAyB,GAAzB,CAApB;AACA,IAAMtB,iBAAiB,IAAIgB,MAAJ,CAAWC,MAAM,KAAN,EAAaG,OAAb,EAAsB,OAAtB,EAA+B,OAA/B,EAAwCC,OAAxC,CAAX,EAA6D,GAA7D,CAAvB;AACA,AACA,IAAM1C,aAAa,IAAIqC,MAAJ,CAAWC,MAAM,KAAN,EAAaC,YAAb,EAA2BC,aAA3B,CAAX,EAAsD,GAAtD,CAAnB;AACA,IAAMrC,cAAcH,UAApB;AACA,AACA,AAEA,SAAAF,gBAAA,CAA0BqC,GAA1B,EAAA;QACOF,SAASG,YAAYD,GAAZ,CAAf;WACQ,CAACF,OAAOzD,KAAP,CAAa0D,UAAb,CAAD,GAA4BC,GAA5B,GAAkCF,MAA1C;;AAGD,IAAMtD,YAA8C;YAC1C,QAD0C;WAG3C,kBAAUS,UAAV,EAAoCf,OAApC,EAAT;YACQgC,mBAAmBjB,UAAzB;YACMoB,KAAKH,iBAAiBG,EAAjB,GAAuBH,iBAAiBxB,IAAjB,GAAwBwB,iBAAiBxB,IAAjB,CAAsB+C,KAAtB,CAA4B,GAA5B,CAAxB,GAA2D,EAA7F;yBACiB/C,IAAjB,GAAwBH,SAAxB;YAEI2B,iBAAiBf,KAArB,EAA4B;gBACvBuC,iBAAiB,KAArB;gBACM3B,UAAwB,EAA9B;gBACM8B,UAAU3B,iBAAiBf,KAAjB,CAAuBsC,KAAvB,CAA6B,GAA7B,CAAhB;iBAEK,IAAInB,IAAI,CAAR,EAAWe,KAAKQ,QAAQvC,MAA7B,EAAqCgB,IAAIe,EAAzC,EAA6C,EAAEf,CAA/C,EAAkD;oBAC3CqB,SAASE,QAAQvB,CAAR,EAAWmB,KAAX,CAAiB,GAAjB,CAAf;wBAEQE,OAAO,CAAP,CAAR;yBACM,IAAL;4BACOC,UAAUD,OAAO,CAAP,EAAUF,KAAV,CAAgB,GAAhB,CAAhB;6BACK,IAAInB,KAAI,CAAR,EAAWe,MAAKO,QAAQtC,MAA7B,EAAqCgB,KAAIe,GAAzC,EAA6C,EAAEf,EAA/C,EAAkD;+BAC9Cf,IAAH,CAAQqC,QAAQtB,EAAR,CAAR;;;yBAGG,SAAL;yCACkBF,OAAjB,GAA2BS,kBAAkBc,OAAO,CAAP,CAAlB,EAA6BzD,OAA7B,CAA3B;;yBAEI,MAAL;yCACkBiC,IAAjB,GAAwBU,kBAAkBc,OAAO,CAAP,CAAlB,EAA6BzD,OAA7B,CAAxB;;;yCAGiB,IAAjB;gCACQ2C,kBAAkBc,OAAO,CAAP,CAAlB,EAA6BzD,OAA7B,CAAR,IAAiD2C,kBAAkBc,OAAO,CAAP,CAAlB,EAA6BzD,OAA7B,CAAjD;;;;gBAKCwD,cAAJ,EAAoBxB,iBAAiBH,OAAjB,GAA2BA,OAA3B;;yBAGJZ,KAAjB,GAAyBZ,SAAzB;aAEK,IAAI+B,MAAI,CAAR,EAAWe,OAAKhB,GAAGf,MAAxB,EAAgCgB,MAAIe,IAApC,EAAwC,EAAEf,GAA1C,EAA6C;gBACtCiB,OAAOlB,GAAGC,GAAH,EAAMmB,KAAN,CAAY,GAAZ,CAAb;iBAEK,CAAL,IAAUZ,kBAAkBU,KAAK,CAAL,CAAlB,CAAV;gBAEI,CAACrD,QAAQsD,cAAb,EAA6B;;oBAExB;yBACE,CAAL,IAAUb,SAASC,OAAT,CAAiBC,kBAAkBU,KAAK,CAAL,CAAlB,EAA2BrD,OAA3B,EAAoCD,WAApC,EAAjB,CAAV;iBADD,CAEE,OAAOyC,CAAP,EAAU;qCACMvC,KAAjB,GAAyB+B,iBAAiB/B,KAAjB,IAA0B,6EAA6EuC,CAAhI;;aALF,MAOO;qBACD,CAAL,IAAUG,kBAAkBU,KAAK,CAAL,CAAlB,EAA2BrD,OAA3B,EAAoCD,WAApC,EAAV;;eAGEqC,GAAH,IAAQiB,KAAKlC,IAAL,CAAU,GAAV,CAAR;;eAGMa,gBAAP;KA5DkD;eA+DvC,sBAAUA,gBAAV,EAA6ChC,OAA7C,EAAb;YACQe,aAAaiB,gBAAnB;YACMG,KAAKiB,QAAQpB,iBAAiBG,EAAzB,CAAX;YACIA,EAAJ,EAAQ;iBACF,IAAIC,IAAI,CAAR,EAAWe,KAAKhB,GAAGf,MAAxB,EAAgCgB,IAAIe,EAApC,EAAwC,EAAEf,CAA1C,EAA6C;oBACtCS,SAASK,OAAOf,GAAGC,CAAH,CAAP,CAAf;oBACMW,QAAQF,OAAOI,WAAP,CAAmB,GAAnB,CAAd;oBACMZ,YAAaQ,OAAOC,KAAP,CAAa,CAAb,EAAgBC,KAAhB,CAAD,CAAyBxB,OAAzB,CAAiCC,WAAjC,EAA8CC,gBAA9C,EAAgEF,OAAhE,CAAwEC,WAAxE,EAAqFE,WAArF,EAAkGH,OAAlG,CAA0GyB,cAA1G,EAA0HpB,UAA1H,CAAlB;oBACIU,SAASO,OAAOC,KAAP,CAAaC,QAAQ,CAArB,CAAb;;oBAGI;6BACO,CAAC/C,QAAQuC,GAAT,GAAeE,SAASC,OAAT,CAAiBC,kBAAkBL,MAAlB,EAA0BtC,OAA1B,EAAmCD,WAAnC,EAAjB,CAAf,GAAoF0C,SAASG,SAAT,CAAmBN,MAAnB,CAA9F;iBADD,CAEE,OAAOE,CAAP,EAAU;+BACAvC,KAAX,GAAmBc,WAAWd,KAAX,IAAoB,0DAA0D,CAACD,QAAQuC,GAAT,GAAe,OAAf,GAAyB,SAAnF,IAAgG,iBAAhG,GAAoHC,CAA3J;;mBAGEJ,CAAH,IAAQC,YAAY,GAAZ,GAAkBC,MAA1B;;uBAGU9B,IAAX,GAAkB2B,GAAGhB,IAAH,CAAQ,GAAR,CAAlB;;YAGKU,UAAUG,iBAAiBH,OAAjB,GAA2BG,iBAAiBH,OAAjB,IAA4B,EAAvE;YAEIG,iBAAiBE,OAArB,EAA8BL,QAAQ,SAAR,IAAqBG,iBAAiBE,OAAtC;YAC1BF,iBAAiBC,IAArB,EAA2BJ,QAAQ,MAAR,IAAkBG,iBAAiBC,IAAnC;YAErBf,SAAS,EAAf;aACK,IAAMI,IAAX,IAAmBO,OAAnB,EAA4B;gBACvBA,QAAQP,IAAR,MAAkBS,EAAET,IAAF,CAAtB,EAA+B;uBACvBD,IAAP,CACCC,KAAKC,OAAL,CAAaC,WAAb,EAA0BC,gBAA1B,EAA4CF,OAA5C,CAAoDC,WAApD,EAAiEE,WAAjE,EAA8EH,OAA9E,CAAsFI,UAAtF,EAAkGC,UAAlG,IACA,GADA,GAEAC,QAAQP,IAAR,EAAcC,OAAd,CAAsBC,WAAtB,EAAmCC,gBAAnC,EAAqDF,OAArD,CAA6DC,WAA7D,EAA0EE,WAA1E,EAAuFH,OAAvF,CAA+FO,WAA/F,EAA4GF,UAA5G,CAHD;;;YAOEV,OAAOE,MAAX,EAAmB;uBACPH,KAAX,GAAmBC,OAAOC,IAAP,CAAY,GAAZ,CAAnB;;eAGMJ,UAAP;;CAzGF,CA6GA;;ADnKA,IAAMC,YAAY,iBAAlB;AACA,AAEA;AACA,IAAMV,YAAqD;YACjD,KADiD;WAGlD,kBAAUS,UAAV,EAAoCf,OAApC,EAAT;YACQc,UAAUC,WAAWP,IAAX,IAAmBO,WAAWP,IAAX,CAAgBL,KAAhB,CAAsBa,SAAtB,CAAnC;YACIpB,gBAAgBmB,UAApB;YAEID,OAAJ,EAAa;gBACNzB,SAASW,QAAQX,MAAR,IAAkBO,cAAcP,MAAhC,IAA0C,KAAzD;gBACMoB,MAAMK,QAAQ,CAAR,EAAWf,WAAX,EAAZ;gBACMF,MAAMiB,QAAQ,CAAR,CAAZ;gBACMF,YAAevB,MAAf,UAAyBW,QAAQS,GAAR,IAAeA,GAAxC,CAAN;gBACMC,gBAAgBvB,QAAQyB,SAAR,CAAtB;0BAEcH,GAAd,GAAoBA,GAApB;0BACcZ,GAAd,GAAoBA,GAApB;0BACcW,IAAd,GAAqBH,SAArB;gBAEIK,aAAJ,EAAmB;gCACFA,cAAcG,KAAd,CAAoBjB,aAApB,EAAmCI,OAAnC,CAAhB;;SAZF,MAcO;0BACQC,KAAd,GAAsBL,cAAcK,KAAd,IAAuB,wBAA7C;;eAGML,aAAP;KAzByD;eA4B9C,sBAAUA,aAAV,EAAuCI,OAAvC,EAAb;YACQX,SAASW,QAAQX,MAAR,IAAkBO,cAAcP,MAAhC,IAA0C,KAAzD;YACMoB,MAAMb,cAAca,GAA1B;YACMG,YAAevB,MAAf,UAAyBW,QAAQS,GAAR,IAAeA,GAAxC,CAAN;YACMC,gBAAgBvB,QAAQyB,SAAR,CAAtB;YAEIF,aAAJ,EAAmB;4BACFA,cAAcC,SAAd,CAAwBf,aAAxB,EAAuCI,OAAvC,CAAhB;;YAGKO,gBAAgBX,aAAtB;YACMC,MAAMD,cAAcC,GAA1B;sBACcW,IAAd,IAAwBC,OAAOT,QAAQS,GAAvC,UAA8CZ,GAA9C;eAEOU,aAAP;;CA1CF,CA8CA;;AD5DA,IAAMH,OAAO,0DAAb;AACA,AAEA;AACA,IAAME,YAAsE;YAClE,UADkE;WAGnE,eAAUV,aAAV,EAAuCI,OAAvC,EAAT;YACQF,iBAAiBF,aAAvB;uBACeR,IAAf,GAAsBU,eAAeD,GAArC;uBACeA,GAAf,GAAqBQ,SAArB;YAEI,CAACL,QAAQE,QAAT,KAAsB,CAACJ,eAAeV,IAAhB,IAAwB,CAACU,eAAeV,IAAf,CAAoBe,KAApB,CAA0BC,IAA1B,CAA/C,CAAJ,EAAqF;2BACrEH,KAAf,GAAuBH,eAAeG,KAAf,IAAwB,oBAA/C;;eAGMH,cAAP;KAZ0E;eAe/D,mBAAUA,cAAV,EAAyCE,OAAzC,EAAb;YACQJ,gBAAgBE,cAAtB;;sBAEcD,GAAd,GAAoB,CAACC,eAAeV,IAAf,IAAuB,EAAxB,EAA4BW,WAA5B,EAApB;eACOH,aAAP;;CAnBF,CAuBA;;ADhCAT,QAAQQ,QAAKN,MAAb,IAAuBM,OAAvB;AAEA,AACAR,QAAQO,UAAML,MAAd,IAAwBK,SAAxB;AAEA,AACAP,QAAQM,UAAGJ,MAAX,IAAqBI,SAArB;AAEA,AACAN,QAAQK,UAAIH,MAAZ,IAAsBG,SAAtB;AAEA,AACAL,QAAQI,UAAOF,MAAf,IAAyBE,SAAzB;AAEA,AACAJ,QAAQG,UAAID,MAAZ,IAAsBC,SAAtB;AAEA,AACAH,QAAQC,UAAKC,MAAb,IAAuBD,SAAvB,CAEA;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.d.ts
new file mode 100644
index 0000000..da51e23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.d.ts
@@ -0,0 +1,59 @@
+export interface URIComponents {
+    scheme?: string;
+    userinfo?: string;
+    host?: string;
+    port?: number | string;
+    path?: string;
+    query?: string;
+    fragment?: string;
+    reference?: string;
+    error?: string;
+}
+export interface URIOptions {
+    scheme?: string;
+    reference?: string;
+    tolerant?: boolean;
+    absolutePath?: boolean;
+    iri?: boolean;
+    unicodeSupport?: boolean;
+    domainHost?: boolean;
+}
+export interface URISchemeHandler<Components extends URIComponents = URIComponents, Options extends URIOptions = URIOptions, ParentComponents extends URIComponents = URIComponents> {
+    scheme: string;
+    parse(components: ParentComponents, options: Options): Components;
+    serialize(components: Components, options: Options): ParentComponents;
+    unicodeSupport?: boolean;
+    domainHost?: boolean;
+    absolutePath?: boolean;
+}
+export interface URIRegExps {
+    NOT_SCHEME: RegExp;
+    NOT_USERINFO: RegExp;
+    NOT_HOST: RegExp;
+    NOT_PATH: RegExp;
+    NOT_PATH_NOSCHEME: RegExp;
+    NOT_QUERY: RegExp;
+    NOT_FRAGMENT: RegExp;
+    ESCAPE: RegExp;
+    UNRESERVED: RegExp;
+    OTHER_CHARS: RegExp;
+    PCT_ENCODED: RegExp;
+    IPV4ADDRESS: RegExp;
+    IPV6ADDRESS: RegExp;
+}
+export declare const SCHEMES: {
+    [scheme: string]: URISchemeHandler;
+};
+export declare function pctEncChar(chr: string): string;
+export declare function pctDecChars(str: string): string;
+export declare function parse(uriString: string, options?: URIOptions): URIComponents;
+export declare function removeDotSegments(input: string): string;
+export declare function serialize(components: URIComponents, options?: URIOptions): string;
+export declare function resolveComponents(base: URIComponents, relative: URIComponents, options?: URIOptions, skipNormalization?: boolean): URIComponents;
+export declare function resolve(baseURI: string, relativeURI: string, options?: URIOptions): string;
+export declare function normalize(uri: string, options?: URIOptions): string;
+export declare function normalize(uri: URIComponents, options?: URIOptions): URIComponents;
+export declare function equal(uriA: string, uriB: string, options?: URIOptions): boolean;
+export declare function equal(uriA: URIComponents, uriB: URIComponents, options?: URIOptions): boolean;
+export declare function escapeComponent(str: string, options?: URIOptions): string;
+export declare function unescapeComponent(str: string, options?: URIOptions): string;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.js
new file mode 100644
index 0000000..fcd8458
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.js
@@ -0,0 +1,3 @@
+/** @license URI.js v4.4.1 (c) 2011 Gary Court. License: http://github.com/garycourt/uri-js */
+!function(e,r){"object"==typeof exports&&"undefined"!=typeof module?r(exports):"function"==typeof define&&define.amd?define(["exports"],r):r(e.URI=e.URI||{})}(this,function(e){"use strict";function r(){for(var e=arguments.length,r=Array(e),n=0;n<e;n++)r[n]=arguments[n];if(r.length>1){r[0]=r[0].slice(0,-1);for(var t=r.length-1,o=1;o<t;++o)r[o]=r[o].slice(1,-1);return r[t]=r[t].slice(1),r.join("")}return r[0]}function n(e){return"(?:"+e+")"}function t(e){return e===undefined?"undefined":null===e?"null":Object.prototype.toString.call(e).split(" ").pop().split("]").shift().toLowerCase()}function o(e){return e.toUpperCase()}function a(e){return e!==undefined&&null!==e?e instanceof Array?e:"number"!=typeof e.length||e.split||e.setInterval||e.call?[e]:Array.prototype.slice.call(e):[]}function i(e,r){var n=e;if(r)for(var t in r)n[t]=r[t];return n}function u(e){var t=r("[0-9]","[A-Fa-f]"),o=n(n("%[EFef]"+t+"%"+t+t+"%"+t+t)+"|"+n("%[89A-Fa-f]"+t+"%"+t+t)+"|"+n("%"+t+t)),a="[\\!\\$\\&\\'\\(\\)\\*\\+\\,\\;\\=]",i=r("[\\:\\/\\?\\#\\[\\]\\@]",a),u=e?"[\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]":"[]",s=e?"[\\uE000-\\uF8FF]":"[]",f=r("[A-Za-z]","[0-9]","[\\-\\.\\_\\~]",u),c=n(n("25[0-5]")+"|"+n("2[0-4][0-9]")+"|"+n("1[0-9][0-9]")+"|"+n("0?[1-9][0-9]")+"|0?0?[0-9]"),p=n(c+"\\."+c+"\\."+c+"\\."+c),h=n(t+"{1,4}"),d=n(n(h+"\\:"+h)+"|"+p),l=n(n(h+"\\:")+"{6}"+d),m=n("\\:\\:"+n(h+"\\:")+"{5}"+d),g=n(n(h)+"?\\:\\:"+n(h+"\\:")+"{4}"+d),v=n(n(n(h+"\\:")+"{0,1}"+h)+"?\\:\\:"+n(h+"\\:")+"{3}"+d),E=n(n(n(h+"\\:")+"{0,2}"+h)+"?\\:\\:"+n(h+"\\:")+"{2}"+d),C=n(n(n(h+"\\:")+"{0,3}"+h)+"?\\:\\:"+h+"\\:"+d),y=n(n(n(h+"\\:")+"{0,4}"+h)+"?\\:\\:"+d),S=n(n(n(h+"\\:")+"{0,5}"+h)+"?\\:\\:"+h),A=n(n(n(h+"\\:")+"{0,6}"+h)+"?\\:\\:"),D=n([l,m,g,v,E,C,y,S,A].join("|")),w=n(n(f+"|"+o)+"+");return{NOT_SCHEME:new RegExp(r("[^]","[A-Za-z]","[0-9]","[\\+\\-\\.]"),"g"),NOT_USERINFO:new RegExp(r("[^\\%\\:]",f,a),"g"),NOT_HOST:new RegExp(r("[^\\%\\[\\]\\:]",f,a),"g"),NOT_PATH:new RegExp(r("[^\\%\\/\\:\\@]",f,a),"g"),NOT_PATH_NOSCHEME:new RegExp(r("[^\\%\\/\\@]",f,a),"g"),NOT_QUERY:new RegExp(r("[^\\%]",f,a,"[\\:\\@\\/\\?]",s),"g"),NOT_FRAGMENT:new RegExp(r("[^\\%]",f,a,"[\\:\\@\\/\\?]"),"g"),ESCAPE:new RegExp(r("[^]",f,a),"g"),UNRESERVED:new RegExp(f,"g"),OTHER_CHARS:new RegExp(r("[^\\%]",f,i),"g"),PCT_ENCODED:new RegExp(o,"g"),IPV4ADDRESS:new RegExp("^("+p+")$"),IPV6ADDRESS:new RegExp("^\\[?("+D+")"+n(n("\\%25|\\%(?!"+t+"{2})")+"("+w+")")+"?\\]?$")}}function s(e){throw new RangeError(H[e])}function f(e,r){for(var n=[],t=e.length;t--;)n[t]=r(e[t]);return n}function c(e,r){var n=e.split("@"),t="";return n.length>1&&(t=n[0]+"@",e=n[1]),e=e.replace(j,"."),t+f(e.split("."),r).join(".")}function p(e){for(var r=[],n=0,t=e.length;n<t;){var o=e.charCodeAt(n++);if(o>=55296&&o<=56319&&n<t){var a=e.charCodeAt(n++);56320==(64512&a)?r.push(((1023&o)<<10)+(1023&a)+65536):(r.push(o),n--)}else r.push(o)}return r}function h(e){var r=e.charCodeAt(0);return r<16?"%0"+r.toString(16).toUpperCase():r<128?"%"+r.toString(16).toUpperCase():r<2048?"%"+(r>>6|192).toString(16).toUpperCase()+"%"+(63&r|128).toString(16).toUpperCase():"%"+(r>>12|224).toString(16).toUpperCase()+"%"+(r>>6&63|128).toString(16).toUpperCase()+"%"+(63&r|128).toString(16).toUpperCase()}function d(e){for(var r="",n=0,t=e.length;n<t;){var o=parseInt(e.substr(n+1,2),16);if(o<128)r+=String.fromCharCode(o),n+=3;else if(o>=194&&o<224){if(t-n>=6){var a=parseInt(e.substr(n+4,2),16);r+=String.fromCharCode((31&o)<<6|63&a)}else r+=e.substr(n,6);n+=6}else if(o>=224){if(t-n>=9){var i=parseInt(e.substr(n+4,2),16),u=parseInt(e.substr(n+7,2),16);r+=String.fromCharCode((15&o)<<12|(63&i)<<6|63&u)}else r+=e.substr(n,9);n+=9}else r+=e.substr(n,3),n+=3}return r}function l(e,r){function n(e){var n=d(e);return n.match(r.UNRESERVED)?n:e}return e.scheme&&(e.scheme=String(e.scheme).replace(r.PCT_ENCODED,n).toLowerCase().replace(r.NOT_SCHEME,"")),e.userinfo!==undefined&&(e.userinfo=String(e.userinfo).replace(r.PCT_ENCODED,n).replace(r.NOT_USERINFO,h).replace(r.PCT_ENCODED,o)),e.host!==undefined&&(e.host=String(e.host).replace(r.PCT_ENCODED,n).toLowerCase().replace(r.NOT_HOST,h).replace(r.PCT_ENCODED,o)),e.path!==undefined&&(e.path=String(e.path).replace(r.PCT_ENCODED,n).replace(e.scheme?r.NOT_PATH:r.NOT_PATH_NOSCHEME,h).replace(r.PCT_ENCODED,o)),e.query!==undefined&&(e.query=String(e.query).replace(r.PCT_ENCODED,n).replace(r.NOT_QUERY,h).replace(r.PCT_ENCODED,o)),e.fragment!==undefined&&(e.fragment=String(e.fragment).replace(r.PCT_ENCODED,n).replace(r.NOT_FRAGMENT,h).replace(r.PCT_ENCODED,o)),e}function m(e){return e.replace(/^0*(.*)/,"$1")||"0"}function g(e,r){var n=e.match(r.IPV4ADDRESS)||[],t=T(n,2),o=t[1];return o?o.split(".").map(m).join("."):e}function v(e,r){var n=e.match(r.IPV6ADDRESS)||[],t=T(n,3),o=t[1],a=t[2];if(o){for(var i=o.toLowerCase().split("::").reverse(),u=T(i,2),s=u[0],f=u[1],c=f?f.split(":").map(m):[],p=s.split(":").map(m),h=r.IPV4ADDRESS.test(p[p.length-1]),d=h?7:8,l=p.length-d,v=Array(d),E=0;E<d;++E)v[E]=c[E]||p[l+E]||"";h&&(v[d-1]=g(v[d-1],r));var C=v.reduce(function(e,r,n){if(!r||"0"===r){var t=e[e.length-1];t&&t.index+t.length===n?t.length++:e.push({index:n,length:1})}return e},[]),y=C.sort(function(e,r){return r.length-e.length})[0],S=void 0;if(y&&y.length>1){var A=v.slice(0,y.index),D=v.slice(y.index+y.length);S=A.join(":")+"::"+D.join(":")}else S=v.join(":");return a&&(S+="%"+a),S}return e}function E(e){var r=arguments.length>1&&arguments[1]!==undefined?arguments[1]:{},n={},t=!1!==r.iri?R:F;"suffix"===r.reference&&(e=(r.scheme?r.scheme+":":"")+"//"+e);var o=e.match(K);if(o){W?(n.scheme=o[1],n.userinfo=o[3],n.host=o[4],n.port=parseInt(o[5],10),n.path=o[6]||"",n.query=o[7],n.fragment=o[8],isNaN(n.port)&&(n.port=o[5])):(n.scheme=o[1]||undefined,n.userinfo=-1!==e.indexOf("@")?o[3]:undefined,n.host=-1!==e.indexOf("//")?o[4]:undefined,n.port=parseInt(o[5],10),n.path=o[6]||"",n.query=-1!==e.indexOf("?")?o[7]:undefined,n.fragment=-1!==e.indexOf("#")?o[8]:undefined,isNaN(n.port)&&(n.port=e.match(/\/\/(?:.|\n)*\:(?:\/|\?|\#|$)/)?o[4]:undefined)),n.host&&(n.host=v(g(n.host,t),t)),n.scheme!==undefined||n.userinfo!==undefined||n.host!==undefined||n.port!==undefined||n.path||n.query!==undefined?n.scheme===undefined?n.reference="relative":n.fragment===undefined?n.reference="absolute":n.reference="uri":n.reference="same-document",r.reference&&"suffix"!==r.reference&&r.reference!==n.reference&&(n.error=n.error||"URI is not a "+r.reference+" reference.");var a=J[(r.scheme||n.scheme||"").toLowerCase()];if(r.unicodeSupport||a&&a.unicodeSupport)l(n,t);else{if(n.host&&(r.domainHost||a&&a.domainHost))try{n.host=B.toASCII(n.host.replace(t.PCT_ENCODED,d).toLowerCase())}catch(i){n.error=n.error||"Host's domain name can not be converted to ASCII via punycode: "+i}l(n,F)}a&&a.parse&&a.parse(n,r)}else n.error=n.error||"URI can not be parsed.";return n}function C(e,r){var n=!1!==r.iri?R:F,t=[];return e.userinfo!==undefined&&(t.push(e.userinfo),t.push("@")),e.host!==undefined&&t.push(v(g(String(e.host),n),n).replace(n.IPV6ADDRESS,function(e,r,n){return"["+r+(n?"%25"+n:"")+"]"})),"number"!=typeof e.port&&"string"!=typeof e.port||(t.push(":"),t.push(String(e.port))),t.length?t.join(""):undefined}function y(e){for(var r=[];e.length;)if(e.match(X))e=e.replace(X,"");else if(e.match(ee))e=e.replace(ee,"/");else if(e.match(re))e=e.replace(re,"/"),r.pop();else if("."===e||".."===e)e="";else{var n=e.match(ne);if(!n)throw new Error("Unexpected dot segment condition");var t=n[0];e=e.slice(t.length),r.push(t)}return r.join("")}function S(e){var r=arguments.length>1&&arguments[1]!==undefined?arguments[1]:{},n=r.iri?R:F,t=[],o=J[(r.scheme||e.scheme||"").toLowerCase()];if(o&&o.serialize&&o.serialize(e,r),e.host)if(n.IPV6ADDRESS.test(e.host));else if(r.domainHost||o&&o.domainHost)try{e.host=r.iri?B.toUnicode(e.host):B.toASCII(e.host.replace(n.PCT_ENCODED,d).toLowerCase())}catch(u){e.error=e.error||"Host's domain name can not be converted to "+(r.iri?"Unicode":"ASCII")+" via punycode: "+u}l(e,n),"suffix"!==r.reference&&e.scheme&&(t.push(e.scheme),t.push(":"));var a=C(e,r);if(a!==undefined&&("suffix"!==r.reference&&t.push("//"),t.push(a),e.path&&"/"!==e.path.charAt(0)&&t.push("/")),e.path!==undefined){var i=e.path;r.absolutePath||o&&o.absolutePath||(i=y(i)),a===undefined&&(i=i.replace(/^\/\//,"/%2F")),t.push(i)}return e.query!==undefined&&(t.push("?"),t.push(e.query)),e.fragment!==undefined&&(t.push("#"),t.push(e.fragment)),t.join("")}function A(e,r){var n=arguments.length>2&&arguments[2]!==undefined?arguments[2]:{},t=arguments[3],o={};return t||(e=E(S(e,n),n),r=E(S(r,n),n)),n=n||{},!n.tolerant&&r.scheme?(o.scheme=r.scheme,o.userinfo=r.userinfo,o.host=r.host,o.port=r.port,o.path=y(r.path||""),o.query=r.query):(r.userinfo!==undefined||r.host!==undefined||r.port!==undefined?(o.userinfo=r.userinfo,o.host=r.host,o.port=r.port,o.path=y(r.path||""),o.query=r.query):(r.path?("/"===r.path.charAt(0)?o.path=y(r.path):(e.userinfo===undefined&&e.host===undefined&&e.port===undefined||e.path?e.path?o.path=e.path.slice(0,e.path.lastIndexOf("/")+1)+r.path:o.path=r.path:o.path="/"+r.path,o.path=y(o.path)),o.query=r.query):(o.path=e.path,r.query!==undefined?o.query=r.query:o.query=e.query),o.userinfo=e.userinfo,o.host=e.host,o.port=e.port),o.scheme=e.scheme),o.fragment=r.fragment,o}function D(e,r,n){var t=i({scheme:"null"},n);return S(A(E(e,t),E(r,t),t,!0),t)}function w(e,r){return"string"==typeof e?e=S(E(e,r),r):"object"===t(e)&&(e=E(S(e,r),r)),e}function b(e,r,n){return"string"==typeof e?e=S(E(e,n),n):"object"===t(e)&&(e=S(e,n)),"string"==typeof r?r=S(E(r,n),n):"object"===t(r)&&(r=S(r,n)),e===r}function x(e,r){return e&&e.toString().replace(r&&r.iri?R.ESCAPE:F.ESCAPE,h)}function O(e,r){return e&&e.toString().replace(r&&r.iri?R.PCT_ENCODED:F.PCT_ENCODED,d)}function N(e){return"boolean"==typeof e.secure?e.secure:"wss"===String(e.scheme).toLowerCase()}function I(e){var r=d(e);return r.match(he)?r:e}var F=u(!1),R=u(!0),T=function(){function e(e,r){var n=[],t=!0,o=!1,a=undefined;try{for(var i,u=e[Symbol.iterator]();!(t=(i=u.next()).done)&&(n.push(i.value),!r||n.length!==r);t=!0);}catch(s){o=!0,a=s}finally{try{!t&&u["return"]&&u["return"]()}finally{if(o)throw a}}return n}return function(r,n){if(Array.isArray(r))return r;if(Symbol.iterator in Object(r))return e(r,n);throw new TypeError("Invalid attempt to destructure non-iterable instance")}}(),_=function(e){if(Array.isArray(e)){for(var r=0,n=Array(e.length);r<e.length;r++)n[r]=e[r];return n}return Array.from(e)},P=2147483647,q=/^xn--/,U=/[^\0-\x7E]/,j=/[\x2E\u3002\uFF0E\uFF61]/g,H={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},z=Math.floor,L=String.fromCharCode,$=function(e){return String.fromCodePoint.apply(String,_(e))},M=function(e){return e-48<10?e-22:e-65<26?e-65:e-97<26?e-97:36},V=function(e,r){return e+22+75*(e<26)-((0!=r)<<5)},k=function(e,r,n){var t=0;for(e=n?z(e/700):e>>1,e+=z(e/r);e>455;t+=36)e=z(e/35);return z(t+36*e/(e+38))},Z=function(e){var r=[],n=e.length,t=0,o=128,a=72,i=e.lastIndexOf("-");i<0&&(i=0);for(var u=0;u<i;++u)e.charCodeAt(u)>=128&&s("not-basic"),r.push(e.charCodeAt(u));for(var f=i>0?i+1:0;f<n;){for(var c=t,p=1,h=36;;h+=36){f>=n&&s("invalid-input");var d=M(e.charCodeAt(f++));(d>=36||d>z((P-t)/p))&&s("overflow"),t+=d*p;var l=h<=a?1:h>=a+26?26:h-a;if(d<l)break;var m=36-l;p>z(P/m)&&s("overflow"),p*=m}var g=r.length+1;a=k(t-c,g,0==c),z(t/g)>P-o&&s("overflow"),o+=z(t/g),t%=g,r.splice(t++,0,o)}return String.fromCodePoint.apply(String,r)},G=function(e){var r=[];e=p(e);var n=e.length,t=128,o=0,a=72,i=!0,u=!1,f=undefined;try{for(var c,h=e[Symbol.iterator]();!(i=(c=h.next()).done);i=!0){var d=c.value;d<128&&r.push(L(d))}}catch(U){u=!0,f=U}finally{try{!i&&h["return"]&&h["return"]()}finally{if(u)throw f}}var l=r.length,m=l;for(l&&r.push("-");m<n;){var g=P,v=!0,E=!1,C=undefined;try{for(var y,S=e[Symbol.iterator]();!(v=(y=S.next()).done);v=!0){var A=y.value;A>=t&&A<g&&(g=A)}}catch(U){E=!0,C=U}finally{try{!v&&S["return"]&&S["return"]()}finally{if(E)throw C}}var D=m+1;g-t>z((P-o)/D)&&s("overflow"),o+=(g-t)*D,t=g;var w=!0,b=!1,x=undefined;try{for(var O,N=e[Symbol.iterator]();!(w=(O=N.next()).done);w=!0){var I=O.value;if(I<t&&++o>P&&s("overflow"),I==t){for(var F=o,R=36;;R+=36){var T=R<=a?1:R>=a+26?26:R-a;if(F<T)break;var _=F-T,q=36-T;r.push(L(V(T+_%q,0))),F=z(_/q)}r.push(L(V(F,0))),a=k(o,D,m==l),o=0,++m}}}catch(U){b=!0,x=U}finally{try{!w&&N["return"]&&N["return"]()}finally{if(b)throw x}}++o,++t}return r.join("")},Q=function(e){return c(e,function(e){return q.test(e)?Z(e.slice(4).toLowerCase()):e})},Y=function(e){return c(e,function(e){return U.test(e)?"xn--"+G(e):e})},B={version:"2.1.0",ucs2:{decode:p,encode:$},decode:Z,encode:G,toASCII:Y,toUnicode:Q},J={},K=/^(?:([^:\/?#]+):)?(?:\/\/((?:([^\/?#@]*)@)?(\[[^\/?#\]]+\]|[^\/?#:]*)(?:\:(\d*))?))?([^?#]*)(?:\?([^#]*))?(?:#((?:.|\n|\r)*))?/i,W="".match(/(){0}/)[1]===undefined,X=/^\.\.?\//,ee=/^\/\.(\/|$)/,re=/^\/\.\.(\/|$)/,ne=/^\/?(?:.|\n)*?(?=\/|$)/,te={scheme:"http",domainHost:!0,parse:function(e,r){return e.host||(e.error=e.error||"HTTP URIs must have a host."),e},serialize:function(e,r){var n="https"===String(e.scheme).toLowerCase();return e.port!==(n?443:80)&&""!==e.port||(e.port=undefined),e.path||(e.path="/"),e}},oe={scheme:"https",domainHost:te.domainHost,parse:te.parse,serialize:te.serialize},ae={scheme:"ws",domainHost:!0,parse:function(e,r){var n=e;return n.secure=N(n),n.resourceName=(n.path||"/")+(n.query?"?"+n.query:""),n.path=undefined,n.query=undefined,n},serialize:function(e,r){if(e.port!==(N(e)?443:80)&&""!==e.port||(e.port=undefined),"boolean"==typeof e.secure&&(e.scheme=e.secure?"wss":"ws",e.secure=undefined),e.resourceName){var n=e.resourceName.split("?"),t=T(n,2),o=t[0],a=t[1];e.path=o&&"/"!==o?o:undefined,e.query=a,e.resourceName=undefined}return e.fragment=undefined,e}},ie={scheme:"wss",domainHost:ae.domainHost,parse:ae.parse,serialize:ae.serialize},ue={},se="[A-Za-z0-9\\-\\.\\_\\~\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]",fe="[0-9A-Fa-f]",ce=n(n("%[EFef][0-9A-Fa-f]%"+fe+fe+"%"+fe+fe)+"|"+n("%[89A-Fa-f][0-9A-Fa-f]%"+fe+fe)+"|"+n("%"+fe+fe)),pe=r("[\\!\\$\\%\\'\\(\\)\\*\\+\\,\\-\\.0-9\\<\\>A-Z\\x5E-\\x7E]",'[\\"\\\\]'),he=new RegExp(se,"g"),de=new RegExp(ce,"g"),le=new RegExp(r("[^]","[A-Za-z0-9\\!\\$\\%\\'\\*\\+\\-\\^\\_\\`\\{\\|\\}\\~]","[\\.]",'[\\"]',pe),"g"),me=new RegExp(r("[^]",se,"[\\!\\$\\'\\(\\)\\*\\+\\,\\;\\:\\@]"),"g"),ge=me,ve={scheme:"mailto",parse:function(e,r){var n=e,t=n.to=n.path?n.path.split(","):[];if(n.path=undefined,n.query){for(var o=!1,a={},i=n.query.split("&"),u=0,s=i.length;u<s;++u){var f=i[u].split("=");switch(f[0]){case"to":for(var c=f[1].split(","),p=0,h=c.length;p<h;++p)t.push(c[p]);break;case"subject":n.subject=O(f[1],r);break;case"body":n.body=O(f[1],r);break;default:o=!0,a[O(f[0],r)]=O(f[1],r)}}o&&(n.headers=a)}n.query=undefined;for(var d=0,l=t.length;d<l;++d){var m=t[d].split("@");if(m[0]=O(m[0]),r.unicodeSupport)m[1]=O(m[1],r).toLowerCase();else try{m[1]=B.toASCII(O(m[1],r).toLowerCase())}catch(g){n.error=n.error||"Email address's domain name can not be converted to ASCII via punycode: "+g}t[d]=m.join("@")}return n},serialize:function(e,r){var n=e,t=a(e.to);if(t){for(var i=0,u=t.length;i<u;++i){var s=String(t[i]),f=s.lastIndexOf("@"),c=s.slice(0,f).replace(de,I).replace(de,o).replace(le,h),p=s.slice(f+1);try{p=r.iri?B.toUnicode(p):B.toASCII(O(p,r).toLowerCase())}catch(g){n.error=n.error||"Email address's domain name can not be converted to "+(r.iri?"Unicode":"ASCII")+" via punycode: "+g}t[i]=c+"@"+p}n.path=t.join(",")}var d=e.headers=e.headers||{};e.subject&&(d.subject=e.subject),e.body&&(d.body=e.body);var l=[];for(var m in d)d[m]!==ue[m]&&l.push(m.replace(de,I).replace(de,o).replace(me,h)+"="+d[m].replace(de,I).replace(de,o).replace(ge,h));return l.length&&(n.query=l.join("&")),n}},Ee=/^([^\:]+)\:(.*)/,Ce={scheme:"urn",parse:function(e,r){var n=e.path&&e.path.match(Ee),t=e;if(n){var o=r.scheme||t.scheme||"urn",a=n[1].toLowerCase(),i=n[2],u=o+":"+(r.nid||a),s=J[u];t.nid=a,t.nss=i,t.path=undefined,s&&(t=s.parse(t,r))}else t.error=t.error||"URN can not be parsed.";return t},serialize:function(e,r){var n=r.scheme||e.scheme||"urn",t=e.nid,o=n+":"+(r.nid||t),a=J[o];a&&(e=a.serialize(e,r));var i=e,u=e.nss;return i.path=(t||r.nid)+":"+u,i}},ye=/^[0-9A-Fa-f]{8}(?:\-[0-9A-Fa-f]{4}){3}\-[0-9A-Fa-f]{12}$/,Se={scheme:"urn:uuid",parse:function(e,r){var n=e;return n.uuid=n.nss,n.nss=undefined,r.tolerant||n.uuid&&n.uuid.match(ye)||(n.error=n.error||"UUID is not valid."),n},serialize:function(e,r){var n=e;return n.nss=(e.uuid||"").toLowerCase(),n}};J[te.scheme]=te,J[oe.scheme]=oe,J[ae.scheme]=ae,J[ie.scheme]=ie,J[ve.scheme]=ve,J[Ce.scheme]=Ce,J[Se.scheme]=Se,e.SCHEMES=J,e.pctEncChar=h,e.pctDecChars=d,e.parse=E,e.removeDotSegments=y,e.serialize=S,e.resolveComponents=A,e.resolve=D,e.normalize=w,e.equal=b,e.escapeComponent=x,e.unescapeComponent=O,Object.defineProperty(e,"__esModule",{value:!0})});
+//# sourceMappingURL=uri.all.min.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.js.map
new file mode 100644
index 0000000..99427a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/es5/uri.all.min.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/util.ts","../../src/regexps-uri.ts","../../node_modules/punycode/punycode.es6.js","../../src/uri.ts","../../src/schemes/ws.ts","../../src/schemes/mailto.ts","../../src/regexps-iri.ts","../../src/schemes/http.ts","../../src/schemes/https.ts","../../src/schemes/wss.ts","../../src/schemes/urn.ts","../../src/schemes/urn-uuid.ts","../../src/index.ts"],"names":["merge","sets","Array","_len","_key","arguments","length","slice","xl","x","join","subexp","str","typeOf","o","undefined","Object","prototype","toString","call","split","pop","shift","toLowerCase","toUpperCase","toArray","obj","setInterval","assign","target","source","key","buildExps","isIRI","HEXDIG$$","PCT_ENCODED$","SUB_DELIMS$$","RESERVED$$","UCSCHAR$$","DEC_OCTET_RELAXED$","H16$","LS32$","IPV4ADDRESS$","IPV6ADDRESS1$","IPV6ADDRESS2$","IPV6ADDRESS3$","IPV6ADDRESS4$","IPV6ADDRESS5$","IPV6ADDRESS6$","IPV6ADDRESS7$","IPV6ADDRESS8$","IPV6ADDRESS9$","ZONEID$","UNRESERVED$$","RegExp","IPRIVATE$$","IPV6ADDRESS$","error","type","RangeError","errors","map","array","fn","result","mapDomain","string","parts","replace","regexSeparators","ucs2decode","output","counter","value","charCodeAt","extra","push","pctEncChar","chr","c","pctDecChars","newStr","i","il","parseInt","substr","String","fromCharCode","c2","c3","_normalizeComponentEncoding","components","protocol","decodeUnreserved","decStr","match","UNRESERVED","scheme","PCT_ENCODED","NOT_SCHEME","userinfo","NOT_USERINFO","host","NOT_HOST","path","NOT_PATH","NOT_PATH_NOSCHEME","query","NOT_QUERY","fragment","NOT_FRAGMENT","_stripLeadingZeros","_normalizeIPv4","matches","IPV4ADDRESS","address","_matches","_normalizeIPv6","IPV6ADDRESS","_matches2","zone","reverse","last","_address$toLowerCase$2","first","firstFields","lastFields","isLastFieldIPv4Address","test","fieldCount","lastFieldsStart","fields","allZeroFields","reduce","acc","field","index","lastLongest","longestZeroFields","sort","a","b","newHost","newFirst","newLast","parse","uriString","options","iri","IRI_PROTOCOL","URI_PROTOCOL","reference","URI_PARSE","NO_MATCH_IS_UNDEFINED","port","isNaN","indexOf","schemeHandler","SCHEMES","unicodeSupport","domainHost","punycode","toASCII","e","_recomposeAuthority","uriTokens","_","$1","$2","removeDotSegments","input","RDS1","RDS2","RDS3","im","RDS5","Error","s","serialize","toUnicode","authority","charAt","absolutePath","resolveComponents","base","relative","skipNormalization","tolerant","lastIndexOf","resolve","baseURI","relativeURI","schemelessOptions","normalize","uri","equal","uriA","uriB","escapeComponent","ESCAPE","unescapeComponent","isSecure","wsComponents","secure","maxInt","regexPunycode","regexNonASCII","floor","Math","stringFromCharCode","ucs2encode","fromCodePoint","apply","toConsumableArray","basicToDigit","codePoint","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","k","baseMinusTMin","decode","inputLength","n","bias","basic","j","oldi","w","t","baseMinusT","out","splice","encode","_step","Symbol","iterator","_iteratorNormalCompletion","_iterator","next","done","currentValue","basicLength","handledCPCount","m","_step2","_iteratorNormalCompletion2","_iterator2","handledCPCountPlusOne","_step3","_iteratorNormalCompletion3","_iterator3","q","qMinusT","handler","http","resourceName","_wsComponents$resourc2","ws","O","VCHAR$$","NOT_LOCAL_PART","NOT_HFNAME","NOT_HFVALUE","mailtoComponents","to","unknownHeaders","headers","hfields","hfield","toAddrs","subject","body","addr","toAddr","atIdx","localPart","domain","name","URN_PARSE","urnComponents","nid","nss","urnScheme","uriComponents","UUID","uuidComponents","uuid","https","wss","mailto","urn"],"mappings":";4LAAA,SAAAA,gCAAyBC,EAAzBC,MAAAC,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,MAAAA,GAAAC,UAAAD,MACKH,EAAKK,OAAS,EAAG,GACf,GAAKL,EAAK,GAAGM,MAAM,GAAI,OAEvB,GADCC,GAAKP,EAAKK,OAAS,EAChBG,EAAI,EAAGA,EAAID,IAAMC,IACpBA,GAAKR,EAAKQ,GAAGF,MAAM,GAAI,YAExBC,GAAMP,EAAKO,GAAID,MAAM,GACnBN,EAAKS,KAAK,UAEVT,GAAK,GAId,QAAAU,GAAuBC,SACf,MAAQA,EAAM,IAGtB,QAAAC,GAAuBC,SACfA,KAAMC,UAAY,YAAqB,OAAND,EAAa,OAASE,OAAOC,UAAUC,SAASC,KAAKL,GAAGM,MAAM,KAAKC,MAAMD,MAAM,KAAKE,QAAQC,cAGrI,QAAAC,GAA4BZ,SACpBA,GAAIY,cAGZ,QAAAC,GAAwBC,SAChBA,KAAQX,WAAqB,OAARW,EAAgBA,YAAexB,OAAQwB,EAA6B,gBAAfA,GAAIpB,QAAuBoB,EAAIN,OAASM,EAAIC,aAAeD,EAAIP,MAAQO,GAAOxB,MAAMe,UAAUV,MAAMY,KAAKO,MAI3L,QAAAE,GAAuBC,EAAgBC,MAChCJ,GAAMG,KACRC,MACE,GAAMC,KAAOD,KACbC,GAAOD,EAAOC,SAGbL,GCnCR,QAAAM,GAA0BC,MAMxBC,GAAWlC,EAFD,QAEgB,YAG1BmC,EAAexB,EAAOA,EAAO,UAAYuB,EAAW,IAAMA,EAAWA,EAAW,IAAMA,EAAWA,GAAY,IAAMvB,EAAO,cAAgBuB,EAAW,IAAMA,EAAWA,GAAY,IAAMvB,EAAO,IAAMuB,EAAWA,IAEhNE,EAAe,sCACfC,EAAarC,EAFE,0BAEkBoC,GACjCE,EAAYL,EAAQ,8EAAgF,OACvFA,EAAQ,oBAAsB,OAC5BjC,EAbL,WAEA,QAW6B,iBAAkBsC,GAIzDC,EAAqB5B,EAAOA,EAAO,WAAa,IAAMA,EAAO,eAAsB,IAAMA,EAAO,eAA2B,IAAMA,EAAO,gBAAuB,gBAChJA,EAAO4B,EAAqB,MAAQA,EAAqB,MAAQA,EAAqB,MAAQA,GAC7GC,EAAO7B,EAAOuB,EAAW,SACzBO,EAAQ9B,EAAOA,EAAO6B,EAAO,MAAQA,GAAQ,IAAME,GACnDC,EAAgBhC,EAAmEA,EAAO6B,EAAO,OAAS,MAAQC,KAClG9B,EAAwD,SAAWA,EAAO6B,EAAO,OAAS,MAAQC,KAClG9B,EAAOA,EAAwC6B,GAAQ,UAAY7B,EAAO6B,EAAO,OAAS,MAAQC,KAClG9B,EAAOA,EAAOA,EAAO6B,EAAO,OAAS,QAAUA,GAAQ,UAAY7B,EAAO6B,EAAO,OAAS,MAAQC,KAClG9B,EAAOA,EAAOA,EAAO6B,EAAO,OAAS,QAAUA,GAAQ,UAAY7B,EAAO6B,EAAO,OAAS,MAAQC,KAClG9B,EAAOA,EAAOA,EAAO6B,EAAO,OAAS,QAAUA,GAAQ,UAAmBA,EAAO,MAAiBC,KAClG9B,EAAOA,EAAOA,EAAO6B,EAAO,OAAS,QAAUA,GAAQ,UAA2CC,KAClG9B,EAAOA,EAAOA,EAAO6B,EAAO,OAAS,QAAUA,GAAQ,UAA2CA,KAClG7B,EAAOA,EAAOA,EAAO6B,EAAO,OAAS,QAAUA,GAAQ,aACxD7B,GAAQgC,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,EAAeC,GAAezC,KAAK,MACnK0C,EAAUzC,EAAOA,EAAO0C,EAAe,IAAMlB,GAAgB,uBAoChD,GAAImB,QAAOtD,EAAM,MAnEpB,WAEA,QAiE6C,eAAgB,kBACxD,GAAIsD,QAAOtD,EAAM,YAAaqD,EAAcjB,GAAe,cAC/D,GAAIkB,QAAOtD,EAAM,kBAAmBqD,EAAcjB,GAAe,cACjE,GAAIkB,QAAOtD,EAAM,kBAAmBqD,EAAcjB,GAAe,uBACxD,GAAIkB,QAAOtD,EAAM,eAAgBqD,EAAcjB,GAAe,eACtE,GAAIkB,QAAOtD,EAAM,SAAUqD,EAAcjB,EAAc,iBAAkBmB,GAAa,kBACnF,GAAID,QAAOtD,EAAM,SAAUqD,EAAcjB,EAAc,kBAAmB,YAChF,GAAIkB,QAAOtD,EAAM,MAAOqD,EAAcjB,GAAe,gBACjD,GAAIkB,QAAOD,EAAc,iBACxB,GAAIC,QAAOtD,EAAM,SAAUqD,EAAchB,GAAa,iBACtD,GAAIiB,QAAOnB,EAAc,iBACzB,GAAImB,QAAO,KAAOZ,EAAe,kBACjC,GAAIY,QAAO,SAAWE,EAAe,IAAM7C,EAAOA,EAAO,eAAiBuB,EAAW,QAAU,IAAMkB,EAAU,KAAO,WC5CtI,QAASK,GAAMC,QACR,IAAIC,YAAWC,EAAOF,IAW7B,QAASG,GAAIC,EAAOC,UACbC,MACF1D,EAASwD,EAAMxD,OACZA,OACCA,GAAUyD,EAAGD,EAAMxD,UAEpB0D,GAaR,QAASC,GAAUC,EAAQH,MACpBI,GAAQD,EAAO9C,MAAM,KACvB4C,EAAS,SACTG,GAAM7D,OAAS,MAGT6D,EAAM,GAAK,MACXA,EAAM,MAGPD,EAAOE,QAAQC,EAAiB,KAGlCL,EADSH,EADDK,EAAO9C,MAAM,KACA2C,GAAIrD,KAAK,KAiBtC,QAAS4D,GAAWJ,UACbK,MACFC,EAAU,EACRlE,EAAS4D,EAAO5D,OACfkE,EAAUlE,GAAQ,IAClBmE,GAAQP,EAAOQ,WAAWF,QAC5BC,GAAS,OAAUA,GAAS,OAAUD,EAAUlE,EAAQ,IAErDqE,GAAQT,EAAOQ,WAAWF,IACR,SAAX,MAARG,KACGC,OAAe,KAARH,IAAkB,KAAe,KAARE,GAAiB,UAIjDC,KAAKH,eAING,KAAKH,SAGPF,GC/BR,QAAAM,GAA2BC,MACpBC,GAAID,EAAIJ,WAAW,SAGrBK,GAAI,GAAQ,KAAOA,EAAE7D,SAAS,IAAIM,cAC7BuD,EAAI,IAAS,IAAMA,EAAE7D,SAAS,IAAIM,cAClCuD,EAAI,KAAU,KAAQA,GAAK,EAAK,KAAK7D,SAAS,IAAIM,cAAgB,KAAY,GAAJuD,EAAU,KAAK7D,SAAS,IAAIM,cACtG,KAAQuD,GAAK,GAAM,KAAK7D,SAAS,IAAIM,cAAgB,KAASuD,GAAK,EAAK,GAAM,KAAK7D,SAAS,IAAIM,cAAgB,KAAY,GAAJuD,EAAU,KAAK7D,SAAS,IAAIM,cAK9J,QAAAwD,GAA4BpE,UACvBqE,GAAS,GACTC,EAAI,EACFC,EAAKvE,EAAIN,OAER4E,EAAIC,GAAI,IACRJ,GAAIK,SAASxE,EAAIyE,OAAOH,EAAI,EAAG,GAAI,OAErCH,EAAI,OACGO,OAAOC,aAAaR,MACzB,MAED,IAAIA,GAAK,KAAOA,EAAI,IAAK,IACxBI,EAAKD,GAAM,EAAG,IACZM,GAAKJ,SAASxE,EAAIyE,OAAOH,EAAI,EAAG,GAAI,OAChCI,OAAOC,cAAmB,GAAJR,IAAW,EAAW,GAALS,WAEvC5E,EAAIyE,OAAOH,EAAG,MAEpB,MAED,IAAIH,GAAK,IAAK,IACbI,EAAKD,GAAM,EAAG,IACZM,GAAKJ,SAASxE,EAAIyE,OAAOH,EAAI,EAAG,GAAI,IACpCO,EAAKL,SAASxE,EAAIyE,OAAOH,EAAI,EAAG,GAAI,OAChCI,OAAOC,cAAmB,GAAJR,IAAW,IAAa,GAALS,IAAY,EAAW,GAALC,WAE3D7E,EAAIyE,OAAOH,EAAG,MAEpB,UAGKtE,EAAIyE,OAAOH,EAAG,MACnB,QAIAD,GAGR,QAAAS,GAAqCC,EAA0BC,WAC/DC,GAA2BjF,MACnBkF,GAASd,EAAYpE,SAClBkF,GAAOC,MAAMH,EAASI,YAAoBF,EAANlF,QAG1C+E,GAAWM,SAAQN,EAAWM,OAASX,OAAOK,EAAWM,QAAQ7B,QAAQwB,EAASM,YAAaL,GAAkBtE,cAAc6C,QAAQwB,EAASO,WAAY,KAC5JR,EAAWS,WAAarF,YAAW4E,EAAWS,SAAWd,OAAOK,EAAWS,UAAUhC,QAAQwB,EAASM,YAAaL,GAAkBzB,QAAQwB,EAASS,aAAcxB,GAAYT,QAAQwB,EAASM,YAAa1E,IAC9MmE,EAAWW,OAASvF,YAAW4E,EAAWW,KAAOhB,OAAOK,EAAWW,MAAMlC,QAAQwB,EAASM,YAAaL,GAAkBtE,cAAc6C,QAAQwB,EAASW,SAAU1B,GAAYT,QAAQwB,EAASM,YAAa1E,IAC5MmE,EAAWa,OAASzF,YAAW4E,EAAWa,KAAOlB,OAAOK,EAAWa,MAAMpC,QAAQwB,EAASM,YAAaL,GAAkBzB,QAASuB,EAAWM,OAASL,EAASa,SAAWb,EAASc,kBAAoB7B,GAAYT,QAAQwB,EAASM,YAAa1E,IACjPmE,EAAWgB,QAAU5F,YAAW4E,EAAWgB,MAAQrB,OAAOK,EAAWgB,OAAOvC,QAAQwB,EAASM,YAAaL,GAAkBzB,QAAQwB,EAASgB,UAAW/B,GAAYT,QAAQwB,EAASM,YAAa1E,IAClMmE,EAAWkB,WAAa9F,YAAW4E,EAAWkB,SAAWvB,OAAOK,EAAWkB,UAAUzC,QAAQwB,EAASM,YAAaL,GAAkBzB,QAAQwB,EAASkB,aAAcjC,GAAYT,QAAQwB,EAASM,YAAa1E,IAE3MmE,EAGR,QAAAoB,GAA4BnG,SACpBA,GAAIwD,QAAQ,UAAW,OAAS,IAGxC,QAAA4C,GAAwBV,EAAaV,MAC9BqB,GAAUX,EAAKP,MAAMH,EAASsB,qBAChBD,EAFrB,GAEUE,EAFVC,EAAA,SAIKD,GACIA,EAAQ/F,MAAM,KAAKyC,IAAIkD,GAAoBrG,KAAK,KAEhD4F,EAIT,QAAAe,GAAwBf,EAAaV,MAC9BqB,GAAUX,EAAKP,MAAMH,EAAS0B,qBACVL,EAF3B,GAEUE,EAFVI,EAAA,GAEmBC,EAFnBD,EAAA,MAIKJ,EAAS,KASP,MARiBA,EAAQ5F,cAAcH,MAAM,MAAMqG,mBAAjDC,EADKC,EAAA,GACCC,EADDD,EAAA,GAENE,EAAcD,EAAQA,EAAMxG,MAAM,KAAKyC,IAAIkD,MAC3Ce,EAAaJ,EAAKtG,MAAM,KAAKyC,IAAIkD,GACjCgB,EAAyBnC,EAASsB,YAAYc,KAAKF,EAAWA,EAAWxH,OAAS,IAClF2H,EAAaF,EAAyB,EAAI,EAC1CG,EAAkBJ,EAAWxH,OAAS2H,EACtCE,EAASjI,MAAc+H,GAEpBxH,EAAI,EAAGA,EAAIwH,IAAcxH,IAC1BA,GAAKoH,EAAYpH,IAAMqH,EAAWI,EAAkBzH,IAAM,EAG9DsH,OACIE,EAAa,GAAKjB,EAAemB,EAAOF,EAAa,GAAIrC,OAG3DwC,GAAgBD,EAAOE,OAA4C,SAACC,EAAKC,EAAOC,OAChFD,GAAmB,MAAVA,EAAe,IACtBE,GAAcH,EAAIA,EAAIhI,OAAS,EACjCmI,IAAeA,EAAYD,MAAQC,EAAYnI,SAAWkI,IACjDlI,WAERsE,MAAO4D,MAAAA,EAAOlI,OAAS,UAGtBgI,QAGFI,EAAoBN,EAAcO,KAAK,SAACC,EAAGC,SAAMA,GAAEvI,OAASsI,EAAEtI,SAAQ,GAExEwI,MAAAA,MACAJ,GAAqBA,EAAkBpI,OAAS,EAAG,IAChDyI,GAAWZ,EAAO5H,MAAM,EAAGmI,EAAkBF,OAC7CQ,EAAUb,EAAO5H,MAAMmI,EAAkBF,MAAQE,EAAkBpI,UAC/DyI,EAASrI,KAAK,KAAO,KAAOsI,EAAQtI,KAAK,YAEzCyH,EAAOzH,KAAK,WAGnB8G,QACQ,IAAMA,GAGXsB,QAEAxC,GAOT,QAAA2C,GAAsBC,MAAkBC,GAAxC9I,UAAAC,OAAA,GAAAD,UAAA,KAAAU,UAAAV,UAAA,MACOsF,KACAC,GAA4B,IAAhBuD,EAAQC,IAAgBC,EAAeC,CAE/B,YAAtBH,EAAQI,YAAwBL,GAAaC,EAAQlD,OAASkD,EAAQlD,OAAS,IAAM,IAAM,KAAOiD,MAEhGjC,GAAUiC,EAAUnD,MAAMyD,MAE5BvC,EAAS,CACRwC,KAEQxD,OAASgB,EAAQ,KACjBb,SAAWa,EAAQ,KACnBX,KAAOW,EAAQ,KACfyC,KAAOtE,SAAS6B,EAAQ,GAAI,MAC5BT,KAAOS,EAAQ,IAAM,KACrBN,MAAQM,EAAQ,KAChBJ,SAAWI,EAAQ,GAG1B0C,MAAMhE,EAAW+D,UACTA,KAAOzC,EAAQ,QAIhBhB,OAASgB,EAAQ,IAAMlG,YACvBqF,UAAwC,IAA5B8C,EAAUU,QAAQ,KAAc3C,EAAQ,GAAKlG,YACzDuF,MAAqC,IAA7B4C,EAAUU,QAAQ,MAAe3C,EAAQ,GAAKlG,YACtD2I,KAAOtE,SAAS6B,EAAQ,GAAI,MAC5BT,KAAOS,EAAQ,IAAM,KACrBN,OAAqC,IAA5BuC,EAAUU,QAAQ,KAAc3C,EAAQ,GAAKlG,YACtD8F,UAAwC,IAA5BqC,EAAUU,QAAQ,KAAc3C,EAAQ,GAAKlG,UAGhE4I,MAAMhE,EAAW+D,UACTA,KAAQR,EAAUnD,MAAM,iCAAmCkB,EAAQ,GAAKlG,YAIjF4E,EAAWW,SAEHA,KAAOe,EAAeL,EAAerB,EAAWW,KAAMV,GAAWA,IAIzED,EAAWM,SAAWlF,WAAa4E,EAAWS,WAAarF,WAAa4E,EAAWW,OAASvF,WAAa4E,EAAW+D,OAAS3I,WAAc4E,EAAWa,MAAQb,EAAWgB,QAAU5F,UAE5K4E,EAAWM,SAAWlF,YACrBwI,UAAY,WACb5D,EAAWkB,WAAa9F,YACvBwI,UAAY,aAEZA,UAAY,QANZA,UAAY,gBAUpBJ,EAAQI,WAAmC,WAAtBJ,EAAQI,WAA0BJ,EAAQI,YAAc5D,EAAW4D,cAChF9F,MAAQkC,EAAWlC,OAAS,gBAAkB0F,EAAQI,UAAY,kBAIxEM,GAAgBC,GAASX,EAAQlD,QAAUN,EAAWM,QAAU,IAAI1E,kBAGrE4H,EAAQY,gBAAoBF,GAAkBA,EAAcE,iBAcpCpE,EAAYC,OAdyC,IAE7ED,EAAWW,OAAS6C,EAAQa,YAAeH,GAAiBA,EAAcG,kBAGjE1D,KAAO2D,EAASC,QAAQvE,EAAWW,KAAKlC,QAAQwB,EAASM,YAAalB,GAAazD,eAC7F,MAAO4I,KACG1G,MAAQkC,EAAWlC,OAAS,kEAAoE0G,IAIjFxE,EAAY2D,GAOrCO,GAAiBA,EAAcZ,SACpBA,MAAMtD,EAAYwD,UAGtB1F,MAAQkC,EAAWlC,OAAS,+BAGjCkC,GAGR,QAAAyE,GAA6BzE,EAA0BwD,MAChDvD,IAA4B,IAAhBuD,EAAQC,IAAgBC,EAAeC,EACnDe,WAEF1E,GAAWS,WAAarF,cACjB6D,KAAKe,EAAWS,YAChBxB,KAAK,MAGZe,EAAWW,OAASvF,aAEb6D,KAAKyC,EAAeL,EAAe1B,OAAOK,EAAWW,MAAOV,GAAWA,GAAUxB,QAAQwB,EAAS0B,YAAa,SAACgD,EAAGC,EAAIC,SAAO,IAAMD,GAAMC,EAAK,MAAQA,EAAK,IAAM,OAG9I,gBAApB7E,GAAW+D,MAAgD,gBAApB/D,GAAW+D,SAClD9E,KAAK,OACLA,KAAKU,OAAOK,EAAW+D,QAG3BW,EAAU/J,OAAS+J,EAAU3J,KAAK,IAAMK,UAShD,QAAA0J,GAAkCC,UAC3BnG,MAECmG,EAAMpK,WACRoK,EAAM3E,MAAM4E,KACPD,EAAMtG,QAAQuG,EAAM,QACtB,IAAID,EAAM3E,MAAM6E,MACdF,EAAMtG,QAAQwG,GAAM,SACtB,IAAIF,EAAM3E,MAAM8E,MACdH,EAAMtG,QAAQyG,GAAM,OACrBxJ,UACD,IAAc,MAAVqJ,GAA2B,OAAVA,IACnB,OACF,IACAI,GAAKJ,EAAM3E,MAAMgF,QACnBD,OAKG,IAAIE,OAAM,uCAJVC,GAAIH,EAAG,KACLJ,EAAMnK,MAAM0K,EAAE3K,UACfsE,KAAKqG,SAOR1G,GAAO7D,KAAK,IAGpB,QAAAwK,GAA0BvF,MAA0BwD,GAApD9I,UAAAC,OAAA,GAAAD,UAAA,KAAAU,UAAAV,UAAA,MACOuF,EAAYuD,EAAQC,IAAMC,EAAeC,EACzCe,KAGAR,EAAgBC,GAASX,EAAQlD,QAAUN,EAAWM,QAAU,IAAI1E,kBAGtEsI,GAAiBA,EAAcqB,WAAWrB,EAAcqB,UAAUvF,EAAYwD,GAE9ExD,EAAWW,QAEVV,EAAS0B,YAAYU,KAAKrC,EAAWW,WAKpC,IAAI6C,EAAQa,YAAeH,GAAiBA,EAAcG,iBAGlD1D,KAAS6C,EAAQC,IAAmGa,EAASkB,UAAUxF,EAAWW,MAA3H2D,EAASC,QAAQvE,EAAWW,KAAKlC,QAAQwB,EAASM,YAAalB,GAAazD,eAC7G,MAAO4I,KACG1G,MAAQkC,EAAWlC,OAAS,+CAAkD0F,EAAQC,IAAgB,UAAV,SAAuB,kBAAoBe,IAMzHxE,EAAYC,GAEd,WAAtBuD,EAAQI,WAA0B5D,EAAWM,WACtCrB,KAAKe,EAAWM,UAChBrB,KAAK,SAGVwG,GAAYhB,EAAoBzE,EAAYwD,MAC9CiC,IAAcrK,YACS,WAAtBoI,EAAQI,aACD3E,KAAK,QAGNA,KAAKwG,GAEXzF,EAAWa,MAAsC,MAA9Bb,EAAWa,KAAK6E,OAAO,MACnCzG,KAAK,MAIbe,EAAWa,OAASzF,UAAW,IAC9BkK,GAAItF,EAAWa,IAEd2C,GAAQmC,cAAkBzB,GAAkBA,EAAcyB,iBAC1Db,EAAkBQ,IAGnBG,IAAcrK,cACbkK,EAAE7G,QAAQ,QAAS,WAGdQ,KAAKqG,SAGZtF,GAAWgB,QAAU5F,cACd6D,KAAK,OACLA,KAAKe,EAAWgB,QAGvBhB,EAAWkB,WAAa9F,cACjB6D,KAAK,OACLA,KAAKe,EAAWkB,WAGpBwD,EAAU3J,KAAK,IAGvB,QAAA6K,GAAkCC,EAAoBC,MAAwBtC,GAA9E9I,UAAAC,OAAA,GAAAD,UAAA,KAAAU,UAAAV,UAAA,MAAuGqL,EAAvGrL,UAAA,GACOwB,WAED6J,OACGzC,EAAMiC,EAAUM,EAAMrC,GAAUA,KAC5BF,EAAMiC,EAAUO,EAAUtC,GAAUA,MAEtCA,OAELA,EAAQwC,UAAYF,EAASxF,UAC1BA,OAASwF,EAASxF,SAElBG,SAAWqF,EAASrF,WACpBE,KAAOmF,EAASnF,OAChBoD,KAAO+B,EAAS/B,OAChBlD,KAAOiE,EAAkBgB,EAASjF,MAAQ,MAC1CG,MAAQ8E,EAAS9E,QAEpB8E,EAASrF,WAAarF,WAAa0K,EAASnF,OAASvF,WAAa0K,EAAS/B,OAAS3I,aAEhFqF,SAAWqF,EAASrF,WACpBE,KAAOmF,EAASnF,OAChBoD,KAAO+B,EAAS/B,OAChBlD,KAAOiE,EAAkBgB,EAASjF,MAAQ,MAC1CG,MAAQ8E,EAAS9E,QAEnB8E,EAASjF,MAQmB,MAA5BiF,EAASjF,KAAK6E,OAAO,KACjB7E,KAAOiE,EAAkBgB,EAASjF,OAEpCgF,EAAKpF,WAAarF,WAAayK,EAAKlF,OAASvF,WAAayK,EAAK9B,OAAS3I,WAAeyK,EAAKhF,KAErFgF,EAAKhF,OAGTA,KAAOgF,EAAKhF,KAAKjG,MAAM,EAAGiL,EAAKhF,KAAKoF,YAAY,KAAO,GAAKH,EAASjF,OAFrEA,KAAOiF,EAASjF,OAFhBA,KAAO,IAAMiF,EAASjF,OAMvBA,KAAOiE,EAAkB5I,EAAO2E,SAEjCG,MAAQ8E,EAAS9E,UAnBjBH,KAAOgF,EAAKhF,KACfiF,EAAS9E,QAAU5F,YACf4F,MAAQ8E,EAAS9E,QAEjBA,MAAQ6E,EAAK7E,SAkBfP,SAAWoF,EAAKpF,WAChBE,KAAOkF,EAAKlF,OACZoD,KAAO8B,EAAK9B,QAEbzD,OAASuF,EAAKvF,UAGfY,SAAW4E,EAAS5E,SAEpBhF,EAGR,QAAAgK,GAAwBC,EAAgBC,EAAoB5C,MACrD6C,GAAoBpK,GAASqE,OAAS,QAAUkD,SAC/C+B,GAAUK,EAAkBtC,EAAM6C,EAASE,GAAoB/C,EAAM8C,EAAaC,GAAoBA,GAAmB,GAAOA,GAKxI,QAAAC,GAA0BC,EAAS/C,SACf,gBAAR+C,KACJhB,EAAUjC,EAAMiD,EAAK/C,GAAUA,GACX,WAAhBtI,EAAOqL,OACXjD,EAAMiC,EAAyBgB,EAAK/C,GAAUA,IAG9C+C,EAKR,QAAAC,GAAsBC,EAAUC,EAAUlD,SACrB,gBAATiD,KACHlB,EAAUjC,EAAMmD,EAAMjD,GAAUA,GACZ,WAAjBtI,EAAOuL,OACVlB,EAAyBkB,EAAMjD,IAGnB,gBAATkD,KACHnB,EAAUjC,EAAMoD,EAAMlD,GAAUA,GACZ,WAAjBtI,EAAOwL,OACVnB,EAAyBmB,EAAMlD,IAGhCiD,IAASC,EAGjB,QAAAC,GAAgC1L,EAAYuI,SACpCvI,IAAOA,EAAIM,WAAWkD,QAAU+E,GAAYA,EAAQC,IAA4BC,EAAakD,OAAnCjD,EAAaiD,OAA+B1H,GAG9G,QAAA2H,GAAkC5L,EAAYuI,SACtCvI,IAAOA,EAAIM,WAAWkD,QAAU+E,GAAYA,EAAQC,IAAiCC,EAAanD,YAAxCoD,EAAapD,YAAyClB,GCniBxH,QAAAyH,GAAkBC,SACqB,iBAAxBA,GAAaC,OAAuBD,EAAaC,OAAuD,QAA9CrH,OAAOoH,EAAazG,QAAQ1E,cCwDrG,QAGAsE,GAA0BjF,MACnBkF,GAASd,EAAYpE,SAClBkF,GAAOC,MAAMC,IAAoBF,EAANlF,EJmBrC,GAAA0I,GAAetH,GAAU,GKrFzBqH,EAAerH,GAAU,2iBJAnB4K,EAAS,WAaTC,EAAgB,QAChBC,EAAgB,aAChBzI,EAAkB,4BAGlBT,YACO,8DACC,iEACI,iBAKZmJ,EAAQC,KAAKD,MACbE,EAAqB3H,OAAOC,aAsG5B2H,EAAa,SAAApJ,SAASwB,QAAO6H,cAAPC,MAAA9H,OAAA+H,EAAwBvJ,KAW9CwJ,EAAe,SAASC,SACzBA,GAAY,GAAO,GACfA,EAAY,GAEhBA,EAAY,GAAO,GACfA,EAAY,GAEhBA,EAAY,GAAO,GACfA,EAAY,GAjJR,IAiKPC,EAAe,SAASC,EAAOC,SAG7BD,GAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARC,IAAc,IAQnDC,EAAQ,SAASC,EAAOC,EAAWC,MACpCC,GAAI,QACAD,EAAYf,EAAMa,EA1Kd,KA0K8BA,GAAS,KAC1Cb,EAAMa,EAAQC,GACOD,EAAQI,IAA2BD,GAhLrD,KAiLHhB,EAAMa,EA3JMpC,UA6JduB,GAAMgB,EAAI,GAAsBH,GAASA,EAhLpC,MA0LPK,EAAS,SAASvD,MAEjBnG,MACA2J,EAAcxD,EAAMpK,OACtB4E,EAAI,EACJiJ,EA5LY,IA6LZC,EA9Le,GAoMfC,EAAQ3D,EAAMkB,YAlMD,IAmMbyC,GAAQ,MACH,OAGJ,GAAIC,GAAI,EAAGA,EAAID,IAASC,EAExB5D,EAAMhG,WAAW4J,IAAM,OACpB,eAEA1J,KAAK8F,EAAMhG,WAAW4J,QAMzB,GAAI9F,GAAQ6F,EAAQ,EAAIA,EAAQ,EAAI,EAAG7F,EAAQ0F,GAAwC,KAQtF,GADDK,GAAOrJ,EACFsJ,EAAI,EAAGT,EAjOL,IAiOmCA,GAjOnC,GAiO8C,CAEpDvF,GAAS0F,KACN,oBAGDT,GAAQH,EAAa5C,EAAMhG,WAAW8D,OAExCiF,GAzOM,IAyOWA,EAAQV,GAAOH,EAAS1H,GAAKsJ,OAC3C,eAGFf,EAAQe,KACPC,GAAIV,GAAKK,EA7OL,EA6OoBL,GAAKK,EA5OzB,GAAA,GA4O8CL,EAAIK,KAExDX,EAAQgB,WAINC,GApPI,GAoPgBD,CACtBD,GAAIzB,EAAMH,EAAS8B,MAChB,eAGFA,KAIAC,GAAMpK,EAAOjE,OAAS,IACrBqN,EAAMzI,EAAIqJ,EAAMI,EAAa,GAARJ,GAIxBxB,EAAM7H,EAAIyJ,GAAO/B,EAASuB,KACvB,eAGFpB,EAAM7H,EAAIyJ,MACVA,IAGEC,OAAO1J,IAAK,EAAGiJ,SAIhB7I,QAAO6H,cAAPC,MAAA9H,OAAwBf,IAU1BsK,EAAS,SAASnE,MACjBnG,QAGED,EAAWoG,MAGfwD,GAAcxD,EAAMpK,OAGpB6N,EA5RY,IA6RZP,EAAQ,EACRQ,EA/Re,oCAkSnBU,KAA2BpE,EAA3BqE,OAAAC,cAAAC,GAAAH,EAAAI,EAAAC,QAAAC,MAAAH,GAAA,EAAkC,IAAvBI,GAAuBP,EAAArK,KAC7B4K,GAAe,OACXzK,KAAKqI,EAAmBoC,2FAI7BC,GAAc/K,EAAOjE,OACrBiP,EAAiBD,MAMjBA,KACI1K,KA9SS,KAkTV2K,EAAiBrB,GAAa,IAIhCsB,GAAI5C,mCACR6C,KAA2B/E,EAA3BqE,OAAAC,cAAAU,GAAAD,EAAAE,EAAAR,QAAAC,MAAAM,GAAA,EAAkC,IAAvBL,GAAuBI,EAAAhL,KAC7B4K,IAAgBlB,GAAKkB,EAAeG,MACnCH,0FAMAO,GAAwBL,EAAiB,CAC3CC,GAAIrB,EAAIpB,GAAOH,EAASgB,GAASgC,MAC9B,gBAGGJ,EAAIrB,GAAKyB,IACfJ,uCAEJK,KAA2BnF,EAA3BqE,OAAAC,cAAAc,GAAAD,EAAAE,EAAAZ,QAAAC,MAAAU,GAAA,EAAkC,IAAvBT,GAAuBQ,EAAApL,SAC7B4K,EAAelB,KAAOP,EAAQhB,KAC3B,YAEHyC,GAAgBlB,EAAG,KAGjB,GADD6B,GAAIpC,EACCG,EArVA,IAqV8BA,GArV9B,GAqVyC,IAC3CU,GAAIV,GAAKK,EArVP,EAqVsBL,GAAKK,EApV3B,GAAA,GAoVgDL,EAAIK,KACxD4B,EAAIvB,WAGFwB,GAAUD,EAAIvB,EACdC,EA3VE,GA2VkBD,IACnB7J,KACNqI,EAAmBO,EAAaiB,EAAIwB,EAAUvB,EAAY,OAEvD3B,EAAMkD,EAAUvB,KAGd9J,KAAKqI,EAAmBO,EAAawC,EAAG,OACxCrC,EAAMC,EAAOgC,EAAuBL,GAAkBD,KACrD,IACNC,yFAIF3B,IACAO,QAGI5J,GAAO7D,KAAK,KAcdyK,EAAY,SAAST,SACnBzG,GAAUyG,EAAO,SAASxG,SACzB2I,GAAc7E,KAAK9D,GACvB+J,EAAO/J,EAAO3D,MAAM,GAAGgB,eACvB2C,KAeCgG,EAAU,SAASQ,SACjBzG,GAAUyG,EAAO,SAASxG,SACzB4I,GAAc9E,KAAK9D,GACvB,OAAS2K,EAAO3K,GAChBA,KAOC+F,WAMM,qBASA3F,SACA4I,UAEDe,SACAY,UACC3E,YACEiB,GC5VDrB,KA2IPN,EAAY,kIACZC,EAA4C,GAAI1D,MAAM,SAAU,KAAOhF,UAoHvE4J,EAAO,WACPC,GAAO,cACPC,GAAO,gBAEPE,GAAO,yBI1VPmF,WACI,mBAEI,QAEL,SAAUvK,EAA0BwD,SAEtCxD,GAAWW,SACJ7C,MAAQkC,EAAWlC,OAAS,+BAGjCkC,aAGI,SAAUA,EAA0BwD,MACzCwD,GAAqD,UAA5CrH,OAAOK,EAAWM,QAAQ1E,oBAGrCoE,GAAW+D,QAAUiD,EAAS,IAAM,KAA2B,KAApBhH,EAAW+D,SAC9CA,KAAO3I,WAId4E,EAAWa,SACJA,KAAO,KAOZb,IC9BHuK,WACI,mBACIC,GAAKnG,iBACVmG,GAAKlH,gBACDkH,GAAKjF,WJKZgF,WACI,iBAEI,QAEL,SAAUvK,EAA0BwD,MACrCuD,GAAe/G,WAGRgH,OAASF,EAASC,KAGlB0D,cAAgB1D,EAAalG,MAAQ,MAAQkG,EAAa/F,MAAQ,IAAM+F,EAAa/F,MAAQ,MAC7FH,KAAOzF,YACP4F,MAAQ5F,UAEd2L,aAGI,SAAUA,EAA2BvD,MAE5CuD,EAAahD,QAAU+C,EAASC,GAAgB,IAAM,KAA6B,KAAtBA,EAAahD,SAChEA,KAAO3I,WAIc,iBAAxB2L,GAAaC,WACV1G,OAAUyG,EAAaC,OAAS,MAAQ,OACxCA,OAAS5L,WAInB2L,EAAa0D,aAAc,OACR1D,EAAa0D,aAAahP,MAAM,cAA/CoF,EADuB6J,EAAA,GACjB1J,EADiB0J,EAAA,KAEjB7J,KAAQA,GAAiB,MAATA,EAAeA,EAAOzF,YACtC4F,MAAQA,IACRyJ,aAAerP,mBAIhB8F,SAAW9F,UAEjB2L,IKnDHwD,WACI,iBACII,GAAGtG,iBACRsG,GAAGrH,gBACCqH,GAAGpF,WJSVqF,MAIAlN,GAAe,mGACfnB,GAAW,cACXC,GAAexB,EAAOA,EAAO,sBAA6BuB,GAAWA,GAAW,IAAMA,GAAWA,IAAY,IAAMvB,EAAO,0BAAiCuB,GAAWA,IAAY,IAAMvB,EAAO,IAAMuB,GAAWA,KAehNsO,GAAUxQ,EADA,6DACe,aAqBzBgG,GAAa,GAAI1C,QAAOD,GAAc,KACtC6C,GAAc,GAAI5C,QAAOnB,GAAc,KACvCsO,GAAiB,GAAInN,QAAOtD,EAAM,MAzBxB,wDAyBwC,QAAS,QAASwQ,IAAU,KAE9EE,GAAa,GAAIpN,QAAOtD,EAAM,MAAOqD,GAjBrB,uCAiBmD,KACnEsN,GAAcD,GASdR,WACI,eAED,SAAUvK,EAA0BwD,MACrCyH,GAAmBjL,EACnBkL,EAAKD,EAAiBC,GAAMD,EAAiBpK,KAAOoK,EAAiBpK,KAAKpF,MAAM,aACrEoF,KAAOzF,UAEpB6P,EAAiBjK,MAAO,KAKtB,GAJDmK,IAAiB,EACfC,KACAC,EAAUJ,EAAiBjK,MAAMvF,MAAM,KAEpCX,EAAI,EAAGD,EAAKwQ,EAAQ1Q,OAAQG,EAAID,IAAMC,EAAG,IAC3CwQ,GAASD,EAAQvQ,GAAGW,MAAM,YAExB6P,EAAO,QACT,SAEC,GADCC,GAAUD,EAAO,GAAG7P,MAAM,KACvBX,EAAI,EAAGD,EAAK0Q,EAAQ5Q,OAAQG,EAAID,IAAMC,IAC3CmE,KAAKsM,EAAQzQ,cAGb,YACa0Q,QAAU3E,EAAkByE,EAAO,GAAI9H,aAEpD,SACaiI,KAAO5E,EAAkByE,EAAO,GAAI9H,oBAGpC,IACTqD,EAAkByE,EAAO,GAAI9H,IAAYqD,EAAkByE,EAAO,GAAI9H,IAK7E2H,IAAgBF,EAAiBG,QAAUA,KAG/BpK,MAAQ5F,cAEpB,GAAIN,GAAI,EAAGD,EAAKqQ,EAAGvQ,OAAQG,EAAID,IAAMC,EAAG,IACtC4Q,GAAOR,EAAGpQ,GAAGW,MAAM,UAEpB,GAAKoL,EAAkB6E,EAAK,IAE5BlI,EAAQY,iBAQP,GAAKyC,EAAkB6E,EAAK,GAAIlI,GAAS5H,yBALxC,GAAK0I,EAASC,QAAQsC,EAAkB6E,EAAK,GAAIlI,GAAS5H,eAC9D,MAAO4I,KACS1G,MAAQmN,EAAiBnN,OAAS,2EAA6E0G,IAM/H1J,GAAK4Q,EAAK3Q,KAAK,WAGZkQ,cAGI,SAAUA,EAAmCzH,MAClDxD,GAAaiL,EACbC,EAAKpP,EAAQmP,EAAiBC,OAChCA,EAAI,KACF,GAAIpQ,GAAI,EAAGD,EAAKqQ,EAAGvQ,OAAQG,EAAID,IAAMC,EAAG,IACtC6Q,GAAShM,OAAOuL,EAAGpQ,IACnB8Q,EAAQD,EAAO1F,YAAY,KAC3B4F,EAAaF,EAAO/Q,MAAM,EAAGgR,GAAQnN,QAAQ8B,GAAaL,GAAkBzB,QAAQ8B,GAAa1E,GAAa4C,QAAQqM,GAAgB5L,GACxI4M,EAASH,EAAO/Q,MAAMgR,EAAQ,SAItBpI,EAAQC,IAA2Ea,EAASkB,UAAUsG,GAAxFxH,EAASC,QAAQsC,EAAkBiF,EAAQtI,GAAS5H,eAC5E,MAAO4I,KACG1G,MAAQkC,EAAWlC,OAAS,wDAA2D0F,EAAQC,IAAgB,UAAV,SAAuB,kBAAoBe,IAGzJ1J,GAAK+Q,EAAY,IAAMC,IAGhBjL,KAAOqK,EAAGnQ,KAAK,QAGrBqQ,GAAUH,EAAiBG,QAAUH,EAAiBG,WAExDH,GAAiBO,UAASJ,EAAA,QAAqBH,EAAiBO,SAChEP,EAAiBQ,OAAML,EAAA,KAAkBH,EAAiBQ,SAExDjJ,UACD,GAAMuJ,KAAQX,GACdA,EAAQW,KAAUnB,GAAEmB,MAChB9M,KACN8M,EAAKtN,QAAQ8B,GAAaL,GAAkBzB,QAAQ8B,GAAa1E,GAAa4C,QAAQsM,GAAY7L,GAClG,IACAkM,EAAQW,GAAMtN,QAAQ8B,GAAaL,GAAkBzB,QAAQ8B,GAAa1E,GAAa4C,QAAQuM,GAAa9L,UAI3GsD,GAAO7H,WACCqG,MAAQwB,EAAOzH,KAAK,MAGzBiF,IK/JHgM,GAAY,kBAIZzB,WACI,YAED,SAAUvK,EAA0BwD,MACrClC,GAAUtB,EAAWa,MAAQb,EAAWa,KAAKT,MAAM4L,IACrDC,EAAgBjM,KAEhBsB,EAAS,IACNhB,GAASkD,EAAQlD,QAAU2L,EAAc3L,QAAU,MACnD4L,EAAM5K,EAAQ,GAAG1F,cACjBuQ,EAAM7K,EAAQ,GACd8K,EAAe9L,EAAf,KAAyBkD,EAAQ0I,KAAOA,GACxChI,EAAgBC,EAAQiI,KAEhBF,IAAMA,IACNC,IAAMA,IACNtL,KAAOzF,UAEjB8I,MACaA,EAAcZ,MAAM2I,EAAezI,WAGtC1F,MAAQmO,EAAcnO,OAAS,+BAGvCmO,cAGI,SAAUA,EAA6BzI,MAC5ClD,GAASkD,EAAQlD,QAAU2L,EAAc3L,QAAU,MACnD4L,EAAMD,EAAcC,IACpBE,EAAe9L,EAAf,KAAyBkD,EAAQ0I,KAAOA,GACxChI,EAAgBC,EAAQiI,EAE1BlI,OACaA,EAAcqB,UAAU0G,EAAezI,OAGlD6I,GAAgBJ,EAChBE,EAAMF,EAAcE,aACZtL,MAAUqL,GAAO1I,EAAQ0I,KAAvC,IAA8CC,EAEvCE,ICxDHC,GAAO,2DAIP/B,WACI,iBAED,SAAU0B,EAA6BzI,MACxC+I,GAAiBN,WACRO,KAAOD,EAAeJ,MACtBA,IAAM/Q,UAEhBoI,EAAQwC,UAAcuG,EAAeC,MAASD,EAAeC,KAAKpM,MAAMkM,QAC7DxO,MAAQyO,EAAezO,OAAS,sBAGzCyO,aAGI,SAAUA,EAA+B/I,MAC9CyI,GAAgBM,WAERJ,KAAOI,EAAeC,MAAQ,IAAI5Q,cACzCqQ,GC5BT9H,GAAQqG,GAAKlK,QAAUkK,GAEvBrG,EACQsI,GAAMnM,QAAUmM,GAExBtI,EACQwG,GAAGrK,QAAUqK,GAErBxG,EACQuI,GAAIpM,QAAUoM,GAEtBvI,EACQwI,GAAOrM,QAAUqM,GAEzBxI,EACQyI,GAAItM,QAAUsM,GAEtBzI,EACQqI,GAAKlM,QAAUkM","file":"dist/es5/uri.all.min.js","sourcesContent":["export function merge(...sets:Array<string>):string {\n\tif (sets.length > 1) {\n\t\tsets[0] = sets[0].slice(0, -1);\n\t\tconst xl = sets.length - 1;\n\t\tfor (let x = 1; x < xl; ++x) {\n\t\t\tsets[x] = sets[x].slice(1, -1);\n\t\t}\n\t\tsets[xl] = sets[xl].slice(1);\n\t\treturn sets.join('');\n\t} else {\n\t\treturn sets[0];\n\t}\n}\n\nexport function subexp(str:string):string {\n\treturn \"(?:\" + str + \")\";\n}\n\nexport function typeOf(o:any):string {\n\treturn o === undefined ? \"undefined\" : (o === null ? \"null\" : Object.prototype.toString.call(o).split(\" \").pop().split(\"]\").shift().toLowerCase());\n}\n\nexport function toUpperCase(str:string):string {\n\treturn str.toUpperCase();\n}\n\nexport function toArray(obj:any):Array<any> {\n\treturn obj !== undefined && obj !== null ? (obj instanceof Array ? obj : (typeof obj.length !== \"number\" || obj.split || obj.setInterval || obj.call ? [obj] : Array.prototype.slice.call(obj))) : [];\n}\n\n\nexport function assign(target: object, source: any): any {\n\tconst obj = target as any;\n\tif (source) {\n\t\tfor (const key in source) {\n\t\t\tobj[key] = source[key];\n\t\t}\n\t}\n\treturn obj;\n}","import { URIRegExps } from \"./uri\";\nimport { merge, subexp } from \"./util\";\n\nexport function buildExps(isIRI:boolean):URIRegExps {\n\tconst\n\t\tALPHA$$ = \"[A-Za-z]\",\n\t\tCR$ = \"[\\\\x0D]\",\n\t\tDIGIT$$ = \"[0-9]\",\n\t\tDQUOTE$$ = \"[\\\\x22]\",\n\t\tHEXDIG$$ = merge(DIGIT$$, \"[A-Fa-f]\"),  //case-insensitive\n\t\tLF$$ = \"[\\\\x0A]\",\n\t\tSP$$ = \"[\\\\x20]\",\n\t\tPCT_ENCODED$ = subexp(subexp(\"%[EFef]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%[89A-Fa-f]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%\" + HEXDIG$$ + HEXDIG$$)),  //expanded\n\t\tGEN_DELIMS$$ = \"[\\\\:\\\\/\\\\?\\\\#\\\\[\\\\]\\\\@]\",\n\t\tSUB_DELIMS$$ = \"[\\\\!\\\\$\\\\&\\\\'\\\\(\\\\)\\\\*\\\\+\\\\,\\\\;\\\\=]\",\n\t\tRESERVED$$ = merge(GEN_DELIMS$$, SUB_DELIMS$$),\n\t\tUCSCHAR$$ = isIRI ? \"[\\\\xA0-\\\\u200D\\\\u2010-\\\\u2029\\\\u202F-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFEF]\" : \"[]\",  //subset, excludes bidi control characters\n\t\tIPRIVATE$$ = isIRI ? \"[\\\\uE000-\\\\uF8FF]\" : \"[]\",  //subset\n\t\tUNRESERVED$$ = merge(ALPHA$$, DIGIT$$, \"[\\\\-\\\\.\\\\_\\\\~]\", UCSCHAR$$),\n\t\tSCHEME$ = subexp(ALPHA$$ + merge(ALPHA$$, DIGIT$$, \"[\\\\+\\\\-\\\\.]\") + \"*\"),\n\t\tUSERINFO$ = subexp(subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:]\")) + \"*\"),\n\t\tDEC_OCTET$ = subexp(subexp(\"25[0-5]\") + \"|\" + subexp(\"2[0-4]\" + DIGIT$$) + \"|\" + subexp(\"1\" + DIGIT$$ + DIGIT$$) + \"|\" + subexp(\"[1-9]\" + DIGIT$$) + \"|\" + DIGIT$$),\n\t\tDEC_OCTET_RELAXED$ = subexp(subexp(\"25[0-5]\") + \"|\" + subexp(\"2[0-4]\" + DIGIT$$) + \"|\" + subexp(\"1\" + DIGIT$$ + DIGIT$$) + \"|\" + subexp(\"0?[1-9]\" + DIGIT$$) + \"|0?0?\" + DIGIT$$),  //relaxed parsing rules\n\t\tIPV4ADDRESS$ = subexp(DEC_OCTET_RELAXED$ + \"\\\\.\" + DEC_OCTET_RELAXED$ + \"\\\\.\" + DEC_OCTET_RELAXED$ + \"\\\\.\" + DEC_OCTET_RELAXED$),\n\t\tH16$ = subexp(HEXDIG$$ + \"{1,4}\"),\n\t\tLS32$ = subexp(subexp(H16$ + \"\\\\:\" + H16$) + \"|\" + IPV4ADDRESS$),\n\t\tIPV6ADDRESS1$ = subexp(                                                            subexp(H16$ + \"\\\\:\") + \"{6}\" + LS32$), //                           6( h16 \":\" ) ls32\n\t\tIPV6ADDRESS2$ = subexp(                                                 \"\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{5}\" + LS32$), //                      \"::\" 5( h16 \":\" ) ls32\n\t\tIPV6ADDRESS3$ = subexp(subexp(                                 H16$) + \"?\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{4}\" + LS32$), //[               h16 ] \"::\" 4( h16 \":\" ) ls32\n\t\tIPV6ADDRESS4$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,1}\" + H16$) + \"?\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{3}\" + LS32$), //[ *1( h16 \":\" ) h16 ] \"::\" 3( h16 \":\" ) ls32\n\t\tIPV6ADDRESS5$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,2}\" + H16$) + \"?\\\\:\\\\:\" + subexp(H16$ + \"\\\\:\") + \"{2}\" + LS32$), //[ *2( h16 \":\" ) h16 ] \"::\" 2( h16 \":\" ) ls32\n\t\tIPV6ADDRESS6$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,3}\" + H16$) + \"?\\\\:\\\\:\" +        H16$ + \"\\\\:\"          + LS32$), //[ *3( h16 \":\" ) h16 ] \"::\"    h16 \":\"   ls32\n\t\tIPV6ADDRESS7$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,4}\" + H16$) + \"?\\\\:\\\\:\"                                + LS32$), //[ *4( h16 \":\" ) h16 ] \"::\"              ls32\n\t\tIPV6ADDRESS8$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,5}\" + H16$) + \"?\\\\:\\\\:\"                                + H16$ ), //[ *5( h16 \":\" ) h16 ] \"::\"              h16\n\t\tIPV6ADDRESS9$ = subexp(subexp(subexp(H16$ + \"\\\\:\") + \"{0,6}\" + H16$) + \"?\\\\:\\\\:\"                                       ), //[ *6( h16 \":\" ) h16 ] \"::\"\n\t\tIPV6ADDRESS$ = subexp([IPV6ADDRESS1$, IPV6ADDRESS2$, IPV6ADDRESS3$, IPV6ADDRESS4$, IPV6ADDRESS5$, IPV6ADDRESS6$, IPV6ADDRESS7$, IPV6ADDRESS8$, IPV6ADDRESS9$].join(\"|\")),\n\t\tZONEID$ = subexp(subexp(UNRESERVED$$ + \"|\" + PCT_ENCODED$) + \"+\"),  //RFC 6874\n\t\tIPV6ADDRZ$ = subexp(IPV6ADDRESS$ + \"\\\\%25\" + ZONEID$),  //RFC 6874\n\t\tIPV6ADDRZ_RELAXED$ = subexp(IPV6ADDRESS$ + subexp(\"\\\\%25|\\\\%(?!\" + HEXDIG$$ + \"{2})\") + ZONEID$),  //RFC 6874, with relaxed parsing rules\n\t\tIPVFUTURE$ = subexp(\"[vV]\" + HEXDIG$$ + \"+\\\\.\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:]\") + \"+\"),\n\t\tIP_LITERAL$ = subexp(\"\\\\[\" + subexp(IPV6ADDRZ_RELAXED$ + \"|\" + IPV6ADDRESS$ + \"|\" + IPVFUTURE$) + \"\\\\]\"),  //RFC 6874\n\t\tREG_NAME$ = subexp(subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$)) + \"*\"),\n\t\tHOST$ = subexp(IP_LITERAL$ + \"|\" + IPV4ADDRESS$ + \"(?!\" + REG_NAME$ + \")\" + \"|\" + REG_NAME$),\n\t\tPORT$ = subexp(DIGIT$$ + \"*\"),\n\t\tAUTHORITY$ = subexp(subexp(USERINFO$ + \"@\") + \"?\" + HOST$ + subexp(\"\\\\:\" + PORT$) + \"?\"),\n\t\tPCHAR$ = subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:\\\\@]\")),\n\t\tSEGMENT$ = subexp(PCHAR$ + \"*\"),\n\t\tSEGMENT_NZ$ = subexp(PCHAR$ + \"+\"),\n\t\tSEGMENT_NZ_NC$ = subexp(subexp(PCT_ENCODED$ + \"|\" + merge(UNRESERVED$$, SUB_DELIMS$$, \"[\\\\@]\")) + \"+\"),\n\t\tPATH_ABEMPTY$ = subexp(subexp(\"\\\\/\" + SEGMENT$) + \"*\"),\n\t\tPATH_ABSOLUTE$ = subexp(\"\\\\/\" + subexp(SEGMENT_NZ$ + PATH_ABEMPTY$) + \"?\"),  //simplified\n\t\tPATH_NOSCHEME$ = subexp(SEGMENT_NZ_NC$ + PATH_ABEMPTY$),  //simplified\n\t\tPATH_ROOTLESS$ = subexp(SEGMENT_NZ$ + PATH_ABEMPTY$),  //simplified\n\t\tPATH_EMPTY$ = \"(?!\" + PCHAR$ + \")\",\n\t\tPATH$ = subexp(PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_NOSCHEME$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$),\n\t\tQUERY$ = subexp(subexp(PCHAR$ + \"|\" + merge(\"[\\\\/\\\\?]\", IPRIVATE$$)) + \"*\"),\n\t\tFRAGMENT$ = subexp(subexp(PCHAR$ + \"|[\\\\/\\\\?]\") + \"*\"),\n\t\tHIER_PART$ = subexp(subexp(\"\\\\/\\\\/\" + AUTHORITY$ + PATH_ABEMPTY$) + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$),\n\t\tURI$ = subexp(SCHEME$ + \"\\\\:\" + HIER_PART$ + subexp(\"\\\\?\" + QUERY$) + \"?\" + subexp(\"\\\\#\" + FRAGMENT$) + \"?\"),\n\t\tRELATIVE_PART$ = subexp(subexp(\"\\\\/\\\\/\" + AUTHORITY$ + PATH_ABEMPTY$) + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_NOSCHEME$ + \"|\" + PATH_EMPTY$),\n\t\tRELATIVE$ = subexp(RELATIVE_PART$ + subexp(\"\\\\?\" + QUERY$) + \"?\" + subexp(\"\\\\#\" + FRAGMENT$) + \"?\"),\n\t\tURI_REFERENCE$ = subexp(URI$ + \"|\" + RELATIVE$),\n\t\tABSOLUTE_URI$ = subexp(SCHEME$ + \"\\\\:\" + HIER_PART$ + subexp(\"\\\\?\" + QUERY$) + \"?\"),\n\n\t\tGENERIC_REF$ = \"^(\" + SCHEME$ + \")\\\\:\" + subexp(subexp(\"\\\\/\\\\/(\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?)\") + \"?(\" + PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$ + \")\") + subexp(\"\\\\?(\" + QUERY$ + \")\") + \"?\" + subexp(\"\\\\#(\" + FRAGMENT$ + \")\") + \"?$\",\n\t\tRELATIVE_REF$ = \"^(){0}\" + subexp(subexp(\"\\\\/\\\\/(\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?)\") + \"?(\" + PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_NOSCHEME$ + \"|\" + PATH_EMPTY$ + \")\") + subexp(\"\\\\?(\" + QUERY$ + \")\") + \"?\" + subexp(\"\\\\#(\" + FRAGMENT$ + \")\") + \"?$\",\n\t\tABSOLUTE_REF$ = \"^(\" + SCHEME$ + \")\\\\:\" + subexp(subexp(\"\\\\/\\\\/(\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?)\") + \"?(\" + PATH_ABEMPTY$ + \"|\" + PATH_ABSOLUTE$ + \"|\" + PATH_ROOTLESS$ + \"|\" + PATH_EMPTY$ + \")\") + subexp(\"\\\\?(\" + QUERY$ + \")\") + \"?$\",\n\t\tSAMEDOC_REF$ = \"^\" + subexp(\"\\\\#(\" + FRAGMENT$ + \")\") + \"?$\",\n\t\tAUTHORITY_REF$ = \"^\" + subexp(\"(\" + USERINFO$ + \")@\") + \"?(\" + HOST$ + \")\" + subexp(\"\\\\:(\" + PORT$ + \")\") + \"?$\"\n\t;\n\n\treturn {\n\t\tNOT_SCHEME : new RegExp(merge(\"[^]\", ALPHA$$, DIGIT$$, \"[\\\\+\\\\-\\\\.]\"), \"g\"),\n\t\tNOT_USERINFO : new RegExp(merge(\"[^\\\\%\\\\:]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_HOST : new RegExp(merge(\"[^\\\\%\\\\[\\\\]\\\\:]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_PATH : new RegExp(merge(\"[^\\\\%\\\\/\\\\:\\\\@]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_PATH_NOSCHEME : new RegExp(merge(\"[^\\\\%\\\\/\\\\@]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tNOT_QUERY : new RegExp(merge(\"[^\\\\%]\", UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:\\\\@\\\\/\\\\?]\", IPRIVATE$$), \"g\"),\n\t\tNOT_FRAGMENT : new RegExp(merge(\"[^\\\\%]\", UNRESERVED$$, SUB_DELIMS$$, \"[\\\\:\\\\@\\\\/\\\\?]\"), \"g\"),\n\t\tESCAPE : new RegExp(merge(\"[^]\", UNRESERVED$$, SUB_DELIMS$$), \"g\"),\n\t\tUNRESERVED : new RegExp(UNRESERVED$$, \"g\"),\n\t\tOTHER_CHARS : new RegExp(merge(\"[^\\\\%]\", UNRESERVED$$, RESERVED$$), \"g\"),\n\t\tPCT_ENCODED : new RegExp(PCT_ENCODED$, \"g\"),\n\t\tIPV4ADDRESS : new RegExp(\"^(\" + IPV4ADDRESS$ + \")$\"),\n\t\tIPV6ADDRESS : new RegExp(\"^\\\\[?(\" + IPV6ADDRESS$ + \")\" + subexp(subexp(\"\\\\%25|\\\\%(?!\" + HEXDIG$$ + \"{2})\") + \"(\" + ZONEID$ + \")\") + \"?\\\\]?$\")  //RFC 6874, with relaxed parsing rules\n\t};\n}\n\nexport default buildExps(false);\n","'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7E]/; // non-ASCII chars\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n\t'overflow': 'Overflow: input needs wider integers to process',\n\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n\tthrow new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, fn) {\n\tconst result = [];\n\tlet length = array.length;\n\twhile (length--) {\n\t\tresult[length] = fn(array[length]);\n\t}\n\treturn result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {Array} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(string, fn) {\n\tconst parts = string.split('@');\n\tlet result = '';\n\tif (parts.length > 1) {\n\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t// the local part (i.e. everything up to `@`) intact.\n\t\tresult = parts[0] + '@';\n\t\tstring = parts[1];\n\t}\n\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\tstring = string.replace(regexSeparators, '\\x2E');\n\tconst labels = string.split('.');\n\tconst encoded = map(labels, fn).join('.');\n\treturn result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n\tconst output = [];\n\tlet counter = 0;\n\tconst length = string.length;\n\twhile (counter < length) {\n\t\tconst value = string.charCodeAt(counter++);\n\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t// It's a high surrogate, and there is a next character.\n\t\t\tconst extra = string.charCodeAt(counter++);\n\t\t\tif ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t} else {\n\t\t\t\t// It's an unmatched surrogate; only append this code unit, in case the\n\t\t\t\t// next code unit is the high surrogate of a surrogate pair.\n\t\t\t\toutput.push(value);\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t} else {\n\t\t\toutput.push(value);\n\t\t}\n\t}\n\treturn output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = array => String.fromCodePoint(...array);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n\tif (codePoint - 0x30 < 0x0A) {\n\t\treturn codePoint - 0x16;\n\t}\n\tif (codePoint - 0x41 < 0x1A) {\n\t\treturn codePoint - 0x41;\n\t}\n\tif (codePoint - 0x61 < 0x1A) {\n\t\treturn codePoint - 0x61;\n\t}\n\treturn base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n\t//  0..25 map to ASCII a..z or A..Z\n\t// 26..35 map to ASCII 0..9\n\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n\tlet k = 0;\n\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\tdelta += floor(delta / numPoints);\n\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\tdelta = floor(delta / baseMinusTMin);\n\t}\n\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n\t// Don't use UCS-2.\n\tconst output = [];\n\tconst inputLength = input.length;\n\tlet i = 0;\n\tlet n = initialN;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points: let `basic` be the number of input code\n\t// points before the last delimiter, or `0` if there is none, then copy\n\t// the first basic code points to the output.\n\n\tlet basic = input.lastIndexOf(delimiter);\n\tif (basic < 0) {\n\t\tbasic = 0;\n\t}\n\n\tfor (let j = 0; j < basic; ++j) {\n\t\t// if it's not a basic code point\n\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\terror('not-basic');\n\t\t}\n\t\toutput.push(input.charCodeAt(j));\n\t}\n\n\t// Main decoding loop: start just after the last delimiter if any basic code\n\t// points were copied; start at the beginning otherwise.\n\n\tfor (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t// `index` is the index of the next character to be consumed.\n\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t// which gets added to `i`. The overflow checking is easier\n\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t// value at the end to obtain `delta`.\n\t\tlet oldi = i;\n\t\tfor (let w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\tif (index >= inputLength) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\n\t\t\tconst digit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\ti += digit * w;\n\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\tif (digit < t) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst baseMinusT = base - t;\n\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tw *= baseMinusT;\n\n\t\t}\n\n\t\tconst out = output.length + 1;\n\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t// incrementing `n` each time, so we'll fix that now:\n\t\tif (floor(i / out) > maxInt - n) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tn += floor(i / out);\n\t\ti %= out;\n\n\t\t// Insert `n` at position `i` of the output.\n\t\toutput.splice(i++, 0, n);\n\n\t}\n\n\treturn String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n\tconst output = [];\n\n\t// Convert the input in UCS-2 to an array of Unicode code points.\n\tinput = ucs2decode(input);\n\n\t// Cache the length.\n\tlet inputLength = input.length;\n\n\t// Initialize the state.\n\tlet n = initialN;\n\tlet delta = 0;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points.\n\tfor (const currentValue of input) {\n\t\tif (currentValue < 0x80) {\n\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t}\n\t}\n\n\tlet basicLength = output.length;\n\tlet handledCPCount = basicLength;\n\n\t// `handledCPCount` is the number of code points that have been handled;\n\t// `basicLength` is the number of basic code points.\n\n\t// Finish the basic string with a delimiter unless it's empty.\n\tif (basicLength) {\n\t\toutput.push(delimiter);\n\t}\n\n\t// Main encoding loop:\n\twhile (handledCPCount < inputLength) {\n\n\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t// larger one:\n\t\tlet m = maxInt;\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\tm = currentValue;\n\t\t\t}\n\t\t}\n\n\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t// but guard against overflow.\n\t\tconst handledCPCountPlusOne = handledCPCount + 1;\n\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\tn = m;\n\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\t\t\tif (currentValue == n) {\n\t\t\t\t// Represent delta as a generalized variable-length integer.\n\t\t\t\tlet q = delta;\n\t\t\t\tfor (let k = base; /* no condition */; k += base) {\n\t\t\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst qMinusT = q - t;\n\t\t\t\t\tconst baseMinusT = base - t;\n\t\t\t\t\toutput.push(\n\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t);\n\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t}\n\n\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\tdelta = 0;\n\t\t\t\t++handledCPCount;\n\t\t\t}\n\t\t}\n\n\t\t++delta;\n\t\t++n;\n\n\t}\n\treturn output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexPunycode.test(string)\n\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t: string;\n\t});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexNonASCII.test(string)\n\t\t\t? 'xn--' + encode(string)\n\t\t\t: string;\n\t});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n\t/**\n\t * A string representing the current Punycode.js version number.\n\t * @memberOf punycode\n\t * @type String\n\t */\n\t'version': '2.1.0',\n\t/**\n\t * An object of methods to convert from JavaScript's internal character\n\t * representation (UCS-2) to Unicode code points, and back.\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode\n\t * @type Object\n\t */\n\t'ucs2': {\n\t\t'decode': ucs2decode,\n\t\t'encode': ucs2encode\n\t},\n\t'decode': decode,\n\t'encode': encode,\n\t'toASCII': toASCII,\n\t'toUnicode': toUnicode\n};\n\nexport default punycode;\n","/**\n * URI.js\n *\n * @fileoverview An RFC 3986 compliant, scheme extendable URI parsing/validating/resolving library for JavaScript.\n * @author <a href=\"mailto:gary.court@gmail.com\">Gary Court</a>\n * @see http://github.com/garycourt/uri-js\n */\n\n/**\n * Copyright 2011 Gary Court. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are\n * permitted provided that the following conditions are met:\n *\n *    1. Redistributions of source code must retain the above copyright notice, this list of\n *       conditions and the following disclaimer.\n *\n *    2. Redistributions in binary form must reproduce the above copyright notice, this list\n *       of conditions and the following disclaimer in the documentation and/or other materials\n *       provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY GARY COURT ``AS IS'' AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GARY COURT OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * The views and conclusions contained in the software and documentation are those of the\n * authors and should not be interpreted as representing official policies, either expressed\n * or implied, of Gary Court.\n */\n\nimport URI_PROTOCOL from \"./regexps-uri\";\nimport IRI_PROTOCOL from \"./regexps-iri\";\nimport punycode from \"punycode\";\nimport { toUpperCase, typeOf, assign } from \"./util\";\n\nexport interface URIComponents {\n\tscheme?:string;\n\tuserinfo?:string;\n\thost?:string;\n\tport?:number|string;\n\tpath?:string;\n\tquery?:string;\n\tfragment?:string;\n\treference?:string;\n\terror?:string;\n}\n\nexport interface URIOptions {\n\tscheme?:string;\n\treference?:string;\n\ttolerant?:boolean;\n\tabsolutePath?:boolean;\n\tiri?:boolean;\n\tunicodeSupport?:boolean;\n\tdomainHost?:boolean;\n}\n\nexport interface URISchemeHandler<Components extends URIComponents = URIComponents, Options extends URIOptions = URIOptions, ParentComponents extends URIComponents = URIComponents> {\n\tscheme:string;\n\tparse(components:ParentComponents, options:Options):Components;\n\tserialize(components:Components, options:Options):ParentComponents;\n\tunicodeSupport?:boolean;\n\tdomainHost?:boolean;\n\tabsolutePath?:boolean;\n}\n\nexport interface URIRegExps {\n\tNOT_SCHEME : RegExp,\n\tNOT_USERINFO : RegExp,\n\tNOT_HOST : RegExp,\n\tNOT_PATH : RegExp,\n\tNOT_PATH_NOSCHEME : RegExp,\n\tNOT_QUERY : RegExp,\n\tNOT_FRAGMENT : RegExp,\n\tESCAPE : RegExp,\n\tUNRESERVED : RegExp,\n\tOTHER_CHARS : RegExp,\n\tPCT_ENCODED : RegExp,\n\tIPV4ADDRESS : RegExp,\n\tIPV6ADDRESS : RegExp,\n}\n\nexport const SCHEMES:{[scheme:string]:URISchemeHandler} = {};\n\nexport function pctEncChar(chr:string):string {\n\tconst c = chr.charCodeAt(0);\n\tlet e:string;\n\n\tif (c < 16) e = \"%0\" + c.toString(16).toUpperCase();\n\telse if (c < 128) e = \"%\" + c.toString(16).toUpperCase();\n\telse if (c < 2048) e = \"%\" + ((c >> 6) | 192).toString(16).toUpperCase() + \"%\" + ((c & 63) | 128).toString(16).toUpperCase();\n\telse e = \"%\" + ((c >> 12) | 224).toString(16).toUpperCase() + \"%\" + (((c >> 6) & 63) | 128).toString(16).toUpperCase() + \"%\" + ((c & 63) | 128).toString(16).toUpperCase();\n\n\treturn e;\n}\n\nexport function pctDecChars(str:string):string {\n\tlet newStr = \"\";\n\tlet i = 0;\n\tconst il = str.length;\n\n\twhile (i < il) {\n\t\tconst c = parseInt(str.substr(i + 1, 2), 16);\n\n\t\tif (c < 128) {\n\t\t\tnewStr += String.fromCharCode(c);\n\t\t\ti += 3;\n\t\t}\n\t\telse if (c >= 194 && c < 224) {\n\t\t\tif ((il - i) >= 6) {\n\t\t\t\tconst c2 = parseInt(str.substr(i + 4, 2), 16);\n\t\t\t\tnewStr += String.fromCharCode(((c & 31) << 6) | (c2 & 63));\n\t\t\t} else {\n\t\t\t\tnewStr += str.substr(i, 6);\n\t\t\t}\n\t\t\ti += 6;\n\t\t}\n\t\telse if (c >= 224) {\n\t\t\tif ((il - i) >= 9) {\n\t\t\t\tconst c2 = parseInt(str.substr(i + 4, 2), 16);\n\t\t\t\tconst c3 = parseInt(str.substr(i + 7, 2), 16);\n\t\t\t\tnewStr += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));\n\t\t\t} else {\n\t\t\t\tnewStr += str.substr(i, 9);\n\t\t\t}\n\t\t\ti += 9;\n\t\t}\n\t\telse {\n\t\t\tnewStr += str.substr(i, 3);\n\t\t\ti += 3;\n\t\t}\n\t}\n\n\treturn newStr;\n}\n\nfunction _normalizeComponentEncoding(components:URIComponents, protocol:URIRegExps) {\n\tfunction decodeUnreserved(str:string):string {\n\t\tconst decStr = pctDecChars(str);\n\t\treturn (!decStr.match(protocol.UNRESERVED) ? str : decStr);\n\t}\n\n\tif (components.scheme) components.scheme = String(components.scheme).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_SCHEME, \"\");\n\tif (components.userinfo !== undefined) components.userinfo = String(components.userinfo).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_USERINFO, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.host !== undefined) components.host = String(components.host).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_HOST, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.path !== undefined) components.path = String(components.path).replace(protocol.PCT_ENCODED, decodeUnreserved).replace((components.scheme ? protocol.NOT_PATH : protocol.NOT_PATH_NOSCHEME), pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.query !== undefined) components.query = String(components.query).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_QUERY, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\tif (components.fragment !== undefined) components.fragment = String(components.fragment).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_FRAGMENT, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);\n\n\treturn components;\n};\n\nfunction _stripLeadingZeros(str:string):string {\n\treturn str.replace(/^0*(.*)/, \"$1\") || \"0\";\n}\n\nfunction _normalizeIPv4(host:string, protocol:URIRegExps):string {\n\tconst matches = host.match(protocol.IPV4ADDRESS) || [];\n\tconst [, address] = matches;\n\t\n\tif (address) {\n\t\treturn address.split(\".\").map(_stripLeadingZeros).join(\".\");\n\t} else {\n\t\treturn host;\n\t}\n}\n\nfunction _normalizeIPv6(host:string, protocol:URIRegExps):string {\n\tconst matches = host.match(protocol.IPV6ADDRESS) || [];\n\tconst [, address, zone] = matches;\n\n\tif (address) {\n\t\tconst [last, first] = address.toLowerCase().split('::').reverse();\n\t\tconst firstFields = first ? first.split(\":\").map(_stripLeadingZeros) : [];\n\t\tconst lastFields = last.split(\":\").map(_stripLeadingZeros);\n\t\tconst isLastFieldIPv4Address = protocol.IPV4ADDRESS.test(lastFields[lastFields.length - 1]);\n\t\tconst fieldCount = isLastFieldIPv4Address ? 7 : 8;\n\t\tconst lastFieldsStart = lastFields.length - fieldCount;\n\t\tconst fields = Array<string>(fieldCount);\n\n\t\tfor (let x = 0; x < fieldCount; ++x) {\n\t\t\tfields[x] = firstFields[x] || lastFields[lastFieldsStart + x] || '';\n\t\t}\n\n\t\tif (isLastFieldIPv4Address) {\n\t\t\tfields[fieldCount - 1] = _normalizeIPv4(fields[fieldCount - 1], protocol);\n\t\t}\n\n\t\tconst allZeroFields = fields.reduce<Array<{index:number,length:number}>>((acc, field, index) => {\n\t\t\tif (!field || field === \"0\") {\n\t\t\t\tconst lastLongest = acc[acc.length - 1];\n\t\t\t\tif (lastLongest && lastLongest.index + lastLongest.length === index) {\n\t\t\t\t\tlastLongest.length++;\n\t\t\t\t} else {\n\t\t\t\t\tacc.push({ index, length : 1 });\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn acc;\n\t\t}, []);\n\n\t\tconst longestZeroFields = allZeroFields.sort((a, b) => b.length - a.length)[0];\n\n\t\tlet newHost:string;\n\t\tif (longestZeroFields && longestZeroFields.length > 1) {\n\t\t\tconst newFirst = fields.slice(0, longestZeroFields.index) ;\n\t\t\tconst newLast = fields.slice(longestZeroFields.index + longestZeroFields.length);\n\t\t\tnewHost = newFirst.join(\":\") + \"::\" + newLast.join(\":\");\n\t\t} else {\n\t\t\tnewHost = fields.join(\":\");\n\t\t}\n\n\t\tif (zone) {\n\t\t\tnewHost += \"%\" + zone;\n\t\t}\n\n\t\treturn newHost;\n\t} else {\n\t\treturn host;\n\t}\n}\n\nconst URI_PARSE = /^(?:([^:\\/?#]+):)?(?:\\/\\/((?:([^\\/?#@]*)@)?(\\[[^\\/?#\\]]+\\]|[^\\/?#:]*)(?:\\:(\\d*))?))?([^?#]*)(?:\\?([^#]*))?(?:#((?:.|\\n|\\r)*))?/i;\nconst NO_MATCH_IS_UNDEFINED = (<RegExpMatchArray>(\"\").match(/(){0}/))[1] === undefined;\n\nexport function parse(uriString:string, options:URIOptions = {}):URIComponents {\n\tconst components:URIComponents = {};\n\tconst protocol = (options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL);\n\n\tif (options.reference === \"suffix\") uriString = (options.scheme ? options.scheme + \":\" : \"\") + \"//\" + uriString;\n\n\tconst matches = uriString.match(URI_PARSE);\n\n\tif (matches) {\n\t\tif (NO_MATCH_IS_UNDEFINED) {\n\t\t\t//store each component\n\t\t\tcomponents.scheme = matches[1];\n\t\t\tcomponents.userinfo = matches[3];\n\t\t\tcomponents.host = matches[4];\n\t\t\tcomponents.port = parseInt(matches[5], 10);\n\t\t\tcomponents.path = matches[6] || \"\";\n\t\t\tcomponents.query = matches[7];\n\t\t\tcomponents.fragment = matches[8];\n\n\t\t\t//fix port number\n\t\t\tif (isNaN(components.port)) {\n\t\t\t\tcomponents.port = matches[5];\n\t\t\t}\n\t\t} else {  //IE FIX for improper RegExp matching\n\t\t\t//store each component\n\t\t\tcomponents.scheme = matches[1] || undefined;\n\t\t\tcomponents.userinfo = (uriString.indexOf(\"@\") !== -1 ? matches[3] : undefined);\n\t\t\tcomponents.host = (uriString.indexOf(\"//\") !== -1 ? matches[4] : undefined);\n\t\t\tcomponents.port = parseInt(matches[5], 10);\n\t\t\tcomponents.path = matches[6] || \"\";\n\t\t\tcomponents.query = (uriString.indexOf(\"?\") !== -1 ? matches[7] : undefined);\n\t\t\tcomponents.fragment = (uriString.indexOf(\"#\") !== -1 ? matches[8] : undefined);\n\n\t\t\t//fix port number\n\t\t\tif (isNaN(components.port)) {\n\t\t\t\tcomponents.port = (uriString.match(/\\/\\/(?:.|\\n)*\\:(?:\\/|\\?|\\#|$)/) ? matches[4] : undefined);\n\t\t\t}\n\t\t}\n\n\t\tif (components.host) {\n\t\t\t//normalize IP hosts\n\t\t\tcomponents.host = _normalizeIPv6(_normalizeIPv4(components.host, protocol), protocol);\n\t\t}\n\n\t\t//determine reference type\n\t\tif (components.scheme === undefined && components.userinfo === undefined && components.host === undefined && components.port === undefined && !components.path && components.query === undefined) {\n\t\t\tcomponents.reference = \"same-document\";\n\t\t} else if (components.scheme === undefined) {\n\t\t\tcomponents.reference = \"relative\";\n\t\t} else if (components.fragment === undefined) {\n\t\t\tcomponents.reference = \"absolute\";\n\t\t} else {\n\t\t\tcomponents.reference = \"uri\";\n\t\t}\n\n\t\t//check for reference errors\n\t\tif (options.reference && options.reference !== \"suffix\" && options.reference !== components.reference) {\n\t\t\tcomponents.error = components.error || \"URI is not a \" + options.reference + \" reference.\";\n\t\t}\n\n\t\t//find scheme handler\n\t\tconst schemeHandler = SCHEMES[(options.scheme || components.scheme || \"\").toLowerCase()];\n\n\t\t//check if scheme can't handle IRIs\n\t\tif (!options.unicodeSupport && (!schemeHandler || !schemeHandler.unicodeSupport)) {\n\t\t\t//if host component is a domain name\n\t\t\tif (components.host && (options.domainHost || (schemeHandler && schemeHandler.domainHost))) {\n\t\t\t\t//convert Unicode IDN -> ASCII IDN\n\t\t\t\ttry {\n\t\t\t\t\tcomponents.host = punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase());\n\t\t\t\t} catch (e) {\n\t\t\t\t\tcomponents.error = components.error || \"Host's domain name can not be converted to ASCII via punycode: \" + e;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//convert IRI -> URI\n\t\t\t_normalizeComponentEncoding(components, URI_PROTOCOL);\n\t\t} else {\n\t\t\t//normalize encodings\n\t\t\t_normalizeComponentEncoding(components, protocol);\n\t\t}\n\n\t\t//perform scheme specific parsing\n\t\tif (schemeHandler && schemeHandler.parse) {\n\t\t\tschemeHandler.parse(components, options);\n\t\t}\n\t} else {\n\t\tcomponents.error = components.error || \"URI can not be parsed.\";\n\t}\n\n\treturn components;\n};\n\nfunction _recomposeAuthority(components:URIComponents, options:URIOptions):string|undefined {\n\tconst protocol = (options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL);\n\tconst uriTokens:Array<string> = [];\n\n\tif (components.userinfo !== undefined) {\n\t\turiTokens.push(components.userinfo);\n\t\turiTokens.push(\"@\");\n\t}\n\n\tif (components.host !== undefined) {\n\t\t//normalize IP hosts, add brackets and escape zone separator for IPv6\n\t\turiTokens.push(_normalizeIPv6(_normalizeIPv4(String(components.host), protocol), protocol).replace(protocol.IPV6ADDRESS, (_, $1, $2) => \"[\" + $1 + ($2 ? \"%25\" + $2 : \"\") + \"]\"));\n\t}\n\n\tif (typeof components.port === \"number\" || typeof components.port === \"string\") {\n\t\turiTokens.push(\":\");\n\t\turiTokens.push(String(components.port));\n\t}\n\n\treturn uriTokens.length ? uriTokens.join(\"\") : undefined;\n};\n\nconst RDS1 = /^\\.\\.?\\//;\nconst RDS2 = /^\\/\\.(\\/|$)/;\nconst RDS3 = /^\\/\\.\\.(\\/|$)/;\nconst RDS4 = /^\\.\\.?$/;\nconst RDS5 = /^\\/?(?:.|\\n)*?(?=\\/|$)/;\n\nexport function removeDotSegments(input:string):string {\n\tconst output:Array<string> = [];\n\n\twhile (input.length) {\n\t\tif (input.match(RDS1)) {\n\t\t\tinput = input.replace(RDS1, \"\");\n\t\t} else if (input.match(RDS2)) {\n\t\t\tinput = input.replace(RDS2, \"/\");\n\t\t} else if (input.match(RDS3)) {\n\t\t\tinput = input.replace(RDS3, \"/\");\n\t\t\toutput.pop();\n\t\t} else if (input === \".\" || input === \"..\") {\n\t\t\tinput = \"\";\n\t\t} else {\n\t\t\tconst im = input.match(RDS5);\n\t\t\tif (im) {\n\t\t\t\tconst s = im[0];\n\t\t\t\tinput = input.slice(s.length);\n\t\t\t\toutput.push(s);\n\t\t\t} else {\n\t\t\t\tthrow new Error(\"Unexpected dot segment condition\");\n\t\t\t}\n\t\t}\n\t}\n\n\treturn output.join(\"\");\n};\n\nexport function serialize(components:URIComponents, options:URIOptions = {}):string {\n\tconst protocol = (options.iri ? IRI_PROTOCOL : URI_PROTOCOL);\n\tconst uriTokens:Array<string> = [];\n\n\t//find scheme handler\n\tconst schemeHandler = SCHEMES[(options.scheme || components.scheme || \"\").toLowerCase()];\n\n\t//perform scheme specific serialization\n\tif (schemeHandler && schemeHandler.serialize) schemeHandler.serialize(components, options);\n\n\tif (components.host) {\n\t\t//if host component is an IPv6 address\n\t\tif (protocol.IPV6ADDRESS.test(components.host)) {\n\t\t\t//TODO: normalize IPv6 address as per RFC 5952\n\t\t}\n\n\t\t//if host component is a domain name\n\t\telse if (options.domainHost || (schemeHandler && schemeHandler.domainHost)) {\n\t\t\t//convert IDN via punycode\n\t\t\ttry {\n\t\t\t\tcomponents.host = (!options.iri ? punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase()) : punycode.toUnicode(components.host));\n\t\t\t} catch (e) {\n\t\t\t\tcomponents.error = components.error || \"Host's domain name can not be converted to \" + (!options.iri ? \"ASCII\" : \"Unicode\") + \" via punycode: \" + e;\n\t\t\t}\n\t\t}\n\t}\n\n\t//normalize encoding\n\t_normalizeComponentEncoding(components, protocol);\n\n\tif (options.reference !== \"suffix\" && components.scheme) {\n\t\turiTokens.push(components.scheme);\n\t\turiTokens.push(\":\");\n\t}\n\n\tconst authority = _recomposeAuthority(components, options);\n\tif (authority !== undefined) {\n\t\tif (options.reference !== \"suffix\") {\n\t\t\turiTokens.push(\"//\");\n\t\t}\n\n\t\turiTokens.push(authority);\n\n\t\tif (components.path && components.path.charAt(0) !== \"/\") {\n\t\t\turiTokens.push(\"/\");\n\t\t}\n\t}\n\n\tif (components.path !== undefined) {\n\t\tlet s = components.path;\n\n\t\tif (!options.absolutePath && (!schemeHandler || !schemeHandler.absolutePath)) {\n\t\t\ts = removeDotSegments(s);\n\t\t}\n\n\t\tif (authority === undefined) {\n\t\t\ts = s.replace(/^\\/\\//, \"/%2F\");  //don't allow the path to start with \"//\"\n\t\t}\n\n\t\turiTokens.push(s);\n\t}\n\n\tif (components.query !== undefined) {\n\t\turiTokens.push(\"?\");\n\t\turiTokens.push(components.query);\n\t}\n\n\tif (components.fragment !== undefined) {\n\t\turiTokens.push(\"#\");\n\t\turiTokens.push(components.fragment);\n\t}\n\n\treturn uriTokens.join(\"\");  //merge tokens into a string\n};\n\nexport function resolveComponents(base:URIComponents, relative:URIComponents, options:URIOptions = {}, skipNormalization?:boolean):URIComponents {\n\tconst target:URIComponents = {};\n\n\tif (!skipNormalization) {\n\t\tbase = parse(serialize(base, options), options);  //normalize base components\n\t\trelative = parse(serialize(relative, options), options);  //normalize relative components\n\t}\n\toptions = options || {};\n\n\tif (!options.tolerant && relative.scheme) {\n\t\ttarget.scheme = relative.scheme;\n\t\t//target.authority = relative.authority;\n\t\ttarget.userinfo = relative.userinfo;\n\t\ttarget.host = relative.host;\n\t\ttarget.port = relative.port;\n\t\ttarget.path = removeDotSegments(relative.path || \"\");\n\t\ttarget.query = relative.query;\n\t} else {\n\t\tif (relative.userinfo !== undefined || relative.host !== undefined || relative.port !== undefined) {\n\t\t\t//target.authority = relative.authority;\n\t\t\ttarget.userinfo = relative.userinfo;\n\t\t\ttarget.host = relative.host;\n\t\t\ttarget.port = relative.port;\n\t\t\ttarget.path = removeDotSegments(relative.path || \"\");\n\t\t\ttarget.query = relative.query;\n\t\t} else {\n\t\t\tif (!relative.path) {\n\t\t\t\ttarget.path = base.path;\n\t\t\t\tif (relative.query !== undefined) {\n\t\t\t\t\ttarget.query = relative.query;\n\t\t\t\t} else {\n\t\t\t\t\ttarget.query = base.query;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (relative.path.charAt(0) === \"/\") {\n\t\t\t\t\ttarget.path = removeDotSegments(relative.path);\n\t\t\t\t} else {\n\t\t\t\t\tif ((base.userinfo !== undefined || base.host !== undefined || base.port !== undefined) && !base.path) {\n\t\t\t\t\t\ttarget.path = \"/\" + relative.path;\n\t\t\t\t\t} else if (!base.path) {\n\t\t\t\t\t\ttarget.path = relative.path;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget.path = base.path.slice(0, base.path.lastIndexOf(\"/\") + 1) + relative.path;\n\t\t\t\t\t}\n\t\t\t\t\ttarget.path = removeDotSegments(target.path);\n\t\t\t\t}\n\t\t\t\ttarget.query = relative.query;\n\t\t\t}\n\t\t\t//target.authority = base.authority;\n\t\t\ttarget.userinfo = base.userinfo;\n\t\t\ttarget.host = base.host;\n\t\t\ttarget.port = base.port;\n\t\t}\n\t\ttarget.scheme = base.scheme;\n\t}\n\n\ttarget.fragment = relative.fragment;\n\n\treturn target;\n};\n\nexport function resolve(baseURI:string, relativeURI:string, options?:URIOptions):string {\n\tconst schemelessOptions = assign({ scheme : 'null' }, options);\n\treturn serialize(resolveComponents(parse(baseURI, schemelessOptions), parse(relativeURI, schemelessOptions), schemelessOptions, true), schemelessOptions);\n};\n\nexport function normalize(uri:string, options?:URIOptions):string;\nexport function normalize(uri:URIComponents, options?:URIOptions):URIComponents;\nexport function normalize(uri:any, options?:URIOptions):any {\n\tif (typeof uri === \"string\") {\n\t\turi = serialize(parse(uri, options), options);\n\t} else if (typeOf(uri) === \"object\") {\n\t\turi = parse(serialize(<URIComponents>uri, options), options);\n\t}\n\n\treturn uri;\n};\n\nexport function equal(uriA:string, uriB:string, options?: URIOptions):boolean;\nexport function equal(uriA:URIComponents, uriB:URIComponents, options?:URIOptions):boolean;\nexport function equal(uriA:any, uriB:any, options?:URIOptions):boolean {\n\tif (typeof uriA === \"string\") {\n\t\turiA = serialize(parse(uriA, options), options);\n\t} else if (typeOf(uriA) === \"object\") {\n\t\turiA = serialize(<URIComponents>uriA, options);\n\t}\n\n\tif (typeof uriB === \"string\") {\n\t\turiB = serialize(parse(uriB, options), options);\n\t} else if (typeOf(uriB) === \"object\") {\n\t\turiB = serialize(<URIComponents>uriB, options);\n\t}\n\n\treturn uriA === uriB;\n};\n\nexport function escapeComponent(str:string, options?:URIOptions):string {\n\treturn str && str.toString().replace((!options || !options.iri ? URI_PROTOCOL.ESCAPE : IRI_PROTOCOL.ESCAPE), pctEncChar);\n};\n\nexport function unescapeComponent(str:string, options?:URIOptions):string {\n\treturn str && str.toString().replace((!options || !options.iri ? URI_PROTOCOL.PCT_ENCODED : IRI_PROTOCOL.PCT_ENCODED), pctDecChars);\n};\n","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\n\nexport interface WSComponents extends URIComponents {\n\tresourceName?: string;\n\tsecure?: boolean;\n}\n\nfunction isSecure(wsComponents:WSComponents):boolean {\n\treturn typeof wsComponents.secure === 'boolean' ? wsComponents.secure : String(wsComponents.scheme).toLowerCase() === \"wss\";\n}\n\n//RFC 6455\nconst handler:URISchemeHandler = {\n\tscheme : \"ws\",\n\n\tdomainHost : true,\n\n\tparse : function (components:URIComponents, options:URIOptions):WSComponents {\n\t\tconst wsComponents = components as WSComponents;\n\n\t\t//indicate if the secure flag is set\n\t\twsComponents.secure = isSecure(wsComponents);\n\n\t\t//construct resouce name\n\t\twsComponents.resourceName = (wsComponents.path || '/') + (wsComponents.query ? '?' + wsComponents.query : '');\n\t\twsComponents.path = undefined;\n\t\twsComponents.query = undefined;\n\n\t\treturn wsComponents;\n\t},\n\n\tserialize : function (wsComponents:WSComponents, options:URIOptions):URIComponents {\n\t\t//normalize the default port\n\t\tif (wsComponents.port === (isSecure(wsComponents) ? 443 : 80) || wsComponents.port === \"\") {\n\t\t\twsComponents.port = undefined;\n\t\t}\n\n\t\t//ensure scheme matches secure flag\n\t\tif (typeof wsComponents.secure === 'boolean') {\n\t\t\twsComponents.scheme = (wsComponents.secure ? 'wss' : 'ws');\n\t\t\twsComponents.secure = undefined;\n\t\t}\n\n\t\t//reconstruct path from resource name\n\t\tif (wsComponents.resourceName) {\n\t\t\tconst [path, query] = wsComponents.resourceName.split('?');\n\t\t\twsComponents.path = (path && path !== '/' ? path : undefined);\n\t\t\twsComponents.query = query;\n\t\t\twsComponents.resourceName = undefined;\n\t\t}\n\n\t\t//forbid fragment component\n\t\twsComponents.fragment = undefined;\n\n\t\treturn wsComponents;\n\t}\n};\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport { pctEncChar, pctDecChars, unescapeComponent } from \"../uri\";\nimport punycode from \"punycode\";\nimport { merge, subexp, toUpperCase, toArray } from \"../util\";\n\nexport interface MailtoHeaders {\n\t[hfname:string]:string\n}\n\nexport interface MailtoComponents extends URIComponents {\n\tto:Array<string>,\n\theaders?:MailtoHeaders,\n\tsubject?:string,\n\tbody?:string\n}\n\nconst O:MailtoHeaders = {};\nconst isIRI = true;\n\n//RFC 3986\nconst UNRESERVED$$ = \"[A-Za-z0-9\\\\-\\\\.\\\\_\\\\~\" + (isIRI ? \"\\\\xA0-\\\\u200D\\\\u2010-\\\\u2029\\\\u202F-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFEF\" : \"\") + \"]\";\nconst HEXDIG$$ = \"[0-9A-Fa-f]\";  //case-insensitive\nconst PCT_ENCODED$ = subexp(subexp(\"%[EFef]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%[89A-Fa-f]\" + HEXDIG$$ + \"%\" + HEXDIG$$ + HEXDIG$$) + \"|\" + subexp(\"%\" + HEXDIG$$ + HEXDIG$$));  //expanded\n\n//RFC 5322, except these symbols as per RFC 6068: @ : / ? # [ ] & ; =\n//const ATEXT$$ = \"[A-Za-z0-9\\\\!\\\\#\\\\$\\\\%\\\\&\\\\'\\\\*\\\\+\\\\-\\\\/\\\\=\\\\?\\\\^\\\\_\\\\`\\\\{\\\\|\\\\}\\\\~]\";\n//const WSP$$ = \"[\\\\x20\\\\x09]\";\n//const OBS_QTEXT$$ = \"[\\\\x01-\\\\x08\\\\x0B\\\\x0C\\\\x0E-\\\\x1F\\\\x7F]\";  //(%d1-8 / %d11-12 / %d14-31 / %d127)\n//const QTEXT$$ = merge(\"[\\\\x21\\\\x23-\\\\x5B\\\\x5D-\\\\x7E]\", OBS_QTEXT$$);  //%d33 / %d35-91 / %d93-126 / obs-qtext\n//const VCHAR$$ = \"[\\\\x21-\\\\x7E]\";\n//const WSP$$ = \"[\\\\x20\\\\x09]\";\n//const OBS_QP$ = subexp(\"\\\\\\\\\" + merge(\"[\\\\x00\\\\x0D\\\\x0A]\", OBS_QTEXT$$));  //%d0 / CR / LF / obs-qtext\n//const FWS$ = subexp(subexp(WSP$$ + \"*\" + \"\\\\x0D\\\\x0A\") + \"?\" + WSP$$ + \"+\");\n//const QUOTED_PAIR$ = subexp(subexp(\"\\\\\\\\\" + subexp(VCHAR$$ + \"|\" + WSP$$)) + \"|\" + OBS_QP$);\n//const QUOTED_STRING$ = subexp('\\\\\"' + subexp(FWS$ + \"?\" + QCONTENT$) + \"*\" + FWS$ + \"?\" + '\\\\\"');\nconst ATEXT$$ = \"[A-Za-z0-9\\\\!\\\\$\\\\%\\\\'\\\\*\\\\+\\\\-\\\\^\\\\_\\\\`\\\\{\\\\|\\\\}\\\\~]\";\nconst QTEXT$$ = \"[\\\\!\\\\$\\\\%\\\\'\\\\(\\\\)\\\\*\\\\+\\\\,\\\\-\\\\.0-9\\\\<\\\\>A-Z\\\\x5E-\\\\x7E]\";\nconst VCHAR$$ = merge(QTEXT$$, \"[\\\\\\\"\\\\\\\\]\");\nconst DOT_ATOM_TEXT$ = subexp(ATEXT$$ + \"+\" + subexp(\"\\\\.\" + ATEXT$$ + \"+\") + \"*\");\nconst QUOTED_PAIR$ = subexp(\"\\\\\\\\\" + VCHAR$$);\nconst QCONTENT$ = subexp(QTEXT$$ + \"|\" + QUOTED_PAIR$);\nconst QUOTED_STRING$ = subexp('\\\\\"' + QCONTENT$ + \"*\" + '\\\\\"');\n\n//RFC 6068\nconst DTEXT_NO_OBS$$ = \"[\\\\x21-\\\\x5A\\\\x5E-\\\\x7E]\";  //%d33-90 / %d94-126\nconst SOME_DELIMS$$ = \"[\\\\!\\\\$\\\\'\\\\(\\\\)\\\\*\\\\+\\\\,\\\\;\\\\:\\\\@]\";\nconst QCHAR$ = subexp(UNRESERVED$$ + \"|\" + PCT_ENCODED$ + \"|\" + SOME_DELIMS$$);\nconst DOMAIN$ = subexp(DOT_ATOM_TEXT$ + \"|\" + \"\\\\[\" + DTEXT_NO_OBS$$ + \"*\" + \"\\\\]\");\nconst LOCAL_PART$ = subexp(DOT_ATOM_TEXT$ + \"|\" + QUOTED_STRING$);\nconst ADDR_SPEC$ = subexp(LOCAL_PART$ + \"\\\\@\" + DOMAIN$);\nconst TO$ = subexp(ADDR_SPEC$ + subexp(\"\\\\,\" + ADDR_SPEC$) + \"*\");\nconst HFNAME$ = subexp(QCHAR$ + \"*\");\nconst HFVALUE$ = HFNAME$;\nconst HFIELD$ = subexp(HFNAME$ + \"\\\\=\" + HFVALUE$);\nconst HFIELDS2$ = subexp(HFIELD$ + subexp(\"\\\\&\" + HFIELD$) + \"*\");\nconst HFIELDS$ = subexp(\"\\\\?\" + HFIELDS2$);\nconst MAILTO_URI = new RegExp(\"^mailto\\\\:\" + TO$ + \"?\" + HFIELDS$ + \"?$\");\n\nconst UNRESERVED = new RegExp(UNRESERVED$$, \"g\");\nconst PCT_ENCODED = new RegExp(PCT_ENCODED$, \"g\");\nconst NOT_LOCAL_PART = new RegExp(merge(\"[^]\", ATEXT$$, \"[\\\\.]\", '[\\\\\"]', VCHAR$$), \"g\");\nconst NOT_DOMAIN = new RegExp(merge(\"[^]\", ATEXT$$, \"[\\\\.]\", \"[\\\\[]\", DTEXT_NO_OBS$$, \"[\\\\]]\"), \"g\");\nconst NOT_HFNAME = new RegExp(merge(\"[^]\", UNRESERVED$$, SOME_DELIMS$$), \"g\");\nconst NOT_HFVALUE = NOT_HFNAME;\nconst TO = new RegExp(\"^\" + TO$ + \"$\");\nconst HFIELDS = new RegExp(\"^\" + HFIELDS2$ + \"$\");\n\nfunction decodeUnreserved(str:string):string {\n\tconst decStr = pctDecChars(str);\n\treturn (!decStr.match(UNRESERVED) ? str : decStr);\n}\n\nconst handler:URISchemeHandler<MailtoComponents> =  {\n\tscheme : \"mailto\",\n\n\tparse : function (components:URIComponents, options:URIOptions):MailtoComponents {\n\t\tconst mailtoComponents = components as MailtoComponents;\n\t\tconst to = mailtoComponents.to = (mailtoComponents.path ? mailtoComponents.path.split(\",\") : []);\n\t\tmailtoComponents.path = undefined;\n\n\t\tif (mailtoComponents.query) {\n\t\t\tlet unknownHeaders = false\n\t\t\tconst headers:MailtoHeaders = {};\n\t\t\tconst hfields = mailtoComponents.query.split(\"&\");\n\n\t\t\tfor (let x = 0, xl = hfields.length; x < xl; ++x) {\n\t\t\t\tconst hfield = hfields[x].split(\"=\");\n\n\t\t\t\tswitch (hfield[0]) {\n\t\t\t\t\tcase \"to\":\n\t\t\t\t\t\tconst toAddrs = hfield[1].split(\",\");\n\t\t\t\t\t\tfor (let x = 0, xl = toAddrs.length; x < xl; ++x) {\n\t\t\t\t\t\t\tto.push(toAddrs[x]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"subject\":\n\t\t\t\t\t\tmailtoComponents.subject = unescapeComponent(hfield[1], options);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"body\":\n\t\t\t\t\t\tmailtoComponents.body = unescapeComponent(hfield[1], options);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tunknownHeaders = true;\n\t\t\t\t\t\theaders[unescapeComponent(hfield[0], options)] = unescapeComponent(hfield[1], options);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (unknownHeaders) mailtoComponents.headers = headers;\n\t\t}\n\n\t\tmailtoComponents.query = undefined;\n\n\t\tfor (let x = 0, xl = to.length; x < xl; ++x) {\n\t\t\tconst addr = to[x].split(\"@\");\n\n\t\t\taddr[0] = unescapeComponent(addr[0]);\n\n\t\t\tif (!options.unicodeSupport) {\n\t\t\t\t//convert Unicode IDN -> ASCII IDN\n\t\t\t\ttry {\n\t\t\t\t\taddr[1] = punycode.toASCII(unescapeComponent(addr[1], options).toLowerCase());\n\t\t\t\t} catch (e) {\n\t\t\t\t\tmailtoComponents.error = mailtoComponents.error || \"Email address's domain name can not be converted to ASCII via punycode: \" + e;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\taddr[1] = unescapeComponent(addr[1], options).toLowerCase();\n\t\t\t}\n\n\t\t\tto[x] = addr.join(\"@\");\n\t\t}\n\n\t\treturn mailtoComponents;\n\t},\n\n\tserialize : function (mailtoComponents:MailtoComponents, options:URIOptions):URIComponents {\n\t\tconst components = mailtoComponents as URIComponents;\n\t\tconst to = toArray(mailtoComponents.to);\n\t\tif (to) {\n\t\t\tfor (let x = 0, xl = to.length; x < xl; ++x) {\n\t\t\t\tconst toAddr = String(to[x]);\n\t\t\t\tconst atIdx = toAddr.lastIndexOf(\"@\");\n\t\t\t\tconst localPart = (toAddr.slice(0, atIdx)).replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_LOCAL_PART, pctEncChar);\n\t\t\t\tlet domain = toAddr.slice(atIdx + 1);\n\n\t\t\t\t//convert IDN via punycode\n\t\t\t\ttry {\n\t\t\t\t\tdomain = (!options.iri ? punycode.toASCII(unescapeComponent(domain, options).toLowerCase()) : punycode.toUnicode(domain));\n\t\t\t\t} catch (e) {\n\t\t\t\t\tcomponents.error = components.error || \"Email address's domain name can not be converted to \" + (!options.iri ? \"ASCII\" : \"Unicode\") + \" via punycode: \" + e;\n\t\t\t\t}\n\n\t\t\t\tto[x] = localPart + \"@\" + domain;\n\t\t\t}\n\n\t\t\tcomponents.path = to.join(\",\");\n\t\t}\n\n\t\tconst headers = mailtoComponents.headers = mailtoComponents.headers || {};\n\n\t\tif (mailtoComponents.subject) headers[\"subject\"] = mailtoComponents.subject;\n\t\tif (mailtoComponents.body) headers[\"body\"] = mailtoComponents.body;\n\n\t\tconst fields = [];\n\t\tfor (const name in headers) {\n\t\t\tif (headers[name] !== O[name]) {\n\t\t\t\tfields.push(\n\t\t\t\t\tname.replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFNAME, pctEncChar) +\n\t\t\t\t\t\"=\" +\n\t\t\t\t\theaders[name].replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFVALUE, pctEncChar)\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tif (fields.length) {\n\t\t\tcomponents.query = fields.join(\"&\");\n\t\t}\n\n\t\treturn components;\n\t}\n}\n\nexport default handler;","import { URIRegExps } from \"./uri\";\nimport { buildExps } from \"./regexps-uri\";\n\nexport default buildExps(true);\n","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\n\nconst handler:URISchemeHandler = {\n\tscheme : \"http\",\n\n\tdomainHost : true,\n\n\tparse : function (components:URIComponents, options:URIOptions):URIComponents {\n\t\t//report missing host\n\t\tif (!components.host) {\n\t\t\tcomponents.error = components.error || \"HTTP URIs must have a host.\";\n\t\t}\n\n\t\treturn components;\n\t},\n\n\tserialize : function (components:URIComponents, options:URIOptions):URIComponents {\n\t\tconst secure = String(components.scheme).toLowerCase() === \"https\";\n\n\t\t//normalize the default port\n\t\tif (components.port === (secure ? 443 : 80) || components.port === \"\") {\n\t\t\tcomponents.port = undefined;\n\t\t}\n\t\t\n\t\t//normalize the empty path\n\t\tif (!components.path) {\n\t\t\tcomponents.path = \"/\";\n\t\t}\n\n\t\t//NOTE: We do not parse query strings for HTTP URIs\n\t\t//as WWW Form Url Encoded query strings are part of the HTML4+ spec,\n\t\t//and not the HTTP spec.\n\n\t\treturn components;\n\t}\n};\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport http from \"./http\";\n\nconst handler:URISchemeHandler = {\n\tscheme : \"https\",\n\tdomainHost : http.domainHost,\n\tparse : http.parse,\n\tserialize : http.serialize\n}\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport ws from \"./ws\";\n\nconst handler:URISchemeHandler = {\n\tscheme : \"wss\",\n\tdomainHost : ws.domainHost,\n\tparse : ws.parse,\n\tserialize : ws.serialize\n}\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport { pctEncChar, SCHEMES } from \"../uri\";\n\nexport interface URNComponents extends URIComponents {\n\tnid?:string;\n\tnss?:string;\n}\n\nexport interface URNOptions extends URIOptions {\n\tnid?:string;\n}\n\nconst NID$ = \"(?:[0-9A-Za-z][0-9A-Za-z\\\\-]{1,31})\";\nconst PCT_ENCODED$ = \"(?:\\\\%[0-9A-Fa-f]{2})\";\nconst TRANS$$ = \"[0-9A-Za-z\\\\(\\\\)\\\\+\\\\,\\\\-\\\\.\\\\:\\\\=\\\\@\\\\;\\\\$\\\\_\\\\!\\\\*\\\\'\\\\/\\\\?\\\\#]\";\nconst NSS$ = \"(?:(?:\" + PCT_ENCODED$ + \"|\" + TRANS$$ + \")+)\";\nconst URN_SCHEME = new RegExp(\"^urn\\\\:(\" + NID$ + \")$\");\nconst URN_PATH = new RegExp(\"^(\" + NID$ + \")\\\\:(\" + NSS$ + \")$\");\nconst URN_PARSE = /^([^\\:]+)\\:(.*)/;\nconst URN_EXCLUDED = /[\\x00-\\x20\\\\\\\"\\&\\<\\>\\[\\]\\^\\`\\{\\|\\}\\~\\x7F-\\xFF]/g;\n\n//RFC 2141\nconst handler:URISchemeHandler<URNComponents,URNOptions> = {\n\tscheme : \"urn\",\n\n\tparse : function (components:URIComponents, options:URNOptions):URNComponents {\n\t\tconst matches = components.path && components.path.match(URN_PARSE);\n\t\tlet urnComponents = components as URNComponents;\n\n\t\tif (matches) {\n\t\t\tconst scheme = options.scheme || urnComponents.scheme || \"urn\";\n\t\t\tconst nid = matches[1].toLowerCase();\n\t\t\tconst nss = matches[2];\n\t\t\tconst urnScheme = `${scheme}:${options.nid || nid}`;\n\t\t\tconst schemeHandler = SCHEMES[urnScheme];\n\n\t\t\turnComponents.nid = nid;\n\t\t\turnComponents.nss = nss;\n\t\t\turnComponents.path = undefined;\n\n\t\t\tif (schemeHandler) {\n\t\t\t\turnComponents = schemeHandler.parse(urnComponents, options) as URNComponents;\n\t\t\t}\n\t\t} else {\n\t\t\turnComponents.error = urnComponents.error || \"URN can not be parsed.\";\n\t\t}\n\n\t\treturn urnComponents;\n\t},\n\n\tserialize : function (urnComponents:URNComponents, options:URNOptions):URIComponents {\n\t\tconst scheme = options.scheme || urnComponents.scheme || \"urn\";\n\t\tconst nid = urnComponents.nid;\n\t\tconst urnScheme = `${scheme}:${options.nid || nid}`;\n\t\tconst schemeHandler = SCHEMES[urnScheme];\n\n\t\tif (schemeHandler) {\n\t\t\turnComponents = schemeHandler.serialize(urnComponents, options) as URNComponents;\n\t\t}\n\n\t\tconst uriComponents = urnComponents as URIComponents;\n\t\tconst nss = urnComponents.nss;\n\t\turiComponents.path = `${nid || options.nid}:${nss}`;\n\n\t\treturn uriComponents;\n\t},\n};\n\nexport default handler;","import { URISchemeHandler, URIComponents, URIOptions } from \"../uri\";\nimport { URNComponents } from \"./urn\";\nimport { SCHEMES } from \"../uri\";\n\nexport interface UUIDComponents extends URNComponents {\n\tuuid?: string;\n}\n\nconst UUID = /^[0-9A-Fa-f]{8}(?:\\-[0-9A-Fa-f]{4}){3}\\-[0-9A-Fa-f]{12}$/;\nconst UUID_PARSE = /^[0-9A-Fa-f\\-]{36}/;\n\n//RFC 4122\nconst handler:URISchemeHandler<UUIDComponents, URIOptions, URNComponents> = {\n\tscheme : \"urn:uuid\",\n\n\tparse : function (urnComponents:URNComponents, options:URIOptions):UUIDComponents {\n\t\tconst uuidComponents = urnComponents as UUIDComponents;\n\t\tuuidComponents.uuid = uuidComponents.nss;\n\t\tuuidComponents.nss = undefined;\n\n\t\tif (!options.tolerant && (!uuidComponents.uuid || !uuidComponents.uuid.match(UUID))) {\n\t\t\tuuidComponents.error = uuidComponents.error || \"UUID is not valid.\";\n\t\t}\n\n\t\treturn uuidComponents;\n\t},\n\n\tserialize : function (uuidComponents:UUIDComponents, options:URIOptions):URNComponents {\n\t\tconst urnComponents = uuidComponents as URNComponents;\n\t\t//normalize UUID\n\t\turnComponents.nss = (uuidComponents.uuid || \"\").toLowerCase();\n\t\treturn urnComponents;\n\t},\n};\n\nexport default handler;","import { SCHEMES } from \"./uri\";\n\nimport http from \"./schemes/http\";\nSCHEMES[http.scheme] = http;\n\nimport https from \"./schemes/https\";\nSCHEMES[https.scheme] = https;\n\nimport ws from \"./schemes/ws\";\nSCHEMES[ws.scheme] = ws;\n\nimport wss from \"./schemes/wss\";\nSCHEMES[wss.scheme] = wss;\n\nimport mailto from \"./schemes/mailto\";\nSCHEMES[mailto.scheme] = mailto;\n\nimport urn from \"./schemes/urn\";\nSCHEMES[urn.scheme] = urn;\n\nimport uuid from \"./schemes/urn-uuid\";\nSCHEMES[uuid.scheme] = uuid;\n\nexport * from \"./uri\";\n"]}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.d.ts
new file mode 100644
index 0000000..f6be760
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.d.ts
@@ -0,0 +1 @@
+export * from "./uri";
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.js
new file mode 100644
index 0000000..e3531b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.js
@@ -0,0 +1,17 @@
+import { SCHEMES } from "./uri";
+import http from "./schemes/http";
+SCHEMES[http.scheme] = http;
+import https from "./schemes/https";
+SCHEMES[https.scheme] = https;
+import ws from "./schemes/ws";
+SCHEMES[ws.scheme] = ws;
+import wss from "./schemes/wss";
+SCHEMES[wss.scheme] = wss;
+import mailto from "./schemes/mailto";
+SCHEMES[mailto.scheme] = mailto;
+import urn from "./schemes/urn";
+SCHEMES[urn.scheme] = urn;
+import uuid from "./schemes/urn-uuid";
+SCHEMES[uuid.scheme] = uuid;
+export * from "./uri";
+//# sourceMappingURL=index.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.js.map
new file mode 100644
index 0000000..0971f6e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/index.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,OAAO,CAAC;AAEhC,OAAO,IAAI,MAAM,gBAAgB,CAAC;AAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;AAE5B,OAAO,KAAK,MAAM,iBAAiB,CAAC;AACpC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;AAE9B,OAAO,EAAE,MAAM,cAAc,CAAC;AAC9B,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;AAExB,OAAO,GAAG,MAAM,eAAe,CAAC;AAChC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;AAE1B,OAAO,MAAM,MAAM,kBAAkB,CAAC;AACtC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;AAEhC,OAAO,GAAG,MAAM,eAAe,CAAC;AAChC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;AAE1B,OAAO,IAAI,MAAM,oBAAoB,CAAC;AACtC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;AAE5B,cAAc,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.d.ts
new file mode 100644
index 0000000..c91cdac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.d.ts
@@ -0,0 +1,3 @@
+import { URIRegExps } from "./uri";
+declare const _default: URIRegExps;
+export default _default;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.js
new file mode 100644
index 0000000..34e7de9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.js
@@ -0,0 +1,3 @@
+import { buildExps } from "./regexps-uri";
+export default buildExps(true);
+//# sourceMappingURL=regexps-iri.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.js.map
new file mode 100644
index 0000000..2269c58
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-iri.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"regexps-iri.js","sourceRoot":"","sources":["../../src/regexps-iri.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE1C,eAAe,SAAS,CAAC,IAAI,CAAC,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.d.ts
new file mode 100644
index 0000000..6096bda
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.d.ts
@@ -0,0 +1,4 @@
+import { URIRegExps } from "./uri";
+export declare function buildExps(isIRI: boolean): URIRegExps;
+declare const _default: URIRegExps;
+export default _default;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.js
new file mode 100644
index 0000000..1cc659f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.js
@@ -0,0 +1,42 @@
+import { merge, subexp } from "./util";
+export function buildExps(isIRI) {
+    const ALPHA$$ = "[A-Za-z]", CR$ = "[\\x0D]", DIGIT$$ = "[0-9]", DQUOTE$$ = "[\\x22]", HEXDIG$$ = merge(DIGIT$$, "[A-Fa-f]"), //case-insensitive
+    LF$$ = "[\\x0A]", SP$$ = "[\\x20]", PCT_ENCODED$ = subexp(subexp("%[EFef]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%[89A-Fa-f]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%" + HEXDIG$$ + HEXDIG$$)), //expanded
+    GEN_DELIMS$$ = "[\\:\\/\\?\\#\\[\\]\\@]", SUB_DELIMS$$ = "[\\!\\$\\&\\'\\(\\)\\*\\+\\,\\;\\=]", RESERVED$$ = merge(GEN_DELIMS$$, SUB_DELIMS$$), UCSCHAR$$ = isIRI ? "[\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]" : "[]", //subset, excludes bidi control characters
+    IPRIVATE$$ = isIRI ? "[\\uE000-\\uF8FF]" : "[]", //subset
+    UNRESERVED$$ = merge(ALPHA$$, DIGIT$$, "[\\-\\.\\_\\~]", UCSCHAR$$), SCHEME$ = subexp(ALPHA$$ + merge(ALPHA$$, DIGIT$$, "[\\+\\-\\.]") + "*"), USERINFO$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:]")) + "*"), DEC_OCTET$ = subexp(subexp("25[0-5]") + "|" + subexp("2[0-4]" + DIGIT$$) + "|" + subexp("1" + DIGIT$$ + DIGIT$$) + "|" + subexp("[1-9]" + DIGIT$$) + "|" + DIGIT$$), DEC_OCTET_RELAXED$ = subexp(subexp("25[0-5]") + "|" + subexp("2[0-4]" + DIGIT$$) + "|" + subexp("1" + DIGIT$$ + DIGIT$$) + "|" + subexp("0?[1-9]" + DIGIT$$) + "|0?0?" + DIGIT$$), //relaxed parsing rules
+    IPV4ADDRESS$ = subexp(DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$ + "\\." + DEC_OCTET_RELAXED$), H16$ = subexp(HEXDIG$$ + "{1,4}"), LS32$ = subexp(subexp(H16$ + "\\:" + H16$) + "|" + IPV4ADDRESS$), IPV6ADDRESS1$ = subexp(subexp(H16$ + "\\:") + "{6}" + LS32$), //                           6( h16 ":" ) ls32
+    IPV6ADDRESS2$ = subexp("\\:\\:" + subexp(H16$ + "\\:") + "{5}" + LS32$), //                      "::" 5( h16 ":" ) ls32
+    IPV6ADDRESS3$ = subexp(subexp(H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{4}" + LS32$), //[               h16 ] "::" 4( h16 ":" ) ls32
+    IPV6ADDRESS4$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,1}" + H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{3}" + LS32$), //[ *1( h16 ":" ) h16 ] "::" 3( h16 ":" ) ls32
+    IPV6ADDRESS5$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,2}" + H16$) + "?\\:\\:" + subexp(H16$ + "\\:") + "{2}" + LS32$), //[ *2( h16 ":" ) h16 ] "::" 2( h16 ":" ) ls32
+    IPV6ADDRESS6$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,3}" + H16$) + "?\\:\\:" + H16$ + "\\:" + LS32$), //[ *3( h16 ":" ) h16 ] "::"    h16 ":"   ls32
+    IPV6ADDRESS7$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,4}" + H16$) + "?\\:\\:" + LS32$), //[ *4( h16 ":" ) h16 ] "::"              ls32
+    IPV6ADDRESS8$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,5}" + H16$) + "?\\:\\:" + H16$), //[ *5( h16 ":" ) h16 ] "::"              h16
+    IPV6ADDRESS9$ = subexp(subexp(subexp(H16$ + "\\:") + "{0,6}" + H16$) + "?\\:\\:"), //[ *6( h16 ":" ) h16 ] "::"
+    IPV6ADDRESS$ = subexp([IPV6ADDRESS1$, IPV6ADDRESS2$, IPV6ADDRESS3$, IPV6ADDRESS4$, IPV6ADDRESS5$, IPV6ADDRESS6$, IPV6ADDRESS7$, IPV6ADDRESS8$, IPV6ADDRESS9$].join("|")), ZONEID$ = subexp(subexp(UNRESERVED$$ + "|" + PCT_ENCODED$) + "+"), //RFC 6874
+    IPV6ADDRZ$ = subexp(IPV6ADDRESS$ + "\\%25" + ZONEID$), //RFC 6874
+    IPV6ADDRZ_RELAXED$ = subexp(IPV6ADDRESS$ + subexp("\\%25|\\%(?!" + HEXDIG$$ + "{2})") + ZONEID$), //RFC 6874, with relaxed parsing rules
+    IPVFUTURE$ = subexp("[vV]" + HEXDIG$$ + "+\\." + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:]") + "+"), IP_LITERAL$ = subexp("\\[" + subexp(IPV6ADDRZ_RELAXED$ + "|" + IPV6ADDRESS$ + "|" + IPVFUTURE$) + "\\]"), //RFC 6874
+    REG_NAME$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$)) + "*"), HOST$ = subexp(IP_LITERAL$ + "|" + IPV4ADDRESS$ + "(?!" + REG_NAME$ + ")" + "|" + REG_NAME$), PORT$ = subexp(DIGIT$$ + "*"), AUTHORITY$ = subexp(subexp(USERINFO$ + "@") + "?" + HOST$ + subexp("\\:" + PORT$) + "?"), PCHAR$ = subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@]")), SEGMENT$ = subexp(PCHAR$ + "*"), SEGMENT_NZ$ = subexp(PCHAR$ + "+"), SEGMENT_NZ_NC$ = subexp(subexp(PCT_ENCODED$ + "|" + merge(UNRESERVED$$, SUB_DELIMS$$, "[\\@]")) + "+"), PATH_ABEMPTY$ = subexp(subexp("\\/" + SEGMENT$) + "*"), PATH_ABSOLUTE$ = subexp("\\/" + subexp(SEGMENT_NZ$ + PATH_ABEMPTY$) + "?"), //simplified
+    PATH_NOSCHEME$ = subexp(SEGMENT_NZ_NC$ + PATH_ABEMPTY$), //simplified
+    PATH_ROOTLESS$ = subexp(SEGMENT_NZ$ + PATH_ABEMPTY$), //simplified
+    PATH_EMPTY$ = "(?!" + PCHAR$ + ")", PATH$ = subexp(PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$), QUERY$ = subexp(subexp(PCHAR$ + "|" + merge("[\\/\\?]", IPRIVATE$$)) + "*"), FRAGMENT$ = subexp(subexp(PCHAR$ + "|[\\/\\?]") + "*"), HIER_PART$ = subexp(subexp("\\/\\/" + AUTHORITY$ + PATH_ABEMPTY$) + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$), URI$ = subexp(SCHEME$ + "\\:" + HIER_PART$ + subexp("\\?" + QUERY$) + "?" + subexp("\\#" + FRAGMENT$) + "?"), RELATIVE_PART$ = subexp(subexp("\\/\\/" + AUTHORITY$ + PATH_ABEMPTY$) + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_EMPTY$), RELATIVE$ = subexp(RELATIVE_PART$ + subexp("\\?" + QUERY$) + "?" + subexp("\\#" + FRAGMENT$) + "?"), URI_REFERENCE$ = subexp(URI$ + "|" + RELATIVE$), ABSOLUTE_URI$ = subexp(SCHEME$ + "\\:" + HIER_PART$ + subexp("\\?" + QUERY$) + "?"), GENERIC_REF$ = "^(" + SCHEME$ + ")\\:" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?" + subexp("\\#(" + FRAGMENT$ + ")") + "?$", RELATIVE_REF$ = "^(){0}" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_NOSCHEME$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?" + subexp("\\#(" + FRAGMENT$ + ")") + "?$", ABSOLUTE_REF$ = "^(" + SCHEME$ + ")\\:" + subexp(subexp("\\/\\/(" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?)") + "?(" + PATH_ABEMPTY$ + "|" + PATH_ABSOLUTE$ + "|" + PATH_ROOTLESS$ + "|" + PATH_EMPTY$ + ")") + subexp("\\?(" + QUERY$ + ")") + "?$", SAMEDOC_REF$ = "^" + subexp("\\#(" + FRAGMENT$ + ")") + "?$", AUTHORITY_REF$ = "^" + subexp("(" + USERINFO$ + ")@") + "?(" + HOST$ + ")" + subexp("\\:(" + PORT$ + ")") + "?$";
+    return {
+        NOT_SCHEME: new RegExp(merge("[^]", ALPHA$$, DIGIT$$, "[\\+\\-\\.]"), "g"),
+        NOT_USERINFO: new RegExp(merge("[^\\%\\:]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_HOST: new RegExp(merge("[^\\%\\[\\]\\:]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_PATH: new RegExp(merge("[^\\%\\/\\:\\@]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_PATH_NOSCHEME: new RegExp(merge("[^\\%\\/\\@]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        NOT_QUERY: new RegExp(merge("[^\\%]", UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@\\/\\?]", IPRIVATE$$), "g"),
+        NOT_FRAGMENT: new RegExp(merge("[^\\%]", UNRESERVED$$, SUB_DELIMS$$, "[\\:\\@\\/\\?]"), "g"),
+        ESCAPE: new RegExp(merge("[^]", UNRESERVED$$, SUB_DELIMS$$), "g"),
+        UNRESERVED: new RegExp(UNRESERVED$$, "g"),
+        OTHER_CHARS: new RegExp(merge("[^\\%]", UNRESERVED$$, RESERVED$$), "g"),
+        PCT_ENCODED: new RegExp(PCT_ENCODED$, "g"),
+        IPV4ADDRESS: new RegExp("^(" + IPV4ADDRESS$ + ")$"),
+        IPV6ADDRESS: new RegExp("^\\[?(" + IPV6ADDRESS$ + ")" + subexp(subexp("\\%25|\\%(?!" + HEXDIG$$ + "{2})") + "(" + ZONEID$ + ")") + "?\\]?$") //RFC 6874, with relaxed parsing rules
+    };
+}
+export default buildExps(false);
+//# sourceMappingURL=regexps-uri.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.js.map
new file mode 100644
index 0000000..cb028b8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/regexps-uri.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"regexps-uri.js","sourceRoot":"","sources":["../../src/regexps-uri.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAEvC,MAAM,oBAAoB,KAAa;IACtC,MACC,OAAO,GAAG,UAAU,EACpB,GAAG,GAAG,SAAS,EACf,OAAO,GAAG,OAAO,EACjB,QAAQ,GAAG,SAAS,EACpB,QAAQ,GAAG,KAAK,CAAC,OAAO,EAAE,UAAU,CAAC,EAAG,kBAAkB;IAC1D,IAAI,GAAG,SAAS,EAChB,IAAI,GAAG,SAAS,EAChB,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,GAAG,QAAQ,GAAG,GAAG,GAAG,QAAQ,GAAG,QAAQ,GAAG,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,aAAa,GAAG,QAAQ,GAAG,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAAG,UAAU;IACvO,YAAY,GAAG,yBAAyB,EACxC,YAAY,GAAG,qCAAqC,EACpD,UAAU,GAAG,KAAK,CAAC,YAAY,EAAE,YAAY,CAAC,EAC9C,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,6EAA6E,CAAC,CAAC,CAAC,IAAI,EAAG,0CAA0C;IACrJ,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,EAAG,QAAQ;IAC1D,YAAY,GAAG,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAAE,SAAS,CAAC,EACnE,OAAO,GAAG,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,aAAa,CAAC,GAAG,GAAG,CAAC,EACxE,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,YAAY,GAAG,GAAG,GAAG,KAAK,CAAC,YAAY,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,EACjG,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,OAAO,GAAG,OAAO,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,OAAO,GAAG,OAAO,CAAC,GAAG,GAAG,GAAG,OAAO,CAAC,EACnK,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,OAAO,GAAG,OAAO,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,SAAS,GAAG,OAAO,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,EAAG,uBAAuB;IAC3M,YAAY,GAAG,MAAM,CAAC,kBAAkB,GAAG,KAAK,GAAG,kBAAkB,GAAG,KAAK,GAAG,kBAAkB,GAAG,KAAK,GAAG,kBAAkB,CAAC,EAChI,IAAI,GAAG,MAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,EACjC,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,GAAG,YAAY,CAAC,EAChE,aAAa,GAAG,MAAM,CAA6D,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,8CAA8C;IACxK,aAAa,GAAG,MAAM,CAAkD,QAAQ,GAAG,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,8CAA8C;IACxK,aAAa,GAAG,MAAM,CAAC,MAAM,CAAkC,IAAI,CAAC,GAAG,SAAS,GAAG,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,8CAA8C;IACxK,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,SAAS,GAAG,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,8CAA8C;IACxK,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,SAAS,GAAG,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,8CAA8C;IACxK,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,SAAS,GAAU,IAAI,GAAG,KAAK,GAAY,KAAK,CAAC,EAAE,8CAA8C;IACxK,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,SAAS,GAAkC,KAAK,CAAC,EAAE,8CAA8C;IACxK,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,SAAS,GAAkC,IAAI,CAAE,EAAE,6CAA6C;IACvK,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,SAAS,CAAwC,EAAE,4BAA4B;IACtJ,YAAY,GAAG,MAAM,CAAC,CAAC,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EACxK,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,YAAY,GAAG,GAAG,GAAG,YAAY,CAAC,GAAG,GAAG,CAAC,EAAG,UAAU;IAC9E,UAAU,GAAG,MAAM,CAAC,YAAY,GAAG,OAAO,GAAG,OAAO,CAAC,EAAG,UAAU;IAClE,kBAAkB,GAAG,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,cAAc,GAAG,QAAQ,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,EAAG,sCAAsC;IACzI,UAAU,GAAG,MAAM,CAAC,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,KAAK,CAAC,YAAY,EAAE,YAAY,EAAE,OAAO,CAAC,GAAG,GAAG,CAAC,EAClG,WAAW,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,kBAAkB,GAAG,GAAG,GAAG,YAAY,GAAG,GAAG,GAAG,UAAU,CAAC,GAAG,KAAK,CAAC,EAAG,UAAU;IACrH,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,YAAY,GAAG,GAAG,GAAG,KAAK,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC,EACxF,KAAK,GAAG,MAAM,CAAC,WAAW,GAAG,GAAG,GAAG,YAAY,GAAG,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC,EAC5F,KAAK,GAAG,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC,EAC7B,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,EACxF,MAAM,GAAG,MAAM,CAAC,YAAY,GAAG,GAAG,GAAG,KAAK,CAAC,YAAY,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC,EACnF,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,EAC/B,WAAW,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,EAClC,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,YAAY,GAAG,GAAG,GAAG,KAAK,CAAC,YAAY,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,EACtG,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,EACtD,cAAc,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,GAAG,aAAa,CAAC,GAAG,GAAG,CAAC,EAAG,YAAY;IACzF,cAAc,GAAG,MAAM,CAAC,cAAc,GAAG,aAAa,CAAC,EAAG,YAAY;IACtE,cAAc,GAAG,MAAM,CAAC,WAAW,GAAG,aAAa,CAAC,EAAG,YAAY;IACnE,WAAW,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG,EAClC,KAAK,GAAG,MAAM,CAAC,aAAa,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,WAAW,CAAC,EACtH,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,GAAG,GAAG,CAAC,EAC3E,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,EACtD,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,GAAG,UAAU,GAAG,aAAa,CAAC,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,WAAW,CAAC,EACpI,IAAI,GAAG,MAAM,CAAC,OAAO,GAAG,KAAK,GAAG,UAAU,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,EAC5G,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,GAAG,UAAU,GAAG,aAAa,CAAC,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,WAAW,CAAC,EACxI,SAAS,GAAG,MAAM,CAAC,cAAc,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,EACnG,cAAc,GAAG,MAAM,CAAC,IAAI,GAAG,GAAG,GAAG,SAAS,CAAC,EAC/C,aAAa,GAAG,MAAM,CAAC,OAAO,GAAG,KAAK,GAAG,UAAU,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,EAEnF,YAAY,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,aAAa,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,WAAW,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,IAAI,EAC7U,aAAa,GAAG,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,aAAa,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,WAAW,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,IAAI,EAC/T,aAAa,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,aAAa,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,GAAG,WAAW,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,EACrS,YAAY,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,IAAI,EAC5D,cAAc,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAChH;IAED,OAAO;QACN,UAAU,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,GAAG,CAAC;QAC3E,YAAY,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,YAAY,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC;QAC9E,QAAQ,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,YAAY,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC;QAChF,QAAQ,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,YAAY,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC;QAChF,iBAAiB,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC;QACtF,SAAS,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,gBAAgB,EAAE,UAAU,CAAC,EAAE,GAAG,CAAC;QACtG,YAAY,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,gBAAgB,CAAC,EAAE,GAAG,CAAC;QAC7F,MAAM,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC;QAClE,UAAU,EAAG,IAAI,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC;QAC1C,WAAW,EAAG,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,GAAG,CAAC;QACxE,WAAW,EAAG,IAAI,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC;QAC3C,WAAW,EAAG,IAAI,MAAM,CAAC,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC;QACpD,WAAW,EAAG,IAAI,MAAM,CAAC,QAAQ,GAAG,YAAY,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,GAAG,QAAQ,GAAG,MAAM,CAAC,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAE,sCAAsC;KACrL,CAAC;AACH,CAAC;AAED,eAAe,SAAS,CAAC,KAAK,CAAC,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.d.ts
new file mode 100644
index 0000000..fe5b2f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.d.ts
@@ -0,0 +1,3 @@
+import { URISchemeHandler } from "../uri";
+declare const handler: URISchemeHandler;
+export default handler;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.js
new file mode 100644
index 0000000..6abf0fe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.js
@@ -0,0 +1,28 @@
+const handler = {
+    scheme: "http",
+    domainHost: true,
+    parse: function (components, options) {
+        //report missing host
+        if (!components.host) {
+            components.error = components.error || "HTTP URIs must have a host.";
+        }
+        return components;
+    },
+    serialize: function (components, options) {
+        const secure = String(components.scheme).toLowerCase() === "https";
+        //normalize the default port
+        if (components.port === (secure ? 443 : 80) || components.port === "") {
+            components.port = undefined;
+        }
+        //normalize the empty path
+        if (!components.path) {
+            components.path = "/";
+        }
+        //NOTE: We do not parse query strings for HTTP URIs
+        //as WWW Form Url Encoded query strings are part of the HTML4+ spec,
+        //and not the HTTP spec.
+        return components;
+    }
+};
+export default handler;
+//# sourceMappingURL=http.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.js.map
new file mode 100644
index 0000000..8211897
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/http.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"http.js","sourceRoot":"","sources":["../../../src/schemes/http.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,GAAoB;IAChC,MAAM,EAAG,MAAM;IAEf,UAAU,EAAG,IAAI;IAEjB,KAAK,EAAG,UAAU,UAAwB,EAAE,OAAkB;QAC7D,qBAAqB;QACrB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE;YACrB,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,6BAA6B,CAAC;SACrE;QAED,OAAO,UAAU,CAAC;IACnB,CAAC;IAED,SAAS,EAAG,UAAU,UAAwB,EAAE,OAAkB;QACjE,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,KAAK,OAAO,CAAC;QAEnE,4BAA4B;QAC5B,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,IAAI,KAAK,EAAE,EAAE;YACtE,UAAU,CAAC,IAAI,GAAG,SAAS,CAAC;SAC5B;QAED,0BAA0B;QAC1B,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE;YACrB,UAAU,CAAC,IAAI,GAAG,GAAG,CAAC;SACtB;QAED,mDAAmD;QACnD,oEAAoE;QACpE,wBAAwB;QAExB,OAAO,UAAU,CAAC;IACnB,CAAC;CACD,CAAC;AAEF,eAAe,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.d.ts
new file mode 100644
index 0000000..fe5b2f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.d.ts
@@ -0,0 +1,3 @@
+import { URISchemeHandler } from "../uri";
+declare const handler: URISchemeHandler;
+export default handler;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.js
new file mode 100644
index 0000000..ec4b6e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.js
@@ -0,0 +1,9 @@
+import http from "./http";
+const handler = {
+    scheme: "https",
+    domainHost: http.domainHost,
+    parse: http.parse,
+    serialize: http.serialize
+};
+export default handler;
+//# sourceMappingURL=https.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.js.map
new file mode 100644
index 0000000..385b8ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/https.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"https.js","sourceRoot":"","sources":["../../../src/schemes/https.ts"],"names":[],"mappings":"AACA,OAAO,IAAI,MAAM,QAAQ,CAAC;AAE1B,MAAM,OAAO,GAAoB;IAChC,MAAM,EAAG,OAAO;IAChB,UAAU,EAAG,IAAI,CAAC,UAAU;IAC5B,KAAK,EAAG,IAAI,CAAC,KAAK;IAClB,SAAS,EAAG,IAAI,CAAC,SAAS;CAC1B,CAAA;AAED,eAAe,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.d.ts
new file mode 100644
index 0000000..e2aefc2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.d.ts
@@ -0,0 +1,12 @@
+import { URISchemeHandler, URIComponents } from "../uri";
+export interface MailtoHeaders {
+    [hfname: string]: string;
+}
+export interface MailtoComponents extends URIComponents {
+    to: Array<string>;
+    headers?: MailtoHeaders;
+    subject?: string;
+    body?: string;
+}
+declare const handler: URISchemeHandler<MailtoComponents>;
+export default handler;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.js
new file mode 100644
index 0000000..2553713
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.js
@@ -0,0 +1,148 @@
+import { pctEncChar, pctDecChars, unescapeComponent } from "../uri";
+import punycode from "punycode";
+import { merge, subexp, toUpperCase, toArray } from "../util";
+const O = {};
+const isIRI = true;
+//RFC 3986
+const UNRESERVED$$ = "[A-Za-z0-9\\-\\.\\_\\~" + (isIRI ? "\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF" : "") + "]";
+const HEXDIG$$ = "[0-9A-Fa-f]"; //case-insensitive
+const PCT_ENCODED$ = subexp(subexp("%[EFef]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%[89A-Fa-f]" + HEXDIG$$ + "%" + HEXDIG$$ + HEXDIG$$) + "|" + subexp("%" + HEXDIG$$ + HEXDIG$$)); //expanded
+//RFC 5322, except these symbols as per RFC 6068: @ : / ? # [ ] & ; =
+//const ATEXT$$ = "[A-Za-z0-9\\!\\#\\$\\%\\&\\'\\*\\+\\-\\/\\=\\?\\^\\_\\`\\{\\|\\}\\~]";
+//const WSP$$ = "[\\x20\\x09]";
+//const OBS_QTEXT$$ = "[\\x01-\\x08\\x0B\\x0C\\x0E-\\x1F\\x7F]";  //(%d1-8 / %d11-12 / %d14-31 / %d127)
+//const QTEXT$$ = merge("[\\x21\\x23-\\x5B\\x5D-\\x7E]", OBS_QTEXT$$);  //%d33 / %d35-91 / %d93-126 / obs-qtext
+//const VCHAR$$ = "[\\x21-\\x7E]";
+//const WSP$$ = "[\\x20\\x09]";
+//const OBS_QP$ = subexp("\\\\" + merge("[\\x00\\x0D\\x0A]", OBS_QTEXT$$));  //%d0 / CR / LF / obs-qtext
+//const FWS$ = subexp(subexp(WSP$$ + "*" + "\\x0D\\x0A") + "?" + WSP$$ + "+");
+//const QUOTED_PAIR$ = subexp(subexp("\\\\" + subexp(VCHAR$$ + "|" + WSP$$)) + "|" + OBS_QP$);
+//const QUOTED_STRING$ = subexp('\\"' + subexp(FWS$ + "?" + QCONTENT$) + "*" + FWS$ + "?" + '\\"');
+const ATEXT$$ = "[A-Za-z0-9\\!\\$\\%\\'\\*\\+\\-\\^\\_\\`\\{\\|\\}\\~]";
+const QTEXT$$ = "[\\!\\$\\%\\'\\(\\)\\*\\+\\,\\-\\.0-9\\<\\>A-Z\\x5E-\\x7E]";
+const VCHAR$$ = merge(QTEXT$$, "[\\\"\\\\]");
+const DOT_ATOM_TEXT$ = subexp(ATEXT$$ + "+" + subexp("\\." + ATEXT$$ + "+") + "*");
+const QUOTED_PAIR$ = subexp("\\\\" + VCHAR$$);
+const QCONTENT$ = subexp(QTEXT$$ + "|" + QUOTED_PAIR$);
+const QUOTED_STRING$ = subexp('\\"' + QCONTENT$ + "*" + '\\"');
+//RFC 6068
+const DTEXT_NO_OBS$$ = "[\\x21-\\x5A\\x5E-\\x7E]"; //%d33-90 / %d94-126
+const SOME_DELIMS$$ = "[\\!\\$\\'\\(\\)\\*\\+\\,\\;\\:\\@]";
+const QCHAR$ = subexp(UNRESERVED$$ + "|" + PCT_ENCODED$ + "|" + SOME_DELIMS$$);
+const DOMAIN$ = subexp(DOT_ATOM_TEXT$ + "|" + "\\[" + DTEXT_NO_OBS$$ + "*" + "\\]");
+const LOCAL_PART$ = subexp(DOT_ATOM_TEXT$ + "|" + QUOTED_STRING$);
+const ADDR_SPEC$ = subexp(LOCAL_PART$ + "\\@" + DOMAIN$);
+const TO$ = subexp(ADDR_SPEC$ + subexp("\\," + ADDR_SPEC$) + "*");
+const HFNAME$ = subexp(QCHAR$ + "*");
+const HFVALUE$ = HFNAME$;
+const HFIELD$ = subexp(HFNAME$ + "\\=" + HFVALUE$);
+const HFIELDS2$ = subexp(HFIELD$ + subexp("\\&" + HFIELD$) + "*");
+const HFIELDS$ = subexp("\\?" + HFIELDS2$);
+const MAILTO_URI = new RegExp("^mailto\\:" + TO$ + "?" + HFIELDS$ + "?$");
+const UNRESERVED = new RegExp(UNRESERVED$$, "g");
+const PCT_ENCODED = new RegExp(PCT_ENCODED$, "g");
+const NOT_LOCAL_PART = new RegExp(merge("[^]", ATEXT$$, "[\\.]", '[\\"]', VCHAR$$), "g");
+const NOT_DOMAIN = new RegExp(merge("[^]", ATEXT$$, "[\\.]", "[\\[]", DTEXT_NO_OBS$$, "[\\]]"), "g");
+const NOT_HFNAME = new RegExp(merge("[^]", UNRESERVED$$, SOME_DELIMS$$), "g");
+const NOT_HFVALUE = NOT_HFNAME;
+const TO = new RegExp("^" + TO$ + "$");
+const HFIELDS = new RegExp("^" + HFIELDS2$ + "$");
+function decodeUnreserved(str) {
+    const decStr = pctDecChars(str);
+    return (!decStr.match(UNRESERVED) ? str : decStr);
+}
+const handler = {
+    scheme: "mailto",
+    parse: function (components, options) {
+        const mailtoComponents = components;
+        const to = mailtoComponents.to = (mailtoComponents.path ? mailtoComponents.path.split(",") : []);
+        mailtoComponents.path = undefined;
+        if (mailtoComponents.query) {
+            let unknownHeaders = false;
+            const headers = {};
+            const hfields = mailtoComponents.query.split("&");
+            for (let x = 0, xl = hfields.length; x < xl; ++x) {
+                const hfield = hfields[x].split("=");
+                switch (hfield[0]) {
+                    case "to":
+                        const toAddrs = hfield[1].split(",");
+                        for (let x = 0, xl = toAddrs.length; x < xl; ++x) {
+                            to.push(toAddrs[x]);
+                        }
+                        break;
+                    case "subject":
+                        mailtoComponents.subject = unescapeComponent(hfield[1], options);
+                        break;
+                    case "body":
+                        mailtoComponents.body = unescapeComponent(hfield[1], options);
+                        break;
+                    default:
+                        unknownHeaders = true;
+                        headers[unescapeComponent(hfield[0], options)] = unescapeComponent(hfield[1], options);
+                        break;
+                }
+            }
+            if (unknownHeaders)
+                mailtoComponents.headers = headers;
+        }
+        mailtoComponents.query = undefined;
+        for (let x = 0, xl = to.length; x < xl; ++x) {
+            const addr = to[x].split("@");
+            addr[0] = unescapeComponent(addr[0]);
+            if (!options.unicodeSupport) {
+                //convert Unicode IDN -> ASCII IDN
+                try {
+                    addr[1] = punycode.toASCII(unescapeComponent(addr[1], options).toLowerCase());
+                }
+                catch (e) {
+                    mailtoComponents.error = mailtoComponents.error || "Email address's domain name can not be converted to ASCII via punycode: " + e;
+                }
+            }
+            else {
+                addr[1] = unescapeComponent(addr[1], options).toLowerCase();
+            }
+            to[x] = addr.join("@");
+        }
+        return mailtoComponents;
+    },
+    serialize: function (mailtoComponents, options) {
+        const components = mailtoComponents;
+        const to = toArray(mailtoComponents.to);
+        if (to) {
+            for (let x = 0, xl = to.length; x < xl; ++x) {
+                const toAddr = String(to[x]);
+                const atIdx = toAddr.lastIndexOf("@");
+                const localPart = (toAddr.slice(0, atIdx)).replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_LOCAL_PART, pctEncChar);
+                let domain = toAddr.slice(atIdx + 1);
+                //convert IDN via punycode
+                try {
+                    domain = (!options.iri ? punycode.toASCII(unescapeComponent(domain, options).toLowerCase()) : punycode.toUnicode(domain));
+                }
+                catch (e) {
+                    components.error = components.error || "Email address's domain name can not be converted to " + (!options.iri ? "ASCII" : "Unicode") + " via punycode: " + e;
+                }
+                to[x] = localPart + "@" + domain;
+            }
+            components.path = to.join(",");
+        }
+        const headers = mailtoComponents.headers = mailtoComponents.headers || {};
+        if (mailtoComponents.subject)
+            headers["subject"] = mailtoComponents.subject;
+        if (mailtoComponents.body)
+            headers["body"] = mailtoComponents.body;
+        const fields = [];
+        for (const name in headers) {
+            if (headers[name] !== O[name]) {
+                fields.push(name.replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFNAME, pctEncChar) +
+                    "=" +
+                    headers[name].replace(PCT_ENCODED, decodeUnreserved).replace(PCT_ENCODED, toUpperCase).replace(NOT_HFVALUE, pctEncChar));
+            }
+        }
+        if (fields.length) {
+            components.query = fields.join("&");
+        }
+        return components;
+    }
+};
+export default handler;
+//# sourceMappingURL=mailto.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.js.map
new file mode 100644
index 0000000..82dba9a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/mailto.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"mailto.js","sourceRoot":"","sources":["../../../src/schemes/mailto.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,QAAQ,CAAC;AACpE,OAAO,QAAQ,MAAM,UAAU,CAAC;AAChC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAa9D,MAAM,CAAC,GAAiB,EAAE,CAAC;AAC3B,MAAM,KAAK,GAAG,IAAI,CAAC;AAEnB,UAAU;AACV,MAAM,YAAY,GAAG,wBAAwB,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,2EAA2E,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;AACjJ,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAE,kBAAkB;AACnD,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,GAAG,QAAQ,GAAG,GAAG,GAAG,QAAQ,GAAG,QAAQ,GAAG,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,aAAa,GAAG,QAAQ,GAAG,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAE,UAAU;AAE7O,qEAAqE;AACrE,yFAAyF;AACzF,+BAA+B;AAC/B,uGAAuG;AACvG,+GAA+G;AAC/G,kCAAkC;AAClC,+BAA+B;AAC/B,wGAAwG;AACxG,8EAA8E;AAC9E,8FAA8F;AAC9F,mGAAmG;AACnG,MAAM,OAAO,GAAG,uDAAuD,CAAC;AACxE,MAAM,OAAO,GAAG,4DAA4D,CAAC;AAC7E,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;AAC7C,MAAM,cAAc,GAAG,MAAM,CAAC,OAAO,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,GAAG,OAAO,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACnF,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;AAC9C,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,GAAG,GAAG,GAAG,YAAY,CAAC,CAAC;AACvD,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC;AAE/D,UAAU;AACV,MAAM,cAAc,GAAG,0BAA0B,CAAC,CAAE,oBAAoB;AACxE,MAAM,aAAa,GAAG,qCAAqC,CAAC;AAC5D,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,GAAG,GAAG,GAAG,YAAY,GAAG,GAAG,GAAG,aAAa,CAAC,CAAC;AAC/E,MAAM,OAAO,GAAG,MAAM,CAAC,cAAc,GAAG,GAAG,GAAG,KAAK,GAAG,cAAc,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC;AACpF,MAAM,WAAW,GAAG,MAAM,CAAC,cAAc,GAAG,GAAG,GAAG,cAAc,CAAC,CAAC;AAClE,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,GAAG,KAAK,GAAG,OAAO,CAAC,CAAC;AACzD,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC;AAClE,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;AACrC,MAAM,QAAQ,GAAG,OAAO,CAAC;AACzB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,GAAG,KAAK,GAAG,QAAQ,CAAC,CAAC;AACnD,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;AAClE,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;AAC3C,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,YAAY,GAAG,GAAG,GAAG,GAAG,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC;AAE1E,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;AACjD,MAAM,WAAW,GAAG,IAAI,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;AAClD,MAAM,cAAc,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC;AACzF,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC;AACrG,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,EAAE,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC;AAC9E,MAAM,WAAW,GAAG,UAAU,CAAC;AAC/B,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;AACvC,MAAM,OAAO,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;AAElD,0BAA0B,GAAU;IACnC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACnD,CAAC;AAED,MAAM,OAAO,GAAuC;IACnD,MAAM,EAAG,QAAQ;IAEjB,KAAK,EAAG,UAAU,UAAwB,EAAE,OAAkB;QAC7D,MAAM,gBAAgB,GAAG,UAA8B,CAAC;QACxD,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjG,gBAAgB,CAAC,IAAI,GAAG,SAAS,CAAC;QAElC,IAAI,gBAAgB,CAAC,KAAK,EAAE;YAC3B,IAAI,cAAc,GAAG,KAAK,CAAA;YAC1B,MAAM,OAAO,GAAiB,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAElD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE;gBACjD,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAErC,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;oBAClB,KAAK,IAAI;wBACR,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;wBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE;4BACjD,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;yBACpB;wBACD,MAAM;oBACP,KAAK,SAAS;wBACb,gBAAgB,CAAC,OAAO,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;wBACjE,MAAM;oBACP,KAAK,MAAM;wBACV,gBAAgB,CAAC,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;wBAC9D,MAAM;oBACP;wBACC,cAAc,GAAG,IAAI,CAAC;wBACtB,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;wBACvF,MAAM;iBACP;aACD;YAED,IAAI,cAAc;gBAAE,gBAAgB,CAAC,OAAO,GAAG,OAAO,CAAC;SACvD;QAED,gBAAgB,CAAC,KAAK,GAAG,SAAS,CAAC;QAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE;YAC5C,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAE9B,IAAI,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAErC,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE;gBAC5B,kCAAkC;gBAClC,IAAI;oBACH,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;iBAC9E;gBAAC,OAAO,CAAC,EAAE;oBACX,gBAAgB,CAAC,KAAK,GAAG,gBAAgB,CAAC,KAAK,IAAI,0EAA0E,GAAG,CAAC,CAAC;iBAClI;aACD;iBAAM;gBACN,IAAI,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;aAC5D;YAED,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACvB;QAED,OAAO,gBAAgB,CAAC;IACzB,CAAC;IAED,SAAS,EAAG,UAAU,gBAAiC,EAAE,OAAkB;QAC1E,MAAM,UAAU,GAAG,gBAAiC,CAAC;QACrD,MAAM,EAAE,GAAG,OAAO,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,EAAE,EAAE;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE;gBAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBACtC,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,OAAO,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;gBACxJ,IAAI,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAErC,0BAA0B;gBAC1B,IAAI;oBACH,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,iBAAiB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;iBAC1H;gBAAC,OAAO,CAAC,EAAE;oBACX,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,sDAAsD,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,iBAAiB,GAAG,CAAC,CAAC;iBAC7J;gBAED,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,GAAG,GAAG,MAAM,CAAC;aACjC;YAED,UAAU,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAC/B;QAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,GAAG,gBAAgB,CAAC,OAAO,IAAI,EAAE,CAAC;QAE1E,IAAI,gBAAgB,CAAC,OAAO;YAAE,OAAO,CAAC,SAAS,CAAC,GAAG,gBAAgB,CAAC,OAAO,CAAC;QAC5E,IAAI,gBAAgB,CAAC,IAAI;YAAE,OAAO,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC;QAEnE,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;YAC3B,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE;gBAC9B,MAAM,CAAC,IAAI,CACV,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC;oBAC7G,GAAG;oBACH,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,UAAU,CAAC,CACvH,CAAC;aACF;SACD;QACD,IAAI,MAAM,CAAC,MAAM,EAAE;YAClB,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACpC;QAED,OAAO,UAAU,CAAC;IACnB,CAAC;CACD,CAAA;AAED,eAAe,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.d.ts
new file mode 100644
index 0000000..e75f2e7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.d.ts
@@ -0,0 +1,7 @@
+import { URISchemeHandler, URIOptions } from "../uri";
+import { URNComponents } from "./urn";
+export interface UUIDComponents extends URNComponents {
+    uuid?: string;
+}
+declare const handler: URISchemeHandler<UUIDComponents, URIOptions, URNComponents>;
+export default handler;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.js
new file mode 100644
index 0000000..d1fce49
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.js
@@ -0,0 +1,23 @@
+const UUID = /^[0-9A-Fa-f]{8}(?:\-[0-9A-Fa-f]{4}){3}\-[0-9A-Fa-f]{12}$/;
+const UUID_PARSE = /^[0-9A-Fa-f\-]{36}/;
+//RFC 4122
+const handler = {
+    scheme: "urn:uuid",
+    parse: function (urnComponents, options) {
+        const uuidComponents = urnComponents;
+        uuidComponents.uuid = uuidComponents.nss;
+        uuidComponents.nss = undefined;
+        if (!options.tolerant && (!uuidComponents.uuid || !uuidComponents.uuid.match(UUID))) {
+            uuidComponents.error = uuidComponents.error || "UUID is not valid.";
+        }
+        return uuidComponents;
+    },
+    serialize: function (uuidComponents, options) {
+        const urnComponents = uuidComponents;
+        //normalize UUID
+        urnComponents.nss = (uuidComponents.uuid || "").toLowerCase();
+        return urnComponents;
+    },
+};
+export default handler;
+//# sourceMappingURL=urn-uuid.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.js.map
new file mode 100644
index 0000000..3b7a8b3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn-uuid.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"urn-uuid.js","sourceRoot":"","sources":["../../../src/schemes/urn-uuid.ts"],"names":[],"mappings":"AAQA,MAAM,IAAI,GAAG,0DAA0D,CAAC;AACxE,MAAM,UAAU,GAAG,oBAAoB,CAAC;AAExC,UAAU;AACV,MAAM,OAAO,GAA+D;IAC3E,MAAM,EAAG,UAAU;IAEnB,KAAK,EAAG,UAAU,aAA2B,EAAE,OAAkB;QAChE,MAAM,cAAc,GAAG,aAA+B,CAAC;QACvD,cAAc,CAAC,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC;QACzC,cAAc,CAAC,GAAG,GAAG,SAAS,CAAC;QAE/B,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE;YACpF,cAAc,CAAC,KAAK,GAAG,cAAc,CAAC,KAAK,IAAI,oBAAoB,CAAC;SACpE;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAED,SAAS,EAAG,UAAU,cAA6B,EAAE,OAAkB;QACtE,MAAM,aAAa,GAAG,cAA+B,CAAC;QACtD,gBAAgB;QAChB,aAAa,CAAC,GAAG,GAAG,CAAC,cAAc,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9D,OAAO,aAAa,CAAC;IACtB,CAAC;CACD,CAAC;AAEF,eAAe,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.d.ts
new file mode 100644
index 0000000..7e0c2fb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.d.ts
@@ -0,0 +1,10 @@
+import { URISchemeHandler, URIComponents, URIOptions } from "../uri";
+export interface URNComponents extends URIComponents {
+    nid?: string;
+    nss?: string;
+}
+export interface URNOptions extends URIOptions {
+    nid?: string;
+}
+declare const handler: URISchemeHandler<URNComponents, URNOptions>;
+export default handler;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.js
new file mode 100644
index 0000000..5d3f10a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.js
@@ -0,0 +1,49 @@
+import { SCHEMES } from "../uri";
+const NID$ = "(?:[0-9A-Za-z][0-9A-Za-z\\-]{1,31})";
+const PCT_ENCODED$ = "(?:\\%[0-9A-Fa-f]{2})";
+const TRANS$$ = "[0-9A-Za-z\\(\\)\\+\\,\\-\\.\\:\\=\\@\\;\\$\\_\\!\\*\\'\\/\\?\\#]";
+const NSS$ = "(?:(?:" + PCT_ENCODED$ + "|" + TRANS$$ + ")+)";
+const URN_SCHEME = new RegExp("^urn\\:(" + NID$ + ")$");
+const URN_PATH = new RegExp("^(" + NID$ + ")\\:(" + NSS$ + ")$");
+const URN_PARSE = /^([^\:]+)\:(.*)/;
+const URN_EXCLUDED = /[\x00-\x20\\\"\&\<\>\[\]\^\`\{\|\}\~\x7F-\xFF]/g;
+//RFC 2141
+const handler = {
+    scheme: "urn",
+    parse: function (components, options) {
+        const matches = components.path && components.path.match(URN_PARSE);
+        let urnComponents = components;
+        if (matches) {
+            const scheme = options.scheme || urnComponents.scheme || "urn";
+            const nid = matches[1].toLowerCase();
+            const nss = matches[2];
+            const urnScheme = `${scheme}:${options.nid || nid}`;
+            const schemeHandler = SCHEMES[urnScheme];
+            urnComponents.nid = nid;
+            urnComponents.nss = nss;
+            urnComponents.path = undefined;
+            if (schemeHandler) {
+                urnComponents = schemeHandler.parse(urnComponents, options);
+            }
+        }
+        else {
+            urnComponents.error = urnComponents.error || "URN can not be parsed.";
+        }
+        return urnComponents;
+    },
+    serialize: function (urnComponents, options) {
+        const scheme = options.scheme || urnComponents.scheme || "urn";
+        const nid = urnComponents.nid;
+        const urnScheme = `${scheme}:${options.nid || nid}`;
+        const schemeHandler = SCHEMES[urnScheme];
+        if (schemeHandler) {
+            urnComponents = schemeHandler.serialize(urnComponents, options);
+        }
+        const uriComponents = urnComponents;
+        const nss = urnComponents.nss;
+        uriComponents.path = `${nid || options.nid}:${nss}`;
+        return uriComponents;
+    },
+};
+export default handler;
+//# sourceMappingURL=urn.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.js.map
new file mode 100644
index 0000000..ea43b0b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/urn.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"urn.js","sourceRoot":"","sources":["../../../src/schemes/urn.ts"],"names":[],"mappings":"AACA,OAAO,EAAc,OAAO,EAAE,MAAM,QAAQ,CAAC;AAW7C,MAAM,IAAI,GAAG,qCAAqC,CAAC;AACnD,MAAM,YAAY,GAAG,uBAAuB,CAAC;AAC7C,MAAM,OAAO,GAAG,mEAAmE,CAAC;AACpF,MAAM,IAAI,GAAG,QAAQ,GAAG,YAAY,GAAG,GAAG,GAAG,OAAO,GAAG,KAAK,CAAC;AAC7D,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AACxD,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AACjE,MAAM,SAAS,GAAG,iBAAiB,CAAC;AACpC,MAAM,YAAY,GAAG,iDAAiD,CAAC;AAEvE,UAAU;AACV,MAAM,OAAO,GAA8C;IAC1D,MAAM,EAAG,KAAK;IAEd,KAAK,EAAG,UAAU,UAAwB,EAAE,OAAkB;QAC7D,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACpE,IAAI,aAAa,GAAG,UAA2B,CAAC;QAEhD,IAAI,OAAO,EAAE;YACZ,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,aAAa,CAAC,MAAM,IAAI,KAAK,CAAC;YAC/D,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,SAAS,GAAG,GAAG,MAAM,IAAI,OAAO,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;YACpD,MAAM,aAAa,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;YAEzC,aAAa,CAAC,GAAG,GAAG,GAAG,CAAC;YACxB,aAAa,CAAC,GAAG,GAAG,GAAG,CAAC;YACxB,aAAa,CAAC,IAAI,GAAG,SAAS,CAAC;YAE/B,IAAI,aAAa,EAAE;gBAClB,aAAa,GAAG,aAAa,CAAC,KAAK,CAAC,aAAa,EAAE,OAAO,CAAkB,CAAC;aAC7E;SACD;aAAM;YACN,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,IAAI,wBAAwB,CAAC;SACtE;QAED,OAAO,aAAa,CAAC;IACtB,CAAC;IAED,SAAS,EAAG,UAAU,aAA2B,EAAE,OAAkB;QACpE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,aAAa,CAAC,MAAM,IAAI,KAAK,CAAC;QAC/D,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC;QAC9B,MAAM,SAAS,GAAG,GAAG,MAAM,IAAI,OAAO,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;QACpD,MAAM,aAAa,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;QAEzC,IAAI,aAAa,EAAE;YAClB,aAAa,GAAG,aAAa,CAAC,SAAS,CAAC,aAAa,EAAE,OAAO,CAAkB,CAAC;SACjF;QAED,MAAM,aAAa,GAAG,aAA8B,CAAC;QACrD,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC;QAC9B,aAAa,CAAC,IAAI,GAAG,GAAG,GAAG,IAAI,OAAO,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;QAEpD,OAAO,aAAa,CAAC;IACtB,CAAC;CACD,CAAC;AAEF,eAAe,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.d.ts
new file mode 100644
index 0000000..47f4835
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.d.ts
@@ -0,0 +1,7 @@
+import { URISchemeHandler, URIComponents } from "../uri";
+export interface WSComponents extends URIComponents {
+    resourceName?: string;
+    secure?: boolean;
+}
+declare const handler: URISchemeHandler;
+export default handler;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.js
new file mode 100644
index 0000000..9277f03
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.js
@@ -0,0 +1,41 @@
+function isSecure(wsComponents) {
+    return typeof wsComponents.secure === 'boolean' ? wsComponents.secure : String(wsComponents.scheme).toLowerCase() === "wss";
+}
+//RFC 6455
+const handler = {
+    scheme: "ws",
+    domainHost: true,
+    parse: function (components, options) {
+        const wsComponents = components;
+        //indicate if the secure flag is set
+        wsComponents.secure = isSecure(wsComponents);
+        //construct resouce name
+        wsComponents.resourceName = (wsComponents.path || '/') + (wsComponents.query ? '?' + wsComponents.query : '');
+        wsComponents.path = undefined;
+        wsComponents.query = undefined;
+        return wsComponents;
+    },
+    serialize: function (wsComponents, options) {
+        //normalize the default port
+        if (wsComponents.port === (isSecure(wsComponents) ? 443 : 80) || wsComponents.port === "") {
+            wsComponents.port = undefined;
+        }
+        //ensure scheme matches secure flag
+        if (typeof wsComponents.secure === 'boolean') {
+            wsComponents.scheme = (wsComponents.secure ? 'wss' : 'ws');
+            wsComponents.secure = undefined;
+        }
+        //reconstruct path from resource name
+        if (wsComponents.resourceName) {
+            const [path, query] = wsComponents.resourceName.split('?');
+            wsComponents.path = (path && path !== '/' ? path : undefined);
+            wsComponents.query = query;
+            wsComponents.resourceName = undefined;
+        }
+        //forbid fragment component
+        wsComponents.fragment = undefined;
+        return wsComponents;
+    }
+};
+export default handler;
+//# sourceMappingURL=ws.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.js.map
new file mode 100644
index 0000000..186818c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/ws.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"ws.js","sourceRoot":"","sources":["../../../src/schemes/ws.ts"],"names":[],"mappings":"AAOA,kBAAkB,YAAyB;IAC1C,OAAO,OAAO,YAAY,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC;AAC7H,CAAC;AAED,UAAU;AACV,MAAM,OAAO,GAAoB;IAChC,MAAM,EAAG,IAAI;IAEb,UAAU,EAAG,IAAI;IAEjB,KAAK,EAAG,UAAU,UAAwB,EAAE,OAAkB;QAC7D,MAAM,YAAY,GAAG,UAA0B,CAAC;QAEhD,oCAAoC;QACpC,YAAY,CAAC,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;QAE7C,wBAAwB;QACxB,YAAY,CAAC,YAAY,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC9G,YAAY,CAAC,IAAI,GAAG,SAAS,CAAC;QAC9B,YAAY,CAAC,KAAK,GAAG,SAAS,CAAC;QAE/B,OAAO,YAAY,CAAC;IACrB,CAAC;IAED,SAAS,EAAG,UAAU,YAAyB,EAAE,OAAkB;QAClE,4BAA4B;QAC5B,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,IAAI,KAAK,EAAE,EAAE;YAC1F,YAAY,CAAC,IAAI,GAAG,SAAS,CAAC;SAC9B;QAED,mCAAmC;QACnC,IAAI,OAAO,YAAY,CAAC,MAAM,KAAK,SAAS,EAAE;YAC7C,YAAY,CAAC,MAAM,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC3D,YAAY,CAAC,MAAM,GAAG,SAAS,CAAC;SAChC;QAED,qCAAqC;QACrC,IAAI,YAAY,CAAC,YAAY,EAAE;YAC9B,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,YAAY,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAC9D,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC;YAC3B,YAAY,CAAC,YAAY,GAAG,SAAS,CAAC;SACtC;QAED,2BAA2B;QAC3B,YAAY,CAAC,QAAQ,GAAG,SAAS,CAAC;QAElC,OAAO,YAAY,CAAC;IACrB,CAAC;CACD,CAAC;AAEF,eAAe,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.d.ts
new file mode 100644
index 0000000..fe5b2f3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.d.ts
@@ -0,0 +1,3 @@
+import { URISchemeHandler } from "../uri";
+declare const handler: URISchemeHandler;
+export default handler;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.js
new file mode 100644
index 0000000..d1e22cc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.js
@@ -0,0 +1,9 @@
+import ws from "./ws";
+const handler = {
+    scheme: "wss",
+    domainHost: ws.domainHost,
+    parse: ws.parse,
+    serialize: ws.serialize
+};
+export default handler;
+//# sourceMappingURL=wss.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.js.map
new file mode 100644
index 0000000..e19006d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/schemes/wss.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"wss.js","sourceRoot":"","sources":["../../../src/schemes/wss.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,MAAM,CAAC;AAEtB,MAAM,OAAO,GAAoB;IAChC,MAAM,EAAG,KAAK;IACd,UAAU,EAAG,EAAE,CAAC,UAAU;IAC1B,KAAK,EAAG,EAAE,CAAC,KAAK;IAChB,SAAS,EAAG,EAAE,CAAC,SAAS;CACxB,CAAA;AAED,eAAe,OAAO,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.d.ts
new file mode 100644
index 0000000..da51e23
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.d.ts
@@ -0,0 +1,59 @@
+export interface URIComponents {
+    scheme?: string;
+    userinfo?: string;
+    host?: string;
+    port?: number | string;
+    path?: string;
+    query?: string;
+    fragment?: string;
+    reference?: string;
+    error?: string;
+}
+export interface URIOptions {
+    scheme?: string;
+    reference?: string;
+    tolerant?: boolean;
+    absolutePath?: boolean;
+    iri?: boolean;
+    unicodeSupport?: boolean;
+    domainHost?: boolean;
+}
+export interface URISchemeHandler<Components extends URIComponents = URIComponents, Options extends URIOptions = URIOptions, ParentComponents extends URIComponents = URIComponents> {
+    scheme: string;
+    parse(components: ParentComponents, options: Options): Components;
+    serialize(components: Components, options: Options): ParentComponents;
+    unicodeSupport?: boolean;
+    domainHost?: boolean;
+    absolutePath?: boolean;
+}
+export interface URIRegExps {
+    NOT_SCHEME: RegExp;
+    NOT_USERINFO: RegExp;
+    NOT_HOST: RegExp;
+    NOT_PATH: RegExp;
+    NOT_PATH_NOSCHEME: RegExp;
+    NOT_QUERY: RegExp;
+    NOT_FRAGMENT: RegExp;
+    ESCAPE: RegExp;
+    UNRESERVED: RegExp;
+    OTHER_CHARS: RegExp;
+    PCT_ENCODED: RegExp;
+    IPV4ADDRESS: RegExp;
+    IPV6ADDRESS: RegExp;
+}
+export declare const SCHEMES: {
+    [scheme: string]: URISchemeHandler;
+};
+export declare function pctEncChar(chr: string): string;
+export declare function pctDecChars(str: string): string;
+export declare function parse(uriString: string, options?: URIOptions): URIComponents;
+export declare function removeDotSegments(input: string): string;
+export declare function serialize(components: URIComponents, options?: URIOptions): string;
+export declare function resolveComponents(base: URIComponents, relative: URIComponents, options?: URIOptions, skipNormalization?: boolean): URIComponents;
+export declare function resolve(baseURI: string, relativeURI: string, options?: URIOptions): string;
+export declare function normalize(uri: string, options?: URIOptions): string;
+export declare function normalize(uri: URIComponents, options?: URIOptions): URIComponents;
+export declare function equal(uriA: string, uriB: string, options?: URIOptions): boolean;
+export declare function equal(uriA: URIComponents, uriB: URIComponents, options?: URIOptions): boolean;
+export declare function escapeComponent(str: string, options?: URIOptions): string;
+export declare function unescapeComponent(str: string, options?: URIOptions): string;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.js
new file mode 100644
index 0000000..659ce26
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.js
@@ -0,0 +1,480 @@
+/**
+ * URI.js
+ *
+ * @fileoverview An RFC 3986 compliant, scheme extendable URI parsing/validating/resolving library for JavaScript.
+ * @author <a href="mailto:gary.court@gmail.com">Gary Court</a>
+ * @see http://github.com/garycourt/uri-js
+ */
+/**
+ * Copyright 2011 Gary Court. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without modification, are
+ * permitted provided that the following conditions are met:
+ *
+ *    1. Redistributions of source code must retain the above copyright notice, this list of
+ *       conditions and the following disclaimer.
+ *
+ *    2. Redistributions in binary form must reproduce the above copyright notice, this list
+ *       of conditions and the following disclaimer in the documentation and/or other materials
+ *       provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY GARY COURT ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GARY COURT OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * The views and conclusions contained in the software and documentation are those of the
+ * authors and should not be interpreted as representing official policies, either expressed
+ * or implied, of Gary Court.
+ */
+import URI_PROTOCOL from "./regexps-uri";
+import IRI_PROTOCOL from "./regexps-iri";
+import punycode from "punycode";
+import { toUpperCase, typeOf, assign } from "./util";
+export const SCHEMES = {};
+export function pctEncChar(chr) {
+    const c = chr.charCodeAt(0);
+    let e;
+    if (c < 16)
+        e = "%0" + c.toString(16).toUpperCase();
+    else if (c < 128)
+        e = "%" + c.toString(16).toUpperCase();
+    else if (c < 2048)
+        e = "%" + ((c >> 6) | 192).toString(16).toUpperCase() + "%" + ((c & 63) | 128).toString(16).toUpperCase();
+    else
+        e = "%" + ((c >> 12) | 224).toString(16).toUpperCase() + "%" + (((c >> 6) & 63) | 128).toString(16).toUpperCase() + "%" + ((c & 63) | 128).toString(16).toUpperCase();
+    return e;
+}
+export function pctDecChars(str) {
+    let newStr = "";
+    let i = 0;
+    const il = str.length;
+    while (i < il) {
+        const c = parseInt(str.substr(i + 1, 2), 16);
+        if (c < 128) {
+            newStr += String.fromCharCode(c);
+            i += 3;
+        }
+        else if (c >= 194 && c < 224) {
+            if ((il - i) >= 6) {
+                const c2 = parseInt(str.substr(i + 4, 2), 16);
+                newStr += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
+            }
+            else {
+                newStr += str.substr(i, 6);
+            }
+            i += 6;
+        }
+        else if (c >= 224) {
+            if ((il - i) >= 9) {
+                const c2 = parseInt(str.substr(i + 4, 2), 16);
+                const c3 = parseInt(str.substr(i + 7, 2), 16);
+                newStr += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
+            }
+            else {
+                newStr += str.substr(i, 9);
+            }
+            i += 9;
+        }
+        else {
+            newStr += str.substr(i, 3);
+            i += 3;
+        }
+    }
+    return newStr;
+}
+function _normalizeComponentEncoding(components, protocol) {
+    function decodeUnreserved(str) {
+        const decStr = pctDecChars(str);
+        return (!decStr.match(protocol.UNRESERVED) ? str : decStr);
+    }
+    if (components.scheme)
+        components.scheme = String(components.scheme).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_SCHEME, "");
+    if (components.userinfo !== undefined)
+        components.userinfo = String(components.userinfo).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_USERINFO, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.host !== undefined)
+        components.host = String(components.host).replace(protocol.PCT_ENCODED, decodeUnreserved).toLowerCase().replace(protocol.NOT_HOST, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.path !== undefined)
+        components.path = String(components.path).replace(protocol.PCT_ENCODED, decodeUnreserved).replace((components.scheme ? protocol.NOT_PATH : protocol.NOT_PATH_NOSCHEME), pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.query !== undefined)
+        components.query = String(components.query).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_QUERY, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    if (components.fragment !== undefined)
+        components.fragment = String(components.fragment).replace(protocol.PCT_ENCODED, decodeUnreserved).replace(protocol.NOT_FRAGMENT, pctEncChar).replace(protocol.PCT_ENCODED, toUpperCase);
+    return components;
+}
+;
+function _stripLeadingZeros(str) {
+    return str.replace(/^0*(.*)/, "$1") || "0";
+}
+function _normalizeIPv4(host, protocol) {
+    const matches = host.match(protocol.IPV4ADDRESS) || [];
+    const [, address] = matches;
+    if (address) {
+        return address.split(".").map(_stripLeadingZeros).join(".");
+    }
+    else {
+        return host;
+    }
+}
+function _normalizeIPv6(host, protocol) {
+    const matches = host.match(protocol.IPV6ADDRESS) || [];
+    const [, address, zone] = matches;
+    if (address) {
+        const [last, first] = address.toLowerCase().split('::').reverse();
+        const firstFields = first ? first.split(":").map(_stripLeadingZeros) : [];
+        const lastFields = last.split(":").map(_stripLeadingZeros);
+        const isLastFieldIPv4Address = protocol.IPV4ADDRESS.test(lastFields[lastFields.length - 1]);
+        const fieldCount = isLastFieldIPv4Address ? 7 : 8;
+        const lastFieldsStart = lastFields.length - fieldCount;
+        const fields = Array(fieldCount);
+        for (let x = 0; x < fieldCount; ++x) {
+            fields[x] = firstFields[x] || lastFields[lastFieldsStart + x] || '';
+        }
+        if (isLastFieldIPv4Address) {
+            fields[fieldCount - 1] = _normalizeIPv4(fields[fieldCount - 1], protocol);
+        }
+        const allZeroFields = fields.reduce((acc, field, index) => {
+            if (!field || field === "0") {
+                const lastLongest = acc[acc.length - 1];
+                if (lastLongest && lastLongest.index + lastLongest.length === index) {
+                    lastLongest.length++;
+                }
+                else {
+                    acc.push({ index, length: 1 });
+                }
+            }
+            return acc;
+        }, []);
+        const longestZeroFields = allZeroFields.sort((a, b) => b.length - a.length)[0];
+        let newHost;
+        if (longestZeroFields && longestZeroFields.length > 1) {
+            const newFirst = fields.slice(0, longestZeroFields.index);
+            const newLast = fields.slice(longestZeroFields.index + longestZeroFields.length);
+            newHost = newFirst.join(":") + "::" + newLast.join(":");
+        }
+        else {
+            newHost = fields.join(":");
+        }
+        if (zone) {
+            newHost += "%" + zone;
+        }
+        return newHost;
+    }
+    else {
+        return host;
+    }
+}
+const URI_PARSE = /^(?:([^:\/?#]+):)?(?:\/\/((?:([^\/?#@]*)@)?(\[[^\/?#\]]+\]|[^\/?#:]*)(?:\:(\d*))?))?([^?#]*)(?:\?([^#]*))?(?:#((?:.|\n|\r)*))?/i;
+const NO_MATCH_IS_UNDEFINED = ("").match(/(){0}/)[1] === undefined;
+export function parse(uriString, options = {}) {
+    const components = {};
+    const protocol = (options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL);
+    if (options.reference === "suffix")
+        uriString = (options.scheme ? options.scheme + ":" : "") + "//" + uriString;
+    const matches = uriString.match(URI_PARSE);
+    if (matches) {
+        if (NO_MATCH_IS_UNDEFINED) {
+            //store each component
+            components.scheme = matches[1];
+            components.userinfo = matches[3];
+            components.host = matches[4];
+            components.port = parseInt(matches[5], 10);
+            components.path = matches[6] || "";
+            components.query = matches[7];
+            components.fragment = matches[8];
+            //fix port number
+            if (isNaN(components.port)) {
+                components.port = matches[5];
+            }
+        }
+        else { //IE FIX for improper RegExp matching
+            //store each component
+            components.scheme = matches[1] || undefined;
+            components.userinfo = (uriString.indexOf("@") !== -1 ? matches[3] : undefined);
+            components.host = (uriString.indexOf("//") !== -1 ? matches[4] : undefined);
+            components.port = parseInt(matches[5], 10);
+            components.path = matches[6] || "";
+            components.query = (uriString.indexOf("?") !== -1 ? matches[7] : undefined);
+            components.fragment = (uriString.indexOf("#") !== -1 ? matches[8] : undefined);
+            //fix port number
+            if (isNaN(components.port)) {
+                components.port = (uriString.match(/\/\/(?:.|\n)*\:(?:\/|\?|\#|$)/) ? matches[4] : undefined);
+            }
+        }
+        if (components.host) {
+            //normalize IP hosts
+            components.host = _normalizeIPv6(_normalizeIPv4(components.host, protocol), protocol);
+        }
+        //determine reference type
+        if (components.scheme === undefined && components.userinfo === undefined && components.host === undefined && components.port === undefined && !components.path && components.query === undefined) {
+            components.reference = "same-document";
+        }
+        else if (components.scheme === undefined) {
+            components.reference = "relative";
+        }
+        else if (components.fragment === undefined) {
+            components.reference = "absolute";
+        }
+        else {
+            components.reference = "uri";
+        }
+        //check for reference errors
+        if (options.reference && options.reference !== "suffix" && options.reference !== components.reference) {
+            components.error = components.error || "URI is not a " + options.reference + " reference.";
+        }
+        //find scheme handler
+        const schemeHandler = SCHEMES[(options.scheme || components.scheme || "").toLowerCase()];
+        //check if scheme can't handle IRIs
+        if (!options.unicodeSupport && (!schemeHandler || !schemeHandler.unicodeSupport)) {
+            //if host component is a domain name
+            if (components.host && (options.domainHost || (schemeHandler && schemeHandler.domainHost))) {
+                //convert Unicode IDN -> ASCII IDN
+                try {
+                    components.host = punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase());
+                }
+                catch (e) {
+                    components.error = components.error || "Host's domain name can not be converted to ASCII via punycode: " + e;
+                }
+            }
+            //convert IRI -> URI
+            _normalizeComponentEncoding(components, URI_PROTOCOL);
+        }
+        else {
+            //normalize encodings
+            _normalizeComponentEncoding(components, protocol);
+        }
+        //perform scheme specific parsing
+        if (schemeHandler && schemeHandler.parse) {
+            schemeHandler.parse(components, options);
+        }
+    }
+    else {
+        components.error = components.error || "URI can not be parsed.";
+    }
+    return components;
+}
+;
+function _recomposeAuthority(components, options) {
+    const protocol = (options.iri !== false ? IRI_PROTOCOL : URI_PROTOCOL);
+    const uriTokens = [];
+    if (components.userinfo !== undefined) {
+        uriTokens.push(components.userinfo);
+        uriTokens.push("@");
+    }
+    if (components.host !== undefined) {
+        //normalize IP hosts, add brackets and escape zone separator for IPv6
+        uriTokens.push(_normalizeIPv6(_normalizeIPv4(String(components.host), protocol), protocol).replace(protocol.IPV6ADDRESS, (_, $1, $2) => "[" + $1 + ($2 ? "%25" + $2 : "") + "]"));
+    }
+    if (typeof components.port === "number" || typeof components.port === "string") {
+        uriTokens.push(":");
+        uriTokens.push(String(components.port));
+    }
+    return uriTokens.length ? uriTokens.join("") : undefined;
+}
+;
+const RDS1 = /^\.\.?\//;
+const RDS2 = /^\/\.(\/|$)/;
+const RDS3 = /^\/\.\.(\/|$)/;
+const RDS4 = /^\.\.?$/;
+const RDS5 = /^\/?(?:.|\n)*?(?=\/|$)/;
+export function removeDotSegments(input) {
+    const output = [];
+    while (input.length) {
+        if (input.match(RDS1)) {
+            input = input.replace(RDS1, "");
+        }
+        else if (input.match(RDS2)) {
+            input = input.replace(RDS2, "/");
+        }
+        else if (input.match(RDS3)) {
+            input = input.replace(RDS3, "/");
+            output.pop();
+        }
+        else if (input === "." || input === "..") {
+            input = "";
+        }
+        else {
+            const im = input.match(RDS5);
+            if (im) {
+                const s = im[0];
+                input = input.slice(s.length);
+                output.push(s);
+            }
+            else {
+                throw new Error("Unexpected dot segment condition");
+            }
+        }
+    }
+    return output.join("");
+}
+;
+export function serialize(components, options = {}) {
+    const protocol = (options.iri ? IRI_PROTOCOL : URI_PROTOCOL);
+    const uriTokens = [];
+    //find scheme handler
+    const schemeHandler = SCHEMES[(options.scheme || components.scheme || "").toLowerCase()];
+    //perform scheme specific serialization
+    if (schemeHandler && schemeHandler.serialize)
+        schemeHandler.serialize(components, options);
+    if (components.host) {
+        //if host component is an IPv6 address
+        if (protocol.IPV6ADDRESS.test(components.host)) {
+            //TODO: normalize IPv6 address as per RFC 5952
+        }
+        //if host component is a domain name
+        else if (options.domainHost || (schemeHandler && schemeHandler.domainHost)) {
+            //convert IDN via punycode
+            try {
+                components.host = (!options.iri ? punycode.toASCII(components.host.replace(protocol.PCT_ENCODED, pctDecChars).toLowerCase()) : punycode.toUnicode(components.host));
+            }
+            catch (e) {
+                components.error = components.error || "Host's domain name can not be converted to " + (!options.iri ? "ASCII" : "Unicode") + " via punycode: " + e;
+            }
+        }
+    }
+    //normalize encoding
+    _normalizeComponentEncoding(components, protocol);
+    if (options.reference !== "suffix" && components.scheme) {
+        uriTokens.push(components.scheme);
+        uriTokens.push(":");
+    }
+    const authority = _recomposeAuthority(components, options);
+    if (authority !== undefined) {
+        if (options.reference !== "suffix") {
+            uriTokens.push("//");
+        }
+        uriTokens.push(authority);
+        if (components.path && components.path.charAt(0) !== "/") {
+            uriTokens.push("/");
+        }
+    }
+    if (components.path !== undefined) {
+        let s = components.path;
+        if (!options.absolutePath && (!schemeHandler || !schemeHandler.absolutePath)) {
+            s = removeDotSegments(s);
+        }
+        if (authority === undefined) {
+            s = s.replace(/^\/\//, "/%2F"); //don't allow the path to start with "//"
+        }
+        uriTokens.push(s);
+    }
+    if (components.query !== undefined) {
+        uriTokens.push("?");
+        uriTokens.push(components.query);
+    }
+    if (components.fragment !== undefined) {
+        uriTokens.push("#");
+        uriTokens.push(components.fragment);
+    }
+    return uriTokens.join(""); //merge tokens into a string
+}
+;
+export function resolveComponents(base, relative, options = {}, skipNormalization) {
+    const target = {};
+    if (!skipNormalization) {
+        base = parse(serialize(base, options), options); //normalize base components
+        relative = parse(serialize(relative, options), options); //normalize relative components
+    }
+    options = options || {};
+    if (!options.tolerant && relative.scheme) {
+        target.scheme = relative.scheme;
+        //target.authority = relative.authority;
+        target.userinfo = relative.userinfo;
+        target.host = relative.host;
+        target.port = relative.port;
+        target.path = removeDotSegments(relative.path || "");
+        target.query = relative.query;
+    }
+    else {
+        if (relative.userinfo !== undefined || relative.host !== undefined || relative.port !== undefined) {
+            //target.authority = relative.authority;
+            target.userinfo = relative.userinfo;
+            target.host = relative.host;
+            target.port = relative.port;
+            target.path = removeDotSegments(relative.path || "");
+            target.query = relative.query;
+        }
+        else {
+            if (!relative.path) {
+                target.path = base.path;
+                if (relative.query !== undefined) {
+                    target.query = relative.query;
+                }
+                else {
+                    target.query = base.query;
+                }
+            }
+            else {
+                if (relative.path.charAt(0) === "/") {
+                    target.path = removeDotSegments(relative.path);
+                }
+                else {
+                    if ((base.userinfo !== undefined || base.host !== undefined || base.port !== undefined) && !base.path) {
+                        target.path = "/" + relative.path;
+                    }
+                    else if (!base.path) {
+                        target.path = relative.path;
+                    }
+                    else {
+                        target.path = base.path.slice(0, base.path.lastIndexOf("/") + 1) + relative.path;
+                    }
+                    target.path = removeDotSegments(target.path);
+                }
+                target.query = relative.query;
+            }
+            //target.authority = base.authority;
+            target.userinfo = base.userinfo;
+            target.host = base.host;
+            target.port = base.port;
+        }
+        target.scheme = base.scheme;
+    }
+    target.fragment = relative.fragment;
+    return target;
+}
+;
+export function resolve(baseURI, relativeURI, options) {
+    const schemelessOptions = assign({ scheme: 'null' }, options);
+    return serialize(resolveComponents(parse(baseURI, schemelessOptions), parse(relativeURI, schemelessOptions), schemelessOptions, true), schemelessOptions);
+}
+;
+export function normalize(uri, options) {
+    if (typeof uri === "string") {
+        uri = serialize(parse(uri, options), options);
+    }
+    else if (typeOf(uri) === "object") {
+        uri = parse(serialize(uri, options), options);
+    }
+    return uri;
+}
+;
+export function equal(uriA, uriB, options) {
+    if (typeof uriA === "string") {
+        uriA = serialize(parse(uriA, options), options);
+    }
+    else if (typeOf(uriA) === "object") {
+        uriA = serialize(uriA, options);
+    }
+    if (typeof uriB === "string") {
+        uriB = serialize(parse(uriB, options), options);
+    }
+    else if (typeOf(uriB) === "object") {
+        uriB = serialize(uriB, options);
+    }
+    return uriA === uriB;
+}
+;
+export function escapeComponent(str, options) {
+    return str && str.toString().replace((!options || !options.iri ? URI_PROTOCOL.ESCAPE : IRI_PROTOCOL.ESCAPE), pctEncChar);
+}
+;
+export function unescapeComponent(str, options) {
+    return str && str.toString().replace((!options || !options.iri ? URI_PROTOCOL.PCT_ENCODED : IRI_PROTOCOL.PCT_ENCODED), pctDecChars);
+}
+;
+//# sourceMappingURL=uri.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.js.map
new file mode 100644
index 0000000..2e72ab1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/uri.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"uri.js","sourceRoot":"","sources":["../../src/uri.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,YAAY,MAAM,eAAe,CAAC;AACzC,OAAO,YAAY,MAAM,eAAe,CAAC;AACzC,OAAO,QAAQ,MAAM,UAAU,CAAC;AAChC,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAiDrD,MAAM,CAAC,MAAM,OAAO,GAAsC,EAAE,CAAC;AAE7D,MAAM,qBAAqB,GAAU;IACpC,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,CAAQ,CAAC;IAEb,IAAI,CAAC,GAAG,EAAE;QAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;SAC/C,IAAI,CAAC,GAAG,GAAG;QAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;SACpD,IAAI,CAAC,GAAG,IAAI;QAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;;QACxH,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAE3K,OAAO,CAAC,CAAC;AACV,CAAC;AAED,MAAM,sBAAsB,GAAU;IACrC,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;IAEtB,OAAO,CAAC,GAAG,EAAE,EAAE;QACd,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAE7C,IAAI,CAAC,GAAG,GAAG,EAAE;YACZ,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC,IAAI,CAAC,CAAC;SACP;aACI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE;YAC7B,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE;gBAClB,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9C,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;aAC3D;iBAAM;gBACN,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aAC3B;YACD,CAAC,IAAI,CAAC,CAAC;SACP;aACI,IAAI,CAAC,IAAI,GAAG,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE;gBAClB,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9C,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9C,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;aAC/E;iBAAM;gBACN,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aAC3B;YACD,CAAC,IAAI,CAAC,CAAC;SACP;aACI;YACJ,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,CAAC,IAAI,CAAC,CAAC;SACP;KACD;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED,qCAAqC,UAAwB,EAAE,QAAmB;IACjF,0BAA0B,GAAU;QACnC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAChC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED,IAAI,UAAU,CAAC,MAAM;QAAE,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;IACpK,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS;QAAE,UAAU,CAAC,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IAC/N,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS;QAAE,UAAU,CAAC,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IAC7N,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS;QAAE,UAAU,CAAC,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IAClQ,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS;QAAE,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IACnN,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS;QAAE,UAAU,CAAC,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IAE/N,OAAO,UAAU,CAAC;AACnB,CAAC;AAAA,CAAC;AAEF,4BAA4B,GAAU;IACrC,OAAO,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC;AAC5C,CAAC;AAED,wBAAwB,IAAW,EAAE,QAAmB;IACvD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACvD,MAAM,CAAC,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC;IAE5B,IAAI,OAAO,EAAE;QACZ,OAAO,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAC5D;SAAM;QACN,OAAO,IAAI,CAAC;KACZ;AACF,CAAC;AAED,wBAAwB,IAAW,EAAE,QAAmB;IACvD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACvD,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG,OAAO,CAAC;IAElC,IAAI,OAAO,EAAE;QACZ,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAClE,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;QAC3D,MAAM,sBAAsB,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5F,MAAM,UAAU,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,GAAG,UAAU,CAAC;QACvD,MAAM,MAAM,GAAG,KAAK,CAAS,UAAU,CAAC,CAAC;QAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,EAAE,CAAC,EAAE;YACpC,MAAM,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,eAAe,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;SACpE;QAED,IAAI,sBAAsB,EAAE;YAC3B,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;SAC1E;QAED,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAsC,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;YAC9F,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,GAAG,EAAE;gBAC5B,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACxC,IAAI,WAAW,IAAI,WAAW,CAAC,KAAK,GAAG,WAAW,CAAC,MAAM,KAAK,KAAK,EAAE;oBACpE,WAAW,CAAC,MAAM,EAAE,CAAC;iBACrB;qBAAM;oBACN,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAG,CAAC,EAAE,CAAC,CAAC;iBAChC;aACD;YACD,OAAO,GAAG,CAAC;QACZ,CAAC,EAAE,EAAE,CAAC,CAAC;QAEP,MAAM,iBAAiB,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/E,IAAI,OAAc,CAAC;QACnB,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;YACtD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,KAAK,CAAC,CAAE;YAC3D,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;YACjF,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACxD;aAAM;YACN,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAC3B;QAED,IAAI,IAAI,EAAE;YACT,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC;SACtB;QAED,OAAO,OAAO,CAAC;KACf;SAAM;QACN,OAAO,IAAI,CAAC;KACZ;AACF,CAAC;AAED,MAAM,SAAS,GAAG,iIAAiI,CAAC;AACpJ,MAAM,qBAAqB,GAAsB,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;AAEvF,MAAM,gBAAgB,SAAgB,EAAE,UAAqB,EAAE;IAC9D,MAAM,UAAU,GAAiB,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAEvE,IAAI,OAAO,CAAC,SAAS,KAAK,QAAQ;QAAE,SAAS,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;IAEhH,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAE3C,IAAI,OAAO,EAAE;QACZ,IAAI,qBAAqB,EAAE;YAC1B,sBAAsB;YACtB,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,UAAU,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACjC,UAAU,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,UAAU,CAAC,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC3C,UAAU,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACnC,UAAU,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9B,UAAU,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAEjC,iBAAiB;YACjB,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;gBAC3B,UAAU,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;aAC7B;SACD;aAAM,EAAG,qCAAqC;YAC9C,sBAAsB;YACtB,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;YAC5C,UAAU,CAAC,QAAQ,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAC/E,UAAU,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAC5E,UAAU,CAAC,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC3C,UAAU,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACnC,UAAU,CAAC,KAAK,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAC5E,UAAU,CAAC,QAAQ,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAE/E,iBAAiB;YACjB,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;gBAC3B,UAAU,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;aAC9F;SACD;QAED,IAAI,UAAU,CAAC,IAAI,EAAE;YACpB,oBAAoB;YACpB,UAAU,CAAC,IAAI,GAAG,cAAc,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;SACtF;QAED,0BAA0B;QAC1B,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,EAAE;YACjM,UAAU,CAAC,SAAS,GAAG,eAAe,CAAC;SACvC;aAAM,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS,EAAE;YAC3C,UAAU,CAAC,SAAS,GAAG,UAAU,CAAC;SAClC;aAAM,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC7C,UAAU,CAAC,SAAS,GAAG,UAAU,CAAC;SAClC;aAAM;YACN,UAAU,CAAC,SAAS,GAAG,KAAK,CAAC;SAC7B;QAED,4BAA4B;QAC5B,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS,KAAK,QAAQ,IAAI,OAAO,CAAC,SAAS,KAAK,UAAU,CAAC,SAAS,EAAE;YACtG,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,eAAe,GAAG,OAAO,CAAC,SAAS,GAAG,aAAa,CAAC;SAC3F;QAED,qBAAqB;QACrB,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAEzF,mCAAmC;QACnC,IAAI,CAAC,OAAO,CAAC,cAAc,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,EAAE;YACjF,oCAAoC;YACpC,IAAI,UAAU,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE;gBAC3F,kCAAkC;gBAClC,IAAI;oBACH,UAAU,CAAC,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;iBAC7G;gBAAC,OAAO,CAAC,EAAE;oBACX,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,iEAAiE,GAAG,CAAC,CAAC;iBAC7G;aACD;YACD,oBAAoB;YACpB,2BAA2B,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;SACtD;aAAM;YACN,qBAAqB;YACrB,2BAA2B,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;SAClD;QAED,iCAAiC;QACjC,IAAI,aAAa,IAAI,aAAa,CAAC,KAAK,EAAE;YACzC,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;SACzC;KACD;SAAM;QACN,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,wBAAwB,CAAC;KAChE;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAAA,CAAC;AAEF,6BAA6B,UAAwB,EAAE,OAAkB;IACxE,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IACvE,MAAM,SAAS,GAAiB,EAAE,CAAC;IAEnC,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,EAAE;QACtC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACpC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KACpB;IAED,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE;QAClC,qEAAqE;QACrE,SAAS,CAAC,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;KAClL;IAED,IAAI,OAAO,UAAU,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE;QAC/E,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;KACxC;IAED,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC1D,CAAC;AAAA,CAAC;AAEF,MAAM,IAAI,GAAG,UAAU,CAAC;AACxB,MAAM,IAAI,GAAG,aAAa,CAAC;AAC3B,MAAM,IAAI,GAAG,eAAe,CAAC;AAC7B,MAAM,IAAI,GAAG,SAAS,CAAC;AACvB,MAAM,IAAI,GAAG,wBAAwB,CAAC;AAEtC,MAAM,4BAA4B,KAAY;IAC7C,MAAM,MAAM,GAAiB,EAAE,CAAC;IAEhC,OAAO,KAAK,CAAC,MAAM,EAAE;QACpB,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;YACtB,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;SAChC;aAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;YAC7B,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;SACjC;aAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;YAC7B,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,EAAE,CAAC;SACb;aAAM,IAAI,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,IAAI,EAAE;YAC3C,KAAK,GAAG,EAAE,CAAC;SACX;aAAM;YACN,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,EAAE,EAAE;gBACP,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBAChB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACf;iBAAM;gBACN,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;aACpD;SACD;KACD;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACxB,CAAC;AAAA,CAAC;AAEF,MAAM,oBAAoB,UAAwB,EAAE,UAAqB,EAAE;IAC1E,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAC7D,MAAM,SAAS,GAAiB,EAAE,CAAC;IAEnC,qBAAqB;IACrB,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAEzF,uCAAuC;IACvC,IAAI,aAAa,IAAI,aAAa,CAAC,SAAS;QAAE,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAE3F,IAAI,UAAU,CAAC,IAAI,EAAE;QACpB,sCAAsC;QACtC,IAAI,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;YAC/C,8CAA8C;SAC9C;QAED,oCAAoC;aAC/B,IAAI,OAAO,CAAC,UAAU,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC,UAAU,CAAC,EAAE;YAC3E,0BAA0B;YAC1B,IAAI;gBACH,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;aACpK;YAAC,OAAO,CAAC,EAAE;gBACX,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,6CAA6C,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,iBAAiB,GAAG,CAAC,CAAC;aACpJ;SACD;KACD;IAED,oBAAoB;IACpB,2BAA2B,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAElD,IAAI,OAAO,CAAC,SAAS,KAAK,QAAQ,IAAI,UAAU,CAAC,MAAM,EAAE;QACxD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KACpB;IAED,MAAM,SAAS,GAAG,mBAAmB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC3D,IAAI,SAAS,KAAK,SAAS,EAAE;QAC5B,IAAI,OAAO,CAAC,SAAS,KAAK,QAAQ,EAAE;YACnC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrB;QAED,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAE1B,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;YACzD,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACpB;KACD;IAED,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE;QAClC,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC;QAExB,IAAI,CAAC,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,EAAE;YAC7E,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;SACzB;QAED,IAAI,SAAS,KAAK,SAAS,EAAE;YAC5B,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAE,yCAAyC;SAC1E;QAED,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KAClB;IAED,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,EAAE;QACnC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;KACjC;IAED,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,EAAE;QACtC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;KACpC;IAED,OAAO,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAE,4BAA4B;AACzD,CAAC;AAAA,CAAC;AAEF,MAAM,4BAA4B,IAAkB,EAAE,QAAsB,EAAE,UAAqB,EAAE,EAAE,iBAA0B;IAChI,MAAM,MAAM,GAAiB,EAAE,CAAC;IAEhC,IAAI,CAAC,iBAAiB,EAAE;QACvB,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAE,2BAA2B;QAC7E,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAE,+BAA+B;KACzF;IACD,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;IAExB,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE;QACzC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAChC,wCAAwC;QACxC,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;QACpC,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC5B,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC5B,MAAM,CAAC,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;KAC9B;SAAM;QACN,IAAI,QAAQ,CAAC,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,EAAE;YAClG,wCAAwC;YACxC,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;YACpC,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,CAAC,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;YACrD,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;SAC9B;aAAM;YACN,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;gBACnB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACxB,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,EAAE;oBACjC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;iBAC9B;qBAAM;oBACN,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;iBAC1B;aACD;iBAAM;gBACN,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;oBACpC,MAAM,CAAC,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;iBAC/C;qBAAM;oBACN,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;wBACtG,MAAM,CAAC,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC;qBAClC;yBAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;wBACtB,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;qBAC5B;yBAAM;wBACN,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC;qBACjF;oBACD,MAAM,CAAC,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;iBAC7C;gBACD,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;aAC9B;YACD,oCAAoC;YACpC,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAChC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;SACxB;QACD,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;KAC5B;IAED,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;IAEpC,OAAO,MAAM,CAAC;AACf,CAAC;AAAA,CAAC;AAEF,MAAM,kBAAkB,OAAc,EAAE,WAAkB,EAAE,OAAmB;IAC9E,MAAM,iBAAiB,GAAG,MAAM,CAAC,EAAE,MAAM,EAAG,MAAM,EAAE,EAAE,OAAO,CAAC,CAAC;IAC/D,OAAO,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,OAAO,EAAE,iBAAiB,CAAC,EAAE,KAAK,CAAC,WAAW,EAAE,iBAAiB,CAAC,EAAE,iBAAiB,EAAE,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;AAC3J,CAAC;AAAA,CAAC;AAIF,MAAM,oBAAoB,GAAO,EAAE,OAAmB;IACrD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;QAC5B,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;KAC9C;SAAM,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,QAAQ,EAAE;QACpC,GAAG,GAAG,KAAK,CAAC,SAAS,CAAgB,GAAG,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;KAC7D;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAAA,CAAC;AAIF,MAAM,gBAAgB,IAAQ,EAAE,IAAQ,EAAE,OAAmB;IAC5D,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC7B,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;KAChD;SAAM,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;QACrC,IAAI,GAAG,SAAS,CAAgB,IAAI,EAAE,OAAO,CAAC,CAAC;KAC/C;IAED,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC7B,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;KAChD;SAAM,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;QACrC,IAAI,GAAG,SAAS,CAAgB,IAAI,EAAE,OAAO,CAAC,CAAC;KAC/C;IAED,OAAO,IAAI,KAAK,IAAI,CAAC;AACtB,CAAC;AAAA,CAAC;AAEF,MAAM,0BAA0B,GAAU,EAAE,OAAmB;IAC9D,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;AAC1H,CAAC;AAAA,CAAC;AAEF,MAAM,4BAA4B,GAAU,EAAE,OAAmB;IAChE,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC,CAAC;AACrI,CAAC;AAAA,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.d.ts b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.d.ts
new file mode 100644
index 0000000..7c12857
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.d.ts
@@ -0,0 +1,6 @@
+export declare function merge(...sets: Array<string>): string;
+export declare function subexp(str: string): string;
+export declare function typeOf(o: any): string;
+export declare function toUpperCase(str: string): string;
+export declare function toArray(obj: any): Array<any>;
+export declare function assign(target: object, source: any): any;
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.js b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.js
new file mode 100644
index 0000000..072711e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.js
@@ -0,0 +1,36 @@
+export function merge(...sets) {
+    if (sets.length > 1) {
+        sets[0] = sets[0].slice(0, -1);
+        const xl = sets.length - 1;
+        for (let x = 1; x < xl; ++x) {
+            sets[x] = sets[x].slice(1, -1);
+        }
+        sets[xl] = sets[xl].slice(1);
+        return sets.join('');
+    }
+    else {
+        return sets[0];
+    }
+}
+export function subexp(str) {
+    return "(?:" + str + ")";
+}
+export function typeOf(o) {
+    return o === undefined ? "undefined" : (o === null ? "null" : Object.prototype.toString.call(o).split(" ").pop().split("]").shift().toLowerCase());
+}
+export function toUpperCase(str) {
+    return str.toUpperCase();
+}
+export function toArray(obj) {
+    return obj !== undefined && obj !== null ? (obj instanceof Array ? obj : (typeof obj.length !== "number" || obj.split || obj.setInterval || obj.call ? [obj] : Array.prototype.slice.call(obj))) : [];
+}
+export function assign(target, source) {
+    const obj = target;
+    if (source) {
+        for (const key in source) {
+            obj[key] = source[key];
+        }
+    }
+    return obj;
+}
+//# sourceMappingURL=util.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.js.map b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.js.map
new file mode 100644
index 0000000..05d9df0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/dist/esnext/util.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/util.ts"],"names":[],"mappings":"AAAA,MAAM,gBAAgB,GAAG,IAAkB;IAC1C,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;QACpB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SAC/B;QACD,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACrB;SAAM;QACN,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;KACf;AACF,CAAC;AAED,MAAM,iBAAiB,GAAU;IAChC,OAAO,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC;AAC1B,CAAC;AAED,MAAM,iBAAiB,CAAK;IAC3B,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;AACpJ,CAAC;AAED,MAAM,sBAAsB,GAAU;IACrC,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,kBAAkB,GAAO;IAC9B,OAAO,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,MAAM,KAAK,QAAQ,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,WAAW,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACvM,CAAC;AAGD,MAAM,iBAAiB,MAAc,EAAE,MAAW;IACjD,MAAM,GAAG,GAAG,MAAa,CAAC;IAC1B,IAAI,MAAM,EAAE;QACX,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE;YACzB,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;SACvB;KACD;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/package.json b/node_modules/mathjs/examples/node_modules/uri-js/package.json
new file mode 100644
index 0000000..de95d91
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/package.json
@@ -0,0 +1,77 @@
+{
+  "name": "uri-js",
+  "version": "4.4.1",
+  "description": "An RFC 3986/3987 compliant, scheme extendable URI/IRI parsing/validating/resolving library for JavaScript.",
+  "main": "dist/es5/uri.all.js",
+  "types": "dist/es5/uri.all.d.ts",
+  "directories": {
+    "test": "tests"
+  },
+  "files": [
+    "dist",
+    "package.json",
+    "yarn.lock",
+    "README.md",
+    "CHANGELOG",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build:esnext": "tsc",
+    "build:es5": "rollup -c && cp dist/esnext/uri.d.ts dist/es5/uri.all.d.ts && npm run build:es5:fix-sourcemap",
+    "build:es5:fix-sourcemap": "sorcery -i dist/es5/uri.all.js",
+    "build:es5:min": "uglifyjs dist/es5/uri.all.js --support-ie8 --output dist/es5/uri.all.min.js --in-source-map dist/es5/uri.all.js.map --source-map uri.all.min.js.map --comments --compress --mangle --pure-funcs merge subexp && mv uri.all.min.js.map dist/es5/ && cp dist/es5/uri.all.d.ts dist/es5/uri.all.min.d.ts",
+    "build": "npm run build:esnext && npm run build:es5 && npm run build:es5:min",
+    "clean": "rm -rf dist",
+    "test": "mocha -u mocha-qunit-ui dist/es5/uri.all.js tests/tests.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/garycourt/uri-js"
+  },
+  "keywords": [
+    "URI",
+    "IRI",
+    "IDN",
+    "URN",
+    "UUID",
+    "HTTP",
+    "HTTPS",
+    "WS",
+    "WSS",
+    "MAILTO",
+    "RFC3986",
+    "RFC3987",
+    "RFC5891",
+    "RFC2616",
+    "RFC2818",
+    "RFC2141",
+    "RFC4122",
+    "RFC4291",
+    "RFC5952",
+    "RFC6068",
+    "RFC6455",
+    "RFC6874"
+  ],
+  "author": "Gary Court <gary.court@gmail.com>",
+  "license": "BSD-2-Clause",
+  "bugs": {
+    "url": "https://github.com/garycourt/uri-js/issues"
+  },
+  "homepage": "https://github.com/garycourt/uri-js",
+  "devDependencies": {
+    "babel-cli": "^6.26.0",
+    "babel-plugin-external-helpers": "^6.22.0",
+    "babel-preset-latest": "^6.24.1",
+    "mocha": "^8.2.1",
+    "mocha-qunit-ui": "^0.1.3",
+    "rollup": "^0.41.6",
+    "rollup-plugin-babel": "^2.7.1",
+    "rollup-plugin-node-resolve": "^2.0.0",
+    "sorcery": "^0.10.0",
+    "typescript": "^2.8.1",
+    "uglify-js": "^2.8.14"
+  },
+  "dependencies": {
+    "punycode": "^2.1.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/uri-js/yarn.lock b/node_modules/mathjs/examples/node_modules/uri-js/yarn.lock
new file mode 100644
index 0000000..3c42ded
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/uri-js/yarn.lock
@@ -0,0 +1,2558 @@
+# THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY.
+# yarn lockfile v1
+
+
+"@ungap/promise-all-settled@1.1.2":
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/@ungap/promise-all-settled/-/promise-all-settled-1.1.2.tgz#aa58042711d6e3275dd37dc597e5d31e8c290a44"
+  integrity sha512-sL/cEvJWAnClXw0wHk85/2L0G6Sj8UB0Ctc1TEMbKSsmpRosqhwj9gWgFRZSrBr2f9tiXISwNhCPmlfqUqyb9Q==
+
+align-text@^0.1.1, align-text@^0.1.3:
+  version "0.1.4"
+  resolved "https://registry.yarnpkg.com/align-text/-/align-text-0.1.4.tgz#0cd90a561093f35d0a99256c22b7069433fad117"
+  dependencies:
+    kind-of "^3.0.2"
+    longest "^1.0.1"
+    repeat-string "^1.5.2"
+
+ansi-colors@4.1.1:
+  version "4.1.1"
+  resolved "https://registry.yarnpkg.com/ansi-colors/-/ansi-colors-4.1.1.tgz#cbb9ae256bf750af1eab344f229aa27fe94ba348"
+  integrity sha512-JoX0apGbHaUJBNl6yF+p6JAFYZ666/hhCGKN5t9QFjbJQKUU/g8MNbFDbvfrgKXvI1QpZplPOnwIo99lX/AAmA==
+
+ansi-regex@^2.0.0:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/ansi-regex/-/ansi-regex-2.1.1.tgz#c3b33ab5ee360d86e0e628f0468ae7ef27d654df"
+  integrity sha1-w7M6te42DYbg5ijwRorn7yfWVN8=
+
+ansi-regex@^3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/ansi-regex/-/ansi-regex-3.0.0.tgz#ed0317c322064f79466c02966bddb605ab37d998"
+  integrity sha1-7QMXwyIGT3lGbAKWa922Bas32Zg=
+
+ansi-regex@^4.1.0:
+  version "4.1.0"
+  resolved "https://registry.yarnpkg.com/ansi-regex/-/ansi-regex-4.1.0.tgz#8b9f8f08cf1acb843756a839ca8c7e3168c51997"
+  integrity sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==
+
+ansi-styles@^2.2.1:
+  version "2.2.1"
+  resolved "https://registry.yarnpkg.com/ansi-styles/-/ansi-styles-2.2.1.tgz#b432dd3358b634cf75e1e4664368240533c1ddbe"
+  integrity sha1-tDLdM1i2NM914eRmQ2gkBTPB3b4=
+
+ansi-styles@^3.2.0:
+  version "3.2.1"
+  resolved "https://registry.yarnpkg.com/ansi-styles/-/ansi-styles-3.2.1.tgz#41fbb20243e50b12be0f04b8dedbf07520ce841d"
+  integrity sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==
+  dependencies:
+    color-convert "^1.9.0"
+
+ansi-styles@^4.1.0:
+  version "4.3.0"
+  resolved "https://registry.yarnpkg.com/ansi-styles/-/ansi-styles-4.3.0.tgz#edd803628ae71c04c85ae7a0906edad34b648937"
+  integrity sha512-zbB9rCJAT1rbjiVDb2hqKFHNYLxgtk8NURxZ3IZwD3F6NtxbXZQCnnSi1Lkx+IDohdPlFp222wVALIheZJQSEg==
+  dependencies:
+    color-convert "^2.0.1"
+
+anymatch@^1.3.0:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/anymatch/-/anymatch-1.3.2.tgz#553dcb8f91e3c889845dfdba34c77721b90b9d7a"
+  integrity sha512-0XNayC8lTHQ2OI8aljNCN3sSx6hsr/1+rlcDAotXJR7C1oZZHCNsfpbKwMjRA3Uqb5tF1Rae2oloTr4xpq+WjA==
+  dependencies:
+    micromatch "^2.1.5"
+    normalize-path "^2.0.0"
+
+anymatch@~3.1.1:
+  version "3.1.1"
+  resolved "https://registry.yarnpkg.com/anymatch/-/anymatch-3.1.1.tgz#c55ecf02185e2469259399310c173ce31233b142"
+  integrity sha512-mM8522psRCqzV+6LhomX5wgp25YVibjh8Wj23I5RPkPppSVSjyKD2A2mBJmWGa+KN7f2D6LNh9jkBCeyLktzjg==
+  dependencies:
+    normalize-path "^3.0.0"
+    picomatch "^2.0.4"
+
+argparse@^1.0.7:
+  version "1.0.10"
+  resolved "https://registry.yarnpkg.com/argparse/-/argparse-1.0.10.tgz#bcd6791ea5ae09725e17e5ad988134cd40b3d911"
+  integrity sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==
+  dependencies:
+    sprintf-js "~1.0.2"
+
+arr-diff@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/arr-diff/-/arr-diff-2.0.0.tgz#8f3b827f955a8bd669697e4a4256ac3ceae356cf"
+  integrity sha1-jzuCf5Vai9ZpaX5KQlasPOrjVs8=
+  dependencies:
+    arr-flatten "^1.0.1"
+
+arr-diff@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/arr-diff/-/arr-diff-4.0.0.tgz#d6461074febfec71e7e15235761a329a5dc7c520"
+  integrity sha1-1kYQdP6/7HHn4VI1dhoyml3HxSA=
+
+arr-flatten@^1.0.1, arr-flatten@^1.1.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/arr-flatten/-/arr-flatten-1.1.0.tgz#36048bbff4e7b47e136644316c99669ea5ae91f1"
+  integrity sha512-L3hKV5R/p5o81R7O02IGnwpDmkp6E982XhtbuwSe3O4qOtMMMtodicASA1Cny2U+aCXcNpml+m4dPsvsJ3jatg==
+
+arr-union@^3.1.0:
+  version "3.1.0"
+  resolved "https://registry.yarnpkg.com/arr-union/-/arr-union-3.1.0.tgz#e39b09aea9def866a8f206e288af63919bae39c4"
+  integrity sha1-45sJrqne+Gao8gbiiK9jkZuuOcQ=
+
+array-unique@^0.2.1:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/array-unique/-/array-unique-0.2.1.tgz#a1d97ccafcbc2625cc70fadceb36a50c58b01a53"
+  integrity sha1-odl8yvy8JiXMcPrc6zalDFiwGlM=
+
+array-unique@^0.3.2:
+  version "0.3.2"
+  resolved "https://registry.yarnpkg.com/array-unique/-/array-unique-0.3.2.tgz#a894b75d4bc4f6cd679ef3244a9fd8f46ae2d428"
+  integrity sha1-qJS3XUvE9s1nnvMkSp/Y9Gri1Cg=
+
+assign-symbols@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/assign-symbols/-/assign-symbols-1.0.0.tgz#59667f41fadd4f20ccbc2bb96b8d4f7f78ec0367"
+  integrity sha1-WWZ/QfrdTyDMvCu5a41Pf3jsA2c=
+
+async-each@^1.0.0:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/async-each/-/async-each-1.0.3.tgz#b727dbf87d7651602f06f4d4ac387f47d91b0cbf"
+  integrity sha512-z/WhQ5FPySLdvREByI2vZiTWwCnF0moMJ1hK9YQwDTHKh6I7/uSckMetoRGb5UBZPC1z0jlw+n/XCgjeH7y1AQ==
+
+atob@^2.1.2:
+  version "2.1.2"
+  resolved "https://registry.yarnpkg.com/atob/-/atob-2.1.2.tgz#6d9517eb9e030d2436666651e86bd9f6f13533c9"
+  integrity sha512-Wm6ukoaOGJi/73p/cl2GvLjTI5JM1k/O14isD73YML8StrH/7/lRFgmg8nICZgD3bZZvjwCGxtMOD3wWNAu8cg==
+
+babel-cli@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-cli/-/babel-cli-6.26.0.tgz#502ab54874d7db88ad00b887a06383ce03d002f1"
+  integrity sha1-UCq1SHTX24itALiHoGODzgPQAvE=
+  dependencies:
+    babel-core "^6.26.0"
+    babel-polyfill "^6.26.0"
+    babel-register "^6.26.0"
+    babel-runtime "^6.26.0"
+    commander "^2.11.0"
+    convert-source-map "^1.5.0"
+    fs-readdir-recursive "^1.0.0"
+    glob "^7.1.2"
+    lodash "^4.17.4"
+    output-file-sync "^1.1.2"
+    path-is-absolute "^1.0.1"
+    slash "^1.0.0"
+    source-map "^0.5.6"
+    v8flags "^2.1.1"
+  optionalDependencies:
+    chokidar "^1.6.1"
+
+babel-code-frame@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-code-frame/-/babel-code-frame-6.26.0.tgz#63fd43f7dc1e3bb7ce35947db8fe369a3f58c74b"
+  integrity sha1-Y/1D99weO7fONZR9uP42mj9Yx0s=
+  dependencies:
+    chalk "^1.1.3"
+    esutils "^2.0.2"
+    js-tokens "^3.0.2"
+
+babel-core@6:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-core/-/babel-core-6.26.0.tgz#af32f78b31a6fcef119c87b0fd8d9753f03a0bb8"
+  dependencies:
+    babel-code-frame "^6.26.0"
+    babel-generator "^6.26.0"
+    babel-helpers "^6.24.1"
+    babel-messages "^6.23.0"
+    babel-register "^6.26.0"
+    babel-runtime "^6.26.0"
+    babel-template "^6.26.0"
+    babel-traverse "^6.26.0"
+    babel-types "^6.26.0"
+    babylon "^6.18.0"
+    convert-source-map "^1.5.0"
+    debug "^2.6.8"
+    json5 "^0.5.1"
+    lodash "^4.17.4"
+    minimatch "^3.0.4"
+    path-is-absolute "^1.0.1"
+    private "^0.1.7"
+    slash "^1.0.0"
+    source-map "^0.5.6"
+
+babel-core@^6.26.0:
+  version "6.26.3"
+  resolved "https://registry.yarnpkg.com/babel-core/-/babel-core-6.26.3.tgz#b2e2f09e342d0f0c88e2f02e067794125e75c207"
+  integrity sha512-6jyFLuDmeidKmUEb3NM+/yawG0M2bDZ9Z1qbZP59cyHLz8kYGKYwpJP0UwUKKUiTRNvxfLesJnTedqczP7cTDA==
+  dependencies:
+    babel-code-frame "^6.26.0"
+    babel-generator "^6.26.0"
+    babel-helpers "^6.24.1"
+    babel-messages "^6.23.0"
+    babel-register "^6.26.0"
+    babel-runtime "^6.26.0"
+    babel-template "^6.26.0"
+    babel-traverse "^6.26.0"
+    babel-types "^6.26.0"
+    babylon "^6.18.0"
+    convert-source-map "^1.5.1"
+    debug "^2.6.9"
+    json5 "^0.5.1"
+    lodash "^4.17.4"
+    minimatch "^3.0.4"
+    path-is-absolute "^1.0.1"
+    private "^0.1.8"
+    slash "^1.0.0"
+    source-map "^0.5.7"
+
+babel-generator@^6.26.0:
+  version "6.26.1"
+  resolved "https://registry.yarnpkg.com/babel-generator/-/babel-generator-6.26.1.tgz#1844408d3b8f0d35a404ea7ac180f087a601bd90"
+  integrity sha512-HyfwY6ApZj7BYTcJURpM5tznulaBvyio7/0d4zFOeMPUmfxkCjHocCuoLa2SAGzBI8AREcH3eP3758F672DppA==
+  dependencies:
+    babel-messages "^6.23.0"
+    babel-runtime "^6.26.0"
+    babel-types "^6.26.0"
+    detect-indent "^4.0.0"
+    jsesc "^1.3.0"
+    lodash "^4.17.4"
+    source-map "^0.5.7"
+    trim-right "^1.0.1"
+
+babel-helper-builder-binary-assignment-operator-visitor@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-builder-binary-assignment-operator-visitor/-/babel-helper-builder-binary-assignment-operator-visitor-6.24.1.tgz#cce4517ada356f4220bcae8a02c2b346f9a56664"
+  dependencies:
+    babel-helper-explode-assignable-expression "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-helper-call-delegate@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-call-delegate/-/babel-helper-call-delegate-6.24.1.tgz#ece6aacddc76e41c3461f88bfc575bd0daa2df8d"
+  dependencies:
+    babel-helper-hoist-variables "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-traverse "^6.24.1"
+    babel-types "^6.24.1"
+
+babel-helper-define-map@^6.24.1:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-helper-define-map/-/babel-helper-define-map-6.26.0.tgz#a5f56dab41a25f97ecb498c7ebaca9819f95be5f"
+  dependencies:
+    babel-helper-function-name "^6.24.1"
+    babel-runtime "^6.26.0"
+    babel-types "^6.26.0"
+    lodash "^4.17.4"
+
+babel-helper-explode-assignable-expression@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-explode-assignable-expression/-/babel-helper-explode-assignable-expression-6.24.1.tgz#f25b82cf7dc10433c55f70592d5746400ac22caa"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-traverse "^6.24.1"
+    babel-types "^6.24.1"
+
+babel-helper-function-name@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-function-name/-/babel-helper-function-name-6.24.1.tgz#d3475b8c03ed98242a25b48351ab18399d3580a9"
+  dependencies:
+    babel-helper-get-function-arity "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+    babel-traverse "^6.24.1"
+    babel-types "^6.24.1"
+
+babel-helper-get-function-arity@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-get-function-arity/-/babel-helper-get-function-arity-6.24.1.tgz#8f7782aa93407c41d3aa50908f89b031b1b6853d"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-helper-hoist-variables@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-hoist-variables/-/babel-helper-hoist-variables-6.24.1.tgz#1ecb27689c9d25513eadbc9914a73f5408be7a76"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-helper-optimise-call-expression@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-optimise-call-expression/-/babel-helper-optimise-call-expression-6.24.1.tgz#f7a13427ba9f73f8f4fa993c54a97882d1244257"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-helper-regex@^6.24.1:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-helper-regex/-/babel-helper-regex-6.26.0.tgz#325c59f902f82f24b74faceed0363954f6495e72"
+  dependencies:
+    babel-runtime "^6.26.0"
+    babel-types "^6.26.0"
+    lodash "^4.17.4"
+
+babel-helper-remap-async-to-generator@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-remap-async-to-generator/-/babel-helper-remap-async-to-generator-6.24.1.tgz#5ec581827ad723fecdd381f1c928390676e4551b"
+  dependencies:
+    babel-helper-function-name "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+    babel-traverse "^6.24.1"
+    babel-types "^6.24.1"
+
+babel-helper-replace-supers@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helper-replace-supers/-/babel-helper-replace-supers-6.24.1.tgz#bf6dbfe43938d17369a213ca8a8bf74b6a90ab1a"
+  dependencies:
+    babel-helper-optimise-call-expression "^6.24.1"
+    babel-messages "^6.23.0"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+    babel-traverse "^6.24.1"
+    babel-types "^6.24.1"
+
+babel-helpers@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-helpers/-/babel-helpers-6.24.1.tgz#3471de9caec388e5c850e597e58a26ddf37602b2"
+  integrity sha1-NHHenK7DiOXIUOWX5Yom3fN2ArI=
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+
+babel-messages@^6.23.0:
+  version "6.23.0"
+  resolved "https://registry.yarnpkg.com/babel-messages/-/babel-messages-6.23.0.tgz#f3cdf4703858035b2a2951c6ec5edf6c62f2630e"
+  integrity sha1-8830cDhYA1sqKVHG7F7fbGLyYw4=
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-check-es2015-constants@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-check-es2015-constants/-/babel-plugin-check-es2015-constants-6.22.0.tgz#35157b101426fd2ffd3da3f75c7d1e91835bbf8a"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-external-helpers@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-external-helpers/-/babel-plugin-external-helpers-6.22.0.tgz#2285f48b02bd5dede85175caf8c62e86adccefa1"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-syntax-async-functions@^6.8.0:
+  version "6.13.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-syntax-async-functions/-/babel-plugin-syntax-async-functions-6.13.0.tgz#cad9cad1191b5ad634bf30ae0872391e0647be95"
+
+babel-plugin-syntax-exponentiation-operator@^6.8.0:
+  version "6.13.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-syntax-exponentiation-operator/-/babel-plugin-syntax-exponentiation-operator-6.13.0.tgz#9ee7e8337290da95288201a6a57f4170317830de"
+
+babel-plugin-syntax-trailing-function-commas@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-syntax-trailing-function-commas/-/babel-plugin-syntax-trailing-function-commas-6.22.0.tgz#ba0360937f8d06e40180a43fe0d5616fff532cf3"
+
+babel-plugin-transform-async-to-generator@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-async-to-generator/-/babel-plugin-transform-async-to-generator-6.24.1.tgz#6536e378aff6cb1d5517ac0e40eb3e9fc8d08761"
+  dependencies:
+    babel-helper-remap-async-to-generator "^6.24.1"
+    babel-plugin-syntax-async-functions "^6.8.0"
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-arrow-functions@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-arrow-functions/-/babel-plugin-transform-es2015-arrow-functions-6.22.0.tgz#452692cb711d5f79dc7f85e440ce41b9f244d221"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-block-scoped-functions@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-block-scoped-functions/-/babel-plugin-transform-es2015-block-scoped-functions-6.22.0.tgz#bbc51b49f964d70cb8d8e0b94e820246ce3a6141"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-block-scoping@^6.24.1:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-block-scoping/-/babel-plugin-transform-es2015-block-scoping-6.26.0.tgz#d70f5299c1308d05c12f463813b0a09e73b1895f"
+  dependencies:
+    babel-runtime "^6.26.0"
+    babel-template "^6.26.0"
+    babel-traverse "^6.26.0"
+    babel-types "^6.26.0"
+    lodash "^4.17.4"
+
+babel-plugin-transform-es2015-classes@^6.24.1, babel-plugin-transform-es2015-classes@^6.9.0:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-classes/-/babel-plugin-transform-es2015-classes-6.24.1.tgz#5a4c58a50c9c9461e564b4b2a3bfabc97a2584db"
+  dependencies:
+    babel-helper-define-map "^6.24.1"
+    babel-helper-function-name "^6.24.1"
+    babel-helper-optimise-call-expression "^6.24.1"
+    babel-helper-replace-supers "^6.24.1"
+    babel-messages "^6.23.0"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+    babel-traverse "^6.24.1"
+    babel-types "^6.24.1"
+
+babel-plugin-transform-es2015-computed-properties@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-computed-properties/-/babel-plugin-transform-es2015-computed-properties-6.24.1.tgz#6fe2a8d16895d5634f4cd999b6d3480a308159b3"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+
+babel-plugin-transform-es2015-destructuring@^6.22.0:
+  version "6.23.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-destructuring/-/babel-plugin-transform-es2015-destructuring-6.23.0.tgz#997bb1f1ab967f682d2b0876fe358d60e765c56d"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-duplicate-keys@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-duplicate-keys/-/babel-plugin-transform-es2015-duplicate-keys-6.24.1.tgz#73eb3d310ca969e3ef9ec91c53741a6f1576423e"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-plugin-transform-es2015-for-of@^6.22.0:
+  version "6.23.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-for-of/-/babel-plugin-transform-es2015-for-of-6.23.0.tgz#f47c95b2b613df1d3ecc2fdb7573623c75248691"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-function-name@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-function-name/-/babel-plugin-transform-es2015-function-name-6.24.1.tgz#834c89853bc36b1af0f3a4c5dbaa94fd8eacaa8b"
+  dependencies:
+    babel-helper-function-name "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-plugin-transform-es2015-literals@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-literals/-/babel-plugin-transform-es2015-literals-6.22.0.tgz#4f54a02d6cd66cf915280019a31d31925377ca2e"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-modules-amd@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-modules-amd/-/babel-plugin-transform-es2015-modules-amd-6.24.1.tgz#3b3e54017239842d6d19c3011c4bd2f00a00d154"
+  dependencies:
+    babel-plugin-transform-es2015-modules-commonjs "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+
+babel-plugin-transform-es2015-modules-commonjs@^6.24.1:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-modules-commonjs/-/babel-plugin-transform-es2015-modules-commonjs-6.26.0.tgz#0d8394029b7dc6abe1a97ef181e00758dd2e5d8a"
+  dependencies:
+    babel-plugin-transform-strict-mode "^6.24.1"
+    babel-runtime "^6.26.0"
+    babel-template "^6.26.0"
+    babel-types "^6.26.0"
+
+babel-plugin-transform-es2015-modules-systemjs@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-modules-systemjs/-/babel-plugin-transform-es2015-modules-systemjs-6.24.1.tgz#ff89a142b9119a906195f5f106ecf305d9407d23"
+  dependencies:
+    babel-helper-hoist-variables "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+
+babel-plugin-transform-es2015-modules-umd@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-modules-umd/-/babel-plugin-transform-es2015-modules-umd-6.24.1.tgz#ac997e6285cd18ed6176adb607d602344ad38468"
+  dependencies:
+    babel-plugin-transform-es2015-modules-amd "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+
+babel-plugin-transform-es2015-object-super@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-object-super/-/babel-plugin-transform-es2015-object-super-6.24.1.tgz#24cef69ae21cb83a7f8603dad021f572eb278f8d"
+  dependencies:
+    babel-helper-replace-supers "^6.24.1"
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-parameters@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-parameters/-/babel-plugin-transform-es2015-parameters-6.24.1.tgz#57ac351ab49caf14a97cd13b09f66fdf0a625f2b"
+  dependencies:
+    babel-helper-call-delegate "^6.24.1"
+    babel-helper-get-function-arity "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-template "^6.24.1"
+    babel-traverse "^6.24.1"
+    babel-types "^6.24.1"
+
+babel-plugin-transform-es2015-shorthand-properties@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-shorthand-properties/-/babel-plugin-transform-es2015-shorthand-properties-6.24.1.tgz#24f875d6721c87661bbd99a4622e51f14de38aa0"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-plugin-transform-es2015-spread@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-spread/-/babel-plugin-transform-es2015-spread-6.22.0.tgz#d6d68a99f89aedc4536c81a542e8dd9f1746f8d1"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-sticky-regex@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-sticky-regex/-/babel-plugin-transform-es2015-sticky-regex-6.24.1.tgz#00c1cdb1aca71112cdf0cf6126c2ed6b457ccdbc"
+  dependencies:
+    babel-helper-regex "^6.24.1"
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-plugin-transform-es2015-template-literals@^6.22.0:
+  version "6.22.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-template-literals/-/babel-plugin-transform-es2015-template-literals-6.22.0.tgz#a84b3450f7e9f8f1f6839d6d687da84bb1236d8d"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-typeof-symbol@^6.22.0:
+  version "6.23.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-typeof-symbol/-/babel-plugin-transform-es2015-typeof-symbol-6.23.0.tgz#dec09f1cddff94b52ac73d505c84df59dcceb372"
+  dependencies:
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-es2015-unicode-regex@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-es2015-unicode-regex/-/babel-plugin-transform-es2015-unicode-regex-6.24.1.tgz#d38b12f42ea7323f729387f18a7c5ae1faeb35e9"
+  dependencies:
+    babel-helper-regex "^6.24.1"
+    babel-runtime "^6.22.0"
+    regexpu-core "^2.0.0"
+
+babel-plugin-transform-exponentiation-operator@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-exponentiation-operator/-/babel-plugin-transform-exponentiation-operator-6.24.1.tgz#2ab0c9c7f3098fa48907772bb813fe41e8de3a0e"
+  dependencies:
+    babel-helper-builder-binary-assignment-operator-visitor "^6.24.1"
+    babel-plugin-syntax-exponentiation-operator "^6.8.0"
+    babel-runtime "^6.22.0"
+
+babel-plugin-transform-regenerator@^6.24.1:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-regenerator/-/babel-plugin-transform-regenerator-6.26.0.tgz#e0703696fbde27f0a3efcacf8b4dca2f7b3a8f2f"
+  dependencies:
+    regenerator-transform "^0.10.0"
+
+babel-plugin-transform-strict-mode@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-plugin-transform-strict-mode/-/babel-plugin-transform-strict-mode-6.24.1.tgz#d5faf7aa578a65bbe591cf5edae04a0c67020758"
+  dependencies:
+    babel-runtime "^6.22.0"
+    babel-types "^6.24.1"
+
+babel-polyfill@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-polyfill/-/babel-polyfill-6.26.0.tgz#379937abc67d7895970adc621f284cd966cf2153"
+  integrity sha1-N5k3q8Z9eJWXCtxiHyhM2WbPIVM=
+  dependencies:
+    babel-runtime "^6.26.0"
+    core-js "^2.5.0"
+    regenerator-runtime "^0.10.5"
+
+babel-preset-es2015@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-preset-es2015/-/babel-preset-es2015-6.24.1.tgz#d44050d6bc2c9feea702aaf38d727a0210538939"
+  dependencies:
+    babel-plugin-check-es2015-constants "^6.22.0"
+    babel-plugin-transform-es2015-arrow-functions "^6.22.0"
+    babel-plugin-transform-es2015-block-scoped-functions "^6.22.0"
+    babel-plugin-transform-es2015-block-scoping "^6.24.1"
+    babel-plugin-transform-es2015-classes "^6.24.1"
+    babel-plugin-transform-es2015-computed-properties "^6.24.1"
+    babel-plugin-transform-es2015-destructuring "^6.22.0"
+    babel-plugin-transform-es2015-duplicate-keys "^6.24.1"
+    babel-plugin-transform-es2015-for-of "^6.22.0"
+    babel-plugin-transform-es2015-function-name "^6.24.1"
+    babel-plugin-transform-es2015-literals "^6.22.0"
+    babel-plugin-transform-es2015-modules-amd "^6.24.1"
+    babel-plugin-transform-es2015-modules-commonjs "^6.24.1"
+    babel-plugin-transform-es2015-modules-systemjs "^6.24.1"
+    babel-plugin-transform-es2015-modules-umd "^6.24.1"
+    babel-plugin-transform-es2015-object-super "^6.24.1"
+    babel-plugin-transform-es2015-parameters "^6.24.1"
+    babel-plugin-transform-es2015-shorthand-properties "^6.24.1"
+    babel-plugin-transform-es2015-spread "^6.22.0"
+    babel-plugin-transform-es2015-sticky-regex "^6.24.1"
+    babel-plugin-transform-es2015-template-literals "^6.22.0"
+    babel-plugin-transform-es2015-typeof-symbol "^6.22.0"
+    babel-plugin-transform-es2015-unicode-regex "^6.24.1"
+    babel-plugin-transform-regenerator "^6.24.1"
+
+babel-preset-es2016@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-preset-es2016/-/babel-preset-es2016-6.24.1.tgz#f900bf93e2ebc0d276df9b8ab59724ebfd959f8b"
+  dependencies:
+    babel-plugin-transform-exponentiation-operator "^6.24.1"
+
+babel-preset-es2017@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-preset-es2017/-/babel-preset-es2017-6.24.1.tgz#597beadfb9f7f208bcfd8a12e9b2b29b8b2f14d1"
+  dependencies:
+    babel-plugin-syntax-trailing-function-commas "^6.22.0"
+    babel-plugin-transform-async-to-generator "^6.24.1"
+
+babel-preset-latest@^6.24.1:
+  version "6.24.1"
+  resolved "https://registry.yarnpkg.com/babel-preset-latest/-/babel-preset-latest-6.24.1.tgz#677de069154a7485c2d25c577c02f624b85b85e8"
+  dependencies:
+    babel-preset-es2015 "^6.24.1"
+    babel-preset-es2016 "^6.24.1"
+    babel-preset-es2017 "^6.24.1"
+
+babel-register@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-register/-/babel-register-6.26.0.tgz#6ed021173e2fcb486d7acb45c6009a856f647071"
+  integrity sha1-btAhFz4vy0htestFxgCahW9kcHE=
+  dependencies:
+    babel-core "^6.26.0"
+    babel-runtime "^6.26.0"
+    core-js "^2.5.0"
+    home-or-tmp "^2.0.0"
+    lodash "^4.17.4"
+    mkdirp "^0.5.1"
+    source-map-support "^0.4.15"
+
+babel-runtime@^6.18.0, babel-runtime@^6.22.0, babel-runtime@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-runtime/-/babel-runtime-6.26.0.tgz#965c7058668e82b55d7bfe04ff2337bc8b5647fe"
+  integrity sha1-llxwWGaOgrVde/4E/yM3vItWR/4=
+  dependencies:
+    core-js "^2.4.0"
+    regenerator-runtime "^0.11.0"
+
+babel-template@^6.24.1, babel-template@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-template/-/babel-template-6.26.0.tgz#de03e2d16396b069f46dd9fff8521fb1a0e35e02"
+  integrity sha1-3gPi0WOWsGn0bdn/+FIfsaDjXgI=
+  dependencies:
+    babel-runtime "^6.26.0"
+    babel-traverse "^6.26.0"
+    babel-types "^6.26.0"
+    babylon "^6.18.0"
+    lodash "^4.17.4"
+
+babel-traverse@^6.24.1, babel-traverse@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-traverse/-/babel-traverse-6.26.0.tgz#46a9cbd7edcc62c8e5c064e2d2d8d0f4035766ee"
+  dependencies:
+    babel-code-frame "^6.26.0"
+    babel-messages "^6.23.0"
+    babel-runtime "^6.26.0"
+    babel-types "^6.26.0"
+    babylon "^6.18.0"
+    debug "^2.6.8"
+    globals "^9.18.0"
+    invariant "^2.2.2"
+    lodash "^4.17.4"
+
+babel-types@^6.19.0, babel-types@^6.24.1, babel-types@^6.26.0:
+  version "6.26.0"
+  resolved "https://registry.yarnpkg.com/babel-types/-/babel-types-6.26.0.tgz#a3b073f94ab49eb6fa55cd65227a334380632497"
+  dependencies:
+    babel-runtime "^6.26.0"
+    esutils "^2.0.2"
+    lodash "^4.17.4"
+    to-fast-properties "^1.0.3"
+
+babylon@^6.18.0:
+  version "6.18.0"
+  resolved "https://registry.yarnpkg.com/babylon/-/babylon-6.18.0.tgz#af2f3b88fa6f5c1e4c634d1a0f8eac4f55b395e3"
+  integrity sha512-q/UEjfGJ2Cm3oKV71DJz9d25TPnq5rhBVL2Q4fA5wcC3jcrdn7+SssEybFIxwAvvP+YCsCYNKughoF33GxgycQ==
+
+balanced-match@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/balanced-match/-/balanced-match-1.0.0.tgz#89b4d199ab2bee49de164ea02b89ce462d71b767"
+  integrity sha1-ibTRmasr7kneFk6gK4nORi1xt2c=
+
+base@^0.11.1:
+  version "0.11.2"
+  resolved "https://registry.yarnpkg.com/base/-/base-0.11.2.tgz#7bde5ced145b6d551a90db87f83c558b4eb48a8f"
+  integrity sha512-5T6P4xPgpp0YDFvSWwEZ4NoE3aM4QBQXDzmVbraCkFj8zHM+mba8SyqB5DbZWyR7mYHo6Y7BdQo3MoA4m0TeQg==
+  dependencies:
+    cache-base "^1.0.1"
+    class-utils "^0.3.5"
+    component-emitter "^1.2.1"
+    define-property "^1.0.0"
+    isobject "^3.0.1"
+    mixin-deep "^1.2.0"
+    pascalcase "^0.1.1"
+
+binary-extensions@^1.0.0:
+  version "1.13.1"
+  resolved "https://registry.yarnpkg.com/binary-extensions/-/binary-extensions-1.13.1.tgz#598afe54755b2868a5330d2aff9d4ebb53209b65"
+  integrity sha512-Un7MIEDdUC5gNpcGDV97op1Ywk748MpHcFTHoYs6qnj1Z3j7I53VG3nwZhKzoBZmbdRNnb6WRdFlwl7tSDuZGw==
+
+binary-extensions@^2.0.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/binary-extensions/-/binary-extensions-2.1.0.tgz#30fa40c9e7fe07dbc895678cd287024dea241dd9"
+  integrity sha512-1Yj8h9Q+QDF5FzhMs/c9+6UntbD5MkRfRwac8DoEm9ZfUBZ7tZ55YcGVAzEe4bXsdQHEk+s9S5wsOKVdZrw0tQ==
+
+bindings@^1.5.0:
+  version "1.5.0"
+  resolved "https://registry.yarnpkg.com/bindings/-/bindings-1.5.0.tgz#10353c9e945334bc0511a6d90b38fbc7c9c504df"
+  integrity sha512-p2q/t/mhvuOj/UeLlV6566GD/guowlr0hHxClI0W9m7MWYkL1F0hLo+0Aexs9HSPCtR1SXQ0TD3MMKrXZajbiQ==
+  dependencies:
+    file-uri-to-path "1.0.0"
+
+brace-expansion@^1.1.7:
+  version "1.1.11"
+  resolved "https://registry.yarnpkg.com/brace-expansion/-/brace-expansion-1.1.11.tgz#3c7fcbf529d87226f3d2f52b966ff5271eb441dd"
+  integrity sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==
+  dependencies:
+    balanced-match "^1.0.0"
+    concat-map "0.0.1"
+
+braces@^1.8.2:
+  version "1.8.5"
+  resolved "https://registry.yarnpkg.com/braces/-/braces-1.8.5.tgz#ba77962e12dff969d6b76711e914b737857bf6a7"
+  integrity sha1-uneWLhLf+WnWt2cR6RS3N4V79qc=
+  dependencies:
+    expand-range "^1.8.1"
+    preserve "^0.2.0"
+    repeat-element "^1.1.2"
+
+braces@^2.3.1:
+  version "2.3.2"
+  resolved "https://registry.yarnpkg.com/braces/-/braces-2.3.2.tgz#5979fd3f14cd531565e5fa2df1abfff1dfaee729"
+  integrity sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==
+  dependencies:
+    arr-flatten "^1.1.0"
+    array-unique "^0.3.2"
+    extend-shallow "^2.0.1"
+    fill-range "^4.0.0"
+    isobject "^3.0.1"
+    repeat-element "^1.1.2"
+    snapdragon "^0.8.1"
+    snapdragon-node "^2.0.1"
+    split-string "^3.0.2"
+    to-regex "^3.0.1"
+
+braces@~3.0.2:
+  version "3.0.2"
+  resolved "https://registry.yarnpkg.com/braces/-/braces-3.0.2.tgz#3454e1a462ee8d599e236df336cd9ea4f8afe107"
+  integrity sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==
+  dependencies:
+    fill-range "^7.0.1"
+
+browser-resolve@^1.11.0:
+  version "1.11.2"
+  resolved "https://registry.yarnpkg.com/browser-resolve/-/browser-resolve-1.11.2.tgz#8ff09b0a2c421718a1051c260b32e48f442938ce"
+  dependencies:
+    resolve "1.1.7"
+
+browser-stdout@1.3.1:
+  version "1.3.1"
+  resolved "https://registry.yarnpkg.com/browser-stdout/-/browser-stdout-1.3.1.tgz#baa559ee14ced73452229bad7326467c61fabd60"
+  integrity sha512-qhAVI1+Av2X7qelOfAIYwXONood6XlZE/fXaBSmW/T5SzLAmCgzi+eiWE7fUvbHaeNBQH13UftjpXxsfLkMpgw==
+
+buffer-crc32@^0.2.5:
+  version "0.2.13"
+  resolved "https://registry.yarnpkg.com/buffer-crc32/-/buffer-crc32-0.2.13.tgz#0d333e3f00eac50aa1454abd30ef8c2a5d9a7242"
+
+builtin-modules@^1.1.0:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/builtin-modules/-/builtin-modules-1.1.1.tgz#270f076c5a72c02f5b65a47df94c5fe3a278892f"
+
+cache-base@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/cache-base/-/cache-base-1.0.1.tgz#0a7f46416831c8b662ee36fe4e7c59d76f666ab2"
+  integrity sha512-AKcdTnFSWATd5/GCPRxr2ChwIJ85CeyrEyjRHlKxQ56d4XJMGym0uAiKn0xbLOGOl3+yRpOTi484dVCEc5AUzQ==
+  dependencies:
+    collection-visit "^1.0.0"
+    component-emitter "^1.2.1"
+    get-value "^2.0.6"
+    has-value "^1.0.0"
+    isobject "^3.0.1"
+    set-value "^2.0.0"
+    to-object-path "^0.3.0"
+    union-value "^1.0.0"
+    unset-value "^1.0.0"
+
+camelcase@^1.0.2:
+  version "1.2.1"
+  resolved "https://registry.yarnpkg.com/camelcase/-/camelcase-1.2.1.tgz#9bb5304d2e0b56698b2c758b08a3eaa9daa58a39"
+
+camelcase@^5.0.0:
+  version "5.3.1"
+  resolved "https://registry.yarnpkg.com/camelcase/-/camelcase-5.3.1.tgz#e3c9b31569e106811df242f715725a1f4c494320"
+  integrity sha512-L28STB170nwWS63UjtlEOE3dldQApaJXZkOI1uMFfzf3rRuPegHaHesyee+YxQ+W6SvRDQV6UrdOdRiR153wJg==
+
+camelcase@^6.0.0:
+  version "6.2.0"
+  resolved "https://registry.yarnpkg.com/camelcase/-/camelcase-6.2.0.tgz#924af881c9d525ac9d87f40d964e5cea982a1809"
+  integrity sha512-c7wVvbw3f37nuobQNtgsgG9POC9qMbNuMQmTCqZv23b6MIz0fcYpBiOlv9gEN/hdLdnZTDQhg6e9Dq5M1vKvfg==
+
+center-align@^0.1.1:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/center-align/-/center-align-0.1.3.tgz#aa0d32629b6ee972200411cbd4461c907bc2b7ad"
+  dependencies:
+    align-text "^0.1.3"
+    lazy-cache "^1.0.3"
+
+chalk@^1.1.3:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/chalk/-/chalk-1.1.3.tgz#a8115c55e4a702fe4d150abd3872822a7e09fc98"
+  integrity sha1-qBFcVeSnAv5NFQq9OHKCKn4J/Jg=
+  dependencies:
+    ansi-styles "^2.2.1"
+    escape-string-regexp "^1.0.2"
+    has-ansi "^2.0.0"
+    strip-ansi "^3.0.0"
+    supports-color "^2.0.0"
+
+chalk@^4.0.0:
+  version "4.1.0"
+  resolved "https://registry.yarnpkg.com/chalk/-/chalk-4.1.0.tgz#4e14870a618d9e2edd97dd8345fd9d9dc315646a"
+  integrity sha512-qwx12AxXe2Q5xQ43Ac//I6v5aXTipYrSESdOgzrN+9XjgEpyjpKuvSGaN4qE93f7TQTlerQQ8S+EQ0EyDoVL1A==
+  dependencies:
+    ansi-styles "^4.1.0"
+    supports-color "^7.1.0"
+
+chokidar@3.4.3:
+  version "3.4.3"
+  resolved "https://registry.yarnpkg.com/chokidar/-/chokidar-3.4.3.tgz#c1df38231448e45ca4ac588e6c79573ba6a57d5b"
+  integrity sha512-DtM3g7juCXQxFVSNPNByEC2+NImtBuxQQvWlHunpJIS5Ocr0lG306cC7FCi7cEA0fzmybPUIl4txBIobk1gGOQ==
+  dependencies:
+    anymatch "~3.1.1"
+    braces "~3.0.2"
+    glob-parent "~5.1.0"
+    is-binary-path "~2.1.0"
+    is-glob "~4.0.1"
+    normalize-path "~3.0.0"
+    readdirp "~3.5.0"
+  optionalDependencies:
+    fsevents "~2.1.2"
+
+chokidar@^1.6.1:
+  version "1.7.0"
+  resolved "https://registry.yarnpkg.com/chokidar/-/chokidar-1.7.0.tgz#798e689778151c8076b4b360e5edd28cda2bb468"
+  integrity sha1-eY5ol3gVHIB2tLNg5e3SjNortGg=
+  dependencies:
+    anymatch "^1.3.0"
+    async-each "^1.0.0"
+    glob-parent "^2.0.0"
+    inherits "^2.0.1"
+    is-binary-path "^1.0.0"
+    is-glob "^2.0.0"
+    path-is-absolute "^1.0.0"
+    readdirp "^2.0.0"
+  optionalDependencies:
+    fsevents "^1.0.0"
+
+class-utils@^0.3.5:
+  version "0.3.6"
+  resolved "https://registry.yarnpkg.com/class-utils/-/class-utils-0.3.6.tgz#f93369ae8b9a7ce02fd41faad0ca83033190c463"
+  integrity sha512-qOhPa/Fj7s6TY8H8esGu5QNpMMQxz79h+urzrNYN6mn+9BnxlDGf5QZ+XeCDsxSjPqsSR56XOZOJmpeurnLMeg==
+  dependencies:
+    arr-union "^3.1.0"
+    define-property "^0.2.5"
+    isobject "^3.0.0"
+    static-extend "^0.1.1"
+
+cliui@^2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/cliui/-/cliui-2.1.0.tgz#4b475760ff80264c762c3a1719032e91c7fea0d1"
+  dependencies:
+    center-align "^0.1.1"
+    right-align "^0.1.1"
+    wordwrap "0.0.2"
+
+cliui@^5.0.0:
+  version "5.0.0"
+  resolved "https://registry.yarnpkg.com/cliui/-/cliui-5.0.0.tgz#deefcfdb2e800784aa34f46fa08e06851c7bbbc5"
+  integrity sha512-PYeGSEmmHM6zvoef2w8TPzlrnNpXIjTipYK780YswmIP9vjxmd6Y2a3CB2Ks6/AU8NHjZugXvo8w3oWM2qnwXA==
+  dependencies:
+    string-width "^3.1.0"
+    strip-ansi "^5.2.0"
+    wrap-ansi "^5.1.0"
+
+collection-visit@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/collection-visit/-/collection-visit-1.0.0.tgz#4bc0373c164bc3291b4d368c829cf1a80a59dca0"
+  integrity sha1-S8A3PBZLwykbTTaMgpzxqApZ3KA=
+  dependencies:
+    map-visit "^1.0.0"
+    object-visit "^1.0.0"
+
+color-convert@^1.9.0:
+  version "1.9.3"
+  resolved "https://registry.yarnpkg.com/color-convert/-/color-convert-1.9.3.tgz#bb71850690e1f136567de629d2d5471deda4c1e8"
+  integrity sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==
+  dependencies:
+    color-name "1.1.3"
+
+color-convert@^2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/color-convert/-/color-convert-2.0.1.tgz#72d3a68d598c9bdb3af2ad1e84f21d896abd4de3"
+  integrity sha512-RRECPsj7iu/xb5oKYcsFHSppFNnsj/52OVTRKb4zP5onXwVF3zVmmToNcOfGC+CRDpfK/U584fMg38ZHCaElKQ==
+  dependencies:
+    color-name "~1.1.4"
+
+color-name@1.1.3:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/color-name/-/color-name-1.1.3.tgz#a7d0558bd89c42f795dd42328f740831ca53bc25"
+  integrity sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=
+
+color-name@~1.1.4:
+  version "1.1.4"
+  resolved "https://registry.yarnpkg.com/color-name/-/color-name-1.1.4.tgz#c2a09a87acbde69543de6f63fa3995c826c536a2"
+  integrity sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA==
+
+commander@^2.11.0:
+  version "2.20.3"
+  resolved "https://registry.yarnpkg.com/commander/-/commander-2.20.3.tgz#fd485e84c03eb4881c20722ba48035e8531aeb33"
+  integrity sha512-GpVkmM8vF2vQUkj2LvZmD35JxeJOLCwJ9cUkugyk2nuhbv3+mJvpLYYt+0+USMxE+oj+ey/lJEnhZw75x/OMcQ==
+
+component-emitter@^1.2.1:
+  version "1.3.0"
+  resolved "https://registry.yarnpkg.com/component-emitter/-/component-emitter-1.3.0.tgz#16e4070fba8ae29b679f2215853ee181ab2eabc0"
+  integrity sha512-Rd3se6QB+sO1TwqZjscQrurpEPIfO0/yYnSin6Q/rD3mOutHvUrCAhJub3r90uNb+SESBuE0QYoB90YdfatsRg==
+
+concat-map@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/concat-map/-/concat-map-0.0.1.tgz#d8a96bd77fd68df7793a73036a3ba0d5405d477b"
+  integrity sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=
+
+convert-source-map@^1.5.0, convert-source-map@^1.5.1:
+  version "1.7.0"
+  resolved "https://registry.yarnpkg.com/convert-source-map/-/convert-source-map-1.7.0.tgz#17a2cb882d7f77d3490585e2ce6c524424a3a442"
+  integrity sha512-4FJkXzKXEDB1snCFZlLP4gpC3JILicCpGbzG9f9G7tGqGCzETQ2hWPrcinA9oU4wtf2biUaEH5065UnMeR33oA==
+  dependencies:
+    safe-buffer "~5.1.1"
+
+copy-descriptor@^0.1.0:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/copy-descriptor/-/copy-descriptor-0.1.1.tgz#676f6eb3c39997c2ee1ac3a924fd6124748f578d"
+  integrity sha1-Z29us8OZl8LuGsOpJP1hJHSPV40=
+
+core-js@^2.4.0, core-js@^2.5.0:
+  version "2.6.12"
+  resolved "https://registry.yarnpkg.com/core-js/-/core-js-2.6.12.tgz#d9333dfa7b065e347cc5682219d6f690859cc2ec"
+  integrity sha512-Kb2wC0fvsWfQrgk8HU5lW6U/Lcs8+9aaYcy4ZFc6DDlo4nZ7n70dEgE5rtR0oG6ufKDUnrwfWL1mXR5ljDatrQ==
+
+core-util-is@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/core-util-is/-/core-util-is-1.0.2.tgz#b5fd54220aa2bc5ab57aab7140c940754503c1a7"
+  integrity sha1-tf1UIgqivFq1eqtxQMlAdUUDwac=
+
+debug@4.2.0:
+  version "4.2.0"
+  resolved "https://registry.yarnpkg.com/debug/-/debug-4.2.0.tgz#7f150f93920e94c58f5574c2fd01a3110effe7f1"
+  integrity sha512-IX2ncY78vDTjZMFUdmsvIRFY2Cf4FnD0wRs+nQwJU8Lu99/tPFdb0VybiiMTPe3I6rQmwsqQqRBvxU+bZ/I8sg==
+  dependencies:
+    ms "2.1.2"
+
+debug@^2.2.0, debug@^2.3.3, debug@^2.6.8, debug@^2.6.9:
+  version "2.6.9"
+  resolved "https://registry.yarnpkg.com/debug/-/debug-2.6.9.tgz#5d128515df134ff327e90a4c93f4e077a536341f"
+  integrity sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==
+  dependencies:
+    ms "2.0.0"
+
+decamelize@^1.0.0, decamelize@^1.2.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/decamelize/-/decamelize-1.2.0.tgz#f6534d15148269b20352e7bee26f501f9a191290"
+
+decamelize@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/decamelize/-/decamelize-4.0.0.tgz#aa472d7bf660eb15f3494efd531cab7f2a709837"
+  integrity sha512-9iE1PgSik9HeIIw2JO94IidnE3eBoQrFJ3w7sFuzSX4DpmZ3v5sZpUiV5Swcf6mQEF+Y0ru8Neo+p+nyh2J+hQ==
+
+decode-uri-component@^0.2.0:
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/decode-uri-component/-/decode-uri-component-0.2.0.tgz#eb3913333458775cb84cd1a1fae062106bb87545"
+  integrity sha1-6zkTMzRYd1y4TNGh+uBiEGu4dUU=
+
+define-property@^0.2.5:
+  version "0.2.5"
+  resolved "https://registry.yarnpkg.com/define-property/-/define-property-0.2.5.tgz#c35b1ef918ec3c990f9a5bc57be04aacec5c8116"
+  integrity sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=
+  dependencies:
+    is-descriptor "^0.1.0"
+
+define-property@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/define-property/-/define-property-1.0.0.tgz#769ebaaf3f4a63aad3af9e8d304c9bbe79bfb0e6"
+  integrity sha1-dp66rz9KY6rTr56NMEybvnm/sOY=
+  dependencies:
+    is-descriptor "^1.0.0"
+
+define-property@^2.0.2:
+  version "2.0.2"
+  resolved "https://registry.yarnpkg.com/define-property/-/define-property-2.0.2.tgz#d459689e8d654ba77e02a817f8710d702cb16e9d"
+  integrity sha512-jwK2UV4cnPpbcG7+VRARKTZPUWowwXA8bzH5NP6ud0oeAxyYPuGZUAC7hMugpCdz4BeSZl2Dl9k66CHJ/46ZYQ==
+  dependencies:
+    is-descriptor "^1.0.2"
+    isobject "^3.0.1"
+
+detect-indent@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/detect-indent/-/detect-indent-4.0.0.tgz#f76d064352cdf43a1cb6ce619c4ee3a9475de208"
+  integrity sha1-920GQ1LN9Docts5hnE7jqUdd4gg=
+  dependencies:
+    repeating "^2.0.0"
+
+diff@4.0.2:
+  version "4.0.2"
+  resolved "https://registry.yarnpkg.com/diff/-/diff-4.0.2.tgz#60f3aecb89d5fae520c11aa19efc2bb982aade7d"
+  integrity sha512-58lmxKSA4BNyLz+HHMUzlOEpg09FV+ev6ZMe3vJihgdxzgcwZ8VoEEPmALCZG9LmqfVoNMMKpttIYTVG6uDY7A==
+
+emoji-regex@^7.0.1:
+  version "7.0.3"
+  resolved "https://registry.yarnpkg.com/emoji-regex/-/emoji-regex-7.0.3.tgz#933a04052860c85e83c122479c4748a8e4c72156"
+  integrity sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==
+
+es6-promise@^3.1.2:
+  version "3.3.1"
+  resolved "https://registry.yarnpkg.com/es6-promise/-/es6-promise-3.3.1.tgz#a08cdde84ccdbf34d027a1451bc91d4bcd28a613"
+
+escape-string-regexp@4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/escape-string-regexp/-/escape-string-regexp-4.0.0.tgz#14ba83a5d373e3d311e5afca29cf5bfad965bf34"
+  integrity sha512-TtpcNJ3XAzx3Gq8sWRzJaVajRs0uVxA2YAkdb1jm2YkPz4G6egUFAyA3n5vtEIZefPk5Wa4UXbKuS5fKkJWdgA==
+
+escape-string-regexp@^1.0.2:
+  version "1.0.5"
+  resolved "https://registry.yarnpkg.com/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz#1b61c0562190a8dff6ae3bb2cf0200ca130b86d4"
+  integrity sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=
+
+esprima@^4.0.0:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/esprima/-/esprima-4.0.1.tgz#13b04cdb3e6c5d19df91ab6987a8695619b0aa71"
+  integrity sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A==
+
+estree-walker@^0.2.1:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/estree-walker/-/estree-walker-0.2.1.tgz#bdafe8095383d8414d5dc2ecf4c9173b6db9412e"
+
+esutils@^2.0.2:
+  version "2.0.3"
+  resolved "https://registry.yarnpkg.com/esutils/-/esutils-2.0.3.tgz#74d2eb4de0b8da1293711910d50775b9b710ef64"
+  integrity sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==
+
+expand-brackets@^0.1.4:
+  version "0.1.5"
+  resolved "https://registry.yarnpkg.com/expand-brackets/-/expand-brackets-0.1.5.tgz#df07284e342a807cd733ac5af72411e581d1177b"
+  integrity sha1-3wcoTjQqgHzXM6xa9yQR5YHRF3s=
+  dependencies:
+    is-posix-bracket "^0.1.0"
+
+expand-brackets@^2.1.4:
+  version "2.1.4"
+  resolved "https://registry.yarnpkg.com/expand-brackets/-/expand-brackets-2.1.4.tgz#b77735e315ce30f6b6eff0f83b04151a22449622"
+  integrity sha1-t3c14xXOMPa27/D4OwQVGiJEliI=
+  dependencies:
+    debug "^2.3.3"
+    define-property "^0.2.5"
+    extend-shallow "^2.0.1"
+    posix-character-classes "^0.1.0"
+    regex-not "^1.0.0"
+    snapdragon "^0.8.1"
+    to-regex "^3.0.1"
+
+expand-range@^1.8.1:
+  version "1.8.2"
+  resolved "https://registry.yarnpkg.com/expand-range/-/expand-range-1.8.2.tgz#a299effd335fe2721ebae8e257ec79644fc85337"
+  integrity sha1-opnv/TNf4nIeuujiV+x5ZE/IUzc=
+  dependencies:
+    fill-range "^2.1.0"
+
+extend-shallow@^2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/extend-shallow/-/extend-shallow-2.0.1.tgz#51af7d614ad9a9f610ea1bafbb989d6b1c56890f"
+  integrity sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=
+  dependencies:
+    is-extendable "^0.1.0"
+
+extend-shallow@^3.0.0, extend-shallow@^3.0.2:
+  version "3.0.2"
+  resolved "https://registry.yarnpkg.com/extend-shallow/-/extend-shallow-3.0.2.tgz#26a71aaf073b39fb2127172746131c2704028db8"
+  integrity sha1-Jqcarwc7OfshJxcnRhMcJwQCjbg=
+  dependencies:
+    assign-symbols "^1.0.0"
+    is-extendable "^1.0.1"
+
+extglob@^0.3.1:
+  version "0.3.2"
+  resolved "https://registry.yarnpkg.com/extglob/-/extglob-0.3.2.tgz#2e18ff3d2f49ab2765cec9023f011daa8d8349a1"
+  integrity sha1-Lhj/PS9JqydlzskCPwEdqo2DSaE=
+  dependencies:
+    is-extglob "^1.0.0"
+
+extglob@^2.0.4:
+  version "2.0.4"
+  resolved "https://registry.yarnpkg.com/extglob/-/extglob-2.0.4.tgz#ad00fe4dc612a9232e8718711dc5cb5ab0285543"
+  integrity sha512-Nmb6QXkELsuBr24CJSkilo6UHHgbekK5UiZgfE6UHD3Eb27YC6oD+bhcT+tJ6cl8dmsgdQxnWlcry8ksBIBLpw==
+  dependencies:
+    array-unique "^0.3.2"
+    define-property "^1.0.0"
+    expand-brackets "^2.1.4"
+    extend-shallow "^2.0.1"
+    fragment-cache "^0.2.1"
+    regex-not "^1.0.0"
+    snapdragon "^0.8.1"
+    to-regex "^3.0.1"
+
+file-uri-to-path@1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/file-uri-to-path/-/file-uri-to-path-1.0.0.tgz#553a7b8446ff6f684359c445f1e37a05dacc33dd"
+  integrity sha512-0Zt+s3L7Vf1biwWZ29aARiVYLx7iMGnEUl9x33fbB/j3jR81u/O2LbqK+Bm1CDSNDKVtJ/YjwY7TUd5SkeLQLw==
+
+filename-regex@^2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/filename-regex/-/filename-regex-2.0.1.tgz#c1c4b9bee3e09725ddb106b75c1e301fe2f18b26"
+  integrity sha1-wcS5vuPglyXdsQa3XB4wH+LxiyY=
+
+fill-range@^2.1.0:
+  version "2.2.4"
+  resolved "https://registry.yarnpkg.com/fill-range/-/fill-range-2.2.4.tgz#eb1e773abb056dcd8df2bfdf6af59b8b3a936565"
+  integrity sha512-cnrcCbj01+j2gTG921VZPnHbjmdAf8oQV/iGeV2kZxGSyfYjjTyY79ErsK1WJWMpw6DaApEX72binqJE+/d+5Q==
+  dependencies:
+    is-number "^2.1.0"
+    isobject "^2.0.0"
+    randomatic "^3.0.0"
+    repeat-element "^1.1.2"
+    repeat-string "^1.5.2"
+
+fill-range@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/fill-range/-/fill-range-4.0.0.tgz#d544811d428f98eb06a63dc402d2403c328c38f7"
+  integrity sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=
+  dependencies:
+    extend-shallow "^2.0.1"
+    is-number "^3.0.0"
+    repeat-string "^1.6.1"
+    to-regex-range "^2.1.0"
+
+fill-range@^7.0.1:
+  version "7.0.1"
+  resolved "https://registry.yarnpkg.com/fill-range/-/fill-range-7.0.1.tgz#1919a6a7c75fe38b2c7c77e5198535da9acdda40"
+  integrity sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==
+  dependencies:
+    to-regex-range "^5.0.1"
+
+find-up@5.0.0:
+  version "5.0.0"
+  resolved "https://registry.yarnpkg.com/find-up/-/find-up-5.0.0.tgz#4c92819ecb7083561e4f4a240a86be5198f536fc"
+  integrity sha512-78/PXT1wlLLDgTzDs7sjq9hzz0vXD+zn+7wypEe4fXQxCmdmqfGsEPQxmiCSQI3ajFV91bVSsvNtrJRiW6nGng==
+  dependencies:
+    locate-path "^6.0.0"
+    path-exists "^4.0.0"
+
+find-up@^3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/find-up/-/find-up-3.0.0.tgz#49169f1d7993430646da61ecc5ae355c21c97b73"
+  integrity sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==
+  dependencies:
+    locate-path "^3.0.0"
+
+flat@^5.0.2:
+  version "5.0.2"
+  resolved "https://registry.yarnpkg.com/flat/-/flat-5.0.2.tgz#8ca6fe332069ffa9d324c327198c598259ceb241"
+  integrity sha512-b6suED+5/3rTpUBdG1gupIl8MPFCAMA0QXwmljLhvCUKcUvdE4gWky9zpuGCcXHOsz4J9wPGNWq6OKpmIzz3hQ==
+
+for-in@^1.0.1, for-in@^1.0.2:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/for-in/-/for-in-1.0.2.tgz#81068d295a8142ec0ac726c6e2200c30fb6d5e80"
+  integrity sha1-gQaNKVqBQuwKxybG4iAMMPttXoA=
+
+for-own@^0.1.4:
+  version "0.1.5"
+  resolved "https://registry.yarnpkg.com/for-own/-/for-own-0.1.5.tgz#5265c681a4f294dabbf17c9509b6763aa84510ce"
+  integrity sha1-UmXGgaTylNq78XyVCbZ2OqhFEM4=
+  dependencies:
+    for-in "^1.0.1"
+
+fragment-cache@^0.2.1:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/fragment-cache/-/fragment-cache-0.2.1.tgz#4290fad27f13e89be7f33799c6bc5a0abfff0d19"
+  integrity sha1-QpD60n8T6Jvn8zeZxrxaCr//DRk=
+  dependencies:
+    map-cache "^0.2.2"
+
+fs-readdir-recursive@^1.0.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/fs-readdir-recursive/-/fs-readdir-recursive-1.1.0.tgz#e32fc030a2ccee44a6b5371308da54be0b397d27"
+  integrity sha512-GNanXlVr2pf02+sPN40XN8HG+ePaNcvM0q5mZBd668Obwb0yD5GiUbZOFgwn8kGMY6I3mdyDJzieUy3PTYyTRA==
+
+fs.realpath@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/fs.realpath/-/fs.realpath-1.0.0.tgz#1504ad2523158caa40db4a2787cb01411994ea4f"
+  integrity sha1-FQStJSMVjKpA20onh8sBQRmU6k8=
+
+fsevents@^1.0.0:
+  version "1.2.13"
+  resolved "https://registry.yarnpkg.com/fsevents/-/fsevents-1.2.13.tgz#f325cb0455592428bcf11b383370ef70e3bfcc38"
+  integrity sha512-oWb1Z6mkHIskLzEJ/XWX0srkpkTQ7vaopMQkyaEIoq0fmtFVxOthb8cCxeT+p3ynTdkk/RZwbgG4brR5BeWECw==
+  dependencies:
+    bindings "^1.5.0"
+    nan "^2.12.1"
+
+fsevents@~2.1.2:
+  version "2.1.3"
+  resolved "https://registry.yarnpkg.com/fsevents/-/fsevents-2.1.3.tgz#fb738703ae8d2f9fe900c33836ddebee8b97f23e"
+  integrity sha512-Auw9a4AxqWpa9GUfj370BMPzzyncfBABW8Mab7BGWBYDj4Isgq+cDKtx0i6u9jcX9pQDnswsaaOTgTmA5pEjuQ==
+
+get-caller-file@^2.0.1:
+  version "2.0.5"
+  resolved "https://registry.yarnpkg.com/get-caller-file/-/get-caller-file-2.0.5.tgz#4f94412a82db32f36e3b0b9741f8a97feb031f7e"
+  integrity sha512-DyFP3BM/3YHTQOCUL/w0OZHR0lpKeGrxotcHWcqNEdnltqFwXVfhEBQ94eIo34AfQpo0rGki4cyIiftY06h2Fg==
+
+get-value@^2.0.3, get-value@^2.0.6:
+  version "2.0.6"
+  resolved "https://registry.yarnpkg.com/get-value/-/get-value-2.0.6.tgz#dc15ca1c672387ca76bd37ac0a395ba2042a2c28"
+  integrity sha1-3BXKHGcjh8p2vTesCjlbogQqLCg=
+
+glob-base@^0.3.0:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/glob-base/-/glob-base-0.3.0.tgz#dbb164f6221b1c0b1ccf82aea328b497df0ea3c4"
+  integrity sha1-27Fk9iIbHAscz4Kuoyi0l98Oo8Q=
+  dependencies:
+    glob-parent "^2.0.0"
+    is-glob "^2.0.0"
+
+glob-parent@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/glob-parent/-/glob-parent-2.0.0.tgz#81383d72db054fcccf5336daa902f182f6edbb28"
+  integrity sha1-gTg9ctsFT8zPUzbaqQLxgvbtuyg=
+  dependencies:
+    is-glob "^2.0.0"
+
+glob-parent@~5.1.0:
+  version "5.1.1"
+  resolved "https://registry.yarnpkg.com/glob-parent/-/glob-parent-5.1.1.tgz#b6c1ef417c4e5663ea498f1c45afac6916bbc229"
+  integrity sha512-FnI+VGOpnlGHWZxthPGR+QhR78fuiK0sNLkHQv+bL9fQi57lNNdquIbna/WrfROrolq8GK5Ek6BiMwqL/voRYQ==
+  dependencies:
+    is-glob "^4.0.1"
+
+glob@7.1.6, glob@^7.1.2, glob@^7.1.3:
+  version "7.1.6"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-7.1.6.tgz#141f33b81a7c2492e125594307480c46679278a6"
+  integrity sha512-LwaxwyZ72Lk7vZINtNNrywX0ZuLyStrdDtabefZKAY5ZGJhVtgdznluResxNmPitE0SAO+O26sWTHeKSI2wMBA==
+  dependencies:
+    fs.realpath "^1.0.0"
+    inflight "^1.0.4"
+    inherits "2"
+    minimatch "^3.0.4"
+    once "^1.3.0"
+    path-is-absolute "^1.0.0"
+
+globals@^9.18.0:
+  version "9.18.0"
+  resolved "https://registry.yarnpkg.com/globals/-/globals-9.18.0.tgz#aa3896b3e69b487f17e31ed2143d69a8e30c2d8a"
+  integrity sha512-S0nG3CLEQiY/ILxqtztTWH/3iRRdyBLw6KMDxnKMchrtbj2OFmehVh0WUCfW3DUrIgx/qFrJPICrq4Z4sTR9UQ==
+
+graceful-fs@^4.1.11, graceful-fs@^4.1.4:
+  version "4.2.4"
+  resolved "https://registry.yarnpkg.com/graceful-fs/-/graceful-fs-4.2.4.tgz#2256bde14d3632958c465ebc96dc467ca07a29fb"
+  integrity sha512-WjKPNJF79dtJAVniUlGGWHYGz2jWxT6VhN/4m1NdkbZ2nOsEF+cI1Edgql5zCRhs/VsQYRvrXctxktVXZUkixw==
+
+graceful-fs@^4.1.3:
+  version "4.2.3"
+  resolved "https://registry.yarnpkg.com/graceful-fs/-/graceful-fs-4.2.3.tgz#4a12ff1b60376ef09862c2093edd908328be8423"
+
+growl@1.10.5:
+  version "1.10.5"
+  resolved "https://registry.yarnpkg.com/growl/-/growl-1.10.5.tgz#f2735dc2283674fa67478b10181059355c369e5e"
+  integrity sha512-qBr4OuELkhPenW6goKVXiv47US3clb3/IbuWF9KNKEijAy9oeHxU9IgzjvJhHkUzhaj7rOUD7+YGWqUjLp5oSA==
+
+has-ansi@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/has-ansi/-/has-ansi-2.0.0.tgz#34f5049ce1ecdf2b0649af3ef24e45ed35416d91"
+  integrity sha1-NPUEnOHs3ysGSa8+8k5F7TVBbZE=
+  dependencies:
+    ansi-regex "^2.0.0"
+
+has-flag@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/has-flag/-/has-flag-4.0.0.tgz#944771fd9c81c81265c4d6941860da06bb59479b"
+  integrity sha512-EykJT/Q1KjTWctppgIAgfSO0tKVuZUjhgMr17kqTumMl6Afv3EISleU7qZUzoXDFTAHTDC4NOoG/ZxU3EvlMPQ==
+
+has-value@^0.3.1:
+  version "0.3.1"
+  resolved "https://registry.yarnpkg.com/has-value/-/has-value-0.3.1.tgz#7b1f58bada62ca827ec0a2078025654845995e1f"
+  integrity sha1-ex9YutpiyoJ+wKIHgCVlSEWZXh8=
+  dependencies:
+    get-value "^2.0.3"
+    has-values "^0.1.4"
+    isobject "^2.0.0"
+
+has-value@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/has-value/-/has-value-1.0.0.tgz#18b281da585b1c5c51def24c930ed29a0be6b177"
+  integrity sha1-GLKB2lhbHFxR3vJMkw7SmgvmsXc=
+  dependencies:
+    get-value "^2.0.6"
+    has-values "^1.0.0"
+    isobject "^3.0.0"
+
+has-values@^0.1.4:
+  version "0.1.4"
+  resolved "https://registry.yarnpkg.com/has-values/-/has-values-0.1.4.tgz#6d61de95d91dfca9b9a02089ad384bff8f62b771"
+  integrity sha1-bWHeldkd/Km5oCCJrThL/49it3E=
+
+has-values@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/has-values/-/has-values-1.0.0.tgz#95b0b63fec2146619a6fe57fe75628d5a39efe4f"
+  integrity sha1-lbC2P+whRmGab+V/51Yo1aOe/k8=
+  dependencies:
+    is-number "^3.0.0"
+    kind-of "^4.0.0"
+
+he@1.2.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/he/-/he-1.2.0.tgz#84ae65fa7eafb165fddb61566ae14baf05664f0f"
+  integrity sha512-F/1DnUGPopORZi0ni+CvrCgHQ5FyEAHRLSApuYWMmrbSwoN2Mn/7k+Gl38gJnR7yyDZk6WLXwiGod1JOWNDKGw==
+
+home-or-tmp@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/home-or-tmp/-/home-or-tmp-2.0.0.tgz#e36c3f2d2cae7d746a857e38d18d5f32a7882db8"
+  integrity sha1-42w/LSyufXRqhX440Y1fMqeILbg=
+  dependencies:
+    os-homedir "^1.0.0"
+    os-tmpdir "^1.0.1"
+
+inflight@^1.0.4:
+  version "1.0.6"
+  resolved "https://registry.yarnpkg.com/inflight/-/inflight-1.0.6.tgz#49bd6331d7d02d0c09bc910a1075ba8165b56df9"
+  integrity sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=
+  dependencies:
+    once "^1.3.0"
+    wrappy "1"
+
+inherits@2, inherits@^2.0.1, inherits@~2.0.3:
+  version "2.0.4"
+  resolved "https://registry.yarnpkg.com/inherits/-/inherits-2.0.4.tgz#0fa2c64f932917c3433a0ded55363aae37416b7c"
+  integrity sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==
+
+invariant@^2.2.2:
+  version "2.2.4"
+  resolved "https://registry.yarnpkg.com/invariant/-/invariant-2.2.4.tgz#610f3c92c9359ce1db616e538008d23ff35158e6"
+  integrity sha512-phJfQVBuaJM5raOpJjSfkiD6BpbCE4Ns//LaXl6wGYtUBY83nWS6Rf9tXm2e8VaK60JEjYldbPif/A2B1C2gNA==
+  dependencies:
+    loose-envify "^1.0.0"
+
+is-accessor-descriptor@^0.1.6:
+  version "0.1.6"
+  resolved "https://registry.yarnpkg.com/is-accessor-descriptor/-/is-accessor-descriptor-0.1.6.tgz#a9e12cb3ae8d876727eeef3843f8a0897b5c98d6"
+  integrity sha1-qeEss66Nh2cn7u84Q/igiXtcmNY=
+  dependencies:
+    kind-of "^3.0.2"
+
+is-accessor-descriptor@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz#169c2f6d3df1f992618072365c9b0ea1f6878656"
+  integrity sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==
+  dependencies:
+    kind-of "^6.0.0"
+
+is-binary-path@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/is-binary-path/-/is-binary-path-1.0.1.tgz#75f16642b480f187a711c814161fd3a4a7655898"
+  integrity sha1-dfFmQrSA8YenEcgUFh/TpKdlWJg=
+  dependencies:
+    binary-extensions "^1.0.0"
+
+is-binary-path@~2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/is-binary-path/-/is-binary-path-2.1.0.tgz#ea1f7f3b80f064236e83470f86c09c254fb45b09"
+  integrity sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==
+  dependencies:
+    binary-extensions "^2.0.0"
+
+is-buffer@^1.1.5:
+  version "1.1.6"
+  resolved "https://registry.yarnpkg.com/is-buffer/-/is-buffer-1.1.6.tgz#efaa2ea9daa0d7ab2ea13a97b2b8ad51fefbe8be"
+  integrity sha512-NcdALwpXkTm5Zvvbk7owOUSvVvBKDgKP5/ewfXEznmQFfs4ZRmanOeKBTjRVjka3QFoN6XJ+9F3USqfHqTaU5w==
+
+is-data-descriptor@^0.1.4:
+  version "0.1.4"
+  resolved "https://registry.yarnpkg.com/is-data-descriptor/-/is-data-descriptor-0.1.4.tgz#0b5ee648388e2c860282e793f1856fec3f301b56"
+  integrity sha1-C17mSDiOLIYCgueT8YVv7D8wG1Y=
+  dependencies:
+    kind-of "^3.0.2"
+
+is-data-descriptor@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz#d84876321d0e7add03990406abbbbd36ba9268c7"
+  integrity sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==
+  dependencies:
+    kind-of "^6.0.0"
+
+is-descriptor@^0.1.0:
+  version "0.1.6"
+  resolved "https://registry.yarnpkg.com/is-descriptor/-/is-descriptor-0.1.6.tgz#366d8240dde487ca51823b1ab9f07a10a78251ca"
+  integrity sha512-avDYr0SB3DwO9zsMov0gKCESFYqCnE4hq/4z3TdUlukEy5t9C0YRq7HLrsN52NAcqXKaepeCD0n+B0arnVG3Hg==
+  dependencies:
+    is-accessor-descriptor "^0.1.6"
+    is-data-descriptor "^0.1.4"
+    kind-of "^5.0.0"
+
+is-descriptor@^1.0.0, is-descriptor@^1.0.2:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/is-descriptor/-/is-descriptor-1.0.2.tgz#3b159746a66604b04f8c81524ba365c5f14d86ec"
+  integrity sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==
+  dependencies:
+    is-accessor-descriptor "^1.0.0"
+    is-data-descriptor "^1.0.0"
+    kind-of "^6.0.2"
+
+is-dotfile@^1.0.0:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/is-dotfile/-/is-dotfile-1.0.3.tgz#a6a2f32ffd2dfb04f5ca25ecd0f6b83cf798a1e1"
+  integrity sha1-pqLzL/0t+wT1yiXs0Pa4PPeYoeE=
+
+is-equal-shallow@^0.1.3:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/is-equal-shallow/-/is-equal-shallow-0.1.3.tgz#2238098fc221de0bcfa5d9eac4c45d638aa1c534"
+  integrity sha1-IjgJj8Ih3gvPpdnqxMRdY4qhxTQ=
+  dependencies:
+    is-primitive "^2.0.0"
+
+is-extendable@^0.1.0, is-extendable@^0.1.1:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/is-extendable/-/is-extendable-0.1.1.tgz#62b110e289a471418e3ec36a617d472e301dfc89"
+  integrity sha1-YrEQ4omkcUGOPsNqYX1HLjAd/Ik=
+
+is-extendable@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/is-extendable/-/is-extendable-1.0.1.tgz#a7470f9e426733d81bd81e1155264e3a3507cab4"
+  integrity sha512-arnXMxT1hhoKo9k1LZdmlNyJdDDfy2v0fXjFlmok4+i8ul/6WlbVge9bhM74OpNPQPMGUToDtz+KXa1PneJxOA==
+  dependencies:
+    is-plain-object "^2.0.4"
+
+is-extglob@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/is-extglob/-/is-extglob-1.0.0.tgz#ac468177c4943405a092fc8f29760c6ffc6206c0"
+  integrity sha1-rEaBd8SUNAWgkvyPKXYMb/xiBsA=
+
+is-extglob@^2.1.1:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/is-extglob/-/is-extglob-2.1.1.tgz#a88c02535791f02ed37c76a1b9ea9773c833f8c2"
+  integrity sha1-qIwCU1eR8C7TfHahueqXc8gz+MI=
+
+is-finite@^1.0.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/is-finite/-/is-finite-1.1.0.tgz#904135c77fb42c0641d6aa1bcdbc4daa8da082f3"
+  integrity sha512-cdyMtqX/BOqqNBBiKlIVkytNHm49MtMlYyn1zxzvJKWmFMlGzm+ry5BBfYyeY9YmNKbRSo/o7OX9w9ale0wg3w==
+
+is-fullwidth-code-point@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz#a3b30a5c4f199183167aaab93beefae3ddfb654f"
+  integrity sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=
+
+is-glob@^2.0.0, is-glob@^2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/is-glob/-/is-glob-2.0.1.tgz#d096f926a3ded5600f3fdfd91198cb0888c2d863"
+  integrity sha1-0Jb5JqPe1WAPP9/ZEZjLCIjC2GM=
+  dependencies:
+    is-extglob "^1.0.0"
+
+is-glob@^4.0.1, is-glob@~4.0.1:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/is-glob/-/is-glob-4.0.1.tgz#7567dbe9f2f5e2467bc77ab83c4a29482407a5dc"
+  integrity sha512-5G0tKtBTFImOqDnLB2hG6Bp2qcKEFduo4tZu9MT/H6NQv/ghhy30o55ufafxJ/LdH79LLs2Kfrn85TLKyA7BUg==
+  dependencies:
+    is-extglob "^2.1.1"
+
+is-number@^2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/is-number/-/is-number-2.1.0.tgz#01fcbbb393463a548f2f466cce16dece49db908f"
+  integrity sha1-Afy7s5NGOlSPL0ZszhbezknbkI8=
+  dependencies:
+    kind-of "^3.0.2"
+
+is-number@^3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/is-number/-/is-number-3.0.0.tgz#24fd6201a4782cf50561c810276afc7d12d71195"
+  integrity sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=
+  dependencies:
+    kind-of "^3.0.2"
+
+is-number@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/is-number/-/is-number-4.0.0.tgz#0026e37f5454d73e356dfe6564699867c6a7f0ff"
+  integrity sha512-rSklcAIlf1OmFdyAqbnWTLVelsQ58uvZ66S/ZyawjWqIviTWCjg2PzVGw8WUA+nNuPTqb4wgA+NszrJ+08LlgQ==
+
+is-number@^7.0.0:
+  version "7.0.0"
+  resolved "https://registry.yarnpkg.com/is-number/-/is-number-7.0.0.tgz#7535345b896734d5f80c4d06c50955527a14f12b"
+  integrity sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==
+
+is-plain-obj@^2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/is-plain-obj/-/is-plain-obj-2.1.0.tgz#45e42e37fccf1f40da8e5f76ee21515840c09287"
+  integrity sha512-YWnfyRwxL/+SsrWYfOpUtz5b3YD+nyfkHvjbcanzk8zgyO4ASD67uVMRt8k5bM4lLMDnXfriRhOpemw+NfT1eA==
+
+is-plain-object@^2.0.3, is-plain-object@^2.0.4:
+  version "2.0.4"
+  resolved "https://registry.yarnpkg.com/is-plain-object/-/is-plain-object-2.0.4.tgz#2c163b3fafb1b606d9d17928f05c2a1c38e07677"
+  integrity sha512-h5PpgXkWitc38BBMYawTYMWJHFZJVnBquFE57xFpjB8pJFiF6gZ+bU+WyI/yqXiFR5mdLsgYNaPe8uao6Uv9Og==
+  dependencies:
+    isobject "^3.0.1"
+
+is-posix-bracket@^0.1.0:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/is-posix-bracket/-/is-posix-bracket-0.1.1.tgz#3334dc79774368e92f016e6fbc0a88f5cd6e6bc4"
+  integrity sha1-MzTceXdDaOkvAW5vvAqI9c1ua8Q=
+
+is-primitive@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/is-primitive/-/is-primitive-2.0.0.tgz#207bab91638499c07b2adf240a41a87210034575"
+  integrity sha1-IHurkWOEmcB7Kt8kCkGochADRXU=
+
+is-windows@^1.0.2:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/is-windows/-/is-windows-1.0.2.tgz#d1850eb9791ecd18e6182ce12a30f396634bb19d"
+  integrity sha512-eXK1UInq2bPmjyX6e3VHIzMLobc4J94i4AWn+Hpq3OU5KkrRC96OAcR3PRJ/pGu6m8TRnBHP9dkXQVsT/COVIA==
+
+isarray@1.0.0, isarray@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/isarray/-/isarray-1.0.0.tgz#bb935d48582cba168c06834957a54a3e07124f11"
+  integrity sha1-u5NdSFgsuhaMBoNJV6VKPgcSTxE=
+
+isexe@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/isexe/-/isexe-2.0.0.tgz#e8fbf374dc556ff8947a10dcb0572d633f2cfa10"
+  integrity sha1-6PvzdNxVb/iUehDcsFctYz8s+hA=
+
+isobject@^2.0.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/isobject/-/isobject-2.1.0.tgz#f065561096a3f1da2ef46272f815c840d87e0c89"
+  integrity sha1-8GVWEJaj8dou9GJy+BXIQNh+DIk=
+  dependencies:
+    isarray "1.0.0"
+
+isobject@^3.0.0, isobject@^3.0.1:
+  version "3.0.1"
+  resolved "https://registry.yarnpkg.com/isobject/-/isobject-3.0.1.tgz#4e431e92b11a9731636aa1f9c8d1ccbcfdab78df"
+  integrity sha1-TkMekrEalzFjaqH5yNHMvP2reN8=
+
+"js-tokens@^3.0.0 || ^4.0.0":
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/js-tokens/-/js-tokens-4.0.0.tgz#19203fb59991df98e3a287050d4647cdeaf32499"
+  integrity sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==
+
+js-tokens@^3.0.2:
+  version "3.0.2"
+  resolved "https://registry.yarnpkg.com/js-tokens/-/js-tokens-3.0.2.tgz#9866df395102130e38f7f996bceb65443209c25b"
+  integrity sha1-mGbfOVECEw449/mWvOtlRDIJwls=
+
+js-yaml@3.14.0:
+  version "3.14.0"
+  resolved "https://registry.yarnpkg.com/js-yaml/-/js-yaml-3.14.0.tgz#a7a34170f26a21bb162424d8adacb4113a69e482"
+  integrity sha512-/4IbIeHcD9VMHFqDR/gQ7EdZdLimOvW2DdcxFjdyyZ9NsbS+ccrXqVWDtab/lRl5AlUqmpBx8EhPaWR+OtY17A==
+  dependencies:
+    argparse "^1.0.7"
+    esprima "^4.0.0"
+
+jsesc@^1.3.0:
+  version "1.3.0"
+  resolved "https://registry.yarnpkg.com/jsesc/-/jsesc-1.3.0.tgz#46c3fec8c1892b12b0833db9bc7622176dbab34b"
+  integrity sha1-RsP+yMGJKxKwgz25vHYiF226s0s=
+
+jsesc@~0.5.0:
+  version "0.5.0"
+  resolved "https://registry.yarnpkg.com/jsesc/-/jsesc-0.5.0.tgz#e7dee66e35d6fc16f710fe91d5cf69f70f08911d"
+
+json5@^0.5.1:
+  version "0.5.1"
+  resolved "https://registry.yarnpkg.com/json5/-/json5-0.5.1.tgz#1eade7acc012034ad84e2396767ead9fa5495821"
+  integrity sha1-Hq3nrMASA0rYTiOWdn6tn6VJWCE=
+
+kind-of@^3.0.2, kind-of@^3.0.3, kind-of@^3.2.0:
+  version "3.2.2"
+  resolved "https://registry.yarnpkg.com/kind-of/-/kind-of-3.2.2.tgz#31ea21a734bab9bbb0f32466d893aea51e4a3c64"
+  integrity sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=
+  dependencies:
+    is-buffer "^1.1.5"
+
+kind-of@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/kind-of/-/kind-of-4.0.0.tgz#20813df3d712928b207378691a45066fae72dd57"
+  integrity sha1-IIE989cSkosgc3hpGkUGb65y3Vc=
+  dependencies:
+    is-buffer "^1.1.5"
+
+kind-of@^5.0.0:
+  version "5.1.0"
+  resolved "https://registry.yarnpkg.com/kind-of/-/kind-of-5.1.0.tgz#729c91e2d857b7a419a1f9aa65685c4c33f5845d"
+  integrity sha512-NGEErnH6F2vUuXDh+OlbcKW7/wOcfdRHaZ7VWtqCztfHri/++YKmP51OdWeGPuqCOba6kk2OTe5d02VmTB80Pw==
+
+kind-of@^6.0.0, kind-of@^6.0.2:
+  version "6.0.3"
+  resolved "https://registry.yarnpkg.com/kind-of/-/kind-of-6.0.3.tgz#07c05034a6c349fa06e24fa35aa76db4580ce4dd"
+  integrity sha512-dcS1ul+9tmeD95T+x28/ehLgd9mENa3LsvDTtzm3vyBEO7RPptvAD+t44WVXaUjTBRcrpFeFlC8WCruUR456hw==
+
+lazy-cache@^1.0.3:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/lazy-cache/-/lazy-cache-1.0.4.tgz#a1d78fc3a50474cb80845d3b3b6e1da49a446e8e"
+
+locate-path@^3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/locate-path/-/locate-path-3.0.0.tgz#dbec3b3ab759758071b58fe59fc41871af21400e"
+  integrity sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==
+  dependencies:
+    p-locate "^3.0.0"
+    path-exists "^3.0.0"
+
+locate-path@^6.0.0:
+  version "6.0.0"
+  resolved "https://registry.yarnpkg.com/locate-path/-/locate-path-6.0.0.tgz#55321eb309febbc59c4801d931a72452a681d286"
+  integrity sha512-iPZK6eYjbxRu3uB4/WZ3EsEIMJFMqAoopl3R+zuq0UjcAm/MO6KCweDgPfP3elTztoKP3KtnVHxTn2NHBSDVUw==
+  dependencies:
+    p-locate "^5.0.0"
+
+lodash@^4.17.4:
+  version "4.17.20"
+  resolved "https://registry.yarnpkg.com/lodash/-/lodash-4.17.20.tgz#b44a9b6297bcb698f1c51a3545a2b3b368d59c52"
+  integrity sha512-PlhdFcillOINfeV7Ni6oF1TAEayyZBoZ8bcshTHqOYJYlrqzRK5hagpagky5o4HfCzzd1TRkXPMFq6cKk9rGmA==
+
+log-symbols@4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/log-symbols/-/log-symbols-4.0.0.tgz#69b3cc46d20f448eccdb75ea1fa733d9e821c920"
+  integrity sha512-FN8JBzLx6CzeMrB0tg6pqlGU1wCrXW+ZXGH481kfsBqer0hToTIiHdjH4Mq8xJUbvATujKCvaREGWpGUionraA==
+  dependencies:
+    chalk "^4.0.0"
+
+longest@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/longest/-/longest-1.0.1.tgz#30a0b2da38f73770e8294a0d22e6625ed77d0097"
+
+loose-envify@^1.0.0:
+  version "1.4.0"
+  resolved "https://registry.yarnpkg.com/loose-envify/-/loose-envify-1.4.0.tgz#71ee51fa7be4caec1a63839f7e682d8132d30caf"
+  integrity sha512-lyuxPGr/Wfhrlem2CL/UcnUc1zcqKAImBDzukY7Y5F/yQiNdko6+fRLevlw1HgMySw7f611UIY408EtxRSoK3Q==
+  dependencies:
+    js-tokens "^3.0.0 || ^4.0.0"
+
+map-cache@^0.2.2:
+  version "0.2.2"
+  resolved "https://registry.yarnpkg.com/map-cache/-/map-cache-0.2.2.tgz#c32abd0bd6525d9b051645bb4f26ac5dc98a0dbf"
+  integrity sha1-wyq9C9ZSXZsFFkW7TyasXcmKDb8=
+
+map-visit@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/map-visit/-/map-visit-1.0.0.tgz#ecdca8f13144e660f1b5bd41f12f3479d98dfb8f"
+  integrity sha1-7Nyo8TFE5mDxtb1B8S80edmN+48=
+  dependencies:
+    object-visit "^1.0.0"
+
+math-random@^1.0.1:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/math-random/-/math-random-1.0.4.tgz#5dd6943c938548267016d4e34f057583080c514c"
+  integrity sha512-rUxjysqif/BZQH2yhd5Aaq7vXMSx9NdEsQcyA07uEzIvxgI7zIr33gGsh+RU0/XjmQpCW7RsVof1vlkvQVCK5A==
+
+micromatch@^2.1.5:
+  version "2.3.11"
+  resolved "https://registry.yarnpkg.com/micromatch/-/micromatch-2.3.11.tgz#86677c97d1720b363431d04d0d15293bd38c1565"
+  integrity sha1-hmd8l9FyCzY0MdBNDRUpO9OMFWU=
+  dependencies:
+    arr-diff "^2.0.0"
+    array-unique "^0.2.1"
+    braces "^1.8.2"
+    expand-brackets "^0.1.4"
+    extglob "^0.3.1"
+    filename-regex "^2.0.0"
+    is-extglob "^1.0.0"
+    is-glob "^2.0.1"
+    kind-of "^3.0.2"
+    normalize-path "^2.0.1"
+    object.omit "^2.0.0"
+    parse-glob "^3.0.4"
+    regex-cache "^0.4.2"
+
+micromatch@^3.1.10:
+  version "3.1.10"
+  resolved "https://registry.yarnpkg.com/micromatch/-/micromatch-3.1.10.tgz#70859bc95c9840952f359a068a3fc49f9ecfac23"
+  integrity sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==
+  dependencies:
+    arr-diff "^4.0.0"
+    array-unique "^0.3.2"
+    braces "^2.3.1"
+    define-property "^2.0.2"
+    extend-shallow "^3.0.2"
+    extglob "^2.0.4"
+    fragment-cache "^0.2.1"
+    kind-of "^6.0.2"
+    nanomatch "^1.2.9"
+    object.pick "^1.3.0"
+    regex-not "^1.0.0"
+    snapdragon "^0.8.1"
+    to-regex "^3.0.2"
+
+minimatch@3.0.4, minimatch@^3.0.2, minimatch@^3.0.4:
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-3.0.4.tgz#5166e286457f03306064be5497e8dbb0c3d32083"
+  dependencies:
+    brace-expansion "^1.1.7"
+
+minimist@^1.2.0, minimist@^1.2.5:
+  version "1.2.5"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-1.2.5.tgz#67d66014b66a6a8aaa0c083c5fd58df4e4e97602"
+  integrity sha512-FM9nNUYrRBAELZQT3xeZQ7fmMOBg6nWNmJKTcgsJeaLstP/UODVpGsr5OhXhhXg6f+qtJ8uiZ+PUxkDWcgIXLw==
+
+mixin-deep@^1.2.0:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/mixin-deep/-/mixin-deep-1.3.2.tgz#1120b43dc359a785dce65b55b82e257ccf479566"
+  integrity sha512-WRoDn//mXBiJ1H40rqa3vH0toePwSsGb45iInWlTySa+Uu4k3tYUSxa2v1KqAiLtvlrSzaExqS1gtk96A9zvEA==
+  dependencies:
+    for-in "^1.0.2"
+    is-extendable "^1.0.1"
+
+mkdirp@^0.5.1:
+  version "0.5.5"
+  resolved "https://registry.yarnpkg.com/mkdirp/-/mkdirp-0.5.5.tgz#d91cefd62d1436ca0f41620e251288d420099def"
+  integrity sha512-NKmAlESf6jMGym1++R0Ra7wvhV+wFW63FaSOFPwRahvea0gMUcGUhVeAg/0BC0wiv9ih5NYPB1Wn1UEI1/L+xQ==
+  dependencies:
+    minimist "^1.2.5"
+
+mocha-qunit-ui@^0.1.3:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/mocha-qunit-ui/-/mocha-qunit-ui-0.1.3.tgz#e3e1ff1dac33222b10cef681efd7f82664141ea9"
+
+mocha@^8.2.1:
+  version "8.2.1"
+  resolved "https://registry.yarnpkg.com/mocha/-/mocha-8.2.1.tgz#f2fa68817ed0e53343d989df65ccd358bc3a4b39"
+  integrity sha512-cuLBVfyFfFqbNR0uUKbDGXKGk+UDFe6aR4os78XIrMQpZl/nv7JYHcvP5MFIAb374b2zFXsdgEGwmzMtP0Xg8w==
+  dependencies:
+    "@ungap/promise-all-settled" "1.1.2"
+    ansi-colors "4.1.1"
+    browser-stdout "1.3.1"
+    chokidar "3.4.3"
+    debug "4.2.0"
+    diff "4.0.2"
+    escape-string-regexp "4.0.0"
+    find-up "5.0.0"
+    glob "7.1.6"
+    growl "1.10.5"
+    he "1.2.0"
+    js-yaml "3.14.0"
+    log-symbols "4.0.0"
+    minimatch "3.0.4"
+    ms "2.1.2"
+    nanoid "3.1.12"
+    serialize-javascript "5.0.1"
+    strip-json-comments "3.1.1"
+    supports-color "7.2.0"
+    which "2.0.2"
+    wide-align "1.1.3"
+    workerpool "6.0.2"
+    yargs "13.3.2"
+    yargs-parser "13.1.2"
+    yargs-unparser "2.0.0"
+
+ms@2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/ms/-/ms-2.0.0.tgz#5608aeadfc00be6c2901df5f9861788de0d597c8"
+  integrity sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=
+
+ms@2.1.2:
+  version "2.1.2"
+  resolved "https://registry.yarnpkg.com/ms/-/ms-2.1.2.tgz#d09d1f357b443f493382a8eb3ccd183872ae6009"
+  integrity sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==
+
+nan@^2.12.1:
+  version "2.14.2"
+  resolved "https://registry.yarnpkg.com/nan/-/nan-2.14.2.tgz#f5376400695168f4cc694ac9393d0c9585eeea19"
+  integrity sha512-M2ufzIiINKCuDfBSAUr1vWQ+vuVcA9kqx8JJUsbQi6yf1uGRyb7HfpdfUr5qLXf3B/t8dPvcjhKMmlfnP47EzQ==
+
+nanoid@3.1.12:
+  version "3.1.12"
+  resolved "https://registry.yarnpkg.com/nanoid/-/nanoid-3.1.12.tgz#6f7736c62e8d39421601e4a0c77623a97ea69654"
+  integrity sha512-1qstj9z5+x491jfiC4Nelk+f8XBad7LN20PmyWINJEMRSf3wcAjAWysw1qaA8z6NSKe2sjq1hRSDpBH5paCb6A==
+
+nanomatch@^1.2.9:
+  version "1.2.13"
+  resolved "https://registry.yarnpkg.com/nanomatch/-/nanomatch-1.2.13.tgz#b87a8aa4fc0de8fe6be88895b38983ff265bd119"
+  integrity sha512-fpoe2T0RbHwBTBUOftAfBPaDEi06ufaUai0mE6Yn1kacc3SnTErfb/h+X94VXzI64rKFHYImXSvdwGGCmwOqCA==
+  dependencies:
+    arr-diff "^4.0.0"
+    array-unique "^0.3.2"
+    define-property "^2.0.2"
+    extend-shallow "^3.0.2"
+    fragment-cache "^0.2.1"
+    is-windows "^1.0.2"
+    kind-of "^6.0.2"
+    object.pick "^1.3.0"
+    regex-not "^1.0.0"
+    snapdragon "^0.8.1"
+    to-regex "^3.0.1"
+
+normalize-path@^2.0.0, normalize-path@^2.0.1:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/normalize-path/-/normalize-path-2.1.1.tgz#1ab28b556e198363a8c1a6f7e6fa20137fe6aed9"
+  integrity sha1-GrKLVW4Zg2Oowab35vogE3/mrtk=
+  dependencies:
+    remove-trailing-separator "^1.0.1"
+
+normalize-path@^3.0.0, normalize-path@~3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/normalize-path/-/normalize-path-3.0.0.tgz#0dcd69ff23a1c9b11fd0978316644a0388216a65"
+  integrity sha512-6eZs5Ls3WtCisHWp9S2GUy8dqkpGi4BVSz3GaqiE6ezub0512ESztXUwUB6C6IKbQkY2Pnb/mD4WYojCRwcwLA==
+
+object-assign@^4.1.0:
+  version "4.1.1"
+  resolved "https://registry.yarnpkg.com/object-assign/-/object-assign-4.1.1.tgz#2109adc7965887cfc05cbbd442cac8bfbb360863"
+  integrity sha1-IQmtx5ZYh8/AXLvUQsrIv7s2CGM=
+
+object-copy@^0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/object-copy/-/object-copy-0.1.0.tgz#7e7d858b781bd7c991a41ba975ed3812754e998c"
+  integrity sha1-fn2Fi3gb18mRpBupde04EnVOmYw=
+  dependencies:
+    copy-descriptor "^0.1.0"
+    define-property "^0.2.5"
+    kind-of "^3.0.3"
+
+object-visit@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/object-visit/-/object-visit-1.0.1.tgz#f79c4493af0c5377b59fe39d395e41042dd045bb"
+  integrity sha1-95xEk68MU3e1n+OdOV5BBC3QRbs=
+  dependencies:
+    isobject "^3.0.0"
+
+object.omit@^2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/object.omit/-/object.omit-2.0.1.tgz#1a9c744829f39dbb858c76ca3579ae2a54ebd1fa"
+  integrity sha1-Gpx0SCnznbuFjHbKNXmuKlTr0fo=
+  dependencies:
+    for-own "^0.1.4"
+    is-extendable "^0.1.1"
+
+object.pick@^1.3.0:
+  version "1.3.0"
+  resolved "https://registry.yarnpkg.com/object.pick/-/object.pick-1.3.0.tgz#87a10ac4c1694bd2e1cbf53591a66141fb5dd747"
+  integrity sha1-h6EKxMFpS9Lhy/U1kaZhQftd10c=
+  dependencies:
+    isobject "^3.0.1"
+
+once@^1.3.0:
+  version "1.4.0"
+  resolved "https://registry.yarnpkg.com/once/-/once-1.4.0.tgz#583b1aa775961d4b113ac17d9c50baef9dd76bd1"
+  integrity sha1-WDsap3WWHUsROsF9nFC6753Xa9E=
+  dependencies:
+    wrappy "1"
+
+os-homedir@^1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/os-homedir/-/os-homedir-1.0.2.tgz#ffbc4988336e0e833de0c168c7ef152121aa7fb3"
+  integrity sha1-/7xJiDNuDoM94MFox+8VISGqf7M=
+
+os-tmpdir@^1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/os-tmpdir/-/os-tmpdir-1.0.2.tgz#bbe67406c79aa85c5cfec766fe5734555dfa1274"
+  integrity sha1-u+Z0BseaqFxc/sdm/lc0VV36EnQ=
+
+output-file-sync@^1.1.2:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/output-file-sync/-/output-file-sync-1.1.2.tgz#d0a33eefe61a205facb90092e826598d5245ce76"
+  integrity sha1-0KM+7+YaIF+suQCS6CZZjVJFznY=
+  dependencies:
+    graceful-fs "^4.1.4"
+    mkdirp "^0.5.1"
+    object-assign "^4.1.0"
+
+p-limit@^2.0.0:
+  version "2.3.0"
+  resolved "https://registry.yarnpkg.com/p-limit/-/p-limit-2.3.0.tgz#3dd33c647a214fdfffd835933eb086da0dc21db1"
+  integrity sha512-//88mFWSJx8lxCzwdAABTJL2MyWB12+eIY7MDL2SqLmAkeKU9qxRvWuSyTjm3FUmpBEMuFfckAIqEaVGUDxb6w==
+  dependencies:
+    p-try "^2.0.0"
+
+p-limit@^3.0.2:
+  version "3.1.0"
+  resolved "https://registry.yarnpkg.com/p-limit/-/p-limit-3.1.0.tgz#e1daccbe78d0d1388ca18c64fea38e3e57e3706b"
+  integrity sha512-TYOanM3wGwNGsZN2cVTYPArw454xnXj5qmWF1bEoAc4+cU/ol7GVh7odevjp1FNHduHc3KZMcFduxU5Xc6uJRQ==
+  dependencies:
+    yocto-queue "^0.1.0"
+
+p-locate@^3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/p-locate/-/p-locate-3.0.0.tgz#322d69a05c0264b25997d9f40cd8a891ab0064a4"
+  integrity sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==
+  dependencies:
+    p-limit "^2.0.0"
+
+p-locate@^5.0.0:
+  version "5.0.0"
+  resolved "https://registry.yarnpkg.com/p-locate/-/p-locate-5.0.0.tgz#83c8315c6785005e3bd021839411c9e110e6d834"
+  integrity sha512-LaNjtRWUBY++zB5nE/NwcaoMylSPk+S+ZHNB1TzdbMJMny6dynpAGt7X/tl/QYq3TIeE6nxHppbo2LGymrG5Pw==
+  dependencies:
+    p-limit "^3.0.2"
+
+p-try@^2.0.0:
+  version "2.2.0"
+  resolved "https://registry.yarnpkg.com/p-try/-/p-try-2.2.0.tgz#cb2868540e313d61de58fafbe35ce9004d5540e6"
+  integrity sha512-R4nPAVTAU0B9D35/Gk3uJf/7XYbQcyohSKdvAxIRSNghFl4e71hVoGnBNQz9cWaXxO2I10KTC+3jMdvvoKw6dQ==
+
+parse-glob@^3.0.4:
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/parse-glob/-/parse-glob-3.0.4.tgz#b2c376cfb11f35513badd173ef0bb6e3a388391c"
+  integrity sha1-ssN2z7EfNVE7rdFz7wu246OIORw=
+  dependencies:
+    glob-base "^0.3.0"
+    is-dotfile "^1.0.0"
+    is-extglob "^1.0.0"
+    is-glob "^2.0.0"
+
+pascalcase@^0.1.1:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/pascalcase/-/pascalcase-0.1.1.tgz#b363e55e8006ca6fe21784d2db22bd15d7917f14"
+  integrity sha1-s2PlXoAGym/iF4TS2yK9FdeRfxQ=
+
+path-exists@^3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/path-exists/-/path-exists-3.0.0.tgz#ce0ebeaa5f78cb18925ea7d810d7b59b010fd515"
+  integrity sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=
+
+path-exists@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/path-exists/-/path-exists-4.0.0.tgz#513bdbe2d3b95d7762e8c1137efa195c6c61b5b3"
+  integrity sha512-ak9Qy5Q7jYb2Wwcey5Fpvg2KoAc/ZIhLSLOSBmRmygPsGwkVVt0fZa0qrtMz+m6tJTAHfZQ8FnmB4MG4LWy7/w==
+
+path-is-absolute@^1.0.0, path-is-absolute@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/path-is-absolute/-/path-is-absolute-1.0.1.tgz#174b9268735534ffbc7ace6bf53a5a9e1b5c5f5f"
+  integrity sha1-F0uSaHNVNP+8es5r9TpanhtcX18=
+
+path-parse@^1.0.5:
+  version "1.0.5"
+  resolved "https://registry.yarnpkg.com/path-parse/-/path-parse-1.0.5.tgz#3c1adf871ea9cd6c9431b6ea2bd74a0ff055c4c1"
+
+picomatch@^2.0.4, picomatch@^2.2.1:
+  version "2.2.2"
+  resolved "https://registry.yarnpkg.com/picomatch/-/picomatch-2.2.2.tgz#21f333e9b6b8eaff02468f5146ea406d345f4dad"
+  integrity sha512-q0M/9eZHzmr0AulXyPwNfZjtwZ/RBZlbN3K3CErVrk50T2ASYI7Bye0EvekFY3IP1Nt2DHu0re+V2ZHIpMkuWg==
+
+posix-character-classes@^0.1.0:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/posix-character-classes/-/posix-character-classes-0.1.1.tgz#01eac0fe3b5af71a2a6c02feabb8c1fef7e00eab"
+  integrity sha1-AerA/jta9xoqbAL+q7jB/vfgDqs=
+
+preserve@^0.2.0:
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/preserve/-/preserve-0.2.0.tgz#815ed1f6ebc65926f865b310c0713bcb3315ce4b"
+  integrity sha1-gV7R9uvGWSb4ZbMQwHE7yzMVzks=
+
+private@^0.1.6, private@^0.1.7, private@^0.1.8:
+  version "0.1.8"
+  resolved "https://registry.yarnpkg.com/private/-/private-0.1.8.tgz#2381edb3689f7a53d653190060fcf822d2f368ff"
+
+process-nextick-args@~2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/process-nextick-args/-/process-nextick-args-2.0.1.tgz#7820d9b16120cc55ca9ae7792680ae7dba6d7fe2"
+  integrity sha512-3ouUOpQhtgrbOa17J7+uxOTpITYWaGP7/AhoR3+A+/1e9skrzelGi/dXzEYyvbxubEF6Wn2ypscTKiKJFFn1ag==
+
+punycode@^2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/punycode/-/punycode-2.1.0.tgz#5f863edc89b96db09074bad7947bf09056ca4e7d"
+
+randomatic@^3.0.0:
+  version "3.1.1"
+  resolved "https://registry.yarnpkg.com/randomatic/-/randomatic-3.1.1.tgz#b776efc59375984e36c537b2f51a1f0aff0da1ed"
+  integrity sha512-TuDE5KxZ0J461RVjrJZCJc+J+zCkTb1MbH9AQUq68sMhOMcy9jLcb3BrZKgp9q9Ncltdg4QVqWrH02W2EFFVYw==
+  dependencies:
+    is-number "^4.0.0"
+    kind-of "^6.0.0"
+    math-random "^1.0.1"
+
+randombytes@^2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/randombytes/-/randombytes-2.1.0.tgz#df6f84372f0270dc65cdf6291349ab7a473d4f2a"
+  integrity sha512-vYl3iOX+4CKUWuxGi9Ukhie6fsqXqS9FE2Zaic4tNFD2N2QQaXOMFbuKK4QmDHC0JO6B1Zp41J0LpT0oR68amQ==
+  dependencies:
+    safe-buffer "^5.1.0"
+
+readable-stream@^2.0.2:
+  version "2.3.7"
+  resolved "https://registry.yarnpkg.com/readable-stream/-/readable-stream-2.3.7.tgz#1eca1cf711aef814c04f62252a36a62f6cb23b57"
+  integrity sha512-Ebho8K4jIbHAxnuxi7o42OrZgF/ZTNcsZj6nRKyUmkhLFq8CHItp/fy6hQZuZmP/n3yZ9VBUbp4zz/mX8hmYPw==
+  dependencies:
+    core-util-is "~1.0.0"
+    inherits "~2.0.3"
+    isarray "~1.0.0"
+    process-nextick-args "~2.0.0"
+    safe-buffer "~5.1.1"
+    string_decoder "~1.1.1"
+    util-deprecate "~1.0.1"
+
+readdirp@^2.0.0:
+  version "2.2.1"
+  resolved "https://registry.yarnpkg.com/readdirp/-/readdirp-2.2.1.tgz#0e87622a3325aa33e892285caf8b4e846529a525"
+  integrity sha512-1JU/8q+VgFZyxwrJ+SVIOsh+KywWGpds3NTqikiKpDMZWScmAYyKIgqkO+ARvNWJfXeXR1zxz7aHF4u4CyH6vQ==
+  dependencies:
+    graceful-fs "^4.1.11"
+    micromatch "^3.1.10"
+    readable-stream "^2.0.2"
+
+readdirp@~3.5.0:
+  version "3.5.0"
+  resolved "https://registry.yarnpkg.com/readdirp/-/readdirp-3.5.0.tgz#9ba74c019b15d365278d2e91bb8c48d7b4d42c9e"
+  integrity sha512-cMhu7c/8rdhkHXWsY+osBhfSy0JikwpHK/5+imo+LpeasTF8ouErHrlYkwT0++njiyuDvc7OFY5T3ukvZ8qmFQ==
+  dependencies:
+    picomatch "^2.2.1"
+
+regenerate@^1.2.1:
+  version "1.3.3"
+  resolved "https://registry.yarnpkg.com/regenerate/-/regenerate-1.3.3.tgz#0c336d3980553d755c39b586ae3b20aa49c82b7f"
+
+regenerator-runtime@^0.10.5:
+  version "0.10.5"
+  resolved "https://registry.yarnpkg.com/regenerator-runtime/-/regenerator-runtime-0.10.5.tgz#336c3efc1220adcedda2c9fab67b5a7955a33658"
+  integrity sha1-M2w+/BIgrc7dosn6tntaeVWjNlg=
+
+regenerator-runtime@^0.11.0:
+  version "0.11.1"
+  resolved "https://registry.yarnpkg.com/regenerator-runtime/-/regenerator-runtime-0.11.1.tgz#be05ad7f9bf7d22e056f9726cee5017fbf19e2e9"
+  integrity sha512-MguG95oij0fC3QV3URf4V2SDYGJhJnJGqvIIgdECeODCT98wSWDAJ94SSuVpYQUoTcGUIL6L4yNB7j1DFFHSBg==
+
+regenerator-transform@^0.10.0:
+  version "0.10.1"
+  resolved "https://registry.yarnpkg.com/regenerator-transform/-/regenerator-transform-0.10.1.tgz#1e4996837231da8b7f3cf4114d71b5691a0680dd"
+  dependencies:
+    babel-runtime "^6.18.0"
+    babel-types "^6.19.0"
+    private "^0.1.6"
+
+regex-cache@^0.4.2:
+  version "0.4.4"
+  resolved "https://registry.yarnpkg.com/regex-cache/-/regex-cache-0.4.4.tgz#75bdc58a2a1496cec48a12835bc54c8d562336dd"
+  integrity sha512-nVIZwtCjkC9YgvWkpM55B5rBhBYRZhAaJbgcFYXXsHnbZ9UZI9nnVWYZpBlCqv9ho2eZryPnWrZGsOdPwVWXWQ==
+  dependencies:
+    is-equal-shallow "^0.1.3"
+
+regex-not@^1.0.0, regex-not@^1.0.2:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/regex-not/-/regex-not-1.0.2.tgz#1f4ece27e00b0b65e0247a6810e6a85d83a5752c"
+  integrity sha512-J6SDjUgDxQj5NusnOtdFxDwN/+HWykR8GELwctJ7mdqhcyy1xEc4SRFHUXvxTp661YaVKAjfRLZ9cCqS6tn32A==
+  dependencies:
+    extend-shallow "^3.0.2"
+    safe-regex "^1.1.0"
+
+regexpu-core@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/regexpu-core/-/regexpu-core-2.0.0.tgz#49d038837b8dcf8bfa5b9a42139938e6ea2ae240"
+  dependencies:
+    regenerate "^1.2.1"
+    regjsgen "^0.2.0"
+    regjsparser "^0.1.4"
+
+regjsgen@^0.2.0:
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/regjsgen/-/regjsgen-0.2.0.tgz#6c016adeac554f75823fe37ac05b92d5a4edb1f7"
+
+regjsparser@^0.1.4:
+  version "0.1.5"
+  resolved "https://registry.yarnpkg.com/regjsparser/-/regjsparser-0.1.5.tgz#7ee8f84dc6fa792d3fd0ae228d24bd949ead205c"
+  dependencies:
+    jsesc "~0.5.0"
+
+remove-trailing-separator@^1.0.1:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/remove-trailing-separator/-/remove-trailing-separator-1.1.0.tgz#c24bce2a283adad5bc3f58e0d48249b92379d8ef"
+  integrity sha1-wkvOKig62tW8P1jg1IJJuSN52O8=
+
+repeat-element@^1.1.2:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/repeat-element/-/repeat-element-1.1.3.tgz#782e0d825c0c5a3bb39731f84efee6b742e6b1ce"
+  integrity sha512-ahGq0ZnV5m5XtZLMb+vP76kcAM5nkLqk0lpqAuojSKGgQtn4eRi4ZZGm2olo2zKFH+sMsWaqOCW1dqAnOru72g==
+
+repeat-string@^1.5.2, repeat-string@^1.6.1:
+  version "1.6.1"
+  resolved "https://registry.yarnpkg.com/repeat-string/-/repeat-string-1.6.1.tgz#8dcae470e1c88abc2d600fff4a776286da75e637"
+  integrity sha1-jcrkcOHIirwtYA//Sndihtp15jc=
+
+repeating@^2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/repeating/-/repeating-2.0.1.tgz#5214c53a926d3552707527fbab415dbc08d06dda"
+  integrity sha1-UhTFOpJtNVJwdSf7q0FdvAjQbdo=
+  dependencies:
+    is-finite "^1.0.0"
+
+require-directory@^2.1.1:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/require-directory/-/require-directory-2.1.1.tgz#8c64ad5fd30dab1c976e2344ffe7f792a6a6df42"
+  integrity sha1-jGStX9MNqxyXbiNE/+f3kqam30I=
+
+require-main-filename@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/require-main-filename/-/require-main-filename-2.0.0.tgz#d0b329ecc7cc0f61649f62215be69af54aa8989b"
+  integrity sha512-NKN5kMDylKuldxYLSUfrbo5Tuzh4hd+2E8NPPX02mZtn1VuREQToYe/ZdlJy+J3uCpfaiGF05e7B8W0iXbQHmg==
+
+resolve-url@^0.2.1:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/resolve-url/-/resolve-url-0.2.1.tgz#2c637fe77c893afd2a663fe21aa9080068e2052a"
+  integrity sha1-LGN/53yJOv0qZj/iGqkIAGjiBSo=
+
+resolve@1.1.7:
+  version "1.1.7"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.1.7.tgz#203114d82ad2c5ed9e8e0411b3932875e889e97b"
+
+resolve@^1.1.6:
+  version "1.6.0"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.6.0.tgz#0fbd21278b27b4004481c395349e7aba60a9ff5c"
+  dependencies:
+    path-parse "^1.0.5"
+
+ret@~0.1.10:
+  version "0.1.15"
+  resolved "https://registry.yarnpkg.com/ret/-/ret-0.1.15.tgz#b8a4825d5bdb1fc3f6f53c2bc33f81388681c7bc"
+  integrity sha512-TTlYpa+OL+vMMNG24xSlQGEJ3B/RzEfUlLct7b5G/ytav+wPrplCpVMFuwzXbkecJrb6IYo1iFb0S9v37754mg==
+
+right-align@^0.1.1:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/right-align/-/right-align-0.1.3.tgz#61339b722fe6a3515689210d24e14c96148613ef"
+  dependencies:
+    align-text "^0.1.1"
+
+rimraf@^2.5.2:
+  version "2.7.1"
+  resolved "https://registry.yarnpkg.com/rimraf/-/rimraf-2.7.1.tgz#35797f13a7fdadc566142c29d4f07ccad483e3ec"
+  dependencies:
+    glob "^7.1.3"
+
+rollup-plugin-babel@^2.7.1:
+  version "2.7.1"
+  resolved "https://registry.yarnpkg.com/rollup-plugin-babel/-/rollup-plugin-babel-2.7.1.tgz#16528197b0f938a1536f44683c7a93d573182f57"
+  dependencies:
+    babel-core "6"
+    babel-plugin-transform-es2015-classes "^6.9.0"
+    object-assign "^4.1.0"
+    rollup-pluginutils "^1.5.0"
+
+rollup-plugin-node-resolve@^2.0.0:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/rollup-plugin-node-resolve/-/rollup-plugin-node-resolve-2.1.1.tgz#cbb783b0d15b02794d58915350b2f0d902b8ddc8"
+  dependencies:
+    browser-resolve "^1.11.0"
+    builtin-modules "^1.1.0"
+    resolve "^1.1.6"
+
+rollup-pluginutils@^1.5.0:
+  version "1.5.2"
+  resolved "https://registry.yarnpkg.com/rollup-pluginutils/-/rollup-pluginutils-1.5.2.tgz#1e156e778f94b7255bfa1b3d0178be8f5c552408"
+  dependencies:
+    estree-walker "^0.2.1"
+    minimatch "^3.0.2"
+
+rollup@^0.41.6:
+  version "0.41.6"
+  resolved "https://registry.yarnpkg.com/rollup/-/rollup-0.41.6.tgz#e0d05497877a398c104d816d2733a718a7a94e2a"
+  dependencies:
+    source-map-support "^0.4.0"
+
+safe-buffer@^5.1.0:
+  version "5.2.1"
+  resolved "https://registry.yarnpkg.com/safe-buffer/-/safe-buffer-5.2.1.tgz#1eaf9fa9bdb1fdd4ec75f58f9cdb4e6b7827eec6"
+  integrity sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==
+
+safe-buffer@~5.1.0, safe-buffer@~5.1.1:
+  version "5.1.2"
+  resolved "https://registry.yarnpkg.com/safe-buffer/-/safe-buffer-5.1.2.tgz#991ec69d296e0313747d59bdfd2b745c35f8828d"
+  integrity sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==
+
+safe-regex@^1.1.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/safe-regex/-/safe-regex-1.1.0.tgz#40a3669f3b077d1e943d44629e157dd48023bf2e"
+  integrity sha1-QKNmnzsHfR6UPURinhV91IAjvy4=
+  dependencies:
+    ret "~0.1.10"
+
+sander@^0.5.0:
+  version "0.5.1"
+  resolved "https://registry.yarnpkg.com/sander/-/sander-0.5.1.tgz#741e245e231f07cafb6fdf0f133adfa216a502ad"
+  dependencies:
+    es6-promise "^3.1.2"
+    graceful-fs "^4.1.3"
+    mkdirp "^0.5.1"
+    rimraf "^2.5.2"
+
+serialize-javascript@5.0.1:
+  version "5.0.1"
+  resolved "https://registry.yarnpkg.com/serialize-javascript/-/serialize-javascript-5.0.1.tgz#7886ec848049a462467a97d3d918ebb2aaf934f4"
+  integrity sha512-SaaNal9imEO737H2c05Og0/8LUXG7EnsZyMa8MzkmuHoELfT6txuj0cMqRj6zfPKnmQ1yasR4PCJc8x+M4JSPA==
+  dependencies:
+    randombytes "^2.1.0"
+
+set-blocking@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/set-blocking/-/set-blocking-2.0.0.tgz#045f9782d011ae9a6803ddd382b24392b3d890f7"
+
+set-value@^2.0.0, set-value@^2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/set-value/-/set-value-2.0.1.tgz#a18d40530e6f07de4228c7defe4227af8cad005b"
+  integrity sha512-JxHc1weCN68wRY0fhCoXpyK55m/XPHafOmK4UWD7m2CI14GMcFypt4w/0+NV5f/ZMby2F6S2wwA7fgynh9gWSw==
+  dependencies:
+    extend-shallow "^2.0.1"
+    is-extendable "^0.1.1"
+    is-plain-object "^2.0.3"
+    split-string "^3.0.1"
+
+slash@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/slash/-/slash-1.0.0.tgz#c41f2f6c39fc16d1cd17ad4b5d896114ae470d55"
+  integrity sha1-xB8vbDn8FtHNF61LXYlhFK5HDVU=
+
+snapdragon-node@^2.0.1:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/snapdragon-node/-/snapdragon-node-2.1.1.tgz#6c175f86ff14bdb0724563e8f3c1b021a286853b"
+  integrity sha512-O27l4xaMYt/RSQ5TR3vpWCAB5Kb/czIcqUFOM/C4fYcLnbZUc1PkjTAMjof2pBWaSTwOUd6qUHcFGVGj7aIwnw==
+  dependencies:
+    define-property "^1.0.0"
+    isobject "^3.0.0"
+    snapdragon-util "^3.0.1"
+
+snapdragon-util@^3.0.1:
+  version "3.0.1"
+  resolved "https://registry.yarnpkg.com/snapdragon-util/-/snapdragon-util-3.0.1.tgz#f956479486f2acd79700693f6f7b805e45ab56e2"
+  integrity sha512-mbKkMdQKsjX4BAL4bRYTj21edOf8cN7XHdYUJEe+Zn99hVEYcMvKPct1IqNe7+AZPirn8BCDOQBHQZknqmKlZQ==
+  dependencies:
+    kind-of "^3.2.0"
+
+snapdragon@^0.8.1:
+  version "0.8.2"
+  resolved "https://registry.yarnpkg.com/snapdragon/-/snapdragon-0.8.2.tgz#64922e7c565b0e14204ba1aa7d6964278d25182d"
+  integrity sha512-FtyOnWN/wCHTVXOMwvSv26d+ko5vWlIDD6zoUJ7LW8vh+ZBC8QdljveRP+crNrtBwioEUWy/4dMtbBjA4ioNlg==
+  dependencies:
+    base "^0.11.1"
+    debug "^2.2.0"
+    define-property "^0.2.5"
+    extend-shallow "^2.0.1"
+    map-cache "^0.2.2"
+    source-map "^0.5.6"
+    source-map-resolve "^0.5.0"
+    use "^3.1.0"
+
+sorcery@^0.10.0:
+  version "0.10.0"
+  resolved "https://registry.yarnpkg.com/sorcery/-/sorcery-0.10.0.tgz#8ae90ad7d7cb05fc59f1ab0c637845d5c15a52b7"
+  dependencies:
+    buffer-crc32 "^0.2.5"
+    minimist "^1.2.0"
+    sander "^0.5.0"
+    sourcemap-codec "^1.3.0"
+
+source-map-resolve@^0.5.0:
+  version "0.5.3"
+  resolved "https://registry.yarnpkg.com/source-map-resolve/-/source-map-resolve-0.5.3.tgz#190866bece7553e1f8f267a2ee82c606b5509a1a"
+  integrity sha512-Htz+RnsXWk5+P2slx5Jh3Q66vhQj1Cllm0zvnaY98+NFx+Dv2CF/f5O/t8x+KaNdrdIAsruNzoh/KpialbqAnw==
+  dependencies:
+    atob "^2.1.2"
+    decode-uri-component "^0.2.0"
+    resolve-url "^0.2.1"
+    source-map-url "^0.4.0"
+    urix "^0.1.0"
+
+source-map-support@^0.4.0, source-map-support@^0.4.15:
+  version "0.4.18"
+  resolved "https://registry.yarnpkg.com/source-map-support/-/source-map-support-0.4.18.tgz#0286a6de8be42641338594e97ccea75f0a2c585f"
+  dependencies:
+    source-map "^0.5.6"
+
+source-map-url@^0.4.0:
+  version "0.4.0"
+  resolved "https://registry.yarnpkg.com/source-map-url/-/source-map-url-0.4.0.tgz#3e935d7ddd73631b97659956d55128e87b5084a3"
+  integrity sha1-PpNdfd1zYxuXZZlW1VEo6HtQhKM=
+
+source-map@^0.5.6, source-map@^0.5.7, source-map@~0.5.1:
+  version "0.5.7"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.5.7.tgz#8a039d2d1021d22d1ea14c80d8ea468ba2ef3fcc"
+  integrity sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=
+
+sourcemap-codec@^1.3.0:
+  version "1.4.1"
+  resolved "https://registry.yarnpkg.com/sourcemap-codec/-/sourcemap-codec-1.4.1.tgz#c8fd92d91889e902a07aee392bdd2c5863958ba2"
+
+split-string@^3.0.1, split-string@^3.0.2:
+  version "3.1.0"
+  resolved "https://registry.yarnpkg.com/split-string/-/split-string-3.1.0.tgz#7cb09dda3a86585705c64b39a6466038682e8fe2"
+  integrity sha512-NzNVhJDYpwceVVii8/Hu6DKfD2G+NrQHlS/V/qgv763EYudVwEcMQNxd2lh+0VrUByXN/oJkl5grOhYWvQUYiw==
+  dependencies:
+    extend-shallow "^3.0.0"
+
+sprintf-js@~1.0.2:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/sprintf-js/-/sprintf-js-1.0.3.tgz#04e6926f662895354f3dd015203633b857297e2c"
+  integrity sha1-BOaSb2YolTVPPdAVIDYzuFcpfiw=
+
+static-extend@^0.1.1:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/static-extend/-/static-extend-0.1.2.tgz#60809c39cbff55337226fd5e0b520f341f1fb5c6"
+  integrity sha1-YICcOcv/VTNyJv1eC1IPNB8ftcY=
+  dependencies:
+    define-property "^0.2.5"
+    object-copy "^0.1.0"
+
+"string-width@^1.0.2 || 2":
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/string-width/-/string-width-2.1.1.tgz#ab93f27a8dc13d28cac815c462143a6d9012ae9e"
+  integrity sha512-nOqH59deCq9SRHlxq1Aw85Jnt4w6KvLKqWVik6oA9ZklXLNIOlqg4F2yrT1MVaTjAqvVwdfeZ7w7aCvJD7ugkw==
+  dependencies:
+    is-fullwidth-code-point "^2.0.0"
+    strip-ansi "^4.0.0"
+
+string-width@^3.0.0, string-width@^3.1.0:
+  version "3.1.0"
+  resolved "https://registry.yarnpkg.com/string-width/-/string-width-3.1.0.tgz#22767be21b62af1081574306f69ac51b62203961"
+  integrity sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==
+  dependencies:
+    emoji-regex "^7.0.1"
+    is-fullwidth-code-point "^2.0.0"
+    strip-ansi "^5.1.0"
+
+string_decoder@~1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/string_decoder/-/string_decoder-1.1.1.tgz#9cf1611ba62685d7030ae9e4ba34149c3af03fc8"
+  integrity sha512-n/ShnvDi6FHbbVfviro+WojiFzv+s8MPMHBczVePfUpDJLwoLT0ht1l4YwBCbi8pJAveEEdnkHyPyTP/mzRfwg==
+  dependencies:
+    safe-buffer "~5.1.0"
+
+strip-ansi@^3.0.0:
+  version "3.0.1"
+  resolved "https://registry.yarnpkg.com/strip-ansi/-/strip-ansi-3.0.1.tgz#6a385fb8853d952d5ff05d0e8aaf94278dc63dcf"
+  integrity sha1-ajhfuIU9lS1f8F0Oiq+UJ43GPc8=
+  dependencies:
+    ansi-regex "^2.0.0"
+
+strip-ansi@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/strip-ansi/-/strip-ansi-4.0.0.tgz#a8479022eb1ac368a871389b635262c505ee368f"
+  integrity sha1-qEeQIusaw2iocTibY1JixQXuNo8=
+  dependencies:
+    ansi-regex "^3.0.0"
+
+strip-ansi@^5.0.0, strip-ansi@^5.1.0, strip-ansi@^5.2.0:
+  version "5.2.0"
+  resolved "https://registry.yarnpkg.com/strip-ansi/-/strip-ansi-5.2.0.tgz#8c9a536feb6afc962bdfa5b104a5091c1ad9c0ae"
+  integrity sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==
+  dependencies:
+    ansi-regex "^4.1.0"
+
+strip-json-comments@3.1.1:
+  version "3.1.1"
+  resolved "https://registry.yarnpkg.com/strip-json-comments/-/strip-json-comments-3.1.1.tgz#31f1281b3832630434831c310c01cccda8cbe006"
+  integrity sha512-6fPc+R4ihwqP6N/aIv2f1gMH8lOVtWQHoqC4yK6oSDVVocumAsfCqjkXnqiYMhmMwS/mEHLp7Vehlt3ql6lEig==
+
+supports-color@7.2.0, supports-color@^7.1.0:
+  version "7.2.0"
+  resolved "https://registry.yarnpkg.com/supports-color/-/supports-color-7.2.0.tgz#1b7dcdcb32b8138801b3e478ba6a51caa89648da"
+  integrity sha512-qpCAvRl9stuOHveKsn7HncJRvv501qIacKzQlO/+Lwxc9+0q2wLyv4Dfvt80/DPn2pqOBsJdDiogXGR9+OvwRw==
+  dependencies:
+    has-flag "^4.0.0"
+
+supports-color@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/supports-color/-/supports-color-2.0.0.tgz#535d045ce6b6363fa40117084629995e9df324c7"
+  integrity sha1-U10EXOa2Nj+kARcIRimZXp3zJMc=
+
+to-fast-properties@^1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/to-fast-properties/-/to-fast-properties-1.0.3.tgz#b83571fa4d8c25b82e231b06e3a3055de4ca1a47"
+  integrity sha1-uDVx+k2MJbguIxsG46MFXeTKGkc=
+
+to-object-path@^0.3.0:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/to-object-path/-/to-object-path-0.3.0.tgz#297588b7b0e7e0ac08e04e672f85c1f4999e17af"
+  integrity sha1-KXWIt7Dn4KwI4E5nL4XB9JmeF68=
+  dependencies:
+    kind-of "^3.0.2"
+
+to-regex-range@^2.1.0:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/to-regex-range/-/to-regex-range-2.1.1.tgz#7c80c17b9dfebe599e27367e0d4dd5590141db38"
+  integrity sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=
+  dependencies:
+    is-number "^3.0.0"
+    repeat-string "^1.6.1"
+
+to-regex-range@^5.0.1:
+  version "5.0.1"
+  resolved "https://registry.yarnpkg.com/to-regex-range/-/to-regex-range-5.0.1.tgz#1648c44aae7c8d988a326018ed72f5b4dd0392e4"
+  integrity sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==
+  dependencies:
+    is-number "^7.0.0"
+
+to-regex@^3.0.1, to-regex@^3.0.2:
+  version "3.0.2"
+  resolved "https://registry.yarnpkg.com/to-regex/-/to-regex-3.0.2.tgz#13cfdd9b336552f30b51f33a8ae1b42a7a7599ce"
+  integrity sha512-FWtleNAtZ/Ki2qtqej2CXTOayOH9bHDQF+Q48VpWyDXjbYxA4Yz8iDB31zXOBUlOHHKidDbqGVrTUvQMPmBGBw==
+  dependencies:
+    define-property "^2.0.2"
+    extend-shallow "^3.0.2"
+    regex-not "^1.0.2"
+    safe-regex "^1.1.0"
+
+trim-right@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/trim-right/-/trim-right-1.0.1.tgz#cb2e1203067e0c8de1f614094b9fe45704ea6003"
+  integrity sha1-yy4SAwZ+DI3h9hQJS5/kVwTqYAM=
+
+typescript@^2.8.1:
+  version "2.8.1"
+  resolved "https://registry.yarnpkg.com/typescript/-/typescript-2.8.1.tgz#6160e4f8f195d5ba81d4876f9c0cc1fbc0820624"
+
+uglify-js@^2.8.14:
+  version "2.8.29"
+  resolved "https://registry.yarnpkg.com/uglify-js/-/uglify-js-2.8.29.tgz#29c5733148057bb4e1f75df35b7a9cb72e6a59dd"
+  dependencies:
+    source-map "~0.5.1"
+    yargs "~3.10.0"
+  optionalDependencies:
+    uglify-to-browserify "~1.0.0"
+
+uglify-to-browserify@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/uglify-to-browserify/-/uglify-to-browserify-1.0.2.tgz#6e0924d6bda6b5afe349e39a6d632850a0f882b7"
+
+union-value@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/union-value/-/union-value-1.0.1.tgz#0b6fe7b835aecda61c6ea4d4f02c14221e109847"
+  integrity sha512-tJfXmxMeWYnczCVs7XAEvIV7ieppALdyepWMkHkwciRpZraG/xwT+s2JN8+pr1+8jCRf80FFzvr+MpQeeoF4Xg==
+  dependencies:
+    arr-union "^3.1.0"
+    get-value "^2.0.6"
+    is-extendable "^0.1.1"
+    set-value "^2.0.1"
+
+unset-value@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/unset-value/-/unset-value-1.0.0.tgz#8376873f7d2335179ffb1e6fc3a8ed0dfc8ab559"
+  integrity sha1-g3aHP30jNRef+x5vw6jtDfyKtVk=
+  dependencies:
+    has-value "^0.3.1"
+    isobject "^3.0.0"
+
+urix@^0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/urix/-/urix-0.1.0.tgz#da937f7a62e21fec1fd18d49b35c2935067a6c72"
+  integrity sha1-2pN/emLiH+wf0Y1Js1wpNQZ6bHI=
+
+use@^3.1.0:
+  version "3.1.1"
+  resolved "https://registry.yarnpkg.com/use/-/use-3.1.1.tgz#d50c8cac79a19fbc20f2911f56eb973f4e10070f"
+  integrity sha512-cwESVXlO3url9YWlFW/TA9cshCEhtu7IKJ/p5soJ/gGpj7vbvFrAY/eIioQ6Dw23KjZhYgiIo8HOs1nQ2vr/oQ==
+
+user-home@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/user-home/-/user-home-1.1.1.tgz#2b5be23a32b63a7c9deb8d0f28d485724a3df190"
+  integrity sha1-K1viOjK2Onyd640PKNSFcko98ZA=
+
+util-deprecate@~1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/util-deprecate/-/util-deprecate-1.0.2.tgz#450d4dc9fa70de732762fbd2d4a28981419a0ccf"
+  integrity sha1-RQ1Nyfpw3nMnYvvS1KKJgUGaDM8=
+
+v8flags@^2.1.1:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/v8flags/-/v8flags-2.1.1.tgz#aab1a1fa30d45f88dd321148875ac02c0b55e5b4"
+  integrity sha1-qrGh+jDUX4jdMhFIh1rALAtV5bQ=
+  dependencies:
+    user-home "^1.1.1"
+
+which-module@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/which-module/-/which-module-2.0.0.tgz#d9ef07dce77b9902b8a3a8fa4b31c3e3f7e6e87a"
+  integrity sha1-2e8H3Od7mQK4o6j6SzHD4/fm6Ho=
+
+which@2.0.2:
+  version "2.0.2"
+  resolved "https://registry.yarnpkg.com/which/-/which-2.0.2.tgz#7c6a8dd0a636a0327e10b59c9286eee93f3f51b1"
+  integrity sha512-BLI3Tl1TW3Pvl70l3yq3Y64i+awpwXqsGBYWkkqMtnbXgrMD+yj7rhW0kuEDxzJaYXGjEW5ogapKNMEKNMjibA==
+  dependencies:
+    isexe "^2.0.0"
+
+wide-align@1.1.3:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/wide-align/-/wide-align-1.1.3.tgz#ae074e6bdc0c14a431e804e624549c633b000457"
+  integrity sha512-QGkOQc8XL6Bt5PwnsExKBPuMKBxnGxWWW3fU55Xt4feHozMUhdUMaBCk290qpm/wG5u/RSKzwdAC4i51YigihA==
+  dependencies:
+    string-width "^1.0.2 || 2"
+
+window-size@0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/window-size/-/window-size-0.1.0.tgz#5438cd2ea93b202efa3a19fe8887aee7c94f9c9d"
+
+wordwrap@0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/wordwrap/-/wordwrap-0.0.2.tgz#b79669bb42ecb409f83d583cad52ca17eaa1643f"
+
+workerpool@6.0.2:
+  version "6.0.2"
+  resolved "https://registry.yarnpkg.com/workerpool/-/workerpool-6.0.2.tgz#e241b43d8d033f1beb52c7851069456039d1d438"
+  integrity sha512-DSNyvOpFKrNusaaUwk+ej6cBj1bmhLcBfj80elGk+ZIo5JSkq+unB1dLKEOcNfJDZgjGICfhQ0Q5TbP0PvF4+Q==
+
+wrap-ansi@^5.1.0:
+  version "5.1.0"
+  resolved "https://registry.yarnpkg.com/wrap-ansi/-/wrap-ansi-5.1.0.tgz#1fd1f67235d5b6d0fee781056001bfb694c03b09"
+  integrity sha512-QC1/iN/2/RPVJ5jYK8BGttj5z83LmSKmvbvrXPNCLZSEb32KKVDJDl/MOt2N01qU2H/FkzEa9PKto1BqDjtd7Q==
+  dependencies:
+    ansi-styles "^3.2.0"
+    string-width "^3.0.0"
+    strip-ansi "^5.0.0"
+
+wrappy@1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/wrappy/-/wrappy-1.0.2.tgz#b5243d8f3ec1aa35f1364605bc0d1036e30ab69f"
+  integrity sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=
+
+y18n@^4.0.0:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/y18n/-/y18n-4.0.1.tgz#8db2b83c31c5d75099bb890b23f3094891e247d4"
+  integrity sha512-wNcy4NvjMYL8gogWWYAO7ZFWFfHcbdbE57tZO8e4cbpj8tfUcwrwqSl3ad8HxpYWCdXcJUCeKKZS62Av1affwQ==
+
+yargs-parser@13.1.2, yargs-parser@^13.1.2:
+  version "13.1.2"
+  resolved "https://registry.yarnpkg.com/yargs-parser/-/yargs-parser-13.1.2.tgz#130f09702ebaeef2650d54ce6e3e5706f7a4fb38"
+  integrity sha512-3lbsNRf/j+A4QuSZfDRA7HRSfWrzO0YjqTJd5kjAq37Zep1CEgaYmrH9Q3GwPiB9cHyd1Y1UwggGhJGoxipbzg==
+  dependencies:
+    camelcase "^5.0.0"
+    decamelize "^1.2.0"
+
+yargs-unparser@2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/yargs-unparser/-/yargs-unparser-2.0.0.tgz#f131f9226911ae5d9ad38c432fe809366c2325eb"
+  integrity sha512-7pRTIA9Qc1caZ0bZ6RYRGbHJthJWuakf+WmHK0rVeLkNrrGhfoabBNdue6kdINI6r4if7ocq9aD/n7xwKOdzOA==
+  dependencies:
+    camelcase "^6.0.0"
+    decamelize "^4.0.0"
+    flat "^5.0.2"
+    is-plain-obj "^2.1.0"
+
+yargs@13.3.2:
+  version "13.3.2"
+  resolved "https://registry.yarnpkg.com/yargs/-/yargs-13.3.2.tgz#ad7ffefec1aa59565ac915f82dccb38a9c31a2dd"
+  integrity sha512-AX3Zw5iPruN5ie6xGRIDgqkT+ZhnRlZMLMHAs8tg7nRruy2Nb+i5o9bwghAogtM08q1dpr2LVoS8KSTMYpWXUw==
+  dependencies:
+    cliui "^5.0.0"
+    find-up "^3.0.0"
+    get-caller-file "^2.0.1"
+    require-directory "^2.1.1"
+    require-main-filename "^2.0.0"
+    set-blocking "^2.0.0"
+    string-width "^3.0.0"
+    which-module "^2.0.0"
+    y18n "^4.0.0"
+    yargs-parser "^13.1.2"
+
+yargs@~3.10.0:
+  version "3.10.0"
+  resolved "https://registry.yarnpkg.com/yargs/-/yargs-3.10.0.tgz#f7ee7bd857dd7c1d2d38c0e74efbd681d1431fd1"
+  dependencies:
+    camelcase "^1.0.2"
+    cliui "^2.1.0"
+    decamelize "^1.0.0"
+    window-size "0.1.0"
+
+yocto-queue@^0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/yocto-queue/-/yocto-queue-0.1.0.tgz#0294eb3dee05028d31ee1a5fa2c556a6aaf10a1b"
+  integrity sha512-rVksvsnNCdJ/ohGc6xgPwyN8eheCxsiLM8mxuE/t/mOVqJewPuO1miLpTHQiRgTKCLexL4MeAFVagts7HmNZ2Q==
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/LICENSE b/node_modules/mathjs/examples/node_modules/watchpack/LICENSE
new file mode 100644
index 0000000..8c11fc7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/LICENSE
@@ -0,0 +1,20 @@
+Copyright JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/README.md b/node_modules/mathjs/examples/node_modules/watchpack/README.md
new file mode 100644
index 0000000..2924722
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/README.md
@@ -0,0 +1,149 @@
+# watchpack
+
+Wrapper library for directory and file watching.
+
+[![Build Status][build-status]][build-status-url]
+[![Build status][build-status-veyor]][build-status-veyor-url]
+[![Test coverage][coveralls-image]][coveralls-url]
+[![codecov][codecov]][codecov-url]
+[![downloads][downloads]][downloads-url]
+[![Github contributors][contributors]][contributors-url]
+
+## Concept
+
+watchpack high level API doesn't map directly to watchers. Instead a three level architecture ensures that for each directory only a single watcher exists.
+
+- The high level API requests `DirectoryWatchers` from a `WatcherManager`, which ensures that only a single `DirectoryWatcher` per directory is created.
+- A user-faced `Watcher` can be obtained from a `DirectoryWatcher` and provides a filtered view on the `DirectoryWatcher`.
+- Reference-counting is used on the `DirectoryWatcher` and `Watcher` to decide when to close them.
+- The real watchers are created by the `DirectoryWatcher`.
+- Files are never watched directly. This should keep the watcher count low.
+- Watching can be started in the past. This way watching can start after file reading.
+- Symlinks are not followed, instead the symlink is watched.
+
+## API
+
+```javascript
+var Watchpack = require("watchpack");
+
+var wp = new Watchpack({
+	// options:
+	aggregateTimeout: 1000,
+	// fire "aggregated" event when after a change for 1000ms no additional change occurred
+	// aggregated defaults to undefined, which doesn't fire an "aggregated" event
+
+	poll: true,
+	// poll: true - use polling with the default interval
+	// poll: 10000 - use polling with an interval of 10s
+	// poll defaults to undefined, which prefer native watching methods
+	// Note: enable polling when watching on a network path
+	// When WATCHPACK_POLLING environment variable is set it will override this option
+
+	followSymlinks: true,
+	// true: follows symlinks and watches symlinks and real files
+	//   (This makes sense when symlinks has not been resolved yet, comes with a performance hit)
+	// false (default): watches only specified item they may be real files or symlinks
+	//   (This makes sense when symlinks has already been resolved)
+
+	ignored: "**/.git"
+	// ignored: "string" - a glob pattern for files or folders that should not be watched
+	// ignored: ["string", "string"] - multiple glob patterns that should be ignored
+	// ignored: /regexp/ - a regular expression for files or folders that should not be watched
+	// ignored: (entry) => boolean - an arbitrary function which must return truthy to ignore an entry
+	// For all cases expect the arbitrary function the path will have path separator normalized to '/'.
+	// All subdirectories are ignored too
+});
+
+// Watchpack.prototype.watch({
+//   files: Iterable<string>,
+//   directories: Iterable<string>,
+//   missing: Iterable<string>,
+//   startTime?: number
+// })
+wp.watch({
+	files: listOfFiles,
+	directories: listOfDirectories,
+	missing: listOfNotExistingItems,
+	startTime: Date.now() - 10000
+});
+// starts watching these files and directories
+// calling this again will override the files and directories
+// files: can be files or directories, for files: content and existence changes are tracked
+//        for directories: only existence and timestamp changes are tracked
+// directories: only directories, directory content (and content of children, ...) and
+//              existence changes are tracked.
+//              assumed to exist, when directory is not found without further information a remove event is emitted
+// missing: can be files or directorees,
+//          only existence changes are tracked
+//          expected to not exist, no remove event is emitted when not found initially
+// files and directories are assumed to exist, when they are not found without further information a remove event is emitted
+// missing is assumed to not exist and no remove event is emitted
+
+wp.on("change", function(filePath, mtime, explanation) {
+	// filePath: the changed file
+	// mtime: last modified time for the changed file
+	// explanation: textual information how this change was detected
+});
+
+wp.on("remove", function(filePath, explanation) {
+	// filePath: the removed file or directory
+	// explanation: textual information how this change was detected
+});
+
+wp.on("aggregated", function(changes, removals) {
+	// changes: a Set of all changed files
+	// removals: a Set of all removed files
+	// watchpack gives up ownership on these Sets.
+});
+
+// Watchpack.prototype.pause()
+wp.pause();
+// stops emitting events, but keeps watchers open
+// next "watch" call can reuse the watchers
+// The watcher will keep aggregating events
+// which can be received with getAggregated()
+
+// Watchpack.prototype.close()
+wp.close();
+// stops emitting events and closes all watchers
+
+// Watchpack.prototype.getAggregated(): { changes: Set<string>, removals: Set<string> }
+const { changes, removals } = wp.getAggregated();
+// returns the current aggregated info and removes that from the watcher
+// The next aggregated event won't include that info and will only emitted
+// when futher changes happen
+// Can also be used when paused.
+
+// Watchpack.prototype.collectTimeInfoEntries(fileInfoEntries: Map<string, Entry>, directoryInfoEntries: Map<string, Entry>)
+wp.collectTimeInfoEntries(fileInfoEntries, directoryInfoEntries);
+// collects time info objects for all known files and directories
+// this include info from files not directly watched
+// key: absolute path, value: object with { safeTime, timestamp }
+// safeTime: a point in time at which it is safe to say all changes happened before that
+// timestamp: only for files, the mtime timestamp of the file
+
+// Watchpack.prototype.getTimeInfoEntries()
+var fileTimes = wp.getTimeInfoEntries();
+// returns a Map with all known time info objects for files and directories
+// similar to collectTimeInfoEntries but returns a single map with all entries
+
+// (deprecated)
+// Watchpack.prototype.getTimes()
+var fileTimes = wp.getTimes();
+// returns an object with all known change times for files
+// this include timestamps from files not directly watched
+// key: absolute path, value: timestamp as number
+```
+
+[build-status]: https://travis-ci.org/webpack/watchpack.svg?branch=main
+[build-status-url]: https://travis-ci.org/webpack/watchpack
+[build-status-veyor]: https://ci.appveyor.com/api/projects/status/e5u2qvmugtv0r647/branch/main?svg=true
+[build-status-veyor-url]: https://ci.appveyor.com/project/sokra/watchpack/branch/main
+[coveralls-url]: https://coveralls.io/r/webpack/watchpack/
+[coveralls-image]: https://img.shields.io/coveralls/webpack/watchpack.svg
+[codecov]: https://codecov.io/gh/webpack/watchpack/branch/main/graph/badge.svg
+[codecov-url]: https://codecov.io/gh/webpack/watchpack
+[downloads]: https://img.shields.io/npm/dm/watchpack.svg
+[downloads-url]: https://www.npmjs.com/package/watchpack
+[contributors]: https://img.shields.io/github/contributors/webpack/watchpack.svg
+[contributors-url]: https://github.com/webpack/watchpack/graphs/contributors
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/lib/DirectoryWatcher.js b/node_modules/mathjs/examples/node_modules/watchpack/lib/DirectoryWatcher.js
new file mode 100644
index 0000000..5cf3a47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/lib/DirectoryWatcher.js
@@ -0,0 +1,785 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const EventEmitter = require("events").EventEmitter;
+const fs = require("graceful-fs");
+const path = require("path");
+
+const watchEventSource = require("./watchEventSource");
+
+const EXISTANCE_ONLY_TIME_ENTRY = Object.freeze({});
+
+let FS_ACCURACY = 1000;
+
+const IS_OSX = require("os").platform() === "darwin";
+const WATCHPACK_POLLING = process.env.WATCHPACK_POLLING;
+const FORCE_POLLING =
+	`${+WATCHPACK_POLLING}` === WATCHPACK_POLLING
+		? +WATCHPACK_POLLING
+		: !!WATCHPACK_POLLING && WATCHPACK_POLLING !== "false";
+
+function withoutCase(str) {
+	return str.toLowerCase();
+}
+
+function needCalls(times, callback) {
+	return function() {
+		if (--times === 0) {
+			return callback();
+		}
+	};
+}
+
+class Watcher extends EventEmitter {
+	constructor(directoryWatcher, filePath, startTime) {
+		super();
+		this.directoryWatcher = directoryWatcher;
+		this.path = filePath;
+		this.startTime = startTime && +startTime;
+	}
+
+	checkStartTime(mtime, initial) {
+		const startTime = this.startTime;
+		if (typeof startTime !== "number") return !initial;
+		return startTime <= mtime;
+	}
+
+	close() {
+		this.emit("closed");
+	}
+}
+
+class DirectoryWatcher extends EventEmitter {
+	constructor(watcherManager, directoryPath, options) {
+		super();
+		if (FORCE_POLLING) {
+			options.poll = FORCE_POLLING;
+		}
+		this.watcherManager = watcherManager;
+		this.options = options;
+		this.path = directoryPath;
+		// safeTime is the point in time after which reading is safe to be unchanged
+		// timestamp is a value that should be compared with another timestamp (mtime)
+		/** @type {Map<string, { safeTime: number, timestamp: number }} */
+		this.files = new Map();
+		/** @type {Map<string, number>} */
+		this.filesWithoutCase = new Map();
+		this.directories = new Map();
+		this.lastWatchEvent = 0;
+		this.initialScan = true;
+		this.ignored = options.ignored || (() => false);
+		this.nestedWatching = false;
+		this.polledWatching =
+			typeof options.poll === "number"
+				? options.poll
+				: options.poll
+				? 5007
+				: false;
+		this.timeout = undefined;
+		this.initialScanRemoved = new Set();
+		this.initialScanFinished = undefined;
+		/** @type {Map<string, Set<Watcher>>} */
+		this.watchers = new Map();
+		this.parentWatcher = null;
+		this.refs = 0;
+		this._activeEvents = new Map();
+		this.closed = false;
+		this.scanning = false;
+		this.scanAgain = false;
+		this.scanAgainInitial = false;
+
+		this.createWatcher();
+		this.doScan(true);
+	}
+
+	createWatcher() {
+		try {
+			if (this.polledWatching) {
+				this.watcher = {
+					close: () => {
+						if (this.timeout) {
+							clearTimeout(this.timeout);
+							this.timeout = undefined;
+						}
+					}
+				};
+			} else {
+				if (IS_OSX) {
+					this.watchInParentDirectory();
+				}
+				this.watcher = watchEventSource.watch(this.path);
+				this.watcher.on("change", this.onWatchEvent.bind(this));
+				this.watcher.on("error", this.onWatcherError.bind(this));
+			}
+		} catch (err) {
+			this.onWatcherError(err);
+		}
+	}
+
+	forEachWatcher(path, fn) {
+		const watchers = this.watchers.get(withoutCase(path));
+		if (watchers !== undefined) {
+			for (const w of watchers) {
+				fn(w);
+			}
+		}
+	}
+
+	setMissing(itemPath, initial, type) {
+		if (this.initialScan) {
+			this.initialScanRemoved.add(itemPath);
+		}
+
+		const oldDirectory = this.directories.get(itemPath);
+		if (oldDirectory) {
+			if (this.nestedWatching) oldDirectory.close();
+			this.directories.delete(itemPath);
+
+			this.forEachWatcher(itemPath, w => w.emit("remove", type));
+			if (!initial) {
+				this.forEachWatcher(this.path, w =>
+					w.emit("change", itemPath, null, type, initial)
+				);
+			}
+		}
+
+		const oldFile = this.files.get(itemPath);
+		if (oldFile) {
+			this.files.delete(itemPath);
+			const key = withoutCase(itemPath);
+			const count = this.filesWithoutCase.get(key) - 1;
+			if (count <= 0) {
+				this.filesWithoutCase.delete(key);
+				this.forEachWatcher(itemPath, w => w.emit("remove", type));
+			} else {
+				this.filesWithoutCase.set(key, count);
+			}
+
+			if (!initial) {
+				this.forEachWatcher(this.path, w =>
+					w.emit("change", itemPath, null, type, initial)
+				);
+			}
+		}
+	}
+
+	setFileTime(filePath, mtime, initial, ignoreWhenEqual, type) {
+		const now = Date.now();
+
+		if (this.ignored(filePath)) return;
+
+		const old = this.files.get(filePath);
+
+		let safeTime, accuracy;
+		if (initial) {
+			safeTime = Math.min(now, mtime) + FS_ACCURACY;
+			accuracy = FS_ACCURACY;
+		} else {
+			safeTime = now;
+			accuracy = 0;
+
+			if (old && old.timestamp === mtime && mtime + FS_ACCURACY < now - 1000) {
+				// We are sure that mtime is untouched
+				// This can be caused by some file attribute change
+				// e. g. when access time has been changed
+				// but the file content is untouched
+				return;
+			}
+		}
+
+		if (ignoreWhenEqual && old && old.timestamp === mtime) return;
+
+		this.files.set(filePath, {
+			safeTime,
+			accuracy,
+			timestamp: mtime
+		});
+
+		if (!old) {
+			const key = withoutCase(filePath);
+			const count = this.filesWithoutCase.get(key);
+			this.filesWithoutCase.set(key, (count || 0) + 1);
+			if (count !== undefined) {
+				// There is already a file with case-insensitive-equal name
+				// On a case-insensitive filesystem we may miss the renaming
+				// when only casing is changed.
+				// To be sure that our information is correct
+				// we trigger a rescan here
+				this.doScan(false);
+			}
+
+			this.forEachWatcher(filePath, w => {
+				if (!initial || w.checkStartTime(safeTime, initial)) {
+					w.emit("change", mtime, type);
+				}
+			});
+		} else if (!initial) {
+			this.forEachWatcher(filePath, w => w.emit("change", mtime, type));
+		}
+		this.forEachWatcher(this.path, w => {
+			if (!initial || w.checkStartTime(safeTime, initial)) {
+				w.emit("change", filePath, safeTime, type, initial);
+			}
+		});
+	}
+
+	setDirectory(directoryPath, birthtime, initial, type) {
+		if (this.ignored(directoryPath)) return;
+		if (directoryPath === this.path) {
+			if (!initial) {
+				this.forEachWatcher(this.path, w =>
+					w.emit("change", directoryPath, birthtime, type, initial)
+				);
+			}
+		} else {
+			const old = this.directories.get(directoryPath);
+			if (!old) {
+				const now = Date.now();
+
+				if (this.nestedWatching) {
+					this.createNestedWatcher(directoryPath);
+				} else {
+					this.directories.set(directoryPath, true);
+				}
+
+				let safeTime;
+				if (initial) {
+					safeTime = Math.min(now, birthtime) + FS_ACCURACY;
+				} else {
+					safeTime = now;
+				}
+
+				this.forEachWatcher(directoryPath, w => {
+					if (!initial || w.checkStartTime(safeTime, false)) {
+						w.emit("change", birthtime, type);
+					}
+				});
+				this.forEachWatcher(this.path, w => {
+					if (!initial || w.checkStartTime(safeTime, initial)) {
+						w.emit("change", directoryPath, safeTime, type, initial);
+					}
+				});
+			}
+		}
+	}
+
+	createNestedWatcher(directoryPath) {
+		const watcher = this.watcherManager.watchDirectory(directoryPath, 1);
+		watcher.on("change", (filePath, mtime, type, initial) => {
+			this.forEachWatcher(this.path, w => {
+				if (!initial || w.checkStartTime(mtime, initial)) {
+					w.emit("change", filePath, mtime, type, initial);
+				}
+			});
+		});
+		this.directories.set(directoryPath, watcher);
+	}
+
+	setNestedWatching(flag) {
+		if (this.nestedWatching !== !!flag) {
+			this.nestedWatching = !!flag;
+			if (this.nestedWatching) {
+				for (const directory of this.directories.keys()) {
+					this.createNestedWatcher(directory);
+				}
+			} else {
+				for (const [directory, watcher] of this.directories) {
+					watcher.close();
+					this.directories.set(directory, true);
+				}
+			}
+		}
+	}
+
+	watch(filePath, startTime) {
+		const key = withoutCase(filePath);
+		let watchers = this.watchers.get(key);
+		if (watchers === undefined) {
+			watchers = new Set();
+			this.watchers.set(key, watchers);
+		}
+		this.refs++;
+		const watcher = new Watcher(this, filePath, startTime);
+		watcher.on("closed", () => {
+			if (--this.refs <= 0) {
+				this.close();
+				return;
+			}
+			watchers.delete(watcher);
+			if (watchers.size === 0) {
+				this.watchers.delete(key);
+				if (this.path === filePath) this.setNestedWatching(false);
+			}
+		});
+		watchers.add(watcher);
+		let safeTime;
+		if (filePath === this.path) {
+			this.setNestedWatching(true);
+			safeTime = this.lastWatchEvent;
+			for (const entry of this.files.values()) {
+				fixupEntryAccuracy(entry);
+				safeTime = Math.max(safeTime, entry.safeTime);
+			}
+		} else {
+			const entry = this.files.get(filePath);
+			if (entry) {
+				fixupEntryAccuracy(entry);
+				safeTime = entry.safeTime;
+			} else {
+				safeTime = 0;
+			}
+		}
+		if (safeTime) {
+			if (safeTime >= startTime) {
+				process.nextTick(() => {
+					if (this.closed) return;
+					if (filePath === this.path) {
+						watcher.emit(
+							"change",
+							filePath,
+							safeTime,
+							"watch (outdated on attach)",
+							true
+						);
+					} else {
+						watcher.emit(
+							"change",
+							safeTime,
+							"watch (outdated on attach)",
+							true
+						);
+					}
+				});
+			}
+		} else if (this.initialScan) {
+			if (this.initialScanRemoved.has(filePath)) {
+				process.nextTick(() => {
+					if (this.closed) return;
+					watcher.emit("remove");
+				});
+			}
+		} else if (
+			!this.directories.has(filePath) &&
+			watcher.checkStartTime(this.initialScanFinished, false)
+		) {
+			process.nextTick(() => {
+				if (this.closed) return;
+				watcher.emit("initial-missing", "watch (missing on attach)");
+			});
+		}
+		return watcher;
+	}
+
+	onWatchEvent(eventType, filename) {
+		if (this.closed) return;
+		if (!filename) {
+			// In some cases no filename is provided
+			// This seem to happen on windows
+			// So some event happened but we don't know which file is affected
+			// We have to do a full scan of the directory
+			this.doScan(false);
+			return;
+		}
+
+		const filePath = path.join(this.path, filename);
+		if (this.ignored(filePath)) return;
+
+		if (this._activeEvents.get(filename) === undefined) {
+			this._activeEvents.set(filename, false);
+			const checkStats = () => {
+				if (this.closed) return;
+				this._activeEvents.set(filename, false);
+				fs.lstat(filePath, (err, stats) => {
+					if (this.closed) return;
+					if (this._activeEvents.get(filename) === true) {
+						process.nextTick(checkStats);
+						return;
+					}
+					this._activeEvents.delete(filename);
+					// ENOENT happens when the file/directory doesn't exist
+					// EPERM happens when the containing directory doesn't exist
+					if (err) {
+						if (
+							err.code !== "ENOENT" &&
+							err.code !== "EPERM" &&
+							err.code !== "EBUSY"
+						) {
+							this.onStatsError(err);
+						} else {
+							if (filename === path.basename(this.path)) {
+								// This may indicate that the directory itself was removed
+								if (!fs.existsSync(this.path)) {
+									this.onDirectoryRemoved("stat failed");
+								}
+							}
+						}
+					}
+					this.lastWatchEvent = Date.now();
+					if (!stats) {
+						this.setMissing(filePath, false, eventType);
+					} else if (stats.isDirectory()) {
+						this.setDirectory(
+							filePath,
+							+stats.birthtime || 1,
+							false,
+							eventType
+						);
+					} else if (stats.isFile() || stats.isSymbolicLink()) {
+						if (stats.mtime) {
+							ensureFsAccuracy(stats.mtime);
+						}
+						this.setFileTime(
+							filePath,
+							+stats.mtime || +stats.ctime || 1,
+							false,
+							false,
+							eventType
+						);
+					}
+				});
+			};
+			process.nextTick(checkStats);
+		} else {
+			this._activeEvents.set(filename, true);
+		}
+	}
+
+	onWatcherError(err) {
+		if (this.closed) return;
+		if (err) {
+			if (err.code !== "EPERM" && err.code !== "ENOENT") {
+				console.error("Watchpack Error (watcher): " + err);
+			}
+			this.onDirectoryRemoved("watch error");
+		}
+	}
+
+	onStatsError(err) {
+		if (err) {
+			console.error("Watchpack Error (stats): " + err);
+		}
+	}
+
+	onScanError(err) {
+		if (err) {
+			console.error("Watchpack Error (initial scan): " + err);
+		}
+		this.onScanFinished();
+	}
+
+	onScanFinished() {
+		if (this.polledWatching) {
+			this.timeout = setTimeout(() => {
+				if (this.closed) return;
+				this.doScan(false);
+			}, this.polledWatching);
+		}
+	}
+
+	onDirectoryRemoved(reason) {
+		if (this.watcher) {
+			this.watcher.close();
+			this.watcher = null;
+		}
+		this.watchInParentDirectory();
+		const type = `directory-removed (${reason})`;
+		for (const directory of this.directories.keys()) {
+			this.setMissing(directory, null, type);
+		}
+		for (const file of this.files.keys()) {
+			this.setMissing(file, null, type);
+		}
+	}
+
+	watchInParentDirectory() {
+		if (!this.parentWatcher) {
+			const parentDir = path.dirname(this.path);
+			// avoid watching in the root directory
+			// removing directories in the root directory is not supported
+			if (path.dirname(parentDir) === parentDir) return;
+
+			this.parentWatcher = this.watcherManager.watchFile(this.path, 1);
+			this.parentWatcher.on("change", (mtime, type) => {
+				if (this.closed) return;
+
+				// On non-osx platforms we don't need this watcher to detect
+				// directory removal, as an EPERM error indicates that
+				if ((!IS_OSX || this.polledWatching) && this.parentWatcher) {
+					this.parentWatcher.close();
+					this.parentWatcher = null;
+				}
+				// Try to create the watcher when parent directory is found
+				if (!this.watcher) {
+					this.createWatcher();
+					this.doScan(false);
+
+					// directory was created so we emit an event
+					this.forEachWatcher(this.path, w =>
+						w.emit("change", this.path, mtime, type, false)
+					);
+				}
+			});
+			this.parentWatcher.on("remove", () => {
+				this.onDirectoryRemoved("parent directory removed");
+			});
+		}
+	}
+
+	doScan(initial) {
+		if (this.scanning) {
+			if (this.scanAgain) {
+				if (!initial) this.scanAgainInitial = false;
+			} else {
+				this.scanAgain = true;
+				this.scanAgainInitial = initial;
+			}
+			return;
+		}
+		this.scanning = true;
+		if (this.timeout) {
+			clearTimeout(this.timeout);
+			this.timeout = undefined;
+		}
+		process.nextTick(() => {
+			if (this.closed) return;
+			fs.readdir(this.path, (err, items) => {
+				if (this.closed) return;
+				if (err) {
+					if (err.code === "ENOENT" || err.code === "EPERM") {
+						this.onDirectoryRemoved("scan readdir failed");
+					} else {
+						this.onScanError(err);
+					}
+					this.initialScan = false;
+					this.initialScanFinished = Date.now();
+					if (initial) {
+						for (const watchers of this.watchers.values()) {
+							for (const watcher of watchers) {
+								if (watcher.checkStartTime(this.initialScanFinished, false)) {
+									watcher.emit(
+										"initial-missing",
+										"scan (parent directory missing in initial scan)"
+									);
+								}
+							}
+						}
+					}
+					if (this.scanAgain) {
+						this.scanAgain = false;
+						this.doScan(this.scanAgainInitial);
+					} else {
+						this.scanning = false;
+					}
+					return;
+				}
+				const itemPaths = new Set(
+					items.map(item => path.join(this.path, item.normalize("NFC")))
+				);
+				for (const file of this.files.keys()) {
+					if (!itemPaths.has(file)) {
+						this.setMissing(file, initial, "scan (missing)");
+					}
+				}
+				for (const directory of this.directories.keys()) {
+					if (!itemPaths.has(directory)) {
+						this.setMissing(directory, initial, "scan (missing)");
+					}
+				}
+				if (this.scanAgain) {
+					// Early repeat of scan
+					this.scanAgain = false;
+					this.doScan(initial);
+					return;
+				}
+				const itemFinished = needCalls(itemPaths.size + 1, () => {
+					if (this.closed) return;
+					this.initialScan = false;
+					this.initialScanRemoved = null;
+					this.initialScanFinished = Date.now();
+					if (initial) {
+						const missingWatchers = new Map(this.watchers);
+						missingWatchers.delete(withoutCase(this.path));
+						for (const item of itemPaths) {
+							missingWatchers.delete(withoutCase(item));
+						}
+						for (const watchers of missingWatchers.values()) {
+							for (const watcher of watchers) {
+								if (watcher.checkStartTime(this.initialScanFinished, false)) {
+									watcher.emit(
+										"initial-missing",
+										"scan (missing in initial scan)"
+									);
+								}
+							}
+						}
+					}
+					if (this.scanAgain) {
+						this.scanAgain = false;
+						this.doScan(this.scanAgainInitial);
+					} else {
+						this.scanning = false;
+						this.onScanFinished();
+					}
+				});
+				for (const itemPath of itemPaths) {
+					fs.lstat(itemPath, (err2, stats) => {
+						if (this.closed) return;
+						if (err2) {
+							if (
+								err2.code === "ENOENT" ||
+								err2.code === "EPERM" ||
+								err2.code === "EACCES" ||
+								err2.code === "EBUSY"
+							) {
+								this.setMissing(itemPath, initial, "scan (" + err2.code + ")");
+							} else {
+								this.onScanError(err2);
+							}
+							itemFinished();
+							return;
+						}
+						if (stats.isFile() || stats.isSymbolicLink()) {
+							if (stats.mtime) {
+								ensureFsAccuracy(stats.mtime);
+							}
+							this.setFileTime(
+								itemPath,
+								+stats.mtime || +stats.ctime || 1,
+								initial,
+								true,
+								"scan (file)"
+							);
+						} else if (stats.isDirectory()) {
+							if (!initial || !this.directories.has(itemPath))
+								this.setDirectory(
+									itemPath,
+									+stats.birthtime || 1,
+									initial,
+									"scan (dir)"
+								);
+						}
+						itemFinished();
+					});
+				}
+				itemFinished();
+			});
+		});
+	}
+
+	getTimes() {
+		const obj = Object.create(null);
+		let safeTime = this.lastWatchEvent;
+		for (const [file, entry] of this.files) {
+			fixupEntryAccuracy(entry);
+			safeTime = Math.max(safeTime, entry.safeTime);
+			obj[file] = Math.max(entry.safeTime, entry.timestamp);
+		}
+		if (this.nestedWatching) {
+			for (const w of this.directories.values()) {
+				const times = w.directoryWatcher.getTimes();
+				for (const file of Object.keys(times)) {
+					const time = times[file];
+					safeTime = Math.max(safeTime, time);
+					obj[file] = time;
+				}
+			}
+			obj[this.path] = safeTime;
+		}
+		if (!this.initialScan) {
+			for (const watchers of this.watchers.values()) {
+				for (const watcher of watchers) {
+					const path = watcher.path;
+					if (!Object.prototype.hasOwnProperty.call(obj, path)) {
+						obj[path] = null;
+					}
+				}
+			}
+		}
+		return obj;
+	}
+
+	collectTimeInfoEntries(fileTimestamps, directoryTimestamps) {
+		let safeTime = this.lastWatchEvent;
+		for (const [file, entry] of this.files) {
+			fixupEntryAccuracy(entry);
+			safeTime = Math.max(safeTime, entry.safeTime);
+			fileTimestamps.set(file, entry);
+		}
+		if (this.nestedWatching) {
+			for (const w of this.directories.values()) {
+				safeTime = Math.max(
+					safeTime,
+					w.directoryWatcher.collectTimeInfoEntries(
+						fileTimestamps,
+						directoryTimestamps
+					)
+				);
+			}
+			fileTimestamps.set(this.path, EXISTANCE_ONLY_TIME_ENTRY);
+			directoryTimestamps.set(this.path, {
+				safeTime
+			});
+		} else {
+			for (const dir of this.directories.keys()) {
+				// No additional info about this directory
+				// but maybe another DirectoryWatcher has info
+				fileTimestamps.set(dir, EXISTANCE_ONLY_TIME_ENTRY);
+				if (!directoryTimestamps.has(dir))
+					directoryTimestamps.set(dir, EXISTANCE_ONLY_TIME_ENTRY);
+			}
+			fileTimestamps.set(this.path, EXISTANCE_ONLY_TIME_ENTRY);
+			directoryTimestamps.set(this.path, EXISTANCE_ONLY_TIME_ENTRY);
+		}
+		if (!this.initialScan) {
+			for (const watchers of this.watchers.values()) {
+				for (const watcher of watchers) {
+					const path = watcher.path;
+					if (!fileTimestamps.has(path)) {
+						fileTimestamps.set(path, null);
+					}
+				}
+			}
+		}
+		return safeTime;
+	}
+
+	close() {
+		this.closed = true;
+		this.initialScan = false;
+		if (this.watcher) {
+			this.watcher.close();
+			this.watcher = null;
+		}
+		if (this.nestedWatching) {
+			for (const w of this.directories.values()) {
+				w.close();
+			}
+			this.directories.clear();
+		}
+		if (this.parentWatcher) {
+			this.parentWatcher.close();
+			this.parentWatcher = null;
+		}
+		this.emit("closed");
+	}
+}
+
+module.exports = DirectoryWatcher;
+module.exports.EXISTANCE_ONLY_TIME_ENTRY = EXISTANCE_ONLY_TIME_ENTRY;
+
+function fixupEntryAccuracy(entry) {
+	if (entry.accuracy > FS_ACCURACY) {
+		entry.safeTime = entry.safeTime - entry.accuracy + FS_ACCURACY;
+		entry.accuracy = FS_ACCURACY;
+	}
+}
+
+function ensureFsAccuracy(mtime) {
+	if (!mtime) return;
+	if (FS_ACCURACY > 1 && mtime % 1 !== 0) FS_ACCURACY = 1;
+	else if (FS_ACCURACY > 10 && mtime % 10 !== 0) FS_ACCURACY = 10;
+	else if (FS_ACCURACY > 100 && mtime % 100 !== 0) FS_ACCURACY = 100;
+}
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/lib/LinkResolver.js b/node_modules/mathjs/examples/node_modules/watchpack/lib/LinkResolver.js
new file mode 100644
index 0000000..daea90b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/lib/LinkResolver.js
@@ -0,0 +1,107 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const fs = require("fs");
+const path = require("path");
+
+// macOS, Linux, and Windows all rely on these errors
+const EXPECTED_ERRORS = new Set(["EINVAL", "ENOENT"]);
+
+// On Windows there is also this error in some cases
+if (process.platform === "win32") EXPECTED_ERRORS.add("UNKNOWN");
+
+class LinkResolver {
+	constructor() {
+		this.cache = new Map();
+	}
+
+	/**
+	 * @param {string} file path to file or directory
+	 * @returns {string[]} array of file and all symlinks contributed in the resolving process (first item is the resolved file)
+	 */
+	resolve(file) {
+		const cacheEntry = this.cache.get(file);
+		if (cacheEntry !== undefined) {
+			return cacheEntry;
+		}
+		const parent = path.dirname(file);
+		if (parent === file) {
+			// At root of filesystem there can't be a link
+			const result = Object.freeze([file]);
+			this.cache.set(file, result);
+			return result;
+		}
+		// resolve the parent directory to find links there and get the real path
+		const parentResolved = this.resolve(parent);
+		let realFile = file;
+
+		// is the parent directory really somewhere else?
+		if (parentResolved[0] !== parent) {
+			// get the real location of file
+			const basename = path.basename(file);
+			realFile = path.resolve(parentResolved[0], basename);
+		}
+		// try to read the link content
+		try {
+			const linkContent = fs.readlinkSync(realFile);
+
+			// resolve the link content relative to the parent directory
+			const resolvedLink = path.resolve(parentResolved[0], linkContent);
+
+			// recursive resolve the link content for more links in the structure
+			const linkResolved = this.resolve(resolvedLink);
+
+			// merge parent and link resolve results
+			let result;
+			if (linkResolved.length > 1 && parentResolved.length > 1) {
+				// when both contain links we need to duplicate them with a Set
+				const resultSet = new Set(linkResolved);
+				// add the link
+				resultSet.add(realFile);
+				// add all symlinks of the parent
+				for (let i = 1; i < parentResolved.length; i++) {
+					resultSet.add(parentResolved[i]);
+				}
+				result = Object.freeze(Array.from(resultSet));
+			} else if (parentResolved.length > 1) {
+				// we have links in the parent but not for the link content location
+				result = parentResolved.slice();
+				result[0] = linkResolved[0];
+				// add the link
+				result.push(realFile);
+				Object.freeze(result);
+			} else if (linkResolved.length > 1) {
+				// we can return the link content location result
+				result = linkResolved.slice();
+				// add the link
+				result.push(realFile);
+				Object.freeze(result);
+			} else {
+				// neither link content location nor parent have links
+				// this link is the only link here
+				result = Object.freeze([
+					// the resolve real location
+					linkResolved[0],
+					// add the link
+					realFile
+				]);
+			}
+			this.cache.set(file, result);
+			return result;
+		} catch (e) {
+			if (!EXPECTED_ERRORS.has(e.code)) {
+				throw e;
+			}
+			// no link
+			const result = parentResolved.slice();
+			result[0] = realFile;
+			Object.freeze(result);
+			this.cache.set(file, result);
+			return result;
+		}
+	}
+}
+module.exports = LinkResolver;
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/lib/getWatcherManager.js b/node_modules/mathjs/examples/node_modules/watchpack/lib/getWatcherManager.js
new file mode 100644
index 0000000..e0dcd6a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/lib/getWatcherManager.js
@@ -0,0 +1,52 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const path = require("path");
+const DirectoryWatcher = require("./DirectoryWatcher");
+
+class WatcherManager {
+	constructor(options) {
+		this.options = options;
+		this.directoryWatchers = new Map();
+	}
+
+	getDirectoryWatcher(directory) {
+		const watcher = this.directoryWatchers.get(directory);
+		if (watcher === undefined) {
+			const newWatcher = new DirectoryWatcher(this, directory, this.options);
+			this.directoryWatchers.set(directory, newWatcher);
+			newWatcher.on("closed", () => {
+				this.directoryWatchers.delete(directory);
+			});
+			return newWatcher;
+		}
+		return watcher;
+	}
+
+	watchFile(p, startTime) {
+		const directory = path.dirname(p);
+		if (directory === p) return null;
+		return this.getDirectoryWatcher(directory).watch(p, startTime);
+	}
+
+	watchDirectory(directory, startTime) {
+		return this.getDirectoryWatcher(directory).watch(directory, startTime);
+	}
+}
+
+const watcherManagers = new WeakMap();
+/**
+ * @param {object} options options
+ * @returns {WatcherManager} the watcher manager
+ */
+module.exports = options => {
+	const watcherManager = watcherManagers.get(options);
+	if (watcherManager !== undefined) return watcherManager;
+	const newWatcherManager = new WatcherManager(options);
+	watcherManagers.set(options, newWatcherManager);
+	return newWatcherManager;
+};
+module.exports.WatcherManager = WatcherManager;
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/lib/reducePlan.js b/node_modules/mathjs/examples/node_modules/watchpack/lib/reducePlan.js
new file mode 100644
index 0000000..b281ed6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/lib/reducePlan.js
@@ -0,0 +1,138 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const path = require("path");
+
+/**
+ * @template T
+ * @typedef {Object} TreeNode
+ * @property {string} filePath
+ * @property {TreeNode} parent
+ * @property {TreeNode[]} children
+ * @property {number} entries
+ * @property {boolean} active
+ * @property {T[] | T | undefined} value
+ */
+
+/**
+ * @template T
+ * @param {Map<string, T[] | T} plan
+ * @param {number} limit
+ * @returns {Map<string, Map<T, string>>} the new plan
+ */
+module.exports = (plan, limit) => {
+	const treeMap = new Map();
+	// Convert to tree
+	for (const [filePath, value] of plan) {
+		treeMap.set(filePath, {
+			filePath,
+			parent: undefined,
+			children: undefined,
+			entries: 1,
+			active: true,
+			value
+		});
+	}
+	let currentCount = treeMap.size;
+	// Create parents and calculate sum of entries
+	for (const node of treeMap.values()) {
+		const parentPath = path.dirname(node.filePath);
+		if (parentPath !== node.filePath) {
+			let parent = treeMap.get(parentPath);
+			if (parent === undefined) {
+				parent = {
+					filePath: parentPath,
+					parent: undefined,
+					children: [node],
+					entries: node.entries,
+					active: false,
+					value: undefined
+				};
+				treeMap.set(parentPath, parent);
+				node.parent = parent;
+			} else {
+				node.parent = parent;
+				if (parent.children === undefined) {
+					parent.children = [node];
+				} else {
+					parent.children.push(node);
+				}
+				do {
+					parent.entries += node.entries;
+					parent = parent.parent;
+				} while (parent);
+			}
+		}
+	}
+	// Reduce until limit reached
+	while (currentCount > limit) {
+		// Select node that helps reaching the limit most effectively without overmerging
+		const overLimit = currentCount - limit;
+		let bestNode = undefined;
+		let bestCost = Infinity;
+		for (const node of treeMap.values()) {
+			if (node.entries <= 1 || !node.children || !node.parent) continue;
+			if (node.children.length === 0) continue;
+			if (node.children.length === 1 && !node.value) continue;
+			// Try to select the node with has just a bit more entries than we need to reduce
+			// When just a bit more is over 30% over the limit,
+			// also consider just a bit less entries then we need to reduce
+			const cost =
+				node.entries - 1 >= overLimit
+					? node.entries - 1 - overLimit
+					: overLimit - node.entries + 1 + limit * 0.3;
+			if (cost < bestCost) {
+				bestNode = node;
+				bestCost = cost;
+			}
+		}
+		if (!bestNode) break;
+		// Merge all children
+		const reduction = bestNode.entries - 1;
+		bestNode.active = true;
+		bestNode.entries = 1;
+		currentCount -= reduction;
+		let parent = bestNode.parent;
+		while (parent) {
+			parent.entries -= reduction;
+			parent = parent.parent;
+		}
+		const queue = new Set(bestNode.children);
+		for (const node of queue) {
+			node.active = false;
+			node.entries = 0;
+			if (node.children) {
+				for (const child of node.children) queue.add(child);
+			}
+		}
+	}
+	// Write down new plan
+	const newPlan = new Map();
+	for (const rootNode of treeMap.values()) {
+		if (!rootNode.active) continue;
+		const map = new Map();
+		const queue = new Set([rootNode]);
+		for (const node of queue) {
+			if (node.active && node !== rootNode) continue;
+			if (node.value) {
+				if (Array.isArray(node.value)) {
+					for (const item of node.value) {
+						map.set(item, node.filePath);
+					}
+				} else {
+					map.set(node.value, node.filePath);
+				}
+			}
+			if (node.children) {
+				for (const child of node.children) {
+					queue.add(child);
+				}
+			}
+		}
+		newPlan.set(rootNode.filePath, map);
+	}
+	return newPlan;
+};
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/lib/watchEventSource.js b/node_modules/mathjs/examples/node_modules/watchpack/lib/watchEventSource.js
new file mode 100644
index 0000000..3583c2e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/lib/watchEventSource.js
@@ -0,0 +1,335 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const fs = require("fs");
+const path = require("path");
+const { EventEmitter } = require("events");
+const reducePlan = require("./reducePlan");
+
+const IS_OSX = require("os").platform() === "darwin";
+const IS_WIN = require("os").platform() === "win32";
+const SUPPORTS_RECURSIVE_WATCHING = IS_OSX || IS_WIN;
+
+const watcherLimit =
+	+process.env.WATCHPACK_WATCHER_LIMIT || (IS_OSX ? 2000 : 10000);
+
+const recursiveWatcherLogging = !!process.env
+	.WATCHPACK_RECURSIVE_WATCHER_LOGGING;
+
+let isBatch = false;
+let watcherCount = 0;
+
+/** @type {Map<Watcher, string>} */
+const pendingWatchers = new Map();
+
+/** @type {Map<string, RecursiveWatcher>} */
+const recursiveWatchers = new Map();
+
+/** @type {Map<string, DirectWatcher>} */
+const directWatchers = new Map();
+
+/** @type {Map<Watcher, RecursiveWatcher | DirectWatcher>} */
+const underlyingWatcher = new Map();
+
+class DirectWatcher {
+	constructor(filePath) {
+		this.filePath = filePath;
+		this.watchers = new Set();
+		this.watcher = undefined;
+		try {
+			const watcher = fs.watch(filePath);
+			this.watcher = watcher;
+			watcher.on("change", (type, filename) => {
+				for (const w of this.watchers) {
+					w.emit("change", type, filename);
+				}
+			});
+			watcher.on("error", error => {
+				for (const w of this.watchers) {
+					w.emit("error", error);
+				}
+			});
+		} catch (err) {
+			process.nextTick(() => {
+				for (const w of this.watchers) {
+					w.emit("error", err);
+				}
+			});
+		}
+		watcherCount++;
+	}
+
+	add(watcher) {
+		underlyingWatcher.set(watcher, this);
+		this.watchers.add(watcher);
+	}
+
+	remove(watcher) {
+		this.watchers.delete(watcher);
+		if (this.watchers.size === 0) {
+			directWatchers.delete(this.filePath);
+			watcherCount--;
+			if (this.watcher) this.watcher.close();
+		}
+	}
+
+	getWatchers() {
+		return this.watchers;
+	}
+}
+
+class RecursiveWatcher {
+	constructor(rootPath) {
+		this.rootPath = rootPath;
+		/** @type {Map<Watcher, string>} */
+		this.mapWatcherToPath = new Map();
+		/** @type {Map<string, Set<Watcher>>} */
+		this.mapPathToWatchers = new Map();
+		this.watcher = undefined;
+		try {
+			const watcher = fs.watch(rootPath, {
+				recursive: true
+			});
+			this.watcher = watcher;
+			watcher.on("change", (type, filename) => {
+				if (!filename) {
+					if (recursiveWatcherLogging) {
+						process.stderr.write(
+							`[watchpack] dispatch ${type} event in recursive watcher (${
+								this.rootPath
+							}) to all watchers\n`
+						);
+					}
+					for (const w of this.mapWatcherToPath.keys()) {
+						w.emit("change", type);
+					}
+				} else {
+					const dir = path.dirname(filename);
+					const watchers = this.mapPathToWatchers.get(dir);
+					if (recursiveWatcherLogging) {
+						process.stderr.write(
+							`[watchpack] dispatch ${type} event in recursive watcher (${
+								this.rootPath
+							}) for '${filename}' to ${
+								watchers ? watchers.size : 0
+							} watchers\n`
+						);
+					}
+					if (watchers === undefined) return;
+					for (const w of watchers) {
+						w.emit("change", type, path.basename(filename));
+					}
+				}
+			});
+			watcher.on("error", error => {
+				for (const w of this.mapWatcherToPath.keys()) {
+					w.emit("error", error);
+				}
+			});
+		} catch (err) {
+			process.nextTick(() => {
+				for (const w of this.mapWatcherToPath.keys()) {
+					w.emit("error", err);
+				}
+			});
+		}
+		watcherCount++;
+		if (recursiveWatcherLogging) {
+			process.stderr.write(
+				`[watchpack] created recursive watcher at ${rootPath}\n`
+			);
+		}
+	}
+
+	add(filePath, watcher) {
+		underlyingWatcher.set(watcher, this);
+		const subpath = filePath.slice(this.rootPath.length + 1) || ".";
+		this.mapWatcherToPath.set(watcher, subpath);
+		const set = this.mapPathToWatchers.get(subpath);
+		if (set === undefined) {
+			const newSet = new Set();
+			newSet.add(watcher);
+			this.mapPathToWatchers.set(subpath, newSet);
+		} else {
+			set.add(watcher);
+		}
+	}
+
+	remove(watcher) {
+		const subpath = this.mapWatcherToPath.get(watcher);
+		if (!subpath) return;
+		this.mapWatcherToPath.delete(watcher);
+		const set = this.mapPathToWatchers.get(subpath);
+		set.delete(watcher);
+		if (set.size === 0) {
+			this.mapPathToWatchers.delete(subpath);
+		}
+		if (this.mapWatcherToPath.size === 0) {
+			recursiveWatchers.delete(this.rootPath);
+			watcherCount--;
+			if (this.watcher) this.watcher.close();
+			if (recursiveWatcherLogging) {
+				process.stderr.write(
+					`[watchpack] closed recursive watcher at ${this.rootPath}\n`
+				);
+			}
+		}
+	}
+
+	getWatchers() {
+		return this.mapWatcherToPath;
+	}
+}
+
+class Watcher extends EventEmitter {
+	close() {
+		if (pendingWatchers.has(this)) {
+			pendingWatchers.delete(this);
+			return;
+		}
+		const watcher = underlyingWatcher.get(this);
+		watcher.remove(this);
+		underlyingWatcher.delete(this);
+	}
+}
+
+const createDirectWatcher = filePath => {
+	const existing = directWatchers.get(filePath);
+	if (existing !== undefined) return existing;
+	const w = new DirectWatcher(filePath);
+	directWatchers.set(filePath, w);
+	return w;
+};
+
+const createRecursiveWatcher = rootPath => {
+	const existing = recursiveWatchers.get(rootPath);
+	if (existing !== undefined) return existing;
+	const w = new RecursiveWatcher(rootPath);
+	recursiveWatchers.set(rootPath, w);
+	return w;
+};
+
+const execute = () => {
+	/** @type {Map<string, Watcher[] | Watcher>} */
+	const map = new Map();
+	const addWatcher = (watcher, filePath) => {
+		const entry = map.get(filePath);
+		if (entry === undefined) {
+			map.set(filePath, watcher);
+		} else if (Array.isArray(entry)) {
+			entry.push(watcher);
+		} else {
+			map.set(filePath, [entry, watcher]);
+		}
+	};
+	for (const [watcher, filePath] of pendingWatchers) {
+		addWatcher(watcher, filePath);
+	}
+	pendingWatchers.clear();
+
+	// Fast case when we are not reaching the limit
+	if (!SUPPORTS_RECURSIVE_WATCHING || watcherLimit - watcherCount >= map.size) {
+		// Create watchers for all entries in the map
+		for (const [filePath, entry] of map) {
+			const w = createDirectWatcher(filePath);
+			if (Array.isArray(entry)) {
+				for (const item of entry) w.add(item);
+			} else {
+				w.add(entry);
+			}
+		}
+		return;
+	}
+
+	// Reconsider existing watchers to improving watch plan
+	for (const watcher of recursiveWatchers.values()) {
+		for (const [w, subpath] of watcher.getWatchers()) {
+			addWatcher(w, path.join(watcher.rootPath, subpath));
+		}
+	}
+	for (const watcher of directWatchers.values()) {
+		for (const w of watcher.getWatchers()) {
+			addWatcher(w, watcher.filePath);
+		}
+	}
+
+	// Merge map entries to keep watcher limit
+	// Create a 10% buffer to be able to enter fast case more often
+	const plan = reducePlan(map, watcherLimit * 0.9);
+
+	// Update watchers for all entries in the map
+	for (const [filePath, entry] of plan) {
+		if (entry.size === 1) {
+			for (const [watcher, filePath] of entry) {
+				const w = createDirectWatcher(filePath);
+				const old = underlyingWatcher.get(watcher);
+				if (old === w) continue;
+				w.add(watcher);
+				if (old !== undefined) old.remove(watcher);
+			}
+		} else {
+			const filePaths = new Set(entry.values());
+			if (filePaths.size > 1) {
+				const w = createRecursiveWatcher(filePath);
+				for (const [watcher, watcherPath] of entry) {
+					const old = underlyingWatcher.get(watcher);
+					if (old === w) continue;
+					w.add(watcherPath, watcher);
+					if (old !== undefined) old.remove(watcher);
+				}
+			} else {
+				for (const filePath of filePaths) {
+					const w = createDirectWatcher(filePath);
+					for (const watcher of entry.keys()) {
+						const old = underlyingWatcher.get(watcher);
+						if (old === w) continue;
+						w.add(watcher);
+						if (old !== undefined) old.remove(watcher);
+					}
+				}
+			}
+		}
+	}
+};
+
+exports.watch = filePath => {
+	const watcher = new Watcher();
+	// Find an existing watcher
+	const directWatcher = directWatchers.get(filePath);
+	if (directWatcher !== undefined) {
+		directWatcher.add(watcher);
+		return watcher;
+	}
+	let current = filePath;
+	for (;;) {
+		const recursiveWatcher = recursiveWatchers.get(current);
+		if (recursiveWatcher !== undefined) {
+			recursiveWatcher.add(filePath, watcher);
+			return watcher;
+		}
+		const parent = path.dirname(current);
+		if (parent === current) break;
+		current = parent;
+	}
+	// Queue up watcher for creation
+	pendingWatchers.set(watcher, filePath);
+	if (!isBatch) execute();
+	return watcher;
+};
+
+exports.batch = fn => {
+	isBatch = true;
+	try {
+		fn();
+	} finally {
+		isBatch = false;
+		execute();
+	}
+};
+
+exports.getNumberOfWatchers = () => {
+	return watcherCount;
+};
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/lib/watchpack.js b/node_modules/mathjs/examples/node_modules/watchpack/lib/watchpack.js
new file mode 100644
index 0000000..ddc9138
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/lib/watchpack.js
@@ -0,0 +1,383 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const getWatcherManager = require("./getWatcherManager");
+const LinkResolver = require("./LinkResolver");
+const EventEmitter = require("events").EventEmitter;
+const globToRegExp = require("glob-to-regexp");
+const watchEventSource = require("./watchEventSource");
+
+const EMPTY_ARRAY = [];
+const EMPTY_OPTIONS = {};
+
+function addWatchersToSet(watchers, set) {
+	for (const ww of watchers) {
+		const w = ww.watcher;
+		if (!set.has(w.directoryWatcher)) {
+			set.add(w.directoryWatcher);
+		}
+	}
+}
+
+const stringToRegexp = ignored => {
+	const source = globToRegExp(ignored, { globstar: true, extended: true })
+		.source;
+	const matchingStart = source.slice(0, source.length - 1) + "(?:$|\\/)";
+	return matchingStart;
+};
+
+const ignoredToFunction = ignored => {
+	if (Array.isArray(ignored)) {
+		const regexp = new RegExp(ignored.map(i => stringToRegexp(i)).join("|"));
+		return x => regexp.test(x.replace(/\\/g, "/"));
+	} else if (typeof ignored === "string") {
+		const regexp = new RegExp(stringToRegexp(ignored));
+		return x => regexp.test(x.replace(/\\/g, "/"));
+	} else if (ignored instanceof RegExp) {
+		return x => ignored.test(x.replace(/\\/g, "/"));
+	} else if (ignored instanceof Function) {
+		return ignored;
+	} else if (ignored) {
+		throw new Error(`Invalid option for 'ignored': ${ignored}`);
+	} else {
+		return () => false;
+	}
+};
+
+const normalizeOptions = options => {
+	return {
+		followSymlinks: !!options.followSymlinks,
+		ignored: ignoredToFunction(options.ignored),
+		poll: options.poll
+	};
+};
+
+const normalizeCache = new WeakMap();
+const cachedNormalizeOptions = options => {
+	const cacheEntry = normalizeCache.get(options);
+	if (cacheEntry !== undefined) return cacheEntry;
+	const normalized = normalizeOptions(options);
+	normalizeCache.set(options, normalized);
+	return normalized;
+};
+
+class WatchpackFileWatcher {
+	constructor(watchpack, watcher, files) {
+		this.files = Array.isArray(files) ? files : [files];
+		this.watcher = watcher;
+		watcher.on("initial-missing", type => {
+			for (const file of this.files) {
+				if (!watchpack._missing.has(file))
+					watchpack._onRemove(file, file, type);
+			}
+		});
+		watcher.on("change", (mtime, type) => {
+			for (const file of this.files) {
+				watchpack._onChange(file, mtime, file, type);
+			}
+		});
+		watcher.on("remove", type => {
+			for (const file of this.files) {
+				watchpack._onRemove(file, file, type);
+			}
+		});
+	}
+
+	update(files) {
+		if (!Array.isArray(files)) {
+			if (this.files.length !== 1) {
+				this.files = [files];
+			} else if (this.files[0] !== files) {
+				this.files[0] = files;
+			}
+		} else {
+			this.files = files;
+		}
+	}
+
+	close() {
+		this.watcher.close();
+	}
+}
+
+class WatchpackDirectoryWatcher {
+	constructor(watchpack, watcher, directories) {
+		this.directories = Array.isArray(directories) ? directories : [directories];
+		this.watcher = watcher;
+		watcher.on("initial-missing", type => {
+			for (const item of this.directories) {
+				watchpack._onRemove(item, item, type);
+			}
+		});
+		watcher.on("change", (file, mtime, type) => {
+			for (const item of this.directories) {
+				watchpack._onChange(item, mtime, file, type);
+			}
+		});
+		watcher.on("remove", type => {
+			for (const item of this.directories) {
+				watchpack._onRemove(item, item, type);
+			}
+		});
+	}
+
+	update(directories) {
+		if (!Array.isArray(directories)) {
+			if (this.directories.length !== 1) {
+				this.directories = [directories];
+			} else if (this.directories[0] !== directories) {
+				this.directories[0] = directories;
+			}
+		} else {
+			this.directories = directories;
+		}
+	}
+
+	close() {
+		this.watcher.close();
+	}
+}
+
+class Watchpack extends EventEmitter {
+	constructor(options) {
+		super();
+		if (!options) options = EMPTY_OPTIONS;
+		this.options = options;
+		this.aggregateTimeout =
+			typeof options.aggregateTimeout === "number"
+				? options.aggregateTimeout
+				: 200;
+		this.watcherOptions = cachedNormalizeOptions(options);
+		this.watcherManager = getWatcherManager(this.watcherOptions);
+		this.fileWatchers = new Map();
+		this.directoryWatchers = new Map();
+		this._missing = new Set();
+		this.startTime = undefined;
+		this.paused = false;
+		this.aggregatedChanges = new Set();
+		this.aggregatedRemovals = new Set();
+		this.aggregateTimer = undefined;
+		this._onTimeout = this._onTimeout.bind(this);
+	}
+
+	watch(arg1, arg2, arg3) {
+		let files, directories, missing, startTime;
+		if (!arg2) {
+			({
+				files = EMPTY_ARRAY,
+				directories = EMPTY_ARRAY,
+				missing = EMPTY_ARRAY,
+				startTime
+			} = arg1);
+		} else {
+			files = arg1;
+			directories = arg2;
+			missing = EMPTY_ARRAY;
+			startTime = arg3;
+		}
+		this.paused = false;
+		const fileWatchers = this.fileWatchers;
+		const directoryWatchers = this.directoryWatchers;
+		const ignored = this.watcherOptions.ignored;
+		const filter = path => !ignored(path);
+		const addToMap = (map, key, item) => {
+			const list = map.get(key);
+			if (list === undefined) {
+				map.set(key, item);
+			} else if (Array.isArray(list)) {
+				list.push(item);
+			} else {
+				map.set(key, [list, item]);
+			}
+		};
+		const fileWatchersNeeded = new Map();
+		const directoryWatchersNeeded = new Map();
+		const missingFiles = new Set();
+		if (this.watcherOptions.followSymlinks) {
+			const resolver = new LinkResolver();
+			for (const file of files) {
+				if (filter(file)) {
+					for (const innerFile of resolver.resolve(file)) {
+						if (file === innerFile || filter(innerFile)) {
+							addToMap(fileWatchersNeeded, innerFile, file);
+						}
+					}
+				}
+			}
+			for (const file of missing) {
+				if (filter(file)) {
+					for (const innerFile of resolver.resolve(file)) {
+						if (file === innerFile || filter(innerFile)) {
+							missingFiles.add(file);
+							addToMap(fileWatchersNeeded, innerFile, file);
+						}
+					}
+				}
+			}
+			for (const dir of directories) {
+				if (filter(dir)) {
+					let first = true;
+					for (const innerItem of resolver.resolve(dir)) {
+						if (filter(innerItem)) {
+							addToMap(
+								first ? directoryWatchersNeeded : fileWatchersNeeded,
+								innerItem,
+								dir
+							);
+						}
+						first = false;
+					}
+				}
+			}
+		} else {
+			for (const file of files) {
+				if (filter(file)) {
+					addToMap(fileWatchersNeeded, file, file);
+				}
+			}
+			for (const file of missing) {
+				if (filter(file)) {
+					missingFiles.add(file);
+					addToMap(fileWatchersNeeded, file, file);
+				}
+			}
+			for (const dir of directories) {
+				if (filter(dir)) {
+					addToMap(directoryWatchersNeeded, dir, dir);
+				}
+			}
+		}
+		// Close unneeded old watchers
+		// and update existing watchers
+		for (const [key, w] of fileWatchers) {
+			const needed = fileWatchersNeeded.get(key);
+			if (needed === undefined) {
+				w.close();
+				fileWatchers.delete(key);
+			} else {
+				w.update(needed);
+				fileWatchersNeeded.delete(key);
+			}
+		}
+		for (const [key, w] of directoryWatchers) {
+			const needed = directoryWatchersNeeded.get(key);
+			if (needed === undefined) {
+				w.close();
+				directoryWatchers.delete(key);
+			} else {
+				w.update(needed);
+				directoryWatchersNeeded.delete(key);
+			}
+		}
+		// Create new watchers and install handlers on these watchers
+		watchEventSource.batch(() => {
+			for (const [key, files] of fileWatchersNeeded) {
+				const watcher = this.watcherManager.watchFile(key, startTime);
+				if (watcher) {
+					fileWatchers.set(key, new WatchpackFileWatcher(this, watcher, files));
+				}
+			}
+			for (const [key, directories] of directoryWatchersNeeded) {
+				const watcher = this.watcherManager.watchDirectory(key, startTime);
+				if (watcher) {
+					directoryWatchers.set(
+						key,
+						new WatchpackDirectoryWatcher(this, watcher, directories)
+					);
+				}
+			}
+		});
+		this._missing = missingFiles;
+		this.startTime = startTime;
+	}
+
+	close() {
+		this.paused = true;
+		if (this.aggregateTimer) clearTimeout(this.aggregateTimer);
+		for (const w of this.fileWatchers.values()) w.close();
+		for (const w of this.directoryWatchers.values()) w.close();
+		this.fileWatchers.clear();
+		this.directoryWatchers.clear();
+	}
+
+	pause() {
+		this.paused = true;
+		if (this.aggregateTimer) clearTimeout(this.aggregateTimer);
+	}
+
+	getTimes() {
+		const directoryWatchers = new Set();
+		addWatchersToSet(this.fileWatchers.values(), directoryWatchers);
+		addWatchersToSet(this.directoryWatchers.values(), directoryWatchers);
+		const obj = Object.create(null);
+		for (const w of directoryWatchers) {
+			const times = w.getTimes();
+			for (const file of Object.keys(times)) obj[file] = times[file];
+		}
+		return obj;
+	}
+
+	getTimeInfoEntries() {
+		const map = new Map();
+		this.collectTimeInfoEntries(map, map);
+		return map;
+	}
+
+	collectTimeInfoEntries(fileTimestamps, directoryTimestamps) {
+		const allWatchers = new Set();
+		addWatchersToSet(this.fileWatchers.values(), allWatchers);
+		addWatchersToSet(this.directoryWatchers.values(), allWatchers);
+		const safeTime = { value: 0 };
+		for (const w of allWatchers) {
+			w.collectTimeInfoEntries(fileTimestamps, directoryTimestamps, safeTime);
+		}
+	}
+
+	getAggregated() {
+		if (this.aggregateTimer) {
+			clearTimeout(this.aggregateTimer);
+			this.aggregateTimer = undefined;
+		}
+		const changes = this.aggregatedChanges;
+		const removals = this.aggregatedRemovals;
+		this.aggregatedChanges = new Set();
+		this.aggregatedRemovals = new Set();
+		return { changes, removals };
+	}
+
+	_onChange(item, mtime, file, type) {
+		file = file || item;
+		if (!this.paused) {
+			this.emit("change", file, mtime, type);
+			if (this.aggregateTimer) clearTimeout(this.aggregateTimer);
+			this.aggregateTimer = setTimeout(this._onTimeout, this.aggregateTimeout);
+		}
+		this.aggregatedRemovals.delete(item);
+		this.aggregatedChanges.add(item);
+	}
+
+	_onRemove(item, file, type) {
+		file = file || item;
+		if (!this.paused) {
+			this.emit("remove", file, type);
+			if (this.aggregateTimer) clearTimeout(this.aggregateTimer);
+			this.aggregateTimer = setTimeout(this._onTimeout, this.aggregateTimeout);
+		}
+		this.aggregatedChanges.delete(item);
+		this.aggregatedRemovals.add(item);
+	}
+
+	_onTimeout() {
+		this.aggregateTimer = undefined;
+		const changes = this.aggregatedChanges;
+		const removals = this.aggregatedRemovals;
+		this.aggregatedChanges = new Set();
+		this.aggregatedRemovals = new Set();
+		this.emit("aggregated", changes, removals);
+	}
+}
+
+module.exports = Watchpack;
diff --git a/node_modules/mathjs/examples/node_modules/watchpack/package.json b/node_modules/mathjs/examples/node_modules/watchpack/package.json
new file mode 100644
index 0000000..c0befc5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/watchpack/package.json
@@ -0,0 +1,49 @@
+{
+  "name": "watchpack",
+  "version": "2.3.1",
+  "description": "",
+  "main": "./lib/watchpack.js",
+  "directories": {
+    "test": "test"
+  },
+  "files": [
+    "lib/"
+  ],
+  "scripts": {
+    "pretest": "yarn lint",
+    "test": "mocha",
+    "lint": "eslint lib",
+    "precover": "yarn lint",
+    "pretty-files": "prettier \"lib/**.*\" \"test/**/*.js\" --write",
+    "cover": "istanbul cover node_modules/mocha/bin/_mocha"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/webpack/watchpack.git"
+  },
+  "author": "Tobias Koppers @sokra",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/webpack/watchpack/issues"
+  },
+  "homepage": "https://github.com/webpack/watchpack",
+  "devDependencies": {
+    "coveralls": "^3.0.0",
+    "eslint": "^5.11.1",
+    "eslint-config-prettier": "^4.3.0",
+    "eslint-plugin-prettier": "^3.1.0",
+    "istanbul": "^0.4.3",
+    "mocha": "^5.0.1",
+    "prettier": "^1.11.0",
+    "rimraf": "^2.6.2",
+    "should": "^8.3.1",
+    "write-file-atomic": "^3.0.1"
+  },
+  "dependencies": {
+    "glob-to-regexp": "^0.4.1",
+    "graceful-fs": "^4.1.2"
+  },
+  "engines": {
+    "node": ">=10.13.0"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/README.md b/node_modules/mathjs/examples/node_modules/webpack-cli/README.md
new file mode 100644
index 0000000..063b299
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/README.md
@@ -0,0 +1,147 @@
+<div align="center">
+    <a href="https://github.com/webpack/webpack-cli">
+        <img width="200" height="200" src="https://webpack.js.org/assets/icon-square-big.svg">
+    </a>
+</div>
+
+# webpack CLI
+
+The official CLI of webpack
+
+## About
+
+webpack CLI provides a flexible set of commands for developers to increase speed when setting up a custom webpack project. As of webpack v4, webpack is not expecting a configuration file, but often developers want to create a more custom webpack configuration based on their use-cases and needs. webpack CLI addresses these needs by providing a set of tools to improve the setup of custom webpack configuration.
+
+## How to install
+
+When you have followed the [Getting Started](https://webpack.js.org/guides/getting-started/) guide of webpack then webpack CLI is already installed!
+
+Otherwise
+
+```bash
+npm install --save-dev webpack-cli
+```
+
+or
+
+```bash
+yarn add webpack-cli --dev
+```
+
+## Supported arguments and commands
+
+### Usage
+
+All interactions with webpack-cli are of the form
+
+```bash
+npx webpack-cli [command] [options]
+```
+
+If no command is specified then `bundle` command is used by default
+
+### Help Usage
+
+To display basic commands and arguments -
+
+```bash
+npx webpack-cli --help
+```
+
+To display all supported commands and arguments -
+
+```bash
+npx webpack-cli --help=verbose
+```
+
+or
+
+```bash
+npx webpack-cli --help verbose
+```
+
+### Available Commands
+
+```
+  build|bundle|b [entries...] [options]                 Run webpack (default command, can be omitted).
+  configtest|t [config-path]                            Validate a webpack configuration.
+  help|h [command] [option]                             Display help for commands and options.
+  info|i [options]                                      Outputs information about your system.
+  init|create|new|c|n [generation-path] [options]       Initialize a new webpack project.
+  loader|l [output-path] [options]                      Scaffold a loader.
+  migrate|m <config-path> [new-config-path]             Migrate a configuration to a new version.
+  plugin|p [output-path] [options]                      Scaffold a plugin.
+  serve|server|s [entries...] [options]                 Run the webpack dev server.
+  version|v [commands...]                               Output the version number of 'webpack', 'webpack-cli' and 'webpack-dev-server' and commands.
+  watch|w [entries...] [options]                        Run webpack and watch for files changes.
+```
+
+### webpack 4
+
+```
+  Options:
+  --analyze                     It invokes webpack-bundle-analyzer plugin to get bundle information
+  -c, --config <value...>       Provide path to a webpack configuration file e.g. ./webpack.config.js.
+  --config-name <value...>      Name of the configuration to use.
+  -m, --merge                   Merge two or more configurations using 'webpack-merge'.
+  --env <value...>              Environment passed to the configuration when it is a function.
+  --node-env <value>            Sets process.env.NODE_ENV to the specified value.
+  --progress [value]            Print compilation progress during build.
+  -j, --json [value]            Prints result as JSON or store it in a file.
+  -d, --devtool <value>         Determine source maps to use.
+  --no-devtool                  Do not generate source maps.
+  --entry <value...>            The entry point(s) of your application e.g. ./src/main.js.
+  -h, --hot [value]             Enables Hot Module Replacement
+  --no-hot                      Disables Hot Module Replacement
+  --mode <value>                Defines the mode to pass to webpack.
+  --name <value>                Name of the configuration. Used when loading multiple configurations.
+  -o, --output-path <value>     Output location of the file generated by webpack e.g. ./dist/.
+  --prefetch <value>            Prefetch this request
+  --stats [value]               It instructs webpack on how to treat the stats e.g. verbose.
+  --no-stats                    Disable stats output.
+  -t, --target <value...>       Sets the build target e.g. node.
+  -w, --watch                   Watch for files changes.
+  --no-watch                    Do not watch for file changes.
+  --watch-options-stdin         Stop watching when stdin stream has ended.
+  --no-watch-options-stdin      Do not stop watching when stdin stream has ended.
+
+Global options:
+  --color                       Enable colors on console.
+  --no-color                    Disable colors on console.
+  -v, --version                 Output the version number of 'webpack', 'webpack-cli' and 'webpack-dev-server' and commands.
+  -h, --help [verbose]          Display help for commands and options.
+```
+
+### webpack 5
+
+Checkout [`OPTIONS.md`](https://github.com/webpack/webpack-cli/blob/master/OPTIONS.md) to see list of all available options.
+
+## Exit codes and their meanings
+
+| Exit Code | Description                                        |
+| --------- | -------------------------------------------------- |
+| `0`       | Success                                            |
+| `1`       | Errors from webpack                                |
+| `2`       | Configuration/options problem or an internal error |
+
+## CLI Environment Variables
+
+| Environment Variable                | Description                                                         |
+| ----------------------------------- | ------------------------------------------------------------------- |
+| `WEBPACK_CLI_SKIP_IMPORT_LOCAL`     | when `true` it will skip using the local instance of `webpack-cli`. |
+| `WEBPACK_CLI_FORCE_LOAD_ESM_CONFIG` | when `true` it will force load the ESM config.                      |
+| `WEBPACK_PACKAGE`                   | Use a custom webpack version in CLI.                                |
+| `WEBPACK_DEV_SERVER_PACKAGE`        | Use a custom webpack-dev-server version in CLI.                     |
+| `WEBPACK_CLI_HELP_WIDTH`            | Use custom width for help output.                                   |
+
+## Configuration Environment Variables
+
+You can use the following environment variables inside your webpack configuration:
+
+| Environment Variable | Description                                  |
+| -------------------- | -------------------------------------------- |
+| `WEBPACK_SERVE`      | `true` if `serve\|s` is being used.          |
+| `WEBPACK_BUILD`      | `true` if `build\|bundle\|b` is being used.  |
+| `WEBPACK_WATCH`      | `true` if `--watch\|watch\|w` is being used. |
+
+Checkout [webpack.js.org](https://webpack.js.org/api/cli/) for more detailed documentation of `webpack-cli`.
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/bin/cli.js b/node_modules/mathjs/examples/node_modules/webpack-cli/bin/cli.js
new file mode 100644
index 0000000..5305a83
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/bin/cli.js
@@ -0,0 +1,17 @@
+#!/usr/bin/env node
+
+"use strict";
+
+const importLocal = require("import-local");
+const runCLI = require("../lib/bootstrap");
+
+if (!process.env.WEBPACK_CLI_SKIP_IMPORT_LOCAL) {
+  // Prefer the local installation of `webpack-cli`
+  if (importLocal(__filename)) {
+    return;
+  }
+}
+
+process.title = "webpack";
+
+runCLI(process.argv);
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/lib/bootstrap.js b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/bootstrap.js
new file mode 100644
index 0000000..ef63a0b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/bootstrap.js
@@ -0,0 +1,15 @@
+const WebpackCLI = require("./webpack-cli");
+
+const runCLI = async (args) => {
+  // Create a new instance of the CLI object
+  const cli = new WebpackCLI();
+
+  try {
+    await cli.run(args);
+  } catch (error) {
+    cli.logger.error(error);
+    process.exit(2);
+  }
+};
+
+module.exports = runCLI;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/lib/index.js b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/index.js
new file mode 100644
index 0000000..4dfb248
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/index.js
@@ -0,0 +1,5 @@
+const CLI = require("./webpack-cli");
+
+module.exports = CLI;
+// TODO remove after drop `@webpack-cli/migrate`
+module.exports.utils = { logger: console };
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/lib/plugins/CLIPlugin.js b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/plugins/CLIPlugin.js
new file mode 100644
index 0000000..2b1c083
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/plugins/CLIPlugin.js
@@ -0,0 +1,132 @@
+class CLIPlugin {
+  constructor(options) {
+    this.options = options;
+  }
+
+  setupHotPlugin(compiler) {
+    const { HotModuleReplacementPlugin } = compiler.webpack || require("webpack");
+    const hotModuleReplacementPlugin = Boolean(
+      compiler.options.plugins.find((plugin) => plugin instanceof HotModuleReplacementPlugin),
+    );
+
+    if (!hotModuleReplacementPlugin) {
+      new HotModuleReplacementPlugin().apply(compiler);
+    }
+  }
+
+  setupPrefetchPlugin(compiler) {
+    const { PrefetchPlugin } = compiler.webpack || require("webpack");
+
+    new PrefetchPlugin(null, this.options.prefetch).apply(compiler);
+  }
+
+  async setupBundleAnalyzerPlugin(compiler) {
+    // eslint-disable-next-line node/no-extraneous-require
+    const { BundleAnalyzerPlugin } = require("webpack-bundle-analyzer");
+    const bundleAnalyzerPlugin = Boolean(
+      compiler.options.plugins.find((plugin) => plugin instanceof BundleAnalyzerPlugin),
+    );
+
+    if (!bundleAnalyzerPlugin) {
+      new BundleAnalyzerPlugin().apply(compiler);
+    }
+  }
+
+  setupProgressPlugin(compiler) {
+    const { ProgressPlugin } = compiler.webpack || require("webpack");
+    const progressPlugin = Boolean(
+      compiler.options.plugins.find((plugin) => plugin instanceof ProgressPlugin),
+    );
+
+    if (!progressPlugin) {
+      new ProgressPlugin({
+        profile: this.options.progress === "profile",
+      }).apply(compiler);
+    }
+  }
+
+  setupHelpfulOutput(compiler) {
+    const pluginName = "webpack-cli";
+    const getCompilationName = () => (compiler.name ? `'${compiler.name}'` : "");
+    const logCompilation = (message) => {
+      if (process.env.WEBPACK_CLI_START_FINISH_FORCE_LOG) {
+        process.stderr.write(message);
+      } else {
+        this.logger.log(message);
+      }
+    };
+
+    const { configPath } = this.options;
+
+    compiler.hooks.run.tap(pluginName, () => {
+      const name = getCompilationName();
+
+      logCompilation(`Compiler${name ? ` ${name}` : ""} starting... `);
+
+      if (configPath) {
+        this.logger.log(`Compiler${name ? ` ${name}` : ""} is using config: '${configPath}'`);
+      }
+    });
+
+    compiler.hooks.watchRun.tap(pluginName, (compiler) => {
+      const { bail, watch } = compiler.options;
+
+      if (bail && watch) {
+        this.logger.warn(
+          'You are using "bail" with "watch". "bail" will still exit webpack when the first error is found.',
+        );
+      }
+
+      const name = getCompilationName();
+
+      logCompilation(`Compiler${name ? ` ${name}` : ""} starting... `);
+
+      if (configPath) {
+        this.logger.log(`Compiler${name ? ` ${name}` : ""} is using config: '${configPath}'`);
+      }
+    });
+
+    compiler.hooks.invalid.tap(pluginName, (filename, changeTime) => {
+      const date = new Date(changeTime * 1000);
+
+      this.logger.log(`File '${filename}' was modified`);
+      this.logger.log(`Changed time is ${date} (timestamp is ${changeTime})`);
+    });
+
+    (compiler.webpack ? compiler.hooks.afterDone : compiler.hooks.done).tap(pluginName, () => {
+      const name = getCompilationName();
+
+      logCompilation(`Compiler${name ? ` ${name}` : ""} finished`);
+
+      process.nextTick(() => {
+        if (compiler.watchMode) {
+          this.logger.log(`Compiler${name ? `${name}` : ""} is watching files for updates...`);
+        }
+      });
+    });
+  }
+
+  apply(compiler) {
+    this.logger = compiler.getInfrastructureLogger("webpack-cli");
+
+    if (this.options.progress) {
+      this.setupProgressPlugin(compiler);
+    }
+
+    if (this.options.hot) {
+      this.setupHotPlugin(compiler);
+    }
+
+    if (this.options.prefetch) {
+      this.setupPrefetchPlugin(compiler);
+    }
+
+    if (this.options.analyze) {
+      this.setupBundleAnalyzerPlugin(compiler);
+    }
+
+    this.setupHelpfulOutput(compiler);
+  }
+}
+
+module.exports = CLIPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/lib/utils/dynamic-import-loader.js b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/utils/dynamic-import-loader.js
new file mode 100644
index 0000000..c1221bc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/utils/dynamic-import-loader.js
@@ -0,0 +1,13 @@
+function dynamicImportLoader() {
+  let importESM;
+
+  try {
+    importESM = new Function("id", "return import(id);");
+  } catch (e) {
+    importESM = null;
+  }
+
+  return importESM;
+}
+
+module.exports = dynamicImportLoader;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/lib/webpack-cli.js b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/webpack-cli.js
new file mode 100644
index 0000000..b28ba64
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/lib/webpack-cli.js
@@ -0,0 +1,2343 @@
+const fs = require("fs");
+const path = require("path");
+const { pathToFileURL } = require("url");
+const util = require("util");
+
+const { program, Option } = require("commander");
+
+const WEBPACK_PACKAGE = process.env.WEBPACK_PACKAGE || "webpack";
+const WEBPACK_DEV_SERVER_PACKAGE = process.env.WEBPACK_DEV_SERVER_PACKAGE || "webpack-dev-server";
+
+class WebpackCLI {
+  constructor() {
+    this.colors = this.createColors();
+    this.logger = this.getLogger();
+
+    // Initialize program
+    this.program = program;
+    this.program.name("webpack");
+    this.program.configureOutput({
+      writeErr: this.logger.error,
+      outputError: (str, write) =>
+        write(`Error: ${this.capitalizeFirstLetter(str.replace(/^error:/, "").trim())}`),
+    });
+  }
+
+  capitalizeFirstLetter(str) {
+    if (typeof str !== "string") {
+      return "";
+    }
+
+    return str.charAt(0).toUpperCase() + str.slice(1);
+  }
+
+  toKebabCase(str) {
+    return str.replace(/([a-z0-9])([A-Z])/g, "$1-$2").toLowerCase();
+  }
+
+  createColors(useColor) {
+    const { createColors, isColorSupported } = require("colorette");
+
+    let shouldUseColor;
+
+    if (useColor) {
+      shouldUseColor = useColor;
+    } else {
+      shouldUseColor = isColorSupported;
+    }
+
+    return { ...createColors({ useColor: shouldUseColor }), isColorSupported: shouldUseColor };
+  }
+
+  getLogger() {
+    return {
+      error: (val) => console.error(`[webpack-cli] ${this.colors.red(util.format(val))}`),
+      warn: (val) => console.warn(`[webpack-cli] ${this.colors.yellow(val)}`),
+      info: (val) => console.info(`[webpack-cli] ${this.colors.cyan(val)}`),
+      success: (val) => console.log(`[webpack-cli] ${this.colors.green(val)}`),
+      log: (val) => console.log(`[webpack-cli] ${val}`),
+      raw: (val) => console.log(val),
+    };
+  }
+
+  checkPackageExists(packageName) {
+    if (process.versions.pnp) {
+      return true;
+    }
+
+    let dir = __dirname;
+
+    do {
+      try {
+        if (fs.statSync(path.join(dir, "node_modules", packageName)).isDirectory()) {
+          return true;
+        }
+      } catch (_error) {
+        // Nothing
+      }
+    } while (dir !== (dir = path.dirname(dir)));
+
+    return false;
+  }
+
+  getAvailablePackageManagers() {
+    const { sync } = require("execa");
+    const installers = ["npm", "yarn", "pnpm"];
+    const hasPackageManagerInstalled = (packageManager) => {
+      try {
+        sync(packageManager, ["--version"]);
+
+        return packageManager;
+      } catch (err) {
+        return false;
+      }
+    };
+    const availableInstallers = installers.filter((installer) =>
+      hasPackageManagerInstalled(installer),
+    );
+
+    if (!availableInstallers.length) {
+      this.logger.error("No package manager found.");
+
+      process.exit(2);
+    }
+
+    return availableInstallers;
+  }
+
+  getDefaultPackageManager() {
+    const { sync } = require("execa");
+    const hasLocalNpm = fs.existsSync(path.resolve(process.cwd(), "package-lock.json"));
+
+    if (hasLocalNpm) {
+      return "npm";
+    }
+
+    const hasLocalYarn = fs.existsSync(path.resolve(process.cwd(), "yarn.lock"));
+
+    if (hasLocalYarn) {
+      return "yarn";
+    }
+
+    const hasLocalPnpm = fs.existsSync(path.resolve(process.cwd(), "pnpm-lock.yaml"));
+
+    if (hasLocalPnpm) {
+      return "pnpm";
+    }
+
+    try {
+      // the sync function below will fail if npm is not installed,
+      // an error will be thrown
+      if (sync("npm", ["--version"])) {
+        return "npm";
+      }
+    } catch (e) {
+      // Nothing
+    }
+
+    try {
+      // the sync function below will fail if yarn is not installed,
+      // an error will be thrown
+      if (sync("yarn", ["--version"])) {
+        return "yarn";
+      }
+    } catch (e) {
+      // Nothing
+    }
+
+    try {
+      // the sync function below will fail if pnpm is not installed,
+      // an error will be thrown
+      if (sync("pnpm", ["--version"])) {
+        return "pnpm";
+      }
+    } catch (e) {
+      this.logger.error("No package manager found.");
+
+      process.exit(2);
+    }
+  }
+
+  async doInstall(packageName, options = {}) {
+    const packageManager = this.getDefaultPackageManager();
+
+    if (!packageManager) {
+      this.logger.error("Can't find package manager");
+
+      process.exit(2);
+    }
+
+    if (options.preMessage) {
+      options.preMessage();
+    }
+
+    // yarn uses 'add' command, rest npm and pnpm both use 'install'
+    const commandToBeRun = `${packageManager} ${[
+      packageManager === "yarn" ? "add" : "install",
+      "-D",
+      packageName,
+    ].join(" ")}`;
+
+    const prompt = ({ message, defaultResponse, stream }) => {
+      const readline = require("readline");
+      const rl = readline.createInterface({
+        input: process.stdin,
+        output: stream,
+      });
+
+      return new Promise((resolve) => {
+        rl.question(`${message} `, (answer) => {
+          // Close the stream
+          rl.close();
+
+          const response = (answer || defaultResponse).toLowerCase();
+
+          // Resolve with the input response
+          if (response === "y" || response === "yes") {
+            resolve(true);
+          } else {
+            resolve(false);
+          }
+        });
+      });
+    };
+
+    let needInstall;
+
+    try {
+      needInstall = await prompt({
+        message: `[webpack-cli] Would you like to install '${this.colors.green(
+          packageName,
+        )}' package? (That will run '${this.colors.green(commandToBeRun)}') (${this.colors.yellow(
+          "Y/n",
+        )})`,
+        defaultResponse: "Y",
+        stream: process.stderr,
+      });
+    } catch (error) {
+      this.logger.error(error);
+
+      process.exit(error);
+    }
+
+    if (needInstall) {
+      const execa = require("execa");
+
+      try {
+        await execa(commandToBeRun, [], { stdio: "inherit", shell: true });
+      } catch (error) {
+        this.logger.error(error);
+
+        process.exit(2);
+      }
+
+      return packageName;
+    }
+
+    process.exit(2);
+  }
+
+  async tryRequireThenImport(module, handleError = true) {
+    let result;
+
+    try {
+      result = require(module);
+    } catch (error) {
+      const dynamicImportLoader = require("./utils/dynamic-import-loader")();
+      if (
+        (error.code === "ERR_REQUIRE_ESM" || process.env.WEBPACK_CLI_FORCE_LOAD_ESM_CONFIG) &&
+        pathToFileURL &&
+        dynamicImportLoader
+      ) {
+        const urlForConfig = pathToFileURL(module);
+
+        result = await dynamicImportLoader(urlForConfig);
+        result = result.default;
+
+        return result;
+      }
+
+      if (handleError) {
+        this.logger.error(error);
+        process.exit(2);
+      } else {
+        throw error;
+      }
+    }
+
+    // For babel/typescript
+    if (result && typeof result === "object" && "default" in result) {
+      result = result.default || {};
+    }
+
+    return result || {};
+  }
+
+  loadJSONFile(pathToFile, handleError = true) {
+    let result;
+
+    try {
+      result = require(pathToFile);
+    } catch (error) {
+      if (handleError) {
+        this.logger.error(error);
+        process.exit(2);
+      } else {
+        throw error;
+      }
+    }
+
+    return result;
+  }
+
+  async makeCommand(commandOptions, options, action) {
+    const alreadyLoaded = this.program.commands.find(
+      (command) =>
+        command.name() === commandOptions.name.split(" ")[0] ||
+        command.aliases().includes(commandOptions.alias),
+    );
+
+    if (alreadyLoaded) {
+      return;
+    }
+
+    const command = this.program.command(commandOptions.name, {
+      noHelp: commandOptions.noHelp,
+      hidden: commandOptions.hidden,
+      isDefault: commandOptions.isDefault,
+    });
+
+    if (commandOptions.description) {
+      command.description(commandOptions.description, commandOptions.argsDescription);
+    }
+
+    if (commandOptions.usage) {
+      command.usage(commandOptions.usage);
+    }
+
+    if (Array.isArray(commandOptions.alias)) {
+      command.aliases(commandOptions.alias);
+    } else {
+      command.alias(commandOptions.alias);
+    }
+
+    if (commandOptions.pkg) {
+      command.pkg = commandOptions.pkg;
+    } else {
+      command.pkg = "webpack-cli";
+    }
+
+    const { forHelp } = this.program;
+
+    let allDependenciesInstalled = true;
+
+    if (commandOptions.dependencies && commandOptions.dependencies.length > 0) {
+      for (const dependency of commandOptions.dependencies) {
+        const isPkgExist = this.checkPackageExists(dependency);
+
+        if (isPkgExist) {
+          continue;
+        } else if (!isPkgExist && forHelp) {
+          allDependenciesInstalled = false;
+          continue;
+        }
+
+        let skipInstallation = false;
+
+        // Allow to use `./path/to/webpack.js` outside `node_modules`
+        if (dependency === WEBPACK_PACKAGE && fs.existsSync(WEBPACK_PACKAGE)) {
+          skipInstallation = true;
+        }
+
+        // Allow to use `./path/to/webpack-dev-server.js` outside `node_modules`
+        if (dependency === WEBPACK_DEV_SERVER_PACKAGE && fs.existsSync(WEBPACK_PACKAGE)) {
+          skipInstallation = true;
+        }
+
+        if (skipInstallation) {
+          continue;
+        }
+
+        await this.doInstall(dependency, {
+          preMessage: () => {
+            this.logger.error(
+              `For using '${this.colors.green(
+                commandOptions.name.split(" ")[0],
+              )}' command you need to install: '${this.colors.green(dependency)}' package.`,
+            );
+          },
+        });
+      }
+    }
+
+    if (options) {
+      if (typeof options === "function") {
+        if (forHelp && !allDependenciesInstalled) {
+          command.description(
+            `${
+              commandOptions.description
+            } To see all available options you need to install ${commandOptions.dependencies
+              .map((dependency) => `'${dependency}'`)
+              .join(", ")}.`,
+          );
+          options = [];
+        } else {
+          options = await options();
+        }
+      }
+
+      options.forEach((optionForCommand) => {
+        this.makeOption(command, optionForCommand);
+      });
+    }
+
+    command.action(action);
+
+    return command;
+  }
+
+  makeOption(command, option) {
+    let mainOption;
+    let negativeOption;
+
+    if (option.configs) {
+      let needNegativeOption = false;
+      let negatedDescription;
+      const mainOptionType = new Set();
+
+      option.configs.forEach((config) => {
+        // Possible value: "enum" | "string" | "path" | "number" | "boolean" | "RegExp" | "reset"
+        switch (config.type) {
+          case "reset":
+            mainOptionType.add(Boolean);
+            break;
+          case "boolean":
+            if (!needNegativeOption) {
+              needNegativeOption = true;
+              negatedDescription = config.negatedDescription;
+            }
+
+            mainOptionType.add(Boolean);
+            break;
+          case "number":
+            mainOptionType.add(Number);
+            break;
+          case "string":
+          case "path":
+          case "RegExp":
+            mainOptionType.add(String);
+            break;
+          case "enum": {
+            let hasFalseEnum = false;
+
+            const enumTypes = config.values.map((value) => {
+              switch (typeof value) {
+                case "string":
+                  mainOptionType.add(String);
+                  break;
+                case "number":
+                  mainOptionType.add(Number);
+                  break;
+                case "boolean":
+                  if (!hasFalseEnum && value === false) {
+                    hasFalseEnum = true;
+                    break;
+                  }
+
+                  mainOptionType.add(Boolean);
+                  break;
+              }
+            });
+
+            if (!needNegativeOption) {
+              needNegativeOption = hasFalseEnum;
+              negatedDescription = config.negatedDescription;
+            }
+
+            return enumTypes;
+          }
+        }
+      });
+
+      mainOption = {
+        flags: option.alias ? `-${option.alias}, --${option.name}` : `--${option.name}`,
+        description: option.description || "",
+        type: mainOptionType,
+        multiple: option.multiple,
+        defaultValue: option.defaultValue,
+      };
+
+      if (needNegativeOption) {
+        negativeOption = {
+          flags: `--no-${option.name}`,
+          description:
+            negatedDescription || option.negatedDescription || `Negative '${option.name}' option.`,
+        };
+      }
+    } else {
+      mainOption = {
+        flags: option.alias ? `-${option.alias}, --${option.name}` : `--${option.name}`,
+        // TODO `describe` used by `webpack-dev-server@3`
+        description: option.description || option.describe || "",
+        type: option.type
+          ? new Set(Array.isArray(option.type) ? option.type : [option.type])
+          : new Set([Boolean]),
+        multiple: option.multiple,
+        defaultValue: option.defaultValue,
+      };
+
+      if (option.negative) {
+        negativeOption = {
+          flags: `--no-${option.name}`,
+          description: option.negatedDescription
+            ? option.negatedDescription
+            : `Negative '${option.name}' option.`,
+        };
+      }
+    }
+
+    if (mainOption.type.size > 1 && mainOption.type.has(Boolean)) {
+      mainOption.flags = `${mainOption.flags} [value${mainOption.multiple ? "..." : ""}]`;
+    } else if (mainOption.type.size > 0 && !mainOption.type.has(Boolean)) {
+      mainOption.flags = `${mainOption.flags} <value${mainOption.multiple ? "..." : ""}>`;
+    }
+
+    if (mainOption.type.size === 1) {
+      if (mainOption.type.has(Number)) {
+        let skipDefault = true;
+
+        const optionForCommand = new Option(mainOption.flags, mainOption.description)
+          .argParser((value, prev = []) => {
+            if (mainOption.defaultValue && mainOption.multiple && skipDefault) {
+              prev = [];
+              skipDefault = false;
+            }
+
+            return mainOption.multiple ? [].concat(prev).concat(Number(value)) : Number(value);
+          })
+          .default(mainOption.defaultValue);
+
+        optionForCommand.helpLevel = option.helpLevel;
+
+        command.addOption(optionForCommand);
+      } else if (mainOption.type.has(String)) {
+        let skipDefault = true;
+
+        const optionForCommand = new Option(mainOption.flags, mainOption.description)
+          .argParser((value, prev = []) => {
+            if (mainOption.defaultValue && mainOption.multiple && skipDefault) {
+              prev = [];
+              skipDefault = false;
+            }
+
+            return mainOption.multiple ? [].concat(prev).concat(value) : value;
+          })
+          .default(mainOption.defaultValue);
+
+        optionForCommand.helpLevel = option.helpLevel;
+
+        command.addOption(optionForCommand);
+      } else if (mainOption.type.has(Boolean)) {
+        const optionForCommand = new Option(mainOption.flags, mainOption.description).default(
+          mainOption.defaultValue,
+        );
+
+        optionForCommand.helpLevel = option.helpLevel;
+
+        command.addOption(optionForCommand);
+      } else {
+        const optionForCommand = new Option(mainOption.flags, mainOption.description)
+          .argParser(Array.from(mainOption.type)[0])
+          .default(mainOption.defaultValue);
+
+        optionForCommand.helpLevel = option.helpLevel;
+
+        command.addOption(optionForCommand);
+      }
+    } else if (mainOption.type.size > 1) {
+      let skipDefault = true;
+
+      const optionForCommand = new Option(
+        mainOption.flags,
+        mainOption.description,
+        mainOption.defaultValue,
+      )
+        .argParser((value, prev = []) => {
+          if (mainOption.defaultValue && mainOption.multiple && skipDefault) {
+            prev = [];
+            skipDefault = false;
+          }
+
+          if (mainOption.type.has(Number)) {
+            const numberValue = Number(value);
+
+            if (!isNaN(numberValue)) {
+              return mainOption.multiple ? [].concat(prev).concat(numberValue) : numberValue;
+            }
+          }
+
+          if (mainOption.type.has(String)) {
+            return mainOption.multiple ? [].concat(prev).concat(value) : value;
+          }
+
+          return value;
+        })
+        .default(mainOption.defaultValue);
+
+      optionForCommand.helpLevel = option.helpLevel;
+
+      command.addOption(optionForCommand);
+    } else if (mainOption.type.size === 0 && negativeOption) {
+      const optionForCommand = new Option(mainOption.flags, mainOption.description);
+
+      // Hide stub option
+      optionForCommand.hideHelp();
+      optionForCommand.helpLevel = option.helpLevel;
+
+      command.addOption(optionForCommand);
+    }
+
+    if (negativeOption) {
+      const optionForCommand = new Option(negativeOption.flags, negativeOption.description);
+
+      optionForCommand.helpLevel = option.helpLevel;
+
+      command.addOption(optionForCommand);
+    }
+  }
+
+  getBuiltInOptions() {
+    if (this.builtInOptionsCache) {
+      return this.builtInOptionsCache;
+    }
+
+    const minimumHelpFlags = [
+      "config",
+      "config-name",
+      "merge",
+      "env",
+      "mode",
+      "watch",
+      "watch-options-stdin",
+      "stats",
+      "devtool",
+      "entry",
+      "target",
+      "progress",
+      "json",
+      "name",
+      "output-path",
+      "node-env",
+    ];
+
+    const builtInFlags = [
+      // For configs
+      {
+        name: "config",
+        alias: "c",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        multiple: true,
+        description: "Provide path to a webpack configuration file e.g. ./webpack.config.js.",
+      },
+      {
+        name: "config-name",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        multiple: true,
+        description: "Name of the configuration to use.",
+      },
+      {
+        name: "merge",
+        alias: "m",
+        configs: [
+          {
+            type: "enum",
+            values: [true],
+          },
+        ],
+        description: "Merge two or more configurations using 'webpack-merge'.",
+      },
+      // Complex configs
+      {
+        name: "env",
+        type: (value, previous = {}) => {
+          // for https://github.com/webpack/webpack-cli/issues/2642
+          if (value.endsWith("=")) {
+            value.concat('""');
+          }
+
+          // This ensures we're only splitting by the first `=`
+          const [allKeys, val] = value.split(/=(.+)/, 2);
+          const splitKeys = allKeys.split(/\.(?!$)/);
+
+          let prevRef = previous;
+
+          splitKeys.forEach((someKey, index) => {
+            if (!prevRef[someKey]) {
+              prevRef[someKey] = {};
+            }
+
+            if (typeof prevRef[someKey] === "string") {
+              prevRef[someKey] = {};
+            }
+
+            if (index === splitKeys.length - 1) {
+              if (typeof val === "string") {
+                prevRef[someKey] = val;
+              } else {
+                prevRef[someKey] = true;
+              }
+            }
+
+            prevRef = prevRef[someKey];
+          });
+
+          return previous;
+        },
+        multiple: true,
+        description: "Environment passed to the configuration when it is a function.",
+      },
+      {
+        name: "node-env",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        multiple: false,
+        description: "Sets process.env.NODE_ENV to the specified value.",
+      },
+
+      // Adding more plugins
+      {
+        name: "hot",
+        alias: "h",
+        configs: [
+          {
+            type: "string",
+          },
+          {
+            type: "boolean",
+          },
+        ],
+        negative: true,
+        description: "Enables Hot Module Replacement",
+        negatedDescription: "Disables Hot Module Replacement.",
+      },
+      {
+        name: "analyze",
+        configs: [
+          {
+            type: "enum",
+            values: [true],
+          },
+        ],
+        multiple: false,
+        description: "It invokes webpack-bundle-analyzer plugin to get bundle information.",
+      },
+      {
+        name: "progress",
+        configs: [
+          {
+            type: "string",
+          },
+          {
+            type: "enum",
+            values: [true],
+          },
+        ],
+        description: "Print compilation progress during build.",
+      },
+      {
+        name: "prefetch",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        description: "Prefetch this request.",
+      },
+
+      // Output options
+      {
+        name: "json",
+        configs: [
+          {
+            type: "string",
+          },
+          {
+            type: "enum",
+            values: [true],
+          },
+        ],
+        alias: "j",
+        description: "Prints result as JSON or store it in a file.",
+      },
+
+      // For webpack@4
+      {
+        name: "entry",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        multiple: true,
+        description: "The entry point(s) of your application e.g. ./src/main.js.",
+      },
+      {
+        name: "output-path",
+        alias: "o",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        description: "Output location of the file generated by webpack e.g. ./dist/.",
+      },
+      {
+        name: "target",
+        alias: "t",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        multiple: this.webpack.cli !== undefined,
+        description: "Sets the build target e.g. node.",
+      },
+      {
+        name: "devtool",
+        configs: [
+          {
+            type: "string",
+          },
+          {
+            type: "enum",
+            values: [false],
+          },
+        ],
+        negative: true,
+        alias: "d",
+        description: "Determine source maps to use.",
+        negatedDescription: "Do not generate source maps.",
+      },
+      {
+        name: "mode",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        description: "Defines the mode to pass to webpack.",
+      },
+      {
+        name: "name",
+        configs: [
+          {
+            type: "string",
+          },
+        ],
+        description: "Name of the configuration. Used when loading multiple configurations.",
+      },
+      {
+        name: "stats",
+        configs: [
+          {
+            type: "string",
+          },
+          {
+            type: "boolean",
+          },
+        ],
+        negative: true,
+        description: "It instructs webpack on how to treat the stats e.g. verbose.",
+        negatedDescription: "Disable stats output.",
+      },
+      {
+        name: "watch",
+        configs: [
+          {
+            type: "boolean",
+          },
+        ],
+        negative: true,
+        alias: "w",
+        description: "Watch for files changes.",
+        negatedDescription: "Do not watch for file changes.",
+      },
+      {
+        name: "watch-options-stdin",
+        configs: [
+          {
+            type: "boolean",
+          },
+        ],
+        negative: true,
+        description: "Stop watching when stdin stream has ended.",
+        negatedDescription: "Do not stop watching when stdin stream has ended.",
+      },
+    ];
+
+    // Extract all the flags being exported from core.
+    // A list of cli flags generated by core can be found here https://github.com/webpack/webpack/blob/master/test/__snapshots__/Cli.test.js.snap
+    const coreFlags = this.webpack.cli
+      ? Object.entries(this.webpack.cli.getArguments()).map(([flag, meta]) => {
+          const inBuiltIn = builtInFlags.find((builtInFlag) => builtInFlag.name === flag);
+
+          if (inBuiltIn) {
+            return {
+              ...meta,
+              name: flag,
+              group: "core",
+              ...inBuiltIn,
+              configs: meta.configs || [],
+            };
+          }
+
+          return { ...meta, name: flag, group: "core" };
+        })
+      : [];
+
+    const options = []
+      .concat(
+        builtInFlags.filter(
+          (builtInFlag) => !coreFlags.find((coreFlag) => builtInFlag.name === coreFlag.name),
+        ),
+      )
+      .concat(coreFlags)
+      .map((option) => {
+        option.helpLevel = minimumHelpFlags.includes(option.name) ? "minimum" : "verbose";
+
+        return option;
+      });
+
+    this.builtInOptionsCache = options;
+
+    return options;
+  }
+
+  async loadWebpack(handleError = true) {
+    return this.tryRequireThenImport(WEBPACK_PACKAGE, handleError);
+  }
+
+  async run(args, parseOptions) {
+    // Built-in internal commands
+    const buildCommandOptions = {
+      name: "build [entries...]",
+      alias: ["bundle", "b"],
+      description: "Run webpack (default command, can be omitted).",
+      usage: "[entries...] [options]",
+      dependencies: [WEBPACK_PACKAGE],
+    };
+    const watchCommandOptions = {
+      name: "watch [entries...]",
+      alias: "w",
+      description: "Run webpack and watch for files changes.",
+      usage: "[entries...] [options]",
+      dependencies: [WEBPACK_PACKAGE],
+    };
+    const versionCommandOptions = {
+      name: "version [commands...]",
+      alias: "v",
+      description:
+        "Output the version number of 'webpack', 'webpack-cli' and 'webpack-dev-server' and commands.",
+    };
+    const helpCommandOptions = {
+      name: "help [command] [option]",
+      alias: "h",
+      description: "Display help for commands and options.",
+    };
+    // Built-in external commands
+    const externalBuiltInCommandsInfo = [
+      {
+        name: "serve [entries...]",
+        alias: ["server", "s"],
+        pkg: "@webpack-cli/serve",
+      },
+      {
+        name: "info",
+        alias: "i",
+        pkg: "@webpack-cli/info",
+      },
+      {
+        name: "init",
+        alias: ["create", "new", "c", "n"],
+        pkg: "@webpack-cli/generators",
+      },
+      {
+        name: "loader",
+        alias: "l",
+        pkg: "@webpack-cli/generators",
+      },
+      {
+        name: "plugin",
+        alias: "p",
+        pkg: "@webpack-cli/generators",
+      },
+      {
+        name: "migrate",
+        alias: "m",
+        pkg: "@webpack-cli/migrate",
+      },
+      {
+        name: "configtest [config-path]",
+        alias: "t",
+        pkg: "@webpack-cli/configtest",
+      },
+    ];
+
+    const knownCommands = [
+      buildCommandOptions,
+      watchCommandOptions,
+      versionCommandOptions,
+      helpCommandOptions,
+      ...externalBuiltInCommandsInfo,
+    ];
+    const getCommandName = (name) => name.split(" ")[0];
+    const isKnownCommand = (name) =>
+      knownCommands.find(
+        (command) =>
+          getCommandName(command.name) === name ||
+          (Array.isArray(command.alias) ? command.alias.includes(name) : command.alias === name),
+      );
+    const isCommand = (input, commandOptions) => {
+      const longName = getCommandName(commandOptions.name);
+
+      if (input === longName) {
+        return true;
+      }
+
+      if (commandOptions.alias) {
+        if (Array.isArray(commandOptions.alias)) {
+          return commandOptions.alias.includes(input);
+        } else {
+          return commandOptions.alias === input;
+        }
+      }
+
+      return false;
+    };
+    const findCommandByName = (name) =>
+      this.program.commands.find(
+        (command) => name === command.name() || command.aliases().includes(name),
+      );
+    const isOption = (value) => value.startsWith("-");
+    const isGlobalOption = (value) =>
+      value === "--color" ||
+      value === "--no-color" ||
+      value === "-v" ||
+      value === "--version" ||
+      value === "-h" ||
+      value === "--help";
+
+    const loadCommandByName = async (commandName, allowToInstall = false) => {
+      const isBuildCommandUsed = isCommand(commandName, buildCommandOptions);
+      const isWatchCommandUsed = isCommand(commandName, watchCommandOptions);
+
+      if (isBuildCommandUsed || isWatchCommandUsed) {
+        await this.makeCommand(
+          isBuildCommandUsed ? buildCommandOptions : watchCommandOptions,
+          async () => {
+            this.webpack = await this.loadWebpack();
+
+            return isWatchCommandUsed
+              ? this.getBuiltInOptions().filter((option) => option.name !== "watch")
+              : this.getBuiltInOptions();
+          },
+          async (entries, options) => {
+            if (entries.length > 0) {
+              options.entry = [...entries, ...(options.entry || [])];
+            }
+
+            await this.runWebpack(options, isWatchCommandUsed);
+          },
+        );
+      } else if (isCommand(commandName, helpCommandOptions)) {
+        // Stub for the `help` command
+        this.makeCommand(helpCommandOptions, [], () => {});
+      } else if (isCommand(commandName, versionCommandOptions)) {
+        // Stub for the `version` command
+        this.makeCommand(versionCommandOptions, [], () => {});
+      } else {
+        const builtInExternalCommandInfo = externalBuiltInCommandsInfo.find(
+          (externalBuiltInCommandInfo) =>
+            getCommandName(externalBuiltInCommandInfo.name) === commandName ||
+            (Array.isArray(externalBuiltInCommandInfo.alias)
+              ? externalBuiltInCommandInfo.alias.includes(commandName)
+              : externalBuiltInCommandInfo.alias === commandName),
+        );
+
+        let pkg;
+
+        if (builtInExternalCommandInfo) {
+          ({ pkg } = builtInExternalCommandInfo);
+        } else {
+          pkg = commandName;
+        }
+
+        if (pkg !== "webpack-cli" && !this.checkPackageExists(pkg)) {
+          if (!allowToInstall) {
+            return;
+          }
+
+          pkg = await this.doInstall(pkg, {
+            preMessage: () => {
+              this.logger.error(
+                `For using this command you need to install: '${this.colors.green(pkg)}' package.`,
+              );
+            },
+          });
+        }
+
+        let loadedCommand;
+
+        try {
+          loadedCommand = await this.tryRequireThenImport(pkg, false);
+        } catch (error) {
+          // Ignore, command is not installed
+
+          return;
+        }
+
+        let command;
+
+        try {
+          command = new loadedCommand();
+
+          await command.apply(this);
+        } catch (error) {
+          this.logger.error(`Unable to load '${pkg}' command`);
+          this.logger.error(error);
+          process.exit(2);
+        }
+      }
+    };
+
+    // Register own exit
+    this.program.exitOverride(async (error) => {
+      if (error.exitCode === 0) {
+        process.exit(0);
+      }
+
+      if (error.code === "executeSubCommandAsync") {
+        process.exit(2);
+      }
+
+      if (error.code === "commander.help") {
+        process.exit(0);
+      }
+
+      if (error.code === "commander.unknownOption") {
+        let name = error.message.match(/'(.+)'/);
+
+        if (name) {
+          name = name[1].substr(2);
+
+          if (name.includes("=")) {
+            name = name.split("=")[0];
+          }
+
+          const { operands } = this.program.parseOptions(this.program.args);
+          const operand =
+            typeof operands[0] !== "undefined"
+              ? operands[0]
+              : getCommandName(buildCommandOptions.name);
+
+          if (operand) {
+            const command = findCommandByName(operand);
+
+            if (!command) {
+              this.logger.error(`Can't find and load command '${operand}'`);
+              this.logger.error("Run 'webpack --help' to see available commands and options");
+              process.exit(2);
+            }
+
+            const levenshtein = require("fastest-levenshtein");
+
+            command.options.forEach((option) => {
+              if (!option.hidden && levenshtein.distance(name, option.long.slice(2)) < 3) {
+                this.logger.error(`Did you mean '--${option.name()}'?`);
+              }
+            });
+          }
+        }
+      }
+
+      // Codes:
+      // - commander.unknownCommand
+      // - commander.missingArgument
+      // - commander.missingMandatoryOptionValue
+      // - commander.optionMissingArgument
+
+      this.logger.error("Run 'webpack --help' to see available commands and options");
+      process.exit(2);
+    });
+
+    // Default `--color` and `--no-color` options
+    const cli = this;
+    this.program.option("--color", "Enable colors on console.");
+    this.program.on("option:color", function () {
+      const { color } = this.opts();
+
+      cli.isColorSupportChanged = color;
+      cli.colors = cli.createColors(color);
+    });
+    this.program.option("--no-color", "Disable colors on console.");
+    this.program.on("option:no-color", function () {
+      const { color } = this.opts();
+
+      cli.isColorSupportChanged = color;
+      cli.colors = cli.createColors(color);
+    });
+
+    // Make `-v, --version` options
+    // Make `version|v [commands...]` command
+    const outputVersion = async (options) => {
+      // Filter `bundle`, `watch`, `version` and `help` commands
+      const possibleCommandNames = options.filter(
+        (option) =>
+          !isCommand(option, buildCommandOptions) &&
+          !isCommand(option, watchCommandOptions) &&
+          !isCommand(option, versionCommandOptions) &&
+          !isCommand(option, helpCommandOptions),
+      );
+
+      possibleCommandNames.forEach((possibleCommandName) => {
+        if (!isOption(possibleCommandName)) {
+          return;
+        }
+
+        this.logger.error(`Unknown option '${possibleCommandName}'`);
+        this.logger.error("Run 'webpack --help' to see available commands and options");
+        process.exit(2);
+      });
+
+      if (possibleCommandNames.length > 0) {
+        await Promise.all(
+          possibleCommandNames.map((possibleCommand) => loadCommandByName(possibleCommand)),
+        );
+
+        for (const possibleCommandName of possibleCommandNames) {
+          const foundCommand = findCommandByName(possibleCommandName);
+
+          if (!foundCommand) {
+            this.logger.error(`Unknown command '${possibleCommandName}'`);
+            this.logger.error("Run 'webpack --help' to see available commands and options");
+            process.exit(2);
+          }
+
+          try {
+            const { name, version } = this.loadJSONFile(`${foundCommand.pkg}/package.json`);
+
+            this.logger.raw(`${name} ${version}`);
+          } catch (e) {
+            this.logger.error(`Error: External package '${foundCommand.pkg}' not found`);
+            process.exit(2);
+          }
+        }
+      }
+
+      let webpack;
+
+      try {
+        webpack = await this.loadWebpack(false);
+      } catch (_error) {
+        // Nothing
+      }
+
+      this.logger.raw(`webpack: ${webpack ? webpack.version : "not installed"}`);
+
+      const pkgJSON = this.loadJSONFile("../package.json");
+
+      this.logger.raw(`webpack-cli: ${pkgJSON.version}`);
+
+      let devServer;
+
+      try {
+        devServer = await this.loadJSONFile("webpack-dev-server/package.json", false);
+      } catch (_error) {
+        // Nothing
+      }
+
+      this.logger.raw(`webpack-dev-server ${devServer ? devServer.version : "not installed"}`);
+
+      process.exit(0);
+    };
+    this.program.option(
+      "-v, --version",
+      "Output the version number of 'webpack', 'webpack-cli' and 'webpack-dev-server' and commands.",
+    );
+
+    const outputHelp = async (options, isVerbose, isHelpCommandSyntax, program) => {
+      const { bold } = this.colors;
+      const outputIncorrectUsageOfHelp = () => {
+        this.logger.error("Incorrect use of help");
+        this.logger.error(
+          "Please use: 'webpack help [command] [option]' | 'webpack [command] --help'",
+        );
+        this.logger.error("Run 'webpack --help' to see available commands and options");
+        process.exit(2);
+      };
+
+      const isGlobalHelp = options.length === 0;
+      const isCommandHelp = options.length === 1 && !isOption(options[0]);
+
+      if (isGlobalHelp || isCommandHelp) {
+        program.configureHelp({
+          sortSubcommands: true,
+          // Support multiple aliases
+          commandUsage: (command) => {
+            let parentCmdNames = "";
+
+            for (let parentCmd = command.parent; parentCmd; parentCmd = parentCmd.parent) {
+              parentCmdNames = `${parentCmd.name()} ${parentCmdNames}`;
+            }
+
+            if (isGlobalHelp) {
+              return `${parentCmdNames}${command.usage()}\n${bold(
+                "Alternative usage to run commands:",
+              )} ${parentCmdNames}[command] [options]`;
+            }
+
+            return `${parentCmdNames}${command.name()}|${command
+              .aliases()
+              .join("|")} ${command.usage()}`;
+          },
+          // Support multiple aliases
+          subcommandTerm: (command) => {
+            const humanReadableArgumentName = (argument) => {
+              const nameOutput = argument.name + (argument.variadic === true ? "..." : "");
+
+              return argument.required ? "<" + nameOutput + ">" : "[" + nameOutput + "]";
+            };
+            const args = command._args.map((arg) => humanReadableArgumentName(arg)).join(" ");
+
+            return `${command.name()}|${command.aliases().join("|")}${args ? ` ${args}` : ""}${
+              command.options.length > 0 ? " [options]" : ""
+            }`;
+          },
+          visibleOptions: function visibleOptions(command) {
+            return command.options.filter((option) => {
+              if (option.hidden) {
+                return false;
+              }
+
+              switch (option.helpLevel) {
+                case "verbose":
+                  return isVerbose;
+                case "minimum":
+                default:
+                  return true;
+              }
+            });
+          },
+          padWidth(command, helper) {
+            return Math.max(
+              helper.longestArgumentTermLength(command, helper),
+              helper.longestOptionTermLength(command, helper),
+              // For global options
+              helper.longestOptionTermLength(program, helper),
+              helper.longestSubcommandTermLength(isGlobalHelp ? program : command, helper),
+            );
+          },
+          formatHelp: (command, helper) => {
+            const termWidth = helper.padWidth(command, helper);
+            const helpWidth = helper.helpWidth || process.env.WEBPACK_CLI_HELP_WIDTH || 80;
+            const itemIndentWidth = 2;
+            const itemSeparatorWidth = 2; // between term and description
+
+            const formatItem = (term, description) => {
+              if (description) {
+                const fullText = `${term.padEnd(termWidth + itemSeparatorWidth)}${description}`;
+
+                return helper.wrap(
+                  fullText,
+                  helpWidth - itemIndentWidth,
+                  termWidth + itemSeparatorWidth,
+                );
+              }
+
+              return term;
+            };
+
+            const formatList = (textArray) =>
+              textArray.join("\n").replace(/^/gm, " ".repeat(itemIndentWidth));
+
+            // Usage
+            let output = [`${bold("Usage:")} ${helper.commandUsage(command)}`, ""];
+
+            // Description
+            const commandDescription = isGlobalHelp
+              ? "The build tool for modern web applications."
+              : helper.commandDescription(command);
+
+            if (commandDescription.length > 0) {
+              output = output.concat([commandDescription, ""]);
+            }
+
+            // Arguments
+            const argumentList = helper
+              .visibleArguments(command)
+              .map((argument) => formatItem(argument.term, argument.description));
+
+            if (argumentList.length > 0) {
+              output = output.concat([bold("Arguments:"), formatList(argumentList), ""]);
+            }
+
+            // Options
+            const optionList = helper
+              .visibleOptions(command)
+              .map((option) =>
+                formatItem(helper.optionTerm(option), helper.optionDescription(option)),
+              );
+
+            if (optionList.length > 0) {
+              output = output.concat([bold("Options:"), formatList(optionList), ""]);
+            }
+
+            // Global options
+            const globalOptionList = program.options.map((option) =>
+              formatItem(helper.optionTerm(option), helper.optionDescription(option)),
+            );
+
+            if (globalOptionList.length > 0) {
+              output = output.concat([bold("Global options:"), formatList(globalOptionList), ""]);
+            }
+
+            // Commands
+            const commandList = helper
+              .visibleCommands(isGlobalHelp ? program : command)
+              .map((command) =>
+                formatItem(helper.subcommandTerm(command), helper.subcommandDescription(command)),
+              );
+
+            if (commandList.length > 0) {
+              output = output.concat([bold("Commands:"), formatList(commandList), ""]);
+            }
+
+            return output.join("\n");
+          },
+        });
+
+        if (isGlobalHelp) {
+          await Promise.all(
+            knownCommands.map((knownCommand) => {
+              return loadCommandByName(getCommandName(knownCommand.name));
+            }),
+          );
+
+          const buildCommand = findCommandByName(getCommandName(buildCommandOptions.name));
+
+          this.logger.raw(buildCommand.helpInformation());
+        } else {
+          const name = options[0];
+
+          await loadCommandByName(name);
+
+          const command = findCommandByName(name);
+
+          if (!command) {
+            const builtInCommandUsed = externalBuiltInCommandsInfo.find(
+              (command) => command.name.includes(name) || name === command.alias,
+            );
+            if (typeof builtInCommandUsed !== "undefined") {
+              this.logger.error(
+                `For using '${name}' command you need to install '${builtInCommandUsed.pkg}' package.`,
+              );
+            } else {
+              this.logger.error(`Can't find and load command '${name}'`);
+              this.logger.error("Run 'webpack --help' to see available commands and options.");
+            }
+            process.exit(2);
+          }
+
+          this.logger.raw(command.helpInformation());
+        }
+      } else if (isHelpCommandSyntax) {
+        let isCommandSpecified = false;
+        let commandName = getCommandName(buildCommandOptions.name);
+        let optionName;
+
+        if (options.length === 1) {
+          optionName = options[0];
+        } else if (options.length === 2) {
+          isCommandSpecified = true;
+          commandName = options[0];
+          optionName = options[1];
+
+          if (isOption(commandName)) {
+            outputIncorrectUsageOfHelp();
+          }
+        } else {
+          outputIncorrectUsageOfHelp();
+        }
+
+        await loadCommandByName(commandName);
+
+        const command = isGlobalOption(optionName) ? program : findCommandByName(commandName);
+
+        if (!command) {
+          this.logger.error(`Can't find and load command '${commandName}'`);
+          this.logger.error("Run 'webpack --help' to see available commands and options");
+          process.exit(2);
+        }
+
+        const option = command.options.find(
+          (option) => option.short === optionName || option.long === optionName,
+        );
+
+        if (!option) {
+          this.logger.error(`Unknown option '${optionName}'`);
+          this.logger.error("Run 'webpack --help' to see available commands and options");
+          process.exit(2);
+        }
+
+        const nameOutput =
+          option.flags.replace(/^.+[[<]/, "").replace(/(\.\.\.)?[\]>].*$/, "") +
+          (option.variadic === true ? "..." : "");
+        const value = option.required
+          ? "<" + nameOutput + ">"
+          : option.optional
+          ? "[" + nameOutput + "]"
+          : "";
+
+        this.logger.raw(
+          `${bold("Usage")}: webpack${isCommandSpecified ? ` ${commandName}` : ""} ${option.long}${
+            value ? ` ${value}` : ""
+          }`,
+        );
+
+        if (option.short) {
+          this.logger.raw(
+            `${bold("Short:")} webpack${isCommandSpecified ? ` ${commandName}` : ""} ${
+              option.short
+            }${value ? ` ${value}` : ""}`,
+          );
+        }
+
+        if (option.description) {
+          this.logger.raw(`${bold("Description:")} ${option.description}`);
+        }
+
+        if (!option.negate && option.defaultValue) {
+          this.logger.raw(`${bold("Default value:")} ${JSON.stringify(option.defaultValue)}`);
+        }
+
+        const flag = this.getBuiltInOptions().find((flag) => option.long === `--${flag.name}`);
+
+        if (flag && flag.configs) {
+          const possibleValues = flag.configs.reduce((accumulator, currentValue) => {
+            if (currentValue.values) {
+              return accumulator.concat(currentValue.values);
+            } else {
+              return accumulator;
+            }
+          }, []);
+
+          if (possibleValues.length > 0) {
+            this.logger.raw(
+              `${bold("Possible values:")} ${JSON.stringify(possibleValues.join(" | "))}`,
+            );
+          }
+        }
+
+        this.logger.raw("");
+
+        // TODO implement this after refactor cli arguments
+        // logger.raw('Documentation: https://webpack.js.org/option/name/');
+      } else {
+        outputIncorrectUsageOfHelp();
+      }
+
+      this.logger.raw(
+        "To see list of all supported commands and options run 'webpack --help=verbose'.\n",
+      );
+      this.logger.raw(`${bold("Webpack documentation:")} https://webpack.js.org/.`);
+      this.logger.raw(`${bold("CLI documentation:")} https://webpack.js.org/api/cli/.`);
+      this.logger.raw(`${bold("Made with ♥ by the webpack team")}.`);
+      process.exit(0);
+    };
+    this.program.helpOption(false);
+    this.program.addHelpCommand(false);
+    this.program.option("-h, --help [verbose]", "Display help for commands and options.");
+
+    let isInternalActionCalled = false;
+
+    // Default action
+    this.program.usage("[options]");
+    this.program.allowUnknownOption(true);
+    this.program.action(async (options, program) => {
+      if (!isInternalActionCalled) {
+        isInternalActionCalled = true;
+      } else {
+        this.logger.error("No commands found to run");
+        process.exit(2);
+      }
+
+      // Command and options
+      const { operands, unknown } = this.program.parseOptions(program.args);
+      const defaultCommandToRun = getCommandName(buildCommandOptions.name);
+      const hasOperand = typeof operands[0] !== "undefined";
+      const operand = hasOperand ? operands[0] : defaultCommandToRun;
+      const isHelpOption = typeof options.help !== "undefined";
+      const isHelpCommandSyntax = isCommand(operand, helpCommandOptions);
+
+      if (isHelpOption || isHelpCommandSyntax) {
+        let isVerbose = false;
+
+        if (isHelpOption) {
+          if (typeof options.help === "string") {
+            if (options.help !== "verbose") {
+              this.logger.error("Unknown value for '--help' option, please use '--help=verbose'");
+              process.exit(2);
+            }
+
+            isVerbose = true;
+          }
+        }
+
+        this.program.forHelp = true;
+
+        const optionsForHelp = []
+          .concat(isHelpOption && hasOperand ? [operand] : [])
+          // Syntax `webpack help [command]`
+          .concat(operands.slice(1))
+          // Syntax `webpack help [option]`
+          .concat(unknown)
+          .concat(
+            isHelpCommandSyntax && typeof options.color !== "undefined"
+              ? [options.color ? "--color" : "--no-color"]
+              : [],
+          )
+          .concat(
+            isHelpCommandSyntax && typeof options.version !== "undefined" ? ["--version"] : [],
+          );
+
+        await outputHelp(optionsForHelp, isVerbose, isHelpCommandSyntax, program);
+      }
+
+      const isVersionOption = typeof options.version !== "undefined";
+      const isVersionCommandSyntax = isCommand(operand, versionCommandOptions);
+
+      if (isVersionOption || isVersionCommandSyntax) {
+        const optionsForVersion = []
+          .concat(isVersionOption ? [operand] : [])
+          .concat(operands.slice(1))
+          .concat(unknown);
+
+        await outputVersion(optionsForVersion, program);
+      }
+
+      let commandToRun = operand;
+      let commandOperands = operands.slice(1);
+
+      if (isKnownCommand(commandToRun)) {
+        await loadCommandByName(commandToRun, true);
+      } else {
+        const isEntrySyntax = fs.existsSync(operand);
+
+        if (isEntrySyntax) {
+          commandToRun = defaultCommandToRun;
+          commandOperands = operands;
+
+          await loadCommandByName(commandToRun);
+        } else {
+          this.logger.error(`Unknown command or entry '${operand}'`);
+
+          const levenshtein = require("fastest-levenshtein");
+          const found = knownCommands.find(
+            (commandOptions) =>
+              levenshtein.distance(operand, getCommandName(commandOptions.name)) < 3,
+          );
+
+          if (found) {
+            this.logger.error(
+              `Did you mean '${getCommandName(found.name)}' (alias '${
+                Array.isArray(found.alias) ? found.alias.join(", ") : found.alias
+              }')?`,
+            );
+          }
+
+          this.logger.error("Run 'webpack --help' to see available commands and options");
+          process.exit(2);
+        }
+      }
+
+      await this.program.parseAsync([commandToRun, ...commandOperands, ...unknown], {
+        from: "user",
+      });
+    });
+
+    await this.program.parseAsync(args, parseOptions);
+  }
+
+  async loadConfig(options) {
+    const interpret = require("interpret");
+    const loadConfigByPath = async (configPath, argv = {}) => {
+      const ext = path.extname(configPath);
+      const interpreted = Object.keys(interpret.jsVariants).find((variant) => variant === ext);
+
+      if (interpreted) {
+        const rechoir = require("rechoir");
+
+        try {
+          rechoir.prepare(interpret.extensions, configPath);
+        } catch (error) {
+          if (error.failures) {
+            this.logger.error(`Unable load '${configPath}'`);
+            this.logger.error(error.message);
+            error.failures.forEach((failure) => {
+              this.logger.error(failure.error.message);
+            });
+            this.logger.error("Please install one of them");
+            process.exit(2);
+          }
+
+          this.logger.error(error);
+          process.exit(2);
+        }
+      }
+
+      let options;
+
+      try {
+        options = await this.tryRequireThenImport(configPath, false);
+      } catch (error) {
+        this.logger.error(`Failed to load '${configPath}' config`);
+
+        if (this.isValidationError(error)) {
+          this.logger.error(error.message);
+        } else {
+          this.logger.error(error);
+        }
+
+        process.exit(2);
+      }
+
+      if (Array.isArray(options)) {
+        await Promise.all(
+          options.map(async (_, i) => {
+            if (typeof options[i].then === "function") {
+              options[i] = await options[i];
+            }
+
+            // `Promise` may return `Function`
+            if (typeof options[i] === "function") {
+              // when config is a function, pass the env from args to the config function
+              options[i] = await options[i](argv.env, argv);
+            }
+          }),
+        );
+      } else {
+        if (typeof options.then === "function") {
+          options = await options;
+        }
+
+        // `Promise` may return `Function`
+        if (typeof options === "function") {
+          // when config is a function, pass the env from args to the config function
+          options = await options(argv.env, argv);
+        }
+      }
+
+      const isObject = (value) => typeof value === "object" && value !== null;
+
+      if (!isObject(options) && !Array.isArray(options)) {
+        this.logger.error(`Invalid configuration in '${configPath}'`);
+
+        process.exit(2);
+      }
+
+      return { options, path: configPath };
+    };
+
+    const config = { options: {}, path: new WeakMap() };
+
+    if (options.config && options.config.length > 0) {
+      const loadedConfigs = await Promise.all(
+        options.config.map((configPath) =>
+          loadConfigByPath(path.resolve(configPath), options.argv),
+        ),
+      );
+
+      config.options = [];
+
+      loadedConfigs.forEach((loadedConfig) => {
+        const isArray = Array.isArray(loadedConfig.options);
+
+        // TODO we should run webpack multiple times when the `--config` options have multiple values with `--merge`, need to solve for the next major release
+        if (config.options.length === 0) {
+          config.options = loadedConfig.options;
+        } else {
+          if (!Array.isArray(config.options)) {
+            config.options = [config.options];
+          }
+
+          if (isArray) {
+            loadedConfig.options.forEach((item) => {
+              config.options.push(item);
+            });
+          } else {
+            config.options.push(loadedConfig.options);
+          }
+        }
+
+        if (isArray) {
+          loadedConfig.options.forEach((options) => {
+            config.path.set(options, loadedConfig.path);
+          });
+        } else {
+          config.path.set(loadedConfig.options, loadedConfig.path);
+        }
+      });
+
+      config.options = config.options.length === 1 ? config.options[0] : config.options;
+    } else {
+      // Order defines the priority, in decreasing order
+      const defaultConfigFiles = [
+        "webpack.config",
+        ".webpack/webpack.config",
+        ".webpack/webpackfile",
+      ]
+        .map((filename) =>
+          // Since .cjs is not available on interpret side add it manually to default config extension list
+          [...Object.keys(interpret.extensions), ".cjs"].map((ext) => ({
+            path: path.resolve(filename + ext),
+            ext: ext,
+            module: interpret.extensions[ext],
+          })),
+        )
+        .reduce((accumulator, currentValue) => accumulator.concat(currentValue), []);
+
+      let foundDefaultConfigFile;
+
+      for (const defaultConfigFile of defaultConfigFiles) {
+        if (!fs.existsSync(defaultConfigFile.path)) {
+          continue;
+        }
+
+        foundDefaultConfigFile = defaultConfigFile;
+        break;
+      }
+
+      if (foundDefaultConfigFile) {
+        const loadedConfig = await loadConfigByPath(foundDefaultConfigFile.path, options.argv);
+
+        config.options = loadedConfig.options;
+
+        if (Array.isArray(config.options)) {
+          config.options.forEach((item) => {
+            config.path.set(item, loadedConfig.path);
+          });
+        } else {
+          config.path.set(loadedConfig.options, loadedConfig.path);
+        }
+      }
+    }
+
+    if (options.configName) {
+      const notFoundConfigNames = [];
+
+      config.options = options.configName.map((configName) => {
+        let found;
+
+        if (Array.isArray(config.options)) {
+          found = config.options.find((options) => options.name === configName);
+        } else {
+          found = config.options.name === configName ? config.options : undefined;
+        }
+
+        if (!found) {
+          notFoundConfigNames.push(configName);
+        }
+
+        return found;
+      });
+
+      if (notFoundConfigNames.length > 0) {
+        this.logger.error(
+          notFoundConfigNames
+            .map((configName) => `Configuration with the name "${configName}" was not found.`)
+            .join(" "),
+        );
+        process.exit(2);
+      }
+    }
+
+    if (options.merge) {
+      const merge = await this.tryRequireThenImport("webpack-merge");
+
+      // we can only merge when there are multiple configurations
+      // either by passing multiple configs by flags or passing a
+      // single config exporting an array
+      if (!Array.isArray(config.options) || config.options.length <= 1) {
+        this.logger.error("At least two configurations are required for merge.");
+        process.exit(2);
+      }
+
+      const mergedConfigPaths = [];
+
+      config.options = config.options.reduce((accumulator, options) => {
+        const configPath = config.path.get(options);
+        const mergedOptions = merge(accumulator, options);
+
+        mergedConfigPaths.push(configPath);
+
+        return mergedOptions;
+      }, {});
+      config.path.set(config.options, mergedConfigPaths);
+    }
+
+    return config;
+  }
+
+  async buildConfig(config, options) {
+    const runFunctionOnEachConfig = (options, fn) => {
+      if (Array.isArray(options)) {
+        for (let item of options) {
+          item = fn(item);
+        }
+      } else {
+        options = fn(options);
+      }
+
+      return options;
+    };
+
+    if (options.analyze) {
+      if (!this.checkPackageExists("webpack-bundle-analyzer")) {
+        await this.doInstall("webpack-bundle-analyzer", {
+          preMessage: () => {
+            this.logger.error(
+              `It looks like ${this.colors.yellow("webpack-bundle-analyzer")} is not installed.`,
+            );
+          },
+        });
+
+        this.logger.success(
+          `${this.colors.yellow("webpack-bundle-analyzer")} was installed successfully.`,
+        );
+      }
+    }
+
+    if (typeof options.progress === "string" && options.progress !== "profile") {
+      this.logger.error(
+        `'${options.progress}' is an invalid value for the --progress option. Only 'profile' is allowed.`,
+      );
+      process.exit(2);
+    }
+
+    if (typeof options.hot === "string" && options.hot !== "only") {
+      this.logger.error(
+        `'${options.hot}' is an invalid value for the --hot option. Use 'only' instead.`,
+      );
+      process.exit(2);
+    }
+
+    const CLIPlugin = await this.tryRequireThenImport("./plugins/CLIPlugin");
+
+    const internalBuildConfig = (item) => {
+      // Output warnings
+      if (
+        item.watch &&
+        options.argv &&
+        options.argv.env &&
+        (options.argv.env["WEBPACK_WATCH"] || options.argv.env["WEBPACK_SERVE"])
+      ) {
+        this.logger.warn(
+          `No need to use the '${
+            options.argv.env["WEBPACK_WATCH"] ? "watch" : "serve"
+          }' command together with '{ watch: true }' configuration, it does not make sense.`,
+        );
+
+        if (options.argv.env["WEBPACK_SERVE"]) {
+          item.watch = false;
+        }
+      }
+
+      // Apply options
+      if (this.webpack.cli) {
+        const args = this.getBuiltInOptions()
+          .filter((flag) => flag.group === "core")
+          .reduce((accumulator, flag) => {
+            accumulator[flag.name] = flag;
+
+            return accumulator;
+          }, {});
+
+        const values = Object.keys(options).reduce((accumulator, name) => {
+          if (name === "argv") {
+            return accumulator;
+          }
+
+          const kebabName = this.toKebabCase(name);
+
+          if (args[kebabName]) {
+            accumulator[kebabName] = options[name];
+          }
+
+          return accumulator;
+        }, {});
+
+        const problems = this.webpack.cli.processArguments(args, item, values);
+
+        if (problems) {
+          const groupBy = (xs, key) => {
+            return xs.reduce((rv, x) => {
+              (rv[x[key]] = rv[x[key]] || []).push(x);
+
+              return rv;
+            }, {});
+          };
+          const problemsByPath = groupBy(problems, "path");
+
+          for (const path in problemsByPath) {
+            const problems = problemsByPath[path];
+
+            problems.forEach((problem) => {
+              this.logger.error(
+                `${this.capitalizeFirstLetter(problem.type.replace(/-/g, " "))}${
+                  problem.value ? ` '${problem.value}'` : ""
+                } for the '--${problem.argument}' option${
+                  problem.index ? ` by index '${problem.index}'` : ""
+                }`,
+              );
+
+              if (problem.expected) {
+                this.logger.error(`Expected: '${problem.expected}'`);
+              }
+            });
+          }
+
+          process.exit(2);
+        }
+
+        // Setup default cache options
+        if (item.cache && item.cache.type === "filesystem") {
+          const configPath = config.path.get(item);
+
+          if (configPath) {
+            if (!item.cache.buildDependencies) {
+              item.cache.buildDependencies = {};
+            }
+
+            if (!item.cache.buildDependencies.defaultConfig) {
+              item.cache.buildDependencies.defaultConfig = [];
+            }
+
+            if (Array.isArray(configPath)) {
+              configPath.forEach((oneOfConfigPath) => {
+                item.cache.buildDependencies.defaultConfig.push(oneOfConfigPath);
+              });
+            } else {
+              item.cache.buildDependencies.defaultConfig.push(configPath);
+            }
+          }
+        }
+      }
+
+      // Setup legacy logic for webpack@4
+      // TODO respect `--entry-reset` in th next major release
+      // TODO drop in the next major release
+      if (options.entry) {
+        item.entry = options.entry;
+      }
+
+      if (options.outputPath) {
+        item.output = { ...item.output, ...{ path: path.resolve(options.outputPath) } };
+      }
+
+      if (options.target) {
+        item.target = options.target;
+      }
+
+      if (typeof options.devtool !== "undefined") {
+        item.devtool = options.devtool;
+      }
+
+      if (options.name) {
+        item.name = options.name;
+      }
+
+      if (typeof options.stats !== "undefined") {
+        item.stats = options.stats;
+      }
+
+      if (typeof options.watch !== "undefined") {
+        item.watch = options.watch;
+      }
+
+      if (typeof options.watchOptionsStdin !== "undefined") {
+        item.watchOptions = { ...item.watchOptions, ...{ stdin: options.watchOptionsStdin } };
+      }
+
+      if (options.mode) {
+        item.mode = options.mode;
+      }
+
+      // Respect `process.env.NODE_ENV`
+      if (
+        !item.mode &&
+        process.env &&
+        process.env.NODE_ENV &&
+        (process.env.NODE_ENV === "development" ||
+          process.env.NODE_ENV === "production" ||
+          process.env.NODE_ENV === "none")
+      ) {
+        item.mode = process.env.NODE_ENV;
+      }
+
+      // Setup stats
+      // TODO remove after drop webpack@4
+      const statsForWebpack4 = this.webpack.Stats && this.webpack.Stats.presetToOptions;
+
+      if (statsForWebpack4) {
+        if (typeof item.stats === "undefined") {
+          item.stats = {};
+        } else if (typeof item.stats === "boolean") {
+          item.stats = this.webpack.Stats.presetToOptions(item.stats);
+        } else if (
+          typeof item.stats === "string" &&
+          (item.stats === "none" ||
+            item.stats === "verbose" ||
+            item.stats === "detailed" ||
+            item.stats === "normal" ||
+            item.stats === "minimal" ||
+            item.stats === "errors-only" ||
+            item.stats === "errors-warnings")
+        ) {
+          item.stats = this.webpack.Stats.presetToOptions(item.stats);
+        }
+      } else {
+        if (typeof item.stats === "undefined") {
+          item.stats = { preset: "normal" };
+        } else if (typeof item.stats === "boolean") {
+          item.stats = item.stats ? { preset: "normal" } : { preset: "none" };
+        } else if (typeof item.stats === "string") {
+          item.stats = { preset: item.stats };
+        }
+      }
+
+      let colors;
+
+      // From arguments
+      if (typeof this.isColorSupportChanged !== "undefined") {
+        colors = Boolean(this.isColorSupportChanged);
+      }
+      // From stats
+      else if (typeof item.stats.colors !== "undefined") {
+        colors = item.stats.colors;
+      }
+      // Default
+      else {
+        colors = Boolean(this.colors.isColorSupported);
+      }
+
+      // TODO remove after drop webpack v4
+      if (typeof item.stats === "object" && item.stats !== null) {
+        item.stats.colors = colors;
+      }
+
+      // Apply CLI plugin
+      if (!item.plugins) {
+        item.plugins = [];
+      }
+
+      item.plugins.unshift(
+        new CLIPlugin({
+          configPath: config.path.get(item),
+          helpfulOutput: !options.json,
+          hot: options.hot,
+          progress: options.progress,
+          prefetch: options.prefetch,
+          analyze: options.analyze,
+        }),
+      );
+
+      return options;
+    };
+
+    runFunctionOnEachConfig(config.options, internalBuildConfig);
+
+    return config;
+  }
+
+  isValidationError(error) {
+    // https://github.com/webpack/webpack/blob/master/lib/index.js#L267
+    // https://github.com/webpack/webpack/blob/v4.44.2/lib/webpack.js#L90
+    const ValidationError =
+      this.webpack.ValidationError || this.webpack.WebpackOptionsValidationError;
+
+    return error instanceof ValidationError || error.name === "ValidationError";
+  }
+
+  async createCompiler(options, callback) {
+    if (typeof options.nodeEnv === "string") {
+      process.env.NODE_ENV = options.nodeEnv;
+    }
+
+    let config = await this.loadConfig(options);
+    config = await this.buildConfig(config, options);
+
+    let compiler;
+
+    try {
+      compiler = this.webpack(
+        config.options,
+        callback
+          ? (error, stats) => {
+              if (error && this.isValidationError(error)) {
+                this.logger.error(error.message);
+                process.exit(2);
+              }
+
+              callback(error, stats);
+            }
+          : callback,
+      );
+    } catch (error) {
+      if (this.isValidationError(error)) {
+        this.logger.error(error.message);
+      } else {
+        this.logger.error(error);
+      }
+
+      process.exit(2);
+    }
+
+    // TODO webpack@4 return Watching and MultiWatching instead Compiler and MultiCompiler, remove this after drop webpack@4
+    if (compiler && compiler.compiler) {
+      compiler = compiler.compiler;
+    }
+
+    return compiler;
+  }
+
+  needWatchStdin(compiler) {
+    if (compiler.compilers) {
+      return compiler.compilers.some(
+        (compiler) => compiler.options.watchOptions && compiler.options.watchOptions.stdin,
+      );
+    }
+
+    return compiler.options.watchOptions && compiler.options.watchOptions.stdin;
+  }
+
+  async runWebpack(options, isWatchCommand) {
+    // eslint-disable-next-line prefer-const
+    let compiler;
+    let createJsonStringifyStream;
+
+    if (options.json) {
+      const jsonExt = await this.tryRequireThenImport("@discoveryjs/json-ext");
+
+      createJsonStringifyStream = jsonExt.stringifyStream;
+    }
+
+    const callback = (error, stats) => {
+      if (error) {
+        this.logger.error(error);
+        process.exit(2);
+      }
+
+      if (stats.hasErrors()) {
+        process.exitCode = 1;
+      }
+
+      if (!compiler) {
+        return;
+      }
+
+      const statsOptions = compiler.compilers
+        ? {
+            children: compiler.compilers.map((compiler) =>
+              compiler.options ? compiler.options.stats : undefined,
+            ),
+          }
+        : compiler.options
+        ? compiler.options.stats
+        : undefined;
+
+      // TODO webpack@4 doesn't support `{ children: [{ colors: true }, { colors: true }] }` for stats
+      const statsForWebpack4 = this.webpack.Stats && this.webpack.Stats.presetToOptions;
+
+      if (compiler.compilers && statsForWebpack4) {
+        statsOptions.colors = statsOptions.children.some((child) => child.colors);
+      }
+
+      if (options.json && createJsonStringifyStream) {
+        const handleWriteError = (error) => {
+          this.logger.error(error);
+          process.exit(2);
+        };
+
+        if (options.json === true) {
+          createJsonStringifyStream(stats.toJson(statsOptions))
+            .on("error", handleWriteError)
+            .pipe(process.stdout)
+            .on("error", handleWriteError)
+            .on("close", () => process.stdout.write("\n"));
+        } else {
+          createJsonStringifyStream(stats.toJson(statsOptions))
+            .on("error", handleWriteError)
+            .pipe(fs.createWriteStream(options.json))
+            .on("error", handleWriteError)
+            // Use stderr to logging
+            .on("close", () => {
+              process.stderr.write(
+                `[webpack-cli] ${this.colors.green(
+                  `stats are successfully stored as json to ${options.json}`,
+                )}\n`,
+              );
+            });
+        }
+      } else {
+        const printedStats = stats.toString(statsOptions);
+
+        // Avoid extra empty line when `stats: 'none'`
+        if (printedStats) {
+          this.logger.raw(printedStats);
+        }
+      }
+    };
+
+    const env =
+      isWatchCommand || options.watch
+        ? { WEBPACK_WATCH: true, ...options.env }
+        : { WEBPACK_BUNDLE: true, WEBPACK_BUILD: true, ...options.env };
+
+    options.argv = { ...options, env };
+
+    if (isWatchCommand) {
+      options.watch = true;
+    }
+
+    compiler = await this.createCompiler(options, callback);
+
+    if (!compiler) {
+      return;
+    }
+
+    const isWatch = (compiler) =>
+      compiler.compilers
+        ? compiler.compilers.some((compiler) => compiler.options.watch)
+        : compiler.options.watch;
+
+    if (isWatch(compiler) && this.needWatchStdin(compiler)) {
+      process.stdin.on("end", () => {
+        process.exit(0);
+      });
+      process.stdin.resume();
+    }
+  }
+}
+
+module.exports = WebpackCLI;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/CHANGELOG.md
new file mode 100644
index 0000000..0b55881
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/CHANGELOG.md
@@ -0,0 +1,440 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](http://keepachangelog.com/en/1.0.0/)
+and this project adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.html). (Format adopted after v3.0.0.)
+
+<!-- markdownlint-disable MD024 -->
+<!-- markdownlint-disable MD004 -->
+
+## [7.2.0] (2021-03-26)
+
+### Added
+
+- TypeScript typing for `parent` property on `Command` ([#1475])
+- TypeScript typing for `.attributeName()` on `Option` ([#1483])
+- support information in package ([#1477])
+
+### Changed
+
+- improvements to error messages, README, and tests
+- update dependencies
+
+## [7.1.0] (2021-02-15)
+
+### Added
+
+- support for named imports from ECMAScript modules ([#1440])
+- add `.cjs` to list of expected script file extensions ([#1449])
+- allow using option choices and variadic together ([#1454])
+
+### Fixed
+
+- replace use of deprecated `process.mainModule` ([#1448])
+- regression for legacy `command('*')` and call when command line includes options ([#1464])
+- regression for `on('command:*', ...)` and call when command line includes unknown options ([#1464])
+- display best error for combination of unknown command and unknown option (i.e. unknown command) ([#1464])
+
+### Changed
+
+- make TypeScript typings tests stricter ([#1453])
+- improvements to README and tests
+
+## [7.0.0] (2021-01-15)
+
+### Added
+
+- `.enablePositionalOptions()` to let program and subcommand reuse same option ([#1427])
+- `.passThroughOptions()` to pass options through to other programs without needing `--` ([#1427])
+- `.allowExcessArguments(false)` to show an error message if there are too many command-arguments on command line for the action handler ([#1409])
+- `.configureOutput()` to modify use of stdout and stderr or customise display of errors ([#1387])
+- use `.addHelpText()` to add text before or after the built-in help, for just current command or also for all subcommands ([#1296])
+- enhance Option class ([#1331])
+  - allow hiding options from help
+  - allow restricting option arguments to a list of choices
+  - allow setting how default value is shown in help
+- `.createOption()` to support subclassing of automatically created options (like `.createCommand()`) ([#1380])
+- refactor the code generating the help into a separate public Help class ([#1365])
+  - support sorting subcommands and options in help
+  - support specifying wrap width (columns)
+  - allow subclassing Help class
+  - allow configuring Help class without subclassing
+
+### Changed
+
+- *Breaking:* options are stored safely by default, not as properties on the command ([#1409])
+    - this especially affects accessing options on program, use `program.opts()`
+    - revert behaviour with `.storeOptionsAsProperties()`
+- *Breaking:* action handlers are passed options and command separately ([#1409])
+- deprecated callback parameter to `.help()` and `.outputHelp()` (removed from README) ([#1296])
+- *Breaking:* errors now displayed using `process.stderr.write()` instead of `console.error()`
+- deprecate `.on('--help')` (removed from README) ([#1296])
+- initialise the command description to empty string (previously undefined) ([#1365])
+- document and annotate deprecated routines ([#1349])
+
+### Fixed
+
+- wrapping bugs in help ([#1365])
+  - first line of command description was wrapping two characters early
+  - pad width calculation was not including help option and help command
+  - pad width calculation was including hidden options and commands
+- improve backwards compatibility for custom command event listeners ([#1403])
+  
+### Deleted
+
+- *Breaking:* `.passCommandToAction()` ([#1409])
+    - no longer needed as action handler is passed options and command
+- *Breaking:* "extra arguments" parameter to action handler ([#1409])
+    - if being used to detect excess arguments, there is now an error available by setting `.allowExcessArguments(false)`
+
+### Migration Tips
+
+The biggest change is the parsed option values. Previously the options were stored by default as properties on the command object, and now the options are stored separately.
+
+If you wish to restore the old behaviour and get running quickly you can call `.storeOptionsAsProperties()`. 
+To allow you to move to the new code patterns incrementally, the action handler will be passed the command _twice_,
+to match the new "options" and "command" parameters (see below).
+
+**program options**
+
+Use the `.opts()` method to access the options. This is available on any command but is used most with the program.
+
+```js
+program.option('-d, --debug');
+program.parse();
+// Old code before Commander 7
+if (program.debug) console.log(`Program name is ${program.name()}`);
+```
+
+```js
+// New code
+const options = program.opts();
+if (options.debug) console.log(`Program name is ${program.name()}`);
+```
+
+**action handler**
+
+The action handler gets passed a parameter for each command-argument you declared. Previously by default the next parameter was the command object with the options as properties. Now the next two parameters are instead the options and the command. If you
+only accessed the options there may be no code changes required.
+
+```js
+program
+  .command('compress <filename>')
+  .option('-t, --trace')
+  // Old code before Commander 7
+  .action((filename, cmd)) => {
+    if (cmd.trace) console.log(`Command name is ${cmd.name()}`);
+  });
+```
+
+```js
+  // New code
+  .action((filename, options, command)) => {
+    if (options.trace) console.log(`Command name is ${command.name()}`);
+  });
+```
+
+If you already set `.storeOptionsAsProperties(false)` you may still need to adjust your code.
+
+```js
+program
+  .command('compress <filename>')
+  .storeOptionsAsProperties(false)
+  .option('-t, --trace')
+  // Old code before Commander 7
+  .action((filename, command)) => {
+    if (command.opts().trace) console.log(`Command name is ${command.name()}`);
+  });
+```
+
+```js
+   // New code
+   .action((filename, options, command)) => {
+      if (command.opts().trace) console.log(`Command name is ${command.name()}`);
+   });
+```
+
+## [7.0.0-2] (2020-12-14)
+
+(Released in 7.0.0)
+
+## [7.0.0-1] (2020-11-21)
+
+(Released in 7.0.0)
+
+## [7.0.0-0] (2020-10-25)
+
+(Released in 7.0.0)
+
+## [6.2.1] (2020-12-13)
+
+### Fixed
+
+- some tests failed if directory path included a space ([1390])
+
+## [6.2.0] (2020-10-25)
+
+### Added
+
+- added 'tsx' file extension for stand-alone executable subcommands ([#1368])
+- documented second parameter to `.description()` to describe command arguments ([#1353])
+- documentation of special cases with options taking varying numbers of option-arguments ([#1332])
+- documentation for terminology ([#1361])
+  
+### Fixed
+
+- add missing TypeScript definition for `.addHelpCommand()' ([#1375])
+- removed blank line after "Arguments:" in help, to match "Options:" and "Commands:" ([#1360])
+
+### Changed
+
+- update dependencies
+
+## [6.1.0] (2020-08-28)
+
+### Added
+
+- include URL to relevant section of README for error for potential conflict between Command properties and option values ([#1306])
+- `.combineFlagAndOptionalValue(false)` to ease upgrade path from older versions of Commander ([#1326])
+- allow disabling the built-in help option using `.helpOption(false)` ([#1325])
+- allow just some arguments in `argumentDescription` to `.description()` ([#1323])
+
+### Changed
+
+- tidy async test and remove lint override ([#1312])
+
+### Fixed
+
+- executable subcommand launching when script path not known ([#1322])
+
+## [6.0.0] (2020-07-21)
+
+### Added
+
+- add support for variadic options ([#1250])
+- allow options to be added with just a short flag ([#1256])
+  - *Breaking* the option property has same case as flag. e.g. flag `-n` accessed as `opts().n` (previously uppercase)
+- *Breaking* throw an error if there might be a clash between option name and a Command property, with advice on how to resolve ([#1275])
+
+### Fixed
+
+- Options which contain -no- in the middle of the option flag should not be treated as negatable. ([#1301])
+
+## [6.0.0-0] (2020-06-20)
+
+(Released in 6.0.0)
+
+## [5.1.0] (2020-04-25)
+
+### Added
+
+- support for multiple command aliases, the first of which is shown in the auto-generated help ([#531], [#1236])
+- configuration support in `addCommand()` for `hidden` and `isDefault` ([#1232])
+
+### Fixed
+
+- omit masked help flags from the displayed help ([#645], [#1247])
+- remove old short help flag when change help flags using `helpOption` ([#1248])
+
+### Changed
+
+- remove use of `arguments` to improve auto-generated help in editors ([#1235])
+- rename `.command()` configuration `noHelp` to `hidden` (but not remove old support) ([#1232])
+- improvements to documentation
+- update dependencies
+- update tested versions of node
+- eliminate lint errors in TypeScript ([#1208])
+
+## [5.0.0] (2020-03-14)
+
+### Added
+
+* support for nested commands with action-handlers ([#1] [#764] [#1149])
+* `.addCommand()` for adding a separately configured command ([#764] [#1149])
+* allow a non-executable to be set as the default command ([#742] [#1149])
+* implicit help command when there are subcommands (previously only if executables) ([#1149])
+* customise implicit help command with `.addHelpCommand()` ([#1149])
+* display error message for unknown subcommand, by default ([#432] [#1088] [#1149])
+* display help for missing subcommand, by default ([#1088] [#1149])
+* combined short options as single argument may include boolean flags and value flag and value (e.g. `-a -b -p 80` can be written as `-abp80`) ([#1145])
+* `.parseOption()` includes short flag and long flag expansions ([#1145])
+* `.helpInformation()` returns help text as a string, previously a private routine ([#1169])
+* `.parse()` implicitly uses `process.argv` if arguments not specified ([#1172])
+* optionally specify where `.parse()` arguments "from", if not following node conventions ([#512] [#1172])
+* suggest help option along with unknown command error ([#1179])
+* TypeScript definition for `commands` property of `Command` ([#1184])
+* export `program` property ([#1195])
+* `createCommand` factory method to simplify subclassing ([#1191])
+
+### Fixed
+
+* preserve argument order in subcommands ([#508] [#962] [#1138])
+* do not emit `command:*` for executable subcommands ([#809] [#1149])
+* action handler called whether or not there are non-option arguments ([#1062] [#1149])
+* combining option short flag and value in single argument now works for subcommands ([#1145])
+* only add implicit help command when it will not conflict with other uses of argument ([#1153] [#1149])
+* implicit help command works with command aliases ([#948] [#1149])
+* options are validated whether or not there is an action handler ([#1149])
+
+### Changed
+
+* *Breaking* `.args` contains command arguments with just recognised options removed ([#1032] [#1138])
+* *Breaking* display error if required argument for command is missing ([#995] [#1149])
+* tighten TypeScript definition of custom option processing function passed to `.option()` ([#1119])
+* *Breaking* `.allowUnknownOption()` ([#802] [#1138])
+  * unknown options included in arguments passed to command action handler
+  * unknown options included in `.args`
+* only recognised option short flags and long flags are expanded (e.g. `-ab` or `--foo=bar`) ([#1145])
+* *Breaking* `.parseOptions()` ([#1138])
+  * `args` in returned result renamed `operands` and does not include anything after first unknown option
+  * `unknown` in returned result has arguments after first unknown option including operands, not just options and values
+* *Breaking* `.on('command:*', callback)` and other command events passed (changed) results from `.parseOptions`, i.e. operands and unknown  ([#1138])
+* refactor Option from prototype to class ([#1133])
+* refactor Command from prototype to class ([#1159])
+* changes to error handling ([#1165])
+  * throw for author error, not just display message
+  * preflight for variadic error
+  * add tips to missing subcommand executable
+* TypeScript fluent return types changed to be more subclass friendly, return `this` rather than `Command` ([#1180])
+* `.parseAsync` returns `Promise<this>` to be consistent with `.parse()` ([#1180])
+* update dependencies
+
+### Removed
+
+* removed EventEmitter from TypeScript definition for Command, eliminating implicit peer dependency on `@types/node` ([#1146])
+* removed private function `normalize` (the functionality has been integrated into `parseOptions`) ([#1145])
+* `parseExpectedArgs` is now private ([#1149])
+
+### Migration Tips
+
+If you use `.on('command:*')` or more complicated tests to detect an unrecognised subcommand, you may be able to delete the code and rely on the default behaviour.
+
+If you use `program.args` or more complicated tests to detect a missing subcommand, you may be able to delete the code and rely on the default behaviour.
+
+If you use `.command('*')` to add a default command, you may be be able to switch to `isDefault:true` with a named command.
+
+If you want to continue combining short options with optional values as though they were boolean flags, set `combineFlagAndOptionalValue(false)`
+to expand `-fb` to `-f -b` rather than `-f b`.
+
+## [5.0.0-4] (2020-03-03)
+
+(Released in 5.0.0)
+
+## [5.0.0-3] (2020-02-20)
+
+(Released in 5.0.0)
+
+## [5.0.0-2] (2020-02-10)
+
+(Released in 5.0.0)
+
+## [5.0.0-1] (2020-02-08)
+
+(Released in 5.0.0)
+
+## [5.0.0-0] (2020-02-02)
+
+(Released in 5.0.0)
+
+## Older versions
+
+* [4.x](./changelogs/CHANGELOG-4.md)
+* [3.x](./changelogs/CHANGELOG-3.md)
+* [2.x](./changelogs/CHANGELOG-2.md)
+* [1.x](./changelogs/CHANGELOG-1.md)
+* [0.x](./changelogs/CHANGELOG-0.md)
+
+[#1]: https://github.com/tj/commander.js/issues/1
+[#432]: https://github.com/tj/commander.js/issues/432
+[#508]: https://github.com/tj/commander.js/issues/508
+[#512]: https://github.com/tj/commander.js/issues/512
+[#531]: https://github.com/tj/commander.js/issues/531
+[#645]: https://github.com/tj/commander.js/issues/645
+[#742]: https://github.com/tj/commander.js/issues/742
+[#764]: https://github.com/tj/commander.js/issues/764
+[#802]: https://github.com/tj/commander.js/issues/802
+[#809]: https://github.com/tj/commander.js/issues/809
+[#948]: https://github.com/tj/commander.js/issues/948
+[#962]: https://github.com/tj/commander.js/issues/962
+[#995]: https://github.com/tj/commander.js/issues/995
+[#1032]: https://github.com/tj/commander.js/issues/1032
+[#1062]: https://github.com/tj/commander.js/pull/1062
+[#1088]: https://github.com/tj/commander.js/issues/1088
+[#1119]: https://github.com/tj/commander.js/pull/1119
+[#1133]: https://github.com/tj/commander.js/pull/1133
+[#1138]: https://github.com/tj/commander.js/pull/1138
+[#1145]: https://github.com/tj/commander.js/pull/1145
+[#1146]: https://github.com/tj/commander.js/pull/1146
+[#1149]: https://github.com/tj/commander.js/pull/1149
+[#1153]: https://github.com/tj/commander.js/issues/1153
+[#1159]: https://github.com/tj/commander.js/pull/1159
+[#1165]: https://github.com/tj/commander.js/pull/1165
+[#1169]: https://github.com/tj/commander.js/pull/1169
+[#1172]: https://github.com/tj/commander.js/pull/1172
+[#1179]: https://github.com/tj/commander.js/pull/1179
+[#1180]: https://github.com/tj/commander.js/pull/1180
+[#1184]: https://github.com/tj/commander.js/pull/1184
+[#1191]: https://github.com/tj/commander.js/pull/1191
+[#1195]: https://github.com/tj/commander.js/pull/1195
+[#1208]: https://github.com/tj/commander.js/pull/1208
+[#1232]: https://github.com/tj/commander.js/pull/1232
+[#1235]: https://github.com/tj/commander.js/pull/1235
+[#1236]: https://github.com/tj/commander.js/pull/1236
+[#1247]: https://github.com/tj/commander.js/pull/1247
+[#1248]: https://github.com/tj/commander.js/pull/1248
+[#1250]: https://github.com/tj/commander.js/pull/1250
+[#1256]: https://github.com/tj/commander.js/pull/1256
+[#1275]: https://github.com/tj/commander.js/pull/1275
+[#1296]: https://github.com/tj/commander.js/pull/1296
+[#1301]: https://github.com/tj/commander.js/issues/1301
+[#1306]: https://github.com/tj/commander.js/pull/1306
+[#1312]: https://github.com/tj/commander.js/pull/1312
+[#1322]: https://github.com/tj/commander.js/pull/1322
+[#1323]: https://github.com/tj/commander.js/pull/1323
+[#1325]: https://github.com/tj/commander.js/pull/1325
+[#1326]: https://github.com/tj/commander.js/pull/1326
+[#1331]: https://github.com/tj/commander.js/pull/1331
+[#1332]: https://github.com/tj/commander.js/pull/1332
+[#1349]: https://github.com/tj/commander.js/pull/1349
+[#1353]: https://github.com/tj/commander.js/pull/1353
+[#1360]: https://github.com/tj/commander.js/pull/1360
+[#1361]: https://github.com/tj/commander.js/pull/1361
+[#1365]: https://github.com/tj/commander.js/pull/1365
+[#1368]: https://github.com/tj/commander.js/pull/1368
+[#1375]: https://github.com/tj/commander.js/pull/1375
+[#1380]: https://github.com/tj/commander.js/pull/1380
+[#1387]: https://github.com/tj/commander.js/pull/1387
+[#1390]: https://github.com/tj/commander.js/pull/1390
+[#1403]: https://github.com/tj/commander.js/pull/1403
+[#1409]: https://github.com/tj/commander.js/pull/1409
+[#1427]: https://github.com/tj/commander.js/pull/1427
+[#1440]: https://github.com/tj/commander.js/pull/1440
+[#1448]: https://github.com/tj/commander.js/pull/1448
+[#1449]: https://github.com/tj/commander.js/pull/1449
+[#1453]: https://github.com/tj/commander.js/pull/1453
+[#1454]: https://github.com/tj/commander.js/pull/1454
+[#1464]: https://github.com/tj/commander.js/pull/1464
+[#1475]: https://github.com/tj/commander.js/pull/1475
+[#1477]: https://github.com/tj/commander.js/pull/1477
+[#1483]: https://github.com/tj/commander.js/pull/1483
+
+[Unreleased]: https://github.com/tj/commander.js/compare/master...develop
+[7.2.0]: https://github.com/tj/commander.js/compare/v7.1.0...v7.2.0
+[7.1.0]: https://github.com/tj/commander.js/compare/v7.0.0...v7.1.0
+[7.0.0]: https://github.com/tj/commander.js/compare/v6.2.1...v7.0.0
+[7.0.0-2]: https://github.com/tj/commander.js/compare/v7.0.0-1...v7.0.0-2
+[7.0.0-1]: https://github.com/tj/commander.js/compare/v7.0.0-0...v7.0.0-1
+[7.0.0-0]: https://github.com/tj/commander.js/compare/v6.2.0...v7.0.0-0
+[6.2.1]: https://github.com/tj/commander.js/compare/v6.2.0..v6.2.1
+[6.2.0]: https://github.com/tj/commander.js/compare/v6.1.0..v6.2.0
+[6.1.0]: https://github.com/tj/commander.js/compare/v6.0.0..v6.1.0
+[6.0.0]: https://github.com/tj/commander.js/compare/v5.1.0..v6.0.0
+[6.0.0-0]: https://github.com/tj/commander.js/compare/v5.1.0..v6.0.0-0
+[5.1.0]: https://github.com/tj/commander.js/compare/v5.0.0..v5.1.0
+[5.0.0]: https://github.com/tj/commander.js/compare/v4.1.1..v5.0.0
+[5.0.0-4]: https://github.com/tj/commander.js/compare/v5.0.0-3..v5.0.0-4
+[5.0.0-3]: https://github.com/tj/commander.js/compare/v5.0.0-2..v5.0.0-3
+[5.0.0-2]: https://github.com/tj/commander.js/compare/v5.0.0-1..v5.0.0-2
+[5.0.0-1]: https://github.com/tj/commander.js/compare/v5.0.0-0..v5.0.0-1
+[5.0.0-0]: https://github.com/tj/commander.js/compare/v4.1.1..v5.0.0-0
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/LICENSE b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/LICENSE
new file mode 100644
index 0000000..10f997a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/LICENSE
@@ -0,0 +1,22 @@
+(The MIT License)
+
+Copyright (c) 2011 TJ Holowaychuk <tj@vision-media.ca>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/Readme.md b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/Readme.md
new file mode 100644
index 0000000..d2a88a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/Readme.md
@@ -0,0 +1,917 @@
+# Commander.js
+
+[![Build Status](https://github.com/tj/commander.js/workflows/build/badge.svg)](https://github.com/tj/commander.js/actions?query=workflow%3A%22build%22)
+[![NPM Version](http://img.shields.io/npm/v/commander.svg?style=flat)](https://www.npmjs.org/package/commander)
+[![NPM Downloads](https://img.shields.io/npm/dm/commander.svg?style=flat)](https://npmcharts.com/compare/commander?minimal=true)
+[![Install Size](https://packagephobia.now.sh/badge?p=commander)](https://packagephobia.now.sh/result?p=commander)
+
+The complete solution for [node.js](http://nodejs.org) command-line interfaces.
+
+Read this in other languages: English | [简体中文](./Readme_zh-CN.md)
+
+- [Commander.js](#commanderjs)
+  - [Installation](#installation)
+  - [Declaring _program_ variable](#declaring-program-variable)
+  - [Options](#options)
+    - [Common option types, boolean and value](#common-option-types-boolean-and-value)
+    - [Default option value](#default-option-value)
+    - [Other option types, negatable boolean and boolean|value](#other-option-types-negatable-boolean-and-booleanvalue)
+    - [Required option](#required-option)
+    - [Variadic option](#variadic-option)
+    - [Version option](#version-option)
+    - [More configuration](#more-configuration)
+    - [Custom option processing](#custom-option-processing)
+  - [Commands](#commands)
+    - [Specify the argument syntax](#specify-the-argument-syntax)
+    - [Action handler](#action-handler)
+    - [Stand-alone executable (sub)commands](#stand-alone-executable-subcommands)
+  - [Automated help](#automated-help)
+    - [Custom help](#custom-help)
+    - [Display help from code](#display-help-from-code)
+    - [.usage and .name](#usage-and-name)
+    - [.helpOption(flags, description)](#helpoptionflags-description)
+    - [.addHelpCommand()](#addhelpcommand)
+    - [More configuration](#more-configuration-1)
+  - [Custom event listeners](#custom-event-listeners)
+  - [Bits and pieces](#bits-and-pieces)
+    - [.parse() and .parseAsync()](#parse-and-parseasync)
+    - [Parsing Configuration](#parsing-configuration)
+    - [Legacy options as properties](#legacy-options-as-properties)
+    - [TypeScript](#typescript)
+    - [createCommand()](#createcommand)
+    - [Node options such as `--harmony`](#node-options-such-as---harmony)
+    - [Debugging stand-alone executable subcommands](#debugging-stand-alone-executable-subcommands)
+    - [Override exit and output handling](#override-exit-and-output-handling)
+    - [Additional documentation](#additional-documentation)
+  - [Examples](#examples)
+  - [Support](#support)
+    - [Commander for enterprise](#commander-for-enterprise)
+
+For information about terms used in this document see: [terminology](./docs/terminology.md)
+
+## Installation
+
+```bash
+npm install commander
+```
+
+## Declaring _program_ variable
+
+Commander exports a global object which is convenient for quick programs.
+This is used in the examples in this README for brevity.
+
+```js
+const { program } = require('commander');
+program.version('0.0.1');
+```
+
+For larger programs which may use commander in multiple ways, including unit testing, it is better to create a local Command object to use.
+
+```js
+const { Command } = require('commander');
+const program = new Command();
+program.version('0.0.1');
+```
+
+For named imports in ECMAScript modules, import from `commander/esm.mjs`.
+
+```js
+// index.mjs
+import { Command } from 'commander/esm.mjs';
+const program = new Command();
+```
+
+And in TypeScript:
+
+```ts
+// index.ts
+import { Command } from 'commander';
+const program = new Command();
+```
+
+
+## Options
+
+Options are defined with the `.option()` method, also serving as documentation for the options. Each option can have a short flag (single character) and a long name, separated by a comma or space or vertical bar ('|').
+
+The parsed options can be accessed by calling `.opts()` on a `Command` object, and are passed to the action handler. Multi-word options such as "--template-engine" are camel-cased, becoming `program.opts().templateEngine` etc.
+
+Multiple short flags may optionally be combined in a single argument following the dash: boolean flags, followed by a single option taking a value (possibly followed by the value).
+For example `-a -b -p 80` may be written as `-ab -p80` or even `-abp80`.
+
+You can use `--` to indicate the end of the options, and any remaining arguments will be used without being interpreted.
+
+By default options on the command line are not positional, and can be specified before or after other arguments.
+
+### Common option types, boolean and value
+
+The two most used option types are a boolean option, and an option which takes its value
+from the following argument (declared with angle brackets like `--expect <value>`). Both are `undefined` unless specified on command line.  
+
+Example file: [options-common.js](./examples/options-common.js)
+
+```js
+program
+  .option('-d, --debug', 'output extra debugging')
+  .option('-s, --small', 'small pizza size')
+  .option('-p, --pizza-type <type>', 'flavour of pizza');
+
+program.parse(process.argv);
+
+const options = program.opts();
+if (options.debug) console.log(options);
+console.log('pizza details:');
+if (options.small) console.log('- small pizza size');
+if (options.pizzaType) console.log(`- ${options.pizzaType}`);
+```
+
+```bash
+$ pizza-options -d
+{ debug: true, small: undefined, pizzaType: undefined }
+pizza details:
+$ pizza-options -p
+error: option '-p, --pizza-type <type>' argument missing
+$ pizza-options -ds -p vegetarian
+{ debug: true, small: true, pizzaType: 'vegetarian' }
+pizza details:
+- small pizza size
+- vegetarian
+$ pizza-options --pizza-type=cheese
+pizza details:
+- cheese
+```
+
+`program.parse(arguments)` processes the arguments, leaving any args not consumed by the program options in the `program.args` array. The parameter is optional and defaults to `process.argv`.
+
+### Default option value
+
+You can specify a default value for an option which takes a value.
+
+Example file: [options-defaults.js](./examples/options-defaults.js)
+
+```js
+program
+  .option('-c, --cheese <type>', 'add the specified type of cheese', 'blue');
+
+program.parse();
+
+console.log(`cheese: ${program.opts().cheese}`);
+```
+
+```bash
+$ pizza-options
+cheese: blue
+$ pizza-options --cheese stilton
+cheese: stilton
+```
+
+### Other option types, negatable boolean and boolean|value
+
+You can define a boolean option long name with a leading `no-` to set the option value to false when used.
+Defined alone this also makes the option true by default.
+
+If you define `--foo` first, adding `--no-foo` does not change the default value from what it would
+otherwise be. You can specify a default boolean value for a boolean option and it can be overridden on command line.
+
+Example file: [options-negatable.js](./examples/options-negatable.js)
+
+```js
+program
+  .option('--no-sauce', 'Remove sauce')
+  .option('--cheese <flavour>', 'cheese flavour', 'mozzarella')
+  .option('--no-cheese', 'plain with no cheese')
+  .parse();
+
+const options = program.opts();
+const sauceStr = options.sauce ? 'sauce' : 'no sauce';
+const cheeseStr = (options.cheese === false) ? 'no cheese' : `${options.cheese} cheese`;
+console.log(`You ordered a pizza with ${sauceStr} and ${cheeseStr}`);
+```
+
+```bash
+$ pizza-options
+You ordered a pizza with sauce and mozzarella cheese
+$ pizza-options --sauce
+error: unknown option '--sauce'
+$ pizza-options --cheese=blue
+You ordered a pizza with sauce and blue cheese
+$ pizza-options --no-sauce --no-cheese
+You ordered a pizza with no sauce and no cheese
+```
+
+You can specify an option which may be used as a boolean option but may optionally take an option-argument
+(declared with square brackets like `--optional [value]`).
+
+Example file: [options-boolean-or-value.js](./examples/options-boolean-or-value.js)
+
+```js
+program
+  .option('-c, --cheese [type]', 'Add cheese with optional type');
+
+program.parse(process.argv);
+
+const options = program.opts();
+if (options.cheese === undefined) console.log('no cheese');
+else if (options.cheese === true) console.log('add cheese');
+else console.log(`add cheese type ${options.cheese}`);
+```
+
+```bash
+$ pizza-options
+no cheese
+$ pizza-options --cheese
+add cheese
+$ pizza-options --cheese mozzarella
+add cheese type mozzarella
+```
+
+For information about possible ambiguous cases, see [options taking varying arguments](./docs/options-taking-varying-arguments.md).
+
+### Required option
+
+You may specify a required (mandatory) option using `.requiredOption`. The option must have a value after parsing, usually specified on the command line, or perhaps from a default value (say from environment). The method is otherwise the same as `.option` in format, taking flags and description, and optional default value or custom processing.
+
+Example file: [options-required.js](./examples/options-required.js)
+
+```js
+program
+  .requiredOption('-c, --cheese <type>', 'pizza must have cheese');
+
+program.parse();
+```
+
+```bash
+$ pizza
+error: required option '-c, --cheese <type>' not specified
+```
+
+### Variadic option
+
+You may make an option variadic by appending `...` to the value placeholder when declaring the option. On the command line you
+can then specify multiple option-arguments, and the parsed option value will be an array. The extra arguments
+are read until the first argument starting with a dash. The special argument `--` stops option processing entirely. If a value
+is specified in the same argument as the option then no further values are read.
+
+Example file: [options-variadic.js](./examples/options-variadic.js)
+
+```js
+program
+  .option('-n, --number <numbers...>', 'specify numbers')
+  .option('-l, --letter [letters...]', 'specify letters');
+
+program.parse();
+
+console.log('Options: ', program.opts());
+console.log('Remaining arguments: ', program.args);
+```
+
+```bash
+$ collect -n 1 2 3 --letter a b c
+Options:  { number: [ '1', '2', '3' ], letter: [ 'a', 'b', 'c' ] }
+Remaining arguments:  []
+$ collect --letter=A -n80 operand
+Options:  { number: [ '80' ], letter: [ 'A' ] }
+Remaining arguments:  [ 'operand' ]
+$ collect --letter -n 1 -n 2 3 -- operand
+Options:  { number: [ '1', '2', '3' ], letter: true }
+Remaining arguments:  [ 'operand' ]
+```
+
+For information about possible ambiguous cases, see [options taking varying arguments](./docs/options-taking-varying-arguments.md).
+
+### Version option
+
+The optional `version` method adds handling for displaying the command version. The default option flags are `-V` and `--version`, and when present the command prints the version number and exits.
+
+```js
+program.version('0.0.1');
+```
+
+```bash
+$ ./examples/pizza -V
+0.0.1
+```
+
+You may change the flags and description by passing additional parameters to the `version` method, using
+the same syntax for flags as the `option` method.
+
+```js
+program.version('0.0.1', '-v, --vers', 'output the current version');
+```
+
+### More configuration
+
+You can add most options using the `.option()` method, but there are some additional features available
+by constructing an `Option` explicitly for less common cases.
+
+Example file: [options-extra.js](./examples/options-extra.js)
+
+```js
+program
+  .addOption(new Option('-s, --secret').hideHelp())
+  .addOption(new Option('-t, --timeout <delay>', 'timeout in seconds').default(60, 'one minute'))
+  .addOption(new Option('-d, --drink <size>', 'drink size').choices(['small', 'medium', 'large']));
+```
+
+```bash
+$ extra --help
+Usage: help [options]
+
+Options:
+  -t, --timeout <delay>  timeout in seconds (default: one minute)
+  -d, --drink <size>     drink cup size (choices: "small", "medium", "large")
+  -h, --help             display help for command
+
+$ extra --drink huge
+error: option '-d, --drink <size>' argument 'huge' is invalid. Allowed choices are small, medium, large.
+```
+
+### Custom option processing
+
+You may specify a function to do custom processing of option-arguments. The callback function receives two parameters,
+the user specified option-argument and the previous value for the option. It returns the new value for the option.
+
+This allows you to coerce the option-argument to the desired type, or accumulate values, or do entirely custom processing.
+
+You can optionally specify the default/starting value for the option after the function parameter.
+
+Example file: [options-custom-processing.js](./examples/options-custom-processing.js)
+
+```js
+function myParseInt(value, dummyPrevious) {
+  // parseInt takes a string and a radix
+  const parsedValue = parseInt(value, 10);
+  if (isNaN(parsedValue)) {
+    throw new commander.InvalidOptionArgumentError('Not a number.');
+  }
+  return parsedValue;
+}
+
+function increaseVerbosity(dummyValue, previous) {
+  return previous + 1;
+}
+
+function collect(value, previous) {
+  return previous.concat([value]);
+}
+
+function commaSeparatedList(value, dummyPrevious) {
+  return value.split(',');
+}
+
+program
+  .option('-f, --float <number>', 'float argument', parseFloat)
+  .option('-i, --integer <number>', 'integer argument', myParseInt)
+  .option('-v, --verbose', 'verbosity that can be increased', increaseVerbosity, 0)
+  .option('-c, --collect <value>', 'repeatable value', collect, [])
+  .option('-l, --list <items>', 'comma separated list', commaSeparatedList)
+;
+
+program.parse();
+
+const options = program.opts();
+if (options.float !== undefined) console.log(`float: ${options.float}`);
+if (options.integer !== undefined) console.log(`integer: ${options.integer}`);
+if (options.verbose > 0) console.log(`verbosity: ${options.verbose}`);
+if (options.collect.length > 0) console.log(options.collect);
+if (options.list !== undefined) console.log(options.list);
+```
+
+```bash
+$ custom -f 1e2
+float: 100
+$ custom --integer 2
+integer: 2
+$ custom -v -v -v
+verbose: 3
+$ custom -c a -c b -c c
+[ 'a', 'b', 'c' ]
+$ custom --list x,y,z
+[ 'x', 'y', 'z' ]
+```
+
+## Commands
+
+You can specify (sub)commands using `.command()` or `.addCommand()`. There are two ways these can be implemented: using an action handler attached to the command, or as a stand-alone executable file (described in more detail later). The subcommands may be nested ([example](./examples/nestedCommands.js)).
+
+In the first parameter to `.command()` you specify the command name and any command-arguments. The arguments may be `<required>` or `[optional]`, and the last argument may also be `variadic...`.
+
+You can use `.addCommand()` to add an already configured subcommand to the program.
+
+For example:
+
+```js
+// Command implemented using action handler (description is supplied separately to `.command`)
+// Returns new command for configuring.
+program
+  .command('clone <source> [destination]')
+  .description('clone a repository into a newly created directory')
+  .action((source, destination) => {
+    console.log('clone command called');
+  });
+
+// Command implemented using stand-alone executable file (description is second parameter to `.command`)
+// Returns `this` for adding more commands.
+program
+  .command('start <service>', 'start named service')
+  .command('stop [service]', 'stop named service, or all if no name supplied');
+
+// Command prepared separately.
+// Returns `this` for adding more commands.
+program
+  .addCommand(build.makeBuildCommand());
+```
+
+Configuration options can be passed with the call to `.command()` and `.addCommand()`. Specifying `hidden: true` will 
+remove the command from the generated help output. Specifying `isDefault: true` will run the subcommand if no other
+subcommand is specified ([example](./examples/defaultCommand.js)).
+
+### Specify the argument syntax
+
+You use `.arguments` to specify the expected command-arguments for the top-level command, and for subcommands they are usually
+included in the `.command` call. Angled brackets (e.g. `<required>`) indicate required command-arguments.
+Square brackets (e.g. `[optional]`) indicate optional command-arguments.
+You can optionally describe the arguments in the help by supplying a hash as second parameter to `.description()`.
+
+Example file: [arguments.js](./examples/arguments.js)
+
+```js
+program
+  .version('0.1.0')
+  .arguments('<username> [password]')
+  .description('test command', {
+    username: 'user to login',
+    password: 'password for user, if required'
+  })
+  .action((username, password) => {
+    console.log('username:', username);
+    console.log('environment:', password || 'no password given');
+  });
+```
+
+ The last argument of a command can be variadic, and only the last argument.  To make an argument variadic you
+ append `...` to the argument name. For example:
+
+```js
+program
+  .version('0.1.0')
+  .command('rmdir <dirs...>')
+  .action(function (dirs) {
+    dirs.forEach((dir) => {
+      console.log('rmdir %s', dir);
+    });
+  });
+```
+
+The variadic argument is passed to the action handler as an array.
+
+### Action handler
+
+The action handler gets passed a parameter for each command-argument you declared, and two additional parameters
+which are the parsed options and the command object itself. 
+
+Example file: [thank.js](./examples/thank.js)
+
+```js
+program
+  .arguments('<name>')
+  .option('-t, --title <honorific>', 'title to use before name')
+  .option('-d, --debug', 'display some debugging')
+  .action((name, options, command) => {
+    if (options.debug) {
+      console.error('Called %s with options %o', command.name(), options);
+    }
+    const title = options.title ? `${options.title} ` : '';
+    console.log(`Thank-you ${title}${name}`);
+  });
+```
+
+You may supply an `async` action handler, in which case you call `.parseAsync` rather than `.parse`.
+
+```js
+async function run() { /* code goes here */ }
+
+async function main() {
+  program
+    .command('run')
+    .action(run);
+  await program.parseAsync(process.argv);
+}
+```
+
+A command's options and arguments on the command line are validated when the command is used. Any unknown options or missing arguments will be reported as an error. You can suppress the unknown option checks with `.allowUnknownOption()`. By default it is not an error to
+pass more arguments than declared, but you can make this an error with `.allowExcessArguments(false)`.
+
+### Stand-alone executable (sub)commands
+
+When `.command()` is invoked with a description argument, this tells Commander that you're going to use stand-alone executables for subcommands.
+Commander will search the executables in the directory of the entry script (like `./examples/pm`) with the name `program-subcommand`, like `pm-install`, `pm-search`.
+You can specify a custom name with the `executableFile` configuration option.
+
+You handle the options for an executable (sub)command in the executable, and don't declare them at the top-level.
+
+Example file: [pm](./examples/pm)
+
+```js
+program
+  .version('0.1.0')
+  .command('install [name]', 'install one or more packages')
+  .command('search [query]', 'search with optional query')
+  .command('update', 'update installed packages', { executableFile: 'myUpdateSubCommand' })
+  .command('list', 'list packages installed', { isDefault: true });
+
+program.parse(process.argv);
+```
+
+If the program is designed to be installed globally, make sure the executables have proper modes, like `755`.
+
+## Automated help
+
+The help information is auto-generated based on the information commander already knows about your program. The default
+help option is `-h,--help`.
+
+Example file: [pizza](./examples/pizza)
+
+```bash
+$ node ./examples/pizza --help
+Usage: pizza [options]
+
+An application for pizza ordering
+
+Options:
+  -p, --peppers        Add peppers
+  -c, --cheese <type>  Add the specified type of cheese (default: "marble")
+  -C, --no-cheese      You do not want any cheese
+  -h, --help           display help for command
+```
+
+A `help` command is added by default if your command has subcommands. It can be used alone, or with a subcommand name to show
+further help for the subcommand. These are effectively the same if the `shell` program has implicit help:
+
+```bash
+shell help
+shell --help
+
+shell help spawn
+shell spawn --help
+```
+
+### Custom help
+
+You can add extra text to be displayed along with the built-in help. 
+
+Example file: [custom-help](./examples/custom-help)
+
+```js
+program
+  .option('-f, --foo', 'enable some foo');
+
+program.addHelpText('after', `
+
+Example call:
+  $ custom-help --help`);
+```
+
+Yields the following help output:
+
+```Text
+Usage: custom-help [options]
+
+Options:
+  -f, --foo   enable some foo
+  -h, --help  display help for command
+
+Example call:
+  $ custom-help --help
+```
+
+The positions in order displayed are:
+
+- `beforeAll`: add to the program for a global banner or header
+- `before`: display extra information before built-in help
+- `after`: display extra information after built-in help
+- `afterAll`: add to the program for a global footer (epilog)
+
+The positions "beforeAll" and "afterAll" apply to the command and all its subcommands. 
+
+The second parameter can be a string, or a function returning a string. The function is passed a context object for your convenience. The properties are:
+
+- error: a boolean for whether the help is being displayed due to a usage error
+- command: the Command which is displaying the help
+
+### Display help from code
+
+`.help()`: display help information and exit immediately. You can optionally pass `{ error: true }` to display on stderr and exit with an error status.
+
+`.outputHelp()`: output help information without exiting. You can optionally pass `{ error: true }` to display on stderr.
+
+`.helpInformation()`: get the built-in command help information as a string for processing or displaying yourself.
+
+### .usage and .name
+
+These allow you to customise the usage description in the first line of the help. The name is otherwise
+deduced from the (full) program arguments. Given:
+
+```js
+program
+  .name("my-command")
+  .usage("[global options] command")
+```
+
+The help will start with:
+
+```Text
+Usage: my-command [global options] command
+```
+
+### .helpOption(flags, description)
+
+By default every command has a help option. Override the default help flags and description. Pass false to disable the built-in help option.
+
+```js
+program
+  .helpOption('-e, --HELP', 'read more information');
+```
+
+### .addHelpCommand()
+
+A help command is added by default if your command has subcommands. You can explicitly turn on or off the implicit help command with `.addHelpCommand()` and `.addHelpCommand(false)`.
+
+You can both turn on and customise the help command by supplying the name and description:
+
+```js
+program.addHelpCommand('assist [command]', 'show assistance');
+```
+
+### More configuration
+
+The built-in help is formatted using the Help class.
+You can configure the Help behaviour by modifying data properties and methods using `.configureHelp()`, or by subclassing using `.createHelp()` if you prefer.
+
+The data properties are:
+
+- `helpWidth`: specify the wrap width, useful for unit tests
+- `sortSubcommands`: sort the subcommands alphabetically
+- `sortOptions`: sort the options alphabetically
+
+There are methods getting the visible lists of arguments, options, and subcommands. There are methods for formatting the items in the lists, with each item having a _term_ and _description_. Take a look at `.formatHelp()` to see how they are used.
+
+Example file: [configure-help.js](./examples/configure-help.js)
+
+```
+program.configureHelp({
+  sortSubcommands: true,
+  subcommandTerm: (cmd) => cmd.name() // Just show the name, instead of short usage.
+});
+```
+
+## Custom event listeners
+
+You can execute custom actions by listening to command and option events.
+
+```js
+program.on('option:verbose', function () {
+  process.env.VERBOSE = this.opts().verbose;
+});
+
+program.on('command:*', function (operands) {
+  console.error(`error: unknown command '${operands[0]}'`);
+  const availableCommands = program.commands.map(cmd => cmd.name());
+  mySuggestBestMatch(operands[0], availableCommands);
+  process.exitCode = 1;
+});
+```
+
+## Bits and pieces
+
+### .parse() and .parseAsync()
+
+The first argument to `.parse` is the array of strings to parse. You may omit the parameter to implicitly use `process.argv`.
+
+If the arguments follow different conventions than node you can pass a `from` option in the second parameter:
+
+- 'node': default, `argv[0]` is the application and `argv[1]` is the script being run, with user parameters after that
+- 'electron': `argv[1]` varies depending on whether the electron application is packaged
+- 'user': all of the arguments from the user
+
+For example:
+
+```js
+program.parse(process.argv); // Explicit, node conventions
+program.parse(); // Implicit, and auto-detect electron
+program.parse(['-f', 'filename'], { from: 'user' });
+```
+
+### Parsing Configuration
+
+If the default parsing does not suit your needs, there are some behaviours to support other usage patterns.
+
+By default program options are recognised before and after subcommands. To only look for program options before subcommands, use `.enablePositionalOptions()`. This lets you use
+an option for a different purpose in subcommands.
+
+Example file: [positional-options.js](./examples/positional-options.js)
+
+With positional options, the `-b` is a program option in the first line and a subcommand option in the second line:
+
+```sh
+program -b subcommand
+program subcommand -b
+```
+
+By default options are recognised before and after command-arguments. To only process options that come
+before the command-arguments, use `.passThroughOptions()`. This lets you pass the  arguments and following options through to another program
+without needing to use `--` to end the option processing. 
+To use pass through options in a subcommand, the program needs to enable positional options.
+
+Example file: [pass-through-options.js](./examples/pass-through-options.js)
+
+With pass through options, the `--port=80` is a program option in the first line and passed through as a command-argument in the second line:
+
+```sh
+program --port=80 arg
+program arg --port=80
+```
+
+By default the option processing shows an error for an unknown option. To have an unknown option treated as an ordinary command-argument and continue looking for options, use `.allowUnknownOption()`. This lets you mix known and unknown options.
+
+By default the argument processing does not display an error for more command-arguments than expected.
+To display an error for excess arguments, use`.allowExcessArguments(false)`.
+
+### Legacy options as properties 
+
+Before Commander 7, the option values were stored as properties on the command.
+This was convenient to code but the downside was possible clashes with
+existing properties of `Command`. You can revert to the old behaviour to run unmodified legacy code by using `.storeOptionsAsProperties()`.
+
+```js
+program
+  .storeOptionsAsProperties()
+  .option('-d, --debug')
+  .action((commandAndOptions) => {
+    if (commandAndOptions.debug) {
+      console.error(`Called ${commandAndOptions.name()}`);
+    }
+  });
+```
+
+### TypeScript
+
+If you use `ts-node` and  stand-alone executable subcommands written as `.ts` files, you need to call your program through node to get the subcommands called correctly. e.g.
+
+```bash
+node -r ts-node/register pm.ts
+```
+
+### createCommand()
+
+This factory function creates a new command. It is exported and may be used instead of using `new`, like:
+
+```js
+const { createCommand } = require('commander');
+const program = createCommand();
+```
+
+`createCommand` is also a method of the Command object, and creates a new command rather than a subcommand. This gets used internally
+when creating subcommands using `.command()`, and you may override it to
+customise the new subcommand (example file [custom-command-class.js](./examples/custom-command-class.js)).
+
+### Node options such as `--harmony`
+
+You can enable `--harmony` option in two ways:
+
+- Use `#! /usr/bin/env node --harmony` in the subcommands scripts. (Note Windows does not support this pattern.)
+- Use the `--harmony` option when call the command, like `node --harmony examples/pm publish`. The `--harmony` option will be preserved when spawning subcommand process.
+
+### Debugging stand-alone executable subcommands
+
+An executable subcommand is launched as a separate child process.
+
+If you are using the node inspector for [debugging](https://nodejs.org/en/docs/guides/debugging-getting-started/) executable subcommands using `node --inspect` et al,
+the inspector port is incremented by 1 for the spawned subcommand.
+
+If you are using VSCode to debug executable subcommands you need to set the `"autoAttachChildProcesses": true` flag in your launch.json configuration.
+
+### Override exit and output handling
+
+By default Commander calls `process.exit` when it detects errors, or after displaying the help or version. You can override
+this behaviour and optionally supply a callback. The default override throws a `CommanderError`.
+
+The override callback is passed a `CommanderError` with properties `exitCode` number, `code` string, and `message`. The default override behaviour is to throw the error, except for async handling of executable subcommand completion which carries on. The normal display of error messages or version or help
+is not affected by the override which is called after the display.
+
+```js
+program.exitOverride();
+
+try {
+  program.parse(process.argv);
+} catch (err) {
+  // custom processing...
+}
+```
+
+By default Commander is configured for a command-line application and writes to stdout and stderr.
+You can modify this behaviour for custom applications. In addition, you can modify the display of error messages.
+
+Example file: [configure-output.js](./examples/configure-output.js)
+
+
+```js
+function errorColor(str) {
+  // Add ANSI escape codes to display text in red.
+  return `\x1b[31m${str}\x1b[0m`;
+}
+
+program
+  .configureOutput({
+    // Visibly override write routines as example!
+    writeOut: (str) => process.stdout.write(`[OUT] ${str}`),
+    writeErr: (str) => process.stdout.write(`[ERR] ${str}`),
+    // Highlight errors in color.
+    outputError: (str, write) => write(errorColor(str))
+  });
+```
+
+### Additional documentation
+
+There is more information available about:
+
+- [deprecated](./docs/deprecated.md) features still supported for backwards compatibility
+- [options taking varying arguments](./docs/options-taking-varying-arguments.md)
+
+## Examples
+
+In a single command program, you might not need an action handler.
+
+Example file: [pizza](./examples/pizza)
+
+```js
+const { program } = require('commander');
+
+program
+  .description('An application for pizza ordering')
+  .option('-p, --peppers', 'Add peppers')
+  .option('-c, --cheese <type>', 'Add the specified type of cheese', 'marble')
+  .option('-C, --no-cheese', 'You do not want any cheese');
+
+program.parse();
+
+const options = program.opts();
+console.log('you ordered a pizza with:');
+if (options.peppers) console.log('  - peppers');
+const cheese = !options.cheese ? 'no' : options.cheese;
+console.log('  - %s cheese', cheese);
+```
+
+In a multi-command program, you will have action handlers for each command (or stand-alone executables for the commands).
+
+Example file: [deploy](./examples/deploy)
+
+```js
+const { Command } = require('commander');
+const program = new Command();
+
+program
+  .version('0.0.1')
+  .option('-c, --config <path>', 'set config path', './deploy.conf');
+
+program
+  .command('setup [env]')
+  .description('run setup commands for all envs')
+  .option('-s, --setup_mode <mode>', 'Which setup mode to use', 'normal')
+  .action((env, options) => {
+    env = env || 'all';
+    console.log('read config from %s', program.opts().config);
+    console.log('setup for %s env(s) with %s mode', env, options.setup_mode);
+  });
+
+program
+  .command('exec <script>')
+  .alias('ex')
+  .description('execute the given remote cmd')
+  .option('-e, --exec_mode <mode>', 'Which exec mode to use', 'fast')
+  .action((script, options) => {
+    console.log('read config from %s', program.opts().config);
+    console.log('exec "%s" using %s mode and config %s', script, options.exec_mode, program.opts().config);
+  }).addHelpText('after', `
+Examples:
+  $ deploy exec sequential
+  $ deploy exec async`
+  );
+  
+program.parse(process.argv);
+```
+
+More samples can be found in the [examples](https://github.com/tj/commander.js/tree/master/examples) directory.
+
+## Support
+
+The current version of Commander is fully supported on Long Term Support versions of node, and requires at least node v10.
+(For older versions of node, use an older version of Commander. Commander version 2.x has the widest support.)
+
+The main forum for free and community support is the project [Issues](https://github.com/tj/commander.js/issues) on GitHub.
+
+### Commander for enterprise
+
+Available as part of the Tidelift Subscription
+
+The maintainers of Commander and thousands of other packages are working with Tidelift to deliver commercial support and maintenance for the open source dependencies you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact dependencies you use. [Learn more.](https://tidelift.com/subscription/pkg/npm-commander?utm_source=npm-commander&utm_medium=referral&utm_campaign=enterprise&utm_term=repo)
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/esm.mjs b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/esm.mjs
new file mode 100644
index 0000000..60bf252
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/esm.mjs
@@ -0,0 +1,4 @@
+import commander from './index.js';
+
+// wrapper to provide named exports for ESM.
+export const { program, Option, Command, CommanderError, InvalidOptionArgumentError, Help, createCommand } = commander;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/index.js b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/index.js
new file mode 100644
index 0000000..985a8cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/index.js
@@ -0,0 +1,2217 @@
+/**
+ * Module dependencies.
+ */
+
+const EventEmitter = require('events').EventEmitter;
+const childProcess = require('child_process');
+const path = require('path');
+const fs = require('fs');
+
+// @ts-check
+
+// Although this is a class, methods are static in style to allow override using subclass or just functions.
+class Help {
+  constructor() {
+    this.helpWidth = undefined;
+    this.sortSubcommands = false;
+    this.sortOptions = false;
+  }
+
+  /**
+   * Get an array of the visible subcommands. Includes a placeholder for the implicit help command, if there is one.
+   *
+   * @param {Command} cmd
+   * @returns {Command[]}
+   */
+
+  visibleCommands(cmd) {
+    const visibleCommands = cmd.commands.filter(cmd => !cmd._hidden);
+    if (cmd._hasImplicitHelpCommand()) {
+      // Create a command matching the implicit help command.
+      const args = cmd._helpCommandnameAndArgs.split(/ +/);
+      const helpCommand = cmd.createCommand(args.shift())
+        .helpOption(false);
+      helpCommand.description(cmd._helpCommandDescription);
+      helpCommand._parseExpectedArgs(args);
+      visibleCommands.push(helpCommand);
+    }
+    if (this.sortSubcommands) {
+      visibleCommands.sort((a, b) => {
+        return a.name().localeCompare(b.name());
+      });
+    }
+    return visibleCommands;
+  }
+
+  /**
+   * Get an array of the visible options. Includes a placeholder for the implicit help option, if there is one.
+   *
+   * @param {Command} cmd
+   * @returns {Option[]}
+   */
+
+  visibleOptions(cmd) {
+    const visibleOptions = cmd.options.filter((option) => !option.hidden);
+    // Implicit help
+    const showShortHelpFlag = cmd._hasHelpOption && cmd._helpShortFlag && !cmd._findOption(cmd._helpShortFlag);
+    const showLongHelpFlag = cmd._hasHelpOption && !cmd._findOption(cmd._helpLongFlag);
+    if (showShortHelpFlag || showLongHelpFlag) {
+      let helpOption;
+      if (!showShortHelpFlag) {
+        helpOption = cmd.createOption(cmd._helpLongFlag, cmd._helpDescription);
+      } else if (!showLongHelpFlag) {
+        helpOption = cmd.createOption(cmd._helpShortFlag, cmd._helpDescription);
+      } else {
+        helpOption = cmd.createOption(cmd._helpFlags, cmd._helpDescription);
+      }
+      visibleOptions.push(helpOption);
+    }
+    if (this.sortOptions) {
+      const getSortKey = (option) => {
+        // WYSIWYG for order displayed in help with short before long, no special handling for negated.
+        return option.short ? option.short.replace(/^-/, '') : option.long.replace(/^--/, '');
+      };
+      visibleOptions.sort((a, b) => {
+        return getSortKey(a).localeCompare(getSortKey(b));
+      });
+    }
+    return visibleOptions;
+  }
+
+  /**
+   * Get an array of the arguments which have descriptions.
+   *
+   * @param {Command} cmd
+   * @returns {{ term: string, description:string }[]}
+   */
+
+  visibleArguments(cmd) {
+    if (cmd._argsDescription && cmd._args.length) {
+      return cmd._args.map((argument) => {
+        return { term: argument.name, description: cmd._argsDescription[argument.name] || '' };
+      }, 0);
+    }
+    return [];
+  }
+
+  /**
+   * Get the command term to show in the list of subcommands.
+   *
+   * @param {Command} cmd
+   * @returns {string}
+   */
+
+  subcommandTerm(cmd) {
+    // Legacy. Ignores custom usage string, and nested commands.
+    const args = cmd._args.map(arg => humanReadableArgName(arg)).join(' ');
+    return cmd._name +
+      (cmd._aliases[0] ? '|' + cmd._aliases[0] : '') +
+      (cmd.options.length ? ' [options]' : '') + // simplistic check for non-help option
+      (args ? ' ' + args : '');
+  }
+
+  /**
+   * Get the option term to show in the list of options.
+   *
+   * @param {Option} option
+   * @returns {string}
+   */
+
+  optionTerm(option) {
+    return option.flags;
+  }
+
+  /**
+   * Get the longest command term length.
+   *
+   * @param {Command} cmd
+   * @param {Help} helper
+   * @returns {number}
+   */
+
+  longestSubcommandTermLength(cmd, helper) {
+    return helper.visibleCommands(cmd).reduce((max, command) => {
+      return Math.max(max, helper.subcommandTerm(command).length);
+    }, 0);
+  };
+
+  /**
+   * Get the longest option term length.
+   *
+   * @param {Command} cmd
+   * @param {Help} helper
+   * @returns {number}
+   */
+
+  longestOptionTermLength(cmd, helper) {
+    return helper.visibleOptions(cmd).reduce((max, option) => {
+      return Math.max(max, helper.optionTerm(option).length);
+    }, 0);
+  };
+
+  /**
+   * Get the longest argument term length.
+   *
+   * @param {Command} cmd
+   * @param {Help} helper
+   * @returns {number}
+   */
+
+  longestArgumentTermLength(cmd, helper) {
+    return helper.visibleArguments(cmd).reduce((max, argument) => {
+      return Math.max(max, argument.term.length);
+    }, 0);
+  };
+
+  /**
+   * Get the command usage to be displayed at the top of the built-in help.
+   *
+   * @param {Command} cmd
+   * @returns {string}
+   */
+
+  commandUsage(cmd) {
+    // Usage
+    let cmdName = cmd._name;
+    if (cmd._aliases[0]) {
+      cmdName = cmdName + '|' + cmd._aliases[0];
+    }
+    let parentCmdNames = '';
+    for (let parentCmd = cmd.parent; parentCmd; parentCmd = parentCmd.parent) {
+      parentCmdNames = parentCmd.name() + ' ' + parentCmdNames;
+    }
+    return parentCmdNames + cmdName + ' ' + cmd.usage();
+  }
+
+  /**
+   * Get the description for the command.
+   *
+   * @param {Command} cmd
+   * @returns {string}
+   */
+
+  commandDescription(cmd) {
+    // @ts-ignore: overloaded return type
+    return cmd.description();
+  }
+
+  /**
+   * Get the command description to show in the list of subcommands.
+   *
+   * @param {Command} cmd
+   * @returns {string}
+   */
+
+  subcommandDescription(cmd) {
+    // @ts-ignore: overloaded return type
+    return cmd.description();
+  }
+
+  /**
+   * Get the option description to show in the list of options.
+   *
+   * @param {Option} option
+   * @return {string}
+   */
+
+  optionDescription(option) {
+    if (option.negate) {
+      return option.description;
+    }
+    const extraInfo = [];
+    if (option.argChoices) {
+      extraInfo.push(
+        // use stringify to match the display of the default value
+        `choices: ${option.argChoices.map((choice) => JSON.stringify(choice)).join(', ')}`);
+    }
+    if (option.defaultValue !== undefined) {
+      extraInfo.push(`default: ${option.defaultValueDescription || JSON.stringify(option.defaultValue)}`);
+    }
+    if (extraInfo.length > 0) {
+      return `${option.description} (${extraInfo.join(', ')})`;
+    }
+    return option.description;
+  };
+
+  /**
+   * Generate the built-in help text.
+   *
+   * @param {Command} cmd
+   * @param {Help} helper
+   * @returns {string}
+   */
+
+  formatHelp(cmd, helper) {
+    const termWidth = helper.padWidth(cmd, helper);
+    const helpWidth = helper.helpWidth || 80;
+    const itemIndentWidth = 2;
+    const itemSeparatorWidth = 2; // between term and description
+    function formatItem(term, description) {
+      if (description) {
+        const fullText = `${term.padEnd(termWidth + itemSeparatorWidth)}${description}`;
+        return helper.wrap(fullText, helpWidth - itemIndentWidth, termWidth + itemSeparatorWidth);
+      }
+      return term;
+    };
+    function formatList(textArray) {
+      return textArray.join('\n').replace(/^/gm, ' '.repeat(itemIndentWidth));
+    }
+
+    // Usage
+    let output = [`Usage: ${helper.commandUsage(cmd)}`, ''];
+
+    // Description
+    const commandDescription = helper.commandDescription(cmd);
+    if (commandDescription.length > 0) {
+      output = output.concat([commandDescription, '']);
+    }
+
+    // Arguments
+    const argumentList = helper.visibleArguments(cmd).map((argument) => {
+      return formatItem(argument.term, argument.description);
+    });
+    if (argumentList.length > 0) {
+      output = output.concat(['Arguments:', formatList(argumentList), '']);
+    }
+
+    // Options
+    const optionList = helper.visibleOptions(cmd).map((option) => {
+      return formatItem(helper.optionTerm(option), helper.optionDescription(option));
+    });
+    if (optionList.length > 0) {
+      output = output.concat(['Options:', formatList(optionList), '']);
+    }
+
+    // Commands
+    const commandList = helper.visibleCommands(cmd).map((cmd) => {
+      return formatItem(helper.subcommandTerm(cmd), helper.subcommandDescription(cmd));
+    });
+    if (commandList.length > 0) {
+      output = output.concat(['Commands:', formatList(commandList), '']);
+    }
+
+    return output.join('\n');
+  }
+
+  /**
+   * Calculate the pad width from the maximum term length.
+   *
+   * @param {Command} cmd
+   * @param {Help} helper
+   * @returns {number}
+   */
+
+  padWidth(cmd, helper) {
+    return Math.max(
+      helper.longestOptionTermLength(cmd, helper),
+      helper.longestSubcommandTermLength(cmd, helper),
+      helper.longestArgumentTermLength(cmd, helper)
+    );
+  };
+
+  /**
+   * Wrap the given string to width characters per line, with lines after the first indented.
+   * Do not wrap if insufficient room for wrapping (minColumnWidth), or string is manually formatted.
+   *
+   * @param {string} str
+   * @param {number} width
+   * @param {number} indent
+   * @param {number} [minColumnWidth=40]
+   * @return {string}
+   *
+   */
+
+  wrap(str, width, indent, minColumnWidth = 40) {
+    // Detect manually wrapped and indented strings by searching for line breaks
+    // followed by multiple spaces/tabs.
+    if (str.match(/[\n]\s+/)) return str;
+    // Do not wrap if not enough room for a wrapped column of text (as could end up with a word per line).
+    const columnWidth = width - indent;
+    if (columnWidth < minColumnWidth) return str;
+
+    const leadingStr = str.substr(0, indent);
+    const columnText = str.substr(indent);
+
+    const indentString = ' '.repeat(indent);
+    const regex = new RegExp('.{1,' + (columnWidth - 1) + '}([\\s\u200B]|$)|[^\\s\u200B]+?([\\s\u200B]|$)', 'g');
+    const lines = columnText.match(regex) || [];
+    return leadingStr + lines.map((line, i) => {
+      if (line.slice(-1) === '\n') {
+        line = line.slice(0, line.length - 1);
+      }
+      return ((i > 0) ? indentString : '') + line.trimRight();
+    }).join('\n');
+  }
+}
+
+class Option {
+  /**
+   * Initialize a new `Option` with the given `flags` and `description`.
+   *
+   * @param {string} flags
+   * @param {string} [description]
+   */
+
+  constructor(flags, description) {
+    this.flags = flags;
+    this.description = description || '';
+
+    this.required = flags.includes('<'); // A value must be supplied when the option is specified.
+    this.optional = flags.includes('['); // A value is optional when the option is specified.
+    // variadic test ignores <value,...> et al which might be used to describe custom splitting of single argument
+    this.variadic = /\w\.\.\.[>\]]$/.test(flags); // The option can take multiple values.
+    this.mandatory = false; // The option must have a value after parsing, which usually means it must be specified on command line.
+    const optionFlags = _parseOptionFlags(flags);
+    this.short = optionFlags.shortFlag;
+    this.long = optionFlags.longFlag;
+    this.negate = false;
+    if (this.long) {
+      this.negate = this.long.startsWith('--no-');
+    }
+    this.defaultValue = undefined;
+    this.defaultValueDescription = undefined;
+    this.parseArg = undefined;
+    this.hidden = false;
+    this.argChoices = undefined;
+  }
+
+  /**
+   * Set the default value, and optionally supply the description to be displayed in the help.
+   *
+   * @param {any} value
+   * @param {string} [description]
+   * @return {Option}
+   */
+
+  default(value, description) {
+    this.defaultValue = value;
+    this.defaultValueDescription = description;
+    return this;
+  };
+
+  /**
+   * Set the custom handler for processing CLI option arguments into option values.
+   *
+   * @param {Function} [fn]
+   * @return {Option}
+   */
+
+  argParser(fn) {
+    this.parseArg = fn;
+    return this;
+  };
+
+  /**
+   * Whether the option is mandatory and must have a value after parsing.
+   *
+   * @param {boolean} [mandatory=true]
+   * @return {Option}
+   */
+
+  makeOptionMandatory(mandatory = true) {
+    this.mandatory = !!mandatory;
+    return this;
+  };
+
+  /**
+   * Hide option in help.
+   *
+   * @param {boolean} [hide=true]
+   * @return {Option}
+   */
+
+  hideHelp(hide = true) {
+    this.hidden = !!hide;
+    return this;
+  };
+
+  /**
+   * @api private
+   */
+
+  _concatValue(value, previous) {
+    if (previous === this.defaultValue || !Array.isArray(previous)) {
+      return [value];
+    }
+
+    return previous.concat(value);
+  }
+
+  /**
+   * Only allow option value to be one of choices.
+   *
+   * @param {string[]} values
+   * @return {Option}
+   */
+
+  choices(values) {
+    this.argChoices = values;
+    this.parseArg = (arg, previous) => {
+      if (!values.includes(arg)) {
+        throw new InvalidOptionArgumentError(`Allowed choices are ${values.join(', ')}.`);
+      }
+      if (this.variadic) {
+        return this._concatValue(arg, previous);
+      }
+      return arg;
+    };
+    return this;
+  };
+
+  /**
+   * Return option name.
+   *
+   * @return {string}
+   */
+
+  name() {
+    if (this.long) {
+      return this.long.replace(/^--/, '');
+    }
+    return this.short.replace(/^-/, '');
+  };
+
+  /**
+   * Return option name, in a camelcase format that can be used
+   * as a object attribute key.
+   *
+   * @return {string}
+   * @api private
+   */
+
+  attributeName() {
+    return camelcase(this.name().replace(/^no-/, ''));
+  };
+
+  /**
+   * Check if `arg` matches the short or long flag.
+   *
+   * @param {string} arg
+   * @return {boolean}
+   * @api private
+   */
+
+  is(arg) {
+    return this.short === arg || this.long === arg;
+  };
+}
+
+/**
+ * CommanderError class
+ * @class
+ */
+class CommanderError extends Error {
+  /**
+   * Constructs the CommanderError class
+   * @param {number} exitCode suggested exit code which could be used with process.exit
+   * @param {string} code an id string representing the error
+   * @param {string} message human-readable description of the error
+   * @constructor
+   */
+  constructor(exitCode, code, message) {
+    super(message);
+    // properly capture stack trace in Node.js
+    Error.captureStackTrace(this, this.constructor);
+    this.name = this.constructor.name;
+    this.code = code;
+    this.exitCode = exitCode;
+    this.nestedError = undefined;
+  }
+}
+
+/**
+ * InvalidOptionArgumentError class
+ * @class
+ */
+class InvalidOptionArgumentError extends CommanderError {
+  /**
+   * Constructs the InvalidOptionArgumentError class
+   * @param {string} [message] explanation of why argument is invalid
+   * @constructor
+   */
+  constructor(message) {
+    super(1, 'commander.invalidOptionArgument', message);
+    // properly capture stack trace in Node.js
+    Error.captureStackTrace(this, this.constructor);
+    this.name = this.constructor.name;
+  }
+}
+
+class Command extends EventEmitter {
+  /**
+   * Initialize a new `Command`.
+   *
+   * @param {string} [name]
+   */
+
+  constructor(name) {
+    super();
+    this.commands = [];
+    this.options = [];
+    this.parent = null;
+    this._allowUnknownOption = false;
+    this._allowExcessArguments = true;
+    this._args = [];
+    this.rawArgs = null;
+    this._scriptPath = null;
+    this._name = name || '';
+    this._optionValues = {};
+    this._storeOptionsAsProperties = false;
+    this._actionResults = [];
+    this._actionHandler = null;
+    this._executableHandler = false;
+    this._executableFile = null; // custom name for executable
+    this._defaultCommandName = null;
+    this._exitCallback = null;
+    this._aliases = [];
+    this._combineFlagAndOptionalValue = true;
+    this._description = '';
+    this._argsDescription = undefined;
+    this._enablePositionalOptions = false;
+    this._passThroughOptions = false;
+
+    // see .configureOutput() for docs
+    this._outputConfiguration = {
+      writeOut: (str) => process.stdout.write(str),
+      writeErr: (str) => process.stderr.write(str),
+      getOutHelpWidth: () => process.stdout.isTTY ? process.stdout.columns : undefined,
+      getErrHelpWidth: () => process.stderr.isTTY ? process.stderr.columns : undefined,
+      outputError: (str, write) => write(str)
+    };
+
+    this._hidden = false;
+    this._hasHelpOption = true;
+    this._helpFlags = '-h, --help';
+    this._helpDescription = 'display help for command';
+    this._helpShortFlag = '-h';
+    this._helpLongFlag = '--help';
+    this._addImplicitHelpCommand = undefined; // Deliberately undefined, not decided whether true or false
+    this._helpCommandName = 'help';
+    this._helpCommandnameAndArgs = 'help [command]';
+    this._helpCommandDescription = 'display help for command';
+    this._helpConfiguration = {};
+  }
+
+  /**
+   * Define a command.
+   *
+   * There are two styles of command: pay attention to where to put the description.
+   *
+   * Examples:
+   *
+   *      // Command implemented using action handler (description is supplied separately to `.command`)
+   *      program
+   *        .command('clone <source> [destination]')
+   *        .description('clone a repository into a newly created directory')
+   *        .action((source, destination) => {
+   *          console.log('clone command called');
+   *        });
+   *
+   *      // Command implemented using separate executable file (description is second parameter to `.command`)
+   *      program
+   *        .command('start <service>', 'start named service')
+   *        .command('stop [service]', 'stop named service, or all if no name supplied');
+   *
+   * @param {string} nameAndArgs - command name and arguments, args are `<required>` or `[optional]` and last may also be `variadic...`
+   * @param {Object|string} [actionOptsOrExecDesc] - configuration options (for action), or description (for executable)
+   * @param {Object} [execOpts] - configuration options (for executable)
+   * @return {Command} returns new command for action handler, or `this` for executable command
+   */
+
+  command(nameAndArgs, actionOptsOrExecDesc, execOpts) {
+    let desc = actionOptsOrExecDesc;
+    let opts = execOpts;
+    if (typeof desc === 'object' && desc !== null) {
+      opts = desc;
+      desc = null;
+    }
+    opts = opts || {};
+    const args = nameAndArgs.split(/ +/);
+    const cmd = this.createCommand(args.shift());
+
+    if (desc) {
+      cmd.description(desc);
+      cmd._executableHandler = true;
+    }
+    if (opts.isDefault) this._defaultCommandName = cmd._name;
+
+    cmd._outputConfiguration = this._outputConfiguration;
+
+    cmd._hidden = !!(opts.noHelp || opts.hidden); // noHelp is deprecated old name for hidden
+    cmd._hasHelpOption = this._hasHelpOption;
+    cmd._helpFlags = this._helpFlags;
+    cmd._helpDescription = this._helpDescription;
+    cmd._helpShortFlag = this._helpShortFlag;
+    cmd._helpLongFlag = this._helpLongFlag;
+    cmd._helpCommandName = this._helpCommandName;
+    cmd._helpCommandnameAndArgs = this._helpCommandnameAndArgs;
+    cmd._helpCommandDescription = this._helpCommandDescription;
+    cmd._helpConfiguration = this._helpConfiguration;
+    cmd._exitCallback = this._exitCallback;
+    cmd._storeOptionsAsProperties = this._storeOptionsAsProperties;
+    cmd._combineFlagAndOptionalValue = this._combineFlagAndOptionalValue;
+    cmd._allowExcessArguments = this._allowExcessArguments;
+    cmd._enablePositionalOptions = this._enablePositionalOptions;
+
+    cmd._executableFile = opts.executableFile || null; // Custom name for executable file, set missing to null to match constructor
+    this.commands.push(cmd);
+    cmd._parseExpectedArgs(args);
+    cmd.parent = this;
+
+    if (desc) return this;
+    return cmd;
+  };
+
+  /**
+   * Factory routine to create a new unattached command.
+   *
+   * See .command() for creating an attached subcommand, which uses this routine to
+   * create the command. You can override createCommand to customise subcommands.
+   *
+   * @param {string} [name]
+   * @return {Command} new command
+   */
+
+  createCommand(name) {
+    return new Command(name);
+  };
+
+  /**
+   * You can customise the help with a subclass of Help by overriding createHelp,
+   * or by overriding Help properties using configureHelp().
+   *
+   * @return {Help}
+   */
+
+  createHelp() {
+    return Object.assign(new Help(), this.configureHelp());
+  };
+
+  /**
+   * You can customise the help by overriding Help properties using configureHelp(),
+   * or with a subclass of Help by overriding createHelp().
+   *
+   * @param {Object} [configuration] - configuration options
+   * @return {Command|Object} `this` command for chaining, or stored configuration
+   */
+
+  configureHelp(configuration) {
+    if (configuration === undefined) return this._helpConfiguration;
+
+    this._helpConfiguration = configuration;
+    return this;
+  }
+
+  /**
+   * The default output goes to stdout and stderr. You can customise this for special
+   * applications. You can also customise the display of errors by overriding outputError.
+   *
+   * The configuration properties are all functions:
+   *
+   *    // functions to change where being written, stdout and stderr
+   *    writeOut(str)
+   *    writeErr(str)
+   *    // matching functions to specify width for wrapping help
+   *    getOutHelpWidth()
+   *    getErrHelpWidth()
+   *    // functions based on what is being written out
+   *    outputError(str, write) // used for displaying errors, and not used for displaying help
+   *
+   * @param {Object} [configuration] - configuration options
+   * @return {Command|Object} `this` command for chaining, or stored configuration
+   */
+
+  configureOutput(configuration) {
+    if (configuration === undefined) return this._outputConfiguration;
+
+    Object.assign(this._outputConfiguration, configuration);
+    return this;
+  }
+
+  /**
+   * Add a prepared subcommand.
+   *
+   * See .command() for creating an attached subcommand which inherits settings from its parent.
+   *
+   * @param {Command} cmd - new subcommand
+   * @param {Object} [opts] - configuration options
+   * @return {Command} `this` command for chaining
+   */
+
+  addCommand(cmd, opts) {
+    if (!cmd._name) throw new Error('Command passed to .addCommand() must have a name');
+
+    // To keep things simple, block automatic name generation for deeply nested executables.
+    // Fail fast and detect when adding rather than later when parsing.
+    function checkExplicitNames(commandArray) {
+      commandArray.forEach((cmd) => {
+        if (cmd._executableHandler && !cmd._executableFile) {
+          throw new Error(`Must specify executableFile for deeply nested executable: ${cmd.name()}`);
+        }
+        checkExplicitNames(cmd.commands);
+      });
+    }
+    checkExplicitNames(cmd.commands);
+
+    opts = opts || {};
+    if (opts.isDefault) this._defaultCommandName = cmd._name;
+    if (opts.noHelp || opts.hidden) cmd._hidden = true; // modifying passed command due to existing implementation
+
+    this.commands.push(cmd);
+    cmd.parent = this;
+    return this;
+  };
+
+  /**
+   * Define argument syntax for the command.
+   */
+
+  arguments(desc) {
+    return this._parseExpectedArgs(desc.split(/ +/));
+  };
+
+  /**
+   * Override default decision whether to add implicit help command.
+   *
+   *    addHelpCommand() // force on
+   *    addHelpCommand(false); // force off
+   *    addHelpCommand('help [cmd]', 'display help for [cmd]'); // force on with custom details
+   *
+   * @return {Command} `this` command for chaining
+   */
+
+  addHelpCommand(enableOrNameAndArgs, description) {
+    if (enableOrNameAndArgs === false) {
+      this._addImplicitHelpCommand = false;
+    } else {
+      this._addImplicitHelpCommand = true;
+      if (typeof enableOrNameAndArgs === 'string') {
+        this._helpCommandName = enableOrNameAndArgs.split(' ')[0];
+        this._helpCommandnameAndArgs = enableOrNameAndArgs;
+      }
+      this._helpCommandDescription = description || this._helpCommandDescription;
+    }
+    return this;
+  };
+
+  /**
+   * @return {boolean}
+   * @api private
+   */
+
+  _hasImplicitHelpCommand() {
+    if (this._addImplicitHelpCommand === undefined) {
+      return this.commands.length && !this._actionHandler && !this._findCommand('help');
+    }
+    return this._addImplicitHelpCommand;
+  };
+
+  /**
+   * Parse expected `args`.
+   *
+   * For example `["[type]"]` becomes `[{ required: false, name: 'type' }]`.
+   *
+   * @param {Array} args
+   * @return {Command} `this` command for chaining
+   * @api private
+   */
+
+  _parseExpectedArgs(args) {
+    if (!args.length) return;
+    args.forEach((arg) => {
+      const argDetails = {
+        required: false,
+        name: '',
+        variadic: false
+      };
+
+      switch (arg[0]) {
+        case '<':
+          argDetails.required = true;
+          argDetails.name = arg.slice(1, -1);
+          break;
+        case '[':
+          argDetails.name = arg.slice(1, -1);
+          break;
+      }
+
+      if (argDetails.name.length > 3 && argDetails.name.slice(-3) === '...') {
+        argDetails.variadic = true;
+        argDetails.name = argDetails.name.slice(0, -3);
+      }
+      if (argDetails.name) {
+        this._args.push(argDetails);
+      }
+    });
+    this._args.forEach((arg, i) => {
+      if (arg.variadic && i < this._args.length - 1) {
+        throw new Error(`only the last argument can be variadic '${arg.name}'`);
+      }
+    });
+    return this;
+  };
+
+  /**
+   * Register callback to use as replacement for calling process.exit.
+   *
+   * @param {Function} [fn] optional callback which will be passed a CommanderError, defaults to throwing
+   * @return {Command} `this` command for chaining
+   */
+
+  exitOverride(fn) {
+    if (fn) {
+      this._exitCallback = fn;
+    } else {
+      this._exitCallback = (err) => {
+        if (err.code !== 'commander.executeSubCommandAsync') {
+          throw err;
+        } else {
+          // Async callback from spawn events, not useful to throw.
+        }
+      };
+    }
+    return this;
+  };
+
+  /**
+   * Call process.exit, and _exitCallback if defined.
+   *
+   * @param {number} exitCode exit code for using with process.exit
+   * @param {string} code an id string representing the error
+   * @param {string} message human-readable description of the error
+   * @return never
+   * @api private
+   */
+
+  _exit(exitCode, code, message) {
+    if (this._exitCallback) {
+      this._exitCallback(new CommanderError(exitCode, code, message));
+      // Expecting this line is not reached.
+    }
+    process.exit(exitCode);
+  };
+
+  /**
+   * Register callback `fn` for the command.
+   *
+   * Examples:
+   *
+   *      program
+   *        .command('help')
+   *        .description('display verbose help')
+   *        .action(function() {
+   *           // output help here
+   *        });
+   *
+   * @param {Function} fn
+   * @return {Command} `this` command for chaining
+   */
+
+  action(fn) {
+    const listener = (args) => {
+      // The .action callback takes an extra parameter which is the command or options.
+      const expectedArgsCount = this._args.length;
+      const actionArgs = args.slice(0, expectedArgsCount);
+      if (this._storeOptionsAsProperties) {
+        actionArgs[expectedArgsCount] = this; // backwards compatible "options"
+      } else {
+        actionArgs[expectedArgsCount] = this.opts();
+      }
+      actionArgs.push(this);
+
+      const actionResult = fn.apply(this, actionArgs);
+      // Remember result in case it is async. Assume parseAsync getting called on root.
+      let rootCommand = this;
+      while (rootCommand.parent) {
+        rootCommand = rootCommand.parent;
+      }
+      rootCommand._actionResults.push(actionResult);
+    };
+    this._actionHandler = listener;
+    return this;
+  };
+
+  /**
+   * Factory routine to create a new unattached option.
+   *
+   * See .option() for creating an attached option, which uses this routine to
+   * create the option. You can override createOption to return a custom option.
+   *
+   * @param {string} flags
+   * @param {string} [description]
+   * @return {Option} new option
+   */
+
+  createOption(flags, description) {
+    return new Option(flags, description);
+  };
+
+  /**
+   * Add an option.
+   *
+   * @param {Option} option
+   * @return {Command} `this` command for chaining
+   */
+  addOption(option) {
+    const oname = option.name();
+    const name = option.attributeName();
+
+    let defaultValue = option.defaultValue;
+
+    // preassign default value for --no-*, [optional], <required>, or plain flag if boolean value
+    if (option.negate || option.optional || option.required || typeof defaultValue === 'boolean') {
+      // when --no-foo we make sure default is true, unless a --foo option is already defined
+      if (option.negate) {
+        const positiveLongFlag = option.long.replace(/^--no-/, '--');
+        defaultValue = this._findOption(positiveLongFlag) ? this._getOptionValue(name) : true;
+      }
+      // preassign only if we have a default
+      if (defaultValue !== undefined) {
+        this._setOptionValue(name, defaultValue);
+      }
+    }
+
+    // register the option
+    this.options.push(option);
+
+    // when it's passed assign the value
+    // and conditionally invoke the callback
+    this.on('option:' + oname, (val) => {
+      const oldValue = this._getOptionValue(name);
+
+      // custom processing
+      if (val !== null && option.parseArg) {
+        try {
+          val = option.parseArg(val, oldValue === undefined ? defaultValue : oldValue);
+        } catch (err) {
+          if (err.code === 'commander.invalidOptionArgument') {
+            const message = `error: option '${option.flags}' argument '${val}' is invalid. ${err.message}`;
+            this._displayError(err.exitCode, err.code, message);
+          }
+          throw err;
+        }
+      } else if (val !== null && option.variadic) {
+        val = option._concatValue(val, oldValue);
+      }
+
+      // unassigned or boolean value
+      if (typeof oldValue === 'boolean' || typeof oldValue === 'undefined') {
+        // if no value, negate false, and we have a default, then use it!
+        if (val == null) {
+          this._setOptionValue(name, option.negate
+            ? false
+            : defaultValue || true);
+        } else {
+          this._setOptionValue(name, val);
+        }
+      } else if (val !== null) {
+        // reassign
+        this._setOptionValue(name, option.negate ? false : val);
+      }
+    });
+
+    return this;
+  }
+
+  /**
+   * Internal implementation shared by .option() and .requiredOption()
+   *
+   * @api private
+   */
+  _optionEx(config, flags, description, fn, defaultValue) {
+    const option = this.createOption(flags, description);
+    option.makeOptionMandatory(!!config.mandatory);
+    if (typeof fn === 'function') {
+      option.default(defaultValue).argParser(fn);
+    } else if (fn instanceof RegExp) {
+      // deprecated
+      const regex = fn;
+      fn = (val, def) => {
+        const m = regex.exec(val);
+        return m ? m[0] : def;
+      };
+      option.default(defaultValue).argParser(fn);
+    } else {
+      option.default(fn);
+    }
+
+    return this.addOption(option);
+  }
+
+  /**
+   * Define option with `flags`, `description` and optional
+   * coercion `fn`.
+   *
+   * The `flags` string contains the short and/or long flags,
+   * separated by comma, a pipe or space. The following are all valid
+   * all will output this way when `--help` is used.
+   *
+   *    "-p, --pepper"
+   *    "-p|--pepper"
+   *    "-p --pepper"
+   *
+   * Examples:
+   *
+   *     // simple boolean defaulting to undefined
+   *     program.option('-p, --pepper', 'add pepper');
+   *
+   *     program.pepper
+   *     // => undefined
+   *
+   *     --pepper
+   *     program.pepper
+   *     // => true
+   *
+   *     // simple boolean defaulting to true (unless non-negated option is also defined)
+   *     program.option('-C, --no-cheese', 'remove cheese');
+   *
+   *     program.cheese
+   *     // => true
+   *
+   *     --no-cheese
+   *     program.cheese
+   *     // => false
+   *
+   *     // required argument
+   *     program.option('-C, --chdir <path>', 'change the working directory');
+   *
+   *     --chdir /tmp
+   *     program.chdir
+   *     // => "/tmp"
+   *
+   *     // optional argument
+   *     program.option('-c, --cheese [type]', 'add cheese [marble]');
+   *
+   * @param {string} flags
+   * @param {string} [description]
+   * @param {Function|*} [fn] - custom option processing function or default value
+   * @param {*} [defaultValue]
+   * @return {Command} `this` command for chaining
+   */
+
+  option(flags, description, fn, defaultValue) {
+    return this._optionEx({}, flags, description, fn, defaultValue);
+  };
+
+  /**
+  * Add a required option which must have a value after parsing. This usually means
+  * the option must be specified on the command line. (Otherwise the same as .option().)
+  *
+  * The `flags` string contains the short and/or long flags, separated by comma, a pipe or space.
+  *
+  * @param {string} flags
+  * @param {string} [description]
+  * @param {Function|*} [fn] - custom option processing function or default value
+  * @param {*} [defaultValue]
+  * @return {Command} `this` command for chaining
+  */
+
+  requiredOption(flags, description, fn, defaultValue) {
+    return this._optionEx({ mandatory: true }, flags, description, fn, defaultValue);
+  };
+
+  /**
+   * Alter parsing of short flags with optional values.
+   *
+   * Examples:
+   *
+   *    // for `.option('-f,--flag [value]'):
+   *    .combineFlagAndOptionalValue(true)  // `-f80` is treated like `--flag=80`, this is the default behaviour
+   *    .combineFlagAndOptionalValue(false) // `-fb` is treated like `-f -b`
+   *
+   * @param {Boolean} [combine=true] - if `true` or omitted, an optional value can be specified directly after the flag.
+   */
+  combineFlagAndOptionalValue(combine = true) {
+    this._combineFlagAndOptionalValue = !!combine;
+    return this;
+  };
+
+  /**
+   * Allow unknown options on the command line.
+   *
+   * @param {Boolean} [allowUnknown=true] - if `true` or omitted, no error will be thrown
+   * for unknown options.
+   */
+  allowUnknownOption(allowUnknown = true) {
+    this._allowUnknownOption = !!allowUnknown;
+    return this;
+  };
+
+  /**
+   * Allow excess command-arguments on the command line. Pass false to make excess arguments an error.
+   *
+   * @param {Boolean} [allowExcess=true] - if `true` or omitted, no error will be thrown
+   * for excess arguments.
+   */
+  allowExcessArguments(allowExcess = true) {
+    this._allowExcessArguments = !!allowExcess;
+    return this;
+  };
+
+  /**
+   * Enable positional options. Positional means global options are specified before subcommands which lets
+   * subcommands reuse the same option names, and also enables subcommands to turn on passThroughOptions.
+   * The default behaviour is non-positional and global options may appear anywhere on the command line.
+   *
+   * @param {Boolean} [positional=true]
+   */
+  enablePositionalOptions(positional = true) {
+    this._enablePositionalOptions = !!positional;
+    return this;
+  };
+
+  /**
+   * Pass through options that come after command-arguments rather than treat them as command-options,
+   * so actual command-options come before command-arguments. Turning this on for a subcommand requires
+   * positional options to have been enabled on the program (parent commands).
+   * The default behaviour is non-positional and options may appear before or after command-arguments.
+   *
+   * @param {Boolean} [passThrough=true]
+   * for unknown options.
+   */
+  passThroughOptions(passThrough = true) {
+    this._passThroughOptions = !!passThrough;
+    if (!!this.parent && passThrough && !this.parent._enablePositionalOptions) {
+      throw new Error('passThroughOptions can not be used without turning on enablePositionalOptions for parent command(s)');
+    }
+    return this;
+  };
+
+  /**
+    * Whether to store option values as properties on command object,
+    * or store separately (specify false). In both cases the option values can be accessed using .opts().
+    *
+    * @param {boolean} [storeAsProperties=true]
+    * @return {Command} `this` command for chaining
+    */
+
+  storeOptionsAsProperties(storeAsProperties = true) {
+    this._storeOptionsAsProperties = !!storeAsProperties;
+    if (this.options.length) {
+      throw new Error('call .storeOptionsAsProperties() before adding options');
+    }
+    return this;
+  };
+
+  /**
+   * Store option value
+   *
+   * @param {string} key
+   * @param {Object} value
+   * @api private
+   */
+
+  _setOptionValue(key, value) {
+    if (this._storeOptionsAsProperties) {
+      this[key] = value;
+    } else {
+      this._optionValues[key] = value;
+    }
+  };
+
+  /**
+   * Retrieve option value
+   *
+   * @param {string} key
+   * @return {Object} value
+   * @api private
+   */
+
+  _getOptionValue(key) {
+    if (this._storeOptionsAsProperties) {
+      return this[key];
+    }
+    return this._optionValues[key];
+  };
+
+  /**
+   * Parse `argv`, setting options and invoking commands when defined.
+   *
+   * The default expectation is that the arguments are from node and have the application as argv[0]
+   * and the script being run in argv[1], with user parameters after that.
+   *
+   * Examples:
+   *
+   *      program.parse(process.argv);
+   *      program.parse(); // implicitly use process.argv and auto-detect node vs electron conventions
+   *      program.parse(my-args, { from: 'user' }); // just user supplied arguments, nothing special about argv[0]
+   *
+   * @param {string[]} [argv] - optional, defaults to process.argv
+   * @param {Object} [parseOptions] - optionally specify style of options with from: node/user/electron
+   * @param {string} [parseOptions.from] - where the args are from: 'node', 'user', 'electron'
+   * @return {Command} `this` command for chaining
+   */
+
+  parse(argv, parseOptions) {
+    if (argv !== undefined && !Array.isArray(argv)) {
+      throw new Error('first parameter to parse must be array or undefined');
+    }
+    parseOptions = parseOptions || {};
+
+    // Default to using process.argv
+    if (argv === undefined) {
+      argv = process.argv;
+      // @ts-ignore: unknown property
+      if (process.versions && process.versions.electron) {
+        parseOptions.from = 'electron';
+      }
+    }
+    this.rawArgs = argv.slice();
+
+    // make it a little easier for callers by supporting various argv conventions
+    let userArgs;
+    switch (parseOptions.from) {
+      case undefined:
+      case 'node':
+        this._scriptPath = argv[1];
+        userArgs = argv.slice(2);
+        break;
+      case 'electron':
+        // @ts-ignore: unknown property
+        if (process.defaultApp) {
+          this._scriptPath = argv[1];
+          userArgs = argv.slice(2);
+        } else {
+          userArgs = argv.slice(1);
+        }
+        break;
+      case 'user':
+        userArgs = argv.slice(0);
+        break;
+      default:
+        throw new Error(`unexpected parse option { from: '${parseOptions.from}' }`);
+    }
+    if (!this._scriptPath && require.main) {
+      this._scriptPath = require.main.filename;
+    }
+
+    // Guess name, used in usage in help.
+    this._name = this._name || (this._scriptPath && path.basename(this._scriptPath, path.extname(this._scriptPath)));
+
+    // Let's go!
+    this._parseCommand([], userArgs);
+
+    return this;
+  };
+
+  /**
+   * Parse `argv`, setting options and invoking commands when defined.
+   *
+   * Use parseAsync instead of parse if any of your action handlers are async. Returns a Promise.
+   *
+   * The default expectation is that the arguments are from node and have the application as argv[0]
+   * and the script being run in argv[1], with user parameters after that.
+   *
+   * Examples:
+   *
+   *      program.parseAsync(process.argv);
+   *      program.parseAsync(); // implicitly use process.argv and auto-detect node vs electron conventions
+   *      program.parseAsync(my-args, { from: 'user' }); // just user supplied arguments, nothing special about argv[0]
+   *
+   * @param {string[]} [argv]
+   * @param {Object} [parseOptions]
+   * @param {string} parseOptions.from - where the args are from: 'node', 'user', 'electron'
+   * @return {Promise}
+   */
+
+  parseAsync(argv, parseOptions) {
+    this.parse(argv, parseOptions);
+    return Promise.all(this._actionResults).then(() => this);
+  };
+
+  /**
+   * Execute a sub-command executable.
+   *
+   * @api private
+   */
+
+  _executeSubCommand(subcommand, args) {
+    args = args.slice();
+    let launchWithNode = false; // Use node for source targets so do not need to get permissions correct, and on Windows.
+    const sourceExt = ['.js', '.ts', '.tsx', '.mjs', '.cjs'];
+
+    // Not checking for help first. Unlikely to have mandatory and executable, and can't robustly test for help flags in external command.
+    this._checkForMissingMandatoryOptions();
+
+    // Want the entry script as the reference for command name and directory for searching for other files.
+    let scriptPath = this._scriptPath;
+    // Fallback in case not set, due to how Command created or called.
+    if (!scriptPath && require.main) {
+      scriptPath = require.main.filename;
+    }
+
+    let baseDir;
+    try {
+      const resolvedLink = fs.realpathSync(scriptPath);
+      baseDir = path.dirname(resolvedLink);
+    } catch (e) {
+      baseDir = '.'; // dummy, probably not going to find executable!
+    }
+
+    // name of the subcommand, like `pm-install`
+    let bin = path.basename(scriptPath, path.extname(scriptPath)) + '-' + subcommand._name;
+    if (subcommand._executableFile) {
+      bin = subcommand._executableFile;
+    }
+
+    const localBin = path.join(baseDir, bin);
+    if (fs.existsSync(localBin)) {
+      // prefer local `./<bin>` to bin in the $PATH
+      bin = localBin;
+    } else {
+      // Look for source files.
+      sourceExt.forEach((ext) => {
+        if (fs.existsSync(`${localBin}${ext}`)) {
+          bin = `${localBin}${ext}`;
+        }
+      });
+    }
+    launchWithNode = sourceExt.includes(path.extname(bin));
+
+    let proc;
+    if (process.platform !== 'win32') {
+      if (launchWithNode) {
+        args.unshift(bin);
+        // add executable arguments to spawn
+        args = incrementNodeInspectorPort(process.execArgv).concat(args);
+
+        proc = childProcess.spawn(process.argv[0], args, { stdio: 'inherit' });
+      } else {
+        proc = childProcess.spawn(bin, args, { stdio: 'inherit' });
+      }
+    } else {
+      args.unshift(bin);
+      // add executable arguments to spawn
+      args = incrementNodeInspectorPort(process.execArgv).concat(args);
+      proc = childProcess.spawn(process.execPath, args, { stdio: 'inherit' });
+    }
+
+    const signals = ['SIGUSR1', 'SIGUSR2', 'SIGTERM', 'SIGINT', 'SIGHUP'];
+    signals.forEach((signal) => {
+      // @ts-ignore
+      process.on(signal, () => {
+        if (proc.killed === false && proc.exitCode === null) {
+          proc.kill(signal);
+        }
+      });
+    });
+
+    // By default terminate process when spawned process terminates.
+    // Suppressing the exit if exitCallback defined is a bit messy and of limited use, but does allow process to stay running!
+    const exitCallback = this._exitCallback;
+    if (!exitCallback) {
+      proc.on('close', process.exit.bind(process));
+    } else {
+      proc.on('close', () => {
+        exitCallback(new CommanderError(process.exitCode || 0, 'commander.executeSubCommandAsync', '(close)'));
+      });
+    }
+    proc.on('error', (err) => {
+      // @ts-ignore
+      if (err.code === 'ENOENT') {
+        const executableMissing = `'${bin}' does not exist
+ - if '${subcommand._name}' is not meant to be an executable command, remove description parameter from '.command()' and use '.description()' instead
+ - if the default executable name is not suitable, use the executableFile option to supply a custom name`;
+        throw new Error(executableMissing);
+      // @ts-ignore
+      } else if (err.code === 'EACCES') {
+        throw new Error(`'${bin}' not executable`);
+      }
+      if (!exitCallback) {
+        process.exit(1);
+      } else {
+        const wrappedError = new CommanderError(1, 'commander.executeSubCommandAsync', '(error)');
+        wrappedError.nestedError = err;
+        exitCallback(wrappedError);
+      }
+    });
+
+    // Store the reference to the child process
+    this.runningCommand = proc;
+  };
+
+  /**
+   * @api private
+   */
+  _dispatchSubcommand(commandName, operands, unknown) {
+    const subCommand = this._findCommand(commandName);
+    if (!subCommand) this.help({ error: true });
+
+    if (subCommand._executableHandler) {
+      this._executeSubCommand(subCommand, operands.concat(unknown));
+    } else {
+      subCommand._parseCommand(operands, unknown);
+    }
+  };
+
+  /**
+   * Process arguments in context of this command.
+   *
+   * @api private
+   */
+
+  _parseCommand(operands, unknown) {
+    const parsed = this.parseOptions(unknown);
+    operands = operands.concat(parsed.operands);
+    unknown = parsed.unknown;
+    this.args = operands.concat(unknown);
+
+    if (operands && this._findCommand(operands[0])) {
+      this._dispatchSubcommand(operands[0], operands.slice(1), unknown);
+    } else if (this._hasImplicitHelpCommand() && operands[0] === this._helpCommandName) {
+      if (operands.length === 1) {
+        this.help();
+      } else {
+        this._dispatchSubcommand(operands[1], [], [this._helpLongFlag]);
+      }
+    } else if (this._defaultCommandName) {
+      outputHelpIfRequested(this, unknown); // Run the help for default command from parent rather than passing to default command
+      this._dispatchSubcommand(this._defaultCommandName, operands, unknown);
+    } else {
+      if (this.commands.length && this.args.length === 0 && !this._actionHandler && !this._defaultCommandName) {
+        // probably missing subcommand and no handler, user needs help
+        this.help({ error: true });
+      }
+
+      outputHelpIfRequested(this, parsed.unknown);
+      this._checkForMissingMandatoryOptions();
+
+      // We do not always call this check to avoid masking a "better" error, like unknown command.
+      const checkForUnknownOptions = () => {
+        if (parsed.unknown.length > 0) {
+          this.unknownOption(parsed.unknown[0]);
+        }
+      };
+
+      const commandEvent = `command:${this.name()}`;
+      if (this._actionHandler) {
+        checkForUnknownOptions();
+        // Check expected arguments and collect variadic together.
+        const args = this.args.slice();
+        this._args.forEach((arg, i) => {
+          if (arg.required && args[i] == null) {
+            this.missingArgument(arg.name);
+          } else if (arg.variadic) {
+            args[i] = args.splice(i);
+            args.length = Math.min(i + 1, args.length);
+          }
+        });
+        if (args.length > this._args.length) {
+          this._excessArguments(args);
+        }
+
+        this._actionHandler(args);
+        if (this.parent) this.parent.emit(commandEvent, operands, unknown); // legacy
+      } else if (this.parent && this.parent.listenerCount(commandEvent)) {
+        checkForUnknownOptions();
+        this.parent.emit(commandEvent, operands, unknown); // legacy
+      } else if (operands.length) {
+        if (this._findCommand('*')) { // legacy default command
+          this._dispatchSubcommand('*', operands, unknown);
+        } else if (this.listenerCount('command:*')) {
+          // skip option check, emit event for possible misspelling suggestion
+          this.emit('command:*', operands, unknown);
+        } else if (this.commands.length) {
+          this.unknownCommand();
+        } else {
+          checkForUnknownOptions();
+        }
+      } else if (this.commands.length) {
+        // This command has subcommands and nothing hooked up at this level, so display help.
+        this.help({ error: true });
+      } else {
+        checkForUnknownOptions();
+        // fall through for caller to handle after calling .parse()
+      }
+    }
+  };
+
+  /**
+   * Find matching command.
+   *
+   * @api private
+   */
+  _findCommand(name) {
+    if (!name) return undefined;
+    return this.commands.find(cmd => cmd._name === name || cmd._aliases.includes(name));
+  };
+
+  /**
+   * Return an option matching `arg` if any.
+   *
+   * @param {string} arg
+   * @return {Option}
+   * @api private
+   */
+
+  _findOption(arg) {
+    return this.options.find(option => option.is(arg));
+  };
+
+  /**
+   * Display an error message if a mandatory option does not have a value.
+   * Lazy calling after checking for help flags from leaf subcommand.
+   *
+   * @api private
+   */
+
+  _checkForMissingMandatoryOptions() {
+    // Walk up hierarchy so can call in subcommand after checking for displaying help.
+    for (let cmd = this; cmd; cmd = cmd.parent) {
+      cmd.options.forEach((anOption) => {
+        if (anOption.mandatory && (cmd._getOptionValue(anOption.attributeName()) === undefined)) {
+          cmd.missingMandatoryOptionValue(anOption);
+        }
+      });
+    }
+  };
+
+  /**
+   * Parse options from `argv` removing known options,
+   * and return argv split into operands and unknown arguments.
+   *
+   * Examples:
+   *
+   *    argv => operands, unknown
+   *    --known kkk op => [op], []
+   *    op --known kkk => [op], []
+   *    sub --unknown uuu op => [sub], [--unknown uuu op]
+   *    sub -- --unknown uuu op => [sub --unknown uuu op], []
+   *
+   * @param {String[]} argv
+   * @return {{operands: String[], unknown: String[]}}
+   */
+
+  parseOptions(argv) {
+    const operands = []; // operands, not options or values
+    const unknown = []; // first unknown option and remaining unknown args
+    let dest = operands;
+    const args = argv.slice();
+
+    function maybeOption(arg) {
+      return arg.length > 1 && arg[0] === '-';
+    }
+
+    // parse options
+    let activeVariadicOption = null;
+    while (args.length) {
+      const arg = args.shift();
+
+      // literal
+      if (arg === '--') {
+        if (dest === unknown) dest.push(arg);
+        dest.push(...args);
+        break;
+      }
+
+      if (activeVariadicOption && !maybeOption(arg)) {
+        this.emit(`option:${activeVariadicOption.name()}`, arg);
+        continue;
+      }
+      activeVariadicOption = null;
+
+      if (maybeOption(arg)) {
+        const option = this._findOption(arg);
+        // recognised option, call listener to assign value with possible custom processing
+        if (option) {
+          if (option.required) {
+            const value = args.shift();
+            if (value === undefined) this.optionMissingArgument(option);
+            this.emit(`option:${option.name()}`, value);
+          } else if (option.optional) {
+            let value = null;
+            // historical behaviour is optional value is following arg unless an option
+            if (args.length > 0 && !maybeOption(args[0])) {
+              value = args.shift();
+            }
+            this.emit(`option:${option.name()}`, value);
+          } else { // boolean flag
+            this.emit(`option:${option.name()}`);
+          }
+          activeVariadicOption = option.variadic ? option : null;
+          continue;
+        }
+      }
+
+      // Look for combo options following single dash, eat first one if known.
+      if (arg.length > 2 && arg[0] === '-' && arg[1] !== '-') {
+        const option = this._findOption(`-${arg[1]}`);
+        if (option) {
+          if (option.required || (option.optional && this._combineFlagAndOptionalValue)) {
+            // option with value following in same argument
+            this.emit(`option:${option.name()}`, arg.slice(2));
+          } else {
+            // boolean option, emit and put back remainder of arg for further processing
+            this.emit(`option:${option.name()}`);
+            args.unshift(`-${arg.slice(2)}`);
+          }
+          continue;
+        }
+      }
+
+      // Look for known long flag with value, like --foo=bar
+      if (/^--[^=]+=/.test(arg)) {
+        const index = arg.indexOf('=');
+        const option = this._findOption(arg.slice(0, index));
+        if (option && (option.required || option.optional)) {
+          this.emit(`option:${option.name()}`, arg.slice(index + 1));
+          continue;
+        }
+      }
+
+      // Not a recognised option by this command.
+      // Might be a command-argument, or subcommand option, or unknown option, or help command or option.
+
+      // An unknown option means further arguments also classified as unknown so can be reprocessed by subcommands.
+      if (maybeOption(arg)) {
+        dest = unknown;
+      }
+
+      // If using positionalOptions, stop processing our options at subcommand.
+      if ((this._enablePositionalOptions || this._passThroughOptions) && operands.length === 0 && unknown.length === 0) {
+        if (this._findCommand(arg)) {
+          operands.push(arg);
+          if (args.length > 0) unknown.push(...args);
+          break;
+        } else if (arg === this._helpCommandName && this._hasImplicitHelpCommand()) {
+          operands.push(arg);
+          if (args.length > 0) operands.push(...args);
+          break;
+        } else if (this._defaultCommandName) {
+          unknown.push(arg);
+          if (args.length > 0) unknown.push(...args);
+          break;
+        }
+      }
+
+      // If using passThroughOptions, stop processing options at first command-argument.
+      if (this._passThroughOptions) {
+        dest.push(arg);
+        if (args.length > 0) dest.push(...args);
+        break;
+      }
+
+      // add arg
+      dest.push(arg);
+    }
+
+    return { operands, unknown };
+  };
+
+  /**
+   * Return an object containing options as key-value pairs
+   *
+   * @return {Object}
+   */
+  opts() {
+    if (this._storeOptionsAsProperties) {
+      // Preserve original behaviour so backwards compatible when still using properties
+      const result = {};
+      const len = this.options.length;
+
+      for (let i = 0; i < len; i++) {
+        const key = this.options[i].attributeName();
+        result[key] = key === this._versionOptionName ? this._version : this[key];
+      }
+      return result;
+    }
+
+    return this._optionValues;
+  };
+
+  /**
+   * Internal bottleneck for handling of parsing errors.
+   *
+   * @api private
+   */
+  _displayError(exitCode, code, message) {
+    this._outputConfiguration.outputError(`${message}\n`, this._outputConfiguration.writeErr);
+    this._exit(exitCode, code, message);
+  }
+
+  /**
+   * Argument `name` is missing.
+   *
+   * @param {string} name
+   * @api private
+   */
+
+  missingArgument(name) {
+    const message = `error: missing required argument '${name}'`;
+    this._displayError(1, 'commander.missingArgument', message);
+  };
+
+  /**
+   * `Option` is missing an argument.
+   *
+   * @param {Option} option
+   * @api private
+   */
+
+  optionMissingArgument(option) {
+    const message = `error: option '${option.flags}' argument missing`;
+    this._displayError(1, 'commander.optionMissingArgument', message);
+  };
+
+  /**
+   * `Option` does not have a value, and is a mandatory option.
+   *
+   * @param {Option} option
+   * @api private
+   */
+
+  missingMandatoryOptionValue(option) {
+    const message = `error: required option '${option.flags}' not specified`;
+    this._displayError(1, 'commander.missingMandatoryOptionValue', message);
+  };
+
+  /**
+   * Unknown option `flag`.
+   *
+   * @param {string} flag
+   * @api private
+   */
+
+  unknownOption(flag) {
+    if (this._allowUnknownOption) return;
+    const message = `error: unknown option '${flag}'`;
+    this._displayError(1, 'commander.unknownOption', message);
+  };
+
+  /**
+   * Excess arguments, more than expected.
+   *
+   * @param {string[]} receivedArgs
+   * @api private
+   */
+
+  _excessArguments(receivedArgs) {
+    if (this._allowExcessArguments) return;
+
+    const expected = this._args.length;
+    const s = (expected === 1) ? '' : 's';
+    const forSubcommand = this.parent ? ` for '${this.name()}'` : '';
+    const message = `error: too many arguments${forSubcommand}. Expected ${expected} argument${s} but got ${receivedArgs.length}.`;
+    this._displayError(1, 'commander.excessArguments', message);
+  };
+
+  /**
+   * Unknown command.
+   *
+   * @api private
+   */
+
+  unknownCommand() {
+    const partCommands = [this.name()];
+    for (let parentCmd = this.parent; parentCmd; parentCmd = parentCmd.parent) {
+      partCommands.unshift(parentCmd.name());
+    }
+    const fullCommand = partCommands.join(' ');
+    const message = `error: unknown command '${this.args[0]}'.` +
+      (this._hasHelpOption ? ` See '${fullCommand} ${this._helpLongFlag}'.` : '');
+    this._displayError(1, 'commander.unknownCommand', message);
+  };
+
+  /**
+   * Set the program version to `str`.
+   *
+   * This method auto-registers the "-V, --version" flag
+   * which will print the version number when passed.
+   *
+   * You can optionally supply the  flags and description to override the defaults.
+   *
+   * @param {string} str
+   * @param {string} [flags]
+   * @param {string} [description]
+   * @return {this | string} `this` command for chaining, or version string if no arguments
+   */
+
+  version(str, flags, description) {
+    if (str === undefined) return this._version;
+    this._version = str;
+    flags = flags || '-V, --version';
+    description = description || 'output the version number';
+    const versionOption = this.createOption(flags, description);
+    this._versionOptionName = versionOption.attributeName();
+    this.options.push(versionOption);
+    this.on('option:' + versionOption.name(), () => {
+      this._outputConfiguration.writeOut(`${str}\n`);
+      this._exit(0, 'commander.version', str);
+    });
+    return this;
+  };
+
+  /**
+   * Set the description to `str`.
+   *
+   * @param {string} [str]
+   * @param {Object} [argsDescription]
+   * @return {string|Command}
+   */
+  description(str, argsDescription) {
+    if (str === undefined && argsDescription === undefined) return this._description;
+    this._description = str;
+    this._argsDescription = argsDescription;
+    return this;
+  };
+
+  /**
+   * Set an alias for the command.
+   *
+   * You may call more than once to add multiple aliases. Only the first alias is shown in the auto-generated help.
+   *
+   * @param {string} [alias]
+   * @return {string|Command}
+   */
+
+  alias(alias) {
+    if (alias === undefined) return this._aliases[0]; // just return first, for backwards compatibility
+
+    let command = this;
+    if (this.commands.length !== 0 && this.commands[this.commands.length - 1]._executableHandler) {
+      // assume adding alias for last added executable subcommand, rather than this
+      command = this.commands[this.commands.length - 1];
+    }
+
+    if (alias === command._name) throw new Error('Command alias can\'t be the same as its name');
+
+    command._aliases.push(alias);
+    return this;
+  };
+
+  /**
+   * Set aliases for the command.
+   *
+   * Only the first alias is shown in the auto-generated help.
+   *
+   * @param {string[]} [aliases]
+   * @return {string[]|Command}
+   */
+
+  aliases(aliases) {
+    // Getter for the array of aliases is the main reason for having aliases() in addition to alias().
+    if (aliases === undefined) return this._aliases;
+
+    aliases.forEach((alias) => this.alias(alias));
+    return this;
+  };
+
+  /**
+   * Set / get the command usage `str`.
+   *
+   * @param {string} [str]
+   * @return {String|Command}
+   */
+
+  usage(str) {
+    if (str === undefined) {
+      if (this._usage) return this._usage;
+
+      const args = this._args.map((arg) => {
+        return humanReadableArgName(arg);
+      });
+      return [].concat(
+        (this.options.length || this._hasHelpOption ? '[options]' : []),
+        (this.commands.length ? '[command]' : []),
+        (this._args.length ? args : [])
+      ).join(' ');
+    }
+
+    this._usage = str;
+    return this;
+  };
+
+  /**
+   * Get or set the name of the command
+   *
+   * @param {string} [str]
+   * @return {string|Command}
+   */
+
+  name(str) {
+    if (str === undefined) return this._name;
+    this._name = str;
+    return this;
+  };
+
+  /**
+   * Return program help documentation.
+   *
+   * @param {{ error: boolean }} [contextOptions] - pass {error:true} to wrap for stderr instead of stdout
+   * @return {string}
+   */
+
+  helpInformation(contextOptions) {
+    const helper = this.createHelp();
+    if (helper.helpWidth === undefined) {
+      helper.helpWidth = (contextOptions && contextOptions.error) ? this._outputConfiguration.getErrHelpWidth() : this._outputConfiguration.getOutHelpWidth();
+    }
+    return helper.formatHelp(this, helper);
+  };
+
+  /**
+   * @api private
+   */
+
+  _getHelpContext(contextOptions) {
+    contextOptions = contextOptions || {};
+    const context = { error: !!contextOptions.error };
+    let write;
+    if (context.error) {
+      write = (arg) => this._outputConfiguration.writeErr(arg);
+    } else {
+      write = (arg) => this._outputConfiguration.writeOut(arg);
+    }
+    context.write = contextOptions.write || write;
+    context.command = this;
+    return context;
+  }
+
+  /**
+   * Output help information for this command.
+   *
+   * Outputs built-in help, and custom text added using `.addHelpText()`.
+   *
+   * @param {{ error: boolean } | Function} [contextOptions] - pass {error:true} to write to stderr instead of stdout
+   */
+
+  outputHelp(contextOptions) {
+    let deprecatedCallback;
+    if (typeof contextOptions === 'function') {
+      deprecatedCallback = contextOptions;
+      contextOptions = undefined;
+    }
+    const context = this._getHelpContext(contextOptions);
+
+    const groupListeners = [];
+    let command = this;
+    while (command) {
+      groupListeners.push(command); // ordered from current command to root
+      command = command.parent;
+    }
+
+    groupListeners.slice().reverse().forEach(command => command.emit('beforeAllHelp', context));
+    this.emit('beforeHelp', context);
+
+    let helpInformation = this.helpInformation(context);
+    if (deprecatedCallback) {
+      helpInformation = deprecatedCallback(helpInformation);
+      if (typeof helpInformation !== 'string' && !Buffer.isBuffer(helpInformation)) {
+        throw new Error('outputHelp callback must return a string or a Buffer');
+      }
+    }
+    context.write(helpInformation);
+
+    this.emit(this._helpLongFlag); // deprecated
+    this.emit('afterHelp', context);
+    groupListeners.forEach(command => command.emit('afterAllHelp', context));
+  };
+
+  /**
+   * You can pass in flags and a description to override the help
+   * flags and help description for your command. Pass in false to
+   * disable the built-in help option.
+   *
+   * @param {string | boolean} [flags]
+   * @param {string} [description]
+   * @return {Command} `this` command for chaining
+   */
+
+  helpOption(flags, description) {
+    if (typeof flags === 'boolean') {
+      this._hasHelpOption = flags;
+      return this;
+    }
+    this._helpFlags = flags || this._helpFlags;
+    this._helpDescription = description || this._helpDescription;
+
+    const helpFlags = _parseOptionFlags(this._helpFlags);
+    this._helpShortFlag = helpFlags.shortFlag;
+    this._helpLongFlag = helpFlags.longFlag;
+
+    return this;
+  };
+
+  /**
+   * Output help information and exit.
+   *
+   * Outputs built-in help, and custom text added using `.addHelpText()`.
+   *
+   * @param {{ error: boolean }} [contextOptions] - pass {error:true} to write to stderr instead of stdout
+   */
+
+  help(contextOptions) {
+    this.outputHelp(contextOptions);
+    let exitCode = process.exitCode || 0;
+    if (exitCode === 0 && contextOptions && typeof contextOptions !== 'function' && contextOptions.error) {
+      exitCode = 1;
+    }
+    // message: do not have all displayed text available so only passing placeholder.
+    this._exit(exitCode, 'commander.help', '(outputHelp)');
+  };
+
+  /**
+   * Add additional text to be displayed with the built-in help.
+   *
+   * Position is 'before' or 'after' to affect just this command,
+   * and 'beforeAll' or 'afterAll' to affect this command and all its subcommands.
+   *
+   * @param {string} position - before or after built-in help
+   * @param {string | Function} text - string to add, or a function returning a string
+   * @return {Command} `this` command for chaining
+   */
+  addHelpText(position, text) {
+    const allowedValues = ['beforeAll', 'before', 'after', 'afterAll'];
+    if (!allowedValues.includes(position)) {
+      throw new Error(`Unexpected value for position to addHelpText.
+Expecting one of '${allowedValues.join("', '")}'`);
+    }
+    const helpEvent = `${position}Help`;
+    this.on(helpEvent, (context) => {
+      let helpStr;
+      if (typeof text === 'function') {
+        helpStr = text({ error: context.error, command: context.command });
+      } else {
+        helpStr = text;
+      }
+      // Ignore falsy value when nothing to output.
+      if (helpStr) {
+        context.write(`${helpStr}\n`);
+      }
+    });
+    return this;
+  }
+};
+
+/**
+ * Expose the root command.
+ */
+
+exports = module.exports = new Command();
+exports.program = exports; // More explicit access to global command.
+
+/**
+ * Expose classes
+ */
+
+exports.Command = Command;
+exports.Option = Option;
+exports.CommanderError = CommanderError;
+exports.InvalidOptionArgumentError = InvalidOptionArgumentError;
+exports.Help = Help;
+
+/**
+ * Camel-case the given `flag`
+ *
+ * @param {string} flag
+ * @return {string}
+ * @api private
+ */
+
+function camelcase(flag) {
+  return flag.split('-').reduce((str, word) => {
+    return str + word[0].toUpperCase() + word.slice(1);
+  });
+}
+
+/**
+ * Output help information if help flags specified
+ *
+ * @param {Command} cmd - command to output help for
+ * @param {Array} args - array of options to search for help flags
+ * @api private
+ */
+
+function outputHelpIfRequested(cmd, args) {
+  const helpOption = cmd._hasHelpOption && args.find(arg => arg === cmd._helpLongFlag || arg === cmd._helpShortFlag);
+  if (helpOption) {
+    cmd.outputHelp();
+    // (Do not have all displayed text available so only passing placeholder.)
+    cmd._exit(0, 'commander.helpDisplayed', '(outputHelp)');
+  }
+}
+
+/**
+ * Takes an argument and returns its human readable equivalent for help usage.
+ *
+ * @param {Object} arg
+ * @return {string}
+ * @api private
+ */
+
+function humanReadableArgName(arg) {
+  const nameOutput = arg.name + (arg.variadic === true ? '...' : '');
+
+  return arg.required
+    ? '<' + nameOutput + '>'
+    : '[' + nameOutput + ']';
+}
+
+/**
+ * Parse the short and long flag out of something like '-m,--mixed <value>'
+ *
+ * @api private
+ */
+
+function _parseOptionFlags(flags) {
+  let shortFlag;
+  let longFlag;
+  // Use original very loose parsing to maintain backwards compatibility for now,
+  // which allowed for example unintended `-sw, --short-word` [sic].
+  const flagParts = flags.split(/[ |,]+/);
+  if (flagParts.length > 1 && !/^[[<]/.test(flagParts[1])) shortFlag = flagParts.shift();
+  longFlag = flagParts.shift();
+  // Add support for lone short flag without significantly changing parsing!
+  if (!shortFlag && /^-[^-]$/.test(longFlag)) {
+    shortFlag = longFlag;
+    longFlag = undefined;
+  }
+  return { shortFlag, longFlag };
+}
+
+/**
+ * Scan arguments and increment port number for inspect calls (to avoid conflicts when spawning new command).
+ *
+ * @param {string[]} args - array of arguments from node.execArgv
+ * @returns {string[]}
+ * @api private
+ */
+
+function incrementNodeInspectorPort(args) {
+  // Testing for these options:
+  //  --inspect[=[host:]port]
+  //  --inspect-brk[=[host:]port]
+  //  --inspect-port=[host:]port
+  return args.map((arg) => {
+    if (!arg.startsWith('--inspect')) {
+      return arg;
+    }
+    let debugOption;
+    let debugHost = '127.0.0.1';
+    let debugPort = '9229';
+    let match;
+    if ((match = arg.match(/^(--inspect(-brk)?)$/)) !== null) {
+      // e.g. --inspect
+      debugOption = match[1];
+    } else if ((match = arg.match(/^(--inspect(-brk|-port)?)=([^:]+)$/)) !== null) {
+      debugOption = match[1];
+      if (/^\d+$/.test(match[3])) {
+        // e.g. --inspect=1234
+        debugPort = match[3];
+      } else {
+        // e.g. --inspect=localhost
+        debugHost = match[3];
+      }
+    } else if ((match = arg.match(/^(--inspect(-brk|-port)?)=([^:]+):(\d+)$/)) !== null) {
+      // e.g. --inspect=localhost:1234
+      debugOption = match[1];
+      debugHost = match[3];
+      debugPort = match[4];
+    }
+
+    if (debugOption && debugPort !== '0') {
+      return `${debugOption}=${debugHost}:${parseInt(debugPort) + 1}`;
+    }
+    return arg;
+  });
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/package-support.json b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/package-support.json
new file mode 100644
index 0000000..4eabb97
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/package-support.json
@@ -0,0 +1,16 @@
+{
+  "versions": [
+    {
+      "version": "*",
+      "target": {
+        "node": "supported"
+      },
+      "response": {
+        "type": "time-permitting"
+      },
+      "backing": {
+        "npm-funding": true
+      }
+    }
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/package.json b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/package.json
new file mode 100644
index 0000000..ca153e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/package.json
@@ -0,0 +1,68 @@
+{
+  "name": "commander",
+  "version": "7.2.0",
+  "description": "the complete solution for node.js command-line programs",
+  "keywords": [
+    "commander",
+    "command",
+    "option",
+    "parser",
+    "cli",
+    "argument",
+    "args",
+    "argv"
+  ],
+  "author": "TJ Holowaychuk <tj@vision-media.ca>",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/tj/commander.js.git"
+  },
+  "scripts": {
+    "lint": "eslint index.js esm.mjs \"tests/**/*.js\"",
+    "typescript-lint": "eslint typings/*.ts tests/*.ts",
+    "test": "jest && npm run test-typings",
+    "test-esm": "node --experimental-modules ./tests/esm-imports-test.mjs",
+    "test-typings": "tsd",
+    "typescript-checkJS": "tsc --allowJS --checkJS index.js --noEmit",
+    "test-all": "npm run test && npm run lint && npm run typescript-lint && npm run typescript-checkJS && npm run test-esm"
+  },
+  "main": "./index.js",
+  "files": [
+    "index.js",
+    "esm.mjs",
+    "typings/index.d.ts",
+    "package-support.json"
+  ],
+  "type": "commonjs",
+  "dependencies": {},
+  "devDependencies": {
+    "@types/jest": "^26.0.20",
+    "@types/node": "^14.14.20",
+    "@typescript-eslint/eslint-plugin": "^4.12.0",
+    "@typescript-eslint/parser": "^4.12.0",
+    "eslint": "^7.17.0",
+    "eslint-config-standard": "^16.0.2",
+    "eslint-plugin-jest": "^24.1.3",
+    "jest": "^26.6.3",
+    "standard": "^16.0.3",
+    "ts-jest": "^26.5.1",
+    "tsd": "^0.14.0",
+    "typescript": "^4.1.2"
+  },
+  "types": "typings/index.d.ts",
+  "jest": {
+    "testEnvironment": "node",
+    "collectCoverage": true,
+    "transform": {
+      "^.+\\.tsx?$": "ts-jest"
+    },
+    "testPathIgnorePatterns": [
+      "/node_modules/"
+    ]
+  },
+  "engines": {
+    "node": ">= 10"
+  },
+  "support": true
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/typings/index.d.ts b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/typings/index.d.ts
new file mode 100644
index 0000000..ee40d89
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/node_modules/commander/typings/index.d.ts
@@ -0,0 +1,627 @@
+// Type definitions for commander
+// Original definitions by: Alan Agius <https://github.com/alan-agius4>, Marcelo Dezem <https://github.com/mdezem>, vvakame <https://github.com/vvakame>, Jules Randolph <https://github.com/sveinburne>
+
+// Using method rather than property for method-signature-style, to document method overloads separately. Allow either.
+/* eslint-disable @typescript-eslint/method-signature-style */
+/* eslint-disable @typescript-eslint/no-explicit-any */
+
+declare namespace commander {
+
+  interface CommanderError extends Error {
+    code: string;
+    exitCode: number;
+    message: string;
+    nestedError?: string;
+  }
+  type CommanderErrorConstructor = new (exitCode: number, code: string, message: string) => CommanderError;
+
+  // eslint-disable-next-line @typescript-eslint/no-empty-interface
+  interface InvalidOptionArgumentError extends CommanderError {
+  }
+  type InvalidOptionArgumentErrorConstructor = new (message: string) => InvalidOptionArgumentError;
+
+  interface Option {
+    flags: string;
+    description: string;
+
+    required: boolean; // A value must be supplied when the option is specified.
+    optional: boolean; // A value is optional when the option is specified.
+    variadic: boolean;
+    mandatory: boolean; // The option must have a value after parsing, which usually means it must be specified on command line.
+    optionFlags: string;
+    short?: string;
+    long?: string;
+    negate: boolean;
+    defaultValue?: any;
+    defaultValueDescription?: string;
+    parseArg?: <T>(value: string, previous: T) => T;
+    hidden: boolean;
+    argChoices?: string[];
+
+    /**
+     * Set the default value, and optionally supply the description to be displayed in the help.
+     */
+    default(value: any, description?: string): this;
+
+    /**
+     * Calculate the full description, including defaultValue etc.
+     */
+    fullDescription(): string;
+
+    /**
+     * Set the custom handler for processing CLI option arguments into option values.
+     */
+    argParser<T>(fn: (value: string, previous: T) => T): this;
+
+    /**
+     * Whether the option is mandatory and must have a value after parsing.
+     */
+    makeOptionMandatory(mandatory?: boolean): this;
+
+    /**
+     * Hide option in help.
+     */
+    hideHelp(hide?: boolean): this;
+
+    /**
+     * Validation of option argument failed.
+     * Intended for use from custom argument processing functions.
+     */
+    argumentRejected(messsage: string): never;
+
+    /**
+     * Only allow option value to be one of choices.
+     */
+    choices(values: string[]): this;
+
+    /**
+     * Return option name.
+     */
+    name(): string;
+
+    /**
+     * Return option name, in a camelcase format that can be used
+     * as a object attribute key.
+     */
+    attributeName(): string;
+  }
+  type OptionConstructor = new (flags: string, description?: string) => Option;
+
+  interface Help {
+    /** output helpWidth, long lines are wrapped to fit */
+    helpWidth?: number;
+    sortSubcommands: boolean;
+    sortOptions: boolean;
+
+    /** Get the command term to show in the list of subcommands. */
+    subcommandTerm(cmd: Command): string;
+    /** Get the command description to show in the list of subcommands. */
+    subcommandDescription(cmd: Command): string;
+    /** Get the option term to show in the list of options. */
+    optionTerm(option: Option): string;
+    /** Get the option description to show in the list of options. */
+    optionDescription(option: Option): string;
+
+    /** Get the command usage to be displayed at the top of the built-in help. */
+    commandUsage(cmd: Command): string;
+    /** Get the description for the command. */
+    commandDescription(cmd: Command): string;
+
+    /** Get an array of the visible subcommands. Includes a placeholder for the implicit help command, if there is one. */
+    visibleCommands(cmd: Command): Command[];
+    /** Get an array of the visible options. Includes a placeholder for the implicit help option, if there is one. */
+    visibleOptions(cmd: Command): Option[];
+    /** Get an array of the arguments which have descriptions. */
+    visibleArguments(cmd: Command): Array<{ term: string; description: string}>;
+
+    /** Get the longest command term length. */
+    longestSubcommandTermLength(cmd: Command, helper: Help): number;
+    /** Get the longest option term length. */
+    longestOptionTermLength(cmd: Command, helper: Help): number;
+    /** Get the longest argument term length. */
+    longestArgumentTermLength(cmd: Command, helper: Help): number;
+    /** Calculate the pad width from the maximum term length. */
+    padWidth(cmd: Command, helper: Help): number;
+
+    /**
+     * Wrap the given string to width characters per line, with lines after the first indented.
+     * Do not wrap if insufficient room for wrapping (minColumnWidth), or string is manually formatted.
+     */
+    wrap(str: string, width: number, indent: number, minColumnWidth?: number): string;
+
+    /** Generate the built-in help text. */
+    formatHelp(cmd: Command, helper: Help): string;
+  }
+  type HelpConstructor = new () => Help;
+  type HelpConfiguration = Partial<Help>;
+
+  interface ParseOptions {
+    from: 'node' | 'electron' | 'user';
+  }
+  interface HelpContext { // optional parameter for .help() and .outputHelp()
+    error: boolean;
+  }
+  interface AddHelpTextContext { // passed to text function used with .addHelpText()
+    error: boolean;
+    command: Command;
+  }
+  interface OutputConfiguration {
+    writeOut?(str: string): void;
+    writeErr?(str: string): void;
+    getOutHelpWidth?(): number;
+    getErrHelpWidth?(): number;
+    outputError?(str: string, write: (str: string) => void): void;
+
+  }
+
+  type AddHelpTextPosition = 'beforeAll' | 'before' | 'after' | 'afterAll';
+
+  interface OptionValues {
+    [key: string]: any;
+  }
+
+  interface Command {
+    args: string[];
+    commands: Command[];
+    parent: Command | null;
+
+    /**
+     * Set the program version to `str`.
+     *
+     * This method auto-registers the "-V, --version" flag
+     * which will print the version number when passed.
+     *
+     * You can optionally supply the  flags and description to override the defaults.
+     */
+    version(str: string, flags?: string, description?: string): this;
+
+    /**
+     * Define a command, implemented using an action handler.
+     *
+     * @remarks
+     * The command description is supplied using `.description`, not as a parameter to `.command`.
+     *
+     * @example
+     * ```ts
+     *  program
+     *    .command('clone <source> [destination]')
+     *    .description('clone a repository into a newly created directory')
+     *    .action((source, destination) => {
+     *      console.log('clone command called');
+     *    });
+     * ```
+     *
+     * @param nameAndArgs - command name and arguments, args are  `<required>` or `[optional]` and last may also be `variadic...`
+     * @param opts - configuration options
+     * @returns new command
+     */
+    command(nameAndArgs: string, opts?: CommandOptions): ReturnType<this['createCommand']>;
+    /**
+     * Define a command, implemented in a separate executable file.
+     *
+     * @remarks
+     * The command description is supplied as the second parameter to `.command`.
+     *
+     * @example
+     * ```ts
+     *  program
+     *    .command('start <service>', 'start named service')
+     *    .command('stop [service]', 'stop named service, or all if no name supplied');
+     * ```
+     *
+     * @param nameAndArgs - command name and arguments, args are  `<required>` or `[optional]` and last may also be `variadic...`
+     * @param description - description of executable command
+     * @param opts - configuration options
+     * @returns `this` command for chaining
+     */
+    command(nameAndArgs: string, description: string, opts?: commander.ExecutableCommandOptions): this;
+
+    /**
+     * Factory routine to create a new unattached command.
+     *
+     * See .command() for creating an attached subcommand, which uses this routine to
+     * create the command. You can override createCommand to customise subcommands.
+     */
+    createCommand(name?: string): Command;
+
+    /**
+     * Add a prepared subcommand.
+     *
+     * See .command() for creating an attached subcommand which inherits settings from its parent.
+     *
+     * @returns `this` command for chaining
+     */
+    addCommand(cmd: Command, opts?: CommandOptions): this;
+
+    /**
+     * Define argument syntax for command.
+     *
+     * @returns `this` command for chaining
+     */
+    arguments(desc: string): this;
+
+    /**
+     * Override default decision whether to add implicit help command.
+     *
+     *    addHelpCommand() // force on
+     *    addHelpCommand(false); // force off
+     *    addHelpCommand('help [cmd]', 'display help for [cmd]'); // force on with custom details
+     *
+     * @returns `this` command for chaining
+     */
+    addHelpCommand(enableOrNameAndArgs?: string | boolean, description?: string): this;
+
+    /**
+     * Register callback to use as replacement for calling process.exit.
+     */
+    exitOverride(callback?: (err: CommanderError) => never|void): this;
+
+    /**
+     * You can customise the help with a subclass of Help by overriding createHelp,
+     * or by overriding Help properties using configureHelp().
+     */
+    createHelp(): Help;
+
+    /**
+     * You can customise the help by overriding Help properties using configureHelp(),
+     * or with a subclass of Help by overriding createHelp().
+     */
+    configureHelp(configuration: HelpConfiguration): this;
+    /** Get configuration */
+    configureHelp(): HelpConfiguration;
+
+    /**
+     * The default output goes to stdout and stderr. You can customise this for special
+     * applications. You can also customise the display of errors by overriding outputError.
+     *
+     * The configuration properties are all functions:
+     *
+     *    // functions to change where being written, stdout and stderr
+     *    writeOut(str)
+     *    writeErr(str)
+     *    // matching functions to specify width for wrapping help
+     *    getOutHelpWidth()
+     *    getErrHelpWidth()
+     *    // functions based on what is being written out
+     *    outputError(str, write) // used for displaying errors, and not used for displaying help
+     */
+    configureOutput(configuration: OutputConfiguration): this;
+    /** Get configuration */
+    configureOutput(): OutputConfiguration;
+
+    /**
+     * Register callback `fn` for the command.
+     *
+     * @example
+     *      program
+     *        .command('help')
+     *        .description('display verbose help')
+     *        .action(function() {
+     *           // output help here
+     *        });
+     *
+     * @returns `this` command for chaining
+     */
+    action(fn: (...args: any[]) => void | Promise<void>): this;
+
+    /**
+     * Define option with `flags`, `description` and optional
+     * coercion `fn`.
+     *
+     * The `flags` string contains the short and/or long flags,
+     * separated by comma, a pipe or space. The following are all valid
+     * all will output this way when `--help` is used.
+     *
+     *    "-p, --pepper"
+     *    "-p|--pepper"
+     *    "-p --pepper"
+     *
+     * @example
+     *     // simple boolean defaulting to false
+     *     program.option('-p, --pepper', 'add pepper');
+     *
+     *     --pepper
+     *     program.pepper
+     *     // => Boolean
+     *
+     *     // simple boolean defaulting to true
+     *     program.option('-C, --no-cheese', 'remove cheese');
+     *
+     *     program.cheese
+     *     // => true
+     *
+     *     --no-cheese
+     *     program.cheese
+     *     // => false
+     *
+     *     // required argument
+     *     program.option('-C, --chdir <path>', 'change the working directory');
+     *
+     *     --chdir /tmp
+     *     program.chdir
+     *     // => "/tmp"
+     *
+     *     // optional argument
+     *     program.option('-c, --cheese [type]', 'add cheese [marble]');
+     *
+     * @returns `this` command for chaining
+     */
+    option(flags: string, description?: string, defaultValue?: string | boolean): this;
+    option<T>(flags: string, description: string, fn: (value: string, previous: T) => T, defaultValue?: T): this;
+    /** @deprecated since v7, instead use choices or a custom function */
+    option(flags: string, description: string, regexp: RegExp, defaultValue?: string | boolean): this;
+
+    /**
+     * Define a required option, which must have a value after parsing. This usually means
+     * the option must be specified on the command line. (Otherwise the same as .option().)
+     *
+     * The `flags` string contains the short and/or long flags, separated by comma, a pipe or space.
+     */
+    requiredOption(flags: string, description?: string, defaultValue?: string | boolean): this;
+    requiredOption<T>(flags: string, description: string, fn: (value: string, previous: T) => T, defaultValue?: T): this;
+    /** @deprecated since v7, instead use choices or a custom function */
+    requiredOption(flags: string, description: string, regexp: RegExp, defaultValue?: string | boolean): this;
+
+    /**
+     * Factory routine to create a new unattached option.
+     *
+     * See .option() for creating an attached option, which uses this routine to
+     * create the option. You can override createOption to return a custom option.
+     */
+
+    createOption(flags: string, description?: string): Option;
+
+    /**
+     * Add a prepared Option.
+     *
+     * See .option() and .requiredOption() for creating and attaching an option in a single call.
+     */
+    addOption(option: Option): this;
+
+    /**
+     * Whether to store option values as properties on command object,
+     * or store separately (specify false). In both cases the option values can be accessed using .opts().
+     *
+     * @returns `this` command for chaining
+     */
+    storeOptionsAsProperties(): this & OptionValues;
+    storeOptionsAsProperties(storeAsProperties: true): this & OptionValues;
+    storeOptionsAsProperties(storeAsProperties?: boolean): this;
+
+    /**
+     * Alter parsing of short flags with optional values.
+     *
+     * @example
+     *    // for `.option('-f,--flag [value]'):
+     *   .combineFlagAndOptionalValue(true)  // `-f80` is treated like `--flag=80`, this is the default behaviour
+     *   .combineFlagAndOptionalValue(false) // `-fb` is treated like `-f -b`
+     *
+     * @returns `this` command for chaining
+     */
+    combineFlagAndOptionalValue(combine?: boolean): this;
+
+    /**
+     * Allow unknown options on the command line.
+     *
+     * @returns `this` command for chaining
+     */
+    allowUnknownOption(allowUnknown?: boolean): this;
+
+    /**
+     * Allow excess command-arguments on the command line. Pass false to make excess arguments an error.
+     *
+     * @returns `this` command for chaining
+     */
+    allowExcessArguments(allowExcess?: boolean): this;
+
+    /**
+     * Enable positional options. Positional means global options are specified before subcommands which lets
+     * subcommands reuse the same option names, and also enables subcommands to turn on passThroughOptions.
+     *
+     * The default behaviour is non-positional and global options may appear anywhere on the command line.
+     *
+     * @returns `this` command for chaining
+     */
+    enablePositionalOptions(positional?: boolean): this;
+
+    /**
+     * Pass through options that come after command-arguments rather than treat them as command-options,
+     * so actual command-options come before command-arguments. Turning this on for a subcommand requires
+     * positional options to have been enabled on the program (parent commands).
+     *
+     * The default behaviour is non-positional and options may appear before or after command-arguments.
+     *
+     * @returns `this` command for chaining
+     */
+    passThroughOptions(passThrough?: boolean): this;
+
+    /**
+     * Parse `argv`, setting options and invoking commands when defined.
+     *
+     * The default expectation is that the arguments are from node and have the application as argv[0]
+     * and the script being run in argv[1], with user parameters after that.
+     *
+     * Examples:
+     *
+     *      program.parse(process.argv);
+     *      program.parse(); // implicitly use process.argv and auto-detect node vs electron conventions
+     *      program.parse(my-args, { from: 'user' }); // just user supplied arguments, nothing special about argv[0]
+     *
+     * @returns `this` command for chaining
+     */
+    parse(argv?: string[], options?: ParseOptions): this;
+
+    /**
+     * Parse `argv`, setting options and invoking commands when defined.
+     *
+     * Use parseAsync instead of parse if any of your action handlers are async. Returns a Promise.
+     *
+     * The default expectation is that the arguments are from node and have the application as argv[0]
+     * and the script being run in argv[1], with user parameters after that.
+     *
+     * Examples:
+     *
+     *      program.parseAsync(process.argv);
+     *      program.parseAsync(); // implicitly use process.argv and auto-detect node vs electron conventions
+     *      program.parseAsync(my-args, { from: 'user' }); // just user supplied arguments, nothing special about argv[0]
+     *
+     * @returns Promise
+     */
+    parseAsync(argv?: string[], options?: ParseOptions): Promise<this>;
+
+    /**
+     * Parse options from `argv` removing known options,
+     * and return argv split into operands and unknown arguments.
+     *
+     * @example
+     *    argv => operands, unknown
+     *    --known kkk op => [op], []
+     *    op --known kkk => [op], []
+     *    sub --unknown uuu op => [sub], [--unknown uuu op]
+     *    sub -- --unknown uuu op => [sub --unknown uuu op], []
+     */
+    parseOptions(argv: string[]): commander.ParseOptionsResult;
+
+    /**
+     * Return an object containing options as key-value pairs
+     */
+    opts(): OptionValues;
+
+    /**
+     * Set the description.
+     *
+     * @returns `this` command for chaining
+     */
+    description(str: string, argsDescription?: {[argName: string]: string}): this;
+    /**
+     * Get the description.
+     */
+    description(): string;
+
+    /**
+     * Set an alias for the command.
+     *
+     * You may call more than once to add multiple aliases. Only the first alias is shown in the auto-generated help.
+     *
+     * @returns `this` command for chaining
+     */
+    alias(alias: string): this;
+    /**
+     * Get alias for the command.
+     */
+    alias(): string;
+
+    /**
+     * Set aliases for the command.
+     *
+     * Only the first alias is shown in the auto-generated help.
+     *
+     * @returns `this` command for chaining
+     */
+    aliases(aliases: string[]): this;
+    /**
+     * Get aliases for the command.
+     */
+    aliases(): string[];
+
+    /**
+     * Set the command usage.
+     *
+     * @returns `this` command for chaining
+     */
+    usage(str: string): this;
+    /**
+     * Get the command usage.
+     */
+    usage(): string;
+
+    /**
+     * Set the name of the command.
+     *
+     * @returns `this` command for chaining
+     */
+    name(str: string): this;
+    /**
+     * Get the name of the command.
+     */
+    name(): string;
+
+    /**
+     * Output help information for this command.
+     *
+     * Outputs built-in help, and custom text added using `.addHelpText()`.
+     *
+     */
+    outputHelp(context?: HelpContext): void;
+    /** @deprecated since v7 */
+    outputHelp(cb?: (str: string) => string): void;
+
+    /**
+     * Return command help documentation.
+     */
+    helpInformation(context?: HelpContext): string;
+
+    /**
+     * You can pass in flags and a description to override the help
+     * flags and help description for your command. Pass in false
+     * to disable the built-in help option.
+     */
+    helpOption(flags?: string | boolean, description?: string): this;
+
+    /**
+     * Output help information and exit.
+     *
+     * Outputs built-in help, and custom text added using `.addHelpText()`.
+     */
+    help(context?: HelpContext): never;
+    /** @deprecated since v7 */
+    help(cb?: (str: string) => string): never;
+
+    /**
+     * Add additional text to be displayed with the built-in help.
+     *
+     * Position is 'before' or 'after' to affect just this command,
+     * and 'beforeAll' or 'afterAll' to affect this command and all its subcommands.
+     */
+    addHelpText(position: AddHelpTextPosition, text: string): this;
+    addHelpText(position: AddHelpTextPosition, text: (context: AddHelpTextContext) => string | undefined): this;
+
+    /**
+     * Add a listener (callback) for when events occur. (Implemented using EventEmitter.)
+     */
+    on(event: string | symbol, listener: (...args: any[]) => void): this;
+  }
+  type CommandConstructor = new (name?: string) => Command;
+
+  interface CommandOptions {
+    hidden?: boolean;
+    isDefault?: boolean;
+    /** @deprecated since v7, replaced by hidden */
+    noHelp?: boolean;
+  }
+  interface ExecutableCommandOptions extends CommandOptions {
+    executableFile?: string;
+  }
+
+  // eslint-disable-next-line @typescript-eslint/no-unused-vars
+  interface ParseOptionsResult {
+    operands: string[];
+    unknown: string[];
+  }
+
+  // eslint-disable-next-line @typescript-eslint/no-unused-vars
+  interface CommanderStatic extends Command {
+    program: Command;
+    Command: CommandConstructor;
+    Option: OptionConstructor;
+    CommanderError: CommanderErrorConstructor;
+    InvalidOptionArgumentError: InvalidOptionArgumentErrorConstructor;
+    Help: HelpConstructor;
+  }
+
+}
+
+// Declaring namespace AND global
+// eslint-disable-next-line @typescript-eslint/no-redeclare
+declare const commander: commander.CommanderStatic;
+export = commander;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-cli/package.json b/node_modules/mathjs/examples/node_modules/webpack-cli/package.json
new file mode 100644
index 0000000..f73cf2a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-cli/package.json
@@ -0,0 +1,63 @@
+{
+  "name": "webpack-cli",
+  "version": "4.9.2",
+  "description": "CLI for webpack & friends",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/webpack/webpack-cli.git"
+  },
+  "homepage": "https://github.com/webpack/webpack-cli/tree/master/packages/webpack-cli",
+  "bin": {
+    "webpack-cli": "./bin/cli.js"
+  },
+  "main": "./lib/index.js",
+  "engines": {
+    "node": ">=10.13.0"
+  },
+  "keywords": [
+    "webpack",
+    "cli",
+    "scaffolding",
+    "module",
+    "bundler",
+    "web"
+  ],
+  "files": [
+    "bin",
+    "lib",
+    "!**/*__tests__"
+  ],
+  "dependencies": {
+    "@discoveryjs/json-ext": "^0.5.0",
+    "@webpack-cli/configtest": "^1.1.1",
+    "@webpack-cli/info": "^1.4.1",
+    "@webpack-cli/serve": "^1.6.1",
+    "colorette": "^2.0.14",
+    "commander": "^7.0.0",
+    "execa": "^5.0.0",
+    "fastest-levenshtein": "^1.0.12",
+    "import-local": "^3.0.2",
+    "interpret": "^2.2.0",
+    "rechoir": "^0.7.0",
+    "webpack-merge": "^5.7.3"
+  },
+  "peerDependencies": {
+    "webpack": "4.x.x || 5.x.x"
+  },
+  "peerDependenciesMeta": {
+    "@webpack-cli/generators": {
+      "optional": true
+    },
+    "@webpack-cli/migrate": {
+      "optional": true
+    },
+    "webpack-bundle-analyzer": {
+      "optional": true
+    },
+    "webpack-dev-server": {
+      "optional": true
+    }
+  },
+  "gitHead": "fb50f766851f500ca12867a2aa9de81fa6e368f9"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/webpack-merge/CHANGELOG.md
new file mode 100644
index 0000000..2dc5beb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/CHANGELOG.md
@@ -0,0 +1,426 @@
+# Changelog
+
+## 5.8.0 / 2021-06-07
+
+- Docs - Update `env` example to be webpack 5 compatible. #177, #180
+- Feat - Support strings as rules for TypeScript, not just enums. #179, #185
+
+## 5.7.3 / 2020-12-22
+
+- Fix - Don't merge strings with objects in `mergeWithRules`. #172
+
+## 5.7.2 / 2020-12-16
+
+- Fix - If there's no match when using `merge` operation with `mergeWithRules`, use default merge behavior as a fallback. #167
+
+## 5.7.1 / 2020-12-16
+
+- Fix - Fix a merge failure for `mergeWithRules` when non-array matches are merged. #166
+
+## 5.7.0 / 2020-12-12
+
+- Feat - Throw a `TypeError` if trying to use `mergeWithRules` with invalid configuration types for `append`/`prepend`/`merge` operations.
+
+## 5.6.1 / 2020-12-11
+
+- Fix - Drop extraneous logging.
+
+## 5.6.0 / 2020-12-11
+
+- Feat - Support `merge` (`CustomizeRule.Merge`) for objects at `mergeWithRules`. This is useful for merging loader options for example. #163
+
+## 5.5.0 / 2020-12-10
+
+- Feat - Allow `mergeWithRules` to merge based on rules without a match. #151 #159
+
+## 5.4.1 / 2020-12-08
+
+- Fix - Allow `mergeUnique` to work with arbitrary order. #161
+
+## 5.4.0 / 2020-10-30
+
+- Fix - Fall back correctly in `mergeWithRules` for cases that aren't matched. #157 #158
+- Fix - Don't throw if using `mergeWithRules` without a rule #151
+- Feat - Throw if `undefined` is passed to `merge` as a structure to merge
+
+## 5.3.0 / 2020-10-30
+
+- Fix - Expose `Configuration` type through a generic to TypeScript to support both webpack 4 and 5 #141 #154
+
+In case you use webpack 4, please change your typing as instructed in the readme as the default type is loose but non-breaking.
+
+## 5.2.0 / 2020-10-07
+
+- Feature - Support advanced merging cases through `mergeWithRules` #146 #149
+
+## 5.1.4 / 2020-09-09
+
+- Fix - Expose `CustomizeRule` for TypeScript users #147
+
+## 5.1.3 / 2020-08-30
+
+- Fix - Allow merging a `RegExp` to itself #145
+
+## 5.1.2 / 2020-08-18
+
+- Fix - Allow overriding an object field with `null` #144
+
+## 5.1.1 / 2020-08-04
+
+- Fix - Drop `<reference types="webpack-dev-server" />` from **index.d.ts** #143
+
+## 5.1.0 / 2020-08-03
+
+- Feature - Expose `merge` as `default` for backwards-compatibility with TypeScript. Now `import merge from "webpack-merge";` works there. In CommonJS, the default alias is exposed through `default` property due to technical constraints.
+
+## 5.0.9 / 2020-07-09
+
+- Fix - Don't crash on `merge()` and `merge([])`. Now `{}` is returned in these corner cases.
+
+## 5.0.8 / 2020-07-07
+
+- Fix - Support Node 10 #138
+
+## 5.0.7 / 2020-07-06
+
+- Fix - Drop tslib dependency by setting `"importHelpers": false,`
+
+## 5.0.6 / 2020-07-06
+
+- Fix - Add tslib to dependencies
+
+## 5.0.5 / 2020-07-06
+
+- Tech - Optimize build size (UMD isn't needed)
+
+## 5.0.4 / 2020-07-06
+
+- Documentation - Use CommonJS imports at the examples. #137
+
+## 5.0.3 / 2020-07-06
+
+- Feature - Support TypeScript out of the box. #84 #86 #95 #110 #112
+- Deprecation - `merge.smart` has been dropped as it's tricky to support all the corner cases. Instead, it's better to use the provided utilities to put together a `merge` that fits your case.
+- Deprecation - `mergeStrategy` has been dropped in favor of using `mergeWithCustomize` with `customizeArray` and `customizeObject`.
+- Deprecation - `merge.multiple` has been dropped as the functionality was too specific and it's better to implement in the user space if needed.
+- Breaking - `merge` has been moved as a regular import (i.e. `import { merge } from 'webpack-merge'`).
+- Breaking - Merge customization has been moved behind `mergeWithCustomize`.
+- Breaking - Bump supported Node version to 12
+- Feature - `customizeArray` supports wildcards now. Example: `'entry.*': 'prepend'`. #45 #99
+- Feature - Throw an error in case a `Promise` is being merged. It's better to wrap configuration within a `Promise` and merge inside it. #81
+- Fix - Drop lodash in favor of simpler dependencies. #134
+- Fix - Make `unique` merge from right to left to match behavior elsewhere. #119
+- Fix - Make sure `unique` doesn't lose non-unique items to merge. #125
+
+Special thanks to Google and Addy Osmani for supporting the work financially as it allowed me to complete the work required by the new major release.
+
+## 4.2.2 / 2019-08-27
+
+- Fix - Update minimum version of lodash to 4.17.15 in order to avoid `npm audit warning`. #116
+- Docs - Improve `merge.unique` documentation. #103
+- Docs - Add clear note about precedence. #115
+
+## 4.2.1 / 2019-01-04
+
+- Feature - Support `oneOf` at `merge.smart`. #111
+- Fix - If there's only single array to merge, clone it. #106
+
+## 4.1.4 / 2018-08-01
+
+- Maintenance - Remove bitHound from the README as it closed down. #102
+
+## 4.1.3 / 2018-06-14
+
+- Fix - Smart merge respects the existing loader order #79, #101
+
+## 4.1.2 / 2017-02-22
+
+- Maintenance - Update lodash, #97, #98
+
+## 4.1.1 / 2017-11-01
+
+- Docs - Add `customizeArray` and `customizeObject` examples. #93
+
+## 4.1.0 / 2017-03-16
+
+- Feature - `merge.multiple` to allow working with webpack multi-compiler mode. It accepts multiple objects and returns an array you can push to webpack. #74
+
+## 4.0.0 / 2017-03-06
+
+- Breaking feature - `merge.smart` allows re-ordering loaders like below. #70
+
+```javascript
+merge.smart(
+  {
+    loaders: [
+      {
+        test: /\.js$/,
+        loaders: ["babel"],
+      },
+    ],
+  },
+  {
+    loaders: [
+      {
+        test: /\.js$/,
+        loaders: ["react-hot", "babel"],
+      },
+    ],
+  }
+);
+// will become
+{
+  loaders: [
+    {
+      test: /\.js$/,
+      // order of second argument is respected
+      loaders: ["react-hot", "babel"],
+    },
+  ];
+}
+```
+
+## 3.0.0 / 2017-02-19
+
+- Breaking fix - `merge.smart` should not merge a child missing `include`/`exclude` to a parent that has either. This is safer and more predictable behavior than the old one. #69
+
+## 2.6.1 / 2017-01-29
+
+- Bug fix - `merge.smart` should not merge rules that have differing `enforce` fields. #65
+
+## 2.6.0 / 2017-01-27
+
+- Bug fix - Support `replace` mode for `merge.smartStrategy`. #63
+
+## 2.5.0 / 2017-01-26
+
+- Bug fix - Make sure `merge.smartStrategy` works with higher level nesting like `'module.rules.use': 'prepend'`. #64
+
+## 2.4.0 / 2017-01-12
+
+- Feature - Add `merge.unique` helper that plugs into `customizeArray`. This allows you to force only one plugin of a type to the end result. #58
+
+## 2.3.1 / 2017-01-06
+
+- Bug fix - Clear up `CopyWebpackPlugin` handling. #56
+
+## 2.3.0 / 2017-01-06
+
+- Refactor - Depend only on `lodash` instead of individual packages as latter has been discontinued. #52
+
+## 2.2.0 / 2017-01-05
+
+- Bug fix - Drop `merge.smartStrategy(rules, plugins)` as that caused other issues (prototype copying for complex cases). That needs a better approach. #55
+
+## 2.1.1 / 2017-01-05
+
+- Bug fix - Avoid recursion at `merge.smart`. #53
+
+## 2.1.0 / 2017-01-05
+
+- Feature - Allow `merge.smartStrategy` to merge plugin contents. API: `merge.smartStrategy(rules, plugins)`. #44. Example:
+
+```javascript
+const output = merge.smartStrategy(
+  {
+    entry: 'prepend', // or 'replace'
+    'module.loaders': 'prepend'
+  },
+  ['LoaderOptionsPlugin']
+)(object1, object2, object3, ...);
+```
+
+## 2.0.0 / 2016-12-22
+
+- Breaking - Disallow overriding configuration with empty arrays/objects (#48). If you want to override, use `merge.strategy`. Example:
+
+```javascript
+const a = {
+  entry: ["foo"],
+};
+const b = {
+  entry: [],
+};
+
+merge(a, b); // Yields a result, not b like before.
+```
+
+## 1.1.2 / 2016-12-18
+
+- Bug fix - `merge({ entry: {} })` should return the same result as input instead of a function.
+
+## 1.1.1 / 2016-12-11
+
+- Bug fix - Support previously undocumented, yet used, `merge([<object>])` format. This works with all available functions. #46
+
+## 1.1.0 / 2016-12-09
+
+- Feature - Allow `merge` behavior to be customized with overrides. Example:
+
+```javascript
+var output = merge({
+  customizeArray(a, b, key) { return [...a, ...b]; },
+  customizeObject(a, b, key) { return mergeWith(a, b); }
+})(object1, object2, object3, ...);
+```
+
+This allows you to guarantee array uniqueness and so on.
+
+## 1.0.2 / 2016-11-29
+
+- Bug fix - `merge` should not mutate inputs with mismatched keys.
+
+## 1.0.0 / 2016-11-28
+
+- Feature: Support merging Webpack 2 Rule.use. #38
+- Bug fix - Don't concat loaders if the first matching entry's include/exclude doesn't match. #39
+
+## 0.20.0 / 2016-11-27
+
+- Feature: Add support for merging functions. This feature has been designed `postcss` in mind. It executes the functions, picks their results, and packs them again.
+
+## 0.19.0 / 2016-11-26
+
+- Feature: Add support for 'replace' option at `merge.strategy`. It literally replaces the old field value with the newer one. #40
+
+## 0.18.0 / 2016-11-24
+
+- Feature: Add support for recursive definitions at `merge.strategy`. Example:
+
+```javascript
+var output = merge.strategy({
+  entry: 'prepend',
+  'module.loaders': 'prepend'
+})(object1, object2, object3, ...);
+```
+
+- Feature: Add `merge.smartStrategy`. This combines the ideas of `merge.smart` and `merge.strategy` into one. Example:
+
+```javascript
+var output = merge.smartStrategy({
+  entry: 'prepend',
+  'module.loaders': 'prepend'
+})(object1, object2, object3, ...);
+```
+
+## 0.17.0 / 2016-11-16
+
+- Feature: Add support for `merge.strategy`. Now you can customize merging behavior per root level configuration field. Example: `merge.strategy({ entry: 'prepend' })(object1, object2, object3, ...);`. #17
+
+## 0.16.0 / 2016-11-14
+
+- Feature: Add support for webpack 2 at `merge.smart`. It should pick up `module.rules` as you might expect now. #35
+
+## 0.15.0 / 2016-10-18
+
+- Breaking: Rework `merge.smart` so that it **appends** loaders instead of **prepending** them. This is the logical thing to do as it allows you to specify behavior better as you `merge`. #32
+
+## 0.14.1 / 2016-07-25
+
+- Docs: Improve package description. #23.
+- Bug fix - Let `merge.smart` merge loaders based on their full name instead of first letter. Thanks to @choffmeister. #26.
+
+## 0.14.0 / 2016-06-05
+
+- Feature: Allow `merge.smart` to merge `loaders` if `exclude` is the same. Thanks to @mshwery. #21.
+
+## 0.13.0 / 2016-05-24
+
+- Bug fix: Allow `merge.smart` to merge configuration if `include` is defined. Thanks to @blackrabbit99. #20.
+
+## 0.12.0 / 2016-04-19
+
+- Feature: Support `include/exclude` at `merge.smart` for `loader` definition too. Thanks to @Whoaa512. #16.
+
+## 0.11.0 / 2016-04-18
+
+- Feature: Support `include/exclude` at `merge.smart` when its set only in a parent. #15.
+
+## 0.10.0 / 2016-04-10
+
+- Feature: Support `include/exclude` at `merge.smart`. Thanks to @siready. #14.
+
+## 0.9.0 / 2016-04-08
+
+- Feature: Allow existing objects/arrays to be emptied with an empty object/array later in merge. This overriding behavior is useful for example emptying your `entry` configuration.
+
+## 0.8.4 / 2016-03-17
+
+- Bug fix: _webpack-merge_ should not mutate inputs. #12
+
+## 0.8.3 / 2016-03-02
+
+- Bug fix: Drop `files` field from _package.json_ as it wasn't including the dist correctly.
+
+## 0.8.0 / 2016-03-02
+
+- Breaking: Change merging behavior so that only loaders get prepended. The rest follow appending logic. This makes `entry` array merging behavior logical. Prepend makes sense only for loaders after all. #10
+
+## 0.7.3 / 2016-01-11
+
+- Bug fix: Do not error when there are no matching loaders. Thanks @GreenGremlin!
+
+## 0.7.2 / 2016-01-08
+
+- Regenerate tarball. The problem was that there were some old dependencies included. Closes #7.
+
+## 0.7.1 / 2016-01-03
+
+- Improve performance by defaulting to `concat` and by dropping a redundant check. Thanks @davegomez!
+
+## 0.7.0 / 2015-12-31
+
+- Bug fix: Arrays get merged within nested structures correctly now. Array items are prepended (reverse order compared to earlier). This is related to the change made in _0.6.0_. Incidentally this change affects normal merge as well.
+- Smart merge: If a loader contains either `include` or `exclude`, it will generate separate entries instead of merging. Without this the configuration might change in an unpredictable manner.
+
+## 0.6.0 / 2015-12-30
+
+- Support `preLoaders` and `postLoaders`. Previously only `loaders` were supported.
+- Breaking: Change smart merging behavior for `loaders` field so that it prepends loaders instead of appending them. The benefit of this is that now it's possible to specialize loader setup in a predictable manner. For example you can have a linter set up at the root and expect it to become evaluated first always.
+
+## 0.5.1 / 2015-12-26
+
+- Fix `merge` object/array case (missing `bind`). The behavior should be correct now.
+
+## 0.5.0 / 2015-12-26
+
+- Breaking: Push smart merging behind `merge.smart`. Now `merge` behaves exactly as in _0.3.0_ series.
+
+## 0.4.0 / 2015-12-23
+
+- Dropped changelog generator. It's better to write these by hand.
+- Breaking: Added smart merging (@GreenGremlin)
+
+## 0.3.2 / 2015-11-23
+
+- Tweaked changelog generator process.
+
+## 0.3.1 / 2015-11-23
+
+- Added changelog generator.
+
+## 0.3.0 / 2015-11-13
+
+- Improved formatting
+- Allowed an arbitrary amount of objects to be merged
+
+## 0.2.0 / 2015-08-30
+
+- Only require lodash modules used by the package (@montogeek)
+- Removed lodash.isarray dependency, use Array.isArray standard object
+
+## 0.1.3 / 2015-08-10
+
+- Improved README example
+
+## 0.1.2 / 2015-07-01
+
+- Simplified example
+
+## 0.1.1 / 2015-06-26
+
+- Fixed travis link
+
+## 0.1.0 / 2015-06-26
+
+- Initial implementation
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/LICENSE b/node_modules/mathjs/examples/node_modules/webpack-merge/LICENSE
new file mode 100644
index 0000000..5eaceff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/LICENSE
@@ -0,0 +1,20 @@
+Copyright (c) 2015 Juho Vepsalainen
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/README.md b/node_modules/mathjs/examples/node_modules/webpack-merge/README.md
new file mode 100644
index 0000000..e0d8494
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/README.md
@@ -0,0 +1,314 @@
+[![Financial Contributors on Open Collective](https://opencollective.com/webpack-merge/all/badge.svg?label=financial+contributors)](https://opencollective.com/webpack-merge) [![build status](https://secure.travis-ci.org/survivejs/webpack-merge.svg)](http://travis-ci.org/survivejs/webpack-merge) [![codecov](https://codecov.io/gh/survivejs/webpack-merge/branch/master/graph/badge.svg)](https://codecov.io/gh/survivejs/webpack-merge)
+
+# webpack-merge - Merge designed for Webpack
+
+**webpack-merge** provides a `merge` function that concatenates arrays and merges objects creating a new object. If functions are encountered, it will execute them, run the results through the algorithm, and then wrap the returned values within a function again.
+
+This behavior is particularly useful in configuring webpack although it has uses beyond it. Whenever you need to merge configuration objects, **webpack-merge** can come in handy.
+
+## **`merge(...configuration | [...configuration])`**
+
+`merge` is the core, and the most important idea, of the API. Often this is all you need unless you want further customization.
+
+```javascript
+const { merge } = require('webpack-merge');
+
+// Default API
+const output = merge(object1, object2, object3, ...);
+
+// You can pass an array of objects directly.
+// This works with all available functions.
+const output = merge([object1, object2, object3]);
+
+// Keys matching to the right take precedence:
+const output = merge(
+  { fruit: "apple", color: "red" },
+  { fruit: "strawberries" }
+);
+console.log(output);
+// { color: "red", fruit: "strawberries"}
+```
+
+### Limitations
+
+Note that `Promise`s are not supported! If you want to return a configuration wrapped within a `Promise`, `merge` inside one. Example: `Promise.resolve(merge({ ... }, { ... }))`.
+
+The same goes for configuration level functions as in the example below:
+
+**webpack.config.js**
+
+```javascript
+const commonConfig = { ... };
+
+const productionConfig = { ... };
+
+const developmentConfig = { ... };
+
+module.exports = (env, args) => {
+  switch(args.mode) {
+    case 'development':
+      return merge(commonConfig, developmentConfig);
+    case 'production':
+      return merge(commonConfig, productionConfig);
+    default:
+      throw new Error('No matching configuration was found!');
+  }
+}
+```
+
+You can choose the configuration you want by using `webpack --mode development` assuming you are using _webpack-cli_.
+
+## **`mergeWithCustomize({ customizeArray, customizeObject })(...configuration | [...configuration])`**
+
+In case you need more flexibility, `merge` behavior can be customized per field as below:
+
+```javascript
+const { mergeWithCustomize } = require('webpack-merge');
+
+const output = mergeWithCustomize(
+  {
+    customizeArray(a, b, key) {
+      if (key === 'extensions') {
+        return _.uniq([...a, ...b]);
+      }
+
+      // Fall back to default merging
+      return undefined;
+    },
+    customizeObject(a, b, key) {
+      if (key === 'module') {
+        // Custom merging
+        return _.merge({}, a, b);
+      }
+
+      // Fall back to default merging
+      return undefined;
+    }
+  }
+)(object1, object2, object3, ...);
+```
+
+For example, if the previous code was invoked with only `object1` and `object2`
+with `object1` as:
+
+```javascript
+{
+    foo1: ['object1'],
+    foo2: ['object1'],
+    bar1: { object1: {} },
+    bar2: { object1: {} },
+}
+```
+
+and `object2` as:
+
+```javascript
+{
+    foo1: ['object2'],
+    foo2: ['object2'],
+    bar1: { object2: {} },
+    bar2: { object2: {} },
+}
+```
+
+then `customizeArray` will be invoked for each property of `Array` type, i.e:
+
+```javascript
+customizeArray(["object1"], ["object2"], "foo1");
+customizeArray(["object1"], ["object2"], "foo2");
+```
+
+and `customizeObject` will be invoked for each property of `Object` type, i.e:
+
+```javascript
+customizeObject({ object1: {} }, { object2: {} }, bar1);
+customizeObject({ object1: {} }, { object2: {} }, bar2);
+```
+
+## **`customizeArray`** and **`customizeObject`**
+
+`customizeArray` and `customizeObject` provide small strategies to for `mergeWithCustomize`. They support `append`, `prepend`, `replace`, and wildcards for field names.
+
+```javascript
+const { mergeWithCustomize, customizeArray, customizeObject } = require('webpack-merge');
+
+const output = mergeWithCustomize({
+  customizeArray: customizeArray({
+    'entry.*': 'prepend'
+  }),
+  customizeObject: customizeObject({
+    entry: 'prepend'
+  })
+})(object1, object2, object3, ...);
+```
+
+## **`unique(<field>, <fields>, field => field)`**
+
+`unique` is a strategy used for forcing uniqueness within configuration. It's most useful with plugins when you want to make sure there's only one in place.
+
+The first `<field>` is the config property to look through for duplicates.
+
+`<fields>` represents the values that should be unique when you run the field => field function on each duplicate.
+
+When the order of elements of the `<field>` in the first configuration differs from the order in the second configuration, the latter is preserved.
+
+```javascript
+const { mergeWithCustomize, unique } = require("webpack-merge");
+
+const output = mergeWithCustomize({
+  customizeArray: unique(
+    "plugins",
+    ["HotModuleReplacementPlugin"],
+    (plugin) => plugin.constructor && plugin.constructor.name
+  ),
+})(
+  {
+    plugins: [new webpack.HotModuleReplacementPlugin()],
+  },
+  {
+    plugins: [new webpack.HotModuleReplacementPlugin()],
+  }
+);
+
+// Output contains only single HotModuleReplacementPlugin now and it's
+// going to be the last plugin instance.
+```
+
+## **`mergeWithRules`**
+
+To support advanced merging needs (i.e. merging within loaders), `mergeWithRules` includes additional syntax that allows you to match fields and apply strategies to match. Consider the full example below:
+
+```javascript
+const a = {
+  module: {
+    rules: [
+      {
+        test: /\.css$/,
+        use: [{ loader: "style-loader" }, { loader: "sass-loader" }],
+      },
+    ],
+  },
+};
+const b = {
+  module: {
+    rules: [
+      {
+        test: /\.css$/,
+        use: [
+          {
+            loader: "style-loader",
+            options: {
+              modules: true,
+            },
+          },
+        ],
+      },
+    ],
+  },
+};
+const result = {
+  module: {
+    rules: [
+      {
+        test: /\.css$/,
+        use: [
+          {
+            loader: "style-loader",
+            options: {
+              modules: true,
+            },
+          },
+          { loader: "sass-loader" },
+        ],
+      },
+    ],
+  },
+};
+
+assert.deepStrictEqual(
+  mergeWithRules({
+    module: {
+      rules: {
+        test: "match",
+        use: {
+          loader: "match",
+          options: "replace",
+        },
+      },
+    },
+  })(a, b),
+  result
+);
+```
+
+The way it works is that you should annotate fields to match using `match` (or `CustomizeRule.Match` if you are using TypeScript) matching your configuration structure and then use specific strategies to define how particular fields should be transformed. If a match doesn't exist above a rule, then it will apply the rule automatically.
+
+**Supported annotations:**
+
+- `match` (`CustomizeRule.Match`) - Optional matcher that scopes merging behavior to a specific part based on similarity (think DOM or jQuery selectors)
+- `append` (`CustomizeRule.Append`) - Appends items
+- `prepend` (`CustomizeRule.Prepend`) - Prepends items
+- `replace` (`CustomizeRule.Replace`) - Replaces items
+- `merge` (`CustomizeRule.Merge`) - Merges objects (shallow merge)
+
+## Using with TypeScript
+
+**webpack-merge** supports TypeScript out of the box. You should pass `Configuration` type from webpack to it as follows:
+
+```typescript
+import { Configuration } from "webpack";
+import { merge } from "webpack-merge";
+
+const config = merge<Configuration>({...}, {...});
+
+...
+```
+
+## Development
+
+1. `nvm use`
+1. `npm i`
+1. `npm run build -- --watch` in one terminal
+1. `npm t -- --watch` in another one
+
+Before contributing, please [open an issue](https://github.com/survivejs/webpack-merge/issues/new) where to discuss.
+
+## Further Information and Support
+
+Check out [SurviveJS - Webpack 5](http://survivejs.com/) to dig deeper into webpack. The free book uses **webpack-merge** extensively and shows you how to compose your configuration to keep it maintainable.
+
+I am also available as a consultant in case you require specific assistance. I can contribute particularly in terms of improving maintainability of the setup while speeding it up and pointing out better practices. In addition to improving developer productivity, the work has impact on the end users of the product in terms of reduced application size and loading times.
+
+## Contributors
+
+### Code Contributors
+
+This project exists thanks to all the people who contribute. [[Contribute](CONTRIBUTING.md)].
+<a href="https://github.com/survivejs/webpack-merge/graphs/contributors"><img src="https://opencollective.com/webpack-merge/contributors.svg?width=890&button=false" /></a>
+
+### Financial Contributors
+
+Become a financial contributor and help us sustain our community. [[Contribute](https://opencollective.com/webpack-merge/contribute)]
+
+#### Individuals
+
+<a href="https://opencollective.com/webpack-merge"><img src="https://opencollective.com/webpack-merge/individuals.svg?width=890"></a>
+
+#### Organizations
+
+Support this project with your organization. Your logo will show up here with a link to your website. [[Contribute](https://opencollective.com/webpack-merge/contribute)]
+
+<a href="https://opencollective.com/webpack-merge/organization/0/website"><img src="https://opencollective.com/webpack-merge/organization/0/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/1/website"><img src="https://opencollective.com/webpack-merge/organization/1/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/2/website"><img src="https://opencollective.com/webpack-merge/organization/2/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/3/website"><img src="https://opencollective.com/webpack-merge/organization/3/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/4/website"><img src="https://opencollective.com/webpack-merge/organization/4/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/5/website"><img src="https://opencollective.com/webpack-merge/organization/5/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/6/website"><img src="https://opencollective.com/webpack-merge/organization/6/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/7/website"><img src="https://opencollective.com/webpack-merge/organization/7/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/8/website"><img src="https://opencollective.com/webpack-merge/organization/8/avatar.svg"></a>
+<a href="https://opencollective.com/webpack-merge/organization/9/website"><img src="https://opencollective.com/webpack-merge/organization/9/avatar.svg"></a>
+
+## License
+
+**webpack-merge** is available under MIT. See LICENSE for more details.
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.d.ts b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.d.ts
new file mode 100644
index 0000000..b604601
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.d.ts
@@ -0,0 +1,15 @@
+import unique from "./unique";
+import { CustomizeRule, CustomizeRuleString, ICustomizeOptions, Key } from "./types";
+declare function merge<Configuration extends object>(firstConfiguration: Configuration | Configuration[], ...configurations: Configuration[]): Configuration;
+declare function mergeWithCustomize<Configuration extends object>(options: ICustomizeOptions): (firstConfiguration: Configuration | Configuration[], ...configurations: Configuration[]) => Configuration;
+declare function customizeArray(rules: {
+    [s: string]: CustomizeRule | CustomizeRuleString;
+}): (a: any, b: any, key: Key) => any;
+declare type Rules = {
+    [s: string]: CustomizeRule | CustomizeRuleString | Rules;
+};
+declare function mergeWithRules(rules: Rules): (firstConfiguration: object | object[], ...configurations: object[]) => object;
+declare function customizeObject(rules: {
+    [s: string]: CustomizeRule | CustomizeRuleString;
+}): (a: any, b: any, key: Key) => any;
+export { customizeArray, customizeObject, CustomizeRule, merge, merge as default, mergeWithCustomize, mergeWithRules, unique, };
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.js b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.js
new file mode 100644
index 0000000..a797a2c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.js
@@ -0,0 +1,263 @@
+"use strict";
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from) {
+    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
+        to[j] = from[i];
+    return to;
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+exports.__esModule = true;
+exports.unique = exports.mergeWithRules = exports.mergeWithCustomize = exports["default"] = exports.merge = exports.CustomizeRule = exports.customizeObject = exports.customizeArray = void 0;
+var wildcard_1 = __importDefault(require("wildcard"));
+var merge_with_1 = __importDefault(require("./merge-with"));
+var join_arrays_1 = __importDefault(require("./join-arrays"));
+var unique_1 = __importDefault(require("./unique"));
+exports.unique = unique_1["default"];
+var types_1 = require("./types");
+exports.CustomizeRule = types_1.CustomizeRule;
+var utils_1 = require("./utils");
+function merge(firstConfiguration) {
+    var configurations = [];
+    for (var _i = 1; _i < arguments.length; _i++) {
+        configurations[_i - 1] = arguments[_i];
+    }
+    return mergeWithCustomize({}).apply(void 0, __spreadArray([firstConfiguration], __read(configurations)));
+}
+exports.merge = merge;
+exports["default"] = merge;
+function mergeWithCustomize(options) {
+    return function mergeWithOptions(firstConfiguration) {
+        var configurations = [];
+        for (var _i = 1; _i < arguments.length; _i++) {
+            configurations[_i - 1] = arguments[_i];
+        }
+        if (utils_1.isUndefined(firstConfiguration) || configurations.some(utils_1.isUndefined)) {
+            throw new TypeError("Merging undefined is not supported");
+        }
+        // @ts-ignore
+        if (firstConfiguration.then) {
+            throw new TypeError("Promises are not supported");
+        }
+        // No configuration at all
+        if (!firstConfiguration) {
+            return {};
+        }
+        if (configurations.length === 0) {
+            if (Array.isArray(firstConfiguration)) {
+                // Empty array
+                if (firstConfiguration.length === 0) {
+                    return {};
+                }
+                if (firstConfiguration.some(utils_1.isUndefined)) {
+                    throw new TypeError("Merging undefined is not supported");
+                }
+                // @ts-ignore
+                if (firstConfiguration[0].then) {
+                    throw new TypeError("Promises are not supported");
+                }
+                return merge_with_1["default"](firstConfiguration, join_arrays_1["default"](options));
+            }
+            return firstConfiguration;
+        }
+        return merge_with_1["default"]([firstConfiguration].concat(configurations), join_arrays_1["default"](options));
+    };
+}
+exports.mergeWithCustomize = mergeWithCustomize;
+function customizeArray(rules) {
+    return function (a, b, key) {
+        var matchedRule = Object.keys(rules).find(function (rule) { return wildcard_1["default"](rule, key); }) || "";
+        if (matchedRule) {
+            switch (rules[matchedRule]) {
+                case types_1.CustomizeRule.Prepend:
+                    return __spreadArray(__spreadArray([], __read(b)), __read(a));
+                case types_1.CustomizeRule.Replace:
+                    return b;
+                case types_1.CustomizeRule.Append:
+                default:
+                    return __spreadArray(__spreadArray([], __read(a)), __read(b));
+            }
+        }
+    };
+}
+exports.customizeArray = customizeArray;
+function mergeWithRules(rules) {
+    return mergeWithCustomize({
+        customizeArray: function (a, b, key) {
+            var currentRule = rules;
+            key.split(".").forEach(function (k) {
+                if (!currentRule) {
+                    return;
+                }
+                currentRule = currentRule[k];
+            });
+            if (utils_1.isPlainObject(currentRule)) {
+                return mergeWithRule({ currentRule: currentRule, a: a, b: b });
+            }
+            if (typeof currentRule === "string") {
+                return mergeIndividualRule({ currentRule: currentRule, a: a, b: b });
+            }
+            return undefined;
+        }
+    });
+}
+exports.mergeWithRules = mergeWithRules;
+var isArray = Array.isArray;
+function mergeWithRule(_a) {
+    var currentRule = _a.currentRule, a = _a.a, b = _a.b;
+    if (!isArray(a)) {
+        return a;
+    }
+    var bAllMatches = [];
+    var ret = a.map(function (ao) {
+        if (!utils_1.isPlainObject(currentRule)) {
+            return ao;
+        }
+        var ret = {};
+        var rulesToMatch = [];
+        var operations = {};
+        Object.entries(currentRule).forEach(function (_a) {
+            var _b = __read(_a, 2), k = _b[0], v = _b[1];
+            if (v === types_1.CustomizeRule.Match) {
+                rulesToMatch.push(k);
+            }
+            else {
+                operations[k] = v;
+            }
+        });
+        var bMatches = b.filter(function (o) {
+            var matches = rulesToMatch.every(function (rule) { var _a, _b; return ((_a = ao[rule]) === null || _a === void 0 ? void 0 : _a.toString()) === ((_b = o[rule]) === null || _b === void 0 ? void 0 : _b.toString()); });
+            if (matches) {
+                bAllMatches.push(o);
+            }
+            return matches;
+        });
+        if (!utils_1.isPlainObject(ao)) {
+            return ao;
+        }
+        Object.entries(ao).forEach(function (_a) {
+            var _b = __read(_a, 2), k = _b[0], v = _b[1];
+            var rule = currentRule;
+            switch (currentRule[k]) {
+                case types_1.CustomizeRule.Match:
+                    ret[k] = v;
+                    Object.entries(rule).forEach(function (_a) {
+                        var _b = __read(_a, 2), k = _b[0], v = _b[1];
+                        if (v === types_1.CustomizeRule.Replace && bMatches.length > 0) {
+                            var val = last(bMatches)[k];
+                            if (typeof val !== "undefined") {
+                                ret[k] = val;
+                            }
+                        }
+                    });
+                    break;
+                case types_1.CustomizeRule.Append:
+                    if (!bMatches.length) {
+                        ret[k] = v;
+                        break;
+                    }
+                    var appendValue = last(bMatches)[k];
+                    if (!isArray(v) || !isArray(appendValue)) {
+                        throw new TypeError("Trying to append non-arrays");
+                    }
+                    ret[k] = v.concat(appendValue);
+                    break;
+                case types_1.CustomizeRule.Merge:
+                    if (!bMatches.length) {
+                        ret[k] = v;
+                        break;
+                    }
+                    var lastValue = last(bMatches)[k];
+                    if (!utils_1.isPlainObject(v) || !utils_1.isPlainObject(lastValue)) {
+                        throw new TypeError("Trying to merge non-objects");
+                    }
+                    // @ts-ignore: These should be objects now
+                    ret[k] = __assign(__assign({}, v), lastValue);
+                    break;
+                case types_1.CustomizeRule.Prepend:
+                    if (!bMatches.length) {
+                        ret[k] = v;
+                        break;
+                    }
+                    var prependValue = last(bMatches)[k];
+                    if (!isArray(v) || !isArray(prependValue)) {
+                        throw new TypeError("Trying to prepend non-arrays");
+                    }
+                    ret[k] = prependValue.concat(v);
+                    break;
+                case types_1.CustomizeRule.Replace:
+                    ret[k] = bMatches.length > 0 ? last(bMatches)[k] : v;
+                    break;
+                default:
+                    var currentRule_1 = operations[k];
+                    // Use .flat(); starting from Node 12
+                    var b_1 = bMatches
+                        .map(function (o) { return o[k]; })
+                        .reduce(function (acc, val) {
+                        return isArray(acc) && isArray(val) ? __spreadArray(__spreadArray([], __read(acc)), __read(val)) : acc;
+                    }, []);
+                    ret[k] = mergeWithRule({ currentRule: currentRule_1, a: v, b: b_1 });
+                    break;
+            }
+        });
+        return ret;
+    });
+    return ret.concat(b.filter(function (o) { return !bAllMatches.includes(o); }));
+}
+function mergeIndividualRule(_a) {
+    var currentRule = _a.currentRule, a = _a.a, b = _a.b;
+    // What if there's no match?
+    switch (currentRule) {
+        case types_1.CustomizeRule.Append:
+            return a.concat(b);
+        case types_1.CustomizeRule.Prepend:
+            return b.concat(a);
+        case types_1.CustomizeRule.Replace:
+            return b;
+    }
+    return a;
+}
+function last(arr) {
+    return arr[arr.length - 1];
+}
+function customizeObject(rules) {
+    return function (a, b, key) {
+        switch (rules[key]) {
+            case types_1.CustomizeRule.Prepend:
+                return merge_with_1["default"]([b, a], join_arrays_1["default"]());
+            case types_1.CustomizeRule.Replace:
+                return b;
+            case types_1.CustomizeRule.Append:
+                return merge_with_1["default"]([a, b], join_arrays_1["default"]());
+        }
+    };
+}
+exports.customizeObject = customizeObject;
+//# sourceMappingURL=index.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.js.map b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.js.map
new file mode 100644
index 0000000..49dc835
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/index.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,sDAAgC;AAChC,4DAAqC;AACrC,8DAAuC;AACvC,oDAA8B;AAoT5B,iBApTK,mBAAM,CAoTL;AAnTR,iCAKiB;AAwSf,wBA5SA,qBAAa,CA4SA;AAvSf,iCAAqD;AAErD,SAAS,KAAK,CACZ,kBAAmD;IACnD,wBAAkC;SAAlC,UAAkC,EAAlC,qBAAkC,EAAlC,IAAkC;QAAlC,uCAAkC;;IAElC,OAAO,kBAAkB,CAAgB,EAAE,CAAC,8BAC1C,kBAAkB,UACf,cAAc,IACjB;AACJ,CAAC;AA8RC,sBAAK;AAEI,2BAAO;AA9RlB,SAAS,kBAAkB,CACzB,OAA0B;IAE1B,OAAO,SAAS,gBAAgB,CAC9B,kBAAmD;QACnD,wBAAkC;aAAlC,UAAkC,EAAlC,qBAAkC,EAAlC,IAAkC;YAAlC,uCAAkC;;QAElC,IAAI,mBAAW,CAAC,kBAAkB,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,mBAAW,CAAC,EAAE;YACvE,MAAM,IAAI,SAAS,CAAC,oCAAoC,CAAC,CAAC;SAC3D;QAED,aAAa;QACb,IAAI,kBAAkB,CAAC,IAAI,EAAE;YAC3B,MAAM,IAAI,SAAS,CAAC,4BAA4B,CAAC,CAAC;SACnD;QAED,0BAA0B;QAC1B,IAAI,CAAC,kBAAkB,EAAE;YACvB,OAAO,EAAmB,CAAC;SAC5B;QAED,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;YAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE;gBACrC,cAAc;gBACd,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE;oBACnC,OAAO,EAAmB,CAAC;iBAC5B;gBAED,IAAI,kBAAkB,CAAC,IAAI,CAAC,mBAAW,CAAC,EAAE;oBACxC,MAAM,IAAI,SAAS,CAAC,oCAAoC,CAAC,CAAC;iBAC3D;gBAED,aAAa;gBACb,IAAI,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;oBAC9B,MAAM,IAAI,SAAS,CAAC,4BAA4B,CAAC,CAAC;iBACnD;gBAED,OAAO,uBAAS,CACd,kBAAkB,EAClB,wBAAU,CAAC,OAAO,CAAC,CACH,CAAC;aACpB;YAED,OAAO,kBAAkB,CAAC;SAC3B;QAED,OAAO,uBAAS,CACd,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,EAC3C,wBAAU,CAAC,OAAO,CAAC,CACH,CAAC;IACrB,CAAC,CAAC;AACJ,CAAC;AA4OC,gDAAkB;AA1OpB,SAAS,cAAc,CAAC,KAEvB;IACC,OAAO,UAAC,CAAM,EAAE,CAAM,EAAE,GAAQ;QAC9B,IAAM,WAAW,GACf,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAC,IAAI,IAAK,OAAA,qBAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,EAAnB,CAAmB,CAAC,IAAI,EAAE,CAAC;QAE/D,IAAI,WAAW,EAAE;YACf,QAAQ,KAAK,CAAC,WAAW,CAAC,EAAE;gBAC1B,KAAK,qBAAa,CAAC,OAAO;oBACxB,8CAAW,CAAC,WAAK,CAAC,GAAE;gBACtB,KAAK,qBAAa,CAAC,OAAO;oBACxB,OAAO,CAAC,CAAC;gBACX,KAAK,qBAAa,CAAC,MAAM,CAAC;gBAC1B;oBACE,8CAAW,CAAC,WAAK,CAAC,GAAE;aACvB;SACF;IACH,CAAC,CAAC;AACJ,CAAC;AAiNC,wCAAc;AA7MhB,SAAS,cAAc,CAAC,KAAY;IAClC,OAAO,kBAAkB,CAAC;QACxB,cAAc,EAAE,UAAC,CAAM,EAAE,CAAM,EAAE,GAAQ;YACvC,IAAI,WAAW,GAAgD,KAAK,CAAC;YAErE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;gBACvB,IAAI,CAAC,WAAW,EAAE;oBAChB,OAAO;iBACR;gBAED,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,CAAC;YAEH,IAAI,qBAAa,CAAC,WAAW,CAAC,EAAE;gBAC9B,OAAO,aAAa,CAAC,EAAE,WAAW,aAAA,EAAE,CAAC,GAAA,EAAE,CAAC,GAAA,EAAE,CAAC,CAAC;aAC7C;YAED,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE;gBACnC,OAAO,mBAAmB,CAAC,EAAE,WAAW,aAAA,EAAE,CAAC,GAAA,EAAE,CAAC,GAAA,EAAE,CAAC,CAAC;aACnD;YAED,OAAO,SAAS,CAAC;QACnB,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AA4LC,wCAAc;AA1LhB,IAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;AAE9B,SAAS,aAAa,CAAC,EAQtB;QAPC,WAAW,iBAAA,EACX,CAAC,OAAA,EACD,CAAC,OAAA;IAMD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACf,OAAO,CAAC,CAAC;KACV;IAED,IAAM,WAAW,GAAU,EAAE,CAAC;IAC9B,IAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,UAAC,EAAE;QACnB,IAAI,CAAC,qBAAa,CAAC,WAAW,CAAC,EAAE;YAC/B,OAAO,EAAE,CAAC;SACX;QAED,IAAM,GAAG,GAAG,EAAE,CAAC;QACf,IAAM,YAAY,GAAa,EAAE,CAAC;QAClC,IAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,UAAC,EAAM;gBAAN,KAAA,aAAM,EAAL,CAAC,QAAA,EAAE,CAAC,QAAA;YACxC,IAAI,CAAC,KAAK,qBAAa,CAAC,KAAK,EAAE;gBAC7B,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACtB;iBAAM;gBACL,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aACnB;QACH,CAAC,CAAC,CAAC;QAEH,IAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,UAAC,CAAC;YAC1B,IAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAChC,UAAC,IAAI,gBAAK,OAAA,CAAA,MAAA,EAAE,CAAC,IAAI,CAAC,0CAAE,QAAQ,EAAE,OAAK,MAAA,CAAC,CAAC,IAAI,CAAC,0CAAE,QAAQ,EAAE,CAAA,CAAA,EAAA,CACvD,CAAC;YAEF,IAAI,OAAO,EAAE;gBACX,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACrB;YAED,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qBAAa,CAAC,EAAE,CAAC,EAAE;YACtB,OAAO,EAAE,CAAC;SACX;QAED,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,EAAM;gBAAN,KAAA,aAAM,EAAL,CAAC,QAAA,EAAE,CAAC,QAAA;YAC/B,IAAM,IAAI,GAAG,WAAW,CAAC;YAEzB,QAAQ,WAAW,CAAC,CAAC,CAAC,EAAE;gBACtB,KAAK,qBAAa,CAAC,KAAK;oBACtB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAEX,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,UAAC,EAAM;4BAAN,KAAA,aAAM,EAAL,CAAC,QAAA,EAAE,CAAC,QAAA;wBACjC,IAAI,CAAC,KAAK,qBAAa,CAAC,OAAO,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;4BACtD,IAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;4BAE9B,IAAI,OAAO,GAAG,KAAK,WAAW,EAAE;gCAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;6BACd;yBACF;oBACH,CAAC,CAAC,CAAC;oBACH,MAAM;gBACR,KAAK,qBAAa,CAAC,MAAM;oBACvB,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;wBACpB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAEX,MAAM;qBACP;oBAED,IAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAEtC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;wBACxC,MAAM,IAAI,SAAS,CAAC,6BAA6B,CAAC,CAAC;qBACpD;oBAED,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;oBAC/B,MAAM;gBACR,KAAK,qBAAa,CAAC,KAAK;oBACtB,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;wBACpB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAEX,MAAM;qBACP;oBAED,IAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAEpC,IAAI,CAAC,qBAAa,CAAC,CAAC,CAAC,IAAI,CAAC,qBAAa,CAAC,SAAS,CAAC,EAAE;wBAClD,MAAM,IAAI,SAAS,CAAC,6BAA6B,CAAC,CAAC;qBACpD;oBAED,0CAA0C;oBAC1C,GAAG,CAAC,CAAC,CAAC,yBAAQ,CAAC,GAAK,SAAS,CAAE,CAAC;oBAChC,MAAM;gBACR,KAAK,qBAAa,CAAC,OAAO;oBACxB,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;wBACpB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAEX,MAAM;qBACP;oBAED,IAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAEvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;wBACzC,MAAM,IAAI,SAAS,CAAC,8BAA8B,CAAC,CAAC;qBACrD;oBAED,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAChC,MAAM;gBACR,KAAK,qBAAa,CAAC,OAAO;oBACxB,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM;gBACR;oBACE,IAAM,aAAW,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAElC,qCAAqC;oBACrC,IAAM,GAAC,GAAG,QAAQ;yBACf,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,CAAC,CAAC,EAAJ,CAAI,CAAC;yBAChB,MAAM,CACL,UAAC,GAAG,EAAE,GAAG;wBACP,OAAA,OAAO,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,wCAAK,GAAG,WAAK,GAAG,GAAE,CAAC,CAAC,GAAG;oBAArD,CAAqD,EACvD,EAAE,CACH,CAAC;oBAEJ,GAAG,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,EAAE,WAAW,eAAA,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAA,EAAE,CAAC,CAAC;oBACjD,MAAM;aACT;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAxB,CAAwB,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,mBAAmB,CAAC,EAQ5B;QAPC,WAAW,iBAAA,EACX,CAAC,OAAA,EACD,CAAC,OAAA;IAMD,4BAA4B;IAC5B,QAAQ,WAAW,EAAE;QACnB,KAAK,qBAAa,CAAC,MAAM;YACvB,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,qBAAa,CAAC,OAAO;YACxB,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,qBAAa,CAAC,OAAO;YACxB,OAAO,CAAC,CAAC;KACZ;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,IAAI,CAAC,GAAG;IACf,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,eAAe,CAAC,KAExB;IACC,OAAO,UAAC,CAAM,EAAE,CAAM,EAAE,GAAQ;QAC9B,QAAQ,KAAK,CAAC,GAAG,CAAC,EAAE;YAClB,KAAK,qBAAa,CAAC,OAAO;gBACxB,OAAO,uBAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,wBAAU,EAAE,CAAC,CAAC;YACzC,KAAK,qBAAa,CAAC,OAAO;gBACxB,OAAO,CAAC,CAAC;YACX,KAAK,qBAAa,CAAC,MAAM;gBACvB,OAAO,uBAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,wBAAU,EAAE,CAAC,CAAC;SAC1C;IACH,CAAC,CAAC;AACJ,CAAC;AAIC,0CAAe"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.d.ts b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.d.ts
new file mode 100644
index 0000000..5959781
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.d.ts
@@ -0,0 +1,6 @@
+import { Customize, Key } from "./types";
+export default function joinArrays({ customizeArray, customizeObject, key, }?: {
+    customizeArray?: Customize;
+    customizeObject?: Customize;
+    key?: Key;
+}): (a: any, b: any, k: Key) => any;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.js b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.js
new file mode 100644
index 0000000..bae886b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.js
@@ -0,0 +1,70 @@
+"use strict";
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from) {
+    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
+        to[j] = from[i];
+    return to;
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+exports.__esModule = true;
+var clone_deep_1 = __importDefault(require("clone-deep"));
+var merge_with_1 = __importDefault(require("./merge-with"));
+var utils_1 = require("./utils");
+var isArray = Array.isArray;
+function joinArrays(_a) {
+    var _b = _a === void 0 ? {} : _a, customizeArray = _b.customizeArray, customizeObject = _b.customizeObject, key = _b.key;
+    return function _joinArrays(a, b, k) {
+        var newKey = key ? key + "." + k : k;
+        if (utils_1.isFunction(a) && utils_1.isFunction(b)) {
+            return function () {
+                var args = [];
+                for (var _i = 0; _i < arguments.length; _i++) {
+                    args[_i] = arguments[_i];
+                }
+                return _joinArrays(a.apply(void 0, __spreadArray([], __read(args))), b.apply(void 0, __spreadArray([], __read(args))), k);
+            };
+        }
+        if (isArray(a) && isArray(b)) {
+            var customResult = customizeArray && customizeArray(a, b, newKey);
+            return customResult || __spreadArray(__spreadArray([], __read(a)), __read(b));
+        }
+        if (utils_1.isRegex(b)) {
+            return b;
+        }
+        if (utils_1.isPlainObject(a) && utils_1.isPlainObject(b)) {
+            var customResult = customizeObject && customizeObject(a, b, newKey);
+            return (customResult ||
+                merge_with_1["default"]([a, b], joinArrays({
+                    customizeArray: customizeArray,
+                    customizeObject: customizeObject,
+                    key: newKey
+                })));
+        }
+        if (utils_1.isPlainObject(b)) {
+            return clone_deep_1["default"](b);
+        }
+        if (isArray(b)) {
+            return __spreadArray([], __read(b));
+        }
+        return b;
+    };
+}
+exports["default"] = joinArrays;
+//# sourceMappingURL=join-arrays.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.js.map b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.js.map
new file mode 100644
index 0000000..3bbf3f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/join-arrays.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"join-arrays.js","sourceRoot":"","sources":["../src/join-arrays.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,0DAAmC;AAEnC,4DAAqC;AACrC,iCAA6D;AAE7D,IAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;AAE9B,SAAwB,UAAU,CAAC,EAQ7B;QAR6B,qBAQ/B,EAAE,KAAA,EAPJ,cAAc,oBAAA,EACd,eAAe,qBAAA,EACf,GAAG,SAAA;IAMH,OAAO,SAAS,WAAW,CAAC,CAAM,EAAE,CAAM,EAAE,CAAM;QAChD,IAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAI,GAAG,SAAI,CAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvC,IAAI,kBAAU,CAAC,CAAC,CAAC,IAAI,kBAAU,CAAC,CAAC,CAAC,EAAE;YAClC,OAAO;gBAAC,cAAc;qBAAd,UAAc,EAAd,qBAAc,EAAd,IAAc;oBAAd,yBAAc;;gBAAK,OAAA,WAAW,CAAC,CAAC,wCAAI,IAAI,KAAG,CAAC,wCAAI,IAAI,KAAG,CAAC,CAAC;YAAtC,CAAsC,CAAC;SACnE;QAED,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;YAC5B,IAAM,YAAY,GAAG,cAAc,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAEpE,OAAO,YAAY,2CAAQ,CAAC,WAAK,CAAC,EAAC,CAAC;SACrC;QAED,IAAI,eAAO,CAAC,CAAC,CAAC,EAAE;YACd,OAAO,CAAC,CAAC;SACV;QAED,IAAI,qBAAa,CAAC,CAAC,CAAC,IAAI,qBAAa,CAAC,CAAC,CAAC,EAAE;YACxC,IAAM,YAAY,GAAG,eAAe,IAAI,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAEtE,OAAO,CACL,YAAY;gBACZ,uBAAS,CACP,CAAC,CAAC,EAAE,CAAC,CAAC,EACN,UAAU,CAAC;oBACT,cAAc,gBAAA;oBACd,eAAe,iBAAA;oBACf,GAAG,EAAE,MAAM;iBACZ,CAAC,CACH,CACF,CAAC;SACH;QAED,IAAI,qBAAa,CAAC,CAAC,CAAC,EAAE;YACpB,OAAO,uBAAS,CAAC,CAAC,CAAC,CAAC;SACrB;QAED,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;YACd,gCAAW,CAAC,GAAE;SACf;QAED,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AApDD,gCAoDC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.d.ts b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.d.ts
new file mode 100644
index 0000000..633e6b7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.d.ts
@@ -0,0 +1,2 @@
+declare function mergeWith(objects: object[], customizer: any): object;
+export default mergeWith;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.js b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.js
new file mode 100644
index 0000000..e4f0fe6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.js
@@ -0,0 +1,38 @@
+"use strict";
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+exports.__esModule = true;
+function mergeWith(objects, customizer) {
+    var _a = __read(objects), first = _a[0], rest = _a.slice(1);
+    var ret = first;
+    rest.forEach(function (a) {
+        ret = mergeTo(ret, a, customizer);
+    });
+    return ret;
+}
+function mergeTo(a, b, customizer) {
+    var ret = {};
+    Object.keys(a)
+        .concat(Object.keys(b))
+        .forEach(function (k) {
+        var v = customizer(a[k], b[k], k);
+        ret[k] = typeof v === "undefined" ? a[k] : v;
+    });
+    return ret;
+}
+exports["default"] = mergeWith;
+//# sourceMappingURL=merge-with.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.js.map b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.js.map
new file mode 100644
index 0000000..c14abaa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/merge-with.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"merge-with.js","sourceRoot":"","sources":["../src/merge-with.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAAA,SAAS,SAAS,CAAC,OAAiB,EAAE,UAAU;IACxC,IAAA,KAAA,OAAmB,OAAO,CAAA,EAAzB,KAAK,QAAA,EAAK,IAAI,cAAW,CAAC;IACjC,IAAI,GAAG,GAAG,KAAK,CAAC;IAEhB,IAAI,CAAC,OAAO,CAAC,UAAC,CAAC;QACb,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU;IAC/B,IAAM,GAAG,GAAG,EAAE,CAAC;IAEf,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;SACX,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACtB,OAAO,CAAC,UAAC,CAAC;QACT,IAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpC,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEL,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qBAAe,SAAS,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.d.ts b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.d.ts
new file mode 100644
index 0000000..a1a9edd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.d.ts
@@ -0,0 +1,14 @@
+export declare type Key = string;
+export declare type Customize = (a: any, b: any, key: Key) => any;
+export interface ICustomizeOptions {
+    customizeArray?: Customize;
+    customizeObject?: Customize;
+}
+export declare enum CustomizeRule {
+    Match = "match",
+    Merge = "merge",
+    Append = "append",
+    Prepend = "prepend",
+    Replace = "replace"
+}
+export declare type CustomizeRuleString = "match" | "merge" | "append" | "prepend" | "replace";
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.js b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.js
new file mode 100644
index 0000000..6195ceb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.js
@@ -0,0 +1,12 @@
+"use strict";
+exports.__esModule = true;
+exports.CustomizeRule = void 0;
+var CustomizeRule;
+(function (CustomizeRule) {
+    CustomizeRule["Match"] = "match";
+    CustomizeRule["Merge"] = "merge";
+    CustomizeRule["Append"] = "append";
+    CustomizeRule["Prepend"] = "prepend";
+    CustomizeRule["Replace"] = "replace";
+})(CustomizeRule = exports.CustomizeRule || (exports.CustomizeRule = {}));
+//# sourceMappingURL=types.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.js.map b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.js.map
new file mode 100644
index 0000000..eec91de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/types.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":";;;AASA,IAAY,aAMX;AAND,WAAY,aAAa;IACvB,gCAAe,CAAA;IACf,gCAAe,CAAA;IACf,kCAAiB,CAAA;IACjB,oCAAmB,CAAA;IACnB,oCAAmB,CAAA;AACrB,CAAC,EANW,aAAa,GAAb,qBAAa,KAAb,qBAAa,QAMxB"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.d.ts b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.d.ts
new file mode 100644
index 0000000..15f18cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.d.ts
@@ -0,0 +1,2 @@
+declare function mergeUnique(key: string, uniques: string[], getter: (a: object) => string): (a: [], b: [], k: string) => false | any[];
+export default mergeUnique;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.js b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.js
new file mode 100644
index 0000000..725e108
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.js
@@ -0,0 +1,41 @@
+"use strict";
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from) {
+    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
+        to[j] = from[i];
+    return to;
+};
+exports.__esModule = true;
+function mergeUnique(key, uniques, getter) {
+    var uniquesSet = new Set(uniques);
+    return function (a, b, k) {
+        return (k === key) && Array.from(__spreadArray(__spreadArray([], __read(a)), __read(b)).map(function (it) { return ({ key: getter(it), value: it }); })
+            .map(function (_a) {
+            var key = _a.key, value = _a.value;
+            return ({ key: (uniquesSet.has(key) ? key : value), value: value });
+        })
+            .reduce(function (m, _a) {
+            var key = _a.key, value = _a.value;
+            m["delete"](key); // This is required to preserve backward compatible order of elements after a merge.
+            return m.set(key, value);
+        }, new Map())
+            .values());
+    };
+}
+exports["default"] = mergeUnique;
+//# sourceMappingURL=unique.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.js.map b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.js.map
new file mode 100644
index 0000000..92e17f9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/unique.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"unique.js","sourceRoot":"","sources":["../src/unique.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,WAAW,CAClB,GAAW,EACX,OAAiB,EACjB,MAA6B;IAE7B,IAAI,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;IACjC,OAAO,UAAC,CAAK,EAAE,CAAK,EAAE,CAAS;QAC7B,OAAA,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CACvB,uCAAI,CAAC,WAAK,CAAC,GACN,GAAG,CAAC,UAAC,EAAU,IAAK,OAAA,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAhC,CAAgC,CAAC;aACrD,GAAG,CAAC,UAAC,EAAc;gBAAZ,GAAG,SAAA,EAAE,KAAK,WAAA;YAAO,OAAA,CAAC,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,EAAC,CAAC;QAA3D,CAA2D,CAAC;aACpF,MAAM,CACH,UAAC,CAAC,EAAE,EAAa;gBAAX,GAAG,SAAA,EAAE,KAAK,WAAA;YACd,CAAC,CAAC,QAAM,CAAA,CAAC,GAAG,CAAC,CAAC,CAAC,oFAAoF;YACnG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC1B,CAAC,EACD,IAAI,GAAG,EAAY,CAAC;aACvB,MAAM,EAAE,CAAC;IAVhB,CAUgB,CAAA;AACpB,CAAC;AAED,qBAAe,WAAW,CAAC"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.d.ts b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.d.ts
new file mode 100644
index 0000000..b584ad2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.d.ts
@@ -0,0 +1,5 @@
+declare function isRegex(o: any): boolean;
+declare function isFunction(functionToCheck: any): any;
+declare function isPlainObject(a: any): boolean;
+declare function isUndefined(a: any): boolean;
+export { isRegex, isFunction, isPlainObject, isUndefined };
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.js b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.js
new file mode 100644
index 0000000..db059a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.js
@@ -0,0 +1,24 @@
+"use strict";
+exports.__esModule = true;
+exports.isUndefined = exports.isPlainObject = exports.isFunction = exports.isRegex = void 0;
+function isRegex(o) {
+    return o instanceof RegExp;
+}
+exports.isRegex = isRegex;
+// https://stackoverflow.com/a/7356528/228885
+function isFunction(functionToCheck) {
+    return (functionToCheck && {}.toString.call(functionToCheck) === "[object Function]");
+}
+exports.isFunction = isFunction;
+function isPlainObject(a) {
+    if (a === null || Array.isArray(a)) {
+        return false;
+    }
+    return typeof a === "object";
+}
+exports.isPlainObject = isPlainObject;
+function isUndefined(a) {
+    return typeof a === "undefined";
+}
+exports.isUndefined = isUndefined;
+//# sourceMappingURL=utils.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.js.map b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.js.map
new file mode 100644
index 0000000..dd22409
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/dist/utils.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":";;;AAAA,SAAS,OAAO,CAAC,CAAC;IAChB,OAAO,CAAC,YAAY,MAAM,CAAC;AAC7B,CAAC;AAqBQ,0BAAO;AAnBhB,6CAA6C;AAC7C,SAAS,UAAU,CAAC,eAAe;IACjC,OAAO,CACL,eAAe,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,mBAAmB,CAC7E,CAAC;AACJ,CAAC;AAciB,gCAAU;AAZ5B,SAAS,aAAa,CAAC,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAClC,OAAO,KAAK,CAAC;KACd;IAED,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC/B,CAAC;AAM6B,sCAAa;AAJ3C,SAAS,WAAW,CAAC,CAAC;IACpB,OAAO,OAAO,CAAC,KAAK,WAAW,CAAC;AAClC,CAAC;AAE4C,kCAAW"}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack-merge/package.json b/node_modules/mathjs/examples/node_modules/webpack-merge/package.json
new file mode 100644
index 0000000..9e51429
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-merge/package.json
@@ -0,0 +1,58 @@
+{
+  "name": "webpack-merge",
+  "description": "Variant of merge that's useful for webpack configuration",
+  "author": "Juho Vepsalainen <bebraw@gmail.com>",
+  "version": "5.8.0",
+  "scripts": {
+    "build": "tsc",
+    "format": "prettier . --write --ignore-path .gitignore",
+    "start": "tsdx watch",
+    "test": "tsdx test",
+    "prepare": "npm run build"
+  },
+  "main": "dist/index.js",
+  "typings": "dist/index.d.ts",
+  "files": [
+    "dist"
+  ],
+  "dependencies": {
+    "clone-deep": "^4.0.1",
+    "wildcard": "^2.0.0"
+  },
+  "devDependencies": {
+    "@types/estree": "0.0.48",
+    "husky": "^6.0.0",
+    "prettier": "^2.3.1",
+    "tsdx": "^0.14.1",
+    "tslib": "^2.2.0",
+    "typescript": "^4.3.2",
+    "webpack": "^5.38.1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/survivejs/webpack-merge.git"
+  },
+  "homepage": "https://github.com/survivejs/webpack-merge",
+  "bugs": {
+    "url": "https://github.com/survivejs/webpack-merge/issues"
+  },
+  "keywords": [
+    "webpack",
+    "merge"
+  ],
+  "engines": {
+    "node": ">=10.0.0"
+  },
+  "jest": {
+    "collectCoverage": true,
+    "collectCoverageFrom": [
+      "dist/*.js"
+    ]
+  },
+  "license": "MIT",
+  "husky": {
+    "hooks": {
+      "pre-commit": "npm run test"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/LICENSE b/node_modules/mathjs/examples/node_modules/webpack-sources/LICENSE
new file mode 100644
index 0000000..7c6f895
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/README.md b/node_modules/mathjs/examples/node_modules/webpack-sources/README.md
new file mode 100644
index 0000000..5372884
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/README.md
@@ -0,0 +1,228 @@
+# webpack-sources
+
+Contains multiple classes which represent a `Source`. A `Source` can be asked for source code, size, source map and hash.
+
+## `Source`
+
+Base class for all sources.
+
+### Public methods
+
+All methods should be considered as expensive as they may need to do computations.
+
+#### `source`
+
+```typescript
+Source.prototype.source() -> String | Buffer
+```
+
+Returns the represented source code as string or Buffer (for binary Sources).
+
+#### `buffer`
+
+```typescript
+Source.prototype.buffer() -> Buffer
+```
+
+Returns the represented source code as Buffer. Strings are converted to utf-8.
+
+#### `size`
+
+```typescript
+Source.prototype.size() -> Number
+```
+
+Returns the size in bytes of the represented source code.
+
+#### `map`
+
+```typescript
+Source.prototype.map(options?: Object) -> Object | null
+```
+
+Returns the SourceMap of the represented source code as JSON. May return `null` if no SourceMap is available.
+
+The `options` object can contain the following keys:
+
+- `columns: Boolean` (default `true`): If set to false the implementation may omit mappings for columns.
+
+#### `sourceAndMap`
+
+```typescript
+Source.prototype.sourceAndMap(options?: Object) -> {
+	source: String | Buffer,
+	map: Object | null
+}
+```
+
+Returns both, source code (like `Source.prototype.source()` and SourceMap (like `Source.prototype.map()`). This method could have better performance than calling `source()` and `map()` separately.
+
+See `map()` for `options`.
+
+#### `updateHash`
+
+```typescript
+Source.prototype.updateHash(hash: Hash) -> void
+```
+
+Updates the provided `Hash` object with the content of the represented source code. (`Hash` is an object with an `update` method, which is called with string values)
+
+## `RawSource`
+
+Represents source code without SourceMap.
+
+```typescript
+new RawSource(sourceCode: String | Buffer)
+```
+
+## `OriginalSource`
+
+Represents source code, which is a copy of the original file.
+
+```typescript
+new OriginalSource(
+	sourceCode: String | Buffer,
+	name: String
+)
+```
+
+- `sourceCode`: The source code.
+- `name`: The filename of the original source code.
+
+OriginalSource tries to create column mappings if requested, by splitting the source code at typical statement borders (`;`, `{`, `}`).
+
+## `SourceMapSource`
+
+Represents source code with SourceMap, optionally having an additional SourceMap for the original source.
+
+```typescript
+new SourceMapSource(
+	sourceCode: String | Buffer,
+	name: String,
+	sourceMap: Object | String | Buffer,
+	originalSource?: String | Buffer,
+	innerSourceMap?: Object | String | Buffer,
+	removeOriginalSource?: boolean
+)
+```
+
+- `sourceCode`: The source code.
+- `name`: The filename of the original source code.
+- `sourceMap`: The SourceMap for the source code.
+- `originalSource`: The source code of the original file. Can be omitted if the `sourceMap` already contains the original source code.
+- `innerSourceMap`: The SourceMap for the `originalSource`/`name`.
+- `removeOriginalSource`: Removes the source code for `name` from the final map, keeping only the deeper mappings for that file.
+
+The `SourceMapSource` supports "identity" mappings for the `innerSourceMap`.
+When original source matches generated source for a mapping it's assumed to be mapped char by char allowing to keep finer mappings from `sourceMap`.
+
+## `CachedSource`
+
+Decorates a `Source` and caches returned results of `map`, `source`, `buffer`, `size` and `sourceAndMap` in memory. `updateHash` is not cached.
+It tries to reused cached results from other methods to avoid calculations, i. e. when `source` is already cached, calling `size` will get the size from the cached source, calling `sourceAndMap` will only call `map` on the wrapped Source.
+
+```typescript
+new CachedSource(source: Source)
+new CachedSource(source: Source | () => Source, cachedData?: CachedData)
+```
+
+Instead of passing a `Source` object directly one can pass an function that returns a `Source` object. The function is only called when needed and once.
+
+### Public methods
+
+#### `getCachedData()`
+
+Returns the cached data for passing to the constructor. All cached entries are converted to Buffers and strings are avoided.
+
+#### `original()`
+
+Returns the original `Source` object.
+
+#### `originalLazy()`
+
+Returns the original `Source` object or a function returning these.
+
+## `PrefixSource`
+
+Prefix every line of the decorated `Source` with a provided string.
+
+```typescript
+new PrefixSource(
+	prefix: String,
+	source: Source | String | Buffer
+)
+```
+
+## `ConcatSource`
+
+Concatenate multiple `Source`s or strings to a single source.
+
+```typescript
+new ConcatSource(
+	...items?: Source | String
+)
+```
+
+### Public methods
+
+#### `add`
+
+```typescript
+ConcatSource.prototype.add(item: Source | String)
+```
+
+Adds an item to the source.
+
+## `ReplaceSource`
+
+Decorates a `Source` with replacements and insertions of source code.
+
+The `ReplaceSource` supports "identity" mappings for child source.
+When original source matches generated source for a mapping it's assumed to be mapped char by char allowing to split mappings at replacements/insertions.
+
+### Public methods
+
+#### `replace`
+
+```typescript
+ReplaceSource.prototype.replace(
+	start: Number,
+	end: Number,
+	replacement: String
+)
+```
+
+Replaces chars from `start` (0-indexed, inclusive) to `end` (0-indexed, inclusive) with `replacement`.
+
+Locations represents locations in the original source and are not influenced by other replacements or insertions.
+
+#### `insert`
+
+```typescript
+ReplaceSource.prototype.insert(
+	pos: Number,
+	insertion: String
+)
+```
+
+Inserts the `insertion` before char `pos` (0-indexed).
+
+Location represents location in the original source and is not influenced by other replacements or insertions.
+
+#### `original`
+
+Get decorated `Source`.
+
+## `CompatSource`
+
+Converts a Source-like object into a real Source object.
+
+### Public methods
+
+#### static `from`
+
+```typescript
+CompatSource.from(sourceLike: any | Source)
+```
+
+If `sourceLike` is a real Source it returns it unmodified. Otherwise it returns it wrapped in a CompatSource.
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/CachedSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/CachedSource.js
new file mode 100644
index 0000000..5fc2d4c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/CachedSource.js
@@ -0,0 +1,274 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Source = require("./Source");
+const streamChunksOfSourceMap = require("./helpers/streamChunksOfSourceMap");
+const streamChunksOfRawSource = require("./helpers/streamChunksOfRawSource");
+const streamAndGetSourceAndMap = require("./helpers/streamAndGetSourceAndMap");
+
+const mapToBufferedMap = map => {
+	if (typeof map !== "object" || !map) return map;
+	const bufferedMap = Object.assign({}, map);
+	if (map.mappings) {
+		bufferedMap.mappings = Buffer.from(map.mappings, "utf-8");
+	}
+	if (map.sourcesContent) {
+		bufferedMap.sourcesContent = map.sourcesContent.map(
+			str => str && Buffer.from(str, "utf-8")
+		);
+	}
+	return bufferedMap;
+};
+
+const bufferedMapToMap = bufferedMap => {
+	if (typeof bufferedMap !== "object" || !bufferedMap) return bufferedMap;
+	const map = Object.assign({}, bufferedMap);
+	if (bufferedMap.mappings) {
+		map.mappings = bufferedMap.mappings.toString("utf-8");
+	}
+	if (bufferedMap.sourcesContent) {
+		map.sourcesContent = bufferedMap.sourcesContent.map(
+			buffer => buffer && buffer.toString("utf-8")
+		);
+	}
+	return map;
+};
+
+class CachedSource extends Source {
+	constructor(source, cachedData) {
+		super();
+		this._source = source;
+		this._cachedSourceType = cachedData ? cachedData.source : undefined;
+		this._cachedSource = undefined;
+		this._cachedBuffer = cachedData ? cachedData.buffer : undefined;
+		this._cachedSize = cachedData ? cachedData.size : undefined;
+		this._cachedMaps = cachedData ? cachedData.maps : new Map();
+		this._cachedHashUpdate = cachedData ? cachedData.hash : undefined;
+	}
+
+	getCachedData() {
+		const bufferedMaps = new Map();
+		for (const pair of this._cachedMaps) {
+			let cacheEntry = pair[1];
+			if (cacheEntry.bufferedMap === undefined) {
+				cacheEntry.bufferedMap = mapToBufferedMap(
+					this._getMapFromCacheEntry(cacheEntry)
+				);
+			}
+			bufferedMaps.set(pair[0], {
+				map: undefined,
+				bufferedMap: cacheEntry.bufferedMap
+			});
+		}
+		// We don't want to cache strings
+		// So if we have a caches sources
+		// create a buffer from it and only store
+		// if it was a Buffer or string
+		if (this._cachedSource) {
+			this.buffer();
+		}
+		return {
+			buffer: this._cachedBuffer,
+			source:
+				this._cachedSourceType !== undefined
+					? this._cachedSourceType
+					: typeof this._cachedSource === "string"
+					? true
+					: Buffer.isBuffer(this._cachedSource)
+					? false
+					: undefined,
+			size: this._cachedSize,
+			maps: bufferedMaps,
+			hash: this._cachedHashUpdate
+		};
+	}
+
+	originalLazy() {
+		return this._source;
+	}
+
+	original() {
+		if (typeof this._source === "function") this._source = this._source();
+		return this._source;
+	}
+
+	source() {
+		const source = this._getCachedSource();
+		if (source !== undefined) return source;
+		return (this._cachedSource = this.original().source());
+	}
+
+	_getMapFromCacheEntry(cacheEntry) {
+		if (cacheEntry.map !== undefined) {
+			return cacheEntry.map;
+		} else if (cacheEntry.bufferedMap !== undefined) {
+			return (cacheEntry.map = bufferedMapToMap(cacheEntry.bufferedMap));
+		}
+	}
+
+	_getCachedSource() {
+		if (this._cachedSource !== undefined) return this._cachedSource;
+		if (this._cachedBuffer && this._cachedSourceType !== undefined) {
+			return (this._cachedSource = this._cachedSourceType
+				? this._cachedBuffer.toString("utf-8")
+				: this._cachedBuffer);
+		}
+	}
+
+	buffer() {
+		if (this._cachedBuffer !== undefined) return this._cachedBuffer;
+		if (this._cachedSource !== undefined) {
+			if (Buffer.isBuffer(this._cachedSource)) {
+				return (this._cachedBuffer = this._cachedSource);
+			}
+			return (this._cachedBuffer = Buffer.from(this._cachedSource, "utf-8"));
+		}
+		if (typeof this.original().buffer === "function") {
+			return (this._cachedBuffer = this.original().buffer());
+		}
+		const bufferOrString = this.source();
+		if (Buffer.isBuffer(bufferOrString)) {
+			return (this._cachedBuffer = bufferOrString);
+		}
+		return (this._cachedBuffer = Buffer.from(bufferOrString, "utf-8"));
+	}
+
+	size() {
+		if (this._cachedSize !== undefined) return this._cachedSize;
+		if (this._cachedBuffer !== undefined) {
+			return (this._cachedSize = this._cachedBuffer.length);
+		}
+		const source = this._getCachedSource();
+		if (source !== undefined) {
+			return (this._cachedSize = Buffer.byteLength(source));
+		}
+		return (this._cachedSize = this.original().size());
+	}
+
+	sourceAndMap(options) {
+		const key = options ? JSON.stringify(options) : "{}";
+		const cacheEntry = this._cachedMaps.get(key);
+		// Look for a cached map
+		if (cacheEntry !== undefined) {
+			// We have a cached map in some representation
+			const map = this._getMapFromCacheEntry(cacheEntry);
+			// Either get the cached source or compute it
+			return { source: this.source(), map };
+		}
+		// Look for a cached source
+		let source = this._getCachedSource();
+		// Compute the map
+		let map;
+		if (source !== undefined) {
+			map = this.original().map(options);
+		} else {
+			// Compute the source and map together.
+			const sourceAndMap = this.original().sourceAndMap(options);
+			source = sourceAndMap.source;
+			map = sourceAndMap.map;
+			this._cachedSource = source;
+		}
+		this._cachedMaps.set(key, {
+			map,
+			bufferedMap: undefined
+		});
+		return { source, map };
+	}
+
+	streamChunks(options, onChunk, onSource, onName) {
+		const key = options ? JSON.stringify(options) : "{}";
+		if (
+			this._cachedMaps.has(key) &&
+			(this._cachedBuffer !== undefined || this._cachedSource !== undefined)
+		) {
+			const { source, map } = this.sourceAndMap(options);
+			if (map) {
+				return streamChunksOfSourceMap(
+					source,
+					map,
+					onChunk,
+					onSource,
+					onName,
+					!!(options && options.finalSource),
+					true
+				);
+			} else {
+				return streamChunksOfRawSource(
+					source,
+					onChunk,
+					onSource,
+					onName,
+					!!(options && options.finalSource)
+				);
+			}
+		}
+		const { result, source, map } = streamAndGetSourceAndMap(
+			this.original(),
+			options,
+			onChunk,
+			onSource,
+			onName
+		);
+		this._cachedSource = source;
+		this._cachedMaps.set(key, {
+			map,
+			bufferedMap: undefined
+		});
+		return result;
+	}
+
+	map(options) {
+		const key = options ? JSON.stringify(options) : "{}";
+		const cacheEntry = this._cachedMaps.get(key);
+		if (cacheEntry !== undefined) {
+			return this._getMapFromCacheEntry(cacheEntry);
+		}
+		const map = this.original().map(options);
+		this._cachedMaps.set(key, {
+			map,
+			bufferedMap: undefined
+		});
+		return map;
+	}
+
+	updateHash(hash) {
+		if (this._cachedHashUpdate !== undefined) {
+			for (const item of this._cachedHashUpdate) hash.update(item);
+			return;
+		}
+		const update = [];
+		let currentString = undefined;
+		const tracker = {
+			update: item => {
+				if (typeof item === "string" && item.length < 10240) {
+					if (currentString === undefined) {
+						currentString = item;
+					} else {
+						currentString += item;
+						if (currentString.length > 102400) {
+							update.push(Buffer.from(currentString));
+							currentString = undefined;
+						}
+					}
+				} else {
+					if (currentString !== undefined) {
+						update.push(Buffer.from(currentString));
+						currentString = undefined;
+					}
+					update.push(item);
+				}
+			}
+		};
+		this.original().updateHash(tracker);
+		if (currentString !== undefined) {
+			update.push(Buffer.from(currentString));
+		}
+		for (const item of update) hash.update(item);
+		this._cachedHashUpdate = update;
+	}
+}
+
+module.exports = CachedSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/CompatSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/CompatSource.js
new file mode 100644
index 0000000..0b9d9bd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/CompatSource.js
@@ -0,0 +1,66 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Source = require("./Source");
+
+class CompatSource extends Source {
+	static from(sourceLike) {
+		return sourceLike instanceof Source
+			? sourceLike
+			: new CompatSource(sourceLike);
+	}
+
+	constructor(sourceLike) {
+		super();
+		this._sourceLike = sourceLike;
+	}
+
+	source() {
+		return this._sourceLike.source();
+	}
+
+	buffer() {
+		if (typeof this._sourceLike.buffer === "function") {
+			return this._sourceLike.buffer();
+		}
+		return super.buffer();
+	}
+
+	size() {
+		if (typeof this._sourceLike.size === "function") {
+			return this._sourceLike.size();
+		}
+		return super.size();
+	}
+
+	map(options) {
+		if (typeof this._sourceLike.map === "function") {
+			return this._sourceLike.map(options);
+		}
+		return super.map(options);
+	}
+
+	sourceAndMap(options) {
+		if (typeof this._sourceLike.sourceAndMap === "function") {
+			return this._sourceLike.sourceAndMap(options);
+		}
+		return super.sourceAndMap(options);
+	}
+
+	updateHash(hash) {
+		if (typeof this._sourceLike.updateHash === "function") {
+			return this._sourceLike.updateHash(hash);
+		}
+		if (typeof this._sourceLike.map === "function") {
+			throw new Error(
+				"A Source-like object with a 'map' method must also provide an 'updateHash' method"
+			);
+		}
+		hash.update(this.buffer());
+	}
+}
+
+module.exports = CompatSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/ConcatSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/ConcatSource.js
new file mode 100644
index 0000000..3c7e7f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/ConcatSource.js
@@ -0,0 +1,319 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Source = require("./Source");
+const RawSource = require("./RawSource");
+const streamChunks = require("./helpers/streamChunks");
+const { getMap, getSourceAndMap } = require("./helpers/getFromStreamChunks");
+
+const stringsAsRawSources = new WeakSet();
+
+class ConcatSource extends Source {
+	constructor() {
+		super();
+		this._children = [];
+		for (let i = 0; i < arguments.length; i++) {
+			const item = arguments[i];
+			if (item instanceof ConcatSource) {
+				for (const child of item._children) {
+					this._children.push(child);
+				}
+			} else {
+				this._children.push(item);
+			}
+		}
+		this._isOptimized = arguments.length === 0;
+	}
+
+	getChildren() {
+		if (!this._isOptimized) this._optimize();
+		return this._children;
+	}
+
+	add(item) {
+		if (item instanceof ConcatSource) {
+			for (const child of item._children) {
+				this._children.push(child);
+			}
+		} else {
+			this._children.push(item);
+		}
+		this._isOptimized = false;
+	}
+
+	addAllSkipOptimizing(items) {
+		for (const item of items) {
+			this._children.push(item);
+		}
+	}
+
+	buffer() {
+		if (!this._isOptimized) this._optimize();
+		const buffers = [];
+		for (const child of this._children) {
+			if (typeof child.buffer === "function") {
+				buffers.push(child.buffer());
+			} else {
+				const bufferOrString = child.source();
+				if (Buffer.isBuffer(bufferOrString)) {
+					buffers.push(bufferOrString);
+				} else {
+					// This will not happen
+					buffers.push(Buffer.from(bufferOrString, "utf-8"));
+				}
+			}
+		}
+		return Buffer.concat(buffers);
+	}
+
+	source() {
+		if (!this._isOptimized) this._optimize();
+		let source = "";
+		for (const child of this._children) {
+			source += child.source();
+		}
+		return source;
+	}
+
+	size() {
+		if (!this._isOptimized) this._optimize();
+		let size = 0;
+		for (const child of this._children) {
+			size += child.size();
+		}
+		return size;
+	}
+
+	map(options) {
+		return getMap(this, options);
+	}
+
+	sourceAndMap(options) {
+		return getSourceAndMap(this, options);
+	}
+
+	streamChunks(options, onChunk, onSource, onName) {
+		if (!this._isOptimized) this._optimize();
+		if (this._children.length === 1)
+			return this._children[0].streamChunks(options, onChunk, onSource, onName);
+		let currentLineOffset = 0;
+		let currentColumnOffset = 0;
+		let sourceMapping = new Map();
+		let nameMapping = new Map();
+		const finalSource = !!(options && options.finalSource);
+		let code = "";
+		let needToCloseMapping = false;
+		for (const item of this._children) {
+			const sourceIndexMapping = [];
+			const nameIndexMapping = [];
+			let lastMappingLine = 0;
+			const { generatedLine, generatedColumn, source } = streamChunks(
+				item,
+				options,
+				// eslint-disable-next-line no-loop-func
+				(
+					chunk,
+					generatedLine,
+					generatedColumn,
+					sourceIndex,
+					originalLine,
+					originalColumn,
+					nameIndex
+				) => {
+					const line = generatedLine + currentLineOffset;
+					const column =
+						generatedLine === 1
+							? generatedColumn + currentColumnOffset
+							: generatedColumn;
+					if (needToCloseMapping) {
+						if (generatedLine !== 1 || generatedColumn !== 0) {
+							onChunk(
+								undefined,
+								currentLineOffset + 1,
+								currentColumnOffset,
+								-1,
+								-1,
+								-1,
+								-1
+							);
+						}
+						needToCloseMapping = false;
+					}
+					const resultSourceIndex =
+						sourceIndex < 0 || sourceIndex >= sourceIndexMapping.length
+							? -1
+							: sourceIndexMapping[sourceIndex];
+					const resultNameIndex =
+						nameIndex < 0 || nameIndex >= nameIndexMapping.length
+							? -1
+							: nameIndexMapping[nameIndex];
+					lastMappingLine = resultSourceIndex < 0 ? 0 : generatedLine;
+					if (finalSource) {
+						if (chunk !== undefined) code += chunk;
+						if (resultSourceIndex >= 0) {
+							onChunk(
+								undefined,
+								line,
+								column,
+								resultSourceIndex,
+								originalLine,
+								originalColumn,
+								resultNameIndex
+							);
+						}
+					} else {
+						if (resultSourceIndex < 0) {
+							onChunk(chunk, line, column, -1, -1, -1, -1);
+						} else {
+							onChunk(
+								chunk,
+								line,
+								column,
+								resultSourceIndex,
+								originalLine,
+								originalColumn,
+								resultNameIndex
+							);
+						}
+					}
+				},
+				(i, source, sourceContent) => {
+					let globalIndex = sourceMapping.get(source);
+					if (globalIndex === undefined) {
+						sourceMapping.set(source, (globalIndex = sourceMapping.size));
+						onSource(globalIndex, source, sourceContent);
+					}
+					sourceIndexMapping[i] = globalIndex;
+				},
+				(i, name) => {
+					let globalIndex = nameMapping.get(name);
+					if (globalIndex === undefined) {
+						nameMapping.set(name, (globalIndex = nameMapping.size));
+						onName(globalIndex, name);
+					}
+					nameIndexMapping[i] = globalIndex;
+				}
+			);
+			if (source !== undefined) code += source;
+			if (needToCloseMapping) {
+				if (generatedLine !== 1 || generatedColumn !== 0) {
+					onChunk(
+						undefined,
+						currentLineOffset + 1,
+						currentColumnOffset,
+						-1,
+						-1,
+						-1,
+						-1
+					);
+					needToCloseMapping = false;
+				}
+			}
+			if (generatedLine > 1) {
+				currentColumnOffset = generatedColumn;
+			} else {
+				currentColumnOffset += generatedColumn;
+			}
+			needToCloseMapping =
+				needToCloseMapping ||
+				(finalSource && lastMappingLine === generatedLine);
+			currentLineOffset += generatedLine - 1;
+		}
+		return {
+			generatedLine: currentLineOffset + 1,
+			generatedColumn: currentColumnOffset,
+			source: finalSource ? code : undefined
+		};
+	}
+
+	updateHash(hash) {
+		if (!this._isOptimized) this._optimize();
+		hash.update("ConcatSource");
+		for (const item of this._children) {
+			item.updateHash(hash);
+		}
+	}
+
+	_optimize() {
+		const newChildren = [];
+		let currentString = undefined;
+		let currentRawSources = undefined;
+		const addStringToRawSources = string => {
+			if (currentRawSources === undefined) {
+				currentRawSources = string;
+			} else if (Array.isArray(currentRawSources)) {
+				currentRawSources.push(string);
+			} else {
+				currentRawSources = [
+					typeof currentRawSources === "string"
+						? currentRawSources
+						: currentRawSources.source(),
+					string
+				];
+			}
+		};
+		const addSourceToRawSources = source => {
+			if (currentRawSources === undefined) {
+				currentRawSources = source;
+			} else if (Array.isArray(currentRawSources)) {
+				currentRawSources.push(source.source());
+			} else {
+				currentRawSources = [
+					typeof currentRawSources === "string"
+						? currentRawSources
+						: currentRawSources.source(),
+					source.source()
+				];
+			}
+		};
+		const mergeRawSources = () => {
+			if (Array.isArray(currentRawSources)) {
+				const rawSource = new RawSource(currentRawSources.join(""));
+				stringsAsRawSources.add(rawSource);
+				newChildren.push(rawSource);
+			} else if (typeof currentRawSources === "string") {
+				const rawSource = new RawSource(currentRawSources);
+				stringsAsRawSources.add(rawSource);
+				newChildren.push(rawSource);
+			} else {
+				newChildren.push(currentRawSources);
+			}
+		};
+		for (const child of this._children) {
+			if (typeof child === "string") {
+				if (currentString === undefined) {
+					currentString = child;
+				} else {
+					currentString += child;
+				}
+			} else {
+				if (currentString !== undefined) {
+					addStringToRawSources(currentString);
+					currentString = undefined;
+				}
+				if (stringsAsRawSources.has(child)) {
+					addSourceToRawSources(child);
+				} else {
+					if (currentRawSources !== undefined) {
+						mergeRawSources();
+						currentRawSources = undefined;
+					}
+					newChildren.push(child);
+				}
+			}
+		}
+		if (currentString !== undefined) {
+			addStringToRawSources(currentString);
+		}
+		if (currentRawSources !== undefined) {
+			mergeRawSources();
+		}
+		this._children = newChildren;
+		this._isOptimized = true;
+	}
+}
+
+module.exports = ConcatSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/OriginalSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/OriginalSource.js
new file mode 100644
index 0000000..59da29a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/OriginalSource.js
@@ -0,0 +1,135 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const { getMap, getSourceAndMap } = require("./helpers/getFromStreamChunks");
+const splitIntoLines = require("./helpers/splitIntoLines");
+const getGeneratedSourceInfo = require("./helpers/getGeneratedSourceInfo");
+const Source = require("./Source");
+const splitIntoPotentialTokens = require("./helpers/splitIntoPotentialTokens");
+
+class OriginalSource extends Source {
+	constructor(value, name) {
+		super();
+		const isBuffer = Buffer.isBuffer(value);
+		this._value = isBuffer ? undefined : value;
+		this._valueAsBuffer = isBuffer ? value : undefined;
+		this._name = name;
+	}
+
+	getName() {
+		return this._name;
+	}
+
+	source() {
+		if (this._value === undefined) {
+			this._value = this._valueAsBuffer.toString("utf-8");
+		}
+		return this._value;
+	}
+
+	buffer() {
+		if (this._valueAsBuffer === undefined) {
+			this._valueAsBuffer = Buffer.from(this._value, "utf-8");
+		}
+		return this._valueAsBuffer;
+	}
+
+	map(options) {
+		return getMap(this, options);
+	}
+
+	sourceAndMap(options) {
+		return getSourceAndMap(this, options);
+	}
+
+	/**
+	 * @param {object} options options
+	 * @param {function(string, number, number, number, number, number, number): void} onChunk called for each chunk of code
+	 * @param {function(number, string, string)} onSource called for each source
+	 * @param {function(number, string)} onName called for each name
+	 * @returns {void}
+	 */
+	streamChunks(options, onChunk, onSource, onName) {
+		if (this._value === undefined) {
+			this._value = this._valueAsBuffer.toString("utf-8");
+		}
+		onSource(0, this._name, this._value);
+		const finalSource = !!(options && options.finalSource);
+		if (!options || options.columns !== false) {
+			// With column info we need to read all lines and split them
+			const matches = splitIntoPotentialTokens(this._value);
+			let line = 1;
+			let column = 0;
+			if (matches !== null) {
+				for (const match of matches) {
+					const isEndOfLine = match.endsWith("\n");
+					if (isEndOfLine && match.length === 1) {
+						if (!finalSource) onChunk(match, line, column, -1, -1, -1, -1);
+					} else {
+						const chunk = finalSource ? undefined : match;
+						onChunk(chunk, line, column, 0, line, column, -1);
+					}
+					if (isEndOfLine) {
+						line++;
+						column = 0;
+					} else {
+						column += match.length;
+					}
+				}
+			}
+			return {
+				generatedLine: line,
+				generatedColumn: column,
+				source: finalSource ? this._value : undefined
+			};
+		} else if (finalSource) {
+			// Without column info and with final source we only
+			// need meta info to generate mapping
+			const result = getGeneratedSourceInfo(this._value);
+			const { generatedLine, generatedColumn } = result;
+			if (generatedColumn === 0) {
+				for (let line = 1; line < generatedLine; line++)
+					onChunk(undefined, line, 0, 0, line, 0, -1);
+			} else {
+				for (let line = 1; line <= generatedLine; line++)
+					onChunk(undefined, line, 0, 0, line, 0, -1);
+			}
+			return result;
+		} else {
+			// Without column info, but also without final source
+			// we need to split source by lines
+			let line = 1;
+			const matches = splitIntoLines(this._value);
+			let match;
+			for (match of matches) {
+				onChunk(finalSource ? undefined : match, line, 0, 0, line, 0, -1);
+				line++;
+			}
+			return matches.length === 0 || match.endsWith("\n")
+				? {
+						generatedLine: matches.length + 1,
+						generatedColumn: 0,
+						source: finalSource ? this._value : undefined
+				  }
+				: {
+						generatedLine: matches.length,
+						generatedColumn: match.length,
+						source: finalSource ? this._value : undefined
+				  };
+		}
+	}
+
+	updateHash(hash) {
+		if (this._valueAsBuffer === undefined) {
+			this._valueAsBuffer = Buffer.from(this._value, "utf-8");
+		}
+		hash.update("OriginalSource");
+		hash.update(this._valueAsBuffer);
+		hash.update(this._name || "");
+	}
+}
+
+module.exports = OriginalSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/PrefixSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/PrefixSource.js
new file mode 100644
index 0000000..a54314c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/PrefixSource.js
@@ -0,0 +1,114 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Source = require("./Source");
+const RawSource = require("./RawSource");
+const streamChunks = require("./helpers/streamChunks");
+const { getMap, getSourceAndMap } = require("./helpers/getFromStreamChunks");
+
+const REPLACE_REGEX = /\n(?=.|\s)/g;
+
+class PrefixSource extends Source {
+	constructor(prefix, source) {
+		super();
+		this._source =
+			typeof source === "string" || Buffer.isBuffer(source)
+				? new RawSource(source, true)
+				: source;
+		this._prefix = prefix;
+	}
+
+	getPrefix() {
+		return this._prefix;
+	}
+
+	original() {
+		return this._source;
+	}
+
+	source() {
+		const node = this._source.source();
+		const prefix = this._prefix;
+		return prefix + node.replace(REPLACE_REGEX, "\n" + prefix);
+	}
+
+	// TODO efficient buffer() implementation
+
+	map(options) {
+		return getMap(this, options);
+	}
+
+	sourceAndMap(options) {
+		return getSourceAndMap(this, options);
+	}
+
+	streamChunks(options, onChunk, onSource, onName) {
+		const prefix = this._prefix;
+		const prefixOffset = prefix.length;
+		const linesOnly = !!(options && options.columns === false);
+		const { generatedLine, generatedColumn, source } = streamChunks(
+			this._source,
+			options,
+			(
+				chunk,
+				generatedLine,
+				generatedColumn,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				nameIndex
+			) => {
+				if (generatedColumn !== 0) {
+					// In the middle of the line, we just adject the column
+					generatedColumn += prefixOffset;
+				} else if (chunk !== undefined) {
+					// At the start of the line, when we have source content
+					// add the prefix as generated mapping
+					// (in lines only mode we just add it to the original mapping
+					// for performance reasons)
+					if (linesOnly || sourceIndex < 0) {
+						chunk = prefix + chunk;
+					} else if (prefixOffset > 0) {
+						onChunk(prefix, generatedLine, generatedColumn, -1, -1, -1, -1);
+						generatedColumn += prefixOffset;
+					}
+				} else if (!linesOnly) {
+					// Without source content, we only need to adject the column info
+					// expect in lines only mode where prefix is added to original mapping
+					generatedColumn += prefixOffset;
+				}
+				onChunk(
+					chunk,
+					generatedLine,
+					generatedColumn,
+					sourceIndex,
+					originalLine,
+					originalColumn,
+					nameIndex
+				);
+			},
+			onSource,
+			onName
+		);
+		return {
+			generatedLine,
+			generatedColumn:
+				generatedColumn === 0 ? 0 : prefixOffset + generatedColumn,
+			source:
+				source !== undefined
+					? prefix + source.replace(REPLACE_REGEX, "\n" + prefix)
+					: undefined
+		};
+	}
+
+	updateHash(hash) {
+		hash.update("PrefixSource");
+		this._source.updateHash(hash);
+		hash.update(this._prefix);
+	}
+}
+
+module.exports = PrefixSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/RawSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/RawSource.js
new file mode 100644
index 0000000..71f1341
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/RawSource.js
@@ -0,0 +1,81 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const streamChunksOfRawSource = require("./helpers/streamChunksOfRawSource");
+const Source = require("./Source");
+
+class RawSource extends Source {
+	constructor(value, convertToString = false) {
+		super();
+		const isBuffer = Buffer.isBuffer(value);
+		if (!isBuffer && typeof value !== "string") {
+			throw new TypeError("argument 'value' must be either string of Buffer");
+		}
+		this._valueIsBuffer = !convertToString && isBuffer;
+		this._value = convertToString && isBuffer ? undefined : value;
+		this._valueAsBuffer = isBuffer ? value : undefined;
+		this._valueAsString = isBuffer ? undefined : value;
+	}
+
+	isBuffer() {
+		return this._valueIsBuffer;
+	}
+
+	source() {
+		if (this._value === undefined) {
+			this._value = this._valueAsBuffer.toString("utf-8");
+		}
+		return this._value;
+	}
+
+	buffer() {
+		if (this._valueAsBuffer === undefined) {
+			this._valueAsBuffer = Buffer.from(this._value, "utf-8");
+		}
+		return this._valueAsBuffer;
+	}
+
+	map(options) {
+		return null;
+	}
+
+	/**
+	 * @param {object} options options
+	 * @param {function(string, number, number, number, number, number, number): void} onChunk called for each chunk of code
+	 * @param {function(number, string, string)} onSource called for each source
+	 * @param {function(number, string)} onName called for each name
+	 * @returns {void}
+	 */
+	streamChunks(options, onChunk, onSource, onName) {
+		if (this._value === undefined) {
+			this._value = Buffer.from(this._valueAsBuffer, "utf-8");
+		}
+		if (this._valueAsString === undefined) {
+			this._valueAsString =
+				typeof this._value === "string"
+					? this._value
+					: this._value.toString("utf-8");
+		}
+		return streamChunksOfRawSource(
+			this._valueAsString,
+			onChunk,
+			onSource,
+			onName,
+			!!(options && options.finalSource)
+		);
+	}
+
+	updateHash(hash) {
+		if (this._valueAsBuffer === undefined) {
+			this._valueAsBuffer = Buffer.from(this._value, "utf-8");
+		}
+		hash.update("RawSource");
+		hash.update(this._valueAsBuffer);
+	}
+}
+
+module.exports = RawSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/ReplaceSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/ReplaceSource.js
new file mode 100644
index 0000000..1a678d1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/ReplaceSource.js
@@ -0,0 +1,467 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const { getMap, getSourceAndMap } = require("./helpers/getFromStreamChunks");
+const streamChunks = require("./helpers/streamChunks");
+const Source = require("./Source");
+const splitIntoLines = require("./helpers/splitIntoLines");
+
+// since v8 7.0, Array.prototype.sort is stable
+const hasStableSort =
+	typeof process === "object" &&
+	process.versions &&
+	typeof process.versions.v8 === "string" &&
+	!/^[0-6]\./.test(process.versions.v8);
+
+// This is larger than max string length
+const MAX_SOURCE_POSITION = 0x20000000;
+
+class Replacement {
+	constructor(start, end, content, name) {
+		this.start = start;
+		this.end = end;
+		this.content = content;
+		this.name = name;
+		if (!hasStableSort) {
+			this.index = -1;
+		}
+	}
+}
+
+class ReplaceSource extends Source {
+	constructor(source, name) {
+		super();
+		this._source = source;
+		this._name = name;
+		/** @type {Replacement[]} */
+		this._replacements = [];
+		this._isSorted = true;
+	}
+
+	getName() {
+		return this._name;
+	}
+
+	getReplacements() {
+		this._sortReplacements();
+		return this._replacements;
+	}
+
+	replace(start, end, newValue, name) {
+		if (typeof newValue !== "string")
+			throw new Error(
+				"insertion must be a string, but is a " + typeof newValue
+			);
+		this._replacements.push(new Replacement(start, end, newValue, name));
+		this._isSorted = false;
+	}
+
+	insert(pos, newValue, name) {
+		if (typeof newValue !== "string")
+			throw new Error(
+				"insertion must be a string, but is a " +
+					typeof newValue +
+					": " +
+					newValue
+			);
+		this._replacements.push(new Replacement(pos, pos - 1, newValue, name));
+		this._isSorted = false;
+	}
+
+	source() {
+		if (this._replacements.length === 0) {
+			return this._source.source();
+		}
+		let current = this._source.source();
+		let pos = 0;
+		const result = [];
+
+		this._sortReplacements();
+		for (const replacement of this._replacements) {
+			const start = Math.floor(replacement.start);
+			const end = Math.floor(replacement.end + 1);
+			if (pos < start) {
+				const offset = start - pos;
+				result.push(current.slice(0, offset));
+				current = current.slice(offset);
+				pos = start;
+			}
+			result.push(replacement.content);
+			if (pos < end) {
+				const offset = end - pos;
+				current = current.slice(offset);
+				pos = end;
+			}
+		}
+		result.push(current);
+		return result.join("");
+	}
+
+	map(options) {
+		if (this._replacements.length === 0) {
+			return this._source.map(options);
+		}
+		return getMap(this, options);
+	}
+
+	sourceAndMap(options) {
+		if (this._replacements.length === 0) {
+			return this._source.sourceAndMap(options);
+		}
+		return getSourceAndMap(this, options);
+	}
+
+	original() {
+		return this._source;
+	}
+
+	_sortReplacements() {
+		if (this._isSorted) return;
+		if (hasStableSort) {
+			this._replacements.sort(function (a, b) {
+				const diff1 = a.start - b.start;
+				if (diff1 !== 0) return diff1;
+				const diff2 = a.end - b.end;
+				if (diff2 !== 0) return diff2;
+				return 0;
+			});
+		} else {
+			this._replacements.forEach((repl, i) => (repl.index = i));
+			this._replacements.sort(function (a, b) {
+				const diff1 = a.start - b.start;
+				if (diff1 !== 0) return diff1;
+				const diff2 = a.end - b.end;
+				if (diff2 !== 0) return diff2;
+				return a.index - b.index;
+			});
+		}
+		this._isSorted = true;
+	}
+
+	streamChunks(options, onChunk, onSource, onName) {
+		this._sortReplacements();
+		const repls = this._replacements;
+		let pos = 0;
+		let i = 0;
+		let replacmentEnd = -1;
+		let nextReplacement =
+			i < repls.length ? Math.floor(repls[i].start) : MAX_SOURCE_POSITION;
+		let generatedLineOffset = 0;
+		let generatedColumnOffset = 0;
+		let generatedColumnOffsetLine = 0;
+		const sourceContents = [];
+		const nameMapping = new Map();
+		const nameIndexMapping = [];
+		const checkOriginalContent = (sourceIndex, line, column, expectedChunk) => {
+			let content =
+				sourceIndex < sourceContents.length
+					? sourceContents[sourceIndex]
+					: undefined;
+			if (content === undefined) return false;
+			if (typeof content === "string") {
+				content = splitIntoLines(content);
+				sourceContents[sourceIndex] = content;
+			}
+			const contentLine = line <= content.length ? content[line - 1] : null;
+			if (contentLine === null) return false;
+			return (
+				contentLine.slice(column, column + expectedChunk.length) ===
+				expectedChunk
+			);
+		};
+		let { generatedLine, generatedColumn } = streamChunks(
+			this._source,
+			Object.assign({}, options, { finalSource: false }),
+			(
+				chunk,
+				generatedLine,
+				generatedColumn,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				nameIndex
+			) => {
+				let chunkPos = 0;
+				let endPos = pos + chunk.length;
+
+				// Skip over when it has been replaced
+				if (replacmentEnd > pos) {
+					// Skip over the whole chunk
+					if (replacmentEnd >= endPos) {
+						const line = generatedLine + generatedLineOffset;
+						if (chunk.endsWith("\n")) {
+							generatedLineOffset--;
+							if (generatedColumnOffsetLine === line) {
+								// undo exiting corrections form the current line
+								generatedColumnOffset += generatedColumn;
+							}
+						} else if (generatedColumnOffsetLine === line) {
+							generatedColumnOffset -= chunk.length;
+						} else {
+							generatedColumnOffset = -chunk.length;
+							generatedColumnOffsetLine = line;
+						}
+						pos = endPos;
+						return;
+					}
+
+					// Partially skip over chunk
+					chunkPos = replacmentEnd - pos;
+					if (
+						checkOriginalContent(
+							sourceIndex,
+							originalLine,
+							originalColumn,
+							chunk.slice(0, chunkPos)
+						)
+					) {
+						originalColumn += chunkPos;
+					}
+					pos += chunkPos;
+					const line = generatedLine + generatedLineOffset;
+					if (generatedColumnOffsetLine === line) {
+						generatedColumnOffset -= chunkPos;
+					} else {
+						generatedColumnOffset = -chunkPos;
+						generatedColumnOffsetLine = line;
+					}
+					generatedColumn += chunkPos;
+				}
+
+				// Is a replacement in the chunk?
+				if (nextReplacement < endPos) {
+					do {
+						let line = generatedLine + generatedLineOffset;
+						if (nextReplacement > pos) {
+							// Emit chunk until replacement
+							const offset = nextReplacement - pos;
+							const chunkSlice = chunk.slice(chunkPos, chunkPos + offset);
+							onChunk(
+								chunkSlice,
+								line,
+								generatedColumn +
+									(line === generatedColumnOffsetLine
+										? generatedColumnOffset
+										: 0),
+								sourceIndex,
+								originalLine,
+								originalColumn,
+								nameIndex < 0 || nameIndex >= nameIndexMapping.length
+									? -1
+									: nameIndexMapping[nameIndex]
+							);
+							generatedColumn += offset;
+							chunkPos += offset;
+							pos = nextReplacement;
+							if (
+								checkOriginalContent(
+									sourceIndex,
+									originalLine,
+									originalColumn,
+									chunkSlice
+								)
+							) {
+								originalColumn += chunkSlice.length;
+							}
+						}
+
+						// Insert replacement content splitted into chunks by lines
+						const { content, name } = repls[i];
+						let matches = splitIntoLines(content);
+						let replacementNameIndex = nameIndex;
+						if (sourceIndex >= 0 && name) {
+							let globalIndex = nameMapping.get(name);
+							if (globalIndex === undefined) {
+								globalIndex = nameMapping.size;
+								nameMapping.set(name, globalIndex);
+								onName(globalIndex, name);
+							}
+							replacementNameIndex = globalIndex;
+						}
+						for (let m = 0; m < matches.length; m++) {
+							const contentLine = matches[m];
+							onChunk(
+								contentLine,
+								line,
+								generatedColumn +
+									(line === generatedColumnOffsetLine
+										? generatedColumnOffset
+										: 0),
+								sourceIndex,
+								originalLine,
+								originalColumn,
+								replacementNameIndex
+							);
+
+							// Only the first chunk has name assigned
+							replacementNameIndex = -1;
+
+							if (m === matches.length - 1 && !contentLine.endsWith("\n")) {
+								if (generatedColumnOffsetLine === line) {
+									generatedColumnOffset += contentLine.length;
+								} else {
+									generatedColumnOffset = contentLine.length;
+									generatedColumnOffsetLine = line;
+								}
+							} else {
+								generatedLineOffset++;
+								line++;
+								generatedColumnOffset = -generatedColumn;
+								generatedColumnOffsetLine = line;
+							}
+						}
+
+						// Remove replaced content by settings this variable
+						replacmentEnd = Math.max(
+							replacmentEnd,
+							Math.floor(repls[i].end + 1)
+						);
+
+						// Move to next replacment
+						i++;
+						nextReplacement =
+							i < repls.length
+								? Math.floor(repls[i].start)
+								: MAX_SOURCE_POSITION;
+
+						// Skip over when it has been replaced
+						const offset = chunk.length - endPos + replacmentEnd - chunkPos;
+						if (offset > 0) {
+							// Skip over whole chunk
+							if (replacmentEnd >= endPos) {
+								let line = generatedLine + generatedLineOffset;
+								if (chunk.endsWith("\n")) {
+									generatedLineOffset--;
+									if (generatedColumnOffsetLine === line) {
+										// undo exiting corrections form the current line
+										generatedColumnOffset += generatedColumn;
+									}
+								} else if (generatedColumnOffsetLine === line) {
+									generatedColumnOffset -= chunk.length - chunkPos;
+								} else {
+									generatedColumnOffset = chunkPos - chunk.length;
+									generatedColumnOffsetLine = line;
+								}
+								pos = endPos;
+								return;
+							}
+
+							// Partially skip over chunk
+							const line = generatedLine + generatedLineOffset;
+							if (
+								checkOriginalContent(
+									sourceIndex,
+									originalLine,
+									originalColumn,
+									chunk.slice(chunkPos, chunkPos + offset)
+								)
+							) {
+								originalColumn += offset;
+							}
+							chunkPos += offset;
+							pos += offset;
+							if (generatedColumnOffsetLine === line) {
+								generatedColumnOffset -= offset;
+							} else {
+								generatedColumnOffset = -offset;
+								generatedColumnOffsetLine = line;
+							}
+							generatedColumn += offset;
+						}
+					} while (nextReplacement < endPos);
+				}
+
+				// Emit remaining chunk
+				if (chunkPos < chunk.length) {
+					const chunkSlice = chunkPos === 0 ? chunk : chunk.slice(chunkPos);
+					const line = generatedLine + generatedLineOffset;
+					onChunk(
+						chunkSlice,
+						line,
+						generatedColumn +
+							(line === generatedColumnOffsetLine ? generatedColumnOffset : 0),
+						sourceIndex,
+						originalLine,
+						originalColumn,
+						nameIndex < 0 ? -1 : nameIndexMapping[nameIndex]
+					);
+				}
+				pos = endPos;
+			},
+			(sourceIndex, source, sourceContent) => {
+				while (sourceContents.length < sourceIndex)
+					sourceContents.push(undefined);
+				sourceContents[sourceIndex] = sourceContent;
+				onSource(sourceIndex, source, sourceContent);
+			},
+			(nameIndex, name) => {
+				let globalIndex = nameMapping.get(name);
+				if (globalIndex === undefined) {
+					globalIndex = nameMapping.size;
+					nameMapping.set(name, globalIndex);
+					onName(globalIndex, name);
+				}
+				nameIndexMapping[nameIndex] = globalIndex;
+			}
+		);
+
+		// Handle remaining replacements
+		let remainer = "";
+		for (; i < repls.length; i++) {
+			remainer += repls[i].content;
+		}
+
+		// Insert remaining replacements content splitted into chunks by lines
+		let line = generatedLine + generatedLineOffset;
+		let matches = splitIntoLines(remainer);
+		for (let m = 0; m < matches.length; m++) {
+			const contentLine = matches[m];
+			onChunk(
+				contentLine,
+				line,
+				generatedColumn +
+					(line === generatedColumnOffsetLine ? generatedColumnOffset : 0),
+				-1,
+				-1,
+				-1,
+				-1
+			);
+
+			if (m === matches.length - 1 && !contentLine.endsWith("\n")) {
+				if (generatedColumnOffsetLine === line) {
+					generatedColumnOffset += contentLine.length;
+				} else {
+					generatedColumnOffset = contentLine.length;
+					generatedColumnOffsetLine = line;
+				}
+			} else {
+				generatedLineOffset++;
+				line++;
+				generatedColumnOffset = -generatedColumn;
+				generatedColumnOffsetLine = line;
+			}
+		}
+
+		return {
+			generatedLine: line,
+			generatedColumn:
+				generatedColumn +
+				(line === generatedColumnOffsetLine ? generatedColumnOffset : 0)
+		};
+	}
+
+	updateHash(hash) {
+		this._sortReplacements();
+		hash.update("ReplaceSource");
+		this._source.updateHash(hash);
+		hash.update(this._name || "");
+		for (const repl of this._replacements) {
+			hash.update(`${repl.start}${repl.end}${repl.content}${repl.name}`);
+		}
+	}
+}
+
+module.exports = ReplaceSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/SizeOnlySource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/SizeOnlySource.js
new file mode 100644
index 0000000..a6e9294
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/SizeOnlySource.js
@@ -0,0 +1,42 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Source = require("./Source");
+
+class SizeOnlySource extends Source {
+	constructor(size) {
+		super();
+		this._size = size;
+	}
+
+	_error() {
+		return new Error(
+			"Content and Map of this Source is not available (only size() is supported)"
+		);
+	}
+
+	size() {
+		return this._size;
+	}
+
+	source() {
+		throw this._error();
+	}
+
+	buffer() {
+		throw this._error();
+	}
+
+	map(options) {
+		throw this._error();
+	}
+
+	updateHash() {
+		throw this._error();
+	}
+}
+
+module.exports = SizeOnlySource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/Source.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/Source.js
new file mode 100644
index 0000000..fb86c2e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/Source.js
@@ -0,0 +1,38 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+class Source {
+	source() {
+		throw new Error("Abstract");
+	}
+
+	buffer() {
+		const source = this.source();
+		if (Buffer.isBuffer(source)) return source;
+		return Buffer.from(source, "utf-8");
+	}
+
+	size() {
+		return this.buffer().length;
+	}
+
+	map(options) {
+		return null;
+	}
+
+	sourceAndMap(options) {
+		return {
+			source: this.source(),
+			map: this.map(options)
+		};
+	}
+
+	updateHash(hash) {
+		throw new Error("Abstract");
+	}
+}
+
+module.exports = Source;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/SourceMapSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/SourceMapSource.js
new file mode 100644
index 0000000..88a7cb8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/SourceMapSource.js
@@ -0,0 +1,247 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+const Source = require("./Source");
+const streamChunksOfSourceMap = require("./helpers/streamChunksOfSourceMap");
+const streamChunksOfCombinedSourceMap = require("./helpers/streamChunksOfCombinedSourceMap");
+const { getMap, getSourceAndMap } = require("./helpers/getFromStreamChunks");
+
+class SourceMapSource extends Source {
+	constructor(
+		value,
+		name,
+		sourceMap,
+		originalSource,
+		innerSourceMap,
+		removeOriginalSource
+	) {
+		super();
+		const valueIsBuffer = Buffer.isBuffer(value);
+		this._valueAsString = valueIsBuffer ? undefined : value;
+		this._valueAsBuffer = valueIsBuffer ? value : undefined;
+
+		this._name = name;
+
+		this._hasSourceMap = !!sourceMap;
+		const sourceMapIsBuffer = Buffer.isBuffer(sourceMap);
+		const sourceMapIsString = typeof sourceMap === "string";
+		this._sourceMapAsObject =
+			sourceMapIsBuffer || sourceMapIsString ? undefined : sourceMap;
+		this._sourceMapAsString = sourceMapIsString ? sourceMap : undefined;
+		this._sourceMapAsBuffer = sourceMapIsBuffer ? sourceMap : undefined;
+
+		this._hasOriginalSource = !!originalSource;
+		const originalSourceIsBuffer = Buffer.isBuffer(originalSource);
+		this._originalSourceAsString = originalSourceIsBuffer
+			? undefined
+			: originalSource;
+		this._originalSourceAsBuffer = originalSourceIsBuffer
+			? originalSource
+			: undefined;
+
+		this._hasInnerSourceMap = !!innerSourceMap;
+		const innerSourceMapIsBuffer = Buffer.isBuffer(innerSourceMap);
+		const innerSourceMapIsString = typeof innerSourceMap === "string";
+		this._innerSourceMapAsObject =
+			innerSourceMapIsBuffer || innerSourceMapIsString
+				? undefined
+				: innerSourceMap;
+		this._innerSourceMapAsString = innerSourceMapIsString
+			? innerSourceMap
+			: undefined;
+		this._innerSourceMapAsBuffer = innerSourceMapIsBuffer
+			? innerSourceMap
+			: undefined;
+
+		this._removeOriginalSource = removeOriginalSource;
+	}
+
+	_ensureValueBuffer() {
+		if (this._valueAsBuffer === undefined) {
+			this._valueAsBuffer = Buffer.from(this._valueAsString, "utf-8");
+		}
+	}
+
+	_ensureValueString() {
+		if (this._valueAsString === undefined) {
+			this._valueAsString = this._valueAsBuffer.toString("utf-8");
+		}
+	}
+
+	_ensureOriginalSourceBuffer() {
+		if (this._originalSourceAsBuffer === undefined && this._hasOriginalSource) {
+			this._originalSourceAsBuffer = Buffer.from(
+				this._originalSourceAsString,
+				"utf-8"
+			);
+		}
+	}
+
+	_ensureOriginalSourceString() {
+		if (this._originalSourceAsString === undefined && this._hasOriginalSource) {
+			this._originalSourceAsString = this._originalSourceAsBuffer.toString(
+				"utf-8"
+			);
+		}
+	}
+
+	_ensureInnerSourceMapObject() {
+		if (this._innerSourceMapAsObject === undefined && this._hasInnerSourceMap) {
+			this._ensureInnerSourceMapString();
+			this._innerSourceMapAsObject = JSON.parse(this._innerSourceMapAsString);
+		}
+	}
+
+	_ensureInnerSourceMapBuffer() {
+		if (this._innerSourceMapAsBuffer === undefined && this._hasInnerSourceMap) {
+			this._ensureInnerSourceMapString();
+			this._innerSourceMapAsBuffer = Buffer.from(
+				this._innerSourceMapAsString,
+				"utf-8"
+			);
+		}
+	}
+
+	_ensureInnerSourceMapString() {
+		if (this._innerSourceMapAsString === undefined && this._hasInnerSourceMap) {
+			if (this._innerSourceMapAsBuffer !== undefined) {
+				this._innerSourceMapAsString = this._innerSourceMapAsBuffer.toString(
+					"utf-8"
+				);
+			} else {
+				this._innerSourceMapAsString = JSON.stringify(
+					this._innerSourceMapAsObject
+				);
+			}
+		}
+	}
+
+	_ensureSourceMapObject() {
+		if (this._sourceMapAsObject === undefined) {
+			this._ensureSourceMapString();
+			this._sourceMapAsObject = JSON.parse(this._sourceMapAsString);
+		}
+	}
+
+	_ensureSourceMapBuffer() {
+		if (this._sourceMapAsBuffer === undefined) {
+			this._ensureSourceMapString();
+			this._sourceMapAsBuffer = Buffer.from(this._sourceMapAsString, "utf-8");
+		}
+	}
+
+	_ensureSourceMapString() {
+		if (this._sourceMapAsString === undefined) {
+			if (this._sourceMapAsBuffer !== undefined) {
+				this._sourceMapAsString = this._sourceMapAsBuffer.toString("utf-8");
+			} else {
+				this._sourceMapAsString = JSON.stringify(this._sourceMapAsObject);
+			}
+		}
+	}
+
+	getArgsAsBuffers() {
+		this._ensureValueBuffer();
+		this._ensureSourceMapBuffer();
+		this._ensureOriginalSourceBuffer();
+		this._ensureInnerSourceMapBuffer();
+		return [
+			this._valueAsBuffer,
+			this._name,
+			this._sourceMapAsBuffer,
+			this._originalSourceAsBuffer,
+			this._innerSourceMapAsBuffer,
+			this._removeOriginalSource
+		];
+	}
+
+	buffer() {
+		this._ensureValueBuffer();
+		return this._valueAsBuffer;
+	}
+
+	source() {
+		this._ensureValueString();
+		return this._valueAsString;
+	}
+
+	map(options) {
+		if (!this._hasInnerSourceMap) {
+			this._ensureSourceMapObject();
+			return this._sourceMapAsObject;
+		}
+		return getMap(this, options);
+	}
+
+	sourceAndMap(options) {
+		if (!this._hasInnerSourceMap) {
+			this._ensureValueString();
+			this._ensureSourceMapObject();
+			return {
+				source: this._valueAsString,
+				map: this._sourceMapAsObject
+			};
+		}
+		return getSourceAndMap(this, options);
+	}
+
+	streamChunks(options, onChunk, onSource, onName) {
+		this._ensureValueString();
+		this._ensureSourceMapObject();
+		this._ensureOriginalSourceString();
+		if (this._hasInnerSourceMap) {
+			this._ensureInnerSourceMapObject();
+			return streamChunksOfCombinedSourceMap(
+				this._valueAsString,
+				this._sourceMapAsObject,
+				this._name,
+				this._originalSourceAsString,
+				this._innerSourceMapAsObject,
+				this._removeOriginalSource,
+				onChunk,
+				onSource,
+				onName,
+				!!(options && options.finalSource),
+				!!(options && options.columns !== false)
+			);
+		} else {
+			return streamChunksOfSourceMap(
+				this._valueAsString,
+				this._sourceMapAsObject,
+				onChunk,
+				onSource,
+				onName,
+				!!(options && options.finalSource),
+				!!(options && options.columns !== false)
+			);
+		}
+	}
+
+	updateHash(hash) {
+		this._ensureValueBuffer();
+		this._ensureSourceMapBuffer();
+		this._ensureOriginalSourceBuffer();
+		this._ensureInnerSourceMapBuffer();
+
+		hash.update("SourceMapSource");
+
+		hash.update(this._valueAsBuffer);
+
+		hash.update(this._sourceMapAsBuffer);
+
+		if (this._hasOriginalSource) {
+			hash.update(this._originalSourceAsBuffer);
+		}
+
+		if (this._hasInnerSourceMap) {
+			hash.update(this._innerSourceMapAsBuffer);
+		}
+
+		hash.update(this._removeOriginalSource ? "true" : "false");
+	}
+}
+
+module.exports = SourceMapSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/createMappingsSerializer.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/createMappingsSerializer.js
new file mode 100644
index 0000000..8dafe43
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/createMappingsSerializer.js
@@ -0,0 +1,206 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split(
+	""
+);
+
+const CONTINUATION_BIT = 0x20;
+
+const createMappingsSerializer = options => {
+	const linesOnly = options && options.columns === false;
+	return linesOnly
+		? createLinesOnlyMappingsSerializer()
+		: createFullMappingsSerializer();
+};
+
+const createFullMappingsSerializer = () => {
+	let currentLine = 1;
+	let currentColumn = 0;
+	let currentSourceIndex = 0;
+	let currentOriginalLine = 1;
+	let currentOriginalColumn = 0;
+	let currentNameIndex = 0;
+	let activeMapping = false;
+	let activeName = false;
+	let initial = true;
+	return (
+		generatedLine,
+		generatedColumn,
+		sourceIndex,
+		originalLine,
+		originalColumn,
+		nameIndex
+	) => {
+		if (activeMapping && currentLine === generatedLine) {
+			// A mapping is still active
+			if (
+				sourceIndex === currentSourceIndex &&
+				originalLine === currentOriginalLine &&
+				originalColumn === currentOriginalColumn &&
+				!activeName &&
+				nameIndex < 0
+			) {
+				// avoid repeating the same original mapping
+				return "";
+			}
+		} else {
+			// No mapping is active
+			if (sourceIndex < 0) {
+				// avoid writing unneccessary generated mappings
+				return "";
+			}
+		}
+
+		let str;
+		if (currentLine < generatedLine) {
+			str = ";".repeat(generatedLine - currentLine);
+			currentLine = generatedLine;
+			currentColumn = 0;
+			initial = false;
+		} else if (initial) {
+			str = "";
+			initial = false;
+		} else {
+			str = ",";
+		}
+
+		const writeValue = value => {
+			const sign = (value >>> 31) & 1;
+			const mask = value >> 31;
+			const absValue = (value + mask) ^ mask;
+			let data = (absValue << 1) | sign;
+			for (;;) {
+				const sextet = data & 0x1f;
+				data >>= 5;
+				if (data === 0) {
+					str += ALPHABET[sextet];
+					break;
+				} else {
+					str += ALPHABET[sextet | CONTINUATION_BIT];
+				}
+			}
+		};
+		writeValue(generatedColumn - currentColumn);
+		currentColumn = generatedColumn;
+		if (sourceIndex >= 0) {
+			activeMapping = true;
+			if (sourceIndex === currentSourceIndex) {
+				str += "A";
+			} else {
+				writeValue(sourceIndex - currentSourceIndex);
+				currentSourceIndex = sourceIndex;
+			}
+			writeValue(originalLine - currentOriginalLine);
+			currentOriginalLine = originalLine;
+			if (originalColumn === currentOriginalColumn) {
+				str += "A";
+			} else {
+				writeValue(originalColumn - currentOriginalColumn);
+				currentOriginalColumn = originalColumn;
+			}
+			if (nameIndex >= 0) {
+				writeValue(nameIndex - currentNameIndex);
+				currentNameIndex = nameIndex;
+				activeName = true;
+			} else {
+				activeName = false;
+			}
+		} else {
+			activeMapping = false;
+		}
+		return str;
+	};
+};
+
+const createLinesOnlyMappingsSerializer = () => {
+	let lastWrittenLine = 0;
+	let currentLine = 1;
+	let currentSourceIndex = 0;
+	let currentOriginalLine = 1;
+	return (
+		generatedLine,
+		_generatedColumn,
+		sourceIndex,
+		originalLine,
+		_originalColumn,
+		_nameIndex
+	) => {
+		if (sourceIndex < 0) {
+			// avoid writing generated mappings at all
+			return "";
+		}
+		if (lastWrittenLine === generatedLine) {
+			// avoid writing multiple original mappings per line
+			return "";
+		}
+		let str;
+		const writeValue = value => {
+			const sign = (value >>> 31) & 1;
+			const mask = value >> 31;
+			const absValue = (value + mask) ^ mask;
+			let data = (absValue << 1) | sign;
+			for (;;) {
+				const sextet = data & 0x1f;
+				data >>= 5;
+				if (data === 0) {
+					str += ALPHABET[sextet];
+					break;
+				} else {
+					str += ALPHABET[sextet | CONTINUATION_BIT];
+				}
+			}
+		};
+		lastWrittenLine = generatedLine;
+		if (generatedLine === currentLine + 1) {
+			currentLine = generatedLine;
+			if (sourceIndex === currentSourceIndex) {
+				currentSourceIndex = sourceIndex;
+				if (originalLine === currentOriginalLine + 1) {
+					currentOriginalLine = originalLine;
+					return ";AACA";
+				} else {
+					str = ";AA";
+					writeValue(originalLine - currentOriginalLine);
+					currentOriginalLine = originalLine;
+					return str + "A";
+				}
+			} else {
+				str = ";A";
+				writeValue(sourceIndex - currentSourceIndex);
+				currentSourceIndex = sourceIndex;
+				writeValue(originalLine - currentOriginalLine);
+				currentOriginalLine = originalLine;
+				return str + "A";
+			}
+		} else {
+			str = ";".repeat(generatedLine - currentLine);
+			currentLine = generatedLine;
+			if (sourceIndex === currentSourceIndex) {
+				currentSourceIndex = sourceIndex;
+				if (originalLine === currentOriginalLine + 1) {
+					currentOriginalLine = originalLine;
+					return str + "AACA";
+				} else {
+					str += "AA";
+					writeValue(originalLine - currentOriginalLine);
+					currentOriginalLine = originalLine;
+					return str + "A";
+				}
+			} else {
+				str += "A";
+				writeValue(sourceIndex - currentSourceIndex);
+				currentSourceIndex = sourceIndex;
+				writeValue(originalLine - currentOriginalLine);
+				currentOriginalLine = originalLine;
+				return str + "A";
+			}
+		}
+	};
+};
+
+module.exports = createMappingsSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getFromStreamChunks.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getFromStreamChunks.js
new file mode 100644
index 0000000..f45c639
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getFromStreamChunks.js
@@ -0,0 +1,129 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const createMappingsSerializer = require("./createMappingsSerializer");
+
+exports.getSourceAndMap = (inputSource, options) => {
+	let code = "";
+	let mappings = "";
+	let sources = [];
+	let sourcesContent = [];
+	let names = [];
+	const addMapping = createMappingsSerializer(options);
+	const { source } = inputSource.streamChunks(
+		Object.assign({}, options, { finalSource: true }),
+		(
+			chunk,
+			generatedLine,
+			generatedColumn,
+			sourceIndex,
+			originalLine,
+			originalColumn,
+			nameIndex
+		) => {
+			if (chunk !== undefined) code += chunk;
+			mappings += addMapping(
+				generatedLine,
+				generatedColumn,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				nameIndex
+			);
+		},
+		(sourceIndex, source, sourceContent) => {
+			while (sources.length < sourceIndex) {
+				sources.push(null);
+			}
+			sources[sourceIndex] = source;
+			if (sourceContent !== undefined) {
+				while (sourcesContent.length < sourceIndex) {
+					sourcesContent.push(null);
+				}
+				sourcesContent[sourceIndex] = sourceContent;
+			}
+		},
+		(nameIndex, name) => {
+			while (names.length < nameIndex) {
+				names.push(null);
+			}
+			names[nameIndex] = name;
+		}
+	);
+	return {
+		source: source !== undefined ? source : code,
+		map:
+			mappings.length > 0
+				? {
+						version: 3,
+						file: "x",
+						mappings,
+						sources,
+						sourcesContent:
+							sourcesContent.length > 0 ? sourcesContent : undefined,
+						names
+				  }
+				: null
+	};
+};
+
+exports.getMap = (source, options) => {
+	let mappings = "";
+	let sources = [];
+	let sourcesContent = [];
+	let names = [];
+	const addMapping = createMappingsSerializer(options);
+	source.streamChunks(
+		Object.assign({}, options, { source: false, finalSource: true }),
+		(
+			chunk,
+			generatedLine,
+			generatedColumn,
+			sourceIndex,
+			originalLine,
+			originalColumn,
+			nameIndex
+		) => {
+			mappings += addMapping(
+				generatedLine,
+				generatedColumn,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				nameIndex
+			);
+		},
+		(sourceIndex, source, sourceContent) => {
+			while (sources.length < sourceIndex) {
+				sources.push(null);
+			}
+			sources[sourceIndex] = source;
+			if (sourceContent !== undefined) {
+				while (sourcesContent.length < sourceIndex) {
+					sourcesContent.push(null);
+				}
+				sourcesContent[sourceIndex] = sourceContent;
+			}
+		},
+		(nameIndex, name) => {
+			while (names.length < nameIndex) {
+				names.push(null);
+			}
+			names[nameIndex] = name;
+		}
+	);
+	return mappings.length > 0
+		? {
+				version: 3,
+				file: "x",
+				mappings,
+				sources,
+				sourcesContent: sourcesContent.length > 0 ? sourcesContent : undefined,
+				names
+		  }
+		: null;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getGeneratedSourceInfo.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getGeneratedSourceInfo.js
new file mode 100644
index 0000000..2cc12fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getGeneratedSourceInfo.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const CHAR_CODE_NEW_LINE = "\n".charCodeAt(0);
+
+const getGeneratedSourceInfo = source => {
+	if (source === undefined) {
+		return {};
+	}
+	const lastLineStart = source.lastIndexOf("\n");
+	if (lastLineStart === -1) {
+		return {
+			generatedLine: 1,
+			generatedColumn: source.length,
+			source
+		};
+	}
+	let generatedLine = 2;
+	for (let i = 0; i < lastLineStart; i++) {
+		if (source.charCodeAt(i) === CHAR_CODE_NEW_LINE) generatedLine++;
+	}
+	return {
+		generatedLine,
+		generatedColumn: source.length - lastLineStart - 1,
+		source
+	};
+};
+
+module.exports = getGeneratedSourceInfo;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getName.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getName.js
new file mode 100644
index 0000000..db6a863
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getName.js
@@ -0,0 +1,14 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const getName = (sourceMap, index) => {
+	if (index < 0) return null;
+	const { names } = sourceMap;
+	return names[index];
+};
+
+module.exports = getName;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getSource.js
new file mode 100644
index 0000000..b236563
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/getSource.js
@@ -0,0 +1,17 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const getSource = (sourceMap, index) => {
+	if (index < 0) return null;
+	const { sourceRoot, sources } = sourceMap;
+	const source = sources[index];
+	if (!sourceRoot) return source;
+	if (sourceRoot.endsWith("/")) return sourceRoot + source;
+	return sourceRoot + "/" + source;
+};
+
+module.exports = getSource;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/readMappings.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/readMappings.js
new file mode 100644
index 0000000..31cb48d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/readMappings.js
@@ -0,0 +1,116 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ALPHABET =
+	"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+const CONTINUATION_BIT = 0x20;
+const END_SEGMENT_BIT = 0x40;
+const NEXT_LINE = END_SEGMENT_BIT | 0x01;
+const INVALID = END_SEGMENT_BIT | 0x02;
+const DATA_MASK = 0x1f;
+
+const ccToValue = new Uint8Array("z".charCodeAt(0) + 1);
+{
+	ccToValue.fill(INVALID);
+	for (let i = 0; i < ALPHABET.length; i++) {
+		ccToValue[ALPHABET.charCodeAt(i)] = i;
+	}
+	ccToValue[",".charCodeAt(0)] = END_SEGMENT_BIT;
+	ccToValue[";".charCodeAt(0)] = NEXT_LINE;
+}
+const ccMax = ccToValue.length - 1;
+
+/**
+ * @param {string} mappings the mappings string
+ * @param {function(number, number, number, number, number, number): void} onMapping called for each mapping
+ * @returns {void}
+ */
+const readMappings = (mappings, onMapping) => {
+	// generatedColumn, [sourceIndex, originalLine, orignalColumn, [nameIndex]]
+	const currentData = new Uint32Array([0, 0, 1, 0, 0]);
+	let currentDataPos = 0;
+	// currentValue will include a sign bit at bit 0
+	let currentValue = 0;
+	let currentValuePos = 0;
+	let generatedLine = 1;
+	let generatedColumn = -1;
+	for (let i = 0; i < mappings.length; i++) {
+		const cc = mappings.charCodeAt(i);
+		if (cc > ccMax) continue;
+		const value = ccToValue[cc];
+		if ((value & END_SEGMENT_BIT) !== 0) {
+			// End current segment
+			if (currentData[0] > generatedColumn) {
+				if (currentDataPos === 1) {
+					onMapping(generatedLine, currentData[0], -1, -1, -1, -1);
+				} else if (currentDataPos === 4) {
+					onMapping(
+						generatedLine,
+						currentData[0],
+						currentData[1],
+						currentData[2],
+						currentData[3],
+						-1
+					);
+				} else if (currentDataPos === 5) {
+					onMapping(
+						generatedLine,
+						currentData[0],
+						currentData[1],
+						currentData[2],
+						currentData[3],
+						currentData[4]
+					);
+				}
+				generatedColumn = currentData[0];
+			}
+			currentDataPos = 0;
+			if (value === NEXT_LINE) {
+				// Start new line
+				generatedLine++;
+				currentData[0] = 0;
+				generatedColumn = -1;
+			}
+		} else if ((value & CONTINUATION_BIT) === 0) {
+			// last sextet
+			currentValue |= value << currentValuePos;
+			const finalValue =
+				currentValue & 1 ? -(currentValue >> 1) : currentValue >> 1;
+			currentData[currentDataPos++] += finalValue;
+			currentValuePos = 0;
+			currentValue = 0;
+		} else {
+			currentValue |= (value & DATA_MASK) << currentValuePos;
+			currentValuePos += 5;
+		}
+	}
+	// End current segment
+	if (currentDataPos === 1) {
+		onMapping(generatedLine, currentData[0], -1, -1, -1, -1);
+	} else if (currentDataPos === 4) {
+		onMapping(
+			generatedLine,
+			currentData[0],
+			currentData[1],
+			currentData[2],
+			currentData[3],
+			-1
+		);
+	} else if (currentDataPos === 5) {
+		onMapping(
+			generatedLine,
+			currentData[0],
+			currentData[1],
+			currentData[2],
+			currentData[3],
+			currentData[4]
+		);
+	}
+};
+
+module.exports = readMappings;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/splitIntoLines.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/splitIntoLines.js
new file mode 100644
index 0000000..e9ccafd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/splitIntoLines.js
@@ -0,0 +1,21 @@
+const splitIntoLines = str => {
+	const results = [];
+	const len = str.length;
+	let i = 0;
+	for (; i < len; ) {
+		const cc = str.charCodeAt(i);
+		// 10 is "\n".charCodeAt(0)
+		if (cc === 10) {
+			results.push("\n");
+			i++;
+		} else {
+			let j = i + 1;
+			// 10 is "\n".charCodeAt(0)
+			while (j < len && str.charCodeAt(j) !== 10) j++;
+			results.push(str.slice(i, j + 1));
+			i = j + 1;
+		}
+	}
+	return results;
+};
+module.exports = splitIntoLines;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/splitIntoPotentialTokens.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/splitIntoPotentialTokens.js
new file mode 100644
index 0000000..0f0bc42
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/splitIntoPotentialTokens.js
@@ -0,0 +1,41 @@
+// \n = 10
+// ; = 59
+// { = 123
+// } = 125
+// <space> = 32
+// \r = 13
+// \t = 9
+
+const splitIntoPotentialTokens = str => {
+	const len = str.length;
+	if (len === 0) return null;
+	const results = [];
+	let i = 0;
+	for (; i < len; ) {
+		const s = i;
+		block: {
+			let cc = str.charCodeAt(i);
+			while (cc !== 10 && cc !== 59 && cc !== 123 && cc !== 125) {
+				if (++i >= len) break block;
+				cc = str.charCodeAt(i);
+			}
+			while (
+				cc === 59 ||
+				cc === 32 ||
+				cc === 123 ||
+				cc === 125 ||
+				cc === 13 ||
+				cc === 9
+			) {
+				if (++i >= len) break block;
+				cc = str.charCodeAt(i);
+			}
+			if (cc === 10) {
+				i++;
+			}
+		}
+		results.push(str.slice(s, i));
+	}
+	return results;
+};
+module.exports = splitIntoPotentialTokens;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamAndGetSourceAndMap.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamAndGetSourceAndMap.js
new file mode 100644
index 0000000..529fd76
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamAndGetSourceAndMap.js
@@ -0,0 +1,102 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const createMappingsSerializer = require("./createMappingsSerializer");
+const streamChunks = require("./streamChunks");
+
+const streamAndGetSourceAndMap = (
+	inputSource,
+	options,
+	onChunk,
+	onSource,
+	onName
+) => {
+	let code = "";
+	let mappings = "";
+	let sources = [];
+	let sourcesContent = [];
+	let names = [];
+	const addMapping = createMappingsSerializer(
+		Object.assign({}, options, { columns: true })
+	);
+	const finalSource = !!(options && options.finalSource);
+	const { generatedLine, generatedColumn, source } = streamChunks(
+		inputSource,
+		options,
+		(
+			chunk,
+			generatedLine,
+			generatedColumn,
+			sourceIndex,
+			originalLine,
+			originalColumn,
+			nameIndex
+		) => {
+			if (chunk !== undefined) code += chunk;
+			mappings += addMapping(
+				generatedLine,
+				generatedColumn,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				nameIndex
+			);
+			return onChunk(
+				finalSource ? undefined : chunk,
+				generatedLine,
+				generatedColumn,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				nameIndex
+			);
+		},
+		(sourceIndex, source, sourceContent) => {
+			while (sources.length < sourceIndex) {
+				sources.push(null);
+			}
+			sources[sourceIndex] = source;
+			if (sourceContent !== undefined) {
+				while (sourcesContent.length < sourceIndex) {
+					sourcesContent.push(null);
+				}
+				sourcesContent[sourceIndex] = sourceContent;
+			}
+			return onSource(sourceIndex, source, sourceContent);
+		},
+		(nameIndex, name) => {
+			while (names.length < nameIndex) {
+				names.push(null);
+			}
+			names[nameIndex] = name;
+			return onName(nameIndex, name);
+		}
+	);
+	const resultSource = source !== undefined ? source : code;
+	return {
+		result: {
+			generatedLine,
+			generatedColumn,
+			source: finalSource ? resultSource : undefined
+		},
+		source: resultSource,
+		map:
+			mappings.length > 0
+				? {
+						version: 3,
+						file: "x",
+						mappings,
+						sources,
+						sourcesContent:
+							sourcesContent.length > 0 ? sourcesContent : undefined,
+						names
+				  }
+				: null
+	};
+};
+
+module.exports = streamAndGetSourceAndMap;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunks.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunks.js
new file mode 100644
index 0000000..4bd3824
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunks.js
@@ -0,0 +1,36 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const streamChunksOfRawSource = require("./streamChunksOfRawSource");
+const streamChunksOfSourceMap = require("./streamChunksOfSourceMap");
+
+module.exports = (source, options, onChunk, onSource, onName) => {
+	if (typeof source.streamChunks === "function") {
+		return source.streamChunks(options, onChunk, onSource, onName);
+	} else {
+		const sourceAndMap = source.sourceAndMap(options);
+		if (sourceAndMap.map) {
+			return streamChunksOfSourceMap(
+				sourceAndMap.source,
+				sourceAndMap.map,
+				onChunk,
+				onSource,
+				onName,
+				!!(options && options.finalSource),
+				!!(options && options.columns !== false)
+			);
+		} else {
+			return streamChunksOfRawSource(
+				sourceAndMap.source,
+				onChunk,
+				onSource,
+				onName,
+				!!(options && options.finalSource)
+			);
+		}
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfCombinedSourceMap.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfCombinedSourceMap.js
new file mode 100644
index 0000000..b40774d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfCombinedSourceMap.js
@@ -0,0 +1,329 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const streamChunksOfSourceMap = require("./streamChunksOfSourceMap");
+const splitIntoLines = require("./splitIntoLines");
+
+const streamChunksOfCombinedSourceMap = (
+	source,
+	sourceMap,
+	innerSourceName,
+	innerSource,
+	innerSourceMap,
+	removeInnerSource,
+	onChunk,
+	onSource,
+	onName,
+	finalSource,
+	columns
+) => {
+	let sourceMapping = new Map();
+	let nameMapping = new Map();
+	const sourceIndexMapping = [];
+	const nameIndexMapping = [];
+	const nameIndexValueMapping = [];
+	let innerSourceIndex = -2;
+	const innerSourceIndexMapping = [];
+	const innerSourceIndexValueMapping = [];
+	const innerSourceContents = [];
+	const innerSourceContentLines = [];
+	const innerNameIndexMapping = [];
+	const innerNameIndexValueMapping = [];
+	const innerSourceMapLineData = [];
+	const findInnerMapping = (line, column) => {
+		if (line > innerSourceMapLineData.length) return -1;
+		const { mappingsData } = innerSourceMapLineData[line - 1];
+		let l = 0;
+		let r = mappingsData.length / 5;
+		while (l < r) {
+			let m = (l + r) >> 1;
+			if (mappingsData[m * 5] <= column) {
+				l = m + 1;
+			} else {
+				r = m;
+			}
+		}
+		if (l === 0) return -1;
+		return l - 1;
+	};
+	return streamChunksOfSourceMap(
+		source,
+		sourceMap,
+		(
+			chunk,
+			generatedLine,
+			generatedColumn,
+			sourceIndex,
+			originalLine,
+			originalColumn,
+			nameIndex
+		) => {
+			// Check if this is a mapping to the inner source
+			if (sourceIndex === innerSourceIndex) {
+				// Check if there is a mapping in the inner source
+				const idx = findInnerMapping(originalLine, originalColumn);
+				if (idx !== -1) {
+					const { chunks, mappingsData } = innerSourceMapLineData[
+						originalLine - 1
+					];
+					const mi = idx * 5;
+					const innerSourceIndex = mappingsData[mi + 1];
+					const innerOriginalLine = mappingsData[mi + 2];
+					let innerOriginalColumn = mappingsData[mi + 3];
+					let innerNameIndex = mappingsData[mi + 4];
+					if (innerSourceIndex >= 0) {
+						// Check for an identity mapping
+						// where we are allowed to adjust the original column
+						const innerChunk = chunks[idx];
+						const innerGeneratedColumn = mappingsData[mi];
+						const locationInChunk = originalColumn - innerGeneratedColumn;
+						if (locationInChunk > 0) {
+							let originalSourceLines =
+								innerSourceIndex < innerSourceContentLines.length
+									? innerSourceContentLines[innerSourceIndex]
+									: null;
+							if (originalSourceLines === undefined) {
+								const originalSource = innerSourceContents[innerSourceIndex];
+								originalSourceLines = originalSource
+									? splitIntoLines(originalSource)
+									: null;
+								innerSourceContentLines[innerSourceIndex] = originalSourceLines;
+							}
+							if (originalSourceLines !== null) {
+								const originalChunk =
+									innerOriginalLine <= originalSourceLines.length
+										? originalSourceLines[innerOriginalLine - 1].slice(
+												innerOriginalColumn,
+												innerOriginalColumn + locationInChunk
+										  )
+										: "";
+								if (innerChunk.slice(0, locationInChunk) === originalChunk) {
+									innerOriginalColumn += locationInChunk;
+									innerNameIndex = -1;
+								}
+							}
+						}
+
+						// We have a inner mapping to original source
+
+						// emit source when needed and compute global source index
+						let sourceIndex =
+							innerSourceIndex < innerSourceIndexMapping.length
+								? innerSourceIndexMapping[innerSourceIndex]
+								: -2;
+						if (sourceIndex === -2) {
+							const [source, sourceContent] =
+								innerSourceIndex < innerSourceIndexValueMapping.length
+									? innerSourceIndexValueMapping[innerSourceIndex]
+									: [null, undefined];
+							let globalIndex = sourceMapping.get(source);
+							if (globalIndex === undefined) {
+								sourceMapping.set(source, (globalIndex = sourceMapping.size));
+								onSource(globalIndex, source, sourceContent);
+							}
+							sourceIndex = globalIndex;
+							innerSourceIndexMapping[innerSourceIndex] = sourceIndex;
+						}
+
+						// emit name when needed and compute global name index
+						let finalNameIndex = -1;
+						if (innerNameIndex >= 0) {
+							// when we have a inner name
+							finalNameIndex =
+								innerNameIndex < innerNameIndexMapping.length
+									? innerNameIndexMapping[innerNameIndex]
+									: -2;
+							if (finalNameIndex === -2) {
+								const name =
+									innerNameIndex < innerNameIndexValueMapping.length
+										? innerNameIndexValueMapping[innerNameIndex]
+										: undefined;
+								if (name) {
+									let globalIndex = nameMapping.get(name);
+									if (globalIndex === undefined) {
+										nameMapping.set(name, (globalIndex = nameMapping.size));
+										onName(globalIndex, name);
+									}
+									finalNameIndex = globalIndex;
+								} else {
+									finalNameIndex = -1;
+								}
+								innerNameIndexMapping[innerNameIndex] = finalNameIndex;
+							}
+						} else if (nameIndex >= 0) {
+							// when we don't have an inner name,
+							// but we have an outer name
+							// it can be used when inner original code equals to the name
+							let originalSourceLines =
+								innerSourceContentLines[innerSourceIndex];
+							if (originalSourceLines === undefined) {
+								const originalSource = innerSourceContents[innerSourceIndex];
+								originalSourceLines = originalSource
+									? splitIntoLines(originalSource)
+									: null;
+								innerSourceContentLines[innerSourceIndex] = originalSourceLines;
+							}
+							if (originalSourceLines !== null) {
+								const name = nameIndexValueMapping[nameIndex];
+								const originalName =
+									innerOriginalLine <= originalSourceLines.length
+										? originalSourceLines[innerOriginalLine - 1].slice(
+												innerOriginalColumn,
+												innerOriginalColumn + name.length
+										  )
+										: "";
+								if (name === originalName) {
+									finalNameIndex =
+										nameIndex < nameIndexMapping.length
+											? nameIndexMapping[nameIndex]
+											: -2;
+									if (finalNameIndex === -2) {
+										const name = nameIndexValueMapping[nameIndex];
+										if (name) {
+											let globalIndex = nameMapping.get(name);
+											if (globalIndex === undefined) {
+												nameMapping.set(name, (globalIndex = nameMapping.size));
+												onName(globalIndex, name);
+											}
+											finalNameIndex = globalIndex;
+										} else {
+											finalNameIndex = -1;
+										}
+										nameIndexMapping[nameIndex] = finalNameIndex;
+									}
+								}
+							}
+						}
+						onChunk(
+							chunk,
+							generatedLine,
+							generatedColumn,
+							sourceIndex,
+							innerOriginalLine,
+							innerOriginalColumn,
+							finalNameIndex
+						);
+						return;
+					}
+				}
+
+				// We have a mapping to the inner source, but no inner mapping
+				if (removeInnerSource) {
+					onChunk(chunk, generatedLine, generatedColumn, -1, -1, -1, -1);
+					return;
+				} else {
+					if (sourceIndexMapping[sourceIndex] === -2) {
+						let globalIndex = sourceMapping.get(innerSourceName);
+						if (globalIndex === undefined) {
+							sourceMapping.set(source, (globalIndex = sourceMapping.size));
+							onSource(globalIndex, innerSourceName, innerSource);
+						}
+						sourceIndexMapping[sourceIndex] = globalIndex;
+					}
+				}
+			}
+
+			const finalSourceIndex =
+				sourceIndex < 0 || sourceIndex >= sourceIndexMapping.length
+					? -1
+					: sourceIndexMapping[sourceIndex];
+			if (finalSourceIndex < 0) {
+				// no source, so we make it a generated chunk
+				onChunk(chunk, generatedLine, generatedColumn, -1, -1, -1, -1);
+			} else {
+				// Pass through the chunk with mapping
+				let finalNameIndex = -1;
+				if (nameIndex >= 0 && nameIndex < nameIndexMapping.length) {
+					finalNameIndex = nameIndexMapping[nameIndex];
+					if (finalNameIndex === -2) {
+						const name = nameIndexValueMapping[nameIndex];
+						let globalIndex = nameMapping.get(name);
+						if (globalIndex === undefined) {
+							nameMapping.set(name, (globalIndex = nameMapping.size));
+							onName(globalIndex, name);
+						}
+						finalNameIndex = globalIndex;
+						nameIndexMapping[nameIndex] = finalNameIndex;
+					}
+				}
+				onChunk(
+					chunk,
+					generatedLine,
+					generatedColumn,
+					finalSourceIndex,
+					originalLine,
+					originalColumn,
+					finalNameIndex
+				);
+			}
+		},
+		(i, source, sourceContent) => {
+			if (source === innerSourceName) {
+				innerSourceIndex = i;
+				if (innerSource !== undefined) sourceContent = innerSource;
+				else innerSource = sourceContent;
+				sourceIndexMapping[i] = -2;
+				streamChunksOfSourceMap(
+					sourceContent,
+					innerSourceMap,
+					(
+						chunk,
+						generatedLine,
+						generatedColumn,
+						sourceIndex,
+						originalLine,
+						originalColumn,
+						nameIndex
+					) => {
+						while (innerSourceMapLineData.length < generatedLine) {
+							innerSourceMapLineData.push({
+								mappingsData: [],
+								chunks: []
+							});
+						}
+						const data = innerSourceMapLineData[generatedLine - 1];
+						data.mappingsData.push(
+							generatedColumn,
+							sourceIndex,
+							originalLine,
+							originalColumn,
+							nameIndex
+						);
+						data.chunks.push(chunk);
+					},
+					(i, source, sourceContent) => {
+						innerSourceContents[i] = sourceContent;
+						innerSourceContentLines[i] = undefined;
+						innerSourceIndexMapping[i] = -2;
+						innerSourceIndexValueMapping[i] = [source, sourceContent];
+					},
+					(i, name) => {
+						innerNameIndexMapping[i] = -2;
+						innerNameIndexValueMapping[i] = name;
+					},
+					false,
+					columns
+				);
+			} else {
+				let globalIndex = sourceMapping.get(source);
+				if (globalIndex === undefined) {
+					sourceMapping.set(source, (globalIndex = sourceMapping.size));
+					onSource(globalIndex, source, sourceContent);
+				}
+				sourceIndexMapping[i] = globalIndex;
+			}
+		},
+		(i, name) => {
+			nameIndexMapping[i] = -2;
+			nameIndexValueMapping[i] = name;
+		},
+		finalSource,
+		columns
+	);
+};
+
+module.exports = streamChunksOfCombinedSourceMap;
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfRawSource.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfRawSource.js
new file mode 100644
index 0000000..133022a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfRawSource.js
@@ -0,0 +1,34 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const getGeneratedSourceInfo = require("./getGeneratedSourceInfo");
+const splitIntoLines = require("./splitIntoLines");
+
+const streamChunksOfRawSource = (source, onChunk, onSource, onName) => {
+	let line = 1;
+	const matches = splitIntoLines(source);
+	let match;
+	for (match of matches) {
+		onChunk(match, line, 0, -1, -1, -1, -1);
+		line++;
+	}
+	return matches.length === 0 || match.endsWith("\n")
+		? {
+				generatedLine: matches.length + 1,
+				generatedColumn: 0
+		  }
+		: {
+				generatedLine: matches.length,
+				generatedColumn: match.length
+		  };
+};
+
+module.exports = (source, onChunk, onSource, onName, finalSource) => {
+	return finalSource
+		? getGeneratedSourceInfo(source)
+		: streamChunksOfRawSource(source, onChunk, onSource, onName);
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfSourceMap.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfSourceMap.js
new file mode 100644
index 0000000..c57cb34
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/helpers/streamChunksOfSourceMap.js
@@ -0,0 +1,412 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const getGeneratedSourceInfo = require("./getGeneratedSourceInfo");
+const getSource = require("./getSource");
+const readMappings = require("./readMappings");
+const splitIntoLines = require("./splitIntoLines");
+
+const streamChunksOfSourceMapFull = (
+	source,
+	sourceMap,
+	onChunk,
+	onSource,
+	onName
+) => {
+	const lines = splitIntoLines(source);
+	if (lines.length === 0) {
+		return {
+			generatedLine: 1,
+			generatedColumn: 0
+		};
+	}
+	const { sources, sourcesContent, names, mappings } = sourceMap;
+	for (let i = 0; i < sources.length; i++) {
+		onSource(
+			i,
+			getSource(sourceMap, i),
+			(sourcesContent && sourcesContent[i]) || undefined
+		);
+	}
+	if (names) {
+		for (let i = 0; i < names.length; i++) {
+			onName(i, names[i]);
+		}
+	}
+
+	const lastLine = lines[lines.length - 1];
+	const lastNewLine = lastLine.endsWith("\n");
+	const finalLine = lastNewLine ? lines.length + 1 : lines.length;
+	const finalColumn = lastNewLine ? 0 : lastLine.length;
+
+	let currentGeneratedLine = 1;
+	let currentGeneratedColumn = 0;
+
+	let mappingActive = false;
+	let activeMappingSourceIndex = -1;
+	let activeMappingOriginalLine = -1;
+	let activeMappingOriginalColumn = -1;
+	let activeMappingNameIndex = -1;
+
+	const onMapping = (
+		generatedLine,
+		generatedColumn,
+		sourceIndex,
+		originalLine,
+		originalColumn,
+		nameIndex
+	) => {
+		if (mappingActive && currentGeneratedLine <= lines.length) {
+			let chunk;
+			const mappingLine = currentGeneratedLine;
+			const mappingColumn = currentGeneratedColumn;
+			const line = lines[currentGeneratedLine - 1];
+			if (generatedLine !== currentGeneratedLine) {
+				chunk = line.slice(currentGeneratedColumn);
+				currentGeneratedLine++;
+				currentGeneratedColumn = 0;
+			} else {
+				chunk = line.slice(currentGeneratedColumn, generatedColumn);
+				currentGeneratedColumn = generatedColumn;
+			}
+			if (chunk) {
+				onChunk(
+					chunk,
+					mappingLine,
+					mappingColumn,
+					activeMappingSourceIndex,
+					activeMappingOriginalLine,
+					activeMappingOriginalColumn,
+					activeMappingNameIndex
+				);
+			}
+			mappingActive = false;
+		}
+		if (generatedLine > currentGeneratedLine && currentGeneratedColumn > 0) {
+			if (currentGeneratedLine <= lines.length) {
+				const chunk = lines[currentGeneratedLine - 1].slice(
+					currentGeneratedColumn
+				);
+				onChunk(
+					chunk,
+					currentGeneratedLine,
+					currentGeneratedColumn,
+					-1,
+					-1,
+					-1,
+					-1
+				);
+			}
+			currentGeneratedLine++;
+			currentGeneratedColumn = 0;
+		}
+		while (generatedLine > currentGeneratedLine) {
+			if (currentGeneratedLine <= lines.length) {
+				onChunk(
+					lines[currentGeneratedLine - 1],
+					currentGeneratedLine,
+					0,
+					-1,
+					-1,
+					-1,
+					-1
+				);
+			}
+			currentGeneratedLine++;
+		}
+		if (generatedColumn > currentGeneratedColumn) {
+			if (currentGeneratedLine <= lines.length) {
+				const chunk = lines[currentGeneratedLine - 1].slice(
+					currentGeneratedColumn,
+					generatedColumn
+				);
+				onChunk(
+					chunk,
+					currentGeneratedLine,
+					currentGeneratedColumn,
+					-1,
+					-1,
+					-1,
+					-1
+				);
+			}
+			currentGeneratedColumn = generatedColumn;
+		}
+		if (
+			sourceIndex >= 0 &&
+			(generatedLine < finalLine ||
+				(generatedLine === finalLine && generatedColumn < finalColumn))
+		) {
+			mappingActive = true;
+			activeMappingSourceIndex = sourceIndex;
+			activeMappingOriginalLine = originalLine;
+			activeMappingOriginalColumn = originalColumn;
+			activeMappingNameIndex = nameIndex;
+		}
+	};
+	readMappings(mappings, onMapping);
+	onMapping(finalLine, finalColumn, -1, -1, -1, -1);
+	return {
+		generatedLine: finalLine,
+		generatedColumn: finalColumn
+	};
+};
+
+const streamChunksOfSourceMapLinesFull = (
+	source,
+	sourceMap,
+	onChunk,
+	onSource,
+	_onName
+) => {
+	const lines = splitIntoLines(source);
+	if (lines.length === 0) {
+		return {
+			generatedLine: 1,
+			generatedColumn: 0
+		};
+	}
+	const { sources, sourcesContent, mappings } = sourceMap;
+	for (let i = 0; i < sources.length; i++) {
+		onSource(
+			i,
+			getSource(sourceMap, i),
+			(sourcesContent && sourcesContent[i]) || undefined
+		);
+	}
+
+	let currentGeneratedLine = 1;
+
+	const onMapping = (
+		generatedLine,
+		_generatedColumn,
+		sourceIndex,
+		originalLine,
+		originalColumn,
+		_nameIndex
+	) => {
+		if (
+			sourceIndex < 0 ||
+			generatedLine < currentGeneratedLine ||
+			generatedLine > lines.length
+		) {
+			return;
+		}
+		while (generatedLine > currentGeneratedLine) {
+			if (currentGeneratedLine <= lines.length) {
+				onChunk(
+					lines[currentGeneratedLine - 1],
+					currentGeneratedLine,
+					0,
+					-1,
+					-1,
+					-1,
+					-1
+				);
+			}
+			currentGeneratedLine++;
+		}
+		if (generatedLine <= lines.length) {
+			onChunk(
+				lines[generatedLine - 1],
+				generatedLine,
+				0,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				-1
+			);
+			currentGeneratedLine++;
+		}
+	};
+	readMappings(mappings, onMapping);
+	for (; currentGeneratedLine <= lines.length; currentGeneratedLine++) {
+		onChunk(
+			lines[currentGeneratedLine - 1],
+			currentGeneratedLine,
+			0,
+			-1,
+			-1,
+			-1,
+			-1
+		);
+	}
+
+	const lastLine = lines[lines.length - 1];
+	const lastNewLine = lastLine.endsWith("\n");
+
+	const finalLine = lastNewLine ? lines.length + 1 : lines.length;
+	const finalColumn = lastNewLine ? 0 : lastLine.length;
+
+	return {
+		generatedLine: finalLine,
+		generatedColumn: finalColumn
+	};
+};
+
+const streamChunksOfSourceMapFinal = (
+	source,
+	sourceMap,
+	onChunk,
+	onSource,
+	onName
+) => {
+	const result = getGeneratedSourceInfo(source);
+	const { generatedLine: finalLine, generatedColumn: finalColumn } = result;
+
+	if (finalLine === 1 && finalColumn === 0) return result;
+	const { sources, sourcesContent, names, mappings } = sourceMap;
+	for (let i = 0; i < sources.length; i++) {
+		onSource(
+			i,
+			getSource(sourceMap, i),
+			(sourcesContent && sourcesContent[i]) || undefined
+		);
+	}
+	if (names) {
+		for (let i = 0; i < names.length; i++) {
+			onName(i, names[i]);
+		}
+	}
+
+	let mappingActiveLine = 0;
+
+	const onMapping = (
+		generatedLine,
+		generatedColumn,
+		sourceIndex,
+		originalLine,
+		originalColumn,
+		nameIndex
+	) => {
+		if (
+			generatedLine >= finalLine &&
+			(generatedColumn >= finalColumn || generatedLine > finalLine)
+		) {
+			return;
+		}
+		if (sourceIndex >= 0) {
+			onChunk(
+				undefined,
+				generatedLine,
+				generatedColumn,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				nameIndex
+			);
+			mappingActiveLine = generatedLine;
+		} else if (mappingActiveLine === generatedLine) {
+			onChunk(undefined, generatedLine, generatedColumn, -1, -1, -1, -1);
+			mappingActiveLine = 0;
+		}
+	};
+	readMappings(mappings, onMapping);
+	return result;
+};
+
+const streamChunksOfSourceMapLinesFinal = (
+	source,
+	sourceMap,
+	onChunk,
+	onSource,
+	_onName
+) => {
+	const result = getGeneratedSourceInfo(source);
+	const { generatedLine, generatedColumn } = result;
+	if (generatedLine === 1 && generatedColumn === 0) {
+		return {
+			generatedLine: 1,
+			generatedColumn: 0
+		};
+	}
+
+	const { sources, sourcesContent, mappings } = sourceMap;
+	for (let i = 0; i < sources.length; i++) {
+		onSource(
+			i,
+			getSource(sourceMap, i),
+			(sourcesContent && sourcesContent[i]) || undefined
+		);
+	}
+
+	const finalLine = generatedColumn === 0 ? generatedLine - 1 : generatedLine;
+
+	let currentGeneratedLine = 1;
+
+	const onMapping = (
+		generatedLine,
+		_generatedColumn,
+		sourceIndex,
+		originalLine,
+		originalColumn,
+		_nameIndex
+	) => {
+		if (
+			sourceIndex >= 0 &&
+			currentGeneratedLine <= generatedLine &&
+			generatedLine <= finalLine
+		) {
+			onChunk(
+				undefined,
+				generatedLine,
+				0,
+				sourceIndex,
+				originalLine,
+				originalColumn,
+				-1
+			);
+			currentGeneratedLine = generatedLine + 1;
+		}
+	};
+	readMappings(mappings, onMapping);
+	return result;
+};
+
+module.exports = (
+	source,
+	sourceMap,
+	onChunk,
+	onSource,
+	onName,
+	finalSource,
+	columns
+) => {
+	if (columns) {
+		return finalSource
+			? streamChunksOfSourceMapFinal(
+					source,
+					sourceMap,
+					onChunk,
+					onSource,
+					onName
+			  )
+			: streamChunksOfSourceMapFull(
+					source,
+					sourceMap,
+					onChunk,
+					onSource,
+					onName
+			  );
+	} else {
+		return finalSource
+			? streamChunksOfSourceMapLinesFinal(
+					source,
+					sourceMap,
+					onChunk,
+					onSource,
+					onName
+			  )
+			: streamChunksOfSourceMapLinesFull(
+					source,
+					sourceMap,
+					onChunk,
+					onSource,
+					onName
+			  );
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/lib/index.js b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/index.js
new file mode 100644
index 0000000..0c11c2f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/lib/index.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+const defineExport = (name, fn) => {
+	let value;
+	Object.defineProperty(exports, name, {
+		get: () => {
+			if (fn !== undefined) {
+				value = fn();
+				fn = undefined;
+			}
+			return value;
+		},
+		configurable: true
+	});
+};
+
+defineExport("Source", () => require("./Source"));
+
+defineExport("RawSource", () => require("./RawSource"));
+defineExport("OriginalSource", () => require("./OriginalSource"));
+defineExport("SourceMapSource", () => require("./SourceMapSource"));
+defineExport("CachedSource", () => require("./CachedSource"));
+defineExport("ConcatSource", () => require("./ConcatSource"));
+defineExport("ReplaceSource", () => require("./ReplaceSource"));
+defineExport("PrefixSource", () => require("./PrefixSource"));
+defineExport("SizeOnlySource", () => require("./SizeOnlySource"));
+defineExport("CompatSource", () => require("./CompatSource"));
diff --git a/node_modules/mathjs/examples/node_modules/webpack-sources/package.json b/node_modules/mathjs/examples/node_modules/webpack-sources/package.json
new file mode 100644
index 0000000..33ae44c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack-sources/package.json
@@ -0,0 +1,58 @@
+{
+  "name": "webpack-sources",
+  "version": "3.2.3",
+  "description": "Source code handling classes for webpack",
+  "main": "./lib/index.js",
+  "scripts": {
+    "pretest": "yarn lint",
+    "test": "jest",
+    "lint": "eslint --cache lib test/*.js",
+    "cover": "jest --coverage"
+  },
+  "devDependencies": {
+    "coveralls": "^3.0.2",
+    "eslint": "^7.7.0",
+    "eslint-config-prettier": "^6.11.0",
+    "eslint-plugin-jest": "^23.20.0",
+    "eslint-plugin-mocha": "^8.0.0",
+    "eslint-plugin-node": "^11.1.0",
+    "eslint-plugin-nodeca": "^1.0.3",
+    "eslint-plugin-prettier": "^3.0.1",
+    "istanbul": "^0.4.1",
+    "jest": "^26.4.0",
+    "prettier": "^2.0.5",
+    "source-map": "^0.7.3",
+    "sourcemap-validator": "^2.1.0"
+  },
+  "files": [
+    "lib/",
+    "!lib/helpers/__mocks__"
+  ],
+  "engines": {
+    "node": ">=10.13.0"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/webpack/webpack-sources.git"
+  },
+  "keywords": [
+    "webpack",
+    "source-map"
+  ],
+  "author": "Tobias Koppers @sokra",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/webpack/webpack-sources/issues"
+  },
+  "homepage": "https://github.com/webpack/webpack-sources#readme",
+  "jest": {
+    "forceExit": true,
+    "testMatch": [
+      "<rootDir>/test/*.js"
+    ],
+    "transformIgnorePatterns": [
+      "<rootDir>"
+    ],
+    "testEnvironment": "node"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/LICENSE b/node_modules/mathjs/examples/node_modules/webpack/LICENSE
new file mode 100644
index 0000000..8c11fc7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/LICENSE
@@ -0,0 +1,20 @@
+Copyright JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/webpack/README.md b/node_modules/mathjs/examples/node_modules/webpack/README.md
new file mode 100644
index 0000000..517a5ee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/README.md
@@ -0,0 +1,711 @@
+<div align="center">
+  <a href="https://github.com/webpack/webpack">
+    <img width="200" height="200" src="https://webpack.js.org/assets/icon-square-big.svg">
+  </a>
+  <br>
+  <br>
+
+[![npm][npm]][npm-url]
+
+[![node][node]][node-url]
+[![deps][deps]][deps-url]
+[![builds2][builds2]][builds2-url]
+[![coverage][cover]][cover-url]
+[![licenses][licenses]][licenses-url]
+[![PR's welcome][prs]][prs-url]
+
+  <br>
+  <a href="https://dependabot.com/compatibility-score.html?dependency-name=webpack&package-manager=npm_and_yarn&new-version=latest">
+    <img src="https://api.dependabot.com/badges/compatibility_score?dependency-name=webpack&package-manager=npm_and_yarn&version-scheme=semver&target-version=latest">
+  </a>
+	<a href="https://npmcharts.com/compare/webpack?minimal=true">
+		<img src="https://img.shields.io/npm/dm/webpack.svg">
+	</a>
+	<a href="https://packagephobia.com/result?p=webpack">
+		<img src="https://packagephobia.com/badge?p=webpack" alt="install size">
+	</a>
+	<a href="https://opencollective.com/webpack#backer">
+		<img src="https://opencollective.com/webpack/backers/badge.svg">
+	</a>
+	<a href="https://opencollective.com/webpack#sponsors">
+		<img src="https://opencollective.com/webpack/sponsors/badge.svg">
+	</a>
+	<a href="https://github.com/webpack/webpack/graphs/contributors">
+		<img src="https://img.shields.io/github/contributors/webpack/webpack.svg">
+	</a>
+	<a href="https://gitter.im/webpack/webpack">
+		<img src="https://badges.gitter.im/webpack/webpack.svg">
+	</a>
+  <h1>webpack</h1>
+  <p>
+    Webpack is a module bundler. Its main purpose is to bundle JavaScript files for usage in a browser, yet it is also capable of transforming, bundling, or packaging just about any resource or asset.
+  </p>
+</div>
+
+## Table of Contents
+
+1. [Install](#install)
+2. [Introduction](#introduction)
+3. [Concepts](#concepts)
+4. [Contributing](#contributing)
+5. [Support](#support)
+6. [Core Team](#core-team)
+7. [Sponsoring](#sponsoring)
+8. [Premium Partners](#premium-partners)
+9. [Other Backers and Sponsors](#other-backers-and-sponsors)
+10. [Gold Sponsors](#gold-sponsors)
+11. [Silver Sponsors](#silver-sponsors)
+12. [Bronze Sponsors](#bronze-sponsors)
+13. [Backers](#backers)
+14. [Special Thanks](#special-thanks-to)
+
+<h2 align="center">Install</h2>
+
+Install with npm:
+
+```bash
+npm install --save-dev webpack
+```
+
+Install with yarn:
+
+```bash
+yarn add webpack --dev
+```
+
+<h2 align="center">Introduction</h2>
+
+Webpack is a bundler for modules. The main purpose is to bundle JavaScript
+files for usage in a browser, yet it is also capable of transforming, bundling,
+or packaging just about any resource or asset.
+
+**TL;DR**
+
+- Bundles [ES Modules](https://www.2ality.com/2014/09/es6-modules-final.html), [CommonJS](http://wiki.commonjs.org/), and [AMD](https://github.com/amdjs/amdjs-api/wiki/AMD) modules (even combined).
+- Can create a single bundle or multiple chunks that are asynchronously loaded at runtime (to reduce initial loading time).
+- Dependencies are resolved during compilation, reducing the runtime size.
+- Loaders can preprocess files while compiling, e.g. TypeScript to JavaScript, Handlebars strings to compiled functions, images to Base64, etc.
+- Highly modular plugin system to do whatever else your application requires.
+
+### Get Started
+
+Check out webpack's quick [**Get Started**](https://webpack.js.org/guides/getting-started) guide and the [other guides](https://webpack.js.org/guides/).
+
+### Browser Compatibility
+
+Webpack supports all browsers that are [ES5-compliant](https://kangax.github.io/compat-table/es5/) (IE8 and below are not supported).
+Webpack also needs `Promise` for `import()` and `require.ensure()`. If you want to support older browsers, you will need to [load a polyfill](https://webpack.js.org/guides/shimming/) before using these expressions.
+
+<h2 align="center">Concepts</h2>
+
+### [Plugins](https://webpack.js.org/plugins/)
+
+Webpack has a [rich plugin
+interface](https://webpack.js.org/plugins/). Most of the features
+within webpack itself use this plugin interface. This makes webpack very
+**flexible**.
+
+|                   Name                    |       Status       |    Install Size     | Description                                                                             |
+| :---------------------------------------: | :----------------: | :-----------------: | :-------------------------------------------------------------------------------------- |
+|    [mini-css-extract-plugin][mini-css]    |  ![mini-css-npm]   |  ![mini-css-size]   | Extracts CSS into separate files. It creates a CSS file per JS file which contains CSS. |
+| [compression-webpack-plugin][compression] | ![compression-npm] | ![compression-size] | Prepares compressed versions of assets to serve them with Content-Encoding              |
+|    [html-webpack-plugin][html-plugin]     | ![html-plugin-npm] | ![html-plugin-size] | Simplifies creation of HTML files (`index.html`) to serve your bundles                  |
+
+[common-npm]: https://img.shields.io/npm/v/webpack.svg
+[mini-css]: https://github.com/webpack-contrib/mini-css-extract-plugin
+[mini-css-npm]: https://img.shields.io/npm/v/mini-css-extract-plugin.svg
+[mini-css-size]: https://packagephobia.com/badge?p=mini-css-extract-plugin
+[component]: https://github.com/webpack-contrib/component-webpack-plugin
+[component-npm]: https://img.shields.io/npm/v/component-webpack-plugin.svg
+[component-size]: https://packagephobia.com/badge?p=component-webpack-plugin
+[compression]: https://github.com/webpack-contrib/compression-webpack-plugin
+[compression-npm]: https://img.shields.io/npm/v/compression-webpack-plugin.svg
+[compression-size]: https://packagephobia.com/badge?p=compression-webpack-plugin
+[html-plugin]: https://github.com/jantimon/html-webpack-plugin
+[html-plugin-npm]: https://img.shields.io/npm/v/html-webpack-plugin.svg
+[html-plugin-size]: https://packagephobia.com/badge?p=html-webpack-plugin
+
+### [Loaders](https://webpack.js.org/loaders/)
+
+Webpack enables the use of loaders to preprocess files. This allows you to bundle
+**any static resource** way beyond JavaScript. You can easily [write your own
+loaders](https://webpack.js.org/api/loaders/) using Node.js.
+
+Loaders are activated by using `loadername!` prefixes in `require()` statements,
+or are automatically applied via regex from your webpack configuration.
+
+#### Files
+
+|       Name        |   Status   | Install Size | Description                                              |
+| :---------------: | :--------: | :----------: | :------------------------------------------------------- |
+| [val-loader][val] | ![val-npm] | ![val-size]  | Executes code as module and considers exports as JS code |
+
+[val]: https://github.com/webpack-contrib/val-loader
+[val-npm]: https://img.shields.io/npm/v/val-loader.svg
+[val-size]: https://packagephobia.com/badge?p=val-loader
+
+#### JSON
+
+|                                                                   Name                                                                    |   Status    | Install Size |           Description            |
+| :---------------------------------------------------------------------------------------------------------------------------------------: | :---------: | :----------: | :------------------------------: |
+| <a href="https://github.com/awnist/cson-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/coffeescript.svg"></a> | ![cson-npm] | ![cson-size] | Loads and transpiles a CSON file |
+
+[cson-npm]: https://img.shields.io/npm/v/cson-loader.svg
+[cson-size]: https://packagephobia.com/badge?p=cson-loader
+
+#### Transpiling
+
+|                                                                            Name                                                                            |    Status     |  Install Size  | Description                                                                                       |
+| :--------------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------: | :------------: | :------------------------------------------------------------------------------------------------ |
+| <a href="https://github.com/babel/babel-loader"><img width="48" height="48" title="babel-loader" src="https://worldvectorlogo.com/logos/babel-10.svg"></a> | ![babel-npm]  | ![babel-size]  | Loads ES2015+ code and transpiles to ES5 using <a href="https://github.com/babel/babel">Babel</a> |
+|  <a href="https://github.com/TypeStrong/ts-loader"><img width="48" height="48" src="https://cdn.rawgit.com/Microsoft/TypeScript/master/doc/logo.svg"></a>  |  ![type-npm]  |  ![type-size]  | Loads TypeScript like JavaScript                                                                  |
+|    <a href="https://github.com/webpack-contrib/coffee-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/coffeescript.svg"></a>    | ![coffee-npm] | ![coffee-size] | Loads CoffeeScript like JavaScript                                                                |
+
+[babel-npm]: https://img.shields.io/npm/v/babel-loader.svg
+[babel-size]: https://packagephobia.com/badge?p=babel-loader
+[coffee-npm]: https://img.shields.io/npm/v/coffee-loader.svg
+[coffee-size]: https://packagephobia.com/badge?p=coffee-loader
+[type-npm]: https://img.shields.io/npm/v/ts-loader.svg
+[type-size]: https://packagephobia.com/badge?p=ts-loader
+
+#### Templating
+
+|                                                                                 Name                                                                                  |     Status      |   Install Size   | Description                                                                             |
+| :-------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :-------------: | :--------------: | :-------------------------------------------------------------------------------------- |
+|              <a href="https://github.com/webpack-contrib/html-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/html5.svg"></a>              |   ![html-npm]   |   ![html-size]   | Exports HTML as string, requires references to static resources                         |
+| <a href="https://github.com/pugjs/pug-loader"><img width="48" height="48" src="https://cdn.rawgit.com/pugjs/pug-logo/master/SVG/pug-final-logo-_-colour-128.svg"></a> |   ![pug-npm]    |   ![pug-size]    | Loads Pug templates and returns a function                                              |
+|              <a href="https://github.com/peerigon/markdown-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/markdown.svg"></a>              |    ![md-npm]    |    ![md-size]    | Compiles Markdown to HTML                                                               |
+|               <a href="https://github.com/posthtml/posthtml-loader"><img width="48" height="48" src="https://posthtml.github.io/posthtml/logo.svg"></a>               | ![posthtml-npm] | ![posthtml-size] | Loads and transforms a HTML file using [PostHTML](https://github.com/posthtml/posthtml) |
+|           <a href="https://github.com/pcardune/handlebars-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/handlebars-1.svg"></a>           |   ![hbs-npm]    |   ![hbs-size]    | Compiles Handlebars to HTML                                                             |
+
+[html-npm]: https://img.shields.io/npm/v/html-loader.svg
+[html-size]: https://packagephobia.com/badge?p=html-loader
+[pug-npm]: https://img.shields.io/npm/v/pug-loader.svg
+[pug-size]: https://packagephobia.com/badge?p=pug-loader
+[jade-npm]: https://img.shields.io/npm/v/jade-loader.svg
+[jade-size]: https://packagephobia.com/badge?p=jade-loader
+[md-npm]: https://img.shields.io/npm/v/markdown-loader.svg
+[md-size]: https://packagephobia.com/badge?p=markdown-loader
+[posthtml-npm]: https://img.shields.io/npm/v/posthtml-loader.svg
+[posthtml-size]: https://packagephobia.com/badge?p=posthtml-loader
+[hbs-npm]: https://img.shields.io/npm/v/handlebars-loader.svg
+[hbs-size]: https://packagephobia.com/badge?p=handlebars-loader
+
+#### Styling
+
+|                                                                     Name                                                                      |     Status     |  Install Size   | Description                                                              |
+| :-------------------------------------------------------------------------------------------------------------------------------------------: | :------------: | :-------------: | :----------------------------------------------------------------------- |
+|                                    <a href="https://github.com/webpack-contrib/style-loader">`<style>`</a>                                    |  ![style-npm]  |  ![style-size]  | Add exports of a module as style to DOM                                  |
+|  <a href="https://github.com/webpack-contrib/css-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/css-3.svg"></a>   |   ![css-npm]   |   ![css-size]   | Loads CSS file with resolved imports and returns CSS code                |
+| <a href="https://github.com/webpack-contrib/less-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/less-63.svg"></a> |  ![less-npm]   |  ![less-size]   | Loads and compiles a LESS file                                           |
+| <a href="https://github.com/webpack-contrib/sass-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/sass-1.svg"></a>  |  ![sass-npm]   |  ![sass-size]   | Loads and compiles a Sass/SCSS file                                      |
+|     <a href="https://github.com/shama/stylus-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/stylus.svg"></a>      | ![stylus-npm]  | ![stylus-size]  | Loads and compiles a Stylus file                                         |
+|   <a href="https://github.com/postcss/postcss-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/postcss.svg"></a>    | ![postcss-npm] | ![postcss-size] | Loads and transforms a CSS/SSS file using [PostCSS](https://postcss.org) |
+
+[style-npm]: https://img.shields.io/npm/v/style-loader.svg
+[style-size]: https://packagephobia.com/badge?p=style-loader
+[css-npm]: https://img.shields.io/npm/v/css-loader.svg
+[css-size]: https://packagephobia.com/badge?p=css-loader
+[less-npm]: https://img.shields.io/npm/v/less-loader.svg
+[less-size]: https://packagephobia.com/badge?p=less-loader
+[sass-npm]: https://img.shields.io/npm/v/sass-loader.svg
+[sass-size]: https://packagephobia.com/badge?p=sass-loader
+[stylus-npm]: https://img.shields.io/npm/v/stylus-loader.svg
+[stylus-size]: https://packagephobia.com/badge?p=stylus-loader
+[postcss-npm]: https://img.shields.io/npm/v/postcss-loader.svg
+[postcss-size]: https://packagephobia.com/badge?p=postcss-loader
+
+#### Frameworks
+
+|                                                                             Name                                                                             |     Status     |  Install Size   | Description                                                                                            |
+| :----------------------------------------------------------------------------------------------------------------------------------------------------------: | :------------: | :-------------: | :----------------------------------------------------------------------------------------------------- |
+|               <a href="https://github.com/vuejs/vue-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/vue-9.svg"></a>               |   ![vue-npm]   |   ![vue-size]   | Loads and compiles Vue Components                                                                      |
+|   <a href="https://github.com/webpack-contrib/polymer-webpack-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/polymer.svg"></a>   | ![polymer-npm] | ![polymer-size] | Process HTML & CSS with preprocessor of choice and `require()` Web Components like first-class modules |
+| <a href="https://github.com/TheLarkInn/angular2-template-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/angular-icon-1.svg"></a> | ![angular-npm] | ![angular-size] | Loads and compiles Angular 2 Components                                                                |
+|              <a href="https://github.com/riot/webpack-loader"><img width="48" height="48" src="https://worldvectorlogo.com/logos/riot.svg"></a>              |  ![riot-npm]   |  ![riot-size]   | Riot official webpack loader                                                                           |
+
+[vue-npm]: https://img.shields.io/npm/v/vue-loader.svg
+[vue-size]: https://packagephobia.com/badge?p=vue-loader
+[polymer-npm]: https://img.shields.io/npm/v/polymer-webpack-loader.svg
+[polymer-size]: https://packagephobia.com/badge?p=polymer-webpack-loader
+[angular-npm]: https://img.shields.io/npm/v/angular2-template-loader.svg
+[angular-size]: https://packagephobia.com/badge?p=angular2-template-loader
+[riot-npm]: https://img.shields.io/npm/v/riot-tag-loader.svg
+[riot-size]: https://packagephobia.com/badge?p=riot-tag-loader
+
+### Performance
+
+Webpack uses async I/O and has multiple caching levels. This makes webpack fast
+and incredibly **fast** on incremental compilations.
+
+### Module Formats
+
+Webpack supports ES2015+, CommonJS and AMD modules **out of the box**. It performs clever static
+analysis on the AST of your code. It even has an evaluation engine to evaluate
+simple expressions. This allows you to **support most existing libraries** out of the box.
+
+### [Code Splitting](https://webpack.js.org/guides/code-splitting/)
+
+Webpack allows you to split your codebase into multiple chunks. Chunks are
+loaded asynchronously at runtime. This reduces the initial loading time.
+
+### [Optimizations](https://webpack.js.org/guides/production-build/)
+
+Webpack can do many optimizations to **reduce the output size of your
+JavaScript** by deduplicating frequently used modules, minifying, and giving
+you full control of what is loaded initially and what is loaded at runtime
+through code splitting. It can also make your code chunks **cache
+friendly** by using hashes.
+
+<h2 align="center">Contributing</h2>
+
+**We want contributing to webpack to be fun, enjoyable, and educational for anyone, and everyone.** We have a [vibrant ecosystem](https://medium.com/webpack/contributors-guide/home) that spans beyond this single repo. We welcome you to check out any of the repositories in [our organization](https://github.com/webpack) or [webpack-contrib organization](https://github.com/webpack-contrib) which houses all of our loaders and plugins.
+
+Contributions go far beyond pull requests and commits. Although we love giving you the opportunity to put your stamp on webpack, we also are thrilled to receive a variety of other contributions including:
+
+- [Documentation](https://github.com/webpack/webpack.js.org) updates, enhancements, designs, or bugfixes
+- Spelling or grammar fixes
+- README.md corrections or redesigns
+- Adding unit, or functional tests
+- Triaging GitHub issues -- especially determining whether an issue still persists or is reproducible.
+- [Searching #webpack on twitter](https://twitter.com/search?q=webpack) and helping someone else who needs help
+- Teaching others how to contribute to one of the many webpack's repos!
+- [Blogging, speaking about, or creating tutorials](https://github.com/webpack-contrib/awesome-webpack) about one of webpack's many features.
+- Helping others in our webpack [gitter channel](https://gitter.im/webpack/webpack).
+
+To get started have a look at our [documentation on contributing](https://github.com/webpack/webpack/blob/main/CONTRIBUTING.md).
+
+If you are worried or don't know where to start, you can **always** reach out to [Sean Larkin (@TheLarkInn) on Twitter](https://twitter.com/thelarkinn) or simply submit an issue and a maintainer can help give you guidance!
+
+We have also started a series on our [Medium Publication](https://medium.com/webpack) called [The Contributor's Guide to webpack](https://medium.com/webpack/contributors-guide/home). We welcome you to read it and post any questions or responses if you still need help.
+
+_Looking to speak about webpack?_ We'd **love** to review your talk abstract/CFP! You can email it to webpack [at] opencollective [dot] com and we can give pointers or tips!!!
+
+<h3 align="center">Creating your own plugins and loaders</h3>
+
+If you create a loader or plugin, we would <3 for you to open source it, and put it on npm. We follow the `x-loader`, `x-webpack-plugin` naming convention.
+
+<h2 align="center">Support</h2>
+
+We consider webpack to be a low-level tool used not only individually but also layered beneath other awesome tools. Because of its flexibility, webpack isn't always the _easiest_ entry-level solution, however we do believe it is the most powerful. That said, we're always looking for ways to improve and simplify the tool without compromising functionality. If you have any ideas on ways to accomplish this, we're all ears!
+
+If you're just getting started, take a look at [our new docs and concepts page](https://webpack.js.org/concepts/). This has a high level overview that is great for beginners!!
+
+Looking for webpack 1 docs? Please check out the old [wiki](https://github.com/webpack/docs/wiki/contents), but note that this deprecated version is no longer supported.
+
+If you want to discuss something or just need help, [here is our Gitter room](https://gitter.im/webpack/webpack) where there are always individuals looking to help out!
+
+If you are still having difficulty, we would love for you to post
+a question to [StackOverflow with the webpack tag](https://stackoverflow.com/tags/webpack). It is much easier to answer questions that include your webpack.config.js and relevant files! So if you can provide them, we'd be extremely grateful (and more likely to help you find the answer!)
+
+If you are twitter savvy you can tweet #webpack with your question and someone should be able to reach out and help also.
+
+If you have discovered a 🐜 or have a feature suggestion, feel free to create an issue on Github.
+
+### License
+
+[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bhttps%3A%2F%2Fgithub.com%2Fwebpack%2Fwebpack.svg?type=large)](https://app.fossa.io/projects/git%2Bhttps%3A%2F%2Fgithub.com%2Fwebpack%2Fwebpack?ref=badge_large)
+
+<h2 align="center">Core Team</h2>
+
+<table>
+  <tbody>
+    <tr>
+      <td align="center" valign="top">
+        <img width="150" height="150" src="https://github.com/sokra.png?s=150">
+        <br>
+        <a href="https://github.com/sokra">Tobias Koppers</a>
+        <p>Core</p>
+        <br>
+        <p>Founder of webpack</p>
+      </td>
+      <td align="center" valign="top">
+        <img width="150" height="150" src="https://github.com/jhnns.png?s=150">
+        <br>
+        <a href="https://github.com/jhnns">Johannes Ewald</a>
+        <p>Loaders &amp; Plugins</p>
+        <br>
+        <p>Early adopter of webpack</p>
+      </td>
+      <td align="center" width="20%" valign="top">
+        <img width="150" height="150" src="https://github.com/TheLarkInn.png?s=150">
+        <br>
+        <a href="https://github.com/TheLarkInn">Sean T. Larkin</a>
+        <p>Public Relations</p>
+        <br>
+        <p>Founder of the core team</p>
+      </td>
+      <td align="center" valign="top">
+        <img width="150" height="150" src="https://github.com/spacek33z.png?s=150">
+        <br>
+        <a href="https://github.com/spacek33z">Kees Kluskens</a>
+        <p>Development</p>
+        <br>
+        <p>Sponsor</p>
+        <a href="https://codeyellow.nl/">
+          <img height="15px" src="https://cloud.githubusercontent.com/assets/1365881/20286583/ad62eb04-aac7-11e6-9c14-a0fef35b9b56.png">
+        </a>
+		<br>
+      </td>
+     </tr>
+  </tbody>
+</table>
+
+<h2 align="center">Sponsoring</h2>
+
+Most of the core team members, webpack contributors and contributors in the ecosystem do this open source work in their free time. If you use webpack for a serious task, and you'd like us to invest more time on it, please donate. This project increases your income/productivity too. It makes development and applications faster and it reduces the required bandwidth.
+
+This is how we use the donations:
+
+- Allow the core team to work on webpack
+- Thank contributors if they invested a large amount of time in contributing
+- Support projects in the ecosystem that are of great value for users
+- Support projects that are voted most (work in progress)
+- Infrastructure cost
+- Fees for money handling
+
+<h2 align="center">Premium Partners</h2>
+
+<div align="center">
+
+<a href="https://www.ag-grid.com/?utm_source=webpack&utm_medium=banner&utm_campaign=sponsorship" target="_blank"><img align="center" src="https://raw.githubusercontent.com/webpack/media/2b399d58/horiz-banner-ad-ag-grid.png">
+</a>
+
+</div>
+
+<h2 align="center">Other Backers and Sponsors</h2>
+
+Before we started using OpenCollective, donations were made anonymously. Now that we have made the switch, we would like to acknowledge these sponsors (and the ones who continue to donate using OpenCollective). If we've missed someone, please send us a PR, and we'll add you to this list.
+
+<div align="center">
+
+<a href="https://angular.io/" target="_blank" title="JS framework"><img
+src="https://cdn.worldvectorlogo.com/logos/angular-icon-1.svg" height="30" alt="Angular"></a>
+<a href="https://moonmail.io" target="_blank" title="Email Marketing Software"><img
+src="https://static.moonmail.io/moonmail-logo.svg" height="30" alt="MoonMail"></a>
+<a href="https://monei.net" target="_blank" title="Best payment gateway rates"><img
+src="https://static.monei.net/monei-logo.svg" height="30" alt="MONEI"></a>
+
+</div>
+
+<h2 align="center">Gold Sponsors</h2>
+
+[Become a gold sponsor](https://opencollective.com/webpack#sponsor) and get your logo on our README on Github with a link to your site.
+
+<div align="center">
+
+<a href="https://opencollective.com/webpack/goldsponsor/0/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/0/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/1/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/1/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/2/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/2/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/3/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/3/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/4/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/4/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/5/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/5/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/6/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/6/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/7/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/7/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/8/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/8/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/9/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/9/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/10/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/10/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/11/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/11/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/12/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/12/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/13/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/13/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/14/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/14/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/15/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/15/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/16/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/16/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/17/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/17/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/18/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/18/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/19/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/19/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/20/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/20/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/21/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/21/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/22/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/22/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/23/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/23/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/24/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/24/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/25/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/25/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/26/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/26/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/27/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/27/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/28/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/28/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/goldsponsor/29/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/goldsponsor/29/avatar.svg?requireActive=false"></a>
+
+</div>
+
+<h2 align="center">Silver Sponsors</h2>
+
+[Become a silver sponsor](https://opencollective.com/webpack#sponsor) and get your logo on our README on Github with a link to your site.
+
+<div align="center">
+
+<a href="https://opencollective.com/webpack/silversponsor/0/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/0/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/1/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/1/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/2/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/2/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/3/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/3/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/4/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/4/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/5/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/5/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/6/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/6/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/7/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/7/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/8/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/8/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/9/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/9/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/10/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/10/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/11/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/11/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/12/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/12/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/13/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/13/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/14/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/14/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/15/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/15/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/16/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/16/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/17/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/17/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/18/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/18/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/19/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/19/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/20/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/20/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/21/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/21/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/22/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/22/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/23/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/23/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/24/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/24/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/25/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/25/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/26/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/26/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/27/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/27/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/28/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/28/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/silversponsor/29/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/silversponsor/29/avatar.svg?requireActive=false"></a>
+
+</div>
+
+<h2 align="center">Bronze Sponsors</h2>
+
+[Become a bronze sponsor](https://opencollective.com/webpack#sponsor) and get your logo on our README on Github with a link to your site.
+
+<div align="center">
+
+<a href="https://opencollective.com/webpack/sponsor/0/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/0/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/1/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/1/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/2/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/2/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/3/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/3/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/4/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/4/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/5/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/5/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/6/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/6/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/7/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/7/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/8/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/8/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/9/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/9/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/10/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/10/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/11/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/11/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/12/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/12/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/13/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/13/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/14/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/14/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/15/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/15/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/16/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/16/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/17/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/17/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/18/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/18/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/19/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/19/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/20/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/20/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/21/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/21/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/22/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/22/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/23/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/23/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/24/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/24/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/25/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/25/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/26/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/26/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/27/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/27/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/28/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/28/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/29/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/29/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/30/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/30/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/31/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/31/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/32/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/32/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/33/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/33/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/34/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/34/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/35/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/35/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/36/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/36/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/37/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/37/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/38/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/38/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/39/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/39/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/40/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/40/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/41/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/41/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/42/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/42/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/43/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/43/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/44/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/44/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/45/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/45/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/46/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/46/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/47/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/47/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/48/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/48/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/49/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/49/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/50/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/50/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/51/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/51/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/52/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/52/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/53/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/53/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/54/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/54/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/55/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/55/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/56/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/56/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/57/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/57/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/58/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/58/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/59/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/59/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/60/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/60/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/61/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/61/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/62/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/62/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/63/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/63/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/64/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/64/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/65/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/65/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/66/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/66/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/67/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/67/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/68/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/68/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/69/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/69/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/70/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/70/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/71/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/71/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/72/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/72/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/73/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/73/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/74/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/74/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/75/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/75/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/76/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/76/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/77/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/77/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/78/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/78/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/79/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/79/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/80/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/80/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/81/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/81/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/82/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/82/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/83/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/83/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/84/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/84/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/85/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/85/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/86/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/86/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/87/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/87/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/88/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/88/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/89/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/89/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/90/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/90/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/91/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/91/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/92/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/92/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/93/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/93/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/94/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/94/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/95/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/95/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/96/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/96/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/97/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/97/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/98/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/98/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/99/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/99/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/sponsor/100/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/sponsor/100/avatar.svg?requireActive=false"></a>
+
+</div>
+
+<h2 align="center">Backers</h2>
+
+[Become a backer](https://opencollective.com/webpack#backer) and get your image on our README on Github with a link to your site.
+
+<a href="https://opencollective.com/webpack/backer/0/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/0/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/1/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/1/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/2/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/2/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/3/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/3/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/4/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/4/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/5/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/5/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/6/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/6/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/7/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/7/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/8/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/8/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/9/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/9/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/10/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/10/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/11/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/11/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/12/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/12/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/13/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/13/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/14/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/14/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/15/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/15/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/16/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/16/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/17/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/17/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/18/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/18/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/19/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/19/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/20/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/20/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/21/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/21/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/22/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/22/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/23/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/23/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/24/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/24/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/25/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/25/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/26/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/26/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/27/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/27/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/28/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/28/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/29/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/29/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/30/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/30/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/31/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/31/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/32/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/32/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/33/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/33/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/34/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/34/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/35/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/35/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/36/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/36/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/37/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/37/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/38/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/38/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/39/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/39/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/40/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/40/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/41/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/41/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/42/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/42/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/43/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/43/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/44/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/44/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/45/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/45/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/46/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/46/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/47/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/47/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/48/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/48/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/49/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/49/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/50/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/50/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/51/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/51/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/52/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/52/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/53/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/53/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/54/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/54/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/55/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/55/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/56/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/56/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/57/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/57/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/58/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/58/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/59/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/59/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/60/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/60/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/61/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/61/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/62/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/62/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/63/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/63/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/64/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/64/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/65/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/65/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/66/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/66/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/67/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/67/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/68/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/68/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/69/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/69/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/70/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/70/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/71/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/71/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/72/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/72/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/73/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/73/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/74/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/74/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/75/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/75/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/76/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/76/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/77/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/77/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/78/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/78/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/79/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/79/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/80/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/80/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/81/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/81/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/82/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/82/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/83/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/83/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/84/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/84/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/85/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/85/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/86/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/86/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/87/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/87/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/88/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/88/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/89/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/89/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/90/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/90/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/91/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/91/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/92/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/92/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/93/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/93/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/94/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/94/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/95/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/95/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/96/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/96/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/97/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/97/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/98/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/98/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/99/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/99/avatar.svg?requireActive=false"></a>
+<a href="https://opencollective.com/webpack/backer/100/website?requireActive=false" target="_blank"><img src="https://opencollective.com/webpack/backer/100/avatar.svg?requireActive=false"></a>
+
+<h2 align="center">Special Thanks to</h2>
+<p align="center">(In chronological order)</p>
+
+- [@google](https://github.com/google) for [Google Web Toolkit (GWT)](http://www.gwtproject.org/), which aims to compile Java to JavaScript. It features a similar [Code Splitting](http://www.gwtproject.org/doc/latest/DevGuideCodeSplitting.html) as webpack.
+- [@medikoo](https://github.com/medikoo) for [modules-webmake](https://github.com/medikoo/modules-webmake), which is a similar project. webpack was born because I wanted Code Splitting for modules-webmake. Interestingly the [Code Splitting issue is still open](https://github.com/medikoo/modules-webmake/issues/7) (thanks also to @Phoscur for the discussion).
+- [@substack](https://github.com/substack) for [browserify](https://browserify.org/), which is a similar project and source for many ideas.
+- [@jrburke](https://github.com/jrburke) for [require.js](https://requirejs.org/), which is a similar project and source for many ideas.
+- [@defunctzombie](https://github.com/defunctzombie) for the [browser-field spec](https://github.com/defunctzombie/package-browser-field-spec), which makes modules available for node.js, browserify and webpack.
+- Every early webpack user, which contributed to webpack by writing issues or PRs. You influenced the direction...
+- [@shama](https://github.com/shama), [@jhnns](https://github.com/jhnns) and [@sokra](https://github.com/sokra) for maintaining this project
+- Everyone who has written a loader for webpack. You are the ecosystem...
+- Everyone I forgot to mention here, but also influenced webpack.
+
+[npm]: https://img.shields.io/npm/v/webpack.svg
+[npm-url]: https://npmjs.com/package/webpack
+[node]: https://img.shields.io/node/v/webpack.svg
+[node-url]: https://nodejs.org
+[deps]: https://img.shields.io/david/webpack/webpack.svg
+[deps-url]: https://david-dm.org/webpack/webpack
+[prs]: https://img.shields.io/badge/PRs-welcome-brightgreen.svg
+[prs-url]: https://webpack.js.org/contribute/
+[builds2]: https://dev.azure.com/webpack/webpack/_apis/build/status/webpack.webpack
+[builds2-url]: https://dev.azure.com/webpack/webpack/_build/latest?definitionId=3
+[licenses-url]: https://app.fossa.io/projects/git%2Bhttps%3A%2F%2Fgithub.com%2Fwebpack%2Fwebpack?ref=badge_shield
+[licenses]: https://app.fossa.io/api/projects/git%2Bhttps%3A%2F%2Fgithub.com%2Fwebpack%2Fwebpack.svg?type=shield
+[cover]: https://img.shields.io/coveralls/webpack/webpack.svg
+[cover-url]: https://coveralls.io/r/webpack/webpack/
diff --git a/node_modules/mathjs/examples/node_modules/webpack/SECURITY.md b/node_modules/mathjs/examples/node_modules/webpack/SECURITY.md
new file mode 100644
index 0000000..0551ac7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/SECURITY.md
@@ -0,0 +1,9 @@
+# Reporting Security Issues
+
+If you discover a security issue in webpack, please report it by sending an
+email to [webpack@opencollective.com](mailto:webpack@opencollective.com).
+
+This will allow us to assess the risk, and make a fix available before we add a
+bug report to the GitHub repository.
+
+Thanks for helping make webpack safe for everyone.
diff --git a/node_modules/mathjs/examples/node_modules/webpack/bin/webpack.js b/node_modules/mathjs/examples/node_modules/webpack/bin/webpack.js
new file mode 100644
index 0000000..fead38b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/bin/webpack.js
@@ -0,0 +1,163 @@
+#!/usr/bin/env node
+
+/**
+ * @param {string} command process to run
+ * @param {string[]} args command line arguments
+ * @returns {Promise<void>} promise
+ */
+const runCommand = (command, args) => {
+	const cp = require("child_process");
+	return new Promise((resolve, reject) => {
+		const executedCommand = cp.spawn(command, args, {
+			stdio: "inherit",
+			shell: true
+		});
+
+		executedCommand.on("error", error => {
+			reject(error);
+		});
+
+		executedCommand.on("exit", code => {
+			if (code === 0) {
+				resolve();
+			} else {
+				reject();
+			}
+		});
+	});
+};
+
+/**
+ * @param {string} packageName name of the package
+ * @returns {boolean} is the package installed?
+ */
+const isInstalled = packageName => {
+	if (process.versions.pnp) {
+		return true;
+	}
+
+	const path = require("path");
+	const fs = require("graceful-fs");
+
+	let dir = __dirname;
+
+	do {
+		try {
+			if (
+				fs.statSync(path.join(dir, "node_modules", packageName)).isDirectory()
+			) {
+				return true;
+			}
+		} catch (_error) {
+			// Nothing
+		}
+	} while (dir !== (dir = path.dirname(dir)));
+
+	return false;
+};
+
+/**
+ * @param {CliOption} cli options
+ * @returns {void}
+ */
+const runCli = cli => {
+	const path = require("path");
+	const pkgPath = require.resolve(`${cli.package}/package.json`);
+	// eslint-disable-next-line node/no-missing-require
+	const pkg = require(pkgPath);
+	// eslint-disable-next-line node/no-missing-require
+	require(path.resolve(path.dirname(pkgPath), pkg.bin[cli.binName]));
+};
+
+/**
+ * @typedef {Object} CliOption
+ * @property {string} name display name
+ * @property {string} package npm package name
+ * @property {string} binName name of the executable file
+ * @property {boolean} installed currently installed?
+ * @property {string} url homepage
+ */
+
+/** @type {CliOption} */
+const cli = {
+	name: "webpack-cli",
+	package: "webpack-cli",
+	binName: "webpack-cli",
+	installed: isInstalled("webpack-cli"),
+	url: "https://github.com/webpack/webpack-cli"
+};
+
+if (!cli.installed) {
+	const path = require("path");
+	const fs = require("graceful-fs");
+	const readLine = require("readline");
+
+	const notify =
+		"CLI for webpack must be installed.\n" + `  ${cli.name} (${cli.url})\n`;
+
+	console.error(notify);
+
+	let packageManager;
+
+	if (fs.existsSync(path.resolve(process.cwd(), "yarn.lock"))) {
+		packageManager = "yarn";
+	} else if (fs.existsSync(path.resolve(process.cwd(), "pnpm-lock.yaml"))) {
+		packageManager = "pnpm";
+	} else {
+		packageManager = "npm";
+	}
+
+	const installOptions = [packageManager === "yarn" ? "add" : "install", "-D"];
+
+	console.error(
+		`We will use "${packageManager}" to install the CLI via "${packageManager} ${installOptions.join(
+			" "
+		)} ${cli.package}".`
+	);
+
+	const question = `Do you want to install 'webpack-cli' (yes/no): `;
+
+	const questionInterface = readLine.createInterface({
+		input: process.stdin,
+		output: process.stderr
+	});
+
+	// In certain scenarios (e.g. when STDIN is not in terminal mode), the callback function will not be
+	// executed. Setting the exit code here to ensure the script exits correctly in those cases. The callback
+	// function is responsible for clearing the exit code if the user wishes to install webpack-cli.
+	process.exitCode = 1;
+	questionInterface.question(question, answer => {
+		questionInterface.close();
+
+		const normalizedAnswer = answer.toLowerCase().startsWith("y");
+
+		if (!normalizedAnswer) {
+			console.error(
+				"You need to install 'webpack-cli' to use webpack via CLI.\n" +
+					"You can also install the CLI manually."
+			);
+
+			return;
+		}
+		process.exitCode = 0;
+
+		console.log(
+			`Installing '${
+				cli.package
+			}' (running '${packageManager} ${installOptions.join(" ")} ${
+				cli.package
+			}')...`
+		);
+
+		runCommand(packageManager, installOptions.concat(cli.package))
+			.then(() => {
+				runCli(cli);
+			})
+			.catch(error => {
+				console.error(error);
+				process.exitCode = 1;
+			});
+	});
+} else {
+	runCli(cli);
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/dev-server.js b/node_modules/mathjs/examples/node_modules/webpack/hot/dev-server.js
new file mode 100644
index 0000000..a93ab37
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/dev-server.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+/* globals __webpack_hash__ */
+if (module.hot) {
+	var lastHash;
+	var upToDate = function upToDate() {
+		return lastHash.indexOf(__webpack_hash__) >= 0;
+	};
+	var log = require("./log");
+	var check = function check() {
+		module.hot
+			.check(true)
+			.then(function (updatedModules) {
+				if (!updatedModules) {
+					log("warning", "[HMR] Cannot find update. Need to do a full reload!");
+					log(
+						"warning",
+						"[HMR] (Probably because of restarting the webpack-dev-server)"
+					);
+					window.location.reload();
+					return;
+				}
+
+				if (!upToDate()) {
+					check();
+				}
+
+				require("./log-apply-result")(updatedModules, updatedModules);
+
+				if (upToDate()) {
+					log("info", "[HMR] App is up to date.");
+				}
+			})
+			.catch(function (err) {
+				var status = module.hot.status();
+				if (["abort", "fail"].indexOf(status) >= 0) {
+					log(
+						"warning",
+						"[HMR] Cannot apply update. Need to do a full reload!"
+					);
+					log("warning", "[HMR] " + log.formatError(err));
+					window.location.reload();
+				} else {
+					log("warning", "[HMR] Update failed: " + log.formatError(err));
+				}
+			});
+	};
+	var hotEmitter = require("./emitter");
+	hotEmitter.on("webpackHotUpdate", function (currentHash) {
+		lastHash = currentHash;
+		if (!upToDate() && module.hot.status() === "idle") {
+			log("info", "[HMR] Checking for updates on the server...");
+			check();
+		}
+	});
+	log("info", "[HMR] Waiting for update signal from WDS...");
+} else {
+	throw new Error("[HMR] Hot Module Replacement is disabled.");
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/emitter.js b/node_modules/mathjs/examples/node_modules/webpack/hot/emitter.js
new file mode 100644
index 0000000..05e0fbe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/emitter.js
@@ -0,0 +1,2 @@
+var EventEmitter = require("events");
+module.exports = new EventEmitter();
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/lazy-compilation-node.js b/node_modules/mathjs/examples/node_modules/webpack/hot/lazy-compilation-node.js
new file mode 100644
index 0000000..5dd417b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/lazy-compilation-node.js
@@ -0,0 +1,40 @@
+/* global __resourceQuery */
+
+"use strict";
+
+var urlBase = decodeURIComponent(__resourceQuery.slice(1));
+exports.keepAlive = function (options) {
+	var data = options.data;
+	var onError = options.onError;
+	var active = options.active;
+	var module = options.module;
+	var response;
+	var request = (
+		urlBase.startsWith("https") ? require("https") : require("http")
+	).request(
+		urlBase + data,
+		{
+			agent: false,
+			headers: { accept: "text/event-stream" }
+		},
+		function (res) {
+			response = res;
+			response.on("error", errorHandler);
+			if (!active && !module.hot) {
+				console.log(
+					"Hot Module Replacement is not enabled. Waiting for process restart..."
+				);
+			}
+		}
+	);
+	function errorHandler(err) {
+		err.message =
+			"Problem communicating active modules to the server: " + err.message;
+		onError(err);
+	}
+	request.on("error", errorHandler);
+	request.end();
+	return function () {
+		response.destroy();
+	};
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/lazy-compilation-web.js b/node_modules/mathjs/examples/node_modules/webpack/hot/lazy-compilation-web.js
new file mode 100644
index 0000000..62d955c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/lazy-compilation-web.js
@@ -0,0 +1,74 @@
+/* global __resourceQuery */
+
+"use strict";
+
+if (typeof EventSource !== "function") {
+	throw new Error(
+		"Environment doesn't support lazy compilation (requires EventSource)"
+	);
+}
+
+var urlBase = decodeURIComponent(__resourceQuery.slice(1));
+var activeEventSource;
+var activeKeys = new Map();
+var errorHandlers = new Set();
+
+var updateEventSource = function updateEventSource() {
+	if (activeEventSource) activeEventSource.close();
+	if (activeKeys.size) {
+		activeEventSource = new EventSource(
+			urlBase + Array.from(activeKeys.keys()).join("@")
+		);
+		activeEventSource.onerror = function (event) {
+			errorHandlers.forEach(function (onError) {
+				onError(
+					new Error(
+						"Problem communicating active modules to the server: " +
+							event.message +
+							" " +
+							event.filename +
+							":" +
+							event.lineno +
+							":" +
+							event.colno +
+							" " +
+							event.error
+					)
+				);
+			});
+		};
+	} else {
+		activeEventSource = undefined;
+	}
+};
+
+exports.keepAlive = function (options) {
+	var data = options.data;
+	var onError = options.onError;
+	var active = options.active;
+	var module = options.module;
+	errorHandlers.add(onError);
+	var value = activeKeys.get(data) || 0;
+	activeKeys.set(data, value + 1);
+	if (value === 0) {
+		updateEventSource();
+	}
+	if (!active && !module.hot) {
+		console.log(
+			"Hot Module Replacement is not enabled. Waiting for process restart..."
+		);
+	}
+
+	return function () {
+		errorHandlers.delete(onError);
+		setTimeout(function () {
+			var value = activeKeys.get(data);
+			if (value === 1) {
+				activeKeys.delete(data);
+				updateEventSource();
+			} else {
+				activeKeys.set(data, value - 1);
+			}
+		}, 1000);
+	};
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/log-apply-result.js b/node_modules/mathjs/examples/node_modules/webpack/hot/log-apply-result.js
new file mode 100644
index 0000000..d4452f9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/log-apply-result.js
@@ -0,0 +1,44 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+module.exports = function (updatedModules, renewedModules) {
+	var unacceptedModules = updatedModules.filter(function (moduleId) {
+		return renewedModules && renewedModules.indexOf(moduleId) < 0;
+	});
+	var log = require("./log");
+
+	if (unacceptedModules.length > 0) {
+		log(
+			"warning",
+			"[HMR] The following modules couldn't be hot updated: (They would need a full reload!)"
+		);
+		unacceptedModules.forEach(function (moduleId) {
+			log("warning", "[HMR]  - " + moduleId);
+		});
+	}
+
+	if (!renewedModules || renewedModules.length === 0) {
+		log("info", "[HMR] Nothing hot updated.");
+	} else {
+		log("info", "[HMR] Updated modules:");
+		renewedModules.forEach(function (moduleId) {
+			if (typeof moduleId === "string" && moduleId.indexOf("!") !== -1) {
+				var parts = moduleId.split("!");
+				log.groupCollapsed("info", "[HMR]  - " + parts.pop());
+				log("info", "[HMR]  - " + moduleId);
+				log.groupEnd("info");
+			} else {
+				log("info", "[HMR]  - " + moduleId);
+			}
+		});
+		var numberIds = renewedModules.every(function (moduleId) {
+			return typeof moduleId === "number";
+		});
+		if (numberIds)
+			log(
+				"info",
+				'[HMR] Consider using the optimization.moduleIds: "named" for module names.'
+			);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/log.js b/node_modules/mathjs/examples/node_modules/webpack/hot/log.js
new file mode 100644
index 0000000..483ab40
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/log.js
@@ -0,0 +1,59 @@
+var logLevel = "info";
+
+function dummy() {}
+
+function shouldLog(level) {
+	var shouldLog =
+		(logLevel === "info" && level === "info") ||
+		(["info", "warning"].indexOf(logLevel) >= 0 && level === "warning") ||
+		(["info", "warning", "error"].indexOf(logLevel) >= 0 && level === "error");
+	return shouldLog;
+}
+
+function logGroup(logFn) {
+	return function (level, msg) {
+		if (shouldLog(level)) {
+			logFn(msg);
+		}
+	};
+}
+
+module.exports = function (level, msg) {
+	if (shouldLog(level)) {
+		if (level === "info") {
+			console.log(msg);
+		} else if (level === "warning") {
+			console.warn(msg);
+		} else if (level === "error") {
+			console.error(msg);
+		}
+	}
+};
+
+/* eslint-disable node/no-unsupported-features/node-builtins */
+var group = console.group || dummy;
+var groupCollapsed = console.groupCollapsed || dummy;
+var groupEnd = console.groupEnd || dummy;
+/* eslint-enable node/no-unsupported-features/node-builtins */
+
+module.exports.group = logGroup(group);
+
+module.exports.groupCollapsed = logGroup(groupCollapsed);
+
+module.exports.groupEnd = logGroup(groupEnd);
+
+module.exports.setLogLevel = function (level) {
+	logLevel = level;
+};
+
+module.exports.formatError = function (err) {
+	var message = err.message;
+	var stack = err.stack;
+	if (!stack) {
+		return message;
+	} else if (stack.indexOf(message) < 0) {
+		return message + "\n" + stack;
+	} else {
+		return stack;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/only-dev-server.js b/node_modules/mathjs/examples/node_modules/webpack/hot/only-dev-server.js
new file mode 100644
index 0000000..7312beb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/only-dev-server.js
@@ -0,0 +1,102 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+/*globals __webpack_hash__ */
+if (module.hot) {
+	var lastHash;
+	var upToDate = function upToDate() {
+		return lastHash.indexOf(__webpack_hash__) >= 0;
+	};
+	var log = require("./log");
+	var check = function check() {
+		module.hot
+			.check()
+			.then(function (updatedModules) {
+				if (!updatedModules) {
+					log("warning", "[HMR] Cannot find update. Need to do a full reload!");
+					log(
+						"warning",
+						"[HMR] (Probably because of restarting the webpack-dev-server)"
+					);
+					return;
+				}
+
+				return module.hot
+					.apply({
+						ignoreUnaccepted: true,
+						ignoreDeclined: true,
+						ignoreErrored: true,
+						onUnaccepted: function (data) {
+							log(
+								"warning",
+								"Ignored an update to unaccepted module " +
+									data.chain.join(" -> ")
+							);
+						},
+						onDeclined: function (data) {
+							log(
+								"warning",
+								"Ignored an update to declined module " +
+									data.chain.join(" -> ")
+							);
+						},
+						onErrored: function (data) {
+							log("error", data.error);
+							log(
+								"warning",
+								"Ignored an error while updating module " +
+									data.moduleId +
+									" (" +
+									data.type +
+									")"
+							);
+						}
+					})
+					.then(function (renewedModules) {
+						if (!upToDate()) {
+							check();
+						}
+
+						require("./log-apply-result")(updatedModules, renewedModules);
+
+						if (upToDate()) {
+							log("info", "[HMR] App is up to date.");
+						}
+					});
+			})
+			.catch(function (err) {
+				var status = module.hot.status();
+				if (["abort", "fail"].indexOf(status) >= 0) {
+					log(
+						"warning",
+						"[HMR] Cannot check for update. Need to do a full reload!"
+					);
+					log("warning", "[HMR] " + log.formatError(err));
+				} else {
+					log("warning", "[HMR] Update check failed: " + log.formatError(err));
+				}
+			});
+	};
+	var hotEmitter = require("./emitter");
+	hotEmitter.on("webpackHotUpdate", function (currentHash) {
+		lastHash = currentHash;
+		if (!upToDate()) {
+			var status = module.hot.status();
+			if (status === "idle") {
+				log("info", "[HMR] Checking for updates on the server...");
+				check();
+			} else if (["abort", "fail"].indexOf(status) >= 0) {
+				log(
+					"warning",
+					"[HMR] Cannot apply update as a previous update " +
+						status +
+						"ed. Need to do a full reload!"
+				);
+			}
+		}
+	});
+	log("info", "[HMR] Waiting for update signal from WDS...");
+} else {
+	throw new Error("[HMR] Hot Module Replacement is disabled.");
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/poll.js b/node_modules/mathjs/examples/node_modules/webpack/hot/poll.js
new file mode 100644
index 0000000..dab215a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/poll.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+/*globals __resourceQuery */
+if (module.hot) {
+	var hotPollInterval = +__resourceQuery.substr(1) || 10 * 60 * 1000;
+	var log = require("./log");
+
+	var checkForUpdate = function checkForUpdate(fromUpdate) {
+		if (module.hot.status() === "idle") {
+			module.hot
+				.check(true)
+				.then(function (updatedModules) {
+					if (!updatedModules) {
+						if (fromUpdate) log("info", "[HMR] Update applied.");
+						return;
+					}
+					require("./log-apply-result")(updatedModules, updatedModules);
+					checkForUpdate(true);
+				})
+				.catch(function (err) {
+					var status = module.hot.status();
+					if (["abort", "fail"].indexOf(status) >= 0) {
+						log("warning", "[HMR] Cannot apply update.");
+						log("warning", "[HMR] " + log.formatError(err));
+						log("warning", "[HMR] You need to restart the application!");
+					} else {
+						log("warning", "[HMR] Update failed: " + log.formatError(err));
+					}
+				});
+		}
+	};
+	setInterval(checkForUpdate, hotPollInterval);
+} else {
+	throw new Error("[HMR] Hot Module Replacement is disabled.");
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/hot/signal.js b/node_modules/mathjs/examples/node_modules/webpack/hot/signal.js
new file mode 100644
index 0000000..ef94952
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/hot/signal.js
@@ -0,0 +1,62 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+/*globals __resourceQuery */
+if (module.hot) {
+	var log = require("./log");
+	var checkForUpdate = function checkForUpdate(fromUpdate) {
+		module.hot
+			.check()
+			.then(function (updatedModules) {
+				if (!updatedModules) {
+					if (fromUpdate) log("info", "[HMR] Update applied.");
+					else log("warning", "[HMR] Cannot find update.");
+					return;
+				}
+
+				return module.hot
+					.apply({
+						ignoreUnaccepted: true,
+						onUnaccepted: function (data) {
+							log(
+								"warning",
+								"Ignored an update to unaccepted module " +
+									data.chain.join(" -> ")
+							);
+						}
+					})
+					.then(function (renewedModules) {
+						require("./log-apply-result")(updatedModules, renewedModules);
+
+						checkForUpdate(true);
+						return null;
+					});
+			})
+			.catch(function (err) {
+				var status = module.hot.status();
+				if (["abort", "fail"].indexOf(status) >= 0) {
+					log("warning", "[HMR] Cannot apply update.");
+					log("warning", "[HMR] " + log.formatError(err));
+					log("warning", "[HMR] You need to restart the application!");
+				} else {
+					log("warning", "[HMR] Update failed: " + (err.stack || err.message));
+				}
+			});
+	};
+
+	process.on(__resourceQuery.substr(1) || "SIGUSR2", function () {
+		if (module.hot.status() !== "idle") {
+			log(
+				"warning",
+				"[HMR] Got signal but currently in " + module.hot.status() + " state."
+			);
+			log("warning", "[HMR] Need to be in idle state to start hot update.");
+			return;
+		}
+
+		checkForUpdate();
+	});
+} else {
+	throw new Error("[HMR] Hot Module Replacement is disabled.");
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/APIPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/APIPlugin.js
new file mode 100644
index 0000000..ffc2105
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/APIPlugin.js
@@ -0,0 +1,253 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("./RuntimeGlobals");
+const WebpackError = require("./WebpackError");
+const ConstDependency = require("./dependencies/ConstDependency");
+const BasicEvaluatedExpression = require("./javascript/BasicEvaluatedExpression");
+const {
+	toConstantDependency,
+	evaluateToString
+} = require("./javascript/JavascriptParserHelpers");
+const ChunkNameRuntimeModule = require("./runtime/ChunkNameRuntimeModule");
+const GetFullHashRuntimeModule = require("./runtime/GetFullHashRuntimeModule");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./javascript/JavascriptParser")} JavascriptParser */
+
+/* eslint-disable camelcase */
+const REPLACEMENTS = {
+	__webpack_require__: {
+		expr: RuntimeGlobals.require,
+		req: [RuntimeGlobals.require],
+		type: "function",
+		assign: false
+	},
+	__webpack_public_path__: {
+		expr: RuntimeGlobals.publicPath,
+		req: [RuntimeGlobals.publicPath],
+		type: "string",
+		assign: true
+	},
+	__webpack_base_uri__: {
+		expr: RuntimeGlobals.baseURI,
+		req: [RuntimeGlobals.baseURI],
+		type: "string",
+		assign: true
+	},
+	__webpack_modules__: {
+		expr: RuntimeGlobals.moduleFactories,
+		req: [RuntimeGlobals.moduleFactories],
+		type: "object",
+		assign: false
+	},
+	__webpack_chunk_load__: {
+		expr: RuntimeGlobals.ensureChunk,
+		req: [RuntimeGlobals.ensureChunk],
+		type: "function",
+		assign: true
+	},
+	__non_webpack_require__: {
+		expr: "require",
+		req: null,
+		type: undefined, // type is not known, depends on environment
+		assign: true
+	},
+	__webpack_nonce__: {
+		expr: RuntimeGlobals.scriptNonce,
+		req: [RuntimeGlobals.scriptNonce],
+		type: "string",
+		assign: true
+	},
+	__webpack_hash__: {
+		expr: `${RuntimeGlobals.getFullHash}()`,
+		req: [RuntimeGlobals.getFullHash],
+		type: "string",
+		assign: false
+	},
+	__webpack_chunkname__: {
+		expr: RuntimeGlobals.chunkName,
+		req: [RuntimeGlobals.chunkName],
+		type: "string",
+		assign: false
+	},
+	__webpack_get_script_filename__: {
+		expr: RuntimeGlobals.getChunkScriptFilename,
+		req: [RuntimeGlobals.getChunkScriptFilename],
+		type: "function",
+		assign: true
+	},
+	__webpack_runtime_id__: {
+		expr: RuntimeGlobals.runtimeId,
+		req: [RuntimeGlobals.runtimeId],
+		assign: false
+	},
+	"require.onError": {
+		expr: RuntimeGlobals.uncaughtErrorHandler,
+		req: [RuntimeGlobals.uncaughtErrorHandler],
+		type: undefined, // type is not known, could be function or undefined
+		assign: true // is never a pattern
+	},
+	__system_context__: {
+		expr: RuntimeGlobals.systemContext,
+		req: [RuntimeGlobals.systemContext],
+		type: "object",
+		assign: false
+	},
+	__webpack_share_scopes__: {
+		expr: RuntimeGlobals.shareScopeMap,
+		req: [RuntimeGlobals.shareScopeMap],
+		type: "object",
+		assign: false
+	},
+	__webpack_init_sharing__: {
+		expr: RuntimeGlobals.initializeSharing,
+		req: [RuntimeGlobals.initializeSharing],
+		type: "function",
+		assign: true
+	}
+};
+/* eslint-enable camelcase */
+
+class APIPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"APIPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					ConstDependency,
+					new ConstDependency.Template()
+				);
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.chunkName)
+					.tap("APIPlugin", chunk => {
+						compilation.addRuntimeModule(
+							chunk,
+							new ChunkNameRuntimeModule(chunk.name)
+						);
+						return true;
+					});
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.getFullHash)
+					.tap("APIPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(chunk, new GetFullHashRuntimeModule());
+						return true;
+					});
+
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 */
+				const handler = parser => {
+					Object.keys(REPLACEMENTS).forEach(key => {
+						const info = REPLACEMENTS[key];
+						parser.hooks.expression
+							.for(key)
+							.tap(
+								"APIPlugin",
+								toConstantDependency(parser, info.expr, info.req)
+							);
+						if (info.assign === false) {
+							parser.hooks.assign.for(key).tap("APIPlugin", expr => {
+								const err = new WebpackError(`${key} must not be assigned`);
+								err.loc = expr.loc;
+								throw err;
+							});
+						}
+						if (info.type) {
+							parser.hooks.evaluateTypeof
+								.for(key)
+								.tap("APIPlugin", evaluateToString(info.type));
+						}
+					});
+
+					parser.hooks.expression
+						.for("__webpack_layer__")
+						.tap("APIPlugin", expr => {
+							const dep = new ConstDependency(
+								JSON.stringify(parser.state.module.layer),
+								expr.range
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+					parser.hooks.evaluateIdentifier
+						.for("__webpack_layer__")
+						.tap("APIPlugin", expr =>
+							(parser.state.module.layer === null
+								? new BasicEvaluatedExpression().setNull()
+								: new BasicEvaluatedExpression().setString(
+										parser.state.module.layer
+								  )
+							).setRange(expr.range)
+						);
+					parser.hooks.evaluateTypeof
+						.for("__webpack_layer__")
+						.tap("APIPlugin", expr =>
+							new BasicEvaluatedExpression()
+								.setString(
+									parser.state.module.layer === null ? "object" : "string"
+								)
+								.setRange(expr.range)
+						);
+
+					parser.hooks.expression
+						.for("__webpack_module__.id")
+						.tap("APIPlugin", expr => {
+							parser.state.module.buildInfo.moduleConcatenationBailout =
+								"__webpack_module__.id";
+							const dep = new ConstDependency(
+								parser.state.module.moduleArgument + ".id",
+								expr.range,
+								[RuntimeGlobals.moduleId]
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+
+					parser.hooks.expression
+						.for("__webpack_module__")
+						.tap("APIPlugin", expr => {
+							parser.state.module.buildInfo.moduleConcatenationBailout =
+								"__webpack_module__";
+							const dep = new ConstDependency(
+								parser.state.module.moduleArgument,
+								expr.range,
+								[RuntimeGlobals.module]
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+					parser.hooks.evaluateTypeof
+						.for("__webpack_module__")
+						.tap("APIPlugin", evaluateToString("object"));
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("APIPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("APIPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("APIPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = APIPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/AbstractMethodError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/AbstractMethodError.js
new file mode 100644
index 0000000..bbf2d08
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/AbstractMethodError.js
@@ -0,0 +1,49 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const CURRENT_METHOD_REGEXP = /at ([a-zA-Z0-9_.]*)/;
+
+/**
+ * @param {string=} method method name
+ * @returns {string} message
+ */
+function createMessage(method) {
+	return `Abstract method${method ? " " + method : ""}. Must be overridden.`;
+}
+
+/**
+ * @constructor
+ */
+function Message() {
+	/** @type {string} */
+	this.stack = undefined;
+	Error.captureStackTrace(this);
+	/** @type {RegExpMatchArray} */
+	const match = this.stack.split("\n")[3].match(CURRENT_METHOD_REGEXP);
+
+	this.message = match && match[1] ? createMessage(match[1]) : createMessage();
+}
+
+/**
+ * Error for abstract method
+ * @example
+ * class FooClass {
+ *     abstractMethod() {
+ *         throw new AbstractMethodError(); // error message: Abstract method FooClass.abstractMethod. Must be overridden.
+ *     }
+ * }
+ *
+ */
+class AbstractMethodError extends WebpackError {
+	constructor() {
+		super(new Message().message);
+		this.name = "AbstractMethodError";
+	}
+}
+
+module.exports = AbstractMethodError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/AsyncDependenciesBlock.js b/node_modules/mathjs/examples/node_modules/webpack/lib/AsyncDependenciesBlock.js
new file mode 100644
index 0000000..5fddec3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/AsyncDependenciesBlock.js
@@ -0,0 +1,106 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DependenciesBlock = require("./DependenciesBlock");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./ChunkGroup").ChunkGroupOptions} ChunkGroupOptions */
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./Entrypoint").EntryOptions} EntryOptions */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./util/Hash")} Hash */
+
+class AsyncDependenciesBlock extends DependenciesBlock {
+	/**
+	 * @param {ChunkGroupOptions & { entryOptions?: EntryOptions }} groupOptions options for the group
+	 * @param {DependencyLocation=} loc the line of code
+	 * @param {string=} request the request
+	 */
+	constructor(groupOptions, loc, request) {
+		super();
+		if (typeof groupOptions === "string") {
+			groupOptions = { name: groupOptions };
+		} else if (!groupOptions) {
+			groupOptions = { name: undefined };
+		}
+		this.groupOptions = groupOptions;
+		this.loc = loc;
+		this.request = request;
+		this._stringifiedGroupOptions = undefined;
+	}
+
+	/**
+	 * @returns {string} The name of the chunk
+	 */
+	get chunkName() {
+		return this.groupOptions.name;
+	}
+
+	/**
+	 * @param {string} value The new chunk name
+	 * @returns {void}
+	 */
+	set chunkName(value) {
+		if (this.groupOptions.name !== value) {
+			this.groupOptions.name = value;
+			this._stringifiedGroupOptions = undefined;
+		}
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		const { chunkGraph } = context;
+		if (this._stringifiedGroupOptions === undefined) {
+			this._stringifiedGroupOptions = JSON.stringify(this.groupOptions);
+		}
+		const chunkGroup = chunkGraph.getBlockChunkGroup(this);
+		hash.update(
+			`${this._stringifiedGroupOptions}${chunkGroup ? chunkGroup.id : ""}`
+		);
+		super.updateHash(hash, context);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.groupOptions);
+		write(this.loc);
+		write(this.request);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.groupOptions = read();
+		this.loc = read();
+		this.request = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(AsyncDependenciesBlock, "webpack/lib/AsyncDependenciesBlock");
+
+Object.defineProperty(AsyncDependenciesBlock.prototype, "module", {
+	get() {
+		throw new Error(
+			"module property was removed from AsyncDependenciesBlock (it's not needed)"
+		);
+	},
+	set() {
+		throw new Error(
+			"module property was removed from AsyncDependenciesBlock (it's not needed)"
+		);
+	}
+});
+
+module.exports = AsyncDependenciesBlock;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/AsyncDependencyToInitialChunkError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/AsyncDependencyToInitialChunkError.js
new file mode 100644
index 0000000..75888f8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/AsyncDependencyToInitialChunkError.js
@@ -0,0 +1,31 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Module")} Module */
+
+class AsyncDependencyToInitialChunkError extends WebpackError {
+	/**
+	 * Creates an instance of AsyncDependencyToInitialChunkError.
+	 * @param {string} chunkName Name of Chunk
+	 * @param {Module} module module tied to dependency
+	 * @param {DependencyLocation} loc location of dependency
+	 */
+	constructor(chunkName, module, loc) {
+		super(
+			`It's not allowed to load an initial chunk on demand. The chunk name "${chunkName}" is already used by an entrypoint.`
+		);
+
+		this.name = "AsyncDependencyToInitialChunkError";
+		this.module = module;
+		this.loc = loc;
+	}
+}
+
+module.exports = AsyncDependencyToInitialChunkError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/AutomaticPrefetchPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/AutomaticPrefetchPlugin.js
new file mode 100644
index 0000000..5152574
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/AutomaticPrefetchPlugin.js
@@ -0,0 +1,65 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const NormalModule = require("./NormalModule");
+const PrefetchDependency = require("./dependencies/PrefetchDependency");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class AutomaticPrefetchPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"AutomaticPrefetchPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					PrefetchDependency,
+					normalModuleFactory
+				);
+			}
+		);
+		let lastModules = null;
+		compiler.hooks.afterCompile.tap("AutomaticPrefetchPlugin", compilation => {
+			lastModules = [];
+
+			for (const m of compilation.modules) {
+				if (m instanceof NormalModule) {
+					lastModules.push({
+						context: m.context,
+						request: m.request
+					});
+				}
+			}
+		});
+		compiler.hooks.make.tapAsync(
+			"AutomaticPrefetchPlugin",
+			(compilation, callback) => {
+				if (!lastModules) return callback();
+				asyncLib.forEach(
+					lastModules,
+					(m, callback) => {
+						compilation.addModuleChain(
+							m.context || compiler.context,
+							new PrefetchDependency(`!!${m.request}`),
+							callback
+						);
+					},
+					err => {
+						lastModules = null;
+						callback(err);
+					}
+				);
+			}
+		);
+	}
+}
+module.exports = AutomaticPrefetchPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/BannerPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/BannerPlugin.js
new file mode 100644
index 0000000..3c10558
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/BannerPlugin.js
@@ -0,0 +1,123 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const Compilation = require("./Compilation");
+const ModuleFilenameHelpers = require("./ModuleFilenameHelpers");
+const Template = require("./Template");
+const createSchemaValidation = require("./util/create-schema-validation");
+
+/** @typedef {import("../declarations/plugins/BannerPlugin").BannerPluginArgument} BannerPluginArgument */
+/** @typedef {import("../declarations/plugins/BannerPlugin").BannerPluginOptions} BannerPluginOptions */
+/** @typedef {import("./Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/BannerPlugin.check.js"),
+	() => require("../schemas/plugins/BannerPlugin.json"),
+	{
+		name: "Banner Plugin",
+		baseDataPath: "options"
+	}
+);
+
+const wrapComment = str => {
+	if (!str.includes("\n")) {
+		return Template.toComment(str);
+	}
+	return `/*!\n * ${str
+		.replace(/\*\//g, "* /")
+		.split("\n")
+		.join("\n * ")
+		.replace(/\s+\n/g, "\n")
+		.trimRight()}\n */`;
+};
+
+class BannerPlugin {
+	/**
+	 * @param {BannerPluginArgument} options options object
+	 */
+	constructor(options) {
+		if (typeof options === "string" || typeof options === "function") {
+			options = {
+				banner: options
+			};
+		}
+
+		validate(options);
+
+		this.options = options;
+
+		const bannerOption = options.banner;
+		if (typeof bannerOption === "function") {
+			const getBanner = bannerOption;
+			this.banner = this.options.raw
+				? getBanner
+				: data => wrapComment(getBanner(data));
+		} else {
+			const banner = this.options.raw
+				? bannerOption
+				: wrapComment(bannerOption);
+			this.banner = () => banner;
+		}
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		const banner = this.banner;
+		const matchObject = ModuleFilenameHelpers.matchObject.bind(
+			undefined,
+			options
+		);
+		const cache = new WeakMap();
+
+		compiler.hooks.compilation.tap("BannerPlugin", compilation => {
+			compilation.hooks.processAssets.tap(
+				{
+					name: "BannerPlugin",
+					stage: Compilation.PROCESS_ASSETS_STAGE_ADDITIONS
+				},
+				() => {
+					for (const chunk of compilation.chunks) {
+						if (options.entryOnly && !chunk.canBeInitial()) {
+							continue;
+						}
+
+						for (const file of chunk.files) {
+							if (!matchObject(file)) {
+								continue;
+							}
+
+							const data = {
+								chunk,
+								filename: file
+							};
+
+							const comment = compilation.getPath(banner, data);
+
+							compilation.updateAsset(file, old => {
+								let cached = cache.get(old);
+								if (!cached || cached.comment !== comment) {
+									const source = new ConcatSource(comment, "\n", old);
+									cache.set(old, { source, comment });
+									return source;
+								}
+								return cached.source;
+							});
+						}
+					}
+				}
+			);
+		});
+	}
+}
+
+module.exports = BannerPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Cache.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Cache.js
new file mode 100644
index 0000000..e76f8b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Cache.js
@@ -0,0 +1,161 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { AsyncParallelHook, AsyncSeriesBailHook, SyncHook } = require("tapable");
+const {
+	makeWebpackError,
+	makeWebpackErrorCallback
+} = require("./HookWebpackError");
+
+/** @typedef {import("./WebpackError")} WebpackError */
+
+/**
+ * @typedef {Object} Etag
+ * @property {function(): string} toString
+ */
+
+/**
+ * @template T
+ * @callback CallbackCache
+ * @param {(WebpackError | null)=} err
+ * @param {T=} result
+ * @returns {void}
+ */
+
+/**
+ * @callback GotHandler
+ * @param {any} result
+ * @param {function(Error=): void} callback
+ * @returns {void}
+ */
+
+const needCalls = (times, callback) => {
+	return err => {
+		if (--times === 0) {
+			return callback(err);
+		}
+		if (err && times > 0) {
+			times = 0;
+			return callback(err);
+		}
+	};
+};
+
+class Cache {
+	constructor() {
+		this.hooks = {
+			/** @type {AsyncSeriesBailHook<[string, Etag | null, GotHandler[]], any>} */
+			get: new AsyncSeriesBailHook(["identifier", "etag", "gotHandlers"]),
+			/** @type {AsyncParallelHook<[string, Etag | null, any]>} */
+			store: new AsyncParallelHook(["identifier", "etag", "data"]),
+			/** @type {AsyncParallelHook<[Iterable<string>]>} */
+			storeBuildDependencies: new AsyncParallelHook(["dependencies"]),
+			/** @type {SyncHook<[]>} */
+			beginIdle: new SyncHook([]),
+			/** @type {AsyncParallelHook<[]>} */
+			endIdle: new AsyncParallelHook([]),
+			/** @type {AsyncParallelHook<[]>} */
+			shutdown: new AsyncParallelHook([])
+		};
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @param {CallbackCache<T>} callback signals when the value is retrieved
+	 * @returns {void}
+	 */
+	get(identifier, etag, callback) {
+		const gotHandlers = [];
+		this.hooks.get.callAsync(identifier, etag, gotHandlers, (err, result) => {
+			if (err) {
+				callback(makeWebpackError(err, "Cache.hooks.get"));
+				return;
+			}
+			if (result === null) {
+				result = undefined;
+			}
+			if (gotHandlers.length > 1) {
+				const innerCallback = needCalls(gotHandlers.length, () =>
+					callback(null, result)
+				);
+				for (const gotHandler of gotHandlers) {
+					gotHandler(result, innerCallback);
+				}
+			} else if (gotHandlers.length === 1) {
+				gotHandlers[0](result, () => callback(null, result));
+			} else {
+				callback(null, result);
+			}
+		});
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @param {T} data the value to store
+	 * @param {CallbackCache<void>} callback signals when the value is stored
+	 * @returns {void}
+	 */
+	store(identifier, etag, data, callback) {
+		this.hooks.store.callAsync(
+			identifier,
+			etag,
+			data,
+			makeWebpackErrorCallback(callback, "Cache.hooks.store")
+		);
+	}
+
+	/**
+	 * After this method has succeeded the cache can only be restored when build dependencies are
+	 * @param {Iterable<string>} dependencies list of all build dependencies
+	 * @param {CallbackCache<void>} callback signals when the dependencies are stored
+	 * @returns {void}
+	 */
+	storeBuildDependencies(dependencies, callback) {
+		this.hooks.storeBuildDependencies.callAsync(
+			dependencies,
+			makeWebpackErrorCallback(callback, "Cache.hooks.storeBuildDependencies")
+		);
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	beginIdle() {
+		this.hooks.beginIdle.call();
+	}
+
+	/**
+	 * @param {CallbackCache<void>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	endIdle(callback) {
+		this.hooks.endIdle.callAsync(
+			makeWebpackErrorCallback(callback, "Cache.hooks.endIdle")
+		);
+	}
+
+	/**
+	 * @param {CallbackCache<void>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	shutdown(callback) {
+		this.hooks.shutdown.callAsync(
+			makeWebpackErrorCallback(callback, "Cache.hooks.shutdown")
+		);
+	}
+}
+
+Cache.STAGE_MEMORY = -10;
+Cache.STAGE_DEFAULT = 0;
+Cache.STAGE_DISK = 10;
+Cache.STAGE_NETWORK = 20;
+
+module.exports = Cache;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/CacheFacade.js b/node_modules/mathjs/examples/node_modules/webpack/lib/CacheFacade.js
new file mode 100644
index 0000000..9e1d00e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/CacheFacade.js
@@ -0,0 +1,345 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { forEachBail } = require("enhanced-resolve");
+const asyncLib = require("neo-async");
+const getLazyHashedEtag = require("./cache/getLazyHashedEtag");
+const mergeEtags = require("./cache/mergeEtags");
+
+/** @typedef {import("./Cache")} Cache */
+/** @typedef {import("./Cache").Etag} Etag */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./cache/getLazyHashedEtag").HashableObject} HashableObject */
+/** @typedef {typeof import("./util/Hash")} HashConstructor */
+
+/**
+ * @template T
+ * @callback CallbackCache
+ * @param {(WebpackError | null)=} err
+ * @param {T=} result
+ * @returns {void}
+ */
+
+/**
+ * @template T
+ * @callback CallbackNormalErrorCache
+ * @param {(Error | null)=} err
+ * @param {T=} result
+ * @returns {void}
+ */
+
+class MultiItemCache {
+	/**
+	 * @param {ItemCacheFacade[]} items item caches
+	 */
+	constructor(items) {
+		this._items = items;
+		if (items.length === 1) return /** @type {any} */ (items[0]);
+	}
+
+	/**
+	 * @template T
+	 * @param {CallbackCache<T>} callback signals when the value is retrieved
+	 * @returns {void}
+	 */
+	get(callback) {
+		forEachBail(this._items, (item, callback) => item.get(callback), callback);
+	}
+
+	/**
+	 * @template T
+	 * @returns {Promise<T>} promise with the data
+	 */
+	getPromise() {
+		const next = i => {
+			return this._items[i].getPromise().then(result => {
+				if (result !== undefined) return result;
+				if (++i < this._items.length) return next(i);
+			});
+		};
+		return next(0);
+	}
+
+	/**
+	 * @template T
+	 * @param {T} data the value to store
+	 * @param {CallbackCache<void>} callback signals when the value is stored
+	 * @returns {void}
+	 */
+	store(data, callback) {
+		asyncLib.each(
+			this._items,
+			(item, callback) => item.store(data, callback),
+			callback
+		);
+	}
+
+	/**
+	 * @template T
+	 * @param {T} data the value to store
+	 * @returns {Promise<void>} promise signals when the value is stored
+	 */
+	storePromise(data) {
+		return Promise.all(this._items.map(item => item.storePromise(data))).then(
+			() => {}
+		);
+	}
+}
+
+class ItemCacheFacade {
+	/**
+	 * @param {Cache} cache the root cache
+	 * @param {string} name the child cache item name
+	 * @param {Etag | null} etag the etag
+	 */
+	constructor(cache, name, etag) {
+		this._cache = cache;
+		this._name = name;
+		this._etag = etag;
+	}
+
+	/**
+	 * @template T
+	 * @param {CallbackCache<T>} callback signals when the value is retrieved
+	 * @returns {void}
+	 */
+	get(callback) {
+		this._cache.get(this._name, this._etag, callback);
+	}
+
+	/**
+	 * @template T
+	 * @returns {Promise<T>} promise with the data
+	 */
+	getPromise() {
+		return new Promise((resolve, reject) => {
+			this._cache.get(this._name, this._etag, (err, data) => {
+				if (err) {
+					reject(err);
+				} else {
+					resolve(data);
+				}
+			});
+		});
+	}
+
+	/**
+	 * @template T
+	 * @param {T} data the value to store
+	 * @param {CallbackCache<void>} callback signals when the value is stored
+	 * @returns {void}
+	 */
+	store(data, callback) {
+		this._cache.store(this._name, this._etag, data, callback);
+	}
+
+	/**
+	 * @template T
+	 * @param {T} data the value to store
+	 * @returns {Promise<void>} promise signals when the value is stored
+	 */
+	storePromise(data) {
+		return new Promise((resolve, reject) => {
+			this._cache.store(this._name, this._etag, data, err => {
+				if (err) {
+					reject(err);
+				} else {
+					resolve();
+				}
+			});
+		});
+	}
+
+	/**
+	 * @template T
+	 * @param {function(CallbackNormalErrorCache<T>): void} computer function to compute the value if not cached
+	 * @param {CallbackNormalErrorCache<T>} callback signals when the value is retrieved
+	 * @returns {void}
+	 */
+	provide(computer, callback) {
+		this.get((err, cacheEntry) => {
+			if (err) return callback(err);
+			if (cacheEntry !== undefined) return cacheEntry;
+			computer((err, result) => {
+				if (err) return callback(err);
+				this.store(result, err => {
+					if (err) return callback(err);
+					callback(null, result);
+				});
+			});
+		});
+	}
+
+	/**
+	 * @template T
+	 * @param {function(): Promise<T> | T} computer function to compute the value if not cached
+	 * @returns {Promise<T>} promise with the data
+	 */
+	async providePromise(computer) {
+		const cacheEntry = await this.getPromise();
+		if (cacheEntry !== undefined) return cacheEntry;
+		const result = await computer();
+		await this.storePromise(result);
+		return result;
+	}
+}
+
+class CacheFacade {
+	/**
+	 * @param {Cache} cache the root cache
+	 * @param {string} name the child cache name
+	 * @param {string | HashConstructor} hashFunction the hash function to use
+	 */
+	constructor(cache, name, hashFunction) {
+		this._cache = cache;
+		this._name = name;
+		this._hashFunction = hashFunction;
+	}
+
+	/**
+	 * @param {string} name the child cache name#
+	 * @returns {CacheFacade} child cache
+	 */
+	getChildCache(name) {
+		return new CacheFacade(
+			this._cache,
+			`${this._name}|${name}`,
+			this._hashFunction
+		);
+	}
+
+	/**
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @returns {ItemCacheFacade} item cache
+	 */
+	getItemCache(identifier, etag) {
+		return new ItemCacheFacade(
+			this._cache,
+			`${this._name}|${identifier}`,
+			etag
+		);
+	}
+
+	/**
+	 * @param {HashableObject} obj an hashable object
+	 * @returns {Etag} an etag that is lazy hashed
+	 */
+	getLazyHashedEtag(obj) {
+		return getLazyHashedEtag(obj, this._hashFunction);
+	}
+
+	/**
+	 * @param {Etag} a an etag
+	 * @param {Etag} b another etag
+	 * @returns {Etag} an etag that represents both
+	 */
+	mergeEtags(a, b) {
+		return mergeEtags(a, b);
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @param {CallbackCache<T>} callback signals when the value is retrieved
+	 * @returns {void}
+	 */
+	get(identifier, etag, callback) {
+		this._cache.get(`${this._name}|${identifier}`, etag, callback);
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @returns {Promise<T>} promise with the data
+	 */
+	getPromise(identifier, etag) {
+		return new Promise((resolve, reject) => {
+			this._cache.get(`${this._name}|${identifier}`, etag, (err, data) => {
+				if (err) {
+					reject(err);
+				} else {
+					resolve(data);
+				}
+			});
+		});
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @param {T} data the value to store
+	 * @param {CallbackCache<void>} callback signals when the value is stored
+	 * @returns {void}
+	 */
+	store(identifier, etag, data, callback) {
+		this._cache.store(`${this._name}|${identifier}`, etag, data, callback);
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @param {T} data the value to store
+	 * @returns {Promise<void>} promise signals when the value is stored
+	 */
+	storePromise(identifier, etag, data) {
+		return new Promise((resolve, reject) => {
+			this._cache.store(`${this._name}|${identifier}`, etag, data, err => {
+				if (err) {
+					reject(err);
+				} else {
+					resolve();
+				}
+			});
+		});
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @param {function(CallbackNormalErrorCache<T>): void} computer function to compute the value if not cached
+	 * @param {CallbackNormalErrorCache<T>} callback signals when the value is retrieved
+	 * @returns {void}
+	 */
+	provide(identifier, etag, computer, callback) {
+		this.get(identifier, etag, (err, cacheEntry) => {
+			if (err) return callback(err);
+			if (cacheEntry !== undefined) return cacheEntry;
+			computer((err, result) => {
+				if (err) return callback(err);
+				this.store(identifier, etag, result, err => {
+					if (err) return callback(err);
+					callback(null, result);
+				});
+			});
+		});
+	}
+
+	/**
+	 * @template T
+	 * @param {string} identifier the cache identifier
+	 * @param {Etag | null} etag the etag
+	 * @param {function(): Promise<T> | T} computer function to compute the value if not cached
+	 * @returns {Promise<T>} promise with the data
+	 */
+	async providePromise(identifier, etag, computer) {
+		const cacheEntry = await this.getPromise(identifier, etag);
+		if (cacheEntry !== undefined) return cacheEntry;
+		const result = await computer();
+		await this.storePromise(identifier, etag, result);
+		return result;
+	}
+}
+
+module.exports = CacheFacade;
+module.exports.ItemCacheFacade = ItemCacheFacade;
+module.exports.MultiItemCache = MultiItemCache;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/CaseSensitiveModulesWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/CaseSensitiveModulesWarning.js
new file mode 100644
index 0000000..8ccc682
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/CaseSensitiveModulesWarning.js
@@ -0,0 +1,71 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+
+/**
+ * @param {Module[]} modules the modules to be sorted
+ * @returns {Module[]} sorted version of original modules
+ */
+const sortModules = modules => {
+	return modules.sort((a, b) => {
+		const aIdent = a.identifier();
+		const bIdent = b.identifier();
+		/* istanbul ignore next */
+		if (aIdent < bIdent) return -1;
+		/* istanbul ignore next */
+		if (aIdent > bIdent) return 1;
+		/* istanbul ignore next */
+		return 0;
+	});
+};
+
+/**
+ * @param {Module[]} modules each module from throw
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @returns {string} each message from provided modules
+ */
+const createModulesListMessage = (modules, moduleGraph) => {
+	return modules
+		.map(m => {
+			let message = `* ${m.identifier()}`;
+			const validReasons = Array.from(
+				moduleGraph.getIncomingConnectionsByOriginModule(m).keys()
+			).filter(x => x);
+
+			if (validReasons.length > 0) {
+				message += `\n    Used by ${validReasons.length} module(s), i. e.`;
+				message += `\n    ${validReasons[0].identifier()}`;
+			}
+			return message;
+		})
+		.join("\n");
+};
+
+class CaseSensitiveModulesWarning extends WebpackError {
+	/**
+	 * Creates an instance of CaseSensitiveModulesWarning.
+	 * @param {Iterable<Module>} modules modules that were detected
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 */
+	constructor(modules, moduleGraph) {
+		const sortedModules = sortModules(Array.from(modules));
+		const modulesList = createModulesListMessage(sortedModules, moduleGraph);
+		super(`There are multiple modules with names that only differ in casing.
+This can lead to unexpected behavior when compiling on a filesystem with other case-semantic.
+Use equal casing. Compare these module identifiers:
+${modulesList}`);
+
+		this.name = "CaseSensitiveModulesWarning";
+		this.module = sortedModules[0];
+	}
+}
+
+module.exports = CaseSensitiveModulesWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Chunk.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Chunk.js
new file mode 100644
index 0000000..db598c7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Chunk.js
@@ -0,0 +1,820 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ChunkGraph = require("./ChunkGraph");
+const Entrypoint = require("./Entrypoint");
+const { intersect } = require("./util/SetHelpers");
+const SortableSet = require("./util/SortableSet");
+const StringXor = require("./util/StringXor");
+const {
+	compareModulesByIdentifier,
+	compareChunkGroupsByIndex,
+	compareModulesById
+} = require("./util/comparators");
+const { createArrayToSetDeprecationSet } = require("./util/deprecation");
+const { mergeRuntime } = require("./util/runtime");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./ChunkGraph").ChunkFilterPredicate} ChunkFilterPredicate */
+/** @typedef {import("./ChunkGraph").ChunkSizeOptions} ChunkSizeOptions */
+/** @typedef {import("./ChunkGraph").ModuleFilterPredicate} ModuleFilterPredicate */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("./Compilation").PathData} PathData */
+/** @typedef {import("./Entrypoint").EntryOptions} EntryOptions */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+const ChunkFilesSet = createArrayToSetDeprecationSet("chunk.files");
+
+/**
+ * @typedef {Object} WithId an object who has an id property *
+ * @property {string | number} id the id of the object
+ */
+
+/**
+ * @deprecated
+ * @typedef {Object} ChunkMaps
+ * @property {Record<string|number, string>} hash
+ * @property {Record<string|number, Record<string, string>>} contentHash
+ * @property {Record<string|number, string>} name
+ */
+
+/**
+ * @deprecated
+ * @typedef {Object} ChunkModuleMaps
+ * @property {Record<string|number, (string|number)[]>} id
+ * @property {Record<string|number, string>} hash
+ */
+
+let debugId = 1000;
+
+/**
+ * A Chunk is a unit of encapsulation for Modules.
+ * Chunks are "rendered" into bundles that get emitted when the build completes.
+ */
+class Chunk {
+	/**
+	 * @param {string=} name of chunk being created, is optional (for subclasses)
+	 * @param {boolean} backCompat enable backward-compatibility
+	 */
+	constructor(name, backCompat = true) {
+		/** @type {number | string | null} */
+		this.id = null;
+		/** @type {(number|string)[] | null} */
+		this.ids = null;
+		/** @type {number} */
+		this.debugId = debugId++;
+		/** @type {string} */
+		this.name = name;
+		/** @type {SortableSet<string>} */
+		this.idNameHints = new SortableSet();
+		/** @type {boolean} */
+		this.preventIntegration = false;
+		/** @type {(string | function(PathData, AssetInfo=): string)?} */
+		this.filenameTemplate = undefined;
+		/** @type {(string | function(PathData, AssetInfo=): string)?} */
+		this.cssFilenameTemplate = undefined;
+		/** @private @type {SortableSet<ChunkGroup>} */
+		this._groups = new SortableSet(undefined, compareChunkGroupsByIndex);
+		/** @type {RuntimeSpec} */
+		this.runtime = undefined;
+		/** @type {Set<string>} */
+		this.files = backCompat ? new ChunkFilesSet() : new Set();
+		/** @type {Set<string>} */
+		this.auxiliaryFiles = new Set();
+		/** @type {boolean} */
+		this.rendered = false;
+		/** @type {string=} */
+		this.hash = undefined;
+		/** @type {Record<string, string>} */
+		this.contentHash = Object.create(null);
+		/** @type {string=} */
+		this.renderedHash = undefined;
+		/** @type {string=} */
+		this.chunkReason = undefined;
+		/** @type {boolean} */
+		this.extraAsync = false;
+	}
+
+	// TODO remove in webpack 6
+	// BACKWARD-COMPAT START
+	get entryModule() {
+		const entryModules = Array.from(
+			ChunkGraph.getChunkGraphForChunk(
+				this,
+				"Chunk.entryModule",
+				"DEP_WEBPACK_CHUNK_ENTRY_MODULE"
+			).getChunkEntryModulesIterable(this)
+		);
+		if (entryModules.length === 0) {
+			return undefined;
+		} else if (entryModules.length === 1) {
+			return entryModules[0];
+		} else {
+			throw new Error(
+				"Module.entryModule: Multiple entry modules are not supported by the deprecated API (Use the new ChunkGroup API)"
+			);
+		}
+	}
+
+	/**
+	 * @returns {boolean} true, if the chunk contains an entry module
+	 */
+	hasEntryModule() {
+		return (
+			ChunkGraph.getChunkGraphForChunk(
+				this,
+				"Chunk.hasEntryModule",
+				"DEP_WEBPACK_CHUNK_HAS_ENTRY_MODULE"
+			).getNumberOfEntryModules(this) > 0
+		);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {boolean} true, if the chunk could be added
+	 */
+	addModule(module) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.addModule",
+			"DEP_WEBPACK_CHUNK_ADD_MODULE"
+		);
+		if (chunkGraph.isModuleInChunk(module, this)) return false;
+		chunkGraph.connectChunkAndModule(this, module);
+		return true;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {void}
+	 */
+	removeModule(module) {
+		ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.removeModule",
+			"DEP_WEBPACK_CHUNK_REMOVE_MODULE"
+		).disconnectChunkAndModule(this, module);
+	}
+
+	/**
+	 * @returns {number} the number of module which are contained in this chunk
+	 */
+	getNumberOfModules() {
+		return ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.getNumberOfModules",
+			"DEP_WEBPACK_CHUNK_GET_NUMBER_OF_MODULES"
+		).getNumberOfChunkModules(this);
+	}
+
+	get modulesIterable() {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.modulesIterable",
+			"DEP_WEBPACK_CHUNK_MODULES_ITERABLE"
+		);
+		return chunkGraph.getOrderedChunkModulesIterable(
+			this,
+			compareModulesByIdentifier
+		);
+	}
+
+	/**
+	 * @param {Chunk} otherChunk the chunk to compare with
+	 * @returns {-1|0|1} the comparison result
+	 */
+	compareTo(otherChunk) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.compareTo",
+			"DEP_WEBPACK_CHUNK_COMPARE_TO"
+		);
+		return chunkGraph.compareChunks(this, otherChunk);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {boolean} true, if the chunk contains the module
+	 */
+	containsModule(module) {
+		return ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.containsModule",
+			"DEP_WEBPACK_CHUNK_CONTAINS_MODULE"
+		).isModuleInChunk(module, this);
+	}
+
+	/**
+	 * @returns {Module[]} the modules for this chunk
+	 */
+	getModules() {
+		return ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.getModules",
+			"DEP_WEBPACK_CHUNK_GET_MODULES"
+		).getChunkModules(this);
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	remove() {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.remove",
+			"DEP_WEBPACK_CHUNK_REMOVE"
+		);
+		chunkGraph.disconnectChunk(this);
+		this.disconnectFromGroups();
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {Chunk} otherChunk the target chunk
+	 * @returns {void}
+	 */
+	moveModule(module, otherChunk) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.moveModule",
+			"DEP_WEBPACK_CHUNK_MOVE_MODULE"
+		);
+		chunkGraph.disconnectChunkAndModule(this, module);
+		chunkGraph.connectChunkAndModule(otherChunk, module);
+	}
+
+	/**
+	 * @param {Chunk} otherChunk the other chunk
+	 * @returns {boolean} true, if the specified chunk has been integrated
+	 */
+	integrate(otherChunk) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.integrate",
+			"DEP_WEBPACK_CHUNK_INTEGRATE"
+		);
+		if (chunkGraph.canChunksBeIntegrated(this, otherChunk)) {
+			chunkGraph.integrateChunks(this, otherChunk);
+			return true;
+		} else {
+			return false;
+		}
+	}
+
+	/**
+	 * @param {Chunk} otherChunk the other chunk
+	 * @returns {boolean} true, if chunks could be integrated
+	 */
+	canBeIntegrated(otherChunk) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.canBeIntegrated",
+			"DEP_WEBPACK_CHUNK_CAN_BE_INTEGRATED"
+		);
+		return chunkGraph.canChunksBeIntegrated(this, otherChunk);
+	}
+
+	/**
+	 * @returns {boolean} true, if this chunk contains no module
+	 */
+	isEmpty() {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.isEmpty",
+			"DEP_WEBPACK_CHUNK_IS_EMPTY"
+		);
+		return chunkGraph.getNumberOfChunkModules(this) === 0;
+	}
+
+	/**
+	 * @returns {number} total size of all modules in this chunk
+	 */
+	modulesSize() {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.modulesSize",
+			"DEP_WEBPACK_CHUNK_MODULES_SIZE"
+		);
+		return chunkGraph.getChunkModulesSize(this);
+	}
+
+	/**
+	 * @param {ChunkSizeOptions} options options object
+	 * @returns {number} total size of this chunk
+	 */
+	size(options = {}) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.size",
+			"DEP_WEBPACK_CHUNK_SIZE"
+		);
+		return chunkGraph.getChunkSize(this, options);
+	}
+
+	/**
+	 * @param {Chunk} otherChunk the other chunk
+	 * @param {ChunkSizeOptions} options options object
+	 * @returns {number} total size of the chunk or false if the chunk can't be integrated
+	 */
+	integratedSize(otherChunk, options) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.integratedSize",
+			"DEP_WEBPACK_CHUNK_INTEGRATED_SIZE"
+		);
+		return chunkGraph.getIntegratedChunksSize(this, otherChunk, options);
+	}
+
+	/**
+	 * @param {ModuleFilterPredicate} filterFn function used to filter modules
+	 * @returns {ChunkModuleMaps} module map information
+	 */
+	getChunkModuleMaps(filterFn) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.getChunkModuleMaps",
+			"DEP_WEBPACK_CHUNK_GET_CHUNK_MODULE_MAPS"
+		);
+		/** @type {Record<string|number, (string|number)[]>} */
+		const chunkModuleIdMap = Object.create(null);
+		/** @type {Record<string|number, string>} */
+		const chunkModuleHashMap = Object.create(null);
+
+		for (const asyncChunk of this.getAllAsyncChunks()) {
+			/** @type {(string|number)[]} */
+			let array;
+			for (const module of chunkGraph.getOrderedChunkModulesIterable(
+				asyncChunk,
+				compareModulesById(chunkGraph)
+			)) {
+				if (filterFn(module)) {
+					if (array === undefined) {
+						array = [];
+						chunkModuleIdMap[asyncChunk.id] = array;
+					}
+					const moduleId = chunkGraph.getModuleId(module);
+					array.push(moduleId);
+					chunkModuleHashMap[moduleId] = chunkGraph.getRenderedModuleHash(
+						module,
+						undefined
+					);
+				}
+			}
+		}
+
+		return {
+			id: chunkModuleIdMap,
+			hash: chunkModuleHashMap
+		};
+	}
+
+	/**
+	 * @param {ModuleFilterPredicate} filterFn predicate function used to filter modules
+	 * @param {ChunkFilterPredicate=} filterChunkFn predicate function used to filter chunks
+	 * @returns {boolean} return true if module exists in graph
+	 */
+	hasModuleInGraph(filterFn, filterChunkFn) {
+		const chunkGraph = ChunkGraph.getChunkGraphForChunk(
+			this,
+			"Chunk.hasModuleInGraph",
+			"DEP_WEBPACK_CHUNK_HAS_MODULE_IN_GRAPH"
+		);
+		return chunkGraph.hasModuleInGraph(this, filterFn, filterChunkFn);
+	}
+
+	/**
+	 * @deprecated
+	 * @param {boolean} realHash whether the full hash or the rendered hash is to be used
+	 * @returns {ChunkMaps} the chunk map information
+	 */
+	getChunkMaps(realHash) {
+		/** @type {Record<string|number, string>} */
+		const chunkHashMap = Object.create(null);
+		/** @type {Record<string|number, Record<string, string>>} */
+		const chunkContentHashMap = Object.create(null);
+		/** @type {Record<string|number, string>} */
+		const chunkNameMap = Object.create(null);
+
+		for (const chunk of this.getAllAsyncChunks()) {
+			chunkHashMap[chunk.id] = realHash ? chunk.hash : chunk.renderedHash;
+			for (const key of Object.keys(chunk.contentHash)) {
+				if (!chunkContentHashMap[key]) {
+					chunkContentHashMap[key] = Object.create(null);
+				}
+				chunkContentHashMap[key][chunk.id] = chunk.contentHash[key];
+			}
+			if (chunk.name) {
+				chunkNameMap[chunk.id] = chunk.name;
+			}
+		}
+
+		return {
+			hash: chunkHashMap,
+			contentHash: chunkContentHashMap,
+			name: chunkNameMap
+		};
+	}
+	// BACKWARD-COMPAT END
+
+	/**
+	 * @returns {boolean} whether or not the Chunk will have a runtime
+	 */
+	hasRuntime() {
+		for (const chunkGroup of this._groups) {
+			if (
+				chunkGroup instanceof Entrypoint &&
+				chunkGroup.getRuntimeChunk() === this
+			) {
+				return true;
+			}
+		}
+		return false;
+	}
+
+	/**
+	 * @returns {boolean} whether or not this chunk can be an initial chunk
+	 */
+	canBeInitial() {
+		for (const chunkGroup of this._groups) {
+			if (chunkGroup.isInitial()) return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @returns {boolean} whether this chunk can only be an initial chunk
+	 */
+	isOnlyInitial() {
+		if (this._groups.size <= 0) return false;
+		for (const chunkGroup of this._groups) {
+			if (!chunkGroup.isInitial()) return false;
+		}
+		return true;
+	}
+
+	/**
+	 * @returns {EntryOptions | undefined} the entry options for this chunk
+	 */
+	getEntryOptions() {
+		for (const chunkGroup of this._groups) {
+			if (chunkGroup instanceof Entrypoint) {
+				return chunkGroup.options;
+			}
+		}
+		return undefined;
+	}
+
+	/**
+	 * @param {ChunkGroup} chunkGroup the chunkGroup the chunk is being added
+	 * @returns {void}
+	 */
+	addGroup(chunkGroup) {
+		this._groups.add(chunkGroup);
+	}
+
+	/**
+	 * @param {ChunkGroup} chunkGroup the chunkGroup the chunk is being removed from
+	 * @returns {void}
+	 */
+	removeGroup(chunkGroup) {
+		this._groups.delete(chunkGroup);
+	}
+
+	/**
+	 * @param {ChunkGroup} chunkGroup the chunkGroup to check
+	 * @returns {boolean} returns true if chunk has chunkGroup reference and exists in chunkGroup
+	 */
+	isInGroup(chunkGroup) {
+		return this._groups.has(chunkGroup);
+	}
+
+	/**
+	 * @returns {number} the amount of groups that the said chunk is in
+	 */
+	getNumberOfGroups() {
+		return this._groups.size;
+	}
+
+	/**
+	 * @returns {Iterable<ChunkGroup>} the chunkGroups that the said chunk is referenced in
+	 */
+	get groupsIterable() {
+		this._groups.sort();
+		return this._groups;
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	disconnectFromGroups() {
+		for (const chunkGroup of this._groups) {
+			chunkGroup.removeChunk(this);
+		}
+	}
+
+	/**
+	 * @param {Chunk} newChunk the new chunk that will be split out of
+	 * @returns {void}
+	 */
+	split(newChunk) {
+		for (const chunkGroup of this._groups) {
+			chunkGroup.insertChunk(newChunk, this);
+			newChunk.addGroup(chunkGroup);
+		}
+		for (const idHint of this.idNameHints) {
+			newChunk.idNameHints.add(idHint);
+		}
+		newChunk.runtime = mergeRuntime(newChunk.runtime, this.runtime);
+	}
+
+	/**
+	 * @param {Hash} hash hash (will be modified)
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {void}
+	 */
+	updateHash(hash, chunkGraph) {
+		hash.update(
+			`${this.id} ${this.ids ? this.ids.join() : ""} ${this.name || ""} `
+		);
+		const xor = new StringXor();
+		for (const m of chunkGraph.getChunkModulesIterable(this)) {
+			xor.add(chunkGraph.getModuleHash(m, this.runtime));
+		}
+		xor.updateHash(hash);
+		const entryModules =
+			chunkGraph.getChunkEntryModulesWithChunkGroupIterable(this);
+		for (const [m, chunkGroup] of entryModules) {
+			hash.update(`entry${chunkGraph.getModuleId(m)}${chunkGroup.id}`);
+		}
+	}
+
+	/**
+	 * @returns {Set<Chunk>} a set of all the async chunks
+	 */
+	getAllAsyncChunks() {
+		const queue = new Set();
+		const chunks = new Set();
+
+		const initialChunks = intersect(
+			Array.from(this.groupsIterable, g => new Set(g.chunks))
+		);
+
+		const initialQueue = new Set(this.groupsIterable);
+
+		for (const chunkGroup of initialQueue) {
+			for (const child of chunkGroup.childrenIterable) {
+				if (child instanceof Entrypoint) {
+					initialQueue.add(child);
+				} else {
+					queue.add(child);
+				}
+			}
+		}
+
+		for (const chunkGroup of queue) {
+			for (const chunk of chunkGroup.chunks) {
+				if (!initialChunks.has(chunk)) {
+					chunks.add(chunk);
+				}
+			}
+			for (const child of chunkGroup.childrenIterable) {
+				queue.add(child);
+			}
+		}
+
+		return chunks;
+	}
+
+	/**
+	 * @returns {Set<Chunk>} a set of all the initial chunks (including itself)
+	 */
+	getAllInitialChunks() {
+		const chunks = new Set();
+		const queue = new Set(this.groupsIterable);
+		for (const group of queue) {
+			if (group.isInitial()) {
+				for (const c of group.chunks) chunks.add(c);
+				for (const g of group.childrenIterable) queue.add(g);
+			}
+		}
+		return chunks;
+	}
+
+	/**
+	 * @returns {Set<Chunk>} a set of all the referenced chunks (including itself)
+	 */
+	getAllReferencedChunks() {
+		const queue = new Set(this.groupsIterable);
+		const chunks = new Set();
+
+		for (const chunkGroup of queue) {
+			for (const chunk of chunkGroup.chunks) {
+				chunks.add(chunk);
+			}
+			for (const child of chunkGroup.childrenIterable) {
+				queue.add(child);
+			}
+		}
+
+		return chunks;
+	}
+
+	/**
+	 * @returns {Set<Entrypoint>} a set of all the referenced entrypoints
+	 */
+	getAllReferencedAsyncEntrypoints() {
+		const queue = new Set(this.groupsIterable);
+		const entrypoints = new Set();
+
+		for (const chunkGroup of queue) {
+			for (const entrypoint of chunkGroup.asyncEntrypointsIterable) {
+				entrypoints.add(entrypoint);
+			}
+			for (const child of chunkGroup.childrenIterable) {
+				queue.add(child);
+			}
+		}
+
+		return entrypoints;
+	}
+
+	/**
+	 * @returns {boolean} true, if the chunk references async chunks
+	 */
+	hasAsyncChunks() {
+		const queue = new Set();
+
+		const initialChunks = intersect(
+			Array.from(this.groupsIterable, g => new Set(g.chunks))
+		);
+
+		for (const chunkGroup of this.groupsIterable) {
+			for (const child of chunkGroup.childrenIterable) {
+				queue.add(child);
+			}
+		}
+
+		for (const chunkGroup of queue) {
+			for (const chunk of chunkGroup.chunks) {
+				if (!initialChunks.has(chunk)) {
+					return true;
+				}
+			}
+			for (const child of chunkGroup.childrenIterable) {
+				queue.add(child);
+			}
+		}
+
+		return false;
+	}
+
+	/**
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {ChunkFilterPredicate=} filterFn function used to filter chunks
+	 * @returns {Record<string, (string | number)[]>} a record object of names to lists of child ids(?)
+	 */
+	getChildIdsByOrders(chunkGraph, filterFn) {
+		/** @type {Map<string, {order: number, group: ChunkGroup}[]>} */
+		const lists = new Map();
+		for (const group of this.groupsIterable) {
+			if (group.chunks[group.chunks.length - 1] === this) {
+				for (const childGroup of group.childrenIterable) {
+					for (const key of Object.keys(childGroup.options)) {
+						if (key.endsWith("Order")) {
+							const name = key.substr(0, key.length - "Order".length);
+							let list = lists.get(name);
+							if (list === undefined) {
+								list = [];
+								lists.set(name, list);
+							}
+							list.push({
+								order: childGroup.options[key],
+								group: childGroup
+							});
+						}
+					}
+				}
+			}
+		}
+		/** @type {Record<string, (string | number)[]>} */
+		const result = Object.create(null);
+		for (const [name, list] of lists) {
+			list.sort((a, b) => {
+				const cmp = b.order - a.order;
+				if (cmp !== 0) return cmp;
+				return a.group.compareTo(chunkGraph, b.group);
+			});
+			/** @type {Set<string | number>} */
+			const chunkIdSet = new Set();
+			for (const item of list) {
+				for (const chunk of item.group.chunks) {
+					if (filterFn && !filterFn(chunk, chunkGraph)) continue;
+					chunkIdSet.add(chunk.id);
+				}
+			}
+			if (chunkIdSet.size > 0) {
+				result[name] = Array.from(chunkIdSet);
+			}
+		}
+		return result;
+	}
+
+	/**
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {string} type option name
+	 * @returns {{ onChunks: Chunk[], chunks: Set<Chunk> }[]} referenced chunks for a specific type
+	 */
+	getChildrenOfTypeInOrder(chunkGraph, type) {
+		const list = [];
+		for (const group of this.groupsIterable) {
+			for (const childGroup of group.childrenIterable) {
+				const order = childGroup.options[type];
+				if (order === undefined) continue;
+				list.push({
+					order,
+					group,
+					childGroup
+				});
+			}
+		}
+		if (list.length === 0) return undefined;
+		list.sort((a, b) => {
+			const cmp = b.order - a.order;
+			if (cmp !== 0) return cmp;
+			return a.group.compareTo(chunkGraph, b.group);
+		});
+		const result = [];
+		let lastEntry;
+		for (const { group, childGroup } of list) {
+			if (lastEntry && lastEntry.onChunks === group.chunks) {
+				for (const chunk of childGroup.chunks) {
+					lastEntry.chunks.add(chunk);
+				}
+			} else {
+				result.push(
+					(lastEntry = {
+						onChunks: group.chunks,
+						chunks: new Set(childGroup.chunks)
+					})
+				);
+			}
+		}
+		return result;
+	}
+
+	/**
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {boolean=} includeDirectChildren include direct children (by default only children of async children are included)
+	 * @param {ChunkFilterPredicate=} filterFn function used to filter chunks
+	 * @returns {Record<string|number, Record<string, (string | number)[]>>} a record object of names to lists of child ids(?) by chunk id
+	 */
+	getChildIdsByOrdersMap(chunkGraph, includeDirectChildren, filterFn) {
+		/** @type {Record<string|number, Record<string, (string | number)[]>>} */
+		const chunkMaps = Object.create(null);
+
+		/**
+		 * @param {Chunk} chunk a chunk
+		 * @returns {void}
+		 */
+		const addChildIdsByOrdersToMap = chunk => {
+			const data = chunk.getChildIdsByOrders(chunkGraph, filterFn);
+			for (const key of Object.keys(data)) {
+				let chunkMap = chunkMaps[key];
+				if (chunkMap === undefined) {
+					chunkMaps[key] = chunkMap = Object.create(null);
+				}
+				chunkMap[chunk.id] = data[key];
+			}
+		};
+
+		if (includeDirectChildren) {
+			/** @type {Set<Chunk>} */
+			const chunks = new Set();
+			for (const chunkGroup of this.groupsIterable) {
+				for (const chunk of chunkGroup.chunks) {
+					chunks.add(chunk);
+				}
+			}
+			for (const chunk of chunks) {
+				addChildIdsByOrdersToMap(chunk);
+			}
+		}
+
+		for (const chunk of this.getAllAsyncChunks()) {
+			addChildIdsByOrdersToMap(chunk);
+		}
+
+		return chunkMaps;
+	}
+}
+
+module.exports = Chunk;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkGraph.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkGraph.js
new file mode 100644
index 0000000..ba351e1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkGraph.js
@@ -0,0 +1,1727 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const Entrypoint = require("./Entrypoint");
+const ModuleGraphConnection = require("./ModuleGraphConnection");
+const { first } = require("./util/SetHelpers");
+const SortableSet = require("./util/SortableSet");
+const {
+	compareModulesById,
+	compareIterables,
+	compareModulesByIdentifier,
+	concatComparators,
+	compareSelect,
+	compareIds
+} = require("./util/comparators");
+const createHash = require("./util/createHash");
+const findGraphRoots = require("./util/findGraphRoots");
+const {
+	RuntimeSpecMap,
+	RuntimeSpecSet,
+	runtimeToString,
+	mergeRuntime,
+	forEachRuntime
+} = require("./util/runtime");
+
+/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./RuntimeModule")} RuntimeModule */
+/** @typedef {typeof import("./util/Hash")} Hash */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/** @type {ReadonlySet<string>} */
+const EMPTY_SET = new Set();
+
+const ZERO_BIG_INT = BigInt(0);
+
+const compareModuleIterables = compareIterables(compareModulesByIdentifier);
+
+/** @typedef {(c: Chunk, chunkGraph: ChunkGraph) => boolean} ChunkFilterPredicate */
+/** @typedef {(m: Module) => boolean} ModuleFilterPredicate */
+/** @typedef {[Module, Entrypoint | undefined]} EntryModuleWithChunkGroup */
+
+/**
+ * @typedef {Object} ChunkSizeOptions
+ * @property {number=} chunkOverhead constant overhead for a chunk
+ * @property {number=} entryChunkMultiplicator multiplicator for initial chunks
+ */
+
+class ModuleHashInfo {
+	constructor(hash, renderedHash) {
+		this.hash = hash;
+		this.renderedHash = renderedHash;
+	}
+}
+
+/** @template T @typedef {(set: SortableSet<T>) => T[]} SetToArrayFunction<T> */
+
+/**
+ * @template T
+ * @param {SortableSet<T>} set the set
+ * @returns {T[]} set as array
+ */
+const getArray = set => {
+	return Array.from(set);
+};
+
+/**
+ * @param {SortableSet<Chunk>} chunks the chunks
+ * @returns {RuntimeSpecSet} runtimes
+ */
+const getModuleRuntimes = chunks => {
+	const runtimes = new RuntimeSpecSet();
+	for (const chunk of chunks) {
+		runtimes.add(chunk.runtime);
+	}
+	return runtimes;
+};
+
+/**
+ * @param {SortableSet<Module>} set the set
+ * @returns {Map<string, SortableSet<Module>>} modules by source type
+ */
+const modulesBySourceType = set => {
+	/** @type {Map<string, SortableSet<Module>>} */
+	const map = new Map();
+	for (const module of set) {
+		for (const sourceType of module.getSourceTypes()) {
+			let innerSet = map.get(sourceType);
+			if (innerSet === undefined) {
+				innerSet = new SortableSet();
+				map.set(sourceType, innerSet);
+			}
+			innerSet.add(module);
+		}
+	}
+	for (const [key, innerSet] of map) {
+		// When all modules have the source type, we reuse the original SortableSet
+		// to benefit from the shared cache (especially for sorting)
+		if (innerSet.size === set.size) {
+			map.set(key, set);
+		}
+	}
+	return map;
+};
+
+/** @type {WeakMap<Function, any>} */
+const createOrderedArrayFunctionMap = new WeakMap();
+
+/**
+ * @template T
+ * @param {function(T, T): -1|0|1} comparator comparator function
+ * @returns {SetToArrayFunction<T>} set as ordered array
+ */
+const createOrderedArrayFunction = comparator => {
+	/** @type {SetToArrayFunction<T>} */
+	let fn = createOrderedArrayFunctionMap.get(comparator);
+	if (fn !== undefined) return fn;
+	fn = set => {
+		set.sortWith(comparator);
+		return Array.from(set);
+	};
+	createOrderedArrayFunctionMap.set(comparator, fn);
+	return fn;
+};
+
+/**
+ * @param {Iterable<Module>} modules the modules to get the count/size of
+ * @returns {number} the size of the modules
+ */
+const getModulesSize = modules => {
+	let size = 0;
+	for (const module of modules) {
+		for (const type of module.getSourceTypes()) {
+			size += module.size(type);
+		}
+	}
+	return size;
+};
+
+/**
+ * @param {Iterable<Module>} modules the sortable Set to get the size of
+ * @returns {Record<string, number>} the sizes of the modules
+ */
+const getModulesSizes = modules => {
+	let sizes = Object.create(null);
+	for (const module of modules) {
+		for (const type of module.getSourceTypes()) {
+			sizes[type] = (sizes[type] || 0) + module.size(type);
+		}
+	}
+	return sizes;
+};
+
+/**
+ * @param {Chunk} a chunk
+ * @param {Chunk} b chunk
+ * @returns {boolean} true, if a is always a parent of b
+ */
+const isAvailableChunk = (a, b) => {
+	const queue = new Set(b.groupsIterable);
+	for (const chunkGroup of queue) {
+		if (a.isInGroup(chunkGroup)) continue;
+		if (chunkGroup.isInitial()) return false;
+		for (const parent of chunkGroup.parentsIterable) {
+			queue.add(parent);
+		}
+	}
+	return true;
+};
+
+class ChunkGraphModule {
+	constructor() {
+		/** @type {SortableSet<Chunk>} */
+		this.chunks = new SortableSet();
+		/** @type {Set<Chunk> | undefined} */
+		this.entryInChunks = undefined;
+		/** @type {Set<Chunk> | undefined} */
+		this.runtimeInChunks = undefined;
+		/** @type {RuntimeSpecMap<ModuleHashInfo>} */
+		this.hashes = undefined;
+		/** @type {string | number} */
+		this.id = null;
+		/** @type {RuntimeSpecMap<Set<string>> | undefined} */
+		this.runtimeRequirements = undefined;
+		/** @type {RuntimeSpecMap<string>} */
+		this.graphHashes = undefined;
+		/** @type {RuntimeSpecMap<string>} */
+		this.graphHashesWithConnections = undefined;
+	}
+}
+
+class ChunkGraphChunk {
+	constructor() {
+		/** @type {SortableSet<Module>} */
+		this.modules = new SortableSet();
+		/** @type {Map<Module, Entrypoint>} */
+		this.entryModules = new Map();
+		/** @type {SortableSet<RuntimeModule>} */
+		this.runtimeModules = new SortableSet();
+		/** @type {Set<RuntimeModule> | undefined} */
+		this.fullHashModules = undefined;
+		/** @type {Set<RuntimeModule> | undefined} */
+		this.dependentHashModules = undefined;
+		/** @type {Set<string> | undefined} */
+		this.runtimeRequirements = undefined;
+		/** @type {Set<string>} */
+		this.runtimeRequirementsInTree = new Set();
+	}
+}
+
+class ChunkGraph {
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {string | Hash} hashFunction the hash function to use
+	 */
+	constructor(moduleGraph, hashFunction = "md4") {
+		/** @private @type {WeakMap<Module, ChunkGraphModule>} */
+		this._modules = new WeakMap();
+		/** @private @type {WeakMap<Chunk, ChunkGraphChunk>} */
+		this._chunks = new WeakMap();
+		/** @private @type {WeakMap<AsyncDependenciesBlock, ChunkGroup>} */
+		this._blockChunkGroups = new WeakMap();
+		/** @private @type {Map<string, string | number>} */
+		this._runtimeIds = new Map();
+		/** @type {ModuleGraph} */
+		this.moduleGraph = moduleGraph;
+
+		this._hashFunction = hashFunction;
+
+		this._getGraphRoots = this._getGraphRoots.bind(this);
+	}
+
+	/**
+	 * @private
+	 * @param {Module} module the module
+	 * @returns {ChunkGraphModule} internal module
+	 */
+	_getChunkGraphModule(module) {
+		let cgm = this._modules.get(module);
+		if (cgm === undefined) {
+			cgm = new ChunkGraphModule();
+			this._modules.set(module, cgm);
+		}
+		return cgm;
+	}
+
+	/**
+	 * @private
+	 * @param {Chunk} chunk the chunk
+	 * @returns {ChunkGraphChunk} internal chunk
+	 */
+	_getChunkGraphChunk(chunk) {
+		let cgc = this._chunks.get(chunk);
+		if (cgc === undefined) {
+			cgc = new ChunkGraphChunk();
+			this._chunks.set(chunk, cgc);
+		}
+		return cgc;
+	}
+
+	/**
+	 * @param {SortableSet<Module>} set the sortable Set to get the roots of
+	 * @returns {Module[]} the graph roots
+	 */
+	_getGraphRoots(set) {
+		const { moduleGraph } = this;
+		return Array.from(
+			findGraphRoots(set, module => {
+				/** @type {Set<Module>} */
+				const set = new Set();
+				const addDependencies = module => {
+					for (const connection of moduleGraph.getOutgoingConnections(module)) {
+						if (!connection.module) continue;
+						const activeState = connection.getActiveState(undefined);
+						if (activeState === false) continue;
+						if (activeState === ModuleGraphConnection.TRANSITIVE_ONLY) {
+							addDependencies(connection.module);
+							continue;
+						}
+						set.add(connection.module);
+					}
+				};
+				addDependencies(module);
+				return set;
+			})
+		).sort(compareModulesByIdentifier);
+	}
+
+	/**
+	 * @param {Chunk} chunk the new chunk
+	 * @param {Module} module the module
+	 * @returns {void}
+	 */
+	connectChunkAndModule(chunk, module) {
+		const cgm = this._getChunkGraphModule(module);
+		const cgc = this._getChunkGraphChunk(chunk);
+		cgm.chunks.add(chunk);
+		cgc.modules.add(module);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Module} module the module
+	 * @returns {void}
+	 */
+	disconnectChunkAndModule(chunk, module) {
+		const cgm = this._getChunkGraphModule(module);
+		const cgc = this._getChunkGraphChunk(chunk);
+		cgc.modules.delete(module);
+		cgm.chunks.delete(chunk);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk which will be disconnected
+	 * @returns {void}
+	 */
+	disconnectChunk(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		for (const module of cgc.modules) {
+			const cgm = this._getChunkGraphModule(module);
+			cgm.chunks.delete(chunk);
+		}
+		cgc.modules.clear();
+		chunk.disconnectFromGroups();
+		ChunkGraph.clearChunkGraphForChunk(chunk);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Iterable<Module>} modules the modules
+	 * @returns {void}
+	 */
+	attachModules(chunk, modules) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		for (const module of modules) {
+			cgc.modules.add(module);
+		}
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Iterable<RuntimeModule>} modules the runtime modules
+	 * @returns {void}
+	 */
+	attachRuntimeModules(chunk, modules) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		for (const module of modules) {
+			cgc.runtimeModules.add(module);
+		}
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Iterable<RuntimeModule>} modules the modules that require a full hash
+	 * @returns {void}
+	 */
+	attachFullHashModules(chunk, modules) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		if (cgc.fullHashModules === undefined) cgc.fullHashModules = new Set();
+		for (const module of modules) {
+			cgc.fullHashModules.add(module);
+		}
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Iterable<RuntimeModule>} modules the modules that require a full hash
+	 * @returns {void}
+	 */
+	attachDependentHashModules(chunk, modules) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		if (cgc.dependentHashModules === undefined)
+			cgc.dependentHashModules = new Set();
+		for (const module of modules) {
+			cgc.dependentHashModules.add(module);
+		}
+	}
+
+	/**
+	 * @param {Module} oldModule the replaced module
+	 * @param {Module} newModule the replacing module
+	 * @returns {void}
+	 */
+	replaceModule(oldModule, newModule) {
+		const oldCgm = this._getChunkGraphModule(oldModule);
+		const newCgm = this._getChunkGraphModule(newModule);
+
+		for (const chunk of oldCgm.chunks) {
+			const cgc = this._getChunkGraphChunk(chunk);
+			cgc.modules.delete(oldModule);
+			cgc.modules.add(newModule);
+			newCgm.chunks.add(chunk);
+		}
+		oldCgm.chunks.clear();
+
+		if (oldCgm.entryInChunks !== undefined) {
+			if (newCgm.entryInChunks === undefined) {
+				newCgm.entryInChunks = new Set();
+			}
+			for (const chunk of oldCgm.entryInChunks) {
+				const cgc = this._getChunkGraphChunk(chunk);
+				const old = cgc.entryModules.get(oldModule);
+				/** @type {Map<Module, Entrypoint>} */
+				const newEntryModules = new Map();
+				for (const [m, cg] of cgc.entryModules) {
+					if (m === oldModule) {
+						newEntryModules.set(newModule, old);
+					} else {
+						newEntryModules.set(m, cg);
+					}
+				}
+				cgc.entryModules = newEntryModules;
+				newCgm.entryInChunks.add(chunk);
+			}
+			oldCgm.entryInChunks = undefined;
+		}
+
+		if (oldCgm.runtimeInChunks !== undefined) {
+			if (newCgm.runtimeInChunks === undefined) {
+				newCgm.runtimeInChunks = new Set();
+			}
+			for (const chunk of oldCgm.runtimeInChunks) {
+				const cgc = this._getChunkGraphChunk(chunk);
+				cgc.runtimeModules.delete(/** @type {RuntimeModule} */ (oldModule));
+				cgc.runtimeModules.add(/** @type {RuntimeModule} */ (newModule));
+				newCgm.runtimeInChunks.add(chunk);
+				if (
+					cgc.fullHashModules !== undefined &&
+					cgc.fullHashModules.has(/** @type {RuntimeModule} */ (oldModule))
+				) {
+					cgc.fullHashModules.delete(/** @type {RuntimeModule} */ (oldModule));
+					cgc.fullHashModules.add(/** @type {RuntimeModule} */ (newModule));
+				}
+				if (
+					cgc.dependentHashModules !== undefined &&
+					cgc.dependentHashModules.has(/** @type {RuntimeModule} */ (oldModule))
+				) {
+					cgc.dependentHashModules.delete(
+						/** @type {RuntimeModule} */ (oldModule)
+					);
+					cgc.dependentHashModules.add(
+						/** @type {RuntimeModule} */ (newModule)
+					);
+				}
+			}
+			oldCgm.runtimeInChunks = undefined;
+		}
+	}
+
+	/**
+	 * @param {Module} module the checked module
+	 * @param {Chunk} chunk the checked chunk
+	 * @returns {boolean} true, if the chunk contains the module
+	 */
+	isModuleInChunk(module, chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.modules.has(module);
+	}
+
+	/**
+	 * @param {Module} module the checked module
+	 * @param {ChunkGroup} chunkGroup the checked chunk group
+	 * @returns {boolean} true, if the chunk contains the module
+	 */
+	isModuleInChunkGroup(module, chunkGroup) {
+		for (const chunk of chunkGroup.chunks) {
+			if (this.isModuleInChunk(module, chunk)) return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Module} module the checked module
+	 * @returns {boolean} true, if the module is entry of any chunk
+	 */
+	isEntryModule(module) {
+		const cgm = this._getChunkGraphModule(module);
+		return cgm.entryInChunks !== undefined;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {Iterable<Chunk>} iterable of chunks (do not modify)
+	 */
+	getModuleChunksIterable(module) {
+		const cgm = this._getChunkGraphModule(module);
+		return cgm.chunks;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {function(Chunk, Chunk): -1|0|1} sortFn sort function
+	 * @returns {Iterable<Chunk>} iterable of chunks (do not modify)
+	 */
+	getOrderedModuleChunksIterable(module, sortFn) {
+		const cgm = this._getChunkGraphModule(module);
+		cgm.chunks.sortWith(sortFn);
+		return cgm.chunks;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {Chunk[]} array of chunks (cached, do not modify)
+	 */
+	getModuleChunks(module) {
+		const cgm = this._getChunkGraphModule(module);
+		return cgm.chunks.getFromCache(getArray);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {number} the number of chunk which contain the module
+	 */
+	getNumberOfModuleChunks(module) {
+		const cgm = this._getChunkGraphModule(module);
+		return cgm.chunks.size;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {RuntimeSpecSet} runtimes
+	 */
+	getModuleRuntimes(module) {
+		const cgm = this._getChunkGraphModule(module);
+		return cgm.chunks.getFromUnorderedCache(getModuleRuntimes);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {number} the number of modules which are contained in this chunk
+	 */
+	getNumberOfChunkModules(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.modules.size;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {number} the number of full hash modules which are contained in this chunk
+	 */
+	getNumberOfChunkFullHashModules(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.fullHashModules === undefined ? 0 : cgc.fullHashModules.size;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Iterable<Module>} return the modules for this chunk
+	 */
+	getChunkModulesIterable(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.modules;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {string} sourceType source type
+	 * @returns {Iterable<Module> | undefined} return the modules for this chunk
+	 */
+	getChunkModulesIterableBySourceType(chunk, sourceType) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const modulesWithSourceType = cgc.modules
+			.getFromUnorderedCache(modulesBySourceType)
+			.get(sourceType);
+		return modulesWithSourceType;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {function(Module, Module): -1|0|1} comparator comparator function
+	 * @returns {Iterable<Module>} return the modules for this chunk
+	 */
+	getOrderedChunkModulesIterable(chunk, comparator) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		cgc.modules.sortWith(comparator);
+		return cgc.modules;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {string} sourceType source type
+	 * @param {function(Module, Module): -1|0|1} comparator comparator function
+	 * @returns {Iterable<Module> | undefined} return the modules for this chunk
+	 */
+	getOrderedChunkModulesIterableBySourceType(chunk, sourceType, comparator) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const modulesWithSourceType = cgc.modules
+			.getFromUnorderedCache(modulesBySourceType)
+			.get(sourceType);
+		if (modulesWithSourceType === undefined) return undefined;
+		modulesWithSourceType.sortWith(comparator);
+		return modulesWithSourceType;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Module[]} return the modules for this chunk (cached, do not modify)
+	 */
+	getChunkModules(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.modules.getFromUnorderedCache(getArray);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {function(Module, Module): -1|0|1} comparator comparator function
+	 * @returns {Module[]} return the modules for this chunk (cached, do not modify)
+	 */
+	getOrderedChunkModules(chunk, comparator) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const arrayFunction = createOrderedArrayFunction(comparator);
+		return cgc.modules.getFromUnorderedCache(arrayFunction);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {ModuleFilterPredicate} filterFn function used to filter modules
+	 * @param {boolean} includeAllChunks all chunks or only async chunks
+	 * @returns {Record<string|number, (string|number)[]>} chunk to module ids object
+	 */
+	getChunkModuleIdMap(chunk, filterFn, includeAllChunks = false) {
+		/** @type {Record<string|number, (string|number)[]>} */
+		const chunkModuleIdMap = Object.create(null);
+
+		for (const asyncChunk of includeAllChunks
+			? chunk.getAllReferencedChunks()
+			: chunk.getAllAsyncChunks()) {
+			/** @type {(string|number)[]} */
+			let array;
+			for (const module of this.getOrderedChunkModulesIterable(
+				asyncChunk,
+				compareModulesById(this)
+			)) {
+				if (filterFn(module)) {
+					if (array === undefined) {
+						array = [];
+						chunkModuleIdMap[asyncChunk.id] = array;
+					}
+					const moduleId = this.getModuleId(module);
+					array.push(moduleId);
+				}
+			}
+		}
+
+		return chunkModuleIdMap;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {ModuleFilterPredicate} filterFn function used to filter modules
+	 * @param {number} hashLength length of the hash
+	 * @param {boolean} includeAllChunks all chunks or only async chunks
+	 * @returns {Record<string|number, Record<string|number, string>>} chunk to module id to module hash object
+	 */
+	getChunkModuleRenderedHashMap(
+		chunk,
+		filterFn,
+		hashLength = 0,
+		includeAllChunks = false
+	) {
+		/** @type {Record<string|number, Record<string|number, string>>} */
+		const chunkModuleHashMap = Object.create(null);
+
+		for (const asyncChunk of includeAllChunks
+			? chunk.getAllReferencedChunks()
+			: chunk.getAllAsyncChunks()) {
+			/** @type {Record<string|number, string>} */
+			let idToHashMap;
+			for (const module of this.getOrderedChunkModulesIterable(
+				asyncChunk,
+				compareModulesById(this)
+			)) {
+				if (filterFn(module)) {
+					if (idToHashMap === undefined) {
+						idToHashMap = Object.create(null);
+						chunkModuleHashMap[asyncChunk.id] = idToHashMap;
+					}
+					const moduleId = this.getModuleId(module);
+					const hash = this.getRenderedModuleHash(module, asyncChunk.runtime);
+					idToHashMap[moduleId] = hashLength ? hash.slice(0, hashLength) : hash;
+				}
+			}
+		}
+
+		return chunkModuleHashMap;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {ChunkFilterPredicate} filterFn function used to filter chunks
+	 * @returns {Record<string|number, boolean>} chunk map
+	 */
+	getChunkConditionMap(chunk, filterFn) {
+		const map = Object.create(null);
+		for (const c of chunk.getAllReferencedChunks()) {
+			map[c.id] = filterFn(c, this);
+		}
+		return map;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {ModuleFilterPredicate} filterFn predicate function used to filter modules
+	 * @param {ChunkFilterPredicate=} filterChunkFn predicate function used to filter chunks
+	 * @returns {boolean} return true if module exists in graph
+	 */
+	hasModuleInGraph(chunk, filterFn, filterChunkFn) {
+		const queue = new Set(chunk.groupsIterable);
+		const chunksProcessed = new Set();
+
+		for (const chunkGroup of queue) {
+			for (const innerChunk of chunkGroup.chunks) {
+				if (!chunksProcessed.has(innerChunk)) {
+					chunksProcessed.add(innerChunk);
+					if (!filterChunkFn || filterChunkFn(innerChunk, this)) {
+						for (const module of this.getChunkModulesIterable(innerChunk)) {
+							if (filterFn(module)) {
+								return true;
+							}
+						}
+					}
+				}
+			}
+			for (const child of chunkGroup.childrenIterable) {
+				queue.add(child);
+			}
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Chunk} chunkA first chunk
+	 * @param {Chunk} chunkB second chunk
+	 * @returns {-1|0|1} this is a comparator function like sort and returns -1, 0, or 1 based on sort order
+	 */
+	compareChunks(chunkA, chunkB) {
+		const cgcA = this._getChunkGraphChunk(chunkA);
+		const cgcB = this._getChunkGraphChunk(chunkB);
+		if (cgcA.modules.size > cgcB.modules.size) return -1;
+		if (cgcA.modules.size < cgcB.modules.size) return 1;
+		cgcA.modules.sortWith(compareModulesByIdentifier);
+		cgcB.modules.sortWith(compareModulesByIdentifier);
+		return compareModuleIterables(cgcA.modules, cgcB.modules);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {number} total size of all modules in the chunk
+	 */
+	getChunkModulesSize(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.modules.getFromUnorderedCache(getModulesSize);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Record<string, number>} total sizes of all modules in the chunk by source type
+	 */
+	getChunkModulesSizes(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.modules.getFromUnorderedCache(getModulesSizes);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Module[]} root modules of the chunks (ordered by identifier)
+	 */
+	getChunkRootModules(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.modules.getFromUnorderedCache(this._getGraphRoots);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {ChunkSizeOptions} options options object
+	 * @returns {number} total size of the chunk
+	 */
+	getChunkSize(chunk, options = {}) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const modulesSize = cgc.modules.getFromUnorderedCache(getModulesSize);
+		const chunkOverhead =
+			typeof options.chunkOverhead === "number" ? options.chunkOverhead : 10000;
+		const entryChunkMultiplicator =
+			typeof options.entryChunkMultiplicator === "number"
+				? options.entryChunkMultiplicator
+				: 10;
+		return (
+			chunkOverhead +
+			modulesSize * (chunk.canBeInitial() ? entryChunkMultiplicator : 1)
+		);
+	}
+
+	/**
+	 * @param {Chunk} chunkA chunk
+	 * @param {Chunk} chunkB chunk
+	 * @param {ChunkSizeOptions} options options object
+	 * @returns {number} total size of the chunk or false if chunks can't be integrated
+	 */
+	getIntegratedChunksSize(chunkA, chunkB, options = {}) {
+		const cgcA = this._getChunkGraphChunk(chunkA);
+		const cgcB = this._getChunkGraphChunk(chunkB);
+		const allModules = new Set(cgcA.modules);
+		for (const m of cgcB.modules) allModules.add(m);
+		let modulesSize = getModulesSize(allModules);
+		const chunkOverhead =
+			typeof options.chunkOverhead === "number" ? options.chunkOverhead : 10000;
+		const entryChunkMultiplicator =
+			typeof options.entryChunkMultiplicator === "number"
+				? options.entryChunkMultiplicator
+				: 10;
+		return (
+			chunkOverhead +
+			modulesSize *
+				(chunkA.canBeInitial() || chunkB.canBeInitial()
+					? entryChunkMultiplicator
+					: 1)
+		);
+	}
+
+	/**
+	 * @param {Chunk} chunkA chunk
+	 * @param {Chunk} chunkB chunk
+	 * @returns {boolean} true, if chunks could be integrated
+	 */
+	canChunksBeIntegrated(chunkA, chunkB) {
+		if (chunkA.preventIntegration || chunkB.preventIntegration) {
+			return false;
+		}
+
+		const hasRuntimeA = chunkA.hasRuntime();
+		const hasRuntimeB = chunkB.hasRuntime();
+
+		if (hasRuntimeA !== hasRuntimeB) {
+			if (hasRuntimeA) {
+				return isAvailableChunk(chunkA, chunkB);
+			} else if (hasRuntimeB) {
+				return isAvailableChunk(chunkB, chunkA);
+			} else {
+				return false;
+			}
+		}
+
+		if (
+			this.getNumberOfEntryModules(chunkA) > 0 ||
+			this.getNumberOfEntryModules(chunkB) > 0
+		) {
+			return false;
+		}
+
+		return true;
+	}
+
+	/**
+	 * @param {Chunk} chunkA the target chunk
+	 * @param {Chunk} chunkB the chunk to integrate
+	 * @returns {void}
+	 */
+	integrateChunks(chunkA, chunkB) {
+		// Decide for one name (deterministic)
+		if (chunkA.name && chunkB.name) {
+			if (
+				this.getNumberOfEntryModules(chunkA) > 0 ===
+				this.getNumberOfEntryModules(chunkB) > 0
+			) {
+				// When both chunks have entry modules or none have one, use
+				// shortest name
+				if (chunkA.name.length !== chunkB.name.length) {
+					chunkA.name =
+						chunkA.name.length < chunkB.name.length ? chunkA.name : chunkB.name;
+				} else {
+					chunkA.name = chunkA.name < chunkB.name ? chunkA.name : chunkB.name;
+				}
+			} else if (this.getNumberOfEntryModules(chunkB) > 0) {
+				// Pick the name of the chunk with the entry module
+				chunkA.name = chunkB.name;
+			}
+		} else if (chunkB.name) {
+			chunkA.name = chunkB.name;
+		}
+
+		// Merge id name hints
+		for (const hint of chunkB.idNameHints) {
+			chunkA.idNameHints.add(hint);
+		}
+
+		// Merge runtime
+		chunkA.runtime = mergeRuntime(chunkA.runtime, chunkB.runtime);
+
+		// getChunkModules is used here to create a clone, because disconnectChunkAndModule modifies
+		for (const module of this.getChunkModules(chunkB)) {
+			this.disconnectChunkAndModule(chunkB, module);
+			this.connectChunkAndModule(chunkA, module);
+		}
+
+		for (const [module, chunkGroup] of Array.from(
+			this.getChunkEntryModulesWithChunkGroupIterable(chunkB)
+		)) {
+			this.disconnectChunkAndEntryModule(chunkB, module);
+			this.connectChunkAndEntryModule(chunkA, module, chunkGroup);
+		}
+
+		for (const chunkGroup of chunkB.groupsIterable) {
+			chunkGroup.replaceChunk(chunkB, chunkA);
+			chunkA.addGroup(chunkGroup);
+			chunkB.removeGroup(chunkGroup);
+		}
+		ChunkGraph.clearChunkGraphForChunk(chunkB);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk to upgrade
+	 * @returns {void}
+	 */
+	upgradeDependentToFullHashModules(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		if (cgc.dependentHashModules === undefined) return;
+		if (cgc.fullHashModules === undefined) {
+			cgc.fullHashModules = cgc.dependentHashModules;
+		} else {
+			for (const m of cgc.dependentHashModules) {
+				cgc.fullHashModules.add(m);
+			}
+			cgc.dependentHashModules = undefined;
+		}
+	}
+
+	/**
+	 * @param {Module} module the checked module
+	 * @param {Chunk} chunk the checked chunk
+	 * @returns {boolean} true, if the chunk contains the module as entry
+	 */
+	isEntryModuleInChunk(module, chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.entryModules.has(module);
+	}
+
+	/**
+	 * @param {Chunk} chunk the new chunk
+	 * @param {Module} module the entry module
+	 * @param {Entrypoint=} entrypoint the chunk group which must be loaded before the module is executed
+	 * @returns {void}
+	 */
+	connectChunkAndEntryModule(chunk, module, entrypoint) {
+		const cgm = this._getChunkGraphModule(module);
+		const cgc = this._getChunkGraphChunk(chunk);
+		if (cgm.entryInChunks === undefined) {
+			cgm.entryInChunks = new Set();
+		}
+		cgm.entryInChunks.add(chunk);
+		cgc.entryModules.set(module, entrypoint);
+	}
+
+	/**
+	 * @param {Chunk} chunk the new chunk
+	 * @param {RuntimeModule} module the runtime module
+	 * @returns {void}
+	 */
+	connectChunkAndRuntimeModule(chunk, module) {
+		const cgm = this._getChunkGraphModule(module);
+		const cgc = this._getChunkGraphChunk(chunk);
+		if (cgm.runtimeInChunks === undefined) {
+			cgm.runtimeInChunks = new Set();
+		}
+		cgm.runtimeInChunks.add(chunk);
+		cgc.runtimeModules.add(module);
+	}
+
+	/**
+	 * @param {Chunk} chunk the new chunk
+	 * @param {RuntimeModule} module the module that require a full hash
+	 * @returns {void}
+	 */
+	addFullHashModuleToChunk(chunk, module) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		if (cgc.fullHashModules === undefined) cgc.fullHashModules = new Set();
+		cgc.fullHashModules.add(module);
+	}
+
+	/**
+	 * @param {Chunk} chunk the new chunk
+	 * @param {RuntimeModule} module the module that require a full hash
+	 * @returns {void}
+	 */
+	addDependentHashModuleToChunk(chunk, module) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		if (cgc.dependentHashModules === undefined)
+			cgc.dependentHashModules = new Set();
+		cgc.dependentHashModules.add(module);
+	}
+
+	/**
+	 * @param {Chunk} chunk the new chunk
+	 * @param {Module} module the entry module
+	 * @returns {void}
+	 */
+	disconnectChunkAndEntryModule(chunk, module) {
+		const cgm = this._getChunkGraphModule(module);
+		const cgc = this._getChunkGraphChunk(chunk);
+		cgm.entryInChunks.delete(chunk);
+		if (cgm.entryInChunks.size === 0) {
+			cgm.entryInChunks = undefined;
+		}
+		cgc.entryModules.delete(module);
+	}
+
+	/**
+	 * @param {Chunk} chunk the new chunk
+	 * @param {RuntimeModule} module the runtime module
+	 * @returns {void}
+	 */
+	disconnectChunkAndRuntimeModule(chunk, module) {
+		const cgm = this._getChunkGraphModule(module);
+		const cgc = this._getChunkGraphChunk(chunk);
+		cgm.runtimeInChunks.delete(chunk);
+		if (cgm.runtimeInChunks.size === 0) {
+			cgm.runtimeInChunks = undefined;
+		}
+		cgc.runtimeModules.delete(module);
+	}
+
+	/**
+	 * @param {Module} module the entry module, it will no longer be entry
+	 * @returns {void}
+	 */
+	disconnectEntryModule(module) {
+		const cgm = this._getChunkGraphModule(module);
+		for (const chunk of cgm.entryInChunks) {
+			const cgc = this._getChunkGraphChunk(chunk);
+			cgc.entryModules.delete(module);
+		}
+		cgm.entryInChunks = undefined;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk, for which all entries will be removed
+	 * @returns {void}
+	 */
+	disconnectEntries(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		for (const module of cgc.entryModules.keys()) {
+			const cgm = this._getChunkGraphModule(module);
+			cgm.entryInChunks.delete(chunk);
+			if (cgm.entryInChunks.size === 0) {
+				cgm.entryInChunks = undefined;
+			}
+		}
+		cgc.entryModules.clear();
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {number} the amount of entry modules in chunk
+	 */
+	getNumberOfEntryModules(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.entryModules.size;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {number} the amount of entry modules in chunk
+	 */
+	getNumberOfRuntimeModules(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.runtimeModules.size;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Iterable<Module>} iterable of modules (do not modify)
+	 */
+	getChunkEntryModulesIterable(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.entryModules.keys();
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Iterable<Chunk>} iterable of chunks
+	 */
+	getChunkEntryDependentChunksIterable(chunk) {
+		/** @type {Set<Chunk>} */
+		const set = new Set();
+		for (const chunkGroup of chunk.groupsIterable) {
+			if (chunkGroup instanceof Entrypoint) {
+				const entrypointChunk = chunkGroup.getEntrypointChunk();
+				const cgc = this._getChunkGraphChunk(entrypointChunk);
+				for (const chunkGroup of cgc.entryModules.values()) {
+					for (const c of chunkGroup.chunks) {
+						if (c !== chunk && c !== entrypointChunk && !c.hasRuntime()) {
+							set.add(c);
+						}
+					}
+				}
+			}
+		}
+
+		return set;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {boolean} true, when it has dependent chunks
+	 */
+	hasChunkEntryDependentChunks(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		for (const chunkGroup of cgc.entryModules.values()) {
+			for (const c of chunkGroup.chunks) {
+				if (c !== chunk) {
+					return true;
+				}
+			}
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Iterable<RuntimeModule>} iterable of modules (do not modify)
+	 */
+	getChunkRuntimeModulesIterable(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.runtimeModules;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {RuntimeModule[]} array of modules in order of execution
+	 */
+	getChunkRuntimeModulesInOrder(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const array = Array.from(cgc.runtimeModules);
+		array.sort(
+			concatComparators(
+				compareSelect(
+					/**
+					 * @param {RuntimeModule} r runtime module
+					 * @returns {number=} stage
+					 */
+					r => r.stage,
+					compareIds
+				),
+				compareModulesByIdentifier
+			)
+		);
+		return array;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Iterable<RuntimeModule> | undefined} iterable of modules (do not modify)
+	 */
+	getChunkFullHashModulesIterable(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.fullHashModules;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {ReadonlySet<RuntimeModule> | undefined} set of modules (do not modify)
+	 */
+	getChunkFullHashModulesSet(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.fullHashModules;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Iterable<RuntimeModule> | undefined} iterable of modules (do not modify)
+	 */
+	getChunkDependentHashModulesIterable(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.dependentHashModules;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {Iterable<EntryModuleWithChunkGroup>} iterable of modules (do not modify)
+	 */
+	getChunkEntryModulesWithChunkGroupIterable(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.entryModules;
+	}
+
+	/**
+	 * @param {AsyncDependenciesBlock} depBlock the async block
+	 * @returns {ChunkGroup} the chunk group
+	 */
+	getBlockChunkGroup(depBlock) {
+		return this._blockChunkGroups.get(depBlock);
+	}
+
+	/**
+	 * @param {AsyncDependenciesBlock} depBlock the async block
+	 * @param {ChunkGroup} chunkGroup the chunk group
+	 * @returns {void}
+	 */
+	connectBlockAndChunkGroup(depBlock, chunkGroup) {
+		this._blockChunkGroups.set(depBlock, chunkGroup);
+		chunkGroup.addBlock(depBlock);
+	}
+
+	/**
+	 * @param {ChunkGroup} chunkGroup the chunk group
+	 * @returns {void}
+	 */
+	disconnectChunkGroup(chunkGroup) {
+		for (const block of chunkGroup.blocksIterable) {
+			this._blockChunkGroups.delete(block);
+		}
+		// TODO refactor by moving blocks list into ChunkGraph
+		chunkGroup._blocks.clear();
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {string | number} the id of the module
+	 */
+	getModuleId(module) {
+		const cgm = this._getChunkGraphModule(module);
+		return cgm.id;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {string | number} id the id of the module
+	 * @returns {void}
+	 */
+	setModuleId(module, id) {
+		const cgm = this._getChunkGraphModule(module);
+		cgm.id = id;
+	}
+
+	/**
+	 * @param {string} runtime runtime
+	 * @returns {string | number} the id of the runtime
+	 */
+	getRuntimeId(runtime) {
+		return this._runtimeIds.get(runtime);
+	}
+
+	/**
+	 * @param {string} runtime runtime
+	 * @param {string | number} id the id of the runtime
+	 * @returns {void}
+	 */
+	setRuntimeId(runtime, id) {
+		this._runtimeIds.set(runtime, id);
+	}
+
+	/**
+	 * @template T
+	 * @param {Module} module the module
+	 * @param {RuntimeSpecMap<T>} hashes hashes data
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {T} hash
+	 */
+	_getModuleHashInfo(module, hashes, runtime) {
+		if (!hashes) {
+			throw new Error(
+				`Module ${module.identifier()} has no hash info for runtime ${runtimeToString(
+					runtime
+				)} (hashes not set at all)`
+			);
+		} else if (runtime === undefined) {
+			const hashInfoItems = new Set(hashes.values());
+			if (hashInfoItems.size !== 1) {
+				throw new Error(
+					`No unique hash info entry for unspecified runtime for ${module.identifier()} (existing runtimes: ${Array.from(
+						hashes.keys(),
+						r => runtimeToString(r)
+					).join(", ")}).
+Caller might not support runtime-dependent code generation (opt-out via optimization.usedExports: "global").`
+				);
+			}
+			return first(hashInfoItems);
+		} else {
+			const hashInfo = hashes.get(runtime);
+			if (!hashInfo) {
+				throw new Error(
+					`Module ${module.identifier()} has no hash info for runtime ${runtimeToString(
+						runtime
+					)} (available runtimes ${Array.from(
+						hashes.keys(),
+						runtimeToString
+					).join(", ")})`
+				);
+			}
+			return hashInfo;
+		}
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, if the module has hashes for this runtime
+	 */
+	hasModuleHashes(module, runtime) {
+		const cgm = this._getChunkGraphModule(module);
+		const hashes = cgm.hashes;
+		return hashes && hashes.has(runtime);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {string} hash
+	 */
+	getModuleHash(module, runtime) {
+		const cgm = this._getChunkGraphModule(module);
+		const hashes = cgm.hashes;
+		return this._getModuleHashInfo(module, hashes, runtime).hash;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {string} hash
+	 */
+	getRenderedModuleHash(module, runtime) {
+		const cgm = this._getChunkGraphModule(module);
+		const hashes = cgm.hashes;
+		return this._getModuleHashInfo(module, hashes, runtime).renderedHash;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {string} hash the full hash
+	 * @param {string} renderedHash the shortened hash for rendering
+	 * @returns {void}
+	 */
+	setModuleHashes(module, runtime, hash, renderedHash) {
+		const cgm = this._getChunkGraphModule(module);
+		if (cgm.hashes === undefined) {
+			cgm.hashes = new RuntimeSpecMap();
+		}
+		cgm.hashes.set(runtime, new ModuleHashInfo(hash, renderedHash));
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {Set<string>} items runtime requirements to be added (ownership of this Set is given to ChunkGraph when transferOwnership not false)
+	 * @param {boolean} transferOwnership true: transfer ownership of the items object, false: items is immutable and shared and won't be modified
+	 * @returns {void}
+	 */
+	addModuleRuntimeRequirements(
+		module,
+		runtime,
+		items,
+		transferOwnership = true
+	) {
+		const cgm = this._getChunkGraphModule(module);
+		const runtimeRequirementsMap = cgm.runtimeRequirements;
+		if (runtimeRequirementsMap === undefined) {
+			const map = new RuntimeSpecMap();
+			// TODO avoid cloning item and track ownership instead
+			map.set(runtime, transferOwnership ? items : new Set(items));
+			cgm.runtimeRequirements = map;
+			return;
+		}
+		runtimeRequirementsMap.update(runtime, runtimeRequirements => {
+			if (runtimeRequirements === undefined) {
+				return transferOwnership ? items : new Set(items);
+			} else if (!transferOwnership || runtimeRequirements.size >= items.size) {
+				for (const item of items) runtimeRequirements.add(item);
+				return runtimeRequirements;
+			} else {
+				for (const item of runtimeRequirements) items.add(item);
+				return items;
+			}
+		});
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Set<string>} items runtime requirements to be added (ownership of this Set is given to ChunkGraph)
+	 * @returns {void}
+	 */
+	addChunkRuntimeRequirements(chunk, items) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const runtimeRequirements = cgc.runtimeRequirements;
+		if (runtimeRequirements === undefined) {
+			cgc.runtimeRequirements = items;
+		} else if (runtimeRequirements.size >= items.size) {
+			for (const item of items) runtimeRequirements.add(item);
+		} else {
+			for (const item of runtimeRequirements) items.add(item);
+			cgc.runtimeRequirements = items;
+		}
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Iterable<string>} items runtime requirements to be added
+	 * @returns {void}
+	 */
+	addTreeRuntimeRequirements(chunk, items) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const runtimeRequirements = cgc.runtimeRequirementsInTree;
+		for (const item of items) runtimeRequirements.add(item);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {ReadonlySet<string>} runtime requirements
+	 */
+	getModuleRuntimeRequirements(module, runtime) {
+		const cgm = this._getChunkGraphModule(module);
+		const runtimeRequirements =
+			cgm.runtimeRequirements && cgm.runtimeRequirements.get(runtime);
+		return runtimeRequirements === undefined ? EMPTY_SET : runtimeRequirements;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {ReadonlySet<string>} runtime requirements
+	 */
+	getChunkRuntimeRequirements(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		const runtimeRequirements = cgc.runtimeRequirements;
+		return runtimeRequirements === undefined ? EMPTY_SET : runtimeRequirements;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {boolean} withConnections include connections
+	 * @returns {string} hash
+	 */
+	getModuleGraphHash(module, runtime, withConnections = true) {
+		const cgm = this._getChunkGraphModule(module);
+		return withConnections
+			? this._getModuleGraphHashWithConnections(cgm, module, runtime)
+			: this._getModuleGraphHashBigInt(cgm, module, runtime).toString(16);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {boolean} withConnections include connections
+	 * @returns {bigint} hash
+	 */
+	getModuleGraphHashBigInt(module, runtime, withConnections = true) {
+		const cgm = this._getChunkGraphModule(module);
+		return withConnections
+			? BigInt(
+					`0x${this._getModuleGraphHashWithConnections(cgm, module, runtime)}`
+			  )
+			: this._getModuleGraphHashBigInt(cgm, module, runtime);
+	}
+
+	/**
+	 * @param {ChunkGraphModule} cgm the ChunkGraphModule
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {bigint} hash as big int
+	 */
+	_getModuleGraphHashBigInt(cgm, module, runtime) {
+		if (cgm.graphHashes === undefined) {
+			cgm.graphHashes = new RuntimeSpecMap();
+		}
+		const graphHash = cgm.graphHashes.provide(runtime, () => {
+			const hash = createHash(this._hashFunction);
+			hash.update(`${cgm.id}${this.moduleGraph.isAsync(module)}`);
+			this.moduleGraph.getExportsInfo(module).updateHash(hash, runtime);
+			return BigInt(`0x${/** @type {string} */ (hash.digest("hex"))}`);
+		});
+		return graphHash;
+	}
+
+	/**
+	 * @param {ChunkGraphModule} cgm the ChunkGraphModule
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {string} hash
+	 */
+	_getModuleGraphHashWithConnections(cgm, module, runtime) {
+		if (cgm.graphHashesWithConnections === undefined) {
+			cgm.graphHashesWithConnections = new RuntimeSpecMap();
+		}
+		const activeStateToString = state => {
+			if (state === false) return "F";
+			if (state === true) return "T";
+			if (state === ModuleGraphConnection.TRANSITIVE_ONLY) return "O";
+			throw new Error("Not implemented active state");
+		};
+		const strict = module.buildMeta && module.buildMeta.strictHarmonyModule;
+		return cgm.graphHashesWithConnections.provide(runtime, () => {
+			const graphHash = this._getModuleGraphHashBigInt(
+				cgm,
+				module,
+				runtime
+			).toString(16);
+			const connections = this.moduleGraph.getOutgoingConnections(module);
+			/** @type {Set<Module>} */
+			const activeNamespaceModules = new Set();
+			/** @type {Map<string, Module | Set<Module>>} */
+			const connectedModules = new Map();
+			const processConnection = (connection, stateInfo) => {
+				const module = connection.module;
+				stateInfo += module.getExportsType(this.moduleGraph, strict);
+				// cspell:word Tnamespace
+				if (stateInfo === "Tnamespace") activeNamespaceModules.add(module);
+				else {
+					const oldModule = connectedModules.get(stateInfo);
+					if (oldModule === undefined) {
+						connectedModules.set(stateInfo, module);
+					} else if (oldModule instanceof Set) {
+						oldModule.add(module);
+					} else if (oldModule !== module) {
+						connectedModules.set(stateInfo, new Set([oldModule, module]));
+					}
+				}
+			};
+			if (runtime === undefined || typeof runtime === "string") {
+				for (const connection of connections) {
+					const state = connection.getActiveState(runtime);
+					if (state === false) continue;
+					processConnection(connection, state === true ? "T" : "O");
+				}
+			} else {
+				// cspell:word Tnamespace
+				for (const connection of connections) {
+					const states = new Set();
+					let stateInfo = "";
+					forEachRuntime(
+						runtime,
+						runtime => {
+							const state = connection.getActiveState(runtime);
+							states.add(state);
+							stateInfo += activeStateToString(state) + runtime;
+						},
+						true
+					);
+					if (states.size === 1) {
+						const state = first(states);
+						if (state === false) continue;
+						stateInfo = activeStateToString(state);
+					}
+					processConnection(connection, stateInfo);
+				}
+			}
+			// cspell:word Tnamespace
+			if (activeNamespaceModules.size === 0 && connectedModules.size === 0)
+				return graphHash;
+			const connectedModulesInOrder =
+				connectedModules.size > 1
+					? Array.from(connectedModules).sort(([a], [b]) => (a < b ? -1 : 1))
+					: connectedModules;
+			const hash = createHash(this._hashFunction);
+			const addModuleToHash = module => {
+				hash.update(
+					this._getModuleGraphHashBigInt(
+						this._getChunkGraphModule(module),
+						module,
+						runtime
+					).toString(16)
+				);
+			};
+			const addModulesToHash = modules => {
+				let xor = ZERO_BIG_INT;
+				for (const m of modules) {
+					xor =
+						xor ^
+						this._getModuleGraphHashBigInt(
+							this._getChunkGraphModule(m),
+							m,
+							runtime
+						);
+				}
+				hash.update(xor.toString(16));
+			};
+			if (activeNamespaceModules.size === 1)
+				addModuleToHash(activeNamespaceModules.values().next().value);
+			else if (activeNamespaceModules.size > 1)
+				addModulesToHash(activeNamespaceModules);
+			for (const [stateInfo, modules] of connectedModulesInOrder) {
+				hash.update(stateInfo);
+				if (modules instanceof Set) {
+					addModulesToHash(modules);
+				} else {
+					addModuleToHash(modules);
+				}
+			}
+			hash.update(graphHash);
+			return /** @type {string} */ (hash.digest("hex"));
+		});
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {ReadonlySet<string>} runtime requirements
+	 */
+	getTreeRuntimeRequirements(chunk) {
+		const cgc = this._getChunkGraphChunk(chunk);
+		return cgc.runtimeRequirementsInTree;
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Module} module the module
+	 * @param {string} deprecateMessage message for the deprecation message
+	 * @param {string} deprecationCode code for the deprecation
+	 * @returns {ChunkGraph} the chunk graph
+	 */
+	static getChunkGraphForModule(module, deprecateMessage, deprecationCode) {
+		const fn = deprecateGetChunkGraphForModuleMap.get(deprecateMessage);
+		if (fn) return fn(module);
+		const newFn = util.deprecate(
+			/**
+			 * @param {Module} module the module
+			 * @returns {ChunkGraph} the chunk graph
+			 */
+			module => {
+				const chunkGraph = chunkGraphForModuleMap.get(module);
+				if (!chunkGraph)
+					throw new Error(
+						deprecateMessage +
+							": There was no ChunkGraph assigned to the Module for backward-compat (Use the new API)"
+					);
+				return chunkGraph;
+			},
+			deprecateMessage + ": Use new ChunkGraph API",
+			deprecationCode
+		);
+		deprecateGetChunkGraphForModuleMap.set(deprecateMessage, newFn);
+		return newFn(module);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Module} module the module
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {void}
+	 */
+	static setChunkGraphForModule(module, chunkGraph) {
+		chunkGraphForModuleMap.set(module, chunkGraph);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Module} module the module
+	 * @returns {void}
+	 */
+	static clearChunkGraphForModule(module) {
+		chunkGraphForModuleMap.delete(module);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {string} deprecateMessage message for the deprecation message
+	 * @param {string} deprecationCode code for the deprecation
+	 * @returns {ChunkGraph} the chunk graph
+	 */
+	static getChunkGraphForChunk(chunk, deprecateMessage, deprecationCode) {
+		const fn = deprecateGetChunkGraphForChunkMap.get(deprecateMessage);
+		if (fn) return fn(chunk);
+		const newFn = util.deprecate(
+			/**
+			 * @param {Chunk} chunk the chunk
+			 * @returns {ChunkGraph} the chunk graph
+			 */
+			chunk => {
+				const chunkGraph = chunkGraphForChunkMap.get(chunk);
+				if (!chunkGraph)
+					throw new Error(
+						deprecateMessage +
+							"There was no ChunkGraph assigned to the Chunk for backward-compat (Use the new API)"
+					);
+				return chunkGraph;
+			},
+			deprecateMessage + ": Use new ChunkGraph API",
+			deprecationCode
+		);
+		deprecateGetChunkGraphForChunkMap.set(deprecateMessage, newFn);
+		return newFn(chunk);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {void}
+	 */
+	static setChunkGraphForChunk(chunk, chunkGraph) {
+		chunkGraphForChunkMap.set(chunk, chunkGraph);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @returns {void}
+	 */
+	static clearChunkGraphForChunk(chunk) {
+		chunkGraphForChunkMap.delete(chunk);
+	}
+}
+
+// TODO remove in webpack 6
+/** @type {WeakMap<Module, ChunkGraph>} */
+const chunkGraphForModuleMap = new WeakMap();
+
+// TODO remove in webpack 6
+/** @type {WeakMap<Chunk, ChunkGraph>} */
+const chunkGraphForChunkMap = new WeakMap();
+
+// TODO remove in webpack 6
+/** @type {Map<string, (module: Module) => ChunkGraph>} */
+const deprecateGetChunkGraphForModuleMap = new Map();
+
+// TODO remove in webpack 6
+/** @type {Map<string, (chunk: Chunk) => ChunkGraph>} */
+const deprecateGetChunkGraphForChunkMap = new Map();
+
+module.exports = ChunkGraph;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkGroup.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkGroup.js
new file mode 100644
index 0000000..69b2128
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkGroup.js
@@ -0,0 +1,584 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const SortableSet = require("./util/SortableSet");
+const {
+	compareLocations,
+	compareChunks,
+	compareIterables
+} = require("./util/comparators");
+
+/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Entrypoint")} Entrypoint */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+
+/** @typedef {{id: number}} HasId */
+/** @typedef {{module: Module, loc: DependencyLocation, request: string}} OriginRecord */
+
+/**
+ * @typedef {Object} RawChunkGroupOptions
+ * @property {number=} preloadOrder
+ * @property {number=} prefetchOrder
+ */
+
+/** @typedef {RawChunkGroupOptions & { name?: string }} ChunkGroupOptions */
+
+let debugId = 5000;
+
+/**
+ * @template T
+ * @param {SortableSet<T>} set set to convert to array.
+ * @returns {T[]} the array format of existing set
+ */
+const getArray = set => Array.from(set);
+
+/**
+ * A convenience method used to sort chunks based on their id's
+ * @param {ChunkGroup} a first sorting comparator
+ * @param {ChunkGroup} b second sorting comparator
+ * @returns {1|0|-1} a sorting index to determine order
+ */
+const sortById = (a, b) => {
+	if (a.id < b.id) return -1;
+	if (b.id < a.id) return 1;
+	return 0;
+};
+
+/**
+ * @param {OriginRecord} a the first comparator in sort
+ * @param {OriginRecord} b the second comparator in sort
+ * @returns {1|-1|0} returns sorting order as index
+ */
+const sortOrigin = (a, b) => {
+	const aIdent = a.module ? a.module.identifier() : "";
+	const bIdent = b.module ? b.module.identifier() : "";
+	if (aIdent < bIdent) return -1;
+	if (aIdent > bIdent) return 1;
+	return compareLocations(a.loc, b.loc);
+};
+
+class ChunkGroup {
+	/**
+	 * Creates an instance of ChunkGroup.
+	 * @param {string|ChunkGroupOptions=} options chunk group options passed to chunkGroup
+	 */
+	constructor(options) {
+		if (typeof options === "string") {
+			options = { name: options };
+		} else if (!options) {
+			options = { name: undefined };
+		}
+		/** @type {number} */
+		this.groupDebugId = debugId++;
+		this.options = options;
+		/** @type {SortableSet<ChunkGroup>} */
+		this._children = new SortableSet(undefined, sortById);
+		/** @type {SortableSet<ChunkGroup>} */
+		this._parents = new SortableSet(undefined, sortById);
+		/** @type {SortableSet<ChunkGroup>} */
+		this._asyncEntrypoints = new SortableSet(undefined, sortById);
+		this._blocks = new SortableSet();
+		/** @type {Chunk[]} */
+		this.chunks = [];
+		/** @type {OriginRecord[]} */
+		this.origins = [];
+		/** Indices in top-down order */
+		/** @private @type {Map<Module, number>} */
+		this._modulePreOrderIndices = new Map();
+		/** Indices in bottom-up order */
+		/** @private @type {Map<Module, number>} */
+		this._modulePostOrderIndices = new Map();
+		/** @type {number} */
+		this.index = undefined;
+	}
+
+	/**
+	 * when a new chunk is added to a chunkGroup, addingOptions will occur.
+	 * @param {ChunkGroupOptions} options the chunkGroup options passed to addOptions
+	 * @returns {void}
+	 */
+	addOptions(options) {
+		for (const key of Object.keys(options)) {
+			if (this.options[key] === undefined) {
+				this.options[key] = options[key];
+			} else if (this.options[key] !== options[key]) {
+				if (key.endsWith("Order")) {
+					this.options[key] = Math.max(this.options[key], options[key]);
+				} else {
+					throw new Error(
+						`ChunkGroup.addOptions: No option merge strategy for ${key}`
+					);
+				}
+			}
+		}
+	}
+
+	/**
+	 * returns the name of current ChunkGroup
+	 * @returns {string|undefined} returns the ChunkGroup name
+	 */
+	get name() {
+		return this.options.name;
+	}
+
+	/**
+	 * sets a new name for current ChunkGroup
+	 * @param {string} value the new name for ChunkGroup
+	 * @returns {void}
+	 */
+	set name(value) {
+		this.options.name = value;
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * get a uniqueId for ChunkGroup, made up of its member Chunk debugId's
+	 * @returns {string} a unique concatenation of chunk debugId's
+	 */
+	get debugId() {
+		return Array.from(this.chunks, x => x.debugId).join("+");
+	}
+
+	/**
+	 * get a unique id for ChunkGroup, made up of its member Chunk id's
+	 * @returns {string} a unique concatenation of chunk ids
+	 */
+	get id() {
+		return Array.from(this.chunks, x => x.id).join("+");
+	}
+
+	/**
+	 * Performs an unshift of a specific chunk
+	 * @param {Chunk} chunk chunk being unshifted
+	 * @returns {boolean} returns true if attempted chunk shift is accepted
+	 */
+	unshiftChunk(chunk) {
+		const oldIdx = this.chunks.indexOf(chunk);
+		if (oldIdx > 0) {
+			this.chunks.splice(oldIdx, 1);
+			this.chunks.unshift(chunk);
+		} else if (oldIdx < 0) {
+			this.chunks.unshift(chunk);
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * inserts a chunk before another existing chunk in group
+	 * @param {Chunk} chunk Chunk being inserted
+	 * @param {Chunk} before Placeholder/target chunk marking new chunk insertion point
+	 * @returns {boolean} return true if insertion was successful
+	 */
+	insertChunk(chunk, before) {
+		const oldIdx = this.chunks.indexOf(chunk);
+		const idx = this.chunks.indexOf(before);
+		if (idx < 0) {
+			throw new Error("before chunk not found");
+		}
+		if (oldIdx >= 0 && oldIdx > idx) {
+			this.chunks.splice(oldIdx, 1);
+			this.chunks.splice(idx, 0, chunk);
+		} else if (oldIdx < 0) {
+			this.chunks.splice(idx, 0, chunk);
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * add a chunk into ChunkGroup. Is pushed on or prepended
+	 * @param {Chunk} chunk chunk being pushed into ChunkGroupS
+	 * @returns {boolean} returns true if chunk addition was successful.
+	 */
+	pushChunk(chunk) {
+		const oldIdx = this.chunks.indexOf(chunk);
+		if (oldIdx >= 0) {
+			return false;
+		}
+		this.chunks.push(chunk);
+		return true;
+	}
+
+	/**
+	 * @param {Chunk} oldChunk chunk to be replaced
+	 * @param {Chunk} newChunk New chunk that will be replaced with
+	 * @returns {boolean} returns true if the replacement was successful
+	 */
+	replaceChunk(oldChunk, newChunk) {
+		const oldIdx = this.chunks.indexOf(oldChunk);
+		if (oldIdx < 0) return false;
+		const newIdx = this.chunks.indexOf(newChunk);
+		if (newIdx < 0) {
+			this.chunks[oldIdx] = newChunk;
+			return true;
+		}
+		if (newIdx < oldIdx) {
+			this.chunks.splice(oldIdx, 1);
+			return true;
+		} else if (newIdx !== oldIdx) {
+			this.chunks[oldIdx] = newChunk;
+			this.chunks.splice(newIdx, 1);
+			return true;
+		}
+	}
+
+	/**
+	 * @param {Chunk} chunk chunk to remove
+	 * @returns {boolean} returns true if chunk was removed
+	 */
+	removeChunk(chunk) {
+		const idx = this.chunks.indexOf(chunk);
+		if (idx >= 0) {
+			this.chunks.splice(idx, 1);
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @returns {boolean} true, when this chunk group will be loaded on initial page load
+	 */
+	isInitial() {
+		return false;
+	}
+
+	/**
+	 * @param {ChunkGroup} group chunk group to add
+	 * @returns {boolean} returns true if chunk group was added
+	 */
+	addChild(group) {
+		const size = this._children.size;
+		this._children.add(group);
+		return size !== this._children.size;
+	}
+
+	/**
+	 * @returns {ChunkGroup[]} returns the children of this group
+	 */
+	getChildren() {
+		return this._children.getFromCache(getArray);
+	}
+
+	getNumberOfChildren() {
+		return this._children.size;
+	}
+
+	get childrenIterable() {
+		return this._children;
+	}
+
+	/**
+	 * @param {ChunkGroup} group the chunk group to remove
+	 * @returns {boolean} returns true if the chunk group was removed
+	 */
+	removeChild(group) {
+		if (!this._children.has(group)) {
+			return false;
+		}
+
+		this._children.delete(group);
+		group.removeParent(this);
+		return true;
+	}
+
+	/**
+	 * @param {ChunkGroup} parentChunk the parent group to be added into
+	 * @returns {boolean} returns true if this chunk group was added to the parent group
+	 */
+	addParent(parentChunk) {
+		if (!this._parents.has(parentChunk)) {
+			this._parents.add(parentChunk);
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @returns {ChunkGroup[]} returns the parents of this group
+	 */
+	getParents() {
+		return this._parents.getFromCache(getArray);
+	}
+
+	getNumberOfParents() {
+		return this._parents.size;
+	}
+
+	/**
+	 * @param {ChunkGroup} parent the parent group
+	 * @returns {boolean} returns true if the parent group contains this group
+	 */
+	hasParent(parent) {
+		return this._parents.has(parent);
+	}
+
+	get parentsIterable() {
+		return this._parents;
+	}
+
+	/**
+	 * @param {ChunkGroup} chunkGroup the parent group
+	 * @returns {boolean} returns true if this group has been removed from the parent
+	 */
+	removeParent(chunkGroup) {
+		if (this._parents.delete(chunkGroup)) {
+			chunkGroup.removeChild(this);
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Entrypoint} entrypoint entrypoint to add
+	 * @returns {boolean} returns true if entrypoint was added
+	 */
+	addAsyncEntrypoint(entrypoint) {
+		const size = this._asyncEntrypoints.size;
+		this._asyncEntrypoints.add(entrypoint);
+		return size !== this._asyncEntrypoints.size;
+	}
+
+	get asyncEntrypointsIterable() {
+		return this._asyncEntrypoints;
+	}
+
+	/**
+	 * @returns {Array} an array containing the blocks
+	 */
+	getBlocks() {
+		return this._blocks.getFromCache(getArray);
+	}
+
+	getNumberOfBlocks() {
+		return this._blocks.size;
+	}
+
+	hasBlock(block) {
+		return this._blocks.has(block);
+	}
+
+	/**
+	 * @returns {Iterable<AsyncDependenciesBlock>} blocks
+	 */
+	get blocksIterable() {
+		return this._blocks;
+	}
+
+	/**
+	 * @param {AsyncDependenciesBlock} block a block
+	 * @returns {boolean} false, if block was already added
+	 */
+	addBlock(block) {
+		if (!this._blocks.has(block)) {
+			this._blocks.add(block);
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Module} module origin module
+	 * @param {DependencyLocation} loc location of the reference in the origin module
+	 * @param {string} request request name of the reference
+	 * @returns {void}
+	 */
+	addOrigin(module, loc, request) {
+		this.origins.push({
+			module,
+			loc,
+			request
+		});
+	}
+
+	/**
+	 * @returns {string[]} the files contained this chunk group
+	 */
+	getFiles() {
+		const files = new Set();
+
+		for (const chunk of this.chunks) {
+			for (const file of chunk.files) {
+				files.add(file);
+			}
+		}
+
+		return Array.from(files);
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	remove() {
+		// cleanup parents
+		for (const parentChunkGroup of this._parents) {
+			// remove this chunk from its parents
+			parentChunkGroup._children.delete(this);
+
+			// cleanup "sub chunks"
+			for (const chunkGroup of this._children) {
+				/**
+				 * remove this chunk as "intermediary" and connect
+				 * it "sub chunks" and parents directly
+				 */
+				// add parent to each "sub chunk"
+				chunkGroup.addParent(parentChunkGroup);
+				// add "sub chunk" to parent
+				parentChunkGroup.addChild(chunkGroup);
+			}
+		}
+
+		/**
+		 * we need to iterate again over the children
+		 * to remove this from the child's parents.
+		 * This can not be done in the above loop
+		 * as it is not guaranteed that `this._parents` contains anything.
+		 */
+		for (const chunkGroup of this._children) {
+			// remove this as parent of every "sub chunk"
+			chunkGroup._parents.delete(this);
+		}
+
+		// remove chunks
+		for (const chunk of this.chunks) {
+			chunk.removeGroup(this);
+		}
+	}
+
+	sortItems() {
+		this.origins.sort(sortOrigin);
+	}
+
+	/**
+	 * Sorting predicate which allows current ChunkGroup to be compared against another.
+	 * Sorting values are based off of number of chunks in ChunkGroup.
+	 *
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {ChunkGroup} otherGroup the chunkGroup to compare this against
+	 * @returns {-1|0|1} sort position for comparison
+	 */
+	compareTo(chunkGraph, otherGroup) {
+		if (this.chunks.length > otherGroup.chunks.length) return -1;
+		if (this.chunks.length < otherGroup.chunks.length) return 1;
+		return compareIterables(compareChunks(chunkGraph))(
+			this.chunks,
+			otherGroup.chunks
+		);
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {Record<string, ChunkGroup[]>} mapping from children type to ordered list of ChunkGroups
+	 */
+	getChildrenByOrders(moduleGraph, chunkGraph) {
+		/** @type {Map<string, {order: number, group: ChunkGroup}[]>} */
+		const lists = new Map();
+		for (const childGroup of this._children) {
+			for (const key of Object.keys(childGroup.options)) {
+				if (key.endsWith("Order")) {
+					const name = key.substr(0, key.length - "Order".length);
+					let list = lists.get(name);
+					if (list === undefined) {
+						lists.set(name, (list = []));
+					}
+					list.push({
+						order: childGroup.options[key],
+						group: childGroup
+					});
+				}
+			}
+		}
+		/** @type {Record<string, ChunkGroup[]>} */
+		const result = Object.create(null);
+		for (const [name, list] of lists) {
+			list.sort((a, b) => {
+				const cmp = b.order - a.order;
+				if (cmp !== 0) return cmp;
+				return a.group.compareTo(chunkGraph, b.group);
+			});
+			result[name] = list.map(i => i.group);
+		}
+		return result;
+	}
+
+	/**
+	 * Sets the top-down index of a module in this ChunkGroup
+	 * @param {Module} module module for which the index should be set
+	 * @param {number} index the index of the module
+	 * @returns {void}
+	 */
+	setModulePreOrderIndex(module, index) {
+		this._modulePreOrderIndices.set(module, index);
+	}
+
+	/**
+	 * Gets the top-down index of a module in this ChunkGroup
+	 * @param {Module} module the module
+	 * @returns {number} index
+	 */
+	getModulePreOrderIndex(module) {
+		return this._modulePreOrderIndices.get(module);
+	}
+
+	/**
+	 * Sets the bottom-up index of a module in this ChunkGroup
+	 * @param {Module} module module for which the index should be set
+	 * @param {number} index the index of the module
+	 * @returns {void}
+	 */
+	setModulePostOrderIndex(module, index) {
+		this._modulePostOrderIndices.set(module, index);
+	}
+
+	/**
+	 * Gets the bottom-up index of a module in this ChunkGroup
+	 * @param {Module} module the module
+	 * @returns {number} index
+	 */
+	getModulePostOrderIndex(module) {
+		return this._modulePostOrderIndices.get(module);
+	}
+
+	/* istanbul ignore next */
+	checkConstraints() {
+		const chunk = this;
+		for (const child of chunk._children) {
+			if (!child._parents.has(chunk)) {
+				throw new Error(
+					`checkConstraints: child missing parent ${chunk.debugId} -> ${child.debugId}`
+				);
+			}
+		}
+		for (const parentChunk of chunk._parents) {
+			if (!parentChunk._children.has(chunk)) {
+				throw new Error(
+					`checkConstraints: parent missing child ${parentChunk.debugId} <- ${chunk.debugId}`
+				);
+			}
+		}
+	}
+}
+
+ChunkGroup.prototype.getModuleIndex = util.deprecate(
+	ChunkGroup.prototype.getModulePreOrderIndex,
+	"ChunkGroup.getModuleIndex was renamed to getModulePreOrderIndex",
+	"DEP_WEBPACK_CHUNK_GROUP_GET_MODULE_INDEX"
+);
+
+ChunkGroup.prototype.getModuleIndex2 = util.deprecate(
+	ChunkGroup.prototype.getModulePostOrderIndex,
+	"ChunkGroup.getModuleIndex2 was renamed to getModulePostOrderIndex",
+	"DEP_WEBPACK_CHUNK_GROUP_GET_MODULE_INDEX_2"
+);
+
+module.exports = ChunkGroup;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkRenderError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkRenderError.js
new file mode 100644
index 0000000..fce913f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkRenderError.js
@@ -0,0 +1,31 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Chunk")} Chunk */
+
+class ChunkRenderError extends WebpackError {
+	/**
+	 * Create a new ChunkRenderError
+	 * @param {Chunk} chunk A chunk
+	 * @param {string} file Related file
+	 * @param {Error} error Original error
+	 */
+	constructor(chunk, file, error) {
+		super();
+
+		this.name = "ChunkRenderError";
+		this.error = error;
+		this.message = error.message;
+		this.details = error.stack;
+		this.file = file;
+		this.chunk = chunk;
+	}
+}
+
+module.exports = ChunkRenderError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkTemplate.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkTemplate.js
new file mode 100644
index 0000000..e98280f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ChunkTemplate.js
@@ -0,0 +1,138 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const memoize = require("./util/memoize");
+
+/** @typedef {import("../declarations/WebpackOptions").Output} OutputOptions */
+/** @typedef {import("./Compilation")} Compilation */
+
+const getJavascriptModulesPlugin = memoize(() =>
+	require("./javascript/JavascriptModulesPlugin")
+);
+
+// TODO webpack 6 remove this class
+class ChunkTemplate {
+	/**
+	 * @param {OutputOptions} outputOptions output options
+	 * @param {Compilation} compilation the compilation
+	 */
+	constructor(outputOptions, compilation) {
+		this._outputOptions = outputOptions || {};
+		this.hooks = Object.freeze({
+			renderManifest: {
+				tap: util.deprecate(
+					(options, fn) => {
+						compilation.hooks.renderManifest.tap(
+							options,
+							(entries, options) => {
+								if (options.chunk.hasRuntime()) return entries;
+								return fn(entries, options);
+							}
+						);
+					},
+					"ChunkTemplate.hooks.renderManifest is deprecated (use Compilation.hooks.renderManifest instead)",
+					"DEP_WEBPACK_CHUNK_TEMPLATE_RENDER_MANIFEST"
+				)
+			},
+			modules: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.renderChunk.tap(options, (source, renderContext) =>
+								fn(
+									source,
+									compilation.moduleTemplates.javascript,
+									renderContext
+								)
+							);
+					},
+					"ChunkTemplate.hooks.modules is deprecated (use JavascriptModulesPlugin.getCompilationHooks().renderChunk instead)",
+					"DEP_WEBPACK_CHUNK_TEMPLATE_MODULES"
+				)
+			},
+			render: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.renderChunk.tap(options, (source, renderContext) =>
+								fn(
+									source,
+									compilation.moduleTemplates.javascript,
+									renderContext
+								)
+							);
+					},
+					"ChunkTemplate.hooks.render is deprecated (use JavascriptModulesPlugin.getCompilationHooks().renderChunk instead)",
+					"DEP_WEBPACK_CHUNK_TEMPLATE_RENDER"
+				)
+			},
+			renderWithEntry: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.render.tap(options, (source, renderContext) => {
+								if (
+									renderContext.chunkGraph.getNumberOfEntryModules(
+										renderContext.chunk
+									) === 0 ||
+									renderContext.chunk.hasRuntime()
+								) {
+									return source;
+								}
+								return fn(source, renderContext.chunk);
+							});
+					},
+					"ChunkTemplate.hooks.renderWithEntry is deprecated (use JavascriptModulesPlugin.getCompilationHooks().render instead)",
+					"DEP_WEBPACK_CHUNK_TEMPLATE_RENDER_WITH_ENTRY"
+				)
+			},
+			hash: {
+				tap: util.deprecate(
+					(options, fn) => {
+						compilation.hooks.fullHash.tap(options, fn);
+					},
+					"ChunkTemplate.hooks.hash is deprecated (use Compilation.hooks.fullHash instead)",
+					"DEP_WEBPACK_CHUNK_TEMPLATE_HASH"
+				)
+			},
+			hashForChunk: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.chunkHash.tap(options, (chunk, hash, context) => {
+								if (chunk.hasRuntime()) return;
+								fn(hash, chunk, context);
+							});
+					},
+					"ChunkTemplate.hooks.hashForChunk is deprecated (use JavascriptModulesPlugin.getCompilationHooks().chunkHash instead)",
+					"DEP_WEBPACK_CHUNK_TEMPLATE_HASH_FOR_CHUNK"
+				)
+			}
+		});
+	}
+}
+
+Object.defineProperty(ChunkTemplate.prototype, "outputOptions", {
+	get: util.deprecate(
+		/**
+		 * @this {ChunkTemplate}
+		 * @returns {OutputOptions} output options
+		 */
+		function () {
+			return this._outputOptions;
+		},
+		"ChunkTemplate.outputOptions is deprecated (use Compilation.outputOptions instead)",
+		"DEP_WEBPACK_CHUNK_TEMPLATE_OUTPUT_OPTIONS"
+	)
+});
+
+module.exports = ChunkTemplate;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/CleanPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/CleanPlugin.js
new file mode 100644
index 0000000..ee4a9a8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/CleanPlugin.js
@@ -0,0 +1,420 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const { SyncBailHook } = require("tapable");
+const Compilation = require("../lib/Compilation");
+const createSchemaValidation = require("./util/create-schema-validation");
+const { join } = require("./util/fs");
+const processAsyncTree = require("./util/processAsyncTree");
+
+/** @typedef {import("../declarations/WebpackOptions").CleanOptions} CleanOptions */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./logging/Logger").Logger} Logger */
+/** @typedef {import("./util/fs").OutputFileSystem} OutputFileSystem */
+/** @typedef {import("./util/fs").StatsCallback} StatsCallback */
+
+/** @typedef {(function(string):boolean)|RegExp} IgnoreItem */
+/** @typedef {Map<string, number>} Assets */
+/** @typedef {function(IgnoreItem): void} AddToIgnoreCallback */
+
+/**
+ * @typedef {Object} CleanPluginCompilationHooks
+ * @property {SyncBailHook<[string], boolean>} keep when returning true the file/directory will be kept during cleaning, returning false will clean it and ignore the following plugins and config
+ */
+
+const validate = createSchemaValidation(
+	undefined,
+	() => {
+		const { definitions } = require("../schemas/WebpackOptions.json");
+		return {
+			definitions,
+			oneOf: [{ $ref: "#/definitions/CleanOptions" }]
+		};
+	},
+	{
+		name: "Clean Plugin",
+		baseDataPath: "options"
+	}
+);
+const _10sec = 10 * 1000;
+
+/**
+ * marge assets map 2 into map 1
+ * @param {Assets} as1 assets
+ * @param {Assets} as2 assets
+ * @returns {void}
+ */
+const mergeAssets = (as1, as2) => {
+	for (const [key, value1] of as2) {
+		const value2 = as1.get(key);
+		if (!value2 || value1 > value2) as1.set(key, value1);
+	}
+};
+
+/**
+ * @param {OutputFileSystem} fs filesystem
+ * @param {string} outputPath output path
+ * @param {Map<string, number>} currentAssets filename of the current assets (must not start with .. or ., must only use / as path separator)
+ * @param {function((Error | null)=, Set<string>=): void} callback returns the filenames of the assets that shouldn't be there
+ * @returns {void}
+ */
+const getDiffToFs = (fs, outputPath, currentAssets, callback) => {
+	const directories = new Set();
+	// get directories of assets
+	for (const [asset] of currentAssets) {
+		directories.add(asset.replace(/(^|\/)[^/]*$/, ""));
+	}
+	// and all parent directories
+	for (const directory of directories) {
+		directories.add(directory.replace(/(^|\/)[^/]*$/, ""));
+	}
+	const diff = new Set();
+	asyncLib.forEachLimit(
+		directories,
+		10,
+		(directory, callback) => {
+			fs.readdir(join(fs, outputPath, directory), (err, entries) => {
+				if (err) {
+					if (err.code === "ENOENT") return callback();
+					if (err.code === "ENOTDIR") {
+						diff.add(directory);
+						return callback();
+					}
+					return callback(err);
+				}
+				for (const entry of entries) {
+					const file = /** @type {string} */ (entry);
+					const filename = directory ? `${directory}/${file}` : file;
+					if (!directories.has(filename) && !currentAssets.has(filename)) {
+						diff.add(filename);
+					}
+				}
+				callback();
+			});
+		},
+		err => {
+			if (err) return callback(err);
+
+			callback(null, diff);
+		}
+	);
+};
+
+/**
+ * @param {Assets} currentAssets assets list
+ * @param {Assets} oldAssets old assets list
+ * @returns {Set<string>} diff
+ */
+const getDiffToOldAssets = (currentAssets, oldAssets) => {
+	const diff = new Set();
+	const now = Date.now();
+	for (const [asset, ts] of oldAssets) {
+		if (ts >= now) continue;
+		if (!currentAssets.has(asset)) diff.add(asset);
+	}
+	return diff;
+};
+
+/**
+ * @param {OutputFileSystem} fs filesystem
+ * @param {string} filename path to file
+ * @param {StatsCallback} callback callback for provided filename
+ * @returns {void}
+ */
+const doStat = (fs, filename, callback) => {
+	if ("lstat" in fs) {
+		fs.lstat(filename, callback);
+	} else {
+		fs.stat(filename, callback);
+	}
+};
+
+/**
+ * @param {OutputFileSystem} fs filesystem
+ * @param {string} outputPath output path
+ * @param {boolean} dry only log instead of fs modification
+ * @param {Logger} logger logger
+ * @param {Set<string>} diff filenames of the assets that shouldn't be there
+ * @param {function(string): boolean} isKept check if the entry is ignored
+ * @param {function(Error=, Assets=): void} callback callback
+ * @returns {void}
+ */
+const applyDiff = (fs, outputPath, dry, logger, diff, isKept, callback) => {
+	const log = msg => {
+		if (dry) {
+			logger.info(msg);
+		} else {
+			logger.log(msg);
+		}
+	};
+	/** @typedef {{ type: "check" | "unlink" | "rmdir", filename: string, parent: { remaining: number, job: Job } | undefined }} Job */
+	/** @type {Job[]} */
+	const jobs = Array.from(diff.keys(), filename => ({
+		type: "check",
+		filename,
+		parent: undefined
+	}));
+	/** @type {Assets} */
+	const keptAssets = new Map();
+	processAsyncTree(
+		jobs,
+		10,
+		({ type, filename, parent }, push, callback) => {
+			const handleError = err => {
+				if (err.code === "ENOENT") {
+					log(`${filename} was removed during cleaning by something else`);
+					handleParent();
+					return callback();
+				}
+				return callback(err);
+			};
+			const handleParent = () => {
+				if (parent && --parent.remaining === 0) push(parent.job);
+			};
+			const path = join(fs, outputPath, filename);
+			switch (type) {
+				case "check":
+					if (isKept(filename)) {
+						keptAssets.set(filename, 0);
+						// do not decrement parent entry as we don't want to delete the parent
+						log(`${filename} will be kept`);
+						return process.nextTick(callback);
+					}
+					doStat(fs, path, (err, stats) => {
+						if (err) return handleError(err);
+						if (!stats.isDirectory()) {
+							push({
+								type: "unlink",
+								filename,
+								parent
+							});
+							return callback();
+						}
+						fs.readdir(path, (err, entries) => {
+							if (err) return handleError(err);
+							/** @type {Job} */
+							const deleteJob = {
+								type: "rmdir",
+								filename,
+								parent
+							};
+							if (entries.length === 0) {
+								push(deleteJob);
+							} else {
+								const parentToken = {
+									remaining: entries.length,
+									job: deleteJob
+								};
+								for (const entry of entries) {
+									const file = /** @type {string} */ (entry);
+									if (file.startsWith(".")) {
+										log(
+											`${filename} will be kept (dot-files will never be removed)`
+										);
+										continue;
+									}
+									push({
+										type: "check",
+										filename: `${filename}/${file}`,
+										parent: parentToken
+									});
+								}
+							}
+							return callback();
+						});
+					});
+					break;
+				case "rmdir":
+					log(`${filename} will be removed`);
+					if (dry) {
+						handleParent();
+						return process.nextTick(callback);
+					}
+					if (!fs.rmdir) {
+						logger.warn(
+							`${filename} can't be removed because output file system doesn't support removing directories (rmdir)`
+						);
+						return process.nextTick(callback);
+					}
+					fs.rmdir(path, err => {
+						if (err) return handleError(err);
+						handleParent();
+						callback();
+					});
+					break;
+				case "unlink":
+					log(`${filename} will be removed`);
+					if (dry) {
+						handleParent();
+						return process.nextTick(callback);
+					}
+					if (!fs.unlink) {
+						logger.warn(
+							`${filename} can't be removed because output file system doesn't support removing files (rmdir)`
+						);
+						return process.nextTick(callback);
+					}
+					fs.unlink(path, err => {
+						if (err) return handleError(err);
+						handleParent();
+						callback();
+					});
+					break;
+			}
+		},
+		err => {
+			if (err) return callback(err);
+			callback(undefined, keptAssets);
+		}
+	);
+};
+
+/** @type {WeakMap<Compilation, CleanPluginCompilationHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class CleanPlugin {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {CleanPluginCompilationHooks} the attached hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				/** @type {SyncBailHook<[string], boolean>} */
+				keep: new SyncBailHook(["ignore"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	/** @param {CleanOptions} options options */
+	constructor(options = {}) {
+		validate(options);
+		this.options = { dry: false, ...options };
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { dry, keep } = this.options;
+
+		const keepFn =
+			typeof keep === "function"
+				? keep
+				: typeof keep === "string"
+				? path => path.startsWith(keep)
+				: typeof keep === "object" && keep.test
+				? path => keep.test(path)
+				: () => false;
+
+		// We assume that no external modification happens while the compiler is active
+		// So we can store the old assets and only diff to them to avoid fs access on
+		// incremental builds
+		/** @type {undefined|Assets} */
+		let oldAssets;
+
+		compiler.hooks.emit.tapAsync(
+			{
+				name: "CleanPlugin",
+				stage: 100
+			},
+			(compilation, callback) => {
+				const hooks = CleanPlugin.getCompilationHooks(compilation);
+				const logger = compilation.getLogger("webpack.CleanPlugin");
+				const fs = compiler.outputFileSystem;
+
+				if (!fs.readdir) {
+					return callback(
+						new Error(
+							"CleanPlugin: Output filesystem doesn't support listing directories (readdir)"
+						)
+					);
+				}
+
+				/** @type {Assets} */
+				const currentAssets = new Map();
+				const now = Date.now();
+				for (const asset of Object.keys(compilation.assets)) {
+					if (/^[A-Za-z]:\\|^\/|^\\\\/.test(asset)) continue;
+					let normalizedAsset;
+					let newNormalizedAsset = asset.replace(/\\/g, "/");
+					do {
+						normalizedAsset = newNormalizedAsset;
+						newNormalizedAsset = normalizedAsset.replace(
+							/(^|\/)(?!\.\.)[^/]+\/\.\.\//g,
+							"$1"
+						);
+					} while (newNormalizedAsset !== normalizedAsset);
+					if (normalizedAsset.startsWith("../")) continue;
+					const assetInfo = compilation.assetsInfo.get(asset);
+					if (assetInfo && assetInfo.hotModuleReplacement) {
+						currentAssets.set(normalizedAsset, now + _10sec);
+					} else {
+						currentAssets.set(normalizedAsset, 0);
+					}
+				}
+
+				const outputPath = compilation.getPath(compiler.outputPath, {});
+
+				const isKept = path => {
+					const result = hooks.keep.call(path);
+					if (result !== undefined) return result;
+					return keepFn(path);
+				};
+
+				/**
+				 * @param {Error=} err err
+				 * @param {Set<string>=} diff diff
+				 */
+				const diffCallback = (err, diff) => {
+					if (err) {
+						oldAssets = undefined;
+						callback(err);
+						return;
+					}
+					applyDiff(
+						fs,
+						outputPath,
+						dry,
+						logger,
+						diff,
+						isKept,
+						(err, keptAssets) => {
+							if (err) {
+								oldAssets = undefined;
+							} else {
+								if (oldAssets) mergeAssets(currentAssets, oldAssets);
+								oldAssets = currentAssets;
+								if (keptAssets) mergeAssets(oldAssets, keptAssets);
+							}
+							callback(err);
+						}
+					);
+				};
+
+				if (oldAssets) {
+					diffCallback(null, getDiffToOldAssets(currentAssets, oldAssets));
+				} else {
+					getDiffToFs(fs, outputPath, currentAssets, diffCallback);
+				}
+			}
+		);
+	}
+}
+
+module.exports = CleanPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/CodeGenerationError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/CodeGenerationError.js
new file mode 100644
index 0000000..b1cf51d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/CodeGenerationError.js
@@ -0,0 +1,29 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Module")} Module */
+
+class CodeGenerationError extends WebpackError {
+	/**
+	 * Create a new CodeGenerationError
+	 * @param {Module} module related module
+	 * @param {Error} error Original error
+	 */
+	constructor(module, error) {
+		super();
+
+		this.name = "CodeGenerationError";
+		this.error = error;
+		this.message = error.message;
+		this.details = error.stack;
+		this.module = module;
+	}
+}
+
+module.exports = CodeGenerationError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/CodeGenerationResults.js b/node_modules/mathjs/examples/node_modules/webpack/lib/CodeGenerationResults.js
new file mode 100644
index 0000000..bea2045
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/CodeGenerationResults.js
@@ -0,0 +1,155 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { provide } = require("./util/MapHelpers");
+const { first } = require("./util/SetHelpers");
+const createHash = require("./util/createHash");
+const { runtimeToString, RuntimeSpecMap } = require("./util/runtime");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {typeof import("./util/Hash")} Hash */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+class CodeGenerationResults {
+	/**
+	 * @param {string | Hash} hashFunction the hash function to use
+	 */
+	constructor(hashFunction = "md4") {
+		/** @type {Map<Module, RuntimeSpecMap<CodeGenerationResult>>} */
+		this.map = new Map();
+		this._hashFunction = hashFunction;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime runtime(s)
+	 * @returns {CodeGenerationResult} the CodeGenerationResult
+	 */
+	get(module, runtime) {
+		const entry = this.map.get(module);
+		if (entry === undefined) {
+			throw new Error(
+				`No code generation entry for ${module.identifier()} (existing entries: ${Array.from(
+					this.map.keys(),
+					m => m.identifier()
+				).join(", ")})`
+			);
+		}
+		if (runtime === undefined) {
+			if (entry.size > 1) {
+				const results = new Set(entry.values());
+				if (results.size !== 1) {
+					throw new Error(
+						`No unique code generation entry for unspecified runtime for ${module.identifier()} (existing runtimes: ${Array.from(
+							entry.keys(),
+							r => runtimeToString(r)
+						).join(", ")}).
+Caller might not support runtime-dependent code generation (opt-out via optimization.usedExports: "global").`
+					);
+				}
+				return first(results);
+			}
+			return entry.values().next().value;
+		}
+		const result = entry.get(runtime);
+		if (result === undefined) {
+			throw new Error(
+				`No code generation entry for runtime ${runtimeToString(
+					runtime
+				)} for ${module.identifier()} (existing runtimes: ${Array.from(
+					entry.keys(),
+					r => runtimeToString(r)
+				).join(", ")})`
+			);
+		}
+		return result;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime runtime(s)
+	 * @returns {boolean} true, when we have data for this
+	 */
+	has(module, runtime) {
+		const entry = this.map.get(module);
+		if (entry === undefined) {
+			return false;
+		}
+		if (runtime !== undefined) {
+			return entry.has(runtime);
+		} else if (entry.size > 1) {
+			const results = new Set(entry.values());
+			return results.size === 1;
+		} else {
+			return entry.size === 1;
+		}
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime runtime(s)
+	 * @param {string} sourceType the source type
+	 * @returns {Source} a source
+	 */
+	getSource(module, runtime, sourceType) {
+		return this.get(module, runtime).sources.get(sourceType);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime runtime(s)
+	 * @returns {ReadonlySet<string>} runtime requirements
+	 */
+	getRuntimeRequirements(module, runtime) {
+		return this.get(module, runtime).runtimeRequirements;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime runtime(s)
+	 * @param {string} key data key
+	 * @returns {any} data generated by code generation
+	 */
+	getData(module, runtime, key) {
+		const data = this.get(module, runtime).data;
+		return data === undefined ? undefined : data.get(key);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime runtime(s)
+	 * @returns {any} hash of the code generation
+	 */
+	getHash(module, runtime) {
+		const info = this.get(module, runtime);
+		if (info.hash !== undefined) return info.hash;
+		const hash = createHash(this._hashFunction);
+		for (const [type, source] of info.sources) {
+			hash.update(type);
+			source.updateHash(hash);
+		}
+		if (info.runtimeRequirements) {
+			for (const rr of info.runtimeRequirements) hash.update(rr);
+		}
+		return (info.hash = /** @type {string} */ (hash.digest("hex")));
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime runtime(s)
+	 * @param {CodeGenerationResult} result result from module
+	 * @returns {void}
+	 */
+	add(module, runtime, result) {
+		const map = provide(this.map, module, () => new RuntimeSpecMap());
+		map.set(runtime, result);
+	}
+}
+
+module.exports = CodeGenerationResults;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/CommentCompilationWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/CommentCompilationWarning.js
new file mode 100644
index 0000000..335992f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/CommentCompilationWarning.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+
+class CommentCompilationWarning extends WebpackError {
+	/**
+	 *
+	 * @param {string} message warning message
+	 * @param {DependencyLocation} loc affected lines of code
+	 */
+	constructor(message, loc) {
+		super(message);
+
+		this.name = "CommentCompilationWarning";
+
+		this.loc = loc;
+	}
+}
+
+makeSerializable(
+	CommentCompilationWarning,
+	"webpack/lib/CommentCompilationWarning"
+);
+
+module.exports = CommentCompilationWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/CompatibilityPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/CompatibilityPlugin.js
new file mode 100644
index 0000000..54b04bf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/CompatibilityPlugin.js
@@ -0,0 +1,152 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ConstDependency = require("./dependencies/ConstDependency");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./javascript/JavascriptParser")} JavascriptParser */
+
+const nestedWebpackRequireTag = Symbol("nested __webpack_require__");
+
+class CompatibilityPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"CompatibilityPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					ConstDependency,
+					new ConstDependency.Template()
+				);
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("CompatibilityPlugin", (parser, parserOptions) => {
+						if (
+							parserOptions.browserify !== undefined &&
+							!parserOptions.browserify
+						)
+							return;
+
+						parser.hooks.call
+							.for("require")
+							.tap("CompatibilityPlugin", expr => {
+								// support for browserify style require delegator: "require(o, !0)"
+								if (expr.arguments.length !== 2) return;
+								const second = parser.evaluateExpression(expr.arguments[1]);
+								if (!second.isBoolean()) return;
+								if (second.asBool() !== true) return;
+								const dep = new ConstDependency("require", expr.callee.range);
+								dep.loc = expr.loc;
+								if (parser.state.current.dependencies.length > 0) {
+									const last =
+										parser.state.current.dependencies[
+											parser.state.current.dependencies.length - 1
+										];
+									if (
+										last.critical &&
+										last.options &&
+										last.options.request === "." &&
+										last.userRequest === "." &&
+										last.options.recursive
+									)
+										parser.state.current.dependencies.pop();
+								}
+								parser.state.module.addPresentationalDependency(dep);
+								return true;
+							});
+					});
+
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @returns {void}
+				 */
+				const handler = parser => {
+					// Handle nested requires
+					parser.hooks.preStatement.tap("CompatibilityPlugin", statement => {
+						if (
+							statement.type === "FunctionDeclaration" &&
+							statement.id &&
+							statement.id.name === "__webpack_require__"
+						) {
+							const newName = `__nested_webpack_require_${statement.range[0]}__`;
+							parser.tagVariable(statement.id.name, nestedWebpackRequireTag, {
+								name: newName,
+								declaration: {
+									updated: false,
+									loc: statement.id.loc,
+									range: statement.id.range
+								}
+							});
+							return true;
+						}
+					});
+					parser.hooks.pattern
+						.for("__webpack_require__")
+						.tap("CompatibilityPlugin", pattern => {
+							const newName = `__nested_webpack_require_${pattern.range[0]}__`;
+							parser.tagVariable(pattern.name, nestedWebpackRequireTag, {
+								name: newName,
+								declaration: {
+									updated: false,
+									loc: pattern.loc,
+									range: pattern.range
+								}
+							});
+							return true;
+						});
+					parser.hooks.expression
+						.for(nestedWebpackRequireTag)
+						.tap("CompatibilityPlugin", expr => {
+							const { name, declaration } = parser.currentTagData;
+							if (!declaration.updated) {
+								const dep = new ConstDependency(name, declaration.range);
+								dep.loc = declaration.loc;
+								parser.state.module.addPresentationalDependency(dep);
+								declaration.updated = true;
+							}
+							const dep = new ConstDependency(name, expr.range);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+
+					// Handle hashbang
+					parser.hooks.program.tap(
+						"CompatibilityPlugin",
+						(program, comments) => {
+							if (comments.length === 0) return;
+							const c = comments[0];
+							if (c.type === "Line" && c.range[0] === 0) {
+								if (parser.state.source.slice(0, 2).toString() !== "#!") return;
+								// this is a hashbang comment
+								const dep = new ConstDependency("//", 0);
+								dep.loc = c.loc;
+								parser.state.module.addPresentationalDependency(dep);
+							}
+						}
+					);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("CompatibilityPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("CompatibilityPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("CompatibilityPlugin", handler);
+			}
+		);
+	}
+}
+module.exports = CompatibilityPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Compilation.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Compilation.js
new file mode 100644
index 0000000..3048f0d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Compilation.js
@@ -0,0 +1,5292 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const {
+	HookMap,
+	SyncHook,
+	SyncBailHook,
+	SyncWaterfallHook,
+	AsyncSeriesHook,
+	AsyncSeriesBailHook,
+	AsyncParallelHook
+} = require("tapable");
+const util = require("util");
+const { CachedSource } = require("webpack-sources");
+const { MultiItemCache } = require("./CacheFacade");
+const Chunk = require("./Chunk");
+const ChunkGraph = require("./ChunkGraph");
+const ChunkGroup = require("./ChunkGroup");
+const ChunkRenderError = require("./ChunkRenderError");
+const ChunkTemplate = require("./ChunkTemplate");
+const CodeGenerationError = require("./CodeGenerationError");
+const CodeGenerationResults = require("./CodeGenerationResults");
+const Dependency = require("./Dependency");
+const DependencyTemplates = require("./DependencyTemplates");
+const Entrypoint = require("./Entrypoint");
+const ErrorHelpers = require("./ErrorHelpers");
+const FileSystemInfo = require("./FileSystemInfo");
+const {
+	connectChunkGroupAndChunk,
+	connectChunkGroupParentAndChild
+} = require("./GraphHelpers");
+const {
+	makeWebpackError,
+	tryRunOrWebpackError
+} = require("./HookWebpackError");
+const MainTemplate = require("./MainTemplate");
+const Module = require("./Module");
+const ModuleDependencyError = require("./ModuleDependencyError");
+const ModuleDependencyWarning = require("./ModuleDependencyWarning");
+const ModuleGraph = require("./ModuleGraph");
+const ModuleHashingError = require("./ModuleHashingError");
+const ModuleNotFoundError = require("./ModuleNotFoundError");
+const ModuleProfile = require("./ModuleProfile");
+const ModuleRestoreError = require("./ModuleRestoreError");
+const ModuleStoreError = require("./ModuleStoreError");
+const ModuleTemplate = require("./ModuleTemplate");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const RuntimeTemplate = require("./RuntimeTemplate");
+const Stats = require("./Stats");
+const WebpackError = require("./WebpackError");
+const buildChunkGraph = require("./buildChunkGraph");
+const BuildCycleError = require("./errors/BuildCycleError");
+const { Logger, LogType } = require("./logging/Logger");
+const StatsFactory = require("./stats/StatsFactory");
+const StatsPrinter = require("./stats/StatsPrinter");
+const { equals: arrayEquals } = require("./util/ArrayHelpers");
+const AsyncQueue = require("./util/AsyncQueue");
+const LazySet = require("./util/LazySet");
+const { provide } = require("./util/MapHelpers");
+const WeakTupleMap = require("./util/WeakTupleMap");
+const { cachedCleverMerge } = require("./util/cleverMerge");
+const {
+	compareLocations,
+	concatComparators,
+	compareSelect,
+	compareIds,
+	compareStringsNumeric,
+	compareModulesByIdentifier
+} = require("./util/comparators");
+const createHash = require("./util/createHash");
+const {
+	arrayToSetDeprecation,
+	soonFrozenObjectDeprecation,
+	createFakeHook
+} = require("./util/deprecation");
+const processAsyncTree = require("./util/processAsyncTree");
+const { getRuntimeKey } = require("./util/runtime");
+const { isSourceEqual } = require("./util/source");
+
+/** @template T @typedef {import("tapable").AsArray<T>} AsArray<T> */
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").EntryDescriptionNormalized} EntryDescription */
+/** @typedef {import("../declarations/WebpackOptions").OutputNormalized} OutputOptions */
+/** @typedef {import("../declarations/WebpackOptions").StatsOptions} StatsOptions */
+/** @typedef {import("../declarations/WebpackOptions").WebpackPluginFunction} WebpackPluginFunction */
+/** @typedef {import("../declarations/WebpackOptions").WebpackPluginInstance} WebpackPluginInstance */
+/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("./Cache")} Cache */
+/** @typedef {import("./CacheFacade")} CacheFacade */
+/** @typedef {import("./ChunkGroup").ChunkGroupOptions} ChunkGroupOptions */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Compiler").CompilationParams} CompilationParams */
+/** @typedef {import("./DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("./DependencyTemplate")} DependencyTemplate */
+/** @typedef {import("./Entrypoint").EntryOptions} EntryOptions */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./ModuleFactory")} ModuleFactory */
+/** @typedef {import("./ModuleFactory").ModuleFactoryCreateDataContextInfo} ModuleFactoryCreateDataContextInfo */
+/** @typedef {import("./ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./RuntimeModule")} RuntimeModule */
+/** @typedef {import("./Template").RenderManifestEntry} RenderManifestEntry */
+/** @typedef {import("./Template").RenderManifestOptions} RenderManifestOptions */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsAsset} StatsAsset */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsError} StatsError */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsModule} StatsModule */
+/** @typedef {import("./util/Hash")} Hash */
+/** @template T @typedef {import("./util/deprecation").FakeHook<T>} FakeHook<T> */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @callback Callback
+ * @param {(WebpackError | null)=} err
+ * @returns {void}
+ */
+
+/**
+ * @callback ModuleCallback
+ * @param {(WebpackError | null)=} err
+ * @param {Module=} result
+ * @returns {void}
+ */
+
+/**
+ * @callback ModuleFactoryResultCallback
+ * @param {(WebpackError | null)=} err
+ * @param {ModuleFactoryResult=} result
+ * @returns {void}
+ */
+
+/**
+ * @callback ModuleOrFactoryResultCallback
+ * @param {(WebpackError | null)=} err
+ * @param {Module | ModuleFactoryResult=} result
+ * @returns {void}
+ */
+
+/**
+ * @callback ExecuteModuleCallback
+ * @param {(WebpackError | null)=} err
+ * @param {ExecuteModuleResult=} result
+ * @returns {void}
+ */
+
+/**
+ * @callback DepBlockVarDependenciesCallback
+ * @param {Dependency} dependency
+ * @returns {any}
+ */
+
+/** @typedef {new (...args: any[]) => Dependency} DepConstructor */
+/** @typedef {Record<string, Source>} CompilationAssets */
+
+/**
+ * @typedef {Object} AvailableModulesChunkGroupMapping
+ * @property {ChunkGroup} chunkGroup
+ * @property {Set<Module>} availableModules
+ * @property {boolean} needCopy
+ */
+
+/**
+ * @typedef {Object} DependenciesBlockLike
+ * @property {Dependency[]} dependencies
+ * @property {AsyncDependenciesBlock[]} blocks
+ */
+
+/**
+ * @typedef {Object} ChunkPathData
+ * @property {string|number} id
+ * @property {string=} name
+ * @property {string} hash
+ * @property {function(number): string=} hashWithLength
+ * @property {(Record<string, string>)=} contentHash
+ * @property {(Record<string, (length: number) => string>)=} contentHashWithLength
+ */
+
+/**
+ * @typedef {Object} ChunkHashContext
+ * @property {CodeGenerationResults} codeGenerationResults results of code generation
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ */
+
+/**
+ * @typedef {Object} RuntimeRequirementsContext
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {CodeGenerationResults} codeGenerationResults the code generation results
+ */
+
+/**
+ * @typedef {Object} ExecuteModuleOptions
+ * @property {EntryOptions=} entryOptions
+ */
+
+/**
+ * @typedef {Object} ExecuteModuleResult
+ * @property {any} exports
+ * @property {boolean} cacheable
+ * @property {Map<string, { source: Source, info: AssetInfo }>} assets
+ * @property {LazySet<string>} fileDependencies
+ * @property {LazySet<string>} contextDependencies
+ * @property {LazySet<string>} missingDependencies
+ * @property {LazySet<string>} buildDependencies
+ */
+
+/**
+ * @typedef {Object} ExecuteModuleArgument
+ * @property {Module} module
+ * @property {{ id: string, exports: any, loaded: boolean }=} moduleObject
+ * @property {any} preparedInfo
+ * @property {CodeGenerationResult} codeGenerationResult
+ */
+
+/**
+ * @typedef {Object} ExecuteModuleContext
+ * @property {Map<string, { source: Source, info: AssetInfo }>} assets
+ * @property {Chunk} chunk
+ * @property {ChunkGraph} chunkGraph
+ * @property {function(string): any=} __webpack_require__
+ */
+
+/**
+ * @typedef {Object} EntryData
+ * @property {Dependency[]} dependencies dependencies of the entrypoint that should be evaluated at startup
+ * @property {Dependency[]} includeDependencies dependencies of the entrypoint that should be included but not evaluated
+ * @property {EntryOptions} options options of the entrypoint
+ */
+
+/**
+ * @typedef {Object} LogEntry
+ * @property {string} type
+ * @property {any[]} args
+ * @property {number} time
+ * @property {string[]=} trace
+ */
+
+/**
+ * @typedef {Object} KnownAssetInfo
+ * @property {boolean=} immutable true, if the asset can be long term cached forever (contains a hash)
+ * @property {boolean=} minimized whether the asset is minimized
+ * @property {string | string[]=} fullhash the value(s) of the full hash used for this asset
+ * @property {string | string[]=} chunkhash the value(s) of the chunk hash used for this asset
+ * @property {string | string[]=} modulehash the value(s) of the module hash used for this asset
+ * @property {string | string[]=} contenthash the value(s) of the content hash used for this asset
+ * @property {string=} sourceFilename when asset was created from a source file (potentially transformed), the original filename relative to compilation context
+ * @property {number=} size size in bytes, only set after asset has been emitted
+ * @property {boolean=} development true, when asset is only used for development and doesn't count towards user-facing assets
+ * @property {boolean=} hotModuleReplacement true, when asset ships data for updating an existing application (HMR)
+ * @property {boolean=} javascriptModule true, when asset is javascript and an ESM
+ * @property {Record<string, string | string[]>=} related object of pointers to other assets, keyed by type of relation (only points from parent to child)
+ */
+
+/** @typedef {KnownAssetInfo & Record<string, any>} AssetInfo */
+
+/**
+ * @typedef {Object} Asset
+ * @property {string} name the filename of the asset
+ * @property {Source} source source of the asset
+ * @property {AssetInfo} info info about the asset
+ */
+
+/**
+ * @typedef {Object} ModulePathData
+ * @property {string|number} id
+ * @property {string} hash
+ * @property {function(number): string=} hashWithLength
+ */
+
+/**
+ * @typedef {Object} PathData
+ * @property {ChunkGraph=} chunkGraph
+ * @property {string=} hash
+ * @property {function(number): string=} hashWithLength
+ * @property {(Chunk|ChunkPathData)=} chunk
+ * @property {(Module|ModulePathData)=} module
+ * @property {RuntimeSpec=} runtime
+ * @property {string=} filename
+ * @property {string=} basename
+ * @property {string=} query
+ * @property {string=} contentHashType
+ * @property {string=} contentHash
+ * @property {function(number): string=} contentHashWithLength
+ * @property {boolean=} noChunkHash
+ * @property {string=} url
+ */
+
+/**
+ * @typedef {Object} KnownNormalizedStatsOptions
+ * @property {string} context
+ * @property {RequestShortener} requestShortener
+ * @property {string} chunksSort
+ * @property {string} modulesSort
+ * @property {string} chunkModulesSort
+ * @property {string} nestedModulesSort
+ * @property {string} assetsSort
+ * @property {boolean} ids
+ * @property {boolean} cachedAssets
+ * @property {boolean} groupAssetsByEmitStatus
+ * @property {boolean} groupAssetsByPath
+ * @property {boolean} groupAssetsByExtension
+ * @property {number} assetsSpace
+ * @property {((value: string, asset: StatsAsset) => boolean)[]} excludeAssets
+ * @property {((name: string, module: StatsModule, type: "module" | "chunk" | "root-of-chunk" | "nested") => boolean)[]} excludeModules
+ * @property {((warning: StatsError, textValue: string) => boolean)[]} warningsFilter
+ * @property {boolean} cachedModules
+ * @property {boolean} orphanModules
+ * @property {boolean} dependentModules
+ * @property {boolean} runtimeModules
+ * @property {boolean} groupModulesByCacheStatus
+ * @property {boolean} groupModulesByLayer
+ * @property {boolean} groupModulesByAttributes
+ * @property {boolean} groupModulesByPath
+ * @property {boolean} groupModulesByExtension
+ * @property {boolean} groupModulesByType
+ * @property {boolean | "auto"} entrypoints
+ * @property {boolean} chunkGroups
+ * @property {boolean} chunkGroupAuxiliary
+ * @property {boolean} chunkGroupChildren
+ * @property {number} chunkGroupMaxAssets
+ * @property {number} modulesSpace
+ * @property {number} chunkModulesSpace
+ * @property {number} nestedModulesSpace
+ * @property {false|"none"|"error"|"warn"|"info"|"log"|"verbose"} logging
+ * @property {((value: string) => boolean)[]} loggingDebug
+ * @property {boolean} loggingTrace
+ * @property {any} _env
+ */
+
+/** @typedef {KnownNormalizedStatsOptions & Omit<StatsOptions, keyof KnownNormalizedStatsOptions> & Record<string, any>} NormalizedStatsOptions */
+
+/**
+ * @typedef {Object} KnownCreateStatsOptionsContext
+ * @property {boolean=} forToString
+ */
+
+/** @typedef {KnownCreateStatsOptionsContext & Record<string, any>} CreateStatsOptionsContext */
+
+/** @type {AssetInfo} */
+const EMPTY_ASSET_INFO = Object.freeze({});
+
+const esmDependencyCategory = "esm";
+// TODO webpack 6: remove
+const deprecatedNormalModuleLoaderHook = util.deprecate(
+	compilation => {
+		return require("./NormalModule").getCompilationHooks(compilation).loader;
+	},
+	"Compilation.hooks.normalModuleLoader was moved to NormalModule.getCompilationHooks(compilation).loader",
+	"DEP_WEBPACK_COMPILATION_NORMAL_MODULE_LOADER_HOOK"
+);
+
+// TODO webpack 6: remove
+const defineRemovedModuleTemplates = moduleTemplates => {
+	Object.defineProperties(moduleTemplates, {
+		asset: {
+			enumerable: false,
+			configurable: false,
+			get: () => {
+				throw new WebpackError(
+					"Compilation.moduleTemplates.asset has been removed"
+				);
+			}
+		},
+		webassembly: {
+			enumerable: false,
+			configurable: false,
+			get: () => {
+				throw new WebpackError(
+					"Compilation.moduleTemplates.webassembly has been removed"
+				);
+			}
+		}
+	});
+	moduleTemplates = undefined;
+};
+
+const byId = compareSelect(
+	/**
+	 * @param {Chunk} c chunk
+	 * @returns {number | string} id
+	 */ c => c.id,
+	compareIds
+);
+
+const byNameOrHash = concatComparators(
+	compareSelect(
+		/**
+		 * @param {Compilation} c compilation
+		 * @returns {string} name
+		 */
+		c => c.name,
+		compareIds
+	),
+	compareSelect(
+		/**
+		 * @param {Compilation} c compilation
+		 * @returns {string} hash
+		 */ c => c.fullHash,
+		compareIds
+	)
+);
+
+const byMessage = compareSelect(err => `${err.message}`, compareStringsNumeric);
+
+const byModule = compareSelect(
+	err => (err.module && err.module.identifier()) || "",
+	compareStringsNumeric
+);
+
+const byLocation = compareSelect(err => err.loc, compareLocations);
+
+const compareErrors = concatComparators(byModule, byLocation, byMessage);
+
+/** @type {WeakMap<Dependency, Module & { restoreFromUnsafeCache: Function } | null>} */
+const unsafeCacheDependencies = new WeakMap();
+
+/** @type {WeakMap<Module & { restoreFromUnsafeCache: Function }, object>} */
+const unsafeCacheData = new WeakMap();
+
+class Compilation {
+	/**
+	 * Creates an instance of Compilation.
+	 * @param {Compiler} compiler the compiler which created the compilation
+	 * @param {CompilationParams} params the compilation parameters
+	 */
+	constructor(compiler, params) {
+		this._backCompat = compiler._backCompat;
+
+		const getNormalModuleLoader = () => deprecatedNormalModuleLoaderHook(this);
+		/** @typedef {{ additionalAssets?: true | Function }} ProcessAssetsAdditionalOptions */
+		/** @type {AsyncSeriesHook<[CompilationAssets], ProcessAssetsAdditionalOptions>} */
+		const processAssetsHook = new AsyncSeriesHook(["assets"]);
+
+		let savedAssets = new Set();
+		const popNewAssets = assets => {
+			let newAssets = undefined;
+			for (const file of Object.keys(assets)) {
+				if (savedAssets.has(file)) continue;
+				if (newAssets === undefined) {
+					newAssets = Object.create(null);
+				}
+				newAssets[file] = assets[file];
+				savedAssets.add(file);
+			}
+			return newAssets;
+		};
+		processAssetsHook.intercept({
+			name: "Compilation",
+			call: () => {
+				savedAssets = new Set(Object.keys(this.assets));
+			},
+			register: tap => {
+				const { type, name } = tap;
+				const { fn, additionalAssets, ...remainingTap } = tap;
+				const additionalAssetsFn =
+					additionalAssets === true ? fn : additionalAssets;
+				const processedAssets = additionalAssetsFn ? new WeakSet() : undefined;
+				switch (type) {
+					case "sync":
+						if (additionalAssetsFn) {
+							this.hooks.processAdditionalAssets.tap(name, assets => {
+								if (processedAssets.has(this.assets))
+									additionalAssetsFn(assets);
+							});
+						}
+						return {
+							...remainingTap,
+							type: "async",
+							fn: (assets, callback) => {
+								try {
+									fn(assets);
+								} catch (e) {
+									return callback(e);
+								}
+								if (processedAssets !== undefined)
+									processedAssets.add(this.assets);
+								const newAssets = popNewAssets(assets);
+								if (newAssets !== undefined) {
+									this.hooks.processAdditionalAssets.callAsync(
+										newAssets,
+										callback
+									);
+									return;
+								}
+								callback();
+							}
+						};
+					case "async":
+						if (additionalAssetsFn) {
+							this.hooks.processAdditionalAssets.tapAsync(
+								name,
+								(assets, callback) => {
+									if (processedAssets.has(this.assets))
+										return additionalAssetsFn(assets, callback);
+									callback();
+								}
+							);
+						}
+						return {
+							...remainingTap,
+							fn: (assets, callback) => {
+								fn(assets, err => {
+									if (err) return callback(err);
+									if (processedAssets !== undefined)
+										processedAssets.add(this.assets);
+									const newAssets = popNewAssets(assets);
+									if (newAssets !== undefined) {
+										this.hooks.processAdditionalAssets.callAsync(
+											newAssets,
+											callback
+										);
+										return;
+									}
+									callback();
+								});
+							}
+						};
+					case "promise":
+						if (additionalAssetsFn) {
+							this.hooks.processAdditionalAssets.tapPromise(name, assets => {
+								if (processedAssets.has(this.assets))
+									return additionalAssetsFn(assets);
+								return Promise.resolve();
+							});
+						}
+						return {
+							...remainingTap,
+							fn: assets => {
+								const p = fn(assets);
+								if (!p || !p.then) return p;
+								return p.then(() => {
+									if (processedAssets !== undefined)
+										processedAssets.add(this.assets);
+									const newAssets = popNewAssets(assets);
+									if (newAssets !== undefined) {
+										return this.hooks.processAdditionalAssets.promise(
+											newAssets
+										);
+									}
+								});
+							}
+						};
+				}
+			}
+		});
+
+		/** @type {SyncHook<[CompilationAssets]>} */
+		const afterProcessAssetsHook = new SyncHook(["assets"]);
+
+		/**
+		 * @template T
+		 * @param {string} name name of the hook
+		 * @param {number} stage new stage
+		 * @param {function(): AsArray<T>} getArgs get old hook function args
+		 * @param {string=} code deprecation code (not deprecated when unset)
+		 * @returns {FakeHook<Pick<AsyncSeriesHook<T>, "tap" | "tapAsync" | "tapPromise" | "name">>} fake hook which redirects
+		 */
+		const createProcessAssetsHook = (name, stage, getArgs, code) => {
+			if (!this._backCompat && code) return undefined;
+			const errorMessage =
+				reason => `Can't automatically convert plugin using Compilation.hooks.${name} to Compilation.hooks.processAssets because ${reason}.
+BREAKING CHANGE: Asset processing hooks in Compilation has been merged into a single Compilation.hooks.processAssets hook.`;
+			const getOptions = options => {
+				if (typeof options === "string") options = { name: options };
+				if (options.stage) {
+					throw new Error(errorMessage("it's using the 'stage' option"));
+				}
+				return { ...options, stage: stage };
+			};
+			return createFakeHook(
+				{
+					name,
+					/** @type {AsyncSeriesHook<T>["intercept"]} */
+					intercept(interceptor) {
+						throw new Error(errorMessage("it's using 'intercept'"));
+					},
+					/** @type {AsyncSeriesHook<T>["tap"]} */
+					tap: (options, fn) => {
+						processAssetsHook.tap(getOptions(options), () => fn(...getArgs()));
+					},
+					/** @type {AsyncSeriesHook<T>["tapAsync"]} */
+					tapAsync: (options, fn) => {
+						processAssetsHook.tapAsync(
+							getOptions(options),
+							(assets, callback) =>
+								/** @type {any} */ (fn)(...getArgs(), callback)
+						);
+					},
+					/** @type {AsyncSeriesHook<T>["tapPromise"]} */
+					tapPromise: (options, fn) => {
+						processAssetsHook.tapPromise(getOptions(options), () =>
+							fn(...getArgs())
+						);
+					}
+				},
+				`${name} is deprecated (use Compilation.hooks.processAssets instead and use one of Compilation.PROCESS_ASSETS_STAGE_* as stage option)`,
+				code
+			);
+		};
+		this.hooks = Object.freeze({
+			/** @type {SyncHook<[Module]>} */
+			buildModule: new SyncHook(["module"]),
+			/** @type {SyncHook<[Module]>} */
+			rebuildModule: new SyncHook(["module"]),
+			/** @type {SyncHook<[Module, WebpackError]>} */
+			failedModule: new SyncHook(["module", "error"]),
+			/** @type {SyncHook<[Module]>} */
+			succeedModule: new SyncHook(["module"]),
+			/** @type {SyncHook<[Module]>} */
+			stillValidModule: new SyncHook(["module"]),
+
+			/** @type {SyncHook<[Dependency, EntryOptions]>} */
+			addEntry: new SyncHook(["entry", "options"]),
+			/** @type {SyncHook<[Dependency, EntryOptions, Error]>} */
+			failedEntry: new SyncHook(["entry", "options", "error"]),
+			/** @type {SyncHook<[Dependency, EntryOptions, Module]>} */
+			succeedEntry: new SyncHook(["entry", "options", "module"]),
+
+			/** @type {SyncWaterfallHook<[(string[] | ReferencedExport)[], Dependency, RuntimeSpec]>} */
+			dependencyReferencedExports: new SyncWaterfallHook([
+				"referencedExports",
+				"dependency",
+				"runtime"
+			]),
+
+			/** @type {SyncHook<[ExecuteModuleArgument, ExecuteModuleContext]>} */
+			executeModule: new SyncHook(["options", "context"]),
+			/** @type {AsyncParallelHook<[ExecuteModuleArgument, ExecuteModuleContext]>} */
+			prepareModuleExecution: new AsyncParallelHook(["options", "context"]),
+
+			/** @type {AsyncSeriesHook<[Iterable<Module>]>} */
+			finishModules: new AsyncSeriesHook(["modules"]),
+			/** @type {AsyncSeriesHook<[Module]>} */
+			finishRebuildingModule: new AsyncSeriesHook(["module"]),
+			/** @type {SyncHook<[]>} */
+			unseal: new SyncHook([]),
+			/** @type {SyncHook<[]>} */
+			seal: new SyncHook([]),
+
+			/** @type {SyncHook<[]>} */
+			beforeChunks: new SyncHook([]),
+			/** @type {SyncHook<[Iterable<Chunk>]>} */
+			afterChunks: new SyncHook(["chunks"]),
+
+			/** @type {SyncBailHook<[Iterable<Module>]>} */
+			optimizeDependencies: new SyncBailHook(["modules"]),
+			/** @type {SyncHook<[Iterable<Module>]>} */
+			afterOptimizeDependencies: new SyncHook(["modules"]),
+
+			/** @type {SyncHook<[]>} */
+			optimize: new SyncHook([]),
+			/** @type {SyncBailHook<[Iterable<Module>]>} */
+			optimizeModules: new SyncBailHook(["modules"]),
+			/** @type {SyncHook<[Iterable<Module>]>} */
+			afterOptimizeModules: new SyncHook(["modules"]),
+
+			/** @type {SyncBailHook<[Iterable<Chunk>, ChunkGroup[]]>} */
+			optimizeChunks: new SyncBailHook(["chunks", "chunkGroups"]),
+			/** @type {SyncHook<[Iterable<Chunk>, ChunkGroup[]]>} */
+			afterOptimizeChunks: new SyncHook(["chunks", "chunkGroups"]),
+
+			/** @type {AsyncSeriesHook<[Iterable<Chunk>, Iterable<Module>]>} */
+			optimizeTree: new AsyncSeriesHook(["chunks", "modules"]),
+			/** @type {SyncHook<[Iterable<Chunk>, Iterable<Module>]>} */
+			afterOptimizeTree: new SyncHook(["chunks", "modules"]),
+
+			/** @type {AsyncSeriesBailHook<[Iterable<Chunk>, Iterable<Module>]>} */
+			optimizeChunkModules: new AsyncSeriesBailHook(["chunks", "modules"]),
+			/** @type {SyncHook<[Iterable<Chunk>, Iterable<Module>]>} */
+			afterOptimizeChunkModules: new SyncHook(["chunks", "modules"]),
+			/** @type {SyncBailHook<[], boolean>} */
+			shouldRecord: new SyncBailHook([]),
+
+			/** @type {SyncHook<[Chunk, Set<string>, RuntimeRequirementsContext]>} */
+			additionalChunkRuntimeRequirements: new SyncHook([
+				"chunk",
+				"runtimeRequirements",
+				"context"
+			]),
+			/** @type {HookMap<SyncBailHook<[Chunk, Set<string>, RuntimeRequirementsContext]>>} */
+			runtimeRequirementInChunk: new HookMap(
+				() => new SyncBailHook(["chunk", "runtimeRequirements", "context"])
+			),
+			/** @type {SyncHook<[Module, Set<string>, RuntimeRequirementsContext]>} */
+			additionalModuleRuntimeRequirements: new SyncHook([
+				"module",
+				"runtimeRequirements",
+				"context"
+			]),
+			/** @type {HookMap<SyncBailHook<[Module, Set<string>, RuntimeRequirementsContext]>>} */
+			runtimeRequirementInModule: new HookMap(
+				() => new SyncBailHook(["module", "runtimeRequirements", "context"])
+			),
+			/** @type {SyncHook<[Chunk, Set<string>, RuntimeRequirementsContext]>} */
+			additionalTreeRuntimeRequirements: new SyncHook([
+				"chunk",
+				"runtimeRequirements",
+				"context"
+			]),
+			/** @type {HookMap<SyncBailHook<[Chunk, Set<string>, RuntimeRequirementsContext]>>} */
+			runtimeRequirementInTree: new HookMap(
+				() => new SyncBailHook(["chunk", "runtimeRequirements", "context"])
+			),
+
+			/** @type {SyncHook<[RuntimeModule, Chunk]>} */
+			runtimeModule: new SyncHook(["module", "chunk"]),
+
+			/** @type {SyncHook<[Iterable<Module>, any]>} */
+			reviveModules: new SyncHook(["modules", "records"]),
+			/** @type {SyncHook<[Iterable<Module>]>} */
+			beforeModuleIds: new SyncHook(["modules"]),
+			/** @type {SyncHook<[Iterable<Module>]>} */
+			moduleIds: new SyncHook(["modules"]),
+			/** @type {SyncHook<[Iterable<Module>]>} */
+			optimizeModuleIds: new SyncHook(["modules"]),
+			/** @type {SyncHook<[Iterable<Module>]>} */
+			afterOptimizeModuleIds: new SyncHook(["modules"]),
+
+			/** @type {SyncHook<[Iterable<Chunk>, any]>} */
+			reviveChunks: new SyncHook(["chunks", "records"]),
+			/** @type {SyncHook<[Iterable<Chunk>]>} */
+			beforeChunkIds: new SyncHook(["chunks"]),
+			/** @type {SyncHook<[Iterable<Chunk>]>} */
+			chunkIds: new SyncHook(["chunks"]),
+			/** @type {SyncHook<[Iterable<Chunk>]>} */
+			optimizeChunkIds: new SyncHook(["chunks"]),
+			/** @type {SyncHook<[Iterable<Chunk>]>} */
+			afterOptimizeChunkIds: new SyncHook(["chunks"]),
+
+			/** @type {SyncHook<[Iterable<Module>, any]>} */
+			recordModules: new SyncHook(["modules", "records"]),
+			/** @type {SyncHook<[Iterable<Chunk>, any]>} */
+			recordChunks: new SyncHook(["chunks", "records"]),
+
+			/** @type {SyncHook<[Iterable<Module>]>} */
+			optimizeCodeGeneration: new SyncHook(["modules"]),
+
+			/** @type {SyncHook<[]>} */
+			beforeModuleHash: new SyncHook([]),
+			/** @type {SyncHook<[]>} */
+			afterModuleHash: new SyncHook([]),
+
+			/** @type {SyncHook<[]>} */
+			beforeCodeGeneration: new SyncHook([]),
+			/** @type {SyncHook<[]>} */
+			afterCodeGeneration: new SyncHook([]),
+
+			/** @type {SyncHook<[]>} */
+			beforeRuntimeRequirements: new SyncHook([]),
+			/** @type {SyncHook<[]>} */
+			afterRuntimeRequirements: new SyncHook([]),
+
+			/** @type {SyncHook<[]>} */
+			beforeHash: new SyncHook([]),
+			/** @type {SyncHook<[Chunk]>} */
+			contentHash: new SyncHook(["chunk"]),
+			/** @type {SyncHook<[]>} */
+			afterHash: new SyncHook([]),
+			/** @type {SyncHook<[any]>} */
+			recordHash: new SyncHook(["records"]),
+			/** @type {SyncHook<[Compilation, any]>} */
+			record: new SyncHook(["compilation", "records"]),
+
+			/** @type {SyncHook<[]>} */
+			beforeModuleAssets: new SyncHook([]),
+			/** @type {SyncBailHook<[], boolean>} */
+			shouldGenerateChunkAssets: new SyncBailHook([]),
+			/** @type {SyncHook<[]>} */
+			beforeChunkAssets: new SyncHook([]),
+			// TODO webpack 6 remove
+			/** @deprecated */
+			additionalChunkAssets: createProcessAssetsHook(
+				"additionalChunkAssets",
+				Compilation.PROCESS_ASSETS_STAGE_ADDITIONAL,
+				() => [this.chunks],
+				"DEP_WEBPACK_COMPILATION_ADDITIONAL_CHUNK_ASSETS"
+			),
+
+			// TODO webpack 6 deprecate
+			/** @deprecated */
+			additionalAssets: createProcessAssetsHook(
+				"additionalAssets",
+				Compilation.PROCESS_ASSETS_STAGE_ADDITIONAL,
+				() => []
+			),
+			// TODO webpack 6 remove
+			/** @deprecated */
+			optimizeChunkAssets: createProcessAssetsHook(
+				"optimizeChunkAssets",
+				Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE,
+				() => [this.chunks],
+				"DEP_WEBPACK_COMPILATION_OPTIMIZE_CHUNK_ASSETS"
+			),
+			// TODO webpack 6 remove
+			/** @deprecated */
+			afterOptimizeChunkAssets: createProcessAssetsHook(
+				"afterOptimizeChunkAssets",
+				Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE + 1,
+				() => [this.chunks],
+				"DEP_WEBPACK_COMPILATION_AFTER_OPTIMIZE_CHUNK_ASSETS"
+			),
+			// TODO webpack 6 deprecate
+			/** @deprecated */
+			optimizeAssets: processAssetsHook,
+			// TODO webpack 6 deprecate
+			/** @deprecated */
+			afterOptimizeAssets: afterProcessAssetsHook,
+
+			processAssets: processAssetsHook,
+			afterProcessAssets: afterProcessAssetsHook,
+			/** @type {AsyncSeriesHook<[CompilationAssets]>} */
+			processAdditionalAssets: new AsyncSeriesHook(["assets"]),
+
+			/** @type {SyncBailHook<[], boolean>} */
+			needAdditionalSeal: new SyncBailHook([]),
+			/** @type {AsyncSeriesHook<[]>} */
+			afterSeal: new AsyncSeriesHook([]),
+
+			/** @type {SyncWaterfallHook<[RenderManifestEntry[], RenderManifestOptions]>} */
+			renderManifest: new SyncWaterfallHook(["result", "options"]),
+
+			/** @type {SyncHook<[Hash]>} */
+			fullHash: new SyncHook(["hash"]),
+			/** @type {SyncHook<[Chunk, Hash, ChunkHashContext]>} */
+			chunkHash: new SyncHook(["chunk", "chunkHash", "ChunkHashContext"]),
+
+			/** @type {SyncHook<[Module, string]>} */
+			moduleAsset: new SyncHook(["module", "filename"]),
+			/** @type {SyncHook<[Chunk, string]>} */
+			chunkAsset: new SyncHook(["chunk", "filename"]),
+
+			/** @type {SyncWaterfallHook<[string, object, AssetInfo]>} */
+			assetPath: new SyncWaterfallHook(["path", "options", "assetInfo"]),
+
+			/** @type {SyncBailHook<[], boolean>} */
+			needAdditionalPass: new SyncBailHook([]),
+
+			/** @type {SyncHook<[Compiler, string, number]>} */
+			childCompiler: new SyncHook([
+				"childCompiler",
+				"compilerName",
+				"compilerIndex"
+			]),
+
+			/** @type {SyncBailHook<[string, LogEntry], true>} */
+			log: new SyncBailHook(["origin", "logEntry"]),
+
+			/** @type {SyncWaterfallHook<[WebpackError[]]>} */
+			processWarnings: new SyncWaterfallHook(["warnings"]),
+			/** @type {SyncWaterfallHook<[WebpackError[]]>} */
+			processErrors: new SyncWaterfallHook(["errors"]),
+
+			/** @type {HookMap<SyncHook<[Partial<NormalizedStatsOptions>, CreateStatsOptionsContext]>>} */
+			statsPreset: new HookMap(() => new SyncHook(["options", "context"])),
+			/** @type {SyncHook<[Partial<NormalizedStatsOptions>, CreateStatsOptionsContext]>} */
+			statsNormalize: new SyncHook(["options", "context"]),
+			/** @type {SyncHook<[StatsFactory, NormalizedStatsOptions]>} */
+			statsFactory: new SyncHook(["statsFactory", "options"]),
+			/** @type {SyncHook<[StatsPrinter, NormalizedStatsOptions]>} */
+			statsPrinter: new SyncHook(["statsPrinter", "options"]),
+
+			get normalModuleLoader() {
+				return getNormalModuleLoader();
+			}
+		});
+		/** @type {string=} */
+		this.name = undefined;
+		this.startTime = undefined;
+		this.endTime = undefined;
+		/** @type {Compiler} */
+		this.compiler = compiler;
+		this.resolverFactory = compiler.resolverFactory;
+		this.inputFileSystem = compiler.inputFileSystem;
+		this.fileSystemInfo = new FileSystemInfo(this.inputFileSystem, {
+			managedPaths: compiler.managedPaths,
+			immutablePaths: compiler.immutablePaths,
+			logger: this.getLogger("webpack.FileSystemInfo"),
+			hashFunction: compiler.options.output.hashFunction
+		});
+		if (compiler.fileTimestamps) {
+			this.fileSystemInfo.addFileTimestamps(compiler.fileTimestamps, true);
+		}
+		if (compiler.contextTimestamps) {
+			this.fileSystemInfo.addContextTimestamps(
+				compiler.contextTimestamps,
+				true
+			);
+		}
+		/** @type {Map<string, string | Set<string>>} */
+		this.valueCacheVersions = new Map();
+		this.requestShortener = compiler.requestShortener;
+		this.compilerPath = compiler.compilerPath;
+
+		this.logger = this.getLogger("webpack.Compilation");
+
+		const options = compiler.options;
+		this.options = options;
+		this.outputOptions = options && options.output;
+		/** @type {boolean} */
+		this.bail = (options && options.bail) || false;
+		/** @type {boolean} */
+		this.profile = (options && options.profile) || false;
+
+		this.params = params;
+		this.mainTemplate = new MainTemplate(this.outputOptions, this);
+		this.chunkTemplate = new ChunkTemplate(this.outputOptions, this);
+		this.runtimeTemplate = new RuntimeTemplate(
+			this,
+			this.outputOptions,
+			this.requestShortener
+		);
+		/** @type {{javascript: ModuleTemplate}} */
+		this.moduleTemplates = {
+			javascript: new ModuleTemplate(this.runtimeTemplate, this)
+		};
+		defineRemovedModuleTemplates(this.moduleTemplates);
+
+		/** @type {Map<Module, WeakTupleMap<any, any>> | undefined} */
+		this.moduleMemCaches = undefined;
+		/** @type {Map<Module, WeakTupleMap<any, any>> | undefined} */
+		this.moduleMemCaches2 = undefined;
+		this.moduleGraph = new ModuleGraph();
+		/** @type {ChunkGraph} */
+		this.chunkGraph = undefined;
+		/** @type {CodeGenerationResults} */
+		this.codeGenerationResults = undefined;
+
+		/** @type {AsyncQueue<Module, Module, Module>} */
+		this.processDependenciesQueue = new AsyncQueue({
+			name: "processDependencies",
+			parallelism: options.parallelism || 100,
+			processor: this._processModuleDependencies.bind(this)
+		});
+		/** @type {AsyncQueue<Module, string, Module>} */
+		this.addModuleQueue = new AsyncQueue({
+			name: "addModule",
+			parent: this.processDependenciesQueue,
+			getKey: module => module.identifier(),
+			processor: this._addModule.bind(this)
+		});
+		/** @type {AsyncQueue<FactorizeModuleOptions, string, Module | ModuleFactoryResult>} */
+		this.factorizeQueue = new AsyncQueue({
+			name: "factorize",
+			parent: this.addModuleQueue,
+			processor: this._factorizeModule.bind(this)
+		});
+		/** @type {AsyncQueue<Module, Module, Module>} */
+		this.buildQueue = new AsyncQueue({
+			name: "build",
+			parent: this.factorizeQueue,
+			processor: this._buildModule.bind(this)
+		});
+		/** @type {AsyncQueue<Module, Module, Module>} */
+		this.rebuildQueue = new AsyncQueue({
+			name: "rebuild",
+			parallelism: options.parallelism || 100,
+			processor: this._rebuildModule.bind(this)
+		});
+
+		/**
+		 * Modules in value are building during the build of Module in key.
+		 * Means value blocking key from finishing.
+		 * Needed to detect build cycles.
+		 * @type {WeakMap<Module, Set<Module>>}
+		 */
+		this.creatingModuleDuringBuild = new WeakMap();
+
+		/** @type {Map<string, EntryData>} */
+		this.entries = new Map();
+		/** @type {EntryData} */
+		this.globalEntry = {
+			dependencies: [],
+			includeDependencies: [],
+			options: {
+				name: undefined
+			}
+		};
+		/** @type {Map<string, Entrypoint>} */
+		this.entrypoints = new Map();
+		/** @type {Entrypoint[]} */
+		this.asyncEntrypoints = [];
+		/** @type {Set<Chunk>} */
+		this.chunks = new Set();
+		/** @type {ChunkGroup[]} */
+		this.chunkGroups = [];
+		/** @type {Map<string, ChunkGroup>} */
+		this.namedChunkGroups = new Map();
+		/** @type {Map<string, Chunk>} */
+		this.namedChunks = new Map();
+		/** @type {Set<Module>} */
+		this.modules = new Set();
+		if (this._backCompat) {
+			arrayToSetDeprecation(this.chunks, "Compilation.chunks");
+			arrayToSetDeprecation(this.modules, "Compilation.modules");
+		}
+		/** @private @type {Map<string, Module>} */
+		this._modules = new Map();
+		this.records = null;
+		/** @type {string[]} */
+		this.additionalChunkAssets = [];
+		/** @type {CompilationAssets} */
+		this.assets = {};
+		/** @type {Map<string, AssetInfo>} */
+		this.assetsInfo = new Map();
+		/** @type {Map<string, Map<string, Set<string>>>} */
+		this._assetsRelatedIn = new Map();
+		/** @type {WebpackError[]} */
+		this.errors = [];
+		/** @type {WebpackError[]} */
+		this.warnings = [];
+		/** @type {Compilation[]} */
+		this.children = [];
+		/** @type {Map<string, LogEntry[]>} */
+		this.logging = new Map();
+		/** @type {Map<DepConstructor, ModuleFactory>} */
+		this.dependencyFactories = new Map();
+		/** @type {DependencyTemplates} */
+		this.dependencyTemplates = new DependencyTemplates(
+			this.outputOptions.hashFunction
+		);
+		this.childrenCounters = {};
+		/** @type {Set<number|string>} */
+		this.usedChunkIds = null;
+		/** @type {Set<number>} */
+		this.usedModuleIds = null;
+		/** @type {boolean} */
+		this.needAdditionalPass = false;
+		/** @type {Set<Module & { restoreFromUnsafeCache: Function }>} */
+		this._restoredUnsafeCacheModuleEntries = new Set();
+		/** @type {Map<string, Module & { restoreFromUnsafeCache: Function }>} */
+		this._restoredUnsafeCacheEntries = new Map();
+		/** @type {WeakSet<Module>} */
+		this.builtModules = new WeakSet();
+		/** @type {WeakSet<Module>} */
+		this.codeGeneratedModules = new WeakSet();
+		/** @type {WeakSet<Module>} */
+		this.buildTimeExecutedModules = new WeakSet();
+		/** @private @type {Map<Module, Callback[]>} */
+		this._rebuildingModules = new Map();
+		/** @type {Set<string>} */
+		this.emittedAssets = new Set();
+		/** @type {Set<string>} */
+		this.comparedForEmitAssets = new Set();
+		/** @type {LazySet<string>} */
+		this.fileDependencies = new LazySet();
+		/** @type {LazySet<string>} */
+		this.contextDependencies = new LazySet();
+		/** @type {LazySet<string>} */
+		this.missingDependencies = new LazySet();
+		/** @type {LazySet<string>} */
+		this.buildDependencies = new LazySet();
+		// TODO webpack 6 remove
+		this.compilationDependencies = {
+			add: util.deprecate(
+				item => this.fileDependencies.add(item),
+				"Compilation.compilationDependencies is deprecated (used Compilation.fileDependencies instead)",
+				"DEP_WEBPACK_COMPILATION_COMPILATION_DEPENDENCIES"
+			)
+		};
+
+		this._modulesCache = this.getCache("Compilation/modules");
+		this._assetsCache = this.getCache("Compilation/assets");
+		this._codeGenerationCache = this.getCache("Compilation/codeGeneration");
+
+		const unsafeCache = options.module.unsafeCache;
+		this._unsafeCache = !!unsafeCache;
+		this._unsafeCachePredicate =
+			typeof unsafeCache === "function" ? unsafeCache : () => true;
+	}
+
+	getStats() {
+		return new Stats(this);
+	}
+
+	/**
+	 * @param {StatsOptions | string} optionsOrPreset stats option value
+	 * @param {CreateStatsOptionsContext} context context
+	 * @returns {NormalizedStatsOptions} normalized options
+	 */
+	createStatsOptions(optionsOrPreset, context = {}) {
+		if (
+			typeof optionsOrPreset === "boolean" ||
+			typeof optionsOrPreset === "string"
+		) {
+			optionsOrPreset = { preset: optionsOrPreset };
+		}
+		if (typeof optionsOrPreset === "object" && optionsOrPreset !== null) {
+			// We use this method of shallow cloning this object to include
+			// properties in the prototype chain
+			/** @type {Partial<NormalizedStatsOptions>} */
+			const options = {};
+			for (const key in optionsOrPreset) {
+				options[key] = optionsOrPreset[key];
+			}
+			if (options.preset !== undefined) {
+				this.hooks.statsPreset.for(options.preset).call(options, context);
+			}
+			this.hooks.statsNormalize.call(options, context);
+			return /** @type {NormalizedStatsOptions} */ (options);
+		} else {
+			/** @type {Partial<NormalizedStatsOptions>} */
+			const options = {};
+			this.hooks.statsNormalize.call(options, context);
+			return /** @type {NormalizedStatsOptions} */ (options);
+		}
+	}
+
+	createStatsFactory(options) {
+		const statsFactory = new StatsFactory();
+		this.hooks.statsFactory.call(statsFactory, options);
+		return statsFactory;
+	}
+
+	createStatsPrinter(options) {
+		const statsPrinter = new StatsPrinter();
+		this.hooks.statsPrinter.call(statsPrinter, options);
+		return statsPrinter;
+	}
+
+	/**
+	 * @param {string} name cache name
+	 * @returns {CacheFacade} the cache facade instance
+	 */
+	getCache(name) {
+		return this.compiler.getCache(name);
+	}
+
+	/**
+	 * @param {string | (function(): string)} name name of the logger, or function called once to get the logger name
+	 * @returns {Logger} a logger with that name
+	 */
+	getLogger(name) {
+		if (!name) {
+			throw new TypeError("Compilation.getLogger(name) called without a name");
+		}
+		/** @type {LogEntry[] | undefined} */
+		let logEntries;
+		return new Logger(
+			(type, args) => {
+				if (typeof name === "function") {
+					name = name();
+					if (!name) {
+						throw new TypeError(
+							"Compilation.getLogger(name) called with a function not returning a name"
+						);
+					}
+				}
+				let trace;
+				switch (type) {
+					case LogType.warn:
+					case LogType.error:
+					case LogType.trace:
+						trace = ErrorHelpers.cutOffLoaderExecution(new Error("Trace").stack)
+							.split("\n")
+							.slice(3);
+						break;
+				}
+				/** @type {LogEntry} */
+				const logEntry = {
+					time: Date.now(),
+					type,
+					args,
+					trace
+				};
+				if (this.hooks.log.call(name, logEntry) === undefined) {
+					if (logEntry.type === LogType.profileEnd) {
+						// eslint-disable-next-line node/no-unsupported-features/node-builtins
+						if (typeof console.profileEnd === "function") {
+							// eslint-disable-next-line node/no-unsupported-features/node-builtins
+							console.profileEnd(`[${name}] ${logEntry.args[0]}`);
+						}
+					}
+					if (logEntries === undefined) {
+						logEntries = this.logging.get(name);
+						if (logEntries === undefined) {
+							logEntries = [];
+							this.logging.set(name, logEntries);
+						}
+					}
+					logEntries.push(logEntry);
+					if (logEntry.type === LogType.profile) {
+						// eslint-disable-next-line node/no-unsupported-features/node-builtins
+						if (typeof console.profile === "function") {
+							// eslint-disable-next-line node/no-unsupported-features/node-builtins
+							console.profile(`[${name}] ${logEntry.args[0]}`);
+						}
+					}
+				}
+			},
+			childName => {
+				if (typeof name === "function") {
+					if (typeof childName === "function") {
+						return this.getLogger(() => {
+							if (typeof name === "function") {
+								name = name();
+								if (!name) {
+									throw new TypeError(
+										"Compilation.getLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							if (typeof childName === "function") {
+								childName = childName();
+								if (!childName) {
+									throw new TypeError(
+										"Logger.getChildLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							return `${name}/${childName}`;
+						});
+					} else {
+						return this.getLogger(() => {
+							if (typeof name === "function") {
+								name = name();
+								if (!name) {
+									throw new TypeError(
+										"Compilation.getLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							return `${name}/${childName}`;
+						});
+					}
+				} else {
+					if (typeof childName === "function") {
+						return this.getLogger(() => {
+							if (typeof childName === "function") {
+								childName = childName();
+								if (!childName) {
+									throw new TypeError(
+										"Logger.getChildLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							return `${name}/${childName}`;
+						});
+					} else {
+						return this.getLogger(`${name}/${childName}`);
+					}
+				}
+			}
+		);
+	}
+
+	/**
+	 * @param {Module} module module to be added that was created
+	 * @param {ModuleCallback} callback returns the module in the compilation,
+	 * it could be the passed one (if new), or an already existing in the compilation
+	 * @returns {void}
+	 */
+	addModule(module, callback) {
+		this.addModuleQueue.add(module, callback);
+	}
+
+	/**
+	 * @param {Module} module module to be added that was created
+	 * @param {ModuleCallback} callback returns the module in the compilation,
+	 * it could be the passed one (if new), or an already existing in the compilation
+	 * @returns {void}
+	 */
+	_addModule(module, callback) {
+		const identifier = module.identifier();
+		const alreadyAddedModule = this._modules.get(identifier);
+		if (alreadyAddedModule) {
+			return callback(null, alreadyAddedModule);
+		}
+
+		const currentProfile = this.profile
+			? this.moduleGraph.getProfile(module)
+			: undefined;
+		if (currentProfile !== undefined) {
+			currentProfile.markRestoringStart();
+		}
+
+		this._modulesCache.get(identifier, null, (err, cacheModule) => {
+			if (err) return callback(new ModuleRestoreError(module, err));
+
+			if (currentProfile !== undefined) {
+				currentProfile.markRestoringEnd();
+				currentProfile.markIntegrationStart();
+			}
+
+			if (cacheModule) {
+				cacheModule.updateCacheModule(module);
+
+				module = cacheModule;
+			}
+			this._modules.set(identifier, module);
+			this.modules.add(module);
+			if (this._backCompat)
+				ModuleGraph.setModuleGraphForModule(module, this.moduleGraph);
+			if (currentProfile !== undefined) {
+				currentProfile.markIntegrationEnd();
+			}
+			callback(null, module);
+		});
+	}
+
+	/**
+	 * Fetches a module from a compilation by its identifier
+	 * @param {Module} module the module provided
+	 * @returns {Module} the module requested
+	 */
+	getModule(module) {
+		const identifier = module.identifier();
+		return this._modules.get(identifier);
+	}
+
+	/**
+	 * Attempts to search for a module by its identifier
+	 * @param {string} identifier identifier (usually path) for module
+	 * @returns {Module|undefined} attempt to search for module and return it, else undefined
+	 */
+	findModule(identifier) {
+		return this._modules.get(identifier);
+	}
+
+	/**
+	 * Schedules a build of the module object
+	 *
+	 * @param {Module} module module to be built
+	 * @param {ModuleCallback} callback the callback
+	 * @returns {void}
+	 */
+	buildModule(module, callback) {
+		this.buildQueue.add(module, callback);
+	}
+
+	/**
+	 * Builds the module object
+	 *
+	 * @param {Module} module module to be built
+	 * @param {ModuleCallback} callback the callback
+	 * @returns {void}
+	 */
+	_buildModule(module, callback) {
+		const currentProfile = this.profile
+			? this.moduleGraph.getProfile(module)
+			: undefined;
+		if (currentProfile !== undefined) {
+			currentProfile.markBuildingStart();
+		}
+
+		module.needBuild(
+			{
+				compilation: this,
+				fileSystemInfo: this.fileSystemInfo,
+				valueCacheVersions: this.valueCacheVersions
+			},
+			(err, needBuild) => {
+				if (err) return callback(err);
+
+				if (!needBuild) {
+					if (currentProfile !== undefined) {
+						currentProfile.markBuildingEnd();
+					}
+					this.hooks.stillValidModule.call(module);
+					return callback();
+				}
+
+				this.hooks.buildModule.call(module);
+				this.builtModules.add(module);
+				module.build(
+					this.options,
+					this,
+					this.resolverFactory.get("normal", module.resolveOptions),
+					this.inputFileSystem,
+					err => {
+						if (currentProfile !== undefined) {
+							currentProfile.markBuildingEnd();
+						}
+						if (err) {
+							this.hooks.failedModule.call(module, err);
+							return callback(err);
+						}
+						if (currentProfile !== undefined) {
+							currentProfile.markStoringStart();
+						}
+						this._modulesCache.store(module.identifier(), null, module, err => {
+							if (currentProfile !== undefined) {
+								currentProfile.markStoringEnd();
+							}
+							if (err) {
+								this.hooks.failedModule.call(module, err);
+								return callback(new ModuleStoreError(module, err));
+							}
+							this.hooks.succeedModule.call(module);
+							return callback();
+						});
+					}
+				);
+			}
+		);
+	}
+
+	/**
+	 * @param {Module} module to be processed for deps
+	 * @param {ModuleCallback} callback callback to be triggered
+	 * @returns {void}
+	 */
+	processModuleDependencies(module, callback) {
+		this.processDependenciesQueue.add(module, callback);
+	}
+
+	/**
+	 * @param {Module} module to be processed for deps
+	 * @returns {void}
+	 */
+	processModuleDependenciesNonRecursive(module) {
+		const processDependenciesBlock = block => {
+			if (block.dependencies) {
+				let i = 0;
+				for (const dep of block.dependencies) {
+					this.moduleGraph.setParents(dep, block, module, i++);
+				}
+			}
+			if (block.blocks) {
+				for (const b of block.blocks) processDependenciesBlock(b);
+			}
+		};
+
+		processDependenciesBlock(module);
+	}
+
+	/**
+	 * @param {Module} module to be processed for deps
+	 * @param {ModuleCallback} callback callback to be triggered
+	 * @returns {void}
+	 */
+	_processModuleDependencies(module, callback) {
+		/** @type {Array<{factory: ModuleFactory, dependencies: Dependency[], originModule: Module|null}>} */
+		const sortedDependencies = [];
+
+		/** @type {DependenciesBlock} */
+		let currentBlock;
+
+		/** @type {Map<ModuleFactory, Map<string, Dependency[]>>} */
+		let dependencies;
+		/** @type {DepConstructor} */
+		let factoryCacheKey;
+		/** @type {ModuleFactory} */
+		let factoryCacheKey2;
+		/** @type {Map<string, Dependency[]>} */
+		let factoryCacheValue;
+		/** @type {string} */
+		let listCacheKey1;
+		/** @type {string} */
+		let listCacheKey2;
+		/** @type {Dependency[]} */
+		let listCacheValue;
+
+		let inProgressSorting = 1;
+		let inProgressTransitive = 1;
+
+		const onDependenciesSorted = err => {
+			if (err) return callback(err);
+
+			// early exit without changing parallelism back and forth
+			if (sortedDependencies.length === 0 && inProgressTransitive === 1) {
+				return callback();
+			}
+
+			// This is nested so we need to allow one additional task
+			this.processDependenciesQueue.increaseParallelism();
+
+			for (const item of sortedDependencies) {
+				inProgressTransitive++;
+				this.handleModuleCreation(item, err => {
+					// In V8, the Error objects keep a reference to the functions on the stack. These warnings &
+					// errors are created inside closures that keep a reference to the Compilation, so errors are
+					// leaking the Compilation object.
+					if (err && this.bail) {
+						if (inProgressTransitive <= 0) return;
+						inProgressTransitive = -1;
+						// eslint-disable-next-line no-self-assign
+						err.stack = err.stack;
+						onTransitiveTasksFinished(err);
+						return;
+					}
+					if (--inProgressTransitive === 0) onTransitiveTasksFinished();
+				});
+			}
+			if (--inProgressTransitive === 0) onTransitiveTasksFinished();
+		};
+
+		const onTransitiveTasksFinished = err => {
+			if (err) return callback(err);
+			this.processDependenciesQueue.decreaseParallelism();
+
+			return callback();
+		};
+
+		/**
+		 * @param {Dependency} dep dependency
+		 * @param {number} index index in block
+		 * @returns {void}
+		 */
+		const processDependency = (dep, index) => {
+			this.moduleGraph.setParents(dep, currentBlock, module, index);
+			if (this._unsafeCache) {
+				try {
+					const unsafeCachedModule = unsafeCacheDependencies.get(dep);
+					if (unsafeCachedModule === null) return;
+					if (unsafeCachedModule !== undefined) {
+						if (
+							this._restoredUnsafeCacheModuleEntries.has(unsafeCachedModule)
+						) {
+							this._handleExistingModuleFromUnsafeCache(
+								module,
+								dep,
+								unsafeCachedModule
+							);
+							return;
+						}
+						const identifier = unsafeCachedModule.identifier();
+						const cachedModule =
+							this._restoredUnsafeCacheEntries.get(identifier);
+						if (cachedModule !== undefined) {
+							// update unsafe cache to new module
+							unsafeCacheDependencies.set(dep, cachedModule);
+							this._handleExistingModuleFromUnsafeCache(
+								module,
+								dep,
+								cachedModule
+							);
+							return;
+						}
+						inProgressSorting++;
+						this._modulesCache.get(identifier, null, (err, cachedModule) => {
+							if (err) {
+								if (inProgressSorting <= 0) return;
+								inProgressSorting = -1;
+								onDependenciesSorted(err);
+								return;
+							}
+							try {
+								if (!this._restoredUnsafeCacheEntries.has(identifier)) {
+									const data = unsafeCacheData.get(cachedModule);
+									if (data === undefined) {
+										processDependencyForResolving(dep);
+										if (--inProgressSorting === 0) onDependenciesSorted();
+										return;
+									}
+									if (cachedModule !== unsafeCachedModule) {
+										unsafeCacheDependencies.set(dep, cachedModule);
+									}
+									cachedModule.restoreFromUnsafeCache(
+										data,
+										this.params.normalModuleFactory,
+										this.params
+									);
+									this._restoredUnsafeCacheEntries.set(
+										identifier,
+										cachedModule
+									);
+									this._restoredUnsafeCacheModuleEntries.add(cachedModule);
+									if (!this.modules.has(cachedModule)) {
+										inProgressTransitive++;
+										this._handleNewModuleFromUnsafeCache(
+											module,
+											dep,
+											cachedModule,
+											err => {
+												if (err) {
+													if (inProgressTransitive <= 0) return;
+													inProgressTransitive = -1;
+													onTransitiveTasksFinished(err);
+												}
+												if (--inProgressTransitive === 0)
+													return onTransitiveTasksFinished();
+											}
+										);
+										if (--inProgressSorting === 0) onDependenciesSorted();
+										return;
+									}
+								}
+								if (unsafeCachedModule !== cachedModule) {
+									unsafeCacheDependencies.set(dep, cachedModule);
+								}
+								this._handleExistingModuleFromUnsafeCache(
+									module,
+									dep,
+									cachedModule
+								); // a3
+							} catch (err) {
+								if (inProgressSorting <= 0) return;
+								inProgressSorting = -1;
+								onDependenciesSorted(err);
+								return;
+							}
+							if (--inProgressSorting === 0) onDependenciesSorted();
+						});
+						return;
+					}
+				} catch (e) {
+					console.error(e);
+				}
+			}
+			processDependencyForResolving(dep);
+		};
+
+		/**
+		 * @param {Dependency} dep dependency
+		 * @returns {void}
+		 */
+		const processDependencyForResolving = dep => {
+			const resourceIdent = dep.getResourceIdentifier();
+			if (resourceIdent !== undefined && resourceIdent !== null) {
+				const category = dep.category;
+				const constructor = /** @type {DepConstructor} */ (dep.constructor);
+				if (factoryCacheKey === constructor) {
+					// Fast path 1: same constructor as prev item
+					if (listCacheKey1 === category && listCacheKey2 === resourceIdent) {
+						// Super fast path 1: also same resource
+						listCacheValue.push(dep);
+						return;
+					}
+				} else {
+					const factory = this.dependencyFactories.get(constructor);
+					if (factory === undefined) {
+						throw new Error(
+							`No module factory available for dependency type: ${constructor.name}`
+						);
+					}
+					if (factoryCacheKey2 === factory) {
+						// Fast path 2: same factory as prev item
+						factoryCacheKey = constructor;
+						if (listCacheKey1 === category && listCacheKey2 === resourceIdent) {
+							// Super fast path 2: also same resource
+							listCacheValue.push(dep);
+							return;
+						}
+					} else {
+						// Slow path
+						if (factoryCacheKey2 !== undefined) {
+							// Archive last cache entry
+							if (dependencies === undefined) dependencies = new Map();
+							dependencies.set(factoryCacheKey2, factoryCacheValue);
+							factoryCacheValue = dependencies.get(factory);
+							if (factoryCacheValue === undefined) {
+								factoryCacheValue = new Map();
+							}
+						} else {
+							factoryCacheValue = new Map();
+						}
+						factoryCacheKey = constructor;
+						factoryCacheKey2 = factory;
+					}
+				}
+				// Here webpack is using heuristic that assumes
+				// mostly esm dependencies would be used
+				// so we don't allocate extra string for them
+				const cacheKey =
+					category === esmDependencyCategory
+						? resourceIdent
+						: `${category}${resourceIdent}`;
+				let list = factoryCacheValue.get(cacheKey);
+				if (list === undefined) {
+					factoryCacheValue.set(cacheKey, (list = []));
+					sortedDependencies.push({
+						factory: factoryCacheKey2,
+						dependencies: list,
+						originModule: module
+					});
+				}
+				list.push(dep);
+				listCacheKey1 = category;
+				listCacheKey2 = resourceIdent;
+				listCacheValue = list;
+			}
+		};
+
+		try {
+			/** @type {DependenciesBlock[]} */
+			const queue = [module];
+			do {
+				const block = queue.pop();
+				if (block.dependencies) {
+					currentBlock = block;
+					let i = 0;
+					for (const dep of block.dependencies) processDependency(dep, i++);
+				}
+				if (block.blocks) {
+					for (const b of block.blocks) queue.push(b);
+				}
+			} while (queue.length !== 0);
+		} catch (e) {
+			return callback(e);
+		}
+
+		if (--inProgressSorting === 0) onDependenciesSorted();
+	}
+
+	_handleNewModuleFromUnsafeCache(originModule, dependency, module, callback) {
+		const moduleGraph = this.moduleGraph;
+
+		moduleGraph.setResolvedModule(originModule, dependency, module);
+
+		moduleGraph.setIssuerIfUnset(
+			module,
+			originModule !== undefined ? originModule : null
+		);
+
+		this._modules.set(module.identifier(), module);
+		this.modules.add(module);
+		if (this._backCompat)
+			ModuleGraph.setModuleGraphForModule(module, this.moduleGraph);
+
+		this._handleModuleBuildAndDependencies(
+			originModule,
+			module,
+			true,
+			callback
+		);
+	}
+
+	_handleExistingModuleFromUnsafeCache(originModule, dependency, module) {
+		const moduleGraph = this.moduleGraph;
+
+		moduleGraph.setResolvedModule(originModule, dependency, module);
+	}
+
+	/**
+	 * @typedef {Object} HandleModuleCreationOptions
+	 * @property {ModuleFactory} factory
+	 * @property {Dependency[]} dependencies
+	 * @property {Module | null} originModule
+	 * @property {Partial<ModuleFactoryCreateDataContextInfo>=} contextInfo
+	 * @property {string=} context
+	 * @property {boolean=} recursive recurse into dependencies of the created module
+	 * @property {boolean=} connectOrigin connect the resolved module with the origin module
+	 */
+
+	/**
+	 * @param {HandleModuleCreationOptions} options options object
+	 * @param {ModuleCallback} callback callback
+	 * @returns {void}
+	 */
+	handleModuleCreation(
+		{
+			factory,
+			dependencies,
+			originModule,
+			contextInfo,
+			context,
+			recursive = true,
+			connectOrigin = recursive
+		},
+		callback
+	) {
+		const moduleGraph = this.moduleGraph;
+
+		const currentProfile = this.profile ? new ModuleProfile() : undefined;
+
+		this.factorizeModule(
+			{
+				currentProfile,
+				factory,
+				dependencies,
+				factoryResult: true,
+				originModule,
+				contextInfo,
+				context
+			},
+			(err, factoryResult) => {
+				const applyFactoryResultDependencies = () => {
+					const { fileDependencies, contextDependencies, missingDependencies } =
+						factoryResult;
+					if (fileDependencies) {
+						this.fileDependencies.addAll(fileDependencies);
+					}
+					if (contextDependencies) {
+						this.contextDependencies.addAll(contextDependencies);
+					}
+					if (missingDependencies) {
+						this.missingDependencies.addAll(missingDependencies);
+					}
+				};
+				if (err) {
+					if (factoryResult) applyFactoryResultDependencies();
+					if (dependencies.every(d => d.optional)) {
+						this.warnings.push(err);
+						return callback();
+					} else {
+						this.errors.push(err);
+						return callback(err);
+					}
+				}
+
+				const newModule = factoryResult.module;
+
+				if (!newModule) {
+					applyFactoryResultDependencies();
+					return callback();
+				}
+
+				if (currentProfile !== undefined) {
+					moduleGraph.setProfile(newModule, currentProfile);
+				}
+
+				this.addModule(newModule, (err, module) => {
+					if (err) {
+						applyFactoryResultDependencies();
+						if (!err.module) {
+							err.module = module;
+						}
+						this.errors.push(err);
+
+						return callback(err);
+					}
+
+					if (
+						this._unsafeCache &&
+						factoryResult.cacheable !== false &&
+						/** @type {any} */ (module).restoreFromUnsafeCache &&
+						this._unsafeCachePredicate(module)
+					) {
+						const unsafeCacheableModule =
+							/** @type {Module & { restoreFromUnsafeCache: Function }} */ (
+								module
+							);
+						for (let i = 0; i < dependencies.length; i++) {
+							const dependency = dependencies[i];
+							moduleGraph.setResolvedModule(
+								connectOrigin ? originModule : null,
+								dependency,
+								unsafeCacheableModule
+							);
+							unsafeCacheDependencies.set(dependency, unsafeCacheableModule);
+						}
+						if (!unsafeCacheData.has(unsafeCacheableModule)) {
+							unsafeCacheData.set(
+								unsafeCacheableModule,
+								unsafeCacheableModule.getUnsafeCacheData()
+							);
+						}
+					} else {
+						applyFactoryResultDependencies();
+						for (let i = 0; i < dependencies.length; i++) {
+							const dependency = dependencies[i];
+							moduleGraph.setResolvedModule(
+								connectOrigin ? originModule : null,
+								dependency,
+								module
+							);
+						}
+					}
+
+					moduleGraph.setIssuerIfUnset(
+						module,
+						originModule !== undefined ? originModule : null
+					);
+					if (module !== newModule) {
+						if (currentProfile !== undefined) {
+							const otherProfile = moduleGraph.getProfile(module);
+							if (otherProfile !== undefined) {
+								currentProfile.mergeInto(otherProfile);
+							} else {
+								moduleGraph.setProfile(module, currentProfile);
+							}
+						}
+					}
+
+					this._handleModuleBuildAndDependencies(
+						originModule,
+						module,
+						recursive,
+						callback
+					);
+				});
+			}
+		);
+	}
+
+	_handleModuleBuildAndDependencies(originModule, module, recursive, callback) {
+		// Check for cycles when build is trigger inside another build
+		let creatingModuleDuringBuildSet = undefined;
+		if (!recursive && this.buildQueue.isProcessing(originModule)) {
+			// Track build dependency
+			creatingModuleDuringBuildSet =
+				this.creatingModuleDuringBuild.get(originModule);
+			if (creatingModuleDuringBuildSet === undefined) {
+				creatingModuleDuringBuildSet = new Set();
+				this.creatingModuleDuringBuild.set(
+					originModule,
+					creatingModuleDuringBuildSet
+				);
+			}
+			creatingModuleDuringBuildSet.add(module);
+
+			// When building is blocked by another module
+			// search for a cycle, cancel the cycle by throwing
+			// an error (otherwise this would deadlock)
+			const blockReasons = this.creatingModuleDuringBuild.get(module);
+			if (blockReasons !== undefined) {
+				const set = new Set(blockReasons);
+				for (const item of set) {
+					const blockReasons = this.creatingModuleDuringBuild.get(item);
+					if (blockReasons !== undefined) {
+						for (const m of blockReasons) {
+							if (m === module) {
+								return callback(new BuildCycleError(module));
+							}
+							set.add(m);
+						}
+					}
+				}
+			}
+		}
+
+		this.buildModule(module, err => {
+			if (creatingModuleDuringBuildSet !== undefined) {
+				creatingModuleDuringBuildSet.delete(module);
+			}
+			if (err) {
+				if (!err.module) {
+					err.module = module;
+				}
+				this.errors.push(err);
+
+				return callback(err);
+			}
+
+			if (!recursive) {
+				this.processModuleDependenciesNonRecursive(module);
+				callback(null, module);
+				return;
+			}
+
+			// This avoids deadlocks for circular dependencies
+			if (this.processDependenciesQueue.isProcessing(module)) {
+				return callback();
+			}
+
+			this.processModuleDependencies(module, err => {
+				if (err) {
+					return callback(err);
+				}
+				callback(null, module);
+			});
+		});
+	}
+
+	/**
+	 * @param {FactorizeModuleOptions} options options object
+	 * @param {ModuleOrFactoryResultCallback} callback callback
+	 * @returns {void}
+	 */
+	_factorizeModule(
+		{
+			currentProfile,
+			factory,
+			dependencies,
+			originModule,
+			factoryResult,
+			contextInfo,
+			context
+		},
+		callback
+	) {
+		if (currentProfile !== undefined) {
+			currentProfile.markFactoryStart();
+		}
+		factory.create(
+			{
+				contextInfo: {
+					issuer: originModule ? originModule.nameForCondition() : "",
+					issuerLayer: originModule ? originModule.layer : null,
+					compiler: this.compiler.name,
+					...contextInfo
+				},
+				resolveOptions: originModule ? originModule.resolveOptions : undefined,
+				context: context
+					? context
+					: originModule
+					? originModule.context
+					: this.compiler.context,
+				dependencies: dependencies
+			},
+			(err, result) => {
+				if (result) {
+					// TODO webpack 6: remove
+					// For backward-compat
+					if (result.module === undefined && result instanceof Module) {
+						result = {
+							module: result
+						};
+					}
+					if (!factoryResult) {
+						const {
+							fileDependencies,
+							contextDependencies,
+							missingDependencies
+						} = result;
+						if (fileDependencies) {
+							this.fileDependencies.addAll(fileDependencies);
+						}
+						if (contextDependencies) {
+							this.contextDependencies.addAll(contextDependencies);
+						}
+						if (missingDependencies) {
+							this.missingDependencies.addAll(missingDependencies);
+						}
+					}
+				}
+				if (err) {
+					const notFoundError = new ModuleNotFoundError(
+						originModule,
+						err,
+						dependencies.map(d => d.loc).filter(Boolean)[0]
+					);
+					return callback(notFoundError, factoryResult ? result : undefined);
+				}
+				if (!result) {
+					return callback();
+				}
+
+				if (currentProfile !== undefined) {
+					currentProfile.markFactoryEnd();
+				}
+
+				callback(null, factoryResult ? result : result.module);
+			}
+		);
+	}
+
+	/**
+	 * @param {string} context context string path
+	 * @param {Dependency} dependency dependency used to create Module chain
+	 * @param {ModuleCallback} callback callback for when module chain is complete
+	 * @returns {void} will throw if dependency instance is not a valid Dependency
+	 */
+	addModuleChain(context, dependency, callback) {
+		return this.addModuleTree({ context, dependency }, callback);
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {string} options.context context string path
+	 * @param {Dependency} options.dependency dependency used to create Module chain
+	 * @param {Partial<ModuleFactoryCreateDataContextInfo>=} options.contextInfo additional context info for the root module
+	 * @param {ModuleCallback} callback callback for when module chain is complete
+	 * @returns {void} will throw if dependency instance is not a valid Dependency
+	 */
+	addModuleTree({ context, dependency, contextInfo }, callback) {
+		if (
+			typeof dependency !== "object" ||
+			dependency === null ||
+			!dependency.constructor
+		) {
+			return callback(
+				new WebpackError("Parameter 'dependency' must be a Dependency")
+			);
+		}
+		const Dep = /** @type {DepConstructor} */ (dependency.constructor);
+		const moduleFactory = this.dependencyFactories.get(Dep);
+		if (!moduleFactory) {
+			return callback(
+				new WebpackError(
+					`No dependency factory available for this dependency type: ${dependency.constructor.name}`
+				)
+			);
+		}
+
+		this.handleModuleCreation(
+			{
+				factory: moduleFactory,
+				dependencies: [dependency],
+				originModule: null,
+				contextInfo,
+				context
+			},
+			(err, result) => {
+				if (err && this.bail) {
+					callback(err);
+					this.buildQueue.stop();
+					this.rebuildQueue.stop();
+					this.processDependenciesQueue.stop();
+					this.factorizeQueue.stop();
+				} else if (!err && result) {
+					callback(null, result);
+				} else {
+					callback();
+				}
+			}
+		);
+	}
+
+	/**
+	 * @param {string} context context path for entry
+	 * @param {Dependency} entry entry dependency that should be followed
+	 * @param {string | EntryOptions} optionsOrName options or deprecated name of entry
+	 * @param {ModuleCallback} callback callback function
+	 * @returns {void} returns
+	 */
+	addEntry(context, entry, optionsOrName, callback) {
+		// TODO webpack 6 remove
+		const options =
+			typeof optionsOrName === "object"
+				? optionsOrName
+				: { name: optionsOrName };
+
+		this._addEntryItem(context, entry, "dependencies", options, callback);
+	}
+
+	/**
+	 * @param {string} context context path for entry
+	 * @param {Dependency} dependency dependency that should be followed
+	 * @param {EntryOptions} options options
+	 * @param {ModuleCallback} callback callback function
+	 * @returns {void} returns
+	 */
+	addInclude(context, dependency, options, callback) {
+		this._addEntryItem(
+			context,
+			dependency,
+			"includeDependencies",
+			options,
+			callback
+		);
+	}
+
+	/**
+	 * @param {string} context context path for entry
+	 * @param {Dependency} entry entry dependency that should be followed
+	 * @param {"dependencies" | "includeDependencies"} target type of entry
+	 * @param {EntryOptions} options options
+	 * @param {ModuleCallback} callback callback function
+	 * @returns {void} returns
+	 */
+	_addEntryItem(context, entry, target, options, callback) {
+		const { name } = options;
+		let entryData =
+			name !== undefined ? this.entries.get(name) : this.globalEntry;
+		if (entryData === undefined) {
+			entryData = {
+				dependencies: [],
+				includeDependencies: [],
+				options: {
+					name: undefined,
+					...options
+				}
+			};
+			entryData[target].push(entry);
+			this.entries.set(name, entryData);
+		} else {
+			entryData[target].push(entry);
+			for (const key of Object.keys(options)) {
+				if (options[key] === undefined) continue;
+				if (entryData.options[key] === options[key]) continue;
+				if (
+					Array.isArray(entryData.options[key]) &&
+					Array.isArray(options[key]) &&
+					arrayEquals(entryData.options[key], options[key])
+				) {
+					continue;
+				}
+				if (entryData.options[key] === undefined) {
+					entryData.options[key] = options[key];
+				} else {
+					return callback(
+						new WebpackError(
+							`Conflicting entry option ${key} = ${entryData.options[key]} vs ${options[key]}`
+						)
+					);
+				}
+			}
+		}
+
+		this.hooks.addEntry.call(entry, options);
+
+		this.addModuleTree(
+			{
+				context,
+				dependency: entry,
+				contextInfo: entryData.options.layer
+					? { issuerLayer: entryData.options.layer }
+					: undefined
+			},
+			(err, module) => {
+				if (err) {
+					this.hooks.failedEntry.call(entry, options, err);
+					return callback(err);
+				}
+				this.hooks.succeedEntry.call(entry, options, module);
+				return callback(null, module);
+			}
+		);
+	}
+
+	/**
+	 * @param {Module} module module to be rebuilt
+	 * @param {ModuleCallback} callback callback when module finishes rebuilding
+	 * @returns {void}
+	 */
+	rebuildModule(module, callback) {
+		this.rebuildQueue.add(module, callback);
+	}
+
+	/**
+	 * @param {Module} module module to be rebuilt
+	 * @param {ModuleCallback} callback callback when module finishes rebuilding
+	 * @returns {void}
+	 */
+	_rebuildModule(module, callback) {
+		this.hooks.rebuildModule.call(module);
+		const oldDependencies = module.dependencies.slice();
+		const oldBlocks = module.blocks.slice();
+		module.invalidateBuild();
+		this.buildQueue.invalidate(module);
+		this.buildModule(module, err => {
+			if (err) {
+				return this.hooks.finishRebuildingModule.callAsync(module, err2 => {
+					if (err2) {
+						callback(
+							makeWebpackError(err2, "Compilation.hooks.finishRebuildingModule")
+						);
+						return;
+					}
+					callback(err);
+				});
+			}
+
+			this.processDependenciesQueue.invalidate(module);
+			this.moduleGraph.unfreeze();
+			this.processModuleDependencies(module, err => {
+				if (err) return callback(err);
+				this.removeReasonsOfDependencyBlock(module, {
+					dependencies: oldDependencies,
+					blocks: oldBlocks
+				});
+				this.hooks.finishRebuildingModule.callAsync(module, err2 => {
+					if (err2) {
+						callback(
+							makeWebpackError(err2, "Compilation.hooks.finishRebuildingModule")
+						);
+						return;
+					}
+					callback(null, module);
+				});
+			});
+		});
+	}
+
+	_computeAffectedModules(modules) {
+		const moduleMemCacheCache = this.compiler.moduleMemCaches;
+		if (!moduleMemCacheCache) return;
+		if (!this.moduleMemCaches) {
+			this.moduleMemCaches = new Map();
+			this.moduleGraph.setModuleMemCaches(this.moduleMemCaches);
+		}
+		const { moduleGraph, moduleMemCaches } = this;
+		const affectedModules = new Set();
+		const infectedModules = new Set();
+		let statNew = 0;
+		let statChanged = 0;
+		let statUnchanged = 0;
+		let statReferencesChanged = 0;
+		let statWithoutBuild = 0;
+
+		const computeReferences = module => {
+			/** @type {WeakMap<Dependency, Module>} */
+			let references = undefined;
+			for (const connection of moduleGraph.getOutgoingConnections(module)) {
+				const d = connection.dependency;
+				const m = connection.module;
+				if (!d || !m || unsafeCacheDependencies.has(d)) continue;
+				if (references === undefined) references = new WeakMap();
+				references.set(d, m);
+			}
+			return references;
+		};
+
+		/**
+		 * @param {Module} module the module
+		 * @param {WeakMap<Dependency, Module>} references references
+		 * @returns {boolean} true, when the references differ
+		 */
+		const compareReferences = (module, references) => {
+			if (references === undefined) return true;
+			for (const connection of moduleGraph.getOutgoingConnections(module)) {
+				const d = connection.dependency;
+				if (!d) continue;
+				const entry = references.get(d);
+				if (entry === undefined) continue;
+				if (entry !== connection.module) return false;
+			}
+			return true;
+		};
+
+		const modulesWithoutCache = new Set(modules);
+		for (const [module, cachedMemCache] of moduleMemCacheCache) {
+			if (modulesWithoutCache.has(module)) {
+				const buildInfo = module.buildInfo;
+				if (buildInfo) {
+					if (cachedMemCache.buildInfo !== buildInfo) {
+						// use a new one
+						const memCache = new WeakTupleMap();
+						moduleMemCaches.set(module, memCache);
+						affectedModules.add(module);
+						cachedMemCache.buildInfo = buildInfo;
+						cachedMemCache.references = computeReferences(module);
+						cachedMemCache.memCache = memCache;
+						statChanged++;
+					} else if (!compareReferences(module, cachedMemCache.references)) {
+						// use a new one
+						const memCache = new WeakTupleMap();
+						moduleMemCaches.set(module, memCache);
+						affectedModules.add(module);
+						cachedMemCache.references = computeReferences(module);
+						cachedMemCache.memCache = memCache;
+						statReferencesChanged++;
+					} else {
+						// keep the old mem cache
+						moduleMemCaches.set(module, cachedMemCache.memCache);
+						statUnchanged++;
+					}
+				} else {
+					infectedModules.add(module);
+					moduleMemCacheCache.delete(module);
+					statWithoutBuild++;
+				}
+				modulesWithoutCache.delete(module);
+			} else {
+				moduleMemCacheCache.delete(module);
+			}
+		}
+
+		for (const module of modulesWithoutCache) {
+			const buildInfo = module.buildInfo;
+			if (buildInfo) {
+				// create a new entry
+				const memCache = new WeakTupleMap();
+				moduleMemCacheCache.set(module, {
+					buildInfo,
+					references: computeReferences(module),
+					memCache
+				});
+				moduleMemCaches.set(module, memCache);
+				affectedModules.add(module);
+				statNew++;
+			} else {
+				infectedModules.add(module);
+				statWithoutBuild++;
+			}
+		}
+
+		const reduceAffectType = connections => {
+			let affected = false;
+			for (const { dependency } of connections) {
+				if (!dependency) continue;
+				const type = dependency.couldAffectReferencingModule();
+				if (type === Dependency.TRANSITIVE) return Dependency.TRANSITIVE;
+				if (type === false) continue;
+				affected = true;
+			}
+			return affected;
+		};
+		const directOnlyInfectedModules = new Set();
+		for (const module of infectedModules) {
+			for (const [
+				referencingModule,
+				connections
+			] of moduleGraph.getIncomingConnectionsByOriginModule(module)) {
+				if (!referencingModule) continue;
+				if (infectedModules.has(referencingModule)) continue;
+				const type = reduceAffectType(connections);
+				if (!type) continue;
+				if (type === true) {
+					directOnlyInfectedModules.add(referencingModule);
+				} else {
+					infectedModules.add(referencingModule);
+				}
+			}
+		}
+		for (const module of directOnlyInfectedModules) infectedModules.add(module);
+		const directOnlyAffectModules = new Set();
+		for (const module of affectedModules) {
+			for (const [
+				referencingModule,
+				connections
+			] of moduleGraph.getIncomingConnectionsByOriginModule(module)) {
+				if (!referencingModule) continue;
+				if (infectedModules.has(referencingModule)) continue;
+				if (affectedModules.has(referencingModule)) continue;
+				const type = reduceAffectType(connections);
+				if (!type) continue;
+				if (type === true) {
+					directOnlyAffectModules.add(referencingModule);
+				} else {
+					affectedModules.add(referencingModule);
+				}
+				const memCache = new WeakTupleMap();
+				const cache = moduleMemCacheCache.get(referencingModule);
+				cache.memCache = memCache;
+				moduleMemCaches.set(referencingModule, memCache);
+			}
+		}
+		for (const module of directOnlyAffectModules) affectedModules.add(module);
+		this.logger.log(
+			`${Math.round(
+				(100 * (affectedModules.size + infectedModules.size)) /
+					this.modules.size
+			)}% (${affectedModules.size} affected + ${
+				infectedModules.size
+			} infected of ${
+				this.modules.size
+			}) modules flagged as affected (${statNew} new modules, ${statChanged} changed, ${statReferencesChanged} references changed, ${statUnchanged} unchanged, ${statWithoutBuild} were not built)`
+		);
+	}
+
+	_computeAffectedModulesWithChunkGraph() {
+		const { moduleMemCaches } = this;
+		if (!moduleMemCaches) return;
+		const moduleMemCaches2 = (this.moduleMemCaches2 = new Map());
+		const { moduleGraph, chunkGraph } = this;
+		const key = "memCache2";
+		let statUnchanged = 0;
+		let statChanged = 0;
+		let statNew = 0;
+		/**
+		 * @param {Module} module module
+		 * @returns {{ id: string | number, modules?: Map<Module, string | number | undefined>, blocks?: (string | number)[] }} references
+		 */
+		const computeReferences = module => {
+			const id = chunkGraph.getModuleId(module);
+			/** @type {Map<Module, string | number | undefined>} */
+			let modules = undefined;
+			/** @type {(string | number)[] | undefined} */
+			let blocks = undefined;
+			const outgoing = moduleGraph.getOutgoingConnectionsByModule(module);
+			if (outgoing !== undefined) {
+				for (const m of outgoing.keys()) {
+					if (!m) continue;
+					if (modules === undefined) modules = new Map();
+					modules.set(m, chunkGraph.getModuleId(m));
+				}
+			}
+			if (module.blocks.length > 0) {
+				blocks = [];
+				const queue = Array.from(module.blocks);
+				for (const block of queue) {
+					const chunkGroup = chunkGraph.getBlockChunkGroup(block);
+					if (chunkGroup) {
+						for (const chunk of chunkGroup.chunks) {
+							blocks.push(chunk.id);
+						}
+					} else {
+						blocks.push(null);
+					}
+					queue.push.apply(queue, block.blocks);
+				}
+			}
+			return { id, modules, blocks };
+		};
+		/**
+		 * @param {Module} module module
+		 * @param {Object} references references
+		 * @param {string | number} references.id id
+		 * @param {Map<Module, string | number>=} references.modules modules
+		 * @param {(string | number)[]=} references.blocks blocks
+		 * @returns {boolean} ok?
+		 */
+		const compareReferences = (module, { id, modules, blocks }) => {
+			if (id !== chunkGraph.getModuleId(module)) return false;
+			if (modules !== undefined) {
+				for (const [module, id] of modules) {
+					if (chunkGraph.getModuleId(module) !== id) return false;
+				}
+			}
+			if (blocks !== undefined) {
+				const queue = Array.from(module.blocks);
+				let i = 0;
+				for (const block of queue) {
+					const chunkGroup = chunkGraph.getBlockChunkGroup(block);
+					if (chunkGroup) {
+						for (const chunk of chunkGroup.chunks) {
+							if (i >= blocks.length || blocks[i++] !== chunk.id) return false;
+						}
+					} else {
+						if (i >= blocks.length || blocks[i++] !== null) return false;
+					}
+					queue.push.apply(queue, block.blocks);
+				}
+				if (i !== blocks.length) return false;
+			}
+			return true;
+		};
+
+		for (const [module, memCache] of moduleMemCaches) {
+			/** @type {{ references: { id: string | number, modules?: Map<Module, string | number | undefined>, blocks?: (string | number)[]}, memCache: WeakTupleMap<any[], any> }} */
+			const cache = memCache.get(key);
+			if (cache === undefined) {
+				const memCache2 = new WeakTupleMap();
+				memCache.set(key, {
+					references: computeReferences(module),
+					memCache: memCache2
+				});
+				moduleMemCaches2.set(module, memCache2);
+				statNew++;
+			} else if (!compareReferences(module, cache.references)) {
+				const memCache = new WeakTupleMap();
+				cache.references = computeReferences(module);
+				cache.memCache = memCache;
+				moduleMemCaches2.set(module, memCache);
+				statChanged++;
+			} else {
+				moduleMemCaches2.set(module, cache.memCache);
+				statUnchanged++;
+			}
+		}
+
+		this.logger.log(
+			`${Math.round(
+				(100 * statChanged) / (statNew + statChanged + statUnchanged)
+			)}% modules flagged as affected by chunk graph (${statNew} new modules, ${statChanged} changed, ${statUnchanged} unchanged)`
+		);
+	}
+
+	finish(callback) {
+		this.factorizeQueue.clear();
+		if (this.profile) {
+			this.logger.time("finish module profiles");
+			const ParallelismFactorCalculator = require("./util/ParallelismFactorCalculator");
+			const p = new ParallelismFactorCalculator();
+			const moduleGraph = this.moduleGraph;
+			const modulesWithProfiles = new Map();
+			for (const module of this.modules) {
+				const profile = moduleGraph.getProfile(module);
+				if (!profile) continue;
+				modulesWithProfiles.set(module, profile);
+				p.range(
+					profile.buildingStartTime,
+					profile.buildingEndTime,
+					f => (profile.buildingParallelismFactor = f)
+				);
+				p.range(
+					profile.factoryStartTime,
+					profile.factoryEndTime,
+					f => (profile.factoryParallelismFactor = f)
+				);
+				p.range(
+					profile.integrationStartTime,
+					profile.integrationEndTime,
+					f => (profile.integrationParallelismFactor = f)
+				);
+				p.range(
+					profile.storingStartTime,
+					profile.storingEndTime,
+					f => (profile.storingParallelismFactor = f)
+				);
+				p.range(
+					profile.restoringStartTime,
+					profile.restoringEndTime,
+					f => (profile.restoringParallelismFactor = f)
+				);
+				if (profile.additionalFactoryTimes) {
+					for (const { start, end } of profile.additionalFactoryTimes) {
+						const influence = (end - start) / profile.additionalFactories;
+						p.range(
+							start,
+							end,
+							f =>
+								(profile.additionalFactoriesParallelismFactor += f * influence)
+						);
+					}
+				}
+			}
+			p.calculate();
+
+			const logger = this.getLogger("webpack.Compilation.ModuleProfile");
+			const logByValue = (value, msg) => {
+				if (value > 1000) {
+					logger.error(msg);
+				} else if (value > 500) {
+					logger.warn(msg);
+				} else if (value > 200) {
+					logger.info(msg);
+				} else if (value > 30) {
+					logger.log(msg);
+				} else {
+					logger.debug(msg);
+				}
+			};
+			const logNormalSummary = (category, getDuration, getParallelism) => {
+				let sum = 0;
+				let max = 0;
+				for (const [module, profile] of modulesWithProfiles) {
+					const p = getParallelism(profile);
+					const d = getDuration(profile);
+					if (d === 0 || p === 0) continue;
+					const t = d / p;
+					sum += t;
+					if (t <= 10) continue;
+					logByValue(
+						t,
+						` | ${Math.round(t)} ms${
+							p >= 1.1 ? ` (parallelism ${Math.round(p * 10) / 10})` : ""
+						} ${category} > ${module.readableIdentifier(this.requestShortener)}`
+					);
+					max = Math.max(max, t);
+				}
+				if (sum <= 10) return;
+				logByValue(
+					Math.max(sum / 10, max),
+					`${Math.round(sum)} ms ${category}`
+				);
+			};
+			const logByLoadersSummary = (category, getDuration, getParallelism) => {
+				const map = new Map();
+				for (const [module, profile] of modulesWithProfiles) {
+					const list = provide(
+						map,
+						module.type + "!" + module.identifier().replace(/(!|^)[^!]*$/, ""),
+						() => []
+					);
+					list.push({ module, profile });
+				}
+
+				let sum = 0;
+				let max = 0;
+				for (const [key, modules] of map) {
+					let innerSum = 0;
+					let innerMax = 0;
+					for (const { module, profile } of modules) {
+						const p = getParallelism(profile);
+						const d = getDuration(profile);
+						if (d === 0 || p === 0) continue;
+						const t = d / p;
+						innerSum += t;
+						if (t <= 10) continue;
+						logByValue(
+							t,
+							` |  | ${Math.round(t)} ms${
+								p >= 1.1 ? ` (parallelism ${Math.round(p * 10) / 10})` : ""
+							} ${category} > ${module.readableIdentifier(
+								this.requestShortener
+							)}`
+						);
+						innerMax = Math.max(innerMax, t);
+					}
+					sum += innerSum;
+					if (innerSum <= 10) continue;
+					const idx = key.indexOf("!");
+					const loaders = key.slice(idx + 1);
+					const moduleType = key.slice(0, idx);
+					const t = Math.max(innerSum / 10, innerMax);
+					logByValue(
+						t,
+						` | ${Math.round(innerSum)} ms ${category} > ${
+							loaders
+								? `${
+										modules.length
+								  } x ${moduleType} with ${this.requestShortener.shorten(
+										loaders
+								  )}`
+								: `${modules.length} x ${moduleType}`
+						}`
+					);
+					max = Math.max(max, t);
+				}
+				if (sum <= 10) return;
+				logByValue(
+					Math.max(sum / 10, max),
+					`${Math.round(sum)} ms ${category}`
+				);
+			};
+			logNormalSummary(
+				"resolve to new modules",
+				p => p.factory,
+				p => p.factoryParallelismFactor
+			);
+			logNormalSummary(
+				"resolve to existing modules",
+				p => p.additionalFactories,
+				p => p.additionalFactoriesParallelismFactor
+			);
+			logNormalSummary(
+				"integrate modules",
+				p => p.restoring,
+				p => p.restoringParallelismFactor
+			);
+			logByLoadersSummary(
+				"build modules",
+				p => p.building,
+				p => p.buildingParallelismFactor
+			);
+			logNormalSummary(
+				"store modules",
+				p => p.storing,
+				p => p.storingParallelismFactor
+			);
+			logNormalSummary(
+				"restore modules",
+				p => p.restoring,
+				p => p.restoringParallelismFactor
+			);
+			this.logger.timeEnd("finish module profiles");
+		}
+		this.logger.time("compute affected modules");
+		this._computeAffectedModules(this.modules);
+		this.logger.timeEnd("compute affected modules");
+		this.logger.time("finish modules");
+		const { modules, moduleMemCaches } = this;
+		this.hooks.finishModules.callAsync(modules, err => {
+			this.logger.timeEnd("finish modules");
+			if (err) return callback(err);
+
+			// extract warnings and errors from modules
+			this.moduleGraph.freeze("dependency errors");
+			// TODO keep a cacheToken (= {}) for each module in the graph
+			// create a new one per compilation and flag all updated files
+			// and parents with it
+			this.logger.time("report dependency errors and warnings");
+			for (const module of modules) {
+				// TODO only run for modules with changed cacheToken
+				// global WeakMap<CacheToken, WeakSet<Module>> to keep modules without errors/warnings
+				const memCache = moduleMemCaches && moduleMemCaches.get(module);
+				if (memCache && memCache.get("noWarningsOrErrors")) continue;
+				let hasProblems = this.reportDependencyErrorsAndWarnings(module, [
+					module
+				]);
+				const errors = module.getErrors();
+				if (errors !== undefined) {
+					for (const error of errors) {
+						if (!error.module) {
+							error.module = module;
+						}
+						this.errors.push(error);
+						hasProblems = true;
+					}
+				}
+				const warnings = module.getWarnings();
+				if (warnings !== undefined) {
+					for (const warning of warnings) {
+						if (!warning.module) {
+							warning.module = module;
+						}
+						this.warnings.push(warning);
+						hasProblems = true;
+					}
+				}
+				if (!hasProblems && memCache) memCache.set("noWarningsOrErrors", true);
+			}
+			this.moduleGraph.unfreeze();
+			this.logger.timeEnd("report dependency errors and warnings");
+
+			callback();
+		});
+	}
+
+	unseal() {
+		this.hooks.unseal.call();
+		this.chunks.clear();
+		this.chunkGroups.length = 0;
+		this.namedChunks.clear();
+		this.namedChunkGroups.clear();
+		this.entrypoints.clear();
+		this.additionalChunkAssets.length = 0;
+		this.assets = {};
+		this.assetsInfo.clear();
+		this.moduleGraph.removeAllModuleAttributes();
+		this.moduleGraph.unfreeze();
+		this.moduleMemCaches2 = undefined;
+	}
+
+	/**
+	 * @param {Callback} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	seal(callback) {
+		const finalCallback = err => {
+			this.factorizeQueue.clear();
+			this.buildQueue.clear();
+			this.rebuildQueue.clear();
+			this.processDependenciesQueue.clear();
+			this.addModuleQueue.clear();
+			return callback(err);
+		};
+		const chunkGraph = new ChunkGraph(
+			this.moduleGraph,
+			this.outputOptions.hashFunction
+		);
+		this.chunkGraph = chunkGraph;
+
+		if (this._backCompat) {
+			for (const module of this.modules) {
+				ChunkGraph.setChunkGraphForModule(module, chunkGraph);
+			}
+		}
+
+		this.hooks.seal.call();
+
+		this.logger.time("optimize dependencies");
+		while (this.hooks.optimizeDependencies.call(this.modules)) {
+			/* empty */
+		}
+		this.hooks.afterOptimizeDependencies.call(this.modules);
+		this.logger.timeEnd("optimize dependencies");
+
+		this.logger.time("create chunks");
+		this.hooks.beforeChunks.call();
+		this.moduleGraph.freeze("seal");
+		/** @type {Map<Entrypoint, Module[]>} */
+		const chunkGraphInit = new Map();
+		for (const [name, { dependencies, includeDependencies, options }] of this
+			.entries) {
+			const chunk = this.addChunk(name);
+			if (options.filename) {
+				chunk.filenameTemplate = options.filename;
+			}
+			const entrypoint = new Entrypoint(options);
+			if (!options.dependOn && !options.runtime) {
+				entrypoint.setRuntimeChunk(chunk);
+			}
+			entrypoint.setEntrypointChunk(chunk);
+			this.namedChunkGroups.set(name, entrypoint);
+			this.entrypoints.set(name, entrypoint);
+			this.chunkGroups.push(entrypoint);
+			connectChunkGroupAndChunk(entrypoint, chunk);
+
+			const entryModules = new Set();
+			for (const dep of [...this.globalEntry.dependencies, ...dependencies]) {
+				entrypoint.addOrigin(null, { name }, /** @type {any} */ (dep).request);
+
+				const module = this.moduleGraph.getModule(dep);
+				if (module) {
+					chunkGraph.connectChunkAndEntryModule(chunk, module, entrypoint);
+					entryModules.add(module);
+					const modulesList = chunkGraphInit.get(entrypoint);
+					if (modulesList === undefined) {
+						chunkGraphInit.set(entrypoint, [module]);
+					} else {
+						modulesList.push(module);
+					}
+				}
+			}
+
+			this.assignDepths(entryModules);
+
+			const mapAndSort = deps =>
+				deps
+					.map(dep => this.moduleGraph.getModule(dep))
+					.filter(Boolean)
+					.sort(compareModulesByIdentifier);
+			const includedModules = [
+				...mapAndSort(this.globalEntry.includeDependencies),
+				...mapAndSort(includeDependencies)
+			];
+
+			let modulesList = chunkGraphInit.get(entrypoint);
+			if (modulesList === undefined) {
+				chunkGraphInit.set(entrypoint, (modulesList = []));
+			}
+			for (const module of includedModules) {
+				this.assignDepth(module);
+				modulesList.push(module);
+			}
+		}
+		const runtimeChunks = new Set();
+		outer: for (const [
+			name,
+			{
+				options: { dependOn, runtime }
+			}
+		] of this.entries) {
+			if (dependOn && runtime) {
+				const err =
+					new WebpackError(`Entrypoint '${name}' has 'dependOn' and 'runtime' specified. This is not valid.
+Entrypoints that depend on other entrypoints do not have their own runtime.
+They will use the runtime(s) from referenced entrypoints instead.
+Remove the 'runtime' option from the entrypoint.`);
+				const entry = this.entrypoints.get(name);
+				err.chunk = entry.getEntrypointChunk();
+				this.errors.push(err);
+			}
+			if (dependOn) {
+				const entry = this.entrypoints.get(name);
+				const referencedChunks = entry
+					.getEntrypointChunk()
+					.getAllReferencedChunks();
+				const dependOnEntries = [];
+				for (const dep of dependOn) {
+					const dependency = this.entrypoints.get(dep);
+					if (!dependency) {
+						throw new Error(
+							`Entry ${name} depends on ${dep}, but this entry was not found`
+						);
+					}
+					if (referencedChunks.has(dependency.getEntrypointChunk())) {
+						const err = new WebpackError(
+							`Entrypoints '${name}' and '${dep}' use 'dependOn' to depend on each other in a circular way.`
+						);
+						const entryChunk = entry.getEntrypointChunk();
+						err.chunk = entryChunk;
+						this.errors.push(err);
+						entry.setRuntimeChunk(entryChunk);
+						continue outer;
+					}
+					dependOnEntries.push(dependency);
+				}
+				for (const dependency of dependOnEntries) {
+					connectChunkGroupParentAndChild(dependency, entry);
+				}
+			} else if (runtime) {
+				const entry = this.entrypoints.get(name);
+				let chunk = this.namedChunks.get(runtime);
+				if (chunk) {
+					if (!runtimeChunks.has(chunk)) {
+						const err =
+							new WebpackError(`Entrypoint '${name}' has a 'runtime' option which points to another entrypoint named '${runtime}'.
+It's not valid to use other entrypoints as runtime chunk.
+Did you mean to use 'dependOn: ${JSON.stringify(
+								runtime
+							)}' instead to allow using entrypoint '${name}' within the runtime of entrypoint '${runtime}'? For this '${runtime}' must always be loaded when '${name}' is used.
+Or do you want to use the entrypoints '${name}' and '${runtime}' independently on the same page with a shared runtime? In this case give them both the same value for the 'runtime' option. It must be a name not already used by an entrypoint.`);
+						const entryChunk = entry.getEntrypointChunk();
+						err.chunk = entryChunk;
+						this.errors.push(err);
+						entry.setRuntimeChunk(entryChunk);
+						continue;
+					}
+				} else {
+					chunk = this.addChunk(runtime);
+					chunk.preventIntegration = true;
+					runtimeChunks.add(chunk);
+				}
+				entry.unshiftChunk(chunk);
+				chunk.addGroup(entry);
+				entry.setRuntimeChunk(chunk);
+			}
+		}
+		buildChunkGraph(this, chunkGraphInit);
+		this.hooks.afterChunks.call(this.chunks);
+		this.logger.timeEnd("create chunks");
+
+		this.logger.time("optimize");
+		this.hooks.optimize.call();
+
+		while (this.hooks.optimizeModules.call(this.modules)) {
+			/* empty */
+		}
+		this.hooks.afterOptimizeModules.call(this.modules);
+
+		while (this.hooks.optimizeChunks.call(this.chunks, this.chunkGroups)) {
+			/* empty */
+		}
+		this.hooks.afterOptimizeChunks.call(this.chunks, this.chunkGroups);
+
+		this.hooks.optimizeTree.callAsync(this.chunks, this.modules, err => {
+			if (err) {
+				return finalCallback(
+					makeWebpackError(err, "Compilation.hooks.optimizeTree")
+				);
+			}
+
+			this.hooks.afterOptimizeTree.call(this.chunks, this.modules);
+
+			this.hooks.optimizeChunkModules.callAsync(
+				this.chunks,
+				this.modules,
+				err => {
+					if (err) {
+						return finalCallback(
+							makeWebpackError(err, "Compilation.hooks.optimizeChunkModules")
+						);
+					}
+
+					this.hooks.afterOptimizeChunkModules.call(this.chunks, this.modules);
+
+					const shouldRecord = this.hooks.shouldRecord.call() !== false;
+
+					this.hooks.reviveModules.call(this.modules, this.records);
+					this.hooks.beforeModuleIds.call(this.modules);
+					this.hooks.moduleIds.call(this.modules);
+					this.hooks.optimizeModuleIds.call(this.modules);
+					this.hooks.afterOptimizeModuleIds.call(this.modules);
+
+					this.hooks.reviveChunks.call(this.chunks, this.records);
+					this.hooks.beforeChunkIds.call(this.chunks);
+					this.hooks.chunkIds.call(this.chunks);
+					this.hooks.optimizeChunkIds.call(this.chunks);
+					this.hooks.afterOptimizeChunkIds.call(this.chunks);
+
+					this.assignRuntimeIds();
+
+					this.logger.time("compute affected modules with chunk graph");
+					this._computeAffectedModulesWithChunkGraph();
+					this.logger.timeEnd("compute affected modules with chunk graph");
+
+					this.sortItemsWithChunkIds();
+
+					if (shouldRecord) {
+						this.hooks.recordModules.call(this.modules, this.records);
+						this.hooks.recordChunks.call(this.chunks, this.records);
+					}
+
+					this.hooks.optimizeCodeGeneration.call(this.modules);
+					this.logger.timeEnd("optimize");
+
+					this.logger.time("module hashing");
+					this.hooks.beforeModuleHash.call();
+					this.createModuleHashes();
+					this.hooks.afterModuleHash.call();
+					this.logger.timeEnd("module hashing");
+
+					this.logger.time("code generation");
+					this.hooks.beforeCodeGeneration.call();
+					this.codeGeneration(err => {
+						if (err) {
+							return finalCallback(err);
+						}
+						this.hooks.afterCodeGeneration.call();
+						this.logger.timeEnd("code generation");
+
+						this.logger.time("runtime requirements");
+						this.hooks.beforeRuntimeRequirements.call();
+						this.processRuntimeRequirements();
+						this.hooks.afterRuntimeRequirements.call();
+						this.logger.timeEnd("runtime requirements");
+
+						this.logger.time("hashing");
+						this.hooks.beforeHash.call();
+						const codeGenerationJobs = this.createHash();
+						this.hooks.afterHash.call();
+						this.logger.timeEnd("hashing");
+
+						this._runCodeGenerationJobs(codeGenerationJobs, err => {
+							if (err) {
+								return finalCallback(err);
+							}
+
+							if (shouldRecord) {
+								this.logger.time("record hash");
+								this.hooks.recordHash.call(this.records);
+								this.logger.timeEnd("record hash");
+							}
+
+							this.logger.time("module assets");
+							this.clearAssets();
+
+							this.hooks.beforeModuleAssets.call();
+							this.createModuleAssets();
+							this.logger.timeEnd("module assets");
+
+							const cont = () => {
+								this.logger.time("process assets");
+								this.hooks.processAssets.callAsync(this.assets, err => {
+									if (err) {
+										return finalCallback(
+											makeWebpackError(err, "Compilation.hooks.processAssets")
+										);
+									}
+									this.hooks.afterProcessAssets.call(this.assets);
+									this.logger.timeEnd("process assets");
+									this.assets = this._backCompat
+										? soonFrozenObjectDeprecation(
+												this.assets,
+												"Compilation.assets",
+												"DEP_WEBPACK_COMPILATION_ASSETS",
+												`BREAKING CHANGE: No more changes should happen to Compilation.assets after sealing the Compilation.
+	Do changes to assets earlier, e. g. in Compilation.hooks.processAssets.
+	Make sure to select an appropriate stage from Compilation.PROCESS_ASSETS_STAGE_*.`
+										  )
+										: Object.freeze(this.assets);
+
+									this.summarizeDependencies();
+									if (shouldRecord) {
+										this.hooks.record.call(this, this.records);
+									}
+
+									if (this.hooks.needAdditionalSeal.call()) {
+										this.unseal();
+										return this.seal(callback);
+									}
+									return this.hooks.afterSeal.callAsync(err => {
+										if (err) {
+											return finalCallback(
+												makeWebpackError(err, "Compilation.hooks.afterSeal")
+											);
+										}
+										this.fileSystemInfo.logStatistics();
+										finalCallback();
+									});
+								});
+							};
+
+							this.logger.time("create chunk assets");
+							if (this.hooks.shouldGenerateChunkAssets.call() !== false) {
+								this.hooks.beforeChunkAssets.call();
+								this.createChunkAssets(err => {
+									this.logger.timeEnd("create chunk assets");
+									if (err) {
+										return finalCallback(err);
+									}
+									cont();
+								});
+							} else {
+								this.logger.timeEnd("create chunk assets");
+								cont();
+							}
+						});
+					});
+				}
+			);
+		});
+	}
+
+	/**
+	 * @param {Module} module module to report from
+	 * @param {DependenciesBlock[]} blocks blocks to report from
+	 * @returns {boolean} true, when it has warnings or errors
+	 */
+	reportDependencyErrorsAndWarnings(module, blocks) {
+		let hasProblems = false;
+		for (let indexBlock = 0; indexBlock < blocks.length; indexBlock++) {
+			const block = blocks[indexBlock];
+			const dependencies = block.dependencies;
+
+			for (let indexDep = 0; indexDep < dependencies.length; indexDep++) {
+				const d = dependencies[indexDep];
+
+				const warnings = d.getWarnings(this.moduleGraph);
+				if (warnings) {
+					for (let indexWar = 0; indexWar < warnings.length; indexWar++) {
+						const w = warnings[indexWar];
+
+						const warning = new ModuleDependencyWarning(module, w, d.loc);
+						this.warnings.push(warning);
+						hasProblems = true;
+					}
+				}
+				const errors = d.getErrors(this.moduleGraph);
+				if (errors) {
+					for (let indexErr = 0; indexErr < errors.length; indexErr++) {
+						const e = errors[indexErr];
+
+						const error = new ModuleDependencyError(module, e, d.loc);
+						this.errors.push(error);
+						hasProblems = true;
+					}
+				}
+			}
+
+			if (this.reportDependencyErrorsAndWarnings(module, block.blocks))
+				hasProblems = true;
+		}
+		return hasProblems;
+	}
+
+	codeGeneration(callback) {
+		const { chunkGraph } = this;
+		this.codeGenerationResults = new CodeGenerationResults(
+			this.outputOptions.hashFunction
+		);
+		/** @type {{module: Module, hash: string, runtime: RuntimeSpec, runtimes: RuntimeSpec[]}[]} */
+		const jobs = [];
+		for (const module of this.modules) {
+			const runtimes = chunkGraph.getModuleRuntimes(module);
+			if (runtimes.size === 1) {
+				for (const runtime of runtimes) {
+					const hash = chunkGraph.getModuleHash(module, runtime);
+					jobs.push({ module, hash, runtime, runtimes: [runtime] });
+				}
+			} else if (runtimes.size > 1) {
+				/** @type {Map<string, { runtimes: RuntimeSpec[] }>} */
+				const map = new Map();
+				for (const runtime of runtimes) {
+					const hash = chunkGraph.getModuleHash(module, runtime);
+					const job = map.get(hash);
+					if (job === undefined) {
+						const newJob = { module, hash, runtime, runtimes: [runtime] };
+						jobs.push(newJob);
+						map.set(hash, newJob);
+					} else {
+						job.runtimes.push(runtime);
+					}
+				}
+			}
+		}
+
+		this._runCodeGenerationJobs(jobs, callback);
+	}
+
+	_runCodeGenerationJobs(jobs, callback) {
+		let statModulesFromCache = 0;
+		let statModulesGenerated = 0;
+		const { chunkGraph, moduleGraph, dependencyTemplates, runtimeTemplate } =
+			this;
+		const results = this.codeGenerationResults;
+		const errors = [];
+		/** @type {Set<Module> | undefined} */
+		let notCodeGeneratedModules = undefined;
+		const runIteration = () => {
+			let delayedJobs = [];
+			let delayedModules = new Set();
+			asyncLib.eachLimit(
+				jobs,
+				this.options.parallelism,
+				(job, callback) => {
+					const { module } = job;
+					const { codeGenerationDependencies } = module;
+					if (codeGenerationDependencies !== undefined) {
+						if (
+							notCodeGeneratedModules === undefined ||
+							codeGenerationDependencies.some(dep => {
+								const referencedModule = moduleGraph.getModule(dep);
+								return notCodeGeneratedModules.has(referencedModule);
+							})
+						) {
+							delayedJobs.push(job);
+							delayedModules.add(module);
+							return callback();
+						}
+					}
+					const { hash, runtime, runtimes } = job;
+					this._codeGenerationModule(
+						module,
+						runtime,
+						runtimes,
+						hash,
+						dependencyTemplates,
+						chunkGraph,
+						moduleGraph,
+						runtimeTemplate,
+						errors,
+						results,
+						(err, codeGenerated) => {
+							if (codeGenerated) statModulesGenerated++;
+							else statModulesFromCache++;
+							callback(err);
+						}
+					);
+				},
+				err => {
+					if (err) return callback(err);
+					if (delayedJobs.length > 0) {
+						if (delayedJobs.length === jobs.length) {
+							return callback(
+								new Error(
+									`Unable to make progress during code generation because of circular code generation dependency: ${Array.from(
+										delayedModules,
+										m => m.identifier()
+									).join(", ")}`
+								)
+							);
+						}
+						jobs = delayedJobs;
+						delayedJobs = [];
+						notCodeGeneratedModules = delayedModules;
+						delayedModules = new Set();
+						return runIteration();
+					}
+					if (errors.length > 0) {
+						errors.sort(
+							compareSelect(err => err.module, compareModulesByIdentifier)
+						);
+						for (const error of errors) {
+							this.errors.push(error);
+						}
+					}
+					this.logger.log(
+						`${Math.round(
+							(100 * statModulesGenerated) /
+								(statModulesGenerated + statModulesFromCache)
+						)}% code generated (${statModulesGenerated} generated, ${statModulesFromCache} from cache)`
+					);
+					callback();
+				}
+			);
+		};
+		runIteration();
+	}
+
+	/**
+	 * @param {Module} module module
+	 * @param {RuntimeSpec} runtime runtime
+	 * @param {RuntimeSpec[]} runtimes runtimes
+	 * @param {string} hash hash
+	 * @param {DependencyTemplates} dependencyTemplates dependencyTemplates
+	 * @param {ChunkGraph} chunkGraph chunkGraph
+	 * @param {ModuleGraph} moduleGraph moduleGraph
+	 * @param {RuntimeTemplate} runtimeTemplate runtimeTemplate
+	 * @param {WebpackError[]} errors errors
+	 * @param {CodeGenerationResults} results results
+	 * @param {function(WebpackError=, boolean=): void} callback callback
+	 */
+	_codeGenerationModule(
+		module,
+		runtime,
+		runtimes,
+		hash,
+		dependencyTemplates,
+		chunkGraph,
+		moduleGraph,
+		runtimeTemplate,
+		errors,
+		results,
+		callback
+	) {
+		let codeGenerated = false;
+		const cache = new MultiItemCache(
+			runtimes.map(runtime =>
+				this._codeGenerationCache.getItemCache(
+					`${module.identifier()}|${getRuntimeKey(runtime)}`,
+					`${hash}|${dependencyTemplates.getHash()}`
+				)
+			)
+		);
+		cache.get((err, cachedResult) => {
+			if (err) return callback(err);
+			let result;
+			if (!cachedResult) {
+				try {
+					codeGenerated = true;
+					this.codeGeneratedModules.add(module);
+					result = module.codeGeneration({
+						chunkGraph,
+						moduleGraph,
+						dependencyTemplates,
+						runtimeTemplate,
+						runtime,
+						codeGenerationResults: results
+					});
+				} catch (err) {
+					errors.push(new CodeGenerationError(module, err));
+					result = cachedResult = {
+						sources: new Map(),
+						runtimeRequirements: null
+					};
+				}
+			} else {
+				result = cachedResult;
+			}
+			for (const runtime of runtimes) {
+				results.add(module, runtime, result);
+			}
+			if (!cachedResult) {
+				cache.store(result, err => callback(err, codeGenerated));
+			} else {
+				callback(null, codeGenerated);
+			}
+		});
+	}
+
+	_getChunkGraphEntries() {
+		/** @type {Set<Chunk>} */
+		const treeEntries = new Set();
+		for (const ep of this.entrypoints.values()) {
+			const chunk = ep.getRuntimeChunk();
+			if (chunk) treeEntries.add(chunk);
+		}
+		for (const ep of this.asyncEntrypoints) {
+			const chunk = ep.getRuntimeChunk();
+			if (chunk) treeEntries.add(chunk);
+		}
+		return treeEntries;
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {ChunkGraph=} options.chunkGraph the chunk graph
+	 * @param {Iterable<Module>=} options.modules modules
+	 * @param {Iterable<Chunk>=} options.chunks chunks
+	 * @param {CodeGenerationResults=} options.codeGenerationResults codeGenerationResults
+	 * @param {Iterable<Chunk>=} options.chunkGraphEntries chunkGraphEntries
+	 * @returns {void}
+	 */
+	processRuntimeRequirements({
+		chunkGraph = this.chunkGraph,
+		modules = this.modules,
+		chunks = this.chunks,
+		codeGenerationResults = this.codeGenerationResults,
+		chunkGraphEntries = this._getChunkGraphEntries()
+	} = {}) {
+		const context = { chunkGraph, codeGenerationResults };
+		const { moduleMemCaches2 } = this;
+		this.logger.time("runtime requirements.modules");
+		const additionalModuleRuntimeRequirements =
+			this.hooks.additionalModuleRuntimeRequirements;
+		const runtimeRequirementInModule = this.hooks.runtimeRequirementInModule;
+		for (const module of modules) {
+			if (chunkGraph.getNumberOfModuleChunks(module) > 0) {
+				const memCache = moduleMemCaches2 && moduleMemCaches2.get(module);
+				for (const runtime of chunkGraph.getModuleRuntimes(module)) {
+					if (memCache) {
+						const cached = memCache.get(
+							`moduleRuntimeRequirements-${getRuntimeKey(runtime)}`
+						);
+						if (cached !== undefined) {
+							if (cached !== null) {
+								chunkGraph.addModuleRuntimeRequirements(
+									module,
+									runtime,
+									cached,
+									false
+								);
+							}
+							continue;
+						}
+					}
+					let set;
+					const runtimeRequirements =
+						codeGenerationResults.getRuntimeRequirements(module, runtime);
+					if (runtimeRequirements && runtimeRequirements.size > 0) {
+						set = new Set(runtimeRequirements);
+					} else if (additionalModuleRuntimeRequirements.isUsed()) {
+						set = new Set();
+					} else {
+						if (memCache) {
+							memCache.set(
+								`moduleRuntimeRequirements-${getRuntimeKey(runtime)}`,
+								null
+							);
+						}
+						continue;
+					}
+					additionalModuleRuntimeRequirements.call(module, set, context);
+
+					for (const r of set) {
+						const hook = runtimeRequirementInModule.get(r);
+						if (hook !== undefined) hook.call(module, set, context);
+					}
+					if (set.size === 0) {
+						if (memCache) {
+							memCache.set(
+								`moduleRuntimeRequirements-${getRuntimeKey(runtime)}`,
+								null
+							);
+						}
+					} else {
+						if (memCache) {
+							memCache.set(
+								`moduleRuntimeRequirements-${getRuntimeKey(runtime)}`,
+								set
+							);
+							chunkGraph.addModuleRuntimeRequirements(
+								module,
+								runtime,
+								set,
+								false
+							);
+						} else {
+							chunkGraph.addModuleRuntimeRequirements(module, runtime, set);
+						}
+					}
+				}
+			}
+		}
+		this.logger.timeEnd("runtime requirements.modules");
+
+		this.logger.time("runtime requirements.chunks");
+		for (const chunk of chunks) {
+			const set = new Set();
+			for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+				const runtimeRequirements = chunkGraph.getModuleRuntimeRequirements(
+					module,
+					chunk.runtime
+				);
+				for (const r of runtimeRequirements) set.add(r);
+			}
+			this.hooks.additionalChunkRuntimeRequirements.call(chunk, set, context);
+
+			for (const r of set) {
+				this.hooks.runtimeRequirementInChunk.for(r).call(chunk, set, context);
+			}
+
+			chunkGraph.addChunkRuntimeRequirements(chunk, set);
+		}
+		this.logger.timeEnd("runtime requirements.chunks");
+
+		this.logger.time("runtime requirements.entries");
+		for (const treeEntry of chunkGraphEntries) {
+			const set = new Set();
+			for (const chunk of treeEntry.getAllReferencedChunks()) {
+				const runtimeRequirements =
+					chunkGraph.getChunkRuntimeRequirements(chunk);
+				for (const r of runtimeRequirements) set.add(r);
+			}
+
+			this.hooks.additionalTreeRuntimeRequirements.call(
+				treeEntry,
+				set,
+				context
+			);
+
+			for (const r of set) {
+				this.hooks.runtimeRequirementInTree
+					.for(r)
+					.call(treeEntry, set, context);
+			}
+
+			chunkGraph.addTreeRuntimeRequirements(treeEntry, set);
+		}
+		this.logger.timeEnd("runtime requirements.entries");
+	}
+
+	// TODO webpack 6 make chunkGraph argument non-optional
+	/**
+	 * @param {Chunk} chunk target chunk
+	 * @param {RuntimeModule} module runtime module
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {void}
+	 */
+	addRuntimeModule(chunk, module, chunkGraph = this.chunkGraph) {
+		// Deprecated ModuleGraph association
+		if (this._backCompat)
+			ModuleGraph.setModuleGraphForModule(module, this.moduleGraph);
+
+		// add it to the list
+		this.modules.add(module);
+		this._modules.set(module.identifier(), module);
+
+		// connect to the chunk graph
+		chunkGraph.connectChunkAndModule(chunk, module);
+		chunkGraph.connectChunkAndRuntimeModule(chunk, module);
+		if (module.fullHash) {
+			chunkGraph.addFullHashModuleToChunk(chunk, module);
+		} else if (module.dependentHash) {
+			chunkGraph.addDependentHashModuleToChunk(chunk, module);
+		}
+
+		// attach runtime module
+		module.attach(this, chunk, chunkGraph);
+
+		// Setup internals
+		const exportsInfo = this.moduleGraph.getExportsInfo(module);
+		exportsInfo.setHasProvideInfo();
+		if (typeof chunk.runtime === "string") {
+			exportsInfo.setUsedForSideEffectsOnly(chunk.runtime);
+		} else if (chunk.runtime === undefined) {
+			exportsInfo.setUsedForSideEffectsOnly(undefined);
+		} else {
+			for (const runtime of chunk.runtime) {
+				exportsInfo.setUsedForSideEffectsOnly(runtime);
+			}
+		}
+		chunkGraph.addModuleRuntimeRequirements(
+			module,
+			chunk.runtime,
+			new Set([RuntimeGlobals.requireScope])
+		);
+
+		// runtime modules don't need ids
+		chunkGraph.setModuleId(module, "");
+
+		// Call hook
+		this.hooks.runtimeModule.call(module, chunk);
+	}
+
+	/**
+	 * If `module` is passed, `loc` and `request` must also be passed.
+	 * @param {string | ChunkGroupOptions} groupOptions options for the chunk group
+	 * @param {Module=} module the module the references the chunk group
+	 * @param {DependencyLocation=} loc the location from with the chunk group is referenced (inside of module)
+	 * @param {string=} request the request from which the the chunk group is referenced
+	 * @returns {ChunkGroup} the new or existing chunk group
+	 */
+	addChunkInGroup(groupOptions, module, loc, request) {
+		if (typeof groupOptions === "string") {
+			groupOptions = { name: groupOptions };
+		}
+		const name = groupOptions.name;
+
+		if (name) {
+			const chunkGroup = this.namedChunkGroups.get(name);
+			if (chunkGroup !== undefined) {
+				chunkGroup.addOptions(groupOptions);
+				if (module) {
+					chunkGroup.addOrigin(module, loc, request);
+				}
+				return chunkGroup;
+			}
+		}
+		const chunkGroup = new ChunkGroup(groupOptions);
+		if (module) chunkGroup.addOrigin(module, loc, request);
+		const chunk = this.addChunk(name);
+
+		connectChunkGroupAndChunk(chunkGroup, chunk);
+
+		this.chunkGroups.push(chunkGroup);
+		if (name) {
+			this.namedChunkGroups.set(name, chunkGroup);
+		}
+		return chunkGroup;
+	}
+
+	/**
+	 * @param {EntryOptions} options options for the entrypoint
+	 * @param {Module} module the module the references the chunk group
+	 * @param {DependencyLocation} loc the location from with the chunk group is referenced (inside of module)
+	 * @param {string} request the request from which the the chunk group is referenced
+	 * @returns {Entrypoint} the new or existing entrypoint
+	 */
+	addAsyncEntrypoint(options, module, loc, request) {
+		const name = options.name;
+		if (name) {
+			const entrypoint = this.namedChunkGroups.get(name);
+			if (entrypoint instanceof Entrypoint) {
+				if (entrypoint !== undefined) {
+					if (module) {
+						entrypoint.addOrigin(module, loc, request);
+					}
+					return entrypoint;
+				}
+			} else if (entrypoint) {
+				throw new Error(
+					`Cannot add an async entrypoint with the name '${name}', because there is already an chunk group with this name`
+				);
+			}
+		}
+		const chunk = this.addChunk(name);
+		if (options.filename) {
+			chunk.filenameTemplate = options.filename;
+		}
+		const entrypoint = new Entrypoint(options, false);
+		entrypoint.setRuntimeChunk(chunk);
+		entrypoint.setEntrypointChunk(chunk);
+		if (name) {
+			this.namedChunkGroups.set(name, entrypoint);
+		}
+		this.chunkGroups.push(entrypoint);
+		this.asyncEntrypoints.push(entrypoint);
+		connectChunkGroupAndChunk(entrypoint, chunk);
+		if (module) {
+			entrypoint.addOrigin(module, loc, request);
+		}
+		return entrypoint;
+	}
+
+	/**
+	 * This method first looks to see if a name is provided for a new chunk,
+	 * and first looks to see if any named chunks already exist and reuse that chunk instead.
+	 *
+	 * @param {string=} name optional chunk name to be provided
+	 * @returns {Chunk} create a chunk (invoked during seal event)
+	 */
+	addChunk(name) {
+		if (name) {
+			const chunk = this.namedChunks.get(name);
+			if (chunk !== undefined) {
+				return chunk;
+			}
+		}
+		const chunk = new Chunk(name, this._backCompat);
+		this.chunks.add(chunk);
+		if (this._backCompat)
+			ChunkGraph.setChunkGraphForChunk(chunk, this.chunkGraph);
+		if (name) {
+			this.namedChunks.set(name, chunk);
+		}
+		return chunk;
+	}
+
+	/**
+	 * @deprecated
+	 * @param {Module} module module to assign depth
+	 * @returns {void}
+	 */
+	assignDepth(module) {
+		const moduleGraph = this.moduleGraph;
+
+		const queue = new Set([module]);
+		let depth;
+
+		moduleGraph.setDepth(module, 0);
+
+		/**
+		 * @param {Module} module module for processing
+		 * @returns {void}
+		 */
+		const processModule = module => {
+			if (!moduleGraph.setDepthIfLower(module, depth)) return;
+			queue.add(module);
+		};
+
+		for (module of queue) {
+			queue.delete(module);
+			depth = moduleGraph.getDepth(module) + 1;
+
+			for (const connection of moduleGraph.getOutgoingConnections(module)) {
+				const refModule = connection.module;
+				if (refModule) {
+					processModule(refModule);
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {Set<Module>} modules module to assign depth
+	 * @returns {void}
+	 */
+	assignDepths(modules) {
+		const moduleGraph = this.moduleGraph;
+
+		/** @type {Set<Module | number>} */
+		const queue = new Set(modules);
+		queue.add(1);
+		let depth = 0;
+
+		let i = 0;
+		for (const module of queue) {
+			i++;
+			if (typeof module === "number") {
+				depth = module;
+				if (queue.size === i) return;
+				queue.add(depth + 1);
+			} else {
+				moduleGraph.setDepth(module, depth);
+				for (const { module: refModule } of moduleGraph.getOutgoingConnections(
+					module
+				)) {
+					if (refModule) {
+						queue.add(refModule);
+					}
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getDependencyReferencedExports(dependency, runtime) {
+		const referencedExports = dependency.getReferencedExports(
+			this.moduleGraph,
+			runtime
+		);
+		return this.hooks.dependencyReferencedExports.call(
+			referencedExports,
+			dependency,
+			runtime
+		);
+	}
+
+	/**
+	 *
+	 * @param {Module} module module relationship for removal
+	 * @param {DependenciesBlockLike} block //TODO: good description
+	 * @returns {void}
+	 */
+	removeReasonsOfDependencyBlock(module, block) {
+		if (block.blocks) {
+			for (const b of block.blocks) {
+				this.removeReasonsOfDependencyBlock(module, b);
+			}
+		}
+
+		if (block.dependencies) {
+			for (const dep of block.dependencies) {
+				const originalModule = this.moduleGraph.getModule(dep);
+				if (originalModule) {
+					this.moduleGraph.removeConnection(dep);
+
+					if (this.chunkGraph) {
+						for (const chunk of this.chunkGraph.getModuleChunks(
+							originalModule
+						)) {
+							this.patchChunksAfterReasonRemoval(originalModule, chunk);
+						}
+					}
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {Module} module module to patch tie
+	 * @param {Chunk} chunk chunk to patch tie
+	 * @returns {void}
+	 */
+	patchChunksAfterReasonRemoval(module, chunk) {
+		if (!module.hasReasons(this.moduleGraph, chunk.runtime)) {
+			this.removeReasonsOfDependencyBlock(module, module);
+		}
+		if (!module.hasReasonForChunk(chunk, this.moduleGraph, this.chunkGraph)) {
+			if (this.chunkGraph.isModuleInChunk(module, chunk)) {
+				this.chunkGraph.disconnectChunkAndModule(chunk, module);
+				this.removeChunkFromDependencies(module, chunk);
+			}
+		}
+	}
+
+	/**
+	 *
+	 * @param {DependenciesBlock} block block tie for Chunk
+	 * @param {Chunk} chunk chunk to remove from dep
+	 * @returns {void}
+	 */
+	removeChunkFromDependencies(block, chunk) {
+		/**
+		 * @param {Dependency} d dependency to (maybe) patch up
+		 */
+		const iteratorDependency = d => {
+			const depModule = this.moduleGraph.getModule(d);
+			if (!depModule) {
+				return;
+			}
+			this.patchChunksAfterReasonRemoval(depModule, chunk);
+		};
+
+		const blocks = block.blocks;
+		for (let indexBlock = 0; indexBlock < blocks.length; indexBlock++) {
+			const asyncBlock = blocks[indexBlock];
+			const chunkGroup = this.chunkGraph.getBlockChunkGroup(asyncBlock);
+			// Grab all chunks from the first Block's AsyncDepBlock
+			const chunks = chunkGroup.chunks;
+			// For each chunk in chunkGroup
+			for (let indexChunk = 0; indexChunk < chunks.length; indexChunk++) {
+				const iteratedChunk = chunks[indexChunk];
+				chunkGroup.removeChunk(iteratedChunk);
+				// Recurse
+				this.removeChunkFromDependencies(block, iteratedChunk);
+			}
+		}
+
+		if (block.dependencies) {
+			for (const dep of block.dependencies) iteratorDependency(dep);
+		}
+	}
+
+	assignRuntimeIds() {
+		const { chunkGraph } = this;
+		const processEntrypoint = ep => {
+			const runtime = ep.options.runtime || ep.name;
+			const chunk = ep.getRuntimeChunk();
+			chunkGraph.setRuntimeId(runtime, chunk.id);
+		};
+		for (const ep of this.entrypoints.values()) {
+			processEntrypoint(ep);
+		}
+		for (const ep of this.asyncEntrypoints) {
+			processEntrypoint(ep);
+		}
+	}
+
+	sortItemsWithChunkIds() {
+		for (const chunkGroup of this.chunkGroups) {
+			chunkGroup.sortItems();
+		}
+
+		this.errors.sort(compareErrors);
+		this.warnings.sort(compareErrors);
+		this.children.sort(byNameOrHash);
+	}
+
+	summarizeDependencies() {
+		for (
+			let indexChildren = 0;
+			indexChildren < this.children.length;
+			indexChildren++
+		) {
+			const child = this.children[indexChildren];
+
+			this.fileDependencies.addAll(child.fileDependencies);
+			this.contextDependencies.addAll(child.contextDependencies);
+			this.missingDependencies.addAll(child.missingDependencies);
+			this.buildDependencies.addAll(child.buildDependencies);
+		}
+
+		for (const module of this.modules) {
+			module.addCacheDependencies(
+				this.fileDependencies,
+				this.contextDependencies,
+				this.missingDependencies,
+				this.buildDependencies
+			);
+		}
+	}
+
+	createModuleHashes() {
+		let statModulesHashed = 0;
+		let statModulesFromCache = 0;
+		const { chunkGraph, runtimeTemplate, moduleMemCaches2 } = this;
+		const { hashFunction, hashDigest, hashDigestLength } = this.outputOptions;
+		const errors = [];
+		for (const module of this.modules) {
+			const memCache = moduleMemCaches2 && moduleMemCaches2.get(module);
+			for (const runtime of chunkGraph.getModuleRuntimes(module)) {
+				if (memCache) {
+					const digest = memCache.get(`moduleHash-${getRuntimeKey(runtime)}`);
+					if (digest !== undefined) {
+						chunkGraph.setModuleHashes(
+							module,
+							runtime,
+							digest,
+							digest.substr(0, hashDigestLength)
+						);
+						statModulesFromCache++;
+						continue;
+					}
+				}
+				statModulesHashed++;
+				const digest = this._createModuleHash(
+					module,
+					chunkGraph,
+					runtime,
+					hashFunction,
+					runtimeTemplate,
+					hashDigest,
+					hashDigestLength,
+					errors
+				);
+				if (memCache) {
+					memCache.set(`moduleHash-${getRuntimeKey(runtime)}`, digest);
+				}
+			}
+		}
+		if (errors.length > 0) {
+			errors.sort(compareSelect(err => err.module, compareModulesByIdentifier));
+			for (const error of errors) {
+				this.errors.push(error);
+			}
+		}
+		this.logger.log(
+			`${statModulesHashed} modules hashed, ${statModulesFromCache} from cache (${
+				Math.round(
+					(100 * (statModulesHashed + statModulesFromCache)) / this.modules.size
+				) / 100
+			} variants per module in average)`
+		);
+	}
+
+	_createModuleHash(
+		module,
+		chunkGraph,
+		runtime,
+		hashFunction,
+		runtimeTemplate,
+		hashDigest,
+		hashDigestLength,
+		errors
+	) {
+		let moduleHashDigest;
+		try {
+			const moduleHash = createHash(hashFunction);
+			module.updateHash(moduleHash, {
+				chunkGraph,
+				runtime,
+				runtimeTemplate
+			});
+			moduleHashDigest = /** @type {string} */ (moduleHash.digest(hashDigest));
+		} catch (err) {
+			errors.push(new ModuleHashingError(module, err));
+			moduleHashDigest = "XXXXXX";
+		}
+		chunkGraph.setModuleHashes(
+			module,
+			runtime,
+			moduleHashDigest,
+			moduleHashDigest.substr(0, hashDigestLength)
+		);
+		return moduleHashDigest;
+	}
+
+	createHash() {
+		this.logger.time("hashing: initialize hash");
+		const chunkGraph = this.chunkGraph;
+		const runtimeTemplate = this.runtimeTemplate;
+		const outputOptions = this.outputOptions;
+		const hashFunction = outputOptions.hashFunction;
+		const hashDigest = outputOptions.hashDigest;
+		const hashDigestLength = outputOptions.hashDigestLength;
+		const hash = createHash(hashFunction);
+		if (outputOptions.hashSalt) {
+			hash.update(outputOptions.hashSalt);
+		}
+		this.logger.timeEnd("hashing: initialize hash");
+		if (this.children.length > 0) {
+			this.logger.time("hashing: hash child compilations");
+			for (const child of this.children) {
+				hash.update(child.hash);
+			}
+			this.logger.timeEnd("hashing: hash child compilations");
+		}
+		if (this.warnings.length > 0) {
+			this.logger.time("hashing: hash warnings");
+			for (const warning of this.warnings) {
+				hash.update(`${warning.message}`);
+			}
+			this.logger.timeEnd("hashing: hash warnings");
+		}
+		if (this.errors.length > 0) {
+			this.logger.time("hashing: hash errors");
+			for (const error of this.errors) {
+				hash.update(`${error.message}`);
+			}
+			this.logger.timeEnd("hashing: hash errors");
+		}
+
+		this.logger.time("hashing: sort chunks");
+		/*
+		 * all non-runtime chunks need to be hashes first,
+		 * since runtime chunk might use their hashes.
+		 * runtime chunks need to be hashed in the correct order
+		 * since they may depend on each other (for async entrypoints).
+		 * So we put all non-runtime chunks first and hash them in any order.
+		 * And order runtime chunks according to referenced between each other.
+		 * Chunks need to be in deterministic order since we add hashes to full chunk
+		 * during these hashing.
+		 */
+		/** @type {Chunk[]} */
+		const unorderedRuntimeChunks = [];
+		/** @type {Chunk[]} */
+		const otherChunks = [];
+		for (const c of this.chunks) {
+			if (c.hasRuntime()) {
+				unorderedRuntimeChunks.push(c);
+			} else {
+				otherChunks.push(c);
+			}
+		}
+		unorderedRuntimeChunks.sort(byId);
+		otherChunks.sort(byId);
+
+		/** @typedef {{ chunk: Chunk, referencedBy: RuntimeChunkInfo[], remaining: number }} RuntimeChunkInfo */
+		/** @type {Map<Chunk, RuntimeChunkInfo>} */
+		const runtimeChunksMap = new Map();
+		for (const chunk of unorderedRuntimeChunks) {
+			runtimeChunksMap.set(chunk, {
+				chunk,
+				referencedBy: [],
+				remaining: 0
+			});
+		}
+		let remaining = 0;
+		for (const info of runtimeChunksMap.values()) {
+			for (const other of new Set(
+				Array.from(info.chunk.getAllReferencedAsyncEntrypoints()).map(
+					e => e.chunks[e.chunks.length - 1]
+				)
+			)) {
+				const otherInfo = runtimeChunksMap.get(other);
+				otherInfo.referencedBy.push(info);
+				info.remaining++;
+				remaining++;
+			}
+		}
+		/** @type {Chunk[]} */
+		const runtimeChunks = [];
+		for (const info of runtimeChunksMap.values()) {
+			if (info.remaining === 0) {
+				runtimeChunks.push(info.chunk);
+			}
+		}
+		// If there are any references between chunks
+		// make sure to follow these chains
+		if (remaining > 0) {
+			const readyChunks = [];
+			for (const chunk of runtimeChunks) {
+				const hasFullHashModules =
+					chunkGraph.getNumberOfChunkFullHashModules(chunk) !== 0;
+				const info = runtimeChunksMap.get(chunk);
+				for (const otherInfo of info.referencedBy) {
+					if (hasFullHashModules) {
+						chunkGraph.upgradeDependentToFullHashModules(otherInfo.chunk);
+					}
+					remaining--;
+					if (--otherInfo.remaining === 0) {
+						readyChunks.push(otherInfo.chunk);
+					}
+				}
+				if (readyChunks.length > 0) {
+					// This ensures deterministic ordering, since referencedBy is non-deterministic
+					readyChunks.sort(byId);
+					for (const c of readyChunks) runtimeChunks.push(c);
+					readyChunks.length = 0;
+				}
+			}
+		}
+		// If there are still remaining references we have cycles and want to create a warning
+		if (remaining > 0) {
+			let circularRuntimeChunkInfo = [];
+			for (const info of runtimeChunksMap.values()) {
+				if (info.remaining !== 0) {
+					circularRuntimeChunkInfo.push(info);
+				}
+			}
+			circularRuntimeChunkInfo.sort(compareSelect(i => i.chunk, byId));
+			const err =
+				new WebpackError(`Circular dependency between chunks with runtime (${Array.from(
+					circularRuntimeChunkInfo,
+					c => c.chunk.name || c.chunk.id
+				).join(", ")})
+This prevents using hashes of each other and should be avoided.`);
+			err.chunk = circularRuntimeChunkInfo[0].chunk;
+			this.warnings.push(err);
+			for (const i of circularRuntimeChunkInfo) runtimeChunks.push(i.chunk);
+		}
+		this.logger.timeEnd("hashing: sort chunks");
+
+		const fullHashChunks = new Set();
+		/** @type {{module: Module, hash: string, runtime: RuntimeSpec, runtimes: RuntimeSpec[]}[]} */
+		const codeGenerationJobs = [];
+		/** @type {Map<string, Map<Module, {module: Module, hash: string, runtime: RuntimeSpec, runtimes: RuntimeSpec[]}>>} */
+		const codeGenerationJobsMap = new Map();
+		const errors = [];
+
+		const processChunk = chunk => {
+			// Last minute module hash generation for modules that depend on chunk hashes
+			this.logger.time("hashing: hash runtime modules");
+			const runtime = chunk.runtime;
+			for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+				if (!chunkGraph.hasModuleHashes(module, runtime)) {
+					const hash = this._createModuleHash(
+						module,
+						chunkGraph,
+						runtime,
+						hashFunction,
+						runtimeTemplate,
+						hashDigest,
+						hashDigestLength,
+						errors
+					);
+					let hashMap = codeGenerationJobsMap.get(hash);
+					if (hashMap) {
+						const moduleJob = hashMap.get(module);
+						if (moduleJob) {
+							moduleJob.runtimes.push(runtime);
+							continue;
+						}
+					} else {
+						hashMap = new Map();
+						codeGenerationJobsMap.set(hash, hashMap);
+					}
+					const job = {
+						module,
+						hash,
+						runtime,
+						runtimes: [runtime]
+					};
+					hashMap.set(module, job);
+					codeGenerationJobs.push(job);
+				}
+			}
+			this.logger.timeAggregate("hashing: hash runtime modules");
+			try {
+				this.logger.time("hashing: hash chunks");
+				const chunkHash = createHash(hashFunction);
+				if (outputOptions.hashSalt) {
+					chunkHash.update(outputOptions.hashSalt);
+				}
+				chunk.updateHash(chunkHash, chunkGraph);
+				this.hooks.chunkHash.call(chunk, chunkHash, {
+					chunkGraph,
+					codeGenerationResults: this.codeGenerationResults,
+					moduleGraph: this.moduleGraph,
+					runtimeTemplate: this.runtimeTemplate
+				});
+				const chunkHashDigest = /** @type {string} */ (
+					chunkHash.digest(hashDigest)
+				);
+				hash.update(chunkHashDigest);
+				chunk.hash = chunkHashDigest;
+				chunk.renderedHash = chunk.hash.substr(0, hashDigestLength);
+				const fullHashModules =
+					chunkGraph.getChunkFullHashModulesIterable(chunk);
+				if (fullHashModules) {
+					fullHashChunks.add(chunk);
+				} else {
+					this.hooks.contentHash.call(chunk);
+				}
+			} catch (err) {
+				this.errors.push(new ChunkRenderError(chunk, "", err));
+			}
+			this.logger.timeAggregate("hashing: hash chunks");
+		};
+		otherChunks.forEach(processChunk);
+		for (const chunk of runtimeChunks) processChunk(chunk);
+		if (errors.length > 0) {
+			errors.sort(compareSelect(err => err.module, compareModulesByIdentifier));
+			for (const error of errors) {
+				this.errors.push(error);
+			}
+		}
+
+		this.logger.timeAggregateEnd("hashing: hash runtime modules");
+		this.logger.timeAggregateEnd("hashing: hash chunks");
+		this.logger.time("hashing: hash digest");
+		this.hooks.fullHash.call(hash);
+		this.fullHash = /** @type {string} */ (hash.digest(hashDigest));
+		this.hash = this.fullHash.substr(0, hashDigestLength);
+		this.logger.timeEnd("hashing: hash digest");
+
+		this.logger.time("hashing: process full hash modules");
+		for (const chunk of fullHashChunks) {
+			for (const module of chunkGraph.getChunkFullHashModulesIterable(chunk)) {
+				const moduleHash = createHash(hashFunction);
+				module.updateHash(moduleHash, {
+					chunkGraph,
+					runtime: chunk.runtime,
+					runtimeTemplate
+				});
+				const moduleHashDigest = /** @type {string} */ (
+					moduleHash.digest(hashDigest)
+				);
+				const oldHash = chunkGraph.getModuleHash(module, chunk.runtime);
+				chunkGraph.setModuleHashes(
+					module,
+					chunk.runtime,
+					moduleHashDigest,
+					moduleHashDigest.substr(0, hashDigestLength)
+				);
+				codeGenerationJobsMap.get(oldHash).get(module).hash = moduleHashDigest;
+			}
+			const chunkHash = createHash(hashFunction);
+			chunkHash.update(chunk.hash);
+			chunkHash.update(this.hash);
+			const chunkHashDigest = /** @type {string} */ (
+				chunkHash.digest(hashDigest)
+			);
+			chunk.hash = chunkHashDigest;
+			chunk.renderedHash = chunk.hash.substr(0, hashDigestLength);
+			this.hooks.contentHash.call(chunk);
+		}
+		this.logger.timeEnd("hashing: process full hash modules");
+		return codeGenerationJobs;
+	}
+
+	/**
+	 * @param {string} file file name
+	 * @param {Source} source asset source
+	 * @param {AssetInfo} assetInfo extra asset information
+	 * @returns {void}
+	 */
+	emitAsset(file, source, assetInfo = {}) {
+		if (this.assets[file]) {
+			if (!isSourceEqual(this.assets[file], source)) {
+				this.errors.push(
+					new WebpackError(
+						`Conflict: Multiple assets emit different content to the same filename ${file}`
+					)
+				);
+				this.assets[file] = source;
+				this._setAssetInfo(file, assetInfo);
+				return;
+			}
+			const oldInfo = this.assetsInfo.get(file);
+			const newInfo = Object.assign({}, oldInfo, assetInfo);
+			this._setAssetInfo(file, newInfo, oldInfo);
+			return;
+		}
+		this.assets[file] = source;
+		this._setAssetInfo(file, assetInfo, undefined);
+	}
+
+	_setAssetInfo(file, newInfo, oldInfo = this.assetsInfo.get(file)) {
+		if (newInfo === undefined) {
+			this.assetsInfo.delete(file);
+		} else {
+			this.assetsInfo.set(file, newInfo);
+		}
+		const oldRelated = oldInfo && oldInfo.related;
+		const newRelated = newInfo && newInfo.related;
+		if (oldRelated) {
+			for (const key of Object.keys(oldRelated)) {
+				const remove = name => {
+					const relatedIn = this._assetsRelatedIn.get(name);
+					if (relatedIn === undefined) return;
+					const entry = relatedIn.get(key);
+					if (entry === undefined) return;
+					entry.delete(file);
+					if (entry.size !== 0) return;
+					relatedIn.delete(key);
+					if (relatedIn.size === 0) this._assetsRelatedIn.delete(name);
+				};
+				const entry = oldRelated[key];
+				if (Array.isArray(entry)) {
+					entry.forEach(remove);
+				} else if (entry) {
+					remove(entry);
+				}
+			}
+		}
+		if (newRelated) {
+			for (const key of Object.keys(newRelated)) {
+				const add = name => {
+					let relatedIn = this._assetsRelatedIn.get(name);
+					if (relatedIn === undefined) {
+						this._assetsRelatedIn.set(name, (relatedIn = new Map()));
+					}
+					let entry = relatedIn.get(key);
+					if (entry === undefined) {
+						relatedIn.set(key, (entry = new Set()));
+					}
+					entry.add(file);
+				};
+				const entry = newRelated[key];
+				if (Array.isArray(entry)) {
+					entry.forEach(add);
+				} else if (entry) {
+					add(entry);
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {string} file file name
+	 * @param {Source | function(Source): Source} newSourceOrFunction new asset source or function converting old to new
+	 * @param {AssetInfo | function(AssetInfo | undefined): AssetInfo} assetInfoUpdateOrFunction new asset info or function converting old to new
+	 */
+	updateAsset(
+		file,
+		newSourceOrFunction,
+		assetInfoUpdateOrFunction = undefined
+	) {
+		if (!this.assets[file]) {
+			throw new Error(
+				`Called Compilation.updateAsset for not existing filename ${file}`
+			);
+		}
+		if (typeof newSourceOrFunction === "function") {
+			this.assets[file] = newSourceOrFunction(this.assets[file]);
+		} else {
+			this.assets[file] = newSourceOrFunction;
+		}
+		if (assetInfoUpdateOrFunction !== undefined) {
+			const oldInfo = this.assetsInfo.get(file) || EMPTY_ASSET_INFO;
+			if (typeof assetInfoUpdateOrFunction === "function") {
+				this._setAssetInfo(file, assetInfoUpdateOrFunction(oldInfo), oldInfo);
+			} else {
+				this._setAssetInfo(
+					file,
+					cachedCleverMerge(oldInfo, assetInfoUpdateOrFunction),
+					oldInfo
+				);
+			}
+		}
+	}
+
+	renameAsset(file, newFile) {
+		const source = this.assets[file];
+		if (!source) {
+			throw new Error(
+				`Called Compilation.renameAsset for not existing filename ${file}`
+			);
+		}
+		if (this.assets[newFile]) {
+			if (!isSourceEqual(this.assets[file], source)) {
+				this.errors.push(
+					new WebpackError(
+						`Conflict: Called Compilation.renameAsset for already existing filename ${newFile} with different content`
+					)
+				);
+			}
+		}
+		const assetInfo = this.assetsInfo.get(file);
+		// Update related in all other assets
+		const relatedInInfo = this._assetsRelatedIn.get(file);
+		if (relatedInInfo) {
+			for (const [key, assets] of relatedInInfo) {
+				for (const name of assets) {
+					const info = this.assetsInfo.get(name);
+					if (!info) continue;
+					const related = info.related;
+					if (!related) continue;
+					const entry = related[key];
+					let newEntry;
+					if (Array.isArray(entry)) {
+						newEntry = entry.map(x => (x === file ? newFile : x));
+					} else if (entry === file) {
+						newEntry = newFile;
+					} else continue;
+					this.assetsInfo.set(name, {
+						...info,
+						related: {
+							...related,
+							[key]: newEntry
+						}
+					});
+				}
+			}
+		}
+		this._setAssetInfo(file, undefined, assetInfo);
+		this._setAssetInfo(newFile, assetInfo);
+		delete this.assets[file];
+		this.assets[newFile] = source;
+		for (const chunk of this.chunks) {
+			{
+				const size = chunk.files.size;
+				chunk.files.delete(file);
+				if (size !== chunk.files.size) {
+					chunk.files.add(newFile);
+				}
+			}
+			{
+				const size = chunk.auxiliaryFiles.size;
+				chunk.auxiliaryFiles.delete(file);
+				if (size !== chunk.auxiliaryFiles.size) {
+					chunk.auxiliaryFiles.add(newFile);
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {string} file file name
+	 */
+	deleteAsset(file) {
+		if (!this.assets[file]) {
+			return;
+		}
+		delete this.assets[file];
+		const assetInfo = this.assetsInfo.get(file);
+		this._setAssetInfo(file, undefined, assetInfo);
+		const related = assetInfo && assetInfo.related;
+		if (related) {
+			for (const key of Object.keys(related)) {
+				const checkUsedAndDelete = file => {
+					if (!this._assetsRelatedIn.has(file)) {
+						this.deleteAsset(file);
+					}
+				};
+				const items = related[key];
+				if (Array.isArray(items)) {
+					items.forEach(checkUsedAndDelete);
+				} else if (items) {
+					checkUsedAndDelete(items);
+				}
+			}
+		}
+		// TODO If this becomes a performance problem
+		// store a reverse mapping from asset to chunk
+		for (const chunk of this.chunks) {
+			chunk.files.delete(file);
+			chunk.auxiliaryFiles.delete(file);
+		}
+	}
+
+	getAssets() {
+		/** @type {Readonly<Asset>[]} */
+		const array = [];
+		for (const assetName of Object.keys(this.assets)) {
+			if (Object.prototype.hasOwnProperty.call(this.assets, assetName)) {
+				array.push({
+					name: assetName,
+					source: this.assets[assetName],
+					info: this.assetsInfo.get(assetName) || EMPTY_ASSET_INFO
+				});
+			}
+		}
+		return array;
+	}
+
+	/**
+	 * @param {string} name the name of the asset
+	 * @returns {Readonly<Asset> | undefined} the asset or undefined when not found
+	 */
+	getAsset(name) {
+		if (!Object.prototype.hasOwnProperty.call(this.assets, name))
+			return undefined;
+		return {
+			name,
+			source: this.assets[name],
+			info: this.assetsInfo.get(name) || EMPTY_ASSET_INFO
+		};
+	}
+
+	clearAssets() {
+		for (const chunk of this.chunks) {
+			chunk.files.clear();
+			chunk.auxiliaryFiles.clear();
+		}
+	}
+
+	createModuleAssets() {
+		const { chunkGraph } = this;
+		for (const module of this.modules) {
+			if (module.buildInfo.assets) {
+				const assetsInfo = module.buildInfo.assetsInfo;
+				for (const assetName of Object.keys(module.buildInfo.assets)) {
+					const fileName = this.getPath(assetName, {
+						chunkGraph: this.chunkGraph,
+						module
+					});
+					for (const chunk of chunkGraph.getModuleChunksIterable(module)) {
+						chunk.auxiliaryFiles.add(fileName);
+					}
+					this.emitAsset(
+						fileName,
+						module.buildInfo.assets[assetName],
+						assetsInfo ? assetsInfo.get(assetName) : undefined
+					);
+					this.hooks.moduleAsset.call(module, fileName);
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {RenderManifestOptions} options options object
+	 * @returns {RenderManifestEntry[]} manifest entries
+	 */
+	getRenderManifest(options) {
+		return this.hooks.renderManifest.call([], options);
+	}
+
+	/**
+	 * @param {Callback} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	createChunkAssets(callback) {
+		const outputOptions = this.outputOptions;
+		const cachedSourceMap = new WeakMap();
+		/** @type {Map<string, {hash: string, source: Source, chunk: Chunk}>} */
+		const alreadyWrittenFiles = new Map();
+
+		asyncLib.forEachLimit(
+			this.chunks,
+			15,
+			(chunk, callback) => {
+				/** @type {RenderManifestEntry[]} */
+				let manifest;
+				try {
+					manifest = this.getRenderManifest({
+						chunk,
+						hash: this.hash,
+						fullHash: this.fullHash,
+						outputOptions,
+						codeGenerationResults: this.codeGenerationResults,
+						moduleTemplates: this.moduleTemplates,
+						dependencyTemplates: this.dependencyTemplates,
+						chunkGraph: this.chunkGraph,
+						moduleGraph: this.moduleGraph,
+						runtimeTemplate: this.runtimeTemplate
+					});
+				} catch (err) {
+					this.errors.push(new ChunkRenderError(chunk, "", err));
+					return callback();
+				}
+				asyncLib.forEach(
+					manifest,
+					(fileManifest, callback) => {
+						const ident = fileManifest.identifier;
+						const usedHash = fileManifest.hash;
+
+						const assetCacheItem = this._assetsCache.getItemCache(
+							ident,
+							usedHash
+						);
+
+						assetCacheItem.get((err, sourceFromCache) => {
+							/** @type {string | function(PathData, AssetInfo=): string} */
+							let filenameTemplate;
+							/** @type {string} */
+							let file;
+							/** @type {AssetInfo} */
+							let assetInfo;
+
+							let inTry = true;
+							const errorAndCallback = err => {
+								const filename =
+									file ||
+									(typeof file === "string"
+										? file
+										: typeof filenameTemplate === "string"
+										? filenameTemplate
+										: "");
+
+								this.errors.push(new ChunkRenderError(chunk, filename, err));
+								inTry = false;
+								return callback();
+							};
+
+							try {
+								if ("filename" in fileManifest) {
+									file = fileManifest.filename;
+									assetInfo = fileManifest.info;
+								} else {
+									filenameTemplate = fileManifest.filenameTemplate;
+									const pathAndInfo = this.getPathWithInfo(
+										filenameTemplate,
+										fileManifest.pathOptions
+									);
+									file = pathAndInfo.path;
+									assetInfo = fileManifest.info
+										? {
+												...pathAndInfo.info,
+												...fileManifest.info
+										  }
+										: pathAndInfo.info;
+								}
+
+								if (err) {
+									return errorAndCallback(err);
+								}
+
+								let source = sourceFromCache;
+
+								// check if the same filename was already written by another chunk
+								const alreadyWritten = alreadyWrittenFiles.get(file);
+								if (alreadyWritten !== undefined) {
+									if (alreadyWritten.hash !== usedHash) {
+										inTry = false;
+										return callback(
+											new WebpackError(
+												`Conflict: Multiple chunks emit assets to the same filename ${file}` +
+													` (chunks ${alreadyWritten.chunk.id} and ${chunk.id})`
+											)
+										);
+									} else {
+										source = alreadyWritten.source;
+									}
+								} else if (!source) {
+									// render the asset
+									source = fileManifest.render();
+
+									// Ensure that source is a cached source to avoid additional cost because of repeated access
+									if (!(source instanceof CachedSource)) {
+										const cacheEntry = cachedSourceMap.get(source);
+										if (cacheEntry) {
+											source = cacheEntry;
+										} else {
+											const cachedSource = new CachedSource(source);
+											cachedSourceMap.set(source, cachedSource);
+											source = cachedSource;
+										}
+									}
+								}
+								this.emitAsset(file, source, assetInfo);
+								if (fileManifest.auxiliary) {
+									chunk.auxiliaryFiles.add(file);
+								} else {
+									chunk.files.add(file);
+								}
+								this.hooks.chunkAsset.call(chunk, file);
+								alreadyWrittenFiles.set(file, {
+									hash: usedHash,
+									source,
+									chunk
+								});
+								if (source !== sourceFromCache) {
+									assetCacheItem.store(source, err => {
+										if (err) return errorAndCallback(err);
+										inTry = false;
+										return callback();
+									});
+								} else {
+									inTry = false;
+									callback();
+								}
+							} catch (err) {
+								if (!inTry) throw err;
+								errorAndCallback(err);
+							}
+						});
+					},
+					callback
+				);
+			},
+			callback
+		);
+	}
+
+	/**
+	 * @param {string | function(PathData, AssetInfo=): string} filename used to get asset path with hash
+	 * @param {PathData} data context data
+	 * @returns {string} interpolated path
+	 */
+	getPath(filename, data = {}) {
+		if (!data.hash) {
+			data = {
+				hash: this.hash,
+				...data
+			};
+		}
+		return this.getAssetPath(filename, data);
+	}
+
+	/**
+	 * @param {string | function(PathData, AssetInfo=): string} filename used to get asset path with hash
+	 * @param {PathData} data context data
+	 * @returns {{ path: string, info: AssetInfo }} interpolated path and asset info
+	 */
+	getPathWithInfo(filename, data = {}) {
+		if (!data.hash) {
+			data = {
+				hash: this.hash,
+				...data
+			};
+		}
+		return this.getAssetPathWithInfo(filename, data);
+	}
+
+	/**
+	 * @param {string | function(PathData, AssetInfo=): string} filename used to get asset path with hash
+	 * @param {PathData} data context data
+	 * @returns {string} interpolated path
+	 */
+	getAssetPath(filename, data) {
+		return this.hooks.assetPath.call(
+			typeof filename === "function" ? filename(data) : filename,
+			data,
+			undefined
+		);
+	}
+
+	/**
+	 * @param {string | function(PathData, AssetInfo=): string} filename used to get asset path with hash
+	 * @param {PathData} data context data
+	 * @returns {{ path: string, info: AssetInfo }} interpolated path and asset info
+	 */
+	getAssetPathWithInfo(filename, data) {
+		const assetInfo = {};
+		// TODO webpack 5: refactor assetPath hook to receive { path, info } object
+		const newPath = this.hooks.assetPath.call(
+			typeof filename === "function" ? filename(data, assetInfo) : filename,
+			data,
+			assetInfo
+		);
+		return { path: newPath, info: assetInfo };
+	}
+
+	getWarnings() {
+		return this.hooks.processWarnings.call(this.warnings);
+	}
+
+	getErrors() {
+		return this.hooks.processErrors.call(this.errors);
+	}
+
+	/**
+	 * This function allows you to run another instance of webpack inside of webpack however as
+	 * a child with different settings and configurations (if desired) applied. It copies all hooks, plugins
+	 * from parent (or top level compiler) and creates a child Compilation
+	 *
+	 * @param {string} name name of the child compiler
+	 * @param {OutputOptions=} outputOptions // Need to convert config schema to types for this
+	 * @param {Array<WebpackPluginInstance | WebpackPluginFunction>=} plugins webpack plugins that will be applied
+	 * @returns {Compiler} creates a child Compiler instance
+	 */
+	createChildCompiler(name, outputOptions, plugins) {
+		const idx = this.childrenCounters[name] || 0;
+		this.childrenCounters[name] = idx + 1;
+		return this.compiler.createChildCompiler(
+			this,
+			name,
+			idx,
+			outputOptions,
+			plugins
+		);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {ExecuteModuleOptions} options options
+	 * @param {ExecuteModuleCallback} callback callback
+	 */
+	executeModule(module, options, callback) {
+		// Aggregate all referenced modules and ensure they are ready
+		const modules = new Set([module]);
+		processAsyncTree(
+			modules,
+			10,
+			/**
+			 * @param {Module} module the module
+			 * @param {function(Module): void} push push more jobs
+			 * @param {Callback} callback callback
+			 * @returns {void}
+			 */
+			(module, push, callback) => {
+				this.buildQueue.waitFor(module, err => {
+					if (err) return callback(err);
+					this.processDependenciesQueue.waitFor(module, err => {
+						if (err) return callback(err);
+						for (const { module: m } of this.moduleGraph.getOutgoingConnections(
+							module
+						)) {
+							const size = modules.size;
+							modules.add(m);
+							if (modules.size !== size) push(m);
+						}
+						callback();
+					});
+				});
+			},
+			err => {
+				if (err) return callback(err);
+
+				// Create new chunk graph, chunk and entrypoint for the build time execution
+				const chunkGraph = new ChunkGraph(
+					this.moduleGraph,
+					this.outputOptions.hashFunction
+				);
+				const runtime = "build time";
+				const { hashFunction, hashDigest, hashDigestLength } =
+					this.outputOptions;
+				const runtimeTemplate = this.runtimeTemplate;
+
+				const chunk = new Chunk("build time chunk", this._backCompat);
+				chunk.id = chunk.name;
+				chunk.ids = [chunk.id];
+				chunk.runtime = runtime;
+
+				const entrypoint = new Entrypoint({
+					runtime,
+					chunkLoading: false,
+					...options.entryOptions
+				});
+				chunkGraph.connectChunkAndEntryModule(chunk, module, entrypoint);
+				connectChunkGroupAndChunk(entrypoint, chunk);
+				entrypoint.setRuntimeChunk(chunk);
+				entrypoint.setEntrypointChunk(chunk);
+
+				const chunks = new Set([chunk]);
+
+				// Assign ids to modules and modules to the chunk
+				for (const module of modules) {
+					const id = module.identifier();
+					chunkGraph.setModuleId(module, id);
+					chunkGraph.connectChunkAndModule(chunk, module);
+				}
+
+				/** @type {WebpackError[]} */
+				const errors = [];
+
+				// Hash modules
+				for (const module of modules) {
+					this._createModuleHash(
+						module,
+						chunkGraph,
+						runtime,
+						hashFunction,
+						runtimeTemplate,
+						hashDigest,
+						hashDigestLength,
+						errors
+					);
+				}
+
+				const codeGenerationResults = new CodeGenerationResults(
+					this.outputOptions.hashFunction
+				);
+				/**
+				 * @param {Module} module the module
+				 * @param {Callback} callback callback
+				 * @returns {void}
+				 */
+				const codeGen = (module, callback) => {
+					this._codeGenerationModule(
+						module,
+						runtime,
+						[runtime],
+						chunkGraph.getModuleHash(module, runtime),
+						this.dependencyTemplates,
+						chunkGraph,
+						this.moduleGraph,
+						runtimeTemplate,
+						errors,
+						codeGenerationResults,
+						(err, codeGenerated) => {
+							callback(err);
+						}
+					);
+				};
+
+				const reportErrors = () => {
+					if (errors.length > 0) {
+						errors.sort(
+							compareSelect(err => err.module, compareModulesByIdentifier)
+						);
+						for (const error of errors) {
+							this.errors.push(error);
+						}
+						errors.length = 0;
+					}
+				};
+
+				// Generate code for all aggregated modules
+				asyncLib.eachLimit(modules, 10, codeGen, err => {
+					if (err) return callback(err);
+					reportErrors();
+
+					// for backward-compat temporary set the chunk graph
+					// TODO webpack 6
+					const old = this.chunkGraph;
+					this.chunkGraph = chunkGraph;
+					this.processRuntimeRequirements({
+						chunkGraph,
+						modules,
+						chunks,
+						codeGenerationResults,
+						chunkGraphEntries: chunks
+					});
+					this.chunkGraph = old;
+
+					const runtimeModules =
+						chunkGraph.getChunkRuntimeModulesIterable(chunk);
+
+					// Hash runtime modules
+					for (const module of runtimeModules) {
+						modules.add(module);
+						this._createModuleHash(
+							module,
+							chunkGraph,
+							runtime,
+							hashFunction,
+							runtimeTemplate,
+							hashDigest,
+							hashDigestLength
+						);
+					}
+
+					// Generate code for all runtime modules
+					asyncLib.eachLimit(runtimeModules, 10, codeGen, err => {
+						if (err) return callback(err);
+						reportErrors();
+
+						/** @type {Map<Module, ExecuteModuleArgument>} */
+						const moduleArgumentsMap = new Map();
+						/** @type {Map<string, ExecuteModuleArgument>} */
+						const moduleArgumentsById = new Map();
+
+						/** @type {ExecuteModuleResult["fileDependencies"]} */
+						const fileDependencies = new LazySet();
+						/** @type {ExecuteModuleResult["contextDependencies"]} */
+						const contextDependencies = new LazySet();
+						/** @type {ExecuteModuleResult["missingDependencies"]} */
+						const missingDependencies = new LazySet();
+						/** @type {ExecuteModuleResult["buildDependencies"]} */
+						const buildDependencies = new LazySet();
+
+						/** @type {ExecuteModuleResult["assets"]} */
+						const assets = new Map();
+
+						let cacheable = true;
+
+						/** @type {ExecuteModuleContext} */
+						const context = {
+							assets,
+							__webpack_require__: undefined,
+							chunk,
+							chunkGraph
+						};
+
+						// Prepare execution
+						asyncLib.eachLimit(
+							modules,
+							10,
+							(module, callback) => {
+								const codeGenerationResult = codeGenerationResults.get(
+									module,
+									runtime
+								);
+								/** @type {ExecuteModuleArgument} */
+								const moduleArgument = {
+									module,
+									codeGenerationResult,
+									preparedInfo: undefined,
+									moduleObject: undefined
+								};
+								moduleArgumentsMap.set(module, moduleArgument);
+								moduleArgumentsById.set(module.identifier(), moduleArgument);
+								module.addCacheDependencies(
+									fileDependencies,
+									contextDependencies,
+									missingDependencies,
+									buildDependencies
+								);
+								if (module.buildInfo.cacheable === false) {
+									cacheable = false;
+								}
+								if (module.buildInfo && module.buildInfo.assets) {
+									const { assets: moduleAssets, assetsInfo } = module.buildInfo;
+									for (const assetName of Object.keys(moduleAssets)) {
+										assets.set(assetName, {
+											source: moduleAssets[assetName],
+											info: assetsInfo ? assetsInfo.get(assetName) : undefined
+										});
+									}
+								}
+								this.hooks.prepareModuleExecution.callAsync(
+									moduleArgument,
+									context,
+									callback
+								);
+							},
+							err => {
+								if (err) return callback(err);
+
+								let exports;
+								try {
+									const {
+										strictModuleErrorHandling,
+										strictModuleExceptionHandling
+									} = this.outputOptions;
+									const __webpack_require__ = id => {
+										const cached = moduleCache[id];
+										if (cached !== undefined) {
+											if (cached.error) throw cached.error;
+											return cached.exports;
+										}
+										const moduleArgument = moduleArgumentsById.get(id);
+										return __webpack_require_module__(moduleArgument, id);
+									};
+									const interceptModuleExecution = (__webpack_require__[
+										RuntimeGlobals.interceptModuleExecution.replace(
+											"__webpack_require__.",
+											""
+										)
+									] = []);
+									const moduleCache = (__webpack_require__[
+										RuntimeGlobals.moduleCache.replace(
+											"__webpack_require__.",
+											""
+										)
+									] = {});
+
+									context.__webpack_require__ = __webpack_require__;
+
+									/**
+									 * @param {ExecuteModuleArgument} moduleArgument the module argument
+									 * @param {string=} id id
+									 * @returns {any} exports
+									 */
+									const __webpack_require_module__ = (moduleArgument, id) => {
+										var execOptions = {
+											id,
+											module: {
+												id,
+												exports: {},
+												loaded: false,
+												error: undefined
+											},
+											require: __webpack_require__
+										};
+										interceptModuleExecution.forEach(handler =>
+											handler(execOptions)
+										);
+										const module = moduleArgument.module;
+										this.buildTimeExecutedModules.add(module);
+										const moduleObject = execOptions.module;
+										moduleArgument.moduleObject = moduleObject;
+										try {
+											if (id) moduleCache[id] = moduleObject;
+
+											tryRunOrWebpackError(
+												() =>
+													this.hooks.executeModule.call(
+														moduleArgument,
+														context
+													),
+												"Compilation.hooks.executeModule"
+											);
+											moduleObject.loaded = true;
+											return moduleObject.exports;
+										} catch (e) {
+											if (strictModuleExceptionHandling) {
+												if (id) delete moduleCache[id];
+											} else if (strictModuleErrorHandling) {
+												moduleObject.error = e;
+											}
+											if (!e.module) e.module = module;
+											throw e;
+										}
+									};
+
+									for (const runtimeModule of chunkGraph.getChunkRuntimeModulesInOrder(
+										chunk
+									)) {
+										__webpack_require_module__(
+											moduleArgumentsMap.get(runtimeModule)
+										);
+									}
+									exports = __webpack_require__(module.identifier());
+								} catch (e) {
+									const err = new WebpackError(
+										`Execution of module code from module graph (${module.readableIdentifier(
+											this.requestShortener
+										)}) failed: ${e.message}`
+									);
+									err.stack = e.stack;
+									err.module = e.module;
+									return callback(err);
+								}
+
+								callback(null, {
+									exports,
+									assets,
+									cacheable,
+									fileDependencies,
+									contextDependencies,
+									missingDependencies,
+									buildDependencies
+								});
+							}
+						);
+					});
+				});
+			}
+		);
+	}
+
+	checkConstraints() {
+		const chunkGraph = this.chunkGraph;
+
+		/** @type {Set<number|string>} */
+		const usedIds = new Set();
+
+		for (const module of this.modules) {
+			if (module.type === "runtime") continue;
+			const moduleId = chunkGraph.getModuleId(module);
+			if (moduleId === null) continue;
+			if (usedIds.has(moduleId)) {
+				throw new Error(`checkConstraints: duplicate module id ${moduleId}`);
+			}
+			usedIds.add(moduleId);
+		}
+
+		for (const chunk of this.chunks) {
+			for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+				if (!this.modules.has(module)) {
+					throw new Error(
+						"checkConstraints: module in chunk but not in compilation " +
+							` ${chunk.debugId} ${module.debugId}`
+					);
+				}
+			}
+			for (const module of chunkGraph.getChunkEntryModulesIterable(chunk)) {
+				if (!this.modules.has(module)) {
+					throw new Error(
+						"checkConstraints: entry module in chunk but not in compilation " +
+							` ${chunk.debugId} ${module.debugId}`
+					);
+				}
+			}
+		}
+
+		for (const chunkGroup of this.chunkGroups) {
+			chunkGroup.checkConstraints();
+		}
+	}
+}
+
+/**
+ * @typedef {Object} FactorizeModuleOptions
+ * @property {ModuleProfile} currentProfile
+ * @property {ModuleFactory} factory
+ * @property {Dependency[]} dependencies
+ * @property {boolean=} factoryResult return full ModuleFactoryResult instead of only module
+ * @property {Module | null} originModule
+ * @property {Partial<ModuleFactoryCreateDataContextInfo>=} contextInfo
+ * @property {string=} context
+ */
+
+/**
+ * @param {FactorizeModuleOptions} options options object
+ * @param {ModuleCallback | ModuleFactoryResultCallback} callback callback
+ * @returns {void}
+ */
+
+// Workaround for typescript as it doesn't support function overloading in jsdoc within a class
+Compilation.prototype.factorizeModule = /** @type {{
+	(options: FactorizeModuleOptions & { factoryResult?: false }, callback: ModuleCallback): void;
+	(options: FactorizeModuleOptions & { factoryResult: true }, callback: ModuleFactoryResultCallback): void;
+}} */ (
+	function (options, callback) {
+		this.factorizeQueue.add(options, callback);
+	}
+);
+
+// Hide from typescript
+const compilationPrototype = Compilation.prototype;
+
+// TODO webpack 6 remove
+Object.defineProperty(compilationPrototype, "modifyHash", {
+	writable: false,
+	enumerable: false,
+	configurable: false,
+	value: () => {
+		throw new Error(
+			"Compilation.modifyHash was removed in favor of Compilation.hooks.fullHash"
+		);
+	}
+});
+
+// TODO webpack 6 remove
+Object.defineProperty(compilationPrototype, "cache", {
+	enumerable: false,
+	configurable: false,
+	get: util.deprecate(
+		/**
+		 * @this {Compilation} the compilation
+		 * @returns {Cache} the cache
+		 */
+		function () {
+			return this.compiler.cache;
+		},
+		"Compilation.cache was removed in favor of Compilation.getCache()",
+		"DEP_WEBPACK_COMPILATION_CACHE"
+	),
+	set: util.deprecate(
+		v => {},
+		"Compilation.cache was removed in favor of Compilation.getCache()",
+		"DEP_WEBPACK_COMPILATION_CACHE"
+	)
+});
+
+/**
+ * Add additional assets to the compilation.
+ */
+Compilation.PROCESS_ASSETS_STAGE_ADDITIONAL = -2000;
+
+/**
+ * Basic preprocessing of assets.
+ */
+Compilation.PROCESS_ASSETS_STAGE_PRE_PROCESS = -1000;
+
+/**
+ * Derive new assets from existing assets.
+ * Existing assets should not be treated as complete.
+ */
+Compilation.PROCESS_ASSETS_STAGE_DERIVED = -200;
+
+/**
+ * Add additional sections to existing assets, like a banner or initialization code.
+ */
+Compilation.PROCESS_ASSETS_STAGE_ADDITIONS = -100;
+
+/**
+ * Optimize existing assets in a general way.
+ */
+Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE = 100;
+
+/**
+ * Optimize the count of existing assets, e. g. by merging them.
+ * Only assets of the same type should be merged.
+ * For assets of different types see PROCESS_ASSETS_STAGE_OPTIMIZE_INLINE.
+ */
+Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_COUNT = 200;
+
+/**
+ * Optimize the compatibility of existing assets, e. g. add polyfills or vendor-prefixes.
+ */
+Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_COMPATIBILITY = 300;
+
+/**
+ * Optimize the size of existing assets, e. g. by minimizing or omitting whitespace.
+ */
+Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_SIZE = 400;
+
+/**
+ * Add development tooling to assets, e. g. by extracting a SourceMap.
+ */
+Compilation.PROCESS_ASSETS_STAGE_DEV_TOOLING = 500;
+
+/**
+ * Optimize the count of existing assets, e. g. by inlining assets of into other assets.
+ * Only assets of different types should be inlined.
+ * For assets of the same type see PROCESS_ASSETS_STAGE_OPTIMIZE_COUNT.
+ */
+Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_INLINE = 700;
+
+/**
+ * Summarize the list of existing assets
+ * e. g. creating an assets manifest of Service Workers.
+ */
+Compilation.PROCESS_ASSETS_STAGE_SUMMARIZE = 1000;
+
+/**
+ * Optimize the hashes of the assets, e. g. by generating real hashes of the asset content.
+ */
+Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_HASH = 2500;
+
+/**
+ * Optimize the transfer of existing assets, e. g. by preparing a compressed (gzip) file as separate asset.
+ */
+Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_TRANSFER = 3000;
+
+/**
+ * Analyse existing assets.
+ */
+Compilation.PROCESS_ASSETS_STAGE_ANALYSE = 4000;
+
+/**
+ * Creating assets for reporting purposes.
+ */
+Compilation.PROCESS_ASSETS_STAGE_REPORT = 5000;
+
+module.exports = Compilation;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Compiler.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Compiler.js
new file mode 100644
index 0000000..9bf57f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Compiler.js
@@ -0,0 +1,1217 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const parseJson = require("json-parse-better-errors");
+const asyncLib = require("neo-async");
+const {
+	SyncHook,
+	SyncBailHook,
+	AsyncParallelHook,
+	AsyncSeriesHook
+} = require("tapable");
+const { SizeOnlySource } = require("webpack-sources");
+const webpack = require("./");
+const Cache = require("./Cache");
+const CacheFacade = require("./CacheFacade");
+const ChunkGraph = require("./ChunkGraph");
+const Compilation = require("./Compilation");
+const ConcurrentCompilationError = require("./ConcurrentCompilationError");
+const ContextModuleFactory = require("./ContextModuleFactory");
+const ModuleGraph = require("./ModuleGraph");
+const NormalModuleFactory = require("./NormalModuleFactory");
+const RequestShortener = require("./RequestShortener");
+const ResolverFactory = require("./ResolverFactory");
+const Stats = require("./Stats");
+const Watching = require("./Watching");
+const WebpackError = require("./WebpackError");
+const { Logger } = require("./logging/Logger");
+const { join, dirname, mkdirp } = require("./util/fs");
+const { makePathsRelative } = require("./util/identifier");
+const { isSourceEqual } = require("./util/source");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").EntryNormalized} Entry */
+/** @typedef {import("../declarations/WebpackOptions").OutputNormalized} OutputOptions */
+/** @typedef {import("../declarations/WebpackOptions").WatchOptions} WatchOptions */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../declarations/WebpackOptions").WebpackPluginInstance} WebpackPluginInstance */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./FileSystemInfo").FileSystemInfoEntry} FileSystemInfoEntry */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./util/WeakTupleMap")} WeakTupleMap */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("./util/fs").IntermediateFileSystem} IntermediateFileSystem */
+/** @typedef {import("./util/fs").OutputFileSystem} OutputFileSystem */
+/** @typedef {import("./util/fs").WatchFileSystem} WatchFileSystem */
+
+/**
+ * @typedef {Object} CompilationParams
+ * @property {NormalModuleFactory} normalModuleFactory
+ * @property {ContextModuleFactory} contextModuleFactory
+ */
+
+/**
+ * @template T
+ * @callback Callback
+ * @param {(Error | null)=} err
+ * @param {T=} result
+ */
+
+/**
+ * @callback RunAsChildCallback
+ * @param {(Error | null)=} err
+ * @param {Chunk[]=} entries
+ * @param {Compilation=} compilation
+ */
+
+/**
+ * @typedef {Object} AssetEmittedInfo
+ * @property {Buffer} content
+ * @property {Source} source
+ * @property {Compilation} compilation
+ * @property {string} outputPath
+ * @property {string} targetPath
+ */
+
+/**
+ * @param {string[]} array an array
+ * @returns {boolean} true, if the array is sorted
+ */
+const isSorted = array => {
+	for (let i = 1; i < array.length; i++) {
+		if (array[i - 1] > array[i]) return false;
+	}
+	return true;
+};
+
+/**
+ * @param {Object} obj an object
+ * @param {string[]} keys the keys of the object
+ * @returns {Object} the object with properties sorted by property name
+ */
+const sortObject = (obj, keys) => {
+	const o = {};
+	for (const k of keys.sort()) {
+		o[k] = obj[k];
+	}
+	return o;
+};
+
+/**
+ * @param {string} filename filename
+ * @param {string | string[] | undefined} hashes list of hashes
+ * @returns {boolean} true, if the filename contains any hash
+ */
+const includesHash = (filename, hashes) => {
+	if (!hashes) return false;
+	if (Array.isArray(hashes)) {
+		return hashes.some(hash => filename.includes(hash));
+	} else {
+		return filename.includes(hashes);
+	}
+};
+
+class Compiler {
+	/**
+	 * @param {string} context the compilation path
+	 * @param {WebpackOptions} options options
+	 */
+	constructor(context, options = /** @type {WebpackOptions} */ ({})) {
+		this.hooks = Object.freeze({
+			/** @type {SyncHook<[]>} */
+			initialize: new SyncHook([]),
+
+			/** @type {SyncBailHook<[Compilation], boolean>} */
+			shouldEmit: new SyncBailHook(["compilation"]),
+			/** @type {AsyncSeriesHook<[Stats]>} */
+			done: new AsyncSeriesHook(["stats"]),
+			/** @type {SyncHook<[Stats]>} */
+			afterDone: new SyncHook(["stats"]),
+			/** @type {AsyncSeriesHook<[]>} */
+			additionalPass: new AsyncSeriesHook([]),
+			/** @type {AsyncSeriesHook<[Compiler]>} */
+			beforeRun: new AsyncSeriesHook(["compiler"]),
+			/** @type {AsyncSeriesHook<[Compiler]>} */
+			run: new AsyncSeriesHook(["compiler"]),
+			/** @type {AsyncSeriesHook<[Compilation]>} */
+			emit: new AsyncSeriesHook(["compilation"]),
+			/** @type {AsyncSeriesHook<[string, AssetEmittedInfo]>} */
+			assetEmitted: new AsyncSeriesHook(["file", "info"]),
+			/** @type {AsyncSeriesHook<[Compilation]>} */
+			afterEmit: new AsyncSeriesHook(["compilation"]),
+
+			/** @type {SyncHook<[Compilation, CompilationParams]>} */
+			thisCompilation: new SyncHook(["compilation", "params"]),
+			/** @type {SyncHook<[Compilation, CompilationParams]>} */
+			compilation: new SyncHook(["compilation", "params"]),
+			/** @type {SyncHook<[NormalModuleFactory]>} */
+			normalModuleFactory: new SyncHook(["normalModuleFactory"]),
+			/** @type {SyncHook<[ContextModuleFactory]>}  */
+			contextModuleFactory: new SyncHook(["contextModuleFactory"]),
+
+			/** @type {AsyncSeriesHook<[CompilationParams]>} */
+			beforeCompile: new AsyncSeriesHook(["params"]),
+			/** @type {SyncHook<[CompilationParams]>} */
+			compile: new SyncHook(["params"]),
+			/** @type {AsyncParallelHook<[Compilation]>} */
+			make: new AsyncParallelHook(["compilation"]),
+			/** @type {AsyncParallelHook<[Compilation]>} */
+			finishMake: new AsyncSeriesHook(["compilation"]),
+			/** @type {AsyncSeriesHook<[Compilation]>} */
+			afterCompile: new AsyncSeriesHook(["compilation"]),
+
+			/** @type {AsyncSeriesHook<[]>} */
+			readRecords: new AsyncSeriesHook([]),
+			/** @type {AsyncSeriesHook<[]>} */
+			emitRecords: new AsyncSeriesHook([]),
+
+			/** @type {AsyncSeriesHook<[Compiler]>} */
+			watchRun: new AsyncSeriesHook(["compiler"]),
+			/** @type {SyncHook<[Error]>} */
+			failed: new SyncHook(["error"]),
+			/** @type {SyncHook<[string | null, number]>} */
+			invalid: new SyncHook(["filename", "changeTime"]),
+			/** @type {SyncHook<[]>} */
+			watchClose: new SyncHook([]),
+			/** @type {AsyncSeriesHook<[]>} */
+			shutdown: new AsyncSeriesHook([]),
+
+			/** @type {SyncBailHook<[string, string, any[]], true>} */
+			infrastructureLog: new SyncBailHook(["origin", "type", "args"]),
+
+			// TODO the following hooks are weirdly located here
+			// TODO move them for webpack 5
+			/** @type {SyncHook<[]>} */
+			environment: new SyncHook([]),
+			/** @type {SyncHook<[]>} */
+			afterEnvironment: new SyncHook([]),
+			/** @type {SyncHook<[Compiler]>} */
+			afterPlugins: new SyncHook(["compiler"]),
+			/** @type {SyncHook<[Compiler]>} */
+			afterResolvers: new SyncHook(["compiler"]),
+			/** @type {SyncBailHook<[string, Entry], boolean>} */
+			entryOption: new SyncBailHook(["context", "entry"])
+		});
+
+		this.webpack = webpack;
+
+		/** @type {string=} */
+		this.name = undefined;
+		/** @type {Compilation=} */
+		this.parentCompilation = undefined;
+		/** @type {Compiler} */
+		this.root = this;
+		/** @type {string} */
+		this.outputPath = "";
+		/** @type {Watching} */
+		this.watching = undefined;
+
+		/** @type {OutputFileSystem} */
+		this.outputFileSystem = null;
+		/** @type {IntermediateFileSystem} */
+		this.intermediateFileSystem = null;
+		/** @type {InputFileSystem} */
+		this.inputFileSystem = null;
+		/** @type {WatchFileSystem} */
+		this.watchFileSystem = null;
+
+		/** @type {string|null} */
+		this.recordsInputPath = null;
+		/** @type {string|null} */
+		this.recordsOutputPath = null;
+		this.records = {};
+		/** @type {Set<string | RegExp>} */
+		this.managedPaths = new Set();
+		/** @type {Set<string | RegExp>} */
+		this.immutablePaths = new Set();
+
+		/** @type {ReadonlySet<string>} */
+		this.modifiedFiles = undefined;
+		/** @type {ReadonlySet<string>} */
+		this.removedFiles = undefined;
+		/** @type {ReadonlyMap<string, FileSystemInfoEntry | "ignore" | null>} */
+		this.fileTimestamps = undefined;
+		/** @type {ReadonlyMap<string, FileSystemInfoEntry | "ignore" | null>} */
+		this.contextTimestamps = undefined;
+		/** @type {number} */
+		this.fsStartTime = undefined;
+
+		/** @type {ResolverFactory} */
+		this.resolverFactory = new ResolverFactory();
+
+		this.infrastructureLogger = undefined;
+
+		this.options = options;
+
+		this.context = context;
+
+		this.requestShortener = new RequestShortener(context, this.root);
+
+		this.cache = new Cache();
+
+		/** @type {Map<Module, { buildInfo: object, references: WeakMap<Dependency, Module>, memCache: WeakTupleMap }> | undefined} */
+		this.moduleMemCaches = undefined;
+
+		this.compilerPath = "";
+
+		/** @type {boolean} */
+		this.running = false;
+
+		/** @type {boolean} */
+		this.idle = false;
+
+		/** @type {boolean} */
+		this.watchMode = false;
+
+		this._backCompat = this.options.experiments.backCompat !== false;
+
+		/** @type {Compilation} */
+		this._lastCompilation = undefined;
+		/** @type {NormalModuleFactory} */
+		this._lastNormalModuleFactory = undefined;
+
+		/** @private @type {WeakMap<Source, { sizeOnlySource: SizeOnlySource, writtenTo: Map<string, number> }>} */
+		this._assetEmittingSourceCache = new WeakMap();
+		/** @private @type {Map<string, number>} */
+		this._assetEmittingWrittenFiles = new Map();
+		/** @private @type {Set<string>} */
+		this._assetEmittingPreviousFiles = new Set();
+	}
+
+	/**
+	 * @param {string} name cache name
+	 * @returns {CacheFacade} the cache facade instance
+	 */
+	getCache(name) {
+		return new CacheFacade(
+			this.cache,
+			`${this.compilerPath}${name}`,
+			this.options.output.hashFunction
+		);
+	}
+
+	/**
+	 * @param {string | (function(): string)} name name of the logger, or function called once to get the logger name
+	 * @returns {Logger} a logger with that name
+	 */
+	getInfrastructureLogger(name) {
+		if (!name) {
+			throw new TypeError(
+				"Compiler.getInfrastructureLogger(name) called without a name"
+			);
+		}
+		return new Logger(
+			(type, args) => {
+				if (typeof name === "function") {
+					name = name();
+					if (!name) {
+						throw new TypeError(
+							"Compiler.getInfrastructureLogger(name) called with a function not returning a name"
+						);
+					}
+				}
+				if (this.hooks.infrastructureLog.call(name, type, args) === undefined) {
+					if (this.infrastructureLogger !== undefined) {
+						this.infrastructureLogger(name, type, args);
+					}
+				}
+			},
+			childName => {
+				if (typeof name === "function") {
+					if (typeof childName === "function") {
+						return this.getInfrastructureLogger(() => {
+							if (typeof name === "function") {
+								name = name();
+								if (!name) {
+									throw new TypeError(
+										"Compiler.getInfrastructureLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							if (typeof childName === "function") {
+								childName = childName();
+								if (!childName) {
+									throw new TypeError(
+										"Logger.getChildLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							return `${name}/${childName}`;
+						});
+					} else {
+						return this.getInfrastructureLogger(() => {
+							if (typeof name === "function") {
+								name = name();
+								if (!name) {
+									throw new TypeError(
+										"Compiler.getInfrastructureLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							return `${name}/${childName}`;
+						});
+					}
+				} else {
+					if (typeof childName === "function") {
+						return this.getInfrastructureLogger(() => {
+							if (typeof childName === "function") {
+								childName = childName();
+								if (!childName) {
+									throw new TypeError(
+										"Logger.getChildLogger(name) called with a function not returning a name"
+									);
+								}
+							}
+							return `${name}/${childName}`;
+						});
+					} else {
+						return this.getInfrastructureLogger(`${name}/${childName}`);
+					}
+				}
+			}
+		);
+	}
+
+	// TODO webpack 6: solve this in a better way
+	// e.g. move compilation specific info from Modules into ModuleGraph
+	_cleanupLastCompilation() {
+		if (this._lastCompilation !== undefined) {
+			for (const module of this._lastCompilation.modules) {
+				ChunkGraph.clearChunkGraphForModule(module);
+				ModuleGraph.clearModuleGraphForModule(module);
+				module.cleanupForCache();
+			}
+			for (const chunk of this._lastCompilation.chunks) {
+				ChunkGraph.clearChunkGraphForChunk(chunk);
+			}
+			this._lastCompilation = undefined;
+		}
+	}
+
+	// TODO webpack 6: solve this in a better way
+	_cleanupLastNormalModuleFactory() {
+		if (this._lastNormalModuleFactory !== undefined) {
+			this._lastNormalModuleFactory.cleanupForCache();
+			this._lastNormalModuleFactory = undefined;
+		}
+	}
+
+	/**
+	 * @param {WatchOptions} watchOptions the watcher's options
+	 * @param {Callback<Stats>} handler signals when the call finishes
+	 * @returns {Watching} a compiler watcher
+	 */
+	watch(watchOptions, handler) {
+		if (this.running) {
+			return handler(new ConcurrentCompilationError());
+		}
+
+		this.running = true;
+		this.watchMode = true;
+		this.watching = new Watching(this, watchOptions, handler);
+		return this.watching;
+	}
+
+	/**
+	 * @param {Callback<Stats>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	run(callback) {
+		if (this.running) {
+			return callback(new ConcurrentCompilationError());
+		}
+
+		let logger;
+
+		const finalCallback = (err, stats) => {
+			if (logger) logger.time("beginIdle");
+			this.idle = true;
+			this.cache.beginIdle();
+			this.idle = true;
+			if (logger) logger.timeEnd("beginIdle");
+			this.running = false;
+			if (err) {
+				this.hooks.failed.call(err);
+			}
+			if (callback !== undefined) callback(err, stats);
+			this.hooks.afterDone.call(stats);
+		};
+
+		const startTime = Date.now();
+
+		this.running = true;
+
+		const onCompiled = (err, compilation) => {
+			if (err) return finalCallback(err);
+
+			if (this.hooks.shouldEmit.call(compilation) === false) {
+				compilation.startTime = startTime;
+				compilation.endTime = Date.now();
+				const stats = new Stats(compilation);
+				this.hooks.done.callAsync(stats, err => {
+					if (err) return finalCallback(err);
+					return finalCallback(null, stats);
+				});
+				return;
+			}
+
+			process.nextTick(() => {
+				logger = compilation.getLogger("webpack.Compiler");
+				logger.time("emitAssets");
+				this.emitAssets(compilation, err => {
+					logger.timeEnd("emitAssets");
+					if (err) return finalCallback(err);
+
+					if (compilation.hooks.needAdditionalPass.call()) {
+						compilation.needAdditionalPass = true;
+
+						compilation.startTime = startTime;
+						compilation.endTime = Date.now();
+						logger.time("done hook");
+						const stats = new Stats(compilation);
+						this.hooks.done.callAsync(stats, err => {
+							logger.timeEnd("done hook");
+							if (err) return finalCallback(err);
+
+							this.hooks.additionalPass.callAsync(err => {
+								if (err) return finalCallback(err);
+								this.compile(onCompiled);
+							});
+						});
+						return;
+					}
+
+					logger.time("emitRecords");
+					this.emitRecords(err => {
+						logger.timeEnd("emitRecords");
+						if (err) return finalCallback(err);
+
+						compilation.startTime = startTime;
+						compilation.endTime = Date.now();
+						logger.time("done hook");
+						const stats = new Stats(compilation);
+						this.hooks.done.callAsync(stats, err => {
+							logger.timeEnd("done hook");
+							if (err) return finalCallback(err);
+							this.cache.storeBuildDependencies(
+								compilation.buildDependencies,
+								err => {
+									if (err) return finalCallback(err);
+									return finalCallback(null, stats);
+								}
+							);
+						});
+					});
+				});
+			});
+		};
+
+		const run = () => {
+			this.hooks.beforeRun.callAsync(this, err => {
+				if (err) return finalCallback(err);
+
+				this.hooks.run.callAsync(this, err => {
+					if (err) return finalCallback(err);
+
+					this.readRecords(err => {
+						if (err) return finalCallback(err);
+
+						this.compile(onCompiled);
+					});
+				});
+			});
+		};
+
+		if (this.idle) {
+			this.cache.endIdle(err => {
+				if (err) return finalCallback(err);
+
+				this.idle = false;
+				run();
+			});
+		} else {
+			run();
+		}
+	}
+
+	/**
+	 * @param {RunAsChildCallback} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	runAsChild(callback) {
+		const startTime = Date.now();
+		this.compile((err, compilation) => {
+			if (err) return callback(err);
+
+			this.parentCompilation.children.push(compilation);
+			for (const { name, source, info } of compilation.getAssets()) {
+				this.parentCompilation.emitAsset(name, source, info);
+			}
+
+			const entries = [];
+			for (const ep of compilation.entrypoints.values()) {
+				entries.push(...ep.chunks);
+			}
+
+			compilation.startTime = startTime;
+			compilation.endTime = Date.now();
+
+			return callback(null, entries, compilation);
+		});
+	}
+
+	purgeInputFileSystem() {
+		if (this.inputFileSystem && this.inputFileSystem.purge) {
+			this.inputFileSystem.purge();
+		}
+	}
+
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @param {Callback<void>} callback signals when the assets are emitted
+	 * @returns {void}
+	 */
+	emitAssets(compilation, callback) {
+		let outputPath;
+
+		const emitFiles = err => {
+			if (err) return callback(err);
+
+			const assets = compilation.getAssets();
+			compilation.assets = { ...compilation.assets };
+			/** @type {Map<string, { path: string, source: Source, size: number, waiting: { cacheEntry: any, file: string }[] }>} */
+			const caseInsensitiveMap = new Map();
+			/** @type {Set<string>} */
+			const allTargetPaths = new Set();
+			asyncLib.forEachLimit(
+				assets,
+				15,
+				({ name: file, source, info }, callback) => {
+					let targetFile = file;
+					let immutable = info.immutable;
+					const queryStringIdx = targetFile.indexOf("?");
+					if (queryStringIdx >= 0) {
+						targetFile = targetFile.substr(0, queryStringIdx);
+						// We may remove the hash, which is in the query string
+						// So we recheck if the file is immutable
+						// This doesn't cover all cases, but immutable is only a performance optimization anyway
+						immutable =
+							immutable &&
+							(includesHash(targetFile, info.contenthash) ||
+								includesHash(targetFile, info.chunkhash) ||
+								includesHash(targetFile, info.modulehash) ||
+								includesHash(targetFile, info.fullhash));
+					}
+
+					const writeOut = err => {
+						if (err) return callback(err);
+						const targetPath = join(
+							this.outputFileSystem,
+							outputPath,
+							targetFile
+						);
+						allTargetPaths.add(targetPath);
+
+						// check if the target file has already been written by this Compiler
+						const targetFileGeneration =
+							this._assetEmittingWrittenFiles.get(targetPath);
+
+						// create an cache entry for this Source if not already existing
+						let cacheEntry = this._assetEmittingSourceCache.get(source);
+						if (cacheEntry === undefined) {
+							cacheEntry = {
+								sizeOnlySource: undefined,
+								writtenTo: new Map()
+							};
+							this._assetEmittingSourceCache.set(source, cacheEntry);
+						}
+
+						let similarEntry;
+
+						const checkSimilarFile = () => {
+							const caseInsensitiveTargetPath = targetPath.toLowerCase();
+							similarEntry = caseInsensitiveMap.get(caseInsensitiveTargetPath);
+							if (similarEntry !== undefined) {
+								const { path: other, source: otherSource } = similarEntry;
+								if (isSourceEqual(otherSource, source)) {
+									// Size may or may not be available at this point.
+									// If it's not available add to "waiting" list and it will be updated once available
+									if (similarEntry.size !== undefined) {
+										updateWithReplacementSource(similarEntry.size);
+									} else {
+										if (!similarEntry.waiting) similarEntry.waiting = [];
+										similarEntry.waiting.push({ file, cacheEntry });
+									}
+									alreadyWritten();
+								} else {
+									const err =
+										new WebpackError(`Prevent writing to file that only differs in casing or query string from already written file.
+This will lead to a race-condition and corrupted files on case-insensitive file systems.
+${targetPath}
+${other}`);
+									err.file = file;
+									callback(err);
+								}
+								return true;
+							} else {
+								caseInsensitiveMap.set(
+									caseInsensitiveTargetPath,
+									(similarEntry = {
+										path: targetPath,
+										source,
+										size: undefined,
+										waiting: undefined
+									})
+								);
+								return false;
+							}
+						};
+
+						/**
+						 * get the binary (Buffer) content from the Source
+						 * @returns {Buffer} content for the source
+						 */
+						const getContent = () => {
+							if (typeof source.buffer === "function") {
+								return source.buffer();
+							} else {
+								const bufferOrString = source.source();
+								if (Buffer.isBuffer(bufferOrString)) {
+									return bufferOrString;
+								} else {
+									return Buffer.from(bufferOrString, "utf8");
+								}
+							}
+						};
+
+						const alreadyWritten = () => {
+							// cache the information that the Source has been already been written to that location
+							if (targetFileGeneration === undefined) {
+								const newGeneration = 1;
+								this._assetEmittingWrittenFiles.set(targetPath, newGeneration);
+								cacheEntry.writtenTo.set(targetPath, newGeneration);
+							} else {
+								cacheEntry.writtenTo.set(targetPath, targetFileGeneration);
+							}
+							callback();
+						};
+
+						/**
+						 * Write the file to output file system
+						 * @param {Buffer} content content to be written
+						 * @returns {void}
+						 */
+						const doWrite = content => {
+							this.outputFileSystem.writeFile(targetPath, content, err => {
+								if (err) return callback(err);
+
+								// information marker that the asset has been emitted
+								compilation.emittedAssets.add(file);
+
+								// cache the information that the Source has been written to that location
+								const newGeneration =
+									targetFileGeneration === undefined
+										? 1
+										: targetFileGeneration + 1;
+								cacheEntry.writtenTo.set(targetPath, newGeneration);
+								this._assetEmittingWrittenFiles.set(targetPath, newGeneration);
+								this.hooks.assetEmitted.callAsync(
+									file,
+									{
+										content,
+										source,
+										outputPath,
+										compilation,
+										targetPath
+									},
+									callback
+								);
+							});
+						};
+
+						const updateWithReplacementSource = size => {
+							updateFileWithReplacementSource(file, cacheEntry, size);
+							similarEntry.size = size;
+							if (similarEntry.waiting !== undefined) {
+								for (const { file, cacheEntry } of similarEntry.waiting) {
+									updateFileWithReplacementSource(file, cacheEntry, size);
+								}
+							}
+						};
+
+						const updateFileWithReplacementSource = (
+							file,
+							cacheEntry,
+							size
+						) => {
+							// Create a replacement resource which only allows to ask for size
+							// This allows to GC all memory allocated by the Source
+							// (expect when the Source is stored in any other cache)
+							if (!cacheEntry.sizeOnlySource) {
+								cacheEntry.sizeOnlySource = new SizeOnlySource(size);
+							}
+							compilation.updateAsset(file, cacheEntry.sizeOnlySource, {
+								size
+							});
+						};
+
+						const processExistingFile = stats => {
+							// skip emitting if it's already there and an immutable file
+							if (immutable) {
+								updateWithReplacementSource(stats.size);
+								return alreadyWritten();
+							}
+
+							const content = getContent();
+
+							updateWithReplacementSource(content.length);
+
+							// if it exists and content on disk matches content
+							// skip writing the same content again
+							// (to keep mtime and don't trigger watchers)
+							// for a fast negative match file size is compared first
+							if (content.length === stats.size) {
+								compilation.comparedForEmitAssets.add(file);
+								return this.outputFileSystem.readFile(
+									targetPath,
+									(err, existingContent) => {
+										if (
+											err ||
+											!content.equals(/** @type {Buffer} */ (existingContent))
+										) {
+											return doWrite(content);
+										} else {
+											return alreadyWritten();
+										}
+									}
+								);
+							}
+
+							return doWrite(content);
+						};
+
+						const processMissingFile = () => {
+							const content = getContent();
+
+							updateWithReplacementSource(content.length);
+
+							return doWrite(content);
+						};
+
+						// if the target file has already been written
+						if (targetFileGeneration !== undefined) {
+							// check if the Source has been written to this target file
+							const writtenGeneration = cacheEntry.writtenTo.get(targetPath);
+							if (writtenGeneration === targetFileGeneration) {
+								// if yes, we may skip writing the file
+								// if it's already there
+								// (we assume one doesn't modify files while the Compiler is running, other then removing them)
+
+								if (this._assetEmittingPreviousFiles.has(targetPath)) {
+									// We assume that assets from the last compilation say intact on disk (they are not removed)
+									compilation.updateAsset(file, cacheEntry.sizeOnlySource, {
+										size: cacheEntry.sizeOnlySource.size()
+									});
+
+									return callback();
+								} else {
+									// Settings immutable will make it accept file content without comparing when file exist
+									immutable = true;
+								}
+							} else if (!immutable) {
+								if (checkSimilarFile()) return;
+								// We wrote to this file before which has very likely a different content
+								// skip comparing and assume content is different for performance
+								// This case happens often during watch mode.
+								return processMissingFile();
+							}
+						}
+
+						if (checkSimilarFile()) return;
+						if (this.options.output.compareBeforeEmit) {
+							this.outputFileSystem.stat(targetPath, (err, stats) => {
+								const exists = !err && stats.isFile();
+
+								if (exists) {
+									processExistingFile(stats);
+								} else {
+									processMissingFile();
+								}
+							});
+						} else {
+							processMissingFile();
+						}
+					};
+
+					if (targetFile.match(/\/|\\/)) {
+						const fs = this.outputFileSystem;
+						const dir = dirname(fs, join(fs, outputPath, targetFile));
+						mkdirp(fs, dir, writeOut);
+					} else {
+						writeOut();
+					}
+				},
+				err => {
+					// Clear map to free up memory
+					caseInsensitiveMap.clear();
+					if (err) {
+						this._assetEmittingPreviousFiles.clear();
+						return callback(err);
+					}
+
+					this._assetEmittingPreviousFiles = allTargetPaths;
+
+					this.hooks.afterEmit.callAsync(compilation, err => {
+						if (err) return callback(err);
+
+						return callback();
+					});
+				}
+			);
+		};
+
+		this.hooks.emit.callAsync(compilation, err => {
+			if (err) return callback(err);
+			outputPath = compilation.getPath(this.outputPath, {});
+			mkdirp(this.outputFileSystem, outputPath, emitFiles);
+		});
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	emitRecords(callback) {
+		if (this.hooks.emitRecords.isUsed()) {
+			if (this.recordsOutputPath) {
+				asyncLib.parallel(
+					[
+						cb => this.hooks.emitRecords.callAsync(cb),
+						this._emitRecords.bind(this)
+					],
+					err => callback(err)
+				);
+			} else {
+				this.hooks.emitRecords.callAsync(callback);
+			}
+		} else {
+			if (this.recordsOutputPath) {
+				this._emitRecords(callback);
+			} else {
+				callback();
+			}
+		}
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	_emitRecords(callback) {
+		const writeFile = () => {
+			this.outputFileSystem.writeFile(
+				this.recordsOutputPath,
+				JSON.stringify(
+					this.records,
+					(n, value) => {
+						if (
+							typeof value === "object" &&
+							value !== null &&
+							!Array.isArray(value)
+						) {
+							const keys = Object.keys(value);
+							if (!isSorted(keys)) {
+								return sortObject(value, keys);
+							}
+						}
+						return value;
+					},
+					2
+				),
+				callback
+			);
+		};
+
+		const recordsOutputPathDirectory = dirname(
+			this.outputFileSystem,
+			this.recordsOutputPath
+		);
+		if (!recordsOutputPathDirectory) {
+			return writeFile();
+		}
+		mkdirp(this.outputFileSystem, recordsOutputPathDirectory, err => {
+			if (err) return callback(err);
+			writeFile();
+		});
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	readRecords(callback) {
+		if (this.hooks.readRecords.isUsed()) {
+			if (this.recordsInputPath) {
+				asyncLib.parallel([
+					cb => this.hooks.readRecords.callAsync(cb),
+					this._readRecords.bind(this)
+				]);
+			} else {
+				this.records = {};
+				this.hooks.readRecords.callAsync(callback);
+			}
+		} else {
+			if (this.recordsInputPath) {
+				this._readRecords(callback);
+			} else {
+				this.records = {};
+				callback();
+			}
+		}
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	_readRecords(callback) {
+		if (!this.recordsInputPath) {
+			this.records = {};
+			return callback();
+		}
+		this.inputFileSystem.stat(this.recordsInputPath, err => {
+			// It doesn't exist
+			// We can ignore this.
+			if (err) return callback();
+
+			this.inputFileSystem.readFile(this.recordsInputPath, (err, content) => {
+				if (err) return callback(err);
+
+				try {
+					this.records = parseJson(content.toString("utf-8"));
+				} catch (e) {
+					e.message = "Cannot parse records: " + e.message;
+					return callback(e);
+				}
+
+				return callback();
+			});
+		});
+	}
+
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @param {string} compilerName the compiler's name
+	 * @param {number} compilerIndex the compiler's index
+	 * @param {OutputOptions=} outputOptions the output options
+	 * @param {WebpackPluginInstance[]=} plugins the plugins to apply
+	 * @returns {Compiler} a child compiler
+	 */
+	createChildCompiler(
+		compilation,
+		compilerName,
+		compilerIndex,
+		outputOptions,
+		plugins
+	) {
+		const childCompiler = new Compiler(this.context, {
+			...this.options,
+			output: {
+				...this.options.output,
+				...outputOptions
+			}
+		});
+		childCompiler.name = compilerName;
+		childCompiler.outputPath = this.outputPath;
+		childCompiler.inputFileSystem = this.inputFileSystem;
+		childCompiler.outputFileSystem = null;
+		childCompiler.resolverFactory = this.resolverFactory;
+		childCompiler.modifiedFiles = this.modifiedFiles;
+		childCompiler.removedFiles = this.removedFiles;
+		childCompiler.fileTimestamps = this.fileTimestamps;
+		childCompiler.contextTimestamps = this.contextTimestamps;
+		childCompiler.fsStartTime = this.fsStartTime;
+		childCompiler.cache = this.cache;
+		childCompiler.compilerPath = `${this.compilerPath}${compilerName}|${compilerIndex}|`;
+		childCompiler._backCompat = this._backCompat;
+
+		const relativeCompilerName = makePathsRelative(
+			this.context,
+			compilerName,
+			this.root
+		);
+		if (!this.records[relativeCompilerName]) {
+			this.records[relativeCompilerName] = [];
+		}
+		if (this.records[relativeCompilerName][compilerIndex]) {
+			childCompiler.records = this.records[relativeCompilerName][compilerIndex];
+		} else {
+			this.records[relativeCompilerName].push((childCompiler.records = {}));
+		}
+
+		childCompiler.parentCompilation = compilation;
+		childCompiler.root = this.root;
+		if (Array.isArray(plugins)) {
+			for (const plugin of plugins) {
+				plugin.apply(childCompiler);
+			}
+		}
+		for (const name in this.hooks) {
+			if (
+				![
+					"make",
+					"compile",
+					"emit",
+					"afterEmit",
+					"invalid",
+					"done",
+					"thisCompilation"
+				].includes(name)
+			) {
+				if (childCompiler.hooks[name]) {
+					childCompiler.hooks[name].taps = this.hooks[name].taps.slice();
+				}
+			}
+		}
+
+		compilation.hooks.childCompiler.call(
+			childCompiler,
+			compilerName,
+			compilerIndex
+		);
+
+		return childCompiler;
+	}
+
+	isChild() {
+		return !!this.parentCompilation;
+	}
+
+	createCompilation(params) {
+		this._cleanupLastCompilation();
+		return (this._lastCompilation = new Compilation(this, params));
+	}
+
+	/**
+	 * @param {CompilationParams} params the compilation parameters
+	 * @returns {Compilation} the created compilation
+	 */
+	newCompilation(params) {
+		const compilation = this.createCompilation(params);
+		compilation.name = this.name;
+		compilation.records = this.records;
+		this.hooks.thisCompilation.call(compilation, params);
+		this.hooks.compilation.call(compilation, params);
+		return compilation;
+	}
+
+	createNormalModuleFactory() {
+		this._cleanupLastNormalModuleFactory();
+		const normalModuleFactory = new NormalModuleFactory({
+			context: this.options.context,
+			fs: this.inputFileSystem,
+			resolverFactory: this.resolverFactory,
+			options: this.options.module,
+			associatedObjectForCache: this.root,
+			layers: this.options.experiments.layers
+		});
+		this._lastNormalModuleFactory = normalModuleFactory;
+		this.hooks.normalModuleFactory.call(normalModuleFactory);
+		return normalModuleFactory;
+	}
+
+	createContextModuleFactory() {
+		const contextModuleFactory = new ContextModuleFactory(this.resolverFactory);
+		this.hooks.contextModuleFactory.call(contextModuleFactory);
+		return contextModuleFactory;
+	}
+
+	newCompilationParams() {
+		const params = {
+			normalModuleFactory: this.createNormalModuleFactory(),
+			contextModuleFactory: this.createContextModuleFactory()
+		};
+		return params;
+	}
+
+	/**
+	 * @param {Callback<Compilation>} callback signals when the compilation finishes
+	 * @returns {void}
+	 */
+	compile(callback) {
+		const params = this.newCompilationParams();
+		this.hooks.beforeCompile.callAsync(params, err => {
+			if (err) return callback(err);
+
+			this.hooks.compile.call(params);
+
+			const compilation = this.newCompilation(params);
+
+			const logger = compilation.getLogger("webpack.Compiler");
+
+			logger.time("make hook");
+			this.hooks.make.callAsync(compilation, err => {
+				logger.timeEnd("make hook");
+				if (err) return callback(err);
+
+				logger.time("finish make hook");
+				this.hooks.finishMake.callAsync(compilation, err => {
+					logger.timeEnd("finish make hook");
+					if (err) return callback(err);
+
+					process.nextTick(() => {
+						logger.time("finish compilation");
+						compilation.finish(err => {
+							logger.timeEnd("finish compilation");
+							if (err) return callback(err);
+
+							logger.time("seal compilation");
+							compilation.seal(err => {
+								logger.timeEnd("seal compilation");
+								if (err) return callback(err);
+
+								logger.time("afterCompile hook");
+								this.hooks.afterCompile.callAsync(compilation, err => {
+									logger.timeEnd("afterCompile hook");
+									if (err) return callback(err);
+
+									return callback(null, compilation);
+								});
+							});
+						});
+					});
+				});
+			});
+		});
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the compiler closes
+	 * @returns {void}
+	 */
+	close(callback) {
+		if (this.watching) {
+			// When there is still an active watching, close this first
+			this.watching.close(err => {
+				this.close(callback);
+			});
+			return;
+		}
+		this.hooks.shutdown.callAsync(err => {
+			if (err) return callback(err);
+			// Get rid of reference to last compilation to avoid leaking memory
+			// We can't run this._cleanupLastCompilation() as the Stats to this compilation
+			// might be still in use. We try to get rid of the reference to the cache instead.
+			this._lastCompilation = undefined;
+			this._lastNormalModuleFactory = undefined;
+			this.cache.shutdown(callback);
+		});
+	}
+}
+
+module.exports = Compiler;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ConcatenationScope.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ConcatenationScope.js
new file mode 100644
index 0000000..c1e1758
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ConcatenationScope.js
@@ -0,0 +1,159 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Module")} Module */
+
+const MODULE_REFERENCE_REGEXP =
+	/^__WEBPACK_MODULE_REFERENCE__(\d+)_([\da-f]+|ns)(_call)?(_directImport)?(?:_asiSafe(\d))?__$/;
+
+const DEFAULT_EXPORT = "__WEBPACK_DEFAULT_EXPORT__";
+const NAMESPACE_OBJECT_EXPORT = "__WEBPACK_NAMESPACE_OBJECT__";
+
+/**
+ * @typedef {Object} ExternalModuleInfo
+ * @property {number} index
+ * @property {Module} module
+ */
+
+/**
+ * @typedef {Object} ConcatenatedModuleInfo
+ * @property {number} index
+ * @property {Module} module
+ * @property {Map<string, string>} exportMap mapping from export name to symbol
+ * @property {Map<string, string>} rawExportMap mapping from export name to symbol
+ * @property {string=} namespaceExportSymbol
+ */
+
+/** @typedef {ConcatenatedModuleInfo | ExternalModuleInfo} ModuleInfo */
+
+/**
+ * @typedef {Object} ModuleReferenceOptions
+ * @property {string[]} ids the properties/exports of the module
+ * @property {boolean} call true, when this referenced export is called
+ * @property {boolean} directImport true, when this referenced export is directly imported (not via property access)
+ * @property {boolean | undefined} asiSafe if the position is ASI safe or unknown
+ */
+
+class ConcatenationScope {
+	/**
+	 * @param {ModuleInfo[] | Map<Module, ModuleInfo>} modulesMap all module info by module
+	 * @param {ConcatenatedModuleInfo} currentModule the current module info
+	 */
+	constructor(modulesMap, currentModule) {
+		this._currentModule = currentModule;
+		if (Array.isArray(modulesMap)) {
+			const map = new Map();
+			for (const info of modulesMap) {
+				map.set(info.module, info);
+			}
+			modulesMap = map;
+		}
+		this._modulesMap = modulesMap;
+	}
+
+	/**
+	 * @param {Module} module the referenced module
+	 * @returns {boolean} true, when it's in the scope
+	 */
+	isModuleInScope(module) {
+		return this._modulesMap.has(module);
+	}
+
+	/**
+	 *
+	 * @param {string} exportName name of the export
+	 * @param {string} symbol identifier of the export in source code
+	 */
+	registerExport(exportName, symbol) {
+		if (!this._currentModule.exportMap) {
+			this._currentModule.exportMap = new Map();
+		}
+		if (!this._currentModule.exportMap.has(exportName)) {
+			this._currentModule.exportMap.set(exportName, symbol);
+		}
+	}
+
+	/**
+	 *
+	 * @param {string} exportName name of the export
+	 * @param {string} expression expression to be used
+	 */
+	registerRawExport(exportName, expression) {
+		if (!this._currentModule.rawExportMap) {
+			this._currentModule.rawExportMap = new Map();
+		}
+		if (!this._currentModule.rawExportMap.has(exportName)) {
+			this._currentModule.rawExportMap.set(exportName, expression);
+		}
+	}
+
+	/**
+	 * @param {string} symbol identifier of the export in source code
+	 */
+	registerNamespaceExport(symbol) {
+		this._currentModule.namespaceExportSymbol = symbol;
+	}
+
+	/**
+	 *
+	 * @param {Module} module the referenced module
+	 * @param {Partial<ModuleReferenceOptions>} options options
+	 * @returns {string} the reference as identifier
+	 */
+	createModuleReference(
+		module,
+		{ ids = undefined, call = false, directImport = false, asiSafe = false }
+	) {
+		const info = this._modulesMap.get(module);
+		const callFlag = call ? "_call" : "";
+		const directImportFlag = directImport ? "_directImport" : "";
+		const asiSafeFlag = asiSafe
+			? "_asiSafe1"
+			: asiSafe === false
+			? "_asiSafe0"
+			: "";
+		const exportData = ids
+			? Buffer.from(JSON.stringify(ids), "utf-8").toString("hex")
+			: "ns";
+		// a "._" is appended to allow "delete ...", which would cause a SyntaxError in strict mode
+		return `__WEBPACK_MODULE_REFERENCE__${info.index}_${exportData}${callFlag}${directImportFlag}${asiSafeFlag}__._`;
+	}
+
+	/**
+	 * @param {string} name the identifier
+	 * @returns {boolean} true, when it's an module reference
+	 */
+	static isModuleReference(name) {
+		return MODULE_REFERENCE_REGEXP.test(name);
+	}
+
+	/**
+	 * @param {string} name the identifier
+	 * @returns {ModuleReferenceOptions & { index: number }} parsed options and index
+	 */
+	static matchModuleReference(name) {
+		const match = MODULE_REFERENCE_REGEXP.exec(name);
+		if (!match) return null;
+		const index = +match[1];
+		const asiSafe = match[5];
+		return {
+			index,
+			ids:
+				match[2] === "ns"
+					? []
+					: JSON.parse(Buffer.from(match[2], "hex").toString("utf-8")),
+			call: !!match[3],
+			directImport: !!match[4],
+			asiSafe: asiSafe ? asiSafe === "1" : undefined
+		};
+	}
+}
+
+ConcatenationScope.DEFAULT_EXPORT = DEFAULT_EXPORT;
+ConcatenationScope.NAMESPACE_OBJECT_EXPORT = NAMESPACE_OBJECT_EXPORT;
+
+module.exports = ConcatenationScope;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ConcurrentCompilationError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ConcurrentCompilationError.js
new file mode 100644
index 0000000..3643553
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ConcurrentCompilationError.js
@@ -0,0 +1,18 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Maksim Nazarjev @acupofspirt
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+module.exports = class ConcurrentCompilationError extends WebpackError {
+	constructor() {
+		super();
+
+		this.name = "ConcurrentCompilationError";
+		this.message =
+			"You ran Webpack twice. Each instance only supports a single concurrent compilation at a time.";
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ConditionalInitFragment.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ConditionalInitFragment.js
new file mode 100644
index 0000000..0a44f42
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ConditionalInitFragment.js
@@ -0,0 +1,112 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, PrefixSource } = require("webpack-sources");
+const InitFragment = require("./InitFragment");
+const Template = require("./Template");
+const { mergeRuntime } = require("./util/runtime");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./Generator").GenerateContext} GenerateContext */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+const wrapInCondition = (condition, source) => {
+	if (typeof source === "string") {
+		return Template.asString([
+			`if (${condition}) {`,
+			Template.indent(source),
+			"}",
+			""
+		]);
+	} else {
+		return new ConcatSource(
+			`if (${condition}) {\n`,
+			new PrefixSource("\t", source),
+			"}\n"
+		);
+	}
+};
+
+/**
+ * @typedef {GenerateContext} Context
+ */
+class ConditionalInitFragment extends InitFragment {
+	/**
+	 * @param {string|Source} content the source code that will be included as initialization code
+	 * @param {number} stage category of initialization code (contribute to order)
+	 * @param {number} position position in the category (contribute to order)
+	 * @param {string} key unique key to avoid emitting the same initialization code twice
+	 * @param {RuntimeSpec | boolean} runtimeCondition in which runtime this fragment should be executed
+	 * @param {string|Source=} endContent the source code that will be included at the end of the module
+	 */
+	constructor(
+		content,
+		stage,
+		position,
+		key,
+		runtimeCondition = true,
+		endContent
+	) {
+		super(content, stage, position, key, endContent);
+		this.runtimeCondition = runtimeCondition;
+	}
+
+	/**
+	 * @param {Context} context context
+	 * @returns {string|Source} the source code that will be included as initialization code
+	 */
+	getContent(context) {
+		if (this.runtimeCondition === false || !this.content) return "";
+		if (this.runtimeCondition === true) return this.content;
+		const expr = context.runtimeTemplate.runtimeConditionExpression({
+			chunkGraph: context.chunkGraph,
+			runtimeRequirements: context.runtimeRequirements,
+			runtime: context.runtime,
+			runtimeCondition: this.runtimeCondition
+		});
+		if (expr === "true") return this.content;
+		return wrapInCondition(expr, this.content);
+	}
+
+	/**
+	 * @param {Context} context context
+	 * @returns {string|Source=} the source code that will be included at the end of the module
+	 */
+	getEndContent(context) {
+		if (this.runtimeCondition === false || !this.endContent) return "";
+		if (this.runtimeCondition === true) return this.endContent;
+		const expr = context.runtimeTemplate.runtimeConditionExpression({
+			chunkGraph: context.chunkGraph,
+			runtimeRequirements: context.runtimeRequirements,
+			runtime: context.runtime,
+			runtimeCondition: this.runtimeCondition
+		});
+		if (expr === "true") return this.endContent;
+		return wrapInCondition(expr, this.endContent);
+	}
+
+	merge(other) {
+		if (this.runtimeCondition === true) return this;
+		if (other.runtimeCondition === true) return other;
+		if (this.runtimeCondition === false) return other;
+		if (other.runtimeCondition === false) return this;
+		const runtimeCondition = mergeRuntime(
+			this.runtimeCondition,
+			other.runtimeCondition
+		);
+		return new ConditionalInitFragment(
+			this.content,
+			this.stage,
+			this.position,
+			this.key,
+			runtimeCondition,
+			this.endContent
+		);
+	}
+}
+
+module.exports = ConditionalInitFragment;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ConstPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ConstPlugin.js
new file mode 100644
index 0000000..844da0c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ConstPlugin.js
@@ -0,0 +1,497 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const CachedConstDependency = require("./dependencies/CachedConstDependency");
+const ConstDependency = require("./dependencies/ConstDependency");
+const { evaluateToString } = require("./javascript/JavascriptParserHelpers");
+const { parseResource } = require("./util/identifier");
+
+/** @typedef {import("estree").Expression} ExpressionNode */
+/** @typedef {import("estree").Super} SuperNode */
+/** @typedef {import("./Compiler")} Compiler */
+
+const collectDeclaration = (declarations, pattern) => {
+	const stack = [pattern];
+	while (stack.length > 0) {
+		const node = stack.pop();
+		switch (node.type) {
+			case "Identifier":
+				declarations.add(node.name);
+				break;
+			case "ArrayPattern":
+				for (const element of node.elements) {
+					if (element) {
+						stack.push(element);
+					}
+				}
+				break;
+			case "AssignmentPattern":
+				stack.push(node.left);
+				break;
+			case "ObjectPattern":
+				for (const property of node.properties) {
+					stack.push(property.value);
+				}
+				break;
+			case "RestElement":
+				stack.push(node.argument);
+				break;
+		}
+	}
+};
+
+const getHoistedDeclarations = (branch, includeFunctionDeclarations) => {
+	const declarations = new Set();
+	const stack = [branch];
+	while (stack.length > 0) {
+		const node = stack.pop();
+		// Some node could be `null` or `undefined`.
+		if (!node) continue;
+		switch (node.type) {
+			// Walk through control statements to look for hoisted declarations.
+			// Some branches are skipped since they do not allow declarations.
+			case "BlockStatement":
+				for (const stmt of node.body) {
+					stack.push(stmt);
+				}
+				break;
+			case "IfStatement":
+				stack.push(node.consequent);
+				stack.push(node.alternate);
+				break;
+			case "ForStatement":
+				stack.push(node.init);
+				stack.push(node.body);
+				break;
+			case "ForInStatement":
+			case "ForOfStatement":
+				stack.push(node.left);
+				stack.push(node.body);
+				break;
+			case "DoWhileStatement":
+			case "WhileStatement":
+			case "LabeledStatement":
+				stack.push(node.body);
+				break;
+			case "SwitchStatement":
+				for (const cs of node.cases) {
+					for (const consequent of cs.consequent) {
+						stack.push(consequent);
+					}
+				}
+				break;
+			case "TryStatement":
+				stack.push(node.block);
+				if (node.handler) {
+					stack.push(node.handler.body);
+				}
+				stack.push(node.finalizer);
+				break;
+			case "FunctionDeclaration":
+				if (includeFunctionDeclarations) {
+					collectDeclaration(declarations, node.id);
+				}
+				break;
+			case "VariableDeclaration":
+				if (node.kind === "var") {
+					for (const decl of node.declarations) {
+						collectDeclaration(declarations, decl.id);
+					}
+				}
+				break;
+		}
+	}
+	return Array.from(declarations);
+};
+
+class ConstPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const cachedParseResource = parseResource.bindCache(compiler.root);
+		compiler.hooks.compilation.tap(
+			"ConstPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					ConstDependency,
+					new ConstDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					CachedConstDependency,
+					new CachedConstDependency.Template()
+				);
+
+				const handler = parser => {
+					parser.hooks.statementIf.tap("ConstPlugin", statement => {
+						if (parser.scope.isAsmJs) return;
+						const param = parser.evaluateExpression(statement.test);
+						const bool = param.asBool();
+						if (typeof bool === "boolean") {
+							if (!param.couldHaveSideEffects()) {
+								const dep = new ConstDependency(`${bool}`, param.range);
+								dep.loc = statement.loc;
+								parser.state.module.addPresentationalDependency(dep);
+							} else {
+								parser.walkExpression(statement.test);
+							}
+							const branchToRemove = bool
+								? statement.alternate
+								: statement.consequent;
+							if (branchToRemove) {
+								// Before removing the dead branch, the hoisted declarations
+								// must be collected.
+								//
+								// Given the following code:
+								//
+								//     if (true) f() else g()
+								//     if (false) {
+								//       function f() {}
+								//       const g = function g() {}
+								//       if (someTest) {
+								//         let a = 1
+								//         var x, {y, z} = obj
+								//       }
+								//     } else {
+								//       …
+								//     }
+								//
+								// the generated code is:
+								//
+								//     if (true) f() else {}
+								//     if (false) {
+								//       var f, x, y, z;   (in loose mode)
+								//       var x, y, z;      (in strict mode)
+								//     } else {
+								//       …
+								//     }
+								//
+								// NOTE: When code runs in strict mode, `var` declarations
+								// are hoisted but `function` declarations don't.
+								//
+								let declarations;
+								if (parser.scope.isStrict) {
+									// If the code runs in strict mode, variable declarations
+									// using `var` must be hoisted.
+									declarations = getHoistedDeclarations(branchToRemove, false);
+								} else {
+									// Otherwise, collect all hoisted declaration.
+									declarations = getHoistedDeclarations(branchToRemove, true);
+								}
+								let replacement;
+								if (declarations.length > 0) {
+									replacement = `{ var ${declarations.join(", ")}; }`;
+								} else {
+									replacement = "{}";
+								}
+								const dep = new ConstDependency(
+									replacement,
+									branchToRemove.range
+								);
+								dep.loc = branchToRemove.loc;
+								parser.state.module.addPresentationalDependency(dep);
+							}
+							return bool;
+						}
+					});
+					parser.hooks.expressionConditionalOperator.tap(
+						"ConstPlugin",
+						expression => {
+							if (parser.scope.isAsmJs) return;
+							const param = parser.evaluateExpression(expression.test);
+							const bool = param.asBool();
+							if (typeof bool === "boolean") {
+								if (!param.couldHaveSideEffects()) {
+									const dep = new ConstDependency(` ${bool}`, param.range);
+									dep.loc = expression.loc;
+									parser.state.module.addPresentationalDependency(dep);
+								} else {
+									parser.walkExpression(expression.test);
+								}
+								// Expressions do not hoist.
+								// It is safe to remove the dead branch.
+								//
+								// Given the following code:
+								//
+								//   false ? someExpression() : otherExpression();
+								//
+								// the generated code is:
+								//
+								//   false ? 0 : otherExpression();
+								//
+								const branchToRemove = bool
+									? expression.alternate
+									: expression.consequent;
+								const dep = new ConstDependency("0", branchToRemove.range);
+								dep.loc = branchToRemove.loc;
+								parser.state.module.addPresentationalDependency(dep);
+								return bool;
+							}
+						}
+					);
+					parser.hooks.expressionLogicalOperator.tap(
+						"ConstPlugin",
+						expression => {
+							if (parser.scope.isAsmJs) return;
+							if (
+								expression.operator === "&&" ||
+								expression.operator === "||"
+							) {
+								const param = parser.evaluateExpression(expression.left);
+								const bool = param.asBool();
+								if (typeof bool === "boolean") {
+									// Expressions do not hoist.
+									// It is safe to remove the dead branch.
+									//
+									// ------------------------------------------
+									//
+									// Given the following code:
+									//
+									//   falsyExpression() && someExpression();
+									//
+									// the generated code is:
+									//
+									//   falsyExpression() && false;
+									//
+									// ------------------------------------------
+									//
+									// Given the following code:
+									//
+									//   truthyExpression() && someExpression();
+									//
+									// the generated code is:
+									//
+									//   true && someExpression();
+									//
+									// ------------------------------------------
+									//
+									// Given the following code:
+									//
+									//   truthyExpression() || someExpression();
+									//
+									// the generated code is:
+									//
+									//   truthyExpression() || false;
+									//
+									// ------------------------------------------
+									//
+									// Given the following code:
+									//
+									//   falsyExpression() || someExpression();
+									//
+									// the generated code is:
+									//
+									//   false && someExpression();
+									//
+									const keepRight =
+										(expression.operator === "&&" && bool) ||
+										(expression.operator === "||" && !bool);
+
+									if (
+										!param.couldHaveSideEffects() &&
+										(param.isBoolean() || keepRight)
+									) {
+										// for case like
+										//
+										//   return'development'===process.env.NODE_ENV&&'foo'
+										//
+										// we need a space before the bool to prevent result like
+										//
+										//   returnfalse&&'foo'
+										//
+										const dep = new ConstDependency(` ${bool}`, param.range);
+										dep.loc = expression.loc;
+										parser.state.module.addPresentationalDependency(dep);
+									} else {
+										parser.walkExpression(expression.left);
+									}
+									if (!keepRight) {
+										const dep = new ConstDependency(
+											"0",
+											expression.right.range
+										);
+										dep.loc = expression.loc;
+										parser.state.module.addPresentationalDependency(dep);
+									}
+									return keepRight;
+								}
+							} else if (expression.operator === "??") {
+								const param = parser.evaluateExpression(expression.left);
+								const keepRight = param && param.asNullish();
+								if (typeof keepRight === "boolean") {
+									// ------------------------------------------
+									//
+									// Given the following code:
+									//
+									//   nonNullish ?? someExpression();
+									//
+									// the generated code is:
+									//
+									//   nonNullish ?? 0;
+									//
+									// ------------------------------------------
+									//
+									// Given the following code:
+									//
+									//   nullish ?? someExpression();
+									//
+									// the generated code is:
+									//
+									//   null ?? someExpression();
+									//
+									if (!param.couldHaveSideEffects() && keepRight) {
+										// cspell:word returnnull
+										// for case like
+										//
+										//   return('development'===process.env.NODE_ENV&&null)??'foo'
+										//
+										// we need a space before the bool to prevent result like
+										//
+										//   returnnull??'foo'
+										//
+										const dep = new ConstDependency(" null", param.range);
+										dep.loc = expression.loc;
+										parser.state.module.addPresentationalDependency(dep);
+									} else {
+										const dep = new ConstDependency(
+											"0",
+											expression.right.range
+										);
+										dep.loc = expression.loc;
+										parser.state.module.addPresentationalDependency(dep);
+										parser.walkExpression(expression.left);
+									}
+
+									return keepRight;
+								}
+							}
+						}
+					);
+					parser.hooks.optionalChaining.tap("ConstPlugin", expr => {
+						/** @type {ExpressionNode[]} */
+						const optionalExpressionsStack = [];
+						/** @type {ExpressionNode|SuperNode} */
+						let next = expr.expression;
+
+						while (
+							next.type === "MemberExpression" ||
+							next.type === "CallExpression"
+						) {
+							if (next.type === "MemberExpression") {
+								if (next.optional) {
+									// SuperNode can not be optional
+									optionalExpressionsStack.push(
+										/** @type {ExpressionNode} */ (next.object)
+									);
+								}
+								next = next.object;
+							} else {
+								if (next.optional) {
+									// SuperNode can not be optional
+									optionalExpressionsStack.push(
+										/** @type {ExpressionNode} */ (next.callee)
+									);
+								}
+								next = next.callee;
+							}
+						}
+
+						while (optionalExpressionsStack.length) {
+							const expression = optionalExpressionsStack.pop();
+							const evaluated = parser.evaluateExpression(expression);
+
+							if (evaluated && evaluated.asNullish()) {
+								// ------------------------------------------
+								//
+								// Given the following code:
+								//
+								//   nullishMemberChain?.a.b();
+								//
+								// the generated code is:
+								//
+								//   undefined;
+								//
+								// ------------------------------------------
+								//
+								const dep = new ConstDependency(" undefined", expr.range);
+								dep.loc = expr.loc;
+								parser.state.module.addPresentationalDependency(dep);
+								return true;
+							}
+						}
+					});
+					parser.hooks.evaluateIdentifier
+						.for("__resourceQuery")
+						.tap("ConstPlugin", expr => {
+							if (parser.scope.isAsmJs) return;
+							if (!parser.state.module) return;
+							return evaluateToString(
+								cachedParseResource(parser.state.module.resource).query
+							)(expr);
+						});
+					parser.hooks.expression
+						.for("__resourceQuery")
+						.tap("ConstPlugin", expr => {
+							if (parser.scope.isAsmJs) return;
+							if (!parser.state.module) return;
+							const dep = new CachedConstDependency(
+								JSON.stringify(
+									cachedParseResource(parser.state.module.resource).query
+								),
+								expr.range,
+								"__resourceQuery"
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+
+					parser.hooks.evaluateIdentifier
+						.for("__resourceFragment")
+						.tap("ConstPlugin", expr => {
+							if (parser.scope.isAsmJs) return;
+							if (!parser.state.module) return;
+							return evaluateToString(
+								cachedParseResource(parser.state.module.resource).fragment
+							)(expr);
+						});
+					parser.hooks.expression
+						.for("__resourceFragment")
+						.tap("ConstPlugin", expr => {
+							if (parser.scope.isAsmJs) return;
+							if (!parser.state.module) return;
+							const dep = new CachedConstDependency(
+								JSON.stringify(
+									cachedParseResource(parser.state.module.resource).fragment
+								),
+								expr.range,
+								"__resourceFragment"
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("ConstPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("ConstPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("ConstPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = ConstPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ContextExclusionPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextExclusionPlugin.js
new file mode 100644
index 0000000..da51e30
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextExclusionPlugin.js
@@ -0,0 +1,32 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./ContextModuleFactory")} ContextModuleFactory */
+
+class ContextExclusionPlugin {
+	/**
+	 * @param {RegExp} negativeMatcher Matcher regular expression
+	 */
+	constructor(negativeMatcher) {
+		this.negativeMatcher = negativeMatcher;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.contextModuleFactory.tap("ContextExclusionPlugin", cmf => {
+			cmf.hooks.contextModuleFiles.tap("ContextExclusionPlugin", files => {
+				return files.filter(filePath => !this.negativeMatcher.test(filePath));
+			});
+		});
+	}
+}
+
+module.exports = ContextExclusionPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ContextModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextModule.js
new file mode 100644
index 0000000..abf8ed3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextModule.js
@@ -0,0 +1,1147 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { OriginalSource, RawSource } = require("webpack-sources");
+const AsyncDependenciesBlock = require("./AsyncDependenciesBlock");
+const { makeWebpackError } = require("./HookWebpackError");
+const Module = require("./Module");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const Template = require("./Template");
+const WebpackError = require("./WebpackError");
+const {
+	compareLocations,
+	concatComparators,
+	compareSelect,
+	keepOriginalOrder,
+	compareModulesById
+} = require("./util/comparators");
+const { contextify, parseResource } = require("./util/identifier");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./ChunkGroup").RawChunkGroupOptions} RawChunkGroupOptions */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Module").BuildMeta} BuildMeta */
+/** @typedef {import("./Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("./Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./dependencies/ContextElementDependency")} ContextElementDependency */
+/** @template T @typedef {import("./util/LazySet")<T>} LazySet<T> */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+/** @typedef {"sync" | "eager" | "weak" | "async-weak" | "lazy" | "lazy-once"} ContextMode Context mode */
+
+/**
+ * @typedef {Object} ContextOptions
+ * @property {ContextMode} mode
+ * @property {boolean} recursive
+ * @property {RegExp} regExp
+ * @property {"strict"|boolean=} namespaceObject
+ * @property {string=} addon
+ * @property {string=} chunkName
+ * @property {RegExp=} include
+ * @property {RegExp=} exclude
+ * @property {RawChunkGroupOptions=} groupOptions
+ * @property {string=} typePrefix
+ * @property {string=} category
+ * @property {string[][]=} referencedExports exports referenced from modules (won't be mangled)
+ */
+
+/**
+ * @typedef {Object} ContextModuleOptionsExtras
+ * @property {false|string|string[]} resource
+ * @property {string=} resourceQuery
+ * @property {string=} resourceFragment
+ * @property {TODO} resolveOptions
+ */
+
+/** @typedef {ContextOptions & ContextModuleOptionsExtras} ContextModuleOptions */
+
+/**
+ * @callback ResolveDependenciesCallback
+ * @param {(Error | null)=} err
+ * @param {ContextElementDependency[]=} dependencies
+ */
+
+/**
+ * @callback ResolveDependencies
+ * @param {InputFileSystem} fs
+ * @param {ContextModuleOptions} options
+ * @param {ResolveDependenciesCallback} callback
+ */
+
+const SNAPSHOT_OPTIONS = { timestamp: true };
+
+const TYPES = new Set(["javascript"]);
+
+class ContextModule extends Module {
+	/**
+	 * @param {ResolveDependencies} resolveDependencies function to get dependencies in this context
+	 * @param {ContextModuleOptions} options options object
+	 */
+	constructor(resolveDependencies, options) {
+		if (!options || typeof options.resource === "string") {
+			const parsed = parseResource(
+				options ? /** @type {string} */ (options.resource) : ""
+			);
+			const resource = parsed.path;
+			const resourceQuery = (options && options.resourceQuery) || parsed.query;
+			const resourceFragment =
+				(options && options.resourceFragment) || parsed.fragment;
+
+			super("javascript/dynamic", resource);
+			/** @type {ContextModuleOptions} */
+			this.options = {
+				...options,
+				resource,
+				resourceQuery,
+				resourceFragment
+			};
+		} else {
+			super("javascript/dynamic");
+			/** @type {ContextModuleOptions} */
+			this.options = {
+				...options,
+				resource: options.resource,
+				resourceQuery: options.resourceQuery || "",
+				resourceFragment: options.resourceFragment || ""
+			};
+		}
+
+		// Info from Factory
+		this.resolveDependencies = resolveDependencies;
+		if (options && options.resolveOptions !== undefined) {
+			this.resolveOptions = options.resolveOptions;
+		}
+
+		if (options && typeof options.mode !== "string") {
+			throw new Error("options.mode is a required option");
+		}
+
+		this._identifier = this._createIdentifier();
+		this._forceBuild = true;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 * @param {Module} module fresh module
+	 * @returns {void}
+	 */
+	updateCacheModule(module) {
+		const m = /** @type {ContextModule} */ (module);
+		this.resolveDependencies = m.resolveDependencies;
+		this.options = m.options;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Remove internal references to allow freeing some memory.
+	 */
+	cleanupForCache() {
+		super.cleanupForCache();
+		this.resolveDependencies = undefined;
+	}
+
+	_prettyRegExp(regexString, stripSlash = true) {
+		const str = (regexString + "").replace(/!/g, "%21").replace(/\|/g, "%7C");
+		return stripSlash ? str.substring(1, str.length - 1) : str;
+	}
+
+	_createIdentifier() {
+		let identifier =
+			this.context ||
+			(typeof this.options.resource === "string" ||
+			this.options.resource === false
+				? `${this.options.resource}`
+				: this.options.resource.join("|"));
+		if (this.options.resourceQuery) {
+			identifier += `|${this.options.resourceQuery}`;
+		}
+		if (this.options.resourceFragment) {
+			identifier += `|${this.options.resourceFragment}`;
+		}
+		if (this.options.mode) {
+			identifier += `|${this.options.mode}`;
+		}
+		if (!this.options.recursive) {
+			identifier += "|nonrecursive";
+		}
+		if (this.options.addon) {
+			identifier += `|${this.options.addon}`;
+		}
+		if (this.options.regExp) {
+			identifier += `|${this._prettyRegExp(this.options.regExp, false)}`;
+		}
+		if (this.options.include) {
+			identifier += `|include: ${this._prettyRegExp(
+				this.options.include,
+				false
+			)}`;
+		}
+		if (this.options.exclude) {
+			identifier += `|exclude: ${this._prettyRegExp(
+				this.options.exclude,
+				false
+			)}`;
+		}
+		if (this.options.referencedExports) {
+			identifier += `|referencedExports: ${JSON.stringify(
+				this.options.referencedExports
+			)}`;
+		}
+		if (this.options.chunkName) {
+			identifier += `|chunkName: ${this.options.chunkName}`;
+		}
+		if (this.options.groupOptions) {
+			identifier += `|groupOptions: ${JSON.stringify(
+				this.options.groupOptions
+			)}`;
+		}
+		if (this.options.namespaceObject === "strict") {
+			identifier += "|strict namespace object";
+		} else if (this.options.namespaceObject) {
+			identifier += "|namespace object";
+		}
+
+		return identifier;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return this._identifier;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		let identifier;
+		if (this.context) {
+			identifier = requestShortener.shorten(this.context) + "/";
+		} else if (
+			typeof this.options.resource === "string" ||
+			this.options.resource === false
+		) {
+			identifier = requestShortener.shorten(`${this.options.resource}`) + "/";
+		} else {
+			identifier = this.options.resource
+				.map(r => requestShortener.shorten(r) + "/")
+				.join(" ");
+		}
+		if (this.options.resourceQuery) {
+			identifier += ` ${this.options.resourceQuery}`;
+		}
+		if (this.options.mode) {
+			identifier += ` ${this.options.mode}`;
+		}
+		if (!this.options.recursive) {
+			identifier += " nonrecursive";
+		}
+		if (this.options.addon) {
+			identifier += ` ${requestShortener.shorten(this.options.addon)}`;
+		}
+		if (this.options.regExp) {
+			identifier += ` ${this._prettyRegExp(this.options.regExp)}`;
+		}
+		if (this.options.include) {
+			identifier += ` include: ${this._prettyRegExp(this.options.include)}`;
+		}
+		if (this.options.exclude) {
+			identifier += ` exclude: ${this._prettyRegExp(this.options.exclude)}`;
+		}
+		if (this.options.referencedExports) {
+			identifier += ` referencedExports: ${this.options.referencedExports
+				.map(e => e.join("."))
+				.join(", ")}`;
+		}
+		if (this.options.chunkName) {
+			identifier += ` chunkName: ${this.options.chunkName}`;
+		}
+		if (this.options.groupOptions) {
+			const groupOptions = this.options.groupOptions;
+			for (const key of Object.keys(groupOptions)) {
+				identifier += ` ${key}: ${groupOptions[key]}`;
+			}
+		}
+		if (this.options.namespaceObject === "strict") {
+			identifier += " strict namespace object";
+		} else if (this.options.namespaceObject) {
+			identifier += " namespace object";
+		}
+
+		return identifier;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		let identifier;
+
+		if (this.context) {
+			identifier = contextify(
+				options.context,
+				this.context,
+				options.associatedObjectForCache
+			);
+		} else if (typeof this.options.resource === "string") {
+			identifier = contextify(
+				options.context,
+				this.options.resource,
+				options.associatedObjectForCache
+			);
+		} else if (this.options.resource === false) {
+			identifier = "false";
+		} else {
+			identifier = this.options.resource
+				.map(res =>
+					contextify(options.context, res, options.associatedObjectForCache)
+				)
+				.join(" ");
+		}
+
+		if (this.layer) identifier = `(${this.layer})/${identifier}`;
+		if (this.options.mode) {
+			identifier += ` ${this.options.mode}`;
+		}
+		if (this.options.recursive) {
+			identifier += " recursive";
+		}
+		if (this.options.addon) {
+			identifier += ` ${contextify(
+				options.context,
+				this.options.addon,
+				options.associatedObjectForCache
+			)}`;
+		}
+		if (this.options.regExp) {
+			identifier += ` ${this._prettyRegExp(this.options.regExp)}`;
+		}
+		if (this.options.include) {
+			identifier += ` include: ${this._prettyRegExp(this.options.include)}`;
+		}
+		if (this.options.exclude) {
+			identifier += ` exclude: ${this._prettyRegExp(this.options.exclude)}`;
+		}
+		if (this.options.referencedExports) {
+			identifier += ` referencedExports: ${this.options.referencedExports
+				.map(e => e.join("."))
+				.join(", ")}`;
+		}
+
+		return identifier;
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	invalidateBuild() {
+		this._forceBuild = true;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild({ fileSystemInfo }, callback) {
+		// build if enforced
+		if (this._forceBuild) return callback(null, true);
+
+		// always build when we have no snapshot and context
+		if (!this.buildInfo.snapshot)
+			return callback(null, Boolean(this.context || this.options.resource));
+
+		fileSystemInfo.checkSnapshotValid(this.buildInfo.snapshot, (err, valid) => {
+			callback(err, !valid);
+		});
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this._forceBuild = false;
+		/** @type {BuildMeta} */
+		this.buildMeta = {
+			exportsType: "default",
+			defaultObject: "redirect-warn"
+		};
+		this.buildInfo = {
+			snapshot: undefined
+		};
+		this.dependencies.length = 0;
+		this.blocks.length = 0;
+		const startTime = Date.now();
+		this.resolveDependencies(fs, this.options, (err, dependencies) => {
+			if (err) {
+				return callback(
+					makeWebpackError(err, "ContextModule.resolveDependencies")
+				);
+			}
+
+			// abort if something failed
+			// this will create an empty context
+			if (!dependencies) {
+				callback();
+				return;
+			}
+
+			// enhance dependencies with meta info
+			for (const dep of dependencies) {
+				dep.loc = {
+					name: dep.userRequest
+				};
+				dep.request = this.options.addon + dep.request;
+			}
+			dependencies.sort(
+				concatComparators(
+					compareSelect(a => a.loc, compareLocations),
+					keepOriginalOrder(this.dependencies)
+				)
+			);
+
+			if (this.options.mode === "sync" || this.options.mode === "eager") {
+				// if we have an sync or eager context
+				// just add all dependencies and continue
+				this.dependencies = dependencies;
+			} else if (this.options.mode === "lazy-once") {
+				// for the lazy-once mode create a new async dependency block
+				// and add that block to this context
+				if (dependencies.length > 0) {
+					const block = new AsyncDependenciesBlock({
+						...this.options.groupOptions,
+						name: this.options.chunkName
+					});
+					for (const dep of dependencies) {
+						block.addDependency(dep);
+					}
+					this.addBlock(block);
+				}
+			} else if (
+				this.options.mode === "weak" ||
+				this.options.mode === "async-weak"
+			) {
+				// we mark all dependencies as weak
+				for (const dep of dependencies) {
+					dep.weak = true;
+				}
+				this.dependencies = dependencies;
+			} else if (this.options.mode === "lazy") {
+				// if we are lazy create a new async dependency block per dependency
+				// and add all blocks to this context
+				let index = 0;
+				for (const dep of dependencies) {
+					let chunkName = this.options.chunkName;
+					if (chunkName) {
+						if (!/\[(index|request)\]/.test(chunkName)) {
+							chunkName += "[index]";
+						}
+						chunkName = chunkName.replace(/\[index\]/g, `${index++}`);
+						chunkName = chunkName.replace(
+							/\[request\]/g,
+							Template.toPath(dep.userRequest)
+						);
+					}
+					const block = new AsyncDependenciesBlock(
+						{
+							...this.options.groupOptions,
+							name: chunkName
+						},
+						dep.loc,
+						dep.userRequest
+					);
+					block.addDependency(dep);
+					this.addBlock(block);
+				}
+			} else {
+				callback(
+					new WebpackError(`Unsupported mode "${this.options.mode}" in context`)
+				);
+				return;
+			}
+			if (!this.context && !this.options.resource) return callback();
+
+			compilation.fileSystemInfo.createSnapshot(
+				startTime,
+				null,
+				this.context
+					? [this.context]
+					: typeof this.options.resource === "string"
+					? [this.options.resource]
+					: /** @type {string[]} */ (this.options.resource),
+				null,
+				SNAPSHOT_OPTIONS,
+				(err, snapshot) => {
+					if (err) return callback(err);
+					this.buildInfo.snapshot = snapshot;
+					callback();
+				}
+			);
+		});
+	}
+
+	/**
+	 * @param {LazySet<string>} fileDependencies set where file dependencies are added to
+	 * @param {LazySet<string>} contextDependencies set where context dependencies are added to
+	 * @param {LazySet<string>} missingDependencies set where missing dependencies are added to
+	 * @param {LazySet<string>} buildDependencies set where build dependencies are added to
+	 */
+	addCacheDependencies(
+		fileDependencies,
+		contextDependencies,
+		missingDependencies,
+		buildDependencies
+	) {
+		if (this.context) {
+			contextDependencies.add(this.context);
+		} else if (typeof this.options.resource === "string") {
+			contextDependencies.add(this.options.resource);
+		} else if (this.options.resource === false) {
+			return;
+		} else {
+			for (const res of this.options.resource) contextDependencies.add(res);
+		}
+	}
+
+	/**
+	 * @param {ContextElementDependency[]} dependencies all dependencies
+	 * @param {ChunkGraph} chunkGraph chunk graph
+	 * @returns {TODO} TODO
+	 */
+	getUserRequestMap(dependencies, chunkGraph) {
+		const moduleGraph = chunkGraph.moduleGraph;
+		// if we filter first we get a new array
+		// therefore we don't need to create a clone of dependencies explicitly
+		// therefore the order of this is !important!
+		const sortedDependencies = dependencies
+			.filter(dependency => moduleGraph.getModule(dependency))
+			.sort((a, b) => {
+				if (a.userRequest === b.userRequest) {
+					return 0;
+				}
+				return a.userRequest < b.userRequest ? -1 : 1;
+			});
+		const map = Object.create(null);
+		for (const dep of sortedDependencies) {
+			const module = moduleGraph.getModule(dep);
+			map[dep.userRequest] = chunkGraph.getModuleId(module);
+		}
+		return map;
+	}
+
+	/**
+	 * @param {ContextElementDependency[]} dependencies all dependencies
+	 * @param {ChunkGraph} chunkGraph chunk graph
+	 * @returns {TODO} TODO
+	 */
+	getFakeMap(dependencies, chunkGraph) {
+		if (!this.options.namespaceObject) {
+			return 9;
+		}
+		const moduleGraph = chunkGraph.moduleGraph;
+		// bitfield
+		let hasType = 0;
+		const comparator = compareModulesById(chunkGraph);
+		// if we filter first we get a new array
+		// therefore we don't need to create a clone of dependencies explicitly
+		// therefore the order of this is !important!
+		const sortedModules = dependencies
+			.map(dependency => moduleGraph.getModule(dependency))
+			.filter(Boolean)
+			.sort(comparator);
+		const fakeMap = Object.create(null);
+		for (const module of sortedModules) {
+			const exportsType = module.getExportsType(
+				moduleGraph,
+				this.options.namespaceObject === "strict"
+			);
+			const id = chunkGraph.getModuleId(module);
+			switch (exportsType) {
+				case "namespace":
+					fakeMap[id] = 9;
+					hasType |= 1;
+					break;
+				case "dynamic":
+					fakeMap[id] = 7;
+					hasType |= 2;
+					break;
+				case "default-only":
+					fakeMap[id] = 1;
+					hasType |= 4;
+					break;
+				case "default-with-named":
+					fakeMap[id] = 3;
+					hasType |= 8;
+					break;
+				default:
+					throw new Error(`Unexpected exports type ${exportsType}`);
+			}
+		}
+		if (hasType === 1) {
+			return 9;
+		}
+		if (hasType === 2) {
+			return 7;
+		}
+		if (hasType === 4) {
+			return 1;
+		}
+		if (hasType === 8) {
+			return 3;
+		}
+		if (hasType === 0) {
+			return 9;
+		}
+		return fakeMap;
+	}
+
+	getFakeMapInitStatement(fakeMap) {
+		return typeof fakeMap === "object"
+			? `var fakeMap = ${JSON.stringify(fakeMap, null, "\t")};`
+			: "";
+	}
+
+	getReturn(type, asyncModule) {
+		if (type === 9) {
+			return "__webpack_require__(id)";
+		}
+		return `${RuntimeGlobals.createFakeNamespaceObject}(id, ${type}${
+			asyncModule ? " | 16" : ""
+		})`;
+	}
+
+	getReturnModuleObjectSource(
+		fakeMap,
+		asyncModule,
+		fakeMapDataExpression = "fakeMap[id]"
+	) {
+		if (typeof fakeMap === "number") {
+			return `return ${this.getReturn(fakeMap, asyncModule)};`;
+		}
+		return `return ${
+			RuntimeGlobals.createFakeNamespaceObject
+		}(id, ${fakeMapDataExpression}${asyncModule ? " | 16" : ""})`;
+	}
+
+	/**
+	 * @param {TODO} dependencies TODO
+	 * @param {TODO} id TODO
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {string} source code
+	 */
+	getSyncSource(dependencies, id, chunkGraph) {
+		const map = this.getUserRequestMap(dependencies, chunkGraph);
+		const fakeMap = this.getFakeMap(dependencies, chunkGraph);
+		const returnModuleObject = this.getReturnModuleObjectSource(fakeMap);
+
+		return `var map = ${JSON.stringify(map, null, "\t")};
+${this.getFakeMapInitStatement(fakeMap)}
+
+function webpackContext(req) {
+	var id = webpackContextResolve(req);
+	${returnModuleObject}
+}
+function webpackContextResolve(req) {
+	if(!${RuntimeGlobals.hasOwnProperty}(map, req)) {
+		var e = new Error("Cannot find module '" + req + "'");
+		e.code = 'MODULE_NOT_FOUND';
+		throw e;
+	}
+	return map[req];
+}
+webpackContext.keys = function webpackContextKeys() {
+	return Object.keys(map);
+};
+webpackContext.resolve = webpackContextResolve;
+module.exports = webpackContext;
+webpackContext.id = ${JSON.stringify(id)};`;
+	}
+
+	/**
+	 * @param {TODO} dependencies TODO
+	 * @param {TODO} id TODO
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {string} source code
+	 */
+	getWeakSyncSource(dependencies, id, chunkGraph) {
+		const map = this.getUserRequestMap(dependencies, chunkGraph);
+		const fakeMap = this.getFakeMap(dependencies, chunkGraph);
+		const returnModuleObject = this.getReturnModuleObjectSource(fakeMap);
+
+		return `var map = ${JSON.stringify(map, null, "\t")};
+${this.getFakeMapInitStatement(fakeMap)}
+
+function webpackContext(req) {
+	var id = webpackContextResolve(req);
+	if(!${RuntimeGlobals.moduleFactories}[id]) {
+		var e = new Error("Module '" + req + "' ('" + id + "') is not available (weak dependency)");
+		e.code = 'MODULE_NOT_FOUND';
+		throw e;
+	}
+	${returnModuleObject}
+}
+function webpackContextResolve(req) {
+	if(!${RuntimeGlobals.hasOwnProperty}(map, req)) {
+		var e = new Error("Cannot find module '" + req + "'");
+		e.code = 'MODULE_NOT_FOUND';
+		throw e;
+	}
+	return map[req];
+}
+webpackContext.keys = function webpackContextKeys() {
+	return Object.keys(map);
+};
+webpackContext.resolve = webpackContextResolve;
+webpackContext.id = ${JSON.stringify(id)};
+module.exports = webpackContext;`;
+	}
+
+	/**
+	 * @param {TODO} dependencies TODO
+	 * @param {TODO} id TODO
+	 * @param {Object} context context
+	 * @param {ChunkGraph} context.chunkGraph the chunk graph
+	 * @param {RuntimeTemplate} context.runtimeTemplate the chunk graph
+	 * @returns {string} source code
+	 */
+	getAsyncWeakSource(dependencies, id, { chunkGraph, runtimeTemplate }) {
+		const arrow = runtimeTemplate.supportsArrowFunction();
+		const map = this.getUserRequestMap(dependencies, chunkGraph);
+		const fakeMap = this.getFakeMap(dependencies, chunkGraph);
+		const returnModuleObject = this.getReturnModuleObjectSource(fakeMap, true);
+
+		return `var map = ${JSON.stringify(map, null, "\t")};
+${this.getFakeMapInitStatement(fakeMap)}
+
+function webpackAsyncContext(req) {
+	return webpackAsyncContextResolve(req).then(${
+		arrow ? "id =>" : "function(id)"
+	} {
+		if(!${RuntimeGlobals.moduleFactories}[id]) {
+			var e = new Error("Module '" + req + "' ('" + id + "') is not available (weak dependency)");
+			e.code = 'MODULE_NOT_FOUND';
+			throw e;
+		}
+		${returnModuleObject}
+	});
+}
+function webpackAsyncContextResolve(req) {
+	// Here Promise.resolve().then() is used instead of new Promise() to prevent
+	// uncaught exception popping up in devtools
+	return Promise.resolve().then(${arrow ? "() =>" : "function()"} {
+		if(!${RuntimeGlobals.hasOwnProperty}(map, req)) {
+			var e = new Error("Cannot find module '" + req + "'");
+			e.code = 'MODULE_NOT_FOUND';
+			throw e;
+		}
+		return map[req];
+	});
+}
+webpackAsyncContext.keys = ${runtimeTemplate.returningFunction(
+			"Object.keys(map)"
+		)};
+webpackAsyncContext.resolve = webpackAsyncContextResolve;
+webpackAsyncContext.id = ${JSON.stringify(id)};
+module.exports = webpackAsyncContext;`;
+	}
+
+	/**
+	 * @param {TODO} dependencies TODO
+	 * @param {TODO} id TODO
+	 * @param {Object} context context
+	 * @param {ChunkGraph} context.chunkGraph the chunk graph
+	 * @param {RuntimeTemplate} context.runtimeTemplate the chunk graph
+	 * @returns {string} source code
+	 */
+	getEagerSource(dependencies, id, { chunkGraph, runtimeTemplate }) {
+		const arrow = runtimeTemplate.supportsArrowFunction();
+		const map = this.getUserRequestMap(dependencies, chunkGraph);
+		const fakeMap = this.getFakeMap(dependencies, chunkGraph);
+		const thenFunction =
+			fakeMap !== 9
+				? `${arrow ? "id =>" : "function(id)"} {
+		${this.getReturnModuleObjectSource(fakeMap)}
+	}`
+				: "__webpack_require__";
+		return `var map = ${JSON.stringify(map, null, "\t")};
+${this.getFakeMapInitStatement(fakeMap)}
+
+function webpackAsyncContext(req) {
+	return webpackAsyncContextResolve(req).then(${thenFunction});
+}
+function webpackAsyncContextResolve(req) {
+	// Here Promise.resolve().then() is used instead of new Promise() to prevent
+	// uncaught exception popping up in devtools
+	return Promise.resolve().then(${arrow ? "() =>" : "function()"} {
+		if(!${RuntimeGlobals.hasOwnProperty}(map, req)) {
+			var e = new Error("Cannot find module '" + req + "'");
+			e.code = 'MODULE_NOT_FOUND';
+			throw e;
+		}
+		return map[req];
+	});
+}
+webpackAsyncContext.keys = ${runtimeTemplate.returningFunction(
+			"Object.keys(map)"
+		)};
+webpackAsyncContext.resolve = webpackAsyncContextResolve;
+webpackAsyncContext.id = ${JSON.stringify(id)};
+module.exports = webpackAsyncContext;`;
+	}
+
+	/**
+	 * @param {TODO} block TODO
+	 * @param {TODO} dependencies TODO
+	 * @param {TODO} id TODO
+	 * @param {Object} options options object
+	 * @param {RuntimeTemplate} options.runtimeTemplate the runtime template
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @returns {string} source code
+	 */
+	getLazyOnceSource(block, dependencies, id, { runtimeTemplate, chunkGraph }) {
+		const promise = runtimeTemplate.blockPromise({
+			chunkGraph,
+			block,
+			message: "lazy-once context",
+			runtimeRequirements: new Set()
+		});
+		const arrow = runtimeTemplate.supportsArrowFunction();
+		const map = this.getUserRequestMap(dependencies, chunkGraph);
+		const fakeMap = this.getFakeMap(dependencies, chunkGraph);
+		const thenFunction =
+			fakeMap !== 9
+				? `${arrow ? "id =>" : "function(id)"} {
+		${this.getReturnModuleObjectSource(fakeMap, true)};
+	}`
+				: "__webpack_require__";
+
+		return `var map = ${JSON.stringify(map, null, "\t")};
+${this.getFakeMapInitStatement(fakeMap)}
+
+function webpackAsyncContext(req) {
+	return webpackAsyncContextResolve(req).then(${thenFunction});
+}
+function webpackAsyncContextResolve(req) {
+	return ${promise}.then(${arrow ? "() =>" : "function()"} {
+		if(!${RuntimeGlobals.hasOwnProperty}(map, req)) {
+			var e = new Error("Cannot find module '" + req + "'");
+			e.code = 'MODULE_NOT_FOUND';
+			throw e;
+		}
+		return map[req];
+	});
+}
+webpackAsyncContext.keys = ${runtimeTemplate.returningFunction(
+			"Object.keys(map)"
+		)};
+webpackAsyncContext.resolve = webpackAsyncContextResolve;
+webpackAsyncContext.id = ${JSON.stringify(id)};
+module.exports = webpackAsyncContext;`;
+	}
+
+	/**
+	 * @param {TODO} blocks TODO
+	 * @param {TODO} id TODO
+	 * @param {Object} context context
+	 * @param {ChunkGraph} context.chunkGraph the chunk graph
+	 * @param {RuntimeTemplate} context.runtimeTemplate the chunk graph
+	 * @returns {string} source code
+	 */
+	getLazySource(blocks, id, { chunkGraph, runtimeTemplate }) {
+		const moduleGraph = chunkGraph.moduleGraph;
+		const arrow = runtimeTemplate.supportsArrowFunction();
+		let hasMultipleOrNoChunks = false;
+		let hasNoChunk = true;
+		const fakeMap = this.getFakeMap(
+			blocks.map(b => b.dependencies[0]),
+			chunkGraph
+		);
+		const hasFakeMap = typeof fakeMap === "object";
+		const items = blocks
+			.map(block => {
+				const dependency = block.dependencies[0];
+				return {
+					dependency: dependency,
+					module: moduleGraph.getModule(dependency),
+					block: block,
+					userRequest: dependency.userRequest,
+					chunks: undefined
+				};
+			})
+			.filter(item => item.module);
+		for (const item of items) {
+			const chunkGroup = chunkGraph.getBlockChunkGroup(item.block);
+			const chunks = (chunkGroup && chunkGroup.chunks) || [];
+			item.chunks = chunks;
+			if (chunks.length > 0) {
+				hasNoChunk = false;
+			}
+			if (chunks.length !== 1) {
+				hasMultipleOrNoChunks = true;
+			}
+		}
+		const shortMode = hasNoChunk && !hasFakeMap;
+		const sortedItems = items.sort((a, b) => {
+			if (a.userRequest === b.userRequest) return 0;
+			return a.userRequest < b.userRequest ? -1 : 1;
+		});
+		const map = Object.create(null);
+		for (const item of sortedItems) {
+			const moduleId = chunkGraph.getModuleId(item.module);
+			if (shortMode) {
+				map[item.userRequest] = moduleId;
+			} else {
+				const arrayStart = [moduleId];
+				if (hasFakeMap) {
+					arrayStart.push(fakeMap[moduleId]);
+				}
+				map[item.userRequest] = arrayStart.concat(
+					item.chunks.map(chunk => chunk.id)
+				);
+			}
+		}
+
+		const chunksStartPosition = hasFakeMap ? 2 : 1;
+		const requestPrefix = hasNoChunk
+			? "Promise.resolve()"
+			: hasMultipleOrNoChunks
+			? `Promise.all(ids.slice(${chunksStartPosition}).map(${RuntimeGlobals.ensureChunk}))`
+			: `${RuntimeGlobals.ensureChunk}(ids[${chunksStartPosition}])`;
+		const returnModuleObject = this.getReturnModuleObjectSource(
+			fakeMap,
+			true,
+			shortMode ? "invalid" : "ids[1]"
+		);
+
+		const webpackAsyncContext =
+			requestPrefix === "Promise.resolve()"
+				? `
+function webpackAsyncContext(req) {
+	return Promise.resolve().then(${arrow ? "() =>" : "function()"} {
+		if(!${RuntimeGlobals.hasOwnProperty}(map, req)) {
+			var e = new Error("Cannot find module '" + req + "'");
+			e.code = 'MODULE_NOT_FOUND';
+			throw e;
+		}
+
+		${shortMode ? "var id = map[req];" : "var ids = map[req], id = ids[0];"}
+		${returnModuleObject}
+	});
+}`
+				: `function webpackAsyncContext(req) {
+	if(!${RuntimeGlobals.hasOwnProperty}(map, req)) {
+		return Promise.resolve().then(${arrow ? "() =>" : "function()"} {
+			var e = new Error("Cannot find module '" + req + "'");
+			e.code = 'MODULE_NOT_FOUND';
+			throw e;
+		});
+	}
+
+	var ids = map[req], id = ids[0];
+	return ${requestPrefix}.then(${arrow ? "() =>" : "function()"} {
+		${returnModuleObject}
+	});
+}`;
+
+		return `var map = ${JSON.stringify(map, null, "\t")};
+${webpackAsyncContext}
+webpackAsyncContext.keys = ${runtimeTemplate.returningFunction(
+			"Object.keys(map)"
+		)};
+webpackAsyncContext.id = ${JSON.stringify(id)};
+module.exports = webpackAsyncContext;`;
+	}
+
+	getSourceForEmptyContext(id, runtimeTemplate) {
+		return `function webpackEmptyContext(req) {
+	var e = new Error("Cannot find module '" + req + "'");
+	e.code = 'MODULE_NOT_FOUND';
+	throw e;
+}
+webpackEmptyContext.keys = ${runtimeTemplate.returningFunction("[]")};
+webpackEmptyContext.resolve = webpackEmptyContext;
+webpackEmptyContext.id = ${JSON.stringify(id)};
+module.exports = webpackEmptyContext;`;
+	}
+
+	getSourceForEmptyAsyncContext(id, runtimeTemplate) {
+		const arrow = runtimeTemplate.supportsArrowFunction();
+		return `function webpackEmptyAsyncContext(req) {
+	// Here Promise.resolve().then() is used instead of new Promise() to prevent
+	// uncaught exception popping up in devtools
+	return Promise.resolve().then(${arrow ? "() =>" : "function()"} {
+		var e = new Error("Cannot find module '" + req + "'");
+		e.code = 'MODULE_NOT_FOUND';
+		throw e;
+	});
+}
+webpackEmptyAsyncContext.keys = ${runtimeTemplate.returningFunction("[]")};
+webpackEmptyAsyncContext.resolve = webpackEmptyAsyncContext;
+webpackEmptyAsyncContext.id = ${JSON.stringify(id)};
+module.exports = webpackEmptyAsyncContext;`;
+	}
+
+	/**
+	 * @param {string} asyncMode module mode
+	 * @param {CodeGenerationContext} context context info
+	 * @returns {string} the source code
+	 */
+	getSourceString(asyncMode, { runtimeTemplate, chunkGraph }) {
+		const id = chunkGraph.getModuleId(this);
+		if (asyncMode === "lazy") {
+			if (this.blocks && this.blocks.length > 0) {
+				return this.getLazySource(this.blocks, id, {
+					runtimeTemplate,
+					chunkGraph
+				});
+			}
+			return this.getSourceForEmptyAsyncContext(id, runtimeTemplate);
+		}
+		if (asyncMode === "eager") {
+			if (this.dependencies && this.dependencies.length > 0) {
+				return this.getEagerSource(this.dependencies, id, {
+					chunkGraph,
+					runtimeTemplate
+				});
+			}
+			return this.getSourceForEmptyAsyncContext(id, runtimeTemplate);
+		}
+		if (asyncMode === "lazy-once") {
+			const block = this.blocks[0];
+			if (block) {
+				return this.getLazyOnceSource(block, block.dependencies, id, {
+					runtimeTemplate,
+					chunkGraph
+				});
+			}
+			return this.getSourceForEmptyAsyncContext(id, runtimeTemplate);
+		}
+		if (asyncMode === "async-weak") {
+			if (this.dependencies && this.dependencies.length > 0) {
+				return this.getAsyncWeakSource(this.dependencies, id, {
+					chunkGraph,
+					runtimeTemplate
+				});
+			}
+			return this.getSourceForEmptyAsyncContext(id, runtimeTemplate);
+		}
+		if (asyncMode === "weak") {
+			if (this.dependencies && this.dependencies.length > 0) {
+				return this.getWeakSyncSource(this.dependencies, id, chunkGraph);
+			}
+		}
+		if (this.dependencies && this.dependencies.length > 0) {
+			return this.getSyncSource(this.dependencies, id, chunkGraph);
+		}
+		return this.getSourceForEmptyContext(id, runtimeTemplate);
+	}
+
+	getSource(sourceString) {
+		if (this.useSourceMap || this.useSimpleSourceMap) {
+			return new OriginalSource(sourceString, this.identifier());
+		}
+		return new RawSource(sourceString);
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration(context) {
+		const { chunkGraph } = context;
+		const sources = new Map();
+		sources.set(
+			"javascript",
+			this.getSource(this.getSourceString(this.options.mode, context))
+		);
+		const set = new Set();
+		const allDeps = /** @type {ContextElementDependency[]} */ (
+			this.dependencies.concat(this.blocks.map(b => b.dependencies[0]))
+		);
+		set.add(RuntimeGlobals.module);
+		set.add(RuntimeGlobals.hasOwnProperty);
+		if (allDeps.length > 0) {
+			const asyncMode = this.options.mode;
+			set.add(RuntimeGlobals.require);
+			if (asyncMode === "weak") {
+				set.add(RuntimeGlobals.moduleFactories);
+			} else if (asyncMode === "async-weak") {
+				set.add(RuntimeGlobals.moduleFactories);
+				set.add(RuntimeGlobals.ensureChunk);
+			} else if (asyncMode === "lazy" || asyncMode === "lazy-once") {
+				set.add(RuntimeGlobals.ensureChunk);
+			}
+			if (this.getFakeMap(allDeps, chunkGraph) !== 9) {
+				set.add(RuntimeGlobals.createFakeNamespaceObject);
+			}
+		}
+		return {
+			sources,
+			runtimeRequirements: set
+		};
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		// base penalty
+		let size = 160;
+
+		// if we don't have dependencies we stop here.
+		for (const dependency of this.dependencies) {
+			const element = /** @type {ContextElementDependency} */ (dependency);
+			size += 5 + element.userRequest.length;
+		}
+		return size;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this._identifier);
+		write(this._forceBuild);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this._identifier = read();
+		this._forceBuild = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ContextModule, "webpack/lib/ContextModule");
+
+module.exports = ContextModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ContextModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextModuleFactory.js
new file mode 100644
index 0000000..dac2310
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextModuleFactory.js
@@ -0,0 +1,437 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const { AsyncSeriesWaterfallHook, SyncWaterfallHook } = require("tapable");
+const ContextModule = require("./ContextModule");
+const ModuleFactory = require("./ModuleFactory");
+const ContextElementDependency = require("./dependencies/ContextElementDependency");
+const LazySet = require("./util/LazySet");
+const { cachedSetProperty } = require("./util/cleverMerge");
+const { createFakeHook } = require("./util/deprecation");
+const { join } = require("./util/fs");
+
+/** @typedef {import("./ContextModule").ContextModuleOptions} ContextModuleOptions */
+/** @typedef {import("./ContextModule").ResolveDependenciesCallback} ResolveDependenciesCallback */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("./ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./ResolverFactory")} ResolverFactory */
+/** @typedef {import("./dependencies/ContextDependency")} ContextDependency */
+/** @template T @typedef {import("./util/deprecation").FakeHook<T>} FakeHook<T> */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+const EMPTY_RESOLVE_OPTIONS = {};
+
+module.exports = class ContextModuleFactory extends ModuleFactory {
+	/**
+	 * @param {ResolverFactory} resolverFactory resolverFactory
+	 */
+	constructor(resolverFactory) {
+		super();
+		/** @type {AsyncSeriesWaterfallHook<[TODO[], ContextModuleOptions]>} */
+		const alternativeRequests = new AsyncSeriesWaterfallHook([
+			"modules",
+			"options"
+		]);
+		this.hooks = Object.freeze({
+			/** @type {AsyncSeriesWaterfallHook<[TODO]>} */
+			beforeResolve: new AsyncSeriesWaterfallHook(["data"]),
+			/** @type {AsyncSeriesWaterfallHook<[TODO]>} */
+			afterResolve: new AsyncSeriesWaterfallHook(["data"]),
+			/** @type {SyncWaterfallHook<[string[]]>} */
+			contextModuleFiles: new SyncWaterfallHook(["files"]),
+			/** @type {FakeHook<Pick<AsyncSeriesWaterfallHook<[TODO[]]>, "tap" | "tapAsync" | "tapPromise" | "name">>} */
+			alternatives: createFakeHook(
+				{
+					name: "alternatives",
+					/** @type {AsyncSeriesWaterfallHook<[TODO[]]>["intercept"]} */
+					intercept: interceptor => {
+						throw new Error(
+							"Intercepting fake hook ContextModuleFactory.hooks.alternatives is not possible, use ContextModuleFactory.hooks.alternativeRequests instead"
+						);
+					},
+					/** @type {AsyncSeriesWaterfallHook<[TODO[]]>["tap"]} */
+					tap: (options, fn) => {
+						alternativeRequests.tap(options, fn);
+					},
+					/** @type {AsyncSeriesWaterfallHook<[TODO[]]>["tapAsync"]} */
+					tapAsync: (options, fn) => {
+						alternativeRequests.tapAsync(options, (items, _options, callback) =>
+							fn(items, callback)
+						);
+					},
+					/** @type {AsyncSeriesWaterfallHook<[TODO[]]>["tapPromise"]} */
+					tapPromise: (options, fn) => {
+						alternativeRequests.tapPromise(options, fn);
+					}
+				},
+				"ContextModuleFactory.hooks.alternatives has deprecated in favor of ContextModuleFactory.hooks.alternativeRequests with an additional options argument.",
+				"DEP_WEBPACK_CONTEXT_MODULE_FACTORY_ALTERNATIVES"
+			),
+			alternativeRequests
+		});
+		this.resolverFactory = resolverFactory;
+	}
+
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		const context = data.context;
+		const dependencies = data.dependencies;
+		const resolveOptions = data.resolveOptions;
+		const dependency = /** @type {ContextDependency} */ (dependencies[0]);
+		const fileDependencies = new LazySet();
+		const missingDependencies = new LazySet();
+		const contextDependencies = new LazySet();
+		this.hooks.beforeResolve.callAsync(
+			{
+				context: context,
+				dependencies: dependencies,
+				resolveOptions,
+				fileDependencies,
+				missingDependencies,
+				contextDependencies,
+				...dependency.options
+			},
+			(err, beforeResolveResult) => {
+				if (err) {
+					return callback(err, {
+						fileDependencies,
+						missingDependencies,
+						contextDependencies
+					});
+				}
+
+				// Ignored
+				if (!beforeResolveResult) {
+					return callback(null, {
+						fileDependencies,
+						missingDependencies,
+						contextDependencies
+					});
+				}
+
+				const context = beforeResolveResult.context;
+				const request = beforeResolveResult.request;
+				const resolveOptions = beforeResolveResult.resolveOptions;
+
+				let loaders,
+					resource,
+					loadersPrefix = "";
+				const idx = request.lastIndexOf("!");
+				if (idx >= 0) {
+					let loadersRequest = request.substr(0, idx + 1);
+					let i;
+					for (
+						i = 0;
+						i < loadersRequest.length && loadersRequest[i] === "!";
+						i++
+					) {
+						loadersPrefix += "!";
+					}
+					loadersRequest = loadersRequest
+						.substr(i)
+						.replace(/!+$/, "")
+						.replace(/!!+/g, "!");
+					if (loadersRequest === "") {
+						loaders = [];
+					} else {
+						loaders = loadersRequest.split("!");
+					}
+					resource = request.substr(idx + 1);
+				} else {
+					loaders = [];
+					resource = request;
+				}
+
+				const contextResolver = this.resolverFactory.get(
+					"context",
+					dependencies.length > 0
+						? cachedSetProperty(
+								resolveOptions || EMPTY_RESOLVE_OPTIONS,
+								"dependencyType",
+								dependencies[0].category
+						  )
+						: resolveOptions
+				);
+				const loaderResolver = this.resolverFactory.get("loader");
+
+				asyncLib.parallel(
+					[
+						callback => {
+							const results = [];
+							const yield_ = obj => results.push(obj);
+
+							contextResolver.resolve(
+								{},
+								context,
+								resource,
+								{
+									fileDependencies,
+									missingDependencies,
+									contextDependencies,
+									yield: yield_
+								},
+								err => {
+									if (err) return callback(err);
+									callback(null, results);
+								}
+							);
+						},
+						callback => {
+							asyncLib.map(
+								loaders,
+								(loader, callback) => {
+									loaderResolver.resolve(
+										{},
+										context,
+										loader,
+										{
+											fileDependencies,
+											missingDependencies,
+											contextDependencies
+										},
+										(err, result) => {
+											if (err) return callback(err);
+											callback(null, result);
+										}
+									);
+								},
+								callback
+							);
+						}
+					],
+					(err, result) => {
+						if (err) {
+							return callback(err, {
+								fileDependencies,
+								missingDependencies,
+								contextDependencies
+							});
+						}
+						let [contextResult, loaderResult] = result;
+						if (contextResult.length > 1) {
+							const first = contextResult[0];
+							contextResult = contextResult.filter(r => r.path);
+							if (contextResult.length === 0) contextResult.push(first);
+						}
+						this.hooks.afterResolve.callAsync(
+							{
+								addon:
+									loadersPrefix +
+									loaderResult.join("!") +
+									(loaderResult.length > 0 ? "!" : ""),
+								resource:
+									contextResult.length > 1
+										? contextResult.map(r => r.path)
+										: contextResult[0].path,
+								resolveDependencies: this.resolveDependencies.bind(this),
+								resourceQuery: contextResult[0].query,
+								resourceFragment: contextResult[0].fragment,
+								...beforeResolveResult
+							},
+							(err, result) => {
+								if (err) {
+									return callback(err, {
+										fileDependencies,
+										missingDependencies,
+										contextDependencies
+									});
+								}
+
+								// Ignored
+								if (!result) {
+									return callback(null, {
+										fileDependencies,
+										missingDependencies,
+										contextDependencies
+									});
+								}
+
+								return callback(null, {
+									module: new ContextModule(result.resolveDependencies, result),
+									fileDependencies,
+									missingDependencies,
+									contextDependencies
+								});
+							}
+						);
+					}
+				);
+			}
+		);
+	}
+
+	/**
+	 * @param {InputFileSystem} fs file system
+	 * @param {ContextModuleOptions} options options
+	 * @param {ResolveDependenciesCallback} callback callback function
+	 * @returns {void}
+	 */
+	resolveDependencies(fs, options, callback) {
+		const cmf = this;
+		const {
+			resource,
+			resourceQuery,
+			resourceFragment,
+			recursive,
+			regExp,
+			include,
+			exclude,
+			referencedExports,
+			category,
+			typePrefix
+		} = options;
+		if (!regExp || !resource) return callback(null, []);
+
+		let severalContexts = false;
+		const addDirectoryChecked = (ctx, directory, visited, callback) => {
+			fs.realpath(directory, (err, realPath) => {
+				if (err) return callback(err);
+				if (visited.has(realPath)) return callback(null, []);
+				let recursionStack;
+				addDirectory(
+					ctx,
+					directory,
+					(_, dir, callback) => {
+						if (recursionStack === undefined) {
+							recursionStack = new Set(visited);
+							recursionStack.add(realPath);
+						}
+						addDirectoryChecked(ctx, dir, recursionStack, callback);
+					},
+					callback
+				);
+			});
+		};
+
+		const addDirectory = (ctx, directory, addSubDirectory, callback) => {
+			fs.readdir(directory, (err, files) => {
+				if (err) return callback(err);
+				const processedFiles = cmf.hooks.contextModuleFiles.call(
+					/** @type {string[]} */ (files).map(file => file.normalize("NFC"))
+				);
+				if (!processedFiles || processedFiles.length === 0)
+					return callback(null, []);
+				asyncLib.map(
+					processedFiles.filter(p => p.indexOf(".") !== 0),
+					(segment, callback) => {
+						const subResource = join(fs, directory, segment);
+
+						if (!exclude || !subResource.match(exclude)) {
+							fs.stat(subResource, (err, stat) => {
+								if (err) {
+									if (err.code === "ENOENT") {
+										// ENOENT is ok here because the file may have been deleted between
+										// the readdir and stat calls.
+										return callback();
+									} else {
+										return callback(err);
+									}
+								}
+
+								if (stat.isDirectory()) {
+									if (!recursive) return callback();
+									addSubDirectory(ctx, subResource, callback);
+								} else if (
+									stat.isFile() &&
+									(!include || subResource.match(include))
+								) {
+									const obj = {
+										context: ctx,
+										request:
+											"." + subResource.substr(ctx.length).replace(/\\/g, "/")
+									};
+
+									this.hooks.alternativeRequests.callAsync(
+										[obj],
+										options,
+										(err, alternatives) => {
+											if (err) return callback(err);
+											alternatives = alternatives
+												.filter(obj => regExp.test(obj.request))
+												.map(obj => {
+													const request = severalContexts
+														? join(fs, obj.context, obj.request)
+														: obj.request;
+													const dep = new ContextElementDependency(
+														request + resourceQuery + resourceFragment,
+														obj.request,
+														typePrefix,
+														category,
+														referencedExports
+													);
+													dep.optional = true;
+													return dep;
+												});
+											callback(null, alternatives);
+										}
+									);
+								} else {
+									callback();
+								}
+							});
+						} else {
+							callback();
+						}
+					},
+					(err, result) => {
+						if (err) return callback(err);
+
+						if (!result) return callback(null, []);
+
+						const flattenedResult = [];
+
+						for (const item of result) {
+							if (item) flattenedResult.push(...item);
+						}
+
+						callback(null, flattenedResult);
+					}
+				);
+			});
+		};
+
+		const addSubDirectory = (ctx, dir, callback) =>
+			addDirectory(ctx, dir, addSubDirectory, callback);
+
+		const visitResource = (resource, callback) => {
+			if (typeof fs.realpath === "function") {
+				addDirectoryChecked(resource, resource, new Set(), callback);
+			} else {
+				addDirectory(resource, resource, addSubDirectory, callback);
+			}
+		};
+
+		if (typeof resource === "string") {
+			visitResource(resource, callback);
+		} else {
+			severalContexts = true;
+			asyncLib.map(resource, visitResource, (err, result) => {
+				if (err) return callback(err);
+
+				// result dependencies should have unique userRequest
+				// ordered by resolve result
+				const temp = new Set();
+				const res = [];
+				for (let i = 0; i < result.length; i++) {
+					const inner = result[i];
+					for (const el of inner) {
+						if (temp.has(el.userRequest)) continue;
+						res.push(el);
+						temp.add(el.userRequest);
+					}
+				}
+				callback(null, res);
+			});
+		}
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ContextReplacementPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextReplacementPlugin.js
new file mode 100644
index 0000000..cc10c7b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ContextReplacementPlugin.js
@@ -0,0 +1,157 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ContextElementDependency = require("./dependencies/ContextElementDependency");
+const { join } = require("./util/fs");
+
+class ContextReplacementPlugin {
+	constructor(
+		resourceRegExp,
+		newContentResource,
+		newContentRecursive,
+		newContentRegExp
+	) {
+		this.resourceRegExp = resourceRegExp;
+
+		if (typeof newContentResource === "function") {
+			this.newContentCallback = newContentResource;
+		} else if (
+			typeof newContentResource === "string" &&
+			typeof newContentRecursive === "object"
+		) {
+			this.newContentResource = newContentResource;
+			this.newContentCreateContextMap = (fs, callback) => {
+				callback(null, newContentRecursive);
+			};
+		} else if (
+			typeof newContentResource === "string" &&
+			typeof newContentRecursive === "function"
+		) {
+			this.newContentResource = newContentResource;
+			this.newContentCreateContextMap = newContentRecursive;
+		} else {
+			if (typeof newContentResource !== "string") {
+				newContentRegExp = newContentRecursive;
+				newContentRecursive = newContentResource;
+				newContentResource = undefined;
+			}
+			if (typeof newContentRecursive !== "boolean") {
+				newContentRegExp = newContentRecursive;
+				newContentRecursive = undefined;
+			}
+			this.newContentResource = newContentResource;
+			this.newContentRecursive = newContentRecursive;
+			this.newContentRegExp = newContentRegExp;
+		}
+	}
+
+	apply(compiler) {
+		const resourceRegExp = this.resourceRegExp;
+		const newContentCallback = this.newContentCallback;
+		const newContentResource = this.newContentResource;
+		const newContentRecursive = this.newContentRecursive;
+		const newContentRegExp = this.newContentRegExp;
+		const newContentCreateContextMap = this.newContentCreateContextMap;
+
+		compiler.hooks.contextModuleFactory.tap("ContextReplacementPlugin", cmf => {
+			cmf.hooks.beforeResolve.tap("ContextReplacementPlugin", result => {
+				if (!result) return;
+				if (resourceRegExp.test(result.request)) {
+					if (newContentResource !== undefined) {
+						result.request = newContentResource;
+					}
+					if (newContentRecursive !== undefined) {
+						result.recursive = newContentRecursive;
+					}
+					if (newContentRegExp !== undefined) {
+						result.regExp = newContentRegExp;
+					}
+					if (typeof newContentCallback === "function") {
+						newContentCallback(result);
+					} else {
+						for (const d of result.dependencies) {
+							if (d.critical) d.critical = false;
+						}
+					}
+				}
+				return result;
+			});
+			cmf.hooks.afterResolve.tap("ContextReplacementPlugin", result => {
+				if (!result) return;
+				if (resourceRegExp.test(result.resource)) {
+					if (newContentResource !== undefined) {
+						if (
+							newContentResource.startsWith("/") ||
+							(newContentResource.length > 1 && newContentResource[1] === ":")
+						) {
+							result.resource = newContentResource;
+						} else {
+							result.resource = join(
+								compiler.inputFileSystem,
+								result.resource,
+								newContentResource
+							);
+						}
+					}
+					if (newContentRecursive !== undefined) {
+						result.recursive = newContentRecursive;
+					}
+					if (newContentRegExp !== undefined) {
+						result.regExp = newContentRegExp;
+					}
+					if (typeof newContentCreateContextMap === "function") {
+						result.resolveDependencies =
+							createResolveDependenciesFromContextMap(
+								newContentCreateContextMap
+							);
+					}
+					if (typeof newContentCallback === "function") {
+						const origResource = result.resource;
+						newContentCallback(result);
+						if (
+							result.resource !== origResource &&
+							!result.resource.startsWith("/") &&
+							(result.resource.length <= 1 || result.resource[1] !== ":")
+						) {
+							// When the function changed it to an relative path
+							result.resource = join(
+								compiler.inputFileSystem,
+								origResource,
+								result.resource
+							);
+						}
+					} else {
+						for (const d of result.dependencies) {
+							if (d.critical) d.critical = false;
+						}
+					}
+				}
+				return result;
+			});
+		});
+	}
+}
+
+const createResolveDependenciesFromContextMap = createContextMap => {
+	const resolveDependenciesFromContextMap = (fs, options, callback) => {
+		createContextMap(fs, (err, map) => {
+			if (err) return callback(err);
+			const dependencies = Object.keys(map).map(key => {
+				return new ContextElementDependency(
+					map[key] + options.resourceQuery + options.resourceFragment,
+					key,
+					options.category,
+					options.referencedExports
+				);
+			});
+			callback(null, dependencies);
+		});
+	};
+	return resolveDependenciesFromContextMap;
+};
+
+module.exports = ContextReplacementPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DefinePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DefinePlugin.js
new file mode 100644
index 0000000..b9e7280
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DefinePlugin.js
@@ -0,0 +1,601 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("./RuntimeGlobals");
+const WebpackError = require("./WebpackError");
+const ConstDependency = require("./dependencies/ConstDependency");
+const BasicEvaluatedExpression = require("./javascript/BasicEvaluatedExpression");
+const {
+	evaluateToString,
+	toConstantDependency
+} = require("./javascript/JavascriptParserHelpers");
+const createHash = require("./util/createHash");
+
+/** @typedef {import("estree").Expression} Expression */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./NormalModule")} NormalModule */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./javascript/JavascriptParser")} JavascriptParser */
+
+/** @typedef {null|undefined|RegExp|Function|string|number|boolean|bigint|undefined} CodeValuePrimitive */
+/** @typedef {RecursiveArrayOrRecord<CodeValuePrimitive|RuntimeValue>} CodeValue */
+
+/**
+ * @typedef {Object} RuntimeValueOptions
+ * @property {string[]=} fileDependencies
+ * @property {string[]=} contextDependencies
+ * @property {string[]=} missingDependencies
+ * @property {string[]=} buildDependencies
+ * @property {string|function(): string=} version
+ */
+
+class RuntimeValue {
+	/**
+	 * @param {function({ module: NormalModule, key: string, readonly version: string | undefined }): CodeValuePrimitive} fn generator function
+	 * @param {true | string[] | RuntimeValueOptions=} options options
+	 */
+	constructor(fn, options) {
+		this.fn = fn;
+		if (Array.isArray(options)) {
+			options = {
+				fileDependencies: options
+			};
+		}
+		this.options = options || {};
+	}
+
+	get fileDependencies() {
+		return this.options === true ? true : this.options.fileDependencies;
+	}
+
+	/**
+	 * @param {JavascriptParser} parser the parser
+	 * @param {Map<string, string | Set<string>>} valueCacheVersions valueCacheVersions
+	 * @param {string} key the defined key
+	 * @returns {CodeValuePrimitive} code
+	 */
+	exec(parser, valueCacheVersions, key) {
+		const buildInfo = parser.state.module.buildInfo;
+		if (this.options === true) {
+			buildInfo.cacheable = false;
+		} else {
+			if (this.options.fileDependencies) {
+				for (const dep of this.options.fileDependencies) {
+					buildInfo.fileDependencies.add(dep);
+				}
+			}
+			if (this.options.contextDependencies) {
+				for (const dep of this.options.contextDependencies) {
+					buildInfo.contextDependencies.add(dep);
+				}
+			}
+			if (this.options.missingDependencies) {
+				for (const dep of this.options.missingDependencies) {
+					buildInfo.missingDependencies.add(dep);
+				}
+			}
+			if (this.options.buildDependencies) {
+				for (const dep of this.options.buildDependencies) {
+					buildInfo.buildDependencies.add(dep);
+				}
+			}
+		}
+
+		return this.fn({
+			module: parser.state.module,
+			key,
+			get version() {
+				return /** @type {string} */ (
+					valueCacheVersions.get(VALUE_DEP_PREFIX + key)
+				);
+			}
+		});
+	}
+
+	getCacheVersion() {
+		return this.options === true
+			? undefined
+			: (typeof this.options.version === "function"
+					? this.options.version()
+					: this.options.version) || "unset";
+	}
+}
+
+/**
+ * @param {any[]|{[k: string]: any}} obj obj
+ * @param {JavascriptParser} parser Parser
+ * @param {Map<string, string | Set<string>>} valueCacheVersions valueCacheVersions
+ * @param {string} key the defined key
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @param {boolean|undefined|null=} asiSafe asi safe (undefined: unknown, null: unneeded)
+ * @returns {string} code converted to string that evaluates
+ */
+const stringifyObj = (
+	obj,
+	parser,
+	valueCacheVersions,
+	key,
+	runtimeTemplate,
+	asiSafe
+) => {
+	let code;
+	let arr = Array.isArray(obj);
+	if (arr) {
+		code = `[${obj
+			.map(code =>
+				toCode(code, parser, valueCacheVersions, key, runtimeTemplate, null)
+			)
+			.join(",")}]`;
+	} else {
+		code = `{${Object.keys(obj)
+			.map(key => {
+				const code = obj[key];
+				return (
+					JSON.stringify(key) +
+					":" +
+					toCode(code, parser, valueCacheVersions, key, runtimeTemplate, null)
+				);
+			})
+			.join(",")}}`;
+	}
+
+	switch (asiSafe) {
+		case null:
+			return code;
+		case true:
+			return arr ? code : `(${code})`;
+		case false:
+			return arr ? `;${code}` : `;(${code})`;
+		default:
+			return `/*#__PURE__*/Object(${code})`;
+	}
+};
+
+/**
+ * Convert code to a string that evaluates
+ * @param {CodeValue} code Code to evaluate
+ * @param {JavascriptParser} parser Parser
+ * @param {Map<string, string | Set<string>>} valueCacheVersions valueCacheVersions
+ * @param {string} key the defined key
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @param {boolean|undefined|null=} asiSafe asi safe (undefined: unknown, null: unneeded)
+ * @returns {string} code converted to string that evaluates
+ */
+const toCode = (
+	code,
+	parser,
+	valueCacheVersions,
+	key,
+	runtimeTemplate,
+	asiSafe
+) => {
+	if (code === null) {
+		return "null";
+	}
+	if (code === undefined) {
+		return "undefined";
+	}
+	if (Object.is(code, -0)) {
+		return "-0";
+	}
+	if (code instanceof RuntimeValue) {
+		return toCode(
+			code.exec(parser, valueCacheVersions, key),
+			parser,
+			valueCacheVersions,
+			key,
+			runtimeTemplate,
+			asiSafe
+		);
+	}
+	if (code instanceof RegExp && code.toString) {
+		return code.toString();
+	}
+	if (typeof code === "function" && code.toString) {
+		return "(" + code.toString() + ")";
+	}
+	if (typeof code === "object") {
+		return stringifyObj(
+			code,
+			parser,
+			valueCacheVersions,
+			key,
+			runtimeTemplate,
+			asiSafe
+		);
+	}
+	if (typeof code === "bigint") {
+		return runtimeTemplate.supportsBigIntLiteral()
+			? `${code}n`
+			: `BigInt("${code}")`;
+	}
+	return code + "";
+};
+
+const toCacheVersion = code => {
+	if (code === null) {
+		return "null";
+	}
+	if (code === undefined) {
+		return "undefined";
+	}
+	if (Object.is(code, -0)) {
+		return "-0";
+	}
+	if (code instanceof RuntimeValue) {
+		return code.getCacheVersion();
+	}
+	if (code instanceof RegExp && code.toString) {
+		return code.toString();
+	}
+	if (typeof code === "function" && code.toString) {
+		return "(" + code.toString() + ")";
+	}
+	if (typeof code === "object") {
+		const items = Object.keys(code).map(key => ({
+			key,
+			value: toCacheVersion(code[key])
+		}));
+		if (items.some(({ value }) => value === undefined)) return undefined;
+		return `{${items.map(({ key, value }) => `${key}: ${value}`).join(", ")}}`;
+	}
+	if (typeof code === "bigint") {
+		return `${code}n`;
+	}
+	return code + "";
+};
+
+const VALUE_DEP_PREFIX = "webpack/DefinePlugin ";
+const VALUE_DEP_MAIN = "webpack/DefinePlugin_hash";
+
+class DefinePlugin {
+	/**
+	 * Create a new define plugin
+	 * @param {Record<string, CodeValue>} definitions A map of global object definitions
+	 */
+	constructor(definitions) {
+		this.definitions = definitions;
+	}
+
+	/**
+	 * @param {function({ module: NormalModule, key: string, readonly version: string | undefined }): CodeValuePrimitive} fn generator function
+	 * @param {true | string[] | RuntimeValueOptions=} options options
+	 * @returns {RuntimeValue} runtime value
+	 */
+	static runtimeValue(fn, options) {
+		return new RuntimeValue(fn, options);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const definitions = this.definitions;
+		compiler.hooks.compilation.tap(
+			"DefinePlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					ConstDependency,
+					new ConstDependency.Template()
+				);
+				const { runtimeTemplate } = compilation;
+
+				const mainHash = createHash(compilation.outputOptions.hashFunction);
+				mainHash.update(
+					/** @type {string} */ (
+						compilation.valueCacheVersions.get(VALUE_DEP_MAIN)
+					) || ""
+				);
+
+				/**
+				 * Handler
+				 * @param {JavascriptParser} parser Parser
+				 * @returns {void}
+				 */
+				const handler = parser => {
+					const mainValue = compilation.valueCacheVersions.get(VALUE_DEP_MAIN);
+					parser.hooks.program.tap("DefinePlugin", () => {
+						const { buildInfo } = parser.state.module;
+						if (!buildInfo.valueDependencies)
+							buildInfo.valueDependencies = new Map();
+						buildInfo.valueDependencies.set(VALUE_DEP_MAIN, mainValue);
+					});
+
+					const addValueDependency = key => {
+						const { buildInfo } = parser.state.module;
+						buildInfo.valueDependencies.set(
+							VALUE_DEP_PREFIX + key,
+							compilation.valueCacheVersions.get(VALUE_DEP_PREFIX + key)
+						);
+					};
+
+					const withValueDependency =
+						(key, fn) =>
+						(...args) => {
+							addValueDependency(key);
+							return fn(...args);
+						};
+
+					/**
+					 * Walk definitions
+					 * @param {Object} definitions Definitions map
+					 * @param {string} prefix Prefix string
+					 * @returns {void}
+					 */
+					const walkDefinitions = (definitions, prefix) => {
+						Object.keys(definitions).forEach(key => {
+							const code = definitions[key];
+							if (
+								code &&
+								typeof code === "object" &&
+								!(code instanceof RuntimeValue) &&
+								!(code instanceof RegExp)
+							) {
+								walkDefinitions(code, prefix + key + ".");
+								applyObjectDefine(prefix + key, code);
+								return;
+							}
+							applyDefineKey(prefix, key);
+							applyDefine(prefix + key, code);
+						});
+					};
+
+					/**
+					 * Apply define key
+					 * @param {string} prefix Prefix
+					 * @param {string} key Key
+					 * @returns {void}
+					 */
+					const applyDefineKey = (prefix, key) => {
+						const splittedKey = key.split(".");
+						splittedKey.slice(1).forEach((_, i) => {
+							const fullKey = prefix + splittedKey.slice(0, i + 1).join(".");
+							parser.hooks.canRename.for(fullKey).tap("DefinePlugin", () => {
+								addValueDependency(key);
+								return true;
+							});
+						});
+					};
+
+					/**
+					 * Apply Code
+					 * @param {string} key Key
+					 * @param {CodeValue} code Code
+					 * @returns {void}
+					 */
+					const applyDefine = (key, code) => {
+						const originalKey = key;
+						const isTypeof = /^typeof\s+/.test(key);
+						if (isTypeof) key = key.replace(/^typeof\s+/, "");
+						let recurse = false;
+						let recurseTypeof = false;
+						if (!isTypeof) {
+							parser.hooks.canRename.for(key).tap("DefinePlugin", () => {
+								addValueDependency(originalKey);
+								return true;
+							});
+							parser.hooks.evaluateIdentifier
+								.for(key)
+								.tap("DefinePlugin", expr => {
+									/**
+									 * this is needed in case there is a recursion in the DefinePlugin
+									 * to prevent an endless recursion
+									 * e.g.: new DefinePlugin({
+									 * "a": "b",
+									 * "b": "a"
+									 * });
+									 */
+									if (recurse) return;
+									addValueDependency(originalKey);
+									recurse = true;
+									const res = parser.evaluate(
+										toCode(
+											code,
+											parser,
+											compilation.valueCacheVersions,
+											key,
+											runtimeTemplate,
+											null
+										)
+									);
+									recurse = false;
+									res.setRange(expr.range);
+									return res;
+								});
+							parser.hooks.expression.for(key).tap("DefinePlugin", expr => {
+								addValueDependency(originalKey);
+								const strCode = toCode(
+									code,
+									parser,
+									compilation.valueCacheVersions,
+									originalKey,
+									runtimeTemplate,
+									!parser.isAsiPosition(expr.range[0])
+								);
+								if (/__webpack_require__\s*(!?\.)/.test(strCode)) {
+									return toConstantDependency(parser, strCode, [
+										RuntimeGlobals.require
+									])(expr);
+								} else if (/__webpack_require__/.test(strCode)) {
+									return toConstantDependency(parser, strCode, [
+										RuntimeGlobals.requireScope
+									])(expr);
+								} else {
+									return toConstantDependency(parser, strCode)(expr);
+								}
+							});
+						}
+						parser.hooks.evaluateTypeof.for(key).tap("DefinePlugin", expr => {
+							/**
+							 * this is needed in case there is a recursion in the DefinePlugin
+							 * to prevent an endless recursion
+							 * e.g.: new DefinePlugin({
+							 * "typeof a": "typeof b",
+							 * "typeof b": "typeof a"
+							 * });
+							 */
+							if (recurseTypeof) return;
+							recurseTypeof = true;
+							addValueDependency(originalKey);
+							const codeCode = toCode(
+								code,
+								parser,
+								compilation.valueCacheVersions,
+								originalKey,
+								runtimeTemplate,
+								null
+							);
+							const typeofCode = isTypeof
+								? codeCode
+								: "typeof (" + codeCode + ")";
+							const res = parser.evaluate(typeofCode);
+							recurseTypeof = false;
+							res.setRange(expr.range);
+							return res;
+						});
+						parser.hooks.typeof.for(key).tap("DefinePlugin", expr => {
+							addValueDependency(originalKey);
+							const codeCode = toCode(
+								code,
+								parser,
+								compilation.valueCacheVersions,
+								originalKey,
+								runtimeTemplate,
+								null
+							);
+							const typeofCode = isTypeof
+								? codeCode
+								: "typeof (" + codeCode + ")";
+							const res = parser.evaluate(typeofCode);
+							if (!res.isString()) return;
+							return toConstantDependency(
+								parser,
+								JSON.stringify(res.string)
+							).bind(parser)(expr);
+						});
+					};
+
+					/**
+					 * Apply Object
+					 * @param {string} key Key
+					 * @param {Object} obj Object
+					 * @returns {void}
+					 */
+					const applyObjectDefine = (key, obj) => {
+						parser.hooks.canRename.for(key).tap("DefinePlugin", () => {
+							addValueDependency(key);
+							return true;
+						});
+						parser.hooks.evaluateIdentifier
+							.for(key)
+							.tap("DefinePlugin", expr => {
+								addValueDependency(key);
+								return new BasicEvaluatedExpression()
+									.setTruthy()
+									.setSideEffects(false)
+									.setRange(expr.range);
+							});
+						parser.hooks.evaluateTypeof
+							.for(key)
+							.tap(
+								"DefinePlugin",
+								withValueDependency(key, evaluateToString("object"))
+							);
+						parser.hooks.expression.for(key).tap("DefinePlugin", expr => {
+							addValueDependency(key);
+							const strCode = stringifyObj(
+								obj,
+								parser,
+								compilation.valueCacheVersions,
+								key,
+								runtimeTemplate,
+								!parser.isAsiPosition(expr.range[0])
+							);
+
+							if (/__webpack_require__\s*(!?\.)/.test(strCode)) {
+								return toConstantDependency(parser, strCode, [
+									RuntimeGlobals.require
+								])(expr);
+							} else if (/__webpack_require__/.test(strCode)) {
+								return toConstantDependency(parser, strCode, [
+									RuntimeGlobals.requireScope
+								])(expr);
+							} else {
+								return toConstantDependency(parser, strCode)(expr);
+							}
+						});
+						parser.hooks.typeof
+							.for(key)
+							.tap(
+								"DefinePlugin",
+								withValueDependency(
+									key,
+									toConstantDependency(parser, JSON.stringify("object"))
+								)
+							);
+					};
+
+					walkDefinitions(definitions, "");
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("DefinePlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("DefinePlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("DefinePlugin", handler);
+
+				/**
+				 * Walk definitions
+				 * @param {Object} definitions Definitions map
+				 * @param {string} prefix Prefix string
+				 * @returns {void}
+				 */
+				const walkDefinitionsForValues = (definitions, prefix) => {
+					Object.keys(definitions).forEach(key => {
+						const code = definitions[key];
+						const version = toCacheVersion(code);
+						const name = VALUE_DEP_PREFIX + prefix + key;
+						mainHash.update("|" + prefix + key);
+						const oldVersion = compilation.valueCacheVersions.get(name);
+						if (oldVersion === undefined) {
+							compilation.valueCacheVersions.set(name, version);
+						} else if (oldVersion !== version) {
+							const warning = new WebpackError(
+								`DefinePlugin\nConflicting values for '${prefix + key}'`
+							);
+							warning.details = `'${oldVersion}' !== '${version}'`;
+							warning.hideStack = true;
+							compilation.warnings.push(warning);
+						}
+						if (
+							code &&
+							typeof code === "object" &&
+							!(code instanceof RuntimeValue) &&
+							!(code instanceof RegExp)
+						) {
+							walkDefinitionsForValues(code, prefix + key + ".");
+						}
+					});
+				};
+
+				walkDefinitionsForValues(definitions, "");
+
+				compilation.valueCacheVersions.set(
+					VALUE_DEP_MAIN,
+					/** @type {string} */ (mainHash.digest("hex").slice(0, 8))
+				);
+			}
+		);
+	}
+}
+module.exports = DefinePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedModule.js
new file mode 100644
index 0000000..76cb0a4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedModule.js
@@ -0,0 +1,239 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { OriginalSource, RawSource } = require("webpack-sources");
+const Module = require("./Module");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const DelegatedSourceDependency = require("./dependencies/DelegatedSourceDependency");
+const StaticExportsDependency = require("./dependencies/StaticExportsDependency");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./LibManifestPlugin").ManifestModuleData} ManifestModuleData */
+/** @typedef {import("./Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("./Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("./Module").SourceContext} SourceContext */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./dependencies/ModuleDependency")} ModuleDependency */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["javascript"]);
+const RUNTIME_REQUIREMENTS = new Set([
+	RuntimeGlobals.module,
+	RuntimeGlobals.require
+]);
+
+class DelegatedModule extends Module {
+	constructor(sourceRequest, data, type, userRequest, originalRequest) {
+		super("javascript/dynamic", null);
+
+		// Info from Factory
+		this.sourceRequest = sourceRequest;
+		this.request = data.id;
+		this.delegationType = type;
+		this.userRequest = userRequest;
+		this.originalRequest = originalRequest;
+		/** @type {ManifestModuleData} */
+		this.delegateData = data;
+
+		// Build info
+		this.delegatedSourceDependency = undefined;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return typeof this.originalRequest === "string"
+			? this.originalRequest
+			: this.originalRequest.libIdent(options);
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return `delegated ${JSON.stringify(this.request)} from ${
+			this.sourceRequest
+		}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return `delegated ${this.userRequest} from ${this.sourceRequest}`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		return callback(null, !this.buildMeta);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = { ...this.delegateData.buildMeta };
+		this.buildInfo = {};
+		this.dependencies.length = 0;
+		this.delegatedSourceDependency = new DelegatedSourceDependency(
+			this.sourceRequest
+		);
+		this.addDependency(this.delegatedSourceDependency);
+		this.addDependency(
+			new StaticExportsDependency(this.delegateData.exports || true, false)
+		);
+		callback();
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({ runtimeTemplate, moduleGraph, chunkGraph }) {
+		const dep = /** @type {DelegatedSourceDependency} */ (this.dependencies[0]);
+		const sourceModule = moduleGraph.getModule(dep);
+		let str;
+
+		if (!sourceModule) {
+			str = runtimeTemplate.throwMissingModuleErrorBlock({
+				request: this.sourceRequest
+			});
+		} else {
+			str = `module.exports = (${runtimeTemplate.moduleExports({
+				module: sourceModule,
+				chunkGraph,
+				request: dep.request,
+				runtimeRequirements: new Set()
+			})})`;
+
+			switch (this.delegationType) {
+				case "require":
+					str += `(${JSON.stringify(this.request)})`;
+					break;
+				case "object":
+					str += `[${JSON.stringify(this.request)}]`;
+					break;
+			}
+
+			str += ";";
+		}
+
+		const sources = new Map();
+		if (this.useSourceMap || this.useSimpleSourceMap) {
+			sources.set("javascript", new OriginalSource(str, this.identifier()));
+		} else {
+			sources.set("javascript", new RawSource(str));
+		}
+
+		return {
+			sources,
+			runtimeRequirements: RUNTIME_REQUIREMENTS
+		};
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 42;
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		hash.update(this.delegationType);
+		hash.update(JSON.stringify(this.request));
+		super.updateHash(hash, context);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		// constructor
+		write(this.sourceRequest);
+		write(this.delegateData);
+		write(this.delegationType);
+		write(this.userRequest);
+		write(this.originalRequest);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const { read } = context;
+		const obj = new DelegatedModule(
+			read(), // sourceRequest
+			read(), // delegateData
+			read(), // delegationType
+			read(), // userRequest
+			read() // originalRequest
+		);
+		obj.deserialize(context);
+		return obj;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 * @param {Module} module fresh module
+	 * @returns {void}
+	 */
+	updateCacheModule(module) {
+		super.updateCacheModule(module);
+		const m = /** @type {DelegatedModule} */ (module);
+		this.delegationType = m.delegationType;
+		this.userRequest = m.userRequest;
+		this.originalRequest = m.originalRequest;
+		this.delegateData = m.delegateData;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Remove internal references to allow freeing some memory.
+	 */
+	cleanupForCache() {
+		super.cleanupForCache();
+		this.delegateData = undefined;
+	}
+}
+
+makeSerializable(DelegatedModule, "webpack/lib/DelegatedModule");
+
+module.exports = DelegatedModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedModuleFactoryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedModuleFactoryPlugin.js
new file mode 100644
index 0000000..1614c74
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedModuleFactoryPlugin.js
@@ -0,0 +1,91 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DelegatedModule = require("./DelegatedModule");
+
+// options.source
+// options.type
+// options.context
+// options.scope
+// options.content
+// options.associatedObjectForCache
+class DelegatedModuleFactoryPlugin {
+	constructor(options) {
+		this.options = options;
+		options.type = options.type || "require";
+		options.extensions = options.extensions || ["", ".js", ".json", ".wasm"];
+	}
+
+	apply(normalModuleFactory) {
+		const scope = this.options.scope;
+		if (scope) {
+			normalModuleFactory.hooks.factorize.tapAsync(
+				"DelegatedModuleFactoryPlugin",
+				(data, callback) => {
+					const [dependency] = data.dependencies;
+					const { request } = dependency;
+					if (request && request.startsWith(`${scope}/`)) {
+						const innerRequest = "." + request.substr(scope.length);
+						let resolved;
+						if (innerRequest in this.options.content) {
+							resolved = this.options.content[innerRequest];
+							return callback(
+								null,
+								new DelegatedModule(
+									this.options.source,
+									resolved,
+									this.options.type,
+									innerRequest,
+									request
+								)
+							);
+						}
+						for (let i = 0; i < this.options.extensions.length; i++) {
+							const extension = this.options.extensions[i];
+							const requestPlusExt = innerRequest + extension;
+							if (requestPlusExt in this.options.content) {
+								resolved = this.options.content[requestPlusExt];
+								return callback(
+									null,
+									new DelegatedModule(
+										this.options.source,
+										resolved,
+										this.options.type,
+										requestPlusExt,
+										request + extension
+									)
+								);
+							}
+						}
+					}
+					return callback();
+				}
+			);
+		} else {
+			normalModuleFactory.hooks.module.tap(
+				"DelegatedModuleFactoryPlugin",
+				module => {
+					const request = module.libIdent(this.options);
+					if (request) {
+						if (request in this.options.content) {
+							const resolved = this.options.content[request];
+							return new DelegatedModule(
+								this.options.source,
+								resolved,
+								this.options.type,
+								request,
+								module
+							);
+						}
+					}
+					return module;
+				}
+			);
+		}
+	}
+}
+module.exports = DelegatedModuleFactoryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedPlugin.js
new file mode 100644
index 0000000..ffcc489
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DelegatedPlugin.js
@@ -0,0 +1,43 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DelegatedModuleFactoryPlugin = require("./DelegatedModuleFactoryPlugin");
+const DelegatedSourceDependency = require("./dependencies/DelegatedSourceDependency");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class DelegatedPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"DelegatedPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					DelegatedSourceDependency,
+					normalModuleFactory
+				);
+			}
+		);
+
+		compiler.hooks.compile.tap("DelegatedPlugin", ({ normalModuleFactory }) => {
+			new DelegatedModuleFactoryPlugin({
+				associatedObjectForCache: compiler.root,
+				...this.options
+			}).apply(normalModuleFactory);
+		});
+	}
+}
+
+module.exports = DelegatedPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DependenciesBlock.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DependenciesBlock.js
new file mode 100644
index 0000000..5309a61
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DependenciesBlock.js
@@ -0,0 +1,107 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./util/Hash")} Hash */
+
+/** @typedef {(d: Dependency) => boolean} DependencyFilterFunction */
+
+class DependenciesBlock {
+	constructor() {
+		/** @type {Dependency[]} */
+		this.dependencies = [];
+		/** @type {AsyncDependenciesBlock[]} */
+		this.blocks = [];
+		/** @type {DependenciesBlock} */
+		this.parent = undefined;
+	}
+
+	getRootBlock() {
+		/** @type {DependenciesBlock} */
+		let current = this;
+		while (current.parent) current = current.parent;
+		return current;
+	}
+
+	/**
+	 * Adds a DependencyBlock to DependencyBlock relationship.
+	 * This is used for when a Module has a AsyncDependencyBlock tie (for code-splitting)
+	 *
+	 * @param {AsyncDependenciesBlock} block block being added
+	 * @returns {void}
+	 */
+	addBlock(block) {
+		this.blocks.push(block);
+		block.parent = this;
+	}
+
+	/**
+	 * @param {Dependency} dependency dependency being tied to block.
+	 * This is an "edge" pointing to another "node" on module graph.
+	 * @returns {void}
+	 */
+	addDependency(dependency) {
+		this.dependencies.push(dependency);
+	}
+
+	/**
+	 * @param {Dependency} dependency dependency being removed
+	 * @returns {void}
+	 */
+	removeDependency(dependency) {
+		const idx = this.dependencies.indexOf(dependency);
+		if (idx >= 0) {
+			this.dependencies.splice(idx, 1);
+		}
+	}
+
+	/**
+	 * Removes all dependencies and blocks
+	 * @returns {void}
+	 */
+	clearDependenciesAndBlocks() {
+		this.dependencies.length = 0;
+		this.blocks.length = 0;
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		for (const dep of this.dependencies) {
+			dep.updateHash(hash, context);
+		}
+		for (const block of this.blocks) {
+			block.updateHash(hash, context);
+		}
+	}
+
+	serialize({ write }) {
+		write(this.dependencies);
+		write(this.blocks);
+	}
+
+	deserialize({ read }) {
+		this.dependencies = read();
+		this.blocks = read();
+		for (const block of this.blocks) {
+			block.parent = this;
+		}
+	}
+}
+
+makeSerializable(DependenciesBlock, "webpack/lib/DependenciesBlock");
+
+module.exports = DependenciesBlock;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Dependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Dependency.js
new file mode 100644
index 0000000..7ffc363
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Dependency.js
@@ -0,0 +1,348 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const memoize = require("./util/memoize");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("./ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} UpdateHashContext
+ * @property {ChunkGraph} chunkGraph
+ * @property {RuntimeSpec} runtime
+ * @property {RuntimeTemplate=} runtimeTemplate
+ */
+
+/**
+ * @typedef {Object} SourcePosition
+ * @property {number} line
+ * @property {number=} column
+ */
+
+/**
+ * @typedef {Object} RealDependencyLocation
+ * @property {SourcePosition} start
+ * @property {SourcePosition=} end
+ * @property {number=} index
+ */
+
+/**
+ * @typedef {Object} SyntheticDependencyLocation
+ * @property {string} name
+ * @property {number=} index
+ */
+
+/** @typedef {SyntheticDependencyLocation|RealDependencyLocation} DependencyLocation */
+
+/**
+ * @typedef {Object} ExportSpec
+ * @property {string} name the name of the export
+ * @property {boolean=} canMangle can the export be renamed (defaults to true)
+ * @property {boolean=} terminalBinding is the export a terminal binding that should be checked for export star conflicts
+ * @property {(string | ExportSpec)[]=} exports nested exports
+ * @property {ModuleGraphConnection=} from when reexported: from which module
+ * @property {string[] | null=} export when reexported: from which export
+ * @property {number=} priority when reexported: with which priority
+ * @property {boolean=} hidden export is not visible, because another export blends over it
+ */
+
+/**
+ * @typedef {Object} ExportsSpec
+ * @property {(string | ExportSpec)[] | true | null} exports exported names, true for unknown exports or null for no exports
+ * @property {Set<string>=} excludeExports when exports = true, list of unaffected exports
+ * @property {Set<string>=} hideExports list of maybe prior exposed, but now hidden exports
+ * @property {ModuleGraphConnection=} from when reexported: from which module
+ * @property {number=} priority when reexported: with which priority
+ * @property {boolean=} canMangle can the export be renamed (defaults to true)
+ * @property {boolean=} terminalBinding are the exports terminal bindings that should be checked for export star conflicts
+ * @property {Module[]=} dependencies module on which the result depends on
+ */
+
+/**
+ * @typedef {Object} ReferencedExport
+ * @property {string[]} name name of the referenced export
+ * @property {boolean=} canMangle when false, referenced export can not be mangled, defaults to true
+ */
+
+const TRANSITIVE = Symbol("transitive");
+
+const getIgnoredModule = memoize(() => {
+	const RawModule = require("./RawModule");
+	return new RawModule("/* (ignored) */", `ignored`, `(ignored)`);
+});
+
+class Dependency {
+	constructor() {
+		/** @type {Module} */
+		this._parentModule = undefined;
+		/** @type {DependenciesBlock} */
+		this._parentDependenciesBlock = undefined;
+		/** @type {number} */
+		this._parentDependenciesBlockIndex = -1;
+		// TODO check if this can be moved into ModuleDependency
+		/** @type {boolean} */
+		this.weak = false;
+		// TODO check if this can be moved into ModuleDependency
+		/** @type {boolean} */
+		this.optional = false;
+		this._locSL = 0;
+		this._locSC = 0;
+		this._locEL = 0;
+		this._locEC = 0;
+		this._locI = undefined;
+		this._locN = undefined;
+		this._loc = undefined;
+	}
+
+	/**
+	 * @returns {string} a display name for the type of dependency
+	 */
+	get type() {
+		return "unknown";
+	}
+
+	/**
+	 * @returns {string} a dependency category, typical categories are "commonjs", "amd", "esm"
+	 */
+	get category() {
+		return "unknown";
+	}
+
+	/**
+	 * @returns {DependencyLocation} location
+	 */
+	get loc() {
+		if (this._loc !== undefined) return this._loc;
+		/** @type {SyntheticDependencyLocation & RealDependencyLocation} */
+		const loc = {};
+		if (this._locSL > 0) {
+			loc.start = { line: this._locSL, column: this._locSC };
+		}
+		if (this._locEL > 0) {
+			loc.end = { line: this._locEL, column: this._locEC };
+		}
+		if (this._locN !== undefined) {
+			loc.name = this._locN;
+		}
+		if (this._locI !== undefined) {
+			loc.index = this._locI;
+		}
+		return (this._loc = loc);
+	}
+
+	set loc(loc) {
+		if ("start" in loc && typeof loc.start === "object") {
+			this._locSL = loc.start.line || 0;
+			this._locSC = loc.start.column || 0;
+		} else {
+			this._locSL = 0;
+			this._locSC = 0;
+		}
+		if ("end" in loc && typeof loc.end === "object") {
+			this._locEL = loc.end.line || 0;
+			this._locEC = loc.end.column || 0;
+		} else {
+			this._locEL = 0;
+			this._locEC = 0;
+		}
+		if ("index" in loc) {
+			this._locI = loc.index;
+		} else {
+			this._locI = undefined;
+		}
+		if ("name" in loc) {
+			this._locN = loc.name;
+		} else {
+			this._locN = undefined;
+		}
+		this._loc = loc;
+	}
+
+	setLoc(startLine, startColumn, endLine, endColumn) {
+		this._locSL = startLine;
+		this._locSC = startColumn;
+		this._locEL = endLine;
+		this._locEC = endColumn;
+		this._locI = undefined;
+		this._locN = undefined;
+		this._loc = undefined;
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return null;
+	}
+
+	/**
+	 * @returns {boolean | TRANSITIVE} true, when changes to the referenced module could affect the referencing module; TRANSITIVE, when changes to the referenced module could affect referencing modules of the referencing module
+	 */
+	couldAffectReferencingModule() {
+		return TRANSITIVE;
+	}
+
+	/**
+	 * Returns the referenced module and export
+	 * @deprecated
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {never} throws error
+	 */
+	getReference(moduleGraph) {
+		throw new Error(
+			"Dependency.getReference was removed in favor of Dependency.getReferencedExports, ModuleGraph.getModule and ModuleGraph.getConnection().active"
+		);
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return Dependency.EXPORTS_OBJECT_REFERENCED;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {null | false | function(ModuleGraphConnection, RuntimeSpec): ConnectionState} function to determine if the connection is active
+	 */
+	getCondition(moduleGraph) {
+		return null;
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		return undefined;
+	}
+
+	/**
+	 * Returns warnings
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} warnings
+	 */
+	getWarnings(moduleGraph) {
+		return null;
+	}
+
+	/**
+	 * Returns errors
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} errors
+	 */
+	getErrors(moduleGraph) {
+		return null;
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {}
+
+	/**
+	 * implement this method to allow the occurrence order plugin to count correctly
+	 * @returns {number} count how often the id is used in this dependency
+	 */
+	getNumberOfIdOccurrences() {
+		return 1;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		return true;
+	}
+
+	/**
+	 * @param {string} context context directory
+	 * @returns {Module} a module
+	 */
+	createIgnoredModule(context) {
+		return getIgnoredModule();
+	}
+
+	serialize({ write }) {
+		write(this.weak);
+		write(this.optional);
+		write(this._locSL);
+		write(this._locSC);
+		write(this._locEL);
+		write(this._locEC);
+		write(this._locI);
+		write(this._locN);
+	}
+
+	deserialize({ read }) {
+		this.weak = read();
+		this.optional = read();
+		this._locSL = read();
+		this._locSC = read();
+		this._locEL = read();
+		this._locEC = read();
+		this._locI = read();
+		this._locN = read();
+	}
+}
+
+/** @type {string[][]} */
+Dependency.NO_EXPORTS_REFERENCED = [];
+/** @type {string[][]} */
+Dependency.EXPORTS_OBJECT_REFERENCED = [[]];
+
+Object.defineProperty(Dependency.prototype, "module", {
+	/**
+	 * @deprecated
+	 * @returns {never} throws
+	 */
+	get() {
+		throw new Error(
+			"module property was removed from Dependency (use compilation.moduleGraph.getModule(dependency) instead)"
+		);
+	},
+
+	/**
+	 * @deprecated
+	 * @returns {never} throws
+	 */
+	set() {
+		throw new Error(
+			"module property was removed from Dependency (use compilation.moduleGraph.updateModule(dependency, module) instead)"
+		);
+	}
+});
+
+Object.defineProperty(Dependency.prototype, "disconnect", {
+	get() {
+		throw new Error(
+			"disconnect was removed from Dependency (Dependency no longer carries graph specific information)"
+		);
+	}
+});
+
+Dependency.TRANSITIVE = TRANSITIVE;
+
+module.exports = Dependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DependencyTemplate.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DependencyTemplate.js
new file mode 100644
index 0000000..67a4d7b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DependencyTemplate.js
@@ -0,0 +1,57 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("./ConcatenationScope")} ConcatenationScope */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Dependency").RuntimeSpec} RuntimeSpec */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Generator").GenerateContext} GenerateContext */
+/** @template T @typedef {import("./InitFragment")<T>} InitFragment */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+
+/**
+ * @typedef {Object} DependencyTemplateContext
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {DependencyTemplates} dependencyTemplates the dependency templates
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {Set<string>} runtimeRequirements the requirements for runtime
+ * @property {Module} module current module
+ * @property {RuntimeSpec} runtime current runtimes, for which code is generated
+ * @property {InitFragment<GenerateContext>[]} initFragments mutable array of init fragments for the current module
+ * @property {ConcatenationScope=} concatenationScope when in a concatenated module, information about other concatenated modules
+ * @property {CodeGenerationResults} codeGenerationResults the code generation results
+ */
+
+/**
+ * @typedef {Object} CssDependencyTemplateContextExtras
+ * @property {Map<string, string>} cssExports the css exports
+ */
+
+/** @typedef {DependencyTemplateContext & CssDependencyTemplateContextExtras} CssDependencyTemplateContext */
+
+class DependencyTemplate {
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+}
+
+module.exports = DependencyTemplate;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DependencyTemplates.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DependencyTemplates.js
new file mode 100644
index 0000000..5f7f30e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DependencyTemplates.js
@@ -0,0 +1,67 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const createHash = require("./util/createHash");
+
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./DependencyTemplate")} DependencyTemplate */
+/** @typedef {typeof import("./util/Hash")} Hash */
+
+/** @typedef {new (...args: any[]) => Dependency} DependencyConstructor */
+
+class DependencyTemplates {
+	/**
+	 * @param {string | Hash} hashFunction the hash function to use
+	 */
+	constructor(hashFunction = "md4") {
+		/** @type {Map<Function, DependencyTemplate>} */
+		this._map = new Map();
+		/** @type {string} */
+		this._hash = "31d6cfe0d16ae931b73c59d7e0c089c0";
+		this._hashFunction = hashFunction;
+	}
+
+	/**
+	 * @param {DependencyConstructor} dependency Constructor of Dependency
+	 * @returns {DependencyTemplate} template for this dependency
+	 */
+	get(dependency) {
+		return this._map.get(dependency);
+	}
+
+	/**
+	 * @param {DependencyConstructor} dependency Constructor of Dependency
+	 * @param {DependencyTemplate} dependencyTemplate template for this dependency
+	 * @returns {void}
+	 */
+	set(dependency, dependencyTemplate) {
+		this._map.set(dependency, dependencyTemplate);
+	}
+
+	/**
+	 * @param {string} part additional hash contributor
+	 * @returns {void}
+	 */
+	updateHash(part) {
+		const hash = createHash(this._hashFunction);
+		hash.update(`${this._hash}${part}`);
+		this._hash = /** @type {string} */ (hash.digest("hex"));
+	}
+
+	getHash() {
+		return this._hash;
+	}
+
+	clone() {
+		const newInstance = new DependencyTemplates(this._hashFunction);
+		newInstance._map = new Map(this._map);
+		newInstance._hash = this._hash;
+		return newInstance;
+	}
+}
+
+module.exports = DependencyTemplates;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DllEntryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DllEntryPlugin.js
new file mode 100644
index 0000000..529eb0d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DllEntryPlugin.js
@@ -0,0 +1,55 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DllModuleFactory = require("./DllModuleFactory");
+const DllEntryDependency = require("./dependencies/DllEntryDependency");
+const EntryDependency = require("./dependencies/EntryDependency");
+
+class DllEntryPlugin {
+	constructor(context, entries, options) {
+		this.context = context;
+		this.entries = entries;
+		this.options = options;
+	}
+
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"DllEntryPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const dllModuleFactory = new DllModuleFactory();
+				compilation.dependencyFactories.set(
+					DllEntryDependency,
+					dllModuleFactory
+				);
+				compilation.dependencyFactories.set(
+					EntryDependency,
+					normalModuleFactory
+				);
+			}
+		);
+		compiler.hooks.make.tapAsync("DllEntryPlugin", (compilation, callback) => {
+			compilation.addEntry(
+				this.context,
+				new DllEntryDependency(
+					this.entries.map((e, idx) => {
+						const dep = new EntryDependency(e);
+						dep.loc = {
+							name: this.options.name,
+							index: idx
+						};
+						return dep;
+					}),
+					this.options.name
+				),
+				this.options,
+				callback
+			);
+		});
+	}
+}
+
+module.exports = DllEntryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DllModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DllModule.js
new file mode 100644
index 0000000..83b2d95
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DllModule.js
@@ -0,0 +1,157 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const Module = require("./Module");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("./Module").SourceContext} SourceContext */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["javascript"]);
+const RUNTIME_REQUIREMENTS = new Set([
+	RuntimeGlobals.require,
+	RuntimeGlobals.module
+]);
+
+class DllModule extends Module {
+	constructor(context, dependencies, name) {
+		super("javascript/dynamic", context);
+
+		// Info from Factory
+		this.dependencies = dependencies;
+		this.name = name;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return `dll ${this.name}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return `dll ${this.name}`;
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {};
+		return callback();
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration(context) {
+		const sources = new Map();
+		sources.set(
+			"javascript",
+			new RawSource("module.exports = __webpack_require__;")
+		);
+		return {
+			sources,
+			runtimeRequirements: RUNTIME_REQUIREMENTS
+		};
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		return callback(null, !this.buildMeta);
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 12;
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		hash.update(`dll module${this.name || ""}`);
+		super.updateHash(hash, context);
+	}
+
+	serialize(context) {
+		context.write(this.name);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		this.name = context.read();
+		super.deserialize(context);
+	}
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 * @param {Module} module fresh module
+	 * @returns {void}
+	 */
+	updateCacheModule(module) {
+		super.updateCacheModule(module);
+		this.dependencies = module.dependencies;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Remove internal references to allow freeing some memory.
+	 */
+	cleanupForCache() {
+		super.cleanupForCache();
+		this.dependencies = undefined;
+	}
+}
+
+makeSerializable(DllModule, "webpack/lib/DllModule");
+
+module.exports = DllModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DllModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DllModuleFactory.js
new file mode 100644
index 0000000..dc59d51
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DllModuleFactory.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DllModule = require("./DllModule");
+const ModuleFactory = require("./ModuleFactory");
+
+/** @typedef {import("./ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("./ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./dependencies/DllEntryDependency")} DllEntryDependency */
+
+class DllModuleFactory extends ModuleFactory {
+	constructor() {
+		super();
+		this.hooks = Object.freeze({});
+	}
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		const dependency = /** @type {DllEntryDependency} */ (data.dependencies[0]);
+		callback(null, {
+			module: new DllModule(
+				data.context,
+				dependency.dependencies,
+				dependency.name
+			)
+		});
+	}
+}
+
+module.exports = DllModuleFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DllPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DllPlugin.js
new file mode 100644
index 0000000..6365670
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DllPlugin.js
@@ -0,0 +1,68 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DllEntryPlugin = require("./DllEntryPlugin");
+const FlagAllModulesAsUsedPlugin = require("./FlagAllModulesAsUsedPlugin");
+const LibManifestPlugin = require("./LibManifestPlugin");
+const createSchemaValidation = require("./util/create-schema-validation");
+
+/** @typedef {import("../declarations/plugins/DllPlugin").DllPluginOptions} DllPluginOptions */
+/** @typedef {import("./Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/DllPlugin.check.js"),
+	() => require("../schemas/plugins/DllPlugin.json"),
+	{
+		name: "Dll Plugin",
+		baseDataPath: "options"
+	}
+);
+
+class DllPlugin {
+	/**
+	 * @param {DllPluginOptions} options options object
+	 */
+	constructor(options) {
+		validate(options);
+		this.options = {
+			...options,
+			entryOnly: options.entryOnly !== false
+		};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.entryOption.tap("DllPlugin", (context, entry) => {
+			if (typeof entry !== "function") {
+				for (const name of Object.keys(entry)) {
+					const options = {
+						name,
+						filename: entry.filename
+					};
+					new DllEntryPlugin(context, entry[name].import, options).apply(
+						compiler
+					);
+				}
+			} else {
+				throw new Error(
+					"DllPlugin doesn't support dynamic entry (function) yet"
+				);
+			}
+			return true;
+		});
+		new LibManifestPlugin(this.options).apply(compiler);
+		if (!this.options.entryOnly) {
+			new FlagAllModulesAsUsedPlugin("DllPlugin").apply(compiler);
+		}
+	}
+}
+
+module.exports = DllPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DllReferencePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DllReferencePlugin.js
new file mode 100644
index 0000000..5effddb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DllReferencePlugin.js
@@ -0,0 +1,162 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const parseJson = require("json-parse-better-errors");
+const DelegatedModuleFactoryPlugin = require("./DelegatedModuleFactoryPlugin");
+const ExternalModuleFactoryPlugin = require("./ExternalModuleFactoryPlugin");
+const WebpackError = require("./WebpackError");
+const DelegatedSourceDependency = require("./dependencies/DelegatedSourceDependency");
+const createSchemaValidation = require("./util/create-schema-validation");
+const makePathsRelative = require("./util/identifier").makePathsRelative;
+
+/** @typedef {import("../declarations/WebpackOptions").Externals} Externals */
+/** @typedef {import("../declarations/plugins/DllReferencePlugin").DllReferencePluginOptions} DllReferencePluginOptions */
+/** @typedef {import("../declarations/plugins/DllReferencePlugin").DllReferencePluginOptionsManifest} DllReferencePluginOptionsManifest */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/DllReferencePlugin.check.js"),
+	() => require("../schemas/plugins/DllReferencePlugin.json"),
+	{
+		name: "Dll Reference Plugin",
+		baseDataPath: "options"
+	}
+);
+
+class DllReferencePlugin {
+	/**
+	 * @param {DllReferencePluginOptions} options options object
+	 */
+	constructor(options) {
+		validate(options);
+		this.options = options;
+		/** @type {WeakMap<Object, {path: string, data: DllReferencePluginOptionsManifest?, error: Error?}>} */
+		this._compilationData = new WeakMap();
+	}
+
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"DllReferencePlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					DelegatedSourceDependency,
+					normalModuleFactory
+				);
+			}
+		);
+
+		compiler.hooks.beforeCompile.tapAsync(
+			"DllReferencePlugin",
+			(params, callback) => {
+				if ("manifest" in this.options) {
+					const manifest = this.options.manifest;
+					if (typeof manifest === "string") {
+						compiler.inputFileSystem.readFile(manifest, (err, result) => {
+							if (err) return callback(err);
+							const data = {
+								path: manifest,
+								data: undefined,
+								error: undefined
+							};
+							// Catch errors parsing the manifest so that blank
+							// or malformed manifest files don't kill the process.
+							try {
+								data.data = parseJson(result.toString("utf-8"));
+							} catch (e) {
+								// Store the error in the params so that it can
+								// be added as a compilation error later on.
+								const manifestPath = makePathsRelative(
+									compiler.options.context,
+									manifest,
+									compiler.root
+								);
+								data.error = new DllManifestError(manifestPath, e.message);
+							}
+							this._compilationData.set(params, data);
+							return callback();
+						});
+						return;
+					}
+				}
+				return callback();
+			}
+		);
+
+		compiler.hooks.compile.tap("DllReferencePlugin", params => {
+			let name = this.options.name;
+			let sourceType = this.options.sourceType;
+			let content =
+				"content" in this.options ? this.options.content : undefined;
+			if ("manifest" in this.options) {
+				let manifestParameter = this.options.manifest;
+				let manifest;
+				if (typeof manifestParameter === "string") {
+					const data = this._compilationData.get(params);
+					// If there was an error parsing the manifest
+					// file, exit now because the error will be added
+					// as a compilation error in the "compilation" hook.
+					if (data.error) {
+						return;
+					}
+					manifest = data.data;
+				} else {
+					manifest = manifestParameter;
+				}
+				if (manifest) {
+					if (!name) name = manifest.name;
+					if (!sourceType) sourceType = manifest.type;
+					if (!content) content = manifest.content;
+				}
+			}
+			/** @type {Externals} */
+			const externals = {};
+			const source = "dll-reference " + name;
+			externals[source] = name;
+			const normalModuleFactory = params.normalModuleFactory;
+			new ExternalModuleFactoryPlugin(sourceType || "var", externals).apply(
+				normalModuleFactory
+			);
+			new DelegatedModuleFactoryPlugin({
+				source: source,
+				type: this.options.type,
+				scope: this.options.scope,
+				context: this.options.context || compiler.options.context,
+				content,
+				extensions: this.options.extensions,
+				associatedObjectForCache: compiler.root
+			}).apply(normalModuleFactory);
+		});
+
+		compiler.hooks.compilation.tap(
+			"DllReferencePlugin",
+			(compilation, params) => {
+				if ("manifest" in this.options) {
+					let manifest = this.options.manifest;
+					if (typeof manifest === "string") {
+						const data = this._compilationData.get(params);
+						// If there was an error parsing the manifest file, add the
+						// error as a compilation error to make the compilation fail.
+						if (data.error) {
+							compilation.errors.push(data.error);
+						}
+						compilation.fileDependencies.add(manifest);
+					}
+				}
+			}
+		);
+	}
+}
+
+class DllManifestError extends WebpackError {
+	constructor(filename, message) {
+		super();
+
+		this.name = "DllManifestError";
+		this.message = `Dll manifest ${filename}\n${message}`;
+	}
+}
+
+module.exports = DllReferencePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/DynamicEntryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/DynamicEntryPlugin.js
new file mode 100644
index 0000000..dcfc993
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/DynamicEntryPlugin.js
@@ -0,0 +1,79 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Naoyuki Kanezawa @nkzawa
+*/
+
+"use strict";
+
+const EntryOptionPlugin = require("./EntryOptionPlugin");
+const EntryPlugin = require("./EntryPlugin");
+const EntryDependency = require("./dependencies/EntryDependency");
+
+/** @typedef {import("../declarations/WebpackOptions").EntryDynamicNormalized} EntryDynamic */
+/** @typedef {import("../declarations/WebpackOptions").EntryItem} EntryItem */
+/** @typedef {import("../declarations/WebpackOptions").EntryStaticNormalized} EntryStatic */
+/** @typedef {import("./Compiler")} Compiler */
+
+class DynamicEntryPlugin {
+	/**
+	 * @param {string} context the context path
+	 * @param {EntryDynamic} entry the entry value
+	 */
+	constructor(context, entry) {
+		this.context = context;
+		this.entry = entry;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"DynamicEntryPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					EntryDependency,
+					normalModuleFactory
+				);
+			}
+		);
+
+		compiler.hooks.make.tapPromise(
+			"DynamicEntryPlugin",
+			(compilation, callback) =>
+				Promise.resolve(this.entry())
+					.then(entry => {
+						const promises = [];
+						for (const name of Object.keys(entry)) {
+							const desc = entry[name];
+							const options = EntryOptionPlugin.entryDescriptionToOptions(
+								compiler,
+								name,
+								desc
+							);
+							for (const entry of desc.import) {
+								promises.push(
+									new Promise((resolve, reject) => {
+										compilation.addEntry(
+											this.context,
+											EntryPlugin.createDependency(entry, options),
+											options,
+											err => {
+												if (err) return reject(err);
+												resolve();
+											}
+										);
+									})
+								);
+							}
+						}
+						return Promise.all(promises);
+					})
+					.then(x => {})
+		);
+	}
+}
+
+module.exports = DynamicEntryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/EntryOptionPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/EntryOptionPlugin.js
new file mode 100644
index 0000000..357cff6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/EntryOptionPlugin.js
@@ -0,0 +1,93 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../declarations/WebpackOptions").EntryDescriptionNormalized} EntryDescription */
+/** @typedef {import("../declarations/WebpackOptions").EntryNormalized} Entry */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Entrypoint").EntryOptions} EntryOptions */
+
+class EntryOptionPlugin {
+	/**
+	 * @param {Compiler} compiler the compiler instance one is tapping into
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.entryOption.tap("EntryOptionPlugin", (context, entry) => {
+			EntryOptionPlugin.applyEntryOption(compiler, context, entry);
+			return true;
+		});
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler
+	 * @param {string} context context directory
+	 * @param {Entry} entry request
+	 * @returns {void}
+	 */
+	static applyEntryOption(compiler, context, entry) {
+		if (typeof entry === "function") {
+			const DynamicEntryPlugin = require("./DynamicEntryPlugin");
+			new DynamicEntryPlugin(context, entry).apply(compiler);
+		} else {
+			const EntryPlugin = require("./EntryPlugin");
+			for (const name of Object.keys(entry)) {
+				const desc = entry[name];
+				const options = EntryOptionPlugin.entryDescriptionToOptions(
+					compiler,
+					name,
+					desc
+				);
+				for (const entry of desc.import) {
+					new EntryPlugin(context, entry, options).apply(compiler);
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler
+	 * @param {string} name entry name
+	 * @param {EntryDescription} desc entry description
+	 * @returns {EntryOptions} options for the entry
+	 */
+	static entryDescriptionToOptions(compiler, name, desc) {
+		/** @type {EntryOptions} */
+		const options = {
+			name,
+			filename: desc.filename,
+			runtime: desc.runtime,
+			layer: desc.layer,
+			dependOn: desc.dependOn,
+			baseUri: desc.baseUri,
+			publicPath: desc.publicPath,
+			chunkLoading: desc.chunkLoading,
+			asyncChunks: desc.asyncChunks,
+			wasmLoading: desc.wasmLoading,
+			library: desc.library
+		};
+		if (desc.layer !== undefined && !compiler.options.experiments.layers) {
+			throw new Error(
+				"'entryOptions.layer' is only allowed when 'experiments.layers' is enabled"
+			);
+		}
+		if (desc.chunkLoading) {
+			const EnableChunkLoadingPlugin = require("./javascript/EnableChunkLoadingPlugin");
+			EnableChunkLoadingPlugin.checkEnabled(compiler, desc.chunkLoading);
+		}
+		if (desc.wasmLoading) {
+			const EnableWasmLoadingPlugin = require("./wasm/EnableWasmLoadingPlugin");
+			EnableWasmLoadingPlugin.checkEnabled(compiler, desc.wasmLoading);
+		}
+		if (desc.library) {
+			const EnableLibraryPlugin = require("./library/EnableLibraryPlugin");
+			EnableLibraryPlugin.checkEnabled(compiler, desc.library.type);
+		}
+		return options;
+	}
+}
+
+module.exports = EntryOptionPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/EntryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/EntryPlugin.js
new file mode 100644
index 0000000..2e36aea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/EntryPlugin.js
@@ -0,0 +1,67 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const EntryDependency = require("./dependencies/EntryDependency");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Entrypoint").EntryOptions} EntryOptions */
+
+class EntryPlugin {
+	/**
+	 * An entry plugin which will handle
+	 * creation of the EntryDependency
+	 *
+	 * @param {string} context context path
+	 * @param {string} entry entry path
+	 * @param {EntryOptions | string=} options entry options (passing a string is deprecated)
+	 */
+	constructor(context, entry, options) {
+		this.context = context;
+		this.entry = entry;
+		this.options = options || "";
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"EntryPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					EntryDependency,
+					normalModuleFactory
+				);
+			}
+		);
+
+		const { entry, options, context } = this;
+		const dep = EntryPlugin.createDependency(entry, options);
+
+		compiler.hooks.make.tapAsync("EntryPlugin", (compilation, callback) => {
+			compilation.addEntry(context, dep, options, err => {
+				callback(err);
+			});
+		});
+	}
+
+	/**
+	 * @param {string} entry entry request
+	 * @param {EntryOptions | string} options entry options (passing string is deprecated)
+	 * @returns {EntryDependency} the dependency
+	 */
+	static createDependency(entry, options) {
+		const dep = new EntryDependency(entry);
+		// TODO webpack 6 remove string option
+		dep.loc = { name: typeof options === "object" ? options.name : options };
+		return dep;
+	}
+}
+
+module.exports = EntryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Entrypoint.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Entrypoint.js
new file mode 100644
index 0000000..e1ab200
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Entrypoint.js
@@ -0,0 +1,101 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ChunkGroup = require("./ChunkGroup");
+
+/** @typedef {import("../declarations/WebpackOptions").EntryDescriptionNormalized} EntryDescription */
+/** @typedef {import("./Chunk")} Chunk */
+
+/** @typedef {{ name?: string } & Omit<EntryDescription, "import">} EntryOptions */
+
+/**
+ * Entrypoint serves as an encapsulation primitive for chunks that are
+ * a part of a single ChunkGroup. They represent all bundles that need to be loaded for a
+ * single instance of a page. Multi-page application architectures will typically yield multiple Entrypoint objects
+ * inside of the compilation, whereas a Single Page App may only contain one with many lazy-loaded chunks.
+ */
+class Entrypoint extends ChunkGroup {
+	/**
+	 * Creates an instance of Entrypoint.
+	 * @param {EntryOptions | string} entryOptions the options for the entrypoint (or name)
+	 * @param {boolean=} initial false, when the entrypoint is not initial loaded
+	 */
+	constructor(entryOptions, initial = true) {
+		if (typeof entryOptions === "string") {
+			entryOptions = { name: entryOptions };
+		}
+		super({
+			name: entryOptions.name
+		});
+		this.options = entryOptions;
+		/** @type {Chunk=} */
+		this._runtimeChunk = undefined;
+		/** @type {Chunk=} */
+		this._entrypointChunk = undefined;
+		/** @type {boolean} */
+		this._initial = initial;
+	}
+
+	/**
+	 * @returns {boolean} true, when this chunk group will be loaded on initial page load
+	 */
+	isInitial() {
+		return this._initial;
+	}
+
+	/**
+	 * Sets the runtimeChunk for an entrypoint.
+	 * @param {Chunk} chunk the chunk being set as the runtime chunk.
+	 * @returns {void}
+	 */
+	setRuntimeChunk(chunk) {
+		this._runtimeChunk = chunk;
+	}
+
+	/**
+	 * Fetches the chunk reference containing the webpack bootstrap code
+	 * @returns {Chunk | null} returns the runtime chunk or null if there is none
+	 */
+	getRuntimeChunk() {
+		if (this._runtimeChunk) return this._runtimeChunk;
+		for (const parent of this.parentsIterable) {
+			if (parent instanceof Entrypoint) return parent.getRuntimeChunk();
+		}
+		return null;
+	}
+
+	/**
+	 * Sets the chunk with the entrypoint modules for an entrypoint.
+	 * @param {Chunk} chunk the chunk being set as the entrypoint chunk.
+	 * @returns {void}
+	 */
+	setEntrypointChunk(chunk) {
+		this._entrypointChunk = chunk;
+	}
+
+	/**
+	 * Returns the chunk which contains the entrypoint modules
+	 * (or at least the execution of them)
+	 * @returns {Chunk} chunk
+	 */
+	getEntrypointChunk() {
+		return this._entrypointChunk;
+	}
+
+	/**
+	 * @param {Chunk} oldChunk chunk to be replaced
+	 * @param {Chunk} newChunk New chunk that will be replaced with
+	 * @returns {boolean} returns true if the replacement was successful
+	 */
+	replaceChunk(oldChunk, newChunk) {
+		if (this._runtimeChunk === oldChunk) this._runtimeChunk = newChunk;
+		if (this._entrypointChunk === oldChunk) this._entrypointChunk = newChunk;
+		return super.replaceChunk(oldChunk, newChunk);
+	}
+}
+
+module.exports = Entrypoint;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/EnvironmentPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/EnvironmentPlugin.js
new file mode 100644
index 0000000..3a8d9dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/EnvironmentPlugin.js
@@ -0,0 +1,63 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Authors Simen Brekken @simenbrekken, Einar Löve @einarlove
+*/
+
+"use strict";
+
+const DefinePlugin = require("./DefinePlugin");
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./DefinePlugin").CodeValue} CodeValue */
+
+class EnvironmentPlugin {
+	constructor(...keys) {
+		if (keys.length === 1 && Array.isArray(keys[0])) {
+			this.keys = keys[0];
+			this.defaultValues = {};
+		} else if (keys.length === 1 && keys[0] && typeof keys[0] === "object") {
+			this.keys = Object.keys(keys[0]);
+			this.defaultValues = keys[0];
+		} else {
+			this.keys = keys;
+			this.defaultValues = {};
+		}
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		/** @type {Record<string, CodeValue>} */
+		const definitions = {};
+		for (const key of this.keys) {
+			const value =
+				process.env[key] !== undefined
+					? process.env[key]
+					: this.defaultValues[key];
+
+			if (value === undefined) {
+				compiler.hooks.thisCompilation.tap("EnvironmentPlugin", compilation => {
+					const error = new WebpackError(
+						`EnvironmentPlugin - ${key} environment variable is undefined.\n\n` +
+							"You can pass an object with default values to suppress this warning.\n" +
+							"See https://webpack.js.org/plugins/environment-plugin for example."
+					);
+
+					error.name = "EnvVariableNotDefinedError";
+					compilation.errors.push(error);
+				});
+			}
+
+			definitions[`process.env.${key}`] =
+				value === undefined ? "undefined" : JSON.stringify(value);
+		}
+
+		new DefinePlugin(definitions).apply(compiler);
+	}
+}
+
+module.exports = EnvironmentPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ErrorHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ErrorHelpers.js
new file mode 100644
index 0000000..7851bdc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ErrorHelpers.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const loaderFlag = "LOADER_EXECUTION";
+
+const webpackOptionsFlag = "WEBPACK_OPTIONS";
+
+exports.cutOffByFlag = (stack, flag) => {
+	stack = stack.split("\n");
+	for (let i = 0; i < stack.length; i++) {
+		if (stack[i].includes(flag)) {
+			stack.length = i;
+		}
+	}
+	return stack.join("\n");
+};
+
+exports.cutOffLoaderExecution = stack =>
+	exports.cutOffByFlag(stack, loaderFlag);
+
+exports.cutOffWebpackOptions = stack =>
+	exports.cutOffByFlag(stack, webpackOptionsFlag);
+
+exports.cutOffMultilineMessage = (stack, message) => {
+	stack = stack.split("\n");
+	message = message.split("\n");
+
+	const result = [];
+
+	stack.forEach((line, idx) => {
+		if (!line.includes(message[idx])) result.push(line);
+	});
+
+	return result.join("\n");
+};
+
+exports.cutOffMessage = (stack, message) => {
+	const nextLine = stack.indexOf("\n");
+	if (nextLine === -1) {
+		return stack === message ? "" : stack;
+	} else {
+		const firstLine = stack.substr(0, nextLine);
+		return firstLine === message ? stack.substr(nextLine + 1) : stack;
+	}
+};
+
+exports.cleanUp = (stack, message) => {
+	stack = exports.cutOffLoaderExecution(stack);
+	stack = exports.cutOffMessage(stack, message);
+	return stack;
+};
+
+exports.cleanUpWebpackOptions = (stack, message) => {
+	stack = exports.cutOffWebpackOptions(stack);
+	stack = exports.cutOffMultilineMessage(stack, message);
+	return stack;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/EvalDevToolModulePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/EvalDevToolModulePlugin.js
new file mode 100644
index 0000000..b0a47db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/EvalDevToolModulePlugin.js
@@ -0,0 +1,117 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, RawSource } = require("webpack-sources");
+const ExternalModule = require("./ExternalModule");
+const ModuleFilenameHelpers = require("./ModuleFilenameHelpers");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const JavascriptModulesPlugin = require("./javascript/JavascriptModulesPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./Compiler")} Compiler */
+
+/** @type {WeakMap<Source, Source>} */
+const cache = new WeakMap();
+
+const devtoolWarning = new RawSource(`/*
+ * ATTENTION: The "eval" devtool has been used (maybe by default in mode: "development").
+ * This devtool is neither made for production nor for readable output files.
+ * It uses "eval()" calls to create a separate source file in the browser devtools.
+ * If you are trying to read the output file, select a different devtool (https://webpack.js.org/configuration/devtool/)
+ * or disable the default devtool with "devtool: false".
+ * If you are looking for production-ready output files, see mode: "production" (https://webpack.js.org/configuration/mode/).
+ */
+`);
+
+class EvalDevToolModulePlugin {
+	constructor(options) {
+		this.namespace = options.namespace || "";
+		this.sourceUrlComment = options.sourceUrlComment || "\n//# sourceURL=[url]";
+		this.moduleFilenameTemplate =
+			options.moduleFilenameTemplate ||
+			"webpack://[namespace]/[resourcePath]?[loaders]";
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("EvalDevToolModulePlugin", compilation => {
+			const hooks = JavascriptModulesPlugin.getCompilationHooks(compilation);
+			hooks.renderModuleContent.tap(
+				"EvalDevToolModulePlugin",
+				(source, module, { runtimeTemplate, chunkGraph }) => {
+					const cacheEntry = cache.get(source);
+					if (cacheEntry !== undefined) return cacheEntry;
+					if (module instanceof ExternalModule) {
+						cache.set(source, source);
+						return source;
+					}
+					const content = source.source();
+					const str = ModuleFilenameHelpers.createFilename(
+						module,
+						{
+							moduleFilenameTemplate: this.moduleFilenameTemplate,
+							namespace: this.namespace
+						},
+						{
+							requestShortener: runtimeTemplate.requestShortener,
+							chunkGraph,
+							hashFunction: compilation.outputOptions.hashFunction
+						}
+					);
+					const footer =
+						"\n" +
+						this.sourceUrlComment.replace(
+							/\[url\]/g,
+							encodeURI(str)
+								.replace(/%2F/g, "/")
+								.replace(/%20/g, "_")
+								.replace(/%5E/g, "^")
+								.replace(/%5C/g, "\\")
+								.replace(/^\//, "")
+						);
+					const result = new RawSource(
+						`eval(${
+							compilation.outputOptions.trustedTypes
+								? `${RuntimeGlobals.createScript}(${JSON.stringify(
+										content + footer
+								  )})`
+								: JSON.stringify(content + footer)
+						});`
+					);
+					cache.set(source, result);
+					return result;
+				}
+			);
+			hooks.inlineInRuntimeBailout.tap(
+				"EvalDevToolModulePlugin",
+				() => "the eval devtool is used."
+			);
+			hooks.render.tap(
+				"EvalDevToolModulePlugin",
+				source => new ConcatSource(devtoolWarning, source)
+			);
+			hooks.chunkHash.tap("EvalDevToolModulePlugin", (chunk, hash) => {
+				hash.update("EvalDevToolModulePlugin");
+				hash.update("2");
+			});
+			if (compilation.outputOptions.trustedTypes) {
+				compilation.hooks.additionalModuleRuntimeRequirements.tap(
+					"EvalDevToolModulePlugin",
+					(module, set, context) => {
+						set.add(RuntimeGlobals.createScript);
+					}
+				);
+			}
+		});
+	}
+}
+
+module.exports = EvalDevToolModulePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/EvalSourceMapDevToolPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/EvalSourceMapDevToolPlugin.js
new file mode 100644
index 0000000..63129b9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/EvalSourceMapDevToolPlugin.js
@@ -0,0 +1,206 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, RawSource } = require("webpack-sources");
+const ModuleFilenameHelpers = require("./ModuleFilenameHelpers");
+const NormalModule = require("./NormalModule");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const SourceMapDevToolModuleOptionsPlugin = require("./SourceMapDevToolModuleOptionsPlugin");
+const JavascriptModulesPlugin = require("./javascript/JavascriptModulesPlugin");
+const ConcatenatedModule = require("./optimize/ConcatenatedModule");
+const { makePathsAbsolute } = require("./util/identifier");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").DevTool} DevToolOptions */
+/** @typedef {import("../declarations/plugins/SourceMapDevToolPlugin").SourceMapDevToolPluginOptions} SourceMapDevToolPluginOptions */
+/** @typedef {import("./Compiler")} Compiler */
+
+/** @type {WeakMap<Source, Source>} */
+const cache = new WeakMap();
+
+const devtoolWarning = new RawSource(`/*
+ * ATTENTION: An "eval-source-map" devtool has been used.
+ * This devtool is neither made for production nor for readable output files.
+ * It uses "eval()" calls to create a separate source file with attached SourceMaps in the browser devtools.
+ * If you are trying to read the output file, select a different devtool (https://webpack.js.org/configuration/devtool/)
+ * or disable the default devtool with "devtool: false".
+ * If you are looking for production-ready output files, see mode: "production" (https://webpack.js.org/configuration/mode/).
+ */
+`);
+
+class EvalSourceMapDevToolPlugin {
+	/**
+	 * @param {SourceMapDevToolPluginOptions|string} inputOptions Options object
+	 */
+	constructor(inputOptions) {
+		/** @type {SourceMapDevToolPluginOptions} */
+		let options;
+		if (typeof inputOptions === "string") {
+			options = {
+				append: inputOptions
+			};
+		} else {
+			options = inputOptions;
+		}
+		this.sourceMapComment =
+			options.append || "//# sourceURL=[module]\n//# sourceMappingURL=[url]";
+		this.moduleFilenameTemplate =
+			options.moduleFilenameTemplate ||
+			"webpack://[namespace]/[resource-path]?[hash]";
+		this.namespace = options.namespace || "";
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		compiler.hooks.compilation.tap(
+			"EvalSourceMapDevToolPlugin",
+			compilation => {
+				const hooks = JavascriptModulesPlugin.getCompilationHooks(compilation);
+				new SourceMapDevToolModuleOptionsPlugin(options).apply(compilation);
+				const matchModule = ModuleFilenameHelpers.matchObject.bind(
+					ModuleFilenameHelpers,
+					options
+				);
+				hooks.renderModuleContent.tap(
+					"EvalSourceMapDevToolPlugin",
+					(source, m, { runtimeTemplate, chunkGraph }) => {
+						const cachedSource = cache.get(source);
+						if (cachedSource !== undefined) {
+							return cachedSource;
+						}
+
+						const result = r => {
+							cache.set(source, r);
+							return r;
+						};
+
+						if (m instanceof NormalModule) {
+							const module = /** @type {NormalModule} */ (m);
+							if (!matchModule(module.resource)) {
+								return result(source);
+							}
+						} else if (m instanceof ConcatenatedModule) {
+							const concatModule = /** @type {ConcatenatedModule} */ (m);
+							if (concatModule.rootModule instanceof NormalModule) {
+								const module = /** @type {NormalModule} */ (
+									concatModule.rootModule
+								);
+								if (!matchModule(module.resource)) {
+									return result(source);
+								}
+							} else {
+								return result(source);
+							}
+						} else {
+							return result(source);
+						}
+
+						/** @type {{ [key: string]: TODO; }} */
+						let sourceMap;
+						let content;
+						if (source.sourceAndMap) {
+							const sourceAndMap = source.sourceAndMap(options);
+							sourceMap = sourceAndMap.map;
+							content = sourceAndMap.source;
+						} else {
+							sourceMap = source.map(options);
+							content = source.source();
+						}
+						if (!sourceMap) {
+							return result(source);
+						}
+
+						// Clone (flat) the sourcemap to ensure that the mutations below do not persist.
+						sourceMap = { ...sourceMap };
+						const context = compiler.options.context;
+						const root = compiler.root;
+						const modules = sourceMap.sources.map(source => {
+							if (!source.startsWith("webpack://")) return source;
+							source = makePathsAbsolute(context, source.slice(10), root);
+							const module = compilation.findModule(source);
+							return module || source;
+						});
+						let moduleFilenames = modules.map(module => {
+							return ModuleFilenameHelpers.createFilename(
+								module,
+								{
+									moduleFilenameTemplate: this.moduleFilenameTemplate,
+									namespace: this.namespace
+								},
+								{
+									requestShortener: runtimeTemplate.requestShortener,
+									chunkGraph,
+									hashFunction: compilation.outputOptions.hashFunction
+								}
+							);
+						});
+						moduleFilenames = ModuleFilenameHelpers.replaceDuplicates(
+							moduleFilenames,
+							(filename, i, n) => {
+								for (let j = 0; j < n; j++) filename += "*";
+								return filename;
+							}
+						);
+						sourceMap.sources = moduleFilenames;
+						sourceMap.sourceRoot = options.sourceRoot || "";
+						const moduleId = chunkGraph.getModuleId(m);
+						sourceMap.file = `${moduleId}.js`;
+
+						const footer =
+							this.sourceMapComment.replace(
+								/\[url\]/g,
+								`data:application/json;charset=utf-8;base64,${Buffer.from(
+									JSON.stringify(sourceMap),
+									"utf8"
+								).toString("base64")}`
+							) + `\n//# sourceURL=webpack-internal:///${moduleId}\n`; // workaround for chrome bug
+
+						return result(
+							new RawSource(
+								`eval(${
+									compilation.outputOptions.trustedTypes
+										? `${RuntimeGlobals.createScript}(${JSON.stringify(
+												content + footer
+										  )})`
+										: JSON.stringify(content + footer)
+								});`
+							)
+						);
+					}
+				);
+				hooks.inlineInRuntimeBailout.tap(
+					"EvalDevToolModulePlugin",
+					() => "the eval-source-map devtool is used."
+				);
+				hooks.render.tap(
+					"EvalSourceMapDevToolPlugin",
+					source => new ConcatSource(devtoolWarning, source)
+				);
+				hooks.chunkHash.tap("EvalSourceMapDevToolPlugin", (chunk, hash) => {
+					hash.update("EvalSourceMapDevToolPlugin");
+					hash.update("2");
+				});
+				if (compilation.outputOptions.trustedTypes) {
+					compilation.hooks.additionalModuleRuntimeRequirements.tap(
+						"EvalSourceMapDevToolPlugin",
+						(module, set, context) => {
+							set.add(RuntimeGlobals.createScript);
+						}
+					);
+				}
+			}
+		);
+	}
+}
+
+module.exports = EvalSourceMapDevToolPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ExportsInfo.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ExportsInfo.js
new file mode 100644
index 0000000..39511f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ExportsInfo.js
@@ -0,0 +1,1523 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { equals } = require("./util/ArrayHelpers");
+const SortableSet = require("./util/SortableSet");
+const makeSerializable = require("./util/makeSerializable");
+const { forEachRuntime } = require("./util/runtime");
+
+/** @typedef {import("./Dependency").RuntimeSpec} RuntimeSpec */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("./util/Hash")} Hash */
+
+/** @typedef {typeof UsageState.OnlyPropertiesUsed | typeof UsageState.NoInfo | typeof UsageState.Unknown | typeof UsageState.Used} RuntimeUsageStateType */
+/** @typedef {typeof UsageState.Unused | RuntimeUsageStateType} UsageStateType */
+
+const UsageState = Object.freeze({
+	Unused: /** @type {0} */ (0),
+	OnlyPropertiesUsed: /** @type {1} */ (1),
+	NoInfo: /** @type {2} */ (2),
+	Unknown: /** @type {3} */ (3),
+	Used: /** @type {4} */ (4)
+});
+
+const RETURNS_TRUE = () => true;
+
+const CIRCULAR = Symbol("circular target");
+
+class RestoreProvidedData {
+	constructor(
+		exports,
+		otherProvided,
+		otherCanMangleProvide,
+		otherTerminalBinding
+	) {
+		this.exports = exports;
+		this.otherProvided = otherProvided;
+		this.otherCanMangleProvide = otherCanMangleProvide;
+		this.otherTerminalBinding = otherTerminalBinding;
+	}
+
+	serialize({ write }) {
+		write(this.exports);
+		write(this.otherProvided);
+		write(this.otherCanMangleProvide);
+		write(this.otherTerminalBinding);
+	}
+
+	static deserialize({ read }) {
+		return new RestoreProvidedData(read(), read(), read(), read());
+	}
+}
+
+makeSerializable(
+	RestoreProvidedData,
+	"webpack/lib/ModuleGraph",
+	"RestoreProvidedData"
+);
+
+class ExportsInfo {
+	constructor() {
+		/** @type {Map<string, ExportInfo>} */
+		this._exports = new Map();
+		this._otherExportsInfo = new ExportInfo(null);
+		this._sideEffectsOnlyInfo = new ExportInfo("*side effects only*");
+		this._exportsAreOrdered = false;
+		/** @type {ExportsInfo=} */
+		this._redirectTo = undefined;
+	}
+
+	/**
+	 * @returns {Iterable<ExportInfo>} all owned exports in any order
+	 */
+	get ownedExports() {
+		return this._exports.values();
+	}
+
+	/**
+	 * @returns {Iterable<ExportInfo>} all owned exports in order
+	 */
+	get orderedOwnedExports() {
+		if (!this._exportsAreOrdered) {
+			this._sortExports();
+		}
+		return this._exports.values();
+	}
+
+	/**
+	 * @returns {Iterable<ExportInfo>} all exports in any order
+	 */
+	get exports() {
+		if (this._redirectTo !== undefined) {
+			const map = new Map(this._redirectTo._exports);
+			for (const [key, value] of this._exports) {
+				map.set(key, value);
+			}
+			return map.values();
+		}
+		return this._exports.values();
+	}
+
+	/**
+	 * @returns {Iterable<ExportInfo>} all exports in order
+	 */
+	get orderedExports() {
+		if (!this._exportsAreOrdered) {
+			this._sortExports();
+		}
+		if (this._redirectTo !== undefined) {
+			const map = new Map(
+				Array.from(this._redirectTo.orderedExports, item => [item.name, item])
+			);
+			for (const [key, value] of this._exports) {
+				map.set(key, value);
+			}
+			// sorting should be pretty fast as map contains
+			// a lot of presorted items
+			this._sortExportsMap(map);
+			return map.values();
+		}
+		return this._exports.values();
+	}
+
+	/**
+	 * @returns {ExportInfo} the export info of unlisted exports
+	 */
+	get otherExportsInfo() {
+		if (this._redirectTo !== undefined)
+			return this._redirectTo.otherExportsInfo;
+		return this._otherExportsInfo;
+	}
+
+	_sortExportsMap(exports) {
+		if (exports.size > 1) {
+			const namesInOrder = [];
+			for (const entry of exports.values()) {
+				namesInOrder.push(entry.name);
+			}
+			namesInOrder.sort();
+			let i = 0;
+			for (const entry of exports.values()) {
+				const name = namesInOrder[i];
+				if (entry.name !== name) break;
+				i++;
+			}
+			for (; i < namesInOrder.length; i++) {
+				const name = namesInOrder[i];
+				const correctEntry = exports.get(name);
+				exports.delete(name);
+				exports.set(name, correctEntry);
+			}
+		}
+	}
+
+	_sortExports() {
+		this._sortExportsMap(this._exports);
+		this._exportsAreOrdered = true;
+	}
+
+	setRedirectNamedTo(exportsInfo) {
+		if (this._redirectTo === exportsInfo) return false;
+		this._redirectTo = exportsInfo;
+		return true;
+	}
+
+	setHasProvideInfo() {
+		for (const exportInfo of this._exports.values()) {
+			if (exportInfo.provided === undefined) {
+				exportInfo.provided = false;
+			}
+			if (exportInfo.canMangleProvide === undefined) {
+				exportInfo.canMangleProvide = true;
+			}
+		}
+		if (this._redirectTo !== undefined) {
+			this._redirectTo.setHasProvideInfo();
+		} else {
+			if (this._otherExportsInfo.provided === undefined) {
+				this._otherExportsInfo.provided = false;
+			}
+			if (this._otherExportsInfo.canMangleProvide === undefined) {
+				this._otherExportsInfo.canMangleProvide = true;
+			}
+		}
+	}
+
+	setHasUseInfo() {
+		for (const exportInfo of this._exports.values()) {
+			exportInfo.setHasUseInfo();
+		}
+		this._sideEffectsOnlyInfo.setHasUseInfo();
+		if (this._redirectTo !== undefined) {
+			this._redirectTo.setHasUseInfo();
+		} else {
+			this._otherExportsInfo.setHasUseInfo();
+			if (this._otherExportsInfo.canMangleUse === undefined) {
+				this._otherExportsInfo.canMangleUse = true;
+			}
+		}
+	}
+
+	/**
+	 * @param {string} name export name
+	 * @returns {ExportInfo} export info for this name
+	 */
+	getOwnExportInfo(name) {
+		const info = this._exports.get(name);
+		if (info !== undefined) return info;
+		const newInfo = new ExportInfo(name, this._otherExportsInfo);
+		this._exports.set(name, newInfo);
+		this._exportsAreOrdered = false;
+		return newInfo;
+	}
+
+	/**
+	 * @param {string} name export name
+	 * @returns {ExportInfo} export info for this name
+	 */
+	getExportInfo(name) {
+		const info = this._exports.get(name);
+		if (info !== undefined) return info;
+		if (this._redirectTo !== undefined)
+			return this._redirectTo.getExportInfo(name);
+		const newInfo = new ExportInfo(name, this._otherExportsInfo);
+		this._exports.set(name, newInfo);
+		this._exportsAreOrdered = false;
+		return newInfo;
+	}
+
+	/**
+	 * @param {string} name export name
+	 * @returns {ExportInfo} export info for this name
+	 */
+	getReadOnlyExportInfo(name) {
+		const info = this._exports.get(name);
+		if (info !== undefined) return info;
+		if (this._redirectTo !== undefined)
+			return this._redirectTo.getReadOnlyExportInfo(name);
+		return this._otherExportsInfo;
+	}
+
+	/**
+	 * @param {string[]} name export name
+	 * @returns {ExportInfo | undefined} export info for this name
+	 */
+	getReadOnlyExportInfoRecursive(name) {
+		const exportInfo = this.getReadOnlyExportInfo(name[0]);
+		if (name.length === 1) return exportInfo;
+		if (!exportInfo.exportsInfo) return undefined;
+		return exportInfo.exportsInfo.getReadOnlyExportInfoRecursive(name.slice(1));
+	}
+
+	/**
+	 * @param {string[]=} name the export name
+	 * @returns {ExportsInfo | undefined} the nested exports info
+	 */
+	getNestedExportsInfo(name) {
+		if (Array.isArray(name) && name.length > 0) {
+			const info = this.getReadOnlyExportInfo(name[0]);
+			if (!info.exportsInfo) return undefined;
+			return info.exportsInfo.getNestedExportsInfo(name.slice(1));
+		}
+		return this;
+	}
+
+	/**
+	 * @param {boolean=} canMangle true, if exports can still be mangled (defaults to false)
+	 * @param {Set<string>=} excludeExports list of unaffected exports
+	 * @param {any=} targetKey use this as key for the target
+	 * @param {ModuleGraphConnection=} targetModule set this module as target
+	 * @param {number=} priority priority
+	 * @returns {boolean} true, if this call changed something
+	 */
+	setUnknownExportsProvided(
+		canMangle,
+		excludeExports,
+		targetKey,
+		targetModule,
+		priority
+	) {
+		let changed = false;
+		if (excludeExports) {
+			for (const name of excludeExports) {
+				// Make sure these entries exist, so they can get different info
+				this.getExportInfo(name);
+			}
+		}
+		for (const exportInfo of this._exports.values()) {
+			if (!canMangle && exportInfo.canMangleProvide !== false) {
+				exportInfo.canMangleProvide = false;
+				changed = true;
+			}
+			if (excludeExports && excludeExports.has(exportInfo.name)) continue;
+			if (exportInfo.provided !== true && exportInfo.provided !== null) {
+				exportInfo.provided = null;
+				changed = true;
+			}
+			if (targetKey) {
+				exportInfo.setTarget(targetKey, targetModule, [exportInfo.name], -1);
+			}
+		}
+		if (this._redirectTo !== undefined) {
+			if (
+				this._redirectTo.setUnknownExportsProvided(
+					canMangle,
+					excludeExports,
+					targetKey,
+					targetModule,
+					priority
+				)
+			) {
+				changed = true;
+			}
+		} else {
+			if (
+				this._otherExportsInfo.provided !== true &&
+				this._otherExportsInfo.provided !== null
+			) {
+				this._otherExportsInfo.provided = null;
+				changed = true;
+			}
+			if (!canMangle && this._otherExportsInfo.canMangleProvide !== false) {
+				this._otherExportsInfo.canMangleProvide = false;
+				changed = true;
+			}
+			if (targetKey) {
+				this._otherExportsInfo.setTarget(
+					targetKey,
+					targetModule,
+					undefined,
+					priority
+				);
+			}
+		}
+		return changed;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, when something changed
+	 */
+	setUsedInUnknownWay(runtime) {
+		let changed = false;
+		for (const exportInfo of this._exports.values()) {
+			if (exportInfo.setUsedInUnknownWay(runtime)) {
+				changed = true;
+			}
+		}
+		if (this._redirectTo !== undefined) {
+			if (this._redirectTo.setUsedInUnknownWay(runtime)) {
+				changed = true;
+			}
+		} else {
+			if (
+				this._otherExportsInfo.setUsedConditionally(
+					used => used < UsageState.Unknown,
+					UsageState.Unknown,
+					runtime
+				)
+			) {
+				changed = true;
+			}
+			if (this._otherExportsInfo.canMangleUse !== false) {
+				this._otherExportsInfo.canMangleUse = false;
+				changed = true;
+			}
+		}
+		return changed;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, when something changed
+	 */
+	setUsedWithoutInfo(runtime) {
+		let changed = false;
+		for (const exportInfo of this._exports.values()) {
+			if (exportInfo.setUsedWithoutInfo(runtime)) {
+				changed = true;
+			}
+		}
+		if (this._redirectTo !== undefined) {
+			if (this._redirectTo.setUsedWithoutInfo(runtime)) {
+				changed = true;
+			}
+		} else {
+			if (this._otherExportsInfo.setUsed(UsageState.NoInfo, runtime)) {
+				changed = true;
+			}
+			if (this._otherExportsInfo.canMangleUse !== false) {
+				this._otherExportsInfo.canMangleUse = false;
+				changed = true;
+			}
+		}
+		return changed;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, when something changed
+	 */
+	setAllKnownExportsUsed(runtime) {
+		let changed = false;
+		for (const exportInfo of this._exports.values()) {
+			if (!exportInfo.provided) continue;
+			if (exportInfo.setUsed(UsageState.Used, runtime)) {
+				changed = true;
+			}
+		}
+		return changed;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, when something changed
+	 */
+	setUsedForSideEffectsOnly(runtime) {
+		return this._sideEffectsOnlyInfo.setUsedConditionally(
+			used => used === UsageState.Unused,
+			UsageState.Used,
+			runtime
+		);
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, when the module exports are used in any way
+	 */
+	isUsed(runtime) {
+		if (this._redirectTo !== undefined) {
+			if (this._redirectTo.isUsed(runtime)) {
+				return true;
+			}
+		} else {
+			if (this._otherExportsInfo.getUsed(runtime) !== UsageState.Unused) {
+				return true;
+			}
+		}
+		for (const exportInfo of this._exports.values()) {
+			if (exportInfo.getUsed(runtime) !== UsageState.Unused) {
+				return true;
+			}
+		}
+		return false;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, when the module is used in any way
+	 */
+	isModuleUsed(runtime) {
+		if (this.isUsed(runtime)) return true;
+		if (this._sideEffectsOnlyInfo.getUsed(runtime) !== UsageState.Unused)
+			return true;
+		return false;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {SortableSet<string> | boolean | null} set of used exports, or true (when namespace object is used), or false (when unused), or null (when unknown)
+	 */
+	getUsedExports(runtime) {
+		if (!this._redirectTo !== undefined) {
+			switch (this._otherExportsInfo.getUsed(runtime)) {
+				case UsageState.NoInfo:
+					return null;
+				case UsageState.Unknown:
+				case UsageState.OnlyPropertiesUsed:
+				case UsageState.Used:
+					return true;
+			}
+		}
+		const array = [];
+		if (!this._exportsAreOrdered) this._sortExports();
+		for (const exportInfo of this._exports.values()) {
+			switch (exportInfo.getUsed(runtime)) {
+				case UsageState.NoInfo:
+					return null;
+				case UsageState.Unknown:
+					return true;
+				case UsageState.OnlyPropertiesUsed:
+				case UsageState.Used:
+					array.push(exportInfo.name);
+			}
+		}
+		if (this._redirectTo !== undefined) {
+			const inner = this._redirectTo.getUsedExports(runtime);
+			if (inner === null) return null;
+			if (inner === true) return true;
+			if (inner !== false) {
+				for (const item of inner) {
+					array.push(item);
+				}
+			}
+		}
+		if (array.length === 0) {
+			switch (this._sideEffectsOnlyInfo.getUsed(runtime)) {
+				case UsageState.NoInfo:
+					return null;
+				case UsageState.Unused:
+					return false;
+			}
+		}
+		return new SortableSet(array);
+	}
+
+	/**
+	 * @returns {null | true | string[]} list of exports when known
+	 */
+	getProvidedExports() {
+		if (!this._redirectTo !== undefined) {
+			switch (this._otherExportsInfo.provided) {
+				case undefined:
+					return null;
+				case null:
+					return true;
+				case true:
+					return true;
+			}
+		}
+		const array = [];
+		if (!this._exportsAreOrdered) this._sortExports();
+		for (const exportInfo of this._exports.values()) {
+			switch (exportInfo.provided) {
+				case undefined:
+					return null;
+				case null:
+					return true;
+				case true:
+					array.push(exportInfo.name);
+			}
+		}
+		if (this._redirectTo !== undefined) {
+			const inner = this._redirectTo.getProvidedExports();
+			if (inner === null) return null;
+			if (inner === true) return true;
+			for (const item of inner) {
+				if (!array.includes(item)) {
+					array.push(item);
+				}
+			}
+		}
+		return array;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {ExportInfo[]} exports that are relevant (not unused and potential provided)
+	 */
+	getRelevantExports(runtime) {
+		const list = [];
+		for (const exportInfo of this._exports.values()) {
+			const used = exportInfo.getUsed(runtime);
+			if (used === UsageState.Unused) continue;
+			if (exportInfo.provided === false) continue;
+			list.push(exportInfo);
+		}
+		if (this._redirectTo !== undefined) {
+			for (const exportInfo of this._redirectTo.getRelevantExports(runtime)) {
+				if (!this._exports.has(exportInfo.name)) list.push(exportInfo);
+			}
+		}
+		if (
+			this._otherExportsInfo.provided !== false &&
+			this._otherExportsInfo.getUsed(runtime) !== UsageState.Unused
+		) {
+			list.push(this._otherExportsInfo);
+		}
+		return list;
+	}
+
+	/**
+	 * @param {string | string[]} name the name of the export
+	 * @returns {boolean | undefined | null} if the export is provided
+	 */
+	isExportProvided(name) {
+		if (Array.isArray(name)) {
+			const info = this.getReadOnlyExportInfo(name[0]);
+			if (info.exportsInfo && name.length > 1) {
+				return info.exportsInfo.isExportProvided(name.slice(1));
+			}
+			return info.provided;
+		}
+		const info = this.getReadOnlyExportInfo(name);
+		return info.provided;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime runtime
+	 * @returns {string} key representing the usage
+	 */
+	getUsageKey(runtime) {
+		const key = [];
+		if (this._redirectTo !== undefined) {
+			key.push(this._redirectTo.getUsageKey(runtime));
+		} else {
+			key.push(this._otherExportsInfo.getUsed(runtime));
+		}
+		key.push(this._sideEffectsOnlyInfo.getUsed(runtime));
+		for (const exportInfo of this.orderedOwnedExports) {
+			key.push(exportInfo.getUsed(runtime));
+		}
+		return key.join("|");
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtimeA first runtime
+	 * @param {RuntimeSpec} runtimeB second runtime
+	 * @returns {boolean} true, when equally used
+	 */
+	isEquallyUsed(runtimeA, runtimeB) {
+		if (this._redirectTo !== undefined) {
+			if (!this._redirectTo.isEquallyUsed(runtimeA, runtimeB)) return false;
+		} else {
+			if (
+				this._otherExportsInfo.getUsed(runtimeA) !==
+				this._otherExportsInfo.getUsed(runtimeB)
+			) {
+				return false;
+			}
+		}
+		if (
+			this._sideEffectsOnlyInfo.getUsed(runtimeA) !==
+			this._sideEffectsOnlyInfo.getUsed(runtimeB)
+		) {
+			return false;
+		}
+		for (const exportInfo of this.ownedExports) {
+			if (exportInfo.getUsed(runtimeA) !== exportInfo.getUsed(runtimeB))
+				return false;
+		}
+		return true;
+	}
+
+	/**
+	 * @param {string | string[]} name export name
+	 * @param {RuntimeSpec} runtime check usage for this runtime only
+	 * @returns {UsageStateType} usage status
+	 */
+	getUsed(name, runtime) {
+		if (Array.isArray(name)) {
+			if (name.length === 0) return this.otherExportsInfo.getUsed(runtime);
+			let info = this.getReadOnlyExportInfo(name[0]);
+			if (info.exportsInfo && name.length > 1) {
+				return info.exportsInfo.getUsed(name.slice(1), runtime);
+			}
+			return info.getUsed(runtime);
+		}
+		let info = this.getReadOnlyExportInfo(name);
+		return info.getUsed(runtime);
+	}
+
+	/**
+	 * @param {string | string[]} name the export name
+	 * @param {RuntimeSpec} runtime check usage for this runtime only
+	 * @returns {string | string[] | false} the used name
+	 */
+	getUsedName(name, runtime) {
+		if (Array.isArray(name)) {
+			// TODO improve this
+			if (name.length === 0) {
+				if (!this.isUsed(runtime)) return false;
+				return name;
+			}
+			let info = this.getReadOnlyExportInfo(name[0]);
+			const x = info.getUsedName(name[0], runtime);
+			if (x === false) return false;
+			const arr = x === name[0] && name.length === 1 ? name : [x];
+			if (name.length === 1) {
+				return arr;
+			}
+			if (
+				info.exportsInfo &&
+				info.getUsed(runtime) === UsageState.OnlyPropertiesUsed
+			) {
+				const nested = info.exportsInfo.getUsedName(name.slice(1), runtime);
+				if (!nested) return false;
+				return arr.concat(nested);
+			} else {
+				return arr.concat(name.slice(1));
+			}
+		} else {
+			let info = this.getReadOnlyExportInfo(name);
+			const usedName = info.getUsedName(name, runtime);
+			return usedName;
+		}
+	}
+
+	/**
+	 * @param {Hash} hash the hash
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {void}
+	 */
+	updateHash(hash, runtime) {
+		this._updateHash(hash, runtime, new Set());
+	}
+
+	/**
+	 * @param {Hash} hash the hash
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {Set<ExportsInfo>} alreadyVisitedExportsInfo for circular references
+	 * @returns {void}
+	 */
+	_updateHash(hash, runtime, alreadyVisitedExportsInfo) {
+		const set = new Set(alreadyVisitedExportsInfo);
+		set.add(this);
+		for (const exportInfo of this.orderedExports) {
+			if (exportInfo.hasInfo(this._otherExportsInfo, runtime)) {
+				exportInfo._updateHash(hash, runtime, set);
+			}
+		}
+		this._sideEffectsOnlyInfo._updateHash(hash, runtime, set);
+		this._otherExportsInfo._updateHash(hash, runtime, set);
+		if (this._redirectTo !== undefined) {
+			this._redirectTo._updateHash(hash, runtime, set);
+		}
+	}
+
+	getRestoreProvidedData() {
+		const otherProvided = this._otherExportsInfo.provided;
+		const otherCanMangleProvide = this._otherExportsInfo.canMangleProvide;
+		const otherTerminalBinding = this._otherExportsInfo.terminalBinding;
+		const exports = [];
+		for (const exportInfo of this.orderedExports) {
+			if (
+				exportInfo.provided !== otherProvided ||
+				exportInfo.canMangleProvide !== otherCanMangleProvide ||
+				exportInfo.terminalBinding !== otherTerminalBinding ||
+				exportInfo.exportsInfoOwned
+			) {
+				exports.push({
+					name: exportInfo.name,
+					provided: exportInfo.provided,
+					canMangleProvide: exportInfo.canMangleProvide,
+					terminalBinding: exportInfo.terminalBinding,
+					exportsInfo: exportInfo.exportsInfoOwned
+						? exportInfo.exportsInfo.getRestoreProvidedData()
+						: undefined
+				});
+			}
+		}
+		return new RestoreProvidedData(
+			exports,
+			otherProvided,
+			otherCanMangleProvide,
+			otherTerminalBinding
+		);
+	}
+
+	restoreProvided({
+		otherProvided,
+		otherCanMangleProvide,
+		otherTerminalBinding,
+		exports
+	}) {
+		let wasEmpty = true;
+		for (const exportInfo of this._exports.values()) {
+			wasEmpty = false;
+			exportInfo.provided = otherProvided;
+			exportInfo.canMangleProvide = otherCanMangleProvide;
+			exportInfo.terminalBinding = otherTerminalBinding;
+		}
+		this._otherExportsInfo.provided = otherProvided;
+		this._otherExportsInfo.canMangleProvide = otherCanMangleProvide;
+		this._otherExportsInfo.terminalBinding = otherTerminalBinding;
+		for (const exp of exports) {
+			const exportInfo = this.getExportInfo(exp.name);
+			exportInfo.provided = exp.provided;
+			exportInfo.canMangleProvide = exp.canMangleProvide;
+			exportInfo.terminalBinding = exp.terminalBinding;
+			if (exp.exportsInfo) {
+				const exportsInfo = exportInfo.createNestedExportsInfo();
+				exportsInfo.restoreProvided(exp.exportsInfo);
+			}
+		}
+		if (wasEmpty) this._exportsAreOrdered = true;
+	}
+}
+
+class ExportInfo {
+	/**
+	 * @param {string} name the original name of the export
+	 * @param {ExportInfo=} initFrom init values from this ExportInfo
+	 */
+	constructor(name, initFrom) {
+		/** @type {string} */
+		this.name = name;
+		/** @private @type {string | null} */
+		this._usedName = initFrom ? initFrom._usedName : null;
+		/** @private @type {UsageStateType} */
+		this._globalUsed = initFrom ? initFrom._globalUsed : undefined;
+		/** @private @type {Map<string, RuntimeUsageStateType>} */
+		this._usedInRuntime =
+			initFrom && initFrom._usedInRuntime
+				? new Map(initFrom._usedInRuntime)
+				: undefined;
+		/** @private @type {boolean} */
+		this._hasUseInRuntimeInfo = initFrom
+			? initFrom._hasUseInRuntimeInfo
+			: false;
+		/**
+		 * true: it is provided
+		 * false: it is not provided
+		 * null: only the runtime knows if it is provided
+		 * undefined: it was not determined if it is provided
+		 * @type {boolean | null | undefined}
+		 */
+		this.provided = initFrom ? initFrom.provided : undefined;
+		/**
+		 * is the export a terminal binding that should be checked for export star conflicts
+		 * @type {boolean}
+		 */
+		this.terminalBinding = initFrom ? initFrom.terminalBinding : false;
+		/**
+		 * true: it can be mangled
+		 * false: is can not be mangled
+		 * undefined: it was not determined if it can be mangled
+		 * @type {boolean | undefined}
+		 */
+		this.canMangleProvide = initFrom ? initFrom.canMangleProvide : undefined;
+		/**
+		 * true: it can be mangled
+		 * false: is can not be mangled
+		 * undefined: it was not determined if it can be mangled
+		 * @type {boolean | undefined}
+		 */
+		this.canMangleUse = initFrom ? initFrom.canMangleUse : undefined;
+		/** @type {boolean} */
+		this.exportsInfoOwned = false;
+		/** @type {ExportsInfo=} */
+		this.exportsInfo = undefined;
+		/** @type {Map<any, { connection: ModuleGraphConnection | null, export: string[], priority: number }>=} */
+		this._target = undefined;
+		if (initFrom && initFrom._target) {
+			this._target = new Map();
+			for (const [key, value] of initFrom._target) {
+				this._target.set(key, {
+					connection: value.connection,
+					export: value.export || [name],
+					priority: value.priority
+				});
+			}
+		}
+		/** @type {Map<any, { connection: ModuleGraphConnection | null, export: string[], priority: number }>=} */
+		this._maxTarget = undefined;
+	}
+
+	// TODO webpack 5 remove
+	/** @private */
+	get used() {
+		throw new Error("REMOVED");
+	}
+	/** @private */
+	get usedName() {
+		throw new Error("REMOVED");
+	}
+	/**
+	 * @private
+	 * @param {*} v v
+	 */
+	set used(v) {
+		throw new Error("REMOVED");
+	}
+	/**
+	 * @private
+	 * @param {*} v v
+	 */
+	set usedName(v) {
+		throw new Error("REMOVED");
+	}
+
+	get canMangle() {
+		switch (this.canMangleProvide) {
+			case undefined:
+				return this.canMangleUse === false ? false : undefined;
+			case false:
+				return false;
+			case true:
+				switch (this.canMangleUse) {
+					case undefined:
+						return undefined;
+					case false:
+						return false;
+					case true:
+						return true;
+				}
+		}
+		throw new Error(
+			`Unexpected flags for canMangle ${this.canMangleProvide} ${this.canMangleUse}`
+		);
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime only apply to this runtime
+	 * @returns {boolean} true, when something changed
+	 */
+	setUsedInUnknownWay(runtime) {
+		let changed = false;
+		if (
+			this.setUsedConditionally(
+				used => used < UsageState.Unknown,
+				UsageState.Unknown,
+				runtime
+			)
+		) {
+			changed = true;
+		}
+		if (this.canMangleUse !== false) {
+			this.canMangleUse = false;
+			changed = true;
+		}
+		return changed;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime only apply to this runtime
+	 * @returns {boolean} true, when something changed
+	 */
+	setUsedWithoutInfo(runtime) {
+		let changed = false;
+		if (this.setUsed(UsageState.NoInfo, runtime)) {
+			changed = true;
+		}
+		if (this.canMangleUse !== false) {
+			this.canMangleUse = false;
+			changed = true;
+		}
+		return changed;
+	}
+
+	setHasUseInfo() {
+		if (!this._hasUseInRuntimeInfo) {
+			this._hasUseInRuntimeInfo = true;
+		}
+		if (this.canMangleUse === undefined) {
+			this.canMangleUse = true;
+		}
+		if (this.exportsInfoOwned) {
+			this.exportsInfo.setHasUseInfo();
+		}
+	}
+
+	/**
+	 * @param {function(UsageStateType): boolean} condition compare with old value
+	 * @param {UsageStateType} newValue set when condition is true
+	 * @param {RuntimeSpec} runtime only apply to this runtime
+	 * @returns {boolean} true when something has changed
+	 */
+	setUsedConditionally(condition, newValue, runtime) {
+		if (runtime === undefined) {
+			if (this._globalUsed === undefined) {
+				this._globalUsed = newValue;
+				return true;
+			} else {
+				if (this._globalUsed !== newValue && condition(this._globalUsed)) {
+					this._globalUsed = newValue;
+					return true;
+				}
+			}
+		} else if (this._usedInRuntime === undefined) {
+			if (newValue !== UsageState.Unused && condition(UsageState.Unused)) {
+				this._usedInRuntime = new Map();
+				forEachRuntime(runtime, runtime =>
+					this._usedInRuntime.set(runtime, newValue)
+				);
+				return true;
+			}
+		} else {
+			let changed = false;
+			forEachRuntime(runtime, runtime => {
+				/** @type {UsageStateType} */
+				let oldValue = this._usedInRuntime.get(runtime);
+				if (oldValue === undefined) oldValue = UsageState.Unused;
+				if (newValue !== oldValue && condition(oldValue)) {
+					if (newValue === UsageState.Unused) {
+						this._usedInRuntime.delete(runtime);
+					} else {
+						this._usedInRuntime.set(runtime, newValue);
+					}
+					changed = true;
+				}
+			});
+			if (changed) {
+				if (this._usedInRuntime.size === 0) this._usedInRuntime = undefined;
+				return true;
+			}
+		}
+		return false;
+	}
+
+	/**
+	 * @param {UsageStateType} newValue new value of the used state
+	 * @param {RuntimeSpec} runtime only apply to this runtime
+	 * @returns {boolean} true when something has changed
+	 */
+	setUsed(newValue, runtime) {
+		if (runtime === undefined) {
+			if (this._globalUsed !== newValue) {
+				this._globalUsed = newValue;
+				return true;
+			}
+		} else if (this._usedInRuntime === undefined) {
+			if (newValue !== UsageState.Unused) {
+				this._usedInRuntime = new Map();
+				forEachRuntime(runtime, runtime =>
+					this._usedInRuntime.set(runtime, newValue)
+				);
+				return true;
+			}
+		} else {
+			let changed = false;
+			forEachRuntime(runtime, runtime => {
+				/** @type {UsageStateType} */
+				let oldValue = this._usedInRuntime.get(runtime);
+				if (oldValue === undefined) oldValue = UsageState.Unused;
+				if (newValue !== oldValue) {
+					if (newValue === UsageState.Unused) {
+						this._usedInRuntime.delete(runtime);
+					} else {
+						this._usedInRuntime.set(runtime, newValue);
+					}
+					changed = true;
+				}
+			});
+			if (changed) {
+				if (this._usedInRuntime.size === 0) this._usedInRuntime = undefined;
+				return true;
+			}
+		}
+		return false;
+	}
+
+	/**
+	 * @param {any} key the key
+	 * @returns {boolean} true, if something has changed
+	 */
+	unsetTarget(key) {
+		if (!this._target) return false;
+		if (this._target.delete(key)) {
+			this._maxTarget = undefined;
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {any} key the key
+	 * @param {ModuleGraphConnection} connection the target module if a single one
+	 * @param {string[]=} exportName the exported name
+	 * @param {number=} priority priority
+	 * @returns {boolean} true, if something has changed
+	 */
+	setTarget(key, connection, exportName, priority = 0) {
+		if (exportName) exportName = [...exportName];
+		if (!this._target) {
+			this._target = new Map();
+			this._target.set(key, { connection, export: exportName, priority });
+			return true;
+		}
+		const oldTarget = this._target.get(key);
+		if (!oldTarget) {
+			if (oldTarget === null && !connection) return false;
+			this._target.set(key, { connection, export: exportName, priority });
+			this._maxTarget = undefined;
+			return true;
+		}
+		if (
+			oldTarget.connection !== connection ||
+			oldTarget.priority !== priority ||
+			(exportName
+				? !oldTarget.export || !equals(oldTarget.export, exportName)
+				: oldTarget.export)
+		) {
+			oldTarget.connection = connection;
+			oldTarget.export = exportName;
+			oldTarget.priority = priority;
+			this._maxTarget = undefined;
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime for this runtime
+	 * @returns {UsageStateType} usage state
+	 */
+	getUsed(runtime) {
+		if (!this._hasUseInRuntimeInfo) return UsageState.NoInfo;
+		if (this._globalUsed !== undefined) return this._globalUsed;
+		if (this._usedInRuntime === undefined) {
+			return UsageState.Unused;
+		} else if (typeof runtime === "string") {
+			const value = this._usedInRuntime.get(runtime);
+			return value === undefined ? UsageState.Unused : value;
+		} else if (runtime === undefined) {
+			/** @type {UsageStateType} */
+			let max = UsageState.Unused;
+			for (const value of this._usedInRuntime.values()) {
+				if (value === UsageState.Used) {
+					return UsageState.Used;
+				}
+				if (max < value) max = value;
+			}
+			return max;
+		} else {
+			/** @type {UsageStateType} */
+			let max = UsageState.Unused;
+			for (const item of runtime) {
+				const value = this._usedInRuntime.get(item);
+				if (value !== undefined) {
+					if (value === UsageState.Used) {
+						return UsageState.Used;
+					}
+					if (max < value) max = value;
+				}
+			}
+			return max;
+		}
+	}
+
+	/**
+	 * get used name
+	 * @param {string | undefined} fallbackName fallback name for used exports with no name
+	 * @param {RuntimeSpec} runtime check usage for this runtime only
+	 * @returns {string | false} used name
+	 */
+	getUsedName(fallbackName, runtime) {
+		if (this._hasUseInRuntimeInfo) {
+			if (this._globalUsed !== undefined) {
+				if (this._globalUsed === UsageState.Unused) return false;
+			} else {
+				if (this._usedInRuntime === undefined) return false;
+				if (typeof runtime === "string") {
+					if (!this._usedInRuntime.has(runtime)) {
+						return false;
+					}
+				} else if (runtime !== undefined) {
+					if (
+						Array.from(runtime).every(
+							runtime => !this._usedInRuntime.has(runtime)
+						)
+					) {
+						return false;
+					}
+				}
+			}
+		}
+		if (this._usedName !== null) return this._usedName;
+		return this.name || fallbackName;
+	}
+
+	/**
+	 * @returns {boolean} true, when a mangled name of this export is set
+	 */
+	hasUsedName() {
+		return this._usedName !== null;
+	}
+
+	/**
+	 * Sets the mangled name of this export
+	 * @param {string} name the new name
+	 * @returns {void}
+	 */
+	setUsedName(name) {
+		this._usedName = name;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {function({ module: Module, export: string[] | undefined }): boolean} resolveTargetFilter filter function to further resolve target
+	 * @returns {ExportInfo | ExportsInfo | undefined} the terminal binding export(s) info if known
+	 */
+	getTerminalBinding(moduleGraph, resolveTargetFilter = RETURNS_TRUE) {
+		if (this.terminalBinding) return this;
+		const target = this.getTarget(moduleGraph, resolveTargetFilter);
+		if (!target) return undefined;
+		const exportsInfo = moduleGraph.getExportsInfo(target.module);
+		if (!target.export) return exportsInfo;
+		return exportsInfo.getReadOnlyExportInfoRecursive(target.export);
+	}
+
+	isReexport() {
+		return !this.terminalBinding && this._target && this._target.size > 0;
+	}
+
+	_getMaxTarget() {
+		if (this._maxTarget !== undefined) return this._maxTarget;
+		if (this._target.size <= 1) return (this._maxTarget = this._target);
+		let maxPriority = -Infinity;
+		let minPriority = Infinity;
+		for (const { priority } of this._target.values()) {
+			if (maxPriority < priority) maxPriority = priority;
+			if (minPriority > priority) minPriority = priority;
+		}
+		// This should be very common
+		if (maxPriority === minPriority) return (this._maxTarget = this._target);
+
+		// This is an edge case
+		const map = new Map();
+		for (const [key, value] of this._target) {
+			if (maxPriority === value.priority) {
+				map.set(key, value);
+			}
+		}
+		this._maxTarget = map;
+		return map;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {function(Module): boolean} validTargetModuleFilter a valid target module
+	 * @returns {{ module: Module, export: string[] | undefined } | undefined | false} the target, undefined when there is no target, false when no target is valid
+	 */
+	findTarget(moduleGraph, validTargetModuleFilter) {
+		return this._findTarget(moduleGraph, validTargetModuleFilter, new Set());
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {function(Module): boolean} validTargetModuleFilter a valid target module
+	 * @param {Set<ExportInfo> | undefined} alreadyVisited set of already visited export info to avoid circular references
+	 * @returns {{ module: Module, export: string[] | undefined } | undefined | false} the target, undefined when there is no target, false when no target is valid
+	 */
+	_findTarget(moduleGraph, validTargetModuleFilter, alreadyVisited) {
+		if (!this._target || this._target.size === 0) return undefined;
+		let rawTarget = this._getMaxTarget().values().next().value;
+		if (!rawTarget) return undefined;
+		/** @type {{ module: Module, export: string[] | undefined }} */
+		let target = {
+			module: rawTarget.connection.module,
+			export: rawTarget.export
+		};
+		for (;;) {
+			if (validTargetModuleFilter(target.module)) return target;
+			const exportsInfo = moduleGraph.getExportsInfo(target.module);
+			const exportInfo = exportsInfo.getExportInfo(target.export[0]);
+			if (alreadyVisited.has(exportInfo)) return null;
+			const newTarget = exportInfo._findTarget(
+				moduleGraph,
+				validTargetModuleFilter,
+				alreadyVisited
+			);
+			if (!newTarget) return false;
+			if (target.export.length === 1) {
+				target = newTarget;
+			} else {
+				target = {
+					module: newTarget.module,
+					export: newTarget.export
+						? newTarget.export.concat(target.export.slice(1))
+						: target.export.slice(1)
+				};
+			}
+		}
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {function({ module: Module, export: string[] | undefined }): boolean} resolveTargetFilter filter function to further resolve target
+	 * @returns {{ module: Module, export: string[] | undefined } | undefined} the target
+	 */
+	getTarget(moduleGraph, resolveTargetFilter = RETURNS_TRUE) {
+		const result = this._getTarget(moduleGraph, resolveTargetFilter, undefined);
+		if (result === CIRCULAR) return undefined;
+		return result;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {function({ module: Module, connection: ModuleGraphConnection, export: string[] | undefined }): boolean} resolveTargetFilter filter function to further resolve target
+	 * @param {Set<ExportInfo> | undefined} alreadyVisited set of already visited export info to avoid circular references
+	 * @returns {{ module: Module, connection: ModuleGraphConnection, export: string[] | undefined } | CIRCULAR | undefined} the target
+	 */
+	_getTarget(moduleGraph, resolveTargetFilter, alreadyVisited) {
+		/**
+		 * @param {{ connection: ModuleGraphConnection, export: string[] | undefined } | null} inputTarget unresolved target
+		 * @param {Set<ExportInfo>} alreadyVisited set of already visited export info to avoid circular references
+		 * @returns {{ module: Module, connection: ModuleGraphConnection, export: string[] | undefined } | CIRCULAR | null} resolved target
+		 */
+		const resolveTarget = (inputTarget, alreadyVisited) => {
+			if (!inputTarget) return null;
+			if (!inputTarget.export) {
+				return {
+					module: inputTarget.connection.module,
+					connection: inputTarget.connection,
+					export: undefined
+				};
+			}
+			/** @type {{ module: Module, connection: ModuleGraphConnection, export: string[] | undefined }} */
+			let target = {
+				module: inputTarget.connection.module,
+				connection: inputTarget.connection,
+				export: inputTarget.export
+			};
+			if (!resolveTargetFilter(target)) return target;
+			let alreadyVisitedOwned = false;
+			for (;;) {
+				const exportsInfo = moduleGraph.getExportsInfo(target.module);
+				const exportInfo = exportsInfo.getExportInfo(target.export[0]);
+				if (!exportInfo) return target;
+				if (alreadyVisited.has(exportInfo)) return CIRCULAR;
+				const newTarget = exportInfo._getTarget(
+					moduleGraph,
+					resolveTargetFilter,
+					alreadyVisited
+				);
+				if (newTarget === CIRCULAR) return CIRCULAR;
+				if (!newTarget) return target;
+				if (target.export.length === 1) {
+					target = newTarget;
+					if (!target.export) return target;
+				} else {
+					target = {
+						module: newTarget.module,
+						connection: newTarget.connection,
+						export: newTarget.export
+							? newTarget.export.concat(target.export.slice(1))
+							: target.export.slice(1)
+					};
+				}
+				if (!resolveTargetFilter(target)) return target;
+				if (!alreadyVisitedOwned) {
+					alreadyVisited = new Set(alreadyVisited);
+					alreadyVisitedOwned = true;
+				}
+				alreadyVisited.add(exportInfo);
+			}
+		};
+
+		if (!this._target || this._target.size === 0) return undefined;
+		if (alreadyVisited && alreadyVisited.has(this)) return CIRCULAR;
+		const newAlreadyVisited = new Set(alreadyVisited);
+		newAlreadyVisited.add(this);
+		const values = this._getMaxTarget().values();
+		const target = resolveTarget(values.next().value, newAlreadyVisited);
+		if (target === CIRCULAR) return CIRCULAR;
+		if (target === null) return undefined;
+		let result = values.next();
+		while (!result.done) {
+			const t = resolveTarget(result.value, newAlreadyVisited);
+			if (t === CIRCULAR) return CIRCULAR;
+			if (t === null) return undefined;
+			if (t.module !== target.module) return undefined;
+			if (!t.export !== !target.export) return undefined;
+			if (target.export && !equals(t.export, target.export)) return undefined;
+			result = values.next();
+		}
+		return target;
+	}
+
+	/**
+	 * Move the target forward as long resolveTargetFilter is fulfilled
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {function({ module: Module, export: string[] | undefined }): boolean} resolveTargetFilter filter function to further resolve target
+	 * @param {function({ module: Module, export: string[] | undefined }): ModuleGraphConnection=} updateOriginalConnection updates the original connection instead of using the target connection
+	 * @returns {{ module: Module, export: string[] | undefined } | undefined} the resolved target when moved
+	 */
+	moveTarget(moduleGraph, resolveTargetFilter, updateOriginalConnection) {
+		const target = this._getTarget(moduleGraph, resolveTargetFilter, undefined);
+		if (target === CIRCULAR) return undefined;
+		if (!target) return undefined;
+		const originalTarget = this._getMaxTarget().values().next().value;
+		if (
+			originalTarget.connection === target.connection &&
+			originalTarget.export === target.export
+		) {
+			return undefined;
+		}
+		this._target.clear();
+		this._target.set(undefined, {
+			connection: updateOriginalConnection
+				? updateOriginalConnection(target)
+				: target.connection,
+			export: target.export,
+			priority: 0
+		});
+		return target;
+	}
+
+	createNestedExportsInfo() {
+		if (this.exportsInfoOwned) return this.exportsInfo;
+		this.exportsInfoOwned = true;
+		const oldExportsInfo = this.exportsInfo;
+		this.exportsInfo = new ExportsInfo();
+		this.exportsInfo.setHasProvideInfo();
+		if (oldExportsInfo) {
+			this.exportsInfo.setRedirectNamedTo(oldExportsInfo);
+		}
+		return this.exportsInfo;
+	}
+
+	getNestedExportsInfo() {
+		return this.exportsInfo;
+	}
+
+	hasInfo(baseInfo, runtime) {
+		return (
+			(this._usedName && this._usedName !== this.name) ||
+			this.provided ||
+			this.terminalBinding ||
+			this.getUsed(runtime) !== baseInfo.getUsed(runtime)
+		);
+	}
+
+	updateHash(hash, runtime) {
+		this._updateHash(hash, runtime, new Set());
+	}
+
+	_updateHash(hash, runtime, alreadyVisitedExportsInfo) {
+		hash.update(
+			`${this._usedName || this.name}${this.getUsed(runtime)}${this.provided}${
+				this.terminalBinding
+			}`
+		);
+		if (this.exportsInfo && !alreadyVisitedExportsInfo.has(this.exportsInfo)) {
+			this.exportsInfo._updateHash(hash, runtime, alreadyVisitedExportsInfo);
+		}
+	}
+
+	getUsedInfo() {
+		if (this._globalUsed !== undefined) {
+			switch (this._globalUsed) {
+				case UsageState.Unused:
+					return "unused";
+				case UsageState.NoInfo:
+					return "no usage info";
+				case UsageState.Unknown:
+					return "maybe used (runtime-defined)";
+				case UsageState.Used:
+					return "used";
+				case UsageState.OnlyPropertiesUsed:
+					return "only properties used";
+			}
+		} else if (this._usedInRuntime !== undefined) {
+			/** @type {Map<RuntimeUsageStateType, string[]>} */
+			const map = new Map();
+			for (const [runtime, used] of this._usedInRuntime) {
+				const list = map.get(used);
+				if (list !== undefined) list.push(runtime);
+				else map.set(used, [runtime]);
+			}
+			const specificInfo = Array.from(map, ([used, runtimes]) => {
+				switch (used) {
+					case UsageState.NoInfo:
+						return `no usage info in ${runtimes.join(", ")}`;
+					case UsageState.Unknown:
+						return `maybe used in ${runtimes.join(", ")} (runtime-defined)`;
+					case UsageState.Used:
+						return `used in ${runtimes.join(", ")}`;
+					case UsageState.OnlyPropertiesUsed:
+						return `only properties used in ${runtimes.join(", ")}`;
+				}
+			});
+			if (specificInfo.length > 0) {
+				return specificInfo.join("; ");
+			}
+		}
+		return this._hasUseInRuntimeInfo ? "unused" : "no usage info";
+	}
+
+	getProvidedInfo() {
+		switch (this.provided) {
+			case undefined:
+				return "no provided info";
+			case null:
+				return "maybe provided (runtime-defined)";
+			case true:
+				return "provided";
+			case false:
+				return "not provided";
+		}
+	}
+
+	getRenameInfo() {
+		if (this._usedName !== null && this._usedName !== this.name) {
+			return `renamed to ${JSON.stringify(this._usedName).slice(1, -1)}`;
+		}
+		switch (this.canMangleProvide) {
+			case undefined:
+				switch (this.canMangleUse) {
+					case undefined:
+						return "missing provision and use info prevents renaming";
+					case false:
+						return "usage prevents renaming (no provision info)";
+					case true:
+						return "missing provision info prevents renaming";
+				}
+				break;
+			case true:
+				switch (this.canMangleUse) {
+					case undefined:
+						return "missing usage info prevents renaming";
+					case false:
+						return "usage prevents renaming";
+					case true:
+						return "could be renamed";
+				}
+				break;
+			case false:
+				switch (this.canMangleUse) {
+					case undefined:
+						return "provision prevents renaming (no use info)";
+					case false:
+						return "usage and provision prevents renaming";
+					case true:
+						return "provision prevents renaming";
+				}
+				break;
+		}
+		throw new Error(
+			`Unexpected flags for getRenameInfo ${this.canMangleProvide} ${this.canMangleUse}`
+		);
+	}
+}
+
+module.exports = ExportsInfo;
+module.exports.ExportInfo = ExportInfo;
+module.exports.UsageState = UsageState;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ExportsInfoApiPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ExportsInfoApiPlugin.js
new file mode 100644
index 0000000..76827ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ExportsInfoApiPlugin.js
@@ -0,0 +1,71 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ConstDependency = require("./dependencies/ConstDependency");
+const ExportsInfoDependency = require("./dependencies/ExportsInfoDependency");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./javascript/JavascriptParser")} JavascriptParser */
+
+class ExportsInfoApiPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"ExportsInfoApiPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					ExportsInfoDependency,
+					new ExportsInfoDependency.Template()
+				);
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @returns {void}
+				 */
+				const handler = parser => {
+					parser.hooks.expressionMemberChain
+						.for("__webpack_exports_info__")
+						.tap("ExportsInfoApiPlugin", (expr, members) => {
+							const dep =
+								members.length >= 2
+									? new ExportsInfoDependency(
+											expr.range,
+											members.slice(0, -1),
+											members[members.length - 1]
+									  )
+									: new ExportsInfoDependency(expr.range, null, members[0]);
+							dep.loc = expr.loc;
+							parser.state.module.addDependency(dep);
+							return true;
+						});
+					parser.hooks.expression
+						.for("__webpack_exports_info__")
+						.tap("ExportsInfoApiPlugin", expr => {
+							const dep = new ConstDependency("true", expr.range);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+				};
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("ExportsInfoApiPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("ExportsInfoApiPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("ExportsInfoApiPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = ExportsInfoApiPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalModule.js
new file mode 100644
index 0000000..e6831db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalModule.js
@@ -0,0 +1,758 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { OriginalSource, RawSource } = require("webpack-sources");
+const ConcatenationScope = require("./ConcatenationScope");
+const { UsageState } = require("./ExportsInfo");
+const InitFragment = require("./InitFragment");
+const Module = require("./Module");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const Template = require("./Template");
+const StaticExportsDependency = require("./dependencies/StaticExportsDependency");
+const createHash = require("./util/createHash");
+const extractUrlAndGlobal = require("./util/extractUrlAndGlobal");
+const makeSerializable = require("./util/makeSerializable");
+const propertyAccess = require("./util/propertyAccess");
+const { register } = require("./util/serialization");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./ExportsInfo")} ExportsInfo */
+/** @typedef {import("./Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./Module").ConcatenationBailoutReasonContext} ConcatenationBailoutReasonContext */
+/** @typedef {import("./Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("./Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("./NormalModuleFactory")} NormalModuleFactory */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./javascript/JavascriptModulesPlugin").ChunkRenderContext} ChunkRenderContext */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {typeof import("./util/Hash")} HashConstructor */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} SourceData
+ * @property {boolean=} iife
+ * @property {string=} init
+ * @property {string} expression
+ * @property {InitFragment<ChunkRenderContext>[]=} chunkInitFragments
+ * @property {ReadonlySet<string>=} runtimeRequirements
+ */
+
+const TYPES = new Set(["javascript"]);
+const CSS_TYPES = new Set(["css-import"]);
+const RUNTIME_REQUIREMENTS = new Set([RuntimeGlobals.module]);
+const RUNTIME_REQUIREMENTS_FOR_SCRIPT = new Set([RuntimeGlobals.loadScript]);
+const RUNTIME_REQUIREMENTS_FOR_MODULE = new Set([
+	RuntimeGlobals.definePropertyGetters
+]);
+const EMPTY_RUNTIME_REQUIREMENTS = new Set([]);
+
+/**
+ * @param {string|string[]} variableName the variable name or path
+ * @param {string} type the module system
+ * @returns {SourceData} the generated source
+ */
+const getSourceForGlobalVariableExternal = (variableName, type) => {
+	if (!Array.isArray(variableName)) {
+		// make it an array as the look up works the same basically
+		variableName = [variableName];
+	}
+
+	// needed for e.g. window["some"]["thing"]
+	const objectLookup = variableName.map(r => `[${JSON.stringify(r)}]`).join("");
+	return {
+		iife: type === "this",
+		expression: `${type}${objectLookup}`
+	};
+};
+
+/**
+ * @param {string|string[]} moduleAndSpecifiers the module request
+ * @returns {SourceData} the generated source
+ */
+const getSourceForCommonJsExternal = moduleAndSpecifiers => {
+	if (!Array.isArray(moduleAndSpecifiers)) {
+		return {
+			expression: `require(${JSON.stringify(moduleAndSpecifiers)})`
+		};
+	}
+	const moduleName = moduleAndSpecifiers[0];
+	return {
+		expression: `require(${JSON.stringify(moduleName)})${propertyAccess(
+			moduleAndSpecifiers,
+			1
+		)}`
+	};
+};
+
+/**
+ * @param {string|string[]} moduleAndSpecifiers the module request
+ * @returns {SourceData} the generated source
+ */
+const getSourceForCommonJsExternalInNodeModule = moduleAndSpecifiers => {
+	const chunkInitFragments = [
+		new InitFragment(
+			'import { createRequire as __WEBPACK_EXTERNAL_createRequire } from "module";\n',
+			InitFragment.STAGE_HARMONY_IMPORTS,
+			0,
+			"external module node-commonjs"
+		)
+	];
+	if (!Array.isArray(moduleAndSpecifiers)) {
+		return {
+			expression: `__WEBPACK_EXTERNAL_createRequire(import.meta.url)(${JSON.stringify(
+				moduleAndSpecifiers
+			)})`,
+			chunkInitFragments
+		};
+	}
+	const moduleName = moduleAndSpecifiers[0];
+	return {
+		expression: `__WEBPACK_EXTERNAL_createRequire(import.meta.url)(${JSON.stringify(
+			moduleName
+		)})${propertyAccess(moduleAndSpecifiers, 1)}`,
+		chunkInitFragments
+	};
+};
+
+/**
+ * @param {string|string[]} moduleAndSpecifiers the module request
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @returns {SourceData} the generated source
+ */
+const getSourceForImportExternal = (moduleAndSpecifiers, runtimeTemplate) => {
+	const importName = runtimeTemplate.outputOptions.importFunctionName;
+	if (!runtimeTemplate.supportsDynamicImport() && importName === "import") {
+		throw new Error(
+			"The target environment doesn't support 'import()' so it's not possible to use external type 'import'"
+		);
+	}
+	if (!Array.isArray(moduleAndSpecifiers)) {
+		return {
+			expression: `${importName}(${JSON.stringify(moduleAndSpecifiers)});`
+		};
+	}
+	if (moduleAndSpecifiers.length === 1) {
+		return {
+			expression: `${importName}(${JSON.stringify(moduleAndSpecifiers[0])});`
+		};
+	}
+	const moduleName = moduleAndSpecifiers[0];
+	return {
+		expression: `${importName}(${JSON.stringify(
+			moduleName
+		)}).then(${runtimeTemplate.returningFunction(
+			`module${propertyAccess(moduleAndSpecifiers, 1)}`,
+			"module"
+		)});`
+	};
+};
+
+class ModuleExternalInitFragment extends InitFragment {
+	/**
+	 * @param {string} request import source
+	 * @param {string=} ident recomputed ident
+	 * @param {string | HashConstructor=} hashFunction the hash function to use
+	 */
+	constructor(request, ident, hashFunction = "md4") {
+		if (ident === undefined) {
+			ident = Template.toIdentifier(request);
+			if (ident !== request) {
+				ident += `_${createHash(hashFunction)
+					.update(request)
+					.digest("hex")
+					.slice(0, 8)}`;
+			}
+		}
+		const identifier = `__WEBPACK_EXTERNAL_MODULE_${ident}__`;
+		super(
+			`import * as ${identifier} from ${JSON.stringify(request)};\n`,
+			InitFragment.STAGE_HARMONY_IMPORTS,
+			0,
+			`external module import ${ident}`
+		);
+		this._ident = ident;
+		this._identifier = identifier;
+		this._request = request;
+	}
+
+	getNamespaceIdentifier() {
+		return this._identifier;
+	}
+}
+
+register(
+	ModuleExternalInitFragment,
+	"webpack/lib/ExternalModule",
+	"ModuleExternalInitFragment",
+	{
+		serialize(obj, { write }) {
+			write(obj._request);
+			write(obj._ident);
+		},
+		deserialize({ read }) {
+			return new ModuleExternalInitFragment(read(), read());
+		}
+	}
+);
+
+const generateModuleRemapping = (input, exportsInfo, runtime) => {
+	if (exportsInfo.otherExportsInfo.getUsed(runtime) === UsageState.Unused) {
+		const properties = [];
+		for (const exportInfo of exportsInfo.orderedExports) {
+			const used = exportInfo.getUsedName(exportInfo.name, runtime);
+			if (!used) continue;
+			const nestedInfo = exportInfo.getNestedExportsInfo();
+			if (nestedInfo) {
+				const nestedExpr = generateModuleRemapping(
+					`${input}${propertyAccess([exportInfo.name])}`,
+					nestedInfo
+				);
+				if (nestedExpr) {
+					properties.push(`[${JSON.stringify(used)}]: y(${nestedExpr})`);
+					continue;
+				}
+			}
+			properties.push(
+				`[${JSON.stringify(used)}]: () => ${input}${propertyAccess([
+					exportInfo.name
+				])}`
+			);
+		}
+		return `x({ ${properties.join(", ")} })`;
+	}
+};
+
+/**
+ * @param {string|string[]} moduleAndSpecifiers the module request
+ * @param {ExportsInfo} exportsInfo exports info of this module
+ * @param {RuntimeSpec} runtime the runtime
+ * @param {string | HashConstructor=} hashFunction the hash function to use
+ * @returns {SourceData} the generated source
+ */
+const getSourceForModuleExternal = (
+	moduleAndSpecifiers,
+	exportsInfo,
+	runtime,
+	hashFunction
+) => {
+	if (!Array.isArray(moduleAndSpecifiers))
+		moduleAndSpecifiers = [moduleAndSpecifiers];
+	const initFragment = new ModuleExternalInitFragment(
+		moduleAndSpecifiers[0],
+		undefined,
+		hashFunction
+	);
+	const baseAccess = `${initFragment.getNamespaceIdentifier()}${propertyAccess(
+		moduleAndSpecifiers,
+		1
+	)}`;
+	const moduleRemapping = generateModuleRemapping(
+		baseAccess,
+		exportsInfo,
+		runtime
+	);
+	let expression = moduleRemapping || baseAccess;
+	return {
+		expression,
+		init: `var x = y => { var x = {}; ${RuntimeGlobals.definePropertyGetters}(x, y); return x; }\nvar y = x => () => x`,
+		runtimeRequirements: moduleRemapping
+			? RUNTIME_REQUIREMENTS_FOR_MODULE
+			: undefined,
+		chunkInitFragments: [initFragment]
+	};
+};
+
+/**
+ * @param {string|string[]} urlAndGlobal the script request
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @returns {SourceData} the generated source
+ */
+const getSourceForScriptExternal = (urlAndGlobal, runtimeTemplate) => {
+	if (typeof urlAndGlobal === "string") {
+		urlAndGlobal = extractUrlAndGlobal(urlAndGlobal);
+	}
+	const url = urlAndGlobal[0];
+	const globalName = urlAndGlobal[1];
+	return {
+		init: "var __webpack_error__ = new Error();",
+		expression: `new Promise(${runtimeTemplate.basicFunction(
+			"resolve, reject",
+			[
+				`if(typeof ${globalName} !== "undefined") return resolve();`,
+				`${RuntimeGlobals.loadScript}(${JSON.stringify(
+					url
+				)}, ${runtimeTemplate.basicFunction("event", [
+					`if(typeof ${globalName} !== "undefined") return resolve();`,
+					"var errorType = event && (event.type === 'load' ? 'missing' : event.type);",
+					"var realSrc = event && event.target && event.target.src;",
+					"__webpack_error__.message = 'Loading script failed.\\n(' + errorType + ': ' + realSrc + ')';",
+					"__webpack_error__.name = 'ScriptExternalLoadError';",
+					"__webpack_error__.type = errorType;",
+					"__webpack_error__.request = realSrc;",
+					"reject(__webpack_error__);"
+				])}, ${JSON.stringify(globalName)});`
+			]
+		)}).then(${runtimeTemplate.returningFunction(
+			`${globalName}${propertyAccess(urlAndGlobal, 2)}`
+		)})`,
+		runtimeRequirements: RUNTIME_REQUIREMENTS_FOR_SCRIPT
+	};
+};
+
+/**
+ * @param {string} variableName the variable name to check
+ * @param {string} request the request path
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @returns {string} the generated source
+ */
+const checkExternalVariable = (variableName, request, runtimeTemplate) => {
+	return `if(typeof ${variableName} === 'undefined') { ${runtimeTemplate.throwMissingModuleErrorBlock(
+		{ request }
+	)} }\n`;
+};
+
+/**
+ * @param {string|number} id the module id
+ * @param {boolean} optional true, if the module is optional
+ * @param {string|string[]} request the request path
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @returns {SourceData} the generated source
+ */
+const getSourceForAmdOrUmdExternal = (
+	id,
+	optional,
+	request,
+	runtimeTemplate
+) => {
+	const externalVariable = `__WEBPACK_EXTERNAL_MODULE_${Template.toIdentifier(
+		`${id}`
+	)}__`;
+	return {
+		init: optional
+			? checkExternalVariable(
+					externalVariable,
+					Array.isArray(request) ? request.join(".") : request,
+					runtimeTemplate
+			  )
+			: undefined,
+		expression: externalVariable
+	};
+};
+
+/**
+ * @param {boolean} optional true, if the module is optional
+ * @param {string|string[]} request the request path
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @returns {SourceData} the generated source
+ */
+const getSourceForDefaultCase = (optional, request, runtimeTemplate) => {
+	if (!Array.isArray(request)) {
+		// make it an array as the look up works the same basically
+		request = [request];
+	}
+
+	const variableName = request[0];
+	const objectLookup = propertyAccess(request, 1);
+	return {
+		init: optional
+			? checkExternalVariable(variableName, request.join("."), runtimeTemplate)
+			: undefined,
+		expression: `${variableName}${objectLookup}`
+	};
+};
+
+class ExternalModule extends Module {
+	constructor(request, type, userRequest) {
+		super("javascript/dynamic", null);
+
+		// Info from Factory
+		/** @type {string | string[] | Record<string, string | string[]>} */
+		this.request = request;
+		/** @type {string} */
+		this.externalType = type;
+		/** @type {string} */
+		this.userRequest = userRequest;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return this.externalType === "css-import" ? CSS_TYPES : TYPES;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return this.userRequest;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk which condition should be checked
+	 * @param {Compilation} compilation the compilation
+	 * @returns {boolean} true, if the chunk is ok for the module
+	 */
+	chunkCondition(chunk, { chunkGraph }) {
+		return this.externalType === "css-import"
+			? true
+			: chunkGraph.getNumberOfEntryModules(chunk) > 0;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return `external ${this.externalType} ${JSON.stringify(this.request)}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return "external " + JSON.stringify(this.request);
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		return callback(null, !this.buildMeta);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {
+			async: false,
+			exportsType: undefined
+		};
+		this.buildInfo = {
+			strict: true,
+			topLevelDeclarations: new Set(),
+			module: compilation.outputOptions.module
+		};
+		const { request, externalType } = this._getRequestAndExternalType();
+		this.buildMeta.exportsType = "dynamic";
+		let canMangle = false;
+		this.clearDependenciesAndBlocks();
+		switch (externalType) {
+			case "this":
+				this.buildInfo.strict = false;
+				break;
+			case "system":
+				if (!Array.isArray(request) || request.length === 1) {
+					this.buildMeta.exportsType = "namespace";
+					canMangle = true;
+				}
+				break;
+			case "module":
+				if (this.buildInfo.module) {
+					if (!Array.isArray(request) || request.length === 1) {
+						this.buildMeta.exportsType = "namespace";
+						canMangle = true;
+					}
+				} else {
+					this.buildMeta.async = true;
+					if (!Array.isArray(request) || request.length === 1) {
+						this.buildMeta.exportsType = "namespace";
+						canMangle = false;
+					}
+				}
+				break;
+			case "script":
+			case "promise":
+				this.buildMeta.async = true;
+				break;
+			case "import":
+				this.buildMeta.async = true;
+				if (!Array.isArray(request) || request.length === 1) {
+					this.buildMeta.exportsType = "namespace";
+					canMangle = false;
+				}
+				break;
+		}
+		this.addDependency(new StaticExportsDependency(true, canMangle));
+		callback();
+	}
+
+	restoreFromUnsafeCache(unsafeCacheData, normalModuleFactory) {
+		this._restoreFromUnsafeCache(unsafeCacheData, normalModuleFactory);
+	}
+
+	/**
+	 * @param {ConcatenationBailoutReasonContext} context context
+	 * @returns {string | undefined} reason why this module can't be concatenated, undefined when it can be concatenated
+	 */
+	getConcatenationBailoutReason({ moduleGraph }) {
+		switch (this.externalType) {
+			case "amd":
+			case "amd-require":
+			case "umd":
+			case "umd2":
+			case "system":
+			case "jsonp":
+				return `${this.externalType} externals can't be concatenated`;
+		}
+		return undefined;
+	}
+
+	_getRequestAndExternalType() {
+		let { request, externalType } = this;
+		if (typeof request === "object" && !Array.isArray(request))
+			request = request[externalType];
+		return { request, externalType };
+	}
+
+	_getSourceData(
+		request,
+		externalType,
+		runtimeTemplate,
+		moduleGraph,
+		chunkGraph,
+		runtime
+	) {
+		switch (externalType) {
+			case "this":
+			case "window":
+			case "self":
+				return getSourceForGlobalVariableExternal(request, this.externalType);
+			case "global":
+				return getSourceForGlobalVariableExternal(
+					request,
+					runtimeTemplate.globalObject
+				);
+			case "commonjs":
+			case "commonjs2":
+			case "commonjs-module":
+			case "commonjs-static":
+				return getSourceForCommonJsExternal(request);
+			case "node-commonjs":
+				return this.buildInfo.module
+					? getSourceForCommonJsExternalInNodeModule(request)
+					: getSourceForCommonJsExternal(request);
+			case "amd":
+			case "amd-require":
+			case "umd":
+			case "umd2":
+			case "system":
+			case "jsonp": {
+				const id = chunkGraph.getModuleId(this);
+				return getSourceForAmdOrUmdExternal(
+					id !== null ? id : this.identifier(),
+					this.isOptional(moduleGraph),
+					request,
+					runtimeTemplate
+				);
+			}
+			case "import":
+				return getSourceForImportExternal(request, runtimeTemplate);
+			case "script":
+				return getSourceForScriptExternal(request, runtimeTemplate);
+			case "module": {
+				if (!this.buildInfo.module) {
+					if (!runtimeTemplate.supportsDynamicImport()) {
+						throw new Error(
+							"The target environment doesn't support dynamic import() syntax so it's not possible to use external type 'module' within a script" +
+								(runtimeTemplate.supportsEcmaScriptModuleSyntax()
+									? "\nDid you mean to build a EcmaScript Module ('output.module: true')?"
+									: "")
+						);
+					}
+					return getSourceForImportExternal(request, runtimeTemplate);
+				}
+				if (!runtimeTemplate.supportsEcmaScriptModuleSyntax()) {
+					throw new Error(
+						"The target environment doesn't support EcmaScriptModule syntax so it's not possible to use external type 'module'"
+					);
+				}
+				return getSourceForModuleExternal(
+					request,
+					moduleGraph.getExportsInfo(this),
+					runtime,
+					runtimeTemplate.outputOptions.hashFunction
+				);
+			}
+			case "var":
+			case "promise":
+			case "const":
+			case "let":
+			case "assign":
+			default:
+				return getSourceForDefaultCase(
+					this.isOptional(moduleGraph),
+					request,
+					runtimeTemplate
+				);
+		}
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({
+		runtimeTemplate,
+		moduleGraph,
+		chunkGraph,
+		runtime,
+		concatenationScope
+	}) {
+		const { request, externalType } = this._getRequestAndExternalType();
+		switch (externalType) {
+			case "asset": {
+				const sources = new Map();
+				sources.set(
+					"javascript",
+					new RawSource(`module.exports = ${JSON.stringify(request)};`)
+				);
+				const data = new Map();
+				data.set("url", request);
+				return { sources, runtimeRequirements: RUNTIME_REQUIREMENTS, data };
+			}
+			case "css-import": {
+				const sources = new Map();
+				sources.set(
+					"css-import",
+					new RawSource(`@import url(${JSON.stringify(request)});`)
+				);
+				return {
+					sources,
+					runtimeRequirements: EMPTY_RUNTIME_REQUIREMENTS
+				};
+			}
+			default: {
+				const sourceData = this._getSourceData(
+					request,
+					externalType,
+					runtimeTemplate,
+					moduleGraph,
+					chunkGraph,
+					runtime
+				);
+
+				let sourceString = sourceData.expression;
+				if (sourceData.iife)
+					sourceString = `(function() { return ${sourceString}; }())`;
+				if (concatenationScope) {
+					sourceString = `${
+						runtimeTemplate.supportsConst() ? "const" : "var"
+					} ${ConcatenationScope.NAMESPACE_OBJECT_EXPORT} = ${sourceString};`;
+					concatenationScope.registerNamespaceExport(
+						ConcatenationScope.NAMESPACE_OBJECT_EXPORT
+					);
+				} else {
+					sourceString = `module.exports = ${sourceString};`;
+				}
+				if (sourceData.init)
+					sourceString = `${sourceData.init}\n${sourceString}`;
+
+				let data = undefined;
+				if (sourceData.chunkInitFragments) {
+					data = new Map();
+					data.set("chunkInitFragments", sourceData.chunkInitFragments);
+				}
+
+				const sources = new Map();
+				if (this.useSourceMap || this.useSimpleSourceMap) {
+					sources.set(
+						"javascript",
+						new OriginalSource(sourceString, this.identifier())
+					);
+				} else {
+					sources.set("javascript", new RawSource(sourceString));
+				}
+
+				let runtimeRequirements = sourceData.runtimeRequirements;
+				if (!concatenationScope) {
+					if (!runtimeRequirements) {
+						runtimeRequirements = RUNTIME_REQUIREMENTS;
+					} else {
+						const set = new Set(runtimeRequirements);
+						set.add(RuntimeGlobals.module);
+						runtimeRequirements = set;
+					}
+				}
+
+				return {
+					sources,
+					runtimeRequirements:
+						runtimeRequirements || EMPTY_RUNTIME_REQUIREMENTS,
+					data
+				};
+			}
+		}
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 42;
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		const { chunkGraph } = context;
+		hash.update(
+			`${this.externalType}${JSON.stringify(this.request)}${this.isOptional(
+				chunkGraph.moduleGraph
+			)}`
+		);
+		super.updateHash(hash, context);
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.request);
+		write(this.externalType);
+		write(this.userRequest);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.request = read();
+		this.externalType = read();
+		this.userRequest = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ExternalModule, "webpack/lib/ExternalModule");
+
+module.exports = ExternalModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalModuleFactoryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalModuleFactoryPlugin.js
new file mode 100644
index 0000000..92d5647
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalModuleFactoryPlugin.js
@@ -0,0 +1,254 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const ExternalModule = require("./ExternalModule");
+const { resolveByProperty, cachedSetProperty } = require("./util/cleverMerge");
+
+/** @typedef {import("../declarations/WebpackOptions").Externals} Externals */
+/** @typedef {import("./NormalModuleFactory")} NormalModuleFactory */
+
+const UNSPECIFIED_EXTERNAL_TYPE_REGEXP = /^[a-z0-9-]+ /;
+const EMPTY_RESOLVE_OPTIONS = {};
+
+// TODO webpack 6 remove this
+const callDeprecatedExternals = util.deprecate(
+	(externalsFunction, context, request, cb) => {
+		externalsFunction.call(null, context, request, cb);
+	},
+	"The externals-function should be defined like ({context, request}, cb) => { ... }",
+	"DEP_WEBPACK_EXTERNALS_FUNCTION_PARAMETERS"
+);
+
+const cache = new WeakMap();
+
+const resolveLayer = (obj, layer) => {
+	let map = cache.get(obj);
+	if (map === undefined) {
+		map = new Map();
+		cache.set(obj, map);
+	} else {
+		const cacheEntry = map.get(layer);
+		if (cacheEntry !== undefined) return cacheEntry;
+	}
+	const result = resolveByProperty(obj, "byLayer", layer);
+	map.set(layer, result);
+	return result;
+};
+
+class ExternalModuleFactoryPlugin {
+	/**
+	 * @param {string | undefined} type default external type
+	 * @param {Externals} externals externals config
+	 */
+	constructor(type, externals) {
+		this.type = type;
+		this.externals = externals;
+	}
+
+	/**
+	 * @param {NormalModuleFactory} normalModuleFactory the normal module factory
+	 * @returns {void}
+	 */
+	apply(normalModuleFactory) {
+		const globalType = this.type;
+		normalModuleFactory.hooks.factorize.tapAsync(
+			"ExternalModuleFactoryPlugin",
+			(data, callback) => {
+				const context = data.context;
+				const contextInfo = data.contextInfo;
+				const dependency = data.dependencies[0];
+				const dependencyType = data.dependencyType;
+
+				/**
+				 * @param {string|string[]|boolean|Record<string, string|string[]>} value the external config
+				 * @param {string|undefined} type type of external
+				 * @param {function(Error=, ExternalModule=): void} callback callback
+				 * @returns {void}
+				 */
+				const handleExternal = (value, type, callback) => {
+					if (value === false) {
+						// Not externals, fallback to original factory
+						return callback();
+					}
+					/** @type {string | string[] | Record<string, string|string[]>} */
+					let externalConfig;
+					if (value === true) {
+						externalConfig = dependency.request;
+					} else {
+						externalConfig = value;
+					}
+					// When no explicit type is specified, extract it from the externalConfig
+					if (type === undefined) {
+						if (
+							typeof externalConfig === "string" &&
+							UNSPECIFIED_EXTERNAL_TYPE_REGEXP.test(externalConfig)
+						) {
+							const idx = externalConfig.indexOf(" ");
+							type = externalConfig.substr(0, idx);
+							externalConfig = externalConfig.substr(idx + 1);
+						} else if (
+							Array.isArray(externalConfig) &&
+							externalConfig.length > 0 &&
+							UNSPECIFIED_EXTERNAL_TYPE_REGEXP.test(externalConfig[0])
+						) {
+							const firstItem = externalConfig[0];
+							const idx = firstItem.indexOf(" ");
+							type = firstItem.substr(0, idx);
+							externalConfig = [
+								firstItem.substr(idx + 1),
+								...externalConfig.slice(1)
+							];
+						}
+					}
+					callback(
+						null,
+						new ExternalModule(
+							externalConfig,
+							type || globalType,
+							dependency.request
+						)
+					);
+				};
+
+				/**
+				 * @param {Externals} externals externals config
+				 * @param {function((Error | null)=, ExternalModule=): void} callback callback
+				 * @returns {void}
+				 */
+				const handleExternals = (externals, callback) => {
+					if (typeof externals === "string") {
+						if (externals === dependency.request) {
+							return handleExternal(dependency.request, undefined, callback);
+						}
+					} else if (Array.isArray(externals)) {
+						let i = 0;
+						const next = () => {
+							let asyncFlag;
+							const handleExternalsAndCallback = (err, module) => {
+								if (err) return callback(err);
+								if (!module) {
+									if (asyncFlag) {
+										asyncFlag = false;
+										return;
+									}
+									return next();
+								}
+								callback(null, module);
+							};
+
+							do {
+								asyncFlag = true;
+								if (i >= externals.length) return callback();
+								handleExternals(externals[i++], handleExternalsAndCallback);
+							} while (!asyncFlag);
+							asyncFlag = false;
+						};
+
+						next();
+						return;
+					} else if (externals instanceof RegExp) {
+						if (externals.test(dependency.request)) {
+							return handleExternal(dependency.request, undefined, callback);
+						}
+					} else if (typeof externals === "function") {
+						const cb = (err, value, type) => {
+							if (err) return callback(err);
+							if (value !== undefined) {
+								handleExternal(value, type, callback);
+							} else {
+								callback();
+							}
+						};
+						if (externals.length === 3) {
+							// TODO webpack 6 remove this
+							callDeprecatedExternals(
+								externals,
+								context,
+								dependency.request,
+								cb
+							);
+						} else {
+							const promise = externals(
+								{
+									context,
+									request: dependency.request,
+									dependencyType,
+									contextInfo,
+									getResolve: options => (context, request, callback) => {
+										const resolveContext = {
+											fileDependencies: data.fileDependencies,
+											missingDependencies: data.missingDependencies,
+											contextDependencies: data.contextDependencies
+										};
+										let resolver = normalModuleFactory.getResolver(
+											"normal",
+											dependencyType
+												? cachedSetProperty(
+														data.resolveOptions || EMPTY_RESOLVE_OPTIONS,
+														"dependencyType",
+														dependencyType
+												  )
+												: data.resolveOptions
+										);
+										if (options) resolver = resolver.withOptions(options);
+										if (callback) {
+											resolver.resolve(
+												{},
+												context,
+												request,
+												resolveContext,
+												callback
+											);
+										} else {
+											return new Promise((resolve, reject) => {
+												resolver.resolve(
+													{},
+													context,
+													request,
+													resolveContext,
+													(err, result) => {
+														if (err) reject(err);
+														else resolve(result);
+													}
+												);
+											});
+										}
+									}
+								},
+								cb
+							);
+							if (promise && promise.then) promise.then(r => cb(null, r), cb);
+						}
+						return;
+					} else if (typeof externals === "object") {
+						const resolvedExternals = resolveLayer(
+							externals,
+							contextInfo.issuerLayer
+						);
+						if (
+							Object.prototype.hasOwnProperty.call(
+								resolvedExternals,
+								dependency.request
+							)
+						) {
+							return handleExternal(
+								resolvedExternals[dependency.request],
+								undefined,
+								callback
+							);
+						}
+					}
+					callback();
+				};
+
+				handleExternals(this.externals, callback);
+			}
+		);
+	}
+}
+module.exports = ExternalModuleFactoryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalsPlugin.js
new file mode 100644
index 0000000..01e7469
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ExternalsPlugin.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ExternalModuleFactoryPlugin = require("./ExternalModuleFactoryPlugin");
+
+/** @typedef {import("../declarations/WebpackOptions").Externals} Externals */
+/** @typedef {import("./Compiler")} Compiler */
+
+class ExternalsPlugin {
+	/**
+	 * @param {string | undefined} type default external type
+	 * @param {Externals} externals externals config
+	 */
+	constructor(type, externals) {
+		this.type = type;
+		this.externals = externals;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compile.tap("ExternalsPlugin", ({ normalModuleFactory }) => {
+			new ExternalModuleFactoryPlugin(this.type, this.externals).apply(
+				normalModuleFactory
+			);
+		});
+	}
+}
+
+module.exports = ExternalsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/FileSystemInfo.js b/node_modules/mathjs/examples/node_modules/webpack/lib/FileSystemInfo.js
new file mode 100644
index 0000000..cfa01bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/FileSystemInfo.js
@@ -0,0 +1,3559 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { create: createResolver } = require("enhanced-resolve");
+const asyncLib = require("neo-async");
+const AsyncQueue = require("./util/AsyncQueue");
+const StackedCacheMap = require("./util/StackedCacheMap");
+const createHash = require("./util/createHash");
+const { join, dirname, relative, lstatReadlinkAbsolute } = require("./util/fs");
+const makeSerializable = require("./util/makeSerializable");
+const processAsyncTree = require("./util/processAsyncTree");
+
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./logging/Logger").Logger} Logger */
+/** @typedef {typeof import("./util/Hash")} Hash */
+/** @typedef {import("./util/fs").IStats} IStats */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+const supportsEsm = +process.versions.modules >= 83;
+
+let FS_ACCURACY = 2000;
+
+const EMPTY_SET = new Set();
+
+const RBDT_RESOLVE_CJS = 0;
+const RBDT_RESOLVE_ESM = 1;
+const RBDT_RESOLVE_DIRECTORY = 2;
+const RBDT_RESOLVE_CJS_FILE = 3;
+const RBDT_RESOLVE_CJS_FILE_AS_CHILD = 4;
+const RBDT_RESOLVE_ESM_FILE = 5;
+const RBDT_DIRECTORY = 6;
+const RBDT_FILE = 7;
+const RBDT_DIRECTORY_DEPENDENCIES = 8;
+const RBDT_FILE_DEPENDENCIES = 9;
+
+const INVALID = Symbol("invalid");
+
+/**
+ * @typedef {Object} FileSystemInfoEntry
+ * @property {number} safeTime
+ * @property {number=} timestamp
+ */
+
+/**
+ * @typedef {Object} ResolvedContextFileSystemInfoEntry
+ * @property {number} safeTime
+ * @property {string=} timestampHash
+ */
+
+/**
+ * @typedef {Object} ContextFileSystemInfoEntry
+ * @property {number} safeTime
+ * @property {string=} timestampHash
+ * @property {ResolvedContextFileSystemInfoEntry=} resolved
+ * @property {Set<string>=} symlinks
+ */
+
+/**
+ * @typedef {Object} TimestampAndHash
+ * @property {number} safeTime
+ * @property {number=} timestamp
+ * @property {string} hash
+ */
+
+/**
+ * @typedef {Object} ResolvedContextTimestampAndHash
+ * @property {number} safeTime
+ * @property {string=} timestampHash
+ * @property {string} hash
+ */
+
+/**
+ * @typedef {Object} ContextTimestampAndHash
+ * @property {number} safeTime
+ * @property {string=} timestampHash
+ * @property {string} hash
+ * @property {ResolvedContextTimestampAndHash=} resolved
+ * @property {Set<string>=} symlinks
+ */
+
+/**
+ * @typedef {Object} ContextHash
+ * @property {string} hash
+ * @property {string=} resolved
+ * @property {Set<string>=} symlinks
+ */
+
+/**
+ * @typedef {Object} SnapshotOptimizationEntry
+ * @property {Snapshot} snapshot
+ * @property {number} shared
+ * @property {Set<string>} snapshotContent
+ * @property {Set<SnapshotOptimizationEntry>} children
+ */
+
+/**
+ * @typedef {Object} ResolveBuildDependenciesResult
+ * @property {Set<string>} files list of files
+ * @property {Set<string>} directories list of directories
+ * @property {Set<string>} missing list of missing entries
+ * @property {Map<string, string | false>} resolveResults stored resolve results
+ * @property {Object} resolveDependencies dependencies of the resolving
+ * @property {Set<string>} resolveDependencies.files list of files
+ * @property {Set<string>} resolveDependencies.directories list of directories
+ * @property {Set<string>} resolveDependencies.missing list of missing entries
+ */
+
+const DONE_ITERATOR_RESULT = new Set().keys().next();
+
+// cspell:word tshs
+// Tsh = Timestamp + Hash
+// Tshs = Timestamp + Hash combinations
+
+class SnapshotIterator {
+	constructor(next) {
+		this.next = next;
+	}
+}
+
+class SnapshotIterable {
+	constructor(snapshot, getMaps) {
+		this.snapshot = snapshot;
+		this.getMaps = getMaps;
+	}
+
+	[Symbol.iterator]() {
+		let state = 0;
+		/** @type {IterableIterator<string>} */
+		let it;
+		/** @type {(Snapshot) => (Map<string, any> | Set<string>)[]} */
+		let getMaps;
+		/** @type {(Map<string, any> | Set<string>)[]} */
+		let maps;
+		/** @type {Snapshot} */
+		let snapshot;
+		let queue;
+		return new SnapshotIterator(() => {
+			for (;;) {
+				switch (state) {
+					case 0:
+						snapshot = this.snapshot;
+						getMaps = this.getMaps;
+						maps = getMaps(snapshot);
+						state = 1;
+					/* falls through */
+					case 1:
+						if (maps.length > 0) {
+							const map = maps.pop();
+							if (map !== undefined) {
+								it = map.keys();
+								state = 2;
+							} else {
+								break;
+							}
+						} else {
+							state = 3;
+							break;
+						}
+					/* falls through */
+					case 2: {
+						const result = it.next();
+						if (!result.done) return result;
+						state = 1;
+						break;
+					}
+					case 3: {
+						const children = snapshot.children;
+						if (children !== undefined) {
+							if (children.size === 1) {
+								// shortcut for a single child
+								// avoids allocation of queue
+								for (const child of children) snapshot = child;
+								maps = getMaps(snapshot);
+								state = 1;
+								break;
+							}
+							if (queue === undefined) queue = [];
+							for (const child of children) {
+								queue.push(child);
+							}
+						}
+						if (queue !== undefined && queue.length > 0) {
+							snapshot = queue.pop();
+							maps = getMaps(snapshot);
+							state = 1;
+							break;
+						} else {
+							state = 4;
+						}
+					}
+					/* falls through */
+					case 4:
+						return DONE_ITERATOR_RESULT;
+				}
+			}
+		});
+	}
+}
+
+class Snapshot {
+	constructor() {
+		this._flags = 0;
+		/** @type {number | undefined} */
+		this.startTime = undefined;
+		/** @type {Map<string, FileSystemInfoEntry | null> | undefined} */
+		this.fileTimestamps = undefined;
+		/** @type {Map<string, string | null> | undefined} */
+		this.fileHashes = undefined;
+		/** @type {Map<string, TimestampAndHash | string | null> | undefined} */
+		this.fileTshs = undefined;
+		/** @type {Map<string, ResolvedContextFileSystemInfoEntry | null> | undefined} */
+		this.contextTimestamps = undefined;
+		/** @type {Map<string, string | null> | undefined} */
+		this.contextHashes = undefined;
+		/** @type {Map<string, ResolvedContextTimestampAndHash | null> | undefined} */
+		this.contextTshs = undefined;
+		/** @type {Map<string, boolean> | undefined} */
+		this.missingExistence = undefined;
+		/** @type {Map<string, string> | undefined} */
+		this.managedItemInfo = undefined;
+		/** @type {Set<string> | undefined} */
+		this.managedFiles = undefined;
+		/** @type {Set<string> | undefined} */
+		this.managedContexts = undefined;
+		/** @type {Set<string> | undefined} */
+		this.managedMissing = undefined;
+		/** @type {Set<Snapshot> | undefined} */
+		this.children = undefined;
+	}
+
+	hasStartTime() {
+		return (this._flags & 1) !== 0;
+	}
+
+	setStartTime(value) {
+		this._flags = this._flags | 1;
+		this.startTime = value;
+	}
+
+	setMergedStartTime(value, snapshot) {
+		if (value) {
+			if (snapshot.hasStartTime()) {
+				this.setStartTime(Math.min(value, snapshot.startTime));
+			} else {
+				this.setStartTime(value);
+			}
+		} else {
+			if (snapshot.hasStartTime()) this.setStartTime(snapshot.startTime);
+		}
+	}
+
+	hasFileTimestamps() {
+		return (this._flags & 2) !== 0;
+	}
+
+	setFileTimestamps(value) {
+		this._flags = this._flags | 2;
+		this.fileTimestamps = value;
+	}
+
+	hasFileHashes() {
+		return (this._flags & 4) !== 0;
+	}
+
+	setFileHashes(value) {
+		this._flags = this._flags | 4;
+		this.fileHashes = value;
+	}
+
+	hasFileTshs() {
+		return (this._flags & 8) !== 0;
+	}
+
+	setFileTshs(value) {
+		this._flags = this._flags | 8;
+		this.fileTshs = value;
+	}
+
+	hasContextTimestamps() {
+		return (this._flags & 0x10) !== 0;
+	}
+
+	setContextTimestamps(value) {
+		this._flags = this._flags | 0x10;
+		this.contextTimestamps = value;
+	}
+
+	hasContextHashes() {
+		return (this._flags & 0x20) !== 0;
+	}
+
+	setContextHashes(value) {
+		this._flags = this._flags | 0x20;
+		this.contextHashes = value;
+	}
+
+	hasContextTshs() {
+		return (this._flags & 0x40) !== 0;
+	}
+
+	setContextTshs(value) {
+		this._flags = this._flags | 0x40;
+		this.contextTshs = value;
+	}
+
+	hasMissingExistence() {
+		return (this._flags & 0x80) !== 0;
+	}
+
+	setMissingExistence(value) {
+		this._flags = this._flags | 0x80;
+		this.missingExistence = value;
+	}
+
+	hasManagedItemInfo() {
+		return (this._flags & 0x100) !== 0;
+	}
+
+	setManagedItemInfo(value) {
+		this._flags = this._flags | 0x100;
+		this.managedItemInfo = value;
+	}
+
+	hasManagedFiles() {
+		return (this._flags & 0x200) !== 0;
+	}
+
+	setManagedFiles(value) {
+		this._flags = this._flags | 0x200;
+		this.managedFiles = value;
+	}
+
+	hasManagedContexts() {
+		return (this._flags & 0x400) !== 0;
+	}
+
+	setManagedContexts(value) {
+		this._flags = this._flags | 0x400;
+		this.managedContexts = value;
+	}
+
+	hasManagedMissing() {
+		return (this._flags & 0x800) !== 0;
+	}
+
+	setManagedMissing(value) {
+		this._flags = this._flags | 0x800;
+		this.managedMissing = value;
+	}
+
+	hasChildren() {
+		return (this._flags & 0x1000) !== 0;
+	}
+
+	setChildren(value) {
+		this._flags = this._flags | 0x1000;
+		this.children = value;
+	}
+
+	addChild(child) {
+		if (!this.hasChildren()) {
+			this.setChildren(new Set());
+		}
+		this.children.add(child);
+	}
+
+	serialize({ write }) {
+		write(this._flags);
+		if (this.hasStartTime()) write(this.startTime);
+		if (this.hasFileTimestamps()) write(this.fileTimestamps);
+		if (this.hasFileHashes()) write(this.fileHashes);
+		if (this.hasFileTshs()) write(this.fileTshs);
+		if (this.hasContextTimestamps()) write(this.contextTimestamps);
+		if (this.hasContextHashes()) write(this.contextHashes);
+		if (this.hasContextTshs()) write(this.contextTshs);
+		if (this.hasMissingExistence()) write(this.missingExistence);
+		if (this.hasManagedItemInfo()) write(this.managedItemInfo);
+		if (this.hasManagedFiles()) write(this.managedFiles);
+		if (this.hasManagedContexts()) write(this.managedContexts);
+		if (this.hasManagedMissing()) write(this.managedMissing);
+		if (this.hasChildren()) write(this.children);
+	}
+
+	deserialize({ read }) {
+		this._flags = read();
+		if (this.hasStartTime()) this.startTime = read();
+		if (this.hasFileTimestamps()) this.fileTimestamps = read();
+		if (this.hasFileHashes()) this.fileHashes = read();
+		if (this.hasFileTshs()) this.fileTshs = read();
+		if (this.hasContextTimestamps()) this.contextTimestamps = read();
+		if (this.hasContextHashes()) this.contextHashes = read();
+		if (this.hasContextTshs()) this.contextTshs = read();
+		if (this.hasMissingExistence()) this.missingExistence = read();
+		if (this.hasManagedItemInfo()) this.managedItemInfo = read();
+		if (this.hasManagedFiles()) this.managedFiles = read();
+		if (this.hasManagedContexts()) this.managedContexts = read();
+		if (this.hasManagedMissing()) this.managedMissing = read();
+		if (this.hasChildren()) this.children = read();
+	}
+
+	/**
+	 * @param {function(Snapshot): (ReadonlyMap<string, any> | ReadonlySet<string>)[]} getMaps first
+	 * @returns {Iterable<string>} iterable
+	 */
+	_createIterable(getMaps) {
+		return new SnapshotIterable(this, getMaps);
+	}
+
+	/**
+	 * @returns {Iterable<string>} iterable
+	 */
+	getFileIterable() {
+		return this._createIterable(s => [
+			s.fileTimestamps,
+			s.fileHashes,
+			s.fileTshs,
+			s.managedFiles
+		]);
+	}
+
+	/**
+	 * @returns {Iterable<string>} iterable
+	 */
+	getContextIterable() {
+		return this._createIterable(s => [
+			s.contextTimestamps,
+			s.contextHashes,
+			s.contextTshs,
+			s.managedContexts
+		]);
+	}
+
+	/**
+	 * @returns {Iterable<string>} iterable
+	 */
+	getMissingIterable() {
+		return this._createIterable(s => [s.missingExistence, s.managedMissing]);
+	}
+}
+
+makeSerializable(Snapshot, "webpack/lib/FileSystemInfo", "Snapshot");
+
+const MIN_COMMON_SNAPSHOT_SIZE = 3;
+
+/**
+ * @template T
+ */
+class SnapshotOptimization {
+	/**
+	 * @param {function(Snapshot): boolean} has has value
+	 * @param {function(Snapshot): Map<string, T> | Set<string>} get get value
+	 * @param {function(Snapshot, Map<string, T> | Set<string>): void} set set value
+	 * @param {boolean=} useStartTime use the start time of snapshots
+	 * @param {boolean=} isSet value is an Set instead of a Map
+	 */
+	constructor(has, get, set, useStartTime = true, isSet = false) {
+		this._has = has;
+		this._get = get;
+		this._set = set;
+		this._useStartTime = useStartTime;
+		this._isSet = isSet;
+		/** @type {Map<string, SnapshotOptimizationEntry>} */
+		this._map = new Map();
+		this._statItemsShared = 0;
+		this._statItemsUnshared = 0;
+		this._statSharedSnapshots = 0;
+		this._statReusedSharedSnapshots = 0;
+	}
+
+	getStatisticMessage() {
+		const total = this._statItemsShared + this._statItemsUnshared;
+		if (total === 0) return undefined;
+		return `${
+			this._statItemsShared && Math.round((this._statItemsShared * 100) / total)
+		}% (${this._statItemsShared}/${total}) entries shared via ${
+			this._statSharedSnapshots
+		} shared snapshots (${
+			this._statReusedSharedSnapshots + this._statSharedSnapshots
+		} times referenced)`;
+	}
+
+	clear() {
+		this._map.clear();
+		this._statItemsShared = 0;
+		this._statItemsUnshared = 0;
+		this._statSharedSnapshots = 0;
+		this._statReusedSharedSnapshots = 0;
+	}
+
+	/**
+	 * @param {Snapshot} newSnapshot snapshot
+	 * @param {Set<string>} capturedFiles files to snapshot/share
+	 * @returns {void}
+	 */
+	optimize(newSnapshot, capturedFiles) {
+		/**
+		 * @param {SnapshotOptimizationEntry} entry optimization entry
+		 * @returns {void}
+		 */
+		const increaseSharedAndStoreOptimizationEntry = entry => {
+			if (entry.children !== undefined) {
+				entry.children.forEach(increaseSharedAndStoreOptimizationEntry);
+			}
+			entry.shared++;
+			storeOptimizationEntry(entry);
+		};
+		/**
+		 * @param {SnapshotOptimizationEntry} entry optimization entry
+		 * @returns {void}
+		 */
+		const storeOptimizationEntry = entry => {
+			for (const path of entry.snapshotContent) {
+				const old = this._map.get(path);
+				if (old.shared < entry.shared) {
+					this._map.set(path, entry);
+				}
+				capturedFiles.delete(path);
+			}
+		};
+
+		/** @type {SnapshotOptimizationEntry} */
+		let newOptimizationEntry = undefined;
+
+		const capturedFilesSize = capturedFiles.size;
+
+		/** @type {Set<SnapshotOptimizationEntry> | undefined} */
+		const optimizationEntries = new Set();
+
+		for (const path of capturedFiles) {
+			const optimizationEntry = this._map.get(path);
+			if (optimizationEntry === undefined) {
+				if (newOptimizationEntry === undefined) {
+					newOptimizationEntry = {
+						snapshot: newSnapshot,
+						shared: 0,
+						snapshotContent: undefined,
+						children: undefined
+					};
+				}
+				this._map.set(path, newOptimizationEntry);
+				continue;
+			} else {
+				optimizationEntries.add(optimizationEntry);
+			}
+		}
+
+		optimizationEntries: for (const optimizationEntry of optimizationEntries) {
+			const snapshot = optimizationEntry.snapshot;
+			if (optimizationEntry.shared > 0) {
+				// It's a shared snapshot
+				// We can't change it, so we can only use it when all files match
+				// and startTime is compatible
+				if (
+					this._useStartTime &&
+					newSnapshot.startTime &&
+					(!snapshot.startTime || snapshot.startTime > newSnapshot.startTime)
+				) {
+					continue;
+				}
+				const nonSharedFiles = new Set();
+				const snapshotContent = optimizationEntry.snapshotContent;
+				const snapshotEntries = this._get(snapshot);
+				for (const path of snapshotContent) {
+					if (!capturedFiles.has(path)) {
+						if (!snapshotEntries.has(path)) {
+							// File is not shared and can't be removed from the snapshot
+							// because it's in a child of the snapshot
+							continue optimizationEntries;
+						}
+						nonSharedFiles.add(path);
+						continue;
+					}
+				}
+				if (nonSharedFiles.size === 0) {
+					// The complete snapshot is shared
+					// add it as child
+					newSnapshot.addChild(snapshot);
+					increaseSharedAndStoreOptimizationEntry(optimizationEntry);
+					this._statReusedSharedSnapshots++;
+				} else {
+					// Only a part of the snapshot is shared
+					const sharedCount = snapshotContent.size - nonSharedFiles.size;
+					if (sharedCount < MIN_COMMON_SNAPSHOT_SIZE) {
+						// Common part it too small
+						continue optimizationEntries;
+					}
+					// Extract common timestamps from both snapshots
+					let commonMap;
+					if (this._isSet) {
+						commonMap = new Set();
+						for (const path of /** @type {Set<string>} */ (snapshotEntries)) {
+							if (nonSharedFiles.has(path)) continue;
+							commonMap.add(path);
+							snapshotEntries.delete(path);
+						}
+					} else {
+						commonMap = new Map();
+						const map = /** @type {Map<string, T>} */ (snapshotEntries);
+						for (const [path, value] of map) {
+							if (nonSharedFiles.has(path)) continue;
+							commonMap.set(path, value);
+							snapshotEntries.delete(path);
+						}
+					}
+					// Create and attach snapshot
+					const commonSnapshot = new Snapshot();
+					if (this._useStartTime) {
+						commonSnapshot.setMergedStartTime(newSnapshot.startTime, snapshot);
+					}
+					this._set(commonSnapshot, commonMap);
+					newSnapshot.addChild(commonSnapshot);
+					snapshot.addChild(commonSnapshot);
+					// Create optimization entry
+					const newEntry = {
+						snapshot: commonSnapshot,
+						shared: optimizationEntry.shared + 1,
+						snapshotContent: new Set(commonMap.keys()),
+						children: undefined
+					};
+					if (optimizationEntry.children === undefined)
+						optimizationEntry.children = new Set();
+					optimizationEntry.children.add(newEntry);
+					storeOptimizationEntry(newEntry);
+					this._statSharedSnapshots++;
+				}
+			} else {
+				// It's a unshared snapshot
+				// We can extract a common shared snapshot
+				// with all common files
+				const snapshotEntries = this._get(snapshot);
+				if (snapshotEntries === undefined) {
+					// Incomplete snapshot, that can't be used
+					continue optimizationEntries;
+				}
+				let commonMap;
+				if (this._isSet) {
+					commonMap = new Set();
+					const set = /** @type {Set<string>} */ (snapshotEntries);
+					if (capturedFiles.size < set.size) {
+						for (const path of capturedFiles) {
+							if (set.has(path)) commonMap.add(path);
+						}
+					} else {
+						for (const path of set) {
+							if (capturedFiles.has(path)) commonMap.add(path);
+						}
+					}
+				} else {
+					commonMap = new Map();
+					const map = /** @type {Map<string, T>} */ (snapshotEntries);
+					for (const path of capturedFiles) {
+						const ts = map.get(path);
+						if (ts === undefined) continue;
+						commonMap.set(path, ts);
+					}
+				}
+
+				if (commonMap.size < MIN_COMMON_SNAPSHOT_SIZE) {
+					// Common part it too small
+					continue optimizationEntries;
+				}
+				// Create and attach snapshot
+				const commonSnapshot = new Snapshot();
+				if (this._useStartTime) {
+					commonSnapshot.setMergedStartTime(newSnapshot.startTime, snapshot);
+				}
+				this._set(commonSnapshot, commonMap);
+				newSnapshot.addChild(commonSnapshot);
+				snapshot.addChild(commonSnapshot);
+				// Remove files from snapshot
+				for (const path of commonMap.keys()) snapshotEntries.delete(path);
+				const sharedCount = commonMap.size;
+				this._statItemsUnshared -= sharedCount;
+				this._statItemsShared += sharedCount;
+				// Create optimization entry
+				storeOptimizationEntry({
+					snapshot: commonSnapshot,
+					shared: 2,
+					snapshotContent: new Set(commonMap.keys()),
+					children: undefined
+				});
+				this._statSharedSnapshots++;
+			}
+		}
+		const unshared = capturedFiles.size;
+		this._statItemsUnshared += unshared;
+		this._statItemsShared += capturedFilesSize - unshared;
+	}
+}
+
+const parseString = str => {
+	if (str[0] === "'") str = `"${str.slice(1, -1).replace(/"/g, '\\"')}"`;
+	return JSON.parse(str);
+};
+
+/* istanbul ignore next */
+/**
+ * @param {number} mtime mtime
+ */
+const applyMtime = mtime => {
+	if (FS_ACCURACY > 1 && mtime % 2 !== 0) FS_ACCURACY = 1;
+	else if (FS_ACCURACY > 10 && mtime % 20 !== 0) FS_ACCURACY = 10;
+	else if (FS_ACCURACY > 100 && mtime % 200 !== 0) FS_ACCURACY = 100;
+	else if (FS_ACCURACY > 1000 && mtime % 2000 !== 0) FS_ACCURACY = 1000;
+};
+
+/**
+ * @template T
+ * @template K
+ * @param {Map<T, K>} a source map
+ * @param {Map<T, K>} b joining map
+ * @returns {Map<T, K>} joined map
+ */
+const mergeMaps = (a, b) => {
+	if (!b || b.size === 0) return a;
+	if (!a || a.size === 0) return b;
+	const map = new Map(a);
+	for (const [key, value] of b) {
+		map.set(key, value);
+	}
+	return map;
+};
+
+/**
+ * @template T
+ * @template K
+ * @param {Set<T, K>} a source map
+ * @param {Set<T, K>} b joining map
+ * @returns {Set<T, K>} joined map
+ */
+const mergeSets = (a, b) => {
+	if (!b || b.size === 0) return a;
+	if (!a || a.size === 0) return b;
+	const map = new Set(a);
+	for (const item of b) {
+		map.add(item);
+	}
+	return map;
+};
+
+/**
+ * Finding file or directory to manage
+ * @param {string} managedPath path that is managing by {@link FileSystemInfo}
+ * @param {string} path path to file or directory
+ * @returns {string|null} managed item
+ * @example
+ * getManagedItem(
+ *   '/Users/user/my-project/node_modules/',
+ *   '/Users/user/my-project/node_modules/package/index.js'
+ * ) === '/Users/user/my-project/node_modules/package'
+ * getManagedItem(
+ *   '/Users/user/my-project/node_modules/',
+ *   '/Users/user/my-project/node_modules/package1/node_modules/package2'
+ * ) === '/Users/user/my-project/node_modules/package1/node_modules/package2'
+ * getManagedItem(
+ *   '/Users/user/my-project/node_modules/',
+ *   '/Users/user/my-project/node_modules/.bin/script.js'
+ * ) === null // hidden files are disallowed as managed items
+ * getManagedItem(
+ *   '/Users/user/my-project/node_modules/',
+ *   '/Users/user/my-project/node_modules/package'
+ * ) === '/Users/user/my-project/node_modules/package'
+ */
+const getManagedItem = (managedPath, path) => {
+	let i = managedPath.length;
+	let slashes = 1;
+	let startingPosition = true;
+	loop: while (i < path.length) {
+		switch (path.charCodeAt(i)) {
+			case 47: // slash
+			case 92: // backslash
+				if (--slashes === 0) break loop;
+				startingPosition = true;
+				break;
+			case 46: // .
+				// hidden files are disallowed as managed items
+				// it's probably .yarn-integrity or .cache
+				if (startingPosition) return null;
+				break;
+			case 64: // @
+				if (!startingPosition) return null;
+				slashes++;
+				break;
+			default:
+				startingPosition = false;
+				break;
+		}
+		i++;
+	}
+	if (i === path.length) slashes--;
+	// return null when path is incomplete
+	if (slashes !== 0) return null;
+	// if (path.slice(i + 1, i + 13) === "node_modules")
+	if (
+		path.length >= i + 13 &&
+		path.charCodeAt(i + 1) === 110 &&
+		path.charCodeAt(i + 2) === 111 &&
+		path.charCodeAt(i + 3) === 100 &&
+		path.charCodeAt(i + 4) === 101 &&
+		path.charCodeAt(i + 5) === 95 &&
+		path.charCodeAt(i + 6) === 109 &&
+		path.charCodeAt(i + 7) === 111 &&
+		path.charCodeAt(i + 8) === 100 &&
+		path.charCodeAt(i + 9) === 117 &&
+		path.charCodeAt(i + 10) === 108 &&
+		path.charCodeAt(i + 11) === 101 &&
+		path.charCodeAt(i + 12) === 115
+	) {
+		// if this is the end of the path
+		if (path.length === i + 13) {
+			// return the node_modules directory
+			// it's special
+			return path;
+		}
+		const c = path.charCodeAt(i + 13);
+		// if next symbol is slash or backslash
+		if (c === 47 || c === 92) {
+			// Managed subpath
+			return getManagedItem(path.slice(0, i + 14), path);
+		}
+	}
+	return path.slice(0, i);
+};
+
+/**
+ * @template {ContextFileSystemInfoEntry | ContextTimestampAndHash} T
+ * @param {T} entry entry
+ * @returns {T["resolved"] | undefined} the resolved entry
+ */
+const getResolvedTimestamp = entry => {
+	if (entry === null) return null;
+	if (entry.resolved !== undefined) return entry.resolved;
+	return entry.symlinks === undefined ? entry : undefined;
+};
+
+/**
+ * @param {ContextHash} entry entry
+ * @returns {string | undefined} the resolved entry
+ */
+const getResolvedHash = entry => {
+	if (entry === null) return null;
+	if (entry.resolved !== undefined) return entry.resolved;
+	return entry.symlinks === undefined ? entry.hash : undefined;
+};
+
+const addAll = (source, target) => {
+	for (const key of source) target.add(key);
+};
+
+/**
+ * Used to access information about the filesystem in a cached way
+ */
+class FileSystemInfo {
+	/**
+	 * @param {InputFileSystem} fs file system
+	 * @param {Object} options options
+	 * @param {Iterable<string | RegExp>=} options.managedPaths paths that are only managed by a package manager
+	 * @param {Iterable<string | RegExp>=} options.immutablePaths paths that are immutable
+	 * @param {Logger=} options.logger logger used to log invalid snapshots
+	 * @param {string | Hash=} options.hashFunction the hash function to use
+	 */
+	constructor(
+		fs,
+		{
+			managedPaths = [],
+			immutablePaths = [],
+			logger,
+			hashFunction = "md4"
+		} = {}
+	) {
+		this.fs = fs;
+		this.logger = logger;
+		this._remainingLogs = logger ? 40 : 0;
+		this._loggedPaths = logger ? new Set() : undefined;
+		this._hashFunction = hashFunction;
+		/** @type {WeakMap<Snapshot, boolean | (function(WebpackError=, boolean=): void)[]>} */
+		this._snapshotCache = new WeakMap();
+		this._fileTimestampsOptimization = new SnapshotOptimization(
+			s => s.hasFileTimestamps(),
+			s => s.fileTimestamps,
+			(s, v) => s.setFileTimestamps(v)
+		);
+		this._fileHashesOptimization = new SnapshotOptimization(
+			s => s.hasFileHashes(),
+			s => s.fileHashes,
+			(s, v) => s.setFileHashes(v),
+			false
+		);
+		this._fileTshsOptimization = new SnapshotOptimization(
+			s => s.hasFileTshs(),
+			s => s.fileTshs,
+			(s, v) => s.setFileTshs(v)
+		);
+		this._contextTimestampsOptimization = new SnapshotOptimization(
+			s => s.hasContextTimestamps(),
+			s => s.contextTimestamps,
+			(s, v) => s.setContextTimestamps(v)
+		);
+		this._contextHashesOptimization = new SnapshotOptimization(
+			s => s.hasContextHashes(),
+			s => s.contextHashes,
+			(s, v) => s.setContextHashes(v),
+			false
+		);
+		this._contextTshsOptimization = new SnapshotOptimization(
+			s => s.hasContextTshs(),
+			s => s.contextTshs,
+			(s, v) => s.setContextTshs(v)
+		);
+		this._missingExistenceOptimization = new SnapshotOptimization(
+			s => s.hasMissingExistence(),
+			s => s.missingExistence,
+			(s, v) => s.setMissingExistence(v),
+			false
+		);
+		this._managedItemInfoOptimization = new SnapshotOptimization(
+			s => s.hasManagedItemInfo(),
+			s => s.managedItemInfo,
+			(s, v) => s.setManagedItemInfo(v),
+			false
+		);
+		this._managedFilesOptimization = new SnapshotOptimization(
+			s => s.hasManagedFiles(),
+			s => s.managedFiles,
+			(s, v) => s.setManagedFiles(v),
+			false,
+			true
+		);
+		this._managedContextsOptimization = new SnapshotOptimization(
+			s => s.hasManagedContexts(),
+			s => s.managedContexts,
+			(s, v) => s.setManagedContexts(v),
+			false,
+			true
+		);
+		this._managedMissingOptimization = new SnapshotOptimization(
+			s => s.hasManagedMissing(),
+			s => s.managedMissing,
+			(s, v) => s.setManagedMissing(v),
+			false,
+			true
+		);
+		/** @type {StackedCacheMap<string, FileSystemInfoEntry | "ignore" | null>} */
+		this._fileTimestamps = new StackedCacheMap();
+		/** @type {Map<string, string>} */
+		this._fileHashes = new Map();
+		/** @type {Map<string, TimestampAndHash | string>} */
+		this._fileTshs = new Map();
+		/** @type {StackedCacheMap<string, ContextFileSystemInfoEntry | "ignore" | null>} */
+		this._contextTimestamps = new StackedCacheMap();
+		/** @type {Map<string, ContextHash>} */
+		this._contextHashes = new Map();
+		/** @type {Map<string, ContextTimestampAndHash>} */
+		this._contextTshs = new Map();
+		/** @type {Map<string, string>} */
+		this._managedItems = new Map();
+		/** @type {AsyncQueue<string, string, FileSystemInfoEntry | null>} */
+		this.fileTimestampQueue = new AsyncQueue({
+			name: "file timestamp",
+			parallelism: 30,
+			processor: this._readFileTimestamp.bind(this)
+		});
+		/** @type {AsyncQueue<string, string, string | null>} */
+		this.fileHashQueue = new AsyncQueue({
+			name: "file hash",
+			parallelism: 10,
+			processor: this._readFileHash.bind(this)
+		});
+		/** @type {AsyncQueue<string, string, ContextFileSystemInfoEntry | null>} */
+		this.contextTimestampQueue = new AsyncQueue({
+			name: "context timestamp",
+			parallelism: 2,
+			processor: this._readContextTimestamp.bind(this)
+		});
+		/** @type {AsyncQueue<string, string, ContextHash | null>} */
+		this.contextHashQueue = new AsyncQueue({
+			name: "context hash",
+			parallelism: 2,
+			processor: this._readContextHash.bind(this)
+		});
+		/** @type {AsyncQueue<string, string, ContextTimestampAndHash | null>} */
+		this.contextTshQueue = new AsyncQueue({
+			name: "context hash and timestamp",
+			parallelism: 2,
+			processor: this._readContextTimestampAndHash.bind(this)
+		});
+		/** @type {AsyncQueue<string, string, string | null>} */
+		this.managedItemQueue = new AsyncQueue({
+			name: "managed item info",
+			parallelism: 10,
+			processor: this._getManagedItemInfo.bind(this)
+		});
+		/** @type {AsyncQueue<string, string, Set<string>>} */
+		this.managedItemDirectoryQueue = new AsyncQueue({
+			name: "managed item directory info",
+			parallelism: 10,
+			processor: this._getManagedItemDirectoryInfo.bind(this)
+		});
+		this.managedPaths = Array.from(managedPaths);
+		this.managedPathsWithSlash = /** @type {string[]} */ (
+			this.managedPaths.filter(p => typeof p === "string")
+		).map(p => join(fs, p, "_").slice(0, -1));
+
+		this.managedPathsRegExps = /** @type {RegExp[]} */ (
+			this.managedPaths.filter(p => typeof p !== "string")
+		);
+		this.immutablePaths = Array.from(immutablePaths);
+		this.immutablePathsWithSlash = /** @type {string[]} */ (
+			this.immutablePaths.filter(p => typeof p === "string")
+		).map(p => join(fs, p, "_").slice(0, -1));
+		this.immutablePathsRegExps = /** @type {RegExp[]} */ (
+			this.immutablePaths.filter(p => typeof p !== "string")
+		);
+
+		this._cachedDeprecatedFileTimestamps = undefined;
+		this._cachedDeprecatedContextTimestamps = undefined;
+
+		this._warnAboutExperimentalEsmTracking = false;
+
+		this._statCreatedSnapshots = 0;
+		this._statTestedSnapshotsCached = 0;
+		this._statTestedSnapshotsNotCached = 0;
+		this._statTestedChildrenCached = 0;
+		this._statTestedChildrenNotCached = 0;
+		this._statTestedEntries = 0;
+	}
+
+	logStatistics() {
+		const logWhenMessage = (header, message) => {
+			if (message) {
+				this.logger.log(`${header}: ${message}`);
+			}
+		};
+		this.logger.log(`${this._statCreatedSnapshots} new snapshots created`);
+		this.logger.log(
+			`${
+				this._statTestedSnapshotsNotCached &&
+				Math.round(
+					(this._statTestedSnapshotsNotCached * 100) /
+						(this._statTestedSnapshotsCached +
+							this._statTestedSnapshotsNotCached)
+				)
+			}% root snapshot uncached (${this._statTestedSnapshotsNotCached} / ${
+				this._statTestedSnapshotsCached + this._statTestedSnapshotsNotCached
+			})`
+		);
+		this.logger.log(
+			`${
+				this._statTestedChildrenNotCached &&
+				Math.round(
+					(this._statTestedChildrenNotCached * 100) /
+						(this._statTestedChildrenCached + this._statTestedChildrenNotCached)
+				)
+			}% children snapshot uncached (${this._statTestedChildrenNotCached} / ${
+				this._statTestedChildrenCached + this._statTestedChildrenNotCached
+			})`
+		);
+		this.logger.log(`${this._statTestedEntries} entries tested`);
+		this.logger.log(
+			`File info in cache: ${this._fileTimestamps.size} timestamps ${this._fileHashes.size} hashes ${this._fileTshs.size} timestamp hash combinations`
+		);
+		logWhenMessage(
+			`File timestamp snapshot optimization`,
+			this._fileTimestampsOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`File hash snapshot optimization`,
+			this._fileHashesOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`File timestamp hash combination snapshot optimization`,
+			this._fileTshsOptimization.getStatisticMessage()
+		);
+		this.logger.log(
+			`Directory info in cache: ${this._contextTimestamps.size} timestamps ${this._contextHashes.size} hashes ${this._contextTshs.size} timestamp hash combinations`
+		);
+		logWhenMessage(
+			`Directory timestamp snapshot optimization`,
+			this._contextTimestampsOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`Directory hash snapshot optimization`,
+			this._contextHashesOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`Directory timestamp hash combination snapshot optimization`,
+			this._contextTshsOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`Missing items snapshot optimization`,
+			this._missingExistenceOptimization.getStatisticMessage()
+		);
+		this.logger.log(
+			`Managed items info in cache: ${this._managedItems.size} items`
+		);
+		logWhenMessage(
+			`Managed items snapshot optimization`,
+			this._managedItemInfoOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`Managed files snapshot optimization`,
+			this._managedFilesOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`Managed contexts snapshot optimization`,
+			this._managedContextsOptimization.getStatisticMessage()
+		);
+		logWhenMessage(
+			`Managed missing snapshot optimization`,
+			this._managedMissingOptimization.getStatisticMessage()
+		);
+	}
+
+	_log(path, reason, ...args) {
+		const key = path + reason;
+		if (this._loggedPaths.has(key)) return;
+		this._loggedPaths.add(key);
+		this.logger.debug(`${path} invalidated because ${reason}`, ...args);
+		if (--this._remainingLogs === 0) {
+			this.logger.debug(
+				"Logging limit has been reached and no further logging will be emitted by FileSystemInfo"
+			);
+		}
+	}
+
+	clear() {
+		this._remainingLogs = this.logger ? 40 : 0;
+		if (this._loggedPaths !== undefined) this._loggedPaths.clear();
+
+		this._snapshotCache = new WeakMap();
+		this._fileTimestampsOptimization.clear();
+		this._fileHashesOptimization.clear();
+		this._fileTshsOptimization.clear();
+		this._contextTimestampsOptimization.clear();
+		this._contextHashesOptimization.clear();
+		this._contextTshsOptimization.clear();
+		this._missingExistenceOptimization.clear();
+		this._managedItemInfoOptimization.clear();
+		this._managedFilesOptimization.clear();
+		this._managedContextsOptimization.clear();
+		this._managedMissingOptimization.clear();
+		this._fileTimestamps.clear();
+		this._fileHashes.clear();
+		this._fileTshs.clear();
+		this._contextTimestamps.clear();
+		this._contextHashes.clear();
+		this._contextTshs.clear();
+		this._managedItems.clear();
+		this._managedItems.clear();
+
+		this._cachedDeprecatedFileTimestamps = undefined;
+		this._cachedDeprecatedContextTimestamps = undefined;
+
+		this._statCreatedSnapshots = 0;
+		this._statTestedSnapshotsCached = 0;
+		this._statTestedSnapshotsNotCached = 0;
+		this._statTestedChildrenCached = 0;
+		this._statTestedChildrenNotCached = 0;
+		this._statTestedEntries = 0;
+	}
+
+	/**
+	 * @param {ReadonlyMap<string, FileSystemInfoEntry | "ignore" | null>} map timestamps
+	 * @param {boolean=} immutable if 'map' is immutable and FileSystemInfo can keep referencing it
+	 * @returns {void}
+	 */
+	addFileTimestamps(map, immutable) {
+		this._fileTimestamps.addAll(map, immutable);
+		this._cachedDeprecatedFileTimestamps = undefined;
+	}
+
+	/**
+	 * @param {ReadonlyMap<string, FileSystemInfoEntry | "ignore" | null>} map timestamps
+	 * @param {boolean=} immutable if 'map' is immutable and FileSystemInfo can keep referencing it
+	 * @returns {void}
+	 */
+	addContextTimestamps(map, immutable) {
+		this._contextTimestamps.addAll(map, immutable);
+		this._cachedDeprecatedContextTimestamps = undefined;
+	}
+
+	/**
+	 * @param {string} path file path
+	 * @param {function((WebpackError | null)=, (FileSystemInfoEntry | "ignore" | null)=): void} callback callback function
+	 * @returns {void}
+	 */
+	getFileTimestamp(path, callback) {
+		const cache = this._fileTimestamps.get(path);
+		if (cache !== undefined) return callback(null, cache);
+		this.fileTimestampQueue.add(path, callback);
+	}
+
+	/**
+	 * @param {string} path context path
+	 * @param {function((WebpackError | null)=, (ResolvedContextFileSystemInfoEntry | "ignore" | null)=): void} callback callback function
+	 * @returns {void}
+	 */
+	getContextTimestamp(path, callback) {
+		const cache = this._contextTimestamps.get(path);
+		if (cache !== undefined) {
+			if (cache === "ignore") return callback(null, "ignore");
+			const resolved = getResolvedTimestamp(cache);
+			if (resolved !== undefined) return callback(null, resolved);
+			return this._resolveContextTimestamp(cache, callback);
+		}
+		this.contextTimestampQueue.add(path, (err, entry) => {
+			if (err) return callback(err);
+			const resolved = getResolvedTimestamp(entry);
+			if (resolved !== undefined) return callback(null, resolved);
+			this._resolveContextTimestamp(entry, callback);
+		});
+	}
+
+	/**
+	 * @param {string} path context path
+	 * @param {function((WebpackError | null)=, (ContextFileSystemInfoEntry | "ignore" | null)=): void} callback callback function
+	 * @returns {void}
+	 */
+	_getUnresolvedContextTimestamp(path, callback) {
+		const cache = this._contextTimestamps.get(path);
+		if (cache !== undefined) return callback(null, cache);
+		this.contextTimestampQueue.add(path, callback);
+	}
+
+	/**
+	 * @param {string} path file path
+	 * @param {function((WebpackError | null)=, string=): void} callback callback function
+	 * @returns {void}
+	 */
+	getFileHash(path, callback) {
+		const cache = this._fileHashes.get(path);
+		if (cache !== undefined) return callback(null, cache);
+		this.fileHashQueue.add(path, callback);
+	}
+
+	/**
+	 * @param {string} path context path
+	 * @param {function((WebpackError | null)=, string=): void} callback callback function
+	 * @returns {void}
+	 */
+	getContextHash(path, callback) {
+		const cache = this._contextHashes.get(path);
+		if (cache !== undefined) {
+			const resolved = getResolvedHash(cache);
+			if (resolved !== undefined) return callback(null, resolved);
+			return this._resolveContextHash(cache, callback);
+		}
+		this.contextHashQueue.add(path, (err, entry) => {
+			if (err) return callback(err);
+			const resolved = getResolvedHash(entry);
+			if (resolved !== undefined) return callback(null, resolved);
+			this._resolveContextHash(entry, callback);
+		});
+	}
+
+	/**
+	 * @param {string} path context path
+	 * @param {function((WebpackError | null)=, ContextHash=): void} callback callback function
+	 * @returns {void}
+	 */
+	_getUnresolvedContextHash(path, callback) {
+		const cache = this._contextHashes.get(path);
+		if (cache !== undefined) return callback(null, cache);
+		this.contextHashQueue.add(path, callback);
+	}
+
+	/**
+	 * @param {string} path context path
+	 * @param {function((WebpackError | null)=, ResolvedContextTimestampAndHash=): void} callback callback function
+	 * @returns {void}
+	 */
+	getContextTsh(path, callback) {
+		const cache = this._contextTshs.get(path);
+		if (cache !== undefined) {
+			const resolved = getResolvedTimestamp(cache);
+			if (resolved !== undefined) return callback(null, resolved);
+			return this._resolveContextTsh(cache, callback);
+		}
+		this.contextTshQueue.add(path, (err, entry) => {
+			if (err) return callback(err);
+			const resolved = getResolvedTimestamp(entry);
+			if (resolved !== undefined) return callback(null, resolved);
+			this._resolveContextTsh(entry, callback);
+		});
+	}
+
+	/**
+	 * @param {string} path context path
+	 * @param {function((WebpackError | null)=, ContextTimestampAndHash=): void} callback callback function
+	 * @returns {void}
+	 */
+	_getUnresolvedContextTsh(path, callback) {
+		const cache = this._contextTshs.get(path);
+		if (cache !== undefined) return callback(null, cache);
+		this.contextTshQueue.add(path, callback);
+	}
+
+	_createBuildDependenciesResolvers() {
+		const resolveContext = createResolver({
+			resolveToContext: true,
+			exportsFields: [],
+			fileSystem: this.fs
+		});
+		const resolveCjs = createResolver({
+			extensions: [".js", ".json", ".node"],
+			conditionNames: ["require", "node"],
+			exportsFields: ["exports"],
+			fileSystem: this.fs
+		});
+		const resolveCjsAsChild = createResolver({
+			extensions: [".js", ".json", ".node"],
+			conditionNames: ["require", "node"],
+			exportsFields: [],
+			fileSystem: this.fs
+		});
+		const resolveEsm = createResolver({
+			extensions: [".js", ".json", ".node"],
+			fullySpecified: true,
+			conditionNames: ["import", "node"],
+			exportsFields: ["exports"],
+			fileSystem: this.fs
+		});
+		return { resolveContext, resolveEsm, resolveCjs, resolveCjsAsChild };
+	}
+
+	/**
+	 * @param {string} context context directory
+	 * @param {Iterable<string>} deps dependencies
+	 * @param {function((Error | null)=, ResolveBuildDependenciesResult=): void} callback callback function
+	 * @returns {void}
+	 */
+	resolveBuildDependencies(context, deps, callback) {
+		const { resolveContext, resolveEsm, resolveCjs, resolveCjsAsChild } =
+			this._createBuildDependenciesResolvers();
+
+		/** @type {Set<string>} */
+		const files = new Set();
+		/** @type {Set<string>} */
+		const fileSymlinks = new Set();
+		/** @type {Set<string>} */
+		const directories = new Set();
+		/** @type {Set<string>} */
+		const directorySymlinks = new Set();
+		/** @type {Set<string>} */
+		const missing = new Set();
+		/** @type {Set<string>} */
+		const resolveFiles = new Set();
+		/** @type {Set<string>} */
+		const resolveDirectories = new Set();
+		/** @type {Set<string>} */
+		const resolveMissing = new Set();
+		/** @type {Map<string, string | false>} */
+		const resolveResults = new Map();
+		const invalidResolveResults = new Set();
+		const resolverContext = {
+			fileDependencies: resolveFiles,
+			contextDependencies: resolveDirectories,
+			missingDependencies: resolveMissing
+		};
+		const expectedToString = expected => {
+			return expected ? ` (expected ${expected})` : "";
+		};
+		const jobToString = job => {
+			switch (job.type) {
+				case RBDT_RESOLVE_CJS:
+					return `resolve commonjs ${job.path}${expectedToString(
+						job.expected
+					)}`;
+				case RBDT_RESOLVE_ESM:
+					return `resolve esm ${job.path}${expectedToString(job.expected)}`;
+				case RBDT_RESOLVE_DIRECTORY:
+					return `resolve directory ${job.path}`;
+				case RBDT_RESOLVE_CJS_FILE:
+					return `resolve commonjs file ${job.path}${expectedToString(
+						job.expected
+					)}`;
+				case RBDT_RESOLVE_ESM_FILE:
+					return `resolve esm file ${job.path}${expectedToString(
+						job.expected
+					)}`;
+				case RBDT_DIRECTORY:
+					return `directory ${job.path}`;
+				case RBDT_FILE:
+					return `file ${job.path}`;
+				case RBDT_DIRECTORY_DEPENDENCIES:
+					return `directory dependencies ${job.path}`;
+				case RBDT_FILE_DEPENDENCIES:
+					return `file dependencies ${job.path}`;
+			}
+			return `unknown ${job.type} ${job.path}`;
+		};
+		const pathToString = job => {
+			let result = ` at ${jobToString(job)}`;
+			job = job.issuer;
+			while (job !== undefined) {
+				result += `\n at ${jobToString(job)}`;
+				job = job.issuer;
+			}
+			return result;
+		};
+		processAsyncTree(
+			Array.from(deps, dep => ({
+				type: RBDT_RESOLVE_CJS,
+				context,
+				path: dep,
+				expected: undefined,
+				issuer: undefined
+			})),
+			20,
+			(job, push, callback) => {
+				const { type, context, path, expected } = job;
+				const resolveDirectory = path => {
+					const key = `d\n${context}\n${path}`;
+					if (resolveResults.has(key)) {
+						return callback();
+					}
+					resolveResults.set(key, undefined);
+					resolveContext(context, path, resolverContext, (err, _, result) => {
+						if (err) {
+							if (expected === false) {
+								resolveResults.set(key, false);
+								return callback();
+							}
+							invalidResolveResults.add(key);
+							err.message += `\nwhile resolving '${path}' in ${context} to a directory`;
+							return callback(err);
+						}
+						const resultPath = result.path;
+						resolveResults.set(key, resultPath);
+						push({
+							type: RBDT_DIRECTORY,
+							context: undefined,
+							path: resultPath,
+							expected: undefined,
+							issuer: job
+						});
+						callback();
+					});
+				};
+				const resolveFile = (path, symbol, resolve) => {
+					const key = `${symbol}\n${context}\n${path}`;
+					if (resolveResults.has(key)) {
+						return callback();
+					}
+					resolveResults.set(key, undefined);
+					resolve(context, path, resolverContext, (err, _, result) => {
+						if (typeof expected === "string") {
+							if (!err && result && result.path === expected) {
+								resolveResults.set(key, result.path);
+							} else {
+								invalidResolveResults.add(key);
+								this.logger.warn(
+									`Resolving '${path}' in ${context} for build dependencies doesn't lead to expected result '${expected}', but to '${
+										err || (result && result.path)
+									}' instead. Resolving dependencies are ignored for this path.\n${pathToString(
+										job
+									)}`
+								);
+							}
+						} else {
+							if (err) {
+								if (expected === false) {
+									resolveResults.set(key, false);
+									return callback();
+								}
+								invalidResolveResults.add(key);
+								err.message += `\nwhile resolving '${path}' in ${context} as file\n${pathToString(
+									job
+								)}`;
+								return callback(err);
+							}
+							const resultPath = result.path;
+							resolveResults.set(key, resultPath);
+							push({
+								type: RBDT_FILE,
+								context: undefined,
+								path: resultPath,
+								expected: undefined,
+								issuer: job
+							});
+						}
+						callback();
+					});
+				};
+				switch (type) {
+					case RBDT_RESOLVE_CJS: {
+						const isDirectory = /[\\/]$/.test(path);
+						if (isDirectory) {
+							resolveDirectory(path.slice(0, path.length - 1));
+						} else {
+							resolveFile(path, "f", resolveCjs);
+						}
+						break;
+					}
+					case RBDT_RESOLVE_ESM: {
+						const isDirectory = /[\\/]$/.test(path);
+						if (isDirectory) {
+							resolveDirectory(path.slice(0, path.length - 1));
+						} else {
+							resolveFile(path);
+						}
+						break;
+					}
+					case RBDT_RESOLVE_DIRECTORY: {
+						resolveDirectory(path);
+						break;
+					}
+					case RBDT_RESOLVE_CJS_FILE: {
+						resolveFile(path, "f", resolveCjs);
+						break;
+					}
+					case RBDT_RESOLVE_CJS_FILE_AS_CHILD: {
+						resolveFile(path, "c", resolveCjsAsChild);
+						break;
+					}
+					case RBDT_RESOLVE_ESM_FILE: {
+						resolveFile(path, "e", resolveEsm);
+						break;
+					}
+					case RBDT_FILE: {
+						if (files.has(path)) {
+							callback();
+							break;
+						}
+						files.add(path);
+						this.fs.realpath(path, (err, _realPath) => {
+							if (err) return callback(err);
+							const realPath = /** @type {string} */ (_realPath);
+							if (realPath !== path) {
+								fileSymlinks.add(path);
+								resolveFiles.add(path);
+								if (files.has(realPath)) return callback();
+								files.add(realPath);
+							}
+							push({
+								type: RBDT_FILE_DEPENDENCIES,
+								context: undefined,
+								path: realPath,
+								expected: undefined,
+								issuer: job
+							});
+							callback();
+						});
+						break;
+					}
+					case RBDT_DIRECTORY: {
+						if (directories.has(path)) {
+							callback();
+							break;
+						}
+						directories.add(path);
+						this.fs.realpath(path, (err, _realPath) => {
+							if (err) return callback(err);
+							const realPath = /** @type {string} */ (_realPath);
+							if (realPath !== path) {
+								directorySymlinks.add(path);
+								resolveFiles.add(path);
+								if (directories.has(realPath)) return callback();
+								directories.add(realPath);
+							}
+							push({
+								type: RBDT_DIRECTORY_DEPENDENCIES,
+								context: undefined,
+								path: realPath,
+								expected: undefined,
+								issuer: job
+							});
+							callback();
+						});
+						break;
+					}
+					case RBDT_FILE_DEPENDENCIES: {
+						// Check for known files without dependencies
+						if (/\.json5?$|\.yarn-integrity$|yarn\.lock$|\.ya?ml/.test(path)) {
+							process.nextTick(callback);
+							break;
+						}
+						// Check commonjs cache for the module
+						/** @type {NodeModule} */
+						const module = require.cache[path];
+						if (module && Array.isArray(module.children)) {
+							children: for (const child of module.children) {
+								let childPath = child.filename;
+								if (childPath) {
+									push({
+										type: RBDT_FILE,
+										context: undefined,
+										path: childPath,
+										expected: undefined,
+										issuer: job
+									});
+									const context = dirname(this.fs, path);
+									for (const modulePath of module.paths) {
+										if (childPath.startsWith(modulePath)) {
+											let subPath = childPath.slice(modulePath.length + 1);
+											const packageMatch = /^(@[^\\/]+[\\/])[^\\/]+/.exec(
+												subPath
+											);
+											if (packageMatch) {
+												push({
+													type: RBDT_FILE,
+													context: undefined,
+													path:
+														modulePath +
+														childPath[modulePath.length] +
+														packageMatch[0] +
+														childPath[modulePath.length] +
+														"package.json",
+													expected: false,
+													issuer: job
+												});
+											}
+											let request = subPath.replace(/\\/g, "/");
+											if (request.endsWith(".js"))
+												request = request.slice(0, -3);
+											push({
+												type: RBDT_RESOLVE_CJS_FILE_AS_CHILD,
+												context,
+												path: request,
+												expected: child.filename,
+												issuer: job
+											});
+											continue children;
+										}
+									}
+									let request = relative(this.fs, context, childPath);
+									if (request.endsWith(".js")) request = request.slice(0, -3);
+									request = request.replace(/\\/g, "/");
+									if (!request.startsWith("../")) request = `./${request}`;
+									push({
+										type: RBDT_RESOLVE_CJS_FILE,
+										context,
+										path: request,
+										expected: child.filename,
+										issuer: job
+									});
+								}
+							}
+						} else if (supportsEsm && /\.m?js$/.test(path)) {
+							if (!this._warnAboutExperimentalEsmTracking) {
+								this.logger.log(
+									"Node.js doesn't offer a (nice) way to introspect the ESM dependency graph yet.\n" +
+										"Until a full solution is available webpack uses an experimental ESM tracking based on parsing.\n" +
+										"As best effort webpack parses the ESM files to guess dependencies. But this can lead to expensive and incorrect tracking."
+								);
+								this._warnAboutExperimentalEsmTracking = true;
+							}
+							const lexer = require("es-module-lexer");
+							lexer.init.then(() => {
+								this.fs.readFile(path, (err, content) => {
+									if (err) return callback(err);
+									try {
+										const context = dirname(this.fs, path);
+										const source = content.toString();
+										const [imports] = lexer.parse(source);
+										for (const imp of imports) {
+											try {
+												let dependency;
+												if (imp.d === -1) {
+													// import ... from "..."
+													dependency = parseString(
+														source.substring(imp.s - 1, imp.e + 1)
+													);
+												} else if (imp.d > -1) {
+													// import()
+													let expr = source.substring(imp.s, imp.e).trim();
+													dependency = parseString(expr);
+												} else {
+													// e.g. import.meta
+													continue;
+												}
+												push({
+													type: RBDT_RESOLVE_ESM_FILE,
+													context,
+													path: dependency,
+													expected: undefined,
+													issuer: job
+												});
+											} catch (e) {
+												this.logger.warn(
+													`Parsing of ${path} for build dependencies failed at 'import(${source.substring(
+														imp.s,
+														imp.e
+													)})'.\n` +
+														"Build dependencies behind this expression are ignored and might cause incorrect cache invalidation."
+												);
+												this.logger.debug(pathToString(job));
+												this.logger.debug(e.stack);
+											}
+										}
+									} catch (e) {
+										this.logger.warn(
+											`Parsing of ${path} for build dependencies failed and all dependencies of this file are ignored, which might cause incorrect cache invalidation..`
+										);
+										this.logger.debug(pathToString(job));
+										this.logger.debug(e.stack);
+									}
+									process.nextTick(callback);
+								});
+							}, callback);
+							break;
+						} else {
+							this.logger.log(
+								`Assuming ${path} has no dependencies as we were unable to assign it to any module system.`
+							);
+							this.logger.debug(pathToString(job));
+						}
+						process.nextTick(callback);
+						break;
+					}
+					case RBDT_DIRECTORY_DEPENDENCIES: {
+						const match =
+							/(^.+[\\/]node_modules[\\/](?:@[^\\/]+[\\/])?[^\\/]+)/.exec(path);
+						const packagePath = match ? match[1] : path;
+						const packageJson = join(this.fs, packagePath, "package.json");
+						this.fs.readFile(packageJson, (err, content) => {
+							if (err) {
+								if (err.code === "ENOENT") {
+									resolveMissing.add(packageJson);
+									const parent = dirname(this.fs, packagePath);
+									if (parent !== packagePath) {
+										push({
+											type: RBDT_DIRECTORY_DEPENDENCIES,
+											context: undefined,
+											path: parent,
+											expected: undefined,
+											issuer: job
+										});
+									}
+									callback();
+									return;
+								}
+								return callback(err);
+							}
+							resolveFiles.add(packageJson);
+							let packageData;
+							try {
+								packageData = JSON.parse(content.toString("utf-8"));
+							} catch (e) {
+								return callback(e);
+							}
+							const depsObject = packageData.dependencies;
+							const optionalDepsObject = packageData.optionalDependencies;
+							const allDeps = new Set();
+							const optionalDeps = new Set();
+							if (typeof depsObject === "object" && depsObject) {
+								for (const dep of Object.keys(depsObject)) {
+									allDeps.add(dep);
+								}
+							}
+							if (
+								typeof optionalDepsObject === "object" &&
+								optionalDepsObject
+							) {
+								for (const dep of Object.keys(optionalDepsObject)) {
+									allDeps.add(dep);
+									optionalDeps.add(dep);
+								}
+							}
+							for (const dep of allDeps) {
+								push({
+									type: RBDT_RESOLVE_DIRECTORY,
+									context: packagePath,
+									path: dep,
+									expected: !optionalDeps.has(dep),
+									issuer: job
+								});
+							}
+							callback();
+						});
+						break;
+					}
+				}
+			},
+			err => {
+				if (err) return callback(err);
+				for (const l of fileSymlinks) files.delete(l);
+				for (const l of directorySymlinks) directories.delete(l);
+				for (const k of invalidResolveResults) resolveResults.delete(k);
+				callback(null, {
+					files,
+					directories,
+					missing,
+					resolveResults,
+					resolveDependencies: {
+						files: resolveFiles,
+						directories: resolveDirectories,
+						missing: resolveMissing
+					}
+				});
+			}
+		);
+	}
+
+	/**
+	 * @param {Map<string, string | false>} resolveResults results from resolving
+	 * @param {function((Error | null)=, boolean=): void} callback callback with true when resolveResults resolve the same way
+	 * @returns {void}
+	 */
+	checkResolveResultsValid(resolveResults, callback) {
+		const { resolveCjs, resolveCjsAsChild, resolveEsm, resolveContext } =
+			this._createBuildDependenciesResolvers();
+		asyncLib.eachLimit(
+			resolveResults,
+			20,
+			([key, expectedResult], callback) => {
+				const [type, context, path] = key.split("\n");
+				switch (type) {
+					case "d":
+						resolveContext(context, path, {}, (err, _, result) => {
+							if (expectedResult === false)
+								return callback(err ? undefined : INVALID);
+							if (err) return callback(err);
+							const resultPath = result.path;
+							if (resultPath !== expectedResult) return callback(INVALID);
+							callback();
+						});
+						break;
+					case "f":
+						resolveCjs(context, path, {}, (err, _, result) => {
+							if (expectedResult === false)
+								return callback(err ? undefined : INVALID);
+							if (err) return callback(err);
+							const resultPath = result.path;
+							if (resultPath !== expectedResult) return callback(INVALID);
+							callback();
+						});
+						break;
+					case "c":
+						resolveCjsAsChild(context, path, {}, (err, _, result) => {
+							if (expectedResult === false)
+								return callback(err ? undefined : INVALID);
+							if (err) return callback(err);
+							const resultPath = result.path;
+							if (resultPath !== expectedResult) return callback(INVALID);
+							callback();
+						});
+						break;
+					case "e":
+						resolveEsm(context, path, {}, (err, _, result) => {
+							if (expectedResult === false)
+								return callback(err ? undefined : INVALID);
+							if (err) return callback(err);
+							const resultPath = result.path;
+							if (resultPath !== expectedResult) return callback(INVALID);
+							callback();
+						});
+						break;
+					default:
+						callback(new Error("Unexpected type in resolve result key"));
+						break;
+				}
+			},
+			/**
+			 * @param {Error | typeof INVALID=} err error or invalid flag
+			 * @returns {void}
+			 */
+			err => {
+				if (err === INVALID) {
+					return callback(null, false);
+				}
+				if (err) {
+					return callback(err);
+				}
+				return callback(null, true);
+			}
+		);
+	}
+
+	/**
+	 *
+	 * @param {number} startTime when processing the files has started
+	 * @param {Iterable<string>} files all files
+	 * @param {Iterable<string>} directories all directories
+	 * @param {Iterable<string>} missing all missing files or directories
+	 * @param {Object} options options object (for future extensions)
+	 * @param {boolean=} options.hash should use hash to snapshot
+	 * @param {boolean=} options.timestamp should use timestamp to snapshot
+	 * @param {function((WebpackError | null)=, (Snapshot | null)=): void} callback callback function
+	 * @returns {void}
+	 */
+	createSnapshot(startTime, files, directories, missing, options, callback) {
+		/** @type {Map<string, FileSystemInfoEntry | null>} */
+		const fileTimestamps = new Map();
+		/** @type {Map<string, string | null>} */
+		const fileHashes = new Map();
+		/** @type {Map<string, TimestampAndHash | string | null>} */
+		const fileTshs = new Map();
+		/** @type {Map<string, FileSystemInfoEntry | null>} */
+		const contextTimestamps = new Map();
+		/** @type {Map<string, string | null>} */
+		const contextHashes = new Map();
+		/** @type {Map<string, ResolvedContextTimestampAndHash | null>} */
+		const contextTshs = new Map();
+		/** @type {Map<string, boolean>} */
+		const missingExistence = new Map();
+		/** @type {Map<string, string>} */
+		const managedItemInfo = new Map();
+		/** @type {Set<string>} */
+		const managedFiles = new Set();
+		/** @type {Set<string>} */
+		const managedContexts = new Set();
+		/** @type {Set<string>} */
+		const managedMissing = new Set();
+		/** @type {Set<Snapshot>} */
+		const children = new Set();
+
+		const snapshot = new Snapshot();
+		if (startTime) snapshot.setStartTime(startTime);
+
+		/** @type {Set<string>} */
+		const managedItems = new Set();
+
+		/** 1 = timestamp, 2 = hash, 3 = timestamp + hash */
+		const mode = options && options.hash ? (options.timestamp ? 3 : 2) : 1;
+
+		let jobs = 1;
+		const jobDone = () => {
+			if (--jobs === 0) {
+				if (fileTimestamps.size !== 0) {
+					snapshot.setFileTimestamps(fileTimestamps);
+				}
+				if (fileHashes.size !== 0) {
+					snapshot.setFileHashes(fileHashes);
+				}
+				if (fileTshs.size !== 0) {
+					snapshot.setFileTshs(fileTshs);
+				}
+				if (contextTimestamps.size !== 0) {
+					snapshot.setContextTimestamps(contextTimestamps);
+				}
+				if (contextHashes.size !== 0) {
+					snapshot.setContextHashes(contextHashes);
+				}
+				if (contextTshs.size !== 0) {
+					snapshot.setContextTshs(contextTshs);
+				}
+				if (missingExistence.size !== 0) {
+					snapshot.setMissingExistence(missingExistence);
+				}
+				if (managedItemInfo.size !== 0) {
+					snapshot.setManagedItemInfo(managedItemInfo);
+				}
+				this._managedFilesOptimization.optimize(snapshot, managedFiles);
+				if (managedFiles.size !== 0) {
+					snapshot.setManagedFiles(managedFiles);
+				}
+				this._managedContextsOptimization.optimize(snapshot, managedContexts);
+				if (managedContexts.size !== 0) {
+					snapshot.setManagedContexts(managedContexts);
+				}
+				this._managedMissingOptimization.optimize(snapshot, managedMissing);
+				if (managedMissing.size !== 0) {
+					snapshot.setManagedMissing(managedMissing);
+				}
+				if (children.size !== 0) {
+					snapshot.setChildren(children);
+				}
+				this._snapshotCache.set(snapshot, true);
+				this._statCreatedSnapshots++;
+
+				callback(null, snapshot);
+			}
+		};
+		const jobError = () => {
+			if (jobs > 0) {
+				// large negative number instead of NaN or something else to keep jobs to stay a SMI (v8)
+				jobs = -100000000;
+				callback(null, null);
+			}
+		};
+		const checkManaged = (path, managedSet) => {
+			for (const immutablePath of this.immutablePathsRegExps) {
+				if (immutablePath.test(path)) {
+					managedSet.add(path);
+					return true;
+				}
+			}
+			for (const immutablePath of this.immutablePathsWithSlash) {
+				if (path.startsWith(immutablePath)) {
+					managedSet.add(path);
+					return true;
+				}
+			}
+			for (const managedPath of this.managedPathsRegExps) {
+				const match = managedPath.exec(path);
+				if (match) {
+					const managedItem = getManagedItem(match[1], path);
+					if (managedItem) {
+						managedItems.add(managedItem);
+						managedSet.add(path);
+						return true;
+					}
+				}
+			}
+			for (const managedPath of this.managedPathsWithSlash) {
+				if (path.startsWith(managedPath)) {
+					const managedItem = getManagedItem(managedPath, path);
+					if (managedItem) {
+						managedItems.add(managedItem);
+						managedSet.add(path);
+						return true;
+					}
+				}
+			}
+			return false;
+		};
+		const captureNonManaged = (items, managedSet) => {
+			const capturedItems = new Set();
+			for (const path of items) {
+				if (!checkManaged(path, managedSet)) capturedItems.add(path);
+			}
+			return capturedItems;
+		};
+		const processCapturedFiles = capturedFiles => {
+			switch (mode) {
+				case 3:
+					this._fileTshsOptimization.optimize(snapshot, capturedFiles);
+					for (const path of capturedFiles) {
+						const cache = this._fileTshs.get(path);
+						if (cache !== undefined) {
+							fileTshs.set(path, cache);
+						} else {
+							jobs++;
+							this._getFileTimestampAndHash(path, (err, entry) => {
+								if (err) {
+									if (this.logger) {
+										this.logger.debug(
+											`Error snapshotting file timestamp hash combination of ${path}: ${err.stack}`
+										);
+									}
+									jobError();
+								} else {
+									fileTshs.set(path, entry);
+									jobDone();
+								}
+							});
+						}
+					}
+					break;
+				case 2:
+					this._fileHashesOptimization.optimize(snapshot, capturedFiles);
+					for (const path of capturedFiles) {
+						const cache = this._fileHashes.get(path);
+						if (cache !== undefined) {
+							fileHashes.set(path, cache);
+						} else {
+							jobs++;
+							this.fileHashQueue.add(path, (err, entry) => {
+								if (err) {
+									if (this.logger) {
+										this.logger.debug(
+											`Error snapshotting file hash of ${path}: ${err.stack}`
+										);
+									}
+									jobError();
+								} else {
+									fileHashes.set(path, entry);
+									jobDone();
+								}
+							});
+						}
+					}
+					break;
+				case 1:
+					this._fileTimestampsOptimization.optimize(snapshot, capturedFiles);
+					for (const path of capturedFiles) {
+						const cache = this._fileTimestamps.get(path);
+						if (cache !== undefined) {
+							if (cache !== "ignore") {
+								fileTimestamps.set(path, cache);
+							}
+						} else {
+							jobs++;
+							this.fileTimestampQueue.add(path, (err, entry) => {
+								if (err) {
+									if (this.logger) {
+										this.logger.debug(
+											`Error snapshotting file timestamp of ${path}: ${err.stack}`
+										);
+									}
+									jobError();
+								} else {
+									fileTimestamps.set(path, entry);
+									jobDone();
+								}
+							});
+						}
+					}
+					break;
+			}
+		};
+		if (files) {
+			processCapturedFiles(captureNonManaged(files, managedFiles));
+		}
+		const processCapturedDirectories = capturedDirectories => {
+			switch (mode) {
+				case 3:
+					this._contextTshsOptimization.optimize(snapshot, capturedDirectories);
+					for (const path of capturedDirectories) {
+						const cache = this._contextTshs.get(path);
+						/** @type {ResolvedContextTimestampAndHash} */
+						let resolved;
+						if (
+							cache !== undefined &&
+							(resolved = getResolvedTimestamp(cache)) !== undefined
+						) {
+							contextTshs.set(path, resolved);
+						} else {
+							jobs++;
+							/**
+							 * @param {Error=} err error
+							 * @param {ResolvedContextTimestampAndHash=} entry entry
+							 * @returns {void}
+							 */
+							const callback = (err, entry) => {
+								if (err) {
+									if (this.logger) {
+										this.logger.debug(
+											`Error snapshotting context timestamp hash combination of ${path}: ${err.stack}`
+										);
+									}
+									jobError();
+								} else {
+									contextTshs.set(path, entry);
+									jobDone();
+								}
+							};
+							if (cache !== undefined) {
+								this._resolveContextTsh(cache, callback);
+							} else {
+								this.getContextTsh(path, callback);
+							}
+						}
+					}
+					break;
+				case 2:
+					this._contextHashesOptimization.optimize(
+						snapshot,
+						capturedDirectories
+					);
+					for (const path of capturedDirectories) {
+						const cache = this._contextHashes.get(path);
+						let resolved;
+						if (
+							cache !== undefined &&
+							(resolved = getResolvedHash(cache)) !== undefined
+						) {
+							contextHashes.set(path, resolved);
+						} else {
+							jobs++;
+							const callback = (err, entry) => {
+								if (err) {
+									if (this.logger) {
+										this.logger.debug(
+											`Error snapshotting context hash of ${path}: ${err.stack}`
+										);
+									}
+									jobError();
+								} else {
+									contextHashes.set(path, entry);
+									jobDone();
+								}
+							};
+							if (cache !== undefined) {
+								this._resolveContextHash(cache, callback);
+							} else {
+								this.getContextHash(path, callback);
+							}
+						}
+					}
+					break;
+				case 1:
+					this._contextTimestampsOptimization.optimize(
+						snapshot,
+						capturedDirectories
+					);
+					for (const path of capturedDirectories) {
+						const cache = this._contextTimestamps.get(path);
+						if (cache === "ignore") continue;
+						let resolved;
+						if (
+							cache !== undefined &&
+							(resolved = getResolvedTimestamp(cache)) !== undefined
+						) {
+							contextTimestamps.set(path, resolved);
+						} else {
+							jobs++;
+							/**
+							 * @param {Error=} err error
+							 * @param {ResolvedContextFileSystemInfoEntry=} entry entry
+							 * @returns {void}
+							 */
+							const callback = (err, entry) => {
+								if (err) {
+									if (this.logger) {
+										this.logger.debug(
+											`Error snapshotting context timestamp of ${path}: ${err.stack}`
+										);
+									}
+									jobError();
+								} else {
+									contextTimestamps.set(path, entry);
+									jobDone();
+								}
+							};
+							if (cache !== undefined) {
+								this._resolveContextTimestamp(cache, callback);
+							} else {
+								this.getContextTimestamp(path, callback);
+							}
+						}
+					}
+					break;
+			}
+		};
+		if (directories) {
+			processCapturedDirectories(
+				captureNonManaged(directories, managedContexts)
+			);
+		}
+		const processCapturedMissing = capturedMissing => {
+			this._missingExistenceOptimization.optimize(snapshot, capturedMissing);
+			for (const path of capturedMissing) {
+				const cache = this._fileTimestamps.get(path);
+				if (cache !== undefined) {
+					if (cache !== "ignore") {
+						missingExistence.set(path, Boolean(cache));
+					}
+				} else {
+					jobs++;
+					this.fileTimestampQueue.add(path, (err, entry) => {
+						if (err) {
+							if (this.logger) {
+								this.logger.debug(
+									`Error snapshotting missing timestamp of ${path}: ${err.stack}`
+								);
+							}
+							jobError();
+						} else {
+							missingExistence.set(path, Boolean(entry));
+							jobDone();
+						}
+					});
+				}
+			}
+		};
+		if (missing) {
+			processCapturedMissing(captureNonManaged(missing, managedMissing));
+		}
+		this._managedItemInfoOptimization.optimize(snapshot, managedItems);
+		for (const path of managedItems) {
+			const cache = this._managedItems.get(path);
+			if (cache !== undefined) {
+				if (!cache.startsWith("*")) {
+					managedFiles.add(join(this.fs, path, "package.json"));
+				} else if (cache === "*nested") {
+					managedMissing.add(join(this.fs, path, "package.json"));
+				}
+				managedItemInfo.set(path, cache);
+			} else {
+				jobs++;
+				this.managedItemQueue.add(path, (err, entry) => {
+					if (err) {
+						if (this.logger) {
+							this.logger.debug(
+								`Error snapshotting managed item ${path}: ${err.stack}`
+							);
+						}
+						jobError();
+					} else if (entry) {
+						if (!entry.startsWith("*")) {
+							managedFiles.add(join(this.fs, path, "package.json"));
+						} else if (cache === "*nested") {
+							managedMissing.add(join(this.fs, path, "package.json"));
+						}
+						managedItemInfo.set(path, entry);
+						jobDone();
+					} else {
+						// Fallback to normal snapshotting
+						const process = (set, fn) => {
+							if (set.size === 0) return;
+							const captured = new Set();
+							for (const file of set) {
+								if (file.startsWith(path)) captured.add(file);
+							}
+							if (captured.size > 0) fn(captured);
+						};
+						process(managedFiles, processCapturedFiles);
+						process(managedContexts, processCapturedDirectories);
+						process(managedMissing, processCapturedMissing);
+						jobDone();
+					}
+				});
+			}
+		}
+		jobDone();
+	}
+
+	/**
+	 * @param {Snapshot} snapshot1 a snapshot
+	 * @param {Snapshot} snapshot2 a snapshot
+	 * @returns {Snapshot} merged snapshot
+	 */
+	mergeSnapshots(snapshot1, snapshot2) {
+		const snapshot = new Snapshot();
+		if (snapshot1.hasStartTime() && snapshot2.hasStartTime())
+			snapshot.setStartTime(Math.min(snapshot1.startTime, snapshot2.startTime));
+		else if (snapshot2.hasStartTime()) snapshot.startTime = snapshot2.startTime;
+		else if (snapshot1.hasStartTime()) snapshot.startTime = snapshot1.startTime;
+		if (snapshot1.hasFileTimestamps() || snapshot2.hasFileTimestamps()) {
+			snapshot.setFileTimestamps(
+				mergeMaps(snapshot1.fileTimestamps, snapshot2.fileTimestamps)
+			);
+		}
+		if (snapshot1.hasFileHashes() || snapshot2.hasFileHashes()) {
+			snapshot.setFileHashes(
+				mergeMaps(snapshot1.fileHashes, snapshot2.fileHashes)
+			);
+		}
+		if (snapshot1.hasFileTshs() || snapshot2.hasFileTshs()) {
+			snapshot.setFileTshs(mergeMaps(snapshot1.fileTshs, snapshot2.fileTshs));
+		}
+		if (snapshot1.hasContextTimestamps() || snapshot2.hasContextTimestamps()) {
+			snapshot.setContextTimestamps(
+				mergeMaps(snapshot1.contextTimestamps, snapshot2.contextTimestamps)
+			);
+		}
+		if (snapshot1.hasContextHashes() || snapshot2.hasContextHashes()) {
+			snapshot.setContextHashes(
+				mergeMaps(snapshot1.contextHashes, snapshot2.contextHashes)
+			);
+		}
+		if (snapshot1.hasContextTshs() || snapshot2.hasContextTshs()) {
+			snapshot.setContextTshs(
+				mergeMaps(snapshot1.contextTshs, snapshot2.contextTshs)
+			);
+		}
+		if (snapshot1.hasMissingExistence() || snapshot2.hasMissingExistence()) {
+			snapshot.setMissingExistence(
+				mergeMaps(snapshot1.missingExistence, snapshot2.missingExistence)
+			);
+		}
+		if (snapshot1.hasManagedItemInfo() || snapshot2.hasManagedItemInfo()) {
+			snapshot.setManagedItemInfo(
+				mergeMaps(snapshot1.managedItemInfo, snapshot2.managedItemInfo)
+			);
+		}
+		if (snapshot1.hasManagedFiles() || snapshot2.hasManagedFiles()) {
+			snapshot.setManagedFiles(
+				mergeSets(snapshot1.managedFiles, snapshot2.managedFiles)
+			);
+		}
+		if (snapshot1.hasManagedContexts() || snapshot2.hasManagedContexts()) {
+			snapshot.setManagedContexts(
+				mergeSets(snapshot1.managedContexts, snapshot2.managedContexts)
+			);
+		}
+		if (snapshot1.hasManagedMissing() || snapshot2.hasManagedMissing()) {
+			snapshot.setManagedMissing(
+				mergeSets(snapshot1.managedMissing, snapshot2.managedMissing)
+			);
+		}
+		if (snapshot1.hasChildren() || snapshot2.hasChildren()) {
+			snapshot.setChildren(mergeSets(snapshot1.children, snapshot2.children));
+		}
+		if (
+			this._snapshotCache.get(snapshot1) === true &&
+			this._snapshotCache.get(snapshot2) === true
+		) {
+			this._snapshotCache.set(snapshot, true);
+		}
+		return snapshot;
+	}
+
+	/**
+	 * @param {Snapshot} snapshot the snapshot made
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function
+	 * @returns {void}
+	 */
+	checkSnapshotValid(snapshot, callback) {
+		const cachedResult = this._snapshotCache.get(snapshot);
+		if (cachedResult !== undefined) {
+			this._statTestedSnapshotsCached++;
+			if (typeof cachedResult === "boolean") {
+				callback(null, cachedResult);
+			} else {
+				cachedResult.push(callback);
+			}
+			return;
+		}
+		this._statTestedSnapshotsNotCached++;
+		this._checkSnapshotValidNoCache(snapshot, callback);
+	}
+
+	/**
+	 * @param {Snapshot} snapshot the snapshot made
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function
+	 * @returns {void}
+	 */
+	_checkSnapshotValidNoCache(snapshot, callback) {
+		/** @type {number | undefined} */
+		let startTime = undefined;
+		if (snapshot.hasStartTime()) {
+			startTime = snapshot.startTime;
+		}
+		let jobs = 1;
+		const jobDone = () => {
+			if (--jobs === 0) {
+				this._snapshotCache.set(snapshot, true);
+				callback(null, true);
+			}
+		};
+		const invalid = () => {
+			if (jobs > 0) {
+				// large negative number instead of NaN or something else to keep jobs to stay a SMI (v8)
+				jobs = -100000000;
+				this._snapshotCache.set(snapshot, false);
+				callback(null, false);
+			}
+		};
+		const invalidWithError = (path, err) => {
+			if (this._remainingLogs > 0) {
+				this._log(path, `error occurred: %s`, err);
+			}
+			invalid();
+		};
+		/**
+		 * @param {string} path file path
+		 * @param {string} current current hash
+		 * @param {string} snap snapshot hash
+		 * @returns {boolean} true, if ok
+		 */
+		const checkHash = (path, current, snap) => {
+			if (current !== snap) {
+				// If hash differ it's invalid
+				if (this._remainingLogs > 0) {
+					this._log(path, `hashes differ (%s != %s)`, current, snap);
+				}
+				return false;
+			}
+			return true;
+		};
+		/**
+		 * @param {string} path file path
+		 * @param {boolean} current current entry
+		 * @param {boolean} snap entry from snapshot
+		 * @returns {boolean} true, if ok
+		 */
+		const checkExistence = (path, current, snap) => {
+			if (!current !== !snap) {
+				// If existence of item differs
+				// it's invalid
+				if (this._remainingLogs > 0) {
+					this._log(
+						path,
+						current ? "it didn't exist before" : "it does no longer exist"
+					);
+				}
+				return false;
+			}
+			return true;
+		};
+		/**
+		 * @param {string} path file path
+		 * @param {FileSystemInfoEntry} current current entry
+		 * @param {FileSystemInfoEntry} snap entry from snapshot
+		 * @param {boolean} log log reason
+		 * @returns {boolean} true, if ok
+		 */
+		const checkFile = (path, current, snap, log = true) => {
+			if (current === snap) return true;
+			if (!checkExistence(path, Boolean(current), Boolean(snap))) return false;
+			if (current) {
+				// For existing items only
+				if (typeof startTime === "number" && current.safeTime > startTime) {
+					// If a change happened after starting reading the item
+					// this may no longer be valid
+					if (log && this._remainingLogs > 0) {
+						this._log(
+							path,
+							`it may have changed (%d) after the start time of the snapshot (%d)`,
+							current.safeTime,
+							startTime
+						);
+					}
+					return false;
+				}
+				if (
+					snap.timestamp !== undefined &&
+					current.timestamp !== snap.timestamp
+				) {
+					// If we have a timestamp (it was a file or symlink) and it differs from current timestamp
+					// it's invalid
+					if (log && this._remainingLogs > 0) {
+						this._log(
+							path,
+							`timestamps differ (%d != %d)`,
+							current.timestamp,
+							snap.timestamp
+						);
+					}
+					return false;
+				}
+			}
+			return true;
+		};
+		/**
+		 * @param {string} path file path
+		 * @param {ResolvedContextFileSystemInfoEntry} current current entry
+		 * @param {ResolvedContextFileSystemInfoEntry} snap entry from snapshot
+		 * @param {boolean} log log reason
+		 * @returns {boolean} true, if ok
+		 */
+		const checkContext = (path, current, snap, log = true) => {
+			if (current === snap) return true;
+			if (!checkExistence(path, Boolean(current), Boolean(snap))) return false;
+			if (current) {
+				// For existing items only
+				if (typeof startTime === "number" && current.safeTime > startTime) {
+					// If a change happened after starting reading the item
+					// this may no longer be valid
+					if (log && this._remainingLogs > 0) {
+						this._log(
+							path,
+							`it may have changed (%d) after the start time of the snapshot (%d)`,
+							current.safeTime,
+							startTime
+						);
+					}
+					return false;
+				}
+				if (
+					snap.timestampHash !== undefined &&
+					current.timestampHash !== snap.timestampHash
+				) {
+					// If we have a timestampHash (it was a directory) and it differs from current timestampHash
+					// it's invalid
+					if (log && this._remainingLogs > 0) {
+						this._log(
+							path,
+							`timestamps hashes differ (%s != %s)`,
+							current.timestampHash,
+							snap.timestampHash
+						);
+					}
+					return false;
+				}
+			}
+			return true;
+		};
+		if (snapshot.hasChildren()) {
+			const childCallback = (err, result) => {
+				if (err || !result) return invalid();
+				else jobDone();
+			};
+			for (const child of snapshot.children) {
+				const cache = this._snapshotCache.get(child);
+				if (cache !== undefined) {
+					this._statTestedChildrenCached++;
+					/* istanbul ignore else */
+					if (typeof cache === "boolean") {
+						if (cache === false) {
+							invalid();
+							return;
+						}
+					} else {
+						jobs++;
+						cache.push(childCallback);
+					}
+				} else {
+					this._statTestedChildrenNotCached++;
+					jobs++;
+					this._checkSnapshotValidNoCache(child, childCallback);
+				}
+			}
+		}
+		if (snapshot.hasFileTimestamps()) {
+			const { fileTimestamps } = snapshot;
+			this._statTestedEntries += fileTimestamps.size;
+			for (const [path, ts] of fileTimestamps) {
+				const cache = this._fileTimestamps.get(path);
+				if (cache !== undefined) {
+					if (cache !== "ignore" && !checkFile(path, cache, ts)) {
+						invalid();
+						return;
+					}
+				} else {
+					jobs++;
+					this.fileTimestampQueue.add(path, (err, entry) => {
+						if (err) return invalidWithError(path, err);
+						if (!checkFile(path, entry, ts)) {
+							invalid();
+						} else {
+							jobDone();
+						}
+					});
+				}
+			}
+		}
+		const processFileHashSnapshot = (path, hash) => {
+			const cache = this._fileHashes.get(path);
+			if (cache !== undefined) {
+				if (cache !== "ignore" && !checkHash(path, cache, hash)) {
+					invalid();
+					return;
+				}
+			} else {
+				jobs++;
+				this.fileHashQueue.add(path, (err, entry) => {
+					if (err) return invalidWithError(path, err);
+					if (!checkHash(path, entry, hash)) {
+						invalid();
+					} else {
+						jobDone();
+					}
+				});
+			}
+		};
+		if (snapshot.hasFileHashes()) {
+			const { fileHashes } = snapshot;
+			this._statTestedEntries += fileHashes.size;
+			for (const [path, hash] of fileHashes) {
+				processFileHashSnapshot(path, hash);
+			}
+		}
+		if (snapshot.hasFileTshs()) {
+			const { fileTshs } = snapshot;
+			this._statTestedEntries += fileTshs.size;
+			for (const [path, tsh] of fileTshs) {
+				if (typeof tsh === "string") {
+					processFileHashSnapshot(path, tsh);
+				} else {
+					const cache = this._fileTimestamps.get(path);
+					if (cache !== undefined) {
+						if (cache === "ignore" || !checkFile(path, cache, tsh, false)) {
+							processFileHashSnapshot(path, tsh && tsh.hash);
+						}
+					} else {
+						jobs++;
+						this.fileTimestampQueue.add(path, (err, entry) => {
+							if (err) return invalidWithError(path, err);
+							if (!checkFile(path, entry, tsh, false)) {
+								processFileHashSnapshot(path, tsh && tsh.hash);
+							}
+							jobDone();
+						});
+					}
+				}
+			}
+		}
+		if (snapshot.hasContextTimestamps()) {
+			const { contextTimestamps } = snapshot;
+			this._statTestedEntries += contextTimestamps.size;
+			for (const [path, ts] of contextTimestamps) {
+				const cache = this._contextTimestamps.get(path);
+				if (cache === "ignore") continue;
+				let resolved;
+				if (
+					cache !== undefined &&
+					(resolved = getResolvedTimestamp(cache)) !== undefined
+				) {
+					if (!checkContext(path, resolved, ts)) {
+						invalid();
+						return;
+					}
+				} else {
+					jobs++;
+					/**
+					 * @param {Error=} err error
+					 * @param {ResolvedContextFileSystemInfoEntry=} entry entry
+					 * @returns {void}
+					 */
+					const callback = (err, entry) => {
+						if (err) return invalidWithError(path, err);
+						if (!checkContext(path, entry, ts)) {
+							invalid();
+						} else {
+							jobDone();
+						}
+					};
+					if (cache !== undefined) {
+						this._resolveContextTimestamp(cache, callback);
+					} else {
+						this.getContextTimestamp(path, callback);
+					}
+				}
+			}
+		}
+		const processContextHashSnapshot = (path, hash) => {
+			const cache = this._contextHashes.get(path);
+			let resolved;
+			if (
+				cache !== undefined &&
+				(resolved = getResolvedHash(cache)) !== undefined
+			) {
+				if (!checkHash(path, resolved, hash)) {
+					invalid();
+					return;
+				}
+			} else {
+				jobs++;
+				const callback = (err, entry) => {
+					if (err) return invalidWithError(path, err);
+					if (!checkHash(path, entry, hash)) {
+						invalid();
+					} else {
+						jobDone();
+					}
+				};
+				if (cache !== undefined) {
+					this._resolveContextHash(cache, callback);
+				} else {
+					this.getContextHash(path, callback);
+				}
+			}
+		};
+		if (snapshot.hasContextHashes()) {
+			const { contextHashes } = snapshot;
+			this._statTestedEntries += contextHashes.size;
+			for (const [path, hash] of contextHashes) {
+				processContextHashSnapshot(path, hash);
+			}
+		}
+		if (snapshot.hasContextTshs()) {
+			const { contextTshs } = snapshot;
+			this._statTestedEntries += contextTshs.size;
+			for (const [path, tsh] of contextTshs) {
+				if (typeof tsh === "string") {
+					processContextHashSnapshot(path, tsh);
+				} else {
+					const cache = this._contextTimestamps.get(path);
+					if (cache === "ignore") continue;
+					let resolved;
+					if (
+						cache !== undefined &&
+						(resolved = getResolvedTimestamp(cache)) !== undefined
+					) {
+						if (!checkContext(path, resolved, tsh, false)) {
+							processContextHashSnapshot(path, tsh && tsh.hash);
+						}
+					} else {
+						jobs++;
+						/**
+						 * @param {Error=} err error
+						 * @param {ResolvedContextFileSystemInfoEntry=} entry entry
+						 * @returns {void}
+						 */
+						const callback = (err, entry) => {
+							if (err) return invalidWithError(path, err);
+							if (!checkContext(path, entry, tsh, false)) {
+								processContextHashSnapshot(path, tsh && tsh.hash);
+							}
+							jobDone();
+						};
+						if (cache !== undefined) {
+							this._resolveContextTimestamp(cache, callback);
+						} else {
+							this.getContextTimestamp(path, callback);
+						}
+					}
+				}
+			}
+		}
+		if (snapshot.hasMissingExistence()) {
+			const { missingExistence } = snapshot;
+			this._statTestedEntries += missingExistence.size;
+			for (const [path, existence] of missingExistence) {
+				const cache = this._fileTimestamps.get(path);
+				if (cache !== undefined) {
+					if (
+						cache !== "ignore" &&
+						!checkExistence(path, Boolean(cache), Boolean(existence))
+					) {
+						invalid();
+						return;
+					}
+				} else {
+					jobs++;
+					this.fileTimestampQueue.add(path, (err, entry) => {
+						if (err) return invalidWithError(path, err);
+						if (!checkExistence(path, Boolean(entry), Boolean(existence))) {
+							invalid();
+						} else {
+							jobDone();
+						}
+					});
+				}
+			}
+		}
+		if (snapshot.hasManagedItemInfo()) {
+			const { managedItemInfo } = snapshot;
+			this._statTestedEntries += managedItemInfo.size;
+			for (const [path, info] of managedItemInfo) {
+				const cache = this._managedItems.get(path);
+				if (cache !== undefined) {
+					if (!checkHash(path, cache, info)) {
+						invalid();
+						return;
+					}
+				} else {
+					jobs++;
+					this.managedItemQueue.add(path, (err, entry) => {
+						if (err) return invalidWithError(path, err);
+						if (!checkHash(path, entry, info)) {
+							invalid();
+						} else {
+							jobDone();
+						}
+					});
+				}
+			}
+		}
+		jobDone();
+
+		// if there was an async action
+		// try to join multiple concurrent request for this snapshot
+		if (jobs > 0) {
+			const callbacks = [callback];
+			callback = (err, result) => {
+				for (const callback of callbacks) callback(err, result);
+			};
+			this._snapshotCache.set(snapshot, callbacks);
+		}
+	}
+
+	_readFileTimestamp(path, callback) {
+		this.fs.stat(path, (err, stat) => {
+			if (err) {
+				if (err.code === "ENOENT") {
+					this._fileTimestamps.set(path, null);
+					this._cachedDeprecatedFileTimestamps = undefined;
+					return callback(null, null);
+				}
+				return callback(err);
+			}
+
+			let ts;
+			if (stat.isDirectory()) {
+				ts = {
+					safeTime: 0,
+					timestamp: undefined
+				};
+			} else {
+				const mtime = +stat.mtime;
+
+				if (mtime) applyMtime(mtime);
+
+				ts = {
+					safeTime: mtime ? mtime + FS_ACCURACY : Infinity,
+					timestamp: mtime
+				};
+			}
+
+			this._fileTimestamps.set(path, ts);
+			this._cachedDeprecatedFileTimestamps = undefined;
+
+			callback(null, ts);
+		});
+	}
+
+	_readFileHash(path, callback) {
+		this.fs.readFile(path, (err, content) => {
+			if (err) {
+				if (err.code === "EISDIR") {
+					this._fileHashes.set(path, "directory");
+					return callback(null, "directory");
+				}
+				if (err.code === "ENOENT") {
+					this._fileHashes.set(path, null);
+					return callback(null, null);
+				}
+				if (err.code === "ERR_FS_FILE_TOO_LARGE") {
+					this.logger.warn(`Ignoring ${path} for hashing as it's very large`);
+					this._fileHashes.set(path, "too large");
+					return callback(null, "too large");
+				}
+				return callback(err);
+			}
+
+			const hash = createHash(this._hashFunction);
+
+			hash.update(content);
+
+			const digest = /** @type {string} */ (hash.digest("hex"));
+
+			this._fileHashes.set(path, digest);
+
+			callback(null, digest);
+		});
+	}
+
+	_getFileTimestampAndHash(path, callback) {
+		const continueWithHash = hash => {
+			const cache = this._fileTimestamps.get(path);
+			if (cache !== undefined) {
+				if (cache !== "ignore") {
+					const result = {
+						...cache,
+						hash
+					};
+					this._fileTshs.set(path, result);
+					return callback(null, result);
+				} else {
+					this._fileTshs.set(path, hash);
+					return callback(null, hash);
+				}
+			} else {
+				this.fileTimestampQueue.add(path, (err, entry) => {
+					if (err) {
+						return callback(err);
+					}
+					const result = {
+						...entry,
+						hash
+					};
+					this._fileTshs.set(path, result);
+					return callback(null, result);
+				});
+			}
+		};
+
+		const cache = this._fileHashes.get(path);
+		if (cache !== undefined) {
+			continueWithHash(cache);
+		} else {
+			this.fileHashQueue.add(path, (err, entry) => {
+				if (err) {
+					return callback(err);
+				}
+				continueWithHash(entry);
+			});
+		}
+	}
+
+	/**
+	 * @template T
+	 * @template ItemType
+	 * @param {Object} options options
+	 * @param {string} options.path path
+	 * @param {function(string): ItemType} options.fromImmutablePath called when context item is an immutable path
+	 * @param {function(string): ItemType} options.fromManagedItem called when context item is a managed path
+	 * @param {function(string, string, function(Error=, ItemType=): void): void} options.fromSymlink called when context item is a symlink
+	 * @param {function(string, IStats, function(Error=, ItemType=): void): void} options.fromFile called when context item is a file
+	 * @param {function(string, IStats, function(Error=, ItemType=): void): void} options.fromDirectory called when context item is a directory
+	 * @param {function(string[], ItemType[]): T} options.reduce called from all context items
+	 * @param {function((Error | null)=, (T)=): void} callback callback
+	 */
+	_readContext(
+		{
+			path,
+			fromImmutablePath,
+			fromManagedItem,
+			fromSymlink,
+			fromFile,
+			fromDirectory,
+			reduce
+		},
+		callback
+	) {
+		this.fs.readdir(path, (err, _files) => {
+			if (err) {
+				if (err.code === "ENOENT") {
+					return callback(null, null);
+				}
+				return callback(err);
+			}
+			const files = /** @type {string[]} */ (_files)
+				.map(file => file.normalize("NFC"))
+				.filter(file => !/^\./.test(file))
+				.sort();
+			asyncLib.map(
+				files,
+				(file, callback) => {
+					const child = join(this.fs, path, file);
+					for (const immutablePath of this.immutablePathsRegExps) {
+						if (immutablePath.test(path)) {
+							// ignore any immutable path for timestamping
+							return callback(null, fromImmutablePath(path));
+						}
+					}
+					for (const immutablePath of this.immutablePathsWithSlash) {
+						if (path.startsWith(immutablePath)) {
+							// ignore any immutable path for timestamping
+							return callback(null, fromImmutablePath(path));
+						}
+					}
+					for (const managedPath of this.managedPathsRegExps) {
+						const match = managedPath.exec(path);
+						if (match) {
+							const managedItem = getManagedItem(match[1], path);
+							if (managedItem) {
+								// construct timestampHash from managed info
+								return this.managedItemQueue.add(managedItem, (err, info) => {
+									if (err) return callback(err);
+									return callback(null, fromManagedItem(info));
+								});
+							}
+						}
+					}
+					for (const managedPath of this.managedPathsWithSlash) {
+						if (path.startsWith(managedPath)) {
+							const managedItem = getManagedItem(managedPath, child);
+							if (managedItem) {
+								// construct timestampHash from managed info
+								return this.managedItemQueue.add(managedItem, (err, info) => {
+									if (err) return callback(err);
+									return callback(null, fromManagedItem(info));
+								});
+							}
+						}
+					}
+
+					lstatReadlinkAbsolute(this.fs, child, (err, stat) => {
+						if (err) return callback(err);
+
+						if (typeof stat === "string") {
+							return fromSymlink(child, stat, callback);
+						}
+
+						if (stat.isFile()) {
+							return fromFile(child, stat, callback);
+						}
+						if (stat.isDirectory()) {
+							return fromDirectory(child, stat, callback);
+						}
+						callback(null, null);
+					});
+				},
+				(err, results) => {
+					if (err) return callback(err);
+					const result = reduce(files, results);
+					callback(null, result);
+				}
+			);
+		});
+	}
+
+	_readContextTimestamp(path, callback) {
+		this._readContext(
+			{
+				path,
+				fromImmutablePath: () => null,
+				fromManagedItem: info => ({
+					safeTime: 0,
+					timestampHash: info
+				}),
+				fromSymlink: (file, target, callback) => {
+					callback(null, {
+						timestampHash: target,
+						symlinks: new Set([target])
+					});
+				},
+				fromFile: (file, stat, callback) => {
+					// Prefer the cached value over our new stat to report consistent results
+					const cache = this._fileTimestamps.get(file);
+					if (cache !== undefined)
+						return callback(null, cache === "ignore" ? null : cache);
+
+					const mtime = +stat.mtime;
+
+					if (mtime) applyMtime(mtime);
+
+					const ts = {
+						safeTime: mtime ? mtime + FS_ACCURACY : Infinity,
+						timestamp: mtime
+					};
+
+					this._fileTimestamps.set(file, ts);
+					this._cachedDeprecatedFileTimestamps = undefined;
+					callback(null, ts);
+				},
+				fromDirectory: (directory, stat, callback) => {
+					this.contextTimestampQueue.increaseParallelism();
+					this._getUnresolvedContextTimestamp(directory, (err, tsEntry) => {
+						this.contextTimestampQueue.decreaseParallelism();
+						callback(err, tsEntry);
+					});
+				},
+				reduce: (files, tsEntries) => {
+					let symlinks = undefined;
+
+					const hash = createHash(this._hashFunction);
+
+					for (const file of files) hash.update(file);
+					let safeTime = 0;
+					for (const entry of tsEntries) {
+						if (!entry) {
+							hash.update("n");
+							continue;
+						}
+						if (entry.timestamp) {
+							hash.update("f");
+							hash.update(`${entry.timestamp}`);
+						} else if (entry.timestampHash) {
+							hash.update("d");
+							hash.update(`${entry.timestampHash}`);
+						}
+						if (entry.symlinks !== undefined) {
+							if (symlinks === undefined) symlinks = new Set();
+							addAll(entry.symlinks, symlinks);
+						}
+						if (entry.safeTime) {
+							safeTime = Math.max(safeTime, entry.safeTime);
+						}
+					}
+
+					const digest = /** @type {string} */ (hash.digest("hex"));
+
+					const result = {
+						safeTime,
+						timestampHash: digest
+					};
+					if (symlinks) result.symlinks = symlinks;
+					return result;
+				}
+			},
+			(err, result) => {
+				if (err) return callback(err);
+				this._contextTimestamps.set(path, result);
+				this._cachedDeprecatedContextTimestamps = undefined;
+
+				callback(null, result);
+			}
+		);
+	}
+
+	/**
+	 * @param {ContextFileSystemInfoEntry} entry entry
+	 * @param {function((Error | null)=, ResolvedContextFileSystemInfoEntry=): void} callback callback
+	 * @returns {void}
+	 */
+	_resolveContextTimestamp(entry, callback) {
+		const hashes = [];
+		let safeTime = 0;
+		processAsyncTree(
+			entry.symlinks,
+			10,
+			(target, push, callback) => {
+				this._getUnresolvedContextTimestamp(target, (err, entry) => {
+					if (err) return callback(err);
+					if (entry && entry !== "ignore") {
+						hashes.push(entry.timestampHash);
+						if (entry.safeTime) {
+							safeTime = Math.max(safeTime, entry.safeTime);
+						}
+						if (entry.symlinks !== undefined) {
+							for (const target of entry.symlinks) push(target);
+						}
+					}
+					callback();
+				});
+			},
+			err => {
+				if (err) return callback(err);
+				const hash = createHash(this._hashFunction);
+				hash.update(entry.timestampHash);
+				if (entry.safeTime) {
+					safeTime = Math.max(safeTime, entry.safeTime);
+				}
+				hashes.sort();
+				for (const h of hashes) {
+					hash.update(h);
+				}
+				callback(
+					null,
+					(entry.resolved = {
+						safeTime,
+						timestampHash: /** @type {string} */ (hash.digest("hex"))
+					})
+				);
+			}
+		);
+	}
+
+	_readContextHash(path, callback) {
+		this._readContext(
+			{
+				path,
+				fromImmutablePath: () => "",
+				fromManagedItem: info => info || "",
+				fromSymlink: (file, target, callback) => {
+					callback(null, {
+						hash: target,
+						symlinks: new Set([target])
+					});
+				},
+				fromFile: (file, stat, callback) =>
+					this.getFileHash(file, (err, hash) => {
+						callback(err, hash || "");
+					}),
+				fromDirectory: (directory, stat, callback) => {
+					this.contextHashQueue.increaseParallelism();
+					this._getUnresolvedContextHash(directory, (err, hash) => {
+						this.contextHashQueue.decreaseParallelism();
+						callback(err, hash || "");
+					});
+				},
+				/**
+				 * @param {string[]} files files
+				 * @param {(string | ContextHash)[]} fileHashes hashes
+				 * @returns {ContextHash} reduced hash
+				 */
+				reduce: (files, fileHashes) => {
+					let symlinks = undefined;
+					const hash = createHash(this._hashFunction);
+
+					for (const file of files) hash.update(file);
+					for (const entry of fileHashes) {
+						if (typeof entry === "string") {
+							hash.update(entry);
+						} else {
+							hash.update(entry.hash);
+							if (entry.symlinks) {
+								if (symlinks === undefined) symlinks = new Set();
+								addAll(entry.symlinks, symlinks);
+							}
+						}
+					}
+
+					const result = {
+						hash: /** @type {string} */ (hash.digest("hex"))
+					};
+					if (symlinks) result.symlinks = symlinks;
+					return result;
+				}
+			},
+			(err, result) => {
+				if (err) return callback(err);
+				this._contextHashes.set(path, result);
+				return callback(null, result);
+			}
+		);
+	}
+
+	/**
+	 * @param {ContextHash} entry context hash
+	 * @param {function((Error | null)=, string=): void} callback callback
+	 * @returns {void}
+	 */
+	_resolveContextHash(entry, callback) {
+		const hashes = [];
+		processAsyncTree(
+			entry.symlinks,
+			10,
+			(target, push, callback) => {
+				this._getUnresolvedContextHash(target, (err, hash) => {
+					if (err) return callback(err);
+					if (hash) {
+						hashes.push(hash.hash);
+						if (hash.symlinks !== undefined) {
+							for (const target of hash.symlinks) push(target);
+						}
+					}
+					callback();
+				});
+			},
+			err => {
+				if (err) return callback(err);
+				const hash = createHash(this._hashFunction);
+				hash.update(entry.hash);
+				hashes.sort();
+				for (const h of hashes) {
+					hash.update(h);
+				}
+				callback(
+					null,
+					(entry.resolved = /** @type {string} */ (hash.digest("hex")))
+				);
+			}
+		);
+	}
+
+	_readContextTimestampAndHash(path, callback) {
+		const finalize = (timestamp, hash) => {
+			const result =
+				timestamp === "ignore"
+					? hash
+					: {
+							...timestamp,
+							...hash
+					  };
+			this._contextTshs.set(path, result);
+			callback(null, result);
+		};
+		const cachedHash = this._contextHashes.get(path);
+		const cachedTimestamp = this._contextTimestamps.get(path);
+		if (cachedHash !== undefined) {
+			if (cachedTimestamp !== undefined) {
+				finalize(cachedTimestamp, cachedHash);
+			} else {
+				this.contextTimestampQueue.add(path, (err, entry) => {
+					if (err) return callback(err);
+					finalize(entry, cachedHash);
+				});
+			}
+		} else {
+			if (cachedTimestamp !== undefined) {
+				this.contextHashQueue.add(path, (err, entry) => {
+					if (err) return callback(err);
+					finalize(cachedTimestamp, entry);
+				});
+			} else {
+				this._readContext(
+					{
+						path,
+						fromImmutablePath: () => null,
+						fromManagedItem: info => ({
+							safeTime: 0,
+							timestampHash: info,
+							hash: info || ""
+						}),
+						fromSymlink: (fle, target, callback) => {
+							callback(null, {
+								timestampHash: target,
+								hash: target,
+								symlinks: new Set([target])
+							});
+						},
+						fromFile: (file, stat, callback) => {
+							this._getFileTimestampAndHash(file, callback);
+						},
+						fromDirectory: (directory, stat, callback) => {
+							this.contextTshQueue.increaseParallelism();
+							this.contextTshQueue.add(directory, (err, result) => {
+								this.contextTshQueue.decreaseParallelism();
+								callback(err, result);
+							});
+						},
+						/**
+						 * @param {string[]} files files
+						 * @param {(Partial<TimestampAndHash> & Partial<ContextTimestampAndHash> | string | null)[]} results results
+						 * @returns {ContextTimestampAndHash} tsh
+						 */
+						reduce: (files, results) => {
+							let symlinks = undefined;
+
+							const tsHash = createHash(this._hashFunction);
+							const hash = createHash(this._hashFunction);
+
+							for (const file of files) {
+								tsHash.update(file);
+								hash.update(file);
+							}
+							let safeTime = 0;
+							for (const entry of results) {
+								if (!entry) {
+									tsHash.update("n");
+									continue;
+								}
+								if (typeof entry === "string") {
+									tsHash.update("n");
+									hash.update(entry);
+									continue;
+								}
+								if (entry.timestamp) {
+									tsHash.update("f");
+									tsHash.update(`${entry.timestamp}`);
+								} else if (entry.timestampHash) {
+									tsHash.update("d");
+									tsHash.update(`${entry.timestampHash}`);
+								}
+								if (entry.symlinks !== undefined) {
+									if (symlinks === undefined) symlinks = new Set();
+									addAll(entry.symlinks, symlinks);
+								}
+								if (entry.safeTime) {
+									safeTime = Math.max(safeTime, entry.safeTime);
+								}
+								hash.update(entry.hash);
+							}
+
+							const result = {
+								safeTime,
+								timestampHash: /** @type {string} */ (tsHash.digest("hex")),
+								hash: /** @type {string} */ (hash.digest("hex"))
+							};
+							if (symlinks) result.symlinks = symlinks;
+							return result;
+						}
+					},
+					(err, result) => {
+						if (err) return callback(err);
+						this._contextTshs.set(path, result);
+						return callback(null, result);
+					}
+				);
+			}
+		}
+	}
+
+	/**
+	 * @param {ContextTimestampAndHash} entry entry
+	 * @param {function((Error | null)=, ResolvedContextTimestampAndHash=): void} callback callback
+	 * @returns {void}
+	 */
+	_resolveContextTsh(entry, callback) {
+		const hashes = [];
+		const tsHashes = [];
+		let safeTime = 0;
+		processAsyncTree(
+			entry.symlinks,
+			10,
+			(target, push, callback) => {
+				this._getUnresolvedContextTsh(target, (err, entry) => {
+					if (err) return callback(err);
+					if (entry) {
+						hashes.push(entry.hash);
+						if (entry.timestampHash) tsHashes.push(entry.timestampHash);
+						if (entry.safeTime) {
+							safeTime = Math.max(safeTime, entry.safeTime);
+						}
+						if (entry.symlinks !== undefined) {
+							for (const target of entry.symlinks) push(target);
+						}
+					}
+					callback();
+				});
+			},
+			err => {
+				if (err) return callback(err);
+				const hash = createHash(this._hashFunction);
+				const tsHash = createHash(this._hashFunction);
+				hash.update(entry.hash);
+				if (entry.timestampHash) tsHash.update(entry.timestampHash);
+				if (entry.safeTime) {
+					safeTime = Math.max(safeTime, entry.safeTime);
+				}
+				hashes.sort();
+				for (const h of hashes) {
+					hash.update(h);
+				}
+				tsHashes.sort();
+				for (const h of tsHashes) {
+					tsHash.update(h);
+				}
+				callback(
+					null,
+					(entry.resolved = {
+						safeTime,
+						timestampHash: /** @type {string} */ (tsHash.digest("hex")),
+						hash: /** @type {string} */ (hash.digest("hex"))
+					})
+				);
+			}
+		);
+	}
+
+	_getManagedItemDirectoryInfo(path, callback) {
+		this.fs.readdir(path, (err, elements) => {
+			if (err) {
+				if (err.code === "ENOENT" || err.code === "ENOTDIR") {
+					return callback(null, EMPTY_SET);
+				}
+				return callback(err);
+			}
+			const set = new Set(
+				/** @type {string[]} */ (elements).map(element =>
+					join(this.fs, path, element)
+				)
+			);
+			callback(null, set);
+		});
+	}
+
+	_getManagedItemInfo(path, callback) {
+		const dir = dirname(this.fs, path);
+		this.managedItemDirectoryQueue.add(dir, (err, elements) => {
+			if (err) {
+				return callback(err);
+			}
+			if (!elements.has(path)) {
+				// file or directory doesn't exist
+				this._managedItems.set(path, "*missing");
+				return callback(null, "*missing");
+			}
+			// something exists
+			// it may be a file or directory
+			if (
+				path.endsWith("node_modules") &&
+				(path.endsWith("/node_modules") || path.endsWith("\\node_modules"))
+			) {
+				// we are only interested in existence of this special directory
+				this._managedItems.set(path, "*node_modules");
+				return callback(null, "*node_modules");
+			}
+
+			// we assume it's a directory, as files shouldn't occur in managed paths
+			const packageJsonPath = join(this.fs, path, "package.json");
+			this.fs.readFile(packageJsonPath, (err, content) => {
+				if (err) {
+					if (err.code === "ENOENT" || err.code === "ENOTDIR") {
+						// no package.json or path is not a directory
+						this.fs.readdir(path, (err, elements) => {
+							if (
+								!err &&
+								elements.length === 1 &&
+								elements[0] === "node_modules"
+							) {
+								// This is only a grouping folder e. g. used by yarn
+								// we are only interested in existence of this special directory
+								this._managedItems.set(path, "*nested");
+								return callback(null, "*nested");
+							}
+							this.logger.warn(
+								`Managed item ${path} isn't a directory or doesn't contain a package.json (see snapshot.managedPaths option)`
+							);
+							return callback();
+						});
+						return;
+					}
+					return callback(err);
+				}
+				let data;
+				try {
+					data = JSON.parse(content.toString("utf-8"));
+				} catch (e) {
+					return callback(e);
+				}
+				if (!data.name) {
+					this.logger.warn(
+						`${packageJsonPath} doesn't contain a "name" property (see snapshot.managedPaths option)`
+					);
+					return callback();
+				}
+				const info = `${data.name || ""}@${data.version || ""}`;
+				this._managedItems.set(path, info);
+				callback(null, info);
+			});
+		});
+	}
+
+	getDeprecatedFileTimestamps() {
+		if (this._cachedDeprecatedFileTimestamps !== undefined)
+			return this._cachedDeprecatedFileTimestamps;
+		const map = new Map();
+		for (const [path, info] of this._fileTimestamps) {
+			if (info) map.set(path, typeof info === "object" ? info.safeTime : null);
+		}
+		return (this._cachedDeprecatedFileTimestamps = map);
+	}
+
+	getDeprecatedContextTimestamps() {
+		if (this._cachedDeprecatedContextTimestamps !== undefined)
+			return this._cachedDeprecatedContextTimestamps;
+		const map = new Map();
+		for (const [path, info] of this._contextTimestamps) {
+			if (info) map.set(path, typeof info === "object" ? info.safeTime : null);
+		}
+		return (this._cachedDeprecatedContextTimestamps = map);
+	}
+}
+
+module.exports = FileSystemInfo;
+module.exports.Snapshot = Snapshot;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/FlagAllModulesAsUsedPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagAllModulesAsUsedPlugin.js
new file mode 100644
index 0000000..c84ed38
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagAllModulesAsUsedPlugin.js
@@ -0,0 +1,55 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { getEntryRuntime, mergeRuntimeOwned } = require("./util/runtime");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+class FlagAllModulesAsUsedPlugin {
+	constructor(explanation) {
+		this.explanation = explanation;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"FlagAllModulesAsUsedPlugin",
+			compilation => {
+				const moduleGraph = compilation.moduleGraph;
+				compilation.hooks.optimizeDependencies.tap(
+					"FlagAllModulesAsUsedPlugin",
+					modules => {
+						/** @type {RuntimeSpec} */
+						let runtime = undefined;
+						for (const [name, { options }] of compilation.entries) {
+							runtime = mergeRuntimeOwned(
+								runtime,
+								getEntryRuntime(compilation, name, options)
+							);
+						}
+						for (const module of modules) {
+							const exportsInfo = moduleGraph.getExportsInfo(module);
+							exportsInfo.setUsedInUnknownWay(runtime);
+							moduleGraph.addExtraReason(module, this.explanation);
+							if (module.factoryMeta === undefined) {
+								module.factoryMeta = {};
+							}
+							module.factoryMeta.sideEffectFree = false;
+						}
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = FlagAllModulesAsUsedPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/FlagDependencyExportsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagDependencyExportsPlugin.js
new file mode 100644
index 0000000..22e9352
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagDependencyExportsPlugin.js
@@ -0,0 +1,417 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const Queue = require("./util/Queue");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Dependency").ExportSpec} ExportSpec */
+/** @typedef {import("./Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("./ExportsInfo")} ExportsInfo */
+/** @typedef {import("./Module")} Module */
+
+class FlagDependencyExportsPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"FlagDependencyExportsPlugin",
+			compilation => {
+				const moduleGraph = compilation.moduleGraph;
+				const cache = compilation.getCache("FlagDependencyExportsPlugin");
+				compilation.hooks.finishModules.tapAsync(
+					"FlagDependencyExportsPlugin",
+					(modules, callback) => {
+						const logger = compilation.getLogger(
+							"webpack.FlagDependencyExportsPlugin"
+						);
+						let statRestoredFromMemCache = 0;
+						let statRestoredFromCache = 0;
+						let statNoExports = 0;
+						let statFlaggedUncached = 0;
+						let statNotCached = 0;
+						let statQueueItemsProcessed = 0;
+
+						const { moduleMemCaches } = compilation;
+
+						/** @type {Queue<Module>} */
+						const queue = new Queue();
+
+						// Step 1: Try to restore cached provided export info from cache
+						logger.time("restore cached provided exports");
+						asyncLib.each(
+							modules,
+							(module, callback) => {
+								const exportsInfo = moduleGraph.getExportsInfo(module);
+								if (!module.buildMeta || !module.buildMeta.exportsType) {
+									if (exportsInfo.otherExportsInfo.provided !== null) {
+										// It's a module without declared exports
+										statNoExports++;
+										exportsInfo.setHasProvideInfo();
+										exportsInfo.setUnknownExportsProvided();
+										return callback();
+									}
+								}
+								if (typeof module.buildInfo.hash !== "string") {
+									statFlaggedUncached++;
+									// Enqueue uncacheable module for determining the exports
+									queue.enqueue(module);
+									exportsInfo.setHasProvideInfo();
+									return callback();
+								}
+								const memCache = moduleMemCaches && moduleMemCaches.get(module);
+								const memCacheValue = memCache && memCache.get(this);
+								if (memCacheValue !== undefined) {
+									statRestoredFromMemCache++;
+									exportsInfo.restoreProvided(memCacheValue);
+									return callback();
+								}
+								cache.get(
+									module.identifier(),
+									module.buildInfo.hash,
+									(err, result) => {
+										if (err) return callback(err);
+
+										if (result !== undefined) {
+											statRestoredFromCache++;
+											exportsInfo.restoreProvided(result);
+										} else {
+											statNotCached++;
+											// Without cached info enqueue module for determining the exports
+											queue.enqueue(module);
+											exportsInfo.setHasProvideInfo();
+										}
+										callback();
+									}
+								);
+							},
+							err => {
+								logger.timeEnd("restore cached provided exports");
+								if (err) return callback(err);
+
+								/** @type {Set<Module>} */
+								const modulesToStore = new Set();
+
+								/** @type {Map<Module, Set<Module>>} */
+								const dependencies = new Map();
+
+								/** @type {Module} */
+								let module;
+
+								/** @type {ExportsInfo} */
+								let exportsInfo;
+
+								/** @type {Map<Dependency, ExportsSpec>} */
+								const exportsSpecsFromDependencies = new Map();
+
+								let cacheable = true;
+								let changed = false;
+
+								/**
+								 * @param {DependenciesBlock} depBlock the dependencies block
+								 * @returns {void}
+								 */
+								const processDependenciesBlock = depBlock => {
+									for (const dep of depBlock.dependencies) {
+										processDependency(dep);
+									}
+									for (const block of depBlock.blocks) {
+										processDependenciesBlock(block);
+									}
+								};
+
+								/**
+								 * @param {Dependency} dep the dependency
+								 * @returns {void}
+								 */
+								const processDependency = dep => {
+									const exportDesc = dep.getExports(moduleGraph);
+									if (!exportDesc) return;
+									exportsSpecsFromDependencies.set(dep, exportDesc);
+								};
+
+								/**
+								 * @param {Dependency} dep dependency
+								 * @param {ExportsSpec} exportDesc info
+								 * @returns {void}
+								 */
+								const processExportsSpec = (dep, exportDesc) => {
+									const exports = exportDesc.exports;
+									const globalCanMangle = exportDesc.canMangle;
+									const globalFrom = exportDesc.from;
+									const globalPriority = exportDesc.priority;
+									const globalTerminalBinding =
+										exportDesc.terminalBinding || false;
+									const exportDeps = exportDesc.dependencies;
+									if (exportDesc.hideExports) {
+										for (const name of exportDesc.hideExports) {
+											const exportInfo = exportsInfo.getExportInfo(name);
+											exportInfo.unsetTarget(dep);
+										}
+									}
+									if (exports === true) {
+										// unknown exports
+										if (
+											exportsInfo.setUnknownExportsProvided(
+												globalCanMangle,
+												exportDesc.excludeExports,
+												globalFrom && dep,
+												globalFrom,
+												globalPriority
+											)
+										) {
+											changed = true;
+										}
+									} else if (Array.isArray(exports)) {
+										/**
+										 * merge in new exports
+										 * @param {ExportsInfo} exportsInfo own exports info
+										 * @param {(ExportSpec | string)[]} exports list of exports
+										 */
+										const mergeExports = (exportsInfo, exports) => {
+											for (const exportNameOrSpec of exports) {
+												let name;
+												let canMangle = globalCanMangle;
+												let terminalBinding = globalTerminalBinding;
+												let exports = undefined;
+												let from = globalFrom;
+												let fromExport = undefined;
+												let priority = globalPriority;
+												let hidden = false;
+												if (typeof exportNameOrSpec === "string") {
+													name = exportNameOrSpec;
+												} else {
+													name = exportNameOrSpec.name;
+													if (exportNameOrSpec.canMangle !== undefined)
+														canMangle = exportNameOrSpec.canMangle;
+													if (exportNameOrSpec.export !== undefined)
+														fromExport = exportNameOrSpec.export;
+													if (exportNameOrSpec.exports !== undefined)
+														exports = exportNameOrSpec.exports;
+													if (exportNameOrSpec.from !== undefined)
+														from = exportNameOrSpec.from;
+													if (exportNameOrSpec.priority !== undefined)
+														priority = exportNameOrSpec.priority;
+													if (exportNameOrSpec.terminalBinding !== undefined)
+														terminalBinding = exportNameOrSpec.terminalBinding;
+													if (exportNameOrSpec.hidden !== undefined)
+														hidden = exportNameOrSpec.hidden;
+												}
+												const exportInfo = exportsInfo.getExportInfo(name);
+
+												if (
+													exportInfo.provided === false ||
+													exportInfo.provided === null
+												) {
+													exportInfo.provided = true;
+													changed = true;
+												}
+
+												if (
+													exportInfo.canMangleProvide !== false &&
+													canMangle === false
+												) {
+													exportInfo.canMangleProvide = false;
+													changed = true;
+												}
+
+												if (terminalBinding && !exportInfo.terminalBinding) {
+													exportInfo.terminalBinding = true;
+													changed = true;
+												}
+
+												if (exports) {
+													const nestedExportsInfo =
+														exportInfo.createNestedExportsInfo();
+													mergeExports(nestedExportsInfo, exports);
+												}
+
+												if (
+													from &&
+													(hidden
+														? exportInfo.unsetTarget(dep)
+														: exportInfo.setTarget(
+																dep,
+																from,
+																fromExport === undefined ? [name] : fromExport,
+																priority
+														  ))
+												) {
+													changed = true;
+												}
+
+												// Recalculate target exportsInfo
+												const target = exportInfo.getTarget(moduleGraph);
+												let targetExportsInfo = undefined;
+												if (target) {
+													const targetModuleExportsInfo =
+														moduleGraph.getExportsInfo(target.module);
+													targetExportsInfo =
+														targetModuleExportsInfo.getNestedExportsInfo(
+															target.export
+														);
+													// add dependency for this module
+													const set = dependencies.get(target.module);
+													if (set === undefined) {
+														dependencies.set(target.module, new Set([module]));
+													} else {
+														set.add(module);
+													}
+												}
+
+												if (exportInfo.exportsInfoOwned) {
+													if (
+														exportInfo.exportsInfo.setRedirectNamedTo(
+															targetExportsInfo
+														)
+													) {
+														changed = true;
+													}
+												} else if (
+													exportInfo.exportsInfo !== targetExportsInfo
+												) {
+													exportInfo.exportsInfo = targetExportsInfo;
+													changed = true;
+												}
+											}
+										};
+										mergeExports(exportsInfo, exports);
+									}
+									// store dependencies
+									if (exportDeps) {
+										cacheable = false;
+										for (const exportDependency of exportDeps) {
+											// add dependency for this module
+											const set = dependencies.get(exportDependency);
+											if (set === undefined) {
+												dependencies.set(exportDependency, new Set([module]));
+											} else {
+												set.add(module);
+											}
+										}
+									}
+								};
+
+								const notifyDependencies = () => {
+									const deps = dependencies.get(module);
+									if (deps !== undefined) {
+										for (const dep of deps) {
+											queue.enqueue(dep);
+										}
+									}
+								};
+
+								logger.time("figure out provided exports");
+								while (queue.length > 0) {
+									module = queue.dequeue();
+
+									statQueueItemsProcessed++;
+
+									exportsInfo = moduleGraph.getExportsInfo(module);
+
+									cacheable = true;
+									changed = false;
+
+									exportsSpecsFromDependencies.clear();
+									moduleGraph.freeze();
+									processDependenciesBlock(module);
+									moduleGraph.unfreeze();
+									for (const [
+										dep,
+										exportsSpec
+									] of exportsSpecsFromDependencies) {
+										processExportsSpec(dep, exportsSpec);
+									}
+
+									if (cacheable) {
+										modulesToStore.add(module);
+									}
+
+									if (changed) {
+										notifyDependencies();
+									}
+								}
+								logger.timeEnd("figure out provided exports");
+
+								logger.log(
+									`${Math.round(
+										(100 * (statFlaggedUncached + statNotCached)) /
+											(statRestoredFromMemCache +
+												statRestoredFromCache +
+												statNotCached +
+												statFlaggedUncached +
+												statNoExports)
+									)}% of exports of modules have been determined (${statNoExports} no declared exports, ${statNotCached} not cached, ${statFlaggedUncached} flagged uncacheable, ${statRestoredFromCache} from cache, ${statRestoredFromMemCache} from mem cache, ${
+										statQueueItemsProcessed -
+										statNotCached -
+										statFlaggedUncached
+									} additional calculations due to dependencies)`
+								);
+
+								logger.time("store provided exports into cache");
+								asyncLib.each(
+									modulesToStore,
+									(module, callback) => {
+										if (typeof module.buildInfo.hash !== "string") {
+											// not cacheable
+											return callback();
+										}
+										const cachedData = moduleGraph
+											.getExportsInfo(module)
+											.getRestoreProvidedData();
+										const memCache =
+											moduleMemCaches && moduleMemCaches.get(module);
+										if (memCache) {
+											memCache.set(this, cachedData);
+										}
+										cache.store(
+											module.identifier(),
+											module.buildInfo.hash,
+											cachedData,
+											callback
+										);
+									},
+									err => {
+										logger.timeEnd("store provided exports into cache");
+										callback(err);
+									}
+								);
+							}
+						);
+					}
+				);
+
+				/** @type {WeakMap<Module, any>} */
+				const providedExportsCache = new WeakMap();
+				compilation.hooks.rebuildModule.tap(
+					"FlagDependencyExportsPlugin",
+					module => {
+						providedExportsCache.set(
+							module,
+							moduleGraph.getExportsInfo(module).getRestoreProvidedData()
+						);
+					}
+				);
+				compilation.hooks.finishRebuildingModule.tap(
+					"FlagDependencyExportsPlugin",
+					module => {
+						moduleGraph
+							.getExportsInfo(module)
+							.restoreProvided(providedExportsCache.get(module));
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = FlagDependencyExportsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/FlagDependencyUsagePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagDependencyUsagePlugin.js
new file mode 100644
index 0000000..4a35faf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagDependencyUsagePlugin.js
@@ -0,0 +1,347 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("./Dependency");
+const { UsageState } = require("./ExportsInfo");
+const ModuleGraphConnection = require("./ModuleGraphConnection");
+const { STAGE_DEFAULT } = require("./OptimizationStages");
+const ArrayQueue = require("./util/ArrayQueue");
+const TupleQueue = require("./util/TupleQueue");
+const { getEntryRuntime, mergeRuntimeOwned } = require("./util/runtime");
+
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("./Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("./ExportsInfo")} ExportsInfo */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+const { NO_EXPORTS_REFERENCED, EXPORTS_OBJECT_REFERENCED } = Dependency;
+
+class FlagDependencyUsagePlugin {
+	/**
+	 * @param {boolean} global do a global analysis instead of per runtime
+	 */
+	constructor(global) {
+		this.global = global;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("FlagDependencyUsagePlugin", compilation => {
+			const moduleGraph = compilation.moduleGraph;
+			compilation.hooks.optimizeDependencies.tap(
+				{
+					name: "FlagDependencyUsagePlugin",
+					stage: STAGE_DEFAULT
+				},
+				modules => {
+					if (compilation.moduleMemCaches) {
+						throw new Error(
+							"optimization.usedExports can't be used with cacheUnaffected as export usage is a global effect"
+						);
+					}
+
+					const logger = compilation.getLogger(
+						"webpack.FlagDependencyUsagePlugin"
+					);
+					/** @type {Map<ExportsInfo, Module>} */
+					const exportInfoToModuleMap = new Map();
+
+					/** @type {TupleQueue<[Module, RuntimeSpec]>} */
+					const queue = new TupleQueue();
+
+					/**
+					 * @param {Module} module module to process
+					 * @param {(string[] | ReferencedExport)[]} usedExports list of used exports
+					 * @param {RuntimeSpec} runtime part of which runtime
+					 * @param {boolean} forceSideEffects always apply side effects
+					 * @returns {void}
+					 */
+					const processReferencedModule = (
+						module,
+						usedExports,
+						runtime,
+						forceSideEffects
+					) => {
+						const exportsInfo = moduleGraph.getExportsInfo(module);
+						if (usedExports.length > 0) {
+							if (!module.buildMeta || !module.buildMeta.exportsType) {
+								if (exportsInfo.setUsedWithoutInfo(runtime)) {
+									queue.enqueue(module, runtime);
+								}
+								return;
+							}
+							for (const usedExportInfo of usedExports) {
+								let usedExport;
+								let canMangle = true;
+								if (Array.isArray(usedExportInfo)) {
+									usedExport = usedExportInfo;
+								} else {
+									usedExport = usedExportInfo.name;
+									canMangle = usedExportInfo.canMangle !== false;
+								}
+								if (usedExport.length === 0) {
+									if (exportsInfo.setUsedInUnknownWay(runtime)) {
+										queue.enqueue(module, runtime);
+									}
+								} else {
+									let currentExportsInfo = exportsInfo;
+									for (let i = 0; i < usedExport.length; i++) {
+										const exportInfo = currentExportsInfo.getExportInfo(
+											usedExport[i]
+										);
+										if (canMangle === false) {
+											exportInfo.canMangleUse = false;
+										}
+										const lastOne = i === usedExport.length - 1;
+										if (!lastOne) {
+											const nestedInfo = exportInfo.getNestedExportsInfo();
+											if (nestedInfo) {
+												if (
+													exportInfo.setUsedConditionally(
+														used => used === UsageState.Unused,
+														UsageState.OnlyPropertiesUsed,
+														runtime
+													)
+												) {
+													const currentModule =
+														currentExportsInfo === exportsInfo
+															? module
+															: exportInfoToModuleMap.get(currentExportsInfo);
+													if (currentModule) {
+														queue.enqueue(currentModule, runtime);
+													}
+												}
+												currentExportsInfo = nestedInfo;
+												continue;
+											}
+										}
+										if (
+											exportInfo.setUsedConditionally(
+												v => v !== UsageState.Used,
+												UsageState.Used,
+												runtime
+											)
+										) {
+											const currentModule =
+												currentExportsInfo === exportsInfo
+													? module
+													: exportInfoToModuleMap.get(currentExportsInfo);
+											if (currentModule) {
+												queue.enqueue(currentModule, runtime);
+											}
+										}
+										break;
+									}
+								}
+							}
+						} else {
+							// for a module without side effects we stop tracking usage here when no export is used
+							// This module won't be evaluated in this case
+							// TODO webpack 6 remove this check
+							if (
+								!forceSideEffects &&
+								module.factoryMeta !== undefined &&
+								module.factoryMeta.sideEffectFree
+							) {
+								return;
+							}
+							if (exportsInfo.setUsedForSideEffectsOnly(runtime)) {
+								queue.enqueue(module, runtime);
+							}
+						}
+					};
+
+					/**
+					 * @param {DependenciesBlock} module the module
+					 * @param {RuntimeSpec} runtime part of which runtime
+					 * @param {boolean} forceSideEffects always apply side effects
+					 * @returns {void}
+					 */
+					const processModule = (module, runtime, forceSideEffects) => {
+						/** @type {Map<Module, (string[] | ReferencedExport)[] | Map<string, string[] | ReferencedExport>>} */
+						const map = new Map();
+
+						/** @type {ArrayQueue<DependenciesBlock>} */
+						const queue = new ArrayQueue();
+						queue.enqueue(module);
+						for (;;) {
+							const block = queue.dequeue();
+							if (block === undefined) break;
+							for (const b of block.blocks) {
+								if (
+									!this.global &&
+									b.groupOptions &&
+									b.groupOptions.entryOptions
+								) {
+									processModule(
+										b,
+										b.groupOptions.entryOptions.runtime || undefined,
+										true
+									);
+								} else {
+									queue.enqueue(b);
+								}
+							}
+							for (const dep of block.dependencies) {
+								const connection = moduleGraph.getConnection(dep);
+								if (!connection || !connection.module) {
+									continue;
+								}
+								const activeState = connection.getActiveState(runtime);
+								if (activeState === false) continue;
+								const { module } = connection;
+								if (activeState === ModuleGraphConnection.TRANSITIVE_ONLY) {
+									processModule(module, runtime, false);
+									continue;
+								}
+								const oldReferencedExports = map.get(module);
+								if (oldReferencedExports === EXPORTS_OBJECT_REFERENCED) {
+									continue;
+								}
+								const referencedExports =
+									compilation.getDependencyReferencedExports(dep, runtime);
+								if (
+									oldReferencedExports === undefined ||
+									oldReferencedExports === NO_EXPORTS_REFERENCED ||
+									referencedExports === EXPORTS_OBJECT_REFERENCED
+								) {
+									map.set(module, referencedExports);
+								} else if (
+									oldReferencedExports !== undefined &&
+									referencedExports === NO_EXPORTS_REFERENCED
+								) {
+									continue;
+								} else {
+									let exportsMap;
+									if (Array.isArray(oldReferencedExports)) {
+										exportsMap = new Map();
+										for (const item of oldReferencedExports) {
+											if (Array.isArray(item)) {
+												exportsMap.set(item.join("\n"), item);
+											} else {
+												exportsMap.set(item.name.join("\n"), item);
+											}
+										}
+										map.set(module, exportsMap);
+									} else {
+										exportsMap = oldReferencedExports;
+									}
+									for (const item of referencedExports) {
+										if (Array.isArray(item)) {
+											const key = item.join("\n");
+											const oldItem = exportsMap.get(key);
+											if (oldItem === undefined) {
+												exportsMap.set(key, item);
+											}
+											// if oldItem is already an array we have to do nothing
+											// if oldItem is an ReferencedExport object, we don't have to do anything
+											// as canMangle defaults to true for arrays
+										} else {
+											const key = item.name.join("\n");
+											const oldItem = exportsMap.get(key);
+											if (oldItem === undefined || Array.isArray(oldItem)) {
+												exportsMap.set(key, item);
+											} else {
+												exportsMap.set(key, {
+													name: item.name,
+													canMangle: item.canMangle && oldItem.canMangle
+												});
+											}
+										}
+									}
+								}
+							}
+						}
+
+						for (const [module, referencedExports] of map) {
+							if (Array.isArray(referencedExports)) {
+								processReferencedModule(
+									module,
+									referencedExports,
+									runtime,
+									forceSideEffects
+								);
+							} else {
+								processReferencedModule(
+									module,
+									Array.from(referencedExports.values()),
+									runtime,
+									forceSideEffects
+								);
+							}
+						}
+					};
+
+					logger.time("initialize exports usage");
+					for (const module of modules) {
+						const exportsInfo = moduleGraph.getExportsInfo(module);
+						exportInfoToModuleMap.set(exportsInfo, module);
+						exportsInfo.setHasUseInfo();
+					}
+					logger.timeEnd("initialize exports usage");
+
+					logger.time("trace exports usage in graph");
+
+					/**
+					 * @param {Dependency} dep dependency
+					 * @param {RuntimeSpec} runtime runtime
+					 */
+					const processEntryDependency = (dep, runtime) => {
+						const module = moduleGraph.getModule(dep);
+						if (module) {
+							processReferencedModule(
+								module,
+								NO_EXPORTS_REFERENCED,
+								runtime,
+								true
+							);
+						}
+					};
+					/** @type {RuntimeSpec} */
+					let globalRuntime = undefined;
+					for (const [
+						entryName,
+						{ dependencies: deps, includeDependencies: includeDeps, options }
+					] of compilation.entries) {
+						const runtime = this.global
+							? undefined
+							: getEntryRuntime(compilation, entryName, options);
+						for (const dep of deps) {
+							processEntryDependency(dep, runtime);
+						}
+						for (const dep of includeDeps) {
+							processEntryDependency(dep, runtime);
+						}
+						globalRuntime = mergeRuntimeOwned(globalRuntime, runtime);
+					}
+					for (const dep of compilation.globalEntry.dependencies) {
+						processEntryDependency(dep, globalRuntime);
+					}
+					for (const dep of compilation.globalEntry.includeDependencies) {
+						processEntryDependency(dep, globalRuntime);
+					}
+
+					while (queue.length) {
+						const [module, runtime] = queue.dequeue();
+						processModule(module, runtime, false);
+					}
+					logger.timeEnd("trace exports usage in graph");
+				}
+			);
+		});
+	}
+}
+
+module.exports = FlagDependencyUsagePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/FlagEntryExportAsUsedPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagEntryExportAsUsedPlugin.js
new file mode 100644
index 0000000..db63616
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/FlagEntryExportAsUsedPlugin.js
@@ -0,0 +1,53 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { getEntryRuntime } = require("./util/runtime");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class FlagEntryExportAsUsedPlugin {
+	constructor(nsObjectUsed, explanation) {
+		this.nsObjectUsed = nsObjectUsed;
+		this.explanation = explanation;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"FlagEntryExportAsUsedPlugin",
+			compilation => {
+				const moduleGraph = compilation.moduleGraph;
+				compilation.hooks.seal.tap("FlagEntryExportAsUsedPlugin", () => {
+					for (const [
+						entryName,
+						{ dependencies: deps, options }
+					] of compilation.entries) {
+						const runtime = getEntryRuntime(compilation, entryName, options);
+						for (const dep of deps) {
+							const module = moduleGraph.getModule(dep);
+							if (module) {
+								const exportsInfo = moduleGraph.getExportsInfo(module);
+								if (this.nsObjectUsed) {
+									exportsInfo.setUsedInUnknownWay(runtime);
+								} else {
+									exportsInfo.setAllKnownExportsUsed(runtime);
+								}
+								moduleGraph.addExtraReason(module, this.explanation);
+							}
+						}
+					}
+				});
+			}
+		);
+	}
+}
+
+module.exports = FlagEntryExportAsUsedPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Generator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Generator.js
new file mode 100644
index 0000000..3423b05
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Generator.js
@@ -0,0 +1,149 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./ConcatenationScope")} ConcatenationScope */
+/** @typedef {import("./DependencyTemplate")} DependencyTemplate */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Module").ConcatenationBailoutReasonContext} ConcatenationBailoutReasonContext */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./NormalModule")} NormalModule */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} GenerateContext
+ * @property {DependencyTemplates} dependencyTemplates mapping from dependencies to templates
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {Set<string>} runtimeRequirements the requirements for runtime
+ * @property {RuntimeSpec} runtime the runtime
+ * @property {ConcatenationScope=} concatenationScope when in concatenated module, information about other concatenated modules
+ * @property {CodeGenerationResults=} codeGenerationResults code generation results of other modules (need to have a codeGenerationDependency to use that)
+ * @property {string} type which kind of code should be generated
+ * @property {function(): Map<string, any>=} getData get access to the code generation data
+ */
+
+/**
+ * @typedef {Object} UpdateHashContext
+ * @property {NormalModule} module the module
+ * @property {ChunkGraph} chunkGraph
+ * @property {RuntimeSpec} runtime
+ * @property {RuntimeTemplate=} runtimeTemplate
+ */
+
+/**
+ *
+ */
+class Generator {
+	static byType(map) {
+		return new ByTypeGenerator(map);
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(
+		module,
+		{ dependencyTemplates, runtimeTemplate, moduleGraph, type }
+	) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the bailout reason should be determined
+	 * @param {ConcatenationBailoutReasonContext} context context
+	 * @returns {string | undefined} reason why this module can't be concatenated, undefined when it can be concatenated
+	 */
+	getConcatenationBailoutReason(module, context) {
+		return `Module Concatenation is not implemented for ${this.constructor.name}`;
+	}
+
+	/**
+	 * @param {Hash} hash hash that will be modified
+	 * @param {UpdateHashContext} updateHashContext context for updating hash
+	 */
+	updateHash(hash, { module, runtime }) {
+		// no nothing
+	}
+}
+
+class ByTypeGenerator extends Generator {
+	constructor(map) {
+		super();
+		this.map = map;
+		this._types = new Set(Object.keys(map));
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return this._types;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		const t = type || "javascript";
+		const generator = this.map[t];
+		return generator ? generator.getSize(module, t) : 0;
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, generateContext) {
+		const type = generateContext.type;
+		const generator = this.map[type];
+		if (!generator) {
+			throw new Error(`Generator.byType: no generator specified for ${type}`);
+		}
+		return generator.generate(module, generateContext);
+	}
+}
+
+module.exports = Generator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/GraphHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/GraphHelpers.js
new file mode 100644
index 0000000..2925ad7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/GraphHelpers.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("./Module")} Module */
+
+/**
+ * @param {ChunkGroup} chunkGroup the ChunkGroup to connect
+ * @param {Chunk} chunk chunk to tie to ChunkGroup
+ * @returns {void}
+ */
+const connectChunkGroupAndChunk = (chunkGroup, chunk) => {
+	if (chunkGroup.pushChunk(chunk)) {
+		chunk.addGroup(chunkGroup);
+	}
+};
+
+/**
+ * @param {ChunkGroup} parent parent ChunkGroup to connect
+ * @param {ChunkGroup} child child ChunkGroup to connect
+ * @returns {void}
+ */
+const connectChunkGroupParentAndChild = (parent, child) => {
+	if (parent.addChild(child)) {
+		child.addParent(parent);
+	}
+};
+
+exports.connectChunkGroupAndChunk = connectChunkGroupAndChunk;
+exports.connectChunkGroupParentAndChild = connectChunkGroupParentAndChild;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/HarmonyLinkingError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/HarmonyLinkingError.js
new file mode 100644
index 0000000..8259bec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/HarmonyLinkingError.js
@@ -0,0 +1,16 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+module.exports = class HarmonyLinkingError extends WebpackError {
+	/** @param {string} message Error message */
+	constructor(message) {
+		super(message);
+		this.name = "HarmonyLinkingError";
+		this.hideStack = true;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/HookWebpackError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/HookWebpackError.js
new file mode 100644
index 0000000..dfb5e93
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/HookWebpackError.js
@@ -0,0 +1,93 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Module")} Module */
+
+/**
+ * @template T
+ * @callback Callback
+ * @param {Error=} err
+ * @param {T=} stats
+ * @returns {void}
+ */
+
+class HookWebpackError extends WebpackError {
+	/**
+	 * Creates an instance of HookWebpackError.
+	 * @param {Error} error inner error
+	 * @param {string} hook name of hook
+	 */
+	constructor(error, hook) {
+		super(error.message);
+
+		this.name = "HookWebpackError";
+		this.hook = hook;
+		this.error = error;
+		this.hideStack = true;
+		this.details = `caused by plugins in ${hook}\n${error.stack}`;
+
+		this.stack += `\n-- inner error --\n${error.stack}`;
+	}
+}
+
+module.exports = HookWebpackError;
+
+/**
+ * @param {Error} error an error
+ * @param {string} hook name of the hook
+ * @returns {WebpackError} a webpack error
+ */
+const makeWebpackError = (error, hook) => {
+	if (error instanceof WebpackError) return error;
+	return new HookWebpackError(error, hook);
+};
+module.exports.makeWebpackError = makeWebpackError;
+
+/**
+ * @template T
+ * @param {function((WebpackError | null)=, T=): void} callback webpack error callback
+ * @param {string} hook name of hook
+ * @returns {Callback<T>} generic callback
+ */
+const makeWebpackErrorCallback = (callback, hook) => {
+	return (err, result) => {
+		if (err) {
+			if (err instanceof WebpackError) {
+				callback(err);
+				return;
+			}
+			callback(new HookWebpackError(err, hook));
+			return;
+		}
+		callback(null, result);
+	};
+};
+
+module.exports.makeWebpackErrorCallback = makeWebpackErrorCallback;
+
+/**
+ * @template T
+ * @param {function(): T} fn function which will be wrapping in try catch
+ * @param {string} hook name of hook
+ * @returns {T} the result
+ */
+const tryRunOrWebpackError = (fn, hook) => {
+	let r;
+	try {
+		r = fn();
+	} catch (err) {
+		if (err instanceof WebpackError) {
+			throw err;
+		}
+		throw new HookWebpackError(err, hook);
+	}
+	return r;
+};
+
+module.exports.tryRunOrWebpackError = tryRunOrWebpackError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/HotModuleReplacementPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/HotModuleReplacementPlugin.js
new file mode 100644
index 0000000..12b49df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/HotModuleReplacementPlugin.js
@@ -0,0 +1,778 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncBailHook } = require("tapable");
+const { RawSource } = require("webpack-sources");
+const ChunkGraph = require("./ChunkGraph");
+const Compilation = require("./Compilation");
+const HotUpdateChunk = require("./HotUpdateChunk");
+const NormalModule = require("./NormalModule");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const WebpackError = require("./WebpackError");
+const ConstDependency = require("./dependencies/ConstDependency");
+const ImportMetaHotAcceptDependency = require("./dependencies/ImportMetaHotAcceptDependency");
+const ImportMetaHotDeclineDependency = require("./dependencies/ImportMetaHotDeclineDependency");
+const ModuleHotAcceptDependency = require("./dependencies/ModuleHotAcceptDependency");
+const ModuleHotDeclineDependency = require("./dependencies/ModuleHotDeclineDependency");
+const HotModuleReplacementRuntimeModule = require("./hmr/HotModuleReplacementRuntimeModule");
+const JavascriptParser = require("./javascript/JavascriptParser");
+const {
+	evaluateToIdentifier
+} = require("./javascript/JavascriptParserHelpers");
+const { find, isSubset } = require("./util/SetHelpers");
+const TupleSet = require("./util/TupleSet");
+const { compareModulesById } = require("./util/comparators");
+const {
+	getRuntimeKey,
+	keyToRuntime,
+	forEachRuntime,
+	mergeRuntimeOwned,
+	subtractRuntime,
+	intersectRuntime
+} = require("./util/runtime");
+
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./RuntimeModule")} RuntimeModule */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} HMRJavascriptParserHooks
+ * @property {SyncBailHook<[TODO, string[]], void>} hotAcceptCallback
+ * @property {SyncBailHook<[TODO, string[]], void>} hotAcceptWithoutCallback
+ */
+
+/** @type {WeakMap<JavascriptParser, HMRJavascriptParserHooks>} */
+const parserHooksMap = new WeakMap();
+
+class HotModuleReplacementPlugin {
+	/**
+	 * @param {JavascriptParser} parser the parser
+	 * @returns {HMRJavascriptParserHooks} the attached hooks
+	 */
+	static getParserHooks(parser) {
+		if (!(parser instanceof JavascriptParser)) {
+			throw new TypeError(
+				"The 'parser' argument must be an instance of JavascriptParser"
+			);
+		}
+		let hooks = parserHooksMap.get(parser);
+		if (hooks === undefined) {
+			hooks = {
+				hotAcceptCallback: new SyncBailHook(["expression", "requests"]),
+				hotAcceptWithoutCallback: new SyncBailHook(["expression", "requests"])
+			};
+			parserHooksMap.set(parser, hooks);
+		}
+		return hooks;
+	}
+
+	constructor(options) {
+		this.options = options || {};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { _backCompat: backCompat } = compiler;
+		if (compiler.options.output.strictModuleErrorHandling === undefined)
+			compiler.options.output.strictModuleErrorHandling = true;
+		const runtimeRequirements = [RuntimeGlobals.module];
+
+		const createAcceptHandler = (parser, ParamDependency) => {
+			const { hotAcceptCallback, hotAcceptWithoutCallback } =
+				HotModuleReplacementPlugin.getParserHooks(parser);
+
+			return expr => {
+				const module = parser.state.module;
+				const dep = new ConstDependency(
+					`${module.moduleArgument}.hot.accept`,
+					expr.callee.range,
+					runtimeRequirements
+				);
+				dep.loc = expr.loc;
+				module.addPresentationalDependency(dep);
+				module.buildInfo.moduleConcatenationBailout = "Hot Module Replacement";
+				if (expr.arguments.length >= 1) {
+					const arg = parser.evaluateExpression(expr.arguments[0]);
+					let params = [];
+					let requests = [];
+					if (arg.isString()) {
+						params = [arg];
+					} else if (arg.isArray()) {
+						params = arg.items.filter(param => param.isString());
+					}
+					if (params.length > 0) {
+						params.forEach((param, idx) => {
+							const request = param.string;
+							const dep = new ParamDependency(request, param.range);
+							dep.optional = true;
+							dep.loc = Object.create(expr.loc);
+							dep.loc.index = idx;
+							module.addDependency(dep);
+							requests.push(request);
+						});
+						if (expr.arguments.length > 1) {
+							hotAcceptCallback.call(expr.arguments[1], requests);
+							for (let i = 1; i < expr.arguments.length; i++) {
+								parser.walkExpression(expr.arguments[i]);
+							}
+							return true;
+						} else {
+							hotAcceptWithoutCallback.call(expr, requests);
+							return true;
+						}
+					}
+				}
+				parser.walkExpressions(expr.arguments);
+				return true;
+			};
+		};
+
+		const createDeclineHandler = (parser, ParamDependency) => expr => {
+			const module = parser.state.module;
+			const dep = new ConstDependency(
+				`${module.moduleArgument}.hot.decline`,
+				expr.callee.range,
+				runtimeRequirements
+			);
+			dep.loc = expr.loc;
+			module.addPresentationalDependency(dep);
+			module.buildInfo.moduleConcatenationBailout = "Hot Module Replacement";
+			if (expr.arguments.length === 1) {
+				const arg = parser.evaluateExpression(expr.arguments[0]);
+				let params = [];
+				if (arg.isString()) {
+					params = [arg];
+				} else if (arg.isArray()) {
+					params = arg.items.filter(param => param.isString());
+				}
+				params.forEach((param, idx) => {
+					const dep = new ParamDependency(param.string, param.range);
+					dep.optional = true;
+					dep.loc = Object.create(expr.loc);
+					dep.loc.index = idx;
+					module.addDependency(dep);
+				});
+			}
+			return true;
+		};
+
+		const createHMRExpressionHandler = parser => expr => {
+			const module = parser.state.module;
+			const dep = new ConstDependency(
+				`${module.moduleArgument}.hot`,
+				expr.range,
+				runtimeRequirements
+			);
+			dep.loc = expr.loc;
+			module.addPresentationalDependency(dep);
+			module.buildInfo.moduleConcatenationBailout = "Hot Module Replacement";
+			return true;
+		};
+
+		const applyModuleHot = parser => {
+			parser.hooks.evaluateIdentifier.for("module.hot").tap(
+				{
+					name: "HotModuleReplacementPlugin",
+					before: "NodeStuffPlugin"
+				},
+				expr => {
+					return evaluateToIdentifier(
+						"module.hot",
+						"module",
+						() => ["hot"],
+						true
+					)(expr);
+				}
+			);
+			parser.hooks.call
+				.for("module.hot.accept")
+				.tap(
+					"HotModuleReplacementPlugin",
+					createAcceptHandler(parser, ModuleHotAcceptDependency)
+				);
+			parser.hooks.call
+				.for("module.hot.decline")
+				.tap(
+					"HotModuleReplacementPlugin",
+					createDeclineHandler(parser, ModuleHotDeclineDependency)
+				);
+			parser.hooks.expression
+				.for("module.hot")
+				.tap("HotModuleReplacementPlugin", createHMRExpressionHandler(parser));
+		};
+
+		const applyImportMetaHot = parser => {
+			parser.hooks.evaluateIdentifier
+				.for("import.meta.webpackHot")
+				.tap("HotModuleReplacementPlugin", expr => {
+					return evaluateToIdentifier(
+						"import.meta.webpackHot",
+						"import.meta",
+						() => ["webpackHot"],
+						true
+					)(expr);
+				});
+			parser.hooks.call
+				.for("import.meta.webpackHot.accept")
+				.tap(
+					"HotModuleReplacementPlugin",
+					createAcceptHandler(parser, ImportMetaHotAcceptDependency)
+				);
+			parser.hooks.call
+				.for("import.meta.webpackHot.decline")
+				.tap(
+					"HotModuleReplacementPlugin",
+					createDeclineHandler(parser, ImportMetaHotDeclineDependency)
+				);
+			parser.hooks.expression
+				.for("import.meta.webpackHot")
+				.tap("HotModuleReplacementPlugin", createHMRExpressionHandler(parser));
+		};
+
+		compiler.hooks.compilation.tap(
+			"HotModuleReplacementPlugin",
+			(compilation, { normalModuleFactory }) => {
+				// This applies the HMR plugin only to the targeted compiler
+				// It should not affect child compilations
+				if (compilation.compiler !== compiler) return;
+
+				//#region module.hot.* API
+				compilation.dependencyFactories.set(
+					ModuleHotAcceptDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ModuleHotAcceptDependency,
+					new ModuleHotAcceptDependency.Template()
+				);
+				compilation.dependencyFactories.set(
+					ModuleHotDeclineDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ModuleHotDeclineDependency,
+					new ModuleHotDeclineDependency.Template()
+				);
+				//#endregion
+
+				//#region import.meta.webpackHot.* API
+				compilation.dependencyFactories.set(
+					ImportMetaHotAcceptDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ImportMetaHotAcceptDependency,
+					new ImportMetaHotAcceptDependency.Template()
+				);
+				compilation.dependencyFactories.set(
+					ImportMetaHotDeclineDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ImportMetaHotDeclineDependency,
+					new ImportMetaHotDeclineDependency.Template()
+				);
+				//#endregion
+
+				let hotIndex = 0;
+				const fullHashChunkModuleHashes = {};
+				const chunkModuleHashes = {};
+
+				compilation.hooks.record.tap(
+					"HotModuleReplacementPlugin",
+					(compilation, records) => {
+						if (records.hash === compilation.hash) return;
+						const chunkGraph = compilation.chunkGraph;
+						records.hash = compilation.hash;
+						records.hotIndex = hotIndex;
+						records.fullHashChunkModuleHashes = fullHashChunkModuleHashes;
+						records.chunkModuleHashes = chunkModuleHashes;
+						records.chunkHashes = {};
+						records.chunkRuntime = {};
+						for (const chunk of compilation.chunks) {
+							records.chunkHashes[chunk.id] = chunk.hash;
+							records.chunkRuntime[chunk.id] = getRuntimeKey(chunk.runtime);
+						}
+						records.chunkModuleIds = {};
+						for (const chunk of compilation.chunks) {
+							records.chunkModuleIds[chunk.id] = Array.from(
+								chunkGraph.getOrderedChunkModulesIterable(
+									chunk,
+									compareModulesById(chunkGraph)
+								),
+								m => chunkGraph.getModuleId(m)
+							);
+						}
+					}
+				);
+				/** @type {TupleSet<[Module, Chunk]>} */
+				const updatedModules = new TupleSet();
+				/** @type {TupleSet<[Module, Chunk]>} */
+				const fullHashModules = new TupleSet();
+				/** @type {TupleSet<[Module, RuntimeSpec]>} */
+				const nonCodeGeneratedModules = new TupleSet();
+				compilation.hooks.fullHash.tap("HotModuleReplacementPlugin", hash => {
+					const chunkGraph = compilation.chunkGraph;
+					const records = compilation.records;
+					for (const chunk of compilation.chunks) {
+						const getModuleHash = module => {
+							if (
+								compilation.codeGenerationResults.has(module, chunk.runtime)
+							) {
+								return compilation.codeGenerationResults.getHash(
+									module,
+									chunk.runtime
+								);
+							} else {
+								nonCodeGeneratedModules.add(module, chunk.runtime);
+								return chunkGraph.getModuleHash(module, chunk.runtime);
+							}
+						};
+						const fullHashModulesInThisChunk =
+							chunkGraph.getChunkFullHashModulesSet(chunk);
+						if (fullHashModulesInThisChunk !== undefined) {
+							for (const module of fullHashModulesInThisChunk) {
+								fullHashModules.add(module, chunk);
+							}
+						}
+						const modules = chunkGraph.getChunkModulesIterable(chunk);
+						if (modules !== undefined) {
+							if (records.chunkModuleHashes) {
+								if (fullHashModulesInThisChunk !== undefined) {
+									for (const module of modules) {
+										const key = `${chunk.id}|${module.identifier()}`;
+										const hash = getModuleHash(module);
+										if (
+											fullHashModulesInThisChunk.has(
+												/** @type {RuntimeModule} */ (module)
+											)
+										) {
+											if (records.fullHashChunkModuleHashes[key] !== hash) {
+												updatedModules.add(module, chunk);
+											}
+											fullHashChunkModuleHashes[key] = hash;
+										} else {
+											if (records.chunkModuleHashes[key] !== hash) {
+												updatedModules.add(module, chunk);
+											}
+											chunkModuleHashes[key] = hash;
+										}
+									}
+								} else {
+									for (const module of modules) {
+										const key = `${chunk.id}|${module.identifier()}`;
+										const hash = getModuleHash(module);
+										if (records.chunkModuleHashes[key] !== hash) {
+											updatedModules.add(module, chunk);
+										}
+										chunkModuleHashes[key] = hash;
+									}
+								}
+							} else {
+								if (fullHashModulesInThisChunk !== undefined) {
+									for (const module of modules) {
+										const key = `${chunk.id}|${module.identifier()}`;
+										const hash = getModuleHash(module);
+										if (
+											fullHashModulesInThisChunk.has(
+												/** @type {RuntimeModule} */ (module)
+											)
+										) {
+											fullHashChunkModuleHashes[key] = hash;
+										} else {
+											chunkModuleHashes[key] = hash;
+										}
+									}
+								} else {
+									for (const module of modules) {
+										const key = `${chunk.id}|${module.identifier()}`;
+										const hash = getModuleHash(module);
+										chunkModuleHashes[key] = hash;
+									}
+								}
+							}
+						}
+					}
+
+					hotIndex = records.hotIndex || 0;
+					if (updatedModules.size > 0) hotIndex++;
+
+					hash.update(`${hotIndex}`);
+				});
+				compilation.hooks.processAssets.tap(
+					{
+						name: "HotModuleReplacementPlugin",
+						stage: Compilation.PROCESS_ASSETS_STAGE_ADDITIONAL
+					},
+					() => {
+						const chunkGraph = compilation.chunkGraph;
+						const records = compilation.records;
+						if (records.hash === compilation.hash) return;
+						if (
+							!records.chunkModuleHashes ||
+							!records.chunkHashes ||
+							!records.chunkModuleIds
+						) {
+							return;
+						}
+						for (const [module, chunk] of fullHashModules) {
+							const key = `${chunk.id}|${module.identifier()}`;
+							const hash = nonCodeGeneratedModules.has(module, chunk.runtime)
+								? chunkGraph.getModuleHash(module, chunk.runtime)
+								: compilation.codeGenerationResults.getHash(
+										module,
+										chunk.runtime
+								  );
+							if (records.chunkModuleHashes[key] !== hash) {
+								updatedModules.add(module, chunk);
+							}
+							chunkModuleHashes[key] = hash;
+						}
+
+						/** @type {Map<string, { updatedChunkIds: Set<string|number>, removedChunkIds: Set<string|number>, removedModules: Set<Module>, filename: string, assetInfo: AssetInfo }>} */
+						const hotUpdateMainContentByRuntime = new Map();
+						let allOldRuntime;
+						for (const key of Object.keys(records.chunkRuntime)) {
+							const runtime = keyToRuntime(records.chunkRuntime[key]);
+							allOldRuntime = mergeRuntimeOwned(allOldRuntime, runtime);
+						}
+						forEachRuntime(allOldRuntime, runtime => {
+							const { path: filename, info: assetInfo } =
+								compilation.getPathWithInfo(
+									compilation.outputOptions.hotUpdateMainFilename,
+									{
+										hash: records.hash,
+										runtime
+									}
+								);
+							hotUpdateMainContentByRuntime.set(runtime, {
+								updatedChunkIds: new Set(),
+								removedChunkIds: new Set(),
+								removedModules: new Set(),
+								filename,
+								assetInfo
+							});
+						});
+						if (hotUpdateMainContentByRuntime.size === 0) return;
+
+						// Create a list of all active modules to verify which modules are removed completely
+						/** @type {Map<number|string, Module>} */
+						const allModules = new Map();
+						for (const module of compilation.modules) {
+							const id = chunkGraph.getModuleId(module);
+							allModules.set(id, module);
+						}
+
+						// List of completely removed modules
+						/** @type {Set<string | number>} */
+						const completelyRemovedModules = new Set();
+
+						for (const key of Object.keys(records.chunkHashes)) {
+							const oldRuntime = keyToRuntime(records.chunkRuntime[key]);
+							/** @type {Module[]} */
+							const remainingModules = [];
+							// Check which modules are removed
+							for (const id of records.chunkModuleIds[key]) {
+								const module = allModules.get(id);
+								if (module === undefined) {
+									completelyRemovedModules.add(id);
+								} else {
+									remainingModules.push(module);
+								}
+							}
+
+							let chunkId;
+							let newModules;
+							let newRuntimeModules;
+							let newFullHashModules;
+							let newDependentHashModules;
+							let newRuntime;
+							let removedFromRuntime;
+							const currentChunk = find(
+								compilation.chunks,
+								chunk => `${chunk.id}` === key
+							);
+							if (currentChunk) {
+								chunkId = currentChunk.id;
+								newRuntime = intersectRuntime(
+									currentChunk.runtime,
+									allOldRuntime
+								);
+								if (newRuntime === undefined) continue;
+								newModules = chunkGraph
+									.getChunkModules(currentChunk)
+									.filter(module => updatedModules.has(module, currentChunk));
+								newRuntimeModules = Array.from(
+									chunkGraph.getChunkRuntimeModulesIterable(currentChunk)
+								).filter(module => updatedModules.has(module, currentChunk));
+								const fullHashModules =
+									chunkGraph.getChunkFullHashModulesIterable(currentChunk);
+								newFullHashModules =
+									fullHashModules &&
+									Array.from(fullHashModules).filter(module =>
+										updatedModules.has(module, currentChunk)
+									);
+								const dependentHashModules =
+									chunkGraph.getChunkDependentHashModulesIterable(currentChunk);
+								newDependentHashModules =
+									dependentHashModules &&
+									Array.from(dependentHashModules).filter(module =>
+										updatedModules.has(module, currentChunk)
+									);
+								removedFromRuntime = subtractRuntime(oldRuntime, newRuntime);
+							} else {
+								// chunk has completely removed
+								chunkId = `${+key}` === key ? +key : key;
+								removedFromRuntime = oldRuntime;
+								newRuntime = oldRuntime;
+							}
+							if (removedFromRuntime) {
+								// chunk was removed from some runtimes
+								forEachRuntime(removedFromRuntime, runtime => {
+									hotUpdateMainContentByRuntime
+										.get(runtime)
+										.removedChunkIds.add(chunkId);
+								});
+								// dispose modules from the chunk in these runtimes
+								// where they are no longer in this runtime
+								for (const module of remainingModules) {
+									const moduleKey = `${key}|${module.identifier()}`;
+									const oldHash = records.chunkModuleHashes[moduleKey];
+									const runtimes = chunkGraph.getModuleRuntimes(module);
+									if (oldRuntime === newRuntime && runtimes.has(newRuntime)) {
+										// Module is still in the same runtime combination
+										const hash = nonCodeGeneratedModules.has(module, newRuntime)
+											? chunkGraph.getModuleHash(module, newRuntime)
+											: compilation.codeGenerationResults.getHash(
+													module,
+													newRuntime
+											  );
+										if (hash !== oldHash) {
+											if (module.type === "runtime") {
+												newRuntimeModules = newRuntimeModules || [];
+												newRuntimeModules.push(
+													/** @type {RuntimeModule} */ (module)
+												);
+											} else {
+												newModules = newModules || [];
+												newModules.push(module);
+											}
+										}
+									} else {
+										// module is no longer in this runtime combination
+										// We (incorrectly) assume that it's not in an overlapping runtime combination
+										// and dispose it from the main runtimes the chunk was removed from
+										forEachRuntime(removedFromRuntime, runtime => {
+											// If the module is still used in this runtime, do not dispose it
+											// This could create a bad runtime state where the module is still loaded,
+											// but no chunk which contains it. This means we don't receive further HMR updates
+											// to this module and that's bad.
+											// TODO force load one of the chunks which contains the module
+											for (const moduleRuntime of runtimes) {
+												if (typeof moduleRuntime === "string") {
+													if (moduleRuntime === runtime) return;
+												} else if (moduleRuntime !== undefined) {
+													if (moduleRuntime.has(runtime)) return;
+												}
+											}
+											hotUpdateMainContentByRuntime
+												.get(runtime)
+												.removedModules.add(module);
+										});
+									}
+								}
+							}
+							if (
+								(newModules && newModules.length > 0) ||
+								(newRuntimeModules && newRuntimeModules.length > 0)
+							) {
+								const hotUpdateChunk = new HotUpdateChunk();
+								if (backCompat)
+									ChunkGraph.setChunkGraphForChunk(hotUpdateChunk, chunkGraph);
+								hotUpdateChunk.id = chunkId;
+								hotUpdateChunk.runtime = newRuntime;
+								if (currentChunk) {
+									for (const group of currentChunk.groupsIterable)
+										hotUpdateChunk.addGroup(group);
+								}
+								chunkGraph.attachModules(hotUpdateChunk, newModules || []);
+								chunkGraph.attachRuntimeModules(
+									hotUpdateChunk,
+									newRuntimeModules || []
+								);
+								if (newFullHashModules) {
+									chunkGraph.attachFullHashModules(
+										hotUpdateChunk,
+										newFullHashModules
+									);
+								}
+								if (newDependentHashModules) {
+									chunkGraph.attachDependentHashModules(
+										hotUpdateChunk,
+										newDependentHashModules
+									);
+								}
+								const renderManifest = compilation.getRenderManifest({
+									chunk: hotUpdateChunk,
+									hash: records.hash,
+									fullHash: records.hash,
+									outputOptions: compilation.outputOptions,
+									moduleTemplates: compilation.moduleTemplates,
+									dependencyTemplates: compilation.dependencyTemplates,
+									codeGenerationResults: compilation.codeGenerationResults,
+									runtimeTemplate: compilation.runtimeTemplate,
+									moduleGraph: compilation.moduleGraph,
+									chunkGraph
+								});
+								for (const entry of renderManifest) {
+									/** @type {string} */
+									let filename;
+									/** @type {AssetInfo} */
+									let assetInfo;
+									if ("filename" in entry) {
+										filename = entry.filename;
+										assetInfo = entry.info;
+									} else {
+										({ path: filename, info: assetInfo } =
+											compilation.getPathWithInfo(
+												entry.filenameTemplate,
+												entry.pathOptions
+											));
+									}
+									const source = entry.render();
+									compilation.additionalChunkAssets.push(filename);
+									compilation.emitAsset(filename, source, {
+										hotModuleReplacement: true,
+										...assetInfo
+									});
+									if (currentChunk) {
+										currentChunk.files.add(filename);
+										compilation.hooks.chunkAsset.call(currentChunk, filename);
+									}
+								}
+								forEachRuntime(newRuntime, runtime => {
+									hotUpdateMainContentByRuntime
+										.get(runtime)
+										.updatedChunkIds.add(chunkId);
+								});
+							}
+						}
+						const completelyRemovedModulesArray = Array.from(
+							completelyRemovedModules
+						);
+						const hotUpdateMainContentByFilename = new Map();
+						for (const {
+							removedChunkIds,
+							removedModules,
+							updatedChunkIds,
+							filename,
+							assetInfo
+						} of hotUpdateMainContentByRuntime.values()) {
+							const old = hotUpdateMainContentByFilename.get(filename);
+							if (
+								old &&
+								(!isSubset(old.removedChunkIds, removedChunkIds) ||
+									!isSubset(old.removedModules, removedModules) ||
+									!isSubset(old.updatedChunkIds, updatedChunkIds))
+							) {
+								compilation.warnings.push(
+									new WebpackError(`HotModuleReplacementPlugin
+The configured output.hotUpdateMainFilename doesn't lead to unique filenames per runtime and HMR update differs between runtimes.
+This might lead to incorrect runtime behavior of the applied update.
+To fix this, make sure to include [runtime] in the output.hotUpdateMainFilename option, or use the default config.`)
+								);
+								for (const chunkId of removedChunkIds)
+									old.removedChunkIds.add(chunkId);
+								for (const chunkId of removedModules)
+									old.removedModules.add(chunkId);
+								for (const chunkId of updatedChunkIds)
+									old.updatedChunkIds.add(chunkId);
+								continue;
+							}
+							hotUpdateMainContentByFilename.set(filename, {
+								removedChunkIds,
+								removedModules,
+								updatedChunkIds,
+								assetInfo
+							});
+						}
+						for (const [
+							filename,
+							{ removedChunkIds, removedModules, updatedChunkIds, assetInfo }
+						] of hotUpdateMainContentByFilename) {
+							const hotUpdateMainJson = {
+								c: Array.from(updatedChunkIds),
+								r: Array.from(removedChunkIds),
+								m:
+									removedModules.size === 0
+										? completelyRemovedModulesArray
+										: completelyRemovedModulesArray.concat(
+												Array.from(removedModules, m =>
+													chunkGraph.getModuleId(m)
+												)
+										  )
+							};
+
+							const source = new RawSource(JSON.stringify(hotUpdateMainJson));
+							compilation.emitAsset(filename, source, {
+								hotModuleReplacement: true,
+								...assetInfo
+							});
+						}
+					}
+				);
+
+				compilation.hooks.additionalTreeRuntimeRequirements.tap(
+					"HotModuleReplacementPlugin",
+					(chunk, runtimeRequirements) => {
+						runtimeRequirements.add(RuntimeGlobals.hmrDownloadManifest);
+						runtimeRequirements.add(RuntimeGlobals.hmrDownloadUpdateHandlers);
+						runtimeRequirements.add(RuntimeGlobals.interceptModuleExecution);
+						runtimeRequirements.add(RuntimeGlobals.moduleCache);
+						compilation.addRuntimeModule(
+							chunk,
+							new HotModuleReplacementRuntimeModule()
+						);
+					}
+				);
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("HotModuleReplacementPlugin", parser => {
+						applyModuleHot(parser);
+						applyImportMetaHot(parser);
+					});
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("HotModuleReplacementPlugin", parser => {
+						applyModuleHot(parser);
+					});
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("HotModuleReplacementPlugin", parser => {
+						applyImportMetaHot(parser);
+					});
+
+				NormalModule.getCompilationHooks(compilation).loader.tap(
+					"HotModuleReplacementPlugin",
+					context => {
+						context.hot = true;
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = HotModuleReplacementPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/HotUpdateChunk.js b/node_modules/mathjs/examples/node_modules/webpack/lib/HotUpdateChunk.js
new file mode 100644
index 0000000..d939838
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/HotUpdateChunk.js
@@ -0,0 +1,19 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Chunk = require("./Chunk");
+
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./util/Hash")} Hash */
+
+class HotUpdateChunk extends Chunk {
+	constructor() {
+		super();
+	}
+}
+
+module.exports = HotUpdateChunk;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/IgnoreErrorModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/IgnoreErrorModuleFactory.js
new file mode 100644
index 0000000..ceae85f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/IgnoreErrorModuleFactory.js
@@ -0,0 +1,39 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const ModuleFactory = require("./ModuleFactory");
+
+/** @typedef {import("./ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("./ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./NormalModuleFactory")} NormalModuleFactory */
+
+/**
+ * Ignores error when module is unresolved
+ */
+class IgnoreErrorModuleFactory extends ModuleFactory {
+	/**
+	 * @param {NormalModuleFactory} normalModuleFactory normalModuleFactory instance
+	 */
+	constructor(normalModuleFactory) {
+		super();
+
+		this.normalModuleFactory = normalModuleFactory;
+	}
+
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		this.normalModuleFactory.create(data, (err, result) => {
+			return callback(null, result);
+		});
+	}
+}
+
+module.exports = IgnoreErrorModuleFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/IgnorePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/IgnorePlugin.js
new file mode 100644
index 0000000..f34dfbe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/IgnorePlugin.js
@@ -0,0 +1,83 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const createSchemaValidation = require("./util/create-schema-validation");
+
+/** @typedef {import("../declarations/plugins/IgnorePlugin").IgnorePluginOptions} IgnorePluginOptions */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./NormalModuleFactory").ResolveData} ResolveData */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/IgnorePlugin.check.js"),
+	() => require("../schemas/plugins/IgnorePlugin.json"),
+	{
+		name: "Ignore Plugin",
+		baseDataPath: "options"
+	}
+);
+
+class IgnorePlugin {
+	/**
+	 * @param {IgnorePluginOptions} options IgnorePlugin options
+	 */
+	constructor(options) {
+		validate(options);
+		this.options = options;
+
+		/** @private @type {Function} */
+		this.checkIgnore = this.checkIgnore.bind(this);
+	}
+
+	/**
+	 * Note that if "contextRegExp" is given, both the "resourceRegExp"
+	 * and "contextRegExp" have to match.
+	 *
+	 * @param {ResolveData} resolveData resolve data
+	 * @returns {false|undefined} returns false when the request should be ignored, otherwise undefined
+	 */
+	checkIgnore(resolveData) {
+		if (
+			"checkResource" in this.options &&
+			this.options.checkResource &&
+			this.options.checkResource(resolveData.request, resolveData.context)
+		) {
+			return false;
+		}
+
+		if (
+			"resourceRegExp" in this.options &&
+			this.options.resourceRegExp &&
+			this.options.resourceRegExp.test(resolveData.request)
+		) {
+			if ("contextRegExp" in this.options && this.options.contextRegExp) {
+				// if "contextRegExp" is given,
+				// both the "resourceRegExp" and "contextRegExp" have to match.
+				if (this.options.contextRegExp.test(resolveData.context)) {
+					return false;
+				}
+			} else {
+				return false;
+			}
+		}
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.normalModuleFactory.tap("IgnorePlugin", nmf => {
+			nmf.hooks.beforeResolve.tap("IgnorePlugin", this.checkIgnore);
+		});
+		compiler.hooks.contextModuleFactory.tap("IgnorePlugin", cmf => {
+			cmf.hooks.beforeResolve.tap("IgnorePlugin", this.checkIgnore);
+		});
+	}
+}
+
+module.exports = IgnorePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/IgnoreWarningsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/IgnoreWarningsPlugin.js
new file mode 100644
index 0000000..7b5c6cb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/IgnoreWarningsPlugin.js
@@ -0,0 +1,39 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../declarations/WebpackOptions").IgnoreWarningsNormalized} IgnoreWarningsNormalized */
+/** @typedef {import("./Compiler")} Compiler */
+
+class IgnoreWarningsPlugin {
+	/**
+	 * @param {IgnoreWarningsNormalized} ignoreWarnings conditions to ignore warnings
+	 */
+	constructor(ignoreWarnings) {
+		this._ignoreWarnings = ignoreWarnings;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("IgnoreWarningsPlugin", compilation => {
+			compilation.hooks.processWarnings.tap(
+				"IgnoreWarningsPlugin",
+				warnings => {
+					return warnings.filter(warning => {
+						return !this._ignoreWarnings.some(ignore =>
+							ignore(warning, compilation)
+						);
+					});
+				}
+			);
+		});
+	}
+}
+
+module.exports = IgnoreWarningsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/InitFragment.js b/node_modules/mathjs/examples/node_modules/webpack/lib/InitFragment.js
new file mode 100644
index 0000000..6339344
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/InitFragment.js
@@ -0,0 +1,161 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./Generator").GenerateContext} GenerateContext */
+
+/**
+ * @param {InitFragment} fragment the init fragment
+ * @param {number} index index
+ * @returns {[InitFragment, number]} tuple with both
+ */
+const extractFragmentIndex = (fragment, index) => [fragment, index];
+
+/**
+ * @param {[InitFragment, number]} a first pair
+ * @param {[InitFragment, number]} b second pair
+ * @returns {number} sort value
+ */
+const sortFragmentWithIndex = ([a, i], [b, j]) => {
+	const stageCmp = a.stage - b.stage;
+	if (stageCmp !== 0) return stageCmp;
+	const positionCmp = a.position - b.position;
+	if (positionCmp !== 0) return positionCmp;
+	return i - j;
+};
+
+/**
+ * @template Context
+ */
+class InitFragment {
+	/**
+	 * @param {string|Source} content the source code that will be included as initialization code
+	 * @param {number} stage category of initialization code (contribute to order)
+	 * @param {number} position position in the category (contribute to order)
+	 * @param {string=} key unique key to avoid emitting the same initialization code twice
+	 * @param {string|Source=} endContent the source code that will be included at the end of the module
+	 */
+	constructor(content, stage, position, key, endContent) {
+		this.content = content;
+		this.stage = stage;
+		this.position = position;
+		this.key = key;
+		this.endContent = endContent;
+	}
+
+	/**
+	 * @param {Context} context context
+	 * @returns {string|Source} the source code that will be included as initialization code
+	 */
+	getContent(context) {
+		return this.content;
+	}
+
+	/**
+	 * @param {Context} context context
+	 * @returns {string|Source=} the source code that will be included at the end of the module
+	 */
+	getEndContent(context) {
+		return this.endContent;
+	}
+
+	static addToSource(source, initFragments, context) {
+		if (initFragments.length > 0) {
+			// Sort fragments by position. If 2 fragments have the same position,
+			// use their index.
+			const sortedFragments = initFragments
+				.map(extractFragmentIndex)
+				.sort(sortFragmentWithIndex);
+
+			// Deduplicate fragments. If a fragment has no key, it is always included.
+			const keyedFragments = new Map();
+			for (const [fragment] of sortedFragments) {
+				if (typeof fragment.mergeAll === "function") {
+					if (!fragment.key) {
+						throw new Error(
+							`InitFragment with mergeAll function must have a valid key: ${fragment.constructor.name}`
+						);
+					}
+					const oldValue = keyedFragments.get(fragment.key);
+					if (oldValue === undefined) {
+						keyedFragments.set(fragment.key, fragment);
+					} else if (Array.isArray(oldValue)) {
+						oldValue.push(fragment);
+					} else {
+						keyedFragments.set(fragment.key, [oldValue, fragment]);
+					}
+					continue;
+				} else if (typeof fragment.merge === "function") {
+					const oldValue = keyedFragments.get(fragment.key);
+					if (oldValue !== undefined) {
+						keyedFragments.set(fragment.key, fragment.merge(oldValue));
+						continue;
+					}
+				}
+				keyedFragments.set(fragment.key || Symbol(), fragment);
+			}
+
+			const concatSource = new ConcatSource();
+			const endContents = [];
+			for (let fragment of keyedFragments.values()) {
+				if (Array.isArray(fragment)) {
+					fragment = fragment[0].mergeAll(fragment);
+				}
+				concatSource.add(fragment.getContent(context));
+				const endContent = fragment.getEndContent(context);
+				if (endContent) {
+					endContents.push(endContent);
+				}
+			}
+
+			concatSource.add(source);
+			for (const content of endContents.reverse()) {
+				concatSource.add(content);
+			}
+			return concatSource;
+		} else {
+			return source;
+		}
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.content);
+		write(this.stage);
+		write(this.position);
+		write(this.key);
+		write(this.endContent);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.content = read();
+		this.stage = read();
+		this.position = read();
+		this.key = read();
+		this.endContent = read();
+	}
+}
+
+makeSerializable(InitFragment, "webpack/lib/InitFragment");
+
+InitFragment.prototype.merge = undefined;
+
+InitFragment.STAGE_CONSTANTS = 10;
+InitFragment.STAGE_ASYNC_BOUNDARY = 20;
+InitFragment.STAGE_HARMONY_EXPORTS = 30;
+InitFragment.STAGE_HARMONY_IMPORTS = 40;
+InitFragment.STAGE_PROVIDES = 50;
+InitFragment.STAGE_ASYNC_DEPENDENCIES = 60;
+InitFragment.STAGE_ASYNC_HARMONY_IMPORTS = 70;
+
+module.exports = InitFragment;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/InvalidDependenciesModuleWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/InvalidDependenciesModuleWarning.js
new file mode 100644
index 0000000..a69eed5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/InvalidDependenciesModuleWarning.js
@@ -0,0 +1,44 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Module")} Module */
+
+class InvalidDependenciesModuleWarning extends WebpackError {
+	/**
+	 * @param {Module} module module tied to dependency
+	 * @param {Iterable<string>} deps invalid dependencies
+	 */
+	constructor(module, deps) {
+		const orderedDeps = deps ? Array.from(deps).sort() : [];
+		const depsList = orderedDeps.map(dep => ` * ${JSON.stringify(dep)}`);
+		super(`Invalid dependencies have been reported by plugins or loaders for this module. All reported dependencies need to be absolute paths.
+Invalid dependencies may lead to broken watching and caching.
+As best effort we try to convert all invalid values to absolute paths and converting globs into context dependencies, but this is deprecated behavior.
+Loaders: Pass absolute paths to this.addDependency (existing files), this.addMissingDependency (not existing files), and this.addContextDependency (directories).
+Plugins: Pass absolute paths to fileDependencies (existing files), missingDependencies (not existing files), and contextDependencies (directories).
+Globs: They are not supported. Pass absolute path to the directory as context dependencies.
+The following invalid values have been reported:
+${depsList.slice(0, 3).join("\n")}${
+			depsList.length > 3 ? "\n * and more ..." : ""
+		}`);
+
+		this.name = "InvalidDependenciesModuleWarning";
+		this.details = depsList.slice(3).join("\n");
+		this.module = module;
+	}
+}
+
+makeSerializable(
+	InvalidDependenciesModuleWarning,
+	"webpack/lib/InvalidDependenciesModuleWarning"
+);
+
+module.exports = InvalidDependenciesModuleWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/JavascriptMetaInfoPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/JavascriptMetaInfoPlugin.js
new file mode 100644
index 0000000..e09d067
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/JavascriptMetaInfoPlugin.js
@@ -0,0 +1,68 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const InnerGraph = require("./optimize/InnerGraph");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./javascript/JavascriptParser")} JavascriptParser */
+
+class JavascriptMetaInfoPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"JavascriptMetaInfoPlugin",
+			(compilation, { normalModuleFactory }) => {
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @returns {void}
+				 */
+				const handler = parser => {
+					parser.hooks.call.for("eval").tap("JavascriptMetaInfoPlugin", () => {
+						parser.state.module.buildInfo.moduleConcatenationBailout = "eval()";
+						parser.state.module.buildInfo.usingEval = true;
+						const currentSymbol = InnerGraph.getTopLevelSymbol(parser.state);
+						if (currentSymbol) {
+							InnerGraph.addUsage(parser.state, null, currentSymbol);
+						} else {
+							InnerGraph.bailout(parser.state);
+						}
+					});
+					parser.hooks.finish.tap("JavascriptMetaInfoPlugin", () => {
+						let topLevelDeclarations =
+							parser.state.module.buildInfo.topLevelDeclarations;
+						if (topLevelDeclarations === undefined) {
+							topLevelDeclarations =
+								parser.state.module.buildInfo.topLevelDeclarations = new Set();
+						}
+						for (const name of parser.scope.definitions.asSet()) {
+							const freeInfo = parser.getFreeInfoFromVariable(name);
+							if (freeInfo === undefined) {
+								topLevelDeclarations.add(name);
+							}
+						}
+					});
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("JavascriptMetaInfoPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("JavascriptMetaInfoPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("JavascriptMetaInfoPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = JavascriptMetaInfoPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/LibManifestPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/LibManifestPlugin.js
new file mode 100644
index 0000000..398e226
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/LibManifestPlugin.js
@@ -0,0 +1,115 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const EntryDependency = require("./dependencies/EntryDependency");
+const { someInIterable } = require("./util/IterableHelpers");
+const { compareModulesById } = require("./util/comparators");
+const { dirname, mkdirp } = require("./util/fs");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+/**
+ * @typedef {Object} ManifestModuleData
+ * @property {string | number} id
+ * @property {Object} buildMeta
+ * @property {boolean | string[]} exports
+ */
+
+class LibManifestPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.emit.tapAsync(
+			"LibManifestPlugin",
+			(compilation, callback) => {
+				const moduleGraph = compilation.moduleGraph;
+				asyncLib.forEach(
+					Array.from(compilation.chunks),
+					(chunk, callback) => {
+						if (!chunk.canBeInitial()) {
+							callback();
+							return;
+						}
+						const chunkGraph = compilation.chunkGraph;
+						const targetPath = compilation.getPath(this.options.path, {
+							chunk
+						});
+						const name =
+							this.options.name &&
+							compilation.getPath(this.options.name, {
+								chunk
+							});
+						const content = Object.create(null);
+						for (const module of chunkGraph.getOrderedChunkModulesIterable(
+							chunk,
+							compareModulesById(chunkGraph)
+						)) {
+							if (
+								this.options.entryOnly &&
+								!someInIterable(
+									moduleGraph.getIncomingConnections(module),
+									c => c.dependency instanceof EntryDependency
+								)
+							) {
+								continue;
+							}
+							const ident = module.libIdent({
+								context: this.options.context || compiler.options.context,
+								associatedObjectForCache: compiler.root
+							});
+							if (ident) {
+								const exportsInfo = moduleGraph.getExportsInfo(module);
+								const providedExports = exportsInfo.getProvidedExports();
+								/** @type {ManifestModuleData} */
+								const data = {
+									id: chunkGraph.getModuleId(module),
+									buildMeta: module.buildMeta,
+									exports: Array.isArray(providedExports)
+										? providedExports
+										: undefined
+								};
+								content[ident] = data;
+							}
+						}
+						const manifest = {
+							name,
+							type: this.options.type,
+							content
+						};
+						// Apply formatting to content if format flag is true;
+						const manifestContent = this.options.format
+							? JSON.stringify(manifest, null, 2)
+							: JSON.stringify(manifest);
+						const buffer = Buffer.from(manifestContent, "utf8");
+						mkdirp(
+							compiler.intermediateFileSystem,
+							dirname(compiler.intermediateFileSystem, targetPath),
+							err => {
+								if (err) return callback(err);
+								compiler.intermediateFileSystem.writeFile(
+									targetPath,
+									buffer,
+									callback
+								);
+							}
+						);
+					},
+					callback
+				);
+			}
+		);
+	}
+}
+module.exports = LibManifestPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/LibraryTemplatePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/LibraryTemplatePlugin.js
new file mode 100644
index 0000000..91cc4ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/LibraryTemplatePlugin.js
@@ -0,0 +1,48 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const EnableLibraryPlugin = require("./library/EnableLibraryPlugin");
+
+/** @typedef {import("../declarations/WebpackOptions").AuxiliaryComment} AuxiliaryComment */
+/** @typedef {import("../declarations/WebpackOptions").LibraryExport} LibraryExport */
+/** @typedef {import("../declarations/WebpackOptions").LibraryName} LibraryName */
+/** @typedef {import("../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../declarations/WebpackOptions").UmdNamedDefine} UmdNamedDefine */
+/** @typedef {import("./Compiler")} Compiler */
+
+// TODO webpack 6 remove
+class LibraryTemplatePlugin {
+	/**
+	 * @param {LibraryName} name name of library
+	 * @param {LibraryType} target type of library
+	 * @param {UmdNamedDefine} umdNamedDefine setting this to true will name the UMD module
+	 * @param {AuxiliaryComment} auxiliaryComment comment in the UMD wrapper
+	 * @param {LibraryExport} exportProperty which export should be exposed as library
+	 */
+	constructor(name, target, umdNamedDefine, auxiliaryComment, exportProperty) {
+		this.library = {
+			type: target || "var",
+			name,
+			umdNamedDefine,
+			auxiliaryComment,
+			export: exportProperty
+		};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { output } = compiler.options;
+		output.library = this.library;
+		new EnableLibraryPlugin(this.library.type).apply(compiler);
+	}
+}
+
+module.exports = LibraryTemplatePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/LoaderOptionsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/LoaderOptionsPlugin.js
new file mode 100644
index 0000000..a96c5bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/LoaderOptionsPlugin.js
@@ -0,0 +1,71 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleFilenameHelpers = require("./ModuleFilenameHelpers");
+const NormalModule = require("./NormalModule");
+const createSchemaValidation = require("./util/create-schema-validation");
+
+/** @typedef {import("../declarations/plugins/LoaderOptionsPlugin").LoaderOptionsPluginOptions} LoaderOptionsPluginOptions */
+/** @typedef {import("./Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/LoaderOptionsPlugin.check.js"),
+	() => require("../schemas/plugins/LoaderOptionsPlugin.json"),
+	{
+		name: "Loader Options Plugin",
+		baseDataPath: "options"
+	}
+);
+class LoaderOptionsPlugin {
+	/**
+	 * @param {LoaderOptionsPluginOptions} options options object
+	 */
+	constructor(options = {}) {
+		validate(options);
+		if (typeof options !== "object") options = {};
+		if (!options.test) {
+			options.test = {
+				test: () => true
+			};
+		}
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		compiler.hooks.compilation.tap("LoaderOptionsPlugin", compilation => {
+			NormalModule.getCompilationHooks(compilation).loader.tap(
+				"LoaderOptionsPlugin",
+				(context, module) => {
+					const resource = module.resource;
+					if (!resource) return;
+					const i = resource.indexOf("?");
+					if (
+						ModuleFilenameHelpers.matchObject(
+							options,
+							i < 0 ? resource : resource.substr(0, i)
+						)
+					) {
+						for (const key of Object.keys(options)) {
+							if (key === "include" || key === "exclude" || key === "test") {
+								continue;
+							}
+							context[key] = options[key];
+						}
+					}
+				}
+			);
+		});
+	}
+}
+
+module.exports = LoaderOptionsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/LoaderTargetPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/LoaderTargetPlugin.js
new file mode 100644
index 0000000..e7d3b38
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/LoaderTargetPlugin.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NormalModule = require("./NormalModule");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class LoaderTargetPlugin {
+	/**
+	 * @param {string} target the target
+	 */
+	constructor(target) {
+		this.target = target;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("LoaderTargetPlugin", compilation => {
+			NormalModule.getCompilationHooks(compilation).loader.tap(
+				"LoaderTargetPlugin",
+				loaderContext => {
+					loaderContext.target = this.target;
+				}
+			);
+		});
+	}
+}
+
+module.exports = LoaderTargetPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/MainTemplate.js b/node_modules/mathjs/examples/node_modules/webpack/lib/MainTemplate.js
new file mode 100644
index 0000000..ee07a0b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/MainTemplate.js
@@ -0,0 +1,329 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncWaterfallHook } = require("tapable");
+const util = require("util");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const memoize = require("./util/memoize");
+
+/** @typedef {import("webpack-sources").ConcatSource} ConcatSource */
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").Output} OutputOptions */
+/** @typedef {import("./ModuleTemplate")} ModuleTemplate */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("./Module")} Module} */
+/** @typedef {import("./util/Hash")} Hash} */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates} */
+/** @typedef {import("./javascript/JavascriptModulesPlugin").RenderContext} RenderContext} */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate} */
+/** @typedef {import("./ModuleGraph")} ModuleGraph} */
+/** @typedef {import("./ChunkGraph")} ChunkGraph} */
+/** @typedef {import("./Template").RenderManifestOptions} RenderManifestOptions} */
+/** @typedef {import("./Template").RenderManifestEntry} RenderManifestEntry} */
+
+const getJavascriptModulesPlugin = memoize(() =>
+	require("./javascript/JavascriptModulesPlugin")
+);
+const getJsonpTemplatePlugin = memoize(() =>
+	require("./web/JsonpTemplatePlugin")
+);
+const getLoadScriptRuntimeModule = memoize(() =>
+	require("./runtime/LoadScriptRuntimeModule")
+);
+
+// TODO webpack 6 remove this class
+class MainTemplate {
+	/**
+	 *
+	 * @param {OutputOptions} outputOptions output options for the MainTemplate
+	 * @param {Compilation} compilation the compilation
+	 */
+	constructor(outputOptions, compilation) {
+		/** @type {OutputOptions} */
+		this._outputOptions = outputOptions || {};
+		this.hooks = Object.freeze({
+			renderManifest: {
+				tap: util.deprecate(
+					(options, fn) => {
+						compilation.hooks.renderManifest.tap(
+							options,
+							(entries, options) => {
+								if (!options.chunk.hasRuntime()) return entries;
+								return fn(entries, options);
+							}
+						);
+					},
+					"MainTemplate.hooks.renderManifest is deprecated (use Compilation.hooks.renderManifest instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_RENDER_MANIFEST"
+				)
+			},
+			modules: {
+				tap: () => {
+					throw new Error(
+						"MainTemplate.hooks.modules has been removed (there is no replacement, please create an issue to request that)"
+					);
+				}
+			},
+			moduleObj: {
+				tap: () => {
+					throw new Error(
+						"MainTemplate.hooks.moduleObj has been removed (there is no replacement, please create an issue to request that)"
+					);
+				}
+			},
+			require: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.renderRequire.tap(options, fn);
+					},
+					"MainTemplate.hooks.require is deprecated (use JavascriptModulesPlugin.getCompilationHooks().renderRequire instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_REQUIRE"
+				)
+			},
+			beforeStartup: {
+				tap: () => {
+					throw new Error(
+						"MainTemplate.hooks.beforeStartup has been removed (use RuntimeGlobals.startupOnlyBefore instead)"
+					);
+				}
+			},
+			startup: {
+				tap: () => {
+					throw new Error(
+						"MainTemplate.hooks.startup has been removed (use RuntimeGlobals.startup instead)"
+					);
+				}
+			},
+			afterStartup: {
+				tap: () => {
+					throw new Error(
+						"MainTemplate.hooks.afterStartup has been removed (use RuntimeGlobals.startupOnlyAfter instead)"
+					);
+				}
+			},
+			render: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.render.tap(options, (source, renderContext) => {
+								if (
+									renderContext.chunkGraph.getNumberOfEntryModules(
+										renderContext.chunk
+									) === 0 ||
+									!renderContext.chunk.hasRuntime()
+								) {
+									return source;
+								}
+								return fn(
+									source,
+									renderContext.chunk,
+									compilation.hash,
+									compilation.moduleTemplates.javascript,
+									compilation.dependencyTemplates
+								);
+							});
+					},
+					"MainTemplate.hooks.render is deprecated (use JavascriptModulesPlugin.getCompilationHooks().render instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_RENDER"
+				)
+			},
+			renderWithEntry: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.render.tap(options, (source, renderContext) => {
+								if (
+									renderContext.chunkGraph.getNumberOfEntryModules(
+										renderContext.chunk
+									) === 0 ||
+									!renderContext.chunk.hasRuntime()
+								) {
+									return source;
+								}
+								return fn(source, renderContext.chunk, compilation.hash);
+							});
+					},
+					"MainTemplate.hooks.renderWithEntry is deprecated (use JavascriptModulesPlugin.getCompilationHooks().render instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_RENDER_WITH_ENTRY"
+				)
+			},
+			assetPath: {
+				tap: util.deprecate(
+					(options, fn) => {
+						compilation.hooks.assetPath.tap(options, fn);
+					},
+					"MainTemplate.hooks.assetPath is deprecated (use Compilation.hooks.assetPath instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_ASSET_PATH"
+				),
+				call: util.deprecate(
+					(filename, options) => {
+						return compilation.getAssetPath(filename, options);
+					},
+					"MainTemplate.hooks.assetPath is deprecated (use Compilation.hooks.assetPath instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_ASSET_PATH"
+				)
+			},
+			hash: {
+				tap: util.deprecate(
+					(options, fn) => {
+						compilation.hooks.fullHash.tap(options, fn);
+					},
+					"MainTemplate.hooks.hash is deprecated (use Compilation.hooks.fullHash instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_HASH"
+				)
+			},
+			hashForChunk: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.chunkHash.tap(options, (chunk, hash) => {
+								if (!chunk.hasRuntime()) return;
+								return fn(hash, chunk);
+							});
+					},
+					"MainTemplate.hooks.hashForChunk is deprecated (use JavascriptModulesPlugin.getCompilationHooks().chunkHash instead)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_HASH_FOR_CHUNK"
+				)
+			},
+			globalHashPaths: {
+				tap: util.deprecate(
+					() => {},
+					"MainTemplate.hooks.globalHashPaths has been removed (it's no longer needed)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_HASH_FOR_CHUNK"
+				)
+			},
+			globalHash: {
+				tap: util.deprecate(
+					() => {},
+					"MainTemplate.hooks.globalHash has been removed (it's no longer needed)",
+					"DEP_WEBPACK_MAIN_TEMPLATE_HASH_FOR_CHUNK"
+				)
+			},
+			hotBootstrap: {
+				tap: () => {
+					throw new Error(
+						"MainTemplate.hooks.hotBootstrap has been removed (use your own RuntimeModule instead)"
+					);
+				}
+			},
+
+			// for compatibility:
+			/** @type {SyncWaterfallHook<[string, Chunk, string, ModuleTemplate, DependencyTemplates]>} */
+			bootstrap: new SyncWaterfallHook([
+				"source",
+				"chunk",
+				"hash",
+				"moduleTemplate",
+				"dependencyTemplates"
+			]),
+			/** @type {SyncWaterfallHook<[string, Chunk, string]>} */
+			localVars: new SyncWaterfallHook(["source", "chunk", "hash"]),
+			/** @type {SyncWaterfallHook<[string, Chunk, string]>} */
+			requireExtensions: new SyncWaterfallHook(["source", "chunk", "hash"]),
+			/** @type {SyncWaterfallHook<[string, Chunk, string, string]>} */
+			requireEnsure: new SyncWaterfallHook([
+				"source",
+				"chunk",
+				"hash",
+				"chunkIdExpression"
+			]),
+			get jsonpScript() {
+				const hooks =
+					getLoadScriptRuntimeModule().getCompilationHooks(compilation);
+				return hooks.createScript;
+			},
+			get linkPrefetch() {
+				const hooks = getJsonpTemplatePlugin().getCompilationHooks(compilation);
+				return hooks.linkPrefetch;
+			},
+			get linkPreload() {
+				const hooks = getJsonpTemplatePlugin().getCompilationHooks(compilation);
+				return hooks.linkPreload;
+			}
+		});
+
+		this.renderCurrentHashCode = util.deprecate(
+			/**
+			 * @deprecated
+			 * @param {string} hash the hash
+			 * @param {number=} length length of the hash
+			 * @returns {string} generated code
+			 */ (hash, length) => {
+				if (length) {
+					return `${RuntimeGlobals.getFullHash} ? ${
+						RuntimeGlobals.getFullHash
+					}().slice(0, ${length}) : ${hash.slice(0, length)}`;
+				}
+				return `${RuntimeGlobals.getFullHash} ? ${RuntimeGlobals.getFullHash}() : ${hash}`;
+			},
+			"MainTemplate.renderCurrentHashCode is deprecated (use RuntimeGlobals.getFullHash runtime function instead)",
+			"DEP_WEBPACK_MAIN_TEMPLATE_RENDER_CURRENT_HASH_CODE"
+		);
+
+		this.getPublicPath = util.deprecate(
+			/**
+			 *
+			 * @param {object} options get public path options
+			 * @returns {string} hook call
+			 */ options => {
+				return compilation.getAssetPath(
+					compilation.outputOptions.publicPath,
+					options
+				);
+			},
+			"MainTemplate.getPublicPath is deprecated (use Compilation.getAssetPath(compilation.outputOptions.publicPath, options) instead)",
+			"DEP_WEBPACK_MAIN_TEMPLATE_GET_PUBLIC_PATH"
+		);
+
+		this.getAssetPath = util.deprecate(
+			(path, options) => {
+				return compilation.getAssetPath(path, options);
+			},
+			"MainTemplate.getAssetPath is deprecated (use Compilation.getAssetPath instead)",
+			"DEP_WEBPACK_MAIN_TEMPLATE_GET_ASSET_PATH"
+		);
+
+		this.getAssetPathWithInfo = util.deprecate(
+			(path, options) => {
+				return compilation.getAssetPathWithInfo(path, options);
+			},
+			"MainTemplate.getAssetPathWithInfo is deprecated (use Compilation.getAssetPath instead)",
+			"DEP_WEBPACK_MAIN_TEMPLATE_GET_ASSET_PATH_WITH_INFO"
+		);
+	}
+}
+
+Object.defineProperty(MainTemplate.prototype, "requireFn", {
+	get: util.deprecate(
+		() => "__webpack_require__",
+		'MainTemplate.requireFn is deprecated (use "__webpack_require__")',
+		"DEP_WEBPACK_MAIN_TEMPLATE_REQUIRE_FN"
+	)
+});
+
+Object.defineProperty(MainTemplate.prototype, "outputOptions", {
+	get: util.deprecate(
+		/**
+		 * @this {MainTemplate}
+		 * @returns {OutputOptions} output options
+		 */
+		function () {
+			return this._outputOptions;
+		},
+		"MainTemplate.outputOptions is deprecated (use Compilation.outputOptions instead)",
+		"DEP_WEBPACK_MAIN_TEMPLATE_OUTPUT_OPTIONS"
+	)
+});
+
+module.exports = MainTemplate;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Module.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Module.js
new file mode 100644
index 0000000..fadab9d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Module.js
@@ -0,0 +1,1091 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const ChunkGraph = require("./ChunkGraph");
+const DependenciesBlock = require("./DependenciesBlock");
+const ModuleGraph = require("./ModuleGraph");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const { first } = require("./util/SetHelpers");
+const { compareChunksById } = require("./util/comparators");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").ResolveOptions} ResolveOptions */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./ConcatenationScope")} ConcatenationScope */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./ExportsInfo").UsageStateType} UsageStateType */
+/** @typedef {import("./FileSystemInfo")} FileSystemInfo */
+/** @typedef {import("./ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("./NormalModuleFactory")} NormalModuleFactory */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./util/Hash")} Hash */
+/** @template T @typedef {import("./util/LazySet")<T>} LazySet<T> */
+/** @template T @typedef {import("./util/SortableSet")<T>} SortableSet<T> */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} SourceContext
+ * @property {DependencyTemplates} dependencyTemplates the dependency templates
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {RuntimeSpec} runtime the runtimes code should be generated for
+ * @property {string=} type the type of source that should be generated
+ */
+
+/**
+ * @typedef {Object} CodeGenerationContext
+ * @property {DependencyTemplates} dependencyTemplates the dependency templates
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {RuntimeSpec} runtime the runtimes code should be generated for
+ * @property {ConcatenationScope=} concatenationScope when in concatenated module, information about other concatenated modules
+ * @property {CodeGenerationResults} codeGenerationResults code generation results of other modules (need to have a codeGenerationDependency to use that)
+ */
+
+/**
+ * @typedef {Object} ConcatenationBailoutReasonContext
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ */
+
+/**
+ * @typedef {Object} CodeGenerationResult
+ * @property {Map<string, Source>} sources the resulting sources for all source types
+ * @property {Map<string, any>=} data the resulting data for all source types
+ * @property {ReadonlySet<string>} runtimeRequirements the runtime requirements
+ * @property {string=} hash a hash of the code generation result (will be automatically calculated from sources and runtimeRequirements if not provided)
+ */
+
+/**
+ * @typedef {Object} LibIdentOptions
+ * @property {string} context absolute context path to which lib ident is relative to
+ * @property {Object=} associatedObjectForCache object for caching
+ */
+
+/**
+ * @typedef {Object} KnownBuildMeta
+ * @property {string=} moduleArgument
+ * @property {string=} exportsArgument
+ * @property {boolean=} strict
+ * @property {string=} moduleConcatenationBailout
+ * @property {("default" | "namespace" | "flagged" | "dynamic")=} exportsType
+ * @property {(false | "redirect" | "redirect-warn")=} defaultObject
+ * @property {boolean=} strictHarmonyModule
+ * @property {boolean=} async
+ * @property {boolean=} sideEffectFree
+ */
+
+/**
+ * @typedef {Object} NeedBuildContext
+ * @property {Compilation} compilation
+ * @property {FileSystemInfo} fileSystemInfo
+ * @property {Map<string, string | Set<string>>} valueCacheVersions
+ */
+
+/** @typedef {KnownBuildMeta & Record<string, any>} BuildMeta */
+
+const EMPTY_RESOLVE_OPTIONS = {};
+
+let debugId = 1000;
+
+const DEFAULT_TYPES_UNKNOWN = new Set(["unknown"]);
+const DEFAULT_TYPES_JS = new Set(["javascript"]);
+
+const deprecatedNeedRebuild = util.deprecate(
+	(module, context) => {
+		return module.needRebuild(
+			context.fileSystemInfo.getDeprecatedFileTimestamps(),
+			context.fileSystemInfo.getDeprecatedContextTimestamps()
+		);
+	},
+	"Module.needRebuild is deprecated in favor of Module.needBuild",
+	"DEP_WEBPACK_MODULE_NEED_REBUILD"
+);
+
+/** @typedef {(requestShortener: RequestShortener) => string} OptimizationBailoutFunction */
+
+class Module extends DependenciesBlock {
+	/**
+	 * @param {string} type the module type
+	 * @param {string=} context an optional context
+	 * @param {string=} layer an optional layer in which the module is
+	 */
+	constructor(type, context = null, layer = null) {
+		super();
+
+		/** @type {string} */
+		this.type = type;
+		/** @type {string | null} */
+		this.context = context;
+		/** @type {string | null} */
+		this.layer = layer;
+		/** @type {boolean} */
+		this.needId = true;
+
+		// Unique Id
+		/** @type {number} */
+		this.debugId = debugId++;
+
+		// Info from Factory
+		/** @type {ResolveOptions} */
+		this.resolveOptions = EMPTY_RESOLVE_OPTIONS;
+		/** @type {object | undefined} */
+		this.factoryMeta = undefined;
+		// TODO refactor this -> options object filled from Factory
+		// TODO webpack 6: use an enum
+		/** @type {boolean} */
+		this.useSourceMap = false;
+		/** @type {boolean} */
+		this.useSimpleSourceMap = false;
+
+		// Info from Build
+		/** @type {WebpackError[] | undefined} */
+		this._warnings = undefined;
+		/** @type {WebpackError[] | undefined} */
+		this._errors = undefined;
+		/** @type {BuildMeta} */
+		this.buildMeta = undefined;
+		/** @type {Record<string, any>} */
+		this.buildInfo = undefined;
+		/** @type {Dependency[] | undefined} */
+		this.presentationalDependencies = undefined;
+		/** @type {Dependency[] | undefined} */
+		this.codeGenerationDependencies = undefined;
+	}
+
+	// TODO remove in webpack 6
+	// BACKWARD-COMPAT START
+	get id() {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.id",
+			"DEP_WEBPACK_MODULE_ID"
+		).getModuleId(this);
+	}
+
+	set id(value) {
+		if (value === "") {
+			this.needId = false;
+			return;
+		}
+		ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.id",
+			"DEP_WEBPACK_MODULE_ID"
+		).setModuleId(this, value);
+	}
+
+	/**
+	 * @returns {string} the hash of the module
+	 */
+	get hash() {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.hash",
+			"DEP_WEBPACK_MODULE_HASH"
+		).getModuleHash(this, undefined);
+	}
+
+	/**
+	 * @returns {string} the shortened hash of the module
+	 */
+	get renderedHash() {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.renderedHash",
+			"DEP_WEBPACK_MODULE_RENDERED_HASH"
+		).getRenderedModuleHash(this, undefined);
+	}
+
+	get profile() {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.profile",
+			"DEP_WEBPACK_MODULE_PROFILE"
+		).getProfile(this);
+	}
+
+	set profile(value) {
+		ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.profile",
+			"DEP_WEBPACK_MODULE_PROFILE"
+		).setProfile(this, value);
+	}
+
+	get index() {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.index",
+			"DEP_WEBPACK_MODULE_INDEX"
+		).getPreOrderIndex(this);
+	}
+
+	set index(value) {
+		ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.index",
+			"DEP_WEBPACK_MODULE_INDEX"
+		).setPreOrderIndex(this, value);
+	}
+
+	get index2() {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.index2",
+			"DEP_WEBPACK_MODULE_INDEX2"
+		).getPostOrderIndex(this);
+	}
+
+	set index2(value) {
+		ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.index2",
+			"DEP_WEBPACK_MODULE_INDEX2"
+		).setPostOrderIndex(this, value);
+	}
+
+	get depth() {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.depth",
+			"DEP_WEBPACK_MODULE_DEPTH"
+		).getDepth(this);
+	}
+
+	set depth(value) {
+		ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.depth",
+			"DEP_WEBPACK_MODULE_DEPTH"
+		).setDepth(this, value);
+	}
+
+	get issuer() {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.issuer",
+			"DEP_WEBPACK_MODULE_ISSUER"
+		).getIssuer(this);
+	}
+
+	set issuer(value) {
+		ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.issuer",
+			"DEP_WEBPACK_MODULE_ISSUER"
+		).setIssuer(this, value);
+	}
+
+	get usedExports() {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.usedExports",
+			"DEP_WEBPACK_MODULE_USED_EXPORTS"
+		).getUsedExports(this, undefined);
+	}
+
+	/**
+	 * @deprecated
+	 * @returns {(string | OptimizationBailoutFunction)[]} list
+	 */
+	get optimizationBailout() {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.optimizationBailout",
+			"DEP_WEBPACK_MODULE_OPTIMIZATION_BAILOUT"
+		).getOptimizationBailout(this);
+	}
+
+	get optional() {
+		return this.isOptional(
+			ModuleGraph.getModuleGraphForModule(
+				this,
+				"Module.optional",
+				"DEP_WEBPACK_MODULE_OPTIONAL"
+			)
+		);
+	}
+
+	addChunk(chunk) {
+		const chunkGraph = ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.addChunk",
+			"DEP_WEBPACK_MODULE_ADD_CHUNK"
+		);
+		if (chunkGraph.isModuleInChunk(this, chunk)) return false;
+		chunkGraph.connectChunkAndModule(chunk, this);
+		return true;
+	}
+
+	removeChunk(chunk) {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.removeChunk",
+			"DEP_WEBPACK_MODULE_REMOVE_CHUNK"
+		).disconnectChunkAndModule(chunk, this);
+	}
+
+	isInChunk(chunk) {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.isInChunk",
+			"DEP_WEBPACK_MODULE_IS_IN_CHUNK"
+		).isModuleInChunk(this, chunk);
+	}
+
+	isEntryModule() {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.isEntryModule",
+			"DEP_WEBPACK_MODULE_IS_ENTRY_MODULE"
+		).isEntryModule(this);
+	}
+
+	getChunks() {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.getChunks",
+			"DEP_WEBPACK_MODULE_GET_CHUNKS"
+		).getModuleChunks(this);
+	}
+
+	getNumberOfChunks() {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.getNumberOfChunks",
+			"DEP_WEBPACK_MODULE_GET_NUMBER_OF_CHUNKS"
+		).getNumberOfModuleChunks(this);
+	}
+
+	get chunksIterable() {
+		return ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.chunksIterable",
+			"DEP_WEBPACK_MODULE_CHUNKS_ITERABLE"
+		).getOrderedModuleChunksIterable(this, compareChunksById);
+	}
+
+	/**
+	 * @param {string} exportName a name of an export
+	 * @returns {boolean | null} true, if the export is provided why the module.
+	 * null, if it's unknown.
+	 * false, if it's not provided.
+	 */
+	isProvided(exportName) {
+		return ModuleGraph.getModuleGraphForModule(
+			this,
+			"Module.usedExports",
+			"DEP_WEBPACK_MODULE_USED_EXPORTS"
+		).isExportProvided(this, exportName);
+	}
+	// BACKWARD-COMPAT END
+
+	/**
+	 * @returns {string} name of the exports argument
+	 */
+	get exportsArgument() {
+		return (this.buildInfo && this.buildInfo.exportsArgument) || "exports";
+	}
+
+	/**
+	 * @returns {string} name of the module argument
+	 */
+	get moduleArgument() {
+		return (this.buildInfo && this.buildInfo.moduleArgument) || "module";
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {boolean} strict the importing module is strict
+	 * @returns {"namespace" | "default-only" | "default-with-named" | "dynamic"} export type
+	 * "namespace": Exports is already a namespace object. namespace = exports.
+	 * "dynamic": Check at runtime if __esModule is set. When set: namespace = { ...exports, default: exports }. When not set: namespace = { default: exports }.
+	 * "default-only": Provide a namespace object with only default export. namespace = { default: exports }
+	 * "default-with-named": Provide a namespace object with named and default export. namespace = { ...exports, default: exports }
+	 */
+	getExportsType(moduleGraph, strict) {
+		switch (this.buildMeta && this.buildMeta.exportsType) {
+			case "flagged":
+				return strict ? "default-with-named" : "namespace";
+			case "namespace":
+				return "namespace";
+			case "default":
+				switch (this.buildMeta.defaultObject) {
+					case "redirect":
+						return "default-with-named";
+					case "redirect-warn":
+						return strict ? "default-only" : "default-with-named";
+					default:
+						return "default-only";
+				}
+			case "dynamic": {
+				if (strict) return "default-with-named";
+				// Try to figure out value of __esModule by following reexports
+				const handleDefault = () => {
+					switch (this.buildMeta.defaultObject) {
+						case "redirect":
+						case "redirect-warn":
+							return "default-with-named";
+						default:
+							return "default-only";
+					}
+				};
+				const exportInfo = moduleGraph.getReadOnlyExportInfo(
+					this,
+					"__esModule"
+				);
+				if (exportInfo.provided === false) {
+					return handleDefault();
+				}
+				const target = exportInfo.getTarget(moduleGraph);
+				if (
+					!target ||
+					!target.export ||
+					target.export.length !== 1 ||
+					target.export[0] !== "__esModule"
+				) {
+					return "dynamic";
+				}
+				switch (
+					target.module.buildMeta &&
+					target.module.buildMeta.exportsType
+				) {
+					case "flagged":
+					case "namespace":
+						return "namespace";
+					case "default":
+						return handleDefault();
+					default:
+						return "dynamic";
+				}
+			}
+			default:
+				return strict ? "default-with-named" : "dynamic";
+		}
+	}
+
+	/**
+	 * @param {Dependency} presentationalDependency dependency being tied to module.
+	 * This is a Dependency without edge in the module graph. It's only for presentation.
+	 * @returns {void}
+	 */
+	addPresentationalDependency(presentationalDependency) {
+		if (this.presentationalDependencies === undefined) {
+			this.presentationalDependencies = [];
+		}
+		this.presentationalDependencies.push(presentationalDependency);
+	}
+
+	/**
+	 * @param {Dependency} codeGenerationDependency dependency being tied to module.
+	 * This is a Dependency where the code generation result of the referenced module is needed during code generation.
+	 * The Dependency should also be added to normal dependencies via addDependency.
+	 * @returns {void}
+	 */
+	addCodeGenerationDependency(codeGenerationDependency) {
+		if (this.codeGenerationDependencies === undefined) {
+			this.codeGenerationDependencies = [];
+		}
+		this.codeGenerationDependencies.push(codeGenerationDependency);
+	}
+
+	/**
+	 * Removes all dependencies and blocks
+	 * @returns {void}
+	 */
+	clearDependenciesAndBlocks() {
+		if (this.presentationalDependencies !== undefined) {
+			this.presentationalDependencies.length = 0;
+		}
+		if (this.codeGenerationDependencies !== undefined) {
+			this.codeGenerationDependencies.length = 0;
+		}
+		super.clearDependenciesAndBlocks();
+	}
+
+	/**
+	 * @param {WebpackError} warning the warning
+	 * @returns {void}
+	 */
+	addWarning(warning) {
+		if (this._warnings === undefined) {
+			this._warnings = [];
+		}
+		this._warnings.push(warning);
+	}
+
+	/**
+	 * @returns {Iterable<WebpackError> | undefined} list of warnings if any
+	 */
+	getWarnings() {
+		return this._warnings;
+	}
+
+	/**
+	 * @returns {number} number of warnings
+	 */
+	getNumberOfWarnings() {
+		return this._warnings !== undefined ? this._warnings.length : 0;
+	}
+
+	/**
+	 * @param {WebpackError} error the error
+	 * @returns {void}
+	 */
+	addError(error) {
+		if (this._errors === undefined) {
+			this._errors = [];
+		}
+		this._errors.push(error);
+	}
+
+	/**
+	 * @returns {Iterable<WebpackError> | undefined} list of errors if any
+	 */
+	getErrors() {
+		return this._errors;
+	}
+
+	/**
+	 * @returns {number} number of errors
+	 */
+	getNumberOfErrors() {
+		return this._errors !== undefined ? this._errors.length : 0;
+	}
+
+	/**
+	 * removes all warnings and errors
+	 * @returns {void}
+	 */
+	clearWarningsAndErrors() {
+		if (this._warnings !== undefined) {
+			this._warnings.length = 0;
+		}
+		if (this._errors !== undefined) {
+			this._errors.length = 0;
+		}
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {boolean} true, if the module is optional
+	 */
+	isOptional(moduleGraph) {
+		let hasConnections = false;
+		for (const r of moduleGraph.getIncomingConnections(this)) {
+			if (
+				!r.dependency ||
+				!r.dependency.optional ||
+				!r.isTargetActive(undefined)
+			) {
+				return false;
+			}
+			hasConnections = true;
+		}
+		return hasConnections;
+	}
+
+	/**
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {Chunk} chunk a chunk
+	 * @param {Chunk=} ignoreChunk chunk to be ignored
+	 * @returns {boolean} true, if the module is accessible from "chunk" when ignoring "ignoreChunk"
+	 */
+	isAccessibleInChunk(chunkGraph, chunk, ignoreChunk) {
+		// Check if module is accessible in ALL chunk groups
+		for (const chunkGroup of chunk.groupsIterable) {
+			if (!this.isAccessibleInChunkGroup(chunkGraph, chunkGroup)) return false;
+		}
+		return true;
+	}
+
+	/**
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {ChunkGroup} chunkGroup a chunk group
+	 * @param {Chunk=} ignoreChunk chunk to be ignored
+	 * @returns {boolean} true, if the module is accessible from "chunkGroup" when ignoring "ignoreChunk"
+	 */
+	isAccessibleInChunkGroup(chunkGraph, chunkGroup, ignoreChunk) {
+		const queue = new Set([chunkGroup]);
+
+		// Check if module is accessible from all items of the queue
+		queueFor: for (const cg of queue) {
+			// 1. If module is in one of the chunks of the group we can continue checking the next items
+			//    because it's accessible.
+			for (const chunk of cg.chunks) {
+				if (chunk !== ignoreChunk && chunkGraph.isModuleInChunk(this, chunk))
+					continue queueFor;
+			}
+			// 2. If the chunk group is initial, we can break here because it's not accessible.
+			if (chunkGroup.isInitial()) return false;
+			// 3. Enqueue all parents because it must be accessible from ALL parents
+			for (const parent of chunkGroup.parentsIterable) queue.add(parent);
+		}
+		// When we processed through the whole list and we didn't bailout, the module is accessible
+		return true;
+	}
+
+	/**
+	 * @param {Chunk} chunk a chunk
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {boolean} true, if the module has any reason why "chunk" should be included
+	 */
+	hasReasonForChunk(chunk, moduleGraph, chunkGraph) {
+		// check for each reason if we need the chunk
+		for (const [
+			fromModule,
+			connections
+		] of moduleGraph.getIncomingConnectionsByOriginModule(this)) {
+			if (!connections.some(c => c.isTargetActive(chunk.runtime))) continue;
+			for (const originChunk of chunkGraph.getModuleChunksIterable(
+				fromModule
+			)) {
+				// return true if module this is not reachable from originChunk when ignoring chunk
+				if (!this.isAccessibleInChunk(chunkGraph, originChunk, chunk))
+					return true;
+			}
+		}
+		return false;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true if at least one other module depends on this module
+	 */
+	hasReasons(moduleGraph, runtime) {
+		for (const c of moduleGraph.getIncomingConnections(this)) {
+			if (c.isTargetActive(runtime)) return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @returns {string} for debugging
+	 */
+	toString() {
+		return `Module[${this.debugId}: ${this.identifier()}]`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		callback(
+			null,
+			!this.buildMeta ||
+				this.needRebuild === Module.prototype.needRebuild ||
+				deprecatedNeedRebuild(this, context)
+		);
+	}
+
+	/**
+	 * @deprecated Use needBuild instead
+	 * @param {Map<string, number|null>} fileTimestamps timestamps of files
+	 * @param {Map<string, number|null>} contextTimestamps timestamps of directories
+	 * @returns {boolean} true, if the module needs a rebuild
+	 */
+	needRebuild(fileTimestamps, contextTimestamps) {
+		return true;
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(
+		hash,
+		context = {
+			chunkGraph: ChunkGraph.getChunkGraphForModule(
+				this,
+				"Module.updateHash",
+				"DEP_WEBPACK_MODULE_UPDATE_HASH"
+			),
+			runtime: undefined
+		}
+	) {
+		const { chunkGraph, runtime } = context;
+		hash.update(chunkGraph.getModuleGraphHash(this, runtime));
+		if (this.presentationalDependencies !== undefined) {
+			for (const dep of this.presentationalDependencies) {
+				dep.updateHash(hash, context);
+			}
+		}
+		super.updateHash(hash, context);
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	invalidateBuild() {
+		// should be overridden to support this feature
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/**
+	 * @abstract
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		// Better override this method to return the correct types
+		if (this.source === Module.prototype.source) {
+			return DEFAULT_TYPES_UNKNOWN;
+		} else {
+			return DEFAULT_TYPES_JS;
+		}
+	}
+
+	/**
+	 * @abstract
+	 * @deprecated Use codeGeneration() instead
+	 * @param {DependencyTemplates} dependencyTemplates the dependency templates
+	 * @param {RuntimeTemplate} runtimeTemplate the runtime template
+	 * @param {string=} type the type of source that should be generated
+	 * @returns {Source} generated source
+	 */
+	source(dependencyTemplates, runtimeTemplate, type = "javascript") {
+		if (this.codeGeneration === Module.prototype.codeGeneration) {
+			const AbstractMethodError = require("./AbstractMethodError");
+			throw new AbstractMethodError();
+		}
+		const chunkGraph = ChunkGraph.getChunkGraphForModule(
+			this,
+			"Module.source() is deprecated. Use Compilation.codeGenerationResults.getSource(module, runtime, type) instead",
+			"DEP_WEBPACK_MODULE_SOURCE"
+		);
+		/** @type {CodeGenerationContext} */
+		const codeGenContext = {
+			dependencyTemplates,
+			runtimeTemplate,
+			moduleGraph: chunkGraph.moduleGraph,
+			chunkGraph,
+			runtime: undefined,
+			codeGenerationResults: undefined
+		};
+		const sources = this.codeGeneration(codeGenContext).sources;
+		return type ? sources.get(type) : sources.get(first(this.getSourceTypes()));
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return null;
+	}
+
+	/**
+	 * @returns {string | null} absolute path which should be used for condition matching (usually the resource path)
+	 */
+	nameForCondition() {
+		return null;
+	}
+
+	/**
+	 * @param {ConcatenationBailoutReasonContext} context context
+	 * @returns {string | undefined} reason why this module can't be concatenated, undefined when it can be concatenated
+	 */
+	getConcatenationBailoutReason(context) {
+		return `Module Concatenation is not implemented for ${this.constructor.name}`;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this module should be connected to referencing modules when consumed for side-effects only
+	 */
+	getSideEffectsConnectionState(moduleGraph) {
+		return true;
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration(context) {
+		// Best override this method
+		const sources = new Map();
+		for (const type of this.getSourceTypes()) {
+			if (type !== "unknown") {
+				sources.set(
+					type,
+					this.source(
+						context.dependencyTemplates,
+						context.runtimeTemplate,
+						type
+					)
+				);
+			}
+		}
+		return {
+			sources,
+			runtimeRequirements: new Set([
+				RuntimeGlobals.module,
+				RuntimeGlobals.exports,
+				RuntimeGlobals.require
+			])
+		};
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk which condition should be checked
+	 * @param {Compilation} compilation the compilation
+	 * @returns {boolean} true, if the chunk is ok for the module
+	 */
+	chunkCondition(chunk, compilation) {
+		return true;
+	}
+
+	hasChunkCondition() {
+		return this.chunkCondition !== Module.prototype.chunkCondition;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 * @param {Module} module fresh module
+	 * @returns {void}
+	 */
+	updateCacheModule(module) {
+		this.type = module.type;
+		this.layer = module.layer;
+		this.context = module.context;
+		this.factoryMeta = module.factoryMeta;
+		this.resolveOptions = module.resolveOptions;
+	}
+
+	/**
+	 * Module should be unsafe cached. Get data that's needed for that.
+	 * This data will be passed to restoreFromUnsafeCache later.
+	 * @returns {object} cached data
+	 */
+	getUnsafeCacheData() {
+		return {
+			factoryMeta: this.factoryMeta,
+			resolveOptions: this.resolveOptions
+		};
+	}
+
+	/**
+	 * restore unsafe cache data
+	 * @param {object} unsafeCacheData data from getUnsafeCacheData
+	 * @param {NormalModuleFactory} normalModuleFactory the normal module factory handling the unsafe caching
+	 */
+	_restoreFromUnsafeCache(unsafeCacheData, normalModuleFactory) {
+		this.factoryMeta = unsafeCacheData.factoryMeta;
+		this.resolveOptions = unsafeCacheData.resolveOptions;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Remove internal references to allow freeing some memory.
+	 */
+	cleanupForCache() {
+		this.factoryMeta = undefined;
+		this.resolveOptions = undefined;
+	}
+
+	/**
+	 * @returns {Source | null} the original source for the module before webpack transformation
+	 */
+	originalSource() {
+		return null;
+	}
+
+	/**
+	 * @param {LazySet<string>} fileDependencies set where file dependencies are added to
+	 * @param {LazySet<string>} contextDependencies set where context dependencies are added to
+	 * @param {LazySet<string>} missingDependencies set where missing dependencies are added to
+	 * @param {LazySet<string>} buildDependencies set where build dependencies are added to
+	 */
+	addCacheDependencies(
+		fileDependencies,
+		contextDependencies,
+		missingDependencies,
+		buildDependencies
+	) {}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.type);
+		write(this.layer);
+		write(this.context);
+		write(this.resolveOptions);
+		write(this.factoryMeta);
+		write(this.useSourceMap);
+		write(this.useSimpleSourceMap);
+		write(
+			this._warnings !== undefined && this._warnings.length === 0
+				? undefined
+				: this._warnings
+		);
+		write(
+			this._errors !== undefined && this._errors.length === 0
+				? undefined
+				: this._errors
+		);
+		write(this.buildMeta);
+		write(this.buildInfo);
+		write(this.presentationalDependencies);
+		write(this.codeGenerationDependencies);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.type = read();
+		this.layer = read();
+		this.context = read();
+		this.resolveOptions = read();
+		this.factoryMeta = read();
+		this.useSourceMap = read();
+		this.useSimpleSourceMap = read();
+		this._warnings = read();
+		this._errors = read();
+		this.buildMeta = read();
+		this.buildInfo = read();
+		this.presentationalDependencies = read();
+		this.codeGenerationDependencies = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(Module, "webpack/lib/Module");
+
+// TODO remove in webpack 6
+Object.defineProperty(Module.prototype, "hasEqualsChunks", {
+	get() {
+		throw new Error(
+			"Module.hasEqualsChunks was renamed (use hasEqualChunks instead)"
+		);
+	}
+});
+
+// TODO remove in webpack 6
+Object.defineProperty(Module.prototype, "isUsed", {
+	get() {
+		throw new Error(
+			"Module.isUsed was renamed (use getUsedName, isExportUsed or isModuleUsed instead)"
+		);
+	}
+});
+
+// TODO remove in webpack 6
+Object.defineProperty(Module.prototype, "errors", {
+	get: util.deprecate(
+		/**
+		 * @this {Module}
+		 * @returns {WebpackError[]} array
+		 */
+		function () {
+			if (this._errors === undefined) {
+				this._errors = [];
+			}
+			return this._errors;
+		},
+		"Module.errors was removed (use getErrors instead)",
+		"DEP_WEBPACK_MODULE_ERRORS"
+	)
+});
+
+// TODO remove in webpack 6
+Object.defineProperty(Module.prototype, "warnings", {
+	get: util.deprecate(
+		/**
+		 * @this {Module}
+		 * @returns {WebpackError[]} array
+		 */
+		function () {
+			if (this._warnings === undefined) {
+				this._warnings = [];
+			}
+			return this._warnings;
+		},
+		"Module.warnings was removed (use getWarnings instead)",
+		"DEP_WEBPACK_MODULE_WARNINGS"
+	)
+});
+
+// TODO remove in webpack 6
+Object.defineProperty(Module.prototype, "used", {
+	get() {
+		throw new Error(
+			"Module.used was refactored (use ModuleGraph.getUsedExports instead)"
+		);
+	},
+	set(value) {
+		throw new Error(
+			"Module.used was refactored (use ModuleGraph.setUsedExports instead)"
+		);
+	}
+});
+
+module.exports = Module;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleBuildError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleBuildError.js
new file mode 100644
index 0000000..a91d785
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleBuildError.js
@@ -0,0 +1,77 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { cutOffLoaderExecution } = require("./ErrorHelpers");
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+class ModuleBuildError extends WebpackError {
+	/**
+	 * @param {string | Error&any} err error thrown
+	 * @param {{from?: string|null}} info additional info
+	 */
+	constructor(err, { from = null } = {}) {
+		let message = "Module build failed";
+		let details = undefined;
+
+		if (from) {
+			message += ` (from ${from}):\n`;
+		} else {
+			message += ": ";
+		}
+
+		if (err !== null && typeof err === "object") {
+			if (typeof err.stack === "string" && err.stack) {
+				const stack = cutOffLoaderExecution(err.stack);
+
+				if (!err.hideStack) {
+					message += stack;
+				} else {
+					details = stack;
+
+					if (typeof err.message === "string" && err.message) {
+						message += err.message;
+					} else {
+						message += err;
+					}
+				}
+			} else if (typeof err.message === "string" && err.message) {
+				message += err.message;
+			} else {
+				message += String(err);
+			}
+		} else {
+			message += String(err);
+		}
+
+		super(message);
+
+		this.name = "ModuleBuildError";
+		this.details = details;
+		this.error = err;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.error);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.error = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ModuleBuildError, "webpack/lib/ModuleBuildError");
+
+module.exports = ModuleBuildError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleDependencyError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleDependencyError.js
new file mode 100644
index 0000000..416a635
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleDependencyError.js
@@ -0,0 +1,40 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Module")} Module */
+
+class ModuleDependencyError extends WebpackError {
+	/**
+	 * Creates an instance of ModuleDependencyError.
+	 * @param {Module} module module tied to dependency
+	 * @param {Error} err error thrown
+	 * @param {DependencyLocation} loc location of dependency
+	 */
+	constructor(module, err, loc) {
+		super(err.message);
+
+		this.name = "ModuleDependencyError";
+		this.details =
+			err && !(/** @type {any} */ (err).hideStack)
+				? err.stack.split("\n").slice(1).join("\n")
+				: undefined;
+		this.module = module;
+		this.loc = loc;
+		/** error is not (de)serialized, so it might be undefined after deserialization */
+		this.error = err;
+
+		if (err && /** @type {any} */ (err).hideStack) {
+			this.stack =
+				err.stack.split("\n").slice(1).join("\n") + "\n\n" + this.stack;
+		}
+	}
+}
+
+module.exports = ModuleDependencyError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleDependencyWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleDependencyWarning.js
new file mode 100644
index 0000000..f22a582
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleDependencyWarning.js
@@ -0,0 +1,45 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Module")} Module */
+
+class ModuleDependencyWarning extends WebpackError {
+	/**
+	 * @param {Module} module module tied to dependency
+	 * @param {Error} err error thrown
+	 * @param {DependencyLocation} loc location of dependency
+	 */
+	constructor(module, err, loc) {
+		super(err ? err.message : "");
+
+		this.name = "ModuleDependencyWarning";
+		this.details =
+			err && !(/** @type {any} */ (err).hideStack)
+				? err.stack.split("\n").slice(1).join("\n")
+				: undefined;
+		this.module = module;
+		this.loc = loc;
+		/** error is not (de)serialized, so it might be undefined after deserialization */
+		this.error = err;
+
+		if (err && /** @type {any} */ (err).hideStack) {
+			this.stack =
+				err.stack.split("\n").slice(1).join("\n") + "\n\n" + this.stack;
+		}
+	}
+}
+
+makeSerializable(
+	ModuleDependencyWarning,
+	"webpack/lib/ModuleDependencyWarning"
+);
+
+module.exports = ModuleDependencyWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleError.js
new file mode 100644
index 0000000..d6a17ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleError.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { cleanUp } = require("./ErrorHelpers");
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+class ModuleError extends WebpackError {
+	/**
+	 * @param {Error} err error thrown
+	 * @param {{from?: string|null}} info additional info
+	 */
+	constructor(err, { from = null } = {}) {
+		let message = "Module Error";
+
+		if (from) {
+			message += ` (from ${from}):\n`;
+		} else {
+			message += ": ";
+		}
+
+		if (err && typeof err === "object" && err.message) {
+			message += err.message;
+		} else if (err) {
+			message += err;
+		}
+
+		super(message);
+
+		this.name = "ModuleError";
+		this.error = err;
+		this.details =
+			err && typeof err === "object" && err.stack
+				? cleanUp(err.stack, this.message)
+				: undefined;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.error);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.error = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ModuleError, "webpack/lib/ModuleError");
+
+module.exports = ModuleError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleFactory.js
new file mode 100644
index 0000000..0cc084c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleFactory.js
@@ -0,0 +1,50 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../declarations/WebpackOptions").ResolveOptions} ResolveOptions */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Module")} Module */
+
+/**
+ * @typedef {Object} ModuleFactoryResult
+ * @property {Module=} module the created module or unset if no module was created
+ * @property {Set<string>=} fileDependencies
+ * @property {Set<string>=} contextDependencies
+ * @property {Set<string>=} missingDependencies
+ * @property {boolean=} cacheable allow to use the unsafe cache
+ */
+
+/**
+ * @typedef {Object} ModuleFactoryCreateDataContextInfo
+ * @property {string} issuer
+ * @property {string | null=} issuerLayer
+ * @property {string} compiler
+ */
+
+/**
+ * @typedef {Object} ModuleFactoryCreateData
+ * @property {ModuleFactoryCreateDataContextInfo} contextInfo
+ * @property {ResolveOptions=} resolveOptions
+ * @property {string} context
+ * @property {Dependency[]} dependencies
+ */
+
+class ModuleFactory {
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+}
+
+module.exports = ModuleFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleFilenameHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleFilenameHelpers.js
new file mode 100644
index 0000000..610615d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleFilenameHelpers.js
@@ -0,0 +1,277 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NormalModule = require("./NormalModule");
+const createHash = require("./util/createHash");
+const memoize = require("./util/memoize");
+
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {typeof import("./util/Hash")} Hash */
+
+const ModuleFilenameHelpers = exports;
+
+// TODO webpack 6: consider removing these
+ModuleFilenameHelpers.ALL_LOADERS_RESOURCE = "[all-loaders][resource]";
+ModuleFilenameHelpers.REGEXP_ALL_LOADERS_RESOURCE =
+	/\[all-?loaders\]\[resource\]/gi;
+ModuleFilenameHelpers.LOADERS_RESOURCE = "[loaders][resource]";
+ModuleFilenameHelpers.REGEXP_LOADERS_RESOURCE = /\[loaders\]\[resource\]/gi;
+ModuleFilenameHelpers.RESOURCE = "[resource]";
+ModuleFilenameHelpers.REGEXP_RESOURCE = /\[resource\]/gi;
+ModuleFilenameHelpers.ABSOLUTE_RESOURCE_PATH = "[absolute-resource-path]";
+// cSpell:words olute
+ModuleFilenameHelpers.REGEXP_ABSOLUTE_RESOURCE_PATH =
+	/\[abs(olute)?-?resource-?path\]/gi;
+ModuleFilenameHelpers.RESOURCE_PATH = "[resource-path]";
+ModuleFilenameHelpers.REGEXP_RESOURCE_PATH = /\[resource-?path\]/gi;
+ModuleFilenameHelpers.ALL_LOADERS = "[all-loaders]";
+ModuleFilenameHelpers.REGEXP_ALL_LOADERS = /\[all-?loaders\]/gi;
+ModuleFilenameHelpers.LOADERS = "[loaders]";
+ModuleFilenameHelpers.REGEXP_LOADERS = /\[loaders\]/gi;
+ModuleFilenameHelpers.QUERY = "[query]";
+ModuleFilenameHelpers.REGEXP_QUERY = /\[query\]/gi;
+ModuleFilenameHelpers.ID = "[id]";
+ModuleFilenameHelpers.REGEXP_ID = /\[id\]/gi;
+ModuleFilenameHelpers.HASH = "[hash]";
+ModuleFilenameHelpers.REGEXP_HASH = /\[hash\]/gi;
+ModuleFilenameHelpers.NAMESPACE = "[namespace]";
+ModuleFilenameHelpers.REGEXP_NAMESPACE = /\[namespace\]/gi;
+
+const getAfter = (strFn, token) => {
+	return () => {
+		const str = strFn();
+		const idx = str.indexOf(token);
+		return idx < 0 ? "" : str.substr(idx);
+	};
+};
+
+const getBefore = (strFn, token) => {
+	return () => {
+		const str = strFn();
+		const idx = str.lastIndexOf(token);
+		return idx < 0 ? "" : str.substr(0, idx);
+	};
+};
+
+const getHash = (strFn, hashFunction) => {
+	return () => {
+		const hash = createHash(hashFunction);
+		hash.update(strFn());
+		const digest = /** @type {string} */ (hash.digest("hex"));
+		return digest.substr(0, 4);
+	};
+};
+
+const asRegExp = test => {
+	if (typeof test === "string") {
+		test = new RegExp("^" + test.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"));
+	}
+	return test;
+};
+
+const lazyObject = obj => {
+	const newObj = {};
+	for (const key of Object.keys(obj)) {
+		const fn = obj[key];
+		Object.defineProperty(newObj, key, {
+			get: () => fn(),
+			set: v => {
+				Object.defineProperty(newObj, key, {
+					value: v,
+					enumerable: true,
+					writable: true
+				});
+			},
+			enumerable: true,
+			configurable: true
+		});
+	}
+	return newObj;
+};
+
+const REGEXP = /\[\\*([\w-]+)\\*\]/gi;
+
+/**
+ *
+ * @param {Module | string} module the module
+ * @param {TODO} options options
+ * @param {Object} contextInfo context info
+ * @param {RequestShortener} contextInfo.requestShortener requestShortener
+ * @param {ChunkGraph} contextInfo.chunkGraph chunk graph
+ * @param {string | Hash} contextInfo.hashFunction the hash function to use
+ * @returns {string} the filename
+ */
+ModuleFilenameHelpers.createFilename = (
+	module = "",
+	options,
+	{ requestShortener, chunkGraph, hashFunction = "md4" }
+) => {
+	const opts = {
+		namespace: "",
+		moduleFilenameTemplate: "",
+		...(typeof options === "object"
+			? options
+			: {
+					moduleFilenameTemplate: options
+			  })
+	};
+
+	let absoluteResourcePath;
+	let hash;
+	let identifier;
+	let moduleId;
+	let shortIdentifier;
+	if (typeof module === "string") {
+		shortIdentifier = memoize(() => requestShortener.shorten(module));
+		identifier = shortIdentifier;
+		moduleId = () => "";
+		absoluteResourcePath = () => module.split("!").pop();
+		hash = getHash(identifier, hashFunction);
+	} else {
+		shortIdentifier = memoize(() =>
+			module.readableIdentifier(requestShortener)
+		);
+		identifier = memoize(() => requestShortener.shorten(module.identifier()));
+		moduleId = () => chunkGraph.getModuleId(module);
+		absoluteResourcePath = () =>
+			module instanceof NormalModule
+				? module.resource
+				: module.identifier().split("!").pop();
+		hash = getHash(identifier, hashFunction);
+	}
+	const resource = memoize(() => shortIdentifier().split("!").pop());
+
+	const loaders = getBefore(shortIdentifier, "!");
+	const allLoaders = getBefore(identifier, "!");
+	const query = getAfter(resource, "?");
+	const resourcePath = () => {
+		const q = query().length;
+		return q === 0 ? resource() : resource().slice(0, -q);
+	};
+	if (typeof opts.moduleFilenameTemplate === "function") {
+		return opts.moduleFilenameTemplate(
+			lazyObject({
+				identifier: identifier,
+				shortIdentifier: shortIdentifier,
+				resource: resource,
+				resourcePath: memoize(resourcePath),
+				absoluteResourcePath: memoize(absoluteResourcePath),
+				allLoaders: memoize(allLoaders),
+				query: memoize(query),
+				moduleId: memoize(moduleId),
+				hash: memoize(hash),
+				namespace: () => opts.namespace
+			})
+		);
+	}
+
+	// TODO webpack 6: consider removing alternatives without dashes
+	/** @type {Map<string, function(): string>} */
+	const replacements = new Map([
+		["identifier", identifier],
+		["short-identifier", shortIdentifier],
+		["resource", resource],
+		["resource-path", resourcePath],
+		// cSpell:words resourcepath
+		["resourcepath", resourcePath],
+		["absolute-resource-path", absoluteResourcePath],
+		["abs-resource-path", absoluteResourcePath],
+		// cSpell:words absoluteresource
+		["absoluteresource-path", absoluteResourcePath],
+		// cSpell:words absresource
+		["absresource-path", absoluteResourcePath],
+		// cSpell:words resourcepath
+		["absolute-resourcepath", absoluteResourcePath],
+		// cSpell:words resourcepath
+		["abs-resourcepath", absoluteResourcePath],
+		// cSpell:words absoluteresourcepath
+		["absoluteresourcepath", absoluteResourcePath],
+		// cSpell:words absresourcepath
+		["absresourcepath", absoluteResourcePath],
+		["all-loaders", allLoaders],
+		// cSpell:words allloaders
+		["allloaders", allLoaders],
+		["loaders", loaders],
+		["query", query],
+		["id", moduleId],
+		["hash", hash],
+		["namespace", () => opts.namespace]
+	]);
+
+	// TODO webpack 6: consider removing weird double placeholders
+	return opts.moduleFilenameTemplate
+		.replace(ModuleFilenameHelpers.REGEXP_ALL_LOADERS_RESOURCE, "[identifier]")
+		.replace(
+			ModuleFilenameHelpers.REGEXP_LOADERS_RESOURCE,
+			"[short-identifier]"
+		)
+		.replace(REGEXP, (match, content) => {
+			if (content.length + 2 === match.length) {
+				const replacement = replacements.get(content.toLowerCase());
+				if (replacement !== undefined) {
+					return replacement();
+				}
+			} else if (match.startsWith("[\\") && match.endsWith("\\]")) {
+				return `[${match.slice(2, -2)}]`;
+			}
+			return match;
+		});
+};
+
+ModuleFilenameHelpers.replaceDuplicates = (array, fn, comparator) => {
+	const countMap = Object.create(null);
+	const posMap = Object.create(null);
+	array.forEach((item, idx) => {
+		countMap[item] = countMap[item] || [];
+		countMap[item].push(idx);
+		posMap[item] = 0;
+	});
+	if (comparator) {
+		Object.keys(countMap).forEach(item => {
+			countMap[item].sort(comparator);
+		});
+	}
+	return array.map((item, i) => {
+		if (countMap[item].length > 1) {
+			if (comparator && countMap[item][0] === i) return item;
+			return fn(item, i, posMap[item]++);
+		} else {
+			return item;
+		}
+	});
+};
+
+ModuleFilenameHelpers.matchPart = (str, test) => {
+	if (!test) return true;
+	test = asRegExp(test);
+	if (Array.isArray(test)) {
+		return test.map(asRegExp).some(regExp => regExp.test(str));
+	} else {
+		return test.test(str);
+	}
+};
+
+ModuleFilenameHelpers.matchObject = (obj, str) => {
+	if (obj.test) {
+		if (!ModuleFilenameHelpers.matchPart(str, obj.test)) {
+			return false;
+		}
+	}
+	if (obj.include) {
+		if (!ModuleFilenameHelpers.matchPart(str, obj.include)) {
+			return false;
+		}
+	}
+	if (obj.exclude) {
+		if (ModuleFilenameHelpers.matchPart(str, obj.exclude)) {
+			return false;
+		}
+	}
+	return true;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleGraph.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleGraph.js
new file mode 100644
index 0000000..e67e7db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleGraph.js
@@ -0,0 +1,856 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const ExportsInfo = require("./ExportsInfo");
+const ModuleGraphConnection = require("./ModuleGraphConnection");
+const SortableSet = require("./util/SortableSet");
+const WeakTupleMap = require("./util/WeakTupleMap");
+
+/** @typedef {import("./DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./ExportsInfo").ExportInfo} ExportInfo */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleProfile")} ModuleProfile */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @callback OptimizationBailoutFunction
+ * @param {RequestShortener} requestShortener
+ * @returns {string}
+ */
+
+const EMPTY_SET = new Set();
+
+/**
+ * @param {SortableSet<ModuleGraphConnection>} set input
+ * @returns {readonly Map<Module | undefined, readonly ModuleGraphConnection[]>} mapped by origin module
+ */
+const getConnectionsByOriginModule = set => {
+	const map = new Map();
+	/** @type {Module | 0} */
+	let lastModule = 0;
+	/** @type {ModuleGraphConnection[]} */
+	let lastList = undefined;
+	for (const connection of set) {
+		const { originModule } = connection;
+		if (lastModule === originModule) {
+			lastList.push(connection);
+		} else {
+			lastModule = originModule;
+			const list = map.get(originModule);
+			if (list !== undefined) {
+				lastList = list;
+				list.push(connection);
+			} else {
+				const list = [connection];
+				lastList = list;
+				map.set(originModule, list);
+			}
+		}
+	}
+	return map;
+};
+
+/**
+ * @param {SortableSet<ModuleGraphConnection>} set input
+ * @returns {readonly Map<Module | undefined, readonly ModuleGraphConnection[]>} mapped by module
+ */
+const getConnectionsByModule = set => {
+	const map = new Map();
+	/** @type {Module | 0} */
+	let lastModule = 0;
+	/** @type {ModuleGraphConnection[]} */
+	let lastList = undefined;
+	for (const connection of set) {
+		const { module } = connection;
+		if (lastModule === module) {
+			lastList.push(connection);
+		} else {
+			lastModule = module;
+			const list = map.get(module);
+			if (list !== undefined) {
+				lastList = list;
+				list.push(connection);
+			} else {
+				const list = [connection];
+				lastList = list;
+				map.set(module, list);
+			}
+		}
+	}
+	return map;
+};
+
+class ModuleGraphModule {
+	constructor() {
+		/** @type {SortableSet<ModuleGraphConnection>} */
+		this.incomingConnections = new SortableSet();
+		/** @type {SortableSet<ModuleGraphConnection> | undefined} */
+		this.outgoingConnections = undefined;
+		/** @type {Module | null} */
+		this.issuer = undefined;
+		/** @type {(string | OptimizationBailoutFunction)[]} */
+		this.optimizationBailout = [];
+		/** @type {ExportsInfo} */
+		this.exports = new ExportsInfo();
+		/** @type {number} */
+		this.preOrderIndex = null;
+		/** @type {number} */
+		this.postOrderIndex = null;
+		/** @type {number} */
+		this.depth = null;
+		/** @type {ModuleProfile} */
+		this.profile = undefined;
+		/** @type {boolean} */
+		this.async = false;
+		/** @type {ModuleGraphConnection[]} */
+		this._unassignedConnections = undefined;
+	}
+}
+
+class ModuleGraph {
+	constructor() {
+		/** @type {WeakMap<Dependency, ModuleGraphConnection>} */
+		this._dependencyMap = new WeakMap();
+		/** @type {Map<Module, ModuleGraphModule>} */
+		this._moduleMap = new Map();
+		/** @type {WeakMap<any, Object>} */
+		this._metaMap = new WeakMap();
+
+		/** @type {WeakTupleMap<any[], any>} */
+		this._cache = undefined;
+
+		/** @type {Map<Module, WeakTupleMap<any, any>>} */
+		this._moduleMemCaches = undefined;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {ModuleGraphModule} the internal module
+	 */
+	_getModuleGraphModule(module) {
+		let mgm = this._moduleMap.get(module);
+		if (mgm === undefined) {
+			mgm = new ModuleGraphModule();
+			this._moduleMap.set(module, mgm);
+		}
+		return mgm;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency
+	 * @param {DependenciesBlock} block parent block
+	 * @param {Module} module parent module
+	 * @param {number=} indexInBlock position in block
+	 * @returns {void}
+	 */
+	setParents(dependency, block, module, indexInBlock = -1) {
+		dependency._parentDependenciesBlockIndex = indexInBlock;
+		dependency._parentDependenciesBlock = block;
+		dependency._parentModule = module;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency
+	 * @returns {Module} parent module
+	 */
+	getParentModule(dependency) {
+		return dependency._parentModule;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency
+	 * @returns {DependenciesBlock} parent block
+	 */
+	getParentBlock(dependency) {
+		return dependency._parentDependenciesBlock;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency
+	 * @returns {number} index
+	 */
+	getParentBlockIndex(dependency) {
+		return dependency._parentDependenciesBlockIndex;
+	}
+
+	/**
+	 * @param {Module} originModule the referencing module
+	 * @param {Dependency} dependency the referencing dependency
+	 * @param {Module} module the referenced module
+	 * @returns {void}
+	 */
+	setResolvedModule(originModule, dependency, module) {
+		const connection = new ModuleGraphConnection(
+			originModule,
+			dependency,
+			module,
+			undefined,
+			dependency.weak,
+			dependency.getCondition(this)
+		);
+		const connections = this._getModuleGraphModule(module).incomingConnections;
+		connections.add(connection);
+		if (originModule) {
+			const mgm = this._getModuleGraphModule(originModule);
+			if (mgm._unassignedConnections === undefined) {
+				mgm._unassignedConnections = [];
+			}
+			mgm._unassignedConnections.push(connection);
+			if (mgm.outgoingConnections === undefined) {
+				mgm.outgoingConnections = new SortableSet();
+			}
+			mgm.outgoingConnections.add(connection);
+		} else {
+			this._dependencyMap.set(dependency, connection);
+		}
+	}
+
+	/**
+	 * @param {Dependency} dependency the referencing dependency
+	 * @param {Module} module the referenced module
+	 * @returns {void}
+	 */
+	updateModule(dependency, module) {
+		const connection = this.getConnection(dependency);
+		if (connection.module === module) return;
+		const newConnection = connection.clone();
+		newConnection.module = module;
+		this._dependencyMap.set(dependency, newConnection);
+		connection.setActive(false);
+		const originMgm = this._getModuleGraphModule(connection.originModule);
+		originMgm.outgoingConnections.add(newConnection);
+		const targetMgm = this._getModuleGraphModule(module);
+		targetMgm.incomingConnections.add(newConnection);
+	}
+
+	/**
+	 * @param {Dependency} dependency the referencing dependency
+	 * @returns {void}
+	 */
+	removeConnection(dependency) {
+		const connection = this.getConnection(dependency);
+		const targetMgm = this._getModuleGraphModule(connection.module);
+		targetMgm.incomingConnections.delete(connection);
+		const originMgm = this._getModuleGraphModule(connection.originModule);
+		originMgm.outgoingConnections.delete(connection);
+		this._dependencyMap.set(dependency, null);
+	}
+
+	/**
+	 * @param {Dependency} dependency the referencing dependency
+	 * @param {string} explanation an explanation
+	 * @returns {void}
+	 */
+	addExplanation(dependency, explanation) {
+		const connection = this.getConnection(dependency);
+		connection.addExplanation(explanation);
+	}
+
+	/**
+	 * @param {Module} sourceModule the source module
+	 * @param {Module} targetModule the target module
+	 * @returns {void}
+	 */
+	cloneModuleAttributes(sourceModule, targetModule) {
+		const oldMgm = this._getModuleGraphModule(sourceModule);
+		const newMgm = this._getModuleGraphModule(targetModule);
+		newMgm.postOrderIndex = oldMgm.postOrderIndex;
+		newMgm.preOrderIndex = oldMgm.preOrderIndex;
+		newMgm.depth = oldMgm.depth;
+		newMgm.exports = oldMgm.exports;
+		newMgm.async = oldMgm.async;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {void}
+	 */
+	removeModuleAttributes(module) {
+		const mgm = this._getModuleGraphModule(module);
+		mgm.postOrderIndex = null;
+		mgm.preOrderIndex = null;
+		mgm.depth = null;
+		mgm.async = false;
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	removeAllModuleAttributes() {
+		for (const mgm of this._moduleMap.values()) {
+			mgm.postOrderIndex = null;
+			mgm.preOrderIndex = null;
+			mgm.depth = null;
+			mgm.async = false;
+		}
+	}
+
+	/**
+	 * @param {Module} oldModule the old referencing module
+	 * @param {Module} newModule the new referencing module
+	 * @param {function(ModuleGraphConnection): boolean} filterConnection filter predicate for replacement
+	 * @returns {void}
+	 */
+	moveModuleConnections(oldModule, newModule, filterConnection) {
+		if (oldModule === newModule) return;
+		const oldMgm = this._getModuleGraphModule(oldModule);
+		const newMgm = this._getModuleGraphModule(newModule);
+		// Outgoing connections
+		const oldConnections = oldMgm.outgoingConnections;
+		if (oldConnections !== undefined) {
+			if (newMgm.outgoingConnections === undefined) {
+				newMgm.outgoingConnections = new SortableSet();
+			}
+			const newConnections = newMgm.outgoingConnections;
+			for (const connection of oldConnections) {
+				if (filterConnection(connection)) {
+					connection.originModule = newModule;
+					newConnections.add(connection);
+					oldConnections.delete(connection);
+				}
+			}
+		}
+		// Incoming connections
+		const oldConnections2 = oldMgm.incomingConnections;
+		const newConnections2 = newMgm.incomingConnections;
+		for (const connection of oldConnections2) {
+			if (filterConnection(connection)) {
+				connection.module = newModule;
+				newConnections2.add(connection);
+				oldConnections2.delete(connection);
+			}
+		}
+	}
+
+	/**
+	 * @param {Module} oldModule the old referencing module
+	 * @param {Module} newModule the new referencing module
+	 * @param {function(ModuleGraphConnection): boolean} filterConnection filter predicate for replacement
+	 * @returns {void}
+	 */
+	copyOutgoingModuleConnections(oldModule, newModule, filterConnection) {
+		if (oldModule === newModule) return;
+		const oldMgm = this._getModuleGraphModule(oldModule);
+		const newMgm = this._getModuleGraphModule(newModule);
+		// Outgoing connections
+		const oldConnections = oldMgm.outgoingConnections;
+		if (oldConnections !== undefined) {
+			if (newMgm.outgoingConnections === undefined) {
+				newMgm.outgoingConnections = new SortableSet();
+			}
+			const newConnections = newMgm.outgoingConnections;
+			for (const connection of oldConnections) {
+				if (filterConnection(connection)) {
+					const newConnection = connection.clone();
+					newConnection.originModule = newModule;
+					newConnections.add(newConnection);
+					if (newConnection.module !== undefined) {
+						const otherMgm = this._getModuleGraphModule(newConnection.module);
+						otherMgm.incomingConnections.add(newConnection);
+					}
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {Module} module the referenced module
+	 * @param {string} explanation an explanation why it's referenced
+	 * @returns {void}
+	 */
+	addExtraReason(module, explanation) {
+		const connections = this._getModuleGraphModule(module).incomingConnections;
+		connections.add(new ModuleGraphConnection(null, null, module, explanation));
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency to look for a referenced module
+	 * @returns {Module} the referenced module
+	 */
+	getResolvedModule(dependency) {
+		const connection = this.getConnection(dependency);
+		return connection !== undefined ? connection.resolvedModule : null;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency to look for a referenced module
+	 * @returns {ModuleGraphConnection | undefined} the connection
+	 */
+	getConnection(dependency) {
+		const connection = this._dependencyMap.get(dependency);
+		if (connection === undefined) {
+			const module = this.getParentModule(dependency);
+			if (module !== undefined) {
+				const mgm = this._getModuleGraphModule(module);
+				if (
+					mgm._unassignedConnections &&
+					mgm._unassignedConnections.length !== 0
+				) {
+					let foundConnection;
+					for (const connection of mgm._unassignedConnections) {
+						this._dependencyMap.set(connection.dependency, connection);
+						if (connection.dependency === dependency)
+							foundConnection = connection;
+					}
+					mgm._unassignedConnections.length = 0;
+					if (foundConnection !== undefined) {
+						return foundConnection;
+					}
+				}
+			}
+			this._dependencyMap.set(dependency, null);
+			return undefined;
+		}
+		return connection === null ? undefined : connection;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency to look for a referenced module
+	 * @returns {Module} the referenced module
+	 */
+	getModule(dependency) {
+		const connection = this.getConnection(dependency);
+		return connection !== undefined ? connection.module : null;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency to look for a referencing module
+	 * @returns {Module} the referencing module
+	 */
+	getOrigin(dependency) {
+		const connection = this.getConnection(dependency);
+		return connection !== undefined ? connection.originModule : null;
+	}
+
+	/**
+	 * @param {Dependency} dependency the dependency to look for a referencing module
+	 * @returns {Module} the original referencing module
+	 */
+	getResolvedOrigin(dependency) {
+		const connection = this.getConnection(dependency);
+		return connection !== undefined ? connection.resolvedOriginModule : null;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {Iterable<ModuleGraphConnection>} reasons why a module is included
+	 */
+	getIncomingConnections(module) {
+		const connections = this._getModuleGraphModule(module).incomingConnections;
+		return connections;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {Iterable<ModuleGraphConnection>} list of outgoing connections
+	 */
+	getOutgoingConnections(module) {
+		const connections = this._getModuleGraphModule(module).outgoingConnections;
+		return connections === undefined ? EMPTY_SET : connections;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {readonly Map<Module | undefined, readonly ModuleGraphConnection[]>} reasons why a module is included, in a map by source module
+	 */
+	getIncomingConnectionsByOriginModule(module) {
+		const connections = this._getModuleGraphModule(module).incomingConnections;
+		return connections.getFromUnorderedCache(getConnectionsByOriginModule);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {readonly Map<Module | undefined, readonly ModuleGraphConnection[]> | undefined} connections to modules, in a map by module
+	 */
+	getOutgoingConnectionsByModule(module) {
+		const connections = this._getModuleGraphModule(module).outgoingConnections;
+		return connections === undefined
+			? undefined
+			: connections.getFromUnorderedCache(getConnectionsByModule);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {ModuleProfile | null} the module profile
+	 */
+	getProfile(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.profile;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {ModuleProfile | null} profile the module profile
+	 * @returns {void}
+	 */
+	setProfile(module, profile) {
+		const mgm = this._getModuleGraphModule(module);
+		mgm.profile = profile;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {Module | null} the issuer module
+	 */
+	getIssuer(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.issuer;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {Module | null} issuer the issuer module
+	 * @returns {void}
+	 */
+	setIssuer(module, issuer) {
+		const mgm = this._getModuleGraphModule(module);
+		mgm.issuer = issuer;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {Module | null} issuer the issuer module
+	 * @returns {void}
+	 */
+	setIssuerIfUnset(module, issuer) {
+		const mgm = this._getModuleGraphModule(module);
+		if (mgm.issuer === undefined) mgm.issuer = issuer;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {(string | OptimizationBailoutFunction)[]} optimization bailouts
+	 */
+	getOptimizationBailout(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.optimizationBailout;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {true | string[] | null} the provided exports
+	 */
+	getProvidedExports(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.exports.getProvidedExports();
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {string | string[]} exportName a name of an export
+	 * @returns {boolean | null} true, if the export is provided by the module.
+	 * null, if it's unknown.
+	 * false, if it's not provided.
+	 */
+	isExportProvided(module, exportName) {
+		const mgm = this._getModuleGraphModule(module);
+		const result = mgm.exports.isExportProvided(exportName);
+		return result === undefined ? null : result;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {ExportsInfo} info about the exports
+	 */
+	getExportsInfo(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.exports;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {string} exportName the export
+	 * @returns {ExportInfo} info about the export
+	 */
+	getExportInfo(module, exportName) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.exports.getExportInfo(exportName);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {string} exportName the export
+	 * @returns {ExportInfo} info about the export (do not modify)
+	 */
+	getReadOnlyExportInfo(module, exportName) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.exports.getReadOnlyExportInfo(exportName);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {false | true | SortableSet<string> | null} the used exports
+	 * false: module is not used at all.
+	 * true: the module namespace/object export is used.
+	 * SortableSet<string>: these export names are used.
+	 * empty SortableSet<string>: module is used but no export.
+	 * null: unknown, worst case should be assumed.
+	 */
+	getUsedExports(module, runtime) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.exports.getUsedExports(runtime);
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {number} the index of the module
+	 */
+	getPreOrderIndex(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.preOrderIndex;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {number} the index of the module
+	 */
+	getPostOrderIndex(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.postOrderIndex;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {number} index the index of the module
+	 * @returns {void}
+	 */
+	setPreOrderIndex(module, index) {
+		const mgm = this._getModuleGraphModule(module);
+		mgm.preOrderIndex = index;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {number} index the index of the module
+	 * @returns {boolean} true, if the index was set
+	 */
+	setPreOrderIndexIfUnset(module, index) {
+		const mgm = this._getModuleGraphModule(module);
+		if (mgm.preOrderIndex === null) {
+			mgm.preOrderIndex = index;
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {number} index the index of the module
+	 * @returns {void}
+	 */
+	setPostOrderIndex(module, index) {
+		const mgm = this._getModuleGraphModule(module);
+		mgm.postOrderIndex = index;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {number} index the index of the module
+	 * @returns {boolean} true, if the index was set
+	 */
+	setPostOrderIndexIfUnset(module, index) {
+		const mgm = this._getModuleGraphModule(module);
+		if (mgm.postOrderIndex === null) {
+			mgm.postOrderIndex = index;
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {number} the depth of the module
+	 */
+	getDepth(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.depth;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {number} depth the depth of the module
+	 * @returns {void}
+	 */
+	setDepth(module, depth) {
+		const mgm = this._getModuleGraphModule(module);
+		mgm.depth = depth;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @param {number} depth the depth of the module
+	 * @returns {boolean} true, if the depth was set
+	 */
+	setDepthIfLower(module, depth) {
+		const mgm = this._getModuleGraphModule(module);
+		if (mgm.depth === null || mgm.depth > depth) {
+			mgm.depth = depth;
+			return true;
+		}
+		return false;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {boolean} true, if the module is async
+	 */
+	isAsync(module) {
+		const mgm = this._getModuleGraphModule(module);
+		return mgm.async;
+	}
+
+	/**
+	 * @param {Module} module the module
+	 * @returns {void}
+	 */
+	setAsync(module) {
+		const mgm = this._getModuleGraphModule(module);
+		mgm.async = true;
+	}
+
+	/**
+	 * @param {any} thing any thing
+	 * @returns {Object} metadata
+	 */
+	getMeta(thing) {
+		let meta = this._metaMap.get(thing);
+		if (meta === undefined) {
+			meta = Object.create(null);
+			this._metaMap.set(thing, meta);
+		}
+		return meta;
+	}
+
+	/**
+	 * @param {any} thing any thing
+	 * @returns {Object} metadata
+	 */
+	getMetaIfExisting(thing) {
+		return this._metaMap.get(thing);
+	}
+
+	/**
+	 * @param {string=} cacheStage a persistent stage name for caching
+	 */
+	freeze(cacheStage) {
+		this._cache = new WeakTupleMap();
+		this._cacheStage = cacheStage;
+	}
+
+	unfreeze() {
+		this._cache = undefined;
+		this._cacheStage = undefined;
+	}
+
+	/**
+	 * @template {any[]} T
+	 * @template V
+	 * @param {(moduleGraph: ModuleGraph, ...args: T) => V} fn computer
+	 * @param {T} args arguments
+	 * @returns {V} computed value or cached
+	 */
+	cached(fn, ...args) {
+		if (this._cache === undefined) return fn(this, ...args);
+		return this._cache.provide(fn, ...args, () => fn(this, ...args));
+	}
+
+	/**
+	 * @param {Map<Module, WeakTupleMap<any, any>>} moduleMemCaches mem caches for modules for better caching
+	 */
+	setModuleMemCaches(moduleMemCaches) {
+		this._moduleMemCaches = moduleMemCaches;
+	}
+
+	/**
+	 * @param {Dependency} dependency dependency
+	 * @param {...any} args arguments, last argument is a function called with moduleGraph, dependency, ...args
+	 * @returns {any} computed value or cached
+	 */
+	dependencyCacheProvide(dependency, ...args) {
+		/** @type {(moduleGraph: ModuleGraph, dependency: Dependency, ...args: any[]) => any} */
+		const fn = args.pop();
+		if (this._moduleMemCaches && this._cacheStage) {
+			const memCache = this._moduleMemCaches.get(
+				this.getParentModule(dependency)
+			);
+			if (memCache !== undefined) {
+				return memCache.provide(dependency, this._cacheStage, ...args, () =>
+					fn(this, dependency, ...args)
+				);
+			}
+		}
+		if (this._cache === undefined) return fn(this, dependency, ...args);
+		return this._cache.provide(dependency, ...args, () =>
+			fn(this, dependency, ...args)
+		);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Module} module the module
+	 * @param {string} deprecateMessage message for the deprecation message
+	 * @param {string} deprecationCode code for the deprecation
+	 * @returns {ModuleGraph} the module graph
+	 */
+	static getModuleGraphForModule(module, deprecateMessage, deprecationCode) {
+		const fn = deprecateMap.get(deprecateMessage);
+		if (fn) return fn(module);
+		const newFn = util.deprecate(
+			/**
+			 * @param {Module} module the module
+			 * @returns {ModuleGraph} the module graph
+			 */
+			module => {
+				const moduleGraph = moduleGraphForModuleMap.get(module);
+				if (!moduleGraph)
+					throw new Error(
+						deprecateMessage +
+							"There was no ModuleGraph assigned to the Module for backward-compat (Use the new API)"
+					);
+				return moduleGraph;
+			},
+			deprecateMessage + ": Use new ModuleGraph API",
+			deprecationCode
+		);
+		deprecateMap.set(deprecateMessage, newFn);
+		return newFn(module);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Module} module the module
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {void}
+	 */
+	static setModuleGraphForModule(module, moduleGraph) {
+		moduleGraphForModuleMap.set(module, moduleGraph);
+	}
+
+	// TODO remove in webpack 6
+	/**
+	 * @param {Module} module the module
+	 * @returns {void}
+	 */
+	static clearModuleGraphForModule(module) {
+		moduleGraphForModuleMap.delete(module);
+	}
+}
+
+// TODO remove in webpack 6
+/** @type {WeakMap<Module, ModuleGraph>} */
+const moduleGraphForModuleMap = new WeakMap();
+
+// TODO remove in webpack 6
+/** @type {Map<string, (module: Module) => ModuleGraph>} */
+const deprecateMap = new Map();
+
+module.exports = ModuleGraph;
+module.exports.ModuleGraphConnection = ModuleGraphConnection;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleGraphConnection.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleGraphConnection.js
new file mode 100644
index 0000000..bde1030
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleGraphConnection.js
@@ -0,0 +1,191 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * Module itself is not connected, but transitive modules are connected transitively.
+ */
+const TRANSITIVE_ONLY = Symbol("transitive only");
+
+/**
+ * While determining the active state, this flag is used to signal a circular connection.
+ */
+const CIRCULAR_CONNECTION = Symbol("circular connection");
+
+/** @typedef {boolean | typeof TRANSITIVE_ONLY | typeof CIRCULAR_CONNECTION} ConnectionState */
+
+/**
+ * @param {ConnectionState} a first
+ * @param {ConnectionState} b second
+ * @returns {ConnectionState} merged
+ */
+const addConnectionStates = (a, b) => {
+	if (a === true || b === true) return true;
+	if (a === false) return b;
+	if (b === false) return a;
+	if (a === TRANSITIVE_ONLY) return b;
+	if (b === TRANSITIVE_ONLY) return a;
+	return a;
+};
+
+/**
+ * @param {ConnectionState} a first
+ * @param {ConnectionState} b second
+ * @returns {ConnectionState} intersected
+ */
+const intersectConnectionStates = (a, b) => {
+	if (a === false || b === false) return false;
+	if (a === true) return b;
+	if (b === true) return a;
+	if (a === CIRCULAR_CONNECTION) return b;
+	if (b === CIRCULAR_CONNECTION) return a;
+	return a;
+};
+
+class ModuleGraphConnection {
+	/**
+	 * @param {Module|null} originModule the referencing module
+	 * @param {Dependency|null} dependency the referencing dependency
+	 * @param {Module} module the referenced module
+	 * @param {string=} explanation some extra detail
+	 * @param {boolean=} weak the reference is weak
+	 * @param {false | function(ModuleGraphConnection, RuntimeSpec): ConnectionState=} condition condition for the connection
+	 */
+	constructor(
+		originModule,
+		dependency,
+		module,
+		explanation,
+		weak = false,
+		condition = undefined
+	) {
+		this.originModule = originModule;
+		this.resolvedOriginModule = originModule;
+		this.dependency = dependency;
+		this.resolvedModule = module;
+		this.module = module;
+		this.weak = weak;
+		this.conditional = !!condition;
+		this._active = condition !== false;
+		/** @type {function(ModuleGraphConnection, RuntimeSpec): ConnectionState} */
+		this.condition = condition || undefined;
+		/** @type {Set<string>} */
+		this.explanations = undefined;
+		if (explanation) {
+			this.explanations = new Set();
+			this.explanations.add(explanation);
+		}
+	}
+
+	clone() {
+		const clone = new ModuleGraphConnection(
+			this.resolvedOriginModule,
+			this.dependency,
+			this.resolvedModule,
+			undefined,
+			this.weak,
+			this.condition
+		);
+		clone.originModule = this.originModule;
+		clone.module = this.module;
+		clone.conditional = this.conditional;
+		clone._active = this._active;
+		if (this.explanations) clone.explanations = new Set(this.explanations);
+		return clone;
+	}
+
+	/**
+	 * @param {function(ModuleGraphConnection, RuntimeSpec): ConnectionState} condition condition for the connection
+	 * @returns {void}
+	 */
+	addCondition(condition) {
+		if (this.conditional) {
+			const old = this.condition;
+			this.condition = (c, r) =>
+				intersectConnectionStates(old(c, r), condition(c, r));
+		} else if (this._active) {
+			this.conditional = true;
+			this.condition = condition;
+		}
+	}
+
+	/**
+	 * @param {string} explanation the explanation to add
+	 * @returns {void}
+	 */
+	addExplanation(explanation) {
+		if (this.explanations === undefined) {
+			this.explanations = new Set();
+		}
+		this.explanations.add(explanation);
+	}
+
+	get explanation() {
+		if (this.explanations === undefined) return "";
+		return Array.from(this.explanations).join(" ");
+	}
+
+	// TODO webpack 5 remove
+	get active() {
+		throw new Error("Use getActiveState instead");
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, if the connection is active
+	 */
+	isActive(runtime) {
+		if (!this.conditional) return this._active;
+		return this.condition(this, runtime) !== false;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {boolean} true, if the connection is active
+	 */
+	isTargetActive(runtime) {
+		if (!this.conditional) return this._active;
+		return this.condition(this, runtime) === true;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {ConnectionState} true: fully active, false: inactive, TRANSITIVE: direct module inactive, but transitive connection maybe active
+	 */
+	getActiveState(runtime) {
+		if (!this.conditional) return this._active;
+		return this.condition(this, runtime);
+	}
+
+	/**
+	 * @param {boolean} value active or not
+	 * @returns {void}
+	 */
+	setActive(value) {
+		this.conditional = false;
+		this._active = value;
+	}
+
+	set active(value) {
+		throw new Error("Use setActive instead");
+	}
+}
+
+/** @typedef {typeof TRANSITIVE_ONLY} TRANSITIVE_ONLY */
+/** @typedef {typeof CIRCULAR_CONNECTION} CIRCULAR_CONNECTION */
+
+module.exports = ModuleGraphConnection;
+module.exports.addConnectionStates = addConnectionStates;
+module.exports.TRANSITIVE_ONLY = /** @type {typeof TRANSITIVE_ONLY} */ (
+	TRANSITIVE_ONLY
+);
+module.exports.CIRCULAR_CONNECTION = /** @type {typeof CIRCULAR_CONNECTION} */ (
+	CIRCULAR_CONNECTION
+);
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleHashingError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleHashingError.js
new file mode 100644
index 0000000..77c8f41
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleHashingError.js
@@ -0,0 +1,29 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Module")} Module */
+
+class ModuleHashingError extends WebpackError {
+	/**
+	 * Create a new ModuleHashingError
+	 * @param {Module} module related module
+	 * @param {Error} error Original error
+	 */
+	constructor(module, error) {
+		super();
+
+		this.name = "ModuleHashingError";
+		this.error = error;
+		this.message = error.message;
+		this.details = error.stack;
+		this.module = module;
+	}
+}
+
+module.exports = ModuleHashingError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleInfoHeaderPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleInfoHeaderPlugin.js
new file mode 100644
index 0000000..1402a75
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleInfoHeaderPlugin.js
@@ -0,0 +1,255 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, RawSource, CachedSource } = require("webpack-sources");
+const { UsageState } = require("./ExportsInfo");
+const Template = require("./Template");
+const JavascriptModulesPlugin = require("./javascript/JavascriptModulesPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./ExportsInfo")} ExportsInfo */
+/** @typedef {import("./ExportsInfo").ExportInfo} ExportInfo */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./ModuleTemplate")} ModuleTemplate */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+
+const joinIterableWithComma = iterable => {
+	// This is more performant than Array.from().join(", ")
+	// as it doesn't create an array
+	let str = "";
+	let first = true;
+	for (const item of iterable) {
+		if (first) {
+			first = false;
+		} else {
+			str += ", ";
+		}
+		str += item;
+	}
+	return str;
+};
+
+/**
+ * @param {ConcatSource} source output
+ * @param {string} indent spacing
+ * @param {ExportsInfo} exportsInfo data
+ * @param {ModuleGraph} moduleGraph moduleGraph
+ * @param {RequestShortener} requestShortener requestShortener
+ * @param {Set<ExportInfo>} alreadyPrinted deduplication set
+ * @returns {void}
+ */
+const printExportsInfoToSource = (
+	source,
+	indent,
+	exportsInfo,
+	moduleGraph,
+	requestShortener,
+	alreadyPrinted = new Set()
+) => {
+	const otherExportsInfo = exportsInfo.otherExportsInfo;
+
+	let alreadyPrintedExports = 0;
+
+	// determine exports to print
+	const printedExports = [];
+	for (const exportInfo of exportsInfo.orderedExports) {
+		if (!alreadyPrinted.has(exportInfo)) {
+			alreadyPrinted.add(exportInfo);
+			printedExports.push(exportInfo);
+		} else {
+			alreadyPrintedExports++;
+		}
+	}
+	let showOtherExports = false;
+	if (!alreadyPrinted.has(otherExportsInfo)) {
+		alreadyPrinted.add(otherExportsInfo);
+		showOtherExports = true;
+	} else {
+		alreadyPrintedExports++;
+	}
+
+	// print the exports
+	for (const exportInfo of printedExports) {
+		const target = exportInfo.getTarget(moduleGraph);
+		source.add(
+			Template.toComment(
+				`${indent}export ${JSON.stringify(exportInfo.name).slice(
+					1,
+					-1
+				)} [${exportInfo.getProvidedInfo()}] [${exportInfo.getUsedInfo()}] [${exportInfo.getRenameInfo()}]${
+					target
+						? ` -> ${target.module.readableIdentifier(requestShortener)}${
+								target.export
+									? ` .${target.export
+											.map(e => JSON.stringify(e).slice(1, -1))
+											.join(".")}`
+									: ""
+						  }`
+						: ""
+				}`
+			) + "\n"
+		);
+		if (exportInfo.exportsInfo) {
+			printExportsInfoToSource(
+				source,
+				indent + "  ",
+				exportInfo.exportsInfo,
+				moduleGraph,
+				requestShortener,
+				alreadyPrinted
+			);
+		}
+	}
+
+	if (alreadyPrintedExports) {
+		source.add(
+			Template.toComment(
+				`${indent}... (${alreadyPrintedExports} already listed exports)`
+			) + "\n"
+		);
+	}
+
+	if (showOtherExports) {
+		const target = otherExportsInfo.getTarget(moduleGraph);
+		if (
+			target ||
+			otherExportsInfo.provided !== false ||
+			otherExportsInfo.getUsed(undefined) !== UsageState.Unused
+		) {
+			const title =
+				printedExports.length > 0 || alreadyPrintedExports > 0
+					? "other exports"
+					: "exports";
+			source.add(
+				Template.toComment(
+					`${indent}${title} [${otherExportsInfo.getProvidedInfo()}] [${otherExportsInfo.getUsedInfo()}]${
+						target
+							? ` -> ${target.module.readableIdentifier(requestShortener)}`
+							: ""
+					}`
+				) + "\n"
+			);
+		}
+	}
+};
+
+/** @type {WeakMap<RequestShortener, WeakMap<Module, { header: RawSource, full: WeakMap<Source, CachedSource> }>>} */
+const caches = new WeakMap();
+
+class ModuleInfoHeaderPlugin {
+	/**
+	 * @param {boolean=} verbose add more information like exports, runtime requirements and bailouts
+	 */
+	constructor(verbose = true) {
+		this._verbose = verbose;
+	}
+	/**
+	 * @param {Compiler} compiler the compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { _verbose: verbose } = this;
+		compiler.hooks.compilation.tap("ModuleInfoHeaderPlugin", compilation => {
+			const hooks = JavascriptModulesPlugin.getCompilationHooks(compilation);
+			hooks.renderModulePackage.tap(
+				"ModuleInfoHeaderPlugin",
+				(
+					moduleSource,
+					module,
+					{ chunk, chunkGraph, moduleGraph, runtimeTemplate }
+				) => {
+					const { requestShortener } = runtimeTemplate;
+					let cacheEntry;
+					let cache = caches.get(requestShortener);
+					if (cache === undefined) {
+						caches.set(requestShortener, (cache = new WeakMap()));
+						cache.set(
+							module,
+							(cacheEntry = { header: undefined, full: new WeakMap() })
+						);
+					} else {
+						cacheEntry = cache.get(module);
+						if (cacheEntry === undefined) {
+							cache.set(
+								module,
+								(cacheEntry = { header: undefined, full: new WeakMap() })
+							);
+						} else if (!verbose) {
+							const cachedSource = cacheEntry.full.get(moduleSource);
+							if (cachedSource !== undefined) return cachedSource;
+						}
+					}
+					const source = new ConcatSource();
+					let header = cacheEntry.header;
+					if (header === undefined) {
+						const req = module.readableIdentifier(requestShortener);
+						const reqStr = req.replace(/\*\//g, "*_/");
+						const reqStrStar = "*".repeat(reqStr.length);
+						const headerStr = `/*!****${reqStrStar}****!*\\\n  !*** ${reqStr} ***!\n  \\****${reqStrStar}****/\n`;
+						header = new RawSource(headerStr);
+						cacheEntry.header = header;
+					}
+					source.add(header);
+					if (verbose) {
+						const exportsType = module.buildMeta.exportsType;
+						source.add(
+							Template.toComment(
+								exportsType
+									? `${exportsType} exports`
+									: "unknown exports (runtime-defined)"
+							) + "\n"
+						);
+						if (exportsType) {
+							const exportsInfo = moduleGraph.getExportsInfo(module);
+							printExportsInfoToSource(
+								source,
+								"",
+								exportsInfo,
+								moduleGraph,
+								requestShortener
+							);
+						}
+						source.add(
+							Template.toComment(
+								`runtime requirements: ${joinIterableWithComma(
+									chunkGraph.getModuleRuntimeRequirements(module, chunk.runtime)
+								)}`
+							) + "\n"
+						);
+						const optimizationBailout =
+							moduleGraph.getOptimizationBailout(module);
+						if (optimizationBailout) {
+							for (const text of optimizationBailout) {
+								let code;
+								if (typeof text === "function") {
+									code = text(requestShortener);
+								} else {
+									code = text;
+								}
+								source.add(Template.toComment(`${code}`) + "\n");
+							}
+						}
+						source.add(moduleSource);
+						return source;
+					} else {
+						source.add(moduleSource);
+						const cachedSource = new CachedSource(source);
+						cacheEntry.full.set(moduleSource, cachedSource);
+						return cachedSource;
+					}
+				}
+			);
+			hooks.chunkHash.tap("ModuleInfoHeaderPlugin", (chunk, hash) => {
+				hash.update("ModuleInfoHeaderPlugin");
+				hash.update("1");
+			});
+		});
+	}
+}
+module.exports = ModuleInfoHeaderPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleNotFoundError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleNotFoundError.js
new file mode 100644
index 0000000..a8f14b1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleNotFoundError.js
@@ -0,0 +1,86 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Module")} Module */
+
+const previouslyPolyfilledBuiltinModules = {
+	assert: "assert/",
+	buffer: "buffer/",
+	console: "console-browserify",
+	constants: "constants-browserify",
+	crypto: "crypto-browserify",
+	domain: "domain-browser",
+	events: "events/",
+	http: "stream-http",
+	https: "https-browserify",
+	os: "os-browserify/browser",
+	path: "path-browserify",
+	punycode: "punycode/",
+	process: "process/browser",
+	querystring: "querystring-es3",
+	stream: "stream-browserify",
+	_stream_duplex: "readable-stream/duplex",
+	_stream_passthrough: "readable-stream/passthrough",
+	_stream_readable: "readable-stream/readable",
+	_stream_transform: "readable-stream/transform",
+	_stream_writable: "readable-stream/writable",
+	string_decoder: "string_decoder/",
+	sys: "util/",
+	timers: "timers-browserify",
+	tty: "tty-browserify",
+	url: "url/",
+	util: "util/",
+	vm: "vm-browserify",
+	zlib: "browserify-zlib"
+};
+
+class ModuleNotFoundError extends WebpackError {
+	/**
+	 * @param {Module} module module tied to dependency
+	 * @param {Error&any} err error thrown
+	 * @param {DependencyLocation} loc location of dependency
+	 */
+	constructor(module, err, loc) {
+		let message = `Module not found: ${err.toString()}`;
+
+		// TODO remove in webpack 6
+		const match = err.message.match(/Can't resolve '([^']+)'/);
+		if (match) {
+			const request = match[1];
+			const alias = previouslyPolyfilledBuiltinModules[request];
+			if (alias) {
+				const pathIndex = alias.indexOf("/");
+				const dependency = pathIndex > 0 ? alias.slice(0, pathIndex) : alias;
+				message +=
+					"\n\n" +
+					"BREAKING CHANGE: " +
+					"webpack < 5 used to include polyfills for node.js core modules by default.\n" +
+					"This is no longer the case. Verify if you need this module and configure a polyfill for it.\n\n";
+				message +=
+					"If you want to include a polyfill, you need to:\n" +
+					`\t- add a fallback 'resolve.fallback: { "${request}": require.resolve("${alias}") }'\n` +
+					`\t- install '${dependency}'\n`;
+				message +=
+					"If you don't want to include a polyfill, you can use an empty module like this:\n" +
+					`\tresolve.fallback: { "${request}": false }`;
+			}
+		}
+
+		super(message);
+
+		this.name = "ModuleNotFoundError";
+		this.details = err.details;
+		this.module = module;
+		this.error = err;
+		this.loc = loc;
+	}
+}
+
+module.exports = ModuleNotFoundError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleParseError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleParseError.js
new file mode 100644
index 0000000..2a54f1b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleParseError.js
@@ -0,0 +1,109 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+const WASM_HEADER = Buffer.from([0x00, 0x61, 0x73, 0x6d]);
+
+class ModuleParseError extends WebpackError {
+	/**
+	 * @param {string | Buffer} source source code
+	 * @param {Error&any} err the parse error
+	 * @param {string[]} loaders the loaders used
+	 * @param {string} type module type
+	 */
+	constructor(source, err, loaders, type) {
+		let message = "Module parse failed: " + (err && err.message);
+		let loc = undefined;
+
+		if (
+			((Buffer.isBuffer(source) && source.slice(0, 4).equals(WASM_HEADER)) ||
+				(typeof source === "string" && /^\0asm/.test(source))) &&
+			!type.startsWith("webassembly")
+		) {
+			message +=
+				"\nThe module seem to be a WebAssembly module, but module is not flagged as WebAssembly module for webpack.";
+			message +=
+				"\nBREAKING CHANGE: Since webpack 5 WebAssembly is not enabled by default and flagged as experimental feature.";
+			message +=
+				"\nYou need to enable one of the WebAssembly experiments via 'experiments.asyncWebAssembly: true' (based on async modules) or 'experiments.syncWebAssembly: true' (like webpack 4, deprecated).";
+			message +=
+				"\nFor files that transpile to WebAssembly, make sure to set the module type in the 'module.rules' section of the config (e. g. 'type: \"webassembly/async\"').";
+		} else if (!loaders) {
+			message +=
+				"\nYou may need an appropriate loader to handle this file type.";
+		} else if (loaders.length >= 1) {
+			message += `\nFile was processed with these loaders:${loaders
+				.map(loader => `\n * ${loader}`)
+				.join("")}`;
+			message +=
+				"\nYou may need an additional loader to handle the result of these loaders.";
+		} else {
+			message +=
+				"\nYou may need an appropriate loader to handle this file type, currently no loaders are configured to process this file. See https://webpack.js.org/concepts#loaders";
+		}
+
+		if (
+			err &&
+			err.loc &&
+			typeof err.loc === "object" &&
+			typeof err.loc.line === "number"
+		) {
+			var lineNumber = err.loc.line;
+
+			if (
+				Buffer.isBuffer(source) ||
+				/[\0\u0001\u0002\u0003\u0004\u0005\u0006\u0007]/.test(source)
+			) {
+				// binary file
+				message += "\n(Source code omitted for this binary file)";
+			} else {
+				const sourceLines = source.split(/\r?\n/);
+				const start = Math.max(0, lineNumber - 3);
+				const linesBefore = sourceLines.slice(start, lineNumber - 1);
+				const theLine = sourceLines[lineNumber - 1];
+				const linesAfter = sourceLines.slice(lineNumber, lineNumber + 2);
+
+				message +=
+					linesBefore.map(l => `\n| ${l}`).join("") +
+					`\n> ${theLine}` +
+					linesAfter.map(l => `\n| ${l}`).join("");
+			}
+
+			loc = { start: err.loc };
+		} else if (err && err.stack) {
+			message += "\n" + err.stack;
+		}
+
+		super(message);
+
+		this.name = "ModuleParseError";
+		this.loc = loc;
+		this.error = err;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.error);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.error = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ModuleParseError, "webpack/lib/ModuleParseError");
+
+module.exports = ModuleParseError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleProfile.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleProfile.js
new file mode 100644
index 0000000..e0c2b73
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleProfile.js
@@ -0,0 +1,107 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+class ModuleProfile {
+	constructor() {
+		this.startTime = Date.now();
+
+		this.factoryStartTime = 0;
+		this.factoryEndTime = 0;
+		this.factory = 0;
+		this.factoryParallelismFactor = 0;
+
+		this.restoringStartTime = 0;
+		this.restoringEndTime = 0;
+		this.restoring = 0;
+		this.restoringParallelismFactor = 0;
+
+		this.integrationStartTime = 0;
+		this.integrationEndTime = 0;
+		this.integration = 0;
+		this.integrationParallelismFactor = 0;
+
+		this.buildingStartTime = 0;
+		this.buildingEndTime = 0;
+		this.building = 0;
+		this.buildingParallelismFactor = 0;
+
+		this.storingStartTime = 0;
+		this.storingEndTime = 0;
+		this.storing = 0;
+		this.storingParallelismFactor = 0;
+
+		this.additionalFactoryTimes = undefined;
+		this.additionalFactories = 0;
+		this.additionalFactoriesParallelismFactor = 0;
+
+		/** @deprecated */
+		this.additionalIntegration = 0;
+	}
+
+	markFactoryStart() {
+		this.factoryStartTime = Date.now();
+	}
+
+	markFactoryEnd() {
+		this.factoryEndTime = Date.now();
+		this.factory = this.factoryEndTime - this.factoryStartTime;
+	}
+
+	markRestoringStart() {
+		this.restoringStartTime = Date.now();
+	}
+
+	markRestoringEnd() {
+		this.restoringEndTime = Date.now();
+		this.restoring = this.restoringEndTime - this.restoringStartTime;
+	}
+
+	markIntegrationStart() {
+		this.integrationStartTime = Date.now();
+	}
+
+	markIntegrationEnd() {
+		this.integrationEndTime = Date.now();
+		this.integration = this.integrationEndTime - this.integrationStartTime;
+	}
+
+	markBuildingStart() {
+		this.buildingStartTime = Date.now();
+	}
+
+	markBuildingEnd() {
+		this.buildingEndTime = Date.now();
+		this.building = this.buildingEndTime - this.buildingStartTime;
+	}
+
+	markStoringStart() {
+		this.storingStartTime = Date.now();
+	}
+
+	markStoringEnd() {
+		this.storingEndTime = Date.now();
+		this.storing = this.storingEndTime - this.storingStartTime;
+	}
+
+	// This depends on timing so we ignore it for coverage
+	/* istanbul ignore next */
+	/**
+	 * Merge this profile into another one
+	 * @param {ModuleProfile} realProfile the profile to merge into
+	 * @returns {void}
+	 */
+	mergeInto(realProfile) {
+		realProfile.additionalFactories = this.factory;
+		(realProfile.additionalFactoryTimes =
+			realProfile.additionalFactoryTimes || []).push({
+			start: this.factoryStartTime,
+			end: this.factoryEndTime
+		});
+	}
+}
+
+module.exports = ModuleProfile;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleRestoreError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleRestoreError.js
new file mode 100644
index 0000000..cf21a93
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleRestoreError.js
@@ -0,0 +1,42 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Module")} Module */
+
+class ModuleRestoreError extends WebpackError {
+	/**
+	 * @param {Module} module module tied to dependency
+	 * @param {string | Error} err error thrown
+	 */
+	constructor(module, err) {
+		let message = "Module restore failed: ";
+		let details = undefined;
+		if (err !== null && typeof err === "object") {
+			if (typeof err.stack === "string" && err.stack) {
+				const stack = err.stack;
+				message += stack;
+			} else if (typeof err.message === "string" && err.message) {
+				message += err.message;
+			} else {
+				message += err;
+			}
+		} else {
+			message += String(err);
+		}
+
+		super(message);
+
+		this.name = "ModuleRestoreError";
+		this.details = details;
+		this.module = module;
+		this.error = err;
+	}
+}
+
+module.exports = ModuleRestoreError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleStoreError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleStoreError.js
new file mode 100644
index 0000000..9d1f66b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleStoreError.js
@@ -0,0 +1,42 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Module")} Module */
+
+class ModuleStoreError extends WebpackError {
+	/**
+	 * @param {Module} module module tied to dependency
+	 * @param {string | Error} err error thrown
+	 */
+	constructor(module, err) {
+		let message = "Module storing failed: ";
+		let details = undefined;
+		if (err !== null && typeof err === "object") {
+			if (typeof err.stack === "string" && err.stack) {
+				const stack = err.stack;
+				message += stack;
+			} else if (typeof err.message === "string" && err.message) {
+				message += err.message;
+			} else {
+				message += err;
+			}
+		} else {
+			message += String(err);
+		}
+
+		super(message);
+
+		this.name = "ModuleStoreError";
+		this.details = details;
+		this.module = module;
+		this.error = err;
+	}
+}
+
+module.exports = ModuleStoreError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleTemplate.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleTemplate.js
new file mode 100644
index 0000000..5ed5382
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleTemplate.js
@@ -0,0 +1,142 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const memoize = require("./util/memoize");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./util/Hash")} Hash */
+
+const getJavascriptModulesPlugin = memoize(() =>
+	require("./javascript/JavascriptModulesPlugin")
+);
+
+// TODO webpack 6: remove this class
+class ModuleTemplate {
+	/**
+	 * @param {RuntimeTemplate} runtimeTemplate the runtime template
+	 * @param {Compilation} compilation the compilation
+	 */
+	constructor(runtimeTemplate, compilation) {
+		this._runtimeTemplate = runtimeTemplate;
+		this.type = "javascript";
+		this.hooks = Object.freeze({
+			content: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.renderModuleContent.tap(
+								options,
+								(source, module, renderContext) =>
+									fn(
+										source,
+										module,
+										renderContext,
+										renderContext.dependencyTemplates
+									)
+							);
+					},
+					"ModuleTemplate.hooks.content is deprecated (use JavascriptModulesPlugin.getCompilationHooks().renderModuleContent instead)",
+					"DEP_MODULE_TEMPLATE_CONTENT"
+				)
+			},
+			module: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.renderModuleContent.tap(
+								options,
+								(source, module, renderContext) =>
+									fn(
+										source,
+										module,
+										renderContext,
+										renderContext.dependencyTemplates
+									)
+							);
+					},
+					"ModuleTemplate.hooks.module is deprecated (use JavascriptModulesPlugin.getCompilationHooks().renderModuleContent instead)",
+					"DEP_MODULE_TEMPLATE_MODULE"
+				)
+			},
+			render: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.renderModuleContainer.tap(
+								options,
+								(source, module, renderContext) =>
+									fn(
+										source,
+										module,
+										renderContext,
+										renderContext.dependencyTemplates
+									)
+							);
+					},
+					"ModuleTemplate.hooks.render is deprecated (use JavascriptModulesPlugin.getCompilationHooks().renderModuleContainer instead)",
+					"DEP_MODULE_TEMPLATE_RENDER"
+				)
+			},
+			package: {
+				tap: util.deprecate(
+					(options, fn) => {
+						getJavascriptModulesPlugin()
+							.getCompilationHooks(compilation)
+							.renderModulePackage.tap(
+								options,
+								(source, module, renderContext) =>
+									fn(
+										source,
+										module,
+										renderContext,
+										renderContext.dependencyTemplates
+									)
+							);
+					},
+					"ModuleTemplate.hooks.package is deprecated (use JavascriptModulesPlugin.getCompilationHooks().renderModulePackage instead)",
+					"DEP_MODULE_TEMPLATE_PACKAGE"
+				)
+			},
+			hash: {
+				tap: util.deprecate(
+					(options, fn) => {
+						compilation.hooks.fullHash.tap(options, fn);
+					},
+					"ModuleTemplate.hooks.hash is deprecated (use Compilation.hooks.fullHash instead)",
+					"DEP_MODULE_TEMPLATE_HASH"
+				)
+			}
+		});
+	}
+}
+
+Object.defineProperty(ModuleTemplate.prototype, "runtimeTemplate", {
+	get: util.deprecate(
+		/**
+		 * @this {ModuleTemplate}
+		 * @returns {TODO} output options
+		 */
+		function () {
+			return this._runtimeTemplate;
+		},
+		"ModuleTemplate.runtimeTemplate is deprecated (use Compilation.runtimeTemplate instead)",
+		"DEP_WEBPACK_CHUNK_TEMPLATE_OUTPUT_OPTIONS"
+	)
+});
+
+module.exports = ModuleTemplate;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleWarning.js
new file mode 100644
index 0000000..a67c0e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ModuleWarning.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { cleanUp } = require("./ErrorHelpers");
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+class ModuleWarning extends WebpackError {
+	/**
+	 * @param {Error} warning error thrown
+	 * @param {{from?: string|null}} info additional info
+	 */
+	constructor(warning, { from = null } = {}) {
+		let message = "Module Warning";
+
+		if (from) {
+			message += ` (from ${from}):\n`;
+		} else {
+			message += ": ";
+		}
+
+		if (warning && typeof warning === "object" && warning.message) {
+			message += warning.message;
+		} else if (warning) {
+			message += String(warning);
+		}
+
+		super(message);
+
+		this.name = "ModuleWarning";
+		this.warning = warning;
+		this.details =
+			warning && typeof warning === "object" && warning.stack
+				? cleanUp(warning.stack, this.message)
+				: undefined;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.warning);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.warning = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ModuleWarning, "webpack/lib/ModuleWarning");
+
+module.exports = ModuleWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/MultiCompiler.js b/node_modules/mathjs/examples/node_modules/webpack/lib/MultiCompiler.js
new file mode 100644
index 0000000..8046838
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/MultiCompiler.js
@@ -0,0 +1,582 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const { SyncHook, MultiHook } = require("tapable");
+
+const ConcurrentCompilationError = require("./ConcurrentCompilationError");
+const MultiStats = require("./MultiStats");
+const MultiWatching = require("./MultiWatching");
+const ArrayQueue = require("./util/ArrayQueue");
+
+/** @template T @typedef {import("tapable").AsyncSeriesHook<T>} AsyncSeriesHook<T> */
+/** @template T @template R @typedef {import("tapable").SyncBailHook<T, R>} SyncBailHook<T, R> */
+/** @typedef {import("../declarations/WebpackOptions").WatchOptions} WatchOptions */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Stats")} Stats */
+/** @typedef {import("./Watching")} Watching */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("./util/fs").IntermediateFileSystem} IntermediateFileSystem */
+/** @typedef {import("./util/fs").OutputFileSystem} OutputFileSystem */
+/** @typedef {import("./util/fs").WatchFileSystem} WatchFileSystem */
+
+/**
+ * @template T
+ * @callback Callback
+ * @param {(Error | null)=} err
+ * @param {T=} result
+ */
+
+/**
+ * @callback RunWithDependenciesHandler
+ * @param {Compiler} compiler
+ * @param {Callback<MultiStats>} callback
+ */
+
+/**
+ * @typedef {Object} MultiCompilerOptions
+ * @property {number=} parallelism how many Compilers are allows to run at the same time in parallel
+ */
+
+module.exports = class MultiCompiler {
+	/**
+	 * @param {Compiler[] | Record<string, Compiler>} compilers child compilers
+	 * @param {MultiCompilerOptions} options options
+	 */
+	constructor(compilers, options) {
+		if (!Array.isArray(compilers)) {
+			compilers = Object.keys(compilers).map(name => {
+				compilers[name].name = name;
+				return compilers[name];
+			});
+		}
+
+		this.hooks = Object.freeze({
+			/** @type {SyncHook<[MultiStats]>} */
+			done: new SyncHook(["stats"]),
+			/** @type {MultiHook<SyncHook<[string | null, number]>>} */
+			invalid: new MultiHook(compilers.map(c => c.hooks.invalid)),
+			/** @type {MultiHook<AsyncSeriesHook<[Compiler]>>} */
+			run: new MultiHook(compilers.map(c => c.hooks.run)),
+			/** @type {SyncHook<[]>} */
+			watchClose: new SyncHook([]),
+			/** @type {MultiHook<AsyncSeriesHook<[Compiler]>>} */
+			watchRun: new MultiHook(compilers.map(c => c.hooks.watchRun)),
+			/** @type {MultiHook<SyncBailHook<[string, string, any[]], true>>} */
+			infrastructureLog: new MultiHook(
+				compilers.map(c => c.hooks.infrastructureLog)
+			)
+		});
+		this.compilers = compilers;
+		/** @type {MultiCompilerOptions} */
+		this._options = {
+			parallelism: options.parallelism || Infinity
+		};
+		/** @type {WeakMap<Compiler, string[]>} */
+		this.dependencies = new WeakMap();
+		this.running = false;
+
+		/** @type {Stats[]} */
+		const compilerStats = this.compilers.map(() => null);
+		let doneCompilers = 0;
+		for (let index = 0; index < this.compilers.length; index++) {
+			const compiler = this.compilers[index];
+			const compilerIndex = index;
+			let compilerDone = false;
+			compiler.hooks.done.tap("MultiCompiler", stats => {
+				if (!compilerDone) {
+					compilerDone = true;
+					doneCompilers++;
+				}
+				compilerStats[compilerIndex] = stats;
+				if (doneCompilers === this.compilers.length) {
+					this.hooks.done.call(new MultiStats(compilerStats));
+				}
+			});
+			compiler.hooks.invalid.tap("MultiCompiler", () => {
+				if (compilerDone) {
+					compilerDone = false;
+					doneCompilers--;
+				}
+			});
+		}
+	}
+
+	get options() {
+		return Object.assign(
+			this.compilers.map(c => c.options),
+			this._options
+		);
+	}
+
+	get outputPath() {
+		let commonPath = this.compilers[0].outputPath;
+		for (const compiler of this.compilers) {
+			while (
+				compiler.outputPath.indexOf(commonPath) !== 0 &&
+				/[/\\]/.test(commonPath)
+			) {
+				commonPath = commonPath.replace(/[/\\][^/\\]*$/, "");
+			}
+		}
+
+		if (!commonPath && this.compilers[0].outputPath[0] === "/") return "/";
+		return commonPath;
+	}
+
+	get inputFileSystem() {
+		throw new Error("Cannot read inputFileSystem of a MultiCompiler");
+	}
+
+	get outputFileSystem() {
+		throw new Error("Cannot read outputFileSystem of a MultiCompiler");
+	}
+
+	get watchFileSystem() {
+		throw new Error("Cannot read watchFileSystem of a MultiCompiler");
+	}
+
+	get intermediateFileSystem() {
+		throw new Error("Cannot read outputFileSystem of a MultiCompiler");
+	}
+
+	/**
+	 * @param {InputFileSystem} value the new input file system
+	 */
+	set inputFileSystem(value) {
+		for (const compiler of this.compilers) {
+			compiler.inputFileSystem = value;
+		}
+	}
+
+	/**
+	 * @param {OutputFileSystem} value the new output file system
+	 */
+	set outputFileSystem(value) {
+		for (const compiler of this.compilers) {
+			compiler.outputFileSystem = value;
+		}
+	}
+
+	/**
+	 * @param {WatchFileSystem} value the new watch file system
+	 */
+	set watchFileSystem(value) {
+		for (const compiler of this.compilers) {
+			compiler.watchFileSystem = value;
+		}
+	}
+
+	/**
+	 * @param {IntermediateFileSystem} value the new intermediate file system
+	 */
+	set intermediateFileSystem(value) {
+		for (const compiler of this.compilers) {
+			compiler.intermediateFileSystem = value;
+		}
+	}
+
+	getInfrastructureLogger(name) {
+		return this.compilers[0].getInfrastructureLogger(name);
+	}
+
+	/**
+	 * @param {Compiler} compiler the child compiler
+	 * @param {string[]} dependencies its dependencies
+	 * @returns {void}
+	 */
+	setDependencies(compiler, dependencies) {
+		this.dependencies.set(compiler, dependencies);
+	}
+
+	/**
+	 * @param {Callback<MultiStats>} callback signals when the validation is complete
+	 * @returns {boolean} true if the dependencies are valid
+	 */
+	validateDependencies(callback) {
+		/** @type {Set<{source: Compiler, target: Compiler}>} */
+		const edges = new Set();
+		/** @type {string[]} */
+		const missing = [];
+		const targetFound = compiler => {
+			for (const edge of edges) {
+				if (edge.target === compiler) {
+					return true;
+				}
+			}
+			return false;
+		};
+		const sortEdges = (e1, e2) => {
+			return (
+				e1.source.name.localeCompare(e2.source.name) ||
+				e1.target.name.localeCompare(e2.target.name)
+			);
+		};
+		for (const source of this.compilers) {
+			const dependencies = this.dependencies.get(source);
+			if (dependencies) {
+				for (const dep of dependencies) {
+					const target = this.compilers.find(c => c.name === dep);
+					if (!target) {
+						missing.push(dep);
+					} else {
+						edges.add({
+							source,
+							target
+						});
+					}
+				}
+			}
+		}
+		/** @type {string[]} */
+		const errors = missing.map(m => `Compiler dependency \`${m}\` not found.`);
+		const stack = this.compilers.filter(c => !targetFound(c));
+		while (stack.length > 0) {
+			const current = stack.pop();
+			for (const edge of edges) {
+				if (edge.source === current) {
+					edges.delete(edge);
+					const target = edge.target;
+					if (!targetFound(target)) {
+						stack.push(target);
+					}
+				}
+			}
+		}
+		if (edges.size > 0) {
+			/** @type {string[]} */
+			const lines = Array.from(edges)
+				.sort(sortEdges)
+				.map(edge => `${edge.source.name} -> ${edge.target.name}`);
+			lines.unshift("Circular dependency found in compiler dependencies.");
+			errors.unshift(lines.join("\n"));
+		}
+		if (errors.length > 0) {
+			const message = errors.join("\n");
+			callback(new Error(message));
+			return false;
+		}
+		return true;
+	}
+
+	// TODO webpack 6 remove
+	/**
+	 * @deprecated This method should have been private
+	 * @param {Compiler[]} compilers the child compilers
+	 * @param {RunWithDependenciesHandler} fn a handler to run for each compiler
+	 * @param {Callback<MultiStats>} callback the compiler's handler
+	 * @returns {void}
+	 */
+	runWithDependencies(compilers, fn, callback) {
+		const fulfilledNames = new Set();
+		let remainingCompilers = compilers;
+		const isDependencyFulfilled = d => fulfilledNames.has(d);
+		const getReadyCompilers = () => {
+			let readyCompilers = [];
+			let list = remainingCompilers;
+			remainingCompilers = [];
+			for (const c of list) {
+				const dependencies = this.dependencies.get(c);
+				const ready =
+					!dependencies || dependencies.every(isDependencyFulfilled);
+				if (ready) {
+					readyCompilers.push(c);
+				} else {
+					remainingCompilers.push(c);
+				}
+			}
+			return readyCompilers;
+		};
+		const runCompilers = callback => {
+			if (remainingCompilers.length === 0) return callback();
+			asyncLib.map(
+				getReadyCompilers(),
+				(compiler, callback) => {
+					fn(compiler, err => {
+						if (err) return callback(err);
+						fulfilledNames.add(compiler.name);
+						runCompilers(callback);
+					});
+				},
+				callback
+			);
+		};
+		runCompilers(callback);
+	}
+
+	/**
+	 * @template SetupResult
+	 * @param {function(Compiler, number, Callback<Stats>, function(): boolean, function(): void, function(): void): SetupResult} setup setup a single compiler
+	 * @param {function(Compiler, SetupResult, Callback<Stats>): void} run run/continue a single compiler
+	 * @param {Callback<MultiStats>} callback callback when all compilers are done, result includes Stats of all changed compilers
+	 * @returns {SetupResult[]} result of setup
+	 */
+	_runGraph(setup, run, callback) {
+		/** @typedef {{ compiler: Compiler, setupResult: SetupResult, result: Stats, state: "pending" | "blocked" | "queued" | "starting" | "running" | "running-outdated" | "done", children: Node[], parents: Node[] }} Node */
+
+		// State transitions for nodes:
+		// -> blocked (initial)
+		// blocked -> starting [running++] (when all parents done)
+		// queued -> starting [running++] (when processing the queue)
+		// starting -> running (when run has been called)
+		// running -> done [running--] (when compilation is done)
+		// done -> pending (when invalidated from file change)
+		// pending -> blocked [add to queue] (when invalidated from aggregated changes)
+		// done -> blocked [add to queue] (when invalidated, from parent invalidation)
+		// running -> running-outdated (when invalidated, either from change or parent invalidation)
+		// running-outdated -> blocked [running--] (when compilation is done)
+
+		/** @type {Node[]} */
+		const nodes = this.compilers.map(compiler => ({
+			compiler,
+			setupResult: undefined,
+			result: undefined,
+			state: "blocked",
+			children: [],
+			parents: []
+		}));
+		/** @type {Map<string, Node>} */
+		const compilerToNode = new Map();
+		for (const node of nodes) compilerToNode.set(node.compiler.name, node);
+		for (const node of nodes) {
+			const dependencies = this.dependencies.get(node.compiler);
+			if (!dependencies) continue;
+			for (const dep of dependencies) {
+				const parent = compilerToNode.get(dep);
+				node.parents.push(parent);
+				parent.children.push(node);
+			}
+		}
+		/** @type {ArrayQueue<Node>} */
+		const queue = new ArrayQueue();
+		for (const node of nodes) {
+			if (node.parents.length === 0) {
+				node.state = "queued";
+				queue.enqueue(node);
+			}
+		}
+		let errored = false;
+		let running = 0;
+		const parallelism = this._options.parallelism;
+		/**
+		 * @param {Node} node node
+		 * @param {Error=} err error
+		 * @param {Stats=} stats result
+		 * @returns {void}
+		 */
+		const nodeDone = (node, err, stats) => {
+			if (errored) return;
+			if (err) {
+				errored = true;
+				return asyncLib.each(
+					nodes,
+					(node, callback) => {
+						if (node.compiler.watching) {
+							node.compiler.watching.close(callback);
+						} else {
+							callback();
+						}
+					},
+					() => callback(err)
+				);
+			}
+			node.result = stats;
+			running--;
+			if (node.state === "running") {
+				node.state = "done";
+				for (const child of node.children) {
+					if (child.state === "blocked") queue.enqueue(child);
+				}
+			} else if (node.state === "running-outdated") {
+				node.state = "blocked";
+				queue.enqueue(node);
+			}
+			processQueue();
+		};
+		/**
+		 * @param {Node} node node
+		 * @returns {void}
+		 */
+		const nodeInvalidFromParent = node => {
+			if (node.state === "done") {
+				node.state = "blocked";
+			} else if (node.state === "running") {
+				node.state = "running-outdated";
+			}
+			for (const child of node.children) {
+				nodeInvalidFromParent(child);
+			}
+		};
+		/**
+		 * @param {Node} node node
+		 * @returns {void}
+		 */
+		const nodeInvalid = node => {
+			if (node.state === "done") {
+				node.state = "pending";
+			} else if (node.state === "running") {
+				node.state = "running-outdated";
+			}
+			for (const child of node.children) {
+				nodeInvalidFromParent(child);
+			}
+		};
+		/**
+		 * @param {Node} node node
+		 * @returns {void}
+		 */
+		const nodeChange = node => {
+			nodeInvalid(node);
+			if (node.state === "pending") {
+				node.state = "blocked";
+			}
+			if (node.state === "blocked") {
+				queue.enqueue(node);
+				processQueue();
+			}
+		};
+
+		const setupResults = [];
+		nodes.forEach((node, i) => {
+			setupResults.push(
+				(node.setupResult = setup(
+					node.compiler,
+					i,
+					nodeDone.bind(null, node),
+					() => node.state !== "starting" && node.state !== "running",
+					() => nodeChange(node),
+					() => nodeInvalid(node)
+				))
+			);
+		});
+		let processing = true;
+		const processQueue = () => {
+			if (processing) return;
+			processing = true;
+			process.nextTick(processQueueWorker);
+		};
+		const processQueueWorker = () => {
+			while (running < parallelism && queue.length > 0 && !errored) {
+				const node = queue.dequeue();
+				if (
+					node.state === "queued" ||
+					(node.state === "blocked" &&
+						node.parents.every(p => p.state === "done"))
+				) {
+					running++;
+					node.state = "starting";
+					run(node.compiler, node.setupResult, nodeDone.bind(null, node));
+					node.state = "running";
+				}
+			}
+			processing = false;
+			if (
+				!errored &&
+				running === 0 &&
+				nodes.every(node => node.state === "done")
+			) {
+				const stats = [];
+				for (const node of nodes) {
+					const result = node.result;
+					if (result) {
+						node.result = undefined;
+						stats.push(result);
+					}
+				}
+				if (stats.length > 0) {
+					callback(null, new MultiStats(stats));
+				}
+			}
+		};
+		processQueueWorker();
+		return setupResults;
+	}
+
+	/**
+	 * @param {WatchOptions|WatchOptions[]} watchOptions the watcher's options
+	 * @param {Callback<MultiStats>} handler signals when the call finishes
+	 * @returns {MultiWatching} a compiler watcher
+	 */
+	watch(watchOptions, handler) {
+		if (this.running) {
+			return handler(new ConcurrentCompilationError());
+		}
+		this.running = true;
+
+		if (this.validateDependencies(handler)) {
+			const watchings = this._runGraph(
+				(compiler, idx, callback, isBlocked, setChanged, setInvalid) => {
+					const watching = compiler.watch(
+						Array.isArray(watchOptions) ? watchOptions[idx] : watchOptions,
+						callback
+					);
+					if (watching) {
+						watching._onInvalid = setInvalid;
+						watching._onChange = setChanged;
+						watching._isBlocked = isBlocked;
+					}
+					return watching;
+				},
+				(compiler, watching, callback) => {
+					if (compiler.watching !== watching) return;
+					if (!watching.running) watching.invalidate();
+				},
+				handler
+			);
+			return new MultiWatching(watchings, this);
+		}
+
+		return new MultiWatching([], this);
+	}
+
+	/**
+	 * @param {Callback<MultiStats>} callback signals when the call finishes
+	 * @returns {void}
+	 */
+	run(callback) {
+		if (this.running) {
+			return callback(new ConcurrentCompilationError());
+		}
+		this.running = true;
+
+		if (this.validateDependencies(callback)) {
+			this._runGraph(
+				() => {},
+				(compiler, setupResult, callback) => compiler.run(callback),
+				(err, stats) => {
+					this.running = false;
+
+					if (callback !== undefined) {
+						return callback(err, stats);
+					}
+				}
+			);
+		}
+	}
+
+	purgeInputFileSystem() {
+		for (const compiler of this.compilers) {
+			if (compiler.inputFileSystem && compiler.inputFileSystem.purge) {
+				compiler.inputFileSystem.purge();
+			}
+		}
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the compiler closes
+	 * @returns {void}
+	 */
+	close(callback) {
+		asyncLib.each(
+			this.compilers,
+			(compiler, callback) => {
+				compiler.close(callback);
+			},
+			callback
+		);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/MultiStats.js b/node_modules/mathjs/examples/node_modules/webpack/lib/MultiStats.js
new file mode 100644
index 0000000..d236aef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/MultiStats.js
@@ -0,0 +1,166 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const identifierUtils = require("./util/identifier");
+
+/** @typedef {import("../declarations/WebpackOptions").StatsOptions} StatsOptions */
+/** @typedef {import("./Stats")} Stats */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").KnownStatsCompilation} KnownStatsCompilation */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsCompilation} StatsCompilation */
+
+const indent = (str, prefix) => {
+	const rem = str.replace(/\n([^\n])/g, "\n" + prefix + "$1");
+	return prefix + rem;
+};
+
+class MultiStats {
+	/**
+	 * @param {Stats[]} stats the child stats
+	 */
+	constructor(stats) {
+		this.stats = stats;
+	}
+
+	get hash() {
+		return this.stats.map(stat => stat.hash).join("");
+	}
+
+	/**
+	 * @returns {boolean} true if a child compilation encountered an error
+	 */
+	hasErrors() {
+		return this.stats.some(stat => stat.hasErrors());
+	}
+
+	/**
+	 * @returns {boolean} true if a child compilation had a warning
+	 */
+	hasWarnings() {
+		return this.stats.some(stat => stat.hasWarnings());
+	}
+
+	_createChildOptions(options, context) {
+		if (!options) {
+			options = {};
+		}
+		const { children: childrenOptions = undefined, ...baseOptions } =
+			typeof options === "string" ? { preset: options } : options;
+		const children = this.stats.map((stat, idx) => {
+			const childOptions = Array.isArray(childrenOptions)
+				? childrenOptions[idx]
+				: childrenOptions;
+			return stat.compilation.createStatsOptions(
+				{
+					...baseOptions,
+					...(typeof childOptions === "string"
+						? { preset: childOptions }
+						: childOptions && typeof childOptions === "object"
+						? childOptions
+						: undefined)
+				},
+				context
+			);
+		});
+		return {
+			version: children.every(o => o.version),
+			hash: children.every(o => o.hash),
+			errorsCount: children.every(o => o.errorsCount),
+			warningsCount: children.every(o => o.warningsCount),
+			errors: children.every(o => o.errors),
+			warnings: children.every(o => o.warnings),
+			children
+		};
+	}
+
+	/**
+	 * @param {any} options stats options
+	 * @returns {StatsCompilation} json output
+	 */
+	toJson(options) {
+		options = this._createChildOptions(options, { forToString: false });
+		/** @type {KnownStatsCompilation} */
+		const obj = {};
+		obj.children = this.stats.map((stat, idx) => {
+			const obj = stat.toJson(options.children[idx]);
+			const compilationName = stat.compilation.name;
+			const name =
+				compilationName &&
+				identifierUtils.makePathsRelative(
+					options.context,
+					compilationName,
+					stat.compilation.compiler.root
+				);
+			obj.name = name;
+			return obj;
+		});
+		if (options.version) {
+			obj.version = obj.children[0].version;
+		}
+		if (options.hash) {
+			obj.hash = obj.children.map(j => j.hash).join("");
+		}
+		const mapError = (j, obj) => {
+			return {
+				...obj,
+				compilerPath: obj.compilerPath
+					? `${j.name}.${obj.compilerPath}`
+					: j.name
+			};
+		};
+		if (options.errors) {
+			obj.errors = [];
+			for (const j of obj.children) {
+				for (const i of j.errors) {
+					obj.errors.push(mapError(j, i));
+				}
+			}
+		}
+		if (options.warnings) {
+			obj.warnings = [];
+			for (const j of obj.children) {
+				for (const i of j.warnings) {
+					obj.warnings.push(mapError(j, i));
+				}
+			}
+		}
+		if (options.errorsCount) {
+			obj.errorsCount = 0;
+			for (const j of obj.children) {
+				obj.errorsCount += j.errorsCount;
+			}
+		}
+		if (options.warningsCount) {
+			obj.warningsCount = 0;
+			for (const j of obj.children) {
+				obj.warningsCount += j.warningsCount;
+			}
+		}
+		return obj;
+	}
+
+	toString(options) {
+		options = this._createChildOptions(options, { forToString: true });
+		const results = this.stats.map((stat, idx) => {
+			const str = stat.toString(options.children[idx]);
+			const compilationName = stat.compilation.name;
+			const name =
+				compilationName &&
+				identifierUtils
+					.makePathsRelative(
+						options.context,
+						compilationName,
+						stat.compilation.compiler.root
+					)
+					.replace(/\|/g, " ");
+			if (!str) return str;
+			return name ? `${name}:\n${indent(str, "  ")}` : str;
+		});
+		return results.filter(Boolean).join("\n\n");
+	}
+}
+
+module.exports = MultiStats;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/MultiWatching.js b/node_modules/mathjs/examples/node_modules/webpack/lib/MultiWatching.js
new file mode 100644
index 0000000..2bbd536
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/MultiWatching.js
@@ -0,0 +1,77 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+
+/** @typedef {import("./MultiCompiler")} MultiCompiler */
+/** @typedef {import("./Watching")} Watching */
+
+/**
+ * @template T
+ * @callback Callback
+ * @param {(Error | null)=} err
+ * @param {T=} result
+ */
+
+class MultiWatching {
+	/**
+	 * @param {Watching[]} watchings child compilers' watchers
+	 * @param {MultiCompiler} compiler the compiler
+	 */
+	constructor(watchings, compiler) {
+		this.watchings = watchings;
+		this.compiler = compiler;
+	}
+
+	invalidate(callback) {
+		if (callback) {
+			asyncLib.each(
+				this.watchings,
+				(watching, callback) => watching.invalidate(callback),
+				callback
+			);
+		} else {
+			for (const watching of this.watchings) {
+				watching.invalidate();
+			}
+		}
+	}
+
+	suspend() {
+		for (const watching of this.watchings) {
+			watching.suspend();
+		}
+	}
+
+	resume() {
+		for (const watching of this.watchings) {
+			watching.resume();
+		}
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the watcher is closed
+	 * @returns {void}
+	 */
+	close(callback) {
+		asyncLib.forEach(
+			this.watchings,
+			(watching, finishedCallback) => {
+				watching.close(finishedCallback);
+			},
+			err => {
+				this.compiler.hooks.watchClose.call();
+				if (typeof callback === "function") {
+					this.compiler.running = false;
+					callback(err);
+				}
+			}
+		);
+	}
+}
+
+module.exports = MultiWatching;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NoEmitOnErrorsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NoEmitOnErrorsPlugin.js
new file mode 100644
index 0000000..a84eb56
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NoEmitOnErrorsPlugin.js
@@ -0,0 +1,28 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class NoEmitOnErrorsPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.shouldEmit.tap("NoEmitOnErrorsPlugin", compilation => {
+			if (compilation.getStats().hasErrors()) return false;
+		});
+		compiler.hooks.compilation.tap("NoEmitOnErrorsPlugin", compilation => {
+			compilation.hooks.shouldRecord.tap("NoEmitOnErrorsPlugin", () => {
+				if (compilation.getStats().hasErrors()) return false;
+			});
+		});
+	}
+}
+
+module.exports = NoEmitOnErrorsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NoModeWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NoModeWarning.js
new file mode 100644
index 0000000..fdd3fad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NoModeWarning.js
@@ -0,0 +1,22 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+module.exports = class NoModeWarning extends WebpackError {
+	constructor() {
+		super();
+
+		this.name = "NoModeWarning";
+		this.message =
+			"configuration\n" +
+			"The 'mode' option has not been set, webpack will fallback to 'production' for this value.\n" +
+			"Set 'mode' option to 'development' or 'production' to enable defaults for each environment.\n" +
+			"You can also set it to 'none' to disable any default behavior. " +
+			"Learn more: https://webpack.js.org/configuration/mode/";
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NodeStuffInWebError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NodeStuffInWebError.js
new file mode 100644
index 0000000..02b048e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NodeStuffInWebError.js
@@ -0,0 +1,34 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+
+class NodeStuffInWebError extends WebpackError {
+	/**
+	 * @param {DependencyLocation} loc loc
+	 * @param {string} expression expression
+	 * @param {string} description description
+	 */
+	constructor(loc, expression, description) {
+		super(
+			`${JSON.stringify(
+				expression
+			)} has been used, it will be undefined in next major version.
+${description}`
+		);
+
+		this.name = "NodeStuffInWebError";
+		this.loc = loc;
+	}
+}
+
+makeSerializable(NodeStuffInWebError, "webpack/lib/NodeStuffInWebError");
+
+module.exports = NodeStuffInWebError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NodeStuffPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NodeStuffPlugin.js
new file mode 100644
index 0000000..c8e1517
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NodeStuffPlugin.js
@@ -0,0 +1,186 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NodeStuffInWebError = require("./NodeStuffInWebError");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const CachedConstDependency = require("./dependencies/CachedConstDependency");
+const ConstDependency = require("./dependencies/ConstDependency");
+const {
+	evaluateToString,
+	expressionIsUnsupported
+} = require("./javascript/JavascriptParserHelpers");
+const { relative } = require("./util/fs");
+const { parseResource } = require("./util/identifier");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+
+class NodeStuffPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		compiler.hooks.compilation.tap(
+			"NodeStuffPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const handler = (parser, parserOptions) => {
+					if (parserOptions.node === false) return;
+
+					let localOptions = options;
+					if (parserOptions.node) {
+						localOptions = { ...localOptions, ...parserOptions.node };
+					}
+
+					if (localOptions.global !== false) {
+						const withWarning = localOptions.global === "warn";
+						parser.hooks.expression
+							.for("global")
+							.tap("NodeStuffPlugin", expr => {
+								const dep = new ConstDependency(
+									RuntimeGlobals.global,
+									expr.range,
+									[RuntimeGlobals.global]
+								);
+								dep.loc = expr.loc;
+								parser.state.module.addPresentationalDependency(dep);
+
+								// TODO webpack 6 remove
+								if (withWarning) {
+									parser.state.module.addWarning(
+										new NodeStuffInWebError(
+											dep.loc,
+											"global",
+											"The global namespace object is Node.js feature and doesn't present in browser."
+										)
+									);
+								}
+							});
+						parser.hooks.rename.for("global").tap("NodeStuffPlugin", expr => {
+							const dep = new ConstDependency(
+								RuntimeGlobals.global,
+								expr.range,
+								[RuntimeGlobals.global]
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return false;
+						});
+					}
+
+					const setModuleConstant = (expressionName, fn, warning) => {
+						parser.hooks.expression
+							.for(expressionName)
+							.tap("NodeStuffPlugin", expr => {
+								const dep = new CachedConstDependency(
+									JSON.stringify(fn(parser.state.module)),
+									expr.range,
+									expressionName
+								);
+								dep.loc = expr.loc;
+								parser.state.module.addPresentationalDependency(dep);
+
+								// TODO webpack 6 remove
+								if (warning) {
+									parser.state.module.addWarning(
+										new NodeStuffInWebError(dep.loc, expressionName, warning)
+									);
+								}
+
+								return true;
+							});
+					};
+
+					const setConstant = (expressionName, value, warning) =>
+						setModuleConstant(expressionName, () => value, warning);
+
+					const context = compiler.context;
+					if (localOptions.__filename) {
+						switch (localOptions.__filename) {
+							case "mock":
+								setConstant("__filename", "/index.js");
+								break;
+							case "warn-mock":
+								setConstant(
+									"__filename",
+									"/index.js",
+									"The __filename is Node.js feature and doesn't present in browser."
+								);
+								break;
+							case true:
+								setModuleConstant("__filename", module =>
+									relative(compiler.inputFileSystem, context, module.resource)
+								);
+								break;
+						}
+
+						parser.hooks.evaluateIdentifier
+							.for("__filename")
+							.tap("NodeStuffPlugin", expr => {
+								if (!parser.state.module) return;
+								const resource = parseResource(parser.state.module.resource);
+								return evaluateToString(resource.path)(expr);
+							});
+					}
+					if (localOptions.__dirname) {
+						switch (localOptions.__dirname) {
+							case "mock":
+								setConstant("__dirname", "/");
+								break;
+							case "warn-mock":
+								setConstant(
+									"__dirname",
+									"/",
+									"The __dirname is Node.js feature and doesn't present in browser."
+								);
+								break;
+							case true:
+								setModuleConstant("__dirname", module =>
+									relative(compiler.inputFileSystem, context, module.context)
+								);
+								break;
+						}
+
+						parser.hooks.evaluateIdentifier
+							.for("__dirname")
+							.tap("NodeStuffPlugin", expr => {
+								if (!parser.state.module) return;
+								return evaluateToString(parser.state.module.context)(expr);
+							});
+					}
+					parser.hooks.expression
+						.for("require.extensions")
+						.tap(
+							"NodeStuffPlugin",
+							expressionIsUnsupported(
+								parser,
+								"require.extensions is not supported by webpack. Use a loader instead."
+							)
+						);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("NodeStuffPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("NodeStuffPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = NodeStuffPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModule.js
new file mode 100644
index 0000000..5484e19
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModule.js
@@ -0,0 +1,1411 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const parseJson = require("json-parse-better-errors");
+const { getContext, runLoaders } = require("loader-runner");
+const querystring = require("querystring");
+const { HookMap, SyncHook, AsyncSeriesBailHook } = require("tapable");
+const {
+	CachedSource,
+	OriginalSource,
+	RawSource,
+	SourceMapSource
+} = require("webpack-sources");
+const Compilation = require("./Compilation");
+const HookWebpackError = require("./HookWebpackError");
+const Module = require("./Module");
+const ModuleBuildError = require("./ModuleBuildError");
+const ModuleError = require("./ModuleError");
+const ModuleGraphConnection = require("./ModuleGraphConnection");
+const ModuleParseError = require("./ModuleParseError");
+const ModuleWarning = require("./ModuleWarning");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const UnhandledSchemeError = require("./UnhandledSchemeError");
+const WebpackError = require("./WebpackError");
+const formatLocation = require("./formatLocation");
+const LazySet = require("./util/LazySet");
+const { isSubset } = require("./util/SetHelpers");
+const { getScheme } = require("./util/URLAbsoluteSpecifier");
+const {
+	compareLocations,
+	concatComparators,
+	compareSelect,
+	keepOriginalOrder
+} = require("./util/comparators");
+const createHash = require("./util/createHash");
+const { createFakeHook } = require("./util/deprecation");
+const { join } = require("./util/fs");
+const {
+	contextify,
+	absolutify,
+	makePathsRelative
+} = require("./util/identifier");
+const makeSerializable = require("./util/makeSerializable");
+const memoize = require("./util/memoize");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/LoaderContext").NormalModuleLoaderContext} NormalModuleLoaderContext */
+/** @typedef {import("../declarations/WebpackOptions").Mode} Mode */
+/** @typedef {import("../declarations/WebpackOptions").ResolveOptions} ResolveOptions */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Generator")} Generator */
+/** @typedef {import("./Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./Module").ConcatenationBailoutReasonContext} ConcatenationBailoutReasonContext */
+/** @typedef {import("./Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("./Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("./NormalModuleFactory")} NormalModuleFactory */
+/** @typedef {import("./Parser")} Parser */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./logging/Logger").Logger} WebpackLogger */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} SourceMap
+ * @property {number} version
+ * @property {string[]} sources
+ * @property {string} mappings
+ * @property {string=} file
+ * @property {string=} sourceRoot
+ * @property {string[]=} sourcesContent
+ * @property {string[]=} names
+ */
+
+const getInvalidDependenciesModuleWarning = memoize(() =>
+	require("./InvalidDependenciesModuleWarning")
+);
+const getValidate = memoize(() => require("schema-utils").validate);
+
+const ABSOLUTE_PATH_REGEX = /^([a-zA-Z]:\\|\\\\|\/)/;
+
+/**
+ * @typedef {Object} LoaderItem
+ * @property {string} loader
+ * @property {any} options
+ * @property {string?} ident
+ * @property {string?} type
+ */
+
+/**
+ * @param {string} context absolute context path
+ * @param {string} source a source path
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {string} new source path
+ */
+const contextifySourceUrl = (context, source, associatedObjectForCache) => {
+	if (source.startsWith("webpack://")) return source;
+	return `webpack://${makePathsRelative(
+		context,
+		source,
+		associatedObjectForCache
+	)}`;
+};
+
+/**
+ * @param {string} context absolute context path
+ * @param {SourceMap} sourceMap a source map
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {SourceMap} new source map
+ */
+const contextifySourceMap = (context, sourceMap, associatedObjectForCache) => {
+	if (!Array.isArray(sourceMap.sources)) return sourceMap;
+	const { sourceRoot } = sourceMap;
+	/** @type {function(string): string} */
+	const mapper = !sourceRoot
+		? source => source
+		: sourceRoot.endsWith("/")
+		? source =>
+				source.startsWith("/")
+					? `${sourceRoot.slice(0, -1)}${source}`
+					: `${sourceRoot}${source}`
+		: source =>
+				source.startsWith("/")
+					? `${sourceRoot}${source}`
+					: `${sourceRoot}/${source}`;
+	const newSources = sourceMap.sources.map(source =>
+		contextifySourceUrl(context, mapper(source), associatedObjectForCache)
+	);
+	return {
+		...sourceMap,
+		file: "x",
+		sourceRoot: undefined,
+		sources: newSources
+	};
+};
+
+/**
+ * @param {string | Buffer} input the input
+ * @returns {string} the converted string
+ */
+const asString = input => {
+	if (Buffer.isBuffer(input)) {
+		return input.toString("utf-8");
+	}
+	return input;
+};
+
+/**
+ * @param {string | Buffer} input the input
+ * @returns {Buffer} the converted buffer
+ */
+const asBuffer = input => {
+	if (!Buffer.isBuffer(input)) {
+		return Buffer.from(input, "utf-8");
+	}
+	return input;
+};
+
+class NonErrorEmittedError extends WebpackError {
+	constructor(error) {
+		super();
+
+		this.name = "NonErrorEmittedError";
+		this.message = "(Emitted value instead of an instance of Error) " + error;
+	}
+}
+
+makeSerializable(
+	NonErrorEmittedError,
+	"webpack/lib/NormalModule",
+	"NonErrorEmittedError"
+);
+
+/**
+ * @typedef {Object} NormalModuleCompilationHooks
+ * @property {SyncHook<[object, NormalModule]>} loader
+ * @property {SyncHook<[LoaderItem[], NormalModule, object]>} beforeLoaders
+ * @property {SyncHook<[NormalModule]>} beforeParse
+ * @property {SyncHook<[NormalModule]>} beforeSnapshot
+ * @property {HookMap<AsyncSeriesBailHook<[string, NormalModule], string | Buffer>>} readResourceForScheme
+ * @property {HookMap<AsyncSeriesBailHook<[object], string | Buffer>>} readResource
+ * @property {AsyncSeriesBailHook<[NormalModule, NeedBuildContext], boolean>} needBuild
+ */
+
+/**
+ * @typedef {Object} NormalModuleCreateData
+ * @property {string=} layer an optional layer in which the module is
+ * @property {string} type module type
+ * @property {string} request request string
+ * @property {string} userRequest request intended by user (without loaders from config)
+ * @property {string} rawRequest request without resolving
+ * @property {LoaderItem[]} loaders list of loaders
+ * @property {string} resource path + query of the real resource
+ * @property {Record<string, any>=} resourceResolveData resource resolve data
+ * @property {string} context context directory for resolving
+ * @property {string=} matchResource path + query of the matched resource (virtual)
+ * @property {Parser} parser the parser used
+ * @property {Record<string, any>=} parserOptions the options of the parser used
+ * @property {Generator} generator the generator used
+ * @property {Record<string, any>=} generatorOptions the options of the generator used
+ * @property {ResolveOptions=} resolveOptions options used for resolving requests from this module
+ */
+
+/** @type {WeakMap<Compilation, NormalModuleCompilationHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class NormalModule extends Module {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {NormalModuleCompilationHooks} the attached hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				loader: new SyncHook(["loaderContext", "module"]),
+				beforeLoaders: new SyncHook(["loaders", "module", "loaderContext"]),
+				beforeParse: new SyncHook(["module"]),
+				beforeSnapshot: new SyncHook(["module"]),
+				// TODO webpack 6 deprecate
+				readResourceForScheme: new HookMap(scheme => {
+					const hook = hooks.readResource.for(scheme);
+					return createFakeHook(
+						/** @type {AsyncSeriesBailHook<[string, NormalModule], string | Buffer>} */ ({
+							tap: (options, fn) =>
+								hook.tap(options, loaderContext =>
+									fn(loaderContext.resource, loaderContext._module)
+								),
+							tapAsync: (options, fn) =>
+								hook.tapAsync(options, (loaderContext, callback) =>
+									fn(loaderContext.resource, loaderContext._module, callback)
+								),
+							tapPromise: (options, fn) =>
+								hook.tapPromise(options, loaderContext =>
+									fn(loaderContext.resource, loaderContext._module)
+								)
+						})
+					);
+				}),
+				readResource: new HookMap(
+					() => new AsyncSeriesBailHook(["loaderContext"])
+				),
+				needBuild: new AsyncSeriesBailHook(["module", "context"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	/**
+	 * @param {NormalModuleCreateData} options options object
+	 */
+	constructor({
+		layer,
+		type,
+		request,
+		userRequest,
+		rawRequest,
+		loaders,
+		resource,
+		resourceResolveData,
+		context,
+		matchResource,
+		parser,
+		parserOptions,
+		generator,
+		generatorOptions,
+		resolveOptions
+	}) {
+		super(type, context || getContext(resource), layer);
+
+		// Info from Factory
+		/** @type {string} */
+		this.request = request;
+		/** @type {string} */
+		this.userRequest = userRequest;
+		/** @type {string} */
+		this.rawRequest = rawRequest;
+		/** @type {boolean} */
+		this.binary = /^(asset|webassembly)\b/.test(type);
+		/** @type {Parser} */
+		this.parser = parser;
+		this.parserOptions = parserOptions;
+		/** @type {Generator} */
+		this.generator = generator;
+		this.generatorOptions = generatorOptions;
+		/** @type {string} */
+		this.resource = resource;
+		this.resourceResolveData = resourceResolveData;
+		/** @type {string | undefined} */
+		this.matchResource = matchResource;
+		/** @type {LoaderItem[]} */
+		this.loaders = loaders;
+		if (resolveOptions !== undefined) {
+			// already declared in super class
+			this.resolveOptions = resolveOptions;
+		}
+
+		// Info from Build
+		/** @type {(WebpackError | null)=} */
+		this.error = null;
+		/** @private @type {Source=} */
+		this._source = null;
+		/** @private @type {Map<string, number> | undefined} **/
+		this._sourceSizes = undefined;
+		/** @private @type {Set<string>} */
+		this._sourceTypes = undefined;
+
+		// Cache
+		this._lastSuccessfulBuildMeta = {};
+		this._forceBuild = true;
+		this._isEvaluatingSideEffects = false;
+		/** @type {WeakSet<ModuleGraph> | undefined} */
+		this._addedSideEffectsBailout = undefined;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		if (this.layer === null) {
+			if (this.type === "javascript/auto") {
+				return this.request;
+			} else {
+				return `${this.type}|${this.request}`;
+			}
+		} else {
+			return `${this.type}|${this.request}|${this.layer}`;
+		}
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return requestShortener.shorten(this.userRequest);
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		let ident = contextify(
+			options.context,
+			this.userRequest,
+			options.associatedObjectForCache
+		);
+		if (this.layer) ident = `(${this.layer})/${ident}`;
+		return ident;
+	}
+
+	/**
+	 * @returns {string | null} absolute path which should be used for condition matching (usually the resource path)
+	 */
+	nameForCondition() {
+		const resource = this.matchResource || this.resource;
+		const idx = resource.indexOf("?");
+		if (idx >= 0) return resource.substr(0, idx);
+		return resource;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 * @param {Module} module fresh module
+	 * @returns {void}
+	 */
+	updateCacheModule(module) {
+		super.updateCacheModule(module);
+		const m = /** @type {NormalModule} */ (module);
+		this.binary = m.binary;
+		this.request = m.request;
+		this.userRequest = m.userRequest;
+		this.rawRequest = m.rawRequest;
+		this.parser = m.parser;
+		this.parserOptions = m.parserOptions;
+		this.generator = m.generator;
+		this.generatorOptions = m.generatorOptions;
+		this.resource = m.resource;
+		this.resourceResolveData = m.resourceResolveData;
+		this.context = m.context;
+		this.matchResource = m.matchResource;
+		this.loaders = m.loaders;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Remove internal references to allow freeing some memory.
+	 */
+	cleanupForCache() {
+		// Make sure to cache types and sizes before cleanup when this module has been built
+		// They are accessed by the stats and we don't want them to crash after cleanup
+		// TODO reconsider this for webpack 6
+		if (this.buildInfo) {
+			if (this._sourceTypes === undefined) this.getSourceTypes();
+			for (const type of this._sourceTypes) {
+				this.size(type);
+			}
+		}
+		super.cleanupForCache();
+		this.parser = undefined;
+		this.parserOptions = undefined;
+		this.generator = undefined;
+		this.generatorOptions = undefined;
+	}
+
+	/**
+	 * Module should be unsafe cached. Get data that's needed for that.
+	 * This data will be passed to restoreFromUnsafeCache later.
+	 * @returns {object} cached data
+	 */
+	getUnsafeCacheData() {
+		const data = super.getUnsafeCacheData();
+		data.parserOptions = this.parserOptions;
+		data.generatorOptions = this.generatorOptions;
+		return data;
+	}
+
+	restoreFromUnsafeCache(unsafeCacheData, normalModuleFactory) {
+		this._restoreFromUnsafeCache(unsafeCacheData, normalModuleFactory);
+	}
+
+	/**
+	 * restore unsafe cache data
+	 * @param {object} unsafeCacheData data from getUnsafeCacheData
+	 * @param {NormalModuleFactory} normalModuleFactory the normal module factory handling the unsafe caching
+	 */
+	_restoreFromUnsafeCache(unsafeCacheData, normalModuleFactory) {
+		super._restoreFromUnsafeCache(unsafeCacheData, normalModuleFactory);
+		this.parserOptions = unsafeCacheData.parserOptions;
+		this.parser = normalModuleFactory.getParser(this.type, this.parserOptions);
+		this.generatorOptions = unsafeCacheData.generatorOptions;
+		this.generator = normalModuleFactory.getGenerator(
+			this.type,
+			this.generatorOptions
+		);
+		// we assume the generator behaves identically and keep cached sourceTypes/Sizes
+	}
+
+	/**
+	 * @param {string} context the compilation context
+	 * @param {string} name the asset name
+	 * @param {string} content the content
+	 * @param {string | TODO} sourceMap an optional source map
+	 * @param {Object=} associatedObjectForCache object for caching
+	 * @returns {Source} the created source
+	 */
+	createSourceForAsset(
+		context,
+		name,
+		content,
+		sourceMap,
+		associatedObjectForCache
+	) {
+		if (sourceMap) {
+			if (
+				typeof sourceMap === "string" &&
+				(this.useSourceMap || this.useSimpleSourceMap)
+			) {
+				return new OriginalSource(
+					content,
+					contextifySourceUrl(context, sourceMap, associatedObjectForCache)
+				);
+			}
+
+			if (this.useSourceMap) {
+				return new SourceMapSource(
+					content,
+					name,
+					contextifySourceMap(context, sourceMap, associatedObjectForCache)
+				);
+			}
+		}
+
+		return new RawSource(content);
+	}
+
+	/**
+	 * @param {ResolverWithOptions} resolver a resolver
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {InputFileSystem} fs file system from reading
+	 * @param {NormalModuleCompilationHooks} hooks the hooks
+	 * @returns {NormalModuleLoaderContext} loader context
+	 */
+	_createLoaderContext(resolver, options, compilation, fs, hooks) {
+		const { requestShortener } = compilation.runtimeTemplate;
+		const getCurrentLoaderName = () => {
+			const currentLoader = this.getCurrentLoader(loaderContext);
+			if (!currentLoader) return "(not in loader scope)";
+			return requestShortener.shorten(currentLoader.loader);
+		};
+		const getResolveContext = () => {
+			return {
+				fileDependencies: {
+					add: d => loaderContext.addDependency(d)
+				},
+				contextDependencies: {
+					add: d => loaderContext.addContextDependency(d)
+				},
+				missingDependencies: {
+					add: d => loaderContext.addMissingDependency(d)
+				}
+			};
+		};
+		const getAbsolutify = memoize(() =>
+			absolutify.bindCache(compilation.compiler.root)
+		);
+		const getAbsolutifyInContext = memoize(() =>
+			absolutify.bindContextCache(this.context, compilation.compiler.root)
+		);
+		const getContextify = memoize(() =>
+			contextify.bindCache(compilation.compiler.root)
+		);
+		const getContextifyInContext = memoize(() =>
+			contextify.bindContextCache(this.context, compilation.compiler.root)
+		);
+		const utils = {
+			absolutify: (context, request) => {
+				return context === this.context
+					? getAbsolutifyInContext()(request)
+					: getAbsolutify()(context, request);
+			},
+			contextify: (context, request) => {
+				return context === this.context
+					? getContextifyInContext()(request)
+					: getContextify()(context, request);
+			},
+			createHash: type => {
+				return createHash(type || compilation.outputOptions.hashFunction);
+			}
+		};
+		const loaderContext = {
+			version: 2,
+			getOptions: schema => {
+				const loader = this.getCurrentLoader(loaderContext);
+
+				let { options } = loader;
+
+				if (typeof options === "string") {
+					if (options.substr(0, 1) === "{" && options.substr(-1) === "}") {
+						try {
+							options = parseJson(options);
+						} catch (e) {
+							throw new Error(`Cannot parse string options: ${e.message}`);
+						}
+					} else {
+						options = querystring.parse(options, "&", "=", {
+							maxKeys: 0
+						});
+					}
+				}
+
+				if (options === null || options === undefined) {
+					options = {};
+				}
+
+				if (schema) {
+					let name = "Loader";
+					let baseDataPath = "options";
+					let match;
+					if (schema.title && (match = /^(.+) (.+)$/.exec(schema.title))) {
+						[, name, baseDataPath] = match;
+					}
+					getValidate()(schema, options, {
+						name,
+						baseDataPath
+					});
+				}
+
+				return options;
+			},
+			emitWarning: warning => {
+				if (!(warning instanceof Error)) {
+					warning = new NonErrorEmittedError(warning);
+				}
+				this.addWarning(
+					new ModuleWarning(warning, {
+						from: getCurrentLoaderName()
+					})
+				);
+			},
+			emitError: error => {
+				if (!(error instanceof Error)) {
+					error = new NonErrorEmittedError(error);
+				}
+				this.addError(
+					new ModuleError(error, {
+						from: getCurrentLoaderName()
+					})
+				);
+			},
+			getLogger: name => {
+				const currentLoader = this.getCurrentLoader(loaderContext);
+				return compilation.getLogger(() =>
+					[currentLoader && currentLoader.loader, name, this.identifier()]
+						.filter(Boolean)
+						.join("|")
+				);
+			},
+			resolve(context, request, callback) {
+				resolver.resolve({}, context, request, getResolveContext(), callback);
+			},
+			getResolve(options) {
+				const child = options ? resolver.withOptions(options) : resolver;
+				return (context, request, callback) => {
+					if (callback) {
+						child.resolve({}, context, request, getResolveContext(), callback);
+					} else {
+						return new Promise((resolve, reject) => {
+							child.resolve(
+								{},
+								context,
+								request,
+								getResolveContext(),
+								(err, result) => {
+									if (err) reject(err);
+									else resolve(result);
+								}
+							);
+						});
+					}
+				};
+			},
+			emitFile: (name, content, sourceMap, assetInfo) => {
+				if (!this.buildInfo.assets) {
+					this.buildInfo.assets = Object.create(null);
+					this.buildInfo.assetsInfo = new Map();
+				}
+				this.buildInfo.assets[name] = this.createSourceForAsset(
+					options.context,
+					name,
+					content,
+					sourceMap,
+					compilation.compiler.root
+				);
+				this.buildInfo.assetsInfo.set(name, assetInfo);
+			},
+			addBuildDependency: dep => {
+				if (this.buildInfo.buildDependencies === undefined) {
+					this.buildInfo.buildDependencies = new LazySet();
+				}
+				this.buildInfo.buildDependencies.add(dep);
+			},
+			utils,
+			rootContext: options.context,
+			webpack: true,
+			sourceMap: !!this.useSourceMap,
+			mode: options.mode || "production",
+			_module: this,
+			_compilation: compilation,
+			_compiler: compilation.compiler,
+			fs: fs
+		};
+
+		Object.assign(loaderContext, options.loader);
+
+		hooks.loader.call(loaderContext, this);
+
+		return loaderContext;
+	}
+
+	getCurrentLoader(loaderContext, index = loaderContext.loaderIndex) {
+		if (
+			this.loaders &&
+			this.loaders.length &&
+			index < this.loaders.length &&
+			index >= 0 &&
+			this.loaders[index]
+		) {
+			return this.loaders[index];
+		}
+		return null;
+	}
+
+	/**
+	 * @param {string} context the compilation context
+	 * @param {string | Buffer} content the content
+	 * @param {string | TODO} sourceMap an optional source map
+	 * @param {Object=} associatedObjectForCache object for caching
+	 * @returns {Source} the created source
+	 */
+	createSource(context, content, sourceMap, associatedObjectForCache) {
+		if (Buffer.isBuffer(content)) {
+			return new RawSource(content);
+		}
+
+		// if there is no identifier return raw source
+		if (!this.identifier) {
+			return new RawSource(content);
+		}
+
+		// from here on we assume we have an identifier
+		const identifier = this.identifier();
+
+		if (this.useSourceMap && sourceMap) {
+			return new SourceMapSource(
+				content,
+				contextifySourceUrl(context, identifier, associatedObjectForCache),
+				contextifySourceMap(context, sourceMap, associatedObjectForCache)
+			);
+		}
+
+		if (this.useSourceMap || this.useSimpleSourceMap) {
+			return new OriginalSource(
+				content,
+				contextifySourceUrl(context, identifier, associatedObjectForCache)
+			);
+		}
+
+		return new RawSource(content);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {NormalModuleCompilationHooks} hooks the hooks
+	 * @param {function((WebpackError | null)=): void} callback callback function
+	 * @returns {void}
+	 */
+	_doBuild(options, compilation, resolver, fs, hooks, callback) {
+		const loaderContext = this._createLoaderContext(
+			resolver,
+			options,
+			compilation,
+			fs,
+			hooks
+		);
+
+		const processResult = (err, result) => {
+			if (err) {
+				if (!(err instanceof Error)) {
+					err = new NonErrorEmittedError(err);
+				}
+				const currentLoader = this.getCurrentLoader(loaderContext);
+				const error = new ModuleBuildError(err, {
+					from:
+						currentLoader &&
+						compilation.runtimeTemplate.requestShortener.shorten(
+							currentLoader.loader
+						)
+				});
+				return callback(error);
+			}
+
+			const source = result[0];
+			const sourceMap = result.length >= 1 ? result[1] : null;
+			const extraInfo = result.length >= 2 ? result[2] : null;
+
+			if (!Buffer.isBuffer(source) && typeof source !== "string") {
+				const currentLoader = this.getCurrentLoader(loaderContext, 0);
+				const err = new Error(
+					`Final loader (${
+						currentLoader
+							? compilation.runtimeTemplate.requestShortener.shorten(
+									currentLoader.loader
+							  )
+							: "unknown"
+					}) didn't return a Buffer or String`
+				);
+				const error = new ModuleBuildError(err);
+				return callback(error);
+			}
+
+			this._source = this.createSource(
+				options.context,
+				this.binary ? asBuffer(source) : asString(source),
+				sourceMap,
+				compilation.compiler.root
+			);
+			if (this._sourceSizes !== undefined) this._sourceSizes.clear();
+			this._ast =
+				typeof extraInfo === "object" &&
+				extraInfo !== null &&
+				extraInfo.webpackAST !== undefined
+					? extraInfo.webpackAST
+					: null;
+			return callback();
+		};
+
+		this.buildInfo.fileDependencies = new LazySet();
+		this.buildInfo.contextDependencies = new LazySet();
+		this.buildInfo.missingDependencies = new LazySet();
+		this.buildInfo.cacheable = true;
+
+		try {
+			hooks.beforeLoaders.call(this.loaders, this, loaderContext);
+		} catch (err) {
+			processResult(err);
+			return;
+		}
+
+		if (this.loaders.length > 0) {
+			this.buildInfo.buildDependencies = new LazySet();
+		}
+
+		runLoaders(
+			{
+				resource: this.resource,
+				loaders: this.loaders,
+				context: loaderContext,
+				processResource: (loaderContext, resourcePath, callback) => {
+					const resource = loaderContext.resource;
+					const scheme = getScheme(resource);
+					hooks.readResource
+						.for(scheme)
+						.callAsync(loaderContext, (err, result) => {
+							if (err) return callback(err);
+							if (typeof result !== "string" && !result) {
+								return callback(new UnhandledSchemeError(scheme, resource));
+							}
+							return callback(null, result);
+						});
+				}
+			},
+			(err, result) => {
+				// Cleanup loaderContext to avoid leaking memory in ICs
+				loaderContext._compilation =
+					loaderContext._compiler =
+					loaderContext._module =
+					loaderContext.fs =
+						undefined;
+
+				if (!result) {
+					this.buildInfo.cacheable = false;
+					return processResult(
+						err || new Error("No result from loader-runner processing"),
+						null
+					);
+				}
+				this.buildInfo.fileDependencies.addAll(result.fileDependencies);
+				this.buildInfo.contextDependencies.addAll(result.contextDependencies);
+				this.buildInfo.missingDependencies.addAll(result.missingDependencies);
+				for (const loader of this.loaders) {
+					this.buildInfo.buildDependencies.add(loader.loader);
+				}
+				this.buildInfo.cacheable = this.buildInfo.cacheable && result.cacheable;
+				processResult(err, result.result);
+			}
+		);
+	}
+
+	/**
+	 * @param {WebpackError} error the error
+	 * @returns {void}
+	 */
+	markModuleAsErrored(error) {
+		// Restore build meta from successful build to keep importing state
+		this.buildMeta = { ...this._lastSuccessfulBuildMeta };
+		this.error = error;
+		this.addError(error);
+	}
+
+	applyNoParseRule(rule, content) {
+		// must start with "rule" if rule is a string
+		if (typeof rule === "string") {
+			return content.startsWith(rule);
+		}
+
+		if (typeof rule === "function") {
+			return rule(content);
+		}
+		// we assume rule is a regexp
+		return rule.test(content);
+	}
+
+	// check if module should not be parsed
+	// returns "true" if the module should !not! be parsed
+	// returns "false" if the module !must! be parsed
+	shouldPreventParsing(noParseRule, request) {
+		// if no noParseRule exists, return false
+		// the module !must! be parsed.
+		if (!noParseRule) {
+			return false;
+		}
+
+		// we only have one rule to check
+		if (!Array.isArray(noParseRule)) {
+			// returns "true" if the module is !not! to be parsed
+			return this.applyNoParseRule(noParseRule, request);
+		}
+
+		for (let i = 0; i < noParseRule.length; i++) {
+			const rule = noParseRule[i];
+			// early exit on first truthy match
+			// this module is !not! to be parsed
+			if (this.applyNoParseRule(rule, request)) {
+				return true;
+			}
+		}
+		// no match found, so this module !should! be parsed
+		return false;
+	}
+
+	_initBuildHash(compilation) {
+		const hash = createHash(compilation.outputOptions.hashFunction);
+		if (this._source) {
+			hash.update("source");
+			this._source.updateHash(hash);
+		}
+		hash.update("meta");
+		hash.update(JSON.stringify(this.buildMeta));
+		this.buildInfo.hash = /** @type {string} */ (hash.digest("hex"));
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this._forceBuild = false;
+		this._source = null;
+		if (this._sourceSizes !== undefined) this._sourceSizes.clear();
+		this._sourceTypes = undefined;
+		this._ast = null;
+		this.error = null;
+		this.clearWarningsAndErrors();
+		this.clearDependenciesAndBlocks();
+		this.buildMeta = {};
+		this.buildInfo = {
+			cacheable: false,
+			parsed: true,
+			fileDependencies: undefined,
+			contextDependencies: undefined,
+			missingDependencies: undefined,
+			buildDependencies: undefined,
+			valueDependencies: undefined,
+			hash: undefined,
+			assets: undefined,
+			assetsInfo: undefined
+		};
+
+		const startTime = compilation.compiler.fsStartTime || Date.now();
+
+		const hooks = NormalModule.getCompilationHooks(compilation);
+
+		return this._doBuild(options, compilation, resolver, fs, hooks, err => {
+			// if we have an error mark module as failed and exit
+			if (err) {
+				this.markModuleAsErrored(err);
+				this._initBuildHash(compilation);
+				return callback();
+			}
+
+			const handleParseError = e => {
+				const source = this._source.source();
+				const loaders = this.loaders.map(item =>
+					contextify(options.context, item.loader, compilation.compiler.root)
+				);
+				const error = new ModuleParseError(source, e, loaders, this.type);
+				this.markModuleAsErrored(error);
+				this._initBuildHash(compilation);
+				return callback();
+			};
+
+			const handleParseResult = result => {
+				this.dependencies.sort(
+					concatComparators(
+						compareSelect(a => a.loc, compareLocations),
+						keepOriginalOrder(this.dependencies)
+					)
+				);
+				this._initBuildHash(compilation);
+				this._lastSuccessfulBuildMeta = this.buildMeta;
+				return handleBuildDone();
+			};
+
+			const handleBuildDone = () => {
+				try {
+					hooks.beforeSnapshot.call(this);
+				} catch (err) {
+					this.markModuleAsErrored(err);
+					return callback();
+				}
+
+				const snapshotOptions = compilation.options.snapshot.module;
+				if (!this.buildInfo.cacheable || !snapshotOptions) {
+					return callback();
+				}
+				// add warning for all non-absolute paths in fileDependencies, etc
+				// This makes it easier to find problems with watching and/or caching
+				let nonAbsoluteDependencies = undefined;
+				const checkDependencies = deps => {
+					for (const dep of deps) {
+						if (!ABSOLUTE_PATH_REGEX.test(dep)) {
+							if (nonAbsoluteDependencies === undefined)
+								nonAbsoluteDependencies = new Set();
+							nonAbsoluteDependencies.add(dep);
+							deps.delete(dep);
+							try {
+								const depWithoutGlob = dep.replace(/[\\/]?\*.*$/, "");
+								const absolute = join(
+									compilation.fileSystemInfo.fs,
+									this.context,
+									depWithoutGlob
+								);
+								if (absolute !== dep && ABSOLUTE_PATH_REGEX.test(absolute)) {
+									(depWithoutGlob !== dep
+										? this.buildInfo.contextDependencies
+										: deps
+									).add(absolute);
+								}
+							} catch (e) {
+								// ignore
+							}
+						}
+					}
+				};
+				checkDependencies(this.buildInfo.fileDependencies);
+				checkDependencies(this.buildInfo.missingDependencies);
+				checkDependencies(this.buildInfo.contextDependencies);
+				if (nonAbsoluteDependencies !== undefined) {
+					const InvalidDependenciesModuleWarning =
+						getInvalidDependenciesModuleWarning();
+					this.addWarning(
+						new InvalidDependenciesModuleWarning(this, nonAbsoluteDependencies)
+					);
+				}
+				// convert file/context/missingDependencies into filesystem snapshot
+				compilation.fileSystemInfo.createSnapshot(
+					startTime,
+					this.buildInfo.fileDependencies,
+					this.buildInfo.contextDependencies,
+					this.buildInfo.missingDependencies,
+					snapshotOptions,
+					(err, snapshot) => {
+						if (err) {
+							this.markModuleAsErrored(err);
+							return;
+						}
+						this.buildInfo.fileDependencies = undefined;
+						this.buildInfo.contextDependencies = undefined;
+						this.buildInfo.missingDependencies = undefined;
+						this.buildInfo.snapshot = snapshot;
+						return callback();
+					}
+				);
+			};
+
+			try {
+				hooks.beforeParse.call(this);
+			} catch (err) {
+				this.markModuleAsErrored(err);
+				this._initBuildHash(compilation);
+				return callback();
+			}
+
+			// check if this module should !not! be parsed.
+			// if so, exit here;
+			const noParseRule = options.module && options.module.noParse;
+			if (this.shouldPreventParsing(noParseRule, this.request)) {
+				// We assume that we need module and exports
+				this.buildInfo.parsed = false;
+				this._initBuildHash(compilation);
+				return handleBuildDone();
+			}
+
+			let result;
+			try {
+				const source = this._source.source();
+				result = this.parser.parse(this._ast || source, {
+					source,
+					current: this,
+					module: this,
+					compilation: compilation,
+					options: options
+				});
+			} catch (e) {
+				handleParseError(e);
+				return;
+			}
+			handleParseResult(result);
+		});
+	}
+
+	/**
+	 * @param {ConcatenationBailoutReasonContext} context context
+	 * @returns {string | undefined} reason why this module can't be concatenated, undefined when it can be concatenated
+	 */
+	getConcatenationBailoutReason(context) {
+		return this.generator.getConcatenationBailoutReason(this, context);
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this module should be connected to referencing modules when consumed for side-effects only
+	 */
+	getSideEffectsConnectionState(moduleGraph) {
+		if (this.factoryMeta !== undefined) {
+			if (this.factoryMeta.sideEffectFree) return false;
+			if (this.factoryMeta.sideEffectFree === false) return true;
+		}
+		if (this.buildMeta !== undefined && this.buildMeta.sideEffectFree) {
+			if (this._isEvaluatingSideEffects)
+				return ModuleGraphConnection.CIRCULAR_CONNECTION;
+			this._isEvaluatingSideEffects = true;
+			/** @type {ConnectionState} */
+			let current = false;
+			for (const dep of this.dependencies) {
+				const state = dep.getModuleEvaluationSideEffectsState(moduleGraph);
+				if (state === true) {
+					if (
+						this._addedSideEffectsBailout === undefined
+							? ((this._addedSideEffectsBailout = new WeakSet()), true)
+							: !this._addedSideEffectsBailout.has(moduleGraph)
+					) {
+						this._addedSideEffectsBailout.add(moduleGraph);
+						moduleGraph
+							.getOptimizationBailout(this)
+							.push(
+								() =>
+									`Dependency (${
+										dep.type
+									}) with side effects at ${formatLocation(dep.loc)}`
+							);
+					}
+					this._isEvaluatingSideEffects = false;
+					return true;
+				} else if (state !== ModuleGraphConnection.CIRCULAR_CONNECTION) {
+					current = ModuleGraphConnection.addConnectionStates(current, state);
+				}
+			}
+			this._isEvaluatingSideEffects = false;
+			// When caching is implemented here, make sure to not cache when
+			// at least one circular connection was in the loop above
+			return current;
+		} else {
+			return true;
+		}
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		if (this._sourceTypes === undefined) {
+			this._sourceTypes = this.generator.getTypes(this);
+		}
+		return this._sourceTypes;
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({
+		dependencyTemplates,
+		runtimeTemplate,
+		moduleGraph,
+		chunkGraph,
+		runtime,
+		concatenationScope,
+		codeGenerationResults
+	}) {
+		/** @type {Set<string>} */
+		const runtimeRequirements = new Set();
+
+		if (!this.buildInfo.parsed) {
+			runtimeRequirements.add(RuntimeGlobals.module);
+			runtimeRequirements.add(RuntimeGlobals.exports);
+			runtimeRequirements.add(RuntimeGlobals.thisAsExports);
+		}
+
+		/** @type {Map<string, any>} */
+		let data;
+		const getData = () => {
+			if (data === undefined) data = new Map();
+			return data;
+		};
+
+		const sources = new Map();
+		for (const type of this.generator.getTypes(this)) {
+			const source = this.error
+				? new RawSource(
+						"throw new Error(" + JSON.stringify(this.error.message) + ");"
+				  )
+				: this.generator.generate(this, {
+						dependencyTemplates,
+						runtimeTemplate,
+						moduleGraph,
+						chunkGraph,
+						runtimeRequirements,
+						runtime,
+						concatenationScope,
+						codeGenerationResults,
+						getData,
+						type
+				  });
+
+			if (source) {
+				sources.set(type, new CachedSource(source));
+			}
+		}
+
+		/** @type {CodeGenerationResult} */
+		const resultEntry = {
+			sources,
+			runtimeRequirements,
+			data
+		};
+		return resultEntry;
+	}
+
+	/**
+	 * @returns {Source | null} the original source for the module before webpack transformation
+	 */
+	originalSource() {
+		return this._source;
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	invalidateBuild() {
+		this._forceBuild = true;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		const { fileSystemInfo, compilation, valueCacheVersions } = context;
+		// build if enforced
+		if (this._forceBuild) return callback(null, true);
+
+		// always try to build in case of an error
+		if (this.error) return callback(null, true);
+
+		// always build when module is not cacheable
+		if (!this.buildInfo.cacheable) return callback(null, true);
+
+		// build when there is no snapshot to check
+		if (!this.buildInfo.snapshot) return callback(null, true);
+
+		// build when valueDependencies have changed
+		/** @type {Map<string, string | Set<string>>} */
+		const valueDependencies = this.buildInfo.valueDependencies;
+		if (valueDependencies) {
+			if (!valueCacheVersions) return callback(null, true);
+			for (const [key, value] of valueDependencies) {
+				if (value === undefined) return callback(null, true);
+				const current = valueCacheVersions.get(key);
+				if (
+					value !== current &&
+					(typeof value === "string" ||
+						typeof current === "string" ||
+						current === undefined ||
+						!isSubset(value, current))
+				) {
+					return callback(null, true);
+				}
+			}
+		}
+
+		// check snapshot for validity
+		fileSystemInfo.checkSnapshotValid(this.buildInfo.snapshot, (err, valid) => {
+			if (err) return callback(err);
+			if (!valid) return callback(null, true);
+			const hooks = NormalModule.getCompilationHooks(compilation);
+			hooks.needBuild.callAsync(this, context, (err, needBuild) => {
+				if (err) {
+					return callback(
+						HookWebpackError.makeWebpackError(
+							err,
+							"NormalModule.getCompilationHooks().needBuild"
+						)
+					);
+				}
+				callback(null, !!needBuild);
+			});
+		});
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		const cachedSize =
+			this._sourceSizes === undefined ? undefined : this._sourceSizes.get(type);
+		if (cachedSize !== undefined) {
+			return cachedSize;
+		}
+		const size = Math.max(1, this.generator.getSize(this, type));
+		if (this._sourceSizes === undefined) {
+			this._sourceSizes = new Map();
+		}
+		this._sourceSizes.set(type, size);
+		return size;
+	}
+
+	/**
+	 * @param {LazySet<string>} fileDependencies set where file dependencies are added to
+	 * @param {LazySet<string>} contextDependencies set where context dependencies are added to
+	 * @param {LazySet<string>} missingDependencies set where missing dependencies are added to
+	 * @param {LazySet<string>} buildDependencies set where build dependencies are added to
+	 */
+	addCacheDependencies(
+		fileDependencies,
+		contextDependencies,
+		missingDependencies,
+		buildDependencies
+	) {
+		const { snapshot, buildDependencies: buildDeps } = this.buildInfo;
+		if (snapshot) {
+			fileDependencies.addAll(snapshot.getFileIterable());
+			contextDependencies.addAll(snapshot.getContextIterable());
+			missingDependencies.addAll(snapshot.getMissingIterable());
+		} else {
+			const {
+				fileDependencies: fileDeps,
+				contextDependencies: contextDeps,
+				missingDependencies: missingDeps
+			} = this.buildInfo;
+			if (fileDeps !== undefined) fileDependencies.addAll(fileDeps);
+			if (contextDeps !== undefined) contextDependencies.addAll(contextDeps);
+			if (missingDeps !== undefined) missingDependencies.addAll(missingDeps);
+		}
+		if (buildDeps !== undefined) {
+			buildDependencies.addAll(buildDeps);
+		}
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		hash.update(this.buildInfo.hash);
+		this.generator.updateHash(hash, {
+			module: this,
+			...context
+		});
+		super.updateHash(hash, context);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		// deserialize
+		write(this._source);
+		write(this.error);
+		write(this._lastSuccessfulBuildMeta);
+		write(this._forceBuild);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const obj = new NormalModule({
+			// will be deserialized by Module
+			layer: null,
+			type: "",
+			// will be filled by updateCacheModule
+			resource: "",
+			context: "",
+			request: null,
+			userRequest: null,
+			rawRequest: null,
+			loaders: null,
+			matchResource: null,
+			parser: null,
+			parserOptions: null,
+			generator: null,
+			generatorOptions: null,
+			resolveOptions: null
+		});
+		obj.deserialize(context);
+		return obj;
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this._source = read();
+		this.error = read();
+		this._lastSuccessfulBuildMeta = read();
+		this._forceBuild = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(NormalModule, "webpack/lib/NormalModule");
+
+module.exports = NormalModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModuleFactory.js
new file mode 100644
index 0000000..a6895d7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModuleFactory.js
@@ -0,0 +1,1118 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { getContext } = require("loader-runner");
+const asyncLib = require("neo-async");
+const {
+	AsyncSeriesBailHook,
+	SyncWaterfallHook,
+	SyncBailHook,
+	SyncHook,
+	HookMap
+} = require("tapable");
+const ChunkGraph = require("./ChunkGraph");
+const Module = require("./Module");
+const ModuleFactory = require("./ModuleFactory");
+const ModuleGraph = require("./ModuleGraph");
+const NormalModule = require("./NormalModule");
+const BasicEffectRulePlugin = require("./rules/BasicEffectRulePlugin");
+const BasicMatcherRulePlugin = require("./rules/BasicMatcherRulePlugin");
+const ObjectMatcherRulePlugin = require("./rules/ObjectMatcherRulePlugin");
+const RuleSetCompiler = require("./rules/RuleSetCompiler");
+const UseEffectRulePlugin = require("./rules/UseEffectRulePlugin");
+const LazySet = require("./util/LazySet");
+const { getScheme } = require("./util/URLAbsoluteSpecifier");
+const { cachedCleverMerge, cachedSetProperty } = require("./util/cleverMerge");
+const { join } = require("./util/fs");
+const {
+	parseResource,
+	parseResourceWithoutFragment
+} = require("./util/identifier");
+
+/** @typedef {import("../declarations/WebpackOptions").ModuleOptionsNormalized} ModuleOptions */
+/** @typedef {import("../declarations/WebpackOptions").RuleSetRule} RuleSetRule */
+/** @typedef {import("./Generator")} Generator */
+/** @typedef {import("./ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("./ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./NormalModule").NormalModuleCreateData} NormalModuleCreateData */
+/** @typedef {import("./Parser")} Parser */
+/** @typedef {import("./ResolverFactory")} ResolverFactory */
+/** @typedef {import("./dependencies/ModuleDependency")} ModuleDependency */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+/** @typedef {Pick<RuleSetRule, 'type'|'sideEffects'|'parser'|'generator'|'resolve'|'layer'>} ModuleSettings */
+/** @typedef {Partial<NormalModuleCreateData & {settings: ModuleSettings}>} CreateData */
+
+/**
+ * @typedef {Object} ResolveData
+ * @property {ModuleFactoryCreateData["contextInfo"]} contextInfo
+ * @property {ModuleFactoryCreateData["resolveOptions"]} resolveOptions
+ * @property {string} context
+ * @property {string} request
+ * @property {Record<string, any> | undefined} assertions
+ * @property {ModuleDependency[]} dependencies
+ * @property {string} dependencyType
+ * @property {CreateData} createData
+ * @property {LazySet<string>} fileDependencies
+ * @property {LazySet<string>} missingDependencies
+ * @property {LazySet<string>} contextDependencies
+ * @property {boolean} cacheable allow to use the unsafe cache
+ */
+
+/**
+ * @typedef {Object} ResourceData
+ * @property {string} resource
+ * @property {string} path
+ * @property {string} query
+ * @property {string} fragment
+ * @property {string=} context
+ */
+
+/** @typedef {ResourceData & { data: Record<string, any> }} ResourceDataWithData */
+
+/** @typedef {Object} ParsedLoaderRequest
+ * @property {string} loader loader
+ * @property {string|undefined} options options
+ */
+
+const EMPTY_RESOLVE_OPTIONS = {};
+const EMPTY_PARSER_OPTIONS = {};
+const EMPTY_GENERATOR_OPTIONS = {};
+const EMPTY_ELEMENTS = [];
+
+const MATCH_RESOURCE_REGEX = /^([^!]+)!=!/;
+
+const loaderToIdent = data => {
+	if (!data.options) {
+		return data.loader;
+	}
+	if (typeof data.options === "string") {
+		return data.loader + "?" + data.options;
+	}
+	if (typeof data.options !== "object") {
+		throw new Error("loader options must be string or object");
+	}
+	if (data.ident) {
+		return data.loader + "??" + data.ident;
+	}
+	return data.loader + "?" + JSON.stringify(data.options);
+};
+
+const stringifyLoadersAndResource = (loaders, resource) => {
+	let str = "";
+	for (const loader of loaders) {
+		str += loaderToIdent(loader) + "!";
+	}
+	return str + resource;
+};
+
+const needCalls = (times, callback) => {
+	return err => {
+		if (--times === 0) {
+			return callback(err);
+		}
+		if (err && times > 0) {
+			times = NaN;
+			return callback(err);
+		}
+	};
+};
+
+const mergeGlobalOptions = (globalOptions, type, localOptions) => {
+	const parts = type.split("/");
+	let result;
+	let current = "";
+	for (const part of parts) {
+		current = current ? `${current}/${part}` : part;
+		const options = globalOptions[current];
+		if (typeof options === "object") {
+			if (result === undefined) {
+				result = options;
+			} else {
+				result = cachedCleverMerge(result, options);
+			}
+		}
+	}
+	if (result === undefined) {
+		return localOptions;
+	} else {
+		return cachedCleverMerge(result, localOptions);
+	}
+};
+
+// TODO webpack 6 remove
+const deprecationChangedHookMessage = (name, hook) => {
+	const names = hook.taps
+		.map(tapped => {
+			return tapped.name;
+		})
+		.join(", ");
+
+	return (
+		`NormalModuleFactory.${name} (${names}) is no longer a waterfall hook, but a bailing hook instead. ` +
+		"Do not return the passed object, but modify it instead. " +
+		"Returning false will ignore the request and results in no module created."
+	);
+};
+
+const ruleSetCompiler = new RuleSetCompiler([
+	new BasicMatcherRulePlugin("test", "resource"),
+	new BasicMatcherRulePlugin("scheme"),
+	new BasicMatcherRulePlugin("mimetype"),
+	new BasicMatcherRulePlugin("dependency"),
+	new BasicMatcherRulePlugin("include", "resource"),
+	new BasicMatcherRulePlugin("exclude", "resource", true),
+	new BasicMatcherRulePlugin("resource"),
+	new BasicMatcherRulePlugin("resourceQuery"),
+	new BasicMatcherRulePlugin("resourceFragment"),
+	new BasicMatcherRulePlugin("realResource"),
+	new BasicMatcherRulePlugin("issuer"),
+	new BasicMatcherRulePlugin("compiler"),
+	new BasicMatcherRulePlugin("issuerLayer"),
+	new ObjectMatcherRulePlugin("assert", "assertions"),
+	new ObjectMatcherRulePlugin("descriptionData"),
+	new BasicEffectRulePlugin("type"),
+	new BasicEffectRulePlugin("sideEffects"),
+	new BasicEffectRulePlugin("parser"),
+	new BasicEffectRulePlugin("resolve"),
+	new BasicEffectRulePlugin("generator"),
+	new BasicEffectRulePlugin("layer"),
+	new UseEffectRulePlugin()
+]);
+
+class NormalModuleFactory extends ModuleFactory {
+	/**
+	 * @param {Object} param params
+	 * @param {string=} param.context context
+	 * @param {InputFileSystem} param.fs file system
+	 * @param {ResolverFactory} param.resolverFactory resolverFactory
+	 * @param {ModuleOptions} param.options options
+	 * @param {Object=} param.associatedObjectForCache an object to which the cache will be attached
+	 * @param {boolean=} param.layers enable layers
+	 */
+	constructor({
+		context,
+		fs,
+		resolverFactory,
+		options,
+		associatedObjectForCache,
+		layers = false
+	}) {
+		super();
+		this.hooks = Object.freeze({
+			/** @type {AsyncSeriesBailHook<[ResolveData], Module | false | void>} */
+			resolve: new AsyncSeriesBailHook(["resolveData"]),
+			/** @type {HookMap<AsyncSeriesBailHook<[ResourceDataWithData, ResolveData], true | void>>} */
+			resolveForScheme: new HookMap(
+				() => new AsyncSeriesBailHook(["resourceData", "resolveData"])
+			),
+			/** @type {HookMap<AsyncSeriesBailHook<[ResourceDataWithData, ResolveData], true | void>>} */
+			resolveInScheme: new HookMap(
+				() => new AsyncSeriesBailHook(["resourceData", "resolveData"])
+			),
+			/** @type {AsyncSeriesBailHook<[ResolveData], Module>} */
+			factorize: new AsyncSeriesBailHook(["resolveData"]),
+			/** @type {AsyncSeriesBailHook<[ResolveData], false | void>} */
+			beforeResolve: new AsyncSeriesBailHook(["resolveData"]),
+			/** @type {AsyncSeriesBailHook<[ResolveData], false | void>} */
+			afterResolve: new AsyncSeriesBailHook(["resolveData"]),
+			/** @type {AsyncSeriesBailHook<[ResolveData["createData"], ResolveData], Module | void>} */
+			createModule: new AsyncSeriesBailHook(["createData", "resolveData"]),
+			/** @type {SyncWaterfallHook<[Module, ResolveData["createData"], ResolveData], Module>} */
+			module: new SyncWaterfallHook(["module", "createData", "resolveData"]),
+			createParser: new HookMap(() => new SyncBailHook(["parserOptions"])),
+			parser: new HookMap(() => new SyncHook(["parser", "parserOptions"])),
+			createGenerator: new HookMap(
+				() => new SyncBailHook(["generatorOptions"])
+			),
+			generator: new HookMap(
+				() => new SyncHook(["generator", "generatorOptions"])
+			)
+		});
+		this.resolverFactory = resolverFactory;
+		this.ruleSet = ruleSetCompiler.compile([
+			{
+				rules: options.defaultRules
+			},
+			{
+				rules: options.rules
+			}
+		]);
+		this.context = context || "";
+		this.fs = fs;
+		this._globalParserOptions = options.parser;
+		this._globalGeneratorOptions = options.generator;
+		/** @type {Map<string, WeakMap<Object, TODO>>} */
+		this.parserCache = new Map();
+		/** @type {Map<string, WeakMap<Object, Generator>>} */
+		this.generatorCache = new Map();
+		/** @type {Set<Module>} */
+		this._restoredUnsafeCacheEntries = new Set();
+
+		const cacheParseResource = parseResource.bindCache(
+			associatedObjectForCache
+		);
+		const cachedParseResourceWithoutFragment =
+			parseResourceWithoutFragment.bindCache(associatedObjectForCache);
+		this._parseResourceWithoutFragment = cachedParseResourceWithoutFragment;
+
+		this.hooks.factorize.tapAsync(
+			{
+				name: "NormalModuleFactory",
+				stage: 100
+			},
+			(resolveData, callback) => {
+				this.hooks.resolve.callAsync(resolveData, (err, result) => {
+					if (err) return callback(err);
+
+					// Ignored
+					if (result === false) return callback();
+
+					// direct module
+					if (result instanceof Module) return callback(null, result);
+
+					if (typeof result === "object")
+						throw new Error(
+							deprecationChangedHookMessage("resolve", this.hooks.resolve) +
+								" Returning a Module object will result in this module used as result."
+						);
+
+					this.hooks.afterResolve.callAsync(resolveData, (err, result) => {
+						if (err) return callback(err);
+
+						if (typeof result === "object")
+							throw new Error(
+								deprecationChangedHookMessage(
+									"afterResolve",
+									this.hooks.afterResolve
+								)
+							);
+
+						// Ignored
+						if (result === false) return callback();
+
+						const createData = resolveData.createData;
+
+						this.hooks.createModule.callAsync(
+							createData,
+							resolveData,
+							(err, createdModule) => {
+								if (!createdModule) {
+									if (!resolveData.request) {
+										return callback(new Error("Empty dependency (no request)"));
+									}
+
+									createdModule = new NormalModule(
+										/** @type {NormalModuleCreateData} */ (createData)
+									);
+								}
+
+								createdModule = this.hooks.module.call(
+									createdModule,
+									createData,
+									resolveData
+								);
+
+								return callback(null, createdModule);
+							}
+						);
+					});
+				});
+			}
+		);
+		this.hooks.resolve.tapAsync(
+			{
+				name: "NormalModuleFactory",
+				stage: 100
+			},
+			(data, callback) => {
+				const {
+					contextInfo,
+					context,
+					dependencies,
+					dependencyType,
+					request,
+					assertions,
+					resolveOptions,
+					fileDependencies,
+					missingDependencies,
+					contextDependencies
+				} = data;
+				const loaderResolver = this.getResolver("loader");
+
+				/** @type {ResourceData | undefined} */
+				let matchResourceData = undefined;
+				/** @type {string} */
+				let unresolvedResource;
+				/** @type {ParsedLoaderRequest[]} */
+				let elements;
+				let noPreAutoLoaders = false;
+				let noAutoLoaders = false;
+				let noPrePostAutoLoaders = false;
+
+				const contextScheme = getScheme(context);
+				/** @type {string | undefined} */
+				let scheme = getScheme(request);
+
+				if (!scheme) {
+					/** @type {string} */
+					let requestWithoutMatchResource = request;
+					const matchResourceMatch = MATCH_RESOURCE_REGEX.exec(request);
+					if (matchResourceMatch) {
+						let matchResource = matchResourceMatch[1];
+						if (matchResource.charCodeAt(0) === 46) {
+							// 46 === ".", 47 === "/"
+							const secondChar = matchResource.charCodeAt(1);
+							if (
+								secondChar === 47 ||
+								(secondChar === 46 && matchResource.charCodeAt(2) === 47)
+							) {
+								// if matchResources startsWith ../ or ./
+								matchResource = join(this.fs, context, matchResource);
+							}
+						}
+						matchResourceData = {
+							resource: matchResource,
+							...cacheParseResource(matchResource)
+						};
+						requestWithoutMatchResource = request.substr(
+							matchResourceMatch[0].length
+						);
+					}
+
+					scheme = getScheme(requestWithoutMatchResource);
+
+					if (!scheme && !contextScheme) {
+						const firstChar = requestWithoutMatchResource.charCodeAt(0);
+						const secondChar = requestWithoutMatchResource.charCodeAt(1);
+						noPreAutoLoaders = firstChar === 45 && secondChar === 33; // startsWith "-!"
+						noAutoLoaders = noPreAutoLoaders || firstChar === 33; // startsWith "!"
+						noPrePostAutoLoaders = firstChar === 33 && secondChar === 33; // startsWith "!!";
+						const rawElements = requestWithoutMatchResource
+							.slice(
+								noPreAutoLoaders || noPrePostAutoLoaders
+									? 2
+									: noAutoLoaders
+									? 1
+									: 0
+							)
+							.split(/!+/);
+						unresolvedResource = rawElements.pop();
+						elements = rawElements.map(el => {
+							const { path, query } = cachedParseResourceWithoutFragment(el);
+							return {
+								loader: path,
+								options: query ? query.slice(1) : undefined
+							};
+						});
+						scheme = getScheme(unresolvedResource);
+					} else {
+						unresolvedResource = requestWithoutMatchResource;
+						elements = EMPTY_ELEMENTS;
+					}
+				} else {
+					unresolvedResource = request;
+					elements = EMPTY_ELEMENTS;
+				}
+
+				const resolveContext = {
+					fileDependencies,
+					missingDependencies,
+					contextDependencies
+				};
+
+				/** @type {ResourceDataWithData} */
+				let resourceData;
+
+				let loaders;
+
+				const continueCallback = needCalls(2, err => {
+					if (err) return callback(err);
+
+					// translate option idents
+					try {
+						for (const item of loaders) {
+							if (typeof item.options === "string" && item.options[0] === "?") {
+								const ident = item.options.substr(1);
+								if (ident === "[[missing ident]]") {
+									throw new Error(
+										"No ident is provided by referenced loader. " +
+											"When using a function for Rule.use in config you need to " +
+											"provide an 'ident' property for referenced loader options."
+									);
+								}
+								item.options = this.ruleSet.references.get(ident);
+								if (item.options === undefined) {
+									throw new Error(
+										"Invalid ident is provided by referenced loader"
+									);
+								}
+								item.ident = ident;
+							}
+						}
+					} catch (e) {
+						return callback(e);
+					}
+
+					if (!resourceData) {
+						// ignored
+						return callback(null, dependencies[0].createIgnoredModule(context));
+					}
+
+					const userRequest =
+						(matchResourceData !== undefined
+							? `${matchResourceData.resource}!=!`
+							: "") +
+						stringifyLoadersAndResource(loaders, resourceData.resource);
+
+					const settings = {};
+					const useLoadersPost = [];
+					const useLoaders = [];
+					const useLoadersPre = [];
+
+					// handle .webpack[] suffix
+					let resource;
+					let match;
+					if (
+						matchResourceData &&
+						typeof (resource = matchResourceData.resource) === "string" &&
+						(match = /\.webpack\[([^\]]+)\]$/.exec(resource))
+					) {
+						settings.type = match[1];
+						matchResourceData.resource = matchResourceData.resource.slice(
+							0,
+							-settings.type.length - 10
+						);
+					} else {
+						settings.type = "javascript/auto";
+						const resourceDataForRules = matchResourceData || resourceData;
+						const result = this.ruleSet.exec({
+							resource: resourceDataForRules.path,
+							realResource: resourceData.path,
+							resourceQuery: resourceDataForRules.query,
+							resourceFragment: resourceDataForRules.fragment,
+							scheme,
+							assertions,
+							mimetype: matchResourceData
+								? ""
+								: resourceData.data.mimetype || "",
+							dependency: dependencyType,
+							descriptionData: matchResourceData
+								? undefined
+								: resourceData.data.descriptionFileData,
+							issuer: contextInfo.issuer,
+							compiler: contextInfo.compiler,
+							issuerLayer: contextInfo.issuerLayer || ""
+						});
+						for (const r of result) {
+							if (r.type === "use") {
+								if (!noAutoLoaders && !noPrePostAutoLoaders) {
+									useLoaders.push(r.value);
+								}
+							} else if (r.type === "use-post") {
+								if (!noPrePostAutoLoaders) {
+									useLoadersPost.push(r.value);
+								}
+							} else if (r.type === "use-pre") {
+								if (!noPreAutoLoaders && !noPrePostAutoLoaders) {
+									useLoadersPre.push(r.value);
+								}
+							} else if (
+								typeof r.value === "object" &&
+								r.value !== null &&
+								typeof settings[r.type] === "object" &&
+								settings[r.type] !== null
+							) {
+								settings[r.type] = cachedCleverMerge(settings[r.type], r.value);
+							} else {
+								settings[r.type] = r.value;
+							}
+						}
+					}
+
+					let postLoaders, normalLoaders, preLoaders;
+
+					const continueCallback = needCalls(3, err => {
+						if (err) {
+							return callback(err);
+						}
+						const allLoaders = postLoaders;
+						if (matchResourceData === undefined) {
+							for (const loader of loaders) allLoaders.push(loader);
+							for (const loader of normalLoaders) allLoaders.push(loader);
+						} else {
+							for (const loader of normalLoaders) allLoaders.push(loader);
+							for (const loader of loaders) allLoaders.push(loader);
+						}
+						for (const loader of preLoaders) allLoaders.push(loader);
+						let type = settings.type;
+						const resolveOptions = settings.resolve;
+						const layer = settings.layer;
+						if (layer !== undefined && !layers) {
+							return callback(
+								new Error(
+									"'Rule.layer' is only allowed when 'experiments.layers' is enabled"
+								)
+							);
+						}
+						try {
+							Object.assign(data.createData, {
+								layer:
+									layer === undefined ? contextInfo.issuerLayer || null : layer,
+								request: stringifyLoadersAndResource(
+									allLoaders,
+									resourceData.resource
+								),
+								userRequest,
+								rawRequest: request,
+								loaders: allLoaders,
+								resource: resourceData.resource,
+								context:
+									resourceData.context || getContext(resourceData.resource),
+								matchResource: matchResourceData
+									? matchResourceData.resource
+									: undefined,
+								resourceResolveData: resourceData.data,
+								settings,
+								type,
+								parser: this.getParser(type, settings.parser),
+								parserOptions: settings.parser,
+								generator: this.getGenerator(type, settings.generator),
+								generatorOptions: settings.generator,
+								resolveOptions
+							});
+						} catch (e) {
+							return callback(e);
+						}
+						callback();
+					});
+					this.resolveRequestArray(
+						contextInfo,
+						this.context,
+						useLoadersPost,
+						loaderResolver,
+						resolveContext,
+						(err, result) => {
+							postLoaders = result;
+							continueCallback(err);
+						}
+					);
+					this.resolveRequestArray(
+						contextInfo,
+						this.context,
+						useLoaders,
+						loaderResolver,
+						resolveContext,
+						(err, result) => {
+							normalLoaders = result;
+							continueCallback(err);
+						}
+					);
+					this.resolveRequestArray(
+						contextInfo,
+						this.context,
+						useLoadersPre,
+						loaderResolver,
+						resolveContext,
+						(err, result) => {
+							preLoaders = result;
+							continueCallback(err);
+						}
+					);
+				});
+
+				this.resolveRequestArray(
+					contextInfo,
+					contextScheme ? this.context : context,
+					elements,
+					loaderResolver,
+					resolveContext,
+					(err, result) => {
+						if (err) return continueCallback(err);
+						loaders = result;
+						continueCallback();
+					}
+				);
+
+				const defaultResolve = context => {
+					if (/^($|\?)/.test(unresolvedResource)) {
+						resourceData = {
+							resource: unresolvedResource,
+							data: {},
+							...cacheParseResource(unresolvedResource)
+						};
+						continueCallback();
+					}
+
+					// resource without scheme and with path
+					else {
+						const normalResolver = this.getResolver(
+							"normal",
+							dependencyType
+								? cachedSetProperty(
+										resolveOptions || EMPTY_RESOLVE_OPTIONS,
+										"dependencyType",
+										dependencyType
+								  )
+								: resolveOptions
+						);
+						this.resolveResource(
+							contextInfo,
+							context,
+							unresolvedResource,
+							normalResolver,
+							resolveContext,
+							(err, resolvedResource, resolvedResourceResolveData) => {
+								if (err) return continueCallback(err);
+								if (resolvedResource !== false) {
+									resourceData = {
+										resource: resolvedResource,
+										data: resolvedResourceResolveData,
+										...cacheParseResource(resolvedResource)
+									};
+								}
+								continueCallback();
+							}
+						);
+					}
+				};
+
+				// resource with scheme
+				if (scheme) {
+					resourceData = {
+						resource: unresolvedResource,
+						data: {},
+						path: undefined,
+						query: undefined,
+						fragment: undefined,
+						context: undefined
+					};
+					this.hooks.resolveForScheme
+						.for(scheme)
+						.callAsync(resourceData, data, err => {
+							if (err) return continueCallback(err);
+							continueCallback();
+						});
+				}
+
+				// resource within scheme
+				else if (contextScheme) {
+					resourceData = {
+						resource: unresolvedResource,
+						data: {},
+						path: undefined,
+						query: undefined,
+						fragment: undefined,
+						context: undefined
+					};
+					this.hooks.resolveInScheme
+						.for(contextScheme)
+						.callAsync(resourceData, data, (err, handled) => {
+							if (err) return continueCallback(err);
+							if (!handled) return defaultResolve(this.context);
+							continueCallback();
+						});
+				}
+
+				// resource without scheme and without path
+				else defaultResolve(context);
+			}
+		);
+	}
+
+	cleanupForCache() {
+		for (const module of this._restoredUnsafeCacheEntries) {
+			ChunkGraph.clearChunkGraphForModule(module);
+			ModuleGraph.clearModuleGraphForModule(module);
+			module.cleanupForCache();
+		}
+	}
+
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		const dependencies = /** @type {ModuleDependency[]} */ (data.dependencies);
+		const context = data.context || this.context;
+		const resolveOptions = data.resolveOptions || EMPTY_RESOLVE_OPTIONS;
+		const dependency = dependencies[0];
+		const request = dependency.request;
+		const assertions = dependency.assertions;
+		const contextInfo = data.contextInfo;
+		const fileDependencies = new LazySet();
+		const missingDependencies = new LazySet();
+		const contextDependencies = new LazySet();
+		const dependencyType =
+			(dependencies.length > 0 && dependencies[0].category) || "";
+		/** @type {ResolveData} */
+		const resolveData = {
+			contextInfo,
+			resolveOptions,
+			context,
+			request,
+			assertions,
+			dependencies,
+			dependencyType,
+			fileDependencies,
+			missingDependencies,
+			contextDependencies,
+			createData: {},
+			cacheable: true
+		};
+		this.hooks.beforeResolve.callAsync(resolveData, (err, result) => {
+			if (err) {
+				return callback(err, {
+					fileDependencies,
+					missingDependencies,
+					contextDependencies,
+					cacheable: false
+				});
+			}
+
+			// Ignored
+			if (result === false) {
+				return callback(null, {
+					fileDependencies,
+					missingDependencies,
+					contextDependencies,
+					cacheable: resolveData.cacheable
+				});
+			}
+
+			if (typeof result === "object")
+				throw new Error(
+					deprecationChangedHookMessage(
+						"beforeResolve",
+						this.hooks.beforeResolve
+					)
+				);
+
+			this.hooks.factorize.callAsync(resolveData, (err, module) => {
+				if (err) {
+					return callback(err, {
+						fileDependencies,
+						missingDependencies,
+						contextDependencies,
+						cacheable: false
+					});
+				}
+
+				const factoryResult = {
+					module,
+					fileDependencies,
+					missingDependencies,
+					contextDependencies,
+					cacheable: resolveData.cacheable
+				};
+
+				callback(null, factoryResult);
+			});
+		});
+	}
+
+	resolveResource(
+		contextInfo,
+		context,
+		unresolvedResource,
+		resolver,
+		resolveContext,
+		callback
+	) {
+		resolver.resolve(
+			contextInfo,
+			context,
+			unresolvedResource,
+			resolveContext,
+			(err, resolvedResource, resolvedResourceResolveData) => {
+				if (err) {
+					return this._resolveResourceErrorHints(
+						err,
+						contextInfo,
+						context,
+						unresolvedResource,
+						resolver,
+						resolveContext,
+						(err2, hints) => {
+							if (err2) {
+								err.message += `
+An fatal error happened during resolving additional hints for this error: ${err2.message}`;
+								err.stack += `
+
+An fatal error happened during resolving additional hints for this error:
+${err2.stack}`;
+								return callback(err);
+							}
+							if (hints && hints.length > 0) {
+								err.message += `
+${hints.join("\n\n")}`;
+							}
+							callback(err);
+						}
+					);
+				}
+				callback(err, resolvedResource, resolvedResourceResolveData);
+			}
+		);
+	}
+
+	_resolveResourceErrorHints(
+		error,
+		contextInfo,
+		context,
+		unresolvedResource,
+		resolver,
+		resolveContext,
+		callback
+	) {
+		asyncLib.parallel(
+			[
+				callback => {
+					if (!resolver.options.fullySpecified) return callback();
+					resolver
+						.withOptions({
+							fullySpecified: false
+						})
+						.resolve(
+							contextInfo,
+							context,
+							unresolvedResource,
+							resolveContext,
+							(err, resolvedResource) => {
+								if (!err && resolvedResource) {
+									const resource = parseResource(resolvedResource).path.replace(
+										/^.*[\\/]/,
+										""
+									);
+									return callback(
+										null,
+										`Did you mean '${resource}'?
+BREAKING CHANGE: The request '${unresolvedResource}' failed to resolve only because it was resolved as fully specified
+(probably because the origin is strict EcmaScript Module, e. g. a module with javascript mimetype, a '*.mjs' file, or a '*.js' file where the package.json contains '"type": "module"').
+The extension in the request is mandatory for it to be fully specified.
+Add the extension to the request.`
+									);
+								}
+								callback();
+							}
+						);
+				},
+				callback => {
+					if (!resolver.options.enforceExtension) return callback();
+					resolver
+						.withOptions({
+							enforceExtension: false,
+							extensions: []
+						})
+						.resolve(
+							contextInfo,
+							context,
+							unresolvedResource,
+							resolveContext,
+							(err, resolvedResource) => {
+								if (!err && resolvedResource) {
+									let hint = "";
+									const match = /(\.[^.]+)(\?|$)/.exec(unresolvedResource);
+									if (match) {
+										const fixedRequest = unresolvedResource.replace(
+											/(\.[^.]+)(\?|$)/,
+											"$2"
+										);
+										if (resolver.options.extensions.has(match[1])) {
+											hint = `Did you mean '${fixedRequest}'?`;
+										} else {
+											hint = `Did you mean '${fixedRequest}'? Also note that '${match[1]}' is not in 'resolve.extensions' yet and need to be added for this to work?`;
+										}
+									} else {
+										hint = `Did you mean to omit the extension or to remove 'resolve.enforceExtension'?`;
+									}
+									return callback(
+										null,
+										`The request '${unresolvedResource}' failed to resolve only because 'resolve.enforceExtension' was specified.
+${hint}
+Including the extension in the request is no longer possible. Did you mean to enforce including the extension in requests with 'resolve.extensions: []' instead?`
+									);
+								}
+								callback();
+							}
+						);
+				},
+				callback => {
+					if (
+						/^\.\.?\//.test(unresolvedResource) ||
+						resolver.options.preferRelative
+					) {
+						return callback();
+					}
+					resolver.resolve(
+						contextInfo,
+						context,
+						`./${unresolvedResource}`,
+						resolveContext,
+						(err, resolvedResource) => {
+							if (err || !resolvedResource) return callback();
+							const moduleDirectories = resolver.options.modules
+								.map(m => (Array.isArray(m) ? m.join(", ") : m))
+								.join(", ");
+							callback(
+								null,
+								`Did you mean './${unresolvedResource}'?
+Requests that should resolve in the current directory need to start with './'.
+Requests that start with a name are treated as module requests and resolve within module directories (${moduleDirectories}).
+If changing the source code is not an option there is also a resolve options called 'preferRelative' which tries to resolve these kind of requests in the current directory too.`
+							);
+						}
+					);
+				}
+			],
+			(err, hints) => {
+				if (err) return callback(err);
+				callback(null, hints.filter(Boolean));
+			}
+		);
+	}
+
+	resolveRequestArray(
+		contextInfo,
+		context,
+		array,
+		resolver,
+		resolveContext,
+		callback
+	) {
+		if (array.length === 0) return callback(null, array);
+		asyncLib.map(
+			array,
+			(item, callback) => {
+				resolver.resolve(
+					contextInfo,
+					context,
+					item.loader,
+					resolveContext,
+					(err, result) => {
+						if (
+							err &&
+							/^[^/]*$/.test(item.loader) &&
+							!/-loader$/.test(item.loader)
+						) {
+							return resolver.resolve(
+								contextInfo,
+								context,
+								item.loader + "-loader",
+								resolveContext,
+								err2 => {
+									if (!err2) {
+										err.message =
+											err.message +
+											"\n" +
+											"BREAKING CHANGE: It's no longer allowed to omit the '-loader' suffix when using loaders.\n" +
+											`                 You need to specify '${item.loader}-loader' instead of '${item.loader}',\n` +
+											"                 see https://webpack.js.org/migrate/3/#automatic-loader-module-name-extension-removed";
+									}
+									callback(err);
+								}
+							);
+						}
+						if (err) return callback(err);
+
+						const parsedResult = this._parseResourceWithoutFragment(result);
+						const resolved = {
+							loader: parsedResult.path,
+							options:
+								item.options === undefined
+									? parsedResult.query
+										? parsedResult.query.slice(1)
+										: undefined
+									: item.options,
+							ident: item.options === undefined ? undefined : item.ident
+						};
+						return callback(null, resolved);
+					}
+				);
+			},
+			callback
+		);
+	}
+
+	getParser(type, parserOptions = EMPTY_PARSER_OPTIONS) {
+		let cache = this.parserCache.get(type);
+
+		if (cache === undefined) {
+			cache = new WeakMap();
+			this.parserCache.set(type, cache);
+		}
+
+		let parser = cache.get(parserOptions);
+
+		if (parser === undefined) {
+			parser = this.createParser(type, parserOptions);
+			cache.set(parserOptions, parser);
+		}
+
+		return parser;
+	}
+
+	/**
+	 * @param {string} type type
+	 * @param {{[k: string]: any}} parserOptions parser options
+	 * @returns {Parser} parser
+	 */
+	createParser(type, parserOptions = {}) {
+		parserOptions = mergeGlobalOptions(
+			this._globalParserOptions,
+			type,
+			parserOptions
+		);
+		const parser = this.hooks.createParser.for(type).call(parserOptions);
+		if (!parser) {
+			throw new Error(`No parser registered for ${type}`);
+		}
+		this.hooks.parser.for(type).call(parser, parserOptions);
+		return parser;
+	}
+
+	getGenerator(type, generatorOptions = EMPTY_GENERATOR_OPTIONS) {
+		let cache = this.generatorCache.get(type);
+
+		if (cache === undefined) {
+			cache = new WeakMap();
+			this.generatorCache.set(type, cache);
+		}
+
+		let generator = cache.get(generatorOptions);
+
+		if (generator === undefined) {
+			generator = this.createGenerator(type, generatorOptions);
+			cache.set(generatorOptions, generator);
+		}
+
+		return generator;
+	}
+
+	createGenerator(type, generatorOptions = {}) {
+		generatorOptions = mergeGlobalOptions(
+			this._globalGeneratorOptions,
+			type,
+			generatorOptions
+		);
+		const generator = this.hooks.createGenerator
+			.for(type)
+			.call(generatorOptions);
+		if (!generator) {
+			throw new Error(`No generator registered for ${type}`);
+		}
+		this.hooks.generator.for(type).call(generator, generatorOptions);
+		return generator;
+	}
+
+	getResolver(type, resolveOptions) {
+		return this.resolverFactory.get(type, resolveOptions);
+	}
+}
+
+module.exports = NormalModuleFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModuleReplacementPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModuleReplacementPlugin.js
new file mode 100644
index 0000000..121e8e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NormalModuleReplacementPlugin.js
@@ -0,0 +1,71 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { join, dirname } = require("./util/fs");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {function(TODO): void} ModuleReplacer */
+
+class NormalModuleReplacementPlugin {
+	/**
+	 * Create an instance of the plugin
+	 * @param {RegExp} resourceRegExp the resource matcher
+	 * @param {string|ModuleReplacer} newResource the resource replacement
+	 */
+	constructor(resourceRegExp, newResource) {
+		this.resourceRegExp = resourceRegExp;
+		this.newResource = newResource;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const resourceRegExp = this.resourceRegExp;
+		const newResource = this.newResource;
+		compiler.hooks.normalModuleFactory.tap(
+			"NormalModuleReplacementPlugin",
+			nmf => {
+				nmf.hooks.beforeResolve.tap("NormalModuleReplacementPlugin", result => {
+					if (resourceRegExp.test(result.request)) {
+						if (typeof newResource === "function") {
+							newResource(result);
+						} else {
+							result.request = newResource;
+						}
+					}
+				});
+				nmf.hooks.afterResolve.tap("NormalModuleReplacementPlugin", result => {
+					const createData = result.createData;
+					if (resourceRegExp.test(createData.resource)) {
+						if (typeof newResource === "function") {
+							newResource(result);
+						} else {
+							const fs = compiler.inputFileSystem;
+							if (
+								newResource.startsWith("/") ||
+								(newResource.length > 1 && newResource[1] === ":")
+							) {
+								createData.resource = newResource;
+							} else {
+								createData.resource = join(
+									fs,
+									dirname(fs, createData.resource),
+									newResource
+								);
+							}
+						}
+					}
+				});
+			}
+		);
+	}
+}
+
+module.exports = NormalModuleReplacementPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/NullFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/NullFactory.js
new file mode 100644
index 0000000..be86ccf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/NullFactory.js
@@ -0,0 +1,23 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleFactory = require("./ModuleFactory");
+
+/** @typedef {import("./ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("./ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+
+class NullFactory extends ModuleFactory {
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		return callback();
+	}
+}
+module.exports = NullFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/OptimizationStages.js b/node_modules/mathjs/examples/node_modules/webpack/lib/OptimizationStages.js
new file mode 100644
index 0000000..35988fb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/OptimizationStages.js
@@ -0,0 +1,10 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+exports.STAGE_BASIC = -10;
+exports.STAGE_DEFAULT = 0;
+exports.STAGE_ADVANCED = 10;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/OptionsApply.js b/node_modules/mathjs/examples/node_modules/webpack/lib/OptionsApply.js
new file mode 100644
index 0000000..37a4120
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/OptionsApply.js
@@ -0,0 +1,11 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+class OptionsApply {
+	process(options, compiler) {}
+}
+module.exports = OptionsApply;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Parser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Parser.js
new file mode 100644
index 0000000..efd673d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Parser.js
@@ -0,0 +1,38 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./NormalModule")} NormalModule */
+
+/** @typedef {Record<string, any>} PreparsedAst */
+
+/**
+ * @typedef {Object} ParserStateBase
+ * @property {string | Buffer} source
+ * @property {NormalModule} current
+ * @property {NormalModule} module
+ * @property {Compilation} compilation
+ * @property {{[k: string]: any}} options
+ */
+
+/** @typedef {Record<string, any> & ParserStateBase} ParserState */
+
+class Parser {
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+}
+
+module.exports = Parser;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/PrefetchPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/PrefetchPlugin.js
new file mode 100644
index 0000000..fb1454c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/PrefetchPlugin.js
@@ -0,0 +1,50 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const PrefetchDependency = require("./dependencies/PrefetchDependency");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class PrefetchPlugin {
+	constructor(context, request) {
+		if (request) {
+			this.context = context;
+			this.request = request;
+		} else {
+			this.context = null;
+			this.request = context;
+		}
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"PrefetchPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					PrefetchDependency,
+					normalModuleFactory
+				);
+			}
+		);
+		compiler.hooks.make.tapAsync("PrefetchPlugin", (compilation, callback) => {
+			compilation.addModuleChain(
+				this.context || compiler.context,
+				new PrefetchDependency(this.request),
+				err => {
+					callback(err);
+				}
+			);
+		});
+	}
+}
+
+module.exports = PrefetchPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ProgressPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ProgressPlugin.js
new file mode 100644
index 0000000..1f57cc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ProgressPlugin.js
@@ -0,0 +1,613 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Compiler = require("./Compiler");
+const MultiCompiler = require("./MultiCompiler");
+const NormalModule = require("./NormalModule");
+const createSchemaValidation = require("./util/create-schema-validation");
+const { contextify } = require("./util/identifier");
+
+/** @typedef {import("../declarations/plugins/ProgressPlugin").HandlerFunction} HandlerFunction */
+/** @typedef {import("../declarations/plugins/ProgressPlugin").ProgressPluginArgument} ProgressPluginArgument */
+/** @typedef {import("../declarations/plugins/ProgressPlugin").ProgressPluginOptions} ProgressPluginOptions */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/ProgressPlugin.check.js"),
+	() => require("../schemas/plugins/ProgressPlugin.json"),
+	{
+		name: "Progress Plugin",
+		baseDataPath: "options"
+	}
+);
+const median3 = (a, b, c) => {
+	return a + b + c - Math.max(a, b, c) - Math.min(a, b, c);
+};
+
+const createDefaultHandler = (profile, logger) => {
+	/** @type {{ value: string, time: number }[]} */
+	const lastStateInfo = [];
+
+	const defaultHandler = (percentage, msg, ...args) => {
+		if (profile) {
+			if (percentage === 0) {
+				lastStateInfo.length = 0;
+			}
+			const fullState = [msg, ...args];
+			const state = fullState.map(s => s.replace(/\d+\/\d+ /g, ""));
+			const now = Date.now();
+			const len = Math.max(state.length, lastStateInfo.length);
+			for (let i = len; i >= 0; i--) {
+				const stateItem = i < state.length ? state[i] : undefined;
+				const lastStateItem =
+					i < lastStateInfo.length ? lastStateInfo[i] : undefined;
+				if (lastStateItem) {
+					if (stateItem !== lastStateItem.value) {
+						const diff = now - lastStateItem.time;
+						if (lastStateItem.value) {
+							let reportState = lastStateItem.value;
+							if (i > 0) {
+								reportState = lastStateInfo[i - 1].value + " > " + reportState;
+							}
+							const stateMsg = `${" | ".repeat(i)}${diff} ms ${reportState}`;
+							const d = diff;
+							// This depends on timing so we ignore it for coverage
+							/* istanbul ignore next */
+							{
+								if (d > 10000) {
+									logger.error(stateMsg);
+								} else if (d > 1000) {
+									logger.warn(stateMsg);
+								} else if (d > 10) {
+									logger.info(stateMsg);
+								} else if (d > 5) {
+									logger.log(stateMsg);
+								} else {
+									logger.debug(stateMsg);
+								}
+							}
+						}
+						if (stateItem === undefined) {
+							lastStateInfo.length = i;
+						} else {
+							lastStateItem.value = stateItem;
+							lastStateItem.time = now;
+							lastStateInfo.length = i + 1;
+						}
+					}
+				} else {
+					lastStateInfo[i] = {
+						value: stateItem,
+						time: now
+					};
+				}
+			}
+		}
+		logger.status(`${Math.floor(percentage * 100)}%`, msg, ...args);
+		if (percentage === 1 || (!msg && args.length === 0)) logger.status();
+	};
+
+	return defaultHandler;
+};
+
+/**
+ * @callback ReportProgress
+ * @param {number} p
+ * @param {...string} [args]
+ * @returns {void}
+ */
+
+/** @type {WeakMap<Compiler,ReportProgress>} */
+const progressReporters = new WeakMap();
+
+class ProgressPlugin {
+	/**
+	 * @param {Compiler} compiler the current compiler
+	 * @returns {ReportProgress} a progress reporter, if any
+	 */
+	static getReporter(compiler) {
+		return progressReporters.get(compiler);
+	}
+
+	/**
+	 * @param {ProgressPluginArgument} options options
+	 */
+	constructor(options = {}) {
+		if (typeof options === "function") {
+			options = {
+				handler: options
+			};
+		}
+
+		validate(options);
+		options = { ...ProgressPlugin.defaultOptions, ...options };
+
+		this.profile = options.profile;
+		this.handler = options.handler;
+		this.modulesCount = options.modulesCount;
+		this.dependenciesCount = options.dependenciesCount;
+		this.showEntries = options.entries;
+		this.showModules = options.modules;
+		this.showDependencies = options.dependencies;
+		this.showActiveModules = options.activeModules;
+		this.percentBy = options.percentBy;
+	}
+
+	/**
+	 * @param {Compiler | MultiCompiler} compiler webpack compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const handler =
+			this.handler ||
+			createDefaultHandler(
+				this.profile,
+				compiler.getInfrastructureLogger("webpack.Progress")
+			);
+		if (compiler instanceof MultiCompiler) {
+			this._applyOnMultiCompiler(compiler, handler);
+		} else if (compiler instanceof Compiler) {
+			this._applyOnCompiler(compiler, handler);
+		}
+	}
+
+	/**
+	 * @param {MultiCompiler} compiler webpack multi-compiler
+	 * @param {HandlerFunction} handler function that executes for every progress step
+	 * @returns {void}
+	 */
+	_applyOnMultiCompiler(compiler, handler) {
+		const states = compiler.compilers.map(
+			() => /** @type {[number, ...string[]]} */ ([0])
+		);
+		compiler.compilers.forEach((compiler, idx) => {
+			new ProgressPlugin((p, msg, ...args) => {
+				states[idx] = [p, msg, ...args];
+				let sum = 0;
+				for (const [p] of states) sum += p;
+				handler(sum / states.length, `[${idx}] ${msg}`, ...args);
+			}).apply(compiler);
+		});
+	}
+
+	/**
+	 * @param {Compiler} compiler webpack compiler
+	 * @param {HandlerFunction} handler function that executes for every progress step
+	 * @returns {void}
+	 */
+	_applyOnCompiler(compiler, handler) {
+		const showEntries = this.showEntries;
+		const showModules = this.showModules;
+		const showDependencies = this.showDependencies;
+		const showActiveModules = this.showActiveModules;
+		let lastActiveModule = "";
+		let currentLoader = "";
+		let lastModulesCount = 0;
+		let lastDependenciesCount = 0;
+		let lastEntriesCount = 0;
+		let modulesCount = 0;
+		let dependenciesCount = 0;
+		let entriesCount = 1;
+		let doneModules = 0;
+		let doneDependencies = 0;
+		let doneEntries = 0;
+		const activeModules = new Set();
+		let lastUpdate = 0;
+
+		const updateThrottled = () => {
+			if (lastUpdate + 500 < Date.now()) update();
+		};
+
+		const update = () => {
+			/** @type {string[]} */
+			const items = [];
+			const percentByModules =
+				doneModules /
+				Math.max(lastModulesCount || this.modulesCount || 1, modulesCount);
+			const percentByEntries =
+				doneEntries /
+				Math.max(lastEntriesCount || this.dependenciesCount || 1, entriesCount);
+			const percentByDependencies =
+				doneDependencies /
+				Math.max(lastDependenciesCount || 1, dependenciesCount);
+			let percentageFactor;
+
+			switch (this.percentBy) {
+				case "entries":
+					percentageFactor = percentByEntries;
+					break;
+				case "dependencies":
+					percentageFactor = percentByDependencies;
+					break;
+				case "modules":
+					percentageFactor = percentByModules;
+					break;
+				default:
+					percentageFactor = median3(
+						percentByModules,
+						percentByEntries,
+						percentByDependencies
+					);
+			}
+
+			const percentage = 0.1 + percentageFactor * 0.55;
+
+			if (currentLoader) {
+				items.push(
+					`import loader ${contextify(
+						compiler.context,
+						currentLoader,
+						compiler.root
+					)}`
+				);
+			} else {
+				const statItems = [];
+				if (showEntries) {
+					statItems.push(`${doneEntries}/${entriesCount} entries`);
+				}
+				if (showDependencies) {
+					statItems.push(
+						`${doneDependencies}/${dependenciesCount} dependencies`
+					);
+				}
+				if (showModules) {
+					statItems.push(`${doneModules}/${modulesCount} modules`);
+				}
+				if (showActiveModules) {
+					statItems.push(`${activeModules.size} active`);
+				}
+				if (statItems.length > 0) {
+					items.push(statItems.join(" "));
+				}
+				if (showActiveModules) {
+					items.push(lastActiveModule);
+				}
+			}
+			handler(percentage, "building", ...items);
+			lastUpdate = Date.now();
+		};
+
+		const factorizeAdd = () => {
+			dependenciesCount++;
+			if (dependenciesCount < 50 || dependenciesCount % 100 === 0)
+				updateThrottled();
+		};
+
+		const factorizeDone = () => {
+			doneDependencies++;
+			if (doneDependencies < 50 || doneDependencies % 100 === 0)
+				updateThrottled();
+		};
+
+		const moduleAdd = () => {
+			modulesCount++;
+			if (modulesCount < 50 || modulesCount % 100 === 0) updateThrottled();
+		};
+
+		// only used when showActiveModules is set
+		const moduleBuild = module => {
+			const ident = module.identifier();
+			if (ident) {
+				activeModules.add(ident);
+				lastActiveModule = ident;
+				update();
+			}
+		};
+
+		const entryAdd = (entry, options) => {
+			entriesCount++;
+			if (entriesCount < 5 || entriesCount % 10 === 0) updateThrottled();
+		};
+
+		const moduleDone = module => {
+			doneModules++;
+			if (showActiveModules) {
+				const ident = module.identifier();
+				if (ident) {
+					activeModules.delete(ident);
+					if (lastActiveModule === ident) {
+						lastActiveModule = "";
+						for (const m of activeModules) {
+							lastActiveModule = m;
+						}
+						update();
+						return;
+					}
+				}
+			}
+			if (doneModules < 50 || doneModules % 100 === 0) updateThrottled();
+		};
+
+		const entryDone = (entry, options) => {
+			doneEntries++;
+			update();
+		};
+
+		const cache = compiler
+			.getCache("ProgressPlugin")
+			.getItemCache("counts", null);
+
+		let cacheGetPromise;
+
+		compiler.hooks.beforeCompile.tap("ProgressPlugin", () => {
+			if (!cacheGetPromise) {
+				cacheGetPromise = cache.getPromise().then(
+					data => {
+						if (data) {
+							lastModulesCount = lastModulesCount || data.modulesCount;
+							lastDependenciesCount =
+								lastDependenciesCount || data.dependenciesCount;
+						}
+						return data;
+					},
+					err => {
+						// Ignore error
+					}
+				);
+			}
+		});
+
+		compiler.hooks.afterCompile.tapPromise("ProgressPlugin", compilation => {
+			if (compilation.compiler.isChild()) return Promise.resolve();
+			return cacheGetPromise.then(async oldData => {
+				if (
+					!oldData ||
+					oldData.modulesCount !== modulesCount ||
+					oldData.dependenciesCount !== dependenciesCount
+				) {
+					await cache.storePromise({ modulesCount, dependenciesCount });
+				}
+			});
+		});
+
+		compiler.hooks.compilation.tap("ProgressPlugin", compilation => {
+			if (compilation.compiler.isChild()) return;
+			lastModulesCount = modulesCount;
+			lastEntriesCount = entriesCount;
+			lastDependenciesCount = dependenciesCount;
+			modulesCount = dependenciesCount = entriesCount = 0;
+			doneModules = doneDependencies = doneEntries = 0;
+
+			compilation.factorizeQueue.hooks.added.tap(
+				"ProgressPlugin",
+				factorizeAdd
+			);
+			compilation.factorizeQueue.hooks.result.tap(
+				"ProgressPlugin",
+				factorizeDone
+			);
+
+			compilation.addModuleQueue.hooks.added.tap("ProgressPlugin", moduleAdd);
+			compilation.processDependenciesQueue.hooks.result.tap(
+				"ProgressPlugin",
+				moduleDone
+			);
+
+			if (showActiveModules) {
+				compilation.hooks.buildModule.tap("ProgressPlugin", moduleBuild);
+			}
+
+			compilation.hooks.addEntry.tap("ProgressPlugin", entryAdd);
+			compilation.hooks.failedEntry.tap("ProgressPlugin", entryDone);
+			compilation.hooks.succeedEntry.tap("ProgressPlugin", entryDone);
+
+			// avoid dynamic require if bundled with webpack
+			// @ts-expect-error
+			if (typeof __webpack_require__ !== "function") {
+				const requiredLoaders = new Set();
+				NormalModule.getCompilationHooks(compilation).beforeLoaders.tap(
+					"ProgressPlugin",
+					loaders => {
+						for (const loader of loaders) {
+							if (
+								loader.type !== "module" &&
+								!requiredLoaders.has(loader.loader)
+							) {
+								requiredLoaders.add(loader.loader);
+								currentLoader = loader.loader;
+								update();
+								require(loader.loader);
+							}
+						}
+						if (currentLoader) {
+							currentLoader = "";
+							update();
+						}
+					}
+				);
+			}
+
+			const hooks = {
+				finishModules: "finish module graph",
+				seal: "plugins",
+				optimizeDependencies: "dependencies optimization",
+				afterOptimizeDependencies: "after dependencies optimization",
+				beforeChunks: "chunk graph",
+				afterChunks: "after chunk graph",
+				optimize: "optimizing",
+				optimizeModules: "module optimization",
+				afterOptimizeModules: "after module optimization",
+				optimizeChunks: "chunk optimization",
+				afterOptimizeChunks: "after chunk optimization",
+				optimizeTree: "module and chunk tree optimization",
+				afterOptimizeTree: "after module and chunk tree optimization",
+				optimizeChunkModules: "chunk modules optimization",
+				afterOptimizeChunkModules: "after chunk modules optimization",
+				reviveModules: "module reviving",
+				beforeModuleIds: "before module ids",
+				moduleIds: "module ids",
+				optimizeModuleIds: "module id optimization",
+				afterOptimizeModuleIds: "module id optimization",
+				reviveChunks: "chunk reviving",
+				beforeChunkIds: "before chunk ids",
+				chunkIds: "chunk ids",
+				optimizeChunkIds: "chunk id optimization",
+				afterOptimizeChunkIds: "after chunk id optimization",
+				recordModules: "record modules",
+				recordChunks: "record chunks",
+				beforeModuleHash: "module hashing",
+				beforeCodeGeneration: "code generation",
+				beforeRuntimeRequirements: "runtime requirements",
+				beforeHash: "hashing",
+				afterHash: "after hashing",
+				recordHash: "record hash",
+				beforeModuleAssets: "module assets processing",
+				beforeChunkAssets: "chunk assets processing",
+				processAssets: "asset processing",
+				afterProcessAssets: "after asset optimization",
+				record: "recording",
+				afterSeal: "after seal"
+			};
+			const numberOfHooks = Object.keys(hooks).length;
+			Object.keys(hooks).forEach((name, idx) => {
+				const title = hooks[name];
+				const percentage = (idx / numberOfHooks) * 0.25 + 0.7;
+				compilation.hooks[name].intercept({
+					name: "ProgressPlugin",
+					call() {
+						handler(percentage, "sealing", title);
+					},
+					done() {
+						progressReporters.set(compiler, undefined);
+						handler(percentage, "sealing", title);
+					},
+					result() {
+						handler(percentage, "sealing", title);
+					},
+					error() {
+						handler(percentage, "sealing", title);
+					},
+					tap(tap) {
+						// p is percentage from 0 to 1
+						// args is any number of messages in a hierarchical matter
+						progressReporters.set(compilation.compiler, (p, ...args) => {
+							handler(percentage, "sealing", title, tap.name, ...args);
+						});
+						handler(percentage, "sealing", title, tap.name);
+					}
+				});
+			});
+		});
+		compiler.hooks.make.intercept({
+			name: "ProgressPlugin",
+			call() {
+				handler(0.1, "building");
+			},
+			done() {
+				handler(0.65, "building");
+			}
+		});
+		const interceptHook = (hook, progress, category, name) => {
+			hook.intercept({
+				name: "ProgressPlugin",
+				call() {
+					handler(progress, category, name);
+				},
+				done() {
+					progressReporters.set(compiler, undefined);
+					handler(progress, category, name);
+				},
+				result() {
+					handler(progress, category, name);
+				},
+				error() {
+					handler(progress, category, name);
+				},
+				tap(tap) {
+					progressReporters.set(compiler, (p, ...args) => {
+						handler(progress, category, name, tap.name, ...args);
+					});
+					handler(progress, category, name, tap.name);
+				}
+			});
+		};
+		compiler.cache.hooks.endIdle.intercept({
+			name: "ProgressPlugin",
+			call() {
+				handler(0, "");
+			}
+		});
+		interceptHook(compiler.cache.hooks.endIdle, 0.01, "cache", "end idle");
+		compiler.hooks.beforeRun.intercept({
+			name: "ProgressPlugin",
+			call() {
+				handler(0, "");
+			}
+		});
+		interceptHook(compiler.hooks.beforeRun, 0.01, "setup", "before run");
+		interceptHook(compiler.hooks.run, 0.02, "setup", "run");
+		interceptHook(compiler.hooks.watchRun, 0.03, "setup", "watch run");
+		interceptHook(
+			compiler.hooks.normalModuleFactory,
+			0.04,
+			"setup",
+			"normal module factory"
+		);
+		interceptHook(
+			compiler.hooks.contextModuleFactory,
+			0.05,
+			"setup",
+			"context module factory"
+		);
+		interceptHook(
+			compiler.hooks.beforeCompile,
+			0.06,
+			"setup",
+			"before compile"
+		);
+		interceptHook(compiler.hooks.compile, 0.07, "setup", "compile");
+		interceptHook(compiler.hooks.thisCompilation, 0.08, "setup", "compilation");
+		interceptHook(compiler.hooks.compilation, 0.09, "setup", "compilation");
+		interceptHook(compiler.hooks.finishMake, 0.69, "building", "finish");
+		interceptHook(compiler.hooks.emit, 0.95, "emitting", "emit");
+		interceptHook(compiler.hooks.afterEmit, 0.98, "emitting", "after emit");
+		interceptHook(compiler.hooks.done, 0.99, "done", "plugins");
+		compiler.hooks.done.intercept({
+			name: "ProgressPlugin",
+			done() {
+				handler(0.99, "");
+			}
+		});
+		interceptHook(
+			compiler.cache.hooks.storeBuildDependencies,
+			0.99,
+			"cache",
+			"store build dependencies"
+		);
+		interceptHook(compiler.cache.hooks.shutdown, 0.99, "cache", "shutdown");
+		interceptHook(compiler.cache.hooks.beginIdle, 0.99, "cache", "begin idle");
+		interceptHook(
+			compiler.hooks.watchClose,
+			0.99,
+			"end",
+			"closing watch compilation"
+		);
+		compiler.cache.hooks.beginIdle.intercept({
+			name: "ProgressPlugin",
+			done() {
+				handler(1, "");
+			}
+		});
+		compiler.cache.hooks.shutdown.intercept({
+			name: "ProgressPlugin",
+			done() {
+				handler(1, "");
+			}
+		});
+	}
+}
+
+ProgressPlugin.defaultOptions = {
+	profile: false,
+	modulesCount: 5000,
+	dependenciesCount: 10000,
+	modules: true,
+	dependencies: true,
+	activeModules: false,
+	entries: true
+};
+
+module.exports = ProgressPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ProvidePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ProvidePlugin.js
new file mode 100644
index 0000000..8373389
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ProvidePlugin.js
@@ -0,0 +1,101 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ConstDependency = require("./dependencies/ConstDependency");
+const ProvidedDependency = require("./dependencies/ProvidedDependency");
+const { approve } = require("./javascript/JavascriptParserHelpers");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class ProvidePlugin {
+	/**
+	 * @param {Record<string, string | string[]>} definitions the provided identifiers
+	 */
+	constructor(definitions) {
+		this.definitions = definitions;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const definitions = this.definitions;
+		compiler.hooks.compilation.tap(
+			"ProvidePlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					ConstDependency,
+					new ConstDependency.Template()
+				);
+				compilation.dependencyFactories.set(
+					ProvidedDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ProvidedDependency,
+					new ProvidedDependency.Template()
+				);
+				const handler = (parser, parserOptions) => {
+					Object.keys(definitions).forEach(name => {
+						const request = [].concat(definitions[name]);
+						const splittedName = name.split(".");
+						if (splittedName.length > 0) {
+							splittedName.slice(1).forEach((_, i) => {
+								const name = splittedName.slice(0, i + 1).join(".");
+								parser.hooks.canRename.for(name).tap("ProvidePlugin", approve);
+							});
+						}
+
+						parser.hooks.expression.for(name).tap("ProvidePlugin", expr => {
+							const nameIdentifier = name.includes(".")
+								? `__webpack_provided_${name.replace(/\./g, "_dot_")}`
+								: name;
+							const dep = new ProvidedDependency(
+								request[0],
+								nameIdentifier,
+								request.slice(1),
+								expr.range
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addDependency(dep);
+							return true;
+						});
+
+						parser.hooks.call.for(name).tap("ProvidePlugin", expr => {
+							const nameIdentifier = name.includes(".")
+								? `__webpack_provided_${name.replace(/\./g, "_dot_")}`
+								: name;
+							const dep = new ProvidedDependency(
+								request[0],
+								nameIdentifier,
+								request.slice(1),
+								expr.callee.range
+							);
+							dep.loc = expr.callee.loc;
+							parser.state.module.addDependency(dep);
+							parser.walkExpressions(expr.arguments);
+							return true;
+						});
+					});
+				};
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("ProvidePlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("ProvidePlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("ProvidePlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = ProvidePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RawModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RawModule.js
new file mode 100644
index 0000000..91342ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RawModule.js
@@ -0,0 +1,152 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { OriginalSource, RawSource } = require("webpack-sources");
+const Module = require("./Module");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["javascript"]);
+
+class RawModule extends Module {
+	/**
+	 * @param {string} source source code
+	 * @param {string} identifier unique identifier
+	 * @param {string=} readableIdentifier readable identifier
+	 * @param {ReadonlySet<string>=} runtimeRequirements runtime requirements needed for the source code
+	 */
+	constructor(source, identifier, readableIdentifier, runtimeRequirements) {
+		super("javascript/dynamic", null);
+		this.sourceStr = source;
+		this.identifierStr = identifier || this.sourceStr;
+		this.readableIdentifierStr = readableIdentifier || this.identifierStr;
+		this.runtimeRequirements = runtimeRequirements || null;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return this.identifierStr;
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return Math.max(1, this.sourceStr.length);
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return requestShortener.shorten(this.readableIdentifierStr);
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		return callback(null, !this.buildMeta);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {
+			cacheable: true
+		};
+		callback();
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration(context) {
+		const sources = new Map();
+		if (this.useSourceMap || this.useSimpleSourceMap) {
+			sources.set(
+				"javascript",
+				new OriginalSource(this.sourceStr, this.identifier())
+			);
+		} else {
+			sources.set("javascript", new RawSource(this.sourceStr));
+		}
+		return { sources, runtimeRequirements: this.runtimeRequirements };
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		hash.update(this.sourceStr);
+		super.updateHash(hash, context);
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.sourceStr);
+		write(this.identifierStr);
+		write(this.readableIdentifierStr);
+		write(this.runtimeRequirements);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.sourceStr = read();
+		this.identifierStr = read();
+		this.readableIdentifierStr = read();
+		this.runtimeRequirements = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(RawModule, "webpack/lib/RawModule");
+
+module.exports = RawModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RecordIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RecordIdsPlugin.js
new file mode 100644
index 0000000..15466f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RecordIdsPlugin.js
@@ -0,0 +1,238 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { compareNumbers } = require("./util/comparators");
+const identifierUtils = require("./util/identifier");
+
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Module")} Module */
+
+/**
+ * @typedef {Object} RecordsChunks
+ * @property {Record<string, number>=} byName
+ * @property {Record<string, number>=} bySource
+ * @property {number[]=} usedIds
+ */
+
+/**
+ * @typedef {Object} RecordsModules
+ * @property {Record<string, number>=} byIdentifier
+ * @property {Record<string, number>=} bySource
+ * @property {number[]=} usedIds
+ */
+
+/**
+ * @typedef {Object} Records
+ * @property {RecordsChunks=} chunks
+ * @property {RecordsModules=} modules
+ */
+
+class RecordIdsPlugin {
+	/**
+	 * @param {Object} options Options object
+	 * @param {boolean=} options.portableIds true, when ids need to be portable
+	 */
+	constructor(options) {
+		this.options = options || {};
+	}
+
+	/**
+	 * @param {Compiler} compiler the Compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const portableIds = this.options.portableIds;
+
+		const makePathsRelative =
+			identifierUtils.makePathsRelative.bindContextCache(
+				compiler.context,
+				compiler.root
+			);
+
+		/**
+		 * @param {Module} module the module
+		 * @returns {string} the (portable) identifier
+		 */
+		const getModuleIdentifier = module => {
+			if (portableIds) {
+				return makePathsRelative(module.identifier());
+			}
+			return module.identifier();
+		};
+
+		compiler.hooks.compilation.tap("RecordIdsPlugin", compilation => {
+			compilation.hooks.recordModules.tap(
+				"RecordIdsPlugin",
+				/**
+				 * @param {Module[]} modules the modules array
+				 * @param {Records} records the records object
+				 * @returns {void}
+				 */
+				(modules, records) => {
+					const chunkGraph = compilation.chunkGraph;
+					if (!records.modules) records.modules = {};
+					if (!records.modules.byIdentifier) records.modules.byIdentifier = {};
+					/** @type {Set<number>} */
+					const usedIds = new Set();
+					for (const module of modules) {
+						const moduleId = chunkGraph.getModuleId(module);
+						if (typeof moduleId !== "number") continue;
+						const identifier = getModuleIdentifier(module);
+						records.modules.byIdentifier[identifier] = moduleId;
+						usedIds.add(moduleId);
+					}
+					records.modules.usedIds = Array.from(usedIds).sort(compareNumbers);
+				}
+			);
+			compilation.hooks.reviveModules.tap(
+				"RecordIdsPlugin",
+				/**
+				 * @param {Module[]} modules the modules array
+				 * @param {Records} records the records object
+				 * @returns {void}
+				 */
+				(modules, records) => {
+					if (!records.modules) return;
+					if (records.modules.byIdentifier) {
+						const chunkGraph = compilation.chunkGraph;
+						/** @type {Set<number>} */
+						const usedIds = new Set();
+						for (const module of modules) {
+							const moduleId = chunkGraph.getModuleId(module);
+							if (moduleId !== null) continue;
+							const identifier = getModuleIdentifier(module);
+							const id = records.modules.byIdentifier[identifier];
+							if (id === undefined) continue;
+							if (usedIds.has(id)) continue;
+							usedIds.add(id);
+							chunkGraph.setModuleId(module, id);
+						}
+					}
+					if (Array.isArray(records.modules.usedIds)) {
+						compilation.usedModuleIds = new Set(records.modules.usedIds);
+					}
+				}
+			);
+
+			/**
+			 * @param {Chunk} chunk the chunk
+			 * @returns {string[]} sources of the chunk
+			 */
+			const getChunkSources = chunk => {
+				/** @type {string[]} */
+				const sources = [];
+				for (const chunkGroup of chunk.groupsIterable) {
+					const index = chunkGroup.chunks.indexOf(chunk);
+					if (chunkGroup.name) {
+						sources.push(`${index} ${chunkGroup.name}`);
+					} else {
+						for (const origin of chunkGroup.origins) {
+							if (origin.module) {
+								if (origin.request) {
+									sources.push(
+										`${index} ${getModuleIdentifier(origin.module)} ${
+											origin.request
+										}`
+									);
+								} else if (typeof origin.loc === "string") {
+									sources.push(
+										`${index} ${getModuleIdentifier(origin.module)} ${
+											origin.loc
+										}`
+									);
+								} else if (
+									origin.loc &&
+									typeof origin.loc === "object" &&
+									"start" in origin.loc
+								) {
+									sources.push(
+										`${index} ${getModuleIdentifier(
+											origin.module
+										)} ${JSON.stringify(origin.loc.start)}`
+									);
+								}
+							}
+						}
+					}
+				}
+				return sources;
+			};
+
+			compilation.hooks.recordChunks.tap(
+				"RecordIdsPlugin",
+				/**
+				 * @param {Chunk[]} chunks the chunks array
+				 * @param {Records} records the records object
+				 * @returns {void}
+				 */
+				(chunks, records) => {
+					if (!records.chunks) records.chunks = {};
+					if (!records.chunks.byName) records.chunks.byName = {};
+					if (!records.chunks.bySource) records.chunks.bySource = {};
+					/** @type {Set<number>} */
+					const usedIds = new Set();
+					for (const chunk of chunks) {
+						if (typeof chunk.id !== "number") continue;
+						const name = chunk.name;
+						if (name) records.chunks.byName[name] = chunk.id;
+						const sources = getChunkSources(chunk);
+						for (const source of sources) {
+							records.chunks.bySource[source] = chunk.id;
+						}
+						usedIds.add(chunk.id);
+					}
+					records.chunks.usedIds = Array.from(usedIds).sort(compareNumbers);
+				}
+			);
+			compilation.hooks.reviveChunks.tap(
+				"RecordIdsPlugin",
+				/**
+				 * @param {Chunk[]} chunks the chunks array
+				 * @param {Records} records the records object
+				 * @returns {void}
+				 */
+				(chunks, records) => {
+					if (!records.chunks) return;
+					/** @type {Set<number>} */
+					const usedIds = new Set();
+					if (records.chunks.byName) {
+						for (const chunk of chunks) {
+							if (chunk.id !== null) continue;
+							if (!chunk.name) continue;
+							const id = records.chunks.byName[chunk.name];
+							if (id === undefined) continue;
+							if (usedIds.has(id)) continue;
+							usedIds.add(id);
+							chunk.id = id;
+							chunk.ids = [id];
+						}
+					}
+					if (records.chunks.bySource) {
+						for (const chunk of chunks) {
+							if (chunk.id !== null) continue;
+							const sources = getChunkSources(chunk);
+							for (const source of sources) {
+								const id = records.chunks.bySource[source];
+								if (id === undefined) continue;
+								if (usedIds.has(id)) continue;
+								usedIds.add(id);
+								chunk.id = id;
+								chunk.ids = [id];
+								break;
+							}
+						}
+					}
+					if (Array.isArray(records.chunks.usedIds)) {
+						compilation.usedChunkIds = new Set(records.chunks.usedIds);
+					}
+				}
+			);
+		});
+	}
+}
+module.exports = RecordIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RequestShortener.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RequestShortener.js
new file mode 100644
index 0000000..9ef8019
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RequestShortener.js
@@ -0,0 +1,34 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { contextify } = require("./util/identifier");
+
+class RequestShortener {
+	/**
+	 * @param {string} dir the directory
+	 * @param {object=} associatedObjectForCache an object to which the cache will be attached
+	 */
+	constructor(dir, associatedObjectForCache) {
+		this.contextify = contextify.bindContextCache(
+			dir,
+			associatedObjectForCache
+		);
+	}
+
+	/**
+	 * @param {string | undefined | null} request the request to shorten
+	 * @returns {string | undefined | null} the shortened request
+	 */
+	shorten(request) {
+		if (!request) {
+			return request;
+		}
+		return this.contextify(request);
+	}
+}
+
+module.exports = RequestShortener;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RequireJsStuffPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RequireJsStuffPlugin.js
new file mode 100644
index 0000000..959841b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RequireJsStuffPlugin.js
@@ -0,0 +1,77 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("./RuntimeGlobals");
+const ConstDependency = require("./dependencies/ConstDependency");
+const {
+	toConstantDependency
+} = require("./javascript/JavascriptParserHelpers");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+module.exports = class RequireJsStuffPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"RequireJsStuffPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					ConstDependency,
+					new ConstDependency.Template()
+				);
+				const handler = (parser, parserOptions) => {
+					if (
+						parserOptions.requireJs === undefined ||
+						!parserOptions.requireJs
+					) {
+						return;
+					}
+
+					parser.hooks.call
+						.for("require.config")
+						.tap(
+							"RequireJsStuffPlugin",
+							toConstantDependency(parser, "undefined")
+						);
+					parser.hooks.call
+						.for("requirejs.config")
+						.tap(
+							"RequireJsStuffPlugin",
+							toConstantDependency(parser, "undefined")
+						);
+
+					parser.hooks.expression
+						.for("require.version")
+						.tap(
+							"RequireJsStuffPlugin",
+							toConstantDependency(parser, JSON.stringify("0.0.0"))
+						);
+					parser.hooks.expression
+						.for("requirejs.onError")
+						.tap(
+							"RequireJsStuffPlugin",
+							toConstantDependency(
+								parser,
+								RuntimeGlobals.uncaughtErrorHandler,
+								[RuntimeGlobals.uncaughtErrorHandler]
+							)
+						);
+				};
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("RequireJsStuffPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("RequireJsStuffPlugin", handler);
+			}
+		);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ResolverFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ResolverFactory.js
new file mode 100644
index 0000000..da36fd3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ResolverFactory.js
@@ -0,0 +1,151 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Factory = require("enhanced-resolve").ResolverFactory;
+const { HookMap, SyncHook, SyncWaterfallHook } = require("tapable");
+const {
+	cachedCleverMerge,
+	removeOperations,
+	resolveByProperty
+} = require("./util/cleverMerge");
+
+/** @typedef {import("enhanced-resolve").ResolveOptions} ResolveOptions */
+/** @typedef {import("enhanced-resolve").Resolver} Resolver */
+/** @typedef {import("../declarations/WebpackOptions").ResolveOptions} WebpackResolveOptions */
+/** @typedef {import("../declarations/WebpackOptions").ResolvePluginInstance} ResolvePluginInstance */
+
+/** @typedef {WebpackResolveOptions & {dependencyType?: string, resolveToContext?: boolean }} ResolveOptionsWithDependencyType */
+/**
+ * @typedef {Object} WithOptions
+ * @property {function(Partial<ResolveOptionsWithDependencyType>): ResolverWithOptions} withOptions create a resolver with additional/different options
+ */
+
+/** @typedef {Resolver & WithOptions} ResolverWithOptions */
+
+// need to be hoisted on module level for caching identity
+const EMPTY_RESOLVE_OPTIONS = {};
+
+/**
+ * @param {ResolveOptionsWithDependencyType} resolveOptionsWithDepType enhanced options
+ * @returns {ResolveOptions} merged options
+ */
+const convertToResolveOptions = resolveOptionsWithDepType => {
+	const { dependencyType, plugins, ...remaining } = resolveOptionsWithDepType;
+
+	// check type compat
+	/** @type {Partial<ResolveOptions>} */
+	const partialOptions = {
+		...remaining,
+		plugins:
+			plugins &&
+			/** @type {ResolvePluginInstance[]} */ (
+				plugins.filter(item => item !== "...")
+			)
+	};
+
+	if (!partialOptions.fileSystem) {
+		throw new Error(
+			"fileSystem is missing in resolveOptions, but it's required for enhanced-resolve"
+		);
+	}
+	// These weird types validate that we checked all non-optional properties
+	const options =
+		/** @type {Partial<ResolveOptions> & Pick<ResolveOptions, "fileSystem">} */ (
+			partialOptions
+		);
+
+	return removeOperations(
+		resolveByProperty(options, "byDependency", dependencyType)
+	);
+};
+
+/**
+ * @typedef {Object} ResolverCache
+ * @property {WeakMap<Object, ResolverWithOptions>} direct
+ * @property {Map<string, ResolverWithOptions>} stringified
+ */
+
+module.exports = class ResolverFactory {
+	constructor() {
+		this.hooks = Object.freeze({
+			/** @type {HookMap<SyncWaterfallHook<[ResolveOptionsWithDependencyType]>>} */
+			resolveOptions: new HookMap(
+				() => new SyncWaterfallHook(["resolveOptions"])
+			),
+			/** @type {HookMap<SyncHook<[Resolver, ResolveOptions, ResolveOptionsWithDependencyType]>>} */
+			resolver: new HookMap(
+				() => new SyncHook(["resolver", "resolveOptions", "userResolveOptions"])
+			)
+		});
+		/** @type {Map<string, ResolverCache>} */
+		this.cache = new Map();
+	}
+
+	/**
+	 * @param {string} type type of resolver
+	 * @param {ResolveOptionsWithDependencyType=} resolveOptions options
+	 * @returns {ResolverWithOptions} the resolver
+	 */
+	get(type, resolveOptions = EMPTY_RESOLVE_OPTIONS) {
+		let typedCaches = this.cache.get(type);
+		if (!typedCaches) {
+			typedCaches = {
+				direct: new WeakMap(),
+				stringified: new Map()
+			};
+			this.cache.set(type, typedCaches);
+		}
+		const cachedResolver = typedCaches.direct.get(resolveOptions);
+		if (cachedResolver) {
+			return cachedResolver;
+		}
+		const ident = JSON.stringify(resolveOptions);
+		const resolver = typedCaches.stringified.get(ident);
+		if (resolver) {
+			typedCaches.direct.set(resolveOptions, resolver);
+			return resolver;
+		}
+		const newResolver = this._create(type, resolveOptions);
+		typedCaches.direct.set(resolveOptions, newResolver);
+		typedCaches.stringified.set(ident, newResolver);
+		return newResolver;
+	}
+
+	/**
+	 * @param {string} type type of resolver
+	 * @param {ResolveOptionsWithDependencyType} resolveOptionsWithDepType options
+	 * @returns {ResolverWithOptions} the resolver
+	 */
+	_create(type, resolveOptionsWithDepType) {
+		/** @type {ResolveOptionsWithDependencyType} */
+		const originalResolveOptions = { ...resolveOptionsWithDepType };
+
+		const resolveOptions = convertToResolveOptions(
+			this.hooks.resolveOptions.for(type).call(resolveOptionsWithDepType)
+		);
+		const resolver = /** @type {ResolverWithOptions} */ (
+			Factory.createResolver(resolveOptions)
+		);
+		if (!resolver) {
+			throw new Error("No resolver created");
+		}
+		/** @type {WeakMap<Partial<ResolveOptionsWithDependencyType>, ResolverWithOptions>} */
+		const childCache = new WeakMap();
+		resolver.withOptions = options => {
+			const cacheEntry = childCache.get(options);
+			if (cacheEntry !== undefined) return cacheEntry;
+			const mergedOptions = cachedCleverMerge(originalResolveOptions, options);
+			const resolver = this.get(type, mergedOptions);
+			childCache.set(options, resolver);
+			return resolver;
+		};
+		this.hooks.resolver
+			.for(type)
+			.call(resolver, resolveOptions, originalResolveOptions);
+		return resolver;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeGlobals.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeGlobals.js
new file mode 100644
index 0000000..90d16b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeGlobals.js
@@ -0,0 +1,381 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * the internal require function
+ */
+exports.require = "__webpack_require__";
+
+/**
+ * access to properties of the internal require function/object
+ */
+exports.requireScope = "__webpack_require__.*";
+
+/**
+ * the internal exports object
+ */
+exports.exports = "__webpack_exports__";
+
+/**
+ * top-level this need to be the exports object
+ */
+exports.thisAsExports = "top-level-this-exports";
+
+/**
+ * runtime need to return the exports of the last entry module
+ */
+exports.returnExportsFromRuntime = "return-exports-from-runtime";
+
+/**
+ * the internal module object
+ */
+exports.module = "module";
+
+/**
+ * the internal module object
+ */
+exports.moduleId = "module.id";
+
+/**
+ * the internal module object
+ */
+exports.moduleLoaded = "module.loaded";
+
+/**
+ * the bundle public path
+ */
+exports.publicPath = "__webpack_require__.p";
+
+/**
+ * the module id of the entry point
+ */
+exports.entryModuleId = "__webpack_require__.s";
+
+/**
+ * the module cache
+ */
+exports.moduleCache = "__webpack_require__.c";
+
+/**
+ * the module functions
+ */
+exports.moduleFactories = "__webpack_require__.m";
+
+/**
+ * the module functions, with only write access
+ */
+exports.moduleFactoriesAddOnly = "__webpack_require__.m (add only)";
+
+/**
+ * the chunk ensure function
+ */
+exports.ensureChunk = "__webpack_require__.e";
+
+/**
+ * an object with handlers to ensure a chunk
+ */
+exports.ensureChunkHandlers = "__webpack_require__.f";
+
+/**
+ * a runtime requirement if ensureChunkHandlers should include loading of chunk needed for entries
+ */
+exports.ensureChunkIncludeEntries = "__webpack_require__.f (include entries)";
+
+/**
+ * the chunk prefetch function
+ */
+exports.prefetchChunk = "__webpack_require__.E";
+
+/**
+ * an object with handlers to prefetch a chunk
+ */
+exports.prefetchChunkHandlers = "__webpack_require__.F";
+
+/**
+ * the chunk preload function
+ */
+exports.preloadChunk = "__webpack_require__.G";
+
+/**
+ * an object with handlers to preload a chunk
+ */
+exports.preloadChunkHandlers = "__webpack_require__.H";
+
+/**
+ * the exported property define getters function
+ */
+exports.definePropertyGetters = "__webpack_require__.d";
+
+/**
+ * define compatibility on export
+ */
+exports.makeNamespaceObject = "__webpack_require__.r";
+
+/**
+ * create a fake namespace object
+ */
+exports.createFakeNamespaceObject = "__webpack_require__.t";
+
+/**
+ * compatibility get default export
+ */
+exports.compatGetDefaultExport = "__webpack_require__.n";
+
+/**
+ * harmony module decorator
+ */
+exports.harmonyModuleDecorator = "__webpack_require__.hmd";
+
+/**
+ * node.js module decorator
+ */
+exports.nodeModuleDecorator = "__webpack_require__.nmd";
+
+/**
+ * the webpack hash
+ */
+exports.getFullHash = "__webpack_require__.h";
+
+/**
+ * an object containing all installed WebAssembly.Instance export objects keyed by module id
+ */
+exports.wasmInstances = "__webpack_require__.w";
+
+/**
+ * instantiate a wasm instance from module exports object, id, hash and importsObject
+ */
+exports.instantiateWasm = "__webpack_require__.v";
+
+/**
+ * the uncaught error handler for the webpack runtime
+ */
+exports.uncaughtErrorHandler = "__webpack_require__.oe";
+
+/**
+ * the script nonce
+ */
+exports.scriptNonce = "__webpack_require__.nc";
+
+/**
+ * function to load a script tag.
+ * Arguments: (url: string, done: (event) => void), key?: string | number, chunkId?: string | number) => void
+ * done function is called when loading has finished or timeout occurred.
+ * It will attach to existing script tags with data-webpack == uniqueName + ":" + key or src == url.
+ */
+exports.loadScript = "__webpack_require__.l";
+
+/**
+ * function to promote a string to a TrustedScript using webpack's Trusted
+ * Types policy
+ * Arguments: (script: string) => TrustedScript
+ */
+exports.createScript = "__webpack_require__.ts";
+
+/**
+ * function to promote a string to a TrustedScriptURL using webpack's Trusted
+ * Types policy
+ * Arguments: (url: string) => TrustedScriptURL
+ */
+exports.createScriptUrl = "__webpack_require__.tu";
+
+/**
+ * function to return webpack's Trusted Types policy
+ * Arguments: () => TrustedTypePolicy
+ */
+exports.getTrustedTypesPolicy = "__webpack_require__.tt";
+
+/**
+ * the chunk name of the chunk with the runtime
+ */
+exports.chunkName = "__webpack_require__.cn";
+
+/**
+ * the runtime id of the current runtime
+ */
+exports.runtimeId = "__webpack_require__.j";
+
+/**
+ * the filename of the script part of the chunk
+ */
+exports.getChunkScriptFilename = "__webpack_require__.u";
+
+/**
+ * the filename of the css part of the chunk
+ */
+exports.getChunkCssFilename = "__webpack_require__.k";
+
+/**
+ * a flag when a module/chunk/tree has css modules
+ */
+exports.hasCssModules = "has css modules";
+
+/**
+ * the filename of the script part of the hot update chunk
+ */
+exports.getChunkUpdateScriptFilename = "__webpack_require__.hu";
+
+/**
+ * the filename of the css part of the hot update chunk
+ */
+exports.getChunkUpdateCssFilename = "__webpack_require__.hk";
+
+/**
+ * startup signal from runtime
+ * This will be called when the runtime chunk has been loaded.
+ */
+exports.startup = "__webpack_require__.x";
+
+/**
+ * @deprecated
+ * creating a default startup function with the entry modules
+ */
+exports.startupNoDefault = "__webpack_require__.x (no default handler)";
+
+/**
+ * startup signal from runtime but only used to add logic after the startup
+ */
+exports.startupOnlyAfter = "__webpack_require__.x (only after)";
+
+/**
+ * startup signal from runtime but only used to add sync logic before the startup
+ */
+exports.startupOnlyBefore = "__webpack_require__.x (only before)";
+
+/**
+ * global callback functions for installing chunks
+ */
+exports.chunkCallback = "webpackChunk";
+
+/**
+ * method to startup an entrypoint with needed chunks.
+ * Signature: (moduleId: Id, chunkIds: Id[]) => any.
+ * Returns the exports of the module or a Promise
+ */
+exports.startupEntrypoint = "__webpack_require__.X";
+
+/**
+ * register deferred code, which will run when certain
+ * chunks are loaded.
+ * Signature: (chunkIds: Id[], fn: () => any, priority: int >= 0 = 0) => any
+ * Returned value will be returned directly when all chunks are already loaded
+ * When (priority & 1) it will wait for all other handlers with lower priority to
+ * be executed before itself is executed
+ */
+exports.onChunksLoaded = "__webpack_require__.O";
+
+/**
+ * method to install a chunk that was loaded somehow
+ * Signature: ({ id, ids, modules, runtime }) => void
+ */
+exports.externalInstallChunk = "__webpack_require__.C";
+
+/**
+ * interceptor for module executions
+ */
+exports.interceptModuleExecution = "__webpack_require__.i";
+
+/**
+ * the global object
+ */
+exports.global = "__webpack_require__.g";
+
+/**
+ * an object with all share scopes
+ */
+exports.shareScopeMap = "__webpack_require__.S";
+
+/**
+ * The sharing init sequence function (only runs once per share scope).
+ * Has one argument, the name of the share scope.
+ * Creates a share scope if not existing
+ */
+exports.initializeSharing = "__webpack_require__.I";
+
+/**
+ * The current scope when getting a module from a remote
+ */
+exports.currentRemoteGetScope = "__webpack_require__.R";
+
+/**
+ * the filename of the HMR manifest
+ */
+exports.getUpdateManifestFilename = "__webpack_require__.hmrF";
+
+/**
+ * function downloading the update manifest
+ */
+exports.hmrDownloadManifest = "__webpack_require__.hmrM";
+
+/**
+ * array with handler functions to download chunk updates
+ */
+exports.hmrDownloadUpdateHandlers = "__webpack_require__.hmrC";
+
+/**
+ * object with all hmr module data for all modules
+ */
+exports.hmrModuleData = "__webpack_require__.hmrD";
+
+/**
+ * array with handler functions when a module should be invalidated
+ */
+exports.hmrInvalidateModuleHandlers = "__webpack_require__.hmrI";
+
+/**
+ * the prefix for storing state of runtime modules when hmr is enabled
+ */
+exports.hmrRuntimeStatePrefix = "__webpack_require__.hmrS";
+
+/**
+ * the AMD define function
+ */
+exports.amdDefine = "__webpack_require__.amdD";
+
+/**
+ * the AMD options
+ */
+exports.amdOptions = "__webpack_require__.amdO";
+
+/**
+ * the System polyfill object
+ */
+exports.system = "__webpack_require__.System";
+
+/**
+ * the shorthand for Object.prototype.hasOwnProperty
+ * using of it decreases the compiled bundle size
+ */
+exports.hasOwnProperty = "__webpack_require__.o";
+
+/**
+ * the System.register context object
+ */
+exports.systemContext = "__webpack_require__.y";
+
+/**
+ * the baseURI of current document
+ */
+exports.baseURI = "__webpack_require__.b";
+
+/**
+ * a RelativeURL class when relative URLs are used
+ */
+exports.relativeUrl = "__webpack_require__.U";
+
+/**
+ * Creates an async module. The body function must be a async function.
+ * "module.exports" will be decorated with an AsyncModulePromise.
+ * The body function will be called.
+ * To handle async dependencies correctly do this: "([a, b, c] = await handleDependencies([a, b, c]));".
+ * If "hasAwaitAfterDependencies" is truthy, "handleDependencies()" must be called at the end of the body function.
+ * Signature: function(
+ * module: Module,
+ * body: (handleDependencies: (deps: AsyncModulePromise[]) => Promise<any[]> & () => void,
+ * hasAwaitAfterDependencies?: boolean
+ * ) => void
+ */
+exports.asyncModule = "__webpack_require__.a";
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeModule.js
new file mode 100644
index 0000000..9c955d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeModule.js
@@ -0,0 +1,213 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const OriginalSource = require("webpack-sources").OriginalSource;
+const Module = require("./Module");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("./Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("./Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("./Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("./WebpackError")} WebpackError */
+/** @typedef {import("./util/Hash")} Hash */
+/** @typedef {import("./util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["runtime"]);
+
+class RuntimeModule extends Module {
+	/**
+	 * @param {string} name a readable name
+	 * @param {number=} stage an optional stage
+	 */
+	constructor(name, stage = 0) {
+		super("runtime");
+		this.name = name;
+		this.stage = stage;
+		this.buildMeta = {};
+		this.buildInfo = {};
+		/** @type {Compilation} */
+		this.compilation = undefined;
+		/** @type {Chunk} */
+		this.chunk = undefined;
+		/** @type {ChunkGraph} */
+		this.chunkGraph = undefined;
+		this.fullHash = false;
+		this.dependentHash = false;
+		/** @type {string} */
+		this._cachedGeneratedCode = undefined;
+	}
+
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @param {Chunk} chunk the chunk
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @returns {void}
+	 */
+	attach(compilation, chunk, chunkGraph = compilation.chunkGraph) {
+		this.compilation = compilation;
+		this.chunk = chunk;
+		this.chunkGraph = chunkGraph;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return `webpack/runtime/${this.name}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return `webpack/runtime/${this.name}`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		return callback(null, false);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		// do nothing
+		// should not be called as runtime modules are added later to the compilation
+		callback();
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		hash.update(this.name);
+		hash.update(`${this.stage}`);
+		try {
+			if (this.fullHash || this.dependentHash) {
+				// Do not use getGeneratedCode here, because i. e. compilation hash might be not
+				// ready at this point. We will cache it later instead.
+				hash.update(this.generate());
+			} else {
+				hash.update(this.getGeneratedCode());
+			}
+		} catch (err) {
+			hash.update(err.message);
+		}
+		super.updateHash(hash, context);
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration(context) {
+		const sources = new Map();
+		const generatedCode = this.getGeneratedCode();
+		if (generatedCode) {
+			sources.set(
+				"runtime",
+				this.useSourceMap || this.useSimpleSourceMap
+					? new OriginalSource(generatedCode, this.identifier())
+					: new RawSource(generatedCode)
+			);
+		}
+		return {
+			sources,
+			runtimeRequirements: null
+		};
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		try {
+			const source = this.getGeneratedCode();
+			return source ? source.length : 0;
+		} catch (e) {
+			return 0;
+		}
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const AbstractMethodError = require("./AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	getGeneratedCode() {
+		if (this._cachedGeneratedCode) {
+			return this._cachedGeneratedCode;
+		}
+		return (this._cachedGeneratedCode = this.generate());
+	}
+
+	/**
+	 * @returns {boolean} true, if the runtime module should get it's own scope
+	 */
+	shouldIsolate() {
+		return true;
+	}
+}
+
+/**
+ * Runtime modules without any dependencies to other runtime modules
+ */
+RuntimeModule.STAGE_NORMAL = 0;
+
+/**
+ * Runtime modules with simple dependencies on other runtime modules
+ */
+RuntimeModule.STAGE_BASIC = 5;
+
+/**
+ * Runtime modules which attach to handlers of other runtime modules
+ */
+RuntimeModule.STAGE_ATTACH = 10;
+
+/**
+ * Runtime modules which trigger actions on bootstrap
+ */
+RuntimeModule.STAGE_TRIGGER = 20;
+
+module.exports = RuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimePlugin.js
new file mode 100644
index 0000000..6d33a8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimePlugin.js
@@ -0,0 +1,444 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("./RuntimeGlobals");
+const { getChunkFilenameTemplate } = require("./css/CssModulesPlugin");
+const RuntimeRequirementsDependency = require("./dependencies/RuntimeRequirementsDependency");
+const JavascriptModulesPlugin = require("./javascript/JavascriptModulesPlugin");
+const AsyncModuleRuntimeModule = require("./runtime/AsyncModuleRuntimeModule");
+const AutoPublicPathRuntimeModule = require("./runtime/AutoPublicPathRuntimeModule");
+const CompatGetDefaultExportRuntimeModule = require("./runtime/CompatGetDefaultExportRuntimeModule");
+const CompatRuntimeModule = require("./runtime/CompatRuntimeModule");
+const CreateFakeNamespaceObjectRuntimeModule = require("./runtime/CreateFakeNamespaceObjectRuntimeModule");
+const CreateScriptRuntimeModule = require("./runtime/CreateScriptRuntimeModule");
+const CreateScriptUrlRuntimeModule = require("./runtime/CreateScriptUrlRuntimeModule");
+const DefinePropertyGettersRuntimeModule = require("./runtime/DefinePropertyGettersRuntimeModule");
+const EnsureChunkRuntimeModule = require("./runtime/EnsureChunkRuntimeModule");
+const GetChunkFilenameRuntimeModule = require("./runtime/GetChunkFilenameRuntimeModule");
+const GetMainFilenameRuntimeModule = require("./runtime/GetMainFilenameRuntimeModule");
+const GetTrustedTypesPolicyRuntimeModule = require("./runtime/GetTrustedTypesPolicyRuntimeModule");
+const GlobalRuntimeModule = require("./runtime/GlobalRuntimeModule");
+const HasOwnPropertyRuntimeModule = require("./runtime/HasOwnPropertyRuntimeModule");
+const LoadScriptRuntimeModule = require("./runtime/LoadScriptRuntimeModule");
+const MakeNamespaceObjectRuntimeModule = require("./runtime/MakeNamespaceObjectRuntimeModule");
+const OnChunksLoadedRuntimeModule = require("./runtime/OnChunksLoadedRuntimeModule");
+const PublicPathRuntimeModule = require("./runtime/PublicPathRuntimeModule");
+const RelativeUrlRuntimeModule = require("./runtime/RelativeUrlRuntimeModule");
+const RuntimeIdRuntimeModule = require("./runtime/RuntimeIdRuntimeModule");
+const SystemContextRuntimeModule = require("./runtime/SystemContextRuntimeModule");
+const ShareRuntimeModule = require("./sharing/ShareRuntimeModule");
+const StringXor = require("./util/StringXor");
+
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Module")} Module */
+
+const GLOBALS_ON_REQUIRE = [
+	RuntimeGlobals.chunkName,
+	RuntimeGlobals.runtimeId,
+	RuntimeGlobals.compatGetDefaultExport,
+	RuntimeGlobals.createFakeNamespaceObject,
+	RuntimeGlobals.createScript,
+	RuntimeGlobals.createScriptUrl,
+	RuntimeGlobals.getTrustedTypesPolicy,
+	RuntimeGlobals.definePropertyGetters,
+	RuntimeGlobals.ensureChunk,
+	RuntimeGlobals.entryModuleId,
+	RuntimeGlobals.getFullHash,
+	RuntimeGlobals.global,
+	RuntimeGlobals.makeNamespaceObject,
+	RuntimeGlobals.moduleCache,
+	RuntimeGlobals.moduleFactories,
+	RuntimeGlobals.moduleFactoriesAddOnly,
+	RuntimeGlobals.interceptModuleExecution,
+	RuntimeGlobals.publicPath,
+	RuntimeGlobals.baseURI,
+	RuntimeGlobals.relativeUrl,
+	RuntimeGlobals.scriptNonce,
+	RuntimeGlobals.uncaughtErrorHandler,
+	RuntimeGlobals.asyncModule,
+	RuntimeGlobals.wasmInstances,
+	RuntimeGlobals.instantiateWasm,
+	RuntimeGlobals.shareScopeMap,
+	RuntimeGlobals.initializeSharing,
+	RuntimeGlobals.loadScript,
+	RuntimeGlobals.systemContext,
+	RuntimeGlobals.onChunksLoaded
+];
+
+const MODULE_DEPENDENCIES = {
+	[RuntimeGlobals.moduleLoaded]: [RuntimeGlobals.module],
+	[RuntimeGlobals.moduleId]: [RuntimeGlobals.module]
+};
+
+const TREE_DEPENDENCIES = {
+	[RuntimeGlobals.definePropertyGetters]: [RuntimeGlobals.hasOwnProperty],
+	[RuntimeGlobals.compatGetDefaultExport]: [
+		RuntimeGlobals.definePropertyGetters
+	],
+	[RuntimeGlobals.createFakeNamespaceObject]: [
+		RuntimeGlobals.definePropertyGetters,
+		RuntimeGlobals.makeNamespaceObject,
+		RuntimeGlobals.require
+	],
+	[RuntimeGlobals.initializeSharing]: [RuntimeGlobals.shareScopeMap],
+	[RuntimeGlobals.shareScopeMap]: [RuntimeGlobals.hasOwnProperty]
+};
+
+class RuntimePlugin {
+	/**
+	 * @param {Compiler} compiler the Compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("RuntimePlugin", compilation => {
+			compilation.dependencyTemplates.set(
+				RuntimeRequirementsDependency,
+				new RuntimeRequirementsDependency.Template()
+			);
+			for (const req of GLOBALS_ON_REQUIRE) {
+				compilation.hooks.runtimeRequirementInModule
+					.for(req)
+					.tap("RuntimePlugin", (module, set) => {
+						set.add(RuntimeGlobals.requireScope);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(req)
+					.tap("RuntimePlugin", (module, set) => {
+						set.add(RuntimeGlobals.requireScope);
+					});
+			}
+			for (const req of Object.keys(TREE_DEPENDENCIES)) {
+				const deps = TREE_DEPENDENCIES[req];
+				compilation.hooks.runtimeRequirementInTree
+					.for(req)
+					.tap("RuntimePlugin", (chunk, set) => {
+						for (const dep of deps) set.add(dep);
+					});
+			}
+			for (const req of Object.keys(MODULE_DEPENDENCIES)) {
+				const deps = MODULE_DEPENDENCIES[req];
+				compilation.hooks.runtimeRequirementInModule
+					.for(req)
+					.tap("RuntimePlugin", (chunk, set) => {
+						for (const dep of deps) set.add(dep);
+					});
+			}
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.definePropertyGetters)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(
+						chunk,
+						new DefinePropertyGettersRuntimeModule()
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.makeNamespaceObject)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(
+						chunk,
+						new MakeNamespaceObjectRuntimeModule()
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.createFakeNamespaceObject)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(
+						chunk,
+						new CreateFakeNamespaceObjectRuntimeModule()
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.hasOwnProperty)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(
+						chunk,
+						new HasOwnPropertyRuntimeModule()
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.compatGetDefaultExport)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(
+						chunk,
+						new CompatGetDefaultExportRuntimeModule()
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.runtimeId)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(chunk, new RuntimeIdRuntimeModule());
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.publicPath)
+				.tap("RuntimePlugin", (chunk, set) => {
+					const { outputOptions } = compilation;
+					const { publicPath: globalPublicPath, scriptType } = outputOptions;
+					const entryOptions = chunk.getEntryOptions();
+					const publicPath =
+						entryOptions && entryOptions.publicPath !== undefined
+							? entryOptions.publicPath
+							: globalPublicPath;
+
+					if (publicPath === "auto") {
+						const module = new AutoPublicPathRuntimeModule();
+						if (scriptType !== "module") set.add(RuntimeGlobals.global);
+						compilation.addRuntimeModule(chunk, module);
+					} else {
+						const module = new PublicPathRuntimeModule(publicPath);
+
+						if (
+							typeof publicPath !== "string" ||
+							/\[(full)?hash\]/.test(publicPath)
+						) {
+							module.fullHash = true;
+						}
+
+						compilation.addRuntimeModule(chunk, module);
+					}
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.global)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(chunk, new GlobalRuntimeModule());
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.asyncModule)
+				.tap("RuntimePlugin", chunk => {
+					compilation.addRuntimeModule(chunk, new AsyncModuleRuntimeModule());
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.systemContext)
+				.tap("RuntimePlugin", chunk => {
+					const { outputOptions } = compilation;
+					const { library: globalLibrary } = outputOptions;
+					const entryOptions = chunk.getEntryOptions();
+					const libraryType =
+						entryOptions && entryOptions.library !== undefined
+							? entryOptions.library.type
+							: globalLibrary.type;
+
+					if (libraryType === "system") {
+						compilation.addRuntimeModule(
+							chunk,
+							new SystemContextRuntimeModule()
+						);
+					}
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.getChunkScriptFilename)
+				.tap("RuntimePlugin", (chunk, set) => {
+					if (
+						typeof compilation.outputOptions.chunkFilename === "string" &&
+						/\[(full)?hash(:\d+)?\]/.test(
+							compilation.outputOptions.chunkFilename
+						)
+					) {
+						set.add(RuntimeGlobals.getFullHash);
+					}
+					compilation.addRuntimeModule(
+						chunk,
+						new GetChunkFilenameRuntimeModule(
+							"javascript",
+							"javascript",
+							RuntimeGlobals.getChunkScriptFilename,
+							chunk =>
+								chunk.filenameTemplate ||
+								(chunk.canBeInitial()
+									? compilation.outputOptions.filename
+									: compilation.outputOptions.chunkFilename),
+							false
+						)
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.getChunkCssFilename)
+				.tap("RuntimePlugin", (chunk, set) => {
+					if (
+						typeof compilation.outputOptions.cssChunkFilename === "string" &&
+						/\[(full)?hash(:\d+)?\]/.test(
+							compilation.outputOptions.cssChunkFilename
+						)
+					) {
+						set.add(RuntimeGlobals.getFullHash);
+					}
+					compilation.addRuntimeModule(
+						chunk,
+						new GetChunkFilenameRuntimeModule(
+							"css",
+							"css",
+							RuntimeGlobals.getChunkCssFilename,
+							chunk =>
+								getChunkFilenameTemplate(chunk, compilation.outputOptions),
+							set.has(RuntimeGlobals.hmrDownloadUpdateHandlers)
+						)
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.getChunkUpdateScriptFilename)
+				.tap("RuntimePlugin", (chunk, set) => {
+					if (
+						/\[(full)?hash(:\d+)?\]/.test(
+							compilation.outputOptions.hotUpdateChunkFilename
+						)
+					)
+						set.add(RuntimeGlobals.getFullHash);
+					compilation.addRuntimeModule(
+						chunk,
+						new GetChunkFilenameRuntimeModule(
+							"javascript",
+							"javascript update",
+							RuntimeGlobals.getChunkUpdateScriptFilename,
+							c => compilation.outputOptions.hotUpdateChunkFilename,
+							true
+						)
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.getUpdateManifestFilename)
+				.tap("RuntimePlugin", (chunk, set) => {
+					if (
+						/\[(full)?hash(:\d+)?\]/.test(
+							compilation.outputOptions.hotUpdateMainFilename
+						)
+					) {
+						set.add(RuntimeGlobals.getFullHash);
+					}
+					compilation.addRuntimeModule(
+						chunk,
+						new GetMainFilenameRuntimeModule(
+							"update manifest",
+							RuntimeGlobals.getUpdateManifestFilename,
+							compilation.outputOptions.hotUpdateMainFilename
+						)
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.ensureChunk)
+				.tap("RuntimePlugin", (chunk, set) => {
+					const hasAsyncChunks = chunk.hasAsyncChunks();
+					if (hasAsyncChunks) {
+						set.add(RuntimeGlobals.ensureChunkHandlers);
+					}
+					compilation.addRuntimeModule(
+						chunk,
+						new EnsureChunkRuntimeModule(set)
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.ensureChunkIncludeEntries)
+				.tap("RuntimePlugin", (chunk, set) => {
+					set.add(RuntimeGlobals.ensureChunkHandlers);
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.shareScopeMap)
+				.tap("RuntimePlugin", (chunk, set) => {
+					compilation.addRuntimeModule(chunk, new ShareRuntimeModule());
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.loadScript)
+				.tap("RuntimePlugin", (chunk, set) => {
+					const withCreateScriptUrl = !!compilation.outputOptions.trustedTypes;
+					if (withCreateScriptUrl) {
+						set.add(RuntimeGlobals.createScriptUrl);
+					}
+					compilation.addRuntimeModule(
+						chunk,
+						new LoadScriptRuntimeModule(withCreateScriptUrl)
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.createScript)
+				.tap("RuntimePlugin", (chunk, set) => {
+					if (compilation.outputOptions.trustedTypes) {
+						set.add(RuntimeGlobals.getTrustedTypesPolicy);
+					}
+					compilation.addRuntimeModule(chunk, new CreateScriptRuntimeModule());
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.createScriptUrl)
+				.tap("RuntimePlugin", (chunk, set) => {
+					if (compilation.outputOptions.trustedTypes) {
+						set.add(RuntimeGlobals.getTrustedTypesPolicy);
+					}
+					compilation.addRuntimeModule(
+						chunk,
+						new CreateScriptUrlRuntimeModule()
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.getTrustedTypesPolicy)
+				.tap("RuntimePlugin", (chunk, set) => {
+					compilation.addRuntimeModule(
+						chunk,
+						new GetTrustedTypesPolicyRuntimeModule(set)
+					);
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.relativeUrl)
+				.tap("RuntimePlugin", (chunk, set) => {
+					compilation.addRuntimeModule(chunk, new RelativeUrlRuntimeModule());
+					return true;
+				});
+			compilation.hooks.runtimeRequirementInTree
+				.for(RuntimeGlobals.onChunksLoaded)
+				.tap("RuntimePlugin", (chunk, set) => {
+					compilation.addRuntimeModule(
+						chunk,
+						new OnChunksLoadedRuntimeModule()
+					);
+					return true;
+				});
+			// TODO webpack 6: remove CompatRuntimeModule
+			compilation.hooks.additionalTreeRuntimeRequirements.tap(
+				"RuntimePlugin",
+				(chunk, set) => {
+					const { mainTemplate } = compilation;
+					if (
+						mainTemplate.hooks.bootstrap.isUsed() ||
+						mainTemplate.hooks.localVars.isUsed() ||
+						mainTemplate.hooks.requireEnsure.isUsed() ||
+						mainTemplate.hooks.requireExtensions.isUsed()
+					) {
+						compilation.addRuntimeModule(chunk, new CompatRuntimeModule());
+					}
+				}
+			);
+			JavascriptModulesPlugin.getCompilationHooks(compilation).chunkHash.tap(
+				"RuntimePlugin",
+				(chunk, hash, { chunkGraph }) => {
+					const xor = new StringXor();
+					for (const m of chunkGraph.getChunkRuntimeModulesIterable(chunk)) {
+						xor.add(chunkGraph.getModuleHash(m, chunk.runtime));
+					}
+					xor.updateHash(hash);
+				}
+			);
+		});
+	}
+}
+module.exports = RuntimePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeTemplate.js b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeTemplate.js
new file mode 100644
index 0000000..b5a3e31
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/RuntimeTemplate.js
@@ -0,0 +1,1041 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const InitFragment = require("./InitFragment");
+const RuntimeGlobals = require("./RuntimeGlobals");
+const Template = require("./Template");
+const { equals } = require("./util/ArrayHelpers");
+const compileBooleanMatcher = require("./util/compileBooleanMatcher");
+const propertyAccess = require("./util/propertyAccess");
+const { forEachRuntime, subtractRuntime } = require("./util/runtime");
+
+/** @typedef {import("../declarations/WebpackOptions").OutputNormalized} OutputOptions */
+/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./RequestShortener")} RequestShortener */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @param {Module} module the module
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @returns {string} error message
+ */
+const noModuleIdErrorMessage = (module, chunkGraph) => {
+	return `Module ${module.identifier()} has no id assigned.
+This should not happen.
+It's in these chunks: ${
+		Array.from(
+			chunkGraph.getModuleChunksIterable(module),
+			c => c.name || c.id || c.debugId
+		).join(", ") || "none"
+	} (If module is in no chunk this indicates a bug in some chunk/module optimization logic)
+Module has these incoming connections: ${Array.from(
+		chunkGraph.moduleGraph.getIncomingConnections(module),
+		connection =>
+			`\n - ${
+				connection.originModule && connection.originModule.identifier()
+			} ${connection.dependency && connection.dependency.type} ${
+				(connection.explanations &&
+					Array.from(connection.explanations).join(", ")) ||
+				""
+			}`
+	).join("")}`;
+};
+
+/**
+ * @param {string|undefined} definition global object definition
+ * @returns {string} save to use global object
+ */
+function getGlobalObject(definition) {
+	if (!definition) return definition;
+	const trimmed = definition.trim();
+
+	if (
+		// identifier, we do not need real identifier regarding ECMAScript/Unicode
+		trimmed.match(/^[_\p{L}][_0-9\p{L}]*$/iu) ||
+		// iife
+		// call expression
+		// expression in parentheses
+		trimmed.match(/^([_\p{L}][_0-9\p{L}]*)?\(.*\)$/iu)
+	)
+		return trimmed;
+
+	return `Object(${trimmed})`;
+}
+
+class RuntimeTemplate {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @param {OutputOptions} outputOptions the compilation output options
+	 * @param {RequestShortener} requestShortener the request shortener
+	 */
+	constructor(compilation, outputOptions, requestShortener) {
+		this.compilation = compilation;
+		this.outputOptions = outputOptions || {};
+		this.requestShortener = requestShortener;
+		this.globalObject = getGlobalObject(outputOptions.globalObject);
+		this.contentHashReplacement = "X".repeat(outputOptions.hashDigestLength);
+	}
+
+	isIIFE() {
+		return this.outputOptions.iife;
+	}
+
+	isModule() {
+		return this.outputOptions.module;
+	}
+
+	supportsConst() {
+		return this.outputOptions.environment.const;
+	}
+
+	supportsArrowFunction() {
+		return this.outputOptions.environment.arrowFunction;
+	}
+
+	supportsOptionalChaining() {
+		return this.outputOptions.environment.optionalChaining;
+	}
+
+	supportsForOf() {
+		return this.outputOptions.environment.forOf;
+	}
+
+	supportsDestructuring() {
+		return this.outputOptions.environment.destructuring;
+	}
+
+	supportsBigIntLiteral() {
+		return this.outputOptions.environment.bigIntLiteral;
+	}
+
+	supportsDynamicImport() {
+		return this.outputOptions.environment.dynamicImport;
+	}
+
+	supportsEcmaScriptModuleSyntax() {
+		return this.outputOptions.environment.module;
+	}
+
+	supportTemplateLiteral() {
+		return this.outputOptions.environment.templateLiteral;
+	}
+
+	returningFunction(returnValue, args = "") {
+		return this.supportsArrowFunction()
+			? `(${args}) => (${returnValue})`
+			: `function(${args}) { return ${returnValue}; }`;
+	}
+
+	basicFunction(args, body) {
+		return this.supportsArrowFunction()
+			? `(${args}) => {\n${Template.indent(body)}\n}`
+			: `function(${args}) {\n${Template.indent(body)}\n}`;
+	}
+
+	/**
+	 * @param {Array<string|{expr: string}>} args args
+	 * @returns {string} result expression
+	 */
+	concatenation(...args) {
+		const len = args.length;
+
+		if (len === 2) return this._es5Concatenation(args);
+		if (len === 0) return '""';
+		if (len === 1) {
+			return typeof args[0] === "string"
+				? JSON.stringify(args[0])
+				: `"" + ${args[0].expr}`;
+		}
+		if (!this.supportTemplateLiteral()) return this._es5Concatenation(args);
+
+		// cost comparison between template literal and concatenation:
+		// both need equal surroundings: `xxx` vs "xxx"
+		// template literal has constant cost of 3 chars for each expression
+		// es5 concatenation has cost of 3 + n chars for n expressions in row
+		// when a es5 concatenation ends with an expression it reduces cost by 3
+		// when a es5 concatenation starts with an single expression it reduces cost by 3
+		// e. g. `${a}${b}${c}` (3*3 = 9) is longer than ""+a+b+c ((3+3)-3 = 3)
+		// e. g. `x${a}x${b}x${c}x` (3*3 = 9) is shorter than "x"+a+"x"+b+"x"+c+"x" (4+4+4 = 12)
+
+		let templateCost = 0;
+		let concatenationCost = 0;
+
+		let lastWasExpr = false;
+		for (const arg of args) {
+			const isExpr = typeof arg !== "string";
+			if (isExpr) {
+				templateCost += 3;
+				concatenationCost += lastWasExpr ? 1 : 4;
+			}
+			lastWasExpr = isExpr;
+		}
+		if (lastWasExpr) concatenationCost -= 3;
+		if (typeof args[0] !== "string" && typeof args[1] === "string")
+			concatenationCost -= 3;
+
+		if (concatenationCost <= templateCost) return this._es5Concatenation(args);
+
+		return `\`${args
+			.map(arg => (typeof arg === "string" ? arg : `\${${arg.expr}}`))
+			.join("")}\``;
+	}
+
+	/**
+	 * @param {Array<string|{expr: string}>} args args (len >= 2)
+	 * @returns {string} result expression
+	 * @private
+	 */
+	_es5Concatenation(args) {
+		const str = args
+			.map(arg => (typeof arg === "string" ? JSON.stringify(arg) : arg.expr))
+			.join(" + ");
+
+		// when the first two args are expression, we need to prepend "" + to force string
+		// concatenation instead of number addition.
+		return typeof args[0] !== "string" && typeof args[1] !== "string"
+			? `"" + ${str}`
+			: str;
+	}
+
+	expressionFunction(expression, args = "") {
+		return this.supportsArrowFunction()
+			? `(${args}) => (${expression})`
+			: `function(${args}) { ${expression}; }`;
+	}
+
+	emptyFunction() {
+		return this.supportsArrowFunction() ? "x => {}" : "function() {}";
+	}
+
+	destructureArray(items, value) {
+		return this.supportsDestructuring()
+			? `var [${items.join(", ")}] = ${value};`
+			: Template.asString(
+					items.map((item, i) => `var ${item} = ${value}[${i}];`)
+			  );
+	}
+
+	destructureObject(items, value) {
+		return this.supportsDestructuring()
+			? `var {${items.join(", ")}} = ${value};`
+			: Template.asString(
+					items.map(item => `var ${item} = ${value}${propertyAccess([item])};`)
+			  );
+	}
+
+	iife(args, body) {
+		return `(${this.basicFunction(args, body)})()`;
+	}
+
+	forEach(variable, array, body) {
+		return this.supportsForOf()
+			? `for(const ${variable} of ${array}) {\n${Template.indent(body)}\n}`
+			: `${array}.forEach(function(${variable}) {\n${Template.indent(
+					body
+			  )}\n});`;
+	}
+
+	/**
+	 * Add a comment
+	 * @param {object} options Information content of the comment
+	 * @param {string=} options.request request string used originally
+	 * @param {string=} options.chunkName name of the chunk referenced
+	 * @param {string=} options.chunkReason reason information of the chunk
+	 * @param {string=} options.message additional message
+	 * @param {string=} options.exportName name of the export
+	 * @returns {string} comment
+	 */
+	comment({ request, chunkName, chunkReason, message, exportName }) {
+		let content;
+		if (this.outputOptions.pathinfo) {
+			content = [message, request, chunkName, chunkReason]
+				.filter(Boolean)
+				.map(item => this.requestShortener.shorten(item))
+				.join(" | ");
+		} else {
+			content = [message, chunkName, chunkReason]
+				.filter(Boolean)
+				.map(item => this.requestShortener.shorten(item))
+				.join(" | ");
+		}
+		if (!content) return "";
+		if (this.outputOptions.pathinfo) {
+			return Template.toComment(content) + " ";
+		} else {
+			return Template.toNormalComment(content) + " ";
+		}
+	}
+
+	/**
+	 * @param {object} options generation options
+	 * @param {string=} options.request request string used originally
+	 * @returns {string} generated error block
+	 */
+	throwMissingModuleErrorBlock({ request }) {
+		const err = `Cannot find module '${request}'`;
+		return `var e = new Error(${JSON.stringify(
+			err
+		)}); e.code = 'MODULE_NOT_FOUND'; throw e;`;
+	}
+
+	/**
+	 * @param {object} options generation options
+	 * @param {string=} options.request request string used originally
+	 * @returns {string} generated error function
+	 */
+	throwMissingModuleErrorFunction({ request }) {
+		return `function webpackMissingModule() { ${this.throwMissingModuleErrorBlock(
+			{ request }
+		)} }`;
+	}
+
+	/**
+	 * @param {object} options generation options
+	 * @param {string=} options.request request string used originally
+	 * @returns {string} generated error IIFE
+	 */
+	missingModule({ request }) {
+		return `Object(${this.throwMissingModuleErrorFunction({ request })}())`;
+	}
+
+	/**
+	 * @param {object} options generation options
+	 * @param {string=} options.request request string used originally
+	 * @returns {string} generated error statement
+	 */
+	missingModuleStatement({ request }) {
+		return `${this.missingModule({ request })};\n`;
+	}
+
+	/**
+	 * @param {object} options generation options
+	 * @param {string=} options.request request string used originally
+	 * @returns {string} generated error code
+	 */
+	missingModulePromise({ request }) {
+		return `Promise.resolve().then(${this.throwMissingModuleErrorFunction({
+			request
+		})})`;
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {Module} options.module the module
+	 * @param {string} options.request the request that should be printed as comment
+	 * @param {string=} options.idExpr expression to use as id expression
+	 * @param {"expression" | "promise" | "statements"} options.type which kind of code should be returned
+	 * @returns {string} the code
+	 */
+	weakError({ module, chunkGraph, request, idExpr, type }) {
+		const moduleId = chunkGraph.getModuleId(module);
+		const errorMessage =
+			moduleId === null
+				? JSON.stringify("Module is not available (weak dependency)")
+				: idExpr
+				? `"Module '" + ${idExpr} + "' is not available (weak dependency)"`
+				: JSON.stringify(
+						`Module '${moduleId}' is not available (weak dependency)`
+				  );
+		const comment = request ? Template.toNormalComment(request) + " " : "";
+		const errorStatements =
+			`var e = new Error(${errorMessage}); ` +
+			comment +
+			"e.code = 'MODULE_NOT_FOUND'; throw e;";
+		switch (type) {
+			case "statements":
+				return errorStatements;
+			case "promise":
+				return `Promise.resolve().then(${this.basicFunction(
+					"",
+					errorStatements
+				)})`;
+			case "expression":
+				return this.iife("", errorStatements);
+		}
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {Module} options.module the module
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {string} options.request the request that should be printed as comment
+	 * @param {boolean=} options.weak if the dependency is weak (will create a nice error message)
+	 * @returns {string} the expression
+	 */
+	moduleId({ module, chunkGraph, request, weak }) {
+		if (!module) {
+			return this.missingModule({
+				request
+			});
+		}
+		const moduleId = chunkGraph.getModuleId(module);
+		if (moduleId === null) {
+			if (weak) {
+				return "null /* weak dependency, without id */";
+			}
+			throw new Error(
+				`RuntimeTemplate.moduleId(): ${noModuleIdErrorMessage(
+					module,
+					chunkGraph
+				)}`
+			);
+		}
+		return `${this.comment({ request })}${JSON.stringify(moduleId)}`;
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {Module} options.module the module
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {string} options.request the request that should be printed as comment
+	 * @param {boolean=} options.weak if the dependency is weak (will create a nice error message)
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} the expression
+	 */
+	moduleRaw({ module, chunkGraph, request, weak, runtimeRequirements }) {
+		if (!module) {
+			return this.missingModule({
+				request
+			});
+		}
+		const moduleId = chunkGraph.getModuleId(module);
+		if (moduleId === null) {
+			if (weak) {
+				// only weak referenced modules don't get an id
+				// we can always emit an error emitting code here
+				return this.weakError({
+					module,
+					chunkGraph,
+					request,
+					type: "expression"
+				});
+			}
+			throw new Error(
+				`RuntimeTemplate.moduleId(): ${noModuleIdErrorMessage(
+					module,
+					chunkGraph
+				)}`
+			);
+		}
+		runtimeRequirements.add(RuntimeGlobals.require);
+		return `__webpack_require__(${this.moduleId({
+			module,
+			chunkGraph,
+			request,
+			weak
+		})})`;
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {Module} options.module the module
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {string} options.request the request that should be printed as comment
+	 * @param {boolean=} options.weak if the dependency is weak (will create a nice error message)
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} the expression
+	 */
+	moduleExports({ module, chunkGraph, request, weak, runtimeRequirements }) {
+		return this.moduleRaw({
+			module,
+			chunkGraph,
+			request,
+			weak,
+			runtimeRequirements
+		});
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {Module} options.module the module
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {string} options.request the request that should be printed as comment
+	 * @param {boolean=} options.strict if the current module is in strict esm mode
+	 * @param {boolean=} options.weak if the dependency is weak (will create a nice error message)
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} the expression
+	 */
+	moduleNamespace({
+		module,
+		chunkGraph,
+		request,
+		strict,
+		weak,
+		runtimeRequirements
+	}) {
+		if (!module) {
+			return this.missingModule({
+				request
+			});
+		}
+		if (chunkGraph.getModuleId(module) === null) {
+			if (weak) {
+				// only weak referenced modules don't get an id
+				// we can always emit an error emitting code here
+				return this.weakError({
+					module,
+					chunkGraph,
+					request,
+					type: "expression"
+				});
+			}
+			throw new Error(
+				`RuntimeTemplate.moduleNamespace(): ${noModuleIdErrorMessage(
+					module,
+					chunkGraph
+				)}`
+			);
+		}
+		const moduleId = this.moduleId({
+			module,
+			chunkGraph,
+			request,
+			weak
+		});
+		const exportsType = module.getExportsType(chunkGraph.moduleGraph, strict);
+		switch (exportsType) {
+			case "namespace":
+				return this.moduleRaw({
+					module,
+					chunkGraph,
+					request,
+					weak,
+					runtimeRequirements
+				});
+			case "default-with-named":
+				runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+				return `${RuntimeGlobals.createFakeNamespaceObject}(${moduleId}, 3)`;
+			case "default-only":
+				runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+				return `${RuntimeGlobals.createFakeNamespaceObject}(${moduleId}, 1)`;
+			case "dynamic":
+				runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+				return `${RuntimeGlobals.createFakeNamespaceObject}(${moduleId}, 7)`;
+		}
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {AsyncDependenciesBlock=} options.block the current dependencies block
+	 * @param {Module} options.module the module
+	 * @param {string} options.request the request that should be printed as comment
+	 * @param {string} options.message a message for the comment
+	 * @param {boolean=} options.strict if the current module is in strict esm mode
+	 * @param {boolean=} options.weak if the dependency is weak (will create a nice error message)
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} the promise expression
+	 */
+	moduleNamespacePromise({
+		chunkGraph,
+		block,
+		module,
+		request,
+		message,
+		strict,
+		weak,
+		runtimeRequirements
+	}) {
+		if (!module) {
+			return this.missingModulePromise({
+				request
+			});
+		}
+		const moduleId = chunkGraph.getModuleId(module);
+		if (moduleId === null) {
+			if (weak) {
+				// only weak referenced modules don't get an id
+				// we can always emit an error emitting code here
+				return this.weakError({
+					module,
+					chunkGraph,
+					request,
+					type: "promise"
+				});
+			}
+			throw new Error(
+				`RuntimeTemplate.moduleNamespacePromise(): ${noModuleIdErrorMessage(
+					module,
+					chunkGraph
+				)}`
+			);
+		}
+		const promise = this.blockPromise({
+			chunkGraph,
+			block,
+			message,
+			runtimeRequirements
+		});
+
+		let appending;
+		let idExpr = JSON.stringify(chunkGraph.getModuleId(module));
+		const comment = this.comment({
+			request
+		});
+		let header = "";
+		if (weak) {
+			if (idExpr.length > 8) {
+				// 'var x="nnnnnn";x,"+x+",x' vs '"nnnnnn",nnnnnn,"nnnnnn"'
+				header += `var id = ${idExpr}; `;
+				idExpr = "id";
+			}
+			runtimeRequirements.add(RuntimeGlobals.moduleFactories);
+			header += `if(!${
+				RuntimeGlobals.moduleFactories
+			}[${idExpr}]) { ${this.weakError({
+				module,
+				chunkGraph,
+				request,
+				idExpr,
+				type: "statements"
+			})} } `;
+		}
+		const moduleIdExpr = this.moduleId({
+			module,
+			chunkGraph,
+			request,
+			weak
+		});
+		const exportsType = module.getExportsType(chunkGraph.moduleGraph, strict);
+		let fakeType = 16;
+		switch (exportsType) {
+			case "namespace":
+				if (header) {
+					const rawModule = this.moduleRaw({
+						module,
+						chunkGraph,
+						request,
+						weak,
+						runtimeRequirements
+					});
+					appending = `.then(${this.basicFunction(
+						"",
+						`${header}return ${rawModule};`
+					)})`;
+				} else {
+					runtimeRequirements.add(RuntimeGlobals.require);
+					appending = `.then(__webpack_require__.bind(__webpack_require__, ${comment}${idExpr}))`;
+				}
+				break;
+			case "dynamic":
+				fakeType |= 4;
+			/* fall through */
+			case "default-with-named":
+				fakeType |= 2;
+			/* fall through */
+			case "default-only":
+				runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+				if (chunkGraph.moduleGraph.isAsync(module)) {
+					if (header) {
+						const rawModule = this.moduleRaw({
+							module,
+							chunkGraph,
+							request,
+							weak,
+							runtimeRequirements
+						});
+						appending = `.then(${this.basicFunction(
+							"",
+							`${header}return ${rawModule};`
+						)})`;
+					} else {
+						runtimeRequirements.add(RuntimeGlobals.require);
+						appending = `.then(__webpack_require__.bind(__webpack_require__, ${comment}${idExpr}))`;
+					}
+					appending += `.then(${this.returningFunction(
+						`${RuntimeGlobals.createFakeNamespaceObject}(m, ${fakeType})`,
+						"m"
+					)})`;
+				} else {
+					fakeType |= 1;
+					if (header) {
+						const returnExpression = `${RuntimeGlobals.createFakeNamespaceObject}(${moduleIdExpr}, ${fakeType})`;
+						appending = `.then(${this.basicFunction(
+							"",
+							`${header}return ${returnExpression};`
+						)})`;
+					} else {
+						appending = `.then(${RuntimeGlobals.createFakeNamespaceObject}.bind(__webpack_require__, ${comment}${idExpr}, ${fakeType}))`;
+					}
+				}
+				break;
+		}
+
+		return `${promise || "Promise.resolve()"}${appending}`;
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {RuntimeSpec=} options.runtime runtime for which this code will be generated
+	 * @param {RuntimeSpec | boolean=} options.runtimeCondition only execute the statement in some runtimes
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} expression
+	 */
+	runtimeConditionExpression({
+		chunkGraph,
+		runtimeCondition,
+		runtime,
+		runtimeRequirements
+	}) {
+		if (runtimeCondition === undefined) return "true";
+		if (typeof runtimeCondition === "boolean") return `${runtimeCondition}`;
+		/** @type {Set<string>} */
+		const positiveRuntimeIds = new Set();
+		forEachRuntime(runtimeCondition, runtime =>
+			positiveRuntimeIds.add(`${chunkGraph.getRuntimeId(runtime)}`)
+		);
+		/** @type {Set<string>} */
+		const negativeRuntimeIds = new Set();
+		forEachRuntime(subtractRuntime(runtime, runtimeCondition), runtime =>
+			negativeRuntimeIds.add(`${chunkGraph.getRuntimeId(runtime)}`)
+		);
+		runtimeRequirements.add(RuntimeGlobals.runtimeId);
+		return compileBooleanMatcher.fromLists(
+			Array.from(positiveRuntimeIds),
+			Array.from(negativeRuntimeIds)
+		)(RuntimeGlobals.runtimeId);
+	}
+
+	/**
+	 *
+	 * @param {Object} options options object
+	 * @param {boolean=} options.update whether a new variable should be created or the existing one updated
+	 * @param {Module} options.module the module
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {string} options.request the request that should be printed as comment
+	 * @param {string} options.importVar name of the import variable
+	 * @param {Module} options.originModule module in which the statement is emitted
+	 * @param {boolean=} options.weak true, if this is a weak dependency
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {[string, string]} the import statement and the compat statement
+	 */
+	importStatement({
+		update,
+		module,
+		chunkGraph,
+		request,
+		importVar,
+		originModule,
+		weak,
+		runtimeRequirements
+	}) {
+		if (!module) {
+			return [
+				this.missingModuleStatement({
+					request
+				}),
+				""
+			];
+		}
+		if (chunkGraph.getModuleId(module) === null) {
+			if (weak) {
+				// only weak referenced modules don't get an id
+				// we can always emit an error emitting code here
+				return [
+					this.weakError({
+						module,
+						chunkGraph,
+						request,
+						type: "statements"
+					}),
+					""
+				];
+			}
+			throw new Error(
+				`RuntimeTemplate.importStatement(): ${noModuleIdErrorMessage(
+					module,
+					chunkGraph
+				)}`
+			);
+		}
+		const moduleId = this.moduleId({
+			module,
+			chunkGraph,
+			request,
+			weak
+		});
+		const optDeclaration = update ? "" : "var ";
+
+		const exportsType = module.getExportsType(
+			chunkGraph.moduleGraph,
+			originModule.buildMeta.strictHarmonyModule
+		);
+		runtimeRequirements.add(RuntimeGlobals.require);
+		const importContent = `/* harmony import */ ${optDeclaration}${importVar} = __webpack_require__(${moduleId});\n`;
+
+		if (exportsType === "dynamic") {
+			runtimeRequirements.add(RuntimeGlobals.compatGetDefaultExport);
+			return [
+				importContent,
+				`/* harmony import */ ${optDeclaration}${importVar}_default = /*#__PURE__*/${RuntimeGlobals.compatGetDefaultExport}(${importVar});\n`
+			];
+		}
+		return [importContent, ""];
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {ModuleGraph} options.moduleGraph the module graph
+	 * @param {Module} options.module the module
+	 * @param {string} options.request the request
+	 * @param {string | string[]} options.exportName the export name
+	 * @param {Module} options.originModule the origin module
+	 * @param {boolean|undefined} options.asiSafe true, if location is safe for ASI, a bracket can be emitted
+	 * @param {boolean} options.isCall true, if expression will be called
+	 * @param {boolean} options.callContext when false, call context will not be preserved
+	 * @param {boolean} options.defaultInterop when true and accessing the default exports, interop code will be generated
+	 * @param {string} options.importVar the identifier name of the import variable
+	 * @param {InitFragment[]} options.initFragments init fragments will be added here
+	 * @param {RuntimeSpec} options.runtime runtime for which this code will be generated
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} expression
+	 */
+	exportFromImport({
+		moduleGraph,
+		module,
+		request,
+		exportName,
+		originModule,
+		asiSafe,
+		isCall,
+		callContext,
+		defaultInterop,
+		importVar,
+		initFragments,
+		runtime,
+		runtimeRequirements
+	}) {
+		if (!module) {
+			return this.missingModule({
+				request
+			});
+		}
+		if (!Array.isArray(exportName)) {
+			exportName = exportName ? [exportName] : [];
+		}
+		const exportsType = module.getExportsType(
+			moduleGraph,
+			originModule.buildMeta.strictHarmonyModule
+		);
+
+		if (defaultInterop) {
+			if (exportName.length > 0 && exportName[0] === "default") {
+				switch (exportsType) {
+					case "dynamic":
+						if (isCall) {
+							return `${importVar}_default()${propertyAccess(exportName, 1)}`;
+						} else {
+							return asiSafe
+								? `(${importVar}_default()${propertyAccess(exportName, 1)})`
+								: asiSafe === false
+								? `;(${importVar}_default()${propertyAccess(exportName, 1)})`
+								: `${importVar}_default.a${propertyAccess(exportName, 1)}`;
+						}
+					case "default-only":
+					case "default-with-named":
+						exportName = exportName.slice(1);
+						break;
+				}
+			} else if (exportName.length > 0) {
+				if (exportsType === "default-only") {
+					return (
+						"/* non-default import from non-esm module */undefined" +
+						propertyAccess(exportName, 1)
+					);
+				} else if (
+					exportsType !== "namespace" &&
+					exportName[0] === "__esModule"
+				) {
+					return "/* __esModule */true";
+				}
+			} else if (
+				exportsType === "default-only" ||
+				exportsType === "default-with-named"
+			) {
+				runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+				initFragments.push(
+					new InitFragment(
+						`var ${importVar}_namespace_cache;\n`,
+						InitFragment.STAGE_CONSTANTS,
+						-1,
+						`${importVar}_namespace_cache`
+					)
+				);
+				return `/*#__PURE__*/ ${
+					asiSafe ? "" : asiSafe === false ? ";" : "Object"
+				}(${importVar}_namespace_cache || (${importVar}_namespace_cache = ${
+					RuntimeGlobals.createFakeNamespaceObject
+				}(${importVar}${exportsType === "default-only" ? "" : ", 2"})))`;
+			}
+		}
+
+		if (exportName.length > 0) {
+			const exportsInfo = moduleGraph.getExportsInfo(module);
+			const used = exportsInfo.getUsedName(exportName, runtime);
+			if (!used) {
+				const comment = Template.toNormalComment(
+					`unused export ${propertyAccess(exportName)}`
+				);
+				return `${comment} undefined`;
+			}
+			const comment = equals(used, exportName)
+				? ""
+				: Template.toNormalComment(propertyAccess(exportName)) + " ";
+			const access = `${importVar}${comment}${propertyAccess(used)}`;
+			if (isCall && callContext === false) {
+				return asiSafe
+					? `(0,${access})`
+					: asiSafe === false
+					? `;(0,${access})`
+					: `/*#__PURE__*/Object(${access})`;
+			}
+			return access;
+		} else {
+			return importVar;
+		}
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {AsyncDependenciesBlock} options.block the async block
+	 * @param {string} options.message the message
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} expression
+	 */
+	blockPromise({ block, message, chunkGraph, runtimeRequirements }) {
+		if (!block) {
+			const comment = this.comment({
+				message
+			});
+			return `Promise.resolve(${comment.trim()})`;
+		}
+		const chunkGroup = chunkGraph.getBlockChunkGroup(block);
+		if (!chunkGroup || chunkGroup.chunks.length === 0) {
+			const comment = this.comment({
+				message
+			});
+			return `Promise.resolve(${comment.trim()})`;
+		}
+		const chunks = chunkGroup.chunks.filter(
+			chunk => !chunk.hasRuntime() && chunk.id !== null
+		);
+		const comment = this.comment({
+			message,
+			chunkName: block.chunkName
+		});
+		if (chunks.length === 1) {
+			const chunkId = JSON.stringify(chunks[0].id);
+			runtimeRequirements.add(RuntimeGlobals.ensureChunk);
+			return `${RuntimeGlobals.ensureChunk}(${comment}${chunkId})`;
+		} else if (chunks.length > 0) {
+			runtimeRequirements.add(RuntimeGlobals.ensureChunk);
+			const requireChunkId = chunk =>
+				`${RuntimeGlobals.ensureChunk}(${JSON.stringify(chunk.id)})`;
+			return `Promise.all(${comment.trim()}[${chunks
+				.map(requireChunkId)
+				.join(", ")}])`;
+		} else {
+			return `Promise.resolve(${comment.trim()})`;
+		}
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {AsyncDependenciesBlock} options.block the async block
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @param {string=} options.request request string used originally
+	 * @returns {string} expression
+	 */
+	asyncModuleFactory({ block, chunkGraph, runtimeRequirements, request }) {
+		const dep = block.dependencies[0];
+		const module = chunkGraph.moduleGraph.getModule(dep);
+		const ensureChunk = this.blockPromise({
+			block,
+			message: "",
+			chunkGraph,
+			runtimeRequirements
+		});
+		const factory = this.returningFunction(
+			this.moduleRaw({
+				module,
+				chunkGraph,
+				request,
+				runtimeRequirements
+			})
+		);
+		return this.returningFunction(
+			ensureChunk.startsWith("Promise.resolve(")
+				? `${factory}`
+				: `${ensureChunk}.then(${this.returningFunction(factory)})`
+		);
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {Dependency} options.dependency the dependency
+	 * @param {ChunkGraph} options.chunkGraph the chunk graph
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @param {string=} options.request request string used originally
+	 * @returns {string} expression
+	 */
+	syncModuleFactory({ dependency, chunkGraph, runtimeRequirements, request }) {
+		const module = chunkGraph.moduleGraph.getModule(dependency);
+		const factory = this.returningFunction(
+			this.moduleRaw({
+				module,
+				chunkGraph,
+				request,
+				runtimeRequirements
+			})
+		);
+		return this.returningFunction(factory);
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {string} options.exportsArgument the name of the exports object
+	 * @param {Set<string>} options.runtimeRequirements if set, will be filled with runtime requirements
+	 * @returns {string} statement
+	 */
+	defineEsModuleFlagStatement({ exportsArgument, runtimeRequirements }) {
+		runtimeRequirements.add(RuntimeGlobals.makeNamespaceObject);
+		runtimeRequirements.add(RuntimeGlobals.exports);
+		return `${RuntimeGlobals.makeNamespaceObject}(${exportsArgument});\n`;
+	}
+
+	/**
+	 * @param {Object} options options object
+	 * @param {Module} options.module the module
+	 * @param {string} options.publicPath the public path
+	 * @param {RuntimeSpec=} options.runtime runtime
+	 * @param {CodeGenerationResults} options.codeGenerationResults the code generation results
+	 * @returns {string} the url of the asset
+	 */
+	assetUrl({ publicPath, runtime, module, codeGenerationResults }) {
+		if (!module) {
+			return "data:,";
+		}
+		const codeGen = codeGenerationResults.get(module, runtime);
+		const { data } = codeGen;
+		const url = data.get("url");
+		if (url) return url.toString();
+		const filename = data.get("filename");
+		return publicPath + filename;
+	}
+}
+
+module.exports = RuntimeTemplate;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/SelfModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/SelfModuleFactory.js
new file mode 100644
index 0000000..b2430a4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/SelfModuleFactory.js
@@ -0,0 +1,21 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+class SelfModuleFactory {
+	constructor(moduleGraph) {
+		this.moduleGraph = moduleGraph;
+	}
+
+	create(data, callback) {
+		const module = this.moduleGraph.getParentModule(data.dependencies[0]);
+		callback(null, {
+			module
+		});
+	}
+}
+
+module.exports = SelfModuleFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/SingleEntryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/SingleEntryPlugin.js
new file mode 100644
index 0000000..6579173
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/SingleEntryPlugin.js
@@ -0,0 +1,8 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+module.exports = require("./EntryPlugin");
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/SizeFormatHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/SizeFormatHelpers.js
new file mode 100644
index 0000000..51dceea
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/SizeFormatHelpers.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+/**
+ * @param {number} size the size in bytes
+ * @returns {string} the formatted size
+ */
+exports.formatSize = size => {
+	if (typeof size !== "number" || Number.isNaN(size) === true) {
+		return "unknown size";
+	}
+
+	if (size <= 0) {
+		return "0 bytes";
+	}
+
+	const abbreviations = ["bytes", "KiB", "MiB", "GiB"];
+	const index = Math.floor(Math.log(size) / Math.log(1024));
+
+	return `${+(size / Math.pow(1024, index)).toPrecision(3)} ${
+		abbreviations[index]
+	}`;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/SourceMapDevToolModuleOptionsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/SourceMapDevToolModuleOptionsPlugin.js
new file mode 100644
index 0000000..616bb6f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/SourceMapDevToolModuleOptionsPlugin.js
@@ -0,0 +1,57 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const JavascriptModulesPlugin = require("./javascript/JavascriptModulesPlugin");
+
+/** @typedef {import("./Compilation")} Compilation */
+
+class SourceMapDevToolModuleOptionsPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * @param {Compilation} compilation the compiler instance
+	 * @returns {void}
+	 */
+	apply(compilation) {
+		const options = this.options;
+		if (options.module !== false) {
+			compilation.hooks.buildModule.tap(
+				"SourceMapDevToolModuleOptionsPlugin",
+				module => {
+					module.useSourceMap = true;
+				}
+			);
+			compilation.hooks.runtimeModule.tap(
+				"SourceMapDevToolModuleOptionsPlugin",
+				module => {
+					module.useSourceMap = true;
+				}
+			);
+		} else {
+			compilation.hooks.buildModule.tap(
+				"SourceMapDevToolModuleOptionsPlugin",
+				module => {
+					module.useSimpleSourceMap = true;
+				}
+			);
+			compilation.hooks.runtimeModule.tap(
+				"SourceMapDevToolModuleOptionsPlugin",
+				module => {
+					module.useSimpleSourceMap = true;
+				}
+			);
+		}
+		JavascriptModulesPlugin.getCompilationHooks(compilation).useSourceMap.tap(
+			"SourceMapDevToolModuleOptionsPlugin",
+			() => true
+		);
+	}
+}
+
+module.exports = SourceMapDevToolModuleOptionsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/SourceMapDevToolPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/SourceMapDevToolPlugin.js
new file mode 100644
index 0000000..fc5a3dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/SourceMapDevToolPlugin.js
@@ -0,0 +1,560 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const { ConcatSource, RawSource } = require("webpack-sources");
+const Compilation = require("./Compilation");
+const ModuleFilenameHelpers = require("./ModuleFilenameHelpers");
+const ProgressPlugin = require("./ProgressPlugin");
+const SourceMapDevToolModuleOptionsPlugin = require("./SourceMapDevToolModuleOptionsPlugin");
+const createSchemaValidation = require("./util/create-schema-validation");
+const createHash = require("./util/createHash");
+const { relative, dirname } = require("./util/fs");
+const { makePathsAbsolute } = require("./util/identifier");
+
+/** @typedef {import("webpack-sources").MapOptions} MapOptions */
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/plugins/SourceMapDevToolPlugin").SourceMapDevToolPluginOptions} SourceMapDevToolPluginOptions */
+/** @typedef {import("./Cache").Etag} Etag */
+/** @typedef {import("./CacheFacade").ItemCacheFacade} ItemCacheFacade */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./NormalModule").SourceMap} SourceMap */
+/** @typedef {import("./util/Hash")} Hash */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/SourceMapDevToolPlugin.check.js"),
+	() => require("../schemas/plugins/SourceMapDevToolPlugin.json"),
+	{
+		name: "SourceMap DevTool Plugin",
+		baseDataPath: "options"
+	}
+);
+/**
+ * @typedef {object} SourceMapTask
+ * @property {Source} asset
+ * @property {AssetInfo} assetInfo
+ * @property {(string | Module)[]} modules
+ * @property {string} source
+ * @property {string} file
+ * @property {SourceMap} sourceMap
+ * @property {ItemCacheFacade} cacheItem cache item
+ */
+
+/**
+ * Escapes regular expression metacharacters
+ * @param {string} str String to quote
+ * @returns {string} Escaped string
+ */
+const quoteMeta = str => {
+	return str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
+};
+
+/**
+ * Creating {@link SourceMapTask} for given file
+ * @param {string} file current compiled file
+ * @param {Source} asset the asset
+ * @param {AssetInfo} assetInfo the asset info
+ * @param {MapOptions} options source map options
+ * @param {Compilation} compilation compilation instance
+ * @param {ItemCacheFacade} cacheItem cache item
+ * @returns {SourceMapTask | undefined} created task instance or `undefined`
+ */
+const getTaskForFile = (
+	file,
+	asset,
+	assetInfo,
+	options,
+	compilation,
+	cacheItem
+) => {
+	let source;
+	/** @type {SourceMap} */
+	let sourceMap;
+	/**
+	 * Check if asset can build source map
+	 */
+	if (asset.sourceAndMap) {
+		const sourceAndMap = asset.sourceAndMap(options);
+		sourceMap = /** @type {SourceMap} */ (sourceAndMap.map);
+		source = sourceAndMap.source;
+	} else {
+		sourceMap = /** @type {SourceMap} */ (asset.map(options));
+		source = asset.source();
+	}
+	if (!sourceMap || typeof source !== "string") return;
+	const context = compilation.options.context;
+	const root = compilation.compiler.root;
+	const cachedAbsolutify = makePathsAbsolute.bindContextCache(context, root);
+	const modules = sourceMap.sources.map(source => {
+		if (!source.startsWith("webpack://")) return source;
+		source = cachedAbsolutify(source.slice(10));
+		const module = compilation.findModule(source);
+		return module || source;
+	});
+
+	return {
+		file,
+		asset,
+		source,
+		assetInfo,
+		sourceMap,
+		modules,
+		cacheItem
+	};
+};
+
+class SourceMapDevToolPlugin {
+	/**
+	 * @param {SourceMapDevToolPluginOptions} [options] options object
+	 * @throws {Error} throws error, if got more than 1 arguments
+	 */
+	constructor(options = {}) {
+		validate(options);
+
+		/** @type {string | false} */
+		this.sourceMapFilename = options.filename;
+		/** @type {string | false} */
+		this.sourceMappingURLComment =
+			options.append === false
+				? false
+				: options.append || "\n//# source" + "MappingURL=[url]";
+		/** @type {string | Function} */
+		this.moduleFilenameTemplate =
+			options.moduleFilenameTemplate || "webpack://[namespace]/[resourcePath]";
+		/** @type {string | Function} */
+		this.fallbackModuleFilenameTemplate =
+			options.fallbackModuleFilenameTemplate ||
+			"webpack://[namespace]/[resourcePath]?[hash]";
+		/** @type {string} */
+		this.namespace = options.namespace || "";
+		/** @type {SourceMapDevToolPluginOptions} */
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const outputFs = compiler.outputFileSystem;
+		const sourceMapFilename = this.sourceMapFilename;
+		const sourceMappingURLComment = this.sourceMappingURLComment;
+		const moduleFilenameTemplate = this.moduleFilenameTemplate;
+		const namespace = this.namespace;
+		const fallbackModuleFilenameTemplate = this.fallbackModuleFilenameTemplate;
+		const requestShortener = compiler.requestShortener;
+		const options = this.options;
+		options.test = options.test || /\.((c|m)?js|css)($|\?)/i;
+
+		const matchObject = ModuleFilenameHelpers.matchObject.bind(
+			undefined,
+			options
+		);
+
+		compiler.hooks.compilation.tap("SourceMapDevToolPlugin", compilation => {
+			new SourceMapDevToolModuleOptionsPlugin(options).apply(compilation);
+
+			compilation.hooks.processAssets.tapAsync(
+				{
+					name: "SourceMapDevToolPlugin",
+					stage: Compilation.PROCESS_ASSETS_STAGE_DEV_TOOLING,
+					additionalAssets: true
+				},
+				(assets, callback) => {
+					const chunkGraph = compilation.chunkGraph;
+					const cache = compilation.getCache("SourceMapDevToolPlugin");
+					/** @type {Map<string | Module, string>} */
+					const moduleToSourceNameMapping = new Map();
+					/**
+					 * @type {Function}
+					 * @returns {void}
+					 */
+					const reportProgress =
+						ProgressPlugin.getReporter(compilation.compiler) || (() => {});
+
+					/** @type {Map<string, Chunk>} */
+					const fileToChunk = new Map();
+					for (const chunk of compilation.chunks) {
+						for (const file of chunk.files) {
+							fileToChunk.set(file, chunk);
+						}
+						for (const file of chunk.auxiliaryFiles) {
+							fileToChunk.set(file, chunk);
+						}
+					}
+
+					/** @type {string[]} */
+					const files = [];
+					for (const file of Object.keys(assets)) {
+						if (matchObject(file)) {
+							files.push(file);
+						}
+					}
+
+					reportProgress(0.0);
+					/** @type {SourceMapTask[]} */
+					const tasks = [];
+					let fileIndex = 0;
+
+					asyncLib.each(
+						files,
+						(file, callback) => {
+							const asset = compilation.getAsset(file);
+							if (asset.info.related && asset.info.related.sourceMap) {
+								fileIndex++;
+								return callback();
+							}
+							const cacheItem = cache.getItemCache(
+								file,
+								cache.mergeEtags(
+									cache.getLazyHashedEtag(asset.source),
+									namespace
+								)
+							);
+
+							cacheItem.get((err, cacheEntry) => {
+								if (err) {
+									return callback(err);
+								}
+								/**
+								 * If presented in cache, reassigns assets. Cache assets already have source maps.
+								 */
+								if (cacheEntry) {
+									const { assets, assetsInfo } = cacheEntry;
+									for (const cachedFile of Object.keys(assets)) {
+										if (cachedFile === file) {
+											compilation.updateAsset(
+												cachedFile,
+												assets[cachedFile],
+												assetsInfo[cachedFile]
+											);
+										} else {
+											compilation.emitAsset(
+												cachedFile,
+												assets[cachedFile],
+												assetsInfo[cachedFile]
+											);
+										}
+										/**
+										 * Add file to chunk, if not presented there
+										 */
+										if (cachedFile !== file) {
+											const chunk = fileToChunk.get(file);
+											if (chunk !== undefined)
+												chunk.auxiliaryFiles.add(cachedFile);
+										}
+									}
+
+									reportProgress(
+										(0.5 * ++fileIndex) / files.length,
+										file,
+										"restored cached SourceMap"
+									);
+
+									return callback();
+								}
+
+								reportProgress(
+									(0.5 * fileIndex) / files.length,
+									file,
+									"generate SourceMap"
+								);
+
+								/** @type {SourceMapTask | undefined} */
+								const task = getTaskForFile(
+									file,
+									asset.source,
+									asset.info,
+									{
+										module: options.module,
+										columns: options.columns
+									},
+									compilation,
+									cacheItem
+								);
+
+								if (task) {
+									const modules = task.modules;
+
+									for (let idx = 0; idx < modules.length; idx++) {
+										const module = modules[idx];
+										if (!moduleToSourceNameMapping.get(module)) {
+											moduleToSourceNameMapping.set(
+												module,
+												ModuleFilenameHelpers.createFilename(
+													module,
+													{
+														moduleFilenameTemplate: moduleFilenameTemplate,
+														namespace: namespace
+													},
+													{
+														requestShortener,
+														chunkGraph,
+														hashFunction: compilation.outputOptions.hashFunction
+													}
+												)
+											);
+										}
+									}
+
+									tasks.push(task);
+								}
+
+								reportProgress(
+									(0.5 * ++fileIndex) / files.length,
+									file,
+									"generated SourceMap"
+								);
+
+								callback();
+							});
+						},
+						err => {
+							if (err) {
+								return callback(err);
+							}
+
+							reportProgress(0.5, "resolve sources");
+							/** @type {Set<string>} */
+							const usedNamesSet = new Set(moduleToSourceNameMapping.values());
+							/** @type {Set<string>} */
+							const conflictDetectionSet = new Set();
+
+							/**
+							 * all modules in defined order (longest identifier first)
+							 * @type {Array<string | Module>}
+							 */
+							const allModules = Array.from(
+								moduleToSourceNameMapping.keys()
+							).sort((a, b) => {
+								const ai = typeof a === "string" ? a : a.identifier();
+								const bi = typeof b === "string" ? b : b.identifier();
+								return ai.length - bi.length;
+							});
+
+							// find modules with conflicting source names
+							for (let idx = 0; idx < allModules.length; idx++) {
+								const module = allModules[idx];
+								let sourceName = moduleToSourceNameMapping.get(module);
+								let hasName = conflictDetectionSet.has(sourceName);
+								if (!hasName) {
+									conflictDetectionSet.add(sourceName);
+									continue;
+								}
+
+								// try the fallback name first
+								sourceName = ModuleFilenameHelpers.createFilename(
+									module,
+									{
+										moduleFilenameTemplate: fallbackModuleFilenameTemplate,
+										namespace: namespace
+									},
+									{
+										requestShortener,
+										chunkGraph,
+										hashFunction: compilation.outputOptions.hashFunction
+									}
+								);
+								hasName = usedNamesSet.has(sourceName);
+								if (!hasName) {
+									moduleToSourceNameMapping.set(module, sourceName);
+									usedNamesSet.add(sourceName);
+									continue;
+								}
+
+								// otherwise just append stars until we have a valid name
+								while (hasName) {
+									sourceName += "*";
+									hasName = usedNamesSet.has(sourceName);
+								}
+								moduleToSourceNameMapping.set(module, sourceName);
+								usedNamesSet.add(sourceName);
+							}
+
+							let taskIndex = 0;
+
+							asyncLib.each(
+								tasks,
+								(task, callback) => {
+									const assets = Object.create(null);
+									const assetsInfo = Object.create(null);
+									const file = task.file;
+									const chunk = fileToChunk.get(file);
+									const sourceMap = task.sourceMap;
+									const source = task.source;
+									const modules = task.modules;
+
+									reportProgress(
+										0.5 + (0.5 * taskIndex) / tasks.length,
+										file,
+										"attach SourceMap"
+									);
+
+									const moduleFilenames = modules.map(m =>
+										moduleToSourceNameMapping.get(m)
+									);
+									sourceMap.sources = moduleFilenames;
+									if (options.noSources) {
+										sourceMap.sourcesContent = undefined;
+									}
+									sourceMap.sourceRoot = options.sourceRoot || "";
+									sourceMap.file = file;
+									const usesContentHash =
+										sourceMapFilename &&
+										/\[contenthash(:\w+)?\]/.test(sourceMapFilename);
+
+									// If SourceMap and asset uses contenthash, avoid a circular dependency by hiding hash in `file`
+									if (usesContentHash && task.assetInfo.contenthash) {
+										const contenthash = task.assetInfo.contenthash;
+										let pattern;
+										if (Array.isArray(contenthash)) {
+											pattern = contenthash.map(quoteMeta).join("|");
+										} else {
+											pattern = quoteMeta(contenthash);
+										}
+										sourceMap.file = sourceMap.file.replace(
+											new RegExp(pattern, "g"),
+											m => "x".repeat(m.length)
+										);
+									}
+
+									/** @type {string | false} */
+									let currentSourceMappingURLComment = sourceMappingURLComment;
+									if (
+										currentSourceMappingURLComment !== false &&
+										/\.css($|\?)/i.test(file)
+									) {
+										currentSourceMappingURLComment =
+											currentSourceMappingURLComment.replace(
+												/^\n\/\/(.*)$/,
+												"\n/*$1*/"
+											);
+									}
+									const sourceMapString = JSON.stringify(sourceMap);
+									if (sourceMapFilename) {
+										let filename = file;
+										const sourceMapContentHash =
+											usesContentHash &&
+											/** @type {string} */ (
+												createHash(compilation.outputOptions.hashFunction)
+													.update(sourceMapString)
+													.digest("hex")
+											);
+										const pathParams = {
+											chunk,
+											filename: options.fileContext
+												? relative(
+														outputFs,
+														`/${options.fileContext}`,
+														`/${filename}`
+												  )
+												: filename,
+											contentHash: sourceMapContentHash
+										};
+										const { path: sourceMapFile, info: sourceMapInfo } =
+											compilation.getPathWithInfo(
+												sourceMapFilename,
+												pathParams
+											);
+										const sourceMapUrl = options.publicPath
+											? options.publicPath + sourceMapFile
+											: relative(
+													outputFs,
+													dirname(outputFs, `/${file}`),
+													`/${sourceMapFile}`
+											  );
+										/** @type {Source} */
+										let asset = new RawSource(source);
+										if (currentSourceMappingURLComment !== false) {
+											// Add source map url to compilation asset, if currentSourceMappingURLComment is set
+											asset = new ConcatSource(
+												asset,
+												compilation.getPath(
+													currentSourceMappingURLComment,
+													Object.assign({ url: sourceMapUrl }, pathParams)
+												)
+											);
+										}
+										const assetInfo = {
+											related: { sourceMap: sourceMapFile }
+										};
+										assets[file] = asset;
+										assetsInfo[file] = assetInfo;
+										compilation.updateAsset(file, asset, assetInfo);
+										// Add source map file to compilation assets and chunk files
+										const sourceMapAsset = new RawSource(sourceMapString);
+										const sourceMapAssetInfo = {
+											...sourceMapInfo,
+											development: true
+										};
+										assets[sourceMapFile] = sourceMapAsset;
+										assetsInfo[sourceMapFile] = sourceMapAssetInfo;
+										compilation.emitAsset(
+											sourceMapFile,
+											sourceMapAsset,
+											sourceMapAssetInfo
+										);
+										if (chunk !== undefined)
+											chunk.auxiliaryFiles.add(sourceMapFile);
+									} else {
+										if (currentSourceMappingURLComment === false) {
+											throw new Error(
+												"SourceMapDevToolPlugin: append can't be false when no filename is provided"
+											);
+										}
+										/**
+										 * Add source map as data url to asset
+										 */
+										const asset = new ConcatSource(
+											new RawSource(source),
+											currentSourceMappingURLComment
+												.replace(/\[map\]/g, () => sourceMapString)
+												.replace(
+													/\[url\]/g,
+													() =>
+														`data:application/json;charset=utf-8;base64,${Buffer.from(
+															sourceMapString,
+															"utf-8"
+														).toString("base64")}`
+												)
+										);
+										assets[file] = asset;
+										assetsInfo[file] = undefined;
+										compilation.updateAsset(file, asset);
+									}
+
+									task.cacheItem.store({ assets, assetsInfo }, err => {
+										reportProgress(
+											0.5 + (0.5 * ++taskIndex) / tasks.length,
+											task.file,
+											"attached SourceMap"
+										);
+
+										if (err) {
+											return callback(err);
+										}
+										callback();
+									});
+								},
+								err => {
+									reportProgress(1.0);
+									callback(err);
+								}
+							);
+						}
+					);
+				}
+			);
+		});
+	}
+}
+
+module.exports = SourceMapDevToolPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Stats.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Stats.js
new file mode 100644
index 0000000..567683b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Stats.js
@@ -0,0 +1,84 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../declarations/WebpackOptions").StatsOptions} StatsOptions */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsCompilation} StatsCompilation */
+
+class Stats {
+	/**
+	 * @param {Compilation} compilation webpack compilation
+	 */
+	constructor(compilation) {
+		this.compilation = compilation;
+	}
+
+	get hash() {
+		return this.compilation.hash;
+	}
+
+	get startTime() {
+		return this.compilation.startTime;
+	}
+
+	get endTime() {
+		return this.compilation.endTime;
+	}
+
+	/**
+	 * @returns {boolean} true if the compilation had a warning
+	 */
+	hasWarnings() {
+		return (
+			this.compilation.warnings.length > 0 ||
+			this.compilation.children.some(child => child.getStats().hasWarnings())
+		);
+	}
+
+	/**
+	 * @returns {boolean} true if the compilation encountered an error
+	 */
+	hasErrors() {
+		return (
+			this.compilation.errors.length > 0 ||
+			this.compilation.children.some(child => child.getStats().hasErrors())
+		);
+	}
+
+	/**
+	 * @param {(string|StatsOptions)=} options stats options
+	 * @returns {StatsCompilation} json output
+	 */
+	toJson(options) {
+		options = this.compilation.createStatsOptions(options, {
+			forToString: false
+		});
+
+		const statsFactory = this.compilation.createStatsFactory(options);
+
+		return statsFactory.create("compilation", this.compilation, {
+			compilation: this.compilation
+		});
+	}
+
+	toString(options) {
+		options = this.compilation.createStatsOptions(options, {
+			forToString: true
+		});
+
+		const statsFactory = this.compilation.createStatsFactory(options);
+		const statsPrinter = this.compilation.createStatsPrinter(options);
+
+		const data = statsFactory.create("compilation", this.compilation, {
+			compilation: this.compilation
+		});
+		const result = statsPrinter.print("compilation", data);
+		return result === undefined ? "" : result;
+	}
+}
+
+module.exports = Stats;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Template.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Template.js
new file mode 100644
index 0000000..a3b9611
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Template.js
@@ -0,0 +1,419 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, PrefixSource } = require("webpack-sources");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../declarations/WebpackOptions").Output} OutputOptions */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGraph")} ChunkGraph */
+/** @typedef {import("./CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("./Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("./Compilation").PathData} PathData */
+/** @typedef {import("./DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./ModuleTemplate")} ModuleTemplate */
+/** @typedef {import("./RuntimeModule")} RuntimeModule */
+/** @typedef {import("./RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("./javascript/JavascriptModulesPlugin").ChunkRenderContext} ChunkRenderContext */
+/** @typedef {import("./javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+
+const START_LOWERCASE_ALPHABET_CODE = "a".charCodeAt(0);
+const START_UPPERCASE_ALPHABET_CODE = "A".charCodeAt(0);
+const DELTA_A_TO_Z = "z".charCodeAt(0) - START_LOWERCASE_ALPHABET_CODE + 1;
+const NUMBER_OF_IDENTIFIER_START_CHARS = DELTA_A_TO_Z * 2 + 2; // a-z A-Z _ $
+const NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS =
+	NUMBER_OF_IDENTIFIER_START_CHARS + 10; // a-z A-Z _ $ 0-9
+const FUNCTION_CONTENT_REGEX = /^function\s?\(\)\s?\{\r?\n?|\r?\n?\}$/g;
+const INDENT_MULTILINE_REGEX = /^\t/gm;
+const LINE_SEPARATOR_REGEX = /\r?\n/g;
+const IDENTIFIER_NAME_REPLACE_REGEX = /^([^a-zA-Z$_])/;
+const IDENTIFIER_ALPHA_NUMERIC_NAME_REPLACE_REGEX = /[^a-zA-Z0-9$]+/g;
+const COMMENT_END_REGEX = /\*\//g;
+const PATH_NAME_NORMALIZE_REPLACE_REGEX = /[^a-zA-Z0-9_!§$()=\-^°]+/g;
+const MATCH_PADDED_HYPHENS_REPLACE_REGEX = /^-|-$/g;
+
+/**
+ * @typedef {Object} RenderManifestOptions
+ * @property {Chunk} chunk the chunk used to render
+ * @property {string} hash
+ * @property {string} fullHash
+ * @property {OutputOptions} outputOptions
+ * @property {CodeGenerationResults} codeGenerationResults
+ * @property {{javascript: ModuleTemplate}} moduleTemplates
+ * @property {DependencyTemplates} dependencyTemplates
+ * @property {RuntimeTemplate} runtimeTemplate
+ * @property {ModuleGraph} moduleGraph
+ * @property {ChunkGraph} chunkGraph
+ */
+
+/** @typedef {RenderManifestEntryTemplated | RenderManifestEntryStatic} RenderManifestEntry */
+
+/**
+ * @typedef {Object} RenderManifestEntryTemplated
+ * @property {function(): Source} render
+ * @property {string | function(PathData, AssetInfo=): string} filenameTemplate
+ * @property {PathData=} pathOptions
+ * @property {AssetInfo=} info
+ * @property {string} identifier
+ * @property {string=} hash
+ * @property {boolean=} auxiliary
+ */
+
+/**
+ * @typedef {Object} RenderManifestEntryStatic
+ * @property {function(): Source} render
+ * @property {string} filename
+ * @property {AssetInfo} info
+ * @property {string} identifier
+ * @property {string=} hash
+ * @property {boolean=} auxiliary
+ */
+
+/**
+ * @typedef {Object} HasId
+ * @property {number | string} id
+ */
+
+/**
+ * @typedef {function(Module, number): boolean} ModuleFilterPredicate
+ */
+
+class Template {
+	/**
+	 *
+	 * @param {Function} fn a runtime function (.runtime.js) "template"
+	 * @returns {string} the updated and normalized function string
+	 */
+	static getFunctionContent(fn) {
+		return fn
+			.toString()
+			.replace(FUNCTION_CONTENT_REGEX, "")
+			.replace(INDENT_MULTILINE_REGEX, "")
+			.replace(LINE_SEPARATOR_REGEX, "\n");
+	}
+
+	/**
+	 * @param {string} str the string converted to identifier
+	 * @returns {string} created identifier
+	 */
+	static toIdentifier(str) {
+		if (typeof str !== "string") return "";
+		return str
+			.replace(IDENTIFIER_NAME_REPLACE_REGEX, "_$1")
+			.replace(IDENTIFIER_ALPHA_NUMERIC_NAME_REPLACE_REGEX, "_");
+	}
+	/**
+	 *
+	 * @param {string} str string to be converted to commented in bundle code
+	 * @returns {string} returns a commented version of string
+	 */
+	static toComment(str) {
+		if (!str) return "";
+		return `/*! ${str.replace(COMMENT_END_REGEX, "* /")} */`;
+	}
+
+	/**
+	 *
+	 * @param {string} str string to be converted to "normal comment"
+	 * @returns {string} returns a commented version of string
+	 */
+	static toNormalComment(str) {
+		if (!str) return "";
+		return `/* ${str.replace(COMMENT_END_REGEX, "* /")} */`;
+	}
+
+	/**
+	 * @param {string} str string path to be normalized
+	 * @returns {string} normalized bundle-safe path
+	 */
+	static toPath(str) {
+		if (typeof str !== "string") return "";
+		return str
+			.replace(PATH_NAME_NORMALIZE_REPLACE_REGEX, "-")
+			.replace(MATCH_PADDED_HYPHENS_REPLACE_REGEX, "");
+	}
+
+	// map number to a single character a-z, A-Z or multiple characters if number is too big
+	/**
+	 * @param {number} n number to convert to ident
+	 * @returns {string} returns single character ident
+	 */
+	static numberToIdentifier(n) {
+		if (n >= NUMBER_OF_IDENTIFIER_START_CHARS) {
+			// use multiple letters
+			return (
+				Template.numberToIdentifier(n % NUMBER_OF_IDENTIFIER_START_CHARS) +
+				Template.numberToIdentifierContinuation(
+					Math.floor(n / NUMBER_OF_IDENTIFIER_START_CHARS)
+				)
+			);
+		}
+
+		// lower case
+		if (n < DELTA_A_TO_Z) {
+			return String.fromCharCode(START_LOWERCASE_ALPHABET_CODE + n);
+		}
+		n -= DELTA_A_TO_Z;
+
+		// upper case
+		if (n < DELTA_A_TO_Z) {
+			return String.fromCharCode(START_UPPERCASE_ALPHABET_CODE + n);
+		}
+
+		if (n === DELTA_A_TO_Z) return "_";
+		return "$";
+	}
+
+	/**
+	 * @param {number} n number to convert to ident
+	 * @returns {string} returns single character ident
+	 */
+	static numberToIdentifierContinuation(n) {
+		if (n >= NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS) {
+			// use multiple letters
+			return (
+				Template.numberToIdentifierContinuation(
+					n % NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS
+				) +
+				Template.numberToIdentifierContinuation(
+					Math.floor(n / NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS)
+				)
+			);
+		}
+
+		// lower case
+		if (n < DELTA_A_TO_Z) {
+			return String.fromCharCode(START_LOWERCASE_ALPHABET_CODE + n);
+		}
+		n -= DELTA_A_TO_Z;
+
+		// upper case
+		if (n < DELTA_A_TO_Z) {
+			return String.fromCharCode(START_UPPERCASE_ALPHABET_CODE + n);
+		}
+		n -= DELTA_A_TO_Z;
+
+		// numbers
+		if (n < 10) {
+			return `${n}`;
+		}
+
+		if (n === 10) return "_";
+		return "$";
+	}
+
+	/**
+	 *
+	 * @param {string | string[]} s string to convert to identity
+	 * @returns {string} converted identity
+	 */
+	static indent(s) {
+		if (Array.isArray(s)) {
+			return s.map(Template.indent).join("\n");
+		} else {
+			const str = s.trimRight();
+			if (!str) return "";
+			const ind = str[0] === "\n" ? "" : "\t";
+			return ind + str.replace(/\n([^\n])/g, "\n\t$1");
+		}
+	}
+
+	/**
+	 *
+	 * @param {string|string[]} s string to create prefix for
+	 * @param {string} prefix prefix to compose
+	 * @returns {string} returns new prefix string
+	 */
+	static prefix(s, prefix) {
+		const str = Template.asString(s).trim();
+		if (!str) return "";
+		const ind = str[0] === "\n" ? "" : prefix;
+		return ind + str.replace(/\n([^\n])/g, "\n" + prefix + "$1");
+	}
+
+	/**
+	 *
+	 * @param {string|string[]} str string or string collection
+	 * @returns {string} returns a single string from array
+	 */
+	static asString(str) {
+		if (Array.isArray(str)) {
+			return str.join("\n");
+		}
+		return str;
+	}
+
+	/**
+	 * @typedef {Object} WithId
+	 * @property {string|number} id
+	 */
+
+	/**
+	 * @param {WithId[]} modules a collection of modules to get array bounds for
+	 * @returns {[number, number] | false} returns the upper and lower array bounds
+	 * or false if not every module has a number based id
+	 */
+	static getModulesArrayBounds(modules) {
+		let maxId = -Infinity;
+		let minId = Infinity;
+		for (const module of modules) {
+			const moduleId = module.id;
+			if (typeof moduleId !== "number") return false;
+			if (maxId < moduleId) maxId = moduleId;
+			if (minId > moduleId) minId = moduleId;
+		}
+		if (minId < 16 + ("" + minId).length) {
+			// add minId x ',' instead of 'Array(minId).concat(…)'
+			minId = 0;
+		}
+		// start with -1 because the first module needs no comma
+		let objectOverhead = -1;
+		for (const module of modules) {
+			// module id + colon + comma
+			objectOverhead += `${module.id}`.length + 2;
+		}
+		// number of commas, or when starting non-zero the length of Array(minId).concat()
+		const arrayOverhead = minId === 0 ? maxId : 16 + `${minId}`.length + maxId;
+		return arrayOverhead < objectOverhead ? [minId, maxId] : false;
+	}
+
+	/**
+	 * @param {ChunkRenderContext} renderContext render context
+	 * @param {Module[]} modules modules to render (should be ordered by identifier)
+	 * @param {function(Module): Source} renderModule function to render a module
+	 * @param {string=} prefix applying prefix strings
+	 * @returns {Source} rendered chunk modules in a Source object
+	 */
+	static renderChunkModules(renderContext, modules, renderModule, prefix = "") {
+		const { chunkGraph } = renderContext;
+		var source = new ConcatSource();
+		if (modules.length === 0) {
+			return null;
+		}
+		/** @type {{id: string|number, source: Source|string}[]} */
+		const allModules = modules.map(module => {
+			return {
+				id: chunkGraph.getModuleId(module),
+				source: renderModule(module) || "false"
+			};
+		});
+		const bounds = Template.getModulesArrayBounds(allModules);
+		if (bounds) {
+			// Render a spare array
+			const minId = bounds[0];
+			const maxId = bounds[1];
+			if (minId !== 0) {
+				source.add(`Array(${minId}).concat(`);
+			}
+			source.add("[\n");
+			/** @type {Map<string|number, {id: string|number, source: Source|string}>} */
+			const modules = new Map();
+			for (const module of allModules) {
+				modules.set(module.id, module);
+			}
+			for (let idx = minId; idx <= maxId; idx++) {
+				const module = modules.get(idx);
+				if (idx !== minId) {
+					source.add(",\n");
+				}
+				source.add(`/* ${idx} */`);
+				if (module) {
+					source.add("\n");
+					source.add(module.source);
+				}
+			}
+			source.add("\n" + prefix + "]");
+			if (minId !== 0) {
+				source.add(")");
+			}
+		} else {
+			// Render an object
+			source.add("{\n");
+			for (let i = 0; i < allModules.length; i++) {
+				const module = allModules[i];
+				if (i !== 0) {
+					source.add(",\n");
+				}
+				source.add(`\n/***/ ${JSON.stringify(module.id)}:\n`);
+				source.add(module.source);
+			}
+			source.add(`\n\n${prefix}}`);
+		}
+		return source;
+	}
+
+	/**
+	 * @param {RuntimeModule[]} runtimeModules array of runtime modules in order
+	 * @param {RenderContext & { codeGenerationResults?: CodeGenerationResults }} renderContext render context
+	 * @returns {Source} rendered runtime modules in a Source object
+	 */
+	static renderRuntimeModules(runtimeModules, renderContext) {
+		const source = new ConcatSource();
+		for (const module of runtimeModules) {
+			const codeGenerationResults = renderContext.codeGenerationResults;
+			let runtimeSource;
+			if (codeGenerationResults) {
+				runtimeSource = codeGenerationResults.getSource(
+					module,
+					renderContext.chunk.runtime,
+					"runtime"
+				);
+			} else {
+				const codeGenResult = module.codeGeneration({
+					chunkGraph: renderContext.chunkGraph,
+					dependencyTemplates: renderContext.dependencyTemplates,
+					moduleGraph: renderContext.moduleGraph,
+					runtimeTemplate: renderContext.runtimeTemplate,
+					runtime: renderContext.chunk.runtime,
+					codeGenerationResults
+				});
+				if (!codeGenResult) continue;
+				runtimeSource = codeGenResult.sources.get("runtime");
+			}
+			if (runtimeSource) {
+				source.add(Template.toNormalComment(module.identifier()) + "\n");
+				if (!module.shouldIsolate()) {
+					source.add(runtimeSource);
+					source.add("\n\n");
+				} else if (renderContext.runtimeTemplate.supportsArrowFunction()) {
+					source.add("(() => {\n");
+					source.add(new PrefixSource("\t", runtimeSource));
+					source.add("\n})();\n\n");
+				} else {
+					source.add("!function() {\n");
+					source.add(new PrefixSource("\t", runtimeSource));
+					source.add("\n}();\n\n");
+				}
+			}
+		}
+		return source;
+	}
+
+	/**
+	 * @param {RuntimeModule[]} runtimeModules array of runtime modules in order
+	 * @param {RenderContext} renderContext render context
+	 * @returns {Source} rendered chunk runtime modules in a Source object
+	 */
+	static renderChunkRuntimeModules(runtimeModules, renderContext) {
+		return new PrefixSource(
+			"/******/ ",
+			new ConcatSource(
+				"function(__webpack_require__) { // webpackRuntimeModules\n",
+				this.renderRuntimeModules(runtimeModules, renderContext),
+				"}\n"
+			)
+		);
+	}
+}
+
+module.exports = Template;
+module.exports.NUMBER_OF_IDENTIFIER_START_CHARS =
+	NUMBER_OF_IDENTIFIER_START_CHARS;
+module.exports.NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS =
+	NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/TemplatedPathPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/TemplatedPathPlugin.js
new file mode 100644
index 0000000..34ac923
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/TemplatedPathPlugin.js
@@ -0,0 +1,346 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Jason Anderson @diurnalist
+*/
+
+"use strict";
+
+const mime = require("mime-types");
+const { basename, extname } = require("path");
+const util = require("util");
+const Chunk = require("./Chunk");
+const Module = require("./Module");
+const { parseResource } = require("./util/identifier");
+
+/** @typedef {import("./Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("./Compilation").PathData} PathData */
+/** @typedef {import("./Compiler")} Compiler */
+
+const REGEXP = /\[\\*([\w:]+)\\*\]/gi;
+
+const prepareId = id => {
+	if (typeof id !== "string") return id;
+
+	if (/^"\s\+*.*\+\s*"$/.test(id)) {
+		const match = /^"\s\+*\s*(.*)\s*\+\s*"$/.exec(id);
+
+		return `" + (${match[1]} + "").replace(/(^[.-]|[^a-zA-Z0-9_-])+/g, "_") + "`;
+	}
+
+	return id.replace(/(^[.-]|[^a-zA-Z0-9_-])+/g, "_");
+};
+
+const hashLength = (replacer, handler, assetInfo, hashName) => {
+	const fn = (match, arg, input) => {
+		let result;
+		const length = arg && parseInt(arg, 10);
+
+		if (length && handler) {
+			result = handler(length);
+		} else {
+			const hash = replacer(match, arg, input);
+
+			result = length ? hash.slice(0, length) : hash;
+		}
+		if (assetInfo) {
+			assetInfo.immutable = true;
+			if (Array.isArray(assetInfo[hashName])) {
+				assetInfo[hashName] = [...assetInfo[hashName], result];
+			} else if (assetInfo[hashName]) {
+				assetInfo[hashName] = [assetInfo[hashName], result];
+			} else {
+				assetInfo[hashName] = result;
+			}
+		}
+		return result;
+	};
+
+	return fn;
+};
+
+const replacer = (value, allowEmpty) => {
+	const fn = (match, arg, input) => {
+		if (typeof value === "function") {
+			value = value();
+		}
+		if (value === null || value === undefined) {
+			if (!allowEmpty) {
+				throw new Error(
+					`Path variable ${match} not implemented in this context: ${input}`
+				);
+			}
+
+			return "";
+		} else {
+			return `${value}`;
+		}
+	};
+
+	return fn;
+};
+
+const deprecationCache = new Map();
+const deprecatedFunction = (() => () => {})();
+const deprecated = (fn, message, code) => {
+	let d = deprecationCache.get(message);
+	if (d === undefined) {
+		d = util.deprecate(deprecatedFunction, message, code);
+		deprecationCache.set(message, d);
+	}
+	return (...args) => {
+		d();
+		return fn(...args);
+	};
+};
+
+/**
+ * @param {string | function(PathData, AssetInfo=): string} path the raw path
+ * @param {PathData} data context data
+ * @param {AssetInfo} assetInfo extra info about the asset (will be written to)
+ * @returns {string} the interpolated path
+ */
+const replacePathVariables = (path, data, assetInfo) => {
+	const chunkGraph = data.chunkGraph;
+
+	/** @type {Map<string, Function>} */
+	const replacements = new Map();
+
+	// Filename context
+	//
+	// Placeholders
+	//
+	// for /some/path/file.js?query#fragment:
+	// [file] - /some/path/file.js
+	// [query] - ?query
+	// [fragment] - #fragment
+	// [base] - file.js
+	// [path] - /some/path/
+	// [name] - file
+	// [ext] - .js
+	if (typeof data.filename === "string") {
+		// check that filename is data uri
+		let match = data.filename.match(/^data:([^;,]+)/);
+		if (match) {
+			const ext = mime.extension(match[1]);
+			const emptyReplacer = replacer("", true);
+
+			replacements.set("file", emptyReplacer);
+			replacements.set("query", emptyReplacer);
+			replacements.set("fragment", emptyReplacer);
+			replacements.set("path", emptyReplacer);
+			replacements.set("base", emptyReplacer);
+			replacements.set("name", emptyReplacer);
+			replacements.set("ext", replacer(ext ? `.${ext}` : "", true));
+			// Legacy
+			replacements.set(
+				"filebase",
+				deprecated(
+					emptyReplacer,
+					"[filebase] is now [base]",
+					"DEP_WEBPACK_TEMPLATE_PATH_PLUGIN_REPLACE_PATH_VARIABLES_FILENAME"
+				)
+			);
+		} else {
+			const { path: file, query, fragment } = parseResource(data.filename);
+
+			const ext = extname(file);
+			const base = basename(file);
+			const name = base.slice(0, base.length - ext.length);
+			const path = file.slice(0, file.length - base.length);
+
+			replacements.set("file", replacer(file));
+			replacements.set("query", replacer(query, true));
+			replacements.set("fragment", replacer(fragment, true));
+			replacements.set("path", replacer(path, true));
+			replacements.set("base", replacer(base));
+			replacements.set("name", replacer(name));
+			replacements.set("ext", replacer(ext, true));
+			// Legacy
+			replacements.set(
+				"filebase",
+				deprecated(
+					replacer(base),
+					"[filebase] is now [base]",
+					"DEP_WEBPACK_TEMPLATE_PATH_PLUGIN_REPLACE_PATH_VARIABLES_FILENAME"
+				)
+			);
+		}
+	}
+
+	// Compilation context
+	//
+	// Placeholders
+	//
+	// [fullhash] - data.hash (3a4b5c6e7f)
+	//
+	// Legacy Placeholders
+	//
+	// [hash] - data.hash (3a4b5c6e7f)
+	if (data.hash) {
+		const hashReplacer = hashLength(
+			replacer(data.hash),
+			data.hashWithLength,
+			assetInfo,
+			"fullhash"
+		);
+
+		replacements.set("fullhash", hashReplacer);
+
+		// Legacy
+		replacements.set(
+			"hash",
+			deprecated(
+				hashReplacer,
+				"[hash] is now [fullhash] (also consider using [chunkhash] or [contenthash], see documentation for details)",
+				"DEP_WEBPACK_TEMPLATE_PATH_PLUGIN_REPLACE_PATH_VARIABLES_HASH"
+			)
+		);
+	}
+
+	// Chunk Context
+	//
+	// Placeholders
+	//
+	// [id] - chunk.id (0.js)
+	// [name] - chunk.name (app.js)
+	// [chunkhash] - chunk.hash (7823t4t4.js)
+	// [contenthash] - chunk.contentHash[type] (3256u3zg.js)
+	if (data.chunk) {
+		const chunk = data.chunk;
+
+		const contentHashType = data.contentHashType;
+
+		const idReplacer = replacer(chunk.id);
+		const nameReplacer = replacer(chunk.name || chunk.id);
+		const chunkhashReplacer = hashLength(
+			replacer(chunk instanceof Chunk ? chunk.renderedHash : chunk.hash),
+			"hashWithLength" in chunk ? chunk.hashWithLength : undefined,
+			assetInfo,
+			"chunkhash"
+		);
+		const contenthashReplacer = hashLength(
+			replacer(
+				data.contentHash ||
+					(contentHashType &&
+						chunk.contentHash &&
+						chunk.contentHash[contentHashType])
+			),
+			data.contentHashWithLength ||
+				("contentHashWithLength" in chunk && chunk.contentHashWithLength
+					? chunk.contentHashWithLength[contentHashType]
+					: undefined),
+			assetInfo,
+			"contenthash"
+		);
+
+		replacements.set("id", idReplacer);
+		replacements.set("name", nameReplacer);
+		replacements.set("chunkhash", chunkhashReplacer);
+		replacements.set("contenthash", contenthashReplacer);
+	}
+
+	// Module Context
+	//
+	// Placeholders
+	//
+	// [id] - module.id (2.png)
+	// [hash] - module.hash (6237543873.png)
+	//
+	// Legacy Placeholders
+	//
+	// [moduleid] - module.id (2.png)
+	// [modulehash] - module.hash (6237543873.png)
+	if (data.module) {
+		const module = data.module;
+
+		const idReplacer = replacer(() =>
+			prepareId(
+				module instanceof Module ? chunkGraph.getModuleId(module) : module.id
+			)
+		);
+		const moduleHashReplacer = hashLength(
+			replacer(() =>
+				module instanceof Module
+					? chunkGraph.getRenderedModuleHash(module, data.runtime)
+					: module.hash
+			),
+			"hashWithLength" in module ? module.hashWithLength : undefined,
+			assetInfo,
+			"modulehash"
+		);
+		const contentHashReplacer = hashLength(
+			replacer(data.contentHash),
+			undefined,
+			assetInfo,
+			"contenthash"
+		);
+
+		replacements.set("id", idReplacer);
+		replacements.set("modulehash", moduleHashReplacer);
+		replacements.set("contenthash", contentHashReplacer);
+		replacements.set(
+			"hash",
+			data.contentHash ? contentHashReplacer : moduleHashReplacer
+		);
+		// Legacy
+		replacements.set(
+			"moduleid",
+			deprecated(
+				idReplacer,
+				"[moduleid] is now [id]",
+				"DEP_WEBPACK_TEMPLATE_PATH_PLUGIN_REPLACE_PATH_VARIABLES_MODULE_ID"
+			)
+		);
+	}
+
+	// Other things
+	if (data.url) {
+		replacements.set("url", replacer(data.url));
+	}
+	if (typeof data.runtime === "string") {
+		replacements.set(
+			"runtime",
+			replacer(() => prepareId(data.runtime))
+		);
+	} else {
+		replacements.set("runtime", replacer("_"));
+	}
+
+	if (typeof path === "function") {
+		path = path(data, assetInfo);
+	}
+
+	path = path.replace(REGEXP, (match, content) => {
+		if (content.length + 2 === match.length) {
+			const contentMatch = /^(\w+)(?::(\w+))?$/.exec(content);
+			if (!contentMatch) return match;
+			const [, kind, arg] = contentMatch;
+			const replacer = replacements.get(kind);
+			if (replacer !== undefined) {
+				return replacer(match, arg, path);
+			}
+		} else if (match.startsWith("[\\") && match.endsWith("\\]")) {
+			return `[${match.slice(2, -2)}]`;
+		}
+		return match;
+	});
+
+	return path;
+};
+
+const plugin = "TemplatedPathPlugin";
+
+class TemplatedPathPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(plugin, compilation => {
+			compilation.hooks.assetPath.tap(plugin, replacePathVariables);
+		});
+	}
+}
+
+module.exports = TemplatedPathPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/UnhandledSchemeError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/UnhandledSchemeError.js
new file mode 100644
index 0000000..80fa07a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/UnhandledSchemeError.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+class UnhandledSchemeError extends WebpackError {
+	/**
+	 * @param {string} scheme scheme
+	 * @param {string} resource resource
+	 */
+	constructor(scheme, resource) {
+		super(
+			`Reading from "${resource}" is not handled by plugins (Unhandled scheme).` +
+				'\nWebpack supports "data:" and "file:" URIs by default.' +
+				`\nYou may need an additional plugin to handle "${scheme}:" URIs.`
+		);
+		this.file = resource;
+		this.name = "UnhandledSchemeError";
+	}
+}
+
+makeSerializable(
+	UnhandledSchemeError,
+	"webpack/lib/UnhandledSchemeError",
+	"UnhandledSchemeError"
+);
+
+module.exports = UnhandledSchemeError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/UnsupportedFeatureWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/UnsupportedFeatureWarning.js
new file mode 100644
index 0000000..2c59f4a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/UnsupportedFeatureWarning.js
@@ -0,0 +1,32 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+
+class UnsupportedFeatureWarning extends WebpackError {
+	/**
+	 * @param {string} message description of warning
+	 * @param {DependencyLocation} loc location start and end positions of the module
+	 */
+	constructor(message, loc) {
+		super(message);
+
+		this.name = "UnsupportedFeatureWarning";
+		this.loc = loc;
+		this.hideStack = true;
+	}
+}
+
+makeSerializable(
+	UnsupportedFeatureWarning,
+	"webpack/lib/UnsupportedFeatureWarning"
+);
+
+module.exports = UnsupportedFeatureWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/UseStrictPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/UseStrictPlugin.js
new file mode 100644
index 0000000..eaac54a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/UseStrictPlugin.js
@@ -0,0 +1,56 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ConstDependency = require("./dependencies/ConstDependency");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class UseStrictPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"UseStrictPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const handler = parser => {
+					parser.hooks.program.tap("UseStrictPlugin", ast => {
+						const firstNode = ast.body[0];
+						if (
+							firstNode &&
+							firstNode.type === "ExpressionStatement" &&
+							firstNode.expression.type === "Literal" &&
+							firstNode.expression.value === "use strict"
+						) {
+							// Remove "use strict" expression. It will be added later by the renderer again.
+							// This is necessary in order to not break the strict mode when webpack prepends code.
+							// @see https://github.com/webpack/webpack/issues/1970
+							const dep = new ConstDependency("", firstNode.range);
+							dep.loc = firstNode.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							parser.state.module.buildInfo.strict = true;
+						}
+					});
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("UseStrictPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("UseStrictPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("UseStrictPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = UseStrictPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WarnCaseSensitiveModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WarnCaseSensitiveModulesPlugin.js
new file mode 100644
index 0000000..77bfbb9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WarnCaseSensitiveModulesPlugin.js
@@ -0,0 +1,53 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const CaseSensitiveModulesWarning = require("./CaseSensitiveModulesWarning");
+
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Module")} Module */
+
+class WarnCaseSensitiveModulesPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"WarnCaseSensitiveModulesPlugin",
+			compilation => {
+				compilation.hooks.seal.tap("WarnCaseSensitiveModulesPlugin", () => {
+					/** @type {Map<string, Map<string, Module>>} */
+					const moduleWithoutCase = new Map();
+					for (const module of compilation.modules) {
+						const identifier = module.identifier();
+						const lowerIdentifier = identifier.toLowerCase();
+						let map = moduleWithoutCase.get(lowerIdentifier);
+						if (map === undefined) {
+							map = new Map();
+							moduleWithoutCase.set(lowerIdentifier, map);
+						}
+						map.set(identifier, module);
+					}
+					for (const pair of moduleWithoutCase) {
+						const map = pair[1];
+						if (map.size > 1) {
+							compilation.warnings.push(
+								new CaseSensitiveModulesWarning(
+									map.values(),
+									compilation.moduleGraph
+								)
+							);
+						}
+					}
+				});
+			}
+		);
+	}
+}
+
+module.exports = WarnCaseSensitiveModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WarnDeprecatedOptionPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WarnDeprecatedOptionPlugin.js
new file mode 100644
index 0000000..dfb86a1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WarnDeprecatedOptionPlugin.js
@@ -0,0 +1,54 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const WebpackError = require("./WebpackError");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class WarnDeprecatedOptionPlugin {
+	/**
+	 * Create an instance of the plugin
+	 * @param {string} option the target option
+	 * @param {string | number} value the deprecated option value
+	 * @param {string} suggestion the suggestion replacement
+	 */
+	constructor(option, value, suggestion) {
+		this.option = option;
+		this.value = value;
+		this.suggestion = suggestion;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"WarnDeprecatedOptionPlugin",
+			compilation => {
+				compilation.warnings.push(
+					new DeprecatedOptionWarning(this.option, this.value, this.suggestion)
+				);
+			}
+		);
+	}
+}
+
+class DeprecatedOptionWarning extends WebpackError {
+	constructor(option, value, suggestion) {
+		super();
+
+		this.name = "DeprecatedOptionWarning";
+		this.message =
+			"configuration\n" +
+			`The value '${value}' for option '${option}' is deprecated. ` +
+			`Use '${suggestion}' instead.`;
+	}
+}
+
+module.exports = WarnDeprecatedOptionPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WarnNoModeSetPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WarnNoModeSetPlugin.js
new file mode 100644
index 0000000..b8685f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WarnNoModeSetPlugin.js
@@ -0,0 +1,25 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NoModeWarning = require("./NoModeWarning");
+
+/** @typedef {import("./Compiler")} Compiler */
+
+class WarnNoModeSetPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap("WarnNoModeSetPlugin", compilation => {
+			compilation.warnings.push(new NoModeWarning());
+		});
+	}
+}
+
+module.exports = WarnNoModeSetPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WatchIgnorePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WatchIgnorePlugin.js
new file mode 100644
index 0000000..52cde68
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WatchIgnorePlugin.js
@@ -0,0 +1,132 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { groupBy } = require("./util/ArrayHelpers");
+const createSchemaValidation = require("./util/create-schema-validation");
+
+/** @typedef {import("../declarations/plugins/WatchIgnorePlugin").WatchIgnorePluginOptions} WatchIgnorePluginOptions */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./util/fs").WatchFileSystem} WatchFileSystem */
+
+const validate = createSchemaValidation(
+	require("../schemas/plugins/WatchIgnorePlugin.check.js"),
+	() => require("../schemas/plugins/WatchIgnorePlugin.json"),
+	{
+		name: "Watch Ignore Plugin",
+		baseDataPath: "options"
+	}
+);
+
+const IGNORE_TIME_ENTRY = "ignore";
+
+class IgnoringWatchFileSystem {
+	/**
+	 * @param {WatchFileSystem} wfs original file system
+	 * @param {(string|RegExp)[]} paths ignored paths
+	 */
+	constructor(wfs, paths) {
+		this.wfs = wfs;
+		this.paths = paths;
+	}
+
+	watch(files, dirs, missing, startTime, options, callback, callbackUndelayed) {
+		files = Array.from(files);
+		dirs = Array.from(dirs);
+		const ignored = path =>
+			this.paths.some(p =>
+				p instanceof RegExp ? p.test(path) : path.indexOf(p) === 0
+			);
+
+		const [ignoredFiles, notIgnoredFiles] = groupBy(files, ignored);
+		const [ignoredDirs, notIgnoredDirs] = groupBy(dirs, ignored);
+
+		const watcher = this.wfs.watch(
+			notIgnoredFiles,
+			notIgnoredDirs,
+			missing,
+			startTime,
+			options,
+			(err, fileTimestamps, dirTimestamps, changedFiles, removedFiles) => {
+				if (err) return callback(err);
+				for (const path of ignoredFiles) {
+					fileTimestamps.set(path, IGNORE_TIME_ENTRY);
+				}
+
+				for (const path of ignoredDirs) {
+					dirTimestamps.set(path, IGNORE_TIME_ENTRY);
+				}
+
+				callback(
+					err,
+					fileTimestamps,
+					dirTimestamps,
+					changedFiles,
+					removedFiles
+				);
+			},
+			callbackUndelayed
+		);
+
+		return {
+			close: () => watcher.close(),
+			pause: () => watcher.pause(),
+			getContextTimeInfoEntries: () => {
+				const dirTimestamps = watcher.getContextTimeInfoEntries();
+				for (const path of ignoredDirs) {
+					dirTimestamps.set(path, IGNORE_TIME_ENTRY);
+				}
+				return dirTimestamps;
+			},
+			getFileTimeInfoEntries: () => {
+				const fileTimestamps = watcher.getFileTimeInfoEntries();
+				for (const path of ignoredFiles) {
+					fileTimestamps.set(path, IGNORE_TIME_ENTRY);
+				}
+				return fileTimestamps;
+			},
+			getInfo:
+				watcher.getInfo &&
+				(() => {
+					const info = watcher.getInfo();
+					const { fileTimeInfoEntries, contextTimeInfoEntries } = info;
+					for (const path of ignoredFiles) {
+						fileTimeInfoEntries.set(path, IGNORE_TIME_ENTRY);
+					}
+					for (const path of ignoredDirs) {
+						contextTimeInfoEntries.set(path, IGNORE_TIME_ENTRY);
+					}
+					return info;
+				})
+		};
+	}
+}
+
+class WatchIgnorePlugin {
+	/**
+	 * @param {WatchIgnorePluginOptions} options options
+	 */
+	constructor(options) {
+		validate(options);
+		this.paths = options.paths;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.afterEnvironment.tap("WatchIgnorePlugin", () => {
+			compiler.watchFileSystem = new IgnoringWatchFileSystem(
+				compiler.watchFileSystem,
+				this.paths
+			);
+		});
+	}
+}
+
+module.exports = WatchIgnorePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/Watching.js b/node_modules/mathjs/examples/node_modules/webpack/lib/Watching.js
new file mode 100644
index 0000000..5051878
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/Watching.js
@@ -0,0 +1,479 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Stats = require("./Stats");
+
+/** @typedef {import("../declarations/WebpackOptions").WatchOptions} WatchOptions */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./FileSystemInfo").FileSystemInfoEntry} FileSystemInfoEntry */
+
+/**
+ * @template T
+ * @callback Callback
+ * @param {(Error | null)=} err
+ * @param {T=} result
+ */
+
+class Watching {
+	/**
+	 * @param {Compiler} compiler the compiler
+	 * @param {WatchOptions} watchOptions options
+	 * @param {Callback<Stats>} handler completion handler
+	 */
+	constructor(compiler, watchOptions, handler) {
+		this.startTime = null;
+		this.invalid = false;
+		this.handler = handler;
+		/** @type {Callback<void>[]} */
+		this.callbacks = [];
+		/** @type {Callback<void>[] | undefined} */
+		this._closeCallbacks = undefined;
+		this.closed = false;
+		this.suspended = false;
+		this.blocked = false;
+		this._isBlocked = () => false;
+		this._onChange = () => {};
+		this._onInvalid = () => {};
+		if (typeof watchOptions === "number") {
+			this.watchOptions = {
+				aggregateTimeout: watchOptions
+			};
+		} else if (watchOptions && typeof watchOptions === "object") {
+			this.watchOptions = { ...watchOptions };
+		} else {
+			this.watchOptions = {};
+		}
+		if (typeof this.watchOptions.aggregateTimeout !== "number") {
+			this.watchOptions.aggregateTimeout = 20;
+		}
+		this.compiler = compiler;
+		this.running = false;
+		this._initial = true;
+		this._invalidReported = true;
+		this._needRecords = true;
+		this.watcher = undefined;
+		this.pausedWatcher = undefined;
+		/** @type {Set<string>} */
+		this._collectedChangedFiles = undefined;
+		/** @type {Set<string>} */
+		this._collectedRemovedFiles = undefined;
+		this._done = this._done.bind(this);
+		process.nextTick(() => {
+			if (this._initial) this._invalidate();
+		});
+	}
+
+	/**
+	 * @param {ReadonlySet<string>} changedFiles changed files
+	 * @param {ReadonlySet<string>} removedFiles removed files
+	 */
+	_mergeWithCollected(changedFiles, removedFiles) {
+		if (!changedFiles) return;
+		if (!this._collectedChangedFiles) {
+			this._collectedChangedFiles = new Set(changedFiles);
+			this._collectedRemovedFiles = new Set(removedFiles);
+		} else {
+			for (const file of changedFiles) {
+				this._collectedChangedFiles.add(file);
+				this._collectedRemovedFiles.delete(file);
+			}
+			for (const file of removedFiles) {
+				this._collectedChangedFiles.delete(file);
+				this._collectedRemovedFiles.add(file);
+			}
+		}
+	}
+
+	/**
+	 * @param {ReadonlyMap<string, FileSystemInfoEntry | "ignore">=} fileTimeInfoEntries info for files
+	 * @param {ReadonlyMap<string, FileSystemInfoEntry | "ignore">=} contextTimeInfoEntries info for directories
+	 * @param {ReadonlySet<string>=} changedFiles changed files
+	 * @param {ReadonlySet<string>=} removedFiles removed files
+	 * @returns {void}
+	 */
+	_go(fileTimeInfoEntries, contextTimeInfoEntries, changedFiles, removedFiles) {
+		this._initial = false;
+		if (this.startTime === null) this.startTime = Date.now();
+		this.running = true;
+		if (this.watcher) {
+			this.pausedWatcher = this.watcher;
+			this.lastWatcherStartTime = Date.now();
+			this.watcher.pause();
+			this.watcher = null;
+		} else if (!this.lastWatcherStartTime) {
+			this.lastWatcherStartTime = Date.now();
+		}
+		this.compiler.fsStartTime = Date.now();
+		if (
+			changedFiles &&
+			removedFiles &&
+			fileTimeInfoEntries &&
+			contextTimeInfoEntries
+		) {
+			this._mergeWithCollected(changedFiles, removedFiles);
+			this.compiler.fileTimestamps = fileTimeInfoEntries;
+			this.compiler.contextTimestamps = contextTimeInfoEntries;
+		} else if (this.pausedWatcher) {
+			if (this.pausedWatcher.getInfo) {
+				const {
+					changes,
+					removals,
+					fileTimeInfoEntries,
+					contextTimeInfoEntries
+				} = this.pausedWatcher.getInfo();
+				this._mergeWithCollected(changes, removals);
+				this.compiler.fileTimestamps = fileTimeInfoEntries;
+				this.compiler.contextTimestamps = contextTimeInfoEntries;
+			} else {
+				this._mergeWithCollected(
+					this.pausedWatcher.getAggregatedChanges &&
+						this.pausedWatcher.getAggregatedChanges(),
+					this.pausedWatcher.getAggregatedRemovals &&
+						this.pausedWatcher.getAggregatedRemovals()
+				);
+				this.compiler.fileTimestamps =
+					this.pausedWatcher.getFileTimeInfoEntries();
+				this.compiler.contextTimestamps =
+					this.pausedWatcher.getContextTimeInfoEntries();
+			}
+		}
+		this.compiler.modifiedFiles = this._collectedChangedFiles;
+		this._collectedChangedFiles = undefined;
+		this.compiler.removedFiles = this._collectedRemovedFiles;
+		this._collectedRemovedFiles = undefined;
+
+		const run = () => {
+			if (this.compiler.idle) {
+				return this.compiler.cache.endIdle(err => {
+					if (err) return this._done(err);
+					this.compiler.idle = false;
+					run();
+				});
+			}
+			if (this._needRecords) {
+				return this.compiler.readRecords(err => {
+					if (err) return this._done(err);
+
+					this._needRecords = false;
+					run();
+				});
+			}
+			this.invalid = false;
+			this._invalidReported = false;
+			this.compiler.hooks.watchRun.callAsync(this.compiler, err => {
+				if (err) return this._done(err);
+				const onCompiled = (err, compilation) => {
+					if (err) return this._done(err, compilation);
+					if (this.invalid) return this._done(null, compilation);
+
+					if (this.compiler.hooks.shouldEmit.call(compilation) === false) {
+						return this._done(null, compilation);
+					}
+
+					process.nextTick(() => {
+						const logger = compilation.getLogger("webpack.Compiler");
+						logger.time("emitAssets");
+						this.compiler.emitAssets(compilation, err => {
+							logger.timeEnd("emitAssets");
+							if (err) return this._done(err, compilation);
+							if (this.invalid) return this._done(null, compilation);
+
+							logger.time("emitRecords");
+							this.compiler.emitRecords(err => {
+								logger.timeEnd("emitRecords");
+								if (err) return this._done(err, compilation);
+
+								if (compilation.hooks.needAdditionalPass.call()) {
+									compilation.needAdditionalPass = true;
+
+									compilation.startTime = this.startTime;
+									compilation.endTime = Date.now();
+									logger.time("done hook");
+									const stats = new Stats(compilation);
+									this.compiler.hooks.done.callAsync(stats, err => {
+										logger.timeEnd("done hook");
+										if (err) return this._done(err, compilation);
+
+										this.compiler.hooks.additionalPass.callAsync(err => {
+											if (err) return this._done(err, compilation);
+											this.compiler.compile(onCompiled);
+										});
+									});
+									return;
+								}
+								return this._done(null, compilation);
+							});
+						});
+					});
+				};
+				this.compiler.compile(onCompiled);
+			});
+		};
+
+		run();
+	}
+
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {Stats} the compilation stats
+	 */
+	_getStats(compilation) {
+		const stats = new Stats(compilation);
+		return stats;
+	}
+
+	/**
+	 * @param {Error=} err an optional error
+	 * @param {Compilation=} compilation the compilation
+	 * @returns {void}
+	 */
+	_done(err, compilation) {
+		this.running = false;
+
+		const logger = compilation && compilation.getLogger("webpack.Watching");
+
+		let stats = null;
+
+		const handleError = (err, cbs) => {
+			this.compiler.hooks.failed.call(err);
+			this.compiler.cache.beginIdle();
+			this.compiler.idle = true;
+			this.handler(err, stats);
+			if (!cbs) {
+				cbs = this.callbacks;
+				this.callbacks = [];
+			}
+			for (const cb of cbs) cb(err);
+		};
+
+		if (
+			this.invalid &&
+			!this.suspended &&
+			!this.blocked &&
+			!(this._isBlocked() && (this.blocked = true))
+		) {
+			if (compilation) {
+				logger.time("storeBuildDependencies");
+				this.compiler.cache.storeBuildDependencies(
+					compilation.buildDependencies,
+					err => {
+						logger.timeEnd("storeBuildDependencies");
+						if (err) return handleError(err);
+						this._go();
+					}
+				);
+			} else {
+				this._go();
+			}
+			return;
+		}
+
+		if (compilation) {
+			compilation.startTime = this.startTime;
+			compilation.endTime = Date.now();
+			stats = new Stats(compilation);
+		}
+		this.startTime = null;
+		if (err) return handleError(err);
+
+		const cbs = this.callbacks;
+		this.callbacks = [];
+		logger.time("done hook");
+		this.compiler.hooks.done.callAsync(stats, err => {
+			logger.timeEnd("done hook");
+			if (err) return handleError(err, cbs);
+			this.handler(null, stats);
+			logger.time("storeBuildDependencies");
+			this.compiler.cache.storeBuildDependencies(
+				compilation.buildDependencies,
+				err => {
+					logger.timeEnd("storeBuildDependencies");
+					if (err) return handleError(err, cbs);
+					logger.time("beginIdle");
+					this.compiler.cache.beginIdle();
+					this.compiler.idle = true;
+					logger.timeEnd("beginIdle");
+					process.nextTick(() => {
+						if (!this.closed) {
+							this.watch(
+								compilation.fileDependencies,
+								compilation.contextDependencies,
+								compilation.missingDependencies
+							);
+						}
+					});
+					for (const cb of cbs) cb(null);
+					this.compiler.hooks.afterDone.call(stats);
+				}
+			);
+		});
+	}
+
+	/**
+	 * @param {Iterable<string>} files watched files
+	 * @param {Iterable<string>} dirs watched directories
+	 * @param {Iterable<string>} missing watched existence entries
+	 * @returns {void}
+	 */
+	watch(files, dirs, missing) {
+		this.pausedWatcher = null;
+		this.watcher = this.compiler.watchFileSystem.watch(
+			files,
+			dirs,
+			missing,
+			this.lastWatcherStartTime,
+			this.watchOptions,
+			(
+				err,
+				fileTimeInfoEntries,
+				contextTimeInfoEntries,
+				changedFiles,
+				removedFiles
+			) => {
+				if (err) {
+					this.compiler.modifiedFiles = undefined;
+					this.compiler.removedFiles = undefined;
+					this.compiler.fileTimestamps = undefined;
+					this.compiler.contextTimestamps = undefined;
+					this.compiler.fsStartTime = undefined;
+					return this.handler(err);
+				}
+				this._invalidate(
+					fileTimeInfoEntries,
+					contextTimeInfoEntries,
+					changedFiles,
+					removedFiles
+				);
+				this._onChange();
+			},
+			(fileName, changeTime) => {
+				if (!this._invalidReported) {
+					this._invalidReported = true;
+					this.compiler.hooks.invalid.call(fileName, changeTime);
+				}
+				this._onInvalid();
+			}
+		);
+	}
+
+	/**
+	 * @param {Callback<void>=} callback signals when the build has completed again
+	 * @returns {void}
+	 */
+	invalidate(callback) {
+		if (callback) {
+			this.callbacks.push(callback);
+		}
+		if (!this._invalidReported) {
+			this._invalidReported = true;
+			this.compiler.hooks.invalid.call(null, Date.now());
+		}
+		this._onChange();
+		this._invalidate();
+	}
+
+	_invalidate(
+		fileTimeInfoEntries,
+		contextTimeInfoEntries,
+		changedFiles,
+		removedFiles
+	) {
+		if (this.suspended || (this._isBlocked() && (this.blocked = true))) {
+			this._mergeWithCollected(changedFiles, removedFiles);
+			return;
+		}
+
+		if (this.running) {
+			this._mergeWithCollected(changedFiles, removedFiles);
+			this.invalid = true;
+		} else {
+			this._go(
+				fileTimeInfoEntries,
+				contextTimeInfoEntries,
+				changedFiles,
+				removedFiles
+			);
+		}
+	}
+
+	suspend() {
+		this.suspended = true;
+	}
+
+	resume() {
+		if (this.suspended) {
+			this.suspended = false;
+			this._invalidate();
+		}
+	}
+
+	/**
+	 * @param {Callback<void>} callback signals when the watcher is closed
+	 * @returns {void}
+	 */
+	close(callback) {
+		if (this._closeCallbacks) {
+			if (callback) {
+				this._closeCallbacks.push(callback);
+			}
+			return;
+		}
+		const finalCallback = (err, compilation) => {
+			this.running = false;
+			this.compiler.running = false;
+			this.compiler.watching = undefined;
+			this.compiler.watchMode = false;
+			this.compiler.modifiedFiles = undefined;
+			this.compiler.removedFiles = undefined;
+			this.compiler.fileTimestamps = undefined;
+			this.compiler.contextTimestamps = undefined;
+			this.compiler.fsStartTime = undefined;
+			const shutdown = err => {
+				this.compiler.hooks.watchClose.call();
+				const closeCallbacks = this._closeCallbacks;
+				this._closeCallbacks = undefined;
+				for (const cb of closeCallbacks) cb(err);
+			};
+			if (compilation) {
+				const logger = compilation.getLogger("webpack.Watching");
+				logger.time("storeBuildDependencies");
+				this.compiler.cache.storeBuildDependencies(
+					compilation.buildDependencies,
+					err2 => {
+						logger.timeEnd("storeBuildDependencies");
+						shutdown(err || err2);
+					}
+				);
+			} else {
+				shutdown(err);
+			}
+		};
+
+		this.closed = true;
+		if (this.watcher) {
+			this.watcher.close();
+			this.watcher = null;
+		}
+		if (this.pausedWatcher) {
+			this.pausedWatcher.close();
+			this.pausedWatcher = null;
+		}
+		this._closeCallbacks = [];
+		if (callback) {
+			this._closeCallbacks.push(callback);
+		}
+		if (this.running) {
+			this.invalid = true;
+			this._done = finalCallback;
+		} else {
+			finalCallback();
+		}
+	}
+}
+
+module.exports = Watching;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackError.js
new file mode 100644
index 0000000..b98ad5a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackError.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Jarid Margolin @jaridmargolin
+*/
+
+"use strict";
+
+const inspect = require("util").inspect.custom;
+const makeSerializable = require("./util/makeSerializable");
+
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Module")} Module */
+
+class WebpackError extends Error {
+	/**
+	 * Creates an instance of WebpackError.
+	 * @param {string=} message error message
+	 */
+	constructor(message) {
+		super(message);
+
+		this.details = undefined;
+		/** @type {Module} */
+		this.module = undefined;
+		/** @type {DependencyLocation} */
+		this.loc = undefined;
+		/** @type {boolean} */
+		this.hideStack = undefined;
+		/** @type {Chunk} */
+		this.chunk = undefined;
+		/** @type {string} */
+		this.file = undefined;
+	}
+
+	[inspect]() {
+		return this.stack + (this.details ? `\n${this.details}` : "");
+	}
+
+	serialize({ write }) {
+		write(this.name);
+		write(this.message);
+		write(this.stack);
+		write(this.details);
+		write(this.loc);
+		write(this.hideStack);
+	}
+
+	deserialize({ read }) {
+		this.name = read();
+		this.message = read();
+		this.stack = read();
+		this.details = read();
+		this.loc = read();
+		this.hideStack = read();
+	}
+}
+
+makeSerializable(WebpackError, "webpack/lib/WebpackError");
+
+module.exports = WebpackError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackIsIncludedPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackIsIncludedPlugin.js
new file mode 100644
index 0000000..93d44bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackIsIncludedPlugin.js
@@ -0,0 +1,85 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const IgnoreErrorModuleFactory = require("./IgnoreErrorModuleFactory");
+const WebpackIsIncludedDependency = require("./dependencies/WebpackIsIncludedDependency");
+const {
+	toConstantDependency
+} = require("./javascript/JavascriptParserHelpers");
+
+/** @typedef {import("enhanced-resolve/lib/Resolver")} Resolver */
+/** @typedef {import("./Compiler")} Compiler */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./javascript/JavascriptParser")} JavascriptParser */
+
+class WebpackIsIncludedPlugin {
+	/**
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"WebpackIsIncludedPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					WebpackIsIncludedDependency,
+					new IgnoreErrorModuleFactory(normalModuleFactory)
+				);
+				compilation.dependencyTemplates.set(
+					WebpackIsIncludedDependency,
+					new WebpackIsIncludedDependency.Template()
+				);
+
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @returns {void}
+				 */
+				const handler = parser => {
+					parser.hooks.call
+						.for("__webpack_is_included__")
+						.tap("WebpackIsIncludedPlugin", expr => {
+							if (
+								expr.type !== "CallExpression" ||
+								expr.arguments.length !== 1 ||
+								expr.arguments[0].type === "SpreadElement"
+							)
+								return;
+
+							const request = parser.evaluateExpression(expr.arguments[0]);
+
+							if (!request.isString()) return;
+
+							const dep = new WebpackIsIncludedDependency(
+								request.string,
+								expr.range
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addDependency(dep);
+							return true;
+						});
+					parser.hooks.typeof
+						.for("__webpack_is_included__")
+						.tap(
+							"WebpackIsIncludedPlugin",
+							toConstantDependency(parser, JSON.stringify("function"))
+						);
+				};
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("WebpackIsIncludedPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("WebpackIsIncludedPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("WebpackIsIncludedPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = WebpackIsIncludedPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackOptionsApply.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackOptionsApply.js
new file mode 100644
index 0000000..c6d5940
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackOptionsApply.js
@@ -0,0 +1,700 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const OptionsApply = require("./OptionsApply");
+
+const AssetModulesPlugin = require("./asset/AssetModulesPlugin");
+const JavascriptModulesPlugin = require("./javascript/JavascriptModulesPlugin");
+const JsonModulesPlugin = require("./json/JsonModulesPlugin");
+
+const ChunkPrefetchPreloadPlugin = require("./prefetch/ChunkPrefetchPreloadPlugin");
+
+const EntryOptionPlugin = require("./EntryOptionPlugin");
+const RecordIdsPlugin = require("./RecordIdsPlugin");
+
+const RuntimePlugin = require("./RuntimePlugin");
+
+const APIPlugin = require("./APIPlugin");
+const CompatibilityPlugin = require("./CompatibilityPlugin");
+const ConstPlugin = require("./ConstPlugin");
+const ExportsInfoApiPlugin = require("./ExportsInfoApiPlugin");
+const WebpackIsIncludedPlugin = require("./WebpackIsIncludedPlugin");
+
+const TemplatedPathPlugin = require("./TemplatedPathPlugin");
+const UseStrictPlugin = require("./UseStrictPlugin");
+const WarnCaseSensitiveModulesPlugin = require("./WarnCaseSensitiveModulesPlugin");
+
+const DataUriPlugin = require("./schemes/DataUriPlugin");
+const FileUriPlugin = require("./schemes/FileUriPlugin");
+
+const ResolverCachePlugin = require("./cache/ResolverCachePlugin");
+
+const CommonJsPlugin = require("./dependencies/CommonJsPlugin");
+const HarmonyModulesPlugin = require("./dependencies/HarmonyModulesPlugin");
+const ImportMetaContextPlugin = require("./dependencies/ImportMetaContextPlugin");
+const ImportMetaPlugin = require("./dependencies/ImportMetaPlugin");
+const ImportPlugin = require("./dependencies/ImportPlugin");
+const LoaderPlugin = require("./dependencies/LoaderPlugin");
+const RequireContextPlugin = require("./dependencies/RequireContextPlugin");
+const RequireEnsurePlugin = require("./dependencies/RequireEnsurePlugin");
+const RequireIncludePlugin = require("./dependencies/RequireIncludePlugin");
+const SystemPlugin = require("./dependencies/SystemPlugin");
+const URLPlugin = require("./dependencies/URLPlugin");
+const WorkerPlugin = require("./dependencies/WorkerPlugin");
+
+const InferAsyncModulesPlugin = require("./async-modules/InferAsyncModulesPlugin");
+
+const JavascriptMetaInfoPlugin = require("./JavascriptMetaInfoPlugin");
+const DefaultStatsFactoryPlugin = require("./stats/DefaultStatsFactoryPlugin");
+const DefaultStatsPresetPlugin = require("./stats/DefaultStatsPresetPlugin");
+const DefaultStatsPrinterPlugin = require("./stats/DefaultStatsPrinterPlugin");
+
+const { cleverMerge } = require("./util/cleverMerge");
+
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./Compiler")} Compiler */
+
+class WebpackOptionsApply extends OptionsApply {
+	constructor() {
+		super();
+	}
+
+	/**
+	 * @param {WebpackOptions} options options object
+	 * @param {Compiler} compiler compiler object
+	 * @returns {WebpackOptions} options object
+	 */
+	process(options, compiler) {
+		compiler.outputPath = options.output.path;
+		compiler.recordsInputPath = options.recordsInputPath || null;
+		compiler.recordsOutputPath = options.recordsOutputPath || null;
+		compiler.name = options.name;
+
+		if (options.externals) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ExternalsPlugin = require("./ExternalsPlugin");
+			new ExternalsPlugin(options.externalsType, options.externals).apply(
+				compiler
+			);
+		}
+
+		if (options.externalsPresets.node) {
+			const NodeTargetPlugin = require("./node/NodeTargetPlugin");
+			new NodeTargetPlugin().apply(compiler);
+		}
+		if (options.externalsPresets.electronMain) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ElectronTargetPlugin = require("./electron/ElectronTargetPlugin");
+			new ElectronTargetPlugin("main").apply(compiler);
+		}
+		if (options.externalsPresets.electronPreload) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ElectronTargetPlugin = require("./electron/ElectronTargetPlugin");
+			new ElectronTargetPlugin("preload").apply(compiler);
+		}
+		if (options.externalsPresets.electronRenderer) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ElectronTargetPlugin = require("./electron/ElectronTargetPlugin");
+			new ElectronTargetPlugin("renderer").apply(compiler);
+		}
+		if (
+			options.externalsPresets.electron &&
+			!options.externalsPresets.electronMain &&
+			!options.externalsPresets.electronPreload &&
+			!options.externalsPresets.electronRenderer
+		) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ElectronTargetPlugin = require("./electron/ElectronTargetPlugin");
+			new ElectronTargetPlugin().apply(compiler);
+		}
+		if (options.externalsPresets.nwjs) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ExternalsPlugin = require("./ExternalsPlugin");
+			new ExternalsPlugin("node-commonjs", "nw.gui").apply(compiler);
+		}
+		if (options.externalsPresets.webAsync) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ExternalsPlugin = require("./ExternalsPlugin");
+			new ExternalsPlugin(
+				"import",
+				options.experiments.css
+					? ({ request, dependencyType }, callback) => {
+							if (dependencyType === "url") {
+								if (/^(\/\/|https?:\/\/)/.test(request))
+									return callback(null, `asset ${request}`);
+							} else if (dependencyType === "css-import") {
+								if (/^(\/\/|https?:\/\/)/.test(request))
+									return callback(null, `css-import ${request}`);
+							} else if (/^(\/\/|https?:\/\/|std:)/.test(request)) {
+								if (/^\.css(\?|$)/.test(request))
+									return callback(null, `css-import ${request}`);
+								return callback(null, `import ${request}`);
+							}
+							callback();
+					  }
+					: /^(\/\/|https?:\/\/|std:)/
+			).apply(compiler);
+		} else if (options.externalsPresets.web) {
+			//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+			const ExternalsPlugin = require("./ExternalsPlugin");
+			new ExternalsPlugin(
+				"module",
+				options.experiments.css
+					? ({ request, dependencyType }, callback) => {
+							if (dependencyType === "url") {
+								if (/^(\/\/|https?:\/\/)/.test(request))
+									return callback(null, `asset ${request}`);
+							} else if (dependencyType === "css-import") {
+								if (/^(\/\/|https?:\/\/)/.test(request))
+									return callback(null, `css-import ${request}`);
+							} else if (/^(\/\/|https?:\/\/|std:)/.test(request)) {
+								if (/^\.css(\?|$)/.test(request))
+									return callback(null, `css-import ${request}`);
+								return callback(null, `module ${request}`);
+							}
+							callback();
+					  }
+					: /^(\/\/|https?:\/\/|std:)/
+			).apply(compiler);
+		}
+
+		new ChunkPrefetchPreloadPlugin().apply(compiler);
+
+		if (typeof options.output.chunkFormat === "string") {
+			switch (options.output.chunkFormat) {
+				case "array-push": {
+					const ArrayPushCallbackChunkFormatPlugin = require("./javascript/ArrayPushCallbackChunkFormatPlugin");
+					new ArrayPushCallbackChunkFormatPlugin().apply(compiler);
+					break;
+				}
+				case "commonjs": {
+					const CommonJsChunkFormatPlugin = require("./javascript/CommonJsChunkFormatPlugin");
+					new CommonJsChunkFormatPlugin().apply(compiler);
+					break;
+				}
+				case "module": {
+					const ModuleChunkFormatPlugin = require("./esm/ModuleChunkFormatPlugin");
+					new ModuleChunkFormatPlugin().apply(compiler);
+					break;
+				}
+				default:
+					throw new Error(
+						"Unsupported chunk format '" + options.output.chunkFormat + "'."
+					);
+			}
+		}
+
+		if (options.output.enabledChunkLoadingTypes.length > 0) {
+			for (const type of options.output.enabledChunkLoadingTypes) {
+				const EnableChunkLoadingPlugin = require("./javascript/EnableChunkLoadingPlugin");
+				new EnableChunkLoadingPlugin(type).apply(compiler);
+			}
+		}
+
+		if (options.output.enabledWasmLoadingTypes.length > 0) {
+			for (const type of options.output.enabledWasmLoadingTypes) {
+				const EnableWasmLoadingPlugin = require("./wasm/EnableWasmLoadingPlugin");
+				new EnableWasmLoadingPlugin(type).apply(compiler);
+			}
+		}
+
+		if (options.output.enabledLibraryTypes.length > 0) {
+			for (const type of options.output.enabledLibraryTypes) {
+				const EnableLibraryPlugin = require("./library/EnableLibraryPlugin");
+				new EnableLibraryPlugin(type).apply(compiler);
+			}
+		}
+
+		if (options.output.pathinfo) {
+			const ModuleInfoHeaderPlugin = require("./ModuleInfoHeaderPlugin");
+			new ModuleInfoHeaderPlugin(options.output.pathinfo !== true).apply(
+				compiler
+			);
+		}
+
+		if (options.output.clean) {
+			const CleanPlugin = require("./CleanPlugin");
+			new CleanPlugin(
+				options.output.clean === true ? {} : options.output.clean
+			).apply(compiler);
+		}
+
+		if (options.devtool) {
+			if (options.devtool.includes("source-map")) {
+				const hidden = options.devtool.includes("hidden");
+				const inline = options.devtool.includes("inline");
+				const evalWrapped = options.devtool.includes("eval");
+				const cheap = options.devtool.includes("cheap");
+				const moduleMaps = options.devtool.includes("module");
+				const noSources = options.devtool.includes("nosources");
+				const Plugin = evalWrapped
+					? require("./EvalSourceMapDevToolPlugin")
+					: require("./SourceMapDevToolPlugin");
+				new Plugin({
+					filename: inline ? null : options.output.sourceMapFilename,
+					moduleFilenameTemplate: options.output.devtoolModuleFilenameTemplate,
+					fallbackModuleFilenameTemplate:
+						options.output.devtoolFallbackModuleFilenameTemplate,
+					append: hidden ? false : undefined,
+					module: moduleMaps ? true : cheap ? false : true,
+					columns: cheap ? false : true,
+					noSources: noSources,
+					namespace: options.output.devtoolNamespace
+				}).apply(compiler);
+			} else if (options.devtool.includes("eval")) {
+				const EvalDevToolModulePlugin = require("./EvalDevToolModulePlugin");
+				new EvalDevToolModulePlugin({
+					moduleFilenameTemplate: options.output.devtoolModuleFilenameTemplate,
+					namespace: options.output.devtoolNamespace
+				}).apply(compiler);
+			}
+		}
+
+		new JavascriptModulesPlugin().apply(compiler);
+		new JsonModulesPlugin().apply(compiler);
+		new AssetModulesPlugin().apply(compiler);
+
+		if (!options.experiments.outputModule) {
+			if (options.output.module) {
+				throw new Error(
+					"'output.module: true' is only allowed when 'experiments.outputModule' is enabled"
+				);
+			}
+			if (options.output.enabledLibraryTypes.includes("module")) {
+				throw new Error(
+					"library type \"module\" is only allowed when 'experiments.outputModule' is enabled"
+				);
+			}
+			if (options.externalsType === "module") {
+				throw new Error(
+					"'externalsType: \"module\"' is only allowed when 'experiments.outputModule' is enabled"
+				);
+			}
+		}
+
+		if (options.experiments.syncWebAssembly) {
+			const WebAssemblyModulesPlugin = require("./wasm-sync/WebAssemblyModulesPlugin");
+			new WebAssemblyModulesPlugin({
+				mangleImports: options.optimization.mangleWasmImports
+			}).apply(compiler);
+		}
+
+		if (options.experiments.asyncWebAssembly) {
+			const AsyncWebAssemblyModulesPlugin = require("./wasm-async/AsyncWebAssemblyModulesPlugin");
+			new AsyncWebAssemblyModulesPlugin({
+				mangleImports: options.optimization.mangleWasmImports
+			}).apply(compiler);
+		}
+
+		if (options.experiments.css) {
+			const CssModulesPlugin = require("./css/CssModulesPlugin");
+			new CssModulesPlugin(options.experiments.css).apply(compiler);
+		}
+
+		if (options.experiments.lazyCompilation) {
+			const LazyCompilationPlugin = require("./hmr/LazyCompilationPlugin");
+			const lazyOptions =
+				typeof options.experiments.lazyCompilation === "object"
+					? options.experiments.lazyCompilation
+					: null;
+			new LazyCompilationPlugin({
+				backend:
+					typeof lazyOptions.backend === "function"
+						? lazyOptions.backend
+						: require("./hmr/lazyCompilationBackend")({
+								...lazyOptions.backend,
+								client:
+									(lazyOptions.backend && lazyOptions.backend.client) ||
+									require.resolve(
+										`../hot/lazy-compilation-${
+											options.externalsPresets.node ? "node" : "web"
+										}.js`
+									)
+						  }),
+				entries: !lazyOptions || lazyOptions.entries !== false,
+				imports: !lazyOptions || lazyOptions.imports !== false,
+				test: (lazyOptions && lazyOptions.test) || undefined
+			}).apply(compiler);
+		}
+
+		if (options.experiments.buildHttp) {
+			const HttpUriPlugin = require("./schemes/HttpUriPlugin");
+			const httpOptions = options.experiments.buildHttp;
+			new HttpUriPlugin(httpOptions).apply(compiler);
+		}
+
+		new EntryOptionPlugin().apply(compiler);
+		compiler.hooks.entryOption.call(options.context, options.entry);
+
+		new RuntimePlugin().apply(compiler);
+
+		new InferAsyncModulesPlugin().apply(compiler);
+
+		new DataUriPlugin().apply(compiler);
+		new FileUriPlugin().apply(compiler);
+
+		new CompatibilityPlugin().apply(compiler);
+		new HarmonyModulesPlugin({
+			topLevelAwait: options.experiments.topLevelAwait
+		}).apply(compiler);
+		if (options.amd !== false) {
+			const AMDPlugin = require("./dependencies/AMDPlugin");
+			const RequireJsStuffPlugin = require("./RequireJsStuffPlugin");
+			new AMDPlugin(options.amd || {}).apply(compiler);
+			new RequireJsStuffPlugin().apply(compiler);
+		}
+		new CommonJsPlugin().apply(compiler);
+		new LoaderPlugin({}).apply(compiler);
+		if (options.node !== false) {
+			const NodeStuffPlugin = require("./NodeStuffPlugin");
+			new NodeStuffPlugin(options.node).apply(compiler);
+		}
+		new APIPlugin().apply(compiler);
+		new ExportsInfoApiPlugin().apply(compiler);
+		new WebpackIsIncludedPlugin().apply(compiler);
+		new ConstPlugin().apply(compiler);
+		new UseStrictPlugin().apply(compiler);
+		new RequireIncludePlugin().apply(compiler);
+		new RequireEnsurePlugin().apply(compiler);
+		new RequireContextPlugin().apply(compiler);
+		new ImportPlugin().apply(compiler);
+		new ImportMetaContextPlugin().apply(compiler);
+		new SystemPlugin().apply(compiler);
+		new ImportMetaPlugin().apply(compiler);
+		new URLPlugin().apply(compiler);
+		new WorkerPlugin(
+			options.output.workerChunkLoading,
+			options.output.workerWasmLoading,
+			options.output.module
+		).apply(compiler);
+
+		new DefaultStatsFactoryPlugin().apply(compiler);
+		new DefaultStatsPresetPlugin().apply(compiler);
+		new DefaultStatsPrinterPlugin().apply(compiler);
+
+		new JavascriptMetaInfoPlugin().apply(compiler);
+
+		if (typeof options.mode !== "string") {
+			const WarnNoModeSetPlugin = require("./WarnNoModeSetPlugin");
+			new WarnNoModeSetPlugin().apply(compiler);
+		}
+
+		const EnsureChunkConditionsPlugin = require("./optimize/EnsureChunkConditionsPlugin");
+		new EnsureChunkConditionsPlugin().apply(compiler);
+		if (options.optimization.removeAvailableModules) {
+			const RemoveParentModulesPlugin = require("./optimize/RemoveParentModulesPlugin");
+			new RemoveParentModulesPlugin().apply(compiler);
+		}
+		if (options.optimization.removeEmptyChunks) {
+			const RemoveEmptyChunksPlugin = require("./optimize/RemoveEmptyChunksPlugin");
+			new RemoveEmptyChunksPlugin().apply(compiler);
+		}
+		if (options.optimization.mergeDuplicateChunks) {
+			const MergeDuplicateChunksPlugin = require("./optimize/MergeDuplicateChunksPlugin");
+			new MergeDuplicateChunksPlugin().apply(compiler);
+		}
+		if (options.optimization.flagIncludedChunks) {
+			const FlagIncludedChunksPlugin = require("./optimize/FlagIncludedChunksPlugin");
+			new FlagIncludedChunksPlugin().apply(compiler);
+		}
+		if (options.optimization.sideEffects) {
+			const SideEffectsFlagPlugin = require("./optimize/SideEffectsFlagPlugin");
+			new SideEffectsFlagPlugin(
+				options.optimization.sideEffects === true
+			).apply(compiler);
+		}
+		if (options.optimization.providedExports) {
+			const FlagDependencyExportsPlugin = require("./FlagDependencyExportsPlugin");
+			new FlagDependencyExportsPlugin().apply(compiler);
+		}
+		if (options.optimization.usedExports) {
+			const FlagDependencyUsagePlugin = require("./FlagDependencyUsagePlugin");
+			new FlagDependencyUsagePlugin(
+				options.optimization.usedExports === "global"
+			).apply(compiler);
+		}
+		if (options.optimization.innerGraph) {
+			const InnerGraphPlugin = require("./optimize/InnerGraphPlugin");
+			new InnerGraphPlugin().apply(compiler);
+		}
+		if (options.optimization.mangleExports) {
+			const MangleExportsPlugin = require("./optimize/MangleExportsPlugin");
+			new MangleExportsPlugin(
+				options.optimization.mangleExports !== "size"
+			).apply(compiler);
+		}
+		if (options.optimization.concatenateModules) {
+			const ModuleConcatenationPlugin = require("./optimize/ModuleConcatenationPlugin");
+			new ModuleConcatenationPlugin().apply(compiler);
+		}
+		if (options.optimization.splitChunks) {
+			const SplitChunksPlugin = require("./optimize/SplitChunksPlugin");
+			new SplitChunksPlugin(options.optimization.splitChunks).apply(compiler);
+		}
+		if (options.optimization.runtimeChunk) {
+			const RuntimeChunkPlugin = require("./optimize/RuntimeChunkPlugin");
+			new RuntimeChunkPlugin(options.optimization.runtimeChunk).apply(compiler);
+		}
+		if (!options.optimization.emitOnErrors) {
+			const NoEmitOnErrorsPlugin = require("./NoEmitOnErrorsPlugin");
+			new NoEmitOnErrorsPlugin().apply(compiler);
+		}
+		if (options.optimization.realContentHash) {
+			const RealContentHashPlugin = require("./optimize/RealContentHashPlugin");
+			new RealContentHashPlugin({
+				hashFunction: options.output.hashFunction,
+				hashDigest: options.output.hashDigest
+			}).apply(compiler);
+		}
+		if (options.optimization.checkWasmTypes) {
+			const WasmFinalizeExportsPlugin = require("./wasm-sync/WasmFinalizeExportsPlugin");
+			new WasmFinalizeExportsPlugin().apply(compiler);
+		}
+		const moduleIds = options.optimization.moduleIds;
+		if (moduleIds) {
+			switch (moduleIds) {
+				case "natural": {
+					const NaturalModuleIdsPlugin = require("./ids/NaturalModuleIdsPlugin");
+					new NaturalModuleIdsPlugin().apply(compiler);
+					break;
+				}
+				case "named": {
+					const NamedModuleIdsPlugin = require("./ids/NamedModuleIdsPlugin");
+					new NamedModuleIdsPlugin().apply(compiler);
+					break;
+				}
+				case "hashed": {
+					const WarnDeprecatedOptionPlugin = require("./WarnDeprecatedOptionPlugin");
+					const HashedModuleIdsPlugin = require("./ids/HashedModuleIdsPlugin");
+					new WarnDeprecatedOptionPlugin(
+						"optimization.moduleIds",
+						"hashed",
+						"deterministic"
+					).apply(compiler);
+					new HashedModuleIdsPlugin({
+						hashFunction: options.output.hashFunction
+					}).apply(compiler);
+					break;
+				}
+				case "deterministic": {
+					const DeterministicModuleIdsPlugin = require("./ids/DeterministicModuleIdsPlugin");
+					new DeterministicModuleIdsPlugin().apply(compiler);
+					break;
+				}
+				case "size": {
+					const OccurrenceModuleIdsPlugin = require("./ids/OccurrenceModuleIdsPlugin");
+					new OccurrenceModuleIdsPlugin({
+						prioritiseInitial: true
+					}).apply(compiler);
+					break;
+				}
+				default:
+					throw new Error(
+						`webpack bug: moduleIds: ${moduleIds} is not implemented`
+					);
+			}
+		}
+		const chunkIds = options.optimization.chunkIds;
+		if (chunkIds) {
+			switch (chunkIds) {
+				case "natural": {
+					const NaturalChunkIdsPlugin = require("./ids/NaturalChunkIdsPlugin");
+					new NaturalChunkIdsPlugin().apply(compiler);
+					break;
+				}
+				case "named": {
+					const NamedChunkIdsPlugin = require("./ids/NamedChunkIdsPlugin");
+					new NamedChunkIdsPlugin().apply(compiler);
+					break;
+				}
+				case "deterministic": {
+					const DeterministicChunkIdsPlugin = require("./ids/DeterministicChunkIdsPlugin");
+					new DeterministicChunkIdsPlugin().apply(compiler);
+					break;
+				}
+				case "size": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const OccurrenceChunkIdsPlugin = require("./ids/OccurrenceChunkIdsPlugin");
+					new OccurrenceChunkIdsPlugin({
+						prioritiseInitial: true
+					}).apply(compiler);
+					break;
+				}
+				case "total-size": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const OccurrenceChunkIdsPlugin = require("./ids/OccurrenceChunkIdsPlugin");
+					new OccurrenceChunkIdsPlugin({
+						prioritiseInitial: false
+					}).apply(compiler);
+					break;
+				}
+				default:
+					throw new Error(
+						`webpack bug: chunkIds: ${chunkIds} is not implemented`
+					);
+			}
+		}
+		if (options.optimization.nodeEnv) {
+			const DefinePlugin = require("./DefinePlugin");
+			new DefinePlugin({
+				"process.env.NODE_ENV": JSON.stringify(options.optimization.nodeEnv)
+			}).apply(compiler);
+		}
+		if (options.optimization.minimize) {
+			for (const minimizer of options.optimization.minimizer) {
+				if (typeof minimizer === "function") {
+					minimizer.call(compiler, compiler);
+				} else if (minimizer !== "...") {
+					minimizer.apply(compiler);
+				}
+			}
+		}
+
+		if (options.performance) {
+			const SizeLimitsPlugin = require("./performance/SizeLimitsPlugin");
+			new SizeLimitsPlugin(options.performance).apply(compiler);
+		}
+
+		new TemplatedPathPlugin().apply(compiler);
+
+		new RecordIdsPlugin({
+			portableIds: options.optimization.portableRecords
+		}).apply(compiler);
+
+		new WarnCaseSensitiveModulesPlugin().apply(compiler);
+
+		const AddManagedPathsPlugin = require("./cache/AddManagedPathsPlugin");
+		new AddManagedPathsPlugin(
+			options.snapshot.managedPaths,
+			options.snapshot.immutablePaths
+		).apply(compiler);
+
+		if (options.cache && typeof options.cache === "object") {
+			const cacheOptions = options.cache;
+			switch (cacheOptions.type) {
+				case "memory": {
+					if (isFinite(cacheOptions.maxGenerations)) {
+						//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+						const MemoryWithGcCachePlugin = require("./cache/MemoryWithGcCachePlugin");
+						new MemoryWithGcCachePlugin({
+							maxGenerations: cacheOptions.maxGenerations
+						}).apply(compiler);
+					} else {
+						//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+						const MemoryCachePlugin = require("./cache/MemoryCachePlugin");
+						new MemoryCachePlugin().apply(compiler);
+					}
+					if (cacheOptions.cacheUnaffected) {
+						if (!options.experiments.cacheUnaffected) {
+							throw new Error(
+								"'cache.cacheUnaffected: true' is only allowed when 'experiments.cacheUnaffected' is enabled"
+							);
+						}
+						compiler.moduleMemCaches = new Map();
+					}
+					break;
+				}
+				case "filesystem": {
+					const AddBuildDependenciesPlugin = require("./cache/AddBuildDependenciesPlugin");
+					for (const key in cacheOptions.buildDependencies) {
+						const list = cacheOptions.buildDependencies[key];
+						new AddBuildDependenciesPlugin(list).apply(compiler);
+					}
+					if (!isFinite(cacheOptions.maxMemoryGenerations)) {
+						//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+						const MemoryCachePlugin = require("./cache/MemoryCachePlugin");
+						new MemoryCachePlugin().apply(compiler);
+					} else if (cacheOptions.maxMemoryGenerations !== 0) {
+						//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+						const MemoryWithGcCachePlugin = require("./cache/MemoryWithGcCachePlugin");
+						new MemoryWithGcCachePlugin({
+							maxGenerations: cacheOptions.maxMemoryGenerations
+						}).apply(compiler);
+					}
+					if (cacheOptions.memoryCacheUnaffected) {
+						if (!options.experiments.cacheUnaffected) {
+							throw new Error(
+								"'cache.memoryCacheUnaffected: true' is only allowed when 'experiments.cacheUnaffected' is enabled"
+							);
+						}
+						compiler.moduleMemCaches = new Map();
+					}
+					switch (cacheOptions.store) {
+						case "pack": {
+							const IdleFileCachePlugin = require("./cache/IdleFileCachePlugin");
+							const PackFileCacheStrategy = require("./cache/PackFileCacheStrategy");
+							new IdleFileCachePlugin(
+								new PackFileCacheStrategy({
+									compiler,
+									fs: compiler.intermediateFileSystem,
+									context: options.context,
+									cacheLocation: cacheOptions.cacheLocation,
+									version: cacheOptions.version,
+									logger: compiler.getInfrastructureLogger(
+										"webpack.cache.PackFileCacheStrategy"
+									),
+									snapshot: options.snapshot,
+									maxAge: cacheOptions.maxAge,
+									profile: cacheOptions.profile,
+									allowCollectingMemory: cacheOptions.allowCollectingMemory,
+									compression: cacheOptions.compression
+								}),
+								cacheOptions.idleTimeout,
+								cacheOptions.idleTimeoutForInitialStore,
+								cacheOptions.idleTimeoutAfterLargeChanges
+							).apply(compiler);
+							break;
+						}
+						default:
+							throw new Error("Unhandled value for cache.store");
+					}
+					break;
+				}
+				default:
+					// @ts-expect-error Property 'type' does not exist on type 'never'. ts(2339)
+					throw new Error(`Unknown cache type ${cacheOptions.type}`);
+			}
+		}
+		new ResolverCachePlugin().apply(compiler);
+
+		if (options.ignoreWarnings && options.ignoreWarnings.length > 0) {
+			const IgnoreWarningsPlugin = require("./IgnoreWarningsPlugin");
+			new IgnoreWarningsPlugin(options.ignoreWarnings).apply(compiler);
+		}
+
+		compiler.hooks.afterPlugins.call(compiler);
+		if (!compiler.inputFileSystem) {
+			throw new Error("No input filesystem provided");
+		}
+		compiler.resolverFactory.hooks.resolveOptions
+			.for("normal")
+			.tap("WebpackOptionsApply", resolveOptions => {
+				resolveOptions = cleverMerge(options.resolve, resolveOptions);
+				resolveOptions.fileSystem = compiler.inputFileSystem;
+				return resolveOptions;
+			});
+		compiler.resolverFactory.hooks.resolveOptions
+			.for("context")
+			.tap("WebpackOptionsApply", resolveOptions => {
+				resolveOptions = cleverMerge(options.resolve, resolveOptions);
+				resolveOptions.fileSystem = compiler.inputFileSystem;
+				resolveOptions.resolveToContext = true;
+				return resolveOptions;
+			});
+		compiler.resolverFactory.hooks.resolveOptions
+			.for("loader")
+			.tap("WebpackOptionsApply", resolveOptions => {
+				resolveOptions = cleverMerge(options.resolveLoader, resolveOptions);
+				resolveOptions.fileSystem = compiler.inputFileSystem;
+				return resolveOptions;
+			});
+		compiler.hooks.afterResolvers.call(compiler);
+		return options;
+	}
+}
+
+module.exports = WebpackOptionsApply;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackOptionsDefaulter.js b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackOptionsDefaulter.js
new file mode 100644
index 0000000..dd12ddb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/WebpackOptionsDefaulter.js
@@ -0,0 +1,19 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { applyWebpackOptionsDefaults } = require("./config/defaults");
+const { getNormalizedWebpackOptions } = require("./config/normalization");
+
+class WebpackOptionsDefaulter {
+	process(options) {
+		options = getNormalizedWebpackOptions(options);
+		applyWebpackOptionsDefaults(options);
+		return options;
+	}
+}
+
+module.exports = WebpackOptionsDefaulter;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetGenerator.js
new file mode 100644
index 0000000..0ee074d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetGenerator.js
@@ -0,0 +1,464 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const mimeTypes = require("mime-types");
+const path = require("path");
+const { RawSource } = require("webpack-sources");
+const Generator = require("../Generator");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const createHash = require("../util/createHash");
+const { makePathsRelative } = require("../util/identifier");
+const nonNumericOnlyHash = require("../util/nonNumericOnlyHash");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").AssetGeneratorOptions} AssetGeneratorOptions */
+/** @typedef {import("../../declarations/WebpackOptions").AssetModuleOutputPath} AssetModuleOutputPath */
+/** @typedef {import("../../declarations/WebpackOptions").RawPublicPath} RawPublicPath */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../Generator").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../util/Hash")} Hash */
+
+const mergeMaybeArrays = (a, b) => {
+	const set = new Set();
+	if (Array.isArray(a)) for (const item of a) set.add(item);
+	else set.add(a);
+	if (Array.isArray(b)) for (const item of b) set.add(item);
+	else set.add(b);
+	return Array.from(set);
+};
+
+const mergeAssetInfo = (a, b) => {
+	const result = { ...a, ...b };
+	for (const key of Object.keys(a)) {
+		if (key in b) {
+			if (a[key] === b[key]) continue;
+			switch (key) {
+				case "fullhash":
+				case "chunkhash":
+				case "modulehash":
+				case "contenthash":
+					result[key] = mergeMaybeArrays(a[key], b[key]);
+					break;
+				case "immutable":
+				case "development":
+				case "hotModuleReplacement":
+				case "javascriptModule":
+					result[key] = a[key] || b[key];
+					break;
+				case "related":
+					result[key] = mergeRelatedInfo(a[key], b[key]);
+					break;
+				default:
+					throw new Error(`Can't handle conflicting asset info for ${key}`);
+			}
+		}
+	}
+	return result;
+};
+
+const mergeRelatedInfo = (a, b) => {
+	const result = { ...a, ...b };
+	for (const key of Object.keys(a)) {
+		if (key in b) {
+			if (a[key] === b[key]) continue;
+			result[key] = mergeMaybeArrays(a[key], b[key]);
+		}
+	}
+	return result;
+};
+
+const encodeDataUri = (encoding, source) => {
+	let encodedContent;
+
+	switch (encoding) {
+		case "base64": {
+			encodedContent = source.buffer().toString("base64");
+			break;
+		}
+		case false: {
+			const content = source.source();
+
+			if (typeof content !== "string") {
+				encodedContent = content.toString("utf-8");
+			}
+
+			encodedContent = encodeURIComponent(encodedContent).replace(
+				/[!'()*]/g,
+				character => "%" + character.codePointAt(0).toString(16)
+			);
+			break;
+		}
+		default:
+			throw new Error(`Unsupported encoding '${encoding}'`);
+	}
+
+	return encodedContent;
+};
+
+const decodeDataUriContent = (encoding, content) => {
+	const isBase64 = encoding === "base64";
+	return isBase64
+		? Buffer.from(content, "base64")
+		: Buffer.from(decodeURIComponent(content), "ascii");
+};
+
+const JS_TYPES = new Set(["javascript"]);
+const JS_AND_ASSET_TYPES = new Set(["javascript", "asset"]);
+const DEFAULT_ENCODING = "base64";
+
+class AssetGenerator extends Generator {
+	/**
+	 * @param {AssetGeneratorOptions["dataUrl"]=} dataUrlOptions the options for the data url
+	 * @param {string=} filename override for output.assetModuleFilename
+	 * @param {RawPublicPath=} publicPath override for output.assetModulePublicPath
+	 * @param {AssetModuleOutputPath=} outputPath the output path for the emitted file which is not included in the runtime import
+	 * @param {boolean=} emit generate output asset
+	 */
+	constructor(dataUrlOptions, filename, publicPath, outputPath, emit) {
+		super();
+		this.dataUrlOptions = dataUrlOptions;
+		this.filename = filename;
+		this.publicPath = publicPath;
+		this.outputPath = outputPath;
+		this.emit = emit;
+	}
+
+	/**
+	 * @param {NormalModule} module module
+	 * @param {RuntimeTemplate} runtimeTemplate runtime template
+	 * @returns {string} source file name
+	 */
+	getSourceFileName(module, runtimeTemplate) {
+		return makePathsRelative(
+			runtimeTemplate.compilation.compiler.context,
+			module.matchResource || module.resource,
+			runtimeTemplate.compilation.compiler.root
+		).replace(/^\.\//, "");
+	}
+
+	/**
+	 * @param {NormalModule} module module
+	 * @returns {string} mime type
+	 */
+	getMimeType(module) {
+		if (typeof this.dataUrlOptions === "function") {
+			throw new Error(
+				"This method must not be called when dataUrlOptions is a function"
+			);
+		}
+
+		let mimeType = this.dataUrlOptions.mimetype;
+		if (mimeType === undefined) {
+			const ext = path.extname(module.nameForCondition());
+			if (
+				module.resourceResolveData &&
+				module.resourceResolveData.mimetype !== undefined
+			) {
+				mimeType =
+					module.resourceResolveData.mimetype +
+					module.resourceResolveData.parameters;
+			} else if (ext) {
+				mimeType = mimeTypes.lookup(ext);
+
+				if (typeof mimeType !== "string") {
+					throw new Error(
+						"DataUrl can't be generated automatically, " +
+							`because there is no mimetype for "${ext}" in mimetype database. ` +
+							'Either pass a mimetype via "generator.mimetype" or ' +
+							'use type: "asset/resource" to create a resource file instead of a DataUrl'
+					);
+				}
+			}
+		}
+
+		if (typeof mimeType !== "string") {
+			throw new Error(
+				"DataUrl can't be generated automatically. " +
+					'Either pass a mimetype via "generator.mimetype" or ' +
+					'use type: "asset/resource" to create a resource file instead of a DataUrl'
+			);
+		}
+
+		return mimeType;
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(
+		module,
+		{ runtime, chunkGraph, runtimeTemplate, runtimeRequirements, type, getData }
+	) {
+		switch (type) {
+			case "asset":
+				return module.originalSource();
+			default: {
+				runtimeRequirements.add(RuntimeGlobals.module);
+
+				const originalSource = module.originalSource();
+				if (module.buildInfo.dataUrl) {
+					let encodedSource;
+					if (typeof this.dataUrlOptions === "function") {
+						encodedSource = this.dataUrlOptions.call(
+							null,
+							originalSource.source(),
+							{
+								filename: module.matchResource || module.resource,
+								module
+							}
+						);
+					} else {
+						/** @type {string | false | undefined} */
+						let encoding = this.dataUrlOptions.encoding;
+						if (encoding === undefined) {
+							if (
+								module.resourceResolveData &&
+								module.resourceResolveData.encoding !== undefined
+							) {
+								encoding = module.resourceResolveData.encoding;
+							}
+						}
+						if (encoding === undefined) {
+							encoding = DEFAULT_ENCODING;
+						}
+						const mimeType = this.getMimeType(module);
+
+						let encodedContent;
+
+						if (
+							module.resourceResolveData &&
+							module.resourceResolveData.encoding === encoding &&
+							decodeDataUriContent(
+								module.resourceResolveData.encoding,
+								module.resourceResolveData.encodedContent
+							).equals(originalSource.buffer())
+						) {
+							encodedContent = module.resourceResolveData.encodedContent;
+						} else {
+							encodedContent = encodeDataUri(encoding, originalSource);
+						}
+
+						encodedSource = `data:${mimeType}${
+							encoding ? `;${encoding}` : ""
+						},${encodedContent}`;
+					}
+					const data = getData();
+					data.set("url", Buffer.from(encodedSource));
+					return new RawSource(
+						`${RuntimeGlobals.module}.exports = ${JSON.stringify(
+							encodedSource
+						)};`
+					);
+				} else {
+					const assetModuleFilename =
+						this.filename || runtimeTemplate.outputOptions.assetModuleFilename;
+					const hash = createHash(runtimeTemplate.outputOptions.hashFunction);
+					if (runtimeTemplate.outputOptions.hashSalt) {
+						hash.update(runtimeTemplate.outputOptions.hashSalt);
+					}
+					hash.update(originalSource.buffer());
+					const fullHash = /** @type {string} */ (
+						hash.digest(runtimeTemplate.outputOptions.hashDigest)
+					);
+					const contentHash = nonNumericOnlyHash(
+						fullHash,
+						runtimeTemplate.outputOptions.hashDigestLength
+					);
+					module.buildInfo.fullContentHash = fullHash;
+					const sourceFilename = this.getSourceFileName(
+						module,
+						runtimeTemplate
+					);
+					let { path: filename, info: assetInfo } =
+						runtimeTemplate.compilation.getAssetPathWithInfo(
+							assetModuleFilename,
+							{
+								module,
+								runtime,
+								filename: sourceFilename,
+								chunkGraph,
+								contentHash
+							}
+						);
+					let assetPath;
+					if (this.publicPath !== undefined) {
+						const { path, info } =
+							runtimeTemplate.compilation.getAssetPathWithInfo(
+								this.publicPath,
+								{
+									module,
+									runtime,
+									filename: sourceFilename,
+									chunkGraph,
+									contentHash
+								}
+							);
+						assetInfo = mergeAssetInfo(assetInfo, info);
+						assetPath = JSON.stringify(path + filename);
+					} else {
+						runtimeRequirements.add(RuntimeGlobals.publicPath); // add __webpack_require__.p
+						assetPath = runtimeTemplate.concatenation(
+							{ expr: RuntimeGlobals.publicPath },
+							filename
+						);
+					}
+					assetInfo = {
+						sourceFilename,
+						...assetInfo
+					};
+					if (this.outputPath) {
+						const { path: outputPath, info } =
+							runtimeTemplate.compilation.getAssetPathWithInfo(
+								this.outputPath,
+								{
+									module,
+									runtime,
+									filename: sourceFilename,
+									chunkGraph,
+									contentHash
+								}
+							);
+						assetInfo = mergeAssetInfo(assetInfo, info);
+						filename = path.posix.join(outputPath, filename);
+					}
+					module.buildInfo.filename = filename;
+					module.buildInfo.assetInfo = assetInfo;
+					if (getData) {
+						// Due to code generation caching module.buildInfo.XXX can't used to store such information
+						// It need to be stored in the code generation results instead, where it's cached too
+						// TODO webpack 6 For back-compat reasons we also store in on module.buildInfo
+						const data = getData();
+						data.set("fullContentHash", fullHash);
+						data.set("filename", filename);
+						data.set("assetInfo", assetInfo);
+					}
+
+					return new RawSource(
+						`${RuntimeGlobals.module}.exports = ${assetPath};`
+					);
+				}
+			}
+		}
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		if ((module.buildInfo && module.buildInfo.dataUrl) || this.emit === false) {
+			return JS_TYPES;
+		} else {
+			return JS_AND_ASSET_TYPES;
+		}
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		switch (type) {
+			case "asset": {
+				const originalSource = module.originalSource();
+
+				if (!originalSource) {
+					return 0;
+				}
+
+				return originalSource.size();
+			}
+			default:
+				if (module.buildInfo && module.buildInfo.dataUrl) {
+					const originalSource = module.originalSource();
+
+					if (!originalSource) {
+						return 0;
+					}
+
+					// roughly for data url
+					// Example: m.exports="data:image/png;base64,ag82/f+2=="
+					// 4/3 = base64 encoding
+					// 34 = ~ data url header + footer + rounding
+					return originalSource.size() * 1.34 + 36;
+				} else {
+					// it's only estimated so this number is probably fine
+					// Example: m.exports=r.p+"0123456789012345678901.ext"
+					return 42;
+				}
+		}
+	}
+
+	/**
+	 * @param {Hash} hash hash that will be modified
+	 * @param {UpdateHashContext} updateHashContext context for updating hash
+	 */
+	updateHash(hash, { module, runtime, runtimeTemplate, chunkGraph }) {
+		if (module.buildInfo.dataUrl) {
+			hash.update("data-url");
+			// this.dataUrlOptions as function should be pure and only depend on input source and filename
+			// therefore it doesn't need to be hashed
+			if (typeof this.dataUrlOptions === "function") {
+				const ident = /** @type {{ ident?: string }} */ (this.dataUrlOptions)
+					.ident;
+				if (ident) hash.update(ident);
+			} else {
+				if (
+					this.dataUrlOptions.encoding &&
+					this.dataUrlOptions.encoding !== DEFAULT_ENCODING
+				) {
+					hash.update(this.dataUrlOptions.encoding);
+				}
+				if (this.dataUrlOptions.mimetype)
+					hash.update(this.dataUrlOptions.mimetype);
+				// computed mimetype depends only on module filename which is already part of the hash
+			}
+		} else {
+			hash.update("resource");
+
+			const pathData = {
+				module,
+				runtime,
+				filename: this.getSourceFileName(module, runtimeTemplate),
+				chunkGraph,
+				contentHash: runtimeTemplate.contentHashReplacement
+			};
+
+			if (typeof this.publicPath === "function") {
+				hash.update("path");
+				const assetInfo = {};
+				hash.update(this.publicPath(pathData, assetInfo));
+				hash.update(JSON.stringify(assetInfo));
+			} else if (this.publicPath) {
+				hash.update("path");
+				hash.update(this.publicPath);
+			} else {
+				hash.update("no-path");
+			}
+
+			const assetModuleFilename =
+				this.filename || runtimeTemplate.outputOptions.assetModuleFilename;
+			const { path: filename, info } =
+				runtimeTemplate.compilation.getAssetPathWithInfo(
+					assetModuleFilename,
+					pathData
+				);
+			hash.update(filename);
+			hash.update(JSON.stringify(info));
+		}
+	}
+}
+
+module.exports = AssetGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetModulesPlugin.js
new file mode 100644
index 0000000..c01fd84
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetModulesPlugin.js
@@ -0,0 +1,223 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Yuta Hiroto @hiroppy
+*/
+
+"use strict";
+
+const { cleverMerge } = require("../util/cleverMerge");
+const { compareModulesByIdentifier } = require("../util/comparators");
+const createSchemaValidation = require("../util/create-schema-validation");
+const memoize = require("../util/memoize");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+const getSchema = name => {
+	const { definitions } = require("../../schemas/WebpackOptions.json");
+	return {
+		definitions,
+		oneOf: [{ $ref: `#/definitions/${name}` }]
+	};
+};
+
+const generatorValidationOptions = {
+	name: "Asset Modules Plugin",
+	baseDataPath: "generator"
+};
+const validateGeneratorOptions = {
+	asset: createSchemaValidation(
+		require("../../schemas/plugins/asset/AssetGeneratorOptions.check.js"),
+		() => getSchema("AssetGeneratorOptions"),
+		generatorValidationOptions
+	),
+	"asset/resource": createSchemaValidation(
+		require("../../schemas/plugins/asset/AssetResourceGeneratorOptions.check.js"),
+		() => getSchema("AssetResourceGeneratorOptions"),
+		generatorValidationOptions
+	),
+	"asset/inline": createSchemaValidation(
+		require("../../schemas/plugins/asset/AssetInlineGeneratorOptions.check.js"),
+		() => getSchema("AssetInlineGeneratorOptions"),
+		generatorValidationOptions
+	)
+};
+
+const validateParserOptions = createSchemaValidation(
+	require("../../schemas/plugins/asset/AssetParserOptions.check.js"),
+	() => getSchema("AssetParserOptions"),
+	{
+		name: "Asset Modules Plugin",
+		baseDataPath: "parser"
+	}
+);
+
+const getAssetGenerator = memoize(() => require("./AssetGenerator"));
+const getAssetParser = memoize(() => require("./AssetParser"));
+const getAssetSourceParser = memoize(() => require("./AssetSourceParser"));
+const getAssetSourceGenerator = memoize(() =>
+	require("./AssetSourceGenerator")
+);
+
+const type = "asset";
+const plugin = "AssetModulesPlugin";
+
+class AssetModulesPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			plugin,
+			(compilation, { normalModuleFactory }) => {
+				normalModuleFactory.hooks.createParser
+					.for("asset")
+					.tap(plugin, parserOptions => {
+						validateParserOptions(parserOptions);
+						parserOptions = cleverMerge(
+							compiler.options.module.parser.asset,
+							parserOptions
+						);
+
+						let dataUrlCondition = parserOptions.dataUrlCondition;
+						if (!dataUrlCondition || typeof dataUrlCondition === "object") {
+							dataUrlCondition = {
+								maxSize: 8096,
+								...dataUrlCondition
+							};
+						}
+
+						const AssetParser = getAssetParser();
+
+						return new AssetParser(dataUrlCondition);
+					});
+				normalModuleFactory.hooks.createParser
+					.for("asset/inline")
+					.tap(plugin, parserOptions => {
+						const AssetParser = getAssetParser();
+
+						return new AssetParser(true);
+					});
+				normalModuleFactory.hooks.createParser
+					.for("asset/resource")
+					.tap(plugin, parserOptions => {
+						const AssetParser = getAssetParser();
+
+						return new AssetParser(false);
+					});
+				normalModuleFactory.hooks.createParser
+					.for("asset/source")
+					.tap(plugin, parserOptions => {
+						const AssetSourceParser = getAssetSourceParser();
+
+						return new AssetSourceParser();
+					});
+
+				for (const type of ["asset", "asset/inline", "asset/resource"]) {
+					normalModuleFactory.hooks.createGenerator
+						.for(type)
+						.tap(plugin, generatorOptions => {
+							validateGeneratorOptions[type](generatorOptions);
+
+							let dataUrl = undefined;
+							if (type !== "asset/resource") {
+								dataUrl = generatorOptions.dataUrl;
+								if (!dataUrl || typeof dataUrl === "object") {
+									dataUrl = {
+										encoding: undefined,
+										mimetype: undefined,
+										...dataUrl
+									};
+								}
+							}
+
+							let filename = undefined;
+							let publicPath = undefined;
+							let outputPath = undefined;
+							if (type !== "asset/inline") {
+								filename = generatorOptions.filename;
+								publicPath = generatorOptions.publicPath;
+								outputPath = generatorOptions.outputPath;
+							}
+
+							const AssetGenerator = getAssetGenerator();
+
+							return new AssetGenerator(
+								dataUrl,
+								filename,
+								publicPath,
+								outputPath,
+								generatorOptions.emit !== false
+							);
+						});
+				}
+				normalModuleFactory.hooks.createGenerator
+					.for("asset/source")
+					.tap(plugin, () => {
+						const AssetSourceGenerator = getAssetSourceGenerator();
+
+						return new AssetSourceGenerator();
+					});
+
+				compilation.hooks.renderManifest.tap(plugin, (result, options) => {
+					const { chunkGraph } = compilation;
+					const { chunk, codeGenerationResults } = options;
+
+					const modules = chunkGraph.getOrderedChunkModulesIterableBySourceType(
+						chunk,
+						"asset",
+						compareModulesByIdentifier
+					);
+					if (modules) {
+						for (const module of modules) {
+							try {
+								const codeGenResult = codeGenerationResults.get(
+									module,
+									chunk.runtime
+								);
+								result.push({
+									render: () => codeGenResult.sources.get(type),
+									filename:
+										module.buildInfo.filename ||
+										codeGenResult.data.get("filename"),
+									info:
+										module.buildInfo.assetInfo ||
+										codeGenResult.data.get("assetInfo"),
+									auxiliary: true,
+									identifier: `assetModule${chunkGraph.getModuleId(module)}`,
+									hash:
+										module.buildInfo.fullContentHash ||
+										codeGenResult.data.get("fullContentHash")
+								});
+							} catch (e) {
+								e.message += `\nduring rendering of asset ${module.identifier()}`;
+								throw e;
+							}
+						}
+					}
+
+					return result;
+				});
+
+				compilation.hooks.prepareModuleExecution.tap(
+					"AssetModulesPlugin",
+					(options, context) => {
+						const { codeGenerationResult } = options;
+						const source = codeGenerationResult.sources.get("asset");
+						if (source === undefined) return;
+						context.assets.set(codeGenerationResult.data.get("filename"), {
+							source,
+							info: codeGenerationResult.data.get("assetInfo")
+						});
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = AssetModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetParser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetParser.js
new file mode 100644
index 0000000..7a0a4e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetParser.js
@@ -0,0 +1,56 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Yuta Hiroto @hiroppy
+*/
+
+"use strict";
+
+const Parser = require("../Parser");
+
+/** @typedef {import("../../declarations/WebpackOptions").AssetParserOptions} AssetParserOptions */
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../Parser").PreparsedAst} PreparsedAst */
+
+class AssetParser extends Parser {
+	/**
+	 * @param {AssetParserOptions["dataUrlCondition"] | boolean} dataUrlCondition condition for inlining as DataUrl
+	 */
+	constructor(dataUrlCondition) {
+		super();
+		this.dataUrlCondition = dataUrlCondition;
+	}
+
+	/**
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		if (typeof source === "object" && !Buffer.isBuffer(source)) {
+			throw new Error("AssetParser doesn't accept preparsed AST");
+		}
+		state.module.buildInfo.strict = true;
+		state.module.buildMeta.exportsType = "default";
+
+		if (typeof this.dataUrlCondition === "function") {
+			state.module.buildInfo.dataUrl = this.dataUrlCondition(source, {
+				filename: state.module.matchResource || state.module.resource,
+				module: state.module
+			});
+		} else if (typeof this.dataUrlCondition === "boolean") {
+			state.module.buildInfo.dataUrl = this.dataUrlCondition;
+		} else if (
+			this.dataUrlCondition &&
+			typeof this.dataUrlCondition === "object"
+		) {
+			state.module.buildInfo.dataUrl =
+				Buffer.byteLength(source) <= this.dataUrlCondition.maxSize;
+		} else {
+			throw new Error("Unexpected dataUrlCondition type");
+		}
+
+		return state;
+	}
+}
+
+module.exports = AssetParser;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetSourceGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetSourceGenerator.js
new file mode 100644
index 0000000..f8720a2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetSourceGenerator.js
@@ -0,0 +1,71 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const Generator = require("../Generator");
+const RuntimeGlobals = require("../RuntimeGlobals");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../NormalModule")} NormalModule */
+
+const TYPES = new Set(["javascript"]);
+
+class AssetSourceGenerator extends Generator {
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, { chunkGraph, runtimeTemplate, runtimeRequirements }) {
+		runtimeRequirements.add(RuntimeGlobals.module);
+
+		const originalSource = module.originalSource();
+
+		if (!originalSource) {
+			return new RawSource("");
+		}
+
+		const content = originalSource.source();
+
+		let encodedSource;
+		if (typeof content === "string") {
+			encodedSource = content;
+		} else {
+			encodedSource = content.toString("utf-8");
+		}
+		return new RawSource(
+			`${RuntimeGlobals.module}.exports = ${JSON.stringify(encodedSource)};`
+		);
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		const originalSource = module.originalSource();
+
+		if (!originalSource) {
+			return 0;
+		}
+
+		// Example: m.exports="abcd"
+		return originalSource.size() + 12;
+	}
+}
+
+module.exports = AssetSourceGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetSourceParser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetSourceParser.js
new file mode 100644
index 0000000..505c363
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/AssetSourceParser.js
@@ -0,0 +1,31 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Yuta Hiroto @hiroppy
+*/
+
+"use strict";
+
+const Parser = require("../Parser");
+
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../Parser").PreparsedAst} PreparsedAst */
+
+class AssetSourceParser extends Parser {
+	/**
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		if (typeof source === "object" && !Buffer.isBuffer(source)) {
+			throw new Error("AssetSourceParser doesn't accept preparsed AST");
+		}
+		const { module } = state;
+		module.buildInfo.strict = true;
+		module.buildMeta.exportsType = "default";
+
+		return state;
+	}
+}
+
+module.exports = AssetSourceParser;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/asset/RawDataUrlModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/RawDataUrlModule.js
new file mode 100644
index 0000000..ffdd71e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/asset/RawDataUrlModule.js
@@ -0,0 +1,148 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const Module = require("../Module");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["javascript"]);
+
+class RawDataUrlModule extends Module {
+	/**
+	 * @param {string} url raw url
+	 * @param {string} identifier unique identifier
+	 * @param {string=} readableIdentifier readable identifier
+	 */
+	constructor(url, identifier, readableIdentifier) {
+		super("asset/raw-data-url", null);
+		this.url = url;
+		this.urlBuffer = url ? Buffer.from(url) : undefined;
+		this.identifierStr = identifier || this.url;
+		this.readableIdentifierStr = readableIdentifier || this.identifierStr;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return this.identifierStr;
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		if (this.url === undefined) this.url = this.urlBuffer.toString();
+		return Math.max(1, this.url.length);
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return requestShortener.shorten(this.readableIdentifierStr);
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		return callback(null, !this.buildMeta);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {
+			cacheable: true
+		};
+		callback();
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration(context) {
+		if (this.url === undefined) this.url = this.urlBuffer.toString();
+		const sources = new Map();
+		sources.set(
+			"javascript",
+			new RawSource(`module.exports = ${JSON.stringify(this.url)};`)
+		);
+		const data = new Map();
+		data.set("url", this.urlBuffer);
+		const runtimeRequirements = new Set();
+		runtimeRequirements.add(RuntimeGlobals.module);
+		return { sources, runtimeRequirements, data };
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		hash.update(this.urlBuffer);
+		super.updateHash(hash, context);
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.urlBuffer);
+		write(this.identifierStr);
+		write(this.readableIdentifierStr);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.urlBuffer = read();
+		this.identifierStr = read();
+		this.readableIdentifierStr = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(RawDataUrlModule, "webpack/lib/asset/RawDataUrlModule");
+
+module.exports = RawDataUrlModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/async-modules/AwaitDependenciesInitFragment.js b/node_modules/mathjs/examples/node_modules/webpack/lib/async-modules/AwaitDependenciesInitFragment.js
new file mode 100644
index 0000000..b31750c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/async-modules/AwaitDependenciesInitFragment.js
@@ -0,0 +1,69 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+
+/**
+ * @typedef {GenerateContext} Context
+ */
+class AwaitDependenciesInitFragment extends InitFragment {
+	/**
+	 * @param {Set<string>} promises the promises that should be awaited
+	 */
+	constructor(promises) {
+		super(
+			undefined,
+			InitFragment.STAGE_ASYNC_DEPENDENCIES,
+			0,
+			"await-dependencies"
+		);
+		this.promises = promises;
+	}
+
+	merge(other) {
+		const promises = new Set(other.promises);
+		for (const p of this.promises) {
+			promises.add(p);
+		}
+		return new AwaitDependenciesInitFragment(promises);
+	}
+
+	/**
+	 * @param {Context} context context
+	 * @returns {string|Source} the source code that will be included as initialization code
+	 */
+	getContent({ runtimeRequirements }) {
+		runtimeRequirements.add(RuntimeGlobals.module);
+		const promises = this.promises;
+		if (promises.size === 0) {
+			return "";
+		}
+		if (promises.size === 1) {
+			for (const p of promises) {
+				return Template.asString([
+					`var __webpack_async_dependencies__ = __webpack_handle_async_dependencies__([${p}]);`,
+					`${p} = (__webpack_async_dependencies__.then ? (await __webpack_async_dependencies__)() : __webpack_async_dependencies__)[0];`,
+					""
+				]);
+			}
+		}
+		const sepPromises = Array.from(promises).join(", ");
+		// TODO check if destructuring is supported
+		return Template.asString([
+			`var __webpack_async_dependencies__ = __webpack_handle_async_dependencies__([${sepPromises}]);`,
+			`([${sepPromises}] = __webpack_async_dependencies__.then ? (await __webpack_async_dependencies__)() : __webpack_async_dependencies__);`,
+			""
+		]);
+	}
+}
+
+module.exports = AwaitDependenciesInitFragment;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/async-modules/InferAsyncModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/async-modules/InferAsyncModulesPlugin.js
new file mode 100644
index 0000000..9e64972
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/async-modules/InferAsyncModulesPlugin.js
@@ -0,0 +1,55 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const HarmonyImportDependency = require("../dependencies/HarmonyImportDependency");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class InferAsyncModulesPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("InferAsyncModulesPlugin", compilation => {
+			const { moduleGraph } = compilation;
+			compilation.hooks.finishModules.tap(
+				"InferAsyncModulesPlugin",
+				modules => {
+					/** @type {Set<Module>} */
+					const queue = new Set();
+					for (const module of modules) {
+						if (module.buildMeta && module.buildMeta.async) {
+							queue.add(module);
+						}
+					}
+					for (const module of queue) {
+						moduleGraph.setAsync(module);
+						for (const [
+							originModule,
+							connections
+						] of moduleGraph.getIncomingConnectionsByOriginModule(module)) {
+							if (
+								connections.some(
+									c =>
+										c.dependency instanceof HarmonyImportDependency &&
+										c.isTargetActive(undefined)
+								)
+							) {
+								queue.add(originModule);
+							}
+						}
+					}
+				}
+			);
+		});
+	}
+}
+
+module.exports = InferAsyncModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/buildChunkGraph.js b/node_modules/mathjs/examples/node_modules/webpack/lib/buildChunkGraph.js
new file mode 100644
index 0000000..0e9e2cc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/buildChunkGraph.js
@@ -0,0 +1,1401 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const AsyncDependencyToInitialChunkError = require("./AsyncDependencyToInitialChunkError");
+const { connectChunkGroupParentAndChild } = require("./GraphHelpers");
+const ModuleGraphConnection = require("./ModuleGraphConnection");
+const { getEntryRuntime, mergeRuntime } = require("./util/runtime");
+
+/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("./Chunk")} Chunk */
+/** @typedef {import("./ChunkGroup")} ChunkGroup */
+/** @typedef {import("./Compilation")} Compilation */
+/** @typedef {import("./DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("./Dependency")} Dependency */
+/** @typedef {import("./Entrypoint")} Entrypoint */
+/** @typedef {import("./Module")} Module */
+/** @typedef {import("./ModuleGraph")} ModuleGraph */
+/** @typedef {import("./ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("./logging/Logger").Logger} Logger */
+/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} QueueItem
+ * @property {number} action
+ * @property {DependenciesBlock} block
+ * @property {Module} module
+ * @property {Chunk} chunk
+ * @property {ChunkGroup} chunkGroup
+ * @property {ChunkGroupInfo} chunkGroupInfo
+ */
+
+/** @typedef {Set<Module> & { plus: Set<Module> }} ModuleSetPlus */
+
+/**
+ * @typedef {Object} ChunkGroupInfo
+ * @property {ChunkGroup} chunkGroup the chunk group
+ * @property {RuntimeSpec} runtime the runtimes
+ * @property {ModuleSetPlus} minAvailableModules current minimal set of modules available at this point
+ * @property {boolean} minAvailableModulesOwned true, if minAvailableModules is owned and can be modified
+ * @property {ModuleSetPlus[]} availableModulesToBeMerged enqueued updates to the minimal set of available modules
+ * @property {Set<Module>=} skippedItems modules that were skipped because module is already available in parent chunks (need to reconsider when minAvailableModules is shrinking)
+ * @property {Set<[Module, ConnectionState]>=} skippedModuleConnections referenced modules that where skipped because they were not active in this runtime
+ * @property {ModuleSetPlus} resultingAvailableModules set of modules available including modules from this chunk group
+ * @property {Set<ChunkGroupInfo>} children set of children chunk groups, that will be revisited when availableModules shrink
+ * @property {Set<ChunkGroupInfo>} availableSources set of chunk groups that are the source for minAvailableModules
+ * @property {Set<ChunkGroupInfo>} availableChildren set of chunk groups which depend on the this chunk group as availableSource
+ * @property {number} preOrderIndex next pre order index
+ * @property {number} postOrderIndex next post order index
+ * @property {boolean} chunkLoading has a chunk loading mechanism
+ * @property {boolean} asyncChunks create async chunks
+ */
+
+/**
+ * @typedef {Object} BlockChunkGroupConnection
+ * @property {ChunkGroupInfo} originChunkGroupInfo origin chunk group
+ * @property {ChunkGroup} chunkGroup referenced chunk group
+ */
+
+const EMPTY_SET = /** @type {ModuleSetPlus} */ (new Set());
+EMPTY_SET.plus = EMPTY_SET;
+
+/**
+ * @param {ModuleSetPlus} a first set
+ * @param {ModuleSetPlus} b second set
+ * @returns {number} cmp
+ */
+const bySetSize = (a, b) => {
+	return b.size + b.plus.size - a.size - a.plus.size;
+};
+
+const extractBlockModules = (module, moduleGraph, runtime, blockModulesMap) => {
+	let blockCache;
+	let modules;
+
+	const arrays = [];
+
+	const queue = [module];
+	while (queue.length > 0) {
+		const block = queue.pop();
+		const arr = [];
+		arrays.push(arr);
+		blockModulesMap.set(block, arr);
+		for (const b of block.blocks) {
+			queue.push(b);
+		}
+	}
+
+	for (const connection of moduleGraph.getOutgoingConnections(module)) {
+		const d = connection.dependency;
+		// We skip connections without dependency
+		if (!d) continue;
+		const m = connection.module;
+		// We skip connections without Module pointer
+		if (!m) continue;
+		// We skip weak connections
+		if (connection.weak) continue;
+		const state = connection.getActiveState(runtime);
+		// We skip inactive connections
+		if (state === false) continue;
+
+		const block = moduleGraph.getParentBlock(d);
+		let index = moduleGraph.getParentBlockIndex(d);
+
+		// deprecated fallback
+		if (index < 0) {
+			index = block.dependencies.indexOf(d);
+		}
+
+		if (blockCache !== block) {
+			modules = blockModulesMap.get((blockCache = block));
+		}
+
+		const i = index << 2;
+		modules[i] = m;
+		modules[i + 1] = state;
+	}
+
+	for (const modules of arrays) {
+		if (modules.length === 0) continue;
+		let indexMap;
+		let length = 0;
+		outer: for (let j = 0; j < modules.length; j += 2) {
+			const m = modules[j];
+			if (m === undefined) continue;
+			const state = modules[j + 1];
+			if (indexMap === undefined) {
+				let i = 0;
+				for (; i < length; i += 2) {
+					if (modules[i] === m) {
+						const merged = modules[i + 1];
+						if (merged === true) continue outer;
+						modules[i + 1] = ModuleGraphConnection.addConnectionStates(
+							merged,
+							state
+						);
+					}
+				}
+				modules[length] = m;
+				length++;
+				modules[length] = state;
+				length++;
+				if (length > 30) {
+					// To avoid worse case performance, we will use an index map for
+					// linear cost access, which allows to maintain O(n) complexity
+					// while keeping allocations down to a minimum
+					indexMap = new Map();
+					for (let i = 0; i < length; i += 2) {
+						indexMap.set(modules[i], i + 1);
+					}
+				}
+			} else {
+				const idx = indexMap.get(m);
+				if (idx !== undefined) {
+					const merged = modules[idx];
+					if (merged === true) continue outer;
+					modules[idx] = ModuleGraphConnection.addConnectionStates(
+						merged,
+						state
+					);
+				} else {
+					modules[length] = m;
+					length++;
+					modules[length] = state;
+					indexMap.set(m, length);
+					length++;
+				}
+			}
+		}
+		modules.length = length;
+	}
+};
+
+/**
+ *
+ * @param {Logger} logger a logger
+ * @param {Compilation} compilation the compilation
+ * @param {Map<Entrypoint, Module[]>} inputEntrypointsAndModules chunk groups which are processed with the modules
+ * @param {Map<ChunkGroup, ChunkGroupInfo>} chunkGroupInfoMap mapping from chunk group to available modules
+ * @param {Map<AsyncDependenciesBlock, BlockChunkGroupConnection[]>} blockConnections connection for blocks
+ * @param {Set<DependenciesBlock>} blocksWithNestedBlocks flag for blocks that have nested blocks
+ * @param {Set<ChunkGroup>} allCreatedChunkGroups filled with all chunk groups that are created here
+ */
+const visitModules = (
+	logger,
+	compilation,
+	inputEntrypointsAndModules,
+	chunkGroupInfoMap,
+	blockConnections,
+	blocksWithNestedBlocks,
+	allCreatedChunkGroups
+) => {
+	const { moduleGraph, chunkGraph, moduleMemCaches } = compilation;
+
+	const blockModulesRuntimeMap = new Map();
+
+	/** @type {RuntimeSpec | false} */
+	let blockModulesMapRuntime = false;
+	let blockModulesMap;
+
+	/**
+	 *
+	 * @param {DependenciesBlock} block block
+	 * @param {RuntimeSpec} runtime runtime
+	 * @returns {(Module | ConnectionState)[]} block modules in flatten tuples
+	 */
+	const getBlockModules = (block, runtime) => {
+		if (blockModulesMapRuntime !== runtime) {
+			blockModulesMap = blockModulesRuntimeMap.get(runtime);
+			if (blockModulesMap === undefined) {
+				blockModulesMap = new Map();
+				blockModulesRuntimeMap.set(runtime, blockModulesMap);
+			}
+		}
+		let blockModules = blockModulesMap.get(block);
+		if (blockModules !== undefined) return blockModules;
+		const module = /** @type {Module} */ (block.getRootBlock());
+		const memCache = moduleMemCaches && moduleMemCaches.get(module);
+		if (memCache !== undefined) {
+			const map = memCache.provide(
+				"bundleChunkGraph.blockModules",
+				runtime,
+				() => {
+					logger.time("visitModules: prepare");
+					const map = new Map();
+					extractBlockModules(module, moduleGraph, runtime, map);
+					logger.timeAggregate("visitModules: prepare");
+					return map;
+				}
+			);
+			for (const [block, blockModules] of map)
+				blockModulesMap.set(block, blockModules);
+			return map.get(block);
+		} else {
+			logger.time("visitModules: prepare");
+			extractBlockModules(module, moduleGraph, runtime, blockModulesMap);
+			blockModules = blockModulesMap.get(block);
+			logger.timeAggregate("visitModules: prepare");
+			return blockModules;
+		}
+	};
+
+	let statProcessedQueueItems = 0;
+	let statProcessedBlocks = 0;
+	let statConnectedChunkGroups = 0;
+	let statProcessedChunkGroupsForMerging = 0;
+	let statMergedAvailableModuleSets = 0;
+	let statForkedAvailableModules = 0;
+	let statForkedAvailableModulesCount = 0;
+	let statForkedAvailableModulesCountPlus = 0;
+	let statForkedMergedModulesCount = 0;
+	let statForkedMergedModulesCountPlus = 0;
+	let statForkedResultModulesCount = 0;
+	let statChunkGroupInfoUpdated = 0;
+	let statChildChunkGroupsReconnected = 0;
+
+	let nextChunkGroupIndex = 0;
+	let nextFreeModulePreOrderIndex = 0;
+	let nextFreeModulePostOrderIndex = 0;
+
+	/** @type {Map<DependenciesBlock, ChunkGroupInfo>} */
+	const blockChunkGroups = new Map();
+
+	/** @type {Map<string, ChunkGroupInfo>} */
+	const namedChunkGroups = new Map();
+
+	/** @type {Map<string, ChunkGroupInfo>} */
+	const namedAsyncEntrypoints = new Map();
+
+	const ADD_AND_ENTER_ENTRY_MODULE = 0;
+	const ADD_AND_ENTER_MODULE = 1;
+	const ENTER_MODULE = 2;
+	const PROCESS_BLOCK = 3;
+	const PROCESS_ENTRY_BLOCK = 4;
+	const LEAVE_MODULE = 5;
+
+	/** @type {QueueItem[]} */
+	let queue = [];
+
+	/** @type {Map<ChunkGroupInfo, Set<ChunkGroupInfo>>} */
+	const queueConnect = new Map();
+	/** @type {Set<ChunkGroupInfo>} */
+	const chunkGroupsForCombining = new Set();
+
+	// Fill queue with entrypoint modules
+	// Create ChunkGroupInfo for entrypoints
+	for (const [chunkGroup, modules] of inputEntrypointsAndModules) {
+		const runtime = getEntryRuntime(
+			compilation,
+			chunkGroup.name,
+			chunkGroup.options
+		);
+		/** @type {ChunkGroupInfo} */
+		const chunkGroupInfo = {
+			chunkGroup,
+			runtime,
+			minAvailableModules: undefined,
+			minAvailableModulesOwned: false,
+			availableModulesToBeMerged: [],
+			skippedItems: undefined,
+			resultingAvailableModules: undefined,
+			children: undefined,
+			availableSources: undefined,
+			availableChildren: undefined,
+			preOrderIndex: 0,
+			postOrderIndex: 0,
+			chunkLoading:
+				chunkGroup.options.chunkLoading !== undefined
+					? chunkGroup.options.chunkLoading !== false
+					: compilation.outputOptions.chunkLoading !== false,
+			asyncChunks:
+				chunkGroup.options.asyncChunks !== undefined
+					? chunkGroup.options.asyncChunks
+					: compilation.outputOptions.asyncChunks !== false
+		};
+		chunkGroup.index = nextChunkGroupIndex++;
+		if (chunkGroup.getNumberOfParents() > 0) {
+			// minAvailableModules for child entrypoints are unknown yet, set to undefined.
+			// This means no module is added until other sets are merged into
+			// this minAvailableModules (by the parent entrypoints)
+			const skippedItems = new Set();
+			for (const module of modules) {
+				skippedItems.add(module);
+			}
+			chunkGroupInfo.skippedItems = skippedItems;
+			chunkGroupsForCombining.add(chunkGroupInfo);
+		} else {
+			// The application may start here: We start with an empty list of available modules
+			chunkGroupInfo.minAvailableModules = EMPTY_SET;
+			const chunk = chunkGroup.getEntrypointChunk();
+			for (const module of modules) {
+				queue.push({
+					action: ADD_AND_ENTER_MODULE,
+					block: module,
+					module,
+					chunk,
+					chunkGroup,
+					chunkGroupInfo
+				});
+			}
+		}
+		chunkGroupInfoMap.set(chunkGroup, chunkGroupInfo);
+		if (chunkGroup.name) {
+			namedChunkGroups.set(chunkGroup.name, chunkGroupInfo);
+		}
+	}
+	// Fill availableSources with parent-child dependencies between entrypoints
+	for (const chunkGroupInfo of chunkGroupsForCombining) {
+		const { chunkGroup } = chunkGroupInfo;
+		chunkGroupInfo.availableSources = new Set();
+		for (const parent of chunkGroup.parentsIterable) {
+			const parentChunkGroupInfo = chunkGroupInfoMap.get(parent);
+			chunkGroupInfo.availableSources.add(parentChunkGroupInfo);
+			if (parentChunkGroupInfo.availableChildren === undefined) {
+				parentChunkGroupInfo.availableChildren = new Set();
+			}
+			parentChunkGroupInfo.availableChildren.add(chunkGroupInfo);
+		}
+	}
+	// pop() is used to read from the queue
+	// so it need to be reversed to be iterated in
+	// correct order
+	queue.reverse();
+
+	/** @type {Set<ChunkGroupInfo>} */
+	const outdatedChunkGroupInfo = new Set();
+	/** @type {Set<ChunkGroupInfo>} */
+	const chunkGroupsForMerging = new Set();
+	/** @type {QueueItem[]} */
+	let queueDelayed = [];
+
+	/** @type {[Module, ConnectionState][]} */
+	const skipConnectionBuffer = [];
+	/** @type {Module[]} */
+	const skipBuffer = [];
+	/** @type {QueueItem[]} */
+	const queueBuffer = [];
+
+	/** @type {Module} */
+	let module;
+	/** @type {Chunk} */
+	let chunk;
+	/** @type {ChunkGroup} */
+	let chunkGroup;
+	/** @type {DependenciesBlock} */
+	let block;
+	/** @type {ChunkGroupInfo} */
+	let chunkGroupInfo;
+
+	// For each async Block in graph
+	/**
+	 * @param {AsyncDependenciesBlock} b iterating over each Async DepBlock
+	 * @returns {void}
+	 */
+	const iteratorBlock = b => {
+		// 1. We create a chunk group with single chunk in it for this Block
+		// but only once (blockChunkGroups map)
+		let cgi = blockChunkGroups.get(b);
+		/** @type {ChunkGroup} */
+		let c;
+		/** @type {Entrypoint} */
+		let entrypoint;
+		const entryOptions = b.groupOptions && b.groupOptions.entryOptions;
+		if (cgi === undefined) {
+			const chunkName = (b.groupOptions && b.groupOptions.name) || b.chunkName;
+			if (entryOptions) {
+				cgi = namedAsyncEntrypoints.get(chunkName);
+				if (!cgi) {
+					entrypoint = compilation.addAsyncEntrypoint(
+						entryOptions,
+						module,
+						b.loc,
+						b.request
+					);
+					entrypoint.index = nextChunkGroupIndex++;
+					cgi = {
+						chunkGroup: entrypoint,
+						runtime: entrypoint.options.runtime || entrypoint.name,
+						minAvailableModules: EMPTY_SET,
+						minAvailableModulesOwned: false,
+						availableModulesToBeMerged: [],
+						skippedItems: undefined,
+						resultingAvailableModules: undefined,
+						children: undefined,
+						availableSources: undefined,
+						availableChildren: undefined,
+						preOrderIndex: 0,
+						postOrderIndex: 0,
+						chunkLoading:
+							entryOptions.chunkLoading !== undefined
+								? entryOptions.chunkLoading !== false
+								: chunkGroupInfo.chunkLoading,
+						asyncChunks:
+							entryOptions.asyncChunks !== undefined
+								? entryOptions.asyncChunks
+								: chunkGroupInfo.asyncChunks
+					};
+					chunkGroupInfoMap.set(entrypoint, cgi);
+
+					chunkGraph.connectBlockAndChunkGroup(b, entrypoint);
+					if (chunkName) {
+						namedAsyncEntrypoints.set(chunkName, cgi);
+					}
+				} else {
+					entrypoint = /** @type {Entrypoint} */ (cgi.chunkGroup);
+					// TODO merge entryOptions
+					entrypoint.addOrigin(module, b.loc, b.request);
+					chunkGraph.connectBlockAndChunkGroup(b, entrypoint);
+				}
+
+				// 2. We enqueue the DependenciesBlock for traversal
+				queueDelayed.push({
+					action: PROCESS_ENTRY_BLOCK,
+					block: b,
+					module: module,
+					chunk: entrypoint.chunks[0],
+					chunkGroup: entrypoint,
+					chunkGroupInfo: cgi
+				});
+			} else if (!chunkGroupInfo.asyncChunks || !chunkGroupInfo.chunkLoading) {
+				// Just queue the block into the current chunk group
+				queue.push({
+					action: PROCESS_BLOCK,
+					block: b,
+					module: module,
+					chunk,
+					chunkGroup,
+					chunkGroupInfo
+				});
+			} else {
+				cgi = chunkName && namedChunkGroups.get(chunkName);
+				if (!cgi) {
+					c = compilation.addChunkInGroup(
+						b.groupOptions || b.chunkName,
+						module,
+						b.loc,
+						b.request
+					);
+					c.index = nextChunkGroupIndex++;
+					cgi = {
+						chunkGroup: c,
+						runtime: chunkGroupInfo.runtime,
+						minAvailableModules: undefined,
+						minAvailableModulesOwned: undefined,
+						availableModulesToBeMerged: [],
+						skippedItems: undefined,
+						resultingAvailableModules: undefined,
+						children: undefined,
+						availableSources: undefined,
+						availableChildren: undefined,
+						preOrderIndex: 0,
+						postOrderIndex: 0,
+						chunkLoading: chunkGroupInfo.chunkLoading,
+						asyncChunks: chunkGroupInfo.asyncChunks
+					};
+					allCreatedChunkGroups.add(c);
+					chunkGroupInfoMap.set(c, cgi);
+					if (chunkName) {
+						namedChunkGroups.set(chunkName, cgi);
+					}
+				} else {
+					c = cgi.chunkGroup;
+					if (c.isInitial()) {
+						compilation.errors.push(
+							new AsyncDependencyToInitialChunkError(chunkName, module, b.loc)
+						);
+						c = chunkGroup;
+					}
+					c.addOptions(b.groupOptions);
+					c.addOrigin(module, b.loc, b.request);
+				}
+				blockConnections.set(b, []);
+			}
+			blockChunkGroups.set(b, cgi);
+		} else if (entryOptions) {
+			entrypoint = /** @type {Entrypoint} */ (cgi.chunkGroup);
+		} else {
+			c = cgi.chunkGroup;
+		}
+
+		if (c !== undefined) {
+			// 2. We store the connection for the block
+			// to connect it later if needed
+			blockConnections.get(b).push({
+				originChunkGroupInfo: chunkGroupInfo,
+				chunkGroup: c
+			});
+
+			// 3. We enqueue the chunk group info creation/updating
+			let connectList = queueConnect.get(chunkGroupInfo);
+			if (connectList === undefined) {
+				connectList = new Set();
+				queueConnect.set(chunkGroupInfo, connectList);
+			}
+			connectList.add(cgi);
+
+			// TODO check if this really need to be done for each traversal
+			// or if it is enough when it's queued when created
+			// 4. We enqueue the DependenciesBlock for traversal
+			queueDelayed.push({
+				action: PROCESS_BLOCK,
+				block: b,
+				module: module,
+				chunk: c.chunks[0],
+				chunkGroup: c,
+				chunkGroupInfo: cgi
+			});
+		} else if (entrypoint !== undefined) {
+			chunkGroupInfo.chunkGroup.addAsyncEntrypoint(entrypoint);
+		}
+	};
+
+	/**
+	 * @param {DependenciesBlock} block the block
+	 * @returns {void}
+	 */
+	const processBlock = block => {
+		statProcessedBlocks++;
+		// get prepared block info
+		const blockModules = getBlockModules(block, chunkGroupInfo.runtime);
+
+		if (blockModules !== undefined) {
+			const { minAvailableModules } = chunkGroupInfo;
+			// Buffer items because order need to be reversed to get indices correct
+			// Traverse all referenced modules
+			for (let i = 0; i < blockModules.length; i += 2) {
+				const refModule = /** @type {Module} */ (blockModules[i]);
+				if (chunkGraph.isModuleInChunk(refModule, chunk)) {
+					// skip early if already connected
+					continue;
+				}
+				const activeState = /** @type {ConnectionState} */ (
+					blockModules[i + 1]
+				);
+				if (activeState !== true) {
+					skipConnectionBuffer.push([refModule, activeState]);
+					if (activeState === false) continue;
+				}
+				if (
+					activeState === true &&
+					(minAvailableModules.has(refModule) ||
+						minAvailableModules.plus.has(refModule))
+				) {
+					// already in parent chunks, skip it for now
+					skipBuffer.push(refModule);
+					continue;
+				}
+				// enqueue, then add and enter to be in the correct order
+				// this is relevant with circular dependencies
+				queueBuffer.push({
+					action: activeState === true ? ADD_AND_ENTER_MODULE : PROCESS_BLOCK,
+					block: refModule,
+					module: refModule,
+					chunk,
+					chunkGroup,
+					chunkGroupInfo
+				});
+			}
+			// Add buffered items in reverse order
+			if (skipConnectionBuffer.length > 0) {
+				let { skippedModuleConnections } = chunkGroupInfo;
+				if (skippedModuleConnections === undefined) {
+					chunkGroupInfo.skippedModuleConnections = skippedModuleConnections =
+						new Set();
+				}
+				for (let i = skipConnectionBuffer.length - 1; i >= 0; i--) {
+					skippedModuleConnections.add(skipConnectionBuffer[i]);
+				}
+				skipConnectionBuffer.length = 0;
+			}
+			if (skipBuffer.length > 0) {
+				let { skippedItems } = chunkGroupInfo;
+				if (skippedItems === undefined) {
+					chunkGroupInfo.skippedItems = skippedItems = new Set();
+				}
+				for (let i = skipBuffer.length - 1; i >= 0; i--) {
+					skippedItems.add(skipBuffer[i]);
+				}
+				skipBuffer.length = 0;
+			}
+			if (queueBuffer.length > 0) {
+				for (let i = queueBuffer.length - 1; i >= 0; i--) {
+					queue.push(queueBuffer[i]);
+				}
+				queueBuffer.length = 0;
+			}
+		}
+
+		// Traverse all Blocks
+		for (const b of block.blocks) {
+			iteratorBlock(b);
+		}
+
+		if (block.blocks.length > 0 && module !== block) {
+			blocksWithNestedBlocks.add(block);
+		}
+	};
+
+	/**
+	 * @param {DependenciesBlock} block the block
+	 * @returns {void}
+	 */
+	const processEntryBlock = block => {
+		statProcessedBlocks++;
+		// get prepared block info
+		const blockModules = getBlockModules(block, chunkGroupInfo.runtime);
+
+		if (blockModules !== undefined) {
+			// Traverse all referenced modules
+			for (let i = 0; i < blockModules.length; i += 2) {
+				const refModule = /** @type {Module} */ (blockModules[i]);
+				const activeState = /** @type {ConnectionState} */ (
+					blockModules[i + 1]
+				);
+				// enqueue, then add and enter to be in the correct order
+				// this is relevant with circular dependencies
+				queueBuffer.push({
+					action:
+						activeState === true ? ADD_AND_ENTER_ENTRY_MODULE : PROCESS_BLOCK,
+					block: refModule,
+					module: refModule,
+					chunk,
+					chunkGroup,
+					chunkGroupInfo
+				});
+			}
+			// Add buffered items in reverse order
+			if (queueBuffer.length > 0) {
+				for (let i = queueBuffer.length - 1; i >= 0; i--) {
+					queue.push(queueBuffer[i]);
+				}
+				queueBuffer.length = 0;
+			}
+		}
+
+		// Traverse all Blocks
+		for (const b of block.blocks) {
+			iteratorBlock(b);
+		}
+
+		if (block.blocks.length > 0 && module !== block) {
+			blocksWithNestedBlocks.add(block);
+		}
+	};
+
+	const processQueue = () => {
+		while (queue.length) {
+			statProcessedQueueItems++;
+			const queueItem = queue.pop();
+			module = queueItem.module;
+			block = queueItem.block;
+			chunk = queueItem.chunk;
+			chunkGroup = queueItem.chunkGroup;
+			chunkGroupInfo = queueItem.chunkGroupInfo;
+
+			switch (queueItem.action) {
+				case ADD_AND_ENTER_ENTRY_MODULE:
+					chunkGraph.connectChunkAndEntryModule(
+						chunk,
+						module,
+						/** @type {Entrypoint} */ (chunkGroup)
+					);
+				// fallthrough
+				case ADD_AND_ENTER_MODULE: {
+					if (chunkGraph.isModuleInChunk(module, chunk)) {
+						// already connected, skip it
+						break;
+					}
+					// We connect Module and Chunk
+					chunkGraph.connectChunkAndModule(chunk, module);
+				}
+				// fallthrough
+				case ENTER_MODULE: {
+					const index = chunkGroup.getModulePreOrderIndex(module);
+					if (index === undefined) {
+						chunkGroup.setModulePreOrderIndex(
+							module,
+							chunkGroupInfo.preOrderIndex++
+						);
+					}
+
+					if (
+						moduleGraph.setPreOrderIndexIfUnset(
+							module,
+							nextFreeModulePreOrderIndex
+						)
+					) {
+						nextFreeModulePreOrderIndex++;
+					}
+
+					// reuse queueItem
+					queueItem.action = LEAVE_MODULE;
+					queue.push(queueItem);
+				}
+				// fallthrough
+				case PROCESS_BLOCK: {
+					processBlock(block);
+					break;
+				}
+				case PROCESS_ENTRY_BLOCK: {
+					processEntryBlock(block);
+					break;
+				}
+				case LEAVE_MODULE: {
+					const index = chunkGroup.getModulePostOrderIndex(module);
+					if (index === undefined) {
+						chunkGroup.setModulePostOrderIndex(
+							module,
+							chunkGroupInfo.postOrderIndex++
+						);
+					}
+
+					if (
+						moduleGraph.setPostOrderIndexIfUnset(
+							module,
+							nextFreeModulePostOrderIndex
+						)
+					) {
+						nextFreeModulePostOrderIndex++;
+					}
+					break;
+				}
+			}
+		}
+	};
+
+	const calculateResultingAvailableModules = chunkGroupInfo => {
+		if (chunkGroupInfo.resultingAvailableModules)
+			return chunkGroupInfo.resultingAvailableModules;
+
+		const minAvailableModules = chunkGroupInfo.minAvailableModules;
+
+		// Create a new Set of available modules at this point
+		// We want to be as lazy as possible. There are multiple ways doing this:
+		// Note that resultingAvailableModules is stored as "(a) + (b)" as it's a ModuleSetPlus
+		// - resultingAvailableModules = (modules of chunk) + (minAvailableModules + minAvailableModules.plus)
+		// - resultingAvailableModules = (minAvailableModules + modules of chunk) + (minAvailableModules.plus)
+		// We choose one depending on the size of minAvailableModules vs minAvailableModules.plus
+
+		let resultingAvailableModules;
+		if (minAvailableModules.size > minAvailableModules.plus.size) {
+			// resultingAvailableModules = (modules of chunk) + (minAvailableModules + minAvailableModules.plus)
+			resultingAvailableModules =
+				/** @type {Set<Module> & {plus: Set<Module>}} */ (new Set());
+			for (const module of minAvailableModules.plus)
+				minAvailableModules.add(module);
+			minAvailableModules.plus = EMPTY_SET;
+			resultingAvailableModules.plus = minAvailableModules;
+			chunkGroupInfo.minAvailableModulesOwned = false;
+		} else {
+			// resultingAvailableModules = (minAvailableModules + modules of chunk) + (minAvailableModules.plus)
+			resultingAvailableModules =
+				/** @type {Set<Module> & {plus: Set<Module>}} */ (
+					new Set(minAvailableModules)
+				);
+			resultingAvailableModules.plus = minAvailableModules.plus;
+		}
+
+		// add the modules from the chunk group to the set
+		for (const chunk of chunkGroupInfo.chunkGroup.chunks) {
+			for (const m of chunkGraph.getChunkModulesIterable(chunk)) {
+				resultingAvailableModules.add(m);
+			}
+		}
+		return (chunkGroupInfo.resultingAvailableModules =
+			resultingAvailableModules);
+	};
+
+	const processConnectQueue = () => {
+		// Figure out new parents for chunk groups
+		// to get new available modules for these children
+		for (const [chunkGroupInfo, targets] of queueConnect) {
+			// 1. Add new targets to the list of children
+			if (chunkGroupInfo.children === undefined) {
+				chunkGroupInfo.children = targets;
+			} else {
+				for (const target of targets) {
+					chunkGroupInfo.children.add(target);
+				}
+			}
+
+			// 2. Calculate resulting available modules
+			const resultingAvailableModules =
+				calculateResultingAvailableModules(chunkGroupInfo);
+
+			const runtime = chunkGroupInfo.runtime;
+
+			// 3. Update chunk group info
+			for (const target of targets) {
+				target.availableModulesToBeMerged.push(resultingAvailableModules);
+				chunkGroupsForMerging.add(target);
+				const oldRuntime = target.runtime;
+				const newRuntime = mergeRuntime(oldRuntime, runtime);
+				if (oldRuntime !== newRuntime) {
+					target.runtime = newRuntime;
+					outdatedChunkGroupInfo.add(target);
+				}
+			}
+
+			statConnectedChunkGroups += targets.size;
+		}
+		queueConnect.clear();
+	};
+
+	const processChunkGroupsForMerging = () => {
+		statProcessedChunkGroupsForMerging += chunkGroupsForMerging.size;
+
+		// Execute the merge
+		for (const info of chunkGroupsForMerging) {
+			const availableModulesToBeMerged = info.availableModulesToBeMerged;
+			let cachedMinAvailableModules = info.minAvailableModules;
+
+			statMergedAvailableModuleSets += availableModulesToBeMerged.length;
+
+			// 1. Get minimal available modules
+			// It doesn't make sense to traverse a chunk again with more available modules.
+			// This step calculates the minimal available modules and skips traversal when
+			// the list didn't shrink.
+			if (availableModulesToBeMerged.length > 1) {
+				availableModulesToBeMerged.sort(bySetSize);
+			}
+			let changed = false;
+			merge: for (const availableModules of availableModulesToBeMerged) {
+				if (cachedMinAvailableModules === undefined) {
+					cachedMinAvailableModules = availableModules;
+					info.minAvailableModules = cachedMinAvailableModules;
+					info.minAvailableModulesOwned = false;
+					changed = true;
+				} else {
+					if (info.minAvailableModulesOwned) {
+						// We own it and can modify it
+						if (cachedMinAvailableModules.plus === availableModules.plus) {
+							for (const m of cachedMinAvailableModules) {
+								if (!availableModules.has(m)) {
+									cachedMinAvailableModules.delete(m);
+									changed = true;
+								}
+							}
+						} else {
+							for (const m of cachedMinAvailableModules) {
+								if (!availableModules.has(m) && !availableModules.plus.has(m)) {
+									cachedMinAvailableModules.delete(m);
+									changed = true;
+								}
+							}
+							for (const m of cachedMinAvailableModules.plus) {
+								if (!availableModules.has(m) && !availableModules.plus.has(m)) {
+									// We can't remove modules from the plus part
+									// so we need to merge plus into the normal part to allow modifying it
+									const iterator =
+										cachedMinAvailableModules.plus[Symbol.iterator]();
+									// fast forward add all modules until m
+									/** @type {IteratorResult<Module>} */
+									let it;
+									while (!(it = iterator.next()).done) {
+										const module = it.value;
+										if (module === m) break;
+										cachedMinAvailableModules.add(module);
+									}
+									// check the remaining modules before adding
+									while (!(it = iterator.next()).done) {
+										const module = it.value;
+										if (
+											availableModules.has(module) ||
+											availableModules.plus.has(module)
+										) {
+											cachedMinAvailableModules.add(module);
+										}
+									}
+									cachedMinAvailableModules.plus = EMPTY_SET;
+									changed = true;
+									continue merge;
+								}
+							}
+						}
+					} else if (cachedMinAvailableModules.plus === availableModules.plus) {
+						// Common and fast case when the plus part is shared
+						// We only need to care about the normal part
+						if (availableModules.size < cachedMinAvailableModules.size) {
+							// the new availableModules is smaller so it's faster to
+							// fork from the new availableModules
+							statForkedAvailableModules++;
+							statForkedAvailableModulesCount += availableModules.size;
+							statForkedMergedModulesCount += cachedMinAvailableModules.size;
+							// construct a new Set as intersection of cachedMinAvailableModules and availableModules
+							const newSet = /** @type {ModuleSetPlus} */ (new Set());
+							newSet.plus = availableModules.plus;
+							for (const m of availableModules) {
+								if (cachedMinAvailableModules.has(m)) {
+									newSet.add(m);
+								}
+							}
+							statForkedResultModulesCount += newSet.size;
+							cachedMinAvailableModules = newSet;
+							info.minAvailableModulesOwned = true;
+							info.minAvailableModules = newSet;
+							changed = true;
+							continue merge;
+						}
+						for (const m of cachedMinAvailableModules) {
+							if (!availableModules.has(m)) {
+								// cachedMinAvailableModules need to be modified
+								// but we don't own it
+								statForkedAvailableModules++;
+								statForkedAvailableModulesCount +=
+									cachedMinAvailableModules.size;
+								statForkedMergedModulesCount += availableModules.size;
+								// construct a new Set as intersection of cachedMinAvailableModules and availableModules
+								// as the plus part is equal we can just take over this one
+								const newSet = /** @type {ModuleSetPlus} */ (new Set());
+								newSet.plus = availableModules.plus;
+								const iterator = cachedMinAvailableModules[Symbol.iterator]();
+								// fast forward add all modules until m
+								/** @type {IteratorResult<Module>} */
+								let it;
+								while (!(it = iterator.next()).done) {
+									const module = it.value;
+									if (module === m) break;
+									newSet.add(module);
+								}
+								// check the remaining modules before adding
+								while (!(it = iterator.next()).done) {
+									const module = it.value;
+									if (availableModules.has(module)) {
+										newSet.add(module);
+									}
+								}
+								statForkedResultModulesCount += newSet.size;
+								cachedMinAvailableModules = newSet;
+								info.minAvailableModulesOwned = true;
+								info.minAvailableModules = newSet;
+								changed = true;
+								continue merge;
+							}
+						}
+					} else {
+						for (const m of cachedMinAvailableModules) {
+							if (!availableModules.has(m) && !availableModules.plus.has(m)) {
+								// cachedMinAvailableModules need to be modified
+								// but we don't own it
+								statForkedAvailableModules++;
+								statForkedAvailableModulesCount +=
+									cachedMinAvailableModules.size;
+								statForkedAvailableModulesCountPlus +=
+									cachedMinAvailableModules.plus.size;
+								statForkedMergedModulesCount += availableModules.size;
+								statForkedMergedModulesCountPlus += availableModules.plus.size;
+								// construct a new Set as intersection of cachedMinAvailableModules and availableModules
+								const newSet = /** @type {ModuleSetPlus} */ (new Set());
+								newSet.plus = EMPTY_SET;
+								const iterator = cachedMinAvailableModules[Symbol.iterator]();
+								// fast forward add all modules until m
+								/** @type {IteratorResult<Module>} */
+								let it;
+								while (!(it = iterator.next()).done) {
+									const module = it.value;
+									if (module === m) break;
+									newSet.add(module);
+								}
+								// check the remaining modules before adding
+								while (!(it = iterator.next()).done) {
+									const module = it.value;
+									if (
+										availableModules.has(module) ||
+										availableModules.plus.has(module)
+									) {
+										newSet.add(module);
+									}
+								}
+								// also check all modules in cachedMinAvailableModules.plus
+								for (const module of cachedMinAvailableModules.plus) {
+									if (
+										availableModules.has(module) ||
+										availableModules.plus.has(module)
+									) {
+										newSet.add(module);
+									}
+								}
+								statForkedResultModulesCount += newSet.size;
+								cachedMinAvailableModules = newSet;
+								info.minAvailableModulesOwned = true;
+								info.minAvailableModules = newSet;
+								changed = true;
+								continue merge;
+							}
+						}
+						for (const m of cachedMinAvailableModules.plus) {
+							if (!availableModules.has(m) && !availableModules.plus.has(m)) {
+								// cachedMinAvailableModules need to be modified
+								// but we don't own it
+								statForkedAvailableModules++;
+								statForkedAvailableModulesCount +=
+									cachedMinAvailableModules.size;
+								statForkedAvailableModulesCountPlus +=
+									cachedMinAvailableModules.plus.size;
+								statForkedMergedModulesCount += availableModules.size;
+								statForkedMergedModulesCountPlus += availableModules.plus.size;
+								// construct a new Set as intersection of cachedMinAvailableModules and availableModules
+								// we already know that all modules directly from cachedMinAvailableModules are in availableModules too
+								const newSet = /** @type {ModuleSetPlus} */ (
+									new Set(cachedMinAvailableModules)
+								);
+								newSet.plus = EMPTY_SET;
+								const iterator =
+									cachedMinAvailableModules.plus[Symbol.iterator]();
+								// fast forward add all modules until m
+								/** @type {IteratorResult<Module>} */
+								let it;
+								while (!(it = iterator.next()).done) {
+									const module = it.value;
+									if (module === m) break;
+									newSet.add(module);
+								}
+								// check the remaining modules before adding
+								while (!(it = iterator.next()).done) {
+									const module = it.value;
+									if (
+										availableModules.has(module) ||
+										availableModules.plus.has(module)
+									) {
+										newSet.add(module);
+									}
+								}
+								statForkedResultModulesCount += newSet.size;
+								cachedMinAvailableModules = newSet;
+								info.minAvailableModulesOwned = true;
+								info.minAvailableModules = newSet;
+								changed = true;
+								continue merge;
+							}
+						}
+					}
+				}
+			}
+			availableModulesToBeMerged.length = 0;
+			if (changed) {
+				info.resultingAvailableModules = undefined;
+				outdatedChunkGroupInfo.add(info);
+			}
+		}
+		chunkGroupsForMerging.clear();
+	};
+
+	const processChunkGroupsForCombining = () => {
+		for (const info of chunkGroupsForCombining) {
+			for (const source of info.availableSources) {
+				if (!source.minAvailableModules) {
+					chunkGroupsForCombining.delete(info);
+					break;
+				}
+			}
+		}
+		for (const info of chunkGroupsForCombining) {
+			const availableModules = /** @type {ModuleSetPlus} */ (new Set());
+			availableModules.plus = EMPTY_SET;
+			const mergeSet = set => {
+				if (set.size > availableModules.plus.size) {
+					for (const item of availableModules.plus) availableModules.add(item);
+					availableModules.plus = set;
+				} else {
+					for (const item of set) availableModules.add(item);
+				}
+			};
+			// combine minAvailableModules from all resultingAvailableModules
+			for (const source of info.availableSources) {
+				const resultingAvailableModules =
+					calculateResultingAvailableModules(source);
+				mergeSet(resultingAvailableModules);
+				mergeSet(resultingAvailableModules.plus);
+			}
+			info.minAvailableModules = availableModules;
+			info.minAvailableModulesOwned = false;
+			info.resultingAvailableModules = undefined;
+			outdatedChunkGroupInfo.add(info);
+		}
+		chunkGroupsForCombining.clear();
+	};
+
+	const processOutdatedChunkGroupInfo = () => {
+		statChunkGroupInfoUpdated += outdatedChunkGroupInfo.size;
+		// Revisit skipped elements
+		for (const info of outdatedChunkGroupInfo) {
+			// 1. Reconsider skipped items
+			if (info.skippedItems !== undefined) {
+				const { minAvailableModules } = info;
+				for (const module of info.skippedItems) {
+					if (
+						!minAvailableModules.has(module) &&
+						!minAvailableModules.plus.has(module)
+					) {
+						queue.push({
+							action: ADD_AND_ENTER_MODULE,
+							block: module,
+							module,
+							chunk: info.chunkGroup.chunks[0],
+							chunkGroup: info.chunkGroup,
+							chunkGroupInfo: info
+						});
+						info.skippedItems.delete(module);
+					}
+				}
+			}
+
+			// 2. Reconsider skipped connections
+			if (info.skippedModuleConnections !== undefined) {
+				const { minAvailableModules } = info;
+				for (const entry of info.skippedModuleConnections) {
+					const [module, activeState] = entry;
+					if (activeState === false) continue;
+					if (activeState === true) {
+						info.skippedModuleConnections.delete(entry);
+					}
+					if (
+						activeState === true &&
+						(minAvailableModules.has(module) ||
+							minAvailableModules.plus.has(module))
+					) {
+						info.skippedItems.add(module);
+						continue;
+					}
+					queue.push({
+						action: activeState === true ? ADD_AND_ENTER_MODULE : PROCESS_BLOCK,
+						block: module,
+						module,
+						chunk: info.chunkGroup.chunks[0],
+						chunkGroup: info.chunkGroup,
+						chunkGroupInfo: info
+					});
+				}
+			}
+
+			// 2. Reconsider children chunk groups
+			if (info.children !== undefined) {
+				statChildChunkGroupsReconnected += info.children.size;
+				for (const cgi of info.children) {
+					let connectList = queueConnect.get(info);
+					if (connectList === undefined) {
+						connectList = new Set();
+						queueConnect.set(info, connectList);
+					}
+					connectList.add(cgi);
+				}
+			}
+
+			// 3. Reconsider chunk groups for combining
+			if (info.availableChildren !== undefined) {
+				for (const cgi of info.availableChildren) {
+					chunkGroupsForCombining.add(cgi);
+				}
+			}
+		}
+		outdatedChunkGroupInfo.clear();
+	};
+
+	// Iterative traversal of the Module graph
+	// Recursive would be simpler to write but could result in Stack Overflows
+	while (queue.length || queueConnect.size) {
+		logger.time("visitModules: visiting");
+		processQueue();
+		logger.timeAggregateEnd("visitModules: prepare");
+		logger.timeEnd("visitModules: visiting");
+
+		if (chunkGroupsForCombining.size > 0) {
+			logger.time("visitModules: combine available modules");
+			processChunkGroupsForCombining();
+			logger.timeEnd("visitModules: combine available modules");
+		}
+
+		if (queueConnect.size > 0) {
+			logger.time("visitModules: calculating available modules");
+			processConnectQueue();
+			logger.timeEnd("visitModules: calculating available modules");
+
+			if (chunkGroupsForMerging.size > 0) {
+				logger.time("visitModules: merging available modules");
+				processChunkGroupsForMerging();
+				logger.timeEnd("visitModules: merging available modules");
+			}
+		}
+
+		if (outdatedChunkGroupInfo.size > 0) {
+			logger.time("visitModules: check modules for revisit");
+			processOutdatedChunkGroupInfo();
+			logger.timeEnd("visitModules: check modules for revisit");
+		}
+
+		// Run queueDelayed when all items of the queue are processed
+		// This is important to get the global indexing correct
+		// Async blocks should be processed after all sync blocks are processed
+		if (queue.length === 0) {
+			const tempQueue = queue;
+			queue = queueDelayed.reverse();
+			queueDelayed = tempQueue;
+		}
+	}
+
+	logger.log(
+		`${statProcessedQueueItems} queue items processed (${statProcessedBlocks} blocks)`
+	);
+	logger.log(`${statConnectedChunkGroups} chunk groups connected`);
+	logger.log(
+		`${statProcessedChunkGroupsForMerging} chunk groups processed for merging (${statMergedAvailableModuleSets} module sets, ${statForkedAvailableModules} forked, ${statForkedAvailableModulesCount} + ${statForkedAvailableModulesCountPlus} modules forked, ${statForkedMergedModulesCount} + ${statForkedMergedModulesCountPlus} modules merged into fork, ${statForkedResultModulesCount} resulting modules)`
+	);
+	logger.log(
+		`${statChunkGroupInfoUpdated} chunk group info updated (${statChildChunkGroupsReconnected} already connected chunk groups reconnected)`
+	);
+};
+
+/**
+ *
+ * @param {Compilation} compilation the compilation
+ * @param {Set<DependenciesBlock>} blocksWithNestedBlocks flag for blocks that have nested blocks
+ * @param {Map<AsyncDependenciesBlock, BlockChunkGroupConnection[]>} blockConnections connection for blocks
+ * @param {Map<ChunkGroup, ChunkGroupInfo>} chunkGroupInfoMap mapping from chunk group to available modules
+ */
+const connectChunkGroups = (
+	compilation,
+	blocksWithNestedBlocks,
+	blockConnections,
+	chunkGroupInfoMap
+) => {
+	const { chunkGraph } = compilation;
+
+	/**
+	 * Helper function to check if all modules of a chunk are available
+	 *
+	 * @param {ChunkGroup} chunkGroup the chunkGroup to scan
+	 * @param {ModuleSetPlus} availableModules the comparator set
+	 * @returns {boolean} return true if all modules of a chunk are available
+	 */
+	const areModulesAvailable = (chunkGroup, availableModules) => {
+		for (const chunk of chunkGroup.chunks) {
+			for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+				if (!availableModules.has(module) && !availableModules.plus.has(module))
+					return false;
+			}
+		}
+		return true;
+	};
+
+	// For each edge in the basic chunk graph
+	for (const [block, connections] of blockConnections) {
+		// 1. Check if connection is needed
+		// When none of the dependencies need to be connected
+		// we can skip all of them
+		// It's not possible to filter each item so it doesn't create inconsistent
+		// connections and modules can only create one version
+		// TODO maybe decide this per runtime
+		if (
+			// TODO is this needed?
+			!blocksWithNestedBlocks.has(block) &&
+			connections.every(({ chunkGroup, originChunkGroupInfo }) =>
+				areModulesAvailable(
+					chunkGroup,
+					originChunkGroupInfo.resultingAvailableModules
+				)
+			)
+		) {
+			continue;
+		}
+
+		// 2. Foreach edge
+		for (let i = 0; i < connections.length; i++) {
+			const { chunkGroup, originChunkGroupInfo } = connections[i];
+
+			// 3. Connect block with chunk
+			chunkGraph.connectBlockAndChunkGroup(block, chunkGroup);
+
+			// 4. Connect chunk with parent
+			connectChunkGroupParentAndChild(
+				originChunkGroupInfo.chunkGroup,
+				chunkGroup
+			);
+		}
+	}
+};
+
+/**
+ * Remove all unconnected chunk groups
+ * @param {Compilation} compilation the compilation
+ * @param {Iterable<ChunkGroup>} allCreatedChunkGroups all chunk groups that where created before
+ */
+const cleanupUnconnectedGroups = (compilation, allCreatedChunkGroups) => {
+	const { chunkGraph } = compilation;
+
+	for (const chunkGroup of allCreatedChunkGroups) {
+		if (chunkGroup.getNumberOfParents() === 0) {
+			for (const chunk of chunkGroup.chunks) {
+				compilation.chunks.delete(chunk);
+				chunkGraph.disconnectChunk(chunk);
+			}
+			chunkGraph.disconnectChunkGroup(chunkGroup);
+			chunkGroup.remove();
+		}
+	}
+};
+
+/**
+ * This method creates the Chunk graph from the Module graph
+ * @param {Compilation} compilation the compilation
+ * @param {Map<Entrypoint, Module[]>} inputEntrypointsAndModules chunk groups which are processed with the modules
+ * @returns {void}
+ */
+const buildChunkGraph = (compilation, inputEntrypointsAndModules) => {
+	const logger = compilation.getLogger("webpack.buildChunkGraph");
+
+	// SHARED STATE
+
+	/** @type {Map<AsyncDependenciesBlock, BlockChunkGroupConnection[]>} */
+	const blockConnections = new Map();
+
+	/** @type {Set<ChunkGroup>} */
+	const allCreatedChunkGroups = new Set();
+
+	/** @type {Map<ChunkGroup, ChunkGroupInfo>} */
+	const chunkGroupInfoMap = new Map();
+
+	/** @type {Set<DependenciesBlock>} */
+	const blocksWithNestedBlocks = new Set();
+
+	// PART ONE
+
+	logger.time("visitModules");
+	visitModules(
+		logger,
+		compilation,
+		inputEntrypointsAndModules,
+		chunkGroupInfoMap,
+		blockConnections,
+		blocksWithNestedBlocks,
+		allCreatedChunkGroups
+	);
+	logger.timeEnd("visitModules");
+
+	// PART TWO
+
+	logger.time("connectChunkGroups");
+	connectChunkGroups(
+		compilation,
+		blocksWithNestedBlocks,
+		blockConnections,
+		chunkGroupInfoMap
+	);
+	logger.timeEnd("connectChunkGroups");
+
+	for (const [chunkGroup, chunkGroupInfo] of chunkGroupInfoMap) {
+		for (const chunk of chunkGroup.chunks)
+			chunk.runtime = mergeRuntime(chunk.runtime, chunkGroupInfo.runtime);
+	}
+
+	// Cleanup work
+
+	logger.time("cleanup");
+	cleanupUnconnectedGroups(compilation, allCreatedChunkGroups);
+	logger.timeEnd("cleanup");
+};
+
+module.exports = buildChunkGraph;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/AddBuildDependenciesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/AddBuildDependenciesPlugin.js
new file mode 100644
index 0000000..f2283ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/AddBuildDependenciesPlugin.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class AddBuildDependenciesPlugin {
+	/**
+	 * @param {Iterable<string>} buildDependencies list of build dependencies
+	 */
+	constructor(buildDependencies) {
+		this.buildDependencies = new Set(buildDependencies);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"AddBuildDependenciesPlugin",
+			compilation => {
+				compilation.buildDependencies.addAll(this.buildDependencies);
+			}
+		);
+	}
+}
+
+module.exports = AddBuildDependenciesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/AddManagedPathsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/AddManagedPathsPlugin.js
new file mode 100644
index 0000000..702aa6c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/AddManagedPathsPlugin.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class AddManagedPathsPlugin {
+	/**
+	 * @param {Iterable<string | RegExp>} managedPaths list of managed paths
+	 * @param {Iterable<string | RegExp>} immutablePaths list of immutable paths
+	 */
+	constructor(managedPaths, immutablePaths) {
+		this.managedPaths = new Set(managedPaths);
+		this.immutablePaths = new Set(immutablePaths);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		for (const managedPath of this.managedPaths) {
+			compiler.managedPaths.add(managedPath);
+		}
+		for (const immutablePath of this.immutablePaths) {
+			compiler.immutablePaths.add(immutablePath);
+		}
+	}
+}
+
+module.exports = AddManagedPathsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/IdleFileCachePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/IdleFileCachePlugin.js
new file mode 100644
index 0000000..ccaa3d4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/IdleFileCachePlugin.js
@@ -0,0 +1,227 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Cache = require("../Cache");
+const ProgressPlugin = require("../ProgressPlugin");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+const BUILD_DEPENDENCIES_KEY = Symbol();
+
+class IdleFileCachePlugin {
+	/**
+	 * @param {TODO} strategy cache strategy
+	 * @param {number} idleTimeout timeout
+	 * @param {number} idleTimeoutForInitialStore initial timeout
+	 * @param {number} idleTimeoutAfterLargeChanges timeout after changes
+	 */
+	constructor(
+		strategy,
+		idleTimeout,
+		idleTimeoutForInitialStore,
+		idleTimeoutAfterLargeChanges
+	) {
+		this.strategy = strategy;
+		this.idleTimeout = idleTimeout;
+		this.idleTimeoutForInitialStore = idleTimeoutForInitialStore;
+		this.idleTimeoutAfterLargeChanges = idleTimeoutAfterLargeChanges;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		let strategy = this.strategy;
+		const idleTimeout = this.idleTimeout;
+		const idleTimeoutForInitialStore = Math.min(
+			idleTimeout,
+			this.idleTimeoutForInitialStore
+		);
+		const idleTimeoutAfterLargeChanges = this.idleTimeoutAfterLargeChanges;
+		const resolvedPromise = Promise.resolve();
+
+		let timeSpendInBuild = 0;
+		let timeSpendInStore = 0;
+		let avgTimeSpendInStore = 0;
+
+		/** @type {Map<string | typeof BUILD_DEPENDENCIES_KEY, () => Promise>} */
+		const pendingIdleTasks = new Map();
+
+		compiler.cache.hooks.store.tap(
+			{ name: "IdleFileCachePlugin", stage: Cache.STAGE_DISK },
+			(identifier, etag, data) => {
+				pendingIdleTasks.set(identifier, () =>
+					strategy.store(identifier, etag, data)
+				);
+			}
+		);
+
+		compiler.cache.hooks.get.tapPromise(
+			{ name: "IdleFileCachePlugin", stage: Cache.STAGE_DISK },
+			(identifier, etag, gotHandlers) => {
+				const restore = () =>
+					strategy.restore(identifier, etag).then(cacheEntry => {
+						if (cacheEntry === undefined) {
+							gotHandlers.push((result, callback) => {
+								if (result !== undefined) {
+									pendingIdleTasks.set(identifier, () =>
+										strategy.store(identifier, etag, result)
+									);
+								}
+								callback();
+							});
+						} else {
+							return cacheEntry;
+						}
+					});
+				const pendingTask = pendingIdleTasks.get(identifier);
+				if (pendingTask !== undefined) {
+					pendingIdleTasks.delete(identifier);
+					return pendingTask().then(restore);
+				}
+				return restore();
+			}
+		);
+
+		compiler.cache.hooks.storeBuildDependencies.tap(
+			{ name: "IdleFileCachePlugin", stage: Cache.STAGE_DISK },
+			dependencies => {
+				pendingIdleTasks.set(BUILD_DEPENDENCIES_KEY, () =>
+					strategy.storeBuildDependencies(dependencies)
+				);
+			}
+		);
+
+		compiler.cache.hooks.shutdown.tapPromise(
+			{ name: "IdleFileCachePlugin", stage: Cache.STAGE_DISK },
+			() => {
+				if (idleTimer) {
+					clearTimeout(idleTimer);
+					idleTimer = undefined;
+				}
+				isIdle = false;
+				const reportProgress = ProgressPlugin.getReporter(compiler);
+				const jobs = Array.from(pendingIdleTasks.values());
+				if (reportProgress) reportProgress(0, "process pending cache items");
+				const promises = jobs.map(fn => fn());
+				pendingIdleTasks.clear();
+				promises.push(currentIdlePromise);
+				const promise = Promise.all(promises);
+				currentIdlePromise = promise.then(() => strategy.afterAllStored());
+				if (reportProgress) {
+					currentIdlePromise = currentIdlePromise.then(() => {
+						reportProgress(1, `stored`);
+					});
+				}
+				return currentIdlePromise.then(() => {
+					// Reset strategy
+					if (strategy.clear) strategy.clear();
+				});
+			}
+		);
+
+		/** @type {Promise<any>} */
+		let currentIdlePromise = resolvedPromise;
+		let isIdle = false;
+		let isInitialStore = true;
+		const processIdleTasks = () => {
+			if (isIdle) {
+				const startTime = Date.now();
+				if (pendingIdleTasks.size > 0) {
+					const promises = [currentIdlePromise];
+					const maxTime = startTime + 100;
+					let maxCount = 100;
+					for (const [filename, factory] of pendingIdleTasks) {
+						pendingIdleTasks.delete(filename);
+						promises.push(factory());
+						if (maxCount-- <= 0 || Date.now() > maxTime) break;
+					}
+					currentIdlePromise = Promise.all(promises);
+					currentIdlePromise.then(() => {
+						timeSpendInStore += Date.now() - startTime;
+						// Allow to exit the process between
+						idleTimer = setTimeout(processIdleTasks, 0);
+						idleTimer.unref();
+					});
+					return;
+				}
+				currentIdlePromise = currentIdlePromise
+					.then(async () => {
+						await strategy.afterAllStored();
+						timeSpendInStore += Date.now() - startTime;
+						avgTimeSpendInStore =
+							Math.max(avgTimeSpendInStore, timeSpendInStore) * 0.9 +
+							timeSpendInStore * 0.1;
+						timeSpendInStore = 0;
+						timeSpendInBuild = 0;
+					})
+					.catch(err => {
+						const logger = compiler.getInfrastructureLogger(
+							"IdleFileCachePlugin"
+						);
+						logger.warn(`Background tasks during idle failed: ${err.message}`);
+						logger.debug(err.stack);
+					});
+				isInitialStore = false;
+			}
+		};
+		let idleTimer = undefined;
+		compiler.cache.hooks.beginIdle.tap(
+			{ name: "IdleFileCachePlugin", stage: Cache.STAGE_DISK },
+			() => {
+				const isLargeChange = timeSpendInBuild > avgTimeSpendInStore * 2;
+				if (isInitialStore && idleTimeoutForInitialStore < idleTimeout) {
+					compiler
+						.getInfrastructureLogger("IdleFileCachePlugin")
+						.log(
+							`Initial cache was generated and cache will be persisted in ${
+								idleTimeoutForInitialStore / 1000
+							}s.`
+						);
+				} else if (
+					isLargeChange &&
+					idleTimeoutAfterLargeChanges < idleTimeout
+				) {
+					compiler
+						.getInfrastructureLogger("IdleFileCachePlugin")
+						.log(
+							`Spend ${Math.round(timeSpendInBuild) / 1000}s in build and ${
+								Math.round(avgTimeSpendInStore) / 1000
+							}s in average in cache store. This is considered as large change and cache will be persisted in ${
+								idleTimeoutAfterLargeChanges / 1000
+							}s.`
+						);
+				}
+				idleTimer = setTimeout(() => {
+					idleTimer = undefined;
+					isIdle = true;
+					resolvedPromise.then(processIdleTasks);
+				}, Math.min(isInitialStore ? idleTimeoutForInitialStore : Infinity, isLargeChange ? idleTimeoutAfterLargeChanges : Infinity, idleTimeout));
+				idleTimer.unref();
+			}
+		);
+		compiler.cache.hooks.endIdle.tap(
+			{ name: "IdleFileCachePlugin", stage: Cache.STAGE_DISK },
+			() => {
+				if (idleTimer) {
+					clearTimeout(idleTimer);
+					idleTimer = undefined;
+				}
+				isIdle = false;
+			}
+		);
+		compiler.hooks.done.tap("IdleFileCachePlugin", stats => {
+			// 10% build overhead is ignored, as it's not cacheable
+			timeSpendInBuild *= 0.9;
+			timeSpendInBuild += stats.endTime - stats.startTime;
+		});
+	}
+}
+
+module.exports = IdleFileCachePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/MemoryCachePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/MemoryCachePlugin.js
new file mode 100644
index 0000000..cec61ac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/MemoryCachePlugin.js
@@ -0,0 +1,57 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Cache = require("../Cache");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Cache").Etag} Etag */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class MemoryCachePlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		/** @type {Map<string, { etag: Etag | null, data: any }>} */
+		const cache = new Map();
+		compiler.cache.hooks.store.tap(
+			{ name: "MemoryCachePlugin", stage: Cache.STAGE_MEMORY },
+			(identifier, etag, data) => {
+				cache.set(identifier, { etag, data });
+			}
+		);
+		compiler.cache.hooks.get.tap(
+			{ name: "MemoryCachePlugin", stage: Cache.STAGE_MEMORY },
+			(identifier, etag, gotHandlers) => {
+				const cacheEntry = cache.get(identifier);
+				if (cacheEntry === null) {
+					return null;
+				} else if (cacheEntry !== undefined) {
+					return cacheEntry.etag === etag ? cacheEntry.data : null;
+				}
+				gotHandlers.push((result, callback) => {
+					if (result === undefined) {
+						cache.set(identifier, null);
+					} else {
+						cache.set(identifier, { etag, data: result });
+					}
+					return callback();
+				});
+			}
+		);
+		compiler.cache.hooks.shutdown.tap(
+			{ name: "MemoryCachePlugin", stage: Cache.STAGE_MEMORY },
+			() => {
+				cache.clear();
+			}
+		);
+	}
+}
+module.exports = MemoryCachePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/MemoryWithGcCachePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/MemoryWithGcCachePlugin.js
new file mode 100644
index 0000000..7d652f5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/MemoryWithGcCachePlugin.js
@@ -0,0 +1,129 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Cache = require("../Cache");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Cache").Etag} Etag */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class MemoryWithGcCachePlugin {
+	constructor({ maxGenerations }) {
+		this._maxGenerations = maxGenerations;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const maxGenerations = this._maxGenerations;
+		/** @type {Map<string, { etag: Etag | null, data: any }>} */
+		const cache = new Map();
+		/** @type {Map<string, { entry: { etag: Etag | null, data: any }, until: number }>} */
+		const oldCache = new Map();
+		let generation = 0;
+		let cachePosition = 0;
+		const logger = compiler.getInfrastructureLogger("MemoryWithGcCachePlugin");
+		compiler.hooks.afterDone.tap("MemoryWithGcCachePlugin", () => {
+			generation++;
+			let clearedEntries = 0;
+			let lastClearedIdentifier;
+			for (const [identifier, entry] of oldCache) {
+				if (entry.until > generation) break;
+
+				oldCache.delete(identifier);
+				if (cache.get(identifier) === undefined) {
+					cache.delete(identifier);
+					clearedEntries++;
+					lastClearedIdentifier = identifier;
+				}
+			}
+			if (clearedEntries > 0 || oldCache.size > 0) {
+				logger.log(
+					`${cache.size - oldCache.size} active entries, ${
+						oldCache.size
+					} recently unused cached entries${
+						clearedEntries > 0
+							? `, ${clearedEntries} old unused cache entries removed e. g. ${lastClearedIdentifier}`
+							: ""
+					}`
+				);
+			}
+			let i = (cache.size / maxGenerations) | 0;
+			let j = cachePosition >= cache.size ? 0 : cachePosition;
+			cachePosition = j + i;
+			for (const [identifier, entry] of cache) {
+				if (j !== 0) {
+					j--;
+					continue;
+				}
+				if (entry !== undefined) {
+					// We don't delete the cache entry, but set it to undefined instead
+					// This reserves the location in the data table and avoids rehashing
+					// when constantly adding and removing entries.
+					// It will be deleted when removed from oldCache.
+					cache.set(identifier, undefined);
+					oldCache.delete(identifier);
+					oldCache.set(identifier, {
+						entry,
+						until: generation + maxGenerations
+					});
+					if (i-- === 0) break;
+				}
+			}
+		});
+		compiler.cache.hooks.store.tap(
+			{ name: "MemoryWithGcCachePlugin", stage: Cache.STAGE_MEMORY },
+			(identifier, etag, data) => {
+				cache.set(identifier, { etag, data });
+			}
+		);
+		compiler.cache.hooks.get.tap(
+			{ name: "MemoryWithGcCachePlugin", stage: Cache.STAGE_MEMORY },
+			(identifier, etag, gotHandlers) => {
+				const cacheEntry = cache.get(identifier);
+				if (cacheEntry === null) {
+					return null;
+				} else if (cacheEntry !== undefined) {
+					return cacheEntry.etag === etag ? cacheEntry.data : null;
+				}
+				const oldCacheEntry = oldCache.get(identifier);
+				if (oldCacheEntry !== undefined) {
+					const cacheEntry = oldCacheEntry.entry;
+					if (cacheEntry === null) {
+						oldCache.delete(identifier);
+						cache.set(identifier, cacheEntry);
+						return null;
+					} else {
+						if (cacheEntry.etag !== etag) return null;
+						oldCache.delete(identifier);
+						cache.set(identifier, cacheEntry);
+						return cacheEntry.data;
+					}
+				}
+				gotHandlers.push((result, callback) => {
+					if (result === undefined) {
+						cache.set(identifier, null);
+					} else {
+						cache.set(identifier, { etag, data: result });
+					}
+					return callback();
+				});
+			}
+		);
+		compiler.cache.hooks.shutdown.tap(
+			{ name: "MemoryWithGcCachePlugin", stage: Cache.STAGE_MEMORY },
+			() => {
+				cache.clear();
+				oldCache.clear();
+			}
+		);
+	}
+}
+module.exports = MemoryWithGcCachePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/PackFileCacheStrategy.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/PackFileCacheStrategy.js
new file mode 100644
index 0000000..93a3836
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/PackFileCacheStrategy.js
@@ -0,0 +1,1426 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const FileSystemInfo = require("../FileSystemInfo");
+const ProgressPlugin = require("../ProgressPlugin");
+const { formatSize } = require("../SizeFormatHelpers");
+const SerializerMiddleware = require("../serialization/SerializerMiddleware");
+const LazySet = require("../util/LazySet");
+const makeSerializable = require("../util/makeSerializable");
+const memoize = require("../util/memoize");
+const {
+	createFileSerializer,
+	NOT_SERIALIZABLE
+} = require("../util/serialization");
+
+/** @typedef {import("../../declarations/WebpackOptions").SnapshotOptions} SnapshotOptions */
+/** @typedef {import("../Cache").Etag} Etag */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../FileSystemInfo").Snapshot} Snapshot */
+/** @typedef {import("../logging/Logger").Logger} Logger */
+/** @typedef {import("../util/fs").IntermediateFileSystem} IntermediateFileSystem */
+
+class PackContainer {
+	/**
+	 * @param {Object} data stored data
+	 * @param {string} version version identifier
+	 * @param {Snapshot} buildSnapshot snapshot of all build dependencies
+	 * @param {Set<string>} buildDependencies list of all unresolved build dependencies captured
+	 * @param {Map<string, string | false>} resolveResults result of the resolved build dependencies
+	 * @param {Snapshot} resolveBuildDependenciesSnapshot snapshot of the dependencies of the build dependencies resolving
+	 */
+	constructor(
+		data,
+		version,
+		buildSnapshot,
+		buildDependencies,
+		resolveResults,
+		resolveBuildDependenciesSnapshot
+	) {
+		this.data = data;
+		this.version = version;
+		this.buildSnapshot = buildSnapshot;
+		this.buildDependencies = buildDependencies;
+		this.resolveResults = resolveResults;
+		this.resolveBuildDependenciesSnapshot = resolveBuildDependenciesSnapshot;
+	}
+
+	serialize({ write, writeLazy }) {
+		write(this.version);
+		write(this.buildSnapshot);
+		write(this.buildDependencies);
+		write(this.resolveResults);
+		write(this.resolveBuildDependenciesSnapshot);
+		writeLazy(this.data);
+	}
+
+	deserialize({ read }) {
+		this.version = read();
+		this.buildSnapshot = read();
+		this.buildDependencies = read();
+		this.resolveResults = read();
+		this.resolveBuildDependenciesSnapshot = read();
+		this.data = read();
+	}
+}
+
+makeSerializable(
+	PackContainer,
+	"webpack/lib/cache/PackFileCacheStrategy",
+	"PackContainer"
+);
+
+const MIN_CONTENT_SIZE = 1024 * 1024; // 1 MB
+const CONTENT_COUNT_TO_MERGE = 10;
+const MIN_ITEMS_IN_FRESH_PACK = 100;
+const MAX_ITEMS_IN_FRESH_PACK = 50000;
+const MAX_TIME_IN_FRESH_PACK = 1 * 60 * 1000; // 1 min
+
+class PackItemInfo {
+	/**
+	 * @param {string} identifier identifier of item
+	 * @param {string | null} etag etag of item
+	 * @param {any} value fresh value of item
+	 */
+	constructor(identifier, etag, value) {
+		this.identifier = identifier;
+		this.etag = etag;
+		this.location = -1;
+		this.lastAccess = Date.now();
+		this.freshValue = value;
+	}
+}
+
+class Pack {
+	constructor(logger, maxAge) {
+		/** @type {Map<string, PackItemInfo>} */
+		this.itemInfo = new Map();
+		/** @type {string[]} */
+		this.requests = [];
+		this.requestsTimeout = undefined;
+		/** @type {Map<string, PackItemInfo>} */
+		this.freshContent = new Map();
+		/** @type {(undefined | PackContent)[]} */
+		this.content = [];
+		this.invalid = false;
+		this.logger = logger;
+		this.maxAge = maxAge;
+	}
+
+	_addRequest(identifier) {
+		this.requests.push(identifier);
+		if (this.requestsTimeout === undefined) {
+			this.requestsTimeout = setTimeout(() => {
+				this.requests.push(undefined);
+				this.requestsTimeout = undefined;
+			}, MAX_TIME_IN_FRESH_PACK);
+			if (this.requestsTimeout.unref) this.requestsTimeout.unref();
+		}
+	}
+
+	stopCapturingRequests() {
+		if (this.requestsTimeout !== undefined) {
+			clearTimeout(this.requestsTimeout);
+			this.requestsTimeout = undefined;
+		}
+	}
+
+	/**
+	 * @param {string} identifier unique name for the resource
+	 * @param {string | null} etag etag of the resource
+	 * @returns {any} cached content
+	 */
+	get(identifier, etag) {
+		const info = this.itemInfo.get(identifier);
+		this._addRequest(identifier);
+		if (info === undefined) {
+			return undefined;
+		}
+		if (info.etag !== etag) return null;
+		info.lastAccess = Date.now();
+		const loc = info.location;
+		if (loc === -1) {
+			return info.freshValue;
+		} else {
+			if (!this.content[loc]) {
+				return undefined;
+			}
+			return this.content[loc].get(identifier);
+		}
+	}
+
+	/**
+	 * @param {string} identifier unique name for the resource
+	 * @param {string | null} etag etag of the resource
+	 * @param {any} data cached content
+	 * @returns {void}
+	 */
+	set(identifier, etag, data) {
+		if (!this.invalid) {
+			this.invalid = true;
+			this.logger.log(`Pack got invalid because of write to: ${identifier}`);
+		}
+		const info = this.itemInfo.get(identifier);
+		if (info === undefined) {
+			const newInfo = new PackItemInfo(identifier, etag, data);
+			this.itemInfo.set(identifier, newInfo);
+			this._addRequest(identifier);
+			this.freshContent.set(identifier, newInfo);
+		} else {
+			const loc = info.location;
+			if (loc >= 0) {
+				this._addRequest(identifier);
+				this.freshContent.set(identifier, info);
+				const content = this.content[loc];
+				content.delete(identifier);
+				if (content.items.size === 0) {
+					this.content[loc] = undefined;
+					this.logger.debug("Pack %d got empty and is removed", loc);
+				}
+			}
+			info.freshValue = data;
+			info.lastAccess = Date.now();
+			info.etag = etag;
+			info.location = -1;
+		}
+	}
+
+	getContentStats() {
+		let count = 0;
+		let size = 0;
+		for (const content of this.content) {
+			if (content !== undefined) {
+				count++;
+				const s = content.getSize();
+				if (s > 0) {
+					size += s;
+				}
+			}
+		}
+		return { count, size };
+	}
+
+	/**
+	 * @returns {number} new location of data entries
+	 */
+	_findLocation() {
+		let i;
+		for (i = 0; i < this.content.length && this.content[i] !== undefined; i++);
+		return i;
+	}
+
+	_gcAndUpdateLocation(items, usedItems, newLoc) {
+		let count = 0;
+		let lastGC;
+		const now = Date.now();
+		for (const identifier of items) {
+			const info = this.itemInfo.get(identifier);
+			if (now - info.lastAccess > this.maxAge) {
+				this.itemInfo.delete(identifier);
+				items.delete(identifier);
+				usedItems.delete(identifier);
+				count++;
+				lastGC = identifier;
+			} else {
+				info.location = newLoc;
+			}
+		}
+		if (count > 0) {
+			this.logger.log(
+				"Garbage Collected %d old items at pack %d (%d items remaining) e. g. %s",
+				count,
+				newLoc,
+				items.size,
+				lastGC
+			);
+		}
+	}
+
+	_persistFreshContent() {
+		const itemsCount = this.freshContent.size;
+		if (itemsCount > 0) {
+			const packCount = Math.ceil(itemsCount / MAX_ITEMS_IN_FRESH_PACK);
+			const itemsPerPack = Math.ceil(itemsCount / packCount);
+			const packs = [];
+			let i = 0;
+			let ignoreNextTimeTick = false;
+			const createNextPack = () => {
+				const loc = this._findLocation();
+				this.content[loc] = null; // reserve
+				const pack = {
+					/** @type {Set<string>} */
+					items: new Set(),
+					/** @type {Map<string, any>} */
+					map: new Map(),
+					loc
+				};
+				packs.push(pack);
+				return pack;
+			};
+			let pack = createNextPack();
+			if (this.requestsTimeout !== undefined)
+				clearTimeout(this.requestsTimeout);
+			for (const identifier of this.requests) {
+				if (identifier === undefined) {
+					if (ignoreNextTimeTick) {
+						ignoreNextTimeTick = false;
+					} else if (pack.items.size >= MIN_ITEMS_IN_FRESH_PACK) {
+						i = 0;
+						pack = createNextPack();
+					}
+					continue;
+				}
+				const info = this.freshContent.get(identifier);
+				if (info === undefined) continue;
+				pack.items.add(identifier);
+				pack.map.set(identifier, info.freshValue);
+				info.location = pack.loc;
+				info.freshValue = undefined;
+				this.freshContent.delete(identifier);
+				if (++i > itemsPerPack) {
+					i = 0;
+					pack = createNextPack();
+					ignoreNextTimeTick = true;
+				}
+			}
+			this.requests.length = 0;
+			for (const pack of packs) {
+				this.content[pack.loc] = new PackContent(
+					pack.items,
+					new Set(pack.items),
+					new PackContentItems(pack.map)
+				);
+			}
+			this.logger.log(
+				`${itemsCount} fresh items in cache put into pack ${
+					packs.length > 1
+						? packs
+								.map(pack => `${pack.loc} (${pack.items.size} items)`)
+								.join(", ")
+						: packs[0].loc
+				}`
+			);
+		}
+	}
+
+	/**
+	 * Merges small content files to a single content file
+	 */
+	_optimizeSmallContent() {
+		// 1. Find all small content files
+		// Treat unused content files separately to avoid
+		// a merge-split cycle
+		/** @type {number[]} */
+		const smallUsedContents = [];
+		/** @type {number} */
+		let smallUsedContentSize = 0;
+		/** @type {number[]} */
+		const smallUnusedContents = [];
+		/** @type {number} */
+		let smallUnusedContentSize = 0;
+		for (let i = 0; i < this.content.length; i++) {
+			const content = this.content[i];
+			if (content === undefined) continue;
+			if (content.outdated) continue;
+			const size = content.getSize();
+			if (size < 0 || size > MIN_CONTENT_SIZE) continue;
+			if (content.used.size > 0) {
+				smallUsedContents.push(i);
+				smallUsedContentSize += size;
+			} else {
+				smallUnusedContents.push(i);
+				smallUnusedContentSize += size;
+			}
+		}
+
+		// 2. Check if minimum number is reached
+		let mergedIndices;
+		if (
+			smallUsedContents.length >= CONTENT_COUNT_TO_MERGE ||
+			smallUsedContentSize > MIN_CONTENT_SIZE
+		) {
+			mergedIndices = smallUsedContents;
+		} else if (
+			smallUnusedContents.length >= CONTENT_COUNT_TO_MERGE ||
+			smallUnusedContentSize > MIN_CONTENT_SIZE
+		) {
+			mergedIndices = smallUnusedContents;
+		} else return;
+
+		const mergedContent = [];
+
+		// 3. Remove old content entries
+		for (const i of mergedIndices) {
+			mergedContent.push(this.content[i]);
+			this.content[i] = undefined;
+		}
+
+		// 4. Determine merged items
+		/** @type {Set<string>} */
+		const mergedItems = new Set();
+		/** @type {Set<string>} */
+		const mergedUsedItems = new Set();
+		/** @type {(function(Map<string, any>): Promise)[]} */
+		const addToMergedMap = [];
+		for (const content of mergedContent) {
+			for (const identifier of content.items) {
+				mergedItems.add(identifier);
+			}
+			for (const identifier of content.used) {
+				mergedUsedItems.add(identifier);
+			}
+			addToMergedMap.push(async map => {
+				// unpack existing content
+				// after that values are accessible in .content
+				await content.unpack(
+					"it should be merged with other small pack contents"
+				);
+				for (const [identifier, value] of content.content) {
+					map.set(identifier, value);
+				}
+			});
+		}
+
+		// 5. GC and update location of merged items
+		const newLoc = this._findLocation();
+		this._gcAndUpdateLocation(mergedItems, mergedUsedItems, newLoc);
+
+		// 6. If not empty, store content somewhere
+		if (mergedItems.size > 0) {
+			this.content[newLoc] = new PackContent(
+				mergedItems,
+				mergedUsedItems,
+				memoize(async () => {
+					/** @type {Map<string, any>} */
+					const map = new Map();
+					await Promise.all(addToMergedMap.map(fn => fn(map)));
+					return new PackContentItems(map);
+				})
+			);
+			this.logger.log(
+				"Merged %d small files with %d cache items into pack %d",
+				mergedContent.length,
+				mergedItems.size,
+				newLoc
+			);
+		}
+	}
+
+	/**
+	 * Split large content files with used and unused items
+	 * into two parts to separate used from unused items
+	 */
+	_optimizeUnusedContent() {
+		// 1. Find a large content file with used and unused items
+		for (let i = 0; i < this.content.length; i++) {
+			const content = this.content[i];
+			if (content === undefined) continue;
+			const size = content.getSize();
+			if (size < MIN_CONTENT_SIZE) continue;
+			const used = content.used.size;
+			const total = content.items.size;
+			if (used > 0 && used < total) {
+				// 2. Remove this content
+				this.content[i] = undefined;
+
+				// 3. Determine items for the used content file
+				const usedItems = new Set(content.used);
+				const newLoc = this._findLocation();
+				this._gcAndUpdateLocation(usedItems, usedItems, newLoc);
+
+				// 4. Create content file for used items
+				if (usedItems.size > 0) {
+					this.content[newLoc] = new PackContent(
+						usedItems,
+						new Set(usedItems),
+						async () => {
+							await content.unpack(
+								"it should be splitted into used and unused items"
+							);
+							const map = new Map();
+							for (const identifier of usedItems) {
+								map.set(identifier, content.content.get(identifier));
+							}
+							return new PackContentItems(map);
+						}
+					);
+				}
+
+				// 5. Determine items for the unused content file
+				const unusedItems = new Set(content.items);
+				const usedOfUnusedItems = new Set();
+				for (const identifier of usedItems) {
+					unusedItems.delete(identifier);
+				}
+				const newUnusedLoc = this._findLocation();
+				this._gcAndUpdateLocation(unusedItems, usedOfUnusedItems, newUnusedLoc);
+
+				// 6. Create content file for unused items
+				if (unusedItems.size > 0) {
+					this.content[newUnusedLoc] = new PackContent(
+						unusedItems,
+						usedOfUnusedItems,
+						async () => {
+							await content.unpack(
+								"it should be splitted into used and unused items"
+							);
+							const map = new Map();
+							for (const identifier of unusedItems) {
+								map.set(identifier, content.content.get(identifier));
+							}
+							return new PackContentItems(map);
+						}
+					);
+				}
+
+				this.logger.log(
+					"Split pack %d into pack %d with %d used items and pack %d with %d unused items",
+					i,
+					newLoc,
+					usedItems.size,
+					newUnusedLoc,
+					unusedItems.size
+				);
+
+				// optimizing only one of them is good enough and
+				// reduces the amount of serialization needed
+				return;
+			}
+		}
+	}
+
+	/**
+	 * Find the content with the oldest item and run GC on that.
+	 * Only runs for one content to avoid large invalidation.
+	 */
+	_gcOldestContent() {
+		/** @type {PackItemInfo} */
+		let oldest = undefined;
+		for (const info of this.itemInfo.values()) {
+			if (oldest === undefined || info.lastAccess < oldest.lastAccess) {
+				oldest = info;
+			}
+		}
+		if (Date.now() - oldest.lastAccess > this.maxAge) {
+			const loc = oldest.location;
+			if (loc < 0) return;
+			const content = this.content[loc];
+			const items = new Set(content.items);
+			const usedItems = new Set(content.used);
+			this._gcAndUpdateLocation(items, usedItems, loc);
+
+			this.content[loc] =
+				items.size > 0
+					? new PackContent(items, usedItems, async () => {
+							await content.unpack(
+								"it contains old items that should be garbage collected"
+							);
+							const map = new Map();
+							for (const identifier of items) {
+								map.set(identifier, content.content.get(identifier));
+							}
+							return new PackContentItems(map);
+					  })
+					: undefined;
+		}
+	}
+
+	serialize({ write, writeSeparate }) {
+		this._persistFreshContent();
+		this._optimizeSmallContent();
+		this._optimizeUnusedContent();
+		this._gcOldestContent();
+		for (const identifier of this.itemInfo.keys()) {
+			write(identifier);
+		}
+		write(null); // null as marker of the end of keys
+		for (const info of this.itemInfo.values()) {
+			write(info.etag);
+		}
+		for (const info of this.itemInfo.values()) {
+			write(info.lastAccess);
+		}
+		for (let i = 0; i < this.content.length; i++) {
+			const content = this.content[i];
+			if (content !== undefined) {
+				write(content.items);
+				content.writeLazy(lazy => writeSeparate(lazy, { name: `${i}` }));
+			} else {
+				write(undefined); // undefined marks an empty content slot
+			}
+		}
+		write(null); // null as marker of the end of items
+	}
+
+	deserialize({ read, logger }) {
+		this.logger = logger;
+		{
+			const items = [];
+			let item = read();
+			while (item !== null) {
+				items.push(item);
+				item = read();
+			}
+			this.itemInfo.clear();
+			const infoItems = items.map(identifier => {
+				const info = new PackItemInfo(identifier, undefined, undefined);
+				this.itemInfo.set(identifier, info);
+				return info;
+			});
+			for (const info of infoItems) {
+				info.etag = read();
+			}
+			for (const info of infoItems) {
+				info.lastAccess = read();
+			}
+		}
+		this.content.length = 0;
+		let items = read();
+		while (items !== null) {
+			if (items === undefined) {
+				this.content.push(items);
+			} else {
+				const idx = this.content.length;
+				const lazy = read();
+				this.content.push(
+					new PackContent(
+						items,
+						new Set(),
+						lazy,
+						logger,
+						`${this.content.length}`
+					)
+				);
+				for (const identifier of items) {
+					this.itemInfo.get(identifier).location = idx;
+				}
+			}
+			items = read();
+		}
+	}
+}
+
+makeSerializable(Pack, "webpack/lib/cache/PackFileCacheStrategy", "Pack");
+
+class PackContentItems {
+	/**
+	 * @param {Map<string, any>} map items
+	 */
+	constructor(map) {
+		this.map = map;
+	}
+
+	serialize({ write, snapshot, rollback, logger, profile }) {
+		if (profile) {
+			write(false);
+			for (const [key, value] of this.map) {
+				const s = snapshot();
+				try {
+					write(key);
+					const start = process.hrtime();
+					write(value);
+					const durationHr = process.hrtime(start);
+					const duration = durationHr[0] * 1000 + durationHr[1] / 1e6;
+					if (duration > 1) {
+						if (duration > 500)
+							logger.error(`Serialization of '${key}': ${duration} ms`);
+						else if (duration > 50)
+							logger.warn(`Serialization of '${key}': ${duration} ms`);
+						else if (duration > 10)
+							logger.info(`Serialization of '${key}': ${duration} ms`);
+						else if (duration > 5)
+							logger.log(`Serialization of '${key}': ${duration} ms`);
+						else logger.debug(`Serialization of '${key}': ${duration} ms`);
+					}
+				} catch (e) {
+					rollback(s);
+					if (e === NOT_SERIALIZABLE) continue;
+					logger.warn(
+						`Skipped not serializable cache item '${key}': ${e.message}`
+					);
+					logger.debug(e.stack);
+				}
+			}
+			write(null);
+			return;
+		}
+		// Try to serialize all at once
+		const s = snapshot();
+		try {
+			write(true);
+			write(this.map);
+		} catch (e) {
+			rollback(s);
+
+			// Try to serialize each item on it's own
+			write(false);
+			for (const [key, value] of this.map) {
+				const s = snapshot();
+				try {
+					write(key);
+					write(value);
+				} catch (e) {
+					rollback(s);
+					if (e === NOT_SERIALIZABLE) continue;
+					logger.warn(
+						`Skipped not serializable cache item '${key}': ${e.message}`
+					);
+					logger.debug(e.stack);
+				}
+			}
+			write(null);
+		}
+	}
+
+	deserialize({ read, logger, profile }) {
+		if (read()) {
+			this.map = read();
+		} else if (profile) {
+			const map = new Map();
+			let key = read();
+			while (key !== null) {
+				const start = process.hrtime();
+				const value = read();
+				const durationHr = process.hrtime(start);
+				const duration = durationHr[0] * 1000 + durationHr[1] / 1e6;
+				if (duration > 1) {
+					if (duration > 100)
+						logger.error(`Deserialization of '${key}': ${duration} ms`);
+					else if (duration > 20)
+						logger.warn(`Deserialization of '${key}': ${duration} ms`);
+					else if (duration > 5)
+						logger.info(`Deserialization of '${key}': ${duration} ms`);
+					else if (duration > 2)
+						logger.log(`Deserialization of '${key}': ${duration} ms`);
+					else logger.debug(`Deserialization of '${key}': ${duration} ms`);
+				}
+				map.set(key, value);
+				key = read();
+			}
+			this.map = map;
+		} else {
+			const map = new Map();
+			let key = read();
+			while (key !== null) {
+				map.set(key, read());
+				key = read();
+			}
+			this.map = map;
+		}
+	}
+}
+
+makeSerializable(
+	PackContentItems,
+	"webpack/lib/cache/PackFileCacheStrategy",
+	"PackContentItems"
+);
+
+class PackContent {
+	/*
+		This class can be in these states:
+		   |   this.lazy    | this.content | this.outdated | state
+		A1 |   undefined    |     Map      |     false     | fresh content
+		A2 |   undefined    |     Map      |     true      | (will not happen)
+		B1 | lazy () => {}  |  undefined   |     false     | not deserialized
+		B2 | lazy () => {}  |  undefined   |     true      | not deserialized, but some items has been removed
+		C1 | lazy* () => {} |     Map      |     false     | deserialized
+		C2 | lazy* () => {} |     Map      |     true      | deserialized, and some items has been removed
+
+		this.used is a subset of this.items.
+		this.items is a subset of this.content.keys() resp. this.lazy().map.keys()
+		When this.outdated === false, this.items === this.content.keys() resp. this.lazy().map.keys()
+		When this.outdated === true, this.items should be used to recreated this.lazy/this.content.
+		When this.lazy and this.content is set, they contain the same data.
+		this.get must only be called with a valid item from this.items.
+		In state C this.lazy is unMemoized
+	*/
+
+	/**
+	 * @param {Set<string>} items keys
+	 * @param {Set<string>} usedItems used keys
+	 * @param {PackContentItems | function(): Promise<PackContentItems>} dataOrFn sync or async content
+	 * @param {Logger=} logger logger for logging
+	 * @param {string=} lazyName name of dataOrFn for logging
+	 */
+	constructor(items, usedItems, dataOrFn, logger, lazyName) {
+		this.items = items;
+		/** @type {function(): Promise<PackContentItems> | PackContentItems} */
+		this.lazy = typeof dataOrFn === "function" ? dataOrFn : undefined;
+		/** @type {Map<string, any>} */
+		this.content = typeof dataOrFn === "function" ? undefined : dataOrFn.map;
+		this.outdated = false;
+		this.used = usedItems;
+		this.logger = logger;
+		this.lazyName = lazyName;
+	}
+
+	get(identifier) {
+		this.used.add(identifier);
+		if (this.content) {
+			return this.content.get(identifier);
+		}
+
+		// We are in state B
+		const { lazyName } = this;
+		let timeMessage;
+		if (lazyName) {
+			// only log once
+			this.lazyName = undefined;
+			timeMessage = `restore cache content ${lazyName} (${formatSize(
+				this.getSize()
+			)})`;
+			this.logger.log(
+				`starting to restore cache content ${lazyName} (${formatSize(
+					this.getSize()
+				)}) because of request to: ${identifier}`
+			);
+			this.logger.time(timeMessage);
+		}
+		const value = this.lazy();
+		if ("then" in value) {
+			return value.then(data => {
+				const map = data.map;
+				if (timeMessage) {
+					this.logger.timeEnd(timeMessage);
+				}
+				// Move to state C
+				this.content = map;
+				this.lazy = SerializerMiddleware.unMemoizeLazy(this.lazy);
+				return map.get(identifier);
+			});
+		} else {
+			const map = value.map;
+			if (timeMessage) {
+				this.logger.timeEnd(timeMessage);
+			}
+			// Move to state C
+			this.content = map;
+			this.lazy = SerializerMiddleware.unMemoizeLazy(this.lazy);
+			return map.get(identifier);
+		}
+	}
+
+	/**
+	 * @param {string} reason explanation why unpack is necessary
+	 * @returns {void | Promise} maybe a promise if lazy
+	 */
+	unpack(reason) {
+		if (this.content) return;
+
+		// Move from state B to C
+		if (this.lazy) {
+			const { lazyName } = this;
+			let timeMessage;
+			if (lazyName) {
+				// only log once
+				this.lazyName = undefined;
+				timeMessage = `unpack cache content ${lazyName} (${formatSize(
+					this.getSize()
+				)})`;
+				this.logger.log(
+					`starting to unpack cache content ${lazyName} (${formatSize(
+						this.getSize()
+					)}) because ${reason}`
+				);
+				this.logger.time(timeMessage);
+			}
+			const value = this.lazy();
+			if ("then" in value) {
+				return value.then(data => {
+					if (timeMessage) {
+						this.logger.timeEnd(timeMessage);
+					}
+					this.content = data.map;
+				});
+			} else {
+				if (timeMessage) {
+					this.logger.timeEnd(timeMessage);
+				}
+				this.content = value.map;
+			}
+		}
+	}
+
+	/**
+	 * @returns {number} size of the content or -1 if not known
+	 */
+	getSize() {
+		if (!this.lazy) return -1;
+		const options = /** @type {any} */ (this.lazy).options;
+		if (!options) return -1;
+		const size = options.size;
+		if (typeof size !== "number") return -1;
+		return size;
+	}
+
+	delete(identifier) {
+		this.items.delete(identifier);
+		this.used.delete(identifier);
+		this.outdated = true;
+	}
+
+	/**
+	 * @template T
+	 * @param {function(any): function(): Promise<PackContentItems> | PackContentItems} write write function
+	 * @returns {void}
+	 */
+	writeLazy(write) {
+		if (!this.outdated && this.lazy) {
+			// State B1 or C1
+			// this.lazy is still the valid deserialized version
+			write(this.lazy);
+			return;
+		}
+		if (!this.outdated && this.content) {
+			// State A1
+			const map = new Map(this.content);
+			// Move to state C1
+			this.lazy = SerializerMiddleware.unMemoizeLazy(
+				write(() => new PackContentItems(map))
+			);
+			return;
+		}
+		if (this.content) {
+			// State A2 or C2
+			/** @type {Map<string, any>} */
+			const map = new Map();
+			for (const item of this.items) {
+				map.set(item, this.content.get(item));
+			}
+			// Move to state C1
+			this.outdated = false;
+			this.content = map;
+			this.lazy = SerializerMiddleware.unMemoizeLazy(
+				write(() => new PackContentItems(map))
+			);
+			return;
+		}
+		// State B2
+		const { lazyName } = this;
+		let timeMessage;
+		if (lazyName) {
+			// only log once
+			this.lazyName = undefined;
+			timeMessage = `unpack cache content ${lazyName} (${formatSize(
+				this.getSize()
+			)})`;
+			this.logger.log(
+				`starting to unpack cache content ${lazyName} (${formatSize(
+					this.getSize()
+				)}) because it's outdated and need to be serialized`
+			);
+			this.logger.time(timeMessage);
+		}
+		const value = this.lazy();
+		this.outdated = false;
+		if ("then" in value) {
+			// Move to state B1
+			this.lazy = write(() =>
+				value.then(data => {
+					if (timeMessage) {
+						this.logger.timeEnd(timeMessage);
+					}
+					const oldMap = data.map;
+					/** @type {Map<string, any>} */
+					const map = new Map();
+					for (const item of this.items) {
+						map.set(item, oldMap.get(item));
+					}
+					// Move to state C1 (or maybe C2)
+					this.content = map;
+					this.lazy = SerializerMiddleware.unMemoizeLazy(this.lazy);
+
+					return new PackContentItems(map);
+				})
+			);
+		} else {
+			// Move to state C1
+			if (timeMessage) {
+				this.logger.timeEnd(timeMessage);
+			}
+			const oldMap = value.map;
+			/** @type {Map<string, any>} */
+			const map = new Map();
+			for (const item of this.items) {
+				map.set(item, oldMap.get(item));
+			}
+			this.content = map;
+			this.lazy = write(() => new PackContentItems(map));
+		}
+	}
+}
+
+const allowCollectingMemory = buf => {
+	const wasted = buf.buffer.byteLength - buf.byteLength;
+	if (wasted > 8192 && (wasted > 1048576 || wasted > buf.byteLength)) {
+		return Buffer.from(buf);
+	}
+	return buf;
+};
+
+class PackFileCacheStrategy {
+	/**
+	 * @param {Object} options options
+	 * @param {Compiler} options.compiler the compiler
+	 * @param {IntermediateFileSystem} options.fs the filesystem
+	 * @param {string} options.context the context directory
+	 * @param {string} options.cacheLocation the location of the cache data
+	 * @param {string} options.version version identifier
+	 * @param {Logger} options.logger a logger
+	 * @param {SnapshotOptions} options.snapshot options regarding snapshotting
+	 * @param {number} options.maxAge max age of cache items
+	 * @param {boolean} options.profile track and log detailed timing information for individual cache items
+	 * @param {boolean} options.allowCollectingMemory allow to collect unused memory created during deserialization
+	 * @param {false | "gzip" | "brotli"} options.compression compression used
+	 */
+	constructor({
+		compiler,
+		fs,
+		context,
+		cacheLocation,
+		version,
+		logger,
+		snapshot,
+		maxAge,
+		profile,
+		allowCollectingMemory,
+		compression
+	}) {
+		this.fileSerializer = createFileSerializer(
+			fs,
+			compiler.options.output.hashFunction
+		);
+		this.fileSystemInfo = new FileSystemInfo(fs, {
+			managedPaths: snapshot.managedPaths,
+			immutablePaths: snapshot.immutablePaths,
+			logger: logger.getChildLogger("webpack.FileSystemInfo"),
+			hashFunction: compiler.options.output.hashFunction
+		});
+		this.compiler = compiler;
+		this.context = context;
+		this.cacheLocation = cacheLocation;
+		this.version = version;
+		this.logger = logger;
+		this.maxAge = maxAge;
+		this.profile = profile;
+		this.allowCollectingMemory = allowCollectingMemory;
+		this.compression = compression;
+		this._extension =
+			compression === "brotli"
+				? ".pack.br"
+				: compression === "gzip"
+				? ".pack.gz"
+				: ".pack";
+		this.snapshot = snapshot;
+		/** @type {Set<string>} */
+		this.buildDependencies = new Set();
+		/** @type {LazySet<string>} */
+		this.newBuildDependencies = new LazySet();
+		/** @type {Snapshot} */
+		this.resolveBuildDependenciesSnapshot = undefined;
+		/** @type {Map<string, string | false>} */
+		this.resolveResults = undefined;
+		/** @type {Snapshot} */
+		this.buildSnapshot = undefined;
+		/** @type {Promise<Pack>} */
+		this.packPromise = this._openPack();
+		this.storePromise = Promise.resolve();
+	}
+
+	_getPack() {
+		if (this.packPromise === undefined) {
+			this.packPromise = this.storePromise.then(() => this._openPack());
+		}
+		return this.packPromise;
+	}
+
+	/**
+	 * @returns {Promise<Pack>} the pack
+	 */
+	_openPack() {
+		const { logger, profile, cacheLocation, version } = this;
+		/** @type {Snapshot} */
+		let buildSnapshot;
+		/** @type {Set<string>} */
+		let buildDependencies;
+		/** @type {Set<string>} */
+		let newBuildDependencies;
+		/** @type {Snapshot} */
+		let resolveBuildDependenciesSnapshot;
+		/** @type {Map<string, string | false>} */
+		let resolveResults;
+		logger.time("restore cache container");
+		return this.fileSerializer
+			.deserialize(null, {
+				filename: `${cacheLocation}/index${this._extension}`,
+				extension: `${this._extension}`,
+				logger,
+				profile,
+				retainedBuffer: this.allowCollectingMemory
+					? allowCollectingMemory
+					: undefined
+			})
+			.catch(err => {
+				if (err.code !== "ENOENT") {
+					logger.warn(
+						`Restoring pack failed from ${cacheLocation}${this._extension}: ${err}`
+					);
+					logger.debug(err.stack);
+				} else {
+					logger.debug(
+						`No pack exists at ${cacheLocation}${this._extension}: ${err}`
+					);
+				}
+				return undefined;
+			})
+			.then(packContainer => {
+				logger.timeEnd("restore cache container");
+				if (!packContainer) return undefined;
+				if (!(packContainer instanceof PackContainer)) {
+					logger.warn(
+						`Restored pack from ${cacheLocation}${this._extension}, but contained content is unexpected.`,
+						packContainer
+					);
+					return undefined;
+				}
+				if (packContainer.version !== version) {
+					logger.log(
+						`Restored pack from ${cacheLocation}${this._extension}, but version doesn't match.`
+					);
+					return undefined;
+				}
+				logger.time("check build dependencies");
+				return Promise.all([
+					new Promise((resolve, reject) => {
+						this.fileSystemInfo.checkSnapshotValid(
+							packContainer.buildSnapshot,
+							(err, valid) => {
+								if (err) {
+									logger.log(
+										`Restored pack from ${cacheLocation}${this._extension}, but checking snapshot of build dependencies errored: ${err}.`
+									);
+									logger.debug(err.stack);
+									return resolve(false);
+								}
+								if (!valid) {
+									logger.log(
+										`Restored pack from ${cacheLocation}${this._extension}, but build dependencies have changed.`
+									);
+									return resolve(false);
+								}
+								buildSnapshot = packContainer.buildSnapshot;
+								return resolve(true);
+							}
+						);
+					}),
+					new Promise((resolve, reject) => {
+						this.fileSystemInfo.checkSnapshotValid(
+							packContainer.resolveBuildDependenciesSnapshot,
+							(err, valid) => {
+								if (err) {
+									logger.log(
+										`Restored pack from ${cacheLocation}${this._extension}, but checking snapshot of resolving of build dependencies errored: ${err}.`
+									);
+									logger.debug(err.stack);
+									return resolve(false);
+								}
+								if (valid) {
+									resolveBuildDependenciesSnapshot =
+										packContainer.resolveBuildDependenciesSnapshot;
+									buildDependencies = packContainer.buildDependencies;
+									resolveResults = packContainer.resolveResults;
+									return resolve(true);
+								}
+								logger.log(
+									"resolving of build dependencies is invalid, will re-resolve build dependencies"
+								);
+								this.fileSystemInfo.checkResolveResultsValid(
+									packContainer.resolveResults,
+									(err, valid) => {
+										if (err) {
+											logger.log(
+												`Restored pack from ${cacheLocation}${this._extension}, but resolving of build dependencies errored: ${err}.`
+											);
+											logger.debug(err.stack);
+											return resolve(false);
+										}
+										if (valid) {
+											newBuildDependencies = packContainer.buildDependencies;
+											resolveResults = packContainer.resolveResults;
+											return resolve(true);
+										}
+										logger.log(
+											`Restored pack from ${cacheLocation}${this._extension}, but build dependencies resolve to different locations.`
+										);
+										return resolve(false);
+									}
+								);
+							}
+						);
+					})
+				])
+					.catch(err => {
+						logger.timeEnd("check build dependencies");
+						throw err;
+					})
+					.then(([buildSnapshotValid, resolveValid]) => {
+						logger.timeEnd("check build dependencies");
+						if (buildSnapshotValid && resolveValid) {
+							logger.time("restore cache content metadata");
+							const d = packContainer.data();
+							logger.timeEnd("restore cache content metadata");
+							return d;
+						}
+						return undefined;
+					});
+			})
+			.then(pack => {
+				if (pack) {
+					pack.maxAge = this.maxAge;
+					this.buildSnapshot = buildSnapshot;
+					if (buildDependencies) this.buildDependencies = buildDependencies;
+					if (newBuildDependencies)
+						this.newBuildDependencies.addAll(newBuildDependencies);
+					this.resolveResults = resolveResults;
+					this.resolveBuildDependenciesSnapshot =
+						resolveBuildDependenciesSnapshot;
+					return pack;
+				}
+				return new Pack(logger, this.maxAge);
+			})
+			.catch(err => {
+				this.logger.warn(
+					`Restoring pack from ${cacheLocation}${this._extension} failed: ${err}`
+				);
+				this.logger.debug(err.stack);
+				return new Pack(logger, this.maxAge);
+			});
+	}
+
+	/**
+	 * @param {string} identifier unique name for the resource
+	 * @param {Etag | null} etag etag of the resource
+	 * @param {any} data cached content
+	 * @returns {Promise<void>} promise
+	 */
+	store(identifier, etag, data) {
+		return this._getPack().then(pack => {
+			pack.set(identifier, etag === null ? null : etag.toString(), data);
+		});
+	}
+
+	/**
+	 * @param {string} identifier unique name for the resource
+	 * @param {Etag | null} etag etag of the resource
+	 * @returns {Promise<any>} promise to the cached content
+	 */
+	restore(identifier, etag) {
+		return this._getPack()
+			.then(pack =>
+				pack.get(identifier, etag === null ? null : etag.toString())
+			)
+			.catch(err => {
+				if (err && err.code !== "ENOENT") {
+					this.logger.warn(
+						`Restoring failed for ${identifier} from pack: ${err}`
+					);
+					this.logger.debug(err.stack);
+				}
+			});
+	}
+
+	storeBuildDependencies(dependencies) {
+		this.newBuildDependencies.addAll(dependencies);
+	}
+
+	afterAllStored() {
+		const packPromise = this.packPromise;
+		if (packPromise === undefined) return Promise.resolve();
+		const reportProgress = ProgressPlugin.getReporter(this.compiler);
+		return (this.storePromise = packPromise
+			.then(pack => {
+				pack.stopCapturingRequests();
+				if (!pack.invalid) return;
+				this.packPromise = undefined;
+				this.logger.log(`Storing pack...`);
+				let promise;
+				const newBuildDependencies = new Set();
+				for (const dep of this.newBuildDependencies) {
+					if (!this.buildDependencies.has(dep)) {
+						newBuildDependencies.add(dep);
+					}
+				}
+				if (newBuildDependencies.size > 0 || !this.buildSnapshot) {
+					if (reportProgress) reportProgress(0.5, "resolve build dependencies");
+					this.logger.debug(
+						`Capturing build dependencies... (${Array.from(
+							newBuildDependencies
+						).join(", ")})`
+					);
+					promise = new Promise((resolve, reject) => {
+						this.logger.time("resolve build dependencies");
+						this.fileSystemInfo.resolveBuildDependencies(
+							this.context,
+							newBuildDependencies,
+							(err, result) => {
+								this.logger.timeEnd("resolve build dependencies");
+								if (err) return reject(err);
+
+								this.logger.time("snapshot build dependencies");
+								const {
+									files,
+									directories,
+									missing,
+									resolveResults,
+									resolveDependencies
+								} = result;
+								if (this.resolveResults) {
+									for (const [key, value] of resolveResults) {
+										this.resolveResults.set(key, value);
+									}
+								} else {
+									this.resolveResults = resolveResults;
+								}
+								if (reportProgress) {
+									reportProgress(
+										0.6,
+										"snapshot build dependencies",
+										"resolving"
+									);
+								}
+								this.fileSystemInfo.createSnapshot(
+									undefined,
+									resolveDependencies.files,
+									resolveDependencies.directories,
+									resolveDependencies.missing,
+									this.snapshot.resolveBuildDependencies,
+									(err, snapshot) => {
+										if (err) {
+											this.logger.timeEnd("snapshot build dependencies");
+											return reject(err);
+										}
+										if (!snapshot) {
+											this.logger.timeEnd("snapshot build dependencies");
+											return reject(
+												new Error("Unable to snapshot resolve dependencies")
+											);
+										}
+										if (this.resolveBuildDependenciesSnapshot) {
+											this.resolveBuildDependenciesSnapshot =
+												this.fileSystemInfo.mergeSnapshots(
+													this.resolveBuildDependenciesSnapshot,
+													snapshot
+												);
+										} else {
+											this.resolveBuildDependenciesSnapshot = snapshot;
+										}
+										if (reportProgress) {
+											reportProgress(
+												0.7,
+												"snapshot build dependencies",
+												"modules"
+											);
+										}
+										this.fileSystemInfo.createSnapshot(
+											undefined,
+											files,
+											directories,
+											missing,
+											this.snapshot.buildDependencies,
+											(err, snapshot) => {
+												this.logger.timeEnd("snapshot build dependencies");
+												if (err) return reject(err);
+												if (!snapshot) {
+													return reject(
+														new Error("Unable to snapshot build dependencies")
+													);
+												}
+												this.logger.debug("Captured build dependencies");
+
+												if (this.buildSnapshot) {
+													this.buildSnapshot =
+														this.fileSystemInfo.mergeSnapshots(
+															this.buildSnapshot,
+															snapshot
+														);
+												} else {
+													this.buildSnapshot = snapshot;
+												}
+
+												resolve();
+											}
+										);
+									}
+								);
+							}
+						);
+					});
+				} else {
+					promise = Promise.resolve();
+				}
+				return promise.then(() => {
+					if (reportProgress) reportProgress(0.8, "serialize pack");
+					this.logger.time(`store pack`);
+					const updatedBuildDependencies = new Set(this.buildDependencies);
+					for (const dep of newBuildDependencies) {
+						updatedBuildDependencies.add(dep);
+					}
+					const content = new PackContainer(
+						pack,
+						this.version,
+						this.buildSnapshot,
+						updatedBuildDependencies,
+						this.resolveResults,
+						this.resolveBuildDependenciesSnapshot
+					);
+					return this.fileSerializer
+						.serialize(content, {
+							filename: `${this.cacheLocation}/index${this._extension}`,
+							extension: `${this._extension}`,
+							logger: this.logger,
+							profile: this.profile
+						})
+						.then(() => {
+							for (const dep of newBuildDependencies) {
+								this.buildDependencies.add(dep);
+							}
+							this.newBuildDependencies.clear();
+							this.logger.timeEnd(`store pack`);
+							const stats = pack.getContentStats();
+							this.logger.log(
+								"Stored pack (%d items, %d files, %d MiB)",
+								pack.itemInfo.size,
+								stats.count,
+								Math.round(stats.size / 1024 / 1024)
+							);
+						})
+						.catch(err => {
+							this.logger.timeEnd(`store pack`);
+							this.logger.warn(`Caching failed for pack: ${err}`);
+							this.logger.debug(err.stack);
+						});
+				});
+			})
+			.catch(err => {
+				this.logger.warn(`Caching failed for pack: ${err}`);
+				this.logger.debug(err.stack);
+			}));
+	}
+
+	clear() {
+		this.fileSystemInfo.clear();
+		this.buildDependencies.clear();
+		this.newBuildDependencies.clear();
+		this.resolveBuildDependenciesSnapshot = undefined;
+		this.resolveResults = undefined;
+		this.buildSnapshot = undefined;
+		this.packPromise = undefined;
+	}
+}
+
+module.exports = PackFileCacheStrategy;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/ResolverCachePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/ResolverCachePlugin.js
new file mode 100644
index 0000000..f53626b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/ResolverCachePlugin.js
@@ -0,0 +1,354 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const LazySet = require("../util/LazySet");
+const makeSerializable = require("../util/makeSerializable");
+
+/** @typedef {import("enhanced-resolve/lib/Resolver")} Resolver */
+/** @typedef {import("../CacheFacade").ItemCacheFacade} ItemCacheFacade */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../FileSystemInfo")} FileSystemInfo */
+/** @typedef {import("../FileSystemInfo").Snapshot} Snapshot */
+
+class CacheEntry {
+	constructor(result, snapshot) {
+		this.result = result;
+		this.snapshot = snapshot;
+	}
+
+	serialize({ write }) {
+		write(this.result);
+		write(this.snapshot);
+	}
+
+	deserialize({ read }) {
+		this.result = read();
+		this.snapshot = read();
+	}
+}
+
+makeSerializable(CacheEntry, "webpack/lib/cache/ResolverCachePlugin");
+
+/**
+ * @template T
+ * @param {Set<T> | LazySet<T>} set set to add items to
+ * @param {Set<T> | LazySet<T>} otherSet set to add items from
+ * @returns {void}
+ */
+const addAllToSet = (set, otherSet) => {
+	if (set instanceof LazySet) {
+		set.addAll(otherSet);
+	} else {
+		for (const item of otherSet) {
+			set.add(item);
+		}
+	}
+};
+
+/**
+ * @param {Object} object an object
+ * @param {boolean} excludeContext if true, context is not included in string
+ * @returns {string} stringified version
+ */
+const objectToString = (object, excludeContext) => {
+	let str = "";
+	for (const key in object) {
+		if (excludeContext && key === "context") continue;
+		const value = object[key];
+		if (typeof value === "object" && value !== null) {
+			str += `|${key}=[${objectToString(value, false)}|]`;
+		} else {
+			str += `|${key}=|${value}`;
+		}
+	}
+	return str;
+};
+
+class ResolverCachePlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const cache = compiler.getCache("ResolverCachePlugin");
+		/** @type {FileSystemInfo} */
+		let fileSystemInfo;
+		let snapshotOptions;
+		let realResolves = 0;
+		let cachedResolves = 0;
+		let cacheInvalidResolves = 0;
+		let concurrentResolves = 0;
+		compiler.hooks.thisCompilation.tap("ResolverCachePlugin", compilation => {
+			snapshotOptions = compilation.options.snapshot.resolve;
+			fileSystemInfo = compilation.fileSystemInfo;
+			compilation.hooks.finishModules.tap("ResolverCachePlugin", () => {
+				if (realResolves + cachedResolves > 0) {
+					const logger = compilation.getLogger("webpack.ResolverCachePlugin");
+					logger.log(
+						`${Math.round(
+							(100 * realResolves) / (realResolves + cachedResolves)
+						)}% really resolved (${realResolves} real resolves with ${cacheInvalidResolves} cached but invalid, ${cachedResolves} cached valid, ${concurrentResolves} concurrent)`
+					);
+					realResolves = 0;
+					cachedResolves = 0;
+					cacheInvalidResolves = 0;
+					concurrentResolves = 0;
+				}
+			});
+		});
+		/**
+		 * @param {ItemCacheFacade} itemCache cache
+		 * @param {Resolver} resolver the resolver
+		 * @param {Object} resolveContext context for resolving meta info
+		 * @param {Object} request the request info object
+		 * @param {function((Error | null)=, Object=): void} callback callback function
+		 * @returns {void}
+		 */
+		const doRealResolve = (
+			itemCache,
+			resolver,
+			resolveContext,
+			request,
+			callback
+		) => {
+			realResolves++;
+			const newRequest = {
+				_ResolverCachePluginCacheMiss: true,
+				...request
+			};
+			const newResolveContext = {
+				...resolveContext,
+				stack: new Set(),
+				missingDependencies: new LazySet(),
+				fileDependencies: new LazySet(),
+				contextDependencies: new LazySet()
+			};
+			let yieldResult;
+			let withYield = false;
+			if (typeof newResolveContext.yield === "function") {
+				yieldResult = [];
+				withYield = true;
+				newResolveContext.yield = obj => yieldResult.push(obj);
+			}
+			const propagate = key => {
+				if (resolveContext[key]) {
+					addAllToSet(resolveContext[key], newResolveContext[key]);
+				}
+			};
+			const resolveTime = Date.now();
+			resolver.doResolve(
+				resolver.hooks.resolve,
+				newRequest,
+				"Cache miss",
+				newResolveContext,
+				(err, result) => {
+					propagate("fileDependencies");
+					propagate("contextDependencies");
+					propagate("missingDependencies");
+					if (err) return callback(err);
+					const fileDependencies = newResolveContext.fileDependencies;
+					const contextDependencies = newResolveContext.contextDependencies;
+					const missingDependencies = newResolveContext.missingDependencies;
+					fileSystemInfo.createSnapshot(
+						resolveTime,
+						fileDependencies,
+						contextDependencies,
+						missingDependencies,
+						snapshotOptions,
+						(err, snapshot) => {
+							if (err) return callback(err);
+							const resolveResult = withYield ? yieldResult : result;
+							// since we intercept resolve hook
+							// we still can get result in callback
+							if (withYield && result) yieldResult.push(result);
+							if (!snapshot) {
+								if (resolveResult) return callback(null, resolveResult);
+								return callback();
+							}
+							itemCache.store(
+								new CacheEntry(resolveResult, snapshot),
+								storeErr => {
+									if (storeErr) return callback(storeErr);
+									if (resolveResult) return callback(null, resolveResult);
+									callback();
+								}
+							);
+						}
+					);
+				}
+			);
+		};
+		compiler.resolverFactory.hooks.resolver.intercept({
+			factory(type, hook) {
+				/** @type {Map<string, (function(Error=, Object=): void)[]>} */
+				const activeRequests = new Map();
+				/** @type {Map<string, [function(Error=, Object=): void, function(Error=, Object=): void][]>} */
+				const activeRequestsWithYield = new Map();
+				hook.tap(
+					"ResolverCachePlugin",
+					/**
+					 * @param {Resolver} resolver the resolver
+					 * @param {Object} options resolve options
+					 * @param {Object} userOptions resolve options passed by the user
+					 * @returns {void}
+					 */
+					(resolver, options, userOptions) => {
+						if (options.cache !== true) return;
+						const optionsIdent = objectToString(userOptions, false);
+						const cacheWithContext =
+							options.cacheWithContext !== undefined
+								? options.cacheWithContext
+								: false;
+						resolver.hooks.resolve.tapAsync(
+							{
+								name: "ResolverCachePlugin",
+								stage: -100
+							},
+							(request, resolveContext, callback) => {
+								if (request._ResolverCachePluginCacheMiss || !fileSystemInfo) {
+									return callback();
+								}
+								const withYield = typeof resolveContext.yield === "function";
+								const identifier = `${type}${
+									withYield ? "|yield" : "|default"
+								}${optionsIdent}${objectToString(request, !cacheWithContext)}`;
+
+								if (withYield) {
+									const activeRequest = activeRequestsWithYield.get(identifier);
+									if (activeRequest) {
+										activeRequest[0].push(callback);
+										activeRequest[1].push(resolveContext.yield);
+										return;
+									}
+								} else {
+									const activeRequest = activeRequests.get(identifier);
+									if (activeRequest) {
+										activeRequest.push(callback);
+										return;
+									}
+								}
+								const itemCache = cache.getItemCache(identifier, null);
+								let callbacks, yields;
+								const done = withYield
+									? (err, result) => {
+											if (callbacks === undefined) {
+												if (err) {
+													callback(err);
+												} else {
+													if (result)
+														for (const r of result) resolveContext.yield(r);
+													callback(null, null);
+												}
+												yields = undefined;
+												callbacks = false;
+											} else {
+												if (err) {
+													for (const cb of callbacks) cb(err);
+												} else {
+													for (let i = 0; i < callbacks.length; i++) {
+														const cb = callbacks[i];
+														const yield_ = yields[i];
+														if (result) for (const r of result) yield_(r);
+														cb(null, null);
+													}
+												}
+												activeRequestsWithYield.delete(identifier);
+												yields = undefined;
+												callbacks = false;
+											}
+									  }
+									: (err, result) => {
+											if (callbacks === undefined) {
+												callback(err, result);
+												callbacks = false;
+											} else {
+												for (const callback of callbacks) {
+													callback(err, result);
+												}
+												activeRequests.delete(identifier);
+												callbacks = false;
+											}
+									  };
+								/**
+								 * @param {Error=} err error if any
+								 * @param {CacheEntry=} cacheEntry cache entry
+								 * @returns {void}
+								 */
+								const processCacheResult = (err, cacheEntry) => {
+									if (err) return done(err);
+
+									if (cacheEntry) {
+										const { snapshot, result } = cacheEntry;
+										fileSystemInfo.checkSnapshotValid(
+											snapshot,
+											(err, valid) => {
+												if (err || !valid) {
+													cacheInvalidResolves++;
+													return doRealResolve(
+														itemCache,
+														resolver,
+														resolveContext,
+														request,
+														done
+													);
+												}
+												cachedResolves++;
+												if (resolveContext.missingDependencies) {
+													addAllToSet(
+														resolveContext.missingDependencies,
+														snapshot.getMissingIterable()
+													);
+												}
+												if (resolveContext.fileDependencies) {
+													addAllToSet(
+														resolveContext.fileDependencies,
+														snapshot.getFileIterable()
+													);
+												}
+												if (resolveContext.contextDependencies) {
+													addAllToSet(
+														resolveContext.contextDependencies,
+														snapshot.getContextIterable()
+													);
+												}
+												done(null, result);
+											}
+										);
+									} else {
+										doRealResolve(
+											itemCache,
+											resolver,
+											resolveContext,
+											request,
+											done
+										);
+									}
+								};
+								itemCache.get(processCacheResult);
+								if (withYield && callbacks === undefined) {
+									callbacks = [callback];
+									yields = [resolveContext.yield];
+									activeRequestsWithYield.set(
+										identifier,
+										/** @type {[any, any]} */ ([callbacks, yields])
+									);
+								} else if (callbacks === undefined) {
+									callbacks = [callback];
+									activeRequests.set(identifier, callbacks);
+								}
+							}
+						);
+					}
+				);
+				return hook;
+			}
+		});
+	}
+}
+
+module.exports = ResolverCachePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/getLazyHashedEtag.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/getLazyHashedEtag.js
new file mode 100644
index 0000000..6cdf6c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/getLazyHashedEtag.js
@@ -0,0 +1,81 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const createHash = require("../util/createHash");
+
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {typeof import("../util/Hash")} HashConstructor */
+
+/**
+ * @typedef {Object} HashableObject
+ * @property {function(Hash): void} updateHash
+ */
+
+class LazyHashedEtag {
+	/**
+	 * @param {HashableObject} obj object with updateHash method
+	 * @param {string | HashConstructor} hashFunction the hash function to use
+	 */
+	constructor(obj, hashFunction = "md4") {
+		this._obj = obj;
+		this._hash = undefined;
+		this._hashFunction = hashFunction;
+	}
+
+	/**
+	 * @returns {string} hash of object
+	 */
+	toString() {
+		if (this._hash === undefined) {
+			const hash = createHash(this._hashFunction);
+			this._obj.updateHash(hash);
+			this._hash = /** @type {string} */ (hash.digest("base64"));
+		}
+		return this._hash;
+	}
+}
+
+/** @type {Map<string | HashConstructor, WeakMap<HashableObject, LazyHashedEtag>>} */
+const mapStrings = new Map();
+
+/** @type {WeakMap<HashConstructor, WeakMap<HashableObject, LazyHashedEtag>>} */
+const mapObjects = new WeakMap();
+
+/**
+ * @param {HashableObject} obj object with updateHash method
+ * @param {string | HashConstructor} hashFunction the hash function to use
+ * @returns {LazyHashedEtag} etag
+ */
+const getter = (obj, hashFunction = "md4") => {
+	let innerMap;
+	if (typeof hashFunction === "string") {
+		innerMap = mapStrings.get(hashFunction);
+		if (innerMap === undefined) {
+			const newHash = new LazyHashedEtag(obj, hashFunction);
+			innerMap = new WeakMap();
+			innerMap.set(obj, newHash);
+			mapStrings.set(hashFunction, innerMap);
+			return newHash;
+		}
+	} else {
+		innerMap = mapObjects.get(hashFunction);
+		if (innerMap === undefined) {
+			const newHash = new LazyHashedEtag(obj, hashFunction);
+			innerMap = new WeakMap();
+			innerMap.set(obj, newHash);
+			mapObjects.set(hashFunction, innerMap);
+			return newHash;
+		}
+	}
+	const hash = innerMap.get(obj);
+	if (hash !== undefined) return hash;
+	const newHash = new LazyHashedEtag(obj, hashFunction);
+	innerMap.set(obj, newHash);
+	return newHash;
+};
+
+module.exports = getter;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cache/mergeEtags.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/mergeEtags.js
new file mode 100644
index 0000000..8c6af34
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cache/mergeEtags.js
@@ -0,0 +1,74 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Cache").Etag} Etag */
+
+class MergedEtag {
+	/**
+	 * @param {Etag} a first
+	 * @param {Etag} b second
+	 */
+	constructor(a, b) {
+		this.a = a;
+		this.b = b;
+	}
+
+	toString() {
+		return `${this.a.toString()}|${this.b.toString()}`;
+	}
+}
+
+const dualObjectMap = new WeakMap();
+const objectStringMap = new WeakMap();
+
+/**
+ * @param {Etag} a first
+ * @param {Etag} b second
+ * @returns {Etag} result
+ */
+const mergeEtags = (a, b) => {
+	if (typeof a === "string") {
+		if (typeof b === "string") {
+			return `${a}|${b}`;
+		} else {
+			const temp = b;
+			b = a;
+			a = temp;
+		}
+	} else {
+		if (typeof b !== "string") {
+			// both a and b are objects
+			let map = dualObjectMap.get(a);
+			if (map === undefined) {
+				dualObjectMap.set(a, (map = new WeakMap()));
+			}
+			const mergedEtag = map.get(b);
+			if (mergedEtag === undefined) {
+				const newMergedEtag = new MergedEtag(a, b);
+				map.set(b, newMergedEtag);
+				return newMergedEtag;
+			} else {
+				return mergedEtag;
+			}
+		}
+	}
+	// a is object, b is string
+	let map = objectStringMap.get(a);
+	if (map === undefined) {
+		objectStringMap.set(a, (map = new Map()));
+	}
+	const mergedEtag = map.get(b);
+	if (mergedEtag === undefined) {
+		const newMergedEtag = new MergedEtag(a, b);
+		map.set(b, newMergedEtag);
+		return newMergedEtag;
+	} else {
+		return mergedEtag;
+	}
+};
+
+module.exports = mergeEtags;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/cli.js b/node_modules/mathjs/examples/node_modules/webpack/lib/cli.js
new file mode 100644
index 0000000..7165b3c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/cli.js
@@ -0,0 +1,655 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const path = require("path");
+const webpackSchema = require("../schemas/WebpackOptions.json");
+
+// TODO add originPath to PathItem for better errors
+/**
+ * @typedef {Object} PathItem
+ * @property {any} schema the part of the schema
+ * @property {string} path the path in the config
+ */
+
+/** @typedef {"unknown-argument" | "unexpected-non-array-in-path" | "unexpected-non-object-in-path" | "multiple-values-unexpected" | "invalid-value"} ProblemType */
+
+/**
+ * @typedef {Object} Problem
+ * @property {ProblemType} type
+ * @property {string} path
+ * @property {string} argument
+ * @property {any=} value
+ * @property {number=} index
+ * @property {string=} expected
+ */
+
+/**
+ * @typedef {Object} LocalProblem
+ * @property {ProblemType} type
+ * @property {string} path
+ * @property {string=} expected
+ */
+
+/**
+ * @typedef {Object} ArgumentConfig
+ * @property {string} description
+ * @property {string} [negatedDescription]
+ * @property {string} path
+ * @property {boolean} multiple
+ * @property {"enum"|"string"|"path"|"number"|"boolean"|"RegExp"|"reset"} type
+ * @property {any[]=} values
+ */
+
+/**
+ * @typedef {Object} Argument
+ * @property {string} description
+ * @property {"string"|"number"|"boolean"} simpleType
+ * @property {boolean} multiple
+ * @property {ArgumentConfig[]} configs
+ */
+
+/**
+ * @param {any=} schema a json schema to create arguments for (by default webpack schema is used)
+ * @returns {Record<string, Argument>} object of arguments
+ */
+const getArguments = (schema = webpackSchema) => {
+	/** @type {Record<string, Argument>} */
+	const flags = {};
+
+	const pathToArgumentName = input => {
+		return input
+			.replace(/\./g, "-")
+			.replace(/\[\]/g, "")
+			.replace(
+				/(\p{Uppercase_Letter}+|\p{Lowercase_Letter}|\d)(\p{Uppercase_Letter}+)/gu,
+				"$1-$2"
+			)
+			.replace(/-?[^\p{Uppercase_Letter}\p{Lowercase_Letter}\d]+/gu, "-")
+			.toLowerCase();
+	};
+
+	const getSchemaPart = path => {
+		const newPath = path.split("/");
+
+		let schemaPart = schema;
+
+		for (let i = 1; i < newPath.length; i++) {
+			const inner = schemaPart[newPath[i]];
+
+			if (!inner) {
+				break;
+			}
+
+			schemaPart = inner;
+		}
+
+		return schemaPart;
+	};
+
+	/**
+	 *
+	 * @param {PathItem[]} path path in the schema
+	 * @returns {string | undefined} description
+	 */
+	const getDescription = path => {
+		for (const { schema } of path) {
+			if (schema.cli) {
+				if (schema.cli.helper) continue;
+				if (schema.cli.description) return schema.cli.description;
+			}
+			if (schema.description) return schema.description;
+		}
+	};
+
+	/**
+	 *
+	 * @param {PathItem[]} path path in the schema
+	 * @returns {string | undefined} negative description
+	 */
+	const getNegatedDescription = path => {
+		for (const { schema } of path) {
+			if (schema.cli) {
+				if (schema.cli.helper) continue;
+				if (schema.cli.negatedDescription) return schema.cli.negatedDescription;
+			}
+		}
+	};
+
+	/**
+	 *
+	 * @param {PathItem[]} path path in the schema
+	 * @returns {string | undefined} reset description
+	 */
+	const getResetDescription = path => {
+		for (const { schema } of path) {
+			if (schema.cli) {
+				if (schema.cli.helper) continue;
+				if (schema.cli.resetDescription) return schema.cli.resetDescription;
+			}
+		}
+	};
+
+	/**
+	 *
+	 * @param {any} schemaPart schema
+	 * @returns {Pick<ArgumentConfig, "type"|"values">} partial argument config
+	 */
+	const schemaToArgumentConfig = schemaPart => {
+		if (schemaPart.enum) {
+			return {
+				type: "enum",
+				values: schemaPart.enum
+			};
+		}
+		switch (schemaPart.type) {
+			case "number":
+				return {
+					type: "number"
+				};
+			case "string":
+				return {
+					type: schemaPart.absolutePath ? "path" : "string"
+				};
+			case "boolean":
+				return {
+					type: "boolean"
+				};
+		}
+		if (schemaPart.instanceof === "RegExp") {
+			return {
+				type: "RegExp"
+			};
+		}
+		return undefined;
+	};
+
+	/**
+	 * @param {PathItem[]} path path in the schema
+	 * @returns {void}
+	 */
+	const addResetFlag = path => {
+		const schemaPath = path[0].path;
+		const name = pathToArgumentName(`${schemaPath}.reset`);
+		const description =
+			getResetDescription(path) ||
+			`Clear all items provided in '${schemaPath}' configuration. ${getDescription(
+				path
+			)}`;
+		flags[name] = {
+			configs: [
+				{
+					type: "reset",
+					multiple: false,
+					description,
+					path: schemaPath
+				}
+			],
+			description: undefined,
+			simpleType: undefined,
+			multiple: undefined
+		};
+	};
+
+	/**
+	 * @param {PathItem[]} path full path in schema
+	 * @param {boolean} multiple inside of an array
+	 * @returns {number} number of arguments added
+	 */
+	const addFlag = (path, multiple) => {
+		const argConfigBase = schemaToArgumentConfig(path[0].schema);
+		if (!argConfigBase) return 0;
+
+		const negatedDescription = getNegatedDescription(path);
+		const name = pathToArgumentName(path[0].path);
+		/** @type {ArgumentConfig} */
+		const argConfig = {
+			...argConfigBase,
+			multiple,
+			description: getDescription(path),
+			path: path[0].path
+		};
+
+		if (negatedDescription) {
+			argConfig.negatedDescription = negatedDescription;
+		}
+
+		if (!flags[name]) {
+			flags[name] = {
+				configs: [],
+				description: undefined,
+				simpleType: undefined,
+				multiple: undefined
+			};
+		}
+
+		if (
+			flags[name].configs.some(
+				item => JSON.stringify(item) === JSON.stringify(argConfig)
+			)
+		) {
+			return 0;
+		}
+
+		if (
+			flags[name].configs.some(
+				item => item.type === argConfig.type && item.multiple !== multiple
+			)
+		) {
+			if (multiple) {
+				throw new Error(
+					`Conflicting schema for ${path[0].path} with ${argConfig.type} type (array type must be before single item type)`
+				);
+			}
+			return 0;
+		}
+
+		flags[name].configs.push(argConfig);
+
+		return 1;
+	};
+
+	// TODO support `not` and `if/then/else`
+	// TODO support `const`, but we don't use it on our schema
+	/**
+	 *
+	 * @param {object} schemaPart the current schema
+	 * @param {string} schemaPath the current path in the schema
+	 * @param {{schema: object, path: string}[]} path all previous visited schemaParts
+	 * @param {string | null} inArray if inside of an array, the path to the array
+	 * @returns {number} added arguments
+	 */
+	const traverse = (schemaPart, schemaPath = "", path = [], inArray = null) => {
+		while (schemaPart.$ref) {
+			schemaPart = getSchemaPart(schemaPart.$ref);
+		}
+
+		const repetitions = path.filter(({ schema }) => schema === schemaPart);
+		if (
+			repetitions.length >= 2 ||
+			repetitions.some(({ path }) => path === schemaPath)
+		) {
+			return 0;
+		}
+
+		if (schemaPart.cli && schemaPart.cli.exclude) return 0;
+
+		const fullPath = [{ schema: schemaPart, path: schemaPath }, ...path];
+
+		let addedArguments = 0;
+
+		addedArguments += addFlag(fullPath, !!inArray);
+
+		if (schemaPart.type === "object") {
+			if (schemaPart.properties) {
+				for (const property of Object.keys(schemaPart.properties)) {
+					addedArguments += traverse(
+						schemaPart.properties[property],
+						schemaPath ? `${schemaPath}.${property}` : property,
+						fullPath,
+						inArray
+					);
+				}
+			}
+
+			return addedArguments;
+		}
+
+		if (schemaPart.type === "array") {
+			if (inArray) {
+				return 0;
+			}
+			if (Array.isArray(schemaPart.items)) {
+				let i = 0;
+				for (const item of schemaPart.items) {
+					addedArguments += traverse(
+						item,
+						`${schemaPath}.${i}`,
+						fullPath,
+						schemaPath
+					);
+				}
+
+				return addedArguments;
+			}
+
+			addedArguments += traverse(
+				schemaPart.items,
+				`${schemaPath}[]`,
+				fullPath,
+				schemaPath
+			);
+
+			if (addedArguments > 0) {
+				addResetFlag(fullPath);
+				addedArguments++;
+			}
+
+			return addedArguments;
+		}
+
+		const maybeOf = schemaPart.oneOf || schemaPart.anyOf || schemaPart.allOf;
+
+		if (maybeOf) {
+			const items = maybeOf;
+
+			for (let i = 0; i < items.length; i++) {
+				addedArguments += traverse(items[i], schemaPath, fullPath, inArray);
+			}
+
+			return addedArguments;
+		}
+
+		return addedArguments;
+	};
+
+	traverse(schema);
+
+	// Summarize flags
+	for (const name of Object.keys(flags)) {
+		const argument = flags[name];
+		argument.description = argument.configs.reduce((desc, { description }) => {
+			if (!desc) return description;
+			if (!description) return desc;
+			if (desc.includes(description)) return desc;
+			return `${desc} ${description}`;
+		}, /** @type {string | undefined} */ (undefined));
+		argument.simpleType = argument.configs.reduce((t, argConfig) => {
+			/** @type {"string" | "number" | "boolean"} */
+			let type = "string";
+			switch (argConfig.type) {
+				case "number":
+					type = "number";
+					break;
+				case "reset":
+				case "boolean":
+					type = "boolean";
+					break;
+				case "enum":
+					if (argConfig.values.every(v => typeof v === "boolean"))
+						type = "boolean";
+					if (argConfig.values.every(v => typeof v === "number"))
+						type = "number";
+					break;
+			}
+			if (t === undefined) return type;
+			return t === type ? t : "string";
+		}, /** @type {"string" | "number" | "boolean" | undefined} */ (undefined));
+		argument.multiple = argument.configs.some(c => c.multiple);
+	}
+
+	return flags;
+};
+
+const cliAddedItems = new WeakMap();
+
+/**
+ * @param {any} config configuration
+ * @param {string} schemaPath path in the config
+ * @param {number | undefined} index index of value when multiple values are provided, otherwise undefined
+ * @returns {{ problem?: LocalProblem, object?: any, property?: string | number, value?: any }} problem or object with property and value
+ */
+const getObjectAndProperty = (config, schemaPath, index = 0) => {
+	if (!schemaPath) return { value: config };
+	const parts = schemaPath.split(".");
+	let property = parts.pop();
+	let current = config;
+	let i = 0;
+	for (const part of parts) {
+		const isArray = part.endsWith("[]");
+		const name = isArray ? part.slice(0, -2) : part;
+		let value = current[name];
+		if (isArray) {
+			if (value === undefined) {
+				value = {};
+				current[name] = [...Array.from({ length: index }), value];
+				cliAddedItems.set(current[name], index + 1);
+			} else if (!Array.isArray(value)) {
+				return {
+					problem: {
+						type: "unexpected-non-array-in-path",
+						path: parts.slice(0, i).join(".")
+					}
+				};
+			} else {
+				let addedItems = cliAddedItems.get(value) || 0;
+				while (addedItems <= index) {
+					value.push(undefined);
+					addedItems++;
+				}
+				cliAddedItems.set(value, addedItems);
+				const x = value.length - addedItems + index;
+				if (value[x] === undefined) {
+					value[x] = {};
+				} else if (value[x] === null || typeof value[x] !== "object") {
+					return {
+						problem: {
+							type: "unexpected-non-object-in-path",
+							path: parts.slice(0, i).join(".")
+						}
+					};
+				}
+				value = value[x];
+			}
+		} else {
+			if (value === undefined) {
+				value = current[name] = {};
+			} else if (value === null || typeof value !== "object") {
+				return {
+					problem: {
+						type: "unexpected-non-object-in-path",
+						path: parts.slice(0, i).join(".")
+					}
+				};
+			}
+		}
+		current = value;
+		i++;
+	}
+	let value = current[property];
+	if (property.endsWith("[]")) {
+		const name = property.slice(0, -2);
+		const value = current[name];
+		if (value === undefined) {
+			current[name] = [...Array.from({ length: index }), undefined];
+			cliAddedItems.set(current[name], index + 1);
+			return { object: current[name], property: index, value: undefined };
+		} else if (!Array.isArray(value)) {
+			current[name] = [value, ...Array.from({ length: index }), undefined];
+			cliAddedItems.set(current[name], index + 1);
+			return { object: current[name], property: index + 1, value: undefined };
+		} else {
+			let addedItems = cliAddedItems.get(value) || 0;
+			while (addedItems <= index) {
+				value.push(undefined);
+				addedItems++;
+			}
+			cliAddedItems.set(value, addedItems);
+			const x = value.length - addedItems + index;
+			if (value[x] === undefined) {
+				value[x] = {};
+			} else if (value[x] === null || typeof value[x] !== "object") {
+				return {
+					problem: {
+						type: "unexpected-non-object-in-path",
+						path: schemaPath
+					}
+				};
+			}
+			return {
+				object: value,
+				property: x,
+				value: value[x]
+			};
+		}
+	}
+	return { object: current, property, value };
+};
+
+/**
+ * @param {any} config configuration
+ * @param {string} schemaPath path in the config
+ * @param {any} value parsed value
+ * @param {number | undefined} index index of value when multiple values are provided, otherwise undefined
+ * @returns {LocalProblem | null} problem or null for success
+ */
+const setValue = (config, schemaPath, value, index) => {
+	const { problem, object, property } = getObjectAndProperty(
+		config,
+		schemaPath,
+		index
+	);
+	if (problem) return problem;
+	object[property] = value;
+	return null;
+};
+
+/**
+ * @param {ArgumentConfig} argConfig processing instructions
+ * @param {any} config configuration
+ * @param {any} value the value
+ * @param {number | undefined} index the index if multiple values provided
+ * @returns {LocalProblem | null} a problem if any
+ */
+const processArgumentConfig = (argConfig, config, value, index) => {
+	if (index !== undefined && !argConfig.multiple) {
+		return {
+			type: "multiple-values-unexpected",
+			path: argConfig.path
+		};
+	}
+	const parsed = parseValueForArgumentConfig(argConfig, value);
+	if (parsed === undefined) {
+		return {
+			type: "invalid-value",
+			path: argConfig.path,
+			expected: getExpectedValue(argConfig)
+		};
+	}
+	const problem = setValue(config, argConfig.path, parsed, index);
+	if (problem) return problem;
+	return null;
+};
+
+/**
+ * @param {ArgumentConfig} argConfig processing instructions
+ * @returns {string | undefined} expected message
+ */
+const getExpectedValue = argConfig => {
+	switch (argConfig.type) {
+		default:
+			return argConfig.type;
+		case "boolean":
+			return "true | false";
+		case "RegExp":
+			return "regular expression (example: /ab?c*/)";
+		case "enum":
+			return argConfig.values.map(v => `${v}`).join(" | ");
+		case "reset":
+			return "true (will reset the previous value to an empty array)";
+	}
+};
+
+/**
+ * @param {ArgumentConfig} argConfig processing instructions
+ * @param {any} value the value
+ * @returns {any | undefined} parsed value
+ */
+const parseValueForArgumentConfig = (argConfig, value) => {
+	switch (argConfig.type) {
+		case "string":
+			if (typeof value === "string") {
+				return value;
+			}
+			break;
+		case "path":
+			if (typeof value === "string") {
+				return path.resolve(value);
+			}
+			break;
+		case "number":
+			if (typeof value === "number") return value;
+			if (typeof value === "string" && /^[+-]?\d*(\.\d*)[eE]\d+$/) {
+				const n = +value;
+				if (!isNaN(n)) return n;
+			}
+			break;
+		case "boolean":
+			if (typeof value === "boolean") return value;
+			if (value === "true") return true;
+			if (value === "false") return false;
+			break;
+		case "RegExp":
+			if (value instanceof RegExp) return value;
+			if (typeof value === "string") {
+				// cspell:word yugi
+				const match = /^\/(.*)\/([yugi]*)$/.exec(value);
+				if (match && !/[^\\]\//.test(match[1]))
+					return new RegExp(match[1], match[2]);
+			}
+			break;
+		case "enum":
+			if (argConfig.values.includes(value)) return value;
+			for (const item of argConfig.values) {
+				if (`${item}` === value) return item;
+			}
+			break;
+		case "reset":
+			if (value === true) return [];
+			break;
+	}
+};
+
+/**
+ * @param {Record<string, Argument>} args object of arguments
+ * @param {any} config configuration
+ * @param {Record<string, string | number | boolean | RegExp | (string | number | boolean | RegExp)[]>} values object with values
+ * @returns {Problem[] | null} problems or null for success
+ */
+const processArguments = (args, config, values) => {
+	/** @type {Problem[]} */
+	const problems = [];
+	for (const key of Object.keys(values)) {
+		const arg = args[key];
+		if (!arg) {
+			problems.push({
+				type: "unknown-argument",
+				path: "",
+				argument: key
+			});
+			continue;
+		}
+		const processValue = (value, i) => {
+			const currentProblems = [];
+			for (const argConfig of arg.configs) {
+				const problem = processArgumentConfig(argConfig, config, value, i);
+				if (!problem) {
+					return;
+				}
+				currentProblems.push({
+					...problem,
+					argument: key,
+					value: value,
+					index: i
+				});
+			}
+			problems.push(...currentProblems);
+		};
+		let value = values[key];
+		if (Array.isArray(value)) {
+			for (let i = 0; i < value.length; i++) {
+				processValue(value[i], i);
+			}
+		} else {
+			processValue(value, undefined);
+		}
+	}
+	if (problems.length === 0) return null;
+	return problems;
+};
+
+exports.getArguments = getArguments;
+exports.processArguments = processArguments;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/config/browserslistTargetHandler.js b/node_modules/mathjs/examples/node_modules/webpack/lib/config/browserslistTargetHandler.js
new file mode 100644
index 0000000..58cdf36
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/config/browserslistTargetHandler.js
@@ -0,0 +1,333 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const browserslist = require("browserslist");
+const path = require("path");
+
+/** @typedef {import("./target").ApiTargetProperties} ApiTargetProperties */
+/** @typedef {import("./target").EcmaTargetProperties} EcmaTargetProperties */
+/** @typedef {import("./target").PlatformTargetProperties} PlatformTargetProperties */
+
+// [[C:]/path/to/config][:env]
+const inputRx = /^(?:((?:[A-Z]:)?[/\\].*?))?(?::(.+?))?$/i;
+
+/**
+ * @typedef {Object} BrowserslistHandlerConfig
+ * @property {string=} configPath
+ * @property {string=} env
+ * @property {string=} query
+ */
+
+/**
+ * @param {string} input input string
+ * @param {string} context the context directory
+ * @returns {BrowserslistHandlerConfig} config
+ */
+const parse = (input, context) => {
+	if (!input) {
+		return {};
+	}
+
+	if (path.isAbsolute(input)) {
+		const [, configPath, env] = inputRx.exec(input) || [];
+		return { configPath, env };
+	}
+
+	const config = browserslist.findConfig(context);
+
+	if (config && Object.keys(config).includes(input)) {
+		return { env: input };
+	}
+
+	return { query: input };
+};
+
+/**
+ * @param {string} input input string
+ * @param {string} context the context directory
+ * @returns {string[] | undefined} selected browsers
+ */
+const load = (input, context) => {
+	const { configPath, env, query } = parse(input, context);
+
+	// if a query is specified, then use it, else
+	// if a path to a config is specified then load it, else
+	// find a nearest config
+	const config = query
+		? query
+		: configPath
+		? browserslist.loadConfig({
+				config: configPath,
+				env
+		  })
+		: browserslist.loadConfig({ path: context, env });
+
+	if (!config) return null;
+	return browserslist(config);
+};
+
+/**
+ * @param {string[]} browsers supported browsers list
+ * @returns {EcmaTargetProperties & PlatformTargetProperties & ApiTargetProperties} target properties
+ */
+const resolve = browsers => {
+	/**
+	 * Checks all against a version number
+	 * @param {Record<string, number | [number, number]>} versions first supported version
+	 * @returns {boolean} true if supports
+	 */
+	const rawChecker = versions => {
+		return browsers.every(v => {
+			const [name, parsedVersion] = v.split(" ");
+			if (!name) return false;
+			const requiredVersion = versions[name];
+			if (!requiredVersion) return false;
+			const [parsedMajor, parserMinor] =
+				// safari TP supports all features for normal safari
+				parsedVersion === "TP"
+					? [Infinity, Infinity]
+					: parsedVersion.split(".");
+			if (typeof requiredVersion === "number") {
+				return +parsedMajor >= requiredVersion;
+			}
+			return requiredVersion[0] === +parsedMajor
+				? +parserMinor >= requiredVersion[1]
+				: +parsedMajor > requiredVersion[0];
+		});
+	};
+	const anyNode = browsers.some(b => /^node /.test(b));
+	const anyBrowser = browsers.some(b => /^(?!node)/.test(b));
+	const browserProperty = !anyBrowser ? false : anyNode ? null : true;
+	const nodeProperty = !anyNode ? false : anyBrowser ? null : true;
+	// Internet Explorer Mobile, Blackberry browser and Opera Mini are very old browsers, they do not support new features
+	const es6DynamicImport = rawChecker({
+		chrome: 63,
+		and_chr: 63,
+		edge: 79,
+		firefox: 67,
+		and_ff: 67,
+		// ie: Not supported
+		opera: 50,
+		op_mob: 46,
+		safari: [11, 1],
+		ios_saf: [11, 3],
+		samsung: [8, 2],
+		android: 63,
+		and_qq: [10, 4],
+		// baidu: Not supported
+		// and_uc: Not supported
+		// kaios: Not supported
+		node: [12, 17]
+	});
+
+	return {
+		const: rawChecker({
+			chrome: 49,
+			and_chr: 49,
+			edge: 12,
+			// Prior to Firefox 13, <code>const</code> is implemented, but re-assignment is not failing.
+			// Prior to Firefox 46, a <code>TypeError</code> was thrown on redeclaration instead of a <code>SyntaxError</code>.
+			firefox: 36,
+			and_ff: 36,
+			// Not supported in for-in and for-of loops
+			// ie: Not supported
+			opera: 36,
+			op_mob: 36,
+			safari: [10, 0],
+			ios_saf: [10, 0],
+			// Before 5.0 supported correctly in strict mode, otherwise supported without block scope
+			samsung: [5, 0],
+			android: 37,
+			and_qq: [10, 4],
+			// Supported correctly in strict mode, otherwise supported without block scope
+			// baidu: Not supported
+			and_uc: [12, 12],
+			kaios: [2, 5],
+			node: [6, 0]
+		}),
+		arrowFunction: rawChecker({
+			chrome: 45,
+			and_chr: 45,
+			edge: 12,
+			// The initial implementation of arrow functions in Firefox made them automatically strict. This has been changed as of Firefox 24. The use of <code>'use strict';</code> is now required.
+			// Prior to Firefox 39, a line terminator (<code>\\n</code>) was incorrectly allowed after arrow function arguments. This has been fixed to conform to the ES2015 specification and code like <code>() \\n => {}</code> will now throw a <code>SyntaxError</code> in this and later versions.
+			firefox: 39,
+			and_ff: 39,
+			// ie: Not supported,
+			opera: 32,
+			op_mob: 32,
+			safari: 10,
+			ios_saf: 10,
+			samsung: [5, 0],
+			android: 45,
+			and_qq: [10, 4],
+			baidu: [7, 12],
+			and_uc: [12, 12],
+			kaios: [2, 5],
+			node: [6, 0]
+		}),
+		forOf: rawChecker({
+			chrome: 38,
+			and_chr: 38,
+			edge: 12,
+			// Prior to Firefox 51, using the for...of loop construct with the const keyword threw a SyntaxError ("missing = in const declaration").
+			firefox: 51,
+			and_ff: 51,
+			// ie: Not supported,
+			opera: 25,
+			op_mob: 25,
+			safari: 7,
+			ios_saf: 7,
+			samsung: [3, 0],
+			android: 38,
+			// and_qq: Unknown support
+			// baidu: Unknown support
+			// and_uc: Unknown support
+			// kaios: Unknown support
+			node: [0, 12]
+		}),
+		destructuring: rawChecker({
+			chrome: 49,
+			and_chr: 49,
+			edge: 14,
+			firefox: 41,
+			and_ff: 41,
+			// ie: Not supported,
+			opera: 36,
+			op_mob: 36,
+			safari: 8,
+			ios_saf: 8,
+			samsung: [5, 0],
+			android: 49,
+			// and_qq: Unknown support
+			// baidu: Unknown support
+			// and_uc: Unknown support
+			// kaios: Unknown support
+			node: [6, 0]
+		}),
+		bigIntLiteral: rawChecker({
+			chrome: 67,
+			and_chr: 67,
+			edge: 79,
+			firefox: 68,
+			and_ff: 68,
+			// ie: Not supported,
+			opera: 54,
+			op_mob: 48,
+			safari: 14,
+			ios_saf: 14,
+			samsung: [9, 2],
+			android: 67,
+			// and_qq: Not supported
+			// baidu: Not supported
+			// and_uc: Not supported
+			// kaios: Not supported
+			node: [10, 4]
+		}),
+		// Support syntax `import` and `export` and no limitations and bugs on Node.js
+		// Not include `export * as namespace`
+		module: rawChecker({
+			chrome: 61,
+			and_chr: 61,
+			edge: 16,
+			firefox: 60,
+			and_ff: 60,
+			// ie: Not supported,
+			opera: 48,
+			op_mob: 45,
+			safari: [10, 1],
+			ios_saf: [10, 3],
+			samsung: [8, 0],
+			android: 61,
+			and_qq: [10, 4],
+			// baidu: Not supported
+			// and_uc: Not supported
+			// kaios: Not supported
+			node: [12, 17]
+		}),
+		dynamicImport: es6DynamicImport,
+		dynamicImportInWorker: es6DynamicImport && !anyNode,
+		// browserslist does not have info about globalThis
+		// so this is based on mdn-browser-compat-data
+		globalThis: rawChecker({
+			chrome: 71,
+			and_chr: 71,
+			edge: 79,
+			firefox: 65,
+			and_ff: 65,
+			// ie: Not supported,
+			opera: 58,
+			op_mob: 50,
+			safari: [12, 1],
+			ios_saf: [12, 2],
+			samsung: [10, 1],
+			android: 71,
+			// and_qq: Unknown support
+			// baidu: Unknown support
+			// and_uc: Unknown support
+			// kaios: Unknown support
+			node: 12
+		}),
+		optionalChaining: rawChecker({
+			chrome: 80,
+			and_chr: 80,
+			edge: 80,
+			firefox: 74,
+			and_ff: 79,
+			// ie: Not supported,
+			opera: 67,
+			op_mob: 64,
+			safari: [13, 1],
+			ios_saf: [13, 4],
+			samsung: 13,
+			android: 80,
+			// and_qq: Not supported
+			// baidu: Not supported
+			// and_uc: Not supported
+			// kaios: Not supported
+			node: 14
+		}),
+		templateLiteral: rawChecker({
+			chrome: 41,
+			and_chr: 41,
+			edge: 13,
+			firefox: 34,
+			and_ff: 34,
+			// ie: Not supported,
+			opera: 29,
+			op_mob: 64,
+			safari: [9, 1],
+			ios_saf: 9,
+			samsung: 4,
+			android: 41,
+			and_qq: [10, 4],
+			baidu: [7, 12],
+			and_uc: [12, 12],
+			kaios: [2, 5],
+			node: 4
+		}),
+		browser: browserProperty,
+		electron: false,
+		node: nodeProperty,
+		nwjs: false,
+		web: browserProperty,
+		webworker: false,
+
+		document: browserProperty,
+		fetchWasm: browserProperty,
+		global: nodeProperty,
+		importScripts: false,
+		importScriptsInWorker: true,
+		nodeBuiltins: nodeProperty,
+		require: nodeProperty
+	};
+};
+
+module.exports = {
+	resolve,
+	load
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/config/defaults.js b/node_modules/mathjs/examples/node_modules/webpack/lib/config/defaults.js
new file mode 100644
index 0000000..bfc8b29
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/config/defaults.js
@@ -0,0 +1,1309 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const fs = require("fs");
+const path = require("path");
+const Template = require("../Template");
+const { cleverMerge } = require("../util/cleverMerge");
+const {
+	getTargetsProperties,
+	getTargetProperties,
+	getDefaultTarget
+} = require("./target");
+
+/** @typedef {import("../../declarations/WebpackOptions").CacheOptionsNormalized} CacheOptions */
+/** @typedef {import("../../declarations/WebpackOptions").CssExperimentOptions} CssExperimentOptions */
+/** @typedef {import("../../declarations/WebpackOptions").EntryDescription} EntryDescription */
+/** @typedef {import("../../declarations/WebpackOptions").EntryNormalized} Entry */
+/** @typedef {import("../../declarations/WebpackOptions").Experiments} Experiments */
+/** @typedef {import("../../declarations/WebpackOptions").ExperimentsNormalized} ExperimentsNormalized */
+/** @typedef {import("../../declarations/WebpackOptions").ExternalsPresets} ExternalsPresets */
+/** @typedef {import("../../declarations/WebpackOptions").ExternalsType} ExternalsType */
+/** @typedef {import("../../declarations/WebpackOptions").InfrastructureLogging} InfrastructureLogging */
+/** @typedef {import("../../declarations/WebpackOptions").JavascriptParserOptions} JavascriptParserOptions */
+/** @typedef {import("../../declarations/WebpackOptions").Library} Library */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryName} LibraryName */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").Loader} Loader */
+/** @typedef {import("../../declarations/WebpackOptions").Mode} Mode */
+/** @typedef {import("../../declarations/WebpackOptions").ModuleOptionsNormalized} ModuleOptions */
+/** @typedef {import("../../declarations/WebpackOptions").Node} WebpackNode */
+/** @typedef {import("../../declarations/WebpackOptions").Optimization} Optimization */
+/** @typedef {import("../../declarations/WebpackOptions").OutputNormalized} Output */
+/** @typedef {import("../../declarations/WebpackOptions").Performance} Performance */
+/** @typedef {import("../../declarations/WebpackOptions").ResolveOptions} ResolveOptions */
+/** @typedef {import("../../declarations/WebpackOptions").RuleSetRules} RuleSetRules */
+/** @typedef {import("../../declarations/WebpackOptions").SnapshotOptions} SnapshotOptions */
+/** @typedef {import("../../declarations/WebpackOptions").Target} Target */
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("./target").TargetProperties} TargetProperties */
+
+const NODE_MODULES_REGEXP = /[\\/]node_modules[\\/]/i;
+
+/**
+ * Sets a constant default value when undefined
+ * @template T
+ * @template {keyof T} P
+ * @param {T} obj an object
+ * @param {P} prop a property of this object
+ * @param {T[P]} value a default value of the property
+ * @returns {void}
+ */
+const D = (obj, prop, value) => {
+	if (obj[prop] === undefined) {
+		obj[prop] = value;
+	}
+};
+
+/**
+ * Sets a dynamic default value when undefined, by calling the factory function
+ * @template T
+ * @template {keyof T} P
+ * @param {T} obj an object
+ * @param {P} prop a property of this object
+ * @param {function(): T[P]} factory a default value factory for the property
+ * @returns {void}
+ */
+const F = (obj, prop, factory) => {
+	if (obj[prop] === undefined) {
+		obj[prop] = factory();
+	}
+};
+
+/**
+ * Sets a dynamic default value when undefined, by calling the factory function.
+ * factory must return an array or undefined
+ * When the current value is already an array an contains "..." it's replaced with
+ * the result of the factory function
+ * @template T
+ * @template {keyof T} P
+ * @param {T} obj an object
+ * @param {P} prop a property of this object
+ * @param {function(): T[P]} factory a default value factory for the property
+ * @returns {void}
+ */
+const A = (obj, prop, factory) => {
+	const value = obj[prop];
+	if (value === undefined) {
+		obj[prop] = factory();
+	} else if (Array.isArray(value)) {
+		/** @type {any[]} */
+		let newArray = undefined;
+		for (let i = 0; i < value.length; i++) {
+			const item = value[i];
+			if (item === "...") {
+				if (newArray === undefined) {
+					newArray = value.slice(0, i);
+					obj[prop] = /** @type {T[P]} */ (/** @type {unknown} */ (newArray));
+				}
+				const items = /** @type {any[]} */ (/** @type {unknown} */ (factory()));
+				if (items !== undefined) {
+					for (const item of items) {
+						newArray.push(item);
+					}
+				}
+			} else if (newArray !== undefined) {
+				newArray.push(item);
+			}
+		}
+	}
+};
+
+/**
+ * @param {WebpackOptions} options options to be modified
+ * @returns {void}
+ */
+const applyWebpackOptionsBaseDefaults = options => {
+	F(options, "context", () => process.cwd());
+	applyInfrastructureLoggingDefaults(options.infrastructureLogging);
+};
+
+/**
+ * @param {WebpackOptions} options options to be modified
+ * @returns {void}
+ */
+const applyWebpackOptionsDefaults = options => {
+	F(options, "context", () => process.cwd());
+	F(options, "target", () => {
+		return getDefaultTarget(options.context);
+	});
+
+	const { mode, name, target } = options;
+
+	let targetProperties =
+		target === false
+			? /** @type {false} */ (false)
+			: typeof target === "string"
+			? getTargetProperties(target, options.context)
+			: getTargetsProperties(target, options.context);
+
+	const development = mode === "development";
+	const production = mode === "production" || !mode;
+
+	if (typeof options.entry !== "function") {
+		for (const key of Object.keys(options.entry)) {
+			F(
+				options.entry[key],
+				"import",
+				() => /** @type {[string]} */ (["./src"])
+			);
+		}
+	}
+
+	F(options, "devtool", () => (development ? "eval" : false));
+	D(options, "watch", false);
+	D(options, "profile", false);
+	D(options, "parallelism", 100);
+	D(options, "recordsInputPath", false);
+	D(options, "recordsOutputPath", false);
+
+	applyExperimentsDefaults(options.experiments, {
+		production,
+		development,
+		targetProperties
+	});
+
+	const futureDefaults = options.experiments.futureDefaults;
+
+	F(options, "cache", () =>
+		development ? { type: /** @type {"memory"} */ ("memory") } : false
+	);
+	applyCacheDefaults(options.cache, {
+		name: name || "default",
+		mode: mode || "production",
+		development,
+		cacheUnaffected: options.experiments.cacheUnaffected
+	});
+	const cache = !!options.cache;
+
+	applySnapshotDefaults(options.snapshot, {
+		production,
+		futureDefaults
+	});
+
+	applyModuleDefaults(options.module, {
+		cache,
+		syncWebAssembly: options.experiments.syncWebAssembly,
+		asyncWebAssembly: options.experiments.asyncWebAssembly,
+		css: options.experiments.css,
+		futureDefaults
+	});
+
+	applyOutputDefaults(options.output, {
+		context: options.context,
+		targetProperties,
+		isAffectedByBrowserslist:
+			target === undefined ||
+			(typeof target === "string" && target.startsWith("browserslist")) ||
+			(Array.isArray(target) &&
+				target.some(target => target.startsWith("browserslist"))),
+		outputModule: options.experiments.outputModule,
+		development,
+		entry: options.entry,
+		module: options.module,
+		futureDefaults
+	});
+
+	applyExternalsPresetsDefaults(options.externalsPresets, {
+		targetProperties,
+		buildHttp: !!options.experiments.buildHttp
+	});
+
+	applyLoaderDefaults(options.loader, { targetProperties });
+
+	F(options, "externalsType", () => {
+		const validExternalTypes = require("../../schemas/WebpackOptions.json")
+			.definitions.ExternalsType.enum;
+		return options.output.library &&
+			validExternalTypes.includes(options.output.library.type)
+			? /** @type {ExternalsType} */ (options.output.library.type)
+			: options.output.module
+			? "module"
+			: "var";
+	});
+
+	applyNodeDefaults(options.node, {
+		futureDefaults: options.experiments.futureDefaults,
+		targetProperties
+	});
+
+	F(options, "performance", () =>
+		production &&
+		targetProperties &&
+		(targetProperties.browser || targetProperties.browser === null)
+			? {}
+			: false
+	);
+	applyPerformanceDefaults(options.performance, {
+		production
+	});
+
+	applyOptimizationDefaults(options.optimization, {
+		development,
+		production,
+		css: options.experiments.css,
+		records: !!(options.recordsInputPath || options.recordsOutputPath)
+	});
+
+	options.resolve = cleverMerge(
+		getResolveDefaults({
+			cache,
+			context: options.context,
+			targetProperties,
+			mode: options.mode
+		}),
+		options.resolve
+	);
+
+	options.resolveLoader = cleverMerge(
+		getResolveLoaderDefaults({ cache }),
+		options.resolveLoader
+	);
+};
+
+/**
+ * @param {ExperimentsNormalized} experiments options
+ * @param {Object} options options
+ * @param {boolean} options.production is production
+ * @param {boolean} options.development is development mode
+ * @param {TargetProperties | false} options.targetProperties target properties
+ * @returns {void}
+ */
+const applyExperimentsDefaults = (
+	experiments,
+	{ production, development, targetProperties }
+) => {
+	D(experiments, "futureDefaults", false);
+	D(experiments, "backCompat", !experiments.futureDefaults);
+	D(experiments, "topLevelAwait", experiments.futureDefaults);
+	D(experiments, "syncWebAssembly", false);
+	D(experiments, "asyncWebAssembly", experiments.futureDefaults);
+	D(experiments, "outputModule", false);
+	D(experiments, "layers", false);
+	D(experiments, "lazyCompilation", undefined);
+	D(experiments, "buildHttp", undefined);
+	D(experiments, "cacheUnaffected", experiments.futureDefaults);
+	F(experiments, "css", () => (experiments.futureDefaults ? {} : undefined));
+
+	if (typeof experiments.buildHttp === "object") {
+		D(experiments.buildHttp, "frozen", production);
+		D(experiments.buildHttp, "upgrade", false);
+	}
+
+	if (typeof experiments.css === "object") {
+		D(
+			experiments.css,
+			"exportsOnly",
+			!targetProperties || !targetProperties.document
+		);
+	}
+};
+
+/**
+ * @param {CacheOptions} cache options
+ * @param {Object} options options
+ * @param {string} options.name name
+ * @param {string} options.mode mode
+ * @param {boolean} options.development is development mode
+ * @param {boolean} options.cacheUnaffected the cacheUnaffected experiment is enabled
+ * @returns {void}
+ */
+const applyCacheDefaults = (
+	cache,
+	{ name, mode, development, cacheUnaffected }
+) => {
+	if (cache === false) return;
+	switch (cache.type) {
+		case "filesystem":
+			F(cache, "name", () => name + "-" + mode);
+			D(cache, "version", "");
+			F(cache, "cacheDirectory", () => {
+				const cwd = process.cwd();
+				let dir = cwd;
+				for (;;) {
+					try {
+						if (fs.statSync(path.join(dir, "package.json")).isFile()) break;
+						// eslint-disable-next-line no-empty
+					} catch (e) {}
+					const parent = path.dirname(dir);
+					if (dir === parent) {
+						dir = undefined;
+						break;
+					}
+					dir = parent;
+				}
+				if (!dir) {
+					return path.resolve(cwd, ".cache/webpack");
+				} else if (process.versions.pnp === "1") {
+					return path.resolve(dir, ".pnp/.cache/webpack");
+				} else if (process.versions.pnp === "3") {
+					return path.resolve(dir, ".yarn/.cache/webpack");
+				} else {
+					return path.resolve(dir, "node_modules/.cache/webpack");
+				}
+			});
+			F(cache, "cacheLocation", () =>
+				path.resolve(cache.cacheDirectory, cache.name)
+			);
+			D(cache, "hashAlgorithm", "md4");
+			D(cache, "store", "pack");
+			D(cache, "compression", false);
+			D(cache, "profile", false);
+			D(cache, "idleTimeout", 60000);
+			D(cache, "idleTimeoutForInitialStore", 5000);
+			D(cache, "idleTimeoutAfterLargeChanges", 1000);
+			D(cache, "maxMemoryGenerations", development ? 5 : Infinity);
+			D(cache, "maxAge", 1000 * 60 * 60 * 24 * 60); // 1 month
+			D(cache, "allowCollectingMemory", development);
+			D(cache, "memoryCacheUnaffected", development && cacheUnaffected);
+			D(cache.buildDependencies, "defaultWebpack", [
+				path.resolve(__dirname, "..") + path.sep
+			]);
+			break;
+		case "memory":
+			D(cache, "maxGenerations", Infinity);
+			D(cache, "cacheUnaffected", development && cacheUnaffected);
+			break;
+	}
+};
+
+/**
+ * @param {SnapshotOptions} snapshot options
+ * @param {Object} options options
+ * @param {boolean} options.production is production
+ * @param {boolean} options.futureDefaults is future defaults enabled
+ * @returns {void}
+ */
+const applySnapshotDefaults = (snapshot, { production, futureDefaults }) => {
+	if (futureDefaults) {
+		F(snapshot, "managedPaths", () =>
+			process.versions.pnp === "3"
+				? [
+						/^(.+?(?:[\\/]\.yarn[\\/]unplugged[\\/][^\\/]+)?[\\/]node_modules[\\/])/
+				  ]
+				: [/^(.+?[\\/]node_modules[\\/])/]
+		);
+		F(snapshot, "immutablePaths", () =>
+			process.versions.pnp === "3"
+				? [/^(.+?[\\/]cache[\\/][^\\/]+\.zip[\\/]node_modules[\\/])/]
+				: []
+		);
+	} else {
+		A(snapshot, "managedPaths", () => {
+			if (process.versions.pnp === "3") {
+				const match =
+					/^(.+?)[\\/]cache[\\/]watchpack-npm-[^\\/]+\.zip[\\/]node_modules[\\/]/.exec(
+						require.resolve("watchpack")
+					);
+				if (match) {
+					return [path.resolve(match[1], "unplugged")];
+				}
+			} else {
+				const match = /^(.+?[\\/]node_modules[\\/])/.exec(
+					// eslint-disable-next-line node/no-extraneous-require
+					require.resolve("watchpack")
+				);
+				if (match) {
+					return [match[1]];
+				}
+			}
+			return [];
+		});
+		A(snapshot, "immutablePaths", () => {
+			if (process.versions.pnp === "1") {
+				const match =
+					/^(.+?[\\/]v4)[\\/]npm-watchpack-[^\\/]+-[\da-f]{40}[\\/]node_modules[\\/]/.exec(
+						require.resolve("watchpack")
+					);
+				if (match) {
+					return [match[1]];
+				}
+			} else if (process.versions.pnp === "3") {
+				const match =
+					/^(.+?)[\\/]watchpack-npm-[^\\/]+\.zip[\\/]node_modules[\\/]/.exec(
+						require.resolve("watchpack")
+					);
+				if (match) {
+					return [match[1]];
+				}
+			}
+			return [];
+		});
+	}
+	F(snapshot, "resolveBuildDependencies", () => ({
+		timestamp: true,
+		hash: true
+	}));
+	F(snapshot, "buildDependencies", () => ({ timestamp: true, hash: true }));
+	F(snapshot, "module", () =>
+		production ? { timestamp: true, hash: true } : { timestamp: true }
+	);
+	F(snapshot, "resolve", () =>
+		production ? { timestamp: true, hash: true } : { timestamp: true }
+	);
+};
+
+/**
+ * @param {JavascriptParserOptions} parserOptions parser options
+ * @param {Object} options options
+ * @param {boolean} options.futureDefaults is future defaults enabled
+ * @returns {void}
+ */
+const applyJavascriptParserOptionsDefaults = (
+	parserOptions,
+	{ futureDefaults }
+) => {
+	D(parserOptions, "unknownContextRequest", ".");
+	D(parserOptions, "unknownContextRegExp", false);
+	D(parserOptions, "unknownContextRecursive", true);
+	D(parserOptions, "unknownContextCritical", true);
+	D(parserOptions, "exprContextRequest", ".");
+	D(parserOptions, "exprContextRegExp", false);
+	D(parserOptions, "exprContextRecursive", true);
+	D(parserOptions, "exprContextCritical", true);
+	D(parserOptions, "wrappedContextRegExp", /.*/);
+	D(parserOptions, "wrappedContextRecursive", true);
+	D(parserOptions, "wrappedContextCritical", false);
+	D(parserOptions, "strictThisContextOnImports", false);
+	D(parserOptions, "importMeta", true);
+	if (futureDefaults) D(parserOptions, "exportsPresence", "error");
+};
+
+/**
+ * @param {ModuleOptions} module options
+ * @param {Object} options options
+ * @param {boolean} options.cache is caching enabled
+ * @param {boolean} options.syncWebAssembly is syncWebAssembly enabled
+ * @param {boolean} options.asyncWebAssembly is asyncWebAssembly enabled
+ * @param {CssExperimentOptions} options.css is css enabled
+ * @param {boolean} options.futureDefaults is future defaults enabled
+ * @returns {void}
+ */
+const applyModuleDefaults = (
+	module,
+	{ cache, syncWebAssembly, asyncWebAssembly, css, futureDefaults }
+) => {
+	if (cache) {
+		D(module, "unsafeCache", module => {
+			const name = module.nameForCondition();
+			return name && NODE_MODULES_REGEXP.test(name);
+		});
+	} else {
+		D(module, "unsafeCache", false);
+	}
+
+	F(module.parser, "asset", () => ({}));
+	F(module.parser.asset, "dataUrlCondition", () => ({}));
+	if (typeof module.parser.asset.dataUrlCondition === "object") {
+		D(module.parser.asset.dataUrlCondition, "maxSize", 8096);
+	}
+
+	F(module.parser, "javascript", () => ({}));
+	applyJavascriptParserOptionsDefaults(module.parser.javascript, {
+		futureDefaults
+	});
+
+	A(module, "defaultRules", () => {
+		const esm = {
+			type: "javascript/esm",
+			resolve: {
+				byDependency: {
+					esm: {
+						fullySpecified: true
+					}
+				}
+			}
+		};
+		const commonjs = {
+			type: "javascript/dynamic"
+		};
+		/** @type {RuleSetRules} */
+		const rules = [
+			{
+				mimetype: "application/node",
+				type: "javascript/auto"
+			},
+			{
+				test: /\.json$/i,
+				type: "json"
+			},
+			{
+				mimetype: "application/json",
+				type: "json"
+			},
+			{
+				test: /\.mjs$/i,
+				...esm
+			},
+			{
+				test: /\.js$/i,
+				descriptionData: {
+					type: "module"
+				},
+				...esm
+			},
+			{
+				test: /\.cjs$/i,
+				...commonjs
+			},
+			{
+				test: /\.js$/i,
+				descriptionData: {
+					type: "commonjs"
+				},
+				...commonjs
+			},
+			{
+				mimetype: {
+					or: ["text/javascript", "application/javascript"]
+				},
+				...esm
+			}
+		];
+		if (asyncWebAssembly) {
+			const wasm = {
+				type: "webassembly/async",
+				rules: [
+					{
+						descriptionData: {
+							type: "module"
+						},
+						resolve: {
+							fullySpecified: true
+						}
+					}
+				]
+			};
+			rules.push({
+				test: /\.wasm$/i,
+				...wasm
+			});
+			rules.push({
+				mimetype: "application/wasm",
+				...wasm
+			});
+		} else if (syncWebAssembly) {
+			const wasm = {
+				type: "webassembly/sync",
+				rules: [
+					{
+						descriptionData: {
+							type: "module"
+						},
+						resolve: {
+							fullySpecified: true
+						}
+					}
+				]
+			};
+			rules.push({
+				test: /\.wasm$/i,
+				...wasm
+			});
+			rules.push({
+				mimetype: "application/wasm",
+				...wasm
+			});
+		}
+		if (css) {
+			const cssRule = {
+				type: "css",
+				resolve: {
+					fullySpecified: true,
+					preferRelative: true
+				}
+			};
+			const cssModulesRule = {
+				type: "css/module",
+				resolve: {
+					fullySpecified: true
+				}
+			};
+			rules.push({
+				test: /\.css$/i,
+				oneOf: [
+					{
+						test: /\.module\.css$/i,
+						...cssModulesRule
+					},
+					{
+						...cssRule
+					}
+				]
+			});
+			rules.push({
+				mimetype: "text/css+module",
+				...cssModulesRule
+			});
+			rules.push({
+				mimetype: "text/css",
+				...cssRule
+			});
+		}
+		rules.push(
+			{
+				dependency: "url",
+				oneOf: [
+					{
+						scheme: /^data$/,
+						type: "asset/inline"
+					},
+					{
+						type: "asset/resource"
+					}
+				]
+			},
+			{
+				assert: { type: "json" },
+				type: "json"
+			}
+		);
+		return rules;
+	});
+};
+
+/**
+ * @param {Output} output options
+ * @param {Object} options options
+ * @param {string} options.context context
+ * @param {TargetProperties | false} options.targetProperties target properties
+ * @param {boolean} options.isAffectedByBrowserslist is affected by browserslist
+ * @param {boolean} options.outputModule is outputModule experiment enabled
+ * @param {boolean} options.development is development mode
+ * @param {Entry} options.entry entry option
+ * @param {ModuleOptions} options.module module option
+ * @param {boolean} options.futureDefaults is future defaults enabled
+ * @returns {void}
+ */
+const applyOutputDefaults = (
+	output,
+	{
+		context,
+		targetProperties: tp,
+		isAffectedByBrowserslist,
+		outputModule,
+		development,
+		entry,
+		module,
+		futureDefaults
+	}
+) => {
+	/**
+	 * @param {Library=} library the library option
+	 * @returns {string} a readable library name
+	 */
+	const getLibraryName = library => {
+		const libraryName =
+			typeof library === "object" &&
+			library &&
+			!Array.isArray(library) &&
+			"type" in library
+				? library.name
+				: /** @type {LibraryName=} */ (library);
+		if (Array.isArray(libraryName)) {
+			return libraryName.join(".");
+		} else if (typeof libraryName === "object") {
+			return getLibraryName(libraryName.root);
+		} else if (typeof libraryName === "string") {
+			return libraryName;
+		}
+		return "";
+	};
+
+	F(output, "uniqueName", () => {
+		const libraryName = getLibraryName(output.library);
+		if (libraryName) return libraryName;
+		const pkgPath = path.resolve(context, "package.json");
+		try {
+			const packageInfo = JSON.parse(fs.readFileSync(pkgPath, "utf-8"));
+			return packageInfo.name || "";
+		} catch (e) {
+			if (e.code !== "ENOENT") {
+				e.message += `\nwhile determining default 'output.uniqueName' from 'name' in ${pkgPath}`;
+				throw e;
+			}
+			return "";
+		}
+	});
+
+	F(output, "module", () => !!outputModule);
+	D(output, "filename", output.module ? "[name].mjs" : "[name].js");
+	F(output, "iife", () => !output.module);
+	D(output, "importFunctionName", "import");
+	D(output, "importMetaName", "import.meta");
+	F(output, "chunkFilename", () => {
+		const filename = output.filename;
+		if (typeof filename !== "function") {
+			const hasName = filename.includes("[name]");
+			const hasId = filename.includes("[id]");
+			const hasChunkHash = filename.includes("[chunkhash]");
+			const hasContentHash = filename.includes("[contenthash]");
+			// Anything changing depending on chunk is fine
+			if (hasChunkHash || hasContentHash || hasName || hasId) return filename;
+			// Otherwise prefix "[id]." in front of the basename to make it changing
+			return filename.replace(/(^|\/)([^/]*(?:\?|$))/, "$1[id].$2");
+		}
+		return output.module ? "[id].mjs" : "[id].js";
+	});
+	F(output, "cssFilename", () => {
+		const filename = output.filename;
+		if (typeof filename !== "function") {
+			return filename.replace(/\.[mc]?js(\?|$)/, ".css$1");
+		}
+		return "[id].css";
+	});
+	F(output, "cssChunkFilename", () => {
+		const chunkFilename = output.chunkFilename;
+		if (typeof chunkFilename !== "function") {
+			return chunkFilename.replace(/\.[mc]?js(\?|$)/, ".css$1");
+		}
+		return "[id].css";
+	});
+	D(output, "assetModuleFilename", "[hash][ext][query]");
+	D(output, "webassemblyModuleFilename", "[hash].module.wasm");
+	D(output, "compareBeforeEmit", true);
+	D(output, "charset", true);
+	F(output, "hotUpdateGlobal", () =>
+		Template.toIdentifier(
+			"webpackHotUpdate" + Template.toIdentifier(output.uniqueName)
+		)
+	);
+	F(output, "chunkLoadingGlobal", () =>
+		Template.toIdentifier(
+			"webpackChunk" + Template.toIdentifier(output.uniqueName)
+		)
+	);
+	F(output, "globalObject", () => {
+		if (tp) {
+			if (tp.global) return "global";
+			if (tp.globalThis) return "globalThis";
+		}
+		return "self";
+	});
+	F(output, "chunkFormat", () => {
+		if (tp) {
+			const helpMessage = isAffectedByBrowserslist
+				? "Make sure that your 'browserslist' includes only platforms that support these features or select an appropriate 'target' to allow selecting a chunk format by default. Alternatively specify the 'output.chunkFormat' directly."
+				: "Select an appropriate 'target' to allow selecting one by default, or specify the 'output.chunkFormat' directly.";
+			if (output.module) {
+				if (tp.dynamicImport) return "module";
+				if (tp.document) return "array-push";
+				throw new Error(
+					"For the selected environment is no default ESM chunk format available:\n" +
+						"ESM exports can be chosen when 'import()' is available.\n" +
+						"JSONP Array push can be chosen when 'document' is available.\n" +
+						helpMessage
+				);
+			} else {
+				if (tp.document) return "array-push";
+				if (tp.require) return "commonjs";
+				if (tp.nodeBuiltins) return "commonjs";
+				if (tp.importScripts) return "array-push";
+				throw new Error(
+					"For the selected environment is no default script chunk format available:\n" +
+						"JSONP Array push can be chosen when 'document' or 'importScripts' is available.\n" +
+						"CommonJs exports can be chosen when 'require' or node builtins are available.\n" +
+						helpMessage
+				);
+			}
+		}
+		throw new Error(
+			"Chunk format can't be selected by default when no target is specified"
+		);
+	});
+	D(output, "asyncChunks", true);
+	F(output, "chunkLoading", () => {
+		if (tp) {
+			switch (output.chunkFormat) {
+				case "array-push":
+					if (tp.document) return "jsonp";
+					if (tp.importScripts) return "import-scripts";
+					break;
+				case "commonjs":
+					if (tp.require) return "require";
+					if (tp.nodeBuiltins) return "async-node";
+					break;
+				case "module":
+					if (tp.dynamicImport) return "import";
+					break;
+			}
+			if (
+				tp.require === null ||
+				tp.nodeBuiltins === null ||
+				tp.document === null ||
+				tp.importScripts === null
+			) {
+				return "universal";
+			}
+		}
+		return false;
+	});
+	F(output, "workerChunkLoading", () => {
+		if (tp) {
+			switch (output.chunkFormat) {
+				case "array-push":
+					if (tp.importScriptsInWorker) return "import-scripts";
+					break;
+				case "commonjs":
+					if (tp.require) return "require";
+					if (tp.nodeBuiltins) return "async-node";
+					break;
+				case "module":
+					if (tp.dynamicImportInWorker) return "import";
+					break;
+			}
+			if (
+				tp.require === null ||
+				tp.nodeBuiltins === null ||
+				tp.importScriptsInWorker === null
+			) {
+				return "universal";
+			}
+		}
+		return false;
+	});
+	F(output, "wasmLoading", () => {
+		if (tp) {
+			if (tp.fetchWasm) return "fetch";
+			if (tp.nodeBuiltins)
+				return output.module ? "async-node-module" : "async-node";
+			if (tp.nodeBuiltins === null || tp.fetchWasm === null) {
+				return "universal";
+			}
+		}
+		return false;
+	});
+	F(output, "workerWasmLoading", () => output.wasmLoading);
+	F(output, "devtoolNamespace", () => output.uniqueName);
+	if (output.library) {
+		F(output.library, "type", () => (output.module ? "module" : "var"));
+	}
+	F(output, "path", () => path.join(process.cwd(), "dist"));
+	F(output, "pathinfo", () => development);
+	D(output, "sourceMapFilename", "[file].map[query]");
+	D(
+		output,
+		"hotUpdateChunkFilename",
+		`[id].[fullhash].hot-update.${output.module ? "mjs" : "js"}`
+	);
+	D(output, "hotUpdateMainFilename", "[runtime].[fullhash].hot-update.json");
+	D(output, "crossOriginLoading", false);
+	F(output, "scriptType", () => (output.module ? "module" : false));
+	D(
+		output,
+		"publicPath",
+		(tp && (tp.document || tp.importScripts)) || output.scriptType === "module"
+			? "auto"
+			: ""
+	);
+	D(output, "chunkLoadTimeout", 120000);
+	D(output, "hashFunction", futureDefaults ? "xxhash64" : "md4");
+	D(output, "hashDigest", "hex");
+	D(output, "hashDigestLength", futureDefaults ? 16 : 20);
+	D(output, "strictModuleExceptionHandling", false);
+
+	const optimistic = v => v || v === undefined;
+	const conditionallyOptimistic = (v, c) => (v === undefined && c) || v;
+	F(
+		output.environment,
+		"arrowFunction",
+		() => tp && optimistic(tp.arrowFunction)
+	);
+	F(output.environment, "const", () => tp && optimistic(tp.const));
+	F(
+		output.environment,
+		"destructuring",
+		() => tp && optimistic(tp.destructuring)
+	);
+	F(output.environment, "forOf", () => tp && optimistic(tp.forOf));
+	F(output.environment, "bigIntLiteral", () => tp && tp.bigIntLiteral);
+	F(output.environment, "dynamicImport", () =>
+		conditionallyOptimistic(tp && tp.dynamicImport, output.module)
+	);
+	F(output.environment, "module", () =>
+		conditionallyOptimistic(tp && tp.module, output.module)
+	);
+
+	const { trustedTypes } = output;
+	if (trustedTypes) {
+		F(
+			trustedTypes,
+			"policyName",
+			() =>
+				output.uniqueName.replace(/[^a-zA-Z0-9\-#=_/@.%]+/g, "_") || "webpack"
+		);
+	}
+
+	/**
+	 * @param {function(EntryDescription): void} fn iterator
+	 * @returns {void}
+	 */
+	const forEachEntry = fn => {
+		for (const name of Object.keys(entry)) {
+			fn(entry[name]);
+		}
+	};
+	A(output, "enabledLibraryTypes", () => {
+		const enabledLibraryTypes = [];
+		if (output.library) {
+			enabledLibraryTypes.push(output.library.type);
+		}
+		forEachEntry(desc => {
+			if (desc.library) {
+				enabledLibraryTypes.push(desc.library.type);
+			}
+		});
+		return enabledLibraryTypes;
+	});
+
+	A(output, "enabledChunkLoadingTypes", () => {
+		const enabledChunkLoadingTypes = new Set();
+		if (output.chunkLoading) {
+			enabledChunkLoadingTypes.add(output.chunkLoading);
+		}
+		if (output.workerChunkLoading) {
+			enabledChunkLoadingTypes.add(output.workerChunkLoading);
+		}
+		forEachEntry(desc => {
+			if (desc.chunkLoading) {
+				enabledChunkLoadingTypes.add(desc.chunkLoading);
+			}
+		});
+		return Array.from(enabledChunkLoadingTypes);
+	});
+
+	A(output, "enabledWasmLoadingTypes", () => {
+		const enabledWasmLoadingTypes = new Set();
+		if (output.wasmLoading) {
+			enabledWasmLoadingTypes.add(output.wasmLoading);
+		}
+		if (output.workerWasmLoading) {
+			enabledWasmLoadingTypes.add(output.workerWasmLoading);
+		}
+		forEachEntry(desc => {
+			if (desc.wasmLoading) {
+				enabledWasmLoadingTypes.add(desc.wasmLoading);
+			}
+		});
+		return Array.from(enabledWasmLoadingTypes);
+	});
+};
+
+/**
+ * @param {ExternalsPresets} externalsPresets options
+ * @param {Object} options options
+ * @param {TargetProperties | false} options.targetProperties target properties
+ * @param {boolean} options.buildHttp buildHttp experiment enabled
+ * @returns {void}
+ */
+const applyExternalsPresetsDefaults = (
+	externalsPresets,
+	{ targetProperties, buildHttp }
+) => {
+	D(
+		externalsPresets,
+		"web",
+		!buildHttp && targetProperties && targetProperties.web
+	);
+	D(externalsPresets, "node", targetProperties && targetProperties.node);
+	D(externalsPresets, "nwjs", targetProperties && targetProperties.nwjs);
+	D(
+		externalsPresets,
+		"electron",
+		targetProperties && targetProperties.electron
+	);
+	D(
+		externalsPresets,
+		"electronMain",
+		targetProperties &&
+			targetProperties.electron &&
+			targetProperties.electronMain
+	);
+	D(
+		externalsPresets,
+		"electronPreload",
+		targetProperties &&
+			targetProperties.electron &&
+			targetProperties.electronPreload
+	);
+	D(
+		externalsPresets,
+		"electronRenderer",
+		targetProperties &&
+			targetProperties.electron &&
+			targetProperties.electronRenderer
+	);
+};
+
+/**
+ * @param {Loader} loader options
+ * @param {Object} options options
+ * @param {TargetProperties | false} options.targetProperties target properties
+ * @returns {void}
+ */
+const applyLoaderDefaults = (loader, { targetProperties }) => {
+	F(loader, "target", () => {
+		if (targetProperties) {
+			if (targetProperties.electron) {
+				if (targetProperties.electronMain) return "electron-main";
+				if (targetProperties.electronPreload) return "electron-preload";
+				if (targetProperties.electronRenderer) return "electron-renderer";
+				return "electron";
+			}
+			if (targetProperties.nwjs) return "nwjs";
+			if (targetProperties.node) return "node";
+			if (targetProperties.web) return "web";
+		}
+	});
+};
+
+/**
+ * @param {WebpackNode} node options
+ * @param {Object} options options
+ * @param {TargetProperties | false} options.targetProperties target properties
+ * @param {boolean} options.futureDefaults is future defaults enabled
+ * @returns {void}
+ */
+const applyNodeDefaults = (node, { futureDefaults, targetProperties }) => {
+	if (node === false) return;
+
+	F(node, "global", () => {
+		if (targetProperties && targetProperties.global) return false;
+		// TODO webpack 6 should always default to false
+		return futureDefaults ? "warn" : true;
+	});
+	F(node, "__filename", () => {
+		if (targetProperties && targetProperties.node) return "eval-only";
+		// TODO webpack 6 should always default to false
+		return futureDefaults ? "warn-mock" : "mock";
+	});
+	F(node, "__dirname", () => {
+		if (targetProperties && targetProperties.node) return "eval-only";
+		// TODO webpack 6 should always default to false
+		return futureDefaults ? "warn-mock" : "mock";
+	});
+};
+
+/**
+ * @param {Performance} performance options
+ * @param {Object} options options
+ * @param {boolean} options.production is production
+ * @returns {void}
+ */
+const applyPerformanceDefaults = (performance, { production }) => {
+	if (performance === false) return;
+	D(performance, "maxAssetSize", 250000);
+	D(performance, "maxEntrypointSize", 250000);
+	F(performance, "hints", () => (production ? "warning" : false));
+};
+
+/**
+ * @param {Optimization} optimization options
+ * @param {Object} options options
+ * @param {boolean} options.production is production
+ * @param {boolean} options.development is development
+ * @param {CssExperimentOptions} options.css is css enabled
+ * @param {boolean} options.records using records
+ * @returns {void}
+ */
+const applyOptimizationDefaults = (
+	optimization,
+	{ production, development, css, records }
+) => {
+	D(optimization, "removeAvailableModules", false);
+	D(optimization, "removeEmptyChunks", true);
+	D(optimization, "mergeDuplicateChunks", true);
+	D(optimization, "flagIncludedChunks", production);
+	F(optimization, "moduleIds", () => {
+		if (production) return "deterministic";
+		if (development) return "named";
+		return "natural";
+	});
+	F(optimization, "chunkIds", () => {
+		if (production) return "deterministic";
+		if (development) return "named";
+		return "natural";
+	});
+	F(optimization, "sideEffects", () => (production ? true : "flag"));
+	D(optimization, "providedExports", true);
+	D(optimization, "usedExports", production);
+	D(optimization, "innerGraph", production);
+	D(optimization, "mangleExports", production);
+	D(optimization, "concatenateModules", production);
+	D(optimization, "runtimeChunk", false);
+	D(optimization, "emitOnErrors", !production);
+	D(optimization, "checkWasmTypes", production);
+	D(optimization, "mangleWasmImports", false);
+	D(optimization, "portableRecords", records);
+	D(optimization, "realContentHash", production);
+	D(optimization, "minimize", production);
+	A(optimization, "minimizer", () => [
+		{
+			apply: compiler => {
+				// Lazy load the Terser plugin
+				const TerserPlugin = require("terser-webpack-plugin");
+				new TerserPlugin({
+					terserOptions: {
+						compress: {
+							passes: 2
+						}
+					}
+				}).apply(compiler);
+			}
+		}
+	]);
+	F(optimization, "nodeEnv", () => {
+		if (production) return "production";
+		if (development) return "development";
+		return false;
+	});
+	const { splitChunks } = optimization;
+	if (splitChunks) {
+		A(splitChunks, "defaultSizeTypes", () =>
+			css ? ["javascript", "css", "unknown"] : ["javascript", "unknown"]
+		);
+		D(splitChunks, "hidePathInfo", production);
+		D(splitChunks, "chunks", "async");
+		D(splitChunks, "usedExports", optimization.usedExports === true);
+		D(splitChunks, "minChunks", 1);
+		F(splitChunks, "minSize", () => (production ? 20000 : 10000));
+		F(splitChunks, "minRemainingSize", () => (development ? 0 : undefined));
+		F(splitChunks, "enforceSizeThreshold", () => (production ? 50000 : 30000));
+		F(splitChunks, "maxAsyncRequests", () => (production ? 30 : Infinity));
+		F(splitChunks, "maxInitialRequests", () => (production ? 30 : Infinity));
+		D(splitChunks, "automaticNameDelimiter", "-");
+		const { cacheGroups } = splitChunks;
+		F(cacheGroups, "default", () => ({
+			idHint: "",
+			reuseExistingChunk: true,
+			minChunks: 2,
+			priority: -20
+		}));
+		F(cacheGroups, "defaultVendors", () => ({
+			idHint: "vendors",
+			reuseExistingChunk: true,
+			test: NODE_MODULES_REGEXP,
+			priority: -10
+		}));
+	}
+};
+
+/**
+ * @param {Object} options options
+ * @param {boolean} options.cache is cache enable
+ * @param {string} options.context build context
+ * @param {TargetProperties | false} options.targetProperties target properties
+ * @param {Mode} options.mode mode
+ * @returns {ResolveOptions} resolve options
+ */
+const getResolveDefaults = ({ cache, context, targetProperties, mode }) => {
+	/** @type {string[]} */
+	const conditions = ["webpack"];
+
+	conditions.push(mode === "development" ? "development" : "production");
+
+	if (targetProperties) {
+		if (targetProperties.webworker) conditions.push("worker");
+		if (targetProperties.node) conditions.push("node");
+		if (targetProperties.web) conditions.push("browser");
+		if (targetProperties.electron) conditions.push("electron");
+		if (targetProperties.nwjs) conditions.push("nwjs");
+	}
+
+	const jsExtensions = [".js", ".json", ".wasm"];
+
+	const tp = targetProperties;
+	const browserField =
+		tp && tp.web && (!tp.node || (tp.electron && tp.electronRenderer));
+
+	/** @type {function(): ResolveOptions} */
+	const cjsDeps = () => ({
+		aliasFields: browserField ? ["browser"] : [],
+		mainFields: browserField ? ["browser", "module", "..."] : ["module", "..."],
+		conditionNames: ["require", "module", "..."],
+		extensions: [...jsExtensions]
+	});
+	/** @type {function(): ResolveOptions} */
+	const esmDeps = () => ({
+		aliasFields: browserField ? ["browser"] : [],
+		mainFields: browserField ? ["browser", "module", "..."] : ["module", "..."],
+		conditionNames: ["import", "module", "..."],
+		extensions: [...jsExtensions]
+	});
+
+	/** @type {ResolveOptions} */
+	const resolveOptions = {
+		cache,
+		modules: ["node_modules"],
+		conditionNames: conditions,
+		mainFiles: ["index"],
+		extensions: [],
+		aliasFields: [],
+		exportsFields: ["exports"],
+		roots: [context],
+		mainFields: ["main"],
+		byDependency: {
+			wasm: esmDeps(),
+			esm: esmDeps(),
+			loaderImport: esmDeps(),
+			url: {
+				preferRelative: true
+			},
+			worker: {
+				...esmDeps(),
+				preferRelative: true
+			},
+			commonjs: cjsDeps(),
+			amd: cjsDeps(),
+			// for backward-compat: loadModule
+			loader: cjsDeps(),
+			// for backward-compat: Custom Dependency
+			unknown: cjsDeps(),
+			// for backward-compat: getResolve without dependencyType
+			undefined: cjsDeps()
+		}
+	};
+
+	return resolveOptions;
+};
+
+/**
+ * @param {Object} options options
+ * @param {boolean} options.cache is cache enable
+ * @returns {ResolveOptions} resolve options
+ */
+const getResolveLoaderDefaults = ({ cache }) => {
+	/** @type {ResolveOptions} */
+	const resolveOptions = {
+		cache,
+		conditionNames: ["loader", "require", "node"],
+		exportsFields: ["exports"],
+		mainFields: ["loader", "main"],
+		extensions: [".js"],
+		mainFiles: ["index"]
+	};
+
+	return resolveOptions;
+};
+
+/**
+ * @param {InfrastructureLogging} infrastructureLogging options
+ * @returns {void}
+ */
+const applyInfrastructureLoggingDefaults = infrastructureLogging => {
+	F(infrastructureLogging, "stream", () => process.stderr);
+	const tty =
+		/** @type {any} */ (infrastructureLogging.stream).isTTY &&
+		process.env.TERM !== "dumb";
+	D(infrastructureLogging, "level", "info");
+	D(infrastructureLogging, "debug", false);
+	D(infrastructureLogging, "colors", tty);
+	D(infrastructureLogging, "appendOnly", !tty);
+};
+
+exports.applyWebpackOptionsBaseDefaults = applyWebpackOptionsBaseDefaults;
+exports.applyWebpackOptionsDefaults = applyWebpackOptionsDefaults;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/config/normalization.js b/node_modules/mathjs/examples/node_modules/webpack/lib/config/normalization.js
new file mode 100644
index 0000000..0b17d8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/config/normalization.js
@@ -0,0 +1,529 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+
+/** @typedef {import("../../declarations/WebpackOptions").EntryStatic} EntryStatic */
+/** @typedef {import("../../declarations/WebpackOptions").EntryStaticNormalized} EntryStaticNormalized */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryName} LibraryName */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").OptimizationRuntimeChunk} OptimizationRuntimeChunk */
+/** @typedef {import("../../declarations/WebpackOptions").OptimizationRuntimeChunkNormalized} OptimizationRuntimeChunkNormalized */
+/** @typedef {import("../../declarations/WebpackOptions").OutputNormalized} OutputNormalized */
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptions} WebpackOptions */
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptionsNormalized */
+
+const handledDeprecatedNoEmitOnErrors = util.deprecate(
+	(noEmitOnErrors, emitOnErrors) => {
+		if (emitOnErrors !== undefined && !noEmitOnErrors === !emitOnErrors) {
+			throw new Error(
+				"Conflicting use of 'optimization.noEmitOnErrors' and 'optimization.emitOnErrors'. Remove deprecated 'optimization.noEmitOnErrors' from config."
+			);
+		}
+		return !noEmitOnErrors;
+	},
+	"optimization.noEmitOnErrors is deprecated in favor of optimization.emitOnErrors",
+	"DEP_WEBPACK_CONFIGURATION_OPTIMIZATION_NO_EMIT_ON_ERRORS"
+);
+
+/**
+ * @template T
+ * @template R
+ * @param {T|undefined} value value or not
+ * @param {function(T): R} fn nested handler
+ * @returns {R} result value
+ */
+const nestedConfig = (value, fn) =>
+	value === undefined ? fn(/** @type {T} */ ({})) : fn(value);
+
+/**
+ * @template T
+ * @param {T|undefined} value value or not
+ * @returns {T} result value
+ */
+const cloneObject = value => {
+	return /** @type {T} */ ({ ...value });
+};
+
+/**
+ * @template T
+ * @template R
+ * @param {T|undefined} value value or not
+ * @param {function(T): R} fn nested handler
+ * @returns {R|undefined} result value
+ */
+const optionalNestedConfig = (value, fn) =>
+	value === undefined ? undefined : fn(value);
+
+/**
+ * @template T
+ * @template R
+ * @param {T[]|undefined} value array or not
+ * @param {function(T[]): R[]} fn nested handler
+ * @returns {R[]|undefined} cloned value
+ */
+const nestedArray = (value, fn) => (Array.isArray(value) ? fn(value) : fn([]));
+
+/**
+ * @template T
+ * @template R
+ * @param {T[]|undefined} value array or not
+ * @param {function(T[]): R[]} fn nested handler
+ * @returns {R[]|undefined} cloned value
+ */
+const optionalNestedArray = (value, fn) =>
+	Array.isArray(value) ? fn(value) : undefined;
+
+/**
+ * @template T
+ * @template R
+ * @param {Record<string, T>|undefined} value value or not
+ * @param {function(T): R} fn nested handler
+ * @param {Record<string, function(T): R>=} customKeys custom nested handler for some keys
+ * @returns {Record<string, R>} result value
+ */
+const keyedNestedConfig = (value, fn, customKeys) => {
+	const result =
+		value === undefined
+			? {}
+			: Object.keys(value).reduce(
+					(obj, key) => (
+						(obj[key] = (
+							customKeys && key in customKeys ? customKeys[key] : fn
+						)(value[key])),
+						obj
+					),
+					/** @type {Record<string, R>} */ ({})
+			  );
+	if (customKeys) {
+		for (const key of Object.keys(customKeys)) {
+			if (!(key in result)) {
+				result[key] = customKeys[key](/** @type {T} */ ({}));
+			}
+		}
+	}
+	return result;
+};
+
+/**
+ * @param {WebpackOptions} config input config
+ * @returns {WebpackOptionsNormalized} normalized options
+ */
+const getNormalizedWebpackOptions = config => {
+	return {
+		amd: config.amd,
+		bail: config.bail,
+		cache: optionalNestedConfig(config.cache, cache => {
+			if (cache === false) return false;
+			if (cache === true) {
+				return {
+					type: "memory",
+					maxGenerations: undefined
+				};
+			}
+			switch (cache.type) {
+				case "filesystem":
+					return {
+						type: "filesystem",
+						allowCollectingMemory: cache.allowCollectingMemory,
+						maxMemoryGenerations: cache.maxMemoryGenerations,
+						maxAge: cache.maxAge,
+						profile: cache.profile,
+						buildDependencies: cloneObject(cache.buildDependencies),
+						cacheDirectory: cache.cacheDirectory,
+						cacheLocation: cache.cacheLocation,
+						hashAlgorithm: cache.hashAlgorithm,
+						compression: cache.compression,
+						idleTimeout: cache.idleTimeout,
+						idleTimeoutForInitialStore: cache.idleTimeoutForInitialStore,
+						idleTimeoutAfterLargeChanges: cache.idleTimeoutAfterLargeChanges,
+						name: cache.name,
+						store: cache.store,
+						version: cache.version
+					};
+				case undefined:
+				case "memory":
+					return {
+						type: "memory",
+						maxGenerations: cache.maxGenerations
+					};
+				default:
+					// @ts-expect-error Property 'type' does not exist on type 'never'. ts(2339)
+					throw new Error(`Not implemented cache.type ${cache.type}`);
+			}
+		}),
+		context: config.context,
+		dependencies: config.dependencies,
+		devServer: optionalNestedConfig(config.devServer, devServer => ({
+			...devServer
+		})),
+		devtool: config.devtool,
+		entry:
+			config.entry === undefined
+				? { main: {} }
+				: typeof config.entry === "function"
+				? (
+						fn => () =>
+							Promise.resolve().then(fn).then(getNormalizedEntryStatic)
+				  )(config.entry)
+				: getNormalizedEntryStatic(config.entry),
+		experiments: nestedConfig(config.experiments, experiments => ({
+			...experiments,
+			buildHttp: optionalNestedConfig(experiments.buildHttp, options =>
+				Array.isArray(options) ? { allowedUris: options } : options
+			),
+			lazyCompilation: optionalNestedConfig(
+				experiments.lazyCompilation,
+				options =>
+					options === true ? {} : options === false ? undefined : options
+			),
+			css: optionalNestedConfig(experiments.css, options =>
+				options === true ? {} : options === false ? undefined : options
+			)
+		})),
+		externals: config.externals,
+		externalsPresets: cloneObject(config.externalsPresets),
+		externalsType: config.externalsType,
+		ignoreWarnings: config.ignoreWarnings
+			? config.ignoreWarnings.map(ignore => {
+					if (typeof ignore === "function") return ignore;
+					const i = ignore instanceof RegExp ? { message: ignore } : ignore;
+					return (warning, { requestShortener }) => {
+						if (!i.message && !i.module && !i.file) return false;
+						if (i.message && !i.message.test(warning.message)) {
+							return false;
+						}
+						if (
+							i.module &&
+							(!warning.module ||
+								!i.module.test(
+									warning.module.readableIdentifier(requestShortener)
+								))
+						) {
+							return false;
+						}
+						if (i.file && (!warning.file || !i.file.test(warning.file))) {
+							return false;
+						}
+						return true;
+					};
+			  })
+			: undefined,
+		infrastructureLogging: cloneObject(config.infrastructureLogging),
+		loader: cloneObject(config.loader),
+		mode: config.mode,
+		module: nestedConfig(config.module, module => ({
+			noParse: module.noParse,
+			unsafeCache: module.unsafeCache,
+			parser: keyedNestedConfig(module.parser, cloneObject, {
+				javascript: parserOptions => ({
+					unknownContextRequest: module.unknownContextRequest,
+					unknownContextRegExp: module.unknownContextRegExp,
+					unknownContextRecursive: module.unknownContextRecursive,
+					unknownContextCritical: module.unknownContextCritical,
+					exprContextRequest: module.exprContextRequest,
+					exprContextRegExp: module.exprContextRegExp,
+					exprContextRecursive: module.exprContextRecursive,
+					exprContextCritical: module.exprContextCritical,
+					wrappedContextRegExp: module.wrappedContextRegExp,
+					wrappedContextRecursive: module.wrappedContextRecursive,
+					wrappedContextCritical: module.wrappedContextCritical,
+					// TODO webpack 6 remove
+					strictExportPresence: module.strictExportPresence,
+					strictThisContextOnImports: module.strictThisContextOnImports,
+					...parserOptions
+				})
+			}),
+			generator: cloneObject(module.generator),
+			defaultRules: optionalNestedArray(module.defaultRules, r => [...r]),
+			rules: nestedArray(module.rules, r => [...r])
+		})),
+		name: config.name,
+		node: nestedConfig(
+			config.node,
+			node =>
+				node && {
+					...node
+				}
+		),
+		optimization: nestedConfig(config.optimization, optimization => {
+			return {
+				...optimization,
+				runtimeChunk: getNormalizedOptimizationRuntimeChunk(
+					optimization.runtimeChunk
+				),
+				splitChunks: nestedConfig(
+					optimization.splitChunks,
+					splitChunks =>
+						splitChunks && {
+							...splitChunks,
+							defaultSizeTypes: splitChunks.defaultSizeTypes
+								? [...splitChunks.defaultSizeTypes]
+								: ["..."],
+							cacheGroups: cloneObject(splitChunks.cacheGroups)
+						}
+				),
+				emitOnErrors:
+					optimization.noEmitOnErrors !== undefined
+						? handledDeprecatedNoEmitOnErrors(
+								optimization.noEmitOnErrors,
+								optimization.emitOnErrors
+						  )
+						: optimization.emitOnErrors
+			};
+		}),
+		output: nestedConfig(config.output, output => {
+			const { library } = output;
+			const libraryAsName = /** @type {LibraryName} */ (library);
+			const libraryBase =
+				typeof library === "object" &&
+				library &&
+				!Array.isArray(library) &&
+				"type" in library
+					? library
+					: libraryAsName || output.libraryTarget
+					? /** @type {LibraryOptions} */ ({
+							name: libraryAsName
+					  })
+					: undefined;
+			/** @type {OutputNormalized} */
+			const result = {
+				assetModuleFilename: output.assetModuleFilename,
+				asyncChunks: output.asyncChunks,
+				charset: output.charset,
+				chunkFilename: output.chunkFilename,
+				chunkFormat: output.chunkFormat,
+				chunkLoading: output.chunkLoading,
+				chunkLoadingGlobal: output.chunkLoadingGlobal,
+				chunkLoadTimeout: output.chunkLoadTimeout,
+				cssFilename: output.cssFilename,
+				cssChunkFilename: output.cssChunkFilename,
+				clean: output.clean,
+				compareBeforeEmit: output.compareBeforeEmit,
+				crossOriginLoading: output.crossOriginLoading,
+				devtoolFallbackModuleFilenameTemplate:
+					output.devtoolFallbackModuleFilenameTemplate,
+				devtoolModuleFilenameTemplate: output.devtoolModuleFilenameTemplate,
+				devtoolNamespace: output.devtoolNamespace,
+				environment: cloneObject(output.environment),
+				enabledChunkLoadingTypes: output.enabledChunkLoadingTypes
+					? [...output.enabledChunkLoadingTypes]
+					: ["..."],
+				enabledLibraryTypes: output.enabledLibraryTypes
+					? [...output.enabledLibraryTypes]
+					: ["..."],
+				enabledWasmLoadingTypes: output.enabledWasmLoadingTypes
+					? [...output.enabledWasmLoadingTypes]
+					: ["..."],
+				filename: output.filename,
+				globalObject: output.globalObject,
+				hashDigest: output.hashDigest,
+				hashDigestLength: output.hashDigestLength,
+				hashFunction: output.hashFunction,
+				hashSalt: output.hashSalt,
+				hotUpdateChunkFilename: output.hotUpdateChunkFilename,
+				hotUpdateGlobal: output.hotUpdateGlobal,
+				hotUpdateMainFilename: output.hotUpdateMainFilename,
+				iife: output.iife,
+				importFunctionName: output.importFunctionName,
+				importMetaName: output.importMetaName,
+				scriptType: output.scriptType,
+				library: libraryBase && {
+					type:
+						output.libraryTarget !== undefined
+							? output.libraryTarget
+							: libraryBase.type,
+					auxiliaryComment:
+						output.auxiliaryComment !== undefined
+							? output.auxiliaryComment
+							: libraryBase.auxiliaryComment,
+					export:
+						output.libraryExport !== undefined
+							? output.libraryExport
+							: libraryBase.export,
+					name: libraryBase.name,
+					umdNamedDefine:
+						output.umdNamedDefine !== undefined
+							? output.umdNamedDefine
+							: libraryBase.umdNamedDefine
+				},
+				module: output.module,
+				path: output.path,
+				pathinfo: output.pathinfo,
+				publicPath: output.publicPath,
+				sourceMapFilename: output.sourceMapFilename,
+				sourcePrefix: output.sourcePrefix,
+				strictModuleExceptionHandling: output.strictModuleExceptionHandling,
+				trustedTypes: optionalNestedConfig(
+					output.trustedTypes,
+					trustedTypes => {
+						if (trustedTypes === true) return {};
+						if (typeof trustedTypes === "string")
+							return { policyName: trustedTypes };
+						return { ...trustedTypes };
+					}
+				),
+				uniqueName: output.uniqueName,
+				wasmLoading: output.wasmLoading,
+				webassemblyModuleFilename: output.webassemblyModuleFilename,
+				workerChunkLoading: output.workerChunkLoading,
+				workerWasmLoading: output.workerWasmLoading
+			};
+			return result;
+		}),
+		parallelism: config.parallelism,
+		performance: optionalNestedConfig(config.performance, performance => {
+			if (performance === false) return false;
+			return {
+				...performance
+			};
+		}),
+		plugins: nestedArray(config.plugins, p => [...p]),
+		profile: config.profile,
+		recordsInputPath:
+			config.recordsInputPath !== undefined
+				? config.recordsInputPath
+				: config.recordsPath,
+		recordsOutputPath:
+			config.recordsOutputPath !== undefined
+				? config.recordsOutputPath
+				: config.recordsPath,
+		resolve: nestedConfig(config.resolve, resolve => ({
+			...resolve,
+			byDependency: keyedNestedConfig(resolve.byDependency, cloneObject)
+		})),
+		resolveLoader: cloneObject(config.resolveLoader),
+		snapshot: nestedConfig(config.snapshot, snapshot => ({
+			resolveBuildDependencies: optionalNestedConfig(
+				snapshot.resolveBuildDependencies,
+				resolveBuildDependencies => ({
+					timestamp: resolveBuildDependencies.timestamp,
+					hash: resolveBuildDependencies.hash
+				})
+			),
+			buildDependencies: optionalNestedConfig(
+				snapshot.buildDependencies,
+				buildDependencies => ({
+					timestamp: buildDependencies.timestamp,
+					hash: buildDependencies.hash
+				})
+			),
+			resolve: optionalNestedConfig(snapshot.resolve, resolve => ({
+				timestamp: resolve.timestamp,
+				hash: resolve.hash
+			})),
+			module: optionalNestedConfig(snapshot.module, module => ({
+				timestamp: module.timestamp,
+				hash: module.hash
+			})),
+			immutablePaths: optionalNestedArray(snapshot.immutablePaths, p => [...p]),
+			managedPaths: optionalNestedArray(snapshot.managedPaths, p => [...p])
+		})),
+		stats: nestedConfig(config.stats, stats => {
+			if (stats === false) {
+				return {
+					preset: "none"
+				};
+			}
+			if (stats === true) {
+				return {
+					preset: "normal"
+				};
+			}
+			if (typeof stats === "string") {
+				return {
+					preset: stats
+				};
+			}
+			return {
+				...stats
+			};
+		}),
+		target: config.target,
+		watch: config.watch,
+		watchOptions: cloneObject(config.watchOptions)
+	};
+};
+
+/**
+ * @param {EntryStatic} entry static entry options
+ * @returns {EntryStaticNormalized} normalized static entry options
+ */
+const getNormalizedEntryStatic = entry => {
+	if (typeof entry === "string") {
+		return {
+			main: {
+				import: [entry]
+			}
+		};
+	}
+	if (Array.isArray(entry)) {
+		return {
+			main: {
+				import: entry
+			}
+		};
+	}
+	/** @type {EntryStaticNormalized} */
+	const result = {};
+	for (const key of Object.keys(entry)) {
+		const value = entry[key];
+		if (typeof value === "string") {
+			result[key] = {
+				import: [value]
+			};
+		} else if (Array.isArray(value)) {
+			result[key] = {
+				import: value
+			};
+		} else {
+			result[key] = {
+				import:
+					value.import &&
+					(Array.isArray(value.import) ? value.import : [value.import]),
+				filename: value.filename,
+				layer: value.layer,
+				runtime: value.runtime,
+				baseUri: value.baseUri,
+				publicPath: value.publicPath,
+				chunkLoading: value.chunkLoading,
+				asyncChunks: value.asyncChunks,
+				wasmLoading: value.wasmLoading,
+				dependOn:
+					value.dependOn &&
+					(Array.isArray(value.dependOn) ? value.dependOn : [value.dependOn]),
+				library: value.library
+			};
+		}
+	}
+	return result;
+};
+
+/**
+ * @param {OptimizationRuntimeChunk=} runtimeChunk runtimeChunk option
+ * @returns {OptimizationRuntimeChunkNormalized=} normalized runtimeChunk option
+ */
+const getNormalizedOptimizationRuntimeChunk = runtimeChunk => {
+	if (runtimeChunk === undefined) return undefined;
+	if (runtimeChunk === false) return false;
+	if (runtimeChunk === "single") {
+		return {
+			name: () => "runtime"
+		};
+	}
+	if (runtimeChunk === true || runtimeChunk === "multiple") {
+		return {
+			name: entrypoint => `runtime~${entrypoint.name}`
+		};
+	}
+	const { name } = runtimeChunk;
+	return {
+		name: typeof name === "function" ? name : () => name
+	};
+};
+
+exports.getNormalizedWebpackOptions = getNormalizedWebpackOptions;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/config/target.js b/node_modules/mathjs/examples/node_modules/webpack/lib/config/target.js
new file mode 100644
index 0000000..6ae700a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/config/target.js
@@ -0,0 +1,348 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const memoize = require("../util/memoize");
+
+const getBrowserslistTargetHandler = memoize(() =>
+	require("./browserslistTargetHandler")
+);
+
+/**
+ * @param {string} context the context directory
+ * @returns {string} default target
+ */
+const getDefaultTarget = context => {
+	const browsers = getBrowserslistTargetHandler().load(null, context);
+	return browsers ? "browserslist" : "web";
+};
+
+/**
+ * @typedef {Object} PlatformTargetProperties
+ * @property {boolean | null} web web platform, importing of http(s) and std: is available
+ * @property {boolean | null} browser browser platform, running in a normal web browser
+ * @property {boolean | null} webworker (Web)Worker platform, running in a web/shared/service worker
+ * @property {boolean | null} node node platform, require of node built-in modules is available
+ * @property {boolean | null} nwjs nwjs platform, require of legacy nw.gui is available
+ * @property {boolean | null} electron electron platform, require of some electron built-in modules is available
+ */
+
+/**
+ * @typedef {Object} ElectronContextTargetProperties
+ * @property {boolean | null} electronMain in main context
+ * @property {boolean | null} electronPreload in preload context
+ * @property {boolean | null} electronRenderer in renderer context with node integration
+ */
+
+/**
+ * @typedef {Object} ApiTargetProperties
+ * @property {boolean | null} require has require function available
+ * @property {boolean | null} nodeBuiltins has node.js built-in modules available
+ * @property {boolean | null} document has document available (allows script tags)
+ * @property {boolean | null} importScripts has importScripts available
+ * @property {boolean | null} importScriptsInWorker has importScripts available when creating a worker
+ * @property {boolean | null} fetchWasm has fetch function available for WebAssembly
+ * @property {boolean | null} global has global variable available
+ */
+
+/**
+ * @typedef {Object} EcmaTargetProperties
+ * @property {boolean | null} globalThis has globalThis variable available
+ * @property {boolean | null} bigIntLiteral big int literal syntax is available
+ * @property {boolean | null} const const and let variable declarations are available
+ * @property {boolean | null} arrowFunction arrow functions are available
+ * @property {boolean | null} forOf for of iteration is available
+ * @property {boolean | null} destructuring destructuring is available
+ * @property {boolean | null} dynamicImport async import() is available
+ * @property {boolean | null} dynamicImportInWorker async import() is available when creating a worker
+ * @property {boolean | null} module ESM syntax is available (when in module)
+ * @property {boolean | null} optionalChaining optional chaining is available
+ * @property {boolean | null} templateLiteral template literal is available
+ */
+
+///** @typedef {PlatformTargetProperties | ApiTargetProperties | EcmaTargetProperties | PlatformTargetProperties & ApiTargetProperties | PlatformTargetProperties & EcmaTargetProperties | ApiTargetProperties & EcmaTargetProperties} TargetProperties */
+/** @template T @typedef {{ [P in keyof T]?: never }} Never<T> */
+/** @template A @template B @typedef {(A & Never<B>) | (Never<A> & B) | (A & B)} Mix<A,B> */
+/** @typedef {Mix<Mix<PlatformTargetProperties, ElectronContextTargetProperties>, Mix<ApiTargetProperties, EcmaTargetProperties>>} TargetProperties */
+
+const versionDependent = (major, minor) => {
+	if (!major) return () => /** @type {undefined} */ (undefined);
+	major = +major;
+	minor = minor ? +minor : 0;
+	return (vMajor, vMinor = 0) => {
+		return major > vMajor || (major === vMajor && minor >= vMinor);
+	};
+};
+
+/** @type {[string, string, RegExp, (...args: string[]) => TargetProperties | false][]} */
+const TARGETS = [
+	[
+		"browserslist / browserslist:env / browserslist:query / browserslist:path-to-config / browserslist:path-to-config:env",
+		"Resolve features from browserslist. Will resolve browserslist config automatically. Only browser or node queries are supported (electron is not supported). Examples: 'browserslist:modern' to use 'modern' environment from browserslist config",
+		/^browserslist(?::(.+))?$/,
+		(rest, context) => {
+			const browserslistTargetHandler = getBrowserslistTargetHandler();
+			const browsers = browserslistTargetHandler.load(
+				rest ? rest.trim() : null,
+				context
+			);
+			if (!browsers) {
+				throw new Error(`No browserslist config found to handle the 'browserslist' target.
+See https://github.com/browserslist/browserslist#queries for possible ways to provide a config.
+The recommended way is to add a 'browserslist' key to your package.json and list supported browsers (resp. node.js versions).
+You can also more options via the 'target' option: 'browserslist' / 'browserslist:env' / 'browserslist:query' / 'browserslist:path-to-config' / 'browserslist:path-to-config:env'`);
+			}
+			return browserslistTargetHandler.resolve(browsers);
+		}
+	],
+	[
+		"web",
+		"Web browser.",
+		/^web$/,
+		() => {
+			return {
+				web: true,
+				browser: true,
+				webworker: null,
+				node: false,
+				electron: false,
+				nwjs: false,
+
+				document: true,
+				importScriptsInWorker: true,
+				fetchWasm: true,
+				nodeBuiltins: false,
+				importScripts: false,
+				require: false,
+				global: false
+			};
+		}
+	],
+	[
+		"webworker",
+		"Web Worker, SharedWorker or Service Worker.",
+		/^webworker$/,
+		() => {
+			return {
+				web: true,
+				browser: true,
+				webworker: true,
+				node: false,
+				electron: false,
+				nwjs: false,
+
+				importScripts: true,
+				importScriptsInWorker: true,
+				fetchWasm: true,
+				nodeBuiltins: false,
+				require: false,
+				document: false,
+				global: false
+			};
+		}
+	],
+	[
+		"[async-]node[X[.Y]]",
+		"Node.js in version X.Y. The 'async-' prefix will load chunks asynchronously via 'fs' and 'vm' instead of 'require()'. Examples: node14.5, async-node10.",
+		/^(async-)?node(\d+(?:\.(\d+))?)?$/,
+		(asyncFlag, major, minor) => {
+			const v = versionDependent(major, minor);
+			// see https://node.green/
+			return {
+				node: true,
+				electron: false,
+				nwjs: false,
+				web: false,
+				webworker: false,
+				browser: false,
+
+				require: !asyncFlag,
+				nodeBuiltins: true,
+				global: true,
+				document: false,
+				fetchWasm: false,
+				importScripts: false,
+				importScriptsInWorker: false,
+
+				globalThis: v(12),
+				const: v(6),
+				templateLiteral: v(4),
+				optionalChaining: v(14),
+				arrowFunction: v(6),
+				forOf: v(5),
+				destructuring: v(6),
+				bigIntLiteral: v(10, 4),
+				dynamicImport: v(12, 17),
+				dynamicImportInWorker: major ? false : undefined,
+				module: v(12, 17)
+			};
+		}
+	],
+	[
+		"electron[X[.Y]]-main/preload/renderer",
+		"Electron in version X.Y. Script is running in main, preload resp. renderer context.",
+		/^electron(\d+(?:\.(\d+))?)?-(main|preload|renderer)$/,
+		(major, minor, context) => {
+			const v = versionDependent(major, minor);
+			// see https://node.green/ + https://github.com/electron/releases
+			return {
+				node: true,
+				electron: true,
+				web: context !== "main",
+				webworker: false,
+				browser: false,
+				nwjs: false,
+
+				electronMain: context === "main",
+				electronPreload: context === "preload",
+				electronRenderer: context === "renderer",
+
+				global: true,
+				nodeBuiltins: true,
+				require: true,
+				document: context === "renderer",
+				fetchWasm: context === "renderer",
+				importScripts: false,
+				importScriptsInWorker: true,
+
+				globalThis: v(5),
+				const: v(1, 1),
+				templateLiteral: v(1, 1),
+				optionalChaining: v(8),
+				arrowFunction: v(1, 1),
+				forOf: v(0, 36),
+				destructuring: v(1, 1),
+				bigIntLiteral: v(4),
+				dynamicImport: v(11),
+				dynamicImportInWorker: major ? false : undefined,
+				module: v(11)
+			};
+		}
+	],
+	[
+		"nwjs[X[.Y]] / node-webkit[X[.Y]]",
+		"NW.js in version X.Y.",
+		/^(?:nwjs|node-webkit)(\d+(?:\.(\d+))?)?$/,
+		(major, minor) => {
+			const v = versionDependent(major, minor);
+			// see https://node.green/ + https://github.com/nwjs/nw.js/blob/nw48/CHANGELOG.md
+			return {
+				node: true,
+				web: true,
+				nwjs: true,
+				webworker: null,
+				browser: false,
+				electron: false,
+
+				global: true,
+				nodeBuiltins: true,
+				document: false,
+				importScriptsInWorker: false,
+				fetchWasm: false,
+				importScripts: false,
+				require: false,
+
+				globalThis: v(0, 43),
+				const: v(0, 15),
+				templateLiteral: v(0, 13),
+				optionalChaining: v(0, 44),
+				arrowFunction: v(0, 15),
+				forOf: v(0, 13),
+				destructuring: v(0, 15),
+				bigIntLiteral: v(0, 32),
+				dynamicImport: v(0, 43),
+				dynamicImportInWorker: major ? false : undefined,
+				module: v(0, 43)
+			};
+		}
+	],
+	[
+		"esX",
+		"EcmaScript in this version. Examples: es2020, es5.",
+		/^es(\d+)$/,
+		version => {
+			let v = +version;
+			if (v < 1000) v = v + 2009;
+			return {
+				const: v >= 2015,
+				templateLiteral: v >= 2015,
+				optionalChaining: v >= 2020,
+				arrowFunction: v >= 2015,
+				forOf: v >= 2015,
+				destructuring: v >= 2015,
+				module: v >= 2015,
+				globalThis: v >= 2020,
+				bigIntLiteral: v >= 2020,
+				dynamicImport: v >= 2020,
+				dynamicImportInWorker: v >= 2020
+			};
+		}
+	]
+];
+
+/**
+ * @param {string} target the target
+ * @param {string} context the context directory
+ * @returns {TargetProperties} target properties
+ */
+const getTargetProperties = (target, context) => {
+	for (const [, , regExp, handler] of TARGETS) {
+		const match = regExp.exec(target);
+		if (match) {
+			const [, ...args] = match;
+			const result = handler(...args, context);
+			if (result) return result;
+		}
+	}
+	throw new Error(
+		`Unknown target '${target}'. The following targets are supported:\n${TARGETS.map(
+			([name, description]) => `* ${name}: ${description}`
+		).join("\n")}`
+	);
+};
+
+const mergeTargetProperties = targetProperties => {
+	const keys = new Set();
+	for (const tp of targetProperties) {
+		for (const key of Object.keys(tp)) {
+			keys.add(key);
+		}
+	}
+	const result = {};
+	for (const key of keys) {
+		let hasTrue = false;
+		let hasFalse = false;
+		for (const tp of targetProperties) {
+			const value = tp[key];
+			switch (value) {
+				case true:
+					hasTrue = true;
+					break;
+				case false:
+					hasFalse = true;
+					break;
+			}
+		}
+		if (hasTrue || hasFalse)
+			result[key] = hasFalse && hasTrue ? null : hasTrue ? true : false;
+	}
+	return /** @type {TargetProperties} */ (result);
+};
+
+/**
+ * @param {string[]} targets the targets
+ * @param {string} context the context directory
+ * @returns {TargetProperties} target properties
+ */
+const getTargetsProperties = (targets, context) => {
+	return mergeTargetProperties(
+		targets.map(t => getTargetProperties(t, context))
+	);
+};
+
+exports.getDefaultTarget = getDefaultTarget;
+exports.getTargetProperties = getTargetProperties;
+exports.getTargetsProperties = getTargetsProperties;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryDependency.js
new file mode 100644
index 0000000..e8aad08
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryDependency.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra, Zackary Jackson @ScriptedAlchemy, Marais Rossouw @maraisr
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+
+/** @typedef {import("./ContainerEntryModule").ExposeOptions} ExposeOptions */
+
+class ContainerEntryDependency extends Dependency {
+	/**
+	 * @param {string} name entry name
+	 * @param {[string, ExposeOptions][]} exposes list of exposed modules
+	 * @param {string} shareScope name of the share scope
+	 */
+	constructor(name, exposes, shareScope) {
+		super();
+		this.name = name;
+		this.exposes = exposes;
+		this.shareScope = shareScope;
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return `container-entry-${this.name}`;
+	}
+
+	get type() {
+		return "container entry";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	ContainerEntryDependency,
+	"webpack/lib/container/ContainerEntryDependency"
+);
+
+module.exports = ContainerEntryDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryModule.js
new file mode 100644
index 0000000..0de4d58
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryModule.js
@@ -0,0 +1,283 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra, Zackary Jackson @ScriptedAlchemy, Marais Rossouw @maraisr
+*/
+
+"use strict";
+
+const { OriginalSource, RawSource } = require("webpack-sources");
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const Module = require("../Module");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const StaticExportsDependency = require("../dependencies/StaticExportsDependency");
+const makeSerializable = require("../util/makeSerializable");
+const ContainerExposedDependency = require("./ContainerExposedDependency");
+
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("../Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("./ContainerEntryDependency")} ContainerEntryDependency */
+
+/**
+ * @typedef {Object} ExposeOptions
+ * @property {string[]} import requests to exposed modules (last one is exported)
+ * @property {string} name custom chunk name for the exposed module
+ */
+
+const SOURCE_TYPES = new Set(["javascript"]);
+
+class ContainerEntryModule extends Module {
+	/**
+	 * @param {string} name container entry name
+	 * @param {[string, ExposeOptions][]} exposes list of exposed modules
+	 * @param {string} shareScope name of the share scope
+	 */
+	constructor(name, exposes, shareScope) {
+		super("javascript/dynamic", null);
+		this._name = name;
+		this._exposes = exposes;
+		this._shareScope = shareScope;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return SOURCE_TYPES;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return `container entry (${this._shareScope}) ${JSON.stringify(
+			this._exposes
+		)}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return `container entry`;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return `${this.layer ? `(${this.layer})/` : ""}webpack/container/entry/${
+			this._name
+		}`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		return callback(null, !this.buildMeta);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {
+			strict: true,
+			topLevelDeclarations: new Set(["moduleMap", "get", "init"])
+		};
+		this.buildMeta.exportsType = "namespace";
+
+		this.clearDependenciesAndBlocks();
+
+		for (const [name, options] of this._exposes) {
+			const block = new AsyncDependenciesBlock(
+				{
+					name: options.name
+				},
+				{ name },
+				options.import[options.import.length - 1]
+			);
+			let idx = 0;
+			for (const request of options.import) {
+				const dep = new ContainerExposedDependency(name, request);
+				dep.loc = {
+					name,
+					index: idx++
+				};
+
+				block.addDependency(dep);
+			}
+			this.addBlock(block);
+		}
+		this.addDependency(new StaticExportsDependency(["get", "init"], false));
+
+		callback();
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({ moduleGraph, chunkGraph, runtimeTemplate }) {
+		const sources = new Map();
+		const runtimeRequirements = new Set([
+			RuntimeGlobals.definePropertyGetters,
+			RuntimeGlobals.hasOwnProperty,
+			RuntimeGlobals.exports
+		]);
+		const getters = [];
+
+		for (const block of this.blocks) {
+			const { dependencies } = block;
+
+			const modules = dependencies.map(dependency => {
+				const dep = /** @type {ContainerExposedDependency} */ (dependency);
+				return {
+					name: dep.exposedName,
+					module: moduleGraph.getModule(dep),
+					request: dep.userRequest
+				};
+			});
+
+			let str;
+
+			if (modules.some(m => !m.module)) {
+				str = runtimeTemplate.throwMissingModuleErrorBlock({
+					request: modules.map(m => m.request).join(", ")
+				});
+			} else {
+				str = `return ${runtimeTemplate.blockPromise({
+					block,
+					message: "",
+					chunkGraph,
+					runtimeRequirements
+				})}.then(${runtimeTemplate.returningFunction(
+					runtimeTemplate.returningFunction(
+						`(${modules
+							.map(({ module, request }) =>
+								runtimeTemplate.moduleRaw({
+									module,
+									chunkGraph,
+									request,
+									weak: false,
+									runtimeRequirements
+								})
+							)
+							.join(", ")})`
+					)
+				)});`;
+			}
+
+			getters.push(
+				`${JSON.stringify(modules[0].name)}: ${runtimeTemplate.basicFunction(
+					"",
+					str
+				)}`
+			);
+		}
+
+		const source = Template.asString([
+			`var moduleMap = {`,
+			Template.indent(getters.join(",\n")),
+			"};",
+			`var get = ${runtimeTemplate.basicFunction("module, getScope", [
+				`${RuntimeGlobals.currentRemoteGetScope} = getScope;`,
+				// reusing the getScope variable to avoid creating a new var (and module is also used later)
+				"getScope = (",
+				Template.indent([
+					`${RuntimeGlobals.hasOwnProperty}(moduleMap, module)`,
+					Template.indent([
+						"? moduleMap[module]()",
+						`: Promise.resolve().then(${runtimeTemplate.basicFunction(
+							"",
+							"throw new Error('Module \"' + module + '\" does not exist in container.');"
+						)})`
+					])
+				]),
+				");",
+				`${RuntimeGlobals.currentRemoteGetScope} = undefined;`,
+				"return getScope;"
+			])};`,
+			`var init = ${runtimeTemplate.basicFunction("shareScope, initScope", [
+				`if (!${RuntimeGlobals.shareScopeMap}) return;`,
+				`var name = ${JSON.stringify(this._shareScope)}`,
+				`var oldScope = ${RuntimeGlobals.shareScopeMap}[name];`,
+				`if(oldScope && oldScope !== shareScope) throw new Error("Container initialization failed as it has already been initialized with a different share scope");`,
+				`${RuntimeGlobals.shareScopeMap}[name] = shareScope;`,
+				`return ${RuntimeGlobals.initializeSharing}(name, initScope);`
+			])};`,
+			"",
+			"// This exports getters to disallow modifications",
+			`${RuntimeGlobals.definePropertyGetters}(exports, {`,
+			Template.indent([
+				`get: ${runtimeTemplate.returningFunction("get")},`,
+				`init: ${runtimeTemplate.returningFunction("init")}`
+			]),
+			"});"
+		]);
+
+		sources.set(
+			"javascript",
+			this.useSourceMap || this.useSimpleSourceMap
+				? new OriginalSource(source, "webpack/container-entry")
+				: new RawSource(source)
+		);
+
+		return {
+			sources,
+			runtimeRequirements
+		};
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 42;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this._name);
+		write(this._exposes);
+		write(this._shareScope);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const { read } = context;
+		const obj = new ContainerEntryModule(read(), read(), read());
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(
+	ContainerEntryModule,
+	"webpack/lib/container/ContainerEntryModule"
+);
+
+module.exports = ContainerEntryModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryModuleFactory.js
new file mode 100644
index 0000000..1a1a7af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerEntryModuleFactory.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra, Zackary Jackson @ScriptedAlchemy, Marais Rossouw @maraisr
+*/
+
+"use strict";
+
+const ModuleFactory = require("../ModuleFactory");
+const ContainerEntryModule = require("./ContainerEntryModule");
+
+/** @typedef {import("../ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("../ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./ContainerEntryDependency")} ContainerEntryDependency */
+
+module.exports = class ContainerEntryModuleFactory extends ModuleFactory {
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create({ dependencies: [dependency] }, callback) {
+		const dep = /** @type {ContainerEntryDependency} */ (dependency);
+		callback(null, {
+			module: new ContainerEntryModule(dep.name, dep.exposes, dep.shareScope)
+		});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerExposedDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerExposedDependency.js
new file mode 100644
index 0000000..02b9eef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerExposedDependency.js
@@ -0,0 +1,52 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra, Zackary Jackson @ScriptedAlchemy, Marais Rossouw @maraisr
+*/
+
+"use strict";
+
+const ModuleDependency = require("../dependencies/ModuleDependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class ContainerExposedDependency extends ModuleDependency {
+	/**
+	 * @param {string} exposedName public name
+	 * @param {string} request request to module
+	 */
+	constructor(exposedName, request) {
+		super(request);
+		this.exposedName = exposedName;
+	}
+
+	get type() {
+		return "container exposed";
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return `exposed dependency ${this.exposedName}=${this.request}`;
+	}
+
+	serialize(context) {
+		context.write(this.exposedName);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		this.exposedName = context.read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	ContainerExposedDependency,
+	"webpack/lib/container/ContainerExposedDependency"
+);
+
+module.exports = ContainerExposedDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerPlugin.js
new file mode 100644
index 0000000..528fad6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerPlugin.js
@@ -0,0 +1,105 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra, Zackary Jackson @ScriptedAlchemy, Marais Rossouw @maraisr
+*/
+
+"use strict";
+
+const createSchemaValidation = require("../util/create-schema-validation");
+const ContainerEntryDependency = require("./ContainerEntryDependency");
+const ContainerEntryModuleFactory = require("./ContainerEntryModuleFactory");
+const ContainerExposedDependency = require("./ContainerExposedDependency");
+const { parseOptions } = require("./options");
+
+/** @typedef {import("../../declarations/plugins/container/ContainerPlugin").ContainerPluginOptions} ContainerPluginOptions */
+/** @typedef {import("../Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/container/ContainerPlugin.check.js"),
+	() => require("../../schemas/plugins/container/ContainerPlugin.json"),
+	{
+		name: "Container Plugin",
+		baseDataPath: "options"
+	}
+);
+
+const PLUGIN_NAME = "ContainerPlugin";
+
+class ContainerPlugin {
+	/**
+	 * @param {ContainerPluginOptions} options options
+	 */
+	constructor(options) {
+		validate(options);
+
+		this._options = {
+			name: options.name,
+			shareScope: options.shareScope || "default",
+			library: options.library || {
+				type: "var",
+				name: options.name
+			},
+			runtime: options.runtime,
+			filename: options.filename || undefined,
+			exposes: parseOptions(
+				options.exposes,
+				item => ({
+					import: Array.isArray(item) ? item : [item],
+					name: undefined
+				}),
+				item => ({
+					import: Array.isArray(item.import) ? item.import : [item.import],
+					name: item.name || undefined
+				})
+			)
+		};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { name, exposes, shareScope, filename, library, runtime } =
+			this._options;
+
+		compiler.options.output.enabledLibraryTypes.push(library.type);
+
+		compiler.hooks.make.tapAsync(PLUGIN_NAME, (compilation, callback) => {
+			const dep = new ContainerEntryDependency(name, exposes, shareScope);
+			dep.loc = { name };
+			compilation.addEntry(
+				compilation.options.context,
+				dep,
+				{
+					name,
+					filename,
+					runtime,
+					library
+				},
+				error => {
+					if (error) return callback(error);
+					callback();
+				}
+			);
+		});
+
+		compiler.hooks.thisCompilation.tap(
+			PLUGIN_NAME,
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					ContainerEntryDependency,
+					new ContainerEntryModuleFactory()
+				);
+
+				compilation.dependencyFactories.set(
+					ContainerExposedDependency,
+					normalModuleFactory
+				);
+			}
+		);
+	}
+}
+
+module.exports = ContainerPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerReferencePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerReferencePlugin.js
new file mode 100644
index 0000000..f860fba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ContainerReferencePlugin.js
@@ -0,0 +1,142 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const ExternalsPlugin = require("../ExternalsPlugin");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const createSchemaValidation = require("../util/create-schema-validation");
+const FallbackDependency = require("./FallbackDependency");
+const FallbackItemDependency = require("./FallbackItemDependency");
+const FallbackModuleFactory = require("./FallbackModuleFactory");
+const RemoteModule = require("./RemoteModule");
+const RemoteRuntimeModule = require("./RemoteRuntimeModule");
+const RemoteToExternalDependency = require("./RemoteToExternalDependency");
+const { parseOptions } = require("./options");
+
+/** @typedef {import("../../declarations/plugins/container/ContainerReferencePlugin").ContainerReferencePluginOptions} ContainerReferencePluginOptions */
+/** @typedef {import("../../declarations/plugins/container/ContainerReferencePlugin").RemotesConfig} RemotesConfig */
+/** @typedef {import("../Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/container/ContainerReferencePlugin.check.js"),
+	() =>
+		require("../../schemas/plugins/container/ContainerReferencePlugin.json"),
+	{
+		name: "Container Reference Plugin",
+		baseDataPath: "options"
+	}
+);
+
+const slashCode = "/".charCodeAt(0);
+
+class ContainerReferencePlugin {
+	/**
+	 * @param {ContainerReferencePluginOptions} options options
+	 */
+	constructor(options) {
+		validate(options);
+
+		this._remoteType = options.remoteType;
+		this._remotes = parseOptions(
+			options.remotes,
+			item => ({
+				external: Array.isArray(item) ? item : [item],
+				shareScope: options.shareScope || "default"
+			}),
+			item => ({
+				external: Array.isArray(item.external)
+					? item.external
+					: [item.external],
+				shareScope: item.shareScope || options.shareScope || "default"
+			})
+		);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { _remotes: remotes, _remoteType: remoteType } = this;
+
+		/** @type {Record<string, string>} */
+		const remoteExternals = {};
+		for (const [key, config] of remotes) {
+			let i = 0;
+			for (const external of config.external) {
+				if (external.startsWith("internal ")) continue;
+				remoteExternals[
+					`webpack/container/reference/${key}${i ? `/fallback-${i}` : ""}`
+				] = external;
+				i++;
+			}
+		}
+
+		new ExternalsPlugin(remoteType, remoteExternals).apply(compiler);
+
+		compiler.hooks.compilation.tap(
+			"ContainerReferencePlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					RemoteToExternalDependency,
+					normalModuleFactory
+				);
+
+				compilation.dependencyFactories.set(
+					FallbackItemDependency,
+					normalModuleFactory
+				);
+
+				compilation.dependencyFactories.set(
+					FallbackDependency,
+					new FallbackModuleFactory()
+				);
+
+				normalModuleFactory.hooks.factorize.tap(
+					"ContainerReferencePlugin",
+					data => {
+						if (!data.request.includes("!")) {
+							for (const [key, config] of remotes) {
+								if (
+									data.request.startsWith(`${key}`) &&
+									(data.request.length === key.length ||
+										data.request.charCodeAt(key.length) === slashCode)
+								) {
+									return new RemoteModule(
+										data.request,
+										config.external.map((external, i) =>
+											external.startsWith("internal ")
+												? external.slice(9)
+												: `webpack/container/reference/${key}${
+														i ? `/fallback-${i}` : ""
+												  }`
+										),
+										`.${data.request.slice(key.length)}`,
+										config.shareScope
+									);
+								}
+							}
+						}
+					}
+				);
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("ContainerReferencePlugin", (chunk, set) => {
+						set.add(RuntimeGlobals.module);
+						set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+						set.add(RuntimeGlobals.hasOwnProperty);
+						set.add(RuntimeGlobals.initializeSharing);
+						set.add(RuntimeGlobals.shareScopeMap);
+						compilation.addRuntimeModule(chunk, new RemoteRuntimeModule());
+					});
+			}
+		);
+	}
+}
+
+module.exports = ContainerReferencePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackDependency.js
new file mode 100644
index 0000000..dee28ab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackDependency.js
@@ -0,0 +1,51 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class FallbackDependency extends Dependency {
+	constructor(requests) {
+		super();
+		this.requests = requests;
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return `fallback ${this.requests.join(" ")}`;
+	}
+
+	get type() {
+		return "fallback";
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.requests);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const { read } = context;
+		const obj = new FallbackDependency(read());
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(
+	FallbackDependency,
+	"webpack/lib/container/FallbackDependency"
+);
+
+module.exports = FallbackDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackItemDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackItemDependency.js
new file mode 100644
index 0000000..3995a9e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackItemDependency.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("../dependencies/ModuleDependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class FallbackItemDependency extends ModuleDependency {
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "fallback item";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	FallbackItemDependency,
+	"webpack/lib/container/FallbackItemDependency"
+);
+
+module.exports = FallbackItemDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackModule.js
new file mode 100644
index 0000000..572f681
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackModule.js
@@ -0,0 +1,173 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const Module = require("../Module");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const makeSerializable = require("../util/makeSerializable");
+const FallbackItemDependency = require("./FallbackItemDependency");
+
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("../Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["javascript"]);
+const RUNTIME_REQUIREMENTS = new Set([RuntimeGlobals.module]);
+
+class FallbackModule extends Module {
+	/**
+	 * @param {string[]} requests list of requests to choose one
+	 */
+	constructor(requests) {
+		super("fallback-module");
+		this.requests = requests;
+		this._identifier = `fallback ${this.requests.join(" ")}`;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return this._identifier;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return this._identifier;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return `${this.layer ? `(${this.layer})/` : ""}webpack/container/fallback/${
+			this.requests[0]
+		}/and ${this.requests.length - 1} more`;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk which condition should be checked
+	 * @param {Compilation} compilation the compilation
+	 * @returns {boolean} true, if the chunk is ok for the module
+	 */
+	chunkCondition(chunk, { chunkGraph }) {
+		return chunkGraph.getNumberOfEntryModules(chunk) > 0;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		callback(null, !this.buildInfo);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {
+			strict: true
+		};
+
+		this.clearDependenciesAndBlocks();
+		for (const request of this.requests)
+			this.addDependency(new FallbackItemDependency(request));
+
+		callback();
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return this.requests.length * 5 + 42;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({ runtimeTemplate, moduleGraph, chunkGraph }) {
+		const ids = this.dependencies.map(dep =>
+			chunkGraph.getModuleId(moduleGraph.getModule(dep))
+		);
+		const code = Template.asString([
+			`var ids = ${JSON.stringify(ids)};`,
+			"var error, result, i = 0;",
+			`var loop = ${runtimeTemplate.basicFunction("next", [
+				"while(i < ids.length) {",
+				Template.indent([
+					"try { next = __webpack_require__(ids[i++]); } catch(e) { return handleError(e); }",
+					"if(next) return next.then ? next.then(handleResult, handleError) : handleResult(next);"
+				]),
+				"}",
+				"if(error) throw error;"
+			])}`,
+			`var handleResult = ${runtimeTemplate.basicFunction("result", [
+				"if(result) return result;",
+				"return loop();"
+			])};`,
+			`var handleError = ${runtimeTemplate.basicFunction("e", [
+				"error = e;",
+				"return loop();"
+			])};`,
+			"module.exports = loop();"
+		]);
+		const sources = new Map();
+		sources.set("javascript", new RawSource(code));
+		return { sources, runtimeRequirements: RUNTIME_REQUIREMENTS };
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.requests);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const { read } = context;
+		const obj = new FallbackModule(read());
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(FallbackModule, "webpack/lib/container/FallbackModule");
+
+module.exports = FallbackModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackModuleFactory.js
new file mode 100644
index 0000000..350e910
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/FallbackModuleFactory.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra, Zackary Jackson @ScriptedAlchemy, Marais Rossouw @maraisr
+*/
+
+"use strict";
+
+const ModuleFactory = require("../ModuleFactory");
+const FallbackModule = require("./FallbackModule");
+
+/** @typedef {import("../ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("../ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./FallbackDependency")} FallbackDependency */
+
+module.exports = class FallbackModuleFactory extends ModuleFactory {
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create({ dependencies: [dependency] }, callback) {
+		const dep = /** @type {FallbackDependency} */ (dependency);
+		callback(null, {
+			module: new FallbackModule(dep.requests)
+		});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/ModuleFederationPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ModuleFederationPlugin.js
new file mode 100644
index 0000000..daece3f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/ModuleFederationPlugin.js
@@ -0,0 +1,92 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const isValidExternalsType = require("../../schemas/plugins/container/ExternalsType.check.js");
+const SharePlugin = require("../sharing/SharePlugin");
+const createSchemaValidation = require("../util/create-schema-validation");
+const ContainerPlugin = require("./ContainerPlugin");
+const ContainerReferencePlugin = require("./ContainerReferencePlugin");
+
+/** @typedef {import("../../declarations/plugins/container/ModuleFederationPlugin").ExternalsType} ExternalsType */
+/** @typedef {import("../../declarations/plugins/container/ModuleFederationPlugin").ModuleFederationPluginOptions} ModuleFederationPluginOptions */
+/** @typedef {import("../../declarations/plugins/container/ModuleFederationPlugin").Shared} Shared */
+/** @typedef {import("../Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/container/ModuleFederationPlugin.check.js"),
+	() => require("../../schemas/plugins/container/ModuleFederationPlugin.json"),
+	{
+		name: "Module Federation Plugin",
+		baseDataPath: "options"
+	}
+);
+class ModuleFederationPlugin {
+	/**
+	 * @param {ModuleFederationPluginOptions} options options
+	 */
+	constructor(options) {
+		validate(options);
+
+		this._options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { _options: options } = this;
+		const library = options.library || { type: "var", name: options.name };
+		const remoteType =
+			options.remoteType ||
+			(options.library && isValidExternalsType(options.library.type)
+				? /** @type {ExternalsType} */ (options.library.type)
+				: "script");
+		if (
+			library &&
+			!compiler.options.output.enabledLibraryTypes.includes(library.type)
+		) {
+			compiler.options.output.enabledLibraryTypes.push(library.type);
+		}
+		compiler.hooks.afterPlugins.tap("ModuleFederationPlugin", () => {
+			if (
+				options.exposes &&
+				(Array.isArray(options.exposes)
+					? options.exposes.length > 0
+					: Object.keys(options.exposes).length > 0)
+			) {
+				new ContainerPlugin({
+					name: options.name,
+					library,
+					filename: options.filename,
+					runtime: options.runtime,
+					exposes: options.exposes
+				}).apply(compiler);
+			}
+			if (
+				options.remotes &&
+				(Array.isArray(options.remotes)
+					? options.remotes.length > 0
+					: Object.keys(options.remotes).length > 0)
+			) {
+				new ContainerReferencePlugin({
+					remoteType,
+					remotes: options.remotes
+				}).apply(compiler);
+			}
+			if (options.shared) {
+				new SharePlugin({
+					shared: options.shared,
+					shareScope: options.shareScope
+				}).apply(compiler);
+			}
+		});
+	}
+}
+
+module.exports = ModuleFederationPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteModule.js
new file mode 100644
index 0000000..0c399cc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteModule.js
@@ -0,0 +1,171 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const Module = require("../Module");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const FallbackDependency = require("./FallbackDependency");
+const RemoteToExternalDependency = require("./RemoteToExternalDependency");
+
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("../Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["remote", "share-init"]);
+const RUNTIME_REQUIREMENTS = new Set([RuntimeGlobals.module]);
+
+class RemoteModule extends Module {
+	/**
+	 * @param {string} request request string
+	 * @param {string[]} externalRequests list of external requests to containers
+	 * @param {string} internalRequest name of exposed module in container
+	 * @param {string} shareScope the used share scope name
+	 */
+	constructor(request, externalRequests, internalRequest, shareScope) {
+		super("remote-module");
+		this.request = request;
+		this.externalRequests = externalRequests;
+		this.internalRequest = internalRequest;
+		this.shareScope = shareScope;
+		this._identifier = `remote (${shareScope}) ${this.externalRequests.join(
+			" "
+		)} ${this.internalRequest}`;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return this._identifier;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return `remote ${this.request}`;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return `${this.layer ? `(${this.layer})/` : ""}webpack/container/remote/${
+			this.request
+		}`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		callback(null, !this.buildInfo);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {
+			strict: true
+		};
+
+		this.clearDependenciesAndBlocks();
+		if (this.externalRequests.length === 1) {
+			this.addDependency(
+				new RemoteToExternalDependency(this.externalRequests[0])
+			);
+		} else {
+			this.addDependency(new FallbackDependency(this.externalRequests));
+		}
+
+		callback();
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 6;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @returns {string | null} absolute path which should be used for condition matching (usually the resource path)
+	 */
+	nameForCondition() {
+		return this.request;
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({ runtimeTemplate, moduleGraph, chunkGraph }) {
+		const module = moduleGraph.getModule(this.dependencies[0]);
+		const id = module && chunkGraph.getModuleId(module);
+		const sources = new Map();
+		sources.set("remote", new RawSource(""));
+		const data = new Map();
+		data.set("share-init", [
+			{
+				shareScope: this.shareScope,
+				initStage: 20,
+				init: id === undefined ? "" : `initExternal(${JSON.stringify(id)});`
+			}
+		]);
+		return { sources, data, runtimeRequirements: RUNTIME_REQUIREMENTS };
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.request);
+		write(this.externalRequests);
+		write(this.internalRequest);
+		write(this.shareScope);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const { read } = context;
+		const obj = new RemoteModule(read(), read(), read(), read());
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(RemoteModule, "webpack/lib/container/RemoteModule");
+
+module.exports = RemoteModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteRuntimeModule.js
new file mode 100644
index 0000000..90948f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteRuntimeModule.js
@@ -0,0 +1,128 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+/** @typedef {import("./RemoteModule")} RemoteModule */
+
+class RemoteRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("remotes loading");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation, chunkGraph } = this;
+		const { runtimeTemplate, moduleGraph } = compilation;
+		const chunkToRemotesMapping = {};
+		const idToExternalAndNameMapping = {};
+		for (const chunk of this.chunk.getAllAsyncChunks()) {
+			const modules = chunkGraph.getChunkModulesIterableBySourceType(
+				chunk,
+				"remote"
+			);
+			if (!modules) continue;
+			const remotes = (chunkToRemotesMapping[chunk.id] = []);
+			for (const m of modules) {
+				const module = /** @type {RemoteModule} */ (m);
+				const name = module.internalRequest;
+				const id = chunkGraph.getModuleId(module);
+				const shareScope = module.shareScope;
+				const dep = module.dependencies[0];
+				const externalModule = moduleGraph.getModule(dep);
+				const externalModuleId =
+					externalModule && chunkGraph.getModuleId(externalModule);
+				remotes.push(id);
+				idToExternalAndNameMapping[id] = [shareScope, name, externalModuleId];
+			}
+		}
+		return Template.asString([
+			`var chunkMapping = ${JSON.stringify(
+				chunkToRemotesMapping,
+				null,
+				"\t"
+			)};`,
+			`var idToExternalAndNameMapping = ${JSON.stringify(
+				idToExternalAndNameMapping,
+				null,
+				"\t"
+			)};`,
+			`${
+				RuntimeGlobals.ensureChunkHandlers
+			}.remotes = ${runtimeTemplate.basicFunction("chunkId, promises", [
+				`if(${RuntimeGlobals.hasOwnProperty}(chunkMapping, chunkId)) {`,
+				Template.indent([
+					`chunkMapping[chunkId].forEach(${runtimeTemplate.basicFunction("id", [
+						`var getScope = ${RuntimeGlobals.currentRemoteGetScope};`,
+						"if(!getScope) getScope = [];",
+						"var data = idToExternalAndNameMapping[id];",
+						"if(getScope.indexOf(data) >= 0) return;",
+						"getScope.push(data);",
+						`if(data.p) return promises.push(data.p);`,
+						`var onError = ${runtimeTemplate.basicFunction("error", [
+							'if(!error) error = new Error("Container missing");',
+							'if(typeof error.message === "string")',
+							Template.indent(
+								`error.message += '\\nwhile loading "' + data[1] + '" from ' + data[2];`
+							),
+							`__webpack_modules__[id] = ${runtimeTemplate.basicFunction("", [
+								"throw error;"
+							])}`,
+							"data.p = 0;"
+						])};`,
+						`var handleFunction = ${runtimeTemplate.basicFunction(
+							"fn, arg1, arg2, d, next, first",
+							[
+								"try {",
+								Template.indent([
+									"var promise = fn(arg1, arg2);",
+									"if(promise && promise.then) {",
+									Template.indent([
+										`var p = promise.then(${runtimeTemplate.returningFunction(
+											"next(result, d)",
+											"result"
+										)}, onError);`,
+										`if(first) promises.push(data.p = p); else return p;`
+									]),
+									"} else {",
+									Template.indent(["return next(promise, d, first);"]),
+									"}"
+								]),
+								"} catch(error) {",
+								Template.indent(["onError(error);"]),
+								"}"
+							]
+						)}`,
+						`var onExternal = ${runtimeTemplate.returningFunction(
+							`external ? handleFunction(${RuntimeGlobals.initializeSharing}, data[0], 0, external, onInitialized, first) : onError()`,
+							"external, _, first"
+						)};`,
+						`var onInitialized = ${runtimeTemplate.returningFunction(
+							`handleFunction(external.get, data[1], getScope, 0, onFactory, first)`,
+							"_, external, first"
+						)};`,
+						`var onFactory = ${runtimeTemplate.basicFunction("factory", [
+							"data.p = 1;",
+							`__webpack_modules__[id] = ${runtimeTemplate.basicFunction(
+								"module",
+								["module.exports = factory();"]
+							)}`
+						])};`,
+						"handleFunction(__webpack_require__, data[2], 0, 0, onExternal, 1);"
+					])});`
+				]),
+				"}"
+			])}`
+		]);
+	}
+}
+
+module.exports = RemoteRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteToExternalDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteToExternalDependency.js
new file mode 100644
index 0000000..28a52f7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/RemoteToExternalDependency.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("../dependencies/ModuleDependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class RemoteToExternalDependency extends ModuleDependency {
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "remote to external";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	RemoteToExternalDependency,
+	"webpack/lib/container/RemoteToExternalDependency"
+);
+
+module.exports = RemoteToExternalDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/container/options.js b/node_modules/mathjs/examples/node_modules/webpack/lib/container/options.js
new file mode 100644
index 0000000..8cd9698
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/container/options.js
@@ -0,0 +1,91 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @template T @typedef {(string | Record<string, string | string[] | T>)[] | Record<string, string | string[] | T>} ContainerOptionsFormat */
+
+/**
+ * @template T
+ * @template N
+ * @param {ContainerOptionsFormat<T>} options options passed by the user
+ * @param {function(string | string[], string) : N} normalizeSimple normalize a simple item
+ * @param {function(T, string) : N} normalizeOptions normalize a complex item
+ * @param {function(string, N): void} fn processing function
+ * @returns {void}
+ */
+const process = (options, normalizeSimple, normalizeOptions, fn) => {
+	const array = items => {
+		for (const item of items) {
+			if (typeof item === "string") {
+				fn(item, normalizeSimple(item, item));
+			} else if (item && typeof item === "object") {
+				object(item);
+			} else {
+				throw new Error("Unexpected options format");
+			}
+		}
+	};
+	const object = obj => {
+		for (const [key, value] of Object.entries(obj)) {
+			if (typeof value === "string" || Array.isArray(value)) {
+				fn(key, normalizeSimple(value, key));
+			} else {
+				fn(key, normalizeOptions(value, key));
+			}
+		}
+	};
+	if (!options) {
+		return;
+	} else if (Array.isArray(options)) {
+		array(options);
+	} else if (typeof options === "object") {
+		object(options);
+	} else {
+		throw new Error("Unexpected options format");
+	}
+};
+
+/**
+ * @template T
+ * @template R
+ * @param {ContainerOptionsFormat<T>} options options passed by the user
+ * @param {function(string | string[], string) : R} normalizeSimple normalize a simple item
+ * @param {function(T, string) : R} normalizeOptions normalize a complex item
+ * @returns {[string, R][]} parsed options
+ */
+const parseOptions = (options, normalizeSimple, normalizeOptions) => {
+	/** @type {[string, R][]} */
+	const items = [];
+	process(options, normalizeSimple, normalizeOptions, (key, value) => {
+		items.push([key, value]);
+	});
+	return items;
+};
+
+/**
+ * @template T
+ * @param {string} scope scope name
+ * @param {ContainerOptionsFormat<T>} options options passed by the user
+ * @returns {Record<string, string | string[] | T>} options to spread or pass
+ */
+const scope = (scope, options) => {
+	/** @type {Record<string, string | string[] | T>} */
+	const obj = {};
+	process(
+		options,
+		item => /** @type {string | string[] | T} */ (item),
+		item => /** @type {string | string[] | T} */ (item),
+		(key, value) => {
+			obj[
+				key.startsWith("./") ? `${scope}${key.slice(1)}` : `${scope}/${key}`
+			] = value;
+		}
+	);
+	return obj;
+};
+
+exports.parseOptions = parseOptions;
+exports.scope = scope;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssExportsGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssExportsGenerator.js
new file mode 100644
index 0000000..652750a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssExportsGenerator.js
@@ -0,0 +1,139 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const { ReplaceSource, RawSource, ConcatSource } = require("webpack-sources");
+const { UsageState } = require("../ExportsInfo");
+const Generator = require("../Generator");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../Generator").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../Module").ConcatenationBailoutReasonContext} ConcatenationBailoutReasonContext */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../util/Hash")} Hash */
+
+const TYPES = new Set(["javascript"]);
+
+class CssExportsGenerator extends Generator {
+	constructor() {
+		super();
+	}
+
+	// TODO add getConcatenationBailoutReason to allow concatenation
+	// but how to make it have a module id
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, generateContext) {
+		const source = new ReplaceSource(new RawSource(""));
+		const initFragments = [];
+		const cssExports = new Map();
+
+		generateContext.runtimeRequirements.add(RuntimeGlobals.module);
+
+		const runtimeRequirements = new Set();
+
+		const templateContext = {
+			runtimeTemplate: generateContext.runtimeTemplate,
+			dependencyTemplates: generateContext.dependencyTemplates,
+			moduleGraph: generateContext.moduleGraph,
+			chunkGraph: generateContext.chunkGraph,
+			module,
+			runtime: generateContext.runtime,
+			runtimeRequirements: runtimeRequirements,
+			concatenationScope: generateContext.concatenationScope,
+			codeGenerationResults: generateContext.codeGenerationResults,
+			initFragments,
+			cssExports
+		};
+
+		const handleDependency = dependency => {
+			const constructor = /** @type {new (...args: any[]) => Dependency} */ (
+				dependency.constructor
+			);
+			const template = generateContext.dependencyTemplates.get(constructor);
+			if (!template) {
+				throw new Error(
+					"No template for dependency: " + dependency.constructor.name
+				);
+			}
+
+			template.apply(dependency, source, templateContext);
+		};
+		module.dependencies.forEach(handleDependency);
+
+		if (generateContext.concatenationScope) {
+			const source = new ConcatSource();
+			const usedIdentifiers = new Set();
+			for (const [k, v] of cssExports) {
+				let identifier = Template.toIdentifier(k);
+				let i = 0;
+				while (usedIdentifiers.has(identifier)) {
+					identifier = Template.toIdentifier(k + i);
+				}
+				usedIdentifiers.add(identifier);
+				generateContext.concatenationScope.registerExport(k, identifier);
+				source.add(
+					`${
+						generateContext.runtimeTemplate.supportsConst ? "const" : "var"
+					} ${identifier} = ${JSON.stringify(v)};\n`
+				);
+			}
+			return source;
+		} else {
+			const otherUsed =
+				generateContext.moduleGraph
+					.getExportsInfo(module)
+					.otherExportsInfo.getUsed(generateContext.runtime) !==
+				UsageState.Unused;
+			if (otherUsed) {
+				generateContext.runtimeRequirements.add(
+					RuntimeGlobals.makeNamespaceObject
+				);
+			}
+			return new RawSource(
+				`${otherUsed ? `${RuntimeGlobals.makeNamespaceObject}(` : ""}${
+					module.moduleArgument
+				}.exports = {\n${Array.from(
+					cssExports,
+					([k, v]) => `\t${JSON.stringify(k)}: ${JSON.stringify(v)}`
+				).join(",\n")}\n}${otherUsed ? ")" : ""};`
+			);
+		}
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		return 42;
+	}
+
+	/**
+	 * @param {Hash} hash hash that will be modified
+	 * @param {UpdateHashContext} updateHashContext context for updating hash
+	 */
+	updateHash(hash, { module }) {}
+}
+
+module.exports = CssExportsGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssGenerator.js
new file mode 100644
index 0000000..d524149
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssGenerator.js
@@ -0,0 +1,109 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const { ReplaceSource } = require("webpack-sources");
+const Generator = require("../Generator");
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../Generator").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../util/Hash")} Hash */
+
+const TYPES = new Set(["css"]);
+
+class CssGenerator extends Generator {
+	constructor() {
+		super();
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, generateContext) {
+		const originalSource = module.originalSource();
+		const source = new ReplaceSource(originalSource);
+		const initFragments = [];
+		const cssExports = new Map();
+
+		generateContext.runtimeRequirements.add(RuntimeGlobals.hasCssModules);
+
+		const templateContext = {
+			runtimeTemplate: generateContext.runtimeTemplate,
+			dependencyTemplates: generateContext.dependencyTemplates,
+			moduleGraph: generateContext.moduleGraph,
+			chunkGraph: generateContext.chunkGraph,
+			module,
+			runtime: generateContext.runtime,
+			runtimeRequirements: generateContext.runtimeRequirements,
+			concatenationScope: generateContext.concatenationScope,
+			codeGenerationResults: generateContext.codeGenerationResults,
+			initFragments,
+			cssExports
+		};
+
+		const handleDependency = dependency => {
+			const constructor = /** @type {new (...args: any[]) => Dependency} */ (
+				dependency.constructor
+			);
+			const template = generateContext.dependencyTemplates.get(constructor);
+			if (!template) {
+				throw new Error(
+					"No template for dependency: " + dependency.constructor.name
+				);
+			}
+
+			template.apply(dependency, source, templateContext);
+		};
+		module.dependencies.forEach(handleDependency);
+		if (module.presentationalDependencies !== undefined)
+			module.presentationalDependencies.forEach(handleDependency);
+
+		if (cssExports.size > 0) {
+			const data = generateContext.getData();
+			data.set("css-exports", cssExports);
+		}
+
+		return InitFragment.addToSource(source, initFragments, generateContext);
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		const originalSource = module.originalSource();
+
+		if (!originalSource) {
+			return 0;
+		}
+
+		return originalSource.size();
+	}
+
+	/**
+	 * @param {Hash} hash hash that will be modified
+	 * @param {UpdateHashContext} updateHashContext context for updating hash
+	 */
+	updateHash(hash, { module }) {}
+}
+
+module.exports = CssGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssLoadingRuntimeModule.js
new file mode 100644
index 0000000..670c0b9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssLoadingRuntimeModule.js
@@ -0,0 +1,440 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncWaterfallHook } = require("tapable");
+const Compilation = require("../Compilation");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const compileBooleanMatcher = require("../util/compileBooleanMatcher");
+const { chunkHasCss } = require("./CssModulesPlugin");
+
+/** @typedef {import("../Chunk")} Chunk */
+
+/**
+ * @typedef {Object} JsonpCompilationPluginHooks
+ * @property {SyncWaterfallHook<[string, Chunk]>} createStylesheet
+ */
+
+/** @type {WeakMap<Compilation, JsonpCompilationPluginHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class CssLoadingRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {JsonpCompilationPluginHooks} hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				createStylesheet: new SyncWaterfallHook(["source", "chunk"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	constructor(runtimeRequirements, runtimeOptions) {
+		super("css loading", 10);
+
+		this._runtimeRequirements = runtimeRequirements;
+		this.runtimeOptions = runtimeOptions;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation, chunk, _runtimeRequirements } = this;
+		const {
+			chunkGraph,
+			runtimeTemplate,
+			outputOptions: {
+				crossOriginLoading,
+				uniqueName,
+				chunkLoadTimeout: loadTimeout
+			}
+		} = compilation;
+		const fn = RuntimeGlobals.ensureChunkHandlers;
+		const conditionMap = chunkGraph.getChunkConditionMap(
+			chunk,
+			(chunk, chunkGraph) =>
+				!!chunkGraph.getChunkModulesIterableBySourceType(chunk, "css")
+		);
+		const hasCssMatcher = compileBooleanMatcher(conditionMap);
+
+		const withLoading =
+			_runtimeRequirements.has(RuntimeGlobals.ensureChunkHandlers) &&
+			hasCssMatcher !== false;
+		const withHmr = _runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadUpdateHandlers
+		);
+		const initialChunkIdsWithCss = new Set();
+		const initialChunkIdsWithoutCss = new Set();
+		for (const c of chunk.getAllInitialChunks()) {
+			(chunkHasCss(c, chunkGraph)
+				? initialChunkIdsWithCss
+				: initialChunkIdsWithoutCss
+			).add(c.id);
+		}
+
+		if (!withLoading && !withHmr && initialChunkIdsWithCss.size === 0) {
+			return null;
+		}
+
+		const { createStylesheet } =
+			CssLoadingRuntimeModule.getCompilationHooks(compilation);
+
+		const stateExpression = withHmr
+			? `${RuntimeGlobals.hmrRuntimeStatePrefix}_css`
+			: undefined;
+
+		const code = Template.asString([
+			"link = document.createElement('link');",
+			uniqueName
+				? 'link.setAttribute("data-webpack", uniqueName + ":" + key);'
+				: "",
+			"link.setAttribute(loadingAttribute, 1);",
+			'link.rel = "stylesheet";',
+			"link.href = url;",
+			crossOriginLoading
+				? Template.asString([
+						"if (link.src.indexOf(window.location.origin + '/') !== 0) {",
+						Template.indent(
+							`link.crossOrigin = ${JSON.stringify(crossOriginLoading)};`
+						),
+						"}"
+				  ])
+				: ""
+		]);
+
+		const cc = str => str.charCodeAt(0);
+
+		return Template.asString([
+			"// object to store loaded and loading chunks",
+			"// undefined = chunk not loaded, null = chunk preloaded/prefetched",
+			"// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded",
+			`var installedChunks = ${
+				stateExpression ? `${stateExpression} = ${stateExpression} || ` : ""
+			}{${Array.from(
+				initialChunkIdsWithoutCss,
+				id => `${JSON.stringify(id)}:0`
+			).join(",")}};`,
+			"",
+			uniqueName
+				? `var uniqueName = ${JSON.stringify(
+						runtimeTemplate.outputOptions.uniqueName
+				  )};`
+				: "// data-webpack is not used as build has no uniqueName",
+			`var loadCssChunkData = ${runtimeTemplate.basicFunction(
+				"target, link, chunkId",
+				[
+					`var data, token = "", token2, exports = {}, exportsWithId = [], exportsWithDashes = [], ${
+						withHmr ? "moduleIds = [], " : ""
+					}i = 0, cc = 1;`,
+					"try { if(!link) link = loadStylesheet(chunkId); data = link.sheet.cssRules; data = data[data.length - 1].style; } catch(e) { data = getComputedStyle(document.head); }",
+					`data = data.getPropertyValue(${
+						uniqueName
+							? runtimeTemplate.concatenation(
+									"--webpack-",
+									{ expr: "uniqueName" },
+									"-",
+									{ expr: "chunkId" }
+							  )
+							: runtimeTemplate.concatenation("--webpack-", { expr: "chunkId" })
+					});`,
+					"if(!data) return [];",
+					"for(; cc; i++) {",
+					Template.indent([
+						"cc = data.charCodeAt(i);",
+						`if(cc == ${cc("(")}) { token2 = token; token = ""; }`,
+						`else if(cc == ${cc(
+							")"
+						)}) { exports[token2.replace(/^_/, "")] = token.replace(/^_/, ""); token = ""; }`,
+						`else if(cc == ${cc("/")} || cc == ${cc(
+							"%"
+						)}) { token = token.replace(/^_/, ""); exports[token] = token; exportsWithId.push(token); if(cc == ${cc(
+							"%"
+						)}) exportsWithDashes.push(token); token = ""; }`,
+						`else if(!cc || cc == ${cc(
+							","
+						)}) { token = token.replace(/^_/, ""); exportsWithId.forEach(${runtimeTemplate.expressionFunction(
+							`exports[x] = ${
+								uniqueName
+									? runtimeTemplate.concatenation(
+											{ expr: "uniqueName" },
+											"-",
+											{ expr: "token" },
+											"-",
+											{ expr: "exports[x]" }
+									  )
+									: runtimeTemplate.concatenation({ expr: "token" }, "-", {
+											expr: "exports[x]"
+									  })
+							}`,
+							"x"
+						)}); exportsWithDashes.forEach(${runtimeTemplate.expressionFunction(
+							`exports[x] = "--" + exports[x]`,
+							"x"
+						)}); ${
+							RuntimeGlobals.makeNamespaceObject
+						}(exports); target[token] = (${runtimeTemplate.basicFunction(
+							"exports, module",
+							`module.exports = exports;`
+						)}).bind(null, exports); ${
+							withHmr ? "moduleIds.push(token); " : ""
+						}token = ""; exports = {}; exportsWithId.length = 0; }`,
+						`else if(cc == ${cc("\\")}) { token += data[++i] }`,
+						`else { token += data[i]; }`
+					]),
+					"}",
+					`${
+						withHmr ? `if(target == ${RuntimeGlobals.moduleFactories}) ` : ""
+					}installedChunks[chunkId] = 0;`,
+					withHmr ? "return moduleIds;" : ""
+				]
+			)}`,
+			'var loadingAttribute = "data-webpack-loading";',
+			`var loadStylesheet = ${runtimeTemplate.basicFunction(
+				"chunkId, url, done" + (withHmr ? ", hmr" : ""),
+				[
+					'var link, needAttach, key = "chunk-" + chunkId;',
+					withHmr ? "if(!hmr) {" : "",
+					'var links = document.getElementsByTagName("link");',
+					"for(var i = 0; i < links.length; i++) {",
+					Template.indent([
+						"var l = links[i];",
+						`if(l.rel == "stylesheet" && (${
+							withHmr
+								? 'l.href.startsWith(url) || l.getAttribute("href").startsWith(url)'
+								: 'l.href == url || l.getAttribute("href") == url'
+						}${
+							uniqueName
+								? ' || l.getAttribute("data-webpack") == uniqueName + ":" + key'
+								: ""
+						})) { link = l; break; }`
+					]),
+					"}",
+					"if(!done) return link;",
+					withHmr ? "}" : "",
+					"if(!link) {",
+					Template.indent([
+						"needAttach = true;",
+						createStylesheet.call(code, this.chunk)
+					]),
+					"}",
+					`var onLinkComplete = ${runtimeTemplate.basicFunction(
+						"prev, event",
+						Template.asString([
+							"link.onerror = link.onload = null;",
+							"link.removeAttribute(loadingAttribute);",
+							"clearTimeout(timeout);",
+							'if(event && event.type != "load") link.parentNode.removeChild(link)',
+							"done(event);",
+							"if(prev) return prev(event);"
+						])
+					)};`,
+					"if(link.getAttribute(loadingAttribute)) {",
+					Template.indent([
+						`var timeout = setTimeout(onLinkComplete.bind(null, undefined, { type: 'timeout', target: link }), ${loadTimeout});`,
+						"link.onerror = onLinkComplete.bind(null, link.onerror);",
+						"link.onload = onLinkComplete.bind(null, link.onload);"
+					]),
+					"} else onLinkComplete(undefined, { type: 'load', target: link });", // We assume any existing stylesheet is render blocking
+					withHmr ? "hmr ? document.head.insertBefore(link, hmr) :" : "",
+					"needAttach && document.head.appendChild(link);",
+					"return link;"
+				]
+			)};`,
+			initialChunkIdsWithCss.size > 2
+				? `${JSON.stringify(
+						Array.from(initialChunkIdsWithCss)
+				  )}.forEach(loadCssChunkData.bind(null, ${
+						RuntimeGlobals.moduleFactories
+				  }, 0));`
+				: initialChunkIdsWithCss.size > 0
+				? `${Array.from(
+						initialChunkIdsWithCss,
+						id =>
+							`loadCssChunkData(${
+								RuntimeGlobals.moduleFactories
+							}, 0, ${JSON.stringify(id)});`
+				  ).join("")}`
+				: "// no initial css",
+			"",
+			withLoading
+				? Template.asString([
+						`${fn}.css = ${runtimeTemplate.basicFunction("chunkId, promises", [
+							"// css chunk loading",
+							`var installedChunkData = ${RuntimeGlobals.hasOwnProperty}(installedChunks, chunkId) ? installedChunks[chunkId] : undefined;`,
+							'if(installedChunkData !== 0) { // 0 means "already installed".',
+							Template.indent([
+								"",
+								'// a Promise means "currently loading".',
+								"if(installedChunkData) {",
+								Template.indent(["promises.push(installedChunkData[2]);"]),
+								"} else {",
+								Template.indent([
+									hasCssMatcher === true
+										? "if(true) { // all chunks have CSS"
+										: `if(${hasCssMatcher("chunkId")}) {`,
+									Template.indent([
+										"// setup Promise in chunk cache",
+										`var promise = new Promise(${runtimeTemplate.expressionFunction(
+											`installedChunkData = installedChunks[chunkId] = [resolve, reject]`,
+											"resolve, reject"
+										)});`,
+										"promises.push(installedChunkData[2] = promise);",
+										"",
+										"// start chunk loading",
+										`var url = ${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkCssFilename}(chunkId);`,
+										"// create error before stack unwound to get useful stacktrace later",
+										"var error = new Error();",
+										`var loadingEnded = ${runtimeTemplate.basicFunction(
+											"event",
+											[
+												`if(${RuntimeGlobals.hasOwnProperty}(installedChunks, chunkId)) {`,
+												Template.indent([
+													"installedChunkData = installedChunks[chunkId];",
+													"if(installedChunkData !== 0) installedChunks[chunkId] = undefined;",
+													"if(installedChunkData) {",
+													Template.indent([
+														'if(event.type !== "load") {',
+														Template.indent([
+															"var errorType = event && event.type;",
+															"var realSrc = event && event.target && event.target.src;",
+															"error.message = 'Loading css chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';",
+															"error.name = 'ChunkLoadError';",
+															"error.type = errorType;",
+															"error.request = realSrc;",
+															"installedChunkData[1](error);"
+														]),
+														"} else {",
+														Template.indent([
+															`loadCssChunkData(${RuntimeGlobals.moduleFactories}, link, chunkId);`,
+															"installedChunkData[0]();"
+														]),
+														"}"
+													]),
+													"}"
+												]),
+												"}"
+											]
+										)};`,
+										"var link = loadStylesheet(chunkId, url, loadingEnded);"
+									]),
+									"} else installedChunks[chunkId] = 0;"
+								]),
+								"}"
+							]),
+							"}"
+						])};`
+				  ])
+				: "// no chunk loading",
+			"",
+			withHmr
+				? Template.asString([
+						"var oldTags = [];",
+						"var newTags = [];",
+						`var applyHandler = ${runtimeTemplate.basicFunction("options", [
+							`return { dispose: ${runtimeTemplate.basicFunction(
+								"",
+								[]
+							)}, apply: ${runtimeTemplate.basicFunction("", [
+								"var moduleIds = [];",
+								`newTags.forEach(${runtimeTemplate.expressionFunction(
+									"info[1].sheet.disabled = false",
+									"info"
+								)});`,
+								"while(oldTags.length) {",
+								Template.indent([
+									"var oldTag = oldTags.pop();",
+									"if(oldTag.parentNode) oldTag.parentNode.removeChild(oldTag);"
+								]),
+								"}",
+								"while(newTags.length) {",
+								Template.indent([
+									`var info = newTags.pop();`,
+									`var chunkModuleIds = loadCssChunkData(${RuntimeGlobals.moduleFactories}, info[1], info[0]);`,
+									`chunkModuleIds.forEach(${runtimeTemplate.expressionFunction(
+										"moduleIds.push(id)",
+										"id"
+									)});`
+								]),
+								"}",
+								"return moduleIds;"
+							])} };`
+						])}`,
+						`var cssTextKey = ${runtimeTemplate.returningFunction(
+							`Array.from(link.sheet.cssRules, ${runtimeTemplate.returningFunction(
+								"r.cssText",
+								"r"
+							)}).join()`,
+							"link"
+						)}`,
+						`${
+							RuntimeGlobals.hmrDownloadUpdateHandlers
+						}.css = ${runtimeTemplate.basicFunction(
+							"chunkIds, removedChunks, removedModules, promises, applyHandlers, updatedModulesList",
+							[
+								"applyHandlers.push(applyHandler);",
+								`chunkIds.forEach(${runtimeTemplate.basicFunction("chunkId", [
+									`var filename = ${RuntimeGlobals.getChunkCssFilename}(chunkId);`,
+									`var url = ${RuntimeGlobals.publicPath} + filename;`,
+									"var oldTag = loadStylesheet(chunkId, url);",
+									"if(!oldTag) return;",
+									`promises.push(new Promise(${runtimeTemplate.basicFunction(
+										"resolve, reject",
+										[
+											`var link = loadStylesheet(chunkId, url + (url.indexOf("?") < 0 ? "?" : "&") + "hmr=" + Date.now(), ${runtimeTemplate.basicFunction(
+												"event",
+												[
+													'if(event.type !== "load") {',
+													Template.indent([
+														"var errorType = event && event.type;",
+														"var realSrc = event && event.target && event.target.src;",
+														"error.message = 'Loading css hot update chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';",
+														"error.name = 'ChunkLoadError';",
+														"error.type = errorType;",
+														"error.request = realSrc;",
+														"reject(error);"
+													]),
+													"} else {",
+													Template.indent([
+														"try { if(cssTextKey(oldTag) == cssTextKey(link)) { if(link.parentNode) link.parentNode.removeChild(link); return resolve(); } } catch(e) {}",
+														"var factories = {};",
+														"loadCssChunkData(factories, link, chunkId);",
+														`Object.keys(factories).forEach(${runtimeTemplate.expressionFunction(
+															"updatedModulesList.push(id)",
+															"id"
+														)})`,
+														"link.sheet.disabled = true;",
+														"oldTags.push(oldTag);",
+														"newTags.push([chunkId, link]);",
+														"resolve();"
+													]),
+													"}"
+												]
+											)}, oldTag);`
+										]
+									)}));`
+								])});`
+							]
+						)}`
+				  ])
+				: "// no hmr"
+		]);
+	}
+}
+
+module.exports = CssLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssModulesPlugin.js
new file mode 100644
index 0000000..23c3d5d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssModulesPlugin.js
@@ -0,0 +1,462 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const HotUpdateChunk = require("../HotUpdateChunk");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const SelfModuleFactory = require("../SelfModuleFactory");
+const CssExportDependency = require("../dependencies/CssExportDependency");
+const CssImportDependency = require("../dependencies/CssImportDependency");
+const CssLocalIdentifierDependency = require("../dependencies/CssLocalIdentifierDependency");
+const CssSelfLocalIdentifierDependency = require("../dependencies/CssSelfLocalIdentifierDependency");
+const CssUrlDependency = require("../dependencies/CssUrlDependency");
+const StaticExportsDependency = require("../dependencies/StaticExportsDependency");
+const { compareModulesByIdentifier } = require("../util/comparators");
+const createSchemaValidation = require("../util/create-schema-validation");
+const createHash = require("../util/createHash");
+const memoize = require("../util/memoize");
+const nonNumericOnlyHash = require("../util/nonNumericOnlyHash");
+const CssExportsGenerator = require("./CssExportsGenerator");
+const CssGenerator = require("./CssGenerator");
+const CssParser = require("./CssParser");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").CssExperimentOptions} CssExperimentOptions */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+const getCssLoadingRuntimeModule = memoize(() =>
+	require("./CssLoadingRuntimeModule")
+);
+
+const getSchema = name => {
+	const { definitions } = require("../../schemas/WebpackOptions.json");
+	return {
+		definitions,
+		oneOf: [{ $ref: `#/definitions/${name}` }]
+	};
+};
+
+const validateGeneratorOptions = createSchemaValidation(
+	require("../../schemas/plugins/css/CssGeneratorOptions.check.js"),
+	() => getSchema("CssGeneratorOptions"),
+	{
+		name: "Css Modules Plugin",
+		baseDataPath: "parser"
+	}
+);
+const validateParserOptions = createSchemaValidation(
+	require("../../schemas/plugins/css/CssParserOptions.check.js"),
+	() => getSchema("CssParserOptions"),
+	{
+		name: "Css Modules Plugin",
+		baseDataPath: "parser"
+	}
+);
+
+const escapeCss = (str, omitOptionalUnderscore) => {
+	const escaped = `${str}`.replace(
+		// cspell:word uffff
+		/[^a-zA-Z0-9_\u0081-\uffff-]/g,
+		s => `\\${s}`
+	);
+	return !omitOptionalUnderscore && /^(?!--)[0-9_-]/.test(escaped)
+		? `_${escaped}`
+		: escaped;
+};
+
+const plugin = "CssModulesPlugin";
+
+class CssModulesPlugin {
+	/**
+	 * @param {CssExperimentOptions} options options
+	 */
+	constructor({ exportsOnly = false }) {
+		this._exportsOnly = exportsOnly;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			plugin,
+			(compilation, { normalModuleFactory }) => {
+				const selfFactory = new SelfModuleFactory(compilation.moduleGraph);
+				compilation.dependencyFactories.set(
+					CssUrlDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					CssUrlDependency,
+					new CssUrlDependency.Template()
+				);
+				compilation.dependencyTemplates.set(
+					CssLocalIdentifierDependency,
+					new CssLocalIdentifierDependency.Template()
+				);
+				compilation.dependencyFactories.set(
+					CssSelfLocalIdentifierDependency,
+					selfFactory
+				);
+				compilation.dependencyTemplates.set(
+					CssSelfLocalIdentifierDependency,
+					new CssSelfLocalIdentifierDependency.Template()
+				);
+				compilation.dependencyTemplates.set(
+					CssExportDependency,
+					new CssExportDependency.Template()
+				);
+				compilation.dependencyFactories.set(
+					CssImportDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					CssImportDependency,
+					new CssImportDependency.Template()
+				);
+				compilation.dependencyTemplates.set(
+					StaticExportsDependency,
+					new StaticExportsDependency.Template()
+				);
+				normalModuleFactory.hooks.createParser
+					.for("css")
+					.tap(plugin, parserOptions => {
+						validateParserOptions(parserOptions);
+						return new CssParser();
+					});
+				normalModuleFactory.hooks.createParser
+					.for("css/global")
+					.tap(plugin, parserOptions => {
+						validateParserOptions(parserOptions);
+						return new CssParser({
+							allowPseudoBlocks: false,
+							allowModeSwitch: false
+						});
+					});
+				normalModuleFactory.hooks.createParser
+					.for("css/module")
+					.tap(plugin, parserOptions => {
+						validateParserOptions(parserOptions);
+						return new CssParser({
+							defaultMode: "local"
+						});
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("css")
+					.tap(plugin, generatorOptions => {
+						validateGeneratorOptions(generatorOptions);
+						return this._exportsOnly
+							? new CssExportsGenerator()
+							: new CssGenerator();
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("css/global")
+					.tap(plugin, generatorOptions => {
+						validateGeneratorOptions(generatorOptions);
+						return this._exportsOnly
+							? new CssExportsGenerator()
+							: new CssGenerator();
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("css/module")
+					.tap(plugin, generatorOptions => {
+						validateGeneratorOptions(generatorOptions);
+						return this._exportsOnly
+							? new CssExportsGenerator()
+							: new CssGenerator();
+					});
+				const orderedCssModulesPerChunk = new WeakMap();
+				compilation.hooks.afterCodeGeneration.tap("CssModulesPlugin", () => {
+					const { chunkGraph } = compilation;
+					for (const chunk of compilation.chunks) {
+						if (CssModulesPlugin.chunkHasCss(chunk, chunkGraph)) {
+							orderedCssModulesPerChunk.set(
+								chunk,
+								this.getOrderedChunkCssModules(chunk, chunkGraph, compilation)
+							);
+						}
+					}
+				});
+				compilation.hooks.contentHash.tap("CssModulesPlugin", chunk => {
+					const {
+						chunkGraph,
+						outputOptions: {
+							hashSalt,
+							hashDigest,
+							hashDigestLength,
+							hashFunction
+						}
+					} = compilation;
+					const modules = orderedCssModulesPerChunk.get(chunk);
+					if (modules === undefined) return;
+					const hash = createHash(hashFunction);
+					if (hashSalt) hash.update(hashSalt);
+					for (const module of modules) {
+						hash.update(chunkGraph.getModuleHash(module, chunk.runtime));
+					}
+					const digest = /** @type {string} */ (hash.digest(hashDigest));
+					chunk.contentHash.css = nonNumericOnlyHash(digest, hashDigestLength);
+				});
+				compilation.hooks.renderManifest.tap(plugin, (result, options) => {
+					const { chunkGraph } = compilation;
+					const { hash, chunk, codeGenerationResults } = options;
+
+					if (chunk instanceof HotUpdateChunk) return result;
+
+					const modules = orderedCssModulesPerChunk.get(chunk);
+					if (modules !== undefined) {
+						result.push({
+							render: () =>
+								this.renderChunk({
+									chunk,
+									chunkGraph,
+									codeGenerationResults,
+									uniqueName: compilation.outputOptions.uniqueName,
+									modules
+								}),
+							filenameTemplate: CssModulesPlugin.getChunkFilenameTemplate(
+								chunk,
+								compilation.outputOptions
+							),
+							pathOptions: {
+								hash,
+								runtime: chunk.runtime,
+								chunk,
+								contentHashType: "css"
+							},
+							identifier: `css${chunk.id}`,
+							hash: chunk.contentHash.css
+						});
+					}
+					return result;
+				});
+				const enabledChunks = new WeakSet();
+				const handler = (chunk, set) => {
+					if (enabledChunks.has(chunk)) {
+						return;
+					}
+					enabledChunks.add(chunk);
+
+					set.add(RuntimeGlobals.publicPath);
+					set.add(RuntimeGlobals.getChunkCssFilename);
+					set.add(RuntimeGlobals.hasOwnProperty);
+					set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					set.add(RuntimeGlobals.makeNamespaceObject);
+
+					const CssLoadingRuntimeModule = getCssLoadingRuntimeModule();
+					compilation.addRuntimeModule(chunk, new CssLoadingRuntimeModule(set));
+				};
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hasCssModules)
+					.tap(plugin, handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap(plugin, handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadUpdateHandlers)
+					.tap(plugin, handler);
+			}
+		);
+	}
+
+	getModulesInOrder(chunk, modules, compilation) {
+		if (!modules) return [];
+
+		const modulesList = [...modules];
+
+		// Get ordered list of modules per chunk group
+		// Lists are in reverse order to allow to use Array.pop()
+		const modulesByChunkGroup = Array.from(chunk.groupsIterable, chunkGroup => {
+			const sortedModules = modulesList
+				.map(module => {
+					return {
+						module,
+						index: chunkGroup.getModulePostOrderIndex(module)
+					};
+				})
+				.filter(item => item.index !== undefined)
+				.sort((a, b) => b.index - a.index)
+				.map(item => item.module);
+
+			return { list: sortedModules, set: new Set(sortedModules) };
+		});
+
+		if (modulesByChunkGroup.length === 1)
+			return modulesByChunkGroup[0].list.reverse();
+
+		const compareModuleLists = ({ list: a }, { list: b }) => {
+			if (a.length === 0) {
+				return b.length === 0 ? 0 : 1;
+			} else {
+				if (b.length === 0) return -1;
+				return compareModulesByIdentifier(a[a.length - 1], b[b.length - 1]);
+			}
+		};
+
+		modulesByChunkGroup.sort(compareModuleLists);
+
+		const finalModules = [];
+
+		for (;;) {
+			const failedModules = new Set();
+			const list = modulesByChunkGroup[0].list;
+			if (list.length === 0) {
+				// done, everything empty
+				break;
+			}
+			let selectedModule = list[list.length - 1];
+			let hasFailed = undefined;
+			outer: for (;;) {
+				for (const { list, set } of modulesByChunkGroup) {
+					if (list.length === 0) continue;
+					const lastModule = list[list.length - 1];
+					if (lastModule === selectedModule) continue;
+					if (!set.has(selectedModule)) continue;
+					failedModules.add(selectedModule);
+					if (failedModules.has(lastModule)) {
+						// There is a conflict, try other alternatives
+						hasFailed = lastModule;
+						continue;
+					}
+					selectedModule = lastModule;
+					hasFailed = false;
+					continue outer; // restart
+				}
+				break;
+			}
+			if (hasFailed) {
+				// There is a not resolve-able conflict with the selectedModule
+				if (compilation) {
+					// TODO print better warning
+					compilation.warnings.push(
+						new Error(
+							`chunk ${
+								chunk.name || chunk.id
+							}\nConflicting order between ${hasFailed.readableIdentifier(
+								compilation.requestShortener
+							)} and ${selectedModule.readableIdentifier(
+								compilation.requestShortener
+							)}`
+						)
+					);
+				}
+				selectedModule = hasFailed;
+			}
+			// Insert the selected module into the final modules list
+			finalModules.push(selectedModule);
+			// Remove the selected module from all lists
+			for (const { list, set } of modulesByChunkGroup) {
+				const lastModule = list[list.length - 1];
+				if (lastModule === selectedModule) list.pop();
+				else if (hasFailed && set.has(selectedModule)) {
+					const idx = list.indexOf(selectedModule);
+					if (idx >= 0) list.splice(idx, 1);
+				}
+			}
+			modulesByChunkGroup.sort(compareModuleLists);
+		}
+		return finalModules;
+	}
+
+	getOrderedChunkCssModules(chunk, chunkGraph, compilation) {
+		return [
+			...this.getModulesInOrder(
+				chunk,
+				chunkGraph.getOrderedChunkModulesIterableBySourceType(
+					chunk,
+					"css-import",
+					compareModulesByIdentifier
+				),
+				compilation
+			),
+			...this.getModulesInOrder(
+				chunk,
+				chunkGraph.getOrderedChunkModulesIterableBySourceType(
+					chunk,
+					"css",
+					compareModulesByIdentifier
+				),
+				compilation
+			)
+		];
+	}
+
+	renderChunk({
+		uniqueName,
+		chunk,
+		chunkGraph,
+		codeGenerationResults,
+		modules
+	}) {
+		const source = new ConcatSource();
+		const metaData = [];
+		for (const module of modules) {
+			try {
+				const codeGenResult = codeGenerationResults.get(module, chunk.runtime);
+
+				const s =
+					codeGenResult.sources.get("css") ||
+					codeGenResult.sources.get("css-import");
+				if (s) {
+					source.add(s);
+					source.add("\n");
+				}
+				const exports =
+					codeGenResult.data && codeGenResult.data.get("css-exports");
+				const moduleId = chunkGraph.getModuleId(module) + "";
+				metaData.push(
+					`${
+						exports
+							? Array.from(exports, ([n, v]) => {
+									const shortcutValue = `${
+										uniqueName ? uniqueName + "-" : ""
+									}${moduleId}-${n}`;
+									return v === shortcutValue
+										? `${escapeCss(n)}/`
+										: v === "--" + shortcutValue
+										? `${escapeCss(n)}%`
+										: `${escapeCss(n)}(${escapeCss(v)})`;
+							  }).join("")
+							: ""
+					}${escapeCss(moduleId)}`
+				);
+			} catch (e) {
+				e.message += `\nduring rendering of css ${module.identifier()}`;
+				throw e;
+			}
+		}
+		source.add(
+			`head{--webpack-${escapeCss(
+				(uniqueName ? uniqueName + "-" : "") + chunk.id,
+				true
+			)}:${metaData.join(",")};}`
+		);
+		return source;
+	}
+
+	static getChunkFilenameTemplate(chunk, outputOptions) {
+		if (chunk.cssFilenameTemplate) {
+			return chunk.cssFilenameTemplate;
+		} else if (chunk.canBeInitial()) {
+			return outputOptions.cssFilename;
+		} else {
+			return outputOptions.cssChunkFilename;
+		}
+	}
+
+	static chunkHasCss(chunk, chunkGraph) {
+		return (
+			!!chunkGraph.getChunkModulesIterableBySourceType(chunk, "css") ||
+			!!chunkGraph.getChunkModulesIterableBySourceType(chunk, "css-import")
+		);
+	}
+}
+
+module.exports = CssModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssParser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssParser.js
new file mode 100644
index 0000000..6e96a15
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/css/CssParser.js
@@ -0,0 +1,618 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Parser = require("../Parser");
+const ConstDependency = require("../dependencies/ConstDependency");
+const CssExportDependency = require("../dependencies/CssExportDependency");
+const CssImportDependency = require("../dependencies/CssImportDependency");
+const CssLocalIdentifierDependency = require("../dependencies/CssLocalIdentifierDependency");
+const CssSelfLocalIdentifierDependency = require("../dependencies/CssSelfLocalIdentifierDependency");
+const CssUrlDependency = require("../dependencies/CssUrlDependency");
+const StaticExportsDependency = require("../dependencies/StaticExportsDependency");
+const walkCssTokens = require("./walkCssTokens");
+
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../Parser").PreparsedAst} PreparsedAst */
+
+const CC_LEFT_CURLY = "{".charCodeAt(0);
+const CC_RIGHT_CURLY = "}".charCodeAt(0);
+const CC_COLON = ":".charCodeAt(0);
+const CC_SLASH = "/".charCodeAt(0);
+const CC_SEMICOLON = ";".charCodeAt(0);
+
+const cssUnescape = str => {
+	return str.replace(/\\([0-9a-fA-F]{1,6}[ \t\n\r\f]?|[\s\S])/g, match => {
+		if (match.length > 2) {
+			return String.fromCharCode(parseInt(match.slice(1).trim(), 16));
+		} else {
+			return match[1];
+		}
+	});
+};
+
+class LocConverter {
+	constructor(input) {
+		this._input = input;
+		this.line = 1;
+		this.column = 0;
+		this.pos = 0;
+	}
+
+	get(pos) {
+		if (this.pos !== pos) {
+			if (this.pos < pos) {
+				const str = this._input.slice(this.pos, pos);
+				let i = str.lastIndexOf("\n");
+				if (i === -1) {
+					this.column += str.length;
+				} else {
+					this.column = str.length - i - 1;
+					this.line++;
+					while (i > 0 && (i = str.lastIndexOf("\n", i - 1)) !== -1)
+						this.line++;
+				}
+			} else {
+				let i = this._input.lastIndexOf("\n", this.pos);
+				while (i >= pos) {
+					this.line--;
+					i = i > 0 ? this._input.lastIndexOf("\n", i - 1) : -1;
+				}
+				this.column = pos - i;
+			}
+			this.pos = pos;
+		}
+		return this;
+	}
+}
+
+const CSS_MODE_TOP_LEVEL = 0;
+const CSS_MODE_IN_RULE = 1;
+const CSS_MODE_IN_LOCAL_RULE = 2;
+const CSS_MODE_AT_IMPORT_EXPECT_URL = 3;
+// TODO implement layer and supports for @import
+const CSS_MODE_AT_IMPORT_EXPECT_SUPPORTS = 4;
+const CSS_MODE_AT_IMPORT_EXPECT_MEDIA = 5;
+const CSS_MODE_AT_OTHER = 6;
+
+const explainMode = mode => {
+	switch (mode) {
+		case CSS_MODE_TOP_LEVEL:
+			return "parsing top level css";
+		case CSS_MODE_IN_RULE:
+			return "parsing css rule content (global)";
+		case CSS_MODE_IN_LOCAL_RULE:
+			return "parsing css rule content (local)";
+		case CSS_MODE_AT_IMPORT_EXPECT_URL:
+			return "parsing @import (expecting url)";
+		case CSS_MODE_AT_IMPORT_EXPECT_SUPPORTS:
+			return "parsing @import (expecting optionally supports or media query)";
+		case CSS_MODE_AT_IMPORT_EXPECT_MEDIA:
+			return "parsing @import (expecting optionally media query)";
+		case CSS_MODE_AT_OTHER:
+			return "parsing at-rule";
+		default:
+			return mode;
+	}
+};
+
+class CssParser extends Parser {
+	constructor({
+		allowPseudoBlocks = true,
+		allowModeSwitch = true,
+		defaultMode = "global"
+	} = {}) {
+		super();
+		this.allowPseudoBlocks = allowPseudoBlocks;
+		this.allowModeSwitch = allowModeSwitch;
+		this.defaultMode = defaultMode;
+	}
+
+	/**
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		if (Buffer.isBuffer(source)) {
+			source = source.toString("utf-8");
+		} else if (typeof source === "object") {
+			throw new Error("webpackAst is unexpected for the CssParser");
+		}
+		if (source[0] === "\ufeff") {
+			source = source.slice(1);
+		}
+
+		const module = state.module;
+
+		const declaredCssVariables = new Set();
+
+		const locConverter = new LocConverter(source);
+		let mode = CSS_MODE_TOP_LEVEL;
+		let modePos = 0;
+		let modeNestingLevel = 0;
+		let modeData = undefined;
+		let singleClassSelector = undefined;
+		let lastIdentifier = undefined;
+		const modeStack = [];
+		const isTopLevelLocal = () =>
+			modeData === "local" ||
+			(this.defaultMode === "local" && modeData === undefined);
+		const eatWhiteLine = (input, pos) => {
+			for (;;) {
+				const cc = input.charCodeAt(pos);
+				if (cc === 32 || cc === 9) {
+					pos++;
+					continue;
+				}
+				if (cc === 10) pos++;
+				break;
+			}
+			return pos;
+		};
+		const eatUntil = chars => {
+			const charCodes = Array.from({ length: chars.length }, (_, i) =>
+				chars.charCodeAt(i)
+			);
+			const arr = Array.from(
+				{ length: charCodes.reduce((a, b) => Math.max(a, b), 0) + 1 },
+				() => false
+			);
+			charCodes.forEach(cc => (arr[cc] = true));
+			return (input, pos) => {
+				for (;;) {
+					const cc = input.charCodeAt(pos);
+					if (cc < arr.length && arr[cc]) {
+						return pos;
+					}
+					pos++;
+					if (pos === input.length) return pos;
+				}
+			};
+		};
+		const eatText = (input, pos, eater) => {
+			let text = "";
+			for (;;) {
+				if (input.charCodeAt(pos) === CC_SLASH) {
+					const newPos = walkCssTokens.eatComments(input, pos);
+					if (pos !== newPos) {
+						pos = newPos;
+						if (pos === input.length) break;
+					} else {
+						text += "/";
+						pos++;
+						if (pos === input.length) break;
+					}
+				}
+				const newPos = eater(input, pos);
+				if (pos !== newPos) {
+					text += input.slice(pos, newPos);
+					pos = newPos;
+				} else {
+					break;
+				}
+				if (pos === input.length) break;
+			}
+			return [pos, text.trimRight()];
+		};
+		const eatExportName = eatUntil(":};/");
+		const eatExportValue = eatUntil("};/");
+		const parseExports = (input, pos) => {
+			pos = walkCssTokens.eatWhitespaceAndComments(input, pos);
+			const cc = input.charCodeAt(pos);
+			if (cc !== CC_LEFT_CURLY)
+				throw new Error(
+					`Unexpected ${input[pos]} at ${pos} during parsing of ':export' (expected '{')`
+				);
+			pos++;
+			pos = walkCssTokens.eatWhitespaceAndComments(input, pos);
+			for (;;) {
+				if (input.charCodeAt(pos) === CC_RIGHT_CURLY) break;
+				pos = walkCssTokens.eatWhitespaceAndComments(input, pos);
+				if (pos === input.length) return pos;
+				let start = pos;
+				let name;
+				[pos, name] = eatText(input, pos, eatExportName);
+				if (pos === input.length) return pos;
+				if (input.charCodeAt(pos) !== CC_COLON) {
+					throw new Error(
+						`Unexpected ${input[pos]} at ${pos} during parsing of export name in ':export' (expected ':')`
+					);
+				}
+				pos++;
+				if (pos === input.length) return pos;
+				pos = walkCssTokens.eatWhitespaceAndComments(input, pos);
+				if (pos === input.length) return pos;
+				let value;
+				[pos, value] = eatText(input, pos, eatExportValue);
+				if (pos === input.length) return pos;
+				const cc = input.charCodeAt(pos);
+				if (cc === CC_SEMICOLON) {
+					pos++;
+					if (pos === input.length) return pos;
+					pos = walkCssTokens.eatWhitespaceAndComments(input, pos);
+					if (pos === input.length) return pos;
+				} else if (cc !== CC_RIGHT_CURLY) {
+					throw new Error(
+						`Unexpected ${input[pos]} at ${pos} during parsing of export value in ':export' (expected ';' or '}')`
+					);
+				}
+				const dep = new CssExportDependency(name, value);
+				const { line: sl, column: sc } = locConverter.get(start);
+				const { line: el, column: ec } = locConverter.get(pos);
+				dep.setLoc(sl, sc, el, ec);
+				module.addDependency(dep);
+			}
+			pos++;
+			if (pos === input.length) return pos;
+			pos = eatWhiteLine(input, pos);
+			return pos;
+		};
+		const eatPropertyName = eatUntil(":{};");
+		const processLocalDeclaration = (input, pos) => {
+			modeData = undefined;
+			const start = pos;
+			pos = walkCssTokens.eatWhitespaceAndComments(input, pos);
+			const propertyNameStart = pos;
+			const [propertyNameEnd, propertyName] = eatText(
+				input,
+				pos,
+				eatPropertyName
+			);
+			if (input.charCodeAt(propertyNameEnd) !== CC_COLON) return start;
+			pos = propertyNameEnd + 1;
+			if (propertyName.startsWith("--")) {
+				// CSS Variable
+				const { line: sl, column: sc } = locConverter.get(propertyNameStart);
+				const { line: el, column: ec } = locConverter.get(propertyNameEnd);
+				const name = propertyName.slice(2);
+				const dep = new CssLocalIdentifierDependency(
+					name,
+					[propertyNameStart, propertyNameEnd],
+					"--"
+				);
+				dep.setLoc(sl, sc, el, ec);
+				module.addDependency(dep);
+				declaredCssVariables.add(name);
+			} else if (
+				propertyName === "animation-name" ||
+				propertyName === "animation"
+			) {
+				modeData = "animation";
+				lastIdentifier = undefined;
+			}
+			return pos;
+		};
+		const processDeclarationValueDone = (input, pos) => {
+			if (modeData === "animation" && lastIdentifier) {
+				const { line: sl, column: sc } = locConverter.get(lastIdentifier[0]);
+				const { line: el, column: ec } = locConverter.get(lastIdentifier[1]);
+				const name = input.slice(lastIdentifier[0], lastIdentifier[1]);
+				const dep = new CssSelfLocalIdentifierDependency(name, lastIdentifier);
+				dep.setLoc(sl, sc, el, ec);
+				module.addDependency(dep);
+			}
+		};
+		const eatKeyframes = eatUntil("{};/");
+		const eatNameInVar = eatUntil(",)};/");
+		walkCssTokens(source, {
+			isSelector: () => {
+				return mode !== CSS_MODE_IN_RULE && mode !== CSS_MODE_IN_LOCAL_RULE;
+			},
+			url: (input, start, end, contentStart, contentEnd) => {
+				const value = cssUnescape(input.slice(contentStart, contentEnd));
+				switch (mode) {
+					case CSS_MODE_AT_IMPORT_EXPECT_URL: {
+						modeData.url = value;
+						mode = CSS_MODE_AT_IMPORT_EXPECT_SUPPORTS;
+						break;
+					}
+					case CSS_MODE_AT_IMPORT_EXPECT_SUPPORTS:
+					case CSS_MODE_AT_IMPORT_EXPECT_MEDIA:
+						throw new Error(
+							`Unexpected ${input.slice(
+								start,
+								end
+							)} at ${start} during ${explainMode(mode)}`
+						);
+					default: {
+						const dep = new CssUrlDependency(value, [start, end], "url");
+						const { line: sl, column: sc } = locConverter.get(start);
+						const { line: el, column: ec } = locConverter.get(end);
+						dep.setLoc(sl, sc, el, ec);
+						module.addDependency(dep);
+						module.addCodeGenerationDependency(dep);
+						break;
+					}
+				}
+				return end;
+			},
+			string: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_AT_IMPORT_EXPECT_URL: {
+						modeData.url = cssUnescape(input.slice(start + 1, end - 1));
+						mode = CSS_MODE_AT_IMPORT_EXPECT_SUPPORTS;
+						break;
+					}
+				}
+				return end;
+			},
+			atKeyword: (input, start, end) => {
+				const name = input.slice(start, end);
+				if (name === "@namespace") {
+					throw new Error("@namespace is not supported in bundled CSS");
+				}
+				if (name === "@import") {
+					if (mode !== CSS_MODE_TOP_LEVEL) {
+						throw new Error(
+							`Unexpected @import at ${start} during ${explainMode(mode)}`
+						);
+					}
+					mode = CSS_MODE_AT_IMPORT_EXPECT_URL;
+					modePos = end;
+					modeData = {
+						start: start,
+						url: undefined,
+						supports: undefined
+					};
+				}
+				if (name === "@keyframes") {
+					let pos = end;
+					pos = walkCssTokens.eatWhitespaceAndComments(input, pos);
+					if (pos === input.length) return pos;
+					const [newPos, name] = eatText(input, pos, eatKeyframes);
+					const { line: sl, column: sc } = locConverter.get(pos);
+					const { line: el, column: ec } = locConverter.get(newPos);
+					const dep = new CssLocalIdentifierDependency(name, [pos, newPos]);
+					dep.setLoc(sl, sc, el, ec);
+					module.addDependency(dep);
+					pos = newPos;
+					if (pos === input.length) return pos;
+					if (input.charCodeAt(pos) !== CC_LEFT_CURLY) {
+						throw new Error(
+							`Unexpected ${input[pos]} at ${pos} during parsing of @keyframes (expected '{')`
+						);
+					}
+					mode = CSS_MODE_IN_LOCAL_RULE;
+					modeNestingLevel = 1;
+					return pos + 1;
+				}
+				return end;
+			},
+			semicolon: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_AT_IMPORT_EXPECT_URL:
+						throw new Error(`Expected URL for @import at ${start}`);
+					case CSS_MODE_AT_IMPORT_EXPECT_MEDIA:
+					case CSS_MODE_AT_IMPORT_EXPECT_SUPPORTS: {
+						const { line: sl, column: sc } = locConverter.get(modeData.start);
+						const { line: el, column: ec } = locConverter.get(end);
+						end = eatWhiteLine(input, end);
+						const media = input.slice(modePos, start).trim();
+						const dep = new CssImportDependency(
+							modeData.url,
+							[modeData.start, end],
+							modeData.supports,
+							media
+						);
+						dep.setLoc(sl, sc, el, ec);
+						module.addDependency(dep);
+						break;
+					}
+					case CSS_MODE_IN_LOCAL_RULE: {
+						processDeclarationValueDone(input, start);
+						return processLocalDeclaration(input, end);
+					}
+					case CSS_MODE_IN_RULE: {
+						return end;
+					}
+				}
+				mode = CSS_MODE_TOP_LEVEL;
+				modeData = undefined;
+				singleClassSelector = undefined;
+				return end;
+			},
+			leftCurlyBracket: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL:
+						mode = isTopLevelLocal()
+							? CSS_MODE_IN_LOCAL_RULE
+							: CSS_MODE_IN_RULE;
+						modeNestingLevel = 1;
+						if (mode === CSS_MODE_IN_LOCAL_RULE)
+							return processLocalDeclaration(input, end);
+						break;
+					case CSS_MODE_IN_RULE:
+					case CSS_MODE_IN_LOCAL_RULE:
+						modeNestingLevel++;
+						break;
+				}
+				return end;
+			},
+			rightCurlyBracket: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_IN_LOCAL_RULE:
+						processDeclarationValueDone(input, start);
+					/* falls through */
+					case CSS_MODE_IN_RULE:
+						if (--modeNestingLevel === 0) {
+							mode = CSS_MODE_TOP_LEVEL;
+							modeData = undefined;
+							singleClassSelector = undefined;
+						}
+						break;
+				}
+				return end;
+			},
+			id: (input, start, end) => {
+				singleClassSelector = false;
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL:
+						if (isTopLevelLocal()) {
+							const name = input.slice(start + 1, end);
+							const dep = new CssLocalIdentifierDependency(name, [
+								start + 1,
+								end
+							]);
+							const { line: sl, column: sc } = locConverter.get(start);
+							const { line: el, column: ec } = locConverter.get(end);
+							dep.setLoc(sl, sc, el, ec);
+							module.addDependency(dep);
+						}
+						break;
+				}
+				return end;
+			},
+			identifier: (input, start, end) => {
+				singleClassSelector = false;
+				switch (mode) {
+					case CSS_MODE_IN_LOCAL_RULE:
+						if (modeData === "animation") {
+							lastIdentifier = [start, end];
+						}
+						break;
+				}
+				return end;
+			},
+			class: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL: {
+						if (isTopLevelLocal()) {
+							const name = input.slice(start + 1, end);
+							const dep = new CssLocalIdentifierDependency(name, [
+								start + 1,
+								end
+							]);
+							const { line: sl, column: sc } = locConverter.get(start);
+							const { line: el, column: ec } = locConverter.get(end);
+							dep.setLoc(sl, sc, el, ec);
+							module.addDependency(dep);
+							if (singleClassSelector === undefined) singleClassSelector = name;
+						} else {
+							singleClassSelector = false;
+						}
+						break;
+					}
+				}
+				return end;
+			},
+			leftParenthesis: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL: {
+						modeStack.push(false);
+						break;
+					}
+				}
+				return end;
+			},
+			rightParenthesis: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL: {
+						const newModeData = modeStack.pop();
+						if (newModeData !== false) {
+							modeData = newModeData;
+							const dep = new ConstDependency("", [start, end]);
+							module.addPresentationalDependency(dep);
+						}
+						break;
+					}
+				}
+				return end;
+			},
+			pseudoClass: (input, start, end) => {
+				singleClassSelector = false;
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL: {
+						const name = input.slice(start, end);
+						if (this.allowModeSwitch && name === ":global") {
+							modeData = "global";
+							const dep = new ConstDependency("", [start, end]);
+							module.addPresentationalDependency(dep);
+						} else if (this.allowModeSwitch && name === ":local") {
+							modeData = "local";
+							const dep = new ConstDependency("", [start, end]);
+							module.addPresentationalDependency(dep);
+						} else if (this.allowPseudoBlocks && name === ":export") {
+							const pos = parseExports(input, end);
+							const dep = new ConstDependency("", [start, pos]);
+							module.addPresentationalDependency(dep);
+							return pos;
+						}
+						break;
+					}
+				}
+				return end;
+			},
+			pseudoFunction: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL: {
+						const name = input.slice(start, end - 1);
+						if (this.allowModeSwitch && name === ":global") {
+							modeStack.push(modeData);
+							modeData = "global";
+							const dep = new ConstDependency("", [start, end]);
+							module.addPresentationalDependency(dep);
+						} else if (this.allowModeSwitch && name === ":local") {
+							modeStack.push(modeData);
+							modeData = "local";
+							const dep = new ConstDependency("", [start, end]);
+							module.addPresentationalDependency(dep);
+						} else {
+							modeStack.push(false);
+						}
+						break;
+					}
+				}
+				return end;
+			},
+			function: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_IN_LOCAL_RULE: {
+						const name = input.slice(start, end - 1);
+						if (name === "var") {
+							let pos = walkCssTokens.eatWhitespaceAndComments(input, end);
+							if (pos === input.length) return pos;
+							const [newPos, name] = eatText(input, pos, eatNameInVar);
+							if (!name.startsWith("--")) return end;
+							const { line: sl, column: sc } = locConverter.get(pos);
+							const { line: el, column: ec } = locConverter.get(newPos);
+							const dep = new CssSelfLocalIdentifierDependency(
+								name.slice(2),
+								[pos, newPos],
+								"--",
+								declaredCssVariables
+							);
+							dep.setLoc(sl, sc, el, ec);
+							module.addDependency(dep);
+							return newPos;
+						}
+						break;
+					}
+				}
+				return end;
+			},
+			comma: (input, start, end) => {
+				switch (mode) {
+					case CSS_MODE_TOP_LEVEL:
+						modeData = undefined;
+						modeStack.length = 0;
+						break;
+					case CSS_MODE_IN_LOCAL_RULE:
+						processDeclarationValueDone(input, start);
+						break;
+				}
+				return end;
+			}
+		});
+
+		module.buildInfo.strict = true;
+		module.buildMeta.exportsType = "namespace";
+		module.addDependency(new StaticExportsDependency([], true));
+		return state;
+	}
+}
+
+module.exports = CssParser;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/css/walkCssTokens.js b/node_modules/mathjs/examples/node_modules/webpack/lib/css/walkCssTokens.js
new file mode 100644
index 0000000..6ba1dca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/css/walkCssTokens.js
@@ -0,0 +1,659 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @typedef {Object} CssTokenCallbacks
+ * @property {function(string, number): boolean} isSelector
+ * @property {function(string, number, number, number, number): number=} url
+ * @property {function(string, number, number): number=} string
+ * @property {function(string, number, number): number=} leftParenthesis
+ * @property {function(string, number, number): number=} rightParenthesis
+ * @property {function(string, number, number): number=} pseudoFunction
+ * @property {function(string, number, number): number=} function
+ * @property {function(string, number, number): number=} pseudoClass
+ * @property {function(string, number, number): number=} atKeyword
+ * @property {function(string, number, number): number=} class
+ * @property {function(string, number, number): number=} identifier
+ * @property {function(string, number, number): number=} id
+ * @property {function(string, number, number): number=} leftCurlyBracket
+ * @property {function(string, number, number): number=} rightCurlyBracket
+ * @property {function(string, number, number): number=} semicolon
+ * @property {function(string, number, number): number=} comma
+ */
+
+/** @typedef {function(string, number, CssTokenCallbacks): number} CharHandler */
+
+// spec: https://drafts.csswg.org/css-syntax/
+
+const CC_LINE_FEED = "\n".charCodeAt(0);
+const CC_CARRIAGE_RETURN = "\r".charCodeAt(0);
+const CC_FORM_FEED = "\f".charCodeAt(0);
+
+const CC_TAB = "\t".charCodeAt(0);
+const CC_SPACE = " ".charCodeAt(0);
+
+const CC_SLASH = "/".charCodeAt(0);
+const CC_BACK_SLASH = "\\".charCodeAt(0);
+const CC_ASTERISK = "*".charCodeAt(0);
+
+const CC_LEFT_PARENTHESIS = "(".charCodeAt(0);
+const CC_RIGHT_PARENTHESIS = ")".charCodeAt(0);
+const CC_LEFT_CURLY = "{".charCodeAt(0);
+const CC_RIGHT_CURLY = "}".charCodeAt(0);
+
+const CC_QUOTATION_MARK = '"'.charCodeAt(0);
+const CC_APOSTROPHE = "'".charCodeAt(0);
+
+const CC_FULL_STOP = ".".charCodeAt(0);
+const CC_COLON = ":".charCodeAt(0);
+const CC_SEMICOLON = ";".charCodeAt(0);
+const CC_COMMA = ",".charCodeAt(0);
+const CC_PERCENTAGE = "%".charCodeAt(0);
+const CC_AT_SIGN = "@".charCodeAt(0);
+
+const CC_LOW_LINE = "_".charCodeAt(0);
+const CC_LOWER_A = "a".charCodeAt(0);
+const CC_LOWER_U = "u".charCodeAt(0);
+const CC_LOWER_E = "e".charCodeAt(0);
+const CC_LOWER_Z = "z".charCodeAt(0);
+const CC_UPPER_A = "A".charCodeAt(0);
+const CC_UPPER_E = "E".charCodeAt(0);
+const CC_UPPER_Z = "Z".charCodeAt(0);
+const CC_0 = "0".charCodeAt(0);
+const CC_9 = "9".charCodeAt(0);
+
+const CC_NUMBER_SIGN = "#".charCodeAt(0);
+const CC_PLUS_SIGN = "+".charCodeAt(0);
+const CC_HYPHEN_MINUS = "-".charCodeAt(0);
+
+const CC_LESS_THAN_SIGN = "<".charCodeAt(0);
+const CC_GREATER_THAN_SIGN = ">".charCodeAt(0);
+
+const _isNewLine = cc => {
+	return (
+		cc === CC_LINE_FEED || cc === CC_CARRIAGE_RETURN || cc === CC_FORM_FEED
+	);
+};
+
+/** @type {CharHandler} */
+const consumeSpace = (input, pos, callbacks) => {
+	let cc;
+	do {
+		pos++;
+		cc = input.charCodeAt(pos);
+	} while (_isWhiteSpace(cc));
+	return pos;
+};
+
+const _isWhiteSpace = cc => {
+	return (
+		cc === CC_LINE_FEED ||
+		cc === CC_CARRIAGE_RETURN ||
+		cc === CC_FORM_FEED ||
+		cc === CC_TAB ||
+		cc === CC_SPACE
+	);
+};
+
+/** @type {CharHandler} */
+const consumeSingleCharToken = (input, pos, callbacks) => {
+	return pos + 1;
+};
+
+/** @type {CharHandler} */
+const consumePotentialComment = (input, pos, callbacks) => {
+	pos++;
+	if (pos === input.length) return pos;
+	let cc = input.charCodeAt(pos);
+	if (cc !== CC_ASTERISK) return pos;
+	for (;;) {
+		pos++;
+		if (pos === input.length) return pos;
+		cc = input.charCodeAt(pos);
+		while (cc === CC_ASTERISK) {
+			pos++;
+			if (pos === input.length) return pos;
+			cc = input.charCodeAt(pos);
+			if (cc === CC_SLASH) return pos + 1;
+		}
+	}
+};
+
+/** @type {function(number): CharHandler} */
+const consumeString = end => (input, pos, callbacks) => {
+	const start = pos;
+	pos = _consumeString(input, pos, end);
+	if (callbacks.string !== undefined) {
+		pos = callbacks.string(input, start, pos);
+	}
+	return pos;
+};
+
+const _consumeString = (input, pos, end) => {
+	pos++;
+	for (;;) {
+		if (pos === input.length) return pos;
+		const cc = input.charCodeAt(pos);
+		if (cc === end) return pos + 1;
+		if (_isNewLine(cc)) {
+			// bad string
+			return pos;
+		}
+		if (cc === CC_BACK_SLASH) {
+			// we don't need to fully parse the escaped code point
+			// just skip over a potential new line
+			pos++;
+			if (pos === input.length) return pos;
+			pos++;
+		} else {
+			pos++;
+		}
+	}
+};
+
+const _isIdentifierStartCode = cc => {
+	return (
+		cc === CC_LOW_LINE ||
+		(cc >= CC_LOWER_A && cc <= CC_LOWER_Z) ||
+		(cc >= CC_UPPER_A && cc <= CC_UPPER_Z) ||
+		cc > 0x80
+	);
+};
+
+const _isDigit = cc => {
+	return cc >= CC_0 && cc <= CC_9;
+};
+
+const _startsIdentifier = (input, pos) => {
+	const cc = input.charCodeAt(pos);
+	if (cc === CC_HYPHEN_MINUS) {
+		if (pos === input.length) return false;
+		const cc = input.charCodeAt(pos + 1);
+		if (cc === CC_HYPHEN_MINUS) return true;
+		if (cc === CC_BACK_SLASH) {
+			const cc = input.charCodeAt(pos + 2);
+			return !_isNewLine(cc);
+		}
+		return _isIdentifierStartCode(cc);
+	}
+	if (cc === CC_BACK_SLASH) {
+		const cc = input.charCodeAt(pos + 1);
+		return !_isNewLine(cc);
+	}
+	return _isIdentifierStartCode(cc);
+};
+
+/** @type {CharHandler} */
+const consumeNumberSign = (input, pos, callbacks) => {
+	const start = pos;
+	pos++;
+	if (pos === input.length) return pos;
+	if (callbacks.isSelector(input, pos) && _startsIdentifier(input, pos)) {
+		pos = _consumeIdentifier(input, pos);
+		if (callbacks.id !== undefined) {
+			return callbacks.id(input, start, pos);
+		}
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeMinus = (input, pos, callbacks) => {
+	const start = pos;
+	pos++;
+	if (pos === input.length) return pos;
+	const cc = input.charCodeAt(pos);
+	if (cc === CC_FULL_STOP || _isDigit(cc)) {
+		return consumeNumericToken(input, pos, callbacks);
+	} else if (cc === CC_HYPHEN_MINUS) {
+		pos++;
+		if (pos === input.length) return pos;
+		const cc = input.charCodeAt(pos);
+		if (cc === CC_GREATER_THAN_SIGN) {
+			return pos + 1;
+		} else {
+			pos = _consumeIdentifier(input, pos);
+			if (callbacks.identifier !== undefined) {
+				return callbacks.identifier(input, start, pos);
+			}
+		}
+	} else if (cc === CC_BACK_SLASH) {
+		if (pos + 1 === input.length) return pos;
+		const cc = input.charCodeAt(pos + 1);
+		if (_isNewLine(cc)) return pos;
+		pos = _consumeIdentifier(input, pos);
+		if (callbacks.identifier !== undefined) {
+			return callbacks.identifier(input, start, pos);
+		}
+	} else if (_isIdentifierStartCode(cc)) {
+		pos++;
+		pos = _consumeIdentifier(input, pos);
+		if (callbacks.identifier !== undefined) {
+			return callbacks.identifier(input, start, pos);
+		}
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeDot = (input, pos, callbacks) => {
+	const start = pos;
+	pos++;
+	if (pos === input.length) return pos;
+	const cc = input.charCodeAt(pos);
+	if (_isDigit(cc)) return consumeNumericToken(input, pos - 2, callbacks);
+	if (!callbacks.isSelector(input, pos) || !_startsIdentifier(input, pos))
+		return pos;
+	pos = _consumeIdentifier(input, pos);
+	if (callbacks.class !== undefined) return callbacks.class(input, start, pos);
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeNumericToken = (input, pos, callbacks) => {
+	pos = _consumeNumber(input, pos);
+	if (pos === input.length) return pos;
+	if (_startsIdentifier(input, pos)) return _consumeIdentifier(input, pos);
+	const cc = input.charCodeAt(pos);
+	if (cc === CC_PERCENTAGE) return pos + 1;
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeOtherIdentifier = (input, pos, callbacks) => {
+	const start = pos;
+	pos = _consumeIdentifier(input, pos);
+	if (
+		pos !== input.length &&
+		!callbacks.isSelector(input, pos) &&
+		input.charCodeAt(pos) === CC_LEFT_PARENTHESIS
+	) {
+		pos++;
+		if (callbacks.function !== undefined) {
+			return callbacks.function(input, start, pos);
+		}
+	} else {
+		if (callbacks.identifier !== undefined) {
+			return callbacks.identifier(input, start, pos);
+		}
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumePotentialUrl = (input, pos, callbacks) => {
+	const start = pos;
+	pos = _consumeIdentifier(input, pos);
+	if (pos === start + 3 && input.slice(start, pos + 1) === "url(") {
+		pos++;
+		let cc = input.charCodeAt(pos);
+		while (_isWhiteSpace(cc)) {
+			pos++;
+			if (pos === input.length) return pos;
+			cc = input.charCodeAt(pos);
+		}
+		if (cc === CC_QUOTATION_MARK || cc === CC_APOSTROPHE) {
+			pos++;
+			const contentStart = pos;
+			pos = _consumeString(input, pos, cc);
+			const contentEnd = pos - 1;
+			cc = input.charCodeAt(pos);
+			while (_isWhiteSpace(cc)) {
+				pos++;
+				if (pos === input.length) return pos;
+				cc = input.charCodeAt(pos);
+			}
+			if (cc !== CC_RIGHT_PARENTHESIS) return pos;
+			pos++;
+			if (callbacks.url !== undefined)
+				return callbacks.url(input, start, pos, contentStart, contentEnd);
+			return pos;
+		} else {
+			const contentStart = pos;
+			let contentEnd;
+			for (;;) {
+				if (cc === CC_BACK_SLASH) {
+					pos++;
+					if (pos === input.length) return pos;
+					pos++;
+				} else if (_isWhiteSpace(cc)) {
+					contentEnd = pos;
+					do {
+						pos++;
+						if (pos === input.length) return pos;
+						cc = input.charCodeAt(pos);
+					} while (_isWhiteSpace(cc));
+					if (cc !== CC_RIGHT_PARENTHESIS) return pos;
+					pos++;
+					if (callbacks.url !== undefined) {
+						return callbacks.url(input, start, pos, contentStart, contentEnd);
+					}
+					return pos;
+				} else if (cc === CC_RIGHT_PARENTHESIS) {
+					contentEnd = pos;
+					pos++;
+					if (callbacks.url !== undefined) {
+						return callbacks.url(input, start, pos, contentStart, contentEnd);
+					}
+					return pos;
+				} else if (cc === CC_LEFT_PARENTHESIS) {
+					return pos;
+				} else {
+					pos++;
+				}
+				if (pos === input.length) return pos;
+				cc = input.charCodeAt(pos);
+			}
+		}
+	} else {
+		if (callbacks.identifier !== undefined) {
+			return callbacks.identifier(input, start, pos);
+		}
+		return pos;
+	}
+};
+
+/** @type {CharHandler} */
+const consumePotentialPseudo = (input, pos, callbacks) => {
+	const start = pos;
+	pos++;
+	if (!callbacks.isSelector(input, pos) || !_startsIdentifier(input, pos))
+		return pos;
+	pos = _consumeIdentifier(input, pos);
+	let cc = input.charCodeAt(pos);
+	if (cc === CC_LEFT_PARENTHESIS) {
+		pos++;
+		if (callbacks.pseudoFunction !== undefined) {
+			return callbacks.pseudoFunction(input, start, pos);
+		}
+		return pos;
+	}
+	if (callbacks.pseudoClass !== undefined) {
+		return callbacks.pseudoClass(input, start, pos);
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeLeftParenthesis = (input, pos, callbacks) => {
+	pos++;
+	if (callbacks.leftParenthesis !== undefined) {
+		return callbacks.leftParenthesis(input, pos - 1, pos);
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeRightParenthesis = (input, pos, callbacks) => {
+	pos++;
+	if (callbacks.rightParenthesis !== undefined) {
+		return callbacks.rightParenthesis(input, pos - 1, pos);
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeLeftCurlyBracket = (input, pos, callbacks) => {
+	pos++;
+	if (callbacks.leftCurlyBracket !== undefined) {
+		return callbacks.leftCurlyBracket(input, pos - 1, pos);
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeRightCurlyBracket = (input, pos, callbacks) => {
+	pos++;
+	if (callbacks.rightCurlyBracket !== undefined) {
+		return callbacks.rightCurlyBracket(input, pos - 1, pos);
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeSemicolon = (input, pos, callbacks) => {
+	pos++;
+	if (callbacks.semicolon !== undefined) {
+		return callbacks.semicolon(input, pos - 1, pos);
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeComma = (input, pos, callbacks) => {
+	pos++;
+	if (callbacks.comma !== undefined) {
+		return callbacks.comma(input, pos - 1, pos);
+	}
+	return pos;
+};
+
+const _consumeIdentifier = (input, pos) => {
+	for (;;) {
+		const cc = input.charCodeAt(pos);
+		if (cc === CC_BACK_SLASH) {
+			pos++;
+			if (pos === input.length) return pos;
+			pos++;
+		} else if (
+			_isIdentifierStartCode(cc) ||
+			_isDigit(cc) ||
+			cc === CC_HYPHEN_MINUS
+		) {
+			pos++;
+		} else {
+			return pos;
+		}
+	}
+};
+
+const _consumeNumber = (input, pos) => {
+	pos++;
+	if (pos === input.length) return pos;
+	let cc = input.charCodeAt(pos);
+	while (_isDigit(cc)) {
+		pos++;
+		if (pos === input.length) return pos;
+		cc = input.charCodeAt(pos);
+	}
+	if (cc === CC_FULL_STOP && pos + 1 !== input.length) {
+		const next = input.charCodeAt(pos + 1);
+		if (_isDigit(next)) {
+			pos += 2;
+			cc = input.charCodeAt(pos);
+			while (_isDigit(cc)) {
+				pos++;
+				if (pos === input.length) return pos;
+				cc = input.charCodeAt(pos);
+			}
+		}
+	}
+	if (cc === CC_LOWER_E || cc === CC_UPPER_E) {
+		if (pos + 1 !== input.length) {
+			const next = input.charCodeAt(pos + 2);
+			if (_isDigit(next)) {
+				pos += 2;
+			} else if (
+				(next === CC_HYPHEN_MINUS || next === CC_PLUS_SIGN) &&
+				pos + 2 !== input.length
+			) {
+				const next = input.charCodeAt(pos + 2);
+				if (_isDigit(next)) {
+					pos += 3;
+				} else {
+					return pos;
+				}
+			} else {
+				return pos;
+			}
+		}
+	} else {
+		return pos;
+	}
+	cc = input.charCodeAt(pos);
+	while (_isDigit(cc)) {
+		pos++;
+		if (pos === input.length) return pos;
+		cc = input.charCodeAt(pos);
+	}
+	return pos;
+};
+
+/** @type {CharHandler} */
+const consumeLessThan = (input, pos, callbacks) => {
+	if (input.slice(pos + 1, pos + 4) === "!--") return pos + 4;
+	return pos + 1;
+};
+
+/** @type {CharHandler} */
+const consumeAt = (input, pos, callbacks) => {
+	const start = pos;
+	pos++;
+	if (pos === input.length) return pos;
+	if (_startsIdentifier(input, pos)) {
+		pos = _consumeIdentifier(input, pos);
+		if (callbacks.atKeyword !== undefined) {
+			pos = callbacks.atKeyword(input, start, pos);
+		}
+	}
+	return pos;
+};
+
+const CHAR_MAP = Array.from({ length: 0x80 }, (_, cc) => {
+	// https://drafts.csswg.org/css-syntax/#consume-token
+	switch (cc) {
+		case CC_LINE_FEED:
+		case CC_CARRIAGE_RETURN:
+		case CC_FORM_FEED:
+		case CC_TAB:
+		case CC_SPACE:
+			return consumeSpace;
+		case CC_QUOTATION_MARK:
+		case CC_APOSTROPHE:
+			return consumeString(cc);
+		case CC_NUMBER_SIGN:
+			return consumeNumberSign;
+		case CC_SLASH:
+			return consumePotentialComment;
+		// case CC_LEFT_SQUARE:
+		// case CC_RIGHT_SQUARE:
+		// case CC_COMMA:
+		// case CC_COLON:
+		// 	return consumeSingleCharToken;
+		case CC_COMMA:
+			return consumeComma;
+		case CC_SEMICOLON:
+			return consumeSemicolon;
+		case CC_LEFT_PARENTHESIS:
+			return consumeLeftParenthesis;
+		case CC_RIGHT_PARENTHESIS:
+			return consumeRightParenthesis;
+		case CC_LEFT_CURLY:
+			return consumeLeftCurlyBracket;
+		case CC_RIGHT_CURLY:
+			return consumeRightCurlyBracket;
+		case CC_COLON:
+			return consumePotentialPseudo;
+		case CC_PLUS_SIGN:
+			return consumeNumericToken;
+		case CC_FULL_STOP:
+			return consumeDot;
+		case CC_HYPHEN_MINUS:
+			return consumeMinus;
+		case CC_LESS_THAN_SIGN:
+			return consumeLessThan;
+		case CC_AT_SIGN:
+			return consumeAt;
+		case CC_LOWER_U:
+			return consumePotentialUrl;
+		case CC_LOW_LINE:
+			return consumeOtherIdentifier;
+		default:
+			if (_isDigit(cc)) return consumeNumericToken;
+			if (
+				(cc >= CC_LOWER_A && cc <= CC_LOWER_Z) ||
+				(cc >= CC_UPPER_A && cc <= CC_UPPER_Z)
+			) {
+				return consumeOtherIdentifier;
+			}
+			return consumeSingleCharToken;
+	}
+});
+
+/**
+ * @param {string} input input css
+ * @param {CssTokenCallbacks} callbacks callbacks
+ * @returns {void}
+ */
+module.exports = (input, callbacks) => {
+	let pos = 0;
+	while (pos < input.length) {
+		const cc = input.charCodeAt(pos);
+		if (cc < 0x80) {
+			pos = CHAR_MAP[cc](input, pos, callbacks);
+		} else {
+			pos++;
+		}
+	}
+};
+
+module.exports.eatComments = (input, pos) => {
+	loop: for (;;) {
+		const cc = input.charCodeAt(pos);
+		if (cc === CC_SLASH) {
+			if (pos === input.length) return pos;
+			let cc = input.charCodeAt(pos + 1);
+			if (cc !== CC_ASTERISK) return pos;
+			pos++;
+			for (;;) {
+				pos++;
+				if (pos === input.length) return pos;
+				cc = input.charCodeAt(pos);
+				while (cc === CC_ASTERISK) {
+					pos++;
+					if (pos === input.length) return pos;
+					cc = input.charCodeAt(pos);
+					if (cc === CC_SLASH) {
+						pos++;
+						continue loop;
+					}
+				}
+			}
+		}
+		return pos;
+	}
+};
+
+module.exports.eatWhitespaceAndComments = (input, pos) => {
+	loop: for (;;) {
+		const cc = input.charCodeAt(pos);
+		if (cc === CC_SLASH) {
+			if (pos === input.length) return pos;
+			let cc = input.charCodeAt(pos + 1);
+			if (cc !== CC_ASTERISK) return pos;
+			pos++;
+			for (;;) {
+				pos++;
+				if (pos === input.length) return pos;
+				cc = input.charCodeAt(pos);
+				while (cc === CC_ASTERISK) {
+					pos++;
+					if (pos === input.length) return pos;
+					cc = input.charCodeAt(pos);
+					if (cc === CC_SLASH) {
+						pos++;
+						continue loop;
+					}
+				}
+			}
+		} else if (_isWhiteSpace(cc)) {
+			pos++;
+			continue;
+		}
+		return pos;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/debug/ProfilingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/debug/ProfilingPlugin.js
new file mode 100644
index 0000000..4bf9e10
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/debug/ProfilingPlugin.js
@@ -0,0 +1,454 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const { Tracer } = require("chrome-trace-event");
+const createSchemaValidation = require("../util/create-schema-validation");
+const { dirname, mkdirpSync } = require("../util/fs");
+
+/** @typedef {import("../../declarations/plugins/debug/ProfilingPlugin").ProfilingPluginOptions} ProfilingPluginOptions */
+/** @typedef {import("../util/fs").IntermediateFileSystem} IntermediateFileSystem */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/debug/ProfilingPlugin.check.js"),
+	() => require("../../schemas/plugins/debug/ProfilingPlugin.json"),
+	{
+		name: "Profiling Plugin",
+		baseDataPath: "options"
+	}
+);
+let inspector = undefined;
+
+try {
+	// eslint-disable-next-line node/no-unsupported-features/node-builtins
+	inspector = require("inspector");
+} catch (e) {
+	console.log("Unable to CPU profile in < node 8.0");
+}
+
+class Profiler {
+	constructor(inspector) {
+		this.session = undefined;
+		this.inspector = inspector;
+		this._startTime = 0;
+	}
+
+	hasSession() {
+		return this.session !== undefined;
+	}
+
+	startProfiling() {
+		if (this.inspector === undefined) {
+			return Promise.resolve();
+		}
+
+		try {
+			this.session = new inspector.Session();
+			this.session.connect();
+		} catch (_) {
+			this.session = undefined;
+			return Promise.resolve();
+		}
+
+		const hrtime = process.hrtime();
+		this._startTime = hrtime[0] * 1000000 + Math.round(hrtime[1] / 1000);
+
+		return Promise.all([
+			this.sendCommand("Profiler.setSamplingInterval", {
+				interval: 100
+			}),
+			this.sendCommand("Profiler.enable"),
+			this.sendCommand("Profiler.start")
+		]);
+	}
+
+	sendCommand(method, params) {
+		if (this.hasSession()) {
+			return new Promise((res, rej) => {
+				return this.session.post(method, params, (err, params) => {
+					if (err !== null) {
+						rej(err);
+					} else {
+						res(params);
+					}
+				});
+			});
+		} else {
+			return Promise.resolve();
+		}
+	}
+
+	destroy() {
+		if (this.hasSession()) {
+			this.session.disconnect();
+		}
+
+		return Promise.resolve();
+	}
+
+	stopProfiling() {
+		return this.sendCommand("Profiler.stop").then(({ profile }) => {
+			const hrtime = process.hrtime();
+			const endTime = hrtime[0] * 1000000 + Math.round(hrtime[1] / 1000);
+			if (profile.startTime < this._startTime || profile.endTime > endTime) {
+				// In some cases timestamps mismatch and we need to adjust them
+				// Both process.hrtime and the inspector timestamps claim to be relative
+				// to a unknown point in time. But they do not guarantee that this is the
+				// same point in time.
+				const duration = profile.endTime - profile.startTime;
+				const ownDuration = endTime - this._startTime;
+				const untracked = Math.max(0, ownDuration - duration);
+				profile.startTime = this._startTime + untracked / 2;
+				profile.endTime = endTime - untracked / 2;
+			}
+			return { profile };
+		});
+	}
+}
+
+/**
+ * an object that wraps Tracer and Profiler with a counter
+ * @typedef {Object} Trace
+ * @property {Tracer} trace instance of Tracer
+ * @property {number} counter Counter
+ * @property {Profiler} profiler instance of Profiler
+ * @property {Function} end the end function
+ */
+
+/**
+ * @param {IntermediateFileSystem} fs filesystem used for output
+ * @param {string} outputPath The location where to write the log.
+ * @returns {Trace} The trace object
+ */
+const createTrace = (fs, outputPath) => {
+	const trace = new Tracer();
+	const profiler = new Profiler(inspector);
+	if (/\/|\\/.test(outputPath)) {
+		const dirPath = dirname(fs, outputPath);
+		mkdirpSync(fs, dirPath);
+	}
+	const fsStream = fs.createWriteStream(outputPath);
+
+	let counter = 0;
+
+	trace.pipe(fsStream);
+	// These are critical events that need to be inserted so that tools like
+	// chrome dev tools can load the profile.
+	trace.instantEvent({
+		name: "TracingStartedInPage",
+		id: ++counter,
+		cat: ["disabled-by-default-devtools.timeline"],
+		args: {
+			data: {
+				sessionId: "-1",
+				page: "0xfff",
+				frames: [
+					{
+						frame: "0xfff",
+						url: "webpack",
+						name: ""
+					}
+				]
+			}
+		}
+	});
+
+	trace.instantEvent({
+		name: "TracingStartedInBrowser",
+		id: ++counter,
+		cat: ["disabled-by-default-devtools.timeline"],
+		args: {
+			data: {
+				sessionId: "-1"
+			}
+		}
+	});
+
+	return {
+		trace,
+		counter,
+		profiler,
+		end: callback => {
+			trace.push("]");
+			// Wait until the write stream finishes.
+			fsStream.on("close", () => {
+				callback();
+			});
+			// Tear down the readable trace stream.
+			trace.push(null);
+		}
+	};
+};
+
+const pluginName = "ProfilingPlugin";
+
+class ProfilingPlugin {
+	/**
+	 * @param {ProfilingPluginOptions=} options options object
+	 */
+	constructor(options = {}) {
+		validate(options);
+		this.outputPath = options.outputPath || "events.json";
+	}
+
+	apply(compiler) {
+		const tracer = createTrace(
+			compiler.intermediateFileSystem,
+			this.outputPath
+		);
+		tracer.profiler.startProfiling();
+
+		// Compiler Hooks
+		Object.keys(compiler.hooks).forEach(hookName => {
+			const hook = compiler.hooks[hookName];
+			if (hook) {
+				hook.intercept(makeInterceptorFor("Compiler", tracer)(hookName));
+			}
+		});
+
+		Object.keys(compiler.resolverFactory.hooks).forEach(hookName => {
+			const hook = compiler.resolverFactory.hooks[hookName];
+			if (hook) {
+				hook.intercept(makeInterceptorFor("Resolver", tracer)(hookName));
+			}
+		});
+
+		compiler.hooks.compilation.tap(
+			pluginName,
+			(compilation, { normalModuleFactory, contextModuleFactory }) => {
+				interceptAllHooksFor(compilation, tracer, "Compilation");
+				interceptAllHooksFor(
+					normalModuleFactory,
+					tracer,
+					"Normal Module Factory"
+				);
+				interceptAllHooksFor(
+					contextModuleFactory,
+					tracer,
+					"Context Module Factory"
+				);
+				interceptAllParserHooks(normalModuleFactory, tracer);
+				interceptAllJavascriptModulesPluginHooks(compilation, tracer);
+			}
+		);
+
+		// We need to write out the CPU profile when we are all done.
+		compiler.hooks.done.tapAsync(
+			{
+				name: pluginName,
+				stage: Infinity
+			},
+			(stats, callback) => {
+				if (compiler.watchMode) return callback();
+				tracer.profiler.stopProfiling().then(parsedResults => {
+					if (parsedResults === undefined) {
+						tracer.profiler.destroy();
+						tracer.end(callback);
+						return;
+					}
+
+					const cpuStartTime = parsedResults.profile.startTime;
+					const cpuEndTime = parsedResults.profile.endTime;
+
+					tracer.trace.completeEvent({
+						name: "TaskQueueManager::ProcessTaskFromWorkQueue",
+						id: ++tracer.counter,
+						cat: ["toplevel"],
+						ts: cpuStartTime,
+						args: {
+							src_file: "../../ipc/ipc_moji_bootstrap.cc",
+							src_func: "Accept"
+						}
+					});
+
+					tracer.trace.completeEvent({
+						name: "EvaluateScript",
+						id: ++tracer.counter,
+						cat: ["devtools.timeline"],
+						ts: cpuStartTime,
+						dur: cpuEndTime - cpuStartTime,
+						args: {
+							data: {
+								url: "webpack",
+								lineNumber: 1,
+								columnNumber: 1,
+								frame: "0xFFF"
+							}
+						}
+					});
+
+					tracer.trace.instantEvent({
+						name: "CpuProfile",
+						id: ++tracer.counter,
+						cat: ["disabled-by-default-devtools.timeline"],
+						ts: cpuEndTime,
+						args: {
+							data: {
+								cpuProfile: parsedResults.profile
+							}
+						}
+					});
+
+					tracer.profiler.destroy();
+					tracer.end(callback);
+				});
+			}
+		);
+	}
+}
+
+const interceptAllHooksFor = (instance, tracer, logLabel) => {
+	if (Reflect.has(instance, "hooks")) {
+		Object.keys(instance.hooks).forEach(hookName => {
+			const hook = instance.hooks[hookName];
+			if (hook && !hook._fakeHook) {
+				hook.intercept(makeInterceptorFor(logLabel, tracer)(hookName));
+			}
+		});
+	}
+};
+
+const interceptAllParserHooks = (moduleFactory, tracer) => {
+	const moduleTypes = [
+		"javascript/auto",
+		"javascript/dynamic",
+		"javascript/esm",
+		"json",
+		"webassembly/async",
+		"webassembly/sync"
+	];
+
+	moduleTypes.forEach(moduleType => {
+		moduleFactory.hooks.parser
+			.for(moduleType)
+			.tap("ProfilingPlugin", (parser, parserOpts) => {
+				interceptAllHooksFor(parser, tracer, "Parser");
+			});
+	});
+};
+
+const interceptAllJavascriptModulesPluginHooks = (compilation, tracer) => {
+	interceptAllHooksFor(
+		{
+			hooks:
+				require("../javascript/JavascriptModulesPlugin").getCompilationHooks(
+					compilation
+				)
+		},
+		tracer,
+		"JavascriptModulesPlugin"
+	);
+};
+
+const makeInterceptorFor = (instance, tracer) => hookName => ({
+	register: tapInfo => {
+		const { name, type, fn } = tapInfo;
+		const newFn =
+			// Don't tap our own hooks to ensure stream can close cleanly
+			name === pluginName
+				? fn
+				: makeNewProfiledTapFn(hookName, tracer, {
+						name,
+						type,
+						fn
+				  });
+		return {
+			...tapInfo,
+			fn: newFn
+		};
+	}
+});
+
+// TODO improve typing
+/** @typedef {(...args: TODO[]) => void | Promise<TODO>} PluginFunction */
+
+/**
+ * @param {string} hookName Name of the hook to profile.
+ * @param {Trace} tracer The trace object.
+ * @param {object} options Options for the profiled fn.
+ * @param {string} options.name Plugin name
+ * @param {string} options.type Plugin type (sync | async | promise)
+ * @param {PluginFunction} options.fn Plugin function
+ * @returns {PluginFunction} Chainable hooked function.
+ */
+const makeNewProfiledTapFn = (hookName, tracer, { name, type, fn }) => {
+	const defaultCategory = ["blink.user_timing"];
+
+	switch (type) {
+		case "promise":
+			return (...args) => {
+				const id = ++tracer.counter;
+				tracer.trace.begin({
+					name,
+					id,
+					cat: defaultCategory
+				});
+				const promise = /** @type {Promise<*>} */ (fn(...args));
+				return promise.then(r => {
+					tracer.trace.end({
+						name,
+						id,
+						cat: defaultCategory
+					});
+					return r;
+				});
+			};
+		case "async":
+			return (...args) => {
+				const id = ++tracer.counter;
+				tracer.trace.begin({
+					name,
+					id,
+					cat: defaultCategory
+				});
+				const callback = args.pop();
+				fn(...args, (...r) => {
+					tracer.trace.end({
+						name,
+						id,
+						cat: defaultCategory
+					});
+					callback(...r);
+				});
+			};
+		case "sync":
+			return (...args) => {
+				const id = ++tracer.counter;
+				// Do not instrument ourself due to the CPU
+				// profile needing to be the last event in the trace.
+				if (name === pluginName) {
+					return fn(...args);
+				}
+
+				tracer.trace.begin({
+					name,
+					id,
+					cat: defaultCategory
+				});
+				let r;
+				try {
+					r = fn(...args);
+				} catch (error) {
+					tracer.trace.end({
+						name,
+						id,
+						cat: defaultCategory
+					});
+					throw error;
+				}
+				tracer.trace.end({
+					name,
+					id,
+					cat: defaultCategory
+				});
+				return r;
+			};
+		default:
+			break;
+	}
+};
+
+module.exports = ProfilingPlugin;
+module.exports.Profiler = Profiler;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDDefineDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDDefineDependency.js
new file mode 100644
index 0000000..1a0816a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDDefineDependency.js
@@ -0,0 +1,221 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+/** @type {Record<string, { definition: string, content: string, requests: string[] }>} */
+const DEFINITIONS = {
+	f: {
+		definition: "var __WEBPACK_AMD_DEFINE_RESULT__;",
+		content: `!(__WEBPACK_AMD_DEFINE_RESULT__ = (#).call(exports, __webpack_require__, exports, module),
+		__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__))`,
+		requests: [
+			RuntimeGlobals.require,
+			RuntimeGlobals.exports,
+			RuntimeGlobals.module
+		]
+	},
+	o: {
+		definition: "",
+		content: "!(module.exports = #)",
+		requests: [RuntimeGlobals.module]
+	},
+	of: {
+		definition:
+			"var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_RESULT__;",
+		content: `!(__WEBPACK_AMD_DEFINE_FACTORY__ = (#),
+		__WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ?
+		(__WEBPACK_AMD_DEFINE_FACTORY__.call(exports, __webpack_require__, exports, module)) :
+		__WEBPACK_AMD_DEFINE_FACTORY__),
+		__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__))`,
+		requests: [
+			RuntimeGlobals.require,
+			RuntimeGlobals.exports,
+			RuntimeGlobals.module
+		]
+	},
+	af: {
+		definition:
+			"var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;",
+		content: `!(__WEBPACK_AMD_DEFINE_ARRAY__ = #, __WEBPACK_AMD_DEFINE_RESULT__ = (#).apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__),
+		__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__))`,
+		requests: [RuntimeGlobals.exports, RuntimeGlobals.module]
+	},
+	ao: {
+		definition: "",
+		content: "!(#, module.exports = #)",
+		requests: [RuntimeGlobals.module]
+	},
+	aof: {
+		definition:
+			"var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;",
+		content: `!(__WEBPACK_AMD_DEFINE_ARRAY__ = #, __WEBPACK_AMD_DEFINE_FACTORY__ = (#),
+		__WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ?
+		(__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__)) : __WEBPACK_AMD_DEFINE_FACTORY__),
+		__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__))`,
+		requests: [RuntimeGlobals.exports, RuntimeGlobals.module]
+	},
+	lf: {
+		definition: "var XXX, XXXmodule;",
+		content:
+			"!(XXXmodule = { id: YYY, exports: {}, loaded: false }, XXX = (#).call(XXXmodule.exports, __webpack_require__, XXXmodule.exports, XXXmodule), XXXmodule.loaded = true, XXX === undefined && (XXX = XXXmodule.exports))",
+		requests: [RuntimeGlobals.require, RuntimeGlobals.module]
+	},
+	lo: {
+		definition: "var XXX;",
+		content: "!(XXX = #)",
+		requests: []
+	},
+	lof: {
+		definition: "var XXX, XXXfactory, XXXmodule;",
+		content:
+			"!(XXXfactory = (#), (typeof XXXfactory === 'function' ? ((XXXmodule = { id: YYY, exports: {}, loaded: false }), (XXX = XXXfactory.call(XXXmodule.exports, __webpack_require__, XXXmodule.exports, XXXmodule)), (XXXmodule.loaded = true), XXX === undefined && (XXX = XXXmodule.exports)) : XXX = XXXfactory))",
+		requests: [RuntimeGlobals.require, RuntimeGlobals.module]
+	},
+	laf: {
+		definition: "var __WEBPACK_AMD_DEFINE_ARRAY__, XXX, XXXexports;",
+		content:
+			"!(__WEBPACK_AMD_DEFINE_ARRAY__ = #, XXX = (#).apply(XXXexports = {}, __WEBPACK_AMD_DEFINE_ARRAY__), XXX === undefined && (XXX = XXXexports))",
+		requests: []
+	},
+	lao: {
+		definition: "var XXX;",
+		content: "!(#, XXX = #)",
+		requests: []
+	},
+	laof: {
+		definition: "var XXXarray, XXXfactory, XXXexports, XXX;",
+		content: `!(XXXarray = #, XXXfactory = (#),
+		(typeof XXXfactory === 'function' ?
+			((XXX = XXXfactory.apply(XXXexports = {}, XXXarray)), XXX === undefined && (XXX = XXXexports)) :
+			(XXX = XXXfactory)
+		))`,
+		requests: []
+	}
+};
+
+class AMDDefineDependency extends NullDependency {
+	constructor(range, arrayRange, functionRange, objectRange, namedModule) {
+		super();
+		this.range = range;
+		this.arrayRange = arrayRange;
+		this.functionRange = functionRange;
+		this.objectRange = objectRange;
+		this.namedModule = namedModule;
+		this.localModule = null;
+	}
+
+	get type() {
+		return "amd define";
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.arrayRange);
+		write(this.functionRange);
+		write(this.objectRange);
+		write(this.namedModule);
+		write(this.localModule);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		this.arrayRange = read();
+		this.functionRange = read();
+		this.objectRange = read();
+		this.namedModule = read();
+		this.localModule = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	AMDDefineDependency,
+	"webpack/lib/dependencies/AMDDefineDependency"
+);
+
+AMDDefineDependency.Template = class AMDDefineDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeRequirements }) {
+		const dep = /** @type {AMDDefineDependency} */ (dependency);
+		const branch = this.branch(dep);
+		const { definition, content, requests } = DEFINITIONS[branch];
+		for (const req of requests) {
+			runtimeRequirements.add(req);
+		}
+		this.replace(dep, source, definition, content);
+	}
+
+	localModuleVar(dependency) {
+		return (
+			dependency.localModule &&
+			dependency.localModule.used &&
+			dependency.localModule.variableName()
+		);
+	}
+
+	branch(dependency) {
+		const localModuleVar = this.localModuleVar(dependency) ? "l" : "";
+		const arrayRange = dependency.arrayRange ? "a" : "";
+		const objectRange = dependency.objectRange ? "o" : "";
+		const functionRange = dependency.functionRange ? "f" : "";
+		return localModuleVar + arrayRange + objectRange + functionRange;
+	}
+
+	replace(dependency, source, definition, text) {
+		const localModuleVar = this.localModuleVar(dependency);
+		if (localModuleVar) {
+			text = text.replace(/XXX/g, localModuleVar.replace(/\$/g, "$$$$"));
+			definition = definition.replace(
+				/XXX/g,
+				localModuleVar.replace(/\$/g, "$$$$")
+			);
+		}
+
+		if (dependency.namedModule) {
+			text = text.replace(/YYY/g, JSON.stringify(dependency.namedModule));
+		}
+
+		const texts = text.split("#");
+
+		if (definition) source.insert(0, definition);
+
+		let current = dependency.range[0];
+		if (dependency.arrayRange) {
+			source.replace(current, dependency.arrayRange[0] - 1, texts.shift());
+			current = dependency.arrayRange[1];
+		}
+
+		if (dependency.objectRange) {
+			source.replace(current, dependency.objectRange[0] - 1, texts.shift());
+			current = dependency.objectRange[1];
+		} else if (dependency.functionRange) {
+			source.replace(current, dependency.functionRange[0] - 1, texts.shift());
+			current = dependency.functionRange[1];
+		}
+		source.replace(current, dependency.range[1] - 1, texts.shift());
+		if (texts.length > 0) throw new Error("Implementation error");
+	}
+};
+
+module.exports = AMDDefineDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDDefineDependencyParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDDefineDependencyParserPlugin.js
new file mode 100644
index 0000000..7d1c7e9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDDefineDependencyParserPlugin.js
@@ -0,0 +1,354 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const AMDDefineDependency = require("./AMDDefineDependency");
+const AMDRequireArrayDependency = require("./AMDRequireArrayDependency");
+const AMDRequireContextDependency = require("./AMDRequireContextDependency");
+const AMDRequireItemDependency = require("./AMDRequireItemDependency");
+const ConstDependency = require("./ConstDependency");
+const ContextDependencyHelpers = require("./ContextDependencyHelpers");
+const DynamicExports = require("./DynamicExports");
+const LocalModuleDependency = require("./LocalModuleDependency");
+const { addLocalModule, getLocalModule } = require("./LocalModulesHelpers");
+
+const isBoundFunctionExpression = expr => {
+	if (expr.type !== "CallExpression") return false;
+	if (expr.callee.type !== "MemberExpression") return false;
+	if (expr.callee.computed) return false;
+	if (expr.callee.object.type !== "FunctionExpression") return false;
+	if (expr.callee.property.type !== "Identifier") return false;
+	if (expr.callee.property.name !== "bind") return false;
+	return true;
+};
+
+const isUnboundFunctionExpression = expr => {
+	if (expr.type === "FunctionExpression") return true;
+	if (expr.type === "ArrowFunctionExpression") return true;
+	return false;
+};
+
+const isCallable = expr => {
+	if (isUnboundFunctionExpression(expr)) return true;
+	if (isBoundFunctionExpression(expr)) return true;
+	return false;
+};
+
+class AMDDefineDependencyParserPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	apply(parser) {
+		parser.hooks.call
+			.for("define")
+			.tap(
+				"AMDDefineDependencyParserPlugin",
+				this.processCallDefine.bind(this, parser)
+			);
+	}
+
+	processArray(parser, expr, param, identifiers, namedModule) {
+		if (param.isArray()) {
+			param.items.forEach((param, idx) => {
+				if (
+					param.isString() &&
+					["require", "module", "exports"].includes(param.string)
+				)
+					identifiers[idx] = param.string;
+				const result = this.processItem(parser, expr, param, namedModule);
+				if (result === undefined) {
+					this.processContext(parser, expr, param);
+				}
+			});
+			return true;
+		} else if (param.isConstArray()) {
+			const deps = [];
+			param.array.forEach((request, idx) => {
+				let dep;
+				let localModule;
+				if (request === "require") {
+					identifiers[idx] = request;
+					dep = "__webpack_require__";
+				} else if (["exports", "module"].includes(request)) {
+					identifiers[idx] = request;
+					dep = request;
+				} else if ((localModule = getLocalModule(parser.state, request))) {
+					localModule.flagUsed();
+					dep = new LocalModuleDependency(localModule, undefined, false);
+					dep.loc = expr.loc;
+					parser.state.module.addPresentationalDependency(dep);
+				} else {
+					dep = this.newRequireItemDependency(request);
+					dep.loc = expr.loc;
+					dep.optional = !!parser.scope.inTry;
+					parser.state.current.addDependency(dep);
+				}
+				deps.push(dep);
+			});
+			const dep = this.newRequireArrayDependency(deps, param.range);
+			dep.loc = expr.loc;
+			dep.optional = !!parser.scope.inTry;
+			parser.state.module.addPresentationalDependency(dep);
+			return true;
+		}
+	}
+	processItem(parser, expr, param, namedModule) {
+		if (param.isConditional()) {
+			param.options.forEach(param => {
+				const result = this.processItem(parser, expr, param);
+				if (result === undefined) {
+					this.processContext(parser, expr, param);
+				}
+			});
+			return true;
+		} else if (param.isString()) {
+			let dep, localModule;
+			if (param.string === "require") {
+				dep = new ConstDependency("__webpack_require__", param.range, [
+					RuntimeGlobals.require
+				]);
+			} else if (param.string === "exports") {
+				dep = new ConstDependency("exports", param.range, [
+					RuntimeGlobals.exports
+				]);
+			} else if (param.string === "module") {
+				dep = new ConstDependency("module", param.range, [
+					RuntimeGlobals.module
+				]);
+			} else if (
+				(localModule = getLocalModule(parser.state, param.string, namedModule))
+			) {
+				localModule.flagUsed();
+				dep = new LocalModuleDependency(localModule, param.range, false);
+			} else {
+				dep = this.newRequireItemDependency(param.string, param.range);
+				dep.optional = !!parser.scope.inTry;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+			dep.loc = expr.loc;
+			parser.state.module.addPresentationalDependency(dep);
+			return true;
+		}
+	}
+	processContext(parser, expr, param) {
+		const dep = ContextDependencyHelpers.create(
+			AMDRequireContextDependency,
+			param.range,
+			param,
+			expr,
+			this.options,
+			{
+				category: "amd"
+			},
+			parser
+		);
+		if (!dep) return;
+		dep.loc = expr.loc;
+		dep.optional = !!parser.scope.inTry;
+		parser.state.current.addDependency(dep);
+		return true;
+	}
+
+	processCallDefine(parser, expr) {
+		let array, fn, obj, namedModule;
+		switch (expr.arguments.length) {
+			case 1:
+				if (isCallable(expr.arguments[0])) {
+					// define(f() {…})
+					fn = expr.arguments[0];
+				} else if (expr.arguments[0].type === "ObjectExpression") {
+					// define({…})
+					obj = expr.arguments[0];
+				} else {
+					// define(expr)
+					// unclear if function or object
+					obj = fn = expr.arguments[0];
+				}
+				break;
+			case 2:
+				if (expr.arguments[0].type === "Literal") {
+					namedModule = expr.arguments[0].value;
+					// define("…", …)
+					if (isCallable(expr.arguments[1])) {
+						// define("…", f() {…})
+						fn = expr.arguments[1];
+					} else if (expr.arguments[1].type === "ObjectExpression") {
+						// define("…", {…})
+						obj = expr.arguments[1];
+					} else {
+						// define("…", expr)
+						// unclear if function or object
+						obj = fn = expr.arguments[1];
+					}
+				} else {
+					array = expr.arguments[0];
+					if (isCallable(expr.arguments[1])) {
+						// define([…], f() {})
+						fn = expr.arguments[1];
+					} else if (expr.arguments[1].type === "ObjectExpression") {
+						// define([…], {…})
+						obj = expr.arguments[1];
+					} else {
+						// define([…], expr)
+						// unclear if function or object
+						obj = fn = expr.arguments[1];
+					}
+				}
+				break;
+			case 3:
+				// define("…", […], f() {…})
+				namedModule = expr.arguments[0].value;
+				array = expr.arguments[1];
+				if (isCallable(expr.arguments[2])) {
+					// define("…", […], f() {})
+					fn = expr.arguments[2];
+				} else if (expr.arguments[2].type === "ObjectExpression") {
+					// define("…", […], {…})
+					obj = expr.arguments[2];
+				} else {
+					// define("…", […], expr)
+					// unclear if function or object
+					obj = fn = expr.arguments[2];
+				}
+				break;
+			default:
+				return;
+		}
+		DynamicExports.bailout(parser.state);
+		let fnParams = null;
+		let fnParamsOffset = 0;
+		if (fn) {
+			if (isUnboundFunctionExpression(fn)) {
+				fnParams = fn.params;
+			} else if (isBoundFunctionExpression(fn)) {
+				fnParams = fn.callee.object.params;
+				fnParamsOffset = fn.arguments.length - 1;
+				if (fnParamsOffset < 0) {
+					fnParamsOffset = 0;
+				}
+			}
+		}
+		let fnRenames = new Map();
+		if (array) {
+			const identifiers = {};
+			const param = parser.evaluateExpression(array);
+			const result = this.processArray(
+				parser,
+				expr,
+				param,
+				identifiers,
+				namedModule
+			);
+			if (!result) return;
+			if (fnParams) {
+				fnParams = fnParams.slice(fnParamsOffset).filter((param, idx) => {
+					if (identifiers[idx]) {
+						fnRenames.set(param.name, parser.getVariableInfo(identifiers[idx]));
+						return false;
+					}
+					return true;
+				});
+			}
+		} else {
+			const identifiers = ["require", "exports", "module"];
+			if (fnParams) {
+				fnParams = fnParams.slice(fnParamsOffset).filter((param, idx) => {
+					if (identifiers[idx]) {
+						fnRenames.set(param.name, parser.getVariableInfo(identifiers[idx]));
+						return false;
+					}
+					return true;
+				});
+			}
+		}
+		let inTry;
+		if (fn && isUnboundFunctionExpression(fn)) {
+			inTry = parser.scope.inTry;
+			parser.inScope(fnParams, () => {
+				for (const [name, varInfo] of fnRenames) {
+					parser.setVariable(name, varInfo);
+				}
+				parser.scope.inTry = inTry;
+				if (fn.body.type === "BlockStatement") {
+					parser.detectMode(fn.body.body);
+					const prev = parser.prevStatement;
+					parser.preWalkStatement(fn.body);
+					parser.prevStatement = prev;
+					parser.walkStatement(fn.body);
+				} else {
+					parser.walkExpression(fn.body);
+				}
+			});
+		} else if (fn && isBoundFunctionExpression(fn)) {
+			inTry = parser.scope.inTry;
+			parser.inScope(
+				fn.callee.object.params.filter(
+					i => !["require", "module", "exports"].includes(i.name)
+				),
+				() => {
+					for (const [name, varInfo] of fnRenames) {
+						parser.setVariable(name, varInfo);
+					}
+					parser.scope.inTry = inTry;
+					if (fn.callee.object.body.type === "BlockStatement") {
+						parser.detectMode(fn.callee.object.body.body);
+						const prev = parser.prevStatement;
+						parser.preWalkStatement(fn.callee.object.body);
+						parser.prevStatement = prev;
+						parser.walkStatement(fn.callee.object.body);
+					} else {
+						parser.walkExpression(fn.callee.object.body);
+					}
+				}
+			);
+			if (fn.arguments) {
+				parser.walkExpressions(fn.arguments);
+			}
+		} else if (fn || obj) {
+			parser.walkExpression(fn || obj);
+		}
+
+		const dep = this.newDefineDependency(
+			expr.range,
+			array ? array.range : null,
+			fn ? fn.range : null,
+			obj ? obj.range : null,
+			namedModule ? namedModule : null
+		);
+		dep.loc = expr.loc;
+		if (namedModule) {
+			dep.localModule = addLocalModule(parser.state, namedModule);
+		}
+		parser.state.module.addPresentationalDependency(dep);
+		return true;
+	}
+
+	newDefineDependency(
+		range,
+		arrayRange,
+		functionRange,
+		objectRange,
+		namedModule
+	) {
+		return new AMDDefineDependency(
+			range,
+			arrayRange,
+			functionRange,
+			objectRange,
+			namedModule
+		);
+	}
+	newRequireArrayDependency(depsArray, range) {
+		return new AMDRequireArrayDependency(depsArray, range);
+	}
+	newRequireItemDependency(request, range) {
+		return new AMDRequireItemDependency(request, range);
+	}
+}
+module.exports = AMDDefineDependencyParserPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDPlugin.js
new file mode 100644
index 0000000..57959e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDPlugin.js
@@ -0,0 +1,216 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const {
+	approve,
+	evaluateToIdentifier,
+	evaluateToString,
+	toConstantDependency
+} = require("../javascript/JavascriptParserHelpers");
+
+const AMDDefineDependency = require("./AMDDefineDependency");
+const AMDDefineDependencyParserPlugin = require("./AMDDefineDependencyParserPlugin");
+const AMDRequireArrayDependency = require("./AMDRequireArrayDependency");
+const AMDRequireContextDependency = require("./AMDRequireContextDependency");
+const AMDRequireDependenciesBlockParserPlugin = require("./AMDRequireDependenciesBlockParserPlugin");
+const AMDRequireDependency = require("./AMDRequireDependency");
+const AMDRequireItemDependency = require("./AMDRequireItemDependency");
+const {
+	AMDDefineRuntimeModule,
+	AMDOptionsRuntimeModule
+} = require("./AMDRuntimeModules");
+const ConstDependency = require("./ConstDependency");
+const LocalModuleDependency = require("./LocalModuleDependency");
+const UnsupportedDependency = require("./UnsupportedDependency");
+
+/** @typedef {import("../../declarations/WebpackOptions").ModuleOptionsNormalized} ModuleOptions */
+/** @typedef {import("../Compiler")} Compiler */
+
+class AMDPlugin {
+	/**
+	 * @param {Record<string, any>} amdOptions the AMD options
+	 */
+	constructor(amdOptions) {
+		this.amdOptions = amdOptions;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const amdOptions = this.amdOptions;
+		compiler.hooks.compilation.tap(
+			"AMDPlugin",
+			(compilation, { contextModuleFactory, normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					AMDRequireDependency,
+					new AMDRequireDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					AMDRequireItemDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					AMDRequireItemDependency,
+					new AMDRequireItemDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					AMDRequireArrayDependency,
+					new AMDRequireArrayDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					AMDRequireContextDependency,
+					contextModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					AMDRequireContextDependency,
+					new AMDRequireContextDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					AMDDefineDependency,
+					new AMDDefineDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					UnsupportedDependency,
+					new UnsupportedDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					LocalModuleDependency,
+					new LocalModuleDependency.Template()
+				);
+
+				compilation.hooks.runtimeRequirementInModule
+					.for(RuntimeGlobals.amdDefine)
+					.tap("AMDPlugin", (module, set) => {
+						set.add(RuntimeGlobals.require);
+					});
+
+				compilation.hooks.runtimeRequirementInModule
+					.for(RuntimeGlobals.amdOptions)
+					.tap("AMDPlugin", (module, set) => {
+						set.add(RuntimeGlobals.requireScope);
+					});
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.amdDefine)
+					.tap("AMDPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(chunk, new AMDDefineRuntimeModule());
+					});
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.amdOptions)
+					.tap("AMDPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(
+							chunk,
+							new AMDOptionsRuntimeModule(amdOptions)
+						);
+					});
+
+				const handler = (parser, parserOptions) => {
+					if (parserOptions.amd !== undefined && !parserOptions.amd) return;
+
+					const tapOptionsHooks = (optionExpr, rootName, getMembers) => {
+						parser.hooks.expression
+							.for(optionExpr)
+							.tap(
+								"AMDPlugin",
+								toConstantDependency(parser, RuntimeGlobals.amdOptions, [
+									RuntimeGlobals.amdOptions
+								])
+							);
+						parser.hooks.evaluateIdentifier
+							.for(optionExpr)
+							.tap(
+								"AMDPlugin",
+								evaluateToIdentifier(optionExpr, rootName, getMembers, true)
+							);
+						parser.hooks.evaluateTypeof
+							.for(optionExpr)
+							.tap("AMDPlugin", evaluateToString("object"));
+						parser.hooks.typeof
+							.for(optionExpr)
+							.tap(
+								"AMDPlugin",
+								toConstantDependency(parser, JSON.stringify("object"))
+							);
+					};
+
+					new AMDRequireDependenciesBlockParserPlugin(parserOptions).apply(
+						parser
+					);
+					new AMDDefineDependencyParserPlugin(parserOptions).apply(parser);
+
+					tapOptionsHooks("define.amd", "define", () => "amd");
+					tapOptionsHooks("require.amd", "require", () => ["amd"]);
+					tapOptionsHooks(
+						"__webpack_amd_options__",
+						"__webpack_amd_options__",
+						() => []
+					);
+
+					parser.hooks.expression.for("define").tap("AMDPlugin", expr => {
+						const dep = new ConstDependency(
+							RuntimeGlobals.amdDefine,
+							expr.range,
+							[RuntimeGlobals.amdDefine]
+						);
+						dep.loc = expr.loc;
+						parser.state.module.addPresentationalDependency(dep);
+						return true;
+					});
+					parser.hooks.typeof
+						.for("define")
+						.tap(
+							"AMDPlugin",
+							toConstantDependency(parser, JSON.stringify("function"))
+						);
+					parser.hooks.evaluateTypeof
+						.for("define")
+						.tap("AMDPlugin", evaluateToString("function"));
+					parser.hooks.canRename.for("define").tap("AMDPlugin", approve);
+					parser.hooks.rename.for("define").tap("AMDPlugin", expr => {
+						const dep = new ConstDependency(
+							RuntimeGlobals.amdDefine,
+							expr.range,
+							[RuntimeGlobals.amdDefine]
+						);
+						dep.loc = expr.loc;
+						parser.state.module.addPresentationalDependency(dep);
+						return false;
+					});
+					parser.hooks.typeof
+						.for("require")
+						.tap(
+							"AMDPlugin",
+							toConstantDependency(parser, JSON.stringify("function"))
+						);
+					parser.hooks.evaluateTypeof
+						.for("require")
+						.tap("AMDPlugin", evaluateToString("function"));
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("AMDPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("AMDPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = AMDPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireArrayDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireArrayDependency.js
new file mode 100644
index 0000000..d62938d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireArrayDependency.js
@@ -0,0 +1,99 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DependencyTemplate = require("../DependencyTemplate");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class AMDRequireArrayDependency extends NullDependency {
+	constructor(depsArray, range) {
+		super();
+
+		this.depsArray = depsArray;
+		this.range = range;
+	}
+
+	get type() {
+		return "amd require array";
+	}
+
+	get category() {
+		return "amd";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.depsArray);
+		write(this.range);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.depsArray = read();
+		this.range = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	AMDRequireArrayDependency,
+	"webpack/lib/dependencies/AMDRequireArrayDependency"
+);
+
+AMDRequireArrayDependency.Template = class AMDRequireArrayDependencyTemplate extends (
+	DependencyTemplate
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {AMDRequireArrayDependency} */ (dependency);
+		const content = this.getContent(dep, templateContext);
+		source.replace(dep.range[0], dep.range[1] - 1, content);
+	}
+
+	getContent(dep, templateContext) {
+		const requires = dep.depsArray.map(dependency => {
+			return this.contentForDependency(dependency, templateContext);
+		});
+		return `[${requires.join(", ")}]`;
+	}
+
+	contentForDependency(
+		dep,
+		{ runtimeTemplate, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		if (typeof dep === "string") {
+			return dep;
+		}
+
+		if (dep.localModule) {
+			return dep.localModule.variableName();
+		} else {
+			return runtimeTemplate.moduleExports({
+				module: moduleGraph.getModule(dep),
+				chunkGraph,
+				request: dep.request,
+				runtimeRequirements
+			});
+		}
+	}
+};
+
+module.exports = AMDRequireArrayDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireContextDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireContextDependency.js
new file mode 100644
index 0000000..0d68a26
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireContextDependency.js
@@ -0,0 +1,53 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ContextDependency = require("./ContextDependency");
+
+class AMDRequireContextDependency extends ContextDependency {
+	constructor(options, range, valueRange) {
+		super(options);
+
+		this.range = range;
+		this.valueRange = valueRange;
+	}
+
+	get type() {
+		return "amd require context";
+	}
+
+	get category() {
+		return "amd";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.range);
+		write(this.valueRange);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.range = read();
+		this.valueRange = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	AMDRequireContextDependency,
+	"webpack/lib/dependencies/AMDRequireContextDependency"
+);
+
+AMDRequireContextDependency.Template = require("./ContextDependencyTemplateAsRequireCall");
+
+module.exports = AMDRequireContextDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependenciesBlock.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependenciesBlock.js
new file mode 100644
index 0000000..eebe0bc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependenciesBlock.js
@@ -0,0 +1,22 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const makeSerializable = require("../util/makeSerializable");
+
+class AMDRequireDependenciesBlock extends AsyncDependenciesBlock {
+	constructor(loc, request) {
+		super(null, loc, request);
+	}
+}
+
+makeSerializable(
+	AMDRequireDependenciesBlock,
+	"webpack/lib/dependencies/AMDRequireDependenciesBlock"
+);
+
+module.exports = AMDRequireDependenciesBlock;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependenciesBlockParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependenciesBlockParserPlugin.js
new file mode 100644
index 0000000..f49f55b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependenciesBlockParserPlugin.js
@@ -0,0 +1,279 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const UnsupportedFeatureWarning = require("../UnsupportedFeatureWarning");
+const AMDRequireArrayDependency = require("./AMDRequireArrayDependency");
+const AMDRequireContextDependency = require("./AMDRequireContextDependency");
+const AMDRequireDependenciesBlock = require("./AMDRequireDependenciesBlock");
+const AMDRequireDependency = require("./AMDRequireDependency");
+const AMDRequireItemDependency = require("./AMDRequireItemDependency");
+const ConstDependency = require("./ConstDependency");
+const ContextDependencyHelpers = require("./ContextDependencyHelpers");
+const LocalModuleDependency = require("./LocalModuleDependency");
+const { getLocalModule } = require("./LocalModulesHelpers");
+const UnsupportedDependency = require("./UnsupportedDependency");
+const getFunctionExpression = require("./getFunctionExpression");
+
+class AMDRequireDependenciesBlockParserPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	processFunctionArgument(parser, expression) {
+		let bindThis = true;
+		const fnData = getFunctionExpression(expression);
+		if (fnData) {
+			parser.inScope(
+				fnData.fn.params.filter(i => {
+					return !["require", "module", "exports"].includes(i.name);
+				}),
+				() => {
+					if (fnData.fn.body.type === "BlockStatement") {
+						parser.walkStatement(fnData.fn.body);
+					} else {
+						parser.walkExpression(fnData.fn.body);
+					}
+				}
+			);
+			parser.walkExpressions(fnData.expressions);
+			if (fnData.needThis === false) {
+				bindThis = false;
+			}
+		} else {
+			parser.walkExpression(expression);
+		}
+		return bindThis;
+	}
+
+	apply(parser) {
+		parser.hooks.call
+			.for("require")
+			.tap(
+				"AMDRequireDependenciesBlockParserPlugin",
+				this.processCallRequire.bind(this, parser)
+			);
+	}
+
+	processArray(parser, expr, param) {
+		if (param.isArray()) {
+			for (const p of param.items) {
+				const result = this.processItem(parser, expr, p);
+				if (result === undefined) {
+					this.processContext(parser, expr, p);
+				}
+			}
+			return true;
+		} else if (param.isConstArray()) {
+			const deps = [];
+			for (const request of param.array) {
+				let dep, localModule;
+				if (request === "require") {
+					dep = "__webpack_require__";
+				} else if (["exports", "module"].includes(request)) {
+					dep = request;
+				} else if ((localModule = getLocalModule(parser.state, request))) {
+					localModule.flagUsed();
+					dep = new LocalModuleDependency(localModule, undefined, false);
+					dep.loc = expr.loc;
+					parser.state.module.addPresentationalDependency(dep);
+				} else {
+					dep = this.newRequireItemDependency(request);
+					dep.loc = expr.loc;
+					dep.optional = !!parser.scope.inTry;
+					parser.state.current.addDependency(dep);
+				}
+				deps.push(dep);
+			}
+			const dep = this.newRequireArrayDependency(deps, param.range);
+			dep.loc = expr.loc;
+			dep.optional = !!parser.scope.inTry;
+			parser.state.module.addPresentationalDependency(dep);
+			return true;
+		}
+	}
+	processItem(parser, expr, param) {
+		if (param.isConditional()) {
+			for (const p of param.options) {
+				const result = this.processItem(parser, expr, p);
+				if (result === undefined) {
+					this.processContext(parser, expr, p);
+				}
+			}
+			return true;
+		} else if (param.isString()) {
+			let dep, localModule;
+			if (param.string === "require") {
+				dep = new ConstDependency("__webpack_require__", param.string, [
+					RuntimeGlobals.require
+				]);
+			} else if (param.string === "module") {
+				dep = new ConstDependency(
+					parser.state.module.buildInfo.moduleArgument,
+					param.range,
+					[RuntimeGlobals.module]
+				);
+			} else if (param.string === "exports") {
+				dep = new ConstDependency(
+					parser.state.module.buildInfo.exportsArgument,
+					param.range,
+					[RuntimeGlobals.exports]
+				);
+			} else if ((localModule = getLocalModule(parser.state, param.string))) {
+				localModule.flagUsed();
+				dep = new LocalModuleDependency(localModule, param.range, false);
+			} else {
+				dep = this.newRequireItemDependency(param.string, param.range);
+				dep.loc = expr.loc;
+				dep.optional = !!parser.scope.inTry;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+			dep.loc = expr.loc;
+			parser.state.module.addPresentationalDependency(dep);
+			return true;
+		}
+	}
+	processContext(parser, expr, param) {
+		const dep = ContextDependencyHelpers.create(
+			AMDRequireContextDependency,
+			param.range,
+			param,
+			expr,
+			this.options,
+			{
+				category: "amd"
+			},
+			parser
+		);
+		if (!dep) return;
+		dep.loc = expr.loc;
+		dep.optional = !!parser.scope.inTry;
+		parser.state.current.addDependency(dep);
+		return true;
+	}
+
+	processArrayForRequestString(param) {
+		if (param.isArray()) {
+			const result = param.items.map(item =>
+				this.processItemForRequestString(item)
+			);
+			if (result.every(Boolean)) return result.join(" ");
+		} else if (param.isConstArray()) {
+			return param.array.join(" ");
+		}
+	}
+
+	processItemForRequestString(param) {
+		if (param.isConditional()) {
+			const result = param.options.map(item =>
+				this.processItemForRequestString(item)
+			);
+			if (result.every(Boolean)) return result.join("|");
+		} else if (param.isString()) {
+			return param.string;
+		}
+	}
+
+	processCallRequire(parser, expr) {
+		let param;
+		let depBlock;
+		let dep;
+		let result;
+
+		const old = parser.state.current;
+
+		if (expr.arguments.length >= 1) {
+			param = parser.evaluateExpression(expr.arguments[0]);
+			depBlock = this.newRequireDependenciesBlock(
+				expr.loc,
+				this.processArrayForRequestString(param)
+			);
+			dep = this.newRequireDependency(
+				expr.range,
+				param.range,
+				expr.arguments.length > 1 ? expr.arguments[1].range : null,
+				expr.arguments.length > 2 ? expr.arguments[2].range : null
+			);
+			dep.loc = expr.loc;
+			depBlock.addDependency(dep);
+
+			parser.state.current = depBlock;
+		}
+
+		if (expr.arguments.length === 1) {
+			parser.inScope([], () => {
+				result = this.processArray(parser, expr, param);
+			});
+			parser.state.current = old;
+			if (!result) return;
+			parser.state.current.addBlock(depBlock);
+			return true;
+		}
+
+		if (expr.arguments.length === 2 || expr.arguments.length === 3) {
+			try {
+				parser.inScope([], () => {
+					result = this.processArray(parser, expr, param);
+				});
+				if (!result) {
+					const dep = new UnsupportedDependency("unsupported", expr.range);
+					old.addPresentationalDependency(dep);
+					if (parser.state.module) {
+						parser.state.module.addError(
+							new UnsupportedFeatureWarning(
+								"Cannot statically analyse 'require(…, …)' in line " +
+									expr.loc.start.line,
+								expr.loc
+							)
+						);
+					}
+					depBlock = null;
+					return true;
+				}
+				dep.functionBindThis = this.processFunctionArgument(
+					parser,
+					expr.arguments[1]
+				);
+				if (expr.arguments.length === 3) {
+					dep.errorCallbackBindThis = this.processFunctionArgument(
+						parser,
+						expr.arguments[2]
+					);
+				}
+			} finally {
+				parser.state.current = old;
+				if (depBlock) parser.state.current.addBlock(depBlock);
+			}
+			return true;
+		}
+	}
+
+	newRequireDependenciesBlock(loc, request) {
+		return new AMDRequireDependenciesBlock(loc, request);
+	}
+	newRequireDependency(
+		outerRange,
+		arrayRange,
+		functionRange,
+		errorCallbackRange
+	) {
+		return new AMDRequireDependency(
+			outerRange,
+			arrayRange,
+			functionRange,
+			errorCallbackRange
+		);
+	}
+	newRequireItemDependency(request, range) {
+		return new AMDRequireItemDependency(request, range);
+	}
+	newRequireArrayDependency(depsArray, range) {
+		return new AMDRequireArrayDependency(depsArray, range);
+	}
+}
+module.exports = AMDRequireDependenciesBlockParserPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependency.js
new file mode 100644
index 0000000..e6e3f4c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireDependency.js
@@ -0,0 +1,174 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class AMDRequireDependency extends NullDependency {
+	constructor(outerRange, arrayRange, functionRange, errorCallbackRange) {
+		super();
+
+		this.outerRange = outerRange;
+		this.arrayRange = arrayRange;
+		this.functionRange = functionRange;
+		this.errorCallbackRange = errorCallbackRange;
+		this.functionBindThis = false;
+		this.errorCallbackBindThis = false;
+	}
+
+	get category() {
+		return "amd";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.outerRange);
+		write(this.arrayRange);
+		write(this.functionRange);
+		write(this.errorCallbackRange);
+		write(this.functionBindThis);
+		write(this.errorCallbackBindThis);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.outerRange = read();
+		this.arrayRange = read();
+		this.functionRange = read();
+		this.errorCallbackRange = read();
+		this.functionBindThis = read();
+		this.errorCallbackBindThis = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	AMDRequireDependency,
+	"webpack/lib/dependencies/AMDRequireDependency"
+);
+
+AMDRequireDependency.Template = class AMDRequireDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {AMDRequireDependency} */ (dependency);
+		const depBlock = /** @type {AsyncDependenciesBlock} */ (
+			moduleGraph.getParentBlock(dep)
+		);
+		const promise = runtimeTemplate.blockPromise({
+			chunkGraph,
+			block: depBlock,
+			message: "AMD require",
+			runtimeRequirements
+		});
+
+		// has array range but no function range
+		if (dep.arrayRange && !dep.functionRange) {
+			const startBlock = `${promise}.then(function() {`;
+			const endBlock = `;})['catch'](${RuntimeGlobals.uncaughtErrorHandler})`;
+			runtimeRequirements.add(RuntimeGlobals.uncaughtErrorHandler);
+
+			source.replace(dep.outerRange[0], dep.arrayRange[0] - 1, startBlock);
+
+			source.replace(dep.arrayRange[1], dep.outerRange[1] - 1, endBlock);
+
+			return;
+		}
+
+		// has function range but no array range
+		if (dep.functionRange && !dep.arrayRange) {
+			const startBlock = `${promise}.then((`;
+			const endBlock = `).bind(exports, __webpack_require__, exports, module))['catch'](${RuntimeGlobals.uncaughtErrorHandler})`;
+			runtimeRequirements.add(RuntimeGlobals.uncaughtErrorHandler);
+
+			source.replace(dep.outerRange[0], dep.functionRange[0] - 1, startBlock);
+
+			source.replace(dep.functionRange[1], dep.outerRange[1] - 1, endBlock);
+
+			return;
+		}
+
+		// has array range, function range, and errorCallbackRange
+		if (dep.arrayRange && dep.functionRange && dep.errorCallbackRange) {
+			const startBlock = `${promise}.then(function() { `;
+			const errorRangeBlock = `}${
+				dep.functionBindThis ? ".bind(this)" : ""
+			})['catch'](`;
+			const endBlock = `${dep.errorCallbackBindThis ? ".bind(this)" : ""})`;
+
+			source.replace(dep.outerRange[0], dep.arrayRange[0] - 1, startBlock);
+
+			source.insert(dep.arrayRange[0], "var __WEBPACK_AMD_REQUIRE_ARRAY__ = ");
+
+			source.replace(dep.arrayRange[1], dep.functionRange[0] - 1, "; (");
+
+			source.insert(
+				dep.functionRange[1],
+				").apply(null, __WEBPACK_AMD_REQUIRE_ARRAY__);"
+			);
+
+			source.replace(
+				dep.functionRange[1],
+				dep.errorCallbackRange[0] - 1,
+				errorRangeBlock
+			);
+
+			source.replace(
+				dep.errorCallbackRange[1],
+				dep.outerRange[1] - 1,
+				endBlock
+			);
+
+			return;
+		}
+
+		// has array range, function range, but no errorCallbackRange
+		if (dep.arrayRange && dep.functionRange) {
+			const startBlock = `${promise}.then(function() { `;
+			const endBlock = `}${
+				dep.functionBindThis ? ".bind(this)" : ""
+			})['catch'](${RuntimeGlobals.uncaughtErrorHandler})`;
+			runtimeRequirements.add(RuntimeGlobals.uncaughtErrorHandler);
+
+			source.replace(dep.outerRange[0], dep.arrayRange[0] - 1, startBlock);
+
+			source.insert(dep.arrayRange[0], "var __WEBPACK_AMD_REQUIRE_ARRAY__ = ");
+
+			source.replace(dep.arrayRange[1], dep.functionRange[0] - 1, "; (");
+
+			source.insert(
+				dep.functionRange[1],
+				").apply(null, __WEBPACK_AMD_REQUIRE_ARRAY__);"
+			);
+
+			source.replace(dep.functionRange[1], dep.outerRange[1] - 1, endBlock);
+		}
+	}
+};
+
+module.exports = AMDRequireDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireItemDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireItemDependency.js
new file mode 100644
index 0000000..c21d87b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRequireItemDependency.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const ModuleDependencyTemplateAsRequireId = require("./ModuleDependencyTemplateAsRequireId");
+
+class AMDRequireItemDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+
+		this.range = range;
+	}
+
+	get type() {
+		return "amd require";
+	}
+
+	get category() {
+		return "amd";
+	}
+}
+
+makeSerializable(
+	AMDRequireItemDependency,
+	"webpack/lib/dependencies/AMDRequireItemDependency"
+);
+
+AMDRequireItemDependency.Template = ModuleDependencyTemplateAsRequireId;
+
+module.exports = AMDRequireItemDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRuntimeModules.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRuntimeModules.js
new file mode 100644
index 0000000..b565e93
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/AMDRuntimeModules.js
@@ -0,0 +1,48 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class AMDDefineRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("amd define");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return Template.asString([
+			`${RuntimeGlobals.amdDefine} = function () {`,
+			Template.indent("throw new Error('define cannot be used indirect');"),
+			"};"
+		]);
+	}
+}
+
+class AMDOptionsRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {Record<string, boolean | number | string>} options the AMD options
+	 */
+	constructor(options) {
+		super("amd options");
+		this.options = options;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return Template.asString([
+			`${RuntimeGlobals.amdOptions} = ${JSON.stringify(this.options)};`
+		]);
+	}
+}
+
+exports.AMDDefineRuntimeModule = AMDDefineRuntimeModule;
+exports.AMDOptionsRuntimeModule = AMDOptionsRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CachedConstDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CachedConstDependency.js
new file mode 100644
index 0000000..1e07ede
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CachedConstDependency.js
@@ -0,0 +1,106 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const DependencyTemplate = require("../DependencyTemplate");
+const InitFragment = require("../InitFragment");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../util/Hash")} Hash */
+
+class CachedConstDependency extends NullDependency {
+	constructor(expression, range, identifier) {
+		super();
+
+		this.expression = expression;
+		this.range = range;
+		this.identifier = identifier;
+		this._hashUpdate = undefined;
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		if (this._hashUpdate === undefined)
+			this._hashUpdate = "" + this.identifier + this.range + this.expression;
+		hash.update(this._hashUpdate);
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.expression);
+		write(this.range);
+		write(this.identifier);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.expression = read();
+		this.range = read();
+		this.identifier = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	CachedConstDependency,
+	"webpack/lib/dependencies/CachedConstDependency"
+);
+
+CachedConstDependency.Template = class CachedConstDependencyTemplate extends (
+	DependencyTemplate
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, dependencyTemplates, initFragments }
+	) {
+		const dep = /** @type {CachedConstDependency} */ (dependency);
+
+		initFragments.push(
+			new InitFragment(
+				`var ${dep.identifier} = ${dep.expression};\n`,
+				InitFragment.STAGE_CONSTANTS,
+				0,
+				`const ${dep.identifier}`
+			)
+		);
+
+		if (typeof dep.range === "number") {
+			source.insert(dep.range, dep.identifier);
+
+			return;
+		}
+
+		source.replace(dep.range[0], dep.range[1] - 1, dep.identifier);
+	}
+};
+
+module.exports = CachedConstDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsDependencyHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsDependencyHelpers.js
new file mode 100644
index 0000000..e395559
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsDependencyHelpers.js
@@ -0,0 +1,49 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+
+exports.handleDependencyBase = (depBase, module, runtimeRequirements) => {
+	let base = undefined;
+	let type;
+	switch (depBase) {
+		case "exports":
+			runtimeRequirements.add(RuntimeGlobals.exports);
+			base = module.exportsArgument;
+			type = "expression";
+			break;
+		case "module.exports":
+			runtimeRequirements.add(RuntimeGlobals.module);
+			base = `${module.moduleArgument}.exports`;
+			type = "expression";
+			break;
+		case "this":
+			runtimeRequirements.add(RuntimeGlobals.thisAsExports);
+			base = "this";
+			type = "expression";
+			break;
+		case "Object.defineProperty(exports)":
+			runtimeRequirements.add(RuntimeGlobals.exports);
+			base = module.exportsArgument;
+			type = "Object.defineProperty";
+			break;
+		case "Object.defineProperty(module.exports)":
+			runtimeRequirements.add(RuntimeGlobals.module);
+			base = `${module.moduleArgument}.exports`;
+			type = "Object.defineProperty";
+			break;
+		case "Object.defineProperty(this)":
+			runtimeRequirements.add(RuntimeGlobals.thisAsExports);
+			base = "this";
+			type = "Object.defineProperty";
+			break;
+		default:
+			throw new Error(`Unsupported base ${depBase}`);
+	}
+
+	return [type, base];
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportRequireDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportRequireDependency.js
new file mode 100644
index 0000000..288e101
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportRequireDependency.js
@@ -0,0 +1,374 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const { UsageState } = require("../ExportsInfo");
+const Template = require("../Template");
+const { equals } = require("../util/ArrayHelpers");
+const makeSerializable = require("../util/makeSerializable");
+const propertyAccess = require("../util/propertyAccess");
+const { handleDependencyBase } = require("./CommonJsDependencyHelpers");
+const ModuleDependency = require("./ModuleDependency");
+const processExportInfo = require("./processExportInfo");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../Dependency").TRANSITIVE} TRANSITIVE */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+const idsSymbol = Symbol("CommonJsExportRequireDependency.ids");
+
+const EMPTY_OBJECT = {};
+
+class CommonJsExportRequireDependency extends ModuleDependency {
+	constructor(range, valueRange, base, names, request, ids, resultUsed) {
+		super(request);
+		this.range = range;
+		this.valueRange = valueRange;
+		this.base = base;
+		this.names = names;
+		this.ids = ids;
+		this.resultUsed = resultUsed;
+		this.asiSafe = undefined;
+	}
+
+	get type() {
+		return "cjs export require";
+	}
+
+	/**
+	 * @returns {boolean | TRANSITIVE} true, when changes to the referenced module could affect the referencing module; TRANSITIVE, when changes to the referenced module could affect referencing modules of the referencing module
+	 */
+	couldAffectReferencingModule() {
+		return Dependency.TRANSITIVE;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {string[]} the imported id
+	 */
+	getIds(moduleGraph) {
+		return moduleGraph.getMeta(this)[idsSymbol] || this.ids;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {string[]} ids the imported ids
+	 * @returns {void}
+	 */
+	setIds(moduleGraph, ids) {
+		moduleGraph.getMeta(this)[idsSymbol] = ids;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		const ids = this.getIds(moduleGraph);
+		const getFullResult = () => {
+			if (ids.length === 0) {
+				return Dependency.EXPORTS_OBJECT_REFERENCED;
+			} else {
+				return [
+					{
+						name: ids,
+						canMangle: false
+					}
+				];
+			}
+		};
+		if (this.resultUsed) return getFullResult();
+		let exportsInfo = moduleGraph.getExportsInfo(
+			moduleGraph.getParentModule(this)
+		);
+		for (const name of this.names) {
+			const exportInfo = exportsInfo.getReadOnlyExportInfo(name);
+			const used = exportInfo.getUsed(runtime);
+			if (used === UsageState.Unused) return Dependency.NO_EXPORTS_REFERENCED;
+			if (used !== UsageState.OnlyPropertiesUsed) return getFullResult();
+			exportsInfo = exportInfo.exportsInfo;
+			if (!exportsInfo) return getFullResult();
+		}
+		if (exportsInfo.otherExportsInfo.getUsed(runtime) !== UsageState.Unused) {
+			return getFullResult();
+		}
+		/** @type {string[][]} */
+		const referencedExports = [];
+		for (const exportInfo of exportsInfo.orderedExports) {
+			processExportInfo(
+				runtime,
+				referencedExports,
+				ids.concat(exportInfo.name),
+				exportInfo,
+				false
+			);
+		}
+		return referencedExports.map(name => ({
+			name,
+			canMangle: false
+		}));
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		const ids = this.getIds(moduleGraph);
+		if (this.names.length === 1) {
+			const name = this.names[0];
+			const from = moduleGraph.getConnection(this);
+			if (!from) return;
+			return {
+				exports: [
+					{
+						name,
+						from,
+						export: ids.length === 0 ? null : ids,
+						// we can't mangle names that are in an empty object
+						// because one could access the prototype property
+						// when export isn't set yet
+						canMangle: !(name in EMPTY_OBJECT) && false
+					}
+				],
+				dependencies: [from.module]
+			};
+		} else if (this.names.length > 0) {
+			const name = this.names[0];
+			return {
+				exports: [
+					{
+						name,
+						// we can't mangle names that are in an empty object
+						// because one could access the prototype property
+						// when export isn't set yet
+						canMangle: !(name in EMPTY_OBJECT) && false
+					}
+				],
+				dependencies: undefined
+			};
+		} else {
+			const from = moduleGraph.getConnection(this);
+			if (!from) return;
+			const reexportInfo = this.getStarReexports(
+				moduleGraph,
+				undefined,
+				from.module
+			);
+			if (reexportInfo) {
+				return {
+					exports: Array.from(reexportInfo.exports, name => {
+						return {
+							name,
+							from,
+							export: ids.concat(name),
+							canMangle: !(name in EMPTY_OBJECT) && false
+						};
+					}),
+					// TODO handle deep reexports
+					dependencies: [from.module]
+				};
+			} else {
+				return {
+					exports: true,
+					from: ids.length === 0 ? from : undefined,
+					canMangle: false,
+					dependencies: [from.module]
+				};
+			}
+		}
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {Module} importedModule the imported module (optional)
+	 * @returns {{exports?: Set<string>, checked?: Set<string>}} information
+	 */
+	getStarReexports(
+		moduleGraph,
+		runtime,
+		importedModule = moduleGraph.getModule(this)
+	) {
+		let importedExportsInfo = moduleGraph.getExportsInfo(importedModule);
+		const ids = this.getIds(moduleGraph);
+		if (ids.length > 0)
+			importedExportsInfo = importedExportsInfo.getNestedExportsInfo(ids);
+		let exportsInfo = moduleGraph.getExportsInfo(
+			moduleGraph.getParentModule(this)
+		);
+		if (this.names.length > 0)
+			exportsInfo = exportsInfo.getNestedExportsInfo(this.names);
+
+		const noExtraExports =
+			importedExportsInfo &&
+			importedExportsInfo.otherExportsInfo.provided === false;
+		const noExtraImports =
+			exportsInfo &&
+			exportsInfo.otherExportsInfo.getUsed(runtime) === UsageState.Unused;
+
+		if (!noExtraExports && !noExtraImports) {
+			return;
+		}
+
+		const isNamespaceImport =
+			importedModule.getExportsType(moduleGraph, false) === "namespace";
+
+		/** @type {Set<string>} */
+		const exports = new Set();
+		/** @type {Set<string>} */
+		const checked = new Set();
+
+		if (noExtraImports) {
+			for (const exportInfo of exportsInfo.orderedExports) {
+				const name = exportInfo.name;
+				if (exportInfo.getUsed(runtime) === UsageState.Unused) continue;
+				if (name === "__esModule" && isNamespaceImport) {
+					exports.add(name);
+				} else if (importedExportsInfo) {
+					const importedExportInfo =
+						importedExportsInfo.getReadOnlyExportInfo(name);
+					if (importedExportInfo.provided === false) continue;
+					exports.add(name);
+					if (importedExportInfo.provided === true) continue;
+					checked.add(name);
+				} else {
+					exports.add(name);
+					checked.add(name);
+				}
+			}
+		} else if (noExtraExports) {
+			for (const importedExportInfo of importedExportsInfo.orderedExports) {
+				const name = importedExportInfo.name;
+				if (importedExportInfo.provided === false) continue;
+				if (exportsInfo) {
+					const exportInfo = exportsInfo.getReadOnlyExportInfo(name);
+					if (exportInfo.getUsed(runtime) === UsageState.Unused) continue;
+				}
+				exports.add(name);
+				if (importedExportInfo.provided === true) continue;
+				checked.add(name);
+			}
+			if (isNamespaceImport) {
+				exports.add("__esModule");
+				checked.delete("__esModule");
+			}
+		}
+
+		return { exports, checked };
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.asiSafe);
+		write(this.range);
+		write(this.valueRange);
+		write(this.base);
+		write(this.names);
+		write(this.ids);
+		write(this.resultUsed);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.asiSafe = read();
+		this.range = read();
+		this.valueRange = read();
+		this.base = read();
+		this.names = read();
+		this.ids = read();
+		this.resultUsed = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	CommonJsExportRequireDependency,
+	"webpack/lib/dependencies/CommonJsExportRequireDependency"
+);
+
+CommonJsExportRequireDependency.Template = class CommonJsExportRequireDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{
+			module,
+			runtimeTemplate,
+			chunkGraph,
+			moduleGraph,
+			runtimeRequirements,
+			runtime
+		}
+	) {
+		const dep = /** @type {CommonJsExportRequireDependency} */ (dependency);
+		const used = moduleGraph
+			.getExportsInfo(module)
+			.getUsedName(dep.names, runtime);
+
+		const [type, base] = handleDependencyBase(
+			dep.base,
+			module,
+			runtimeRequirements
+		);
+
+		const importedModule = moduleGraph.getModule(dep);
+		let requireExpr = runtimeTemplate.moduleExports({
+			module: importedModule,
+			chunkGraph,
+			request: dep.request,
+			weak: dep.weak,
+			runtimeRequirements
+		});
+		if (importedModule) {
+			const ids = dep.getIds(moduleGraph);
+			const usedImported = moduleGraph
+				.getExportsInfo(importedModule)
+				.getUsedName(ids, runtime);
+			if (usedImported) {
+				const comment = equals(usedImported, ids)
+					? ""
+					: Template.toNormalComment(propertyAccess(ids)) + " ";
+				requireExpr += `${comment}${propertyAccess(usedImported)}`;
+			}
+		}
+
+		switch (type) {
+			case "expression":
+				source.replace(
+					dep.range[0],
+					dep.range[1] - 1,
+					used
+						? `${base}${propertyAccess(used)} = ${requireExpr}`
+						: `/* unused reexport */ ${requireExpr}`
+				);
+				return;
+			case "Object.defineProperty":
+				throw new Error("TODO");
+			default:
+				throw new Error("Unexpected type");
+		}
+	}
+};
+
+module.exports = CommonJsExportRequireDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportsDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportsDependency.js
new file mode 100644
index 0000000..0715582
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportsDependency.js
@@ -0,0 +1,160 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const InitFragment = require("../InitFragment");
+const makeSerializable = require("../util/makeSerializable");
+const propertyAccess = require("../util/propertyAccess");
+const { handleDependencyBase } = require("./CommonJsDependencyHelpers");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+
+const EMPTY_OBJECT = {};
+
+class CommonJsExportsDependency extends NullDependency {
+	constructor(range, valueRange, base, names) {
+		super();
+		this.range = range;
+		this.valueRange = valueRange;
+		this.base = base;
+		this.names = names;
+	}
+
+	get type() {
+		return "cjs exports";
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		const name = this.names[0];
+		return {
+			exports: [
+				{
+					name,
+					// we can't mangle names that are in an empty object
+					// because one could access the prototype property
+					// when export isn't set yet
+					canMangle: !(name in EMPTY_OBJECT)
+				}
+			],
+			dependencies: undefined
+		};
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.valueRange);
+		write(this.base);
+		write(this.names);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		this.valueRange = read();
+		this.base = read();
+		this.names = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	CommonJsExportsDependency,
+	"webpack/lib/dependencies/CommonJsExportsDependency"
+);
+
+CommonJsExportsDependency.Template = class CommonJsExportsDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ module, moduleGraph, initFragments, runtimeRequirements, runtime }
+	) {
+		const dep = /** @type {CommonJsExportsDependency} */ (dependency);
+		const used = moduleGraph
+			.getExportsInfo(module)
+			.getUsedName(dep.names, runtime);
+
+		const [type, base] = handleDependencyBase(
+			dep.base,
+			module,
+			runtimeRequirements
+		);
+
+		switch (type) {
+			case "expression":
+				if (!used) {
+					initFragments.push(
+						new InitFragment(
+							"var __webpack_unused_export__;\n",
+							InitFragment.STAGE_CONSTANTS,
+							0,
+							"__webpack_unused_export__"
+						)
+					);
+					source.replace(
+						dep.range[0],
+						dep.range[1] - 1,
+						"__webpack_unused_export__"
+					);
+					return;
+				}
+				source.replace(
+					dep.range[0],
+					dep.range[1] - 1,
+					`${base}${propertyAccess(used)}`
+				);
+				return;
+			case "Object.defineProperty":
+				if (!used) {
+					initFragments.push(
+						new InitFragment(
+							"var __webpack_unused_export__;\n",
+							InitFragment.STAGE_CONSTANTS,
+							0,
+							"__webpack_unused_export__"
+						)
+					);
+					source.replace(
+						dep.range[0],
+						dep.valueRange[0] - 1,
+						"__webpack_unused_export__ = ("
+					);
+					source.replace(dep.valueRange[1], dep.range[1] - 1, ")");
+					return;
+				}
+				source.replace(
+					dep.range[0],
+					dep.valueRange[0] - 1,
+					`Object.defineProperty(${base}${propertyAccess(
+						used.slice(0, -1)
+					)}, ${JSON.stringify(used[used.length - 1])}, (`
+				);
+				source.replace(dep.valueRange[1], dep.range[1] - 1, "))");
+				return;
+		}
+	}
+};
+
+module.exports = CommonJsExportsDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportsParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportsParserPlugin.js
new file mode 100644
index 0000000..a0be15e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsExportsParserPlugin.js
@@ -0,0 +1,336 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const formatLocation = require("../formatLocation");
+const { evaluateToString } = require("../javascript/JavascriptParserHelpers");
+const propertyAccess = require("../util/propertyAccess");
+const CommonJsExportRequireDependency = require("./CommonJsExportRequireDependency");
+const CommonJsExportsDependency = require("./CommonJsExportsDependency");
+const CommonJsSelfReferenceDependency = require("./CommonJsSelfReferenceDependency");
+const DynamicExports = require("./DynamicExports");
+const HarmonyExports = require("./HarmonyExports");
+const ModuleDecoratorDependency = require("./ModuleDecoratorDependency");
+
+/** @typedef {import("estree").Expression} ExpressionNode */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../javascript/BasicEvaluatedExpression")} BasicEvaluatedExpression */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+
+const getValueOfPropertyDescription = expr => {
+	if (expr.type !== "ObjectExpression") return;
+	for (const property of expr.properties) {
+		if (property.computed) continue;
+		const key = property.key;
+		if (key.type !== "Identifier" || key.name !== "value") continue;
+		return property.value;
+	}
+};
+
+const isTruthyLiteral = expr => {
+	switch (expr.type) {
+		case "Literal":
+			return !!expr.value;
+		case "UnaryExpression":
+			if (expr.operator === "!") return isFalsyLiteral(expr.argument);
+	}
+	return false;
+};
+
+const isFalsyLiteral = expr => {
+	switch (expr.type) {
+		case "Literal":
+			return !expr.value;
+		case "UnaryExpression":
+			if (expr.operator === "!") return isTruthyLiteral(expr.argument);
+	}
+	return false;
+};
+
+/**
+ * @param {JavascriptParser} parser the parser
+ * @param {ExpressionNode} expr expression
+ * @returns {{ argument: BasicEvaluatedExpression, ids: string[] } | undefined} parsed call
+ */
+const parseRequireCall = (parser, expr) => {
+	const ids = [];
+	while (expr.type === "MemberExpression") {
+		if (expr.object.type === "Super") return;
+		if (!expr.property) return;
+		const prop = expr.property;
+		if (expr.computed) {
+			if (prop.type !== "Literal") return;
+			ids.push(`${prop.value}`);
+		} else {
+			if (prop.type !== "Identifier") return;
+			ids.push(prop.name);
+		}
+		expr = expr.object;
+	}
+	if (expr.type !== "CallExpression" || expr.arguments.length !== 1) return;
+	const callee = expr.callee;
+	if (
+		callee.type !== "Identifier" ||
+		parser.getVariableInfo(callee.name) !== "require"
+	) {
+		return;
+	}
+	const arg = expr.arguments[0];
+	if (arg.type === "SpreadElement") return;
+	const argValue = parser.evaluateExpression(arg);
+	return { argument: argValue, ids: ids.reverse() };
+};
+
+class CommonJsExportsParserPlugin {
+	constructor(moduleGraph) {
+		this.moduleGraph = moduleGraph;
+	}
+
+	/**
+	 * @param {JavascriptParser} parser the parser
+	 */
+	apply(parser) {
+		const enableStructuredExports = () => {
+			DynamicExports.enable(parser.state);
+		};
+		const checkNamespace = (topLevel, members, valueExpr) => {
+			if (!DynamicExports.isEnabled(parser.state)) return;
+			if (members.length > 0 && members[0] === "__esModule") {
+				if (valueExpr && isTruthyLiteral(valueExpr) && topLevel) {
+					DynamicExports.setFlagged(parser.state);
+				} else {
+					DynamicExports.setDynamic(parser.state);
+				}
+			}
+		};
+		const bailout = reason => {
+			DynamicExports.bailout(parser.state);
+			if (reason) bailoutHint(reason);
+		};
+		const bailoutHint = reason => {
+			this.moduleGraph
+				.getOptimizationBailout(parser.state.module)
+				.push(`CommonJS bailout: ${reason}`);
+		};
+
+		// metadata //
+		parser.hooks.evaluateTypeof
+			.for("module")
+			.tap("CommonJsExportsParserPlugin", evaluateToString("object"));
+		parser.hooks.evaluateTypeof
+			.for("exports")
+			.tap("CommonJsPlugin", evaluateToString("object"));
+
+		// exporting //
+		const handleAssignExport = (expr, base, members) => {
+			if (HarmonyExports.isEnabled(parser.state)) return;
+			// Handle reexporting
+			const requireCall = parseRequireCall(parser, expr.right);
+			if (
+				requireCall &&
+				requireCall.argument.isString() &&
+				(members.length === 0 || members[0] !== "__esModule")
+			) {
+				enableStructuredExports();
+				// It's possible to reexport __esModule, so we must convert to a dynamic module
+				if (members.length === 0) DynamicExports.setDynamic(parser.state);
+				const dep = new CommonJsExportRequireDependency(
+					expr.range,
+					null,
+					base,
+					members,
+					requireCall.argument.string,
+					requireCall.ids,
+					!parser.isStatementLevelExpression(expr)
+				);
+				dep.loc = expr.loc;
+				dep.optional = !!parser.scope.inTry;
+				parser.state.module.addDependency(dep);
+				return true;
+			}
+			if (members.length === 0) return;
+			enableStructuredExports();
+			const remainingMembers = members;
+			checkNamespace(
+				parser.statementPath.length === 1 &&
+					parser.isStatementLevelExpression(expr),
+				remainingMembers,
+				expr.right
+			);
+			const dep = new CommonJsExportsDependency(
+				expr.left.range,
+				null,
+				base,
+				remainingMembers
+			);
+			dep.loc = expr.loc;
+			parser.state.module.addDependency(dep);
+			parser.walkExpression(expr.right);
+			return true;
+		};
+		parser.hooks.assignMemberChain
+			.for("exports")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				return handleAssignExport(expr, "exports", members);
+			});
+		parser.hooks.assignMemberChain
+			.for("this")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				if (!parser.scope.topLevelScope) return;
+				return handleAssignExport(expr, "this", members);
+			});
+		parser.hooks.assignMemberChain
+			.for("module")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				if (members[0] !== "exports") return;
+				return handleAssignExport(expr, "module.exports", members.slice(1));
+			});
+		parser.hooks.call
+			.for("Object.defineProperty")
+			.tap("CommonJsExportsParserPlugin", expression => {
+				const expr = /** @type {import("estree").CallExpression} */ (
+					expression
+				);
+				if (!parser.isStatementLevelExpression(expr)) return;
+				if (expr.arguments.length !== 3) return;
+				if (expr.arguments[0].type === "SpreadElement") return;
+				if (expr.arguments[1].type === "SpreadElement") return;
+				if (expr.arguments[2].type === "SpreadElement") return;
+				const exportsArg = parser.evaluateExpression(expr.arguments[0]);
+				if (!exportsArg || !exportsArg.isIdentifier()) return;
+				if (
+					exportsArg.identifier !== "exports" &&
+					exportsArg.identifier !== "module.exports" &&
+					(exportsArg.identifier !== "this" || !parser.scope.topLevelScope)
+				) {
+					return;
+				}
+				const propertyArg = parser.evaluateExpression(expr.arguments[1]);
+				if (!propertyArg) return;
+				const property = propertyArg.asString();
+				if (typeof property !== "string") return;
+				enableStructuredExports();
+				const descArg = expr.arguments[2];
+				checkNamespace(
+					parser.statementPath.length === 1,
+					[property],
+					getValueOfPropertyDescription(descArg)
+				);
+				const dep = new CommonJsExportsDependency(
+					expr.range,
+					expr.arguments[2].range,
+					`Object.defineProperty(${exportsArg.identifier})`,
+					[property]
+				);
+				dep.loc = expr.loc;
+				parser.state.module.addDependency(dep);
+
+				parser.walkExpression(expr.arguments[2]);
+				return true;
+			});
+
+		// Self reference //
+		const handleAccessExport = (expr, base, members, call = undefined) => {
+			if (HarmonyExports.isEnabled(parser.state)) return;
+			if (members.length === 0) {
+				bailout(`${base} is used directly at ${formatLocation(expr.loc)}`);
+			}
+			if (call && members.length === 1) {
+				bailoutHint(
+					`${base}${propertyAccess(
+						members
+					)}(...) prevents optimization as ${base} is passed as call context at ${formatLocation(
+						expr.loc
+					)}`
+				);
+			}
+			const dep = new CommonJsSelfReferenceDependency(
+				expr.range,
+				base,
+				members,
+				!!call
+			);
+			dep.loc = expr.loc;
+			parser.state.module.addDependency(dep);
+			if (call) {
+				parser.walkExpressions(call.arguments);
+			}
+			return true;
+		};
+		parser.hooks.callMemberChain
+			.for("exports")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				return handleAccessExport(expr.callee, "exports", members, expr);
+			});
+		parser.hooks.expressionMemberChain
+			.for("exports")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				return handleAccessExport(expr, "exports", members);
+			});
+		parser.hooks.expression
+			.for("exports")
+			.tap("CommonJsExportsParserPlugin", expr => {
+				return handleAccessExport(expr, "exports", []);
+			});
+		parser.hooks.callMemberChain
+			.for("module")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				if (members[0] !== "exports") return;
+				return handleAccessExport(
+					expr.callee,
+					"module.exports",
+					members.slice(1),
+					expr
+				);
+			});
+		parser.hooks.expressionMemberChain
+			.for("module")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				if (members[0] !== "exports") return;
+				return handleAccessExport(expr, "module.exports", members.slice(1));
+			});
+		parser.hooks.expression
+			.for("module.exports")
+			.tap("CommonJsExportsParserPlugin", expr => {
+				return handleAccessExport(expr, "module.exports", []);
+			});
+		parser.hooks.callMemberChain
+			.for("this")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				if (!parser.scope.topLevelScope) return;
+				return handleAccessExport(expr.callee, "this", members, expr);
+			});
+		parser.hooks.expressionMemberChain
+			.for("this")
+			.tap("CommonJsExportsParserPlugin", (expr, members) => {
+				if (!parser.scope.topLevelScope) return;
+				return handleAccessExport(expr, "this", members);
+			});
+		parser.hooks.expression
+			.for("this")
+			.tap("CommonJsExportsParserPlugin", expr => {
+				if (!parser.scope.topLevelScope) return;
+				return handleAccessExport(expr, "this", []);
+			});
+
+		// Bailouts //
+		parser.hooks.expression.for("module").tap("CommonJsPlugin", expr => {
+			bailout();
+			const isHarmony = HarmonyExports.isEnabled(parser.state);
+			const dep = new ModuleDecoratorDependency(
+				isHarmony
+					? RuntimeGlobals.harmonyModuleDecorator
+					: RuntimeGlobals.nodeModuleDecorator,
+				!isHarmony
+			);
+			dep.loc = expr.loc;
+			parser.state.module.addDependency(dep);
+			return true;
+		});
+	}
+}
+module.exports = CommonJsExportsParserPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsFullRequireDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsFullRequireDependency.js
new file mode 100644
index 0000000..68da6a1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsFullRequireDependency.js
@@ -0,0 +1,136 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Template = require("../Template");
+const { equals } = require("../util/ArrayHelpers");
+const makeSerializable = require("../util/makeSerializable");
+const propertyAccess = require("../util/propertyAccess");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class CommonJsFullRequireDependency extends ModuleDependency {
+	/**
+	 * @param {string} request the request string
+	 * @param {[number, number]} range location in source code
+	 * @param {string[]} names accessed properties on module
+	 */
+	constructor(request, range, names) {
+		super(request);
+		this.range = range;
+		this.names = names;
+		this.call = false;
+		this.asiSafe = undefined;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		if (this.call) {
+			const importedModule = moduleGraph.getModule(this);
+			if (
+				!importedModule ||
+				importedModule.getExportsType(moduleGraph, false) !== "namespace"
+			) {
+				return [this.names.slice(0, -1)];
+			}
+		}
+		return [this.names];
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.names);
+		write(this.call);
+		write(this.asiSafe);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.names = read();
+		this.call = read();
+		this.asiSafe = read();
+		super.deserialize(context);
+	}
+
+	get type() {
+		return "cjs full require";
+	}
+
+	get category() {
+		return "commonjs";
+	}
+}
+
+CommonJsFullRequireDependency.Template = class CommonJsFullRequireDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{
+			module,
+			runtimeTemplate,
+			moduleGraph,
+			chunkGraph,
+			runtimeRequirements,
+			runtime,
+			initFragments
+		}
+	) {
+		const dep = /** @type {CommonJsFullRequireDependency} */ (dependency);
+		if (!dep.range) return;
+		const importedModule = moduleGraph.getModule(dep);
+		let requireExpr = runtimeTemplate.moduleExports({
+			module: importedModule,
+			chunkGraph,
+			request: dep.request,
+			weak: dep.weak,
+			runtimeRequirements
+		});
+		if (importedModule) {
+			const ids = dep.names;
+			const usedImported = moduleGraph
+				.getExportsInfo(importedModule)
+				.getUsedName(ids, runtime);
+			if (usedImported) {
+				const comment = equals(usedImported, ids)
+					? ""
+					: Template.toNormalComment(propertyAccess(ids)) + " ";
+				const access = `${comment}${propertyAccess(usedImported)}`;
+				requireExpr =
+					dep.asiSafe === true
+						? `(${requireExpr}${access})`
+						: `${requireExpr}${access}`;
+			}
+		}
+		source.replace(dep.range[0], dep.range[1] - 1, requireExpr);
+	}
+};
+
+makeSerializable(
+	CommonJsFullRequireDependency,
+	"webpack/lib/dependencies/CommonJsFullRequireDependency"
+);
+
+module.exports = CommonJsFullRequireDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsImportsParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsImportsParserPlugin.js
new file mode 100644
index 0000000..47013f4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsImportsParserPlugin.js
@@ -0,0 +1,388 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const CommentCompilationWarning = require("../CommentCompilationWarning");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const UnsupportedFeatureWarning = require("../UnsupportedFeatureWarning");
+const {
+	evaluateToIdentifier,
+	evaluateToString,
+	expressionIsUnsupported,
+	toConstantDependency
+} = require("../javascript/JavascriptParserHelpers");
+const CommonJsFullRequireDependency = require("./CommonJsFullRequireDependency");
+const CommonJsRequireContextDependency = require("./CommonJsRequireContextDependency");
+const CommonJsRequireDependency = require("./CommonJsRequireDependency");
+const ConstDependency = require("./ConstDependency");
+const ContextDependencyHelpers = require("./ContextDependencyHelpers");
+const LocalModuleDependency = require("./LocalModuleDependency");
+const { getLocalModule } = require("./LocalModulesHelpers");
+const RequireHeaderDependency = require("./RequireHeaderDependency");
+const RequireResolveContextDependency = require("./RequireResolveContextDependency");
+const RequireResolveDependency = require("./RequireResolveDependency");
+const RequireResolveHeaderDependency = require("./RequireResolveHeaderDependency");
+
+/** @typedef {import("../../declarations/WebpackOptions").JavascriptParserOptions} JavascriptParserOptions */
+
+class CommonJsImportsParserPlugin {
+	/**
+	 * @param {JavascriptParserOptions} options parser options
+	 */
+	constructor(options) {
+		this.options = options;
+	}
+
+	apply(parser) {
+		const options = this.options;
+
+		// metadata //
+		const tapRequireExpression = (expression, getMembers) => {
+			parser.hooks.typeof
+				.for(expression)
+				.tap(
+					"CommonJsPlugin",
+					toConstantDependency(parser, JSON.stringify("function"))
+				);
+			parser.hooks.evaluateTypeof
+				.for(expression)
+				.tap("CommonJsPlugin", evaluateToString("function"));
+			parser.hooks.evaluateIdentifier
+				.for(expression)
+				.tap(
+					"CommonJsPlugin",
+					evaluateToIdentifier(expression, "require", getMembers, true)
+				);
+		};
+		tapRequireExpression("require", () => []);
+		tapRequireExpression("require.resolve", () => ["resolve"]);
+		tapRequireExpression("require.resolveWeak", () => ["resolveWeak"]);
+
+		// Weird stuff //
+		parser.hooks.assign.for("require").tap("CommonJsPlugin", expr => {
+			// to not leak to global "require", we need to define a local require here.
+			const dep = new ConstDependency("var require;", 0);
+			dep.loc = expr.loc;
+			parser.state.module.addPresentationalDependency(dep);
+			return true;
+		});
+
+		// Unsupported //
+		parser.hooks.expression
+			.for("require.main.require")
+			.tap(
+				"CommonJsPlugin",
+				expressionIsUnsupported(
+					parser,
+					"require.main.require is not supported by webpack."
+				)
+			);
+		parser.hooks.call
+			.for("require.main.require")
+			.tap(
+				"CommonJsPlugin",
+				expressionIsUnsupported(
+					parser,
+					"require.main.require is not supported by webpack."
+				)
+			);
+		parser.hooks.expression
+			.for("module.parent.require")
+			.tap(
+				"CommonJsPlugin",
+				expressionIsUnsupported(
+					parser,
+					"module.parent.require is not supported by webpack."
+				)
+			);
+		parser.hooks.call
+			.for("module.parent.require")
+			.tap(
+				"CommonJsPlugin",
+				expressionIsUnsupported(
+					parser,
+					"module.parent.require is not supported by webpack."
+				)
+			);
+
+		// renaming //
+		parser.hooks.canRename.for("require").tap("CommonJsPlugin", () => true);
+		parser.hooks.rename.for("require").tap("CommonJsPlugin", expr => {
+			// To avoid "not defined" error, replace the value with undefined
+			const dep = new ConstDependency("undefined", expr.range);
+			dep.loc = expr.loc;
+			parser.state.module.addPresentationalDependency(dep);
+			return false;
+		});
+
+		// inspection //
+		parser.hooks.expression
+			.for("require.cache")
+			.tap(
+				"CommonJsImportsParserPlugin",
+				toConstantDependency(parser, RuntimeGlobals.moduleCache, [
+					RuntimeGlobals.moduleCache,
+					RuntimeGlobals.moduleId,
+					RuntimeGlobals.moduleLoaded
+				])
+			);
+
+		// require as expression //
+		parser.hooks.expression
+			.for("require")
+			.tap("CommonJsImportsParserPlugin", expr => {
+				const dep = new CommonJsRequireContextDependency(
+					{
+						request: options.unknownContextRequest,
+						recursive: options.unknownContextRecursive,
+						regExp: options.unknownContextRegExp,
+						mode: "sync"
+					},
+					expr.range,
+					undefined,
+					parser.scope.inShorthand
+				);
+				dep.critical =
+					options.unknownContextCritical &&
+					"require function is used in a way in which dependencies cannot be statically extracted";
+				dep.loc = expr.loc;
+				dep.optional = !!parser.scope.inTry;
+				parser.state.current.addDependency(dep);
+				return true;
+			});
+
+		// require //
+		const processRequireItem = (expr, param) => {
+			if (param.isString()) {
+				const dep = new CommonJsRequireDependency(param.string, param.range);
+				dep.loc = expr.loc;
+				dep.optional = !!parser.scope.inTry;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+		};
+		const processRequireContext = (expr, param) => {
+			const dep = ContextDependencyHelpers.create(
+				CommonJsRequireContextDependency,
+				expr.range,
+				param,
+				expr,
+				options,
+				{
+					category: "commonjs"
+				},
+				parser
+			);
+			if (!dep) return;
+			dep.loc = expr.loc;
+			dep.optional = !!parser.scope.inTry;
+			parser.state.current.addDependency(dep);
+			return true;
+		};
+		const createRequireHandler = callNew => expr => {
+			if (options.commonjsMagicComments) {
+				const { options: requireOptions, errors: commentErrors } =
+					parser.parseCommentOptions(expr.range);
+
+				if (commentErrors) {
+					for (const e of commentErrors) {
+						const { comment } = e;
+						parser.state.module.addWarning(
+							new CommentCompilationWarning(
+								`Compilation error while processing magic comment(-s): /*${comment.value}*/: ${e.message}`,
+								comment.loc
+							)
+						);
+					}
+				}
+				if (requireOptions) {
+					if (requireOptions.webpackIgnore !== undefined) {
+						if (typeof requireOptions.webpackIgnore !== "boolean") {
+							parser.state.module.addWarning(
+								new UnsupportedFeatureWarning(
+									`\`webpackIgnore\` expected a boolean, but received: ${requireOptions.webpackIgnore}.`,
+									expr.loc
+								)
+							);
+						} else {
+							// Do not instrument `require()` if `webpackIgnore` is `true`
+							if (requireOptions.webpackIgnore) {
+								return true;
+							}
+						}
+					}
+				}
+			}
+
+			if (expr.arguments.length !== 1) return;
+			let localModule;
+			const param = parser.evaluateExpression(expr.arguments[0]);
+			if (param.isConditional()) {
+				let isExpression = false;
+				for (const p of param.options) {
+					const result = processRequireItem(expr, p);
+					if (result === undefined) {
+						isExpression = true;
+					}
+				}
+				if (!isExpression) {
+					const dep = new RequireHeaderDependency(expr.callee.range);
+					dep.loc = expr.loc;
+					parser.state.module.addPresentationalDependency(dep);
+					return true;
+				}
+			}
+			if (
+				param.isString() &&
+				(localModule = getLocalModule(parser.state, param.string))
+			) {
+				localModule.flagUsed();
+				const dep = new LocalModuleDependency(localModule, expr.range, callNew);
+				dep.loc = expr.loc;
+				parser.state.module.addPresentationalDependency(dep);
+				return true;
+			} else {
+				const result = processRequireItem(expr, param);
+				if (result === undefined) {
+					processRequireContext(expr, param);
+				} else {
+					const dep = new RequireHeaderDependency(expr.callee.range);
+					dep.loc = expr.loc;
+					parser.state.module.addPresentationalDependency(dep);
+				}
+				return true;
+			}
+		};
+		parser.hooks.call
+			.for("require")
+			.tap("CommonJsImportsParserPlugin", createRequireHandler(false));
+		parser.hooks.new
+			.for("require")
+			.tap("CommonJsImportsParserPlugin", createRequireHandler(true));
+		parser.hooks.call
+			.for("module.require")
+			.tap("CommonJsImportsParserPlugin", createRequireHandler(false));
+		parser.hooks.new
+			.for("module.require")
+			.tap("CommonJsImportsParserPlugin", createRequireHandler(true));
+
+		// require with property access //
+		const chainHandler = (expr, calleeMembers, callExpr, members) => {
+			if (callExpr.arguments.length !== 1) return;
+			const param = parser.evaluateExpression(callExpr.arguments[0]);
+			if (param.isString() && !getLocalModule(parser.state, param.string)) {
+				const dep = new CommonJsFullRequireDependency(
+					param.string,
+					expr.range,
+					members
+				);
+				dep.asiSafe = !parser.isAsiPosition(expr.range[0]);
+				dep.optional = !!parser.scope.inTry;
+				dep.loc = expr.loc;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+		};
+		const callChainHandler = (expr, calleeMembers, callExpr, members) => {
+			if (callExpr.arguments.length !== 1) return;
+			const param = parser.evaluateExpression(callExpr.arguments[0]);
+			if (param.isString() && !getLocalModule(parser.state, param.string)) {
+				const dep = new CommonJsFullRequireDependency(
+					param.string,
+					expr.callee.range,
+					members
+				);
+				dep.call = true;
+				dep.asiSafe = !parser.isAsiPosition(expr.range[0]);
+				dep.optional = !!parser.scope.inTry;
+				dep.loc = expr.callee.loc;
+				parser.state.current.addDependency(dep);
+				parser.walkExpressions(expr.arguments);
+				return true;
+			}
+		};
+		parser.hooks.memberChainOfCallMemberChain
+			.for("require")
+			.tap("CommonJsImportsParserPlugin", chainHandler);
+		parser.hooks.memberChainOfCallMemberChain
+			.for("module.require")
+			.tap("CommonJsImportsParserPlugin", chainHandler);
+		parser.hooks.callMemberChainOfCallMemberChain
+			.for("require")
+			.tap("CommonJsImportsParserPlugin", callChainHandler);
+		parser.hooks.callMemberChainOfCallMemberChain
+			.for("module.require")
+			.tap("CommonJsImportsParserPlugin", callChainHandler);
+
+		// require.resolve //
+		const processResolve = (expr, weak) => {
+			if (expr.arguments.length !== 1) return;
+			const param = parser.evaluateExpression(expr.arguments[0]);
+			if (param.isConditional()) {
+				for (const option of param.options) {
+					const result = processResolveItem(expr, option, weak);
+					if (result === undefined) {
+						processResolveContext(expr, option, weak);
+					}
+				}
+				const dep = new RequireResolveHeaderDependency(expr.callee.range);
+				dep.loc = expr.loc;
+				parser.state.module.addPresentationalDependency(dep);
+				return true;
+			} else {
+				const result = processResolveItem(expr, param, weak);
+				if (result === undefined) {
+					processResolveContext(expr, param, weak);
+				}
+				const dep = new RequireResolveHeaderDependency(expr.callee.range);
+				dep.loc = expr.loc;
+				parser.state.module.addPresentationalDependency(dep);
+				return true;
+			}
+		};
+		const processResolveItem = (expr, param, weak) => {
+			if (param.isString()) {
+				const dep = new RequireResolveDependency(param.string, param.range);
+				dep.loc = expr.loc;
+				dep.optional = !!parser.scope.inTry;
+				dep.weak = weak;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+		};
+		const processResolveContext = (expr, param, weak) => {
+			const dep = ContextDependencyHelpers.create(
+				RequireResolveContextDependency,
+				param.range,
+				param,
+				expr,
+				options,
+				{
+					category: "commonjs",
+					mode: weak ? "weak" : "sync"
+				},
+				parser
+			);
+			if (!dep) return;
+			dep.loc = expr.loc;
+			dep.optional = !!parser.scope.inTry;
+			parser.state.current.addDependency(dep);
+			return true;
+		};
+
+		parser.hooks.call
+			.for("require.resolve")
+			.tap("RequireResolveDependencyParserPlugin", expr => {
+				return processResolve(expr, false);
+			});
+		parser.hooks.call
+			.for("require.resolveWeak")
+			.tap("RequireResolveDependencyParserPlugin", expr => {
+				return processResolve(expr, true);
+			});
+	}
+}
+module.exports = CommonJsImportsParserPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsPlugin.js
new file mode 100644
index 0000000..799704b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsPlugin.js
@@ -0,0 +1,280 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const SelfModuleFactory = require("../SelfModuleFactory");
+const Template = require("../Template");
+const CommonJsExportsDependency = require("./CommonJsExportsDependency");
+const CommonJsFullRequireDependency = require("./CommonJsFullRequireDependency");
+const CommonJsRequireContextDependency = require("./CommonJsRequireContextDependency");
+const CommonJsRequireDependency = require("./CommonJsRequireDependency");
+const CommonJsSelfReferenceDependency = require("./CommonJsSelfReferenceDependency");
+const ModuleDecoratorDependency = require("./ModuleDecoratorDependency");
+const RequireHeaderDependency = require("./RequireHeaderDependency");
+const RequireResolveContextDependency = require("./RequireResolveContextDependency");
+const RequireResolveDependency = require("./RequireResolveDependency");
+const RequireResolveHeaderDependency = require("./RequireResolveHeaderDependency");
+const RuntimeRequirementsDependency = require("./RuntimeRequirementsDependency");
+
+const CommonJsExportsParserPlugin = require("./CommonJsExportsParserPlugin");
+const CommonJsImportsParserPlugin = require("./CommonJsImportsParserPlugin");
+
+const {
+	evaluateToIdentifier,
+	toConstantDependency
+} = require("../javascript/JavascriptParserHelpers");
+const CommonJsExportRequireDependency = require("./CommonJsExportRequireDependency");
+
+class CommonJsPlugin {
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"CommonJsPlugin",
+			(compilation, { contextModuleFactory, normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					CommonJsRequireDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					CommonJsRequireDependency,
+					new CommonJsRequireDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					CommonJsFullRequireDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					CommonJsFullRequireDependency,
+					new CommonJsFullRequireDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					CommonJsRequireContextDependency,
+					contextModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					CommonJsRequireContextDependency,
+					new CommonJsRequireContextDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					RequireResolveDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					RequireResolveDependency,
+					new RequireResolveDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					RequireResolveContextDependency,
+					contextModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					RequireResolveContextDependency,
+					new RequireResolveContextDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					RequireResolveHeaderDependency,
+					new RequireResolveHeaderDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					RequireHeaderDependency,
+					new RequireHeaderDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					CommonJsExportsDependency,
+					new CommonJsExportsDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					CommonJsExportRequireDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					CommonJsExportRequireDependency,
+					new CommonJsExportRequireDependency.Template()
+				);
+
+				const selfFactory = new SelfModuleFactory(compilation.moduleGraph);
+
+				compilation.dependencyFactories.set(
+					CommonJsSelfReferenceDependency,
+					selfFactory
+				);
+				compilation.dependencyTemplates.set(
+					CommonJsSelfReferenceDependency,
+					new CommonJsSelfReferenceDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					ModuleDecoratorDependency,
+					selfFactory
+				);
+				compilation.dependencyTemplates.set(
+					ModuleDecoratorDependency,
+					new ModuleDecoratorDependency.Template()
+				);
+
+				compilation.hooks.runtimeRequirementInModule
+					.for(RuntimeGlobals.harmonyModuleDecorator)
+					.tap("CommonJsPlugin", (module, set) => {
+						set.add(RuntimeGlobals.module);
+						set.add(RuntimeGlobals.requireScope);
+					});
+
+				compilation.hooks.runtimeRequirementInModule
+					.for(RuntimeGlobals.nodeModuleDecorator)
+					.tap("CommonJsPlugin", (module, set) => {
+						set.add(RuntimeGlobals.module);
+						set.add(RuntimeGlobals.requireScope);
+					});
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.harmonyModuleDecorator)
+					.tap("CommonJsPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(
+							chunk,
+							new HarmonyModuleDecoratorRuntimeModule()
+						);
+					});
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.nodeModuleDecorator)
+					.tap("CommonJsPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(
+							chunk,
+							new NodeModuleDecoratorRuntimeModule()
+						);
+					});
+
+				const handler = (parser, parserOptions) => {
+					if (parserOptions.commonjs !== undefined && !parserOptions.commonjs)
+						return;
+					parser.hooks.typeof
+						.for("module")
+						.tap(
+							"CommonJsPlugin",
+							toConstantDependency(parser, JSON.stringify("object"))
+						);
+
+					parser.hooks.expression
+						.for("require.main")
+						.tap(
+							"CommonJsPlugin",
+							toConstantDependency(
+								parser,
+								`${RuntimeGlobals.moduleCache}[${RuntimeGlobals.entryModuleId}]`,
+								[RuntimeGlobals.moduleCache, RuntimeGlobals.entryModuleId]
+							)
+						);
+					parser.hooks.expression
+						.for("module.loaded")
+						.tap("CommonJsPlugin", expr => {
+							parser.state.module.buildInfo.moduleConcatenationBailout =
+								"module.loaded";
+							const dep = new RuntimeRequirementsDependency([
+								RuntimeGlobals.moduleLoaded
+							]);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+
+					parser.hooks.expression
+						.for("module.id")
+						.tap("CommonJsPlugin", expr => {
+							parser.state.module.buildInfo.moduleConcatenationBailout =
+								"module.id";
+							const dep = new RuntimeRequirementsDependency([
+								RuntimeGlobals.moduleId
+							]);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+
+					parser.hooks.evaluateIdentifier.for("module.hot").tap(
+						"CommonJsPlugin",
+						evaluateToIdentifier("module.hot", "module", () => ["hot"], null)
+					);
+
+					new CommonJsImportsParserPlugin(parserOptions).apply(parser);
+					new CommonJsExportsParserPlugin(compilation.moduleGraph).apply(
+						parser
+					);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("CommonJsPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("CommonJsPlugin", handler);
+			}
+		);
+	}
+}
+
+class HarmonyModuleDecoratorRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("harmony module decorator");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		return Template.asString([
+			`${
+				RuntimeGlobals.harmonyModuleDecorator
+			} = ${runtimeTemplate.basicFunction("module", [
+				"module = Object.create(module);",
+				"if (!module.children) module.children = [];",
+				"Object.defineProperty(module, 'exports', {",
+				Template.indent([
+					"enumerable: true,",
+					`set: ${runtimeTemplate.basicFunction("", [
+						"throw new Error('ES Modules may not assign module.exports or exports.*, Use ESM export syntax, instead: ' + module.id);"
+					])}`
+				]),
+				"});",
+				"return module;"
+			])};`
+		]);
+	}
+}
+
+class NodeModuleDecoratorRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("node module decorator");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		return Template.asString([
+			`${RuntimeGlobals.nodeModuleDecorator} = ${runtimeTemplate.basicFunction(
+				"module",
+				[
+					"module.paths = [];",
+					"if (!module.children) module.children = [];",
+					"return module;"
+				]
+			)};`
+		]);
+	}
+}
+
+module.exports = CommonJsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsRequireContextDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsRequireContextDependency.js
new file mode 100644
index 0000000..627d234
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsRequireContextDependency.js
@@ -0,0 +1,55 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ContextDependency = require("./ContextDependency");
+const ContextDependencyTemplateAsRequireCall = require("./ContextDependencyTemplateAsRequireCall");
+
+class CommonJsRequireContextDependency extends ContextDependency {
+	constructor(options, range, valueRange, inShorthand) {
+		super(options);
+
+		this.range = range;
+		this.valueRange = valueRange;
+		// inShorthand must be serialized by subclasses that use it
+		this.inShorthand = inShorthand;
+	}
+
+	get type() {
+		return "cjs require context";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.range);
+		write(this.valueRange);
+		write(this.inShorthand);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.range = read();
+		this.valueRange = read();
+		this.inShorthand = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	CommonJsRequireContextDependency,
+	"webpack/lib/dependencies/CommonJsRequireContextDependency"
+);
+
+CommonJsRequireContextDependency.Template =
+	ContextDependencyTemplateAsRequireCall;
+
+module.exports = CommonJsRequireContextDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsRequireDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsRequireDependency.js
new file mode 100644
index 0000000..3c711ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsRequireDependency.js
@@ -0,0 +1,34 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const ModuleDependencyTemplateAsId = require("./ModuleDependencyTemplateAsId");
+
+class CommonJsRequireDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+		this.range = range;
+	}
+
+	get type() {
+		return "cjs require";
+	}
+
+	get category() {
+		return "commonjs";
+	}
+}
+
+CommonJsRequireDependency.Template = ModuleDependencyTemplateAsId;
+
+makeSerializable(
+	CommonJsRequireDependency,
+	"webpack/lib/dependencies/CommonJsRequireDependency"
+);
+
+module.exports = CommonJsRequireDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsSelfReferenceDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsSelfReferenceDependency.js
new file mode 100644
index 0000000..1c4af48
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CommonJsSelfReferenceDependency.js
@@ -0,0 +1,141 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const { equals } = require("../util/ArrayHelpers");
+const makeSerializable = require("../util/makeSerializable");
+const propertyAccess = require("../util/propertyAccess");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class CommonJsSelfReferenceDependency extends NullDependency {
+	constructor(range, base, names, call) {
+		super();
+		this.range = range;
+		this.base = base;
+		this.names = names;
+		this.call = call;
+	}
+
+	get type() {
+		return "cjs self exports reference";
+	}
+
+	get category() {
+		return "self";
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return `self`;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return [this.call ? this.names.slice(0, -1) : this.names];
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.base);
+		write(this.names);
+		write(this.call);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		this.base = read();
+		this.names = read();
+		this.call = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	CommonJsSelfReferenceDependency,
+	"webpack/lib/dependencies/CommonJsSelfReferenceDependency"
+);
+
+CommonJsSelfReferenceDependency.Template = class CommonJsSelfReferenceDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ module, moduleGraph, runtime, runtimeRequirements }
+	) {
+		const dep = /** @type {CommonJsSelfReferenceDependency} */ (dependency);
+		let used;
+		if (dep.names.length === 0) {
+			used = dep.names;
+		} else {
+			used = moduleGraph.getExportsInfo(module).getUsedName(dep.names, runtime);
+		}
+		if (!used) {
+			throw new Error(
+				"Self-reference dependency has unused export name: This should not happen"
+			);
+		}
+
+		let base = undefined;
+		switch (dep.base) {
+			case "exports":
+				runtimeRequirements.add(RuntimeGlobals.exports);
+				base = module.exportsArgument;
+				break;
+			case "module.exports":
+				runtimeRequirements.add(RuntimeGlobals.module);
+				base = `${module.moduleArgument}.exports`;
+				break;
+			case "this":
+				runtimeRequirements.add(RuntimeGlobals.thisAsExports);
+				base = "this";
+				break;
+			default:
+				throw new Error(`Unsupported base ${dep.base}`);
+		}
+
+		if (base === dep.base && equals(used, dep.names)) {
+			// Nothing has to be changed
+			// We don't use a replacement for compat reasons
+			// for plugins that update `module._source` which they
+			// shouldn't do!
+			return;
+		}
+
+		source.replace(
+			dep.range[0],
+			dep.range[1] - 1,
+			`${base}${propertyAccess(used)}`
+		);
+	}
+};
+
+module.exports = CommonJsSelfReferenceDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ConstDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ConstDependency.js
new file mode 100644
index 0000000..72e2cab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ConstDependency.js
@@ -0,0 +1,108 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../util/Hash")} Hash */
+
+class ConstDependency extends NullDependency {
+	/**
+	 * @param {string} expression the expression
+	 * @param {number|[number, number]} range the source range
+	 * @param {string[]=} runtimeRequirements runtime requirements
+	 */
+	constructor(expression, range, runtimeRequirements) {
+		super();
+		this.expression = expression;
+		this.range = range;
+		this.runtimeRequirements = runtimeRequirements
+			? new Set(runtimeRequirements)
+			: null;
+		this._hashUpdate = undefined;
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		if (this._hashUpdate === undefined) {
+			let hashUpdate = "" + this.range + "|" + this.expression;
+			if (this.runtimeRequirements) {
+				for (const item of this.runtimeRequirements) {
+					hashUpdate += "|";
+					hashUpdate += item;
+				}
+			}
+			this._hashUpdate = hashUpdate;
+		}
+		hash.update(this._hashUpdate);
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		return false;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.expression);
+		write(this.range);
+		write(this.runtimeRequirements);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.expression = read();
+		this.range = read();
+		this.runtimeRequirements = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ConstDependency, "webpack/lib/dependencies/ConstDependency");
+
+ConstDependency.Template = class ConstDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {ConstDependency} */ (dependency);
+		if (dep.runtimeRequirements) {
+			for (const req of dep.runtimeRequirements) {
+				templateContext.runtimeRequirements.add(req);
+			}
+		}
+		if (typeof dep.range === "number") {
+			source.insert(dep.range, dep.expression);
+			return;
+		}
+
+		source.replace(dep.range[0], dep.range[1] - 1, dep.expression);
+	}
+};
+
+module.exports = ConstDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependency.js
new file mode 100644
index 0000000..4b23b52
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependency.js
@@ -0,0 +1,147 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const DependencyTemplate = require("../DependencyTemplate");
+const makeSerializable = require("../util/makeSerializable");
+const memoize = require("../util/memoize");
+
+/** @typedef {import("../ContextModule").ContextOptions} ContextOptions */
+/** @typedef {import("../Dependency").TRANSITIVE} TRANSITIVE */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../WebpackError")} WebpackError */
+
+const getCriticalDependencyWarning = memoize(() =>
+	require("./CriticalDependencyWarning")
+);
+
+/** @typedef {ContextOptions & { request: string }} ContextDependencyOptions */
+
+const regExpToString = r => (r ? r + "" : "");
+
+class ContextDependency extends Dependency {
+	/**
+	 * @param {ContextDependencyOptions} options options for the context module
+	 */
+	constructor(options) {
+		super();
+
+		this.options = options;
+		this.userRequest = this.options && this.options.request;
+		/** @type {false | string} */
+		this.critical = false;
+		this.hadGlobalOrStickyRegExp = false;
+
+		if (
+			this.options &&
+			(this.options.regExp.global || this.options.regExp.sticky)
+		) {
+			this.options = { ...this.options, regExp: null };
+			this.hadGlobalOrStickyRegExp = true;
+		}
+
+		this.request = undefined;
+		this.range = undefined;
+		this.valueRange = undefined;
+		this.inShorthand = undefined;
+		// TODO refactor this
+		this.replaces = undefined;
+	}
+
+	get category() {
+		return "commonjs";
+	}
+
+	/**
+	 * @returns {boolean | TRANSITIVE} true, when changes to the referenced module could affect the referencing module; TRANSITIVE, when changes to the referenced module could affect referencing modules of the referencing module
+	 */
+	couldAffectReferencingModule() {
+		return true;
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return (
+			`context${this.options.request} ${this.options.recursive} ` +
+			`${regExpToString(this.options.regExp)} ${regExpToString(
+				this.options.include
+			)} ${regExpToString(this.options.exclude)} ` +
+			`${this.options.mode} ${this.options.chunkName} ` +
+			`${JSON.stringify(this.options.groupOptions)}`
+		);
+	}
+
+	/**
+	 * Returns warnings
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} warnings
+	 */
+	getWarnings(moduleGraph) {
+		let warnings = super.getWarnings(moduleGraph);
+
+		if (this.critical) {
+			if (!warnings) warnings = [];
+			const CriticalDependencyWarning = getCriticalDependencyWarning();
+			warnings.push(new CriticalDependencyWarning(this.critical));
+		}
+
+		if (this.hadGlobalOrStickyRegExp) {
+			if (!warnings) warnings = [];
+			const CriticalDependencyWarning = getCriticalDependencyWarning();
+			warnings.push(
+				new CriticalDependencyWarning(
+					"Contexts can't use RegExps with the 'g' or 'y' flags."
+				)
+			);
+		}
+
+		return warnings;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.options);
+		write(this.userRequest);
+		write(this.critical);
+		write(this.hadGlobalOrStickyRegExp);
+		write(this.request);
+		write(this.range);
+		write(this.valueRange);
+		write(this.prepend);
+		write(this.replaces);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.options = read();
+		this.userRequest = read();
+		this.critical = read();
+		this.hadGlobalOrStickyRegExp = read();
+		this.request = read();
+		this.range = read();
+		this.valueRange = read();
+		this.prepend = read();
+		this.replaces = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	ContextDependency,
+	"webpack/lib/dependencies/ContextDependency"
+);
+
+ContextDependency.Template = DependencyTemplate;
+
+module.exports = ContextDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyHelpers.js
new file mode 100644
index 0000000..488ed9a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyHelpers.js
@@ -0,0 +1,232 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { parseResource } = require("../util/identifier");
+
+/** @typedef {import("estree").Node} EsTreeNode */
+/** @typedef {import("../../declarations/WebpackOptions").JavascriptParserOptions} JavascriptParserOptions */
+/** @typedef {import("../../declarations/WebpackOptions").ModuleOptionsNormalized} ModuleOptions */
+/** @typedef {import("../javascript/BasicEvaluatedExpression")} BasicEvaluatedExpression */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+/** @typedef {import("./ContextDependency")} ContextDependency */
+/** @typedef {import("./ContextDependency").ContextDependencyOptions} ContextDependencyOptions */
+
+/**
+ * Escapes regular expression metacharacters
+ * @param {string} str String to quote
+ * @returns {string} Escaped string
+ */
+const quoteMeta = str => {
+	return str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
+};
+
+const splitContextFromPrefix = prefix => {
+	const idx = prefix.lastIndexOf("/");
+	let context = ".";
+	if (idx >= 0) {
+		context = prefix.substr(0, idx);
+		prefix = `.${prefix.substr(idx)}`;
+	}
+	return {
+		context,
+		prefix
+	};
+};
+
+/** @typedef {Partial<Omit<ContextDependencyOptions, "resource">>} PartialContextDependencyOptions */
+
+/** @typedef {{ new(options: ContextDependencyOptions, range: [number, number], valueRange: [number, number]): ContextDependency }} ContextDependencyConstructor */
+
+/**
+ * @param {ContextDependencyConstructor} Dep the Dependency class
+ * @param {[number, number]} range source range
+ * @param {BasicEvaluatedExpression} param context param
+ * @param {EsTreeNode} expr expr
+ * @param {Pick<JavascriptParserOptions, `${"expr"|"wrapped"}Context${"Critical"|"Recursive"|"RegExp"}` | "exprContextRequest">} options options for context creation
+ * @param {PartialContextDependencyOptions} contextOptions options for the ContextModule
+ * @param {JavascriptParser} parser the parser
+ * @returns {ContextDependency} the created Dependency
+ */
+exports.create = (Dep, range, param, expr, options, contextOptions, parser) => {
+	if (param.isTemplateString()) {
+		let prefixRaw = param.quasis[0].string;
+		let postfixRaw =
+			param.quasis.length > 1
+				? param.quasis[param.quasis.length - 1].string
+				: "";
+
+		const valueRange = param.range;
+		const { context, prefix } = splitContextFromPrefix(prefixRaw);
+		const {
+			path: postfix,
+			query,
+			fragment
+		} = parseResource(postfixRaw, parser);
+
+		// When there are more than two quasis, the generated RegExp can be more precise
+		// We join the quasis with the expression regexp
+		const innerQuasis = param.quasis.slice(1, param.quasis.length - 1);
+		const innerRegExp =
+			options.wrappedContextRegExp.source +
+			innerQuasis
+				.map(q => quoteMeta(q.string) + options.wrappedContextRegExp.source)
+				.join("");
+
+		// Example: `./context/pre${e}inner${e}inner2${e}post?query#frag`
+		// context: "./context"
+		// prefix: "./pre"
+		// innerQuasis: [BEE("inner"), BEE("inner2")]
+		// (BEE = BasicEvaluatedExpression)
+		// postfix: "post"
+		// query: "?query"
+		// fragment: "#frag"
+		// regExp: /^\.\/pre.*inner.*inner2.*post$/
+		const regExp = new RegExp(
+			`^${quoteMeta(prefix)}${innerRegExp}${quoteMeta(postfix)}$`
+		);
+		const dep = new Dep(
+			{
+				request: context + query + fragment,
+				recursive: options.wrappedContextRecursive,
+				regExp,
+				mode: "sync",
+				...contextOptions
+			},
+			range,
+			valueRange
+		);
+		dep.loc = expr.loc;
+		const replaces = [];
+
+		param.parts.forEach((part, i) => {
+			if (i % 2 === 0) {
+				// Quasis or merged quasi
+				let range = part.range;
+				let value = part.string;
+				if (param.templateStringKind === "cooked") {
+					value = JSON.stringify(value);
+					value = value.slice(1, value.length - 1);
+				}
+				if (i === 0) {
+					// prefix
+					value = prefix;
+					range = [param.range[0], part.range[1]];
+					value =
+						(param.templateStringKind === "cooked" ? "`" : "String.raw`") +
+						value;
+				} else if (i === param.parts.length - 1) {
+					// postfix
+					value = postfix;
+					range = [part.range[0], param.range[1]];
+					value = value + "`";
+				} else if (
+					part.expression &&
+					part.expression.type === "TemplateElement" &&
+					part.expression.value.raw === value
+				) {
+					// Shortcut when it's a single quasi and doesn't need to be replaced
+					return;
+				}
+				replaces.push({
+					range,
+					value
+				});
+			} else {
+				// Expression
+				parser.walkExpression(part.expression);
+			}
+		});
+
+		dep.replaces = replaces;
+		dep.critical =
+			options.wrappedContextCritical &&
+			"a part of the request of a dependency is an expression";
+		return dep;
+	} else if (
+		param.isWrapped() &&
+		((param.prefix && param.prefix.isString()) ||
+			(param.postfix && param.postfix.isString()))
+	) {
+		let prefixRaw =
+			param.prefix && param.prefix.isString() ? param.prefix.string : "";
+		let postfixRaw =
+			param.postfix && param.postfix.isString() ? param.postfix.string : "";
+		const prefixRange =
+			param.prefix && param.prefix.isString() ? param.prefix.range : null;
+		const postfixRange =
+			param.postfix && param.postfix.isString() ? param.postfix.range : null;
+		const valueRange = param.range;
+		const { context, prefix } = splitContextFromPrefix(prefixRaw);
+		const {
+			path: postfix,
+			query,
+			fragment
+		} = parseResource(postfixRaw, parser);
+		const regExp = new RegExp(
+			`^${quoteMeta(prefix)}${options.wrappedContextRegExp.source}${quoteMeta(
+				postfix
+			)}$`
+		);
+		const dep = new Dep(
+			{
+				request: context + query + fragment,
+				recursive: options.wrappedContextRecursive,
+				regExp,
+				mode: "sync",
+				...contextOptions
+			},
+			range,
+			valueRange
+		);
+		dep.loc = expr.loc;
+		const replaces = [];
+		if (prefixRange) {
+			replaces.push({
+				range: prefixRange,
+				value: JSON.stringify(prefix)
+			});
+		}
+		if (postfixRange) {
+			replaces.push({
+				range: postfixRange,
+				value: JSON.stringify(postfix)
+			});
+		}
+		dep.replaces = replaces;
+		dep.critical =
+			options.wrappedContextCritical &&
+			"a part of the request of a dependency is an expression";
+
+		if (parser && param.wrappedInnerExpressions) {
+			for (const part of param.wrappedInnerExpressions) {
+				if (part.expression) parser.walkExpression(part.expression);
+			}
+		}
+
+		return dep;
+	} else {
+		const dep = new Dep(
+			{
+				request: options.exprContextRequest,
+				recursive: options.exprContextRecursive,
+				regExp: /** @type {RegExp} */ (options.exprContextRegExp),
+				mode: "sync",
+				...contextOptions
+			},
+			range,
+			param.range
+		);
+		dep.loc = expr.loc;
+		dep.critical =
+			options.exprContextCritical &&
+			"the request of a dependency is an expression";
+
+		parser.walkExpression(param.expression);
+
+		return dep;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyTemplateAsId.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyTemplateAsId.js
new file mode 100644
index 0000000..c5d9a5a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyTemplateAsId.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ContextDependency = require("./ContextDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class ContextDependencyTemplateAsId extends ContextDependency.Template {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {ContextDependency} */ (dependency);
+		const moduleExports = runtimeTemplate.moduleExports({
+			module: moduleGraph.getModule(dep),
+			chunkGraph,
+			request: dep.request,
+			weak: dep.weak,
+			runtimeRequirements
+		});
+
+		if (moduleGraph.getModule(dep)) {
+			if (dep.valueRange) {
+				if (Array.isArray(dep.replaces)) {
+					for (let i = 0; i < dep.replaces.length; i++) {
+						const rep = dep.replaces[i];
+						source.replace(rep.range[0], rep.range[1] - 1, rep.value);
+					}
+				}
+				source.replace(dep.valueRange[1], dep.range[1] - 1, ")");
+				source.replace(
+					dep.range[0],
+					dep.valueRange[0] - 1,
+					`${moduleExports}.resolve(`
+				);
+			} else {
+				source.replace(
+					dep.range[0],
+					dep.range[1] - 1,
+					`${moduleExports}.resolve`
+				);
+			}
+		} else {
+			source.replace(dep.range[0], dep.range[1] - 1, moduleExports);
+		}
+	}
+}
+module.exports = ContextDependencyTemplateAsId;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyTemplateAsRequireCall.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyTemplateAsRequireCall.js
new file mode 100644
index 0000000..8907f9f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextDependencyTemplateAsRequireCall.js
@@ -0,0 +1,59 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ContextDependency = require("./ContextDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class ContextDependencyTemplateAsRequireCall extends ContextDependency.Template {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {ContextDependency} */ (dependency);
+		let moduleExports = runtimeTemplate.moduleExports({
+			module: moduleGraph.getModule(dep),
+			chunkGraph,
+			request: dep.request,
+			runtimeRequirements
+		});
+
+		if (dep.inShorthand) {
+			moduleExports = `${dep.inShorthand}: ${moduleExports}`;
+		}
+		if (moduleGraph.getModule(dep)) {
+			if (dep.valueRange) {
+				if (Array.isArray(dep.replaces)) {
+					for (let i = 0; i < dep.replaces.length; i++) {
+						const rep = dep.replaces[i];
+						source.replace(rep.range[0], rep.range[1] - 1, rep.value);
+					}
+				}
+				source.replace(dep.valueRange[1], dep.range[1] - 1, ")");
+				source.replace(
+					dep.range[0],
+					dep.valueRange[0] - 1,
+					`${moduleExports}(`
+				);
+			} else {
+				source.replace(dep.range[0], dep.range[1] - 1, moduleExports);
+			}
+		} else {
+			source.replace(dep.range[0], dep.range[1] - 1, moduleExports);
+		}
+	}
+}
+module.exports = ContextDependencyTemplateAsRequireCall;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextElementDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextElementDependency.js
new file mode 100644
index 0000000..0ea6bfd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ContextElementDependency.js
@@ -0,0 +1,77 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class ContextElementDependency extends ModuleDependency {
+	constructor(request, userRequest, typePrefix, category, referencedExports) {
+		super(request);
+		this.referencedExports = referencedExports;
+		this._typePrefix = typePrefix;
+		this._category = category;
+
+		if (userRequest) {
+			this.userRequest = userRequest;
+		}
+	}
+
+	get type() {
+		if (this._typePrefix) {
+			return `${this._typePrefix} context element`;
+		}
+
+		return "context element";
+	}
+
+	get category() {
+		return this._category;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return this.referencedExports
+			? this.referencedExports.map(e => ({
+					name: e,
+					canMangle: false
+			  }))
+			: Dependency.EXPORTS_OBJECT_REFERENCED;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this._typePrefix);
+		write(this._category);
+		write(this.referencedExports);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this._typePrefix = read();
+		this._category = read();
+		this.referencedExports = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	ContextElementDependency,
+	"webpack/lib/dependencies/ContextElementDependency"
+);
+
+module.exports = ContextElementDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CreateScriptUrlDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CreateScriptUrlDependency.js
new file mode 100644
index 0000000..30b39b7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CreateScriptUrlDependency.js
@@ -0,0 +1,66 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class CreateScriptUrlDependency extends NullDependency {
+	/**
+	 * @param {[number, number]} range range
+	 */
+	constructor(range) {
+		super();
+		this.range = range;
+	}
+
+	get type() {
+		return "create script url";
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		super.deserialize(context);
+	}
+}
+
+CreateScriptUrlDependency.Template = class CreateScriptUrlDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeRequirements }) {
+		const dep = /** @type {CreateScriptUrlDependency} */ (dependency);
+
+		runtimeRequirements.add(RuntimeGlobals.createScriptUrl);
+
+		source.insert(dep.range[0], `${RuntimeGlobals.createScriptUrl}(`);
+		source.insert(dep.range[1], ")");
+	}
+};
+
+makeSerializable(
+	CreateScriptUrlDependency,
+	"webpack/lib/dependencies/CreateScriptUrlDependency"
+);
+
+module.exports = CreateScriptUrlDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CriticalDependencyWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CriticalDependencyWarning.js
new file mode 100644
index 0000000..4501e68
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CriticalDependencyWarning.js
@@ -0,0 +1,25 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+const makeSerializable = require("../util/makeSerializable");
+
+class CriticalDependencyWarning extends WebpackError {
+	constructor(message) {
+		super();
+
+		this.name = "CriticalDependencyWarning";
+		this.message = "Critical dependency: " + message;
+	}
+}
+
+makeSerializable(
+	CriticalDependencyWarning,
+	"webpack/lib/dependencies/CriticalDependencyWarning"
+);
+
+module.exports = CriticalDependencyWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssExportDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssExportDependency.js
new file mode 100644
index 0000000..440e66f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssExportDependency.js
@@ -0,0 +1,85 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../DependencyTemplate").CssDependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+
+class CssExportDependency extends NullDependency {
+	/**
+	 * @param {string} name name
+	 * @param {string} value value
+	 */
+	constructor(name, value) {
+		super();
+		this.name = name;
+		this.value = value;
+	}
+
+	get type() {
+		return "css :export";
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		const name = this.name;
+		return {
+			exports: [
+				{
+					name,
+					canMangle: true
+				}
+			],
+			dependencies: undefined
+		};
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.name);
+		write(this.value);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.name = read();
+		this.value = read();
+		super.deserialize(context);
+	}
+}
+
+CssExportDependency.Template = class CssExportDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { cssExports }) {
+		const dep = /** @type {CssExportDependency} */ (dependency);
+		cssExports.set(dep.name, dep.value);
+	}
+};
+
+makeSerializable(
+	CssExportDependency,
+	"webpack/lib/dependencies/CssExportDependency"
+);
+
+module.exports = CssExportDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssImportDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssImportDependency.js
new file mode 100644
index 0000000..8f02d6e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssImportDependency.js
@@ -0,0 +1,75 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class CssImportDependency extends ModuleDependency {
+	/**
+	 * @param {string} request request
+	 * @param {[number, number]} range range of the argument
+	 * @param {string | undefined} supports list of supports conditions
+	 * @param {string | undefined} media list of media conditions
+	 */
+	constructor(request, range, supports, media) {
+		super(request);
+		this.range = range;
+		this.supports = supports;
+		this.media = media;
+	}
+
+	get type() {
+		return "css @import";
+	}
+
+	get category() {
+		return "css-import";
+	}
+
+	/**
+	 * @param {string} context context directory
+	 * @returns {Module} a module
+	 */
+	createIgnoredModule(context) {
+		return null;
+	}
+}
+
+CssImportDependency.Template = class CssImportDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {CssImportDependency} */ (dependency);
+
+		source.replace(dep.range[0], dep.range[1] - 1, "");
+	}
+};
+
+makeSerializable(
+	CssImportDependency,
+	"webpack/lib/dependencies/CssImportDependency"
+);
+
+module.exports = CssImportDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssLocalIdentifierDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssLocalIdentifierDependency.js
new file mode 100644
index 0000000..02ced92
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssLocalIdentifierDependency.js
@@ -0,0 +1,119 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../DependencyTemplate").CssDependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+
+class CssLocalIdentifierDependency extends NullDependency {
+	/**
+	 * @param {string} name name
+	 * @param {[number, number]} range range
+	 * @param {string=} prefix prefix
+	 */
+	constructor(name, range, prefix = "") {
+		super();
+		this.name = name;
+		this.range = range;
+		this.prefix = prefix;
+	}
+
+	get type() {
+		return "css local identifier";
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		const name = this.name;
+		return {
+			exports: [
+				{
+					name,
+					canMangle: true
+				}
+			],
+			dependencies: undefined
+		};
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.name);
+		write(this.range);
+		write(this.prefix);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.name = read();
+		this.range = read();
+		this.prefix = read();
+		super.deserialize(context);
+	}
+}
+
+const escapeCssIdentifier = (str, omitUnderscore) => {
+	const escaped = `${str}`.replace(
+		// cspell:word uffff
+		/[^a-zA-Z0-9_\u0081-\uffff-]/g,
+		s => `\\${s}`
+	);
+	return !omitUnderscore && /^(?!--)[0-9-]/.test(escaped)
+		? `_${escaped}`
+		: escaped;
+};
+
+CssLocalIdentifierDependency.Template = class CssLocalIdentifierDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ module, moduleGraph, chunkGraph, runtime, runtimeTemplate, cssExports }
+	) {
+		const dep = /** @type {CssLocalIdentifierDependency} */ (dependency);
+		const used = moduleGraph
+			.getExportInfo(module, dep.name)
+			.getUsedName(dep.name, runtime);
+		const moduleId = chunkGraph.getModuleId(module);
+		const identifier =
+			dep.prefix +
+			(runtimeTemplate.outputOptions.uniqueName
+				? runtimeTemplate.outputOptions.uniqueName + "-"
+				: "") +
+			(used ? moduleId + "-" + used : "-");
+		source.replace(
+			dep.range[0],
+			dep.range[1] - 1,
+			escapeCssIdentifier(identifier, dep.prefix)
+		);
+		if (used) cssExports.set(used, identifier);
+	}
+};
+
+makeSerializable(
+	CssLocalIdentifierDependency,
+	"webpack/lib/dependencies/CssLocalIdentifierDependency"
+);
+
+module.exports = CssLocalIdentifierDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssSelfLocalIdentifierDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssSelfLocalIdentifierDependency.js
new file mode 100644
index 0000000..dcb8be2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssSelfLocalIdentifierDependency.js
@@ -0,0 +1,101 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+const CssLocalIdentifierDependency = require("./CssLocalIdentifierDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").CssDependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class CssSelfLocalIdentifierDependency extends CssLocalIdentifierDependency {
+	/**
+	 * @param {string} name name
+	 * @param {[number, number]} range range
+	 * @param {string=} prefix prefix
+	 * @param {Set<string>=} declaredSet set of declared names (will only be active when in declared set)
+	 */
+	constructor(name, range, prefix = "", declaredSet = undefined) {
+		super(name, range, prefix);
+		this.declaredSet = declaredSet;
+	}
+
+	get type() {
+		return "css self local identifier";
+	}
+
+	get category() {
+		return "self";
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return `self`;
+	}
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		if (this.declaredSet && !this.declaredSet.has(this.name)) return;
+		return super.getExports(moduleGraph);
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		if (this.declaredSet && !this.declaredSet.has(this.name))
+			return Dependency.NO_EXPORTS_REFERENCED;
+		return [[this.name]];
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.declaredSet);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.declaredSet = read();
+		super.deserialize(context);
+	}
+}
+
+CssSelfLocalIdentifierDependency.Template = class CssSelfLocalIdentifierDependencyTemplate extends (
+	CssLocalIdentifierDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {CssSelfLocalIdentifierDependency} */ (dependency);
+		if (dep.declaredSet && !dep.declaredSet.has(dep.name)) return;
+		super.apply(dependency, source, templateContext);
+	}
+};
+
+makeSerializable(
+	CssSelfLocalIdentifierDependency,
+	"webpack/lib/dependencies/CssSelfLocalIdentifierDependency"
+);
+
+module.exports = CssSelfLocalIdentifierDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssUrlDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssUrlDependency.js
new file mode 100644
index 0000000..8c16310
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/CssUrlDependency.js
@@ -0,0 +1,132 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const memoize = require("../util/memoize");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+const getRawDataUrlModule = memoize(() => require("../asset/RawDataUrlModule"));
+
+class CssUrlDependency extends ModuleDependency {
+	/**
+	 * @param {string} request request
+	 * @param {[number, number]} range range of the argument
+	 * @param {string} cssFunctionKind kind of css function, e. g. url(), image()
+	 */
+	constructor(request, range, cssFunctionKind) {
+		super(request);
+		this.range = range;
+		this.cssFunctionKind = cssFunctionKind;
+	}
+
+	get type() {
+		return "css url()";
+	}
+
+	get category() {
+		return "url";
+	}
+
+	/**
+	 * @param {string} context context directory
+	 * @returns {Module} a module
+	 */
+	createIgnoredModule(context) {
+		const RawDataUrlModule = getRawDataUrlModule();
+		return new RawDataUrlModule("data:,", `ignored-asset`, `(ignored asset)`);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.cssFunctionKind);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.cssFunctionKind = read();
+		super.deserialize(context);
+	}
+}
+
+const cssEscapeString = str => {
+	let countWhiteOrBracket = 0;
+	let countQuotation = 0;
+	let countApostrophe = 0;
+	for (let i = 0; i < str.length; i++) {
+		const cc = str.charCodeAt(i);
+		switch (cc) {
+			case 9: // tab
+			case 10: // nl
+			case 32: // space
+			case 40: // (
+			case 41: // )
+				countWhiteOrBracket++;
+				break;
+			case 34:
+				countQuotation++;
+				break;
+			case 39:
+				countApostrophe++;
+				break;
+		}
+	}
+	if (countWhiteOrBracket < 2) {
+		return str.replace(/[\n\t ()'"\\]/g, m => `\\${m}`);
+	} else if (countQuotation <= countApostrophe) {
+		return `"${str.replace(/[\n"\\]/g, m => `\\${m}`)}"`;
+	} else {
+		return `'${str.replace(/[\n'\\]/g, m => `\\${m}`)}'`;
+	}
+};
+
+CssUrlDependency.Template = class CssUrlDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtime, moduleGraph, runtimeTemplate, codeGenerationResults }
+	) {
+		const dep = /** @type {CssUrlDependency} */ (dependency);
+
+		source.replace(
+			dep.range[0],
+			dep.range[1] - 1,
+			`${dep.cssFunctionKind}(${cssEscapeString(
+				runtimeTemplate.assetUrl({
+					publicPath: "",
+					runtime,
+					module: moduleGraph.getModule(dep),
+					codeGenerationResults
+				})
+			)})`
+		);
+	}
+};
+
+makeSerializable(CssUrlDependency, "webpack/lib/dependencies/CssUrlDependency");
+
+module.exports = CssUrlDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DelegatedSourceDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DelegatedSourceDependency.js
new file mode 100644
index 0000000..238c62d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DelegatedSourceDependency.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+class DelegatedSourceDependency extends ModuleDependency {
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "delegated source";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	DelegatedSourceDependency,
+	"webpack/lib/dependencies/DelegatedSourceDependency"
+);
+
+module.exports = DelegatedSourceDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DllEntryDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DllEntryDependency.js
new file mode 100644
index 0000000..1c3feee
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DllEntryDependency.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class DllEntryDependency extends Dependency {
+	constructor(dependencies, name) {
+		super();
+
+		this.dependencies = dependencies;
+		this.name = name;
+	}
+
+	get type() {
+		return "dll entry";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.dependencies);
+		write(this.name);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.dependencies = read();
+		this.name = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	DllEntryDependency,
+	"webpack/lib/dependencies/DllEntryDependency"
+);
+
+module.exports = DllEntryDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DynamicExports.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DynamicExports.js
new file mode 100644
index 0000000..7b3a827
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/DynamicExports.js
@@ -0,0 +1,69 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Parser").ParserState} ParserState */
+
+/** @type {WeakMap<ParserState, boolean>} */
+const parserStateExportsState = new WeakMap();
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {void}
+ */
+exports.bailout = parserState => {
+	const value = parserStateExportsState.get(parserState);
+	parserStateExportsState.set(parserState, false);
+	if (value === true) {
+		parserState.module.buildMeta.exportsType = undefined;
+		parserState.module.buildMeta.defaultObject = false;
+	}
+};
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {void}
+ */
+exports.enable = parserState => {
+	const value = parserStateExportsState.get(parserState);
+	if (value === false) return;
+	parserStateExportsState.set(parserState, true);
+	if (value !== true) {
+		parserState.module.buildMeta.exportsType = "default";
+		parserState.module.buildMeta.defaultObject = "redirect";
+	}
+};
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {void}
+ */
+exports.setFlagged = parserState => {
+	const value = parserStateExportsState.get(parserState);
+	if (value !== true) return;
+	const buildMeta = parserState.module.buildMeta;
+	if (buildMeta.exportsType === "dynamic") return;
+	buildMeta.exportsType = "flagged";
+};
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {void}
+ */
+exports.setDynamic = parserState => {
+	const value = parserStateExportsState.get(parserState);
+	if (value !== true) return;
+	parserState.module.buildMeta.exportsType = "dynamic";
+};
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {boolean} true, when enabled
+ */
+exports.isEnabled = parserState => {
+	const value = parserStateExportsState.get(parserState);
+	return value === true;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/EntryDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/EntryDependency.js
new file mode 100644
index 0000000..f464449
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/EntryDependency.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+class EntryDependency extends ModuleDependency {
+	/**
+	 * @param {string} request request path for entry
+	 */
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "entry";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(EntryDependency, "webpack/lib/dependencies/EntryDependency");
+
+module.exports = EntryDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ExportsInfoDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ExportsInfoDependency.js
new file mode 100644
index 0000000..0b7b179
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ExportsInfoDependency.js
@@ -0,0 +1,143 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { UsageState } = require("../ExportsInfo");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {Module} module the module
+ * @param {string | null} exportName name of the export if any
+ * @param {string | null} property name of the requested property
+ * @param {RuntimeSpec} runtime for which runtime
+ * @returns {any} value of the property
+ */
+const getProperty = (moduleGraph, module, exportName, property, runtime) => {
+	if (!exportName) {
+		switch (property) {
+			case "usedExports": {
+				const usedExports = moduleGraph
+					.getExportsInfo(module)
+					.getUsedExports(runtime);
+				if (
+					typeof usedExports === "boolean" ||
+					usedExports === undefined ||
+					usedExports === null
+				) {
+					return usedExports;
+				}
+				return Array.from(usedExports).sort();
+			}
+		}
+	}
+	switch (property) {
+		case "canMangle": {
+			const exportsInfo = moduleGraph.getExportsInfo(module);
+			const exportInfo = exportsInfo.getExportInfo(exportName);
+			if (exportInfo) return exportInfo.canMangle;
+			return exportsInfo.otherExportsInfo.canMangle;
+		}
+		case "used":
+			return (
+				moduleGraph.getExportsInfo(module).getUsed(exportName, runtime) !==
+				UsageState.Unused
+			);
+		case "useInfo": {
+			const state = moduleGraph
+				.getExportsInfo(module)
+				.getUsed(exportName, runtime);
+			switch (state) {
+				case UsageState.Used:
+				case UsageState.OnlyPropertiesUsed:
+					return true;
+				case UsageState.Unused:
+					return false;
+				case UsageState.NoInfo:
+					return undefined;
+				case UsageState.Unknown:
+					return null;
+				default:
+					throw new Error(`Unexpected UsageState ${state}`);
+			}
+		}
+		case "provideInfo":
+			return moduleGraph.getExportsInfo(module).isExportProvided(exportName);
+	}
+	return undefined;
+};
+
+class ExportsInfoDependency extends NullDependency {
+	constructor(range, exportName, property) {
+		super();
+		this.range = range;
+		this.exportName = exportName;
+		this.property = property;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.exportName);
+		write(this.property);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const obj = new ExportsInfoDependency(
+			context.read(),
+			context.read(),
+			context.read()
+		);
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(
+	ExportsInfoDependency,
+	"webpack/lib/dependencies/ExportsInfoDependency"
+);
+
+ExportsInfoDependency.Template = class ExportsInfoDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { module, moduleGraph, runtime }) {
+		const dep = /** @type {ExportsInfoDependency} */ (dependency);
+
+		const value = getProperty(
+			moduleGraph,
+			module,
+			dep.exportName,
+			dep.property,
+			runtime
+		);
+		source.replace(
+			dep.range[0],
+			dep.range[1] - 1,
+			value === undefined ? "undefined" : JSON.stringify(value)
+		);
+	}
+};
+
+module.exports = ExportsInfoDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyAcceptDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyAcceptDependency.js
new file mode 100644
index 0000000..560d9bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyAcceptDependency.js
@@ -0,0 +1,134 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Template = require("../Template");
+const makeSerializable = require("../util/makeSerializable");
+const HarmonyImportDependency = require("./HarmonyImportDependency");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("./HarmonyAcceptImportDependency")} HarmonyAcceptImportDependency */
+
+class HarmonyAcceptDependency extends NullDependency {
+	/**
+	 * @param {[number, number]} range expression range
+	 * @param {HarmonyAcceptImportDependency[]} dependencies import dependencies
+	 * @param {boolean} hasCallback true, if the range wraps an existing callback
+	 */
+	constructor(range, dependencies, hasCallback) {
+		super();
+		this.range = range;
+		this.dependencies = dependencies;
+		this.hasCallback = hasCallback;
+	}
+
+	get type() {
+		return "accepted harmony modules";
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.dependencies);
+		write(this.hasCallback);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		this.dependencies = read();
+		this.hasCallback = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	HarmonyAcceptDependency,
+	"webpack/lib/dependencies/HarmonyAcceptDependency"
+);
+
+HarmonyAcceptDependency.Template = class HarmonyAcceptDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {HarmonyAcceptDependency} */ (dependency);
+		const {
+			module,
+			runtime,
+			runtimeRequirements,
+			runtimeTemplate,
+			moduleGraph,
+			chunkGraph
+		} = templateContext;
+		const content = dep.dependencies
+			.map(dependency => {
+				const referencedModule = moduleGraph.getModule(dependency);
+				return {
+					dependency,
+					runtimeCondition: referencedModule
+						? HarmonyImportDependency.Template.getImportEmittedRuntime(
+								module,
+								referencedModule
+						  )
+						: false
+				};
+			})
+			.filter(({ runtimeCondition }) => runtimeCondition !== false)
+			.map(({ dependency, runtimeCondition }) => {
+				const condition = runtimeTemplate.runtimeConditionExpression({
+					chunkGraph,
+					runtime,
+					runtimeCondition,
+					runtimeRequirements
+				});
+				const s = dependency.getImportStatement(true, templateContext);
+				const code = s[0] + s[1];
+				if (condition !== "true") {
+					return `if (${condition}) {\n${Template.indent(code)}\n}\n`;
+				}
+				return code;
+			})
+			.join("");
+
+		if (dep.hasCallback) {
+			if (runtimeTemplate.supportsArrowFunction()) {
+				source.insert(
+					dep.range[0],
+					`__WEBPACK_OUTDATED_DEPENDENCIES__ => { ${content}(`
+				);
+				source.insert(dep.range[1], ")(__WEBPACK_OUTDATED_DEPENDENCIES__); }");
+			} else {
+				source.insert(
+					dep.range[0],
+					`function(__WEBPACK_OUTDATED_DEPENDENCIES__) { ${content}(`
+				);
+				source.insert(
+					dep.range[1],
+					")(__WEBPACK_OUTDATED_DEPENDENCIES__); }.bind(this)"
+				);
+			}
+			return;
+		}
+
+		const arrow = runtimeTemplate.supportsArrowFunction();
+		source.insert(
+			dep.range[1] - 0.5,
+			`, ${arrow ? "() =>" : "function()"} { ${content} }`
+		);
+	}
+};
+
+module.exports = HarmonyAcceptDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyAcceptImportDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyAcceptImportDependency.js
new file mode 100644
index 0000000..9fbffac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyAcceptImportDependency.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const HarmonyImportDependency = require("./HarmonyImportDependency");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class HarmonyAcceptImportDependency extends HarmonyImportDependency {
+	constructor(request) {
+		super(request, NaN);
+		this.weak = true;
+	}
+
+	get type() {
+		return "harmony accept";
+	}
+}
+
+makeSerializable(
+	HarmonyAcceptImportDependency,
+	"webpack/lib/dependencies/HarmonyAcceptImportDependency"
+);
+
+HarmonyAcceptImportDependency.Template =
+	/** @type {typeof HarmonyImportDependency.Template} */ (
+		NullDependency.Template
+	);
+
+module.exports = HarmonyAcceptImportDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyCompatibilityDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyCompatibilityDependency.js
new file mode 100644
index 0000000..cf2257c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyCompatibilityDependency.js
@@ -0,0 +1,91 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { UsageState } = require("../ExportsInfo");
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Module")} Module */
+
+class HarmonyCompatibilityDependency extends NullDependency {
+	get type() {
+		return "harmony export header";
+	}
+}
+
+makeSerializable(
+	HarmonyCompatibilityDependency,
+	"webpack/lib/dependencies/HarmonyCompatibilityDependency"
+);
+
+HarmonyCompatibilityDependency.Template = class HarmonyExportDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{
+			module,
+			runtimeTemplate,
+			moduleGraph,
+			initFragments,
+			runtimeRequirements,
+			runtime,
+			concatenationScope
+		}
+	) {
+		if (concatenationScope) return;
+		const exportsInfo = moduleGraph.getExportsInfo(module);
+		if (
+			exportsInfo.getReadOnlyExportInfo("__esModule").getUsed(runtime) !==
+			UsageState.Unused
+		) {
+			const content = runtimeTemplate.defineEsModuleFlagStatement({
+				exportsArgument: module.exportsArgument,
+				runtimeRequirements
+			});
+			initFragments.push(
+				new InitFragment(
+					content,
+					InitFragment.STAGE_HARMONY_EXPORTS,
+					0,
+					"harmony compatibility"
+				)
+			);
+		}
+		if (moduleGraph.isAsync(module)) {
+			runtimeRequirements.add(RuntimeGlobals.module);
+			runtimeRequirements.add(RuntimeGlobals.asyncModule);
+			initFragments.push(
+				new InitFragment(
+					runtimeTemplate.supportsArrowFunction()
+						? `${RuntimeGlobals.asyncModule}(${module.moduleArgument}, async (__webpack_handle_async_dependencies__, __webpack_async_result__) => { try {\n`
+						: `${RuntimeGlobals.asyncModule}(${module.moduleArgument}, async function (__webpack_handle_async_dependencies__, __webpack_async_result__) { try {\n`,
+					InitFragment.STAGE_ASYNC_BOUNDARY,
+					0,
+					undefined,
+					`\n__webpack_async_result__();\n} catch(e) { __webpack_async_result__(e); } }${
+						module.buildMeta.async ? ", 1" : ""
+					});`
+				)
+			);
+		}
+	}
+};
+
+module.exports = HarmonyCompatibilityDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyDetectionParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyDetectionParserPlugin.js
new file mode 100644
index 0000000..a9ea918
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyDetectionParserPlugin.js
@@ -0,0 +1,97 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const DynamicExports = require("./DynamicExports");
+const HarmonyCompatibilityDependency = require("./HarmonyCompatibilityDependency");
+const HarmonyExports = require("./HarmonyExports");
+
+module.exports = class HarmonyDetectionParserPlugin {
+	constructor(options) {
+		const { topLevelAwait = false } = options || {};
+		this.topLevelAwait = topLevelAwait;
+	}
+
+	apply(parser) {
+		parser.hooks.program.tap("HarmonyDetectionParserPlugin", ast => {
+			const isStrictHarmony = parser.state.module.type === "javascript/esm";
+			const isHarmony =
+				isStrictHarmony ||
+				ast.body.some(
+					statement =>
+						statement.type === "ImportDeclaration" ||
+						statement.type === "ExportDefaultDeclaration" ||
+						statement.type === "ExportNamedDeclaration" ||
+						statement.type === "ExportAllDeclaration"
+				);
+			if (isHarmony) {
+				const module = parser.state.module;
+				const compatDep = new HarmonyCompatibilityDependency();
+				compatDep.loc = {
+					start: {
+						line: -1,
+						column: 0
+					},
+					end: {
+						line: -1,
+						column: 0
+					},
+					index: -3
+				};
+				module.addPresentationalDependency(compatDep);
+				DynamicExports.bailout(parser.state);
+				HarmonyExports.enable(parser.state, isStrictHarmony);
+				parser.scope.isStrict = true;
+			}
+		});
+
+		parser.hooks.topLevelAwait.tap("HarmonyDetectionParserPlugin", () => {
+			const module = parser.state.module;
+			if (!this.topLevelAwait) {
+				throw new Error(
+					"The top-level-await experiment is not enabled (set experiments.topLevelAwait: true to enabled it)"
+				);
+			}
+			if (!HarmonyExports.isEnabled(parser.state)) {
+				throw new Error(
+					"Top-level-await is only supported in EcmaScript Modules"
+				);
+			}
+			module.buildMeta.async = true;
+		});
+
+		const skipInHarmony = () => {
+			if (HarmonyExports.isEnabled(parser.state)) {
+				return true;
+			}
+		};
+
+		const nullInHarmony = () => {
+			if (HarmonyExports.isEnabled(parser.state)) {
+				return null;
+			}
+		};
+
+		const nonHarmonyIdentifiers = ["define", "exports"];
+		for (const identifier of nonHarmonyIdentifiers) {
+			parser.hooks.evaluateTypeof
+				.for(identifier)
+				.tap("HarmonyDetectionParserPlugin", nullInHarmony);
+			parser.hooks.typeof
+				.for(identifier)
+				.tap("HarmonyDetectionParserPlugin", skipInHarmony);
+			parser.hooks.evaluate
+				.for(identifier)
+				.tap("HarmonyDetectionParserPlugin", nullInHarmony);
+			parser.hooks.expression
+				.for(identifier)
+				.tap("HarmonyDetectionParserPlugin", skipInHarmony);
+			parser.hooks.call
+				.for(identifier)
+				.tap("HarmonyDetectionParserPlugin", skipInHarmony);
+		}
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportDependencyParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportDependencyParserPlugin.js
new file mode 100644
index 0000000..2beefc0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportDependencyParserPlugin.js
@@ -0,0 +1,185 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const InnerGraph = require("../optimize/InnerGraph");
+const ConstDependency = require("./ConstDependency");
+const HarmonyExportExpressionDependency = require("./HarmonyExportExpressionDependency");
+const HarmonyExportHeaderDependency = require("./HarmonyExportHeaderDependency");
+const HarmonyExportImportedSpecifierDependency = require("./HarmonyExportImportedSpecifierDependency");
+const HarmonyExportSpecifierDependency = require("./HarmonyExportSpecifierDependency");
+const { ExportPresenceModes } = require("./HarmonyImportDependency");
+const {
+	harmonySpecifierTag,
+	getAssertions
+} = require("./HarmonyImportDependencyParserPlugin");
+const HarmonyImportSideEffectDependency = require("./HarmonyImportSideEffectDependency");
+
+const { HarmonyStarExportsList } = HarmonyExportImportedSpecifierDependency;
+
+module.exports = class HarmonyExportDependencyParserPlugin {
+	constructor(options) {
+		this.exportPresenceMode =
+			options.reexportExportsPresence !== undefined
+				? ExportPresenceModes.fromUserOption(options.reexportExportsPresence)
+				: options.exportsPresence !== undefined
+				? ExportPresenceModes.fromUserOption(options.exportsPresence)
+				: options.strictExportPresence
+				? ExportPresenceModes.ERROR
+				: ExportPresenceModes.AUTO;
+	}
+
+	apply(parser) {
+		const { exportPresenceMode } = this;
+		parser.hooks.export.tap(
+			"HarmonyExportDependencyParserPlugin",
+			statement => {
+				const dep = new HarmonyExportHeaderDependency(
+					statement.declaration && statement.declaration.range,
+					statement.range
+				);
+				dep.loc = Object.create(statement.loc);
+				dep.loc.index = -1;
+				parser.state.module.addPresentationalDependency(dep);
+				return true;
+			}
+		);
+		parser.hooks.exportImport.tap(
+			"HarmonyExportDependencyParserPlugin",
+			(statement, source) => {
+				parser.state.lastHarmonyImportOrder =
+					(parser.state.lastHarmonyImportOrder || 0) + 1;
+				const clearDep = new ConstDependency("", statement.range);
+				clearDep.loc = Object.create(statement.loc);
+				clearDep.loc.index = -1;
+				parser.state.module.addPresentationalDependency(clearDep);
+				const sideEffectDep = new HarmonyImportSideEffectDependency(
+					source,
+					parser.state.lastHarmonyImportOrder,
+					getAssertions(statement)
+				);
+				sideEffectDep.loc = Object.create(statement.loc);
+				sideEffectDep.loc.index = -1;
+				parser.state.current.addDependency(sideEffectDep);
+				return true;
+			}
+		);
+		parser.hooks.exportExpression.tap(
+			"HarmonyExportDependencyParserPlugin",
+			(statement, expr) => {
+				const isFunctionDeclaration = expr.type === "FunctionDeclaration";
+				const comments = parser.getComments([
+					statement.range[0],
+					expr.range[0]
+				]);
+				const dep = new HarmonyExportExpressionDependency(
+					expr.range,
+					statement.range,
+					comments
+						.map(c => {
+							switch (c.type) {
+								case "Block":
+									return `/*${c.value}*/`;
+								case "Line":
+									return `//${c.value}\n`;
+							}
+							return "";
+						})
+						.join(""),
+					expr.type.endsWith("Declaration") && expr.id
+						? expr.id.name
+						: isFunctionDeclaration
+						? {
+								id: expr.id ? expr.id.name : undefined,
+								range: [
+									expr.range[0],
+									expr.params.length > 0
+										? expr.params[0].range[0]
+										: expr.body.range[0]
+								],
+								prefix: `${expr.async ? "async " : ""}function${
+									expr.generator ? "*" : ""
+								} `,
+								suffix: `(${expr.params.length > 0 ? "" : ") "}`
+						  }
+						: undefined
+				);
+				dep.loc = Object.create(statement.loc);
+				dep.loc.index = -1;
+				parser.state.current.addDependency(dep);
+				InnerGraph.addVariableUsage(
+					parser,
+					expr.type.endsWith("Declaration") && expr.id
+						? expr.id.name
+						: "*default*",
+					"default"
+				);
+				return true;
+			}
+		);
+		parser.hooks.exportSpecifier.tap(
+			"HarmonyExportDependencyParserPlugin",
+			(statement, id, name, idx) => {
+				const settings = parser.getTagData(id, harmonySpecifierTag);
+				let dep;
+				const harmonyNamedExports = (parser.state.harmonyNamedExports =
+					parser.state.harmonyNamedExports || new Set());
+				harmonyNamedExports.add(name);
+				InnerGraph.addVariableUsage(parser, id, name);
+				if (settings) {
+					dep = new HarmonyExportImportedSpecifierDependency(
+						settings.source,
+						settings.sourceOrder,
+						settings.ids,
+						name,
+						harmonyNamedExports,
+						null,
+						exportPresenceMode,
+						null,
+						settings.assertions
+					);
+				} else {
+					dep = new HarmonyExportSpecifierDependency(id, name);
+				}
+				dep.loc = Object.create(statement.loc);
+				dep.loc.index = idx;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+		);
+		parser.hooks.exportImportSpecifier.tap(
+			"HarmonyExportDependencyParserPlugin",
+			(statement, source, id, name, idx) => {
+				const harmonyNamedExports = (parser.state.harmonyNamedExports =
+					parser.state.harmonyNamedExports || new Set());
+				let harmonyStarExports = null;
+				if (name) {
+					harmonyNamedExports.add(name);
+				} else {
+					harmonyStarExports = parser.state.harmonyStarExports =
+						parser.state.harmonyStarExports || new HarmonyStarExportsList();
+				}
+				const dep = new HarmonyExportImportedSpecifierDependency(
+					source,
+					parser.state.lastHarmonyImportOrder,
+					id ? [id] : [],
+					name,
+					harmonyNamedExports,
+					harmonyStarExports && harmonyStarExports.slice(),
+					exportPresenceMode,
+					harmonyStarExports
+				);
+				if (harmonyStarExports) {
+					harmonyStarExports.push(dep);
+				}
+				dep.loc = Object.create(statement.loc);
+				dep.loc.index = idx;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+		);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportExpressionDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportExpressionDependency.js
new file mode 100644
index 0000000..81b6027
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportExpressionDependency.js
@@ -0,0 +1,190 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ConcatenationScope = require("../ConcatenationScope");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const HarmonyExportInitFragment = require("./HarmonyExportInitFragment");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+
+class HarmonyExportExpressionDependency extends NullDependency {
+	constructor(range, rangeStatement, prefix, declarationId) {
+		super();
+		this.range = range;
+		this.rangeStatement = rangeStatement;
+		this.prefix = prefix;
+		this.declarationId = declarationId;
+	}
+
+	get type() {
+		return "harmony export expression";
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		return {
+			exports: ["default"],
+			priority: 1,
+			terminalBinding: true,
+			dependencies: undefined
+		};
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		// The expression/declaration is already covered by SideEffectsFlagPlugin
+		return false;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.rangeStatement);
+		write(this.prefix);
+		write(this.declarationId);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		this.rangeStatement = read();
+		this.prefix = read();
+		this.declarationId = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	HarmonyExportExpressionDependency,
+	"webpack/lib/dependencies/HarmonyExportExpressionDependency"
+);
+
+HarmonyExportExpressionDependency.Template = class HarmonyExportDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{
+			module,
+			moduleGraph,
+			runtimeTemplate,
+			runtimeRequirements,
+			initFragments,
+			runtime,
+			concatenationScope
+		}
+	) {
+		const dep = /** @type {HarmonyExportExpressionDependency} */ (dependency);
+		const { declarationId } = dep;
+		const exportsName = module.exportsArgument;
+		if (declarationId) {
+			let name;
+			if (typeof declarationId === "string") {
+				name = declarationId;
+			} else {
+				name = ConcatenationScope.DEFAULT_EXPORT;
+				source.replace(
+					declarationId.range[0],
+					declarationId.range[1] - 1,
+					`${declarationId.prefix}${name}${declarationId.suffix}`
+				);
+			}
+
+			if (concatenationScope) {
+				concatenationScope.registerExport("default", name);
+			} else {
+				const used = moduleGraph
+					.getExportsInfo(module)
+					.getUsedName("default", runtime);
+				if (used) {
+					const map = new Map();
+					map.set(used, `/* export default binding */ ${name}`);
+					initFragments.push(new HarmonyExportInitFragment(exportsName, map));
+				}
+			}
+
+			source.replace(
+				dep.rangeStatement[0],
+				dep.range[0] - 1,
+				`/* harmony default export */ ${dep.prefix}`
+			);
+		} else {
+			let content;
+			const name = ConcatenationScope.DEFAULT_EXPORT;
+			if (runtimeTemplate.supportsConst()) {
+				content = `/* harmony default export */ const ${name} = `;
+				if (concatenationScope) {
+					concatenationScope.registerExport("default", name);
+				} else {
+					const used = moduleGraph
+						.getExportsInfo(module)
+						.getUsedName("default", runtime);
+					if (used) {
+						runtimeRequirements.add(RuntimeGlobals.exports);
+						const map = new Map();
+						map.set(used, name);
+						initFragments.push(new HarmonyExportInitFragment(exportsName, map));
+					} else {
+						content = `/* unused harmony default export */ var ${name} = `;
+					}
+				}
+			} else if (concatenationScope) {
+				content = `/* harmony default export */ var ${name} = `;
+				concatenationScope.registerExport("default", name);
+			} else {
+				const used = moduleGraph
+					.getExportsInfo(module)
+					.getUsedName("default", runtime);
+				if (used) {
+					runtimeRequirements.add(RuntimeGlobals.exports);
+					// This is a little bit incorrect as TDZ is not correct, but we can't use const.
+					content = `/* harmony default export */ ${exportsName}[${JSON.stringify(
+						used
+					)}] = `;
+				} else {
+					content = `/* unused harmony default export */ var ${name} = `;
+				}
+			}
+
+			if (dep.range) {
+				source.replace(
+					dep.rangeStatement[0],
+					dep.range[0] - 1,
+					content + "(" + dep.prefix
+				);
+				source.replace(dep.range[1], dep.rangeStatement[1] - 0.5, ");");
+				return;
+			}
+
+			source.replace(dep.rangeStatement[0], dep.rangeStatement[1] - 1, content);
+		}
+	}
+};
+
+module.exports = HarmonyExportExpressionDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportHeaderDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportHeaderDependency.js
new file mode 100644
index 0000000..7dacbec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportHeaderDependency.js
@@ -0,0 +1,65 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class HarmonyExportHeaderDependency extends NullDependency {
+	constructor(range, rangeStatement) {
+		super();
+		this.range = range;
+		this.rangeStatement = rangeStatement;
+	}
+
+	get type() {
+		return "harmony export header";
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.rangeStatement);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		this.rangeStatement = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	HarmonyExportHeaderDependency,
+	"webpack/lib/dependencies/HarmonyExportHeaderDependency"
+);
+
+HarmonyExportHeaderDependency.Template = class HarmonyExportDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {HarmonyExportHeaderDependency} */ (dependency);
+		const content = "";
+		const replaceUntil = dep.range
+			? dep.range[0] - 1
+			: dep.rangeStatement[1] - 1;
+		source.replace(dep.rangeStatement[0], replaceUntil, content);
+	}
+};
+
+module.exports = HarmonyExportHeaderDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportImportedSpecifierDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportImportedSpecifierDependency.js
new file mode 100644
index 0000000..3859254
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportImportedSpecifierDependency.js
@@ -0,0 +1,1271 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const { UsageState } = require("../ExportsInfo");
+const HarmonyLinkingError = require("../HarmonyLinkingError");
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const { countIterable } = require("../util/IterableHelpers");
+const { first, combine } = require("../util/SetHelpers");
+const makeSerializable = require("../util/makeSerializable");
+const propertyAccess = require("../util/propertyAccess");
+const { getRuntimeKey, keyToRuntime } = require("../util/runtime");
+const HarmonyExportInitFragment = require("./HarmonyExportInitFragment");
+const HarmonyImportDependency = require("./HarmonyImportDependency");
+const processExportInfo = require("./processExportInfo");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../Dependency").TRANSITIVE} TRANSITIVE */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ExportsInfo")} ExportsInfo */
+/** @typedef {import("../ExportsInfo").ExportInfo} ExportInfo */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+/** @typedef {"missing"|"unused"|"empty-star"|"reexport-dynamic-default"|"reexport-named-default"|"reexport-namespace-object"|"reexport-fake-namespace-object"|"reexport-undefined"|"normal-reexport"|"dynamic-reexport"} ExportModeType */
+
+const { ExportPresenceModes } = HarmonyImportDependency;
+
+const idsSymbol = Symbol("HarmonyExportImportedSpecifierDependency.ids");
+
+class NormalReexportItem {
+	/**
+	 * @param {string} name export name
+	 * @param {string[]} ids reexported ids from other module
+	 * @param {ExportInfo} exportInfo export info from other module
+	 * @param {boolean} checked true, if it should be checked at runtime if this export exists
+	 * @param {boolean} hidden true, if it is hidden behind another active export in the same module
+	 */
+	constructor(name, ids, exportInfo, checked, hidden) {
+		this.name = name;
+		this.ids = ids;
+		this.exportInfo = exportInfo;
+		this.checked = checked;
+		this.hidden = hidden;
+	}
+}
+
+class ExportMode {
+	/**
+	 * @param {ExportModeType} type type of the mode
+	 */
+	constructor(type) {
+		/** @type {ExportModeType} */
+		this.type = type;
+
+		// for "normal-reexport":
+		/** @type {NormalReexportItem[] | null} */
+		this.items = null;
+
+		// for "reexport-named-default" | "reexport-fake-namespace-object" | "reexport-namespace-object"
+		/** @type {string|null} */
+		this.name = null;
+		/** @type {ExportInfo | null} */
+		this.partialNamespaceExportInfo = null;
+
+		// for "dynamic-reexport":
+		/** @type {Set<string> | null} */
+		this.ignored = null;
+
+		// for "dynamic-reexport" | "empty-star":
+		/** @type {Set<string> | null} */
+		this.hidden = null;
+
+		// for "missing":
+		/** @type {string | null} */
+		this.userRequest = null;
+
+		// for "reexport-fake-namespace-object":
+		/** @type {number} */
+		this.fakeType = 0;
+	}
+}
+
+const determineExportAssignments = (
+	moduleGraph,
+	dependencies,
+	additionalDependency
+) => {
+	const names = new Set();
+	const dependencyIndices = [];
+
+	if (additionalDependency) {
+		dependencies = dependencies.concat(additionalDependency);
+	}
+
+	for (const dep of dependencies) {
+		const i = dependencyIndices.length;
+		dependencyIndices[i] = names.size;
+		const otherImportedModule = moduleGraph.getModule(dep);
+		if (otherImportedModule) {
+			const exportsInfo = moduleGraph.getExportsInfo(otherImportedModule);
+			for (const exportInfo of exportsInfo.exports) {
+				if (
+					exportInfo.provided === true &&
+					exportInfo.name !== "default" &&
+					!names.has(exportInfo.name)
+				) {
+					names.add(exportInfo.name);
+					dependencyIndices[i] = names.size;
+				}
+			}
+		}
+	}
+	dependencyIndices.push(names.size);
+
+	return { names: Array.from(names), dependencyIndices };
+};
+
+const findDependencyForName = (
+	{ names, dependencyIndices },
+	name,
+	dependencies
+) => {
+	const dependenciesIt = dependencies[Symbol.iterator]();
+	const dependencyIndicesIt = dependencyIndices[Symbol.iterator]();
+	let dependenciesItResult = dependenciesIt.next();
+	let dependencyIndicesItResult = dependencyIndicesIt.next();
+	if (dependencyIndicesItResult.done) return;
+	for (let i = 0; i < names.length; i++) {
+		while (i >= dependencyIndicesItResult.value) {
+			dependenciesItResult = dependenciesIt.next();
+			dependencyIndicesItResult = dependencyIndicesIt.next();
+			if (dependencyIndicesItResult.done) return;
+		}
+		if (names[i] === name) return dependenciesItResult.value;
+	}
+	return undefined;
+};
+
+/**
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {HarmonyExportImportedSpecifierDependency} dep the dependency
+ * @param {string} runtimeKey the runtime key
+ * @returns {ExportMode} the export mode
+ */
+const getMode = (moduleGraph, dep, runtimeKey) => {
+	const importedModule = moduleGraph.getModule(dep);
+
+	if (!importedModule) {
+		const mode = new ExportMode("missing");
+
+		mode.userRequest = dep.userRequest;
+
+		return mode;
+	}
+
+	const name = dep.name;
+	const runtime = keyToRuntime(runtimeKey);
+	const parentModule = moduleGraph.getParentModule(dep);
+	const exportsInfo = moduleGraph.getExportsInfo(parentModule);
+
+	if (
+		name
+			? exportsInfo.getUsed(name, runtime) === UsageState.Unused
+			: exportsInfo.isUsed(runtime) === false
+	) {
+		const mode = new ExportMode("unused");
+
+		mode.name = name || "*";
+
+		return mode;
+	}
+
+	const importedExportsType = importedModule.getExportsType(
+		moduleGraph,
+		parentModule.buildMeta.strictHarmonyModule
+	);
+
+	const ids = dep.getIds(moduleGraph);
+
+	// Special handling for reexporting the default export
+	// from non-namespace modules
+	if (name && ids.length > 0 && ids[0] === "default") {
+		switch (importedExportsType) {
+			case "dynamic": {
+				const mode = new ExportMode("reexport-dynamic-default");
+
+				mode.name = name;
+
+				return mode;
+			}
+			case "default-only":
+			case "default-with-named": {
+				const exportInfo = exportsInfo.getReadOnlyExportInfo(name);
+				const mode = new ExportMode("reexport-named-default");
+
+				mode.name = name;
+				mode.partialNamespaceExportInfo = exportInfo;
+
+				return mode;
+			}
+		}
+	}
+
+	// reexporting with a fixed name
+	if (name) {
+		let mode;
+		const exportInfo = exportsInfo.getReadOnlyExportInfo(name);
+
+		if (ids.length > 0) {
+			// export { name as name }
+			switch (importedExportsType) {
+				case "default-only":
+					mode = new ExportMode("reexport-undefined");
+					mode.name = name;
+					break;
+				default:
+					mode = new ExportMode("normal-reexport");
+					mode.items = [
+						new NormalReexportItem(name, ids, exportInfo, false, false)
+					];
+					break;
+			}
+		} else {
+			// export * as name
+			switch (importedExportsType) {
+				case "default-only":
+					mode = new ExportMode("reexport-fake-namespace-object");
+					mode.name = name;
+					mode.partialNamespaceExportInfo = exportInfo;
+					mode.fakeType = 0;
+					break;
+				case "default-with-named":
+					mode = new ExportMode("reexport-fake-namespace-object");
+					mode.name = name;
+					mode.partialNamespaceExportInfo = exportInfo;
+					mode.fakeType = 2;
+					break;
+				case "dynamic":
+				default:
+					mode = new ExportMode("reexport-namespace-object");
+					mode.name = name;
+					mode.partialNamespaceExportInfo = exportInfo;
+			}
+		}
+
+		return mode;
+	}
+
+	// Star reexporting
+
+	const { ignoredExports, exports, checked, hidden } = dep.getStarReexports(
+		moduleGraph,
+		runtime,
+		exportsInfo,
+		importedModule
+	);
+	if (!exports) {
+		// We have too few info about the modules
+		// Delegate the logic to the runtime code
+
+		const mode = new ExportMode("dynamic-reexport");
+		mode.ignored = ignoredExports;
+		mode.hidden = hidden;
+
+		return mode;
+	}
+
+	if (exports.size === 0) {
+		const mode = new ExportMode("empty-star");
+		mode.hidden = hidden;
+
+		return mode;
+	}
+
+	const mode = new ExportMode("normal-reexport");
+
+	mode.items = Array.from(
+		exports,
+		exportName =>
+			new NormalReexportItem(
+				exportName,
+				[exportName],
+				exportsInfo.getReadOnlyExportInfo(exportName),
+				checked.has(exportName),
+				false
+			)
+	);
+	if (hidden !== undefined) {
+		for (const exportName of hidden) {
+			mode.items.push(
+				new NormalReexportItem(
+					exportName,
+					[exportName],
+					exportsInfo.getReadOnlyExportInfo(exportName),
+					false,
+					true
+				)
+			);
+		}
+	}
+
+	return mode;
+};
+
+class HarmonyExportImportedSpecifierDependency extends HarmonyImportDependency {
+	/**
+	 * @param {string} request the request string
+	 * @param {number} sourceOrder the order in the original source file
+	 * @param {string[]} ids the requested export name of the imported module
+	 * @param {string | null} name the export name of for this module
+	 * @param {Set<string>} activeExports other named exports in the module
+	 * @param {ReadonlyArray<HarmonyExportImportedSpecifierDependency> | Iterable<HarmonyExportImportedSpecifierDependency>} otherStarExports other star exports in the module before this import
+	 * @param {number} exportPresenceMode mode of checking export names
+	 * @param {HarmonyStarExportsList} allStarExports all star exports in the module
+	 * @param {Record<string, any>=} assertions import assertions
+	 */
+	constructor(
+		request,
+		sourceOrder,
+		ids,
+		name,
+		activeExports,
+		otherStarExports,
+		exportPresenceMode,
+		allStarExports,
+		assertions
+	) {
+		super(request, sourceOrder, assertions);
+
+		this.ids = ids;
+		this.name = name;
+		this.activeExports = activeExports;
+		this.otherStarExports = otherStarExports;
+		this.exportPresenceMode = exportPresenceMode;
+		this.allStarExports = allStarExports;
+	}
+
+	/**
+	 * @returns {boolean | TRANSITIVE} true, when changes to the referenced module could affect the referencing module; TRANSITIVE, when changes to the referenced module could affect referencing modules of the referencing module
+	 */
+	couldAffectReferencingModule() {
+		return Dependency.TRANSITIVE;
+	}
+
+	// TODO webpack 6 remove
+	get id() {
+		throw new Error("id was renamed to ids and type changed to string[]");
+	}
+
+	// TODO webpack 6 remove
+	getId() {
+		throw new Error("id was renamed to ids and type changed to string[]");
+	}
+
+	// TODO webpack 6 remove
+	setId() {
+		throw new Error("id was renamed to ids and type changed to string[]");
+	}
+
+	get type() {
+		return "harmony export imported specifier";
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {string[]} the imported id
+	 */
+	getIds(moduleGraph) {
+		return moduleGraph.getMeta(this)[idsSymbol] || this.ids;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {string[]} ids the imported ids
+	 * @returns {void}
+	 */
+	setIds(moduleGraph, ids) {
+		moduleGraph.getMeta(this)[idsSymbol] = ids;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {ExportMode} the export mode
+	 */
+	getMode(moduleGraph, runtime) {
+		return moduleGraph.dependencyCacheProvide(
+			this,
+			getRuntimeKey(runtime),
+			getMode
+		);
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {ExportsInfo} exportsInfo exports info about the current module (optional)
+	 * @param {Module} importedModule the imported module (optional)
+	 * @returns {{exports?: Set<string>, checked?: Set<string>, ignoredExports: Set<string>, hidden?: Set<string>}} information
+	 */
+	getStarReexports(
+		moduleGraph,
+		runtime,
+		exportsInfo = moduleGraph.getExportsInfo(moduleGraph.getParentModule(this)),
+		importedModule = moduleGraph.getModule(this)
+	) {
+		const importedExportsInfo = moduleGraph.getExportsInfo(importedModule);
+
+		const noExtraExports =
+			importedExportsInfo.otherExportsInfo.provided === false;
+		const noExtraImports =
+			exportsInfo.otherExportsInfo.getUsed(runtime) === UsageState.Unused;
+
+		const ignoredExports = new Set(["default", ...this.activeExports]);
+
+		let hiddenExports = undefined;
+		const otherStarExports =
+			this._discoverActiveExportsFromOtherStarExports(moduleGraph);
+		if (otherStarExports !== undefined) {
+			hiddenExports = new Set();
+			for (let i = 0; i < otherStarExports.namesSlice; i++) {
+				hiddenExports.add(otherStarExports.names[i]);
+			}
+			for (const e of ignoredExports) hiddenExports.delete(e);
+		}
+
+		if (!noExtraExports && !noExtraImports) {
+			return {
+				ignoredExports,
+				hidden: hiddenExports
+			};
+		}
+
+		/** @type {Set<string>} */
+		const exports = new Set();
+		/** @type {Set<string>} */
+		const checked = new Set();
+		/** @type {Set<string>} */
+		const hidden = hiddenExports !== undefined ? new Set() : undefined;
+
+		if (noExtraImports) {
+			for (const exportInfo of exportsInfo.orderedExports) {
+				const name = exportInfo.name;
+				if (ignoredExports.has(name)) continue;
+				if (exportInfo.getUsed(runtime) === UsageState.Unused) continue;
+				const importedExportInfo =
+					importedExportsInfo.getReadOnlyExportInfo(name);
+				if (importedExportInfo.provided === false) continue;
+				if (hiddenExports !== undefined && hiddenExports.has(name)) {
+					hidden.add(name);
+					continue;
+				}
+				exports.add(name);
+				if (importedExportInfo.provided === true) continue;
+				checked.add(name);
+			}
+		} else if (noExtraExports) {
+			for (const importedExportInfo of importedExportsInfo.orderedExports) {
+				const name = importedExportInfo.name;
+				if (ignoredExports.has(name)) continue;
+				if (importedExportInfo.provided === false) continue;
+				const exportInfo = exportsInfo.getReadOnlyExportInfo(name);
+				if (exportInfo.getUsed(runtime) === UsageState.Unused) continue;
+				if (hiddenExports !== undefined && hiddenExports.has(name)) {
+					hidden.add(name);
+					continue;
+				}
+				exports.add(name);
+				if (importedExportInfo.provided === true) continue;
+				checked.add(name);
+			}
+		}
+
+		return { ignoredExports, exports, checked, hidden };
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {null | false | function(ModuleGraphConnection, RuntimeSpec): ConnectionState} function to determine if the connection is active
+	 */
+	getCondition(moduleGraph) {
+		return (connection, runtime) => {
+			const mode = this.getMode(moduleGraph, runtime);
+			return mode.type !== "unused" && mode.type !== "empty-star";
+		};
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		return false;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		const mode = this.getMode(moduleGraph, runtime);
+
+		switch (mode.type) {
+			case "missing":
+			case "unused":
+			case "empty-star":
+			case "reexport-undefined":
+				return Dependency.NO_EXPORTS_REFERENCED;
+
+			case "reexport-dynamic-default":
+				return Dependency.EXPORTS_OBJECT_REFERENCED;
+
+			case "reexport-named-default": {
+				if (!mode.partialNamespaceExportInfo)
+					return Dependency.EXPORTS_OBJECT_REFERENCED;
+				/** @type {string[][]} */
+				const referencedExports = [];
+				processExportInfo(
+					runtime,
+					referencedExports,
+					[],
+					/** @type {ExportInfo} */ (mode.partialNamespaceExportInfo)
+				);
+				return referencedExports;
+			}
+
+			case "reexport-namespace-object":
+			case "reexport-fake-namespace-object": {
+				if (!mode.partialNamespaceExportInfo)
+					return Dependency.EXPORTS_OBJECT_REFERENCED;
+				/** @type {string[][]} */
+				const referencedExports = [];
+				processExportInfo(
+					runtime,
+					referencedExports,
+					[],
+					/** @type {ExportInfo} */ (mode.partialNamespaceExportInfo),
+					mode.type === "reexport-fake-namespace-object"
+				);
+				return referencedExports;
+			}
+
+			case "dynamic-reexport":
+				return Dependency.EXPORTS_OBJECT_REFERENCED;
+
+			case "normal-reexport": {
+				const referencedExports = [];
+				for (const { ids, exportInfo, hidden } of mode.items) {
+					if (hidden) continue;
+					processExportInfo(runtime, referencedExports, ids, exportInfo, false);
+				}
+				return referencedExports;
+			}
+
+			default:
+				throw new Error(`Unknown mode ${mode.type}`);
+		}
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {{ names: string[], namesSlice: number, dependencyIndices: number[], dependencyIndex: number } | undefined} exported names and their origin dependency
+	 */
+	_discoverActiveExportsFromOtherStarExports(moduleGraph) {
+		if (!this.otherStarExports) return undefined;
+
+		const i =
+			"length" in this.otherStarExports
+				? this.otherStarExports.length
+				: countIterable(this.otherStarExports);
+		if (i === 0) return undefined;
+
+		if (this.allStarExports) {
+			const { names, dependencyIndices } = moduleGraph.cached(
+				determineExportAssignments,
+				this.allStarExports.dependencies
+			);
+
+			return {
+				names,
+				namesSlice: dependencyIndices[i - 1],
+				dependencyIndices,
+				dependencyIndex: i
+			};
+		}
+
+		const { names, dependencyIndices } = moduleGraph.cached(
+			determineExportAssignments,
+			this.otherStarExports,
+			this
+		);
+
+		return {
+			names,
+			namesSlice: dependencyIndices[i - 1],
+			dependencyIndices,
+			dependencyIndex: i
+		};
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		const mode = this.getMode(moduleGraph, undefined);
+
+		switch (mode.type) {
+			case "missing":
+				return undefined;
+			case "dynamic-reexport": {
+				const from = moduleGraph.getConnection(this);
+				return {
+					exports: true,
+					from,
+					canMangle: false,
+					excludeExports: mode.hidden
+						? combine(mode.ignored, mode.hidden)
+						: mode.ignored,
+					hideExports: mode.hidden,
+					dependencies: [from.module]
+				};
+			}
+			case "empty-star":
+				return {
+					exports: [],
+					hideExports: mode.hidden,
+					dependencies: [moduleGraph.getModule(this)]
+				};
+			// falls through
+			case "normal-reexport": {
+				const from = moduleGraph.getConnection(this);
+				return {
+					exports: Array.from(mode.items, item => ({
+						name: item.name,
+						from,
+						export: item.ids,
+						hidden: item.hidden
+					})),
+					priority: 1,
+					dependencies: [from.module]
+				};
+			}
+			case "reexport-dynamic-default": {
+				{
+					const from = moduleGraph.getConnection(this);
+					return {
+						exports: [
+							{
+								name: mode.name,
+								from,
+								export: ["default"]
+							}
+						],
+						priority: 1,
+						dependencies: [from.module]
+					};
+				}
+			}
+			case "reexport-undefined":
+				return {
+					exports: [mode.name],
+					dependencies: [moduleGraph.getModule(this)]
+				};
+			case "reexport-fake-namespace-object": {
+				const from = moduleGraph.getConnection(this);
+				return {
+					exports: [
+						{
+							name: mode.name,
+							from,
+							export: null,
+							exports: [
+								{
+									name: "default",
+									canMangle: false,
+									from,
+									export: null
+								}
+							]
+						}
+					],
+					priority: 1,
+					dependencies: [from.module]
+				};
+			}
+			case "reexport-namespace-object": {
+				const from = moduleGraph.getConnection(this);
+				return {
+					exports: [
+						{
+							name: mode.name,
+							from,
+							export: null
+						}
+					],
+					priority: 1,
+					dependencies: [from.module]
+				};
+			}
+			case "reexport-named-default": {
+				const from = moduleGraph.getConnection(this);
+				return {
+					exports: [
+						{
+							name: mode.name,
+							from,
+							export: ["default"]
+						}
+					],
+					priority: 1,
+					dependencies: [from.module]
+				};
+			}
+			default:
+				throw new Error(`Unknown mode ${mode.type}`);
+		}
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {number} effective mode
+	 */
+	_getEffectiveExportPresenceLevel(moduleGraph) {
+		if (this.exportPresenceMode !== ExportPresenceModes.AUTO)
+			return this.exportPresenceMode;
+		return moduleGraph.getParentModule(this).buildMeta.strictHarmonyModule
+			? ExportPresenceModes.ERROR
+			: ExportPresenceModes.WARN;
+	}
+
+	/**
+	 * Returns warnings
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} warnings
+	 */
+	getWarnings(moduleGraph) {
+		const exportsPresence = this._getEffectiveExportPresenceLevel(moduleGraph);
+		if (exportsPresence === ExportPresenceModes.WARN) {
+			return this._getErrors(moduleGraph);
+		}
+		return null;
+	}
+
+	/**
+	 * Returns errors
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} errors
+	 */
+	getErrors(moduleGraph) {
+		const exportsPresence = this._getEffectiveExportPresenceLevel(moduleGraph);
+		if (exportsPresence === ExportPresenceModes.ERROR) {
+			return this._getErrors(moduleGraph);
+		}
+		return null;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[] | undefined} errors
+	 */
+	_getErrors(moduleGraph) {
+		const ids = this.getIds(moduleGraph);
+		let errors = this.getLinkingErrors(
+			moduleGraph,
+			ids,
+			`(reexported as '${this.name}')`
+		);
+		if (ids.length === 0 && this.name === null) {
+			const potentialConflicts =
+				this._discoverActiveExportsFromOtherStarExports(moduleGraph);
+			if (potentialConflicts && potentialConflicts.namesSlice > 0) {
+				const ownNames = new Set(
+					potentialConflicts.names.slice(
+						potentialConflicts.namesSlice,
+						potentialConflicts.dependencyIndices[
+							potentialConflicts.dependencyIndex
+						]
+					)
+				);
+				const importedModule = moduleGraph.getModule(this);
+				if (importedModule) {
+					const exportsInfo = moduleGraph.getExportsInfo(importedModule);
+					const conflicts = new Map();
+					for (const exportInfo of exportsInfo.orderedExports) {
+						if (exportInfo.provided !== true) continue;
+						if (exportInfo.name === "default") continue;
+						if (this.activeExports.has(exportInfo.name)) continue;
+						if (ownNames.has(exportInfo.name)) continue;
+						const conflictingDependency = findDependencyForName(
+							potentialConflicts,
+							exportInfo.name,
+							this.allStarExports
+								? this.allStarExports.dependencies
+								: [...this.otherStarExports, this]
+						);
+						if (!conflictingDependency) continue;
+						const target = exportInfo.getTerminalBinding(moduleGraph);
+						if (!target) continue;
+						const conflictingModule = moduleGraph.getModule(
+							conflictingDependency
+						);
+						if (conflictingModule === importedModule) continue;
+						const conflictingExportInfo = moduleGraph.getExportInfo(
+							conflictingModule,
+							exportInfo.name
+						);
+						const conflictingTarget =
+							conflictingExportInfo.getTerminalBinding(moduleGraph);
+						if (!conflictingTarget) continue;
+						if (target === conflictingTarget) continue;
+						const list = conflicts.get(conflictingDependency.request);
+						if (list === undefined) {
+							conflicts.set(conflictingDependency.request, [exportInfo.name]);
+						} else {
+							list.push(exportInfo.name);
+						}
+					}
+					for (const [request, exports] of conflicts) {
+						if (!errors) errors = [];
+						errors.push(
+							new HarmonyLinkingError(
+								`The requested module '${
+									this.request
+								}' contains conflicting star exports for the ${
+									exports.length > 1 ? "names" : "name"
+								} ${exports
+									.map(e => `'${e}'`)
+									.join(", ")} with the previous requested module '${request}'`
+							)
+						);
+					}
+				}
+			}
+		}
+		return errors;
+	}
+
+	serialize(context) {
+		const { write, setCircularReference } = context;
+
+		setCircularReference(this);
+		write(this.ids);
+		write(this.name);
+		write(this.activeExports);
+		write(this.otherStarExports);
+		write(this.exportPresenceMode);
+		write(this.allStarExports);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read, setCircularReference } = context;
+
+		setCircularReference(this);
+		this.ids = read();
+		this.name = read();
+		this.activeExports = read();
+		this.otherStarExports = read();
+		this.exportPresenceMode = read();
+		this.allStarExports = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	HarmonyExportImportedSpecifierDependency,
+	"webpack/lib/dependencies/HarmonyExportImportedSpecifierDependency"
+);
+
+module.exports = HarmonyExportImportedSpecifierDependency;
+
+HarmonyExportImportedSpecifierDependency.Template = class HarmonyExportImportedSpecifierDependencyTemplate extends (
+	HarmonyImportDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const { moduleGraph, runtime, concatenationScope } = templateContext;
+
+		const dep = /** @type {HarmonyExportImportedSpecifierDependency} */ (
+			dependency
+		);
+
+		const mode = dep.getMode(moduleGraph, runtime);
+
+		if (concatenationScope) {
+			switch (mode.type) {
+				case "reexport-undefined":
+					concatenationScope.registerRawExport(
+						mode.name,
+						"/* reexport non-default export from non-harmony */ undefined"
+					);
+			}
+			return;
+		}
+
+		if (mode.type !== "unused" && mode.type !== "empty-star") {
+			super.apply(dependency, source, templateContext);
+
+			this._addExportFragments(
+				templateContext.initFragments,
+				dep,
+				mode,
+				templateContext.module,
+				moduleGraph,
+				runtime,
+				templateContext.runtimeTemplate,
+				templateContext.runtimeRequirements
+			);
+		}
+	}
+
+	/**
+	 * @param {InitFragment[]} initFragments target array for init fragments
+	 * @param {HarmonyExportImportedSpecifierDependency} dep dependency
+	 * @param {ExportMode} mode the export mode
+	 * @param {Module} module the current module
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {RuntimeTemplate} runtimeTemplate the runtime template
+	 * @param {Set<string>} runtimeRequirements runtime requirements
+	 * @returns {void}
+	 */
+	_addExportFragments(
+		initFragments,
+		dep,
+		mode,
+		module,
+		moduleGraph,
+		runtime,
+		runtimeTemplate,
+		runtimeRequirements
+	) {
+		const importedModule = moduleGraph.getModule(dep);
+		const importVar = dep.getImportVar(moduleGraph);
+
+		switch (mode.type) {
+			case "missing":
+			case "empty-star":
+				initFragments.push(
+					new InitFragment(
+						"/* empty/unused harmony star reexport */\n",
+						InitFragment.STAGE_HARMONY_EXPORTS,
+						1
+					)
+				);
+				break;
+
+			case "unused":
+				initFragments.push(
+					new InitFragment(
+						`${Template.toNormalComment(
+							`unused harmony reexport ${mode.name}`
+						)}\n`,
+						InitFragment.STAGE_HARMONY_EXPORTS,
+						1
+					)
+				);
+				break;
+
+			case "reexport-dynamic-default":
+				initFragments.push(
+					this.getReexportFragment(
+						module,
+						"reexport default from dynamic",
+						moduleGraph.getExportsInfo(module).getUsedName(mode.name, runtime),
+						importVar,
+						null,
+						runtimeRequirements
+					)
+				);
+				break;
+
+			case "reexport-fake-namespace-object":
+				initFragments.push(
+					...this.getReexportFakeNamespaceObjectFragments(
+						module,
+						moduleGraph.getExportsInfo(module).getUsedName(mode.name, runtime),
+						importVar,
+						mode.fakeType,
+						runtimeRequirements
+					)
+				);
+				break;
+
+			case "reexport-undefined":
+				initFragments.push(
+					this.getReexportFragment(
+						module,
+						"reexport non-default export from non-harmony",
+						moduleGraph.getExportsInfo(module).getUsedName(mode.name, runtime),
+						"undefined",
+						"",
+						runtimeRequirements
+					)
+				);
+				break;
+
+			case "reexport-named-default":
+				initFragments.push(
+					this.getReexportFragment(
+						module,
+						"reexport default export from named module",
+						moduleGraph.getExportsInfo(module).getUsedName(mode.name, runtime),
+						importVar,
+						"",
+						runtimeRequirements
+					)
+				);
+				break;
+
+			case "reexport-namespace-object":
+				initFragments.push(
+					this.getReexportFragment(
+						module,
+						"reexport module object",
+						moduleGraph.getExportsInfo(module).getUsedName(mode.name, runtime),
+						importVar,
+						"",
+						runtimeRequirements
+					)
+				);
+				break;
+
+			case "normal-reexport":
+				for (const { name, ids, checked, hidden } of mode.items) {
+					if (hidden) continue;
+					if (checked) {
+						initFragments.push(
+							new InitFragment(
+								"/* harmony reexport (checked) */ " +
+									this.getConditionalReexportStatement(
+										module,
+										name,
+										importVar,
+										ids,
+										runtimeRequirements
+									),
+								moduleGraph.isAsync(importedModule)
+									? InitFragment.STAGE_ASYNC_HARMONY_IMPORTS
+									: InitFragment.STAGE_HARMONY_IMPORTS,
+								dep.sourceOrder
+							)
+						);
+					} else {
+						initFragments.push(
+							this.getReexportFragment(
+								module,
+								"reexport safe",
+								moduleGraph.getExportsInfo(module).getUsedName(name, runtime),
+								importVar,
+								moduleGraph
+									.getExportsInfo(importedModule)
+									.getUsedName(ids, runtime),
+								runtimeRequirements
+							)
+						);
+					}
+				}
+				break;
+
+			case "dynamic-reexport": {
+				const ignored = mode.hidden
+					? combine(mode.ignored, mode.hidden)
+					: mode.ignored;
+				const modern =
+					runtimeTemplate.supportsConst() &&
+					runtimeTemplate.supportsArrowFunction();
+				let content =
+					"/* harmony reexport (unknown) */ var __WEBPACK_REEXPORT_OBJECT__ = {};\n" +
+					`/* harmony reexport (unknown) */ for(${
+						modern ? "const" : "var"
+					} __WEBPACK_IMPORT_KEY__ in ${importVar}) `;
+
+				// Filter out exports which are defined by other exports
+				// and filter out default export because it cannot be reexported with *
+				if (ignored.size > 1) {
+					content +=
+						"if(" +
+						JSON.stringify(Array.from(ignored)) +
+						".indexOf(__WEBPACK_IMPORT_KEY__) < 0) ";
+				} else if (ignored.size === 1) {
+					content += `if(__WEBPACK_IMPORT_KEY__ !== ${JSON.stringify(
+						first(ignored)
+					)}) `;
+				}
+
+				content += `__WEBPACK_REEXPORT_OBJECT__[__WEBPACK_IMPORT_KEY__] = `;
+				if (modern) {
+					content += `() => ${importVar}[__WEBPACK_IMPORT_KEY__]`;
+				} else {
+					content += `function(key) { return ${importVar}[key]; }.bind(0, __WEBPACK_IMPORT_KEY__)`;
+				}
+
+				runtimeRequirements.add(RuntimeGlobals.exports);
+				runtimeRequirements.add(RuntimeGlobals.definePropertyGetters);
+
+				const exportsName = module.exportsArgument;
+				initFragments.push(
+					new InitFragment(
+						`${content}\n/* harmony reexport (unknown) */ ${RuntimeGlobals.definePropertyGetters}(${exportsName}, __WEBPACK_REEXPORT_OBJECT__);\n`,
+						moduleGraph.isAsync(importedModule)
+							? InitFragment.STAGE_ASYNC_HARMONY_IMPORTS
+							: InitFragment.STAGE_HARMONY_IMPORTS,
+						dep.sourceOrder
+					)
+				);
+				break;
+			}
+
+			default:
+				throw new Error(`Unknown mode ${mode.type}`);
+		}
+	}
+
+	getReexportFragment(
+		module,
+		comment,
+		key,
+		name,
+		valueKey,
+		runtimeRequirements
+	) {
+		const returnValue = this.getReturnValue(name, valueKey);
+
+		runtimeRequirements.add(RuntimeGlobals.exports);
+		runtimeRequirements.add(RuntimeGlobals.definePropertyGetters);
+
+		const map = new Map();
+		map.set(key, `/* ${comment} */ ${returnValue}`);
+
+		return new HarmonyExportInitFragment(module.exportsArgument, map);
+	}
+
+	getReexportFakeNamespaceObjectFragments(
+		module,
+		key,
+		name,
+		fakeType,
+		runtimeRequirements
+	) {
+		runtimeRequirements.add(RuntimeGlobals.exports);
+		runtimeRequirements.add(RuntimeGlobals.definePropertyGetters);
+		runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+
+		const map = new Map();
+		map.set(
+			key,
+			`/* reexport fake namespace object from non-harmony */ ${name}_namespace_cache || (${name}_namespace_cache = ${
+				RuntimeGlobals.createFakeNamespaceObject
+			}(${name}${fakeType ? `, ${fakeType}` : ""}))`
+		);
+
+		return [
+			new InitFragment(
+				`var ${name}_namespace_cache;\n`,
+				InitFragment.STAGE_CONSTANTS,
+				-1,
+				`${name}_namespace_cache`
+			),
+			new HarmonyExportInitFragment(module.exportsArgument, map)
+		];
+	}
+
+	getConditionalReexportStatement(
+		module,
+		key,
+		name,
+		valueKey,
+		runtimeRequirements
+	) {
+		if (valueKey === false) {
+			return "/* unused export */\n";
+		}
+
+		const exportsName = module.exportsArgument;
+		const returnValue = this.getReturnValue(name, valueKey);
+
+		runtimeRequirements.add(RuntimeGlobals.exports);
+		runtimeRequirements.add(RuntimeGlobals.definePropertyGetters);
+		runtimeRequirements.add(RuntimeGlobals.hasOwnProperty);
+
+		return `if(${RuntimeGlobals.hasOwnProperty}(${name}, ${JSON.stringify(
+			valueKey[0]
+		)})) ${
+			RuntimeGlobals.definePropertyGetters
+		}(${exportsName}, { ${JSON.stringify(
+			key
+		)}: function() { return ${returnValue}; } });\n`;
+	}
+
+	getReturnValue(name, valueKey) {
+		if (valueKey === null) {
+			return `${name}_default.a`;
+		}
+
+		if (valueKey === "") {
+			return name;
+		}
+
+		if (valueKey === false) {
+			return "/* unused export */ undefined";
+		}
+
+		return `${name}${propertyAccess(valueKey)}`;
+	}
+};
+
+class HarmonyStarExportsList {
+	constructor() {
+		/** @type {HarmonyExportImportedSpecifierDependency[]} */
+		this.dependencies = [];
+	}
+
+	/**
+	 * @param {HarmonyExportImportedSpecifierDependency} dep dependency
+	 * @returns {void}
+	 */
+	push(dep) {
+		this.dependencies.push(dep);
+	}
+
+	slice() {
+		return this.dependencies.slice();
+	}
+
+	serialize({ write, setCircularReference }) {
+		setCircularReference(this);
+		write(this.dependencies);
+	}
+
+	deserialize({ read, setCircularReference }) {
+		setCircularReference(this);
+		this.dependencies = read();
+	}
+}
+
+makeSerializable(
+	HarmonyStarExportsList,
+	"webpack/lib/dependencies/HarmonyExportImportedSpecifierDependency",
+	"HarmonyStarExportsList"
+);
+
+module.exports.HarmonyStarExportsList = HarmonyStarExportsList;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportInitFragment.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportInitFragment.js
new file mode 100644
index 0000000..26d45ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportInitFragment.js
@@ -0,0 +1,168 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const { first } = require("../util/SetHelpers");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+
+const joinIterableWithComma = iterable => {
+	// This is more performant than Array.from().join(", ")
+	// as it doesn't create an array
+	let str = "";
+	let first = true;
+	for (const item of iterable) {
+		if (first) {
+			first = false;
+		} else {
+			str += ", ";
+		}
+		str += item;
+	}
+	return str;
+};
+
+const EMPTY_MAP = new Map();
+const EMPTY_SET = new Set();
+
+/**
+ * @typedef {GenerateContext} Context
+ */
+class HarmonyExportInitFragment extends InitFragment {
+	/**
+	 * @param {string} exportsArgument the exports identifier
+	 * @param {Map<string, string>} exportMap mapping from used name to exposed variable name
+	 * @param {Set<string>} unusedExports list of unused export names
+	 */
+	constructor(
+		exportsArgument,
+		exportMap = EMPTY_MAP,
+		unusedExports = EMPTY_SET
+	) {
+		super(undefined, InitFragment.STAGE_HARMONY_EXPORTS, 1, "harmony-exports");
+		this.exportsArgument = exportsArgument;
+		this.exportMap = exportMap;
+		this.unusedExports = unusedExports;
+	}
+
+	/**
+	 * @param {HarmonyExportInitFragment[]} fragments all fragments to merge
+	 * @returns {HarmonyExportInitFragment} merged fragment
+	 */
+	mergeAll(fragments) {
+		let exportMap;
+		let exportMapOwned = false;
+		let unusedExports;
+		let unusedExportsOwned = false;
+
+		for (const fragment of fragments) {
+			if (fragment.exportMap.size !== 0) {
+				if (exportMap === undefined) {
+					exportMap = fragment.exportMap;
+					exportMapOwned = false;
+				} else {
+					if (!exportMapOwned) {
+						exportMap = new Map(exportMap);
+						exportMapOwned = true;
+					}
+					for (const [key, value] of fragment.exportMap) {
+						if (!exportMap.has(key)) exportMap.set(key, value);
+					}
+				}
+			}
+			if (fragment.unusedExports.size !== 0) {
+				if (unusedExports === undefined) {
+					unusedExports = fragment.unusedExports;
+					unusedExportsOwned = false;
+				} else {
+					if (!unusedExportsOwned) {
+						unusedExports = new Set(unusedExports);
+						unusedExportsOwned = true;
+					}
+					for (const value of fragment.unusedExports) {
+						unusedExports.add(value);
+					}
+				}
+			}
+		}
+		return new HarmonyExportInitFragment(
+			this.exportsArgument,
+			exportMap,
+			unusedExports
+		);
+	}
+
+	merge(other) {
+		let exportMap;
+		if (this.exportMap.size === 0) {
+			exportMap = other.exportMap;
+		} else if (other.exportMap.size === 0) {
+			exportMap = this.exportMap;
+		} else {
+			exportMap = new Map(other.exportMap);
+			for (const [key, value] of this.exportMap) {
+				if (!exportMap.has(key)) exportMap.set(key, value);
+			}
+		}
+		let unusedExports;
+		if (this.unusedExports.size === 0) {
+			unusedExports = other.unusedExports;
+		} else if (other.unusedExports.size === 0) {
+			unusedExports = this.unusedExports;
+		} else {
+			unusedExports = new Set(other.unusedExports);
+			for (const value of this.unusedExports) {
+				unusedExports.add(value);
+			}
+		}
+		return new HarmonyExportInitFragment(
+			this.exportsArgument,
+			exportMap,
+			unusedExports
+		);
+	}
+
+	/**
+	 * @param {Context} context context
+	 * @returns {string|Source} the source code that will be included as initialization code
+	 */
+	getContent({ runtimeTemplate, runtimeRequirements }) {
+		runtimeRequirements.add(RuntimeGlobals.exports);
+		runtimeRequirements.add(RuntimeGlobals.definePropertyGetters);
+
+		const unusedPart =
+			this.unusedExports.size > 1
+				? `/* unused harmony exports ${joinIterableWithComma(
+						this.unusedExports
+				  )} */\n`
+				: this.unusedExports.size > 0
+				? `/* unused harmony export ${first(this.unusedExports)} */\n`
+				: "";
+		const definitions = [];
+		const orderedExportMap = Array.from(this.exportMap).sort(([a], [b]) =>
+			a < b ? -1 : 1
+		);
+		for (const [key, value] of orderedExportMap) {
+			definitions.push(
+				`\n/* harmony export */   ${JSON.stringify(
+					key
+				)}: ${runtimeTemplate.returningFunction(value)}`
+			);
+		}
+		const definePart =
+			this.exportMap.size > 0
+				? `/* harmony export */ ${RuntimeGlobals.definePropertyGetters}(${
+						this.exportsArgument
+				  }, {${definitions.join(",")}\n/* harmony export */ });\n`
+				: "";
+		return `${definePart}${unusedPart}`;
+	}
+}
+
+module.exports = HarmonyExportInitFragment;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportSpecifierDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportSpecifierDependency.js
new file mode 100644
index 0000000..ac663ba
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExportSpecifierDependency.js
@@ -0,0 +1,111 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const HarmonyExportInitFragment = require("./HarmonyExportInitFragment");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+
+class HarmonyExportSpecifierDependency extends NullDependency {
+	constructor(id, name) {
+		super();
+		this.id = id;
+		this.name = name;
+	}
+
+	get type() {
+		return "harmony export specifier";
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		return {
+			exports: [this.name],
+			priority: 1,
+			terminalBinding: true,
+			dependencies: undefined
+		};
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		return false;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.id);
+		write(this.name);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.id = read();
+		this.name = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	HarmonyExportSpecifierDependency,
+	"webpack/lib/dependencies/HarmonyExportSpecifierDependency"
+);
+
+HarmonyExportSpecifierDependency.Template = class HarmonyExportSpecifierDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ module, moduleGraph, initFragments, runtime, concatenationScope }
+	) {
+		const dep = /** @type {HarmonyExportSpecifierDependency} */ (dependency);
+		if (concatenationScope) {
+			concatenationScope.registerExport(dep.name, dep.id);
+			return;
+		}
+		const used = moduleGraph
+			.getExportsInfo(module)
+			.getUsedName(dep.name, runtime);
+		if (!used) {
+			const set = new Set();
+			set.add(dep.name || "namespace");
+			initFragments.push(
+				new HarmonyExportInitFragment(module.exportsArgument, undefined, set)
+			);
+			return;
+		}
+
+		const map = new Map();
+		map.set(used, `/* binding */ ${dep.id}`);
+		initFragments.push(
+			new HarmonyExportInitFragment(module.exportsArgument, map, undefined)
+		);
+	}
+};
+
+module.exports = HarmonyExportSpecifierDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExports.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExports.js
new file mode 100644
index 0000000..4528659
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyExports.js
@@ -0,0 +1,40 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Parser").ParserState} ParserState */
+
+/** @type {WeakMap<ParserState, boolean>} */
+const parserStateExportsState = new WeakMap();
+
+/**
+ * @param {ParserState} parserState parser state
+ * @param {boolean} isStrictHarmony strict harmony mode should be enabled
+ * @returns {void}
+ */
+exports.enable = (parserState, isStrictHarmony) => {
+	const value = parserStateExportsState.get(parserState);
+	if (value === false) return;
+	parserStateExportsState.set(parserState, true);
+	if (value !== true) {
+		parserState.module.buildMeta.exportsType = "namespace";
+		parserState.module.buildInfo.strict = true;
+		parserState.module.buildInfo.exportsArgument = "__webpack_exports__";
+		if (isStrictHarmony) {
+			parserState.module.buildMeta.strictHarmonyModule = true;
+			parserState.module.buildInfo.moduleArgument = "__webpack_module__";
+		}
+	}
+};
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {boolean} true, when enabled
+ */
+exports.isEnabled = parserState => {
+	const value = parserStateExportsState.get(parserState);
+	return value === true;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportDependency.js
new file mode 100644
index 0000000..c270262
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportDependency.js
@@ -0,0 +1,359 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ConditionalInitFragment = require("../ConditionalInitFragment");
+const Dependency = require("../Dependency");
+const HarmonyLinkingError = require("../HarmonyLinkingError");
+const InitFragment = require("../InitFragment");
+const Template = require("../Template");
+const AwaitDependenciesInitFragment = require("../async-modules/AwaitDependenciesInitFragment");
+const { filterRuntime, mergeRuntime } = require("../util/runtime");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+const ExportPresenceModes = {
+	NONE: /** @type {0} */ (0),
+	WARN: /** @type {1} */ (1),
+	AUTO: /** @type {2} */ (2),
+	ERROR: /** @type {3} */ (3),
+	fromUserOption(str) {
+		switch (str) {
+			case "error":
+				return ExportPresenceModes.ERROR;
+			case "warn":
+				return ExportPresenceModes.WARN;
+			case "auto":
+				return ExportPresenceModes.AUTO;
+			case false:
+				return ExportPresenceModes.NONE;
+			default:
+				throw new Error(`Invalid export presence value ${str}`);
+		}
+	}
+};
+
+class HarmonyImportDependency extends ModuleDependency {
+	/**
+	 *
+	 * @param {string} request request string
+	 * @param {number} sourceOrder source order
+	 * @param {Record<string, any>=} assertions import assertions
+	 */
+	constructor(request, sourceOrder, assertions) {
+		super(request);
+		this.sourceOrder = sourceOrder;
+		this.assertions = assertions;
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return Dependency.NO_EXPORTS_REFERENCED;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {string} name of the variable for the import
+	 */
+	getImportVar(moduleGraph) {
+		const module = moduleGraph.getParentModule(this);
+		const meta = moduleGraph.getMeta(module);
+		let importVarMap = meta.importVarMap;
+		if (!importVarMap) meta.importVarMap = importVarMap = new Map();
+		let importVar = importVarMap.get(moduleGraph.getModule(this));
+		if (importVar) return importVar;
+		importVar = `${Template.toIdentifier(
+			`${this.userRequest}`
+		)}__WEBPACK_IMPORTED_MODULE_${importVarMap.size}__`;
+		importVarMap.set(moduleGraph.getModule(this), importVar);
+		return importVar;
+	}
+
+	/**
+	 * @param {boolean} update create new variables or update existing one
+	 * @param {DependencyTemplateContext} templateContext the template context
+	 * @returns {[string, string]} the import statement and the compat statement
+	 */
+	getImportStatement(
+		update,
+		{ runtimeTemplate, module, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		return runtimeTemplate.importStatement({
+			update,
+			module: moduleGraph.getModule(this),
+			chunkGraph,
+			importVar: this.getImportVar(moduleGraph),
+			request: this.request,
+			originModule: module,
+			runtimeRequirements
+		});
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {string[]} ids imported ids
+	 * @param {string} additionalMessage extra info included in the error message
+	 * @returns {WebpackError[] | undefined} errors
+	 */
+	getLinkingErrors(moduleGraph, ids, additionalMessage) {
+		const importedModule = moduleGraph.getModule(this);
+		// ignore errors for missing or failed modules
+		if (!importedModule || importedModule.getNumberOfErrors() > 0) {
+			return;
+		}
+
+		const parentModule = moduleGraph.getParentModule(this);
+		const exportsType = importedModule.getExportsType(
+			moduleGraph,
+			parentModule.buildMeta.strictHarmonyModule
+		);
+		if (exportsType === "namespace" || exportsType === "default-with-named") {
+			if (ids.length === 0) {
+				return;
+			}
+
+			if (
+				(exportsType !== "default-with-named" || ids[0] !== "default") &&
+				moduleGraph.isExportProvided(importedModule, ids) === false
+			) {
+				// We are sure that it's not provided
+
+				// Try to provide detailed info in the error message
+				let pos = 0;
+				let exportsInfo = moduleGraph.getExportsInfo(importedModule);
+				while (pos < ids.length && exportsInfo) {
+					const id = ids[pos++];
+					const exportInfo = exportsInfo.getReadOnlyExportInfo(id);
+					if (exportInfo.provided === false) {
+						// We are sure that it's not provided
+						const providedExports = exportsInfo.getProvidedExports();
+						const moreInfo = !Array.isArray(providedExports)
+							? " (possible exports unknown)"
+							: providedExports.length === 0
+							? " (module has no exports)"
+							: ` (possible exports: ${providedExports.join(", ")})`;
+						return [
+							new HarmonyLinkingError(
+								`export ${ids
+									.slice(0, pos)
+									.map(id => `'${id}'`)
+									.join(".")} ${additionalMessage} was not found in '${
+									this.userRequest
+								}'${moreInfo}`
+							)
+						];
+					}
+					exportsInfo = exportInfo.getNestedExportsInfo();
+				}
+
+				// General error message
+				return [
+					new HarmonyLinkingError(
+						`export ${ids
+							.map(id => `'${id}'`)
+							.join(".")} ${additionalMessage} was not found in '${
+							this.userRequest
+						}'`
+					)
+				];
+			}
+		}
+		switch (exportsType) {
+			case "default-only":
+				// It's has only a default export
+				if (ids.length > 0 && ids[0] !== "default") {
+					// In strict harmony modules we only support the default export
+					return [
+						new HarmonyLinkingError(
+							`Can't import the named export ${ids
+								.map(id => `'${id}'`)
+								.join(
+									"."
+								)} ${additionalMessage} from default-exporting module (only default export is available)`
+						)
+					];
+				}
+				break;
+			case "default-with-named":
+				// It has a default export and named properties redirect
+				// In some cases we still want to warn here
+				if (
+					ids.length > 0 &&
+					ids[0] !== "default" &&
+					importedModule.buildMeta.defaultObject === "redirect-warn"
+				) {
+					// For these modules only the default export is supported
+					return [
+						new HarmonyLinkingError(
+							`Should not import the named export ${ids
+								.map(id => `'${id}'`)
+								.join(
+									"."
+								)} ${additionalMessage} from default-exporting module (only default export is available soon)`
+						)
+					];
+				}
+				break;
+		}
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.sourceOrder);
+		write(this.assertions);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.sourceOrder = read();
+		this.assertions = read();
+		super.deserialize(context);
+	}
+}
+
+module.exports = HarmonyImportDependency;
+
+/** @type {WeakMap<Module, WeakMap<Module, RuntimeSpec | boolean>>} */
+const importEmittedMap = new WeakMap();
+
+HarmonyImportDependency.Template = class HarmonyImportDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {HarmonyImportDependency} */ (dependency);
+		const { module, chunkGraph, moduleGraph, runtime } = templateContext;
+
+		const connection = moduleGraph.getConnection(dep);
+		if (connection && !connection.isTargetActive(runtime)) return;
+
+		const referencedModule = connection && connection.module;
+
+		if (
+			connection &&
+			connection.weak &&
+			referencedModule &&
+			chunkGraph.getModuleId(referencedModule) === null
+		) {
+			// in weak references, module might not be in any chunk
+			// but that's ok, we don't need that logic in this case
+			return;
+		}
+
+		const moduleKey = referencedModule
+			? referencedModule.identifier()
+			: dep.request;
+		const key = `harmony import ${moduleKey}`;
+
+		const runtimeCondition = dep.weak
+			? false
+			: connection
+			? filterRuntime(runtime, r => connection.isTargetActive(r))
+			: true;
+
+		if (module && referencedModule) {
+			let emittedModules = importEmittedMap.get(module);
+			if (emittedModules === undefined) {
+				emittedModules = new WeakMap();
+				importEmittedMap.set(module, emittedModules);
+			}
+			let mergedRuntimeCondition = runtimeCondition;
+			const oldRuntimeCondition = emittedModules.get(referencedModule) || false;
+			if (oldRuntimeCondition !== false && mergedRuntimeCondition !== true) {
+				if (mergedRuntimeCondition === false || oldRuntimeCondition === true) {
+					mergedRuntimeCondition = oldRuntimeCondition;
+				} else {
+					mergedRuntimeCondition = mergeRuntime(
+						oldRuntimeCondition,
+						mergedRuntimeCondition
+					);
+				}
+			}
+			emittedModules.set(referencedModule, mergedRuntimeCondition);
+		}
+
+		const importStatement = dep.getImportStatement(false, templateContext);
+		if (
+			referencedModule &&
+			templateContext.moduleGraph.isAsync(referencedModule)
+		) {
+			templateContext.initFragments.push(
+				new ConditionalInitFragment(
+					importStatement[0],
+					InitFragment.STAGE_HARMONY_IMPORTS,
+					dep.sourceOrder,
+					key,
+					runtimeCondition
+				)
+			);
+			templateContext.initFragments.push(
+				new AwaitDependenciesInitFragment(
+					new Set([dep.getImportVar(templateContext.moduleGraph)])
+				)
+			);
+			templateContext.initFragments.push(
+				new ConditionalInitFragment(
+					importStatement[1],
+					InitFragment.STAGE_ASYNC_HARMONY_IMPORTS,
+					dep.sourceOrder,
+					key + " compat",
+					runtimeCondition
+				)
+			);
+		} else {
+			templateContext.initFragments.push(
+				new ConditionalInitFragment(
+					importStatement[0] + importStatement[1],
+					InitFragment.STAGE_HARMONY_IMPORTS,
+					dep.sourceOrder,
+					key,
+					runtimeCondition
+				)
+			);
+		}
+	}
+
+	/**
+	 *
+	 * @param {Module} module the module
+	 * @param {Module} referencedModule the referenced module
+	 * @returns {RuntimeSpec | boolean} runtimeCondition in which this import has been emitted
+	 */
+	static getImportEmittedRuntime(module, referencedModule) {
+		const emittedModules = importEmittedMap.get(module);
+		if (emittedModules === undefined) return false;
+		return emittedModules.get(referencedModule) || false;
+	}
+};
+
+module.exports.ExportPresenceModes = ExportPresenceModes;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportDependencyParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportDependencyParserPlugin.js
new file mode 100644
index 0000000..c0c1f68
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportDependencyParserPlugin.js
@@ -0,0 +1,256 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const HotModuleReplacementPlugin = require("../HotModuleReplacementPlugin");
+const InnerGraph = require("../optimize/InnerGraph");
+const ConstDependency = require("./ConstDependency");
+const HarmonyAcceptDependency = require("./HarmonyAcceptDependency");
+const HarmonyAcceptImportDependency = require("./HarmonyAcceptImportDependency");
+const HarmonyExports = require("./HarmonyExports");
+const { ExportPresenceModes } = require("./HarmonyImportDependency");
+const HarmonyImportSideEffectDependency = require("./HarmonyImportSideEffectDependency");
+const HarmonyImportSpecifierDependency = require("./HarmonyImportSpecifierDependency");
+
+/** @typedef {import("estree").ExportAllDeclaration} ExportAllDeclaration */
+/** @typedef {import("estree").ExportNamedDeclaration} ExportNamedDeclaration */
+/** @typedef {import("estree").Identifier} Identifier */
+/** @typedef {import("estree").ImportDeclaration} ImportDeclaration */
+/** @typedef {import("estree").ImportExpression} ImportExpression */
+/** @typedef {import("../../declarations/WebpackOptions").JavascriptParserOptions} JavascriptParserOptions */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+/** @typedef {import("../optimize/InnerGraph").InnerGraph} InnerGraph */
+/** @typedef {import("../optimize/InnerGraph").TopLevelSymbol} TopLevelSymbol */
+/** @typedef {import("./HarmonyImportDependency")} HarmonyImportDependency */
+
+const harmonySpecifierTag = Symbol("harmony import");
+
+/**
+ * @typedef {Object} HarmonySettings
+ * @property {string[]} ids
+ * @property {string} source
+ * @property {number} sourceOrder
+ * @property {string} name
+ * @property {boolean} await
+ * @property {Record<string, any> | undefined} assertions
+ */
+
+/**
+ * @param {ImportDeclaration | ExportNamedDeclaration | ExportAllDeclaration | ImportExpression} node node with assertions
+ * @returns {Record<string, any> | undefined} assertions
+ */
+function getAssertions(node) {
+	// TODO remove cast when @types/estree has been updated to import assertions
+	const assertions = /** @type {{ assertions?: ImportAttributeNode[] }} */ (
+		node
+	).assertions;
+	if (assertions === undefined) {
+		return undefined;
+	}
+	const result = {};
+	for (const assertion of assertions) {
+		const key =
+			assertion.key.type === "Identifier"
+				? assertion.key.name
+				: assertion.key.value;
+		result[key] = assertion.value.value;
+	}
+	return result;
+}
+
+module.exports = class HarmonyImportDependencyParserPlugin {
+	/**
+	 * @param {JavascriptParserOptions} options options
+	 */
+	constructor(options) {
+		this.exportPresenceMode =
+			options.importExportsPresence !== undefined
+				? ExportPresenceModes.fromUserOption(options.importExportsPresence)
+				: options.exportsPresence !== undefined
+				? ExportPresenceModes.fromUserOption(options.exportsPresence)
+				: options.strictExportPresence
+				? ExportPresenceModes.ERROR
+				: ExportPresenceModes.AUTO;
+		this.strictThisContextOnImports = options.strictThisContextOnImports;
+	}
+
+	/**
+	 * @param {JavascriptParser} parser the parser
+	 * @returns {void}
+	 */
+	apply(parser) {
+		const { exportPresenceMode } = this;
+		parser.hooks.isPure
+			.for("Identifier")
+			.tap("HarmonyImportDependencyParserPlugin", expression => {
+				const expr = /** @type {Identifier} */ (expression);
+				if (
+					parser.isVariableDefined(expr.name) ||
+					parser.getTagData(expr.name, harmonySpecifierTag)
+				) {
+					return true;
+				}
+			});
+		parser.hooks.import.tap(
+			"HarmonyImportDependencyParserPlugin",
+			(statement, source) => {
+				parser.state.lastHarmonyImportOrder =
+					(parser.state.lastHarmonyImportOrder || 0) + 1;
+				const clearDep = new ConstDependency(
+					parser.isAsiPosition(statement.range[0]) ? ";" : "",
+					statement.range
+				);
+				clearDep.loc = statement.loc;
+				parser.state.module.addPresentationalDependency(clearDep);
+				parser.unsetAsiPosition(statement.range[1]);
+				const assertions = getAssertions(statement);
+				const sideEffectDep = new HarmonyImportSideEffectDependency(
+					source,
+					parser.state.lastHarmonyImportOrder,
+					assertions
+				);
+				sideEffectDep.loc = statement.loc;
+				parser.state.module.addDependency(sideEffectDep);
+				return true;
+			}
+		);
+		parser.hooks.importSpecifier.tap(
+			"HarmonyImportDependencyParserPlugin",
+			(statement, source, id, name) => {
+				const ids = id === null ? [] : [id];
+				parser.tagVariable(name, harmonySpecifierTag, {
+					name,
+					source,
+					ids,
+					sourceOrder: parser.state.lastHarmonyImportOrder,
+					assertions: getAssertions(statement)
+				});
+				return true;
+			}
+		);
+		parser.hooks.expression
+			.for(harmonySpecifierTag)
+			.tap("HarmonyImportDependencyParserPlugin", expr => {
+				const settings = /** @type {HarmonySettings} */ (parser.currentTagData);
+				const dep = new HarmonyImportSpecifierDependency(
+					settings.source,
+					settings.sourceOrder,
+					settings.ids,
+					settings.name,
+					expr.range,
+					exportPresenceMode,
+					settings.assertions
+				);
+				dep.shorthand = parser.scope.inShorthand;
+				dep.directImport = true;
+				dep.asiSafe = !parser.isAsiPosition(expr.range[0]);
+				dep.loc = expr.loc;
+				parser.state.module.addDependency(dep);
+				InnerGraph.onUsage(parser.state, e => (dep.usedByExports = e));
+				return true;
+			});
+		parser.hooks.expressionMemberChain
+			.for(harmonySpecifierTag)
+			.tap("HarmonyImportDependencyParserPlugin", (expr, members) => {
+				const settings = /** @type {HarmonySettings} */ (parser.currentTagData);
+				const ids = settings.ids.concat(members);
+				const dep = new HarmonyImportSpecifierDependency(
+					settings.source,
+					settings.sourceOrder,
+					ids,
+					settings.name,
+					expr.range,
+					exportPresenceMode,
+					settings.assertions
+				);
+				dep.asiSafe = !parser.isAsiPosition(expr.range[0]);
+				dep.loc = expr.loc;
+				parser.state.module.addDependency(dep);
+				InnerGraph.onUsage(parser.state, e => (dep.usedByExports = e));
+				return true;
+			});
+		parser.hooks.callMemberChain
+			.for(harmonySpecifierTag)
+			.tap("HarmonyImportDependencyParserPlugin", (expr, members) => {
+				const { arguments: args, callee } = expr;
+				const settings = /** @type {HarmonySettings} */ (parser.currentTagData);
+				const ids = settings.ids.concat(members);
+				const dep = new HarmonyImportSpecifierDependency(
+					settings.source,
+					settings.sourceOrder,
+					ids,
+					settings.name,
+					callee.range,
+					exportPresenceMode,
+					settings.assertions
+				);
+				dep.directImport = members.length === 0;
+				dep.call = true;
+				dep.asiSafe = !parser.isAsiPosition(callee.range[0]);
+				// only in case when we strictly follow the spec we need a special case here
+				dep.namespaceObjectAsContext =
+					members.length > 0 && this.strictThisContextOnImports;
+				dep.loc = callee.loc;
+				parser.state.module.addDependency(dep);
+				if (args) parser.walkExpressions(args);
+				InnerGraph.onUsage(parser.state, e => (dep.usedByExports = e));
+				return true;
+			});
+		const { hotAcceptCallback, hotAcceptWithoutCallback } =
+			HotModuleReplacementPlugin.getParserHooks(parser);
+		hotAcceptCallback.tap(
+			"HarmonyImportDependencyParserPlugin",
+			(expr, requests) => {
+				if (!HarmonyExports.isEnabled(parser.state)) {
+					// This is not a harmony module, skip it
+					return;
+				}
+				const dependencies = requests.map(request => {
+					const dep = new HarmonyAcceptImportDependency(request);
+					dep.loc = expr.loc;
+					parser.state.module.addDependency(dep);
+					return dep;
+				});
+				if (dependencies.length > 0) {
+					const dep = new HarmonyAcceptDependency(
+						expr.range,
+						dependencies,
+						true
+					);
+					dep.loc = expr.loc;
+					parser.state.module.addDependency(dep);
+				}
+			}
+		);
+		hotAcceptWithoutCallback.tap(
+			"HarmonyImportDependencyParserPlugin",
+			(expr, requests) => {
+				if (!HarmonyExports.isEnabled(parser.state)) {
+					// This is not a harmony module, skip it
+					return;
+				}
+				const dependencies = requests.map(request => {
+					const dep = new HarmonyAcceptImportDependency(request);
+					dep.loc = expr.loc;
+					parser.state.module.addDependency(dep);
+					return dep;
+				});
+				if (dependencies.length > 0) {
+					const dep = new HarmonyAcceptDependency(
+						expr.range,
+						dependencies,
+						false
+					);
+					dep.loc = expr.loc;
+					parser.state.module.addDependency(dep);
+				}
+			}
+		);
+	}
+};
+
+module.exports.harmonySpecifierTag = harmonySpecifierTag;
+module.exports.getAssertions = getAssertions;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportSideEffectDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportSideEffectDependency.js
new file mode 100644
index 0000000..2a7cbd9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportSideEffectDependency.js
@@ -0,0 +1,80 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const HarmonyImportDependency = require("./HarmonyImportDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../InitFragment")} InitFragment */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class HarmonyImportSideEffectDependency extends HarmonyImportDependency {
+	constructor(request, sourceOrder, assertions) {
+		super(request, sourceOrder, assertions);
+	}
+
+	get type() {
+		return "harmony side effect evaluation";
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {null | false | function(ModuleGraphConnection, RuntimeSpec): ConnectionState} function to determine if the connection is active
+	 */
+	getCondition(moduleGraph) {
+		return connection => {
+			const refModule = connection.resolvedModule;
+			if (!refModule) return true;
+			return refModule.getSideEffectsConnectionState(moduleGraph);
+		};
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		const refModule = moduleGraph.getModule(this);
+		if (!refModule) return true;
+		return refModule.getSideEffectsConnectionState(moduleGraph);
+	}
+}
+
+makeSerializable(
+	HarmonyImportSideEffectDependency,
+	"webpack/lib/dependencies/HarmonyImportSideEffectDependency"
+);
+
+HarmonyImportSideEffectDependency.Template = class HarmonyImportSideEffectDependencyTemplate extends (
+	HarmonyImportDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const { moduleGraph, concatenationScope } = templateContext;
+		if (concatenationScope) {
+			const module = moduleGraph.getModule(dependency);
+			if (concatenationScope.isModuleInScope(module)) {
+				return;
+			}
+		}
+		super.apply(dependency, source, templateContext);
+	}
+};
+
+module.exports = HarmonyImportSideEffectDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportSpecifierDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportSpecifierDependency.js
new file mode 100644
index 0000000..83818c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyImportSpecifierDependency.js
@@ -0,0 +1,331 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const {
+	getDependencyUsedByExportsCondition
+} = require("../optimize/InnerGraph");
+const makeSerializable = require("../util/makeSerializable");
+const propertyAccess = require("../util/propertyAccess");
+const HarmonyImportDependency = require("./HarmonyImportDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+const idsSymbol = Symbol("HarmonyImportSpecifierDependency.ids");
+
+const { ExportPresenceModes } = HarmonyImportDependency;
+
+class HarmonyImportSpecifierDependency extends HarmonyImportDependency {
+	constructor(
+		request,
+		sourceOrder,
+		ids,
+		name,
+		range,
+		exportPresenceMode,
+		assertions
+	) {
+		super(request, sourceOrder, assertions);
+		this.ids = ids;
+		this.name = name;
+		this.range = range;
+		this.exportPresenceMode = exportPresenceMode;
+		this.namespaceObjectAsContext = false;
+		this.call = undefined;
+		this.directImport = undefined;
+		this.shorthand = undefined;
+		this.asiSafe = undefined;
+		/** @type {Set<string> | boolean} */
+		this.usedByExports = undefined;
+	}
+
+	// TODO webpack 6 remove
+	get id() {
+		throw new Error("id was renamed to ids and type changed to string[]");
+	}
+
+	// TODO webpack 6 remove
+	getId() {
+		throw new Error("id was renamed to ids and type changed to string[]");
+	}
+
+	// TODO webpack 6 remove
+	setId() {
+		throw new Error("id was renamed to ids and type changed to string[]");
+	}
+
+	get type() {
+		return "harmony import specifier";
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {string[]} the imported ids
+	 */
+	getIds(moduleGraph) {
+		const meta = moduleGraph.getMetaIfExisting(this);
+		if (meta === undefined) return this.ids;
+		const ids = meta[idsSymbol];
+		return ids !== undefined ? ids : this.ids;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {string[]} ids the imported ids
+	 * @returns {void}
+	 */
+	setIds(moduleGraph, ids) {
+		moduleGraph.getMeta(this)[idsSymbol] = ids;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {null | false | function(ModuleGraphConnection, RuntimeSpec): ConnectionState} function to determine if the connection is active
+	 */
+	getCondition(moduleGraph) {
+		return getDependencyUsedByExportsCondition(
+			this,
+			this.usedByExports,
+			moduleGraph
+		);
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		return false;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		let ids = this.getIds(moduleGraph);
+		if (ids.length === 0) return Dependency.EXPORTS_OBJECT_REFERENCED;
+		let namespaceObjectAsContext = this.namespaceObjectAsContext;
+		if (ids[0] === "default") {
+			const selfModule = moduleGraph.getParentModule(this);
+			const importedModule = moduleGraph.getModule(this);
+			switch (
+				importedModule.getExportsType(
+					moduleGraph,
+					selfModule.buildMeta.strictHarmonyModule
+				)
+			) {
+				case "default-only":
+				case "default-with-named":
+					if (ids.length === 1) return Dependency.EXPORTS_OBJECT_REFERENCED;
+					ids = ids.slice(1);
+					namespaceObjectAsContext = true;
+					break;
+				case "dynamic":
+					return Dependency.EXPORTS_OBJECT_REFERENCED;
+			}
+		}
+
+		if (
+			this.call &&
+			!this.directImport &&
+			(namespaceObjectAsContext || ids.length > 1)
+		) {
+			if (ids.length === 1) return Dependency.EXPORTS_OBJECT_REFERENCED;
+			ids = ids.slice(0, -1);
+		}
+
+		return [ids];
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {number} effective mode
+	 */
+	_getEffectiveExportPresenceLevel(moduleGraph) {
+		if (this.exportPresenceMode !== ExportPresenceModes.AUTO)
+			return this.exportPresenceMode;
+		return moduleGraph.getParentModule(this).buildMeta.strictHarmonyModule
+			? ExportPresenceModes.ERROR
+			: ExportPresenceModes.WARN;
+	}
+
+	/**
+	 * Returns warnings
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} warnings
+	 */
+	getWarnings(moduleGraph) {
+		const exportsPresence = this._getEffectiveExportPresenceLevel(moduleGraph);
+		if (exportsPresence === ExportPresenceModes.WARN) {
+			return this._getErrors(moduleGraph);
+		}
+		return null;
+	}
+
+	/**
+	 * Returns errors
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} errors
+	 */
+	getErrors(moduleGraph) {
+		const exportsPresence = this._getEffectiveExportPresenceLevel(moduleGraph);
+		if (exportsPresence === ExportPresenceModes.ERROR) {
+			return this._getErrors(moduleGraph);
+		}
+		return null;
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[] | undefined} errors
+	 */
+	_getErrors(moduleGraph) {
+		const ids = this.getIds(moduleGraph);
+		return this.getLinkingErrors(
+			moduleGraph,
+			ids,
+			`(imported as '${this.name}')`
+		);
+	}
+
+	/**
+	 * implement this method to allow the occurrence order plugin to count correctly
+	 * @returns {number} count how often the id is used in this dependency
+	 */
+	getNumberOfIdOccurrences() {
+		return 0;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.ids);
+		write(this.name);
+		write(this.range);
+		write(this.exportPresenceMode);
+		write(this.namespaceObjectAsContext);
+		write(this.call);
+		write(this.directImport);
+		write(this.shorthand);
+		write(this.asiSafe);
+		write(this.usedByExports);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.ids = read();
+		this.name = read();
+		this.range = read();
+		this.exportPresenceMode = read();
+		this.namespaceObjectAsContext = read();
+		this.call = read();
+		this.directImport = read();
+		this.shorthand = read();
+		this.asiSafe = read();
+		this.usedByExports = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	HarmonyImportSpecifierDependency,
+	"webpack/lib/dependencies/HarmonyImportSpecifierDependency"
+);
+
+HarmonyImportSpecifierDependency.Template = class HarmonyImportSpecifierDependencyTemplate extends (
+	HarmonyImportDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {HarmonyImportSpecifierDependency} */ (dependency);
+		const { moduleGraph, module, runtime, concatenationScope } =
+			templateContext;
+		const connection = moduleGraph.getConnection(dep);
+		// Skip rendering depending when dependency is conditional
+		if (connection && !connection.isTargetActive(runtime)) return;
+
+		const ids = dep.getIds(moduleGraph);
+
+		let exportExpr;
+		if (
+			connection &&
+			concatenationScope &&
+			concatenationScope.isModuleInScope(connection.module)
+		) {
+			if (ids.length === 0) {
+				exportExpr = concatenationScope.createModuleReference(
+					connection.module,
+					{
+						asiSafe: dep.asiSafe
+					}
+				);
+			} else if (dep.namespaceObjectAsContext && ids.length === 1) {
+				exportExpr =
+					concatenationScope.createModuleReference(connection.module, {
+						asiSafe: dep.asiSafe
+					}) + propertyAccess(ids);
+			} else {
+				exportExpr = concatenationScope.createModuleReference(
+					connection.module,
+					{
+						ids,
+						call: dep.call,
+						directImport: dep.directImport,
+						asiSafe: dep.asiSafe
+					}
+				);
+			}
+		} else {
+			super.apply(dependency, source, templateContext);
+
+			const { runtimeTemplate, initFragments, runtimeRequirements } =
+				templateContext;
+
+			exportExpr = runtimeTemplate.exportFromImport({
+				moduleGraph,
+				module: moduleGraph.getModule(dep),
+				request: dep.request,
+				exportName: ids,
+				originModule: module,
+				asiSafe: dep.shorthand ? true : dep.asiSafe,
+				isCall: dep.call,
+				callContext: !dep.directImport,
+				defaultInterop: true,
+				importVar: dep.getImportVar(moduleGraph),
+				initFragments,
+				runtime,
+				runtimeRequirements
+			});
+		}
+		if (dep.shorthand) {
+			source.insert(dep.range[1], `: ${exportExpr}`);
+		} else {
+			source.replace(dep.range[0], dep.range[1] - 1, exportExpr);
+		}
+	}
+};
+
+module.exports = HarmonyImportSpecifierDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyModulesPlugin.js
new file mode 100644
index 0000000..c17b48d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyModulesPlugin.js
@@ -0,0 +1,121 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const HarmonyAcceptDependency = require("./HarmonyAcceptDependency");
+const HarmonyAcceptImportDependency = require("./HarmonyAcceptImportDependency");
+const HarmonyCompatibilityDependency = require("./HarmonyCompatibilityDependency");
+const HarmonyExportExpressionDependency = require("./HarmonyExportExpressionDependency");
+const HarmonyExportHeaderDependency = require("./HarmonyExportHeaderDependency");
+const HarmonyExportImportedSpecifierDependency = require("./HarmonyExportImportedSpecifierDependency");
+const HarmonyExportSpecifierDependency = require("./HarmonyExportSpecifierDependency");
+const HarmonyImportSideEffectDependency = require("./HarmonyImportSideEffectDependency");
+const HarmonyImportSpecifierDependency = require("./HarmonyImportSpecifierDependency");
+
+const HarmonyDetectionParserPlugin = require("./HarmonyDetectionParserPlugin");
+const HarmonyExportDependencyParserPlugin = require("./HarmonyExportDependencyParserPlugin");
+const HarmonyImportDependencyParserPlugin = require("./HarmonyImportDependencyParserPlugin");
+const HarmonyTopLevelThisParserPlugin = require("./HarmonyTopLevelThisParserPlugin");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class HarmonyModulesPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"HarmonyModulesPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyTemplates.set(
+					HarmonyCompatibilityDependency,
+					new HarmonyCompatibilityDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					HarmonyImportSideEffectDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					HarmonyImportSideEffectDependency,
+					new HarmonyImportSideEffectDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					HarmonyImportSpecifierDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					HarmonyImportSpecifierDependency,
+					new HarmonyImportSpecifierDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					HarmonyExportHeaderDependency,
+					new HarmonyExportHeaderDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					HarmonyExportExpressionDependency,
+					new HarmonyExportExpressionDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					HarmonyExportSpecifierDependency,
+					new HarmonyExportSpecifierDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					HarmonyExportImportedSpecifierDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					HarmonyExportImportedSpecifierDependency,
+					new HarmonyExportImportedSpecifierDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					HarmonyAcceptDependency,
+					new HarmonyAcceptDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					HarmonyAcceptImportDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					HarmonyAcceptImportDependency,
+					new HarmonyAcceptImportDependency.Template()
+				);
+
+				const handler = (parser, parserOptions) => {
+					// TODO webpack 6: rename harmony to esm or module
+					if (parserOptions.harmony !== undefined && !parserOptions.harmony)
+						return;
+
+					new HarmonyDetectionParserPlugin(this.options).apply(parser);
+					new HarmonyImportDependencyParserPlugin(parserOptions).apply(parser);
+					new HarmonyExportDependencyParserPlugin(parserOptions).apply(parser);
+					new HarmonyTopLevelThisParserPlugin().apply(parser);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("HarmonyModulesPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("HarmonyModulesPlugin", handler);
+			}
+		);
+	}
+}
+module.exports = HarmonyModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyTopLevelThisParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyTopLevelThisParserPlugin.js
new file mode 100644
index 0000000..9981c10
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/HarmonyTopLevelThisParserPlugin.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const ConstDependency = require("./ConstDependency");
+const HarmonyExports = require("./HarmonyExports");
+
+class HarmonyTopLevelThisParserPlugin {
+	apply(parser) {
+		parser.hooks.expression
+			.for("this")
+			.tap("HarmonyTopLevelThisParserPlugin", node => {
+				if (!parser.scope.topLevelScope) return;
+				if (HarmonyExports.isEnabled(parser.state)) {
+					const dep = new ConstDependency("undefined", node.range, null);
+					dep.loc = node.loc;
+					parser.state.module.addPresentationalDependency(dep);
+					return this;
+				}
+			});
+	}
+}
+
+module.exports = HarmonyTopLevelThisParserPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportContextDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportContextDependency.js
new file mode 100644
index 0000000..ecc86ec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportContextDependency.js
@@ -0,0 +1,52 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ContextDependency = require("./ContextDependency");
+const ContextDependencyTemplateAsRequireCall = require("./ContextDependencyTemplateAsRequireCall");
+
+class ImportContextDependency extends ContextDependency {
+	constructor(options, range, valueRange) {
+		super(options);
+
+		this.range = range;
+		this.valueRange = valueRange;
+	}
+
+	get type() {
+		return `import() context ${this.options.mode}`;
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.valueRange);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.valueRange = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	ImportContextDependency,
+	"webpack/lib/dependencies/ImportContextDependency"
+);
+
+ImportContextDependency.Template = ContextDependencyTemplateAsRequireCall;
+
+module.exports = ImportContextDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportDependency.js
new file mode 100644
index 0000000..8c93079
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportDependency.js
@@ -0,0 +1,101 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class ImportDependency extends ModuleDependency {
+	/**
+	 * @param {string} request the request
+	 * @param {[number, number]} range expression range
+	 * @param {string[][]=} referencedExports list of referenced exports
+	 */
+	constructor(request, range, referencedExports) {
+		super(request);
+		this.range = range;
+		this.referencedExports = referencedExports;
+	}
+
+	get type() {
+		return "import()";
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return this.referencedExports
+			? this.referencedExports.map(e => ({
+					name: e,
+					canMangle: false
+			  }))
+			: Dependency.EXPORTS_OBJECT_REFERENCED;
+	}
+
+	serialize(context) {
+		context.write(this.range);
+		context.write(this.referencedExports);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		this.range = context.read();
+		this.referencedExports = context.read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(ImportDependency, "webpack/lib/dependencies/ImportDependency");
+
+ImportDependency.Template = class ImportDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, module, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {ImportDependency} */ (dependency);
+		const block = /** @type {AsyncDependenciesBlock} */ (
+			moduleGraph.getParentBlock(dep)
+		);
+		const content = runtimeTemplate.moduleNamespacePromise({
+			chunkGraph,
+			block: block,
+			module: moduleGraph.getModule(dep),
+			request: dep.request,
+			strict: module.buildMeta.strictHarmonyModule,
+			message: "import()",
+			runtimeRequirements
+		});
+
+		source.replace(dep.range[0], dep.range[1] - 1, content);
+	}
+};
+
+module.exports = ImportDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportEagerDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportEagerDependency.js
new file mode 100644
index 0000000..2aa9a57
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportEagerDependency.js
@@ -0,0 +1,69 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ImportDependency = require("./ImportDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+
+class ImportEagerDependency extends ImportDependency {
+	/**
+	 * @param {string} request the request
+	 * @param {[number, number]} range expression range
+	 * @param {string[][]=} referencedExports list of referenced exports
+	 */
+	constructor(request, range, referencedExports) {
+		super(request, range, referencedExports);
+	}
+
+	get type() {
+		return "import() eager";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	ImportEagerDependency,
+	"webpack/lib/dependencies/ImportEagerDependency"
+);
+
+ImportEagerDependency.Template = class ImportEagerDependencyTemplate extends (
+	ImportDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, module, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {ImportEagerDependency} */ (dependency);
+		const content = runtimeTemplate.moduleNamespacePromise({
+			chunkGraph,
+			module: moduleGraph.getModule(dep),
+			request: dep.request,
+			strict: module.buildMeta.strictHarmonyModule,
+			message: "import() eager",
+			runtimeRequirements
+		});
+
+		source.replace(dep.range[0], dep.range[1] - 1, content);
+	}
+};
+
+module.exports = ImportEagerDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextDependency.js
new file mode 100644
index 0000000..edd21d4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextDependency.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ContextDependency = require("./ContextDependency");
+const ModuleDependencyTemplateAsRequireId = require("./ModuleDependencyTemplateAsRequireId");
+
+class ImportMetaContextDependency extends ContextDependency {
+	constructor(options, range) {
+		super(options);
+
+		this.range = range;
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	get type() {
+		return `import.meta.webpackContext ${this.options.mode}`;
+	}
+}
+
+makeSerializable(
+	ImportMetaContextDependency,
+	"webpack/lib/dependencies/ImportMetaContextDependency"
+);
+
+ImportMetaContextDependency.Template = ModuleDependencyTemplateAsRequireId;
+
+module.exports = ImportMetaContextDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextDependencyParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextDependencyParserPlugin.js
new file mode 100644
index 0000000..73c2426
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextDependencyParserPlugin.js
@@ -0,0 +1,252 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+const {
+	evaluateToIdentifier
+} = require("../javascript/JavascriptParserHelpers");
+const ImportMetaContextDependency = require("./ImportMetaContextDependency");
+
+/** @typedef {import("estree").Expression} ExpressionNode */
+/** @typedef {import("estree").ObjectExpression} ObjectExpressionNode */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+/** @typedef {import("../ContextModule").ContextModuleOptions} ContextModuleOptions */
+/** @typedef {import("../ChunkGroup").RawChunkGroupOptions} RawChunkGroupOptions */
+/** @typedef {Pick<ContextModuleOptions, 'mode'|'recursive'|'regExp'|'include'|'exclude'|'chunkName'>&{groupOptions: RawChunkGroupOptions, exports?: ContextModuleOptions["referencedExports"]}} ImportMetaContextOptions */
+
+function createPropertyParseError(prop, expect) {
+	return createError(
+		`Parsing import.meta.webpackContext options failed. Unknown value for property ${JSON.stringify(
+			prop.key.name
+		)}, expected type ${expect}.`,
+		prop.value.loc
+	);
+}
+
+function createError(msg, loc) {
+	const error = new WebpackError(msg);
+	error.name = "ImportMetaContextError";
+	error.loc = loc;
+	return error;
+}
+
+module.exports = class ImportMetaContextDependencyParserPlugin {
+	apply(parser) {
+		parser.hooks.evaluateIdentifier
+			.for("import.meta.webpackContext")
+			.tap("HotModuleReplacementPlugin", expr => {
+				return evaluateToIdentifier(
+					"import.meta.webpackContext",
+					"import.meta",
+					() => ["webpackContext"],
+					true
+				)(expr);
+			});
+		parser.hooks.call
+			.for("import.meta.webpackContext")
+			.tap("ImportMetaContextDependencyParserPlugin", expr => {
+				if (expr.arguments.length < 1 || expr.arguments.length > 2) return;
+				const [directoryNode, optionsNode] = expr.arguments;
+				if (optionsNode && optionsNode.type !== "ObjectExpression") return;
+				const requestExpr = parser.evaluateExpression(directoryNode);
+				if (!requestExpr.isString()) return;
+				const request = requestExpr.string;
+				const errors = [];
+				let regExp = /^\.\/.*$/;
+				let recursive = true;
+				/** @type {ContextModuleOptions["mode"]} */
+				let mode = "sync";
+				/** @type {ContextModuleOptions["include"]} */
+				let include;
+				/** @type {ContextModuleOptions["exclude"]} */
+				let exclude;
+				/** @type {RawChunkGroupOptions} */
+				const groupOptions = {};
+				/** @type {ContextModuleOptions["chunkName"]} */
+				let chunkName;
+				/** @type {ContextModuleOptions["referencedExports"]} */
+				let exports;
+				if (optionsNode) {
+					for (const prop of optionsNode.properties) {
+						if (prop.type !== "Property" || prop.key.type !== "Identifier") {
+							errors.push(
+								createError(
+									"Parsing import.meta.webpackContext options failed.",
+									optionsNode.loc
+								)
+							);
+							break;
+						}
+						switch (prop.key.name) {
+							case "regExp": {
+								const regExpExpr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (!regExpExpr.isRegExp()) {
+									errors.push(createPropertyParseError(prop, "RegExp"));
+								} else {
+									regExp = regExpExpr.regExp;
+								}
+								break;
+							}
+							case "include": {
+								const regExpExpr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (!regExpExpr.isRegExp()) {
+									errors.push(createPropertyParseError(prop, "RegExp"));
+								} else {
+									include = regExpExpr.regExp;
+								}
+								break;
+							}
+							case "exclude": {
+								const regExpExpr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (!regExpExpr.isRegExp()) {
+									errors.push(createPropertyParseError(prop, "RegExp"));
+								} else {
+									exclude = regExpExpr.regExp;
+								}
+								break;
+							}
+							case "mode": {
+								const modeExpr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (!modeExpr.isString()) {
+									errors.push(createPropertyParseError(prop, "string"));
+								} else {
+									mode = /** @type {ContextModuleOptions["mode"]} */ (
+										modeExpr.string
+									);
+								}
+								break;
+							}
+							case "chunkName": {
+								const expr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (!expr.isString()) {
+									errors.push(createPropertyParseError(prop, "string"));
+								} else {
+									chunkName = expr.string;
+								}
+								break;
+							}
+							case "exports": {
+								const expr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (expr.isString()) {
+									exports = [[expr.string]];
+								} else if (expr.isArray()) {
+									const items = expr.items;
+									if (
+										items.every(i => {
+											if (!i.isArray()) return false;
+											const innerItems = i.items;
+											return innerItems.every(i => i.isString());
+										})
+									) {
+										exports = [];
+										for (const i1 of items) {
+											const export_ = [];
+											for (const i2 of i1.items) {
+												export_.push(i2.string);
+											}
+											exports.push(export_);
+										}
+									} else {
+										errors.push(
+											createPropertyParseError(prop, "string|string[][]")
+										);
+									}
+								} else {
+									errors.push(
+										createPropertyParseError(prop, "string|string[][]")
+									);
+								}
+								break;
+							}
+							case "prefetch": {
+								const expr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (expr.isBoolean()) {
+									groupOptions.prefetchOrder = 0;
+								} else if (expr.isNumber()) {
+									groupOptions.prefetchOrder = expr.number;
+								} else {
+									errors.push(createPropertyParseError(prop, "boolean|number"));
+								}
+								break;
+							}
+							case "preload": {
+								const expr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (expr.isBoolean()) {
+									groupOptions.preloadOrder = 0;
+								} else if (expr.isNumber()) {
+									groupOptions.preloadOrder = expr.number;
+								} else {
+									errors.push(createPropertyParseError(prop, "boolean|number"));
+								}
+								break;
+							}
+							case "recursive": {
+								const recursiveExpr = parser.evaluateExpression(
+									/** @type {ExpressionNode} */ (prop.value)
+								);
+								if (!recursiveExpr.isBoolean()) {
+									errors.push(createPropertyParseError(prop, "boolean"));
+								} else {
+									recursive = recursiveExpr.bool;
+								}
+								break;
+							}
+							default:
+								errors.push(
+									createError(
+										`Parsing import.meta.webpackContext options failed. Unknown property ${JSON.stringify(
+											prop.key.name
+										)}.`,
+										optionsNode.loc
+									)
+								);
+						}
+					}
+				}
+				if (errors.length) {
+					for (const error of errors) parser.state.current.addError(error);
+					return;
+				}
+
+				const dep = new ImportMetaContextDependency(
+					{
+						request,
+						include,
+						exclude,
+						recursive,
+						regExp,
+						groupOptions,
+						chunkName,
+						referencedExports: exports,
+						mode,
+						category: "esm"
+					},
+					expr.range
+				);
+				dep.loc = expr.loc;
+				dep.optional = !!parser.scope.inTry;
+				parser.state.current.addDependency(dep);
+				return true;
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextPlugin.js
new file mode 100644
index 0000000..1d7d7ce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaContextPlugin.js
@@ -0,0 +1,59 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const ContextElementDependency = require("./ContextElementDependency");
+const ImportMetaContextDependency = require("./ImportMetaContextDependency");
+const ImportMetaContextDependencyParserPlugin = require("./ImportMetaContextDependencyParserPlugin");
+
+/** @typedef {import("../../declarations/WebpackOptions").ResolveOptions} ResolveOptions */
+/** @typedef {import("../Compiler")} Compiler */
+
+class ImportMetaContextPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"RequireContextPlugin",
+			(compilation, { contextModuleFactory, normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					ImportMetaContextDependency,
+					contextModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ImportMetaContextDependency,
+					new ImportMetaContextDependency.Template()
+				);
+				compilation.dependencyFactories.set(
+					ContextElementDependency,
+					normalModuleFactory
+				);
+
+				const handler = (parser, parserOptions) => {
+					if (
+						parserOptions.importMetaContext !== undefined &&
+						!parserOptions.importMetaContext
+					)
+						return;
+
+					new ImportMetaContextDependencyParserPlugin().apply(parser);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("ImportMetaContextPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("ImportMetaContextPlugin", handler);
+			}
+		);
+	}
+}
+
+module.exports = ImportMetaContextPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaHotAcceptDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaHotAcceptDependency.js
new file mode 100644
index 0000000..66329d7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaHotAcceptDependency.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const ModuleDependencyTemplateAsId = require("./ModuleDependencyTemplateAsId");
+
+class ImportMetaHotAcceptDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+		this.range = range;
+		this.weak = true;
+	}
+
+	get type() {
+		return "import.meta.webpackHot.accept";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	ImportMetaHotAcceptDependency,
+	"webpack/lib/dependencies/ImportMetaHotAcceptDependency"
+);
+
+ImportMetaHotAcceptDependency.Template = ModuleDependencyTemplateAsId;
+
+module.exports = ImportMetaHotAcceptDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaHotDeclineDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaHotDeclineDependency.js
new file mode 100644
index 0000000..b9d1a5a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaHotDeclineDependency.js
@@ -0,0 +1,36 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const ModuleDependencyTemplateAsId = require("./ModuleDependencyTemplateAsId");
+
+class ImportMetaHotDeclineDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+
+		this.range = range;
+		this.weak = true;
+	}
+
+	get type() {
+		return "import.meta.webpackHot.decline";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	ImportMetaHotDeclineDependency,
+	"webpack/lib/dependencies/ImportMetaHotDeclineDependency"
+);
+
+ImportMetaHotDeclineDependency.Template = ModuleDependencyTemplateAsId;
+
+module.exports = ImportMetaHotDeclineDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaPlugin.js
new file mode 100644
index 0000000..e8f25db
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportMetaPlugin.js
@@ -0,0 +1,203 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const { pathToFileURL } = require("url");
+const ModuleDependencyWarning = require("../ModuleDependencyWarning");
+const Template = require("../Template");
+const BasicEvaluatedExpression = require("../javascript/BasicEvaluatedExpression");
+const {
+	evaluateToIdentifier,
+	toConstantDependency,
+	evaluateToString,
+	evaluateToNumber
+} = require("../javascript/JavascriptParserHelpers");
+const memoize = require("../util/memoize");
+const propertyAccess = require("../util/propertyAccess");
+const ConstDependency = require("./ConstDependency");
+
+/** @typedef {import("estree").MemberExpression} MemberExpression */
+/** @typedef {import("../../declarations/WebpackOptions").JavascriptParserOptions} JavascriptParserOptions */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../javascript/JavascriptParser")} Parser */
+
+const getCriticalDependencyWarning = memoize(() =>
+	require("./CriticalDependencyWarning")
+);
+
+class ImportMetaPlugin {
+	/**
+	 * @param {Compiler} compiler compiler
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"ImportMetaPlugin",
+			(compilation, { normalModuleFactory }) => {
+				/**
+				 * @param {NormalModule} module module
+				 * @returns {string} file url
+				 */
+				const getUrl = module => {
+					return pathToFileURL(module.resource).toString();
+				};
+				/**
+				 * @param {Parser} parser parser parser
+				 * @param {JavascriptParserOptions} parserOptions parserOptions
+				 * @returns {void}
+				 */
+				const parserHandler = (parser, { importMeta }) => {
+					if (importMeta === false) {
+						const { importMetaName } = compilation.outputOptions;
+						if (importMetaName === "import.meta") return;
+
+						parser.hooks.expression
+							.for("import.meta")
+							.tap("ImportMetaPlugin", metaProperty => {
+								const dep = new ConstDependency(
+									importMetaName,
+									metaProperty.range
+								);
+								dep.loc = metaProperty.loc;
+								parser.state.module.addPresentationalDependency(dep);
+								return true;
+							});
+						return;
+					}
+
+					/// import.meta direct ///
+					parser.hooks.typeof
+						.for("import.meta")
+						.tap(
+							"ImportMetaPlugin",
+							toConstantDependency(parser, JSON.stringify("object"))
+						);
+					parser.hooks.expression
+						.for("import.meta")
+						.tap("ImportMetaPlugin", metaProperty => {
+							const CriticalDependencyWarning = getCriticalDependencyWarning();
+							parser.state.module.addWarning(
+								new ModuleDependencyWarning(
+									parser.state.module,
+									new CriticalDependencyWarning(
+										"Accessing import.meta directly is unsupported (only property access is supported)"
+									),
+									metaProperty.loc
+								)
+							);
+							const dep = new ConstDependency(
+								`${parser.isAsiPosition(metaProperty.range[0]) ? ";" : ""}({})`,
+								metaProperty.range
+							);
+							dep.loc = metaProperty.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+					parser.hooks.evaluateTypeof
+						.for("import.meta")
+						.tap("ImportMetaPlugin", evaluateToString("object"));
+					parser.hooks.evaluateIdentifier.for("import.meta").tap(
+						"ImportMetaPlugin",
+						evaluateToIdentifier("import.meta", "import.meta", () => [], true)
+					);
+
+					/// import.meta.url ///
+					parser.hooks.typeof
+						.for("import.meta.url")
+						.tap(
+							"ImportMetaPlugin",
+							toConstantDependency(parser, JSON.stringify("string"))
+						);
+					parser.hooks.expression
+						.for("import.meta.url")
+						.tap("ImportMetaPlugin", expr => {
+							const dep = new ConstDependency(
+								JSON.stringify(getUrl(parser.state.module)),
+								expr.range
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+					parser.hooks.evaluateTypeof
+						.for("import.meta.url")
+						.tap("ImportMetaPlugin", evaluateToString("string"));
+					parser.hooks.evaluateIdentifier
+						.for("import.meta.url")
+						.tap("ImportMetaPlugin", expr => {
+							return new BasicEvaluatedExpression()
+								.setString(getUrl(parser.state.module))
+								.setRange(expr.range);
+						});
+
+					/// import.meta.webpack ///
+					const webpackVersion = parseInt(
+						require("../../package.json").version,
+						10
+					);
+					parser.hooks.typeof
+						.for("import.meta.webpack")
+						.tap(
+							"ImportMetaPlugin",
+							toConstantDependency(parser, JSON.stringify("number"))
+						);
+					parser.hooks.expression
+						.for("import.meta.webpack")
+						.tap(
+							"ImportMetaPlugin",
+							toConstantDependency(parser, JSON.stringify(webpackVersion))
+						);
+					parser.hooks.evaluateTypeof
+						.for("import.meta.webpack")
+						.tap("ImportMetaPlugin", evaluateToString("number"));
+					parser.hooks.evaluateIdentifier
+						.for("import.meta.webpack")
+						.tap("ImportMetaPlugin", evaluateToNumber(webpackVersion));
+
+					/// Unknown properties ///
+					parser.hooks.unhandledExpressionMemberChain
+						.for("import.meta")
+						.tap("ImportMetaPlugin", (expr, members) => {
+							const dep = new ConstDependency(
+								`${Template.toNormalComment(
+									"unsupported import.meta." + members.join(".")
+								)} undefined${propertyAccess(members, 1)}`,
+								expr.range
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep);
+							return true;
+						});
+					parser.hooks.evaluate
+						.for("MemberExpression")
+						.tap("ImportMetaPlugin", expression => {
+							const expr = /** @type {MemberExpression} */ (expression);
+							if (
+								expr.object.type === "MetaProperty" &&
+								expr.object.meta.name === "import" &&
+								expr.object.property.name === "meta" &&
+								expr.property.type ===
+									(expr.computed ? "Literal" : "Identifier")
+							) {
+								return new BasicEvaluatedExpression()
+									.setUndefined()
+									.setRange(expr.range);
+							}
+						});
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("ImportMetaPlugin", parserHandler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("ImportMetaPlugin", parserHandler);
+			}
+		);
+	}
+}
+
+module.exports = ImportMetaPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportParserPlugin.js
new file mode 100644
index 0000000..d37a141
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportParserPlugin.js
@@ -0,0 +1,267 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const CommentCompilationWarning = require("../CommentCompilationWarning");
+const UnsupportedFeatureWarning = require("../UnsupportedFeatureWarning");
+const ContextDependencyHelpers = require("./ContextDependencyHelpers");
+const ImportContextDependency = require("./ImportContextDependency");
+const ImportDependency = require("./ImportDependency");
+const ImportEagerDependency = require("./ImportEagerDependency");
+const ImportWeakDependency = require("./ImportWeakDependency");
+
+/** @typedef {import("../ChunkGroup").RawChunkGroupOptions} RawChunkGroupOptions */
+/** @typedef {import("../ContextModule").ContextMode} ContextMode */
+
+class ImportParserPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	apply(parser) {
+		parser.hooks.importCall.tap("ImportParserPlugin", expr => {
+			const param = parser.evaluateExpression(expr.source);
+
+			let chunkName = null;
+			/** @type {ContextMode} */
+			let mode = "lazy";
+			let include = null;
+			let exclude = null;
+			/** @type {string[][] | null} */
+			let exports = null;
+			/** @type {RawChunkGroupOptions} */
+			const groupOptions = {};
+
+			const { options: importOptions, errors: commentErrors } =
+				parser.parseCommentOptions(expr.range);
+
+			if (commentErrors) {
+				for (const e of commentErrors) {
+					const { comment } = e;
+					parser.state.module.addWarning(
+						new CommentCompilationWarning(
+							`Compilation error while processing magic comment(-s): /*${comment.value}*/: ${e.message}`,
+							comment.loc
+						)
+					);
+				}
+			}
+
+			if (importOptions) {
+				if (importOptions.webpackIgnore !== undefined) {
+					if (typeof importOptions.webpackIgnore !== "boolean") {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackIgnore\` expected a boolean, but received: ${importOptions.webpackIgnore}.`,
+								expr.loc
+							)
+						);
+					} else {
+						// Do not instrument `import()` if `webpackIgnore` is `true`
+						if (importOptions.webpackIgnore) {
+							return false;
+						}
+					}
+				}
+				if (importOptions.webpackChunkName !== undefined) {
+					if (typeof importOptions.webpackChunkName !== "string") {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackChunkName\` expected a string, but received: ${importOptions.webpackChunkName}.`,
+								expr.loc
+							)
+						);
+					} else {
+						chunkName = importOptions.webpackChunkName;
+					}
+				}
+				if (importOptions.webpackMode !== undefined) {
+					if (typeof importOptions.webpackMode !== "string") {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackMode\` expected a string, but received: ${importOptions.webpackMode}.`,
+								expr.loc
+							)
+						);
+					} else {
+						mode = importOptions.webpackMode;
+					}
+				}
+				if (importOptions.webpackPrefetch !== undefined) {
+					if (importOptions.webpackPrefetch === true) {
+						groupOptions.prefetchOrder = 0;
+					} else if (typeof importOptions.webpackPrefetch === "number") {
+						groupOptions.prefetchOrder = importOptions.webpackPrefetch;
+					} else {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackPrefetch\` expected true or a number, but received: ${importOptions.webpackPrefetch}.`,
+								expr.loc
+							)
+						);
+					}
+				}
+				if (importOptions.webpackPreload !== undefined) {
+					if (importOptions.webpackPreload === true) {
+						groupOptions.preloadOrder = 0;
+					} else if (typeof importOptions.webpackPreload === "number") {
+						groupOptions.preloadOrder = importOptions.webpackPreload;
+					} else {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackPreload\` expected true or a number, but received: ${importOptions.webpackPreload}.`,
+								expr.loc
+							)
+						);
+					}
+				}
+				if (importOptions.webpackInclude !== undefined) {
+					if (
+						!importOptions.webpackInclude ||
+						importOptions.webpackInclude.constructor.name !== "RegExp"
+					) {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackInclude\` expected a regular expression, but received: ${importOptions.webpackInclude}.`,
+								expr.loc
+							)
+						);
+					} else {
+						include = new RegExp(importOptions.webpackInclude);
+					}
+				}
+				if (importOptions.webpackExclude !== undefined) {
+					if (
+						!importOptions.webpackExclude ||
+						importOptions.webpackExclude.constructor.name !== "RegExp"
+					) {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackExclude\` expected a regular expression, but received: ${importOptions.webpackExclude}.`,
+								expr.loc
+							)
+						);
+					} else {
+						exclude = new RegExp(importOptions.webpackExclude);
+					}
+				}
+				if (importOptions.webpackExports !== undefined) {
+					if (
+						!(
+							typeof importOptions.webpackExports === "string" ||
+							(Array.isArray(importOptions.webpackExports) &&
+								importOptions.webpackExports.every(
+									item => typeof item === "string"
+								))
+						)
+					) {
+						parser.state.module.addWarning(
+							new UnsupportedFeatureWarning(
+								`\`webpackExports\` expected a string or an array of strings, but received: ${importOptions.webpackExports}.`,
+								expr.loc
+							)
+						);
+					} else {
+						if (typeof importOptions.webpackExports === "string") {
+							exports = [[importOptions.webpackExports]];
+						} else {
+							exports = Array.from(importOptions.webpackExports, e => [e]);
+						}
+					}
+				}
+			}
+
+			if (param.isString()) {
+				if (mode !== "lazy" && mode !== "eager" && mode !== "weak") {
+					parser.state.module.addWarning(
+						new UnsupportedFeatureWarning(
+							`\`webpackMode\` expected 'lazy', 'eager' or 'weak', but received: ${mode}.`,
+							expr.loc
+						)
+					);
+				}
+
+				if (mode === "eager") {
+					const dep = new ImportEagerDependency(
+						param.string,
+						expr.range,
+						exports
+					);
+					parser.state.current.addDependency(dep);
+				} else if (mode === "weak") {
+					const dep = new ImportWeakDependency(
+						param.string,
+						expr.range,
+						exports
+					);
+					parser.state.current.addDependency(dep);
+				} else {
+					const depBlock = new AsyncDependenciesBlock(
+						{
+							...groupOptions,
+							name: chunkName
+						},
+						expr.loc,
+						param.string
+					);
+					const dep = new ImportDependency(param.string, expr.range, exports);
+					dep.loc = expr.loc;
+					depBlock.addDependency(dep);
+					parser.state.current.addBlock(depBlock);
+				}
+				return true;
+			} else {
+				if (
+					mode !== "lazy" &&
+					mode !== "lazy-once" &&
+					mode !== "eager" &&
+					mode !== "weak"
+				) {
+					parser.state.module.addWarning(
+						new UnsupportedFeatureWarning(
+							`\`webpackMode\` expected 'lazy', 'lazy-once', 'eager' or 'weak', but received: ${mode}.`,
+							expr.loc
+						)
+					);
+					mode = "lazy";
+				}
+
+				if (mode === "weak") {
+					mode = "async-weak";
+				}
+				const dep = ContextDependencyHelpers.create(
+					ImportContextDependency,
+					expr.range,
+					param,
+					expr,
+					this.options,
+					{
+						chunkName,
+						groupOptions,
+						include,
+						exclude,
+						mode,
+						namespaceObject: parser.state.module.buildMeta.strictHarmonyModule
+							? "strict"
+							: true,
+						typePrefix: "import()",
+						category: "esm",
+						referencedExports: exports
+					},
+					parser
+				);
+				if (!dep) return;
+				dep.loc = expr.loc;
+				dep.optional = !!parser.scope.inTry;
+				parser.state.current.addDependency(dep);
+				return true;
+			}
+		});
+	}
+}
+
+module.exports = ImportParserPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportPlugin.js
new file mode 100644
index 0000000..d2628ef
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportPlugin.js
@@ -0,0 +1,82 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ImportContextDependency = require("./ImportContextDependency");
+const ImportDependency = require("./ImportDependency");
+const ImportEagerDependency = require("./ImportEagerDependency");
+const ImportParserPlugin = require("./ImportParserPlugin");
+const ImportWeakDependency = require("./ImportWeakDependency");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ImportPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"ImportPlugin",
+			(compilation, { contextModuleFactory, normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					ImportDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ImportDependency,
+					new ImportDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					ImportEagerDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ImportEagerDependency,
+					new ImportEagerDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					ImportWeakDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ImportWeakDependency,
+					new ImportWeakDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					ImportContextDependency,
+					contextModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					ImportContextDependency,
+					new ImportContextDependency.Template()
+				);
+
+				const handler = (parser, parserOptions) => {
+					if (parserOptions.import !== undefined && !parserOptions.import)
+						return;
+
+					new ImportParserPlugin(parserOptions).apply(parser);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("ImportPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("ImportPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("ImportPlugin", handler);
+			}
+		);
+	}
+}
+module.exports = ImportPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportWeakDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportWeakDependency.js
new file mode 100644
index 0000000..fc14196
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ImportWeakDependency.js
@@ -0,0 +1,67 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ImportDependency = require("./ImportDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+
+class ImportWeakDependency extends ImportDependency {
+	/**
+	 * @param {string} request the request
+	 * @param {[number, number]} range expression range
+	 * @param {string[][]=} referencedExports list of referenced exports
+	 */
+	constructor(request, range, referencedExports) {
+		super(request, range, referencedExports);
+		this.weak = true;
+	}
+
+	get type() {
+		return "import() weak";
+	}
+}
+
+makeSerializable(
+	ImportWeakDependency,
+	"webpack/lib/dependencies/ImportWeakDependency"
+);
+
+ImportWeakDependency.Template = class ImportDependencyTemplate extends (
+	ImportDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, module, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {ImportWeakDependency} */ (dependency);
+		const content = runtimeTemplate.moduleNamespacePromise({
+			chunkGraph,
+			module: moduleGraph.getModule(dep),
+			request: dep.request,
+			strict: module.buildMeta.strictHarmonyModule,
+			message: "import() weak",
+			weak: true,
+			runtimeRequirements
+		});
+
+		source.replace(dep.range[0], dep.range[1] - 1, content);
+	}
+};
+
+module.exports = ImportWeakDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/JsonExportsDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/JsonExportsDependency.js
new file mode 100644
index 0000000..b8b90c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/JsonExportsDependency.js
@@ -0,0 +1,103 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency").ExportSpec} ExportSpec */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/Hash")} Hash */
+
+const getExportsFromData = data => {
+	if (data && typeof data === "object") {
+		if (Array.isArray(data)) {
+			return data.map((item, idx) => {
+				return {
+					name: `${idx}`,
+					canMangle: true,
+					exports: getExportsFromData(item)
+				};
+			});
+		} else {
+			const exports = [];
+			for (const key of Object.keys(data)) {
+				exports.push({
+					name: key,
+					canMangle: true,
+					exports: getExportsFromData(data[key])
+				});
+			}
+			return exports;
+		}
+	}
+	return undefined;
+};
+
+class JsonExportsDependency extends NullDependency {
+	/**
+	 * @param {(string | ExportSpec)[]} exports json exports
+	 */
+	constructor(exports) {
+		super();
+		this.exports = exports;
+		this._hashUpdate = undefined;
+	}
+
+	get type() {
+		return "json exports";
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		return {
+			exports: this.exports,
+			dependencies: undefined
+		};
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		if (this._hashUpdate === undefined) {
+			this._hashUpdate = this.exports
+				? JSON.stringify(this.exports)
+				: "undefined";
+		}
+		hash.update(this._hashUpdate);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.exports);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.exports = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	JsonExportsDependency,
+	"webpack/lib/dependencies/JsonExportsDependency"
+);
+
+module.exports = JsonExportsDependency;
+module.exports.getExportsFromData = getExportsFromData;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderDependency.js
new file mode 100644
index 0000000..472d68f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderDependency.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("./ModuleDependency");
+
+class LoaderDependency extends ModuleDependency {
+	/**
+	 * @param {string} request request string
+	 */
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "loader";
+	}
+
+	get category() {
+		return "loader";
+	}
+}
+
+module.exports = LoaderDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderImportDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderImportDependency.js
new file mode 100644
index 0000000..e740cc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderImportDependency.js
@@ -0,0 +1,28 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("./ModuleDependency");
+
+class LoaderImportDependency extends ModuleDependency {
+	/**
+	 * @param {string} request request string
+	 */
+	constructor(request) {
+		super(request);
+		this.weak = true;
+	}
+
+	get type() {
+		return "loader import";
+	}
+
+	get category() {
+		return "loaderImport";
+	}
+}
+
+module.exports = LoaderImportDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderPlugin.js
new file mode 100644
index 0000000..3132cfd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LoaderPlugin.js
@@ -0,0 +1,261 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NormalModule = require("../NormalModule");
+const LazySet = require("../util/LazySet");
+const LoaderDependency = require("./LoaderDependency");
+const LoaderImportDependency = require("./LoaderImportDependency");
+
+/** @typedef {import("../Compilation").DepConstructor} DepConstructor */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+/**
+ * @callback LoadModuleCallback
+ * @param {(Error | null)=} err error object
+ * @param {string | Buffer=} source source code
+ * @param {object=} map source map
+ * @param {Module=} module loaded module if successful
+ */
+
+/**
+ * @callback ImportModuleCallback
+ * @param {(Error | null)=} err error object
+ * @param {any=} exports exports of the evaluated module
+ */
+
+/**
+ * @typedef {Object} ImportModuleOptions
+ * @property {string=} layer the target layer
+ * @property {string=} publicPath the target public path
+ * @property {string=} baseUri target base uri
+ */
+
+class LoaderPlugin {
+	/**
+	 * @param {Object} options options
+	 */
+	constructor(options = {}) {}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"LoaderPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					LoaderDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyFactories.set(
+					LoaderImportDependency,
+					normalModuleFactory
+				);
+			}
+		);
+
+		compiler.hooks.compilation.tap("LoaderPlugin", compilation => {
+			const moduleGraph = compilation.moduleGraph;
+			NormalModule.getCompilationHooks(compilation).loader.tap(
+				"LoaderPlugin",
+				loaderContext => {
+					/**
+					 * @param {string} request the request string to load the module from
+					 * @param {LoadModuleCallback} callback callback returning the loaded module or error
+					 * @returns {void}
+					 */
+					loaderContext.loadModule = (request, callback) => {
+						const dep = new LoaderDependency(request);
+						dep.loc = {
+							name: request
+						};
+						const factory = compilation.dependencyFactories.get(
+							/** @type {DepConstructor} */ (dep.constructor)
+						);
+						if (factory === undefined) {
+							return callback(
+								new Error(
+									`No module factory available for dependency type: ${dep.constructor.name}`
+								)
+							);
+						}
+						compilation.buildQueue.increaseParallelism();
+						compilation.handleModuleCreation(
+							{
+								factory,
+								dependencies: [dep],
+								originModule: loaderContext._module,
+								context: loaderContext.context,
+								recursive: false
+							},
+							err => {
+								compilation.buildQueue.decreaseParallelism();
+								if (err) {
+									return callback(err);
+								}
+								const referencedModule = moduleGraph.getModule(dep);
+								if (!referencedModule) {
+									return callback(new Error("Cannot load the module"));
+								}
+								if (referencedModule.getNumberOfErrors() > 0) {
+									return callback(
+										new Error("The loaded module contains errors")
+									);
+								}
+								const moduleSource = referencedModule.originalSource();
+								if (!moduleSource) {
+									return callback(
+										new Error(
+											"The module created for a LoaderDependency must have an original source"
+										)
+									);
+								}
+								let source, map;
+								if (moduleSource.sourceAndMap) {
+									const sourceAndMap = moduleSource.sourceAndMap();
+									map = sourceAndMap.map;
+									source = sourceAndMap.source;
+								} else {
+									map = moduleSource.map();
+									source = moduleSource.source();
+								}
+								const fileDependencies = new LazySet();
+								const contextDependencies = new LazySet();
+								const missingDependencies = new LazySet();
+								const buildDependencies = new LazySet();
+								referencedModule.addCacheDependencies(
+									fileDependencies,
+									contextDependencies,
+									missingDependencies,
+									buildDependencies
+								);
+
+								for (const d of fileDependencies) {
+									loaderContext.addDependency(d);
+								}
+								for (const d of contextDependencies) {
+									loaderContext.addContextDependency(d);
+								}
+								for (const d of missingDependencies) {
+									loaderContext.addMissingDependency(d);
+								}
+								for (const d of buildDependencies) {
+									loaderContext.addBuildDependency(d);
+								}
+								return callback(null, source, map, referencedModule);
+							}
+						);
+					};
+
+					/**
+					 * @param {string} request the request string to load the module from
+					 * @param {ImportModuleOptions=} options options
+					 * @param {ImportModuleCallback=} callback callback returning the exports
+					 * @returns {void}
+					 */
+					const importModule = (request, options, callback) => {
+						const dep = new LoaderImportDependency(request);
+						dep.loc = {
+							name: request
+						};
+						const factory = compilation.dependencyFactories.get(
+							/** @type {DepConstructor} */ (dep.constructor)
+						);
+						if (factory === undefined) {
+							return callback(
+								new Error(
+									`No module factory available for dependency type: ${dep.constructor.name}`
+								)
+							);
+						}
+						compilation.buildQueue.increaseParallelism();
+						compilation.handleModuleCreation(
+							{
+								factory,
+								dependencies: [dep],
+								originModule: loaderContext._module,
+								contextInfo: {
+									issuerLayer: options.layer
+								},
+								context: loaderContext.context,
+								connectOrigin: false
+							},
+							err => {
+								compilation.buildQueue.decreaseParallelism();
+								if (err) {
+									return callback(err);
+								}
+								const referencedModule = moduleGraph.getModule(dep);
+								if (!referencedModule) {
+									return callback(new Error("Cannot load the module"));
+								}
+								compilation.executeModule(
+									referencedModule,
+									{
+										entryOptions: {
+											baseUri: options.baseUri,
+											publicPath: options.publicPath
+										}
+									},
+									(err, result) => {
+										if (err) return callback(err);
+										for (const d of result.fileDependencies) {
+											loaderContext.addDependency(d);
+										}
+										for (const d of result.contextDependencies) {
+											loaderContext.addContextDependency(d);
+										}
+										for (const d of result.missingDependencies) {
+											loaderContext.addMissingDependency(d);
+										}
+										for (const d of result.buildDependencies) {
+											loaderContext.addBuildDependency(d);
+										}
+										if (result.cacheable === false)
+											loaderContext.cacheable(false);
+										for (const [name, { source, info }] of result.assets) {
+											const { buildInfo } = loaderContext._module;
+											if (!buildInfo.assets) {
+												buildInfo.assets = Object.create(null);
+												buildInfo.assetsInfo = new Map();
+											}
+											buildInfo.assets[name] = source;
+											buildInfo.assetsInfo.set(name, info);
+										}
+										callback(null, result.exports);
+									}
+								);
+							}
+						);
+					};
+
+					/**
+					 * @param {string} request the request string to load the module from
+					 * @param {ImportModuleOptions} options options
+					 * @param {ImportModuleCallback=} callback callback returning the exports
+					 * @returns {Promise<any> | void} exports
+					 */
+					loaderContext.importModule = (request, options, callback) => {
+						if (!callback) {
+							return new Promise((resolve, reject) => {
+								importModule(request, options || {}, (err, result) => {
+									if (err) reject(err);
+									else resolve(result);
+								});
+							});
+						}
+						return importModule(request, options || {}, callback);
+					};
+				}
+			);
+		});
+	}
+}
+module.exports = LoaderPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModule.js
new file mode 100644
index 0000000..8516594
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModule.js
@@ -0,0 +1,44 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+
+class LocalModule {
+	constructor(name, idx) {
+		this.name = name;
+		this.idx = idx;
+		this.used = false;
+	}
+
+	flagUsed() {
+		this.used = true;
+	}
+
+	variableName() {
+		return "__WEBPACK_LOCAL_MODULE_" + this.idx + "__";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.name);
+		write(this.idx);
+		write(this.used);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.name = read();
+		this.idx = read();
+		this.used = read();
+	}
+}
+
+makeSerializable(LocalModule, "webpack/lib/dependencies/LocalModule");
+
+module.exports = LocalModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModuleDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModuleDependency.js
new file mode 100644
index 0000000..6639531
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModuleDependency.js
@@ -0,0 +1,69 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class LocalModuleDependency extends NullDependency {
+	constructor(localModule, range, callNew) {
+		super();
+
+		this.localModule = localModule;
+		this.range = range;
+		this.callNew = callNew;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.localModule);
+		write(this.range);
+		write(this.callNew);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.localModule = read();
+		this.range = read();
+		this.callNew = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	LocalModuleDependency,
+	"webpack/lib/dependencies/LocalModuleDependency"
+);
+
+LocalModuleDependency.Template = class LocalModuleDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {LocalModuleDependency} */ (dependency);
+		if (!dep.range) return;
+		const moduleInstance = dep.callNew
+			? `new (function () { return ${dep.localModule.variableName()}; })()`
+			: dep.localModule.variableName();
+		source.replace(dep.range[0], dep.range[1] - 1, moduleInstance);
+	}
+};
+
+module.exports = LocalModuleDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModulesHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModulesHelpers.js
new file mode 100644
index 0000000..bc2eb8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/LocalModulesHelpers.js
@@ -0,0 +1,50 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const LocalModule = require("./LocalModule");
+
+const lookup = (parent, mod) => {
+	if (mod.charAt(0) !== ".") return mod;
+
+	var path = parent.split("/");
+	var segments = mod.split("/");
+	path.pop();
+
+	for (let i = 0; i < segments.length; i++) {
+		const seg = segments[i];
+		if (seg === "..") {
+			path.pop();
+		} else if (seg !== ".") {
+			path.push(seg);
+		}
+	}
+
+	return path.join("/");
+};
+
+exports.addLocalModule = (state, name) => {
+	if (!state.localModules) {
+		state.localModules = [];
+	}
+	const m = new LocalModule(name, state.localModules.length);
+	state.localModules.push(m);
+	return m;
+};
+
+exports.getLocalModule = (state, name, namedModule) => {
+	if (!state.localModules) return null;
+	if (namedModule) {
+		// resolve dependency name relative to the defining named module
+		name = lookup(namedModule, name);
+	}
+	for (let i = 0; i < state.localModules.length; i++) {
+		if (state.localModules[i].name === name) {
+			return state.localModules[i];
+		}
+	}
+	return null;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDecoratorDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDecoratorDependency.js
new file mode 100644
index 0000000..0bf7fd2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDecoratorDependency.js
@@ -0,0 +1,129 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class ModuleDecoratorDependency extends NullDependency {
+	/**
+	 * @param {string} decorator the decorator requirement
+	 * @param {boolean} allowExportsAccess allow to access exports from module
+	 */
+	constructor(decorator, allowExportsAccess) {
+		super();
+		this.decorator = decorator;
+		this.allowExportsAccess = allowExportsAccess;
+		this._hashUpdate = undefined;
+	}
+
+	/**
+	 * @returns {string} a display name for the type of dependency
+	 */
+	get type() {
+		return "module decorator";
+	}
+
+	get category() {
+		return "self";
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return `self`;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return this.allowExportsAccess
+			? Dependency.EXPORTS_OBJECT_REFERENCED
+			: Dependency.NO_EXPORTS_REFERENCED;
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		if (this._hashUpdate === undefined) {
+			this._hashUpdate = `${this.decorator}${this.allowExportsAccess}`;
+		}
+		hash.update(this._hashUpdate);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.decorator);
+		write(this.allowExportsAccess);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.decorator = read();
+		this.allowExportsAccess = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	ModuleDecoratorDependency,
+	"webpack/lib/dependencies/ModuleDecoratorDependency"
+);
+
+ModuleDecoratorDependency.Template = class ModuleDecoratorDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ module, chunkGraph, initFragments, runtimeRequirements }
+	) {
+		const dep = /** @type {ModuleDecoratorDependency} */ (dependency);
+		runtimeRequirements.add(RuntimeGlobals.moduleLoaded);
+		runtimeRequirements.add(RuntimeGlobals.moduleId);
+		runtimeRequirements.add(RuntimeGlobals.module);
+		runtimeRequirements.add(dep.decorator);
+		initFragments.push(
+			new InitFragment(
+				`/* module decorator */ ${module.moduleArgument} = ${dep.decorator}(${module.moduleArgument});\n`,
+				InitFragment.STAGE_PROVIDES,
+				0,
+				`module decorator ${chunkGraph.getModuleId(module)}`
+			)
+		);
+	}
+};
+
+module.exports = ModuleDecoratorDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependency.js
new file mode 100644
index 0000000..d94e7a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependency.js
@@ -0,0 +1,81 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const DependencyTemplate = require("../DependencyTemplate");
+const memoize = require("../util/memoize");
+
+/** @typedef {import("../Dependency").TRANSITIVE} TRANSITIVE */
+/** @typedef {import("../Module")} Module */
+
+const getRawModule = memoize(() => require("../RawModule"));
+
+class ModuleDependency extends Dependency {
+	/**
+	 * @param {string} request request path which needs resolving
+	 */
+	constructor(request) {
+		super();
+		this.request = request;
+		this.userRequest = request;
+		this.range = undefined;
+		// assertions must be serialized by subclasses that use it
+		/** @type {Record<string, any> | undefined} */
+		this.assertions = undefined;
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		let str = `module${this.request}`;
+		if (this.assertions !== undefined) {
+			str += JSON.stringify(this.assertions);
+		}
+		return str;
+	}
+
+	/**
+	 * @returns {boolean | TRANSITIVE} true, when changes to the referenced module could affect the referencing module; TRANSITIVE, when changes to the referenced module could affect referencing modules of the referencing module
+	 */
+	couldAffectReferencingModule() {
+		return true;
+	}
+
+	/**
+	 * @param {string} context context directory
+	 * @returns {Module} a module
+	 */
+	createIgnoredModule(context) {
+		const RawModule = getRawModule();
+		return new RawModule(
+			"/* (ignored) */",
+			`ignored|${context}|${this.request}`,
+			`${this.request} (ignored)`
+		);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.request);
+		write(this.userRequest);
+		write(this.range);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.request = read();
+		this.userRequest = read();
+		this.range = read();
+		super.deserialize(context);
+	}
+}
+
+ModuleDependency.Template = DependencyTemplate;
+
+module.exports = ModuleDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependencyTemplateAsId.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependencyTemplateAsId.js
new file mode 100644
index 0000000..edc9afc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependencyTemplateAsId.js
@@ -0,0 +1,34 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class ModuleDependencyTemplateAsId extends ModuleDependency.Template {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeTemplate, moduleGraph, chunkGraph }) {
+		const dep = /** @type {ModuleDependency} */ (dependency);
+		if (!dep.range) return;
+		const content = runtimeTemplate.moduleId({
+			module: moduleGraph.getModule(dep),
+			chunkGraph,
+			request: dep.request,
+			weak: dep.weak
+		});
+		source.replace(dep.range[0], dep.range[1] - 1, content);
+	}
+}
+
+module.exports = ModuleDependencyTemplateAsId;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependencyTemplateAsRequireId.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependencyTemplateAsRequireId.js
new file mode 100644
index 0000000..9e05906
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleDependencyTemplateAsRequireId.js
@@ -0,0 +1,38 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class ModuleDependencyTemplateAsRequireId extends ModuleDependency.Template {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {ModuleDependency} */ (dependency);
+		if (!dep.range) return;
+		const content = runtimeTemplate.moduleExports({
+			module: moduleGraph.getModule(dep),
+			chunkGraph,
+			request: dep.request,
+			weak: dep.weak,
+			runtimeRequirements
+		});
+		source.replace(dep.range[0], dep.range[1] - 1, content);
+	}
+}
+module.exports = ModuleDependencyTemplateAsRequireId;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleHotAcceptDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleHotAcceptDependency.js
new file mode 100644
index 0000000..9ccf8a3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleHotAcceptDependency.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const ModuleDependencyTemplateAsId = require("./ModuleDependencyTemplateAsId");
+
+class ModuleHotAcceptDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+		this.range = range;
+		this.weak = true;
+	}
+
+	get type() {
+		return "module.hot.accept";
+	}
+
+	get category() {
+		return "commonjs";
+	}
+}
+
+makeSerializable(
+	ModuleHotAcceptDependency,
+	"webpack/lib/dependencies/ModuleHotAcceptDependency"
+);
+
+ModuleHotAcceptDependency.Template = ModuleDependencyTemplateAsId;
+
+module.exports = ModuleHotAcceptDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleHotDeclineDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleHotDeclineDependency.js
new file mode 100644
index 0000000..c5edb77
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ModuleHotDeclineDependency.js
@@ -0,0 +1,36 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const ModuleDependencyTemplateAsId = require("./ModuleDependencyTemplateAsId");
+
+class ModuleHotDeclineDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+
+		this.range = range;
+		this.weak = true;
+	}
+
+	get type() {
+		return "module.hot.decline";
+	}
+
+	get category() {
+		return "commonjs";
+	}
+}
+
+makeSerializable(
+	ModuleHotDeclineDependency,
+	"webpack/lib/dependencies/ModuleHotDeclineDependency"
+);
+
+ModuleHotDeclineDependency.Template = ModuleDependencyTemplateAsId;
+
+module.exports = ModuleHotDeclineDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/NullDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/NullDependency.js
new file mode 100644
index 0000000..c22cafc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/NullDependency.js
@@ -0,0 +1,40 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const DependencyTemplate = require("../DependencyTemplate");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency").TRANSITIVE} TRANSITIVE */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class NullDependency extends Dependency {
+	get type() {
+		return "null";
+	}
+
+	/**
+	 * @returns {boolean | TRANSITIVE} true, when changes to the referenced module could affect the referencing module; TRANSITIVE, when changes to the referenced module could affect referencing modules of the referencing module
+	 */
+	couldAffectReferencingModule() {
+		return false;
+	}
+}
+
+NullDependency.Template = class NullDependencyTemplate extends (
+	DependencyTemplate
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {}
+};
+
+module.exports = NullDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/PrefetchDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/PrefetchDependency.js
new file mode 100644
index 0000000..3c19dae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/PrefetchDependency.js
@@ -0,0 +1,24 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("./ModuleDependency");
+
+class PrefetchDependency extends ModuleDependency {
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "prefetch";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+module.exports = PrefetchDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ProvidedDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ProvidedDependency.js
new file mode 100644
index 0000000..0962ba7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/ProvidedDependency.js
@@ -0,0 +1,122 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const InitFragment = require("../InitFragment");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../util/Hash")} Hash */
+
+/**
+ * @param {string[]|null} path the property path array
+ * @returns {string} the converted path
+ */
+const pathToString = path =>
+	path !== null && path.length > 0
+		? path.map(part => `[${JSON.stringify(part)}]`).join("")
+		: "";
+
+class ProvidedDependency extends ModuleDependency {
+	constructor(request, identifier, path, range) {
+		super(request);
+		this.identifier = identifier;
+		this.path = path;
+		this.range = range;
+		this._hashUpdate = undefined;
+	}
+
+	get type() {
+		return "provided";
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		if (this._hashUpdate === undefined) {
+			this._hashUpdate =
+				this.identifier + (this.path ? this.path.join(",") : "null");
+		}
+		hash.update(this._hashUpdate);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.identifier);
+		write(this.path);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.identifier = read();
+		this.path = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	ProvidedDependency,
+	"webpack/lib/dependencies/ProvidedDependency"
+);
+
+class ProvidedDependencyTemplate extends ModuleDependency.Template {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{
+			runtimeTemplate,
+			moduleGraph,
+			chunkGraph,
+			initFragments,
+			runtimeRequirements
+		}
+	) {
+		const dep = /** @type {ProvidedDependency} */ (dependency);
+		initFragments.push(
+			new InitFragment(
+				`/* provided dependency */ var ${
+					dep.identifier
+				} = ${runtimeTemplate.moduleExports({
+					module: moduleGraph.getModule(dep),
+					chunkGraph,
+					request: dep.request,
+					runtimeRequirements
+				})}${pathToString(dep.path)};\n`,
+				InitFragment.STAGE_PROVIDES,
+				1,
+				`provided ${dep.identifier}`
+			)
+		);
+		source.replace(dep.range[0], dep.range[1] - 1, dep.identifier);
+	}
+}
+
+ProvidedDependency.Template = ProvidedDependencyTemplate;
+
+module.exports = ProvidedDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/PureExpressionDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/PureExpressionDependency.js
new file mode 100644
index 0000000..3ee7028
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/PureExpressionDependency.js
@@ -0,0 +1,128 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { UsageState } = require("../ExportsInfo");
+const makeSerializable = require("../util/makeSerializable");
+const { filterRuntime } = require("../util/runtime");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../util/Hash")} Hash */
+
+class PureExpressionDependency extends NullDependency {
+	/**
+	 * @param {[number, number]} range the source range
+	 */
+	constructor(range) {
+		super();
+		this.range = range;
+		/** @type {Set<string> | false} */
+		this.usedByExports = false;
+		this._hashUpdate = undefined;
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		if (this._hashUpdate === undefined) {
+			this._hashUpdate = this.range + "";
+		}
+		hash.update(this._hashUpdate);
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this dependency connects the module to referencing modules
+	 */
+	getModuleEvaluationSideEffectsState(moduleGraph) {
+		return false;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		write(this.usedByExports);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.range = read();
+		this.usedByExports = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	PureExpressionDependency,
+	"webpack/lib/dependencies/PureExpressionDependency"
+);
+
+PureExpressionDependency.Template = class PureExpressionDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ chunkGraph, moduleGraph, runtime, runtimeTemplate, runtimeRequirements }
+	) {
+		const dep = /** @type {PureExpressionDependency} */ (dependency);
+
+		const usedByExports = dep.usedByExports;
+		if (usedByExports !== false) {
+			const selfModule = moduleGraph.getParentModule(dep);
+			const exportsInfo = moduleGraph.getExportsInfo(selfModule);
+			const runtimeCondition = filterRuntime(runtime, runtime => {
+				for (const exportName of usedByExports) {
+					if (exportsInfo.getUsed(exportName, runtime) !== UsageState.Unused) {
+						return true;
+					}
+				}
+				return false;
+			});
+			if (runtimeCondition === true) return;
+			if (runtimeCondition !== false) {
+				const condition = runtimeTemplate.runtimeConditionExpression({
+					chunkGraph,
+					runtime,
+					runtimeCondition,
+					runtimeRequirements
+				});
+				source.insert(
+					dep.range[0],
+					`(/* runtime-dependent pure expression or super */ ${condition} ? (`
+				);
+				source.insert(dep.range[1], ") : null)");
+				return;
+			}
+		}
+
+		source.insert(
+			dep.range[0],
+			`(/* unused pure expression or super */ null && (`
+		);
+		source.insert(dep.range[1], "))");
+	}
+};
+
+module.exports = PureExpressionDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextDependency.js
new file mode 100644
index 0000000..21c8f06
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextDependency.js
@@ -0,0 +1,31 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ContextDependency = require("./ContextDependency");
+const ModuleDependencyTemplateAsRequireId = require("./ModuleDependencyTemplateAsRequireId");
+
+class RequireContextDependency extends ContextDependency {
+	constructor(options, range) {
+		super(options);
+
+		this.range = range;
+	}
+
+	get type() {
+		return "require.context";
+	}
+}
+
+makeSerializable(
+	RequireContextDependency,
+	"webpack/lib/dependencies/RequireContextDependency"
+);
+
+RequireContextDependency.Template = ModuleDependencyTemplateAsRequireId;
+
+module.exports = RequireContextDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextDependencyParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextDependencyParserPlugin.js
new file mode 100644
index 0000000..8504664
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextDependencyParserPlugin.js
@@ -0,0 +1,58 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RequireContextDependency = require("./RequireContextDependency");
+
+module.exports = class RequireContextDependencyParserPlugin {
+	apply(parser) {
+		parser.hooks.call
+			.for("require.context")
+			.tap("RequireContextDependencyParserPlugin", expr => {
+				let regExp = /^\.\/.*$/;
+				let recursive = true;
+				let mode = "sync";
+				switch (expr.arguments.length) {
+					case 4: {
+						const modeExpr = parser.evaluateExpression(expr.arguments[3]);
+						if (!modeExpr.isString()) return;
+						mode = modeExpr.string;
+					}
+					// falls through
+					case 3: {
+						const regExpExpr = parser.evaluateExpression(expr.arguments[2]);
+						if (!regExpExpr.isRegExp()) return;
+						regExp = regExpExpr.regExp;
+					}
+					// falls through
+					case 2: {
+						const recursiveExpr = parser.evaluateExpression(expr.arguments[1]);
+						if (!recursiveExpr.isBoolean()) return;
+						recursive = recursiveExpr.bool;
+					}
+					// falls through
+					case 1: {
+						const requestExpr = parser.evaluateExpression(expr.arguments[0]);
+						if (!requestExpr.isString()) return;
+						const dep = new RequireContextDependency(
+							{
+								request: requestExpr.string,
+								recursive,
+								regExp,
+								mode,
+								category: "commonjs"
+							},
+							expr.range
+						);
+						dep.loc = expr.loc;
+						dep.optional = !!parser.scope.inTry;
+						parser.state.current.addDependency(dep);
+						return true;
+					}
+				}
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextPlugin.js
new file mode 100644
index 0000000..d34c85e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireContextPlugin.js
@@ -0,0 +1,150 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { cachedSetProperty } = require("../util/cleverMerge");
+const ContextElementDependency = require("./ContextElementDependency");
+const RequireContextDependency = require("./RequireContextDependency");
+const RequireContextDependencyParserPlugin = require("./RequireContextDependencyParserPlugin");
+
+/** @typedef {import("../../declarations/WebpackOptions").ResolveOptions} ResolveOptions */
+/** @typedef {import("../Compiler")} Compiler */
+
+/** @type {ResolveOptions} */
+const EMPTY_RESOLVE_OPTIONS = {};
+
+class RequireContextPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"RequireContextPlugin",
+			(compilation, { contextModuleFactory, normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					RequireContextDependency,
+					contextModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					RequireContextDependency,
+					new RequireContextDependency.Template()
+				);
+
+				compilation.dependencyFactories.set(
+					ContextElementDependency,
+					normalModuleFactory
+				);
+
+				const handler = (parser, parserOptions) => {
+					if (
+						parserOptions.requireContext !== undefined &&
+						!parserOptions.requireContext
+					)
+						return;
+
+					new RequireContextDependencyParserPlugin().apply(parser);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("RequireContextPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("RequireContextPlugin", handler);
+
+				contextModuleFactory.hooks.alternativeRequests.tap(
+					"RequireContextPlugin",
+					(items, options) => {
+						if (items.length === 0) return items;
+
+						const finalResolveOptions = compiler.resolverFactory.get(
+							"normal",
+							cachedSetProperty(
+								options.resolveOptions || EMPTY_RESOLVE_OPTIONS,
+								"dependencyType",
+								options.category
+							)
+						).options;
+
+						let newItems;
+						if (!finalResolveOptions.fullySpecified) {
+							newItems = [];
+							for (const item of items) {
+								const { request, context } = item;
+								for (const ext of finalResolveOptions.extensions) {
+									if (request.endsWith(ext)) {
+										newItems.push({
+											context,
+											request: request.slice(0, -ext.length)
+										});
+									}
+								}
+								if (!finalResolveOptions.enforceExtension) {
+									newItems.push(item);
+								}
+							}
+							items = newItems;
+
+							newItems = [];
+							for (const obj of items) {
+								const { request, context } = obj;
+								for (const mainFile of finalResolveOptions.mainFiles) {
+									if (request.endsWith(`/${mainFile}`)) {
+										newItems.push({
+											context,
+											request: request.slice(0, -mainFile.length)
+										});
+										newItems.push({
+											context,
+											request: request.slice(0, -mainFile.length - 1)
+										});
+									}
+								}
+								newItems.push(obj);
+							}
+							items = newItems;
+						}
+
+						newItems = [];
+						for (const item of items) {
+							let hideOriginal = false;
+							for (const modulesItems of finalResolveOptions.modules) {
+								if (Array.isArray(modulesItems)) {
+									for (const dir of modulesItems) {
+										if (item.request.startsWith(`./${dir}/`)) {
+											newItems.push({
+												context: item.context,
+												request: item.request.slice(dir.length + 3)
+											});
+											hideOriginal = true;
+										}
+									}
+								} else {
+									const dir = modulesItems.replace(/\\/g, "/");
+									const fullPath =
+										item.context.replace(/\\/g, "/") + item.request.slice(1);
+									if (fullPath.startsWith(dir)) {
+										newItems.push({
+											context: item.context,
+											request: fullPath.slice(dir.length + 1)
+										});
+									}
+								}
+							}
+							if (!hideOriginal) {
+								newItems.push(item);
+							}
+						}
+						return newItems;
+					}
+				);
+			}
+		);
+	}
+}
+module.exports = RequireContextPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependenciesBlock.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependenciesBlock.js
new file mode 100644
index 0000000..1928dbe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependenciesBlock.js
@@ -0,0 +1,22 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const makeSerializable = require("../util/makeSerializable");
+
+class RequireEnsureDependenciesBlock extends AsyncDependenciesBlock {
+	constructor(chunkName, loc) {
+		super(chunkName, loc, null);
+	}
+}
+
+makeSerializable(
+	RequireEnsureDependenciesBlock,
+	"webpack/lib/dependencies/RequireEnsureDependenciesBlock"
+);
+
+module.exports = RequireEnsureDependenciesBlock;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependenciesBlockParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependenciesBlockParserPlugin.js
new file mode 100644
index 0000000..f9e78e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependenciesBlockParserPlugin.js
@@ -0,0 +1,121 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RequireEnsureDependenciesBlock = require("./RequireEnsureDependenciesBlock");
+const RequireEnsureDependency = require("./RequireEnsureDependency");
+const RequireEnsureItemDependency = require("./RequireEnsureItemDependency");
+const getFunctionExpression = require("./getFunctionExpression");
+
+module.exports = class RequireEnsureDependenciesBlockParserPlugin {
+	apply(parser) {
+		parser.hooks.call
+			.for("require.ensure")
+			.tap("RequireEnsureDependenciesBlockParserPlugin", expr => {
+				let chunkName = null;
+				let errorExpressionArg = null;
+				let errorExpression = null;
+				switch (expr.arguments.length) {
+					case 4: {
+						const chunkNameExpr = parser.evaluateExpression(expr.arguments[3]);
+						if (!chunkNameExpr.isString()) return;
+						chunkName = chunkNameExpr.string;
+					}
+					// falls through
+					case 3: {
+						errorExpressionArg = expr.arguments[2];
+						errorExpression = getFunctionExpression(errorExpressionArg);
+
+						if (!errorExpression && !chunkName) {
+							const chunkNameExpr = parser.evaluateExpression(
+								expr.arguments[2]
+							);
+							if (!chunkNameExpr.isString()) return;
+							chunkName = chunkNameExpr.string;
+						}
+					}
+					// falls through
+					case 2: {
+						const dependenciesExpr = parser.evaluateExpression(
+							expr.arguments[0]
+						);
+						const dependenciesItems = dependenciesExpr.isArray()
+							? dependenciesExpr.items
+							: [dependenciesExpr];
+						const successExpressionArg = expr.arguments[1];
+						const successExpression =
+							getFunctionExpression(successExpressionArg);
+
+						if (successExpression) {
+							parser.walkExpressions(successExpression.expressions);
+						}
+						if (errorExpression) {
+							parser.walkExpressions(errorExpression.expressions);
+						}
+
+						const depBlock = new RequireEnsureDependenciesBlock(
+							chunkName,
+							expr.loc
+						);
+						const errorCallbackExists =
+							expr.arguments.length === 4 ||
+							(!chunkName && expr.arguments.length === 3);
+						const dep = new RequireEnsureDependency(
+							expr.range,
+							expr.arguments[1].range,
+							errorCallbackExists && expr.arguments[2].range
+						);
+						dep.loc = expr.loc;
+						depBlock.addDependency(dep);
+						const old = parser.state.current;
+						parser.state.current = depBlock;
+						try {
+							let failed = false;
+							parser.inScope([], () => {
+								for (const ee of dependenciesItems) {
+									if (ee.isString()) {
+										const ensureDependency = new RequireEnsureItemDependency(
+											ee.string
+										);
+										ensureDependency.loc = ee.loc || expr.loc;
+										depBlock.addDependency(ensureDependency);
+									} else {
+										failed = true;
+									}
+								}
+							});
+							if (failed) {
+								return;
+							}
+							if (successExpression) {
+								if (successExpression.fn.body.type === "BlockStatement") {
+									parser.walkStatement(successExpression.fn.body);
+								} else {
+									parser.walkExpression(successExpression.fn.body);
+								}
+							}
+							old.addBlock(depBlock);
+						} finally {
+							parser.state.current = old;
+						}
+						if (!successExpression) {
+							parser.walkExpression(successExpressionArg);
+						}
+						if (errorExpression) {
+							if (errorExpression.fn.body.type === "BlockStatement") {
+								parser.walkStatement(errorExpression.fn.body);
+							} else {
+								parser.walkExpression(errorExpression.fn.body);
+							}
+						} else if (errorExpressionArg) {
+							parser.walkExpression(errorExpressionArg);
+						}
+						return true;
+					}
+				}
+			});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependency.js
new file mode 100644
index 0000000..ab6347e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureDependency.js
@@ -0,0 +1,101 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class RequireEnsureDependency extends NullDependency {
+	constructor(range, contentRange, errorHandlerRange) {
+		super();
+
+		this.range = range;
+		this.contentRange = contentRange;
+		this.errorHandlerRange = errorHandlerRange;
+	}
+
+	get type() {
+		return "require.ensure";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.range);
+		write(this.contentRange);
+		write(this.errorHandlerRange);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.range = read();
+		this.contentRange = read();
+		this.errorHandlerRange = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	RequireEnsureDependency,
+	"webpack/lib/dependencies/RequireEnsureDependency"
+);
+
+RequireEnsureDependency.Template = class RequireEnsureDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(
+		dependency,
+		source,
+		{ runtimeTemplate, moduleGraph, chunkGraph, runtimeRequirements }
+	) {
+		const dep = /** @type {RequireEnsureDependency} */ (dependency);
+		const depBlock = /** @type {AsyncDependenciesBlock} */ (
+			moduleGraph.getParentBlock(dep)
+		);
+		const promise = runtimeTemplate.blockPromise({
+			chunkGraph,
+			block: depBlock,
+			message: "require.ensure",
+			runtimeRequirements
+		});
+		const range = dep.range;
+		const contentRange = dep.contentRange;
+		const errorHandlerRange = dep.errorHandlerRange;
+		source.replace(range[0], contentRange[0] - 1, `${promise}.then((`);
+		if (errorHandlerRange) {
+			source.replace(
+				contentRange[1],
+				errorHandlerRange[0] - 1,
+				").bind(null, __webpack_require__))['catch']("
+			);
+			source.replace(errorHandlerRange[1], range[1] - 1, ")");
+		} else {
+			source.replace(
+				contentRange[1],
+				range[1] - 1,
+				`).bind(null, __webpack_require__))['catch'](${RuntimeGlobals.uncaughtErrorHandler})`
+			);
+		}
+	}
+};
+
+module.exports = RequireEnsureDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureItemDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureItemDependency.js
new file mode 100644
index 0000000..70d2df1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsureItemDependency.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const NullDependency = require("./NullDependency");
+
+class RequireEnsureItemDependency extends ModuleDependency {
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "require.ensure item";
+	}
+
+	get category() {
+		return "commonjs";
+	}
+}
+
+makeSerializable(
+	RequireEnsureItemDependency,
+	"webpack/lib/dependencies/RequireEnsureItemDependency"
+);
+
+RequireEnsureItemDependency.Template = NullDependency.Template;
+
+module.exports = RequireEnsureItemDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsurePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsurePlugin.js
new file mode 100644
index 0000000..e2aa157
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireEnsurePlugin.js
@@ -0,0 +1,66 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RequireEnsureDependency = require("./RequireEnsureDependency");
+const RequireEnsureItemDependency = require("./RequireEnsureItemDependency");
+
+const RequireEnsureDependenciesBlockParserPlugin = require("./RequireEnsureDependenciesBlockParserPlugin");
+
+const {
+	evaluateToString,
+	toConstantDependency
+} = require("../javascript/JavascriptParserHelpers");
+
+class RequireEnsurePlugin {
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"RequireEnsurePlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					RequireEnsureItemDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					RequireEnsureItemDependency,
+					new RequireEnsureItemDependency.Template()
+				);
+
+				compilation.dependencyTemplates.set(
+					RequireEnsureDependency,
+					new RequireEnsureDependency.Template()
+				);
+
+				const handler = (parser, parserOptions) => {
+					if (
+						parserOptions.requireEnsure !== undefined &&
+						!parserOptions.requireEnsure
+					)
+						return;
+
+					new RequireEnsureDependenciesBlockParserPlugin().apply(parser);
+					parser.hooks.evaluateTypeof
+						.for("require.ensure")
+						.tap("RequireEnsurePlugin", evaluateToString("function"));
+					parser.hooks.typeof
+						.for("require.ensure")
+						.tap(
+							"RequireEnsurePlugin",
+							toConstantDependency(parser, JSON.stringify("function"))
+						);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("RequireEnsurePlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("RequireEnsurePlugin", handler);
+			}
+		);
+	}
+}
+module.exports = RequireEnsurePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireHeaderDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireHeaderDependency.js
new file mode 100644
index 0000000..db76b5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireHeaderDependency.js
@@ -0,0 +1,57 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class RequireHeaderDependency extends NullDependency {
+	constructor(range) {
+		super();
+		if (!Array.isArray(range)) throw new Error("range must be valid");
+		this.range = range;
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.range);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const obj = new RequireHeaderDependency(context.read());
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(
+	RequireHeaderDependency,
+	"webpack/lib/dependencies/RequireHeaderDependency"
+);
+
+RequireHeaderDependency.Template = class RequireHeaderDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeRequirements }) {
+		const dep = /** @type {RequireHeaderDependency} */ (dependency);
+		runtimeRequirements.add(RuntimeGlobals.require);
+		source.replace(dep.range[0], dep.range[1] - 1, "__webpack_require__");
+	}
+};
+
+module.exports = RequireHeaderDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludeDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludeDependency.js
new file mode 100644
index 0000000..35c0f45
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludeDependency.js
@@ -0,0 +1,74 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const Template = require("../Template");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class RequireIncludeDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+
+		this.range = range;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		// This doesn't use any export
+		return Dependency.NO_EXPORTS_REFERENCED;
+	}
+
+	get type() {
+		return "require.include";
+	}
+
+	get category() {
+		return "commonjs";
+	}
+}
+
+makeSerializable(
+	RequireIncludeDependency,
+	"webpack/lib/dependencies/RequireIncludeDependency"
+);
+
+RequireIncludeDependency.Template = class RequireIncludeDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeTemplate }) {
+		const dep = /** @type {RequireIncludeDependency} */ (dependency);
+		const comment = runtimeTemplate.outputOptions.pathinfo
+			? Template.toComment(
+					`require.include ${runtimeTemplate.requestShortener.shorten(
+						dep.request
+					)}`
+			  )
+			: "";
+
+		source.replace(dep.range[0], dep.range[1] - 1, `undefined${comment}`);
+	}
+};
+
+module.exports = RequireIncludeDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludeDependencyParserPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludeDependencyParserPlugin.js
new file mode 100644
index 0000000..d74db99
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludeDependencyParserPlugin.js
@@ -0,0 +1,77 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+const {
+	evaluateToString,
+	toConstantDependency
+} = require("../javascript/JavascriptParserHelpers");
+const makeSerializable = require("../util/makeSerializable");
+const RequireIncludeDependency = require("./RequireIncludeDependency");
+
+module.exports = class RequireIncludeDependencyParserPlugin {
+	constructor(warn) {
+		this.warn = warn;
+	}
+	apply(parser) {
+		const { warn } = this;
+		parser.hooks.call
+			.for("require.include")
+			.tap("RequireIncludeDependencyParserPlugin", expr => {
+				if (expr.arguments.length !== 1) return;
+				const param = parser.evaluateExpression(expr.arguments[0]);
+				if (!param.isString()) return;
+
+				if (warn) {
+					parser.state.module.addWarning(
+						new RequireIncludeDeprecationWarning(expr.loc)
+					);
+				}
+
+				const dep = new RequireIncludeDependency(param.string, expr.range);
+				dep.loc = expr.loc;
+				parser.state.current.addDependency(dep);
+				return true;
+			});
+		parser.hooks.evaluateTypeof
+			.for("require.include")
+			.tap("RequireIncludePlugin", expr => {
+				if (warn) {
+					parser.state.module.addWarning(
+						new RequireIncludeDeprecationWarning(expr.loc)
+					);
+				}
+				return evaluateToString("function")(expr);
+			});
+		parser.hooks.typeof
+			.for("require.include")
+			.tap("RequireIncludePlugin", expr => {
+				if (warn) {
+					parser.state.module.addWarning(
+						new RequireIncludeDeprecationWarning(expr.loc)
+					);
+				}
+				return toConstantDependency(parser, JSON.stringify("function"))(expr);
+			});
+	}
+};
+
+class RequireIncludeDeprecationWarning extends WebpackError {
+	constructor(loc) {
+		super("require.include() is deprecated and will be removed soon.");
+
+		this.name = "RequireIncludeDeprecationWarning";
+
+		this.loc = loc;
+	}
+}
+
+makeSerializable(
+	RequireIncludeDeprecationWarning,
+	"webpack/lib/dependencies/RequireIncludeDependencyParserPlugin",
+	"RequireIncludeDeprecationWarning"
+);
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludePlugin.js
new file mode 100644
index 0000000..0dbc434
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireIncludePlugin.js
@@ -0,0 +1,42 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RequireIncludeDependency = require("./RequireIncludeDependency");
+const RequireIncludeDependencyParserPlugin = require("./RequireIncludeDependencyParserPlugin");
+
+class RequireIncludePlugin {
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"RequireIncludePlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					RequireIncludeDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					RequireIncludeDependency,
+					new RequireIncludeDependency.Template()
+				);
+
+				const handler = (parser, parserOptions) => {
+					if (parserOptions.requireInclude === false) return;
+					const warn = parserOptions.requireInclude === undefined;
+
+					new RequireIncludeDependencyParserPlugin(warn).apply(parser);
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("RequireIncludePlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("RequireIncludePlugin", handler);
+			}
+		);
+	}
+}
+module.exports = RequireIncludePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveContextDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveContextDependency.js
new file mode 100644
index 0000000..4e998ec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveContextDependency.js
@@ -0,0 +1,50 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const ContextDependency = require("./ContextDependency");
+const ContextDependencyTemplateAsId = require("./ContextDependencyTemplateAsId");
+
+class RequireResolveContextDependency extends ContextDependency {
+	constructor(options, range, valueRange) {
+		super(options);
+
+		this.range = range;
+		this.valueRange = valueRange;
+	}
+
+	get type() {
+		return "amd require context";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.range);
+		write(this.valueRange);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.range = read();
+		this.valueRange = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	RequireResolveContextDependency,
+	"webpack/lib/dependencies/RequireResolveContextDependency"
+);
+
+RequireResolveContextDependency.Template = ContextDependencyTemplateAsId;
+
+module.exports = RequireResolveContextDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveDependency.js
new file mode 100644
index 0000000..8d6ade3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveDependency.js
@@ -0,0 +1,51 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+const ModuleDependencyAsId = require("./ModuleDependencyTemplateAsId");
+
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class RequireResolveDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+
+		this.range = range;
+	}
+
+	get type() {
+		return "require.resolve";
+	}
+
+	get category() {
+		return "commonjs";
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		// This doesn't use any export
+		return Dependency.NO_EXPORTS_REFERENCED;
+	}
+}
+
+makeSerializable(
+	RequireResolveDependency,
+	"webpack/lib/dependencies/RequireResolveDependency"
+);
+
+RequireResolveDependency.Template = ModuleDependencyAsId;
+
+module.exports = RequireResolveDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveHeaderDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveHeaderDependency.js
new file mode 100644
index 0000000..bc4e177
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RequireResolveHeaderDependency.js
@@ -0,0 +1,63 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class RequireResolveHeaderDependency extends NullDependency {
+	constructor(range) {
+		super();
+
+		if (!Array.isArray(range)) throw new Error("range must be valid");
+
+		this.range = range;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.range);
+
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const obj = new RequireResolveHeaderDependency(context.read());
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(
+	RequireResolveHeaderDependency,
+	"webpack/lib/dependencies/RequireResolveHeaderDependency"
+);
+
+RequireResolveHeaderDependency.Template = class RequireResolveHeaderDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const dep = /** @type {RequireResolveHeaderDependency} */ (dependency);
+		source.replace(dep.range[0], dep.range[1] - 1, "/*require.resolve*/");
+	}
+
+	applyAsTemplateArgument(name, dep, source) {
+		source.replace(dep.range[0], dep.range[1] - 1, "/*require.resolve*/");
+	}
+};
+
+module.exports = RequireResolveHeaderDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RuntimeRequirementsDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RuntimeRequirementsDependency.js
new file mode 100644
index 0000000..a64248e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/RuntimeRequirementsDependency.js
@@ -0,0 +1,77 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/Hash")} Hash */
+
+class RuntimeRequirementsDependency extends NullDependency {
+	/**
+	 * @param {string[]} runtimeRequirements runtime requirements
+	 */
+	constructor(runtimeRequirements) {
+		super();
+		this.runtimeRequirements = new Set(runtimeRequirements);
+		this._hashUpdate = undefined;
+	}
+
+	/**
+	 * Update the hash
+	 * @param {Hash} hash hash to be updated
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		if (this._hashUpdate === undefined) {
+			this._hashUpdate = Array.from(this.runtimeRequirements).join() + "";
+		}
+		hash.update(this._hashUpdate);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.runtimeRequirements);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.runtimeRequirements = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	RuntimeRequirementsDependency,
+	"webpack/lib/dependencies/RuntimeRequirementsDependency"
+);
+
+RuntimeRequirementsDependency.Template = class RuntimeRequirementsDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeRequirements }) {
+		const dep = /** @type {RuntimeRequirementsDependency} */ (dependency);
+		for (const req of dep.runtimeRequirements) {
+			runtimeRequirements.add(req);
+		}
+	}
+};
+
+module.exports = RuntimeRequirementsDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/StaticExportsDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/StaticExportsDependency.js
new file mode 100644
index 0000000..d58e328
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/StaticExportsDependency.js
@@ -0,0 +1,66 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency").ExportSpec} ExportSpec */
+/** @typedef {import("../Dependency").ExportsSpec} ExportsSpec */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/Hash")} Hash */
+
+class StaticExportsDependency extends NullDependency {
+	/**
+	 * @param {string[] | true} exports export names
+	 * @param {boolean} canMangle true, if mangling exports names is allowed
+	 */
+	constructor(exports, canMangle) {
+		super();
+		this.exports = exports;
+		this.canMangle = canMangle;
+	}
+
+	get type() {
+		return "static exports";
+	}
+
+	/**
+	 * Returns the exported names
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {ExportsSpec | undefined} export names
+	 */
+	getExports(moduleGraph) {
+		return {
+			exports: this.exports,
+			canMangle: this.canMangle,
+			dependencies: undefined
+		};
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.exports);
+		write(this.canMangle);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.exports = read();
+		this.canMangle = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	StaticExportsDependency,
+	"webpack/lib/dependencies/StaticExportsDependency"
+);
+
+module.exports = StaticExportsDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/SystemPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/SystemPlugin.js
new file mode 100644
index 0000000..4b5648c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/SystemPlugin.js
@@ -0,0 +1,140 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const WebpackError = require("../WebpackError");
+const {
+	evaluateToString,
+	expressionIsUnsupported,
+	toConstantDependency
+} = require("../javascript/JavascriptParserHelpers");
+const makeSerializable = require("../util/makeSerializable");
+const ConstDependency = require("./ConstDependency");
+const SystemRuntimeModule = require("./SystemRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class SystemPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"SystemPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.hooks.runtimeRequirementInModule
+					.for(RuntimeGlobals.system)
+					.tap("SystemPlugin", (module, set) => {
+						set.add(RuntimeGlobals.requireScope);
+					});
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.system)
+					.tap("SystemPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(chunk, new SystemRuntimeModule());
+					});
+
+				const handler = (parser, parserOptions) => {
+					if (parserOptions.system === undefined || !parserOptions.system) {
+						return;
+					}
+
+					const setNotSupported = name => {
+						parser.hooks.evaluateTypeof
+							.for(name)
+							.tap("SystemPlugin", evaluateToString("undefined"));
+						parser.hooks.expression
+							.for(name)
+							.tap(
+								"SystemPlugin",
+								expressionIsUnsupported(
+									parser,
+									name + " is not supported by webpack."
+								)
+							);
+					};
+
+					parser.hooks.typeof
+						.for("System.import")
+						.tap(
+							"SystemPlugin",
+							toConstantDependency(parser, JSON.stringify("function"))
+						);
+					parser.hooks.evaluateTypeof
+						.for("System.import")
+						.tap("SystemPlugin", evaluateToString("function"));
+					parser.hooks.typeof
+						.for("System")
+						.tap(
+							"SystemPlugin",
+							toConstantDependency(parser, JSON.stringify("object"))
+						);
+					parser.hooks.evaluateTypeof
+						.for("System")
+						.tap("SystemPlugin", evaluateToString("object"));
+
+					setNotSupported("System.set");
+					setNotSupported("System.get");
+					setNotSupported("System.register");
+
+					parser.hooks.expression.for("System").tap("SystemPlugin", expr => {
+						const dep = new ConstDependency(RuntimeGlobals.system, expr.range, [
+							RuntimeGlobals.system
+						]);
+						dep.loc = expr.loc;
+						parser.state.module.addPresentationalDependency(dep);
+						return true;
+					});
+
+					parser.hooks.call.for("System.import").tap("SystemPlugin", expr => {
+						parser.state.module.addWarning(
+							new SystemImportDeprecationWarning(expr.loc)
+						);
+
+						return parser.hooks.importCall.call({
+							type: "ImportExpression",
+							source: expr.arguments[0],
+							loc: expr.loc,
+							range: expr.range
+						});
+					});
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("SystemPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/dynamic")
+					.tap("SystemPlugin", handler);
+			}
+		);
+	}
+}
+
+class SystemImportDeprecationWarning extends WebpackError {
+	constructor(loc) {
+		super(
+			"System.import() is deprecated and will be removed soon. Use import() instead.\n" +
+				"For more info visit https://webpack.js.org/guides/code-splitting/"
+		);
+
+		this.name = "SystemImportDeprecationWarning";
+
+		this.loc = loc;
+	}
+}
+
+makeSerializable(
+	SystemImportDeprecationWarning,
+	"webpack/lib/dependencies/SystemPlugin",
+	"SystemImportDeprecationWarning"
+);
+
+module.exports = SystemPlugin;
+module.exports.SystemImportDeprecationWarning = SystemImportDeprecationWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/SystemRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/SystemRuntimeModule.js
new file mode 100644
index 0000000..c61f0fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/SystemRuntimeModule.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class SystemRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("system");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return Template.asString([
+			`${RuntimeGlobals.system} = {`,
+			Template.indent([
+				"import: function () {",
+				Template.indent(
+					"throw new Error('System.import cannot be used indirectly');"
+				),
+				"}"
+			]),
+			"};"
+		]);
+	}
+}
+
+module.exports = SystemRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/URLDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/URLDependency.js
new file mode 100644
index 0000000..a00c526
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/URLDependency.js
@@ -0,0 +1,158 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const {
+	getDependencyUsedByExportsCondition
+} = require("../optimize/InnerGraph");
+const makeSerializable = require("../util/makeSerializable");
+const memoize = require("../util/memoize");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+const getRawDataUrlModule = memoize(() => require("../asset/RawDataUrlModule"));
+
+class URLDependency extends ModuleDependency {
+	/**
+	 * @param {string} request request
+	 * @param {[number, number]} range range of the arguments of new URL( |> ... <| )
+	 * @param {[number, number]} outerRange range of the full |> new URL(...) <|
+	 * @param {boolean=} relative use relative urls instead of absolute with base uri
+	 */
+	constructor(request, range, outerRange, relative) {
+		super(request);
+		this.range = range;
+		this.outerRange = outerRange;
+		this.relative = relative || false;
+		/** @type {Set<string> | boolean} */
+		this.usedByExports = undefined;
+	}
+
+	get type() {
+		return "new URL()";
+	}
+
+	get category() {
+		return "url";
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {null | false | function(ModuleGraphConnection, RuntimeSpec): ConnectionState} function to determine if the connection is active
+	 */
+	getCondition(moduleGraph) {
+		return getDependencyUsedByExportsCondition(
+			this,
+			this.usedByExports,
+			moduleGraph
+		);
+	}
+
+	/**
+	 * @param {string} context context directory
+	 * @returns {Module} a module
+	 */
+	createIgnoredModule(context) {
+		const RawDataUrlModule = getRawDataUrlModule();
+		return new RawDataUrlModule("data:,", `ignored-asset`, `(ignored asset)`);
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.outerRange);
+		write(this.relative);
+		write(this.usedByExports);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.outerRange = read();
+		this.relative = read();
+		this.usedByExports = read();
+		super.deserialize(context);
+	}
+}
+
+URLDependency.Template = class URLDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const {
+			chunkGraph,
+			moduleGraph,
+			runtimeRequirements,
+			runtimeTemplate,
+			runtime
+		} = templateContext;
+		const dep = /** @type {URLDependency} */ (dependency);
+		const connection = moduleGraph.getConnection(dep);
+		// Skip rendering depending when dependency is conditional
+		if (connection && !connection.isTargetActive(runtime)) {
+			source.replace(
+				dep.outerRange[0],
+				dep.outerRange[1] - 1,
+				"/* unused asset import */ undefined"
+			);
+			return;
+		}
+
+		runtimeRequirements.add(RuntimeGlobals.require);
+
+		if (dep.relative) {
+			runtimeRequirements.add(RuntimeGlobals.relativeUrl);
+			source.replace(
+				dep.outerRange[0],
+				dep.outerRange[1] - 1,
+				`/* asset import */ new ${
+					RuntimeGlobals.relativeUrl
+				}(${runtimeTemplate.moduleRaw({
+					chunkGraph,
+					module: moduleGraph.getModule(dep),
+					request: dep.request,
+					runtimeRequirements,
+					weak: false
+				})})`
+			);
+		} else {
+			runtimeRequirements.add(RuntimeGlobals.baseURI);
+
+			source.replace(
+				dep.range[0],
+				dep.range[1] - 1,
+				`/* asset import */ ${runtimeTemplate.moduleRaw({
+					chunkGraph,
+					module: moduleGraph.getModule(dep),
+					request: dep.request,
+					runtimeRequirements,
+					weak: false
+				})}, ${RuntimeGlobals.baseURI}`
+			);
+		}
+	}
+};
+
+makeSerializable(URLDependency, "webpack/lib/dependencies/URLDependency");
+
+module.exports = URLDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/URLPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/URLPlugin.js
new file mode 100644
index 0000000..fc0b15c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/URLPlugin.js
@@ -0,0 +1,114 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const { approve } = require("../javascript/JavascriptParserHelpers");
+const InnerGraph = require("../optimize/InnerGraph");
+const URLDependency = require("./URLDependency");
+
+/** @typedef {import("estree").NewExpression} NewExpressionNode */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+
+class URLPlugin {
+	/**
+	 * @param {Compiler} compiler compiler
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"URLPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(URLDependency, normalModuleFactory);
+				compilation.dependencyTemplates.set(
+					URLDependency,
+					new URLDependency.Template()
+				);
+
+				/**
+				 * @param {JavascriptParser} parser parser
+				 * @param {object} parserOptions options
+				 */
+				const parserCallback = (parser, parserOptions) => {
+					if (parserOptions.url === false) return;
+					const relative = parserOptions.url === "relative";
+
+					/**
+					 * @param {NewExpressionNode} expr expression
+					 * @returns {undefined | string} request
+					 */
+					const getUrlRequest = expr => {
+						if (expr.arguments.length !== 2) return;
+
+						const [arg1, arg2] = expr.arguments;
+
+						if (
+							arg2.type !== "MemberExpression" ||
+							arg1.type === "SpreadElement"
+						)
+							return;
+
+						const chain = parser.extractMemberExpressionChain(arg2);
+
+						if (
+							chain.members.length !== 1 ||
+							chain.object.type !== "MetaProperty" ||
+							chain.object.meta.name !== "import" ||
+							chain.object.property.name !== "meta" ||
+							chain.members[0] !== "url"
+						)
+							return;
+
+						const request = parser.evaluateExpression(arg1).asString();
+
+						return request;
+					};
+
+					parser.hooks.canRename.for("URL").tap("URLPlugin", approve);
+					parser.hooks.new.for("URL").tap("URLPlugin", _expr => {
+						const expr = /** @type {NewExpressionNode} */ (_expr);
+
+						const request = getUrlRequest(expr);
+
+						if (!request) return;
+
+						const [arg1, arg2] = expr.arguments;
+						const dep = new URLDependency(
+							request,
+							[arg1.range[0], arg2.range[1]],
+							expr.range,
+							relative
+						);
+						dep.loc = expr.loc;
+						parser.state.current.addDependency(dep);
+						InnerGraph.onUsage(parser.state, e => (dep.usedByExports = e));
+						return true;
+					});
+					parser.hooks.isPure.for("NewExpression").tap("URLPlugin", _expr => {
+						const expr = /** @type {NewExpressionNode} */ (_expr);
+						const { callee } = expr;
+						if (callee.type !== "Identifier") return;
+						const calleeInfo = parser.getFreeInfoFromVariable(callee.name);
+						if (!calleeInfo || calleeInfo.name !== "URL") return;
+
+						const request = getUrlRequest(expr);
+
+						if (request) return true;
+					});
+				};
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("URLPlugin", parserCallback);
+
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("URLPlugin", parserCallback);
+			}
+		);
+	}
+}
+
+module.exports = URLPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/UnsupportedDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/UnsupportedDependency.js
new file mode 100644
index 0000000..b8624b8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/UnsupportedDependency.js
@@ -0,0 +1,69 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const NullDependency = require("./NullDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+
+class UnsupportedDependency extends NullDependency {
+	constructor(request, range) {
+		super();
+
+		this.request = request;
+		this.range = range;
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.request);
+		write(this.range);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.request = read();
+		this.range = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	UnsupportedDependency,
+	"webpack/lib/dependencies/UnsupportedDependency"
+);
+
+UnsupportedDependency.Template = class UnsupportedDependencyTemplate extends (
+	NullDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeTemplate }) {
+		const dep = /** @type {UnsupportedDependency} */ (dependency);
+
+		source.replace(
+			dep.range[0],
+			dep.range[1],
+			runtimeTemplate.missingModule({
+				request: dep.request
+			})
+		);
+	}
+};
+
+module.exports = UnsupportedDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebAssemblyExportImportedDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebAssemblyExportImportedDependency.js
new file mode 100644
index 0000000..ec3f3af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebAssemblyExportImportedDependency.js
@@ -0,0 +1,79 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../Dependency").TRANSITIVE} TRANSITIVE */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class WebAssemblyExportImportedDependency extends ModuleDependency {
+	constructor(exportName, request, name, valueType) {
+		super(request);
+		/** @type {string} */
+		this.exportName = exportName;
+		/** @type {string} */
+		this.name = name;
+		/** @type {string} */
+		this.valueType = valueType;
+	}
+
+	/**
+	 * @returns {boolean | TRANSITIVE} true, when changes to the referenced module could affect the referencing module; TRANSITIVE, when changes to the referenced module could affect referencing modules of the referencing module
+	 */
+	couldAffectReferencingModule() {
+		return Dependency.TRANSITIVE;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return [[this.name]];
+	}
+
+	get type() {
+		return "wasm export import";
+	}
+
+	get category() {
+		return "wasm";
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.exportName);
+		write(this.name);
+		write(this.valueType);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.exportName = read();
+		this.name = read();
+		this.valueType = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	WebAssemblyExportImportedDependency,
+	"webpack/lib/dependencies/WebAssemblyExportImportedDependency"
+);
+
+module.exports = WebAssemblyExportImportedDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebAssemblyImportDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebAssemblyImportDependency.js
new file mode 100644
index 0000000..52c2328
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebAssemblyImportDependency.js
@@ -0,0 +1,100 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("../util/makeSerializable");
+const UnsupportedWebAssemblyFeatureError = require("../wasm-sync/UnsupportedWebAssemblyFeatureError");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("@webassemblyjs/ast").ModuleImportDescription} ModuleImportDescription */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class WebAssemblyImportDependency extends ModuleDependency {
+	/**
+	 * @param {string} request the request
+	 * @param {string} name the imported name
+	 * @param {ModuleImportDescription} description the WASM ast node
+	 * @param {false | string} onlyDirectImport if only direct imports are allowed
+	 */
+	constructor(request, name, description, onlyDirectImport) {
+		super(request);
+		/** @type {string} */
+		this.name = name;
+		/** @type {ModuleImportDescription} */
+		this.description = description;
+		/** @type {false | string} */
+		this.onlyDirectImport = onlyDirectImport;
+	}
+
+	get type() {
+		return "wasm import";
+	}
+
+	get category() {
+		return "wasm";
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return [[this.name]];
+	}
+
+	/**
+	 * Returns errors
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @returns {WebpackError[]} errors
+	 */
+	getErrors(moduleGraph) {
+		const module = moduleGraph.getModule(this);
+
+		if (
+			this.onlyDirectImport &&
+			module &&
+			!module.type.startsWith("webassembly")
+		) {
+			return [
+				new UnsupportedWebAssemblyFeatureError(
+					`Import "${this.name}" from "${this.request}" with ${this.onlyDirectImport} can only be used for direct wasm to wasm dependencies`
+				)
+			];
+		}
+	}
+
+	serialize(context) {
+		const { write } = context;
+
+		write(this.name);
+		write(this.description);
+		write(this.onlyDirectImport);
+
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+
+		this.name = read();
+		this.description = read();
+		this.onlyDirectImport = read();
+
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	WebAssemblyImportDependency,
+	"webpack/lib/dependencies/WebAssemblyImportDependency"
+);
+
+module.exports = WebAssemblyImportDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebpackIsIncludedDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebpackIsIncludedDependency.js
new file mode 100644
index 0000000..f3406eb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WebpackIsIncludedDependency.js
@@ -0,0 +1,80 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const Template = require("../Template");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class WebpackIsIncludedDependency extends ModuleDependency {
+	constructor(request, range) {
+		super(request);
+
+		this.weak = true;
+		this.range = range;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		// This doesn't use any export
+		return Dependency.NO_EXPORTS_REFERENCED;
+	}
+
+	get type() {
+		return "__webpack_is_included__";
+	}
+}
+
+makeSerializable(
+	WebpackIsIncludedDependency,
+	"webpack/lib/dependencies/WebpackIsIncludedDependency"
+);
+
+WebpackIsIncludedDependency.Template = class WebpackIsIncludedDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, { runtimeTemplate, chunkGraph, moduleGraph }) {
+		const dep = /** @type {WebpackIsIncludedDependency} */ (dependency);
+		const connection = moduleGraph.getConnection(dep);
+		const included = connection
+			? chunkGraph.getNumberOfModuleChunks(connection.module) > 0
+			: false;
+		const comment = runtimeTemplate.outputOptions.pathinfo
+			? Template.toComment(
+					`__webpack_is_included__ ${runtimeTemplate.requestShortener.shorten(
+						dep.request
+					)}`
+			  )
+			: "";
+
+		source.replace(
+			dep.range[0],
+			dep.range[1] - 1,
+			`${comment}${JSON.stringify(included)}`
+		);
+	}
+};
+
+module.exports = WebpackIsIncludedDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WorkerDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WorkerDependency.js
new file mode 100644
index 0000000..6832355
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WorkerDependency.js
@@ -0,0 +1,89 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const ModuleDependency = require("./ModuleDependency");
+
+/** @typedef {import("webpack-sources").ReplaceSource} ReplaceSource */
+/** @typedef {import("../AsyncDependenciesBlock")} AsyncDependenciesBlock */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Dependency").ReferencedExport} ReferencedExport */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../Entrypoint")} Entrypoint */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+class WorkerDependency extends ModuleDependency {
+	/**
+	 * @param {string} request request
+	 * @param {[number, number]} range range
+	 */
+	constructor(request, range) {
+		super(request);
+		this.range = range;
+	}
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 * @param {ModuleGraph} moduleGraph module graph
+	 * @param {RuntimeSpec} runtime the runtime for which the module is analysed
+	 * @returns {(string[] | ReferencedExport)[]} referenced exports
+	 */
+	getReferencedExports(moduleGraph, runtime) {
+		return Dependency.NO_EXPORTS_REFERENCED;
+	}
+
+	get type() {
+		return "new Worker()";
+	}
+
+	get category() {
+		return "worker";
+	}
+}
+
+WorkerDependency.Template = class WorkerDependencyTemplate extends (
+	ModuleDependency.Template
+) {
+	/**
+	 * @param {Dependency} dependency the dependency for which the template should be applied
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {DependencyTemplateContext} templateContext the context object
+	 * @returns {void}
+	 */
+	apply(dependency, source, templateContext) {
+		const { chunkGraph, moduleGraph, runtimeRequirements } = templateContext;
+		const dep = /** @type {WorkerDependency} */ (dependency);
+		const block = /** @type {AsyncDependenciesBlock} */ (
+			moduleGraph.getParentBlock(dependency)
+		);
+		const entrypoint = /** @type {Entrypoint} */ (
+			chunkGraph.getBlockChunkGroup(block)
+		);
+		const chunk = entrypoint.getEntrypointChunk();
+
+		runtimeRequirements.add(RuntimeGlobals.publicPath);
+		runtimeRequirements.add(RuntimeGlobals.baseURI);
+		runtimeRequirements.add(RuntimeGlobals.getChunkScriptFilename);
+
+		source.replace(
+			dep.range[0],
+			dep.range[1] - 1,
+			`/* worker import */ ${RuntimeGlobals.publicPath} + ${
+				RuntimeGlobals.getChunkScriptFilename
+			}(${JSON.stringify(chunk.id)}), ${RuntimeGlobals.baseURI}`
+		);
+	}
+};
+
+makeSerializable(WorkerDependency, "webpack/lib/dependencies/WorkerDependency");
+
+module.exports = WorkerDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WorkerPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WorkerPlugin.js
new file mode 100644
index 0000000..cbe7325
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/WorkerPlugin.js
@@ -0,0 +1,416 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { pathToFileURL } = require("url");
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const CommentCompilationWarning = require("../CommentCompilationWarning");
+const UnsupportedFeatureWarning = require("../UnsupportedFeatureWarning");
+const EnableChunkLoadingPlugin = require("../javascript/EnableChunkLoadingPlugin");
+const { equals } = require("../util/ArrayHelpers");
+const createHash = require("../util/createHash");
+const { contextify } = require("../util/identifier");
+const EnableWasmLoadingPlugin = require("../wasm/EnableWasmLoadingPlugin");
+const ConstDependency = require("./ConstDependency");
+const CreateScriptUrlDependency = require("./CreateScriptUrlDependency");
+const {
+	harmonySpecifierTag
+} = require("./HarmonyImportDependencyParserPlugin");
+const WorkerDependency = require("./WorkerDependency");
+
+/** @typedef {import("estree").Expression} Expression */
+/** @typedef {import("estree").ObjectExpression} ObjectExpression */
+/** @typedef {import("estree").Pattern} Pattern */
+/** @typedef {import("estree").Property} Property */
+/** @typedef {import("estree").SpreadElement} SpreadElement */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Entrypoint").EntryOptions} EntryOptions */
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../javascript/BasicEvaluatedExpression")} BasicEvaluatedExpression */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+/** @typedef {import("./HarmonyImportDependencyParserPlugin").HarmonySettings} HarmonySettings */
+
+const getUrl = module => {
+	return pathToFileURL(module.resource).toString();
+};
+
+const DEFAULT_SYNTAX = [
+	"Worker",
+	"SharedWorker",
+	"navigator.serviceWorker.register()",
+	"Worker from worker_threads"
+];
+
+/** @type {WeakMap<ParserState, number>} */
+const workerIndexMap = new WeakMap();
+
+class WorkerPlugin {
+	constructor(chunkLoading, wasmLoading, module) {
+		this._chunkLoading = chunkLoading;
+		this._wasmLoading = wasmLoading;
+		this._module = module;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		if (this._chunkLoading) {
+			new EnableChunkLoadingPlugin(this._chunkLoading).apply(compiler);
+		}
+		if (this._wasmLoading) {
+			new EnableWasmLoadingPlugin(this._wasmLoading).apply(compiler);
+		}
+		const cachedContextify = contextify.bindContextCache(
+			compiler.context,
+			compiler.root
+		);
+		compiler.hooks.thisCompilation.tap(
+			"WorkerPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					WorkerDependency,
+					normalModuleFactory
+				);
+				compilation.dependencyTemplates.set(
+					WorkerDependency,
+					new WorkerDependency.Template()
+				);
+				compilation.dependencyTemplates.set(
+					CreateScriptUrlDependency,
+					new CreateScriptUrlDependency.Template()
+				);
+
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @param {Expression} expr expression
+				 * @returns {[BasicEvaluatedExpression, [number, number]]} parsed
+				 */
+				const parseModuleUrl = (parser, expr) => {
+					if (
+						expr.type !== "NewExpression" ||
+						expr.callee.type === "Super" ||
+						expr.arguments.length !== 2
+					)
+						return;
+					const [arg1, arg2] = expr.arguments;
+					if (arg1.type === "SpreadElement") return;
+					if (arg2.type === "SpreadElement") return;
+					const callee = parser.evaluateExpression(expr.callee);
+					if (!callee.isIdentifier() || callee.identifier !== "URL") return;
+					const arg2Value = parser.evaluateExpression(arg2);
+					if (
+						!arg2Value.isString() ||
+						!arg2Value.string.startsWith("file://") ||
+						arg2Value.string !== getUrl(parser.state.module)
+					) {
+						return;
+					}
+					const arg1Value = parser.evaluateExpression(arg1);
+					return [arg1Value, [arg1.range[0], arg2.range[1]]];
+				};
+
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @param {ObjectExpression} expr expression
+				 * @returns {{ expressions: Record<string, Expression | Pattern>, otherElements: (Property | SpreadElement)[], values: Record<string, any>, spread: boolean, insertType: "comma" | "single", insertLocation: number }} parsed object
+				 */
+				const parseObjectExpression = (parser, expr) => {
+					/** @type {Record<string, any>} */
+					const values = {};
+					/** @type {Record<string, Expression | Pattern>} */
+					const expressions = {};
+					/** @type {(Property | SpreadElement)[]} */
+					const otherElements = [];
+					let spread = false;
+					for (const prop of expr.properties) {
+						if (prop.type === "SpreadElement") {
+							spread = true;
+						} else if (
+							prop.type === "Property" &&
+							!prop.method &&
+							!prop.computed &&
+							prop.key.type === "Identifier"
+						) {
+							expressions[prop.key.name] = prop.value;
+							if (!prop.shorthand && !prop.value.type.endsWith("Pattern")) {
+								const value = parser.evaluateExpression(
+									/** @type {Expression} */ (prop.value)
+								);
+								if (value.isCompileTimeValue())
+									values[prop.key.name] = value.asCompileTimeValue();
+							}
+						} else {
+							otherElements.push(prop);
+						}
+					}
+					const insertType = expr.properties.length > 0 ? "comma" : "single";
+					const insertLocation =
+						expr.properties[expr.properties.length - 1].range[1];
+					return {
+						expressions,
+						otherElements,
+						values,
+						spread,
+						insertType,
+						insertLocation
+					};
+				};
+
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @param {object} parserOptions options
+				 */
+				const parserPlugin = (parser, parserOptions) => {
+					if (parserOptions.worker === false) return;
+					const options = !Array.isArray(parserOptions.worker)
+						? ["..."]
+						: parserOptions.worker;
+					const handleNewWorker = expr => {
+						if (expr.arguments.length === 0 || expr.arguments.length > 2)
+							return;
+						const [arg1, arg2] = expr.arguments;
+						if (arg1.type === "SpreadElement") return;
+						if (arg2 && arg2.type === "SpreadElement") return;
+						const parsedUrl = parseModuleUrl(parser, arg1);
+						if (!parsedUrl) return;
+						const [url, range] = parsedUrl;
+						if (!url.isString()) return;
+						const {
+							expressions,
+							otherElements,
+							values: options,
+							spread: hasSpreadInOptions,
+							insertType,
+							insertLocation
+						} = arg2 && arg2.type === "ObjectExpression"
+							? parseObjectExpression(parser, arg2)
+							: {
+									expressions: {},
+									otherElements: [],
+									values: {},
+									spread: false,
+									insertType: arg2 ? "spread" : "argument",
+									insertLocation: arg2 ? arg2.range : arg1.range[1]
+							  };
+						const { options: importOptions, errors: commentErrors } =
+							parser.parseCommentOptions(expr.range);
+
+						if (commentErrors) {
+							for (const e of commentErrors) {
+								const { comment } = e;
+								parser.state.module.addWarning(
+									new CommentCompilationWarning(
+										`Compilation error while processing magic comment(-s): /*${comment.value}*/: ${e.message}`,
+										comment.loc
+									)
+								);
+							}
+						}
+
+						/** @type {EntryOptions} */
+						let entryOptions = {};
+
+						if (importOptions) {
+							if (importOptions.webpackIgnore !== undefined) {
+								if (typeof importOptions.webpackIgnore !== "boolean") {
+									parser.state.module.addWarning(
+										new UnsupportedFeatureWarning(
+											`\`webpackIgnore\` expected a boolean, but received: ${importOptions.webpackIgnore}.`,
+											expr.loc
+										)
+									);
+								} else {
+									if (importOptions.webpackIgnore) {
+										return false;
+									}
+								}
+							}
+							if (importOptions.webpackEntryOptions !== undefined) {
+								if (
+									typeof importOptions.webpackEntryOptions !== "object" ||
+									importOptions.webpackEntryOptions === null
+								) {
+									parser.state.module.addWarning(
+										new UnsupportedFeatureWarning(
+											`\`webpackEntryOptions\` expected a object, but received: ${importOptions.webpackEntryOptions}.`,
+											expr.loc
+										)
+									);
+								} else {
+									Object.assign(
+										entryOptions,
+										importOptions.webpackEntryOptions
+									);
+								}
+							}
+							if (importOptions.webpackChunkName !== undefined) {
+								if (typeof importOptions.webpackChunkName !== "string") {
+									parser.state.module.addWarning(
+										new UnsupportedFeatureWarning(
+											`\`webpackChunkName\` expected a string, but received: ${importOptions.webpackChunkName}.`,
+											expr.loc
+										)
+									);
+								} else {
+									entryOptions.name = importOptions.webpackChunkName;
+								}
+							}
+						}
+
+						if (
+							!Object.prototype.hasOwnProperty.call(entryOptions, "name") &&
+							options &&
+							typeof options.name === "string"
+						) {
+							entryOptions.name = options.name;
+						}
+
+						if (entryOptions.runtime === undefined) {
+							let i = workerIndexMap.get(parser.state) || 0;
+							workerIndexMap.set(parser.state, i + 1);
+							let name = `${cachedContextify(
+								parser.state.module.identifier()
+							)}|${i}`;
+							const hash = createHash(compilation.outputOptions.hashFunction);
+							hash.update(name);
+							const digest = /** @type {string} */ (
+								hash.digest(compilation.outputOptions.hashDigest)
+							);
+							entryOptions.runtime = digest.slice(
+								0,
+								compilation.outputOptions.hashDigestLength
+							);
+						}
+
+						const block = new AsyncDependenciesBlock({
+							name: entryOptions.name,
+							entryOptions: {
+								chunkLoading: this._chunkLoading,
+								wasmLoading: this._wasmLoading,
+								...entryOptions
+							}
+						});
+						block.loc = expr.loc;
+						const dep = new WorkerDependency(url.string, range);
+						dep.loc = expr.loc;
+						block.addDependency(dep);
+						parser.state.module.addBlock(block);
+
+						if (compilation.outputOptions.trustedTypes) {
+							const dep = new CreateScriptUrlDependency(
+								expr.arguments[0].range
+							);
+							dep.loc = expr.loc;
+							parser.state.module.addDependency(dep);
+						}
+
+						if (expressions.type) {
+							const expr = expressions.type;
+							if (options.type !== false) {
+								const dep = new ConstDependency(
+									this._module ? '"module"' : "undefined",
+									expr.range
+								);
+								dep.loc = expr.loc;
+								parser.state.module.addPresentationalDependency(dep);
+								expressions.type = undefined;
+							}
+						} else if (insertType === "comma") {
+							if (this._module || hasSpreadInOptions) {
+								const dep = new ConstDependency(
+									`, type: ${this._module ? '"module"' : "undefined"}`,
+									insertLocation
+								);
+								dep.loc = expr.loc;
+								parser.state.module.addPresentationalDependency(dep);
+							}
+						} else if (insertType === "spread") {
+							const dep1 = new ConstDependency(
+								"Object.assign({}, ",
+								insertLocation[0]
+							);
+							const dep2 = new ConstDependency(
+								`, { type: ${this._module ? '"module"' : "undefined"} })`,
+								insertLocation[1]
+							);
+							dep1.loc = expr.loc;
+							dep2.loc = expr.loc;
+							parser.state.module.addPresentationalDependency(dep1);
+							parser.state.module.addPresentationalDependency(dep2);
+						} else if (insertType === "argument") {
+							if (this._module) {
+								const dep = new ConstDependency(
+									', { type: "module" }',
+									insertLocation
+								);
+								dep.loc = expr.loc;
+								parser.state.module.addPresentationalDependency(dep);
+							}
+						}
+
+						parser.walkExpression(expr.callee);
+						for (const key of Object.keys(expressions)) {
+							if (expressions[key]) parser.walkExpression(expressions[key]);
+						}
+						for (const prop of otherElements) {
+							parser.walkProperty(prop);
+						}
+						if (insertType === "spread") {
+							parser.walkExpression(arg2);
+						}
+
+						return true;
+					};
+					const processItem = item => {
+						if (item.endsWith("()")) {
+							parser.hooks.call
+								.for(item.slice(0, -2))
+								.tap("WorkerPlugin", handleNewWorker);
+						} else {
+							const match = /^(.+?)(\(\))?\s+from\s+(.+)$/.exec(item);
+							if (match) {
+								const ids = match[1].split(".");
+								const call = match[2];
+								const source = match[3];
+								(call ? parser.hooks.call : parser.hooks.new)
+									.for(harmonySpecifierTag)
+									.tap("WorkerPlugin", expr => {
+										const settings = /** @type {HarmonySettings} */ (
+											parser.currentTagData
+										);
+										if (
+											!settings ||
+											settings.source !== source ||
+											!equals(settings.ids, ids)
+										) {
+											return;
+										}
+										return handleNewWorker(expr);
+									});
+							} else {
+								parser.hooks.new.for(item).tap("WorkerPlugin", handleNewWorker);
+							}
+						}
+					};
+					for (const item of options) {
+						if (item === "...") {
+							DEFAULT_SYNTAX.forEach(processItem);
+						} else processItem(item);
+					}
+				};
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("WorkerPlugin", parserPlugin);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("WorkerPlugin", parserPlugin);
+			}
+		);
+	}
+}
+module.exports = WorkerPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/getFunctionExpression.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/getFunctionExpression.js
new file mode 100644
index 0000000..14fd139
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/getFunctionExpression.js
@@ -0,0 +1,55 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+module.exports = expr => {
+	// <FunctionExpression>
+	if (
+		expr.type === "FunctionExpression" ||
+		expr.type === "ArrowFunctionExpression"
+	) {
+		return {
+			fn: expr,
+			expressions: [],
+			needThis: false
+		};
+	}
+
+	// <FunctionExpression>.bind(<Expression>)
+	if (
+		expr.type === "CallExpression" &&
+		expr.callee.type === "MemberExpression" &&
+		expr.callee.object.type === "FunctionExpression" &&
+		expr.callee.property.type === "Identifier" &&
+		expr.callee.property.name === "bind" &&
+		expr.arguments.length === 1
+	) {
+		return {
+			fn: expr.callee.object,
+			expressions: [expr.arguments[0]],
+			needThis: undefined
+		};
+	}
+	// (function(_this) {return <FunctionExpression>})(this) (Coffeescript)
+	if (
+		expr.type === "CallExpression" &&
+		expr.callee.type === "FunctionExpression" &&
+		expr.callee.body.type === "BlockStatement" &&
+		expr.arguments.length === 1 &&
+		expr.arguments[0].type === "ThisExpression" &&
+		expr.callee.body.body &&
+		expr.callee.body.body.length === 1 &&
+		expr.callee.body.body[0].type === "ReturnStatement" &&
+		expr.callee.body.body[0].argument &&
+		expr.callee.body.body[0].argument.type === "FunctionExpression"
+	) {
+		return {
+			fn: expr.callee.body.body[0].argument,
+			expressions: [],
+			needThis: true
+		};
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/processExportInfo.js b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/processExportInfo.js
new file mode 100644
index 0000000..435c4ac
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/dependencies/processExportInfo.js
@@ -0,0 +1,65 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { UsageState } = require("../ExportsInfo");
+
+/** @typedef {import("../ExportsInfo").ExportInfo} ExportInfo */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @param {RuntimeSpec} runtime the runtime
+ * @param {string[][]} referencedExports list of referenced exports, will be added to
+ * @param {string[]} prefix export prefix
+ * @param {ExportInfo=} exportInfo the export info
+ * @param {boolean} defaultPointsToSelf when true, using default will reference itself
+ * @param {Set<ExportInfo>} alreadyVisited already visited export info (to handle circular reexports)
+ */
+const processExportInfo = (
+	runtime,
+	referencedExports,
+	prefix,
+	exportInfo,
+	defaultPointsToSelf = false,
+	alreadyVisited = new Set()
+) => {
+	if (!exportInfo) {
+		referencedExports.push(prefix);
+		return;
+	}
+	const used = exportInfo.getUsed(runtime);
+	if (used === UsageState.Unused) return;
+	if (alreadyVisited.has(exportInfo)) {
+		referencedExports.push(prefix);
+		return;
+	}
+	alreadyVisited.add(exportInfo);
+	if (
+		used !== UsageState.OnlyPropertiesUsed ||
+		!exportInfo.exportsInfo ||
+		exportInfo.exportsInfo.otherExportsInfo.getUsed(runtime) !==
+			UsageState.Unused
+	) {
+		alreadyVisited.delete(exportInfo);
+		referencedExports.push(prefix);
+		return;
+	}
+	const exportsInfo = exportInfo.exportsInfo;
+	for (const exportInfo of exportsInfo.orderedExports) {
+		processExportInfo(
+			runtime,
+			referencedExports,
+			defaultPointsToSelf && exportInfo.name === "default"
+				? prefix
+				: prefix.concat(exportInfo.name),
+			exportInfo,
+			false,
+			alreadyVisited
+		);
+	}
+	alreadyVisited.delete(exportInfo);
+};
+module.exports = processExportInfo;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/electron/ElectronTargetPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/electron/ElectronTargetPlugin.js
new file mode 100644
index 0000000..b62e4bf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/electron/ElectronTargetPlugin.js
@@ -0,0 +1,68 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ExternalsPlugin = require("../ExternalsPlugin");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ElectronTargetPlugin {
+	/**
+	 * @param {"main" | "preload" | "renderer"=} context in main, preload or renderer context?
+	 */
+	constructor(context) {
+		this._context = context;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		new ExternalsPlugin("node-commonjs", [
+			"clipboard",
+			"crash-reporter",
+			"electron",
+			"ipc",
+			"native-image",
+			"original-fs",
+			"screen",
+			"shell"
+		]).apply(compiler);
+		switch (this._context) {
+			case "main":
+				new ExternalsPlugin("node-commonjs", [
+					"app",
+					"auto-updater",
+					"browser-window",
+					"content-tracing",
+					"dialog",
+					"global-shortcut",
+					"ipc-main",
+					"menu",
+					"menu-item",
+					"power-monitor",
+					"power-save-blocker",
+					"protocol",
+					"session",
+					"tray",
+					"web-contents"
+				]).apply(compiler);
+				break;
+			case "preload":
+			case "renderer":
+				new ExternalsPlugin("node-commonjs", [
+					"desktop-capturer",
+					"ipc-renderer",
+					"remote",
+					"web-frame"
+				]).apply(compiler);
+				break;
+		}
+	}
+}
+
+module.exports = ElectronTargetPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/errors/BuildCycleError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/errors/BuildCycleError.js
new file mode 100644
index 0000000..a235fce
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/errors/BuildCycleError.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+
+/** @typedef {import("../Module")} Module */
+
+class BuildCycleError extends WebpackError {
+	/**
+	 * Creates an instance of ModuleDependencyError.
+	 * @param {Module} module the module starting the cycle
+	 */
+	constructor(module) {
+		super(
+			"There is a circular build dependency, which makes it impossible to create this module"
+		);
+
+		this.name = "BuildCycleError";
+		this.module = module;
+	}
+}
+
+module.exports = BuildCycleError;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ExportWebpackRequireRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ExportWebpackRequireRuntimeModule.js
new file mode 100644
index 0000000..42d97cb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ExportWebpackRequireRuntimeModule.js
@@ -0,0 +1,29 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeModule = require("../RuntimeModule");
+
+class ExportWebpackRequireRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("export webpack runtime", RuntimeModule.STAGE_ATTACH);
+	}
+
+	/**
+	 * @returns {boolean} true, if the runtime module should get it's own scope
+	 */
+	shouldIsolate() {
+		return false;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return "export default __webpack_require__;";
+	}
+}
+
+module.exports = ExportWebpackRequireRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkFormatPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkFormatPlugin.js
new file mode 100644
index 0000000..e17d105
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkFormatPlugin.js
@@ -0,0 +1,202 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const { RuntimeGlobals } = require("..");
+const HotUpdateChunk = require("../HotUpdateChunk");
+const Template = require("../Template");
+const { getAllChunks } = require("../javascript/ChunkHelpers");
+const {
+	getCompilationHooks,
+	getChunkFilenameTemplate
+} = require("../javascript/JavascriptModulesPlugin");
+const { updateHashForEntryStartup } = require("../javascript/StartupHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ModuleChunkFormatPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"ModuleChunkFormatPlugin",
+			compilation => {
+				compilation.hooks.additionalChunkRuntimeRequirements.tap(
+					"ModuleChunkFormatPlugin",
+					(chunk, set) => {
+						if (chunk.hasRuntime()) return;
+						if (compilation.chunkGraph.getNumberOfEntryModules(chunk) > 0) {
+							set.add(RuntimeGlobals.require);
+							set.add(RuntimeGlobals.startupEntrypoint);
+							set.add(RuntimeGlobals.externalInstallChunk);
+						}
+					}
+				);
+				const hooks = getCompilationHooks(compilation);
+				hooks.renderChunk.tap(
+					"ModuleChunkFormatPlugin",
+					(modules, renderContext) => {
+						const { chunk, chunkGraph, runtimeTemplate } = renderContext;
+						const hotUpdateChunk =
+							chunk instanceof HotUpdateChunk ? chunk : null;
+						const source = new ConcatSource();
+						if (hotUpdateChunk) {
+							throw new Error(
+								"HMR is not implemented for module chunk format yet"
+							);
+						} else {
+							source.add(`export const id = ${JSON.stringify(chunk.id)};\n`);
+							source.add(`export const ids = ${JSON.stringify(chunk.ids)};\n`);
+							source.add(`export const modules = `);
+							source.add(modules);
+							source.add(`;\n`);
+							const runtimeModules =
+								chunkGraph.getChunkRuntimeModulesInOrder(chunk);
+							if (runtimeModules.length > 0) {
+								source.add("export const runtime =\n");
+								source.add(
+									Template.renderChunkRuntimeModules(
+										runtimeModules,
+										renderContext
+									)
+								);
+							}
+							const entries = Array.from(
+								chunkGraph.getChunkEntryModulesWithChunkGroupIterable(chunk)
+							);
+							if (entries.length > 0) {
+								const runtimeChunk = entries[0][1].getRuntimeChunk();
+								const currentOutputName = compilation
+									.getPath(
+										getChunkFilenameTemplate(chunk, compilation.outputOptions),
+										{
+											chunk,
+											contentHashType: "javascript"
+										}
+									)
+									.split("/");
+
+								// remove filename, we only need the directory
+								currentOutputName.pop();
+
+								const getRelativePath = chunk => {
+									const baseOutputName = currentOutputName.slice();
+									const chunkOutputName = compilation
+										.getPath(
+											getChunkFilenameTemplate(
+												chunk,
+												compilation.outputOptions
+											),
+											{
+												chunk: chunk,
+												contentHashType: "javascript"
+											}
+										)
+										.split("/");
+
+									// remove common parts
+									while (
+										baseOutputName.length > 0 &&
+										chunkOutputName.length > 0 &&
+										baseOutputName[0] === chunkOutputName[0]
+									) {
+										baseOutputName.shift();
+										chunkOutputName.shift();
+									}
+									// create final path
+									return (
+										(baseOutputName.length > 0
+											? "../".repeat(baseOutputName.length)
+											: "./") + chunkOutputName.join("/")
+									);
+								};
+
+								const entrySource = new ConcatSource();
+								entrySource.add(source);
+								entrySource.add(";\n\n// load runtime\n");
+								entrySource.add(
+									`import __webpack_require__ from ${JSON.stringify(
+										getRelativePath(runtimeChunk)
+									)};\n`
+								);
+
+								const startupSource = new ConcatSource();
+								startupSource.add(
+									`var __webpack_exec__ = ${runtimeTemplate.returningFunction(
+										`__webpack_require__(${RuntimeGlobals.entryModuleId} = moduleId)`,
+										"moduleId"
+									)}\n`
+								);
+
+								const loadedChunks = new Set();
+								let index = 0;
+								for (let i = 0; i < entries.length; i++) {
+									const [module, entrypoint] = entries[i];
+									const final = i + 1 === entries.length;
+									const moduleId = chunkGraph.getModuleId(module);
+									const chunks = getAllChunks(
+										entrypoint,
+										runtimeChunk,
+										undefined
+									);
+									for (const chunk of chunks) {
+										if (loadedChunks.has(chunk)) continue;
+										loadedChunks.add(chunk);
+										startupSource.add(
+											`import * as __webpack_chunk_${index}__ from ${JSON.stringify(
+												getRelativePath(chunk)
+											)};\n`
+										);
+										startupSource.add(
+											`${RuntimeGlobals.externalInstallChunk}(__webpack_chunk_${index}__);\n`
+										);
+										index++;
+									}
+									startupSource.add(
+										`${
+											final ? "var __webpack_exports__ = " : ""
+										}__webpack_exec__(${JSON.stringify(moduleId)});\n`
+									);
+								}
+
+								entrySource.add(
+									hooks.renderStartup.call(
+										startupSource,
+										entries[entries.length - 1][0],
+										{
+											...renderContext,
+											inlined: false
+										}
+									)
+								);
+								return entrySource;
+							}
+						}
+						return source;
+					}
+				);
+				hooks.chunkHash.tap(
+					"ModuleChunkFormatPlugin",
+					(chunk, hash, { chunkGraph, runtimeTemplate }) => {
+						if (chunk.hasRuntime()) return;
+						hash.update("ModuleChunkFormatPlugin");
+						hash.update("1");
+						const entries = Array.from(
+							chunkGraph.getChunkEntryModulesWithChunkGroupIterable(chunk)
+						);
+						updateHashForEntryStartup(hash, chunkGraph, entries, chunk);
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = ModuleChunkFormatPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkLoadingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkLoadingPlugin.js
new file mode 100644
index 0000000..c72180a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkLoadingPlugin.js
@@ -0,0 +1,76 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const ExportWebpackRequireRuntimeModule = require("./ExportWebpackRequireRuntimeModule");
+const ModuleChunkLoadingRuntimeModule = require("./ModuleChunkLoadingRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ModuleChunkLoadingPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"ModuleChunkLoadingPlugin",
+			compilation => {
+				const globalChunkLoading = compilation.outputOptions.chunkLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const chunkLoading =
+						(options && options.chunkLoading) || globalChunkLoading;
+					return chunkLoading === "import";
+				};
+				const onceForChunkSet = new WeakSet();
+				const handler = (chunk, set) => {
+					if (onceForChunkSet.has(chunk)) return;
+					onceForChunkSet.add(chunk);
+					if (!isEnabledForChunk(chunk)) return;
+					set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					set.add(RuntimeGlobals.hasOwnProperty);
+					compilation.addRuntimeModule(
+						chunk,
+						new ModuleChunkLoadingRuntimeModule(set)
+					);
+				};
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("ModuleChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.baseURI)
+					.tap("ModuleChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.externalInstallChunk)
+					.tap("ModuleChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.onChunksLoaded)
+					.tap("ModuleChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.externalInstallChunk)
+					.tap("ModuleChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						compilation.addRuntimeModule(
+							chunk,
+							new ExportWebpackRequireRuntimeModule()
+						);
+					});
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("ModuleChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.getChunkScriptFilename);
+					});
+			}
+		);
+	}
+}
+
+module.exports = ModuleChunkLoadingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkLoadingRuntimeModule.js
new file mode 100644
index 0000000..4a846a7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/esm/ModuleChunkLoadingRuntimeModule.js
@@ -0,0 +1,242 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const { SyncWaterfallHook } = require("tapable");
+const Compilation = require("../Compilation");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const {
+	getChunkFilenameTemplate,
+	chunkHasJs
+} = require("../javascript/JavascriptModulesPlugin");
+const { getInitialChunkIds } = require("../javascript/StartupHelpers");
+const compileBooleanMatcher = require("../util/compileBooleanMatcher");
+const { getUndoPath } = require("../util/identifier");
+
+/** @typedef {import("../Chunk")} Chunk */
+
+/**
+ * @typedef {Object} JsonpCompilationPluginHooks
+ * @property {SyncWaterfallHook<[string, Chunk]>} linkPreload
+ * @property {SyncWaterfallHook<[string, Chunk]>} linkPrefetch
+ */
+
+/** @type {WeakMap<Compilation, JsonpCompilationPluginHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class ModuleChunkLoadingRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {JsonpCompilationPluginHooks} hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				linkPreload: new SyncWaterfallHook(["source", "chunk"]),
+				linkPrefetch: new SyncWaterfallHook(["source", "chunk"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	constructor(runtimeRequirements) {
+		super("import chunk loading", RuntimeModule.STAGE_ATTACH);
+		this._runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @private
+	 * @param {Chunk} chunk chunk
+	 * @param {string} rootOutputDir root output directory
+	 * @returns {string} generated code
+	 */
+	_generateBaseUri(chunk, rootOutputDir) {
+		const options = chunk.getEntryOptions();
+		if (options && options.baseUri) {
+			return `${RuntimeGlobals.baseURI} = ${JSON.stringify(options.baseUri)};`;
+		}
+		const {
+			compilation: {
+				outputOptions: { importMetaName }
+			}
+		} = this;
+		return `${RuntimeGlobals.baseURI} = new URL(${JSON.stringify(
+			rootOutputDir
+		)}, ${importMetaName}.url);`;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation, chunk, chunkGraph } = this;
+		const {
+			runtimeTemplate,
+			outputOptions: { importFunctionName }
+		} = compilation;
+		const fn = RuntimeGlobals.ensureChunkHandlers;
+		const withBaseURI = this._runtimeRequirements.has(RuntimeGlobals.baseURI);
+		const withExternalInstallChunk = this._runtimeRequirements.has(
+			RuntimeGlobals.externalInstallChunk
+		);
+		const withLoading = this._runtimeRequirements.has(
+			RuntimeGlobals.ensureChunkHandlers
+		);
+		const withOnChunkLoad = this._runtimeRequirements.has(
+			RuntimeGlobals.onChunksLoaded
+		);
+		const withHmr = this._runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadUpdateHandlers
+		);
+		const conditionMap = chunkGraph.getChunkConditionMap(chunk, chunkHasJs);
+		const hasJsMatcher = compileBooleanMatcher(conditionMap);
+		const initialChunkIds = getInitialChunkIds(chunk, chunkGraph, chunkHasJs);
+
+		const outputName = this.compilation.getPath(
+			getChunkFilenameTemplate(chunk, this.compilation.outputOptions),
+			{
+				chunk,
+				contentHashType: "javascript"
+			}
+		);
+		const rootOutputDir = getUndoPath(
+			outputName,
+			this.compilation.outputOptions.path,
+			true
+		);
+
+		const stateExpression = withHmr
+			? `${RuntimeGlobals.hmrRuntimeStatePrefix}_module`
+			: undefined;
+
+		return Template.asString([
+			withBaseURI
+				? this._generateBaseUri(chunk, rootOutputDir)
+				: "// no baseURI",
+			"",
+			"// object to store loaded and loading chunks",
+			"// undefined = chunk not loaded, null = chunk preloaded/prefetched",
+			"// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded",
+			`var installedChunks = ${
+				stateExpression ? `${stateExpression} = ${stateExpression} || ` : ""
+			}{`,
+			Template.indent(
+				Array.from(initialChunkIds, id => `${JSON.stringify(id)}: 0`).join(
+					",\n"
+				)
+			),
+			"};",
+			"",
+			withLoading || withExternalInstallChunk
+				? `var installChunk = ${runtimeTemplate.basicFunction("data", [
+						runtimeTemplate.destructureObject(
+							["ids", "modules", "runtime"],
+							"data"
+						),
+						'// add "modules" to the modules object,',
+						'// then flag all "ids" as loaded and fire callback',
+						"var moduleId, chunkId, i = 0;",
+						"for(moduleId in modules) {",
+						Template.indent([
+							`if(${RuntimeGlobals.hasOwnProperty}(modules, moduleId)) {`,
+							Template.indent(
+								`${RuntimeGlobals.moduleFactories}[moduleId] = modules[moduleId];`
+							),
+							"}"
+						]),
+						"}",
+						"if(runtime) runtime(__webpack_require__);",
+						"for(;i < ids.length; i++) {",
+						Template.indent([
+							"chunkId = ids[i];",
+							`if(${RuntimeGlobals.hasOwnProperty}(installedChunks, chunkId) && installedChunks[chunkId]) {`,
+							Template.indent("installedChunks[chunkId][0]();"),
+							"}",
+							"installedChunks[ids[i]] = 0;"
+						]),
+						"}",
+						withOnChunkLoad ? `${RuntimeGlobals.onChunksLoaded}();` : ""
+				  ])}`
+				: "// no install chunk",
+			"",
+			withLoading
+				? Template.asString([
+						`${fn}.j = ${runtimeTemplate.basicFunction(
+							"chunkId, promises",
+							hasJsMatcher !== false
+								? Template.indent([
+										"// import() chunk loading for javascript",
+										`var installedChunkData = ${RuntimeGlobals.hasOwnProperty}(installedChunks, chunkId) ? installedChunks[chunkId] : undefined;`,
+										'if(installedChunkData !== 0) { // 0 means "already installed".',
+										Template.indent([
+											"",
+											'// a Promise means "currently loading".',
+											"if(installedChunkData) {",
+											Template.indent([
+												"promises.push(installedChunkData[1]);"
+											]),
+											"} else {",
+											Template.indent([
+												hasJsMatcher === true
+													? "if(true) { // all chunks have JS"
+													: `if(${hasJsMatcher("chunkId")}) {`,
+												Template.indent([
+													"// setup Promise in chunk cache",
+													`var promise = ${importFunctionName}(${JSON.stringify(
+														rootOutputDir
+													)} + ${
+														RuntimeGlobals.getChunkScriptFilename
+													}(chunkId)).then(installChunk, ${runtimeTemplate.basicFunction(
+														"e",
+														[
+															"if(installedChunks[chunkId] !== 0) installedChunks[chunkId] = undefined;",
+															"throw e;"
+														]
+													)});`,
+													`var promise = Promise.race([promise, new Promise(${runtimeTemplate.expressionFunction(
+														`installedChunkData = installedChunks[chunkId] = [resolve]`,
+														"resolve"
+													)})])`,
+													`promises.push(installedChunkData[1] = promise);`
+												]),
+												"} else installedChunks[chunkId] = 0;"
+											]),
+											"}"
+										]),
+										"}"
+								  ])
+								: Template.indent(["installedChunks[chunkId] = 0;"])
+						)};`
+				  ])
+				: "// no chunk on demand loading",
+			"",
+			withExternalInstallChunk
+				? Template.asString([
+						`${RuntimeGlobals.externalInstallChunk} = installChunk;`
+				  ])
+				: "// no external install chunk",
+			"",
+			withOnChunkLoad
+				? `${
+						RuntimeGlobals.onChunksLoaded
+				  }.j = ${runtimeTemplate.returningFunction(
+						"installedChunks[chunkId] === 0",
+						"chunkId"
+				  )};`
+				: "// no on chunks loaded"
+		]);
+	}
+}
+
+module.exports = ModuleChunkLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/formatLocation.js b/node_modules/mathjs/examples/node_modules/webpack/lib/formatLocation.js
new file mode 100644
index 0000000..f42eea2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/formatLocation.js
@@ -0,0 +1,68 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("./Dependency").SourcePosition} SourcePosition */
+
+/**
+ * @param {SourcePosition} pos position
+ * @returns {string} formatted position
+ */
+const formatPosition = pos => {
+	if (pos && typeof pos === "object") {
+		if ("line" in pos && "column" in pos) {
+			return `${pos.line}:${pos.column}`;
+		} else if ("line" in pos) {
+			return `${pos.line}:?`;
+		}
+	}
+	return "";
+};
+
+/**
+ * @param {DependencyLocation} loc location
+ * @returns {string} formatted location
+ */
+const formatLocation = loc => {
+	if (loc && typeof loc === "object") {
+		if ("start" in loc && loc.start && "end" in loc && loc.end) {
+			if (
+				typeof loc.start === "object" &&
+				typeof loc.start.line === "number" &&
+				typeof loc.end === "object" &&
+				typeof loc.end.line === "number" &&
+				typeof loc.end.column === "number" &&
+				loc.start.line === loc.end.line
+			) {
+				return `${formatPosition(loc.start)}-${loc.end.column}`;
+			} else if (
+				typeof loc.start === "object" &&
+				typeof loc.start.line === "number" &&
+				typeof loc.start.column !== "number" &&
+				typeof loc.end === "object" &&
+				typeof loc.end.line === "number" &&
+				typeof loc.end.column !== "number"
+			) {
+				return `${loc.start.line}-${loc.end.line}`;
+			} else {
+				return `${formatPosition(loc.start)}-${formatPosition(loc.end)}`;
+			}
+		}
+		if ("start" in loc && loc.start) {
+			return formatPosition(loc.start);
+		}
+		if ("name" in loc && "index" in loc) {
+			return `${loc.name}[${loc.index}]`;
+		}
+		if ("name" in loc) {
+			return loc.name;
+		}
+	}
+	return "";
+};
+
+module.exports = formatLocation;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/HotModuleReplacement.runtime.js b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/HotModuleReplacement.runtime.js
new file mode 100644
index 0000000..2b79e41
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/HotModuleReplacement.runtime.js
@@ -0,0 +1,394 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+var $interceptModuleExecution$ = undefined;
+var $moduleCache$ = undefined;
+// eslint-disable-next-line no-unused-vars
+var $hmrModuleData$ = undefined;
+/** @type {() => Promise}  */
+var $hmrDownloadManifest$ = undefined;
+var $hmrDownloadUpdateHandlers$ = undefined;
+var $hmrInvalidateModuleHandlers$ = undefined;
+var __webpack_require__ = undefined;
+
+module.exports = function () {
+	var currentModuleData = {};
+	var installedModules = $moduleCache$;
+
+	// module and require creation
+	var currentChildModule;
+	var currentParents = [];
+
+	// status
+	var registeredStatusHandlers = [];
+	var currentStatus = "idle";
+
+	// while downloading
+	var blockingPromises;
+
+	// The update info
+	var currentUpdateApplyHandlers;
+	var queuedInvalidatedModules;
+
+	// eslint-disable-next-line no-unused-vars
+	$hmrModuleData$ = currentModuleData;
+
+	$interceptModuleExecution$.push(function (options) {
+		var module = options.module;
+		var require = createRequire(options.require, options.id);
+		module.hot = createModuleHotObject(options.id, module);
+		module.parents = currentParents;
+		module.children = [];
+		currentParents = [];
+		options.require = require;
+	});
+
+	$hmrDownloadUpdateHandlers$ = {};
+	$hmrInvalidateModuleHandlers$ = {};
+
+	function createRequire(require, moduleId) {
+		var me = installedModules[moduleId];
+		if (!me) return require;
+		var fn = function (request) {
+			if (me.hot.active) {
+				if (installedModules[request]) {
+					var parents = installedModules[request].parents;
+					if (parents.indexOf(moduleId) === -1) {
+						parents.push(moduleId);
+					}
+				} else {
+					currentParents = [moduleId];
+					currentChildModule = request;
+				}
+				if (me.children.indexOf(request) === -1) {
+					me.children.push(request);
+				}
+			} else {
+				console.warn(
+					"[HMR] unexpected require(" +
+						request +
+						") from disposed module " +
+						moduleId
+				);
+				currentParents = [];
+			}
+			return require(request);
+		};
+		var createPropertyDescriptor = function (name) {
+			return {
+				configurable: true,
+				enumerable: true,
+				get: function () {
+					return require[name];
+				},
+				set: function (value) {
+					require[name] = value;
+				}
+			};
+		};
+		for (var name in require) {
+			if (Object.prototype.hasOwnProperty.call(require, name) && name !== "e") {
+				Object.defineProperty(fn, name, createPropertyDescriptor(name));
+			}
+		}
+		fn.e = function (chunkId) {
+			return trackBlockingPromise(require.e(chunkId));
+		};
+		return fn;
+	}
+
+	function createModuleHotObject(moduleId, me) {
+		var _main = currentChildModule !== moduleId;
+		var hot = {
+			// private stuff
+			_acceptedDependencies: {},
+			_acceptedErrorHandlers: {},
+			_declinedDependencies: {},
+			_selfAccepted: false,
+			_selfDeclined: false,
+			_selfInvalidated: false,
+			_disposeHandlers: [],
+			_main: _main,
+			_requireSelf: function () {
+				currentParents = me.parents.slice();
+				currentChildModule = _main ? undefined : moduleId;
+				__webpack_require__(moduleId);
+			},
+
+			// Module API
+			active: true,
+			accept: function (dep, callback, errorHandler) {
+				if (dep === undefined) hot._selfAccepted = true;
+				else if (typeof dep === "function") hot._selfAccepted = dep;
+				else if (typeof dep === "object" && dep !== null) {
+					for (var i = 0; i < dep.length; i++) {
+						hot._acceptedDependencies[dep[i]] = callback || function () {};
+						hot._acceptedErrorHandlers[dep[i]] = errorHandler;
+					}
+				} else {
+					hot._acceptedDependencies[dep] = callback || function () {};
+					hot._acceptedErrorHandlers[dep] = errorHandler;
+				}
+			},
+			decline: function (dep) {
+				if (dep === undefined) hot._selfDeclined = true;
+				else if (typeof dep === "object" && dep !== null)
+					for (var i = 0; i < dep.length; i++)
+						hot._declinedDependencies[dep[i]] = true;
+				else hot._declinedDependencies[dep] = true;
+			},
+			dispose: function (callback) {
+				hot._disposeHandlers.push(callback);
+			},
+			addDisposeHandler: function (callback) {
+				hot._disposeHandlers.push(callback);
+			},
+			removeDisposeHandler: function (callback) {
+				var idx = hot._disposeHandlers.indexOf(callback);
+				if (idx >= 0) hot._disposeHandlers.splice(idx, 1);
+			},
+			invalidate: function () {
+				this._selfInvalidated = true;
+				switch (currentStatus) {
+					case "idle":
+						currentUpdateApplyHandlers = [];
+						Object.keys($hmrInvalidateModuleHandlers$).forEach(function (key) {
+							$hmrInvalidateModuleHandlers$[key](
+								moduleId,
+								currentUpdateApplyHandlers
+							);
+						});
+						setStatus("ready");
+						break;
+					case "ready":
+						Object.keys($hmrInvalidateModuleHandlers$).forEach(function (key) {
+							$hmrInvalidateModuleHandlers$[key](
+								moduleId,
+								currentUpdateApplyHandlers
+							);
+						});
+						break;
+					case "prepare":
+					case "check":
+					case "dispose":
+					case "apply":
+						(queuedInvalidatedModules = queuedInvalidatedModules || []).push(
+							moduleId
+						);
+						break;
+					default:
+						// ignore requests in error states
+						break;
+				}
+			},
+
+			// Management API
+			check: hotCheck,
+			apply: hotApply,
+			status: function (l) {
+				if (!l) return currentStatus;
+				registeredStatusHandlers.push(l);
+			},
+			addStatusHandler: function (l) {
+				registeredStatusHandlers.push(l);
+			},
+			removeStatusHandler: function (l) {
+				var idx = registeredStatusHandlers.indexOf(l);
+				if (idx >= 0) registeredStatusHandlers.splice(idx, 1);
+			},
+
+			//inherit from previous dispose call
+			data: currentModuleData[moduleId]
+		};
+		currentChildModule = undefined;
+		return hot;
+	}
+
+	function setStatus(newStatus) {
+		currentStatus = newStatus;
+		var results = [];
+
+		for (var i = 0; i < registeredStatusHandlers.length; i++)
+			results[i] = registeredStatusHandlers[i].call(null, newStatus);
+
+		return Promise.all(results);
+	}
+
+	function trackBlockingPromise(promise) {
+		switch (currentStatus) {
+			case "ready":
+				setStatus("prepare");
+				blockingPromises.push(promise);
+				waitForBlockingPromises(function () {
+					return setStatus("ready");
+				});
+				return promise;
+			case "prepare":
+				blockingPromises.push(promise);
+				return promise;
+			default:
+				return promise;
+		}
+	}
+
+	function waitForBlockingPromises(fn) {
+		if (blockingPromises.length === 0) return fn();
+		var blocker = blockingPromises;
+		blockingPromises = [];
+		return Promise.all(blocker).then(function () {
+			return waitForBlockingPromises(fn);
+		});
+	}
+
+	function hotCheck(applyOnUpdate) {
+		if (currentStatus !== "idle") {
+			throw new Error("check() is only allowed in idle status");
+		}
+		return setStatus("check")
+			.then($hmrDownloadManifest$)
+			.then(function (update) {
+				if (!update) {
+					return setStatus(applyInvalidatedModules() ? "ready" : "idle").then(
+						function () {
+							return null;
+						}
+					);
+				}
+
+				return setStatus("prepare").then(function () {
+					var updatedModules = [];
+					blockingPromises = [];
+					currentUpdateApplyHandlers = [];
+
+					return Promise.all(
+						Object.keys($hmrDownloadUpdateHandlers$).reduce(function (
+							promises,
+							key
+						) {
+							$hmrDownloadUpdateHandlers$[key](
+								update.c,
+								update.r,
+								update.m,
+								promises,
+								currentUpdateApplyHandlers,
+								updatedModules
+							);
+							return promises;
+						},
+						[])
+					).then(function () {
+						return waitForBlockingPromises(function () {
+							if (applyOnUpdate) {
+								return internalApply(applyOnUpdate);
+							} else {
+								return setStatus("ready").then(function () {
+									return updatedModules;
+								});
+							}
+						});
+					});
+				});
+			});
+	}
+
+	function hotApply(options) {
+		if (currentStatus !== "ready") {
+			return Promise.resolve().then(function () {
+				throw new Error("apply() is only allowed in ready status");
+			});
+		}
+		return internalApply(options);
+	}
+
+	function internalApply(options) {
+		options = options || {};
+
+		applyInvalidatedModules();
+
+		var results = currentUpdateApplyHandlers.map(function (handler) {
+			return handler(options);
+		});
+		currentUpdateApplyHandlers = undefined;
+
+		var errors = results
+			.map(function (r) {
+				return r.error;
+			})
+			.filter(Boolean);
+
+		if (errors.length > 0) {
+			return setStatus("abort").then(function () {
+				throw errors[0];
+			});
+		}
+
+		// Now in "dispose" phase
+		var disposePromise = setStatus("dispose");
+
+		results.forEach(function (result) {
+			if (result.dispose) result.dispose();
+		});
+
+		// Now in "apply" phase
+		var applyPromise = setStatus("apply");
+
+		var error;
+		var reportError = function (err) {
+			if (!error) error = err;
+		};
+
+		var outdatedModules = [];
+		results.forEach(function (result) {
+			if (result.apply) {
+				var modules = result.apply(reportError);
+				if (modules) {
+					for (var i = 0; i < modules.length; i++) {
+						outdatedModules.push(modules[i]);
+					}
+				}
+			}
+		});
+
+		return Promise.all([disposePromise, applyPromise]).then(function () {
+			// handle errors in accept handlers and self accepted module load
+			if (error) {
+				return setStatus("fail").then(function () {
+					throw error;
+				});
+			}
+
+			if (queuedInvalidatedModules) {
+				return internalApply(options).then(function (list) {
+					outdatedModules.forEach(function (moduleId) {
+						if (list.indexOf(moduleId) < 0) list.push(moduleId);
+					});
+					return list;
+				});
+			}
+
+			return setStatus("idle").then(function () {
+				return outdatedModules;
+			});
+		});
+	}
+
+	function applyInvalidatedModules() {
+		if (queuedInvalidatedModules) {
+			if (!currentUpdateApplyHandlers) currentUpdateApplyHandlers = [];
+			Object.keys($hmrInvalidateModuleHandlers$).forEach(function (key) {
+				queuedInvalidatedModules.forEach(function (moduleId) {
+					$hmrInvalidateModuleHandlers$[key](
+						moduleId,
+						currentUpdateApplyHandlers
+					);
+				});
+			});
+			queuedInvalidatedModules = undefined;
+			return true;
+		}
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/HotModuleReplacementRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/HotModuleReplacementRuntimeModule.js
new file mode 100644
index 0000000..a92a97e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/HotModuleReplacementRuntimeModule.js
@@ -0,0 +1,42 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class HotModuleReplacementRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("hot module replacement", RuntimeModule.STAGE_BASIC);
+	}
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return Template.getFunctionContent(
+			require("./HotModuleReplacement.runtime.js")
+		)
+			.replace(/\$getFullHash\$/g, RuntimeGlobals.getFullHash)
+			.replace(
+				/\$interceptModuleExecution\$/g,
+				RuntimeGlobals.interceptModuleExecution
+			)
+			.replace(/\$moduleCache\$/g, RuntimeGlobals.moduleCache)
+			.replace(/\$hmrModuleData\$/g, RuntimeGlobals.hmrModuleData)
+			.replace(/\$hmrDownloadManifest\$/g, RuntimeGlobals.hmrDownloadManifest)
+			.replace(
+				/\$hmrInvalidateModuleHandlers\$/g,
+				RuntimeGlobals.hmrInvalidateModuleHandlers
+			)
+			.replace(
+				/\$hmrDownloadUpdateHandlers\$/g,
+				RuntimeGlobals.hmrDownloadUpdateHandlers
+			);
+	}
+}
+
+module.exports = HotModuleReplacementRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/JavascriptHotModuleReplacement.runtime.js b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/JavascriptHotModuleReplacement.runtime.js
new file mode 100644
index 0000000..d03e939
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/JavascriptHotModuleReplacement.runtime.js
@@ -0,0 +1,462 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+var $installedChunks$ = undefined;
+var $loadUpdateChunk$ = undefined;
+var $moduleCache$ = undefined;
+var $moduleFactories$ = undefined;
+var $ensureChunkHandlers$ = undefined;
+var $hasOwnProperty$ = undefined;
+var $hmrModuleData$ = undefined;
+var $hmrDownloadUpdateHandlers$ = undefined;
+var $hmrInvalidateModuleHandlers$ = undefined;
+var __webpack_require__ = undefined;
+
+module.exports = function () {
+	var currentUpdateChunks;
+	var currentUpdate;
+	var currentUpdateRemovedChunks;
+	var currentUpdateRuntime;
+	function applyHandler(options) {
+		if ($ensureChunkHandlers$) delete $ensureChunkHandlers$.$key$Hmr;
+		currentUpdateChunks = undefined;
+		function getAffectedModuleEffects(updateModuleId) {
+			var outdatedModules = [updateModuleId];
+			var outdatedDependencies = {};
+
+			var queue = outdatedModules.map(function (id) {
+				return {
+					chain: [id],
+					id: id
+				};
+			});
+			while (queue.length > 0) {
+				var queueItem = queue.pop();
+				var moduleId = queueItem.id;
+				var chain = queueItem.chain;
+				var module = $moduleCache$[moduleId];
+				if (
+					!module ||
+					(module.hot._selfAccepted && !module.hot._selfInvalidated)
+				)
+					continue;
+				if (module.hot._selfDeclined) {
+					return {
+						type: "self-declined",
+						chain: chain,
+						moduleId: moduleId
+					};
+				}
+				if (module.hot._main) {
+					return {
+						type: "unaccepted",
+						chain: chain,
+						moduleId: moduleId
+					};
+				}
+				for (var i = 0; i < module.parents.length; i++) {
+					var parentId = module.parents[i];
+					var parent = $moduleCache$[parentId];
+					if (!parent) continue;
+					if (parent.hot._declinedDependencies[moduleId]) {
+						return {
+							type: "declined",
+							chain: chain.concat([parentId]),
+							moduleId: moduleId,
+							parentId: parentId
+						};
+					}
+					if (outdatedModules.indexOf(parentId) !== -1) continue;
+					if (parent.hot._acceptedDependencies[moduleId]) {
+						if (!outdatedDependencies[parentId])
+							outdatedDependencies[parentId] = [];
+						addAllToSet(outdatedDependencies[parentId], [moduleId]);
+						continue;
+					}
+					delete outdatedDependencies[parentId];
+					outdatedModules.push(parentId);
+					queue.push({
+						chain: chain.concat([parentId]),
+						id: parentId
+					});
+				}
+			}
+
+			return {
+				type: "accepted",
+				moduleId: updateModuleId,
+				outdatedModules: outdatedModules,
+				outdatedDependencies: outdatedDependencies
+			};
+		}
+
+		function addAllToSet(a, b) {
+			for (var i = 0; i < b.length; i++) {
+				var item = b[i];
+				if (a.indexOf(item) === -1) a.push(item);
+			}
+		}
+
+		// at begin all updates modules are outdated
+		// the "outdated" status can propagate to parents if they don't accept the children
+		var outdatedDependencies = {};
+		var outdatedModules = [];
+		var appliedUpdate = {};
+
+		var warnUnexpectedRequire = function warnUnexpectedRequire(module) {
+			console.warn(
+				"[HMR] unexpected require(" + module.id + ") to disposed module"
+			);
+		};
+
+		for (var moduleId in currentUpdate) {
+			if ($hasOwnProperty$(currentUpdate, moduleId)) {
+				var newModuleFactory = currentUpdate[moduleId];
+				/** @type {TODO} */
+				var result;
+				if (newModuleFactory) {
+					result = getAffectedModuleEffects(moduleId);
+				} else {
+					result = {
+						type: "disposed",
+						moduleId: moduleId
+					};
+				}
+				/** @type {Error|false} */
+				var abortError = false;
+				var doApply = false;
+				var doDispose = false;
+				var chainInfo = "";
+				if (result.chain) {
+					chainInfo = "\nUpdate propagation: " + result.chain.join(" -> ");
+				}
+				switch (result.type) {
+					case "self-declined":
+						if (options.onDeclined) options.onDeclined(result);
+						if (!options.ignoreDeclined)
+							abortError = new Error(
+								"Aborted because of self decline: " +
+									result.moduleId +
+									chainInfo
+							);
+						break;
+					case "declined":
+						if (options.onDeclined) options.onDeclined(result);
+						if (!options.ignoreDeclined)
+							abortError = new Error(
+								"Aborted because of declined dependency: " +
+									result.moduleId +
+									" in " +
+									result.parentId +
+									chainInfo
+							);
+						break;
+					case "unaccepted":
+						if (options.onUnaccepted) options.onUnaccepted(result);
+						if (!options.ignoreUnaccepted)
+							abortError = new Error(
+								"Aborted because " + moduleId + " is not accepted" + chainInfo
+							);
+						break;
+					case "accepted":
+						if (options.onAccepted) options.onAccepted(result);
+						doApply = true;
+						break;
+					case "disposed":
+						if (options.onDisposed) options.onDisposed(result);
+						doDispose = true;
+						break;
+					default:
+						throw new Error("Unexception type " + result.type);
+				}
+				if (abortError) {
+					return {
+						error: abortError
+					};
+				}
+				if (doApply) {
+					appliedUpdate[moduleId] = newModuleFactory;
+					addAllToSet(outdatedModules, result.outdatedModules);
+					for (moduleId in result.outdatedDependencies) {
+						if ($hasOwnProperty$(result.outdatedDependencies, moduleId)) {
+							if (!outdatedDependencies[moduleId])
+								outdatedDependencies[moduleId] = [];
+							addAllToSet(
+								outdatedDependencies[moduleId],
+								result.outdatedDependencies[moduleId]
+							);
+						}
+					}
+				}
+				if (doDispose) {
+					addAllToSet(outdatedModules, [result.moduleId]);
+					appliedUpdate[moduleId] = warnUnexpectedRequire;
+				}
+			}
+		}
+		currentUpdate = undefined;
+
+		// Store self accepted outdated modules to require them later by the module system
+		var outdatedSelfAcceptedModules = [];
+		for (var j = 0; j < outdatedModules.length; j++) {
+			var outdatedModuleId = outdatedModules[j];
+			var module = $moduleCache$[outdatedModuleId];
+			if (
+				module &&
+				(module.hot._selfAccepted || module.hot._main) &&
+				// removed self-accepted modules should not be required
+				appliedUpdate[outdatedModuleId] !== warnUnexpectedRequire &&
+				// when called invalidate self-accepting is not possible
+				!module.hot._selfInvalidated
+			) {
+				outdatedSelfAcceptedModules.push({
+					module: outdatedModuleId,
+					require: module.hot._requireSelf,
+					errorHandler: module.hot._selfAccepted
+				});
+			}
+		}
+
+		var moduleOutdatedDependencies;
+
+		return {
+			dispose: function () {
+				currentUpdateRemovedChunks.forEach(function (chunkId) {
+					delete $installedChunks$[chunkId];
+				});
+				currentUpdateRemovedChunks = undefined;
+
+				var idx;
+				var queue = outdatedModules.slice();
+				while (queue.length > 0) {
+					var moduleId = queue.pop();
+					var module = $moduleCache$[moduleId];
+					if (!module) continue;
+
+					var data = {};
+
+					// Call dispose handlers
+					var disposeHandlers = module.hot._disposeHandlers;
+					for (j = 0; j < disposeHandlers.length; j++) {
+						disposeHandlers[j].call(null, data);
+					}
+					$hmrModuleData$[moduleId] = data;
+
+					// disable module (this disables requires from this module)
+					module.hot.active = false;
+
+					// remove module from cache
+					delete $moduleCache$[moduleId];
+
+					// when disposing there is no need to call dispose handler
+					delete outdatedDependencies[moduleId];
+
+					// remove "parents" references from all children
+					for (j = 0; j < module.children.length; j++) {
+						var child = $moduleCache$[module.children[j]];
+						if (!child) continue;
+						idx = child.parents.indexOf(moduleId);
+						if (idx >= 0) {
+							child.parents.splice(idx, 1);
+						}
+					}
+				}
+
+				// remove outdated dependency from module children
+				var dependency;
+				for (var outdatedModuleId in outdatedDependencies) {
+					if ($hasOwnProperty$(outdatedDependencies, outdatedModuleId)) {
+						module = $moduleCache$[outdatedModuleId];
+						if (module) {
+							moduleOutdatedDependencies =
+								outdatedDependencies[outdatedModuleId];
+							for (j = 0; j < moduleOutdatedDependencies.length; j++) {
+								dependency = moduleOutdatedDependencies[j];
+								idx = module.children.indexOf(dependency);
+								if (idx >= 0) module.children.splice(idx, 1);
+							}
+						}
+					}
+				}
+			},
+			apply: function (reportError) {
+				// insert new code
+				for (var updateModuleId in appliedUpdate) {
+					if ($hasOwnProperty$(appliedUpdate, updateModuleId)) {
+						$moduleFactories$[updateModuleId] = appliedUpdate[updateModuleId];
+					}
+				}
+
+				// run new runtime modules
+				for (var i = 0; i < currentUpdateRuntime.length; i++) {
+					currentUpdateRuntime[i](__webpack_require__);
+				}
+
+				// call accept handlers
+				for (var outdatedModuleId in outdatedDependencies) {
+					if ($hasOwnProperty$(outdatedDependencies, outdatedModuleId)) {
+						var module = $moduleCache$[outdatedModuleId];
+						if (module) {
+							moduleOutdatedDependencies =
+								outdatedDependencies[outdatedModuleId];
+							var callbacks = [];
+							var errorHandlers = [];
+							var dependenciesForCallbacks = [];
+							for (var j = 0; j < moduleOutdatedDependencies.length; j++) {
+								var dependency = moduleOutdatedDependencies[j];
+								var acceptCallback =
+									module.hot._acceptedDependencies[dependency];
+								var errorHandler =
+									module.hot._acceptedErrorHandlers[dependency];
+								if (acceptCallback) {
+									if (callbacks.indexOf(acceptCallback) !== -1) continue;
+									callbacks.push(acceptCallback);
+									errorHandlers.push(errorHandler);
+									dependenciesForCallbacks.push(dependency);
+								}
+							}
+							for (var k = 0; k < callbacks.length; k++) {
+								try {
+									callbacks[k].call(null, moduleOutdatedDependencies);
+								} catch (err) {
+									if (typeof errorHandlers[k] === "function") {
+										try {
+											errorHandlers[k](err, {
+												moduleId: outdatedModuleId,
+												dependencyId: dependenciesForCallbacks[k]
+											});
+										} catch (err2) {
+											if (options.onErrored) {
+												options.onErrored({
+													type: "accept-error-handler-errored",
+													moduleId: outdatedModuleId,
+													dependencyId: dependenciesForCallbacks[k],
+													error: err2,
+													originalError: err
+												});
+											}
+											if (!options.ignoreErrored) {
+												reportError(err2);
+												reportError(err);
+											}
+										}
+									} else {
+										if (options.onErrored) {
+											options.onErrored({
+												type: "accept-errored",
+												moduleId: outdatedModuleId,
+												dependencyId: dependenciesForCallbacks[k],
+												error: err
+											});
+										}
+										if (!options.ignoreErrored) {
+											reportError(err);
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+
+				// Load self accepted modules
+				for (var o = 0; o < outdatedSelfAcceptedModules.length; o++) {
+					var item = outdatedSelfAcceptedModules[o];
+					var moduleId = item.module;
+					try {
+						item.require(moduleId);
+					} catch (err) {
+						if (typeof item.errorHandler === "function") {
+							try {
+								item.errorHandler(err, {
+									moduleId: moduleId,
+									module: $moduleCache$[moduleId]
+								});
+							} catch (err2) {
+								if (options.onErrored) {
+									options.onErrored({
+										type: "self-accept-error-handler-errored",
+										moduleId: moduleId,
+										error: err2,
+										originalError: err
+									});
+								}
+								if (!options.ignoreErrored) {
+									reportError(err2);
+									reportError(err);
+								}
+							}
+						} else {
+							if (options.onErrored) {
+								options.onErrored({
+									type: "self-accept-errored",
+									moduleId: moduleId,
+									error: err
+								});
+							}
+							if (!options.ignoreErrored) {
+								reportError(err);
+							}
+						}
+					}
+				}
+
+				return outdatedModules;
+			}
+		};
+	}
+	$hmrInvalidateModuleHandlers$.$key$ = function (moduleId, applyHandlers) {
+		if (!currentUpdate) {
+			currentUpdate = {};
+			currentUpdateRuntime = [];
+			currentUpdateRemovedChunks = [];
+			applyHandlers.push(applyHandler);
+		}
+		if (!$hasOwnProperty$(currentUpdate, moduleId)) {
+			currentUpdate[moduleId] = $moduleFactories$[moduleId];
+		}
+	};
+	$hmrDownloadUpdateHandlers$.$key$ = function (
+		chunkIds,
+		removedChunks,
+		removedModules,
+		promises,
+		applyHandlers,
+		updatedModulesList
+	) {
+		applyHandlers.push(applyHandler);
+		currentUpdateChunks = {};
+		currentUpdateRemovedChunks = removedChunks;
+		currentUpdate = removedModules.reduce(function (obj, key) {
+			obj[key] = false;
+			return obj;
+		}, {});
+		currentUpdateRuntime = [];
+		chunkIds.forEach(function (chunkId) {
+			if (
+				$hasOwnProperty$($installedChunks$, chunkId) &&
+				$installedChunks$[chunkId] !== undefined
+			) {
+				promises.push($loadUpdateChunk$(chunkId, updatedModulesList));
+				currentUpdateChunks[chunkId] = true;
+			}
+		});
+		if ($ensureChunkHandlers$) {
+			$ensureChunkHandlers$.$key$Hmr = function (chunkId, promises) {
+				if (
+					currentUpdateChunks &&
+					!$hasOwnProperty$(currentUpdateChunks, chunkId) &&
+					$hasOwnProperty$($installedChunks$, chunkId) &&
+					$installedChunks$[chunkId] !== undefined
+				) {
+					promises.push($loadUpdateChunk$(chunkId));
+					currentUpdateChunks[chunkId] = true;
+				}
+			};
+		}
+	};
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/LazyCompilationPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/LazyCompilationPlugin.js
new file mode 100644
index 0000000..2e3b3d3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/LazyCompilationPlugin.js
@@ -0,0 +1,418 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const Dependency = require("../Dependency");
+const Module = require("../Module");
+const ModuleFactory = require("../ModuleFactory");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const CommonJsRequireDependency = require("../dependencies/CommonJsRequireDependency");
+const { registerNotSerializable } = require("../util/serialization");
+
+/** @typedef {import("../../declarations/WebpackOptions")} WebpackOptions */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../Module").BuildMeta} BuildMeta */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("../Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("../ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("../ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../dependencies/HarmonyImportDependency")} HarmonyImportDependency */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+
+/**
+ * @typedef {Object} BackendApi
+ * @property {function(Error=): void} dispose
+ * @property {function(Module): { client: string, data: string, active: boolean }} module
+ */
+
+const HMR_DEPENDENCY_TYPES = new Set([
+	"import.meta.webpackHot.accept",
+	"import.meta.webpackHot.decline",
+	"module.hot.accept",
+	"module.hot.decline"
+]);
+
+/**
+ * @param {undefined|string|RegExp|Function} test test option
+ * @param {Module} module the module
+ * @returns {boolean} true, if the module should be selected
+ */
+const checkTest = (test, module) => {
+	if (test === undefined) return true;
+	if (typeof test === "function") {
+		return test(module);
+	}
+	if (typeof test === "string") {
+		const name = module.nameForCondition();
+		return name && name.startsWith(test);
+	}
+	if (test instanceof RegExp) {
+		const name = module.nameForCondition();
+		return name && test.test(name);
+	}
+	return false;
+};
+
+const TYPES = new Set(["javascript"]);
+
+class LazyCompilationDependency extends Dependency {
+	constructor(proxyModule) {
+		super();
+		this.proxyModule = proxyModule;
+	}
+
+	get category() {
+		return "esm";
+	}
+
+	get type() {
+		return "lazy import()";
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return this.proxyModule.originalModule.identifier();
+	}
+}
+
+registerNotSerializable(LazyCompilationDependency);
+
+class LazyCompilationProxyModule extends Module {
+	constructor(context, originalModule, request, client, data, active) {
+		super("lazy-compilation-proxy", context, originalModule.layer);
+		this.originalModule = originalModule;
+		this.request = request;
+		this.client = client;
+		this.data = data;
+		this.active = active;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return `lazy-compilation-proxy|${this.originalModule.identifier()}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return `lazy-compilation-proxy ${this.originalModule.readableIdentifier(
+			requestShortener
+		)}`;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 * @param {Module} module fresh module
+	 * @returns {void}
+	 */
+	updateCacheModule(module) {
+		super.updateCacheModule(module);
+		const m = /** @type {LazyCompilationProxyModule} */ (module);
+		this.originalModule = m.originalModule;
+		this.request = m.request;
+		this.client = m.client;
+		this.data = m.data;
+		this.active = m.active;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return `${this.originalModule.libIdent(options)}!lazy-compilation-proxy`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		callback(null, !this.buildInfo || this.buildInfo.active !== this.active);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildInfo = {
+			active: this.active
+		};
+		/** @type {BuildMeta} */
+		this.buildMeta = {};
+		this.clearDependenciesAndBlocks();
+		const dep = new CommonJsRequireDependency(this.client);
+		this.addDependency(dep);
+		if (this.active) {
+			const dep = new LazyCompilationDependency(this);
+			const block = new AsyncDependenciesBlock({});
+			block.addDependency(dep);
+			this.addBlock(block);
+		}
+		callback();
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 200;
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({ runtimeTemplate, chunkGraph, moduleGraph }) {
+		const sources = new Map();
+		const runtimeRequirements = new Set();
+		runtimeRequirements.add(RuntimeGlobals.module);
+		const clientDep = /** @type {CommonJsRequireDependency} */ (
+			this.dependencies[0]
+		);
+		const clientModule = moduleGraph.getModule(clientDep);
+		const block = this.blocks[0];
+		const client = Template.asString([
+			`var client = ${runtimeTemplate.moduleExports({
+				module: clientModule,
+				chunkGraph,
+				request: clientDep.userRequest,
+				runtimeRequirements
+			})}`,
+			`var data = ${JSON.stringify(this.data)};`
+		]);
+		const keepActive = Template.asString([
+			`var dispose = client.keepAlive({ data: data, active: ${JSON.stringify(
+				!!block
+			)}, module: module, onError: onError });`
+		]);
+		let source;
+		if (block) {
+			const dep = block.dependencies[0];
+			const module = moduleGraph.getModule(dep);
+			source = Template.asString([
+				client,
+				`module.exports = ${runtimeTemplate.moduleNamespacePromise({
+					chunkGraph,
+					block,
+					module,
+					request: this.request,
+					strict: false, // TODO this should be inherited from the original module
+					message: "import()",
+					runtimeRequirements
+				})};`,
+				"if (module.hot) {",
+				Template.indent([
+					"module.hot.accept();",
+					`module.hot.accept(${JSON.stringify(
+						chunkGraph.getModuleId(module)
+					)}, function() { module.hot.invalidate(); });`,
+					"module.hot.dispose(function(data) { delete data.resolveSelf; dispose(data); });",
+					"if (module.hot.data && module.hot.data.resolveSelf) module.hot.data.resolveSelf(module.exports);"
+				]),
+				"}",
+				"function onError() { /* ignore */ }",
+				keepActive
+			]);
+		} else {
+			source = Template.asString([
+				client,
+				"var resolveSelf, onError;",
+				`module.exports = new Promise(function(resolve, reject) { resolveSelf = resolve; onError = reject; });`,
+				"if (module.hot) {",
+				Template.indent([
+					"module.hot.accept();",
+					"if (module.hot.data && module.hot.data.resolveSelf) module.hot.data.resolveSelf(module.exports);",
+					"module.hot.dispose(function(data) { data.resolveSelf = resolveSelf; dispose(data); });"
+				]),
+				"}",
+				keepActive
+			]);
+		}
+		sources.set("javascript", new RawSource(source));
+		return {
+			sources,
+			runtimeRequirements
+		};
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		super.updateHash(hash, context);
+		hash.update(this.active ? "active" : "");
+		hash.update(JSON.stringify(this.data));
+	}
+}
+
+registerNotSerializable(LazyCompilationProxyModule);
+
+class LazyCompilationDependencyFactory extends ModuleFactory {
+	constructor(factory) {
+		super();
+		this._factory = factory;
+	}
+
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		const dependency = /** @type {LazyCompilationDependency} */ (
+			data.dependencies[0]
+		);
+		callback(null, {
+			module: dependency.proxyModule.originalModule
+		});
+	}
+}
+
+class LazyCompilationPlugin {
+	/**
+	 * @param {Object} options options
+	 * @param {(function(Compiler, function(Error?, BackendApi?): void): void) | function(Compiler): Promise<BackendApi>} options.backend the backend
+	 * @param {boolean} options.entries true, when entries are lazy compiled
+	 * @param {boolean} options.imports true, when import() modules are lazy compiled
+	 * @param {RegExp | string | (function(Module): boolean)} options.test additional filter for lazy compiled entrypoint modules
+	 */
+	constructor({ backend, entries, imports, test }) {
+		this.backend = backend;
+		this.entries = entries;
+		this.imports = imports;
+		this.test = test;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		let backend;
+		compiler.hooks.beforeCompile.tapAsync(
+			"LazyCompilationPlugin",
+			(params, callback) => {
+				if (backend !== undefined) return callback();
+				const promise = this.backend(compiler, (err, result) => {
+					if (err) return callback(err);
+					backend = result;
+					callback();
+				});
+				if (promise && promise.then) {
+					promise.then(b => {
+						backend = b;
+						callback();
+					}, callback);
+				}
+			}
+		);
+		compiler.hooks.thisCompilation.tap(
+			"LazyCompilationPlugin",
+			(compilation, { normalModuleFactory }) => {
+				normalModuleFactory.hooks.module.tap(
+					"LazyCompilationPlugin",
+					(originalModule, createData, resolveData) => {
+						if (
+							resolveData.dependencies.every(dep =>
+								HMR_DEPENDENCY_TYPES.has(dep.type)
+							)
+						) {
+							// for HMR only resolving, try to determine if the HMR accept/decline refers to
+							// an import() or not
+							const hmrDep = resolveData.dependencies[0];
+							const originModule =
+								compilation.moduleGraph.getParentModule(hmrDep);
+							const isReferringToDynamicImport = originModule.blocks.some(
+								block =>
+									block.dependencies.some(
+										dep =>
+											dep.type === "import()" &&
+											/** @type {HarmonyImportDependency} */ (dep).request ===
+												hmrDep.request
+									)
+							);
+							if (!isReferringToDynamicImport) return;
+						} else if (
+							!resolveData.dependencies.every(
+								dep =>
+									HMR_DEPENDENCY_TYPES.has(dep.type) ||
+									(this.imports &&
+										(dep.type === "import()" ||
+											dep.type === "import() context element")) ||
+									(this.entries && dep.type === "entry")
+							)
+						)
+							return;
+						if (
+							/webpack[/\\]hot[/\\]|webpack-dev-server[/\\]client|webpack-hot-middleware[/\\]client/.test(
+								resolveData.request
+							) ||
+							!checkTest(this.test, originalModule)
+						)
+							return;
+						const moduleInfo = backend.module(originalModule);
+						if (!moduleInfo) return;
+						const { client, data, active } = moduleInfo;
+
+						return new LazyCompilationProxyModule(
+							compiler.context,
+							originalModule,
+							resolveData.request,
+							client,
+							data,
+							active
+						);
+					}
+				);
+				compilation.dependencyFactories.set(
+					LazyCompilationDependency,
+					new LazyCompilationDependencyFactory()
+				);
+			}
+		);
+		compiler.hooks.shutdown.tapAsync("LazyCompilationPlugin", callback => {
+			backend.dispose(callback);
+		});
+	}
+}
+
+module.exports = LazyCompilationPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/lazyCompilationBackend.js b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/lazyCompilationBackend.js
new file mode 100644
index 0000000..3f48055
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/hmr/lazyCompilationBackend.js
@@ -0,0 +1,143 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("http").ServerOptions} HttpServerOptions */
+/** @typedef {import("https").ServerOptions} HttpsServerOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LazyCompilationDefaultBackendOptions} LazyCompilationDefaultBackendOptions */
+/** @typedef {import("../Compiler")} Compiler */
+
+/**
+ * @callback BackendHandler
+ * @param {Compiler} compiler compiler
+ * @param {function((Error | null)=, any=): void} callback callback
+ * @returns {void}
+ */
+
+/**
+ * @param {Omit<LazyCompilationDefaultBackendOptions, "client"> & { client: NonNullable<LazyCompilationDefaultBackendOptions["client"]>}} options additional options for the backend
+ * @returns {BackendHandler} backend
+ */
+module.exports = options => (compiler, callback) => {
+	const logger = compiler.getInfrastructureLogger("LazyCompilationBackend");
+	const activeModules = new Map();
+	const prefix = "/lazy-compilation-using-";
+
+	const isHttps =
+		options.protocol === "https" ||
+		(typeof options.server === "object" &&
+			("key" in options.server || "pfx" in options.server));
+
+	const createServer =
+		typeof options.server === "function"
+			? options.server
+			: (() => {
+					const http = isHttps ? require("https") : require("http");
+					return http.createServer.bind(http, options.server);
+			  })();
+	const listen =
+		typeof options.listen === "function"
+			? options.listen
+			: server => {
+					let listen = options.listen;
+					if (typeof listen === "object" && !("port" in listen))
+						listen = { ...listen, port: undefined };
+					server.listen(listen);
+			  };
+
+	const protocol = options.protocol || (isHttps ? "https" : "http");
+
+	const requestListener = (req, res) => {
+		const keys = req.url.slice(prefix.length).split("@");
+		req.socket.on("close", () => {
+			setTimeout(() => {
+				for (const key of keys) {
+					const oldValue = activeModules.get(key) || 0;
+					activeModules.set(key, oldValue - 1);
+					if (oldValue === 1) {
+						logger.log(
+							`${key} is no longer in use. Next compilation will skip this module.`
+						);
+					}
+				}
+			}, 120000);
+		});
+		req.socket.setNoDelay(true);
+		res.writeHead(200, {
+			"content-type": "text/event-stream",
+			"Access-Control-Allow-Origin": "*",
+			"Access-Control-Allow-Methods": "*",
+			"Access-Control-Allow-Headers": "*"
+		});
+		res.write("\n");
+		let moduleActivated = false;
+		for (const key of keys) {
+			const oldValue = activeModules.get(key) || 0;
+			activeModules.set(key, oldValue + 1);
+			if (oldValue === 0) {
+				logger.log(`${key} is now in use and will be compiled.`);
+				moduleActivated = true;
+			}
+		}
+		if (moduleActivated && compiler.watching) compiler.watching.invalidate();
+	};
+
+	const server = /** @type {import("net").Server} */ (createServer());
+	server.on("request", requestListener);
+
+	let isClosing = false;
+	/** @type {Set<import("net").Socket>} */
+	const sockets = new Set();
+	server.on("connection", socket => {
+		sockets.add(socket);
+		socket.on("close", () => {
+			sockets.delete(socket);
+		});
+		if (isClosing) socket.destroy();
+	});
+	server.on("clientError", e => {
+		if (e.message !== "Server is disposing") logger.warn(e);
+	});
+	server.on("listening", err => {
+		if (err) return callback(err);
+		const addr = server.address();
+		if (typeof addr === "string") throw new Error("addr must not be a string");
+		const urlBase =
+			addr.address === "::" || addr.address === "0.0.0.0"
+				? `${protocol}://localhost:${addr.port}`
+				: addr.family === "IPv6"
+				? `${protocol}://[${addr.address}]:${addr.port}`
+				: `${protocol}://${addr.address}:${addr.port}`;
+		logger.log(
+			`Server-Sent-Events server for lazy compilation open at ${urlBase}.`
+		);
+		callback(null, {
+			dispose(callback) {
+				isClosing = true;
+				// Removing the listener is a workaround for a memory leak in node.js
+				server.off("request", requestListener);
+				server.close(err => {
+					callback(err);
+				});
+				for (const socket of sockets) {
+					socket.destroy(new Error("Server is disposing"));
+				}
+			},
+			module(originalModule) {
+				const key = `${encodeURIComponent(
+					originalModule.identifier().replace(/\\/g, "/").replace(/@/g, "_")
+				).replace(/%(2F|3A|24|26|2B|2C|3B|3D|3A)/g, decodeURIComponent)}`;
+				const active = activeModules.get(key) > 0;
+				return {
+					client: `${options.client}?${encodeURIComponent(urlBase + prefix)}`,
+					data: key,
+					active
+				};
+			}
+		});
+	});
+	listen(server);
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/ChunkModuleIdRangePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/ChunkModuleIdRangePlugin.js
new file mode 100644
index 0000000..4040edc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/ChunkModuleIdRangePlugin.js
@@ -0,0 +1,80 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { find } = require("../util/SetHelpers");
+const {
+	compareModulesByPreOrderIndexOrIdentifier,
+	compareModulesByPostOrderIndexOrIdentifier
+} = require("../util/comparators");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ChunkModuleIdRangePlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		compiler.hooks.compilation.tap("ChunkModuleIdRangePlugin", compilation => {
+			const moduleGraph = compilation.moduleGraph;
+			compilation.hooks.moduleIds.tap("ChunkModuleIdRangePlugin", modules => {
+				const chunkGraph = compilation.chunkGraph;
+				const chunk = find(
+					compilation.chunks,
+					chunk => chunk.name === options.name
+				);
+				if (!chunk) {
+					throw new Error(
+						`ChunkModuleIdRangePlugin: Chunk with name '${options.name}"' was not found`
+					);
+				}
+
+				let chunkModules;
+				if (options.order) {
+					let cmpFn;
+					switch (options.order) {
+						case "index":
+						case "preOrderIndex":
+							cmpFn = compareModulesByPreOrderIndexOrIdentifier(moduleGraph);
+							break;
+						case "index2":
+						case "postOrderIndex":
+							cmpFn = compareModulesByPostOrderIndexOrIdentifier(moduleGraph);
+							break;
+						default:
+							throw new Error(
+								"ChunkModuleIdRangePlugin: unexpected value of order"
+							);
+					}
+					chunkModules = chunkGraph.getOrderedChunkModules(chunk, cmpFn);
+				} else {
+					chunkModules = Array.from(modules)
+						.filter(m => {
+							return chunkGraph.isModuleInChunk(m, chunk);
+						})
+						.sort(compareModulesByPreOrderIndexOrIdentifier(moduleGraph));
+				}
+
+				let currentId = options.start || 0;
+				for (let i = 0; i < chunkModules.length; i++) {
+					const m = chunkModules[i];
+					if (m.needId && chunkGraph.getModuleId(m) === null) {
+						chunkGraph.setModuleId(m, currentId++);
+					}
+					if (options.end && currentId > options.end) break;
+				}
+			});
+		});
+	}
+}
+module.exports = ChunkModuleIdRangePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/DeterministicChunkIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/DeterministicChunkIdsPlugin.js
new file mode 100644
index 0000000..d0788ff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/DeterministicChunkIdsPlugin.js
@@ -0,0 +1,70 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const { compareChunksNatural } = require("../util/comparators");
+const {
+	getFullChunkName,
+	getUsedChunkIds,
+	assignDeterministicIds
+} = require("./IdHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class DeterministicChunkIdsPlugin {
+	constructor(options) {
+		this.options = options || {};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"DeterministicChunkIdsPlugin",
+			compilation => {
+				compilation.hooks.chunkIds.tap(
+					"DeterministicChunkIdsPlugin",
+					chunks => {
+						const chunkGraph = compilation.chunkGraph;
+						const context = this.options.context
+							? this.options.context
+							: compiler.context;
+						const maxLength = this.options.maxLength || 3;
+
+						const compareNatural = compareChunksNatural(chunkGraph);
+
+						const usedIds = getUsedChunkIds(compilation);
+						assignDeterministicIds(
+							Array.from(chunks).filter(chunk => {
+								return chunk.id === null;
+							}),
+							chunk =>
+								getFullChunkName(chunk, chunkGraph, context, compiler.root),
+							compareNatural,
+							(chunk, id) => {
+								const size = usedIds.size;
+								usedIds.add(`${id}`);
+								if (size === usedIds.size) return false;
+								chunk.id = id;
+								chunk.ids = [id];
+								return true;
+							},
+							[Math.pow(10, maxLength)],
+							10,
+							usedIds.size
+						);
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = DeterministicChunkIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/DeterministicModuleIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/DeterministicModuleIdsPlugin.js
new file mode 100644
index 0000000..ee4f72c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/DeterministicModuleIdsPlugin.js
@@ -0,0 +1,93 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const {
+	compareModulesByPreOrderIndexOrIdentifier
+} = require("../util/comparators");
+const {
+	getUsedModuleIdsAndModules,
+	getFullModuleName,
+	assignDeterministicIds
+} = require("./IdHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class DeterministicModuleIdsPlugin {
+	/**
+	 * @param {Object} options options
+	 * @param {string=} options.context context relative to which module identifiers are computed
+	 * @param {function(Module): boolean=} options.test selector function for modules
+	 * @param {number=} options.maxLength maximum id length in digits (used as starting point)
+	 * @param {number=} options.salt hash salt for ids
+	 * @param {boolean=} options.fixedLength do not increase the maxLength to find an optimal id space size
+	 * @param {boolean=} options.failOnConflict throw an error when id conflicts occur (instead of rehashing)
+	 */
+	constructor(options = {}) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"DeterministicModuleIdsPlugin",
+			compilation => {
+				compilation.hooks.moduleIds.tap("DeterministicModuleIdsPlugin", () => {
+					const chunkGraph = compilation.chunkGraph;
+					const context = this.options.context
+						? this.options.context
+						: compiler.context;
+					const maxLength = this.options.maxLength || 3;
+					const failOnConflict = this.options.failOnConflict || false;
+					const fixedLength = this.options.fixedLength || false;
+					const salt = this.options.salt || 0;
+					let conflicts = 0;
+
+					const [usedIds, modules] = getUsedModuleIdsAndModules(
+						compilation,
+						this.options.test
+					);
+					assignDeterministicIds(
+						modules,
+						module => getFullModuleName(module, context, compiler.root),
+						failOnConflict
+							? () => 0
+							: compareModulesByPreOrderIndexOrIdentifier(
+									compilation.moduleGraph
+							  ),
+						(module, id) => {
+							const size = usedIds.size;
+							usedIds.add(`${id}`);
+							if (size === usedIds.size) {
+								conflicts++;
+								return false;
+							}
+							chunkGraph.setModuleId(module, id);
+							return true;
+						},
+						[Math.pow(10, maxLength)],
+						fixedLength ? 0 : 10,
+						usedIds.size,
+						salt
+					);
+					if (failOnConflict && conflicts)
+						throw new Error(
+							`Assigning deterministic module ids has lead to ${conflicts} conflict${
+								conflicts > 1 ? "s" : ""
+							}.\nIncrease the 'maxLength' to increase the id space and make conflicts less likely (recommended when there are many conflicts or application is expected to grow), or add an 'salt' number to try another hash starting value in the same id space (recommended when there is only a single conflict).`
+						);
+				});
+			}
+		);
+	}
+}
+
+module.exports = DeterministicModuleIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/HashedModuleIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/HashedModuleIdsPlugin.js
new file mode 100644
index 0000000..585e12c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/HashedModuleIdsPlugin.js
@@ -0,0 +1,77 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const {
+	compareModulesByPreOrderIndexOrIdentifier
+} = require("../util/comparators");
+const createSchemaValidation = require("../util/create-schema-validation");
+const createHash = require("../util/createHash");
+const {
+	getUsedModuleIdsAndModules,
+	getFullModuleName
+} = require("./IdHelpers");
+
+/** @typedef {import("../../declarations/plugins/HashedModuleIdsPlugin").HashedModuleIdsPluginOptions} HashedModuleIdsPluginOptions */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/HashedModuleIdsPlugin.check.js"),
+	() => require("../../schemas/plugins/HashedModuleIdsPlugin.json"),
+	{
+		name: "Hashed Module Ids Plugin",
+		baseDataPath: "options"
+	}
+);
+
+class HashedModuleIdsPlugin {
+	/**
+	 * @param {HashedModuleIdsPluginOptions=} options options object
+	 */
+	constructor(options = {}) {
+		validate(options);
+
+		/** @type {HashedModuleIdsPluginOptions} */
+		this.options = {
+			context: null,
+			hashFunction: "md4",
+			hashDigest: "base64",
+			hashDigestLength: 4,
+			...options
+		};
+	}
+
+	apply(compiler) {
+		const options = this.options;
+		compiler.hooks.compilation.tap("HashedModuleIdsPlugin", compilation => {
+			compilation.hooks.moduleIds.tap("HashedModuleIdsPlugin", () => {
+				const chunkGraph = compilation.chunkGraph;
+				const context = this.options.context
+					? this.options.context
+					: compiler.context;
+
+				const [usedIds, modules] = getUsedModuleIdsAndModules(compilation);
+				const modulesInNaturalOrder = modules.sort(
+					compareModulesByPreOrderIndexOrIdentifier(compilation.moduleGraph)
+				);
+				for (const module of modulesInNaturalOrder) {
+					const ident = getFullModuleName(module, context, compiler.root);
+					const hash = createHash(options.hashFunction);
+					hash.update(ident || "");
+					const hashId = /** @type {string} */ (
+						hash.digest(options.hashDigest)
+					);
+					let len = options.hashDigestLength;
+					while (usedIds.has(hashId.substr(0, len))) len++;
+					const moduleId = hashId.substr(0, len);
+					chunkGraph.setModuleId(module, moduleId);
+					usedIds.add(moduleId);
+				}
+			});
+		});
+	}
+}
+
+module.exports = HashedModuleIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/IdHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/IdHelpers.js
new file mode 100644
index 0000000..9e011cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/IdHelpers.js
@@ -0,0 +1,477 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const createHash = require("../util/createHash");
+const { makePathsRelative } = require("../util/identifier");
+const numberHash = require("../util/numberHash");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Module")} Module */
+/** @typedef {typeof import("../util/Hash")} Hash */
+
+/**
+ * @param {string} str string to hash
+ * @param {number} len max length of the hash
+ * @param {string | Hash} hashFunction hash function to use
+ * @returns {string} hash
+ */
+const getHash = (str, len, hashFunction) => {
+	const hash = createHash(hashFunction);
+	hash.update(str);
+	const digest = /** @type {string} */ (hash.digest("hex"));
+	return digest.substr(0, len);
+};
+
+/**
+ * @param {string} str the string
+ * @returns {string} string prefixed by an underscore if it is a number
+ */
+const avoidNumber = str => {
+	// max length of a number is 21 chars, bigger numbers a written as "...e+xx"
+	if (str.length > 21) return str;
+	const firstChar = str.charCodeAt(0);
+	// skip everything that doesn't look like a number
+	// charCodes: "-": 45, "1": 49, "9": 57
+	if (firstChar < 49) {
+		if (firstChar !== 45) return str;
+	} else if (firstChar > 57) {
+		return str;
+	}
+	if (str === +str + "") {
+		return `_${str}`;
+	}
+	return str;
+};
+
+/**
+ * @param {string} request the request
+ * @returns {string} id representation
+ */
+const requestToId = request => {
+	return request
+		.replace(/^(\.\.?\/)+/, "")
+		.replace(/(^[.-]|[^a-zA-Z0-9_-])+/g, "_");
+};
+exports.requestToId = requestToId;
+
+/**
+ * @param {string} string the string
+ * @param {string} delimiter separator for string and hash
+ * @param {string | Hash} hashFunction hash function to use
+ * @returns {string} string with limited max length to 100 chars
+ */
+const shortenLongString = (string, delimiter, hashFunction) => {
+	if (string.length < 100) return string;
+	return (
+		string.slice(0, 100 - 6 - delimiter.length) +
+		delimiter +
+		getHash(string, 6, hashFunction)
+	);
+};
+
+/**
+ * @param {Module} module the module
+ * @param {string} context context directory
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {string} short module name
+ */
+const getShortModuleName = (module, context, associatedObjectForCache) => {
+	const libIdent = module.libIdent({ context, associatedObjectForCache });
+	if (libIdent) return avoidNumber(libIdent);
+	const nameForCondition = module.nameForCondition();
+	if (nameForCondition)
+		return avoidNumber(
+			makePathsRelative(context, nameForCondition, associatedObjectForCache)
+		);
+	return "";
+};
+exports.getShortModuleName = getShortModuleName;
+
+/**
+ * @param {string} shortName the short name
+ * @param {Module} module the module
+ * @param {string} context context directory
+ * @param {string | Hash} hashFunction hash function to use
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {string} long module name
+ */
+const getLongModuleName = (
+	shortName,
+	module,
+	context,
+	hashFunction,
+	associatedObjectForCache
+) => {
+	const fullName = getFullModuleName(module, context, associatedObjectForCache);
+	return `${shortName}?${getHash(fullName, 4, hashFunction)}`;
+};
+exports.getLongModuleName = getLongModuleName;
+
+/**
+ * @param {Module} module the module
+ * @param {string} context context directory
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {string} full module name
+ */
+const getFullModuleName = (module, context, associatedObjectForCache) => {
+	return makePathsRelative(
+		context,
+		module.identifier(),
+		associatedObjectForCache
+	);
+};
+exports.getFullModuleName = getFullModuleName;
+
+/**
+ * @param {Chunk} chunk the chunk
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {string} context context directory
+ * @param {string} delimiter delimiter for names
+ * @param {string | Hash} hashFunction hash function to use
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {string} short chunk name
+ */
+const getShortChunkName = (
+	chunk,
+	chunkGraph,
+	context,
+	delimiter,
+	hashFunction,
+	associatedObjectForCache
+) => {
+	const modules = chunkGraph.getChunkRootModules(chunk);
+	const shortModuleNames = modules.map(m =>
+		requestToId(getShortModuleName(m, context, associatedObjectForCache))
+	);
+	chunk.idNameHints.sort();
+	const chunkName = Array.from(chunk.idNameHints)
+		.concat(shortModuleNames)
+		.filter(Boolean)
+		.join(delimiter);
+	return shortenLongString(chunkName, delimiter, hashFunction);
+};
+exports.getShortChunkName = getShortChunkName;
+
+/**
+ * @param {Chunk} chunk the chunk
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {string} context context directory
+ * @param {string} delimiter delimiter for names
+ * @param {string | Hash} hashFunction hash function to use
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {string} short chunk name
+ */
+const getLongChunkName = (
+	chunk,
+	chunkGraph,
+	context,
+	delimiter,
+	hashFunction,
+	associatedObjectForCache
+) => {
+	const modules = chunkGraph.getChunkRootModules(chunk);
+	const shortModuleNames = modules.map(m =>
+		requestToId(getShortModuleName(m, context, associatedObjectForCache))
+	);
+	const longModuleNames = modules.map(m =>
+		requestToId(
+			getLongModuleName("", m, context, hashFunction, associatedObjectForCache)
+		)
+	);
+	chunk.idNameHints.sort();
+	const chunkName = Array.from(chunk.idNameHints)
+		.concat(shortModuleNames, longModuleNames)
+		.filter(Boolean)
+		.join(delimiter);
+	return shortenLongString(chunkName, delimiter, hashFunction);
+};
+exports.getLongChunkName = getLongChunkName;
+
+/**
+ * @param {Chunk} chunk the chunk
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {string} context context directory
+ * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+ * @returns {string} full chunk name
+ */
+const getFullChunkName = (
+	chunk,
+	chunkGraph,
+	context,
+	associatedObjectForCache
+) => {
+	if (chunk.name) return chunk.name;
+	const modules = chunkGraph.getChunkRootModules(chunk);
+	const fullModuleNames = modules.map(m =>
+		makePathsRelative(context, m.identifier(), associatedObjectForCache)
+	);
+	return fullModuleNames.join();
+};
+exports.getFullChunkName = getFullChunkName;
+
+/**
+ * @template K
+ * @template V
+ * @param {Map<K, V[]>} map a map from key to values
+ * @param {K} key key
+ * @param {V} value value
+ * @returns {void}
+ */
+const addToMapOfItems = (map, key, value) => {
+	let array = map.get(key);
+	if (array === undefined) {
+		array = [];
+		map.set(key, array);
+	}
+	array.push(value);
+};
+
+/**
+ * @param {Compilation} compilation the compilation
+ * @param {function(Module): boolean=} filter filter modules
+ * @returns {[Set<string>, Module[]]} used module ids as strings and modules without id matching the filter
+ */
+const getUsedModuleIdsAndModules = (compilation, filter) => {
+	const chunkGraph = compilation.chunkGraph;
+
+	const modules = [];
+
+	/** @type {Set<string>} */
+	const usedIds = new Set();
+	if (compilation.usedModuleIds) {
+		for (const id of compilation.usedModuleIds) {
+			usedIds.add(id + "");
+		}
+	}
+
+	for (const module of compilation.modules) {
+		if (!module.needId) continue;
+		const moduleId = chunkGraph.getModuleId(module);
+		if (moduleId !== null) {
+			usedIds.add(moduleId + "");
+		} else {
+			if (
+				(!filter || filter(module)) &&
+				chunkGraph.getNumberOfModuleChunks(module) !== 0
+			) {
+				modules.push(module);
+			}
+		}
+	}
+
+	return [usedIds, modules];
+};
+exports.getUsedModuleIdsAndModules = getUsedModuleIdsAndModules;
+
+/**
+ * @param {Compilation} compilation the compilation
+ * @returns {Set<string>} used chunk ids as strings
+ */
+const getUsedChunkIds = compilation => {
+	/** @type {Set<string>} */
+	const usedIds = new Set();
+	if (compilation.usedChunkIds) {
+		for (const id of compilation.usedChunkIds) {
+			usedIds.add(id + "");
+		}
+	}
+
+	for (const chunk of compilation.chunks) {
+		const chunkId = chunk.id;
+		if (chunkId !== null) {
+			usedIds.add(chunkId + "");
+		}
+	}
+
+	return usedIds;
+};
+exports.getUsedChunkIds = getUsedChunkIds;
+
+/**
+ * @template T
+ * @param {Iterable<T>} items list of items to be named
+ * @param {function(T): string} getShortName get a short name for an item
+ * @param {function(T, string): string} getLongName get a long name for an item
+ * @param {function(T, T): -1|0|1} comparator order of items
+ * @param {Set<string>} usedIds already used ids, will not be assigned
+ * @param {function(T, string): void} assignName assign a name to an item
+ * @returns {T[]} list of items without a name
+ */
+const assignNames = (
+	items,
+	getShortName,
+	getLongName,
+	comparator,
+	usedIds,
+	assignName
+) => {
+	/** @type {Map<string, T[]>} */
+	const nameToItems = new Map();
+
+	for (const item of items) {
+		const name = getShortName(item);
+		addToMapOfItems(nameToItems, name, item);
+	}
+
+	/** @type {Map<string, T[]>} */
+	const nameToItems2 = new Map();
+
+	for (const [name, items] of nameToItems) {
+		if (items.length > 1 || !name) {
+			for (const item of items) {
+				const longName = getLongName(item, name);
+				addToMapOfItems(nameToItems2, longName, item);
+			}
+		} else {
+			addToMapOfItems(nameToItems2, name, items[0]);
+		}
+	}
+
+	/** @type {T[]} */
+	const unnamedItems = [];
+
+	for (const [name, items] of nameToItems2) {
+		if (!name) {
+			for (const item of items) {
+				unnamedItems.push(item);
+			}
+		} else if (items.length === 1 && !usedIds.has(name)) {
+			assignName(items[0], name);
+			usedIds.add(name);
+		} else {
+			items.sort(comparator);
+			let i = 0;
+			for (const item of items) {
+				while (nameToItems2.has(name + i) && usedIds.has(name + i)) i++;
+				assignName(item, name + i);
+				usedIds.add(name + i);
+				i++;
+			}
+		}
+	}
+
+	unnamedItems.sort(comparator);
+	return unnamedItems;
+};
+exports.assignNames = assignNames;
+
+/**
+ * @template T
+ * @param {T[]} items list of items to be named
+ * @param {function(T): string} getName get a name for an item
+ * @param {function(T, T): -1|0|1} comparator order of items
+ * @param {function(T, number): boolean} assignId assign an id to an item
+ * @param {number[]} ranges usable ranges for ids
+ * @param {number} expandFactor factor to create more ranges
+ * @param {number} extraSpace extra space to allocate, i. e. when some ids are already used
+ * @param {number} salt salting number to initialize hashing
+ * @returns {void}
+ */
+const assignDeterministicIds = (
+	items,
+	getName,
+	comparator,
+	assignId,
+	ranges = [10],
+	expandFactor = 10,
+	extraSpace = 0,
+	salt = 0
+) => {
+	items.sort(comparator);
+
+	// max 5% fill rate
+	const optimalRange = Math.min(
+		Math.ceil(items.length * 20) + extraSpace,
+		Number.MAX_SAFE_INTEGER
+	);
+
+	let i = 0;
+	let range = ranges[i];
+	while (range < optimalRange) {
+		i++;
+		if (i < ranges.length) {
+			range = Math.min(ranges[i], Number.MAX_SAFE_INTEGER);
+		} else if (expandFactor) {
+			range = Math.min(range * expandFactor, Number.MAX_SAFE_INTEGER);
+		} else {
+			break;
+		}
+	}
+
+	for (const item of items) {
+		const ident = getName(item);
+		let id;
+		let i = salt;
+		do {
+			id = numberHash(ident + i++, range);
+		} while (!assignId(item, id));
+	}
+};
+exports.assignDeterministicIds = assignDeterministicIds;
+
+/**
+ * @param {Set<string>} usedIds used ids
+ * @param {Iterable<Module>} modules the modules
+ * @param {Compilation} compilation the compilation
+ * @returns {void}
+ */
+const assignAscendingModuleIds = (usedIds, modules, compilation) => {
+	const chunkGraph = compilation.chunkGraph;
+
+	let nextId = 0;
+	let assignId;
+	if (usedIds.size > 0) {
+		assignId = module => {
+			if (chunkGraph.getModuleId(module) === null) {
+				while (usedIds.has(nextId + "")) nextId++;
+				chunkGraph.setModuleId(module, nextId++);
+			}
+		};
+	} else {
+		assignId = module => {
+			if (chunkGraph.getModuleId(module) === null) {
+				chunkGraph.setModuleId(module, nextId++);
+			}
+		};
+	}
+	for (const module of modules) {
+		assignId(module);
+	}
+};
+exports.assignAscendingModuleIds = assignAscendingModuleIds;
+
+/**
+ * @param {Iterable<Chunk>} chunks the chunks
+ * @param {Compilation} compilation the compilation
+ * @returns {void}
+ */
+const assignAscendingChunkIds = (chunks, compilation) => {
+	const usedIds = getUsedChunkIds(compilation);
+
+	let nextId = 0;
+	if (usedIds.size > 0) {
+		for (const chunk of chunks) {
+			if (chunk.id === null) {
+				while (usedIds.has(nextId + "")) nextId++;
+				chunk.id = nextId;
+				chunk.ids = [nextId];
+				nextId++;
+			}
+		}
+	} else {
+		for (const chunk of chunks) {
+			if (chunk.id === null) {
+				chunk.id = nextId;
+				chunk.ids = [nextId];
+				nextId++;
+			}
+		}
+	}
+};
+exports.assignAscendingChunkIds = assignAscendingChunkIds;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NamedChunkIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NamedChunkIdsPlugin.js
new file mode 100644
index 0000000..1b5c875
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NamedChunkIdsPlugin.js
@@ -0,0 +1,81 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { compareChunksNatural } = require("../util/comparators");
+const {
+	getShortChunkName,
+	getLongChunkName,
+	assignNames,
+	getUsedChunkIds,
+	assignAscendingChunkIds
+} = require("./IdHelpers");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class NamedChunkIdsPlugin {
+	constructor(options) {
+		this.delimiter = (options && options.delimiter) || "-";
+		this.context = options && options.context;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("NamedChunkIdsPlugin", compilation => {
+			const { hashFunction } = compilation.outputOptions;
+			compilation.hooks.chunkIds.tap("NamedChunkIdsPlugin", chunks => {
+				const chunkGraph = compilation.chunkGraph;
+				const context = this.context ? this.context : compiler.context;
+				const delimiter = this.delimiter;
+
+				const unnamedChunks = assignNames(
+					Array.from(chunks).filter(chunk => {
+						if (chunk.name) {
+							chunk.id = chunk.name;
+							chunk.ids = [chunk.name];
+						}
+						return chunk.id === null;
+					}),
+					chunk =>
+						getShortChunkName(
+							chunk,
+							chunkGraph,
+							context,
+							delimiter,
+							hashFunction,
+							compiler.root
+						),
+					chunk =>
+						getLongChunkName(
+							chunk,
+							chunkGraph,
+							context,
+							delimiter,
+							hashFunction,
+							compiler.root
+						),
+					compareChunksNatural(chunkGraph),
+					getUsedChunkIds(compilation),
+					(chunk, name) => {
+						chunk.id = name;
+						chunk.ids = [name];
+					}
+				);
+				if (unnamedChunks.length > 0) {
+					assignAscendingChunkIds(unnamedChunks, compilation);
+				}
+			});
+		});
+	}
+}
+
+module.exports = NamedChunkIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NamedModuleIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NamedModuleIdsPlugin.js
new file mode 100644
index 0000000..97120d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NamedModuleIdsPlugin.js
@@ -0,0 +1,58 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { compareModulesByIdentifier } = require("../util/comparators");
+const {
+	getShortModuleName,
+	getLongModuleName,
+	assignNames,
+	getUsedModuleIdsAndModules,
+	assignAscendingModuleIds
+} = require("./IdHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class NamedModuleIdsPlugin {
+	constructor(options) {
+		this.options = options || {};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { root } = compiler;
+		compiler.hooks.compilation.tap("NamedModuleIdsPlugin", compilation => {
+			const { hashFunction } = compilation.outputOptions;
+			compilation.hooks.moduleIds.tap("NamedModuleIdsPlugin", () => {
+				const chunkGraph = compilation.chunkGraph;
+				const context = this.options.context
+					? this.options.context
+					: compiler.context;
+
+				const [usedIds, modules] = getUsedModuleIdsAndModules(compilation);
+				const unnamedModules = assignNames(
+					modules,
+					m => getShortModuleName(m, context, root),
+					(m, shortName) =>
+						getLongModuleName(shortName, m, context, hashFunction, root),
+					compareModulesByIdentifier,
+					usedIds,
+					(m, name) => chunkGraph.setModuleId(m, name)
+				);
+				if (unnamedModules.length > 0) {
+					assignAscendingModuleIds(usedIds, unnamedModules, compilation);
+				}
+			});
+		});
+	}
+}
+
+module.exports = NamedModuleIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NaturalChunkIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NaturalChunkIdsPlugin.js
new file mode 100644
index 0000000..5329ac5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NaturalChunkIdsPlugin.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { compareChunksNatural } = require("../util/comparators");
+const { assignAscendingChunkIds } = require("./IdHelpers");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class NaturalChunkIdsPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("NaturalChunkIdsPlugin", compilation => {
+			compilation.hooks.chunkIds.tap("NaturalChunkIdsPlugin", chunks => {
+				const chunkGraph = compilation.chunkGraph;
+				const compareNatural = compareChunksNatural(chunkGraph);
+				const chunksInNaturalOrder = Array.from(chunks).sort(compareNatural);
+				assignAscendingChunkIds(chunksInNaturalOrder, compilation);
+			});
+		});
+	}
+}
+
+module.exports = NaturalChunkIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NaturalModuleIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NaturalModuleIdsPlugin.js
new file mode 100644
index 0000000..962bcff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/NaturalModuleIdsPlugin.js
@@ -0,0 +1,39 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Florent Cailhol @ooflorent
+*/
+
+"use strict";
+
+const {
+	compareModulesByPreOrderIndexOrIdentifier
+} = require("../util/comparators");
+const {
+	assignAscendingModuleIds,
+	getUsedModuleIdsAndModules
+} = require("./IdHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class NaturalModuleIdsPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("NaturalModuleIdsPlugin", compilation => {
+			compilation.hooks.moduleIds.tap("NaturalModuleIdsPlugin", modules => {
+				const [usedIds, modulesInNaturalOrder] =
+					getUsedModuleIdsAndModules(compilation);
+				modulesInNaturalOrder.sort(
+					compareModulesByPreOrderIndexOrIdentifier(compilation.moduleGraph)
+				);
+				assignAscendingModuleIds(usedIds, modulesInNaturalOrder, compilation);
+			});
+		});
+	}
+}
+
+module.exports = NaturalModuleIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/OccurrenceChunkIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/OccurrenceChunkIdsPlugin.js
new file mode 100644
index 0000000..432aa67
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/OccurrenceChunkIdsPlugin.js
@@ -0,0 +1,80 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { compareChunksNatural } = require("../util/comparators");
+const createSchemaValidation = require("../util/create-schema-validation");
+const { assignAscendingChunkIds } = require("./IdHelpers");
+
+/** @typedef {import("../../declarations/plugins/ids/OccurrenceChunkIdsPlugin").OccurrenceChunkIdsPluginOptions} OccurrenceChunkIdsPluginOptions */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/ids/OccurrenceChunkIdsPlugin.check.js"),
+	() => require("../../schemas/plugins/ids/OccurrenceChunkIdsPlugin.json"),
+	{
+		name: "Occurrence Order Chunk Ids Plugin",
+		baseDataPath: "options"
+	}
+);
+
+class OccurrenceChunkIdsPlugin {
+	/**
+	 * @param {OccurrenceChunkIdsPluginOptions=} options options object
+	 */
+	constructor(options = {}) {
+		validate(options);
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const prioritiseInitial = this.options.prioritiseInitial;
+		compiler.hooks.compilation.tap("OccurrenceChunkIdsPlugin", compilation => {
+			compilation.hooks.chunkIds.tap("OccurrenceChunkIdsPlugin", chunks => {
+				const chunkGraph = compilation.chunkGraph;
+
+				/** @type {Map<Chunk, number>} */
+				const occursInInitialChunksMap = new Map();
+
+				const compareNatural = compareChunksNatural(chunkGraph);
+
+				for (const c of chunks) {
+					let occurs = 0;
+					for (const chunkGroup of c.groupsIterable) {
+						for (const parent of chunkGroup.parentsIterable) {
+							if (parent.isInitial()) occurs++;
+						}
+					}
+					occursInInitialChunksMap.set(c, occurs);
+				}
+
+				const chunksInOccurrenceOrder = Array.from(chunks).sort((a, b) => {
+					if (prioritiseInitial) {
+						const aEntryOccurs = occursInInitialChunksMap.get(a);
+						const bEntryOccurs = occursInInitialChunksMap.get(b);
+						if (aEntryOccurs > bEntryOccurs) return -1;
+						if (aEntryOccurs < bEntryOccurs) return 1;
+					}
+					const aOccurs = a.getNumberOfGroups();
+					const bOccurs = b.getNumberOfGroups();
+					if (aOccurs > bOccurs) return -1;
+					if (aOccurs < bOccurs) return 1;
+					return compareNatural(a, b);
+				});
+				assignAscendingChunkIds(chunksInOccurrenceOrder, compilation);
+			});
+		});
+	}
+}
+
+module.exports = OccurrenceChunkIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/OccurrenceModuleIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/OccurrenceModuleIdsPlugin.js
new file mode 100644
index 0000000..a135b09
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/OccurrenceModuleIdsPlugin.js
@@ -0,0 +1,159 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const {
+	compareModulesByPreOrderIndexOrIdentifier
+} = require("../util/comparators");
+const createSchemaValidation = require("../util/create-schema-validation");
+const {
+	assignAscendingModuleIds,
+	getUsedModuleIdsAndModules
+} = require("./IdHelpers");
+
+/** @typedef {import("../../declarations/plugins/ids/OccurrenceModuleIdsPlugin").OccurrenceModuleIdsPluginOptions} OccurrenceModuleIdsPluginOptions */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/ids/OccurrenceModuleIdsPlugin.check.js"),
+	() => require("../../schemas/plugins/ids/OccurrenceModuleIdsPlugin.json"),
+	{
+		name: "Occurrence Order Module Ids Plugin",
+		baseDataPath: "options"
+	}
+);
+
+class OccurrenceModuleIdsPlugin {
+	/**
+	 * @param {OccurrenceModuleIdsPluginOptions=} options options object
+	 */
+	constructor(options = {}) {
+		validate(options);
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const prioritiseInitial = this.options.prioritiseInitial;
+		compiler.hooks.compilation.tap("OccurrenceModuleIdsPlugin", compilation => {
+			const moduleGraph = compilation.moduleGraph;
+
+			compilation.hooks.moduleIds.tap("OccurrenceModuleIdsPlugin", () => {
+				const chunkGraph = compilation.chunkGraph;
+
+				const [usedIds, modulesInOccurrenceOrder] =
+					getUsedModuleIdsAndModules(compilation);
+
+				const occursInInitialChunksMap = new Map();
+				const occursInAllChunksMap = new Map();
+
+				const initialChunkChunkMap = new Map();
+				const entryCountMap = new Map();
+				for (const m of modulesInOccurrenceOrder) {
+					let initial = 0;
+					let entry = 0;
+					for (const c of chunkGraph.getModuleChunksIterable(m)) {
+						if (c.canBeInitial()) initial++;
+						if (chunkGraph.isEntryModuleInChunk(m, c)) entry++;
+					}
+					initialChunkChunkMap.set(m, initial);
+					entryCountMap.set(m, entry);
+				}
+
+				/**
+				 * @param {Module} module module
+				 * @returns {number} count of occurs
+				 */
+				const countOccursInEntry = module => {
+					let sum = 0;
+					for (const [
+						originModule,
+						connections
+					] of moduleGraph.getIncomingConnectionsByOriginModule(module)) {
+						if (!originModule) continue;
+						if (!connections.some(c => c.isTargetActive(undefined))) continue;
+						sum += initialChunkChunkMap.get(originModule);
+					}
+					return sum;
+				};
+
+				/**
+				 * @param {Module} module module
+				 * @returns {number} count of occurs
+				 */
+				const countOccurs = module => {
+					let sum = 0;
+					for (const [
+						originModule,
+						connections
+					] of moduleGraph.getIncomingConnectionsByOriginModule(module)) {
+						if (!originModule) continue;
+						const chunkModules =
+							chunkGraph.getNumberOfModuleChunks(originModule);
+						for (const c of connections) {
+							if (!c.isTargetActive(undefined)) continue;
+							if (!c.dependency) continue;
+							const factor = c.dependency.getNumberOfIdOccurrences();
+							if (factor === 0) continue;
+							sum += factor * chunkModules;
+						}
+					}
+					return sum;
+				};
+
+				if (prioritiseInitial) {
+					for (const m of modulesInOccurrenceOrder) {
+						const result =
+							countOccursInEntry(m) +
+							initialChunkChunkMap.get(m) +
+							entryCountMap.get(m);
+						occursInInitialChunksMap.set(m, result);
+					}
+				}
+
+				for (const m of modulesInOccurrenceOrder) {
+					const result =
+						countOccurs(m) +
+						chunkGraph.getNumberOfModuleChunks(m) +
+						entryCountMap.get(m);
+					occursInAllChunksMap.set(m, result);
+				}
+
+				const naturalCompare = compareModulesByPreOrderIndexOrIdentifier(
+					compilation.moduleGraph
+				);
+
+				modulesInOccurrenceOrder.sort((a, b) => {
+					if (prioritiseInitial) {
+						const aEntryOccurs = occursInInitialChunksMap.get(a);
+						const bEntryOccurs = occursInInitialChunksMap.get(b);
+						if (aEntryOccurs > bEntryOccurs) return -1;
+						if (aEntryOccurs < bEntryOccurs) return 1;
+					}
+					const aOccurs = occursInAllChunksMap.get(a);
+					const bOccurs = occursInAllChunksMap.get(b);
+					if (aOccurs > bOccurs) return -1;
+					if (aOccurs < bOccurs) return 1;
+					return naturalCompare(a, b);
+				});
+
+				assignAscendingModuleIds(
+					usedIds,
+					modulesInOccurrenceOrder,
+					compilation
+				);
+			});
+		});
+	}
+}
+
+module.exports = OccurrenceModuleIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/ids/SyncModuleIdsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/SyncModuleIdsPlugin.js
new file mode 100644
index 0000000..8ab5ac7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/ids/SyncModuleIdsPlugin.js
@@ -0,0 +1,140 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { WebpackError } = require("..");
+const { getUsedModuleIdsAndModules } = require("./IdHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+const plugin = "SyncModuleIdsPlugin";
+
+class SyncModuleIdsPlugin {
+	/**
+	 * @param {Object} options options
+	 * @param {string} options.path path to file
+	 * @param {string=} options.context context for module names
+	 * @param {function(Module): boolean} options.test selector for modules
+	 * @param {"read" | "create" | "merge" | "update"=} options.mode operation mode (defaults to merge)
+	 */
+	constructor({ path, context, test, mode }) {
+		this._path = path;
+		this._context = context;
+		this._test = test || (() => true);
+		const readAndWrite = !mode || mode === "merge" || mode === "update";
+		this._read = readAndWrite || mode === "read";
+		this._write = readAndWrite || mode === "create";
+		this._prune = mode === "update";
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		/** @type {Map<string, string | number>} */
+		let data;
+		let dataChanged = false;
+		if (this._read) {
+			compiler.hooks.readRecords.tapAsync(plugin, callback => {
+				const fs = compiler.intermediateFileSystem;
+				fs.readFile(this._path, (err, buffer) => {
+					if (err) {
+						if (err.code !== "ENOENT") {
+							return callback(err);
+						}
+						return callback();
+					}
+					const json = JSON.parse(buffer.toString());
+					data = new Map();
+					for (const key of Object.keys(json)) {
+						data.set(key, json[key]);
+					}
+					dataChanged = false;
+					return callback();
+				});
+			});
+		}
+		if (this._write) {
+			compiler.hooks.emitRecords.tapAsync(plugin, callback => {
+				if (!data || !dataChanged) return callback();
+				const json = {};
+				const sorted = Array.from(data).sort(([a], [b]) => (a < b ? -1 : 1));
+				for (const [key, value] of sorted) {
+					json[key] = value;
+				}
+				const fs = compiler.intermediateFileSystem;
+				fs.writeFile(this._path, JSON.stringify(json), callback);
+			});
+		}
+		compiler.hooks.thisCompilation.tap(plugin, compilation => {
+			const associatedObjectForCache = compiler.root;
+			const context = this._context || compiler.context;
+			if (this._read) {
+				compilation.hooks.reviveModules.tap(plugin, (_1, _2) => {
+					if (!data) return;
+					const { chunkGraph } = compilation;
+					const [usedIds, modules] = getUsedModuleIdsAndModules(
+						compilation,
+						this._test
+					);
+					for (const module of modules) {
+						const name = module.libIdent({
+							context,
+							associatedObjectForCache
+						});
+						if (!name) continue;
+						const id = data.get(name);
+						const idAsString = `${id}`;
+						if (usedIds.has(idAsString)) {
+							const err = new WebpackError(
+								`SyncModuleIdsPlugin: Unable to restore id '${id}' from '${this._path}' as it's already used.`
+							);
+							err.module = module;
+							compilation.errors.push(err);
+						}
+						chunkGraph.setModuleId(module, id);
+						usedIds.add(idAsString);
+					}
+				});
+			}
+			if (this._write) {
+				compilation.hooks.recordModules.tap(plugin, modules => {
+					const { chunkGraph } = compilation;
+					let oldData = data;
+					if (!oldData) {
+						oldData = data = new Map();
+					} else if (this._prune) {
+						data = new Map();
+					}
+					for (const module of modules) {
+						if (this._test(module)) {
+							const name = module.libIdent({
+								context,
+								associatedObjectForCache
+							});
+							if (!name) continue;
+							const id = chunkGraph.getModuleId(module);
+							if (id === null) continue;
+							const oldId = oldData.get(name);
+							if (oldId !== id) {
+								dataChanged = true;
+							} else if (data === oldData) {
+								continue;
+							}
+							data.set(name, id);
+						}
+					}
+					if (data.size !== oldData.size) dataChanged = true;
+				});
+			}
+		});
+	}
+}
+
+module.exports = SyncModuleIdsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/index.js b/node_modules/mathjs/examples/node_modules/webpack/lib/index.js
new file mode 100644
index 0000000..a97e9df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/index.js
@@ -0,0 +1,579 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const memoize = require("./util/memoize");
+
+/** @typedef {import("../declarations/WebpackOptions").Entry} Entry */
+/** @typedef {import("../declarations/WebpackOptions").EntryNormalized} EntryNormalized */
+/** @typedef {import("../declarations/WebpackOptions").EntryObject} EntryObject */
+/** @typedef {import("../declarations/WebpackOptions").FileCacheOptions} FileCacheOptions */
+/** @typedef {import("../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../declarations/WebpackOptions").ModuleOptions} ModuleOptions */
+/** @typedef {import("../declarations/WebpackOptions").ResolveOptions} ResolveOptions */
+/** @typedef {import("../declarations/WebpackOptions").RuleSetCondition} RuleSetCondition */
+/** @typedef {import("../declarations/WebpackOptions").RuleSetConditionAbsolute} RuleSetConditionAbsolute */
+/** @typedef {import("../declarations/WebpackOptions").RuleSetRule} RuleSetRule */
+/** @typedef {import("../declarations/WebpackOptions").RuleSetUse} RuleSetUse */
+/** @typedef {import("../declarations/WebpackOptions").RuleSetUseItem} RuleSetUseItem */
+/** @typedef {import("../declarations/WebpackOptions").StatsOptions} StatsOptions */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptions} Configuration */
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptionsNormalized */
+/** @typedef {import("../declarations/WebpackOptions").WebpackPluginFunction} WebpackPluginFunction */
+/** @typedef {import("../declarations/WebpackOptions").WebpackPluginInstance} WebpackPluginInstance */
+/** @typedef {import("./Compilation").Asset} Asset */
+/** @typedef {import("./Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("./Compilation").EntryOptions} EntryOptions */
+/** @typedef {import("./Compiler").AssetEmittedInfo} AssetEmittedInfo */
+/** @typedef {import("./MultiStats")} MultiStats */
+/** @typedef {import("./Parser").ParserState} ParserState */
+/** @typedef {import("./ResolverFactory").ResolvePluginInstance} ResolvePluginInstance */
+/** @typedef {import("./ResolverFactory").Resolver} Resolver */
+/** @typedef {import("./Watching")} Watching */
+/** @typedef {import("./cli").Argument} Argument */
+/** @typedef {import("./cli").Problem} Problem */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsAsset} StatsAsset */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsChunk} StatsChunk */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsChunkGroup} StatsChunkGroup */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsChunkOrigin} StatsChunkOrigin */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsCompilation} StatsCompilation */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsError} StatsError */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsLogging} StatsLogging */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsLoggingEntry} StatsLoggingEntry */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsModule} StatsModule */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsModuleIssuer} StatsModuleIssuer */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsModuleReason} StatsModuleReason */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsModuleTraceDependency} StatsModuleTraceDependency */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsModuleTraceItem} StatsModuleTraceItem */
+/** @typedef {import("./stats/DefaultStatsFactoryPlugin").StatsProfile} StatsProfile */
+
+/**
+ * @template {Function} T
+ * @param {function(): T} factory factory function
+ * @returns {T} function
+ */
+const lazyFunction = factory => {
+	const fac = memoize(factory);
+	const f = /** @type {any} */ (
+		(...args) => {
+			return fac()(...args);
+		}
+	);
+	return /** @type {T} */ (f);
+};
+
+/**
+ * @template A
+ * @template B
+ * @param {A} obj input a
+ * @param {B} exports input b
+ * @returns {A & B} merged
+ */
+const mergeExports = (obj, exports) => {
+	const descriptors = Object.getOwnPropertyDescriptors(exports);
+	for (const name of Object.keys(descriptors)) {
+		const descriptor = descriptors[name];
+		if (descriptor.get) {
+			const fn = descriptor.get;
+			Object.defineProperty(obj, name, {
+				configurable: false,
+				enumerable: true,
+				get: memoize(fn)
+			});
+		} else if (typeof descriptor.value === "object") {
+			Object.defineProperty(obj, name, {
+				configurable: false,
+				enumerable: true,
+				writable: false,
+				value: mergeExports({}, descriptor.value)
+			});
+		} else {
+			throw new Error(
+				"Exposed values must be either a getter or an nested object"
+			);
+		}
+	}
+	return /** @type {A & B} */ (Object.freeze(obj));
+};
+
+const fn = lazyFunction(() => require("./webpack"));
+module.exports = mergeExports(fn, {
+	get webpack() {
+		return require("./webpack");
+	},
+	get validate() {
+		const webpackOptionsSchemaCheck = require("../schemas/WebpackOptions.check.js");
+		const getRealValidate = memoize(() => {
+			const validateSchema = require("./validateSchema");
+			const webpackOptionsSchema = require("../schemas/WebpackOptions.json");
+			return options => validateSchema(webpackOptionsSchema, options);
+		});
+		return options => {
+			if (!webpackOptionsSchemaCheck(options)) getRealValidate()(options);
+		};
+	},
+	get validateSchema() {
+		const validateSchema = require("./validateSchema");
+		return validateSchema;
+	},
+	get version() {
+		return /** @type {string} */ (require("../package.json").version);
+	},
+
+	get cli() {
+		return require("./cli");
+	},
+	get AutomaticPrefetchPlugin() {
+		return require("./AutomaticPrefetchPlugin");
+	},
+	get AsyncDependenciesBlock() {
+		return require("./AsyncDependenciesBlock");
+	},
+	get BannerPlugin() {
+		return require("./BannerPlugin");
+	},
+	get Cache() {
+		return require("./Cache");
+	},
+	get Chunk() {
+		return require("./Chunk");
+	},
+	get ChunkGraph() {
+		return require("./ChunkGraph");
+	},
+	get CleanPlugin() {
+		return require("./CleanPlugin");
+	},
+	get Compilation() {
+		return require("./Compilation");
+	},
+	get Compiler() {
+		return require("./Compiler");
+	},
+	get ConcatenationScope() {
+		return require("./ConcatenationScope");
+	},
+	get ContextExclusionPlugin() {
+		return require("./ContextExclusionPlugin");
+	},
+	get ContextReplacementPlugin() {
+		return require("./ContextReplacementPlugin");
+	},
+	get DefinePlugin() {
+		return require("./DefinePlugin");
+	},
+	get DelegatedPlugin() {
+		return require("./DelegatedPlugin");
+	},
+	get Dependency() {
+		return require("./Dependency");
+	},
+	get DllPlugin() {
+		return require("./DllPlugin");
+	},
+	get DllReferencePlugin() {
+		return require("./DllReferencePlugin");
+	},
+	get DynamicEntryPlugin() {
+		return require("./DynamicEntryPlugin");
+	},
+	get EntryOptionPlugin() {
+		return require("./EntryOptionPlugin");
+	},
+	get EntryPlugin() {
+		return require("./EntryPlugin");
+	},
+	get EnvironmentPlugin() {
+		return require("./EnvironmentPlugin");
+	},
+	get EvalDevToolModulePlugin() {
+		return require("./EvalDevToolModulePlugin");
+	},
+	get EvalSourceMapDevToolPlugin() {
+		return require("./EvalSourceMapDevToolPlugin");
+	},
+	get ExternalModule() {
+		return require("./ExternalModule");
+	},
+	get ExternalsPlugin() {
+		return require("./ExternalsPlugin");
+	},
+	get Generator() {
+		return require("./Generator");
+	},
+	get HotUpdateChunk() {
+		return require("./HotUpdateChunk");
+	},
+	get HotModuleReplacementPlugin() {
+		return require("./HotModuleReplacementPlugin");
+	},
+	get IgnorePlugin() {
+		return require("./IgnorePlugin");
+	},
+	get JavascriptModulesPlugin() {
+		return util.deprecate(
+			() => require("./javascript/JavascriptModulesPlugin"),
+			"webpack.JavascriptModulesPlugin has moved to webpack.javascript.JavascriptModulesPlugin",
+			"DEP_WEBPACK_JAVASCRIPT_MODULES_PLUGIN"
+		)();
+	},
+	get LibManifestPlugin() {
+		return require("./LibManifestPlugin");
+	},
+	get LibraryTemplatePlugin() {
+		return util.deprecate(
+			() => require("./LibraryTemplatePlugin"),
+			"webpack.LibraryTemplatePlugin is deprecated and has been replaced by compilation.outputOptions.library or compilation.addEntry + passing a library option",
+			"DEP_WEBPACK_LIBRARY_TEMPLATE_PLUGIN"
+		)();
+	},
+	get LoaderOptionsPlugin() {
+		return require("./LoaderOptionsPlugin");
+	},
+	get LoaderTargetPlugin() {
+		return require("./LoaderTargetPlugin");
+	},
+	get Module() {
+		return require("./Module");
+	},
+	get ModuleFilenameHelpers() {
+		return require("./ModuleFilenameHelpers");
+	},
+	get ModuleGraph() {
+		return require("./ModuleGraph");
+	},
+	get ModuleGraphConnection() {
+		return require("./ModuleGraphConnection");
+	},
+	get NoEmitOnErrorsPlugin() {
+		return require("./NoEmitOnErrorsPlugin");
+	},
+	get NormalModule() {
+		return require("./NormalModule");
+	},
+	get NormalModuleReplacementPlugin() {
+		return require("./NormalModuleReplacementPlugin");
+	},
+	get MultiCompiler() {
+		return require("./MultiCompiler");
+	},
+	get Parser() {
+		return require("./Parser");
+	},
+	get PrefetchPlugin() {
+		return require("./PrefetchPlugin");
+	},
+	get ProgressPlugin() {
+		return require("./ProgressPlugin");
+	},
+	get ProvidePlugin() {
+		return require("./ProvidePlugin");
+	},
+	get RuntimeGlobals() {
+		return require("./RuntimeGlobals");
+	},
+	get RuntimeModule() {
+		return require("./RuntimeModule");
+	},
+	get SingleEntryPlugin() {
+		return util.deprecate(
+			() => require("./EntryPlugin"),
+			"SingleEntryPlugin was renamed to EntryPlugin",
+			"DEP_WEBPACK_SINGLE_ENTRY_PLUGIN"
+		)();
+	},
+	get SourceMapDevToolPlugin() {
+		return require("./SourceMapDevToolPlugin");
+	},
+	get Stats() {
+		return require("./Stats");
+	},
+	get Template() {
+		return require("./Template");
+	},
+	get UsageState() {
+		return require("./ExportsInfo").UsageState;
+	},
+	get WatchIgnorePlugin() {
+		return require("./WatchIgnorePlugin");
+	},
+	get WebpackError() {
+		return require("./WebpackError");
+	},
+	get WebpackOptionsApply() {
+		return require("./WebpackOptionsApply");
+	},
+	get WebpackOptionsDefaulter() {
+		return util.deprecate(
+			() => require("./WebpackOptionsDefaulter"),
+			"webpack.WebpackOptionsDefaulter is deprecated and has been replaced by webpack.config.getNormalizedWebpackOptions and webpack.config.applyWebpackOptionsDefaults",
+			"DEP_WEBPACK_OPTIONS_DEFAULTER"
+		)();
+	},
+	// TODO webpack 6 deprecate
+	get WebpackOptionsValidationError() {
+		return require("schema-utils").ValidationError;
+	},
+	get ValidationError() {
+		return require("schema-utils").ValidationError;
+	},
+
+	cache: {
+		get MemoryCachePlugin() {
+			return require("./cache/MemoryCachePlugin");
+		}
+	},
+
+	config: {
+		get getNormalizedWebpackOptions() {
+			return require("./config/normalization").getNormalizedWebpackOptions;
+		},
+		get applyWebpackOptionsDefaults() {
+			return require("./config/defaults").applyWebpackOptionsDefaults;
+		}
+	},
+
+	dependencies: {
+		get ModuleDependency() {
+			return require("./dependencies/ModuleDependency");
+		},
+		get ConstDependency() {
+			return require("./dependencies/ConstDependency");
+		},
+		get NullDependency() {
+			return require("./dependencies/NullDependency");
+		}
+	},
+
+	ids: {
+		get ChunkModuleIdRangePlugin() {
+			return require("./ids/ChunkModuleIdRangePlugin");
+		},
+		get NaturalModuleIdsPlugin() {
+			return require("./ids/NaturalModuleIdsPlugin");
+		},
+		get OccurrenceModuleIdsPlugin() {
+			return require("./ids/OccurrenceModuleIdsPlugin");
+		},
+		get NamedModuleIdsPlugin() {
+			return require("./ids/NamedModuleIdsPlugin");
+		},
+		get DeterministicChunkIdsPlugin() {
+			return require("./ids/DeterministicChunkIdsPlugin");
+		},
+		get DeterministicModuleIdsPlugin() {
+			return require("./ids/DeterministicModuleIdsPlugin");
+		},
+		get NamedChunkIdsPlugin() {
+			return require("./ids/NamedChunkIdsPlugin");
+		},
+		get OccurrenceChunkIdsPlugin() {
+			return require("./ids/OccurrenceChunkIdsPlugin");
+		},
+		get HashedModuleIdsPlugin() {
+			return require("./ids/HashedModuleIdsPlugin");
+		}
+	},
+
+	javascript: {
+		get EnableChunkLoadingPlugin() {
+			return require("./javascript/EnableChunkLoadingPlugin");
+		},
+		get JavascriptModulesPlugin() {
+			return require("./javascript/JavascriptModulesPlugin");
+		},
+		get JavascriptParser() {
+			return require("./javascript/JavascriptParser");
+		}
+	},
+
+	optimize: {
+		get AggressiveMergingPlugin() {
+			return require("./optimize/AggressiveMergingPlugin");
+		},
+		get AggressiveSplittingPlugin() {
+			return util.deprecate(
+				() => require("./optimize/AggressiveSplittingPlugin"),
+				"AggressiveSplittingPlugin is deprecated in favor of SplitChunksPlugin",
+				"DEP_WEBPACK_AGGRESSIVE_SPLITTING_PLUGIN"
+			)();
+		},
+		get InnerGraph() {
+			return require("./optimize/InnerGraph");
+		},
+		get LimitChunkCountPlugin() {
+			return require("./optimize/LimitChunkCountPlugin");
+		},
+		get MinChunkSizePlugin() {
+			return require("./optimize/MinChunkSizePlugin");
+		},
+		get ModuleConcatenationPlugin() {
+			return require("./optimize/ModuleConcatenationPlugin");
+		},
+		get RealContentHashPlugin() {
+			return require("./optimize/RealContentHashPlugin");
+		},
+		get RuntimeChunkPlugin() {
+			return require("./optimize/RuntimeChunkPlugin");
+		},
+		get SideEffectsFlagPlugin() {
+			return require("./optimize/SideEffectsFlagPlugin");
+		},
+		get SplitChunksPlugin() {
+			return require("./optimize/SplitChunksPlugin");
+		}
+	},
+
+	runtime: {
+		get GetChunkFilenameRuntimeModule() {
+			return require("./runtime/GetChunkFilenameRuntimeModule");
+		},
+		get LoadScriptRuntimeModule() {
+			return require("./runtime/LoadScriptRuntimeModule");
+		}
+	},
+
+	prefetch: {
+		get ChunkPrefetchPreloadPlugin() {
+			return require("./prefetch/ChunkPrefetchPreloadPlugin");
+		}
+	},
+
+	web: {
+		get FetchCompileAsyncWasmPlugin() {
+			return require("./web/FetchCompileAsyncWasmPlugin");
+		},
+		get FetchCompileWasmPlugin() {
+			return require("./web/FetchCompileWasmPlugin");
+		},
+		get JsonpChunkLoadingRuntimeModule() {
+			return require("./web/JsonpChunkLoadingRuntimeModule");
+		},
+		get JsonpTemplatePlugin() {
+			return require("./web/JsonpTemplatePlugin");
+		}
+	},
+
+	webworker: {
+		get WebWorkerTemplatePlugin() {
+			return require("./webworker/WebWorkerTemplatePlugin");
+		}
+	},
+
+	node: {
+		get NodeEnvironmentPlugin() {
+			return require("./node/NodeEnvironmentPlugin");
+		},
+		get NodeSourcePlugin() {
+			return require("./node/NodeSourcePlugin");
+		},
+		get NodeTargetPlugin() {
+			return require("./node/NodeTargetPlugin");
+		},
+		get NodeTemplatePlugin() {
+			return require("./node/NodeTemplatePlugin");
+		},
+		get ReadFileCompileWasmPlugin() {
+			return require("./node/ReadFileCompileWasmPlugin");
+		}
+	},
+
+	electron: {
+		get ElectronTargetPlugin() {
+			return require("./electron/ElectronTargetPlugin");
+		}
+	},
+
+	wasm: {
+		get AsyncWebAssemblyModulesPlugin() {
+			return require("./wasm-async/AsyncWebAssemblyModulesPlugin");
+		}
+	},
+
+	library: {
+		get AbstractLibraryPlugin() {
+			return require("./library/AbstractLibraryPlugin");
+		},
+		get EnableLibraryPlugin() {
+			return require("./library/EnableLibraryPlugin");
+		}
+	},
+
+	container: {
+		get ContainerPlugin() {
+			return require("./container/ContainerPlugin");
+		},
+		get ContainerReferencePlugin() {
+			return require("./container/ContainerReferencePlugin");
+		},
+		get ModuleFederationPlugin() {
+			return require("./container/ModuleFederationPlugin");
+		},
+		get scope() {
+			return require("./container/options").scope;
+		}
+	},
+
+	sharing: {
+		get ConsumeSharedPlugin() {
+			return require("./sharing/ConsumeSharedPlugin");
+		},
+		get ProvideSharedPlugin() {
+			return require("./sharing/ProvideSharedPlugin");
+		},
+		get SharePlugin() {
+			return require("./sharing/SharePlugin");
+		},
+		get scope() {
+			return require("./container/options").scope;
+		}
+	},
+
+	debug: {
+		get ProfilingPlugin() {
+			return require("./debug/ProfilingPlugin");
+		}
+	},
+
+	util: {
+		get createHash() {
+			return require("./util/createHash");
+		},
+		get comparators() {
+			return require("./util/comparators");
+		},
+		get runtime() {
+			return require("./util/runtime");
+		},
+		get serialization() {
+			return require("./util/serialization");
+		},
+		get cleverMerge() {
+			return require("./util/cleverMerge").cachedCleverMerge;
+		},
+		get LazySet() {
+			return require("./util/LazySet");
+		}
+	},
+
+	get sources() {
+		return require("webpack-sources");
+	},
+
+	experiments: {
+		schemes: {
+			get HttpUriPlugin() {
+				return require("./schemes/HttpUriPlugin");
+			}
+		},
+		ids: {
+			get SyncModuleIdsPlugin() {
+				return require("./ids/SyncModuleIdsPlugin");
+			}
+		}
+	}
+});
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/ArrayPushCallbackChunkFormatPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/ArrayPushCallbackChunkFormatPlugin.js
new file mode 100644
index 0000000..e431537
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/ArrayPushCallbackChunkFormatPlugin.js
@@ -0,0 +1,154 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, PrefixSource, RawSource } = require("webpack-sources");
+const { RuntimeGlobals } = require("..");
+const HotUpdateChunk = require("../HotUpdateChunk");
+const Template = require("../Template");
+const { getCompilationHooks } = require("./JavascriptModulesPlugin");
+const {
+	generateEntryStartup,
+	updateHashForEntryStartup
+} = require("./StartupHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ArrayPushCallbackChunkFormatPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"ArrayPushCallbackChunkFormatPlugin",
+			compilation => {
+				compilation.hooks.additionalChunkRuntimeRequirements.tap(
+					"ArrayPushCallbackChunkFormatPlugin",
+					(chunk, set, { chunkGraph }) => {
+						if (chunk.hasRuntime()) return;
+						if (chunkGraph.getNumberOfEntryModules(chunk) > 0) {
+							set.add(RuntimeGlobals.onChunksLoaded);
+							set.add(RuntimeGlobals.require);
+						}
+						set.add(RuntimeGlobals.chunkCallback);
+					}
+				);
+				const hooks = getCompilationHooks(compilation);
+				hooks.renderChunk.tap(
+					"ArrayPushCallbackChunkFormatPlugin",
+					(modules, renderContext) => {
+						const { chunk, chunkGraph, runtimeTemplate } = renderContext;
+						const hotUpdateChunk =
+							chunk instanceof HotUpdateChunk ? chunk : null;
+						const globalObject = runtimeTemplate.globalObject;
+						const source = new ConcatSource();
+						const runtimeModules =
+							chunkGraph.getChunkRuntimeModulesInOrder(chunk);
+						if (hotUpdateChunk) {
+							const hotUpdateGlobal =
+								runtimeTemplate.outputOptions.hotUpdateGlobal;
+							source.add(
+								`${globalObject}[${JSON.stringify(hotUpdateGlobal)}](`
+							);
+							source.add(`${JSON.stringify(chunk.id)},`);
+							source.add(modules);
+							if (runtimeModules.length > 0) {
+								source.add(",\n");
+								const runtimePart = Template.renderChunkRuntimeModules(
+									runtimeModules,
+									renderContext
+								);
+								source.add(runtimePart);
+							}
+							source.add(")");
+						} else {
+							const chunkLoadingGlobal =
+								runtimeTemplate.outputOptions.chunkLoadingGlobal;
+							source.add(
+								`(${globalObject}[${JSON.stringify(
+									chunkLoadingGlobal
+								)}] = ${globalObject}[${JSON.stringify(
+									chunkLoadingGlobal
+								)}] || []).push([`
+							);
+							source.add(`${JSON.stringify(chunk.ids)},`);
+							source.add(modules);
+							const entries = Array.from(
+								chunkGraph.getChunkEntryModulesWithChunkGroupIterable(chunk)
+							);
+							if (runtimeModules.length > 0 || entries.length > 0) {
+								const runtime = new ConcatSource(
+									(runtimeTemplate.supportsArrowFunction()
+										? "__webpack_require__ =>"
+										: "function(__webpack_require__)") +
+										" { // webpackRuntimeModules\n"
+								);
+								if (runtimeModules.length > 0) {
+									runtime.add(
+										Template.renderRuntimeModules(runtimeModules, {
+											...renderContext,
+											codeGenerationResults: compilation.codeGenerationResults
+										})
+									);
+								}
+								if (entries.length > 0) {
+									const startupSource = new RawSource(
+										generateEntryStartup(
+											chunkGraph,
+											runtimeTemplate,
+											entries,
+											chunk,
+											true
+										)
+									);
+									runtime.add(
+										hooks.renderStartup.call(
+											startupSource,
+											entries[entries.length - 1][0],
+											{
+												...renderContext,
+												inlined: false
+											}
+										)
+									);
+									if (
+										chunkGraph
+											.getChunkRuntimeRequirements(chunk)
+											.has(RuntimeGlobals.returnExportsFromRuntime)
+									) {
+										runtime.add("return __webpack_exports__;\n");
+									}
+								}
+								runtime.add("}\n");
+								source.add(",\n");
+								source.add(new PrefixSource("/******/ ", runtime));
+							}
+							source.add("])");
+						}
+						return source;
+					}
+				);
+				hooks.chunkHash.tap(
+					"ArrayPushCallbackChunkFormatPlugin",
+					(chunk, hash, { chunkGraph, runtimeTemplate }) => {
+						if (chunk.hasRuntime()) return;
+						hash.update(
+							`ArrayPushCallbackChunkFormatPlugin1${runtimeTemplate.outputOptions.chunkLoadingGlobal}${runtimeTemplate.outputOptions.hotUpdateGlobal}${runtimeTemplate.globalObject}`
+						);
+						const entries = Array.from(
+							chunkGraph.getChunkEntryModulesWithChunkGroupIterable(chunk)
+						);
+						updateHashForEntryStartup(hash, chunkGraph, entries, chunk);
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = ArrayPushCallbackChunkFormatPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/BasicEvaluatedExpression.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/BasicEvaluatedExpression.js
new file mode 100644
index 0000000..0e5a211
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/BasicEvaluatedExpression.js
@@ -0,0 +1,480 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("estree").Node} EsTreeNode */
+/** @typedef {import("./JavascriptParser").VariableInfoInterface} VariableInfoInterface */
+
+const TypeUnknown = 0;
+const TypeUndefined = 1;
+const TypeNull = 2;
+const TypeString = 3;
+const TypeNumber = 4;
+const TypeBoolean = 5;
+const TypeRegExp = 6;
+const TypeConditional = 7;
+const TypeArray = 8;
+const TypeConstArray = 9;
+const TypeIdentifier = 10;
+const TypeWrapped = 11;
+const TypeTemplateString = 12;
+const TypeBigInt = 13;
+
+class BasicEvaluatedExpression {
+	constructor() {
+		this.type = TypeUnknown;
+		/** @type {[number, number]} */
+		this.range = undefined;
+		/** @type {boolean} */
+		this.falsy = false;
+		/** @type {boolean} */
+		this.truthy = false;
+		/** @type {boolean | undefined} */
+		this.nullish = undefined;
+		/** @type {boolean} */
+		this.sideEffects = true;
+		/** @type {boolean | undefined} */
+		this.bool = undefined;
+		/** @type {number | undefined} */
+		this.number = undefined;
+		/** @type {bigint | undefined} */
+		this.bigint = undefined;
+		/** @type {RegExp | undefined} */
+		this.regExp = undefined;
+		/** @type {string | undefined} */
+		this.string = undefined;
+		/** @type {BasicEvaluatedExpression[] | undefined} */
+		this.quasis = undefined;
+		/** @type {BasicEvaluatedExpression[] | undefined} */
+		this.parts = undefined;
+		/** @type {any[] | undefined} */
+		this.array = undefined;
+		/** @type {BasicEvaluatedExpression[] | undefined} */
+		this.items = undefined;
+		/** @type {BasicEvaluatedExpression[] | undefined} */
+		this.options = undefined;
+		/** @type {BasicEvaluatedExpression | undefined} */
+		this.prefix = undefined;
+		/** @type {BasicEvaluatedExpression | undefined} */
+		this.postfix = undefined;
+		this.wrappedInnerExpressions = undefined;
+		/** @type {string | undefined} */
+		this.identifier = undefined;
+		/** @type {VariableInfoInterface} */
+		this.rootInfo = undefined;
+		/** @type {() => string[]} */
+		this.getMembers = undefined;
+		/** @type {EsTreeNode} */
+		this.expression = undefined;
+	}
+
+	isUnknown() {
+		return this.type === TypeUnknown;
+	}
+
+	isNull() {
+		return this.type === TypeNull;
+	}
+
+	isUndefined() {
+		return this.type === TypeUndefined;
+	}
+
+	isString() {
+		return this.type === TypeString;
+	}
+
+	isNumber() {
+		return this.type === TypeNumber;
+	}
+
+	isBigInt() {
+		return this.type === TypeBigInt;
+	}
+
+	isBoolean() {
+		return this.type === TypeBoolean;
+	}
+
+	isRegExp() {
+		return this.type === TypeRegExp;
+	}
+
+	isConditional() {
+		return this.type === TypeConditional;
+	}
+
+	isArray() {
+		return this.type === TypeArray;
+	}
+
+	isConstArray() {
+		return this.type === TypeConstArray;
+	}
+
+	isIdentifier() {
+		return this.type === TypeIdentifier;
+	}
+
+	isWrapped() {
+		return this.type === TypeWrapped;
+	}
+
+	isTemplateString() {
+		return this.type === TypeTemplateString;
+	}
+
+	/**
+	 * Is expression a primitive or an object type value?
+	 * @returns {boolean | undefined} true: primitive type, false: object type, undefined: unknown/runtime-defined
+	 */
+	isPrimitiveType() {
+		switch (this.type) {
+			case TypeUndefined:
+			case TypeNull:
+			case TypeString:
+			case TypeNumber:
+			case TypeBoolean:
+			case TypeBigInt:
+			case TypeWrapped:
+			case TypeTemplateString:
+				return true;
+			case TypeRegExp:
+			case TypeArray:
+			case TypeConstArray:
+				return false;
+			default:
+				return undefined;
+		}
+	}
+
+	/**
+	 * Is expression a runtime or compile-time value?
+	 * @returns {boolean} true: compile time value, false: runtime value
+	 */
+	isCompileTimeValue() {
+		switch (this.type) {
+			case TypeUndefined:
+			case TypeNull:
+			case TypeString:
+			case TypeNumber:
+			case TypeBoolean:
+			case TypeRegExp:
+			case TypeConstArray:
+			case TypeBigInt:
+				return true;
+			default:
+				return false;
+		}
+	}
+
+	/**
+	 * Gets the compile-time value of the expression
+	 * @returns {any} the javascript value
+	 */
+	asCompileTimeValue() {
+		switch (this.type) {
+			case TypeUndefined:
+				return undefined;
+			case TypeNull:
+				return null;
+			case TypeString:
+				return this.string;
+			case TypeNumber:
+				return this.number;
+			case TypeBoolean:
+				return this.bool;
+			case TypeRegExp:
+				return this.regExp;
+			case TypeConstArray:
+				return this.array;
+			case TypeBigInt:
+				return this.bigint;
+			default:
+				throw new Error(
+					"asCompileTimeValue must only be called for compile-time values"
+				);
+		}
+	}
+
+	isTruthy() {
+		return this.truthy;
+	}
+
+	isFalsy() {
+		return this.falsy;
+	}
+
+	isNullish() {
+		return this.nullish;
+	}
+
+	/**
+	 * Can this expression have side effects?
+	 * @returns {boolean} false: never has side effects
+	 */
+	couldHaveSideEffects() {
+		return this.sideEffects;
+	}
+
+	asBool() {
+		if (this.truthy) return true;
+		if (this.falsy || this.nullish) return false;
+		if (this.isBoolean()) return this.bool;
+		if (this.isNull()) return false;
+		if (this.isUndefined()) return false;
+		if (this.isString()) return this.string !== "";
+		if (this.isNumber()) return this.number !== 0;
+		if (this.isBigInt()) return this.bigint !== BigInt(0);
+		if (this.isRegExp()) return true;
+		if (this.isArray()) return true;
+		if (this.isConstArray()) return true;
+		if (this.isWrapped()) {
+			return (this.prefix && this.prefix.asBool()) ||
+				(this.postfix && this.postfix.asBool())
+				? true
+				: undefined;
+		}
+		if (this.isTemplateString()) {
+			const str = this.asString();
+			if (typeof str === "string") return str !== "";
+		}
+		return undefined;
+	}
+
+	asNullish() {
+		const nullish = this.isNullish();
+
+		if (nullish === true || this.isNull() || this.isUndefined()) return true;
+
+		if (nullish === false) return false;
+		if (this.isTruthy()) return false;
+		if (this.isBoolean()) return false;
+		if (this.isString()) return false;
+		if (this.isNumber()) return false;
+		if (this.isBigInt()) return false;
+		if (this.isRegExp()) return false;
+		if (this.isArray()) return false;
+		if (this.isConstArray()) return false;
+		if (this.isTemplateString()) return false;
+		if (this.isRegExp()) return false;
+
+		return undefined;
+	}
+
+	asString() {
+		if (this.isBoolean()) return `${this.bool}`;
+		if (this.isNull()) return "null";
+		if (this.isUndefined()) return "undefined";
+		if (this.isString()) return this.string;
+		if (this.isNumber()) return `${this.number}`;
+		if (this.isBigInt()) return `${this.bigint}`;
+		if (this.isRegExp()) return `${this.regExp}`;
+		if (this.isArray()) {
+			let array = [];
+			for (const item of this.items) {
+				const itemStr = item.asString();
+				if (itemStr === undefined) return undefined;
+				array.push(itemStr);
+			}
+			return `${array}`;
+		}
+		if (this.isConstArray()) return `${this.array}`;
+		if (this.isTemplateString()) {
+			let str = "";
+			for (const part of this.parts) {
+				const partStr = part.asString();
+				if (partStr === undefined) return undefined;
+				str += partStr;
+			}
+			return str;
+		}
+		return undefined;
+	}
+
+	setString(string) {
+		this.type = TypeString;
+		this.string = string;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setUndefined() {
+		this.type = TypeUndefined;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setNull() {
+		this.type = TypeNull;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setNumber(number) {
+		this.type = TypeNumber;
+		this.number = number;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setBigInt(bigint) {
+		this.type = TypeBigInt;
+		this.bigint = bigint;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setBoolean(bool) {
+		this.type = TypeBoolean;
+		this.bool = bool;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setRegExp(regExp) {
+		this.type = TypeRegExp;
+		this.regExp = regExp;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setIdentifier(identifier, rootInfo, getMembers) {
+		this.type = TypeIdentifier;
+		this.identifier = identifier;
+		this.rootInfo = rootInfo;
+		this.getMembers = getMembers;
+		this.sideEffects = true;
+		return this;
+	}
+
+	setWrapped(prefix, postfix, innerExpressions) {
+		this.type = TypeWrapped;
+		this.prefix = prefix;
+		this.postfix = postfix;
+		this.wrappedInnerExpressions = innerExpressions;
+		this.sideEffects = true;
+		return this;
+	}
+
+	setOptions(options) {
+		this.type = TypeConditional;
+		this.options = options;
+		this.sideEffects = true;
+		return this;
+	}
+
+	addOptions(options) {
+		if (!this.options) {
+			this.type = TypeConditional;
+			this.options = [];
+			this.sideEffects = true;
+		}
+		for (const item of options) {
+			this.options.push(item);
+		}
+		return this;
+	}
+
+	setItems(items) {
+		this.type = TypeArray;
+		this.items = items;
+		this.sideEffects = items.some(i => i.couldHaveSideEffects());
+		return this;
+	}
+
+	setArray(array) {
+		this.type = TypeConstArray;
+		this.array = array;
+		this.sideEffects = false;
+		return this;
+	}
+
+	setTemplateString(quasis, parts, kind) {
+		this.type = TypeTemplateString;
+		this.quasis = quasis;
+		this.parts = parts;
+		this.templateStringKind = kind;
+		this.sideEffects = parts.some(p => p.sideEffects);
+		return this;
+	}
+
+	setTruthy() {
+		this.falsy = false;
+		this.truthy = true;
+		this.nullish = false;
+		return this;
+	}
+
+	setFalsy() {
+		this.falsy = true;
+		this.truthy = false;
+		return this;
+	}
+
+	setNullish(value) {
+		this.nullish = value;
+
+		if (value) return this.setFalsy();
+
+		return this;
+	}
+
+	setRange(range) {
+		this.range = range;
+		return this;
+	}
+
+	setSideEffects(sideEffects = true) {
+		this.sideEffects = sideEffects;
+		return this;
+	}
+
+	setExpression(expression) {
+		this.expression = expression;
+		return this;
+	}
+}
+
+/**
+ * @param {string} flags regexp flags
+ * @returns {boolean} is valid flags
+ */
+BasicEvaluatedExpression.isValidRegExpFlags = flags => {
+	const len = flags.length;
+
+	if (len === 0) return true;
+	if (len > 4) return false;
+
+	// cspell:word gimy
+	let remaining = 0b0000; // bit per RegExp flag: gimy
+
+	for (let i = 0; i < len; i++)
+		switch (flags.charCodeAt(i)) {
+			case 103 /* g */:
+				if (remaining & 0b1000) return false;
+				remaining |= 0b1000;
+				break;
+			case 105 /* i */:
+				if (remaining & 0b0100) return false;
+				remaining |= 0b0100;
+				break;
+			case 109 /* m */:
+				if (remaining & 0b0010) return false;
+				remaining |= 0b0010;
+				break;
+			case 121 /* y */:
+				if (remaining & 0b0001) return false;
+				remaining |= 0b0001;
+				break;
+			default:
+				return false;
+		}
+
+	return true;
+};
+
+module.exports = BasicEvaluatedExpression;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/ChunkHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/ChunkHelpers.js
new file mode 100644
index 0000000..8e05704
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/ChunkHelpers.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Entrypoint = require("../Entrypoint");
+
+/** @typedef {import("../Chunk")} Chunk */
+
+/**
+ * @param {Entrypoint} entrypoint a chunk group
+ * @param {Chunk} excludedChunk1 current chunk which is excluded
+ * @param {Chunk} excludedChunk2 runtime chunk which is excluded
+ * @returns {Set<Chunk>} chunks
+ */
+const getAllChunks = (entrypoint, excludedChunk1, excludedChunk2) => {
+	const queue = new Set([entrypoint]);
+	const chunks = new Set();
+	for (const entrypoint of queue) {
+		for (const chunk of entrypoint.chunks) {
+			if (chunk === excludedChunk1) continue;
+			if (chunk === excludedChunk2) continue;
+			chunks.add(chunk);
+		}
+		for (const parent of entrypoint.parentsIterable) {
+			if (parent instanceof Entrypoint) queue.add(parent);
+		}
+	}
+	return chunks;
+};
+exports.getAllChunks = getAllChunks;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/CommonJsChunkFormatPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/CommonJsChunkFormatPlugin.js
new file mode 100644
index 0000000..a1d57bc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/CommonJsChunkFormatPlugin.js
@@ -0,0 +1,172 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, RawSource } = require("webpack-sources");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const {
+	getChunkFilenameTemplate,
+	getCompilationHooks
+} = require("./JavascriptModulesPlugin");
+const {
+	generateEntryStartup,
+	updateHashForEntryStartup
+} = require("./StartupHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class CommonJsChunkFormatPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"CommonJsChunkFormatPlugin",
+			compilation => {
+				compilation.hooks.additionalChunkRuntimeRequirements.tap(
+					"CommonJsChunkLoadingPlugin",
+					(chunk, set, { chunkGraph }) => {
+						if (chunk.hasRuntime()) return;
+						if (chunkGraph.getNumberOfEntryModules(chunk) > 0) {
+							set.add(RuntimeGlobals.require);
+							set.add(RuntimeGlobals.startupEntrypoint);
+							set.add(RuntimeGlobals.externalInstallChunk);
+						}
+					}
+				);
+				const hooks = getCompilationHooks(compilation);
+				hooks.renderChunk.tap(
+					"CommonJsChunkFormatPlugin",
+					(modules, renderContext) => {
+						const { chunk, chunkGraph, runtimeTemplate } = renderContext;
+						const source = new ConcatSource();
+						source.add(`exports.id = ${JSON.stringify(chunk.id)};\n`);
+						source.add(`exports.ids = ${JSON.stringify(chunk.ids)};\n`);
+						source.add(`exports.modules = `);
+						source.add(modules);
+						source.add(";\n");
+						const runtimeModules =
+							chunkGraph.getChunkRuntimeModulesInOrder(chunk);
+						if (runtimeModules.length > 0) {
+							source.add("exports.runtime =\n");
+							source.add(
+								Template.renderChunkRuntimeModules(
+									runtimeModules,
+									renderContext
+								)
+							);
+						}
+						const entries = Array.from(
+							chunkGraph.getChunkEntryModulesWithChunkGroupIterable(chunk)
+						);
+						if (entries.length > 0) {
+							const runtimeChunk = entries[0][1].getRuntimeChunk();
+							const currentOutputName = compilation
+								.getPath(
+									getChunkFilenameTemplate(chunk, compilation.outputOptions),
+									{
+										chunk,
+										contentHashType: "javascript"
+									}
+								)
+								.split("/");
+							const runtimeOutputName = compilation
+								.getPath(
+									getChunkFilenameTemplate(
+										runtimeChunk,
+										compilation.outputOptions
+									),
+									{
+										chunk: runtimeChunk,
+										contentHashType: "javascript"
+									}
+								)
+								.split("/");
+
+							// remove filename, we only need the directory
+							currentOutputName.pop();
+
+							// remove common parts
+							while (
+								currentOutputName.length > 0 &&
+								runtimeOutputName.length > 0 &&
+								currentOutputName[0] === runtimeOutputName[0]
+							) {
+								currentOutputName.shift();
+								runtimeOutputName.shift();
+							}
+
+							// create final path
+							const runtimePath =
+								(currentOutputName.length > 0
+									? "../".repeat(currentOutputName.length)
+									: "./") + runtimeOutputName.join("/");
+
+							const entrySource = new ConcatSource();
+							entrySource.add(
+								`(${
+									runtimeTemplate.supportsArrowFunction()
+										? "() => "
+										: "function() "
+								}{\n`
+							);
+							entrySource.add("var exports = {};\n");
+							entrySource.add(source);
+							entrySource.add(";\n\n// load runtime\n");
+							entrySource.add(
+								`var __webpack_require__ = require(${JSON.stringify(
+									runtimePath
+								)});\n`
+							);
+							entrySource.add(
+								`${RuntimeGlobals.externalInstallChunk}(exports);\n`
+							);
+							const startupSource = new RawSource(
+								generateEntryStartup(
+									chunkGraph,
+									runtimeTemplate,
+									entries,
+									chunk,
+									false
+								)
+							);
+							entrySource.add(
+								hooks.renderStartup.call(
+									startupSource,
+									entries[entries.length - 1][0],
+									{
+										...renderContext,
+										inlined: false
+									}
+								)
+							);
+							entrySource.add("\n})()");
+							return entrySource;
+						}
+						return source;
+					}
+				);
+				hooks.chunkHash.tap(
+					"CommonJsChunkFormatPlugin",
+					(chunk, hash, { chunkGraph }) => {
+						if (chunk.hasRuntime()) return;
+						hash.update("CommonJsChunkFormatPlugin");
+						hash.update("1");
+						const entries = Array.from(
+							chunkGraph.getChunkEntryModulesWithChunkGroupIterable(chunk)
+						);
+						updateHashForEntryStartup(hash, chunkGraph, entries, chunk);
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = CommonJsChunkFormatPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/EnableChunkLoadingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/EnableChunkLoadingPlugin.js
new file mode 100644
index 0000000..2d938d2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/EnableChunkLoadingPlugin.js
@@ -0,0 +1,118 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../../declarations/WebpackOptions").ChunkLoadingType} ChunkLoadingType */
+/** @typedef {import("../Compiler")} Compiler */
+
+/** @type {WeakMap<Compiler, Set<ChunkLoadingType>>} */
+const enabledTypes = new WeakMap();
+
+const getEnabledTypes = compiler => {
+	let set = enabledTypes.get(compiler);
+	if (set === undefined) {
+		set = new Set();
+		enabledTypes.set(compiler, set);
+	}
+	return set;
+};
+
+class EnableChunkLoadingPlugin {
+	/**
+	 * @param {ChunkLoadingType} type library type that should be available
+	 */
+	constructor(type) {
+		this.type = type;
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler instance
+	 * @param {ChunkLoadingType} type type of library
+	 * @returns {void}
+	 */
+	static setEnabled(compiler, type) {
+		getEnabledTypes(compiler).add(type);
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler instance
+	 * @param {ChunkLoadingType} type type of library
+	 * @returns {void}
+	 */
+	static checkEnabled(compiler, type) {
+		if (!getEnabledTypes(compiler).has(type)) {
+			throw new Error(
+				`Chunk loading type "${type}" is not enabled. ` +
+					"EnableChunkLoadingPlugin need to be used to enable this type of chunk loading. " +
+					'This usually happens through the "output.enabledChunkLoadingTypes" option. ' +
+					'If you are using a function as entry which sets "chunkLoading", you need to add all potential chunk loading types to "output.enabledChunkLoadingTypes". ' +
+					"These types are enabled: " +
+					Array.from(getEnabledTypes(compiler)).join(", ")
+			);
+		}
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { type } = this;
+
+		// Only enable once
+		const enabled = getEnabledTypes(compiler);
+		if (enabled.has(type)) return;
+		enabled.add(type);
+
+		if (typeof type === "string") {
+			switch (type) {
+				case "jsonp": {
+					const JsonpChunkLoadingPlugin = require("../web/JsonpChunkLoadingPlugin");
+					new JsonpChunkLoadingPlugin().apply(compiler);
+					break;
+				}
+				case "import-scripts": {
+					const ImportScriptsChunkLoadingPlugin = require("../webworker/ImportScriptsChunkLoadingPlugin");
+					new ImportScriptsChunkLoadingPlugin().apply(compiler);
+					break;
+				}
+				case "require": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const CommonJsChunkLoadingPlugin = require("../node/CommonJsChunkLoadingPlugin");
+					new CommonJsChunkLoadingPlugin({
+						asyncChunkLoading: false
+					}).apply(compiler);
+					break;
+				}
+				case "async-node": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const CommonJsChunkLoadingPlugin = require("../node/CommonJsChunkLoadingPlugin");
+					new CommonJsChunkLoadingPlugin({
+						asyncChunkLoading: true
+					}).apply(compiler);
+					break;
+				}
+				case "import": {
+					const ModuleChunkLoadingPlugin = require("../esm/ModuleChunkLoadingPlugin");
+					new ModuleChunkLoadingPlugin().apply(compiler);
+					break;
+				}
+				case "universal":
+					// TODO implement universal chunk loading
+					throw new Error("Universal Chunk Loading is not implemented yet");
+				default:
+					throw new Error(`Unsupported chunk loading type ${type}.
+Plugins which provide custom chunk loading types must call EnableChunkLoadingPlugin.setEnabled(compiler, type) to disable this error.`);
+			}
+		} else {
+			// TODO support plugin instances here
+			// apply them to the compiler
+		}
+	}
+}
+
+module.exports = EnableChunkLoadingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptGenerator.js
new file mode 100644
index 0000000..d13eb8a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptGenerator.js
@@ -0,0 +1,225 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const { RawSource, ReplaceSource } = require("webpack-sources");
+const Generator = require("../Generator");
+const InitFragment = require("../InitFragment");
+const HarmonyCompatibilityDependency = require("../dependencies/HarmonyCompatibilityDependency");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../DependenciesBlock")} DependenciesBlock */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../Module").ConcatenationBailoutReasonContext} ConcatenationBailoutReasonContext */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+
+// TODO: clean up this file
+// replace with newer constructs
+
+const deprecatedGetInitFragments = util.deprecate(
+	(template, dependency, templateContext) =>
+		template.getInitFragments(dependency, templateContext),
+	"DependencyTemplate.getInitFragment is deprecated (use apply(dep, source, { initFragments }) instead)",
+	"DEP_WEBPACK_JAVASCRIPT_GENERATOR_GET_INIT_FRAGMENTS"
+);
+
+const TYPES = new Set(["javascript"]);
+
+class JavascriptGenerator extends Generator {
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		const originalSource = module.originalSource();
+		if (!originalSource) {
+			return 39;
+		}
+		return originalSource.size();
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the bailout reason should be determined
+	 * @param {ConcatenationBailoutReasonContext} context context
+	 * @returns {string | undefined} reason why this module can't be concatenated, undefined when it can be concatenated
+	 */
+	getConcatenationBailoutReason(module, context) {
+		// Only harmony modules are valid for optimization
+		if (
+			!module.buildMeta ||
+			module.buildMeta.exportsType !== "namespace" ||
+			module.presentationalDependencies === undefined ||
+			!module.presentationalDependencies.some(
+				d => d instanceof HarmonyCompatibilityDependency
+			)
+		) {
+			return "Module is not an ECMAScript module";
+		}
+
+		// Some expressions are not compatible with module concatenation
+		// because they may produce unexpected results. The plugin bails out
+		// if some were detected upfront.
+		if (module.buildInfo && module.buildInfo.moduleConcatenationBailout) {
+			return `Module uses ${module.buildInfo.moduleConcatenationBailout}`;
+		}
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, generateContext) {
+		const originalSource = module.originalSource();
+		if (!originalSource) {
+			return new RawSource("throw new Error('No source available');");
+		}
+
+		const source = new ReplaceSource(originalSource);
+		const initFragments = [];
+
+		this.sourceModule(module, initFragments, source, generateContext);
+
+		return InitFragment.addToSource(source, initFragments, generateContext);
+	}
+
+	/**
+	 * @param {Module} module the module to generate
+	 * @param {InitFragment[]} initFragments mutable list of init fragments
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {GenerateContext} generateContext the generateContext
+	 * @returns {void}
+	 */
+	sourceModule(module, initFragments, source, generateContext) {
+		for (const dependency of module.dependencies) {
+			this.sourceDependency(
+				module,
+				dependency,
+				initFragments,
+				source,
+				generateContext
+			);
+		}
+
+		if (module.presentationalDependencies !== undefined) {
+			for (const dependency of module.presentationalDependencies) {
+				this.sourceDependency(
+					module,
+					dependency,
+					initFragments,
+					source,
+					generateContext
+				);
+			}
+		}
+
+		for (const childBlock of module.blocks) {
+			this.sourceBlock(
+				module,
+				childBlock,
+				initFragments,
+				source,
+				generateContext
+			);
+		}
+	}
+
+	/**
+	 * @param {Module} module the module to generate
+	 * @param {DependenciesBlock} block the dependencies block which will be processed
+	 * @param {InitFragment[]} initFragments mutable list of init fragments
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {GenerateContext} generateContext the generateContext
+	 * @returns {void}
+	 */
+	sourceBlock(module, block, initFragments, source, generateContext) {
+		for (const dependency of block.dependencies) {
+			this.sourceDependency(
+				module,
+				dependency,
+				initFragments,
+				source,
+				generateContext
+			);
+		}
+
+		for (const childBlock of block.blocks) {
+			this.sourceBlock(
+				module,
+				childBlock,
+				initFragments,
+				source,
+				generateContext
+			);
+		}
+	}
+
+	/**
+	 * @param {Module} module the current module
+	 * @param {Dependency} dependency the dependency to generate
+	 * @param {InitFragment[]} initFragments mutable list of init fragments
+	 * @param {ReplaceSource} source the current replace source which can be modified
+	 * @param {GenerateContext} generateContext the render context
+	 * @returns {void}
+	 */
+	sourceDependency(module, dependency, initFragments, source, generateContext) {
+		const constructor = /** @type {new (...args: any[]) => Dependency} */ (
+			dependency.constructor
+		);
+		const template = generateContext.dependencyTemplates.get(constructor);
+		if (!template) {
+			throw new Error(
+				"No template for dependency: " + dependency.constructor.name
+			);
+		}
+
+		const templateContext = {
+			runtimeTemplate: generateContext.runtimeTemplate,
+			dependencyTemplates: generateContext.dependencyTemplates,
+			moduleGraph: generateContext.moduleGraph,
+			chunkGraph: generateContext.chunkGraph,
+			module,
+			runtime: generateContext.runtime,
+			runtimeRequirements: generateContext.runtimeRequirements,
+			concatenationScope: generateContext.concatenationScope,
+			codeGenerationResults: generateContext.codeGenerationResults,
+			initFragments
+		};
+
+		template.apply(dependency, source, templateContext);
+
+		// TODO remove in webpack 6
+		if ("getInitFragments" in template) {
+			const fragments = deprecatedGetInitFragments(
+				template,
+				dependency,
+				templateContext
+			);
+
+			if (fragments) {
+				for (const fragment of fragments) {
+					initFragments.push(fragment);
+				}
+			}
+		}
+	}
+}
+
+module.exports = JavascriptGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptModulesPlugin.js
new file mode 100644
index 0000000..42d6f35
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptModulesPlugin.js
@@ -0,0 +1,1370 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncWaterfallHook, SyncHook, SyncBailHook } = require("tapable");
+const vm = require("vm");
+const {
+	ConcatSource,
+	OriginalSource,
+	PrefixSource,
+	RawSource,
+	CachedSource
+} = require("webpack-sources");
+const Compilation = require("../Compilation");
+const { tryRunOrWebpackError } = require("../HookWebpackError");
+const HotUpdateChunk = require("../HotUpdateChunk");
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const { last, someInIterable } = require("../util/IterableHelpers");
+const StringXor = require("../util/StringXor");
+const { compareModulesByIdentifier } = require("../util/comparators");
+const createHash = require("../util/createHash");
+const nonNumericOnlyHash = require("../util/nonNumericOnlyHash");
+const { intersectRuntime } = require("../util/runtime");
+const JavascriptGenerator = require("./JavascriptGenerator");
+const JavascriptParser = require("./JavascriptParser");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("../Compilation").ChunkHashContext} ChunkHashContext */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../util/Hash")} Hash */
+
+/**
+ * @param {Chunk} chunk a chunk
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @returns {boolean} true, when a JS file is needed for this chunk
+ */
+const chunkHasJs = (chunk, chunkGraph) => {
+	if (chunkGraph.getNumberOfEntryModules(chunk) > 0) return true;
+
+	return chunkGraph.getChunkModulesIterableBySourceType(chunk, "javascript")
+		? true
+		: false;
+};
+
+const printGeneratedCodeForStack = (module, code) => {
+	const lines = code.split("\n");
+	const n = `${lines.length}`.length;
+	return `\n\nGenerated code for ${module.identifier()}\n${lines
+		.map((line, i, lines) => {
+			const iStr = `${i + 1}`;
+			return `${" ".repeat(n - iStr.length)}${iStr} | ${line}`;
+		})
+		.join("\n")}`;
+};
+
+/**
+ * @typedef {Object} RenderContext
+ * @property {Chunk} chunk the chunk
+ * @property {DependencyTemplates} dependencyTemplates the dependency templates
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {CodeGenerationResults} codeGenerationResults results of code generation
+ * @property {boolean} strictMode rendering in strict context
+ */
+
+/**
+ * @typedef {Object} MainRenderContext
+ * @property {Chunk} chunk the chunk
+ * @property {DependencyTemplates} dependencyTemplates the dependency templates
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {CodeGenerationResults} codeGenerationResults results of code generation
+ * @property {string} hash hash to be used for render call
+ * @property {boolean} strictMode rendering in strict context
+ */
+
+/**
+ * @typedef {Object} ChunkRenderContext
+ * @property {Chunk} chunk the chunk
+ * @property {DependencyTemplates} dependencyTemplates the dependency templates
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {CodeGenerationResults} codeGenerationResults results of code generation
+ * @property {InitFragment<ChunkRenderContext>[]} chunkInitFragments init fragments for the chunk
+ * @property {boolean} strictMode rendering in strict context
+ */
+
+/**
+ * @typedef {Object} RenderBootstrapContext
+ * @property {Chunk} chunk the chunk
+ * @property {CodeGenerationResults} codeGenerationResults results of code generation
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {string} hash hash to be used for render call
+ */
+
+/** @typedef {RenderContext & { inlined: boolean }} StartupRenderContext */
+
+/**
+ * @typedef {Object} CompilationHooks
+ * @property {SyncWaterfallHook<[Source, Module, ChunkRenderContext]>} renderModuleContent
+ * @property {SyncWaterfallHook<[Source, Module, ChunkRenderContext]>} renderModuleContainer
+ * @property {SyncWaterfallHook<[Source, Module, ChunkRenderContext]>} renderModulePackage
+ * @property {SyncWaterfallHook<[Source, RenderContext]>} renderChunk
+ * @property {SyncWaterfallHook<[Source, RenderContext]>} renderMain
+ * @property {SyncWaterfallHook<[Source, RenderContext]>} renderContent
+ * @property {SyncWaterfallHook<[Source, RenderContext]>} render
+ * @property {SyncWaterfallHook<[Source, Module, StartupRenderContext]>} renderStartup
+ * @property {SyncWaterfallHook<[string, RenderBootstrapContext]>} renderRequire
+ * @property {SyncBailHook<[Module, RenderBootstrapContext], string>} inlineInRuntimeBailout
+ * @property {SyncBailHook<[Module, RenderContext], string>} embedInRuntimeBailout
+ * @property {SyncBailHook<[RenderContext], string>} strictRuntimeBailout
+ * @property {SyncHook<[Chunk, Hash, ChunkHashContext]>} chunkHash
+ * @property {SyncBailHook<[Chunk, RenderContext], boolean>} useSourceMap
+ */
+
+/** @type {WeakMap<Compilation, CompilationHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class JavascriptModulesPlugin {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {CompilationHooks} the attached hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				renderModuleContent: new SyncWaterfallHook([
+					"source",
+					"module",
+					"renderContext"
+				]),
+				renderModuleContainer: new SyncWaterfallHook([
+					"source",
+					"module",
+					"renderContext"
+				]),
+				renderModulePackage: new SyncWaterfallHook([
+					"source",
+					"module",
+					"renderContext"
+				]),
+				render: new SyncWaterfallHook(["source", "renderContext"]),
+				renderContent: new SyncWaterfallHook(["source", "renderContext"]),
+				renderStartup: new SyncWaterfallHook([
+					"source",
+					"module",
+					"startupRenderContext"
+				]),
+				renderChunk: new SyncWaterfallHook(["source", "renderContext"]),
+				renderMain: new SyncWaterfallHook(["source", "renderContext"]),
+				renderRequire: new SyncWaterfallHook(["code", "renderContext"]),
+				inlineInRuntimeBailout: new SyncBailHook(["module", "renderContext"]),
+				embedInRuntimeBailout: new SyncBailHook(["module", "renderContext"]),
+				strictRuntimeBailout: new SyncBailHook(["renderContext"]),
+				chunkHash: new SyncHook(["chunk", "hash", "context"]),
+				useSourceMap: new SyncBailHook(["chunk", "renderContext"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	constructor(options = {}) {
+		this.options = options;
+		/** @type {WeakMap<Source, TODO>} */
+		this._moduleFactoryCache = new WeakMap();
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"JavascriptModulesPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const hooks = JavascriptModulesPlugin.getCompilationHooks(compilation);
+				normalModuleFactory.hooks.createParser
+					.for("javascript/auto")
+					.tap("JavascriptModulesPlugin", options => {
+						return new JavascriptParser("auto");
+					});
+				normalModuleFactory.hooks.createParser
+					.for("javascript/dynamic")
+					.tap("JavascriptModulesPlugin", options => {
+						return new JavascriptParser("script");
+					});
+				normalModuleFactory.hooks.createParser
+					.for("javascript/esm")
+					.tap("JavascriptModulesPlugin", options => {
+						return new JavascriptParser("module");
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("javascript/auto")
+					.tap("JavascriptModulesPlugin", () => {
+						return new JavascriptGenerator();
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("javascript/dynamic")
+					.tap("JavascriptModulesPlugin", () => {
+						return new JavascriptGenerator();
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("javascript/esm")
+					.tap("JavascriptModulesPlugin", () => {
+						return new JavascriptGenerator();
+					});
+				compilation.hooks.renderManifest.tap(
+					"JavascriptModulesPlugin",
+					(result, options) => {
+						const {
+							hash,
+							chunk,
+							chunkGraph,
+							moduleGraph,
+							runtimeTemplate,
+							dependencyTemplates,
+							outputOptions,
+							codeGenerationResults
+						} = options;
+
+						const hotUpdateChunk =
+							chunk instanceof HotUpdateChunk ? chunk : null;
+
+						let render;
+						const filenameTemplate =
+							JavascriptModulesPlugin.getChunkFilenameTemplate(
+								chunk,
+								outputOptions
+							);
+						if (hotUpdateChunk) {
+							render = () =>
+								this.renderChunk(
+									{
+										chunk,
+										dependencyTemplates,
+										runtimeTemplate,
+										moduleGraph,
+										chunkGraph,
+										codeGenerationResults,
+										strictMode: runtimeTemplate.isModule()
+									},
+									hooks
+								);
+						} else if (chunk.hasRuntime()) {
+							render = () =>
+								this.renderMain(
+									{
+										hash,
+										chunk,
+										dependencyTemplates,
+										runtimeTemplate,
+										moduleGraph,
+										chunkGraph,
+										codeGenerationResults,
+										strictMode: runtimeTemplate.isModule()
+									},
+									hooks,
+									compilation
+								);
+						} else {
+							if (!chunkHasJs(chunk, chunkGraph)) {
+								return result;
+							}
+
+							render = () =>
+								this.renderChunk(
+									{
+										chunk,
+										dependencyTemplates,
+										runtimeTemplate,
+										moduleGraph,
+										chunkGraph,
+										codeGenerationResults,
+										strictMode: runtimeTemplate.isModule()
+									},
+									hooks
+								);
+						}
+
+						result.push({
+							render,
+							filenameTemplate,
+							pathOptions: {
+								hash,
+								runtime: chunk.runtime,
+								chunk,
+								contentHashType: "javascript"
+							},
+							info: {
+								javascriptModule: compilation.runtimeTemplate.isModule()
+							},
+							identifier: hotUpdateChunk
+								? `hotupdatechunk${chunk.id}`
+								: `chunk${chunk.id}`,
+							hash: chunk.contentHash.javascript
+						});
+
+						return result;
+					}
+				);
+				compilation.hooks.chunkHash.tap(
+					"JavascriptModulesPlugin",
+					(chunk, hash, context) => {
+						hooks.chunkHash.call(chunk, hash, context);
+						if (chunk.hasRuntime()) {
+							this.updateHashWithBootstrap(
+								hash,
+								{
+									hash: "0000",
+									chunk,
+									codeGenerationResults: context.codeGenerationResults,
+									chunkGraph: context.chunkGraph,
+									moduleGraph: context.moduleGraph,
+									runtimeTemplate: context.runtimeTemplate
+								},
+								hooks
+							);
+						}
+					}
+				);
+				compilation.hooks.contentHash.tap("JavascriptModulesPlugin", chunk => {
+					const {
+						chunkGraph,
+						codeGenerationResults,
+						moduleGraph,
+						runtimeTemplate,
+						outputOptions: {
+							hashSalt,
+							hashDigest,
+							hashDigestLength,
+							hashFunction
+						}
+					} = compilation;
+					const hash = createHash(hashFunction);
+					if (hashSalt) hash.update(hashSalt);
+					if (chunk.hasRuntime()) {
+						this.updateHashWithBootstrap(
+							hash,
+							{
+								hash: "0000",
+								chunk,
+								codeGenerationResults,
+								chunkGraph: compilation.chunkGraph,
+								moduleGraph: compilation.moduleGraph,
+								runtimeTemplate: compilation.runtimeTemplate
+							},
+							hooks
+						);
+					} else {
+						hash.update(`${chunk.id} `);
+						hash.update(chunk.ids ? chunk.ids.join(",") : "");
+					}
+					hooks.chunkHash.call(chunk, hash, {
+						chunkGraph,
+						codeGenerationResults,
+						moduleGraph,
+						runtimeTemplate
+					});
+					const modules = chunkGraph.getChunkModulesIterableBySourceType(
+						chunk,
+						"javascript"
+					);
+					if (modules) {
+						const xor = new StringXor();
+						for (const m of modules) {
+							xor.add(chunkGraph.getModuleHash(m, chunk.runtime));
+						}
+						xor.updateHash(hash);
+					}
+					const runtimeModules = chunkGraph.getChunkModulesIterableBySourceType(
+						chunk,
+						"runtime"
+					);
+					if (runtimeModules) {
+						const xor = new StringXor();
+						for (const m of runtimeModules) {
+							xor.add(chunkGraph.getModuleHash(m, chunk.runtime));
+						}
+						xor.updateHash(hash);
+					}
+					const digest = /** @type {string} */ (hash.digest(hashDigest));
+					chunk.contentHash.javascript = nonNumericOnlyHash(
+						digest,
+						hashDigestLength
+					);
+				});
+				compilation.hooks.additionalTreeRuntimeRequirements.tap(
+					"JavascriptModulesPlugin",
+					(chunk, set, { chunkGraph }) => {
+						if (
+							!set.has(RuntimeGlobals.startupNoDefault) &&
+							chunkGraph.hasChunkEntryDependentChunks(chunk)
+						) {
+							set.add(RuntimeGlobals.onChunksLoaded);
+							set.add(RuntimeGlobals.require);
+						}
+					}
+				);
+				compilation.hooks.executeModule.tap(
+					"JavascriptModulesPlugin",
+					(options, context) => {
+						const source =
+							options.codeGenerationResult.sources.get("javascript");
+						if (source === undefined) return;
+						const { module, moduleObject } = options;
+						const code = source.source();
+
+						const fn = vm.runInThisContext(
+							`(function(${module.moduleArgument}, ${module.exportsArgument}, __webpack_require__) {\n${code}\n/**/})`,
+							{
+								filename: module.identifier(),
+								lineOffset: -1
+							}
+						);
+						try {
+							fn.call(
+								moduleObject.exports,
+								moduleObject,
+								moduleObject.exports,
+								context.__webpack_require__
+							);
+						} catch (e) {
+							e.stack += printGeneratedCodeForStack(options.module, code);
+							throw e;
+						}
+					}
+				);
+				compilation.hooks.executeModule.tap(
+					"JavascriptModulesPlugin",
+					(options, context) => {
+						const source = options.codeGenerationResult.sources.get("runtime");
+						if (source === undefined) return;
+						let code = source.source();
+						if (typeof code !== "string") code = code.toString();
+
+						const fn = vm.runInThisContext(
+							`(function(__webpack_require__) {\n${code}\n/**/})`,
+							{
+								filename: options.module.identifier(),
+								lineOffset: -1
+							}
+						);
+						try {
+							fn.call(null, context.__webpack_require__);
+						} catch (e) {
+							e.stack += printGeneratedCodeForStack(options.module, code);
+							throw e;
+						}
+					}
+				);
+			}
+		);
+	}
+
+	static getChunkFilenameTemplate(chunk, outputOptions) {
+		if (chunk.filenameTemplate) {
+			return chunk.filenameTemplate;
+		} else if (chunk instanceof HotUpdateChunk) {
+			return outputOptions.hotUpdateChunkFilename;
+		} else if (chunk.canBeInitial()) {
+			return outputOptions.filename;
+		} else {
+			return outputOptions.chunkFilename;
+		}
+	}
+
+	/**
+	 * @param {Module} module the rendered module
+	 * @param {ChunkRenderContext} renderContext options object
+	 * @param {CompilationHooks} hooks hooks
+	 * @param {boolean} factory true: renders as factory method, false: pure module content
+	 * @returns {Source} the newly generated source from rendering
+	 */
+	renderModule(module, renderContext, hooks, factory) {
+		const {
+			chunk,
+			chunkGraph,
+			runtimeTemplate,
+			codeGenerationResults,
+			strictMode
+		} = renderContext;
+		try {
+			const codeGenResult = codeGenerationResults.get(module, chunk.runtime);
+			const moduleSource = codeGenResult.sources.get("javascript");
+			if (!moduleSource) return null;
+			if (codeGenResult.data !== undefined) {
+				const chunkInitFragments = codeGenResult.data.get("chunkInitFragments");
+				if (chunkInitFragments) {
+					for (const i of chunkInitFragments)
+						renderContext.chunkInitFragments.push(i);
+				}
+			}
+			const moduleSourcePostContent = tryRunOrWebpackError(
+				() =>
+					hooks.renderModuleContent.call(moduleSource, module, renderContext),
+				"JavascriptModulesPlugin.getCompilationHooks().renderModuleContent"
+			);
+			let moduleSourcePostContainer;
+			if (factory) {
+				const runtimeRequirements = chunkGraph.getModuleRuntimeRequirements(
+					module,
+					chunk.runtime
+				);
+				const needModule = runtimeRequirements.has(RuntimeGlobals.module);
+				const needExports = runtimeRequirements.has(RuntimeGlobals.exports);
+				const needRequire =
+					runtimeRequirements.has(RuntimeGlobals.require) ||
+					runtimeRequirements.has(RuntimeGlobals.requireScope);
+				const needThisAsExports = runtimeRequirements.has(
+					RuntimeGlobals.thisAsExports
+				);
+				const needStrict = module.buildInfo.strict && !strictMode;
+				const cacheEntry = this._moduleFactoryCache.get(
+					moduleSourcePostContent
+				);
+				let source;
+				if (
+					cacheEntry &&
+					cacheEntry.needModule === needModule &&
+					cacheEntry.needExports === needExports &&
+					cacheEntry.needRequire === needRequire &&
+					cacheEntry.needThisAsExports === needThisAsExports &&
+					cacheEntry.needStrict === needStrict
+				) {
+					source = cacheEntry.source;
+				} else {
+					const factorySource = new ConcatSource();
+					const args = [];
+					if (needExports || needRequire || needModule)
+						args.push(
+							needModule
+								? module.moduleArgument
+								: "__unused_webpack_" + module.moduleArgument
+						);
+					if (needExports || needRequire)
+						args.push(
+							needExports
+								? module.exportsArgument
+								: "__unused_webpack_" + module.exportsArgument
+						);
+					if (needRequire) args.push("__webpack_require__");
+					if (!needThisAsExports && runtimeTemplate.supportsArrowFunction()) {
+						factorySource.add("/***/ ((" + args.join(", ") + ") => {\n\n");
+					} else {
+						factorySource.add("/***/ (function(" + args.join(", ") + ") {\n\n");
+					}
+					if (needStrict) {
+						factorySource.add('"use strict";\n');
+					}
+					factorySource.add(moduleSourcePostContent);
+					factorySource.add("\n\n/***/ })");
+					source = new CachedSource(factorySource);
+					this._moduleFactoryCache.set(moduleSourcePostContent, {
+						source,
+						needModule,
+						needExports,
+						needRequire,
+						needThisAsExports,
+						needStrict
+					});
+				}
+				moduleSourcePostContainer = tryRunOrWebpackError(
+					() => hooks.renderModuleContainer.call(source, module, renderContext),
+					"JavascriptModulesPlugin.getCompilationHooks().renderModuleContainer"
+				);
+			} else {
+				moduleSourcePostContainer = moduleSourcePostContent;
+			}
+			return tryRunOrWebpackError(
+				() =>
+					hooks.renderModulePackage.call(
+						moduleSourcePostContainer,
+						module,
+						renderContext
+					),
+				"JavascriptModulesPlugin.getCompilationHooks().renderModulePackage"
+			);
+		} catch (e) {
+			e.module = module;
+			throw e;
+		}
+	}
+
+	/**
+	 * @param {RenderContext} renderContext the render context
+	 * @param {CompilationHooks} hooks hooks
+	 * @returns {Source} the rendered source
+	 */
+	renderChunk(renderContext, hooks) {
+		const { chunk, chunkGraph } = renderContext;
+		const modules = chunkGraph.getOrderedChunkModulesIterableBySourceType(
+			chunk,
+			"javascript",
+			compareModulesByIdentifier
+		);
+		const allModules = modules ? Array.from(modules) : [];
+		let strictHeader;
+		let allStrict = renderContext.strictMode;
+		if (!allStrict && allModules.every(m => m.buildInfo.strict)) {
+			const strictBailout = hooks.strictRuntimeBailout.call(renderContext);
+			strictHeader = strictBailout
+				? `// runtime can't be in strict mode because ${strictBailout}.\n`
+				: '"use strict";\n';
+			if (!strictBailout) allStrict = true;
+		}
+		/** @type {ChunkRenderContext} */
+		const chunkRenderContext = {
+			...renderContext,
+			chunkInitFragments: [],
+			strictMode: allStrict
+		};
+		const moduleSources =
+			Template.renderChunkModules(chunkRenderContext, allModules, module =>
+				this.renderModule(module, chunkRenderContext, hooks, true)
+			) || new RawSource("{}");
+		let source = tryRunOrWebpackError(
+			() => hooks.renderChunk.call(moduleSources, chunkRenderContext),
+			"JavascriptModulesPlugin.getCompilationHooks().renderChunk"
+		);
+		source = tryRunOrWebpackError(
+			() => hooks.renderContent.call(source, chunkRenderContext),
+			"JavascriptModulesPlugin.getCompilationHooks().renderContent"
+		);
+		if (!source) {
+			throw new Error(
+				"JavascriptModulesPlugin error: JavascriptModulesPlugin.getCompilationHooks().renderContent plugins should return something"
+			);
+		}
+		source = InitFragment.addToSource(
+			source,
+			chunkRenderContext.chunkInitFragments,
+			chunkRenderContext
+		);
+		source = tryRunOrWebpackError(
+			() => hooks.render.call(source, chunkRenderContext),
+			"JavascriptModulesPlugin.getCompilationHooks().render"
+		);
+		if (!source) {
+			throw new Error(
+				"JavascriptModulesPlugin error: JavascriptModulesPlugin.getCompilationHooks().render plugins should return something"
+			);
+		}
+		chunk.rendered = true;
+		return strictHeader
+			? new ConcatSource(strictHeader, source, ";")
+			: renderContext.runtimeTemplate.isModule()
+			? source
+			: new ConcatSource(source, ";");
+	}
+
+	/**
+	 * @param {MainRenderContext} renderContext options object
+	 * @param {CompilationHooks} hooks hooks
+	 * @param {Compilation} compilation the compilation
+	 * @returns {Source} the newly generated source from rendering
+	 */
+	renderMain(renderContext, hooks, compilation) {
+		const { chunk, chunkGraph, runtimeTemplate } = renderContext;
+
+		const runtimeRequirements = chunkGraph.getTreeRuntimeRequirements(chunk);
+		const iife = runtimeTemplate.isIIFE();
+
+		const bootstrap = this.renderBootstrap(renderContext, hooks);
+		const useSourceMap = hooks.useSourceMap.call(chunk, renderContext);
+
+		const allModules = Array.from(
+			chunkGraph.getOrderedChunkModulesIterableBySourceType(
+				chunk,
+				"javascript",
+				compareModulesByIdentifier
+			) || []
+		);
+
+		const hasEntryModules = chunkGraph.getNumberOfEntryModules(chunk) > 0;
+		let inlinedModules;
+		if (bootstrap.allowInlineStartup && hasEntryModules) {
+			inlinedModules = new Set(chunkGraph.getChunkEntryModulesIterable(chunk));
+		}
+
+		let source = new ConcatSource();
+		let prefix;
+		if (iife) {
+			if (runtimeTemplate.supportsArrowFunction()) {
+				source.add("/******/ (() => { // webpackBootstrap\n");
+			} else {
+				source.add("/******/ (function() { // webpackBootstrap\n");
+			}
+			prefix = "/******/ \t";
+		} else {
+			prefix = "/******/ ";
+		}
+		let allStrict = renderContext.strictMode;
+		if (!allStrict && allModules.every(m => m.buildInfo.strict)) {
+			const strictBailout = hooks.strictRuntimeBailout.call(renderContext);
+			if (strictBailout) {
+				source.add(
+					prefix +
+						`// runtime can't be in strict mode because ${strictBailout}.\n`
+				);
+			} else {
+				allStrict = true;
+				source.add(prefix + '"use strict";\n');
+			}
+		}
+
+		/** @type {ChunkRenderContext} */
+		const chunkRenderContext = {
+			...renderContext,
+			chunkInitFragments: [],
+			strictMode: allStrict
+		};
+
+		const chunkModules = Template.renderChunkModules(
+			chunkRenderContext,
+			inlinedModules
+				? allModules.filter(m => !inlinedModules.has(m))
+				: allModules,
+			module => this.renderModule(module, chunkRenderContext, hooks, true),
+			prefix
+		);
+		if (
+			chunkModules ||
+			runtimeRequirements.has(RuntimeGlobals.moduleFactories) ||
+			runtimeRequirements.has(RuntimeGlobals.moduleFactoriesAddOnly) ||
+			runtimeRequirements.has(RuntimeGlobals.require)
+		) {
+			source.add(prefix + "var __webpack_modules__ = (");
+			source.add(chunkModules || "{}");
+			source.add(");\n");
+			source.add(
+				"/************************************************************************/\n"
+			);
+		}
+
+		if (bootstrap.header.length > 0) {
+			const header = Template.asString(bootstrap.header) + "\n";
+			source.add(
+				new PrefixSource(
+					prefix,
+					useSourceMap
+						? new OriginalSource(header, "webpack/bootstrap")
+						: new RawSource(header)
+				)
+			);
+			source.add(
+				"/************************************************************************/\n"
+			);
+		}
+
+		const runtimeModules =
+			renderContext.chunkGraph.getChunkRuntimeModulesInOrder(chunk);
+
+		if (runtimeModules.length > 0) {
+			source.add(
+				new PrefixSource(
+					prefix,
+					Template.renderRuntimeModules(runtimeModules, chunkRenderContext)
+				)
+			);
+			source.add(
+				"/************************************************************************/\n"
+			);
+			// runtimeRuntimeModules calls codeGeneration
+			for (const module of runtimeModules) {
+				compilation.codeGeneratedModules.add(module);
+			}
+		}
+		if (inlinedModules) {
+			if (bootstrap.beforeStartup.length > 0) {
+				const beforeStartup = Template.asString(bootstrap.beforeStartup) + "\n";
+				source.add(
+					new PrefixSource(
+						prefix,
+						useSourceMap
+							? new OriginalSource(beforeStartup, "webpack/before-startup")
+							: new RawSource(beforeStartup)
+					)
+				);
+			}
+			const lastInlinedModule = last(inlinedModules);
+			const startupSource = new ConcatSource();
+			startupSource.add(`var __webpack_exports__ = {};\n`);
+			for (const m of inlinedModules) {
+				const renderedModule = this.renderModule(
+					m,
+					chunkRenderContext,
+					hooks,
+					false
+				);
+				if (renderedModule) {
+					const innerStrict = !allStrict && m.buildInfo.strict;
+					const runtimeRequirements = chunkGraph.getModuleRuntimeRequirements(
+						m,
+						chunk.runtime
+					);
+					const exports = runtimeRequirements.has(RuntimeGlobals.exports);
+					const webpackExports =
+						exports && m.exportsArgument === "__webpack_exports__";
+					let iife = innerStrict
+						? "it need to be in strict mode."
+						: inlinedModules.size > 1
+						? // TODO check globals and top-level declarations of other entries and chunk modules
+						  // to make a better decision
+						  "it need to be isolated against other entry modules."
+						: chunkModules
+						? "it need to be isolated against other modules in the chunk."
+						: exports && !webpackExports
+						? `it uses a non-standard name for the exports (${m.exportsArgument}).`
+						: hooks.embedInRuntimeBailout.call(m, renderContext);
+					let footer;
+					if (iife !== undefined) {
+						startupSource.add(
+							`// This entry need to be wrapped in an IIFE because ${iife}\n`
+						);
+						const arrow = runtimeTemplate.supportsArrowFunction();
+						if (arrow) {
+							startupSource.add("(() => {\n");
+							footer = "\n})();\n\n";
+						} else {
+							startupSource.add("!function() {\n");
+							footer = "\n}();\n";
+						}
+						if (innerStrict) startupSource.add('"use strict";\n');
+					} else {
+						footer = "\n";
+					}
+					if (exports) {
+						if (m !== lastInlinedModule)
+							startupSource.add(`var ${m.exportsArgument} = {};\n`);
+						else if (m.exportsArgument !== "__webpack_exports__")
+							startupSource.add(
+								`var ${m.exportsArgument} = __webpack_exports__;\n`
+							);
+					}
+					startupSource.add(renderedModule);
+					startupSource.add(footer);
+				}
+			}
+			if (runtimeRequirements.has(RuntimeGlobals.onChunksLoaded)) {
+				startupSource.add(
+					`__webpack_exports__ = ${RuntimeGlobals.onChunksLoaded}(__webpack_exports__);\n`
+				);
+			}
+			source.add(
+				hooks.renderStartup.call(startupSource, lastInlinedModule, {
+					...renderContext,
+					inlined: true
+				})
+			);
+			if (bootstrap.afterStartup.length > 0) {
+				const afterStartup = Template.asString(bootstrap.afterStartup) + "\n";
+				source.add(
+					new PrefixSource(
+						prefix,
+						useSourceMap
+							? new OriginalSource(afterStartup, "webpack/after-startup")
+							: new RawSource(afterStartup)
+					)
+				);
+			}
+		} else {
+			const lastEntryModule = last(
+				chunkGraph.getChunkEntryModulesIterable(chunk)
+			);
+			const toSource = useSourceMap
+				? (content, name) =>
+						new OriginalSource(Template.asString(content), name)
+				: content => new RawSource(Template.asString(content));
+			source.add(
+				new PrefixSource(
+					prefix,
+					new ConcatSource(
+						toSource(bootstrap.beforeStartup, "webpack/before-startup"),
+						"\n",
+						hooks.renderStartup.call(
+							toSource(bootstrap.startup.concat(""), "webpack/startup"),
+							lastEntryModule,
+							{
+								...renderContext,
+								inlined: false
+							}
+						),
+						toSource(bootstrap.afterStartup, "webpack/after-startup"),
+						"\n"
+					)
+				)
+			);
+		}
+		if (
+			hasEntryModules &&
+			runtimeRequirements.has(RuntimeGlobals.returnExportsFromRuntime)
+		) {
+			source.add(`${prefix}return __webpack_exports__;\n`);
+		}
+		if (iife) {
+			source.add("/******/ })()\n");
+		}
+
+		/** @type {Source} */
+		let finalSource = tryRunOrWebpackError(
+			() => hooks.renderMain.call(source, renderContext),
+			"JavascriptModulesPlugin.getCompilationHooks().renderMain"
+		);
+		if (!finalSource) {
+			throw new Error(
+				"JavascriptModulesPlugin error: JavascriptModulesPlugin.getCompilationHooks().renderMain plugins should return something"
+			);
+		}
+		finalSource = tryRunOrWebpackError(
+			() => hooks.renderContent.call(finalSource, renderContext),
+			"JavascriptModulesPlugin.getCompilationHooks().renderContent"
+		);
+		if (!finalSource) {
+			throw new Error(
+				"JavascriptModulesPlugin error: JavascriptModulesPlugin.getCompilationHooks().renderContent plugins should return something"
+			);
+		}
+		finalSource = InitFragment.addToSource(
+			finalSource,
+			chunkRenderContext.chunkInitFragments,
+			chunkRenderContext
+		);
+		finalSource = tryRunOrWebpackError(
+			() => hooks.render.call(finalSource, renderContext),
+			"JavascriptModulesPlugin.getCompilationHooks().render"
+		);
+		if (!finalSource) {
+			throw new Error(
+				"JavascriptModulesPlugin error: JavascriptModulesPlugin.getCompilationHooks().render plugins should return something"
+			);
+		}
+		chunk.rendered = true;
+		return iife ? new ConcatSource(finalSource, ";") : finalSource;
+	}
+
+	/**
+	 * @param {Hash} hash the hash to be updated
+	 * @param {RenderBootstrapContext} renderContext options object
+	 * @param {CompilationHooks} hooks hooks
+	 */
+	updateHashWithBootstrap(hash, renderContext, hooks) {
+		const bootstrap = this.renderBootstrap(renderContext, hooks);
+		for (const key of Object.keys(bootstrap)) {
+			hash.update(key);
+			if (Array.isArray(bootstrap[key])) {
+				for (const line of bootstrap[key]) {
+					hash.update(line);
+				}
+			} else {
+				hash.update(JSON.stringify(bootstrap[key]));
+			}
+		}
+	}
+
+	/**
+	 * @param {RenderBootstrapContext} renderContext options object
+	 * @param {CompilationHooks} hooks hooks
+	 * @returns {{ header: string[], beforeStartup: string[], startup: string[], afterStartup: string[], allowInlineStartup: boolean }} the generated source of the bootstrap code
+	 */
+	renderBootstrap(renderContext, hooks) {
+		const {
+			chunkGraph,
+			codeGenerationResults,
+			moduleGraph,
+			chunk,
+			runtimeTemplate
+		} = renderContext;
+
+		const runtimeRequirements = chunkGraph.getTreeRuntimeRequirements(chunk);
+
+		const requireFunction = runtimeRequirements.has(RuntimeGlobals.require);
+		const moduleCache = runtimeRequirements.has(RuntimeGlobals.moduleCache);
+		const moduleFactories = runtimeRequirements.has(
+			RuntimeGlobals.moduleFactories
+		);
+		const moduleUsed = runtimeRequirements.has(RuntimeGlobals.module);
+		const requireScopeUsed = runtimeRequirements.has(
+			RuntimeGlobals.requireScope
+		);
+		const interceptModuleExecution = runtimeRequirements.has(
+			RuntimeGlobals.interceptModuleExecution
+		);
+
+		const useRequire =
+			requireFunction || interceptModuleExecution || moduleUsed;
+
+		const result = {
+			header: [],
+			beforeStartup: [],
+			startup: [],
+			afterStartup: [],
+			allowInlineStartup: true
+		};
+
+		let { header: buf, startup, beforeStartup, afterStartup } = result;
+
+		if (result.allowInlineStartup && moduleFactories) {
+			startup.push(
+				"// module factories are used so entry inlining is disabled"
+			);
+			result.allowInlineStartup = false;
+		}
+		if (result.allowInlineStartup && moduleCache) {
+			startup.push("// module cache are used so entry inlining is disabled");
+			result.allowInlineStartup = false;
+		}
+		if (result.allowInlineStartup && interceptModuleExecution) {
+			startup.push(
+				"// module execution is intercepted so entry inlining is disabled"
+			);
+			result.allowInlineStartup = false;
+		}
+
+		if (useRequire || moduleCache) {
+			buf.push("// The module cache");
+			buf.push("var __webpack_module_cache__ = {};");
+			buf.push("");
+		}
+
+		if (useRequire) {
+			buf.push("// The require function");
+			buf.push(`function __webpack_require__(moduleId) {`);
+			buf.push(Template.indent(this.renderRequire(renderContext, hooks)));
+			buf.push("}");
+			buf.push("");
+		} else if (runtimeRequirements.has(RuntimeGlobals.requireScope)) {
+			buf.push("// The require scope");
+			buf.push("var __webpack_require__ = {};");
+			buf.push("");
+		}
+
+		if (
+			moduleFactories ||
+			runtimeRequirements.has(RuntimeGlobals.moduleFactoriesAddOnly)
+		) {
+			buf.push("// expose the modules object (__webpack_modules__)");
+			buf.push(`${RuntimeGlobals.moduleFactories} = __webpack_modules__;`);
+			buf.push("");
+		}
+
+		if (moduleCache) {
+			buf.push("// expose the module cache");
+			buf.push(`${RuntimeGlobals.moduleCache} = __webpack_module_cache__;`);
+			buf.push("");
+		}
+
+		if (interceptModuleExecution) {
+			buf.push("// expose the module execution interceptor");
+			buf.push(`${RuntimeGlobals.interceptModuleExecution} = [];`);
+			buf.push("");
+		}
+
+		if (!runtimeRequirements.has(RuntimeGlobals.startupNoDefault)) {
+			if (chunkGraph.getNumberOfEntryModules(chunk) > 0) {
+				/** @type {string[]} */
+				const buf2 = [];
+				const runtimeRequirements =
+					chunkGraph.getTreeRuntimeRequirements(chunk);
+				buf2.push("// Load entry module and return exports");
+				let i = chunkGraph.getNumberOfEntryModules(chunk);
+				for (const [
+					entryModule,
+					entrypoint
+				] of chunkGraph.getChunkEntryModulesWithChunkGroupIterable(chunk)) {
+					const chunks = entrypoint.chunks.filter(c => c !== chunk);
+					if (result.allowInlineStartup && chunks.length > 0) {
+						buf2.push(
+							"// This entry module depends on other loaded chunks and execution need to be delayed"
+						);
+						result.allowInlineStartup = false;
+					}
+					if (
+						result.allowInlineStartup &&
+						someInIterable(
+							moduleGraph.getIncomingConnectionsByOriginModule(entryModule),
+							([originModule, connections]) =>
+								originModule &&
+								connections.some(c => c.isTargetActive(chunk.runtime)) &&
+								someInIterable(
+									chunkGraph.getModuleRuntimes(originModule),
+									runtime =>
+										intersectRuntime(runtime, chunk.runtime) !== undefined
+								)
+						)
+					) {
+						buf2.push(
+							"// This entry module is referenced by other modules so it can't be inlined"
+						);
+						result.allowInlineStartup = false;
+					}
+
+					let data;
+					if (codeGenerationResults.has(entryModule, chunk.runtime)) {
+						const result = codeGenerationResults.get(
+							entryModule,
+							chunk.runtime
+						);
+						data = result.data;
+					}
+					if (
+						result.allowInlineStartup &&
+						(!data || !data.get("topLevelDeclarations")) &&
+						(!entryModule.buildInfo ||
+							!entryModule.buildInfo.topLevelDeclarations)
+					) {
+						buf2.push(
+							"// This entry module doesn't tell about it's top-level declarations so it can't be inlined"
+						);
+						result.allowInlineStartup = false;
+					}
+					if (result.allowInlineStartup) {
+						const bailout = hooks.inlineInRuntimeBailout.call(
+							entryModule,
+							renderContext
+						);
+						if (bailout !== undefined) {
+							buf2.push(
+								`// This entry module can't be inlined because ${bailout}`
+							);
+							result.allowInlineStartup = false;
+						}
+					}
+					i--;
+					const moduleId = chunkGraph.getModuleId(entryModule);
+					const entryRuntimeRequirements =
+						chunkGraph.getModuleRuntimeRequirements(entryModule, chunk.runtime);
+					let moduleIdExpr = JSON.stringify(moduleId);
+					if (runtimeRequirements.has(RuntimeGlobals.entryModuleId)) {
+						moduleIdExpr = `${RuntimeGlobals.entryModuleId} = ${moduleIdExpr}`;
+					}
+					if (
+						result.allowInlineStartup &&
+						entryRuntimeRequirements.has(RuntimeGlobals.module)
+					) {
+						result.allowInlineStartup = false;
+						buf2.push(
+							"// This entry module used 'module' so it can't be inlined"
+						);
+					}
+					if (chunks.length > 0) {
+						buf2.push(
+							`${i === 0 ? "var __webpack_exports__ = " : ""}${
+								RuntimeGlobals.onChunksLoaded
+							}(undefined, ${JSON.stringify(
+								chunks.map(c => c.id)
+							)}, ${runtimeTemplate.returningFunction(
+								`__webpack_require__(${moduleIdExpr})`
+							)})`
+						);
+					} else if (useRequire) {
+						buf2.push(
+							`${
+								i === 0 ? "var __webpack_exports__ = " : ""
+							}__webpack_require__(${moduleIdExpr});`
+						);
+					} else {
+						if (i === 0) buf2.push("var __webpack_exports__ = {};");
+						if (requireScopeUsed) {
+							buf2.push(
+								`__webpack_modules__[${moduleIdExpr}](0, ${
+									i === 0 ? "__webpack_exports__" : "{}"
+								}, __webpack_require__);`
+							);
+						} else if (entryRuntimeRequirements.has(RuntimeGlobals.exports)) {
+							buf2.push(
+								`__webpack_modules__[${moduleIdExpr}](0, ${
+									i === 0 ? "__webpack_exports__" : "{}"
+								});`
+							);
+						} else {
+							buf2.push(`__webpack_modules__[${moduleIdExpr}]();`);
+						}
+					}
+				}
+				if (runtimeRequirements.has(RuntimeGlobals.onChunksLoaded)) {
+					buf2.push(
+						`__webpack_exports__ = ${RuntimeGlobals.onChunksLoaded}(__webpack_exports__);`
+					);
+				}
+				if (
+					runtimeRequirements.has(RuntimeGlobals.startup) ||
+					(runtimeRequirements.has(RuntimeGlobals.startupOnlyBefore) &&
+						runtimeRequirements.has(RuntimeGlobals.startupOnlyAfter))
+				) {
+					result.allowInlineStartup = false;
+					buf.push("// the startup function");
+					buf.push(
+						`${RuntimeGlobals.startup} = ${runtimeTemplate.basicFunction("", [
+							...buf2,
+							"return __webpack_exports__;"
+						])};`
+					);
+					buf.push("");
+					startup.push("// run startup");
+					startup.push(
+						`var __webpack_exports__ = ${RuntimeGlobals.startup}();`
+					);
+				} else if (runtimeRequirements.has(RuntimeGlobals.startupOnlyBefore)) {
+					buf.push("// the startup function");
+					buf.push(
+						`${RuntimeGlobals.startup} = ${runtimeTemplate.emptyFunction()};`
+					);
+					beforeStartup.push("// run runtime startup");
+					beforeStartup.push(`${RuntimeGlobals.startup}();`);
+					startup.push("// startup");
+					startup.push(Template.asString(buf2));
+				} else if (runtimeRequirements.has(RuntimeGlobals.startupOnlyAfter)) {
+					buf.push("// the startup function");
+					buf.push(
+						`${RuntimeGlobals.startup} = ${runtimeTemplate.emptyFunction()};`
+					);
+					startup.push("// startup");
+					startup.push(Template.asString(buf2));
+					afterStartup.push("// run runtime startup");
+					afterStartup.push(`${RuntimeGlobals.startup}();`);
+				} else {
+					startup.push("// startup");
+					startup.push(Template.asString(buf2));
+				}
+			} else if (
+				runtimeRequirements.has(RuntimeGlobals.startup) ||
+				runtimeRequirements.has(RuntimeGlobals.startupOnlyBefore) ||
+				runtimeRequirements.has(RuntimeGlobals.startupOnlyAfter)
+			) {
+				buf.push(
+					"// the startup function",
+					"// It's empty as no entry modules are in this chunk",
+					`${RuntimeGlobals.startup} = ${runtimeTemplate.emptyFunction()};`,
+					""
+				);
+			}
+		} else if (
+			runtimeRequirements.has(RuntimeGlobals.startup) ||
+			runtimeRequirements.has(RuntimeGlobals.startupOnlyBefore) ||
+			runtimeRequirements.has(RuntimeGlobals.startupOnlyAfter)
+		) {
+			result.allowInlineStartup = false;
+			buf.push(
+				"// the startup function",
+				"// It's empty as some runtime module handles the default behavior",
+				`${RuntimeGlobals.startup} = ${runtimeTemplate.emptyFunction()};`
+			);
+			startup.push("// run startup");
+			startup.push(`var __webpack_exports__ = ${RuntimeGlobals.startup}();`);
+		}
+		return result;
+	}
+
+	/**
+	 * @param {RenderBootstrapContext} renderContext options object
+	 * @param {CompilationHooks} hooks hooks
+	 * @returns {string} the generated source of the require function
+	 */
+	renderRequire(renderContext, hooks) {
+		const {
+			chunk,
+			chunkGraph,
+			runtimeTemplate: { outputOptions }
+		} = renderContext;
+		const runtimeRequirements = chunkGraph.getTreeRuntimeRequirements(chunk);
+		const moduleExecution = runtimeRequirements.has(
+			RuntimeGlobals.interceptModuleExecution
+		)
+			? Template.asString([
+					"var execOptions = { id: moduleId, module: module, factory: __webpack_modules__[moduleId], require: __webpack_require__ };",
+					`${RuntimeGlobals.interceptModuleExecution}.forEach(function(handler) { handler(execOptions); });`,
+					"module = execOptions.module;",
+					"execOptions.factory.call(module.exports, module, module.exports, execOptions.require);"
+			  ])
+			: runtimeRequirements.has(RuntimeGlobals.thisAsExports)
+			? Template.asString([
+					"__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);"
+			  ])
+			: Template.asString([
+					"__webpack_modules__[moduleId](module, module.exports, __webpack_require__);"
+			  ]);
+		const needModuleId = runtimeRequirements.has(RuntimeGlobals.moduleId);
+		const needModuleLoaded = runtimeRequirements.has(
+			RuntimeGlobals.moduleLoaded
+		);
+		const content = Template.asString([
+			"// Check if module is in cache",
+			"var cachedModule = __webpack_module_cache__[moduleId];",
+			"if (cachedModule !== undefined) {",
+			outputOptions.strictModuleErrorHandling
+				? Template.indent([
+						"if (cachedModule.error !== undefined) throw cachedModule.error;",
+						"return cachedModule.exports;"
+				  ])
+				: Template.indent("return cachedModule.exports;"),
+			"}",
+			"// Create a new module (and put it into the cache)",
+			"var module = __webpack_module_cache__[moduleId] = {",
+			Template.indent([
+				needModuleId ? "id: moduleId," : "// no module.id needed",
+				needModuleLoaded ? "loaded: false," : "// no module.loaded needed",
+				"exports: {}"
+			]),
+			"};",
+			"",
+			outputOptions.strictModuleExceptionHandling
+				? Template.asString([
+						"// Execute the module function",
+						"var threw = true;",
+						"try {",
+						Template.indent([moduleExecution, "threw = false;"]),
+						"} finally {",
+						Template.indent([
+							"if(threw) delete __webpack_module_cache__[moduleId];"
+						]),
+						"}"
+				  ])
+				: outputOptions.strictModuleErrorHandling
+				? Template.asString([
+						"// Execute the module function",
+						"try {",
+						Template.indent(moduleExecution),
+						"} catch(e) {",
+						Template.indent(["module.error = e;", "throw e;"]),
+						"}"
+				  ])
+				: Template.asString([
+						"// Execute the module function",
+						moduleExecution
+				  ]),
+			needModuleLoaded
+				? Template.asString([
+						"",
+						"// Flag the module as loaded",
+						"module.loaded = true;",
+						""
+				  ])
+				: "",
+			"// Return the exports of the module",
+			"return module.exports;"
+		]);
+		return tryRunOrWebpackError(
+			() => hooks.renderRequire.call(content, renderContext),
+			"JavascriptModulesPlugin.getCompilationHooks().renderRequire"
+		);
+	}
+}
+
+module.exports = JavascriptModulesPlugin;
+module.exports.chunkHasJs = chunkHasJs;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptParser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptParser.js
new file mode 100644
index 0000000..93050a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptParser.js
@@ -0,0 +1,3776 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { Parser: AcornParser } = require("acorn");
+const { importAssertions } = require("acorn-import-assertions");
+const { SyncBailHook, HookMap } = require("tapable");
+const vm = require("vm");
+const Parser = require("../Parser");
+const StackedMap = require("../util/StackedMap");
+const binarySearchBounds = require("../util/binarySearchBounds");
+const memoize = require("../util/memoize");
+const BasicEvaluatedExpression = require("./BasicEvaluatedExpression");
+
+/** @typedef {import("acorn").Options} AcornOptions */
+/** @typedef {import("estree").ArrayExpression} ArrayExpressionNode */
+/** @typedef {import("estree").BinaryExpression} BinaryExpressionNode */
+/** @typedef {import("estree").BlockStatement} BlockStatementNode */
+/** @typedef {import("estree").SequenceExpression} SequenceExpressionNode */
+/** @typedef {import("estree").CallExpression} CallExpressionNode */
+/** @typedef {import("estree").ClassDeclaration} ClassDeclarationNode */
+/** @typedef {import("estree").ClassExpression} ClassExpressionNode */
+/** @typedef {import("estree").Comment} CommentNode */
+/** @typedef {import("estree").ConditionalExpression} ConditionalExpressionNode */
+/** @typedef {import("estree").Declaration} DeclarationNode */
+/** @typedef {import("estree").PrivateIdentifier} PrivateIdentifierNode */
+/** @typedef {import("estree").PropertyDefinition} PropertyDefinitionNode */
+/** @typedef {import("estree").Expression} ExpressionNode */
+/** @typedef {import("estree").Identifier} IdentifierNode */
+/** @typedef {import("estree").IfStatement} IfStatementNode */
+/** @typedef {import("estree").LabeledStatement} LabeledStatementNode */
+/** @typedef {import("estree").Literal} LiteralNode */
+/** @typedef {import("estree").LogicalExpression} LogicalExpressionNode */
+/** @typedef {import("estree").ChainExpression} ChainExpressionNode */
+/** @typedef {import("estree").MemberExpression} MemberExpressionNode */
+/** @typedef {import("estree").MetaProperty} MetaPropertyNode */
+/** @typedef {import("estree").MethodDefinition} MethodDefinitionNode */
+/** @typedef {import("estree").ModuleDeclaration} ModuleDeclarationNode */
+/** @typedef {import("estree").NewExpression} NewExpressionNode */
+/** @typedef {import("estree").Node} AnyNode */
+/** @typedef {import("estree").Program} ProgramNode */
+/** @typedef {import("estree").Statement} StatementNode */
+/** @typedef {import("estree").ImportDeclaration} ImportDeclarationNode */
+/** @typedef {import("estree").ExportNamedDeclaration} ExportNamedDeclarationNode */
+/** @typedef {import("estree").ExportDefaultDeclaration} ExportDefaultDeclarationNode */
+/** @typedef {import("estree").ExportAllDeclaration} ExportAllDeclarationNode */
+/** @typedef {import("estree").Super} SuperNode */
+/** @typedef {import("estree").TaggedTemplateExpression} TaggedTemplateExpressionNode */
+/** @typedef {import("estree").TemplateLiteral} TemplateLiteralNode */
+/** @typedef {import("estree").ThisExpression} ThisExpressionNode */
+/** @typedef {import("estree").UnaryExpression} UnaryExpressionNode */
+/** @typedef {import("estree").VariableDeclarator} VariableDeclaratorNode */
+/** @template T @typedef {import("tapable").AsArray<T>} AsArray<T> */
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../Parser").PreparsedAst} PreparsedAst */
+/** @typedef {{declaredScope: ScopeInfo, freeName: string | true, tagInfo: TagInfo | undefined}} VariableInfoInterface */
+/** @typedef {{ name: string | VariableInfo, rootInfo: string | VariableInfo, getMembers: () => string[] }} GetInfoResult */
+
+const EMPTY_ARRAY = [];
+const ALLOWED_MEMBER_TYPES_CALL_EXPRESSION = 0b01;
+const ALLOWED_MEMBER_TYPES_EXPRESSION = 0b10;
+const ALLOWED_MEMBER_TYPES_ALL = 0b11;
+
+// Syntax: https://developer.mozilla.org/en/SpiderMonkey/Parser_API
+
+const parser = AcornParser.extend(importAssertions);
+
+class VariableInfo {
+	/**
+	 * @param {ScopeInfo} declaredScope scope in which the variable is declared
+	 * @param {string | true} freeName which free name the variable aliases, or true when none
+	 * @param {TagInfo | undefined} tagInfo info about tags
+	 */
+	constructor(declaredScope, freeName, tagInfo) {
+		this.declaredScope = declaredScope;
+		this.freeName = freeName;
+		this.tagInfo = tagInfo;
+	}
+}
+
+/** @typedef {string | ScopeInfo | VariableInfo} ExportedVariableInfo */
+/** @typedef {LiteralNode | string | null | undefined} ImportSource */
+/** @typedef {Omit<AcornOptions, "sourceType" | "ecmaVersion"> & { sourceType: "module" | "script" | "auto", ecmaVersion?: AcornOptions["ecmaVersion"] }} ParseOptions */
+
+/**
+ * @typedef {Object} TagInfo
+ * @property {any} tag
+ * @property {any} data
+ * @property {TagInfo | undefined} next
+ */
+
+/**
+ * @typedef {Object} ScopeInfo
+ * @property {StackedMap<string, VariableInfo | ScopeInfo>} definitions
+ * @property {boolean | "arrow"} topLevelScope
+ * @property {boolean} inShorthand
+ * @property {boolean} isStrict
+ * @property {boolean} isAsmJs
+ * @property {boolean} inTry
+ */
+
+const joinRanges = (startRange, endRange) => {
+	if (!endRange) return startRange;
+	if (!startRange) return endRange;
+	return [startRange[0], endRange[1]];
+};
+
+const objectAndMembersToName = (object, membersReversed) => {
+	let name = object;
+	for (let i = membersReversed.length - 1; i >= 0; i--) {
+		name = name + "." + membersReversed[i];
+	}
+	return name;
+};
+
+const getRootName = expression => {
+	switch (expression.type) {
+		case "Identifier":
+			return expression.name;
+		case "ThisExpression":
+			return "this";
+		case "MetaProperty":
+			return `${expression.meta.name}.${expression.property.name}`;
+		default:
+			return undefined;
+	}
+};
+
+/** @type {AcornOptions} */
+const defaultParserOptions = {
+	ranges: true,
+	locations: true,
+	ecmaVersion: "latest",
+	sourceType: "module",
+	// https://github.com/tc39/proposal-hashbang
+	allowHashBang: true,
+	onComment: null
+};
+
+// regexp to match at least one "magic comment"
+const webpackCommentRegExp = new RegExp(/(^|\W)webpack[A-Z]{1,}[A-Za-z]{1,}:/);
+
+const EMPTY_COMMENT_OPTIONS = {
+	options: null,
+	errors: null
+};
+
+class JavascriptParser extends Parser {
+	/**
+	 * @param {"module" | "script" | "auto"} sourceType default source type
+	 */
+	constructor(sourceType = "auto") {
+		super();
+		this.hooks = Object.freeze({
+			/** @type {HookMap<SyncBailHook<[UnaryExpressionNode], BasicEvaluatedExpression | undefined | null>>} */
+			evaluateTypeof: new HookMap(() => new SyncBailHook(["expression"])),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode], BasicEvaluatedExpression | undefined | null>>} */
+			evaluate: new HookMap(() => new SyncBailHook(["expression"])),
+			/** @type {HookMap<SyncBailHook<[IdentifierNode | ThisExpressionNode | MemberExpressionNode | MetaPropertyNode], BasicEvaluatedExpression | undefined | null>>} */
+			evaluateIdentifier: new HookMap(() => new SyncBailHook(["expression"])),
+			/** @type {HookMap<SyncBailHook<[IdentifierNode | ThisExpressionNode | MemberExpressionNode], BasicEvaluatedExpression | undefined | null>>} */
+			evaluateDefinedIdentifier: new HookMap(
+				() => new SyncBailHook(["expression"])
+			),
+			/** @type {HookMap<SyncBailHook<[CallExpressionNode, BasicEvaluatedExpression | undefined], BasicEvaluatedExpression | undefined | null>>} */
+			evaluateCallExpressionMember: new HookMap(
+				() => new SyncBailHook(["expression", "param"])
+			),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode | DeclarationNode | PrivateIdentifierNode, number], boolean | void>>} */
+			isPure: new HookMap(
+				() => new SyncBailHook(["expression", "commentsStartPosition"])
+			),
+			/** @type {SyncBailHook<[StatementNode | ModuleDeclarationNode], boolean | void>} */
+			preStatement: new SyncBailHook(["statement"]),
+
+			/** @type {SyncBailHook<[StatementNode | ModuleDeclarationNode], boolean | void>} */
+			blockPreStatement: new SyncBailHook(["declaration"]),
+			/** @type {SyncBailHook<[StatementNode | ModuleDeclarationNode], boolean | void>} */
+			statement: new SyncBailHook(["statement"]),
+			/** @type {SyncBailHook<[IfStatementNode], boolean | void>} */
+			statementIf: new SyncBailHook(["statement"]),
+			/** @type {SyncBailHook<[ExpressionNode, ClassExpressionNode | ClassDeclarationNode], boolean | void>} */
+			classExtendsExpression: new SyncBailHook([
+				"expression",
+				"classDefinition"
+			]),
+			/** @type {SyncBailHook<[MethodDefinitionNode | PropertyDefinitionNode, ClassExpressionNode | ClassDeclarationNode], boolean | void>} */
+			classBodyElement: new SyncBailHook(["element", "classDefinition"]),
+			/** @type {SyncBailHook<[ExpressionNode, MethodDefinitionNode | PropertyDefinitionNode, ClassExpressionNode | ClassDeclarationNode], boolean | void>} */
+			classBodyValue: new SyncBailHook([
+				"expression",
+				"element",
+				"classDefinition"
+			]),
+			/** @type {HookMap<SyncBailHook<[LabeledStatementNode], boolean | void>>} */
+			label: new HookMap(() => new SyncBailHook(["statement"])),
+			/** @type {SyncBailHook<[ImportDeclarationNode, ImportSource], boolean | void>} */
+			import: new SyncBailHook(["statement", "source"]),
+			/** @type {SyncBailHook<[ImportDeclarationNode, ImportSource, string, string], boolean | void>} */
+			importSpecifier: new SyncBailHook([
+				"statement",
+				"source",
+				"exportName",
+				"identifierName"
+			]),
+			/** @type {SyncBailHook<[ExportNamedDeclarationNode | ExportAllDeclarationNode], boolean | void>} */
+			export: new SyncBailHook(["statement"]),
+			/** @type {SyncBailHook<[ExportNamedDeclarationNode | ExportAllDeclarationNode, ImportSource], boolean | void>} */
+			exportImport: new SyncBailHook(["statement", "source"]),
+			/** @type {SyncBailHook<[ExportNamedDeclarationNode | ExportAllDeclarationNode, DeclarationNode], boolean | void>} */
+			exportDeclaration: new SyncBailHook(["statement", "declaration"]),
+			/** @type {SyncBailHook<[ExportDefaultDeclarationNode, DeclarationNode], boolean | void>} */
+			exportExpression: new SyncBailHook(["statement", "declaration"]),
+			/** @type {SyncBailHook<[ExportNamedDeclarationNode | ExportAllDeclarationNode, string, string, number | undefined], boolean | void>} */
+			exportSpecifier: new SyncBailHook([
+				"statement",
+				"identifierName",
+				"exportName",
+				"index"
+			]),
+			/** @type {SyncBailHook<[ExportNamedDeclarationNode | ExportAllDeclarationNode, ImportSource, string, string, number | undefined], boolean | void>} */
+			exportImportSpecifier: new SyncBailHook([
+				"statement",
+				"source",
+				"identifierName",
+				"exportName",
+				"index"
+			]),
+			/** @type {SyncBailHook<[VariableDeclaratorNode, StatementNode], boolean | void>} */
+			preDeclarator: new SyncBailHook(["declarator", "statement"]),
+			/** @type {SyncBailHook<[VariableDeclaratorNode, StatementNode], boolean | void>} */
+			declarator: new SyncBailHook(["declarator", "statement"]),
+			/** @type {HookMap<SyncBailHook<[DeclarationNode], boolean | void>>} */
+			varDeclaration: new HookMap(() => new SyncBailHook(["declaration"])),
+			/** @type {HookMap<SyncBailHook<[DeclarationNode], boolean | void>>} */
+			varDeclarationLet: new HookMap(() => new SyncBailHook(["declaration"])),
+			/** @type {HookMap<SyncBailHook<[DeclarationNode], boolean | void>>} */
+			varDeclarationConst: new HookMap(() => new SyncBailHook(["declaration"])),
+			/** @type {HookMap<SyncBailHook<[DeclarationNode], boolean | void>>} */
+			varDeclarationVar: new HookMap(() => new SyncBailHook(["declaration"])),
+			/** @type {HookMap<SyncBailHook<[IdentifierNode], boolean | void>>} */
+			pattern: new HookMap(() => new SyncBailHook(["pattern"])),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode], boolean | void>>} */
+			canRename: new HookMap(() => new SyncBailHook(["initExpression"])),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode], boolean | void>>} */
+			rename: new HookMap(() => new SyncBailHook(["initExpression"])),
+			/** @type {HookMap<SyncBailHook<[import("estree").AssignmentExpression], boolean | void>>} */
+			assign: new HookMap(() => new SyncBailHook(["expression"])),
+			/** @type {HookMap<SyncBailHook<[import("estree").AssignmentExpression, string[]], boolean | void>>} */
+			assignMemberChain: new HookMap(
+				() => new SyncBailHook(["expression", "members"])
+			),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode], boolean | void>>} */
+			typeof: new HookMap(() => new SyncBailHook(["expression"])),
+			/** @type {SyncBailHook<[ExpressionNode], boolean | void>} */
+			importCall: new SyncBailHook(["expression"]),
+			/** @type {SyncBailHook<[ExpressionNode], boolean | void>} */
+			topLevelAwait: new SyncBailHook(["expression"]),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode], boolean | void>>} */
+			call: new HookMap(() => new SyncBailHook(["expression"])),
+			/** Something like "a.b()" */
+			/** @type {HookMap<SyncBailHook<[CallExpressionNode, string[]], boolean | void>>} */
+			callMemberChain: new HookMap(
+				() => new SyncBailHook(["expression", "members"])
+			),
+			/** Something like "a.b().c.d" */
+			/** @type {HookMap<SyncBailHook<[ExpressionNode, string[], CallExpressionNode, string[]], boolean | void>>} */
+			memberChainOfCallMemberChain: new HookMap(
+				() =>
+					new SyncBailHook([
+						"expression",
+						"calleeMembers",
+						"callExpression",
+						"members"
+					])
+			),
+			/** Something like "a.b().c.d()"" */
+			/** @type {HookMap<SyncBailHook<[ExpressionNode, string[], CallExpressionNode, string[]], boolean | void>>} */
+			callMemberChainOfCallMemberChain: new HookMap(
+				() =>
+					new SyncBailHook([
+						"expression",
+						"calleeMembers",
+						"innerCallExpression",
+						"members"
+					])
+			),
+			/** @type {SyncBailHook<[ChainExpressionNode], boolean | void>} */
+			optionalChaining: new SyncBailHook(["optionalChaining"]),
+			/** @type {HookMap<SyncBailHook<[NewExpressionNode], boolean | void>>} */
+			new: new HookMap(() => new SyncBailHook(["expression"])),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode], boolean | void>>} */
+			expression: new HookMap(() => new SyncBailHook(["expression"])),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode, string[]], boolean | void>>} */
+			expressionMemberChain: new HookMap(
+				() => new SyncBailHook(["expression", "members"])
+			),
+			/** @type {HookMap<SyncBailHook<[ExpressionNode, string[]], boolean | void>>} */
+			unhandledExpressionMemberChain: new HookMap(
+				() => new SyncBailHook(["expression", "members"])
+			),
+			/** @type {SyncBailHook<[ExpressionNode], boolean | void>} */
+			expressionConditionalOperator: new SyncBailHook(["expression"]),
+			/** @type {SyncBailHook<[ExpressionNode], boolean | void>} */
+			expressionLogicalOperator: new SyncBailHook(["expression"]),
+			/** @type {SyncBailHook<[ProgramNode, CommentNode[]], boolean | void>} */
+			program: new SyncBailHook(["ast", "comments"]),
+			/** @type {SyncBailHook<[ProgramNode, CommentNode[]], boolean | void>} */
+			finish: new SyncBailHook(["ast", "comments"])
+		});
+		this.sourceType = sourceType;
+		/** @type {ScopeInfo} */
+		this.scope = undefined;
+		/** @type {ParserState} */
+		this.state = undefined;
+		this.comments = undefined;
+		this.semicolons = undefined;
+		/** @type {(StatementNode|ExpressionNode)[]} */
+		this.statementPath = undefined;
+		this.prevStatement = undefined;
+		this.currentTagData = undefined;
+		this._initializeEvaluating();
+	}
+
+	_initializeEvaluating() {
+		this.hooks.evaluate.for("Literal").tap("JavascriptParser", _expr => {
+			const expr = /** @type {LiteralNode} */ (_expr);
+
+			switch (typeof expr.value) {
+				case "number":
+					return new BasicEvaluatedExpression()
+						.setNumber(expr.value)
+						.setRange(expr.range);
+				case "bigint":
+					return new BasicEvaluatedExpression()
+						.setBigInt(expr.value)
+						.setRange(expr.range);
+				case "string":
+					return new BasicEvaluatedExpression()
+						.setString(expr.value)
+						.setRange(expr.range);
+				case "boolean":
+					return new BasicEvaluatedExpression()
+						.setBoolean(expr.value)
+						.setRange(expr.range);
+			}
+			if (expr.value === null) {
+				return new BasicEvaluatedExpression().setNull().setRange(expr.range);
+			}
+			if (expr.value instanceof RegExp) {
+				return new BasicEvaluatedExpression()
+					.setRegExp(expr.value)
+					.setRange(expr.range);
+			}
+		});
+		this.hooks.evaluate.for("NewExpression").tap("JavascriptParser", _expr => {
+			const expr = /** @type {NewExpressionNode} */ (_expr);
+			const callee = expr.callee;
+			if (
+				callee.type !== "Identifier" ||
+				callee.name !== "RegExp" ||
+				expr.arguments.length > 2 ||
+				this.getVariableInfo("RegExp") !== "RegExp"
+			)
+				return;
+
+			let regExp, flags;
+			const arg1 = expr.arguments[0];
+
+			if (arg1) {
+				if (arg1.type === "SpreadElement") return;
+
+				const evaluatedRegExp = this.evaluateExpression(arg1);
+
+				if (!evaluatedRegExp) return;
+
+				regExp = evaluatedRegExp.asString();
+
+				if (!regExp) return;
+			} else {
+				return new BasicEvaluatedExpression()
+					.setRegExp(new RegExp(""))
+					.setRange(expr.range);
+			}
+
+			const arg2 = expr.arguments[1];
+
+			if (arg2) {
+				if (arg2.type === "SpreadElement") return;
+
+				const evaluatedFlags = this.evaluateExpression(arg2);
+
+				if (!evaluatedFlags) return;
+
+				if (!evaluatedFlags.isUndefined()) {
+					flags = evaluatedFlags.asString();
+
+					if (
+						flags === undefined ||
+						!BasicEvaluatedExpression.isValidRegExpFlags(flags)
+					)
+						return;
+				}
+			}
+
+			return new BasicEvaluatedExpression()
+				.setRegExp(flags ? new RegExp(regExp, flags) : new RegExp(regExp))
+				.setRange(expr.range);
+		});
+		this.hooks.evaluate
+			.for("LogicalExpression")
+			.tap("JavascriptParser", _expr => {
+				const expr = /** @type {LogicalExpressionNode} */ (_expr);
+
+				const left = this.evaluateExpression(expr.left);
+				if (!left) return;
+				let returnRight = false;
+				/** @type {boolean|undefined} */
+				let allowedRight;
+				if (expr.operator === "&&") {
+					const leftAsBool = left.asBool();
+					if (leftAsBool === false) return left.setRange(expr.range);
+					returnRight = leftAsBool === true;
+					allowedRight = false;
+				} else if (expr.operator === "||") {
+					const leftAsBool = left.asBool();
+					if (leftAsBool === true) return left.setRange(expr.range);
+					returnRight = leftAsBool === false;
+					allowedRight = true;
+				} else if (expr.operator === "??") {
+					const leftAsNullish = left.asNullish();
+					if (leftAsNullish === false) return left.setRange(expr.range);
+					if (leftAsNullish !== true) return;
+					returnRight = true;
+				} else return;
+				const right = this.evaluateExpression(expr.right);
+				if (!right) return;
+				if (returnRight) {
+					if (left.couldHaveSideEffects()) right.setSideEffects();
+					return right.setRange(expr.range);
+				}
+
+				const asBool = right.asBool();
+
+				if (allowedRight === true && asBool === true) {
+					return new BasicEvaluatedExpression()
+						.setRange(expr.range)
+						.setTruthy();
+				} else if (allowedRight === false && asBool === false) {
+					return new BasicEvaluatedExpression().setRange(expr.range).setFalsy();
+				}
+			});
+
+		const valueAsExpression = (value, expr, sideEffects) => {
+			switch (typeof value) {
+				case "boolean":
+					return new BasicEvaluatedExpression()
+						.setBoolean(value)
+						.setSideEffects(sideEffects)
+						.setRange(expr.range);
+				case "number":
+					return new BasicEvaluatedExpression()
+						.setNumber(value)
+						.setSideEffects(sideEffects)
+						.setRange(expr.range);
+				case "bigint":
+					return new BasicEvaluatedExpression()
+						.setBigInt(value)
+						.setSideEffects(sideEffects)
+						.setRange(expr.range);
+				case "string":
+					return new BasicEvaluatedExpression()
+						.setString(value)
+						.setSideEffects(sideEffects)
+						.setRange(expr.range);
+			}
+		};
+
+		this.hooks.evaluate
+			.for("BinaryExpression")
+			.tap("JavascriptParser", _expr => {
+				const expr = /** @type {BinaryExpressionNode} */ (_expr);
+
+				const handleConstOperation = fn => {
+					const left = this.evaluateExpression(expr.left);
+					if (!left || !left.isCompileTimeValue()) return;
+
+					const right = this.evaluateExpression(expr.right);
+					if (!right || !right.isCompileTimeValue()) return;
+
+					const result = fn(
+						left.asCompileTimeValue(),
+						right.asCompileTimeValue()
+					);
+					return valueAsExpression(
+						result,
+						expr,
+						left.couldHaveSideEffects() || right.couldHaveSideEffects()
+					);
+				};
+
+				const isAlwaysDifferent = (a, b) =>
+					(a === true && b === false) || (a === false && b === true);
+
+				const handleTemplateStringCompare = (left, right, res, eql) => {
+					const getPrefix = parts => {
+						let value = "";
+						for (const p of parts) {
+							const v = p.asString();
+							if (v !== undefined) value += v;
+							else break;
+						}
+						return value;
+					};
+					const getSuffix = parts => {
+						let value = "";
+						for (let i = parts.length - 1; i >= 0; i--) {
+							const v = parts[i].asString();
+							if (v !== undefined) value = v + value;
+							else break;
+						}
+						return value;
+					};
+					const leftPrefix = getPrefix(left.parts);
+					const rightPrefix = getPrefix(right.parts);
+					const leftSuffix = getSuffix(left.parts);
+					const rightSuffix = getSuffix(right.parts);
+					const lenPrefix = Math.min(leftPrefix.length, rightPrefix.length);
+					const lenSuffix = Math.min(leftSuffix.length, rightSuffix.length);
+					if (
+						leftPrefix.slice(0, lenPrefix) !==
+							rightPrefix.slice(0, lenPrefix) ||
+						leftSuffix.slice(-lenSuffix) !== rightSuffix.slice(-lenSuffix)
+					) {
+						return res
+							.setBoolean(!eql)
+							.setSideEffects(
+								left.couldHaveSideEffects() || right.couldHaveSideEffects()
+							);
+					}
+				};
+
+				const handleStrictEqualityComparison = eql => {
+					const left = this.evaluateExpression(expr.left);
+					if (!left) return;
+					const right = this.evaluateExpression(expr.right);
+					if (!right) return;
+					const res = new BasicEvaluatedExpression();
+					res.setRange(expr.range);
+
+					const leftConst = left.isCompileTimeValue();
+					const rightConst = right.isCompileTimeValue();
+
+					if (leftConst && rightConst) {
+						return res
+							.setBoolean(
+								eql ===
+									(left.asCompileTimeValue() === right.asCompileTimeValue())
+							)
+							.setSideEffects(
+								left.couldHaveSideEffects() || right.couldHaveSideEffects()
+							);
+					}
+
+					if (left.isArray() && right.isArray()) {
+						return res
+							.setBoolean(!eql)
+							.setSideEffects(
+								left.couldHaveSideEffects() || right.couldHaveSideEffects()
+							);
+					}
+					if (left.isTemplateString() && right.isTemplateString()) {
+						return handleTemplateStringCompare(left, right, res, eql);
+					}
+
+					const leftPrimitive = left.isPrimitiveType();
+					const rightPrimitive = right.isPrimitiveType();
+
+					if (
+						// Primitive !== Object or
+						// compile-time object types are never equal to something at runtime
+						(leftPrimitive === false &&
+							(leftConst || rightPrimitive === true)) ||
+						(rightPrimitive === false &&
+							(rightConst || leftPrimitive === true)) ||
+						// Different nullish or boolish status also means not equal
+						isAlwaysDifferent(left.asBool(), right.asBool()) ||
+						isAlwaysDifferent(left.asNullish(), right.asNullish())
+					) {
+						return res
+							.setBoolean(!eql)
+							.setSideEffects(
+								left.couldHaveSideEffects() || right.couldHaveSideEffects()
+							);
+					}
+				};
+
+				const handleAbstractEqualityComparison = eql => {
+					const left = this.evaluateExpression(expr.left);
+					if (!left) return;
+					const right = this.evaluateExpression(expr.right);
+					if (!right) return;
+					const res = new BasicEvaluatedExpression();
+					res.setRange(expr.range);
+
+					const leftConst = left.isCompileTimeValue();
+					const rightConst = right.isCompileTimeValue();
+
+					if (leftConst && rightConst) {
+						return res
+							.setBoolean(
+								eql ===
+									// eslint-disable-next-line eqeqeq
+									(left.asCompileTimeValue() == right.asCompileTimeValue())
+							)
+							.setSideEffects(
+								left.couldHaveSideEffects() || right.couldHaveSideEffects()
+							);
+					}
+
+					if (left.isArray() && right.isArray()) {
+						return res
+							.setBoolean(!eql)
+							.setSideEffects(
+								left.couldHaveSideEffects() || right.couldHaveSideEffects()
+							);
+					}
+					if (left.isTemplateString() && right.isTemplateString()) {
+						return handleTemplateStringCompare(left, right, res, eql);
+					}
+				};
+
+				if (expr.operator === "+") {
+					const left = this.evaluateExpression(expr.left);
+					if (!left) return;
+					const right = this.evaluateExpression(expr.right);
+					if (!right) return;
+					const res = new BasicEvaluatedExpression();
+					if (left.isString()) {
+						if (right.isString()) {
+							res.setString(left.string + right.string);
+						} else if (right.isNumber()) {
+							res.setString(left.string + right.number);
+						} else if (
+							right.isWrapped() &&
+							right.prefix &&
+							right.prefix.isString()
+						) {
+							// "left" + ("prefix" + inner + "postfix")
+							// => ("leftPrefix" + inner + "postfix")
+							res.setWrapped(
+								new BasicEvaluatedExpression()
+									.setString(left.string + right.prefix.string)
+									.setRange(joinRanges(left.range, right.prefix.range)),
+								right.postfix,
+								right.wrappedInnerExpressions
+							);
+						} else if (right.isWrapped()) {
+							// "left" + ([null] + inner + "postfix")
+							// => ("left" + inner + "postfix")
+							res.setWrapped(
+								left,
+								right.postfix,
+								right.wrappedInnerExpressions
+							);
+						} else {
+							// "left" + expr
+							// => ("left" + expr + "")
+							res.setWrapped(left, null, [right]);
+						}
+					} else if (left.isNumber()) {
+						if (right.isString()) {
+							res.setString(left.number + right.string);
+						} else if (right.isNumber()) {
+							res.setNumber(left.number + right.number);
+						} else {
+							return;
+						}
+					} else if (left.isBigInt()) {
+						if (right.isBigInt()) {
+							res.setBigInt(left.bigint + right.bigint);
+						}
+					} else if (left.isWrapped()) {
+						if (left.postfix && left.postfix.isString() && right.isString()) {
+							// ("prefix" + inner + "postfix") + "right"
+							// => ("prefix" + inner + "postfixRight")
+							res.setWrapped(
+								left.prefix,
+								new BasicEvaluatedExpression()
+									.setString(left.postfix.string + right.string)
+									.setRange(joinRanges(left.postfix.range, right.range)),
+								left.wrappedInnerExpressions
+							);
+						} else if (
+							left.postfix &&
+							left.postfix.isString() &&
+							right.isNumber()
+						) {
+							// ("prefix" + inner + "postfix") + 123
+							// => ("prefix" + inner + "postfix123")
+							res.setWrapped(
+								left.prefix,
+								new BasicEvaluatedExpression()
+									.setString(left.postfix.string + right.number)
+									.setRange(joinRanges(left.postfix.range, right.range)),
+								left.wrappedInnerExpressions
+							);
+						} else if (right.isString()) {
+							// ("prefix" + inner + [null]) + "right"
+							// => ("prefix" + inner + "right")
+							res.setWrapped(left.prefix, right, left.wrappedInnerExpressions);
+						} else if (right.isNumber()) {
+							// ("prefix" + inner + [null]) + 123
+							// => ("prefix" + inner + "123")
+							res.setWrapped(
+								left.prefix,
+								new BasicEvaluatedExpression()
+									.setString(right.number + "")
+									.setRange(right.range),
+								left.wrappedInnerExpressions
+							);
+						} else if (right.isWrapped()) {
+							// ("prefix1" + inner1 + "postfix1") + ("prefix2" + inner2 + "postfix2")
+							// ("prefix1" + inner1 + "postfix1" + "prefix2" + inner2 + "postfix2")
+							res.setWrapped(
+								left.prefix,
+								right.postfix,
+								left.wrappedInnerExpressions &&
+									right.wrappedInnerExpressions &&
+									left.wrappedInnerExpressions
+										.concat(left.postfix ? [left.postfix] : [])
+										.concat(right.prefix ? [right.prefix] : [])
+										.concat(right.wrappedInnerExpressions)
+							);
+						} else {
+							// ("prefix" + inner + postfix) + expr
+							// => ("prefix" + inner + postfix + expr + [null])
+							res.setWrapped(
+								left.prefix,
+								null,
+								left.wrappedInnerExpressions &&
+									left.wrappedInnerExpressions.concat(
+										left.postfix ? [left.postfix, right] : [right]
+									)
+							);
+						}
+					} else {
+						if (right.isString()) {
+							// left + "right"
+							// => ([null] + left + "right")
+							res.setWrapped(null, right, [left]);
+						} else if (right.isWrapped()) {
+							// left + (prefix + inner + "postfix")
+							// => ([null] + left + prefix + inner + "postfix")
+							res.setWrapped(
+								null,
+								right.postfix,
+								right.wrappedInnerExpressions &&
+									(right.prefix ? [left, right.prefix] : [left]).concat(
+										right.wrappedInnerExpressions
+									)
+							);
+						} else {
+							return;
+						}
+					}
+					if (left.couldHaveSideEffects() || right.couldHaveSideEffects())
+						res.setSideEffects();
+					res.setRange(expr.range);
+					return res;
+				} else if (expr.operator === "-") {
+					return handleConstOperation((l, r) => l - r);
+				} else if (expr.operator === "*") {
+					return handleConstOperation((l, r) => l * r);
+				} else if (expr.operator === "/") {
+					return handleConstOperation((l, r) => l / r);
+				} else if (expr.operator === "**") {
+					return handleConstOperation((l, r) => l ** r);
+				} else if (expr.operator === "===") {
+					return handleStrictEqualityComparison(true);
+				} else if (expr.operator === "==") {
+					return handleAbstractEqualityComparison(true);
+				} else if (expr.operator === "!==") {
+					return handleStrictEqualityComparison(false);
+				} else if (expr.operator === "!=") {
+					return handleAbstractEqualityComparison(false);
+				} else if (expr.operator === "&") {
+					return handleConstOperation((l, r) => l & r);
+				} else if (expr.operator === "|") {
+					return handleConstOperation((l, r) => l | r);
+				} else if (expr.operator === "^") {
+					return handleConstOperation((l, r) => l ^ r);
+				} else if (expr.operator === ">>>") {
+					return handleConstOperation((l, r) => l >>> r);
+				} else if (expr.operator === ">>") {
+					return handleConstOperation((l, r) => l >> r);
+				} else if (expr.operator === "<<") {
+					return handleConstOperation((l, r) => l << r);
+				} else if (expr.operator === "<") {
+					return handleConstOperation((l, r) => l < r);
+				} else if (expr.operator === ">") {
+					return handleConstOperation((l, r) => l > r);
+				} else if (expr.operator === "<=") {
+					return handleConstOperation((l, r) => l <= r);
+				} else if (expr.operator === ">=") {
+					return handleConstOperation((l, r) => l >= r);
+				}
+			});
+		this.hooks.evaluate
+			.for("UnaryExpression")
+			.tap("JavascriptParser", _expr => {
+				const expr = /** @type {UnaryExpressionNode} */ (_expr);
+
+				const handleConstOperation = fn => {
+					const argument = this.evaluateExpression(expr.argument);
+					if (!argument || !argument.isCompileTimeValue()) return;
+					const result = fn(argument.asCompileTimeValue());
+					return valueAsExpression(
+						result,
+						expr,
+						argument.couldHaveSideEffects()
+					);
+				};
+
+				if (expr.operator === "typeof") {
+					switch (expr.argument.type) {
+						case "Identifier": {
+							const res = this.callHooksForName(
+								this.hooks.evaluateTypeof,
+								expr.argument.name,
+								expr
+							);
+							if (res !== undefined) return res;
+							break;
+						}
+						case "MetaProperty": {
+							const res = this.callHooksForName(
+								this.hooks.evaluateTypeof,
+								getRootName(expr.argument),
+								expr
+							);
+							if (res !== undefined) return res;
+							break;
+						}
+						case "MemberExpression": {
+							const res = this.callHooksForExpression(
+								this.hooks.evaluateTypeof,
+								expr.argument,
+								expr
+							);
+							if (res !== undefined) return res;
+							break;
+						}
+						case "ChainExpression": {
+							const res = this.callHooksForExpression(
+								this.hooks.evaluateTypeof,
+								expr.argument.expression,
+								expr
+							);
+							if (res !== undefined) return res;
+							break;
+						}
+						case "FunctionExpression": {
+							return new BasicEvaluatedExpression()
+								.setString("function")
+								.setRange(expr.range);
+						}
+					}
+					const arg = this.evaluateExpression(expr.argument);
+					if (arg.isUnknown()) return;
+					if (arg.isString()) {
+						return new BasicEvaluatedExpression()
+							.setString("string")
+							.setRange(expr.range);
+					}
+					if (arg.isWrapped()) {
+						return new BasicEvaluatedExpression()
+							.setString("string")
+							.setSideEffects()
+							.setRange(expr.range);
+					}
+					if (arg.isUndefined()) {
+						return new BasicEvaluatedExpression()
+							.setString("undefined")
+							.setRange(expr.range);
+					}
+					if (arg.isNumber()) {
+						return new BasicEvaluatedExpression()
+							.setString("number")
+							.setRange(expr.range);
+					}
+					if (arg.isBigInt()) {
+						return new BasicEvaluatedExpression()
+							.setString("bigint")
+							.setRange(expr.range);
+					}
+					if (arg.isBoolean()) {
+						return new BasicEvaluatedExpression()
+							.setString("boolean")
+							.setRange(expr.range);
+					}
+					if (arg.isConstArray() || arg.isRegExp() || arg.isNull()) {
+						return new BasicEvaluatedExpression()
+							.setString("object")
+							.setRange(expr.range);
+					}
+					if (arg.isArray()) {
+						return new BasicEvaluatedExpression()
+							.setString("object")
+							.setSideEffects(arg.couldHaveSideEffects())
+							.setRange(expr.range);
+					}
+				} else if (expr.operator === "!") {
+					const argument = this.evaluateExpression(expr.argument);
+					if (!argument) return;
+					const bool = argument.asBool();
+					if (typeof bool !== "boolean") return;
+					return new BasicEvaluatedExpression()
+						.setBoolean(!bool)
+						.setSideEffects(argument.couldHaveSideEffects())
+						.setRange(expr.range);
+				} else if (expr.operator === "~") {
+					return handleConstOperation(v => ~v);
+				} else if (expr.operator === "+") {
+					return handleConstOperation(v => +v);
+				} else if (expr.operator === "-") {
+					return handleConstOperation(v => -v);
+				}
+			});
+		this.hooks.evaluateTypeof.for("undefined").tap("JavascriptParser", expr => {
+			return new BasicEvaluatedExpression()
+				.setString("undefined")
+				.setRange(expr.range);
+		});
+		this.hooks.evaluate.for("Identifier").tap("JavascriptParser", expr => {
+			if (/** @type {IdentifierNode} */ (expr).name === "undefined") {
+				return new BasicEvaluatedExpression()
+					.setUndefined()
+					.setRange(expr.range);
+			}
+		});
+		/**
+		 * @param {string} exprType expression type name
+		 * @param {function(ExpressionNode): GetInfoResult | undefined} getInfo get info
+		 * @returns {void}
+		 */
+		const tapEvaluateWithVariableInfo = (exprType, getInfo) => {
+			/** @type {ExpressionNode | undefined} */
+			let cachedExpression = undefined;
+			/** @type {GetInfoResult | undefined} */
+			let cachedInfo = undefined;
+			this.hooks.evaluate.for(exprType).tap("JavascriptParser", expr => {
+				const expression = /** @type {MemberExpressionNode} */ (expr);
+
+				const info = getInfo(expr);
+				if (info !== undefined) {
+					return this.callHooksForInfoWithFallback(
+						this.hooks.evaluateIdentifier,
+						info.name,
+						name => {
+							cachedExpression = expression;
+							cachedInfo = info;
+						},
+						name => {
+							const hook = this.hooks.evaluateDefinedIdentifier.get(name);
+							if (hook !== undefined) {
+								return hook.call(expression);
+							}
+						},
+						expression
+					);
+				}
+			});
+			this.hooks.evaluate
+				.for(exprType)
+				.tap({ name: "JavascriptParser", stage: 100 }, expr => {
+					const info = cachedExpression === expr ? cachedInfo : getInfo(expr);
+					if (info !== undefined) {
+						return new BasicEvaluatedExpression()
+							.setIdentifier(info.name, info.rootInfo, info.getMembers)
+							.setRange(expr.range);
+					}
+				});
+			this.hooks.finish.tap("JavascriptParser", () => {
+				// Cleanup for GC
+				cachedExpression = cachedInfo = undefined;
+			});
+		};
+		tapEvaluateWithVariableInfo("Identifier", expr => {
+			const info = this.getVariableInfo(
+				/** @type {IdentifierNode} */ (expr).name
+			);
+			if (
+				typeof info === "string" ||
+				(info instanceof VariableInfo && typeof info.freeName === "string")
+			) {
+				return { name: info, rootInfo: info, getMembers: () => [] };
+			}
+		});
+		tapEvaluateWithVariableInfo("ThisExpression", expr => {
+			const info = this.getVariableInfo("this");
+			if (
+				typeof info === "string" ||
+				(info instanceof VariableInfo && typeof info.freeName === "string")
+			) {
+				return { name: info, rootInfo: info, getMembers: () => [] };
+			}
+		});
+		this.hooks.evaluate.for("MetaProperty").tap("JavascriptParser", expr => {
+			const metaProperty = /** @type {MetaPropertyNode} */ (expr);
+
+			return this.callHooksForName(
+				this.hooks.evaluateIdentifier,
+				getRootName(expr),
+				metaProperty
+			);
+		});
+		tapEvaluateWithVariableInfo("MemberExpression", expr =>
+			this.getMemberExpressionInfo(
+				/** @type {MemberExpressionNode} */ (expr),
+				ALLOWED_MEMBER_TYPES_EXPRESSION
+			)
+		);
+
+		this.hooks.evaluate.for("CallExpression").tap("JavascriptParser", _expr => {
+			const expr = /** @type {CallExpressionNode} */ (_expr);
+			if (
+				expr.callee.type !== "MemberExpression" ||
+				expr.callee.property.type !==
+					(expr.callee.computed ? "Literal" : "Identifier")
+			) {
+				return;
+			}
+
+			// type Super also possible here
+			const param = this.evaluateExpression(
+				/** @type {ExpressionNode} */ (expr.callee.object)
+			);
+			if (!param) return;
+			const property =
+				expr.callee.property.type === "Literal"
+					? `${expr.callee.property.value}`
+					: expr.callee.property.name;
+			const hook = this.hooks.evaluateCallExpressionMember.get(property);
+			if (hook !== undefined) {
+				return hook.call(expr, param);
+			}
+		});
+		this.hooks.evaluateCallExpressionMember
+			.for("indexOf")
+			.tap("JavascriptParser", (expr, param) => {
+				if (!param.isString()) return;
+				if (expr.arguments.length === 0) return;
+				const [arg1, arg2] = expr.arguments;
+				if (arg1.type === "SpreadElement") return;
+				const arg1Eval = this.evaluateExpression(arg1);
+				if (!arg1Eval.isString()) return;
+				const arg1Value = arg1Eval.string;
+
+				let result;
+				if (arg2) {
+					if (arg2.type === "SpreadElement") return;
+					const arg2Eval = this.evaluateExpression(arg2);
+					if (!arg2Eval.isNumber()) return;
+					result = param.string.indexOf(arg1Value, arg2Eval.number);
+				} else {
+					result = param.string.indexOf(arg1Value);
+				}
+				return new BasicEvaluatedExpression()
+					.setNumber(result)
+					.setSideEffects(param.couldHaveSideEffects())
+					.setRange(expr.range);
+			});
+		this.hooks.evaluateCallExpressionMember
+			.for("replace")
+			.tap("JavascriptParser", (expr, param) => {
+				if (!param.isString()) return;
+				if (expr.arguments.length !== 2) return;
+				if (expr.arguments[0].type === "SpreadElement") return;
+				if (expr.arguments[1].type === "SpreadElement") return;
+				let arg1 = this.evaluateExpression(expr.arguments[0]);
+				let arg2 = this.evaluateExpression(expr.arguments[1]);
+				if (!arg1.isString() && !arg1.isRegExp()) return;
+				const arg1Value = arg1.regExp || arg1.string;
+				if (!arg2.isString()) return;
+				const arg2Value = arg2.string;
+				return new BasicEvaluatedExpression()
+					.setString(param.string.replace(arg1Value, arg2Value))
+					.setSideEffects(param.couldHaveSideEffects())
+					.setRange(expr.range);
+			});
+		["substr", "substring", "slice"].forEach(fn => {
+			this.hooks.evaluateCallExpressionMember
+				.for(fn)
+				.tap("JavascriptParser", (expr, param) => {
+					if (!param.isString()) return;
+					let arg1;
+					let result,
+						str = param.string;
+					switch (expr.arguments.length) {
+						case 1:
+							if (expr.arguments[0].type === "SpreadElement") return;
+							arg1 = this.evaluateExpression(expr.arguments[0]);
+							if (!arg1.isNumber()) return;
+							result = str[fn](arg1.number);
+							break;
+						case 2: {
+							if (expr.arguments[0].type === "SpreadElement") return;
+							if (expr.arguments[1].type === "SpreadElement") return;
+							arg1 = this.evaluateExpression(expr.arguments[0]);
+							const arg2 = this.evaluateExpression(expr.arguments[1]);
+							if (!arg1.isNumber()) return;
+							if (!arg2.isNumber()) return;
+							result = str[fn](arg1.number, arg2.number);
+							break;
+						}
+						default:
+							return;
+					}
+					return new BasicEvaluatedExpression()
+						.setString(result)
+						.setSideEffects(param.couldHaveSideEffects())
+						.setRange(expr.range);
+				});
+		});
+
+		/**
+		 * @param {"cooked" | "raw"} kind kind of values to get
+		 * @param {TemplateLiteralNode} templateLiteralExpr TemplateLiteral expr
+		 * @returns {{quasis: BasicEvaluatedExpression[], parts: BasicEvaluatedExpression[]}} Simplified template
+		 */
+		const getSimplifiedTemplateResult = (kind, templateLiteralExpr) => {
+			/** @type {BasicEvaluatedExpression[]} */
+			const quasis = [];
+			/** @type {BasicEvaluatedExpression[]} */
+			const parts = [];
+
+			for (let i = 0; i < templateLiteralExpr.quasis.length; i++) {
+				const quasiExpr = templateLiteralExpr.quasis[i];
+				const quasi = quasiExpr.value[kind];
+
+				if (i > 0) {
+					const prevExpr = parts[parts.length - 1];
+					const expr = this.evaluateExpression(
+						templateLiteralExpr.expressions[i - 1]
+					);
+					const exprAsString = expr.asString();
+					if (
+						typeof exprAsString === "string" &&
+						!expr.couldHaveSideEffects()
+					) {
+						// We can merge quasi + expr + quasi when expr
+						// is a const string
+
+						prevExpr.setString(prevExpr.string + exprAsString + quasi);
+						prevExpr.setRange([prevExpr.range[0], quasiExpr.range[1]]);
+						// We unset the expression as it doesn't match to a single expression
+						prevExpr.setExpression(undefined);
+						continue;
+					}
+					parts.push(expr);
+				}
+
+				const part = new BasicEvaluatedExpression()
+					.setString(quasi)
+					.setRange(quasiExpr.range)
+					.setExpression(quasiExpr);
+				quasis.push(part);
+				parts.push(part);
+			}
+			return {
+				quasis,
+				parts
+			};
+		};
+
+		this.hooks.evaluate
+			.for("TemplateLiteral")
+			.tap("JavascriptParser", _node => {
+				const node = /** @type {TemplateLiteralNode} */ (_node);
+
+				const { quasis, parts } = getSimplifiedTemplateResult("cooked", node);
+				if (parts.length === 1) {
+					return parts[0].setRange(node.range);
+				}
+				return new BasicEvaluatedExpression()
+					.setTemplateString(quasis, parts, "cooked")
+					.setRange(node.range);
+			});
+		this.hooks.evaluate
+			.for("TaggedTemplateExpression")
+			.tap("JavascriptParser", _node => {
+				const node = /** @type {TaggedTemplateExpressionNode} */ (_node);
+				const tag = this.evaluateExpression(node.tag);
+
+				if (tag.isIdentifier() && tag.identifier === "String.raw") {
+					const { quasis, parts } = getSimplifiedTemplateResult(
+						"raw",
+						node.quasi
+					);
+					return new BasicEvaluatedExpression()
+						.setTemplateString(quasis, parts, "raw")
+						.setRange(node.range);
+				}
+			});
+
+		this.hooks.evaluateCallExpressionMember
+			.for("concat")
+			.tap("JavascriptParser", (expr, param) => {
+				if (!param.isString() && !param.isWrapped()) return;
+
+				let stringSuffix = null;
+				let hasUnknownParams = false;
+				const innerExpressions = [];
+				for (let i = expr.arguments.length - 1; i >= 0; i--) {
+					const arg = expr.arguments[i];
+					if (arg.type === "SpreadElement") return;
+					const argExpr = this.evaluateExpression(arg);
+					if (
+						hasUnknownParams ||
+						(!argExpr.isString() && !argExpr.isNumber())
+					) {
+						hasUnknownParams = true;
+						innerExpressions.push(argExpr);
+						continue;
+					}
+
+					const value = argExpr.isString()
+						? argExpr.string
+						: "" + argExpr.number;
+
+					const newString = value + (stringSuffix ? stringSuffix.string : "");
+					const newRange = [
+						argExpr.range[0],
+						(stringSuffix || argExpr).range[1]
+					];
+					stringSuffix = new BasicEvaluatedExpression()
+						.setString(newString)
+						.setSideEffects(
+							(stringSuffix && stringSuffix.couldHaveSideEffects()) ||
+								argExpr.couldHaveSideEffects()
+						)
+						.setRange(newRange);
+				}
+
+				if (hasUnknownParams) {
+					const prefix = param.isString() ? param : param.prefix;
+					const inner =
+						param.isWrapped() && param.wrappedInnerExpressions
+							? param.wrappedInnerExpressions.concat(innerExpressions.reverse())
+							: innerExpressions.reverse();
+					return new BasicEvaluatedExpression()
+						.setWrapped(prefix, stringSuffix, inner)
+						.setRange(expr.range);
+				} else if (param.isWrapped()) {
+					const postfix = stringSuffix || param.postfix;
+					const inner = param.wrappedInnerExpressions
+						? param.wrappedInnerExpressions.concat(innerExpressions.reverse())
+						: innerExpressions.reverse();
+					return new BasicEvaluatedExpression()
+						.setWrapped(param.prefix, postfix, inner)
+						.setRange(expr.range);
+				} else {
+					const newString =
+						param.string + (stringSuffix ? stringSuffix.string : "");
+					return new BasicEvaluatedExpression()
+						.setString(newString)
+						.setSideEffects(
+							(stringSuffix && stringSuffix.couldHaveSideEffects()) ||
+								param.couldHaveSideEffects()
+						)
+						.setRange(expr.range);
+				}
+			});
+		this.hooks.evaluateCallExpressionMember
+			.for("split")
+			.tap("JavascriptParser", (expr, param) => {
+				if (!param.isString()) return;
+				if (expr.arguments.length !== 1) return;
+				if (expr.arguments[0].type === "SpreadElement") return;
+				let result;
+				const arg = this.evaluateExpression(expr.arguments[0]);
+				if (arg.isString()) {
+					result = param.string.split(arg.string);
+				} else if (arg.isRegExp()) {
+					result = param.string.split(arg.regExp);
+				} else {
+					return;
+				}
+				return new BasicEvaluatedExpression()
+					.setArray(result)
+					.setSideEffects(param.couldHaveSideEffects())
+					.setRange(expr.range);
+			});
+		this.hooks.evaluate
+			.for("ConditionalExpression")
+			.tap("JavascriptParser", _expr => {
+				const expr = /** @type {ConditionalExpressionNode} */ (_expr);
+
+				const condition = this.evaluateExpression(expr.test);
+				const conditionValue = condition.asBool();
+				let res;
+				if (conditionValue === undefined) {
+					const consequent = this.evaluateExpression(expr.consequent);
+					const alternate = this.evaluateExpression(expr.alternate);
+					if (!consequent || !alternate) return;
+					res = new BasicEvaluatedExpression();
+					if (consequent.isConditional()) {
+						res.setOptions(consequent.options);
+					} else {
+						res.setOptions([consequent]);
+					}
+					if (alternate.isConditional()) {
+						res.addOptions(alternate.options);
+					} else {
+						res.addOptions([alternate]);
+					}
+				} else {
+					res = this.evaluateExpression(
+						conditionValue ? expr.consequent : expr.alternate
+					);
+					if (condition.couldHaveSideEffects()) res.setSideEffects();
+				}
+				res.setRange(expr.range);
+				return res;
+			});
+		this.hooks.evaluate
+			.for("ArrayExpression")
+			.tap("JavascriptParser", _expr => {
+				const expr = /** @type {ArrayExpressionNode} */ (_expr);
+
+				const items = expr.elements.map(element => {
+					return (
+						element !== null &&
+						element.type !== "SpreadElement" &&
+						this.evaluateExpression(element)
+					);
+				});
+				if (!items.every(Boolean)) return;
+				return new BasicEvaluatedExpression()
+					.setItems(items)
+					.setRange(expr.range);
+			});
+		this.hooks.evaluate
+			.for("ChainExpression")
+			.tap("JavascriptParser", _expr => {
+				const expr = /** @type {ChainExpressionNode} */ (_expr);
+				/** @type {ExpressionNode[]} */
+				const optionalExpressionsStack = [];
+				/** @type {ExpressionNode|SuperNode} */
+				let next = expr.expression;
+
+				while (
+					next.type === "MemberExpression" ||
+					next.type === "CallExpression"
+				) {
+					if (next.type === "MemberExpression") {
+						if (next.optional) {
+							// SuperNode can not be optional
+							optionalExpressionsStack.push(
+								/** @type {ExpressionNode} */ (next.object)
+							);
+						}
+						next = next.object;
+					} else {
+						if (next.optional) {
+							// SuperNode can not be optional
+							optionalExpressionsStack.push(
+								/** @type {ExpressionNode} */ (next.callee)
+							);
+						}
+						next = next.callee;
+					}
+				}
+
+				while (optionalExpressionsStack.length > 0) {
+					const expression = optionalExpressionsStack.pop();
+					const evaluated = this.evaluateExpression(expression);
+
+					if (evaluated && evaluated.asNullish()) {
+						return evaluated.setRange(_expr.range);
+					}
+				}
+				return this.evaluateExpression(expr.expression);
+			});
+	}
+
+	getRenameIdentifier(expr) {
+		const result = this.evaluateExpression(expr);
+		if (result && result.isIdentifier()) {
+			return result.identifier;
+		}
+	}
+
+	/**
+	 * @param {ClassExpressionNode | ClassDeclarationNode} classy a class node
+	 * @returns {void}
+	 */
+	walkClass(classy) {
+		if (classy.superClass) {
+			if (!this.hooks.classExtendsExpression.call(classy.superClass, classy)) {
+				this.walkExpression(classy.superClass);
+			}
+		}
+		if (classy.body && classy.body.type === "ClassBody") {
+			for (const classElement of /** @type {TODO} */ (classy.body.body)) {
+				if (!this.hooks.classBodyElement.call(classElement, classy)) {
+					if (classElement.computed && classElement.key) {
+						this.walkExpression(classElement.key);
+					}
+					if (classElement.value) {
+						if (
+							!this.hooks.classBodyValue.call(
+								classElement.value,
+								classElement,
+								classy
+							)
+						) {
+							const wasTopLevel = this.scope.topLevelScope;
+							this.scope.topLevelScope = false;
+							this.walkExpression(classElement.value);
+							this.scope.topLevelScope = wasTopLevel;
+						}
+					}
+				}
+			}
+		}
+	}
+
+	// Pre walking iterates the scope for variable declarations
+	preWalkStatements(statements) {
+		for (let index = 0, len = statements.length; index < len; index++) {
+			const statement = statements[index];
+			this.preWalkStatement(statement);
+		}
+	}
+
+	// Block pre walking iterates the scope for block variable declarations
+	blockPreWalkStatements(statements) {
+		for (let index = 0, len = statements.length; index < len; index++) {
+			const statement = statements[index];
+			this.blockPreWalkStatement(statement);
+		}
+	}
+
+	// Walking iterates the statements and expressions and processes them
+	walkStatements(statements) {
+		for (let index = 0, len = statements.length; index < len; index++) {
+			const statement = statements[index];
+			this.walkStatement(statement);
+		}
+	}
+
+	preWalkStatement(statement) {
+		this.statementPath.push(statement);
+		if (this.hooks.preStatement.call(statement)) {
+			this.prevStatement = this.statementPath.pop();
+			return;
+		}
+		switch (statement.type) {
+			case "BlockStatement":
+				this.preWalkBlockStatement(statement);
+				break;
+			case "DoWhileStatement":
+				this.preWalkDoWhileStatement(statement);
+				break;
+			case "ForInStatement":
+				this.preWalkForInStatement(statement);
+				break;
+			case "ForOfStatement":
+				this.preWalkForOfStatement(statement);
+				break;
+			case "ForStatement":
+				this.preWalkForStatement(statement);
+				break;
+			case "FunctionDeclaration":
+				this.preWalkFunctionDeclaration(statement);
+				break;
+			case "IfStatement":
+				this.preWalkIfStatement(statement);
+				break;
+			case "LabeledStatement":
+				this.preWalkLabeledStatement(statement);
+				break;
+			case "SwitchStatement":
+				this.preWalkSwitchStatement(statement);
+				break;
+			case "TryStatement":
+				this.preWalkTryStatement(statement);
+				break;
+			case "VariableDeclaration":
+				this.preWalkVariableDeclaration(statement);
+				break;
+			case "WhileStatement":
+				this.preWalkWhileStatement(statement);
+				break;
+			case "WithStatement":
+				this.preWalkWithStatement(statement);
+				break;
+		}
+		this.prevStatement = this.statementPath.pop();
+	}
+
+	blockPreWalkStatement(statement) {
+		this.statementPath.push(statement);
+		if (this.hooks.blockPreStatement.call(statement)) {
+			this.prevStatement = this.statementPath.pop();
+			return;
+		}
+		switch (statement.type) {
+			case "ImportDeclaration":
+				this.blockPreWalkImportDeclaration(statement);
+				break;
+			case "ExportAllDeclaration":
+				this.blockPreWalkExportAllDeclaration(statement);
+				break;
+			case "ExportDefaultDeclaration":
+				this.blockPreWalkExportDefaultDeclaration(statement);
+				break;
+			case "ExportNamedDeclaration":
+				this.blockPreWalkExportNamedDeclaration(statement);
+				break;
+			case "VariableDeclaration":
+				this.blockPreWalkVariableDeclaration(statement);
+				break;
+			case "ClassDeclaration":
+				this.blockPreWalkClassDeclaration(statement);
+				break;
+		}
+		this.prevStatement = this.statementPath.pop();
+	}
+
+	walkStatement(statement) {
+		this.statementPath.push(statement);
+		if (this.hooks.statement.call(statement) !== undefined) {
+			this.prevStatement = this.statementPath.pop();
+			return;
+		}
+		switch (statement.type) {
+			case "BlockStatement":
+				this.walkBlockStatement(statement);
+				break;
+			case "ClassDeclaration":
+				this.walkClassDeclaration(statement);
+				break;
+			case "DoWhileStatement":
+				this.walkDoWhileStatement(statement);
+				break;
+			case "ExportDefaultDeclaration":
+				this.walkExportDefaultDeclaration(statement);
+				break;
+			case "ExportNamedDeclaration":
+				this.walkExportNamedDeclaration(statement);
+				break;
+			case "ExpressionStatement":
+				this.walkExpressionStatement(statement);
+				break;
+			case "ForInStatement":
+				this.walkForInStatement(statement);
+				break;
+			case "ForOfStatement":
+				this.walkForOfStatement(statement);
+				break;
+			case "ForStatement":
+				this.walkForStatement(statement);
+				break;
+			case "FunctionDeclaration":
+				this.walkFunctionDeclaration(statement);
+				break;
+			case "IfStatement":
+				this.walkIfStatement(statement);
+				break;
+			case "LabeledStatement":
+				this.walkLabeledStatement(statement);
+				break;
+			case "ReturnStatement":
+				this.walkReturnStatement(statement);
+				break;
+			case "SwitchStatement":
+				this.walkSwitchStatement(statement);
+				break;
+			case "ThrowStatement":
+				this.walkThrowStatement(statement);
+				break;
+			case "TryStatement":
+				this.walkTryStatement(statement);
+				break;
+			case "VariableDeclaration":
+				this.walkVariableDeclaration(statement);
+				break;
+			case "WhileStatement":
+				this.walkWhileStatement(statement);
+				break;
+			case "WithStatement":
+				this.walkWithStatement(statement);
+				break;
+		}
+		this.prevStatement = this.statementPath.pop();
+	}
+
+	/**
+	 * Walks a statements that is nested within a parent statement
+	 * and can potentially be a non-block statement.
+	 * This enforces the nested statement to never be in ASI position.
+	 * @param {StatementNode} statement the nested statement
+	 * @returns {void}
+	 */
+	walkNestedStatement(statement) {
+		this.prevStatement = undefined;
+		this.walkStatement(statement);
+	}
+
+	// Real Statements
+	preWalkBlockStatement(statement) {
+		this.preWalkStatements(statement.body);
+	}
+
+	walkBlockStatement(statement) {
+		this.inBlockScope(() => {
+			const body = statement.body;
+			const prev = this.prevStatement;
+			this.blockPreWalkStatements(body);
+			this.prevStatement = prev;
+			this.walkStatements(body);
+		});
+	}
+
+	walkExpressionStatement(statement) {
+		this.walkExpression(statement.expression);
+	}
+
+	preWalkIfStatement(statement) {
+		this.preWalkStatement(statement.consequent);
+		if (statement.alternate) {
+			this.preWalkStatement(statement.alternate);
+		}
+	}
+
+	walkIfStatement(statement) {
+		const result = this.hooks.statementIf.call(statement);
+		if (result === undefined) {
+			this.walkExpression(statement.test);
+			this.walkNestedStatement(statement.consequent);
+			if (statement.alternate) {
+				this.walkNestedStatement(statement.alternate);
+			}
+		} else {
+			if (result) {
+				this.walkNestedStatement(statement.consequent);
+			} else if (statement.alternate) {
+				this.walkNestedStatement(statement.alternate);
+			}
+		}
+	}
+
+	preWalkLabeledStatement(statement) {
+		this.preWalkStatement(statement.body);
+	}
+
+	walkLabeledStatement(statement) {
+		const hook = this.hooks.label.get(statement.label.name);
+		if (hook !== undefined) {
+			const result = hook.call(statement);
+			if (result === true) return;
+		}
+		this.walkNestedStatement(statement.body);
+	}
+
+	preWalkWithStatement(statement) {
+		this.preWalkStatement(statement.body);
+	}
+
+	walkWithStatement(statement) {
+		this.walkExpression(statement.object);
+		this.walkNestedStatement(statement.body);
+	}
+
+	preWalkSwitchStatement(statement) {
+		this.preWalkSwitchCases(statement.cases);
+	}
+
+	walkSwitchStatement(statement) {
+		this.walkExpression(statement.discriminant);
+		this.walkSwitchCases(statement.cases);
+	}
+
+	walkTerminatingStatement(statement) {
+		if (statement.argument) this.walkExpression(statement.argument);
+	}
+
+	walkReturnStatement(statement) {
+		this.walkTerminatingStatement(statement);
+	}
+
+	walkThrowStatement(statement) {
+		this.walkTerminatingStatement(statement);
+	}
+
+	preWalkTryStatement(statement) {
+		this.preWalkStatement(statement.block);
+		if (statement.handler) this.preWalkCatchClause(statement.handler);
+		if (statement.finializer) this.preWalkStatement(statement.finializer);
+	}
+
+	walkTryStatement(statement) {
+		if (this.scope.inTry) {
+			this.walkStatement(statement.block);
+		} else {
+			this.scope.inTry = true;
+			this.walkStatement(statement.block);
+			this.scope.inTry = false;
+		}
+		if (statement.handler) this.walkCatchClause(statement.handler);
+		if (statement.finalizer) this.walkStatement(statement.finalizer);
+	}
+
+	preWalkWhileStatement(statement) {
+		this.preWalkStatement(statement.body);
+	}
+
+	walkWhileStatement(statement) {
+		this.walkExpression(statement.test);
+		this.walkNestedStatement(statement.body);
+	}
+
+	preWalkDoWhileStatement(statement) {
+		this.preWalkStatement(statement.body);
+	}
+
+	walkDoWhileStatement(statement) {
+		this.walkNestedStatement(statement.body);
+		this.walkExpression(statement.test);
+	}
+
+	preWalkForStatement(statement) {
+		if (statement.init) {
+			if (statement.init.type === "VariableDeclaration") {
+				this.preWalkStatement(statement.init);
+			}
+		}
+		this.preWalkStatement(statement.body);
+	}
+
+	walkForStatement(statement) {
+		this.inBlockScope(() => {
+			if (statement.init) {
+				if (statement.init.type === "VariableDeclaration") {
+					this.blockPreWalkVariableDeclaration(statement.init);
+					this.prevStatement = undefined;
+					this.walkStatement(statement.init);
+				} else {
+					this.walkExpression(statement.init);
+				}
+			}
+			if (statement.test) {
+				this.walkExpression(statement.test);
+			}
+			if (statement.update) {
+				this.walkExpression(statement.update);
+			}
+			const body = statement.body;
+			if (body.type === "BlockStatement") {
+				// no need to add additional scope
+				const prev = this.prevStatement;
+				this.blockPreWalkStatements(body.body);
+				this.prevStatement = prev;
+				this.walkStatements(body.body);
+			} else {
+				this.walkNestedStatement(body);
+			}
+		});
+	}
+
+	preWalkForInStatement(statement) {
+		if (statement.left.type === "VariableDeclaration") {
+			this.preWalkVariableDeclaration(statement.left);
+		}
+		this.preWalkStatement(statement.body);
+	}
+
+	walkForInStatement(statement) {
+		this.inBlockScope(() => {
+			if (statement.left.type === "VariableDeclaration") {
+				this.blockPreWalkVariableDeclaration(statement.left);
+				this.walkVariableDeclaration(statement.left);
+			} else {
+				this.walkPattern(statement.left);
+			}
+			this.walkExpression(statement.right);
+			const body = statement.body;
+			if (body.type === "BlockStatement") {
+				// no need to add additional scope
+				const prev = this.prevStatement;
+				this.blockPreWalkStatements(body.body);
+				this.prevStatement = prev;
+				this.walkStatements(body.body);
+			} else {
+				this.walkNestedStatement(body);
+			}
+		});
+	}
+
+	preWalkForOfStatement(statement) {
+		if (statement.await && this.scope.topLevelScope === true) {
+			this.hooks.topLevelAwait.call(statement);
+		}
+		if (statement.left.type === "VariableDeclaration") {
+			this.preWalkVariableDeclaration(statement.left);
+		}
+		this.preWalkStatement(statement.body);
+	}
+
+	walkForOfStatement(statement) {
+		this.inBlockScope(() => {
+			if (statement.left.type === "VariableDeclaration") {
+				this.blockPreWalkVariableDeclaration(statement.left);
+				this.walkVariableDeclaration(statement.left);
+			} else {
+				this.walkPattern(statement.left);
+			}
+			this.walkExpression(statement.right);
+			const body = statement.body;
+			if (body.type === "BlockStatement") {
+				// no need to add additional scope
+				const prev = this.prevStatement;
+				this.blockPreWalkStatements(body.body);
+				this.prevStatement = prev;
+				this.walkStatements(body.body);
+			} else {
+				this.walkNestedStatement(body);
+			}
+		});
+	}
+
+	// Declarations
+	preWalkFunctionDeclaration(statement) {
+		if (statement.id) {
+			this.defineVariable(statement.id.name);
+		}
+	}
+
+	walkFunctionDeclaration(statement) {
+		const wasTopLevel = this.scope.topLevelScope;
+		this.scope.topLevelScope = false;
+		this.inFunctionScope(true, statement.params, () => {
+			for (const param of statement.params) {
+				this.walkPattern(param);
+			}
+			if (statement.body.type === "BlockStatement") {
+				this.detectMode(statement.body.body);
+				const prev = this.prevStatement;
+				this.preWalkStatement(statement.body);
+				this.prevStatement = prev;
+				this.walkStatement(statement.body);
+			} else {
+				this.walkExpression(statement.body);
+			}
+		});
+		this.scope.topLevelScope = wasTopLevel;
+	}
+
+	blockPreWalkImportDeclaration(statement) {
+		const source = statement.source.value;
+		this.hooks.import.call(statement, source);
+		for (const specifier of statement.specifiers) {
+			const name = specifier.local.name;
+			switch (specifier.type) {
+				case "ImportDefaultSpecifier":
+					if (
+						!this.hooks.importSpecifier.call(statement, source, "default", name)
+					) {
+						this.defineVariable(name);
+					}
+					break;
+				case "ImportSpecifier":
+					if (
+						!this.hooks.importSpecifier.call(
+							statement,
+							source,
+							specifier.imported.name,
+							name
+						)
+					) {
+						this.defineVariable(name);
+					}
+					break;
+				case "ImportNamespaceSpecifier":
+					if (!this.hooks.importSpecifier.call(statement, source, null, name)) {
+						this.defineVariable(name);
+					}
+					break;
+				default:
+					this.defineVariable(name);
+			}
+		}
+	}
+
+	enterDeclaration(declaration, onIdent) {
+		switch (declaration.type) {
+			case "VariableDeclaration":
+				for (const declarator of declaration.declarations) {
+					switch (declarator.type) {
+						case "VariableDeclarator": {
+							this.enterPattern(declarator.id, onIdent);
+							break;
+						}
+					}
+				}
+				break;
+			case "FunctionDeclaration":
+				this.enterPattern(declaration.id, onIdent);
+				break;
+			case "ClassDeclaration":
+				this.enterPattern(declaration.id, onIdent);
+				break;
+		}
+	}
+
+	blockPreWalkExportNamedDeclaration(statement) {
+		let source;
+		if (statement.source) {
+			source = statement.source.value;
+			this.hooks.exportImport.call(statement, source);
+		} else {
+			this.hooks.export.call(statement);
+		}
+		if (statement.declaration) {
+			if (
+				!this.hooks.exportDeclaration.call(statement, statement.declaration)
+			) {
+				const prev = this.prevStatement;
+				this.preWalkStatement(statement.declaration);
+				this.prevStatement = prev;
+				this.blockPreWalkStatement(statement.declaration);
+				let index = 0;
+				this.enterDeclaration(statement.declaration, def => {
+					this.hooks.exportSpecifier.call(statement, def, def, index++);
+				});
+			}
+		}
+		if (statement.specifiers) {
+			for (
+				let specifierIndex = 0;
+				specifierIndex < statement.specifiers.length;
+				specifierIndex++
+			) {
+				const specifier = statement.specifiers[specifierIndex];
+				switch (specifier.type) {
+					case "ExportSpecifier": {
+						const name = specifier.exported.name;
+						if (source) {
+							this.hooks.exportImportSpecifier.call(
+								statement,
+								source,
+								specifier.local.name,
+								name,
+								specifierIndex
+							);
+						} else {
+							this.hooks.exportSpecifier.call(
+								statement,
+								specifier.local.name,
+								name,
+								specifierIndex
+							);
+						}
+						break;
+					}
+				}
+			}
+		}
+	}
+
+	walkExportNamedDeclaration(statement) {
+		if (statement.declaration) {
+			this.walkStatement(statement.declaration);
+		}
+	}
+
+	blockPreWalkExportDefaultDeclaration(statement) {
+		const prev = this.prevStatement;
+		this.preWalkStatement(statement.declaration);
+		this.prevStatement = prev;
+		this.blockPreWalkStatement(statement.declaration);
+		if (
+			statement.declaration.id &&
+			statement.declaration.type !== "FunctionExpression" &&
+			statement.declaration.type !== "ClassExpression"
+		) {
+			this.hooks.exportSpecifier.call(
+				statement,
+				statement.declaration.id.name,
+				"default",
+				undefined
+			);
+		}
+	}
+
+	walkExportDefaultDeclaration(statement) {
+		this.hooks.export.call(statement);
+		if (
+			statement.declaration.id &&
+			statement.declaration.type !== "FunctionExpression" &&
+			statement.declaration.type !== "ClassExpression"
+		) {
+			if (
+				!this.hooks.exportDeclaration.call(statement, statement.declaration)
+			) {
+				this.walkStatement(statement.declaration);
+			}
+		} else {
+			// Acorn parses `export default function() {}` as `FunctionDeclaration` and
+			// `export default class {}` as `ClassDeclaration`, both with `id = null`.
+			// These nodes must be treated as expressions.
+			if (
+				statement.declaration.type === "FunctionDeclaration" ||
+				statement.declaration.type === "ClassDeclaration"
+			) {
+				this.walkStatement(statement.declaration);
+			} else {
+				this.walkExpression(statement.declaration);
+			}
+			if (!this.hooks.exportExpression.call(statement, statement.declaration)) {
+				this.hooks.exportSpecifier.call(
+					statement,
+					statement.declaration,
+					"default",
+					undefined
+				);
+			}
+		}
+	}
+
+	blockPreWalkExportAllDeclaration(statement) {
+		const source = statement.source.value;
+		const name = statement.exported ? statement.exported.name : null;
+		this.hooks.exportImport.call(statement, source);
+		this.hooks.exportImportSpecifier.call(statement, source, null, name, 0);
+	}
+
+	preWalkVariableDeclaration(statement) {
+		if (statement.kind !== "var") return;
+		this._preWalkVariableDeclaration(statement, this.hooks.varDeclarationVar);
+	}
+
+	blockPreWalkVariableDeclaration(statement) {
+		if (statement.kind === "var") return;
+		const hookMap =
+			statement.kind === "const"
+				? this.hooks.varDeclarationConst
+				: this.hooks.varDeclarationLet;
+		this._preWalkVariableDeclaration(statement, hookMap);
+	}
+
+	_preWalkVariableDeclaration(statement, hookMap) {
+		for (const declarator of statement.declarations) {
+			switch (declarator.type) {
+				case "VariableDeclarator": {
+					if (!this.hooks.preDeclarator.call(declarator, statement)) {
+						this.enterPattern(declarator.id, (name, decl) => {
+							let hook = hookMap.get(name);
+							if (hook === undefined || !hook.call(decl)) {
+								hook = this.hooks.varDeclaration.get(name);
+								if (hook === undefined || !hook.call(decl)) {
+									this.defineVariable(name);
+								}
+							}
+						});
+					}
+					break;
+				}
+			}
+		}
+	}
+
+	walkVariableDeclaration(statement) {
+		for (const declarator of statement.declarations) {
+			switch (declarator.type) {
+				case "VariableDeclarator": {
+					const renameIdentifier =
+						declarator.init && this.getRenameIdentifier(declarator.init);
+					if (renameIdentifier && declarator.id.type === "Identifier") {
+						const hook = this.hooks.canRename.get(renameIdentifier);
+						if (hook !== undefined && hook.call(declarator.init)) {
+							// renaming with "var a = b;"
+							const hook = this.hooks.rename.get(renameIdentifier);
+							if (hook === undefined || !hook.call(declarator.init)) {
+								this.setVariable(declarator.id.name, renameIdentifier);
+							}
+							break;
+						}
+					}
+					if (!this.hooks.declarator.call(declarator, statement)) {
+						this.walkPattern(declarator.id);
+						if (declarator.init) this.walkExpression(declarator.init);
+					}
+					break;
+				}
+			}
+		}
+	}
+
+	blockPreWalkClassDeclaration(statement) {
+		if (statement.id) {
+			this.defineVariable(statement.id.name);
+		}
+	}
+
+	walkClassDeclaration(statement) {
+		this.walkClass(statement);
+	}
+
+	preWalkSwitchCases(switchCases) {
+		for (let index = 0, len = switchCases.length; index < len; index++) {
+			const switchCase = switchCases[index];
+			this.preWalkStatements(switchCase.consequent);
+		}
+	}
+
+	walkSwitchCases(switchCases) {
+		this.inBlockScope(() => {
+			const len = switchCases.length;
+
+			// we need to pre walk all statements first since we can have invalid code
+			// import A from "module";
+			// switch(1) {
+			//    case 1:
+			//      console.log(A); // should fail at runtime
+			//    case 2:
+			//      const A = 1;
+			// }
+			for (let index = 0; index < len; index++) {
+				const switchCase = switchCases[index];
+
+				if (switchCase.consequent.length > 0) {
+					const prev = this.prevStatement;
+					this.blockPreWalkStatements(switchCase.consequent);
+					this.prevStatement = prev;
+				}
+			}
+
+			for (let index = 0; index < len; index++) {
+				const switchCase = switchCases[index];
+
+				if (switchCase.test) {
+					this.walkExpression(switchCase.test);
+				}
+				if (switchCase.consequent.length > 0) {
+					this.walkStatements(switchCase.consequent);
+				}
+			}
+		});
+	}
+
+	preWalkCatchClause(catchClause) {
+		this.preWalkStatement(catchClause.body);
+	}
+
+	walkCatchClause(catchClause) {
+		this.inBlockScope(() => {
+			// Error binding is optional in catch clause since ECMAScript 2019
+			if (catchClause.param !== null) {
+				this.enterPattern(catchClause.param, ident => {
+					this.defineVariable(ident);
+				});
+				this.walkPattern(catchClause.param);
+			}
+			const prev = this.prevStatement;
+			this.blockPreWalkStatement(catchClause.body);
+			this.prevStatement = prev;
+			this.walkStatement(catchClause.body);
+		});
+	}
+
+	walkPattern(pattern) {
+		switch (pattern.type) {
+			case "ArrayPattern":
+				this.walkArrayPattern(pattern);
+				break;
+			case "AssignmentPattern":
+				this.walkAssignmentPattern(pattern);
+				break;
+			case "MemberExpression":
+				this.walkMemberExpression(pattern);
+				break;
+			case "ObjectPattern":
+				this.walkObjectPattern(pattern);
+				break;
+			case "RestElement":
+				this.walkRestElement(pattern);
+				break;
+		}
+	}
+
+	walkAssignmentPattern(pattern) {
+		this.walkExpression(pattern.right);
+		this.walkPattern(pattern.left);
+	}
+
+	walkObjectPattern(pattern) {
+		for (let i = 0, len = pattern.properties.length; i < len; i++) {
+			const prop = pattern.properties[i];
+			if (prop) {
+				if (prop.computed) this.walkExpression(prop.key);
+				if (prop.value) this.walkPattern(prop.value);
+			}
+		}
+	}
+
+	walkArrayPattern(pattern) {
+		for (let i = 0, len = pattern.elements.length; i < len; i++) {
+			const element = pattern.elements[i];
+			if (element) this.walkPattern(element);
+		}
+	}
+
+	walkRestElement(pattern) {
+		this.walkPattern(pattern.argument);
+	}
+
+	walkExpressions(expressions) {
+		for (const expression of expressions) {
+			if (expression) {
+				this.walkExpression(expression);
+			}
+		}
+	}
+
+	walkExpression(expression) {
+		switch (expression.type) {
+			case "ArrayExpression":
+				this.walkArrayExpression(expression);
+				break;
+			case "ArrowFunctionExpression":
+				this.walkArrowFunctionExpression(expression);
+				break;
+			case "AssignmentExpression":
+				this.walkAssignmentExpression(expression);
+				break;
+			case "AwaitExpression":
+				this.walkAwaitExpression(expression);
+				break;
+			case "BinaryExpression":
+				this.walkBinaryExpression(expression);
+				break;
+			case "CallExpression":
+				this.walkCallExpression(expression);
+				break;
+			case "ChainExpression":
+				this.walkChainExpression(expression);
+				break;
+			case "ClassExpression":
+				this.walkClassExpression(expression);
+				break;
+			case "ConditionalExpression":
+				this.walkConditionalExpression(expression);
+				break;
+			case "FunctionExpression":
+				this.walkFunctionExpression(expression);
+				break;
+			case "Identifier":
+				this.walkIdentifier(expression);
+				break;
+			case "ImportExpression":
+				this.walkImportExpression(expression);
+				break;
+			case "LogicalExpression":
+				this.walkLogicalExpression(expression);
+				break;
+			case "MetaProperty":
+				this.walkMetaProperty(expression);
+				break;
+			case "MemberExpression":
+				this.walkMemberExpression(expression);
+				break;
+			case "NewExpression":
+				this.walkNewExpression(expression);
+				break;
+			case "ObjectExpression":
+				this.walkObjectExpression(expression);
+				break;
+			case "SequenceExpression":
+				this.walkSequenceExpression(expression);
+				break;
+			case "SpreadElement":
+				this.walkSpreadElement(expression);
+				break;
+			case "TaggedTemplateExpression":
+				this.walkTaggedTemplateExpression(expression);
+				break;
+			case "TemplateLiteral":
+				this.walkTemplateLiteral(expression);
+				break;
+			case "ThisExpression":
+				this.walkThisExpression(expression);
+				break;
+			case "UnaryExpression":
+				this.walkUnaryExpression(expression);
+				break;
+			case "UpdateExpression":
+				this.walkUpdateExpression(expression);
+				break;
+			case "YieldExpression":
+				this.walkYieldExpression(expression);
+				break;
+		}
+	}
+
+	walkAwaitExpression(expression) {
+		if (this.scope.topLevelScope === true)
+			this.hooks.topLevelAwait.call(expression);
+		this.walkExpression(expression.argument);
+	}
+
+	walkArrayExpression(expression) {
+		if (expression.elements) {
+			this.walkExpressions(expression.elements);
+		}
+	}
+
+	walkSpreadElement(expression) {
+		if (expression.argument) {
+			this.walkExpression(expression.argument);
+		}
+	}
+
+	walkObjectExpression(expression) {
+		for (
+			let propIndex = 0, len = expression.properties.length;
+			propIndex < len;
+			propIndex++
+		) {
+			const prop = expression.properties[propIndex];
+			this.walkProperty(prop);
+		}
+	}
+
+	walkProperty(prop) {
+		if (prop.type === "SpreadElement") {
+			this.walkExpression(prop.argument);
+			return;
+		}
+		if (prop.computed) {
+			this.walkExpression(prop.key);
+		}
+		if (prop.shorthand && prop.value && prop.value.type === "Identifier") {
+			this.scope.inShorthand = prop.value.name;
+			this.walkIdentifier(prop.value);
+			this.scope.inShorthand = false;
+		} else {
+			this.walkExpression(prop.value);
+		}
+	}
+
+	walkFunctionExpression(expression) {
+		const wasTopLevel = this.scope.topLevelScope;
+		this.scope.topLevelScope = false;
+		const scopeParams = expression.params;
+
+		// Add function name in scope for recursive calls
+		if (expression.id) {
+			scopeParams.push(expression.id.name);
+		}
+
+		this.inFunctionScope(true, scopeParams, () => {
+			for (const param of expression.params) {
+				this.walkPattern(param);
+			}
+			if (expression.body.type === "BlockStatement") {
+				this.detectMode(expression.body.body);
+				const prev = this.prevStatement;
+				this.preWalkStatement(expression.body);
+				this.prevStatement = prev;
+				this.walkStatement(expression.body);
+			} else {
+				this.walkExpression(expression.body);
+			}
+		});
+		this.scope.topLevelScope = wasTopLevel;
+	}
+
+	walkArrowFunctionExpression(expression) {
+		const wasTopLevel = this.scope.topLevelScope;
+		this.scope.topLevelScope = wasTopLevel ? "arrow" : false;
+		this.inFunctionScope(false, expression.params, () => {
+			for (const param of expression.params) {
+				this.walkPattern(param);
+			}
+			if (expression.body.type === "BlockStatement") {
+				this.detectMode(expression.body.body);
+				const prev = this.prevStatement;
+				this.preWalkStatement(expression.body);
+				this.prevStatement = prev;
+				this.walkStatement(expression.body);
+			} else {
+				this.walkExpression(expression.body);
+			}
+		});
+		this.scope.topLevelScope = wasTopLevel;
+	}
+
+	/**
+	 * @param {SequenceExpressionNode} expression the sequence
+	 */
+	walkSequenceExpression(expression) {
+		if (!expression.expressions) return;
+		// We treat sequence expressions like statements when they are one statement level
+		// This has some benefits for optimizations that only work on statement level
+		const currentStatement = this.statementPath[this.statementPath.length - 1];
+		if (
+			currentStatement === expression ||
+			(currentStatement.type === "ExpressionStatement" &&
+				currentStatement.expression === expression)
+		) {
+			const old = this.statementPath.pop();
+			for (const expr of expression.expressions) {
+				this.statementPath.push(expr);
+				this.walkExpression(expr);
+				this.statementPath.pop();
+			}
+			this.statementPath.push(old);
+		} else {
+			this.walkExpressions(expression.expressions);
+		}
+	}
+
+	walkUpdateExpression(expression) {
+		this.walkExpression(expression.argument);
+	}
+
+	walkUnaryExpression(expression) {
+		if (expression.operator === "typeof") {
+			const result = this.callHooksForExpression(
+				this.hooks.typeof,
+				expression.argument,
+				expression
+			);
+			if (result === true) return;
+			if (expression.argument.type === "ChainExpression") {
+				const result = this.callHooksForExpression(
+					this.hooks.typeof,
+					expression.argument.expression,
+					expression
+				);
+				if (result === true) return;
+			}
+		}
+		this.walkExpression(expression.argument);
+	}
+
+	walkLeftRightExpression(expression) {
+		this.walkExpression(expression.left);
+		this.walkExpression(expression.right);
+	}
+
+	walkBinaryExpression(expression) {
+		this.walkLeftRightExpression(expression);
+	}
+
+	walkLogicalExpression(expression) {
+		const result = this.hooks.expressionLogicalOperator.call(expression);
+		if (result === undefined) {
+			this.walkLeftRightExpression(expression);
+		} else {
+			if (result) {
+				this.walkExpression(expression.right);
+			}
+		}
+	}
+
+	walkAssignmentExpression(expression) {
+		if (expression.left.type === "Identifier") {
+			const renameIdentifier = this.getRenameIdentifier(expression.right);
+			if (renameIdentifier) {
+				if (
+					this.callHooksForInfo(
+						this.hooks.canRename,
+						renameIdentifier,
+						expression.right
+					)
+				) {
+					// renaming "a = b;"
+					if (
+						!this.callHooksForInfo(
+							this.hooks.rename,
+							renameIdentifier,
+							expression.right
+						)
+					) {
+						this.setVariable(
+							expression.left.name,
+							this.getVariableInfo(renameIdentifier)
+						);
+					}
+					return;
+				}
+			}
+			this.walkExpression(expression.right);
+			this.enterPattern(expression.left, (name, decl) => {
+				if (!this.callHooksForName(this.hooks.assign, name, expression)) {
+					this.walkExpression(expression.left);
+				}
+			});
+			return;
+		}
+		if (expression.left.type.endsWith("Pattern")) {
+			this.walkExpression(expression.right);
+			this.enterPattern(expression.left, (name, decl) => {
+				if (!this.callHooksForName(this.hooks.assign, name, expression)) {
+					this.defineVariable(name);
+				}
+			});
+			this.walkPattern(expression.left);
+		} else if (expression.left.type === "MemberExpression") {
+			const exprName = this.getMemberExpressionInfo(
+				expression.left,
+				ALLOWED_MEMBER_TYPES_EXPRESSION
+			);
+			if (exprName) {
+				if (
+					this.callHooksForInfo(
+						this.hooks.assignMemberChain,
+						exprName.rootInfo,
+						expression,
+						exprName.getMembers()
+					)
+				) {
+					return;
+				}
+			}
+			this.walkExpression(expression.right);
+			this.walkExpression(expression.left);
+		} else {
+			this.walkExpression(expression.right);
+			this.walkExpression(expression.left);
+		}
+	}
+
+	walkConditionalExpression(expression) {
+		const result = this.hooks.expressionConditionalOperator.call(expression);
+		if (result === undefined) {
+			this.walkExpression(expression.test);
+			this.walkExpression(expression.consequent);
+			if (expression.alternate) {
+				this.walkExpression(expression.alternate);
+			}
+		} else {
+			if (result) {
+				this.walkExpression(expression.consequent);
+			} else if (expression.alternate) {
+				this.walkExpression(expression.alternate);
+			}
+		}
+	}
+
+	walkNewExpression(expression) {
+		const result = this.callHooksForExpression(
+			this.hooks.new,
+			expression.callee,
+			expression
+		);
+		if (result === true) return;
+		this.walkExpression(expression.callee);
+		if (expression.arguments) {
+			this.walkExpressions(expression.arguments);
+		}
+	}
+
+	walkYieldExpression(expression) {
+		if (expression.argument) {
+			this.walkExpression(expression.argument);
+		}
+	}
+
+	walkTemplateLiteral(expression) {
+		if (expression.expressions) {
+			this.walkExpressions(expression.expressions);
+		}
+	}
+
+	walkTaggedTemplateExpression(expression) {
+		if (expression.tag) {
+			this.walkExpression(expression.tag);
+		}
+		if (expression.quasi && expression.quasi.expressions) {
+			this.walkExpressions(expression.quasi.expressions);
+		}
+	}
+
+	walkClassExpression(expression) {
+		this.walkClass(expression);
+	}
+
+	/**
+	 * @param {ChainExpressionNode} expression expression
+	 */
+	walkChainExpression(expression) {
+		const result = this.hooks.optionalChaining.call(expression);
+
+		if (result === undefined) {
+			if (expression.expression.type === "CallExpression") {
+				this.walkCallExpression(expression.expression);
+			} else {
+				this.walkMemberExpression(expression.expression);
+			}
+		}
+	}
+
+	_walkIIFE(functionExpression, options, currentThis) {
+		const getVarInfo = argOrThis => {
+			const renameIdentifier = this.getRenameIdentifier(argOrThis);
+			if (renameIdentifier) {
+				if (
+					this.callHooksForInfo(
+						this.hooks.canRename,
+						renameIdentifier,
+						argOrThis
+					)
+				) {
+					if (
+						!this.callHooksForInfo(
+							this.hooks.rename,
+							renameIdentifier,
+							argOrThis
+						)
+					) {
+						return this.getVariableInfo(renameIdentifier);
+					}
+				}
+			}
+			this.walkExpression(argOrThis);
+		};
+		const { params, type } = functionExpression;
+		const arrow = type === "ArrowFunctionExpression";
+		const renameThis = currentThis ? getVarInfo(currentThis) : null;
+		const varInfoForArgs = options.map(getVarInfo);
+		const wasTopLevel = this.scope.topLevelScope;
+		this.scope.topLevelScope = wasTopLevel && arrow ? "arrow" : false;
+		const scopeParams = params.filter(
+			(identifier, idx) => !varInfoForArgs[idx]
+		);
+
+		// Add function name in scope for recursive calls
+		if (functionExpression.id) {
+			scopeParams.push(functionExpression.id.name);
+		}
+
+		this.inFunctionScope(true, scopeParams, () => {
+			if (renameThis && !arrow) {
+				this.setVariable("this", renameThis);
+			}
+			for (let i = 0; i < varInfoForArgs.length; i++) {
+				const varInfo = varInfoForArgs[i];
+				if (!varInfo) continue;
+				if (!params[i] || params[i].type !== "Identifier") continue;
+				this.setVariable(params[i].name, varInfo);
+			}
+			if (functionExpression.body.type === "BlockStatement") {
+				this.detectMode(functionExpression.body.body);
+				const prev = this.prevStatement;
+				this.preWalkStatement(functionExpression.body);
+				this.prevStatement = prev;
+				this.walkStatement(functionExpression.body);
+			} else {
+				this.walkExpression(functionExpression.body);
+			}
+		});
+		this.scope.topLevelScope = wasTopLevel;
+	}
+
+	walkImportExpression(expression) {
+		let result = this.hooks.importCall.call(expression);
+		if (result === true) return;
+
+		this.walkExpression(expression.source);
+	}
+
+	walkCallExpression(expression) {
+		const isSimpleFunction = fn => {
+			return fn.params.every(p => p.type === "Identifier");
+		};
+		if (
+			expression.callee.type === "MemberExpression" &&
+			expression.callee.object.type.endsWith("FunctionExpression") &&
+			!expression.callee.computed &&
+			(expression.callee.property.name === "call" ||
+				expression.callee.property.name === "bind") &&
+			expression.arguments.length > 0 &&
+			isSimpleFunction(expression.callee.object)
+		) {
+			// (function(…) { }.call/bind(?, …))
+			this._walkIIFE(
+				expression.callee.object,
+				expression.arguments.slice(1),
+				expression.arguments[0]
+			);
+		} else if (
+			expression.callee.type.endsWith("FunctionExpression") &&
+			isSimpleFunction(expression.callee)
+		) {
+			// (function(…) { }(…))
+			this._walkIIFE(expression.callee, expression.arguments, null);
+		} else {
+			if (expression.callee.type === "MemberExpression") {
+				const exprInfo = this.getMemberExpressionInfo(
+					expression.callee,
+					ALLOWED_MEMBER_TYPES_CALL_EXPRESSION
+				);
+				if (exprInfo && exprInfo.type === "call") {
+					const result = this.callHooksForInfo(
+						this.hooks.callMemberChainOfCallMemberChain,
+						exprInfo.rootInfo,
+						expression,
+						exprInfo.getCalleeMembers(),
+						exprInfo.call,
+						exprInfo.getMembers()
+					);
+					if (result === true) return;
+				}
+			}
+			const callee = this.evaluateExpression(expression.callee);
+			if (callee.isIdentifier()) {
+				const result1 = this.callHooksForInfo(
+					this.hooks.callMemberChain,
+					callee.rootInfo,
+					expression,
+					callee.getMembers()
+				);
+				if (result1 === true) return;
+				const result2 = this.callHooksForInfo(
+					this.hooks.call,
+					callee.identifier,
+					expression
+				);
+				if (result2 === true) return;
+			}
+
+			if (expression.callee) {
+				if (expression.callee.type === "MemberExpression") {
+					// because of call context we need to walk the call context as expression
+					this.walkExpression(expression.callee.object);
+					if (expression.callee.computed === true)
+						this.walkExpression(expression.callee.property);
+				} else {
+					this.walkExpression(expression.callee);
+				}
+			}
+			if (expression.arguments) this.walkExpressions(expression.arguments);
+		}
+	}
+
+	walkMemberExpression(expression) {
+		const exprInfo = this.getMemberExpressionInfo(
+			expression,
+			ALLOWED_MEMBER_TYPES_ALL
+		);
+		if (exprInfo) {
+			switch (exprInfo.type) {
+				case "expression": {
+					const result1 = this.callHooksForInfo(
+						this.hooks.expression,
+						exprInfo.name,
+						expression
+					);
+					if (result1 === true) return;
+					const members = exprInfo.getMembers();
+					const result2 = this.callHooksForInfo(
+						this.hooks.expressionMemberChain,
+						exprInfo.rootInfo,
+						expression,
+						members
+					);
+					if (result2 === true) return;
+					this.walkMemberExpressionWithExpressionName(
+						expression,
+						exprInfo.name,
+						exprInfo.rootInfo,
+						members.slice(),
+						() =>
+							this.callHooksForInfo(
+								this.hooks.unhandledExpressionMemberChain,
+								exprInfo.rootInfo,
+								expression,
+								members
+							)
+					);
+					return;
+				}
+				case "call": {
+					const result = this.callHooksForInfo(
+						this.hooks.memberChainOfCallMemberChain,
+						exprInfo.rootInfo,
+						expression,
+						exprInfo.getCalleeMembers(),
+						exprInfo.call,
+						exprInfo.getMembers()
+					);
+					if (result === true) return;
+					// Fast skip over the member chain as we already called memberChainOfCallMemberChain
+					// and call computed property are literals anyway
+					this.walkExpression(exprInfo.call);
+					return;
+				}
+			}
+		}
+		this.walkExpression(expression.object);
+		if (expression.computed === true) this.walkExpression(expression.property);
+	}
+
+	walkMemberExpressionWithExpressionName(
+		expression,
+		name,
+		rootInfo,
+		members,
+		onUnhandled
+	) {
+		if (expression.object.type === "MemberExpression") {
+			// optimize the case where expression.object is a MemberExpression too.
+			// we can keep info here when calling walkMemberExpression directly
+			const property =
+				expression.property.name || `${expression.property.value}`;
+			name = name.slice(0, -property.length - 1);
+			members.pop();
+			const result = this.callHooksForInfo(
+				this.hooks.expression,
+				name,
+				expression.object
+			);
+			if (result === true) return;
+			this.walkMemberExpressionWithExpressionName(
+				expression.object,
+				name,
+				rootInfo,
+				members,
+				onUnhandled
+			);
+		} else if (!onUnhandled || !onUnhandled()) {
+			this.walkExpression(expression.object);
+		}
+		if (expression.computed === true) this.walkExpression(expression.property);
+	}
+
+	walkThisExpression(expression) {
+		this.callHooksForName(this.hooks.expression, "this", expression);
+	}
+
+	walkIdentifier(expression) {
+		this.callHooksForName(this.hooks.expression, expression.name, expression);
+	}
+
+	/**
+	 * @param {MetaPropertyNode} metaProperty meta property
+	 */
+	walkMetaProperty(metaProperty) {
+		this.hooks.expression.for(getRootName(metaProperty)).call(metaProperty);
+	}
+
+	callHooksForExpression(hookMap, expr, ...args) {
+		return this.callHooksForExpressionWithFallback(
+			hookMap,
+			expr,
+			undefined,
+			undefined,
+			...args
+		);
+	}
+
+	/**
+	 * @template T
+	 * @template R
+	 * @param {HookMap<SyncBailHook<T, R>>} hookMap hooks the should be called
+	 * @param {MemberExpressionNode} expr expression info
+	 * @param {function(string, string | ScopeInfo | VariableInfo, function(): string[]): any} fallback callback when variable in not handled by hooks
+	 * @param {function(string): any} defined callback when variable is defined
+	 * @param {AsArray<T>} args args for the hook
+	 * @returns {R} result of hook
+	 */
+	callHooksForExpressionWithFallback(
+		hookMap,
+		expr,
+		fallback,
+		defined,
+		...args
+	) {
+		const exprName = this.getMemberExpressionInfo(
+			expr,
+			ALLOWED_MEMBER_TYPES_EXPRESSION
+		);
+		if (exprName !== undefined) {
+			const members = exprName.getMembers();
+			return this.callHooksForInfoWithFallback(
+				hookMap,
+				members.length === 0 ? exprName.rootInfo : exprName.name,
+				fallback &&
+					(name => fallback(name, exprName.rootInfo, exprName.getMembers)),
+				defined && (() => defined(exprName.name)),
+				...args
+			);
+		}
+	}
+
+	/**
+	 * @template T
+	 * @template R
+	 * @param {HookMap<SyncBailHook<T, R>>} hookMap hooks the should be called
+	 * @param {string} name key in map
+	 * @param {AsArray<T>} args args for the hook
+	 * @returns {R} result of hook
+	 */
+	callHooksForName(hookMap, name, ...args) {
+		return this.callHooksForNameWithFallback(
+			hookMap,
+			name,
+			undefined,
+			undefined,
+			...args
+		);
+	}
+
+	/**
+	 * @template T
+	 * @template R
+	 * @param {HookMap<SyncBailHook<T, R>>} hookMap hooks that should be called
+	 * @param {ExportedVariableInfo} info variable info
+	 * @param  {AsArray<T>} args args for the hook
+	 * @returns {R} result of hook
+	 */
+	callHooksForInfo(hookMap, info, ...args) {
+		return this.callHooksForInfoWithFallback(
+			hookMap,
+			info,
+			undefined,
+			undefined,
+			...args
+		);
+	}
+
+	/**
+	 * @template T
+	 * @template R
+	 * @param {HookMap<SyncBailHook<T, R>>} hookMap hooks the should be called
+	 * @param {ExportedVariableInfo} info variable info
+	 * @param {function(string): any} fallback callback when variable in not handled by hooks
+	 * @param {function(): any} defined callback when variable is defined
+	 * @param {AsArray<T>} args args for the hook
+	 * @returns {R} result of hook
+	 */
+	callHooksForInfoWithFallback(hookMap, info, fallback, defined, ...args) {
+		let name;
+		if (typeof info === "string") {
+			name = info;
+		} else {
+			if (!(info instanceof VariableInfo)) {
+				if (defined !== undefined) {
+					return defined();
+				}
+				return;
+			}
+			let tagInfo = info.tagInfo;
+			while (tagInfo !== undefined) {
+				const hook = hookMap.get(tagInfo.tag);
+				if (hook !== undefined) {
+					this.currentTagData = tagInfo.data;
+					const result = hook.call(...args);
+					this.currentTagData = undefined;
+					if (result !== undefined) return result;
+				}
+				tagInfo = tagInfo.next;
+			}
+			if (info.freeName === true) {
+				if (defined !== undefined) {
+					return defined();
+				}
+				return;
+			}
+			name = info.freeName;
+		}
+		const hook = hookMap.get(name);
+		if (hook !== undefined) {
+			const result = hook.call(...args);
+			if (result !== undefined) return result;
+		}
+		if (fallback !== undefined) {
+			return fallback(name);
+		}
+	}
+
+	/**
+	 * @template T
+	 * @template R
+	 * @param {HookMap<SyncBailHook<T, R>>} hookMap hooks the should be called
+	 * @param {string} name key in map
+	 * @param {function(string): any} fallback callback when variable in not handled by hooks
+	 * @param {function(): any} defined callback when variable is defined
+	 * @param {AsArray<T>} args args for the hook
+	 * @returns {R} result of hook
+	 */
+	callHooksForNameWithFallback(hookMap, name, fallback, defined, ...args) {
+		return this.callHooksForInfoWithFallback(
+			hookMap,
+			this.getVariableInfo(name),
+			fallback,
+			defined,
+			...args
+		);
+	}
+
+	/**
+	 * @deprecated
+	 * @param {any} params scope params
+	 * @param {function(): void} fn inner function
+	 * @returns {void}
+	 */
+	inScope(params, fn) {
+		const oldScope = this.scope;
+		this.scope = {
+			topLevelScope: oldScope.topLevelScope,
+			inTry: false,
+			inShorthand: false,
+			isStrict: oldScope.isStrict,
+			isAsmJs: oldScope.isAsmJs,
+			definitions: oldScope.definitions.createChild()
+		};
+
+		this.undefineVariable("this");
+
+		this.enterPatterns(params, (ident, pattern) => {
+			this.defineVariable(ident);
+		});
+
+		fn();
+
+		this.scope = oldScope;
+	}
+
+	inFunctionScope(hasThis, params, fn) {
+		const oldScope = this.scope;
+		this.scope = {
+			topLevelScope: oldScope.topLevelScope,
+			inTry: false,
+			inShorthand: false,
+			isStrict: oldScope.isStrict,
+			isAsmJs: oldScope.isAsmJs,
+			definitions: oldScope.definitions.createChild()
+		};
+
+		if (hasThis) {
+			this.undefineVariable("this");
+		}
+
+		this.enterPatterns(params, (ident, pattern) => {
+			this.defineVariable(ident);
+		});
+
+		fn();
+
+		this.scope = oldScope;
+	}
+
+	inBlockScope(fn) {
+		const oldScope = this.scope;
+		this.scope = {
+			topLevelScope: oldScope.topLevelScope,
+			inTry: oldScope.inTry,
+			inShorthand: false,
+			isStrict: oldScope.isStrict,
+			isAsmJs: oldScope.isAsmJs,
+			definitions: oldScope.definitions.createChild()
+		};
+
+		fn();
+
+		this.scope = oldScope;
+	}
+
+	detectMode(statements) {
+		const isLiteral =
+			statements.length >= 1 &&
+			statements[0].type === "ExpressionStatement" &&
+			statements[0].expression.type === "Literal";
+		if (isLiteral && statements[0].expression.value === "use strict") {
+			this.scope.isStrict = true;
+		}
+		if (isLiteral && statements[0].expression.value === "use asm") {
+			this.scope.isAsmJs = true;
+		}
+	}
+
+	enterPatterns(patterns, onIdent) {
+		for (const pattern of patterns) {
+			if (typeof pattern !== "string") {
+				this.enterPattern(pattern, onIdent);
+			} else if (pattern) {
+				onIdent(pattern);
+			}
+		}
+	}
+
+	enterPattern(pattern, onIdent) {
+		if (!pattern) return;
+		switch (pattern.type) {
+			case "ArrayPattern":
+				this.enterArrayPattern(pattern, onIdent);
+				break;
+			case "AssignmentPattern":
+				this.enterAssignmentPattern(pattern, onIdent);
+				break;
+			case "Identifier":
+				this.enterIdentifier(pattern, onIdent);
+				break;
+			case "ObjectPattern":
+				this.enterObjectPattern(pattern, onIdent);
+				break;
+			case "RestElement":
+				this.enterRestElement(pattern, onIdent);
+				break;
+			case "Property":
+				if (pattern.shorthand && pattern.value.type === "Identifier") {
+					this.scope.inShorthand = pattern.value.name;
+					this.enterIdentifier(pattern.value, onIdent);
+					this.scope.inShorthand = false;
+				} else {
+					this.enterPattern(pattern.value, onIdent);
+				}
+				break;
+		}
+	}
+
+	enterIdentifier(pattern, onIdent) {
+		if (!this.callHooksForName(this.hooks.pattern, pattern.name, pattern)) {
+			onIdent(pattern.name, pattern);
+		}
+	}
+
+	enterObjectPattern(pattern, onIdent) {
+		for (
+			let propIndex = 0, len = pattern.properties.length;
+			propIndex < len;
+			propIndex++
+		) {
+			const prop = pattern.properties[propIndex];
+			this.enterPattern(prop, onIdent);
+		}
+	}
+
+	enterArrayPattern(pattern, onIdent) {
+		for (
+			let elementIndex = 0, len = pattern.elements.length;
+			elementIndex < len;
+			elementIndex++
+		) {
+			const element = pattern.elements[elementIndex];
+			this.enterPattern(element, onIdent);
+		}
+	}
+
+	enterRestElement(pattern, onIdent) {
+		this.enterPattern(pattern.argument, onIdent);
+	}
+
+	enterAssignmentPattern(pattern, onIdent) {
+		this.enterPattern(pattern.left, onIdent);
+	}
+
+	/**
+	 * @param {ExpressionNode} expression expression node
+	 * @returns {BasicEvaluatedExpression | undefined} evaluation result
+	 */
+	evaluateExpression(expression) {
+		try {
+			const hook = this.hooks.evaluate.get(expression.type);
+			if (hook !== undefined) {
+				const result = hook.call(expression);
+				if (result !== undefined) {
+					if (result) {
+						result.setExpression(expression);
+					}
+					return result;
+				}
+			}
+		} catch (e) {
+			console.warn(e);
+			// ignore error
+		}
+		return new BasicEvaluatedExpression()
+			.setRange(expression.range)
+			.setExpression(expression);
+	}
+
+	parseString(expression) {
+		switch (expression.type) {
+			case "BinaryExpression":
+				if (expression.operator === "+") {
+					return (
+						this.parseString(expression.left) +
+						this.parseString(expression.right)
+					);
+				}
+				break;
+			case "Literal":
+				return expression.value + "";
+		}
+		throw new Error(
+			expression.type + " is not supported as parameter for require"
+		);
+	}
+
+	parseCalculatedString(expression) {
+		switch (expression.type) {
+			case "BinaryExpression":
+				if (expression.operator === "+") {
+					const left = this.parseCalculatedString(expression.left);
+					const right = this.parseCalculatedString(expression.right);
+					if (left.code) {
+						return {
+							range: left.range,
+							value: left.value,
+							code: true,
+							conditional: false
+						};
+					} else if (right.code) {
+						return {
+							range: [
+								left.range[0],
+								right.range ? right.range[1] : left.range[1]
+							],
+							value: left.value + right.value,
+							code: true,
+							conditional: false
+						};
+					} else {
+						return {
+							range: [left.range[0], right.range[1]],
+							value: left.value + right.value,
+							code: false,
+							conditional: false
+						};
+					}
+				}
+				break;
+			case "ConditionalExpression": {
+				const consequent = this.parseCalculatedString(expression.consequent);
+				const alternate = this.parseCalculatedString(expression.alternate);
+				const items = [];
+				if (consequent.conditional) {
+					items.push(...consequent.conditional);
+				} else if (!consequent.code) {
+					items.push(consequent);
+				} else {
+					break;
+				}
+				if (alternate.conditional) {
+					items.push(...alternate.conditional);
+				} else if (!alternate.code) {
+					items.push(alternate);
+				} else {
+					break;
+				}
+				return {
+					range: undefined,
+					value: "",
+					code: true,
+					conditional: items
+				};
+			}
+			case "Literal":
+				return {
+					range: expression.range,
+					value: expression.value + "",
+					code: false,
+					conditional: false
+				};
+		}
+		return {
+			range: undefined,
+			value: "",
+			code: true,
+			conditional: false
+		};
+	}
+
+	/**
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		let ast;
+		let comments;
+		const semicolons = new Set();
+		if (source === null) {
+			throw new Error("source must not be null");
+		}
+		if (Buffer.isBuffer(source)) {
+			source = source.toString("utf-8");
+		}
+		if (typeof source === "object") {
+			ast = /** @type {ProgramNode} */ (source);
+			comments = source.comments;
+		} else {
+			comments = [];
+			ast = JavascriptParser._parse(source, {
+				sourceType: this.sourceType,
+				onComment: comments,
+				onInsertedSemicolon: pos => semicolons.add(pos)
+			});
+		}
+
+		const oldScope = this.scope;
+		const oldState = this.state;
+		const oldComments = this.comments;
+		const oldSemicolons = this.semicolons;
+		const oldStatementPath = this.statementPath;
+		const oldPrevStatement = this.prevStatement;
+		this.scope = {
+			topLevelScope: true,
+			inTry: false,
+			inShorthand: false,
+			isStrict: false,
+			isAsmJs: false,
+			definitions: new StackedMap()
+		};
+		/** @type {ParserState} */
+		this.state = state;
+		this.comments = comments;
+		this.semicolons = semicolons;
+		this.statementPath = [];
+		this.prevStatement = undefined;
+		if (this.hooks.program.call(ast, comments) === undefined) {
+			this.detectMode(ast.body);
+			this.preWalkStatements(ast.body);
+			this.prevStatement = undefined;
+			this.blockPreWalkStatements(ast.body);
+			this.prevStatement = undefined;
+			this.walkStatements(ast.body);
+		}
+		this.hooks.finish.call(ast, comments);
+		this.scope = oldScope;
+		/** @type {ParserState} */
+		this.state = oldState;
+		this.comments = oldComments;
+		this.semicolons = oldSemicolons;
+		this.statementPath = oldStatementPath;
+		this.prevStatement = oldPrevStatement;
+		return state;
+	}
+
+	evaluate(source) {
+		const ast = JavascriptParser._parse("(" + source + ")", {
+			sourceType: this.sourceType,
+			locations: false
+		});
+		if (ast.body.length !== 1 || ast.body[0].type !== "ExpressionStatement") {
+			throw new Error("evaluate: Source is not a expression");
+		}
+		return this.evaluateExpression(ast.body[0].expression);
+	}
+
+	/**
+	 * @param {ExpressionNode | DeclarationNode | PrivateIdentifierNode | null | undefined} expr an expression
+	 * @param {number} commentsStartPos source position from which annotation comments are checked
+	 * @returns {boolean} true, when the expression is pure
+	 */
+	isPure(expr, commentsStartPos) {
+		if (!expr) return true;
+		const result = this.hooks.isPure
+			.for(expr.type)
+			.call(expr, commentsStartPos);
+		if (typeof result === "boolean") return result;
+		switch (expr.type) {
+			case "ClassDeclaration":
+			case "ClassExpression": {
+				if (expr.body.type !== "ClassBody") return false;
+				if (expr.superClass && !this.isPure(expr.superClass, expr.range[0])) {
+					return false;
+				}
+				const items =
+					/** @type {(MethodDefinitionNode | PropertyDefinitionNode)[]} */ (
+						expr.body.body
+					);
+				return items.every(
+					item =>
+						(!item.computed ||
+							!item.key ||
+							this.isPure(item.key, item.range[0])) &&
+						(!item.static ||
+							!item.value ||
+							this.isPure(
+								item.value,
+								item.key ? item.key.range[1] : item.range[0]
+							))
+				);
+			}
+
+			case "FunctionDeclaration":
+			case "FunctionExpression":
+			case "ArrowFunctionExpression":
+			case "Literal":
+			case "PrivateIdentifier":
+				return true;
+
+			case "VariableDeclaration":
+				return expr.declarations.every(decl =>
+					this.isPure(decl.init, decl.range[0])
+				);
+
+			case "ConditionalExpression":
+				return (
+					this.isPure(expr.test, commentsStartPos) &&
+					this.isPure(expr.consequent, expr.test.range[1]) &&
+					this.isPure(expr.alternate, expr.consequent.range[1])
+				);
+
+			case "SequenceExpression":
+				return expr.expressions.every(expr => {
+					const pureFlag = this.isPure(expr, commentsStartPos);
+					commentsStartPos = expr.range[1];
+					return pureFlag;
+				});
+
+			case "CallExpression": {
+				const pureFlag =
+					expr.range[0] - commentsStartPos > 12 &&
+					this.getComments([commentsStartPos, expr.range[0]]).some(
+						comment =>
+							comment.type === "Block" &&
+							/^\s*(#|@)__PURE__\s*$/.test(comment.value)
+					);
+				if (!pureFlag) return false;
+				commentsStartPos = expr.callee.range[1];
+				return expr.arguments.every(arg => {
+					if (arg.type === "SpreadElement") return false;
+					const pureFlag = this.isPure(arg, commentsStartPos);
+					commentsStartPos = arg.range[1];
+					return pureFlag;
+				});
+			}
+		}
+		const evaluated = this.evaluateExpression(expr);
+		return !evaluated.couldHaveSideEffects();
+	}
+
+	getComments(range) {
+		const [rangeStart, rangeEnd] = range;
+		const compare = (comment, needle) => comment.range[0] - needle;
+		let idx = binarySearchBounds.ge(this.comments, rangeStart, compare);
+		let commentsInRange = [];
+		while (this.comments[idx] && this.comments[idx].range[1] <= rangeEnd) {
+			commentsInRange.push(this.comments[idx]);
+			idx++;
+		}
+
+		return commentsInRange;
+	}
+
+	/**
+	 * @param {number} pos source code position
+	 * @returns {boolean} true when a semicolon has been inserted before this position, false if not
+	 */
+	isAsiPosition(pos) {
+		const currentStatement = this.statementPath[this.statementPath.length - 1];
+		if (currentStatement === undefined) throw new Error("Not in statement");
+		return (
+			// Either asking directly for the end position of the current statement
+			(currentStatement.range[1] === pos && this.semicolons.has(pos)) ||
+			// Or asking for the start position of the current statement,
+			// here we have to check multiple things
+			(currentStatement.range[0] === pos &&
+				// is there a previous statement which might be relevant?
+				this.prevStatement !== undefined &&
+				// is the end position of the previous statement an ASI position?
+				this.semicolons.has(this.prevStatement.range[1]))
+		);
+	}
+
+	/**
+	 * @param {number} pos source code position
+	 * @returns {void}
+	 */
+	unsetAsiPosition(pos) {
+		this.semicolons.delete(pos);
+	}
+
+	isStatementLevelExpression(expr) {
+		const currentStatement = this.statementPath[this.statementPath.length - 1];
+		return (
+			expr === currentStatement ||
+			(currentStatement.type === "ExpressionStatement" &&
+				currentStatement.expression === expr)
+		);
+	}
+
+	getTagData(name, tag) {
+		const info = this.scope.definitions.get(name);
+		if (info instanceof VariableInfo) {
+			let tagInfo = info.tagInfo;
+			while (tagInfo !== undefined) {
+				if (tagInfo.tag === tag) return tagInfo.data;
+				tagInfo = tagInfo.next;
+			}
+		}
+	}
+
+	tagVariable(name, tag, data) {
+		const oldInfo = this.scope.definitions.get(name);
+		/** @type {VariableInfo} */
+		let newInfo;
+		if (oldInfo === undefined) {
+			newInfo = new VariableInfo(this.scope, name, {
+				tag,
+				data,
+				next: undefined
+			});
+		} else if (oldInfo instanceof VariableInfo) {
+			newInfo = new VariableInfo(oldInfo.declaredScope, oldInfo.freeName, {
+				tag,
+				data,
+				next: oldInfo.tagInfo
+			});
+		} else {
+			newInfo = new VariableInfo(oldInfo, true, {
+				tag,
+				data,
+				next: undefined
+			});
+		}
+		this.scope.definitions.set(name, newInfo);
+	}
+
+	defineVariable(name) {
+		const oldInfo = this.scope.definitions.get(name);
+		// Don't redefine variable in same scope to keep existing tags
+		if (oldInfo instanceof VariableInfo && oldInfo.declaredScope === this.scope)
+			return;
+		this.scope.definitions.set(name, this.scope);
+	}
+
+	undefineVariable(name) {
+		this.scope.definitions.delete(name);
+	}
+
+	isVariableDefined(name) {
+		const info = this.scope.definitions.get(name);
+		if (info === undefined) return false;
+		if (info instanceof VariableInfo) {
+			return info.freeName === true;
+		}
+		return true;
+	}
+
+	/**
+	 * @param {string} name variable name
+	 * @returns {ExportedVariableInfo} info for this variable
+	 */
+	getVariableInfo(name) {
+		const value = this.scope.definitions.get(name);
+		if (value === undefined) {
+			return name;
+		} else {
+			return value;
+		}
+	}
+
+	/**
+	 * @param {string} name variable name
+	 * @param {ExportedVariableInfo} variableInfo new info for this variable
+	 * @returns {void}
+	 */
+	setVariable(name, variableInfo) {
+		if (typeof variableInfo === "string") {
+			if (variableInfo === name) {
+				this.scope.definitions.delete(name);
+			} else {
+				this.scope.definitions.set(
+					name,
+					new VariableInfo(this.scope, variableInfo, undefined)
+				);
+			}
+		} else {
+			this.scope.definitions.set(name, variableInfo);
+		}
+	}
+
+	parseCommentOptions(range) {
+		const comments = this.getComments(range);
+		if (comments.length === 0) {
+			return EMPTY_COMMENT_OPTIONS;
+		}
+		let options = {};
+		let errors = [];
+		for (const comment of comments) {
+			const { value } = comment;
+			if (value && webpackCommentRegExp.test(value)) {
+				// try compile only if webpack options comment is present
+				try {
+					const val = vm.runInNewContext(`(function(){return {${value}};})()`);
+					Object.assign(options, val);
+				} catch (e) {
+					e.comment = comment;
+					errors.push(e);
+				}
+			}
+		}
+		return { options, errors };
+	}
+
+	/**
+	 * @param {MemberExpressionNode} expression a member expression
+	 * @returns {{ members: string[], object: ExpressionNode | SuperNode }} member names (reverse order) and remaining object
+	 */
+	extractMemberExpressionChain(expression) {
+		/** @type {AnyNode} */
+		let expr = expression;
+		const members = [];
+		while (expr.type === "MemberExpression") {
+			if (expr.computed) {
+				if (expr.property.type !== "Literal") break;
+				members.push(`${expr.property.value}`);
+			} else {
+				if (expr.property.type !== "Identifier") break;
+				members.push(expr.property.name);
+			}
+			expr = expr.object;
+		}
+		return {
+			members,
+			object: expr
+		};
+	}
+
+	/**
+	 * @param {string} varName variable name
+	 * @returns {{name: string, info: VariableInfo | string}} name of the free variable and variable info for that
+	 */
+	getFreeInfoFromVariable(varName) {
+		const info = this.getVariableInfo(varName);
+		let name;
+		if (info instanceof VariableInfo) {
+			name = info.freeName;
+			if (typeof name !== "string") return undefined;
+		} else if (typeof info !== "string") {
+			return undefined;
+		} else {
+			name = info;
+		}
+		return { info, name };
+	}
+
+	/** @typedef {{ type: "call", call: CallExpressionNode, calleeName: string, rootInfo: string | VariableInfo, getCalleeMembers: () => string[], name: string, getMembers: () => string[]}} CallExpressionInfo */
+	/** @typedef {{ type: "expression", rootInfo: string | VariableInfo, name: string, getMembers: () => string[]}} ExpressionExpressionInfo */
+
+	/**
+	 * @param {MemberExpressionNode} expression a member expression
+	 * @param {number} allowedTypes which types should be returned, presented in bit mask
+	 * @returns {CallExpressionInfo | ExpressionExpressionInfo | undefined} expression info
+	 */
+	getMemberExpressionInfo(expression, allowedTypes) {
+		const { object, members } = this.extractMemberExpressionChain(expression);
+		switch (object.type) {
+			case "CallExpression": {
+				if ((allowedTypes & ALLOWED_MEMBER_TYPES_CALL_EXPRESSION) === 0)
+					return undefined;
+				let callee = object.callee;
+				let rootMembers = EMPTY_ARRAY;
+				if (callee.type === "MemberExpression") {
+					({ object: callee, members: rootMembers } =
+						this.extractMemberExpressionChain(callee));
+				}
+				const rootName = getRootName(callee);
+				if (!rootName) return undefined;
+				const result = this.getFreeInfoFromVariable(rootName);
+				if (!result) return undefined;
+				const { info: rootInfo, name: resolvedRoot } = result;
+				const calleeName = objectAndMembersToName(resolvedRoot, rootMembers);
+				return {
+					type: "call",
+					call: object,
+					calleeName,
+					rootInfo,
+					getCalleeMembers: memoize(() => rootMembers.reverse()),
+					name: objectAndMembersToName(`${calleeName}()`, members),
+					getMembers: memoize(() => members.reverse())
+				};
+			}
+			case "Identifier":
+			case "MetaProperty":
+			case "ThisExpression": {
+				if ((allowedTypes & ALLOWED_MEMBER_TYPES_EXPRESSION) === 0)
+					return undefined;
+				const rootName = getRootName(object);
+				if (!rootName) return undefined;
+
+				const result = this.getFreeInfoFromVariable(rootName);
+				if (!result) return undefined;
+				const { info: rootInfo, name: resolvedRoot } = result;
+				return {
+					type: "expression",
+					name: objectAndMembersToName(resolvedRoot, members),
+					rootInfo,
+					getMembers: memoize(() => members.reverse())
+				};
+			}
+		}
+	}
+
+	/**
+	 * @param {MemberExpressionNode} expression an expression
+	 * @returns {{ name: string, rootInfo: ExportedVariableInfo, getMembers: () => string[]}} name info
+	 */
+	getNameForExpression(expression) {
+		return this.getMemberExpressionInfo(
+			expression,
+			ALLOWED_MEMBER_TYPES_EXPRESSION
+		);
+	}
+
+	/**
+	 * @param {string} code source code
+	 * @param {ParseOptions} options parsing options
+	 * @returns {ProgramNode} parsed ast
+	 */
+	static _parse(code, options) {
+		const type = options ? options.sourceType : "module";
+		/** @type {AcornOptions} */
+		const parserOptions = {
+			...defaultParserOptions,
+			allowReturnOutsideFunction: type === "script",
+			...options,
+			sourceType: type === "auto" ? "module" : type
+		};
+
+		/** @type {AnyNode} */
+		let ast;
+		let error;
+		let threw = false;
+		try {
+			ast = /** @type {AnyNode} */ (parser.parse(code, parserOptions));
+		} catch (e) {
+			error = e;
+			threw = true;
+		}
+
+		if (threw && type === "auto") {
+			parserOptions.sourceType = "script";
+			if (!("allowReturnOutsideFunction" in options)) {
+				parserOptions.allowReturnOutsideFunction = true;
+			}
+			if (Array.isArray(parserOptions.onComment)) {
+				parserOptions.onComment.length = 0;
+			}
+			try {
+				ast = /** @type {AnyNode} */ (parser.parse(code, parserOptions));
+				threw = false;
+			} catch (e) {
+				// we use the error from first parse try
+				// so nothing to do here
+			}
+		}
+
+		if (threw) {
+			throw error;
+		}
+
+		return /** @type {ProgramNode} */ (ast);
+	}
+}
+
+module.exports = JavascriptParser;
+module.exports.ALLOWED_MEMBER_TYPES_ALL = ALLOWED_MEMBER_TYPES_ALL;
+module.exports.ALLOWED_MEMBER_TYPES_EXPRESSION =
+	ALLOWED_MEMBER_TYPES_EXPRESSION;
+module.exports.ALLOWED_MEMBER_TYPES_CALL_EXPRESSION =
+	ALLOWED_MEMBER_TYPES_CALL_EXPRESSION;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptParserHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptParserHelpers.js
new file mode 100644
index 0000000..fc1dea8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/JavascriptParserHelpers.js
@@ -0,0 +1,107 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const UnsupportedFeatureWarning = require("../UnsupportedFeatureWarning");
+const ConstDependency = require("../dependencies/ConstDependency");
+const BasicEvaluatedExpression = require("./BasicEvaluatedExpression");
+
+/** @typedef {import("estree").Expression} ExpressionNode */
+/** @typedef {import("estree").Node} Node */
+/** @typedef {import("./JavascriptParser")} JavascriptParser */
+
+/**
+ * @param {JavascriptParser} parser the parser
+ * @param {string} value the const value
+ * @param {string[]=} runtimeRequirements runtime requirements
+ * @returns {function(ExpressionNode): true} plugin function
+ */
+exports.toConstantDependency = (parser, value, runtimeRequirements) => {
+	return function constDependency(expr) {
+		const dep = new ConstDependency(value, expr.range, runtimeRequirements);
+		dep.loc = expr.loc;
+		parser.state.module.addPresentationalDependency(dep);
+		return true;
+	};
+};
+
+/**
+ * @param {string} value the string value
+ * @returns {function(ExpressionNode): BasicEvaluatedExpression} plugin function
+ */
+exports.evaluateToString = value => {
+	return function stringExpression(expr) {
+		return new BasicEvaluatedExpression().setString(value).setRange(expr.range);
+	};
+};
+
+/**
+ * @param {number} value the number value
+ * @returns {function(ExpressionNode): BasicEvaluatedExpression} plugin function
+ */
+exports.evaluateToNumber = value => {
+	return function stringExpression(expr) {
+		return new BasicEvaluatedExpression().setNumber(value).setRange(expr.range);
+	};
+};
+
+/**
+ * @param {boolean} value the boolean value
+ * @returns {function(ExpressionNode): BasicEvaluatedExpression} plugin function
+ */
+exports.evaluateToBoolean = value => {
+	return function booleanExpression(expr) {
+		return new BasicEvaluatedExpression()
+			.setBoolean(value)
+			.setRange(expr.range);
+	};
+};
+
+/**
+ * @param {string} identifier identifier
+ * @param {string} rootInfo rootInfo
+ * @param {function(): string[]} getMembers getMembers
+ * @param {boolean|null=} truthy is truthy, null if nullish
+ * @returns {function(ExpressionNode): BasicEvaluatedExpression} callback
+ */
+exports.evaluateToIdentifier = (identifier, rootInfo, getMembers, truthy) => {
+	return function identifierExpression(expr) {
+		let evaluatedExpression = new BasicEvaluatedExpression()
+			.setIdentifier(identifier, rootInfo, getMembers)
+			.setSideEffects(false)
+			.setRange(expr.range);
+		switch (truthy) {
+			case true:
+				evaluatedExpression.setTruthy();
+				break;
+			case null:
+				evaluatedExpression.setNullish(true);
+				break;
+			case false:
+				evaluatedExpression.setFalsy();
+				break;
+		}
+
+		return evaluatedExpression;
+	};
+};
+
+exports.expressionIsUnsupported = (parser, message) => {
+	return function unsupportedExpression(expr) {
+		const dep = new ConstDependency("(void 0)", expr.range, null);
+		dep.loc = expr.loc;
+		parser.state.module.addPresentationalDependency(dep);
+		if (!parser.state.module) return;
+		parser.state.module.addWarning(
+			new UnsupportedFeatureWarning(message, expr.loc)
+		);
+		return true;
+	};
+};
+
+exports.skipTraversal = () => true;
+
+exports.approve = () => true;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/StartupHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/StartupHelpers.js
new file mode 100644
index 0000000..ac4ec2e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/javascript/StartupHelpers.js
@@ -0,0 +1,132 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const { isSubset } = require("../util/SetHelpers");
+const { getAllChunks } = require("./ChunkHelpers");
+
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGraph").EntryModuleWithChunkGroup} EntryModuleWithChunkGroup */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {(string|number)[]} EntryItem */
+
+const EXPORT_PREFIX = "var __webpack_exports__ = ";
+
+/**
+ * @param {ChunkGraph} chunkGraph chunkGraph
+ * @param {RuntimeTemplate} runtimeTemplate runtimeTemplate
+ * @param {EntryModuleWithChunkGroup[]} entries entries
+ * @param {Chunk} chunk chunk
+ * @param {boolean} passive true: passive startup with on chunks loaded
+ * @returns {string} runtime code
+ */
+exports.generateEntryStartup = (
+	chunkGraph,
+	runtimeTemplate,
+	entries,
+	chunk,
+	passive
+) => {
+	/** @type {string[]} */
+	const runtime = [
+		`var __webpack_exec__ = ${runtimeTemplate.returningFunction(
+			`__webpack_require__(${RuntimeGlobals.entryModuleId} = moduleId)`,
+			"moduleId"
+		)}`
+	];
+
+	const runModule = id => {
+		return `__webpack_exec__(${JSON.stringify(id)})`;
+	};
+	const outputCombination = (chunks, moduleIds, final) => {
+		if (chunks.size === 0) {
+			runtime.push(
+				`${final ? EXPORT_PREFIX : ""}(${moduleIds.map(runModule).join(", ")});`
+			);
+		} else {
+			const fn = runtimeTemplate.returningFunction(
+				moduleIds.map(runModule).join(", ")
+			);
+			runtime.push(
+				`${final && !passive ? EXPORT_PREFIX : ""}${
+					passive
+						? RuntimeGlobals.onChunksLoaded
+						: RuntimeGlobals.startupEntrypoint
+				}(0, ${JSON.stringify(Array.from(chunks, c => c.id))}, ${fn});`
+			);
+			if (final && passive) {
+				runtime.push(`${EXPORT_PREFIX}${RuntimeGlobals.onChunksLoaded}();`);
+			}
+		}
+	};
+
+	let currentChunks = undefined;
+	let currentModuleIds = undefined;
+
+	for (const [module, entrypoint] of entries) {
+		const runtimeChunk = entrypoint.getRuntimeChunk();
+		const moduleId = chunkGraph.getModuleId(module);
+		const chunks = getAllChunks(entrypoint, chunk, runtimeChunk);
+		if (
+			currentChunks &&
+			currentChunks.size === chunks.size &&
+			isSubset(currentChunks, chunks)
+		) {
+			currentModuleIds.push(moduleId);
+		} else {
+			if (currentChunks) {
+				outputCombination(currentChunks, currentModuleIds);
+			}
+			currentChunks = chunks;
+			currentModuleIds = [moduleId];
+		}
+	}
+
+	// output current modules with export prefix
+	if (currentChunks) {
+		outputCombination(currentChunks, currentModuleIds, true);
+	}
+	runtime.push("");
+	return Template.asString(runtime);
+};
+
+/**
+ * @param {Hash} hash the hash to update
+ * @param {ChunkGraph} chunkGraph chunkGraph
+ * @param {EntryModuleWithChunkGroup[]} entries entries
+ * @param {Chunk} chunk chunk
+ * @returns {void}
+ */
+exports.updateHashForEntryStartup = (hash, chunkGraph, entries, chunk) => {
+	for (const [module, entrypoint] of entries) {
+		const runtimeChunk = entrypoint.getRuntimeChunk();
+		const moduleId = chunkGraph.getModuleId(module);
+		hash.update(`${moduleId}`);
+		for (const c of getAllChunks(entrypoint, chunk, runtimeChunk))
+			hash.update(`${c.id}`);
+	}
+};
+
+/**
+ * @param {Chunk} chunk the chunk
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {function(Chunk, ChunkGraph): boolean} filterFn filter function
+ * @returns {Set<number | string>} initially fulfilled chunk ids
+ */
+exports.getInitialChunkIds = (chunk, chunkGraph, filterFn) => {
+	const initialChunkIds = new Set(chunk.ids);
+	for (const c of chunk.getAllInitialChunks()) {
+		if (c === chunk || filterFn(c, chunkGraph)) continue;
+		for (const id of c.ids) initialChunkIds.add(id);
+	}
+	return initialChunkIds;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonData.js b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonData.js
new file mode 100644
index 0000000..e664d46
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonData.js
@@ -0,0 +1,41 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { register } = require("../util/serialization");
+
+class JsonData {
+	constructor(data) {
+		this._buffer = undefined;
+		this._data = undefined;
+		if (Buffer.isBuffer(data)) {
+			this._buffer = data;
+		} else {
+			this._data = data;
+		}
+	}
+
+	get() {
+		if (this._data === undefined && this._buffer !== undefined) {
+			this._data = JSON.parse(this._buffer.toString());
+		}
+		return this._data;
+	}
+}
+
+register(JsonData, "webpack/lib/json/JsonData", null, {
+	serialize(obj, { write }) {
+		if (obj._buffer === undefined && obj._data !== undefined) {
+			obj._buffer = Buffer.from(JSON.stringify(obj._data));
+		}
+		write(obj._buffer);
+	},
+	deserialize({ read }) {
+		return new JsonData(read());
+	}
+});
+
+module.exports = JsonData;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonGenerator.js
new file mode 100644
index 0000000..2a4a030
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonGenerator.js
@@ -0,0 +1,191 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const ConcatenationScope = require("../ConcatenationScope");
+const { UsageState } = require("../ExportsInfo");
+const Generator = require("../Generator");
+const RuntimeGlobals = require("../RuntimeGlobals");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../ExportsInfo")} ExportsInfo */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../Module").ConcatenationBailoutReasonContext} ConcatenationBailoutReasonContext */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+const stringifySafe = data => {
+	const stringified = JSON.stringify(data);
+	if (!stringified) {
+		return undefined; // Invalid JSON
+	}
+
+	return stringified.replace(/\u2028|\u2029/g, str =>
+		str === "\u2029" ? "\\u2029" : "\\u2028"
+	); // invalid in JavaScript but valid JSON
+};
+
+/**
+ * @param {Object} data data (always an object or array)
+ * @param {ExportsInfo} exportsInfo exports info
+ * @param {RuntimeSpec} runtime the runtime
+ * @returns {Object} reduced data
+ */
+const createObjectForExportsInfo = (data, exportsInfo, runtime) => {
+	if (exportsInfo.otherExportsInfo.getUsed(runtime) !== UsageState.Unused)
+		return data;
+	const isArray = Array.isArray(data);
+	const reducedData = isArray ? [] : {};
+	for (const key of Object.keys(data)) {
+		const exportInfo = exportsInfo.getReadOnlyExportInfo(key);
+		const used = exportInfo.getUsed(runtime);
+		if (used === UsageState.Unused) continue;
+
+		let value;
+		if (used === UsageState.OnlyPropertiesUsed && exportInfo.exportsInfo) {
+			value = createObjectForExportsInfo(
+				data[key],
+				exportInfo.exportsInfo,
+				runtime
+			);
+		} else {
+			value = data[key];
+		}
+		const name = exportInfo.getUsedName(key, runtime);
+		reducedData[name] = value;
+	}
+	if (isArray) {
+		let arrayLengthWhenUsed =
+			exportsInfo.getReadOnlyExportInfo("length").getUsed(runtime) !==
+			UsageState.Unused
+				? data.length
+				: undefined;
+
+		let sizeObjectMinusArray = 0;
+		for (let i = 0; i < reducedData.length; i++) {
+			if (reducedData[i] === undefined) {
+				sizeObjectMinusArray -= 2;
+			} else {
+				sizeObjectMinusArray += `${i}`.length + 3;
+			}
+		}
+		if (arrayLengthWhenUsed !== undefined) {
+			sizeObjectMinusArray +=
+				`${arrayLengthWhenUsed}`.length +
+				8 -
+				(arrayLengthWhenUsed - reducedData.length) * 2;
+		}
+		if (sizeObjectMinusArray < 0)
+			return Object.assign(
+				arrayLengthWhenUsed === undefined
+					? {}
+					: { length: arrayLengthWhenUsed },
+				reducedData
+			);
+		const generatedLength =
+			arrayLengthWhenUsed !== undefined
+				? Math.max(arrayLengthWhenUsed, reducedData.length)
+				: reducedData.length;
+		for (let i = 0; i < generatedLength; i++) {
+			if (reducedData[i] === undefined) {
+				reducedData[i] = 0;
+			}
+		}
+	}
+	return reducedData;
+};
+
+const TYPES = new Set(["javascript"]);
+
+class JsonGenerator extends Generator {
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		let data =
+			module.buildInfo &&
+			module.buildInfo.jsonData &&
+			module.buildInfo.jsonData.get();
+		if (!data) return 0;
+		return stringifySafe(data).length + 10;
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the bailout reason should be determined
+	 * @param {ConcatenationBailoutReasonContext} context context
+	 * @returns {string | undefined} reason why this module can't be concatenated, undefined when it can be concatenated
+	 */
+	getConcatenationBailoutReason(module, context) {
+		return undefined;
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(
+		module,
+		{
+			moduleGraph,
+			runtimeTemplate,
+			runtimeRequirements,
+			runtime,
+			concatenationScope
+		}
+	) {
+		const data =
+			module.buildInfo &&
+			module.buildInfo.jsonData &&
+			module.buildInfo.jsonData.get();
+		if (data === undefined) {
+			return new RawSource(
+				runtimeTemplate.missingModuleStatement({
+					request: module.rawRequest
+				})
+			);
+		}
+		const exportsInfo = moduleGraph.getExportsInfo(module);
+		let finalJson =
+			typeof data === "object" &&
+			data &&
+			exportsInfo.otherExportsInfo.getUsed(runtime) === UsageState.Unused
+				? createObjectForExportsInfo(data, exportsInfo, runtime)
+				: data;
+		// Use JSON because JSON.parse() is much faster than JavaScript evaluation
+		const jsonStr = stringifySafe(finalJson);
+		const jsonExpr =
+			jsonStr.length > 20 && typeof finalJson === "object"
+				? `JSON.parse('${jsonStr.replace(/[\\']/g, "\\$&")}')`
+				: jsonStr;
+		let content;
+		if (concatenationScope) {
+			content = `${runtimeTemplate.supportsConst() ? "const" : "var"} ${
+				ConcatenationScope.NAMESPACE_OBJECT_EXPORT
+			} = ${jsonExpr};`;
+			concatenationScope.registerNamespaceExport(
+				ConcatenationScope.NAMESPACE_OBJECT_EXPORT
+			);
+		} else {
+			runtimeRequirements.add(RuntimeGlobals.module);
+			content = `${module.moduleArgument}.exports = ${jsonExpr};`;
+		}
+		return new RawSource(content);
+	}
+}
+
+module.exports = JsonGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonModulesPlugin.js
new file mode 100644
index 0000000..3743eec
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonModulesPlugin.js
@@ -0,0 +1,50 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const createSchemaValidation = require("../util/create-schema-validation");
+const JsonGenerator = require("./JsonGenerator");
+const JsonParser = require("./JsonParser");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/JsonModulesPluginParser.check.js"),
+	() => require("../../schemas/plugins/JsonModulesPluginParser.json"),
+	{
+		name: "Json Modules Plugin",
+		baseDataPath: "parser"
+	}
+);
+
+class JsonModulesPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"JsonModulesPlugin",
+			(compilation, { normalModuleFactory }) => {
+				normalModuleFactory.hooks.createParser
+					.for("json")
+					.tap("JsonModulesPlugin", parserOptions => {
+						validate(parserOptions);
+
+						return new JsonParser(parserOptions);
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("json")
+					.tap("JsonModulesPlugin", () => {
+						return new JsonGenerator();
+					});
+			}
+		);
+	}
+}
+
+module.exports = JsonModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonParser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonParser.js
new file mode 100644
index 0000000..43b6d57
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/json/JsonParser.js
@@ -0,0 +1,57 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const parseJson = require("json-parse-better-errors");
+const Parser = require("../Parser");
+const JsonExportsDependency = require("../dependencies/JsonExportsDependency");
+const JsonData = require("./JsonData");
+
+/** @typedef {import("../../declarations/plugins/JsonModulesPluginParser").JsonModulesPluginParserOptions} JsonModulesPluginParserOptions */
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../Parser").PreparsedAst} PreparsedAst */
+
+class JsonParser extends Parser {
+	/**
+	 * @param {JsonModulesPluginParserOptions} options parser options
+	 */
+	constructor(options) {
+		super();
+		this.options = options || {};
+	}
+
+	/**
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		if (Buffer.isBuffer(source)) {
+			source = source.toString("utf-8");
+		}
+
+		/** @type {JsonModulesPluginParserOptions["parse"]} */
+		const parseFn =
+			typeof this.options.parse === "function" ? this.options.parse : parseJson;
+
+		const data =
+			typeof source === "object"
+				? source
+				: parseFn(source[0] === "\ufeff" ? source.slice(1) : source);
+
+		state.module.buildInfo.jsonData = new JsonData(data);
+		state.module.buildInfo.strict = true;
+		state.module.buildMeta.exportsType = "default";
+		state.module.buildMeta.defaultObject =
+			typeof data === "object" ? "redirect-warn" : false;
+		state.module.addDependency(
+			new JsonExportsDependency(JsonExportsDependency.getExportsFromData(data))
+		);
+		return state;
+	}
+}
+
+module.exports = JsonParser;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/AbstractLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/AbstractLibraryPlugin.js
new file mode 100644
index 0000000..70a4f9c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/AbstractLibraryPlugin.js
@@ -0,0 +1,297 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const JavascriptModulesPlugin = require("../javascript/JavascriptModulesPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compilation").ChunkHashContext} ChunkHashContext */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").StartupRenderContext} StartupRenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+
+const COMMON_LIBRARY_NAME_MESSAGE =
+	"Common configuration options that specific library names are 'output.library[.name]', 'entry.xyz.library[.name]', 'ModuleFederationPlugin.name' and 'ModuleFederationPlugin.library[.name]'.";
+
+/**
+ * @template T
+ * @typedef {Object} LibraryContext
+ * @property {Compilation} compilation
+ * @property {ChunkGraph} chunkGraph
+ * @property {T} options
+ */
+
+/**
+ * @template T
+ */
+class AbstractLibraryPlugin {
+	/**
+	 * @param {Object} options options
+	 * @param {string} options.pluginName name of the plugin
+	 * @param {LibraryType} options.type used library type
+	 */
+	constructor({ pluginName, type }) {
+		this._pluginName = pluginName;
+		this._type = type;
+		this._parseCache = new WeakMap();
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { _pluginName } = this;
+		compiler.hooks.thisCompilation.tap(_pluginName, compilation => {
+			compilation.hooks.finishModules.tap(
+				{ name: _pluginName, stage: 10 },
+				() => {
+					for (const [
+						name,
+						{
+							dependencies: deps,
+							options: { library }
+						}
+					] of compilation.entries) {
+						const options = this._parseOptionsCached(
+							library !== undefined
+								? library
+								: compilation.outputOptions.library
+						);
+						if (options !== false) {
+							const dep = deps[deps.length - 1];
+							if (dep) {
+								const module = compilation.moduleGraph.getModule(dep);
+								if (module) {
+									this.finishEntryModule(module, name, {
+										options,
+										compilation,
+										chunkGraph: compilation.chunkGraph
+									});
+								}
+							}
+						}
+					}
+				}
+			);
+
+			const getOptionsForChunk = chunk => {
+				if (compilation.chunkGraph.getNumberOfEntryModules(chunk) === 0)
+					return false;
+				const options = chunk.getEntryOptions();
+				const library = options && options.library;
+				return this._parseOptionsCached(
+					library !== undefined ? library : compilation.outputOptions.library
+				);
+			};
+
+			if (
+				this.render !== AbstractLibraryPlugin.prototype.render ||
+				this.runtimeRequirements !==
+					AbstractLibraryPlugin.prototype.runtimeRequirements
+			) {
+				compilation.hooks.additionalChunkRuntimeRequirements.tap(
+					_pluginName,
+					(chunk, set, { chunkGraph }) => {
+						const options = getOptionsForChunk(chunk);
+						if (options !== false) {
+							this.runtimeRequirements(chunk, set, {
+								options,
+								compilation,
+								chunkGraph
+							});
+						}
+					}
+				);
+			}
+
+			const hooks = JavascriptModulesPlugin.getCompilationHooks(compilation);
+
+			if (this.render !== AbstractLibraryPlugin.prototype.render) {
+				hooks.render.tap(_pluginName, (source, renderContext) => {
+					const options = getOptionsForChunk(renderContext.chunk);
+					if (options === false) return source;
+					return this.render(source, renderContext, {
+						options,
+						compilation,
+						chunkGraph: compilation.chunkGraph
+					});
+				});
+			}
+
+			if (
+				this.embedInRuntimeBailout !==
+				AbstractLibraryPlugin.prototype.embedInRuntimeBailout
+			) {
+				hooks.embedInRuntimeBailout.tap(
+					_pluginName,
+					(module, renderContext) => {
+						const options = getOptionsForChunk(renderContext.chunk);
+						if (options === false) return;
+						return this.embedInRuntimeBailout(module, renderContext, {
+							options,
+							compilation,
+							chunkGraph: compilation.chunkGraph
+						});
+					}
+				);
+			}
+
+			if (
+				this.strictRuntimeBailout !==
+				AbstractLibraryPlugin.prototype.strictRuntimeBailout
+			) {
+				hooks.strictRuntimeBailout.tap(_pluginName, renderContext => {
+					const options = getOptionsForChunk(renderContext.chunk);
+					if (options === false) return;
+					return this.strictRuntimeBailout(renderContext, {
+						options,
+						compilation,
+						chunkGraph: compilation.chunkGraph
+					});
+				});
+			}
+
+			if (
+				this.renderStartup !== AbstractLibraryPlugin.prototype.renderStartup
+			) {
+				hooks.renderStartup.tap(
+					_pluginName,
+					(source, module, renderContext) => {
+						const options = getOptionsForChunk(renderContext.chunk);
+						if (options === false) return source;
+						return this.renderStartup(source, module, renderContext, {
+							options,
+							compilation,
+							chunkGraph: compilation.chunkGraph
+						});
+					}
+				);
+			}
+
+			hooks.chunkHash.tap(_pluginName, (chunk, hash, context) => {
+				const options = getOptionsForChunk(chunk);
+				if (options === false) return;
+				this.chunkHash(chunk, hash, context, {
+					options,
+					compilation,
+					chunkGraph: compilation.chunkGraph
+				});
+			});
+		});
+	}
+
+	/**
+	 * @param {LibraryOptions=} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	_parseOptionsCached(library) {
+		if (!library) return false;
+		if (library.type !== this._type) return false;
+		const cacheEntry = this._parseCache.get(library);
+		if (cacheEntry !== undefined) return cacheEntry;
+		const result = this.parseOptions(library);
+		this._parseCache.set(library, result);
+		return result;
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		const AbstractMethodError = require("../AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/**
+	 * @param {Module} module the exporting entry module
+	 * @param {string} entryName the name of the entrypoint
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	finishEntryModule(module, entryName, libraryContext) {}
+
+	/**
+	 * @param {Module} module the exporting entry module
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {string | undefined} bailout reason
+	 */
+	embedInRuntimeBailout(module, renderContext, libraryContext) {
+		return undefined;
+	}
+
+	/**
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {string | undefined} bailout reason
+	 */
+	strictRuntimeBailout(renderContext, libraryContext) {
+		return undefined;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Set<string>} set runtime requirements
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	runtimeRequirements(chunk, set, libraryContext) {
+		if (this.render !== AbstractLibraryPlugin.prototype.render)
+			set.add(RuntimeGlobals.returnExportsFromRuntime);
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	render(source, renderContext, libraryContext) {
+		return source;
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {Module} module module
+	 * @param {StartupRenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	renderStartup(source, module, renderContext, libraryContext) {
+		return source;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Hash} hash hash
+	 * @param {ChunkHashContext} chunkHashContext chunk hash context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	chunkHash(chunk, hash, chunkHashContext, libraryContext) {
+		const options = this._parseOptionsCached(
+			libraryContext.compilation.outputOptions.library
+		);
+		hash.update(this._pluginName);
+		hash.update(JSON.stringify(options));
+	}
+}
+
+AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE = COMMON_LIBRARY_NAME_MESSAGE;
+module.exports = AbstractLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/AmdLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/AmdLibraryPlugin.js
new file mode 100644
index 0000000..3e50849
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/AmdLibraryPlugin.js
@@ -0,0 +1,162 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const ExternalModule = require("../ExternalModule");
+const Template = require("../Template");
+const AbstractLibraryPlugin = require("./AbstractLibraryPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation").ChunkHashContext} ChunkHashContext */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+/** @template T @typedef {import("./AbstractLibraryPlugin").LibraryContext<T>} LibraryContext<T> */
+
+/**
+ * @typedef {Object} AmdLibraryPluginOptions
+ * @property {LibraryType} type
+ * @property {boolean=} requireAsWrapper
+ */
+
+/**
+ * @typedef {Object} AmdLibraryPluginParsed
+ * @property {string} name
+ */
+
+/**
+ * @typedef {AmdLibraryPluginParsed} T
+ * @extends {AbstractLibraryPlugin<AmdLibraryPluginParsed>}
+ */
+class AmdLibraryPlugin extends AbstractLibraryPlugin {
+	/**
+	 * @param {AmdLibraryPluginOptions} options the plugin options
+	 */
+	constructor(options) {
+		super({
+			pluginName: "AmdLibraryPlugin",
+			type: options.type
+		});
+		this.requireAsWrapper = options.requireAsWrapper;
+	}
+
+	/**
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		const { name } = library;
+		if (this.requireAsWrapper) {
+			if (name) {
+				throw new Error(
+					`AMD library name must be unset. ${AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE}`
+				);
+			}
+		} else {
+			if (name && typeof name !== "string") {
+				throw new Error(
+					`AMD library name must be a simple string or unset. ${AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE}`
+				);
+			}
+		}
+		return {
+			name: /** @type {string=} */ (name)
+		};
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	render(
+		source,
+		{ chunkGraph, chunk, runtimeTemplate },
+		{ options, compilation }
+	) {
+		const modern = runtimeTemplate.supportsArrowFunction();
+		const modules = chunkGraph
+			.getChunkModules(chunk)
+			.filter(m => m instanceof ExternalModule);
+		const externals = /** @type {ExternalModule[]} */ (modules);
+		const externalsDepsArray = JSON.stringify(
+			externals.map(m =>
+				typeof m.request === "object" && !Array.isArray(m.request)
+					? m.request.amd
+					: m.request
+			)
+		);
+		const externalsArguments = externals
+			.map(
+				m =>
+					`__WEBPACK_EXTERNAL_MODULE_${Template.toIdentifier(
+						`${chunkGraph.getModuleId(m)}`
+					)}__`
+			)
+			.join(", ");
+
+		const iife = runtimeTemplate.isIIFE();
+		const fnStart =
+			(modern
+				? `(${externalsArguments}) => {`
+				: `function(${externalsArguments}) {`) +
+			(iife || !chunk.hasRuntime() ? " return " : "\n");
+		const fnEnd = iife ? ";\n}" : "\n}";
+
+		if (this.requireAsWrapper) {
+			return new ConcatSource(
+				`require(${externalsDepsArray}, ${fnStart}`,
+				source,
+				`${fnEnd});`
+			);
+		} else if (options.name) {
+			const name = compilation.getPath(options.name, {
+				chunk
+			});
+
+			return new ConcatSource(
+				`define(${JSON.stringify(name)}, ${externalsDepsArray}, ${fnStart}`,
+				source,
+				`${fnEnd});`
+			);
+		} else if (externalsArguments) {
+			return new ConcatSource(
+				`define(${externalsDepsArray}, ${fnStart}`,
+				source,
+				`${fnEnd});`
+			);
+		} else {
+			return new ConcatSource(`define(${fnStart}`, source, `${fnEnd});`);
+		}
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Hash} hash hash
+	 * @param {ChunkHashContext} chunkHashContext chunk hash context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	chunkHash(chunk, hash, chunkHashContext, { options, compilation }) {
+		hash.update("AmdLibraryPlugin");
+		if (this.requireAsWrapper) {
+			hash.update("requireAsWrapper");
+		} else if (options.name) {
+			hash.update("named");
+			const name = compilation.getPath(options.name, {
+				chunk
+			});
+			hash.update(name);
+		}
+	}
+}
+
+module.exports = AmdLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/AssignLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/AssignLibraryPlugin.js
new file mode 100644
index 0000000..a4868d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/AssignLibraryPlugin.js
@@ -0,0 +1,375 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const { UsageState } = require("../ExportsInfo");
+const Template = require("../Template");
+const propertyAccess = require("../util/propertyAccess");
+const { getEntryRuntime } = require("../util/runtime");
+const AbstractLibraryPlugin = require("./AbstractLibraryPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation").ChunkHashContext} ChunkHashContext */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").StartupRenderContext} StartupRenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+/** @template T @typedef {import("./AbstractLibraryPlugin").LibraryContext<T>} LibraryContext<T> */
+
+const KEYWORD_REGEX =
+	/^(await|break|case|catch|class|const|continue|debugger|default|delete|do|else|enum|export|extends|false|finally|for|function|if|implements|import|in|instanceof|interface|let|new|null|package|private|protected|public|return|super|switch|static|this|throw|try|true|typeof|var|void|while|with|yield)$/;
+const IDENTIFIER_REGEX =
+	/^[\p{L}\p{Nl}$_][\p{L}\p{Nl}$\p{Mn}\p{Mc}\p{Nd}\p{Pc}]*$/iu;
+
+/**
+ * Validates the library name by checking for keywords and valid characters
+ * @param {string} name name to be validated
+ * @returns {boolean} true, when valid
+ */
+const isNameValid = name => {
+	return !KEYWORD_REGEX.test(name) && IDENTIFIER_REGEX.test(name);
+};
+
+/**
+ * @param {string[]} accessor variable plus properties
+ * @param {number} existingLength items of accessor that are existing already
+ * @param {boolean=} initLast if the last property should also be initialized to an object
+ * @returns {string} code to access the accessor while initializing
+ */
+const accessWithInit = (accessor, existingLength, initLast = false) => {
+	// This generates for [a, b, c, d]:
+	// (((a = typeof a === "undefined" ? {} : a).b = a.b || {}).c = a.b.c || {}).d
+	const base = accessor[0];
+	if (accessor.length === 1 && !initLast) return base;
+	let current =
+		existingLength > 0
+			? base
+			: `(${base} = typeof ${base} === "undefined" ? {} : ${base})`;
+
+	// i is the current position in accessor that has been printed
+	let i = 1;
+
+	// all properties printed so far (excluding base)
+	let propsSoFar;
+
+	// if there is existingLength, print all properties until this position as property access
+	if (existingLength > i) {
+		propsSoFar = accessor.slice(1, existingLength);
+		i = existingLength;
+		current += propertyAccess(propsSoFar);
+	} else {
+		propsSoFar = [];
+	}
+
+	// all remaining properties (except the last one when initLast is not set)
+	// should be printed as initializer
+	const initUntil = initLast ? accessor.length : accessor.length - 1;
+	for (; i < initUntil; i++) {
+		const prop = accessor[i];
+		propsSoFar.push(prop);
+		current = `(${current}${propertyAccess([prop])} = ${base}${propertyAccess(
+			propsSoFar
+		)} || {})`;
+	}
+
+	// print the last property as property access if not yet printed
+	if (i < accessor.length)
+		current = `${current}${propertyAccess([accessor[accessor.length - 1]])}`;
+
+	return current;
+};
+
+/**
+ * @typedef {Object} AssignLibraryPluginOptions
+ * @property {LibraryType} type
+ * @property {string[] | "global"} prefix name prefix
+ * @property {string | false} declare declare name as variable
+ * @property {"error"|"static"|"copy"|"assign"} unnamed behavior for unnamed library name
+ * @property {"copy"|"assign"=} named behavior for named library name
+ */
+
+/**
+ * @typedef {Object} AssignLibraryPluginParsed
+ * @property {string | string[]} name
+ * @property {string | string[] | undefined} export
+ */
+
+/**
+ * @typedef {AssignLibraryPluginParsed} T
+ * @extends {AbstractLibraryPlugin<AssignLibraryPluginParsed>}
+ */
+class AssignLibraryPlugin extends AbstractLibraryPlugin {
+	/**
+	 * @param {AssignLibraryPluginOptions} options the plugin options
+	 */
+	constructor(options) {
+		super({
+			pluginName: "AssignLibraryPlugin",
+			type: options.type
+		});
+		this.prefix = options.prefix;
+		this.declare = options.declare;
+		this.unnamed = options.unnamed;
+		this.named = options.named || "assign";
+	}
+
+	/**
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		const { name } = library;
+		if (this.unnamed === "error") {
+			if (typeof name !== "string" && !Array.isArray(name)) {
+				throw new Error(
+					`Library name must be a string or string array. ${AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE}`
+				);
+			}
+		} else {
+			if (name && typeof name !== "string" && !Array.isArray(name)) {
+				throw new Error(
+					`Library name must be a string, string array or unset. ${AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE}`
+				);
+			}
+		}
+		return {
+			name: /** @type {string|string[]=} */ (name),
+			export: library.export
+		};
+	}
+
+	/**
+	 * @param {Module} module the exporting entry module
+	 * @param {string} entryName the name of the entrypoint
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	finishEntryModule(
+		module,
+		entryName,
+		{ options, compilation, compilation: { moduleGraph } }
+	) {
+		const runtime = getEntryRuntime(compilation, entryName);
+		if (options.export) {
+			const exportsInfo = moduleGraph.getExportInfo(
+				module,
+				Array.isArray(options.export) ? options.export[0] : options.export
+			);
+			exportsInfo.setUsed(UsageState.Used, runtime);
+			exportsInfo.canMangleUse = false;
+		} else {
+			const exportsInfo = moduleGraph.getExportsInfo(module);
+			exportsInfo.setUsedInUnknownWay(runtime);
+		}
+		moduleGraph.addExtraReason(module, "used as library export");
+	}
+
+	_getPrefix(compilation) {
+		return this.prefix === "global"
+			? [compilation.runtimeTemplate.globalObject]
+			: this.prefix;
+	}
+
+	_getResolvedFullName(options, chunk, compilation) {
+		const prefix = this._getPrefix(compilation);
+		const fullName = options.name ? prefix.concat(options.name) : prefix;
+		return fullName.map(n =>
+			compilation.getPath(n, {
+				chunk
+			})
+		);
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	render(source, { chunk }, { options, compilation }) {
+		const fullNameResolved = this._getResolvedFullName(
+			options,
+			chunk,
+			compilation
+		);
+		if (this.declare) {
+			const base = fullNameResolved[0];
+			if (!isNameValid(base)) {
+				throw new Error(
+					`Library name base (${base}) must be a valid identifier when using a var declaring library type. Either use a valid identifier (e. g. ${Template.toIdentifier(
+						base
+					)}) or use a different library type (e. g. 'type: "global"', which assign a property on the global scope instead of declaring a variable). ${
+						AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE
+					}`
+				);
+			}
+			source = new ConcatSource(`${this.declare} ${base};\n`, source);
+		}
+		return source;
+	}
+
+	/**
+	 * @param {Module} module the exporting entry module
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {string | undefined} bailout reason
+	 */
+	embedInRuntimeBailout(
+		module,
+		{ chunk, codeGenerationResults },
+		{ options, compilation }
+	) {
+		const { data } = codeGenerationResults.get(module, chunk.runtime);
+		const topLevelDeclarations =
+			(data && data.get("topLevelDeclarations")) ||
+			(module.buildInfo && module.buildInfo.topLevelDeclarations);
+		if (!topLevelDeclarations)
+			return "it doesn't tell about top level declarations.";
+		const fullNameResolved = this._getResolvedFullName(
+			options,
+			chunk,
+			compilation
+		);
+		const base = fullNameResolved[0];
+		if (topLevelDeclarations.has(base))
+			return `it declares '${base}' on top-level, which conflicts with the current library output.`;
+	}
+
+	/**
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {string | undefined} bailout reason
+	 */
+	strictRuntimeBailout({ chunk }, { options, compilation }) {
+		if (
+			this.declare ||
+			this.prefix === "global" ||
+			this.prefix.length > 0 ||
+			!options.name
+		) {
+			return;
+		}
+		return "a global variable is assign and maybe created";
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {Module} module module
+	 * @param {StartupRenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	renderStartup(
+		source,
+		module,
+		{ moduleGraph, chunk },
+		{ options, compilation }
+	) {
+		const fullNameResolved = this._getResolvedFullName(
+			options,
+			chunk,
+			compilation
+		);
+		const staticExports = this.unnamed === "static";
+		const exportAccess = options.export
+			? propertyAccess(
+					Array.isArray(options.export) ? options.export : [options.export]
+			  )
+			: "";
+		const result = new ConcatSource(source);
+		if (staticExports) {
+			const exportsInfo = moduleGraph.getExportsInfo(module);
+			const exportTarget = accessWithInit(
+				fullNameResolved,
+				this._getPrefix(compilation).length,
+				true
+			);
+			for (const exportInfo of exportsInfo.orderedExports) {
+				if (!exportInfo.provided) continue;
+				const nameAccess = propertyAccess([exportInfo.name]);
+				result.add(
+					`${exportTarget}${nameAccess} = __webpack_exports__${exportAccess}${nameAccess};\n`
+				);
+			}
+			result.add(
+				`Object.defineProperty(${exportTarget}, "__esModule", { value: true });\n`
+			);
+		} else if (options.name ? this.named === "copy" : this.unnamed === "copy") {
+			result.add(
+				`var __webpack_export_target__ = ${accessWithInit(
+					fullNameResolved,
+					this._getPrefix(compilation).length,
+					true
+				)};\n`
+			);
+			let exports = "__webpack_exports__";
+			if (exportAccess) {
+				result.add(
+					`var __webpack_exports_export__ = __webpack_exports__${exportAccess};\n`
+				);
+				exports = "__webpack_exports_export__";
+			}
+			result.add(
+				`for(var i in ${exports}) __webpack_export_target__[i] = ${exports}[i];\n`
+			);
+			result.add(
+				`if(${exports}.__esModule) Object.defineProperty(__webpack_export_target__, "__esModule", { value: true });\n`
+			);
+		} else {
+			result.add(
+				`${accessWithInit(
+					fullNameResolved,
+					this._getPrefix(compilation).length,
+					false
+				)} = __webpack_exports__${exportAccess};\n`
+			);
+		}
+		return result;
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Set<string>} set runtime requirements
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	runtimeRequirements(chunk, set, libraryContext) {
+		// we don't need to return exports from runtime
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Hash} hash hash
+	 * @param {ChunkHashContext} chunkHashContext chunk hash context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	chunkHash(chunk, hash, chunkHashContext, { options, compilation }) {
+		hash.update("AssignLibraryPlugin");
+		const fullNameResolved = this._getResolvedFullName(
+			options,
+			chunk,
+			compilation
+		);
+		if (options.name ? this.named === "copy" : this.unnamed === "copy") {
+			hash.update("copy");
+		}
+		if (this.declare) {
+			hash.update(this.declare);
+		}
+		hash.update(fullNameResolved.join("."));
+		if (options.export) {
+			hash.update(`${options.export}`);
+		}
+	}
+}
+
+module.exports = AssignLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/EnableLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/EnableLibraryPlugin.js
new file mode 100644
index 0000000..0a8e929
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/EnableLibraryPlugin.js
@@ -0,0 +1,248 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Compiler")} Compiler */
+
+/** @type {WeakMap<Compiler, Set<LibraryType>>} */
+const enabledTypes = new WeakMap();
+
+const getEnabledTypes = compiler => {
+	let set = enabledTypes.get(compiler);
+	if (set === undefined) {
+		set = new Set();
+		enabledTypes.set(compiler, set);
+	}
+	return set;
+};
+
+class EnableLibraryPlugin {
+	/**
+	 * @param {LibraryType} type library type that should be available
+	 */
+	constructor(type) {
+		this.type = type;
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler instance
+	 * @param {LibraryType} type type of library
+	 * @returns {void}
+	 */
+	static setEnabled(compiler, type) {
+		getEnabledTypes(compiler).add(type);
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler instance
+	 * @param {LibraryType} type type of library
+	 * @returns {void}
+	 */
+	static checkEnabled(compiler, type) {
+		if (!getEnabledTypes(compiler).has(type)) {
+			throw new Error(
+				`Library type "${type}" is not enabled. ` +
+					"EnableLibraryPlugin need to be used to enable this type of library. " +
+					'This usually happens through the "output.enabledLibraryTypes" option. ' +
+					'If you are using a function as entry which sets "library", you need to add all potential library types to "output.enabledLibraryTypes". ' +
+					"These types are enabled: " +
+					Array.from(getEnabledTypes(compiler)).join(", ")
+			);
+		}
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { type } = this;
+
+		// Only enable once
+		const enabled = getEnabledTypes(compiler);
+		if (enabled.has(type)) return;
+		enabled.add(type);
+
+		if (typeof type === "string") {
+			const enableExportProperty = () => {
+				const ExportPropertyTemplatePlugin = require("./ExportPropertyLibraryPlugin");
+				new ExportPropertyTemplatePlugin({
+					type,
+					nsObjectUsed: type !== "module"
+				}).apply(compiler);
+			};
+			switch (type) {
+				case "var": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: [],
+						declare: "var",
+						unnamed: "error"
+					}).apply(compiler);
+					break;
+				}
+				case "assign-properties": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: [],
+						declare: false,
+						unnamed: "error",
+						named: "copy"
+					}).apply(compiler);
+					break;
+				}
+				case "assign": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: [],
+						declare: false,
+						unnamed: "error"
+					}).apply(compiler);
+					break;
+				}
+				case "this": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: ["this"],
+						declare: false,
+						unnamed: "copy"
+					}).apply(compiler);
+					break;
+				}
+				case "window": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: ["window"],
+						declare: false,
+						unnamed: "copy"
+					}).apply(compiler);
+					break;
+				}
+				case "self": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: ["self"],
+						declare: false,
+						unnamed: "copy"
+					}).apply(compiler);
+					break;
+				}
+				case "global": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: "global",
+						declare: false,
+						unnamed: "copy"
+					}).apply(compiler);
+					break;
+				}
+				case "commonjs": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: ["exports"],
+						declare: false,
+						unnamed: "copy"
+					}).apply(compiler);
+					break;
+				}
+				case "commonjs-static": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: ["exports"],
+						declare: false,
+						unnamed: "static"
+					}).apply(compiler);
+					break;
+				}
+				case "commonjs2":
+				case "commonjs-module": {
+					//@ts-expect-error https://github.com/microsoft/TypeScript/issues/41697
+					const AssignLibraryPlugin = require("./AssignLibraryPlugin");
+					new AssignLibraryPlugin({
+						type,
+						prefix: ["module", "exports"],
+						declare: false,
+						unnamed: "assign"
+					}).apply(compiler);
+					break;
+				}
+				case "amd":
+				case "amd-require": {
+					enableExportProperty();
+					const AmdLibraryPlugin = require("./AmdLibraryPlugin");
+					new AmdLibraryPlugin({
+						type,
+						requireAsWrapper: type === "amd-require"
+					}).apply(compiler);
+					break;
+				}
+				case "umd":
+				case "umd2": {
+					enableExportProperty();
+					const UmdLibraryPlugin = require("./UmdLibraryPlugin");
+					new UmdLibraryPlugin({
+						type,
+						optionalAmdExternalAsGlobal: type === "umd2"
+					}).apply(compiler);
+					break;
+				}
+				case "system": {
+					enableExportProperty();
+					const SystemLibraryPlugin = require("./SystemLibraryPlugin");
+					new SystemLibraryPlugin({
+						type
+					}).apply(compiler);
+					break;
+				}
+				case "jsonp": {
+					enableExportProperty();
+					const JsonpLibraryPlugin = require("./JsonpLibraryPlugin");
+					new JsonpLibraryPlugin({
+						type
+					}).apply(compiler);
+					break;
+				}
+				case "module": {
+					enableExportProperty();
+					const ModuleLibraryPlugin = require("./ModuleLibraryPlugin");
+					new ModuleLibraryPlugin({
+						type
+					}).apply(compiler);
+					break;
+				}
+				default:
+					throw new Error(`Unsupported library type ${type}.
+Plugins which provide custom library types must call EnableLibraryPlugin.setEnabled(compiler, type) to disable this error.`);
+			}
+		} else {
+			// TODO support plugin instances here
+			// apply them to the compiler
+		}
+	}
+}
+
+module.exports = EnableLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/ExportPropertyLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/ExportPropertyLibraryPlugin.js
new file mode 100644
index 0000000..4d95642
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/ExportPropertyLibraryPlugin.js
@@ -0,0 +1,113 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const { UsageState } = require("../ExportsInfo");
+const propertyAccess = require("../util/propertyAccess");
+const { getEntryRuntime } = require("../util/runtime");
+const AbstractLibraryPlugin = require("./AbstractLibraryPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").StartupRenderContext} StartupRenderContext */
+/** @template T @typedef {import("./AbstractLibraryPlugin").LibraryContext<T>} LibraryContext<T> */
+
+/**
+ * @typedef {Object} ExportPropertyLibraryPluginParsed
+ * @property {string | string[]} export
+ */
+
+/**
+ * @typedef {Object} ExportPropertyLibraryPluginOptions
+ * @property {LibraryType} type
+ * @property {boolean} nsObjectUsed the namespace object is used
+ */
+/**
+ * @typedef {ExportPropertyLibraryPluginParsed} T
+ * @extends {AbstractLibraryPlugin<ExportPropertyLibraryPluginParsed>}
+ */
+class ExportPropertyLibraryPlugin extends AbstractLibraryPlugin {
+	/**
+	 * @param {ExportPropertyLibraryPluginOptions} options options
+	 */
+	constructor({ type, nsObjectUsed }) {
+		super({
+			pluginName: "ExportPropertyLibraryPlugin",
+			type
+		});
+		this.nsObjectUsed = nsObjectUsed;
+	}
+
+	/**
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		return {
+			export: library.export
+		};
+	}
+
+	/**
+	 * @param {Module} module the exporting entry module
+	 * @param {string} entryName the name of the entrypoint
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	finishEntryModule(
+		module,
+		entryName,
+		{ options, compilation, compilation: { moduleGraph } }
+	) {
+		const runtime = getEntryRuntime(compilation, entryName);
+		if (options.export) {
+			const exportsInfo = moduleGraph.getExportInfo(
+				module,
+				Array.isArray(options.export) ? options.export[0] : options.export
+			);
+			exportsInfo.setUsed(UsageState.Used, runtime);
+			exportsInfo.canMangleUse = false;
+		} else {
+			const exportsInfo = moduleGraph.getExportsInfo(module);
+			if (this.nsObjectUsed) {
+				exportsInfo.setUsedInUnknownWay(runtime);
+			} else {
+				exportsInfo.setAllKnownExportsUsed(runtime);
+			}
+		}
+		moduleGraph.addExtraReason(module, "used as library export");
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Set<string>} set runtime requirements
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	runtimeRequirements(chunk, set, libraryContext) {}
+
+	/**
+	 * @param {Source} source source
+	 * @param {Module} module module
+	 * @param {StartupRenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	renderStartup(source, module, renderContext, { options }) {
+		if (!options.export) return source;
+		const postfix = `__webpack_exports__ = __webpack_exports__${propertyAccess(
+			Array.isArray(options.export) ? options.export : [options.export]
+		)};\n`;
+		return new ConcatSource(source, postfix);
+	}
+}
+
+module.exports = ExportPropertyLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/JsonpLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/JsonpLibraryPlugin.js
new file mode 100644
index 0000000..c9845f5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/JsonpLibraryPlugin.js
@@ -0,0 +1,88 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const AbstractLibraryPlugin = require("./AbstractLibraryPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation").ChunkHashContext} ChunkHashContext */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+/** @template T @typedef {import("./AbstractLibraryPlugin").LibraryContext<T>} LibraryContext<T> */
+
+/**
+ * @typedef {Object} JsonpLibraryPluginOptions
+ * @property {LibraryType} type
+ */
+
+/**
+ * @typedef {Object} JsonpLibraryPluginParsed
+ * @property {string} name
+ */
+
+/**
+ * @typedef {JsonpLibraryPluginParsed} T
+ * @extends {AbstractLibraryPlugin<JsonpLibraryPluginParsed>}
+ */
+class JsonpLibraryPlugin extends AbstractLibraryPlugin {
+	/**
+	 * @param {JsonpLibraryPluginOptions} options the plugin options
+	 */
+	constructor(options) {
+		super({
+			pluginName: "JsonpLibraryPlugin",
+			type: options.type
+		});
+	}
+
+	/**
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		const { name } = library;
+		if (typeof name !== "string") {
+			throw new Error(
+				`Jsonp library name must be a simple string. ${AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE}`
+			);
+		}
+		return {
+			name: /** @type {string} */ (name)
+		};
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	render(source, { chunk }, { options, compilation }) {
+		const name = compilation.getPath(options.name, {
+			chunk
+		});
+		return new ConcatSource(`${name}(`, source, ")");
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Hash} hash hash
+	 * @param {ChunkHashContext} chunkHashContext chunk hash context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	chunkHash(chunk, hash, chunkHashContext, { options, compilation }) {
+		hash.update("JsonpLibraryPlugin");
+		hash.update(compilation.getPath(options.name, { chunk }));
+	}
+}
+
+module.exports = JsonpLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/ModuleLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/ModuleLibraryPlugin.js
new file mode 100644
index 0000000..ce6482e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/ModuleLibraryPlugin.js
@@ -0,0 +1,104 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const Template = require("../Template");
+const propertyAccess = require("../util/propertyAccess");
+const AbstractLibraryPlugin = require("./AbstractLibraryPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation").ChunkHashContext} ChunkHashContext */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").StartupRenderContext} StartupRenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+/** @template T @typedef {import("./AbstractLibraryPlugin").LibraryContext<T>} LibraryContext<T> */
+
+/**
+ * @typedef {Object} ModuleLibraryPluginOptions
+ * @property {LibraryType} type
+ */
+
+/**
+ * @typedef {Object} ModuleLibraryPluginParsed
+ * @property {string} name
+ */
+
+/**
+ * @typedef {ModuleLibraryPluginParsed} T
+ * @extends {AbstractLibraryPlugin<ModuleLibraryPluginParsed>}
+ */
+class ModuleLibraryPlugin extends AbstractLibraryPlugin {
+	/**
+	 * @param {ModuleLibraryPluginOptions} options the plugin options
+	 */
+	constructor(options) {
+		super({
+			pluginName: "ModuleLibraryPlugin",
+			type: options.type
+		});
+	}
+
+	/**
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		const { name } = library;
+		if (name) {
+			throw new Error(
+				`Library name must be unset. ${AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE}`
+			);
+		}
+		return {
+			name: /** @type {string} */ (name)
+		};
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {Module} module module
+	 * @param {StartupRenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	renderStartup(
+		source,
+		module,
+		{ moduleGraph, chunk },
+		{ options, compilation }
+	) {
+		const result = new ConcatSource(source);
+		const exportsInfo = moduleGraph.getExportsInfo(module);
+		const exports = [];
+		const isAsync = moduleGraph.isAsync(module);
+		if (isAsync) {
+			result.add(`__webpack_exports__ = await __webpack_exports__;\n`);
+		}
+		for (const exportInfo of exportsInfo.orderedExports) {
+			if (!exportInfo.provided) continue;
+			const varName = `__webpack_exports__${Template.toIdentifier(
+				exportInfo.name
+			)}`;
+			result.add(
+				`var ${varName} = __webpack_exports__${propertyAccess([
+					exportInfo.getUsedName(exportInfo.name, chunk.runtime)
+				])};\n`
+			);
+			exports.push(`${varName} as ${exportInfo.name}`);
+		}
+		if (exports.length > 0) {
+			result.add(`export { ${exports.join(", ")} };\n`);
+		}
+		return result;
+	}
+}
+
+module.exports = ModuleLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/SystemLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/SystemLibraryPlugin.js
new file mode 100644
index 0000000..a762aff
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/SystemLibraryPlugin.js
@@ -0,0 +1,233 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Joel Denning @joeldenning
+*/
+
+"use strict";
+
+const { ConcatSource } = require("webpack-sources");
+const { UsageState } = require("../ExportsInfo");
+const ExternalModule = require("../ExternalModule");
+const Template = require("../Template");
+const propertyAccess = require("../util/propertyAccess");
+const AbstractLibraryPlugin = require("./AbstractLibraryPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation").ChunkHashContext} ChunkHashContext */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+/** @template T @typedef {import("./AbstractLibraryPlugin").LibraryContext<T>} LibraryContext<T> */
+
+/**
+ * @typedef {Object} SystemLibraryPluginOptions
+ * @property {LibraryType} type
+ */
+
+/**
+ * @typedef {Object} SystemLibraryPluginParsed
+ * @property {string} name
+ */
+
+/**
+ * @typedef {SystemLibraryPluginParsed} T
+ * @extends {AbstractLibraryPlugin<SystemLibraryPluginParsed>}
+ */
+class SystemLibraryPlugin extends AbstractLibraryPlugin {
+	/**
+	 * @param {SystemLibraryPluginOptions} options the plugin options
+	 */
+	constructor(options) {
+		super({
+			pluginName: "SystemLibraryPlugin",
+			type: options.type
+		});
+	}
+
+	/**
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		const { name } = library;
+		if (name && typeof name !== "string") {
+			throw new Error(
+				`System.js library name must be a simple string or unset. ${AbstractLibraryPlugin.COMMON_LIBRARY_NAME_MESSAGE}`
+			);
+		}
+		return {
+			name: /** @type {string=} */ (name)
+		};
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	render(source, { chunkGraph, moduleGraph, chunk }, { options, compilation }) {
+		const modules = chunkGraph
+			.getChunkModules(chunk)
+			.filter(m => m instanceof ExternalModule && m.externalType === "system");
+		const externals = /** @type {ExternalModule[]} */ (modules);
+
+		// The name this bundle should be registered as with System
+		const name = options.name
+			? `${JSON.stringify(compilation.getPath(options.name, { chunk }))}, `
+			: "";
+
+		// The array of dependencies that are external to webpack and will be provided by System
+		const systemDependencies = JSON.stringify(
+			externals.map(m =>
+				typeof m.request === "object" && !Array.isArray(m.request)
+					? m.request.amd
+					: m.request
+			)
+		);
+
+		// The name of the variable provided by System for exporting
+		const dynamicExport = "__WEBPACK_DYNAMIC_EXPORT__";
+
+		// An array of the internal variable names for the webpack externals
+		const externalWebpackNames = externals.map(
+			m =>
+				`__WEBPACK_EXTERNAL_MODULE_${Template.toIdentifier(
+					`${chunkGraph.getModuleId(m)}`
+				)}__`
+		);
+
+		// Declaring variables for the internal variable names for the webpack externals
+		const externalVarDeclarations = externalWebpackNames
+			.map(name => `var ${name} = {};`)
+			.join("\n");
+
+		// Define __esModule flag on all internal variables and helpers
+		const externalVarInitialization = [];
+
+		// The system.register format requires an array of setter functions for externals.
+		const setters =
+			externalWebpackNames.length === 0
+				? ""
+				: Template.asString([
+						"setters: [",
+						Template.indent(
+							externals
+								.map((module, i) => {
+									const external = externalWebpackNames[i];
+									const exportsInfo = moduleGraph.getExportsInfo(module);
+									const otherUnused =
+										exportsInfo.otherExportsInfo.getUsed(chunk.runtime) ===
+										UsageState.Unused;
+									const instructions = [];
+									const handledNames = [];
+									for (const exportInfo of exportsInfo.orderedExports) {
+										const used = exportInfo.getUsedName(
+											undefined,
+											chunk.runtime
+										);
+										if (used) {
+											if (otherUnused || used !== exportInfo.name) {
+												instructions.push(
+													`${external}${propertyAccess([
+														used
+													])} = module${propertyAccess([exportInfo.name])};`
+												);
+												handledNames.push(exportInfo.name);
+											}
+										} else {
+											handledNames.push(exportInfo.name);
+										}
+									}
+									if (!otherUnused) {
+										if (
+											!Array.isArray(module.request) ||
+											module.request.length === 1
+										) {
+											externalVarInitialization.push(
+												`Object.defineProperty(${external}, "__esModule", { value: true });`
+											);
+										}
+										if (handledNames.length > 0) {
+											const name = `${external}handledNames`;
+											externalVarInitialization.push(
+												`var ${name} = ${JSON.stringify(handledNames)};`
+											);
+											instructions.push(
+												Template.asString([
+													"Object.keys(module).forEach(function(key) {",
+													Template.indent([
+														`if(${name}.indexOf(key) >= 0)`,
+														Template.indent(`${external}[key] = module[key];`)
+													]),
+													"});"
+												])
+											);
+										} else {
+											instructions.push(
+												Template.asString([
+													"Object.keys(module).forEach(function(key) {",
+													Template.indent([`${external}[key] = module[key];`]),
+													"});"
+												])
+											);
+										}
+									}
+									if (instructions.length === 0) return "function() {}";
+									return Template.asString([
+										"function(module) {",
+										Template.indent(instructions),
+										"}"
+									]);
+								})
+								.join(",\n")
+						),
+						"],"
+				  ]);
+
+		return new ConcatSource(
+			Template.asString([
+				`System.register(${name}${systemDependencies}, function(${dynamicExport}, __system_context__) {`,
+				Template.indent([
+					externalVarDeclarations,
+					Template.asString(externalVarInitialization),
+					"return {",
+					Template.indent([
+						setters,
+						"execute: function() {",
+						Template.indent(`${dynamicExport}(`)
+					])
+				]),
+				""
+			]),
+			source,
+			Template.asString([
+				"",
+				Template.indent([
+					Template.indent([Template.indent([");"]), "}"]),
+					"};"
+				]),
+				"})"
+			])
+		);
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk
+	 * @param {Hash} hash hash
+	 * @param {ChunkHashContext} chunkHashContext chunk hash context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {void}
+	 */
+	chunkHash(chunk, hash, chunkHashContext, { options, compilation }) {
+		hash.update("SystemLibraryPlugin");
+		if (options.name) {
+			hash.update(compilation.getPath(options.name, { chunk }));
+		}
+	}
+}
+
+module.exports = SystemLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/library/UmdLibraryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/library/UmdLibraryPlugin.js
new file mode 100644
index 0000000..b7013d7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/library/UmdLibraryPlugin.js
@@ -0,0 +1,324 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { ConcatSource, OriginalSource } = require("webpack-sources");
+const ExternalModule = require("../ExternalModule");
+const Template = require("../Template");
+const AbstractLibraryPlugin = require("./AbstractLibraryPlugin");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryCustomUmdCommentObject} LibraryCustomUmdCommentObject */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryCustomUmdObject} LibraryCustomUmdObject */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryName} LibraryName */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").LibraryType} LibraryType */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+/** @template T @typedef {import("./AbstractLibraryPlugin").LibraryContext<T>} LibraryContext<T> */
+
+/**
+ * @param {string[]} accessor the accessor to convert to path
+ * @returns {string} the path
+ */
+const accessorToObjectAccess = accessor => {
+	return accessor.map(a => `[${JSON.stringify(a)}]`).join("");
+};
+
+/**
+ * @param {string|undefined} base the path prefix
+ * @param {string|string[]} accessor the accessor
+ * @param {string=} joinWith the element separator
+ * @returns {string} the path
+ */
+const accessorAccess = (base, accessor, joinWith = ", ") => {
+	const accessors = Array.isArray(accessor) ? accessor : [accessor];
+	return accessors
+		.map((_, idx) => {
+			const a = base
+				? base + accessorToObjectAccess(accessors.slice(0, idx + 1))
+				: accessors[0] + accessorToObjectAccess(accessors.slice(1, idx + 1));
+			if (idx === accessors.length - 1) return a;
+			if (idx === 0 && base === undefined)
+				return `${a} = typeof ${a} === "object" ? ${a} : {}`;
+			return `${a} = ${a} || {}`;
+		})
+		.join(joinWith);
+};
+
+/** @typedef {string | string[] | LibraryCustomUmdObject} UmdLibraryPluginName */
+
+/**
+ * @typedef {Object} UmdLibraryPluginOptions
+ * @property {LibraryType} type
+ * @property {boolean=} optionalAmdExternalAsGlobal
+ */
+
+/**
+ * @typedef {Object} UmdLibraryPluginParsed
+ * @property {string | string[]} name
+ * @property {LibraryCustomUmdObject} names
+ * @property {string | LibraryCustomUmdCommentObject} auxiliaryComment
+ * @property {boolean} namedDefine
+ */
+
+/**
+ * @typedef {UmdLibraryPluginParsed} T
+ * @extends {AbstractLibraryPlugin<UmdLibraryPluginParsed>}
+ */
+class UmdLibraryPlugin extends AbstractLibraryPlugin {
+	/**
+	 * @param {UmdLibraryPluginOptions} options the plugin option
+	 */
+	constructor(options) {
+		super({
+			pluginName: "UmdLibraryPlugin",
+			type: options.type
+		});
+
+		this.optionalAmdExternalAsGlobal = options.optionalAmdExternalAsGlobal;
+	}
+
+	/**
+	 * @param {LibraryOptions} library normalized library option
+	 * @returns {T | false} preprocess as needed by overriding
+	 */
+	parseOptions(library) {
+		/** @type {LibraryName} */
+		let name;
+		/** @type {LibraryCustomUmdObject} */
+		let names;
+		if (typeof library.name === "object" && !Array.isArray(library.name)) {
+			name = library.name.root || library.name.amd || library.name.commonjs;
+			names = library.name;
+		} else {
+			name = library.name;
+			const singleName = Array.isArray(name) ? name[0] : name;
+			names = {
+				commonjs: singleName,
+				root: library.name,
+				amd: singleName
+			};
+		}
+		return {
+			name,
+			names,
+			auxiliaryComment: library.auxiliaryComment,
+			namedDefine: library.umdNamedDefine
+		};
+	}
+
+	/**
+	 * @param {Source} source source
+	 * @param {RenderContext} renderContext render context
+	 * @param {LibraryContext<T>} libraryContext context
+	 * @returns {Source} source with library export
+	 */
+	render(
+		source,
+		{ chunkGraph, runtimeTemplate, chunk, moduleGraph },
+		{ options, compilation }
+	) {
+		const modules = chunkGraph
+			.getChunkModules(chunk)
+			.filter(
+				m =>
+					m instanceof ExternalModule &&
+					(m.externalType === "umd" || m.externalType === "umd2")
+			);
+		let externals = /** @type {ExternalModule[]} */ (modules);
+		/** @type {ExternalModule[]} */
+		const optionalExternals = [];
+		/** @type {ExternalModule[]} */
+		let requiredExternals = [];
+		if (this.optionalAmdExternalAsGlobal) {
+			for (const m of externals) {
+				if (m.isOptional(moduleGraph)) {
+					optionalExternals.push(m);
+				} else {
+					requiredExternals.push(m);
+				}
+			}
+			externals = requiredExternals.concat(optionalExternals);
+		} else {
+			requiredExternals = externals;
+		}
+
+		const replaceKeys = str => {
+			return compilation.getPath(str, {
+				chunk
+			});
+		};
+
+		const externalsDepsArray = modules => {
+			return `[${replaceKeys(
+				modules
+					.map(m =>
+						JSON.stringify(
+							typeof m.request === "object" ? m.request.amd : m.request
+						)
+					)
+					.join(", ")
+			)}]`;
+		};
+
+		const externalsRootArray = modules => {
+			return replaceKeys(
+				modules
+					.map(m => {
+						let request = m.request;
+						if (typeof request === "object") request = request.root;
+						return `root${accessorToObjectAccess([].concat(request))}`;
+					})
+					.join(", ")
+			);
+		};
+
+		const externalsRequireArray = type => {
+			return replaceKeys(
+				externals
+					.map(m => {
+						let expr;
+						let request = m.request;
+						if (typeof request === "object") {
+							request = request[type];
+						}
+						if (request === undefined) {
+							throw new Error(
+								"Missing external configuration for type:" + type
+							);
+						}
+						if (Array.isArray(request)) {
+							expr = `require(${JSON.stringify(
+								request[0]
+							)})${accessorToObjectAccess(request.slice(1))}`;
+						} else {
+							expr = `require(${JSON.stringify(request)})`;
+						}
+						if (m.isOptional(moduleGraph)) {
+							expr = `(function webpackLoadOptionalExternalModule() { try { return ${expr}; } catch(e) {} }())`;
+						}
+						return expr;
+					})
+					.join(", ")
+			);
+		};
+
+		const externalsArguments = modules => {
+			return modules
+				.map(
+					m =>
+						`__WEBPACK_EXTERNAL_MODULE_${Template.toIdentifier(
+							`${chunkGraph.getModuleId(m)}`
+						)}__`
+				)
+				.join(", ");
+		};
+
+		const libraryName = library => {
+			return JSON.stringify(replaceKeys([].concat(library).pop()));
+		};
+
+		let amdFactory;
+		if (optionalExternals.length > 0) {
+			const wrapperArguments = externalsArguments(requiredExternals);
+			const factoryArguments =
+				requiredExternals.length > 0
+					? externalsArguments(requiredExternals) +
+					  ", " +
+					  externalsRootArray(optionalExternals)
+					: externalsRootArray(optionalExternals);
+			amdFactory =
+				`function webpackLoadOptionalExternalModuleAmd(${wrapperArguments}) {\n` +
+				`			return factory(${factoryArguments});\n` +
+				"		}";
+		} else {
+			amdFactory = "factory";
+		}
+
+		const { auxiliaryComment, namedDefine, names } = options;
+
+		const getAuxiliaryComment = type => {
+			if (auxiliaryComment) {
+				if (typeof auxiliaryComment === "string")
+					return "\t//" + auxiliaryComment + "\n";
+				if (auxiliaryComment[type])
+					return "\t//" + auxiliaryComment[type] + "\n";
+			}
+			return "";
+		};
+
+		return new ConcatSource(
+			new OriginalSource(
+				"(function webpackUniversalModuleDefinition(root, factory) {\n" +
+					getAuxiliaryComment("commonjs2") +
+					"	if(typeof exports === 'object' && typeof module === 'object')\n" +
+					"		module.exports = factory(" +
+					externalsRequireArray("commonjs2") +
+					");\n" +
+					getAuxiliaryComment("amd") +
+					"	else if(typeof define === 'function' && define.amd)\n" +
+					(requiredExternals.length > 0
+						? names.amd && namedDefine === true
+							? "		define(" +
+							  libraryName(names.amd) +
+							  ", " +
+							  externalsDepsArray(requiredExternals) +
+							  ", " +
+							  amdFactory +
+							  ");\n"
+							: "		define(" +
+							  externalsDepsArray(requiredExternals) +
+							  ", " +
+							  amdFactory +
+							  ");\n"
+						: names.amd && namedDefine === true
+						? "		define(" +
+						  libraryName(names.amd) +
+						  ", [], " +
+						  amdFactory +
+						  ");\n"
+						: "		define([], " + amdFactory + ");\n") +
+					(names.root || names.commonjs
+						? getAuxiliaryComment("commonjs") +
+						  "	else if(typeof exports === 'object')\n" +
+						  "		exports[" +
+						  libraryName(names.commonjs || names.root) +
+						  "] = factory(" +
+						  externalsRequireArray("commonjs") +
+						  ");\n" +
+						  getAuxiliaryComment("root") +
+						  "	else\n" +
+						  "		" +
+						  replaceKeys(
+								accessorAccess("root", names.root || names.commonjs)
+						  ) +
+						  " = factory(" +
+						  externalsRootArray(externals) +
+						  ");\n"
+						: "	else {\n" +
+						  (externals.length > 0
+								? "		var a = typeof exports === 'object' ? factory(" +
+								  externalsRequireArray("commonjs") +
+								  ") : factory(" +
+								  externalsRootArray(externals) +
+								  ");\n"
+								: "		var a = factory();\n") +
+						  "		for(var i in a) (typeof exports === 'object' ? exports : root)[i] = a[i];\n" +
+						  "	}\n") +
+					`})(${
+						runtimeTemplate.outputOptions.globalObject
+					}, function(${externalsArguments(externals)}) {\nreturn `,
+				"webpack/universalModuleDefinition"
+			),
+			source,
+			";\n})"
+		);
+	}
+}
+
+module.exports = UmdLibraryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/logging/Logger.js b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/Logger.js
new file mode 100644
index 0000000..8258027
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/Logger.js
@@ -0,0 +1,163 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const LogType = Object.freeze({
+	error: /** @type {"error"} */ ("error"), // message, c style arguments
+	warn: /** @type {"warn"} */ ("warn"), // message, c style arguments
+	info: /** @type {"info"} */ ("info"), // message, c style arguments
+	log: /** @type {"log"} */ ("log"), // message, c style arguments
+	debug: /** @type {"debug"} */ ("debug"), // message, c style arguments
+
+	trace: /** @type {"trace"} */ ("trace"), // no arguments
+
+	group: /** @type {"group"} */ ("group"), // [label]
+	groupCollapsed: /** @type {"groupCollapsed"} */ ("groupCollapsed"), // [label]
+	groupEnd: /** @type {"groupEnd"} */ ("groupEnd"), // [label]
+
+	profile: /** @type {"profile"} */ ("profile"), // [profileName]
+	profileEnd: /** @type {"profileEnd"} */ ("profileEnd"), // [profileName]
+
+	time: /** @type {"time"} */ ("time"), // name, time as [seconds, nanoseconds]
+
+	clear: /** @type {"clear"} */ ("clear"), // no arguments
+	status: /** @type {"status"} */ ("status") // message, arguments
+});
+
+exports.LogType = LogType;
+
+/** @typedef {typeof LogType[keyof typeof LogType]} LogTypeEnum */
+
+const LOG_SYMBOL = Symbol("webpack logger raw log method");
+const TIMERS_SYMBOL = Symbol("webpack logger times");
+const TIMERS_AGGREGATES_SYMBOL = Symbol("webpack logger aggregated times");
+
+class WebpackLogger {
+	/**
+	 * @param {function(LogTypeEnum, any[]=): void} log log function
+	 * @param {function(string | function(): string): WebpackLogger} getChildLogger function to create child logger
+	 */
+	constructor(log, getChildLogger) {
+		this[LOG_SYMBOL] = log;
+		this.getChildLogger = getChildLogger;
+	}
+
+	error(...args) {
+		this[LOG_SYMBOL](LogType.error, args);
+	}
+
+	warn(...args) {
+		this[LOG_SYMBOL](LogType.warn, args);
+	}
+
+	info(...args) {
+		this[LOG_SYMBOL](LogType.info, args);
+	}
+
+	log(...args) {
+		this[LOG_SYMBOL](LogType.log, args);
+	}
+
+	debug(...args) {
+		this[LOG_SYMBOL](LogType.debug, args);
+	}
+
+	assert(assertion, ...args) {
+		if (!assertion) {
+			this[LOG_SYMBOL](LogType.error, args);
+		}
+	}
+
+	trace() {
+		this[LOG_SYMBOL](LogType.trace, ["Trace"]);
+	}
+
+	clear() {
+		this[LOG_SYMBOL](LogType.clear);
+	}
+
+	status(...args) {
+		this[LOG_SYMBOL](LogType.status, args);
+	}
+
+	group(...args) {
+		this[LOG_SYMBOL](LogType.group, args);
+	}
+
+	groupCollapsed(...args) {
+		this[LOG_SYMBOL](LogType.groupCollapsed, args);
+	}
+
+	groupEnd(...args) {
+		this[LOG_SYMBOL](LogType.groupEnd, args);
+	}
+
+	profile(label) {
+		this[LOG_SYMBOL](LogType.profile, [label]);
+	}
+
+	profileEnd(label) {
+		this[LOG_SYMBOL](LogType.profileEnd, [label]);
+	}
+
+	time(label) {
+		this[TIMERS_SYMBOL] = this[TIMERS_SYMBOL] || new Map();
+		this[TIMERS_SYMBOL].set(label, process.hrtime());
+	}
+
+	timeLog(label) {
+		const prev = this[TIMERS_SYMBOL] && this[TIMERS_SYMBOL].get(label);
+		if (!prev) {
+			throw new Error(`No such label '${label}' for WebpackLogger.timeLog()`);
+		}
+		const time = process.hrtime(prev);
+		this[LOG_SYMBOL](LogType.time, [label, ...time]);
+	}
+
+	timeEnd(label) {
+		const prev = this[TIMERS_SYMBOL] && this[TIMERS_SYMBOL].get(label);
+		if (!prev) {
+			throw new Error(`No such label '${label}' for WebpackLogger.timeEnd()`);
+		}
+		const time = process.hrtime(prev);
+		this[TIMERS_SYMBOL].delete(label);
+		this[LOG_SYMBOL](LogType.time, [label, ...time]);
+	}
+
+	timeAggregate(label) {
+		const prev = this[TIMERS_SYMBOL] && this[TIMERS_SYMBOL].get(label);
+		if (!prev) {
+			throw new Error(
+				`No such label '${label}' for WebpackLogger.timeAggregate()`
+			);
+		}
+		const time = process.hrtime(prev);
+		this[TIMERS_SYMBOL].delete(label);
+		this[TIMERS_AGGREGATES_SYMBOL] =
+			this[TIMERS_AGGREGATES_SYMBOL] || new Map();
+		const current = this[TIMERS_AGGREGATES_SYMBOL].get(label);
+		if (current !== undefined) {
+			if (time[1] + current[1] > 1e9) {
+				time[0] += current[0] + 1;
+				time[1] = time[1] - 1e9 + current[1];
+			} else {
+				time[0] += current[0];
+				time[1] += current[1];
+			}
+		}
+		this[TIMERS_AGGREGATES_SYMBOL].set(label, time);
+	}
+
+	timeAggregateEnd(label) {
+		if (this[TIMERS_AGGREGATES_SYMBOL] === undefined) return;
+		const time = this[TIMERS_AGGREGATES_SYMBOL].get(label);
+		if (time === undefined) return;
+		this[TIMERS_AGGREGATES_SYMBOL].delete(label);
+		this[LOG_SYMBOL](LogType.time, [label, ...time]);
+	}
+}
+
+exports.Logger = WebpackLogger;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/logging/createConsoleLogger.js b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/createConsoleLogger.js
new file mode 100644
index 0000000..1ad0aa7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/createConsoleLogger.js
@@ -0,0 +1,228 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { LogType } = require("./Logger");
+
+/** @typedef {import("../../declarations/WebpackOptions").FilterItemTypes} FilterItemTypes */
+/** @typedef {import("../../declarations/WebpackOptions").FilterTypes} FilterTypes */
+/** @typedef {import("./Logger").LogTypeEnum} LogTypeEnum */
+
+/** @typedef {function(string): boolean} FilterFunction */
+
+/**
+ * @typedef {Object} LoggerConsole
+ * @property {function(): void} clear
+ * @property {function(): void} trace
+ * @property {(...args: any[]) => void} info
+ * @property {(...args: any[]) => void} log
+ * @property {(...args: any[]) => void} warn
+ * @property {(...args: any[]) => void} error
+ * @property {(...args: any[]) => void=} debug
+ * @property {(...args: any[]) => void=} group
+ * @property {(...args: any[]) => void=} groupCollapsed
+ * @property {(...args: any[]) => void=} groupEnd
+ * @property {(...args: any[]) => void=} status
+ * @property {(...args: any[]) => void=} profile
+ * @property {(...args: any[]) => void=} profileEnd
+ * @property {(...args: any[]) => void=} logTime
+ */
+
+/**
+ * @typedef {Object} LoggerOptions
+ * @property {false|true|"none"|"error"|"warn"|"info"|"log"|"verbose"} level loglevel
+ * @property {FilterTypes|boolean} debug filter for debug logging
+ * @property {LoggerConsole} console the console to log to
+ */
+
+/**
+ * @param {FilterItemTypes} item an input item
+ * @returns {FilterFunction} filter function
+ */
+const filterToFunction = item => {
+	if (typeof item === "string") {
+		const regExp = new RegExp(
+			`[\\\\/]${item.replace(
+				// eslint-disable-next-line no-useless-escape
+				/[-[\]{}()*+?.\\^$|]/g,
+				"\\$&"
+			)}([\\\\/]|$|!|\\?)`
+		);
+		return ident => regExp.test(ident);
+	}
+	if (item && typeof item === "object" && typeof item.test === "function") {
+		return ident => item.test(ident);
+	}
+	if (typeof item === "function") {
+		return item;
+	}
+	if (typeof item === "boolean") {
+		return () => item;
+	}
+};
+
+/**
+ * @enum {number}
+ */
+const LogLevel = {
+	none: 6,
+	false: 6,
+	error: 5,
+	warn: 4,
+	info: 3,
+	log: 2,
+	true: 2,
+	verbose: 1
+};
+
+/**
+ * @param {LoggerOptions} options options object
+ * @returns {function(string, LogTypeEnum, any[]): void} logging function
+ */
+module.exports = ({ level = "info", debug = false, console }) => {
+	const debugFilters =
+		typeof debug === "boolean"
+			? [() => debug]
+			: /** @type {FilterItemTypes[]} */ ([])
+					.concat(debug)
+					.map(filterToFunction);
+	/** @type {number} */
+	const loglevel = LogLevel[`${level}`] || 0;
+
+	/**
+	 * @param {string} name name of the logger
+	 * @param {LogTypeEnum} type type of the log entry
+	 * @param {any[]} args arguments of the log entry
+	 * @returns {void}
+	 */
+	const logger = (name, type, args) => {
+		const labeledArgs = () => {
+			if (Array.isArray(args)) {
+				if (args.length > 0 && typeof args[0] === "string") {
+					return [`[${name}] ${args[0]}`, ...args.slice(1)];
+				} else {
+					return [`[${name}]`, ...args];
+				}
+			} else {
+				return [];
+			}
+		};
+		const debug = debugFilters.some(f => f(name));
+		switch (type) {
+			case LogType.debug:
+				if (!debug) return;
+				// eslint-disable-next-line node/no-unsupported-features/node-builtins
+				if (typeof console.debug === "function") {
+					// eslint-disable-next-line node/no-unsupported-features/node-builtins
+					console.debug(...labeledArgs());
+				} else {
+					console.log(...labeledArgs());
+				}
+				break;
+			case LogType.log:
+				if (!debug && loglevel > LogLevel.log) return;
+				console.log(...labeledArgs());
+				break;
+			case LogType.info:
+				if (!debug && loglevel > LogLevel.info) return;
+				console.info(...labeledArgs());
+				break;
+			case LogType.warn:
+				if (!debug && loglevel > LogLevel.warn) return;
+				console.warn(...labeledArgs());
+				break;
+			case LogType.error:
+				if (!debug && loglevel > LogLevel.error) return;
+				console.error(...labeledArgs());
+				break;
+			case LogType.trace:
+				if (!debug) return;
+				console.trace();
+				break;
+			case LogType.groupCollapsed:
+				if (!debug && loglevel > LogLevel.log) return;
+				if (!debug && loglevel > LogLevel.verbose) {
+					// eslint-disable-next-line node/no-unsupported-features/node-builtins
+					if (typeof console.groupCollapsed === "function") {
+						// eslint-disable-next-line node/no-unsupported-features/node-builtins
+						console.groupCollapsed(...labeledArgs());
+					} else {
+						console.log(...labeledArgs());
+					}
+					break;
+				}
+			// falls through
+			case LogType.group:
+				if (!debug && loglevel > LogLevel.log) return;
+				// eslint-disable-next-line node/no-unsupported-features/node-builtins
+				if (typeof console.group === "function") {
+					// eslint-disable-next-line node/no-unsupported-features/node-builtins
+					console.group(...labeledArgs());
+				} else {
+					console.log(...labeledArgs());
+				}
+				break;
+			case LogType.groupEnd:
+				if (!debug && loglevel > LogLevel.log) return;
+				// eslint-disable-next-line node/no-unsupported-features/node-builtins
+				if (typeof console.groupEnd === "function") {
+					// eslint-disable-next-line node/no-unsupported-features/node-builtins
+					console.groupEnd();
+				}
+				break;
+			case LogType.time: {
+				if (!debug && loglevel > LogLevel.log) return;
+				const ms = args[1] * 1000 + args[2] / 1000000;
+				const msg = `[${name}] ${args[0]}: ${ms} ms`;
+				if (typeof console.logTime === "function") {
+					console.logTime(msg);
+				} else {
+					console.log(msg);
+				}
+				break;
+			}
+			case LogType.profile:
+				// eslint-disable-next-line node/no-unsupported-features/node-builtins
+				if (typeof console.profile === "function") {
+					// eslint-disable-next-line node/no-unsupported-features/node-builtins
+					console.profile(...labeledArgs());
+				}
+				break;
+			case LogType.profileEnd:
+				// eslint-disable-next-line node/no-unsupported-features/node-builtins
+				if (typeof console.profileEnd === "function") {
+					// eslint-disable-next-line node/no-unsupported-features/node-builtins
+					console.profileEnd(...labeledArgs());
+				}
+				break;
+			case LogType.clear:
+				if (!debug && loglevel > LogLevel.log) return;
+				// eslint-disable-next-line node/no-unsupported-features/node-builtins
+				if (typeof console.clear === "function") {
+					// eslint-disable-next-line node/no-unsupported-features/node-builtins
+					console.clear();
+				}
+				break;
+			case LogType.status:
+				if (!debug && loglevel > LogLevel.info) return;
+				if (typeof console.status === "function") {
+					if (args.length === 0) {
+						console.status();
+					} else {
+						console.status(...labeledArgs());
+					}
+				} else {
+					if (args.length !== 0) {
+						console.info(...labeledArgs());
+					}
+				}
+				break;
+			default:
+				throw new Error(`Unexpected LogType ${type}`);
+		}
+	};
+	return logger;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/logging/runtime.js b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/runtime.js
new file mode 100644
index 0000000..26422f2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/runtime.js
@@ -0,0 +1,46 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const SyncBailHook = require("tapable/lib/SyncBailHook");
+const { Logger } = require("./Logger");
+const createConsoleLogger = require("./createConsoleLogger");
+
+/** @type {createConsoleLogger.LoggerOptions} */
+let currentDefaultLoggerOptions = {
+	level: "info",
+	debug: false,
+	console
+};
+let currentDefaultLogger = createConsoleLogger(currentDefaultLoggerOptions);
+
+/**
+ * @param {string} name name of the logger
+ * @returns {Logger} a logger
+ */
+exports.getLogger = name => {
+	return new Logger(
+		(type, args) => {
+			if (exports.hooks.log.call(name, type, args) === undefined) {
+				currentDefaultLogger(name, type, args);
+			}
+		},
+		childName => exports.getLogger(`${name}/${childName}`)
+	);
+};
+
+/**
+ * @param {createConsoleLogger.LoggerOptions} options new options, merge with old options
+ * @returns {void}
+ */
+exports.configureDefaultLogger = options => {
+	Object.assign(currentDefaultLoggerOptions, options);
+	currentDefaultLogger = createConsoleLogger(currentDefaultLoggerOptions);
+};
+
+exports.hooks = {
+	log: new SyncBailHook(["origin", "type", "args"])
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/logging/truncateArgs.js b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/truncateArgs.js
new file mode 100644
index 0000000..6e20c8b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/logging/truncateArgs.js
@@ -0,0 +1,82 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const arraySum = array => {
+	let sum = 0;
+	for (const item of array) sum += item;
+	return sum;
+};
+
+/**
+ * @param {any[]} args items to be truncated
+ * @param {number} maxLength maximum length of args including spaces between
+ * @returns {string[]} truncated args
+ */
+const truncateArgs = (args, maxLength) => {
+	const lengths = args.map(a => `${a}`.length);
+	const availableLength = maxLength - lengths.length + 1;
+
+	if (availableLength > 0 && args.length === 1) {
+		if (availableLength >= args[0].length) {
+			return args;
+		} else if (availableLength > 3) {
+			return ["..." + args[0].slice(-availableLength + 3)];
+		} else {
+			return [args[0].slice(-availableLength)];
+		}
+	}
+
+	// Check if there is space for at least 4 chars per arg
+	if (availableLength < arraySum(lengths.map(i => Math.min(i, 6)))) {
+		// remove args
+		if (args.length > 1)
+			return truncateArgs(args.slice(0, args.length - 1), maxLength);
+		return [];
+	}
+
+	let currentLength = arraySum(lengths);
+
+	// Check if all fits into maxLength
+	if (currentLength <= availableLength) return args;
+
+	// Try to remove chars from the longest items until it fits
+	while (currentLength > availableLength) {
+		const maxLength = Math.max(...lengths);
+		const shorterItems = lengths.filter(l => l !== maxLength);
+		const nextToMaxLength =
+			shorterItems.length > 0 ? Math.max(...shorterItems) : 0;
+		const maxReduce = maxLength - nextToMaxLength;
+		let maxItems = lengths.length - shorterItems.length;
+		let overrun = currentLength - availableLength;
+		for (let i = 0; i < lengths.length; i++) {
+			if (lengths[i] === maxLength) {
+				const reduce = Math.min(Math.floor(overrun / maxItems), maxReduce);
+				lengths[i] -= reduce;
+				currentLength -= reduce;
+				overrun -= reduce;
+				maxItems--;
+			}
+		}
+	}
+
+	// Return args reduced to length in lengths
+	return args.map((a, i) => {
+		const str = `${a}`;
+		const length = lengths[i];
+		if (str.length === length) {
+			return str;
+		} else if (length > 5) {
+			return "..." + str.slice(-length + 3);
+		} else if (length > 0) {
+			return str.slice(-length);
+		} else {
+			return "";
+		}
+	});
+};
+
+module.exports = truncateArgs;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/CommonJsChunkLoadingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/CommonJsChunkLoadingPlugin.js
new file mode 100644
index 0000000..2653d78
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/CommonJsChunkLoadingPlugin.js
@@ -0,0 +1,105 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const StartupChunkDependenciesPlugin = require("../runtime/StartupChunkDependenciesPlugin");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class CommonJsChunkLoadingPlugin {
+	constructor(options) {
+		options = options || {};
+		this._asyncChunkLoading = options.asyncChunkLoading;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const ChunkLoadingRuntimeModule = this._asyncChunkLoading
+			? require("./ReadFileChunkLoadingRuntimeModule")
+			: require("./RequireChunkLoadingRuntimeModule");
+		const chunkLoadingValue = this._asyncChunkLoading
+			? "async-node"
+			: "require";
+		new StartupChunkDependenciesPlugin({
+			chunkLoading: chunkLoadingValue,
+			asyncChunkLoading: this._asyncChunkLoading
+		}).apply(compiler);
+		compiler.hooks.thisCompilation.tap(
+			"CommonJsChunkLoadingPlugin",
+			compilation => {
+				const globalChunkLoading = compilation.outputOptions.chunkLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const chunkLoading =
+						options && options.chunkLoading !== undefined
+							? options.chunkLoading
+							: globalChunkLoading;
+					return chunkLoading === chunkLoadingValue;
+				};
+				const onceForChunkSet = new WeakSet();
+				const handler = (chunk, set) => {
+					if (onceForChunkSet.has(chunk)) return;
+					onceForChunkSet.add(chunk);
+					if (!isEnabledForChunk(chunk)) return;
+					set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					set.add(RuntimeGlobals.hasOwnProperty);
+					compilation.addRuntimeModule(
+						chunk,
+						new ChunkLoadingRuntimeModule(set)
+					);
+				};
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("CommonJsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadUpdateHandlers)
+					.tap("CommonJsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadManifest)
+					.tap("CommonJsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.baseURI)
+					.tap("CommonJsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.externalInstallChunk)
+					.tap("CommonJsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.onChunksLoaded)
+					.tap("CommonJsChunkLoadingPlugin", handler);
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("CommonJsChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.getChunkScriptFilename);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadUpdateHandlers)
+					.tap("CommonJsChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.getChunkUpdateScriptFilename);
+						set.add(RuntimeGlobals.moduleCache);
+						set.add(RuntimeGlobals.hmrModuleData);
+						set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadManifest)
+					.tap("CommonJsChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.getUpdateManifestFilename);
+					});
+			}
+		);
+	}
+}
+
+module.exports = CommonJsChunkLoadingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeEnvironmentPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeEnvironmentPlugin.js
new file mode 100644
index 0000000..7d53eb1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeEnvironmentPlugin.js
@@ -0,0 +1,60 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const CachedInputFileSystem = require("enhanced-resolve/lib/CachedInputFileSystem");
+const fs = require("graceful-fs");
+const createConsoleLogger = require("../logging/createConsoleLogger");
+const NodeWatchFileSystem = require("./NodeWatchFileSystem");
+const nodeConsole = require("./nodeConsole");
+
+/** @typedef {import("../../declarations/WebpackOptions").InfrastructureLogging} InfrastructureLogging */
+/** @typedef {import("../Compiler")} Compiler */
+
+class NodeEnvironmentPlugin {
+	/**
+	 * @param {Object} options options
+	 * @param {InfrastructureLogging} options.infrastructureLogging infrastructure logging options
+	 */
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { infrastructureLogging } = this.options;
+		compiler.infrastructureLogger = createConsoleLogger({
+			level: infrastructureLogging.level || "info",
+			debug: infrastructureLogging.debug || false,
+			console:
+				infrastructureLogging.console ||
+				nodeConsole({
+					colors: infrastructureLogging.colors,
+					appendOnly: infrastructureLogging.appendOnly,
+					stream: infrastructureLogging.stream
+				})
+		});
+		compiler.inputFileSystem = new CachedInputFileSystem(fs, 60000);
+		const inputFileSystem = compiler.inputFileSystem;
+		compiler.outputFileSystem = fs;
+		compiler.intermediateFileSystem = fs;
+		compiler.watchFileSystem = new NodeWatchFileSystem(
+			compiler.inputFileSystem
+		);
+		compiler.hooks.beforeRun.tap("NodeEnvironmentPlugin", compiler => {
+			if (compiler.inputFileSystem === inputFileSystem) {
+				compiler.fsStartTime = Date.now();
+				inputFileSystem.purge();
+			}
+		});
+	}
+}
+
+module.exports = NodeEnvironmentPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeSourcePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeSourcePlugin.js
new file mode 100644
index 0000000..fca1fc9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeSourcePlugin.js
@@ -0,0 +1,19 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class NodeSourcePlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {}
+}
+
+module.exports = NodeSourcePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeTargetPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeTargetPlugin.js
new file mode 100644
index 0000000..33f785b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeTargetPlugin.js
@@ -0,0 +1,81 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ExternalsPlugin = require("../ExternalsPlugin");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+const builtins = [
+	"assert",
+	"async_hooks",
+	"buffer",
+	"child_process",
+	"cluster",
+	"console",
+	"constants",
+	"crypto",
+	"dgram",
+	"diagnostics_channel",
+	"dns",
+	"dns/promises",
+	"domain",
+	"events",
+	"fs",
+	"fs/promises",
+	"http",
+	"http2",
+	"https",
+	"inspector",
+	"module",
+	"net",
+	"os",
+	"path",
+	"path/posix",
+	"path/win32",
+	"perf_hooks",
+	"process",
+	"punycode",
+	"querystring",
+	"readline",
+	"repl",
+	"stream",
+	"stream/promises",
+	"stream/web",
+	"string_decoder",
+	"sys",
+	"timers",
+	"timers/promises",
+	"tls",
+	"trace_events",
+	"tty",
+	"url",
+	"util",
+	"util/types",
+	"v8",
+	"vm",
+	"wasi",
+	"worker_threads",
+	"zlib",
+	/^node:/,
+
+	// cspell:word pnpapi
+	// Yarn PnP adds pnpapi as "builtin"
+	"pnpapi"
+];
+
+class NodeTargetPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		new ExternalsPlugin("node-commonjs", builtins).apply(compiler);
+	}
+}
+
+module.exports = NodeTargetPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeTemplatePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeTemplatePlugin.js
new file mode 100644
index 0000000..cbe8c99
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeTemplatePlugin.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const CommonJsChunkFormatPlugin = require("../javascript/CommonJsChunkFormatPlugin");
+const EnableChunkLoadingPlugin = require("../javascript/EnableChunkLoadingPlugin");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class NodeTemplatePlugin {
+	constructor(options) {
+		this._options = options || {};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const chunkLoading = this._options.asyncChunkLoading
+			? "async-node"
+			: "require";
+		compiler.options.output.chunkLoading = chunkLoading;
+		new CommonJsChunkFormatPlugin().apply(compiler);
+		new EnableChunkLoadingPlugin(chunkLoading).apply(compiler);
+	}
+}
+
+module.exports = NodeTemplatePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeWatchFileSystem.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeWatchFileSystem.js
new file mode 100644
index 0000000..0cf5e82
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/NodeWatchFileSystem.js
@@ -0,0 +1,194 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const Watchpack = require("watchpack");
+
+/** @typedef {import("../../declarations/WebpackOptions").WatchOptions} WatchOptions */
+/** @typedef {import("../FileSystemInfo").FileSystemInfoEntry} FileSystemInfoEntry */
+/** @typedef {import("../util/fs").WatchFileSystem} WatchFileSystem */
+/** @typedef {import("../util/fs").WatchMethod} WatchMethod */
+/** @typedef {import("../util/fs").Watcher} Watcher */
+
+class NodeWatchFileSystem {
+	constructor(inputFileSystem) {
+		this.inputFileSystem = inputFileSystem;
+		this.watcherOptions = {
+			aggregateTimeout: 0
+		};
+		this.watcher = new Watchpack(this.watcherOptions);
+	}
+
+	/**
+	 * @param {Iterable<string>} files watched files
+	 * @param {Iterable<string>} directories watched directories
+	 * @param {Iterable<string>} missing watched exitance entries
+	 * @param {number} startTime timestamp of start time
+	 * @param {WatchOptions} options options object
+	 * @param {function(Error=, Map<string, FileSystemInfoEntry>, Map<string, FileSystemInfoEntry>, Set<string>, Set<string>): void} callback aggregated callback
+	 * @param {function(string, number): void} callbackUndelayed callback when the first change was detected
+	 * @returns {Watcher} a watcher
+	 */
+	watch(
+		files,
+		directories,
+		missing,
+		startTime,
+		options,
+		callback,
+		callbackUndelayed
+	) {
+		if (!files || typeof files[Symbol.iterator] !== "function") {
+			throw new Error("Invalid arguments: 'files'");
+		}
+		if (!directories || typeof directories[Symbol.iterator] !== "function") {
+			throw new Error("Invalid arguments: 'directories'");
+		}
+		if (!missing || typeof missing[Symbol.iterator] !== "function") {
+			throw new Error("Invalid arguments: 'missing'");
+		}
+		if (typeof callback !== "function") {
+			throw new Error("Invalid arguments: 'callback'");
+		}
+		if (typeof startTime !== "number" && startTime) {
+			throw new Error("Invalid arguments: 'startTime'");
+		}
+		if (typeof options !== "object") {
+			throw new Error("Invalid arguments: 'options'");
+		}
+		if (typeof callbackUndelayed !== "function" && callbackUndelayed) {
+			throw new Error("Invalid arguments: 'callbackUndelayed'");
+		}
+		const oldWatcher = this.watcher;
+		this.watcher = new Watchpack(options);
+
+		if (callbackUndelayed) {
+			this.watcher.once("change", callbackUndelayed);
+		}
+
+		const fetchTimeInfo = () => {
+			const fileTimeInfoEntries = new Map();
+			const contextTimeInfoEntries = new Map();
+			if (this.watcher) {
+				this.watcher.collectTimeInfoEntries(
+					fileTimeInfoEntries,
+					contextTimeInfoEntries
+				);
+			}
+			return { fileTimeInfoEntries, contextTimeInfoEntries };
+		};
+		this.watcher.once("aggregated", (changes, removals) => {
+			// pause emitting events (avoids clearing aggregated changes and removals on timeout)
+			this.watcher.pause();
+
+			if (this.inputFileSystem && this.inputFileSystem.purge) {
+				const fs = this.inputFileSystem;
+				for (const item of changes) {
+					fs.purge(item);
+				}
+				for (const item of removals) {
+					fs.purge(item);
+				}
+			}
+			const { fileTimeInfoEntries, contextTimeInfoEntries } = fetchTimeInfo();
+			callback(
+				null,
+				fileTimeInfoEntries,
+				contextTimeInfoEntries,
+				changes,
+				removals
+			);
+		});
+
+		this.watcher.watch({ files, directories, missing, startTime });
+
+		if (oldWatcher) {
+			oldWatcher.close();
+		}
+		return {
+			close: () => {
+				if (this.watcher) {
+					this.watcher.close();
+					this.watcher = null;
+				}
+			},
+			pause: () => {
+				if (this.watcher) {
+					this.watcher.pause();
+				}
+			},
+			getAggregatedRemovals: util.deprecate(
+				() => {
+					const items = this.watcher && this.watcher.aggregatedRemovals;
+					if (items && this.inputFileSystem && this.inputFileSystem.purge) {
+						const fs = this.inputFileSystem;
+						for (const item of items) {
+							fs.purge(item);
+						}
+					}
+					return items;
+				},
+				"Watcher.getAggregatedRemovals is deprecated in favor of Watcher.getInfo since that's more performant.",
+				"DEP_WEBPACK_WATCHER_GET_AGGREGATED_REMOVALS"
+			),
+			getAggregatedChanges: util.deprecate(
+				() => {
+					const items = this.watcher && this.watcher.aggregatedChanges;
+					if (items && this.inputFileSystem && this.inputFileSystem.purge) {
+						const fs = this.inputFileSystem;
+						for (const item of items) {
+							fs.purge(item);
+						}
+					}
+					return items;
+				},
+				"Watcher.getAggregatedChanges is deprecated in favor of Watcher.getInfo since that's more performant.",
+				"DEP_WEBPACK_WATCHER_GET_AGGREGATED_CHANGES"
+			),
+			getFileTimeInfoEntries: util.deprecate(
+				() => {
+					return fetchTimeInfo().fileTimeInfoEntries;
+				},
+				"Watcher.getFileTimeInfoEntries is deprecated in favor of Watcher.getInfo since that's more performant.",
+				"DEP_WEBPACK_WATCHER_FILE_TIME_INFO_ENTRIES"
+			),
+			getContextTimeInfoEntries: util.deprecate(
+				() => {
+					return fetchTimeInfo().contextTimeInfoEntries;
+				},
+				"Watcher.getContextTimeInfoEntries is deprecated in favor of Watcher.getInfo since that's more performant.",
+				"DEP_WEBPACK_WATCHER_CONTEXT_TIME_INFO_ENTRIES"
+			),
+			getInfo: () => {
+				const removals = this.watcher && this.watcher.aggregatedRemovals;
+				const changes = this.watcher && this.watcher.aggregatedChanges;
+				if (this.inputFileSystem && this.inputFileSystem.purge) {
+					const fs = this.inputFileSystem;
+					if (removals) {
+						for (const item of removals) {
+							fs.purge(item);
+						}
+					}
+					if (changes) {
+						for (const item of changes) {
+							fs.purge(item);
+						}
+					}
+				}
+				const { fileTimeInfoEntries, contextTimeInfoEntries } = fetchTimeInfo();
+				return {
+					changes,
+					removals,
+					fileTimeInfoEntries,
+					contextTimeInfoEntries
+				};
+			}
+		};
+	}
+}
+
+module.exports = NodeWatchFileSystem;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileChunkLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileChunkLoadingRuntimeModule.js
new file mode 100644
index 0000000..68e292f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileChunkLoadingRuntimeModule.js
@@ -0,0 +1,291 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const {
+	chunkHasJs,
+	getChunkFilenameTemplate
+} = require("../javascript/JavascriptModulesPlugin");
+const { getInitialChunkIds } = require("../javascript/StartupHelpers");
+const compileBooleanMatcher = require("../util/compileBooleanMatcher");
+const { getUndoPath } = require("../util/identifier");
+
+/** @typedef {import("../Chunk")} Chunk */
+
+class ReadFileChunkLoadingRuntimeModule extends RuntimeModule {
+	constructor(runtimeRequirements) {
+		super("readFile chunk loading", RuntimeModule.STAGE_ATTACH);
+		this.runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @private
+	 * @param {Chunk} chunk chunk
+	 * @param {string} rootOutputDir root output directory
+	 * @returns {string} generated code
+	 */
+	_generateBaseUri(chunk, rootOutputDir) {
+		const options = chunk.getEntryOptions();
+		if (options && options.baseUri) {
+			return `${RuntimeGlobals.baseURI} = ${JSON.stringify(options.baseUri)};`;
+		}
+
+		return `${RuntimeGlobals.baseURI} = require("url").pathToFileURL(${
+			rootOutputDir
+				? `__dirname + ${JSON.stringify("/" + rootOutputDir)}`
+				: "__filename"
+		});`;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkGraph, chunk } = this;
+		const { runtimeTemplate } = this.compilation;
+		const fn = RuntimeGlobals.ensureChunkHandlers;
+		const withBaseURI = this.runtimeRequirements.has(RuntimeGlobals.baseURI);
+		const withExternalInstallChunk = this.runtimeRequirements.has(
+			RuntimeGlobals.externalInstallChunk
+		);
+		const withOnChunkLoad = this.runtimeRequirements.has(
+			RuntimeGlobals.onChunksLoaded
+		);
+		const withLoading = this.runtimeRequirements.has(
+			RuntimeGlobals.ensureChunkHandlers
+		);
+		const withHmr = this.runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadUpdateHandlers
+		);
+		const withHmrManifest = this.runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadManifest
+		);
+		const conditionMap = chunkGraph.getChunkConditionMap(chunk, chunkHasJs);
+		const hasJsMatcher = compileBooleanMatcher(conditionMap);
+		const initialChunkIds = getInitialChunkIds(chunk, chunkGraph, chunkHasJs);
+
+		const outputName = this.compilation.getPath(
+			getChunkFilenameTemplate(chunk, this.compilation.outputOptions),
+			{
+				chunk,
+				contentHashType: "javascript"
+			}
+		);
+		const rootOutputDir = getUndoPath(
+			outputName,
+			this.compilation.outputOptions.path,
+			false
+		);
+
+		const stateExpression = withHmr
+			? `${RuntimeGlobals.hmrRuntimeStatePrefix}_readFileVm`
+			: undefined;
+
+		return Template.asString([
+			withBaseURI
+				? this._generateBaseUri(chunk, rootOutputDir)
+				: "// no baseURI",
+			"",
+			"// object to store loaded chunks",
+			'// "0" means "already loaded", Promise means loading',
+			`var installedChunks = ${
+				stateExpression ? `${stateExpression} = ${stateExpression} || ` : ""
+			}{`,
+			Template.indent(
+				Array.from(initialChunkIds, id => `${JSON.stringify(id)}: 0`).join(
+					",\n"
+				)
+			),
+			"};",
+			"",
+			withOnChunkLoad
+				? `${
+						RuntimeGlobals.onChunksLoaded
+				  }.readFileVm = ${runtimeTemplate.returningFunction(
+						"installedChunks[chunkId] === 0",
+						"chunkId"
+				  )};`
+				: "// no on chunks loaded",
+			"",
+			withLoading || withExternalInstallChunk
+				? `var installChunk = ${runtimeTemplate.basicFunction("chunk", [
+						"var moreModules = chunk.modules, chunkIds = chunk.ids, runtime = chunk.runtime;",
+						"for(var moduleId in moreModules) {",
+						Template.indent([
+							`if(${RuntimeGlobals.hasOwnProperty}(moreModules, moduleId)) {`,
+							Template.indent([
+								`${RuntimeGlobals.moduleFactories}[moduleId] = moreModules[moduleId];`
+							]),
+							"}"
+						]),
+						"}",
+						`if(runtime) runtime(__webpack_require__);`,
+						"for(var i = 0; i < chunkIds.length; i++) {",
+						Template.indent([
+							"if(installedChunks[chunkIds[i]]) {",
+							Template.indent(["installedChunks[chunkIds[i]][0]();"]),
+							"}",
+							"installedChunks[chunkIds[i]] = 0;"
+						]),
+						"}",
+						withOnChunkLoad ? `${RuntimeGlobals.onChunksLoaded}();` : ""
+				  ])};`
+				: "// no chunk install function needed",
+			"",
+			withLoading
+				? Template.asString([
+						"// ReadFile + VM.run chunk loading for javascript",
+						`${fn}.readFileVm = function(chunkId, promises) {`,
+						hasJsMatcher !== false
+							? Template.indent([
+									"",
+									"var installedChunkData = installedChunks[chunkId];",
+									'if(installedChunkData !== 0) { // 0 means "already installed".',
+									Template.indent([
+										'// array of [resolve, reject, promise] means "currently loading"',
+										"if(installedChunkData) {",
+										Template.indent(["promises.push(installedChunkData[2]);"]),
+										"} else {",
+										Template.indent([
+											hasJsMatcher === true
+												? "if(true) { // all chunks have JS"
+												: `if(${hasJsMatcher("chunkId")}) {`,
+											Template.indent([
+												"// load the chunk and return promise to it",
+												"var promise = new Promise(function(resolve, reject) {",
+												Template.indent([
+													"installedChunkData = installedChunks[chunkId] = [resolve, reject];",
+													`var filename = require('path').join(__dirname, ${JSON.stringify(
+														rootOutputDir
+													)} + ${
+														RuntimeGlobals.getChunkScriptFilename
+													}(chunkId));`,
+													"require('fs').readFile(filename, 'utf-8', function(err, content) {",
+													Template.indent([
+														"if(err) return reject(err);",
+														"var chunk = {};",
+														"require('vm').runInThisContext('(function(exports, require, __dirname, __filename) {' + content + '\\n})', filename)" +
+															"(chunk, require, require('path').dirname(filename), filename);",
+														"installChunk(chunk);"
+													]),
+													"});"
+												]),
+												"});",
+												"promises.push(installedChunkData[2] = promise);"
+											]),
+											"} else installedChunks[chunkId] = 0;"
+										]),
+										"}"
+									]),
+									"}"
+							  ])
+							: Template.indent(["installedChunks[chunkId] = 0;"]),
+						"};"
+				  ])
+				: "// no chunk loading",
+			"",
+			withExternalInstallChunk
+				? Template.asString([
+						"module.exports = __webpack_require__;",
+						`${RuntimeGlobals.externalInstallChunk} = installChunk;`
+				  ])
+				: "// no external install chunk",
+			"",
+			withHmr
+				? Template.asString([
+						"function loadUpdateChunk(chunkId, updatedModulesList) {",
+						Template.indent([
+							"return new Promise(function(resolve, reject) {",
+							Template.indent([
+								`var filename = require('path').join(__dirname, ${JSON.stringify(
+									rootOutputDir
+								)} + ${RuntimeGlobals.getChunkUpdateScriptFilename}(chunkId));`,
+								"require('fs').readFile(filename, 'utf-8', function(err, content) {",
+								Template.indent([
+									"if(err) return reject(err);",
+									"var update = {};",
+									"require('vm').runInThisContext('(function(exports, require, __dirname, __filename) {' + content + '\\n})', filename)" +
+										"(update, require, require('path').dirname(filename), filename);",
+									"var updatedModules = update.modules;",
+									"var runtime = update.runtime;",
+									"for(var moduleId in updatedModules) {",
+									Template.indent([
+										`if(${RuntimeGlobals.hasOwnProperty}(updatedModules, moduleId)) {`,
+										Template.indent([
+											`currentUpdate[moduleId] = updatedModules[moduleId];`,
+											"if(updatedModulesList) updatedModulesList.push(moduleId);"
+										]),
+										"}"
+									]),
+									"}",
+									"if(runtime) currentUpdateRuntime.push(runtime);",
+									"resolve();"
+								]),
+								"});"
+							]),
+							"});"
+						]),
+						"}",
+						"",
+						Template.getFunctionContent(
+							require("../hmr/JavascriptHotModuleReplacement.runtime.js")
+						)
+							.replace(/\$key\$/g, "readFileVm")
+							.replace(/\$installedChunks\$/g, "installedChunks")
+							.replace(/\$loadUpdateChunk\$/g, "loadUpdateChunk")
+							.replace(/\$moduleCache\$/g, RuntimeGlobals.moduleCache)
+							.replace(/\$moduleFactories\$/g, RuntimeGlobals.moduleFactories)
+							.replace(
+								/\$ensureChunkHandlers\$/g,
+								RuntimeGlobals.ensureChunkHandlers
+							)
+							.replace(/\$hasOwnProperty\$/g, RuntimeGlobals.hasOwnProperty)
+							.replace(/\$hmrModuleData\$/g, RuntimeGlobals.hmrModuleData)
+							.replace(
+								/\$hmrDownloadUpdateHandlers\$/g,
+								RuntimeGlobals.hmrDownloadUpdateHandlers
+							)
+							.replace(
+								/\$hmrInvalidateModuleHandlers\$/g,
+								RuntimeGlobals.hmrInvalidateModuleHandlers
+							)
+				  ])
+				: "// no HMR",
+			"",
+			withHmrManifest
+				? Template.asString([
+						`${RuntimeGlobals.hmrDownloadManifest} = function() {`,
+						Template.indent([
+							"return new Promise(function(resolve, reject) {",
+							Template.indent([
+								`var filename = require('path').join(__dirname, ${JSON.stringify(
+									rootOutputDir
+								)} + ${RuntimeGlobals.getUpdateManifestFilename}());`,
+								"require('fs').readFile(filename, 'utf-8', function(err, content) {",
+								Template.indent([
+									"if(err) {",
+									Template.indent([
+										'if(err.code === "ENOENT") return resolve();',
+										"return reject(err);"
+									]),
+									"}",
+									"try { resolve(JSON.parse(content)); }",
+									"catch(e) { reject(e); }"
+								]),
+								"});"
+							]),
+							"});"
+						]),
+						"}"
+				  ])
+				: "// no HMR manifest"
+		]);
+	}
+}
+
+module.exports = ReadFileChunkLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileCompileAsyncWasmPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileCompileAsyncWasmPlugin.js
new file mode 100644
index 0000000..1d0bdb7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileCompileAsyncWasmPlugin.js
@@ -0,0 +1,107 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const AsyncWasmLoadingRuntimeModule = require("../wasm-async/AsyncWasmLoadingRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ReadFileCompileAsyncWasmPlugin {
+	constructor({ type = "async-node", import: useImport = false } = {}) {
+		this._type = type;
+		this._import = useImport;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"ReadFileCompileAsyncWasmPlugin",
+			compilation => {
+				const globalWasmLoading = compilation.outputOptions.wasmLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const wasmLoading =
+						options && options.wasmLoading !== undefined
+							? options.wasmLoading
+							: globalWasmLoading;
+					return wasmLoading === this._type;
+				};
+				const generateLoadBinaryCode = this._import
+					? path =>
+							Template.asString([
+								"Promise.all([import('fs'), import('url')]).then(([{ readFile }, { URL }]) => new Promise((resolve, reject) => {",
+								Template.indent([
+									`readFile(new URL(${path}, import.meta.url), (err, buffer) => {`,
+									Template.indent([
+										"if (err) return reject(err);",
+										"",
+										"// Fake fetch response",
+										"resolve({",
+										Template.indent(["arrayBuffer() { return buffer; }"]),
+										"});"
+									]),
+									"});"
+								]),
+								"}))"
+							])
+					: path =>
+							Template.asString([
+								"new Promise(function (resolve, reject) {",
+								Template.indent([
+									"try {",
+									Template.indent([
+										"var { readFile } = require('fs');",
+										"var { join } = require('path');",
+										"",
+										`readFile(join(__dirname, ${path}), function(err, buffer){`,
+										Template.indent([
+											"if (err) return reject(err);",
+											"",
+											"// Fake fetch response",
+											"resolve({",
+											Template.indent(["arrayBuffer() { return buffer; }"]),
+											"});"
+										]),
+										"});"
+									]),
+									"} catch (err) { reject(err); }"
+								]),
+								"})"
+							]);
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.instantiateWasm)
+					.tap("ReadFileCompileAsyncWasmPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						const chunkGraph = compilation.chunkGraph;
+						if (
+							!chunkGraph.hasModuleInGraph(
+								chunk,
+								m => m.type === "webassembly/async"
+							)
+						) {
+							return;
+						}
+						set.add(RuntimeGlobals.publicPath);
+						compilation.addRuntimeModule(
+							chunk,
+							new AsyncWasmLoadingRuntimeModule({
+								generateLoadBinaryCode,
+								supportsStreaming: false
+							})
+						);
+					});
+			}
+		);
+	}
+}
+
+module.exports = ReadFileCompileAsyncWasmPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileCompileWasmPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileCompileWasmPlugin.js
new file mode 100644
index 0000000..dd801b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/ReadFileCompileWasmPlugin.js
@@ -0,0 +1,93 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const WasmChunkLoadingRuntimeModule = require("../wasm-sync/WasmChunkLoadingRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+// TODO webpack 6 remove
+
+class ReadFileCompileWasmPlugin {
+	constructor(options) {
+		this.options = options || {};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"ReadFileCompileWasmPlugin",
+			compilation => {
+				const globalWasmLoading = compilation.outputOptions.wasmLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const wasmLoading =
+						options && options.wasmLoading !== undefined
+							? options.wasmLoading
+							: globalWasmLoading;
+					return wasmLoading === "async-node";
+				};
+				const generateLoadBinaryCode = path =>
+					Template.asString([
+						"new Promise(function (resolve, reject) {",
+						Template.indent([
+							"var { readFile } = require('fs');",
+							"var { join } = require('path');",
+							"",
+							"try {",
+							Template.indent([
+								`readFile(join(__dirname, ${path}), function(err, buffer){`,
+								Template.indent([
+									"if (err) return reject(err);",
+									"",
+									"// Fake fetch response",
+									"resolve({",
+									Template.indent(["arrayBuffer() { return buffer; }"]),
+									"});"
+								]),
+								"});"
+							]),
+							"} catch (err) { reject(err); }"
+						]),
+						"})"
+					]);
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("ReadFileCompileWasmPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						const chunkGraph = compilation.chunkGraph;
+						if (
+							!chunkGraph.hasModuleInGraph(
+								chunk,
+								m => m.type === "webassembly/sync"
+							)
+						) {
+							return;
+						}
+						set.add(RuntimeGlobals.moduleCache);
+						compilation.addRuntimeModule(
+							chunk,
+							new WasmChunkLoadingRuntimeModule({
+								generateLoadBinaryCode,
+								supportsStreaming: false,
+								mangleImports: this.options.mangleImports,
+								runtimeRequirements: set
+							})
+						);
+					});
+			}
+		);
+	}
+}
+
+module.exports = ReadFileCompileWasmPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/RequireChunkLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/RequireChunkLoadingRuntimeModule.js
new file mode 100644
index 0000000..8b46fbc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/RequireChunkLoadingRuntimeModule.js
@@ -0,0 +1,238 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const {
+	chunkHasJs,
+	getChunkFilenameTemplate
+} = require("../javascript/JavascriptModulesPlugin");
+const { getInitialChunkIds } = require("../javascript/StartupHelpers");
+const compileBooleanMatcher = require("../util/compileBooleanMatcher");
+const { getUndoPath } = require("../util/identifier");
+
+/** @typedef {import("../Chunk")} Chunk */
+
+class RequireChunkLoadingRuntimeModule extends RuntimeModule {
+	constructor(runtimeRequirements) {
+		super("require chunk loading", RuntimeModule.STAGE_ATTACH);
+		this.runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @private
+	 * @param {Chunk} chunk chunk
+	 * @param {string} rootOutputDir root output directory
+	 * @returns {string} generated code
+	 */
+	_generateBaseUri(chunk, rootOutputDir) {
+		const options = chunk.getEntryOptions();
+		if (options && options.baseUri) {
+			return `${RuntimeGlobals.baseURI} = ${JSON.stringify(options.baseUri)};`;
+		}
+
+		return `${RuntimeGlobals.baseURI} = require("url").pathToFileURL(${
+			rootOutputDir !== "./"
+				? `__dirname + ${JSON.stringify("/" + rootOutputDir)}`
+				: "__filename"
+		});`;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkGraph, chunk } = this;
+		const { runtimeTemplate } = this.compilation;
+		const fn = RuntimeGlobals.ensureChunkHandlers;
+		const withBaseURI = this.runtimeRequirements.has(RuntimeGlobals.baseURI);
+		const withExternalInstallChunk = this.runtimeRequirements.has(
+			RuntimeGlobals.externalInstallChunk
+		);
+		const withOnChunkLoad = this.runtimeRequirements.has(
+			RuntimeGlobals.onChunksLoaded
+		);
+		const withLoading = this.runtimeRequirements.has(
+			RuntimeGlobals.ensureChunkHandlers
+		);
+		const withHmr = this.runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadUpdateHandlers
+		);
+		const withHmrManifest = this.runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadManifest
+		);
+		const conditionMap = chunkGraph.getChunkConditionMap(chunk, chunkHasJs);
+		const hasJsMatcher = compileBooleanMatcher(conditionMap);
+		const initialChunkIds = getInitialChunkIds(chunk, chunkGraph, chunkHasJs);
+
+		const outputName = this.compilation.getPath(
+			getChunkFilenameTemplate(chunk, this.compilation.outputOptions),
+			{
+				chunk,
+				contentHashType: "javascript"
+			}
+		);
+		const rootOutputDir = getUndoPath(
+			outputName,
+			this.compilation.outputOptions.path,
+			true
+		);
+
+		const stateExpression = withHmr
+			? `${RuntimeGlobals.hmrRuntimeStatePrefix}_require`
+			: undefined;
+
+		return Template.asString([
+			withBaseURI
+				? this._generateBaseUri(chunk, rootOutputDir)
+				: "// no baseURI",
+			"",
+			"// object to store loaded chunks",
+			'// "1" means "loaded", otherwise not loaded yet',
+			`var installedChunks = ${
+				stateExpression ? `${stateExpression} = ${stateExpression} || ` : ""
+			}{`,
+			Template.indent(
+				Array.from(initialChunkIds, id => `${JSON.stringify(id)}: 1`).join(
+					",\n"
+				)
+			),
+			"};",
+			"",
+			withOnChunkLoad
+				? `${
+						RuntimeGlobals.onChunksLoaded
+				  }.require = ${runtimeTemplate.returningFunction(
+						"installedChunks[chunkId]",
+						"chunkId"
+				  )};`
+				: "// no on chunks loaded",
+			"",
+			withLoading || withExternalInstallChunk
+				? `var installChunk = ${runtimeTemplate.basicFunction("chunk", [
+						"var moreModules = chunk.modules, chunkIds = chunk.ids, runtime = chunk.runtime;",
+						"for(var moduleId in moreModules) {",
+						Template.indent([
+							`if(${RuntimeGlobals.hasOwnProperty}(moreModules, moduleId)) {`,
+							Template.indent([
+								`${RuntimeGlobals.moduleFactories}[moduleId] = moreModules[moduleId];`
+							]),
+							"}"
+						]),
+						"}",
+						`if(runtime) runtime(__webpack_require__);`,
+						"for(var i = 0; i < chunkIds.length; i++)",
+						Template.indent("installedChunks[chunkIds[i]] = 1;"),
+						withOnChunkLoad ? `${RuntimeGlobals.onChunksLoaded}();` : ""
+				  ])};`
+				: "// no chunk install function needed",
+			"",
+			withLoading
+				? Template.asString([
+						"// require() chunk loading for javascript",
+						`${fn}.require = ${runtimeTemplate.basicFunction(
+							"chunkId, promises",
+							hasJsMatcher !== false
+								? [
+										'// "1" is the signal for "already loaded"',
+										"if(!installedChunks[chunkId]) {",
+										Template.indent([
+											hasJsMatcher === true
+												? "if(true) { // all chunks have JS"
+												: `if(${hasJsMatcher("chunkId")}) {`,
+											Template.indent([
+												`installChunk(require(${JSON.stringify(
+													rootOutputDir
+												)} + ${
+													RuntimeGlobals.getChunkScriptFilename
+												}(chunkId)));`
+											]),
+											"} else installedChunks[chunkId] = 1;",
+											""
+										]),
+										"}"
+								  ]
+								: "installedChunks[chunkId] = 1;"
+						)};`
+				  ])
+				: "// no chunk loading",
+			"",
+			withExternalInstallChunk
+				? Template.asString([
+						"module.exports = __webpack_require__;",
+						`${RuntimeGlobals.externalInstallChunk} = installChunk;`
+				  ])
+				: "// no external install chunk",
+			"",
+			withHmr
+				? Template.asString([
+						"function loadUpdateChunk(chunkId, updatedModulesList) {",
+						Template.indent([
+							`var update = require(${JSON.stringify(rootOutputDir)} + ${
+								RuntimeGlobals.getChunkUpdateScriptFilename
+							}(chunkId));`,
+							"var updatedModules = update.modules;",
+							"var runtime = update.runtime;",
+							"for(var moduleId in updatedModules) {",
+							Template.indent([
+								`if(${RuntimeGlobals.hasOwnProperty}(updatedModules, moduleId)) {`,
+								Template.indent([
+									`currentUpdate[moduleId] = updatedModules[moduleId];`,
+									"if(updatedModulesList) updatedModulesList.push(moduleId);"
+								]),
+								"}"
+							]),
+							"}",
+							"if(runtime) currentUpdateRuntime.push(runtime);"
+						]),
+						"}",
+						"",
+						Template.getFunctionContent(
+							require("../hmr/JavascriptHotModuleReplacement.runtime.js")
+						)
+							.replace(/\$key\$/g, "require")
+							.replace(/\$installedChunks\$/g, "installedChunks")
+							.replace(/\$loadUpdateChunk\$/g, "loadUpdateChunk")
+							.replace(/\$moduleCache\$/g, RuntimeGlobals.moduleCache)
+							.replace(/\$moduleFactories\$/g, RuntimeGlobals.moduleFactories)
+							.replace(
+								/\$ensureChunkHandlers\$/g,
+								RuntimeGlobals.ensureChunkHandlers
+							)
+							.replace(/\$hasOwnProperty\$/g, RuntimeGlobals.hasOwnProperty)
+							.replace(/\$hmrModuleData\$/g, RuntimeGlobals.hmrModuleData)
+							.replace(
+								/\$hmrDownloadUpdateHandlers\$/g,
+								RuntimeGlobals.hmrDownloadUpdateHandlers
+							)
+							.replace(
+								/\$hmrInvalidateModuleHandlers\$/g,
+								RuntimeGlobals.hmrInvalidateModuleHandlers
+							)
+				  ])
+				: "// no HMR",
+			"",
+			withHmrManifest
+				? Template.asString([
+						`${RuntimeGlobals.hmrDownloadManifest} = function() {`,
+						Template.indent([
+							"return Promise.resolve().then(function() {",
+							Template.indent([
+								`return require(${JSON.stringify(rootOutputDir)} + ${
+									RuntimeGlobals.getUpdateManifestFilename
+								}());`
+							]),
+							"})['catch'](function(err) { if(err.code !== 'MODULE_NOT_FOUND') throw err; });"
+						]),
+						"}"
+				  ])
+				: "// no HMR manifest"
+		]);
+	}
+}
+
+module.exports = RequireChunkLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/node/nodeConsole.js b/node_modules/mathjs/examples/node_modules/webpack/lib/node/nodeConsole.js
new file mode 100644
index 0000000..83b068b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/node/nodeConsole.js
@@ -0,0 +1,143 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const truncateArgs = require("../logging/truncateArgs");
+
+module.exports = ({ colors, appendOnly, stream }) => {
+	let currentStatusMessage = undefined;
+	let hasStatusMessage = false;
+	let currentIndent = "";
+	let currentCollapsed = 0;
+
+	const indent = (str, prefix, colorPrefix, colorSuffix) => {
+		if (str === "") return str;
+		prefix = currentIndent + prefix;
+		if (colors) {
+			return (
+				prefix +
+				colorPrefix +
+				str.replace(/\n/g, colorSuffix + "\n" + prefix + colorPrefix) +
+				colorSuffix
+			);
+		} else {
+			return prefix + str.replace(/\n/g, "\n" + prefix);
+		}
+	};
+
+	const clearStatusMessage = () => {
+		if (hasStatusMessage) {
+			stream.write("\x1b[2K\r");
+			hasStatusMessage = false;
+		}
+	};
+
+	const writeStatusMessage = () => {
+		if (!currentStatusMessage) return;
+		const l = stream.columns;
+		const args = l
+			? truncateArgs(currentStatusMessage, l - 1)
+			: currentStatusMessage;
+		const str = args.join(" ");
+		const coloredStr = `\u001b[1m${str}\u001b[39m\u001b[22m`;
+		stream.write(`\x1b[2K\r${coloredStr}`);
+		hasStatusMessage = true;
+	};
+
+	const writeColored = (prefix, colorPrefix, colorSuffix) => {
+		return (...args) => {
+			if (currentCollapsed > 0) return;
+			clearStatusMessage();
+			const str = indent(
+				util.format(...args),
+				prefix,
+				colorPrefix,
+				colorSuffix
+			);
+			stream.write(str + "\n");
+			writeStatusMessage();
+		};
+	};
+
+	const writeGroupMessage = writeColored(
+		"<-> ",
+		"\u001b[1m\u001b[36m",
+		"\u001b[39m\u001b[22m"
+	);
+
+	const writeGroupCollapsedMessage = writeColored(
+		"<+> ",
+		"\u001b[1m\u001b[36m",
+		"\u001b[39m\u001b[22m"
+	);
+
+	return {
+		log: writeColored("    ", "\u001b[1m", "\u001b[22m"),
+		debug: writeColored("    ", "", ""),
+		trace: writeColored("    ", "", ""),
+		info: writeColored("<i> ", "\u001b[1m\u001b[32m", "\u001b[39m\u001b[22m"),
+		warn: writeColored("<w> ", "\u001b[1m\u001b[33m", "\u001b[39m\u001b[22m"),
+		error: writeColored("<e> ", "\u001b[1m\u001b[31m", "\u001b[39m\u001b[22m"),
+		logTime: writeColored(
+			"<t> ",
+			"\u001b[1m\u001b[35m",
+			"\u001b[39m\u001b[22m"
+		),
+		group: (...args) => {
+			writeGroupMessage(...args);
+			if (currentCollapsed > 0) {
+				currentCollapsed++;
+			} else {
+				currentIndent += "  ";
+			}
+		},
+		groupCollapsed: (...args) => {
+			writeGroupCollapsedMessage(...args);
+			currentCollapsed++;
+		},
+		groupEnd: () => {
+			if (currentCollapsed > 0) currentCollapsed--;
+			else if (currentIndent.length >= 2)
+				currentIndent = currentIndent.slice(0, currentIndent.length - 2);
+		},
+		// eslint-disable-next-line node/no-unsupported-features/node-builtins
+		profile: console.profile && (name => console.profile(name)),
+		// eslint-disable-next-line node/no-unsupported-features/node-builtins
+		profileEnd: console.profileEnd && (name => console.profileEnd(name)),
+		clear:
+			!appendOnly &&
+			// eslint-disable-next-line node/no-unsupported-features/node-builtins
+			console.clear &&
+			(() => {
+				clearStatusMessage();
+				// eslint-disable-next-line node/no-unsupported-features/node-builtins
+				console.clear();
+				writeStatusMessage();
+			}),
+		status: appendOnly
+			? writeColored("<s> ", "", "")
+			: (name, ...args) => {
+					args = args.filter(Boolean);
+					if (name === undefined && args.length === 0) {
+						clearStatusMessage();
+						currentStatusMessage = undefined;
+					} else if (
+						typeof name === "string" &&
+						name.startsWith("[webpack.Progress] ")
+					) {
+						currentStatusMessage = [name.slice(19), ...args];
+						writeStatusMessage();
+					} else if (name === "[webpack.Progress]") {
+						currentStatusMessage = [...args];
+						writeStatusMessage();
+					} else {
+						currentStatusMessage = [name, ...args];
+						writeStatusMessage();
+					}
+			  }
+	};
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/AggressiveMergingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/AggressiveMergingPlugin.js
new file mode 100644
index 0000000..bc1b37b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/AggressiveMergingPlugin.js
@@ -0,0 +1,92 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_ADVANCED } = require("../OptimizationStages");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+
+class AggressiveMergingPlugin {
+	constructor(options) {
+		if (
+			(options !== undefined && typeof options !== "object") ||
+			Array.isArray(options)
+		) {
+			throw new Error(
+				"Argument should be an options object. To use defaults, pass in nothing.\nFor more info on options, see https://webpack.js.org/plugins/"
+			);
+		}
+		this.options = options || {};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		const minSizeReduce = options.minSizeReduce || 1.5;
+
+		compiler.hooks.thisCompilation.tap(
+			"AggressiveMergingPlugin",
+			compilation => {
+				compilation.hooks.optimizeChunks.tap(
+					{
+						name: "AggressiveMergingPlugin",
+						stage: STAGE_ADVANCED
+					},
+					chunks => {
+						const chunkGraph = compilation.chunkGraph;
+						/** @type {{a: Chunk, b: Chunk, improvement: number}[]} */
+						let combinations = [];
+						for (const a of chunks) {
+							if (a.canBeInitial()) continue;
+							for (const b of chunks) {
+								if (b.canBeInitial()) continue;
+								if (b === a) break;
+								if (!chunkGraph.canChunksBeIntegrated(a, b)) {
+									continue;
+								}
+								const aSize = chunkGraph.getChunkSize(b, {
+									chunkOverhead: 0
+								});
+								const bSize = chunkGraph.getChunkSize(a, {
+									chunkOverhead: 0
+								});
+								const abSize = chunkGraph.getIntegratedChunksSize(b, a, {
+									chunkOverhead: 0
+								});
+								const improvement = (aSize + bSize) / abSize;
+								combinations.push({
+									a,
+									b,
+									improvement
+								});
+							}
+						}
+
+						combinations.sort((a, b) => {
+							return b.improvement - a.improvement;
+						});
+
+						const pair = combinations[0];
+
+						if (!pair) return;
+						if (pair.improvement < minSizeReduce) return;
+
+						chunkGraph.integrateChunks(pair.b, pair.a);
+						compilation.chunks.delete(pair.a);
+						return true;
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = AggressiveMergingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/AggressiveSplittingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/AggressiveSplittingPlugin.js
new file mode 100644
index 0000000..c2476c8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/AggressiveSplittingPlugin.js
@@ -0,0 +1,329 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_ADVANCED } = require("../OptimizationStages");
+const { intersect } = require("../util/SetHelpers");
+const {
+	compareModulesByIdentifier,
+	compareChunks
+} = require("../util/comparators");
+const createSchemaValidation = require("../util/create-schema-validation");
+const identifierUtils = require("../util/identifier");
+
+/** @typedef {import("../../declarations/plugins/optimize/AggressiveSplittingPlugin").AggressiveSplittingPluginOptions} AggressiveSplittingPluginOptions */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/optimize/AggressiveSplittingPlugin.check.js"),
+	() =>
+		require("../../schemas/plugins/optimize/AggressiveSplittingPlugin.json"),
+	{
+		name: "Aggressive Splitting Plugin",
+		baseDataPath: "options"
+	}
+);
+
+const moveModuleBetween = (chunkGraph, oldChunk, newChunk) => {
+	return module => {
+		chunkGraph.disconnectChunkAndModule(oldChunk, module);
+		chunkGraph.connectChunkAndModule(newChunk, module);
+	};
+};
+
+/**
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {Chunk} chunk the chunk
+ * @returns {function(Module): boolean} filter for entry module
+ */
+const isNotAEntryModule = (chunkGraph, chunk) => {
+	return module => {
+		return !chunkGraph.isEntryModuleInChunk(module, chunk);
+	};
+};
+
+/** @type {WeakSet<Chunk>} */
+const recordedChunks = new WeakSet();
+
+class AggressiveSplittingPlugin {
+	/**
+	 * @param {AggressiveSplittingPluginOptions=} options options object
+	 */
+	constructor(options = {}) {
+		validate(options);
+
+		this.options = options;
+		if (typeof this.options.minSize !== "number") {
+			this.options.minSize = 30 * 1024;
+		}
+		if (typeof this.options.maxSize !== "number") {
+			this.options.maxSize = 50 * 1024;
+		}
+		if (typeof this.options.chunkOverhead !== "number") {
+			this.options.chunkOverhead = 0;
+		}
+		if (typeof this.options.entryChunkMultiplicator !== "number") {
+			this.options.entryChunkMultiplicator = 1;
+		}
+	}
+
+	/**
+	 * @param {Chunk} chunk the chunk to test
+	 * @returns {boolean} true if the chunk was recorded
+	 */
+	static wasChunkRecorded(chunk) {
+		return recordedChunks.has(chunk);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"AggressiveSplittingPlugin",
+			compilation => {
+				let needAdditionalSeal = false;
+				let newSplits;
+				let fromAggressiveSplittingSet;
+				let chunkSplitDataMap;
+				compilation.hooks.optimize.tap("AggressiveSplittingPlugin", () => {
+					newSplits = [];
+					fromAggressiveSplittingSet = new Set();
+					chunkSplitDataMap = new Map();
+				});
+				compilation.hooks.optimizeChunks.tap(
+					{
+						name: "AggressiveSplittingPlugin",
+						stage: STAGE_ADVANCED
+					},
+					chunks => {
+						const chunkGraph = compilation.chunkGraph;
+						// Precompute stuff
+						const nameToModuleMap = new Map();
+						const moduleToNameMap = new Map();
+						const makePathsRelative =
+							identifierUtils.makePathsRelative.bindContextCache(
+								compiler.context,
+								compiler.root
+							);
+						for (const m of compilation.modules) {
+							const name = makePathsRelative(m.identifier());
+							nameToModuleMap.set(name, m);
+							moduleToNameMap.set(m, name);
+						}
+
+						// Check used chunk ids
+						const usedIds = new Set();
+						for (const chunk of chunks) {
+							usedIds.add(chunk.id);
+						}
+
+						const recordedSplits =
+							(compilation.records && compilation.records.aggressiveSplits) ||
+							[];
+						const usedSplits = newSplits
+							? recordedSplits.concat(newSplits)
+							: recordedSplits;
+
+						const minSize = this.options.minSize;
+						const maxSize = this.options.maxSize;
+
+						const applySplit = splitData => {
+							// Cannot split if id is already taken
+							if (splitData.id !== undefined && usedIds.has(splitData.id)) {
+								return false;
+							}
+
+							// Get module objects from names
+							const selectedModules = splitData.modules.map(name =>
+								nameToModuleMap.get(name)
+							);
+
+							// Does the modules exist at all?
+							if (!selectedModules.every(Boolean)) return false;
+
+							// Check if size matches (faster than waiting for hash)
+							let size = 0;
+							for (const m of selectedModules) size += m.size();
+							if (size !== splitData.size) return false;
+
+							// get chunks with all modules
+							const selectedChunks = intersect(
+								selectedModules.map(
+									m => new Set(chunkGraph.getModuleChunksIterable(m))
+								)
+							);
+
+							// No relevant chunks found
+							if (selectedChunks.size === 0) return false;
+
+							// The found chunk is already the split or similar
+							if (
+								selectedChunks.size === 1 &&
+								chunkGraph.getNumberOfChunkModules(
+									Array.from(selectedChunks)[0]
+								) === selectedModules.length
+							) {
+								const chunk = Array.from(selectedChunks)[0];
+								if (fromAggressiveSplittingSet.has(chunk)) return false;
+								fromAggressiveSplittingSet.add(chunk);
+								chunkSplitDataMap.set(chunk, splitData);
+								return true;
+							}
+
+							// split the chunk into two parts
+							const newChunk = compilation.addChunk();
+							newChunk.chunkReason = "aggressive splitted";
+							for (const chunk of selectedChunks) {
+								selectedModules.forEach(
+									moveModuleBetween(chunkGraph, chunk, newChunk)
+								);
+								chunk.split(newChunk);
+								chunk.name = null;
+							}
+							fromAggressiveSplittingSet.add(newChunk);
+							chunkSplitDataMap.set(newChunk, splitData);
+
+							if (splitData.id !== null && splitData.id !== undefined) {
+								newChunk.id = splitData.id;
+								newChunk.ids = [splitData.id];
+							}
+							return true;
+						};
+
+						// try to restore to recorded splitting
+						let changed = false;
+						for (let j = 0; j < usedSplits.length; j++) {
+							const splitData = usedSplits[j];
+							if (applySplit(splitData)) changed = true;
+						}
+
+						// for any chunk which isn't splitted yet, split it and create a new entry
+						// start with the biggest chunk
+						const cmpFn = compareChunks(chunkGraph);
+						const sortedChunks = Array.from(chunks).sort((a, b) => {
+							const diff1 =
+								chunkGraph.getChunkModulesSize(b) -
+								chunkGraph.getChunkModulesSize(a);
+							if (diff1) return diff1;
+							const diff2 =
+								chunkGraph.getNumberOfChunkModules(a) -
+								chunkGraph.getNumberOfChunkModules(b);
+							if (diff2) return diff2;
+							return cmpFn(a, b);
+						});
+						for (const chunk of sortedChunks) {
+							if (fromAggressiveSplittingSet.has(chunk)) continue;
+							const size = chunkGraph.getChunkModulesSize(chunk);
+							if (
+								size > maxSize &&
+								chunkGraph.getNumberOfChunkModules(chunk) > 1
+							) {
+								const modules = chunkGraph
+									.getOrderedChunkModules(chunk, compareModulesByIdentifier)
+									.filter(isNotAEntryModule(chunkGraph, chunk));
+								const selectedModules = [];
+								let selectedModulesSize = 0;
+								for (let k = 0; k < modules.length; k++) {
+									const module = modules[k];
+									const newSize = selectedModulesSize + module.size();
+									if (newSize > maxSize && selectedModulesSize >= minSize) {
+										break;
+									}
+									selectedModulesSize = newSize;
+									selectedModules.push(module);
+								}
+								if (selectedModules.length === 0) continue;
+								const splitData = {
+									modules: selectedModules
+										.map(m => moduleToNameMap.get(m))
+										.sort(),
+									size: selectedModulesSize
+								};
+
+								if (applySplit(splitData)) {
+									newSplits = (newSplits || []).concat(splitData);
+									changed = true;
+								}
+							}
+						}
+						if (changed) return true;
+					}
+				);
+				compilation.hooks.recordHash.tap(
+					"AggressiveSplittingPlugin",
+					records => {
+						// 4. save made splittings to records
+						const allSplits = new Set();
+						const invalidSplits = new Set();
+
+						// Check if some splittings are invalid
+						// We remove invalid splittings and try again
+						for (const chunk of compilation.chunks) {
+							const splitData = chunkSplitDataMap.get(chunk);
+							if (splitData !== undefined) {
+								if (splitData.hash && chunk.hash !== splitData.hash) {
+									// Split was successful, but hash doesn't equal
+									// We can throw away the split since it's useless now
+									invalidSplits.add(splitData);
+								}
+							}
+						}
+
+						if (invalidSplits.size > 0) {
+							records.aggressiveSplits = records.aggressiveSplits.filter(
+								splitData => !invalidSplits.has(splitData)
+							);
+							needAdditionalSeal = true;
+						} else {
+							// set hash and id values on all (new) splittings
+							for (const chunk of compilation.chunks) {
+								const splitData = chunkSplitDataMap.get(chunk);
+								if (splitData !== undefined) {
+									splitData.hash = chunk.hash;
+									splitData.id = chunk.id;
+									allSplits.add(splitData);
+									// set flag for stats
+									recordedChunks.add(chunk);
+								}
+							}
+
+							// Also add all unused historical splits (after the used ones)
+							// They can still be used in some future compilation
+							const recordedSplits =
+								compilation.records && compilation.records.aggressiveSplits;
+							if (recordedSplits) {
+								for (const splitData of recordedSplits) {
+									if (!invalidSplits.has(splitData)) allSplits.add(splitData);
+								}
+							}
+
+							// record all splits
+							records.aggressiveSplits = Array.from(allSplits);
+
+							needAdditionalSeal = false;
+						}
+					}
+				);
+				compilation.hooks.needAdditionalSeal.tap(
+					"AggressiveSplittingPlugin",
+					() => {
+						if (needAdditionalSeal) {
+							needAdditionalSeal = false;
+							return true;
+						}
+					}
+				);
+			}
+		);
+	}
+}
+module.exports = AggressiveSplittingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/ConcatenatedModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/ConcatenatedModule.js
new file mode 100644
index 0000000..cfe6c1c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/ConcatenatedModule.js
@@ -0,0 +1,1879 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const eslintScope = require("eslint-scope");
+const Referencer = require("eslint-scope/lib/referencer");
+const {
+	CachedSource,
+	ConcatSource,
+	ReplaceSource
+} = require("webpack-sources");
+const ConcatenationScope = require("../ConcatenationScope");
+const { UsageState } = require("../ExportsInfo");
+const Module = require("../Module");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HarmonyImportDependency = require("../dependencies/HarmonyImportDependency");
+const JavascriptParser = require("../javascript/JavascriptParser");
+const { equals } = require("../util/ArrayHelpers");
+const LazySet = require("../util/LazySet");
+const { concatComparators, keepOriginalOrder } = require("../util/comparators");
+const createHash = require("../util/createHash");
+const { makePathsRelative } = require("../util/identifier");
+const makeSerializable = require("../util/makeSerializable");
+const propertyAccess = require("../util/propertyAccess");
+const {
+	filterRuntime,
+	intersectRuntime,
+	mergeRuntimeCondition,
+	mergeRuntimeConditionNonFalse,
+	runtimeConditionToString,
+	subtractRuntimeCondition
+} = require("../util/runtime");
+
+/** @typedef {import("eslint-scope").Scope} Scope */
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../DependencyTemplate").DependencyTemplateContext} DependencyTemplateContext */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../ExportsInfo").ExportInfo} ExportInfo */
+/** @template T @typedef {import("../InitFragment")<T>} InitFragment */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").ChunkRenderContext} ChunkRenderContext */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {typeof import("../util/Hash")} HashConstructor */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+// fix eslint-scope to support class properties correctly
+// cspell:word Referencer
+const ReferencerClass = Referencer;
+if (!ReferencerClass.prototype.PropertyDefinition) {
+	ReferencerClass.prototype.PropertyDefinition =
+		ReferencerClass.prototype.Property;
+}
+
+/**
+ * @typedef {Object} ReexportInfo
+ * @property {Module} module
+ * @property {string[]} export
+ */
+
+/** @typedef {RawBinding | SymbolBinding} Binding */
+
+/**
+ * @typedef {Object} RawBinding
+ * @property {ModuleInfo} info
+ * @property {string} rawName
+ * @property {string=} comment
+ * @property {string[]} ids
+ * @property {string[]} exportName
+ */
+
+/**
+ * @typedef {Object} SymbolBinding
+ * @property {ConcatenatedModuleInfo} info
+ * @property {string} name
+ * @property {string=} comment
+ * @property {string[]} ids
+ * @property {string[]} exportName
+ */
+
+/** @typedef {ConcatenatedModuleInfo | ExternalModuleInfo } ModuleInfo */
+/** @typedef {ConcatenatedModuleInfo | ExternalModuleInfo | ReferenceToModuleInfo } ModuleInfoOrReference */
+
+/**
+ * @typedef {Object} ConcatenatedModuleInfo
+ * @property {"concatenated"} type
+ * @property {Module} module
+ * @property {number} index
+ * @property {Object} ast
+ * @property {Source} internalSource
+ * @property {ReplaceSource} source
+ * @property {InitFragment<ChunkRenderContext>[]=} chunkInitFragments
+ * @property {Iterable<string>} runtimeRequirements
+ * @property {Scope} globalScope
+ * @property {Scope} moduleScope
+ * @property {Map<string, string>} internalNames
+ * @property {Map<string, string>} exportMap
+ * @property {Map<string, string>} rawExportMap
+ * @property {string=} namespaceExportSymbol
+ * @property {string} namespaceObjectName
+ * @property {boolean} interopNamespaceObjectUsed
+ * @property {string} interopNamespaceObjectName
+ * @property {boolean} interopNamespaceObject2Used
+ * @property {string} interopNamespaceObject2Name
+ * @property {boolean} interopDefaultAccessUsed
+ * @property {string} interopDefaultAccessName
+ */
+
+/**
+ * @typedef {Object} ExternalModuleInfo
+ * @property {"external"} type
+ * @property {Module} module
+ * @property {RuntimeSpec | boolean} runtimeCondition
+ * @property {number} index
+ * @property {string} name
+ * @property {boolean} interopNamespaceObjectUsed
+ * @property {string} interopNamespaceObjectName
+ * @property {boolean} interopNamespaceObject2Used
+ * @property {string} interopNamespaceObject2Name
+ * @property {boolean} interopDefaultAccessUsed
+ * @property {string} interopDefaultAccessName
+ */
+
+/**
+ * @typedef {Object} ReferenceToModuleInfo
+ * @property {"reference"} type
+ * @property {RuntimeSpec | boolean} runtimeCondition
+ * @property {ConcatenatedModuleInfo | ExternalModuleInfo} target
+ */
+
+const RESERVED_NAMES = new Set(
+	[
+		// internal names (should always be renamed)
+		ConcatenationScope.DEFAULT_EXPORT,
+		ConcatenationScope.NAMESPACE_OBJECT_EXPORT,
+
+		// keywords
+		"abstract,arguments,async,await,boolean,break,byte,case,catch,char,class,const,continue",
+		"debugger,default,delete,do,double,else,enum,eval,export,extends,false,final,finally,float",
+		"for,function,goto,if,implements,import,in,instanceof,int,interface,let,long,native,new,null",
+		"package,private,protected,public,return,short,static,super,switch,synchronized,this,throw",
+		"throws,transient,true,try,typeof,var,void,volatile,while,with,yield",
+
+		// commonjs/amd
+		"module,__dirname,__filename,exports,require,define",
+
+		// js globals
+		"Array,Date,eval,function,hasOwnProperty,Infinity,isFinite,isNaN,isPrototypeOf,length,Math",
+		"NaN,name,Number,Object,prototype,String,toString,undefined,valueOf",
+
+		// browser globals
+		"alert,all,anchor,anchors,area,assign,blur,button,checkbox,clearInterval,clearTimeout",
+		"clientInformation,close,closed,confirm,constructor,crypto,decodeURI,decodeURIComponent",
+		"defaultStatus,document,element,elements,embed,embeds,encodeURI,encodeURIComponent,escape",
+		"event,fileUpload,focus,form,forms,frame,innerHeight,innerWidth,layer,layers,link,location",
+		"mimeTypes,navigate,navigator,frames,frameRate,hidden,history,image,images,offscreenBuffering",
+		"open,opener,option,outerHeight,outerWidth,packages,pageXOffset,pageYOffset,parent,parseFloat",
+		"parseInt,password,pkcs11,plugin,prompt,propertyIsEnum,radio,reset,screenX,screenY,scroll",
+		"secure,select,self,setInterval,setTimeout,status,submit,taint,text,textarea,top,unescape",
+		"untaint,window",
+
+		// window events
+		"onblur,onclick,onerror,onfocus,onkeydown,onkeypress,onkeyup,onmouseover,onload,onmouseup,onmousedown,onsubmit"
+	]
+		.join(",")
+		.split(",")
+);
+
+const bySourceOrder = (a, b) => {
+	const aOrder = a.sourceOrder;
+	const bOrder = b.sourceOrder;
+	if (isNaN(aOrder)) {
+		if (!isNaN(bOrder)) {
+			return 1;
+		}
+	} else {
+		if (isNaN(bOrder)) {
+			return -1;
+		}
+		if (aOrder !== bOrder) {
+			return aOrder < bOrder ? -1 : 1;
+		}
+	}
+	return 0;
+};
+
+const joinIterableWithComma = iterable => {
+	// This is more performant than Array.from().join(", ")
+	// as it doesn't create an array
+	let str = "";
+	let first = true;
+	for (const item of iterable) {
+		if (first) {
+			first = false;
+		} else {
+			str += ", ";
+		}
+		str += item;
+	}
+	return str;
+};
+
+/**
+ * @typedef {Object} ConcatenationEntry
+ * @property {"concatenated" | "external"} type
+ * @property {Module} module
+ * @property {RuntimeSpec | boolean} runtimeCondition
+ */
+
+/**
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {ModuleInfo} info module info
+ * @param {string[]} exportName exportName
+ * @param {Map<Module, ModuleInfo>} moduleToInfoMap moduleToInfoMap
+ * @param {RuntimeSpec} runtime for which runtime
+ * @param {RequestShortener} requestShortener the request shortener
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @param {Set<ConcatenatedModuleInfo>} neededNamespaceObjects modules for which a namespace object should be generated
+ * @param {boolean} asCall asCall
+ * @param {boolean} strictHarmonyModule strictHarmonyModule
+ * @param {boolean | undefined} asiSafe asiSafe
+ * @param {Set<ExportInfo>} alreadyVisited alreadyVisited
+ * @returns {Binding} the final variable
+ */
+const getFinalBinding = (
+	moduleGraph,
+	info,
+	exportName,
+	moduleToInfoMap,
+	runtime,
+	requestShortener,
+	runtimeTemplate,
+	neededNamespaceObjects,
+	asCall,
+	strictHarmonyModule,
+	asiSafe,
+	alreadyVisited = new Set()
+) => {
+	const exportsType = info.module.getExportsType(
+		moduleGraph,
+		strictHarmonyModule
+	);
+	if (exportName.length === 0) {
+		switch (exportsType) {
+			case "default-only":
+				info.interopNamespaceObject2Used = true;
+				return {
+					info,
+					rawName: info.interopNamespaceObject2Name,
+					ids: exportName,
+					exportName
+				};
+			case "default-with-named":
+				info.interopNamespaceObjectUsed = true;
+				return {
+					info,
+					rawName: info.interopNamespaceObjectName,
+					ids: exportName,
+					exportName
+				};
+			case "namespace":
+			case "dynamic":
+				break;
+			default:
+				throw new Error(`Unexpected exportsType ${exportsType}`);
+		}
+	} else {
+		switch (exportsType) {
+			case "namespace":
+				break;
+			case "default-with-named":
+				switch (exportName[0]) {
+					case "default":
+						exportName = exportName.slice(1);
+						break;
+					case "__esModule":
+						return {
+							info,
+							rawName: "/* __esModule */true",
+							ids: exportName.slice(1),
+							exportName
+						};
+				}
+				break;
+			case "default-only": {
+				const exportId = exportName[0];
+				if (exportId === "__esModule") {
+					return {
+						info,
+						rawName: "/* __esModule */true",
+						ids: exportName.slice(1),
+						exportName
+					};
+				}
+				exportName = exportName.slice(1);
+				if (exportId !== "default") {
+					return {
+						info,
+						rawName:
+							"/* non-default import from default-exporting module */undefined",
+						ids: exportName,
+						exportName
+					};
+				}
+				break;
+			}
+			case "dynamic":
+				switch (exportName[0]) {
+					case "default": {
+						exportName = exportName.slice(1);
+						info.interopDefaultAccessUsed = true;
+						const defaultExport = asCall
+							? `${info.interopDefaultAccessName}()`
+							: asiSafe
+							? `(${info.interopDefaultAccessName}())`
+							: asiSafe === false
+							? `;(${info.interopDefaultAccessName}())`
+							: `${info.interopDefaultAccessName}.a`;
+						return {
+							info,
+							rawName: defaultExport,
+							ids: exportName,
+							exportName
+						};
+					}
+					case "__esModule":
+						return {
+							info,
+							rawName: "/* __esModule */true",
+							ids: exportName.slice(1),
+							exportName
+						};
+				}
+				break;
+			default:
+				throw new Error(`Unexpected exportsType ${exportsType}`);
+		}
+	}
+	if (exportName.length === 0) {
+		switch (info.type) {
+			case "concatenated":
+				neededNamespaceObjects.add(info);
+				return {
+					info,
+					rawName: info.namespaceObjectName,
+					ids: exportName,
+					exportName
+				};
+			case "external":
+				return { info, rawName: info.name, ids: exportName, exportName };
+		}
+	}
+	const exportsInfo = moduleGraph.getExportsInfo(info.module);
+	const exportInfo = exportsInfo.getExportInfo(exportName[0]);
+	if (alreadyVisited.has(exportInfo)) {
+		return {
+			info,
+			rawName: "/* circular reexport */ Object(function x() { x() }())",
+			ids: [],
+			exportName
+		};
+	}
+	alreadyVisited.add(exportInfo);
+	switch (info.type) {
+		case "concatenated": {
+			const exportId = exportName[0];
+			if (exportInfo.provided === false) {
+				// It's not provided, but it could be on the prototype
+				neededNamespaceObjects.add(info);
+				return {
+					info,
+					rawName: info.namespaceObjectName,
+					ids: exportName,
+					exportName
+				};
+			}
+			const directExport = info.exportMap && info.exportMap.get(exportId);
+			if (directExport) {
+				const usedName = /** @type {string[]} */ (
+					exportsInfo.getUsedName(exportName, runtime)
+				);
+				if (!usedName) {
+					return {
+						info,
+						rawName: "/* unused export */ undefined",
+						ids: exportName.slice(1),
+						exportName
+					};
+				}
+				return {
+					info,
+					name: directExport,
+					ids: usedName.slice(1),
+					exportName
+				};
+			}
+			const rawExport = info.rawExportMap && info.rawExportMap.get(exportId);
+			if (rawExport) {
+				return {
+					info,
+					rawName: rawExport,
+					ids: exportName.slice(1),
+					exportName
+				};
+			}
+			const reexport = exportInfo.findTarget(moduleGraph, module =>
+				moduleToInfoMap.has(module)
+			);
+			if (reexport === false) {
+				throw new Error(
+					`Target module of reexport from '${info.module.readableIdentifier(
+						requestShortener
+					)}' is not part of the concatenation (export '${exportId}')\nModules in the concatenation:\n${Array.from(
+						moduleToInfoMap,
+						([m, info]) =>
+							` * ${info.type} ${m.readableIdentifier(requestShortener)}`
+					).join("\n")}`
+				);
+			}
+			if (reexport) {
+				const refInfo = moduleToInfoMap.get(reexport.module);
+				return getFinalBinding(
+					moduleGraph,
+					refInfo,
+					reexport.export
+						? [...reexport.export, ...exportName.slice(1)]
+						: exportName.slice(1),
+					moduleToInfoMap,
+					runtime,
+					requestShortener,
+					runtimeTemplate,
+					neededNamespaceObjects,
+					asCall,
+					info.module.buildMeta.strictHarmonyModule,
+					asiSafe,
+					alreadyVisited
+				);
+			}
+			if (info.namespaceExportSymbol) {
+				const usedName = /** @type {string[]} */ (
+					exportsInfo.getUsedName(exportName, runtime)
+				);
+				return {
+					info,
+					rawName: info.namespaceObjectName,
+					ids: usedName,
+					exportName
+				};
+			}
+			throw new Error(
+				`Cannot get final name for export '${exportName.join(
+					"."
+				)}' of ${info.module.readableIdentifier(requestShortener)}`
+			);
+		}
+
+		case "external": {
+			const used = /** @type {string[]} */ (
+				exportsInfo.getUsedName(exportName, runtime)
+			);
+			if (!used) {
+				return {
+					info,
+					rawName: "/* unused export */ undefined",
+					ids: exportName.slice(1),
+					exportName
+				};
+			}
+			const comment = equals(used, exportName)
+				? ""
+				: Template.toNormalComment(`${exportName.join(".")}`);
+			return { info, rawName: info.name + comment, ids: used, exportName };
+		}
+	}
+};
+
+/**
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {ModuleInfo} info module info
+ * @param {string[]} exportName exportName
+ * @param {Map<Module, ModuleInfo>} moduleToInfoMap moduleToInfoMap
+ * @param {RuntimeSpec} runtime for which runtime
+ * @param {RequestShortener} requestShortener the request shortener
+ * @param {RuntimeTemplate} runtimeTemplate the runtime template
+ * @param {Set<ConcatenatedModuleInfo>} neededNamespaceObjects modules for which a namespace object should be generated
+ * @param {boolean} asCall asCall
+ * @param {boolean} callContext callContext
+ * @param {boolean} strictHarmonyModule strictHarmonyModule
+ * @param {boolean | undefined} asiSafe asiSafe
+ * @returns {string} the final name
+ */
+const getFinalName = (
+	moduleGraph,
+	info,
+	exportName,
+	moduleToInfoMap,
+	runtime,
+	requestShortener,
+	runtimeTemplate,
+	neededNamespaceObjects,
+	asCall,
+	callContext,
+	strictHarmonyModule,
+	asiSafe
+) => {
+	const binding = getFinalBinding(
+		moduleGraph,
+		info,
+		exportName,
+		moduleToInfoMap,
+		runtime,
+		requestShortener,
+		runtimeTemplate,
+		neededNamespaceObjects,
+		asCall,
+		strictHarmonyModule,
+		asiSafe
+	);
+	{
+		const { ids, comment } = binding;
+		let reference;
+		let isPropertyAccess;
+		if ("rawName" in binding) {
+			reference = `${binding.rawName}${comment || ""}${propertyAccess(ids)}`;
+			isPropertyAccess = ids.length > 0;
+		} else {
+			const { info, name: exportId } = binding;
+			const name = info.internalNames.get(exportId);
+			if (!name) {
+				throw new Error(
+					`The export "${exportId}" in "${info.module.readableIdentifier(
+						requestShortener
+					)}" has no internal name (existing names: ${
+						Array.from(
+							info.internalNames,
+							([name, symbol]) => `${name}: ${symbol}`
+						).join(", ") || "none"
+					})`
+				);
+			}
+			reference = `${name}${comment || ""}${propertyAccess(ids)}`;
+			isPropertyAccess = ids.length > 1;
+		}
+		if (isPropertyAccess && asCall && callContext === false) {
+			return asiSafe
+				? `(0,${reference})`
+				: asiSafe === false
+				? `;(0,${reference})`
+				: `/*#__PURE__*/Object(${reference})`;
+		}
+		return reference;
+	}
+};
+
+const addScopeSymbols = (s, nameSet, scopeSet1, scopeSet2) => {
+	let scope = s;
+	while (scope) {
+		if (scopeSet1.has(scope)) break;
+		if (scopeSet2.has(scope)) break;
+		scopeSet1.add(scope);
+		for (const variable of scope.variables) {
+			nameSet.add(variable.name);
+		}
+		scope = scope.upper;
+	}
+};
+
+const getAllReferences = variable => {
+	let set = variable.references;
+	// Look for inner scope variables too (like in class Foo { t() { Foo } })
+	const identifiers = new Set(variable.identifiers);
+	for (const scope of variable.scope.childScopes) {
+		for (const innerVar of scope.variables) {
+			if (innerVar.identifiers.some(id => identifiers.has(id))) {
+				set = set.concat(innerVar.references);
+				break;
+			}
+		}
+	}
+	return set;
+};
+
+const getPathInAst = (ast, node) => {
+	if (ast === node) {
+		return [];
+	}
+
+	const nr = node.range;
+
+	const enterNode = n => {
+		if (!n) return undefined;
+		const r = n.range;
+		if (r) {
+			if (r[0] <= nr[0] && r[1] >= nr[1]) {
+				const path = getPathInAst(n, node);
+				if (path) {
+					path.push(n);
+					return path;
+				}
+			}
+		}
+		return undefined;
+	};
+
+	if (Array.isArray(ast)) {
+		for (let i = 0; i < ast.length; i++) {
+			const enterResult = enterNode(ast[i]);
+			if (enterResult !== undefined) return enterResult;
+		}
+	} else if (ast && typeof ast === "object") {
+		const keys = Object.keys(ast);
+		for (let i = 0; i < keys.length; i++) {
+			const value = ast[keys[i]];
+			if (Array.isArray(value)) {
+				const pathResult = getPathInAst(value, node);
+				if (pathResult !== undefined) return pathResult;
+			} else if (value && typeof value === "object") {
+				const enterResult = enterNode(value);
+				if (enterResult !== undefined) return enterResult;
+			}
+		}
+	}
+};
+
+const TYPES = new Set(["javascript"]);
+
+class ConcatenatedModule extends Module {
+	/**
+	 * @param {Module} rootModule the root module of the concatenation
+	 * @param {Set<Module>} modules all modules in the concatenation (including the root module)
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @param {Object=} associatedObjectForCache object for caching
+	 * @param {string | HashConstructor=} hashFunction hash function to use
+	 * @returns {ConcatenatedModule} the module
+	 */
+	static create(
+		rootModule,
+		modules,
+		runtime,
+		associatedObjectForCache,
+		hashFunction = "md4"
+	) {
+		const identifier = ConcatenatedModule._createIdentifier(
+			rootModule,
+			modules,
+			associatedObjectForCache,
+			hashFunction
+		);
+		return new ConcatenatedModule({
+			identifier,
+			rootModule,
+			modules,
+			runtime
+		});
+	}
+
+	/**
+	 * @param {Object} options options
+	 * @param {string} options.identifier the identifier of the module
+	 * @param {Module=} options.rootModule the root module of the concatenation
+	 * @param {RuntimeSpec} options.runtime the selected runtime
+	 * @param {Set<Module>=} options.modules all concatenated modules
+	 */
+	constructor({ identifier, rootModule, modules, runtime }) {
+		super("javascript/esm", null, rootModule && rootModule.layer);
+
+		// Info from Factory
+		/** @type {string} */
+		this._identifier = identifier;
+		/** @type {Module} */
+		this.rootModule = rootModule;
+		/** @type {Set<Module>} */
+		this._modules = modules;
+		this._runtime = runtime;
+		this.factoryMeta = rootModule && rootModule.factoryMeta;
+	}
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 * @param {Module} module fresh module
+	 * @returns {void}
+	 */
+	updateCacheModule(module) {
+		throw new Error("Must not be called");
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	get modules() {
+		return Array.from(this._modules);
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return this._identifier;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return (
+			this.rootModule.readableIdentifier(requestShortener) +
+			` + ${this._modules.size - 1} modules`
+		);
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return this.rootModule.libIdent(options);
+	}
+
+	/**
+	 * @returns {string | null} absolute path which should be used for condition matching (usually the resource path)
+	 */
+	nameForCondition() {
+		return this.rootModule.nameForCondition();
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConnectionState} how this module should be connected to referencing modules when consumed for side-effects only
+	 */
+	getSideEffectsConnectionState(moduleGraph) {
+		return this.rootModule.getSideEffectsConnectionState(moduleGraph);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		const { rootModule } = this;
+		this.buildInfo = {
+			strict: true,
+			cacheable: true,
+			moduleArgument: rootModule.buildInfo.moduleArgument,
+			exportsArgument: rootModule.buildInfo.exportsArgument,
+			fileDependencies: new LazySet(),
+			contextDependencies: new LazySet(),
+			missingDependencies: new LazySet(),
+			topLevelDeclarations: new Set(),
+			assets: undefined
+		};
+		this.buildMeta = rootModule.buildMeta;
+		this.clearDependenciesAndBlocks();
+		this.clearWarningsAndErrors();
+
+		for (const m of this._modules) {
+			// populate cacheable
+			if (!m.buildInfo.cacheable) {
+				this.buildInfo.cacheable = false;
+			}
+
+			// populate dependencies
+			for (const d of m.dependencies.filter(
+				dep =>
+					!(dep instanceof HarmonyImportDependency) ||
+					!this._modules.has(compilation.moduleGraph.getModule(dep))
+			)) {
+				this.dependencies.push(d);
+			}
+			// populate blocks
+			for (const d of m.blocks) {
+				this.blocks.push(d);
+			}
+
+			// populate warnings
+			const warnings = m.getWarnings();
+			if (warnings !== undefined) {
+				for (const warning of warnings) {
+					this.addWarning(warning);
+				}
+			}
+
+			// populate errors
+			const errors = m.getErrors();
+			if (errors !== undefined) {
+				for (const error of errors) {
+					this.addError(error);
+				}
+			}
+
+			// populate topLevelDeclarations
+			if (m.buildInfo.topLevelDeclarations) {
+				const topLevelDeclarations = this.buildInfo.topLevelDeclarations;
+				if (topLevelDeclarations !== undefined) {
+					for (const decl of m.buildInfo.topLevelDeclarations) {
+						topLevelDeclarations.add(decl);
+					}
+				}
+			} else {
+				this.buildInfo.topLevelDeclarations = undefined;
+			}
+
+			// populate assets
+			if (m.buildInfo.assets) {
+				if (this.buildInfo.assets === undefined) {
+					this.buildInfo.assets = Object.create(null);
+				}
+				Object.assign(this.buildInfo.assets, m.buildInfo.assets);
+			}
+			if (m.buildInfo.assetsInfo) {
+				if (this.buildInfo.assetsInfo === undefined) {
+					this.buildInfo.assetsInfo = new Map();
+				}
+				for (const [key, value] of m.buildInfo.assetsInfo) {
+					this.buildInfo.assetsInfo.set(key, value);
+				}
+			}
+		}
+		callback();
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		// Guess size from embedded modules
+		let size = 0;
+		for (const module of this._modules) {
+			size += module.size(type);
+		}
+		return size;
+	}
+
+	/**
+	 * @private
+	 * @param {Module} rootModule the root of the concatenation
+	 * @param {Set<Module>} modulesSet a set of modules which should be concatenated
+	 * @param {RuntimeSpec} runtime for this runtime
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @returns {ConcatenationEntry[]} concatenation list
+	 */
+	_createConcatenationList(rootModule, modulesSet, runtime, moduleGraph) {
+		/** @type {ConcatenationEntry[]} */
+		const list = [];
+		/** @type {Map<Module, RuntimeSpec | true>} */
+		const existingEntries = new Map();
+
+		/**
+		 * @param {Module} module a module
+		 * @returns {Iterable<{ connection: ModuleGraphConnection, runtimeCondition: RuntimeSpec | true }>} imported modules in order
+		 */
+		const getConcatenatedImports = module => {
+			let connections = Array.from(moduleGraph.getOutgoingConnections(module));
+			if (module === rootModule) {
+				for (const c of moduleGraph.getOutgoingConnections(this))
+					connections.push(c);
+			}
+			const references = connections
+				.filter(connection => {
+					if (!(connection.dependency instanceof HarmonyImportDependency))
+						return false;
+					return (
+						connection &&
+						connection.resolvedOriginModule === module &&
+						connection.module &&
+						connection.isTargetActive(runtime)
+					);
+				})
+				.map(connection => ({
+					connection,
+					sourceOrder: /** @type {HarmonyImportDependency} */ (
+						connection.dependency
+					).sourceOrder
+				}));
+			references.sort(
+				concatComparators(bySourceOrder, keepOriginalOrder(references))
+			);
+			/** @type {Map<Module, { connection: ModuleGraphConnection, runtimeCondition: RuntimeSpec | true }>} */
+			const referencesMap = new Map();
+			for (const { connection } of references) {
+				const runtimeCondition = filterRuntime(runtime, r =>
+					connection.isTargetActive(r)
+				);
+				if (runtimeCondition === false) continue;
+				const module = connection.module;
+				const entry = referencesMap.get(module);
+				if (entry === undefined) {
+					referencesMap.set(module, { connection, runtimeCondition });
+					continue;
+				}
+				entry.runtimeCondition = mergeRuntimeConditionNonFalse(
+					entry.runtimeCondition,
+					runtimeCondition,
+					runtime
+				);
+			}
+			return referencesMap.values();
+		};
+
+		/**
+		 * @param {ModuleGraphConnection} connection graph connection
+		 * @param {RuntimeSpec | true} runtimeCondition runtime condition
+		 * @returns {void}
+		 */
+		const enterModule = (connection, runtimeCondition) => {
+			const module = connection.module;
+			if (!module) return;
+			const existingEntry = existingEntries.get(module);
+			if (existingEntry === true) {
+				return;
+			}
+			if (modulesSet.has(module)) {
+				existingEntries.set(module, true);
+				if (runtimeCondition !== true) {
+					throw new Error(
+						`Cannot runtime-conditional concatenate a module (${module.identifier()} in ${this.rootModule.identifier()}, ${runtimeConditionToString(
+							runtimeCondition
+						)}). This should not happen.`
+					);
+				}
+				const imports = getConcatenatedImports(module);
+				for (const { connection, runtimeCondition } of imports)
+					enterModule(connection, runtimeCondition);
+				list.push({
+					type: "concatenated",
+					module: connection.module,
+					runtimeCondition
+				});
+			} else {
+				if (existingEntry !== undefined) {
+					const reducedRuntimeCondition = subtractRuntimeCondition(
+						runtimeCondition,
+						existingEntry,
+						runtime
+					);
+					if (reducedRuntimeCondition === false) return;
+					runtimeCondition = reducedRuntimeCondition;
+					existingEntries.set(
+						connection.module,
+						mergeRuntimeConditionNonFalse(
+							existingEntry,
+							runtimeCondition,
+							runtime
+						)
+					);
+				} else {
+					existingEntries.set(connection.module, runtimeCondition);
+				}
+				if (list.length > 0) {
+					const lastItem = list[list.length - 1];
+					if (
+						lastItem.type === "external" &&
+						lastItem.module === connection.module
+					) {
+						lastItem.runtimeCondition = mergeRuntimeCondition(
+							lastItem.runtimeCondition,
+							runtimeCondition,
+							runtime
+						);
+						return;
+					}
+				}
+				list.push({
+					type: "external",
+					get module() {
+						// We need to use a getter here, because the module in the dependency
+						// could be replaced by some other process (i. e. also replaced with a
+						// concatenated module)
+						return connection.module;
+					},
+					runtimeCondition
+				});
+			}
+		};
+
+		existingEntries.set(rootModule, true);
+		const imports = getConcatenatedImports(rootModule);
+		for (const { connection, runtimeCondition } of imports)
+			enterModule(connection, runtimeCondition);
+		list.push({
+			type: "concatenated",
+			module: rootModule,
+			runtimeCondition: true
+		});
+
+		return list;
+	}
+
+	/**
+	 * @param {Module} rootModule the root module of the concatenation
+	 * @param {Set<Module>} modules all modules in the concatenation (including the root module)
+	 * @param {Object=} associatedObjectForCache object for caching
+	 * @param {string | HashConstructor=} hashFunction hash function to use
+	 * @returns {string} the identifier
+	 */
+	static _createIdentifier(
+		rootModule,
+		modules,
+		associatedObjectForCache,
+		hashFunction = "md4"
+	) {
+		const cachedMakePathsRelative = makePathsRelative.bindContextCache(
+			rootModule.context,
+			associatedObjectForCache
+		);
+		let identifiers = [];
+		for (const module of modules) {
+			identifiers.push(cachedMakePathsRelative(module.identifier()));
+		}
+		identifiers.sort();
+		const hash = createHash(hashFunction);
+		hash.update(identifiers.join(" "));
+		return rootModule.identifier() + "|" + hash.digest("hex");
+	}
+
+	/**
+	 * @param {LazySet<string>} fileDependencies set where file dependencies are added to
+	 * @param {LazySet<string>} contextDependencies set where context dependencies are added to
+	 * @param {LazySet<string>} missingDependencies set where missing dependencies are added to
+	 * @param {LazySet<string>} buildDependencies set where build dependencies are added to
+	 */
+	addCacheDependencies(
+		fileDependencies,
+		contextDependencies,
+		missingDependencies,
+		buildDependencies
+	) {
+		for (const module of this._modules) {
+			module.addCacheDependencies(
+				fileDependencies,
+				contextDependencies,
+				missingDependencies,
+				buildDependencies
+			);
+		}
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({
+		dependencyTemplates,
+		runtimeTemplate,
+		moduleGraph,
+		chunkGraph,
+		runtime: generationRuntime,
+		codeGenerationResults
+	}) {
+		/** @type {Set<string>} */
+		const runtimeRequirements = new Set();
+		const runtime = intersectRuntime(generationRuntime, this._runtime);
+
+		const requestShortener = runtimeTemplate.requestShortener;
+		// Meta info for each module
+		const [modulesWithInfo, moduleToInfoMap] = this._getModulesWithInfo(
+			moduleGraph,
+			runtime
+		);
+
+		// Set with modules that need a generated namespace object
+		/** @type {Set<ConcatenatedModuleInfo>} */
+		const neededNamespaceObjects = new Set();
+
+		// Generate source code and analyse scopes
+		// Prepare a ReplaceSource for the final source
+		for (const info of moduleToInfoMap.values()) {
+			this._analyseModule(
+				moduleToInfoMap,
+				info,
+				dependencyTemplates,
+				runtimeTemplate,
+				moduleGraph,
+				chunkGraph,
+				runtime,
+				codeGenerationResults
+			);
+		}
+
+		// List of all used names to avoid conflicts
+		const allUsedNames = new Set(RESERVED_NAMES);
+		// Updated Top level declarations are created by renaming
+		const topLevelDeclarations = new Set();
+
+		// List of additional names in scope for module references
+		/** @type {Map<string, { usedNames: Set<string>, alreadyCheckedScopes: Set<TODO> }>} */
+		const usedNamesInScopeInfo = new Map();
+		/**
+		 * @param {string} module module identifier
+		 * @param {string} id export id
+		 * @returns {{ usedNames: Set<string>, alreadyCheckedScopes: Set<TODO> }} info
+		 */
+		const getUsedNamesInScopeInfo = (module, id) => {
+			const key = `${module}-${id}`;
+			let info = usedNamesInScopeInfo.get(key);
+			if (info === undefined) {
+				info = {
+					usedNames: new Set(),
+					alreadyCheckedScopes: new Set()
+				};
+				usedNamesInScopeInfo.set(key, info);
+			}
+			return info;
+		};
+
+		// Set of already checked scopes
+		const ignoredScopes = new Set();
+
+		// get all global names
+		for (const info of modulesWithInfo) {
+			if (info.type === "concatenated") {
+				// ignore symbols from moduleScope
+				if (info.moduleScope) {
+					ignoredScopes.add(info.moduleScope);
+				}
+
+				// The super class expression in class scopes behaves weird
+				// We get ranges of all super class expressions to make
+				// renaming to work correctly
+				const superClassCache = new WeakMap();
+				const getSuperClassExpressions = scope => {
+					const cacheEntry = superClassCache.get(scope);
+					if (cacheEntry !== undefined) return cacheEntry;
+					const superClassExpressions = [];
+					for (const childScope of scope.childScopes) {
+						if (childScope.type !== "class") continue;
+						const block = childScope.block;
+						if (
+							(block.type === "ClassDeclaration" ||
+								block.type === "ClassExpression") &&
+							block.superClass
+						) {
+							superClassExpressions.push({
+								range: block.superClass.range,
+								variables: childScope.variables
+							});
+						}
+					}
+					superClassCache.set(scope, superClassExpressions);
+					return superClassExpressions;
+				};
+
+				// add global symbols
+				if (info.globalScope) {
+					for (const reference of info.globalScope.through) {
+						const name = reference.identifier.name;
+						if (ConcatenationScope.isModuleReference(name)) {
+							const match = ConcatenationScope.matchModuleReference(name);
+							if (!match) continue;
+							const referencedInfo = modulesWithInfo[match.index];
+							if (referencedInfo.type === "reference")
+								throw new Error("Module reference can't point to a reference");
+							const binding = getFinalBinding(
+								moduleGraph,
+								referencedInfo,
+								match.ids,
+								moduleToInfoMap,
+								runtime,
+								requestShortener,
+								runtimeTemplate,
+								neededNamespaceObjects,
+								false,
+								info.module.buildMeta.strictHarmonyModule,
+								true
+							);
+							if (!binding.ids) continue;
+							const { usedNames, alreadyCheckedScopes } =
+								getUsedNamesInScopeInfo(
+									binding.info.module.identifier(),
+									"name" in binding ? binding.name : ""
+								);
+							for (const expr of getSuperClassExpressions(reference.from)) {
+								if (
+									expr.range[0] <= reference.identifier.range[0] &&
+									expr.range[1] >= reference.identifier.range[1]
+								) {
+									for (const variable of expr.variables) {
+										usedNames.add(variable.name);
+									}
+								}
+							}
+							addScopeSymbols(
+								reference.from,
+								usedNames,
+								alreadyCheckedScopes,
+								ignoredScopes
+							);
+						} else {
+							allUsedNames.add(name);
+						}
+					}
+				}
+			}
+		}
+
+		// generate names for symbols
+		for (const info of moduleToInfoMap.values()) {
+			const { usedNames: namespaceObjectUsedNames } = getUsedNamesInScopeInfo(
+				info.module.identifier(),
+				""
+			);
+			switch (info.type) {
+				case "concatenated": {
+					for (const variable of info.moduleScope.variables) {
+						const name = variable.name;
+						const { usedNames, alreadyCheckedScopes } = getUsedNamesInScopeInfo(
+							info.module.identifier(),
+							name
+						);
+						if (allUsedNames.has(name) || usedNames.has(name)) {
+							const references = getAllReferences(variable);
+							for (const ref of references) {
+								addScopeSymbols(
+									ref.from,
+									usedNames,
+									alreadyCheckedScopes,
+									ignoredScopes
+								);
+							}
+							const newName = this.findNewName(
+								name,
+								allUsedNames,
+								usedNames,
+								info.module.readableIdentifier(requestShortener)
+							);
+							allUsedNames.add(newName);
+							info.internalNames.set(name, newName);
+							topLevelDeclarations.add(newName);
+							const source = info.source;
+							const allIdentifiers = new Set(
+								references.map(r => r.identifier).concat(variable.identifiers)
+							);
+							for (const identifier of allIdentifiers) {
+								const r = identifier.range;
+								const path = getPathInAst(info.ast, identifier);
+								if (path && path.length > 1) {
+									const maybeProperty =
+										path[1].type === "AssignmentPattern" &&
+										path[1].left === path[0]
+											? path[2]
+											: path[1];
+									if (
+										maybeProperty.type === "Property" &&
+										maybeProperty.shorthand
+									) {
+										source.insert(r[1], `: ${newName}`);
+										continue;
+									}
+								}
+								source.replace(r[0], r[1] - 1, newName);
+							}
+						} else {
+							allUsedNames.add(name);
+							info.internalNames.set(name, name);
+							topLevelDeclarations.add(name);
+						}
+					}
+					let namespaceObjectName;
+					if (info.namespaceExportSymbol) {
+						namespaceObjectName = info.internalNames.get(
+							info.namespaceExportSymbol
+						);
+					} else {
+						namespaceObjectName = this.findNewName(
+							"namespaceObject",
+							allUsedNames,
+							namespaceObjectUsedNames,
+							info.module.readableIdentifier(requestShortener)
+						);
+						allUsedNames.add(namespaceObjectName);
+					}
+					info.namespaceObjectName = namespaceObjectName;
+					topLevelDeclarations.add(namespaceObjectName);
+					break;
+				}
+				case "external": {
+					const externalName = this.findNewName(
+						"",
+						allUsedNames,
+						namespaceObjectUsedNames,
+						info.module.readableIdentifier(requestShortener)
+					);
+					allUsedNames.add(externalName);
+					info.name = externalName;
+					topLevelDeclarations.add(externalName);
+					break;
+				}
+			}
+			if (info.module.buildMeta.exportsType !== "namespace") {
+				const externalNameInterop = this.findNewName(
+					"namespaceObject",
+					allUsedNames,
+					namespaceObjectUsedNames,
+					info.module.readableIdentifier(requestShortener)
+				);
+				allUsedNames.add(externalNameInterop);
+				info.interopNamespaceObjectName = externalNameInterop;
+				topLevelDeclarations.add(externalNameInterop);
+			}
+			if (
+				info.module.buildMeta.exportsType === "default" &&
+				info.module.buildMeta.defaultObject !== "redirect"
+			) {
+				const externalNameInterop = this.findNewName(
+					"namespaceObject2",
+					allUsedNames,
+					namespaceObjectUsedNames,
+					info.module.readableIdentifier(requestShortener)
+				);
+				allUsedNames.add(externalNameInterop);
+				info.interopNamespaceObject2Name = externalNameInterop;
+				topLevelDeclarations.add(externalNameInterop);
+			}
+			if (
+				info.module.buildMeta.exportsType === "dynamic" ||
+				!info.module.buildMeta.exportsType
+			) {
+				const externalNameInterop = this.findNewName(
+					"default",
+					allUsedNames,
+					namespaceObjectUsedNames,
+					info.module.readableIdentifier(requestShortener)
+				);
+				allUsedNames.add(externalNameInterop);
+				info.interopDefaultAccessName = externalNameInterop;
+				topLevelDeclarations.add(externalNameInterop);
+			}
+		}
+
+		// Find and replace references to modules
+		for (const info of moduleToInfoMap.values()) {
+			if (info.type === "concatenated") {
+				for (const reference of info.globalScope.through) {
+					const name = reference.identifier.name;
+					const match = ConcatenationScope.matchModuleReference(name);
+					if (match) {
+						const referencedInfo = modulesWithInfo[match.index];
+						if (referencedInfo.type === "reference")
+							throw new Error("Module reference can't point to a reference");
+						const finalName = getFinalName(
+							moduleGraph,
+							referencedInfo,
+							match.ids,
+							moduleToInfoMap,
+							runtime,
+							requestShortener,
+							runtimeTemplate,
+							neededNamespaceObjects,
+							match.call,
+							!match.directImport,
+							info.module.buildMeta.strictHarmonyModule,
+							match.asiSafe
+						);
+						const r = reference.identifier.range;
+						const source = info.source;
+						// range is extended by 2 chars to cover the appended "._"
+						source.replace(r[0], r[1] + 1, finalName);
+					}
+				}
+			}
+		}
+
+		// Map with all root exposed used exports
+		/** @type {Map<string, function(RequestShortener): string>} */
+		const exportsMap = new Map();
+
+		// Set with all root exposed unused exports
+		/** @type {Set<string>} */
+		const unusedExports = new Set();
+
+		const rootInfo = /** @type {ConcatenatedModuleInfo} */ (
+			moduleToInfoMap.get(this.rootModule)
+		);
+		const strictHarmonyModule = rootInfo.module.buildMeta.strictHarmonyModule;
+		const exportsInfo = moduleGraph.getExportsInfo(rootInfo.module);
+		for (const exportInfo of exportsInfo.orderedExports) {
+			const name = exportInfo.name;
+			if (exportInfo.provided === false) continue;
+			const used = exportInfo.getUsedName(undefined, runtime);
+			if (!used) {
+				unusedExports.add(name);
+				continue;
+			}
+			exportsMap.set(used, requestShortener => {
+				try {
+					const finalName = getFinalName(
+						moduleGraph,
+						rootInfo,
+						[name],
+						moduleToInfoMap,
+						runtime,
+						requestShortener,
+						runtimeTemplate,
+						neededNamespaceObjects,
+						false,
+						false,
+						strictHarmonyModule,
+						true
+					);
+					return `/* ${
+						exportInfo.isReexport() ? "reexport" : "binding"
+					} */ ${finalName}`;
+				} catch (e) {
+					e.message += `\nwhile generating the root export '${name}' (used name: '${used}')`;
+					throw e;
+				}
+			});
+		}
+
+		const result = new ConcatSource();
+
+		// add harmony compatibility flag (must be first because of possible circular dependencies)
+		if (
+			moduleGraph.getExportsInfo(this).otherExportsInfo.getUsed(runtime) !==
+			UsageState.Unused
+		) {
+			result.add(`// ESM COMPAT FLAG\n`);
+			result.add(
+				runtimeTemplate.defineEsModuleFlagStatement({
+					exportsArgument: this.exportsArgument,
+					runtimeRequirements
+				})
+			);
+		}
+
+		// define exports
+		if (exportsMap.size > 0) {
+			runtimeRequirements.add(RuntimeGlobals.exports);
+			runtimeRequirements.add(RuntimeGlobals.definePropertyGetters);
+			const definitions = [];
+			for (const [key, value] of exportsMap) {
+				definitions.push(
+					`\n  ${JSON.stringify(key)}: ${runtimeTemplate.returningFunction(
+						value(requestShortener)
+					)}`
+				);
+			}
+			result.add(`\n// EXPORTS\n`);
+			result.add(
+				`${RuntimeGlobals.definePropertyGetters}(${
+					this.exportsArgument
+				}, {${definitions.join(",")}\n});\n`
+			);
+		}
+
+		// list unused exports
+		if (unusedExports.size > 0) {
+			result.add(
+				`\n// UNUSED EXPORTS: ${joinIterableWithComma(unusedExports)}\n`
+			);
+		}
+
+		// generate namespace objects
+		const namespaceObjectSources = new Map();
+		for (const info of neededNamespaceObjects) {
+			if (info.namespaceExportSymbol) continue;
+			const nsObj = [];
+			const exportsInfo = moduleGraph.getExportsInfo(info.module);
+			for (const exportInfo of exportsInfo.orderedExports) {
+				if (exportInfo.provided === false) continue;
+				const usedName = exportInfo.getUsedName(undefined, runtime);
+				if (usedName) {
+					const finalName = getFinalName(
+						moduleGraph,
+						info,
+						[exportInfo.name],
+						moduleToInfoMap,
+						runtime,
+						requestShortener,
+						runtimeTemplate,
+						neededNamespaceObjects,
+						false,
+						undefined,
+						info.module.buildMeta.strictHarmonyModule,
+						true
+					);
+					nsObj.push(
+						`\n  ${JSON.stringify(
+							usedName
+						)}: ${runtimeTemplate.returningFunction(finalName)}`
+					);
+				}
+			}
+			const name = info.namespaceObjectName;
+			const defineGetters =
+				nsObj.length > 0
+					? `${RuntimeGlobals.definePropertyGetters}(${name}, {${nsObj.join(
+							","
+					  )}\n});\n`
+					: "";
+			if (nsObj.length > 0)
+				runtimeRequirements.add(RuntimeGlobals.definePropertyGetters);
+			namespaceObjectSources.set(
+				info,
+				`
+// NAMESPACE OBJECT: ${info.module.readableIdentifier(requestShortener)}
+var ${name} = {};
+${RuntimeGlobals.makeNamespaceObject}(${name});
+${defineGetters}`
+			);
+			runtimeRequirements.add(RuntimeGlobals.makeNamespaceObject);
+		}
+
+		// define required namespace objects (must be before evaluation modules)
+		for (const info of modulesWithInfo) {
+			if (info.type === "concatenated") {
+				const source = namespaceObjectSources.get(info);
+				if (!source) continue;
+				result.add(source);
+			}
+		}
+
+		const chunkInitFragments = [];
+
+		// evaluate modules in order
+		for (const rawInfo of modulesWithInfo) {
+			let name;
+			let isConditional = false;
+			const info = rawInfo.type === "reference" ? rawInfo.target : rawInfo;
+			switch (info.type) {
+				case "concatenated": {
+					result.add(
+						`\n;// CONCATENATED MODULE: ${info.module.readableIdentifier(
+							requestShortener
+						)}\n`
+					);
+					result.add(info.source);
+					if (info.chunkInitFragments) {
+						for (const f of info.chunkInitFragments) chunkInitFragments.push(f);
+					}
+					if (info.runtimeRequirements) {
+						for (const r of info.runtimeRequirements) {
+							runtimeRequirements.add(r);
+						}
+					}
+					name = info.namespaceObjectName;
+					break;
+				}
+				case "external": {
+					result.add(
+						`\n// EXTERNAL MODULE: ${info.module.readableIdentifier(
+							requestShortener
+						)}\n`
+					);
+					runtimeRequirements.add(RuntimeGlobals.require);
+					const { runtimeCondition } =
+						/** @type {ExternalModuleInfo | ReferenceToModuleInfo} */ (rawInfo);
+					const condition = runtimeTemplate.runtimeConditionExpression({
+						chunkGraph,
+						runtimeCondition,
+						runtime,
+						runtimeRequirements
+					});
+					if (condition !== "true") {
+						isConditional = true;
+						result.add(`if (${condition}) {\n`);
+					}
+					result.add(
+						`var ${info.name} = __webpack_require__(${JSON.stringify(
+							chunkGraph.getModuleId(info.module)
+						)});`
+					);
+					name = info.name;
+					break;
+				}
+				default:
+					// @ts-expect-error never is expected here
+					throw new Error(`Unsupported concatenation entry type ${info.type}`);
+			}
+			if (info.interopNamespaceObjectUsed) {
+				runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+				result.add(
+					`\nvar ${info.interopNamespaceObjectName} = /*#__PURE__*/${RuntimeGlobals.createFakeNamespaceObject}(${name}, 2);`
+				);
+			}
+			if (info.interopNamespaceObject2Used) {
+				runtimeRequirements.add(RuntimeGlobals.createFakeNamespaceObject);
+				result.add(
+					`\nvar ${info.interopNamespaceObject2Name} = /*#__PURE__*/${RuntimeGlobals.createFakeNamespaceObject}(${name});`
+				);
+			}
+			if (info.interopDefaultAccessUsed) {
+				runtimeRequirements.add(RuntimeGlobals.compatGetDefaultExport);
+				result.add(
+					`\nvar ${info.interopDefaultAccessName} = /*#__PURE__*/${RuntimeGlobals.compatGetDefaultExport}(${name});`
+				);
+			}
+			if (isConditional) {
+				result.add("\n}");
+			}
+		}
+
+		const data = new Map();
+		if (chunkInitFragments.length > 0)
+			data.set("chunkInitFragments", chunkInitFragments);
+		data.set("topLevelDeclarations", topLevelDeclarations);
+
+		/** @type {CodeGenerationResult} */
+		const resultEntry = {
+			sources: new Map([["javascript", new CachedSource(result)]]),
+			data,
+			runtimeRequirements
+		};
+
+		return resultEntry;
+	}
+
+	/**
+	 * @param {Map<Module, ModuleInfo>} modulesMap modulesMap
+	 * @param {ModuleInfo} info info
+	 * @param {DependencyTemplates} dependencyTemplates dependencyTemplates
+	 * @param {RuntimeTemplate} runtimeTemplate runtimeTemplate
+	 * @param {ModuleGraph} moduleGraph moduleGraph
+	 * @param {ChunkGraph} chunkGraph chunkGraph
+	 * @param {RuntimeSpec} runtime runtime
+	 * @param {CodeGenerationResults} codeGenerationResults codeGenerationResults
+	 */
+	_analyseModule(
+		modulesMap,
+		info,
+		dependencyTemplates,
+		runtimeTemplate,
+		moduleGraph,
+		chunkGraph,
+		runtime,
+		codeGenerationResults
+	) {
+		if (info.type === "concatenated") {
+			const m = info.module;
+			try {
+				// Create a concatenation scope to track and capture information
+				const concatenationScope = new ConcatenationScope(modulesMap, info);
+
+				// TODO cache codeGeneration results
+				const codeGenResult = m.codeGeneration({
+					dependencyTemplates,
+					runtimeTemplate,
+					moduleGraph,
+					chunkGraph,
+					runtime,
+					concatenationScope,
+					codeGenerationResults
+				});
+				const source = codeGenResult.sources.get("javascript");
+				const data = codeGenResult.data;
+				const chunkInitFragments = data && data.get("chunkInitFragments");
+				const code = source.source().toString();
+				let ast;
+				try {
+					ast = JavascriptParser._parse(code, {
+						sourceType: "module"
+					});
+				} catch (err) {
+					if (
+						err.loc &&
+						typeof err.loc === "object" &&
+						typeof err.loc.line === "number"
+					) {
+						const lineNumber = err.loc.line;
+						const lines = code.split("\n");
+						err.message +=
+							"\n| " +
+							lines
+								.slice(Math.max(0, lineNumber - 3), lineNumber + 2)
+								.join("\n| ");
+					}
+					throw err;
+				}
+				const scopeManager = eslintScope.analyze(ast, {
+					ecmaVersion: 6,
+					sourceType: "module",
+					optimistic: true,
+					ignoreEval: true,
+					impliedStrict: true
+				});
+				const globalScope = scopeManager.acquire(ast);
+				const moduleScope = globalScope.childScopes[0];
+				const resultSource = new ReplaceSource(source);
+				info.runtimeRequirements = codeGenResult.runtimeRequirements;
+				info.ast = ast;
+				info.internalSource = source;
+				info.source = resultSource;
+				info.chunkInitFragments = chunkInitFragments;
+				info.globalScope = globalScope;
+				info.moduleScope = moduleScope;
+			} catch (err) {
+				err.message += `\nwhile analyzing module ${m.identifier()} for concatenation`;
+				throw err;
+			}
+		}
+	}
+
+	/**
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {RuntimeSpec} runtime the runtime
+	 * @returns {[ModuleInfoOrReference[], Map<Module, ModuleInfo>]} module info items
+	 */
+	_getModulesWithInfo(moduleGraph, runtime) {
+		const orderedConcatenationList = this._createConcatenationList(
+			this.rootModule,
+			this._modules,
+			runtime,
+			moduleGraph
+		);
+		/** @type {Map<Module, ModuleInfo>} */
+		const map = new Map();
+		const list = orderedConcatenationList.map((info, index) => {
+			let item = map.get(info.module);
+			if (item === undefined) {
+				switch (info.type) {
+					case "concatenated":
+						item = {
+							type: "concatenated",
+							module: info.module,
+							index,
+							ast: undefined,
+							internalSource: undefined,
+							runtimeRequirements: undefined,
+							source: undefined,
+							globalScope: undefined,
+							moduleScope: undefined,
+							internalNames: new Map(),
+							exportMap: undefined,
+							rawExportMap: undefined,
+							namespaceExportSymbol: undefined,
+							namespaceObjectName: undefined,
+							interopNamespaceObjectUsed: false,
+							interopNamespaceObjectName: undefined,
+							interopNamespaceObject2Used: false,
+							interopNamespaceObject2Name: undefined,
+							interopDefaultAccessUsed: false,
+							interopDefaultAccessName: undefined
+						};
+						break;
+					case "external":
+						item = {
+							type: "external",
+							module: info.module,
+							runtimeCondition: info.runtimeCondition,
+							index,
+							name: undefined,
+							interopNamespaceObjectUsed: false,
+							interopNamespaceObjectName: undefined,
+							interopNamespaceObject2Used: false,
+							interopNamespaceObject2Name: undefined,
+							interopDefaultAccessUsed: false,
+							interopDefaultAccessName: undefined
+						};
+						break;
+					default:
+						throw new Error(
+							`Unsupported concatenation entry type ${info.type}`
+						);
+				}
+				map.set(item.module, item);
+				return item;
+			} else {
+				/** @type {ReferenceToModuleInfo} */
+				const ref = {
+					type: "reference",
+					runtimeCondition: info.runtimeCondition,
+					target: item
+				};
+				return ref;
+			}
+		});
+		return [list, map];
+	}
+
+	findNewName(oldName, usedNamed1, usedNamed2, extraInfo) {
+		let name = oldName;
+
+		if (name === ConcatenationScope.DEFAULT_EXPORT) {
+			name = "";
+		}
+		if (name === ConcatenationScope.NAMESPACE_OBJECT_EXPORT) {
+			name = "namespaceObject";
+		}
+
+		// Remove uncool stuff
+		extraInfo = extraInfo.replace(
+			/\.+\/|(\/index)?\.([a-zA-Z0-9]{1,4})($|\s|\?)|\s*\+\s*\d+\s*modules/g,
+			""
+		);
+
+		const splittedInfo = extraInfo.split("/");
+		while (splittedInfo.length) {
+			name = splittedInfo.pop() + (name ? "_" + name : "");
+			const nameIdent = Template.toIdentifier(name);
+			if (
+				!usedNamed1.has(nameIdent) &&
+				(!usedNamed2 || !usedNamed2.has(nameIdent))
+			)
+				return nameIdent;
+		}
+
+		let i = 0;
+		let nameWithNumber = Template.toIdentifier(`${name}_${i}`);
+		while (
+			usedNamed1.has(nameWithNumber) ||
+			(usedNamed2 && usedNamed2.has(nameWithNumber))
+		) {
+			i++;
+			nameWithNumber = Template.toIdentifier(`${name}_${i}`);
+		}
+		return nameWithNumber;
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		const { chunkGraph, runtime } = context;
+		for (const info of this._createConcatenationList(
+			this.rootModule,
+			this._modules,
+			intersectRuntime(runtime, this._runtime),
+			chunkGraph.moduleGraph
+		)) {
+			switch (info.type) {
+				case "concatenated":
+					info.module.updateHash(hash, context);
+					break;
+				case "external":
+					hash.update(`${chunkGraph.getModuleId(info.module)}`);
+					// TODO runtimeCondition
+					break;
+			}
+		}
+		super.updateHash(hash, context);
+	}
+
+	static deserialize(context) {
+		const obj = new ConcatenatedModule({
+			identifier: undefined,
+			rootModule: undefined,
+			modules: undefined,
+			runtime: undefined
+		});
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(ConcatenatedModule, "webpack/lib/optimize/ConcatenatedModule");
+
+module.exports = ConcatenatedModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/EnsureChunkConditionsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/EnsureChunkConditionsPlugin.js
new file mode 100644
index 0000000..aa31a06
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/EnsureChunkConditionsPlugin.js
@@ -0,0 +1,85 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_BASIC } = require("../OptimizationStages");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compiler")} Compiler */
+
+class EnsureChunkConditionsPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"EnsureChunkConditionsPlugin",
+			compilation => {
+				const handler = chunks => {
+					const chunkGraph = compilation.chunkGraph;
+					// These sets are hoisted here to save memory
+					// They are cleared at the end of every loop
+					/** @type {Set<Chunk>} */
+					const sourceChunks = new Set();
+					/** @type {Set<ChunkGroup>} */
+					const chunkGroups = new Set();
+					for (const module of compilation.modules) {
+						if (!module.hasChunkCondition()) continue;
+						for (const chunk of chunkGraph.getModuleChunksIterable(module)) {
+							if (!module.chunkCondition(chunk, compilation)) {
+								sourceChunks.add(chunk);
+								for (const group of chunk.groupsIterable) {
+									chunkGroups.add(group);
+								}
+							}
+						}
+						if (sourceChunks.size === 0) continue;
+						/** @type {Set<Chunk>} */
+						const targetChunks = new Set();
+						chunkGroupLoop: for (const chunkGroup of chunkGroups) {
+							// Can module be placed in a chunk of this group?
+							for (const chunk of chunkGroup.chunks) {
+								if (module.chunkCondition(chunk, compilation)) {
+									targetChunks.add(chunk);
+									continue chunkGroupLoop;
+								}
+							}
+							// We reached the entrypoint: fail
+							if (chunkGroup.isInitial()) {
+								throw new Error(
+									"Cannot fullfil chunk condition of " + module.identifier()
+								);
+							}
+							// Try placing in all parents
+							for (const group of chunkGroup.parentsIterable) {
+								chunkGroups.add(group);
+							}
+						}
+						for (const sourceChunk of sourceChunks) {
+							chunkGraph.disconnectChunkAndModule(sourceChunk, module);
+						}
+						for (const targetChunk of targetChunks) {
+							chunkGraph.connectChunkAndModule(targetChunk, module);
+						}
+						sourceChunks.clear();
+						chunkGroups.clear();
+					}
+				};
+				compilation.hooks.optimizeChunks.tap(
+					{
+						name: "EnsureChunkConditionsPlugin",
+						stage: STAGE_BASIC
+					},
+					handler
+				);
+			}
+		);
+	}
+}
+module.exports = EnsureChunkConditionsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/FlagIncludedChunksPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/FlagIncludedChunksPlugin.js
new file mode 100644
index 0000000..0453f76
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/FlagIncludedChunksPlugin.js
@@ -0,0 +1,118 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+
+class FlagIncludedChunksPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("FlagIncludedChunksPlugin", compilation => {
+			compilation.hooks.optimizeChunkIds.tap(
+				"FlagIncludedChunksPlugin",
+				chunks => {
+					const chunkGraph = compilation.chunkGraph;
+
+					// prepare two bit integers for each module
+					// 2^31 is the max number represented as SMI in v8
+					// we want the bits distributed this way:
+					// the bit 2^31 is pretty rar and only one module should get it
+					// so it has a probability of 1 / modulesCount
+					// the first bit (2^0) is the easiest and every module could get it
+					// if it doesn't get a better bit
+					// from bit 2^n to 2^(n+1) there is a probability of p
+					// so 1 / modulesCount == p^31
+					// <=> p = sqrt31(1 / modulesCount)
+					// so we use a modulo of 1 / sqrt31(1 / modulesCount)
+					/** @type {WeakMap<Module, number>} */
+					const moduleBits = new WeakMap();
+					const modulesCount = compilation.modules.size;
+
+					// precalculate the modulo values for each bit
+					const modulo = 1 / Math.pow(1 / modulesCount, 1 / 31);
+					const modulos = Array.from(
+						{ length: 31 },
+						(x, i) => Math.pow(modulo, i) | 0
+					);
+
+					// iterate all modules to generate bit values
+					let i = 0;
+					for (const module of compilation.modules) {
+						let bit = 30;
+						while (i % modulos[bit] !== 0) {
+							bit--;
+						}
+						moduleBits.set(module, 1 << bit);
+						i++;
+					}
+
+					// iterate all chunks to generate bitmaps
+					/** @type {WeakMap<Chunk, number>} */
+					const chunkModulesHash = new WeakMap();
+					for (const chunk of chunks) {
+						let hash = 0;
+						for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+							hash |= moduleBits.get(module);
+						}
+						chunkModulesHash.set(chunk, hash);
+					}
+
+					for (const chunkA of chunks) {
+						const chunkAHash = chunkModulesHash.get(chunkA);
+						const chunkAModulesCount =
+							chunkGraph.getNumberOfChunkModules(chunkA);
+						if (chunkAModulesCount === 0) continue;
+						let bestModule = undefined;
+						for (const module of chunkGraph.getChunkModulesIterable(chunkA)) {
+							if (
+								bestModule === undefined ||
+								chunkGraph.getNumberOfModuleChunks(bestModule) >
+									chunkGraph.getNumberOfModuleChunks(module)
+							)
+								bestModule = module;
+						}
+						loopB: for (const chunkB of chunkGraph.getModuleChunksIterable(
+							bestModule
+						)) {
+							// as we iterate the same iterables twice
+							// skip if we find ourselves
+							if (chunkA === chunkB) continue;
+
+							const chunkBModulesCount =
+								chunkGraph.getNumberOfChunkModules(chunkB);
+
+							// ids for empty chunks are not included
+							if (chunkBModulesCount === 0) continue;
+
+							// instead of swapping A and B just bail
+							// as we loop twice the current A will be B and B then A
+							if (chunkAModulesCount > chunkBModulesCount) continue;
+
+							// is chunkA in chunkB?
+
+							// we do a cheap check for the hash value
+							const chunkBHash = chunkModulesHash.get(chunkB);
+							if ((chunkBHash & chunkAHash) !== chunkAHash) continue;
+
+							// compare all modules
+							for (const m of chunkGraph.getChunkModulesIterable(chunkA)) {
+								if (!chunkGraph.isModuleInChunk(m, chunkB)) continue loopB;
+							}
+							chunkB.ids.push(chunkA.id);
+						}
+					}
+				}
+			);
+		});
+	}
+}
+module.exports = FlagIncludedChunksPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/InnerGraph.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/InnerGraph.js
new file mode 100644
index 0000000..8931bc3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/InnerGraph.js
@@ -0,0 +1,346 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const { UsageState } = require("../ExportsInfo");
+
+/** @typedef {import("estree").Node} AnyNode */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleGraphConnection").ConnectionState} ConnectionState */
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+/** @typedef {Map<TopLevelSymbol | null, Set<string | TopLevelSymbol> | true>} InnerGraph */
+/** @typedef {function(boolean | Set<string> | undefined): void} UsageCallback */
+
+/**
+ * @typedef {Object} StateObject
+ * @property {InnerGraph} innerGraph
+ * @property {TopLevelSymbol=} currentTopLevelSymbol
+ * @property {Map<TopLevelSymbol, Set<UsageCallback>>} usageCallbackMap
+ */
+
+/** @typedef {false|StateObject} State */
+
+/** @type {WeakMap<ParserState, State>} */
+const parserStateMap = new WeakMap();
+const topLevelSymbolTag = Symbol("top level symbol");
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {State} state
+ */
+function getState(parserState) {
+	return parserStateMap.get(parserState);
+}
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {void}
+ */
+exports.bailout = parserState => {
+	parserStateMap.set(parserState, false);
+};
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {void}
+ */
+exports.enable = parserState => {
+	const state = parserStateMap.get(parserState);
+	if (state === false) {
+		return;
+	}
+	parserStateMap.set(parserState, {
+		innerGraph: new Map(),
+		currentTopLevelSymbol: undefined,
+		usageCallbackMap: new Map()
+	});
+};
+
+/**
+ * @param {ParserState} parserState parser state
+ * @returns {boolean} true, when enabled
+ */
+exports.isEnabled = parserState => {
+	const state = parserStateMap.get(parserState);
+	return !!state;
+};
+
+/**
+ * @param {ParserState} state parser state
+ * @param {TopLevelSymbol | null} symbol the symbol, or null for all symbols
+ * @param {string | TopLevelSymbol | true} usage usage data
+ * @returns {void}
+ */
+exports.addUsage = (state, symbol, usage) => {
+	const innerGraphState = getState(state);
+
+	if (innerGraphState) {
+		const { innerGraph } = innerGraphState;
+		const info = innerGraph.get(symbol);
+		if (usage === true) {
+			innerGraph.set(symbol, true);
+		} else if (info === undefined) {
+			innerGraph.set(symbol, new Set([usage]));
+		} else if (info !== true) {
+			info.add(usage);
+		}
+	}
+};
+
+/**
+ * @param {JavascriptParser} parser the parser
+ * @param {string} name name of variable
+ * @param {string | TopLevelSymbol | true} usage usage data
+ * @returns {void}
+ */
+exports.addVariableUsage = (parser, name, usage) => {
+	const symbol =
+		/** @type {TopLevelSymbol} */ (
+			parser.getTagData(name, topLevelSymbolTag)
+		) || exports.tagTopLevelSymbol(parser, name);
+	if (symbol) {
+		exports.addUsage(parser.state, symbol, usage);
+	}
+};
+
+/**
+ * @param {ParserState} state parser state
+ * @returns {void}
+ */
+exports.inferDependencyUsage = state => {
+	const innerGraphState = getState(state);
+
+	if (!innerGraphState) {
+		return;
+	}
+
+	const { innerGraph, usageCallbackMap } = innerGraphState;
+	const processed = new Map();
+	// flatten graph to terminal nodes (string, undefined or true)
+	const nonTerminal = new Set(innerGraph.keys());
+	while (nonTerminal.size > 0) {
+		for (const key of nonTerminal) {
+			/** @type {Set<string|TopLevelSymbol> | true} */
+			let newSet = new Set();
+			let isTerminal = true;
+			const value = innerGraph.get(key);
+			let alreadyProcessed = processed.get(key);
+			if (alreadyProcessed === undefined) {
+				alreadyProcessed = new Set();
+				processed.set(key, alreadyProcessed);
+			}
+			if (value !== true && value !== undefined) {
+				for (const item of value) {
+					alreadyProcessed.add(item);
+				}
+				for (const item of value) {
+					if (typeof item === "string") {
+						newSet.add(item);
+					} else {
+						const itemValue = innerGraph.get(item);
+						if (itemValue === true) {
+							newSet = true;
+							break;
+						}
+						if (itemValue !== undefined) {
+							for (const i of itemValue) {
+								if (i === key) continue;
+								if (alreadyProcessed.has(i)) continue;
+								newSet.add(i);
+								if (typeof i !== "string") {
+									isTerminal = false;
+								}
+							}
+						}
+					}
+				}
+				if (newSet === true) {
+					innerGraph.set(key, true);
+				} else if (newSet.size === 0) {
+					innerGraph.set(key, undefined);
+				} else {
+					innerGraph.set(key, newSet);
+				}
+			}
+			if (isTerminal) {
+				nonTerminal.delete(key);
+
+				// For the global key, merge with all other keys
+				if (key === null) {
+					const globalValue = innerGraph.get(null);
+					if (globalValue) {
+						for (const [key, value] of innerGraph) {
+							if (key !== null && value !== true) {
+								if (globalValue === true) {
+									innerGraph.set(key, true);
+								} else {
+									const newSet = new Set(value);
+									for (const item of globalValue) {
+										newSet.add(item);
+									}
+									innerGraph.set(key, newSet);
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+
+	/** @type {Map<Dependency, true | Set<string>>} */
+	for (const [symbol, callbacks] of usageCallbackMap) {
+		const usage = /** @type {true | Set<string> | undefined} */ (
+			innerGraph.get(symbol)
+		);
+		for (const callback of callbacks) {
+			callback(usage === undefined ? false : usage);
+		}
+	}
+};
+
+/**
+ * @param {ParserState} state parser state
+ * @param {UsageCallback} onUsageCallback on usage callback
+ */
+exports.onUsage = (state, onUsageCallback) => {
+	const innerGraphState = getState(state);
+
+	if (innerGraphState) {
+		const { usageCallbackMap, currentTopLevelSymbol } = innerGraphState;
+		if (currentTopLevelSymbol) {
+			let callbacks = usageCallbackMap.get(currentTopLevelSymbol);
+
+			if (callbacks === undefined) {
+				callbacks = new Set();
+				usageCallbackMap.set(currentTopLevelSymbol, callbacks);
+			}
+
+			callbacks.add(onUsageCallback);
+		} else {
+			onUsageCallback(true);
+		}
+	} else {
+		onUsageCallback(undefined);
+	}
+};
+
+/**
+ * @param {ParserState} state parser state
+ * @param {TopLevelSymbol} symbol the symbol
+ */
+exports.setTopLevelSymbol = (state, symbol) => {
+	const innerGraphState = getState(state);
+
+	if (innerGraphState) {
+		innerGraphState.currentTopLevelSymbol = symbol;
+	}
+};
+
+/**
+ * @param {ParserState} state parser state
+ * @returns {TopLevelSymbol|void} usage data
+ */
+exports.getTopLevelSymbol = state => {
+	const innerGraphState = getState(state);
+
+	if (innerGraphState) {
+		return innerGraphState.currentTopLevelSymbol;
+	}
+};
+
+/**
+ * @param {JavascriptParser} parser parser
+ * @param {string} name name of variable
+ * @returns {TopLevelSymbol} symbol
+ */
+exports.tagTopLevelSymbol = (parser, name) => {
+	const innerGraphState = getState(parser.state);
+	if (!innerGraphState) return;
+
+	parser.defineVariable(name);
+
+	const existingTag = /** @type {TopLevelSymbol} */ (
+		parser.getTagData(name, topLevelSymbolTag)
+	);
+	if (existingTag) {
+		return existingTag;
+	}
+
+	const fn = new TopLevelSymbol(name);
+	parser.tagVariable(name, topLevelSymbolTag, fn);
+	return fn;
+};
+
+/**
+ * @param {Dependency} dependency the dependency
+ * @param {Set<string> | boolean} usedByExports usedByExports info
+ * @param {ModuleGraph} moduleGraph moduleGraph
+ * @param {RuntimeSpec} runtime runtime
+ * @returns {boolean} false, when unused. Otherwise true
+ */
+exports.isDependencyUsedByExports = (
+	dependency,
+	usedByExports,
+	moduleGraph,
+	runtime
+) => {
+	if (usedByExports === false) return false;
+	if (usedByExports !== true && usedByExports !== undefined) {
+		const selfModule = moduleGraph.getParentModule(dependency);
+		const exportsInfo = moduleGraph.getExportsInfo(selfModule);
+		let used = false;
+		for (const exportName of usedByExports) {
+			if (exportsInfo.getUsed(exportName, runtime) !== UsageState.Unused)
+				used = true;
+		}
+		if (!used) return false;
+	}
+	return true;
+};
+
+/**
+ * @param {Dependency} dependency the dependency
+ * @param {Set<string> | boolean} usedByExports usedByExports info
+ * @param {ModuleGraph} moduleGraph moduleGraph
+ * @returns {null | false | function(ModuleGraphConnection, RuntimeSpec): ConnectionState} function to determine if the connection is active
+ */
+exports.getDependencyUsedByExportsCondition = (
+	dependency,
+	usedByExports,
+	moduleGraph
+) => {
+	if (usedByExports === false) return false;
+	if (usedByExports !== true && usedByExports !== undefined) {
+		const selfModule = moduleGraph.getParentModule(dependency);
+		const exportsInfo = moduleGraph.getExportsInfo(selfModule);
+		return (connections, runtime) => {
+			for (const exportName of usedByExports) {
+				if (exportsInfo.getUsed(exportName, runtime) !== UsageState.Unused)
+					return true;
+			}
+			return false;
+		};
+	}
+	return null;
+};
+
+class TopLevelSymbol {
+	/**
+	 * @param {string} name name of the variable
+	 */
+	constructor(name) {
+		this.name = name;
+	}
+}
+
+exports.TopLevelSymbol = TopLevelSymbol;
+exports.topLevelSymbolTag = topLevelSymbolTag;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/InnerGraphPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/InnerGraphPlugin.js
new file mode 100644
index 0000000..7cb101a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/InnerGraphPlugin.js
@@ -0,0 +1,368 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const PureExpressionDependency = require("../dependencies/PureExpressionDependency");
+const InnerGraph = require("./InnerGraph");
+
+/** @typedef {import("estree").ClassDeclaration} ClassDeclarationNode */
+/** @typedef {import("estree").ClassExpression} ClassExpressionNode */
+/** @typedef {import("estree").Node} Node */
+/** @typedef {import("estree").VariableDeclarator} VariableDeclaratorNode */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../dependencies/HarmonyImportSpecifierDependency")} HarmonyImportSpecifierDependency */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+/** @typedef {import("./InnerGraph").InnerGraph} InnerGraph */
+/** @typedef {import("./InnerGraph").TopLevelSymbol} TopLevelSymbol */
+
+const { topLevelSymbolTag } = InnerGraph;
+
+class InnerGraphPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"InnerGraphPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const logger = compilation.getLogger("webpack.InnerGraphPlugin");
+
+				compilation.dependencyTemplates.set(
+					PureExpressionDependency,
+					new PureExpressionDependency.Template()
+				);
+
+				/**
+				 * @param {JavascriptParser} parser the parser
+				 * @param {Object} parserOptions options
+				 * @returns {void}
+				 */
+				const handler = (parser, parserOptions) => {
+					const onUsageSuper = sup => {
+						InnerGraph.onUsage(parser.state, usedByExports => {
+							switch (usedByExports) {
+								case undefined:
+								case true:
+									return;
+								default: {
+									const dep = new PureExpressionDependency(sup.range);
+									dep.loc = sup.loc;
+									dep.usedByExports = usedByExports;
+									parser.state.module.addDependency(dep);
+									break;
+								}
+							}
+						});
+					};
+
+					parser.hooks.program.tap("InnerGraphPlugin", () => {
+						InnerGraph.enable(parser.state);
+					});
+
+					parser.hooks.finish.tap("InnerGraphPlugin", () => {
+						if (!InnerGraph.isEnabled(parser.state)) return;
+
+						logger.time("infer dependency usage");
+						InnerGraph.inferDependencyUsage(parser.state);
+						logger.timeAggregate("infer dependency usage");
+					});
+
+					// During prewalking the following datastructures are filled with
+					// nodes that have a TopLevelSymbol assigned and
+					// variables are tagged with the assigned TopLevelSymbol
+
+					// We differ 3 types of nodes:
+					// 1. full statements (export default, function declaration)
+					// 2. classes (class declaration, class expression)
+					// 3. variable declarators (const x = ...)
+
+					/** @type {WeakMap<Node, TopLevelSymbol>} */
+					const statementWithTopLevelSymbol = new WeakMap();
+					/** @type {WeakMap<Node, Node>} */
+					const statementPurePart = new WeakMap();
+
+					/** @type {WeakMap<ClassExpressionNode | ClassDeclarationNode, TopLevelSymbol>} */
+					const classWithTopLevelSymbol = new WeakMap();
+
+					/** @type {WeakMap<VariableDeclaratorNode, TopLevelSymbol>} */
+					const declWithTopLevelSymbol = new WeakMap();
+					/** @type {WeakSet<VariableDeclaratorNode>} */
+					const pureDeclarators = new WeakSet();
+
+					// The following hooks are used during prewalking:
+
+					parser.hooks.preStatement.tap("InnerGraphPlugin", statement => {
+						if (!InnerGraph.isEnabled(parser.state)) return;
+
+						if (parser.scope.topLevelScope === true) {
+							if (statement.type === "FunctionDeclaration") {
+								const name = statement.id ? statement.id.name : "*default*";
+								const fn = InnerGraph.tagTopLevelSymbol(parser, name);
+								statementWithTopLevelSymbol.set(statement, fn);
+								return true;
+							}
+						}
+					});
+
+					parser.hooks.blockPreStatement.tap("InnerGraphPlugin", statement => {
+						if (!InnerGraph.isEnabled(parser.state)) return;
+
+						if (parser.scope.topLevelScope === true) {
+							if (statement.type === "ClassDeclaration") {
+								const name = statement.id ? statement.id.name : "*default*";
+								const fn = InnerGraph.tagTopLevelSymbol(parser, name);
+								classWithTopLevelSymbol.set(statement, fn);
+								return true;
+							}
+							if (statement.type === "ExportDefaultDeclaration") {
+								const name = "*default*";
+								const fn = InnerGraph.tagTopLevelSymbol(parser, name);
+								const decl = statement.declaration;
+								if (
+									decl.type === "ClassExpression" ||
+									decl.type === "ClassDeclaration"
+								) {
+									classWithTopLevelSymbol.set(decl, fn);
+								} else if (parser.isPure(decl, statement.range[0])) {
+									statementWithTopLevelSymbol.set(statement, fn);
+									if (
+										!decl.type.endsWith("FunctionExpression") &&
+										!decl.type.endsWith("Declaration") &&
+										decl.type !== "Literal"
+									) {
+										statementPurePart.set(statement, decl);
+									}
+								}
+							}
+						}
+					});
+
+					parser.hooks.preDeclarator.tap(
+						"InnerGraphPlugin",
+						(decl, statement) => {
+							if (!InnerGraph.isEnabled(parser.state)) return;
+							if (
+								parser.scope.topLevelScope === true &&
+								decl.init &&
+								decl.id.type === "Identifier"
+							) {
+								const name = decl.id.name;
+								if (decl.init.type === "ClassExpression") {
+									const fn = InnerGraph.tagTopLevelSymbol(parser, name);
+									classWithTopLevelSymbol.set(decl.init, fn);
+								} else if (parser.isPure(decl.init, decl.id.range[1])) {
+									const fn = InnerGraph.tagTopLevelSymbol(parser, name);
+									declWithTopLevelSymbol.set(decl, fn);
+									if (
+										!decl.init.type.endsWith("FunctionExpression") &&
+										decl.init.type !== "Literal"
+									) {
+										pureDeclarators.add(decl);
+									}
+									return true;
+								}
+							}
+						}
+					);
+
+					// During real walking we set the TopLevelSymbol state to the assigned
+					// TopLevelSymbol by using the fill datastructures.
+
+					// In addition to tracking TopLevelSymbols, we sometimes need to
+					// add a PureExpressionDependency. This is needed to skip execution
+					// of pure expressions, even when they are not dropped due to
+					// minimizing. Otherwise symbols used there might not exist anymore
+					// as they are removed as unused by this optimization
+
+					// When we find a reference to a TopLevelSymbol, we register a
+					// TopLevelSymbol dependency from TopLevelSymbol in state to the
+					// referenced TopLevelSymbol. This way we get a graph of all
+					// TopLevelSymbols.
+
+					// The following hooks are called during walking:
+
+					parser.hooks.statement.tap("InnerGraphPlugin", statement => {
+						if (!InnerGraph.isEnabled(parser.state)) return;
+						if (parser.scope.topLevelScope === true) {
+							InnerGraph.setTopLevelSymbol(parser.state, undefined);
+
+							const fn = statementWithTopLevelSymbol.get(statement);
+							if (fn) {
+								InnerGraph.setTopLevelSymbol(parser.state, fn);
+								const purePart = statementPurePart.get(statement);
+								if (purePart) {
+									InnerGraph.onUsage(parser.state, usedByExports => {
+										switch (usedByExports) {
+											case undefined:
+											case true:
+												return;
+											default: {
+												const dep = new PureExpressionDependency(
+													purePart.range
+												);
+												dep.loc = statement.loc;
+												dep.usedByExports = usedByExports;
+												parser.state.module.addDependency(dep);
+												break;
+											}
+										}
+									});
+								}
+							}
+						}
+					});
+
+					parser.hooks.classExtendsExpression.tap(
+						"InnerGraphPlugin",
+						(expr, statement) => {
+							if (!InnerGraph.isEnabled(parser.state)) return;
+							if (parser.scope.topLevelScope === true) {
+								const fn = classWithTopLevelSymbol.get(statement);
+								if (
+									fn &&
+									parser.isPure(
+										expr,
+										statement.id ? statement.id.range[1] : statement.range[0]
+									)
+								) {
+									InnerGraph.setTopLevelSymbol(parser.state, fn);
+									onUsageSuper(expr);
+								}
+							}
+						}
+					);
+
+					parser.hooks.classBodyElement.tap(
+						"InnerGraphPlugin",
+						(element, classDefinition) => {
+							if (!InnerGraph.isEnabled(parser.state)) return;
+							if (parser.scope.topLevelScope === true) {
+								const fn = classWithTopLevelSymbol.get(classDefinition);
+								if (fn) {
+									InnerGraph.setTopLevelSymbol(parser.state, undefined);
+								}
+							}
+						}
+					);
+
+					parser.hooks.classBodyValue.tap(
+						"InnerGraphPlugin",
+						(expression, element, classDefinition) => {
+							if (!InnerGraph.isEnabled(parser.state)) return;
+							if (parser.scope.topLevelScope === true) {
+								const fn = classWithTopLevelSymbol.get(classDefinition);
+								if (fn) {
+									if (
+										!element.static ||
+										parser.isPure(
+											expression,
+											element.key ? element.key.range[1] : element.range[0]
+										)
+									) {
+										InnerGraph.setTopLevelSymbol(parser.state, fn);
+										if (element.type !== "MethodDefinition" && element.static) {
+											InnerGraph.onUsage(parser.state, usedByExports => {
+												switch (usedByExports) {
+													case undefined:
+													case true:
+														return;
+													default: {
+														const dep = new PureExpressionDependency(
+															expression.range
+														);
+														dep.loc = expression.loc;
+														dep.usedByExports = usedByExports;
+														parser.state.module.addDependency(dep);
+														break;
+													}
+												}
+											});
+										}
+									} else {
+										InnerGraph.setTopLevelSymbol(parser.state, undefined);
+									}
+								}
+							}
+						}
+					);
+
+					parser.hooks.declarator.tap("InnerGraphPlugin", (decl, statement) => {
+						if (!InnerGraph.isEnabled(parser.state)) return;
+						const fn = declWithTopLevelSymbol.get(decl);
+
+						if (fn) {
+							InnerGraph.setTopLevelSymbol(parser.state, fn);
+							if (pureDeclarators.has(decl)) {
+								if (decl.init.type === "ClassExpression") {
+									if (decl.init.superClass) {
+										onUsageSuper(decl.init.superClass);
+									}
+								} else {
+									InnerGraph.onUsage(parser.state, usedByExports => {
+										switch (usedByExports) {
+											case undefined:
+											case true:
+												return;
+											default: {
+												const dep = new PureExpressionDependency(
+													decl.init.range
+												);
+												dep.loc = decl.loc;
+												dep.usedByExports = usedByExports;
+												parser.state.module.addDependency(dep);
+												break;
+											}
+										}
+									});
+								}
+							}
+							parser.walkExpression(decl.init);
+							InnerGraph.setTopLevelSymbol(parser.state, undefined);
+							return true;
+						}
+					});
+
+					parser.hooks.expression
+						.for(topLevelSymbolTag)
+						.tap("InnerGraphPlugin", () => {
+							const topLevelSymbol = /** @type {TopLevelSymbol} */ (
+								parser.currentTagData
+							);
+							const currentTopLevelSymbol = InnerGraph.getTopLevelSymbol(
+								parser.state
+							);
+							InnerGraph.addUsage(
+								parser.state,
+								topLevelSymbol,
+								currentTopLevelSymbol || true
+							);
+						});
+					parser.hooks.assign
+						.for(topLevelSymbolTag)
+						.tap("InnerGraphPlugin", expr => {
+							if (!InnerGraph.isEnabled(parser.state)) return;
+							if (expr.operator === "=") return true;
+						});
+				};
+				normalModuleFactory.hooks.parser
+					.for("javascript/auto")
+					.tap("InnerGraphPlugin", handler);
+				normalModuleFactory.hooks.parser
+					.for("javascript/esm")
+					.tap("InnerGraphPlugin", handler);
+
+				compilation.hooks.finishModules.tap("InnerGraphPlugin", () => {
+					logger.timeAggregateEnd("infer dependency usage");
+				});
+			}
+		);
+	}
+}
+
+module.exports = InnerGraphPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/LimitChunkCountPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/LimitChunkCountPlugin.js
new file mode 100644
index 0000000..56611bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/LimitChunkCountPlugin.js
@@ -0,0 +1,256 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_ADVANCED } = require("../OptimizationStages");
+const LazyBucketSortedSet = require("../util/LazyBucketSortedSet");
+const { compareChunks } = require("../util/comparators");
+const createSchemaValidation = require("../util/create-schema-validation");
+
+/** @typedef {import("../../declarations/plugins/optimize/LimitChunkCountPlugin").LimitChunkCountPluginOptions} LimitChunkCountPluginOptions */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/optimize/LimitChunkCountPlugin.check.js"),
+	() => require("../../schemas/plugins/optimize/LimitChunkCountPlugin.json"),
+	{
+		name: "Limit Chunk Count Plugin",
+		baseDataPath: "options"
+	}
+);
+
+/**
+ * @typedef {Object} ChunkCombination
+ * @property {boolean} deleted this is set to true when combination was removed
+ * @property {number} sizeDiff
+ * @property {number} integratedSize
+ * @property {Chunk} a
+ * @property {Chunk} b
+ * @property {number} aIdx
+ * @property {number} bIdx
+ * @property {number} aSize
+ * @property {number} bSize
+ */
+
+const addToSetMap = (map, key, value) => {
+	const set = map.get(key);
+	if (set === undefined) {
+		map.set(key, new Set([value]));
+	} else {
+		set.add(value);
+	}
+};
+
+class LimitChunkCountPlugin {
+	/**
+	 * @param {LimitChunkCountPluginOptions=} options options object
+	 */
+	constructor(options) {
+		validate(options);
+		this.options = options;
+	}
+
+	/**
+	 * @param {Compiler} compiler the webpack compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		compiler.hooks.compilation.tap("LimitChunkCountPlugin", compilation => {
+			compilation.hooks.optimizeChunks.tap(
+				{
+					name: "LimitChunkCountPlugin",
+					stage: STAGE_ADVANCED
+				},
+				chunks => {
+					const chunkGraph = compilation.chunkGraph;
+					const maxChunks = options.maxChunks;
+					if (!maxChunks) return;
+					if (maxChunks < 1) return;
+					if (compilation.chunks.size <= maxChunks) return;
+
+					let remainingChunksToMerge = compilation.chunks.size - maxChunks;
+
+					// order chunks in a deterministic way
+					const compareChunksWithGraph = compareChunks(chunkGraph);
+					const orderedChunks = Array.from(chunks).sort(compareChunksWithGraph);
+
+					// create a lazy sorted data structure to keep all combinations
+					// this is large. Size = chunks * (chunks - 1) / 2
+					// It uses a multi layer bucket sort plus normal sort in the last layer
+					// It's also lazy so only accessed buckets are sorted
+					const combinations = new LazyBucketSortedSet(
+						// Layer 1: ordered by largest size benefit
+						c => c.sizeDiff,
+						(a, b) => b - a,
+						// Layer 2: ordered by smallest combined size
+						c => c.integratedSize,
+						(a, b) => a - b,
+						// Layer 3: ordered by position difference in orderedChunk (-> to be deterministic)
+						c => c.bIdx - c.aIdx,
+						(a, b) => a - b,
+						// Layer 4: ordered by position in orderedChunk (-> to be deterministic)
+						(a, b) => a.bIdx - b.bIdx
+					);
+
+					// we keep a mapping from chunk to all combinations
+					// but this mapping is not kept up-to-date with deletions
+					// so `deleted` flag need to be considered when iterating this
+					/** @type {Map<Chunk, Set<ChunkCombination>>} */
+					const combinationsByChunk = new Map();
+
+					orderedChunks.forEach((b, bIdx) => {
+						// create combination pairs with size and integrated size
+						for (let aIdx = 0; aIdx < bIdx; aIdx++) {
+							const a = orderedChunks[aIdx];
+							// filter pairs that can not be integrated!
+							if (!chunkGraph.canChunksBeIntegrated(a, b)) continue;
+
+							const integratedSize = chunkGraph.getIntegratedChunksSize(
+								a,
+								b,
+								options
+							);
+
+							const aSize = chunkGraph.getChunkSize(a, options);
+							const bSize = chunkGraph.getChunkSize(b, options);
+							const c = {
+								deleted: false,
+								sizeDiff: aSize + bSize - integratedSize,
+								integratedSize,
+								a,
+								b,
+								aIdx,
+								bIdx,
+								aSize,
+								bSize
+							};
+							combinations.add(c);
+							addToSetMap(combinationsByChunk, a, c);
+							addToSetMap(combinationsByChunk, b, c);
+						}
+						return combinations;
+					});
+
+					// list of modified chunks during this run
+					// combinations affected by this change are skipped to allow
+					// further optimizations
+					/** @type {Set<Chunk>} */
+					const modifiedChunks = new Set();
+
+					let changed = false;
+					// eslint-disable-next-line no-constant-condition
+					loop: while (true) {
+						const combination = combinations.popFirst();
+						if (combination === undefined) break;
+
+						combination.deleted = true;
+						const { a, b, integratedSize } = combination;
+
+						// skip over pair when
+						// one of the already merged chunks is a parent of one of the chunks
+						if (modifiedChunks.size > 0) {
+							const queue = new Set(a.groupsIterable);
+							for (const group of b.groupsIterable) {
+								queue.add(group);
+							}
+							for (const group of queue) {
+								for (const mChunk of modifiedChunks) {
+									if (mChunk !== a && mChunk !== b && mChunk.isInGroup(group)) {
+										// This is a potential pair which needs recalculation
+										// We can't do that now, but it merge before following pairs
+										// so we leave space for it, and consider chunks as modified
+										// just for the worse case
+										remainingChunksToMerge--;
+										if (remainingChunksToMerge <= 0) break loop;
+										modifiedChunks.add(a);
+										modifiedChunks.add(b);
+										continue loop;
+									}
+								}
+								for (const parent of group.parentsIterable) {
+									queue.add(parent);
+								}
+							}
+						}
+
+						// merge the chunks
+						if (chunkGraph.canChunksBeIntegrated(a, b)) {
+							chunkGraph.integrateChunks(a, b);
+							compilation.chunks.delete(b);
+
+							// flag chunk a as modified as further optimization are possible for all children here
+							modifiedChunks.add(a);
+
+							changed = true;
+							remainingChunksToMerge--;
+							if (remainingChunksToMerge <= 0) break;
+
+							// Update all affected combinations
+							// delete all combination with the removed chunk
+							// we will use combinations with the kept chunk instead
+							for (const combination of combinationsByChunk.get(a)) {
+								if (combination.deleted) continue;
+								combination.deleted = true;
+								combinations.delete(combination);
+							}
+
+							// Update combinations with the kept chunk with new sizes
+							for (const combination of combinationsByChunk.get(b)) {
+								if (combination.deleted) continue;
+								if (combination.a === b) {
+									if (!chunkGraph.canChunksBeIntegrated(a, combination.b)) {
+										combination.deleted = true;
+										combinations.delete(combination);
+										continue;
+									}
+									// Update size
+									const newIntegratedSize = chunkGraph.getIntegratedChunksSize(
+										a,
+										combination.b,
+										options
+									);
+									const finishUpdate = combinations.startUpdate(combination);
+									combination.a = a;
+									combination.integratedSize = newIntegratedSize;
+									combination.aSize = integratedSize;
+									combination.sizeDiff =
+										combination.bSize + integratedSize - newIntegratedSize;
+									finishUpdate();
+								} else if (combination.b === b) {
+									if (!chunkGraph.canChunksBeIntegrated(combination.a, a)) {
+										combination.deleted = true;
+										combinations.delete(combination);
+										continue;
+									}
+									// Update size
+									const newIntegratedSize = chunkGraph.getIntegratedChunksSize(
+										combination.a,
+										a,
+										options
+									);
+
+									const finishUpdate = combinations.startUpdate(combination);
+									combination.b = a;
+									combination.integratedSize = newIntegratedSize;
+									combination.bSize = integratedSize;
+									combination.sizeDiff =
+										integratedSize + combination.aSize - newIntegratedSize;
+									finishUpdate();
+								}
+							}
+							combinationsByChunk.set(a, combinationsByChunk.get(b));
+							combinationsByChunk.delete(b);
+						}
+					}
+					if (changed) return true;
+				}
+			);
+		});
+	}
+}
+module.exports = LimitChunkCountPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MangleExportsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MangleExportsPlugin.js
new file mode 100644
index 0000000..964f392
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MangleExportsPlugin.js
@@ -0,0 +1,177 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { UsageState } = require("../ExportsInfo");
+const {
+	numberToIdentifier,
+	NUMBER_OF_IDENTIFIER_START_CHARS,
+	NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS
+} = require("../Template");
+const { assignDeterministicIds } = require("../ids/IdHelpers");
+const { compareSelect, compareStringsNumeric } = require("../util/comparators");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../ExportsInfo")} ExportsInfo */
+/** @typedef {import("../ExportsInfo").ExportInfo} ExportInfo */
+
+/**
+ * @param {ExportsInfo} exportsInfo exports info
+ * @returns {boolean} mangle is possible
+ */
+const canMangle = exportsInfo => {
+	if (exportsInfo.otherExportsInfo.getUsed(undefined) !== UsageState.Unused)
+		return false;
+	let hasSomethingToMangle = false;
+	for (const exportInfo of exportsInfo.exports) {
+		if (exportInfo.canMangle === true) {
+			hasSomethingToMangle = true;
+		}
+	}
+	return hasSomethingToMangle;
+};
+
+// Sort by name
+const comparator = compareSelect(e => e.name, compareStringsNumeric);
+/**
+ * @param {boolean} deterministic use deterministic names
+ * @param {ExportsInfo} exportsInfo exports info
+ * @param {boolean} isNamespace is namespace object
+ * @returns {void}
+ */
+const mangleExportsInfo = (deterministic, exportsInfo, isNamespace) => {
+	if (!canMangle(exportsInfo)) return;
+	const usedNames = new Set();
+	/** @type {ExportInfo[]} */
+	const mangleableExports = [];
+
+	// Avoid to renamed exports that are not provided when
+	// 1. it's not a namespace export: non-provided exports can be found in prototype chain
+	// 2. there are other provided exports and deterministic mode is chosen:
+	//    non-provided exports would break the determinism
+	let avoidMangleNonProvided = !isNamespace;
+	if (!avoidMangleNonProvided && deterministic) {
+		for (const exportInfo of exportsInfo.ownedExports) {
+			if (exportInfo.provided !== false) {
+				avoidMangleNonProvided = true;
+				break;
+			}
+		}
+	}
+	for (const exportInfo of exportsInfo.ownedExports) {
+		const name = exportInfo.name;
+		if (!exportInfo.hasUsedName()) {
+			if (
+				// Can the export be mangled?
+				exportInfo.canMangle !== true ||
+				// Never rename 1 char exports
+				(name.length === 1 && /^[a-zA-Z0-9_$]/.test(name)) ||
+				// Don't rename 2 char exports in deterministic mode
+				(deterministic &&
+					name.length === 2 &&
+					/^[a-zA-Z_$][a-zA-Z0-9_$]|^[1-9][0-9]/.test(name)) ||
+				// Don't rename exports that are not provided
+				(avoidMangleNonProvided && exportInfo.provided !== true)
+			) {
+				exportInfo.setUsedName(name);
+				usedNames.add(name);
+			} else {
+				mangleableExports.push(exportInfo);
+			}
+		}
+		if (exportInfo.exportsInfoOwned) {
+			const used = exportInfo.getUsed(undefined);
+			if (
+				used === UsageState.OnlyPropertiesUsed ||
+				used === UsageState.Unused
+			) {
+				mangleExportsInfo(deterministic, exportInfo.exportsInfo, false);
+			}
+		}
+	}
+	if (deterministic) {
+		assignDeterministicIds(
+			mangleableExports,
+			e => e.name,
+			comparator,
+			(e, id) => {
+				const name = numberToIdentifier(id);
+				const size = usedNames.size;
+				usedNames.add(name);
+				if (size === usedNames.size) return false;
+				e.setUsedName(name);
+				return true;
+			},
+			[
+				NUMBER_OF_IDENTIFIER_START_CHARS,
+				NUMBER_OF_IDENTIFIER_START_CHARS *
+					NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS
+			],
+			NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS,
+			usedNames.size
+		);
+	} else {
+		const usedExports = [];
+		const unusedExports = [];
+		for (const exportInfo of mangleableExports) {
+			if (exportInfo.getUsed(undefined) === UsageState.Unused) {
+				unusedExports.push(exportInfo);
+			} else {
+				usedExports.push(exportInfo);
+			}
+		}
+		usedExports.sort(comparator);
+		unusedExports.sort(comparator);
+		let i = 0;
+		for (const list of [usedExports, unusedExports]) {
+			for (const exportInfo of list) {
+				let name;
+				do {
+					name = numberToIdentifier(i++);
+				} while (usedNames.has(name));
+				exportInfo.setUsedName(name);
+			}
+		}
+	}
+};
+
+class MangleExportsPlugin {
+	/**
+	 * @param {boolean} deterministic use deterministic names
+	 */
+	constructor(deterministic) {
+		this._deterministic = deterministic;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { _deterministic: deterministic } = this;
+		compiler.hooks.compilation.tap("MangleExportsPlugin", compilation => {
+			const moduleGraph = compilation.moduleGraph;
+			compilation.hooks.optimizeCodeGeneration.tap(
+				"MangleExportsPlugin",
+				modules => {
+					if (compilation.moduleMemCaches) {
+						throw new Error(
+							"optimization.mangleExports can't be used with cacheUnaffected as export mangling is a global effect"
+						);
+					}
+					for (const module of modules) {
+						const isNamespace =
+							module.buildMeta && module.buildMeta.exportsType === "namespace";
+						const exportsInfo = moduleGraph.getExportsInfo(module);
+						mangleExportsInfo(deterministic, exportsInfo, isNamespace);
+					}
+				}
+			);
+		});
+	}
+}
+
+module.exports = MangleExportsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MergeDuplicateChunksPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MergeDuplicateChunksPlugin.js
new file mode 100644
index 0000000..76cc247
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MergeDuplicateChunksPlugin.js
@@ -0,0 +1,115 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_BASIC } = require("../OptimizationStages");
+const { runtimeEqual } = require("../util/runtime");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class MergeDuplicateChunksPlugin {
+	/**
+	 * @param {Compiler} compiler the compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"MergeDuplicateChunksPlugin",
+			compilation => {
+				compilation.hooks.optimizeChunks.tap(
+					{
+						name: "MergeDuplicateChunksPlugin",
+						stage: STAGE_BASIC
+					},
+					chunks => {
+						const { chunkGraph, moduleGraph } = compilation;
+
+						// remember already tested chunks for performance
+						const notDuplicates = new Set();
+
+						// for each chunk
+						for (const chunk of chunks) {
+							// track a Set of all chunk that could be duplicates
+							let possibleDuplicates;
+							for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+								if (possibleDuplicates === undefined) {
+									// when possibleDuplicates is not yet set,
+									// create a new Set from chunks of the current module
+									// including only chunks with the same number of modules
+									for (const dup of chunkGraph.getModuleChunksIterable(
+										module
+									)) {
+										if (
+											dup !== chunk &&
+											chunkGraph.getNumberOfChunkModules(chunk) ===
+												chunkGraph.getNumberOfChunkModules(dup) &&
+											!notDuplicates.has(dup)
+										) {
+											// delay allocating the new Set until here, reduce memory pressure
+											if (possibleDuplicates === undefined) {
+												possibleDuplicates = new Set();
+											}
+											possibleDuplicates.add(dup);
+										}
+									}
+									// when no chunk is possible we can break here
+									if (possibleDuplicates === undefined) break;
+								} else {
+									// validate existing possible duplicates
+									for (const dup of possibleDuplicates) {
+										// remove possible duplicate when module is not contained
+										if (!chunkGraph.isModuleInChunk(module, dup)) {
+											possibleDuplicates.delete(dup);
+										}
+									}
+									// when all chunks has been removed we can break here
+									if (possibleDuplicates.size === 0) break;
+								}
+							}
+
+							// when we found duplicates
+							if (
+								possibleDuplicates !== undefined &&
+								possibleDuplicates.size > 0
+							) {
+								outer: for (const otherChunk of possibleDuplicates) {
+									if (otherChunk.hasRuntime() !== chunk.hasRuntime()) continue;
+									if (chunkGraph.getNumberOfEntryModules(chunk) > 0) continue;
+									if (chunkGraph.getNumberOfEntryModules(otherChunk) > 0)
+										continue;
+									if (!runtimeEqual(chunk.runtime, otherChunk.runtime)) {
+										for (const module of chunkGraph.getChunkModulesIterable(
+											chunk
+										)) {
+											const exportsInfo = moduleGraph.getExportsInfo(module);
+											if (
+												!exportsInfo.isEquallyUsed(
+													chunk.runtime,
+													otherChunk.runtime
+												)
+											) {
+												continue outer;
+											}
+										}
+									}
+									// merge them
+									if (chunkGraph.canChunksBeIntegrated(chunk, otherChunk)) {
+										chunkGraph.integrateChunks(chunk, otherChunk);
+										compilation.chunks.delete(otherChunk);
+									}
+								}
+							}
+
+							// don't check already processed chunks twice
+							notDuplicates.add(chunk);
+						}
+					}
+				);
+			}
+		);
+	}
+}
+module.exports = MergeDuplicateChunksPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MinChunkSizePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MinChunkSizePlugin.js
new file mode 100644
index 0000000..b51164c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MinChunkSizePlugin.js
@@ -0,0 +1,113 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_ADVANCED } = require("../OptimizationStages");
+const createSchemaValidation = require("../util/create-schema-validation");
+
+/** @typedef {import("../../declarations/plugins/optimize/MinChunkSizePlugin").MinChunkSizePluginOptions} MinChunkSizePluginOptions */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/optimize/MinChunkSizePlugin.check.js"),
+	() => require("../../schemas/plugins/optimize/MinChunkSizePlugin.json"),
+	{
+		name: "Min Chunk Size Plugin",
+		baseDataPath: "options"
+	}
+);
+
+class MinChunkSizePlugin {
+	/**
+	 * @param {MinChunkSizePluginOptions} options options object
+	 */
+	constructor(options) {
+		validate(options);
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const options = this.options;
+		const minChunkSize = options.minChunkSize;
+		compiler.hooks.compilation.tap("MinChunkSizePlugin", compilation => {
+			compilation.hooks.optimizeChunks.tap(
+				{
+					name: "MinChunkSizePlugin",
+					stage: STAGE_ADVANCED
+				},
+				chunks => {
+					const chunkGraph = compilation.chunkGraph;
+					const equalOptions = {
+						chunkOverhead: 1,
+						entryChunkMultiplicator: 1
+					};
+
+					const chunkSizesMap = new Map();
+					/** @type {[Chunk, Chunk][]} */
+					const combinations = [];
+					/** @type {Chunk[]} */
+					const smallChunks = [];
+					const visitedChunks = [];
+					for (const a of chunks) {
+						// check if one of the chunks sizes is smaller than the minChunkSize
+						// and filter pairs that can NOT be integrated!
+						if (chunkGraph.getChunkSize(a, equalOptions) < minChunkSize) {
+							smallChunks.push(a);
+							for (const b of visitedChunks) {
+								if (chunkGraph.canChunksBeIntegrated(b, a))
+									combinations.push([b, a]);
+							}
+						} else {
+							for (const b of smallChunks) {
+								if (chunkGraph.canChunksBeIntegrated(b, a))
+									combinations.push([b, a]);
+							}
+						}
+						chunkSizesMap.set(a, chunkGraph.getChunkSize(a, options));
+						visitedChunks.push(a);
+					}
+
+					const sortedSizeFilteredExtendedPairCombinations = combinations
+						.map(pair => {
+							// extend combination pairs with size and integrated size
+							const a = chunkSizesMap.get(pair[0]);
+							const b = chunkSizesMap.get(pair[1]);
+							const ab = chunkGraph.getIntegratedChunksSize(
+								pair[0],
+								pair[1],
+								options
+							);
+							/** @type {[number, number, Chunk, Chunk]} */
+							const extendedPair = [a + b - ab, ab, pair[0], pair[1]];
+							return extendedPair;
+						})
+						.sort((a, b) => {
+							// sadly javascript does an in place sort here
+							// sort by size
+							const diff = b[0] - a[0];
+							if (diff !== 0) return diff;
+							return a[1] - b[1];
+						});
+
+					if (sortedSizeFilteredExtendedPairCombinations.length === 0) return;
+
+					const pair = sortedSizeFilteredExtendedPairCombinations[0];
+
+					chunkGraph.integrateChunks(pair[2], pair[3]);
+					compilation.chunks.delete(pair[3]);
+					return true;
+				}
+			);
+		});
+	}
+}
+module.exports = MinChunkSizePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MinMaxSizeWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MinMaxSizeWarning.js
new file mode 100644
index 0000000..4be2670
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/MinMaxSizeWarning.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const SizeFormatHelpers = require("../SizeFormatHelpers");
+const WebpackError = require("../WebpackError");
+
+class MinMaxSizeWarning extends WebpackError {
+	constructor(keys, minSize, maxSize) {
+		let keysMessage = "Fallback cache group";
+		if (keys) {
+			keysMessage =
+				keys.length > 1
+					? `Cache groups ${keys.sort().join(", ")}`
+					: `Cache group ${keys[0]}`;
+		}
+		super(
+			`SplitChunksPlugin\n` +
+				`${keysMessage}\n` +
+				`Configured minSize (${SizeFormatHelpers.formatSize(minSize)}) is ` +
+				`bigger than maxSize (${SizeFormatHelpers.formatSize(maxSize)}).\n` +
+				"This seem to be a invalid optimization.splitChunks configuration."
+		);
+	}
+}
+
+module.exports = MinMaxSizeWarning;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/ModuleConcatenationPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/ModuleConcatenationPlugin.js
new file mode 100644
index 0000000..62175a6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/ModuleConcatenationPlugin.js
@@ -0,0 +1,866 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const asyncLib = require("neo-async");
+const ChunkGraph = require("../ChunkGraph");
+const ModuleGraph = require("../ModuleGraph");
+const { STAGE_DEFAULT } = require("../OptimizationStages");
+const HarmonyImportDependency = require("../dependencies/HarmonyImportDependency");
+const { compareModulesByIdentifier } = require("../util/comparators");
+const {
+	intersectRuntime,
+	mergeRuntimeOwned,
+	filterRuntime,
+	runtimeToString,
+	mergeRuntime
+} = require("../util/runtime");
+const ConcatenatedModule = require("./ConcatenatedModule");
+
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+/**
+ * @typedef {Object} Statistics
+ * @property {number} cached
+ * @property {number} alreadyInConfig
+ * @property {number} invalidModule
+ * @property {number} incorrectChunks
+ * @property {number} incorrectDependency
+ * @property {number} incorrectModuleDependency
+ * @property {number} incorrectChunksOfImporter
+ * @property {number} incorrectRuntimeCondition
+ * @property {number} importerFailed
+ * @property {number} added
+ */
+
+const formatBailoutReason = msg => {
+	return "ModuleConcatenation bailout: " + msg;
+};
+
+class ModuleConcatenationPlugin {
+	constructor(options) {
+		if (typeof options !== "object") options = {};
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { _backCompat: backCompat } = compiler;
+		compiler.hooks.compilation.tap("ModuleConcatenationPlugin", compilation => {
+			const moduleGraph = compilation.moduleGraph;
+			const bailoutReasonMap = new Map();
+
+			const setBailoutReason = (module, reason) => {
+				setInnerBailoutReason(module, reason);
+				moduleGraph
+					.getOptimizationBailout(module)
+					.push(
+						typeof reason === "function"
+							? rs => formatBailoutReason(reason(rs))
+							: formatBailoutReason(reason)
+					);
+			};
+
+			const setInnerBailoutReason = (module, reason) => {
+				bailoutReasonMap.set(module, reason);
+			};
+
+			const getInnerBailoutReason = (module, requestShortener) => {
+				const reason = bailoutReasonMap.get(module);
+				if (typeof reason === "function") return reason(requestShortener);
+				return reason;
+			};
+
+			const formatBailoutWarning = (module, problem) => requestShortener => {
+				if (typeof problem === "function") {
+					return formatBailoutReason(
+						`Cannot concat with ${module.readableIdentifier(
+							requestShortener
+						)}: ${problem(requestShortener)}`
+					);
+				}
+				const reason = getInnerBailoutReason(module, requestShortener);
+				const reasonWithPrefix = reason ? `: ${reason}` : "";
+				if (module === problem) {
+					return formatBailoutReason(
+						`Cannot concat with ${module.readableIdentifier(
+							requestShortener
+						)}${reasonWithPrefix}`
+					);
+				} else {
+					return formatBailoutReason(
+						`Cannot concat with ${module.readableIdentifier(
+							requestShortener
+						)} because of ${problem.readableIdentifier(
+							requestShortener
+						)}${reasonWithPrefix}`
+					);
+				}
+			};
+
+			compilation.hooks.optimizeChunkModules.tapAsync(
+				{
+					name: "ModuleConcatenationPlugin",
+					stage: STAGE_DEFAULT
+				},
+				(allChunks, modules, callback) => {
+					const logger = compilation.getLogger(
+						"webpack.ModuleConcatenationPlugin"
+					);
+					const { chunkGraph, moduleGraph } = compilation;
+					const relevantModules = [];
+					const possibleInners = new Set();
+					const context = {
+						chunkGraph,
+						moduleGraph
+					};
+					logger.time("select relevant modules");
+					for (const module of modules) {
+						let canBeRoot = true;
+						let canBeInner = true;
+
+						const bailoutReason = module.getConcatenationBailoutReason(context);
+						if (bailoutReason) {
+							setBailoutReason(module, bailoutReason);
+							continue;
+						}
+
+						// Must not be an async module
+						if (moduleGraph.isAsync(module)) {
+							setBailoutReason(module, `Module is async`);
+							continue;
+						}
+
+						// Must be in strict mode
+						if (!module.buildInfo.strict) {
+							setBailoutReason(module, `Module is not in strict mode`);
+							continue;
+						}
+
+						// Module must be in any chunk (we don't want to do useless work)
+						if (chunkGraph.getNumberOfModuleChunks(module) === 0) {
+							setBailoutReason(module, "Module is not in any chunk");
+							continue;
+						}
+
+						// Exports must be known (and not dynamic)
+						const exportsInfo = moduleGraph.getExportsInfo(module);
+						const relevantExports = exportsInfo.getRelevantExports(undefined);
+						const unknownReexports = relevantExports.filter(exportInfo => {
+							return (
+								exportInfo.isReexport() && !exportInfo.getTarget(moduleGraph)
+							);
+						});
+						if (unknownReexports.length > 0) {
+							setBailoutReason(
+								module,
+								`Reexports in this module do not have a static target (${Array.from(
+									unknownReexports,
+									exportInfo =>
+										`${
+											exportInfo.name || "other exports"
+										}: ${exportInfo.getUsedInfo()}`
+								).join(", ")})`
+							);
+							continue;
+						}
+
+						// Root modules must have a static list of exports
+						const unknownProvidedExports = relevantExports.filter(
+							exportInfo => {
+								return exportInfo.provided !== true;
+							}
+						);
+						if (unknownProvidedExports.length > 0) {
+							setBailoutReason(
+								module,
+								`List of module exports is dynamic (${Array.from(
+									unknownProvidedExports,
+									exportInfo =>
+										`${
+											exportInfo.name || "other exports"
+										}: ${exportInfo.getProvidedInfo()} and ${exportInfo.getUsedInfo()}`
+								).join(", ")})`
+							);
+							canBeRoot = false;
+						}
+
+						// Module must not be an entry point
+						if (chunkGraph.isEntryModule(module)) {
+							setInnerBailoutReason(module, "Module is an entry point");
+							canBeInner = false;
+						}
+
+						if (canBeRoot) relevantModules.push(module);
+						if (canBeInner) possibleInners.add(module);
+					}
+					logger.timeEnd("select relevant modules");
+					logger.debug(
+						`${relevantModules.length} potential root modules, ${possibleInners.size} potential inner modules`
+					);
+					// sort by depth
+					// modules with lower depth are more likely suited as roots
+					// this improves performance, because modules already selected as inner are skipped
+					logger.time("sort relevant modules");
+					relevantModules.sort((a, b) => {
+						return moduleGraph.getDepth(a) - moduleGraph.getDepth(b);
+					});
+					logger.timeEnd("sort relevant modules");
+
+					/** @type {Statistics} */
+					const stats = {
+						cached: 0,
+						alreadyInConfig: 0,
+						invalidModule: 0,
+						incorrectChunks: 0,
+						incorrectDependency: 0,
+						incorrectModuleDependency: 0,
+						incorrectChunksOfImporter: 0,
+						incorrectRuntimeCondition: 0,
+						importerFailed: 0,
+						added: 0
+					};
+					let statsCandidates = 0;
+					let statsSizeSum = 0;
+					let statsEmptyConfigurations = 0;
+
+					logger.time("find modules to concatenate");
+					const concatConfigurations = [];
+					const usedAsInner = new Set();
+					for (const currentRoot of relevantModules) {
+						// when used by another configuration as inner:
+						// the other configuration is better and we can skip this one
+						// TODO reconsider that when it's only used in a different runtime
+						if (usedAsInner.has(currentRoot)) continue;
+
+						let chunkRuntime = undefined;
+						for (const r of chunkGraph.getModuleRuntimes(currentRoot)) {
+							chunkRuntime = mergeRuntimeOwned(chunkRuntime, r);
+						}
+						const exportsInfo = moduleGraph.getExportsInfo(currentRoot);
+						const filteredRuntime = filterRuntime(chunkRuntime, r =>
+							exportsInfo.isModuleUsed(r)
+						);
+						const activeRuntime =
+							filteredRuntime === true
+								? chunkRuntime
+								: filteredRuntime === false
+								? undefined
+								: filteredRuntime;
+
+						// create a configuration with the root
+						const currentConfiguration = new ConcatConfiguration(
+							currentRoot,
+							activeRuntime
+						);
+
+						// cache failures to add modules
+						const failureCache = new Map();
+
+						// potential optional import candidates
+						/** @type {Set<Module>} */
+						const candidates = new Set();
+
+						// try to add all imports
+						for (const imp of this._getImports(
+							compilation,
+							currentRoot,
+							activeRuntime
+						)) {
+							candidates.add(imp);
+						}
+
+						for (const imp of candidates) {
+							const impCandidates = new Set();
+							const problem = this._tryToAdd(
+								compilation,
+								currentConfiguration,
+								imp,
+								chunkRuntime,
+								activeRuntime,
+								possibleInners,
+								impCandidates,
+								failureCache,
+								chunkGraph,
+								true,
+								stats
+							);
+							if (problem) {
+								failureCache.set(imp, problem);
+								currentConfiguration.addWarning(imp, problem);
+							} else {
+								for (const c of impCandidates) {
+									candidates.add(c);
+								}
+							}
+						}
+						statsCandidates += candidates.size;
+						if (!currentConfiguration.isEmpty()) {
+							const modules = currentConfiguration.getModules();
+							statsSizeSum += modules.size;
+							concatConfigurations.push(currentConfiguration);
+							for (const module of modules) {
+								if (module !== currentConfiguration.rootModule) {
+									usedAsInner.add(module);
+								}
+							}
+						} else {
+							statsEmptyConfigurations++;
+							const optimizationBailouts =
+								moduleGraph.getOptimizationBailout(currentRoot);
+							for (const warning of currentConfiguration.getWarningsSorted()) {
+								optimizationBailouts.push(
+									formatBailoutWarning(warning[0], warning[1])
+								);
+							}
+						}
+					}
+					logger.timeEnd("find modules to concatenate");
+					logger.debug(
+						`${
+							concatConfigurations.length
+						} successful concat configurations (avg size: ${
+							statsSizeSum / concatConfigurations.length
+						}), ${statsEmptyConfigurations} bailed out completely`
+					);
+					logger.debug(
+						`${statsCandidates} candidates were considered for adding (${stats.cached} cached failure, ${stats.alreadyInConfig} already in config, ${stats.invalidModule} invalid module, ${stats.incorrectChunks} incorrect chunks, ${stats.incorrectDependency} incorrect dependency, ${stats.incorrectChunksOfImporter} incorrect chunks of importer, ${stats.incorrectModuleDependency} incorrect module dependency, ${stats.incorrectRuntimeCondition} incorrect runtime condition, ${stats.importerFailed} importer failed, ${stats.added} added)`
+					);
+					// HACK: Sort configurations by length and start with the longest one
+					// to get the biggest groups possible. Used modules are marked with usedModules
+					// TODO: Allow to reuse existing configuration while trying to add dependencies.
+					// This would improve performance. O(n^2) -> O(n)
+					logger.time(`sort concat configurations`);
+					concatConfigurations.sort((a, b) => {
+						return b.modules.size - a.modules.size;
+					});
+					logger.timeEnd(`sort concat configurations`);
+					const usedModules = new Set();
+
+					logger.time("create concatenated modules");
+					asyncLib.each(
+						concatConfigurations,
+						(concatConfiguration, callback) => {
+							const rootModule = concatConfiguration.rootModule;
+
+							// Avoid overlapping configurations
+							// TODO: remove this when todo above is fixed
+							if (usedModules.has(rootModule)) return callback();
+							const modules = concatConfiguration.getModules();
+							for (const m of modules) {
+								usedModules.add(m);
+							}
+
+							// Create a new ConcatenatedModule
+							let newModule = ConcatenatedModule.create(
+								rootModule,
+								modules,
+								concatConfiguration.runtime,
+								compiler.root,
+								compilation.outputOptions.hashFunction
+							);
+
+							const build = () => {
+								newModule.build(
+									compiler.options,
+									compilation,
+									null,
+									null,
+									err => {
+										if (err) {
+											if (!err.module) {
+												err.module = newModule;
+											}
+											return callback(err);
+										}
+										integrate();
+									}
+								);
+							};
+
+							const integrate = () => {
+								if (backCompat) {
+									ChunkGraph.setChunkGraphForModule(newModule, chunkGraph);
+									ModuleGraph.setModuleGraphForModule(newModule, moduleGraph);
+								}
+
+								for (const warning of concatConfiguration.getWarningsSorted()) {
+									moduleGraph
+										.getOptimizationBailout(newModule)
+										.push(formatBailoutWarning(warning[0], warning[1]));
+								}
+								moduleGraph.cloneModuleAttributes(rootModule, newModule);
+								for (const m of modules) {
+									// add to builtModules when one of the included modules was built
+									if (compilation.builtModules.has(m)) {
+										compilation.builtModules.add(newModule);
+									}
+									if (m !== rootModule) {
+										// attach external references to the concatenated module too
+										moduleGraph.copyOutgoingModuleConnections(
+											m,
+											newModule,
+											c => {
+												return (
+													c.originModule === m &&
+													!(
+														c.dependency instanceof HarmonyImportDependency &&
+														modules.has(c.module)
+													)
+												);
+											}
+										);
+										// remove module from chunk
+										for (const chunk of chunkGraph.getModuleChunksIterable(
+											rootModule
+										)) {
+											chunkGraph.disconnectChunkAndModule(chunk, m);
+										}
+									}
+								}
+								compilation.modules.delete(rootModule);
+								ChunkGraph.clearChunkGraphForModule(rootModule);
+								ModuleGraph.clearModuleGraphForModule(rootModule);
+
+								// remove module from chunk
+								chunkGraph.replaceModule(rootModule, newModule);
+								// replace module references with the concatenated module
+								moduleGraph.moveModuleConnections(rootModule, newModule, c => {
+									const otherModule =
+										c.module === rootModule ? c.originModule : c.module;
+									const innerConnection =
+										c.dependency instanceof HarmonyImportDependency &&
+										modules.has(otherModule);
+									return !innerConnection;
+								});
+								// add concatenated module to the compilation
+								compilation.modules.add(newModule);
+
+								callback();
+							};
+
+							build();
+						},
+						err => {
+							logger.timeEnd("create concatenated modules");
+							process.nextTick(callback.bind(null, err));
+						}
+					);
+				}
+			);
+		});
+	}
+
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @param {Module} module the module to be added
+	 * @param {RuntimeSpec} runtime the runtime scope
+	 * @returns {Set<Module>} the imported modules
+	 */
+	_getImports(compilation, module, runtime) {
+		const moduleGraph = compilation.moduleGraph;
+		const set = new Set();
+		for (const dep of module.dependencies) {
+			// Get reference info only for harmony Dependencies
+			if (!(dep instanceof HarmonyImportDependency)) continue;
+
+			const connection = moduleGraph.getConnection(dep);
+			// Reference is valid and has a module
+			if (
+				!connection ||
+				!connection.module ||
+				!connection.isTargetActive(runtime)
+			) {
+				continue;
+			}
+
+			const importedNames = compilation.getDependencyReferencedExports(
+				dep,
+				undefined
+			);
+
+			if (
+				importedNames.every(i =>
+					Array.isArray(i) ? i.length > 0 : i.name.length > 0
+				) ||
+				Array.isArray(moduleGraph.getProvidedExports(module))
+			) {
+				set.add(connection.module);
+			}
+		}
+		return set;
+	}
+
+	/**
+	 * @param {Compilation} compilation webpack compilation
+	 * @param {ConcatConfiguration} config concat configuration (will be modified when added)
+	 * @param {Module} module the module to be added
+	 * @param {RuntimeSpec} runtime the runtime scope of the generated code
+	 * @param {RuntimeSpec} activeRuntime the runtime scope of the root module
+	 * @param {Set<Module>} possibleModules modules that are candidates
+	 * @param {Set<Module>} candidates list of potential candidates (will be added to)
+	 * @param {Map<Module, Module | function(RequestShortener): string>} failureCache cache for problematic modules to be more performant
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {boolean} avoidMutateOnFailure avoid mutating the config when adding fails
+	 * @param {Statistics} statistics gathering metrics
+	 * @returns {Module | function(RequestShortener): string} the problematic module
+	 */
+	_tryToAdd(
+		compilation,
+		config,
+		module,
+		runtime,
+		activeRuntime,
+		possibleModules,
+		candidates,
+		failureCache,
+		chunkGraph,
+		avoidMutateOnFailure,
+		statistics
+	) {
+		const cacheEntry = failureCache.get(module);
+		if (cacheEntry) {
+			statistics.cached++;
+			return cacheEntry;
+		}
+
+		// Already added?
+		if (config.has(module)) {
+			statistics.alreadyInConfig++;
+			return null;
+		}
+
+		// Not possible to add?
+		if (!possibleModules.has(module)) {
+			statistics.invalidModule++;
+			failureCache.set(module, module); // cache failures for performance
+			return module;
+		}
+
+		// Module must be in the correct chunks
+		const missingChunks = Array.from(
+			chunkGraph.getModuleChunksIterable(config.rootModule)
+		).filter(chunk => !chunkGraph.isModuleInChunk(module, chunk));
+		if (missingChunks.length > 0) {
+			const problem = requestShortener => {
+				const missingChunksList = Array.from(
+					new Set(missingChunks.map(chunk => chunk.name || "unnamed chunk(s)"))
+				).sort();
+				const chunks = Array.from(
+					new Set(
+						Array.from(chunkGraph.getModuleChunksIterable(module)).map(
+							chunk => chunk.name || "unnamed chunk(s)"
+						)
+					)
+				).sort();
+				return `Module ${module.readableIdentifier(
+					requestShortener
+				)} is not in the same chunk(s) (expected in chunk(s) ${missingChunksList.join(
+					", "
+				)}, module is in chunk(s) ${chunks.join(", ")})`;
+			};
+			statistics.incorrectChunks++;
+			failureCache.set(module, problem); // cache failures for performance
+			return problem;
+		}
+
+		const moduleGraph = compilation.moduleGraph;
+
+		const incomingConnections =
+			moduleGraph.getIncomingConnectionsByOriginModule(module);
+
+		const incomingConnectionsFromNonModules =
+			incomingConnections.get(null) || incomingConnections.get(undefined);
+		if (incomingConnectionsFromNonModules) {
+			const activeNonModulesConnections =
+				incomingConnectionsFromNonModules.filter(connection => {
+					// We are not interested in inactive connections
+					// or connections without dependency
+					return connection.isActive(runtime) || connection.dependency;
+				});
+			if (activeNonModulesConnections.length > 0) {
+				const problem = requestShortener => {
+					const importingExplanations = new Set(
+						activeNonModulesConnections.map(c => c.explanation).filter(Boolean)
+					);
+					const explanations = Array.from(importingExplanations).sort();
+					return `Module ${module.readableIdentifier(
+						requestShortener
+					)} is referenced ${
+						explanations.length > 0
+							? `by: ${explanations.join(", ")}`
+							: "in an unsupported way"
+					}`;
+				};
+				statistics.incorrectDependency++;
+				failureCache.set(module, problem); // cache failures for performance
+				return problem;
+			}
+		}
+
+		/** @type {Map<Module, readonly ModuleGraph.ModuleGraphConnection[]>} */
+		const incomingConnectionsFromModules = new Map();
+		for (const [originModule, connections] of incomingConnections) {
+			if (originModule) {
+				// Ignore connection from orphan modules
+				if (chunkGraph.getNumberOfModuleChunks(originModule) === 0) continue;
+
+				// We don't care for connections from other runtimes
+				let originRuntime = undefined;
+				for (const r of chunkGraph.getModuleRuntimes(originModule)) {
+					originRuntime = mergeRuntimeOwned(originRuntime, r);
+				}
+
+				if (!intersectRuntime(runtime, originRuntime)) continue;
+
+				// We are not interested in inactive connections
+				const activeConnections = connections.filter(connection =>
+					connection.isActive(runtime)
+				);
+				if (activeConnections.length > 0)
+					incomingConnectionsFromModules.set(originModule, activeConnections);
+			}
+		}
+
+		const incomingModules = Array.from(incomingConnectionsFromModules.keys());
+
+		// Module must be in the same chunks like the referencing module
+		const otherChunkModules = incomingModules.filter(originModule => {
+			for (const chunk of chunkGraph.getModuleChunksIterable(
+				config.rootModule
+			)) {
+				if (!chunkGraph.isModuleInChunk(originModule, chunk)) {
+					return true;
+				}
+			}
+			return false;
+		});
+		if (otherChunkModules.length > 0) {
+			const problem = requestShortener => {
+				const names = otherChunkModules
+					.map(m => m.readableIdentifier(requestShortener))
+					.sort();
+				return `Module ${module.readableIdentifier(
+					requestShortener
+				)} is referenced from different chunks by these modules: ${names.join(
+					", "
+				)}`;
+			};
+			statistics.incorrectChunksOfImporter++;
+			failureCache.set(module, problem); // cache failures for performance
+			return problem;
+		}
+
+		/** @type {Map<Module, readonly ModuleGraph.ModuleGraphConnection[]>} */
+		const nonHarmonyConnections = new Map();
+		for (const [originModule, connections] of incomingConnectionsFromModules) {
+			const selected = connections.filter(
+				connection =>
+					!connection.dependency ||
+					!(connection.dependency instanceof HarmonyImportDependency)
+			);
+			if (selected.length > 0)
+				nonHarmonyConnections.set(originModule, connections);
+		}
+		if (nonHarmonyConnections.size > 0) {
+			const problem = requestShortener => {
+				const names = Array.from(nonHarmonyConnections)
+					.map(([originModule, connections]) => {
+						return `${originModule.readableIdentifier(
+							requestShortener
+						)} (referenced with ${Array.from(
+							new Set(
+								connections
+									.map(c => c.dependency && c.dependency.type)
+									.filter(Boolean)
+							)
+						)
+							.sort()
+							.join(", ")})`;
+					})
+					.sort();
+				return `Module ${module.readableIdentifier(
+					requestShortener
+				)} is referenced from these modules with unsupported syntax: ${names.join(
+					", "
+				)}`;
+			};
+			statistics.incorrectModuleDependency++;
+			failureCache.set(module, problem); // cache failures for performance
+			return problem;
+		}
+
+		if (runtime !== undefined && typeof runtime !== "string") {
+			// Module must be consistently referenced in the same runtimes
+			/** @type {{ originModule: Module, runtimeCondition: RuntimeSpec }[]} */
+			const otherRuntimeConnections = [];
+			outer: for (const [
+				originModule,
+				connections
+			] of incomingConnectionsFromModules) {
+				/** @type {false | RuntimeSpec} */
+				let currentRuntimeCondition = false;
+				for (const connection of connections) {
+					const runtimeCondition = filterRuntime(runtime, runtime => {
+						return connection.isTargetActive(runtime);
+					});
+					if (runtimeCondition === false) continue;
+					if (runtimeCondition === true) continue outer;
+					if (currentRuntimeCondition !== false) {
+						currentRuntimeCondition = mergeRuntime(
+							currentRuntimeCondition,
+							runtimeCondition
+						);
+					} else {
+						currentRuntimeCondition = runtimeCondition;
+					}
+				}
+				if (currentRuntimeCondition !== false) {
+					otherRuntimeConnections.push({
+						originModule,
+						runtimeCondition: currentRuntimeCondition
+					});
+				}
+			}
+			if (otherRuntimeConnections.length > 0) {
+				const problem = requestShortener => {
+					return `Module ${module.readableIdentifier(
+						requestShortener
+					)} is runtime-dependent referenced by these modules: ${Array.from(
+						otherRuntimeConnections,
+						({ originModule, runtimeCondition }) =>
+							`${originModule.readableIdentifier(
+								requestShortener
+							)} (expected runtime ${runtimeToString(
+								runtime
+							)}, module is only referenced in ${runtimeToString(
+								/** @type {RuntimeSpec} */ (runtimeCondition)
+							)})`
+					).join(", ")}`;
+				};
+				statistics.incorrectRuntimeCondition++;
+				failureCache.set(module, problem); // cache failures for performance
+				return problem;
+			}
+		}
+
+		let backup;
+		if (avoidMutateOnFailure) {
+			backup = config.snapshot();
+		}
+
+		// Add the module
+		config.add(module);
+
+		incomingModules.sort(compareModulesByIdentifier);
+
+		// Every module which depends on the added module must be in the configuration too.
+		for (const originModule of incomingModules) {
+			const problem = this._tryToAdd(
+				compilation,
+				config,
+				originModule,
+				runtime,
+				activeRuntime,
+				possibleModules,
+				candidates,
+				failureCache,
+				chunkGraph,
+				false,
+				statistics
+			);
+			if (problem) {
+				if (backup !== undefined) config.rollback(backup);
+				statistics.importerFailed++;
+				failureCache.set(module, problem); // cache failures for performance
+				return problem;
+			}
+		}
+
+		// Add imports to possible candidates list
+		for (const imp of this._getImports(compilation, module, runtime)) {
+			candidates.add(imp);
+		}
+		statistics.added++;
+		return null;
+	}
+}
+
+class ConcatConfiguration {
+	/**
+	 * @param {Module} rootModule the root module
+	 * @param {RuntimeSpec} runtime the runtime
+	 */
+	constructor(rootModule, runtime) {
+		this.rootModule = rootModule;
+		this.runtime = runtime;
+		/** @type {Set<Module>} */
+		this.modules = new Set();
+		this.modules.add(rootModule);
+		/** @type {Map<Module, Module | function(RequestShortener): string>} */
+		this.warnings = new Map();
+	}
+
+	add(module) {
+		this.modules.add(module);
+	}
+
+	has(module) {
+		return this.modules.has(module);
+	}
+
+	isEmpty() {
+		return this.modules.size === 1;
+	}
+
+	addWarning(module, problem) {
+		this.warnings.set(module, problem);
+	}
+
+	getWarningsSorted() {
+		return new Map(
+			Array.from(this.warnings).sort((a, b) => {
+				const ai = a[0].identifier();
+				const bi = b[0].identifier();
+				if (ai < bi) return -1;
+				if (ai > bi) return 1;
+				return 0;
+			})
+		);
+	}
+
+	/**
+	 * @returns {Set<Module>} modules as set
+	 */
+	getModules() {
+		return this.modules;
+	}
+
+	snapshot() {
+		return this.modules.size;
+	}
+
+	rollback(snapshot) {
+		const modules = this.modules;
+		for (const m of modules) {
+			if (snapshot === 0) {
+				modules.delete(m);
+			} else {
+				snapshot--;
+			}
+		}
+	}
+}
+
+module.exports = ModuleConcatenationPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RealContentHashPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RealContentHashPlugin.js
new file mode 100644
index 0000000..3949320
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RealContentHashPlugin.js
@@ -0,0 +1,408 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncBailHook } = require("tapable");
+const { RawSource, CachedSource, CompatSource } = require("webpack-sources");
+const Compilation = require("../Compilation");
+const WebpackError = require("../WebpackError");
+const { compareSelect, compareStrings } = require("../util/comparators");
+const createHash = require("../util/createHash");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("../Compiler")} Compiler */
+
+const EMPTY_SET = new Set();
+
+const addToList = (itemOrItems, list) => {
+	if (Array.isArray(itemOrItems)) {
+		for (const item of itemOrItems) {
+			list.add(item);
+		}
+	} else if (itemOrItems) {
+		list.add(itemOrItems);
+	}
+};
+
+/**
+ * @template T
+ * @param {T[]} input list
+ * @param {function(T): Buffer} fn map function
+ * @returns {Buffer[]} buffers without duplicates
+ */
+const mapAndDeduplicateBuffers = (input, fn) => {
+	// Buffer.equals compares size first so this should be efficient enough
+	// If it becomes a performance problem we can use a map and group by size
+	// instead of looping over all assets.
+	const result = [];
+	outer: for (const value of input) {
+		const buf = fn(value);
+		for (const other of result) {
+			if (buf.equals(other)) continue outer;
+		}
+		result.push(buf);
+	}
+	return result;
+};
+
+/**
+ * Escapes regular expression metacharacters
+ * @param {string} str String to quote
+ * @returns {string} Escaped string
+ */
+const quoteMeta = str => {
+	return str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
+};
+
+const cachedSourceMap = new WeakMap();
+
+const toCachedSource = source => {
+	if (source instanceof CachedSource) {
+		return source;
+	}
+	const entry = cachedSourceMap.get(source);
+	if (entry !== undefined) return entry;
+	const newSource = new CachedSource(CompatSource.from(source));
+	cachedSourceMap.set(source, newSource);
+	return newSource;
+};
+
+/**
+ * @typedef {Object} AssetInfoForRealContentHash
+ * @property {string} name
+ * @property {AssetInfo} info
+ * @property {Source} source
+ * @property {RawSource | undefined} newSource
+ * @property {RawSource | undefined} newSourceWithoutOwn
+ * @property {string} content
+ * @property {Set<string>} ownHashes
+ * @property {Promise} contentComputePromise
+ * @property {Promise} contentComputeWithoutOwnPromise
+ * @property {Set<string>} referencedHashes
+ * @property {Set<string>} hashes
+ */
+
+/**
+ * @typedef {Object} CompilationHooks
+ * @property {SyncBailHook<[Buffer[], string], string>} updateHash
+ */
+
+/** @type {WeakMap<Compilation, CompilationHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class RealContentHashPlugin {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {CompilationHooks} the attached hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				updateHash: new SyncBailHook(["content", "oldHash"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	constructor({ hashFunction, hashDigest }) {
+		this._hashFunction = hashFunction;
+		this._hashDigest = hashDigest;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("RealContentHashPlugin", compilation => {
+			const cacheAnalyse = compilation.getCache(
+				"RealContentHashPlugin|analyse"
+			);
+			const cacheGenerate = compilation.getCache(
+				"RealContentHashPlugin|generate"
+			);
+			const hooks = RealContentHashPlugin.getCompilationHooks(compilation);
+			compilation.hooks.processAssets.tapPromise(
+				{
+					name: "RealContentHashPlugin",
+					stage: Compilation.PROCESS_ASSETS_STAGE_OPTIMIZE_HASH
+				},
+				async () => {
+					const assets = compilation.getAssets();
+					/** @type {AssetInfoForRealContentHash[]} */
+					const assetsWithInfo = [];
+					const hashToAssets = new Map();
+					for (const { source, info, name } of assets) {
+						const cachedSource = toCachedSource(source);
+						const content = cachedSource.source();
+						/** @type {Set<string>} */
+						const hashes = new Set();
+						addToList(info.contenthash, hashes);
+						const data = {
+							name,
+							info,
+							source: cachedSource,
+							/** @type {RawSource | undefined} */
+							newSource: undefined,
+							/** @type {RawSource | undefined} */
+							newSourceWithoutOwn: undefined,
+							content,
+							/** @type {Set<string>} */
+							ownHashes: undefined,
+							contentComputePromise: undefined,
+							contentComputeWithoutOwnPromise: undefined,
+							/** @type {Set<string>} */
+							referencedHashes: undefined,
+							hashes
+						};
+						assetsWithInfo.push(data);
+						for (const hash of hashes) {
+							const list = hashToAssets.get(hash);
+							if (list === undefined) {
+								hashToAssets.set(hash, [data]);
+							} else {
+								list.push(data);
+							}
+						}
+					}
+					if (hashToAssets.size === 0) return;
+					const hashRegExp = new RegExp(
+						Array.from(hashToAssets.keys(), quoteMeta).join("|"),
+						"g"
+					);
+					await Promise.all(
+						assetsWithInfo.map(async asset => {
+							const { name, source, content, hashes } = asset;
+							if (Buffer.isBuffer(content)) {
+								asset.referencedHashes = EMPTY_SET;
+								asset.ownHashes = EMPTY_SET;
+								return;
+							}
+							const etag = cacheAnalyse.mergeEtags(
+								cacheAnalyse.getLazyHashedEtag(source),
+								Array.from(hashes).join("|")
+							);
+							[asset.referencedHashes, asset.ownHashes] =
+								await cacheAnalyse.providePromise(name, etag, () => {
+									const referencedHashes = new Set();
+									let ownHashes = new Set();
+									const inContent = content.match(hashRegExp);
+									if (inContent) {
+										for (const hash of inContent) {
+											if (hashes.has(hash)) {
+												ownHashes.add(hash);
+												continue;
+											}
+											referencedHashes.add(hash);
+										}
+									}
+									return [referencedHashes, ownHashes];
+								});
+						})
+					);
+					const getDependencies = hash => {
+						const assets = hashToAssets.get(hash);
+						if (!assets) {
+							const referencingAssets = assetsWithInfo.filter(asset =>
+								asset.referencedHashes.has(hash)
+							);
+							const err = new WebpackError(`RealContentHashPlugin
+Some kind of unexpected caching problem occurred.
+An asset was cached with a reference to another asset (${hash}) that's not in the compilation anymore.
+Either the asset was incorrectly cached, or the referenced asset should also be restored from cache.
+Referenced by:
+${referencingAssets
+	.map(a => {
+		const match = new RegExp(`.{0,20}${quoteMeta(hash)}.{0,20}`).exec(
+			a.content
+		);
+		return ` - ${a.name}: ...${match ? match[0] : "???"}...`;
+	})
+	.join("\n")}`);
+							compilation.errors.push(err);
+							return undefined;
+						}
+						const hashes = new Set();
+						for (const { referencedHashes, ownHashes } of assets) {
+							if (!ownHashes.has(hash)) {
+								for (const hash of ownHashes) {
+									hashes.add(hash);
+								}
+							}
+							for (const hash of referencedHashes) {
+								hashes.add(hash);
+							}
+						}
+						return hashes;
+					};
+					const hashInfo = hash => {
+						const assets = hashToAssets.get(hash);
+						return `${hash} (${Array.from(assets, a => a.name)})`;
+					};
+					const hashesInOrder = new Set();
+					for (const hash of hashToAssets.keys()) {
+						const add = (hash, stack) => {
+							const deps = getDependencies(hash);
+							if (!deps) return;
+							stack.add(hash);
+							for (const dep of deps) {
+								if (hashesInOrder.has(dep)) continue;
+								if (stack.has(dep)) {
+									throw new Error(
+										`Circular hash dependency ${Array.from(
+											stack,
+											hashInfo
+										).join(" -> ")} -> ${hashInfo(dep)}`
+									);
+								}
+								add(dep, stack);
+							}
+							hashesInOrder.add(hash);
+							stack.delete(hash);
+						};
+						if (hashesInOrder.has(hash)) continue;
+						add(hash, new Set());
+					}
+					const hashToNewHash = new Map();
+					const getEtag = asset =>
+						cacheGenerate.mergeEtags(
+							cacheGenerate.getLazyHashedEtag(asset.source),
+							Array.from(asset.referencedHashes, hash =>
+								hashToNewHash.get(hash)
+							).join("|")
+						);
+					const computeNewContent = asset => {
+						if (asset.contentComputePromise) return asset.contentComputePromise;
+						return (asset.contentComputePromise = (async () => {
+							if (
+								asset.ownHashes.size > 0 ||
+								Array.from(asset.referencedHashes).some(
+									hash => hashToNewHash.get(hash) !== hash
+								)
+							) {
+								const identifier = asset.name;
+								const etag = getEtag(asset);
+								asset.newSource = await cacheGenerate.providePromise(
+									identifier,
+									etag,
+									() => {
+										const newContent = asset.content.replace(hashRegExp, hash =>
+											hashToNewHash.get(hash)
+										);
+										return new RawSource(newContent);
+									}
+								);
+							}
+						})());
+					};
+					const computeNewContentWithoutOwn = asset => {
+						if (asset.contentComputeWithoutOwnPromise)
+							return asset.contentComputeWithoutOwnPromise;
+						return (asset.contentComputeWithoutOwnPromise = (async () => {
+							if (
+								asset.ownHashes.size > 0 ||
+								Array.from(asset.referencedHashes).some(
+									hash => hashToNewHash.get(hash) !== hash
+								)
+							) {
+								const identifier = asset.name + "|without-own";
+								const etag = getEtag(asset);
+								asset.newSourceWithoutOwn = await cacheGenerate.providePromise(
+									identifier,
+									etag,
+									() => {
+										const newContent = asset.content.replace(
+											hashRegExp,
+											hash => {
+												if (asset.ownHashes.has(hash)) {
+													return "";
+												}
+												return hashToNewHash.get(hash);
+											}
+										);
+										return new RawSource(newContent);
+									}
+								);
+							}
+						})());
+					};
+					const comparator = compareSelect(a => a.name, compareStrings);
+					for (const oldHash of hashesInOrder) {
+						const assets = hashToAssets.get(oldHash);
+						assets.sort(comparator);
+						const hash = createHash(this._hashFunction);
+						await Promise.all(
+							assets.map(asset =>
+								asset.ownHashes.has(oldHash)
+									? computeNewContentWithoutOwn(asset)
+									: computeNewContent(asset)
+							)
+						);
+						const assetsContent = mapAndDeduplicateBuffers(assets, asset => {
+							if (asset.ownHashes.has(oldHash)) {
+								return asset.newSourceWithoutOwn
+									? asset.newSourceWithoutOwn.buffer()
+									: asset.source.buffer();
+							} else {
+								return asset.newSource
+									? asset.newSource.buffer()
+									: asset.source.buffer();
+							}
+						});
+						let newHash = hooks.updateHash.call(assetsContent, oldHash);
+						if (!newHash) {
+							for (const content of assetsContent) {
+								hash.update(content);
+							}
+							const digest = hash.digest(this._hashDigest);
+							newHash = /** @type {string} */ (digest.slice(0, oldHash.length));
+						}
+						hashToNewHash.set(oldHash, newHash);
+					}
+					await Promise.all(
+						assetsWithInfo.map(async asset => {
+							await computeNewContent(asset);
+							const newName = asset.name.replace(hashRegExp, hash =>
+								hashToNewHash.get(hash)
+							);
+
+							const infoUpdate = {};
+							const hash = asset.info.contenthash;
+							infoUpdate.contenthash = Array.isArray(hash)
+								? hash.map(hash => hashToNewHash.get(hash))
+								: hashToNewHash.get(hash);
+
+							if (asset.newSource !== undefined) {
+								compilation.updateAsset(
+									asset.name,
+									asset.newSource,
+									infoUpdate
+								);
+							} else {
+								compilation.updateAsset(asset.name, asset.source, infoUpdate);
+							}
+
+							if (asset.name !== newName) {
+								compilation.renameAsset(asset.name, newName);
+							}
+						})
+					);
+				}
+			);
+		});
+	}
+}
+
+module.exports = RealContentHashPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RemoveEmptyChunksPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RemoveEmptyChunksPlugin.js
new file mode 100644
index 0000000..6dbc2ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RemoveEmptyChunksPlugin.js
@@ -0,0 +1,57 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_BASIC, STAGE_ADVANCED } = require("../OptimizationStages");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+
+class RemoveEmptyChunksPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("RemoveEmptyChunksPlugin", compilation => {
+			/**
+			 * @param {Iterable<Chunk>} chunks the chunks array
+			 * @returns {void}
+			 */
+			const handler = chunks => {
+				const chunkGraph = compilation.chunkGraph;
+				for (const chunk of chunks) {
+					if (
+						chunkGraph.getNumberOfChunkModules(chunk) === 0 &&
+						!chunk.hasRuntime() &&
+						chunkGraph.getNumberOfEntryModules(chunk) === 0
+					) {
+						compilation.chunkGraph.disconnectChunk(chunk);
+						compilation.chunks.delete(chunk);
+					}
+				}
+			};
+
+			// TODO do it once
+			compilation.hooks.optimizeChunks.tap(
+				{
+					name: "RemoveEmptyChunksPlugin",
+					stage: STAGE_BASIC
+				},
+				handler
+			);
+			compilation.hooks.optimizeChunks.tap(
+				{
+					name: "RemoveEmptyChunksPlugin",
+					stage: STAGE_ADVANCED
+				},
+				handler
+			);
+		});
+	}
+}
+module.exports = RemoveEmptyChunksPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RemoveParentModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RemoveParentModulesPlugin.js
new file mode 100644
index 0000000..4e089d8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RemoveParentModulesPlugin.js
@@ -0,0 +1,121 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { STAGE_BASIC } = require("../OptimizationStages");
+const Queue = require("../util/Queue");
+const { intersect } = require("../util/SetHelpers");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class RemoveParentModulesPlugin {
+	/**
+	 * @param {Compiler} compiler the compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("RemoveParentModulesPlugin", compilation => {
+			const handler = (chunks, chunkGroups) => {
+				const chunkGraph = compilation.chunkGraph;
+				const queue = new Queue();
+				const availableModulesMap = new WeakMap();
+
+				for (const chunkGroup of compilation.entrypoints.values()) {
+					// initialize available modules for chunks without parents
+					availableModulesMap.set(chunkGroup, new Set());
+					for (const child of chunkGroup.childrenIterable) {
+						queue.enqueue(child);
+					}
+				}
+				for (const chunkGroup of compilation.asyncEntrypoints) {
+					// initialize available modules for chunks without parents
+					availableModulesMap.set(chunkGroup, new Set());
+					for (const child of chunkGroup.childrenIterable) {
+						queue.enqueue(child);
+					}
+				}
+
+				while (queue.length > 0) {
+					const chunkGroup = queue.dequeue();
+					let availableModules = availableModulesMap.get(chunkGroup);
+					let changed = false;
+					for (const parent of chunkGroup.parentsIterable) {
+						const availableModulesInParent = availableModulesMap.get(parent);
+						if (availableModulesInParent !== undefined) {
+							// If we know the available modules in parent: process these
+							if (availableModules === undefined) {
+								// if we have not own info yet: create new entry
+								availableModules = new Set(availableModulesInParent);
+								for (const chunk of parent.chunks) {
+									for (const m of chunkGraph.getChunkModulesIterable(chunk)) {
+										availableModules.add(m);
+									}
+								}
+								availableModulesMap.set(chunkGroup, availableModules);
+								changed = true;
+							} else {
+								for (const m of availableModules) {
+									if (
+										!chunkGraph.isModuleInChunkGroup(m, parent) &&
+										!availableModulesInParent.has(m)
+									) {
+										availableModules.delete(m);
+										changed = true;
+									}
+								}
+							}
+						}
+					}
+					if (changed) {
+						// if something changed: enqueue our children
+						for (const child of chunkGroup.childrenIterable) {
+							queue.enqueue(child);
+						}
+					}
+				}
+
+				// now we have available modules for every chunk
+				for (const chunk of chunks) {
+					const availableModulesSets = Array.from(
+						chunk.groupsIterable,
+						chunkGroup => availableModulesMap.get(chunkGroup)
+					);
+					if (availableModulesSets.some(s => s === undefined)) continue; // No info about this chunk group
+					const availableModules =
+						availableModulesSets.length === 1
+							? availableModulesSets[0]
+							: intersect(availableModulesSets);
+					const numberOfModules = chunkGraph.getNumberOfChunkModules(chunk);
+					const toRemove = new Set();
+					if (numberOfModules < availableModules.size) {
+						for (const m of chunkGraph.getChunkModulesIterable(chunk)) {
+							if (availableModules.has(m)) {
+								toRemove.add(m);
+							}
+						}
+					} else {
+						for (const m of availableModules) {
+							if (chunkGraph.isModuleInChunk(m, chunk)) {
+								toRemove.add(m);
+							}
+						}
+					}
+					for (const module of toRemove) {
+						chunkGraph.disconnectChunkAndModule(chunk, module);
+					}
+				}
+			};
+			compilation.hooks.optimizeChunks.tap(
+				{
+					name: "RemoveParentModulesPlugin",
+					stage: STAGE_BASIC
+				},
+				handler
+			);
+		});
+	}
+}
+module.exports = RemoveParentModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RuntimeChunkPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RuntimeChunkPlugin.js
new file mode 100644
index 0000000..ab57b0f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/RuntimeChunkPlugin.js
@@ -0,0 +1,44 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class RuntimeChunkPlugin {
+	constructor(options) {
+		this.options = {
+			name: entrypoint => `runtime~${entrypoint.name}`,
+			...options
+		};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap("RuntimeChunkPlugin", compilation => {
+			compilation.hooks.addEntry.tap(
+				"RuntimeChunkPlugin",
+				(_, { name: entryName }) => {
+					if (entryName === undefined) return;
+					const data = compilation.entries.get(entryName);
+					if (data.options.runtime === undefined && !data.options.dependOn) {
+						// Determine runtime chunk name
+						let name = this.options.name;
+						if (typeof name === "function") {
+							name = name({ name: entryName });
+						}
+						data.options.runtime = name;
+					}
+				}
+			);
+		});
+	}
+}
+
+module.exports = RuntimeChunkPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/SideEffectsFlagPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/SideEffectsFlagPlugin.js
new file mode 100644
index 0000000..3017d6d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/SideEffectsFlagPlugin.js
@@ -0,0 +1,337 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const glob2regexp = require("glob-to-regexp");
+const { STAGE_DEFAULT } = require("../OptimizationStages");
+const HarmonyExportImportedSpecifierDependency = require("../dependencies/HarmonyExportImportedSpecifierDependency");
+const HarmonyImportSpecifierDependency = require("../dependencies/HarmonyImportSpecifierDependency");
+const formatLocation = require("../formatLocation");
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../javascript/JavascriptParser")} JavascriptParser */
+
+/**
+ * @typedef {Object} ExportInModule
+ * @property {Module} module the module
+ * @property {string} exportName the name of the export
+ * @property {boolean} checked if the export is conditional
+ */
+
+/**
+ * @typedef {Object} ReexportInfo
+ * @property {Map<string, ExportInModule[]>} static
+ * @property {Map<Module, Set<string>>} dynamic
+ */
+
+/** @type {WeakMap<any, Map<string, RegExp>>} */
+const globToRegexpCache = new WeakMap();
+
+/**
+ * @param {string} glob the pattern
+ * @param {Map<string, RegExp>} cache the glob to RegExp cache
+ * @returns {RegExp} a regular expression
+ */
+const globToRegexp = (glob, cache) => {
+	const cacheEntry = cache.get(glob);
+	if (cacheEntry !== undefined) return cacheEntry;
+	if (!glob.includes("/")) {
+		glob = `**/${glob}`;
+	}
+	const baseRegexp = glob2regexp(glob, { globstar: true, extended: true });
+	const regexpSource = baseRegexp.source;
+	const regexp = new RegExp("^(\\./)?" + regexpSource.slice(1));
+	cache.set(glob, regexp);
+	return regexp;
+};
+
+class SideEffectsFlagPlugin {
+	/**
+	 * @param {boolean} analyseSource analyse source code for side effects
+	 */
+	constructor(analyseSource = true) {
+		this._analyseSource = analyseSource;
+	}
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		let cache = globToRegexpCache.get(compiler.root);
+		if (cache === undefined) {
+			cache = new Map();
+			globToRegexpCache.set(compiler.root, cache);
+		}
+		compiler.hooks.compilation.tap(
+			"SideEffectsFlagPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const moduleGraph = compilation.moduleGraph;
+				normalModuleFactory.hooks.module.tap(
+					"SideEffectsFlagPlugin",
+					(module, data) => {
+						const resolveData = data.resourceResolveData;
+						if (
+							resolveData &&
+							resolveData.descriptionFileData &&
+							resolveData.relativePath
+						) {
+							const sideEffects = resolveData.descriptionFileData.sideEffects;
+							if (sideEffects !== undefined) {
+								if (module.factoryMeta === undefined) {
+									module.factoryMeta = {};
+								}
+								const hasSideEffects =
+									SideEffectsFlagPlugin.moduleHasSideEffects(
+										resolveData.relativePath,
+										sideEffects,
+										cache
+									);
+								module.factoryMeta.sideEffectFree = !hasSideEffects;
+							}
+						}
+
+						return module;
+					}
+				);
+				normalModuleFactory.hooks.module.tap(
+					"SideEffectsFlagPlugin",
+					(module, data) => {
+						if (typeof data.settings.sideEffects === "boolean") {
+							if (module.factoryMeta === undefined) {
+								module.factoryMeta = {};
+							}
+							module.factoryMeta.sideEffectFree = !data.settings.sideEffects;
+						}
+						return module;
+					}
+				);
+				if (this._analyseSource) {
+					/**
+					 * @param {JavascriptParser} parser the parser
+					 * @returns {void}
+					 */
+					const parserHandler = parser => {
+						let sideEffectsStatement;
+						parser.hooks.program.tap("SideEffectsFlagPlugin", () => {
+							sideEffectsStatement = undefined;
+						});
+						parser.hooks.statement.tap(
+							{ name: "SideEffectsFlagPlugin", stage: -100 },
+							statement => {
+								if (sideEffectsStatement) return;
+								if (parser.scope.topLevelScope !== true) return;
+								switch (statement.type) {
+									case "ExpressionStatement":
+										if (
+											!parser.isPure(statement.expression, statement.range[0])
+										) {
+											sideEffectsStatement = statement;
+										}
+										break;
+									case "IfStatement":
+									case "WhileStatement":
+									case "DoWhileStatement":
+										if (!parser.isPure(statement.test, statement.range[0])) {
+											sideEffectsStatement = statement;
+										}
+										// statement hook will be called for child statements too
+										break;
+									case "ForStatement":
+										if (
+											!parser.isPure(statement.init, statement.range[0]) ||
+											!parser.isPure(
+												statement.test,
+												statement.init
+													? statement.init.range[1]
+													: statement.range[0]
+											) ||
+											!parser.isPure(
+												statement.update,
+												statement.test
+													? statement.test.range[1]
+													: statement.init
+													? statement.init.range[1]
+													: statement.range[0]
+											)
+										) {
+											sideEffectsStatement = statement;
+										}
+										// statement hook will be called for child statements too
+										break;
+									case "SwitchStatement":
+										if (
+											!parser.isPure(statement.discriminant, statement.range[0])
+										) {
+											sideEffectsStatement = statement;
+										}
+										// statement hook will be called for child statements too
+										break;
+									case "VariableDeclaration":
+									case "ClassDeclaration":
+									case "FunctionDeclaration":
+										if (!parser.isPure(statement, statement.range[0])) {
+											sideEffectsStatement = statement;
+										}
+										break;
+									case "ExportNamedDeclaration":
+									case "ExportDefaultDeclaration":
+										if (
+											!parser.isPure(statement.declaration, statement.range[0])
+										) {
+											sideEffectsStatement = statement;
+										}
+										break;
+									case "LabeledStatement":
+									case "BlockStatement":
+										// statement hook will be called for child statements too
+										break;
+									case "EmptyStatement":
+										break;
+									case "ExportAllDeclaration":
+									case "ImportDeclaration":
+										// imports will be handled by the dependencies
+										break;
+									default:
+										sideEffectsStatement = statement;
+										break;
+								}
+							}
+						);
+						parser.hooks.finish.tap("SideEffectsFlagPlugin", () => {
+							if (sideEffectsStatement === undefined) {
+								parser.state.module.buildMeta.sideEffectFree = true;
+							} else {
+								const { loc, type } = sideEffectsStatement;
+								moduleGraph
+									.getOptimizationBailout(parser.state.module)
+									.push(
+										() =>
+											`Statement (${type}) with side effects in source code at ${formatLocation(
+												loc
+											)}`
+									);
+							}
+						});
+					};
+					for (const key of [
+						"javascript/auto",
+						"javascript/esm",
+						"javascript/dynamic"
+					]) {
+						normalModuleFactory.hooks.parser
+							.for(key)
+							.tap("SideEffectsFlagPlugin", parserHandler);
+					}
+				}
+				compilation.hooks.optimizeDependencies.tap(
+					{
+						name: "SideEffectsFlagPlugin",
+						stage: STAGE_DEFAULT
+					},
+					modules => {
+						const logger = compilation.getLogger(
+							"webpack.SideEffectsFlagPlugin"
+						);
+
+						logger.time("update dependencies");
+						for (const module of modules) {
+							if (module.getSideEffectsConnectionState(moduleGraph) === false) {
+								const exportsInfo = moduleGraph.getExportsInfo(module);
+								for (const connection of moduleGraph.getIncomingConnections(
+									module
+								)) {
+									const dep = connection.dependency;
+									let isReexport;
+									if (
+										(isReexport =
+											dep instanceof
+											HarmonyExportImportedSpecifierDependency) ||
+										(dep instanceof HarmonyImportSpecifierDependency &&
+											!dep.namespaceObjectAsContext)
+									) {
+										// TODO improve for export *
+										if (isReexport && dep.name) {
+											const exportInfo = moduleGraph.getExportInfo(
+												connection.originModule,
+												dep.name
+											);
+											exportInfo.moveTarget(
+												moduleGraph,
+												({ module }) =>
+													module.getSideEffectsConnectionState(moduleGraph) ===
+													false,
+												({ module: newModule, export: exportName }) => {
+													moduleGraph.updateModule(dep, newModule);
+													moduleGraph.addExplanation(
+														dep,
+														"(skipped side-effect-free modules)"
+													);
+													const ids = dep.getIds(moduleGraph);
+													dep.setIds(
+														moduleGraph,
+														exportName
+															? [...exportName, ...ids.slice(1)]
+															: ids.slice(1)
+													);
+													return moduleGraph.getConnection(dep);
+												}
+											);
+											continue;
+										}
+										// TODO improve for nested imports
+										const ids = dep.getIds(moduleGraph);
+										if (ids.length > 0) {
+											const exportInfo = exportsInfo.getExportInfo(ids[0]);
+											const target = exportInfo.getTarget(
+												moduleGraph,
+												({ module }) =>
+													module.getSideEffectsConnectionState(moduleGraph) ===
+													false
+											);
+											if (!target) continue;
+
+											moduleGraph.updateModule(dep, target.module);
+											moduleGraph.addExplanation(
+												dep,
+												"(skipped side-effect-free modules)"
+											);
+											dep.setIds(
+												moduleGraph,
+												target.export
+													? [...target.export, ...ids.slice(1)]
+													: ids.slice(1)
+											);
+										}
+									}
+								}
+							}
+						}
+						logger.timeEnd("update dependencies");
+					}
+				);
+			}
+		);
+	}
+
+	static moduleHasSideEffects(moduleName, flagValue, cache) {
+		switch (typeof flagValue) {
+			case "undefined":
+				return true;
+			case "boolean":
+				return flagValue;
+			case "string":
+				return globToRegexp(flagValue, cache).test(moduleName);
+			case "object":
+				return flagValue.some(glob =>
+					SideEffectsFlagPlugin.moduleHasSideEffects(moduleName, glob, cache)
+				);
+		}
+	}
+}
+module.exports = SideEffectsFlagPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/SplitChunksPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/SplitChunksPlugin.js
new file mode 100644
index 0000000..0dc358c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/optimize/SplitChunksPlugin.js
@@ -0,0 +1,1723 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Chunk = require("../Chunk");
+const { STAGE_ADVANCED } = require("../OptimizationStages");
+const WebpackError = require("../WebpackError");
+const { requestToId } = require("../ids/IdHelpers");
+const { isSubset } = require("../util/SetHelpers");
+const SortableSet = require("../util/SortableSet");
+const {
+	compareModulesByIdentifier,
+	compareIterables
+} = require("../util/comparators");
+const createHash = require("../util/createHash");
+const deterministicGrouping = require("../util/deterministicGrouping");
+const { makePathsRelative } = require("../util/identifier");
+const memoize = require("../util/memoize");
+const MinMaxSizeWarning = require("./MinMaxSizeWarning");
+
+/** @typedef {import("../../declarations/WebpackOptions").OptimizationSplitChunksCacheGroup} OptimizationSplitChunksCacheGroup */
+/** @typedef {import("../../declarations/WebpackOptions").OptimizationSplitChunksGetCacheGroups} OptimizationSplitChunksGetCacheGroups */
+/** @typedef {import("../../declarations/WebpackOptions").OptimizationSplitChunksOptions} OptimizationSplitChunksOptions */
+/** @typedef {import("../../declarations/WebpackOptions").OptimizationSplitChunksSizes} OptimizationSplitChunksSizes */
+/** @typedef {import("../../declarations/WebpackOptions").Output} OutputOptions */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("../Compilation").PathData} PathData */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../util/deterministicGrouping").GroupedItems<Module>} DeterministicGroupingGroupedItemsForModule */
+/** @typedef {import("../util/deterministicGrouping").Options<Module>} DeterministicGroupingOptionsForModule */
+
+/** @typedef {Record<string, number>} SplitChunksSizes */
+
+/**
+ * @callback ChunkFilterFunction
+ * @param {Chunk} chunk
+ * @returns {boolean}
+ */
+
+/**
+ * @callback CombineSizeFunction
+ * @param {number} a
+ * @param {number} b
+ * @returns {number}
+ */
+
+/**
+ * @typedef {Object} CacheGroupSource
+ * @property {string=} key
+ * @property {number=} priority
+ * @property {GetName=} getName
+ * @property {ChunkFilterFunction=} chunksFilter
+ * @property {boolean=} enforce
+ * @property {SplitChunksSizes} minSize
+ * @property {SplitChunksSizes} minSizeReduction
+ * @property {SplitChunksSizes} minRemainingSize
+ * @property {SplitChunksSizes} enforceSizeThreshold
+ * @property {SplitChunksSizes} maxAsyncSize
+ * @property {SplitChunksSizes} maxInitialSize
+ * @property {number=} minChunks
+ * @property {number=} maxAsyncRequests
+ * @property {number=} maxInitialRequests
+ * @property {(string | function(PathData, AssetInfo=): string)=} filename
+ * @property {string=} idHint
+ * @property {string} automaticNameDelimiter
+ * @property {boolean=} reuseExistingChunk
+ * @property {boolean=} usedExports
+ */
+
+/**
+ * @typedef {Object} CacheGroup
+ * @property {string} key
+ * @property {number=} priority
+ * @property {GetName=} getName
+ * @property {ChunkFilterFunction=} chunksFilter
+ * @property {SplitChunksSizes} minSize
+ * @property {SplitChunksSizes} minSizeReduction
+ * @property {SplitChunksSizes} minRemainingSize
+ * @property {SplitChunksSizes} enforceSizeThreshold
+ * @property {SplitChunksSizes} maxAsyncSize
+ * @property {SplitChunksSizes} maxInitialSize
+ * @property {number=} minChunks
+ * @property {number=} maxAsyncRequests
+ * @property {number=} maxInitialRequests
+ * @property {(string | function(PathData, AssetInfo=): string)=} filename
+ * @property {string=} idHint
+ * @property {string} automaticNameDelimiter
+ * @property {boolean} reuseExistingChunk
+ * @property {boolean} usedExports
+ * @property {boolean} _validateSize
+ * @property {boolean} _validateRemainingSize
+ * @property {SplitChunksSizes} _minSizeForMaxSize
+ * @property {boolean} _conditionalEnforce
+ */
+
+/**
+ * @typedef {Object} FallbackCacheGroup
+ * @property {ChunkFilterFunction} chunksFilter
+ * @property {SplitChunksSizes} minSize
+ * @property {SplitChunksSizes} maxAsyncSize
+ * @property {SplitChunksSizes} maxInitialSize
+ * @property {string} automaticNameDelimiter
+ */
+
+/**
+ * @typedef {Object} CacheGroupsContext
+ * @property {ModuleGraph} moduleGraph
+ * @property {ChunkGraph} chunkGraph
+ */
+
+/**
+ * @callback GetCacheGroups
+ * @param {Module} module
+ * @param {CacheGroupsContext} context
+ * @returns {CacheGroupSource[]}
+ */
+
+/**
+ * @callback GetName
+ * @param {Module=} module
+ * @param {Chunk[]=} chunks
+ * @param {string=} key
+ * @returns {string=}
+ */
+
+/**
+ * @typedef {Object} SplitChunksOptions
+ * @property {ChunkFilterFunction} chunksFilter
+ * @property {string[]} defaultSizeTypes
+ * @property {SplitChunksSizes} minSize
+ * @property {SplitChunksSizes} minSizeReduction
+ * @property {SplitChunksSizes} minRemainingSize
+ * @property {SplitChunksSizes} enforceSizeThreshold
+ * @property {SplitChunksSizes} maxInitialSize
+ * @property {SplitChunksSizes} maxAsyncSize
+ * @property {number} minChunks
+ * @property {number} maxAsyncRequests
+ * @property {number} maxInitialRequests
+ * @property {boolean} hidePathInfo
+ * @property {string | function(PathData, AssetInfo=): string} filename
+ * @property {string} automaticNameDelimiter
+ * @property {GetCacheGroups} getCacheGroups
+ * @property {GetName} getName
+ * @property {boolean} usedExports
+ * @property {FallbackCacheGroup} fallbackCacheGroup
+ */
+
+/**
+ * @typedef {Object} ChunksInfoItem
+ * @property {SortableSet<Module>} modules
+ * @property {CacheGroup} cacheGroup
+ * @property {number} cacheGroupIndex
+ * @property {string} name
+ * @property {Record<string, number>} sizes
+ * @property {Set<Chunk>} chunks
+ * @property {Set<Chunk>} reuseableChunks
+ * @property {Set<bigint | Chunk>} chunksKeys
+ */
+
+const defaultGetName = /** @type {GetName} */ (() => {});
+
+const deterministicGroupingForModules =
+	/** @type {function(DeterministicGroupingOptionsForModule): DeterministicGroupingGroupedItemsForModule[]} */ (
+		deterministicGrouping
+	);
+
+/** @type {WeakMap<Module, string>} */
+const getKeyCache = new WeakMap();
+
+/**
+ * @param {string} name a filename to hash
+ * @param {OutputOptions} outputOptions hash function used
+ * @returns {string} hashed filename
+ */
+const hashFilename = (name, outputOptions) => {
+	const digest = /** @type {string} */ (
+		createHash(outputOptions.hashFunction)
+			.update(name)
+			.digest(outputOptions.hashDigest)
+	);
+	return digest.slice(0, 8);
+};
+
+/**
+ * @param {Chunk} chunk the chunk
+ * @returns {number} the number of requests
+ */
+const getRequests = chunk => {
+	let requests = 0;
+	for (const chunkGroup of chunk.groupsIterable) {
+		requests = Math.max(requests, chunkGroup.chunks.length);
+	}
+	return requests;
+};
+
+const mapObject = (obj, fn) => {
+	const newObj = Object.create(null);
+	for (const key of Object.keys(obj)) {
+		newObj[key] = fn(obj[key], key);
+	}
+	return newObj;
+};
+
+/**
+ * @template T
+ * @param {Set<T>} a set
+ * @param {Set<T>} b other set
+ * @returns {boolean} true if at least one item of a is in b
+ */
+const isOverlap = (a, b) => {
+	for (const item of a) {
+		if (b.has(item)) return true;
+	}
+	return false;
+};
+
+const compareModuleIterables = compareIterables(compareModulesByIdentifier);
+
+/**
+ * @param {ChunksInfoItem} a item
+ * @param {ChunksInfoItem} b item
+ * @returns {number} compare result
+ */
+const compareEntries = (a, b) => {
+	// 1. by priority
+	const diffPriority = a.cacheGroup.priority - b.cacheGroup.priority;
+	if (diffPriority) return diffPriority;
+	// 2. by number of chunks
+	const diffCount = a.chunks.size - b.chunks.size;
+	if (diffCount) return diffCount;
+	// 3. by size reduction
+	const aSizeReduce = totalSize(a.sizes) * (a.chunks.size - 1);
+	const bSizeReduce = totalSize(b.sizes) * (b.chunks.size - 1);
+	const diffSizeReduce = aSizeReduce - bSizeReduce;
+	if (diffSizeReduce) return diffSizeReduce;
+	// 4. by cache group index
+	const indexDiff = b.cacheGroupIndex - a.cacheGroupIndex;
+	if (indexDiff) return indexDiff;
+	// 5. by number of modules (to be able to compare by identifier)
+	const modulesA = a.modules;
+	const modulesB = b.modules;
+	const diff = modulesA.size - modulesB.size;
+	if (diff) return diff;
+	// 6. by module identifiers
+	modulesA.sort();
+	modulesB.sort();
+	return compareModuleIterables(modulesA, modulesB);
+};
+
+const INITIAL_CHUNK_FILTER = chunk => chunk.canBeInitial();
+const ASYNC_CHUNK_FILTER = chunk => !chunk.canBeInitial();
+const ALL_CHUNK_FILTER = chunk => true;
+
+/**
+ * @param {OptimizationSplitChunksSizes} value the sizes
+ * @param {string[]} defaultSizeTypes the default size types
+ * @returns {SplitChunksSizes} normalized representation
+ */
+const normalizeSizes = (value, defaultSizeTypes) => {
+	if (typeof value === "number") {
+		/** @type {Record<string, number>} */
+		const o = {};
+		for (const sizeType of defaultSizeTypes) o[sizeType] = value;
+		return o;
+	} else if (typeof value === "object" && value !== null) {
+		return { ...value };
+	} else {
+		return {};
+	}
+};
+
+/**
+ * @param {...SplitChunksSizes} sizes the sizes
+ * @returns {SplitChunksSizes} the merged sizes
+ */
+const mergeSizes = (...sizes) => {
+	/** @type {SplitChunksSizes} */
+	let merged = {};
+	for (let i = sizes.length - 1; i >= 0; i--) {
+		merged = Object.assign(merged, sizes[i]);
+	}
+	return merged;
+};
+
+/**
+ * @param {SplitChunksSizes} sizes the sizes
+ * @returns {boolean} true, if there are sizes > 0
+ */
+const hasNonZeroSizes = sizes => {
+	for (const key of Object.keys(sizes)) {
+		if (sizes[key] > 0) return true;
+	}
+	return false;
+};
+
+/**
+ * @param {SplitChunksSizes} a first sizes
+ * @param {SplitChunksSizes} b second sizes
+ * @param {CombineSizeFunction} combine a function to combine sizes
+ * @returns {SplitChunksSizes} the combine sizes
+ */
+const combineSizes = (a, b, combine) => {
+	const aKeys = new Set(Object.keys(a));
+	const bKeys = new Set(Object.keys(b));
+	/** @type {SplitChunksSizes} */
+	const result = {};
+	for (const key of aKeys) {
+		if (bKeys.has(key)) {
+			result[key] = combine(a[key], b[key]);
+		} else {
+			result[key] = a[key];
+		}
+	}
+	for (const key of bKeys) {
+		if (!aKeys.has(key)) {
+			result[key] = b[key];
+		}
+	}
+	return result;
+};
+
+/**
+ * @param {SplitChunksSizes} sizes the sizes
+ * @param {SplitChunksSizes} minSize the min sizes
+ * @returns {boolean} true if there are sizes and all existing sizes are at least `minSize`
+ */
+const checkMinSize = (sizes, minSize) => {
+	for (const key of Object.keys(minSize)) {
+		const size = sizes[key];
+		if (size === undefined || size === 0) continue;
+		if (size < minSize[key]) return false;
+	}
+	return true;
+};
+
+/**
+ * @param {SplitChunksSizes} sizes the sizes
+ * @param {SplitChunksSizes} minSizeReduction the min sizes
+ * @param {number} chunkCount number of chunks
+ * @returns {boolean} true if there are sizes and all existing sizes are at least `minSizeReduction`
+ */
+const checkMinSizeReduction = (sizes, minSizeReduction, chunkCount) => {
+	for (const key of Object.keys(minSizeReduction)) {
+		const size = sizes[key];
+		if (size === undefined || size === 0) continue;
+		if (size * chunkCount < minSizeReduction[key]) return false;
+	}
+	return true;
+};
+
+/**
+ * @param {SplitChunksSizes} sizes the sizes
+ * @param {SplitChunksSizes} minSize the min sizes
+ * @returns {undefined | string[]} list of size types that are below min size
+ */
+const getViolatingMinSizes = (sizes, minSize) => {
+	let list;
+	for (const key of Object.keys(minSize)) {
+		const size = sizes[key];
+		if (size === undefined || size === 0) continue;
+		if (size < minSize[key]) {
+			if (list === undefined) list = [key];
+			else list.push(key);
+		}
+	}
+	return list;
+};
+
+/**
+ * @param {SplitChunksSizes} sizes the sizes
+ * @returns {number} the total size
+ */
+const totalSize = sizes => {
+	let size = 0;
+	for (const key of Object.keys(sizes)) {
+		size += sizes[key];
+	}
+	return size;
+};
+
+/**
+ * @param {false|string|Function} name the chunk name
+ * @returns {GetName} a function to get the name of the chunk
+ */
+const normalizeName = name => {
+	if (typeof name === "string") {
+		return () => name;
+	}
+	if (typeof name === "function") {
+		return /** @type {GetName} */ (name);
+	}
+};
+
+/**
+ * @param {OptimizationSplitChunksCacheGroup["chunks"]} chunks the chunk filter option
+ * @returns {ChunkFilterFunction} the chunk filter function
+ */
+const normalizeChunksFilter = chunks => {
+	if (chunks === "initial") {
+		return INITIAL_CHUNK_FILTER;
+	}
+	if (chunks === "async") {
+		return ASYNC_CHUNK_FILTER;
+	}
+	if (chunks === "all") {
+		return ALL_CHUNK_FILTER;
+	}
+	if (typeof chunks === "function") {
+		return chunks;
+	}
+};
+
+/**
+ * @param {GetCacheGroups | Record<string, false|string|RegExp|OptimizationSplitChunksGetCacheGroups|OptimizationSplitChunksCacheGroup>} cacheGroups the cache group options
+ * @param {string[]} defaultSizeTypes the default size types
+ * @returns {GetCacheGroups} a function to get the cache groups
+ */
+const normalizeCacheGroups = (cacheGroups, defaultSizeTypes) => {
+	if (typeof cacheGroups === "function") {
+		return cacheGroups;
+	}
+	if (typeof cacheGroups === "object" && cacheGroups !== null) {
+		/** @type {(function(Module, CacheGroupsContext, CacheGroupSource[]): void)[]} */
+		const handlers = [];
+		for (const key of Object.keys(cacheGroups)) {
+			const option = cacheGroups[key];
+			if (option === false) {
+				continue;
+			}
+			if (typeof option === "string" || option instanceof RegExp) {
+				const source = createCacheGroupSource({}, key, defaultSizeTypes);
+				handlers.push((module, context, results) => {
+					if (checkTest(option, module, context)) {
+						results.push(source);
+					}
+				});
+			} else if (typeof option === "function") {
+				const cache = new WeakMap();
+				handlers.push((module, context, results) => {
+					const result = option(module);
+					if (result) {
+						const groups = Array.isArray(result) ? result : [result];
+						for (const group of groups) {
+							const cachedSource = cache.get(group);
+							if (cachedSource !== undefined) {
+								results.push(cachedSource);
+							} else {
+								const source = createCacheGroupSource(
+									group,
+									key,
+									defaultSizeTypes
+								);
+								cache.set(group, source);
+								results.push(source);
+							}
+						}
+					}
+				});
+			} else {
+				const source = createCacheGroupSource(option, key, defaultSizeTypes);
+				handlers.push((module, context, results) => {
+					if (
+						checkTest(option.test, module, context) &&
+						checkModuleType(option.type, module) &&
+						checkModuleLayer(option.layer, module)
+					) {
+						results.push(source);
+					}
+				});
+			}
+		}
+		/**
+		 * @param {Module} module the current module
+		 * @param {CacheGroupsContext} context the current context
+		 * @returns {CacheGroupSource[]} the matching cache groups
+		 */
+		const fn = (module, context) => {
+			/** @type {CacheGroupSource[]} */
+			let results = [];
+			for (const fn of handlers) {
+				fn(module, context, results);
+			}
+			return results;
+		};
+		return fn;
+	}
+	return () => null;
+};
+
+/**
+ * @param {undefined|boolean|string|RegExp|Function} test test option
+ * @param {Module} module the module
+ * @param {CacheGroupsContext} context context object
+ * @returns {boolean} true, if the module should be selected
+ */
+const checkTest = (test, module, context) => {
+	if (test === undefined) return true;
+	if (typeof test === "function") {
+		return test(module, context);
+	}
+	if (typeof test === "boolean") return test;
+	if (typeof test === "string") {
+		const name = module.nameForCondition();
+		return name && name.startsWith(test);
+	}
+	if (test instanceof RegExp) {
+		const name = module.nameForCondition();
+		return name && test.test(name);
+	}
+	return false;
+};
+
+/**
+ * @param {undefined|string|RegExp|Function} test type option
+ * @param {Module} module the module
+ * @returns {boolean} true, if the module should be selected
+ */
+const checkModuleType = (test, module) => {
+	if (test === undefined) return true;
+	if (typeof test === "function") {
+		return test(module.type);
+	}
+	if (typeof test === "string") {
+		const type = module.type;
+		return test === type;
+	}
+	if (test instanceof RegExp) {
+		const type = module.type;
+		return test.test(type);
+	}
+	return false;
+};
+
+/**
+ * @param {undefined|string|RegExp|Function} test type option
+ * @param {Module} module the module
+ * @returns {boolean} true, if the module should be selected
+ */
+const checkModuleLayer = (test, module) => {
+	if (test === undefined) return true;
+	if (typeof test === "function") {
+		return test(module.layer);
+	}
+	if (typeof test === "string") {
+		const layer = module.layer;
+		return test === "" ? !layer : layer && layer.startsWith(test);
+	}
+	if (test instanceof RegExp) {
+		const layer = module.layer;
+		return test.test(layer);
+	}
+	return false;
+};
+
+/**
+ * @param {OptimizationSplitChunksCacheGroup} options the group options
+ * @param {string} key key of cache group
+ * @param {string[]} defaultSizeTypes the default size types
+ * @returns {CacheGroupSource} the normalized cached group
+ */
+const createCacheGroupSource = (options, key, defaultSizeTypes) => {
+	const minSize = normalizeSizes(options.minSize, defaultSizeTypes);
+	const minSizeReduction = normalizeSizes(
+		options.minSizeReduction,
+		defaultSizeTypes
+	);
+	const maxSize = normalizeSizes(options.maxSize, defaultSizeTypes);
+	return {
+		key,
+		priority: options.priority,
+		getName: normalizeName(options.name),
+		chunksFilter: normalizeChunksFilter(options.chunks),
+		enforce: options.enforce,
+		minSize,
+		minSizeReduction,
+		minRemainingSize: mergeSizes(
+			normalizeSizes(options.minRemainingSize, defaultSizeTypes),
+			minSize
+		),
+		enforceSizeThreshold: normalizeSizes(
+			options.enforceSizeThreshold,
+			defaultSizeTypes
+		),
+		maxAsyncSize: mergeSizes(
+			normalizeSizes(options.maxAsyncSize, defaultSizeTypes),
+			maxSize
+		),
+		maxInitialSize: mergeSizes(
+			normalizeSizes(options.maxInitialSize, defaultSizeTypes),
+			maxSize
+		),
+		minChunks: options.minChunks,
+		maxAsyncRequests: options.maxAsyncRequests,
+		maxInitialRequests: options.maxInitialRequests,
+		filename: options.filename,
+		idHint: options.idHint,
+		automaticNameDelimiter: options.automaticNameDelimiter,
+		reuseExistingChunk: options.reuseExistingChunk,
+		usedExports: options.usedExports
+	};
+};
+
+module.exports = class SplitChunksPlugin {
+	/**
+	 * @param {OptimizationSplitChunksOptions=} options plugin options
+	 */
+	constructor(options = {}) {
+		const defaultSizeTypes = options.defaultSizeTypes || [
+			"javascript",
+			"unknown"
+		];
+		const fallbackCacheGroup = options.fallbackCacheGroup || {};
+		const minSize = normalizeSizes(options.minSize, defaultSizeTypes);
+		const minSizeReduction = normalizeSizes(
+			options.minSizeReduction,
+			defaultSizeTypes
+		);
+		const maxSize = normalizeSizes(options.maxSize, defaultSizeTypes);
+
+		/** @type {SplitChunksOptions} */
+		this.options = {
+			chunksFilter: normalizeChunksFilter(options.chunks || "all"),
+			defaultSizeTypes,
+			minSize,
+			minSizeReduction,
+			minRemainingSize: mergeSizes(
+				normalizeSizes(options.minRemainingSize, defaultSizeTypes),
+				minSize
+			),
+			enforceSizeThreshold: normalizeSizes(
+				options.enforceSizeThreshold,
+				defaultSizeTypes
+			),
+			maxAsyncSize: mergeSizes(
+				normalizeSizes(options.maxAsyncSize, defaultSizeTypes),
+				maxSize
+			),
+			maxInitialSize: mergeSizes(
+				normalizeSizes(options.maxInitialSize, defaultSizeTypes),
+				maxSize
+			),
+			minChunks: options.minChunks || 1,
+			maxAsyncRequests: options.maxAsyncRequests || 1,
+			maxInitialRequests: options.maxInitialRequests || 1,
+			hidePathInfo: options.hidePathInfo || false,
+			filename: options.filename || undefined,
+			getCacheGroups: normalizeCacheGroups(
+				options.cacheGroups,
+				defaultSizeTypes
+			),
+			getName: options.name ? normalizeName(options.name) : defaultGetName,
+			automaticNameDelimiter: options.automaticNameDelimiter,
+			usedExports: options.usedExports,
+			fallbackCacheGroup: {
+				chunksFilter: normalizeChunksFilter(
+					fallbackCacheGroup.chunks || options.chunks || "all"
+				),
+				minSize: mergeSizes(
+					normalizeSizes(fallbackCacheGroup.minSize, defaultSizeTypes),
+					minSize
+				),
+				maxAsyncSize: mergeSizes(
+					normalizeSizes(fallbackCacheGroup.maxAsyncSize, defaultSizeTypes),
+					normalizeSizes(fallbackCacheGroup.maxSize, defaultSizeTypes),
+					normalizeSizes(options.maxAsyncSize, defaultSizeTypes),
+					normalizeSizes(options.maxSize, defaultSizeTypes)
+				),
+				maxInitialSize: mergeSizes(
+					normalizeSizes(fallbackCacheGroup.maxInitialSize, defaultSizeTypes),
+					normalizeSizes(fallbackCacheGroup.maxSize, defaultSizeTypes),
+					normalizeSizes(options.maxInitialSize, defaultSizeTypes),
+					normalizeSizes(options.maxSize, defaultSizeTypes)
+				),
+				automaticNameDelimiter:
+					fallbackCacheGroup.automaticNameDelimiter ||
+					options.automaticNameDelimiter ||
+					"~"
+			}
+		};
+
+		/** @type {WeakMap<CacheGroupSource, CacheGroup>} */
+		this._cacheGroupCache = new WeakMap();
+	}
+
+	/**
+	 * @param {CacheGroupSource} cacheGroupSource source
+	 * @returns {CacheGroup} the cache group (cached)
+	 */
+	_getCacheGroup(cacheGroupSource) {
+		const cacheEntry = this._cacheGroupCache.get(cacheGroupSource);
+		if (cacheEntry !== undefined) return cacheEntry;
+		const minSize = mergeSizes(
+			cacheGroupSource.minSize,
+			cacheGroupSource.enforce ? undefined : this.options.minSize
+		);
+		const minSizeReduction = mergeSizes(
+			cacheGroupSource.minSizeReduction,
+			cacheGroupSource.enforce ? undefined : this.options.minSizeReduction
+		);
+		const minRemainingSize = mergeSizes(
+			cacheGroupSource.minRemainingSize,
+			cacheGroupSource.enforce ? undefined : this.options.minRemainingSize
+		);
+		const enforceSizeThreshold = mergeSizes(
+			cacheGroupSource.enforceSizeThreshold,
+			cacheGroupSource.enforce ? undefined : this.options.enforceSizeThreshold
+		);
+		const cacheGroup = {
+			key: cacheGroupSource.key,
+			priority: cacheGroupSource.priority || 0,
+			chunksFilter: cacheGroupSource.chunksFilter || this.options.chunksFilter,
+			minSize,
+			minSizeReduction,
+			minRemainingSize,
+			enforceSizeThreshold,
+			maxAsyncSize: mergeSizes(
+				cacheGroupSource.maxAsyncSize,
+				cacheGroupSource.enforce ? undefined : this.options.maxAsyncSize
+			),
+			maxInitialSize: mergeSizes(
+				cacheGroupSource.maxInitialSize,
+				cacheGroupSource.enforce ? undefined : this.options.maxInitialSize
+			),
+			minChunks:
+				cacheGroupSource.minChunks !== undefined
+					? cacheGroupSource.minChunks
+					: cacheGroupSource.enforce
+					? 1
+					: this.options.minChunks,
+			maxAsyncRequests:
+				cacheGroupSource.maxAsyncRequests !== undefined
+					? cacheGroupSource.maxAsyncRequests
+					: cacheGroupSource.enforce
+					? Infinity
+					: this.options.maxAsyncRequests,
+			maxInitialRequests:
+				cacheGroupSource.maxInitialRequests !== undefined
+					? cacheGroupSource.maxInitialRequests
+					: cacheGroupSource.enforce
+					? Infinity
+					: this.options.maxInitialRequests,
+			getName:
+				cacheGroupSource.getName !== undefined
+					? cacheGroupSource.getName
+					: this.options.getName,
+			usedExports:
+				cacheGroupSource.usedExports !== undefined
+					? cacheGroupSource.usedExports
+					: this.options.usedExports,
+			filename:
+				cacheGroupSource.filename !== undefined
+					? cacheGroupSource.filename
+					: this.options.filename,
+			automaticNameDelimiter:
+				cacheGroupSource.automaticNameDelimiter !== undefined
+					? cacheGroupSource.automaticNameDelimiter
+					: this.options.automaticNameDelimiter,
+			idHint:
+				cacheGroupSource.idHint !== undefined
+					? cacheGroupSource.idHint
+					: cacheGroupSource.key,
+			reuseExistingChunk: cacheGroupSource.reuseExistingChunk || false,
+			_validateSize: hasNonZeroSizes(minSize),
+			_validateRemainingSize: hasNonZeroSizes(minRemainingSize),
+			_minSizeForMaxSize: mergeSizes(
+				cacheGroupSource.minSize,
+				this.options.minSize
+			),
+			_conditionalEnforce: hasNonZeroSizes(enforceSizeThreshold)
+		};
+		this._cacheGroupCache.set(cacheGroupSource, cacheGroup);
+		return cacheGroup;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const cachedMakePathsRelative = makePathsRelative.bindContextCache(
+			compiler.context,
+			compiler.root
+		);
+		compiler.hooks.thisCompilation.tap("SplitChunksPlugin", compilation => {
+			const logger = compilation.getLogger("webpack.SplitChunksPlugin");
+			let alreadyOptimized = false;
+			compilation.hooks.unseal.tap("SplitChunksPlugin", () => {
+				alreadyOptimized = false;
+			});
+			compilation.hooks.optimizeChunks.tap(
+				{
+					name: "SplitChunksPlugin",
+					stage: STAGE_ADVANCED
+				},
+				chunks => {
+					if (alreadyOptimized) return;
+					alreadyOptimized = true;
+					logger.time("prepare");
+					const chunkGraph = compilation.chunkGraph;
+					const moduleGraph = compilation.moduleGraph;
+					// Give each selected chunk an index (to create strings from chunks)
+					/** @type {Map<Chunk, bigint>} */
+					const chunkIndexMap = new Map();
+					const ZERO = BigInt("0");
+					const ONE = BigInt("1");
+					const START = ONE << BigInt("31");
+					let index = START;
+					for (const chunk of chunks) {
+						chunkIndexMap.set(
+							chunk,
+							index | BigInt((Math.random() * 0x7fffffff) | 0)
+						);
+						index = index << ONE;
+					}
+					/**
+					 * @param {Iterable<Chunk>} chunks list of chunks
+					 * @returns {bigint | Chunk} key of the chunks
+					 */
+					const getKey = chunks => {
+						const iterator = chunks[Symbol.iterator]();
+						let result = iterator.next();
+						if (result.done) return ZERO;
+						const first = result.value;
+						result = iterator.next();
+						if (result.done) return first;
+						let key =
+							chunkIndexMap.get(first) | chunkIndexMap.get(result.value);
+						while (!(result = iterator.next()).done) {
+							const raw = chunkIndexMap.get(result.value);
+							key = key ^ raw;
+						}
+						return key;
+					};
+					const keyToString = key => {
+						if (typeof key === "bigint") return key.toString(16);
+						return chunkIndexMap.get(key).toString(16);
+					};
+
+					const getChunkSetsInGraph = memoize(() => {
+						/** @type {Map<bigint, Set<Chunk>>} */
+						const chunkSetsInGraph = new Map();
+						/** @type {Set<Chunk>} */
+						const singleChunkSets = new Set();
+						for (const module of compilation.modules) {
+							const chunks = chunkGraph.getModuleChunksIterable(module);
+							const chunksKey = getKey(chunks);
+							if (typeof chunksKey === "bigint") {
+								if (!chunkSetsInGraph.has(chunksKey)) {
+									chunkSetsInGraph.set(chunksKey, new Set(chunks));
+								}
+							} else {
+								singleChunkSets.add(chunksKey);
+							}
+						}
+						return { chunkSetsInGraph, singleChunkSets };
+					});
+
+					/**
+					 * @param {Module} module the module
+					 * @returns {Iterable<Chunk[]>} groups of chunks with equal exports
+					 */
+					const groupChunksByExports = module => {
+						const exportsInfo = moduleGraph.getExportsInfo(module);
+						const groupedByUsedExports = new Map();
+						for (const chunk of chunkGraph.getModuleChunksIterable(module)) {
+							const key = exportsInfo.getUsageKey(chunk.runtime);
+							const list = groupedByUsedExports.get(key);
+							if (list !== undefined) {
+								list.push(chunk);
+							} else {
+								groupedByUsedExports.set(key, [chunk]);
+							}
+						}
+						return groupedByUsedExports.values();
+					};
+
+					/** @type {Map<Module, Iterable<Chunk[]>>} */
+					const groupedByExportsMap = new Map();
+
+					const getExportsChunkSetsInGraph = memoize(() => {
+						/** @type {Map<bigint, Set<Chunk>>} */
+						const chunkSetsInGraph = new Map();
+						/** @type {Set<Chunk>} */
+						const singleChunkSets = new Set();
+						for (const module of compilation.modules) {
+							const groupedChunks = Array.from(groupChunksByExports(module));
+							groupedByExportsMap.set(module, groupedChunks);
+							for (const chunks of groupedChunks) {
+								if (chunks.length === 1) {
+									singleChunkSets.add(chunks[0]);
+								} else {
+									const chunksKey = /** @type {bigint} */ (getKey(chunks));
+									if (!chunkSetsInGraph.has(chunksKey)) {
+										chunkSetsInGraph.set(chunksKey, new Set(chunks));
+									}
+								}
+							}
+						}
+						return { chunkSetsInGraph, singleChunkSets };
+					});
+
+					// group these set of chunks by count
+					// to allow to check less sets via isSubset
+					// (only smaller sets can be subset)
+					const groupChunkSetsByCount = chunkSets => {
+						/** @type {Map<number, Array<Set<Chunk>>>} */
+						const chunkSetsByCount = new Map();
+						for (const chunksSet of chunkSets) {
+							const count = chunksSet.size;
+							let array = chunkSetsByCount.get(count);
+							if (array === undefined) {
+								array = [];
+								chunkSetsByCount.set(count, array);
+							}
+							array.push(chunksSet);
+						}
+						return chunkSetsByCount;
+					};
+					const getChunkSetsByCount = memoize(() =>
+						groupChunkSetsByCount(
+							getChunkSetsInGraph().chunkSetsInGraph.values()
+						)
+					);
+					const getExportsChunkSetsByCount = memoize(() =>
+						groupChunkSetsByCount(
+							getExportsChunkSetsInGraph().chunkSetsInGraph.values()
+						)
+					);
+
+					// Create a list of possible combinations
+					const createGetCombinations = (
+						chunkSets,
+						singleChunkSets,
+						chunkSetsByCount
+					) => {
+						/** @type {Map<bigint | Chunk, (Set<Chunk> | Chunk)[]>} */
+						const combinationsCache = new Map();
+
+						return key => {
+							const cacheEntry = combinationsCache.get(key);
+							if (cacheEntry !== undefined) return cacheEntry;
+							if (key instanceof Chunk) {
+								const result = [key];
+								combinationsCache.set(key, result);
+								return result;
+							}
+							const chunksSet = chunkSets.get(key);
+							/** @type {(Set<Chunk> | Chunk)[]} */
+							const array = [chunksSet];
+							for (const [count, setArray] of chunkSetsByCount) {
+								// "equal" is not needed because they would have been merge in the first step
+								if (count < chunksSet.size) {
+									for (const set of setArray) {
+										if (isSubset(chunksSet, set)) {
+											array.push(set);
+										}
+									}
+								}
+							}
+							for (const chunk of singleChunkSets) {
+								if (chunksSet.has(chunk)) {
+									array.push(chunk);
+								}
+							}
+							combinationsCache.set(key, array);
+							return array;
+						};
+					};
+
+					const getCombinationsFactory = memoize(() => {
+						const { chunkSetsInGraph, singleChunkSets } = getChunkSetsInGraph();
+						return createGetCombinations(
+							chunkSetsInGraph,
+							singleChunkSets,
+							getChunkSetsByCount()
+						);
+					});
+					const getCombinations = key => getCombinationsFactory()(key);
+
+					const getExportsCombinationsFactory = memoize(() => {
+						const { chunkSetsInGraph, singleChunkSets } =
+							getExportsChunkSetsInGraph();
+						return createGetCombinations(
+							chunkSetsInGraph,
+							singleChunkSets,
+							getExportsChunkSetsByCount()
+						);
+					});
+					const getExportsCombinations = key =>
+						getExportsCombinationsFactory()(key);
+
+					/**
+					 * @typedef {Object} SelectedChunksResult
+					 * @property {Chunk[]} chunks the list of chunks
+					 * @property {bigint | Chunk} key a key of the list
+					 */
+
+					/** @type {WeakMap<Set<Chunk> | Chunk, WeakMap<ChunkFilterFunction, SelectedChunksResult>>} */
+					const selectedChunksCacheByChunksSet = new WeakMap();
+
+					/**
+					 * get list and key by applying the filter function to the list
+					 * It is cached for performance reasons
+					 * @param {Set<Chunk> | Chunk} chunks list of chunks
+					 * @param {ChunkFilterFunction} chunkFilter filter function for chunks
+					 * @returns {SelectedChunksResult} list and key
+					 */
+					const getSelectedChunks = (chunks, chunkFilter) => {
+						let entry = selectedChunksCacheByChunksSet.get(chunks);
+						if (entry === undefined) {
+							entry = new WeakMap();
+							selectedChunksCacheByChunksSet.set(chunks, entry);
+						}
+						/** @type {SelectedChunksResult} */
+						let entry2 = entry.get(chunkFilter);
+						if (entry2 === undefined) {
+							/** @type {Chunk[]} */
+							const selectedChunks = [];
+							if (chunks instanceof Chunk) {
+								if (chunkFilter(chunks)) selectedChunks.push(chunks);
+							} else {
+								for (const chunk of chunks) {
+									if (chunkFilter(chunk)) selectedChunks.push(chunk);
+								}
+							}
+							entry2 = {
+								chunks: selectedChunks,
+								key: getKey(selectedChunks)
+							};
+							entry.set(chunkFilter, entry2);
+						}
+						return entry2;
+					};
+
+					/** @type {Map<string, boolean>} */
+					const alreadyValidatedParents = new Map();
+					/** @type {Set<string>} */
+					const alreadyReportedErrors = new Set();
+
+					// Map a list of chunks to a list of modules
+					// For the key the chunk "index" is used, the value is a SortableSet of modules
+					/** @type {Map<string, ChunksInfoItem>} */
+					const chunksInfoMap = new Map();
+
+					/**
+					 * @param {CacheGroup} cacheGroup the current cache group
+					 * @param {number} cacheGroupIndex the index of the cache group of ordering
+					 * @param {Chunk[]} selectedChunks chunks selected for this module
+					 * @param {bigint | Chunk} selectedChunksKey a key of selectedChunks
+					 * @param {Module} module the current module
+					 * @returns {void}
+					 */
+					const addModuleToChunksInfoMap = (
+						cacheGroup,
+						cacheGroupIndex,
+						selectedChunks,
+						selectedChunksKey,
+						module
+					) => {
+						// Break if minimum number of chunks is not reached
+						if (selectedChunks.length < cacheGroup.minChunks) return;
+						// Determine name for split chunk
+						const name = cacheGroup.getName(
+							module,
+							selectedChunks,
+							cacheGroup.key
+						);
+						// Check if the name is ok
+						const existingChunk = compilation.namedChunks.get(name);
+						if (existingChunk) {
+							const parentValidationKey = `${name}|${
+								typeof selectedChunksKey === "bigint"
+									? selectedChunksKey
+									: selectedChunksKey.debugId
+							}`;
+							const valid = alreadyValidatedParents.get(parentValidationKey);
+							if (valid === false) return;
+							if (valid === undefined) {
+								// Module can only be moved into the existing chunk if the existing chunk
+								// is a parent of all selected chunks
+								let isInAllParents = true;
+								/** @type {Set<ChunkGroup>} */
+								const queue = new Set();
+								for (const chunk of selectedChunks) {
+									for (const group of chunk.groupsIterable) {
+										queue.add(group);
+									}
+								}
+								for (const group of queue) {
+									if (existingChunk.isInGroup(group)) continue;
+									let hasParent = false;
+									for (const parent of group.parentsIterable) {
+										hasParent = true;
+										queue.add(parent);
+									}
+									if (!hasParent) {
+										isInAllParents = false;
+									}
+								}
+								const valid = isInAllParents;
+								alreadyValidatedParents.set(parentValidationKey, valid);
+								if (!valid) {
+									if (!alreadyReportedErrors.has(name)) {
+										alreadyReportedErrors.add(name);
+										compilation.errors.push(
+											new WebpackError(
+												"SplitChunksPlugin\n" +
+													`Cache group "${cacheGroup.key}" conflicts with existing chunk.\n` +
+													`Both have the same name "${name}" and existing chunk is not a parent of the selected modules.\n` +
+													"Use a different name for the cache group or make sure that the existing chunk is a parent (e. g. via dependOn).\n" +
+													'HINT: You can omit "name" to automatically create a name.\n' +
+													"BREAKING CHANGE: webpack < 5 used to allow to use an entrypoint as splitChunk. " +
+													"This is no longer allowed when the entrypoint is not a parent of the selected modules.\n" +
+													"Remove this entrypoint and add modules to cache group's 'test' instead. " +
+													"If you need modules to be evaluated on startup, add them to the existing entrypoints (make them arrays). " +
+													"See migration guide of more info."
+											)
+										);
+									}
+									return;
+								}
+							}
+						}
+						// Create key for maps
+						// When it has a name we use the name as key
+						// Otherwise we create the key from chunks and cache group key
+						// This automatically merges equal names
+						const key =
+							cacheGroup.key +
+							(name
+								? ` name:${name}`
+								: ` chunks:${keyToString(selectedChunksKey)}`);
+						// Add module to maps
+						let info = chunksInfoMap.get(key);
+						if (info === undefined) {
+							chunksInfoMap.set(
+								key,
+								(info = {
+									modules: new SortableSet(
+										undefined,
+										compareModulesByIdentifier
+									),
+									cacheGroup,
+									cacheGroupIndex,
+									name,
+									sizes: {},
+									chunks: new Set(),
+									reuseableChunks: new Set(),
+									chunksKeys: new Set()
+								})
+							);
+						}
+						const oldSize = info.modules.size;
+						info.modules.add(module);
+						if (info.modules.size !== oldSize) {
+							for (const type of module.getSourceTypes()) {
+								info.sizes[type] = (info.sizes[type] || 0) + module.size(type);
+							}
+						}
+						const oldChunksKeysSize = info.chunksKeys.size;
+						info.chunksKeys.add(selectedChunksKey);
+						if (oldChunksKeysSize !== info.chunksKeys.size) {
+							for (const chunk of selectedChunks) {
+								info.chunks.add(chunk);
+							}
+						}
+					};
+
+					const context = {
+						moduleGraph,
+						chunkGraph
+					};
+
+					logger.timeEnd("prepare");
+
+					logger.time("modules");
+
+					// Walk through all modules
+					for (const module of compilation.modules) {
+						// Get cache group
+						let cacheGroups = this.options.getCacheGroups(module, context);
+						if (!Array.isArray(cacheGroups) || cacheGroups.length === 0) {
+							continue;
+						}
+
+						// Prepare some values (usedExports = false)
+						const getCombs = memoize(() => {
+							const chunks = chunkGraph.getModuleChunksIterable(module);
+							const chunksKey = getKey(chunks);
+							return getCombinations(chunksKey);
+						});
+
+						// Prepare some values (usedExports = true)
+						const getCombsByUsedExports = memoize(() => {
+							// fill the groupedByExportsMap
+							getExportsChunkSetsInGraph();
+							/** @type {Set<Set<Chunk> | Chunk>} */
+							const set = new Set();
+							const groupedByUsedExports = groupedByExportsMap.get(module);
+							for (const chunks of groupedByUsedExports) {
+								const chunksKey = getKey(chunks);
+								for (const comb of getExportsCombinations(chunksKey))
+									set.add(comb);
+							}
+							return set;
+						});
+
+						let cacheGroupIndex = 0;
+						for (const cacheGroupSource of cacheGroups) {
+							const cacheGroup = this._getCacheGroup(cacheGroupSource);
+
+							const combs = cacheGroup.usedExports
+								? getCombsByUsedExports()
+								: getCombs();
+							// For all combination of chunk selection
+							for (const chunkCombination of combs) {
+								// Break if minimum number of chunks is not reached
+								const count =
+									chunkCombination instanceof Chunk ? 1 : chunkCombination.size;
+								if (count < cacheGroup.minChunks) continue;
+								// Select chunks by configuration
+								const { chunks: selectedChunks, key: selectedChunksKey } =
+									getSelectedChunks(chunkCombination, cacheGroup.chunksFilter);
+
+								addModuleToChunksInfoMap(
+									cacheGroup,
+									cacheGroupIndex,
+									selectedChunks,
+									selectedChunksKey,
+									module
+								);
+							}
+							cacheGroupIndex++;
+						}
+					}
+
+					logger.timeEnd("modules");
+
+					logger.time("queue");
+
+					/**
+					 * @param {ChunksInfoItem} info entry
+					 * @param {string[]} sourceTypes source types to be removed
+					 */
+					const removeModulesWithSourceType = (info, sourceTypes) => {
+						for (const module of info.modules) {
+							const types = module.getSourceTypes();
+							if (sourceTypes.some(type => types.has(type))) {
+								info.modules.delete(module);
+								for (const type of types) {
+									info.sizes[type] -= module.size(type);
+								}
+							}
+						}
+					};
+
+					/**
+					 * @param {ChunksInfoItem} info entry
+					 * @returns {boolean} true, if entry become empty
+					 */
+					const removeMinSizeViolatingModules = info => {
+						if (!info.cacheGroup._validateSize) return false;
+						const violatingSizes = getViolatingMinSizes(
+							info.sizes,
+							info.cacheGroup.minSize
+						);
+						if (violatingSizes === undefined) return false;
+						removeModulesWithSourceType(info, violatingSizes);
+						return info.modules.size === 0;
+					};
+
+					// Filter items were size < minSize
+					for (const [key, info] of chunksInfoMap) {
+						if (removeMinSizeViolatingModules(info)) {
+							chunksInfoMap.delete(key);
+						} else if (
+							!checkMinSizeReduction(
+								info.sizes,
+								info.cacheGroup.minSizeReduction,
+								info.chunks.size
+							)
+						) {
+							chunksInfoMap.delete(key);
+						}
+					}
+
+					/**
+					 * @typedef {Object} MaxSizeQueueItem
+					 * @property {SplitChunksSizes} minSize
+					 * @property {SplitChunksSizes} maxAsyncSize
+					 * @property {SplitChunksSizes} maxInitialSize
+					 * @property {string} automaticNameDelimiter
+					 * @property {string[]} keys
+					 */
+
+					/** @type {Map<Chunk, MaxSizeQueueItem>} */
+					const maxSizeQueueMap = new Map();
+
+					while (chunksInfoMap.size > 0) {
+						// Find best matching entry
+						let bestEntryKey;
+						let bestEntry;
+						for (const pair of chunksInfoMap) {
+							const key = pair[0];
+							const info = pair[1];
+							if (
+								bestEntry === undefined ||
+								compareEntries(bestEntry, info) < 0
+							) {
+								bestEntry = info;
+								bestEntryKey = key;
+							}
+						}
+
+						const item = bestEntry;
+						chunksInfoMap.delete(bestEntryKey);
+
+						let chunkName = item.name;
+						// Variable for the new chunk (lazy created)
+						/** @type {Chunk} */
+						let newChunk;
+						// When no chunk name, check if we can reuse a chunk instead of creating a new one
+						let isExistingChunk = false;
+						let isReusedWithAllModules = false;
+						if (chunkName) {
+							const chunkByName = compilation.namedChunks.get(chunkName);
+							if (chunkByName !== undefined) {
+								newChunk = chunkByName;
+								const oldSize = item.chunks.size;
+								item.chunks.delete(newChunk);
+								isExistingChunk = item.chunks.size !== oldSize;
+							}
+						} else if (item.cacheGroup.reuseExistingChunk) {
+							outer: for (const chunk of item.chunks) {
+								if (
+									chunkGraph.getNumberOfChunkModules(chunk) !==
+									item.modules.size
+								) {
+									continue;
+								}
+								if (
+									item.chunks.size > 1 &&
+									chunkGraph.getNumberOfEntryModules(chunk) > 0
+								) {
+									continue;
+								}
+								for (const module of item.modules) {
+									if (!chunkGraph.isModuleInChunk(module, chunk)) {
+										continue outer;
+									}
+								}
+								if (!newChunk || !newChunk.name) {
+									newChunk = chunk;
+								} else if (
+									chunk.name &&
+									chunk.name.length < newChunk.name.length
+								) {
+									newChunk = chunk;
+								} else if (
+									chunk.name &&
+									chunk.name.length === newChunk.name.length &&
+									chunk.name < newChunk.name
+								) {
+									newChunk = chunk;
+								}
+							}
+							if (newChunk) {
+								item.chunks.delete(newChunk);
+								chunkName = undefined;
+								isExistingChunk = true;
+								isReusedWithAllModules = true;
+							}
+						}
+
+						const enforced =
+							item.cacheGroup._conditionalEnforce &&
+							checkMinSize(item.sizes, item.cacheGroup.enforceSizeThreshold);
+
+						const usedChunks = new Set(item.chunks);
+
+						// Check if maxRequests condition can be fulfilled
+						if (
+							!enforced &&
+							(Number.isFinite(item.cacheGroup.maxInitialRequests) ||
+								Number.isFinite(item.cacheGroup.maxAsyncRequests))
+						) {
+							for (const chunk of usedChunks) {
+								// respect max requests
+								const maxRequests = chunk.isOnlyInitial()
+									? item.cacheGroup.maxInitialRequests
+									: chunk.canBeInitial()
+									? Math.min(
+											item.cacheGroup.maxInitialRequests,
+											item.cacheGroup.maxAsyncRequests
+									  )
+									: item.cacheGroup.maxAsyncRequests;
+								if (
+									isFinite(maxRequests) &&
+									getRequests(chunk) >= maxRequests
+								) {
+									usedChunks.delete(chunk);
+								}
+							}
+						}
+
+						outer: for (const chunk of usedChunks) {
+							for (const module of item.modules) {
+								if (chunkGraph.isModuleInChunk(module, chunk)) continue outer;
+							}
+							usedChunks.delete(chunk);
+						}
+
+						// Were some (invalid) chunks removed from usedChunks?
+						// => readd all modules to the queue, as things could have been changed
+						if (usedChunks.size < item.chunks.size) {
+							if (isExistingChunk) usedChunks.add(newChunk);
+							if (usedChunks.size >= item.cacheGroup.minChunks) {
+								const chunksArr = Array.from(usedChunks);
+								for (const module of item.modules) {
+									addModuleToChunksInfoMap(
+										item.cacheGroup,
+										item.cacheGroupIndex,
+										chunksArr,
+										getKey(usedChunks),
+										module
+									);
+								}
+							}
+							continue;
+						}
+
+						// Validate minRemainingSize constraint when a single chunk is left over
+						if (
+							!enforced &&
+							item.cacheGroup._validateRemainingSize &&
+							usedChunks.size === 1
+						) {
+							const [chunk] = usedChunks;
+							let chunkSizes = Object.create(null);
+							for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+								if (!item.modules.has(module)) {
+									for (const type of module.getSourceTypes()) {
+										chunkSizes[type] =
+											(chunkSizes[type] || 0) + module.size(type);
+									}
+								}
+							}
+							const violatingSizes = getViolatingMinSizes(
+								chunkSizes,
+								item.cacheGroup.minRemainingSize
+							);
+							if (violatingSizes !== undefined) {
+								const oldModulesSize = item.modules.size;
+								removeModulesWithSourceType(item, violatingSizes);
+								if (
+									item.modules.size > 0 &&
+									item.modules.size !== oldModulesSize
+								) {
+									// queue this item again to be processed again
+									// without violating modules
+									chunksInfoMap.set(bestEntryKey, item);
+								}
+								continue;
+							}
+						}
+
+						// Create the new chunk if not reusing one
+						if (newChunk === undefined) {
+							newChunk = compilation.addChunk(chunkName);
+						}
+						// Walk through all chunks
+						for (const chunk of usedChunks) {
+							// Add graph connections for splitted chunk
+							chunk.split(newChunk);
+						}
+
+						// Add a note to the chunk
+						newChunk.chunkReason =
+							(newChunk.chunkReason ? newChunk.chunkReason + ", " : "") +
+							(isReusedWithAllModules
+								? "reused as split chunk"
+								: "split chunk");
+						if (item.cacheGroup.key) {
+							newChunk.chunkReason += ` (cache group: ${item.cacheGroup.key})`;
+						}
+						if (chunkName) {
+							newChunk.chunkReason += ` (name: ${chunkName})`;
+						}
+						if (item.cacheGroup.filename) {
+							newChunk.filenameTemplate = item.cacheGroup.filename;
+						}
+						if (item.cacheGroup.idHint) {
+							newChunk.idNameHints.add(item.cacheGroup.idHint);
+						}
+						if (!isReusedWithAllModules) {
+							// Add all modules to the new chunk
+							for (const module of item.modules) {
+								if (!module.chunkCondition(newChunk, compilation)) continue;
+								// Add module to new chunk
+								chunkGraph.connectChunkAndModule(newChunk, module);
+								// Remove module from used chunks
+								for (const chunk of usedChunks) {
+									chunkGraph.disconnectChunkAndModule(chunk, module);
+								}
+							}
+						} else {
+							// Remove all modules from used chunks
+							for (const module of item.modules) {
+								for (const chunk of usedChunks) {
+									chunkGraph.disconnectChunkAndModule(chunk, module);
+								}
+							}
+						}
+
+						if (
+							Object.keys(item.cacheGroup.maxAsyncSize).length > 0 ||
+							Object.keys(item.cacheGroup.maxInitialSize).length > 0
+						) {
+							const oldMaxSizeSettings = maxSizeQueueMap.get(newChunk);
+							maxSizeQueueMap.set(newChunk, {
+								minSize: oldMaxSizeSettings
+									? combineSizes(
+											oldMaxSizeSettings.minSize,
+											item.cacheGroup._minSizeForMaxSize,
+											Math.max
+									  )
+									: item.cacheGroup.minSize,
+								maxAsyncSize: oldMaxSizeSettings
+									? combineSizes(
+											oldMaxSizeSettings.maxAsyncSize,
+											item.cacheGroup.maxAsyncSize,
+											Math.min
+									  )
+									: item.cacheGroup.maxAsyncSize,
+								maxInitialSize: oldMaxSizeSettings
+									? combineSizes(
+											oldMaxSizeSettings.maxInitialSize,
+											item.cacheGroup.maxInitialSize,
+											Math.min
+									  )
+									: item.cacheGroup.maxInitialSize,
+								automaticNameDelimiter: item.cacheGroup.automaticNameDelimiter,
+								keys: oldMaxSizeSettings
+									? oldMaxSizeSettings.keys.concat(item.cacheGroup.key)
+									: [item.cacheGroup.key]
+							});
+						}
+
+						// remove all modules from other entries and update size
+						for (const [key, info] of chunksInfoMap) {
+							if (isOverlap(info.chunks, usedChunks)) {
+								// update modules and total size
+								// may remove it from the map when < minSize
+								let updated = false;
+								for (const module of item.modules) {
+									if (info.modules.has(module)) {
+										// remove module
+										info.modules.delete(module);
+										// update size
+										for (const key of module.getSourceTypes()) {
+											info.sizes[key] -= module.size(key);
+										}
+										updated = true;
+									}
+								}
+								if (updated) {
+									if (info.modules.size === 0) {
+										chunksInfoMap.delete(key);
+										continue;
+									}
+									if (
+										removeMinSizeViolatingModules(info) ||
+										!checkMinSizeReduction(
+											info.sizes,
+											info.cacheGroup.minSizeReduction,
+											info.chunks.size
+										)
+									) {
+										chunksInfoMap.delete(key);
+										continue;
+									}
+								}
+							}
+						}
+					}
+
+					logger.timeEnd("queue");
+
+					logger.time("maxSize");
+
+					/** @type {Set<string>} */
+					const incorrectMinMaxSizeSet = new Set();
+
+					const { outputOptions } = compilation;
+
+					// Make sure that maxSize is fulfilled
+					const { fallbackCacheGroup } = this.options;
+					for (const chunk of Array.from(compilation.chunks)) {
+						const chunkConfig = maxSizeQueueMap.get(chunk);
+						const {
+							minSize,
+							maxAsyncSize,
+							maxInitialSize,
+							automaticNameDelimiter
+						} = chunkConfig || fallbackCacheGroup;
+						if (!chunkConfig && !fallbackCacheGroup.chunksFilter(chunk))
+							continue;
+						/** @type {SplitChunksSizes} */
+						let maxSize;
+						if (chunk.isOnlyInitial()) {
+							maxSize = maxInitialSize;
+						} else if (chunk.canBeInitial()) {
+							maxSize = combineSizes(maxAsyncSize, maxInitialSize, Math.min);
+						} else {
+							maxSize = maxAsyncSize;
+						}
+						if (Object.keys(maxSize).length === 0) {
+							continue;
+						}
+						for (const key of Object.keys(maxSize)) {
+							const maxSizeValue = maxSize[key];
+							const minSizeValue = minSize[key];
+							if (
+								typeof minSizeValue === "number" &&
+								minSizeValue > maxSizeValue
+							) {
+								const keys = chunkConfig && chunkConfig.keys;
+								const warningKey = `${
+									keys && keys.join()
+								} ${minSizeValue} ${maxSizeValue}`;
+								if (!incorrectMinMaxSizeSet.has(warningKey)) {
+									incorrectMinMaxSizeSet.add(warningKey);
+									compilation.warnings.push(
+										new MinMaxSizeWarning(keys, minSizeValue, maxSizeValue)
+									);
+								}
+							}
+						}
+						const results = deterministicGroupingForModules({
+							minSize,
+							maxSize: mapObject(maxSize, (value, key) => {
+								const minSizeValue = minSize[key];
+								return typeof minSizeValue === "number"
+									? Math.max(value, minSizeValue)
+									: value;
+							}),
+							items: chunkGraph.getChunkModulesIterable(chunk),
+							getKey(module) {
+								const cache = getKeyCache.get(module);
+								if (cache !== undefined) return cache;
+								const ident = cachedMakePathsRelative(module.identifier());
+								const nameForCondition =
+									module.nameForCondition && module.nameForCondition();
+								const name = nameForCondition
+									? cachedMakePathsRelative(nameForCondition)
+									: ident.replace(/^.*!|\?[^?!]*$/g, "");
+								const fullKey =
+									name +
+									automaticNameDelimiter +
+									hashFilename(ident, outputOptions);
+								const key = requestToId(fullKey);
+								getKeyCache.set(module, key);
+								return key;
+							},
+							getSize(module) {
+								const size = Object.create(null);
+								for (const key of module.getSourceTypes()) {
+									size[key] = module.size(key);
+								}
+								return size;
+							}
+						});
+						if (results.length <= 1) {
+							continue;
+						}
+						for (let i = 0; i < results.length; i++) {
+							const group = results[i];
+							const key = this.options.hidePathInfo
+								? hashFilename(group.key, outputOptions)
+								: group.key;
+							let name = chunk.name
+								? chunk.name + automaticNameDelimiter + key
+								: null;
+							if (name && name.length > 100) {
+								name =
+									name.slice(0, 100) +
+									automaticNameDelimiter +
+									hashFilename(name, outputOptions);
+							}
+							if (i !== results.length - 1) {
+								const newPart = compilation.addChunk(name);
+								chunk.split(newPart);
+								newPart.chunkReason = chunk.chunkReason;
+								// Add all modules to the new chunk
+								for (const module of group.items) {
+									if (!module.chunkCondition(newPart, compilation)) {
+										continue;
+									}
+									// Add module to new chunk
+									chunkGraph.connectChunkAndModule(newPart, module);
+									// Remove module from used chunks
+									chunkGraph.disconnectChunkAndModule(chunk, module);
+								}
+							} else {
+								// change the chunk to be a part
+								chunk.name = name;
+							}
+						}
+					}
+					logger.timeEnd("maxSize");
+				}
+			);
+		});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/performance/AssetsOverSizeLimitWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/AssetsOverSizeLimitWarning.js
new file mode 100644
index 0000000..5b414fc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/AssetsOverSizeLimitWarning.js
@@ -0,0 +1,32 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+const { formatSize } = require("../SizeFormatHelpers");
+const WebpackError = require("../WebpackError");
+
+/** @typedef {import("./SizeLimitsPlugin").AssetDetails} AssetDetails */
+
+module.exports = class AssetsOverSizeLimitWarning extends WebpackError {
+	/**
+	 * @param {AssetDetails[]} assetsOverSizeLimit the assets
+	 * @param {number} assetLimit the size limit
+	 */
+	constructor(assetsOverSizeLimit, assetLimit) {
+		const assetLists = assetsOverSizeLimit
+			.map(asset => `\n  ${asset.name} (${formatSize(asset.size)})`)
+			.join("");
+
+		super(`asset size limit: The following asset(s) exceed the recommended size limit (${formatSize(
+			assetLimit
+		)}).
+This can impact web performance.
+Assets: ${assetLists}`);
+
+		this.name = "AssetsOverSizeLimitWarning";
+		this.assets = assetsOverSizeLimit;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/performance/EntrypointsOverSizeLimitWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/EntrypointsOverSizeLimitWarning.js
new file mode 100644
index 0000000..270e8aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/EntrypointsOverSizeLimitWarning.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+const { formatSize } = require("../SizeFormatHelpers");
+const WebpackError = require("../WebpackError");
+
+/** @typedef {import("./SizeLimitsPlugin").EntrypointDetails} EntrypointDetails */
+
+module.exports = class EntrypointsOverSizeLimitWarning extends WebpackError {
+	/**
+	 * @param {EntrypointDetails[]} entrypoints the entrypoints
+	 * @param {number} entrypointLimit the size limit
+	 */
+	constructor(entrypoints, entrypointLimit) {
+		const entrypointList = entrypoints
+			.map(
+				entrypoint =>
+					`\n  ${entrypoint.name} (${formatSize(
+						entrypoint.size
+					)})\n${entrypoint.files.map(asset => `      ${asset}`).join("\n")}`
+			)
+			.join("");
+		super(`entrypoint size limit: The following entrypoint(s) combined asset size exceeds the recommended limit (${formatSize(
+			entrypointLimit
+		)}). This can impact web performance.
+Entrypoints:${entrypointList}\n`);
+
+		this.name = "EntrypointsOverSizeLimitWarning";
+		this.entrypoints = entrypoints;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/performance/NoAsyncChunksWarning.js b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/NoAsyncChunksWarning.js
new file mode 100644
index 0000000..a7319d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/NoAsyncChunksWarning.js
@@ -0,0 +1,20 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+
+module.exports = class NoAsyncChunksWarning extends WebpackError {
+	constructor() {
+		super(
+			"webpack performance recommendations: \n" +
+				"You can limit the size of your bundles by using import() or require.ensure to lazy load some parts of your application.\n" +
+				"For more info visit https://webpack.js.org/guides/code-splitting/"
+		);
+
+		this.name = "NoAsyncChunksWarning";
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/performance/SizeLimitsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/SizeLimitsPlugin.js
new file mode 100644
index 0000000..afbca68
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/performance/SizeLimitsPlugin.js
@@ -0,0 +1,165 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+
+"use strict";
+
+const { find } = require("../util/SetHelpers");
+const AssetsOverSizeLimitWarning = require("./AssetsOverSizeLimitWarning");
+const EntrypointsOverSizeLimitWarning = require("./EntrypointsOverSizeLimitWarning");
+const NoAsyncChunksWarning = require("./NoAsyncChunksWarning");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../../declarations/WebpackOptions").PerformanceOptions} PerformanceOptions */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Entrypoint")} Entrypoint */
+/** @typedef {import("../WebpackError")} WebpackError */
+
+/**
+ * @typedef {Object} AssetDetails
+ * @property {string} name
+ * @property {number} size
+ */
+
+/**
+ * @typedef {Object} EntrypointDetails
+ * @property {string} name
+ * @property {number} size
+ * @property {string[]} files
+ */
+
+const isOverSizeLimitSet = new WeakSet();
+
+const excludeSourceMap = (name, source, info) => !info.development;
+
+module.exports = class SizeLimitsPlugin {
+	/**
+	 * @param {PerformanceOptions} options the plugin options
+	 */
+	constructor(options) {
+		this.hints = options.hints;
+		this.maxAssetSize = options.maxAssetSize;
+		this.maxEntrypointSize = options.maxEntrypointSize;
+		this.assetFilter = options.assetFilter;
+	}
+
+	/**
+	 * @param {ChunkGroup | Source} thing the resource to test
+	 * @returns {boolean} true if over the limit
+	 */
+	static isOverSizeLimit(thing) {
+		return isOverSizeLimitSet.has(thing);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const entrypointSizeLimit = this.maxEntrypointSize;
+		const assetSizeLimit = this.maxAssetSize;
+		const hints = this.hints;
+		const assetFilter = this.assetFilter || excludeSourceMap;
+
+		compiler.hooks.afterEmit.tap("SizeLimitsPlugin", compilation => {
+			/** @type {WebpackError[]} */
+			const warnings = [];
+
+			/**
+			 * @param {Entrypoint} entrypoint an entrypoint
+			 * @returns {number} the size of the entrypoint
+			 */
+			const getEntrypointSize = entrypoint => {
+				let size = 0;
+				for (const file of entrypoint.getFiles()) {
+					const asset = compilation.getAsset(file);
+					if (
+						asset &&
+						assetFilter(asset.name, asset.source, asset.info) &&
+						asset.source
+					) {
+						size += asset.info.size || asset.source.size();
+					}
+				}
+				return size;
+			};
+
+			/** @type {AssetDetails[]} */
+			const assetsOverSizeLimit = [];
+			for (const { name, source, info } of compilation.getAssets()) {
+				if (!assetFilter(name, source, info) || !source) {
+					continue;
+				}
+
+				const size = info.size || source.size();
+				if (size > assetSizeLimit) {
+					assetsOverSizeLimit.push({
+						name,
+						size
+					});
+					isOverSizeLimitSet.add(source);
+				}
+			}
+
+			const fileFilter = name => {
+				const asset = compilation.getAsset(name);
+				return asset && assetFilter(asset.name, asset.source, asset.info);
+			};
+
+			/** @type {EntrypointDetails[]} */
+			const entrypointsOverLimit = [];
+			for (const [name, entry] of compilation.entrypoints) {
+				const size = getEntrypointSize(entry);
+
+				if (size > entrypointSizeLimit) {
+					entrypointsOverLimit.push({
+						name: name,
+						size: size,
+						files: entry.getFiles().filter(fileFilter)
+					});
+					isOverSizeLimitSet.add(entry);
+				}
+			}
+
+			if (hints) {
+				// 1. Individual Chunk: Size < 250kb
+				// 2. Collective Initial Chunks [entrypoint] (Each Set?): Size < 250kb
+				// 3. No Async Chunks
+				// if !1, then 2, if !2 return
+				if (assetsOverSizeLimit.length > 0) {
+					warnings.push(
+						new AssetsOverSizeLimitWarning(assetsOverSizeLimit, assetSizeLimit)
+					);
+				}
+				if (entrypointsOverLimit.length > 0) {
+					warnings.push(
+						new EntrypointsOverSizeLimitWarning(
+							entrypointsOverLimit,
+							entrypointSizeLimit
+						)
+					);
+				}
+
+				if (warnings.length > 0) {
+					const someAsyncChunk = find(
+						compilation.chunks,
+						chunk => !chunk.canBeInitial()
+					);
+
+					if (!someAsyncChunk) {
+						warnings.push(new NoAsyncChunksWarning());
+					}
+
+					if (hints === "error") {
+						compilation.errors.push(...warnings);
+					} else {
+						compilation.warnings.push(...warnings);
+					}
+				}
+			}
+		});
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchFunctionRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchFunctionRuntimeModule.js
new file mode 100644
index 0000000..1924294
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchFunctionRuntimeModule.js
@@ -0,0 +1,44 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+
+class ChunkPrefetchFunctionRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {string} childType TODO
+	 * @param {string} runtimeFunction TODO
+	 * @param {string} runtimeHandlers TODO
+	 */
+	constructor(childType, runtimeFunction, runtimeHandlers) {
+		super(`chunk ${childType} function`);
+		this.childType = childType;
+		this.runtimeFunction = runtimeFunction;
+		this.runtimeHandlers = runtimeHandlers;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeFunction, runtimeHandlers } = this;
+		const { runtimeTemplate } = this.compilation;
+		return Template.asString([
+			`${runtimeHandlers} = {};`,
+			`${runtimeFunction} = ${runtimeTemplate.basicFunction("chunkId", [
+				// map is shorter than forEach
+				`Object.keys(${runtimeHandlers}).map(${runtimeTemplate.basicFunction(
+					"key",
+					`${runtimeHandlers}[key](chunkId);`
+				)});`
+			])}`
+		]);
+	}
+}
+
+module.exports = ChunkPrefetchFunctionRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchPreloadPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchPreloadPlugin.js
new file mode 100644
index 0000000..2bcb8b4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchPreloadPlugin.js
@@ -0,0 +1,95 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const ChunkPrefetchFunctionRuntimeModule = require("./ChunkPrefetchFunctionRuntimeModule");
+const ChunkPrefetchStartupRuntimeModule = require("./ChunkPrefetchStartupRuntimeModule");
+const ChunkPrefetchTriggerRuntimeModule = require("./ChunkPrefetchTriggerRuntimeModule");
+const ChunkPreloadTriggerRuntimeModule = require("./ChunkPreloadTriggerRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ChunkPrefetchPreloadPlugin {
+	/**
+	 * @param {Compiler} compiler the compiler
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"ChunkPrefetchPreloadPlugin",
+			compilation => {
+				compilation.hooks.additionalChunkRuntimeRequirements.tap(
+					"ChunkPrefetchPreloadPlugin",
+					(chunk, set, { chunkGraph }) => {
+						if (chunkGraph.getNumberOfEntryModules(chunk) === 0) return;
+						const startupChildChunks = chunk.getChildrenOfTypeInOrder(
+							chunkGraph,
+							"prefetchOrder"
+						);
+						if (startupChildChunks) {
+							set.add(RuntimeGlobals.prefetchChunk);
+							set.add(RuntimeGlobals.onChunksLoaded);
+							compilation.addRuntimeModule(
+								chunk,
+								new ChunkPrefetchStartupRuntimeModule(startupChildChunks)
+							);
+						}
+					}
+				);
+				compilation.hooks.additionalTreeRuntimeRequirements.tap(
+					"ChunkPrefetchPreloadPlugin",
+					(chunk, set, { chunkGraph }) => {
+						const chunkMap = chunk.getChildIdsByOrdersMap(chunkGraph, false);
+
+						if (chunkMap.prefetch) {
+							set.add(RuntimeGlobals.prefetchChunk);
+							compilation.addRuntimeModule(
+								chunk,
+								new ChunkPrefetchTriggerRuntimeModule(chunkMap.prefetch)
+							);
+						}
+						if (chunkMap.preload) {
+							set.add(RuntimeGlobals.preloadChunk);
+							compilation.addRuntimeModule(
+								chunk,
+								new ChunkPreloadTriggerRuntimeModule(chunkMap.preload)
+							);
+						}
+					}
+				);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.prefetchChunk)
+					.tap("ChunkPrefetchPreloadPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(
+							chunk,
+							new ChunkPrefetchFunctionRuntimeModule(
+								"prefetch",
+								RuntimeGlobals.prefetchChunk,
+								RuntimeGlobals.prefetchChunkHandlers
+							)
+						);
+						set.add(RuntimeGlobals.prefetchChunkHandlers);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.preloadChunk)
+					.tap("ChunkPrefetchPreloadPlugin", (chunk, set) => {
+						compilation.addRuntimeModule(
+							chunk,
+							new ChunkPrefetchFunctionRuntimeModule(
+								"preload",
+								RuntimeGlobals.preloadChunk,
+								RuntimeGlobals.preloadChunkHandlers
+							)
+						);
+						set.add(RuntimeGlobals.preloadChunkHandlers);
+					});
+			}
+		);
+	}
+}
+
+module.exports = ChunkPrefetchPreloadPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchStartupRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchStartupRuntimeModule.js
new file mode 100644
index 0000000..e2cb3a8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchStartupRuntimeModule.js
@@ -0,0 +1,52 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+
+class ChunkPrefetchStartupRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {{ onChunks: Chunk[], chunks: Set<Chunk> }[]} startupChunks chunk ids to trigger when chunks are loaded
+	 */
+	constructor(startupChunks) {
+		super("startup prefetch", RuntimeModule.STAGE_TRIGGER);
+		this.startupChunks = startupChunks;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { startupChunks, chunk } = this;
+		const { runtimeTemplate } = this.compilation;
+		return Template.asString(
+			startupChunks.map(
+				({ onChunks, chunks }) =>
+					`${RuntimeGlobals.onChunksLoaded}(0, ${JSON.stringify(
+						// This need to include itself to delay execution after this chunk has been fully loaded
+						onChunks.filter(c => c === chunk).map(c => c.id)
+					)}, ${runtimeTemplate.basicFunction(
+						"",
+						chunks.size < 3
+							? Array.from(
+									chunks,
+									c =>
+										`${RuntimeGlobals.prefetchChunk}(${JSON.stringify(c.id)});`
+							  )
+							: `${JSON.stringify(Array.from(chunks, c => c.id))}.map(${
+									RuntimeGlobals.prefetchChunk
+							  });`
+					)}, 5);`
+			)
+		);
+	}
+}
+
+module.exports = ChunkPrefetchStartupRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchTriggerRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchTriggerRuntimeModule.js
new file mode 100644
index 0000000..8e68da6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPrefetchTriggerRuntimeModule.js
@@ -0,0 +1,49 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+
+class ChunkPrefetchTriggerRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {Record<string|number, (string|number)[]>} chunkMap map from chunk to
+	 */
+	constructor(chunkMap) {
+		super(`chunk prefetch trigger`, RuntimeModule.STAGE_TRIGGER);
+		this.chunkMap = chunkMap;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkMap } = this;
+		const { runtimeTemplate } = this.compilation;
+		const body = [
+			"var chunks = chunkToChildrenMap[chunkId];",
+			`Array.isArray(chunks) && chunks.map(${RuntimeGlobals.prefetchChunk});`
+		];
+		return Template.asString([
+			Template.asString([
+				`var chunkToChildrenMap = ${JSON.stringify(chunkMap, null, "\t")};`,
+				`${
+					RuntimeGlobals.ensureChunkHandlers
+				}.prefetch = ${runtimeTemplate.expressionFunction(
+					`Promise.all(promises).then(${runtimeTemplate.basicFunction(
+						"",
+						body
+					)})`,
+					"chunkId, promises"
+				)};`
+			])
+		]);
+	}
+}
+
+module.exports = ChunkPrefetchTriggerRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPreloadTriggerRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPreloadTriggerRuntimeModule.js
new file mode 100644
index 0000000..bc5ec75
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/prefetch/ChunkPreloadTriggerRuntimeModule.js
@@ -0,0 +1,43 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+
+class ChunkPreloadTriggerRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {Record<string|number, (string|number)[]>} chunkMap map from chunk to chunks
+	 */
+	constructor(chunkMap) {
+		super(`chunk preload trigger`, RuntimeModule.STAGE_TRIGGER);
+		this.chunkMap = chunkMap;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkMap } = this;
+		const { runtimeTemplate } = this.compilation;
+		const body = [
+			"var chunks = chunkToChildrenMap[chunkId];",
+			`Array.isArray(chunks) && chunks.map(${RuntimeGlobals.preloadChunk});`
+		];
+		return Template.asString([
+			Template.asString([
+				`var chunkToChildrenMap = ${JSON.stringify(chunkMap, null, "\t")};`,
+				`${
+					RuntimeGlobals.ensureChunkHandlers
+				}.preload = ${runtimeTemplate.basicFunction("chunkId", body)};`
+			])
+		]);
+	}
+}
+
+module.exports = ChunkPreloadTriggerRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/rules/BasicEffectRulePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/BasicEffectRulePlugin.js
new file mode 100644
index 0000000..f265b3b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/BasicEffectRulePlugin.js
@@ -0,0 +1,39 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./RuleSetCompiler")} RuleSetCompiler */
+
+class BasicEffectRulePlugin {
+	constructor(ruleProperty, effectType) {
+		this.ruleProperty = ruleProperty;
+		this.effectType = effectType || ruleProperty;
+	}
+
+	/**
+	 * @param {RuleSetCompiler} ruleSetCompiler the rule set compiler
+	 * @returns {void}
+	 */
+	apply(ruleSetCompiler) {
+		ruleSetCompiler.hooks.rule.tap(
+			"BasicEffectRulePlugin",
+			(path, rule, unhandledProperties, result, references) => {
+				if (unhandledProperties.has(this.ruleProperty)) {
+					unhandledProperties.delete(this.ruleProperty);
+
+					const value = rule[this.ruleProperty];
+
+					result.effects.push({
+						type: this.effectType,
+						value
+					});
+				}
+			}
+		);
+	}
+}
+
+module.exports = BasicEffectRulePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/rules/BasicMatcherRulePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/BasicMatcherRulePlugin.js
new file mode 100644
index 0000000..1c34943
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/BasicMatcherRulePlugin.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./RuleSetCompiler")} RuleSetCompiler */
+/** @typedef {import("./RuleSetCompiler").RuleCondition} RuleCondition */
+
+class BasicMatcherRulePlugin {
+	constructor(ruleProperty, dataProperty, invert) {
+		this.ruleProperty = ruleProperty;
+		this.dataProperty = dataProperty || ruleProperty;
+		this.invert = invert || false;
+	}
+
+	/**
+	 * @param {RuleSetCompiler} ruleSetCompiler the rule set compiler
+	 * @returns {void}
+	 */
+	apply(ruleSetCompiler) {
+		ruleSetCompiler.hooks.rule.tap(
+			"BasicMatcherRulePlugin",
+			(path, rule, unhandledProperties, result) => {
+				if (unhandledProperties.has(this.ruleProperty)) {
+					unhandledProperties.delete(this.ruleProperty);
+					const value = rule[this.ruleProperty];
+					const condition = ruleSetCompiler.compileCondition(
+						`${path}.${this.ruleProperty}`,
+						value
+					);
+					const fn = condition.fn;
+					result.conditions.push({
+						property: this.dataProperty,
+						matchWhenEmpty: this.invert
+							? !condition.matchWhenEmpty
+							: condition.matchWhenEmpty,
+						fn: this.invert ? v => !fn(v) : fn
+					});
+				}
+			}
+		);
+	}
+}
+
+module.exports = BasicMatcherRulePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/rules/ObjectMatcherRulePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/ObjectMatcherRulePlugin.js
new file mode 100644
index 0000000..613429e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/ObjectMatcherRulePlugin.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("./RuleSetCompiler")} RuleSetCompiler */
+/** @typedef {import("./RuleSetCompiler").RuleCondition} RuleCondition */
+
+class ObjectMatcherRulePlugin {
+	constructor(ruleProperty, dataProperty) {
+		this.ruleProperty = ruleProperty;
+		this.dataProperty = dataProperty || ruleProperty;
+	}
+
+	/**
+	 * @param {RuleSetCompiler} ruleSetCompiler the rule set compiler
+	 * @returns {void}
+	 */
+	apply(ruleSetCompiler) {
+		const { ruleProperty, dataProperty } = this;
+		ruleSetCompiler.hooks.rule.tap(
+			"ObjectMatcherRulePlugin",
+			(path, rule, unhandledProperties, result) => {
+				if (unhandledProperties.has(ruleProperty)) {
+					unhandledProperties.delete(ruleProperty);
+					const value = rule[ruleProperty];
+					for (const property of Object.keys(value)) {
+						const nestedDataProperties = property.split(".");
+						const condition = ruleSetCompiler.compileCondition(
+							`${path}.${ruleProperty}.${property}`,
+							value[property]
+						);
+						result.conditions.push({
+							property: [dataProperty, ...nestedDataProperties],
+							matchWhenEmpty: condition.matchWhenEmpty,
+							fn: condition.fn
+						});
+					}
+				}
+			}
+		);
+	}
+}
+
+module.exports = ObjectMatcherRulePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/rules/RuleSetCompiler.js b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/RuleSetCompiler.js
new file mode 100644
index 0000000..c30bdd7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/RuleSetCompiler.js
@@ -0,0 +1,379 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncHook } = require("tapable");
+
+/**
+ * @typedef {Object} RuleCondition
+ * @property {string | string[]} property
+ * @property {boolean} matchWhenEmpty
+ * @property {function(string): boolean} fn
+ */
+
+/**
+ * @typedef {Object} Condition
+ * @property {boolean} matchWhenEmpty
+ * @property {function(string): boolean} fn
+ */
+
+/**
+ * @typedef {Object} CompiledRule
+ * @property {RuleCondition[]} conditions
+ * @property {(Effect|function(object): Effect[])[]} effects
+ * @property {CompiledRule[]=} rules
+ * @property {CompiledRule[]=} oneOf
+ */
+
+/**
+ * @typedef {Object} Effect
+ * @property {string} type
+ * @property {any} value
+ */
+
+/**
+ * @typedef {Object} RuleSet
+ * @property {Map<string, any>} references map of references in the rule set (may grow over time)
+ * @property {function(object): Effect[]} exec execute the rule set
+ */
+
+class RuleSetCompiler {
+	constructor(plugins) {
+		this.hooks = Object.freeze({
+			/** @type {SyncHook<[string, object, Set<string>, CompiledRule, Map<string, any>]>} */
+			rule: new SyncHook([
+				"path",
+				"rule",
+				"unhandledProperties",
+				"compiledRule",
+				"references"
+			])
+		});
+		if (plugins) {
+			for (const plugin of plugins) {
+				plugin.apply(this);
+			}
+		}
+	}
+
+	/**
+	 * @param {object[]} ruleSet raw user provided rules
+	 * @returns {RuleSet} compiled RuleSet
+	 */
+	compile(ruleSet) {
+		const refs = new Map();
+		const rules = this.compileRules("ruleSet", ruleSet, refs);
+
+		/**
+		 * @param {object} data data passed in
+		 * @param {CompiledRule} rule the compiled rule
+		 * @param {Effect[]} effects an array where effects are pushed to
+		 * @returns {boolean} true, if the rule has matched
+		 */
+		const execRule = (data, rule, effects) => {
+			for (const condition of rule.conditions) {
+				const p = condition.property;
+				if (Array.isArray(p)) {
+					let current = data;
+					for (const subProperty of p) {
+						if (
+							current &&
+							typeof current === "object" &&
+							Object.prototype.hasOwnProperty.call(current, subProperty)
+						) {
+							current = current[subProperty];
+						} else {
+							current = undefined;
+							break;
+						}
+					}
+					if (current !== undefined) {
+						if (!condition.fn(current)) return false;
+						continue;
+					}
+				} else if (p in data) {
+					const value = data[p];
+					if (value !== undefined) {
+						if (!condition.fn(value)) return false;
+						continue;
+					}
+				}
+				if (!condition.matchWhenEmpty) {
+					return false;
+				}
+			}
+			for (const effect of rule.effects) {
+				if (typeof effect === "function") {
+					const returnedEffects = effect(data);
+					for (const effect of returnedEffects) {
+						effects.push(effect);
+					}
+				} else {
+					effects.push(effect);
+				}
+			}
+			if (rule.rules) {
+				for (const childRule of rule.rules) {
+					execRule(data, childRule, effects);
+				}
+			}
+			if (rule.oneOf) {
+				for (const childRule of rule.oneOf) {
+					if (execRule(data, childRule, effects)) {
+						break;
+					}
+				}
+			}
+			return true;
+		};
+
+		return {
+			references: refs,
+			exec: data => {
+				/** @type {Effect[]} */
+				const effects = [];
+				for (const rule of rules) {
+					execRule(data, rule, effects);
+				}
+				return effects;
+			}
+		};
+	}
+
+	/**
+	 * @param {string} path current path
+	 * @param {object[]} rules the raw rules provided by user
+	 * @param {Map<string, any>} refs references
+	 * @returns {CompiledRule[]} rules
+	 */
+	compileRules(path, rules, refs) {
+		return rules.map((rule, i) =>
+			this.compileRule(`${path}[${i}]`, rule, refs)
+		);
+	}
+
+	/**
+	 * @param {string} path current path
+	 * @param {object} rule the raw rule provided by user
+	 * @param {Map<string, any>} refs references
+	 * @returns {CompiledRule} normalized and compiled rule for processing
+	 */
+	compileRule(path, rule, refs) {
+		const unhandledProperties = new Set(
+			Object.keys(rule).filter(key => rule[key] !== undefined)
+		);
+
+		/** @type {CompiledRule} */
+		const compiledRule = {
+			conditions: [],
+			effects: [],
+			rules: undefined,
+			oneOf: undefined
+		};
+
+		this.hooks.rule.call(path, rule, unhandledProperties, compiledRule, refs);
+
+		if (unhandledProperties.has("rules")) {
+			unhandledProperties.delete("rules");
+			const rules = rule.rules;
+			if (!Array.isArray(rules))
+				throw this.error(path, rules, "Rule.rules must be an array of rules");
+			compiledRule.rules = this.compileRules(`${path}.rules`, rules, refs);
+		}
+
+		if (unhandledProperties.has("oneOf")) {
+			unhandledProperties.delete("oneOf");
+			const oneOf = rule.oneOf;
+			if (!Array.isArray(oneOf))
+				throw this.error(path, oneOf, "Rule.oneOf must be an array of rules");
+			compiledRule.oneOf = this.compileRules(`${path}.oneOf`, oneOf, refs);
+		}
+
+		if (unhandledProperties.size > 0) {
+			throw this.error(
+				path,
+				rule,
+				`Properties ${Array.from(unhandledProperties).join(", ")} are unknown`
+			);
+		}
+
+		return compiledRule;
+	}
+
+	/**
+	 * @param {string} path current path
+	 * @param {any} condition user provided condition value
+	 * @returns {Condition} compiled condition
+	 */
+	compileCondition(path, condition) {
+		if (condition === "") {
+			return {
+				matchWhenEmpty: true,
+				fn: str => str === ""
+			};
+		}
+		if (!condition) {
+			throw this.error(
+				path,
+				condition,
+				"Expected condition but got falsy value"
+			);
+		}
+		if (typeof condition === "string") {
+			return {
+				matchWhenEmpty: condition.length === 0,
+				fn: str => typeof str === "string" && str.startsWith(condition)
+			};
+		}
+		if (typeof condition === "function") {
+			try {
+				return {
+					matchWhenEmpty: condition(""),
+					fn: condition
+				};
+			} catch (err) {
+				throw this.error(
+					path,
+					condition,
+					"Evaluation of condition function threw error"
+				);
+			}
+		}
+		if (condition instanceof RegExp) {
+			return {
+				matchWhenEmpty: condition.test(""),
+				fn: v => typeof v === "string" && condition.test(v)
+			};
+		}
+		if (Array.isArray(condition)) {
+			const items = condition.map((c, i) =>
+				this.compileCondition(`${path}[${i}]`, c)
+			);
+			return this.combineConditionsOr(items);
+		}
+
+		if (typeof condition !== "object") {
+			throw this.error(
+				path,
+				condition,
+				`Unexpected ${typeof condition} when condition was expected`
+			);
+		}
+
+		const conditions = [];
+		for (const key of Object.keys(condition)) {
+			const value = condition[key];
+			switch (key) {
+				case "or":
+					if (value) {
+						if (!Array.isArray(value)) {
+							throw this.error(
+								`${path}.or`,
+								condition.and,
+								"Expected array of conditions"
+							);
+						}
+						conditions.push(this.compileCondition(`${path}.or`, value));
+					}
+					break;
+				case "and":
+					if (value) {
+						if (!Array.isArray(value)) {
+							throw this.error(
+								`${path}.and`,
+								condition.and,
+								"Expected array of conditions"
+							);
+						}
+						let i = 0;
+						for (const item of value) {
+							conditions.push(this.compileCondition(`${path}.and[${i}]`, item));
+							i++;
+						}
+					}
+					break;
+				case "not":
+					if (value) {
+						const matcher = this.compileCondition(`${path}.not`, value);
+						const fn = matcher.fn;
+						conditions.push({
+							matchWhenEmpty: !matcher.matchWhenEmpty,
+							fn: v => !fn(v)
+						});
+					}
+					break;
+				default:
+					throw this.error(
+						`${path}.${key}`,
+						condition[key],
+						`Unexpected property ${key} in condition`
+					);
+			}
+		}
+		if (conditions.length === 0) {
+			throw this.error(
+				path,
+				condition,
+				"Expected condition, but got empty thing"
+			);
+		}
+		return this.combineConditionsAnd(conditions);
+	}
+
+	/**
+	 * @param {Condition[]} conditions some conditions
+	 * @returns {Condition} merged condition
+	 */
+	combineConditionsOr(conditions) {
+		if (conditions.length === 0) {
+			return {
+				matchWhenEmpty: false,
+				fn: () => false
+			};
+		} else if (conditions.length === 1) {
+			return conditions[0];
+		} else {
+			return {
+				matchWhenEmpty: conditions.some(c => c.matchWhenEmpty),
+				fn: v => conditions.some(c => c.fn(v))
+			};
+		}
+	}
+
+	/**
+	 * @param {Condition[]} conditions some conditions
+	 * @returns {Condition} merged condition
+	 */
+	combineConditionsAnd(conditions) {
+		if (conditions.length === 0) {
+			return {
+				matchWhenEmpty: false,
+				fn: () => false
+			};
+		} else if (conditions.length === 1) {
+			return conditions[0];
+		} else {
+			return {
+				matchWhenEmpty: conditions.every(c => c.matchWhenEmpty),
+				fn: v => conditions.every(c => c.fn(v))
+			};
+		}
+	}
+
+	/**
+	 * @param {string} path current path
+	 * @param {any} value value at the error location
+	 * @param {string} message message explaining the problem
+	 * @returns {Error} an error object
+	 */
+	error(path, value, message) {
+		return new Error(
+			`Compiling RuleSet failed: ${message} (at ${path}: ${value})`
+		);
+	}
+}
+
+module.exports = RuleSetCompiler;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/rules/UseEffectRulePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/UseEffectRulePlugin.js
new file mode 100644
index 0000000..58b1056
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/rules/UseEffectRulePlugin.js
@@ -0,0 +1,194 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+
+/** @typedef {import("./RuleSetCompiler")} RuleSetCompiler */
+/** @typedef {import("./RuleSetCompiler").Effect} Effect */
+
+class UseEffectRulePlugin {
+	/**
+	 * @param {RuleSetCompiler} ruleSetCompiler the rule set compiler
+	 * @returns {void}
+	 */
+	apply(ruleSetCompiler) {
+		ruleSetCompiler.hooks.rule.tap(
+			"UseEffectRulePlugin",
+			(path, rule, unhandledProperties, result, references) => {
+				const conflictWith = (property, correctProperty) => {
+					if (unhandledProperties.has(property)) {
+						throw ruleSetCompiler.error(
+							`${path}.${property}`,
+							rule[property],
+							`A Rule must not have a '${property}' property when it has a '${correctProperty}' property`
+						);
+					}
+				};
+
+				if (unhandledProperties.has("use")) {
+					unhandledProperties.delete("use");
+					unhandledProperties.delete("enforce");
+
+					conflictWith("loader", "use");
+					conflictWith("options", "use");
+
+					const use = rule.use;
+					const enforce = rule.enforce;
+
+					const type = enforce ? `use-${enforce}` : "use";
+
+					/**
+					 *
+					 * @param {string} path options path
+					 * @param {string} defaultIdent default ident when none is provided
+					 * @param {object} item user provided use value
+					 * @returns {Effect|function(any): Effect[]} effect
+					 */
+					const useToEffect = (path, defaultIdent, item) => {
+						if (typeof item === "function") {
+							return data => useToEffectsWithoutIdent(path, item(data));
+						} else {
+							return useToEffectRaw(path, defaultIdent, item);
+						}
+					};
+
+					/**
+					 *
+					 * @param {string} path options path
+					 * @param {string} defaultIdent default ident when none is provided
+					 * @param {object} item user provided use value
+					 * @returns {Effect} effect
+					 */
+					const useToEffectRaw = (path, defaultIdent, item) => {
+						if (typeof item === "string") {
+							return {
+								type,
+								value: {
+									loader: item,
+									options: undefined,
+									ident: undefined
+								}
+							};
+						} else {
+							const loader = item.loader;
+							const options = item.options;
+							let ident = item.ident;
+							if (options && typeof options === "object") {
+								if (!ident) ident = defaultIdent;
+								references.set(ident, options);
+							}
+							if (typeof options === "string") {
+								util.deprecate(
+									() => {},
+									`Using a string as loader options is deprecated (${path}.options)`,
+									"DEP_WEBPACK_RULE_LOADER_OPTIONS_STRING"
+								)();
+							}
+							return {
+								type: enforce ? `use-${enforce}` : "use",
+								value: {
+									loader,
+									options,
+									ident
+								}
+							};
+						}
+					};
+
+					/**
+					 * @param {string} path options path
+					 * @param {any} items user provided use value
+					 * @returns {Effect[]} effects
+					 */
+					const useToEffectsWithoutIdent = (path, items) => {
+						if (Array.isArray(items)) {
+							return items.map((item, idx) =>
+								useToEffectRaw(`${path}[${idx}]`, "[[missing ident]]", item)
+							);
+						}
+						return [useToEffectRaw(path, "[[missing ident]]", items)];
+					};
+
+					/**
+					 * @param {string} path current path
+					 * @param {any} items user provided use value
+					 * @returns {(Effect|function(any): Effect[])[]} effects
+					 */
+					const useToEffects = (path, items) => {
+						if (Array.isArray(items)) {
+							return items.map((item, idx) => {
+								const subPath = `${path}[${idx}]`;
+								return useToEffect(subPath, subPath, item);
+							});
+						}
+						return [useToEffect(path, path, items)];
+					};
+
+					if (typeof use === "function") {
+						result.effects.push(data =>
+							useToEffectsWithoutIdent(`${path}.use`, use(data))
+						);
+					} else {
+						for (const effect of useToEffects(`${path}.use`, use)) {
+							result.effects.push(effect);
+						}
+					}
+				}
+
+				if (unhandledProperties.has("loader")) {
+					unhandledProperties.delete("loader");
+					unhandledProperties.delete("options");
+					unhandledProperties.delete("enforce");
+
+					const loader = rule.loader;
+					const options = rule.options;
+					const enforce = rule.enforce;
+
+					if (loader.includes("!")) {
+						throw ruleSetCompiler.error(
+							`${path}.loader`,
+							loader,
+							"Exclamation mark separated loader lists has been removed in favor of the 'use' property with arrays"
+						);
+					}
+
+					if (loader.includes("?")) {
+						throw ruleSetCompiler.error(
+							`${path}.loader`,
+							loader,
+							"Query arguments on 'loader' has been removed in favor of the 'options' property"
+						);
+					}
+
+					if (typeof options === "string") {
+						util.deprecate(
+							() => {},
+							`Using a string as loader options is deprecated (${path}.options)`,
+							"DEP_WEBPACK_RULE_LOADER_OPTIONS_STRING"
+						)();
+					}
+
+					const ident =
+						options && typeof options === "object" ? path : undefined;
+					references.set(ident, options);
+					result.effects.push({
+						type: enforce ? `use-${enforce}` : "use",
+						value: {
+							loader,
+							options,
+							ident
+						}
+					});
+				}
+			}
+		);
+	}
+
+	useItemToEffects(path, item) {}
+}
+
+module.exports = UseEffectRulePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/AsyncModuleRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/AsyncModuleRuntimeModule.js
new file mode 100644
index 0000000..137509a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/AsyncModuleRuntimeModule.js
@@ -0,0 +1,156 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class AsyncModuleRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("async module");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		const fn = RuntimeGlobals.asyncModule;
+		return Template.asString([
+			'var webpackThen = typeof Symbol === "function" ? Symbol("webpack then") : "__webpack_then__";',
+			'var webpackExports = typeof Symbol === "function" ? Symbol("webpack exports") : "__webpack_exports__";',
+			'var webpackError = typeof Symbol === "function" ? Symbol("webpack error") : "__webpack_error__";',
+			`var completeQueue = ${runtimeTemplate.basicFunction("queue", [
+				"if(queue) {",
+				Template.indent([
+					`queue.forEach(${runtimeTemplate.expressionFunction(
+						"fn.r--",
+						"fn"
+					)});`,
+					`queue.forEach(${runtimeTemplate.expressionFunction(
+						"fn.r-- ? fn.r++ : fn()",
+						"fn"
+					)});`
+				]),
+				"}"
+			])}`,
+			`var completeFunction = ${runtimeTemplate.expressionFunction(
+				"!--fn.r && fn()",
+				"fn"
+			)};`,
+			`var queueFunction = ${runtimeTemplate.expressionFunction(
+				"queue ? queue.push(fn) : completeFunction(fn)",
+				"queue, fn"
+			)};`,
+			`var wrapDeps = ${runtimeTemplate.returningFunction(
+				`deps.map(${runtimeTemplate.basicFunction("dep", [
+					'if(dep !== null && typeof dep === "object") {',
+					Template.indent([
+						"if(dep[webpackThen]) return dep;",
+						"if(dep.then) {",
+						Template.indent([
+							"var queue = [];",
+							`dep.then(${runtimeTemplate.basicFunction("r", [
+								"obj[webpackExports] = r;",
+								"completeQueue(queue);",
+								"queue = 0;"
+							])}, ${runtimeTemplate.basicFunction("e", [
+								"obj[webpackError] = e;",
+								"completeQueue(queue);",
+								"queue = 0;"
+							])});`,
+							"var obj = {};",
+							`obj[webpackThen] = ${runtimeTemplate.expressionFunction(
+								"queueFunction(queue, fn), dep['catch'](reject)",
+								"fn, reject"
+							)};`,
+							"return obj;"
+						]),
+						"}"
+					]),
+					"}",
+					"var ret = {};",
+					`ret[webpackThen] = ${runtimeTemplate.expressionFunction(
+						"completeFunction(fn)",
+						"fn"
+					)};`,
+					"ret[webpackExports] = dep;",
+					"return ret;"
+				])})`,
+				"deps"
+			)};`,
+			`${fn} = ${runtimeTemplate.basicFunction("module, body, hasAwait", [
+				"var queue = hasAwait && [];",
+				"var exports = module.exports;",
+				"var currentDeps;",
+				"var outerResolve;",
+				"var reject;",
+				"var isEvaluating = true;",
+				"var nested = false;",
+				`var whenAll = ${runtimeTemplate.basicFunction(
+					"deps, onResolve, onReject",
+					[
+						"if (nested) return;",
+						"nested = true;",
+						"onResolve.r += deps.length;",
+						`deps.map(${runtimeTemplate.expressionFunction(
+							"dep[webpackThen](onResolve, onReject)",
+							"dep, i"
+						)});`,
+						"nested = false;"
+					]
+				)};`,
+				`var promise = new Promise(${runtimeTemplate.basicFunction(
+					"resolve, rej",
+					[
+						"reject = rej;",
+						`outerResolve = ${runtimeTemplate.expressionFunction(
+							"resolve(exports), completeQueue(queue), queue = 0"
+						)};`
+					]
+				)});`,
+				"promise[webpackExports] = exports;",
+				`promise[webpackThen] = ${runtimeTemplate.basicFunction(
+					"fn, rejectFn",
+					[
+						"if (isEvaluating) { return completeFunction(fn); }",
+						"if (currentDeps) whenAll(currentDeps, fn, rejectFn);",
+						"queueFunction(queue, fn);",
+						"promise['catch'](rejectFn);"
+					]
+				)};`,
+				"module.exports = promise;",
+				`body(${runtimeTemplate.basicFunction("deps", [
+					"currentDeps = wrapDeps(deps);",
+					"var fn;",
+					`var getResult = ${runtimeTemplate.returningFunction(
+						`currentDeps.map(${runtimeTemplate.basicFunction("d", [
+							"if(d[webpackError]) throw d[webpackError];",
+							"return d[webpackExports];"
+						])})`
+					)}`,
+					`var promise = new Promise(${runtimeTemplate.basicFunction(
+						"resolve, reject",
+						[
+							`fn = ${runtimeTemplate.expressionFunction(
+								"resolve(getResult)"
+							)};`,
+							"fn.r = 0;",
+							"whenAll(currentDeps, fn, reject);"
+						]
+					)});`,
+					"return fn.r ? promise : getResult();"
+				])}, ${runtimeTemplate.expressionFunction(
+					"err && reject(promise[webpackError] = err), outerResolve()",
+					"err"
+				)});`,
+				"isEvaluating = false;"
+			])};`
+		]);
+	}
+}
+
+module.exports = AsyncModuleRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/AutoPublicPathRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/AutoPublicPathRuntimeModule.js
new file mode 100644
index 0000000..a672408
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/AutoPublicPathRuntimeModule.js
@@ -0,0 +1,69 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const JavascriptModulesPlugin = require("../javascript/JavascriptModulesPlugin");
+const { getUndoPath } = require("../util/identifier");
+
+class AutoPublicPathRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("publicPath", RuntimeModule.STAGE_BASIC);
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation } = this;
+		const { scriptType, importMetaName, path } = compilation.outputOptions;
+		const chunkName = compilation.getPath(
+			JavascriptModulesPlugin.getChunkFilenameTemplate(
+				this.chunk,
+				compilation.outputOptions
+			),
+			{
+				chunk: this.chunk,
+				contentHashType: "javascript"
+			}
+		);
+		const undoPath = getUndoPath(chunkName, path, false);
+
+		return Template.asString([
+			"var scriptUrl;",
+			scriptType === "module"
+				? `if (typeof ${importMetaName}.url === "string") scriptUrl = ${importMetaName}.url`
+				: Template.asString([
+						`if (${RuntimeGlobals.global}.importScripts) scriptUrl = ${RuntimeGlobals.global}.location + "";`,
+						`var document = ${RuntimeGlobals.global}.document;`,
+						"if (!scriptUrl && document) {",
+						Template.indent([
+							`if (document.currentScript)`,
+							Template.indent(`scriptUrl = document.currentScript.src`),
+							"if (!scriptUrl) {",
+							Template.indent([
+								'var scripts = document.getElementsByTagName("script");',
+								"if(scripts.length) scriptUrl = scripts[scripts.length - 1].src"
+							]),
+							"}"
+						]),
+						"}"
+				  ]),
+			"// When supporting browsers where an automatic publicPath is not supported you must specify an output.publicPath manually via configuration",
+			'// or pass an empty string ("") and set the __webpack_public_path__ variable from your code to use your own logic.',
+			'if (!scriptUrl) throw new Error("Automatic publicPath is not supported in this browser");',
+			'scriptUrl = scriptUrl.replace(/#.*$/, "").replace(/\\?.*$/, "").replace(/\\/[^\\/]+$/, "/");',
+			!undoPath
+				? `${RuntimeGlobals.publicPath} = scriptUrl;`
+				: `${RuntimeGlobals.publicPath} = scriptUrl + ${JSON.stringify(
+						undoPath
+				  )};`
+		]);
+	}
+}
+
+module.exports = AutoPublicPathRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/ChunkNameRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/ChunkNameRuntimeModule.js
new file mode 100644
index 0000000..2271b43
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/ChunkNameRuntimeModule.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+
+class ChunkNameRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {string} chunkName the chunk's name
+	 */
+	constructor(chunkName) {
+		super("chunkName");
+		this.chunkName = chunkName;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return `${RuntimeGlobals.chunkName} = ${JSON.stringify(this.chunkName)};`;
+	}
+}
+
+module.exports = ChunkNameRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CompatGetDefaultExportRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CompatGetDefaultExportRuntimeModule.js
new file mode 100644
index 0000000..4947bcc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CompatGetDefaultExportRuntimeModule.js
@@ -0,0 +1,37 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class CompatGetDefaultExportRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("compat get default export");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		const fn = RuntimeGlobals.compatGetDefaultExport;
+		return Template.asString([
+			"// getDefaultExport function for compatibility with non-harmony modules",
+			`${fn} = ${runtimeTemplate.basicFunction("module", [
+				"var getter = module && module.__esModule ?",
+				Template.indent([
+					`${runtimeTemplate.returningFunction("module['default']")} :`,
+					`${runtimeTemplate.returningFunction("module")};`
+				]),
+				`${RuntimeGlobals.definePropertyGetters}(getter, { a: getter });`,
+				"return getter;"
+			])};`
+		]);
+	}
+}
+
+module.exports = CompatGetDefaultExportRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CompatRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CompatRuntimeModule.js
new file mode 100644
index 0000000..ed9d9af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CompatRuntimeModule.js
@@ -0,0 +1,78 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+
+/** @typedef {import("../MainTemplate")} MainTemplate */
+
+class CompatRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("compat", RuntimeModule.STAGE_ATTACH);
+		this.fullHash = true;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkGraph, chunk, compilation } = this;
+		const {
+			runtimeTemplate,
+			mainTemplate,
+			moduleTemplates,
+			dependencyTemplates
+		} = compilation;
+		const bootstrap = mainTemplate.hooks.bootstrap.call(
+			"",
+			chunk,
+			compilation.hash || "XXXX",
+			moduleTemplates.javascript,
+			dependencyTemplates
+		);
+		const localVars = mainTemplate.hooks.localVars.call(
+			"",
+			chunk,
+			compilation.hash || "XXXX"
+		);
+		const requireExtensions = mainTemplate.hooks.requireExtensions.call(
+			"",
+			chunk,
+			compilation.hash || "XXXX"
+		);
+		const runtimeRequirements = chunkGraph.getTreeRuntimeRequirements(chunk);
+		let requireEnsure = "";
+		if (runtimeRequirements.has(RuntimeGlobals.ensureChunk)) {
+			const requireEnsureHandler = mainTemplate.hooks.requireEnsure.call(
+				"",
+				chunk,
+				compilation.hash || "XXXX",
+				"chunkId"
+			);
+			if (requireEnsureHandler) {
+				requireEnsure = `${
+					RuntimeGlobals.ensureChunkHandlers
+				}.compat = ${runtimeTemplate.basicFunction(
+					"chunkId, promises",
+					requireEnsureHandler
+				)};`;
+			}
+		}
+		return [bootstrap, localVars, requireEnsure, requireExtensions]
+			.filter(Boolean)
+			.join("\n");
+	}
+
+	/**
+	 * @returns {boolean} true, if the runtime module should get it's own scope
+	 */
+	shouldIsolate() {
+		// We avoid isolating this to have better backward-compat
+		return false;
+	}
+}
+
+module.exports = CompatRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateFakeNamespaceObjectRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateFakeNamespaceObjectRuntimeModule.js
new file mode 100644
index 0000000..6c2157e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateFakeNamespaceObjectRuntimeModule.js
@@ -0,0 +1,66 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class CreateFakeNamespaceObjectRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("create fake namespace object");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		const fn = RuntimeGlobals.createFakeNamespaceObject;
+		return Template.asString([
+			`var getProto = Object.getPrototypeOf ? ${runtimeTemplate.returningFunction(
+				"Object.getPrototypeOf(obj)",
+				"obj"
+			)} : ${runtimeTemplate.returningFunction("obj.__proto__", "obj")};`,
+			"var leafPrototypes;",
+			"// create a fake namespace object",
+			"// mode & 1: value is a module id, require it",
+			"// mode & 2: merge all properties of value into the ns",
+			"// mode & 4: return value when already ns object",
+			"// mode & 16: return value when it's Promise-like",
+			"// mode & 8|1: behave like require",
+			// Note: must be a function (not arrow), because this is used in body!
+			`${fn} = function(value, mode) {`,
+			Template.indent([
+				`if(mode & 1) value = this(value);`,
+				`if(mode & 8) return value;`,
+				"if(typeof value === 'object' && value) {",
+				Template.indent([
+					"if((mode & 4) && value.__esModule) return value;",
+					"if((mode & 16) && typeof value.then === 'function') return value;"
+				]),
+				"}",
+				"var ns = Object.create(null);",
+				`${RuntimeGlobals.makeNamespaceObject}(ns);`,
+				"var def = {};",
+				"leafPrototypes = leafPrototypes || [null, getProto({}), getProto([]), getProto(getProto)];",
+				"for(var current = mode & 2 && value; typeof current == 'object' && !~leafPrototypes.indexOf(current); current = getProto(current)) {",
+				Template.indent([
+					`Object.getOwnPropertyNames(current).forEach(${runtimeTemplate.expressionFunction(
+						`def[key] = ${runtimeTemplate.returningFunction("value[key]", "")}`,
+						"key"
+					)});`
+				]),
+				"}",
+				`def['default'] = ${runtimeTemplate.returningFunction("value", "")};`,
+				`${RuntimeGlobals.definePropertyGetters}(ns, def);`,
+				"return ns;"
+			]),
+			"};"
+		]);
+	}
+}
+
+module.exports = CreateFakeNamespaceObjectRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateScriptRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateScriptRuntimeModule.js
new file mode 100644
index 0000000..ad174fa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateScriptRuntimeModule.js
@@ -0,0 +1,36 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class CreateScriptRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("trusted types script");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation } = this;
+		const { runtimeTemplate, outputOptions } = compilation;
+		const { trustedTypes } = outputOptions;
+		const fn = RuntimeGlobals.createScript;
+
+		return Template.asString(
+			`${fn} = ${runtimeTemplate.returningFunction(
+				trustedTypes
+					? `${RuntimeGlobals.getTrustedTypesPolicy}().createScript(script)`
+					: "script",
+				"script"
+			)};`
+		);
+	}
+}
+
+module.exports = CreateScriptRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateScriptUrlRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateScriptUrlRuntimeModule.js
new file mode 100644
index 0000000..63a5b0e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/CreateScriptUrlRuntimeModule.js
@@ -0,0 +1,36 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class CreateScriptUrlRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("trusted types script url");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation } = this;
+		const { runtimeTemplate, outputOptions } = compilation;
+		const { trustedTypes } = outputOptions;
+		const fn = RuntimeGlobals.createScriptUrl;
+
+		return Template.asString(
+			`${fn} = ${runtimeTemplate.returningFunction(
+				trustedTypes
+					? `${RuntimeGlobals.getTrustedTypesPolicy}().createScriptURL(url)`
+					: "url",
+				"url"
+			)};`
+		);
+	}
+}
+
+module.exports = CreateScriptUrlRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/DefinePropertyGettersRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/DefinePropertyGettersRuntimeModule.js
new file mode 100644
index 0000000..5fce2be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/DefinePropertyGettersRuntimeModule.js
@@ -0,0 +1,39 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class DefinePropertyGettersRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("define property getters");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		const fn = RuntimeGlobals.definePropertyGetters;
+		return Template.asString([
+			"// define getter functions for harmony exports",
+			`${fn} = ${runtimeTemplate.basicFunction("exports, definition", [
+				`for(var key in definition) {`,
+				Template.indent([
+					`if(${RuntimeGlobals.hasOwnProperty}(definition, key) && !${RuntimeGlobals.hasOwnProperty}(exports, key)) {`,
+					Template.indent([
+						"Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });"
+					]),
+					"}"
+				]),
+				"}"
+			])};`
+		]);
+	}
+}
+
+module.exports = DefinePropertyGettersRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/EnsureChunkRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/EnsureChunkRuntimeModule.js
new file mode 100644
index 0000000..16320c3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/EnsureChunkRuntimeModule.js
@@ -0,0 +1,54 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class EnsureChunkRuntimeModule extends RuntimeModule {
+	constructor(runtimeRequirements) {
+		super("ensure chunk");
+		this.runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		// Check if there are non initial chunks which need to be imported using require-ensure
+		if (this.runtimeRequirements.has(RuntimeGlobals.ensureChunkHandlers)) {
+			const handlers = RuntimeGlobals.ensureChunkHandlers;
+			return Template.asString([
+				`${handlers} = {};`,
+				"// This file contains only the entry chunk.",
+				"// The chunk loading function for additional chunks",
+				`${RuntimeGlobals.ensureChunk} = ${runtimeTemplate.basicFunction(
+					"chunkId",
+					[
+						`return Promise.all(Object.keys(${handlers}).reduce(${runtimeTemplate.basicFunction(
+							"promises, key",
+							[`${handlers}[key](chunkId, promises);`, "return promises;"]
+						)}, []));`
+					]
+				)};`
+			]);
+		} else {
+			// There ensureChunk is used somewhere in the tree, so we need an empty requireEnsure
+			// function. This can happen with multiple entrypoints.
+			return Template.asString([
+				"// The chunk loading function for additional chunks",
+				"// Since all referenced chunks are already included",
+				"// in this file, this function is empty here.",
+				`${RuntimeGlobals.ensureChunk} = ${runtimeTemplate.returningFunction(
+					"Promise.resolve()"
+				)};`
+			]);
+		}
+	}
+}
+
+module.exports = EnsureChunkRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetChunkFilenameRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetChunkFilenameRuntimeModule.js
new file mode 100644
index 0000000..d077cb5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetChunkFilenameRuntimeModule.js
@@ -0,0 +1,282 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const { first } = require("../util/SetHelpers");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("../Compilation").PathData} PathData */
+
+/** @typedef {function(PathData, AssetInfo=): string} FilenameFunction */
+
+class GetChunkFilenameRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {string} contentType the contentType to use the content hash for
+	 * @param {string} name kind of filename
+	 * @param {string} global function name to be assigned
+	 * @param {function(Chunk): string | FilenameFunction} getFilenameForChunk functor to get the filename or function
+	 * @param {boolean} allChunks when false, only async chunks are included
+	 */
+	constructor(contentType, name, global, getFilenameForChunk, allChunks) {
+		super(`get ${name} chunk filename`);
+		this.contentType = contentType;
+		this.global = global;
+		this.getFilenameForChunk = getFilenameForChunk;
+		this.allChunks = allChunks;
+		this.dependentHash = true;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const {
+			global,
+			chunk,
+			chunkGraph,
+			contentType,
+			getFilenameForChunk,
+			allChunks,
+			compilation
+		} = this;
+		const { runtimeTemplate } = compilation;
+
+		/** @type {Map<string | FilenameFunction, Set<Chunk>>} */
+		const chunkFilenames = new Map();
+		let maxChunks = 0;
+		/** @type {string} */
+		let dynamicFilename;
+
+		/**
+		 * @param {Chunk} c the chunk
+		 * @returns {void}
+		 */
+		const addChunk = c => {
+			const chunkFilename = getFilenameForChunk(c);
+			if (chunkFilename) {
+				let set = chunkFilenames.get(chunkFilename);
+				if (set === undefined) {
+					chunkFilenames.set(chunkFilename, (set = new Set()));
+				}
+				set.add(c);
+				if (typeof chunkFilename === "string") {
+					if (set.size < maxChunks) return;
+					if (set.size === maxChunks) {
+						if (chunkFilename.length < dynamicFilename.length) return;
+						if (chunkFilename.length === dynamicFilename.length) {
+							if (chunkFilename < dynamicFilename) return;
+						}
+					}
+					maxChunks = set.size;
+					dynamicFilename = chunkFilename;
+				}
+			}
+		};
+
+		/** @type {string[]} */
+		const includedChunksMessages = [];
+		if (allChunks) {
+			includedChunksMessages.push("all chunks");
+			for (const c of chunk.getAllReferencedChunks()) {
+				addChunk(c);
+			}
+		} else {
+			includedChunksMessages.push("async chunks");
+			for (const c of chunk.getAllAsyncChunks()) {
+				addChunk(c);
+			}
+			const includeEntries = chunkGraph
+				.getTreeRuntimeRequirements(chunk)
+				.has(RuntimeGlobals.ensureChunkIncludeEntries);
+			if (includeEntries) {
+				includedChunksMessages.push("sibling chunks for the entrypoint");
+				for (const c of chunkGraph.getChunkEntryDependentChunksIterable(
+					chunk
+				)) {
+					addChunk(c);
+				}
+			}
+		}
+		for (const entrypoint of chunk.getAllReferencedAsyncEntrypoints()) {
+			addChunk(entrypoint.chunks[entrypoint.chunks.length - 1]);
+		}
+
+		/** @type {Map<string, Set<string | number>>} */
+		const staticUrls = new Map();
+		/** @type {Set<Chunk>} */
+		const dynamicUrlChunks = new Set();
+
+		/**
+		 * @param {Chunk} c the chunk
+		 * @param {string | FilenameFunction} chunkFilename the filename template for the chunk
+		 * @returns {void}
+		 */
+		const addStaticUrl = (c, chunkFilename) => {
+			/**
+			 * @param {string | number} value a value
+			 * @returns {string} string to put in quotes
+			 */
+			const unquotedStringify = value => {
+				const str = `${value}`;
+				if (str.length >= 5 && str === `${c.id}`) {
+					// This is shorter and generates the same result
+					return '" + chunkId + "';
+				}
+				const s = JSON.stringify(str);
+				return s.slice(1, s.length - 1);
+			};
+			const unquotedStringifyWithLength = value => length =>
+				unquotedStringify(`${value}`.slice(0, length));
+			const chunkFilenameValue =
+				typeof chunkFilename === "function"
+					? JSON.stringify(
+							chunkFilename({
+								chunk: c,
+								contentHashType: contentType
+							})
+					  )
+					: JSON.stringify(chunkFilename);
+			const staticChunkFilename = compilation.getPath(chunkFilenameValue, {
+				hash: `" + ${RuntimeGlobals.getFullHash}() + "`,
+				hashWithLength: length =>
+					`" + ${RuntimeGlobals.getFullHash}().slice(0, ${length}) + "`,
+				chunk: {
+					id: unquotedStringify(c.id),
+					hash: unquotedStringify(c.renderedHash),
+					hashWithLength: unquotedStringifyWithLength(c.renderedHash),
+					name: unquotedStringify(c.name || c.id),
+					contentHash: {
+						[contentType]: unquotedStringify(c.contentHash[contentType])
+					},
+					contentHashWithLength: {
+						[contentType]: unquotedStringifyWithLength(
+							c.contentHash[contentType]
+						)
+					}
+				},
+				contentHashType: contentType
+			});
+			let set = staticUrls.get(staticChunkFilename);
+			if (set === undefined) {
+				staticUrls.set(staticChunkFilename, (set = new Set()));
+			}
+			set.add(c.id);
+		};
+
+		for (const [filename, chunks] of chunkFilenames) {
+			if (filename !== dynamicFilename) {
+				for (const c of chunks) addStaticUrl(c, filename);
+			} else {
+				for (const c of chunks) dynamicUrlChunks.add(c);
+			}
+		}
+
+		/**
+		 * @param {function(Chunk): string | number} fn function from chunk to value
+		 * @returns {string} code with static mapping of results of fn
+		 */
+		const createMap = fn => {
+			const obj = {};
+			let useId = false;
+			let lastKey;
+			let entries = 0;
+			for (const c of dynamicUrlChunks) {
+				const value = fn(c);
+				if (value === c.id) {
+					useId = true;
+				} else {
+					obj[c.id] = value;
+					lastKey = c.id;
+					entries++;
+				}
+			}
+			if (entries === 0) return "chunkId";
+			if (entries === 1) {
+				return useId
+					? `(chunkId === ${JSON.stringify(lastKey)} ? ${JSON.stringify(
+							obj[lastKey]
+					  )} : chunkId)`
+					: JSON.stringify(obj[lastKey]);
+			}
+			return useId
+				? `(${JSON.stringify(obj)}[chunkId] || chunkId)`
+				: `${JSON.stringify(obj)}[chunkId]`;
+		};
+
+		/**
+		 * @param {function(Chunk): string | number} fn function from chunk to value
+		 * @returns {string} code with static mapping of results of fn for including in quoted string
+		 */
+		const mapExpr = fn => {
+			return `" + ${createMap(fn)} + "`;
+		};
+
+		/**
+		 * @param {function(Chunk): string | number} fn function from chunk to value
+		 * @returns {function(number): string} function which generates code with static mapping of results of fn for including in quoted string for specific length
+		 */
+		const mapExprWithLength = fn => length => {
+			return `" + ${createMap(c => `${fn(c)}`.slice(0, length))} + "`;
+		};
+
+		const url =
+			dynamicFilename &&
+			compilation.getPath(JSON.stringify(dynamicFilename), {
+				hash: `" + ${RuntimeGlobals.getFullHash}() + "`,
+				hashWithLength: length =>
+					`" + ${RuntimeGlobals.getFullHash}().slice(0, ${length}) + "`,
+				chunk: {
+					id: `" + chunkId + "`,
+					hash: mapExpr(c => c.renderedHash),
+					hashWithLength: mapExprWithLength(c => c.renderedHash),
+					name: mapExpr(c => c.name || c.id),
+					contentHash: {
+						[contentType]: mapExpr(c => c.contentHash[contentType])
+					},
+					contentHashWithLength: {
+						[contentType]: mapExprWithLength(c => c.contentHash[contentType])
+					}
+				},
+				contentHashType: contentType
+			});
+
+		return Template.asString([
+			`// This function allow to reference ${includedChunksMessages.join(
+				" and "
+			)}`,
+			`${global} = ${runtimeTemplate.basicFunction(
+				"chunkId",
+
+				staticUrls.size > 0
+					? [
+							"// return url for filenames not based on template",
+							// it minimizes to `x===1?"...":x===2?"...":"..."`
+							Template.asString(
+								Array.from(staticUrls, ([url, ids]) => {
+									const condition =
+										ids.size === 1
+											? `chunkId === ${JSON.stringify(first(ids))}`
+											: `{${Array.from(
+													ids,
+													id => `${JSON.stringify(id)}:1`
+											  ).join(",")}}[chunkId]`;
+									return `if (${condition}) return ${url};`;
+								})
+							),
+							"// return url for filenames based on template",
+							`return ${url};`
+					  ]
+					: ["// return url for filenames based on template", `return ${url};`]
+			)};`
+		]);
+	}
+}
+
+module.exports = GetChunkFilenameRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetFullHashRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetFullHashRuntimeModule.js
new file mode 100644
index 0000000..fa29084
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetFullHashRuntimeModule.js
@@ -0,0 +1,29 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+
+/** @typedef {import("../Compilation")} Compilation */
+
+class GetFullHashRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("getFullHash");
+		this.fullHash = true;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		return `${RuntimeGlobals.getFullHash} = ${runtimeTemplate.returningFunction(
+			JSON.stringify(this.compilation.hash || "XXXX")
+		)}`;
+	}
+}
+
+module.exports = GetFullHashRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetMainFilenameRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetMainFilenameRuntimeModule.js
new file mode 100644
index 0000000..cd9a693
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetMainFilenameRuntimeModule.js
@@ -0,0 +1,44 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+/** @typedef {import("../Compilation")} Compilation */
+
+class GetMainFilenameRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {string} name readable name
+	 * @param {string} global global object binding
+	 * @param {string} filename main file name
+	 */
+	constructor(name, global, filename) {
+		super(`get ${name} filename`);
+		this.global = global;
+		this.filename = filename;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { global, filename, compilation, chunk } = this;
+		const { runtimeTemplate } = compilation;
+		const url = compilation.getPath(JSON.stringify(filename), {
+			hash: `" + ${RuntimeGlobals.getFullHash}() + "`,
+			hashWithLength: length =>
+				`" + ${RuntimeGlobals.getFullHash}().slice(0, ${length}) + "`,
+			chunk,
+			runtime: chunk.runtime
+		});
+		return Template.asString([
+			`${global} = ${runtimeTemplate.returningFunction(url)};`
+		]);
+	}
+}
+
+module.exports = GetMainFilenameRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetTrustedTypesPolicyRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetTrustedTypesPolicyRuntimeModule.js
new file mode 100644
index 0000000..9f719e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GetTrustedTypesPolicyRuntimeModule.js
@@ -0,0 +1,76 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class GetTrustedTypesPolicyRuntimeModule extends HelperRuntimeModule {
+	/**
+	 * @param {Set<string>} runtimeRequirements runtime requirements
+	 */
+	constructor(runtimeRequirements) {
+		super("trusted types policy");
+		this.runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation } = this;
+		const { runtimeTemplate, outputOptions } = compilation;
+		const { trustedTypes } = outputOptions;
+		const fn = RuntimeGlobals.getTrustedTypesPolicy;
+
+		return Template.asString([
+			"var policy;",
+			`${fn} = ${runtimeTemplate.basicFunction("", [
+				"// Create Trusted Type policy if Trusted Types are available and the policy doesn't exist yet.",
+				"if (policy === undefined) {",
+				Template.indent([
+					"policy = {",
+					Template.indent(
+						[
+							...(this.runtimeRequirements.has(RuntimeGlobals.createScript)
+								? [
+										`createScript: ${runtimeTemplate.returningFunction(
+											"script",
+											"script"
+										)}`
+								  ]
+								: []),
+							...(this.runtimeRequirements.has(RuntimeGlobals.createScriptUrl)
+								? [
+										`createScriptURL: ${runtimeTemplate.returningFunction(
+											"url",
+											"url"
+										)}`
+								  ]
+								: [])
+						].join(",\n")
+					),
+					"};",
+					...(trustedTypes
+						? [
+								'if (typeof trustedTypes !== "undefined" && trustedTypes.createPolicy) {',
+								Template.indent([
+									`policy = trustedTypes.createPolicy(${JSON.stringify(
+										trustedTypes.policyName
+									)}, policy);`
+								]),
+								"}"
+						  ]
+						: [])
+				]),
+				"}",
+				"return policy;"
+			])};`
+		]);
+	}
+}
+
+module.exports = GetTrustedTypesPolicyRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GlobalRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GlobalRuntimeModule.js
new file mode 100644
index 0000000..631521a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/GlobalRuntimeModule.js
@@ -0,0 +1,47 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class GlobalRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("global");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return Template.asString([
+			`${RuntimeGlobals.global} = (function() {`,
+			Template.indent([
+				"if (typeof globalThis === 'object') return globalThis;",
+				"try {",
+				Template.indent(
+					// This works in non-strict mode
+					// or
+					// This works if eval is allowed (see CSP)
+					"return this || new Function('return this')();"
+				),
+				"} catch (e) {",
+				Template.indent(
+					// This works if the window reference is available
+					"if (typeof window === 'object') return window;"
+				),
+				"}"
+				// It can still be `undefined`, but nothing to do about it...
+				// We return `undefined`, instead of nothing here, so it's
+				// easier to handle this case:
+				//   if (!global) { … }
+			]),
+			"})();"
+		]);
+	}
+}
+
+module.exports = GlobalRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/HasOwnPropertyRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/HasOwnPropertyRuntimeModule.js
new file mode 100644
index 0000000..1971794
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/HasOwnPropertyRuntimeModule.js
@@ -0,0 +1,32 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sergey Melyukov @smelukov
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class HasOwnPropertyRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("hasOwnProperty shorthand");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+
+		return Template.asString([
+			`${RuntimeGlobals.hasOwnProperty} = ${runtimeTemplate.returningFunction(
+				"Object.prototype.hasOwnProperty.call(obj, prop)",
+				"obj, prop"
+			)}`
+		]);
+	}
+}
+
+module.exports = HasOwnPropertyRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/HelperRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/HelperRuntimeModule.js
new file mode 100644
index 0000000..012916c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/HelperRuntimeModule.js
@@ -0,0 +1,18 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeModule = require("../RuntimeModule");
+
+class HelperRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {string} name a readable name
+	 */
+	constructor(name) {
+		super(name);
+	}
+}
+
+module.exports = HelperRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/LoadScriptRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/LoadScriptRuntimeModule.js
new file mode 100644
index 0000000..3990993
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/LoadScriptRuntimeModule.js
@@ -0,0 +1,158 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const { SyncWaterfallHook } = require("tapable");
+const Compilation = require("../Compilation");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compiler")} Compiler */
+
+/**
+ * @typedef {Object} LoadScriptCompilationHooks
+ * @property {SyncWaterfallHook<[string, Chunk]>} createScript
+ */
+
+/** @type {WeakMap<Compilation, LoadScriptCompilationHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class LoadScriptRuntimeModule extends HelperRuntimeModule {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {LoadScriptCompilationHooks} hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				createScript: new SyncWaterfallHook(["source", "chunk"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	/**
+	 * @param {boolean=} withCreateScriptUrl use create script url for trusted types
+	 */
+	constructor(withCreateScriptUrl) {
+		super("load script");
+		this._withCreateScriptUrl = withCreateScriptUrl;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation } = this;
+		const { runtimeTemplate, outputOptions } = compilation;
+		const {
+			scriptType,
+			chunkLoadTimeout: loadTimeout,
+			crossOriginLoading,
+			uniqueName,
+			charset
+		} = outputOptions;
+		const fn = RuntimeGlobals.loadScript;
+
+		const { createScript } =
+			LoadScriptRuntimeModule.getCompilationHooks(compilation);
+
+		const code = Template.asString([
+			"script = document.createElement('script');",
+			scriptType ? `script.type = ${JSON.stringify(scriptType)};` : "",
+			charset ? "script.charset = 'utf-8';" : "",
+			`script.timeout = ${loadTimeout / 1000};`,
+			`if (${RuntimeGlobals.scriptNonce}) {`,
+			Template.indent(
+				`script.setAttribute("nonce", ${RuntimeGlobals.scriptNonce});`
+			),
+			"}",
+			uniqueName
+				? 'script.setAttribute("data-webpack", dataWebpackPrefix + key);'
+				: "",
+			`script.src = ${
+				this._withCreateScriptUrl
+					? `${RuntimeGlobals.createScriptUrl}(url)`
+					: "url"
+			};`,
+			crossOriginLoading
+				? Template.asString([
+						"if (script.src.indexOf(window.location.origin + '/') !== 0) {",
+						Template.indent(
+							`script.crossOrigin = ${JSON.stringify(crossOriginLoading)};`
+						),
+						"}"
+				  ])
+				: ""
+		]);
+
+		return Template.asString([
+			"var inProgress = {};",
+			uniqueName
+				? `var dataWebpackPrefix = ${JSON.stringify(uniqueName + ":")};`
+				: "// data-webpack is not used as build has no uniqueName",
+			"// loadScript function to load a script via script tag",
+			`${fn} = ${runtimeTemplate.basicFunction("url, done, key, chunkId", [
+				"if(inProgress[url]) { inProgress[url].push(done); return; }",
+				"var script, needAttach;",
+				"if(key !== undefined) {",
+				Template.indent([
+					'var scripts = document.getElementsByTagName("script");',
+					"for(var i = 0; i < scripts.length; i++) {",
+					Template.indent([
+						"var s = scripts[i];",
+						`if(s.getAttribute("src") == url${
+							uniqueName
+								? ' || s.getAttribute("data-webpack") == dataWebpackPrefix + key'
+								: ""
+						}) { script = s; break; }`
+					]),
+					"}"
+				]),
+				"}",
+				"if(!script) {",
+				Template.indent([
+					"needAttach = true;",
+					createScript.call(code, this.chunk)
+				]),
+				"}",
+				"inProgress[url] = [done];",
+				"var onScriptComplete = " +
+					runtimeTemplate.basicFunction(
+						"prev, event",
+						Template.asString([
+							"// avoid mem leaks in IE.",
+							"script.onerror = script.onload = null;",
+							"clearTimeout(timeout);",
+							"var doneFns = inProgress[url];",
+							"delete inProgress[url];",
+							"script.parentNode && script.parentNode.removeChild(script);",
+							`doneFns && doneFns.forEach(${runtimeTemplate.returningFunction(
+								"fn(event)",
+								"fn"
+							)});`,
+							"if(prev) return prev(event);"
+						])
+					),
+				";",
+				`var timeout = setTimeout(onScriptComplete.bind(null, undefined, { type: 'timeout', target: script }), ${loadTimeout});`,
+				"script.onerror = onScriptComplete.bind(null, script.onerror);",
+				"script.onload = onScriptComplete.bind(null, script.onload);",
+				"needAttach && document.head.appendChild(script);"
+			])};`
+		]);
+	}
+}
+
+module.exports = LoadScriptRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/MakeNamespaceObjectRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/MakeNamespaceObjectRuntimeModule.js
new file mode 100644
index 0000000..c08dcab
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/MakeNamespaceObjectRuntimeModule.js
@@ -0,0 +1,36 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class MakeNamespaceObjectRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("make namespace object");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		const fn = RuntimeGlobals.makeNamespaceObject;
+		return Template.asString([
+			"// define __esModule on exports",
+			`${fn} = ${runtimeTemplate.basicFunction("exports", [
+				"if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {",
+				Template.indent([
+					"Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });"
+				]),
+				"}",
+				"Object.defineProperty(exports, '__esModule', { value: true });"
+			])};`
+		]);
+	}
+}
+
+module.exports = MakeNamespaceObjectRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/OnChunksLoadedRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/OnChunksLoadedRuntimeModule.js
new file mode 100644
index 0000000..e870e65
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/OnChunksLoadedRuntimeModule.js
@@ -0,0 +1,76 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class OnChunksLoadedRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("chunk loaded");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation } = this;
+		const { runtimeTemplate } = compilation;
+		return Template.asString([
+			"var deferred = [];",
+			`${RuntimeGlobals.onChunksLoaded} = ${runtimeTemplate.basicFunction(
+				"result, chunkIds, fn, priority",
+				[
+					"if(chunkIds) {",
+					Template.indent([
+						"priority = priority || 0;",
+						"for(var i = deferred.length; i > 0 && deferred[i - 1][2] > priority; i--) deferred[i] = deferred[i - 1];",
+						"deferred[i] = [chunkIds, fn, priority];",
+						"return;"
+					]),
+					"}",
+					"var notFulfilled = Infinity;",
+					"for (var i = 0; i < deferred.length; i++) {",
+					Template.indent([
+						runtimeTemplate.destructureArray(
+							["chunkIds", "fn", "priority"],
+							"deferred[i]"
+						),
+						"var fulfilled = true;",
+						"for (var j = 0; j < chunkIds.length; j++) {",
+						Template.indent([
+							`if ((priority & 1 === 0 || notFulfilled >= priority) && Object.keys(${
+								RuntimeGlobals.onChunksLoaded
+							}).every(${runtimeTemplate.returningFunction(
+								`${RuntimeGlobals.onChunksLoaded}[key](chunkIds[j])`,
+								"key"
+							)})) {`,
+							Template.indent(["chunkIds.splice(j--, 1);"]),
+							"} else {",
+							Template.indent([
+								"fulfilled = false;",
+								"if(priority < notFulfilled) notFulfilled = priority;"
+							]),
+							"}"
+						]),
+						"}",
+						"if(fulfilled) {",
+						Template.indent([
+							"deferred.splice(i--, 1)",
+							"var r = fn();",
+							"if (r !== undefined) result = r;"
+						]),
+						"}"
+					]),
+					"}",
+					"return result;"
+				]
+			)};`
+		]);
+	}
+}
+
+module.exports = OnChunksLoadedRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/PublicPathRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/PublicPathRuntimeModule.js
new file mode 100644
index 0000000..21cd494
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/PublicPathRuntimeModule.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+
+class PublicPathRuntimeModule extends RuntimeModule {
+	constructor(publicPath) {
+		super("publicPath", RuntimeModule.STAGE_BASIC);
+		this.publicPath = publicPath;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation, publicPath } = this;
+
+		return `${RuntimeGlobals.publicPath} = ${JSON.stringify(
+			compilation.getPath(publicPath || "", {
+				hash: compilation.hash || "XXXX"
+			})
+		)};`;
+	}
+}
+
+module.exports = PublicPathRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/RelativeUrlRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/RelativeUrlRuntimeModule.js
new file mode 100644
index 0000000..5699ecc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/RelativeUrlRuntimeModule.js
@@ -0,0 +1,41 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const HelperRuntimeModule = require("./HelperRuntimeModule");
+
+class RelativeUrlRuntimeModule extends HelperRuntimeModule {
+	constructor() {
+		super("relative url");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { runtimeTemplate } = this.compilation;
+		return Template.asString([
+			`${RuntimeGlobals.relativeUrl} = function RelativeURL(url) {`,
+			Template.indent([
+				'var realUrl = new URL(url, "x:/");',
+				"var values = {};",
+				"for (var key in realUrl) values[key] = realUrl[key];",
+				"values.href = url;",
+				'values.pathname = url.replace(/[?#].*/, "");',
+				'values.origin = values.protocol = "";',
+				`values.toString = values.toJSON = ${runtimeTemplate.returningFunction(
+					"url"
+				)};`,
+				"for (var key in values) Object.defineProperty(this, key, { enumerable: true, configurable: true, value: values[key] });"
+			]),
+			"};",
+			`${RuntimeGlobals.relativeUrl}.prototype = URL.prototype;`
+		]);
+	}
+}
+
+module.exports = RelativeUrlRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/RuntimeIdRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/RuntimeIdRuntimeModule.js
new file mode 100644
index 0000000..ca2313c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/RuntimeIdRuntimeModule.js
@@ -0,0 +1,28 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+
+class RuntimeIdRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("runtimeId");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkGraph, chunk } = this;
+		const runtime = chunk.runtime;
+		if (typeof runtime !== "string")
+			throw new Error("RuntimeIdRuntimeModule must be in a single runtime");
+		const id = chunkGraph.getRuntimeId(runtime);
+		return `${RuntimeGlobals.runtimeId} = ${JSON.stringify(id)};`;
+	}
+}
+
+module.exports = RuntimeIdRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupChunkDependenciesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupChunkDependenciesPlugin.js
new file mode 100644
index 0000000..ad3d873
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupChunkDependenciesPlugin.js
@@ -0,0 +1,74 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const StartupChunkDependenciesRuntimeModule = require("./StartupChunkDependenciesRuntimeModule");
+const StartupEntrypointRuntimeModule = require("./StartupEntrypointRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class StartupChunkDependenciesPlugin {
+	constructor(options) {
+		this.chunkLoading = options.chunkLoading;
+		this.asyncChunkLoading =
+			typeof options.asyncChunkLoading === "boolean"
+				? options.asyncChunkLoading
+				: true;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"StartupChunkDependenciesPlugin",
+			compilation => {
+				const globalChunkLoading = compilation.outputOptions.chunkLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const chunkLoading =
+						options && options.chunkLoading !== undefined
+							? options.chunkLoading
+							: globalChunkLoading;
+					return chunkLoading === this.chunkLoading;
+				};
+				compilation.hooks.additionalTreeRuntimeRequirements.tap(
+					"StartupChunkDependenciesPlugin",
+					(chunk, set, { chunkGraph }) => {
+						if (!isEnabledForChunk(chunk)) return;
+						if (chunkGraph.hasChunkEntryDependentChunks(chunk)) {
+							set.add(RuntimeGlobals.startup);
+							set.add(RuntimeGlobals.ensureChunk);
+							set.add(RuntimeGlobals.ensureChunkIncludeEntries);
+							compilation.addRuntimeModule(
+								chunk,
+								new StartupChunkDependenciesRuntimeModule(
+									this.asyncChunkLoading
+								)
+							);
+						}
+					}
+				);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.startupEntrypoint)
+					.tap("StartupChunkDependenciesPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.require);
+						set.add(RuntimeGlobals.ensureChunk);
+						set.add(RuntimeGlobals.ensureChunkIncludeEntries);
+						compilation.addRuntimeModule(
+							chunk,
+							new StartupEntrypointRuntimeModule(this.asyncChunkLoading)
+						);
+					});
+			}
+		);
+	}
+}
+
+module.exports = StartupChunkDependenciesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupChunkDependenciesRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupChunkDependenciesRuntimeModule.js
new file mode 100644
index 0000000..5097b4d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupChunkDependenciesRuntimeModule.js
@@ -0,0 +1,67 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class StartupChunkDependenciesRuntimeModule extends RuntimeModule {
+	constructor(asyncChunkLoading) {
+		super("startup chunk dependencies", RuntimeModule.STAGE_TRIGGER);
+		this.asyncChunkLoading = asyncChunkLoading;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkGraph, chunk, compilation } = this;
+		const { runtimeTemplate } = compilation;
+		const chunkIds = Array.from(
+			chunkGraph.getChunkEntryDependentChunksIterable(chunk)
+		).map(chunk => {
+			return chunk.id;
+		});
+		return Template.asString([
+			`var next = ${RuntimeGlobals.startup};`,
+			`${RuntimeGlobals.startup} = ${runtimeTemplate.basicFunction(
+				"",
+				!this.asyncChunkLoading
+					? chunkIds
+							.map(
+								id => `${RuntimeGlobals.ensureChunk}(${JSON.stringify(id)});`
+							)
+							.concat("return next();")
+					: chunkIds.length === 1
+					? `return ${RuntimeGlobals.ensureChunk}(${JSON.stringify(
+							chunkIds[0]
+					  )}).then(next);`
+					: chunkIds.length > 2
+					? [
+							// using map is shorter for 3 or more chunks
+							`return Promise.all(${JSON.stringify(chunkIds)}.map(${
+								RuntimeGlobals.ensureChunk
+							}, __webpack_require__)).then(next);`
+					  ]
+					: [
+							// calling ensureChunk directly is shorter for 0 - 2 chunks
+							"return Promise.all([",
+							Template.indent(
+								chunkIds
+									.map(
+										id => `${RuntimeGlobals.ensureChunk}(${JSON.stringify(id)})`
+									)
+									.join(",\n")
+							),
+							"]).then(next);"
+					  ]
+			)};`
+		]);
+	}
+}
+
+module.exports = StartupChunkDependenciesRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupEntrypointRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupEntrypointRuntimeModule.js
new file mode 100644
index 0000000..b5413be
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/StartupEntrypointRuntimeModule.js
@@ -0,0 +1,50 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+
+/** @typedef {import("../MainTemplate")} MainTemplate */
+
+class StartupEntrypointRuntimeModule extends RuntimeModule {
+	constructor(asyncChunkLoading) {
+		super("startup entrypoint");
+		this.asyncChunkLoading = asyncChunkLoading;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation } = this;
+		const { runtimeTemplate } = compilation;
+		return `${
+			RuntimeGlobals.startupEntrypoint
+		} = ${runtimeTemplate.basicFunction("result, chunkIds, fn", [
+			"// arguments: chunkIds, moduleId are deprecated",
+			"var moduleId = chunkIds;",
+			`if(!fn) chunkIds = result, fn = ${runtimeTemplate.returningFunction(
+				`__webpack_require__(${RuntimeGlobals.entryModuleId} = moduleId)`
+			)};`,
+			...(this.asyncChunkLoading
+				? [
+						`return Promise.all(chunkIds.map(${
+							RuntimeGlobals.ensureChunk
+						}, __webpack_require__)).then(${runtimeTemplate.basicFunction("", [
+							"var r = fn();",
+							"return r === undefined ? result : r;"
+						])})`
+				  ]
+				: [
+						`chunkIds.map(${RuntimeGlobals.ensureChunk}, __webpack_require__)`,
+						"var r = fn();",
+						"return r === undefined ? result : r;"
+				  ])
+		])}`;
+	}
+}
+
+module.exports = StartupEntrypointRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/SystemContextRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/SystemContextRuntimeModule.js
new file mode 100644
index 0000000..1418329
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/runtime/SystemContextRuntimeModule.js
@@ -0,0 +1,25 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+
+/** @typedef {import("../Compilation")} Compilation */
+
+class SystemContextRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("__system_context__");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		return `${RuntimeGlobals.systemContext} = __system_context__;`;
+	}
+}
+
+module.exports = SystemContextRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/DataUriPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/DataUriPlugin.js
new file mode 100644
index 0000000..8ca09e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/DataUriPlugin.js
@@ -0,0 +1,56 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NormalModule = require("../NormalModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+// data URL scheme: "data:text/javascript;charset=utf-8;base64,some-string"
+// http://www.ietf.org/rfc/rfc2397.txt
+const URIRegEx = /^data:([^;,]+)?((?:;[^;,]+)*?)(?:;(base64))?,(.*)$/i;
+
+const decodeDataURI = uri => {
+	const match = URIRegEx.exec(uri);
+	if (!match) return null;
+
+	const isBase64 = match[3];
+	const body = match[4];
+	return isBase64
+		? Buffer.from(body, "base64")
+		: Buffer.from(decodeURIComponent(body), "ascii");
+};
+
+class DataUriPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"DataUriPlugin",
+			(compilation, { normalModuleFactory }) => {
+				normalModuleFactory.hooks.resolveForScheme
+					.for("data")
+					.tap("DataUriPlugin", resourceData => {
+						const match = URIRegEx.exec(resourceData.resource);
+						if (match) {
+							resourceData.data.mimetype = match[1] || "";
+							resourceData.data.parameters = match[2] || "";
+							resourceData.data.encoding = match[3] || false;
+							resourceData.data.encodedContent = match[4] || "";
+						}
+					});
+				NormalModule.getCompilationHooks(compilation)
+					.readResourceForScheme.for("data")
+					.tap("DataUriPlugin", resource => decodeDataURI(resource));
+			}
+		);
+	}
+}
+
+module.exports = DataUriPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/FileUriPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/FileUriPlugin.js
new file mode 100644
index 0000000..453abbd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/FileUriPlugin.js
@@ -0,0 +1,49 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { URL, fileURLToPath } = require("url");
+const { NormalModule } = require("..");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class FileUriPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"FileUriPlugin",
+			(compilation, { normalModuleFactory }) => {
+				normalModuleFactory.hooks.resolveForScheme
+					.for("file")
+					.tap("FileUriPlugin", resourceData => {
+						const url = new URL(resourceData.resource);
+						const path = fileURLToPath(url);
+						const query = url.search;
+						const fragment = url.hash;
+						resourceData.path = path;
+						resourceData.query = query;
+						resourceData.fragment = fragment;
+						resourceData.resource = path + query + fragment;
+						return true;
+					});
+				const hooks = NormalModule.getCompilationHooks(compilation);
+				hooks.readResource
+					.for(undefined)
+					.tapAsync("FileUriPlugin", (loaderContext, callback) => {
+						const { resourcePath } = loaderContext;
+						loaderContext.addDependency(resourcePath);
+						loaderContext.fs.readFile(resourcePath, callback);
+					});
+			}
+		);
+	}
+}
+
+module.exports = FileUriPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/HttpUriPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/HttpUriPlugin.js
new file mode 100644
index 0000000..1de8e1c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/schemes/HttpUriPlugin.js
@@ -0,0 +1,1118 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const EventEmitter = require("events");
+const { extname, basename } = require("path");
+const { URL } = require("url");
+const { createGunzip, createBrotliDecompress, createInflate } = require("zlib");
+const NormalModule = require("../NormalModule");
+const createSchemaValidation = require("../util/create-schema-validation");
+const createHash = require("../util/createHash");
+const { mkdirp, dirname, join } = require("../util/fs");
+const memoize = require("../util/memoize");
+
+/** @typedef {import("../../declarations/plugins/schemes/HttpUriPlugin").HttpUriPluginOptions} HttpUriPluginOptions */
+/** @typedef {import("../Compiler")} Compiler */
+
+const getHttp = memoize(() => require("http"));
+const getHttps = memoize(() => require("https"));
+const proxyFetch = (request, proxy) => (url, options, callback) => {
+	const eventEmitter = new EventEmitter();
+	const doRequest = socket =>
+		request
+			.get(url, { ...options, ...(socket && { socket }) }, callback)
+			.on("error", eventEmitter.emit.bind(eventEmitter, "error"));
+
+	if (proxy) {
+		const { hostname: host, port } = new URL(proxy);
+
+		getHttp()
+			.request({
+				host, // IP address of proxy server
+				port, // port of proxy server
+				method: "CONNECT",
+				path: url.host
+			})
+			.on("connect", (res, socket) => {
+				if (res.statusCode === 200) {
+					// connected to proxy server
+					doRequest(socket);
+				}
+			})
+			.on("error", err => {
+				eventEmitter.emit(
+					"error",
+					new Error(
+						`Failed to connect to proxy server "${proxy}": ${err.message}`
+					)
+				);
+			})
+			.end();
+	} else {
+		doRequest();
+	}
+
+	return eventEmitter;
+};
+
+/** @type {(() => void)[] | undefined} */
+let inProgressWrite = undefined;
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/schemes/HttpUriPlugin.check.js"),
+	() => require("../../schemas/plugins/schemes/HttpUriPlugin.json"),
+	{
+		name: "Http Uri Plugin",
+		baseDataPath: "options"
+	}
+);
+
+const toSafePath = str =>
+	str
+		.replace(/^[^a-zA-Z0-9]+|[^a-zA-Z0-9]+$/g, "")
+		.replace(/[^a-zA-Z0-9._-]+/g, "_");
+
+const computeIntegrity = content => {
+	const hash = createHash("sha512");
+	hash.update(content);
+	const integrity = "sha512-" + hash.digest("base64");
+	return integrity;
+};
+
+const verifyIntegrity = (content, integrity) => {
+	if (integrity === "ignore") return true;
+	return computeIntegrity(content) === integrity;
+};
+
+/**
+ * @param {string} str input
+ * @returns {Record<string, string>} parsed
+ */
+const parseKeyValuePairs = str => {
+	/** @type {Record<string, string>} */
+	const result = {};
+	for (const item of str.split(",")) {
+		const i = item.indexOf("=");
+		if (i >= 0) {
+			const key = item.slice(0, i).trim();
+			const value = item.slice(i + 1).trim();
+			result[key] = value;
+		} else {
+			const key = item.trim();
+			if (!key) continue;
+			result[key] = key;
+		}
+	}
+	return result;
+};
+
+const parseCacheControl = (cacheControl, requestTime) => {
+	// When false resource is not stored in cache
+	let storeCache = true;
+	// When false resource is not stored in lockfile cache
+	let storeLock = true;
+	// Resource is only revalidated, after that timestamp and when upgrade is chosen
+	let validUntil = 0;
+	if (cacheControl) {
+		const parsed = parseKeyValuePairs(cacheControl);
+		if (parsed["no-cache"]) storeCache = storeLock = false;
+		if (parsed["max-age"] && !isNaN(+parsed["max-age"])) {
+			validUntil = requestTime + +parsed["max-age"] * 1000;
+		}
+		if (parsed["must-revalidate"]) validUntil = 0;
+	}
+	return {
+		storeLock,
+		storeCache,
+		validUntil
+	};
+};
+
+/**
+ * @typedef {Object} LockfileEntry
+ * @property {string} resolved
+ * @property {string} integrity
+ * @property {string} contentType
+ */
+
+const areLockfileEntriesEqual = (a, b) => {
+	return (
+		a.resolved === b.resolved &&
+		a.integrity === b.integrity &&
+		a.contentType === b.contentType
+	);
+};
+
+const entryToString = entry => {
+	return `resolved: ${entry.resolved}, integrity: ${entry.integrity}, contentType: ${entry.contentType}`;
+};
+
+class Lockfile {
+	constructor() {
+		this.version = 1;
+		/** @type {Map<string, LockfileEntry | "ignore" | "no-cache">} */
+		this.entries = new Map();
+	}
+
+	static parse(content) {
+		// TODO handle merge conflicts
+		const data = JSON.parse(content);
+		if (data.version !== 1)
+			throw new Error(`Unsupported lockfile version ${data.version}`);
+		const lockfile = new Lockfile();
+		for (const key of Object.keys(data)) {
+			if (key === "version") continue;
+			const entry = data[key];
+			lockfile.entries.set(
+				key,
+				typeof entry === "string"
+					? entry
+					: {
+							resolved: key,
+							...entry
+					  }
+			);
+		}
+		return lockfile;
+	}
+
+	toString() {
+		let str = "{\n";
+		const entries = Array.from(this.entries).sort(([a], [b]) =>
+			a < b ? -1 : 1
+		);
+		for (const [key, entry] of entries) {
+			if (typeof entry === "string") {
+				str += `  ${JSON.stringify(key)}: ${JSON.stringify(entry)},\n`;
+			} else {
+				str += `  ${JSON.stringify(key)}: { `;
+				if (entry.resolved !== key)
+					str += `"resolved": ${JSON.stringify(entry.resolved)}, `;
+				str += `"integrity": ${JSON.stringify(
+					entry.integrity
+				)}, "contentType": ${JSON.stringify(entry.contentType)} },\n`;
+			}
+		}
+		str += `  "version": ${this.version}\n}\n`;
+		return str;
+	}
+}
+
+/**
+ * @template R
+ * @param {function(function(Error=, R=): void): void} fn function
+ * @returns {function(function((Error | null)=, R=): void): void} cached function
+ */
+const cachedWithoutKey = fn => {
+	let inFlight = false;
+	/** @type {Error | undefined} */
+	let cachedError = undefined;
+	/** @type {R | undefined} */
+	let cachedResult = undefined;
+	/** @type {(function(Error=, R=): void)[] | undefined} */
+	let cachedCallbacks = undefined;
+	return callback => {
+		if (inFlight) {
+			if (cachedResult !== undefined) return callback(null, cachedResult);
+			if (cachedError !== undefined) return callback(cachedError);
+			if (cachedCallbacks === undefined) cachedCallbacks = [callback];
+			else cachedCallbacks.push(callback);
+			return;
+		}
+		inFlight = true;
+		fn((err, result) => {
+			if (err) cachedError = err;
+			else cachedResult = result;
+			const callbacks = cachedCallbacks;
+			cachedCallbacks = undefined;
+			callback(err, result);
+			if (callbacks !== undefined) for (const cb of callbacks) cb(err, result);
+		});
+	};
+};
+
+/**
+ * @template T
+ * @template R
+ * @param {function(T, function(Error=, R=): void): void} fn function
+ * @param {function(T, function(Error=, R=): void): void=} forceFn function for the second try
+ * @returns {(function(T, function((Error | null)=, R=): void): void) & { force: function(T, function((Error | null)=, R=): void): void }} cached function
+ */
+const cachedWithKey = (fn, forceFn = fn) => {
+	/** @typedef {{ result?: R, error?: Error, callbacks?: (function((Error | null)=, R=): void)[], force?: true }} CacheEntry */
+	/** @type {Map<T, CacheEntry>} */
+	const cache = new Map();
+	const resultFn = (arg, callback) => {
+		const cacheEntry = cache.get(arg);
+		if (cacheEntry !== undefined) {
+			if (cacheEntry.result !== undefined)
+				return callback(null, cacheEntry.result);
+			if (cacheEntry.error !== undefined) return callback(cacheEntry.error);
+			if (cacheEntry.callbacks === undefined) cacheEntry.callbacks = [callback];
+			else cacheEntry.callbacks.push(callback);
+			return;
+		}
+		/** @type {CacheEntry} */
+		const newCacheEntry = {
+			result: undefined,
+			error: undefined,
+			callbacks: undefined
+		};
+		cache.set(arg, newCacheEntry);
+		fn(arg, (err, result) => {
+			if (err) newCacheEntry.error = err;
+			else newCacheEntry.result = result;
+			const callbacks = newCacheEntry.callbacks;
+			newCacheEntry.callbacks = undefined;
+			callback(err, result);
+			if (callbacks !== undefined) for (const cb of callbacks) cb(err, result);
+		});
+	};
+	resultFn.force = (arg, callback) => {
+		const cacheEntry = cache.get(arg);
+		if (cacheEntry !== undefined && cacheEntry.force) {
+			if (cacheEntry.result !== undefined)
+				return callback(null, cacheEntry.result);
+			if (cacheEntry.error !== undefined) return callback(cacheEntry.error);
+			if (cacheEntry.callbacks === undefined) cacheEntry.callbacks = [callback];
+			else cacheEntry.callbacks.push(callback);
+			return;
+		}
+		/** @type {CacheEntry} */
+		const newCacheEntry = {
+			result: undefined,
+			error: undefined,
+			callbacks: undefined,
+			force: true
+		};
+		cache.set(arg, newCacheEntry);
+		forceFn(arg, (err, result) => {
+			if (err) newCacheEntry.error = err;
+			else newCacheEntry.result = result;
+			const callbacks = newCacheEntry.callbacks;
+			newCacheEntry.callbacks = undefined;
+			callback(err, result);
+			if (callbacks !== undefined) for (const cb of callbacks) cb(err, result);
+		});
+	};
+	return resultFn;
+};
+
+class HttpUriPlugin {
+	/**
+	 * @param {HttpUriPluginOptions} options options
+	 */
+	constructor(options) {
+		validate(options);
+		this._lockfileLocation = options.lockfileLocation;
+		this._cacheLocation = options.cacheLocation;
+		this._upgrade = options.upgrade;
+		this._frozen = options.frozen;
+		this._allowedUris = options.allowedUris;
+		this._proxy = options.proxy;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const proxy =
+			this._proxy || process.env["http_proxy"] || process.env["HTTP_PROXY"];
+		const schemes = [
+			{
+				scheme: "http",
+				fetch: proxyFetch(getHttp(), proxy)
+			},
+			{
+				scheme: "https",
+				fetch: proxyFetch(getHttps(), proxy)
+			}
+		];
+		let lockfileCache;
+		compiler.hooks.compilation.tap(
+			"HttpUriPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const intermediateFs = compiler.intermediateFileSystem;
+				const fs = compilation.inputFileSystem;
+				const cache = compilation.getCache("webpack.HttpUriPlugin");
+				const logger = compilation.getLogger("webpack.HttpUriPlugin");
+				const lockfileLocation =
+					this._lockfileLocation ||
+					join(
+						intermediateFs,
+						compiler.context,
+						compiler.name
+							? `${toSafePath(compiler.name)}.webpack.lock`
+							: "webpack.lock"
+					);
+				const cacheLocation =
+					this._cacheLocation !== undefined
+						? this._cacheLocation
+						: lockfileLocation + ".data";
+				const upgrade = this._upgrade || false;
+				const frozen = this._frozen || false;
+				const hashFunction = "sha512";
+				const hashDigest = "hex";
+				const hashDigestLength = 20;
+				const allowedUris = this._allowedUris;
+
+				let warnedAboutEol = false;
+
+				const cacheKeyCache = new Map();
+				/**
+				 * @param {string} url the url
+				 * @returns {string} the key
+				 */
+				const getCacheKey = url => {
+					const cachedResult = cacheKeyCache.get(url);
+					if (cachedResult !== undefined) return cachedResult;
+					const result = _getCacheKey(url);
+					cacheKeyCache.set(url, result);
+					return result;
+				};
+
+				/**
+				 * @param {string} url the url
+				 * @returns {string} the key
+				 */
+				const _getCacheKey = url => {
+					const parsedUrl = new URL(url);
+					const folder = toSafePath(parsedUrl.origin);
+					const name = toSafePath(parsedUrl.pathname);
+					const query = toSafePath(parsedUrl.search);
+					let ext = extname(name);
+					if (ext.length > 20) ext = "";
+					const basename = ext ? name.slice(0, -ext.length) : name;
+					const hash = createHash(hashFunction);
+					hash.update(url);
+					const digest = hash.digest(hashDigest).slice(0, hashDigestLength);
+					return `${folder.slice(-50)}/${`${basename}${
+						query ? `_${query}` : ""
+					}`.slice(0, 150)}_${digest}${ext}`;
+				};
+
+				const getLockfile = cachedWithoutKey(
+					/**
+					 * @param {function((Error | null)=, Lockfile=): void} callback callback
+					 * @returns {void}
+					 */
+					callback => {
+						const readLockfile = () => {
+							intermediateFs.readFile(lockfileLocation, (err, buffer) => {
+								if (err && err.code !== "ENOENT") {
+									compilation.missingDependencies.add(lockfileLocation);
+									return callback(err);
+								}
+								compilation.fileDependencies.add(lockfileLocation);
+								compilation.fileSystemInfo.createSnapshot(
+									compiler.fsStartTime,
+									buffer ? [lockfileLocation] : [],
+									[],
+									buffer ? [] : [lockfileLocation],
+									{ timestamp: true },
+									(err, snapshot) => {
+										if (err) return callback(err);
+										const lockfile = buffer
+											? Lockfile.parse(buffer.toString("utf-8"))
+											: new Lockfile();
+										lockfileCache = {
+											lockfile,
+											snapshot
+										};
+										callback(null, lockfile);
+									}
+								);
+							});
+						};
+						if (lockfileCache) {
+							compilation.fileSystemInfo.checkSnapshotValid(
+								lockfileCache.snapshot,
+								(err, valid) => {
+									if (err) return callback(err);
+									if (!valid) return readLockfile();
+									callback(null, lockfileCache.lockfile);
+								}
+							);
+						} else {
+							readLockfile();
+						}
+					}
+				);
+
+				/** @type {Map<string, LockfileEntry | "ignore" | "no-cache"> | undefined} */
+				let lockfileUpdates = undefined;
+				const storeLockEntry = (lockfile, url, entry) => {
+					const oldEntry = lockfile.entries.get(url);
+					if (lockfileUpdates === undefined) lockfileUpdates = new Map();
+					lockfileUpdates.set(url, entry);
+					lockfile.entries.set(url, entry);
+					if (!oldEntry) {
+						logger.log(`${url} added to lockfile`);
+					} else if (typeof oldEntry === "string") {
+						if (typeof entry === "string") {
+							logger.log(`${url} updated in lockfile: ${oldEntry} -> ${entry}`);
+						} else {
+							logger.log(
+								`${url} updated in lockfile: ${oldEntry} -> ${entry.resolved}`
+							);
+						}
+					} else if (typeof entry === "string") {
+						logger.log(
+							`${url} updated in lockfile: ${oldEntry.resolved} -> ${entry}`
+						);
+					} else if (oldEntry.resolved !== entry.resolved) {
+						logger.log(
+							`${url} updated in lockfile: ${oldEntry.resolved} -> ${entry.resolved}`
+						);
+					} else if (oldEntry.integrity !== entry.integrity) {
+						logger.log(`${url} updated in lockfile: content changed`);
+					} else if (oldEntry.contentType !== entry.contentType) {
+						logger.log(
+							`${url} updated in lockfile: ${oldEntry.contentType} -> ${entry.contentType}`
+						);
+					} else {
+						logger.log(`${url} updated in lockfile`);
+					}
+				};
+
+				const storeResult = (lockfile, url, result, callback) => {
+					if (result.storeLock) {
+						storeLockEntry(lockfile, url, result.entry);
+						if (!cacheLocation || !result.content)
+							return callback(null, result);
+						const key = getCacheKey(result.entry.resolved);
+						const filePath = join(intermediateFs, cacheLocation, key);
+						mkdirp(intermediateFs, dirname(intermediateFs, filePath), err => {
+							if (err) return callback(err);
+							intermediateFs.writeFile(filePath, result.content, err => {
+								if (err) return callback(err);
+								callback(null, result);
+							});
+						});
+					} else {
+						storeLockEntry(lockfile, url, "no-cache");
+						callback(null, result);
+					}
+				};
+
+				for (const { scheme, fetch } of schemes) {
+					/**
+					 *
+					 * @param {string} url URL
+					 * @param {string} integrity integrity
+					 * @param {function((Error | null)=, { entry: LockfileEntry, content: Buffer, storeLock: boolean }=): void} callback callback
+					 */
+					const resolveContent = (url, integrity, callback) => {
+						const handleResult = (err, result) => {
+							if (err) return callback(err);
+							if ("location" in result) {
+								return resolveContent(
+									result.location,
+									integrity,
+									(err, innerResult) => {
+										if (err) return callback(err);
+										callback(null, {
+											entry: innerResult.entry,
+											content: innerResult.content,
+											storeLock: innerResult.storeLock && result.storeLock
+										});
+									}
+								);
+							} else {
+								if (
+									!result.fresh &&
+									integrity &&
+									result.entry.integrity !== integrity &&
+									!verifyIntegrity(result.content, integrity)
+								) {
+									return fetchContent.force(url, handleResult);
+								}
+								return callback(null, {
+									entry: result.entry,
+									content: result.content,
+									storeLock: result.storeLock
+								});
+							}
+						};
+						fetchContent(url, handleResult);
+					};
+
+					/** @typedef {{ storeCache: boolean, storeLock: boolean, validUntil: number, etag: string | undefined, fresh: boolean }} FetchResultMeta */
+					/** @typedef {FetchResultMeta & { location: string }} RedirectFetchResult */
+					/** @typedef {FetchResultMeta & { entry: LockfileEntry, content: Buffer }} ContentFetchResult */
+					/** @typedef {RedirectFetchResult | ContentFetchResult} FetchResult */
+
+					/**
+					 * @param {string} url URL
+					 * @param {FetchResult | RedirectFetchResult} cachedResult result from cache
+					 * @param {function((Error | null)=, FetchResult=): void} callback callback
+					 * @returns {void}
+					 */
+					const fetchContentRaw = (url, cachedResult, callback) => {
+						const requestTime = Date.now();
+						fetch(
+							new URL(url),
+							{
+								headers: {
+									"accept-encoding": "gzip, deflate, br",
+									"user-agent": "webpack",
+									"if-none-match": cachedResult
+										? cachedResult.etag || null
+										: null
+								}
+							},
+							res => {
+								const etag = res.headers["etag"];
+								const location = res.headers["location"];
+								const cacheControl = res.headers["cache-control"];
+								const { storeLock, storeCache, validUntil } = parseCacheControl(
+									cacheControl,
+									requestTime
+								);
+								/**
+								 * @param {Partial<Pick<FetchResultMeta, "fresh">> & (Pick<RedirectFetchResult, "location"> | Pick<ContentFetchResult, "content" | "entry">)} partialResult result
+								 * @returns {void}
+								 */
+								const finishWith = partialResult => {
+									if ("location" in partialResult) {
+										logger.debug(
+											`GET ${url} [${res.statusCode}] -> ${partialResult.location}`
+										);
+									} else {
+										logger.debug(
+											`GET ${url} [${res.statusCode}] ${Math.ceil(
+												partialResult.content.length / 1024
+											)} kB${!storeLock ? " no-cache" : ""}`
+										);
+									}
+									const result = {
+										...partialResult,
+										fresh: true,
+										storeLock,
+										storeCache,
+										validUntil,
+										etag
+									};
+									if (!storeCache) {
+										logger.log(
+											`${url} can't be stored in cache, due to Cache-Control header: ${cacheControl}`
+										);
+										return callback(null, result);
+									}
+									cache.store(
+										url,
+										null,
+										{
+											...result,
+											fresh: false
+										},
+										err => {
+											if (err) {
+												logger.warn(
+													`${url} can't be stored in cache: ${err.message}`
+												);
+												logger.debug(err.stack);
+											}
+											callback(null, result);
+										}
+									);
+								};
+								if (res.statusCode === 304) {
+									if (
+										cachedResult.validUntil < validUntil ||
+										cachedResult.storeLock !== storeLock ||
+										cachedResult.storeCache !== storeCache ||
+										cachedResult.etag !== etag
+									) {
+										return finishWith(cachedResult);
+									} else {
+										logger.debug(`GET ${url} [${res.statusCode}] (unchanged)`);
+										return callback(null, {
+											...cachedResult,
+											fresh: true
+										});
+									}
+								}
+								if (
+									location &&
+									res.statusCode >= 301 &&
+									res.statusCode <= 308
+								) {
+									const result = {
+										location: new URL(location, url).href
+									};
+									if (
+										!cachedResult ||
+										!("location" in cachedResult) ||
+										cachedResult.location !== result.location ||
+										cachedResult.validUntil < validUntil ||
+										cachedResult.storeLock !== storeLock ||
+										cachedResult.storeCache !== storeCache ||
+										cachedResult.etag !== etag
+									) {
+										return finishWith(result);
+									} else {
+										logger.debug(`GET ${url} [${res.statusCode}] (unchanged)`);
+										return callback(null, {
+											...result,
+											fresh: true,
+											storeLock,
+											storeCache,
+											validUntil,
+											etag
+										});
+									}
+								}
+								const contentType = res.headers["content-type"] || "";
+								const bufferArr = [];
+
+								const contentEncoding = res.headers["content-encoding"];
+								let stream = res;
+								if (contentEncoding === "gzip") {
+									stream = stream.pipe(createGunzip());
+								} else if (contentEncoding === "br") {
+									stream = stream.pipe(createBrotliDecompress());
+								} else if (contentEncoding === "deflate") {
+									stream = stream.pipe(createInflate());
+								}
+
+								stream.on("data", chunk => {
+									bufferArr.push(chunk);
+								});
+
+								stream.on("end", () => {
+									if (!res.complete) {
+										logger.log(`GET ${url} [${res.statusCode}] (terminated)`);
+										return callback(new Error(`${url} request was terminated`));
+									}
+
+									const content = Buffer.concat(bufferArr);
+
+									if (res.statusCode !== 200) {
+										logger.log(`GET ${url} [${res.statusCode}]`);
+										return callback(
+											new Error(
+												`${url} request status code = ${
+													res.statusCode
+												}\n${content.toString("utf-8")}`
+											)
+										);
+									}
+
+									const integrity = computeIntegrity(content);
+									const entry = { resolved: url, integrity, contentType };
+
+									finishWith({
+										entry,
+										content
+									});
+								});
+							}
+						).on("error", err => {
+							logger.log(`GET ${url} (error)`);
+							err.message += `\nwhile fetching ${url}`;
+							callback(err);
+						});
+					};
+
+					const fetchContent = cachedWithKey(
+						/**
+						 * @param {string} url URL
+						 * @param {function((Error | null)=, { validUntil: number, etag?: string, entry: LockfileEntry, content: Buffer, fresh: boolean } | { validUntil: number, etag?: string, location: string, fresh: boolean }=): void} callback callback
+						 * @returns {void}
+						 */ (url, callback) => {
+							cache.get(url, null, (err, cachedResult) => {
+								if (err) return callback(err);
+								if (cachedResult) {
+									const isValid = cachedResult.validUntil >= Date.now();
+									if (isValid) return callback(null, cachedResult);
+								}
+								fetchContentRaw(url, cachedResult, callback);
+							});
+						},
+						(url, callback) => fetchContentRaw(url, undefined, callback)
+					);
+
+					const isAllowed = uri => {
+						for (const allowed of allowedUris) {
+							if (typeof allowed === "string") {
+								if (uri.startsWith(allowed)) return true;
+							} else if (typeof allowed === "function") {
+								if (allowed(uri)) return true;
+							} else {
+								if (allowed.test(uri)) return true;
+							}
+						}
+						return false;
+					};
+
+					const getInfo = cachedWithKey(
+						/**
+						 * @param {string} url the url
+						 * @param {function((Error | null)=, { entry: LockfileEntry, content: Buffer }=): void} callback callback
+						 * @returns {void}
+						 */
+						(url, callback) => {
+							if (!isAllowed(url)) {
+								return callback(
+									new Error(
+										`${url} doesn't match the allowedUris policy. These URIs are allowed:\n${allowedUris
+											.map(uri => ` - ${uri}`)
+											.join("\n")}`
+									)
+								);
+							}
+							getLockfile((err, lockfile) => {
+								if (err) return callback(err);
+								const entryOrString = lockfile.entries.get(url);
+								if (!entryOrString) {
+									if (frozen) {
+										return callback(
+											new Error(
+												`${url} has no lockfile entry and lockfile is frozen`
+											)
+										);
+									}
+									resolveContent(url, null, (err, result) => {
+										if (err) return callback(err);
+										storeResult(lockfile, url, result, callback);
+									});
+									return;
+								}
+								if (typeof entryOrString === "string") {
+									const entryTag = entryOrString;
+									resolveContent(url, null, (err, result) => {
+										if (err) return callback(err);
+										if (!result.storeLock || entryTag === "ignore")
+											return callback(null, result);
+										if (frozen) {
+											return callback(
+												new Error(
+													`${url} used to have ${entryTag} lockfile entry and has content now, but lockfile is frozen`
+												)
+											);
+										}
+										if (!upgrade) {
+											return callback(
+												new Error(
+													`${url} used to have ${entryTag} lockfile entry and has content now.
+This should be reflected in the lockfile, so this lockfile entry must be upgraded, but upgrading is not enabled.
+Remove this line from the lockfile to force upgrading.`
+												)
+											);
+										}
+										storeResult(lockfile, url, result, callback);
+									});
+									return;
+								}
+								let entry = entryOrString;
+								const doFetch = lockedContent => {
+									resolveContent(url, entry.integrity, (err, result) => {
+										if (err) {
+											if (lockedContent) {
+												logger.warn(
+													`Upgrade request to ${url} failed: ${err.message}`
+												);
+												logger.debug(err.stack);
+												return callback(null, {
+													entry,
+													content: lockedContent
+												});
+											}
+											return callback(err);
+										}
+										if (!result.storeLock) {
+											// When the lockfile entry should be no-cache
+											// we need to update the lockfile
+											if (frozen) {
+												return callback(
+													new Error(
+														`${url} has a lockfile entry and is no-cache now, but lockfile is frozen\nLockfile: ${entryToString(
+															entry
+														)}`
+													)
+												);
+											}
+											storeResult(lockfile, url, result, callback);
+											return;
+										}
+										if (!areLockfileEntriesEqual(result.entry, entry)) {
+											// When the lockfile entry is outdated
+											// we need to update the lockfile
+											if (frozen) {
+												return callback(
+													new Error(
+														`${url} has an outdated lockfile entry, but lockfile is frozen\nLockfile: ${entryToString(
+															entry
+														)}\nExpected: ${entryToString(result.entry)}`
+													)
+												);
+											}
+											storeResult(lockfile, url, result, callback);
+											return;
+										}
+										if (!lockedContent && cacheLocation) {
+											// When the lockfile cache content is missing
+											// we need to update the lockfile
+											if (frozen) {
+												return callback(
+													new Error(
+														`${url} is missing content in the lockfile cache, but lockfile is frozen\nLockfile: ${entryToString(
+															entry
+														)}`
+													)
+												);
+											}
+											storeResult(lockfile, url, result, callback);
+											return;
+										}
+										return callback(null, result);
+									});
+								};
+								if (cacheLocation) {
+									// When there is a lockfile cache
+									// we read the content from there
+									const key = getCacheKey(entry.resolved);
+									const filePath = join(intermediateFs, cacheLocation, key);
+									fs.readFile(filePath, (err, result) => {
+										const content = /** @type {Buffer} */ (result);
+										if (err) {
+											if (err.code === "ENOENT") return doFetch();
+											return callback(err);
+										}
+										const continueWithCachedContent = result => {
+											if (!upgrade) {
+												// When not in upgrade mode, we accept the result from the lockfile cache
+												return callback(null, { entry, content });
+											}
+											return doFetch(content);
+										};
+										if (!verifyIntegrity(content, entry.integrity)) {
+											let contentWithChangedEol;
+											let isEolChanged = false;
+											try {
+												contentWithChangedEol = Buffer.from(
+													content.toString("utf-8").replace(/\r\n/g, "\n")
+												);
+												isEolChanged = verifyIntegrity(
+													contentWithChangedEol,
+													entry.integrity
+												);
+											} catch (e) {
+												// ignore
+											}
+											if (isEolChanged) {
+												if (!warnedAboutEol) {
+													const explainer = `Incorrect end of line sequence was detected in the lockfile cache.
+The lockfile cache is protected by integrity checks, so any external modification will lead to a corrupted lockfile cache.
+When using git make sure to configure .gitattributes correctly for the lockfile cache:
+  **/*webpack.lock.data/** -text
+This will avoid that the end of line sequence is changed by git on Windows.`;
+													if (frozen) {
+														logger.error(explainer);
+													} else {
+														logger.warn(explainer);
+														logger.info(
+															"Lockfile cache will be automatically fixed now, but when lockfile is frozen this would result in an error."
+														);
+													}
+													warnedAboutEol = true;
+												}
+												if (!frozen) {
+													// "fix" the end of line sequence of the lockfile content
+													logger.log(
+														`${filePath} fixed end of line sequence (\\r\\n instead of \\n).`
+													);
+													intermediateFs.writeFile(
+														filePath,
+														contentWithChangedEol,
+														err => {
+															if (err) return callback(err);
+															continueWithCachedContent(contentWithChangedEol);
+														}
+													);
+													return;
+												}
+											}
+											if (frozen) {
+												return callback(
+													new Error(
+														`${
+															entry.resolved
+														} integrity mismatch, expected content with integrity ${
+															entry.integrity
+														} but got ${computeIntegrity(content)}.
+Lockfile corrupted (${
+															isEolChanged
+																? "end of line sequence was unexpectedly changed"
+																: "incorrectly merged? changed by other tools?"
+														}).
+Run build with un-frozen lockfile to automatically fix lockfile.`
+													)
+												);
+											} else {
+												// "fix" the lockfile entry to the correct integrity
+												// the content has priority over the integrity value
+												entry = {
+													...entry,
+													integrity: computeIntegrity(content)
+												};
+												storeLockEntry(lockfile, url, entry);
+											}
+										}
+										continueWithCachedContent(result);
+									});
+								} else {
+									doFetch();
+								}
+							});
+						}
+					);
+
+					const respondWithUrlModule = (url, resourceData, callback) => {
+						getInfo(url.href, (err, result) => {
+							if (err) return callback(err);
+							resourceData.resource = url.href;
+							resourceData.path = url.origin + url.pathname;
+							resourceData.query = url.search;
+							resourceData.fragment = url.hash;
+							resourceData.context = new URL(
+								".",
+								result.entry.resolved
+							).href.slice(0, -1);
+							resourceData.data.mimetype = result.entry.contentType;
+							callback(null, true);
+						});
+					};
+					normalModuleFactory.hooks.resolveForScheme
+						.for(scheme)
+						.tapAsync(
+							"HttpUriPlugin",
+							(resourceData, resolveData, callback) => {
+								respondWithUrlModule(
+									new URL(resourceData.resource),
+									resourceData,
+									callback
+								);
+							}
+						);
+					normalModuleFactory.hooks.resolveInScheme
+						.for(scheme)
+						.tapAsync("HttpUriPlugin", (resourceData, data, callback) => {
+							// Only handle relative urls (./xxx, ../xxx, /xxx, //xxx)
+							if (
+								data.dependencyType !== "url" &&
+								!/^\.{0,2}\//.test(resourceData.resource)
+							) {
+								return callback();
+							}
+							respondWithUrlModule(
+								new URL(resourceData.resource, data.context + "/"),
+								resourceData,
+								callback
+							);
+						});
+					const hooks = NormalModule.getCompilationHooks(compilation);
+					hooks.readResourceForScheme
+						.for(scheme)
+						.tapAsync("HttpUriPlugin", (resource, module, callback) => {
+							return getInfo(resource, (err, result) => {
+								if (err) return callback(err);
+								module.buildInfo.resourceIntegrity = result.entry.integrity;
+								callback(null, result.content);
+							});
+						});
+					hooks.needBuild.tapAsync(
+						"HttpUriPlugin",
+						(module, context, callback) => {
+							if (
+								module.resource &&
+								module.resource.startsWith(`${scheme}://`)
+							) {
+								getInfo(module.resource, (err, result) => {
+									if (err) return callback(err);
+									if (
+										result.entry.integrity !==
+										module.buildInfo.resourceIntegrity
+									) {
+										return callback(null, true);
+									}
+									callback();
+								});
+							} else {
+								return callback();
+							}
+						}
+					);
+				}
+				compilation.hooks.finishModules.tapAsync(
+					"HttpUriPlugin",
+					(modules, callback) => {
+						if (!lockfileUpdates) return callback();
+						const ext = extname(lockfileLocation);
+						const tempFile = join(
+							intermediateFs,
+							dirname(intermediateFs, lockfileLocation),
+							`.${basename(lockfileLocation, ext)}.${
+								(Math.random() * 10000) | 0
+							}${ext}`
+						);
+
+						const writeDone = () => {
+							const nextOperation = inProgressWrite.shift();
+							if (nextOperation) {
+								nextOperation();
+							} else {
+								inProgressWrite = undefined;
+							}
+						};
+						const runWrite = () => {
+							intermediateFs.readFile(lockfileLocation, (err, buffer) => {
+								if (err && err.code !== "ENOENT") {
+									writeDone();
+									return callback(err);
+								}
+								const lockfile = buffer
+									? Lockfile.parse(buffer.toString("utf-8"))
+									: new Lockfile();
+								for (const [key, value] of lockfileUpdates) {
+									lockfile.entries.set(key, value);
+								}
+								intermediateFs.writeFile(tempFile, lockfile.toString(), err => {
+									if (err) {
+										writeDone();
+										return intermediateFs.unlink(tempFile, () => callback(err));
+									}
+									intermediateFs.rename(tempFile, lockfileLocation, err => {
+										if (err) {
+											writeDone();
+											return intermediateFs.unlink(tempFile, () =>
+												callback(err)
+											);
+										}
+										writeDone();
+										callback();
+									});
+								});
+							});
+						};
+						if (inProgressWrite) {
+							inProgressWrite.push(runWrite);
+						} else {
+							inProgressWrite = [];
+							runWrite();
+						}
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = HttpUriPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ArraySerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ArraySerializer.js
new file mode 100644
index 0000000..9bb2d85
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ArraySerializer.js
@@ -0,0 +1,22 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class ArraySerializer {
+	serialize(array, { write }) {
+		write(array.length);
+		for (const item of array) write(item);
+	}
+	deserialize({ read }) {
+		const length = read();
+		const array = [];
+		for (let i = 0; i < length; i++) {
+			array.push(read());
+		}
+		return array;
+	}
+}
+
+module.exports = ArraySerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/BinaryMiddleware.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/BinaryMiddleware.js
new file mode 100644
index 0000000..34326a0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/BinaryMiddleware.js
@@ -0,0 +1,950 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const memoize = require("../util/memoize");
+const SerializerMiddleware = require("./SerializerMiddleware");
+
+/** @typedef {import("./types").BufferSerializableType} BufferSerializableType */
+/** @typedef {import("./types").PrimitiveSerializableType} PrimitiveSerializableType */
+
+/*
+Format:
+
+File -> Section*
+
+Section -> NullsSection |
+					 BooleansSection |
+					 F64NumbersSection |
+					 I32NumbersSection |
+					 I8NumbersSection |
+					 ShortStringSection |
+					 StringSection |
+					 BufferSection |
+					 NopSection
+
+
+
+NullsSection ->
+	NullHeaderByte | Null2HeaderByte | Null3HeaderByte |
+	Nulls8HeaderByte 0xnn (n:count - 4) |
+	Nulls32HeaderByte n:ui32 (n:count - 260) |
+BooleansSection -> TrueHeaderByte | FalseHeaderByte | BooleansSectionHeaderByte BooleansCountAndBitsByte
+F64NumbersSection -> F64NumbersSectionHeaderByte f64*
+I32NumbersSection -> I32NumbersSectionHeaderByte i32*
+I8NumbersSection -> I8NumbersSectionHeaderByte i8*
+ShortStringSection -> ShortStringSectionHeaderByte ascii-byte*
+StringSection -> StringSectionHeaderByte i32:length utf8-byte*
+BufferSection -> BufferSectionHeaderByte i32:length byte*
+NopSection --> NopSectionHeaderByte
+
+ShortStringSectionHeaderByte -> 0b1nnn_nnnn (n:length)
+
+F64NumbersSectionHeaderByte -> 0b001n_nnnn (n:count - 1)
+I32NumbersSectionHeaderByte -> 0b010n_nnnn (n:count - 1)
+I8NumbersSectionHeaderByte -> 0b011n_nnnn (n:count - 1)
+
+NullsSectionHeaderByte -> 0b0001_nnnn (n:count - 1)
+BooleansCountAndBitsByte ->
+	0b0000_1xxx (count = 3) |
+	0b0001_xxxx (count = 4) |
+	0b001x_xxxx (count = 5) |
+	0b01xx_xxxx (count = 6) |
+	0b1nnn_nnnn (n:count - 7, 7 <= count <= 133)
+	0xff n:ui32 (n:count, 134 <= count < 2^32)
+
+StringSectionHeaderByte -> 0b0000_1110
+BufferSectionHeaderByte -> 0b0000_1111
+NopSectionHeaderByte -> 0b0000_1011
+FalseHeaderByte -> 0b0000_1100
+TrueHeaderByte -> 0b0000_1101
+
+RawNumber -> n (n <= 10)
+
+*/
+
+const LAZY_HEADER = 0x0b;
+const TRUE_HEADER = 0x0c;
+const FALSE_HEADER = 0x0d;
+const BOOLEANS_HEADER = 0x0e;
+const NULL_HEADER = 0x10;
+const NULL2_HEADER = 0x11;
+const NULL3_HEADER = 0x12;
+const NULLS8_HEADER = 0x13;
+const NULLS32_HEADER = 0x14;
+const NULL_AND_I8_HEADER = 0x15;
+const NULL_AND_I32_HEADER = 0x16;
+const NULL_AND_TRUE_HEADER = 0x17;
+const NULL_AND_FALSE_HEADER = 0x18;
+const STRING_HEADER = 0x1e;
+const BUFFER_HEADER = 0x1f;
+const I8_HEADER = 0x60;
+const I32_HEADER = 0x40;
+const F64_HEADER = 0x20;
+const SHORT_STRING_HEADER = 0x80;
+
+/** Uplift high-order bits */
+const NUMBERS_HEADER_MASK = 0xe0;
+const NUMBERS_COUNT_MASK = 0x1f; // 0b0001_1111
+const SHORT_STRING_LENGTH_MASK = 0x7f; // 0b0111_1111
+
+const HEADER_SIZE = 1;
+const I8_SIZE = 1;
+const I32_SIZE = 4;
+const F64_SIZE = 8;
+
+const MEASURE_START_OPERATION = Symbol("MEASURE_START_OPERATION");
+const MEASURE_END_OPERATION = Symbol("MEASURE_END_OPERATION");
+
+/** @typedef {typeof MEASURE_START_OPERATION} MEASURE_START_OPERATION_TYPE */
+/** @typedef {typeof MEASURE_END_OPERATION} MEASURE_END_OPERATION_TYPE */
+
+const identifyNumber = n => {
+	if (n === (n | 0)) {
+		if (n <= 127 && n >= -128) return 0;
+		if (n <= 2147483647 && n >= -2147483648) return 1;
+	}
+	return 2;
+};
+
+/**
+ * @typedef {PrimitiveSerializableType[]} DeserializedType
+ * @typedef {BufferSerializableType[]} SerializedType
+ * @extends {SerializerMiddleware<DeserializedType, SerializedType>}
+ */
+class BinaryMiddleware extends SerializerMiddleware {
+	/**
+	 * @param {DeserializedType} data data
+	 * @param {Object} context context object
+	 * @returns {SerializedType|Promise<SerializedType>} serialized data
+	 */
+	serialize(data, context) {
+		return this._serialize(data, context);
+	}
+
+	_serializeLazy(fn, context) {
+		return SerializerMiddleware.serializeLazy(fn, data =>
+			this._serialize(data, context)
+		);
+	}
+
+	/**
+	 * @param {DeserializedType} data data
+	 * @param {Object} context context object
+	 * @param {{ leftOverBuffer: Buffer | null, allocationSize: number, increaseCounter: number }} allocationScope allocation scope
+	 * @returns {SerializedType} serialized data
+	 */
+	_serialize(
+		data,
+		context,
+		allocationScope = {
+			allocationSize: 1024,
+			increaseCounter: 0,
+			leftOverBuffer: null
+		}
+	) {
+		/** @type {Buffer} */
+		let leftOverBuffer = null;
+		/** @type {BufferSerializableType[]} */
+		let buffers = [];
+		/** @type {Buffer} */
+		let currentBuffer = allocationScope ? allocationScope.leftOverBuffer : null;
+		allocationScope.leftOverBuffer = null;
+		let currentPosition = 0;
+		if (currentBuffer === null) {
+			currentBuffer = Buffer.allocUnsafe(allocationScope.allocationSize);
+		}
+		const allocate = bytesNeeded => {
+			if (currentBuffer !== null) {
+				if (currentBuffer.length - currentPosition >= bytesNeeded) return;
+				flush();
+			}
+			if (leftOverBuffer && leftOverBuffer.length >= bytesNeeded) {
+				currentBuffer = leftOverBuffer;
+				leftOverBuffer = null;
+			} else {
+				currentBuffer = Buffer.allocUnsafe(
+					Math.max(bytesNeeded, allocationScope.allocationSize)
+				);
+				if (
+					!(allocationScope.increaseCounter =
+						(allocationScope.increaseCounter + 1) % 4) &&
+					allocationScope.allocationSize < 16777216
+				) {
+					allocationScope.allocationSize = allocationScope.allocationSize << 1;
+				}
+			}
+		};
+		const flush = () => {
+			if (currentBuffer !== null) {
+				if (currentPosition > 0) {
+					buffers.push(
+						Buffer.from(
+							currentBuffer.buffer,
+							currentBuffer.byteOffset,
+							currentPosition
+						)
+					);
+				}
+				if (
+					!leftOverBuffer ||
+					leftOverBuffer.length < currentBuffer.length - currentPosition
+				) {
+					leftOverBuffer = Buffer.from(
+						currentBuffer.buffer,
+						currentBuffer.byteOffset + currentPosition,
+						currentBuffer.byteLength - currentPosition
+					);
+				}
+
+				currentBuffer = null;
+				currentPosition = 0;
+			}
+		};
+		const writeU8 = byte => {
+			currentBuffer.writeUInt8(byte, currentPosition++);
+		};
+		const writeU32 = ui32 => {
+			currentBuffer.writeUInt32LE(ui32, currentPosition);
+			currentPosition += 4;
+		};
+		const measureStack = [];
+		const measureStart = () => {
+			measureStack.push(buffers.length, currentPosition);
+		};
+		const measureEnd = () => {
+			const oldPos = measureStack.pop();
+			const buffersIndex = measureStack.pop();
+			let size = currentPosition - oldPos;
+			for (let i = buffersIndex; i < buffers.length; i++) {
+				size += buffers[i].length;
+			}
+			return size;
+		};
+		for (let i = 0; i < data.length; i++) {
+			const thing = data[i];
+			switch (typeof thing) {
+				case "function": {
+					if (!SerializerMiddleware.isLazy(thing))
+						throw new Error("Unexpected function " + thing);
+					/** @type {SerializedType | (() => SerializedType)} */
+					let serializedData =
+						SerializerMiddleware.getLazySerializedValue(thing);
+					if (serializedData === undefined) {
+						if (SerializerMiddleware.isLazy(thing, this)) {
+							flush();
+							allocationScope.leftOverBuffer = leftOverBuffer;
+							const result =
+								/** @type {(Exclude<PrimitiveSerializableType, Promise<PrimitiveSerializableType>>)[]} */ (
+									thing()
+								);
+							const data = this._serialize(result, context, allocationScope);
+							leftOverBuffer = allocationScope.leftOverBuffer;
+							allocationScope.leftOverBuffer = null;
+							SerializerMiddleware.setLazySerializedValue(thing, data);
+							serializedData = data;
+						} else {
+							serializedData = this._serializeLazy(thing, context);
+							flush();
+							buffers.push(serializedData);
+							break;
+						}
+					} else {
+						if (typeof serializedData === "function") {
+							flush();
+							buffers.push(serializedData);
+							break;
+						}
+					}
+					const lengths = [];
+					for (const item of serializedData) {
+						let last;
+						if (typeof item === "function") {
+							lengths.push(0);
+						} else if (item.length === 0) {
+							// ignore
+						} else if (
+							lengths.length > 0 &&
+							(last = lengths[lengths.length - 1]) !== 0
+						) {
+							const remaining = 0xffffffff - last;
+							if (remaining >= item.length) {
+								lengths[lengths.length - 1] += item.length;
+							} else {
+								lengths.push(item.length - remaining);
+								lengths[lengths.length - 2] = 0xffffffff;
+							}
+						} else {
+							lengths.push(item.length);
+						}
+					}
+					allocate(5 + lengths.length * 4);
+					writeU8(LAZY_HEADER);
+					writeU32(lengths.length);
+					for (const l of lengths) {
+						writeU32(l);
+					}
+					flush();
+					for (const item of serializedData) {
+						buffers.push(item);
+					}
+					break;
+				}
+				case "string": {
+					const len = Buffer.byteLength(thing);
+					if (len >= 128 || len !== thing.length) {
+						allocate(len + HEADER_SIZE + I32_SIZE);
+						writeU8(STRING_HEADER);
+						writeU32(len);
+						currentBuffer.write(thing, currentPosition);
+						currentPosition += len;
+					} else if (len >= 70) {
+						allocate(len + HEADER_SIZE);
+						writeU8(SHORT_STRING_HEADER | len);
+
+						currentBuffer.write(thing, currentPosition, "latin1");
+						currentPosition += len;
+					} else {
+						allocate(len + HEADER_SIZE);
+						writeU8(SHORT_STRING_HEADER | len);
+
+						for (let i = 0; i < len; i++) {
+							currentBuffer[currentPosition++] = thing.charCodeAt(i);
+						}
+					}
+					break;
+				}
+				case "number": {
+					const type = identifyNumber(thing);
+					if (type === 0 && thing >= 0 && thing <= 10) {
+						// shortcut for very small numbers
+						allocate(I8_SIZE);
+						writeU8(thing);
+						break;
+					}
+					/**
+					 * amount of numbers to write
+					 * @type {number}
+					 */
+					let n = 1;
+					for (; n < 32 && i + n < data.length; n++) {
+						const item = data[i + n];
+						if (typeof item !== "number") break;
+						if (identifyNumber(item) !== type) break;
+					}
+					switch (type) {
+						case 0:
+							allocate(HEADER_SIZE + I8_SIZE * n);
+							writeU8(I8_HEADER | (n - 1));
+							while (n > 0) {
+								currentBuffer.writeInt8(
+									/** @type {number} */ (data[i]),
+									currentPosition
+								);
+								currentPosition += I8_SIZE;
+								n--;
+								i++;
+							}
+							break;
+						case 1:
+							allocate(HEADER_SIZE + I32_SIZE * n);
+							writeU8(I32_HEADER | (n - 1));
+							while (n > 0) {
+								currentBuffer.writeInt32LE(
+									/** @type {number} */ (data[i]),
+									currentPosition
+								);
+								currentPosition += I32_SIZE;
+								n--;
+								i++;
+							}
+							break;
+						case 2:
+							allocate(HEADER_SIZE + F64_SIZE * n);
+							writeU8(F64_HEADER | (n - 1));
+							while (n > 0) {
+								currentBuffer.writeDoubleLE(
+									/** @type {number} */ (data[i]),
+									currentPosition
+								);
+								currentPosition += F64_SIZE;
+								n--;
+								i++;
+							}
+							break;
+					}
+
+					i--;
+					break;
+				}
+				case "boolean": {
+					let lastByte = thing === true ? 1 : 0;
+					const bytes = [];
+					let count = 1;
+					let n;
+					for (n = 1; n < 0xffffffff && i + n < data.length; n++) {
+						const item = data[i + n];
+						if (typeof item !== "boolean") break;
+						const pos = count & 0x7;
+						if (pos === 0) {
+							bytes.push(lastByte);
+							lastByte = item === true ? 1 : 0;
+						} else if (item === true) {
+							lastByte |= 1 << pos;
+						}
+						count++;
+					}
+					i += count - 1;
+					if (count === 1) {
+						allocate(HEADER_SIZE);
+						writeU8(lastByte === 1 ? TRUE_HEADER : FALSE_HEADER);
+					} else if (count === 2) {
+						allocate(HEADER_SIZE * 2);
+						writeU8(lastByte & 1 ? TRUE_HEADER : FALSE_HEADER);
+						writeU8(lastByte & 2 ? TRUE_HEADER : FALSE_HEADER);
+					} else if (count <= 6) {
+						allocate(HEADER_SIZE + I8_SIZE);
+						writeU8(BOOLEANS_HEADER);
+						writeU8((1 << count) | lastByte);
+					} else if (count <= 133) {
+						allocate(HEADER_SIZE + I8_SIZE + I8_SIZE * bytes.length + I8_SIZE);
+						writeU8(BOOLEANS_HEADER);
+						writeU8(0x80 | (count - 7));
+						for (const byte of bytes) writeU8(byte);
+						writeU8(lastByte);
+					} else {
+						allocate(
+							HEADER_SIZE +
+								I8_SIZE +
+								I32_SIZE +
+								I8_SIZE * bytes.length +
+								I8_SIZE
+						);
+						writeU8(BOOLEANS_HEADER);
+						writeU8(0xff);
+						writeU32(count);
+						for (const byte of bytes) writeU8(byte);
+						writeU8(lastByte);
+					}
+					break;
+				}
+				case "object": {
+					if (thing === null) {
+						let n;
+						for (n = 1; n < 0x100000104 && i + n < data.length; n++) {
+							const item = data[i + n];
+							if (item !== null) break;
+						}
+						i += n - 1;
+						if (n === 1) {
+							if (i + 1 < data.length) {
+								const next = data[i + 1];
+								if (next === true) {
+									allocate(HEADER_SIZE);
+									writeU8(NULL_AND_TRUE_HEADER);
+									i++;
+								} else if (next === false) {
+									allocate(HEADER_SIZE);
+									writeU8(NULL_AND_FALSE_HEADER);
+									i++;
+								} else if (typeof next === "number") {
+									const type = identifyNumber(next);
+									if (type === 0) {
+										allocate(HEADER_SIZE + I8_SIZE);
+										writeU8(NULL_AND_I8_HEADER);
+										currentBuffer.writeInt8(next, currentPosition);
+										currentPosition += I8_SIZE;
+										i++;
+									} else if (type === 1) {
+										allocate(HEADER_SIZE + I32_SIZE);
+										writeU8(NULL_AND_I32_HEADER);
+										currentBuffer.writeInt32LE(next, currentPosition);
+										currentPosition += I32_SIZE;
+										i++;
+									} else {
+										allocate(HEADER_SIZE);
+										writeU8(NULL_HEADER);
+									}
+								} else {
+									allocate(HEADER_SIZE);
+									writeU8(NULL_HEADER);
+								}
+							} else {
+								allocate(HEADER_SIZE);
+								writeU8(NULL_HEADER);
+							}
+						} else if (n === 2) {
+							allocate(HEADER_SIZE);
+							writeU8(NULL2_HEADER);
+						} else if (n === 3) {
+							allocate(HEADER_SIZE);
+							writeU8(NULL3_HEADER);
+						} else if (n < 260) {
+							allocate(HEADER_SIZE + I8_SIZE);
+							writeU8(NULLS8_HEADER);
+							writeU8(n - 4);
+						} else {
+							allocate(HEADER_SIZE + I32_SIZE);
+							writeU8(NULLS32_HEADER);
+							writeU32(n - 260);
+						}
+					} else if (Buffer.isBuffer(thing)) {
+						if (thing.length < 8192) {
+							allocate(HEADER_SIZE + I32_SIZE + thing.length);
+							writeU8(BUFFER_HEADER);
+							writeU32(thing.length);
+							thing.copy(currentBuffer, currentPosition);
+							currentPosition += thing.length;
+						} else {
+							allocate(HEADER_SIZE + I32_SIZE);
+							writeU8(BUFFER_HEADER);
+							writeU32(thing.length);
+							flush();
+							buffers.push(thing);
+						}
+					}
+					break;
+				}
+				case "symbol": {
+					if (thing === MEASURE_START_OPERATION) {
+						measureStart();
+					} else if (thing === MEASURE_END_OPERATION) {
+						const size = measureEnd();
+						allocate(HEADER_SIZE + I32_SIZE);
+						writeU8(I32_HEADER);
+						currentBuffer.writeInt32LE(size, currentPosition);
+						currentPosition += I32_SIZE;
+					}
+					break;
+				}
+			}
+		}
+		flush();
+
+		allocationScope.leftOverBuffer = leftOverBuffer;
+
+		// avoid leaking memory
+		currentBuffer = null;
+		leftOverBuffer = null;
+		allocationScope = undefined;
+		const _buffers = buffers;
+		buffers = undefined;
+		return _buffers;
+	}
+
+	/**
+	 * @param {SerializedType} data data
+	 * @param {Object} context context object
+	 * @returns {DeserializedType|Promise<DeserializedType>} deserialized data
+	 */
+	deserialize(data, context) {
+		return this._deserialize(data, context);
+	}
+
+	_createLazyDeserialized(content, context) {
+		return SerializerMiddleware.createLazy(
+			memoize(() => this._deserialize(content, context)),
+			this,
+			undefined,
+			content
+		);
+	}
+
+	_deserializeLazy(fn, context) {
+		return SerializerMiddleware.deserializeLazy(fn, data =>
+			this._deserialize(data, context)
+		);
+	}
+
+	/**
+	 * @param {SerializedType} data data
+	 * @param {Object} context context object
+	 * @returns {DeserializedType} deserialized data
+	 */
+	_deserialize(data, context) {
+		let currentDataItem = 0;
+		let currentBuffer = data[0];
+		let currentIsBuffer = Buffer.isBuffer(currentBuffer);
+		let currentPosition = 0;
+
+		const retainedBuffer = context.retainedBuffer || (x => x);
+
+		const checkOverflow = () => {
+			if (currentPosition >= currentBuffer.length) {
+				currentPosition = 0;
+				currentDataItem++;
+				currentBuffer =
+					currentDataItem < data.length ? data[currentDataItem] : null;
+				currentIsBuffer = Buffer.isBuffer(currentBuffer);
+			}
+		};
+		const isInCurrentBuffer = n => {
+			return currentIsBuffer && n + currentPosition <= currentBuffer.length;
+		};
+		const ensureBuffer = () => {
+			if (!currentIsBuffer) {
+				throw new Error(
+					currentBuffer === null
+						? "Unexpected end of stream"
+						: "Unexpected lazy element in stream"
+				);
+			}
+		};
+		/**
+		 * Reads n bytes
+		 * @param {number} n amount of bytes to read
+		 * @returns {Buffer} buffer with bytes
+		 */
+		const read = n => {
+			ensureBuffer();
+			const rem = currentBuffer.length - currentPosition;
+			if (rem < n) {
+				const buffers = [read(rem)];
+				n -= rem;
+				ensureBuffer();
+				while (currentBuffer.length < n) {
+					const b = /** @type {Buffer} */ (currentBuffer);
+					buffers.push(b);
+					n -= b.length;
+					currentDataItem++;
+					currentBuffer =
+						currentDataItem < data.length ? data[currentDataItem] : null;
+					currentIsBuffer = Buffer.isBuffer(currentBuffer);
+					ensureBuffer();
+				}
+				buffers.push(read(n));
+				return Buffer.concat(buffers);
+			}
+			const b = /** @type {Buffer} */ (currentBuffer);
+			const res = Buffer.from(b.buffer, b.byteOffset + currentPosition, n);
+			currentPosition += n;
+			checkOverflow();
+			return res;
+		};
+		/**
+		 * Reads up to n bytes
+		 * @param {number} n amount of bytes to read
+		 * @returns {Buffer} buffer with bytes
+		 */
+		const readUpTo = n => {
+			ensureBuffer();
+			const rem = currentBuffer.length - currentPosition;
+			if (rem < n) {
+				n = rem;
+			}
+			const b = /** @type {Buffer} */ (currentBuffer);
+			const res = Buffer.from(b.buffer, b.byteOffset + currentPosition, n);
+			currentPosition += n;
+			checkOverflow();
+			return res;
+		};
+		const readU8 = () => {
+			ensureBuffer();
+			/**
+			 * There is no need to check remaining buffer size here
+			 * since {@link checkOverflow} guarantees at least one byte remaining
+			 */
+			const byte = /** @type {Buffer} */ (currentBuffer).readUInt8(
+				currentPosition
+			);
+			currentPosition += I8_SIZE;
+			checkOverflow();
+			return byte;
+		};
+		const readU32 = () => {
+			return read(I32_SIZE).readUInt32LE(0);
+		};
+		const readBits = (data, n) => {
+			let mask = 1;
+			while (n !== 0) {
+				result.push((data & mask) !== 0);
+				mask = mask << 1;
+				n--;
+			}
+		};
+		const dispatchTable = Array.from({ length: 256 }).map((_, header) => {
+			switch (header) {
+				case LAZY_HEADER:
+					return () => {
+						const count = readU32();
+						const lengths = Array.from({ length: count }).map(() => readU32());
+						const content = [];
+						for (let l of lengths) {
+							if (l === 0) {
+								if (typeof currentBuffer !== "function") {
+									throw new Error("Unexpected non-lazy element in stream");
+								}
+								content.push(currentBuffer);
+								currentDataItem++;
+								currentBuffer =
+									currentDataItem < data.length ? data[currentDataItem] : null;
+								currentIsBuffer = Buffer.isBuffer(currentBuffer);
+							} else {
+								do {
+									const buf = readUpTo(l);
+									l -= buf.length;
+									content.push(retainedBuffer(buf));
+								} while (l > 0);
+							}
+						}
+						result.push(this._createLazyDeserialized(content, context));
+					};
+				case BUFFER_HEADER:
+					return () => {
+						const len = readU32();
+						result.push(retainedBuffer(read(len)));
+					};
+				case TRUE_HEADER:
+					return () => result.push(true);
+				case FALSE_HEADER:
+					return () => result.push(false);
+				case NULL3_HEADER:
+					return () => result.push(null, null, null);
+				case NULL2_HEADER:
+					return () => result.push(null, null);
+				case NULL_HEADER:
+					return () => result.push(null);
+				case NULL_AND_TRUE_HEADER:
+					return () => result.push(null, true);
+				case NULL_AND_FALSE_HEADER:
+					return () => result.push(null, false);
+				case NULL_AND_I8_HEADER:
+					return () => {
+						if (currentIsBuffer) {
+							result.push(
+								null,
+								/** @type {Buffer} */ (currentBuffer).readInt8(currentPosition)
+							);
+							currentPosition += I8_SIZE;
+							checkOverflow();
+						} else {
+							result.push(null, read(I8_SIZE).readInt8(0));
+						}
+					};
+				case NULL_AND_I32_HEADER:
+					return () => {
+						result.push(null);
+						if (isInCurrentBuffer(I32_SIZE)) {
+							result.push(
+								/** @type {Buffer} */ (currentBuffer).readInt32LE(
+									currentPosition
+								)
+							);
+							currentPosition += I32_SIZE;
+							checkOverflow();
+						} else {
+							result.push(read(I32_SIZE).readInt32LE(0));
+						}
+					};
+				case NULLS8_HEADER:
+					return () => {
+						const len = readU8() + 4;
+						for (let i = 0; i < len; i++) {
+							result.push(null);
+						}
+					};
+				case NULLS32_HEADER:
+					return () => {
+						const len = readU32() + 260;
+						for (let i = 0; i < len; i++) {
+							result.push(null);
+						}
+					};
+				case BOOLEANS_HEADER:
+					return () => {
+						const innerHeader = readU8();
+						if ((innerHeader & 0xf0) === 0) {
+							readBits(innerHeader, 3);
+						} else if ((innerHeader & 0xe0) === 0) {
+							readBits(innerHeader, 4);
+						} else if ((innerHeader & 0xc0) === 0) {
+							readBits(innerHeader, 5);
+						} else if ((innerHeader & 0x80) === 0) {
+							readBits(innerHeader, 6);
+						} else if (innerHeader !== 0xff) {
+							let count = (innerHeader & 0x7f) + 7;
+							while (count > 8) {
+								readBits(readU8(), 8);
+								count -= 8;
+							}
+							readBits(readU8(), count);
+						} else {
+							let count = readU32();
+							while (count > 8) {
+								readBits(readU8(), 8);
+								count -= 8;
+							}
+							readBits(readU8(), count);
+						}
+					};
+				case STRING_HEADER:
+					return () => {
+						const len = readU32();
+						if (isInCurrentBuffer(len) && currentPosition + len < 0x7fffffff) {
+							result.push(
+								currentBuffer.toString(
+									undefined,
+									currentPosition,
+									currentPosition + len
+								)
+							);
+							currentPosition += len;
+							checkOverflow();
+						} else {
+							result.push(read(len).toString());
+						}
+					};
+				case SHORT_STRING_HEADER:
+					return () => result.push("");
+				case SHORT_STRING_HEADER | 1:
+					return () => {
+						if (currentIsBuffer && currentPosition < 0x7ffffffe) {
+							result.push(
+								currentBuffer.toString(
+									"latin1",
+									currentPosition,
+									currentPosition + 1
+								)
+							);
+							currentPosition++;
+							checkOverflow();
+						} else {
+							result.push(read(1).toString("latin1"));
+						}
+					};
+				case I8_HEADER:
+					return () => {
+						if (currentIsBuffer) {
+							result.push(
+								/** @type {Buffer} */ (currentBuffer).readInt8(currentPosition)
+							);
+							currentPosition++;
+							checkOverflow();
+						} else {
+							result.push(read(1).readInt8(0));
+						}
+					};
+				default:
+					if (header <= 10) {
+						return () => result.push(header);
+					} else if ((header & SHORT_STRING_HEADER) === SHORT_STRING_HEADER) {
+						const len = header & SHORT_STRING_LENGTH_MASK;
+						return () => {
+							if (
+								isInCurrentBuffer(len) &&
+								currentPosition + len < 0x7fffffff
+							) {
+								result.push(
+									currentBuffer.toString(
+										"latin1",
+										currentPosition,
+										currentPosition + len
+									)
+								);
+								currentPosition += len;
+								checkOverflow();
+							} else {
+								result.push(read(len).toString("latin1"));
+							}
+						};
+					} else if ((header & NUMBERS_HEADER_MASK) === F64_HEADER) {
+						const len = (header & NUMBERS_COUNT_MASK) + 1;
+						return () => {
+							const need = F64_SIZE * len;
+							if (isInCurrentBuffer(need)) {
+								for (let i = 0; i < len; i++) {
+									result.push(
+										/** @type {Buffer} */ (currentBuffer).readDoubleLE(
+											currentPosition
+										)
+									);
+									currentPosition += F64_SIZE;
+								}
+								checkOverflow();
+							} else {
+								const buf = read(need);
+								for (let i = 0; i < len; i++) {
+									result.push(buf.readDoubleLE(i * F64_SIZE));
+								}
+							}
+						};
+					} else if ((header & NUMBERS_HEADER_MASK) === I32_HEADER) {
+						const len = (header & NUMBERS_COUNT_MASK) + 1;
+						return () => {
+							const need = I32_SIZE * len;
+							if (isInCurrentBuffer(need)) {
+								for (let i = 0; i < len; i++) {
+									result.push(
+										/** @type {Buffer} */ (currentBuffer).readInt32LE(
+											currentPosition
+										)
+									);
+									currentPosition += I32_SIZE;
+								}
+								checkOverflow();
+							} else {
+								const buf = read(need);
+								for (let i = 0; i < len; i++) {
+									result.push(buf.readInt32LE(i * I32_SIZE));
+								}
+							}
+						};
+					} else if ((header & NUMBERS_HEADER_MASK) === I8_HEADER) {
+						const len = (header & NUMBERS_COUNT_MASK) + 1;
+						return () => {
+							const need = I8_SIZE * len;
+							if (isInCurrentBuffer(need)) {
+								for (let i = 0; i < len; i++) {
+									result.push(
+										/** @type {Buffer} */ (currentBuffer).readInt8(
+											currentPosition
+										)
+									);
+									currentPosition += I8_SIZE;
+								}
+								checkOverflow();
+							} else {
+								const buf = read(need);
+								for (let i = 0; i < len; i++) {
+									result.push(buf.readInt8(i * I8_SIZE));
+								}
+							}
+						};
+					} else {
+						return () => {
+							throw new Error(
+								`Unexpected header byte 0x${header.toString(16)}`
+							);
+						};
+					}
+			}
+		});
+
+		/** @type {DeserializedType} */
+		let result = [];
+		while (currentBuffer !== null) {
+			if (typeof currentBuffer === "function") {
+				result.push(this._deserializeLazy(currentBuffer, context));
+				currentDataItem++;
+				currentBuffer =
+					currentDataItem < data.length ? data[currentDataItem] : null;
+				currentIsBuffer = Buffer.isBuffer(currentBuffer);
+			} else {
+				const header = readU8();
+				dispatchTable[header]();
+			}
+		}
+
+		// avoid leaking memory in context
+		let _result = result;
+		result = undefined;
+		return _result;
+	}
+}
+
+module.exports = BinaryMiddleware;
+
+module.exports.MEASURE_START_OPERATION = MEASURE_START_OPERATION;
+module.exports.MEASURE_END_OPERATION = MEASURE_END_OPERATION;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/DateObjectSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/DateObjectSerializer.js
new file mode 100644
index 0000000..17418cd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/DateObjectSerializer.js
@@ -0,0 +1,16 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class DateObjectSerializer {
+	serialize(obj, { write }) {
+		write(obj.getTime());
+	}
+	deserialize({ read }) {
+		return new Date(read());
+	}
+}
+
+module.exports = DateObjectSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ErrorObjectSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ErrorObjectSerializer.js
new file mode 100644
index 0000000..0e168d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ErrorObjectSerializer.js
@@ -0,0 +1,27 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class ErrorObjectSerializer {
+	constructor(Type) {
+		this.Type = Type;
+	}
+
+	serialize(obj, { write }) {
+		write(obj.message);
+		write(obj.stack);
+	}
+
+	deserialize({ read }) {
+		const err = new this.Type();
+
+		err.message = read();
+		err.stack = read();
+
+		return err;
+	}
+}
+
+module.exports = ErrorObjectSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/FileMiddleware.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/FileMiddleware.js
new file mode 100644
index 0000000..deb6551
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/FileMiddleware.js
@@ -0,0 +1,665 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const { constants } = require("buffer");
+const { pipeline } = require("stream");
+const {
+	createBrotliCompress,
+	createBrotliDecompress,
+	createGzip,
+	createGunzip,
+	constants: zConstants
+} = require("zlib");
+const createHash = require("../util/createHash");
+const { dirname, join, mkdirp } = require("../util/fs");
+const memoize = require("../util/memoize");
+const SerializerMiddleware = require("./SerializerMiddleware");
+
+/** @typedef {typeof import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").IntermediateFileSystem} IntermediateFileSystem */
+/** @typedef {import("./types").BufferSerializableType} BufferSerializableType */
+
+/*
+Format:
+
+File -> Header Section*
+
+Version -> u32
+AmountOfSections -> u32
+SectionSize -> i32 (if less than zero represents lazy value)
+
+Header -> Version AmountOfSections SectionSize*
+
+Buffer -> n bytes
+Section -> Buffer
+
+*/
+
+// "wpc" + 1 in little-endian
+const VERSION = 0x01637077;
+const WRITE_LIMIT_TOTAL = 0x7fff0000;
+const WRITE_LIMIT_CHUNK = 511 * 1024 * 1024;
+
+/**
+ * @param {Buffer[]} buffers buffers
+ * @param {string | Hash} hashFunction hash function to use
+ * @returns {string} hash
+ */
+const hashForName = (buffers, hashFunction) => {
+	const hash = createHash(hashFunction);
+	for (const buf of buffers) hash.update(buf);
+	return /** @type {string} */ (hash.digest("hex"));
+};
+
+const COMPRESSION_CHUNK_SIZE = 100 * 1024 * 1024;
+const DECOMPRESSION_CHUNK_SIZE = 100 * 1024 * 1024;
+
+const writeUInt64LE = Buffer.prototype.writeBigUInt64LE
+	? (buf, value, offset) => {
+			buf.writeBigUInt64LE(BigInt(value), offset);
+	  }
+	: (buf, value, offset) => {
+			const low = value % 0x100000000;
+			const high = (value - low) / 0x100000000;
+			buf.writeUInt32LE(low, offset);
+			buf.writeUInt32LE(high, offset + 4);
+	  };
+
+const readUInt64LE = Buffer.prototype.readBigUInt64LE
+	? (buf, offset) => {
+			return Number(buf.readBigUInt64LE(offset));
+	  }
+	: (buf, offset) => {
+			const low = buf.readUInt32LE(offset);
+			const high = buf.readUInt32LE(offset + 4);
+			return high * 0x100000000 + low;
+	  };
+
+/**
+ * @typedef {Object} SerializeResult
+ * @property {string | false} name
+ * @property {number} size
+ * @property {Promise=} backgroundJob
+ */
+
+/**
+ * @param {FileMiddleware} middleware this
+ * @param {BufferSerializableType[] | Promise<BufferSerializableType[]>} data data to be serialized
+ * @param {string | boolean} name file base name
+ * @param {function(string | false, Buffer[], number): Promise<void>} writeFile writes a file
+ * @param {string | Hash} hashFunction hash function to use
+ * @returns {Promise<SerializeResult>} resulting file pointer and promise
+ */
+const serialize = async (
+	middleware,
+	data,
+	name,
+	writeFile,
+	hashFunction = "md4"
+) => {
+	/** @type {(Buffer[] | Buffer | SerializeResult | Promise<SerializeResult>)[]} */
+	const processedData = [];
+	/** @type {WeakMap<SerializeResult, function(): any | Promise<any>>} */
+	const resultToLazy = new WeakMap();
+	/** @type {Buffer[]} */
+	let lastBuffers = undefined;
+	for (const item of await data) {
+		if (typeof item === "function") {
+			if (!SerializerMiddleware.isLazy(item))
+				throw new Error("Unexpected function");
+			if (!SerializerMiddleware.isLazy(item, middleware)) {
+				throw new Error(
+					"Unexpected lazy value with non-this target (can't pass through lazy values)"
+				);
+			}
+			lastBuffers = undefined;
+			const serializedInfo = SerializerMiddleware.getLazySerializedValue(item);
+			if (serializedInfo) {
+				if (typeof serializedInfo === "function") {
+					throw new Error(
+						"Unexpected lazy value with non-this target (can't pass through lazy values)"
+					);
+				} else {
+					processedData.push(serializedInfo);
+				}
+			} else {
+				const content = item();
+				if (content) {
+					const options = SerializerMiddleware.getLazyOptions(item);
+					processedData.push(
+						serialize(
+							middleware,
+							content,
+							(options && options.name) || true,
+							writeFile,
+							hashFunction
+						).then(result => {
+							/** @type {any} */ (item).options.size = result.size;
+							resultToLazy.set(result, item);
+							return result;
+						})
+					);
+				} else {
+					throw new Error(
+						"Unexpected falsy value returned by lazy value function"
+					);
+				}
+			}
+		} else if (item) {
+			if (lastBuffers) {
+				lastBuffers.push(item);
+			} else {
+				lastBuffers = [item];
+				processedData.push(lastBuffers);
+			}
+		} else {
+			throw new Error("Unexpected falsy value in items array");
+		}
+	}
+	/** @type {Promise<any>[]} */
+	const backgroundJobs = [];
+	const resolvedData = (
+		await Promise.all(
+			/** @type {Promise<Buffer[] | Buffer | SerializeResult>[]} */ (
+				processedData
+			)
+		)
+	).map(item => {
+		if (Array.isArray(item) || Buffer.isBuffer(item)) return item;
+
+		backgroundJobs.push(item.backgroundJob);
+		// create pointer buffer from size and name
+		const name = /** @type {string} */ (item.name);
+		const nameBuffer = Buffer.from(name);
+		const buf = Buffer.allocUnsafe(8 + nameBuffer.length);
+		writeUInt64LE(buf, item.size, 0);
+		nameBuffer.copy(buf, 8, 0);
+		const lazy = resultToLazy.get(item);
+		SerializerMiddleware.setLazySerializedValue(lazy, buf);
+		return buf;
+	});
+	const lengths = [];
+	for (const item of resolvedData) {
+		if (Array.isArray(item)) {
+			let l = 0;
+			for (const b of item) l += b.length;
+			while (l > 0x7fffffff) {
+				lengths.push(0x7fffffff);
+				l -= 0x7fffffff;
+			}
+			lengths.push(l);
+		} else if (item) {
+			lengths.push(-item.length);
+		} else {
+			throw new Error("Unexpected falsy value in resolved data " + item);
+		}
+	}
+	const header = Buffer.allocUnsafe(8 + lengths.length * 4);
+	header.writeUInt32LE(VERSION, 0);
+	header.writeUInt32LE(lengths.length, 4);
+	for (let i = 0; i < lengths.length; i++) {
+		header.writeInt32LE(lengths[i], 8 + i * 4);
+	}
+	const buf = [header];
+	for (const item of resolvedData) {
+		if (Array.isArray(item)) {
+			for (const b of item) buf.push(b);
+		} else if (item) {
+			buf.push(item);
+		}
+	}
+	if (name === true) {
+		name = hashForName(buf, hashFunction);
+	}
+	let size = 0;
+	for (const b of buf) size += b.length;
+	backgroundJobs.push(writeFile(name, buf, size));
+	return {
+		size,
+		name,
+		backgroundJob:
+			backgroundJobs.length === 1
+				? backgroundJobs[0]
+				: Promise.all(backgroundJobs)
+	};
+};
+
+/**
+ * @param {FileMiddleware} middleware this
+ * @param {string | false} name filename
+ * @param {function(string | false): Promise<Buffer[]>} readFile read content of a file
+ * @returns {Promise<BufferSerializableType[]>} deserialized data
+ */
+const deserialize = async (middleware, name, readFile) => {
+	const contents = await readFile(name);
+	if (contents.length === 0) throw new Error("Empty file " + name);
+	let contentsIndex = 0;
+	let contentItem = contents[0];
+	let contentItemLength = contentItem.length;
+	let contentPosition = 0;
+	if (contentItemLength === 0) throw new Error("Empty file " + name);
+	const nextContent = () => {
+		contentsIndex++;
+		contentItem = contents[contentsIndex];
+		contentItemLength = contentItem.length;
+		contentPosition = 0;
+	};
+	const ensureData = n => {
+		if (contentPosition === contentItemLength) {
+			nextContent();
+		}
+		while (contentItemLength - contentPosition < n) {
+			const remaining = contentItem.slice(contentPosition);
+			let lengthFromNext = n - remaining.length;
+			const buffers = [remaining];
+			for (let i = contentsIndex + 1; i < contents.length; i++) {
+				const l = contents[i].length;
+				if (l > lengthFromNext) {
+					buffers.push(contents[i].slice(0, lengthFromNext));
+					contents[i] = contents[i].slice(lengthFromNext);
+					lengthFromNext = 0;
+					break;
+				} else {
+					buffers.push(contents[i]);
+					contentsIndex = i;
+					lengthFromNext -= l;
+				}
+			}
+			if (lengthFromNext > 0) throw new Error("Unexpected end of data");
+			contentItem = Buffer.concat(buffers, n);
+			contentItemLength = n;
+			contentPosition = 0;
+		}
+	};
+	const readUInt32LE = () => {
+		ensureData(4);
+		const value = contentItem.readUInt32LE(contentPosition);
+		contentPosition += 4;
+		return value;
+	};
+	const readInt32LE = () => {
+		ensureData(4);
+		const value = contentItem.readInt32LE(contentPosition);
+		contentPosition += 4;
+		return value;
+	};
+	const readSlice = l => {
+		ensureData(l);
+		if (contentPosition === 0 && contentItemLength === l) {
+			const result = contentItem;
+			if (contentsIndex + 1 < contents.length) {
+				nextContent();
+			} else {
+				contentPosition = l;
+			}
+			return result;
+		}
+		const result = contentItem.slice(contentPosition, contentPosition + l);
+		contentPosition += l;
+		// we clone the buffer here to allow the original content to be garbage collected
+		return l * 2 < contentItem.buffer.byteLength ? Buffer.from(result) : result;
+	};
+	const version = readUInt32LE();
+	if (version !== VERSION) {
+		throw new Error("Invalid file version");
+	}
+	const sectionCount = readUInt32LE();
+	const lengths = [];
+	let lastLengthPositive = false;
+	for (let i = 0; i < sectionCount; i++) {
+		const value = readInt32LE();
+		const valuePositive = value >= 0;
+		if (lastLengthPositive && valuePositive) {
+			lengths[lengths.length - 1] += value;
+		} else {
+			lengths.push(value);
+			lastLengthPositive = valuePositive;
+		}
+	}
+	const result = [];
+	for (let length of lengths) {
+		if (length < 0) {
+			const slice = readSlice(-length);
+			const size = Number(readUInt64LE(slice, 0));
+			const nameBuffer = slice.slice(8);
+			const name = nameBuffer.toString();
+			result.push(
+				SerializerMiddleware.createLazy(
+					memoize(() => deserialize(middleware, name, readFile)),
+					middleware,
+					{
+						name,
+						size
+					},
+					slice
+				)
+			);
+		} else {
+			if (contentPosition === contentItemLength) {
+				nextContent();
+			} else if (contentPosition !== 0) {
+				if (length <= contentItemLength - contentPosition) {
+					result.push(
+						Buffer.from(
+							contentItem.buffer,
+							contentItem.byteOffset + contentPosition,
+							length
+						)
+					);
+					contentPosition += length;
+					length = 0;
+				} else {
+					const l = contentItemLength - contentPosition;
+					result.push(
+						Buffer.from(
+							contentItem.buffer,
+							contentItem.byteOffset + contentPosition,
+							l
+						)
+					);
+					length -= l;
+					contentPosition = contentItemLength;
+				}
+			} else {
+				if (length >= contentItemLength) {
+					result.push(contentItem);
+					length -= contentItemLength;
+					contentPosition = contentItemLength;
+				} else {
+					result.push(
+						Buffer.from(contentItem.buffer, contentItem.byteOffset, length)
+					);
+					contentPosition += length;
+					length = 0;
+				}
+			}
+			while (length > 0) {
+				nextContent();
+				if (length >= contentItemLength) {
+					result.push(contentItem);
+					length -= contentItemLength;
+					contentPosition = contentItemLength;
+				} else {
+					result.push(
+						Buffer.from(contentItem.buffer, contentItem.byteOffset, length)
+					);
+					contentPosition += length;
+					length = 0;
+				}
+			}
+		}
+	}
+	return result;
+};
+
+/**
+ * @typedef {BufferSerializableType[]} DeserializedType
+ * @typedef {true} SerializedType
+ * @extends {SerializerMiddleware<DeserializedType, SerializedType>}
+ */
+class FileMiddleware extends SerializerMiddleware {
+	/**
+	 * @param {IntermediateFileSystem} fs filesystem
+	 * @param {string | Hash} hashFunction hash function to use
+	 */
+	constructor(fs, hashFunction = "md4") {
+		super();
+		this.fs = fs;
+		this._hashFunction = hashFunction;
+	}
+	/**
+	 * @param {DeserializedType} data data
+	 * @param {Object} context context object
+	 * @returns {SerializedType|Promise<SerializedType>} serialized data
+	 */
+	serialize(data, context) {
+		const { filename, extension = "" } = context;
+		return new Promise((resolve, reject) => {
+			mkdirp(this.fs, dirname(this.fs, filename), err => {
+				if (err) return reject(err);
+
+				// It's important that we don't touch existing files during serialization
+				// because serialize may read existing files (when deserializing)
+				const allWrittenFiles = new Set();
+				const writeFile = async (name, content, size) => {
+					const file = name
+						? join(this.fs, filename, `../${name}${extension}`)
+						: filename;
+					await new Promise((resolve, reject) => {
+						let stream = this.fs.createWriteStream(file + "_");
+						let compression;
+						if (file.endsWith(".gz")) {
+							compression = createGzip({
+								chunkSize: COMPRESSION_CHUNK_SIZE,
+								level: zConstants.Z_BEST_SPEED
+							});
+						} else if (file.endsWith(".br")) {
+							compression = createBrotliCompress({
+								chunkSize: COMPRESSION_CHUNK_SIZE,
+								params: {
+									[zConstants.BROTLI_PARAM_MODE]: zConstants.BROTLI_MODE_TEXT,
+									[zConstants.BROTLI_PARAM_QUALITY]: 2,
+									[zConstants.BROTLI_PARAM_DISABLE_LITERAL_CONTEXT_MODELING]: true,
+									[zConstants.BROTLI_PARAM_SIZE_HINT]: size
+								}
+							});
+						}
+						if (compression) {
+							pipeline(compression, stream, reject);
+							stream = compression;
+							stream.on("finish", () => resolve());
+						} else {
+							stream.on("error", err => reject(err));
+							stream.on("finish", () => resolve());
+						}
+						// split into chunks for WRITE_LIMIT_CHUNK size
+						const chunks = [];
+						for (const b of content) {
+							if (b.length < WRITE_LIMIT_CHUNK) {
+								chunks.push(b);
+							} else {
+								for (let i = 0; i < b.length; i += WRITE_LIMIT_CHUNK) {
+									chunks.push(b.slice(i, i + WRITE_LIMIT_CHUNK));
+								}
+							}
+						}
+
+						const len = chunks.length;
+						let i = 0;
+						const batchWrite = err => {
+							// will be handled in "on" error handler
+							if (err) return;
+
+							if (i === len) {
+								stream.end();
+								return;
+							}
+
+							// queue up a batch of chunks up to the write limit
+							// end is exclusive
+							let end = i;
+							let sum = chunks[end++].length;
+							while (end < len) {
+								sum += chunks[end].length;
+								if (sum > WRITE_LIMIT_TOTAL) break;
+								end++;
+							}
+							while (i < end - 1) {
+								stream.write(chunks[i++]);
+							}
+							stream.write(chunks[i++], batchWrite);
+						};
+						batchWrite();
+					});
+					if (name) allWrittenFiles.add(file);
+				};
+
+				resolve(
+					serialize(this, data, false, writeFile, this._hashFunction).then(
+						async ({ backgroundJob }) => {
+							await backgroundJob;
+
+							// Rename the index file to disallow access during inconsistent file state
+							await new Promise(resolve =>
+								this.fs.rename(filename, filename + ".old", err => {
+									resolve();
+								})
+							);
+
+							// update all written files
+							await Promise.all(
+								Array.from(
+									allWrittenFiles,
+									file =>
+										new Promise((resolve, reject) => {
+											this.fs.rename(file + "_", file, err => {
+												if (err) return reject(err);
+												resolve();
+											});
+										})
+								)
+							);
+
+							// As final step automatically update the index file to have a consistent pack again
+							await new Promise(resolve => {
+								this.fs.rename(filename + "_", filename, err => {
+									if (err) return reject(err);
+									resolve();
+								});
+							});
+							return /** @type {true} */ (true);
+						}
+					)
+				);
+			});
+		});
+	}
+
+	/**
+	 * @param {SerializedType} data data
+	 * @param {Object} context context object
+	 * @returns {DeserializedType|Promise<DeserializedType>} deserialized data
+	 */
+	deserialize(data, context) {
+		const { filename, extension = "" } = context;
+		const readFile = name =>
+			new Promise((resolve, reject) => {
+				const file = name
+					? join(this.fs, filename, `../${name}${extension}`)
+					: filename;
+				this.fs.stat(file, (err, stats) => {
+					if (err) {
+						reject(err);
+						return;
+					}
+					let remaining = /** @type {number} */ (stats.size);
+					let currentBuffer;
+					let currentBufferUsed;
+					const buf = [];
+					let decompression;
+					if (file.endsWith(".gz")) {
+						decompression = createGunzip({
+							chunkSize: DECOMPRESSION_CHUNK_SIZE
+						});
+					} else if (file.endsWith(".br")) {
+						decompression = createBrotliDecompress({
+							chunkSize: DECOMPRESSION_CHUNK_SIZE
+						});
+					}
+					if (decompression) {
+						let newResolve, newReject;
+						resolve(
+							Promise.all([
+								new Promise((rs, rj) => {
+									newResolve = rs;
+									newReject = rj;
+								}),
+								new Promise((resolve, reject) => {
+									decompression.on("data", chunk => buf.push(chunk));
+									decompression.on("end", () => resolve());
+									decompression.on("error", err => reject(err));
+								})
+							]).then(() => buf)
+						);
+						resolve = newResolve;
+						reject = newReject;
+					}
+					this.fs.open(file, "r", (err, fd) => {
+						if (err) {
+							reject(err);
+							return;
+						}
+						const read = () => {
+							if (currentBuffer === undefined) {
+								currentBuffer = Buffer.allocUnsafeSlow(
+									Math.min(
+										constants.MAX_LENGTH,
+										remaining,
+										decompression ? DECOMPRESSION_CHUNK_SIZE : Infinity
+									)
+								);
+								currentBufferUsed = 0;
+							}
+							let readBuffer = currentBuffer;
+							let readOffset = currentBufferUsed;
+							let readLength = currentBuffer.length - currentBufferUsed;
+							// values passed to fs.read must be valid int32 values
+							if (readOffset > 0x7fffffff) {
+								readBuffer = currentBuffer.slice(readOffset);
+								readOffset = 0;
+							}
+							if (readLength > 0x7fffffff) {
+								readLength = 0x7fffffff;
+							}
+							this.fs.read(
+								fd,
+								readBuffer,
+								readOffset,
+								readLength,
+								null,
+								(err, bytesRead) => {
+									if (err) {
+										this.fs.close(fd, () => {
+											reject(err);
+										});
+										return;
+									}
+									currentBufferUsed += bytesRead;
+									remaining -= bytesRead;
+									if (currentBufferUsed === currentBuffer.length) {
+										if (decompression) {
+											decompression.write(currentBuffer);
+										} else {
+											buf.push(currentBuffer);
+										}
+										currentBuffer = undefined;
+										if (remaining === 0) {
+											if (decompression) {
+												decompression.end();
+											}
+											this.fs.close(fd, err => {
+												if (err) {
+													reject(err);
+													return;
+												}
+												resolve(buf);
+											});
+											return;
+										}
+									}
+									read();
+								}
+							);
+						};
+						read();
+					});
+				});
+			});
+		return deserialize(this, false, readFile);
+	}
+}
+
+module.exports = FileMiddleware;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/MapObjectSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/MapObjectSerializer.js
new file mode 100644
index 0000000..0718b71
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/MapObjectSerializer.js
@@ -0,0 +1,31 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class MapObjectSerializer {
+	serialize(obj, { write }) {
+		write(obj.size);
+		for (const key of obj.keys()) {
+			write(key);
+		}
+		for (const value of obj.values()) {
+			write(value);
+		}
+	}
+	deserialize({ read }) {
+		let size = read();
+		const map = new Map();
+		const keys = [];
+		for (let i = 0; i < size; i++) {
+			keys.push(read());
+		}
+		for (let i = 0; i < size; i++) {
+			map.set(keys[i], read());
+		}
+		return map;
+	}
+}
+
+module.exports = MapObjectSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/NullPrototypeObjectSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/NullPrototypeObjectSerializer.js
new file mode 100644
index 0000000..0321d62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/NullPrototypeObjectSerializer.js
@@ -0,0 +1,33 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class NullPrototypeObjectSerializer {
+	serialize(obj, { write }) {
+		const keys = Object.keys(obj);
+		for (const key of keys) {
+			write(key);
+		}
+		write(null);
+		for (const key of keys) {
+			write(obj[key]);
+		}
+	}
+	deserialize({ read }) {
+		const obj = Object.create(null);
+		const keys = [];
+		let key = read();
+		while (key !== null) {
+			keys.push(key);
+			key = read();
+		}
+		for (const key of keys) {
+			obj[key] = read();
+		}
+		return obj;
+	}
+}
+
+module.exports = NullPrototypeObjectSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ObjectMiddleware.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ObjectMiddleware.js
new file mode 100644
index 0000000..9d48d2d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/ObjectMiddleware.js
@@ -0,0 +1,734 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const createHash = require("../util/createHash");
+const ArraySerializer = require("./ArraySerializer");
+const DateObjectSerializer = require("./DateObjectSerializer");
+const ErrorObjectSerializer = require("./ErrorObjectSerializer");
+const MapObjectSerializer = require("./MapObjectSerializer");
+const NullPrototypeObjectSerializer = require("./NullPrototypeObjectSerializer");
+const PlainObjectSerializer = require("./PlainObjectSerializer");
+const RegExpObjectSerializer = require("./RegExpObjectSerializer");
+const SerializerMiddleware = require("./SerializerMiddleware");
+const SetObjectSerializer = require("./SetObjectSerializer");
+
+/** @typedef {typeof import("../util/Hash")} Hash */
+/** @typedef {import("./types").ComplexSerializableType} ComplexSerializableType */
+/** @typedef {import("./types").PrimitiveSerializableType} PrimitiveSerializableType */
+
+/** @typedef {new (...params: any[]) => any} Constructor */
+
+/*
+
+Format:
+
+File -> Section*
+Section -> ObjectSection | ReferenceSection | EscapeSection | OtherSection
+
+ObjectSection -> ESCAPE (
+	number:relativeOffset (number > 0) |
+	string:request (string|null):export
+) Section:value* ESCAPE ESCAPE_END_OBJECT
+ReferenceSection -> ESCAPE number:relativeOffset (number < 0)
+EscapeSection -> ESCAPE ESCAPE_ESCAPE_VALUE (escaped value ESCAPE)
+EscapeSection -> ESCAPE ESCAPE_UNDEFINED (escaped value ESCAPE)
+OtherSection -> any (except ESCAPE)
+
+Why using null as escape value?
+Multiple null values can merged by the BinaryMiddleware, which makes it very efficient
+Technically any value can be used.
+
+*/
+
+/**
+ * @typedef {Object} ObjectSerializerContext
+ * @property {function(any): void} write
+ */
+
+/**
+ * @typedef {Object} ObjectDeserializerContext
+ * @property {function(): any} read
+ */
+
+/**
+ * @typedef {Object} ObjectSerializer
+ * @property {function(any, ObjectSerializerContext): void} serialize
+ * @property {function(ObjectDeserializerContext): any} deserialize
+ */
+
+const setSetSize = (set, size) => {
+	let i = 0;
+	for (const item of set) {
+		if (i++ >= size) {
+			set.delete(item);
+		}
+	}
+};
+
+const setMapSize = (map, size) => {
+	let i = 0;
+	for (const item of map.keys()) {
+		if (i++ >= size) {
+			map.delete(item);
+		}
+	}
+};
+
+/**
+ * @param {Buffer} buffer buffer
+ * @param {string | Hash} hashFunction hash function to use
+ * @returns {string} hash
+ */
+const toHash = (buffer, hashFunction) => {
+	const hash = createHash(hashFunction);
+	hash.update(buffer);
+	return /** @type {string} */ (hash.digest("latin1"));
+};
+
+const ESCAPE = null;
+const ESCAPE_ESCAPE_VALUE = null;
+const ESCAPE_END_OBJECT = true;
+const ESCAPE_UNDEFINED = false;
+
+const CURRENT_VERSION = 2;
+
+const serializers = new Map();
+const serializerInversed = new Map();
+
+const loadedRequests = new Set();
+
+const NOT_SERIALIZABLE = {};
+
+const jsTypes = new Map();
+jsTypes.set(Object, new PlainObjectSerializer());
+jsTypes.set(Array, new ArraySerializer());
+jsTypes.set(null, new NullPrototypeObjectSerializer());
+jsTypes.set(Map, new MapObjectSerializer());
+jsTypes.set(Set, new SetObjectSerializer());
+jsTypes.set(Date, new DateObjectSerializer());
+jsTypes.set(RegExp, new RegExpObjectSerializer());
+jsTypes.set(Error, new ErrorObjectSerializer(Error));
+jsTypes.set(EvalError, new ErrorObjectSerializer(EvalError));
+jsTypes.set(RangeError, new ErrorObjectSerializer(RangeError));
+jsTypes.set(ReferenceError, new ErrorObjectSerializer(ReferenceError));
+jsTypes.set(SyntaxError, new ErrorObjectSerializer(SyntaxError));
+jsTypes.set(TypeError, new ErrorObjectSerializer(TypeError));
+
+// If in a sandboxed environment (e. g. jest), this escapes the sandbox and registers
+// real Object and Array types to. These types may occur in the wild too, e. g. when
+// using Structured Clone in postMessage.
+if (exports.constructor !== Object) {
+	const Obj = /** @type {typeof Object} */ (exports.constructor);
+	const Fn = /** @type {typeof Function} */ (Obj.constructor);
+	for (const [type, config] of Array.from(jsTypes)) {
+		if (type) {
+			const Type = new Fn(`return ${type.name};`)();
+			jsTypes.set(Type, config);
+		}
+	}
+}
+
+{
+	let i = 1;
+	for (const [type, serializer] of jsTypes) {
+		serializers.set(type, {
+			request: "",
+			name: i++,
+			serializer
+		});
+	}
+}
+
+for (const { request, name, serializer } of serializers.values()) {
+	serializerInversed.set(`${request}/${name}`, serializer);
+}
+
+/** @type {Map<RegExp, (request: string) => boolean>} */
+const loaders = new Map();
+
+/**
+ * @typedef {ComplexSerializableType[]} DeserializedType
+ * @typedef {PrimitiveSerializableType[]} SerializedType
+ * @extends {SerializerMiddleware<DeserializedType, SerializedType>}
+ */
+class ObjectMiddleware extends SerializerMiddleware {
+	/**
+	 * @param {function(any): void} extendContext context extensions
+	 * @param {string | Hash} hashFunction hash function to use
+	 */
+	constructor(extendContext, hashFunction = "md4") {
+		super();
+		this.extendContext = extendContext;
+		this._hashFunction = hashFunction;
+	}
+	/**
+	 * @param {RegExp} regExp RegExp for which the request is tested
+	 * @param {function(string): boolean} loader loader to load the request, returns true when successful
+	 * @returns {void}
+	 */
+	static registerLoader(regExp, loader) {
+		loaders.set(regExp, loader);
+	}
+
+	/**
+	 * @param {Constructor} Constructor the constructor
+	 * @param {string} request the request which will be required when deserializing
+	 * @param {string} name the name to make multiple serializer unique when sharing a request
+	 * @param {ObjectSerializer} serializer the serializer
+	 * @returns {void}
+	 */
+	static register(Constructor, request, name, serializer) {
+		const key = request + "/" + name;
+
+		if (serializers.has(Constructor)) {
+			throw new Error(
+				`ObjectMiddleware.register: serializer for ${Constructor.name} is already registered`
+			);
+		}
+
+		if (serializerInversed.has(key)) {
+			throw new Error(
+				`ObjectMiddleware.register: serializer for ${key} is already registered`
+			);
+		}
+
+		serializers.set(Constructor, {
+			request,
+			name,
+			serializer
+		});
+
+		serializerInversed.set(key, serializer);
+	}
+
+	/**
+	 * @param {Constructor} Constructor the constructor
+	 * @returns {void}
+	 */
+	static registerNotSerializable(Constructor) {
+		if (serializers.has(Constructor)) {
+			throw new Error(
+				`ObjectMiddleware.registerNotSerializable: serializer for ${Constructor.name} is already registered`
+			);
+		}
+
+		serializers.set(Constructor, NOT_SERIALIZABLE);
+	}
+
+	static getSerializerFor(object) {
+		const proto = Object.getPrototypeOf(object);
+		let c;
+		if (proto === null) {
+			// Object created with Object.create(null)
+			c = null;
+		} else {
+			c = proto.constructor;
+			if (!c) {
+				throw new Error(
+					"Serialization of objects with prototype without valid constructor property not possible"
+				);
+			}
+		}
+		const config = serializers.get(c);
+
+		if (!config) throw new Error(`No serializer registered for ${c.name}`);
+		if (config === NOT_SERIALIZABLE) throw NOT_SERIALIZABLE;
+
+		return config;
+	}
+
+	static getDeserializerFor(request, name) {
+		const key = request + "/" + name;
+		const serializer = serializerInversed.get(key);
+
+		if (serializer === undefined) {
+			throw new Error(`No deserializer registered for ${key}`);
+		}
+
+		return serializer;
+	}
+
+	static _getDeserializerForWithoutError(request, name) {
+		const key = request + "/" + name;
+		const serializer = serializerInversed.get(key);
+		return serializer;
+	}
+
+	/**
+	 * @param {DeserializedType} data data
+	 * @param {Object} context context object
+	 * @returns {SerializedType|Promise<SerializedType>} serialized data
+	 */
+	serialize(data, context) {
+		/** @type {any[]} */
+		let result = [CURRENT_VERSION];
+		let currentPos = 0;
+		let referenceable = new Map();
+		const addReferenceable = item => {
+			referenceable.set(item, currentPos++);
+		};
+		let bufferDedupeMap = new Map();
+		const dedupeBuffer = buf => {
+			const len = buf.length;
+			const entry = bufferDedupeMap.get(len);
+			if (entry === undefined) {
+				bufferDedupeMap.set(len, buf);
+				return buf;
+			}
+			if (Buffer.isBuffer(entry)) {
+				if (len < 32) {
+					if (buf.equals(entry)) {
+						return entry;
+					}
+					bufferDedupeMap.set(len, [entry, buf]);
+					return buf;
+				} else {
+					const hash = toHash(entry, this._hashFunction);
+					const newMap = new Map();
+					newMap.set(hash, entry);
+					bufferDedupeMap.set(len, newMap);
+					const hashBuf = toHash(buf, this._hashFunction);
+					if (hash === hashBuf) {
+						return entry;
+					}
+					return buf;
+				}
+			} else if (Array.isArray(entry)) {
+				if (entry.length < 16) {
+					for (const item of entry) {
+						if (buf.equals(item)) {
+							return item;
+						}
+					}
+					entry.push(buf);
+					return buf;
+				} else {
+					const newMap = new Map();
+					const hash = toHash(buf, this._hashFunction);
+					let found;
+					for (const item of entry) {
+						const itemHash = toHash(item, this._hashFunction);
+						newMap.set(itemHash, item);
+						if (found === undefined && itemHash === hash) found = item;
+					}
+					bufferDedupeMap.set(len, newMap);
+					if (found === undefined) {
+						newMap.set(hash, buf);
+						return buf;
+					} else {
+						return found;
+					}
+				}
+			} else {
+				const hash = toHash(buf, this._hashFunction);
+				const item = entry.get(hash);
+				if (item !== undefined) {
+					return item;
+				}
+				entry.set(hash, buf);
+				return buf;
+			}
+		};
+		let currentPosTypeLookup = 0;
+		let objectTypeLookup = new Map();
+		const cycleStack = new Set();
+		const stackToString = item => {
+			const arr = Array.from(cycleStack);
+			arr.push(item);
+			return arr
+				.map(item => {
+					if (typeof item === "string") {
+						if (item.length > 100) {
+							return `String ${JSON.stringify(item.slice(0, 100)).slice(
+								0,
+								-1
+							)}..."`;
+						}
+						return `String ${JSON.stringify(item)}`;
+					}
+					try {
+						const { request, name } = ObjectMiddleware.getSerializerFor(item);
+						if (request) {
+							return `${request}${name ? `.${name}` : ""}`;
+						}
+					} catch (e) {
+						// ignore -> fallback
+					}
+					if (typeof item === "object" && item !== null) {
+						if (item.constructor) {
+							if (item.constructor === Object)
+								return `Object { ${Object.keys(item).join(", ")} }`;
+							if (item.constructor === Map) return `Map { ${item.size} items }`;
+							if (item.constructor === Array)
+								return `Array { ${item.length} items }`;
+							if (item.constructor === Set) return `Set { ${item.size} items }`;
+							if (item.constructor === RegExp) return item.toString();
+							return `${item.constructor.name}`;
+						}
+						return `Object [null prototype] { ${Object.keys(item).join(
+							", "
+						)} }`;
+					}
+					try {
+						return `${item}`;
+					} catch (e) {
+						return `(${e.message})`;
+					}
+				})
+				.join(" -> ");
+		};
+		let hasDebugInfoAttached;
+		let ctx = {
+			write(value, key) {
+				try {
+					process(value);
+				} catch (e) {
+					if (e !== NOT_SERIALIZABLE) {
+						if (hasDebugInfoAttached === undefined)
+							hasDebugInfoAttached = new WeakSet();
+						if (!hasDebugInfoAttached.has(e)) {
+							e.message += `\nwhile serializing ${stackToString(value)}`;
+							hasDebugInfoAttached.add(e);
+						}
+					}
+					throw e;
+				}
+			},
+			setCircularReference(ref) {
+				addReferenceable(ref);
+			},
+			snapshot() {
+				return {
+					length: result.length,
+					cycleStackSize: cycleStack.size,
+					referenceableSize: referenceable.size,
+					currentPos,
+					objectTypeLookupSize: objectTypeLookup.size,
+					currentPosTypeLookup
+				};
+			},
+			rollback(snapshot) {
+				result.length = snapshot.length;
+				setSetSize(cycleStack, snapshot.cycleStackSize);
+				setMapSize(referenceable, snapshot.referenceableSize);
+				currentPos = snapshot.currentPos;
+				setMapSize(objectTypeLookup, snapshot.objectTypeLookupSize);
+				currentPosTypeLookup = snapshot.currentPosTypeLookup;
+			},
+			...context
+		};
+		this.extendContext(ctx);
+		const process = item => {
+			if (Buffer.isBuffer(item)) {
+				// check if we can emit a reference
+				const ref = referenceable.get(item);
+				if (ref !== undefined) {
+					result.push(ESCAPE, ref - currentPos);
+					return;
+				}
+				const alreadyUsedBuffer = dedupeBuffer(item);
+				if (alreadyUsedBuffer !== item) {
+					const ref = referenceable.get(alreadyUsedBuffer);
+					if (ref !== undefined) {
+						referenceable.set(item, ref);
+						result.push(ESCAPE, ref - currentPos);
+						return;
+					}
+					item = alreadyUsedBuffer;
+				}
+				addReferenceable(item);
+
+				result.push(item);
+			} else if (item === ESCAPE) {
+				result.push(ESCAPE, ESCAPE_ESCAPE_VALUE);
+			} else if (
+				typeof item === "object"
+				// We don't have to check for null as ESCAPE is null and this has been checked before
+			) {
+				// check if we can emit a reference
+				const ref = referenceable.get(item);
+				if (ref !== undefined) {
+					result.push(ESCAPE, ref - currentPos);
+					return;
+				}
+
+				if (cycleStack.has(item)) {
+					throw new Error(
+						`This is a circular references. To serialize circular references use 'setCircularReference' somewhere in the circle during serialize and deserialize.`
+					);
+				}
+
+				const { request, name, serializer } =
+					ObjectMiddleware.getSerializerFor(item);
+				const key = `${request}/${name}`;
+				const lastIndex = objectTypeLookup.get(key);
+
+				if (lastIndex === undefined) {
+					objectTypeLookup.set(key, currentPosTypeLookup++);
+
+					result.push(ESCAPE, request, name);
+				} else {
+					result.push(ESCAPE, currentPosTypeLookup - lastIndex);
+				}
+
+				cycleStack.add(item);
+
+				try {
+					serializer.serialize(item, ctx);
+				} finally {
+					cycleStack.delete(item);
+				}
+
+				result.push(ESCAPE, ESCAPE_END_OBJECT);
+
+				addReferenceable(item);
+			} else if (typeof item === "string") {
+				if (item.length > 1) {
+					// short strings are shorter when not emitting a reference (this saves 1 byte per empty string)
+					// check if we can emit a reference
+					const ref = referenceable.get(item);
+					if (ref !== undefined) {
+						result.push(ESCAPE, ref - currentPos);
+						return;
+					}
+					addReferenceable(item);
+				}
+
+				if (item.length > 102400 && context.logger) {
+					context.logger.warn(
+						`Serializing big strings (${Math.round(
+							item.length / 1024
+						)}kiB) impacts deserialization performance (consider using Buffer instead and decode when needed)`
+					);
+				}
+
+				result.push(item);
+			} else if (typeof item === "function") {
+				if (!SerializerMiddleware.isLazy(item))
+					throw new Error("Unexpected function " + item);
+				/** @type {SerializedType} */
+				const serializedData =
+					SerializerMiddleware.getLazySerializedValue(item);
+				if (serializedData !== undefined) {
+					if (typeof serializedData === "function") {
+						result.push(serializedData);
+					} else {
+						throw new Error("Not implemented");
+					}
+				} else if (SerializerMiddleware.isLazy(item, this)) {
+					throw new Error("Not implemented");
+				} else {
+					const data = SerializerMiddleware.serializeLazy(item, data =>
+						this.serialize([data], context)
+					);
+					SerializerMiddleware.setLazySerializedValue(item, data);
+					result.push(data);
+				}
+			} else if (item === undefined) {
+				result.push(ESCAPE, ESCAPE_UNDEFINED);
+			} else {
+				result.push(item);
+			}
+		};
+
+		try {
+			for (const item of data) {
+				process(item);
+			}
+			return result;
+		} catch (e) {
+			if (e === NOT_SERIALIZABLE) return null;
+
+			throw e;
+		} finally {
+			// Get rid of these references to avoid leaking memory
+			// This happens because the optimized code v8 generates
+			// is optimized for our "ctx.write" method so it will reference
+			// it from e. g. Dependency.prototype.serialize -(IC)-> ctx.write
+			data =
+				result =
+				referenceable =
+				bufferDedupeMap =
+				objectTypeLookup =
+				ctx =
+					undefined;
+		}
+	}
+
+	/**
+	 * @param {SerializedType} data data
+	 * @param {Object} context context object
+	 * @returns {DeserializedType|Promise<DeserializedType>} deserialized data
+	 */
+	deserialize(data, context) {
+		let currentDataPos = 0;
+		const read = () => {
+			if (currentDataPos >= data.length)
+				throw new Error("Unexpected end of stream");
+
+			return data[currentDataPos++];
+		};
+
+		if (read() !== CURRENT_VERSION)
+			throw new Error("Version mismatch, serializer changed");
+
+		let currentPos = 0;
+		let referenceable = [];
+		const addReferenceable = item => {
+			referenceable.push(item);
+			currentPos++;
+		};
+		let currentPosTypeLookup = 0;
+		let objectTypeLookup = [];
+		let result = [];
+		let ctx = {
+			read() {
+				return decodeValue();
+			},
+			setCircularReference(ref) {
+				addReferenceable(ref);
+			},
+			...context
+		};
+		this.extendContext(ctx);
+		const decodeValue = () => {
+			const item = read();
+
+			if (item === ESCAPE) {
+				const nextItem = read();
+
+				if (nextItem === ESCAPE_ESCAPE_VALUE) {
+					return ESCAPE;
+				} else if (nextItem === ESCAPE_UNDEFINED) {
+					return undefined;
+				} else if (nextItem === ESCAPE_END_OBJECT) {
+					throw new Error(
+						`Unexpected end of object at position ${currentDataPos - 1}`
+					);
+				} else {
+					const request = nextItem;
+					let serializer;
+
+					if (typeof request === "number") {
+						if (request < 0) {
+							// relative reference
+							return referenceable[currentPos + request];
+						}
+						serializer = objectTypeLookup[currentPosTypeLookup - request];
+					} else {
+						if (typeof request !== "string") {
+							throw new Error(
+								`Unexpected type (${typeof request}) of request ` +
+									`at position ${currentDataPos - 1}`
+							);
+						}
+						const name = read();
+
+						serializer = ObjectMiddleware._getDeserializerForWithoutError(
+							request,
+							name
+						);
+
+						if (serializer === undefined) {
+							if (request && !loadedRequests.has(request)) {
+								let loaded = false;
+								for (const [regExp, loader] of loaders) {
+									if (regExp.test(request)) {
+										if (loader(request)) {
+											loaded = true;
+											break;
+										}
+									}
+								}
+								if (!loaded) {
+									require(request);
+								}
+
+								loadedRequests.add(request);
+							}
+
+							serializer = ObjectMiddleware.getDeserializerFor(request, name);
+						}
+
+						objectTypeLookup.push(serializer);
+						currentPosTypeLookup++;
+					}
+					try {
+						const item = serializer.deserialize(ctx);
+						const end1 = read();
+
+						if (end1 !== ESCAPE) {
+							throw new Error("Expected end of object");
+						}
+
+						const end2 = read();
+
+						if (end2 !== ESCAPE_END_OBJECT) {
+							throw new Error("Expected end of object");
+						}
+
+						addReferenceable(item);
+
+						return item;
+					} catch (err) {
+						// As this is only for error handling, we omit creating a Map for
+						// faster access to this information, as this would affect performance
+						// in the good case
+						let serializerEntry;
+						for (const entry of serializers) {
+							if (entry[1].serializer === serializer) {
+								serializerEntry = entry;
+								break;
+							}
+						}
+						const name = !serializerEntry
+							? "unknown"
+							: !serializerEntry[1].request
+							? serializerEntry[0].name
+							: serializerEntry[1].name
+							? `${serializerEntry[1].request} ${serializerEntry[1].name}`
+							: serializerEntry[1].request;
+						err.message += `\n(during deserialization of ${name})`;
+						throw err;
+					}
+				}
+			} else if (typeof item === "string") {
+				if (item.length > 1) {
+					addReferenceable(item);
+				}
+
+				return item;
+			} else if (Buffer.isBuffer(item)) {
+				addReferenceable(item);
+
+				return item;
+			} else if (typeof item === "function") {
+				return SerializerMiddleware.deserializeLazy(
+					item,
+					data => this.deserialize(data, context)[0]
+				);
+			} else {
+				return item;
+			}
+		};
+
+		try {
+			while (currentDataPos < data.length) {
+				result.push(decodeValue());
+			}
+			return result;
+		} finally {
+			// Get rid of these references to avoid leaking memory
+			// This happens because the optimized code v8 generates
+			// is optimized for our "ctx.read" method so it will reference
+			// it from e. g. Dependency.prototype.deserialize -(IC)-> ctx.read
+			result = referenceable = data = objectTypeLookup = ctx = undefined;
+		}
+	}
+}
+
+module.exports = ObjectMiddleware;
+module.exports.NOT_SERIALIZABLE = NOT_SERIALIZABLE;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/PlainObjectSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/PlainObjectSerializer.js
new file mode 100644
index 0000000..2d2b6df
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/PlainObjectSerializer.js
@@ -0,0 +1,80 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const cache = new WeakMap();
+
+class ObjectStructure {
+	constructor() {
+		this.keys = undefined;
+		this.children = undefined;
+	}
+
+	getKeys(keys) {
+		if (this.keys === undefined) this.keys = keys;
+		return this.keys;
+	}
+
+	key(key) {
+		if (this.children === undefined) this.children = new Map();
+		const child = this.children.get(key);
+		if (child !== undefined) return child;
+		const newChild = new ObjectStructure();
+		this.children.set(key, newChild);
+		return newChild;
+	}
+}
+
+const getCachedKeys = (keys, cacheAssoc) => {
+	let root = cache.get(cacheAssoc);
+	if (root === undefined) {
+		root = new ObjectStructure();
+		cache.set(cacheAssoc, root);
+	}
+	let current = root;
+	for (const key of keys) {
+		current = current.key(key);
+	}
+	return current.getKeys(keys);
+};
+
+class PlainObjectSerializer {
+	serialize(obj, { write }) {
+		const keys = Object.keys(obj);
+		if (keys.length > 128) {
+			// Objects with so many keys are unlikely to share structure
+			// with other objects
+			write(keys);
+			for (const key of keys) {
+				write(obj[key]);
+			}
+		} else if (keys.length > 1) {
+			write(getCachedKeys(keys, write));
+			for (const key of keys) {
+				write(obj[key]);
+			}
+		} else if (keys.length === 1) {
+			const key = keys[0];
+			write(key);
+			write(obj[key]);
+		} else {
+			write(null);
+		}
+	}
+	deserialize({ read }) {
+		const keys = read();
+		const obj = {};
+		if (Array.isArray(keys)) {
+			for (const key of keys) {
+				obj[key] = read();
+			}
+		} else if (keys !== null) {
+			obj[keys] = read();
+		}
+		return obj;
+	}
+}
+
+module.exports = PlainObjectSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/RegExpObjectSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/RegExpObjectSerializer.js
new file mode 100644
index 0000000..61ca881
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/RegExpObjectSerializer.js
@@ -0,0 +1,17 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class RegExpObjectSerializer {
+	serialize(obj, { write }) {
+		write(obj.source);
+		write(obj.flags);
+	}
+	deserialize({ read }) {
+		return new RegExp(read(), read());
+	}
+}
+
+module.exports = RegExpObjectSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/Serializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/Serializer.js
new file mode 100644
index 0000000..ba81429
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/Serializer.js
@@ -0,0 +1,46 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class Serializer {
+	constructor(middlewares, context) {
+		this.serializeMiddlewares = middlewares.slice();
+		this.deserializeMiddlewares = middlewares.slice().reverse();
+		this.context = context;
+	}
+
+	serialize(obj, context) {
+		const ctx = { ...context, ...this.context };
+		let current = obj;
+		for (const middleware of this.serializeMiddlewares) {
+			if (current && typeof current.then === "function") {
+				current = current.then(data => data && middleware.serialize(data, ctx));
+			} else if (current) {
+				try {
+					current = middleware.serialize(current, ctx);
+				} catch (err) {
+					current = Promise.reject(err);
+				}
+			} else break;
+		}
+		return current;
+	}
+
+	deserialize(value, context) {
+		const ctx = { ...context, ...this.context };
+		/** @type {any} */
+		let current = value;
+		for (const middleware of this.deserializeMiddlewares) {
+			if (current && typeof current.then === "function") {
+				current = current.then(data => middleware.deserialize(data, ctx));
+			} else {
+				current = middleware.deserialize(current, ctx);
+			}
+		}
+		return current;
+	}
+}
+
+module.exports = Serializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SerializerMiddleware.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SerializerMiddleware.js
new file mode 100644
index 0000000..30d1d1d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SerializerMiddleware.js
@@ -0,0 +1,153 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const memoize = require("../util/memoize");
+
+const LAZY_TARGET = Symbol("lazy serialization target");
+const LAZY_SERIALIZED_VALUE = Symbol("lazy serialization data");
+
+/**
+ * @template DeserializedType
+ * @template SerializedType
+ */
+class SerializerMiddleware {
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {DeserializedType} data data
+	 * @param {Object} context context object
+	 * @returns {SerializedType|Promise<SerializedType>} serialized data
+	 */
+	serialize(data, context) {
+		const AbstractMethodError = require("../AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * @abstract
+	 * @param {SerializedType} data data
+	 * @param {Object} context context object
+	 * @returns {DeserializedType|Promise<DeserializedType>} deserialized data
+	 */
+	deserialize(data, context) {
+		const AbstractMethodError = require("../AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/**
+	 * @param {any | function(): Promise<any> | any} value contained value or function to value
+	 * @param {SerializerMiddleware<any, any>} target target middleware
+	 * @param {object=} options lazy options
+	 * @param {any=} serializedValue serialized value
+	 * @returns {function(): Promise<any> | any} lazy function
+	 */
+	static createLazy(value, target, options = {}, serializedValue) {
+		if (SerializerMiddleware.isLazy(value, target)) return value;
+		const fn = typeof value === "function" ? value : () => value;
+		fn[LAZY_TARGET] = target;
+		/** @type {any} */ (fn).options = options;
+		fn[LAZY_SERIALIZED_VALUE] = serializedValue;
+		return fn;
+	}
+
+	/**
+	 * @param {function(): Promise<any> | any} fn lazy function
+	 * @param {SerializerMiddleware<any, any>=} target target middleware
+	 * @returns {boolean} true, when fn is a lazy function (optionally of that target)
+	 */
+	static isLazy(fn, target) {
+		if (typeof fn !== "function") return false;
+		const t = fn[LAZY_TARGET];
+		return target ? t === target : !!t;
+	}
+
+	/**
+	 * @param {function(): Promise<any> | any} fn lazy function
+	 * @returns {object} options
+	 */
+	static getLazyOptions(fn) {
+		if (typeof fn !== "function") return undefined;
+		return /** @type {any} */ (fn).options;
+	}
+
+	/**
+	 * @param {function(): Promise<any> | any} fn lazy function
+	 * @returns {any} serialized value
+	 */
+	static getLazySerializedValue(fn) {
+		if (typeof fn !== "function") return undefined;
+		return fn[LAZY_SERIALIZED_VALUE];
+	}
+
+	/**
+	 * @param {function(): Promise<any> | any} fn lazy function
+	 * @param {any} value serialized value
+	 * @returns {void}
+	 */
+	static setLazySerializedValue(fn, value) {
+		fn[LAZY_SERIALIZED_VALUE] = value;
+	}
+
+	/**
+	 * @param {function(): Promise<any> | any} lazy lazy function
+	 * @param {function(any): Promise<any> | any} serialize serialize function
+	 * @returns {function(): Promise<any> | any} new lazy
+	 */
+	static serializeLazy(lazy, serialize) {
+		const fn = memoize(() => {
+			const r = lazy();
+			if (r && typeof r.then === "function") {
+				return r.then(data => data && serialize(data));
+			}
+			return serialize(r);
+		});
+		fn[LAZY_TARGET] = lazy[LAZY_TARGET];
+		/** @type {any} */ (fn).options = /** @type {any} */ (lazy).options;
+		lazy[LAZY_SERIALIZED_VALUE] = fn;
+		return fn;
+	}
+
+	/**
+	 * @param {function(): Promise<any> | any} lazy lazy function
+	 * @param {function(any): Promise<any> | any} deserialize deserialize function
+	 * @returns {function(): Promise<any> | any} new lazy
+	 */
+	static deserializeLazy(lazy, deserialize) {
+		const fn = memoize(() => {
+			const r = lazy();
+			if (r && typeof r.then === "function") {
+				return r.then(data => deserialize(data));
+			}
+			return deserialize(r);
+		});
+		fn[LAZY_TARGET] = lazy[LAZY_TARGET];
+		/** @type {any} */ (fn).options = /** @type {any} */ (lazy).options;
+		fn[LAZY_SERIALIZED_VALUE] = lazy;
+		return fn;
+	}
+
+	/**
+	 * @param {function(): Promise<any> | any} lazy lazy function
+	 * @returns {function(): Promise<any> | any} new lazy
+	 */
+	static unMemoizeLazy(lazy) {
+		if (!SerializerMiddleware.isLazy(lazy)) return lazy;
+		const fn = () => {
+			throw new Error(
+				"A lazy value that has been unmemorized can't be called again"
+			);
+		};
+		fn[LAZY_SERIALIZED_VALUE] = SerializerMiddleware.unMemoizeLazy(
+			lazy[LAZY_SERIALIZED_VALUE]
+		);
+		fn[LAZY_TARGET] = lazy[LAZY_TARGET];
+		fn.options = /** @type {any} */ (lazy).options;
+		return fn;
+	}
+}
+
+module.exports = SerializerMiddleware;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SetObjectSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SetObjectSerializer.js
new file mode 100644
index 0000000..71b3fcc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SetObjectSerializer.js
@@ -0,0 +1,24 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+class SetObjectSerializer {
+	serialize(obj, { write }) {
+		write(obj.size);
+		for (const value of obj) {
+			write(value);
+		}
+	}
+	deserialize({ read }) {
+		let size = read();
+		const set = new Set();
+		for (let i = 0; i < size; i++) {
+			set.add(read());
+		}
+		return set;
+	}
+}
+
+module.exports = SetObjectSerializer;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SingleItemMiddleware.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SingleItemMiddleware.js
new file mode 100644
index 0000000..bc9ea09
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/SingleItemMiddleware.js
@@ -0,0 +1,34 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const SerializerMiddleware = require("./SerializerMiddleware");
+
+/**
+ * @typedef {any} DeserializedType
+ * @typedef {any[]} SerializedType
+ * @extends {SerializerMiddleware<any, any[]>}
+ */
+class SingleItemMiddleware extends SerializerMiddleware {
+	/**
+	 * @param {DeserializedType} data data
+	 * @param {Object} context context object
+	 * @returns {SerializedType|Promise<SerializedType>} serialized data
+	 */
+	serialize(data, context) {
+		return [data];
+	}
+
+	/**
+	 * @param {SerializedType} data data
+	 * @param {Object} context context object
+	 * @returns {DeserializedType|Promise<DeserializedType>} deserialized data
+	 */
+	deserialize(data, context) {
+		return data[0];
+	}
+}
+
+module.exports = SingleItemMiddleware;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/types.js b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/types.js
new file mode 100644
index 0000000..04a91e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/serialization/types.js
@@ -0,0 +1,13 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+/** @typedef {undefined|null|number|string|boolean|Buffer|Object|(() => ComplexSerializableType[] | Promise<ComplexSerializableType[]>)} ComplexSerializableType */
+
+/** @typedef {undefined|null|number|string|boolean|Buffer|(() => PrimitiveSerializableType[] | Promise<PrimitiveSerializableType[]>)} PrimitiveSerializableType */
+
+/** @typedef {Buffer|(() => BufferSerializableType[] | Promise<BufferSerializableType[]>)} BufferSerializableType */
+
+module.exports = {};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedFallbackDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedFallbackDependency.js
new file mode 100644
index 0000000..126ba4e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedFallbackDependency.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("../dependencies/ModuleDependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class ConsumeSharedFallbackDependency extends ModuleDependency {
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "consume shared fallback";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	ConsumeSharedFallbackDependency,
+	"webpack/lib/sharing/ConsumeSharedFallbackDependency"
+);
+
+module.exports = ConsumeSharedFallbackDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedModule.js
new file mode 100644
index 0000000..4a8e83f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedModule.js
@@ -0,0 +1,251 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const Module = require("../Module");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const { rangeToString, stringifyHoley } = require("../util/semver");
+const ConsumeSharedFallbackDependency = require("./ConsumeSharedFallbackDependency");
+
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Dependency").UpdateHashContext} UpdateHashContext */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("../Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+/** @typedef {import("../util/semver").SemVerRange} SemVerRange */
+
+/**
+ * @typedef {Object} ConsumeOptions
+ * @property {string=} import fallback request
+ * @property {string=} importResolved resolved fallback request
+ * @property {string} shareKey global share key
+ * @property {string} shareScope share scope
+ * @property {SemVerRange | false | undefined} requiredVersion version requirement
+ * @property {string} packageName package name to determine required version automatically
+ * @property {boolean} strictVersion don't use shared version even if version isn't valid
+ * @property {boolean} singleton use single global version
+ * @property {boolean} eager include the fallback module in a sync way
+ */
+
+const TYPES = new Set(["consume-shared"]);
+
+class ConsumeSharedModule extends Module {
+	/**
+	 * @param {string} context context
+	 * @param {ConsumeOptions} options consume options
+	 */
+	constructor(context, options) {
+		super("consume-shared-module", context);
+		this.options = options;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		const {
+			shareKey,
+			shareScope,
+			importResolved,
+			requiredVersion,
+			strictVersion,
+			singleton,
+			eager
+		} = this.options;
+		return `consume-shared-module|${shareScope}|${shareKey}|${
+			requiredVersion && rangeToString(requiredVersion)
+		}|${strictVersion}|${importResolved}|${singleton}|${eager}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		const {
+			shareKey,
+			shareScope,
+			importResolved,
+			requiredVersion,
+			strictVersion,
+			singleton,
+			eager
+		} = this.options;
+		return `consume shared module (${shareScope}) ${shareKey}@${
+			requiredVersion ? rangeToString(requiredVersion) : "*"
+		}${strictVersion ? " (strict)" : ""}${singleton ? " (singleton)" : ""}${
+			importResolved
+				? ` (fallback: ${requestShortener.shorten(importResolved)})`
+				: ""
+		}${eager ? " (eager)" : ""}`;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		const { shareKey, shareScope, import: request } = this.options;
+		return `${
+			this.layer ? `(${this.layer})/` : ""
+		}webpack/sharing/consume/${shareScope}/${shareKey}${
+			request ? `/${request}` : ""
+		}`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		callback(null, !this.buildInfo);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {};
+		if (this.options.import) {
+			const dep = new ConsumeSharedFallbackDependency(this.options.import);
+			if (this.options.eager) {
+				this.addDependency(dep);
+			} else {
+				const block = new AsyncDependenciesBlock({});
+				block.addDependency(dep);
+				this.addBlock(block);
+			}
+		}
+		callback();
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 42;
+	}
+
+	/**
+	 * @param {Hash} hash the hash used to track dependencies
+	 * @param {UpdateHashContext} context context
+	 * @returns {void}
+	 */
+	updateHash(hash, context) {
+		hash.update(JSON.stringify(this.options));
+		super.updateHash(hash, context);
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({ chunkGraph, moduleGraph, runtimeTemplate }) {
+		const runtimeRequirements = new Set([RuntimeGlobals.shareScopeMap]);
+		const {
+			shareScope,
+			shareKey,
+			strictVersion,
+			requiredVersion,
+			import: request,
+			singleton,
+			eager
+		} = this.options;
+		let fallbackCode;
+		if (request) {
+			if (eager) {
+				const dep = this.dependencies[0];
+				fallbackCode = runtimeTemplate.syncModuleFactory({
+					dependency: dep,
+					chunkGraph,
+					runtimeRequirements,
+					request: this.options.import
+				});
+			} else {
+				const block = this.blocks[0];
+				fallbackCode = runtimeTemplate.asyncModuleFactory({
+					block,
+					chunkGraph,
+					runtimeRequirements,
+					request: this.options.import
+				});
+			}
+		}
+		let fn = "load";
+		const args = [JSON.stringify(shareScope), JSON.stringify(shareKey)];
+		if (requiredVersion) {
+			if (strictVersion) {
+				fn += "Strict";
+			}
+			if (singleton) {
+				fn += "Singleton";
+			}
+			args.push(stringifyHoley(requiredVersion));
+			fn += "VersionCheck";
+		} else {
+			if (singleton) {
+				fn += "Singleton";
+			}
+		}
+		if (fallbackCode) {
+			fn += "Fallback";
+			args.push(fallbackCode);
+		}
+		const code = runtimeTemplate.returningFunction(`${fn}(${args.join(", ")})`);
+		const sources = new Map();
+		sources.set("consume-shared", new RawSource(code));
+		return {
+			runtimeRequirements,
+			sources
+		};
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this.options);
+		super.serialize(context);
+	}
+
+	deserialize(context) {
+		const { read } = context;
+		this.options = read();
+		super.deserialize(context);
+	}
+}
+
+makeSerializable(
+	ConsumeSharedModule,
+	"webpack/lib/sharing/ConsumeSharedModule"
+);
+
+module.exports = ConsumeSharedModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedPlugin.js
new file mode 100644
index 0000000..a1a3c85
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedPlugin.js
@@ -0,0 +1,319 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleNotFoundError = require("../ModuleNotFoundError");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const WebpackError = require("../WebpackError");
+const { parseOptions } = require("../container/options");
+const LazySet = require("../util/LazySet");
+const createSchemaValidation = require("../util/create-schema-validation");
+const { parseRange } = require("../util/semver");
+const ConsumeSharedFallbackDependency = require("./ConsumeSharedFallbackDependency");
+const ConsumeSharedModule = require("./ConsumeSharedModule");
+const ConsumeSharedRuntimeModule = require("./ConsumeSharedRuntimeModule");
+const ProvideForSharedDependency = require("./ProvideForSharedDependency");
+const { resolveMatchedConfigs } = require("./resolveMatchedConfigs");
+const {
+	isRequiredVersion,
+	getDescriptionFile,
+	getRequiredVersionFromDescriptionFile
+} = require("./utils");
+
+/** @typedef {import("../../declarations/plugins/sharing/ConsumeSharedPlugin").ConsumeSharedPluginOptions} ConsumeSharedPluginOptions */
+/** @typedef {import("../../declarations/plugins/sharing/ConsumeSharedPlugin").ConsumesConfig} ConsumesConfig */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../ResolverFactory").ResolveOptionsWithDependencyType} ResolveOptionsWithDependencyType */
+/** @typedef {import("./ConsumeSharedModule").ConsumeOptions} ConsumeOptions */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/sharing/ConsumeSharedPlugin.check.js"),
+	() => require("../../schemas/plugins/sharing/ConsumeSharedPlugin.json"),
+	{
+		name: "Consume Shared Plugin",
+		baseDataPath: "options"
+	}
+);
+
+/** @type {ResolveOptionsWithDependencyType} */
+const RESOLVE_OPTIONS = { dependencyType: "esm" };
+const PLUGIN_NAME = "ConsumeSharedPlugin";
+
+class ConsumeSharedPlugin {
+	/**
+	 * @param {ConsumeSharedPluginOptions} options options
+	 */
+	constructor(options) {
+		if (typeof options !== "string") {
+			validate(options);
+		}
+
+		/** @type {[string, ConsumeOptions][]} */
+		this._consumes = parseOptions(
+			options.consumes,
+			(item, key) => {
+				if (Array.isArray(item)) throw new Error("Unexpected array in options");
+				/** @type {ConsumeOptions} */
+				let result =
+					item === key || !isRequiredVersion(item)
+						? // item is a request/key
+						  {
+								import: key,
+								shareScope: options.shareScope || "default",
+								shareKey: key,
+								requiredVersion: undefined,
+								packageName: undefined,
+								strictVersion: false,
+								singleton: false,
+								eager: false
+						  }
+						: // key is a request/key
+						  // item is a version
+						  {
+								import: key,
+								shareScope: options.shareScope || "default",
+								shareKey: key,
+								requiredVersion: parseRange(item),
+								strictVersion: true,
+								packageName: undefined,
+								singleton: false,
+								eager: false
+						  };
+				return result;
+			},
+			(item, key) => ({
+				import: item.import === false ? undefined : item.import || key,
+				shareScope: item.shareScope || options.shareScope || "default",
+				shareKey: item.shareKey || key,
+				requiredVersion:
+					typeof item.requiredVersion === "string"
+						? parseRange(item.requiredVersion)
+						: item.requiredVersion,
+				strictVersion:
+					typeof item.strictVersion === "boolean"
+						? item.strictVersion
+						: item.import !== false && !item.singleton,
+				packageName: item.packageName,
+				singleton: !!item.singleton,
+				eager: !!item.eager
+			})
+		);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			PLUGIN_NAME,
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					ConsumeSharedFallbackDependency,
+					normalModuleFactory
+				);
+
+				let unresolvedConsumes, resolvedConsumes, prefixedConsumes;
+				const promise = resolveMatchedConfigs(compilation, this._consumes).then(
+					({ resolved, unresolved, prefixed }) => {
+						resolvedConsumes = resolved;
+						unresolvedConsumes = unresolved;
+						prefixedConsumes = prefixed;
+					}
+				);
+
+				const resolver = compilation.resolverFactory.get(
+					"normal",
+					RESOLVE_OPTIONS
+				);
+
+				/**
+				 * @param {string} context issuer directory
+				 * @param {string} request request
+				 * @param {ConsumeOptions} config options
+				 * @returns {Promise<ConsumeSharedModule>} create module
+				 */
+				const createConsumeSharedModule = (context, request, config) => {
+					const requiredVersionWarning = details => {
+						const error = new WebpackError(
+							`No required version specified and unable to automatically determine one. ${details}`
+						);
+						error.file = `shared module ${request}`;
+						compilation.warnings.push(error);
+					};
+					const directFallback =
+						config.import &&
+						/^(\.\.?(\/|$)|\/|[A-Za-z]:|\\\\)/.test(config.import);
+					return Promise.all([
+						new Promise(resolve => {
+							if (!config.import) return resolve();
+							const resolveContext = {
+								/** @type {LazySet<string>} */
+								fileDependencies: new LazySet(),
+								/** @type {LazySet<string>} */
+								contextDependencies: new LazySet(),
+								/** @type {LazySet<string>} */
+								missingDependencies: new LazySet()
+							};
+							resolver.resolve(
+								{},
+								directFallback ? compiler.context : context,
+								config.import,
+								resolveContext,
+								(err, result) => {
+									compilation.contextDependencies.addAll(
+										resolveContext.contextDependencies
+									);
+									compilation.fileDependencies.addAll(
+										resolveContext.fileDependencies
+									);
+									compilation.missingDependencies.addAll(
+										resolveContext.missingDependencies
+									);
+									if (err) {
+										compilation.errors.push(
+											new ModuleNotFoundError(null, err, {
+												name: `resolving fallback for shared module ${request}`
+											})
+										);
+										return resolve();
+									}
+									resolve(result);
+								}
+							);
+						}),
+						new Promise(resolve => {
+							if (config.requiredVersion !== undefined)
+								return resolve(config.requiredVersion);
+							let packageName = config.packageName;
+							if (packageName === undefined) {
+								if (/^(\/|[A-Za-z]:|\\\\)/.test(request)) {
+									// For relative or absolute requests we don't automatically use a packageName.
+									// If wished one can specify one with the packageName option.
+									return resolve();
+								}
+								const match = /^((?:@[^\\/]+[\\/])?[^\\/]+)/.exec(request);
+								if (!match) {
+									requiredVersionWarning(
+										"Unable to extract the package name from request."
+									);
+									return resolve();
+								}
+								packageName = match[0];
+							}
+
+							getDescriptionFile(
+								compilation.inputFileSystem,
+								context,
+								["package.json"],
+								(err, result) => {
+									if (err) {
+										requiredVersionWarning(
+											`Unable to read description file: ${err}`
+										);
+										return resolve();
+									}
+									const { data, path: descriptionPath } = result;
+									if (!data) {
+										requiredVersionWarning(
+											`Unable to find description file in ${context}.`
+										);
+										return resolve();
+									}
+									const requiredVersion = getRequiredVersionFromDescriptionFile(
+										data,
+										packageName
+									);
+									if (typeof requiredVersion !== "string") {
+										requiredVersionWarning(
+											`Unable to find required version for "${packageName}" in description file (${descriptionPath}). It need to be in dependencies, devDependencies or peerDependencies.`
+										);
+										return resolve();
+									}
+									resolve(parseRange(requiredVersion));
+								}
+							);
+						})
+					]).then(([importResolved, requiredVersion]) => {
+						return new ConsumeSharedModule(
+							directFallback ? compiler.context : context,
+							{
+								...config,
+								importResolved,
+								import: importResolved ? config.import : undefined,
+								requiredVersion
+							}
+						);
+					});
+				};
+
+				normalModuleFactory.hooks.factorize.tapPromise(
+					PLUGIN_NAME,
+					({ context, request, dependencies }) =>
+						// wait for resolving to be complete
+						promise.then(() => {
+							if (
+								dependencies[0] instanceof ConsumeSharedFallbackDependency ||
+								dependencies[0] instanceof ProvideForSharedDependency
+							) {
+								return;
+							}
+							const match = unresolvedConsumes.get(request);
+							if (match !== undefined) {
+								return createConsumeSharedModule(context, request, match);
+							}
+							for (const [prefix, options] of prefixedConsumes) {
+								if (request.startsWith(prefix)) {
+									const remainder = request.slice(prefix.length);
+									return createConsumeSharedModule(context, request, {
+										...options,
+										import: options.import
+											? options.import + remainder
+											: undefined,
+										shareKey: options.shareKey + remainder
+									});
+								}
+							}
+						})
+				);
+				normalModuleFactory.hooks.createModule.tapPromise(
+					PLUGIN_NAME,
+					({ resource }, { context, dependencies }) => {
+						if (
+							dependencies[0] instanceof ConsumeSharedFallbackDependency ||
+							dependencies[0] instanceof ProvideForSharedDependency
+						) {
+							return Promise.resolve();
+						}
+						const options = resolvedConsumes.get(resource);
+						if (options !== undefined) {
+							return createConsumeSharedModule(context, resource, options);
+						}
+						return Promise.resolve();
+					}
+				);
+				compilation.hooks.additionalTreeRuntimeRequirements.tap(
+					PLUGIN_NAME,
+					(chunk, set) => {
+						set.add(RuntimeGlobals.module);
+						set.add(RuntimeGlobals.moduleCache);
+						set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+						set.add(RuntimeGlobals.shareScopeMap);
+						set.add(RuntimeGlobals.initializeSharing);
+						set.add(RuntimeGlobals.hasOwnProperty);
+						compilation.addRuntimeModule(
+							chunk,
+							new ConsumeSharedRuntimeModule(set)
+						);
+					}
+				);
+			}
+		);
+	}
+}
+
+module.exports = ConsumeSharedPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedRuntimeModule.js
new file mode 100644
index 0000000..78edabd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ConsumeSharedRuntimeModule.js
@@ -0,0 +1,360 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const {
+	parseVersionRuntimeCode,
+	versionLtRuntimeCode,
+	rangeToStringRuntimeCode,
+	satisfyRuntimeCode
+} = require("../util/semver");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("./ConsumeSharedModule")} ConsumeSharedModule */
+
+class ConsumeSharedRuntimeModule extends RuntimeModule {
+	constructor(runtimeRequirements) {
+		super("consumes", RuntimeModule.STAGE_ATTACH);
+		this._runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation, chunkGraph } = this;
+		const { runtimeTemplate, codeGenerationResults } = compilation;
+		const chunkToModuleMapping = {};
+		/** @type {Map<string | number, Source>} */
+		const moduleIdToSourceMapping = new Map();
+		const initialConsumes = [];
+		/**
+		 *
+		 * @param {Iterable<Module>} modules modules
+		 * @param {Chunk} chunk the chunk
+		 * @param {(string | number)[]} list list of ids
+		 */
+		const addModules = (modules, chunk, list) => {
+			for (const m of modules) {
+				const module = /** @type {ConsumeSharedModule} */ (m);
+				const id = chunkGraph.getModuleId(module);
+				list.push(id);
+				moduleIdToSourceMapping.set(
+					id,
+					codeGenerationResults.getSource(
+						module,
+						chunk.runtime,
+						"consume-shared"
+					)
+				);
+			}
+		};
+		for (const chunk of this.chunk.getAllAsyncChunks()) {
+			const modules = chunkGraph.getChunkModulesIterableBySourceType(
+				chunk,
+				"consume-shared"
+			);
+			if (!modules) continue;
+			addModules(modules, chunk, (chunkToModuleMapping[chunk.id] = []));
+		}
+		for (const chunk of this.chunk.getAllInitialChunks()) {
+			const modules = chunkGraph.getChunkModulesIterableBySourceType(
+				chunk,
+				"consume-shared"
+			);
+			if (!modules) continue;
+			addModules(modules, chunk, initialConsumes);
+		}
+		if (moduleIdToSourceMapping.size === 0) return null;
+		return Template.asString([
+			parseVersionRuntimeCode(runtimeTemplate),
+			versionLtRuntimeCode(runtimeTemplate),
+			rangeToStringRuntimeCode(runtimeTemplate),
+			satisfyRuntimeCode(runtimeTemplate),
+			`var ensureExistence = ${runtimeTemplate.basicFunction("scopeName, key", [
+				`var scope = ${RuntimeGlobals.shareScopeMap}[scopeName];`,
+				`if(!scope || !${RuntimeGlobals.hasOwnProperty}(scope, key)) throw new Error("Shared module " + key + " doesn't exist in shared scope " + scopeName);`,
+				"return scope;"
+			])};`,
+			`var findVersion = ${runtimeTemplate.basicFunction("scope, key", [
+				"var versions = scope[key];",
+				`var key = Object.keys(versions).reduce(${runtimeTemplate.basicFunction(
+					"a, b",
+					["return !a || versionLt(a, b) ? b : a;"]
+				)}, 0);`,
+				"return key && versions[key]"
+			])};`,
+			`var findSingletonVersionKey = ${runtimeTemplate.basicFunction(
+				"scope, key",
+				[
+					"var versions = scope[key];",
+					`return Object.keys(versions).reduce(${runtimeTemplate.basicFunction(
+						"a, b",
+						["return !a || (!versions[a].loaded && versionLt(a, b)) ? b : a;"]
+					)}, 0);`
+				]
+			)};`,
+			`var getInvalidSingletonVersionMessage = ${runtimeTemplate.basicFunction(
+				"scope, key, version, requiredVersion",
+				[
+					`return "Unsatisfied version " + version + " from " + (version && scope[key][version].from) + " of shared singleton module " + key + " (required " + rangeToString(requiredVersion) + ")"`
+				]
+			)};`,
+			`var getSingleton = ${runtimeTemplate.basicFunction(
+				"scope, scopeName, key, requiredVersion",
+				[
+					"var version = findSingletonVersionKey(scope, key);",
+					"return get(scope[key][version]);"
+				]
+			)};`,
+			`var getSingletonVersion = ${runtimeTemplate.basicFunction(
+				"scope, scopeName, key, requiredVersion",
+				[
+					"var version = findSingletonVersionKey(scope, key);",
+					"if (!satisfy(requiredVersion, version)) " +
+						'typeof console !== "undefined" && console.warn && console.warn(getInvalidSingletonVersionMessage(scope, key, version, requiredVersion));',
+					"return get(scope[key][version]);"
+				]
+			)};`,
+			`var getStrictSingletonVersion = ${runtimeTemplate.basicFunction(
+				"scope, scopeName, key, requiredVersion",
+				[
+					"var version = findSingletonVersionKey(scope, key);",
+					"if (!satisfy(requiredVersion, version)) " +
+						"throw new Error(getInvalidSingletonVersionMessage(scope, key, version, requiredVersion));",
+					"return get(scope[key][version]);"
+				]
+			)};`,
+			`var findValidVersion = ${runtimeTemplate.basicFunction(
+				"scope, key, requiredVersion",
+				[
+					"var versions = scope[key];",
+					`var key = Object.keys(versions).reduce(${runtimeTemplate.basicFunction(
+						"a, b",
+						[
+							"if (!satisfy(requiredVersion, b)) return a;",
+							"return !a || versionLt(a, b) ? b : a;"
+						]
+					)}, 0);`,
+					"return key && versions[key]"
+				]
+			)};`,
+			`var getInvalidVersionMessage = ${runtimeTemplate.basicFunction(
+				"scope, scopeName, key, requiredVersion",
+				[
+					"var versions = scope[key];",
+					'return "No satisfying version (" + rangeToString(requiredVersion) + ") of shared module " + key + " found in shared scope " + scopeName + ".\\n" +',
+					`\t"Available versions: " + Object.keys(versions).map(${runtimeTemplate.basicFunction(
+						"key",
+						['return key + " from " + versions[key].from;']
+					)}).join(", ");`
+				]
+			)};`,
+			`var getValidVersion = ${runtimeTemplate.basicFunction(
+				"scope, scopeName, key, requiredVersion",
+				[
+					"var entry = findValidVersion(scope, key, requiredVersion);",
+					"if(entry) return get(entry);",
+					"throw new Error(getInvalidVersionMessage(scope, scopeName, key, requiredVersion));"
+				]
+			)};`,
+			`var warnInvalidVersion = ${runtimeTemplate.basicFunction(
+				"scope, scopeName, key, requiredVersion",
+				[
+					'typeof console !== "undefined" && console.warn && console.warn(getInvalidVersionMessage(scope, scopeName, key, requiredVersion));'
+				]
+			)};`,
+			`var get = ${runtimeTemplate.basicFunction("entry", [
+				"entry.loaded = 1;",
+				"return entry.get()"
+			])};`,
+			`var init = ${runtimeTemplate.returningFunction(
+				Template.asString([
+					"function(scopeName, a, b, c) {",
+					Template.indent([
+						`var promise = ${RuntimeGlobals.initializeSharing}(scopeName);`,
+						`if (promise && promise.then) return promise.then(fn.bind(fn, scopeName, ${RuntimeGlobals.shareScopeMap}[scopeName], a, b, c));`,
+						`return fn(scopeName, ${RuntimeGlobals.shareScopeMap}[scopeName], a, b, c);`
+					]),
+					"}"
+				]),
+				"fn"
+			)};`,
+			"",
+			`var load = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key",
+				[
+					"ensureExistence(scopeName, key);",
+					"return get(findVersion(scope, key));"
+				]
+			)});`,
+			`var loadFallback = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, fallback",
+				[
+					`return scope && ${RuntimeGlobals.hasOwnProperty}(scope, key) ? get(findVersion(scope, key)) : fallback();`
+				]
+			)});`,
+			`var loadVersionCheck = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version",
+				[
+					"ensureExistence(scopeName, key);",
+					"return get(findValidVersion(scope, key, version) || warnInvalidVersion(scope, scopeName, key, version) || findVersion(scope, key));"
+				]
+			)});`,
+			`var loadSingleton = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key",
+				[
+					"ensureExistence(scopeName, key);",
+					"return getSingleton(scope, scopeName, key);"
+				]
+			)});`,
+			`var loadSingletonVersionCheck = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version",
+				[
+					"ensureExistence(scopeName, key);",
+					"return getSingletonVersion(scope, scopeName, key, version);"
+				]
+			)});`,
+			`var loadStrictVersionCheck = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version",
+				[
+					"ensureExistence(scopeName, key);",
+					"return getValidVersion(scope, scopeName, key, version);"
+				]
+			)});`,
+			`var loadStrictSingletonVersionCheck = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version",
+				[
+					"ensureExistence(scopeName, key);",
+					"return getStrictSingletonVersion(scope, scopeName, key, version);"
+				]
+			)});`,
+			`var loadVersionCheckFallback = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version, fallback",
+				[
+					`if(!scope || !${RuntimeGlobals.hasOwnProperty}(scope, key)) return fallback();`,
+					"return get(findValidVersion(scope, key, version) || warnInvalidVersion(scope, scopeName, key, version) || findVersion(scope, key));"
+				]
+			)});`,
+			`var loadSingletonFallback = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, fallback",
+				[
+					`if(!scope || !${RuntimeGlobals.hasOwnProperty}(scope, key)) return fallback();`,
+					"return getSingleton(scope, scopeName, key);"
+				]
+			)});`,
+			`var loadSingletonVersionCheckFallback = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version, fallback",
+				[
+					`if(!scope || !${RuntimeGlobals.hasOwnProperty}(scope, key)) return fallback();`,
+					"return getSingletonVersion(scope, scopeName, key, version);"
+				]
+			)});`,
+			`var loadStrictVersionCheckFallback = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version, fallback",
+				[
+					`var entry = scope && ${RuntimeGlobals.hasOwnProperty}(scope, key) && findValidVersion(scope, key, version);`,
+					`return entry ? get(entry) : fallback();`
+				]
+			)});`,
+			`var loadStrictSingletonVersionCheckFallback = /*#__PURE__*/ init(${runtimeTemplate.basicFunction(
+				"scopeName, scope, key, version, fallback",
+				[
+					`if(!scope || !${RuntimeGlobals.hasOwnProperty}(scope, key)) return fallback();`,
+					"return getStrictSingletonVersion(scope, scopeName, key, version);"
+				]
+			)});`,
+			"var installedModules = {};",
+			"var moduleToHandlerMapping = {",
+			Template.indent(
+				Array.from(
+					moduleIdToSourceMapping,
+					([key, source]) => `${JSON.stringify(key)}: ${source.source()}`
+				).join(",\n")
+			),
+			"};",
+
+			initialConsumes.length > 0
+				? Template.asString([
+						`var initialConsumes = ${JSON.stringify(initialConsumes)};`,
+						`initialConsumes.forEach(${runtimeTemplate.basicFunction("id", [
+							`${
+								RuntimeGlobals.moduleFactories
+							}[id] = ${runtimeTemplate.basicFunction("module", [
+								"// Handle case when module is used sync",
+								"installedModules[id] = 0;",
+								`delete ${RuntimeGlobals.moduleCache}[id];`,
+								"var factory = moduleToHandlerMapping[id]();",
+								'if(typeof factory !== "function") throw new Error("Shared module is not available for eager consumption: " + id);',
+								`module.exports = factory();`
+							])}`
+						])});`
+				  ])
+				: "// no consumes in initial chunks",
+			this._runtimeRequirements.has(RuntimeGlobals.ensureChunkHandlers)
+				? Template.asString([
+						`var chunkMapping = ${JSON.stringify(
+							chunkToModuleMapping,
+							null,
+							"\t"
+						)};`,
+						`${
+							RuntimeGlobals.ensureChunkHandlers
+						}.consumes = ${runtimeTemplate.basicFunction("chunkId, promises", [
+							`if(${RuntimeGlobals.hasOwnProperty}(chunkMapping, chunkId)) {`,
+							Template.indent([
+								`chunkMapping[chunkId].forEach(${runtimeTemplate.basicFunction(
+									"id",
+									[
+										`if(${RuntimeGlobals.hasOwnProperty}(installedModules, id)) return promises.push(installedModules[id]);`,
+										`var onFactory = ${runtimeTemplate.basicFunction(
+											"factory",
+											[
+												"installedModules[id] = 0;",
+												`${
+													RuntimeGlobals.moduleFactories
+												}[id] = ${runtimeTemplate.basicFunction("module", [
+													`delete ${RuntimeGlobals.moduleCache}[id];`,
+													"module.exports = factory();"
+												])}`
+											]
+										)};`,
+										`var onError = ${runtimeTemplate.basicFunction("error", [
+											"delete installedModules[id];",
+											`${
+												RuntimeGlobals.moduleFactories
+											}[id] = ${runtimeTemplate.basicFunction("module", [
+												`delete ${RuntimeGlobals.moduleCache}[id];`,
+												"throw error;"
+											])}`
+										])};`,
+										"try {",
+										Template.indent([
+											"var promise = moduleToHandlerMapping[id]();",
+											"if(promise.then) {",
+											Template.indent(
+												"promises.push(installedModules[id] = promise.then(onFactory)['catch'](onError));"
+											),
+											"} else onFactory(promise);"
+										]),
+										"} catch(e) { onError(e); }"
+									]
+								)});`
+							]),
+							"}"
+						])}`
+				  ])
+				: "// no chunk loading of consumes"
+		]);
+	}
+}
+
+module.exports = ConsumeSharedRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideForSharedDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideForSharedDependency.js
new file mode 100644
index 0000000..5177f61
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideForSharedDependency.js
@@ -0,0 +1,34 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleDependency = require("../dependencies/ModuleDependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class ProvideForSharedDependency extends ModuleDependency {
+	/**
+	 *
+	 * @param {string} request request string
+	 */
+	constructor(request) {
+		super(request);
+	}
+
+	get type() {
+		return "provide module for shared";
+	}
+
+	get category() {
+		return "esm";
+	}
+}
+
+makeSerializable(
+	ProvideForSharedDependency,
+	"webpack/lib/sharing/ProvideForSharedDependency"
+);
+
+module.exports = ProvideForSharedDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedDependency.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedDependency.js
new file mode 100644
index 0000000..fa24351
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedDependency.js
@@ -0,0 +1,63 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Dependency = require("../Dependency");
+const makeSerializable = require("../util/makeSerializable");
+
+class ProvideSharedDependency extends Dependency {
+	constructor(shareScope, name, version, request, eager) {
+		super();
+		this.shareScope = shareScope;
+		this.name = name;
+		this.version = version;
+		this.request = request;
+		this.eager = eager;
+	}
+
+	get type() {
+		return "provide shared module";
+	}
+
+	/**
+	 * @returns {string | null} an identifier to merge equal requests
+	 */
+	getResourceIdentifier() {
+		return `provide module (${this.shareScope}) ${this.request} as ${
+			this.name
+		} @ ${this.version}${this.eager ? " (eager)" : ""}`;
+	}
+
+	serialize(context) {
+		context.write(this.shareScope);
+		context.write(this.name);
+		context.write(this.request);
+		context.write(this.version);
+		context.write(this.eager);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const { read } = context;
+		const obj = new ProvideSharedDependency(
+			read(),
+			read(),
+			read(),
+			read(),
+			read()
+		);
+		this.shareScope = context.read();
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(
+	ProvideSharedDependency,
+	"webpack/lib/sharing/ProvideSharedDependency"
+);
+
+module.exports = ProvideSharedDependency;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedModule.js
new file mode 100644
index 0000000..1749ac4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedModule.js
@@ -0,0 +1,184 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const AsyncDependenciesBlock = require("../AsyncDependenciesBlock");
+const Module = require("../Module");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const makeSerializable = require("../util/makeSerializable");
+const ProvideForSharedDependency = require("./ProvideForSharedDependency");
+
+/** @typedef {import("../../declarations/WebpackOptions").WebpackOptionsNormalized} WebpackOptions */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Module").CodeGenerationContext} CodeGenerationContext */
+/** @typedef {import("../Module").CodeGenerationResult} CodeGenerationResult */
+/** @typedef {import("../Module").LibIdentOptions} LibIdentOptions */
+/** @typedef {import("../Module").NeedBuildContext} NeedBuildContext */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../ResolverFactory").ResolverWithOptions} ResolverWithOptions */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/Hash")} Hash */
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+
+const TYPES = new Set(["share-init"]);
+
+class ProvideSharedModule extends Module {
+	/**
+	 * @param {string} shareScope shared scope name
+	 * @param {string} name shared key
+	 * @param {string | false} version version
+	 * @param {string} request request to the provided module
+	 * @param {boolean} eager include the module in sync way
+	 */
+	constructor(shareScope, name, version, request, eager) {
+		super("provide-module");
+		this._shareScope = shareScope;
+		this._name = name;
+		this._version = version;
+		this._request = request;
+		this._eager = eager;
+	}
+
+	/**
+	 * @returns {string} a unique identifier of the module
+	 */
+	identifier() {
+		return `provide module (${this._shareScope}) ${this._name}@${this._version} = ${this._request}`;
+	}
+
+	/**
+	 * @param {RequestShortener} requestShortener the request shortener
+	 * @returns {string} a user readable identifier of the module
+	 */
+	readableIdentifier(requestShortener) {
+		return `provide shared module (${this._shareScope}) ${this._name}@${
+			this._version
+		} = ${requestShortener.shorten(this._request)}`;
+	}
+
+	/**
+	 * @param {LibIdentOptions} options options
+	 * @returns {string | null} an identifier for library inclusion
+	 */
+	libIdent(options) {
+		return `${this.layer ? `(${this.layer})/` : ""}webpack/sharing/provide/${
+			this._shareScope
+		}/${this._name}`;
+	}
+
+	/**
+	 * @param {NeedBuildContext} context context info
+	 * @param {function((WebpackError | null)=, boolean=): void} callback callback function, returns true, if the module needs a rebuild
+	 * @returns {void}
+	 */
+	needBuild(context, callback) {
+		callback(null, !this.buildInfo);
+	}
+
+	/**
+	 * @param {WebpackOptions} options webpack options
+	 * @param {Compilation} compilation the compilation
+	 * @param {ResolverWithOptions} resolver the resolver
+	 * @param {InputFileSystem} fs the file system
+	 * @param {function(WebpackError=): void} callback callback function
+	 * @returns {void}
+	 */
+	build(options, compilation, resolver, fs, callback) {
+		this.buildMeta = {};
+		this.buildInfo = {
+			strict: true
+		};
+
+		this.clearDependenciesAndBlocks();
+		const dep = new ProvideForSharedDependency(this._request);
+		if (this._eager) {
+			this.addDependency(dep);
+		} else {
+			const block = new AsyncDependenciesBlock({});
+			block.addDependency(dep);
+			this.addBlock(block);
+		}
+
+		callback();
+	}
+
+	/**
+	 * @param {string=} type the source type for which the size should be estimated
+	 * @returns {number} the estimated size of the module (must be non-zero)
+	 */
+	size(type) {
+		return 42;
+	}
+
+	/**
+	 * @returns {Set<string>} types available (do not mutate)
+	 */
+	getSourceTypes() {
+		return TYPES;
+	}
+
+	/**
+	 * @param {CodeGenerationContext} context context for code generation
+	 * @returns {CodeGenerationResult} result
+	 */
+	codeGeneration({ runtimeTemplate, moduleGraph, chunkGraph }) {
+		const runtimeRequirements = new Set([RuntimeGlobals.initializeSharing]);
+		const code = `register(${JSON.stringify(this._name)}, ${JSON.stringify(
+			this._version || "0"
+		)}, ${
+			this._eager
+				? runtimeTemplate.syncModuleFactory({
+						dependency: this.dependencies[0],
+						chunkGraph,
+						request: this._request,
+						runtimeRequirements
+				  })
+				: runtimeTemplate.asyncModuleFactory({
+						block: this.blocks[0],
+						chunkGraph,
+						request: this._request,
+						runtimeRequirements
+				  })
+		}${this._eager ? ", 1" : ""});`;
+		const sources = new Map();
+		const data = new Map();
+		data.set("share-init", [
+			{
+				shareScope: this._shareScope,
+				initStage: 10,
+				init: code
+			}
+		]);
+		return { sources, data, runtimeRequirements };
+	}
+
+	serialize(context) {
+		const { write } = context;
+		write(this._shareScope);
+		write(this._name);
+		write(this._version);
+		write(this._request);
+		write(this._eager);
+		super.serialize(context);
+	}
+
+	static deserialize(context) {
+		const { read } = context;
+		const obj = new ProvideSharedModule(read(), read(), read(), read(), read());
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+makeSerializable(
+	ProvideSharedModule,
+	"webpack/lib/sharing/ProvideSharedModule"
+);
+
+module.exports = ProvideSharedModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedModuleFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedModuleFactory.js
new file mode 100644
index 0000000..2b3b19f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedModuleFactory.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const ModuleFactory = require("../ModuleFactory");
+const ProvideSharedModule = require("./ProvideSharedModule");
+
+/** @typedef {import("../ModuleFactory").ModuleFactoryCreateData} ModuleFactoryCreateData */
+/** @typedef {import("../ModuleFactory").ModuleFactoryResult} ModuleFactoryResult */
+/** @typedef {import("./ProvideSharedDependency")} ProvideSharedDependency */
+
+class ProvideSharedModuleFactory extends ModuleFactory {
+	/**
+	 * @param {ModuleFactoryCreateData} data data object
+	 * @param {function(Error=, ModuleFactoryResult=): void} callback callback
+	 * @returns {void}
+	 */
+	create(data, callback) {
+		const dep = /** @type {ProvideSharedDependency} */ (data.dependencies[0]);
+		callback(null, {
+			module: new ProvideSharedModule(
+				dep.shareScope,
+				dep.name,
+				dep.version,
+				dep.request,
+				dep.eager
+			)
+		});
+	}
+}
+
+module.exports = ProvideSharedModuleFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedPlugin.js
new file mode 100644
index 0000000..99709f1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ProvideSharedPlugin.js
@@ -0,0 +1,237 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+const { parseOptions } = require("../container/options");
+const createSchemaValidation = require("../util/create-schema-validation");
+const ProvideForSharedDependency = require("./ProvideForSharedDependency");
+const ProvideSharedDependency = require("./ProvideSharedDependency");
+const ProvideSharedModuleFactory = require("./ProvideSharedModuleFactory");
+
+/** @typedef {import("../../declarations/plugins/sharing/ProvideSharedPlugin").ProvideSharedPluginOptions} ProvideSharedPluginOptions */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compiler")} Compiler */
+
+const validate = createSchemaValidation(
+	require("../../schemas/plugins/sharing/ProvideSharedPlugin.check.js"),
+	() => require("../../schemas/plugins/sharing/ProvideSharedPlugin.json"),
+	{
+		name: "Provide Shared Plugin",
+		baseDataPath: "options"
+	}
+);
+
+/**
+ * @typedef {Object} ProvideOptions
+ * @property {string} shareKey
+ * @property {string} shareScope
+ * @property {string | undefined | false} version
+ * @property {boolean} eager
+ */
+
+/** @typedef {Map<string, { config: ProvideOptions, version: string | undefined | false }>} ResolvedProvideMap */
+
+class ProvideSharedPlugin {
+	/**
+	 * @param {ProvideSharedPluginOptions} options options
+	 */
+	constructor(options) {
+		validate(options);
+
+		/** @type {[string, ProvideOptions][]} */
+		this._provides = parseOptions(
+			options.provides,
+			item => {
+				if (Array.isArray(item))
+					throw new Error("Unexpected array of provides");
+				/** @type {ProvideOptions} */
+				const result = {
+					shareKey: item,
+					version: undefined,
+					shareScope: options.shareScope || "default",
+					eager: false
+				};
+				return result;
+			},
+			item => ({
+				shareKey: item.shareKey,
+				version: item.version,
+				shareScope: item.shareScope || options.shareScope || "default",
+				eager: !!item.eager
+			})
+		);
+		this._provides.sort(([a], [b]) => {
+			if (a < b) return -1;
+			if (b < a) return 1;
+			return 0;
+		});
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		/** @type {WeakMap<Compilation, ResolvedProvideMap>} */
+		const compilationData = new WeakMap();
+
+		compiler.hooks.compilation.tap(
+			"ProvideSharedPlugin",
+			(compilation, { normalModuleFactory }) => {
+				/** @type {ResolvedProvideMap} */
+				const resolvedProvideMap = new Map();
+				/** @type {Map<string, ProvideOptions>} */
+				const matchProvides = new Map();
+				/** @type {Map<string, ProvideOptions>} */
+				const prefixMatchProvides = new Map();
+				for (const [request, config] of this._provides) {
+					if (/^(\/|[A-Za-z]:\\|\\\\|\.\.?(\/|$))/.test(request)) {
+						// relative request
+						resolvedProvideMap.set(request, {
+							config,
+							version: config.version
+						});
+					} else if (/^(\/|[A-Za-z]:\\|\\\\)/.test(request)) {
+						// absolute path
+						resolvedProvideMap.set(request, {
+							config,
+							version: config.version
+						});
+					} else if (request.endsWith("/")) {
+						// module request prefix
+						prefixMatchProvides.set(request, config);
+					} else {
+						// module request
+						matchProvides.set(request, config);
+					}
+				}
+				compilationData.set(compilation, resolvedProvideMap);
+				const provideSharedModule = (
+					key,
+					config,
+					resource,
+					resourceResolveData
+				) => {
+					let version = config.version;
+					if (version === undefined) {
+						let details = "";
+						if (!resourceResolveData) {
+							details = `No resolve data provided from resolver.`;
+						} else {
+							const descriptionFileData =
+								resourceResolveData.descriptionFileData;
+							if (!descriptionFileData) {
+								details =
+									"No description file (usually package.json) found. Add description file with name and version, or manually specify version in shared config.";
+							} else if (!descriptionFileData.version) {
+								details =
+									"No version in description file (usually package.json). Add version to description file, or manually specify version in shared config.";
+							} else {
+								version = descriptionFileData.version;
+							}
+						}
+						if (!version) {
+							const error = new WebpackError(
+								`No version specified and unable to automatically determine one. ${details}`
+							);
+							error.file = `shared module ${key} -> ${resource}`;
+							compilation.warnings.push(error);
+						}
+					}
+					resolvedProvideMap.set(resource, {
+						config,
+						version
+					});
+				};
+				normalModuleFactory.hooks.module.tap(
+					"ProvideSharedPlugin",
+					(module, { resource, resourceResolveData }, resolveData) => {
+						if (resolvedProvideMap.has(resource)) {
+							return module;
+						}
+						const { request } = resolveData;
+						{
+							const config = matchProvides.get(request);
+							if (config !== undefined) {
+								provideSharedModule(
+									request,
+									config,
+									resource,
+									resourceResolveData
+								);
+								resolveData.cacheable = false;
+							}
+						}
+						for (const [prefix, config] of prefixMatchProvides) {
+							if (request.startsWith(prefix)) {
+								const remainder = request.slice(prefix.length);
+								provideSharedModule(
+									resource,
+									{
+										...config,
+										shareKey: config.shareKey + remainder
+									},
+									resource,
+									resourceResolveData
+								);
+								resolveData.cacheable = false;
+							}
+						}
+						return module;
+					}
+				);
+			}
+		);
+		compiler.hooks.finishMake.tapPromise("ProvideSharedPlugin", compilation => {
+			const resolvedProvideMap = compilationData.get(compilation);
+			if (!resolvedProvideMap) return Promise.resolve();
+			return Promise.all(
+				Array.from(
+					resolvedProvideMap,
+					([resource, { config, version }]) =>
+						new Promise((resolve, reject) => {
+							compilation.addInclude(
+								compiler.context,
+								new ProvideSharedDependency(
+									config.shareScope,
+									config.shareKey,
+									version || false,
+									resource,
+									config.eager
+								),
+								{
+									name: undefined
+								},
+								err => {
+									if (err) return reject(err);
+									resolve();
+								}
+							);
+						})
+				)
+			).then(() => {});
+		});
+
+		compiler.hooks.compilation.tap(
+			"ProvideSharedPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					ProvideForSharedDependency,
+					normalModuleFactory
+				);
+
+				compilation.dependencyFactories.set(
+					ProvideSharedDependency,
+					new ProvideSharedModuleFactory()
+				);
+			}
+		);
+	}
+}
+
+module.exports = ProvideSharedPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/SharePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/SharePlugin.js
new file mode 100644
index 0000000..ccbd9bb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/SharePlugin.js
@@ -0,0 +1,92 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra and Zackary Jackson @ScriptedAlchemy
+*/
+
+"use strict";
+
+const { parseOptions } = require("../container/options");
+const ConsumeSharedPlugin = require("./ConsumeSharedPlugin");
+const ProvideSharedPlugin = require("./ProvideSharedPlugin");
+const { isRequiredVersion } = require("./utils");
+
+/** @typedef {import("../../declarations/plugins/sharing/ConsumeSharedPlugin").ConsumeSharedPluginOptions} ConsumeSharedPluginOptions */
+/** @typedef {import("../../declarations/plugins/sharing/ConsumeSharedPlugin").ConsumesConfig} ConsumesConfig */
+/** @typedef {import("../../declarations/plugins/sharing/ProvideSharedPlugin").ProvideSharedPluginOptions} ProvideSharedPluginOptions */
+/** @typedef {import("../../declarations/plugins/sharing/ProvideSharedPlugin").ProvidesConfig} ProvidesConfig */
+/** @typedef {import("../../declarations/plugins/sharing/SharePlugin").SharePluginOptions} SharePluginOptions */
+/** @typedef {import("../../declarations/plugins/sharing/SharePlugin").SharedConfig} SharedConfig */
+/** @typedef {import("../Compiler")} Compiler */
+
+class SharePlugin {
+	/**
+	 * @param {SharePluginOptions} options options
+	 */
+	constructor(options) {
+		/** @type {[string, SharedConfig][]} */
+		const sharedOptions = parseOptions(
+			options.shared,
+			(item, key) => {
+				if (typeof item !== "string")
+					throw new Error("Unexpected array in shared");
+				/** @type {SharedConfig} */
+				const config =
+					item === key || !isRequiredVersion(item)
+						? {
+								import: item
+						  }
+						: {
+								import: key,
+								requiredVersion: item
+						  };
+				return config;
+			},
+			item => item
+		);
+		/** @type {Record<string, ConsumesConfig>[]} */
+		const consumes = sharedOptions.map(([key, options]) => ({
+			[key]: {
+				import: options.import,
+				shareKey: options.shareKey || key,
+				shareScope: options.shareScope,
+				requiredVersion: options.requiredVersion,
+				strictVersion: options.strictVersion,
+				singleton: options.singleton,
+				packageName: options.packageName,
+				eager: options.eager
+			}
+		}));
+		/** @type {Record<string, ProvidesConfig>[]} */
+		const provides = sharedOptions
+			.filter(([, options]) => options.import !== false)
+			.map(([key, options]) => ({
+				[options.import || key]: {
+					shareKey: options.shareKey || key,
+					shareScope: options.shareScope,
+					version: options.version,
+					eager: options.eager
+				}
+			}));
+		this._shareScope = options.shareScope;
+		this._consumes = consumes;
+		this._provides = provides;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		new ConsumeSharedPlugin({
+			shareScope: this._shareScope,
+			consumes: this._consumes
+		}).apply(compiler);
+		new ProvideSharedPlugin({
+			shareScope: this._shareScope,
+			provides: this._provides
+		}).apply(compiler);
+	}
+}
+
+module.exports = SharePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ShareRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ShareRuntimeModule.js
new file mode 100644
index 0000000..eca7252
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/ShareRuntimeModule.js
@@ -0,0 +1,141 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const {
+	compareModulesByIdentifier,
+	compareStrings
+} = require("../util/comparators");
+
+class ShareRuntimeModule extends RuntimeModule {
+	constructor() {
+		super("sharing");
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation, chunkGraph } = this;
+		const {
+			runtimeTemplate,
+			codeGenerationResults,
+			outputOptions: { uniqueName }
+		} = compilation;
+		/** @type {Map<string, Map<number, Set<string>>>} */
+		const initCodePerScope = new Map();
+		for (const chunk of this.chunk.getAllReferencedChunks()) {
+			const modules = chunkGraph.getOrderedChunkModulesIterableBySourceType(
+				chunk,
+				"share-init",
+				compareModulesByIdentifier
+			);
+			if (!modules) continue;
+			for (const m of modules) {
+				const data = codeGenerationResults.getData(
+					m,
+					chunk.runtime,
+					"share-init"
+				);
+				if (!data) continue;
+				for (const item of data) {
+					const { shareScope, initStage, init } = item;
+					let stages = initCodePerScope.get(shareScope);
+					if (stages === undefined) {
+						initCodePerScope.set(shareScope, (stages = new Map()));
+					}
+					let list = stages.get(initStage || 0);
+					if (list === undefined) {
+						stages.set(initStage || 0, (list = new Set()));
+					}
+					list.add(init);
+				}
+			}
+		}
+		return Template.asString([
+			`${RuntimeGlobals.shareScopeMap} = {};`,
+			"var initPromises = {};",
+			"var initTokens = {};",
+			`${RuntimeGlobals.initializeSharing} = ${runtimeTemplate.basicFunction(
+				"name, initScope",
+				[
+					"if(!initScope) initScope = [];",
+					"// handling circular init calls",
+					"var initToken = initTokens[name];",
+					"if(!initToken) initToken = initTokens[name] = {};",
+					"if(initScope.indexOf(initToken) >= 0) return;",
+					"initScope.push(initToken);",
+					"// only runs once",
+					"if(initPromises[name]) return initPromises[name];",
+					"// creates a new share scope if needed",
+					`if(!${RuntimeGlobals.hasOwnProperty}(${RuntimeGlobals.shareScopeMap}, name)) ${RuntimeGlobals.shareScopeMap}[name] = {};`,
+					"// runs all init snippets from all modules reachable",
+					`var scope = ${RuntimeGlobals.shareScopeMap}[name];`,
+					`var warn = ${runtimeTemplate.returningFunction(
+						'typeof console !== "undefined" && console.warn && console.warn(msg)',
+						"msg"
+					)};`,
+					`var uniqueName = ${JSON.stringify(uniqueName || undefined)};`,
+					`var register = ${runtimeTemplate.basicFunction(
+						"name, version, factory, eager",
+						[
+							"var versions = scope[name] = scope[name] || {};",
+							"var activeVersion = versions[version];",
+							"if(!activeVersion || (!activeVersion.loaded && (!eager != !activeVersion.eager ? eager : uniqueName > activeVersion.from))) versions[version] = { get: factory, from: uniqueName, eager: !!eager };"
+						]
+					)};`,
+					`var initExternal = ${runtimeTemplate.basicFunction("id", [
+						`var handleError = ${runtimeTemplate.expressionFunction(
+							'warn("Initialization of sharing external failed: " + err)',
+							"err"
+						)};`,
+						"try {",
+						Template.indent([
+							"var module = __webpack_require__(id);",
+							"if(!module) return;",
+							`var initFn = ${runtimeTemplate.returningFunction(
+								`module && module.init && module.init(${RuntimeGlobals.shareScopeMap}[name], initScope)`,
+								"module"
+							)}`,
+							"if(module.then) return promises.push(module.then(initFn, handleError));",
+							"var initResult = initFn(module);",
+							"if(initResult && initResult.then) return promises.push(initResult['catch'](handleError));"
+						]),
+						"} catch(err) { handleError(err); }"
+					])}`,
+					"var promises = [];",
+					"switch(name) {",
+					...Array.from(initCodePerScope)
+						.sort(([a], [b]) => compareStrings(a, b))
+						.map(([name, stages]) =>
+							Template.indent([
+								`case ${JSON.stringify(name)}: {`,
+								Template.indent(
+									Array.from(stages)
+										.sort(([a], [b]) => a - b)
+										.map(([, initCode]) =>
+											Template.asString(Array.from(initCode))
+										)
+								),
+								"}",
+								"break;"
+							])
+						),
+					"}",
+					"if(!promises.length) return initPromises[name] = 1;",
+					`return initPromises[name] = Promise.all(promises).then(${runtimeTemplate.returningFunction(
+						"initPromises[name] = 1"
+					)});`
+				]
+			)};`
+		]);
+	}
+}
+
+module.exports = ShareRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/resolveMatchedConfigs.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/resolveMatchedConfigs.js
new file mode 100644
index 0000000..69f1d96
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/resolveMatchedConfigs.js
@@ -0,0 +1,91 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ModuleNotFoundError = require("../ModuleNotFoundError");
+const LazySet = require("../util/LazySet");
+
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../ResolverFactory").ResolveOptionsWithDependencyType} ResolveOptionsWithDependencyType */
+
+/**
+ * @template T
+ * @typedef {Object} MatchedConfigs
+ * @property {Map<string, T>} resolved
+ * @property {Map<string, T>} unresolved
+ * @property {Map<string, T>} prefixed
+ */
+
+/** @type {ResolveOptionsWithDependencyType} */
+const RESOLVE_OPTIONS = { dependencyType: "esm" };
+
+/**
+ * @template T
+ * @param {Compilation} compilation the compilation
+ * @param {[string, T][]} configs to be processed configs
+ * @returns {Promise<MatchedConfigs<T>>} resolved matchers
+ */
+exports.resolveMatchedConfigs = (compilation, configs) => {
+	/** @type {Map<string, T>} */
+	const resolved = new Map();
+	/** @type {Map<string, T>} */
+	const unresolved = new Map();
+	/** @type {Map<string, T>} */
+	const prefixed = new Map();
+	const resolveContext = {
+		/** @type {LazySet<string>} */
+		fileDependencies: new LazySet(),
+		/** @type {LazySet<string>} */
+		contextDependencies: new LazySet(),
+		/** @type {LazySet<string>} */
+		missingDependencies: new LazySet()
+	};
+	const resolver = compilation.resolverFactory.get("normal", RESOLVE_OPTIONS);
+	const context = compilation.compiler.context;
+
+	return Promise.all(
+		configs.map(([request, config]) => {
+			if (/^\.\.?(\/|$)/.test(request)) {
+				// relative request
+				return new Promise(resolve => {
+					resolver.resolve(
+						{},
+						context,
+						request,
+						resolveContext,
+						(err, result) => {
+							if (err || result === false) {
+								err = err || new Error(`Can't resolve ${request}`);
+								compilation.errors.push(
+									new ModuleNotFoundError(null, err, {
+										name: `shared module ${request}`
+									})
+								);
+								return resolve();
+							}
+							resolved.set(result, config);
+							resolve();
+						}
+					);
+				});
+			} else if (/^(\/|[A-Za-z]:\\|\\\\)/.test(request)) {
+				// absolute path
+				resolved.set(request, config);
+			} else if (request.endsWith("/")) {
+				// module request prefix
+				prefixed.set(request, config);
+			} else {
+				// module request
+				unresolved.set(request, config);
+			}
+		})
+	).then(() => {
+		compilation.contextDependencies.addAll(resolveContext.contextDependencies);
+		compilation.fileDependencies.addAll(resolveContext.fileDependencies);
+		compilation.missingDependencies.addAll(resolveContext.missingDependencies);
+		return { resolved, unresolved, prefixed };
+	});
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/utils.js b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/utils.js
new file mode 100644
index 0000000..aefe6f0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/sharing/utils.js
@@ -0,0 +1,90 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { join, dirname, readJson } = require("../util/fs");
+
+/** @typedef {import("../util/fs").InputFileSystem} InputFileSystem */
+
+/**
+ * @param {string} str maybe required version
+ * @returns {boolean} true, if it looks like a version
+ */
+exports.isRequiredVersion = str => {
+	return /^([\d^=v<>~]|[*xX]$)/.test(str);
+};
+
+/**
+ *
+ * @param {InputFileSystem} fs file system
+ * @param {string} directory directory to start looking into
+ * @param {string[]} descriptionFiles possible description filenames
+ * @param {function((Error | null)=, {data: object, path: string}=): void} callback callback
+ */
+const getDescriptionFile = (fs, directory, descriptionFiles, callback) => {
+	let i = 0;
+	const tryLoadCurrent = () => {
+		if (i >= descriptionFiles.length) {
+			const parentDirectory = dirname(fs, directory);
+			if (!parentDirectory || parentDirectory === directory) return callback();
+			return getDescriptionFile(
+				fs,
+				parentDirectory,
+				descriptionFiles,
+				callback
+			);
+		}
+		const filePath = join(fs, directory, descriptionFiles[i]);
+		readJson(fs, filePath, (err, data) => {
+			if (err) {
+				if ("code" in err && err.code === "ENOENT") {
+					i++;
+					return tryLoadCurrent();
+				}
+				return callback(err);
+			}
+			if (!data || typeof data !== "object" || Array.isArray(data)) {
+				return callback(
+					new Error(`Description file ${filePath} is not an object`)
+				);
+			}
+			callback(null, { data, path: filePath });
+		});
+	};
+	tryLoadCurrent();
+};
+exports.getDescriptionFile = getDescriptionFile;
+
+exports.getRequiredVersionFromDescriptionFile = (data, packageName) => {
+	if (
+		data.optionalDependencies &&
+		typeof data.optionalDependencies === "object" &&
+		packageName in data.optionalDependencies
+	) {
+		return data.optionalDependencies[packageName];
+	}
+	if (
+		data.dependencies &&
+		typeof data.dependencies === "object" &&
+		packageName in data.dependencies
+	) {
+		return data.dependencies[packageName];
+	}
+	if (
+		data.peerDependencies &&
+		typeof data.peerDependencies === "object" &&
+		packageName in data.peerDependencies
+	) {
+		return data.peerDependencies[packageName];
+	}
+	if (
+		data.devDependencies &&
+		typeof data.devDependencies === "object" &&
+		packageName in data.devDependencies
+	) {
+		return data.devDependencies[packageName];
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsFactoryPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsFactoryPlugin.js
new file mode 100644
index 0000000..b99ce17
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsFactoryPlugin.js
@@ -0,0 +1,2398 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const ModuleDependency = require("../dependencies/ModuleDependency");
+const formatLocation = require("../formatLocation");
+const { LogType } = require("../logging/Logger");
+const AggressiveSplittingPlugin = require("../optimize/AggressiveSplittingPlugin");
+const SizeLimitsPlugin = require("../performance/SizeLimitsPlugin");
+const { countIterable } = require("../util/IterableHelpers");
+const {
+	compareLocations,
+	compareChunksById,
+	compareNumbers,
+	compareIds,
+	concatComparators,
+	compareSelect,
+	compareModulesByIdentifier
+} = require("../util/comparators");
+const { makePathsRelative, parseResource } = require("../util/identifier");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../ChunkGroup").OriginRecord} OriginRecord */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compilation").Asset} Asset */
+/** @typedef {import("../Compilation").AssetInfo} AssetInfo */
+/** @typedef {import("../Compilation").NormalizedStatsOptions} NormalizedStatsOptions */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraphConnection")} ModuleGraphConnection */
+/** @typedef {import("../ModuleProfile")} ModuleProfile */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @template T @typedef {import("../util/comparators").Comparator<T>} Comparator<T> */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+/** @typedef {import("../util/smartGrouping").GroupConfig<any, object>} GroupConfig */
+/** @typedef {import("./StatsFactory")} StatsFactory */
+/** @typedef {import("./StatsFactory").StatsFactoryContext} StatsFactoryContext */
+
+/** @typedef {KnownStatsCompilation & Record<string, any>} StatsCompilation */
+/**
+ * @typedef {Object} KnownStatsCompilation
+ * @property {any=} env
+ * @property {string=} name
+ * @property {string=} hash
+ * @property {string=} version
+ * @property {number=} time
+ * @property {number=} builtAt
+ * @property {boolean=} needAdditionalPass
+ * @property {string=} publicPath
+ * @property {string=} outputPath
+ * @property {Record<string, string[]>=} assetsByChunkName
+ * @property {StatsAsset[]=} assets
+ * @property {number=} filteredAssets
+ * @property {StatsChunk[]=} chunks
+ * @property {StatsModule[]=} modules
+ * @property {number=} filteredModules
+ * @property {Record<string, StatsChunkGroup>=} entrypoints
+ * @property {Record<string, StatsChunkGroup>=} namedChunkGroups
+ * @property {StatsError[]=} errors
+ * @property {number=} errorsCount
+ * @property {StatsError[]=} warnings
+ * @property {number=} warningsCount
+ * @property {StatsCompilation[]=} children
+ * @property {Record<string, StatsLogging>=} logging
+ */
+
+/** @typedef {KnownStatsLogging & Record<string, any>} StatsLogging */
+/**
+ * @typedef {Object} KnownStatsLogging
+ * @property {StatsLoggingEntry[]} entries
+ * @property {number} filteredEntries
+ * @property {boolean} debug
+ */
+
+/** @typedef {KnownStatsLoggingEntry & Record<string, any>} StatsLoggingEntry */
+/**
+ * @typedef {Object} KnownStatsLoggingEntry
+ * @property {string} type
+ * @property {string} message
+ * @property {string[]=} trace
+ * @property {StatsLoggingEntry[]=} children
+ * @property {any[]=} args
+ * @property {number=} time
+ */
+
+/** @typedef {KnownStatsAsset & Record<string, any>} StatsAsset */
+/**
+ * @typedef {Object} KnownStatsAsset
+ * @property {string} type
+ * @property {string} name
+ * @property {AssetInfo} info
+ * @property {number} size
+ * @property {boolean} emitted
+ * @property {boolean} comparedForEmit
+ * @property {boolean} cached
+ * @property {StatsAsset[]=} related
+ * @property {(string|number)[]=} chunkNames
+ * @property {(string|number)[]=} chunkIdHints
+ * @property {(string|number)[]=} chunks
+ * @property {(string|number)[]=} auxiliaryChunkNames
+ * @property {(string|number)[]=} auxiliaryChunks
+ * @property {(string|number)[]=} auxiliaryChunkIdHints
+ * @property {number=} filteredRelated
+ * @property {boolean=} isOverSizeLimit
+ */
+
+/** @typedef {KnownStatsChunkGroup & Record<string, any>} StatsChunkGroup */
+/**
+ * @typedef {Object} KnownStatsChunkGroup
+ * @property {string=} name
+ * @property {(string|number)[]=} chunks
+ * @property {({ name: string, size?: number })[]=} assets
+ * @property {number=} filteredAssets
+ * @property {number=} assetsSize
+ * @property {({ name: string, size?: number })[]=} auxiliaryAssets
+ * @property {number=} filteredAuxiliaryAssets
+ * @property {number=} auxiliaryAssetsSize
+ * @property {{ [x: string]: StatsChunkGroup[] }=} children
+ * @property {{ [x: string]: string[] }=} childAssets
+ * @property {boolean=} isOverSizeLimit
+ */
+
+/** @typedef {KnownStatsModule & Record<string, any>} StatsModule */
+/**
+ * @typedef {Object} KnownStatsModule
+ * @property {string=} type
+ * @property {string=} moduleType
+ * @property {string=} layer
+ * @property {string=} identifier
+ * @property {string=} name
+ * @property {string=} nameForCondition
+ * @property {number=} index
+ * @property {number=} preOrderIndex
+ * @property {number=} index2
+ * @property {number=} postOrderIndex
+ * @property {number=} size
+ * @property {{[x: string]: number}=} sizes
+ * @property {boolean=} cacheable
+ * @property {boolean=} built
+ * @property {boolean=} codeGenerated
+ * @property {boolean=} buildTimeExecuted
+ * @property {boolean=} cached
+ * @property {boolean=} optional
+ * @property {boolean=} orphan
+ * @property {string|number=} id
+ * @property {string|number=} issuerId
+ * @property {(string|number)[]=} chunks
+ * @property {(string|number)[]=} assets
+ * @property {boolean=} dependent
+ * @property {string=} issuer
+ * @property {string=} issuerName
+ * @property {StatsModuleIssuer[]=} issuerPath
+ * @property {boolean=} failed
+ * @property {number=} errors
+ * @property {number=} warnings
+ * @property {StatsProfile=} profile
+ * @property {StatsModuleReason[]=} reasons
+ * @property {(boolean | string[])=} usedExports
+ * @property {string[]=} providedExports
+ * @property {string[]=} optimizationBailout
+ * @property {number=} depth
+ * @property {StatsModule[]=} modules
+ * @property {number=} filteredModules
+ * @property {ReturnType<Source["source"]>=} source
+ */
+
+/** @typedef {KnownStatsProfile & Record<string, any>} StatsProfile */
+/**
+ * @typedef {Object} KnownStatsProfile
+ * @property {number} total
+ * @property {number} resolving
+ * @property {number} restoring
+ * @property {number} building
+ * @property {number} integration
+ * @property {number} storing
+ * @property {number} additionalResolving
+ * @property {number} additionalIntegration
+ * @property {number} factory
+ * @property {number} dependencies
+ */
+
+/** @typedef {KnownStatsModuleIssuer & Record<string, any>} StatsModuleIssuer */
+/**
+ * @typedef {Object} KnownStatsModuleIssuer
+ * @property {string=} identifier
+ * @property {string=} name
+ * @property {(string|number)=} id
+ * @property {StatsProfile=} profile
+ */
+
+/** @typedef {KnownStatsModuleReason & Record<string, any>} StatsModuleReason */
+/**
+ * @typedef {Object} KnownStatsModuleReason
+ * @property {string=} moduleIdentifier
+ * @property {string=} module
+ * @property {string=} moduleName
+ * @property {string=} resolvedModuleIdentifier
+ * @property {string=} resolvedModule
+ * @property {string=} type
+ * @property {boolean} active
+ * @property {string=} explanation
+ * @property {string=} userRequest
+ * @property {string=} loc
+ * @property {(string|number)=} moduleId
+ * @property {(string|number)=} resolvedModuleId
+ */
+
+/** @typedef {KnownStatsChunk & Record<string, any>} StatsChunk */
+/**
+ * @typedef {Object} KnownStatsChunk
+ * @property {boolean} rendered
+ * @property {boolean} initial
+ * @property {boolean} entry
+ * @property {boolean} recorded
+ * @property {string=} reason
+ * @property {number} size
+ * @property {Record<string, number>=} sizes
+ * @property {string[]=} names
+ * @property {string[]=} idHints
+ * @property {string[]=} runtime
+ * @property {string[]=} files
+ * @property {string[]=} auxiliaryFiles
+ * @property {string} hash
+ * @property {Record<string, (string|number)[]>=} childrenByOrder
+ * @property {(string|number)=} id
+ * @property {(string|number)[]=} siblings
+ * @property {(string|number)[]=} parents
+ * @property {(string|number)[]=} children
+ * @property {StatsModule[]=} modules
+ * @property {number=} filteredModules
+ * @property {StatsChunkOrigin[]=} origins
+ */
+
+/** @typedef {KnownStatsChunkOrigin & Record<string, any>} StatsChunkOrigin */
+/**
+ * @typedef {Object} KnownStatsChunkOrigin
+ * @property {string=} module
+ * @property {string=} moduleIdentifier
+ * @property {string=} moduleName
+ * @property {string=} loc
+ * @property {string=} request
+ * @property {(string|number)=} moduleId
+ */
+
+/** @typedef {KnownStatsModuleTraceItem & Record<string, any>} StatsModuleTraceItem */
+/**
+ * @typedef {Object} KnownStatsModuleTraceItem
+ * @property {string=} originIdentifier
+ * @property {string=} originName
+ * @property {string=} moduleIdentifier
+ * @property {string=} moduleName
+ * @property {StatsModuleTraceDependency[]=} dependencies
+ * @property {(string|number)=} originId
+ * @property {(string|number)=} moduleId
+ */
+
+/** @typedef {KnownStatsModuleTraceDependency & Record<string, any>} StatsModuleTraceDependency */
+/**
+ * @typedef {Object} KnownStatsModuleTraceDependency
+ * @property {string=} loc
+ */
+
+/** @typedef {KnownStatsError & Record<string, any>} StatsError */
+/**
+ * @typedef {Object} KnownStatsError
+ * @property {string} message
+ * @property {string=} chunkName
+ * @property {boolean=} chunkEntry
+ * @property {boolean=} chunkInitial
+ * @property {string=} file
+ * @property {string=} moduleIdentifier
+ * @property {string=} moduleName
+ * @property {string=} loc
+ * @property {string|number=} chunkId
+ * @property {string|number=} moduleId
+ * @property {StatsModuleTraceItem[]=} moduleTrace
+ * @property {any=} details
+ * @property {string=} stack
+ */
+
+/** @typedef {Asset & { type: string, related: PreprocessedAsset[] }} PreprocessedAsset */
+
+/**
+ * @template T
+ * @template O
+ * @typedef {Record<string, (object: O, data: T, context: StatsFactoryContext, options: NormalizedStatsOptions, factory: StatsFactory) => void>} ExtractorsByOption
+ */
+
+/**
+ * @typedef {Object} SimpleExtractors
+ * @property {ExtractorsByOption<Compilation, StatsCompilation>} compilation
+ * @property {ExtractorsByOption<PreprocessedAsset, StatsAsset>} asset
+ * @property {ExtractorsByOption<PreprocessedAsset, StatsAsset>} asset$visible
+ * @property {ExtractorsByOption<{ name: string, chunkGroup: ChunkGroup }, StatsChunkGroup>} chunkGroup
+ * @property {ExtractorsByOption<Module, StatsModule>} module
+ * @property {ExtractorsByOption<Module, StatsModule>} module$visible
+ * @property {ExtractorsByOption<Module, StatsModuleIssuer>} moduleIssuer
+ * @property {ExtractorsByOption<ModuleProfile, StatsProfile>} profile
+ * @property {ExtractorsByOption<ModuleGraphConnection, StatsModuleReason>} moduleReason
+ * @property {ExtractorsByOption<Chunk, StatsChunk>} chunk
+ * @property {ExtractorsByOption<OriginRecord, StatsChunkOrigin>} chunkOrigin
+ * @property {ExtractorsByOption<WebpackError, StatsError>} error
+ * @property {ExtractorsByOption<WebpackError, StatsError>} warning
+ * @property {ExtractorsByOption<{ origin: Module, module: Module }, StatsModuleTraceItem>} moduleTraceItem
+ * @property {ExtractorsByOption<Dependency, StatsModuleTraceDependency>} moduleTraceDependency
+ */
+
+/**
+ * @template T
+ * @template I
+ * @param {Iterable<T>} items items to select from
+ * @param {function(T): Iterable<I>} selector selector function to select values from item
+ * @returns {I[]} array of values
+ */
+const uniqueArray = (items, selector) => {
+	/** @type {Set<I>} */
+	const set = new Set();
+	for (const item of items) {
+		for (const i of selector(item)) {
+			set.add(i);
+		}
+	}
+	return Array.from(set);
+};
+
+/**
+ * @template T
+ * @template I
+ * @param {Iterable<T>} items items to select from
+ * @param {function(T): Iterable<I>} selector selector function to select values from item
+ * @param {Comparator<I>} comparator comparator function
+ * @returns {I[]} array of values
+ */
+const uniqueOrderedArray = (items, selector, comparator) => {
+	return uniqueArray(items, selector).sort(comparator);
+};
+
+/** @template T @template R @typedef {{ [P in keyof T]: R }} MappedValues<T, R> */
+
+/**
+ * @template T
+ * @template R
+ * @param {T} obj object to be mapped
+ * @param {function(T[keyof T], keyof T): R} fn mapping function
+ * @returns {MappedValues<T, R>} mapped object
+ */
+const mapObject = (obj, fn) => {
+	const newObj = Object.create(null);
+	for (const key of Object.keys(obj)) {
+		newObj[key] = fn(obj[key], /** @type {keyof T} */ (key));
+	}
+	return newObj;
+};
+
+/**
+ * @param {Compilation} compilation the compilation
+ * @param {function(Compilation, string): any[]} getItems get items
+ * @returns {number} total number
+ */
+const countWithChildren = (compilation, getItems) => {
+	let count = getItems(compilation, "").length;
+	for (const child of compilation.children) {
+		count += countWithChildren(child, (c, type) =>
+			getItems(c, `.children[].compilation${type}`)
+		);
+	}
+	return count;
+};
+
+/** @type {ExtractorsByOption<WebpackError | string, StatsError>} */
+const EXTRACT_ERROR = {
+	_: (object, error, context, { requestShortener }) => {
+		// TODO webpack 6 disallow strings in the errors/warnings list
+		if (typeof error === "string") {
+			object.message = error;
+		} else {
+			if (error.chunk) {
+				object.chunkName = error.chunk.name;
+				object.chunkEntry = error.chunk.hasRuntime();
+				object.chunkInitial = error.chunk.canBeInitial();
+			}
+			if (error.file) {
+				object.file = error.file;
+			}
+			if (error.module) {
+				object.moduleIdentifier = error.module.identifier();
+				object.moduleName = error.module.readableIdentifier(requestShortener);
+			}
+			if (error.loc) {
+				object.loc = formatLocation(error.loc);
+			}
+			object.message = error.message;
+		}
+	},
+	ids: (object, error, { compilation: { chunkGraph } }) => {
+		if (typeof error !== "string") {
+			if (error.chunk) {
+				object.chunkId = error.chunk.id;
+			}
+			if (error.module) {
+				object.moduleId = chunkGraph.getModuleId(error.module);
+			}
+		}
+	},
+	moduleTrace: (object, error, context, options, factory) => {
+		if (typeof error !== "string" && error.module) {
+			const {
+				type,
+				compilation: { moduleGraph }
+			} = context;
+			/** @type {Set<Module>} */
+			const visitedModules = new Set();
+			const moduleTrace = [];
+			let current = error.module;
+			while (current) {
+				if (visitedModules.has(current)) break; // circular (technically impossible, but how knows)
+				visitedModules.add(current);
+				const origin = moduleGraph.getIssuer(current);
+				if (!origin) break;
+				moduleTrace.push({ origin, module: current });
+				current = origin;
+			}
+			object.moduleTrace = factory.create(
+				`${type}.moduleTrace`,
+				moduleTrace,
+				context
+			);
+		}
+	},
+	errorDetails: (
+		object,
+		error,
+		{ type, compilation, cachedGetErrors, cachedGetWarnings },
+		{ errorDetails }
+	) => {
+		if (
+			typeof error !== "string" &&
+			(errorDetails === true ||
+				(type.endsWith(".error") && cachedGetErrors(compilation).length < 3))
+		) {
+			object.details = error.details;
+		}
+	},
+	errorStack: (object, error) => {
+		if (typeof error !== "string") {
+			object.stack = error.stack;
+		}
+	}
+};
+
+/** @type {SimpleExtractors} */
+const SIMPLE_EXTRACTORS = {
+	compilation: {
+		_: (object, compilation, context, options) => {
+			if (!context.makePathsRelative) {
+				context.makePathsRelative = makePathsRelative.bindContextCache(
+					compilation.compiler.context,
+					compilation.compiler.root
+				);
+			}
+			if (!context.cachedGetErrors) {
+				const map = new WeakMap();
+				context.cachedGetErrors = compilation => {
+					return (
+						map.get(compilation) ||
+						(errors => (map.set(compilation, errors), errors))(
+							compilation.getErrors()
+						)
+					);
+				};
+			}
+			if (!context.cachedGetWarnings) {
+				const map = new WeakMap();
+				context.cachedGetWarnings = compilation => {
+					return (
+						map.get(compilation) ||
+						(warnings => (map.set(compilation, warnings), warnings))(
+							compilation.getWarnings()
+						)
+					);
+				};
+			}
+			if (compilation.name) {
+				object.name = compilation.name;
+			}
+			if (compilation.needAdditionalPass) {
+				object.needAdditionalPass = true;
+			}
+
+			const { logging, loggingDebug, loggingTrace } = options;
+			if (logging || (loggingDebug && loggingDebug.length > 0)) {
+				const util = require("util");
+				object.logging = {};
+				let acceptedTypes;
+				let collapsedGroups = false;
+				switch (logging) {
+					default:
+						acceptedTypes = new Set();
+						break;
+					case "error":
+						acceptedTypes = new Set([LogType.error]);
+						break;
+					case "warn":
+						acceptedTypes = new Set([LogType.error, LogType.warn]);
+						break;
+					case "info":
+						acceptedTypes = new Set([
+							LogType.error,
+							LogType.warn,
+							LogType.info
+						]);
+						break;
+					case "log":
+						acceptedTypes = new Set([
+							LogType.error,
+							LogType.warn,
+							LogType.info,
+							LogType.log,
+							LogType.group,
+							LogType.groupEnd,
+							LogType.groupCollapsed,
+							LogType.clear
+						]);
+						break;
+					case "verbose":
+						acceptedTypes = new Set([
+							LogType.error,
+							LogType.warn,
+							LogType.info,
+							LogType.log,
+							LogType.group,
+							LogType.groupEnd,
+							LogType.groupCollapsed,
+							LogType.profile,
+							LogType.profileEnd,
+							LogType.time,
+							LogType.status,
+							LogType.clear
+						]);
+						collapsedGroups = true;
+						break;
+				}
+				const cachedMakePathsRelative = makePathsRelative.bindContextCache(
+					options.context,
+					compilation.compiler.root
+				);
+				let depthInCollapsedGroup = 0;
+				for (const [origin, logEntries] of compilation.logging) {
+					const debugMode = loggingDebug.some(fn => fn(origin));
+					if (logging === false && !debugMode) continue;
+					/** @type {KnownStatsLoggingEntry[]} */
+					const groupStack = [];
+					/** @type {KnownStatsLoggingEntry[]} */
+					const rootList = [];
+					let currentList = rootList;
+					let processedLogEntries = 0;
+					for (const entry of logEntries) {
+						let type = entry.type;
+						if (!debugMode && !acceptedTypes.has(type)) continue;
+
+						// Expand groups in verbose and debug modes
+						if (
+							type === LogType.groupCollapsed &&
+							(debugMode || collapsedGroups)
+						)
+							type = LogType.group;
+
+						if (depthInCollapsedGroup === 0) {
+							processedLogEntries++;
+						}
+
+						if (type === LogType.groupEnd) {
+							groupStack.pop();
+							if (groupStack.length > 0) {
+								currentList = groupStack[groupStack.length - 1].children;
+							} else {
+								currentList = rootList;
+							}
+							if (depthInCollapsedGroup > 0) depthInCollapsedGroup--;
+							continue;
+						}
+						let message = undefined;
+						if (entry.type === LogType.time) {
+							message = `${entry.args[0]}: ${
+								entry.args[1] * 1000 + entry.args[2] / 1000000
+							} ms`;
+						} else if (entry.args && entry.args.length > 0) {
+							message = util.format(entry.args[0], ...entry.args.slice(1));
+						}
+						/** @type {KnownStatsLoggingEntry} */
+						const newEntry = {
+							...entry,
+							type,
+							message,
+							trace: loggingTrace ? entry.trace : undefined,
+							children:
+								type === LogType.group || type === LogType.groupCollapsed
+									? []
+									: undefined
+						};
+						currentList.push(newEntry);
+						if (newEntry.children) {
+							groupStack.push(newEntry);
+							currentList = newEntry.children;
+							if (depthInCollapsedGroup > 0) {
+								depthInCollapsedGroup++;
+							} else if (type === LogType.groupCollapsed) {
+								depthInCollapsedGroup = 1;
+							}
+						}
+					}
+					let name = cachedMakePathsRelative(origin).replace(/\|/g, " ");
+					if (name in object.logging) {
+						let i = 1;
+						while (`${name}#${i}` in object.logging) {
+							i++;
+						}
+						name = `${name}#${i}`;
+					}
+					object.logging[name] = {
+						entries: rootList,
+						filteredEntries: logEntries.length - processedLogEntries,
+						debug: debugMode
+					};
+				}
+			}
+		},
+		hash: (object, compilation) => {
+			object.hash = compilation.hash;
+		},
+		version: object => {
+			object.version = require("../../package.json").version;
+		},
+		env: (object, compilation, context, { _env }) => {
+			object.env = _env;
+		},
+		timings: (object, compilation) => {
+			object.time = compilation.endTime - compilation.startTime;
+		},
+		builtAt: (object, compilation) => {
+			object.builtAt = compilation.endTime;
+		},
+		publicPath: (object, compilation) => {
+			object.publicPath = compilation.getPath(
+				compilation.outputOptions.publicPath
+			);
+		},
+		outputPath: (object, compilation) => {
+			object.outputPath = compilation.outputOptions.path;
+		},
+		assets: (object, compilation, context, options, factory) => {
+			const { type } = context;
+			/** @type {Map<string, Chunk[]>} */
+			const compilationFileToChunks = new Map();
+			/** @type {Map<string, Chunk[]>} */
+			const compilationAuxiliaryFileToChunks = new Map();
+			for (const chunk of compilation.chunks) {
+				for (const file of chunk.files) {
+					let array = compilationFileToChunks.get(file);
+					if (array === undefined) {
+						array = [];
+						compilationFileToChunks.set(file, array);
+					}
+					array.push(chunk);
+				}
+				for (const file of chunk.auxiliaryFiles) {
+					let array = compilationAuxiliaryFileToChunks.get(file);
+					if (array === undefined) {
+						array = [];
+						compilationAuxiliaryFileToChunks.set(file, array);
+					}
+					array.push(chunk);
+				}
+			}
+			/** @type {Map<string, PreprocessedAsset>} */
+			const assetMap = new Map();
+			/** @type {Set<PreprocessedAsset>} */
+			const assets = new Set();
+			for (const asset of compilation.getAssets()) {
+				/** @type {PreprocessedAsset} */
+				const item = {
+					...asset,
+					type: "asset",
+					related: undefined
+				};
+				assets.add(item);
+				assetMap.set(asset.name, item);
+			}
+			for (const item of assetMap.values()) {
+				const related = item.info.related;
+				if (!related) continue;
+				for (const type of Object.keys(related)) {
+					const relatedEntry = related[type];
+					const deps = Array.isArray(relatedEntry)
+						? relatedEntry
+						: [relatedEntry];
+					for (const dep of deps) {
+						const depItem = assetMap.get(dep);
+						if (!depItem) continue;
+						assets.delete(depItem);
+						depItem.type = type;
+						item.related = item.related || [];
+						item.related.push(depItem);
+					}
+				}
+			}
+
+			object.assetsByChunkName = {};
+			for (const [file, chunks] of compilationFileToChunks) {
+				for (const chunk of chunks) {
+					const name = chunk.name;
+					if (!name) continue;
+					if (
+						!Object.prototype.hasOwnProperty.call(
+							object.assetsByChunkName,
+							name
+						)
+					) {
+						object.assetsByChunkName[name] = [];
+					}
+					object.assetsByChunkName[name].push(file);
+				}
+			}
+
+			const groupedAssets = factory.create(
+				`${type}.assets`,
+				Array.from(assets),
+				{
+					...context,
+					compilationFileToChunks,
+					compilationAuxiliaryFileToChunks
+				}
+			);
+			const limited = spaceLimited(groupedAssets, options.assetsSpace);
+			object.assets = limited.children;
+			object.filteredAssets = limited.filteredChildren;
+		},
+		chunks: (object, compilation, context, options, factory) => {
+			const { type } = context;
+			object.chunks = factory.create(
+				`${type}.chunks`,
+				Array.from(compilation.chunks),
+				context
+			);
+		},
+		modules: (object, compilation, context, options, factory) => {
+			const { type } = context;
+			const array = Array.from(compilation.modules);
+			const groupedModules = factory.create(`${type}.modules`, array, context);
+			const limited = spaceLimited(groupedModules, options.modulesSpace);
+			object.modules = limited.children;
+			object.filteredModules = limited.filteredChildren;
+		},
+		entrypoints: (
+			object,
+			compilation,
+			context,
+			{ entrypoints, chunkGroups, chunkGroupAuxiliary, chunkGroupChildren },
+			factory
+		) => {
+			const { type } = context;
+			const array = Array.from(compilation.entrypoints, ([key, value]) => ({
+				name: key,
+				chunkGroup: value
+			}));
+			if (entrypoints === "auto" && !chunkGroups) {
+				if (array.length > 5) return;
+				if (
+					!chunkGroupChildren &&
+					array.every(({ chunkGroup }) => {
+						if (chunkGroup.chunks.length !== 1) return false;
+						const chunk = chunkGroup.chunks[0];
+						return (
+							chunk.files.size === 1 &&
+							(!chunkGroupAuxiliary || chunk.auxiliaryFiles.size === 0)
+						);
+					})
+				) {
+					return;
+				}
+			}
+			object.entrypoints = factory.create(
+				`${type}.entrypoints`,
+				array,
+				context
+			);
+		},
+		chunkGroups: (object, compilation, context, options, factory) => {
+			const { type } = context;
+			const array = Array.from(
+				compilation.namedChunkGroups,
+				([key, value]) => ({
+					name: key,
+					chunkGroup: value
+				})
+			);
+			object.namedChunkGroups = factory.create(
+				`${type}.namedChunkGroups`,
+				array,
+				context
+			);
+		},
+		errors: (object, compilation, context, options, factory) => {
+			const { type, cachedGetErrors } = context;
+			object.errors = factory.create(
+				`${type}.errors`,
+				cachedGetErrors(compilation),
+				context
+			);
+		},
+		errorsCount: (object, compilation, { cachedGetErrors }) => {
+			object.errorsCount = countWithChildren(compilation, c =>
+				cachedGetErrors(c)
+			);
+		},
+		warnings: (object, compilation, context, options, factory) => {
+			const { type, cachedGetWarnings } = context;
+			object.warnings = factory.create(
+				`${type}.warnings`,
+				cachedGetWarnings(compilation),
+				context
+			);
+		},
+		warningsCount: (
+			object,
+			compilation,
+			context,
+			{ warningsFilter },
+			factory
+		) => {
+			const { type, cachedGetWarnings } = context;
+			object.warningsCount = countWithChildren(compilation, (c, childType) => {
+				if (!warningsFilter && warningsFilter.length === 0)
+					return cachedGetWarnings(c);
+				return factory
+					.create(`${type}${childType}.warnings`, cachedGetWarnings(c), context)
+					.filter(warning => {
+						const warningString = Object.keys(warning)
+							.map(key => `${warning[key]}`)
+							.join("\n");
+						return !warningsFilter.some(filter =>
+							filter(warning, warningString)
+						);
+					});
+			});
+		},
+		errorDetails: (
+			object,
+			compilation,
+			{ cachedGetErrors, cachedGetWarnings },
+			{ errorDetails, errors, warnings }
+		) => {
+			if (errorDetails === "auto") {
+				if (warnings) {
+					const warnings = cachedGetWarnings(compilation);
+					object.filteredWarningDetailsCount = warnings
+						.map(e => typeof e !== "string" && e.details)
+						.filter(Boolean).length;
+				}
+				if (errors) {
+					const errors = cachedGetErrors(compilation);
+					if (errors.length >= 3) {
+						object.filteredErrorDetailsCount = errors
+							.map(e => typeof e !== "string" && e.details)
+							.filter(Boolean).length;
+					}
+				}
+			}
+		},
+		children: (object, compilation, context, options, factory) => {
+			const { type } = context;
+			object.children = factory.create(
+				`${type}.children`,
+				compilation.children,
+				context
+			);
+		}
+	},
+	asset: {
+		_: (object, asset, context, options, factory) => {
+			const { compilation } = context;
+			object.type = asset.type;
+			object.name = asset.name;
+			object.size = asset.source.size();
+			object.emitted = compilation.emittedAssets.has(asset.name);
+			object.comparedForEmit = compilation.comparedForEmitAssets.has(
+				asset.name
+			);
+			const cached = !object.emitted && !object.comparedForEmit;
+			object.cached = cached;
+			object.info = asset.info;
+			if (!cached || options.cachedAssets) {
+				Object.assign(
+					object,
+					factory.create(`${context.type}$visible`, asset, context)
+				);
+			}
+		}
+	},
+	asset$visible: {
+		_: (
+			object,
+			asset,
+			{ compilation, compilationFileToChunks, compilationAuxiliaryFileToChunks }
+		) => {
+			const chunks = compilationFileToChunks.get(asset.name) || [];
+			const auxiliaryChunks =
+				compilationAuxiliaryFileToChunks.get(asset.name) || [];
+			object.chunkNames = uniqueOrderedArray(
+				chunks,
+				c => (c.name ? [c.name] : []),
+				compareIds
+			);
+			object.chunkIdHints = uniqueOrderedArray(
+				chunks,
+				c => Array.from(c.idNameHints),
+				compareIds
+			);
+			object.auxiliaryChunkNames = uniqueOrderedArray(
+				auxiliaryChunks,
+				c => (c.name ? [c.name] : []),
+				compareIds
+			);
+			object.auxiliaryChunkIdHints = uniqueOrderedArray(
+				auxiliaryChunks,
+				c => Array.from(c.idNameHints),
+				compareIds
+			);
+			object.filteredRelated = asset.related ? asset.related.length : undefined;
+		},
+		relatedAssets: (object, asset, context, options, factory) => {
+			const { type } = context;
+			object.related = factory.create(
+				`${type.slice(0, -8)}.related`,
+				asset.related,
+				context
+			);
+			object.filteredRelated = asset.related
+				? asset.related.length - object.related.length
+				: undefined;
+		},
+		ids: (
+			object,
+			asset,
+			{ compilationFileToChunks, compilationAuxiliaryFileToChunks }
+		) => {
+			const chunks = compilationFileToChunks.get(asset.name) || [];
+			const auxiliaryChunks =
+				compilationAuxiliaryFileToChunks.get(asset.name) || [];
+			object.chunks = uniqueOrderedArray(chunks, c => c.ids, compareIds);
+			object.auxiliaryChunks = uniqueOrderedArray(
+				auxiliaryChunks,
+				c => c.ids,
+				compareIds
+			);
+		},
+		performance: (object, asset) => {
+			object.isOverSizeLimit = SizeLimitsPlugin.isOverSizeLimit(asset.source);
+		}
+	},
+	chunkGroup: {
+		_: (
+			object,
+			{ name, chunkGroup },
+			{ compilation, compilation: { moduleGraph, chunkGraph } },
+			{ ids, chunkGroupAuxiliary, chunkGroupChildren, chunkGroupMaxAssets }
+		) => {
+			const children =
+				chunkGroupChildren &&
+				chunkGroup.getChildrenByOrders(moduleGraph, chunkGraph);
+			/**
+			 * @param {string} name Name
+			 * @returns {{ name: string, size: number }} Asset object
+			 */
+			const toAsset = name => {
+				const asset = compilation.getAsset(name);
+				return {
+					name,
+					size: asset ? asset.info.size : -1
+				};
+			};
+			/** @type {(total: number, asset: { size: number }) => number} */
+			const sizeReducer = (total, { size }) => total + size;
+			const assets = uniqueArray(chunkGroup.chunks, c => c.files).map(toAsset);
+			const auxiliaryAssets = uniqueOrderedArray(
+				chunkGroup.chunks,
+				c => c.auxiliaryFiles,
+				compareIds
+			).map(toAsset);
+			const assetsSize = assets.reduce(sizeReducer, 0);
+			const auxiliaryAssetsSize = auxiliaryAssets.reduce(sizeReducer, 0);
+			/** @type {KnownStatsChunkGroup} */
+			const statsChunkGroup = {
+				name,
+				chunks: ids ? chunkGroup.chunks.map(c => c.id) : undefined,
+				assets: assets.length <= chunkGroupMaxAssets ? assets : undefined,
+				filteredAssets:
+					assets.length <= chunkGroupMaxAssets ? 0 : assets.length,
+				assetsSize,
+				auxiliaryAssets:
+					chunkGroupAuxiliary && auxiliaryAssets.length <= chunkGroupMaxAssets
+						? auxiliaryAssets
+						: undefined,
+				filteredAuxiliaryAssets:
+					chunkGroupAuxiliary && auxiliaryAssets.length <= chunkGroupMaxAssets
+						? 0
+						: auxiliaryAssets.length,
+				auxiliaryAssetsSize,
+				children: children
+					? mapObject(children, groups =>
+							groups.map(group => {
+								const assets = uniqueArray(group.chunks, c => c.files).map(
+									toAsset
+								);
+								const auxiliaryAssets = uniqueOrderedArray(
+									group.chunks,
+									c => c.auxiliaryFiles,
+									compareIds
+								).map(toAsset);
+
+								/** @type {KnownStatsChunkGroup} */
+								const childStatsChunkGroup = {
+									name: group.name,
+									chunks: ids ? group.chunks.map(c => c.id) : undefined,
+									assets:
+										assets.length <= chunkGroupMaxAssets ? assets : undefined,
+									filteredAssets:
+										assets.length <= chunkGroupMaxAssets ? 0 : assets.length,
+									auxiliaryAssets:
+										chunkGroupAuxiliary &&
+										auxiliaryAssets.length <= chunkGroupMaxAssets
+											? auxiliaryAssets
+											: undefined,
+									filteredAuxiliaryAssets:
+										chunkGroupAuxiliary &&
+										auxiliaryAssets.length <= chunkGroupMaxAssets
+											? 0
+											: auxiliaryAssets.length
+								};
+
+								return childStatsChunkGroup;
+							})
+					  )
+					: undefined,
+				childAssets: children
+					? mapObject(children, groups => {
+							/** @type {Set<string>} */
+							const set = new Set();
+							for (const group of groups) {
+								for (const chunk of group.chunks) {
+									for (const asset of chunk.files) {
+										set.add(asset);
+									}
+								}
+							}
+							return Array.from(set);
+					  })
+					: undefined
+			};
+			Object.assign(object, statsChunkGroup);
+		},
+		performance: (object, { chunkGroup }) => {
+			object.isOverSizeLimit = SizeLimitsPlugin.isOverSizeLimit(chunkGroup);
+		}
+	},
+	module: {
+		_: (object, module, context, options, factory) => {
+			const { compilation, type } = context;
+			const built = compilation.builtModules.has(module);
+			const codeGenerated = compilation.codeGeneratedModules.has(module);
+			const buildTimeExecuted =
+				compilation.buildTimeExecutedModules.has(module);
+			/** @type {{[x: string]: number}} */
+			const sizes = {};
+			for (const sourceType of module.getSourceTypes()) {
+				sizes[sourceType] = module.size(sourceType);
+			}
+			/** @type {KnownStatsModule} */
+			const statsModule = {
+				type: "module",
+				moduleType: module.type,
+				layer: module.layer,
+				size: module.size(),
+				sizes,
+				built,
+				codeGenerated,
+				buildTimeExecuted,
+				cached: !built && !codeGenerated
+			};
+			Object.assign(object, statsModule);
+
+			if (built || codeGenerated || options.cachedModules) {
+				Object.assign(
+					object,
+					factory.create(`${type}$visible`, module, context)
+				);
+			}
+		}
+	},
+	module$visible: {
+		_: (object, module, context, { requestShortener }, factory) => {
+			const { compilation, type, rootModules } = context;
+			const { moduleGraph } = compilation;
+			/** @type {Module[]} */
+			const path = [];
+			const issuer = moduleGraph.getIssuer(module);
+			let current = issuer;
+			while (current) {
+				path.push(current);
+				current = moduleGraph.getIssuer(current);
+			}
+			path.reverse();
+			const profile = moduleGraph.getProfile(module);
+			const errors = module.getErrors();
+			const errorsCount = errors !== undefined ? countIterable(errors) : 0;
+			const warnings = module.getWarnings();
+			const warningsCount =
+				warnings !== undefined ? countIterable(warnings) : 0;
+			/** @type {{[x: string]: number}} */
+			const sizes = {};
+			for (const sourceType of module.getSourceTypes()) {
+				sizes[sourceType] = module.size(sourceType);
+			}
+			/** @type {KnownStatsModule} */
+			const statsModule = {
+				identifier: module.identifier(),
+				name: module.readableIdentifier(requestShortener),
+				nameForCondition: module.nameForCondition(),
+				index: moduleGraph.getPreOrderIndex(module),
+				preOrderIndex: moduleGraph.getPreOrderIndex(module),
+				index2: moduleGraph.getPostOrderIndex(module),
+				postOrderIndex: moduleGraph.getPostOrderIndex(module),
+				cacheable: module.buildInfo.cacheable,
+				optional: module.isOptional(moduleGraph),
+				orphan:
+					!type.endsWith("module.modules[].module$visible") &&
+					compilation.chunkGraph.getNumberOfModuleChunks(module) === 0,
+				dependent: rootModules ? !rootModules.has(module) : undefined,
+				issuer: issuer && issuer.identifier(),
+				issuerName: issuer && issuer.readableIdentifier(requestShortener),
+				issuerPath:
+					issuer &&
+					factory.create(`${type.slice(0, -8)}.issuerPath`, path, context),
+				failed: errorsCount > 0,
+				errors: errorsCount,
+				warnings: warningsCount
+			};
+			Object.assign(object, statsModule);
+			if (profile) {
+				object.profile = factory.create(
+					`${type.slice(0, -8)}.profile`,
+					profile,
+					context
+				);
+			}
+		},
+		ids: (object, module, { compilation: { chunkGraph, moduleGraph } }) => {
+			object.id = chunkGraph.getModuleId(module);
+			const issuer = moduleGraph.getIssuer(module);
+			object.issuerId = issuer && chunkGraph.getModuleId(issuer);
+			object.chunks = Array.from(
+				chunkGraph.getOrderedModuleChunksIterable(module, compareChunksById),
+				chunk => chunk.id
+			);
+		},
+		moduleAssets: (object, module) => {
+			object.assets = module.buildInfo.assets
+				? Object.keys(module.buildInfo.assets)
+				: [];
+		},
+		reasons: (object, module, context, options, factory) => {
+			const {
+				type,
+				compilation: { moduleGraph }
+			} = context;
+			const groupsReasons = factory.create(
+				`${type.slice(0, -8)}.reasons`,
+				Array.from(moduleGraph.getIncomingConnections(module)),
+				context
+			);
+			const limited = spaceLimited(groupsReasons, options.reasonsSpace);
+			object.reasons = limited.children;
+			object.filteredReasons = limited.filteredChildren;
+		},
+		usedExports: (
+			object,
+			module,
+			{ runtime, compilation: { moduleGraph } }
+		) => {
+			const usedExports = moduleGraph.getUsedExports(module, runtime);
+			if (usedExports === null) {
+				object.usedExports = null;
+			} else if (typeof usedExports === "boolean") {
+				object.usedExports = usedExports;
+			} else {
+				object.usedExports = Array.from(usedExports);
+			}
+		},
+		providedExports: (object, module, { compilation: { moduleGraph } }) => {
+			const providedExports = moduleGraph.getProvidedExports(module);
+			object.providedExports = Array.isArray(providedExports)
+				? providedExports
+				: null;
+		},
+		optimizationBailout: (
+			object,
+			module,
+			{ compilation: { moduleGraph } },
+			{ requestShortener }
+		) => {
+			object.optimizationBailout = moduleGraph
+				.getOptimizationBailout(module)
+				.map(item => {
+					if (typeof item === "function") return item(requestShortener);
+					return item;
+				});
+		},
+		depth: (object, module, { compilation: { moduleGraph } }) => {
+			object.depth = moduleGraph.getDepth(module);
+		},
+		nestedModules: (object, module, context, options, factory) => {
+			const { type } = context;
+			const innerModules = /** @type {Module & { modules?: Module[] }} */ (
+				module
+			).modules;
+			if (Array.isArray(innerModules)) {
+				const groupedModules = factory.create(
+					`${type.slice(0, -8)}.modules`,
+					innerModules,
+					context
+				);
+				const limited = spaceLimited(
+					groupedModules,
+					options.nestedModulesSpace
+				);
+				object.modules = limited.children;
+				object.filteredModules = limited.filteredChildren;
+			}
+		},
+		source: (object, module) => {
+			const originalSource = module.originalSource();
+			if (originalSource) {
+				object.source = originalSource.source();
+			}
+		}
+	},
+	profile: {
+		_: (object, profile) => {
+			/** @type {KnownStatsProfile} */
+			const statsProfile = {
+				total:
+					profile.factory +
+					profile.restoring +
+					profile.integration +
+					profile.building +
+					profile.storing,
+				resolving: profile.factory,
+				restoring: profile.restoring,
+				building: profile.building,
+				integration: profile.integration,
+				storing: profile.storing,
+				additionalResolving: profile.additionalFactories,
+				additionalIntegration: profile.additionalIntegration,
+				// TODO remove this in webpack 6
+				factory: profile.factory,
+				// TODO remove this in webpack 6
+				dependencies: profile.additionalFactories
+			};
+			Object.assign(object, statsProfile);
+		}
+	},
+	moduleIssuer: {
+		_: (object, module, context, { requestShortener }, factory) => {
+			const { compilation, type } = context;
+			const { moduleGraph } = compilation;
+			const profile = moduleGraph.getProfile(module);
+			/** @type {KnownStatsModuleIssuer} */
+			const statsModuleIssuer = {
+				identifier: module.identifier(),
+				name: module.readableIdentifier(requestShortener)
+			};
+			Object.assign(object, statsModuleIssuer);
+			if (profile) {
+				object.profile = factory.create(`${type}.profile`, profile, context);
+			}
+		},
+		ids: (object, module, { compilation: { chunkGraph } }) => {
+			object.id = chunkGraph.getModuleId(module);
+		}
+	},
+	moduleReason: {
+		_: (object, reason, { runtime }, { requestShortener }) => {
+			const dep = reason.dependency;
+			const moduleDep =
+				dep && dep instanceof ModuleDependency ? dep : undefined;
+			/** @type {KnownStatsModuleReason} */
+			const statsModuleReason = {
+				moduleIdentifier: reason.originModule
+					? reason.originModule.identifier()
+					: null,
+				module: reason.originModule
+					? reason.originModule.readableIdentifier(requestShortener)
+					: null,
+				moduleName: reason.originModule
+					? reason.originModule.readableIdentifier(requestShortener)
+					: null,
+				resolvedModuleIdentifier: reason.resolvedOriginModule
+					? reason.resolvedOriginModule.identifier()
+					: null,
+				resolvedModule: reason.resolvedOriginModule
+					? reason.resolvedOriginModule.readableIdentifier(requestShortener)
+					: null,
+				type: reason.dependency ? reason.dependency.type : null,
+				active: reason.isActive(runtime),
+				explanation: reason.explanation,
+				userRequest: (moduleDep && moduleDep.userRequest) || null
+			};
+			Object.assign(object, statsModuleReason);
+			if (reason.dependency) {
+				const locInfo = formatLocation(reason.dependency.loc);
+				if (locInfo) {
+					object.loc = locInfo;
+				}
+			}
+		},
+		ids: (object, reason, { compilation: { chunkGraph } }) => {
+			object.moduleId = reason.originModule
+				? chunkGraph.getModuleId(reason.originModule)
+				: null;
+			object.resolvedModuleId = reason.resolvedOriginModule
+				? chunkGraph.getModuleId(reason.resolvedOriginModule)
+				: null;
+		}
+	},
+	chunk: {
+		_: (object, chunk, { makePathsRelative, compilation: { chunkGraph } }) => {
+			const childIdByOrder = chunk.getChildIdsByOrders(chunkGraph);
+
+			/** @type {KnownStatsChunk} */
+			const statsChunk = {
+				rendered: chunk.rendered,
+				initial: chunk.canBeInitial(),
+				entry: chunk.hasRuntime(),
+				recorded: AggressiveSplittingPlugin.wasChunkRecorded(chunk),
+				reason: chunk.chunkReason,
+				size: chunkGraph.getChunkModulesSize(chunk),
+				sizes: chunkGraph.getChunkModulesSizes(chunk),
+				names: chunk.name ? [chunk.name] : [],
+				idHints: Array.from(chunk.idNameHints),
+				runtime:
+					chunk.runtime === undefined
+						? undefined
+						: typeof chunk.runtime === "string"
+						? [makePathsRelative(chunk.runtime)]
+						: Array.from(chunk.runtime.sort(), makePathsRelative),
+				files: Array.from(chunk.files),
+				auxiliaryFiles: Array.from(chunk.auxiliaryFiles).sort(compareIds),
+				hash: chunk.renderedHash,
+				childrenByOrder: childIdByOrder
+			};
+			Object.assign(object, statsChunk);
+		},
+		ids: (object, chunk) => {
+			object.id = chunk.id;
+		},
+		chunkRelations: (object, chunk, { compilation: { chunkGraph } }) => {
+			/** @type {Set<string|number>} */
+			const parents = new Set();
+			/** @type {Set<string|number>} */
+			const children = new Set();
+			/** @type {Set<string|number>} */
+			const siblings = new Set();
+
+			for (const chunkGroup of chunk.groupsIterable) {
+				for (const parentGroup of chunkGroup.parentsIterable) {
+					for (const chunk of parentGroup.chunks) {
+						parents.add(chunk.id);
+					}
+				}
+				for (const childGroup of chunkGroup.childrenIterable) {
+					for (const chunk of childGroup.chunks) {
+						children.add(chunk.id);
+					}
+				}
+				for (const sibling of chunkGroup.chunks) {
+					if (sibling !== chunk) siblings.add(sibling.id);
+				}
+			}
+			object.siblings = Array.from(siblings).sort(compareIds);
+			object.parents = Array.from(parents).sort(compareIds);
+			object.children = Array.from(children).sort(compareIds);
+		},
+		chunkModules: (object, chunk, context, options, factory) => {
+			const {
+				type,
+				compilation: { chunkGraph }
+			} = context;
+			const array = chunkGraph.getChunkModules(chunk);
+			const groupedModules = factory.create(`${type}.modules`, array, {
+				...context,
+				runtime: chunk.runtime,
+				rootModules: new Set(chunkGraph.getChunkRootModules(chunk))
+			});
+			const limited = spaceLimited(groupedModules, options.chunkModulesSpace);
+			object.modules = limited.children;
+			object.filteredModules = limited.filteredChildren;
+		},
+		chunkOrigins: (object, chunk, context, options, factory) => {
+			const {
+				type,
+				compilation: { chunkGraph }
+			} = context;
+			/** @type {Set<string>} */
+			const originsKeySet = new Set();
+			const origins = [];
+			for (const g of chunk.groupsIterable) {
+				origins.push(...g.origins);
+			}
+			const array = origins.filter(origin => {
+				const key = [
+					origin.module ? chunkGraph.getModuleId(origin.module) : undefined,
+					formatLocation(origin.loc),
+					origin.request
+				].join();
+				if (originsKeySet.has(key)) return false;
+				originsKeySet.add(key);
+				return true;
+			});
+			object.origins = factory.create(`${type}.origins`, array, context);
+		}
+	},
+	chunkOrigin: {
+		_: (object, origin, context, { requestShortener }) => {
+			/** @type {KnownStatsChunkOrigin} */
+			const statsChunkOrigin = {
+				module: origin.module ? origin.module.identifier() : "",
+				moduleIdentifier: origin.module ? origin.module.identifier() : "",
+				moduleName: origin.module
+					? origin.module.readableIdentifier(requestShortener)
+					: "",
+				loc: formatLocation(origin.loc),
+				request: origin.request
+			};
+			Object.assign(object, statsChunkOrigin);
+		},
+		ids: (object, origin, { compilation: { chunkGraph } }) => {
+			object.moduleId = origin.module
+				? chunkGraph.getModuleId(origin.module)
+				: undefined;
+		}
+	},
+	error: EXTRACT_ERROR,
+	warning: EXTRACT_ERROR,
+	moduleTraceItem: {
+		_: (object, { origin, module }, context, { requestShortener }, factory) => {
+			const {
+				type,
+				compilation: { moduleGraph }
+			} = context;
+			object.originIdentifier = origin.identifier();
+			object.originName = origin.readableIdentifier(requestShortener);
+			object.moduleIdentifier = module.identifier();
+			object.moduleName = module.readableIdentifier(requestShortener);
+			const dependencies = Array.from(
+				moduleGraph.getIncomingConnections(module)
+			)
+				.filter(c => c.resolvedOriginModule === origin && c.dependency)
+				.map(c => c.dependency);
+			object.dependencies = factory.create(
+				`${type}.dependencies`,
+				Array.from(new Set(dependencies)),
+				context
+			);
+		},
+		ids: (object, { origin, module }, { compilation: { chunkGraph } }) => {
+			object.originId = chunkGraph.getModuleId(origin);
+			object.moduleId = chunkGraph.getModuleId(module);
+		}
+	},
+	moduleTraceDependency: {
+		_: (object, dependency) => {
+			object.loc = formatLocation(dependency.loc);
+		}
+	}
+};
+
+/** @type {Record<string, Record<string, (thing: any, context: StatsFactoryContext, options: NormalizedStatsOptions) => boolean | undefined>>} */
+const FILTER = {
+	"module.reasons": {
+		"!orphanModules": (reason, { compilation: { chunkGraph } }) => {
+			if (
+				reason.originModule &&
+				chunkGraph.getNumberOfModuleChunks(reason.originModule) === 0
+			) {
+				return false;
+			}
+		}
+	}
+};
+
+/** @type {Record<string, Record<string, (thing: Object, context: StatsFactoryContext, options: NormalizedStatsOptions) => boolean | undefined>>} */
+const FILTER_RESULTS = {
+	"compilation.warnings": {
+		warningsFilter: util.deprecate(
+			(warning, context, { warningsFilter }) => {
+				const warningString = Object.keys(warning)
+					.map(key => `${warning[key]}`)
+					.join("\n");
+				return !warningsFilter.some(filter => filter(warning, warningString));
+			},
+			"config.stats.warningsFilter is deprecated in favor of config.ignoreWarnings",
+			"DEP_WEBPACK_STATS_WARNINGS_FILTER"
+		)
+	}
+};
+
+/** @type {Record<string, (comparators: Function[], context: StatsFactoryContext) => void>} */
+const MODULES_SORTER = {
+	_: (comparators, { compilation: { moduleGraph } }) => {
+		comparators.push(
+			compareSelect(
+				/**
+				 * @param {Module} m module
+				 * @returns {number} depth
+				 */
+				m => moduleGraph.getDepth(m),
+				compareNumbers
+			),
+			compareSelect(
+				/**
+				 * @param {Module} m module
+				 * @returns {number} index
+				 */
+				m => moduleGraph.getPreOrderIndex(m),
+				compareNumbers
+			),
+			compareSelect(
+				/**
+				 * @param {Module} m module
+				 * @returns {string} identifier
+				 */
+				m => m.identifier(),
+				compareIds
+			)
+		);
+	}
+};
+
+/** @type {Record<string, Record<string, (comparators: Function[], context: StatsFactoryContext) => void>>} */
+const SORTERS = {
+	"compilation.chunks": {
+		_: comparators => {
+			comparators.push(compareSelect(c => c.id, compareIds));
+		}
+	},
+	"compilation.modules": MODULES_SORTER,
+	"chunk.rootModules": MODULES_SORTER,
+	"chunk.modules": MODULES_SORTER,
+	"module.modules": MODULES_SORTER,
+	"module.reasons": {
+		_: (comparators, { compilation: { chunkGraph } }) => {
+			comparators.push(
+				compareSelect(x => x.originModule, compareModulesByIdentifier)
+			);
+			comparators.push(
+				compareSelect(x => x.resolvedOriginModule, compareModulesByIdentifier)
+			);
+			comparators.push(
+				compareSelect(
+					x => x.dependency,
+					concatComparators(
+						compareSelect(
+							/**
+							 * @param {Dependency} x dependency
+							 * @returns {DependencyLocation} location
+							 */
+							x => x.loc,
+							compareLocations
+						),
+						compareSelect(x => x.type, compareIds)
+					)
+				)
+			);
+		}
+	},
+	"chunk.origins": {
+		_: (comparators, { compilation: { chunkGraph } }) => {
+			comparators.push(
+				compareSelect(
+					origin =>
+						origin.module ? chunkGraph.getModuleId(origin.module) : undefined,
+					compareIds
+				),
+				compareSelect(origin => formatLocation(origin.loc), compareIds),
+				compareSelect(origin => origin.request, compareIds)
+			);
+		}
+	}
+};
+
+const getItemSize = item => {
+	// Each item takes 1 line
+	// + the size of the children
+	// + 1 extra line when it has children and filteredChildren
+	return !item.children
+		? 1
+		: item.filteredChildren
+		? 2 + getTotalSize(item.children)
+		: 1 + getTotalSize(item.children);
+};
+
+const getTotalSize = children => {
+	let size = 0;
+	for (const child of children) {
+		size += getItemSize(child);
+	}
+	return size;
+};
+
+const getTotalItems = children => {
+	let count = 0;
+	for (const child of children) {
+		if (!child.children && !child.filteredChildren) {
+			count++;
+		} else {
+			if (child.children) count += getTotalItems(child.children);
+			if (child.filteredChildren) count += child.filteredChildren;
+		}
+	}
+	return count;
+};
+
+const collapse = children => {
+	// After collapse each child must take exactly one line
+	const newChildren = [];
+	for (const child of children) {
+		if (child.children) {
+			let filteredChildren = child.filteredChildren || 0;
+			filteredChildren += getTotalItems(child.children);
+			newChildren.push({
+				...child,
+				children: undefined,
+				filteredChildren
+			});
+		} else {
+			newChildren.push(child);
+		}
+	}
+	return newChildren;
+};
+
+const spaceLimited = (
+	itemsAndGroups,
+	max,
+	filteredChildrenLineReserved = false
+) => {
+	if (max < 1) {
+		return {
+			children: undefined,
+			filteredChildren: getTotalItems(itemsAndGroups)
+		};
+	}
+	/** @type {any[] | undefined} */
+	let children = undefined;
+	/** @type {number | undefined} */
+	let filteredChildren = undefined;
+	// This are the groups, which take 1+ lines each
+	const groups = [];
+	// The sizes of the groups are stored in groupSizes
+	const groupSizes = [];
+	// This are the items, which take 1 line each
+	const items = [];
+	// The total of group sizes
+	let groupsSize = 0;
+
+	for (const itemOrGroup of itemsAndGroups) {
+		// is item
+		if (!itemOrGroup.children && !itemOrGroup.filteredChildren) {
+			items.push(itemOrGroup);
+		} else {
+			groups.push(itemOrGroup);
+			const size = getItemSize(itemOrGroup);
+			groupSizes.push(size);
+			groupsSize += size;
+		}
+	}
+
+	if (groupsSize + items.length <= max) {
+		// The total size in the current state fits into the max
+		// keep all
+		children = groups.length > 0 ? groups.concat(items) : items;
+	} else if (groups.length === 0) {
+		// slice items to max
+		// inner space marks that lines for filteredChildren already reserved
+		const limit = max - (filteredChildrenLineReserved ? 0 : 1);
+		filteredChildren = items.length - limit;
+		items.length = limit;
+		children = items;
+	} else {
+		// limit is the size when all groups are collapsed
+		const limit =
+			groups.length +
+			(filteredChildrenLineReserved || items.length === 0 ? 0 : 1);
+		if (limit < max) {
+			// calculate how much we are over the size limit
+			// this allows to approach the limit faster
+			let oversize;
+			// If each group would take 1 line the total would be below the maximum
+			// collapse some groups, keep items
+			while (
+				(oversize =
+					groupsSize +
+					items.length +
+					(filteredChildren && !filteredChildrenLineReserved ? 1 : 0) -
+					max) > 0
+			) {
+				// Find the maximum group and process only this one
+				const maxGroupSize = Math.max(...groupSizes);
+				if (maxGroupSize < items.length) {
+					filteredChildren = items.length;
+					items.length = 0;
+					continue;
+				}
+				for (let i = 0; i < groups.length; i++) {
+					if (groupSizes[i] === maxGroupSize) {
+						const group = groups[i];
+						// run this algorithm recursively and limit the size of the children to
+						// current size - oversize / number of groups
+						// So it should always end up being smaller
+						const headerSize = group.filteredChildren ? 2 : 1;
+						const limited = spaceLimited(
+							group.children,
+							maxGroupSize -
+								// we should use ceil to always feet in max
+								Math.ceil(oversize / groups.length) -
+								// we substitute size of group head
+								headerSize,
+							headerSize === 2
+						);
+						groups[i] = {
+							...group,
+							children: limited.children,
+							filteredChildren: limited.filteredChildren
+								? (group.filteredChildren || 0) + limited.filteredChildren
+								: group.filteredChildren
+						};
+						const newSize = getItemSize(groups[i]);
+						groupsSize -= maxGroupSize - newSize;
+						groupSizes[i] = newSize;
+						break;
+					}
+				}
+			}
+			children = groups.concat(items);
+		} else if (limit === max) {
+			// If we have only enough space to show one line per group and one line for the filtered items
+			// collapse all groups and items
+			children = collapse(groups);
+			filteredChildren = items.length;
+		} else {
+			// If we have no space
+			// collapse complete group
+			filteredChildren = getTotalItems(itemsAndGroups);
+		}
+	}
+
+	return {
+		children,
+		filteredChildren
+	};
+};
+
+const assetGroup = (children, assets) => {
+	let size = 0;
+	for (const asset of children) {
+		size += asset.size;
+	}
+	return {
+		size
+	};
+};
+
+const moduleGroup = (children, modules) => {
+	let size = 0;
+	const sizes = {};
+	for (const module of children) {
+		size += module.size;
+		for (const key of Object.keys(module.sizes)) {
+			sizes[key] = (sizes[key] || 0) + module.sizes[key];
+		}
+	}
+	return {
+		size,
+		sizes
+	};
+};
+
+const reasonGroup = (children, reasons) => {
+	let active = false;
+	for (const reason of children) {
+		active = active || reason.active;
+	}
+	return {
+		active
+	};
+};
+
+const GROUP_EXTENSION_REGEXP = /(\.[^.]+?)(?:\?|(?: \+ \d+ modules?)?$)/;
+const GROUP_PATH_REGEXP = /(.+)[/\\][^/\\]+?(?:\?|(?: \+ \d+ modules?)?$)/;
+
+/** @type {Record<string, (groupConfigs: GroupConfig[], context: StatsFactoryContext, options: NormalizedStatsOptions) => void>} */
+const ASSETS_GROUPERS = {
+	_: (groupConfigs, context, options) => {
+		const groupByFlag = (name, exclude) => {
+			groupConfigs.push({
+				getKeys: asset => {
+					return asset[name] ? ["1"] : undefined;
+				},
+				getOptions: () => {
+					return {
+						groupChildren: !exclude,
+						force: exclude
+					};
+				},
+				createGroup: (key, children, assets) => {
+					return exclude
+						? {
+								type: "assets by status",
+								[name]: !!key,
+								filteredChildren: assets.length,
+								...assetGroup(children, assets)
+						  }
+						: {
+								type: "assets by status",
+								[name]: !!key,
+								children,
+								...assetGroup(children, assets)
+						  };
+				}
+			});
+		};
+		const {
+			groupAssetsByEmitStatus,
+			groupAssetsByPath,
+			groupAssetsByExtension
+		} = options;
+		if (groupAssetsByEmitStatus) {
+			groupByFlag("emitted");
+			groupByFlag("comparedForEmit");
+			groupByFlag("isOverSizeLimit");
+		}
+		if (groupAssetsByEmitStatus || !options.cachedAssets) {
+			groupByFlag("cached", !options.cachedAssets);
+		}
+		if (groupAssetsByPath || groupAssetsByExtension) {
+			groupConfigs.push({
+				getKeys: asset => {
+					const extensionMatch =
+						groupAssetsByExtension && GROUP_EXTENSION_REGEXP.exec(asset.name);
+					const extension = extensionMatch ? extensionMatch[1] : "";
+					const pathMatch =
+						groupAssetsByPath && GROUP_PATH_REGEXP.exec(asset.name);
+					const path = pathMatch ? pathMatch[1].split(/[/\\]/) : [];
+					const keys = [];
+					if (groupAssetsByPath) {
+						keys.push(".");
+						if (extension)
+							keys.push(
+								path.length
+									? `${path.join("/")}/*${extension}`
+									: `*${extension}`
+							);
+						while (path.length > 0) {
+							keys.push(path.join("/") + "/");
+							path.pop();
+						}
+					} else {
+						if (extension) keys.push(`*${extension}`);
+					}
+					return keys;
+				},
+				createGroup: (key, children, assets) => {
+					return {
+						type: groupAssetsByPath ? "assets by path" : "assets by extension",
+						name: key,
+						children,
+						...assetGroup(children, assets)
+					};
+				}
+			});
+		}
+	},
+	groupAssetsByInfo: (groupConfigs, context, options) => {
+		const groupByAssetInfoFlag = name => {
+			groupConfigs.push({
+				getKeys: asset => {
+					return asset.info && asset.info[name] ? ["1"] : undefined;
+				},
+				createGroup: (key, children, assets) => {
+					return {
+						type: "assets by info",
+						info: {
+							[name]: !!key
+						},
+						children,
+						...assetGroup(children, assets)
+					};
+				}
+			});
+		};
+		groupByAssetInfoFlag("immutable");
+		groupByAssetInfoFlag("development");
+		groupByAssetInfoFlag("hotModuleReplacement");
+	},
+	groupAssetsByChunk: (groupConfigs, context, options) => {
+		const groupByNames = name => {
+			groupConfigs.push({
+				getKeys: asset => {
+					return asset[name];
+				},
+				createGroup: (key, children, assets) => {
+					return {
+						type: "assets by chunk",
+						[name]: [key],
+						children,
+						...assetGroup(children, assets)
+					};
+				}
+			});
+		};
+		groupByNames("chunkNames");
+		groupByNames("auxiliaryChunkNames");
+		groupByNames("chunkIdHints");
+		groupByNames("auxiliaryChunkIdHints");
+	},
+	excludeAssets: (groupConfigs, context, { excludeAssets }) => {
+		groupConfigs.push({
+			getKeys: asset => {
+				const ident = asset.name;
+				const excluded = excludeAssets.some(fn => fn(ident, asset));
+				if (excluded) return ["excluded"];
+			},
+			getOptions: () => ({
+				groupChildren: false,
+				force: true
+			}),
+			createGroup: (key, children, assets) => ({
+				type: "hidden assets",
+				filteredChildren: assets.length,
+				...assetGroup(children, assets)
+			})
+		});
+	}
+};
+
+/** @type {function("module" | "chunk" | "root-of-chunk" | "nested"): Record<string, (groupConfigs: GroupConfig[], context: StatsFactoryContext, options: NormalizedStatsOptions) => void>} */
+const MODULES_GROUPERS = type => ({
+	_: (groupConfigs, context, options) => {
+		const groupByFlag = (name, type, exclude) => {
+			groupConfigs.push({
+				getKeys: module => {
+					return module[name] ? ["1"] : undefined;
+				},
+				getOptions: () => {
+					return {
+						groupChildren: !exclude,
+						force: exclude
+					};
+				},
+				createGroup: (key, children, modules) => {
+					return {
+						type,
+						[name]: !!key,
+						...(exclude ? { filteredChildren: modules.length } : { children }),
+						...moduleGroup(children, modules)
+					};
+				}
+			});
+		};
+		const {
+			groupModulesByCacheStatus,
+			groupModulesByLayer,
+			groupModulesByAttributes,
+			groupModulesByType,
+			groupModulesByPath,
+			groupModulesByExtension
+		} = options;
+		if (groupModulesByAttributes) {
+			groupByFlag("errors", "modules with errors");
+			groupByFlag("warnings", "modules with warnings");
+			groupByFlag("assets", "modules with assets");
+			groupByFlag("optional", "optional modules");
+		}
+		if (groupModulesByCacheStatus) {
+			groupByFlag("cacheable", "cacheable modules");
+			groupByFlag("built", "built modules");
+			groupByFlag("codeGenerated", "code generated modules");
+		}
+		if (groupModulesByCacheStatus || !options.cachedModules) {
+			groupByFlag("cached", "cached modules", !options.cachedModules);
+		}
+		if (groupModulesByAttributes || !options.orphanModules) {
+			groupByFlag("orphan", "orphan modules", !options.orphanModules);
+		}
+		if (groupModulesByAttributes || !options.dependentModules) {
+			groupByFlag("dependent", "dependent modules", !options.dependentModules);
+		}
+		if (groupModulesByType || !options.runtimeModules) {
+			groupConfigs.push({
+				getKeys: module => {
+					if (!module.moduleType) return;
+					if (groupModulesByType) {
+						return [module.moduleType.split("/", 1)[0]];
+					} else if (module.moduleType === "runtime") {
+						return ["runtime"];
+					}
+				},
+				getOptions: key => {
+					const exclude = key === "runtime" && !options.runtimeModules;
+					return {
+						groupChildren: !exclude,
+						force: exclude
+					};
+				},
+				createGroup: (key, children, modules) => {
+					const exclude = key === "runtime" && !options.runtimeModules;
+					return {
+						type: `${key} modules`,
+						moduleType: key,
+						...(exclude ? { filteredChildren: modules.length } : { children }),
+						...moduleGroup(children, modules)
+					};
+				}
+			});
+		}
+		if (groupModulesByLayer) {
+			groupConfigs.push({
+				getKeys: module => {
+					return [module.layer];
+				},
+				createGroup: (key, children, modules) => {
+					return {
+						type: "modules by layer",
+						layer: key,
+						children,
+						...moduleGroup(children, modules)
+					};
+				}
+			});
+		}
+		if (groupModulesByPath || groupModulesByExtension) {
+			groupConfigs.push({
+				getKeys: module => {
+					if (!module.name) return;
+					const resource = parseResource(module.name.split("!").pop()).path;
+					const dataUrl = /^data:[^,;]+/.exec(resource);
+					if (dataUrl) return [dataUrl[0]];
+					const extensionMatch =
+						groupModulesByExtension && GROUP_EXTENSION_REGEXP.exec(resource);
+					const extension = extensionMatch ? extensionMatch[1] : "";
+					const pathMatch =
+						groupModulesByPath && GROUP_PATH_REGEXP.exec(resource);
+					const path = pathMatch ? pathMatch[1].split(/[/\\]/) : [];
+					const keys = [];
+					if (groupModulesByPath) {
+						if (extension)
+							keys.push(
+								path.length
+									? `${path.join("/")}/*${extension}`
+									: `*${extension}`
+							);
+						while (path.length > 0) {
+							keys.push(path.join("/") + "/");
+							path.pop();
+						}
+					} else {
+						if (extension) keys.push(`*${extension}`);
+					}
+					return keys;
+				},
+				createGroup: (key, children, modules) => {
+					const isDataUrl = key.startsWith("data:");
+					return {
+						type: isDataUrl
+							? "modules by mime type"
+							: groupModulesByPath
+							? "modules by path"
+							: "modules by extension",
+						name: isDataUrl ? key.slice(/* 'data:'.length */ 5) : key,
+						children,
+						...moduleGroup(children, modules)
+					};
+				}
+			});
+		}
+	},
+	excludeModules: (groupConfigs, context, { excludeModules }) => {
+		groupConfigs.push({
+			getKeys: module => {
+				const name = module.name;
+				if (name) {
+					const excluded = excludeModules.some(fn => fn(name, module, type));
+					if (excluded) return ["1"];
+				}
+			},
+			getOptions: () => ({
+				groupChildren: false,
+				force: true
+			}),
+			createGroup: (key, children, modules) => ({
+				type: "hidden modules",
+				filteredChildren: children.length,
+				...moduleGroup(children, modules)
+			})
+		});
+	}
+});
+
+/** @type {Record<string, Record<string, (groupConfigs: GroupConfig[], context: StatsFactoryContext, options: NormalizedStatsOptions) => void>>} */
+const RESULT_GROUPERS = {
+	"compilation.assets": ASSETS_GROUPERS,
+	"asset.related": ASSETS_GROUPERS,
+	"compilation.modules": MODULES_GROUPERS("module"),
+	"chunk.modules": MODULES_GROUPERS("chunk"),
+	"chunk.rootModules": MODULES_GROUPERS("root-of-chunk"),
+	"module.modules": MODULES_GROUPERS("nested"),
+	"module.reasons": {
+		groupReasonsByOrigin: groupConfigs => {
+			groupConfigs.push({
+				getKeys: reason => {
+					return [reason.module];
+				},
+				createGroup: (key, children, reasons) => {
+					return {
+						type: "from origin",
+						module: key,
+						children,
+						...reasonGroup(children, reasons)
+					};
+				}
+			});
+		}
+	}
+};
+
+// remove a prefixed "!" that can be specified to reverse sort order
+const normalizeFieldKey = field => {
+	if (field[0] === "!") {
+		return field.substr(1);
+	}
+	return field;
+};
+
+// if a field is prefixed by a "!" reverse sort order
+const sortOrderRegular = field => {
+	if (field[0] === "!") {
+		return false;
+	}
+	return true;
+};
+
+/**
+ * @param {string} field field name
+ * @returns {function(Object, Object): number} comparators
+ */
+const sortByField = field => {
+	if (!field) {
+		/**
+		 * @param {any} a first
+		 * @param {any} b second
+		 * @returns {-1|0|1} zero
+		 */
+		const noSort = (a, b) => 0;
+		return noSort;
+	}
+
+	const fieldKey = normalizeFieldKey(field);
+
+	let sortFn = compareSelect(m => m[fieldKey], compareIds);
+
+	// if a field is prefixed with a "!" the sort is reversed!
+	const sortIsRegular = sortOrderRegular(field);
+
+	if (!sortIsRegular) {
+		const oldSortFn = sortFn;
+		sortFn = (a, b) => oldSortFn(b, a);
+	}
+
+	return sortFn;
+};
+
+const ASSET_SORTERS = {
+	/** @type {(comparators: Function[], context: StatsFactoryContext, options: NormalizedStatsOptions) => void} */
+	assetsSort: (comparators, context, { assetsSort }) => {
+		comparators.push(sortByField(assetsSort));
+	},
+	_: comparators => {
+		comparators.push(compareSelect(a => a.name, compareIds));
+	}
+};
+
+/** @type {Record<string, Record<string, (comparators: Function[], context: StatsFactoryContext, options: NormalizedStatsOptions) => void>>} */
+const RESULT_SORTERS = {
+	"compilation.chunks": {
+		chunksSort: (comparators, context, { chunksSort }) => {
+			comparators.push(sortByField(chunksSort));
+		}
+	},
+	"compilation.modules": {
+		modulesSort: (comparators, context, { modulesSort }) => {
+			comparators.push(sortByField(modulesSort));
+		}
+	},
+	"chunk.modules": {
+		chunkModulesSort: (comparators, context, { chunkModulesSort }) => {
+			comparators.push(sortByField(chunkModulesSort));
+		}
+	},
+	"module.modules": {
+		nestedModulesSort: (comparators, context, { nestedModulesSort }) => {
+			comparators.push(sortByField(nestedModulesSort));
+		}
+	},
+	"compilation.assets": ASSET_SORTERS,
+	"asset.related": ASSET_SORTERS
+};
+
+/**
+ * @param {Record<string, Record<string, Function>>} config the config see above
+ * @param {NormalizedStatsOptions} options stats options
+ * @param {function(string, Function): void} fn handler function called for every active line in config
+ * @returns {void}
+ */
+const iterateConfig = (config, options, fn) => {
+	for (const hookFor of Object.keys(config)) {
+		const subConfig = config[hookFor];
+		for (const option of Object.keys(subConfig)) {
+			if (option !== "_") {
+				if (option.startsWith("!")) {
+					if (options[option.slice(1)]) continue;
+				} else {
+					const value = options[option];
+					if (
+						value === false ||
+						value === undefined ||
+						(Array.isArray(value) && value.length === 0)
+					)
+						continue;
+				}
+			}
+			fn(hookFor, subConfig[option]);
+		}
+	}
+};
+
+/** @type {Record<string, string>} */
+const ITEM_NAMES = {
+	"compilation.children[]": "compilation",
+	"compilation.modules[]": "module",
+	"compilation.entrypoints[]": "chunkGroup",
+	"compilation.namedChunkGroups[]": "chunkGroup",
+	"compilation.errors[]": "error",
+	"compilation.warnings[]": "warning",
+	"chunk.modules[]": "module",
+	"chunk.rootModules[]": "module",
+	"chunk.origins[]": "chunkOrigin",
+	"compilation.chunks[]": "chunk",
+	"compilation.assets[]": "asset",
+	"asset.related[]": "asset",
+	"module.issuerPath[]": "moduleIssuer",
+	"module.reasons[]": "moduleReason",
+	"module.modules[]": "module",
+	"module.children[]": "module",
+	"moduleTrace[]": "moduleTraceItem",
+	"moduleTraceItem.dependencies[]": "moduleTraceDependency"
+};
+
+/**
+ * @param {Object[]} items items to be merged
+ * @returns {Object} an object
+ */
+const mergeToObject = items => {
+	const obj = Object.create(null);
+	for (const item of items) {
+		obj[item.name] = item;
+	}
+	return obj;
+};
+
+/** @type {Record<string, (items: Object[]) => any>} */
+const MERGER = {
+	"compilation.entrypoints": mergeToObject,
+	"compilation.namedChunkGroups": mergeToObject
+};
+
+class DefaultStatsFactoryPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("DefaultStatsFactoryPlugin", compilation => {
+			compilation.hooks.statsFactory.tap(
+				"DefaultStatsFactoryPlugin",
+				(stats, options, context) => {
+					iterateConfig(SIMPLE_EXTRACTORS, options, (hookFor, fn) => {
+						stats.hooks.extract
+							.for(hookFor)
+							.tap("DefaultStatsFactoryPlugin", (obj, data, ctx) =>
+								fn(obj, data, ctx, options, stats)
+							);
+					});
+					iterateConfig(FILTER, options, (hookFor, fn) => {
+						stats.hooks.filter
+							.for(hookFor)
+							.tap("DefaultStatsFactoryPlugin", (item, ctx, idx, i) =>
+								fn(item, ctx, options, idx, i)
+							);
+					});
+					iterateConfig(FILTER_RESULTS, options, (hookFor, fn) => {
+						stats.hooks.filterResults
+							.for(hookFor)
+							.tap("DefaultStatsFactoryPlugin", (item, ctx, idx, i) =>
+								fn(item, ctx, options, idx, i)
+							);
+					});
+					iterateConfig(SORTERS, options, (hookFor, fn) => {
+						stats.hooks.sort
+							.for(hookFor)
+							.tap("DefaultStatsFactoryPlugin", (comparators, ctx) =>
+								fn(comparators, ctx, options)
+							);
+					});
+					iterateConfig(RESULT_SORTERS, options, (hookFor, fn) => {
+						stats.hooks.sortResults
+							.for(hookFor)
+							.tap("DefaultStatsFactoryPlugin", (comparators, ctx) =>
+								fn(comparators, ctx, options)
+							);
+					});
+					iterateConfig(RESULT_GROUPERS, options, (hookFor, fn) => {
+						stats.hooks.groupResults
+							.for(hookFor)
+							.tap("DefaultStatsFactoryPlugin", (groupConfigs, ctx) =>
+								fn(groupConfigs, ctx, options)
+							);
+					});
+					for (const key of Object.keys(ITEM_NAMES)) {
+						const itemName = ITEM_NAMES[key];
+						stats.hooks.getItemName
+							.for(key)
+							.tap("DefaultStatsFactoryPlugin", () => itemName);
+					}
+					for (const key of Object.keys(MERGER)) {
+						const merger = MERGER[key];
+						stats.hooks.merge.for(key).tap("DefaultStatsFactoryPlugin", merger);
+					}
+					if (options.children) {
+						if (Array.isArray(options.children)) {
+							stats.hooks.getItemFactory
+								.for("compilation.children[].compilation")
+								.tap("DefaultStatsFactoryPlugin", (comp, { _index: idx }) => {
+									if (idx < options.children.length) {
+										return compilation.createStatsFactory(
+											compilation.createStatsOptions(
+												options.children[idx],
+												context
+											)
+										);
+									}
+								});
+						} else if (options.children !== true) {
+							const childFactory = compilation.createStatsFactory(
+								compilation.createStatsOptions(options.children, context)
+							);
+							stats.hooks.getItemFactory
+								.for("compilation.children[].compilation")
+								.tap("DefaultStatsFactoryPlugin", () => {
+									return childFactory;
+								});
+						}
+					}
+				}
+			);
+		});
+	}
+}
+module.exports = DefaultStatsFactoryPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsPresetPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsPresetPlugin.js
new file mode 100644
index 0000000..017e711
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsPresetPlugin.js
@@ -0,0 +1,326 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RequestShortener = require("../RequestShortener");
+
+/** @typedef {import("../../declarations/WebpackOptions").StatsOptions} StatsOptions */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compilation").CreateStatsOptionsContext} CreateStatsOptionsContext */
+/** @typedef {import("../Compiler")} Compiler */
+
+const applyDefaults = (options, defaults) => {
+	for (const key of Object.keys(defaults)) {
+		if (typeof options[key] === "undefined") {
+			options[key] = defaults[key];
+		}
+	}
+};
+
+const NAMED_PRESETS = {
+	verbose: {
+		hash: true,
+		builtAt: true,
+		relatedAssets: true,
+		entrypoints: true,
+		chunkGroups: true,
+		ids: true,
+		modules: false,
+		chunks: true,
+		chunkRelations: true,
+		chunkModules: true,
+		dependentModules: true,
+		chunkOrigins: true,
+		depth: true,
+		env: true,
+		reasons: true,
+		usedExports: true,
+		providedExports: true,
+		optimizationBailout: true,
+		errorDetails: true,
+		errorStack: true,
+		publicPath: true,
+		logging: "verbose",
+		orphanModules: true,
+		runtimeModules: true,
+		exclude: false,
+		modulesSpace: Infinity,
+		chunkModulesSpace: Infinity,
+		assetsSpace: Infinity,
+		reasonsSpace: Infinity,
+		children: true
+	},
+	detailed: {
+		hash: true,
+		builtAt: true,
+		relatedAssets: true,
+		entrypoints: true,
+		chunkGroups: true,
+		ids: true,
+		chunks: true,
+		chunkRelations: true,
+		chunkModules: false,
+		chunkOrigins: true,
+		depth: true,
+		usedExports: true,
+		providedExports: true,
+		optimizationBailout: true,
+		errorDetails: true,
+		publicPath: true,
+		logging: true,
+		runtimeModules: true,
+		exclude: false,
+		modulesSpace: 1000,
+		assetsSpace: 1000,
+		reasonsSpace: 1000
+	},
+	minimal: {
+		all: false,
+		version: true,
+		timings: true,
+		modules: true,
+		modulesSpace: 0,
+		assets: true,
+		assetsSpace: 0,
+		errors: true,
+		errorsCount: true,
+		warnings: true,
+		warningsCount: true,
+		logging: "warn"
+	},
+	"errors-only": {
+		all: false,
+		errors: true,
+		errorsCount: true,
+		moduleTrace: true,
+		logging: "error"
+	},
+	"errors-warnings": {
+		all: false,
+		errors: true,
+		errorsCount: true,
+		warnings: true,
+		warningsCount: true,
+		logging: "warn"
+	},
+	summary: {
+		all: false,
+		version: true,
+		errorsCount: true,
+		warningsCount: true
+	},
+	none: {
+		all: false
+	}
+};
+
+const NORMAL_ON = ({ all }) => all !== false;
+const NORMAL_OFF = ({ all }) => all === true;
+const ON_FOR_TO_STRING = ({ all }, { forToString }) =>
+	forToString ? all !== false : all === true;
+const OFF_FOR_TO_STRING = ({ all }, { forToString }) =>
+	forToString ? all === true : all !== false;
+const AUTO_FOR_TO_STRING = ({ all }, { forToString }) => {
+	if (all === false) return false;
+	if (all === true) return true;
+	if (forToString) return "auto";
+	return true;
+};
+
+/** @type {Record<string, (options: StatsOptions, context: CreateStatsOptionsContext, compilation: Compilation) => any>} */
+const DEFAULTS = {
+	context: (options, context, compilation) => compilation.compiler.context,
+	requestShortener: (options, context, compilation) =>
+		compilation.compiler.context === options.context
+			? compilation.requestShortener
+			: new RequestShortener(options.context, compilation.compiler.root),
+	performance: NORMAL_ON,
+	hash: OFF_FOR_TO_STRING,
+	env: NORMAL_OFF,
+	version: NORMAL_ON,
+	timings: NORMAL_ON,
+	builtAt: OFF_FOR_TO_STRING,
+	assets: NORMAL_ON,
+	entrypoints: AUTO_FOR_TO_STRING,
+	chunkGroups: OFF_FOR_TO_STRING,
+	chunkGroupAuxiliary: OFF_FOR_TO_STRING,
+	chunkGroupChildren: OFF_FOR_TO_STRING,
+	chunkGroupMaxAssets: (o, { forToString }) => (forToString ? 5 : Infinity),
+	chunks: OFF_FOR_TO_STRING,
+	chunkRelations: OFF_FOR_TO_STRING,
+	chunkModules: ({ all, modules }) => {
+		if (all === false) return false;
+		if (all === true) return true;
+		if (modules) return false;
+		return true;
+	},
+	dependentModules: OFF_FOR_TO_STRING,
+	chunkOrigins: OFF_FOR_TO_STRING,
+	ids: OFF_FOR_TO_STRING,
+	modules: ({ all, chunks, chunkModules }, { forToString }) => {
+		if (all === false) return false;
+		if (all === true) return true;
+		if (forToString && chunks && chunkModules) return false;
+		return true;
+	},
+	nestedModules: OFF_FOR_TO_STRING,
+	groupModulesByType: ON_FOR_TO_STRING,
+	groupModulesByCacheStatus: ON_FOR_TO_STRING,
+	groupModulesByLayer: ON_FOR_TO_STRING,
+	groupModulesByAttributes: ON_FOR_TO_STRING,
+	groupModulesByPath: ON_FOR_TO_STRING,
+	groupModulesByExtension: ON_FOR_TO_STRING,
+	modulesSpace: (o, { forToString }) => (forToString ? 15 : Infinity),
+	chunkModulesSpace: (o, { forToString }) => (forToString ? 10 : Infinity),
+	nestedModulesSpace: (o, { forToString }) => (forToString ? 10 : Infinity),
+	relatedAssets: OFF_FOR_TO_STRING,
+	groupAssetsByEmitStatus: ON_FOR_TO_STRING,
+	groupAssetsByInfo: ON_FOR_TO_STRING,
+	groupAssetsByPath: ON_FOR_TO_STRING,
+	groupAssetsByExtension: ON_FOR_TO_STRING,
+	groupAssetsByChunk: ON_FOR_TO_STRING,
+	assetsSpace: (o, { forToString }) => (forToString ? 15 : Infinity),
+	orphanModules: OFF_FOR_TO_STRING,
+	runtimeModules: ({ all, runtime }, { forToString }) =>
+		runtime !== undefined
+			? runtime
+			: forToString
+			? all === true
+			: all !== false,
+	cachedModules: ({ all, cached }, { forToString }) =>
+		cached !== undefined ? cached : forToString ? all === true : all !== false,
+	moduleAssets: OFF_FOR_TO_STRING,
+	depth: OFF_FOR_TO_STRING,
+	cachedAssets: OFF_FOR_TO_STRING,
+	reasons: OFF_FOR_TO_STRING,
+	reasonsSpace: (o, { forToString }) => (forToString ? 15 : Infinity),
+	groupReasonsByOrigin: ON_FOR_TO_STRING,
+	usedExports: OFF_FOR_TO_STRING,
+	providedExports: OFF_FOR_TO_STRING,
+	optimizationBailout: OFF_FOR_TO_STRING,
+	children: OFF_FOR_TO_STRING,
+	source: NORMAL_OFF,
+	moduleTrace: NORMAL_ON,
+	errors: NORMAL_ON,
+	errorsCount: NORMAL_ON,
+	errorDetails: AUTO_FOR_TO_STRING,
+	errorStack: OFF_FOR_TO_STRING,
+	warnings: NORMAL_ON,
+	warningsCount: NORMAL_ON,
+	publicPath: OFF_FOR_TO_STRING,
+	logging: ({ all }, { forToString }) =>
+		forToString && all !== false ? "info" : false,
+	loggingDebug: () => [],
+	loggingTrace: OFF_FOR_TO_STRING,
+	excludeModules: () => [],
+	excludeAssets: () => [],
+	modulesSort: () => "depth",
+	chunkModulesSort: () => "name",
+	nestedModulesSort: () => false,
+	chunksSort: () => false,
+	assetsSort: () => "!size",
+	outputPath: OFF_FOR_TO_STRING,
+	colors: () => false
+};
+
+const normalizeFilter = item => {
+	if (typeof item === "string") {
+		const regExp = new RegExp(
+			`[\\\\/]${item.replace(
+				// eslint-disable-next-line no-useless-escape
+				/[-[\]{}()*+?.\\^$|]/g,
+				"\\$&"
+			)}([\\\\/]|$|!|\\?)`
+		);
+		return ident => regExp.test(ident);
+	}
+	if (item && typeof item === "object" && typeof item.test === "function") {
+		return ident => item.test(ident);
+	}
+	if (typeof item === "function") {
+		return item;
+	}
+	if (typeof item === "boolean") {
+		return () => item;
+	}
+};
+
+const NORMALIZER = {
+	excludeModules: value => {
+		if (!Array.isArray(value)) {
+			value = value ? [value] : [];
+		}
+		return value.map(normalizeFilter);
+	},
+	excludeAssets: value => {
+		if (!Array.isArray(value)) {
+			value = value ? [value] : [];
+		}
+		return value.map(normalizeFilter);
+	},
+	warningsFilter: value => {
+		if (!Array.isArray(value)) {
+			value = value ? [value] : [];
+		}
+		return value.map(filter => {
+			if (typeof filter === "string") {
+				return (warning, warningString) => warningString.includes(filter);
+			}
+			if (filter instanceof RegExp) {
+				return (warning, warningString) => filter.test(warningString);
+			}
+			if (typeof filter === "function") {
+				return filter;
+			}
+			throw new Error(
+				`Can only filter warnings with Strings or RegExps. (Given: ${filter})`
+			);
+		});
+	},
+	logging: value => {
+		if (value === true) value = "log";
+		return value;
+	},
+	loggingDebug: value => {
+		if (!Array.isArray(value)) {
+			value = value ? [value] : [];
+		}
+		return value.map(normalizeFilter);
+	}
+};
+
+class DefaultStatsPresetPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("DefaultStatsPresetPlugin", compilation => {
+			for (const key of Object.keys(NAMED_PRESETS)) {
+				const defaults = NAMED_PRESETS[key];
+				compilation.hooks.statsPreset
+					.for(key)
+					.tap("DefaultStatsPresetPlugin", (options, context) => {
+						applyDefaults(options, defaults);
+					});
+			}
+			compilation.hooks.statsNormalize.tap(
+				"DefaultStatsPresetPlugin",
+				(options, context) => {
+					for (const key of Object.keys(DEFAULTS)) {
+						if (options[key] === undefined)
+							options[key] = DEFAULTS[key](options, context, compilation);
+					}
+					for (const key of Object.keys(NORMALIZER)) {
+						options[key] = NORMALIZER[key](options[key]);
+					}
+				}
+			);
+		});
+	}
+}
+module.exports = DefaultStatsPresetPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsPrinterPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsPrinterPlugin.js
new file mode 100644
index 0000000..d6ce971
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/DefaultStatsPrinterPlugin.js
@@ -0,0 +1,1380 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("./StatsPrinter")} StatsPrinter */
+/** @typedef {import("./StatsPrinter").StatsPrinterContext} StatsPrinterContext */
+
+const DATA_URI_CONTENT_LENGTH = 16;
+
+const plural = (n, singular, plural) => (n === 1 ? singular : plural);
+
+/**
+ * @param {Record<string, number>} sizes sizes by source type
+ * @param {Object} options options
+ * @param {(number) => string=} options.formatSize size formatter
+ * @returns {string} text
+ */
+const printSizes = (sizes, { formatSize = n => `${n}` }) => {
+	const keys = Object.keys(sizes);
+	if (keys.length > 1) {
+		return keys.map(key => `${formatSize(sizes[key])} (${key})`).join(" ");
+	} else if (keys.length === 1) {
+		return formatSize(sizes[keys[0]]);
+	}
+};
+
+const getResourceName = resource => {
+	const dataUrl = /^data:[^,]+,/.exec(resource);
+	if (!dataUrl) return resource;
+
+	const len = dataUrl[0].length + DATA_URI_CONTENT_LENGTH;
+	if (resource.length < len) return resource;
+	return `${resource.slice(
+		0,
+		Math.min(resource.length - /* '..'.length */ 2, len)
+	)}..`;
+};
+
+const getModuleName = name => {
+	const [, prefix, resource] = /^(.*!)?([^!]*)$/.exec(name);
+	return [prefix, getResourceName(resource)];
+};
+
+const mapLines = (str, fn) => str.split("\n").map(fn).join("\n");
+
+/**
+ * @param {number} n a number
+ * @returns {string} number as two digit string, leading 0
+ */
+const twoDigit = n => (n >= 10 ? `${n}` : `0${n}`);
+
+const isValidId = id => {
+	return typeof id === "number" || id;
+};
+
+const moreCount = (list, count) => {
+	return list && list.length > 0 ? `+ ${count}` : `${count}`;
+};
+
+/** @type {Record<string, (thing: any, context: StatsPrinterContext, printer: StatsPrinter) => string | void>} */
+const SIMPLE_PRINTERS = {
+	"compilation.summary!": (
+		_,
+		{
+			type,
+			bold,
+			green,
+			red,
+			yellow,
+			formatDateTime,
+			formatTime,
+			compilation: {
+				name,
+				hash,
+				version,
+				time,
+				builtAt,
+				errorsCount,
+				warningsCount
+			}
+		}
+	) => {
+		const root = type === "compilation.summary!";
+		const warningsMessage =
+			warningsCount > 0
+				? yellow(
+						`${warningsCount} ${plural(warningsCount, "warning", "warnings")}`
+				  )
+				: "";
+		const errorsMessage =
+			errorsCount > 0
+				? red(`${errorsCount} ${plural(errorsCount, "error", "errors")}`)
+				: "";
+		const timeMessage = root && time ? ` in ${formatTime(time)}` : "";
+		const hashMessage = hash ? ` (${hash})` : "";
+		const builtAtMessage =
+			root && builtAt ? `${formatDateTime(builtAt)}: ` : "";
+		const versionMessage = root && version ? `webpack ${version}` : "";
+		const nameMessage =
+			root && name
+				? bold(name)
+				: name
+				? `Child ${bold(name)}`
+				: root
+				? ""
+				: "Child";
+		const subjectMessage =
+			nameMessage && versionMessage
+				? `${nameMessage} (${versionMessage})`
+				: versionMessage || nameMessage || "webpack";
+		let statusMessage;
+		if (errorsMessage && warningsMessage) {
+			statusMessage = `compiled with ${errorsMessage} and ${warningsMessage}`;
+		} else if (errorsMessage) {
+			statusMessage = `compiled with ${errorsMessage}`;
+		} else if (warningsMessage) {
+			statusMessage = `compiled with ${warningsMessage}`;
+		} else if (errorsCount === 0 && warningsCount === 0) {
+			statusMessage = `compiled ${green("successfully")}`;
+		} else {
+			statusMessage = `compiled`;
+		}
+		if (
+			builtAtMessage ||
+			versionMessage ||
+			errorsMessage ||
+			warningsMessage ||
+			(errorsCount === 0 && warningsCount === 0) ||
+			timeMessage ||
+			hashMessage
+		)
+			return `${builtAtMessage}${subjectMessage} ${statusMessage}${timeMessage}${hashMessage}`;
+	},
+	"compilation.filteredWarningDetailsCount": count =>
+		count
+			? `${count} ${plural(
+					count,
+					"warning has",
+					"warnings have"
+			  )} detailed information that is not shown.\nUse 'stats.errorDetails: true' resp. '--stats-error-details' to show it.`
+			: undefined,
+	"compilation.filteredErrorDetailsCount": (count, { yellow }) =>
+		count
+			? yellow(
+					`${count} ${plural(
+						count,
+						"error has",
+						"errors have"
+					)} detailed information that is not shown.\nUse 'stats.errorDetails: true' resp. '--stats-error-details' to show it.`
+			  )
+			: undefined,
+	"compilation.env": (env, { bold }) =>
+		env
+			? `Environment (--env): ${bold(JSON.stringify(env, null, 2))}`
+			: undefined,
+	"compilation.publicPath": (publicPath, { bold }) =>
+		`PublicPath: ${bold(publicPath || "(none)")}`,
+	"compilation.entrypoints": (entrypoints, context, printer) =>
+		Array.isArray(entrypoints)
+			? undefined
+			: printer.print(context.type, Object.values(entrypoints), {
+					...context,
+					chunkGroupKind: "Entrypoint"
+			  }),
+	"compilation.namedChunkGroups": (namedChunkGroups, context, printer) => {
+		if (!Array.isArray(namedChunkGroups)) {
+			const {
+				compilation: { entrypoints }
+			} = context;
+			let chunkGroups = Object.values(namedChunkGroups);
+			if (entrypoints) {
+				chunkGroups = chunkGroups.filter(
+					group =>
+						!Object.prototype.hasOwnProperty.call(entrypoints, group.name)
+				);
+			}
+			return printer.print(context.type, chunkGroups, {
+				...context,
+				chunkGroupKind: "Chunk Group"
+			});
+		}
+	},
+	"compilation.assetsByChunkName": () => "",
+
+	"compilation.filteredModules": (
+		filteredModules,
+		{ compilation: { modules } }
+	) =>
+		filteredModules > 0
+			? `${moreCount(modules, filteredModules)} ${plural(
+					filteredModules,
+					"module",
+					"modules"
+			  )}`
+			: undefined,
+	"compilation.filteredAssets": (filteredAssets, { compilation: { assets } }) =>
+		filteredAssets > 0
+			? `${moreCount(assets, filteredAssets)} ${plural(
+					filteredAssets,
+					"asset",
+					"assets"
+			  )}`
+			: undefined,
+	"compilation.logging": (logging, context, printer) =>
+		Array.isArray(logging)
+			? undefined
+			: printer.print(
+					context.type,
+					Object.entries(logging).map(([name, value]) => ({ ...value, name })),
+					context
+			  ),
+	"compilation.warningsInChildren!": (_, { yellow, compilation }) => {
+		if (
+			!compilation.children &&
+			compilation.warningsCount > 0 &&
+			compilation.warnings
+		) {
+			const childWarnings =
+				compilation.warningsCount - compilation.warnings.length;
+			if (childWarnings > 0) {
+				return yellow(
+					`${childWarnings} ${plural(
+						childWarnings,
+						"WARNING",
+						"WARNINGS"
+					)} in child compilations${
+						compilation.children
+							? ""
+							: " (Use 'stats.children: true' resp. '--stats-children' for more details)"
+					}`
+				);
+			}
+		}
+	},
+	"compilation.errorsInChildren!": (_, { red, compilation }) => {
+		if (
+			!compilation.children &&
+			compilation.errorsCount > 0 &&
+			compilation.errors
+		) {
+			const childErrors = compilation.errorsCount - compilation.errors.length;
+			if (childErrors > 0) {
+				return red(
+					`${childErrors} ${plural(
+						childErrors,
+						"ERROR",
+						"ERRORS"
+					)} in child compilations${
+						compilation.children
+							? ""
+							: " (Use 'stats.children: true' resp. '--stats-children' for more details)"
+					}`
+				);
+			}
+		}
+	},
+
+	"asset.type": type => type,
+	"asset.name": (name, { formatFilename, asset: { isOverSizeLimit } }) =>
+		formatFilename(name, isOverSizeLimit),
+	"asset.size": (
+		size,
+		{ asset: { isOverSizeLimit }, yellow, green, formatSize }
+	) => (isOverSizeLimit ? yellow(formatSize(size)) : formatSize(size)),
+	"asset.emitted": (emitted, { green, formatFlag }) =>
+		emitted ? green(formatFlag("emitted")) : undefined,
+	"asset.comparedForEmit": (comparedForEmit, { yellow, formatFlag }) =>
+		comparedForEmit ? yellow(formatFlag("compared for emit")) : undefined,
+	"asset.cached": (cached, { green, formatFlag }) =>
+		cached ? green(formatFlag("cached")) : undefined,
+	"asset.isOverSizeLimit": (isOverSizeLimit, { yellow, formatFlag }) =>
+		isOverSizeLimit ? yellow(formatFlag("big")) : undefined,
+
+	"asset.info.immutable": (immutable, { green, formatFlag }) =>
+		immutable ? green(formatFlag("immutable")) : undefined,
+	"asset.info.javascriptModule": (javascriptModule, { formatFlag }) =>
+		javascriptModule ? formatFlag("javascript module") : undefined,
+	"asset.info.sourceFilename": (sourceFilename, { formatFlag }) =>
+		sourceFilename
+			? formatFlag(
+					sourceFilename === true
+						? "from source file"
+						: `from: ${sourceFilename}`
+			  )
+			: undefined,
+	"asset.info.development": (development, { green, formatFlag }) =>
+		development ? green(formatFlag("dev")) : undefined,
+	"asset.info.hotModuleReplacement": (
+		hotModuleReplacement,
+		{ green, formatFlag }
+	) => (hotModuleReplacement ? green(formatFlag("hmr")) : undefined),
+	"asset.separator!": () => "\n",
+	"asset.filteredRelated": (filteredRelated, { asset: { related } }) =>
+		filteredRelated > 0
+			? `${moreCount(related, filteredRelated)} related ${plural(
+					filteredRelated,
+					"asset",
+					"assets"
+			  )}`
+			: undefined,
+	"asset.filteredChildren": (filteredChildren, { asset: { children } }) =>
+		filteredChildren > 0
+			? `${moreCount(children, filteredChildren)} ${plural(
+					filteredChildren,
+					"asset",
+					"assets"
+			  )}`
+			: undefined,
+
+	assetChunk: (id, { formatChunkId }) => formatChunkId(id),
+
+	assetChunkName: name => name,
+	assetChunkIdHint: name => name,
+
+	"module.type": type => (type !== "module" ? type : undefined),
+	"module.id": (id, { formatModuleId }) =>
+		isValidId(id) ? formatModuleId(id) : undefined,
+	"module.name": (name, { bold }) => {
+		const [prefix, resource] = getModuleName(name);
+		return `${prefix || ""}${bold(resource || "")}`;
+	},
+	"module.identifier": identifier => undefined,
+	"module.layer": (layer, { formatLayer }) =>
+		layer ? formatLayer(layer) : undefined,
+	"module.sizes": printSizes,
+	"module.chunks[]": (id, { formatChunkId }) => formatChunkId(id),
+	"module.depth": (depth, { formatFlag }) =>
+		depth !== null ? formatFlag(`depth ${depth}`) : undefined,
+	"module.cacheable": (cacheable, { formatFlag, red }) =>
+		cacheable === false ? red(formatFlag("not cacheable")) : undefined,
+	"module.orphan": (orphan, { formatFlag, yellow }) =>
+		orphan ? yellow(formatFlag("orphan")) : undefined,
+	"module.runtime": (runtime, { formatFlag, yellow }) =>
+		runtime ? yellow(formatFlag("runtime")) : undefined,
+	"module.optional": (optional, { formatFlag, yellow }) =>
+		optional ? yellow(formatFlag("optional")) : undefined,
+	"module.dependent": (dependent, { formatFlag, cyan }) =>
+		dependent ? cyan(formatFlag("dependent")) : undefined,
+	"module.built": (built, { formatFlag, yellow }) =>
+		built ? yellow(formatFlag("built")) : undefined,
+	"module.codeGenerated": (codeGenerated, { formatFlag, yellow }) =>
+		codeGenerated ? yellow(formatFlag("code generated")) : undefined,
+	"module.buildTimeExecuted": (buildTimeExecuted, { formatFlag, green }) =>
+		buildTimeExecuted ? green(formatFlag("build time executed")) : undefined,
+	"module.cached": (cached, { formatFlag, green }) =>
+		cached ? green(formatFlag("cached")) : undefined,
+	"module.assets": (assets, { formatFlag, magenta }) =>
+		assets && assets.length
+			? magenta(
+					formatFlag(
+						`${assets.length} ${plural(assets.length, "asset", "assets")}`
+					)
+			  )
+			: undefined,
+	"module.warnings": (warnings, { formatFlag, yellow }) =>
+		warnings === true
+			? yellow(formatFlag("warnings"))
+			: warnings
+			? yellow(
+					formatFlag(`${warnings} ${plural(warnings, "warning", "warnings")}`)
+			  )
+			: undefined,
+	"module.errors": (errors, { formatFlag, red }) =>
+		errors === true
+			? red(formatFlag("errors"))
+			: errors
+			? red(formatFlag(`${errors} ${plural(errors, "error", "errors")}`))
+			: undefined,
+	"module.providedExports": (providedExports, { formatFlag, cyan }) => {
+		if (Array.isArray(providedExports)) {
+			if (providedExports.length === 0) return cyan(formatFlag("no exports"));
+			return cyan(formatFlag(`exports: ${providedExports.join(", ")}`));
+		}
+	},
+	"module.usedExports": (usedExports, { formatFlag, cyan, module }) => {
+		if (usedExports !== true) {
+			if (usedExports === null) return cyan(formatFlag("used exports unknown"));
+			if (usedExports === false) return cyan(formatFlag("module unused"));
+			if (Array.isArray(usedExports)) {
+				if (usedExports.length === 0)
+					return cyan(formatFlag("no exports used"));
+				const providedExportsCount = Array.isArray(module.providedExports)
+					? module.providedExports.length
+					: null;
+				if (
+					providedExportsCount !== null &&
+					providedExportsCount === usedExports.length
+				) {
+					return cyan(formatFlag("all exports used"));
+				} else {
+					return cyan(
+						formatFlag(`only some exports used: ${usedExports.join(", ")}`)
+					);
+				}
+			}
+		}
+	},
+	"module.optimizationBailout[]": (optimizationBailout, { yellow }) =>
+		yellow(optimizationBailout),
+	"module.issuerPath": (issuerPath, { module }) =>
+		module.profile ? undefined : "",
+	"module.profile": profile => undefined,
+	"module.filteredModules": (filteredModules, { module: { modules } }) =>
+		filteredModules > 0
+			? `${moreCount(modules, filteredModules)} nested ${plural(
+					filteredModules,
+					"module",
+					"modules"
+			  )}`
+			: undefined,
+	"module.filteredReasons": (filteredReasons, { module: { reasons } }) =>
+		filteredReasons > 0
+			? `${moreCount(reasons, filteredReasons)} ${plural(
+					filteredReasons,
+					"reason",
+					"reasons"
+			  )}`
+			: undefined,
+	"module.filteredChildren": (filteredChildren, { module: { children } }) =>
+		filteredChildren > 0
+			? `${moreCount(children, filteredChildren)} ${plural(
+					filteredChildren,
+					"module",
+					"modules"
+			  )}`
+			: undefined,
+	"module.separator!": () => "\n",
+
+	"moduleIssuer.id": (id, { formatModuleId }) => formatModuleId(id),
+	"moduleIssuer.profile.total": (value, { formatTime }) => formatTime(value),
+
+	"moduleReason.type": type => type,
+	"moduleReason.userRequest": (userRequest, { cyan }) =>
+		cyan(getResourceName(userRequest)),
+	"moduleReason.moduleId": (moduleId, { formatModuleId }) =>
+		isValidId(moduleId) ? formatModuleId(moduleId) : undefined,
+	"moduleReason.module": (module, { magenta }) => magenta(module),
+	"moduleReason.loc": loc => loc,
+	"moduleReason.explanation": (explanation, { cyan }) => cyan(explanation),
+	"moduleReason.active": (active, { formatFlag }) =>
+		active ? undefined : formatFlag("inactive"),
+	"moduleReason.resolvedModule": (module, { magenta }) => magenta(module),
+	"moduleReason.filteredChildren": (
+		filteredChildren,
+		{ moduleReason: { children } }
+	) =>
+		filteredChildren > 0
+			? `${moreCount(children, filteredChildren)} ${plural(
+					filteredChildren,
+					"reason",
+					"reasons"
+			  )}`
+			: undefined,
+
+	"module.profile.total": (value, { formatTime }) => formatTime(value),
+	"module.profile.resolving": (value, { formatTime }) =>
+		`resolving: ${formatTime(value)}`,
+	"module.profile.restoring": (value, { formatTime }) =>
+		`restoring: ${formatTime(value)}`,
+	"module.profile.integration": (value, { formatTime }) =>
+		`integration: ${formatTime(value)}`,
+	"module.profile.building": (value, { formatTime }) =>
+		`building: ${formatTime(value)}`,
+	"module.profile.storing": (value, { formatTime }) =>
+		`storing: ${formatTime(value)}`,
+	"module.profile.additionalResolving": (value, { formatTime }) =>
+		value ? `additional resolving: ${formatTime(value)}` : undefined,
+	"module.profile.additionalIntegration": (value, { formatTime }) =>
+		value ? `additional integration: ${formatTime(value)}` : undefined,
+
+	"chunkGroup.kind!": (_, { chunkGroupKind }) => chunkGroupKind,
+	"chunkGroup.separator!": () => "\n",
+	"chunkGroup.name": (name, { bold }) => bold(name),
+	"chunkGroup.isOverSizeLimit": (isOverSizeLimit, { formatFlag, yellow }) =>
+		isOverSizeLimit ? yellow(formatFlag("big")) : undefined,
+	"chunkGroup.assetsSize": (size, { formatSize }) =>
+		size ? formatSize(size) : undefined,
+	"chunkGroup.auxiliaryAssetsSize": (size, { formatSize }) =>
+		size ? `(${formatSize(size)})` : undefined,
+	"chunkGroup.filteredAssets": (n, { chunkGroup: { assets } }) =>
+		n > 0
+			? `${moreCount(assets, n)} ${plural(n, "asset", "assets")}`
+			: undefined,
+	"chunkGroup.filteredAuxiliaryAssets": (
+		n,
+		{ chunkGroup: { auxiliaryAssets } }
+	) =>
+		n > 0
+			? `${moreCount(auxiliaryAssets, n)} auxiliary ${plural(
+					n,
+					"asset",
+					"assets"
+			  )}`
+			: undefined,
+	"chunkGroup.is!": () => "=",
+	"chunkGroupAsset.name": (asset, { green }) => green(asset),
+	"chunkGroupAsset.size": (size, { formatSize, chunkGroup }) =>
+		chunkGroup.assets.length > 1 ||
+		(chunkGroup.auxiliaryAssets && chunkGroup.auxiliaryAssets.length > 0)
+			? formatSize(size)
+			: undefined,
+	"chunkGroup.children": (children, context, printer) =>
+		Array.isArray(children)
+			? undefined
+			: printer.print(
+					context.type,
+					Object.keys(children).map(key => ({
+						type: key,
+						children: children[key]
+					})),
+					context
+			  ),
+	"chunkGroupChildGroup.type": type => `${type}:`,
+	"chunkGroupChild.assets[]": (file, { formatFilename }) =>
+		formatFilename(file),
+	"chunkGroupChild.chunks[]": (id, { formatChunkId }) => formatChunkId(id),
+	"chunkGroupChild.name": name => (name ? `(name: ${name})` : undefined),
+
+	"chunk.id": (id, { formatChunkId }) => formatChunkId(id),
+	"chunk.files[]": (file, { formatFilename }) => formatFilename(file),
+	"chunk.names[]": name => name,
+	"chunk.idHints[]": name => name,
+	"chunk.runtime[]": name => name,
+	"chunk.sizes": (sizes, context) => printSizes(sizes, context),
+	"chunk.parents[]": (parents, context) =>
+		context.formatChunkId(parents, "parent"),
+	"chunk.siblings[]": (siblings, context) =>
+		context.formatChunkId(siblings, "sibling"),
+	"chunk.children[]": (children, context) =>
+		context.formatChunkId(children, "child"),
+	"chunk.childrenByOrder": (childrenByOrder, context, printer) =>
+		Array.isArray(childrenByOrder)
+			? undefined
+			: printer.print(
+					context.type,
+					Object.keys(childrenByOrder).map(key => ({
+						type: key,
+						children: childrenByOrder[key]
+					})),
+					context
+			  ),
+	"chunk.childrenByOrder[].type": type => `${type}:`,
+	"chunk.childrenByOrder[].children[]": (id, { formatChunkId }) =>
+		isValidId(id) ? formatChunkId(id) : undefined,
+	"chunk.entry": (entry, { formatFlag, yellow }) =>
+		entry ? yellow(formatFlag("entry")) : undefined,
+	"chunk.initial": (initial, { formatFlag, yellow }) =>
+		initial ? yellow(formatFlag("initial")) : undefined,
+	"chunk.rendered": (rendered, { formatFlag, green }) =>
+		rendered ? green(formatFlag("rendered")) : undefined,
+	"chunk.recorded": (recorded, { formatFlag, green }) =>
+		recorded ? green(formatFlag("recorded")) : undefined,
+	"chunk.reason": (reason, { yellow }) => (reason ? yellow(reason) : undefined),
+	"chunk.filteredModules": (filteredModules, { chunk: { modules } }) =>
+		filteredModules > 0
+			? `${moreCount(modules, filteredModules)} chunk ${plural(
+					filteredModules,
+					"module",
+					"modules"
+			  )}`
+			: undefined,
+	"chunk.separator!": () => "\n",
+
+	"chunkOrigin.request": request => request,
+	"chunkOrigin.moduleId": (moduleId, { formatModuleId }) =>
+		isValidId(moduleId) ? formatModuleId(moduleId) : undefined,
+	"chunkOrigin.moduleName": (moduleName, { bold }) => bold(moduleName),
+	"chunkOrigin.loc": loc => loc,
+
+	"error.compilerPath": (compilerPath, { bold }) =>
+		compilerPath ? bold(`(${compilerPath})`) : undefined,
+	"error.chunkId": (chunkId, { formatChunkId }) =>
+		isValidId(chunkId) ? formatChunkId(chunkId) : undefined,
+	"error.chunkEntry": (chunkEntry, { formatFlag }) =>
+		chunkEntry ? formatFlag("entry") : undefined,
+	"error.chunkInitial": (chunkInitial, { formatFlag }) =>
+		chunkInitial ? formatFlag("initial") : undefined,
+	"error.file": (file, { bold }) => bold(file),
+	"error.moduleName": (moduleName, { bold }) => {
+		return moduleName.includes("!")
+			? `${bold(moduleName.replace(/^(\s|\S)*!/, ""))} (${moduleName})`
+			: `${bold(moduleName)}`;
+	},
+	"error.loc": (loc, { green }) => green(loc),
+	"error.message": (message, { bold, formatError }) =>
+		message.includes("\u001b[") ? message : bold(formatError(message)),
+	"error.details": (details, { formatError }) => formatError(details),
+	"error.stack": stack => stack,
+	"error.moduleTrace": moduleTrace => undefined,
+	"error.separator!": () => "\n",
+
+	"loggingEntry(error).loggingEntry.message": (message, { red }) =>
+		mapLines(message, x => `<e> ${red(x)}`),
+	"loggingEntry(warn).loggingEntry.message": (message, { yellow }) =>
+		mapLines(message, x => `<w> ${yellow(x)}`),
+	"loggingEntry(info).loggingEntry.message": (message, { green }) =>
+		mapLines(message, x => `<i> ${green(x)}`),
+	"loggingEntry(log).loggingEntry.message": (message, { bold }) =>
+		mapLines(message, x => `    ${bold(x)}`),
+	"loggingEntry(debug).loggingEntry.message": message =>
+		mapLines(message, x => `    ${x}`),
+	"loggingEntry(trace).loggingEntry.message": message =>
+		mapLines(message, x => `    ${x}`),
+	"loggingEntry(status).loggingEntry.message": (message, { magenta }) =>
+		mapLines(message, x => `<s> ${magenta(x)}`),
+	"loggingEntry(profile).loggingEntry.message": (message, { magenta }) =>
+		mapLines(message, x => `<p> ${magenta(x)}`),
+	"loggingEntry(profileEnd).loggingEntry.message": (message, { magenta }) =>
+		mapLines(message, x => `</p> ${magenta(x)}`),
+	"loggingEntry(time).loggingEntry.message": (message, { magenta }) =>
+		mapLines(message, x => `<t> ${magenta(x)}`),
+	"loggingEntry(group).loggingEntry.message": (message, { cyan }) =>
+		mapLines(message, x => `<-> ${cyan(x)}`),
+	"loggingEntry(groupCollapsed).loggingEntry.message": (message, { cyan }) =>
+		mapLines(message, x => `<+> ${cyan(x)}`),
+	"loggingEntry(clear).loggingEntry": () => "    -------",
+	"loggingEntry(groupCollapsed).loggingEntry.children": () => "",
+	"loggingEntry.trace[]": trace =>
+		trace ? mapLines(trace, x => `| ${x}`) : undefined,
+
+	"moduleTraceItem.originName": originName => originName,
+
+	loggingGroup: loggingGroup =>
+		loggingGroup.entries.length === 0 ? "" : undefined,
+	"loggingGroup.debug": (flag, { red }) => (flag ? red("DEBUG") : undefined),
+	"loggingGroup.name": (name, { bold }) => bold(`LOG from ${name}`),
+	"loggingGroup.separator!": () => "\n",
+	"loggingGroup.filteredEntries": filteredEntries =>
+		filteredEntries > 0 ? `+ ${filteredEntries} hidden lines` : undefined,
+
+	"moduleTraceDependency.loc": loc => loc
+};
+
+/** @type {Record<string, string | Function>} */
+const ITEM_NAMES = {
+	"compilation.assets[]": "asset",
+	"compilation.modules[]": "module",
+	"compilation.chunks[]": "chunk",
+	"compilation.entrypoints[]": "chunkGroup",
+	"compilation.namedChunkGroups[]": "chunkGroup",
+	"compilation.errors[]": "error",
+	"compilation.warnings[]": "error",
+	"compilation.logging[]": "loggingGroup",
+	"compilation.children[]": "compilation",
+	"asset.related[]": "asset",
+	"asset.children[]": "asset",
+	"asset.chunks[]": "assetChunk",
+	"asset.auxiliaryChunks[]": "assetChunk",
+	"asset.chunkNames[]": "assetChunkName",
+	"asset.chunkIdHints[]": "assetChunkIdHint",
+	"asset.auxiliaryChunkNames[]": "assetChunkName",
+	"asset.auxiliaryChunkIdHints[]": "assetChunkIdHint",
+	"chunkGroup.assets[]": "chunkGroupAsset",
+	"chunkGroup.auxiliaryAssets[]": "chunkGroupAsset",
+	"chunkGroupChild.assets[]": "chunkGroupAsset",
+	"chunkGroupChild.auxiliaryAssets[]": "chunkGroupAsset",
+	"chunkGroup.children[]": "chunkGroupChildGroup",
+	"chunkGroupChildGroup.children[]": "chunkGroupChild",
+	"module.modules[]": "module",
+	"module.children[]": "module",
+	"module.reasons[]": "moduleReason",
+	"moduleReason.children[]": "moduleReason",
+	"module.issuerPath[]": "moduleIssuer",
+	"chunk.origins[]": "chunkOrigin",
+	"chunk.modules[]": "module",
+	"loggingGroup.entries[]": logEntry =>
+		`loggingEntry(${logEntry.type}).loggingEntry`,
+	"loggingEntry.children[]": logEntry =>
+		`loggingEntry(${logEntry.type}).loggingEntry`,
+	"error.moduleTrace[]": "moduleTraceItem",
+	"moduleTraceItem.dependencies[]": "moduleTraceDependency"
+};
+
+const ERROR_PREFERRED_ORDER = [
+	"compilerPath",
+	"chunkId",
+	"chunkEntry",
+	"chunkInitial",
+	"file",
+	"separator!",
+	"moduleName",
+	"loc",
+	"separator!",
+	"message",
+	"separator!",
+	"details",
+	"separator!",
+	"stack",
+	"separator!",
+	"missing",
+	"separator!",
+	"moduleTrace"
+];
+
+/** @type {Record<string, string[]>} */
+const PREFERRED_ORDERS = {
+	compilation: [
+		"name",
+		"hash",
+		"version",
+		"time",
+		"builtAt",
+		"env",
+		"publicPath",
+		"assets",
+		"filteredAssets",
+		"entrypoints",
+		"namedChunkGroups",
+		"chunks",
+		"modules",
+		"filteredModules",
+		"children",
+		"logging",
+		"warnings",
+		"warningsInChildren!",
+		"filteredWarningDetailsCount",
+		"errors",
+		"errorsInChildren!",
+		"filteredErrorDetailsCount",
+		"summary!",
+		"needAdditionalPass"
+	],
+	asset: [
+		"type",
+		"name",
+		"size",
+		"chunks",
+		"auxiliaryChunks",
+		"emitted",
+		"comparedForEmit",
+		"cached",
+		"info",
+		"isOverSizeLimit",
+		"chunkNames",
+		"auxiliaryChunkNames",
+		"chunkIdHints",
+		"auxiliaryChunkIdHints",
+		"related",
+		"filteredRelated",
+		"children",
+		"filteredChildren"
+	],
+	"asset.info": [
+		"immutable",
+		"sourceFilename",
+		"javascriptModule",
+		"development",
+		"hotModuleReplacement"
+	],
+	chunkGroup: [
+		"kind!",
+		"name",
+		"isOverSizeLimit",
+		"assetsSize",
+		"auxiliaryAssetsSize",
+		"is!",
+		"assets",
+		"filteredAssets",
+		"auxiliaryAssets",
+		"filteredAuxiliaryAssets",
+		"separator!",
+		"children"
+	],
+	chunkGroupAsset: ["name", "size"],
+	chunkGroupChildGroup: ["type", "children"],
+	chunkGroupChild: ["assets", "chunks", "name"],
+	module: [
+		"type",
+		"name",
+		"identifier",
+		"id",
+		"layer",
+		"sizes",
+		"chunks",
+		"depth",
+		"cacheable",
+		"orphan",
+		"runtime",
+		"optional",
+		"dependent",
+		"built",
+		"codeGenerated",
+		"cached",
+		"assets",
+		"failed",
+		"warnings",
+		"errors",
+		"children",
+		"filteredChildren",
+		"providedExports",
+		"usedExports",
+		"optimizationBailout",
+		"reasons",
+		"filteredReasons",
+		"issuerPath",
+		"profile",
+		"modules",
+		"filteredModules"
+	],
+	moduleReason: [
+		"active",
+		"type",
+		"userRequest",
+		"moduleId",
+		"module",
+		"resolvedModule",
+		"loc",
+		"explanation",
+		"children",
+		"filteredChildren"
+	],
+	"module.profile": [
+		"total",
+		"separator!",
+		"resolving",
+		"restoring",
+		"integration",
+		"building",
+		"storing",
+		"additionalResolving",
+		"additionalIntegration"
+	],
+	chunk: [
+		"id",
+		"runtime",
+		"files",
+		"names",
+		"idHints",
+		"sizes",
+		"parents",
+		"siblings",
+		"children",
+		"childrenByOrder",
+		"entry",
+		"initial",
+		"rendered",
+		"recorded",
+		"reason",
+		"separator!",
+		"origins",
+		"separator!",
+		"modules",
+		"separator!",
+		"filteredModules"
+	],
+	chunkOrigin: ["request", "moduleId", "moduleName", "loc"],
+	error: ERROR_PREFERRED_ORDER,
+	warning: ERROR_PREFERRED_ORDER,
+	"chunk.childrenByOrder[]": ["type", "children"],
+	loggingGroup: [
+		"debug",
+		"name",
+		"separator!",
+		"entries",
+		"separator!",
+		"filteredEntries"
+	],
+	loggingEntry: ["message", "trace", "children"]
+};
+
+const itemsJoinOneLine = items => items.filter(Boolean).join(" ");
+const itemsJoinOneLineBrackets = items =>
+	items.length > 0 ? `(${items.filter(Boolean).join(" ")})` : undefined;
+const itemsJoinMoreSpacing = items => items.filter(Boolean).join("\n\n");
+const itemsJoinComma = items => items.filter(Boolean).join(", ");
+const itemsJoinCommaBrackets = items =>
+	items.length > 0 ? `(${items.filter(Boolean).join(", ")})` : undefined;
+const itemsJoinCommaBracketsWithName = name => items =>
+	items.length > 0
+		? `(${name}: ${items.filter(Boolean).join(", ")})`
+		: undefined;
+
+/** @type {Record<string, (items: string[]) => string>} */
+const SIMPLE_ITEMS_JOINER = {
+	"chunk.parents": itemsJoinOneLine,
+	"chunk.siblings": itemsJoinOneLine,
+	"chunk.children": itemsJoinOneLine,
+	"chunk.names": itemsJoinCommaBrackets,
+	"chunk.idHints": itemsJoinCommaBracketsWithName("id hint"),
+	"chunk.runtime": itemsJoinCommaBracketsWithName("runtime"),
+	"chunk.files": itemsJoinComma,
+	"chunk.childrenByOrder": itemsJoinOneLine,
+	"chunk.childrenByOrder[].children": itemsJoinOneLine,
+	"chunkGroup.assets": itemsJoinOneLine,
+	"chunkGroup.auxiliaryAssets": itemsJoinOneLineBrackets,
+	"chunkGroupChildGroup.children": itemsJoinComma,
+	"chunkGroupChild.assets": itemsJoinOneLine,
+	"chunkGroupChild.auxiliaryAssets": itemsJoinOneLineBrackets,
+	"asset.chunks": itemsJoinComma,
+	"asset.auxiliaryChunks": itemsJoinCommaBrackets,
+	"asset.chunkNames": itemsJoinCommaBracketsWithName("name"),
+	"asset.auxiliaryChunkNames": itemsJoinCommaBracketsWithName("auxiliary name"),
+	"asset.chunkIdHints": itemsJoinCommaBracketsWithName("id hint"),
+	"asset.auxiliaryChunkIdHints":
+		itemsJoinCommaBracketsWithName("auxiliary id hint"),
+	"module.chunks": itemsJoinOneLine,
+	"module.issuerPath": items =>
+		items
+			.filter(Boolean)
+			.map(item => `${item} ->`)
+			.join(" "),
+	"compilation.errors": itemsJoinMoreSpacing,
+	"compilation.warnings": itemsJoinMoreSpacing,
+	"compilation.logging": itemsJoinMoreSpacing,
+	"compilation.children": items => indent(itemsJoinMoreSpacing(items), "  "),
+	"moduleTraceItem.dependencies": itemsJoinOneLine,
+	"loggingEntry.children": items =>
+		indent(items.filter(Boolean).join("\n"), "  ", false)
+};
+
+const joinOneLine = items =>
+	items
+		.map(item => item.content)
+		.filter(Boolean)
+		.join(" ");
+
+const joinInBrackets = items => {
+	const res = [];
+	let mode = 0;
+	for (const item of items) {
+		if (item.element === "separator!") {
+			switch (mode) {
+				case 0:
+				case 1:
+					mode += 2;
+					break;
+				case 4:
+					res.push(")");
+					mode = 3;
+					break;
+			}
+		}
+		if (!item.content) continue;
+		switch (mode) {
+			case 0:
+				mode = 1;
+				break;
+			case 1:
+				res.push(" ");
+				break;
+			case 2:
+				res.push("(");
+				mode = 4;
+				break;
+			case 3:
+				res.push(" (");
+				mode = 4;
+				break;
+			case 4:
+				res.push(", ");
+				break;
+		}
+		res.push(item.content);
+	}
+	if (mode === 4) res.push(")");
+	return res.join("");
+};
+
+const indent = (str, prefix, noPrefixInFirstLine) => {
+	const rem = str.replace(/\n([^\n])/g, "\n" + prefix + "$1");
+	if (noPrefixInFirstLine) return rem;
+	const ind = str[0] === "\n" ? "" : prefix;
+	return ind + rem;
+};
+
+const joinExplicitNewLine = (items, indenter) => {
+	let firstInLine = true;
+	let first = true;
+	return items
+		.map(item => {
+			if (!item || !item.content) return;
+			let content = indent(item.content, first ? "" : indenter, !firstInLine);
+			if (firstInLine) {
+				content = content.replace(/^\n+/, "");
+			}
+			if (!content) return;
+			first = false;
+			const noJoiner = firstInLine || content.startsWith("\n");
+			firstInLine = content.endsWith("\n");
+			return noJoiner ? content : " " + content;
+		})
+		.filter(Boolean)
+		.join("")
+		.trim();
+};
+
+const joinError =
+	error =>
+	(items, { red, yellow }) =>
+		`${error ? red("ERROR") : yellow("WARNING")} in ${joinExplicitNewLine(
+			items,
+			""
+		)}`;
+
+/** @type {Record<string, (items: ({ element: string, content: string })[], context: StatsPrinterContext) => string>} */
+const SIMPLE_ELEMENT_JOINERS = {
+	compilation: items => {
+		const result = [];
+		let lastNeedMore = false;
+		for (const item of items) {
+			if (!item.content) continue;
+			const needMoreSpace =
+				item.element === "warnings" ||
+				item.element === "filteredWarningDetailsCount" ||
+				item.element === "errors" ||
+				item.element === "filteredErrorDetailsCount" ||
+				item.element === "logging";
+			if (result.length !== 0) {
+				result.push(needMoreSpace || lastNeedMore ? "\n\n" : "\n");
+			}
+			result.push(item.content);
+			lastNeedMore = needMoreSpace;
+		}
+		if (lastNeedMore) result.push("\n");
+		return result.join("");
+	},
+	asset: items =>
+		joinExplicitNewLine(
+			items.map(item => {
+				if (
+					(item.element === "related" || item.element === "children") &&
+					item.content
+				) {
+					return {
+						...item,
+						content: `\n${item.content}\n`
+					};
+				}
+				return item;
+			}),
+			"  "
+		),
+	"asset.info": joinOneLine,
+	module: (items, { module }) => {
+		let hasName = false;
+		return joinExplicitNewLine(
+			items.map(item => {
+				switch (item.element) {
+					case "id":
+						if (module.id === module.name) {
+							if (hasName) return false;
+							if (item.content) hasName = true;
+						}
+						break;
+					case "name":
+						if (hasName) return false;
+						if (item.content) hasName = true;
+						break;
+					case "providedExports":
+					case "usedExports":
+					case "optimizationBailout":
+					case "reasons":
+					case "issuerPath":
+					case "profile":
+					case "children":
+					case "modules":
+						if (item.content) {
+							return {
+								...item,
+								content: `\n${item.content}\n`
+							};
+						}
+						break;
+				}
+				return item;
+			}),
+			"  "
+		);
+	},
+	chunk: items => {
+		let hasEntry = false;
+		return (
+			"chunk " +
+			joinExplicitNewLine(
+				items.filter(item => {
+					switch (item.element) {
+						case "entry":
+							if (item.content) hasEntry = true;
+							break;
+						case "initial":
+							if (hasEntry) return false;
+							break;
+					}
+					return true;
+				}),
+				"  "
+			)
+		);
+	},
+	"chunk.childrenByOrder[]": items => `(${joinOneLine(items)})`,
+	chunkGroup: items => joinExplicitNewLine(items, "  "),
+	chunkGroupAsset: joinOneLine,
+	chunkGroupChildGroup: joinOneLine,
+	chunkGroupChild: joinOneLine,
+	// moduleReason: (items, { moduleReason }) => {
+	// 	let hasName = false;
+	// 	return joinOneLine(
+	// 		items.filter(item => {
+	// 			switch (item.element) {
+	// 				case "moduleId":
+	// 					if (moduleReason.moduleId === moduleReason.module && item.content)
+	// 						hasName = true;
+	// 					break;
+	// 				case "module":
+	// 					if (hasName) return false;
+	// 					break;
+	// 				case "resolvedModule":
+	// 					return (
+	// 						moduleReason.module !== moduleReason.resolvedModule &&
+	// 						item.content
+	// 					);
+	// 			}
+	// 			return true;
+	// 		})
+	// 	);
+	// },
+	moduleReason: (items, { moduleReason }) => {
+		let hasName = false;
+		return joinExplicitNewLine(
+			items.map(item => {
+				switch (item.element) {
+					case "moduleId":
+						if (moduleReason.moduleId === moduleReason.module && item.content)
+							hasName = true;
+						break;
+					case "module":
+						if (hasName) return false;
+						break;
+					case "resolvedModule":
+						if (moduleReason.module === moduleReason.resolvedModule)
+							return false;
+						break;
+					case "children":
+						if (item.content) {
+							return {
+								...item,
+								content: `\n${item.content}\n`
+							};
+						}
+						break;
+				}
+				return item;
+			}),
+			"  "
+		);
+	},
+	"module.profile": joinInBrackets,
+	moduleIssuer: joinOneLine,
+	chunkOrigin: items => "> " + joinOneLine(items),
+	"errors[].error": joinError(true),
+	"warnings[].error": joinError(false),
+	loggingGroup: items => joinExplicitNewLine(items, "").trimRight(),
+	moduleTraceItem: items => " @ " + joinOneLine(items),
+	moduleTraceDependency: joinOneLine
+};
+
+const AVAILABLE_COLORS = {
+	bold: "\u001b[1m",
+	yellow: "\u001b[1m\u001b[33m",
+	red: "\u001b[1m\u001b[31m",
+	green: "\u001b[1m\u001b[32m",
+	cyan: "\u001b[1m\u001b[36m",
+	magenta: "\u001b[1m\u001b[35m"
+};
+
+const AVAILABLE_FORMATS = {
+	formatChunkId: (id, { yellow }, direction) => {
+		switch (direction) {
+			case "parent":
+				return `<{${yellow(id)}}>`;
+			case "sibling":
+				return `={${yellow(id)}}=`;
+			case "child":
+				return `>{${yellow(id)}}<`;
+			default:
+				return `{${yellow(id)}}`;
+		}
+	},
+	formatModuleId: id => `[${id}]`,
+	formatFilename: (filename, { green, yellow }, oversize) =>
+		(oversize ? yellow : green)(filename),
+	formatFlag: flag => `[${flag}]`,
+	formatLayer: layer => `(in ${layer})`,
+	formatSize: require("../SizeFormatHelpers").formatSize,
+	formatDateTime: (dateTime, { bold }) => {
+		const d = new Date(dateTime);
+		const x = twoDigit;
+		const date = `${d.getFullYear()}-${x(d.getMonth() + 1)}-${x(d.getDate())}`;
+		const time = `${x(d.getHours())}:${x(d.getMinutes())}:${x(d.getSeconds())}`;
+		return `${date} ${bold(time)}`;
+	},
+	formatTime: (
+		time,
+		{ timeReference, bold, green, yellow, red },
+		boldQuantity
+	) => {
+		const unit = " ms";
+		if (timeReference && time !== timeReference) {
+			const times = [
+				timeReference / 2,
+				timeReference / 4,
+				timeReference / 8,
+				timeReference / 16
+			];
+			if (time < times[3]) return `${time}${unit}`;
+			else if (time < times[2]) return bold(`${time}${unit}`);
+			else if (time < times[1]) return green(`${time}${unit}`);
+			else if (time < times[0]) return yellow(`${time}${unit}`);
+			else return red(`${time}${unit}`);
+		} else {
+			return `${boldQuantity ? bold(time) : time}${unit}`;
+		}
+	},
+	formatError: (message, { green, yellow, red }) => {
+		if (message.includes("\u001b[")) return message;
+		const highlights = [
+			{ regExp: /(Did you mean .+)/g, format: green },
+			{
+				regExp: /(Set 'mode' option to 'development' or 'production')/g,
+				format: green
+			},
+			{ regExp: /(\(module has no exports\))/g, format: red },
+			{ regExp: /\(possible exports: (.+)\)/g, format: green },
+			{ regExp: /(?:^|\n)(.* doesn't exist)/g, format: red },
+			{ regExp: /('\w+' option has not been set)/g, format: red },
+			{
+				regExp: /(Emitted value instead of an instance of Error)/g,
+				format: yellow
+			},
+			{ regExp: /(Used? .+ instead)/gi, format: yellow },
+			{ regExp: /\b(deprecated|must|required)\b/g, format: yellow },
+			{
+				regExp: /\b(BREAKING CHANGE)\b/gi,
+				format: red
+			},
+			{
+				regExp:
+					/\b(error|failed|unexpected|invalid|not found|not supported|not available|not possible|not implemented|doesn't support|conflict|conflicting|not existing|duplicate)\b/gi,
+				format: red
+			}
+		];
+		for (const { regExp, format } of highlights) {
+			message = message.replace(regExp, (match, content) => {
+				return match.replace(content, format(content));
+			});
+		}
+		return message;
+	}
+};
+
+const RESULT_MODIFIER = {
+	"module.modules": result => {
+		return indent(result, "| ");
+	}
+};
+
+const createOrder = (array, preferredOrder) => {
+	const originalArray = array.slice();
+	const set = new Set(array);
+	const usedSet = new Set();
+	array.length = 0;
+	for (const element of preferredOrder) {
+		if (element.endsWith("!") || set.has(element)) {
+			array.push(element);
+			usedSet.add(element);
+		}
+	}
+	for (const element of originalArray) {
+		if (!usedSet.has(element)) {
+			array.push(element);
+		}
+	}
+	return array;
+};
+
+class DefaultStatsPrinterPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("DefaultStatsPrinterPlugin", compilation => {
+			compilation.hooks.statsPrinter.tap(
+				"DefaultStatsPrinterPlugin",
+				(stats, options, context) => {
+					// Put colors into context
+					stats.hooks.print
+						.for("compilation")
+						.tap("DefaultStatsPrinterPlugin", (compilation, context) => {
+							for (const color of Object.keys(AVAILABLE_COLORS)) {
+								let start;
+								if (options.colors) {
+									if (
+										typeof options.colors === "object" &&
+										typeof options.colors[color] === "string"
+									) {
+										start = options.colors[color];
+									} else {
+										start = AVAILABLE_COLORS[color];
+									}
+								}
+								if (start) {
+									context[color] = str =>
+										`${start}${
+											typeof str === "string"
+												? str.replace(
+														/((\u001b\[39m|\u001b\[22m|\u001b\[0m)+)/g,
+														`$1${start}`
+												  )
+												: str
+										}\u001b[39m\u001b[22m`;
+								} else {
+									context[color] = str => str;
+								}
+							}
+							for (const format of Object.keys(AVAILABLE_FORMATS)) {
+								context[format] = (content, ...args) =>
+									AVAILABLE_FORMATS[format](content, context, ...args);
+							}
+							context.timeReference = compilation.time;
+						});
+
+					for (const key of Object.keys(SIMPLE_PRINTERS)) {
+						stats.hooks.print
+							.for(key)
+							.tap("DefaultStatsPrinterPlugin", (obj, ctx) =>
+								SIMPLE_PRINTERS[key](obj, ctx, stats)
+							);
+					}
+
+					for (const key of Object.keys(PREFERRED_ORDERS)) {
+						const preferredOrder = PREFERRED_ORDERS[key];
+						stats.hooks.sortElements
+							.for(key)
+							.tap("DefaultStatsPrinterPlugin", (elements, context) => {
+								createOrder(elements, preferredOrder);
+							});
+					}
+
+					for (const key of Object.keys(ITEM_NAMES)) {
+						const itemName = ITEM_NAMES[key];
+						stats.hooks.getItemName
+							.for(key)
+							.tap(
+								"DefaultStatsPrinterPlugin",
+								typeof itemName === "string" ? () => itemName : itemName
+							);
+					}
+
+					for (const key of Object.keys(SIMPLE_ITEMS_JOINER)) {
+						const joiner = SIMPLE_ITEMS_JOINER[key];
+						stats.hooks.printItems
+							.for(key)
+							.tap("DefaultStatsPrinterPlugin", joiner);
+					}
+
+					for (const key of Object.keys(SIMPLE_ELEMENT_JOINERS)) {
+						const joiner = SIMPLE_ELEMENT_JOINERS[key];
+						stats.hooks.printElements
+							.for(key)
+							.tap("DefaultStatsPrinterPlugin", joiner);
+					}
+
+					for (const key of Object.keys(RESULT_MODIFIER)) {
+						const modifier = RESULT_MODIFIER[key];
+						stats.hooks.result
+							.for(key)
+							.tap("DefaultStatsPrinterPlugin", modifier);
+					}
+				}
+			);
+		});
+	}
+}
+module.exports = DefaultStatsPrinterPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/stats/StatsFactory.js b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/StatsFactory.js
new file mode 100644
index 0000000..4ba7063
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/StatsFactory.js
@@ -0,0 +1,292 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { HookMap, SyncBailHook, SyncWaterfallHook } = require("tapable");
+const { concatComparators, keepOriginalOrder } = require("../util/comparators");
+const smartGrouping = require("../util/smartGrouping");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../WebpackError")} WebpackError */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+/** @typedef {import("../util/smartGrouping").GroupConfig<any, object>} GroupConfig */
+
+/**
+ * @typedef {Object} KnownStatsFactoryContext
+ * @property {string} type
+ * @property {function(string): string=} makePathsRelative
+ * @property {Compilation=} compilation
+ * @property {Set<Module>=} rootModules
+ * @property {Map<string,Chunk[]>=} compilationFileToChunks
+ * @property {Map<string,Chunk[]>=} compilationAuxiliaryFileToChunks
+ * @property {RuntimeSpec=} runtime
+ * @property {function(Compilation): WebpackError[]=} cachedGetErrors
+ * @property {function(Compilation): WebpackError[]=} cachedGetWarnings
+ */
+
+/** @typedef {KnownStatsFactoryContext & Record<string, any>} StatsFactoryContext */
+
+class StatsFactory {
+	constructor() {
+		this.hooks = Object.freeze({
+			/** @type {HookMap<SyncBailHook<[Object, any, StatsFactoryContext]>>} */
+			extract: new HookMap(
+				() => new SyncBailHook(["object", "data", "context"])
+			),
+			/** @type {HookMap<SyncBailHook<[any, StatsFactoryContext, number, number]>>} */
+			filter: new HookMap(
+				() => new SyncBailHook(["item", "context", "index", "unfilteredIndex"])
+			),
+			/** @type {HookMap<SyncBailHook<[(function(any, any): number)[], StatsFactoryContext]>>} */
+			sort: new HookMap(() => new SyncBailHook(["comparators", "context"])),
+			/** @type {HookMap<SyncBailHook<[any, StatsFactoryContext, number, number]>>} */
+			filterSorted: new HookMap(
+				() => new SyncBailHook(["item", "context", "index", "unfilteredIndex"])
+			),
+			/** @type {HookMap<SyncBailHook<[GroupConfig[], StatsFactoryContext]>>} */
+			groupResults: new HookMap(
+				() => new SyncBailHook(["groupConfigs", "context"])
+			),
+			/** @type {HookMap<SyncBailHook<[(function(any, any): number)[], StatsFactoryContext]>>} */
+			sortResults: new HookMap(
+				() => new SyncBailHook(["comparators", "context"])
+			),
+			/** @type {HookMap<SyncBailHook<[any, StatsFactoryContext, number, number]>>} */
+			filterResults: new HookMap(
+				() => new SyncBailHook(["item", "context", "index", "unfilteredIndex"])
+			),
+			/** @type {HookMap<SyncBailHook<[any[], StatsFactoryContext]>>} */
+			merge: new HookMap(() => new SyncBailHook(["items", "context"])),
+			/** @type {HookMap<SyncBailHook<[any[], StatsFactoryContext]>>} */
+			result: new HookMap(() => new SyncWaterfallHook(["result", "context"])),
+			/** @type {HookMap<SyncBailHook<[any, StatsFactoryContext]>>} */
+			getItemName: new HookMap(() => new SyncBailHook(["item", "context"])),
+			/** @type {HookMap<SyncBailHook<[any, StatsFactoryContext]>>} */
+			getItemFactory: new HookMap(() => new SyncBailHook(["item", "context"]))
+		});
+		const hooks = this.hooks;
+		this._caches =
+			/** @type {Record<keyof typeof hooks, Map<string, SyncBailHook<[any[], StatsFactoryContext]>[]>>} */ ({});
+		for (const key of Object.keys(hooks)) {
+			this._caches[key] = new Map();
+		}
+		this._inCreate = false;
+	}
+
+	_getAllLevelHooks(hookMap, cache, type) {
+		const cacheEntry = cache.get(type);
+		if (cacheEntry !== undefined) {
+			return cacheEntry;
+		}
+		const hooks = [];
+		const typeParts = type.split(".");
+		for (let i = 0; i < typeParts.length; i++) {
+			const hook = hookMap.get(typeParts.slice(i).join("."));
+			if (hook) {
+				hooks.push(hook);
+			}
+		}
+		cache.set(type, hooks);
+		return hooks;
+	}
+
+	_forEachLevel(hookMap, cache, type, fn) {
+		for (const hook of this._getAllLevelHooks(hookMap, cache, type)) {
+			const result = fn(hook);
+			if (result !== undefined) return result;
+		}
+	}
+
+	_forEachLevelWaterfall(hookMap, cache, type, data, fn) {
+		for (const hook of this._getAllLevelHooks(hookMap, cache, type)) {
+			data = fn(hook, data);
+		}
+		return data;
+	}
+
+	_forEachLevelFilter(hookMap, cache, type, items, fn, forceClone) {
+		const hooks = this._getAllLevelHooks(hookMap, cache, type);
+		if (hooks.length === 0) return forceClone ? items.slice() : items;
+		let i = 0;
+		return items.filter((item, idx) => {
+			for (const hook of hooks) {
+				const r = fn(hook, item, idx, i);
+				if (r !== undefined) {
+					if (r) i++;
+					return r;
+				}
+			}
+			i++;
+			return true;
+		});
+	}
+
+	/**
+	 * @param {string} type type
+	 * @param {any} data factory data
+	 * @param {Omit<StatsFactoryContext, "type">} baseContext context used as base
+	 * @returns {any} created object
+	 */
+	create(type, data, baseContext) {
+		if (this._inCreate) {
+			return this._create(type, data, baseContext);
+		} else {
+			try {
+				this._inCreate = true;
+				return this._create(type, data, baseContext);
+			} finally {
+				for (const key of Object.keys(this._caches)) this._caches[key].clear();
+				this._inCreate = false;
+			}
+		}
+	}
+
+	_create(type, data, baseContext) {
+		const context = {
+			...baseContext,
+			type,
+			[type]: data
+		};
+		if (Array.isArray(data)) {
+			// run filter on unsorted items
+			const items = this._forEachLevelFilter(
+				this.hooks.filter,
+				this._caches.filter,
+				type,
+				data,
+				(h, r, idx, i) => h.call(r, context, idx, i),
+				true
+			);
+
+			// sort items
+			const comparators = [];
+			this._forEachLevel(this.hooks.sort, this._caches.sort, type, h =>
+				h.call(comparators, context)
+			);
+			if (comparators.length > 0) {
+				items.sort(
+					// @ts-expect-error number of arguments is correct
+					concatComparators(...comparators, keepOriginalOrder(items))
+				);
+			}
+
+			// run filter on sorted items
+			const items2 = this._forEachLevelFilter(
+				this.hooks.filterSorted,
+				this._caches.filterSorted,
+				type,
+				items,
+				(h, r, idx, i) => h.call(r, context, idx, i),
+				false
+			);
+
+			// for each item
+			let resultItems = items2.map((item, i) => {
+				const itemContext = {
+					...context,
+					_index: i
+				};
+
+				// run getItemName
+				const itemName = this._forEachLevel(
+					this.hooks.getItemName,
+					this._caches.getItemName,
+					`${type}[]`,
+					h => h.call(item, itemContext)
+				);
+				if (itemName) itemContext[itemName] = item;
+				const innerType = itemName ? `${type}[].${itemName}` : `${type}[]`;
+
+				// run getItemFactory
+				const itemFactory =
+					this._forEachLevel(
+						this.hooks.getItemFactory,
+						this._caches.getItemFactory,
+						innerType,
+						h => h.call(item, itemContext)
+					) || this;
+
+				// run item factory
+				return itemFactory.create(innerType, item, itemContext);
+			});
+
+			// sort result items
+			const comparators2 = [];
+			this._forEachLevel(
+				this.hooks.sortResults,
+				this._caches.sortResults,
+				type,
+				h => h.call(comparators2, context)
+			);
+			if (comparators2.length > 0) {
+				resultItems.sort(
+					// @ts-expect-error number of arguments is correct
+					concatComparators(...comparators2, keepOriginalOrder(resultItems))
+				);
+			}
+
+			// group result items
+			const groupConfigs = [];
+			this._forEachLevel(
+				this.hooks.groupResults,
+				this._caches.groupResults,
+				type,
+				h => h.call(groupConfigs, context)
+			);
+			if (groupConfigs.length > 0) {
+				resultItems = smartGrouping(resultItems, groupConfigs);
+			}
+
+			// run filter on sorted result items
+			const finalResultItems = this._forEachLevelFilter(
+				this.hooks.filterResults,
+				this._caches.filterResults,
+				type,
+				resultItems,
+				(h, r, idx, i) => h.call(r, context, idx, i),
+				false
+			);
+
+			// run merge on mapped items
+			let result = this._forEachLevel(
+				this.hooks.merge,
+				this._caches.merge,
+				type,
+				h => h.call(finalResultItems, context)
+			);
+			if (result === undefined) result = finalResultItems;
+
+			// run result on merged items
+			return this._forEachLevelWaterfall(
+				this.hooks.result,
+				this._caches.result,
+				type,
+				result,
+				(h, r) => h.call(r, context)
+			);
+		} else {
+			const object = {};
+
+			// run extract on value
+			this._forEachLevel(this.hooks.extract, this._caches.extract, type, h =>
+				h.call(object, data, context)
+			);
+
+			// run result on extracted object
+			return this._forEachLevelWaterfall(
+				this.hooks.result,
+				this._caches.result,
+				type,
+				object,
+				(h, r) => h.call(r, context)
+			);
+		}
+	}
+}
+module.exports = StatsFactory;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/stats/StatsPrinter.js b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/StatsPrinter.js
new file mode 100644
index 0000000..228b81d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/stats/StatsPrinter.js
@@ -0,0 +1,249 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { HookMap, SyncWaterfallHook, SyncBailHook } = require("tapable");
+
+/** @template T @typedef {import("tapable").AsArray<T>} AsArray<T> */
+/** @typedef {import("tapable").Hook} Hook */
+/** @typedef {import("./DefaultStatsFactoryPlugin").StatsAsset} StatsAsset */
+/** @typedef {import("./DefaultStatsFactoryPlugin").StatsChunk} StatsChunk */
+/** @typedef {import("./DefaultStatsFactoryPlugin").StatsChunkGroup} StatsChunkGroup */
+/** @typedef {import("./DefaultStatsFactoryPlugin").StatsCompilation} StatsCompilation */
+/** @typedef {import("./DefaultStatsFactoryPlugin").StatsModule} StatsModule */
+/** @typedef {import("./DefaultStatsFactoryPlugin").StatsModuleReason} StatsModuleReason */
+
+/**
+ * @typedef {Object} PrintedElement
+ * @property {string} element
+ * @property {string} content
+ */
+
+/**
+ * @typedef {Object} KnownStatsPrinterContext
+ * @property {string=} type
+ * @property {StatsCompilation=} compilation
+ * @property {StatsChunkGroup=} chunkGroup
+ * @property {StatsAsset=} asset
+ * @property {StatsModule=} module
+ * @property {StatsChunk=} chunk
+ * @property {StatsModuleReason=} moduleReason
+ * @property {(str: string) => string=} bold
+ * @property {(str: string) => string=} yellow
+ * @property {(str: string) => string=} red
+ * @property {(str: string) => string=} green
+ * @property {(str: string) => string=} magenta
+ * @property {(str: string) => string=} cyan
+ * @property {(file: string, oversize?: boolean) => string=} formatFilename
+ * @property {(id: string) => string=} formatModuleId
+ * @property {(id: string, direction?: "parent"|"child"|"sibling") => string=} formatChunkId
+ * @property {(size: number) => string=} formatSize
+ * @property {(dateTime: number) => string=} formatDateTime
+ * @property {(flag: string) => string=} formatFlag
+ * @property {(time: number, boldQuantity?: boolean) => string=} formatTime
+ * @property {string=} chunkGroupKind
+ */
+
+/** @typedef {KnownStatsPrinterContext & Record<string, any>} StatsPrinterContext */
+
+class StatsPrinter {
+	constructor() {
+		this.hooks = Object.freeze({
+			/** @type {HookMap<SyncBailHook<[string[], StatsPrinterContext], true>>} */
+			sortElements: new HookMap(
+				() => new SyncBailHook(["elements", "context"])
+			),
+			/** @type {HookMap<SyncBailHook<[PrintedElement[], StatsPrinterContext], string>>} */
+			printElements: new HookMap(
+				() => new SyncBailHook(["printedElements", "context"])
+			),
+			/** @type {HookMap<SyncBailHook<[any[], StatsPrinterContext], true>>} */
+			sortItems: new HookMap(() => new SyncBailHook(["items", "context"])),
+			/** @type {HookMap<SyncBailHook<[any, StatsPrinterContext], string>>} */
+			getItemName: new HookMap(() => new SyncBailHook(["item", "context"])),
+			/** @type {HookMap<SyncBailHook<[string[], StatsPrinterContext], string>>} */
+			printItems: new HookMap(
+				() => new SyncBailHook(["printedItems", "context"])
+			),
+			/** @type {HookMap<SyncBailHook<[{}, StatsPrinterContext], string>>} */
+			print: new HookMap(() => new SyncBailHook(["object", "context"])),
+			/** @type {HookMap<SyncWaterfallHook<[string, StatsPrinterContext]>>} */
+			result: new HookMap(() => new SyncWaterfallHook(["result", "context"]))
+		});
+		/** @type {Map<HookMap<Hook>, Map<string, Hook[]>>} */
+		this._levelHookCache = new Map();
+		this._inPrint = false;
+	}
+
+	/**
+	 * get all level hooks
+	 * @private
+	 * @template {Hook} T
+	 * @param {HookMap<T>} hookMap HookMap
+	 * @param {string} type type
+	 * @returns {T[]} hooks
+	 */
+	_getAllLevelHooks(hookMap, type) {
+		let cache = /** @type {Map<string, T[]>} */ (
+			this._levelHookCache.get(hookMap)
+		);
+		if (cache === undefined) {
+			cache = new Map();
+			this._levelHookCache.set(hookMap, cache);
+		}
+		const cacheEntry = cache.get(type);
+		if (cacheEntry !== undefined) {
+			return cacheEntry;
+		}
+		/** @type {T[]} */
+		const hooks = [];
+		const typeParts = type.split(".");
+		for (let i = 0; i < typeParts.length; i++) {
+			const hook = hookMap.get(typeParts.slice(i).join("."));
+			if (hook) {
+				hooks.push(hook);
+			}
+		}
+		cache.set(type, hooks);
+		return hooks;
+	}
+
+	/**
+	 * Run `fn` for each level
+	 * @private
+	 * @template T
+	 * @template R
+	 * @param {HookMap<SyncBailHook<T, R>>} hookMap HookMap
+	 * @param {string} type type
+	 * @param {(hook: SyncBailHook<T, R>) => R} fn function
+	 * @returns {R} result of `fn`
+	 */
+	_forEachLevel(hookMap, type, fn) {
+		for (const hook of this._getAllLevelHooks(hookMap, type)) {
+			const result = fn(hook);
+			if (result !== undefined) return result;
+		}
+	}
+
+	/**
+	 * Run `fn` for each level
+	 * @private
+	 * @template T
+	 * @param {HookMap<SyncWaterfallHook<T>>} hookMap HookMap
+	 * @param {string} type type
+	 * @param {AsArray<T>[0]} data data
+	 * @param {(hook: SyncWaterfallHook<T>, data: AsArray<T>[0]) => AsArray<T>[0]} fn function
+	 * @returns {AsArray<T>[0]} result of `fn`
+	 */
+	_forEachLevelWaterfall(hookMap, type, data, fn) {
+		for (const hook of this._getAllLevelHooks(hookMap, type)) {
+			data = fn(hook, data);
+		}
+		return data;
+	}
+
+	/**
+	 * @param {string} type The type
+	 * @param {Object} object Object to print
+	 * @param {Object=} baseContext The base context
+	 * @returns {string} printed result
+	 */
+	print(type, object, baseContext) {
+		if (this._inPrint) {
+			return this._print(type, object, baseContext);
+		} else {
+			try {
+				this._inPrint = true;
+				return this._print(type, object, baseContext);
+			} finally {
+				this._levelHookCache.clear();
+				this._inPrint = false;
+			}
+		}
+	}
+
+	/**
+	 * @private
+	 * @param {string} type type
+	 * @param {Object} object object
+	 * @param {Object=} baseContext context
+	 * @returns {string} printed result
+	 */
+	_print(type, object, baseContext) {
+		const context = {
+			...baseContext,
+			type,
+			[type]: object
+		};
+
+		let printResult = this._forEachLevel(this.hooks.print, type, hook =>
+			hook.call(object, context)
+		);
+		if (printResult === undefined) {
+			if (Array.isArray(object)) {
+				const sortedItems = object.slice();
+				this._forEachLevel(this.hooks.sortItems, type, h =>
+					h.call(sortedItems, context)
+				);
+				const printedItems = sortedItems.map((item, i) => {
+					const itemContext = {
+						...context,
+						_index: i
+					};
+					const itemName = this._forEachLevel(
+						this.hooks.getItemName,
+						`${type}[]`,
+						h => h.call(item, itemContext)
+					);
+					if (itemName) itemContext[itemName] = item;
+					return this.print(
+						itemName ? `${type}[].${itemName}` : `${type}[]`,
+						item,
+						itemContext
+					);
+				});
+				printResult = this._forEachLevel(this.hooks.printItems, type, h =>
+					h.call(printedItems, context)
+				);
+				if (printResult === undefined) {
+					const result = printedItems.filter(Boolean);
+					if (result.length > 0) printResult = result.join("\n");
+				}
+			} else if (object !== null && typeof object === "object") {
+				const elements = Object.keys(object).filter(
+					key => object[key] !== undefined
+				);
+				this._forEachLevel(this.hooks.sortElements, type, h =>
+					h.call(elements, context)
+				);
+				const printedElements = elements.map(element => {
+					const content = this.print(`${type}.${element}`, object[element], {
+						...context,
+						_parent: object,
+						_element: element,
+						[element]: object[element]
+					});
+					return { element, content };
+				});
+				printResult = this._forEachLevel(this.hooks.printElements, type, h =>
+					h.call(printedElements, context)
+				);
+				if (printResult === undefined) {
+					const result = printedElements.map(e => e.content).filter(Boolean);
+					if (result.length > 0) printResult = result.join("\n");
+				}
+			}
+		}
+
+		return this._forEachLevelWaterfall(
+			this.hooks.result,
+			type,
+			printResult,
+			(h, r) => h.call(r, context)
+		);
+	}
+}
+module.exports = StatsPrinter;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/ArrayHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/ArrayHelpers.js
new file mode 100644
index 0000000..e4652d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/ArrayHelpers.js
@@ -0,0 +1,44 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * Compare two arrays or strings by performing strict equality check for each value.
+ * @template T [T=any]
+ * @param {ArrayLike<T>} a Array of values to be compared
+ * @param {ArrayLike<T>} b Array of values to be compared
+ * @returns {boolean} returns true if all the elements of passed arrays are strictly equal.
+ */
+
+exports.equals = (a, b) => {
+	if (a.length !== b.length) return false;
+	for (let i = 0; i < a.length; i++) {
+		if (a[i] !== b[i]) return false;
+	}
+	return true;
+};
+
+/**
+ * Partition an array by calling a predicate function on each value.
+ * @template T [T=any]
+ * @param {Array<T>} arr Array of values to be partitioned
+ * @param {(value: T) => boolean} fn Partition function which partitions based on truthiness of result.
+ * @returns {[Array<T>, Array<T>]} returns the values of `arr` partitioned into two new arrays based on fn predicate.
+ */
+exports.groupBy = (arr = [], fn) => {
+	return arr.reduce(
+		/**
+		 * @param {[Array<T>, Array<T>]} groups An accumulator storing already partitioned values returned from previous call.
+		 * @param {T} value The value of the current element
+		 * @returns {[Array<T>, Array<T>]} returns an array of partitioned groups accumulator resulting from calling a predicate on the current value.
+		 */
+		(groups, value) => {
+			groups[fn(value) ? 0 : 1].push(value);
+			return groups;
+		},
+		[[], []]
+	);
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/ArrayQueue.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/ArrayQueue.js
new file mode 100644
index 0000000..321baf3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/ArrayQueue.js
@@ -0,0 +1,111 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @template T
+ */
+class ArrayQueue {
+	/**
+	 * @param {Iterable<T>=} items The initial elements.
+	 */
+	constructor(items) {
+		/** @private @type {T[]} */
+		this._list = items ? Array.from(items) : [];
+		/** @private @type {T[]} */
+		this._listReversed = [];
+	}
+
+	/**
+	 * Returns the number of elements in this queue.
+	 * @returns {number} The number of elements in this queue.
+	 */
+	get length() {
+		return this._list.length + this._listReversed.length;
+	}
+
+	/**
+	 * Empties the queue.
+	 */
+	clear() {
+		this._list.length = 0;
+		this._listReversed.length = 0;
+	}
+
+	/**
+	 * Appends the specified element to this queue.
+	 * @param {T} item The element to add.
+	 * @returns {void}
+	 */
+	enqueue(item) {
+		this._list.push(item);
+	}
+
+	/**
+	 * Retrieves and removes the head of this queue.
+	 * @returns {T | undefined} The head of the queue of `undefined` if this queue is empty.
+	 */
+	dequeue() {
+		if (this._listReversed.length === 0) {
+			if (this._list.length === 0) return undefined;
+			if (this._list.length === 1) return this._list.pop();
+			if (this._list.length < 16) return this._list.shift();
+			const temp = this._listReversed;
+			this._listReversed = this._list;
+			this._listReversed.reverse();
+			this._list = temp;
+		}
+		return this._listReversed.pop();
+	}
+
+	/**
+	 * Finds and removes an item
+	 * @param {T} item the item
+	 * @returns {void}
+	 */
+	delete(item) {
+		const i = this._list.indexOf(item);
+		if (i >= 0) {
+			this._list.splice(i, 1);
+		} else {
+			const i = this._listReversed.indexOf(item);
+			if (i >= 0) this._listReversed.splice(i, 1);
+		}
+	}
+
+	[Symbol.iterator]() {
+		let i = -1;
+		let reversed = false;
+		return {
+			next: () => {
+				if (!reversed) {
+					i++;
+					if (i < this._list.length) {
+						return {
+							done: false,
+							value: this._list[i]
+						};
+					}
+					reversed = true;
+					i = this._listReversed.length;
+				}
+				i--;
+				if (i < 0) {
+					return {
+						done: true,
+						value: undefined
+					};
+				}
+				return {
+					done: false,
+					value: this._listReversed[i]
+				};
+			}
+		};
+	}
+}
+
+module.exports = ArrayQueue;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/AsyncQueue.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/AsyncQueue.js
new file mode 100644
index 0000000..604337d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/AsyncQueue.js
@@ -0,0 +1,373 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncHook, AsyncSeriesHook } = require("tapable");
+const { makeWebpackError } = require("../HookWebpackError");
+const WebpackError = require("../WebpackError");
+const ArrayQueue = require("./ArrayQueue");
+
+const QUEUED_STATE = 0;
+const PROCESSING_STATE = 1;
+const DONE_STATE = 2;
+
+let inHandleResult = 0;
+
+/**
+ * @template T
+ * @callback Callback
+ * @param {(WebpackError | null)=} err
+ * @param {T=} result
+ */
+
+/**
+ * @template T
+ * @template K
+ * @template R
+ */
+class AsyncQueueEntry {
+	/**
+	 * @param {T} item the item
+	 * @param {Callback<R>} callback the callback
+	 */
+	constructor(item, callback) {
+		this.item = item;
+		/** @type {typeof QUEUED_STATE | typeof PROCESSING_STATE | typeof DONE_STATE} */
+		this.state = QUEUED_STATE;
+		this.callback = callback;
+		/** @type {Callback<R>[] | undefined} */
+		this.callbacks = undefined;
+		this.result = undefined;
+		/** @type {WebpackError | undefined} */
+		this.error = undefined;
+	}
+}
+
+/**
+ * @template T
+ * @template K
+ * @template R
+ */
+class AsyncQueue {
+	/**
+	 * @param {Object} options options object
+	 * @param {string=} options.name name of the queue
+	 * @param {number=} options.parallelism how many items should be processed at once
+	 * @param {AsyncQueue<any, any, any>=} options.parent parent queue, which will have priority over this queue and with shared parallelism
+	 * @param {function(T): K=} options.getKey extract key from item
+	 * @param {function(T, Callback<R>): void} options.processor async function to process items
+	 */
+	constructor({ name, parallelism, parent, processor, getKey }) {
+		this._name = name;
+		this._parallelism = parallelism || 1;
+		this._processor = processor;
+		this._getKey =
+			getKey || /** @type {(T) => K} */ (item => /** @type {any} */ (item));
+		/** @type {Map<K, AsyncQueueEntry<T, K, R>>} */
+		this._entries = new Map();
+		/** @type {ArrayQueue<AsyncQueueEntry<T, K, R>>} */
+		this._queued = new ArrayQueue();
+		/** @type {AsyncQueue<any, any, any>[]} */
+		this._children = undefined;
+		this._activeTasks = 0;
+		this._willEnsureProcessing = false;
+		this._needProcessing = false;
+		this._stopped = false;
+		this._root = parent ? parent._root : this;
+		if (parent) {
+			if (this._root._children === undefined) {
+				this._root._children = [this];
+			} else {
+				this._root._children.push(this);
+			}
+		}
+
+		this.hooks = {
+			/** @type {AsyncSeriesHook<[T]>} */
+			beforeAdd: new AsyncSeriesHook(["item"]),
+			/** @type {SyncHook<[T]>} */
+			added: new SyncHook(["item"]),
+			/** @type {AsyncSeriesHook<[T]>} */
+			beforeStart: new AsyncSeriesHook(["item"]),
+			/** @type {SyncHook<[T]>} */
+			started: new SyncHook(["item"]),
+			/** @type {SyncHook<[T, Error, R]>} */
+			result: new SyncHook(["item", "error", "result"])
+		};
+
+		this._ensureProcessing = this._ensureProcessing.bind(this);
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @param {Callback<R>} callback callback function
+	 * @returns {void}
+	 */
+	add(item, callback) {
+		if (this._stopped) return callback(new WebpackError("Queue was stopped"));
+		this.hooks.beforeAdd.callAsync(item, err => {
+			if (err) {
+				callback(
+					makeWebpackError(err, `AsyncQueue(${this._name}).hooks.beforeAdd`)
+				);
+				return;
+			}
+			const key = this._getKey(item);
+			const entry = this._entries.get(key);
+			if (entry !== undefined) {
+				if (entry.state === DONE_STATE) {
+					if (inHandleResult++ > 3) {
+						process.nextTick(() => callback(entry.error, entry.result));
+					} else {
+						callback(entry.error, entry.result);
+					}
+					inHandleResult--;
+				} else if (entry.callbacks === undefined) {
+					entry.callbacks = [callback];
+				} else {
+					entry.callbacks.push(callback);
+				}
+				return;
+			}
+			const newEntry = new AsyncQueueEntry(item, callback);
+			if (this._stopped) {
+				this.hooks.added.call(item);
+				this._root._activeTasks++;
+				process.nextTick(() =>
+					this._handleResult(newEntry, new WebpackError("Queue was stopped"))
+				);
+			} else {
+				this._entries.set(key, newEntry);
+				this._queued.enqueue(newEntry);
+				const root = this._root;
+				root._needProcessing = true;
+				if (root._willEnsureProcessing === false) {
+					root._willEnsureProcessing = true;
+					setImmediate(root._ensureProcessing);
+				}
+				this.hooks.added.call(item);
+			}
+		});
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {void}
+	 */
+	invalidate(item) {
+		const key = this._getKey(item);
+		const entry = this._entries.get(key);
+		this._entries.delete(key);
+		if (entry.state === QUEUED_STATE) {
+			this._queued.delete(entry);
+		}
+	}
+
+	/**
+	 * Waits for an already started item
+	 * @param {T} item an item
+	 * @param {Callback<R>} callback callback function
+	 * @returns {void}
+	 */
+	waitFor(item, callback) {
+		const key = this._getKey(item);
+		const entry = this._entries.get(key);
+		if (entry === undefined) {
+			return callback(
+				new WebpackError(
+					"waitFor can only be called for an already started item"
+				)
+			);
+		}
+		if (entry.state === DONE_STATE) {
+			process.nextTick(() => callback(entry.error, entry.result));
+		} else if (entry.callbacks === undefined) {
+			entry.callbacks = [callback];
+		} else {
+			entry.callbacks.push(callback);
+		}
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	stop() {
+		this._stopped = true;
+		const queue = this._queued;
+		this._queued = new ArrayQueue();
+		const root = this._root;
+		for (const entry of queue) {
+			this._entries.delete(this._getKey(entry.item));
+			root._activeTasks++;
+			this._handleResult(entry, new WebpackError("Queue was stopped"));
+		}
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	increaseParallelism() {
+		const root = this._root;
+		root._parallelism++;
+		/* istanbul ignore next */
+		if (root._willEnsureProcessing === false && root._needProcessing) {
+			root._willEnsureProcessing = true;
+			setImmediate(root._ensureProcessing);
+		}
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	decreaseParallelism() {
+		const root = this._root;
+		root._parallelism--;
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {boolean} true, if the item is currently being processed
+	 */
+	isProcessing(item) {
+		const key = this._getKey(item);
+		const entry = this._entries.get(key);
+		return entry !== undefined && entry.state === PROCESSING_STATE;
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {boolean} true, if the item is currently queued
+	 */
+	isQueued(item) {
+		const key = this._getKey(item);
+		const entry = this._entries.get(key);
+		return entry !== undefined && entry.state === QUEUED_STATE;
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {boolean} true, if the item is currently queued
+	 */
+	isDone(item) {
+		const key = this._getKey(item);
+		const entry = this._entries.get(key);
+		return entry !== undefined && entry.state === DONE_STATE;
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	_ensureProcessing() {
+		while (this._activeTasks < this._parallelism) {
+			const entry = this._queued.dequeue();
+			if (entry === undefined) break;
+			this._activeTasks++;
+			entry.state = PROCESSING_STATE;
+			this._startProcessing(entry);
+		}
+		this._willEnsureProcessing = false;
+		if (this._queued.length > 0) return;
+		if (this._children !== undefined) {
+			for (const child of this._children) {
+				while (this._activeTasks < this._parallelism) {
+					const entry = child._queued.dequeue();
+					if (entry === undefined) break;
+					this._activeTasks++;
+					entry.state = PROCESSING_STATE;
+					child._startProcessing(entry);
+				}
+				if (child._queued.length > 0) return;
+			}
+		}
+		if (!this._willEnsureProcessing) this._needProcessing = false;
+	}
+
+	/**
+	 * @param {AsyncQueueEntry<T, K, R>} entry the entry
+	 * @returns {void}
+	 */
+	_startProcessing(entry) {
+		this.hooks.beforeStart.callAsync(entry.item, err => {
+			if (err) {
+				this._handleResult(
+					entry,
+					makeWebpackError(err, `AsyncQueue(${this._name}).hooks.beforeStart`)
+				);
+				return;
+			}
+			let inCallback = false;
+			try {
+				this._processor(entry.item, (e, r) => {
+					inCallback = true;
+					this._handleResult(entry, e, r);
+				});
+			} catch (err) {
+				if (inCallback) throw err;
+				this._handleResult(entry, err, null);
+			}
+			this.hooks.started.call(entry.item);
+		});
+	}
+
+	/**
+	 * @param {AsyncQueueEntry<T, K, R>} entry the entry
+	 * @param {WebpackError=} err error, if any
+	 * @param {R=} result result, if any
+	 * @returns {void}
+	 */
+	_handleResult(entry, err, result) {
+		this.hooks.result.callAsync(entry.item, err, result, hookError => {
+			const error = hookError
+				? makeWebpackError(hookError, `AsyncQueue(${this._name}).hooks.result`)
+				: err;
+
+			const callback = entry.callback;
+			const callbacks = entry.callbacks;
+			entry.state = DONE_STATE;
+			entry.callback = undefined;
+			entry.callbacks = undefined;
+			entry.result = result;
+			entry.error = error;
+
+			const root = this._root;
+			root._activeTasks--;
+			if (root._willEnsureProcessing === false && root._needProcessing) {
+				root._willEnsureProcessing = true;
+				setImmediate(root._ensureProcessing);
+			}
+
+			if (inHandleResult++ > 3) {
+				process.nextTick(() => {
+					callback(error, result);
+					if (callbacks !== undefined) {
+						for (const callback of callbacks) {
+							callback(error, result);
+						}
+					}
+				});
+			} else {
+				callback(error, result);
+				if (callbacks !== undefined) {
+					for (const callback of callbacks) {
+						callback(error, result);
+					}
+				}
+			}
+			inHandleResult--;
+		});
+	}
+
+	clear() {
+		this._entries.clear();
+		this._queued.clear();
+		this._activeTasks = 0;
+		this._willEnsureProcessing = false;
+		this._needProcessing = false;
+		this._stopped = false;
+	}
+}
+
+module.exports = AsyncQueue;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/Hash.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/Hash.js
new file mode 100644
index 0000000..a007827
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/Hash.js
@@ -0,0 +1,35 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+class Hash {
+	/* istanbul ignore next */
+	/**
+	 * Update hash {@link https://nodejs.org/api/crypto.html#crypto_hash_update_data_inputencoding}
+	 * @abstract
+	 * @param {string|Buffer} data data
+	 * @param {string=} inputEncoding data encoding
+	 * @returns {this} updated hash
+	 */
+	update(data, inputEncoding) {
+		const AbstractMethodError = require("../AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+
+	/* istanbul ignore next */
+	/**
+	 * Calculates the digest {@link https://nodejs.org/api/crypto.html#crypto_hash_digest_encoding}
+	 * @abstract
+	 * @param {string=} encoding encoding of the return value
+	 * @returns {string|Buffer} digest
+	 */
+	digest(encoding) {
+		const AbstractMethodError = require("../AbstractMethodError");
+		throw new AbstractMethodError();
+	}
+}
+
+module.exports = Hash;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/IterableHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/IterableHelpers.js
new file mode 100644
index 0000000..beb98a5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/IterableHelpers.js
@@ -0,0 +1,46 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @template T
+ * @param {Iterable<T>} set a set
+ * @returns {T | undefined} last item
+ */
+const last = set => {
+	let last;
+	for (const item of set) last = item;
+	return last;
+};
+
+/**
+ * @template T
+ * @param {Iterable<T>} iterable iterable
+ * @param {function(T): boolean} filter predicate
+ * @returns {boolean} true, if some items match the filter predicate
+ */
+const someInIterable = (iterable, filter) => {
+	for (const item of iterable) {
+		if (filter(item)) return true;
+	}
+	return false;
+};
+
+/**
+ * @template T
+ * @param {Iterable<T>} iterable an iterable
+ * @returns {number} count of items
+ */
+const countIterable = iterable => {
+	let i = 0;
+	// eslint-disable-next-line no-unused-vars
+	for (const _ of iterable) i++;
+	return i;
+};
+
+exports.last = last;
+exports.someInIterable = someInIterable;
+exports.countIterable = countIterable;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/LazyBucketSortedSet.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/LazyBucketSortedSet.js
new file mode 100644
index 0000000..63e9dc0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/LazyBucketSortedSet.js
@@ -0,0 +1,236 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { first } = require("./SetHelpers");
+const SortableSet = require("./SortableSet");
+
+/**
+ * Multi layer bucket sorted set:
+ * Supports adding non-existing items (DO NOT ADD ITEM TWICE),
+ * Supports removing exiting items (DO NOT REMOVE ITEM NOT IN SET),
+ * Supports popping the first items according to defined order,
+ * Supports iterating all items without order,
+ * Supports updating an item in an efficient way,
+ * Supports size property, which is the number of items,
+ * Items are lazy partially sorted when needed
+ * @template T
+ * @template K
+ */
+class LazyBucketSortedSet {
+	/**
+	 * @param {function(T): K} getKey function to get key from item
+	 * @param {function(K, K): number} comparator comparator to sort keys
+	 * @param  {...((function(T): any) | (function(any, any): number))} args more pairs of getKey and comparator plus optional final comparator for the last layer
+	 */
+	constructor(getKey, comparator, ...args) {
+		this._getKey = getKey;
+		this._innerArgs = args;
+		this._leaf = args.length <= 1;
+		this._keys = new SortableSet(undefined, comparator);
+		/** @type {Map<K, LazyBucketSortedSet<T, any> | SortableSet<T>>} */
+		this._map = new Map();
+		this._unsortedItems = new Set();
+		this.size = 0;
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {void}
+	 */
+	add(item) {
+		this.size++;
+		this._unsortedItems.add(item);
+	}
+
+	/**
+	 * @param {K} key key of item
+	 * @param {T} item the item
+	 * @returns {void}
+	 */
+	_addInternal(key, item) {
+		let entry = this._map.get(key);
+		if (entry === undefined) {
+			entry = this._leaf
+				? new SortableSet(undefined, this._innerArgs[0])
+				: new /** @type {any} */ (LazyBucketSortedSet)(...this._innerArgs);
+			this._keys.add(key);
+			this._map.set(key, entry);
+		}
+		entry.add(item);
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {void}
+	 */
+	delete(item) {
+		this.size--;
+		if (this._unsortedItems.has(item)) {
+			this._unsortedItems.delete(item);
+			return;
+		}
+		const key = this._getKey(item);
+		const entry = this._map.get(key);
+		entry.delete(item);
+		if (entry.size === 0) {
+			this._deleteKey(key);
+		}
+	}
+
+	/**
+	 * @param {K} key key to be removed
+	 * @returns {void}
+	 */
+	_deleteKey(key) {
+		this._keys.delete(key);
+		this._map.delete(key);
+	}
+
+	/**
+	 * @returns {T | undefined} an item
+	 */
+	popFirst() {
+		if (this.size === 0) return undefined;
+		this.size--;
+		if (this._unsortedItems.size > 0) {
+			for (const item of this._unsortedItems) {
+				const key = this._getKey(item);
+				this._addInternal(key, item);
+			}
+			this._unsortedItems.clear();
+		}
+		this._keys.sort();
+		const key = first(this._keys);
+		const entry = this._map.get(key);
+		if (this._leaf) {
+			const leafEntry = /** @type {SortableSet<T>} */ (entry);
+			leafEntry.sort();
+			const item = first(leafEntry);
+			leafEntry.delete(item);
+			if (leafEntry.size === 0) {
+				this._deleteKey(key);
+			}
+			return item;
+		} else {
+			const nodeEntry = /** @type {LazyBucketSortedSet<T, any>} */ (entry);
+			const item = nodeEntry.popFirst();
+			if (nodeEntry.size === 0) {
+				this._deleteKey(key);
+			}
+			return item;
+		}
+	}
+
+	/**
+	 * @param {T} item to be updated item
+	 * @returns {function(true=): void} finish update
+	 */
+	startUpdate(item) {
+		if (this._unsortedItems.has(item)) {
+			return remove => {
+				if (remove) {
+					this._unsortedItems.delete(item);
+					this.size--;
+					return;
+				}
+			};
+		}
+		const key = this._getKey(item);
+		if (this._leaf) {
+			const oldEntry = /** @type {SortableSet<T>} */ (this._map.get(key));
+			return remove => {
+				if (remove) {
+					this.size--;
+					oldEntry.delete(item);
+					if (oldEntry.size === 0) {
+						this._deleteKey(key);
+					}
+					return;
+				}
+				const newKey = this._getKey(item);
+				if (key === newKey) {
+					// This flags the sortable set as unordered
+					oldEntry.add(item);
+				} else {
+					oldEntry.delete(item);
+					if (oldEntry.size === 0) {
+						this._deleteKey(key);
+					}
+					this._addInternal(newKey, item);
+				}
+			};
+		} else {
+			const oldEntry = /** @type {LazyBucketSortedSet<T, any>} */ (
+				this._map.get(key)
+			);
+			const finishUpdate = oldEntry.startUpdate(item);
+			return remove => {
+				if (remove) {
+					this.size--;
+					finishUpdate(true);
+					if (oldEntry.size === 0) {
+						this._deleteKey(key);
+					}
+					return;
+				}
+				const newKey = this._getKey(item);
+				if (key === newKey) {
+					finishUpdate();
+				} else {
+					finishUpdate(true);
+					if (oldEntry.size === 0) {
+						this._deleteKey(key);
+					}
+					this._addInternal(newKey, item);
+				}
+			};
+		}
+	}
+
+	/**
+	 * @param {Iterator<T>[]} iterators list of iterators to append to
+	 * @returns {void}
+	 */
+	_appendIterators(iterators) {
+		if (this._unsortedItems.size > 0)
+			iterators.push(this._unsortedItems[Symbol.iterator]());
+		for (const key of this._keys) {
+			const entry = this._map.get(key);
+			if (this._leaf) {
+				const leafEntry = /** @type {SortableSet<T>} */ (entry);
+				const iterator = leafEntry[Symbol.iterator]();
+				iterators.push(iterator);
+			} else {
+				const nodeEntry = /** @type {LazyBucketSortedSet<T, any>} */ (entry);
+				nodeEntry._appendIterators(iterators);
+			}
+		}
+	}
+
+	/**
+	 * @returns {Iterator<T>} the iterator
+	 */
+	[Symbol.iterator]() {
+		const iterators = [];
+		this._appendIterators(iterators);
+		iterators.reverse();
+		let currentIterator = iterators.pop();
+		return {
+			next: () => {
+				const res = currentIterator.next();
+				if (res.done) {
+					if (iterators.length === 0) return res;
+					currentIterator = iterators.pop();
+					return currentIterator.next();
+				}
+				return res;
+			}
+		};
+	}
+}
+
+module.exports = LazyBucketSortedSet;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/LazySet.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/LazySet.js
new file mode 100644
index 0000000..0d3b13b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/LazySet.js
@@ -0,0 +1,208 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const makeSerializable = require("./makeSerializable.js");
+
+/**
+ * @template T
+ * @param {Set<T>} targetSet set where items should be added
+ * @param {Set<Iterable<T>>} toMerge iterables to be merged
+ * @returns {void}
+ */
+const merge = (targetSet, toMerge) => {
+	for (const set of toMerge) {
+		for (const item of set) {
+			targetSet.add(item);
+		}
+	}
+};
+
+/**
+ * @template T
+ * @param {Set<Iterable<T>>} targetSet set where iterables should be added
+ * @param {Array<LazySet<T>>} toDeepMerge lazy sets to be flattened
+ * @returns {void}
+ */
+const flatten = (targetSet, toDeepMerge) => {
+	for (const set of toDeepMerge) {
+		if (set._set.size > 0) targetSet.add(set._set);
+		if (set._needMerge) {
+			for (const mergedSet of set._toMerge) {
+				targetSet.add(mergedSet);
+			}
+			flatten(targetSet, set._toDeepMerge);
+		}
+	}
+};
+
+/**
+ * Like Set but with an addAll method to eventually add items from another iterable.
+ * Access methods make sure that all delayed operations are executed.
+ * Iteration methods deopts to normal Set performance until clear is called again (because of the chance of modifications during iteration).
+ * @template T
+ */
+class LazySet {
+	/**
+	 * @param {Iterable<T>=} iterable init iterable
+	 */
+	constructor(iterable) {
+		/** @type {Set<T>} */
+		this._set = new Set(iterable);
+		/** @type {Set<Iterable<T>>} */
+		this._toMerge = new Set();
+		/** @type {Array<LazySet<T>>} */
+		this._toDeepMerge = [];
+		this._needMerge = false;
+		this._deopt = false;
+	}
+
+	_flatten() {
+		flatten(this._toMerge, this._toDeepMerge);
+		this._toDeepMerge.length = 0;
+	}
+
+	_merge() {
+		this._flatten();
+		merge(this._set, this._toMerge);
+		this._toMerge.clear();
+		this._needMerge = false;
+	}
+
+	_isEmpty() {
+		return (
+			this._set.size === 0 &&
+			this._toMerge.size === 0 &&
+			this._toDeepMerge.length === 0
+		);
+	}
+
+	get size() {
+		if (this._needMerge) this._merge();
+		return this._set.size;
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {this} itself
+	 */
+	add(item) {
+		this._set.add(item);
+		return this;
+	}
+
+	/**
+	 * @param {Iterable<T> | LazySet<T>} iterable a immutable iterable or another immutable LazySet which will eventually be merged into the Set
+	 * @returns {this} itself
+	 */
+	addAll(iterable) {
+		if (this._deopt) {
+			const _set = this._set;
+			for (const item of iterable) {
+				_set.add(item);
+			}
+		} else {
+			if (iterable instanceof LazySet) {
+				if (iterable._isEmpty()) return this;
+				this._toDeepMerge.push(iterable);
+				this._needMerge = true;
+				if (this._toDeepMerge.length > 100000) {
+					this._flatten();
+				}
+			} else {
+				this._toMerge.add(iterable);
+				this._needMerge = true;
+			}
+			if (this._toMerge.size > 100000) this._merge();
+		}
+		return this;
+	}
+
+	clear() {
+		this._set.clear();
+		this._toMerge.clear();
+		this._toDeepMerge.length = 0;
+		this._needMerge = false;
+		this._deopt = false;
+	}
+
+	/**
+	 * @param {T} value an item
+	 * @returns {boolean} true, if the value was in the Set before
+	 */
+	delete(value) {
+		if (this._needMerge) this._merge();
+		return this._set.delete(value);
+	}
+
+	entries() {
+		this._deopt = true;
+		if (this._needMerge) this._merge();
+		return this._set.entries();
+	}
+
+	/**
+	 * @param {function(T, T, Set<T>): void} callbackFn function called for each entry
+	 * @param {any} thisArg this argument for the callbackFn
+	 * @returns {void}
+	 */
+	forEach(callbackFn, thisArg) {
+		this._deopt = true;
+		if (this._needMerge) this._merge();
+		this._set.forEach(callbackFn, thisArg);
+	}
+
+	/**
+	 * @param {T} item an item
+	 * @returns {boolean} true, when the item is in the Set
+	 */
+	has(item) {
+		if (this._needMerge) this._merge();
+		return this._set.has(item);
+	}
+
+	keys() {
+		this._deopt = true;
+		if (this._needMerge) this._merge();
+		return this._set.keys();
+	}
+
+	values() {
+		this._deopt = true;
+		if (this._needMerge) this._merge();
+		return this._set.values();
+	}
+
+	[Symbol.iterator]() {
+		this._deopt = true;
+		if (this._needMerge) this._merge();
+		return this._set[Symbol.iterator]();
+	}
+
+	/* istanbul ignore next */
+	get [Symbol.toStringTag]() {
+		return "LazySet";
+	}
+
+	serialize({ write }) {
+		if (this._needMerge) this._merge();
+		write(this._set.size);
+		for (const item of this._set) write(item);
+	}
+
+	static deserialize({ read }) {
+		const count = read();
+		const items = [];
+		for (let i = 0; i < count; i++) {
+			items.push(read());
+		}
+		return new LazySet(items);
+	}
+}
+
+makeSerializable(LazySet, "webpack/lib/util/LazySet");
+
+module.exports = LazySet;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/MapHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/MapHelpers.js
new file mode 100644
index 0000000..c87b93b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/MapHelpers.js
@@ -0,0 +1,22 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @template K
+ * @template V
+ * @param {Map<K, V>} map a map
+ * @param {K} key the key
+ * @param {function(): V} computer compute value
+ * @returns {V} value
+ */
+exports.provide = (map, key, computer) => {
+	const value = map.get(key);
+	if (value !== undefined) return value;
+	const newValue = computer();
+	map.set(key, newValue);
+	return newValue;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/ParallelismFactorCalculator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/ParallelismFactorCalculator.js
new file mode 100644
index 0000000..cbdda42
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/ParallelismFactorCalculator.js
@@ -0,0 +1,59 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const binarySearchBounds = require("../util/binarySearchBounds");
+
+class ParallelismFactorCalculator {
+	constructor() {
+		this._rangePoints = [];
+		this._rangeCallbacks = [];
+	}
+
+	range(start, end, callback) {
+		if (start === end) return callback(1);
+		this._rangePoints.push(start);
+		this._rangePoints.push(end);
+		this._rangeCallbacks.push(callback);
+	}
+
+	calculate() {
+		const segments = Array.from(new Set(this._rangePoints)).sort((a, b) =>
+			a < b ? -1 : 1
+		);
+		const parallelism = segments.map(() => 0);
+		const rangeStartIndices = [];
+		for (let i = 0; i < this._rangePoints.length; i += 2) {
+			const start = this._rangePoints[i];
+			const end = this._rangePoints[i + 1];
+			let idx = binarySearchBounds.eq(segments, start);
+			rangeStartIndices.push(idx);
+			do {
+				parallelism[idx]++;
+				idx++;
+			} while (segments[idx] < end);
+		}
+		for (let i = 0; i < this._rangeCallbacks.length; i++) {
+			const start = this._rangePoints[i * 2];
+			const end = this._rangePoints[i * 2 + 1];
+			let idx = rangeStartIndices[i];
+			let sum = 0;
+			let totalDuration = 0;
+			let current = start;
+			do {
+				const p = parallelism[idx];
+				idx++;
+				const duration = segments[idx] - current;
+				totalDuration += duration;
+				current = segments[idx];
+				sum += p * duration;
+			} while (current < end);
+			this._rangeCallbacks[i](sum / totalDuration);
+		}
+	}
+}
+
+module.exports = ParallelismFactorCalculator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/Queue.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/Queue.js
new file mode 100644
index 0000000..3b88ec3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/Queue.js
@@ -0,0 +1,51 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @template T
+ */
+class Queue {
+	/**
+	 * @param {Iterable<T>=} items The initial elements.
+	 */
+	constructor(items) {
+		/** @private @type {Set<T>} */
+		this._set = new Set(items);
+		/** @private @type {Iterator<T>} */
+		this._iterator = this._set[Symbol.iterator]();
+	}
+
+	/**
+	 * Returns the number of elements in this queue.
+	 * @returns {number} The number of elements in this queue.
+	 */
+	get length() {
+		return this._set.size;
+	}
+
+	/**
+	 * Appends the specified element to this queue.
+	 * @param {T} item The element to add.
+	 * @returns {void}
+	 */
+	enqueue(item) {
+		this._set.add(item);
+	}
+
+	/**
+	 * Retrieves and removes the head of this queue.
+	 * @returns {T | undefined} The head of the queue of `undefined` if this queue is empty.
+	 */
+	dequeue() {
+		const result = this._iterator.next();
+		if (result.done) return undefined;
+		this._set.delete(result.value);
+		return result.value;
+	}
+}
+
+module.exports = Queue;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/Semaphore.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/Semaphore.js
new file mode 100644
index 0000000..52fdd30
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/Semaphore.js
@@ -0,0 +1,54 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+class Semaphore {
+	/**
+	 * Creates an instance of Semaphore.
+	 *
+	 * @param {number} available the amount available number of "tasks"
+	 * in the Semaphore
+	 */
+	constructor(available) {
+		this.available = available;
+		/** @type {(function(): void)[]} */
+		this.waiters = [];
+		/** @private */
+		this._continue = this._continue.bind(this);
+	}
+
+	/**
+	 * @param {function(): void} callback function block to capture and run
+	 * @returns {void}
+	 */
+	acquire(callback) {
+		if (this.available > 0) {
+			this.available--;
+			callback();
+		} else {
+			this.waiters.push(callback);
+		}
+	}
+
+	release() {
+		this.available++;
+		if (this.waiters.length > 0) {
+			process.nextTick(this._continue);
+		}
+	}
+
+	_continue() {
+		if (this.available > 0) {
+			if (this.waiters.length > 0) {
+				this.available--;
+				const callback = this.waiters.pop();
+				callback();
+			}
+		}
+	}
+}
+
+module.exports = Semaphore;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/SetHelpers.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/SetHelpers.js
new file mode 100644
index 0000000..e102082
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/SetHelpers.js
@@ -0,0 +1,94 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * intersect creates Set containing the intersection of elements between all sets
+ * @template T
+ * @param {Set<T>[]} sets an array of sets being checked for shared elements
+ * @returns {Set<T>} returns a new Set containing the intersecting items
+ */
+const intersect = sets => {
+	if (sets.length === 0) return new Set();
+	if (sets.length === 1) return new Set(sets[0]);
+	let minSize = Infinity;
+	let minIndex = -1;
+	for (let i = 0; i < sets.length; i++) {
+		const size = sets[i].size;
+		if (size < minSize) {
+			minIndex = i;
+			minSize = size;
+		}
+	}
+	const current = new Set(sets[minIndex]);
+	for (let i = 0; i < sets.length; i++) {
+		if (i === minIndex) continue;
+		const set = sets[i];
+		for (const item of current) {
+			if (!set.has(item)) {
+				current.delete(item);
+			}
+		}
+	}
+	return current;
+};
+
+/**
+ * Checks if a set is the subset of another set
+ * @template T
+ * @param {Set<T>} bigSet a Set which contains the original elements to compare against
+ * @param {Set<T>} smallSet the set whose elements might be contained inside of bigSet
+ * @returns {boolean} returns true if smallSet contains all elements inside of the bigSet
+ */
+const isSubset = (bigSet, smallSet) => {
+	if (bigSet.size < smallSet.size) return false;
+	for (const item of smallSet) {
+		if (!bigSet.has(item)) return false;
+	}
+	return true;
+};
+
+/**
+ * @template T
+ * @param {Set<T>} set a set
+ * @param {function(T): boolean} fn selector function
+ * @returns {T | undefined} found item
+ */
+const find = (set, fn) => {
+	for (const item of set) {
+		if (fn(item)) return item;
+	}
+};
+
+/**
+ * @template T
+ * @param {Set<T>} set a set
+ * @returns {T | undefined} first item
+ */
+const first = set => {
+	const entry = set.values().next();
+	return entry.done ? undefined : entry.value;
+};
+
+/**
+ * @template T
+ * @param {Set<T>} a first
+ * @param {Set<T>} b second
+ * @returns {Set<T>} combined set, may be identical to a or b
+ */
+const combine = (a, b) => {
+	if (b.size === 0) return a;
+	if (a.size === 0) return b;
+	const set = new Set(a);
+	for (const item of b) set.add(item);
+	return set;
+};
+
+exports.intersect = intersect;
+exports.isSubset = isSubset;
+exports.find = find;
+exports.first = first;
+exports.combine = combine;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/SortableSet.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/SortableSet.js
new file mode 100644
index 0000000..1010b44
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/SortableSet.js
@@ -0,0 +1,160 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NONE = Symbol("not sorted");
+
+/**
+ * A subset of Set that offers sorting functionality
+ * @template T item type in set
+ * @extends {Set<T>}
+ */
+class SortableSet extends Set {
+	/**
+	 * Create a new sortable set
+	 * @param {Iterable<T>=} initialIterable The initial iterable value
+	 * @typedef {function(T, T): number} SortFunction
+	 * @param {SortFunction=} defaultSort Default sorting function
+	 */
+	constructor(initialIterable, defaultSort) {
+		super(initialIterable);
+		/** @private @type {undefined | function(T, T): number}} */
+		this._sortFn = defaultSort;
+		/** @private @type {typeof NONE | undefined | function(T, T): number}} */
+		this._lastActiveSortFn = NONE;
+		/** @private @type {Map<Function, any> | undefined} */
+		this._cache = undefined;
+		/** @private @type {Map<Function, any> | undefined} */
+		this._cacheOrderIndependent = undefined;
+	}
+
+	/**
+	 * @param {T} value value to add to set
+	 * @returns {this} returns itself
+	 */
+	add(value) {
+		this._lastActiveSortFn = NONE;
+		this._invalidateCache();
+		this._invalidateOrderedCache();
+		super.add(value);
+		return this;
+	}
+
+	/**
+	 * @param {T} value value to delete
+	 * @returns {boolean} true if value existed in set, false otherwise
+	 */
+	delete(value) {
+		this._invalidateCache();
+		this._invalidateOrderedCache();
+		return super.delete(value);
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	clear() {
+		this._invalidateCache();
+		this._invalidateOrderedCache();
+		return super.clear();
+	}
+
+	/**
+	 * Sort with a comparer function
+	 * @param {SortFunction} sortFn Sorting comparer function
+	 * @returns {void}
+	 */
+	sortWith(sortFn) {
+		if (this.size <= 1 || sortFn === this._lastActiveSortFn) {
+			// already sorted - nothing to do
+			return;
+		}
+
+		const sortedArray = Array.from(this).sort(sortFn);
+		super.clear();
+		for (let i = 0; i < sortedArray.length; i += 1) {
+			super.add(sortedArray[i]);
+		}
+		this._lastActiveSortFn = sortFn;
+		this._invalidateCache();
+	}
+
+	sort() {
+		this.sortWith(this._sortFn);
+		return this;
+	}
+
+	/**
+	 * Get data from cache
+	 * @template R
+	 * @param {function(SortableSet<T>): R} fn function to calculate value
+	 * @returns {R} returns result of fn(this), cached until set changes
+	 */
+	getFromCache(fn) {
+		if (this._cache === undefined) {
+			this._cache = new Map();
+		} else {
+			const result = this._cache.get(fn);
+			const data = /** @type {R} */ (result);
+			if (data !== undefined) {
+				return data;
+			}
+		}
+		const newData = fn(this);
+		this._cache.set(fn, newData);
+		return newData;
+	}
+
+	/**
+	 * Get data from cache (ignoring sorting)
+	 * @template R
+	 * @param {function(SortableSet<T>): R} fn function to calculate value
+	 * @returns {R} returns result of fn(this), cached until set changes
+	 */
+	getFromUnorderedCache(fn) {
+		if (this._cacheOrderIndependent === undefined) {
+			this._cacheOrderIndependent = new Map();
+		} else {
+			const result = this._cacheOrderIndependent.get(fn);
+			const data = /** @type {R} */ (result);
+			if (data !== undefined) {
+				return data;
+			}
+		}
+		const newData = fn(this);
+		this._cacheOrderIndependent.set(fn, newData);
+		return newData;
+	}
+
+	/**
+	 * @private
+	 * @returns {void}
+	 */
+	_invalidateCache() {
+		if (this._cache !== undefined) {
+			this._cache.clear();
+		}
+	}
+
+	/**
+	 * @private
+	 * @returns {void}
+	 */
+	_invalidateOrderedCache() {
+		if (this._cacheOrderIndependent !== undefined) {
+			this._cacheOrderIndependent.clear();
+		}
+	}
+
+	/**
+	 * @returns {T[]} the raw array
+	 */
+	toJSON() {
+		return Array.from(this);
+	}
+}
+
+module.exports = SortableSet;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/StackedCacheMap.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/StackedCacheMap.js
new file mode 100644
index 0000000..e0f70a3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/StackedCacheMap.js
@@ -0,0 +1,110 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @template K
+ * @template V
+ */
+class StackedCacheMap {
+	constructor() {
+		/** @type {Map<K, V>} */
+		this.map = new Map();
+		/** @type {ReadonlyMap<K, V>[]} */
+		this.stack = [];
+	}
+
+	/**
+	 * @param {ReadonlyMap<K, V>} map map to add
+	 * @param {boolean} immutable if 'map' is immutable and StackedCacheMap can keep referencing it
+	 */
+	addAll(map, immutable) {
+		if (immutable) {
+			this.stack.push(map);
+
+			// largest map should go first
+			for (let i = this.stack.length - 1; i > 0; i--) {
+				const beforeLast = this.stack[i - 1];
+				if (beforeLast.size >= map.size) break;
+				this.stack[i] = beforeLast;
+				this.stack[i - 1] = map;
+			}
+		} else {
+			for (const [key, value] of map) {
+				this.map.set(key, value);
+			}
+		}
+	}
+
+	/**
+	 * @param {K} item the key of the element to add
+	 * @param {V} value the value of the element to add
+	 * @returns {void}
+	 */
+	set(item, value) {
+		this.map.set(item, value);
+	}
+
+	/**
+	 * @param {K} item the item to delete
+	 * @returns {void}
+	 */
+	delete(item) {
+		throw new Error("Items can't be deleted from a StackedCacheMap");
+	}
+
+	/**
+	 * @param {K} item the item to test
+	 * @returns {boolean} true if the item exists in this set
+	 */
+	has(item) {
+		throw new Error(
+			"Checking StackedCacheMap.has before reading is inefficient, use StackedCacheMap.get and check for undefined"
+		);
+	}
+
+	/**
+	 * @param {K} item the key of the element to return
+	 * @returns {V} the value of the element
+	 */
+	get(item) {
+		for (const map of this.stack) {
+			const value = map.get(item);
+			if (value !== undefined) return value;
+		}
+		return this.map.get(item);
+	}
+
+	clear() {
+		this.stack.length = 0;
+		this.map.clear();
+	}
+
+	get size() {
+		let size = this.map.size;
+		for (const map of this.stack) {
+			size += map.size;
+		}
+		return size;
+	}
+
+	[Symbol.iterator]() {
+		const iterators = this.stack.map(map => map[Symbol.iterator]());
+		let current = this.map[Symbol.iterator]();
+		return {
+			next() {
+				let result = current.next();
+				while (result.done && iterators.length > 0) {
+					current = iterators.pop();
+					result = current.next();
+				}
+				return result;
+			}
+		};
+	}
+}
+
+module.exports = StackedCacheMap;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/StackedMap.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/StackedMap.js
new file mode 100644
index 0000000..bb5e776
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/StackedMap.js
@@ -0,0 +1,166 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const TOMBSTONE = Symbol("tombstone");
+const UNDEFINED_MARKER = Symbol("undefined");
+
+/**
+ * @template T
+ * @typedef {T | undefined} Cell<T>
+ */
+
+/**
+ * @template T
+ * @typedef {T | typeof TOMBSTONE | typeof UNDEFINED_MARKER} InternalCell<T>
+ */
+
+/**
+ * @template K
+ * @template V
+ * @param {[K, InternalCell<V>]} pair the internal cell
+ * @returns {[K, Cell<V>]} its “safe” representation
+ */
+const extractPair = pair => {
+	const key = pair[0];
+	const val = pair[1];
+	if (val === UNDEFINED_MARKER || val === TOMBSTONE) {
+		return [key, undefined];
+	} else {
+		return /** @type {[K, Cell<V>]} */ (pair);
+	}
+};
+
+/**
+ * @template K
+ * @template V
+ */
+class StackedMap {
+	/**
+	 * @param {Map<K, InternalCell<V>>[]=} parentStack an optional parent
+	 */
+	constructor(parentStack) {
+		/** @type {Map<K, InternalCell<V>>} */
+		this.map = new Map();
+		/** @type {Map<K, InternalCell<V>>[]} */
+		this.stack = parentStack === undefined ? [] : parentStack.slice();
+		this.stack.push(this.map);
+	}
+
+	/**
+	 * @param {K} item the key of the element to add
+	 * @param {V} value the value of the element to add
+	 * @returns {void}
+	 */
+	set(item, value) {
+		this.map.set(item, value === undefined ? UNDEFINED_MARKER : value);
+	}
+
+	/**
+	 * @param {K} item the item to delete
+	 * @returns {void}
+	 */
+	delete(item) {
+		if (this.stack.length > 1) {
+			this.map.set(item, TOMBSTONE);
+		} else {
+			this.map.delete(item);
+		}
+	}
+
+	/**
+	 * @param {K} item the item to test
+	 * @returns {boolean} true if the item exists in this set
+	 */
+	has(item) {
+		const topValue = this.map.get(item);
+		if (topValue !== undefined) {
+			return topValue !== TOMBSTONE;
+		}
+		if (this.stack.length > 1) {
+			for (let i = this.stack.length - 2; i >= 0; i--) {
+				const value = this.stack[i].get(item);
+				if (value !== undefined) {
+					this.map.set(item, value);
+					return value !== TOMBSTONE;
+				}
+			}
+			this.map.set(item, TOMBSTONE);
+		}
+		return false;
+	}
+
+	/**
+	 * @param {K} item the key of the element to return
+	 * @returns {Cell<V>} the value of the element
+	 */
+	get(item) {
+		const topValue = this.map.get(item);
+		if (topValue !== undefined) {
+			return topValue === TOMBSTONE || topValue === UNDEFINED_MARKER
+				? undefined
+				: topValue;
+		}
+		if (this.stack.length > 1) {
+			for (let i = this.stack.length - 2; i >= 0; i--) {
+				const value = this.stack[i].get(item);
+				if (value !== undefined) {
+					this.map.set(item, value);
+					return value === TOMBSTONE || value === UNDEFINED_MARKER
+						? undefined
+						: value;
+				}
+			}
+			this.map.set(item, TOMBSTONE);
+		}
+		return undefined;
+	}
+
+	_compress() {
+		if (this.stack.length === 1) return;
+		this.map = new Map();
+		for (const data of this.stack) {
+			for (const pair of data) {
+				if (pair[1] === TOMBSTONE) {
+					this.map.delete(pair[0]);
+				} else {
+					this.map.set(pair[0], pair[1]);
+				}
+			}
+		}
+		this.stack = [this.map];
+	}
+
+	asArray() {
+		this._compress();
+		return Array.from(this.map.keys());
+	}
+
+	asSet() {
+		this._compress();
+		return new Set(this.map.keys());
+	}
+
+	asPairArray() {
+		this._compress();
+		return Array.from(this.map.entries(), extractPair);
+	}
+
+	asMap() {
+		return new Map(this.asPairArray());
+	}
+
+	get size() {
+		this._compress();
+		return this.map.size;
+	}
+
+	createChild() {
+		return new StackedMap(this.stack);
+	}
+}
+
+module.exports = StackedMap;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/StringXor.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/StringXor.js
new file mode 100644
index 0000000..e6b2658
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/StringXor.js
@@ -0,0 +1,55 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+class StringXor {
+	constructor() {
+		this._value = undefined;
+	}
+
+	/**
+	 * @param {string} str string
+	 * @returns {void}
+	 */
+	add(str) {
+		const len = str.length;
+		const value = this._value;
+		if (value === undefined) {
+			const newValue = (this._value = Buffer.allocUnsafe(len));
+			for (let i = 0; i < len; i++) {
+				newValue[i] = str.charCodeAt(i);
+			}
+			return;
+		}
+		const valueLen = value.length;
+		if (valueLen < len) {
+			const newValue = (this._value = Buffer.allocUnsafe(len));
+			let i;
+			for (i = 0; i < valueLen; i++) {
+				newValue[i] = value[i] ^ str.charCodeAt(i);
+			}
+			for (; i < len; i++) {
+				newValue[i] = str.charCodeAt(i);
+			}
+		} else {
+			for (let i = 0; i < len; i++) {
+				value[i] = value[i] ^ str.charCodeAt(i);
+			}
+		}
+	}
+
+	toString() {
+		const value = this._value;
+		return value === undefined ? "" : value.toString("latin1");
+	}
+
+	updateHash(hash) {
+		const value = this._value;
+		if (value !== undefined) hash.update(value);
+	}
+}
+
+module.exports = StringXor;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/TupleQueue.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/TupleQueue.js
new file mode 100644
index 0000000..625df7f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/TupleQueue.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const TupleSet = require("./TupleSet");
+
+/**
+ * @template {any[]} T
+ */
+class TupleQueue {
+	/**
+	 * @param {Iterable<T>=} items The initial elements.
+	 */
+	constructor(items) {
+		/** @private @type {TupleSet<T>} */
+		this._set = new TupleSet(items);
+		/** @private @type {Iterator<T>} */
+		this._iterator = this._set[Symbol.iterator]();
+	}
+
+	/**
+	 * Returns the number of elements in this queue.
+	 * @returns {number} The number of elements in this queue.
+	 */
+	get length() {
+		return this._set.size;
+	}
+
+	/**
+	 * Appends the specified element to this queue.
+	 * @param {T} item The element to add.
+	 * @returns {void}
+	 */
+	enqueue(...item) {
+		this._set.add(...item);
+	}
+
+	/**
+	 * Retrieves and removes the head of this queue.
+	 * @returns {T | undefined} The head of the queue of `undefined` if this queue is empty.
+	 */
+	dequeue() {
+		const result = this._iterator.next();
+		if (result.done) {
+			if (this._set.size > 0) {
+				this._iterator = this._set[Symbol.iterator]();
+				const value = this._iterator.next().value;
+				this._set.delete(...value);
+				return value;
+			}
+			return undefined;
+		}
+		this._set.delete(...result.value);
+		return result.value;
+	}
+}
+
+module.exports = TupleQueue;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/TupleSet.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/TupleSet.js
new file mode 100644
index 0000000..fe33c36
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/TupleSet.js
@@ -0,0 +1,150 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @template {any[]} T
+ */
+class TupleSet {
+	constructor(init) {
+		this._map = new Map();
+		this.size = 0;
+		if (init) {
+			for (const tuple of init) {
+				this.add(...tuple);
+			}
+		}
+	}
+
+	/**
+	 * @param  {T} args tuple
+	 * @returns {void}
+	 */
+	add(...args) {
+		let map = this._map;
+		for (let i = 0; i < args.length - 2; i++) {
+			const arg = args[i];
+			const innerMap = map.get(arg);
+			if (innerMap === undefined) {
+				map.set(arg, (map = new Map()));
+			} else {
+				map = innerMap;
+			}
+		}
+
+		const beforeLast = args[args.length - 2];
+		let set = map.get(beforeLast);
+		if (set === undefined) {
+			map.set(beforeLast, (set = new Set()));
+		}
+
+		const last = args[args.length - 1];
+		this.size -= set.size;
+		set.add(last);
+		this.size += set.size;
+	}
+
+	/**
+	 * @param  {T} args tuple
+	 * @returns {boolean} true, if the tuple is in the Set
+	 */
+	has(...args) {
+		let map = this._map;
+		for (let i = 0; i < args.length - 2; i++) {
+			const arg = args[i];
+			map = map.get(arg);
+			if (map === undefined) {
+				return false;
+			}
+		}
+
+		const beforeLast = args[args.length - 2];
+		let set = map.get(beforeLast);
+		if (set === undefined) {
+			return false;
+		}
+
+		const last = args[args.length - 1];
+		return set.has(last);
+	}
+
+	/**
+	 * @param {T} args tuple
+	 * @returns {void}
+	 */
+	delete(...args) {
+		let map = this._map;
+		for (let i = 0; i < args.length - 2; i++) {
+			const arg = args[i];
+			map = map.get(arg);
+			if (map === undefined) {
+				return;
+			}
+		}
+
+		const beforeLast = args[args.length - 2];
+		let set = map.get(beforeLast);
+		if (set === undefined) {
+			return;
+		}
+
+		const last = args[args.length - 1];
+		this.size -= set.size;
+		set.delete(last);
+		this.size += set.size;
+	}
+
+	/**
+	 * @returns {Iterator<T>} iterator
+	 */
+	[Symbol.iterator]() {
+		const iteratorStack = [];
+		const tuple = [];
+		let currentSetIterator = undefined;
+
+		const next = it => {
+			const result = it.next();
+			if (result.done) {
+				if (iteratorStack.length === 0) return false;
+				tuple.pop();
+				return next(iteratorStack.pop());
+			}
+			const [key, value] = result.value;
+			iteratorStack.push(it);
+			tuple.push(key);
+			if (value instanceof Set) {
+				currentSetIterator = value[Symbol.iterator]();
+				return true;
+			} else {
+				return next(value[Symbol.iterator]());
+			}
+		};
+
+		next(this._map[Symbol.iterator]());
+
+		return {
+			next() {
+				while (currentSetIterator) {
+					const result = currentSetIterator.next();
+					if (result.done) {
+						tuple.pop();
+						if (!next(iteratorStack.pop())) {
+							currentSetIterator = undefined;
+						}
+					} else {
+						return {
+							done: false,
+							value: /** @type {T} */ (tuple.concat(result.value))
+						};
+					}
+				}
+				return { done: true, value: undefined };
+			}
+		};
+	}
+}
+
+module.exports = TupleSet;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/URLAbsoluteSpecifier.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/URLAbsoluteSpecifier.js
new file mode 100644
index 0000000..f9fda91
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/URLAbsoluteSpecifier.js
@@ -0,0 +1,87 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+/** @typedef {import("./fs").InputFileSystem} InputFileSystem */
+/** @typedef {(error: Error|null, result?: Buffer) => void} ErrorFirstCallback */
+
+const backSlashCharCode = "\\".charCodeAt(0);
+const slashCharCode = "/".charCodeAt(0);
+const aLowerCaseCharCode = "a".charCodeAt(0);
+const zLowerCaseCharCode = "z".charCodeAt(0);
+const aUpperCaseCharCode = "A".charCodeAt(0);
+const zUpperCaseCharCode = "Z".charCodeAt(0);
+const _0CharCode = "0".charCodeAt(0);
+const _9CharCode = "9".charCodeAt(0);
+const plusCharCode = "+".charCodeAt(0);
+const hyphenCharCode = "-".charCodeAt(0);
+const colonCharCode = ":".charCodeAt(0);
+const hashCharCode = "#".charCodeAt(0);
+const queryCharCode = "?".charCodeAt(0);
+/**
+ * Get scheme if specifier is an absolute URL specifier
+ * e.g. Absolute specifiers like 'file:///user/webpack/index.js'
+ * https://tools.ietf.org/html/rfc3986#section-3.1
+ * @param {string} specifier specifier
+ * @returns {string|undefined} scheme if absolute URL specifier provided
+ */
+function getScheme(specifier) {
+	const start = specifier.charCodeAt(0);
+
+	// First char maybe only a letter
+	if (
+		(start < aLowerCaseCharCode || start > zLowerCaseCharCode) &&
+		(start < aUpperCaseCharCode || start > zUpperCaseCharCode)
+	) {
+		return undefined;
+	}
+
+	let i = 1;
+	let ch = specifier.charCodeAt(i);
+
+	while (
+		(ch >= aLowerCaseCharCode && ch <= zLowerCaseCharCode) ||
+		(ch >= aUpperCaseCharCode && ch <= zUpperCaseCharCode) ||
+		(ch >= _0CharCode && ch <= _9CharCode) ||
+		ch === plusCharCode ||
+		ch === hyphenCharCode
+	) {
+		if (++i === specifier.length) return undefined;
+		ch = specifier.charCodeAt(i);
+	}
+
+	// Scheme must end with colon
+	if (ch !== colonCharCode) return undefined;
+
+	// Check for Windows absolute path
+	// https://url.spec.whatwg.org/#url-miscellaneous
+	if (i === 1) {
+		const nextChar = i + 1 < specifier.length ? specifier.charCodeAt(i + 1) : 0;
+		if (
+			nextChar === 0 ||
+			nextChar === backSlashCharCode ||
+			nextChar === slashCharCode ||
+			nextChar === hashCharCode ||
+			nextChar === queryCharCode
+		) {
+			return undefined;
+		}
+	}
+
+	return specifier.slice(0, i).toLowerCase();
+}
+
+/**
+ * @param {string} specifier specifier
+ * @returns {string|null} protocol if absolute URL specifier provided
+ */
+function getProtocol(specifier) {
+	const scheme = getScheme(specifier);
+	return scheme === undefined ? undefined : scheme + ":";
+}
+
+exports.getScheme = getScheme;
+exports.getProtocol = getProtocol;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/WeakTupleMap.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/WeakTupleMap.js
new file mode 100644
index 0000000..6df2980
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/WeakTupleMap.js
@@ -0,0 +1,171 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const isWeakKey = thing => typeof thing === "object" && thing !== null;
+
+/**
+ * @template {any[]} T
+ * @template V
+ */
+class WeakTupleMap {
+	constructor() {
+		/** @private */
+		this.f = 0;
+		/** @private @type {any} */
+		this.v = undefined;
+		/** @private @type {Map<object, WeakTupleMap<T, V>> | undefined} */
+		this.m = undefined;
+		/** @private @type {WeakMap<object, WeakTupleMap<T, V>> | undefined} */
+		this.w = undefined;
+	}
+
+	/**
+	 * @param {[...T, V]} args tuple
+	 * @returns {void}
+	 */
+	set(...args) {
+		/** @type {WeakTupleMap<T, V>} */
+		let node = this;
+		for (let i = 0; i < args.length - 1; i++) {
+			node = node._get(args[i]);
+		}
+		node._setValue(args[args.length - 1]);
+	}
+
+	/**
+	 * @param {T} args tuple
+	 * @returns {boolean} true, if the tuple is in the Set
+	 */
+	has(...args) {
+		/** @type {WeakTupleMap<T, V>} */
+		let node = this;
+		for (let i = 0; i < args.length; i++) {
+			node = node._peek(args[i]);
+			if (node === undefined) return false;
+		}
+		return node._hasValue();
+	}
+
+	/**
+	 * @param {T} args tuple
+	 * @returns {V} the value
+	 */
+	get(...args) {
+		/** @type {WeakTupleMap<T, V>} */
+		let node = this;
+		for (let i = 0; i < args.length; i++) {
+			node = node._peek(args[i]);
+			if (node === undefined) return undefined;
+		}
+		return node._getValue();
+	}
+
+	/**
+	 * @param {[...T, function(): V]} args tuple
+	 * @returns {V} the value
+	 */
+	provide(...args) {
+		/** @type {WeakTupleMap<T, V>} */
+		let node = this;
+		for (let i = 0; i < args.length - 1; i++) {
+			node = node._get(args[i]);
+		}
+		if (node._hasValue()) return node._getValue();
+		const fn = args[args.length - 1];
+		const newValue = fn(...args.slice(0, -1));
+		node._setValue(newValue);
+		return newValue;
+	}
+
+	/**
+	 * @param {T} args tuple
+	 * @returns {void}
+	 */
+	delete(...args) {
+		/** @type {WeakTupleMap<T, V>} */
+		let node = this;
+		for (let i = 0; i < args.length; i++) {
+			node = node._peek(args[i]);
+			if (node === undefined) return;
+		}
+		node._deleteValue();
+	}
+
+	/**
+	 * @returns {void}
+	 */
+	clear() {
+		this.f = 0;
+		this.v = undefined;
+		this.w = undefined;
+		this.m = undefined;
+	}
+
+	_getValue() {
+		return this.v;
+	}
+
+	_hasValue() {
+		return (this.f & 1) === 1;
+	}
+
+	_setValue(v) {
+		this.f |= 1;
+		this.v = v;
+	}
+
+	_deleteValue() {
+		this.f &= 6;
+		this.v = undefined;
+	}
+
+	_peek(thing) {
+		if (isWeakKey(thing)) {
+			if ((this.f & 4) !== 4) return undefined;
+			return this.w.get(thing);
+		} else {
+			if ((this.f & 2) !== 2) return undefined;
+			return this.m.get(thing);
+		}
+	}
+
+	_get(thing) {
+		if (isWeakKey(thing)) {
+			if ((this.f & 4) !== 4) {
+				const newMap = new WeakMap();
+				this.f |= 4;
+				const newNode = new WeakTupleMap();
+				(this.w = newMap).set(thing, newNode);
+				return newNode;
+			}
+			const entry = this.w.get(thing);
+			if (entry !== undefined) {
+				return entry;
+			}
+			const newNode = new WeakTupleMap();
+			this.w.set(thing, newNode);
+			return newNode;
+		} else {
+			if ((this.f & 2) !== 2) {
+				const newMap = new Map();
+				this.f |= 2;
+				const newNode = new WeakTupleMap();
+				(this.m = newMap).set(thing, newNode);
+				return newNode;
+			}
+			const entry = this.m.get(thing);
+			if (entry !== undefined) {
+				return entry;
+			}
+			const newNode = new WeakTupleMap();
+			this.m.set(thing, newNode);
+			return newNode;
+		}
+	}
+}
+
+module.exports = WeakTupleMap;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/binarySearchBounds.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/binarySearchBounds.js
new file mode 100644
index 0000000..5bc506a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/binarySearchBounds.js
@@ -0,0 +1,86 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Mikola Lysenko @mikolalysenko
+*/
+
+"use strict";
+
+/* cspell:disable-next-line */
+// Refactor: Peter Somogyvari @petermetz
+
+const compileSearch = (funcName, predicate, reversed, extraArgs, earlyOut) => {
+	const code = [
+		"function ",
+		funcName,
+		"(a,l,h,",
+		extraArgs.join(","),
+		"){",
+		earlyOut ? "" : "var i=",
+		reversed ? "l-1" : "h+1",
+		";while(l<=h){var m=(l+h)>>>1,x=a[m]"
+	];
+
+	if (earlyOut) {
+		if (predicate.indexOf("c") < 0) {
+			code.push(";if(x===y){return m}else if(x<=y){");
+		} else {
+			code.push(";var p=c(x,y);if(p===0){return m}else if(p<=0){");
+		}
+	} else {
+		code.push(";if(", predicate, "){i=m;");
+	}
+	if (reversed) {
+		code.push("l=m+1}else{h=m-1}");
+	} else {
+		code.push("h=m-1}else{l=m+1}");
+	}
+	code.push("}");
+	if (earlyOut) {
+		code.push("return -1};");
+	} else {
+		code.push("return i};");
+	}
+	return code.join("");
+};
+
+const compileBoundsSearch = (predicate, reversed, suffix, earlyOut) => {
+	const arg1 = compileSearch(
+		"A",
+		"x" + predicate + "y",
+		reversed,
+		["y"],
+		earlyOut
+	);
+
+	const arg2 = compileSearch(
+		"P",
+		"c(x,y)" + predicate + "0",
+		reversed,
+		["y", "c"],
+		earlyOut
+	);
+
+	const fnHeader = "function dispatchBinarySearch";
+
+	const fnBody =
+		"(a,y,c,l,h){\
+if(typeof(c)==='function'){\
+return P(a,(l===void 0)?0:l|0,(h===void 0)?a.length-1:h|0,y,c)\
+}else{\
+return A(a,(c===void 0)?0:c|0,(l===void 0)?a.length-1:l|0,y)\
+}}\
+return dispatchBinarySearch";
+
+	const fnArgList = [arg1, arg2, fnHeader, suffix, fnBody, suffix];
+	const fnSource = fnArgList.join("");
+	const result = new Function(fnSource);
+	return result();
+};
+
+module.exports = {
+	ge: compileBoundsSearch(">=", false, "GE"),
+	gt: compileBoundsSearch(">", false, "GT"),
+	lt: compileBoundsSearch("<", true, "LT"),
+	le: compileBoundsSearch("<=", true, "LE"),
+	eq: compileBoundsSearch("-", true, "EQ", true)
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/cleverMerge.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/cleverMerge.js
new file mode 100644
index 0000000..f86934c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/cleverMerge.js
@@ -0,0 +1,568 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @type {WeakMap<object, WeakMap<object, object>>} */
+const mergeCache = new WeakMap();
+/** @type {WeakMap<object, Map<string, Map<string|number|boolean, object>>>} */
+const setPropertyCache = new WeakMap();
+const DELETE = Symbol("DELETE");
+const DYNAMIC_INFO = Symbol("cleverMerge dynamic info");
+
+/**
+ * Merges two given objects and caches the result to avoid computation if same objects passed as arguments again.
+ * @template T
+ * @template O
+ * @example
+ * // performs cleverMerge(first, second), stores the result in WeakMap and returns result
+ * cachedCleverMerge({a: 1}, {a: 2})
+ * {a: 2}
+ *  // when same arguments passed, gets the result from WeakMap and returns it.
+ * cachedCleverMerge({a: 1}, {a: 2})
+ * {a: 2}
+ * @param {T} first first object
+ * @param {O} second second object
+ * @returns {T & O | T | O} merged object of first and second object
+ */
+const cachedCleverMerge = (first, second) => {
+	if (second === undefined) return first;
+	if (first === undefined) return second;
+	if (typeof second !== "object" || second === null) return second;
+	if (typeof first !== "object" || first === null) return first;
+
+	let innerCache = mergeCache.get(first);
+	if (innerCache === undefined) {
+		innerCache = new WeakMap();
+		mergeCache.set(first, innerCache);
+	}
+	const prevMerge = innerCache.get(second);
+	if (prevMerge !== undefined) return prevMerge;
+	const newMerge = _cleverMerge(first, second, true);
+	innerCache.set(second, newMerge);
+	return newMerge;
+};
+
+/**
+ * @template T
+ * @param {Partial<T>} obj object
+ * @param {string} property property
+ * @param {string|number|boolean} value assignment value
+ * @returns {T} new object
+ */
+const cachedSetProperty = (obj, property, value) => {
+	let mapByProperty = setPropertyCache.get(obj);
+
+	if (mapByProperty === undefined) {
+		mapByProperty = new Map();
+		setPropertyCache.set(obj, mapByProperty);
+	}
+
+	let mapByValue = mapByProperty.get(property);
+
+	if (mapByValue === undefined) {
+		mapByValue = new Map();
+		mapByProperty.set(property, mapByValue);
+	}
+
+	let result = mapByValue.get(value);
+
+	if (result) return result;
+
+	result = {
+		...obj,
+		[property]: value
+	};
+	mapByValue.set(value, result);
+
+	return result;
+};
+
+/**
+ * @typedef {Object} ObjectParsedPropertyEntry
+ * @property {any | undefined} base base value
+ * @property {string | undefined} byProperty the name of the selector property
+ * @property {Map<string, any>} byValues value depending on selector property, merged with base
+ */
+
+/**
+ * @typedef {Object} ParsedObject
+ * @property {Map<string, ObjectParsedPropertyEntry>} static static properties (key is property name)
+ * @property {{ byProperty: string, fn: Function } | undefined} dynamic dynamic part
+ */
+
+/** @type {WeakMap<object, ParsedObject>} */
+const parseCache = new WeakMap();
+
+/**
+ * @param {object} obj the object
+ * @returns {ParsedObject} parsed object
+ */
+const cachedParseObject = obj => {
+	const entry = parseCache.get(obj);
+	if (entry !== undefined) return entry;
+	const result = parseObject(obj);
+	parseCache.set(obj, result);
+	return result;
+};
+
+/**
+ * @param {object} obj the object
+ * @returns {ParsedObject} parsed object
+ */
+const parseObject = obj => {
+	const info = new Map();
+	let dynamicInfo;
+	const getInfo = p => {
+		const entry = info.get(p);
+		if (entry !== undefined) return entry;
+		const newEntry = {
+			base: undefined,
+			byProperty: undefined,
+			byValues: undefined
+		};
+		info.set(p, newEntry);
+		return newEntry;
+	};
+	for (const key of Object.keys(obj)) {
+		if (key.startsWith("by")) {
+			const byProperty = key;
+			const byObj = obj[byProperty];
+			if (typeof byObj === "object") {
+				for (const byValue of Object.keys(byObj)) {
+					const obj = byObj[byValue];
+					for (const key of Object.keys(obj)) {
+						const entry = getInfo(key);
+						if (entry.byProperty === undefined) {
+							entry.byProperty = byProperty;
+							entry.byValues = new Map();
+						} else if (entry.byProperty !== byProperty) {
+							throw new Error(
+								`${byProperty} and ${entry.byProperty} for a single property is not supported`
+							);
+						}
+						entry.byValues.set(byValue, obj[key]);
+						if (byValue === "default") {
+							for (const otherByValue of Object.keys(byObj)) {
+								if (!entry.byValues.has(otherByValue))
+									entry.byValues.set(otherByValue, undefined);
+							}
+						}
+					}
+				}
+			} else if (typeof byObj === "function") {
+				if (dynamicInfo === undefined) {
+					dynamicInfo = {
+						byProperty: key,
+						fn: byObj
+					};
+				} else {
+					throw new Error(
+						`${key} and ${dynamicInfo.byProperty} when both are functions is not supported`
+					);
+				}
+			} else {
+				const entry = getInfo(key);
+				entry.base = obj[key];
+			}
+		} else {
+			const entry = getInfo(key);
+			entry.base = obj[key];
+		}
+	}
+	return {
+		static: info,
+		dynamic: dynamicInfo
+	};
+};
+
+/**
+ * @param {Map<string, ObjectParsedPropertyEntry>} info static properties (key is property name)
+ * @param {{ byProperty: string, fn: Function } | undefined} dynamicInfo dynamic part
+ * @returns {object} the object
+ */
+const serializeObject = (info, dynamicInfo) => {
+	const obj = {};
+	// Setup byProperty structure
+	for (const entry of info.values()) {
+		if (entry.byProperty !== undefined) {
+			const byObj = (obj[entry.byProperty] = obj[entry.byProperty] || {});
+			for (const byValue of entry.byValues.keys()) {
+				byObj[byValue] = byObj[byValue] || {};
+			}
+		}
+	}
+	for (const [key, entry] of info) {
+		if (entry.base !== undefined) {
+			obj[key] = entry.base;
+		}
+		// Fill byProperty structure
+		if (entry.byProperty !== undefined) {
+			const byObj = (obj[entry.byProperty] = obj[entry.byProperty] || {});
+			for (const byValue of Object.keys(byObj)) {
+				const value = getFromByValues(entry.byValues, byValue);
+				if (value !== undefined) byObj[byValue][key] = value;
+			}
+		}
+	}
+	if (dynamicInfo !== undefined) {
+		obj[dynamicInfo.byProperty] = dynamicInfo.fn;
+	}
+	return obj;
+};
+
+const VALUE_TYPE_UNDEFINED = 0;
+const VALUE_TYPE_ATOM = 1;
+const VALUE_TYPE_ARRAY_EXTEND = 2;
+const VALUE_TYPE_OBJECT = 3;
+const VALUE_TYPE_DELETE = 4;
+
+/**
+ * @param {any} value a single value
+ * @returns {VALUE_TYPE_UNDEFINED | VALUE_TYPE_ATOM | VALUE_TYPE_ARRAY_EXTEND | VALUE_TYPE_OBJECT | VALUE_TYPE_DELETE} value type
+ */
+const getValueType = value => {
+	if (value === undefined) {
+		return VALUE_TYPE_UNDEFINED;
+	} else if (value === DELETE) {
+		return VALUE_TYPE_DELETE;
+	} else if (Array.isArray(value)) {
+		if (value.lastIndexOf("...") !== -1) return VALUE_TYPE_ARRAY_EXTEND;
+		return VALUE_TYPE_ATOM;
+	} else if (
+		typeof value === "object" &&
+		value !== null &&
+		(!value.constructor || value.constructor === Object)
+	) {
+		return VALUE_TYPE_OBJECT;
+	}
+	return VALUE_TYPE_ATOM;
+};
+
+/**
+ * Merges two objects. Objects are deeply clever merged.
+ * Arrays might reference the old value with "...".
+ * Non-object values take preference over object values.
+ * @template T
+ * @template O
+ * @param {T} first first object
+ * @param {O} second second object
+ * @returns {T & O | T | O} merged object of first and second object
+ */
+const cleverMerge = (first, second) => {
+	if (second === undefined) return first;
+	if (first === undefined) return second;
+	if (typeof second !== "object" || second === null) return second;
+	if (typeof first !== "object" || first === null) return first;
+
+	return _cleverMerge(first, second, false);
+};
+
+/**
+ * Merges two objects. Objects are deeply clever merged.
+ * @param {object} first first object
+ * @param {object} second second object
+ * @param {boolean} internalCaching should parsing of objects and nested merges be cached
+ * @returns {object} merged object of first and second object
+ */
+const _cleverMerge = (first, second, internalCaching = false) => {
+	const firstObject = internalCaching
+		? cachedParseObject(first)
+		: parseObject(first);
+	const { static: firstInfo, dynamic: firstDynamicInfo } = firstObject;
+
+	// If the first argument has a dynamic part we modify the dynamic part to merge the second argument
+	if (firstDynamicInfo !== undefined) {
+		let { byProperty, fn } = firstDynamicInfo;
+		const fnInfo = fn[DYNAMIC_INFO];
+		if (fnInfo) {
+			second = internalCaching
+				? cachedCleverMerge(fnInfo[1], second)
+				: cleverMerge(fnInfo[1], second);
+			fn = fnInfo[0];
+		}
+		const newFn = (...args) => {
+			const fnResult = fn(...args);
+			return internalCaching
+				? cachedCleverMerge(fnResult, second)
+				: cleverMerge(fnResult, second);
+		};
+		newFn[DYNAMIC_INFO] = [fn, second];
+		return serializeObject(firstObject.static, { byProperty, fn: newFn });
+	}
+
+	// If the first part is static only, we merge the static parts and keep the dynamic part of the second argument
+	const secondObject = internalCaching
+		? cachedParseObject(second)
+		: parseObject(second);
+	const { static: secondInfo, dynamic: secondDynamicInfo } = secondObject;
+	/** @type {Map<string, ObjectParsedPropertyEntry>} */
+	const resultInfo = new Map();
+	for (const [key, firstEntry] of firstInfo) {
+		const secondEntry = secondInfo.get(key);
+		const entry =
+			secondEntry !== undefined
+				? mergeEntries(firstEntry, secondEntry, internalCaching)
+				: firstEntry;
+		resultInfo.set(key, entry);
+	}
+	for (const [key, secondEntry] of secondInfo) {
+		if (!firstInfo.has(key)) {
+			resultInfo.set(key, secondEntry);
+		}
+	}
+	return serializeObject(resultInfo, secondDynamicInfo);
+};
+
+/**
+ * @param {ObjectParsedPropertyEntry} firstEntry a
+ * @param {ObjectParsedPropertyEntry} secondEntry b
+ * @param {boolean} internalCaching should parsing of objects and nested merges be cached
+ * @returns {ObjectParsedPropertyEntry} new entry
+ */
+const mergeEntries = (firstEntry, secondEntry, internalCaching) => {
+	switch (getValueType(secondEntry.base)) {
+		case VALUE_TYPE_ATOM:
+		case VALUE_TYPE_DELETE:
+			// No need to consider firstEntry at all
+			// second value override everything
+			// = second.base + second.byProperty
+			return secondEntry;
+		case VALUE_TYPE_UNDEFINED:
+			if (!firstEntry.byProperty) {
+				// = first.base + second.byProperty
+				return {
+					base: firstEntry.base,
+					byProperty: secondEntry.byProperty,
+					byValues: secondEntry.byValues
+				};
+			} else if (firstEntry.byProperty !== secondEntry.byProperty) {
+				throw new Error(
+					`${firstEntry.byProperty} and ${secondEntry.byProperty} for a single property is not supported`
+				);
+			} else {
+				// = first.base + (first.byProperty + second.byProperty)
+				// need to merge first and second byValues
+				const newByValues = new Map(firstEntry.byValues);
+				for (const [key, value] of secondEntry.byValues) {
+					const firstValue = getFromByValues(firstEntry.byValues, key);
+					newByValues.set(
+						key,
+						mergeSingleValue(firstValue, value, internalCaching)
+					);
+				}
+				return {
+					base: firstEntry.base,
+					byProperty: firstEntry.byProperty,
+					byValues: newByValues
+				};
+			}
+		default: {
+			if (!firstEntry.byProperty) {
+				// The simple case
+				// = (first.base + second.base) + second.byProperty
+				return {
+					base: mergeSingleValue(
+						firstEntry.base,
+						secondEntry.base,
+						internalCaching
+					),
+					byProperty: secondEntry.byProperty,
+					byValues: secondEntry.byValues
+				};
+			}
+			let newBase;
+			const intermediateByValues = new Map(firstEntry.byValues);
+			for (const [key, value] of intermediateByValues) {
+				intermediateByValues.set(
+					key,
+					mergeSingleValue(value, secondEntry.base, internalCaching)
+				);
+			}
+			if (
+				Array.from(firstEntry.byValues.values()).every(value => {
+					const type = getValueType(value);
+					return type === VALUE_TYPE_ATOM || type === VALUE_TYPE_DELETE;
+				})
+			) {
+				// = (first.base + second.base) + ((first.byProperty + second.base) + second.byProperty)
+				newBase = mergeSingleValue(
+					firstEntry.base,
+					secondEntry.base,
+					internalCaching
+				);
+			} else {
+				// = first.base + ((first.byProperty (+default) + second.base) + second.byProperty)
+				newBase = firstEntry.base;
+				if (!intermediateByValues.has("default"))
+					intermediateByValues.set("default", secondEntry.base);
+			}
+			if (!secondEntry.byProperty) {
+				// = first.base + (first.byProperty + second.base)
+				return {
+					base: newBase,
+					byProperty: firstEntry.byProperty,
+					byValues: intermediateByValues
+				};
+			} else if (firstEntry.byProperty !== secondEntry.byProperty) {
+				throw new Error(
+					`${firstEntry.byProperty} and ${secondEntry.byProperty} for a single property is not supported`
+				);
+			}
+			const newByValues = new Map(intermediateByValues);
+			for (const [key, value] of secondEntry.byValues) {
+				const firstValue = getFromByValues(intermediateByValues, key);
+				newByValues.set(
+					key,
+					mergeSingleValue(firstValue, value, internalCaching)
+				);
+			}
+			return {
+				base: newBase,
+				byProperty: firstEntry.byProperty,
+				byValues: newByValues
+			};
+		}
+	}
+};
+
+/**
+ * @param {Map<string, any>} byValues all values
+ * @param {string} key value of the selector
+ * @returns {any | undefined} value
+ */
+const getFromByValues = (byValues, key) => {
+	if (key !== "default" && byValues.has(key)) {
+		return byValues.get(key);
+	}
+	return byValues.get("default");
+};
+
+/**
+ * @param {any} a value
+ * @param {any} b value
+ * @param {boolean} internalCaching should parsing of objects and nested merges be cached
+ * @returns {any} value
+ */
+const mergeSingleValue = (a, b, internalCaching) => {
+	const bType = getValueType(b);
+	const aType = getValueType(a);
+	switch (bType) {
+		case VALUE_TYPE_DELETE:
+		case VALUE_TYPE_ATOM:
+			return b;
+		case VALUE_TYPE_OBJECT: {
+			return aType !== VALUE_TYPE_OBJECT
+				? b
+				: internalCaching
+				? cachedCleverMerge(a, b)
+				: cleverMerge(a, b);
+		}
+		case VALUE_TYPE_UNDEFINED:
+			return a;
+		case VALUE_TYPE_ARRAY_EXTEND:
+			switch (
+				aType !== VALUE_TYPE_ATOM
+					? aType
+					: Array.isArray(a)
+					? VALUE_TYPE_ARRAY_EXTEND
+					: VALUE_TYPE_OBJECT
+			) {
+				case VALUE_TYPE_UNDEFINED:
+					return b;
+				case VALUE_TYPE_DELETE:
+					return b.filter(item => item !== "...");
+				case VALUE_TYPE_ARRAY_EXTEND: {
+					const newArray = [];
+					for (const item of b) {
+						if (item === "...") {
+							for (const item of a) {
+								newArray.push(item);
+							}
+						} else {
+							newArray.push(item);
+						}
+					}
+					return newArray;
+				}
+				case VALUE_TYPE_OBJECT:
+					return b.map(item => (item === "..." ? a : item));
+				default:
+					throw new Error("Not implemented");
+			}
+		default:
+			throw new Error("Not implemented");
+	}
+};
+
+/**
+ * @template T
+ * @param {T} obj the object
+ * @returns {T} the object without operations like "..." or DELETE
+ */
+const removeOperations = obj => {
+	const newObj = /** @type {T} */ ({});
+	for (const key of Object.keys(obj)) {
+		const value = obj[key];
+		const type = getValueType(value);
+		switch (type) {
+			case VALUE_TYPE_UNDEFINED:
+			case VALUE_TYPE_DELETE:
+				break;
+			case VALUE_TYPE_OBJECT:
+				newObj[key] = removeOperations(value);
+				break;
+			case VALUE_TYPE_ARRAY_EXTEND:
+				newObj[key] = value.filter(i => i !== "...");
+				break;
+			default:
+				newObj[key] = value;
+				break;
+		}
+	}
+	return newObj;
+};
+
+/**
+ * @template T
+ * @template {string} P
+ * @param {T} obj the object
+ * @param {P} byProperty the by description
+ * @param  {...any} values values
+ * @returns {Omit<T, P>} object with merged byProperty
+ */
+const resolveByProperty = (obj, byProperty, ...values) => {
+	if (typeof obj !== "object" || obj === null || !(byProperty in obj)) {
+		return obj;
+	}
+	const { [byProperty]: _byValue, ..._remaining } = /** @type {object} */ (obj);
+	const remaining = /** @type {T} */ (_remaining);
+	const byValue = /** @type {Record<string, T> | function(...any[]): T} */ (
+		_byValue
+	);
+	if (typeof byValue === "object") {
+		const key = values[0];
+		if (key in byValue) {
+			return cachedCleverMerge(remaining, byValue[key]);
+		} else if ("default" in byValue) {
+			return cachedCleverMerge(remaining, byValue.default);
+		} else {
+			return /** @type {T} */ (remaining);
+		}
+	} else if (typeof byValue === "function") {
+		const result = byValue.apply(null, values);
+		return cachedCleverMerge(
+			remaining,
+			resolveByProperty(result, byProperty, ...values)
+		);
+	}
+};
+
+exports.cachedSetProperty = cachedSetProperty;
+exports.cachedCleverMerge = cachedCleverMerge;
+exports.cleverMerge = cleverMerge;
+exports.resolveByProperty = resolveByProperty;
+exports.removeOperations = removeOperations;
+exports.DELETE = DELETE;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/comparators.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/comparators.js
new file mode 100644
index 0000000..790c147
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/comparators.js
@@ -0,0 +1,459 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { compareRuntime } = require("./runtime");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../ChunkGroup")} ChunkGroup */
+/** @typedef {import("../Dependency").DependencyLocation} DependencyLocation */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+
+/** @template T @typedef {function(T, T): -1|0|1} Comparator */
+/** @template TArg @template T @typedef {function(TArg, T, T): -1|0|1} RawParameterizedComparator */
+/** @template TArg @template T @typedef {function(TArg): Comparator<T>} ParameterizedComparator */
+
+/**
+ * @template T
+ * @param {RawParameterizedComparator<any, T>} fn comparator with argument
+ * @returns {ParameterizedComparator<any, T>} comparator
+ */
+const createCachedParameterizedComparator = fn => {
+	/** @type {WeakMap<object, Comparator<T>>} */
+	const map = new WeakMap();
+	return arg => {
+		const cachedResult = map.get(arg);
+		if (cachedResult !== undefined) return cachedResult;
+		/**
+		 * @param {T} a first item
+		 * @param {T} b second item
+		 * @returns {-1|0|1} compare result
+		 */
+		const result = fn.bind(null, arg);
+		map.set(arg, result);
+		return result;
+	};
+};
+
+/**
+ * @param {Chunk} a chunk
+ * @param {Chunk} b chunk
+ * @returns {-1|0|1} compare result
+ */
+exports.compareChunksById = (a, b) => {
+	return compareIds(a.id, b.id);
+};
+
+/**
+ * @param {Module} a module
+ * @param {Module} b module
+ * @returns {-1|0|1} compare result
+ */
+exports.compareModulesByIdentifier = (a, b) => {
+	return compareIds(a.identifier(), b.identifier());
+};
+
+/**
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {Module} a module
+ * @param {Module} b module
+ * @returns {-1|0|1} compare result
+ */
+const compareModulesById = (chunkGraph, a, b) => {
+	return compareIds(chunkGraph.getModuleId(a), chunkGraph.getModuleId(b));
+};
+/** @type {ParameterizedComparator<ChunkGraph, Module>} */
+exports.compareModulesById =
+	createCachedParameterizedComparator(compareModulesById);
+
+/**
+ * @param {number} a number
+ * @param {number} b number
+ * @returns {-1|0|1} compare result
+ */
+const compareNumbers = (a, b) => {
+	if (typeof a !== typeof b) {
+		return typeof a < typeof b ? -1 : 1;
+	}
+	if (a < b) return -1;
+	if (a > b) return 1;
+	return 0;
+};
+exports.compareNumbers = compareNumbers;
+
+/**
+ * @param {string} a string
+ * @param {string} b string
+ * @returns {-1|0|1} compare result
+ */
+const compareStringsNumeric = (a, b) => {
+	const partsA = a.split(/(\d+)/);
+	const partsB = b.split(/(\d+)/);
+	const len = Math.min(partsA.length, partsB.length);
+	for (let i = 0; i < len; i++) {
+		const pA = partsA[i];
+		const pB = partsB[i];
+		if (i % 2 === 0) {
+			if (pA.length > pB.length) {
+				if (pA.slice(0, pB.length) > pB) return 1;
+				return -1;
+			} else if (pB.length > pA.length) {
+				if (pB.slice(0, pA.length) > pA) return -1;
+				return 1;
+			} else {
+				if (pA < pB) return -1;
+				if (pA > pB) return 1;
+			}
+		} else {
+			const nA = +pA;
+			const nB = +pB;
+			if (nA < nB) return -1;
+			if (nA > nB) return 1;
+		}
+	}
+	if (partsB.length < partsA.length) return 1;
+	if (partsB.length > partsA.length) return -1;
+	return 0;
+};
+exports.compareStringsNumeric = compareStringsNumeric;
+
+/**
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {Module} a module
+ * @param {Module} b module
+ * @returns {-1|0|1} compare result
+ */
+const compareModulesByPostOrderIndexOrIdentifier = (moduleGraph, a, b) => {
+	const cmp = compareNumbers(
+		moduleGraph.getPostOrderIndex(a),
+		moduleGraph.getPostOrderIndex(b)
+	);
+	if (cmp !== 0) return cmp;
+	return compareIds(a.identifier(), b.identifier());
+};
+/** @type {ParameterizedComparator<ModuleGraph, Module>} */
+exports.compareModulesByPostOrderIndexOrIdentifier =
+	createCachedParameterizedComparator(
+		compareModulesByPostOrderIndexOrIdentifier
+	);
+
+/**
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {Module} a module
+ * @param {Module} b module
+ * @returns {-1|0|1} compare result
+ */
+const compareModulesByPreOrderIndexOrIdentifier = (moduleGraph, a, b) => {
+	const cmp = compareNumbers(
+		moduleGraph.getPreOrderIndex(a),
+		moduleGraph.getPreOrderIndex(b)
+	);
+	if (cmp !== 0) return cmp;
+	return compareIds(a.identifier(), b.identifier());
+};
+/** @type {ParameterizedComparator<ModuleGraph, Module>} */
+exports.compareModulesByPreOrderIndexOrIdentifier =
+	createCachedParameterizedComparator(
+		compareModulesByPreOrderIndexOrIdentifier
+	);
+
+/**
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {Module} a module
+ * @param {Module} b module
+ * @returns {-1|0|1} compare result
+ */
+const compareModulesByIdOrIdentifier = (chunkGraph, a, b) => {
+	const cmp = compareIds(chunkGraph.getModuleId(a), chunkGraph.getModuleId(b));
+	if (cmp !== 0) return cmp;
+	return compareIds(a.identifier(), b.identifier());
+};
+/** @type {ParameterizedComparator<ChunkGraph, Module>} */
+exports.compareModulesByIdOrIdentifier = createCachedParameterizedComparator(
+	compareModulesByIdOrIdentifier
+);
+
+/**
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {Chunk} a chunk
+ * @param {Chunk} b chunk
+ * @returns {-1|0|1} compare result
+ */
+const compareChunks = (chunkGraph, a, b) => {
+	return chunkGraph.compareChunks(a, b);
+};
+/** @type {ParameterizedComparator<ChunkGraph, Chunk>} */
+exports.compareChunks = createCachedParameterizedComparator(compareChunks);
+
+/**
+ * @param {string|number} a first id
+ * @param {string|number} b second id
+ * @returns {-1|0|1} compare result
+ */
+const compareIds = (a, b) => {
+	if (typeof a !== typeof b) {
+		return typeof a < typeof b ? -1 : 1;
+	}
+	if (a < b) return -1;
+	if (a > b) return 1;
+	return 0;
+};
+
+exports.compareIds = compareIds;
+
+/**
+ * @param {string} a first string
+ * @param {string} b second string
+ * @returns {-1|0|1} compare result
+ */
+const compareStrings = (a, b) => {
+	if (a < b) return -1;
+	if (a > b) return 1;
+	return 0;
+};
+
+exports.compareStrings = compareStrings;
+
+/**
+ * @param {ChunkGroup} a first chunk group
+ * @param {ChunkGroup} b second chunk group
+ * @returns {-1|0|1} compare result
+ */
+const compareChunkGroupsByIndex = (a, b) => {
+	return a.index < b.index ? -1 : 1;
+};
+
+exports.compareChunkGroupsByIndex = compareChunkGroupsByIndex;
+
+/**
+ * @template K1 {Object}
+ * @template K2
+ * @template T
+ */
+class TwoKeyWeakMap {
+	constructor() {
+		/** @private @type {WeakMap<any, WeakMap<any, T>>} */
+		this._map = new WeakMap();
+	}
+
+	/**
+	 * @param {K1} key1 first key
+	 * @param {K2} key2 second key
+	 * @returns {T | undefined} value
+	 */
+	get(key1, key2) {
+		const childMap = this._map.get(key1);
+		if (childMap === undefined) {
+			return undefined;
+		}
+		return childMap.get(key2);
+	}
+
+	/**
+	 * @param {K1} key1 first key
+	 * @param {K2} key2 second key
+	 * @param {T | undefined} value new value
+	 * @returns {void}
+	 */
+	set(key1, key2, value) {
+		let childMap = this._map.get(key1);
+		if (childMap === undefined) {
+			childMap = new WeakMap();
+			this._map.set(key1, childMap);
+		}
+		childMap.set(key2, value);
+	}
+}
+
+/** @type {TwoKeyWeakMap<Comparator<any>, Comparator<any>, Comparator<any>>}} */
+const concatComparatorsCache = new TwoKeyWeakMap();
+
+/**
+ * @template T
+ * @param {Comparator<T>} c1 comparator
+ * @param {Comparator<T>} c2 comparator
+ * @param {Comparator<T>[]} cRest comparators
+ * @returns {Comparator<T>} comparator
+ */
+const concatComparators = (c1, c2, ...cRest) => {
+	if (cRest.length > 0) {
+		const [c3, ...cRest2] = cRest;
+		return concatComparators(c1, concatComparators(c2, c3, ...cRest2));
+	}
+	const cacheEntry = /** @type {Comparator<T>} */ (
+		concatComparatorsCache.get(c1, c2)
+	);
+	if (cacheEntry !== undefined) return cacheEntry;
+	/**
+	 * @param {T} a first value
+	 * @param {T} b second value
+	 * @returns {-1|0|1} compare result
+	 */
+	const result = (a, b) => {
+		const res = c1(a, b);
+		if (res !== 0) return res;
+		return c2(a, b);
+	};
+	concatComparatorsCache.set(c1, c2, result);
+	return result;
+};
+exports.concatComparators = concatComparators;
+
+/** @template A, B @typedef {(input: A) => B} Selector */
+
+/** @type {TwoKeyWeakMap<Selector<any, any>, Comparator<any>, Comparator<any>>}} */
+const compareSelectCache = new TwoKeyWeakMap();
+
+/**
+ * @template T
+ * @template R
+ * @param {Selector<T, R>} getter getter for value
+ * @param {Comparator<R>} comparator comparator
+ * @returns {Comparator<T>} comparator
+ */
+const compareSelect = (getter, comparator) => {
+	const cacheEntry = compareSelectCache.get(getter, comparator);
+	if (cacheEntry !== undefined) return cacheEntry;
+	/**
+	 * @param {T} a first value
+	 * @param {T} b second value
+	 * @returns {-1|0|1} compare result
+	 */
+	const result = (a, b) => {
+		const aValue = getter(a);
+		const bValue = getter(b);
+		if (aValue !== undefined && aValue !== null) {
+			if (bValue !== undefined && bValue !== null) {
+				return comparator(aValue, bValue);
+			}
+			return -1;
+		} else {
+			if (bValue !== undefined && bValue !== null) {
+				return 1;
+			}
+			return 0;
+		}
+	};
+	compareSelectCache.set(getter, comparator, result);
+	return result;
+};
+exports.compareSelect = compareSelect;
+
+/** @type {WeakMap<Comparator<any>, Comparator<Iterable<any>>>} */
+const compareIteratorsCache = new WeakMap();
+
+/**
+ * @template T
+ * @param {Comparator<T>} elementComparator comparator for elements
+ * @returns {Comparator<Iterable<T>>} comparator for iterables of elements
+ */
+const compareIterables = elementComparator => {
+	const cacheEntry = compareIteratorsCache.get(elementComparator);
+	if (cacheEntry !== undefined) return cacheEntry;
+	/**
+	 * @param {Iterable<T>} a first value
+	 * @param {Iterable<T>} b second value
+	 * @returns {-1|0|1} compare result
+	 */
+	const result = (a, b) => {
+		const aI = a[Symbol.iterator]();
+		const bI = b[Symbol.iterator]();
+		// eslint-disable-next-line no-constant-condition
+		while (true) {
+			const aItem = aI.next();
+			const bItem = bI.next();
+			if (aItem.done) {
+				return bItem.done ? 0 : -1;
+			} else if (bItem.done) {
+				return 1;
+			}
+			const res = elementComparator(aItem.value, bItem.value);
+			if (res !== 0) return res;
+		}
+	};
+	compareIteratorsCache.set(elementComparator, result);
+	return result;
+};
+exports.compareIterables = compareIterables;
+
+// TODO this is no longer needed when minimum node.js version is >= 12
+// since these versions ship with a stable sort function
+/**
+ * @template T
+ * @param {Iterable<T>} iterable original ordered list
+ * @returns {Comparator<T>} comparator
+ */
+exports.keepOriginalOrder = iterable => {
+	/** @type {Map<T, number>} */
+	const map = new Map();
+	let i = 0;
+	for (const item of iterable) {
+		map.set(item, i++);
+	}
+	return (a, b) => compareNumbers(map.get(a), map.get(b));
+};
+
+/**
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @returns {Comparator<Chunk>} comparator
+ */
+exports.compareChunksNatural = chunkGraph => {
+	const cmpFn = exports.compareModulesById(chunkGraph);
+	const cmpIterableFn = compareIterables(cmpFn);
+	return concatComparators(
+		compareSelect(chunk => chunk.name, compareIds),
+		compareSelect(chunk => chunk.runtime, compareRuntime),
+		compareSelect(
+			/**
+			 * @param {Chunk} chunk a chunk
+			 * @returns {Iterable<Module>} modules
+			 */
+			chunk => chunkGraph.getOrderedChunkModulesIterable(chunk, cmpFn),
+			cmpIterableFn
+		)
+	);
+};
+
+/**
+ * Compare two locations
+ * @param {DependencyLocation} a A location node
+ * @param {DependencyLocation} b A location node
+ * @returns {-1|0|1} sorting comparator value
+ */
+exports.compareLocations = (a, b) => {
+	let isObjectA = typeof a === "object" && a !== null;
+	let isObjectB = typeof b === "object" && b !== null;
+	if (!isObjectA || !isObjectB) {
+		if (isObjectA) return 1;
+		if (isObjectB) return -1;
+		return 0;
+	}
+	if ("start" in a) {
+		if ("start" in b) {
+			const ap = a.start;
+			const bp = b.start;
+			if (ap.line < bp.line) return -1;
+			if (ap.line > bp.line) return 1;
+			if (ap.column < bp.column) return -1;
+			if (ap.column > bp.column) return 1;
+		} else return -1;
+	} else if ("start" in b) return 1;
+	if ("name" in a) {
+		if ("name" in b) {
+			if (a.name < b.name) return -1;
+			if (a.name > b.name) return 1;
+		} else return -1;
+	} else if ("name" in b) return 1;
+	if ("index" in a) {
+		if ("index" in b) {
+			if (a.index < b.index) return -1;
+			if (a.index > b.index) return 1;
+		} else return -1;
+	} else if ("index" in b) return 1;
+	return 0;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/compileBooleanMatcher.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/compileBooleanMatcher.js
new file mode 100644
index 0000000..7573606
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/compileBooleanMatcher.js
@@ -0,0 +1,206 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const quoteMeta = str => {
+	return str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
+};
+
+const toSimpleString = str => {
+	if (`${+str}` === str) {
+		return str;
+	}
+	return JSON.stringify(str);
+};
+
+/**
+ * @param {Record<string|number, boolean>} map value map
+ * @returns {boolean|(function(string): string)} true/false, when unconditionally true/false, or a template function to determine the value at runtime
+ */
+const compileBooleanMatcher = map => {
+	const positiveItems = Object.keys(map).filter(i => map[i]);
+	const negativeItems = Object.keys(map).filter(i => !map[i]);
+	if (positiveItems.length === 0) return false;
+	if (negativeItems.length === 0) return true;
+	return compileBooleanMatcherFromLists(positiveItems, negativeItems);
+};
+
+/**
+ * @param {string[]} positiveItems positive items
+ * @param {string[]} negativeItems negative items
+ * @returns {function(string): string} a template function to determine the value at runtime
+ */
+const compileBooleanMatcherFromLists = (positiveItems, negativeItems) => {
+	if (positiveItems.length === 0) return () => "false";
+	if (negativeItems.length === 0) return () => "true";
+	if (positiveItems.length === 1)
+		return value => `${toSimpleString(positiveItems[0])} == ${value}`;
+	if (negativeItems.length === 1)
+		return value => `${toSimpleString(negativeItems[0])} != ${value}`;
+	const positiveRegexp = itemsToRegexp(positiveItems);
+	const negativeRegexp = itemsToRegexp(negativeItems);
+	if (positiveRegexp.length <= negativeRegexp.length) {
+		return value => `/^${positiveRegexp}$/.test(${value})`;
+	} else {
+		return value => `!/^${negativeRegexp}$/.test(${value})`;
+	}
+};
+
+const popCommonItems = (itemsSet, getKey, condition) => {
+	const map = new Map();
+	for (const item of itemsSet) {
+		const key = getKey(item);
+		if (key) {
+			let list = map.get(key);
+			if (list === undefined) {
+				list = [];
+				map.set(key, list);
+			}
+			list.push(item);
+		}
+	}
+	const result = [];
+	for (const list of map.values()) {
+		if (condition(list)) {
+			for (const item of list) {
+				itemsSet.delete(item);
+			}
+			result.push(list);
+		}
+	}
+	return result;
+};
+
+const getCommonPrefix = items => {
+	let prefix = items[0];
+	for (let i = 1; i < items.length; i++) {
+		const item = items[i];
+		for (let p = 0; p < prefix.length; p++) {
+			if (item[p] !== prefix[p]) {
+				prefix = prefix.slice(0, p);
+				break;
+			}
+		}
+	}
+	return prefix;
+};
+
+const getCommonSuffix = items => {
+	let suffix = items[0];
+	for (let i = 1; i < items.length; i++) {
+		const item = items[i];
+		for (let p = item.length - 1, s = suffix.length - 1; s >= 0; p--, s--) {
+			if (item[p] !== suffix[s]) {
+				suffix = suffix.slice(s + 1);
+				break;
+			}
+		}
+	}
+	return suffix;
+};
+
+const itemsToRegexp = itemsArr => {
+	if (itemsArr.length === 1) {
+		return quoteMeta(itemsArr[0]);
+	}
+	const finishedItems = [];
+
+	// merge single char items: (a|b|c|d|ef) => ([abcd]|ef)
+	let countOfSingleCharItems = 0;
+	for (const item of itemsArr) {
+		if (item.length === 1) {
+			countOfSingleCharItems++;
+		}
+	}
+	// special case for only single char items
+	if (countOfSingleCharItems === itemsArr.length) {
+		return `[${quoteMeta(itemsArr.sort().join(""))}]`;
+	}
+	const items = new Set(itemsArr.sort());
+	if (countOfSingleCharItems > 2) {
+		let singleCharItems = "";
+		for (const item of items) {
+			if (item.length === 1) {
+				singleCharItems += item;
+				items.delete(item);
+			}
+		}
+		finishedItems.push(`[${quoteMeta(singleCharItems)}]`);
+	}
+
+	// special case for 2 items with common prefix/suffix
+	if (finishedItems.length === 0 && items.size === 2) {
+		const prefix = getCommonPrefix(itemsArr);
+		const suffix = getCommonSuffix(
+			itemsArr.map(item => item.slice(prefix.length))
+		);
+		if (prefix.length > 0 || suffix.length > 0) {
+			return `${quoteMeta(prefix)}${itemsToRegexp(
+				itemsArr.map(i => i.slice(prefix.length, -suffix.length || undefined))
+			)}${quoteMeta(suffix)}`;
+		}
+	}
+
+	// special case for 2 items with common suffix
+	if (finishedItems.length === 0 && items.size === 2) {
+		const it = items[Symbol.iterator]();
+		const a = it.next().value;
+		const b = it.next().value;
+		if (a.length > 0 && b.length > 0 && a.slice(-1) === b.slice(-1)) {
+			return `${itemsToRegexp([a.slice(0, -1), b.slice(0, -1)])}${quoteMeta(
+				a.slice(-1)
+			)}`;
+		}
+	}
+
+	// find common prefix: (a1|a2|a3|a4|b5) => (a(1|2|3|4)|b5)
+	const prefixed = popCommonItems(
+		items,
+		item => (item.length >= 1 ? item[0] : false),
+		list => {
+			if (list.length >= 3) return true;
+			if (list.length <= 1) return false;
+			return list[0][1] === list[1][1];
+		}
+	);
+	for (const prefixedItems of prefixed) {
+		const prefix = getCommonPrefix(prefixedItems);
+		finishedItems.push(
+			`${quoteMeta(prefix)}${itemsToRegexp(
+				prefixedItems.map(i => i.slice(prefix.length))
+			)}`
+		);
+	}
+
+	// find common suffix: (a1|b1|c1|d1|e2) => ((a|b|c|d)1|e2)
+	const suffixed = popCommonItems(
+		items,
+		item => (item.length >= 1 ? item.slice(-1) : false),
+		list => {
+			if (list.length >= 3) return true;
+			if (list.length <= 1) return false;
+			return list[0].slice(-2) === list[1].slice(-2);
+		}
+	);
+	for (const suffixedItems of suffixed) {
+		const suffix = getCommonSuffix(suffixedItems);
+		finishedItems.push(
+			`${itemsToRegexp(
+				suffixedItems.map(i => i.slice(0, -suffix.length))
+			)}${quoteMeta(suffix)}`
+		);
+	}
+
+	// TODO further optimize regexp, i. e.
+	// use ranges: (1|2|3|4|a) => [1-4a]
+	const conditional = finishedItems.concat(Array.from(items, quoteMeta));
+	if (conditional.length === 1) return conditional[0];
+	return `(${conditional.join("|")})`;
+};
+
+compileBooleanMatcher.fromLists = compileBooleanMatcherFromLists;
+compileBooleanMatcher.itemsToRegexp = itemsToRegexp;
+module.exports = compileBooleanMatcher;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/create-schema-validation.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/create-schema-validation.js
new file mode 100644
index 0000000..290eaf4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/create-schema-validation.js
@@ -0,0 +1,28 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const memoize = require("./memoize");
+
+const getValidate = memoize(() => require("schema-utils").validate);
+
+const createSchemaValidation = (check, getSchema, options) => {
+	getSchema = memoize(getSchema);
+	return value => {
+		if (check && !check(value)) {
+			getValidate()(getSchema(), value, options);
+			if (check) {
+				require("util").deprecate(
+					() => {},
+					"webpack bug: Pre-compiled schema reports error while real schema is happy. This has performance drawbacks.",
+					"DEP_WEBPACK_PRE_COMPILED_SCHEMA_INVALID"
+				)();
+			}
+		}
+	};
+};
+
+module.exports = createSchemaValidation;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/createHash.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/createHash.js
new file mode 100644
index 0000000..f727a1f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/createHash.js
@@ -0,0 +1,171 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Hash = require("./Hash");
+
+const BULK_SIZE = 2000;
+
+// We are using an object instead of a Map as this will stay static during the runtime
+// so access to it can be optimized by v8
+const digestCaches = {};
+
+class BulkUpdateDecorator extends Hash {
+	/**
+	 * @param {Hash | function(): Hash} hashOrFactory function to create a hash
+	 * @param {string=} hashKey key for caching
+	 */
+	constructor(hashOrFactory, hashKey) {
+		super();
+		this.hashKey = hashKey;
+		if (typeof hashOrFactory === "function") {
+			this.hashFactory = hashOrFactory;
+			this.hash = undefined;
+		} else {
+			this.hashFactory = undefined;
+			this.hash = hashOrFactory;
+		}
+		this.buffer = "";
+	}
+
+	/**
+	 * Update hash {@link https://nodejs.org/api/crypto.html#crypto_hash_update_data_inputencoding}
+	 * @param {string|Buffer} data data
+	 * @param {string=} inputEncoding data encoding
+	 * @returns {this} updated hash
+	 */
+	update(data, inputEncoding) {
+		if (
+			inputEncoding !== undefined ||
+			typeof data !== "string" ||
+			data.length > BULK_SIZE
+		) {
+			if (this.hash === undefined) this.hash = this.hashFactory();
+			if (this.buffer.length > 0) {
+				this.hash.update(this.buffer);
+				this.buffer = "";
+			}
+			this.hash.update(data, inputEncoding);
+		} else {
+			this.buffer += data;
+			if (this.buffer.length > BULK_SIZE) {
+				if (this.hash === undefined) this.hash = this.hashFactory();
+				this.hash.update(this.buffer);
+				this.buffer = "";
+			}
+		}
+		return this;
+	}
+
+	/**
+	 * Calculates the digest {@link https://nodejs.org/api/crypto.html#crypto_hash_digest_encoding}
+	 * @param {string=} encoding encoding of the return value
+	 * @returns {string|Buffer} digest
+	 */
+	digest(encoding) {
+		let digestCache;
+		const buffer = this.buffer;
+		if (this.hash === undefined) {
+			// short data for hash, we can use caching
+			const cacheKey = `${this.hashKey}-${encoding}`;
+			digestCache = digestCaches[cacheKey];
+			if (digestCache === undefined) {
+				digestCache = digestCaches[cacheKey] = new Map();
+			}
+			const cacheEntry = digestCache.get(buffer);
+			if (cacheEntry !== undefined) return cacheEntry;
+			this.hash = this.hashFactory();
+		}
+		if (buffer.length > 0) {
+			this.hash.update(buffer);
+		}
+		const digestResult = this.hash.digest(encoding);
+		const result =
+			typeof digestResult === "string" ? digestResult : digestResult.toString();
+		if (digestCache !== undefined) {
+			digestCache.set(buffer, result);
+		}
+		return result;
+	}
+}
+
+/* istanbul ignore next */
+class DebugHash extends Hash {
+	constructor() {
+		super();
+		this.string = "";
+	}
+
+	/**
+	 * Update hash {@link https://nodejs.org/api/crypto.html#crypto_hash_update_data_inputencoding}
+	 * @param {string|Buffer} data data
+	 * @param {string=} inputEncoding data encoding
+	 * @returns {this} updated hash
+	 */
+	update(data, inputEncoding) {
+		if (typeof data !== "string") data = data.toString("utf-8");
+		if (data.startsWith("debug-digest-")) {
+			data = Buffer.from(data.slice("debug-digest-".length), "hex").toString();
+		}
+		this.string += `[${data}](${new Error().stack.split("\n", 3)[2]})\n`;
+		return this;
+	}
+
+	/**
+	 * Calculates the digest {@link https://nodejs.org/api/crypto.html#crypto_hash_digest_encoding}
+	 * @param {string=} encoding encoding of the return value
+	 * @returns {string|Buffer} digest
+	 */
+	digest(encoding) {
+		return "debug-digest-" + Buffer.from(this.string).toString("hex");
+	}
+}
+
+let crypto = undefined;
+let createXXHash64 = undefined;
+let createMd4 = undefined;
+let BatchedHash = undefined;
+
+/**
+ * Creates a hash by name or function
+ * @param {string | typeof Hash} algorithm the algorithm name or a constructor creating a hash
+ * @returns {Hash} the hash
+ */
+module.exports = algorithm => {
+	if (typeof algorithm === "function") {
+		return new BulkUpdateDecorator(() => new algorithm());
+	}
+	switch (algorithm) {
+		// TODO add non-cryptographic algorithm here
+		case "debug":
+			return new DebugHash();
+		case "xxhash64":
+			if (createXXHash64 === undefined) {
+				createXXHash64 = require("./hash/xxhash64");
+				if (BatchedHash === undefined) {
+					BatchedHash = require("./hash/BatchedHash");
+				}
+			}
+			return new BatchedHash(createXXHash64());
+		case "md4":
+			if (createMd4 === undefined) {
+				createMd4 = require("./hash/md4");
+				if (BatchedHash === undefined) {
+					BatchedHash = require("./hash/BatchedHash");
+				}
+			}
+			return new BatchedHash(createMd4());
+		case "native-md4":
+			if (crypto === undefined) crypto = require("crypto");
+			return new BulkUpdateDecorator(() => crypto.createHash("md4"), "md4");
+		default:
+			if (crypto === undefined) crypto = require("crypto");
+			return new BulkUpdateDecorator(
+				() => crypto.createHash(algorithm),
+				algorithm
+			);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/deprecation.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/deprecation.js
new file mode 100644
index 0000000..7a107d2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/deprecation.js
@@ -0,0 +1,264 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+
+/** @type {Map<string, Function>} */
+const deprecationCache = new Map();
+
+/**
+ * @typedef {Object} FakeHookMarker
+ * @property {true} _fakeHook it's a fake hook
+ */
+
+/** @template T @typedef {T & FakeHookMarker} FakeHook<T> */
+
+/**
+ * @param {string} message deprecation message
+ * @param {string} code deprecation code
+ * @returns {Function} function to trigger deprecation
+ */
+const createDeprecation = (message, code) => {
+	const cached = deprecationCache.get(message);
+	if (cached !== undefined) return cached;
+	const fn = util.deprecate(
+		() => {},
+		message,
+		"DEP_WEBPACK_DEPRECATION_" + code
+	);
+	deprecationCache.set(message, fn);
+	return fn;
+};
+
+const COPY_METHODS = [
+	"concat",
+	"entry",
+	"filter",
+	"find",
+	"findIndex",
+	"includes",
+	"indexOf",
+	"join",
+	"lastIndexOf",
+	"map",
+	"reduce",
+	"reduceRight",
+	"slice",
+	"some"
+];
+
+const DISABLED_METHODS = [
+	"copyWithin",
+	"entries",
+	"fill",
+	"keys",
+	"pop",
+	"reverse",
+	"shift",
+	"splice",
+	"sort",
+	"unshift"
+];
+
+/**
+ * @param {any} set new set
+ * @param {string} name property name
+ * @returns {void}
+ */
+exports.arrayToSetDeprecation = (set, name) => {
+	for (const method of COPY_METHODS) {
+		if (set[method]) continue;
+		const d = createDeprecation(
+			`${name} was changed from Array to Set (using Array method '${method}' is deprecated)`,
+			"ARRAY_TO_SET"
+		);
+		/**
+		 * @deprecated
+		 * @this {Set}
+		 * @returns {number} count
+		 */
+		set[method] = function () {
+			d();
+			const array = Array.from(this);
+			return Array.prototype[method].apply(array, arguments);
+		};
+	}
+	const dPush = createDeprecation(
+		`${name} was changed from Array to Set (using Array method 'push' is deprecated)`,
+		"ARRAY_TO_SET_PUSH"
+	);
+	const dLength = createDeprecation(
+		`${name} was changed from Array to Set (using Array property 'length' is deprecated)`,
+		"ARRAY_TO_SET_LENGTH"
+	);
+	const dIndexer = createDeprecation(
+		`${name} was changed from Array to Set (indexing Array is deprecated)`,
+		"ARRAY_TO_SET_INDEXER"
+	);
+	/**
+	 * @deprecated
+	 * @this {Set}
+	 * @returns {number} count
+	 */
+	set.push = function () {
+		dPush();
+		for (const item of Array.from(arguments)) {
+			this.add(item);
+		}
+		return this.size;
+	};
+	for (const method of DISABLED_METHODS) {
+		if (set[method]) continue;
+		set[method] = () => {
+			throw new Error(
+				`${name} was changed from Array to Set (using Array method '${method}' is not possible)`
+			);
+		};
+	}
+	const createIndexGetter = index => {
+		/**
+		 * @this {Set} a Set
+		 * @returns {any} the value at this location
+		 */
+		const fn = function () {
+			dIndexer();
+			let i = 0;
+			for (const item of this) {
+				if (i++ === index) return item;
+			}
+			return undefined;
+		};
+		return fn;
+	};
+	const defineIndexGetter = index => {
+		Object.defineProperty(set, index, {
+			get: createIndexGetter(index),
+			set(value) {
+				throw new Error(
+					`${name} was changed from Array to Set (indexing Array with write is not possible)`
+				);
+			}
+		});
+	};
+	defineIndexGetter(0);
+	let indexerDefined = 1;
+	Object.defineProperty(set, "length", {
+		get() {
+			dLength();
+			const length = this.size;
+			for (indexerDefined; indexerDefined < length + 1; indexerDefined++) {
+				defineIndexGetter(indexerDefined);
+			}
+			return length;
+		},
+		set(value) {
+			throw new Error(
+				`${name} was changed from Array to Set (writing to Array property 'length' is not possible)`
+			);
+		}
+	});
+	set[Symbol.isConcatSpreadable] = true;
+};
+
+exports.createArrayToSetDeprecationSet = name => {
+	let initialized = false;
+	class SetDeprecatedArray extends Set {
+		constructor(items) {
+			super(items);
+			if (!initialized) {
+				initialized = true;
+				exports.arrayToSetDeprecation(SetDeprecatedArray.prototype, name);
+			}
+		}
+	}
+	return SetDeprecatedArray;
+};
+
+exports.soonFrozenObjectDeprecation = (obj, name, code, note = "") => {
+	const message = `${name} will be frozen in future, all modifications are deprecated.${
+		note && `\n${note}`
+	}`;
+	return new Proxy(obj, {
+		set: util.deprecate(
+			(target, property, value, receiver) =>
+				Reflect.set(target, property, value, receiver),
+			message,
+			code
+		),
+		defineProperty: util.deprecate(
+			(target, property, descriptor) =>
+				Reflect.defineProperty(target, property, descriptor),
+			message,
+			code
+		),
+		deleteProperty: util.deprecate(
+			(target, property) => Reflect.deleteProperty(target, property),
+			message,
+			code
+		),
+		setPrototypeOf: util.deprecate(
+			(target, proto) => Reflect.setPrototypeOf(target, proto),
+			message,
+			code
+		)
+	});
+};
+
+/**
+ * @template T
+ * @param {T} obj object
+ * @param {string} message deprecation message
+ * @param {string} code deprecation code
+ * @returns {T} object with property access deprecated
+ */
+const deprecateAllProperties = (obj, message, code) => {
+	const newObj = {};
+	const descriptors = Object.getOwnPropertyDescriptors(obj);
+	for (const name of Object.keys(descriptors)) {
+		const descriptor = descriptors[name];
+		if (typeof descriptor.value === "function") {
+			Object.defineProperty(newObj, name, {
+				...descriptor,
+				value: util.deprecate(descriptor.value, message, code)
+			});
+		} else if (descriptor.get || descriptor.set) {
+			Object.defineProperty(newObj, name, {
+				...descriptor,
+				get: descriptor.get && util.deprecate(descriptor.get, message, code),
+				set: descriptor.set && util.deprecate(descriptor.set, message, code)
+			});
+		} else {
+			let value = descriptor.value;
+			Object.defineProperty(newObj, name, {
+				configurable: descriptor.configurable,
+				enumerable: descriptor.enumerable,
+				get: util.deprecate(() => value, message, code),
+				set: descriptor.writable
+					? util.deprecate(v => (value = v), message, code)
+					: undefined
+			});
+		}
+	}
+	return /** @type {T} */ (newObj);
+};
+exports.deprecateAllProperties = deprecateAllProperties;
+
+/**
+ * @template T
+ * @param {T} fakeHook fake hook implementation
+ * @param {string=} message deprecation message (not deprecated when unset)
+ * @param {string=} code deprecation code (not deprecated when unset)
+ * @returns {FakeHook<T>} fake hook which redirects
+ */
+exports.createFakeHook = (fakeHook, message, code) => {
+	if (message && code) {
+		fakeHook = deprecateAllProperties(fakeHook, message, code);
+	}
+	return Object.freeze(
+		Object.assign(fakeHook, { _fakeHook: /** @type {true} */ (true) })
+	);
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/deterministicGrouping.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/deterministicGrouping.js
new file mode 100644
index 0000000..69f6a46
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/deterministicGrouping.js
@@ -0,0 +1,508 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+// Simulations show these probabilities for a single change
+// 93.1% that one group is invalidated
+// 4.8% that two groups are invalidated
+// 1.1% that 3 groups are invalidated
+// 0.1% that 4 or more groups are invalidated
+//
+// And these for removing/adding 10 lexically adjacent files
+// 64.5% that one group is invalidated
+// 24.8% that two groups are invalidated
+// 7.8% that 3 groups are invalidated
+// 2.7% that 4 or more groups are invalidated
+//
+// And these for removing/adding 3 random files
+// 0% that one group is invalidated
+// 3.7% that two groups are invalidated
+// 80.8% that 3 groups are invalidated
+// 12.3% that 4 groups are invalidated
+// 3.2% that 5 or more groups are invalidated
+
+/**
+ *
+ * @param {string} a key
+ * @param {string} b key
+ * @returns {number} the similarity as number
+ */
+const similarity = (a, b) => {
+	const l = Math.min(a.length, b.length);
+	let dist = 0;
+	for (let i = 0; i < l; i++) {
+		const ca = a.charCodeAt(i);
+		const cb = b.charCodeAt(i);
+		dist += Math.max(0, 10 - Math.abs(ca - cb));
+	}
+	return dist;
+};
+
+/**
+ * @param {string} a key
+ * @param {string} b key
+ * @param {Set<string>} usedNames set of already used names
+ * @returns {string} the common part and a single char for the difference
+ */
+const getName = (a, b, usedNames) => {
+	const l = Math.min(a.length, b.length);
+	let i = 0;
+	while (i < l) {
+		if (a.charCodeAt(i) !== b.charCodeAt(i)) {
+			i++;
+			break;
+		}
+		i++;
+	}
+	while (i < l) {
+		const name = a.slice(0, i);
+		const lowerName = name.toLowerCase();
+		if (!usedNames.has(lowerName)) {
+			usedNames.add(lowerName);
+			return name;
+		}
+		i++;
+	}
+	// names always contain a hash, so this is always unique
+	// we don't need to check usedNames nor add it
+	return a;
+};
+
+/**
+ * @param {Record<string, number>} total total size
+ * @param {Record<string, number>} size single size
+ * @returns {void}
+ */
+const addSizeTo = (total, size) => {
+	for (const key of Object.keys(size)) {
+		total[key] = (total[key] || 0) + size[key];
+	}
+};
+
+/**
+ * @param {Record<string, number>} total total size
+ * @param {Record<string, number>} size single size
+ * @returns {void}
+ */
+const subtractSizeFrom = (total, size) => {
+	for (const key of Object.keys(size)) {
+		total[key] -= size[key];
+	}
+};
+
+/**
+ * @param {Iterable<Node>} nodes some nodes
+ * @returns {Record<string, number>} total size
+ */
+const sumSize = nodes => {
+	const sum = Object.create(null);
+	for (const node of nodes) {
+		addSizeTo(sum, node.size);
+	}
+	return sum;
+};
+
+const isTooBig = (size, maxSize) => {
+	for (const key of Object.keys(size)) {
+		const s = size[key];
+		if (s === 0) continue;
+		const maxSizeValue = maxSize[key];
+		if (typeof maxSizeValue === "number") {
+			if (s > maxSizeValue) return true;
+		}
+	}
+	return false;
+};
+
+const isTooSmall = (size, minSize) => {
+	for (const key of Object.keys(size)) {
+		const s = size[key];
+		if (s === 0) continue;
+		const minSizeValue = minSize[key];
+		if (typeof minSizeValue === "number") {
+			if (s < minSizeValue) return true;
+		}
+	}
+	return false;
+};
+
+const getTooSmallTypes = (size, minSize) => {
+	const types = new Set();
+	for (const key of Object.keys(size)) {
+		const s = size[key];
+		if (s === 0) continue;
+		const minSizeValue = minSize[key];
+		if (typeof minSizeValue === "number") {
+			if (s < minSizeValue) types.add(key);
+		}
+	}
+	return types;
+};
+
+const getNumberOfMatchingSizeTypes = (size, types) => {
+	let i = 0;
+	for (const key of Object.keys(size)) {
+		if (size[key] !== 0 && types.has(key)) i++;
+	}
+	return i;
+};
+
+const selectiveSizeSum = (size, types) => {
+	let sum = 0;
+	for (const key of Object.keys(size)) {
+		if (size[key] !== 0 && types.has(key)) sum += size[key];
+	}
+	return sum;
+};
+
+/**
+ * @template T
+ */
+class Node {
+	/**
+	 * @param {T} item item
+	 * @param {string} key key
+	 * @param {Record<string, number>} size size
+	 */
+	constructor(item, key, size) {
+		this.item = item;
+		this.key = key;
+		this.size = size;
+	}
+}
+
+/**
+ * @template T
+ */
+class Group {
+	/**
+	 * @param {Node<T>[]} nodes nodes
+	 * @param {number[]} similarities similarities between the nodes (length = nodes.length - 1)
+	 * @param {Record<string, number>=} size size of the group
+	 */
+	constructor(nodes, similarities, size) {
+		this.nodes = nodes;
+		this.similarities = similarities;
+		this.size = size || sumSize(nodes);
+		/** @type {string} */
+		this.key = undefined;
+	}
+
+	/**
+	 * @param {function(Node): boolean} filter filter function
+	 * @returns {Node[]} removed nodes
+	 */
+	popNodes(filter) {
+		const newNodes = [];
+		const newSimilarities = [];
+		const resultNodes = [];
+		let lastNode;
+		for (let i = 0; i < this.nodes.length; i++) {
+			const node = this.nodes[i];
+			if (filter(node)) {
+				resultNodes.push(node);
+			} else {
+				if (newNodes.length > 0) {
+					newSimilarities.push(
+						lastNode === this.nodes[i - 1]
+							? this.similarities[i - 1]
+							: similarity(lastNode.key, node.key)
+					);
+				}
+				newNodes.push(node);
+				lastNode = node;
+			}
+		}
+		if (resultNodes.length === this.nodes.length) return undefined;
+		this.nodes = newNodes;
+		this.similarities = newSimilarities;
+		this.size = sumSize(newNodes);
+		return resultNodes;
+	}
+}
+
+/**
+ * @param {Iterable<Node>} nodes nodes
+ * @returns {number[]} similarities
+ */
+const getSimilarities = nodes => {
+	// calculate similarities between lexically adjacent nodes
+	/** @type {number[]} */
+	const similarities = [];
+	let last = undefined;
+	for (const node of nodes) {
+		if (last !== undefined) {
+			similarities.push(similarity(last.key, node.key));
+		}
+		last = node;
+	}
+	return similarities;
+};
+
+/**
+ * @template T
+ * @typedef {Object} GroupedItems<T>
+ * @property {string} key
+ * @property {T[]} items
+ * @property {Record<string, number>} size
+ */
+
+/**
+ * @template T
+ * @typedef {Object} Options
+ * @property {Record<string, number>} maxSize maximum size of a group
+ * @property {Record<string, number>} minSize minimum size of a group (preferred over maximum size)
+ * @property {Iterable<T>} items a list of items
+ * @property {function(T): Record<string, number>} getSize function to get size of an item
+ * @property {function(T): string} getKey function to get the key of an item
+ */
+
+/**
+ * @template T
+ * @param {Options<T>} options options object
+ * @returns {GroupedItems<T>[]} grouped items
+ */
+module.exports = ({ maxSize, minSize, items, getSize, getKey }) => {
+	/** @type {Group<T>[]} */
+	const result = [];
+
+	const nodes = Array.from(
+		items,
+		item => new Node(item, getKey(item), getSize(item))
+	);
+
+	/** @type {Node<T>[]} */
+	const initialNodes = [];
+
+	// lexically ordering of keys
+	nodes.sort((a, b) => {
+		if (a.key < b.key) return -1;
+		if (a.key > b.key) return 1;
+		return 0;
+	});
+
+	// return nodes bigger than maxSize directly as group
+	// But make sure that minSize is not violated
+	for (const node of nodes) {
+		if (isTooBig(node.size, maxSize) && !isTooSmall(node.size, minSize)) {
+			result.push(new Group([node], []));
+		} else {
+			initialNodes.push(node);
+		}
+	}
+
+	if (initialNodes.length > 0) {
+		const initialGroup = new Group(initialNodes, getSimilarities(initialNodes));
+
+		const removeProblematicNodes = (group, consideredSize = group.size) => {
+			const problemTypes = getTooSmallTypes(consideredSize, minSize);
+			if (problemTypes.size > 0) {
+				// We hit an edge case where the working set is already smaller than minSize
+				// We merge problematic nodes with the smallest result node to keep minSize intact
+				const problemNodes = group.popNodes(
+					n => getNumberOfMatchingSizeTypes(n.size, problemTypes) > 0
+				);
+				if (problemNodes === undefined) return false;
+				// Only merge it with result nodes that have the problematic size type
+				const possibleResultGroups = result.filter(
+					n => getNumberOfMatchingSizeTypes(n.size, problemTypes) > 0
+				);
+				if (possibleResultGroups.length > 0) {
+					const bestGroup = possibleResultGroups.reduce((min, group) => {
+						const minMatches = getNumberOfMatchingSizeTypes(min, problemTypes);
+						const groupMatches = getNumberOfMatchingSizeTypes(
+							group,
+							problemTypes
+						);
+						if (minMatches !== groupMatches)
+							return minMatches < groupMatches ? group : min;
+						if (
+							selectiveSizeSum(min.size, problemTypes) >
+							selectiveSizeSum(group.size, problemTypes)
+						)
+							return group;
+						return min;
+					});
+					for (const node of problemNodes) bestGroup.nodes.push(node);
+					bestGroup.nodes.sort((a, b) => {
+						if (a.key < b.key) return -1;
+						if (a.key > b.key) return 1;
+						return 0;
+					});
+				} else {
+					// There are no other nodes with the same size types
+					// We create a new group and have to accept that it's smaller than minSize
+					result.push(new Group(problemNodes, null));
+				}
+				return true;
+			} else {
+				return false;
+			}
+		};
+
+		if (initialGroup.nodes.length > 0) {
+			const queue = [initialGroup];
+
+			while (queue.length) {
+				const group = queue.pop();
+				// only groups bigger than maxSize need to be splitted
+				if (!isTooBig(group.size, maxSize)) {
+					result.push(group);
+					continue;
+				}
+				// If the group is already too small
+				// we try to work only with the unproblematic nodes
+				if (removeProblematicNodes(group)) {
+					// This changed something, so we try this group again
+					queue.push(group);
+					continue;
+				}
+
+				// find unsplittable area from left and right
+				// going minSize from left and right
+				// at least one node need to be included otherwise we get stuck
+				let left = 1;
+				let leftSize = Object.create(null);
+				addSizeTo(leftSize, group.nodes[0].size);
+				while (left < group.nodes.length && isTooSmall(leftSize, minSize)) {
+					addSizeTo(leftSize, group.nodes[left].size);
+					left++;
+				}
+				let right = group.nodes.length - 2;
+				let rightSize = Object.create(null);
+				addSizeTo(rightSize, group.nodes[group.nodes.length - 1].size);
+				while (right >= 0 && isTooSmall(rightSize, minSize)) {
+					addSizeTo(rightSize, group.nodes[right].size);
+					right--;
+				}
+
+				//      left v   v right
+				// [ O O O ] O O O [ O O O ]
+				// ^^^^^^^^^ leftSize
+				//       rightSize ^^^^^^^^^
+				// leftSize > minSize
+				// rightSize > minSize
+
+				// Perfect split: [ O O O ] [ O O O ]
+				//                right === left - 1
+
+				if (left - 1 > right) {
+					// We try to remove some problematic nodes to "fix" that
+					let prevSize;
+					if (right < group.nodes.length - left) {
+						subtractSizeFrom(rightSize, group.nodes[right + 1].size);
+						prevSize = rightSize;
+					} else {
+						subtractSizeFrom(leftSize, group.nodes[left - 1].size);
+						prevSize = leftSize;
+					}
+					if (removeProblematicNodes(group, prevSize)) {
+						// This changed something, so we try this group again
+						queue.push(group);
+						continue;
+					}
+					// can't split group while holding minSize
+					// because minSize is preferred of maxSize we return
+					// the problematic nodes as result here even while it's too big
+					// To avoid this make sure maxSize > minSize * 3
+					result.push(group);
+					continue;
+				}
+				if (left <= right) {
+					// when there is a area between left and right
+					// we look for best split point
+					// we split at the minimum similarity
+					// here key space is separated the most
+					// But we also need to make sure to not create too small groups
+					let best = -1;
+					let bestSimilarity = Infinity;
+					let pos = left;
+					let rightSize = sumSize(group.nodes.slice(pos));
+
+					//       pos v   v right
+					// [ O O O ] O O O [ O O O ]
+					// ^^^^^^^^^ leftSize
+					// rightSize ^^^^^^^^^^^^^^^
+
+					while (pos <= right + 1) {
+						const similarity = group.similarities[pos - 1];
+						if (
+							similarity < bestSimilarity &&
+							!isTooSmall(leftSize, minSize) &&
+							!isTooSmall(rightSize, minSize)
+						) {
+							best = pos;
+							bestSimilarity = similarity;
+						}
+						addSizeTo(leftSize, group.nodes[pos].size);
+						subtractSizeFrom(rightSize, group.nodes[pos].size);
+						pos++;
+					}
+					if (best < 0) {
+						// This can't happen
+						// but if that assumption is wrong
+						// fallback to a big group
+						result.push(group);
+						continue;
+					}
+					left = best;
+					right = best - 1;
+				}
+
+				// create two new groups for left and right area
+				// and queue them up
+				const rightNodes = [group.nodes[right + 1]];
+				/** @type {number[]} */
+				const rightSimilarities = [];
+				for (let i = right + 2; i < group.nodes.length; i++) {
+					rightSimilarities.push(group.similarities[i - 1]);
+					rightNodes.push(group.nodes[i]);
+				}
+				queue.push(new Group(rightNodes, rightSimilarities));
+
+				const leftNodes = [group.nodes[0]];
+				/** @type {number[]} */
+				const leftSimilarities = [];
+				for (let i = 1; i < left; i++) {
+					leftSimilarities.push(group.similarities[i - 1]);
+					leftNodes.push(group.nodes[i]);
+				}
+				queue.push(new Group(leftNodes, leftSimilarities));
+			}
+		}
+	}
+
+	// lexically ordering
+	result.sort((a, b) => {
+		if (a.nodes[0].key < b.nodes[0].key) return -1;
+		if (a.nodes[0].key > b.nodes[0].key) return 1;
+		return 0;
+	});
+
+	// give every group a name
+	const usedNames = new Set();
+	for (let i = 0; i < result.length; i++) {
+		const group = result[i];
+		if (group.nodes.length === 1) {
+			group.key = group.nodes[0].key;
+		} else {
+			const first = group.nodes[0];
+			const last = group.nodes[group.nodes.length - 1];
+			const name = getName(first.key, last.key, usedNames);
+			group.key = name;
+		}
+	}
+
+	// return the results
+	return result.map(group => {
+		/** @type {GroupedItems<T>} */
+		return {
+			key: group.key,
+			items: group.nodes.map(node => node.item),
+			size: group.size
+		};
+	});
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/extractUrlAndGlobal.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/extractUrlAndGlobal.js
new file mode 100644
index 0000000..ade0a7c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/extractUrlAndGlobal.js
@@ -0,0 +1,18 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sam Chen @chenxsan
+*/
+
+"use strict";
+
+/**
+ * @param {string} urlAndGlobal the script request
+ * @returns {string[]} script url and its global variable
+ */
+module.exports = function extractUrlAndGlobal(urlAndGlobal) {
+	const index = urlAndGlobal.indexOf("@");
+	if (index <= 0 || index === urlAndGlobal.length - 1) {
+		throw new Error(`Invalid request "${urlAndGlobal}"`);
+	}
+	return [urlAndGlobal.substring(index + 1), urlAndGlobal.substring(0, index)];
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/findGraphRoots.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/findGraphRoots.js
new file mode 100644
index 0000000..272bdf8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/findGraphRoots.js
@@ -0,0 +1,229 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const NO_MARKER = 0;
+const IN_PROGRESS_MARKER = 1;
+const DONE_MARKER = 2;
+const DONE_MAYBE_ROOT_CYCLE_MARKER = 3;
+const DONE_AND_ROOT_MARKER = 4;
+
+/**
+ * @template T
+ */
+class Node {
+	/**
+	 * @param {T} item the value of the node
+	 */
+	constructor(item) {
+		this.item = item;
+		/** @type {Set<Node<T>>} */
+		this.dependencies = new Set();
+		this.marker = NO_MARKER;
+		/** @type {Cycle<T> | undefined} */
+		this.cycle = undefined;
+		this.incoming = 0;
+	}
+}
+
+/**
+ * @template T
+ */
+class Cycle {
+	constructor() {
+		/** @type {Set<Node<T>>} */
+		this.nodes = new Set();
+	}
+}
+
+/**
+ * @template T
+ * @typedef {Object} StackEntry
+ * @property {Node<T>} node
+ * @property {Node<T>[]} openEdges
+ */
+
+/**
+ * @template T
+ * @param {Iterable<T>} items list of items
+ * @param {function(T): Iterable<T>} getDependencies function to get dependencies of an item (items that are not in list are ignored)
+ * @returns {Iterable<T>} graph roots of the items
+ */
+module.exports = (items, getDependencies) => {
+	/** @type {Map<T, Node<T>>} */
+	const itemToNode = new Map();
+	for (const item of items) {
+		const node = new Node(item);
+		itemToNode.set(item, node);
+	}
+
+	// early exit when there is only a single item
+	if (itemToNode.size <= 1) return items;
+
+	// grab all the dependencies
+	for (const node of itemToNode.values()) {
+		for (const dep of getDependencies(node.item)) {
+			const depNode = itemToNode.get(dep);
+			if (depNode !== undefined) {
+				node.dependencies.add(depNode);
+			}
+		}
+	}
+
+	// Set of current root modules
+	// items will be removed if a new reference to it has been found
+	/** @type {Set<Node<T>>} */
+	const roots = new Set();
+
+	// Set of current cycles without references to it
+	// cycles will be removed if a new reference to it has been found
+	// that is not part of the cycle
+	/** @type {Set<Cycle<T>>} */
+	const rootCycles = new Set();
+
+	// For all non-marked nodes
+	for (const selectedNode of itemToNode.values()) {
+		if (selectedNode.marker === NO_MARKER) {
+			// deep-walk all referenced modules
+			// in a non-recursive way
+
+			// start by entering the selected node
+			selectedNode.marker = IN_PROGRESS_MARKER;
+
+			// keep a stack to avoid recursive walk
+			/** @type {StackEntry<T>[]} */
+			const stack = [
+				{
+					node: selectedNode,
+					openEdges: Array.from(selectedNode.dependencies)
+				}
+			];
+
+			// process the top item until stack is empty
+			while (stack.length > 0) {
+				const topOfStack = stack[stack.length - 1];
+
+				// Are there still edges unprocessed in the current node?
+				if (topOfStack.openEdges.length > 0) {
+					// Process one dependency
+					const dependency = topOfStack.openEdges.pop();
+					switch (dependency.marker) {
+						case NO_MARKER:
+							// dependency has not be visited yet
+							// mark it as in-progress and recurse
+							stack.push({
+								node: dependency,
+								openEdges: Array.from(dependency.dependencies)
+							});
+							dependency.marker = IN_PROGRESS_MARKER;
+							break;
+						case IN_PROGRESS_MARKER: {
+							// It's a in-progress cycle
+							let cycle = dependency.cycle;
+							if (!cycle) {
+								cycle = new Cycle();
+								cycle.nodes.add(dependency);
+								dependency.cycle = cycle;
+							}
+							// set cycle property for each node in the cycle
+							// if nodes are already part of a cycle
+							// we merge the cycles to a shared cycle
+							for (
+								let i = stack.length - 1;
+								stack[i].node !== dependency;
+								i--
+							) {
+								const node = stack[i].node;
+								if (node.cycle) {
+									if (node.cycle !== cycle) {
+										// merge cycles
+										for (const cycleNode of node.cycle.nodes) {
+											cycleNode.cycle = cycle;
+											cycle.nodes.add(cycleNode);
+										}
+									}
+								} else {
+									node.cycle = cycle;
+									cycle.nodes.add(node);
+								}
+							}
+							// don't recurse into dependencies
+							// these are already on the stack
+							break;
+						}
+						case DONE_AND_ROOT_MARKER:
+							// This node has be visited yet and is currently a root node
+							// But as this is a new reference to the node
+							// it's not really a root
+							// so we have to convert it to a normal node
+							dependency.marker = DONE_MARKER;
+							roots.delete(dependency);
+							break;
+						case DONE_MAYBE_ROOT_CYCLE_MARKER:
+							// This node has be visited yet and
+							// is maybe currently part of a completed root cycle
+							// we found a new reference to the cycle
+							// so it's not really a root cycle
+							// remove the cycle from the root cycles
+							// and convert it to a normal node
+							rootCycles.delete(dependency.cycle);
+							dependency.marker = DONE_MARKER;
+							break;
+						// DONE_MARKER: nothing to do, don't recurse into dependencies
+					}
+				} else {
+					// All dependencies of the current node has been visited
+					// we leave the node
+					stack.pop();
+					topOfStack.node.marker = DONE_MARKER;
+				}
+			}
+			const cycle = selectedNode.cycle;
+			if (cycle) {
+				for (const node of cycle.nodes) {
+					node.marker = DONE_MAYBE_ROOT_CYCLE_MARKER;
+				}
+				rootCycles.add(cycle);
+			} else {
+				selectedNode.marker = DONE_AND_ROOT_MARKER;
+				roots.add(selectedNode);
+			}
+		}
+	}
+
+	// Extract roots from root cycles
+	// We take the nodes with most incoming edges
+	// inside of the cycle
+	for (const cycle of rootCycles) {
+		let max = 0;
+		/** @type {Set<Node<T>>} */
+		const cycleRoots = new Set();
+		const nodes = cycle.nodes;
+		for (const node of nodes) {
+			for (const dep of node.dependencies) {
+				if (nodes.has(dep)) {
+					dep.incoming++;
+					if (dep.incoming < max) continue;
+					if (dep.incoming > max) {
+						cycleRoots.clear();
+						max = dep.incoming;
+					}
+					cycleRoots.add(dep);
+				}
+			}
+		}
+		for (const cycleRoot of cycleRoots) {
+			roots.add(cycleRoot);
+		}
+	}
+
+	// When roots were found, return them
+	if (roots.size > 0) {
+		return Array.from(roots, r => r.item);
+	} else {
+		throw new Error("Implementation of findGraphRoots is broken");
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/fs.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/fs.js
new file mode 100644
index 0000000..bcbf571
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/fs.js
@@ -0,0 +1,337 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const path = require("path");
+
+/** @typedef {import("../../declarations/WebpackOptions").WatchOptions} WatchOptions */
+/** @typedef {import("../FileSystemInfo").FileSystemInfoEntry} FileSystemInfoEntry */
+
+/**
+ * @typedef {Object} IStats
+ * @property {() => boolean} isFile
+ * @property {() => boolean} isDirectory
+ * @property {() => boolean} isBlockDevice
+ * @property {() => boolean} isCharacterDevice
+ * @property {() => boolean} isSymbolicLink
+ * @property {() => boolean} isFIFO
+ * @property {() => boolean} isSocket
+ * @property {number | bigint} dev
+ * @property {number | bigint} ino
+ * @property {number | bigint} mode
+ * @property {number | bigint} nlink
+ * @property {number | bigint} uid
+ * @property {number | bigint} gid
+ * @property {number | bigint} rdev
+ * @property {number | bigint} size
+ * @property {number | bigint} blksize
+ * @property {number | bigint} blocks
+ * @property {number | bigint} atimeMs
+ * @property {number | bigint} mtimeMs
+ * @property {number | bigint} ctimeMs
+ * @property {number | bigint} birthtimeMs
+ * @property {Date} atime
+ * @property {Date} mtime
+ * @property {Date} ctime
+ * @property {Date} birthtime
+ */
+
+/**
+ * @typedef {Object} IDirent
+ * @property {() => boolean} isFile
+ * @property {() => boolean} isDirectory
+ * @property {() => boolean} isBlockDevice
+ * @property {() => boolean} isCharacterDevice
+ * @property {() => boolean} isSymbolicLink
+ * @property {() => boolean} isFIFO
+ * @property {() => boolean} isSocket
+ * @property {string | Buffer} name
+ */
+
+/** @typedef {function((NodeJS.ErrnoException | null)=): void} Callback */
+/** @typedef {function((NodeJS.ErrnoException | null)=, Buffer=): void} BufferCallback */
+/** @typedef {function((NodeJS.ErrnoException | null)=, Buffer|string=): void} BufferOrStringCallback */
+/** @typedef {function((NodeJS.ErrnoException | null)=, (string | Buffer)[] | IDirent[]=): void} DirentArrayCallback */
+/** @typedef {function((NodeJS.ErrnoException | null)=, string=): void} StringCallback */
+/** @typedef {function((NodeJS.ErrnoException | null)=, number=): void} NumberCallback */
+/** @typedef {function((NodeJS.ErrnoException | null)=, IStats=): void} StatsCallback */
+/** @typedef {function((NodeJS.ErrnoException | Error | null)=, any=): void} ReadJsonCallback */
+/** @typedef {function((NodeJS.ErrnoException | Error | null)=, IStats|string=): void} LstatReadlinkAbsoluteCallback */
+
+/**
+ * @typedef {Object} WatcherInfo
+ * @property {Set<string>} changes get current aggregated changes that have not yet send to callback
+ * @property {Set<string>} removals get current aggregated removals that have not yet send to callback
+ * @property {Map<string, FileSystemInfoEntry | "ignore">} fileTimeInfoEntries get info about files
+ * @property {Map<string, FileSystemInfoEntry | "ignore">} contextTimeInfoEntries get info about directories
+ */
+
+// TODO webpack 6 deprecate missing getInfo
+/**
+ * @typedef {Object} Watcher
+ * @property {function(): void} close closes the watcher and all underlying file watchers
+ * @property {function(): void} pause closes the watcher, but keeps underlying file watchers alive until the next watch call
+ * @property {function(): Set<string>=} getAggregatedChanges get current aggregated changes that have not yet send to callback
+ * @property {function(): Set<string>=} getAggregatedRemovals get current aggregated removals that have not yet send to callback
+ * @property {function(): Map<string, FileSystemInfoEntry | "ignore">} getFileTimeInfoEntries get info about files
+ * @property {function(): Map<string, FileSystemInfoEntry | "ignore">} getContextTimeInfoEntries get info about directories
+ * @property {function(): WatcherInfo=} getInfo get info about timestamps and changes
+ */
+
+/**
+ * @callback WatchMethod
+ * @param {Iterable<string>} files watched files
+ * @param {Iterable<string>} directories watched directories
+ * @param {Iterable<string>} missing watched exitance entries
+ * @param {number} startTime timestamp of start time
+ * @param {WatchOptions} options options object
+ * @param {function(Error=, Map<string, FileSystemInfoEntry | "ignore">, Map<string, FileSystemInfoEntry | "ignore">, Set<string>, Set<string>): void} callback aggregated callback
+ * @param {function(string, number): void} callbackUndelayed callback when the first change was detected
+ * @returns {Watcher} a watcher
+ */
+
+// TODO webpack 6 make optional methods required
+
+/**
+ * @typedef {Object} OutputFileSystem
+ * @property {function(string, Buffer|string, Callback): void} writeFile
+ * @property {function(string, Callback): void} mkdir
+ * @property {function(string, DirentArrayCallback): void=} readdir
+ * @property {function(string, Callback): void=} rmdir
+ * @property {function(string, Callback): void=} unlink
+ * @property {function(string, StatsCallback): void} stat
+ * @property {function(string, StatsCallback): void=} lstat
+ * @property {function(string, BufferOrStringCallback): void} readFile
+ * @property {(function(string, string): string)=} join
+ * @property {(function(string, string): string)=} relative
+ * @property {(function(string): string)=} dirname
+ */
+
+/**
+ * @typedef {Object} InputFileSystem
+ * @property {function(string, BufferOrStringCallback): void} readFile
+ * @property {(function(string, ReadJsonCallback): void)=} readJson
+ * @property {function(string, BufferOrStringCallback): void} readlink
+ * @property {function(string, DirentArrayCallback): void} readdir
+ * @property {function(string, StatsCallback): void} stat
+ * @property {function(string, StatsCallback): void=} lstat
+ * @property {(function(string, BufferOrStringCallback): void)=} realpath
+ * @property {(function(string=): void)=} purge
+ * @property {(function(string, string): string)=} join
+ * @property {(function(string, string): string)=} relative
+ * @property {(function(string): string)=} dirname
+ */
+
+/**
+ * @typedef {Object} WatchFileSystem
+ * @property {WatchMethod} watch
+ */
+
+/**
+ * @typedef {Object} IntermediateFileSystemExtras
+ * @property {function(string): void} mkdirSync
+ * @property {function(string): NodeJS.WritableStream} createWriteStream
+ * @property {function(string, string, NumberCallback): void} open
+ * @property {function(number, Buffer, number, number, number, NumberCallback): void} read
+ * @property {function(number, Callback): void} close
+ * @property {function(string, string, Callback): void} rename
+ */
+
+/** @typedef {InputFileSystem & OutputFileSystem & IntermediateFileSystemExtras} IntermediateFileSystem */
+
+/**
+ *
+ * @param {InputFileSystem|OutputFileSystem|undefined} fs a file system
+ * @param {string} rootPath the root path
+ * @param {string} targetPath the target path
+ * @returns {string} location of targetPath relative to rootPath
+ */
+const relative = (fs, rootPath, targetPath) => {
+	if (fs && fs.relative) {
+		return fs.relative(rootPath, targetPath);
+	} else if (path.posix.isAbsolute(rootPath)) {
+		return path.posix.relative(rootPath, targetPath);
+	} else if (path.win32.isAbsolute(rootPath)) {
+		return path.win32.relative(rootPath, targetPath);
+	} else {
+		throw new Error(
+			`${rootPath} is neither a posix nor a windows path, and there is no 'relative' method defined in the file system`
+		);
+	}
+};
+exports.relative = relative;
+
+/**
+ * @param {InputFileSystem|OutputFileSystem|undefined} fs a file system
+ * @param {string} rootPath a path
+ * @param {string} filename a filename
+ * @returns {string} the joined path
+ */
+const join = (fs, rootPath, filename) => {
+	if (fs && fs.join) {
+		return fs.join(rootPath, filename);
+	} else if (path.posix.isAbsolute(rootPath)) {
+		return path.posix.join(rootPath, filename);
+	} else if (path.win32.isAbsolute(rootPath)) {
+		return path.win32.join(rootPath, filename);
+	} else {
+		throw new Error(
+			`${rootPath} is neither a posix nor a windows path, and there is no 'join' method defined in the file system`
+		);
+	}
+};
+exports.join = join;
+
+/**
+ * @param {InputFileSystem|OutputFileSystem|undefined} fs a file system
+ * @param {string} absPath an absolute path
+ * @returns {string} the parent directory of the absolute path
+ */
+const dirname = (fs, absPath) => {
+	if (fs && fs.dirname) {
+		return fs.dirname(absPath);
+	} else if (path.posix.isAbsolute(absPath)) {
+		return path.posix.dirname(absPath);
+	} else if (path.win32.isAbsolute(absPath)) {
+		return path.win32.dirname(absPath);
+	} else {
+		throw new Error(
+			`${absPath} is neither a posix nor a windows path, and there is no 'dirname' method defined in the file system`
+		);
+	}
+};
+exports.dirname = dirname;
+
+/**
+ * @param {OutputFileSystem} fs a file system
+ * @param {string} p an absolute path
+ * @param {function(Error=): void} callback callback function for the error
+ * @returns {void}
+ */
+const mkdirp = (fs, p, callback) => {
+	fs.mkdir(p, err => {
+		if (err) {
+			if (err.code === "ENOENT") {
+				const dir = dirname(fs, p);
+				if (dir === p) {
+					callback(err);
+					return;
+				}
+				mkdirp(fs, dir, err => {
+					if (err) {
+						callback(err);
+						return;
+					}
+					fs.mkdir(p, err => {
+						if (err) {
+							if (err.code === "EEXIST") {
+								callback();
+								return;
+							}
+							callback(err);
+							return;
+						}
+						callback();
+					});
+				});
+				return;
+			} else if (err.code === "EEXIST") {
+				callback();
+				return;
+			}
+			callback(err);
+			return;
+		}
+		callback();
+	});
+};
+exports.mkdirp = mkdirp;
+
+/**
+ * @param {IntermediateFileSystem} fs a file system
+ * @param {string} p an absolute path
+ * @returns {void}
+ */
+const mkdirpSync = (fs, p) => {
+	try {
+		fs.mkdirSync(p);
+	} catch (err) {
+		if (err) {
+			if (err.code === "ENOENT") {
+				const dir = dirname(fs, p);
+				if (dir === p) {
+					throw err;
+				}
+				mkdirpSync(fs, dir);
+				fs.mkdirSync(p);
+				return;
+			} else if (err.code === "EEXIST") {
+				return;
+			}
+			throw err;
+		}
+	}
+};
+exports.mkdirpSync = mkdirpSync;
+
+/**
+ * @param {InputFileSystem} fs a file system
+ * @param {string} p an absolute path
+ * @param {ReadJsonCallback} callback callback
+ * @returns {void}
+ */
+const readJson = (fs, p, callback) => {
+	if ("readJson" in fs) return fs.readJson(p, callback);
+	fs.readFile(p, (err, buf) => {
+		if (err) return callback(err);
+		let data;
+		try {
+			data = JSON.parse(buf.toString("utf-8"));
+		} catch (e) {
+			return callback(e);
+		}
+		return callback(null, data);
+	});
+};
+exports.readJson = readJson;
+
+/**
+ * @param {InputFileSystem} fs a file system
+ * @param {string} p an absolute path
+ * @param {ReadJsonCallback} callback callback
+ * @returns {void}
+ */
+const lstatReadlinkAbsolute = (fs, p, callback) => {
+	let i = 3;
+	const doReadLink = () => {
+		fs.readlink(p, (err, target) => {
+			if (err && --i > 0) {
+				// It might was just changed from symlink to file
+				// we retry 2 times to catch this case before throwing the error
+				return doStat();
+			}
+			if (err || !target) return doStat();
+			const value = target.toString();
+			callback(null, join(fs, dirname(fs, p), value));
+		});
+	};
+	const doStat = () => {
+		if ("lstat" in fs) {
+			return fs.lstat(p, (err, stats) => {
+				if (err) return callback(err);
+				if (stats.isSymbolicLink()) {
+					return doReadLink();
+				}
+				callback(null, stats);
+			});
+		} else {
+			return fs.stat(p, callback);
+		}
+	};
+	if ("lstat" in fs) return doStat();
+	doReadLink();
+};
+exports.lstatReadlinkAbsolute = lstatReadlinkAbsolute;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/BatchedHash.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/BatchedHash.js
new file mode 100644
index 0000000..b5cd1fb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/BatchedHash.js
@@ -0,0 +1,68 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Hash = require("../Hash");
+const MAX_SHORT_STRING = require("./wasm-hash").MAX_SHORT_STRING;
+
+class BatchedHash extends Hash {
+	constructor(hash) {
+		super();
+		this.string = undefined;
+		this.encoding = undefined;
+		this.hash = hash;
+	}
+
+	/**
+	 * Update hash {@link https://nodejs.org/api/crypto.html#crypto_hash_update_data_inputencoding}
+	 * @param {string|Buffer} data data
+	 * @param {string=} inputEncoding data encoding
+	 * @returns {this} updated hash
+	 */
+	update(data, inputEncoding) {
+		if (this.string !== undefined) {
+			if (
+				typeof data === "string" &&
+				inputEncoding === this.encoding &&
+				this.string.length + data.length < MAX_SHORT_STRING
+			) {
+				this.string += data;
+				return this;
+			}
+			this.hash.update(this.string, this.encoding);
+			this.string = undefined;
+		}
+		if (typeof data === "string") {
+			if (
+				data.length < MAX_SHORT_STRING &&
+				// base64 encoding is not valid since it may contain padding chars
+				(!inputEncoding || !inputEncoding.startsWith("ba"))
+			) {
+				this.string = data;
+				this.encoding = inputEncoding;
+			} else {
+				this.hash.update(data, inputEncoding);
+			}
+		} else {
+			this.hash.update(data);
+		}
+		return this;
+	}
+
+	/**
+	 * Calculates the digest {@link https://nodejs.org/api/crypto.html#crypto_hash_digest_encoding}
+	 * @param {string=} encoding encoding of the return value
+	 * @returns {string|Buffer} digest
+	 */
+	digest(encoding) {
+		if (this.string !== undefined) {
+			this.hash.update(this.string, this.encoding);
+		}
+		return this.hash.digest(encoding);
+	}
+}
+
+module.exports = BatchedHash;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/md4.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/md4.js
new file mode 100644
index 0000000..a03ec66
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/md4.js
@@ -0,0 +1,20 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const create = require("./wasm-hash");
+
+//#region wasm code: md4 (../../../assembly/hash/md4.asm.ts) --initialMemory 1
+const md4 = new WebAssembly.Module(
+	Buffer.from(
+		// 2156 bytes
+		"AGFzbQEAAAABCAJgAX8AYAAAAwUEAQAAAAUDAQABBhoFfwFBAAt/AUEAC38BQQALfwFBAAt/AUEACwciBARpbml0AAAGdXBkYXRlAAIFZmluYWwAAwZtZW1vcnkCAAqLEAQmAEGBxpS6BiQBQYnXtv5+JAJB/rnrxXkkA0H2qMmBASQEQQAkAAvSCgEZfyMBIQUjAiECIwMhAyMEIQQDQCAAIAFLBEAgASgCJCISIAEoAiAiEyABKAIcIgkgASgCGCIIIAEoAhQiByABKAIQIg4gASgCDCIGIAEoAggiDyABKAIEIhAgASgCACIRIAMgBHMgAnEgBHMgBWpqQQN3IgogAiADc3EgA3MgBGpqQQd3IgsgAiAKc3EgAnMgA2pqQQt3IgwgCiALc3EgCnMgAmpqQRN3Ig0gCyAMc3EgC3MgCmpqQQN3IgogDCANc3EgDHMgC2pqQQd3IgsgCiANc3EgDXMgDGpqQQt3IgwgCiALc3EgCnMgDWpqQRN3Ig0gCyAMc3EgC3MgCmpqQQN3IhQgDCANc3EgDHMgC2pqQQd3IRUgASgCLCILIAEoAigiCiAMIA0gDSAUcyAVcXNqakELdyIWIBQgFXNxIBRzIA1qakETdyEXIAEoAjQiGCABKAIwIhkgFSAWcyAXcSAVcyAUampBA3ciFCAWIBdzcSAWcyAVampBB3chFSABKAI8Ig0gASgCOCIMIBQgF3MgFXEgF3MgFmpqQQt3IhYgFCAVc3EgFHMgF2pqQRN3IRcgEyAOIBEgFCAVIBZyIBdxIBUgFnFyampBmfOJ1AVqQQN3IhQgFiAXcnEgFiAXcXIgFWpqQZnzidQFakEFdyIVIBQgF3JxIBQgF3FyIBZqakGZ84nUBWpBCXchFiAPIBggEiAWIAcgFSAQIBQgGSAUIBVyIBZxIBQgFXFyIBdqakGZ84nUBWpBDXciFCAVIBZycSAVIBZxcmpqQZnzidQFakEDdyIVIBQgFnJxIBQgFnFyampBmfOJ1AVqQQV3IhcgFCAVcnEgFCAVcXJqakGZ84nUBWpBCXciFiAVIBdycSAVIBdxciAUampBmfOJ1AVqQQ13IhQgFiAXcnEgFiAXcXIgFWpqQZnzidQFakEDdyEVIBEgBiAVIAwgFCAKIBYgCCAUIBZyIBVxIBQgFnFyIBdqakGZ84nUBWpBBXciFyAUIBVycSAUIBVxcmpqQZnzidQFakEJdyIWIBUgF3JxIBUgF3FyampBmfOJ1AVqQQ13IhQgFiAXcnEgFiAXcXJqakGZ84nUBWpBA3ciFSALIBYgCSAUIBZyIBVxIBQgFnFyIBdqakGZ84nUBWpBBXciFiAUIBVycSAUIBVxcmpqQZnzidQFakEJdyIXIA0gFSAWciAXcSAVIBZxciAUampBmfOJ1AVqQQ13IhRzIBZzampBodfn9gZqQQN3IREgByAIIA4gFCARIBcgESAUc3MgFmogE2pBodfn9gZqQQl3IhNzcyAXampBodfn9gZqQQt3Ig4gDyARIBMgDiARIA4gE3NzIBRqIBlqQaHX5/YGakEPdyIRc3NqakGh1+f2BmpBA3ciDyAOIA8gEXNzIBNqIApqQaHX5/YGakEJdyIKcyARc2pqQaHX5/YGakELdyIIIBAgDyAKIAggDCAPIAggCnNzIBFqakGh1+f2BmpBD3ciDHNzampBodfn9gZqQQN3Ig4gEiAIIAwgDnNzIApqakGh1+f2BmpBCXciCHMgDHNqakGh1+f2BmpBC3chByAFIAYgCCAHIBggDiAHIAhzcyAMampBodfn9gZqQQ93IgpzcyAOampBodfn9gZqQQN3IgZqIQUgDSAGIAkgByAGIAsgByAGIApzcyAIampBodfn9gZqQQl3IgdzIApzampBodfn9gZqQQt3IgYgB3NzIApqakGh1+f2BmpBD3cgAmohAiADIAZqIQMgBCAHaiEEIAFBQGshAQwBCwsgBSQBIAIkAiADJAMgBCQECw0AIAAQASAAIwBqJAAL/wQCA38BfiAAIwBqrUIDhiEEIABByABqQUBxIgJBCGshAyAAIgFBAWohACABQYABOgAAA0AgACACSUEAIABBB3EbBEAgAEEAOgAAIABBAWohAAwBCwsDQCAAIAJJBEAgAEIANwMAIABBCGohAAwBCwsgAyAENwMAIAIQAUEAIwGtIgRC//8DgyAEQoCA/P8Pg0IQhoQiBEL/gYCA8B+DIARCgP6DgIDgP4NCCIaEIgRCj4C8gPCBwAeDQgiGIARC8IHAh4CegPgAg0IEiIQiBEKGjJiw4MCBgwZ8QgSIQoGChIiQoMCAAYNCJ34gBEKw4MCBg4aMmDCEfDcDAEEIIwKtIgRC//8DgyAEQoCA/P8Pg0IQhoQiBEL/gYCA8B+DIARCgP6DgIDgP4NCCIaEIgRCj4C8gPCBwAeDQgiGIARC8IHAh4CegPgAg0IEiIQiBEKGjJiw4MCBgwZ8QgSIQoGChIiQoMCAAYNCJ34gBEKw4MCBg4aMmDCEfDcDAEEQIwOtIgRC//8DgyAEQoCA/P8Pg0IQhoQiBEL/gYCA8B+DIARCgP6DgIDgP4NCCIaEIgRCj4C8gPCBwAeDQgiGIARC8IHAh4CegPgAg0IEiIQiBEKGjJiw4MCBgwZ8QgSIQoGChIiQoMCAAYNCJ34gBEKw4MCBg4aMmDCEfDcDAEEYIwStIgRC//8DgyAEQoCA/P8Pg0IQhoQiBEL/gYCA8B+DIARCgP6DgIDgP4NCCIaEIgRCj4C8gPCBwAeDQgiGIARC8IHAh4CegPgAg0IEiIQiBEKGjJiw4MCBgwZ8QgSIQoGChIiQoMCAAYNCJ34gBEKw4MCBg4aMmDCEfDcDAAs=",
+		"base64"
+	)
+);
+//#endregion
+
+module.exports = create.bind(null, md4, [], 64, 32);
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/wasm-hash.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/wasm-hash.js
new file mode 100644
index 0000000..a43fa13
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/wasm-hash.js
@@ -0,0 +1,163 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+// 65536 is the size of a wasm memory page
+// 64 is the maximum chunk size for every possible wasm hash implementation
+// 4 is the maximum number of bytes per char for string encoding (max is utf-8)
+// ~3 makes sure that it's always a block of 4 chars, so avoid partially encoded bytes for base64
+const MAX_SHORT_STRING = Math.floor((65536 - 64) / 4) & ~3;
+
+class WasmHash {
+	/**
+	 * @param {WebAssembly.Instance} instance wasm instance
+	 * @param {WebAssembly.Instance[]} instancesPool pool of instances
+	 * @param {number} chunkSize size of data chunks passed to wasm
+	 * @param {number} digestSize size of digest returned by wasm
+	 */
+	constructor(instance, instancesPool, chunkSize, digestSize) {
+		const exports = /** @type {any} */ (instance.exports);
+		exports.init();
+		this.exports = exports;
+		this.mem = Buffer.from(exports.memory.buffer, 0, 65536);
+		this.buffered = 0;
+		this.instancesPool = instancesPool;
+		this.chunkSize = chunkSize;
+		this.digestSize = digestSize;
+	}
+
+	reset() {
+		this.buffered = 0;
+		this.exports.init();
+	}
+
+	/**
+	 * @param {Buffer | string} data data
+	 * @param {BufferEncoding=} encoding encoding
+	 * @returns {this} itself
+	 */
+	update(data, encoding) {
+		if (typeof data === "string") {
+			while (data.length > MAX_SHORT_STRING) {
+				this._updateWithShortString(data.slice(0, MAX_SHORT_STRING), encoding);
+				data = data.slice(MAX_SHORT_STRING);
+			}
+			this._updateWithShortString(data, encoding);
+			return this;
+		}
+		this._updateWithBuffer(data);
+		return this;
+	}
+
+	/**
+	 * @param {string} data data
+	 * @param {BufferEncoding=} encoding encoding
+	 * @returns {void}
+	 */
+	_updateWithShortString(data, encoding) {
+		const { exports, buffered, mem, chunkSize } = this;
+		let endPos;
+		if (data.length < 70) {
+			if (!encoding || encoding === "utf-8" || encoding === "utf8") {
+				endPos = buffered;
+				for (let i = 0; i < data.length; i++) {
+					const cc = data.charCodeAt(i);
+					if (cc < 0x80) mem[endPos++] = cc;
+					else if (cc < 0x800) {
+						mem[endPos] = (cc >> 6) | 0xc0;
+						mem[endPos + 1] = (cc & 0x3f) | 0x80;
+						endPos += 2;
+					} else {
+						// bail-out for weird chars
+						endPos += mem.write(data.slice(i), endPos, encoding);
+						break;
+					}
+				}
+			} else if (encoding === "latin1") {
+				endPos = buffered;
+				for (let i = 0; i < data.length; i++) {
+					const cc = data.charCodeAt(i);
+					mem[endPos++] = cc;
+				}
+			} else {
+				endPos = buffered + mem.write(data, buffered, encoding);
+			}
+		} else {
+			endPos = buffered + mem.write(data, buffered, encoding);
+		}
+		if (endPos < chunkSize) {
+			this.buffered = endPos;
+		} else {
+			const l = endPos & ~(this.chunkSize - 1);
+			exports.update(l);
+			const newBuffered = endPos - l;
+			this.buffered = newBuffered;
+			if (newBuffered > 0) mem.copyWithin(0, l, endPos);
+		}
+	}
+
+	/**
+	 * @param {Buffer} data data
+	 * @returns {void}
+	 */
+	_updateWithBuffer(data) {
+		const { exports, buffered, mem } = this;
+		const length = data.length;
+		if (buffered + length < this.chunkSize) {
+			data.copy(mem, buffered, 0, length);
+			this.buffered += length;
+		} else {
+			const l = (buffered + length) & ~(this.chunkSize - 1);
+			if (l > 65536) {
+				let i = 65536 - buffered;
+				data.copy(mem, buffered, 0, i);
+				exports.update(65536);
+				const stop = l - buffered - 65536;
+				while (i < stop) {
+					data.copy(mem, 0, i, i + 65536);
+					exports.update(65536);
+					i += 65536;
+				}
+				data.copy(mem, 0, i, l - buffered);
+				exports.update(l - buffered - i);
+			} else {
+				data.copy(mem, buffered, 0, l - buffered);
+				exports.update(l);
+			}
+			const newBuffered = length + buffered - l;
+			this.buffered = newBuffered;
+			if (newBuffered > 0) data.copy(mem, 0, length - newBuffered, length);
+		}
+	}
+
+	digest(type) {
+		const { exports, buffered, mem, digestSize } = this;
+		exports.final(buffered);
+		this.instancesPool.push(this);
+		const hex = mem.toString("latin1", 0, digestSize);
+		if (type === "hex") return hex;
+		if (type === "binary" || !type) return Buffer.from(hex, "hex");
+		return Buffer.from(hex, "hex").toString(type);
+	}
+}
+
+const create = (wasmModule, instancesPool, chunkSize, digestSize) => {
+	if (instancesPool.length > 0) {
+		const old = instancesPool.pop();
+		old.reset();
+		return old;
+	} else {
+		return new WasmHash(
+			new WebAssembly.Instance(wasmModule),
+			instancesPool,
+			chunkSize,
+			digestSize
+		);
+	}
+};
+
+module.exports = create;
+module.exports.MAX_SHORT_STRING = MAX_SHORT_STRING;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/xxhash64.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/xxhash64.js
new file mode 100644
index 0000000..0483b50
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/hash/xxhash64.js
@@ -0,0 +1,20 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const create = require("./wasm-hash");
+
+//#region wasm code: xxhash64 (../../../assembly/hash/xxhash64.asm.ts) --initialMemory 1
+const xxhash64 = new WebAssembly.Module(
+	Buffer.from(
+		// 1170 bytes
+		"AGFzbQEAAAABCAJgAX8AYAAAAwQDAQAABQMBAAEGGgV+AUIAC34BQgALfgFCAAt+AUIAC34BQgALByIEBGluaXQAAAZ1cGRhdGUAAQVmaW5hbAACBm1lbW9yeQIACrIIAzAAQtbrgu7q/Yn14AAkAELP1tO+0ser2UIkAUIAJAJC+erQ0OfJoeThACQDQgAkBAvUAQIBfwR+IABFBEAPCyMEIACtfCQEIwAhAiMBIQMjAiEEIwMhBQNAIAIgASkDAELP1tO+0ser2UJ+fEIfiUKHla+vmLbem55/fiECIAMgASkDCELP1tO+0ser2UJ+fEIfiUKHla+vmLbem55/fiEDIAQgASkDEELP1tO+0ser2UJ+fEIfiUKHla+vmLbem55/fiEEIAUgASkDGELP1tO+0ser2UJ+fEIfiUKHla+vmLbem55/fiEFIAAgAUEgaiIBSw0ACyACJAAgAyQBIAQkAiAFJAMLqAYCAX8EfiMEQgBSBH4jACICQgGJIwEiA0IHiXwjAiIEQgyJfCMDIgVCEol8IAJCz9bTvtLHq9lCfkIfiUKHla+vmLbem55/foVCh5Wvr5i23puef35CnaO16oOxjYr6AH0gA0LP1tO+0ser2UJ+Qh+JQoeVr6+Ytt6bnn9+hUKHla+vmLbem55/fkKdo7Xqg7GNivoAfSAEQs/W077Sx6vZQn5CH4lCh5Wvr5i23puef36FQoeVr6+Ytt6bnn9+Qp2jteqDsY2K+gB9IAVCz9bTvtLHq9lCfkIfiUKHla+vmLbem55/foVCh5Wvr5i23puef35CnaO16oOxjYr6AH0FQsXP2bLx5brqJwsjBCAArXx8IQIDQCABQQhqIABNBEAgAiABKQMAQs/W077Sx6vZQn5CH4lCh5Wvr5i23puef36FQhuJQoeVr6+Ytt6bnn9+Qp2jteqDsY2K+gB9IQIgAUEIaiEBDAELCyABQQRqIABNBEAgAiABNQIAQoeVr6+Ytt6bnn9+hUIXiULP1tO+0ser2UJ+Qvnz3fGZ9pmrFnwhAiABQQRqIQELA0AgACABRwRAIAIgATEAAELFz9my8eW66id+hUILiUKHla+vmLbem55/fiECIAFBAWohAQwBCwtBACACIAJCIYiFQs/W077Sx6vZQn4iAkIdiCAChUL5893xmfaZqxZ+IgJCIIggAoUiAkIgiCIDQv//A4NCIIYgA0KAgPz/D4NCEIiEIgNC/4GAgPAfg0IQhiADQoD+g4CA4D+DQgiIhCIDQo+AvIDwgcAHg0IIhiADQvCBwIeAnoD4AINCBIiEIgNChoyYsODAgYMGfEIEiEKBgoSIkKDAgAGDQid+IANCsODAgYOGjJgwhHw3AwBBCCACQv////8PgyICQv//A4NCIIYgAkKAgPz/D4NCEIiEIgJC/4GAgPAfg0IQhiACQoD+g4CA4D+DQgiIhCICQo+AvIDwgcAHg0IIhiACQvCBwIeAnoD4AINCBIiEIgJChoyYsODAgYMGfEIEiEKBgoSIkKDAgAGDQid+IAJCsODAgYOGjJgwhHw3AwAL",
+		"base64"
+	)
+);
+//#endregion
+
+module.exports = create.bind(null, xxhash64, [], 32, 16);
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/identifier.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/identifier.js
new file mode 100644
index 0000000..dd56ddf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/identifier.js
@@ -0,0 +1,377 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const path = require("path");
+
+const WINDOWS_ABS_PATH_REGEXP = /^[a-zA-Z]:[\\/]/;
+const SEGMENTS_SPLIT_REGEXP = /([|!])/;
+const WINDOWS_PATH_SEPARATOR_REGEXP = /\\/g;
+
+/**
+ * @typedef {Object} MakeRelativePathsCache
+ * @property {Map<string, Map<string, string>>=} relativePaths
+ */
+
+const relativePathToRequest = relativePath => {
+	if (relativePath === "") return "./.";
+	if (relativePath === "..") return "../.";
+	if (relativePath.startsWith("../")) return relativePath;
+	return `./${relativePath}`;
+};
+
+/**
+ * @param {string} context context for relative path
+ * @param {string} maybeAbsolutePath path to make relative
+ * @returns {string} relative path in request style
+ */
+const absoluteToRequest = (context, maybeAbsolutePath) => {
+	if (maybeAbsolutePath[0] === "/") {
+		if (
+			maybeAbsolutePath.length > 1 &&
+			maybeAbsolutePath[maybeAbsolutePath.length - 1] === "/"
+		) {
+			// this 'path' is actually a regexp generated by dynamic requires.
+			// Don't treat it as an absolute path.
+			return maybeAbsolutePath;
+		}
+
+		const querySplitPos = maybeAbsolutePath.indexOf("?");
+		let resource =
+			querySplitPos === -1
+				? maybeAbsolutePath
+				: maybeAbsolutePath.slice(0, querySplitPos);
+		resource = relativePathToRequest(path.posix.relative(context, resource));
+		return querySplitPos === -1
+			? resource
+			: resource + maybeAbsolutePath.slice(querySplitPos);
+	}
+
+	if (WINDOWS_ABS_PATH_REGEXP.test(maybeAbsolutePath)) {
+		const querySplitPos = maybeAbsolutePath.indexOf("?");
+		let resource =
+			querySplitPos === -1
+				? maybeAbsolutePath
+				: maybeAbsolutePath.slice(0, querySplitPos);
+		resource = path.win32.relative(context, resource);
+		if (!WINDOWS_ABS_PATH_REGEXP.test(resource)) {
+			resource = relativePathToRequest(
+				resource.replace(WINDOWS_PATH_SEPARATOR_REGEXP, "/")
+			);
+		}
+		return querySplitPos === -1
+			? resource
+			: resource + maybeAbsolutePath.slice(querySplitPos);
+	}
+
+	// not an absolute path
+	return maybeAbsolutePath;
+};
+
+/**
+ * @param {string} context context for relative path
+ * @param {string} relativePath path
+ * @returns {string} absolute path
+ */
+const requestToAbsolute = (context, relativePath) => {
+	if (relativePath.startsWith("./") || relativePath.startsWith("../"))
+		return path.join(context, relativePath);
+	return relativePath;
+};
+
+const makeCacheable = realFn => {
+	/** @type {WeakMap<object, Map<string, ParsedResource>>} */
+	const cache = new WeakMap();
+
+	const getCache = associatedObjectForCache => {
+		const entry = cache.get(associatedObjectForCache);
+		if (entry !== undefined) return entry;
+		/** @type {Map<string, ParsedResource>} */
+		const map = new Map();
+		cache.set(associatedObjectForCache, map);
+		return map;
+	};
+
+	/**
+	 * @param {string} str the path with query and fragment
+	 * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+	 * @returns {ParsedResource} parsed parts
+	 */
+	const fn = (str, associatedObjectForCache) => {
+		if (!associatedObjectForCache) return realFn(str);
+		const cache = getCache(associatedObjectForCache);
+		const entry = cache.get(str);
+		if (entry !== undefined) return entry;
+		const result = realFn(str);
+		cache.set(str, result);
+		return result;
+	};
+
+	fn.bindCache = associatedObjectForCache => {
+		const cache = getCache(associatedObjectForCache);
+		return str => {
+			const entry = cache.get(str);
+			if (entry !== undefined) return entry;
+			const result = realFn(str);
+			cache.set(str, result);
+			return result;
+		};
+	};
+
+	return fn;
+};
+
+const makeCacheableWithContext = fn => {
+	/** @type {WeakMap<object, Map<string, Map<string, string>>>} */
+	const cache = new WeakMap();
+
+	/**
+	 * @param {string} context context used to create relative path
+	 * @param {string} identifier identifier used to create relative path
+	 * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+	 * @returns {string} the returned relative path
+	 */
+	const cachedFn = (context, identifier, associatedObjectForCache) => {
+		if (!associatedObjectForCache) return fn(context, identifier);
+
+		let innerCache = cache.get(associatedObjectForCache);
+		if (innerCache === undefined) {
+			innerCache = new Map();
+			cache.set(associatedObjectForCache, innerCache);
+		}
+
+		let cachedResult;
+		let innerSubCache = innerCache.get(context);
+		if (innerSubCache === undefined) {
+			innerCache.set(context, (innerSubCache = new Map()));
+		} else {
+			cachedResult = innerSubCache.get(identifier);
+		}
+
+		if (cachedResult !== undefined) {
+			return cachedResult;
+		} else {
+			const result = fn(context, identifier);
+			innerSubCache.set(identifier, result);
+			return result;
+		}
+	};
+
+	/**
+	 * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+	 * @returns {function(string, string): string} cached function
+	 */
+	cachedFn.bindCache = associatedObjectForCache => {
+		let innerCache;
+		if (associatedObjectForCache) {
+			innerCache = cache.get(associatedObjectForCache);
+			if (innerCache === undefined) {
+				innerCache = new Map();
+				cache.set(associatedObjectForCache, innerCache);
+			}
+		} else {
+			innerCache = new Map();
+		}
+
+		/**
+		 * @param {string} context context used to create relative path
+		 * @param {string} identifier identifier used to create relative path
+		 * @returns {string} the returned relative path
+		 */
+		const boundFn = (context, identifier) => {
+			let cachedResult;
+			let innerSubCache = innerCache.get(context);
+			if (innerSubCache === undefined) {
+				innerCache.set(context, (innerSubCache = new Map()));
+			} else {
+				cachedResult = innerSubCache.get(identifier);
+			}
+
+			if (cachedResult !== undefined) {
+				return cachedResult;
+			} else {
+				const result = fn(context, identifier);
+				innerSubCache.set(identifier, result);
+				return result;
+			}
+		};
+
+		return boundFn;
+	};
+
+	/**
+	 * @param {string} context context used to create relative path
+	 * @param {Object=} associatedObjectForCache an object to which the cache will be attached
+	 * @returns {function(string): string} cached function
+	 */
+	cachedFn.bindContextCache = (context, associatedObjectForCache) => {
+		let innerSubCache;
+		if (associatedObjectForCache) {
+			let innerCache = cache.get(associatedObjectForCache);
+			if (innerCache === undefined) {
+				innerCache = new Map();
+				cache.set(associatedObjectForCache, innerCache);
+			}
+
+			innerSubCache = innerCache.get(context);
+			if (innerSubCache === undefined) {
+				innerCache.set(context, (innerSubCache = new Map()));
+			}
+		} else {
+			innerSubCache = new Map();
+		}
+
+		/**
+		 * @param {string} identifier identifier used to create relative path
+		 * @returns {string} the returned relative path
+		 */
+		const boundFn = identifier => {
+			const cachedResult = innerSubCache.get(identifier);
+			if (cachedResult !== undefined) {
+				return cachedResult;
+			} else {
+				const result = fn(context, identifier);
+				innerSubCache.set(identifier, result);
+				return result;
+			}
+		};
+
+		return boundFn;
+	};
+
+	return cachedFn;
+};
+
+/**
+ *
+ * @param {string} context context for relative path
+ * @param {string} identifier identifier for path
+ * @returns {string} a converted relative path
+ */
+const _makePathsRelative = (context, identifier) => {
+	return identifier
+		.split(SEGMENTS_SPLIT_REGEXP)
+		.map(str => absoluteToRequest(context, str))
+		.join("");
+};
+
+exports.makePathsRelative = makeCacheableWithContext(_makePathsRelative);
+
+/**
+ *
+ * @param {string} context context for relative path
+ * @param {string} identifier identifier for path
+ * @returns {string} a converted relative path
+ */
+const _makePathsAbsolute = (context, identifier) => {
+	return identifier
+		.split(SEGMENTS_SPLIT_REGEXP)
+		.map(str => requestToAbsolute(context, str))
+		.join("");
+};
+
+exports.makePathsAbsolute = makeCacheableWithContext(_makePathsAbsolute);
+
+/**
+ * @param {string} context absolute context path
+ * @param {string} request any request string may containing absolute paths, query string, etc.
+ * @returns {string} a new request string avoiding absolute paths when possible
+ */
+const _contextify = (context, request) => {
+	return request
+		.split("!")
+		.map(r => absoluteToRequest(context, r))
+		.join("!");
+};
+
+const contextify = makeCacheableWithContext(_contextify);
+exports.contextify = contextify;
+
+/**
+ * @param {string} context absolute context path
+ * @param {string} request any request string
+ * @returns {string} a new request string using absolute paths when possible
+ */
+const _absolutify = (context, request) => {
+	return request
+		.split("!")
+		.map(r => requestToAbsolute(context, r))
+		.join("!");
+};
+
+const absolutify = makeCacheableWithContext(_absolutify);
+exports.absolutify = absolutify;
+
+const PATH_QUERY_FRAGMENT_REGEXP =
+	/^((?:\0.|[^?#\0])*)(\?(?:\0.|[^#\0])*)?(#.*)?$/;
+const PATH_QUERY_REGEXP = /^((?:\0.|[^?\0])*)(\?.*)?$/;
+
+/** @typedef {{ resource: string, path: string, query: string, fragment: string }} ParsedResource */
+/** @typedef {{ resource: string, path: string, query: string }} ParsedResourceWithoutFragment */
+
+/**
+ * @param {string} str the path with query and fragment
+ * @returns {ParsedResource} parsed parts
+ */
+const _parseResource = str => {
+	const match = PATH_QUERY_FRAGMENT_REGEXP.exec(str);
+	return {
+		resource: str,
+		path: match[1].replace(/\0(.)/g, "$1"),
+		query: match[2] ? match[2].replace(/\0(.)/g, "$1") : "",
+		fragment: match[3] || ""
+	};
+};
+exports.parseResource = makeCacheable(_parseResource);
+
+/**
+ * Parse resource, skips fragment part
+ * @param {string} str the path with query and fragment
+ * @returns {ParsedResourceWithoutFragment} parsed parts
+ */
+const _parseResourceWithoutFragment = str => {
+	const match = PATH_QUERY_REGEXP.exec(str);
+	return {
+		resource: str,
+		path: match[1].replace(/\0(.)/g, "$1"),
+		query: match[2] ? match[2].replace(/\0(.)/g, "$1") : ""
+	};
+};
+exports.parseResourceWithoutFragment = makeCacheable(
+	_parseResourceWithoutFragment
+);
+
+/**
+ * @param {string} filename the filename which should be undone
+ * @param {string} outputPath the output path that is restored (only relevant when filename contains "..")
+ * @param {boolean} enforceRelative true returns ./ for empty paths
+ * @returns {string} repeated ../ to leave the directory of the provided filename to be back on output dir
+ */
+exports.getUndoPath = (filename, outputPath, enforceRelative) => {
+	let depth = -1;
+	let append = "";
+	outputPath = outputPath.replace(/[\\/]$/, "");
+	for (const part of filename.split(/[/\\]+/)) {
+		if (part === "..") {
+			if (depth > -1) {
+				depth--;
+			} else {
+				const i = outputPath.lastIndexOf("/");
+				const j = outputPath.lastIndexOf("\\");
+				const pos = i < 0 ? j : j < 0 ? i : Math.max(i, j);
+				if (pos < 0) return outputPath + "/";
+				append = outputPath.slice(pos + 1) + "/" + append;
+				outputPath = outputPath.slice(0, pos);
+			}
+		} else if (part !== ".") {
+			depth++;
+		}
+	}
+	return depth > 0
+		? `${"../".repeat(depth)}${append}`
+		: enforceRelative
+		? `./${append}`
+		: append;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/internalSerializables.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/internalSerializables.js
new file mode 100644
index 0000000..eabbb58
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/internalSerializables.js
@@ -0,0 +1,211 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+// We need to include a list of requires here
+// to allow webpack to be bundled with only static requires
+// We could use a dynamic require(`../${request}`) but this
+// would include too many modules and not every tool is able
+// to process this
+module.exports = {
+	AsyncDependenciesBlock: () => require("../AsyncDependenciesBlock"),
+	CommentCompilationWarning: () => require("../CommentCompilationWarning"),
+	ContextModule: () => require("../ContextModule"),
+	"cache/PackFileCacheStrategy": () =>
+		require("../cache/PackFileCacheStrategy"),
+	"cache/ResolverCachePlugin": () => require("../cache/ResolverCachePlugin"),
+	"container/ContainerEntryDependency": () =>
+		require("../container/ContainerEntryDependency"),
+	"container/ContainerEntryModule": () =>
+		require("../container/ContainerEntryModule"),
+	"container/ContainerExposedDependency": () =>
+		require("../container/ContainerExposedDependency"),
+	"container/FallbackDependency": () =>
+		require("../container/FallbackDependency"),
+	"container/FallbackItemDependency": () =>
+		require("../container/FallbackItemDependency"),
+	"container/FallbackModule": () => require("../container/FallbackModule"),
+	"container/RemoteModule": () => require("../container/RemoteModule"),
+	"container/RemoteToExternalDependency": () =>
+		require("../container/RemoteToExternalDependency"),
+	"dependencies/AMDDefineDependency": () =>
+		require("../dependencies/AMDDefineDependency"),
+	"dependencies/AMDRequireArrayDependency": () =>
+		require("../dependencies/AMDRequireArrayDependency"),
+	"dependencies/AMDRequireContextDependency": () =>
+		require("../dependencies/AMDRequireContextDependency"),
+	"dependencies/AMDRequireDependenciesBlock": () =>
+		require("../dependencies/AMDRequireDependenciesBlock"),
+	"dependencies/AMDRequireDependency": () =>
+		require("../dependencies/AMDRequireDependency"),
+	"dependencies/AMDRequireItemDependency": () =>
+		require("../dependencies/AMDRequireItemDependency"),
+	"dependencies/CachedConstDependency": () =>
+		require("../dependencies/CachedConstDependency"),
+	"dependencies/CreateScriptUrlDependency": () =>
+		require("../dependencies/CreateScriptUrlDependency"),
+	"dependencies/CommonJsRequireContextDependency": () =>
+		require("../dependencies/CommonJsRequireContextDependency"),
+	"dependencies/CommonJsExportRequireDependency": () =>
+		require("../dependencies/CommonJsExportRequireDependency"),
+	"dependencies/CommonJsExportsDependency": () =>
+		require("../dependencies/CommonJsExportsDependency"),
+	"dependencies/CommonJsFullRequireDependency": () =>
+		require("../dependencies/CommonJsFullRequireDependency"),
+	"dependencies/CommonJsRequireDependency": () =>
+		require("../dependencies/CommonJsRequireDependency"),
+	"dependencies/CommonJsSelfReferenceDependency": () =>
+		require("../dependencies/CommonJsSelfReferenceDependency"),
+	"dependencies/ConstDependency": () =>
+		require("../dependencies/ConstDependency"),
+	"dependencies/ContextDependency": () =>
+		require("../dependencies/ContextDependency"),
+	"dependencies/ContextElementDependency": () =>
+		require("../dependencies/ContextElementDependency"),
+	"dependencies/CriticalDependencyWarning": () =>
+		require("../dependencies/CriticalDependencyWarning"),
+	"dependencies/CssImportDependency": () =>
+		require("../dependencies/CssImportDependency"),
+	"dependencies/CssLocalIdentifierDependency": () =>
+		require("../dependencies/CssLocalIdentifierDependency"),
+	"dependencies/CssSelfLocalIdentifierDependency": () =>
+		require("../dependencies/CssSelfLocalIdentifierDependency"),
+	"dependencies/CssExportDependency": () =>
+		require("../dependencies/CssExportDependency"),
+	"dependencies/CssUrlDependency": () =>
+		require("../dependencies/CssUrlDependency"),
+	"dependencies/DelegatedSourceDependency": () =>
+		require("../dependencies/DelegatedSourceDependency"),
+	"dependencies/DllEntryDependency": () =>
+		require("../dependencies/DllEntryDependency"),
+	"dependencies/EntryDependency": () =>
+		require("../dependencies/EntryDependency"),
+	"dependencies/ExportsInfoDependency": () =>
+		require("../dependencies/ExportsInfoDependency"),
+	"dependencies/HarmonyAcceptDependency": () =>
+		require("../dependencies/HarmonyAcceptDependency"),
+	"dependencies/HarmonyAcceptImportDependency": () =>
+		require("../dependencies/HarmonyAcceptImportDependency"),
+	"dependencies/HarmonyCompatibilityDependency": () =>
+		require("../dependencies/HarmonyCompatibilityDependency"),
+	"dependencies/HarmonyExportExpressionDependency": () =>
+		require("../dependencies/HarmonyExportExpressionDependency"),
+	"dependencies/HarmonyExportHeaderDependency": () =>
+		require("../dependencies/HarmonyExportHeaderDependency"),
+	"dependencies/HarmonyExportImportedSpecifierDependency": () =>
+		require("../dependencies/HarmonyExportImportedSpecifierDependency"),
+	"dependencies/HarmonyExportSpecifierDependency": () =>
+		require("../dependencies/HarmonyExportSpecifierDependency"),
+	"dependencies/HarmonyImportSideEffectDependency": () =>
+		require("../dependencies/HarmonyImportSideEffectDependency"),
+	"dependencies/HarmonyImportSpecifierDependency": () =>
+		require("../dependencies/HarmonyImportSpecifierDependency"),
+	"dependencies/ImportContextDependency": () =>
+		require("../dependencies/ImportContextDependency"),
+	"dependencies/ImportDependency": () =>
+		require("../dependencies/ImportDependency"),
+	"dependencies/ImportEagerDependency": () =>
+		require("../dependencies/ImportEagerDependency"),
+	"dependencies/ImportWeakDependency": () =>
+		require("../dependencies/ImportWeakDependency"),
+	"dependencies/JsonExportsDependency": () =>
+		require("../dependencies/JsonExportsDependency"),
+	"dependencies/LocalModule": () => require("../dependencies/LocalModule"),
+	"dependencies/LocalModuleDependency": () =>
+		require("../dependencies/LocalModuleDependency"),
+	"dependencies/ModuleDecoratorDependency": () =>
+		require("../dependencies/ModuleDecoratorDependency"),
+	"dependencies/ModuleHotAcceptDependency": () =>
+		require("../dependencies/ModuleHotAcceptDependency"),
+	"dependencies/ModuleHotDeclineDependency": () =>
+		require("../dependencies/ModuleHotDeclineDependency"),
+	"dependencies/ImportMetaHotAcceptDependency": () =>
+		require("../dependencies/ImportMetaHotAcceptDependency"),
+	"dependencies/ImportMetaHotDeclineDependency": () =>
+		require("../dependencies/ImportMetaHotDeclineDependency"),
+	"dependencies/ImportMetaContextDependency": () =>
+		require("../dependencies/ImportMetaContextDependency"),
+	"dependencies/ProvidedDependency": () =>
+		require("../dependencies/ProvidedDependency"),
+	"dependencies/PureExpressionDependency": () =>
+		require("../dependencies/PureExpressionDependency"),
+	"dependencies/RequireContextDependency": () =>
+		require("../dependencies/RequireContextDependency"),
+	"dependencies/RequireEnsureDependenciesBlock": () =>
+		require("../dependencies/RequireEnsureDependenciesBlock"),
+	"dependencies/RequireEnsureDependency": () =>
+		require("../dependencies/RequireEnsureDependency"),
+	"dependencies/RequireEnsureItemDependency": () =>
+		require("../dependencies/RequireEnsureItemDependency"),
+	"dependencies/RequireHeaderDependency": () =>
+		require("../dependencies/RequireHeaderDependency"),
+	"dependencies/RequireIncludeDependency": () =>
+		require("../dependencies/RequireIncludeDependency"),
+	"dependencies/RequireIncludeDependencyParserPlugin": () =>
+		require("../dependencies/RequireIncludeDependencyParserPlugin"),
+	"dependencies/RequireResolveContextDependency": () =>
+		require("../dependencies/RequireResolveContextDependency"),
+	"dependencies/RequireResolveDependency": () =>
+		require("../dependencies/RequireResolveDependency"),
+	"dependencies/RequireResolveHeaderDependency": () =>
+		require("../dependencies/RequireResolveHeaderDependency"),
+	"dependencies/RuntimeRequirementsDependency": () =>
+		require("../dependencies/RuntimeRequirementsDependency"),
+	"dependencies/StaticExportsDependency": () =>
+		require("../dependencies/StaticExportsDependency"),
+	"dependencies/SystemPlugin": () => require("../dependencies/SystemPlugin"),
+	"dependencies/UnsupportedDependency": () =>
+		require("../dependencies/UnsupportedDependency"),
+	"dependencies/URLDependency": () => require("../dependencies/URLDependency"),
+	"dependencies/WebAssemblyExportImportedDependency": () =>
+		require("../dependencies/WebAssemblyExportImportedDependency"),
+	"dependencies/WebAssemblyImportDependency": () =>
+		require("../dependencies/WebAssemblyImportDependency"),
+	"dependencies/WebpackIsIncludedDependency": () =>
+		require("../dependencies/WebpackIsIncludedDependency"),
+	"dependencies/WorkerDependency": () =>
+		require("../dependencies/WorkerDependency"),
+	"json/JsonData": () => require("../json/JsonData"),
+	"optimize/ConcatenatedModule": () =>
+		require("../optimize/ConcatenatedModule"),
+	DelegatedModule: () => require("../DelegatedModule"),
+	DependenciesBlock: () => require("../DependenciesBlock"),
+	DllModule: () => require("../DllModule"),
+	ExternalModule: () => require("../ExternalModule"),
+	FileSystemInfo: () => require("../FileSystemInfo"),
+	InitFragment: () => require("../InitFragment"),
+	InvalidDependenciesModuleWarning: () =>
+		require("../InvalidDependenciesModuleWarning"),
+	Module: () => require("../Module"),
+	ModuleBuildError: () => require("../ModuleBuildError"),
+	ModuleDependencyWarning: () => require("../ModuleDependencyWarning"),
+	ModuleError: () => require("../ModuleError"),
+	ModuleGraph: () => require("../ModuleGraph"),
+	ModuleParseError: () => require("../ModuleParseError"),
+	ModuleWarning: () => require("../ModuleWarning"),
+	NormalModule: () => require("../NormalModule"),
+	RawDataUrlModule: () => require("../asset/RawDataUrlModule"),
+	RawModule: () => require("../RawModule"),
+	"sharing/ConsumeSharedModule": () =>
+		require("../sharing/ConsumeSharedModule"),
+	"sharing/ConsumeSharedFallbackDependency": () =>
+		require("../sharing/ConsumeSharedFallbackDependency"),
+	"sharing/ProvideSharedModule": () =>
+		require("../sharing/ProvideSharedModule"),
+	"sharing/ProvideSharedDependency": () =>
+		require("../sharing/ProvideSharedDependency"),
+	"sharing/ProvideForSharedDependency": () =>
+		require("../sharing/ProvideForSharedDependency"),
+	UnsupportedFeatureWarning: () => require("../UnsupportedFeatureWarning"),
+	"util/LazySet": () => require("../util/LazySet"),
+	UnhandledSchemeError: () => require("../UnhandledSchemeError"),
+	NodeStuffInWebError: () => require("../NodeStuffInWebError"),
+	WebpackError: () => require("../WebpackError"),
+
+	"util/registerExternalSerializer": () => {
+		// already registered
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/makeSerializable.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/makeSerializable.js
new file mode 100644
index 0000000..55593c1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/makeSerializable.js
@@ -0,0 +1,30 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const { register } = require("./serialization");
+
+class ClassSerializer {
+	constructor(Constructor) {
+		this.Constructor = Constructor;
+	}
+
+	serialize(obj, context) {
+		obj.serialize(context);
+	}
+
+	deserialize(context) {
+		if (typeof this.Constructor.deserialize === "function") {
+			return this.Constructor.deserialize(context);
+		}
+		const obj = new this.Constructor();
+		obj.deserialize(context);
+		return obj;
+	}
+}
+
+module.exports = (Constructor, request, name = null) => {
+	register(Constructor, request, name, new ClassSerializer(Constructor));
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/memoize.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/memoize.js
new file mode 100644
index 0000000..981b531
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/memoize.js
@@ -0,0 +1,32 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+/** @template T @typedef {function(): T} FunctionReturning */
+
+/**
+ * @template T
+ * @param {FunctionReturning<T>} fn memorized function
+ * @returns {FunctionReturning<T>} new function
+ */
+const memoize = fn => {
+	let cache = false;
+	/** @type {T} */
+	let result = undefined;
+	return () => {
+		if (cache) {
+			return result;
+		} else {
+			result = fn();
+			cache = true;
+			// Allow to clean up memory for fn
+			// and all dependent resources
+			fn = undefined;
+			return result;
+		}
+	};
+};
+
+module.exports = memoize;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/nonNumericOnlyHash.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/nonNumericOnlyHash.js
new file mode 100644
index 0000000..4f241ca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/nonNumericOnlyHash.js
@@ -0,0 +1,22 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Ivan Kopeykin @vankop
+*/
+
+"use strict";
+
+const A_CODE = "a".charCodeAt(0);
+
+/**
+ * @param {string} hash hash
+ * @param {number} hashLength hash length
+ * @returns {string} returns hash that has at least one non numeric char
+ */
+module.exports = (hash, hashLength) => {
+	if (hashLength < 1) return "";
+	const slice = hash.slice(0, hashLength);
+	if (slice.match(/[^\d]/)) return slice;
+	return `${String.fromCharCode(
+		A_CODE + (parseInt(hash[0], 10) % 6)
+	)}${slice.slice(1)}`;
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/numberHash.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/numberHash.js
new file mode 100644
index 0000000..219d1af
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/numberHash.js
@@ -0,0 +1,45 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const SAFE_LIMIT = 0x80000000;
+const SAFE_PART = SAFE_LIMIT - 1;
+const COUNT = 4;
+const arr = [0, 0, 0, 0, 0];
+const primes = [3, 7, 17, 19];
+
+module.exports = (str, range) => {
+	arr.fill(0);
+	for (let i = 0; i < str.length; i++) {
+		const c = str.charCodeAt(i);
+		for (let j = 0; j < COUNT; j++) {
+			const p = (j + COUNT - 1) % COUNT;
+			arr[j] = (arr[j] + c * primes[j] + arr[p]) & SAFE_PART;
+		}
+		for (let j = 0; j < COUNT; j++) {
+			const q = arr[j] % COUNT;
+			arr[j] = arr[j] ^ (arr[q] >> 1);
+		}
+	}
+	if (range <= SAFE_PART) {
+		let sum = 0;
+		for (let j = 0; j < COUNT; j++) {
+			sum = (sum + arr[j]) % range;
+		}
+		return sum;
+	} else {
+		let sum1 = 0;
+		let sum2 = 0;
+		const rangeExt = Math.floor(range / SAFE_LIMIT);
+		for (let j = 0; j < COUNT; j += 2) {
+			sum1 = (sum1 + arr[j]) & SAFE_PART;
+		}
+		for (let j = 1; j < COUNT; j += 2) {
+			sum2 = (sum2 + arr[j]) % rangeExt;
+		}
+		return (sum2 * SAFE_LIMIT + sum1) % range;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/objectToMap.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/objectToMap.js
new file mode 100644
index 0000000..fbd9808
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/objectToMap.js
@@ -0,0 +1,15 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+/**
+ * Convert an object into an ES6 map
+ *
+ * @param {object} obj any object type that works with Object.entries()
+ * @returns {Map<string, any>} an ES6 Map of KV pairs
+ */
+module.exports = function objectToMap(obj) {
+	return new Map(Object.entries(obj));
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/processAsyncTree.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/processAsyncTree.js
new file mode 100644
index 0000000..f57ac49
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/processAsyncTree.js
@@ -0,0 +1,62 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @template T
+ * @template {Error} E
+ * @param {Iterable<T>} items initial items
+ * @param {number} concurrency number of items running in parallel
+ * @param {function(T, function(T): void, function(E=): void): void} processor worker which pushes more items
+ * @param {function(E=): void} callback all items processed
+ * @returns {void}
+ */
+const processAsyncTree = (items, concurrency, processor, callback) => {
+	const queue = Array.from(items);
+	if (queue.length === 0) return callback();
+	let processing = 0;
+	let finished = false;
+	let processScheduled = true;
+
+	const push = item => {
+		queue.push(item);
+		if (!processScheduled && processing < concurrency) {
+			processScheduled = true;
+			process.nextTick(processQueue);
+		}
+	};
+
+	const processorCallback = err => {
+		processing--;
+		if (err && !finished) {
+			finished = true;
+			callback(err);
+			return;
+		}
+		if (!processScheduled) {
+			processScheduled = true;
+			process.nextTick(processQueue);
+		}
+	};
+
+	const processQueue = () => {
+		if (finished) return;
+		while (processing < concurrency && queue.length > 0) {
+			processing++;
+			const item = queue.pop();
+			processor(item, push, processorCallback);
+		}
+		processScheduled = false;
+		if (queue.length === 0 && processing === 0 && !finished) {
+			finished = true;
+			callback();
+		}
+	};
+
+	processQueue();
+};
+
+module.exports = processAsyncTree;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/propertyAccess.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/propertyAccess.js
new file mode 100644
index 0000000..183b3c5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/propertyAccess.js
@@ -0,0 +1,78 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const SAFE_IDENTIFIER = /^[_a-zA-Z$][_a-zA-Z$0-9]*$/;
+const RESERVED_IDENTIFIER = new Set([
+	"break",
+	"case",
+	"catch",
+	"class",
+	"const",
+	"continue",
+	"debugger",
+	"default",
+	"delete",
+	"do",
+	"else",
+	"export",
+	"extends",
+	"finally",
+	"for",
+	"function",
+	"if",
+	"import",
+	"in",
+	"instanceof",
+	"new",
+	"return",
+	"super",
+	"switch",
+	"this",
+	"throw",
+	"try",
+	"typeof",
+	"var",
+	"void",
+	"while",
+	"with",
+	"enum",
+	// strict mode
+	"implements",
+	"interface",
+	"let",
+	"package",
+	"private",
+	"protected",
+	"public",
+	"static",
+	"yield",
+	"yield",
+	// module code
+	"await",
+	// skip future reserved keywords defined under ES1 till ES3
+	// additional
+	"null",
+	"true",
+	"false"
+]);
+
+const propertyAccess = (properties, start = 0) => {
+	let str = "";
+	for (let i = start; i < properties.length; i++) {
+		const p = properties[i];
+		if (`${+p}` === p) {
+			str += `[${p}]`;
+		} else if (SAFE_IDENTIFIER.test(p) && !RESERVED_IDENTIFIER.has(p)) {
+			str += `.${p}`;
+		} else {
+			str += `[${JSON.stringify(p)}]`;
+		}
+	}
+	return str;
+};
+
+module.exports = propertyAccess;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/registerExternalSerializer.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/registerExternalSerializer.js
new file mode 100644
index 0000000..4b45428
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/registerExternalSerializer.js
@@ -0,0 +1,337 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { register } = require("./serialization");
+
+const Position = /** @type {TODO} */ (require("acorn")).Position;
+const SourceLocation = require("acorn").SourceLocation;
+const ValidationError = require("schema-utils/dist/ValidationError").default;
+const {
+	CachedSource,
+	ConcatSource,
+	OriginalSource,
+	PrefixSource,
+	RawSource,
+	ReplaceSource,
+	SourceMapSource
+} = require("webpack-sources");
+
+/** @typedef {import("acorn").Position} Position */
+/** @typedef {import("../Dependency").RealDependencyLocation} RealDependencyLocation */
+/** @typedef {import("../Dependency").SourcePosition} SourcePosition */
+/** @typedef {import("./serialization").ObjectDeserializerContext} ObjectDeserializerContext */
+/** @typedef {import("./serialization").ObjectSerializerContext} ObjectSerializerContext */
+
+/** @typedef {ObjectSerializerContext & { writeLazy?: (any) => void }} WebpackObjectSerializerContext */
+
+const CURRENT_MODULE = "webpack/lib/util/registerExternalSerializer";
+
+register(
+	CachedSource,
+	CURRENT_MODULE,
+	"webpack-sources/CachedSource",
+	new (class CachedSourceSerializer {
+		/**
+		 * @param {CachedSource} source the cached source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(source, { write, writeLazy }) {
+			if (writeLazy) {
+				writeLazy(source.originalLazy());
+			} else {
+				write(source.original());
+			}
+			write(source.getCachedData());
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {CachedSource} cached source
+		 */
+		deserialize({ read }) {
+			const source = read();
+			const cachedData = read();
+			return new CachedSource(source, cachedData);
+		}
+	})()
+);
+
+register(
+	RawSource,
+	CURRENT_MODULE,
+	"webpack-sources/RawSource",
+	new (class RawSourceSerializer {
+		/**
+		 * @param {RawSource} source the raw source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(source, { write }) {
+			write(source.buffer());
+			write(!source.isBuffer());
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {RawSource} raw source
+		 */
+		deserialize({ read }) {
+			const source = read();
+			const convertToString = read();
+			return new RawSource(source, convertToString);
+		}
+	})()
+);
+
+register(
+	ConcatSource,
+	CURRENT_MODULE,
+	"webpack-sources/ConcatSource",
+	new (class ConcatSourceSerializer {
+		/**
+		 * @param {ConcatSource} source the concat source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(source, { write }) {
+			write(source.getChildren());
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {ConcatSource} concat source
+		 */
+		deserialize({ read }) {
+			const source = new ConcatSource();
+			source.addAllSkipOptimizing(read());
+			return source;
+		}
+	})()
+);
+
+register(
+	PrefixSource,
+	CURRENT_MODULE,
+	"webpack-sources/PrefixSource",
+	new (class PrefixSourceSerializer {
+		/**
+		 * @param {PrefixSource} source the prefix source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(source, { write }) {
+			write(source.getPrefix());
+			write(source.original());
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {PrefixSource} prefix source
+		 */
+		deserialize({ read }) {
+			return new PrefixSource(read(), read());
+		}
+	})()
+);
+
+register(
+	ReplaceSource,
+	CURRENT_MODULE,
+	"webpack-sources/ReplaceSource",
+	new (class ReplaceSourceSerializer {
+		/**
+		 * @param {ReplaceSource} source the replace source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(source, { write }) {
+			write(source.original());
+			write(source.getName());
+			const replacements = source.getReplacements();
+			write(replacements.length);
+			for (const repl of replacements) {
+				write(repl.start);
+				write(repl.end);
+			}
+			for (const repl of replacements) {
+				write(repl.content);
+				write(repl.name);
+			}
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {ReplaceSource} replace source
+		 */
+		deserialize({ read }) {
+			const source = new ReplaceSource(read(), read());
+			const len = read();
+			const startEndBuffer = [];
+			for (let i = 0; i < len; i++) {
+				startEndBuffer.push(read(), read());
+			}
+			let j = 0;
+			for (let i = 0; i < len; i++) {
+				source.replace(
+					startEndBuffer[j++],
+					startEndBuffer[j++],
+					read(),
+					read()
+				);
+			}
+			return source;
+		}
+	})()
+);
+
+register(
+	OriginalSource,
+	CURRENT_MODULE,
+	"webpack-sources/OriginalSource",
+	new (class OriginalSourceSerializer {
+		/**
+		 * @param {OriginalSource} source the original source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(source, { write }) {
+			write(source.buffer());
+			write(source.getName());
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {OriginalSource} original source
+		 */
+		deserialize({ read }) {
+			const buffer = read();
+			const name = read();
+			return new OriginalSource(buffer, name);
+		}
+	})()
+);
+
+register(
+	SourceLocation,
+	CURRENT_MODULE,
+	"acorn/SourceLocation",
+	new (class SourceLocationSerializer {
+		/**
+		 * @param {SourceLocation} loc the location to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(loc, { write }) {
+			write(loc.start.line);
+			write(loc.start.column);
+			write(loc.end.line);
+			write(loc.end.column);
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {RealDependencyLocation} location
+		 */
+		deserialize({ read }) {
+			return {
+				start: {
+					line: read(),
+					column: read()
+				},
+				end: {
+					line: read(),
+					column: read()
+				}
+			};
+		}
+	})()
+);
+
+register(
+	Position,
+	CURRENT_MODULE,
+	"acorn/Position",
+	new (class PositionSerializer {
+		/**
+		 * @param {Position} pos the position to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(pos, { write }) {
+			write(pos.line);
+			write(pos.column);
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {SourcePosition} position
+		 */
+		deserialize({ read }) {
+			return {
+				line: read(),
+				column: read()
+			};
+		}
+	})()
+);
+
+register(
+	SourceMapSource,
+	CURRENT_MODULE,
+	"webpack-sources/SourceMapSource",
+	new (class SourceMapSourceSerializer {
+		/**
+		 * @param {SourceMapSource} source the source map source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(source, { write }) {
+			write(source.getArgsAsBuffers());
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {SourceMapSource} source source map source
+		 */
+		deserialize({ read }) {
+			// @ts-expect-error
+			return new SourceMapSource(...read());
+		}
+	})()
+);
+
+register(
+	ValidationError,
+	CURRENT_MODULE,
+	"schema-utils/ValidationError",
+	new (class ValidationErrorSerializer {
+		// TODO error should be ValidationError, but this fails the type checks
+		/**
+		 * @param {TODO} error the source map source to be serialized
+		 * @param {WebpackObjectSerializerContext} context context
+		 * @returns {void}
+		 */
+		serialize(error, { write }) {
+			write(error.errors);
+			write(error.schema);
+			write({
+				name: error.headerName,
+				baseDataPath: error.baseDataPath,
+				postFormatter: error.postFormatter
+			});
+		}
+
+		/**
+		 * @param {ObjectDeserializerContext} context context
+		 * @returns {TODO} error
+		 */
+		deserialize({ read }) {
+			return new ValidationError(read(), read(), read());
+		}
+	})()
+);
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/runtime.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/runtime.js
new file mode 100644
index 0000000..cdc29c2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/runtime.js
@@ -0,0 +1,623 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const SortableSet = require("./SortableSet");
+
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Entrypoint").EntryOptions} EntryOptions */
+
+/** @typedef {string | SortableSet<string> | undefined} RuntimeSpec */
+/** @typedef {RuntimeSpec | boolean} RuntimeCondition */
+
+/**
+ * @param {Compilation} compilation the compilation
+ * @param {string} name name of the entry
+ * @param {EntryOptions=} options optionally already received entry options
+ * @returns {RuntimeSpec} runtime
+ */
+exports.getEntryRuntime = (compilation, name, options) => {
+	let dependOn;
+	let runtime;
+	if (options) {
+		({ dependOn, runtime } = options);
+	} else {
+		const entry = compilation.entries.get(name);
+		if (!entry) return name;
+		({ dependOn, runtime } = entry.options);
+	}
+	if (dependOn) {
+		/** @type {RuntimeSpec} */
+		let result = undefined;
+		const queue = new Set(dependOn);
+		for (const name of queue) {
+			const dep = compilation.entries.get(name);
+			if (!dep) continue;
+			const { dependOn, runtime } = dep.options;
+			if (dependOn) {
+				for (const name of dependOn) {
+					queue.add(name);
+				}
+			} else {
+				result = mergeRuntimeOwned(result, runtime || name);
+			}
+		}
+		return result || name;
+	} else {
+		return runtime || name;
+	}
+};
+
+/**
+ * @param {RuntimeSpec} runtime runtime
+ * @param {function(string): void} fn functor
+ * @param {boolean} deterministicOrder enforce a deterministic order
+ * @returns {void}
+ */
+exports.forEachRuntime = (runtime, fn, deterministicOrder = false) => {
+	if (runtime === undefined) {
+		fn(undefined);
+	} else if (typeof runtime === "string") {
+		fn(runtime);
+	} else {
+		if (deterministicOrder) runtime.sort();
+		for (const r of runtime) {
+			fn(r);
+		}
+	}
+};
+
+const getRuntimesKey = set => {
+	set.sort();
+	return Array.from(set).join("\n");
+};
+
+/**
+ * @param {RuntimeSpec} runtime runtime(s)
+ * @returns {string} key of runtimes
+ */
+const getRuntimeKey = runtime => {
+	if (runtime === undefined) return "*";
+	if (typeof runtime === "string") return runtime;
+	return runtime.getFromUnorderedCache(getRuntimesKey);
+};
+exports.getRuntimeKey = getRuntimeKey;
+
+/**
+ * @param {string} key key of runtimes
+ * @returns {RuntimeSpec} runtime(s)
+ */
+const keyToRuntime = key => {
+	if (key === "*") return undefined;
+	const items = key.split("\n");
+	if (items.length === 1) return items[0];
+	return new SortableSet(items);
+};
+exports.keyToRuntime = keyToRuntime;
+
+const getRuntimesString = set => {
+	set.sort();
+	return Array.from(set).join("+");
+};
+
+/**
+ * @param {RuntimeSpec} runtime runtime(s)
+ * @returns {string} readable version
+ */
+const runtimeToString = runtime => {
+	if (runtime === undefined) return "*";
+	if (typeof runtime === "string") return runtime;
+	return runtime.getFromUnorderedCache(getRuntimesString);
+};
+exports.runtimeToString = runtimeToString;
+
+/**
+ * @param {RuntimeCondition} runtimeCondition runtime condition
+ * @returns {string} readable version
+ */
+exports.runtimeConditionToString = runtimeCondition => {
+	if (runtimeCondition === true) return "true";
+	if (runtimeCondition === false) return "false";
+	return runtimeToString(runtimeCondition);
+};
+
+/**
+ * @param {RuntimeSpec} a first
+ * @param {RuntimeSpec} b second
+ * @returns {boolean} true, when they are equal
+ */
+const runtimeEqual = (a, b) => {
+	if (a === b) {
+		return true;
+	} else if (
+		a === undefined ||
+		b === undefined ||
+		typeof a === "string" ||
+		typeof b === "string"
+	) {
+		return false;
+	} else if (a.size !== b.size) {
+		return false;
+	} else {
+		a.sort();
+		b.sort();
+		const aIt = a[Symbol.iterator]();
+		const bIt = b[Symbol.iterator]();
+		for (;;) {
+			const aV = aIt.next();
+			if (aV.done) return true;
+			const bV = bIt.next();
+			if (aV.value !== bV.value) return false;
+		}
+	}
+};
+exports.runtimeEqual = runtimeEqual;
+
+/**
+ * @param {RuntimeSpec} a first
+ * @param {RuntimeSpec} b second
+ * @returns {-1|0|1} compare
+ */
+exports.compareRuntime = (a, b) => {
+	if (a === b) {
+		return 0;
+	} else if (a === undefined) {
+		return -1;
+	} else if (b === undefined) {
+		return 1;
+	} else {
+		const aKey = getRuntimeKey(a);
+		const bKey = getRuntimeKey(b);
+		if (aKey < bKey) return -1;
+		if (aKey > bKey) return 1;
+		return 0;
+	}
+};
+
+/**
+ * @param {RuntimeSpec} a first
+ * @param {RuntimeSpec} b second
+ * @returns {RuntimeSpec} merged
+ */
+const mergeRuntime = (a, b) => {
+	if (a === undefined) {
+		return b;
+	} else if (b === undefined) {
+		return a;
+	} else if (a === b) {
+		return a;
+	} else if (typeof a === "string") {
+		if (typeof b === "string") {
+			const set = new SortableSet();
+			set.add(a);
+			set.add(b);
+			return set;
+		} else if (b.has(a)) {
+			return b;
+		} else {
+			const set = new SortableSet(b);
+			set.add(a);
+			return set;
+		}
+	} else {
+		if (typeof b === "string") {
+			if (a.has(b)) return a;
+			const set = new SortableSet(a);
+			set.add(b);
+			return set;
+		} else {
+			const set = new SortableSet(a);
+			for (const item of b) set.add(item);
+			if (set.size === a.size) return a;
+			return set;
+		}
+	}
+};
+exports.mergeRuntime = mergeRuntime;
+
+/**
+ * @param {RuntimeCondition} a first
+ * @param {RuntimeCondition} b second
+ * @param {RuntimeSpec} runtime full runtime
+ * @returns {RuntimeCondition} result
+ */
+exports.mergeRuntimeCondition = (a, b, runtime) => {
+	if (a === false) return b;
+	if (b === false) return a;
+	if (a === true || b === true) return true;
+	const merged = mergeRuntime(a, b);
+	if (merged === undefined) return undefined;
+	if (typeof merged === "string") {
+		if (typeof runtime === "string" && merged === runtime) return true;
+		return merged;
+	}
+	if (typeof runtime === "string" || runtime === undefined) return merged;
+	if (merged.size === runtime.size) return true;
+	return merged;
+};
+
+/**
+ * @param {RuntimeSpec | true} a first
+ * @param {RuntimeSpec | true} b second
+ * @param {RuntimeSpec} runtime full runtime
+ * @returns {RuntimeSpec | true} result
+ */
+exports.mergeRuntimeConditionNonFalse = (a, b, runtime) => {
+	if (a === true || b === true) return true;
+	const merged = mergeRuntime(a, b);
+	if (merged === undefined) return undefined;
+	if (typeof merged === "string") {
+		if (typeof runtime === "string" && merged === runtime) return true;
+		return merged;
+	}
+	if (typeof runtime === "string" || runtime === undefined) return merged;
+	if (merged.size === runtime.size) return true;
+	return merged;
+};
+
+/**
+ * @param {RuntimeSpec} a first (may be modified)
+ * @param {RuntimeSpec} b second
+ * @returns {RuntimeSpec} merged
+ */
+const mergeRuntimeOwned = (a, b) => {
+	if (b === undefined) {
+		return a;
+	} else if (a === b) {
+		return a;
+	} else if (a === undefined) {
+		if (typeof b === "string") {
+			return b;
+		} else {
+			return new SortableSet(b);
+		}
+	} else if (typeof a === "string") {
+		if (typeof b === "string") {
+			const set = new SortableSet();
+			set.add(a);
+			set.add(b);
+			return set;
+		} else {
+			const set = new SortableSet(b);
+			set.add(a);
+			return set;
+		}
+	} else {
+		if (typeof b === "string") {
+			a.add(b);
+			return a;
+		} else {
+			for (const item of b) a.add(item);
+			return a;
+		}
+	}
+};
+exports.mergeRuntimeOwned = mergeRuntimeOwned;
+
+/**
+ * @param {RuntimeSpec} a first
+ * @param {RuntimeSpec} b second
+ * @returns {RuntimeSpec} merged
+ */
+exports.intersectRuntime = (a, b) => {
+	if (a === undefined) {
+		return b;
+	} else if (b === undefined) {
+		return a;
+	} else if (a === b) {
+		return a;
+	} else if (typeof a === "string") {
+		if (typeof b === "string") {
+			return undefined;
+		} else if (b.has(a)) {
+			return a;
+		} else {
+			return undefined;
+		}
+	} else {
+		if (typeof b === "string") {
+			if (a.has(b)) return b;
+			return undefined;
+		} else {
+			const set = new SortableSet();
+			for (const item of b) {
+				if (a.has(item)) set.add(item);
+			}
+			if (set.size === 0) return undefined;
+			if (set.size === 1) for (const item of set) return item;
+			return set;
+		}
+	}
+};
+
+/**
+ * @param {RuntimeSpec} a first
+ * @param {RuntimeSpec} b second
+ * @returns {RuntimeSpec} result
+ */
+const subtractRuntime = (a, b) => {
+	if (a === undefined) {
+		return undefined;
+	} else if (b === undefined) {
+		return a;
+	} else if (a === b) {
+		return undefined;
+	} else if (typeof a === "string") {
+		if (typeof b === "string") {
+			return a;
+		} else if (b.has(a)) {
+			return undefined;
+		} else {
+			return a;
+		}
+	} else {
+		if (typeof b === "string") {
+			if (!a.has(b)) return a;
+			if (a.size === 2) {
+				for (const item of a) {
+					if (item !== b) return item;
+				}
+			}
+			const set = new SortableSet(a);
+			set.delete(b);
+		} else {
+			const set = new SortableSet();
+			for (const item of a) {
+				if (!b.has(item)) set.add(item);
+			}
+			if (set.size === 0) return undefined;
+			if (set.size === 1) for (const item of set) return item;
+			return set;
+		}
+	}
+};
+exports.subtractRuntime = subtractRuntime;
+
+/**
+ * @param {RuntimeCondition} a first
+ * @param {RuntimeCondition} b second
+ * @param {RuntimeSpec} runtime runtime
+ * @returns {RuntimeCondition} result
+ */
+exports.subtractRuntimeCondition = (a, b, runtime) => {
+	if (b === true) return false;
+	if (b === false) return a;
+	if (a === false) return false;
+	const result = subtractRuntime(a === true ? runtime : a, b);
+	return result === undefined ? false : result;
+};
+
+/**
+ * @param {RuntimeSpec} runtime runtime
+ * @param {function(RuntimeSpec): boolean} filter filter function
+ * @returns {boolean | RuntimeSpec} true/false if filter is constant for all runtimes, otherwise runtimes that are active
+ */
+exports.filterRuntime = (runtime, filter) => {
+	if (runtime === undefined) return filter(undefined);
+	if (typeof runtime === "string") return filter(runtime);
+	let some = false;
+	let every = true;
+	let result = undefined;
+	for (const r of runtime) {
+		const v = filter(r);
+		if (v) {
+			some = true;
+			result = mergeRuntimeOwned(result, r);
+		} else {
+			every = false;
+		}
+	}
+	if (!some) return false;
+	if (every) return true;
+	return result;
+};
+
+/**
+ * @template T
+ */
+class RuntimeSpecMap {
+	/**
+	 * @param {RuntimeSpecMap<T>=} clone copy form this
+	 */
+	constructor(clone) {
+		this._mode = clone ? clone._mode : 0; // 0 = empty, 1 = single entry, 2 = map
+		/** @type {RuntimeSpec} */
+		this._singleRuntime = clone ? clone._singleRuntime : undefined;
+		/** @type {T} */
+		this._singleValue = clone ? clone._singleValue : undefined;
+		/** @type {Map<string, T> | undefined} */
+		this._map = clone && clone._map ? new Map(clone._map) : undefined;
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtimes
+	 * @returns {T} value
+	 */
+	get(runtime) {
+		switch (this._mode) {
+			case 0:
+				return undefined;
+			case 1:
+				return runtimeEqual(this._singleRuntime, runtime)
+					? this._singleValue
+					: undefined;
+			default:
+				return this._map.get(getRuntimeKey(runtime));
+		}
+	}
+
+	/**
+	 * @param {RuntimeSpec} runtime the runtimes
+	 * @returns {boolean} true, when the runtime is stored
+	 */
+	has(runtime) {
+		switch (this._mode) {
+			case 0:
+				return false;
+			case 1:
+				return runtimeEqual(this._singleRuntime, runtime);
+			default:
+				return this._map.has(getRuntimeKey(runtime));
+		}
+	}
+
+	set(runtime, value) {
+		switch (this._mode) {
+			case 0:
+				this._mode = 1;
+				this._singleRuntime = runtime;
+				this._singleValue = value;
+				break;
+			case 1:
+				if (runtimeEqual(this._singleRuntime, runtime)) {
+					this._singleValue = value;
+					break;
+				}
+				this._mode = 2;
+				this._map = new Map();
+				this._map.set(getRuntimeKey(this._singleRuntime), this._singleValue);
+				this._singleRuntime = undefined;
+				this._singleValue = undefined;
+			/* falls through */
+			default:
+				this._map.set(getRuntimeKey(runtime), value);
+		}
+	}
+
+	provide(runtime, computer) {
+		switch (this._mode) {
+			case 0:
+				this._mode = 1;
+				this._singleRuntime = runtime;
+				return (this._singleValue = computer());
+			case 1: {
+				if (runtimeEqual(this._singleRuntime, runtime)) {
+					return this._singleValue;
+				}
+				this._mode = 2;
+				this._map = new Map();
+				this._map.set(getRuntimeKey(this._singleRuntime), this._singleValue);
+				this._singleRuntime = undefined;
+				this._singleValue = undefined;
+				const newValue = computer();
+				this._map.set(getRuntimeKey(runtime), newValue);
+				return newValue;
+			}
+			default: {
+				const key = getRuntimeKey(runtime);
+				const value = this._map.get(key);
+				if (value !== undefined) return value;
+				const newValue = computer();
+				this._map.set(key, newValue);
+				return newValue;
+			}
+		}
+	}
+
+	delete(runtime) {
+		switch (this._mode) {
+			case 0:
+				return;
+			case 1:
+				if (runtimeEqual(this._singleRuntime, runtime)) {
+					this._mode = 0;
+					this._singleRuntime = undefined;
+					this._singleValue = undefined;
+				}
+				return;
+			default:
+				this._map.delete(getRuntimeKey(runtime));
+		}
+	}
+
+	update(runtime, fn) {
+		switch (this._mode) {
+			case 0:
+				throw new Error("runtime passed to update must exist");
+			case 1: {
+				if (runtimeEqual(this._singleRuntime, runtime)) {
+					this._singleValue = fn(this._singleValue);
+					break;
+				}
+				const newValue = fn(undefined);
+				if (newValue !== undefined) {
+					this._mode = 2;
+					this._map = new Map();
+					this._map.set(getRuntimeKey(this._singleRuntime), this._singleValue);
+					this._singleRuntime = undefined;
+					this._singleValue = undefined;
+					this._map.set(getRuntimeKey(runtime), newValue);
+				}
+				break;
+			}
+			default: {
+				const key = getRuntimeKey(runtime);
+				const oldValue = this._map.get(key);
+				const newValue = fn(oldValue);
+				if (newValue !== oldValue) this._map.set(key, newValue);
+			}
+		}
+	}
+
+	keys() {
+		switch (this._mode) {
+			case 0:
+				return [];
+			case 1:
+				return [this._singleRuntime];
+			default:
+				return Array.from(this._map.keys(), keyToRuntime);
+		}
+	}
+
+	values() {
+		switch (this._mode) {
+			case 0:
+				return [][Symbol.iterator]();
+			case 1:
+				return [this._singleValue][Symbol.iterator]();
+			default:
+				return this._map.values();
+		}
+	}
+
+	get size() {
+		if (this._mode <= 1) return this._mode;
+		return this._map.size;
+	}
+}
+
+exports.RuntimeSpecMap = RuntimeSpecMap;
+
+class RuntimeSpecSet {
+	constructor(iterable) {
+		/** @type {Map<string, RuntimeSpec>} */
+		this._map = new Map();
+		if (iterable) {
+			for (const item of iterable) {
+				this.add(item);
+			}
+		}
+	}
+
+	add(runtime) {
+		this._map.set(getRuntimeKey(runtime), runtime);
+	}
+
+	has(runtime) {
+		return this._map.has(getRuntimeKey(runtime));
+	}
+
+	[Symbol.iterator]() {
+		return this._map.values();
+	}
+
+	get size() {
+		return this._map.size;
+	}
+}
+
+exports.RuntimeSpecSet = RuntimeSpecSet;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/semver.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/semver.js
new file mode 100644
index 0000000..1ffb923
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/semver.js
@@ -0,0 +1,484 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {(string|number|undefined|[])[]} SemVerRange */
+
+/**
+ * @param {string} str version string
+ * @returns {(string|number|undefined|[])[]} parsed version
+ */
+const parseVersion = str => {
+	var splitAndConvert = function (str) {
+		return str.split(".").map(function (item) {
+			// eslint-disable-next-line eqeqeq
+			return +item == item ? +item : item;
+		});
+	};
+	var match = /^([^-+]+)?(?:-([^+]+))?(?:\+(.+))?$/.exec(str);
+	/** @type {(string|number|undefined|[])[]} */
+	var ver = match[1] ? splitAndConvert(match[1]) : [];
+	if (match[2]) {
+		ver.length++;
+		ver.push.apply(ver, splitAndConvert(match[2]));
+	}
+	if (match[3]) {
+		ver.push([]);
+		ver.push.apply(ver, splitAndConvert(match[3]));
+	}
+	return ver;
+};
+exports.parseVersion = parseVersion;
+
+/* eslint-disable eqeqeq */
+/**
+ * @param {string} a version
+ * @param {string} b version
+ * @returns {boolean} true, iff a < b
+ */
+const versionLt = (a, b) => {
+	// @ts-expect-error
+	a = parseVersion(a);
+	// @ts-expect-error
+	b = parseVersion(b);
+	var i = 0;
+	for (;;) {
+		// a       b  EOA     object  undefined  number  string
+		// EOA        a == b  a < b   b < a      a < b   a < b
+		// object     b < a   (0)     b < a      a < b   a < b
+		// undefined  a < b   a < b   (0)        a < b   a < b
+		// number     b < a   b < a   b < a      (1)     a < b
+		// string     b < a   b < a   b < a      b < a   (1)
+		// EOA end of array
+		// (0) continue on
+		// (1) compare them via "<"
+
+		// Handles first row in table
+		if (i >= a.length) return i < b.length && (typeof b[i])[0] != "u";
+
+		var aValue = a[i];
+		var aType = (typeof aValue)[0];
+
+		// Handles first column in table
+		if (i >= b.length) return aType == "u";
+
+		var bValue = b[i];
+		var bType = (typeof bValue)[0];
+
+		if (aType == bType) {
+			if (aType != "o" && aType != "u" && aValue != bValue) {
+				return aValue < bValue;
+			}
+			i++;
+		} else {
+			// Handles remaining cases
+			if (aType == "o" && bType == "n") return true;
+			return bType == "s" || aType == "u";
+		}
+	}
+};
+/* eslint-enable eqeqeq */
+exports.versionLt = versionLt;
+
+/**
+ * @param {string} str range string
+ * @returns {SemVerRange} parsed range
+ */
+exports.parseRange = str => {
+	const splitAndConvert = str => {
+		return str
+			.split(".")
+			.map(item => (item !== "NaN" && `${+item}` === item ? +item : item));
+	};
+	// see https://docs.npmjs.com/misc/semver#range-grammar for grammar
+	const parsePartial = str => {
+		const match = /^([^-+]+)?(?:-([^+]+))?(?:\+(.+))?$/.exec(str);
+		/** @type {(string|number|undefined|[])[]} */
+		const ver = match[1] ? [0, ...splitAndConvert(match[1])] : [0];
+		if (match[2]) {
+			ver.length++;
+			ver.push.apply(ver, splitAndConvert(match[2]));
+		}
+
+		// remove trailing any matchers
+		let last = ver[ver.length - 1];
+		while (
+			ver.length &&
+			(last === undefined || /^[*xX]$/.test(/** @type {string} */ (last)))
+		) {
+			ver.pop();
+			last = ver[ver.length - 1];
+		}
+
+		return ver;
+	};
+	const toFixed = range => {
+		if (range.length === 1) {
+			// Special case for "*" is "x.x.x" instead of "="
+			return [0];
+		} else if (range.length === 2) {
+			// Special case for "1" is "1.x.x" instead of "=1"
+			return [1, ...range.slice(1)];
+		} else if (range.length === 3) {
+			// Special case for "1.2" is "1.2.x" instead of "=1.2"
+			return [2, ...range.slice(1)];
+		} else {
+			return [range.length, ...range.slice(1)];
+		}
+	};
+	const negate = range => {
+		return [-range[0] - 1, ...range.slice(1)];
+	};
+	const parseSimple = str => {
+		// simple       ::= primitive | partial | tilde | caret
+		// primitive    ::= ( '<' | '>' | '>=' | '<=' | '=' | '!' ) ( ' ' ) * partial
+		// tilde        ::= '~' ( ' ' ) * partial
+		// caret        ::= '^' ( ' ' ) * partial
+		const match = /^(\^|~|<=|<|>=|>|=|v|!)/.exec(str);
+		const start = match ? match[0] : "";
+		const remainder = parsePartial(
+			start.length ? str.slice(start.length).trim() : str.trim()
+		);
+		switch (start) {
+			case "^":
+				if (remainder.length > 1 && remainder[1] === 0) {
+					if (remainder.length > 2 && remainder[2] === 0) {
+						return [3, ...remainder.slice(1)];
+					}
+					return [2, ...remainder.slice(1)];
+				}
+				return [1, ...remainder.slice(1)];
+			case "~":
+				return [2, ...remainder.slice(1)];
+			case ">=":
+				return remainder;
+			case "=":
+			case "v":
+			case "":
+				return toFixed(remainder);
+			case "<":
+				return negate(remainder);
+			case ">": {
+				// and( >=, not( = ) ) => >=, =, not, and
+				const fixed = toFixed(remainder);
+				// eslint-disable-next-line no-sparse-arrays
+				return [, fixed, 0, remainder, 2];
+			}
+			case "<=":
+				// or( <, = ) => <, =, or
+				// eslint-disable-next-line no-sparse-arrays
+				return [, toFixed(remainder), negate(remainder), 1];
+			case "!": {
+				// not =
+				const fixed = toFixed(remainder);
+				// eslint-disable-next-line no-sparse-arrays
+				return [, fixed, 0];
+			}
+			default:
+				throw new Error("Unexpected start value");
+		}
+	};
+	const combine = (items, fn) => {
+		if (items.length === 1) return items[0];
+		const arr = [];
+		for (const item of items.slice().reverse()) {
+			if (0 in item) {
+				arr.push(item);
+			} else {
+				arr.push(...item.slice(1));
+			}
+		}
+		// eslint-disable-next-line no-sparse-arrays
+		return [, ...arr, ...items.slice(1).map(() => fn)];
+	};
+	const parseRange = str => {
+		// range      ::= hyphen | simple ( ' ' ( ' ' ) * simple ) * | ''
+		// hyphen     ::= partial ( ' ' ) * ' - ' ( ' ' ) * partial
+		const items = str.split(/\s+-\s+/);
+		if (items.length === 1) {
+			const items = str
+				.trim()
+				.split(/(?<=[-0-9A-Za-z])\s+/g)
+				.map(parseSimple);
+			return combine(items, 2);
+		}
+		const a = parsePartial(items[0]);
+		const b = parsePartial(items[1]);
+		// >=a <=b => and( >=a, or( <b, =b ) ) => >=a, <b, =b, or, and
+		// eslint-disable-next-line no-sparse-arrays
+		return [, toFixed(b), negate(b), 1, a, 2];
+	};
+	const parseLogicalOr = str => {
+		// range-set  ::= range ( logical-or range ) *
+		// logical-or ::= ( ' ' ) * '||' ( ' ' ) *
+		const items = str.split(/\s*\|\|\s*/).map(parseRange);
+		return combine(items, 1);
+	};
+	return parseLogicalOr(str);
+};
+
+/* eslint-disable eqeqeq */
+const rangeToString = range => {
+	var fixCount = range[0];
+	var str = "";
+	if (range.length === 1) {
+		return "*";
+	} else if (fixCount + 0.5) {
+		str +=
+			fixCount == 0
+				? ">="
+				: fixCount == -1
+				? "<"
+				: fixCount == 1
+				? "^"
+				: fixCount == 2
+				? "~"
+				: fixCount > 0
+				? "="
+				: "!=";
+		var needDot = 1;
+		// eslint-disable-next-line no-redeclare
+		for (var i = 1; i < range.length; i++) {
+			var item = range[i];
+			var t = (typeof item)[0];
+			needDot--;
+			str +=
+				t == "u"
+					? // undefined: prerelease marker, add an "-"
+					  "-"
+					: // number or string: add the item, set flag to add an "." between two of them
+					  (needDot > 0 ? "." : "") + ((needDot = 2), item);
+		}
+		return str;
+	} else {
+		var stack = [];
+		// eslint-disable-next-line no-redeclare
+		for (var i = 1; i < range.length; i++) {
+			// eslint-disable-next-line no-redeclare
+			var item = range[i];
+			stack.push(
+				item === 0
+					? "not(" + pop() + ")"
+					: item === 1
+					? "(" + pop() + " || " + pop() + ")"
+					: item === 2
+					? stack.pop() + " " + stack.pop()
+					: rangeToString(item)
+			);
+		}
+		return pop();
+	}
+	function pop() {
+		return stack.pop().replace(/^\((.+)\)$/, "$1");
+	}
+};
+/* eslint-enable eqeqeq */
+exports.rangeToString = rangeToString;
+
+/* eslint-disable eqeqeq */
+/**
+ * @param {SemVerRange} range version range
+ * @param {string} version the version
+ * @returns {boolean} if version satisfy the range
+ */
+const satisfy = (range, version) => {
+	if (0 in range) {
+		// @ts-expect-error
+		version = parseVersion(version);
+		var fixCount = range[0];
+		// when negated is set it swill set for < instead of >=
+		var negated = fixCount < 0;
+		if (negated) fixCount = -fixCount - 1;
+		for (var i = 0, j = 1, isEqual = true; ; j++, i++) {
+			// cspell:word nequal nequ
+
+			// when isEqual = true:
+			// range         version: EOA/object  undefined  number    string
+			// EOA                    equal       block      big-ver   big-ver
+			// undefined              bigger      next       big-ver   big-ver
+			// number                 smaller     block      cmp       big-cmp
+			// fixed number           smaller     block      cmp-fix   differ
+			// string                 smaller     block      differ    cmp
+			// fixed string           smaller     block      small-cmp cmp-fix
+
+			// when isEqual = false:
+			// range         version: EOA/object  undefined  number    string
+			// EOA                    nequal      block      next-ver  next-ver
+			// undefined              nequal      block      next-ver  next-ver
+			// number                 nequal      block      next      next
+			// fixed number           nequal      block      next      next   (this never happens)
+			// string                 nequal      block      next      next
+			// fixed string           nequal      block      next      next   (this never happens)
+
+			// EOA end of array
+			// equal (version is equal range):
+			//   when !negated: return true,
+			//   when negated: return false
+			// bigger (version is bigger as range):
+			//   when fixed: return false,
+			//   when !negated: return true,
+			//   when negated: return false,
+			// smaller (version is smaller as range):
+			//   when !negated: return false,
+			//   when negated: return true
+			// nequal (version is not equal range (> resp <)): return true
+			// block (version is in different prerelease area): return false
+			// differ (version is different from fixed range (string vs. number)): return false
+			// next: continues to the next items
+			// next-ver: when fixed: return false, continues to the next item only for the version, sets isEqual=false
+			// big-ver: when fixed || negated: return false, continues to the next item only for the version, sets isEqual=false
+			// next-nequ: continues to the next items, sets isEqual=false
+			// cmp (negated === false): version < range => return false, version > range => next-nequ, else => next
+			// cmp (negated === true): version > range => return false, version < range => next-nequ, else => next
+			// cmp-fix: version == range => next, else => return false
+			// big-cmp: when negated => return false, else => next-nequ
+			// small-cmp: when negated => next-nequ, else => return false
+
+			var rangeType = j < range.length ? (typeof range[j])[0] : "";
+
+			var versionValue;
+			var versionType;
+
+			// Handles first column in both tables (end of version or object)
+			if (
+				i >= version.length ||
+				((versionValue = version[i]),
+				(versionType = (typeof versionValue)[0]) == "o")
+			) {
+				// Handles nequal
+				if (!isEqual) return true;
+				// Handles bigger
+				if (rangeType == "u") return j > fixCount && !negated;
+				// Handles equal and smaller: (range === EOA) XOR negated
+				return (rangeType == "") != negated; // equal + smaller
+			}
+
+			// Handles second column in both tables (version = undefined)
+			if (versionType == "u") {
+				if (!isEqual || rangeType != "u") {
+					return false;
+				}
+			}
+
+			// switch between first and second table
+			else if (isEqual) {
+				// Handle diagonal
+				if (rangeType == versionType) {
+					if (j <= fixCount) {
+						// Handles "cmp-fix" cases
+						if (versionValue != range[j]) {
+							return false;
+						}
+					} else {
+						// Handles "cmp" cases
+						if (negated ? versionValue > range[j] : versionValue < range[j]) {
+							return false;
+						}
+						if (versionValue != range[j]) isEqual = false;
+					}
+				}
+
+				// Handle big-ver
+				else if (rangeType != "s" && rangeType != "n") {
+					if (negated || j <= fixCount) return false;
+					isEqual = false;
+					j--;
+				}
+
+				// Handle differ, big-cmp and small-cmp
+				else if (j <= fixCount || versionType < rangeType != negated) {
+					return false;
+				} else {
+					isEqual = false;
+				}
+			} else {
+				// Handles all "next-ver" cases in the second table
+				if (rangeType != "s" && rangeType != "n") {
+					isEqual = false;
+					j--;
+				}
+
+				// next is applied by default
+			}
+		}
+	}
+	/** @type {(boolean | number)[]} */
+	var stack = [];
+	var p = stack.pop.bind(stack);
+	// eslint-disable-next-line no-redeclare
+	for (var i = 1; i < range.length; i++) {
+		var item = /** @type {SemVerRange | 0 | 1 | 2} */ (range[i]);
+		stack.push(
+			item == 1
+				? p() | p()
+				: item == 2
+				? p() & p()
+				: item
+				? satisfy(item, version)
+				: !p()
+		);
+	}
+	return !!p();
+};
+/* eslint-enable eqeqeq */
+exports.satisfy = satisfy;
+
+exports.stringifyHoley = json => {
+	switch (typeof json) {
+		case "undefined":
+			return "";
+		case "object":
+			if (Array.isArray(json)) {
+				let str = "[";
+				for (let i = 0; i < json.length; i++) {
+					if (i !== 0) str += ",";
+					str += this.stringifyHoley(json[i]);
+				}
+				str += "]";
+				return str;
+			} else {
+				return JSON.stringify(json);
+			}
+		default:
+			return JSON.stringify(json);
+	}
+};
+
+//#region runtime code: parseVersion
+exports.parseVersionRuntimeCode = runtimeTemplate =>
+	`var parseVersion = ${runtimeTemplate.basicFunction("str", [
+		"// see webpack/lib/util/semver.js for original code",
+		`var p=${
+			runtimeTemplate.supportsArrowFunction() ? "p=>" : "function(p)"
+		}{return p.split(".").map((${
+			runtimeTemplate.supportsArrowFunction() ? "p=>" : "function(p)"
+		}{return+p==p?+p:p}))},n=/^([^-+]+)?(?:-([^+]+))?(?:\\+(.+))?$/.exec(str),r=n[1]?p(n[1]):[];return n[2]&&(r.length++,r.push.apply(r,p(n[2]))),n[3]&&(r.push([]),r.push.apply(r,p(n[3]))),r;`
+	])}`;
+//#endregion
+
+//#region runtime code: versionLt
+exports.versionLtRuntimeCode = runtimeTemplate =>
+	`var versionLt = ${runtimeTemplate.basicFunction("a, b", [
+		"// see webpack/lib/util/semver.js for original code",
+		'a=parseVersion(a),b=parseVersion(b);for(var r=0;;){if(r>=a.length)return r<b.length&&"u"!=(typeof b[r])[0];var e=a[r],n=(typeof e)[0];if(r>=b.length)return"u"==n;var t=b[r],f=(typeof t)[0];if(n!=f)return"o"==n&&"n"==f||("s"==f||"u"==n);if("o"!=n&&"u"!=n&&e!=t)return e<t;r++}'
+	])}`;
+//#endregion
+
+//#region runtime code: rangeToString
+exports.rangeToStringRuntimeCode = runtimeTemplate =>
+	`var rangeToString = ${runtimeTemplate.basicFunction("range", [
+		"// see webpack/lib/util/semver.js for original code",
+		'var r=range[0],n="";if(1===range.length)return"*";if(r+.5){n+=0==r?">=":-1==r?"<":1==r?"^":2==r?"~":r>0?"=":"!=";for(var e=1,a=1;a<range.length;a++){e--,n+="u"==(typeof(t=range[a]))[0]?"-":(e>0?".":"")+(e=2,t)}return n}var g=[];for(a=1;a<range.length;a++){var t=range[a];g.push(0===t?"not("+o()+")":1===t?"("+o()+" || "+o()+")":2===t?g.pop()+" "+g.pop():rangeToString(t))}return o();function o(){return g.pop().replace(/^\\((.+)\\)$/,"$1")}'
+	])}`;
+//#endregion
+
+//#region runtime code: satisfy
+exports.satisfyRuntimeCode = runtimeTemplate =>
+	`var satisfy = ${runtimeTemplate.basicFunction("range, version", [
+		"// see webpack/lib/util/semver.js for original code",
+		'if(0 in range){version=parseVersion(version);var e=range[0],r=e<0;r&&(e=-e-1);for(var n=0,i=1,a=!0;;i++,n++){var f,s,g=i<range.length?(typeof range[i])[0]:"";if(n>=version.length||"o"==(s=(typeof(f=version[n]))[0]))return!a||("u"==g?i>e&&!r:""==g!=r);if("u"==s){if(!a||"u"!=g)return!1}else if(a)if(g==s)if(i<=e){if(f!=range[i])return!1}else{if(r?f>range[i]:f<range[i])return!1;f!=range[i]&&(a=!1)}else if("s"!=g&&"n"!=g){if(r||i<=e)return!1;a=!1,i--}else{if(i<=e||s<g!=r)return!1;a=!1}else"s"!=g&&"n"!=g&&(a=!1,i--)}}var t=[],o=t.pop.bind(t);for(n=1;n<range.length;n++){var u=range[n];t.push(1==u?o()|o():2==u?o()&o():u?satisfy(u,version):!o())}return!!o();'
+	])}`;
+//#endregion
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/serialization.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/serialization.js
new file mode 100644
index 0000000..6d4eb95
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/serialization.js
@@ -0,0 +1,128 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const memoize = require("./memoize");
+
+/** @typedef {import("../serialization/BinaryMiddleware").MEASURE_END_OPERATION_TYPE} MEASURE_END_OPERATION */
+/** @typedef {import("../serialization/BinaryMiddleware").MEASURE_START_OPERATION_TYPE} MEASURE_START_OPERATION */
+/** @typedef {import("../serialization/ObjectMiddleware").ObjectDeserializerContext} ObjectDeserializerContext */
+/** @typedef {import("../serialization/ObjectMiddleware").ObjectSerializerContext} ObjectSerializerContext */
+/** @typedef {import("../serialization/Serializer")} Serializer */
+
+const getBinaryMiddleware = memoize(() =>
+	require("../serialization/BinaryMiddleware")
+);
+const getObjectMiddleware = memoize(() =>
+	require("../serialization/ObjectMiddleware")
+);
+const getSingleItemMiddleware = memoize(() =>
+	require("../serialization/SingleItemMiddleware")
+);
+const getSerializer = memoize(() => require("../serialization/Serializer"));
+const getSerializerMiddleware = memoize(() =>
+	require("../serialization/SerializerMiddleware")
+);
+
+const getBinaryMiddlewareInstance = memoize(
+	() => new (getBinaryMiddleware())()
+);
+
+const registerSerializers = memoize(() => {
+	require("./registerExternalSerializer");
+
+	// Load internal paths with a relative require
+	// This allows bundling all internal serializers
+	const internalSerializables = require("./internalSerializables");
+	getObjectMiddleware().registerLoader(/^webpack\/lib\//, req => {
+		const loader = internalSerializables[req.slice("webpack/lib/".length)];
+		if (loader) {
+			loader();
+		} else {
+			console.warn(`${req} not found in internalSerializables`);
+		}
+		return true;
+	});
+});
+
+/** @type {Serializer} */
+let buffersSerializer;
+
+// Expose serialization API
+module.exports = {
+	get register() {
+		return getObjectMiddleware().register;
+	},
+	get registerLoader() {
+		return getObjectMiddleware().registerLoader;
+	},
+	get registerNotSerializable() {
+		return getObjectMiddleware().registerNotSerializable;
+	},
+	get NOT_SERIALIZABLE() {
+		return getObjectMiddleware().NOT_SERIALIZABLE;
+	},
+	/** @type {MEASURE_START_OPERATION} */
+	get MEASURE_START_OPERATION() {
+		return getBinaryMiddleware().MEASURE_START_OPERATION;
+	},
+	/** @type {MEASURE_END_OPERATION} */
+	get MEASURE_END_OPERATION() {
+		return getBinaryMiddleware().MEASURE_END_OPERATION;
+	},
+	get buffersSerializer() {
+		if (buffersSerializer !== undefined) return buffersSerializer;
+		registerSerializers();
+		const Serializer = getSerializer();
+		const binaryMiddleware = getBinaryMiddlewareInstance();
+		const SerializerMiddleware = getSerializerMiddleware();
+		const SingleItemMiddleware = getSingleItemMiddleware();
+		return (buffersSerializer = new Serializer([
+			new SingleItemMiddleware(),
+			new (getObjectMiddleware())(context => {
+				if (context.write) {
+					context.writeLazy = value => {
+						context.write(
+							SerializerMiddleware.createLazy(value, binaryMiddleware)
+						);
+					};
+				}
+			}, "md4"),
+			binaryMiddleware
+		]));
+	},
+	createFileSerializer: (fs, hashFunction) => {
+		registerSerializers();
+		const Serializer = getSerializer();
+		const FileMiddleware = require("../serialization/FileMiddleware");
+		const fileMiddleware = new FileMiddleware(fs, hashFunction);
+		const binaryMiddleware = getBinaryMiddlewareInstance();
+		const SerializerMiddleware = getSerializerMiddleware();
+		const SingleItemMiddleware = getSingleItemMiddleware();
+		return new Serializer([
+			new SingleItemMiddleware(),
+			new (getObjectMiddleware())(context => {
+				if (context.write) {
+					context.writeLazy = value => {
+						context.write(
+							SerializerMiddleware.createLazy(value, binaryMiddleware)
+						);
+					};
+					context.writeSeparate = (value, options) => {
+						const lazy = SerializerMiddleware.createLazy(
+							value,
+							fileMiddleware,
+							options
+						);
+						context.write(lazy);
+						return lazy;
+					};
+				}
+			}, hashFunction),
+			binaryMiddleware,
+			fileMiddleware
+		]);
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/smartGrouping.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/smartGrouping.js
new file mode 100644
index 0000000..ec348ad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/smartGrouping.js
@@ -0,0 +1,206 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/**
+ * @typedef {Object} GroupOptions
+ * @property {boolean=} groupChildren
+ * @property {boolean=} force
+ * @property {number=} targetGroupCount
+ */
+
+/**
+ * @template T
+ * @template R
+ * @typedef {Object} GroupConfig
+ * @property {function(T): string[]} getKeys
+ * @property {function(string, (R | T)[], T[]): R} createGroup
+ * @property {function(string, T[]): GroupOptions=} getOptions
+ */
+
+/**
+ * @template T
+ * @template R
+ * @typedef {Object} ItemWithGroups
+ * @property {T} item
+ * @property {Set<Group<T, R>>} groups
+ */
+
+/**
+ * @template T
+ * @template R
+ * @typedef {{ config: GroupConfig<T, R>, name: string, alreadyGrouped: boolean, items: Set<ItemWithGroups<T, R>> | undefined }} Group
+ */
+
+/**
+ * @template T
+ * @template R
+ * @param {T[]} items the list of items
+ * @param {GroupConfig<T, R>[]} groupConfigs configuration
+ * @returns {(R | T)[]} grouped items
+ */
+const smartGrouping = (items, groupConfigs) => {
+	/** @type {Set<ItemWithGroups<T, R>>} */
+	const itemsWithGroups = new Set();
+	/** @type {Map<string, Group<T, R>>} */
+	const allGroups = new Map();
+	for (const item of items) {
+		/** @type {Set<Group<T, R>>} */
+		const groups = new Set();
+		for (let i = 0; i < groupConfigs.length; i++) {
+			const groupConfig = groupConfigs[i];
+			const keys = groupConfig.getKeys(item);
+			if (keys) {
+				for (const name of keys) {
+					const key = `${i}:${name}`;
+					let group = allGroups.get(key);
+					if (group === undefined) {
+						allGroups.set(
+							key,
+							(group = {
+								config: groupConfig,
+								name,
+								alreadyGrouped: false,
+								items: undefined
+							})
+						);
+					}
+					groups.add(group);
+				}
+			}
+		}
+		itemsWithGroups.add({
+			item,
+			groups
+		});
+	}
+	/**
+	 * @param {Set<ItemWithGroups<T, R>>} itemsWithGroups input items with groups
+	 * @returns {(T | R)[]} groups items
+	 */
+	const runGrouping = itemsWithGroups => {
+		const totalSize = itemsWithGroups.size;
+		for (const entry of itemsWithGroups) {
+			for (const group of entry.groups) {
+				if (group.alreadyGrouped) continue;
+				const items = group.items;
+				if (items === undefined) {
+					group.items = new Set([entry]);
+				} else {
+					items.add(entry);
+				}
+			}
+		}
+		/** @type {Map<Group<T, R>, { items: Set<ItemWithGroups<T, R>>, options: GroupOptions | false | undefined, used: boolean }>} */
+		const groupMap = new Map();
+		for (const group of allGroups.values()) {
+			if (group.items) {
+				const items = group.items;
+				group.items = undefined;
+				groupMap.set(group, {
+					items,
+					options: undefined,
+					used: false
+				});
+			}
+		}
+		/** @type {(T | R)[]} */
+		const results = [];
+		for (;;) {
+			/** @type {Group<T, R>} */
+			let bestGroup = undefined;
+			let bestGroupSize = -1;
+			let bestGroupItems = undefined;
+			let bestGroupOptions = undefined;
+			for (const [group, state] of groupMap) {
+				const { items, used } = state;
+				let options = state.options;
+				if (options === undefined) {
+					const groupConfig = group.config;
+					state.options = options =
+						(groupConfig.getOptions &&
+							groupConfig.getOptions(
+								group.name,
+								Array.from(items, ({ item }) => item)
+							)) ||
+						false;
+				}
+
+				const force = options && options.force;
+				if (!force) {
+					if (bestGroupOptions && bestGroupOptions.force) continue;
+					if (used) continue;
+					if (items.size <= 1 || totalSize - items.size <= 1) {
+						continue;
+					}
+				}
+				const targetGroupCount = (options && options.targetGroupCount) || 4;
+				let sizeValue = force
+					? items.size
+					: Math.min(
+							items.size,
+							(totalSize * 2) / targetGroupCount +
+								itemsWithGroups.size -
+								items.size
+					  );
+				if (
+					sizeValue > bestGroupSize ||
+					(force && (!bestGroupOptions || !bestGroupOptions.force))
+				) {
+					bestGroup = group;
+					bestGroupSize = sizeValue;
+					bestGroupItems = items;
+					bestGroupOptions = options;
+				}
+			}
+			if (bestGroup === undefined) {
+				break;
+			}
+			const items = new Set(bestGroupItems);
+			const options = bestGroupOptions;
+
+			const groupChildren = !options || options.groupChildren !== false;
+
+			for (const item of items) {
+				itemsWithGroups.delete(item);
+				// Remove all groups that items have from the map to not select them again
+				for (const group of item.groups) {
+					const state = groupMap.get(group);
+					if (state !== undefined) {
+						state.items.delete(item);
+						if (state.items.size === 0) {
+							groupMap.delete(group);
+						} else {
+							state.options = undefined;
+							if (groupChildren) {
+								state.used = true;
+							}
+						}
+					}
+				}
+			}
+			groupMap.delete(bestGroup);
+
+			const key = bestGroup.name;
+			const groupConfig = bestGroup.config;
+
+			const allItems = Array.from(items, ({ item }) => item);
+
+			bestGroup.alreadyGrouped = true;
+			const children = groupChildren ? runGrouping(items) : allItems;
+			bestGroup.alreadyGrouped = false;
+
+			results.push(groupConfig.createGroup(key, children, allItems));
+		}
+		for (const { item } of itemsWithGroups) {
+			results.push(item);
+		}
+		return results;
+	};
+	return runGrouping(itemsWithGroups);
+};
+
+module.exports = smartGrouping;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/util/source.js b/node_modules/mathjs/examples/node_modules/webpack/lib/util/source.js
new file mode 100644
index 0000000..5f13347
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/util/source.js
@@ -0,0 +1,61 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("webpack-sources").Source} Source */
+
+/** @type {WeakMap<Source, WeakMap<Source, boolean>>} */
+const equalityCache = new WeakMap();
+
+/**
+ * @param {Source} a a source
+ * @param {Source} b another source
+ * @returns {boolean} true, when both sources are equal
+ */
+const _isSourceEqual = (a, b) => {
+	// prefer .buffer(), it's called anyway during emit
+	/** @type {Buffer|string} */
+	let aSource = typeof a.buffer === "function" ? a.buffer() : a.source();
+	/** @type {Buffer|string} */
+	let bSource = typeof b.buffer === "function" ? b.buffer() : b.source();
+	if (aSource === bSource) return true;
+	if (typeof aSource === "string" && typeof bSource === "string") return false;
+	if (!Buffer.isBuffer(aSource)) aSource = Buffer.from(aSource, "utf-8");
+	if (!Buffer.isBuffer(bSource)) bSource = Buffer.from(bSource, "utf-8");
+	return aSource.equals(bSource);
+};
+
+/**
+ * @param {Source} a a source
+ * @param {Source} b another source
+ * @returns {boolean} true, when both sources are equal
+ */
+const isSourceEqual = (a, b) => {
+	if (a === b) return true;
+	const cache1 = equalityCache.get(a);
+	if (cache1 !== undefined) {
+		const result = cache1.get(b);
+		if (result !== undefined) return result;
+	}
+	const result = _isSourceEqual(a, b);
+	if (cache1 !== undefined) {
+		cache1.set(b, result);
+	} else {
+		const map = new WeakMap();
+		map.set(b, result);
+		equalityCache.set(a, map);
+	}
+	const cache2 = equalityCache.get(b);
+	if (cache2 !== undefined) {
+		cache2.set(a, result);
+	} else {
+		const map = new WeakMap();
+		map.set(a, result);
+		equalityCache.set(b, map);
+	}
+	return result;
+};
+exports.isSourceEqual = isSourceEqual;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/validateSchema.js b/node_modules/mathjs/examples/node_modules/webpack/lib/validateSchema.js
new file mode 100644
index 0000000..2f84ac4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/validateSchema.js
@@ -0,0 +1,175 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { validate } = require("schema-utils");
+
+/* cSpell:disable */
+const DID_YOU_MEAN = {
+	rules: "module.rules",
+	loaders: "module.rules or module.rules.*.use",
+	query: "module.rules.*.options (BREAKING CHANGE since webpack 5)",
+	noParse: "module.noParse",
+	filename: "output.filename or module.rules.*.generator.filename",
+	file: "output.filename",
+	chunkFilename: "output.chunkFilename",
+	chunkfilename: "output.chunkFilename",
+	ecmaVersion:
+		"output.environment (output.ecmaVersion was a temporary configuration option during webpack 5 beta)",
+	ecmaversion:
+		"output.environment (output.ecmaVersion was a temporary configuration option during webpack 5 beta)",
+	ecma: "output.environment (output.ecmaVersion was a temporary configuration option during webpack 5 beta)",
+	path: "output.path",
+	pathinfo: "output.pathinfo",
+	pathInfo: "output.pathinfo",
+	jsonpFunction: "output.chunkLoadingGlobal (BREAKING CHANGE since webpack 5)",
+	chunkCallbackName:
+		"output.chunkLoadingGlobal (BREAKING CHANGE since webpack 5)",
+	jsonpScriptType: "output.scriptType (BREAKING CHANGE since webpack 5)",
+	hotUpdateFunction: "output.hotUpdateGlobal (BREAKING CHANGE since webpack 5)",
+	splitChunks: "optimization.splitChunks",
+	immutablePaths: "snapshot.immutablePaths",
+	managedPaths: "snapshot.managedPaths",
+	maxModules: "stats.modulesSpace (BREAKING CHANGE since webpack 5)",
+	hashedModuleIds:
+		'optimization.moduleIds: "hashed" (BREAKING CHANGE since webpack 5)',
+	namedChunks:
+		'optimization.chunkIds: "named" (BREAKING CHANGE since webpack 5)',
+	namedModules:
+		'optimization.moduleIds: "named" (BREAKING CHANGE since webpack 5)',
+	occurrenceOrder:
+		'optimization.chunkIds: "size" and optimization.moduleIds: "size" (BREAKING CHANGE since webpack 5)',
+	automaticNamePrefix:
+		"optimization.splitChunks.[cacheGroups.*].idHint (BREAKING CHANGE since webpack 5)",
+	noEmitOnErrors:
+		"optimization.emitOnErrors (BREAKING CHANGE since webpack 5: logic is inverted to avoid negative flags)",
+	Buffer:
+		"to use the ProvidePlugin to process the Buffer variable to modules as polyfill\n" +
+		"BREAKING CHANGE: webpack 5 no longer provided Node.js polyfills by default.\n" +
+		"Note: if you are using 'node.Buffer: false', you can just remove that as this is the default behavior now.\n" +
+		"To provide a polyfill to modules use:\n" +
+		'new ProvidePlugin({ Buffer: ["buffer", "Buffer"] }) and npm install buffer.',
+	process:
+		"to use the ProvidePlugin to process the process variable to modules as polyfill\n" +
+		"BREAKING CHANGE: webpack 5 no longer provided Node.js polyfills by default.\n" +
+		"Note: if you are using 'node.process: false', you can just remove that as this is the default behavior now.\n" +
+		"To provide a polyfill to modules use:\n" +
+		'new ProvidePlugin({ process: "process" }) and npm install buffer.'
+};
+
+const REMOVED = {
+	concord:
+		"BREAKING CHANGE: resolve.concord has been removed and is no longer available.",
+	devtoolLineToLine:
+		"BREAKING CHANGE: output.devtoolLineToLine has been removed and is no longer available."
+};
+/* cSpell:enable */
+
+/**
+ * @param {Parameters<typeof validate>[0]} schema a json schema
+ * @param {Parameters<typeof validate>[1]} options the options that should be validated
+ * @param {Parameters<typeof validate>[2]=} validationConfiguration configuration for generating errors
+ * @returns {void}
+ */
+const validateSchema = (schema, options, validationConfiguration) => {
+	validate(
+		schema,
+		options,
+		validationConfiguration || {
+			name: "Webpack",
+			postFormatter: (formattedError, error) => {
+				const children = error.children;
+				if (
+					children &&
+					children.some(
+						child =>
+							child.keyword === "absolutePath" &&
+							child.dataPath === ".output.filename"
+					)
+				) {
+					return `${formattedError}\nPlease use output.path to specify absolute path and output.filename for the file name.`;
+				}
+
+				if (
+					children &&
+					children.some(
+						child =>
+							child.keyword === "pattern" && child.dataPath === ".devtool"
+					)
+				) {
+					return (
+						`${formattedError}\n` +
+						"BREAKING CHANGE since webpack 5: The devtool option is more strict.\n" +
+						"Please strictly follow the order of the keywords in the pattern."
+					);
+				}
+
+				if (error.keyword === "additionalProperties") {
+					const params =
+						/** @type {import("ajv").AdditionalPropertiesParams} */ (
+							error.params
+						);
+					if (
+						Object.prototype.hasOwnProperty.call(
+							DID_YOU_MEAN,
+							params.additionalProperty
+						)
+					) {
+						return `${formattedError}\nDid you mean ${
+							DID_YOU_MEAN[params.additionalProperty]
+						}?`;
+					}
+
+					if (
+						Object.prototype.hasOwnProperty.call(
+							REMOVED,
+							params.additionalProperty
+						)
+					) {
+						return `${formattedError}\n${REMOVED[params.additionalProperty]}?`;
+					}
+
+					if (!error.dataPath) {
+						if (params.additionalProperty === "debug") {
+							return (
+								`${formattedError}\n` +
+								"The 'debug' property was removed in webpack 2.0.0.\n" +
+								"Loaders should be updated to allow passing this option via loader options in module.rules.\n" +
+								"Until loaders are updated one can use the LoaderOptionsPlugin to switch loaders into debug mode:\n" +
+								"plugins: [\n" +
+								"  new webpack.LoaderOptionsPlugin({\n" +
+								"    debug: true\n" +
+								"  })\n" +
+								"]"
+							);
+						}
+
+						if (params.additionalProperty) {
+							return (
+								`${formattedError}\n` +
+								"For typos: please correct them.\n" +
+								"For loader options: webpack >= v2.0.0 no longer allows custom properties in configuration.\n" +
+								"  Loaders should be updated to allow passing options via loader options in module.rules.\n" +
+								"  Until loaders are updated one can use the LoaderOptionsPlugin to pass these options to the loader:\n" +
+								"  plugins: [\n" +
+								"    new webpack.LoaderOptionsPlugin({\n" +
+								"      // test: /\\.xxx$/, // may apply this only for some modules\n" +
+								"      options: {\n" +
+								`        ${params.additionalProperty}: …\n` +
+								"      }\n" +
+								"    })\n" +
+								"  ]"
+							);
+						}
+					}
+				}
+
+				return formattedError;
+			}
+		}
+	);
+};
+module.exports = validateSchema;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWasmLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWasmLoadingRuntimeModule.js
new file mode 100644
index 0000000..3e275fa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWasmLoadingRuntimeModule.js
@@ -0,0 +1,78 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+
+class AsyncWasmLoadingRuntimeModule extends RuntimeModule {
+	constructor({ generateLoadBinaryCode, supportsStreaming }) {
+		super("wasm loading", RuntimeModule.STAGE_NORMAL);
+		this.generateLoadBinaryCode = generateLoadBinaryCode;
+		this.supportsStreaming = supportsStreaming;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { compilation, chunk } = this;
+		const { outputOptions, runtimeTemplate } = compilation;
+		const fn = RuntimeGlobals.instantiateWasm;
+		const wasmModuleSrcPath = compilation.getPath(
+			JSON.stringify(outputOptions.webassemblyModuleFilename),
+			{
+				hash: `" + ${RuntimeGlobals.getFullHash}() + "`,
+				hashWithLength: length =>
+					`" + ${RuntimeGlobals.getFullHash}}().slice(0, ${length}) + "`,
+				module: {
+					id: '" + wasmModuleId + "',
+					hash: `" + wasmModuleHash + "`,
+					hashWithLength(length) {
+						return `" + wasmModuleHash.slice(0, ${length}) + "`;
+					}
+				},
+				runtime: chunk.runtime
+			}
+		);
+		return `${fn} = ${runtimeTemplate.basicFunction(
+			"exports, wasmModuleId, wasmModuleHash, importsObj",
+			[
+				`var req = ${this.generateLoadBinaryCode(wasmModuleSrcPath)};`,
+				this.supportsStreaming
+					? Template.asString([
+							"if (typeof WebAssembly.instantiateStreaming === 'function') {",
+							Template.indent([
+								"return WebAssembly.instantiateStreaming(req, importsObj)",
+								Template.indent([
+									`.then(${runtimeTemplate.returningFunction(
+										"Object.assign(exports, res.instance.exports)",
+										"res"
+									)});`
+								])
+							]),
+							"}"
+					  ])
+					: "// no support for streaming compilation",
+				"return req",
+				Template.indent([
+					`.then(${runtimeTemplate.returningFunction("x.arrayBuffer()", "x")})`,
+					`.then(${runtimeTemplate.returningFunction(
+						"WebAssembly.instantiate(bytes, importsObj)",
+						"bytes"
+					)})`,
+					`.then(${runtimeTemplate.returningFunction(
+						"Object.assign(exports, res.instance.exports)",
+						"res"
+					)});`
+				])
+			]
+		)};`;
+	}
+}
+
+module.exports = AsyncWasmLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyGenerator.js
new file mode 100644
index 0000000..803f901
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyGenerator.js
@@ -0,0 +1,53 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Generator = require("../Generator");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../NormalModule")} NormalModule */
+
+const TYPES = new Set(["webassembly"]);
+
+class AsyncWebAssemblyGenerator extends Generator {
+	constructor(options) {
+		super();
+		this.options = options;
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		const originalSource = module.originalSource();
+		if (!originalSource) {
+			return 0;
+		}
+		return originalSource.size();
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, generateContext) {
+		return module.originalSource();
+	}
+}
+
+module.exports = AsyncWebAssemblyGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyJavascriptGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyJavascriptGenerator.js
new file mode 100644
index 0000000..5962ea4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyJavascriptGenerator.js
@@ -0,0 +1,194 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const Generator = require("../Generator");
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const WebAssemblyImportDependency = require("../dependencies/WebAssemblyImportDependency");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+
+const TYPES = new Set(["webassembly"]);
+
+class AsyncWebAssemblyJavascriptGenerator extends Generator {
+	constructor(filenameTemplate) {
+		super();
+		this.filenameTemplate = filenameTemplate;
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		return 40 + module.dependencies.length * 10;
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, generateContext) {
+		const {
+			runtimeTemplate,
+			chunkGraph,
+			moduleGraph,
+			runtimeRequirements,
+			runtime
+		} = generateContext;
+		runtimeRequirements.add(RuntimeGlobals.module);
+		runtimeRequirements.add(RuntimeGlobals.moduleId);
+		runtimeRequirements.add(RuntimeGlobals.exports);
+		runtimeRequirements.add(RuntimeGlobals.instantiateWasm);
+		/** @type {InitFragment[]} */
+		const initFragments = [];
+		/** @type {Map<Module, { request: string, importVar: string }>} */
+		const depModules = new Map();
+		/** @type {Map<string, WebAssemblyImportDependency[]>} */
+		const wasmDepsByRequest = new Map();
+		for (const dep of module.dependencies) {
+			if (dep instanceof WebAssemblyImportDependency) {
+				const module = moduleGraph.getModule(dep);
+				if (!depModules.has(module)) {
+					depModules.set(module, {
+						request: dep.request,
+						importVar: `WEBPACK_IMPORTED_MODULE_${depModules.size}`
+					});
+				}
+				let list = wasmDepsByRequest.get(dep.request);
+				if (list === undefined) {
+					list = [];
+					wasmDepsByRequest.set(dep.request, list);
+				}
+				list.push(dep);
+			}
+		}
+
+		const promises = [];
+
+		const importStatements = Array.from(
+			depModules,
+			([importedModule, { request, importVar }]) => {
+				if (moduleGraph.isAsync(importedModule)) {
+					promises.push(importVar);
+				}
+				return runtimeTemplate.importStatement({
+					update: false,
+					module: importedModule,
+					chunkGraph,
+					request,
+					originModule: module,
+					importVar,
+					runtimeRequirements
+				});
+			}
+		);
+		const importsCode = importStatements.map(([x]) => x).join("");
+		const importsCompatCode = importStatements.map(([_, x]) => x).join("");
+
+		const importObjRequestItems = Array.from(
+			wasmDepsByRequest,
+			([request, deps]) => {
+				const exportItems = deps.map(dep => {
+					const importedModule = moduleGraph.getModule(dep);
+					const importVar = depModules.get(importedModule).importVar;
+					return `${JSON.stringify(
+						dep.name
+					)}: ${runtimeTemplate.exportFromImport({
+						moduleGraph,
+						module: importedModule,
+						request,
+						exportName: dep.name,
+						originModule: module,
+						asiSafe: true,
+						isCall: false,
+						callContext: false,
+						defaultInterop: true,
+						importVar,
+						initFragments,
+						runtime,
+						runtimeRequirements
+					})}`;
+				});
+				return Template.asString([
+					`${JSON.stringify(request)}: {`,
+					Template.indent(exportItems.join(",\n")),
+					"}"
+				]);
+			}
+		);
+
+		const importsObj =
+			importObjRequestItems.length > 0
+				? Template.asString([
+						"{",
+						Template.indent(importObjRequestItems.join(",\n")),
+						"}"
+				  ])
+				: undefined;
+
+		const instantiateCall =
+			`${RuntimeGlobals.instantiateWasm}(${module.exportsArgument}, ${
+				module.moduleArgument
+			}.id, ${JSON.stringify(
+				chunkGraph.getRenderedModuleHash(module, runtime)
+			)}` + (importsObj ? `, ${importsObj})` : `)`);
+
+		if (promises.length > 0)
+			runtimeRequirements.add(RuntimeGlobals.asyncModule);
+
+		const source = new RawSource(
+			promises.length > 0
+				? Template.asString([
+						`var __webpack_instantiate__ = ${runtimeTemplate.basicFunction(
+							`[${promises.join(", ")}]`,
+							`${importsCompatCode}return ${instantiateCall};`
+						)}`,
+						`${RuntimeGlobals.asyncModule}(${
+							module.moduleArgument
+						}, async ${runtimeTemplate.basicFunction(
+							"__webpack_handle_async_dependencies__, __webpack_async_result__",
+							[
+								"try {",
+								importsCode,
+								`var __webpack_async_dependencies__ = __webpack_handle_async_dependencies__([${promises.join(
+									", "
+								)}]);`,
+								`var [${promises.join(
+									", "
+								)}] = __webpack_async_dependencies__.then ? (await __webpack_async_dependencies__)() : __webpack_async_dependencies__;`,
+								`${importsCompatCode}await ${instantiateCall};`,
+								"__webpack_async_result__();",
+								"} catch(e) { __webpack_async_result__(e); }"
+							]
+						)}, 1);`
+				  ])
+				: `${importsCode}${importsCompatCode}module.exports = ${instantiateCall};`
+		);
+
+		return InitFragment.addToSource(source, initFragments, generateContext);
+	}
+}
+
+module.exports = AsyncWebAssemblyJavascriptGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyModulesPlugin.js
new file mode 100644
index 0000000..d3ea313
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyModulesPlugin.js
@@ -0,0 +1,198 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { SyncWaterfallHook } = require("tapable");
+const Compilation = require("../Compilation");
+const Generator = require("../Generator");
+const { tryRunOrWebpackError } = require("../HookWebpackError");
+const WebAssemblyImportDependency = require("../dependencies/WebAssemblyImportDependency");
+const { compareModulesByIdentifier } = require("../util/comparators");
+const memoize = require("../util/memoize");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../CodeGenerationResults")} CodeGenerationResults */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../Template").RenderManifestEntry} RenderManifestEntry */
+/** @typedef {import("../Template").RenderManifestOptions} RenderManifestOptions */
+
+const getAsyncWebAssemblyGenerator = memoize(() =>
+	require("./AsyncWebAssemblyGenerator")
+);
+const getAsyncWebAssemblyJavascriptGenerator = memoize(() =>
+	require("./AsyncWebAssemblyJavascriptGenerator")
+);
+const getAsyncWebAssemblyParser = memoize(() =>
+	require("./AsyncWebAssemblyParser")
+);
+
+/**
+ * @typedef {Object} WebAssemblyRenderContext
+ * @property {Chunk} chunk the chunk
+ * @property {DependencyTemplates} dependencyTemplates the dependency templates
+ * @property {RuntimeTemplate} runtimeTemplate the runtime template
+ * @property {ModuleGraph} moduleGraph the module graph
+ * @property {ChunkGraph} chunkGraph the chunk graph
+ * @property {CodeGenerationResults} codeGenerationResults results of code generation
+ */
+
+/**
+ * @typedef {Object} CompilationHooks
+ * @property {SyncWaterfallHook<[Source, Module, WebAssemblyRenderContext]>} renderModuleContent
+ */
+
+/** @type {WeakMap<Compilation, CompilationHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class AsyncWebAssemblyModulesPlugin {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {CompilationHooks} the attached hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				renderModuleContent: new SyncWaterfallHook([
+					"source",
+					"module",
+					"renderContext"
+				])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"AsyncWebAssemblyModulesPlugin",
+			(compilation, { normalModuleFactory }) => {
+				const hooks =
+					AsyncWebAssemblyModulesPlugin.getCompilationHooks(compilation);
+				compilation.dependencyFactories.set(
+					WebAssemblyImportDependency,
+					normalModuleFactory
+				);
+
+				normalModuleFactory.hooks.createParser
+					.for("webassembly/async")
+					.tap("AsyncWebAssemblyModulesPlugin", () => {
+						const AsyncWebAssemblyParser = getAsyncWebAssemblyParser();
+
+						return new AsyncWebAssemblyParser();
+					});
+				normalModuleFactory.hooks.createGenerator
+					.for("webassembly/async")
+					.tap("AsyncWebAssemblyModulesPlugin", () => {
+						const AsyncWebAssemblyJavascriptGenerator =
+							getAsyncWebAssemblyJavascriptGenerator();
+						const AsyncWebAssemblyGenerator = getAsyncWebAssemblyGenerator();
+
+						return Generator.byType({
+							javascript: new AsyncWebAssemblyJavascriptGenerator(
+								compilation.outputOptions.webassemblyModuleFilename
+							),
+							webassembly: new AsyncWebAssemblyGenerator(this.options)
+						});
+					});
+
+				compilation.hooks.renderManifest.tap(
+					"WebAssemblyModulesPlugin",
+					(result, options) => {
+						const { moduleGraph, chunkGraph, runtimeTemplate } = compilation;
+						const {
+							chunk,
+							outputOptions,
+							dependencyTemplates,
+							codeGenerationResults
+						} = options;
+
+						for (const module of chunkGraph.getOrderedChunkModulesIterable(
+							chunk,
+							compareModulesByIdentifier
+						)) {
+							if (module.type === "webassembly/async") {
+								const filenameTemplate =
+									outputOptions.webassemblyModuleFilename;
+
+								result.push({
+									render: () =>
+										this.renderModule(
+											module,
+											{
+												chunk,
+												dependencyTemplates,
+												runtimeTemplate,
+												moduleGraph,
+												chunkGraph,
+												codeGenerationResults
+											},
+											hooks
+										),
+									filenameTemplate,
+									pathOptions: {
+										module,
+										runtime: chunk.runtime,
+										chunkGraph
+									},
+									auxiliary: true,
+									identifier: `webassemblyAsyncModule${chunkGraph.getModuleId(
+										module
+									)}`,
+									hash: chunkGraph.getModuleHash(module, chunk.runtime)
+								});
+							}
+						}
+
+						return result;
+					}
+				);
+			}
+		);
+	}
+
+	renderModule(module, renderContext, hooks) {
+		const { codeGenerationResults, chunk } = renderContext;
+		try {
+			const moduleSource = codeGenerationResults.getSource(
+				module,
+				chunk.runtime,
+				"webassembly"
+			);
+			return tryRunOrWebpackError(
+				() =>
+					hooks.renderModuleContent.call(moduleSource, module, renderContext),
+				"AsyncWebAssemblyModulesPlugin.getCompilationHooks().renderModuleContent"
+			);
+		} catch (e) {
+			e.module = module;
+			throw e;
+		}
+	}
+}
+
+module.exports = AsyncWebAssemblyModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyParser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyParser.js
new file mode 100644
index 0000000..e784ba7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-async/AsyncWebAssemblyParser.js
@@ -0,0 +1,75 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const t = require("@webassemblyjs/ast");
+const { decode } = require("@webassemblyjs/wasm-parser");
+const Parser = require("../Parser");
+const StaticExportsDependency = require("../dependencies/StaticExportsDependency");
+const WebAssemblyImportDependency = require("../dependencies/WebAssemblyImportDependency");
+
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../Parser").PreparsedAst} PreparsedAst */
+
+const decoderOpts = {
+	ignoreCodeSection: true,
+	ignoreDataSection: true,
+
+	// this will avoid having to lookup with identifiers in the ModuleContext
+	ignoreCustomNameSection: true
+};
+
+class WebAssemblyParser extends Parser {
+	constructor(options) {
+		super();
+		this.hooks = Object.freeze({});
+		this.options = options;
+	}
+
+	/**
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		if (!Buffer.isBuffer(source)) {
+			throw new Error("WebAssemblyParser input must be a Buffer");
+		}
+
+		// flag it as async module
+		state.module.buildInfo.strict = true;
+		state.module.buildMeta.exportsType = "namespace";
+		state.module.buildMeta.async = true;
+
+		// parse it
+		const program = decode(source, decoderOpts);
+		const module = program.body[0];
+
+		const exports = [];
+		t.traverse(module, {
+			ModuleExport({ node }) {
+				exports.push(node.name);
+			},
+
+			ModuleImport({ node }) {
+				const dep = new WebAssemblyImportDependency(
+					node.module,
+					node.name,
+					node.descr,
+					false
+				);
+
+				state.module.addDependency(dep);
+			}
+		});
+
+		state.module.addDependency(new StaticExportsDependency(exports, false));
+
+		return state;
+	}
+}
+
+module.exports = WebAssemblyParser;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/UnsupportedWebAssemblyFeatureError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/UnsupportedWebAssemblyFeatureError.js
new file mode 100644
index 0000000..5174862
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/UnsupportedWebAssemblyFeatureError.js
@@ -0,0 +1,16 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+
+module.exports = class UnsupportedWebAssemblyFeatureError extends WebpackError {
+	/** @param {string} message Error message */
+	constructor(message) {
+		super(message);
+		this.name = "UnsupportedWebAssemblyFeatureError";
+		this.hideStack = true;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WasmChunkLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WasmChunkLoadingRuntimeModule.js
new file mode 100644
index 0000000..e956b75
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WasmChunkLoadingRuntimeModule.js
@@ -0,0 +1,372 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const { compareModulesByIdentifier } = require("../util/comparators");
+const WebAssemblyUtils = require("./WebAssemblyUtils");
+
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+
+// TODO webpack 6 remove the whole folder
+
+// Get all wasm modules
+const getAllWasmModules = (moduleGraph, chunkGraph, chunk) => {
+	const wasmModules = chunk.getAllAsyncChunks();
+	const array = [];
+	for (const chunk of wasmModules) {
+		for (const m of chunkGraph.getOrderedChunkModulesIterable(
+			chunk,
+			compareModulesByIdentifier
+		)) {
+			if (m.type.startsWith("webassembly")) {
+				array.push(m);
+			}
+		}
+	}
+
+	return array;
+};
+
+/**
+ * generates the import object function for a module
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {Module} module the module
+ * @param {boolean} mangle mangle imports
+ * @param {string[]} declarations array where declarations are pushed to
+ * @param {RuntimeSpec} runtime the runtime
+ * @returns {string} source code
+ */
+const generateImportObject = (
+	chunkGraph,
+	module,
+	mangle,
+	declarations,
+	runtime
+) => {
+	const moduleGraph = chunkGraph.moduleGraph;
+	const waitForInstances = new Map();
+	const properties = [];
+	const usedWasmDependencies = WebAssemblyUtils.getUsedDependencies(
+		moduleGraph,
+		module,
+		mangle
+	);
+	for (const usedDep of usedWasmDependencies) {
+		const dep = usedDep.dependency;
+		const importedModule = moduleGraph.getModule(dep);
+		const exportName = dep.name;
+		const usedName =
+			importedModule &&
+			moduleGraph
+				.getExportsInfo(importedModule)
+				.getUsedName(exportName, runtime);
+		const description = dep.description;
+		const direct = dep.onlyDirectImport;
+
+		const module = usedDep.module;
+		const name = usedDep.name;
+
+		if (direct) {
+			const instanceVar = `m${waitForInstances.size}`;
+			waitForInstances.set(instanceVar, chunkGraph.getModuleId(importedModule));
+			properties.push({
+				module,
+				name,
+				value: `${instanceVar}[${JSON.stringify(usedName)}]`
+			});
+		} else {
+			const params = description.signature.params.map(
+				(param, k) => "p" + k + param.valtype
+			);
+
+			const mod = `${RuntimeGlobals.moduleCache}[${JSON.stringify(
+				chunkGraph.getModuleId(importedModule)
+			)}]`;
+			const modExports = `${mod}.exports`;
+
+			const cache = `wasmImportedFuncCache${declarations.length}`;
+			declarations.push(`var ${cache};`);
+
+			properties.push({
+				module,
+				name,
+				value: Template.asString([
+					(importedModule.type.startsWith("webassembly")
+						? `${mod} ? ${modExports}[${JSON.stringify(usedName)}] : `
+						: "") + `function(${params}) {`,
+					Template.indent([
+						`if(${cache} === undefined) ${cache} = ${modExports};`,
+						`return ${cache}[${JSON.stringify(usedName)}](${params});`
+					]),
+					"}"
+				])
+			});
+		}
+	}
+
+	let importObject;
+	if (mangle) {
+		importObject = [
+			"return {",
+			Template.indent([
+				properties.map(p => `${JSON.stringify(p.name)}: ${p.value}`).join(",\n")
+			]),
+			"};"
+		];
+	} else {
+		const propertiesByModule = new Map();
+		for (const p of properties) {
+			let list = propertiesByModule.get(p.module);
+			if (list === undefined) {
+				propertiesByModule.set(p.module, (list = []));
+			}
+			list.push(p);
+		}
+		importObject = [
+			"return {",
+			Template.indent([
+				Array.from(propertiesByModule, ([module, list]) => {
+					return Template.asString([
+						`${JSON.stringify(module)}: {`,
+						Template.indent([
+							list.map(p => `${JSON.stringify(p.name)}: ${p.value}`).join(",\n")
+						]),
+						"}"
+					]);
+				}).join(",\n")
+			]),
+			"};"
+		];
+	}
+
+	const moduleIdStringified = JSON.stringify(chunkGraph.getModuleId(module));
+	if (waitForInstances.size === 1) {
+		const moduleId = Array.from(waitForInstances.values())[0];
+		const promise = `installedWasmModules[${JSON.stringify(moduleId)}]`;
+		const variable = Array.from(waitForInstances.keys())[0];
+		return Template.asString([
+			`${moduleIdStringified}: function() {`,
+			Template.indent([
+				`return promiseResolve().then(function() { return ${promise}; }).then(function(${variable}) {`,
+				Template.indent(importObject),
+				"});"
+			]),
+			"},"
+		]);
+	} else if (waitForInstances.size > 0) {
+		const promises = Array.from(
+			waitForInstances.values(),
+			id => `installedWasmModules[${JSON.stringify(id)}]`
+		).join(", ");
+		const variables = Array.from(
+			waitForInstances.keys(),
+			(name, i) => `${name} = array[${i}]`
+		).join(", ");
+		return Template.asString([
+			`${moduleIdStringified}: function() {`,
+			Template.indent([
+				`return promiseResolve().then(function() { return Promise.all([${promises}]); }).then(function(array) {`,
+				Template.indent([`var ${variables};`, ...importObject]),
+				"});"
+			]),
+			"},"
+		]);
+	} else {
+		return Template.asString([
+			`${moduleIdStringified}: function() {`,
+			Template.indent(importObject),
+			"},"
+		]);
+	}
+};
+
+class WasmChunkLoadingRuntimeModule extends RuntimeModule {
+	constructor({
+		generateLoadBinaryCode,
+		supportsStreaming,
+		mangleImports,
+		runtimeRequirements
+	}) {
+		super("wasm chunk loading", RuntimeModule.STAGE_ATTACH);
+		this.generateLoadBinaryCode = generateLoadBinaryCode;
+		this.supportsStreaming = supportsStreaming;
+		this.mangleImports = mangleImports;
+		this._runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkGraph, compilation, chunk, mangleImports } = this;
+		const { moduleGraph, outputOptions } = compilation;
+		const fn = RuntimeGlobals.ensureChunkHandlers;
+		const withHmr = this._runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadUpdateHandlers
+		);
+		const wasmModules = getAllWasmModules(moduleGraph, chunkGraph, chunk);
+		const declarations = [];
+		const importObjects = wasmModules.map(module => {
+			return generateImportObject(
+				chunkGraph,
+				module,
+				this.mangleImports,
+				declarations,
+				chunk.runtime
+			);
+		});
+		const chunkModuleIdMap = chunkGraph.getChunkModuleIdMap(chunk, m =>
+			m.type.startsWith("webassembly")
+		);
+		const createImportObject = content =>
+			mangleImports
+				? `{ ${JSON.stringify(WebAssemblyUtils.MANGLED_MODULE)}: ${content} }`
+				: content;
+		const wasmModuleSrcPath = compilation.getPath(
+			JSON.stringify(outputOptions.webassemblyModuleFilename),
+			{
+				hash: `" + ${RuntimeGlobals.getFullHash}() + "`,
+				hashWithLength: length =>
+					`" + ${RuntimeGlobals.getFullHash}}().slice(0, ${length}) + "`,
+				module: {
+					id: '" + wasmModuleId + "',
+					hash: `" + ${JSON.stringify(
+						chunkGraph.getChunkModuleRenderedHashMap(chunk, m =>
+							m.type.startsWith("webassembly")
+						)
+					)}[chunkId][wasmModuleId] + "`,
+					hashWithLength(length) {
+						return `" + ${JSON.stringify(
+							chunkGraph.getChunkModuleRenderedHashMap(
+								chunk,
+								m => m.type.startsWith("webassembly"),
+								length
+							)
+						)}[chunkId][wasmModuleId] + "`;
+					}
+				},
+				runtime: chunk.runtime
+			}
+		);
+
+		const stateExpression = withHmr
+			? `${RuntimeGlobals.hmrRuntimeStatePrefix}_wasm`
+			: undefined;
+
+		return Template.asString([
+			"// object to store loaded and loading wasm modules",
+			`var installedWasmModules = ${
+				stateExpression ? `${stateExpression} = ${stateExpression} || ` : ""
+			}{};`,
+			"",
+			// This function is used to delay reading the installed wasm module promises
+			// by a microtask. Sorting them doesn't help because there are edge cases where
+			// sorting is not possible (modules splitted into different chunks).
+			// So we not even trying and solve this by a microtask delay.
+			"function promiseResolve() { return Promise.resolve(); }",
+			"",
+			Template.asString(declarations),
+			"var wasmImportObjects = {",
+			Template.indent(importObjects),
+			"};",
+			"",
+			`var wasmModuleMap = ${JSON.stringify(
+				chunkModuleIdMap,
+				undefined,
+				"\t"
+			)};`,
+			"",
+			"// object with all WebAssembly.instance exports",
+			`${RuntimeGlobals.wasmInstances} = {};`,
+			"",
+			"// Fetch + compile chunk loading for webassembly",
+			`${fn}.wasm = function(chunkId, promises) {`,
+			Template.indent([
+				"",
+				`var wasmModules = wasmModuleMap[chunkId] || [];`,
+				"",
+				"wasmModules.forEach(function(wasmModuleId, idx) {",
+				Template.indent([
+					"var installedWasmModuleData = installedWasmModules[wasmModuleId];",
+					"",
+					'// a Promise means "currently loading" or "already loaded".',
+					"if(installedWasmModuleData)",
+					Template.indent(["promises.push(installedWasmModuleData);"]),
+					"else {",
+					Template.indent([
+						`var importObject = wasmImportObjects[wasmModuleId]();`,
+						`var req = ${this.generateLoadBinaryCode(wasmModuleSrcPath)};`,
+						"var promise;",
+						this.supportsStreaming
+							? Template.asString([
+									"if(importObject && typeof importObject.then === 'function' && typeof WebAssembly.compileStreaming === 'function') {",
+									Template.indent([
+										"promise = Promise.all([WebAssembly.compileStreaming(req), importObject]).then(function(items) {",
+										Template.indent([
+											`return WebAssembly.instantiate(items[0], ${createImportObject(
+												"items[1]"
+											)});`
+										]),
+										"});"
+									]),
+									"} else if(typeof WebAssembly.instantiateStreaming === 'function') {",
+									Template.indent([
+										`promise = WebAssembly.instantiateStreaming(req, ${createImportObject(
+											"importObject"
+										)});`
+									])
+							  ])
+							: Template.asString([
+									"if(importObject && typeof importObject.then === 'function') {",
+									Template.indent([
+										"var bytesPromise = req.then(function(x) { return x.arrayBuffer(); });",
+										"promise = Promise.all([",
+										Template.indent([
+											"bytesPromise.then(function(bytes) { return WebAssembly.compile(bytes); }),",
+											"importObject"
+										]),
+										"]).then(function(items) {",
+										Template.indent([
+											`return WebAssembly.instantiate(items[0], ${createImportObject(
+												"items[1]"
+											)});`
+										]),
+										"});"
+									])
+							  ]),
+						"} else {",
+						Template.indent([
+							"var bytesPromise = req.then(function(x) { return x.arrayBuffer(); });",
+							"promise = bytesPromise.then(function(bytes) {",
+							Template.indent([
+								`return WebAssembly.instantiate(bytes, ${createImportObject(
+									"importObject"
+								)});`
+							]),
+							"});"
+						]),
+						"}",
+						"promises.push(installedWasmModules[wasmModuleId] = promise.then(function(res) {",
+						Template.indent([
+							`return ${RuntimeGlobals.wasmInstances}[wasmModuleId] = (res.instance || res).exports;`
+						]),
+						"}));"
+					]),
+					"}"
+				]),
+				"});"
+			]),
+			"};"
+		]);
+	}
+}
+
+module.exports = WasmChunkLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WasmFinalizeExportsPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WasmFinalizeExportsPlugin.js
new file mode 100644
index 0000000..495338a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WasmFinalizeExportsPlugin.js
@@ -0,0 +1,82 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const formatLocation = require("../formatLocation");
+const UnsupportedWebAssemblyFeatureError = require("./UnsupportedWebAssemblyFeatureError");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class WasmFinalizeExportsPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap("WasmFinalizeExportsPlugin", compilation => {
+			compilation.hooks.finishModules.tap(
+				"WasmFinalizeExportsPlugin",
+				modules => {
+					for (const module of modules) {
+						// 1. if a WebAssembly module
+						if (module.type.startsWith("webassembly") === true) {
+							const jsIncompatibleExports =
+								module.buildMeta.jsIncompatibleExports;
+
+							if (jsIncompatibleExports === undefined) {
+								continue;
+							}
+
+							for (const connection of compilation.moduleGraph.getIncomingConnections(
+								module
+							)) {
+								// 2. is active and referenced by a non-WebAssembly module
+								if (
+									connection.isTargetActive(undefined) &&
+									connection.originModule.type.startsWith("webassembly") ===
+										false
+								) {
+									const referencedExports =
+										compilation.getDependencyReferencedExports(
+											connection.dependency,
+											undefined
+										);
+
+									for (const info of referencedExports) {
+										const names = Array.isArray(info) ? info : info.name;
+										if (names.length === 0) continue;
+										const name = names[0];
+										if (typeof name === "object") continue;
+										// 3. and uses a func with an incompatible JS signature
+										if (
+											Object.prototype.hasOwnProperty.call(
+												jsIncompatibleExports,
+												name
+											)
+										) {
+											// 4. error
+											const error = new UnsupportedWebAssemblyFeatureError(
+												`Export "${name}" with ${jsIncompatibleExports[name]} can only be used for direct wasm to wasm dependencies\n` +
+													`It's used from ${connection.originModule.readableIdentifier(
+														compilation.requestShortener
+													)} at ${formatLocation(connection.dependency.loc)}.`
+											);
+											error.module = module;
+											compilation.errors.push(error);
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			);
+		});
+	}
+}
+
+module.exports = WasmFinalizeExportsPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyGenerator.js
new file mode 100644
index 0000000..56874b0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyGenerator.js
@@ -0,0 +1,501 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const Generator = require("../Generator");
+const WebAssemblyUtils = require("./WebAssemblyUtils");
+
+const t = require("@webassemblyjs/ast");
+const { moduleContextFromModuleAST } = require("@webassemblyjs/ast");
+const { editWithAST, addWithAST } = require("@webassemblyjs/wasm-edit");
+const { decode } = require("@webassemblyjs/wasm-parser");
+
+const WebAssemblyExportImportedDependency = require("../dependencies/WebAssemblyExportImportedDependency");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+/** @typedef {import("../util/runtime").RuntimeSpec} RuntimeSpec */
+/** @typedef {import("./WebAssemblyUtils").UsedWasmDependency} UsedWasmDependency */
+
+/**
+ * @typedef {(ArrayBuffer) => ArrayBuffer} ArrayBufferTransform
+ */
+
+/**
+ * @template T
+ * @param {Function[]} fns transforms
+ * @returns {Function} composed transform
+ */
+const compose = (...fns) => {
+	return fns.reduce(
+		(prevFn, nextFn) => {
+			return value => nextFn(prevFn(value));
+		},
+		value => value
+	);
+};
+
+/**
+ * Removes the start instruction
+ *
+ * @param {Object} state unused state
+ * @returns {ArrayBufferTransform} transform
+ */
+const removeStartFunc = state => bin => {
+	return editWithAST(state.ast, bin, {
+		Start(path) {
+			path.remove();
+		}
+	});
+};
+
+/**
+ * Get imported globals
+ *
+ * @param {Object} ast Module's AST
+ * @returns {Array<t.ModuleImport>} - nodes
+ */
+const getImportedGlobals = ast => {
+	const importedGlobals = [];
+
+	t.traverse(ast, {
+		ModuleImport({ node }) {
+			if (t.isGlobalType(node.descr)) {
+				importedGlobals.push(node);
+			}
+		}
+	});
+
+	return importedGlobals;
+};
+
+/**
+ * Get the count for imported func
+ *
+ * @param {Object} ast Module's AST
+ * @returns {Number} - count
+ */
+const getCountImportedFunc = ast => {
+	let count = 0;
+
+	t.traverse(ast, {
+		ModuleImport({ node }) {
+			if (t.isFuncImportDescr(node.descr)) {
+				count++;
+			}
+		}
+	});
+
+	return count;
+};
+
+/**
+ * Get next type index
+ *
+ * @param {Object} ast Module's AST
+ * @returns {t.Index} - index
+ */
+const getNextTypeIndex = ast => {
+	const typeSectionMetadata = t.getSectionMetadata(ast, "type");
+
+	if (typeSectionMetadata === undefined) {
+		return t.indexLiteral(0);
+	}
+
+	return t.indexLiteral(typeSectionMetadata.vectorOfSize.value);
+};
+
+/**
+ * Get next func index
+ *
+ * The Func section metadata provide informations for implemented funcs
+ * in order to have the correct index we shift the index by number of external
+ * functions.
+ *
+ * @param {Object} ast Module's AST
+ * @param {Number} countImportedFunc number of imported funcs
+ * @returns {t.Index} - index
+ */
+const getNextFuncIndex = (ast, countImportedFunc) => {
+	const funcSectionMetadata = t.getSectionMetadata(ast, "func");
+
+	if (funcSectionMetadata === undefined) {
+		return t.indexLiteral(0 + countImportedFunc);
+	}
+
+	const vectorOfSize = funcSectionMetadata.vectorOfSize.value;
+
+	return t.indexLiteral(vectorOfSize + countImportedFunc);
+};
+
+/**
+ * Creates an init instruction for a global type
+ * @param {t.GlobalType} globalType the global type
+ * @returns {t.Instruction} init expression
+ */
+const createDefaultInitForGlobal = globalType => {
+	if (globalType.valtype[0] === "i") {
+		// create NumberLiteral global initializer
+		return t.objectInstruction("const", globalType.valtype, [
+			t.numberLiteralFromRaw(66)
+		]);
+	} else if (globalType.valtype[0] === "f") {
+		// create FloatLiteral global initializer
+		return t.objectInstruction("const", globalType.valtype, [
+			t.floatLiteral(66, false, false, "66")
+		]);
+	} else {
+		throw new Error("unknown type: " + globalType.valtype);
+	}
+};
+
+/**
+ * Rewrite the import globals:
+ * - removes the ModuleImport instruction
+ * - injects at the same offset a mutable global of the same type
+ *
+ * Since the imported globals are before the other global declarations, our
+ * indices will be preserved.
+ *
+ * Note that globals will become mutable.
+ *
+ * @param {Object} state unused state
+ * @returns {ArrayBufferTransform} transform
+ */
+const rewriteImportedGlobals = state => bin => {
+	const additionalInitCode = state.additionalInitCode;
+	const newGlobals = [];
+
+	bin = editWithAST(state.ast, bin, {
+		ModuleImport(path) {
+			if (t.isGlobalType(path.node.descr)) {
+				const globalType = path.node.descr;
+
+				globalType.mutability = "var";
+
+				const init = [
+					createDefaultInitForGlobal(globalType),
+					t.instruction("end")
+				];
+
+				newGlobals.push(t.global(globalType, init));
+
+				path.remove();
+			}
+		},
+
+		// in order to preserve non-imported global's order we need to re-inject
+		// those as well
+		Global(path) {
+			const { node } = path;
+			const [init] = node.init;
+
+			if (init.id === "get_global") {
+				node.globalType.mutability = "var";
+
+				const initialGlobalIdx = init.args[0];
+
+				node.init = [
+					createDefaultInitForGlobal(node.globalType),
+					t.instruction("end")
+				];
+
+				additionalInitCode.push(
+					/**
+					 * get_global in global initializer only works for imported globals.
+					 * They have the same indices as the init params, so use the
+					 * same index.
+					 */
+					t.instruction("get_local", [initialGlobalIdx]),
+					t.instruction("set_global", [t.indexLiteral(newGlobals.length)])
+				);
+			}
+
+			newGlobals.push(node);
+
+			path.remove();
+		}
+	});
+
+	// Add global declaration instructions
+	return addWithAST(state.ast, bin, newGlobals);
+};
+
+/**
+ * Rewrite the export names
+ * @param {Object} state state
+ * @param {Object} state.ast Module's ast
+ * @param {Module} state.module Module
+ * @param {ModuleGraph} state.moduleGraph module graph
+ * @param {Set<string>} state.externalExports Module
+ * @param {RuntimeSpec} state.runtime runtime
+ * @returns {ArrayBufferTransform} transform
+ */
+const rewriteExportNames =
+	({ ast, moduleGraph, module, externalExports, runtime }) =>
+	bin => {
+		return editWithAST(ast, bin, {
+			ModuleExport(path) {
+				const isExternal = externalExports.has(path.node.name);
+				if (isExternal) {
+					path.remove();
+					return;
+				}
+				const usedName = moduleGraph
+					.getExportsInfo(module)
+					.getUsedName(path.node.name, runtime);
+				if (!usedName) {
+					path.remove();
+					return;
+				}
+				path.node.name = usedName;
+			}
+		});
+	};
+
+/**
+ * Mangle import names and modules
+ * @param {Object} state state
+ * @param {Object} state.ast Module's ast
+ * @param {Map<string, UsedWasmDependency>} state.usedDependencyMap mappings to mangle names
+ * @returns {ArrayBufferTransform} transform
+ */
+const rewriteImports =
+	({ ast, usedDependencyMap }) =>
+	bin => {
+		return editWithAST(ast, bin, {
+			ModuleImport(path) {
+				const result = usedDependencyMap.get(
+					path.node.module + ":" + path.node.name
+				);
+
+				if (result !== undefined) {
+					path.node.module = result.module;
+					path.node.name = result.name;
+				}
+			}
+		});
+	};
+
+/**
+ * Add an init function.
+ *
+ * The init function fills the globals given input arguments.
+ *
+ * @param {Object} state transformation state
+ * @param {Object} state.ast Module's ast
+ * @param {t.Identifier} state.initFuncId identifier of the init function
+ * @param {t.Index} state.startAtFuncOffset index of the start function
+ * @param {t.ModuleImport[]} state.importedGlobals list of imported globals
+ * @param {t.Instruction[]} state.additionalInitCode list of addition instructions for the init function
+ * @param {t.Index} state.nextFuncIndex index of the next function
+ * @param {t.Index} state.nextTypeIndex index of the next type
+ * @returns {ArrayBufferTransform} transform
+ */
+const addInitFunction =
+	({
+		ast,
+		initFuncId,
+		startAtFuncOffset,
+		importedGlobals,
+		additionalInitCode,
+		nextFuncIndex,
+		nextTypeIndex
+	}) =>
+	bin => {
+		const funcParams = importedGlobals.map(importedGlobal => {
+			// used for debugging
+			const id = t.identifier(
+				`${importedGlobal.module}.${importedGlobal.name}`
+			);
+
+			return t.funcParam(importedGlobal.descr.valtype, id);
+		});
+
+		const funcBody = [];
+		importedGlobals.forEach((importedGlobal, index) => {
+			const args = [t.indexLiteral(index)];
+			const body = [
+				t.instruction("get_local", args),
+				t.instruction("set_global", args)
+			];
+
+			funcBody.push(...body);
+		});
+
+		if (typeof startAtFuncOffset === "number") {
+			funcBody.push(
+				t.callInstruction(t.numberLiteralFromRaw(startAtFuncOffset))
+			);
+		}
+
+		for (const instr of additionalInitCode) {
+			funcBody.push(instr);
+		}
+
+		funcBody.push(t.instruction("end"));
+
+		const funcResults = [];
+
+		// Code section
+		const funcSignature = t.signature(funcParams, funcResults);
+		const func = t.func(initFuncId, funcSignature, funcBody);
+
+		// Type section
+		const functype = t.typeInstruction(undefined, funcSignature);
+
+		// Func section
+		const funcindex = t.indexInFuncSection(nextTypeIndex);
+
+		// Export section
+		const moduleExport = t.moduleExport(
+			initFuncId.value,
+			t.moduleExportDescr("Func", nextFuncIndex)
+		);
+
+		return addWithAST(ast, bin, [func, moduleExport, funcindex, functype]);
+	};
+
+/**
+ * Extract mangle mappings from module
+ * @param {ModuleGraph} moduleGraph module graph
+ * @param {Module} module current module
+ * @param {boolean} mangle mangle imports
+ * @returns {Map<string, UsedWasmDependency>} mappings to mangled names
+ */
+const getUsedDependencyMap = (moduleGraph, module, mangle) => {
+	/** @type {Map<string, UsedWasmDependency>} */
+	const map = new Map();
+	for (const usedDep of WebAssemblyUtils.getUsedDependencies(
+		moduleGraph,
+		module,
+		mangle
+	)) {
+		const dep = usedDep.dependency;
+		const request = dep.request;
+		const exportName = dep.name;
+		map.set(request + ":" + exportName, usedDep);
+	}
+	return map;
+};
+
+const TYPES = new Set(["webassembly"]);
+
+class WebAssemblyGenerator extends Generator {
+	constructor(options) {
+		super();
+		this.options = options;
+	}
+
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		const originalSource = module.originalSource();
+		if (!originalSource) {
+			return 0;
+		}
+		return originalSource.size();
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, { moduleGraph, runtime }) {
+		const bin = module.originalSource().source();
+
+		const initFuncId = t.identifier("");
+
+		// parse it
+		const ast = decode(bin, {
+			ignoreDataSection: true,
+			ignoreCodeSection: true,
+			ignoreCustomNameSection: true
+		});
+
+		const moduleContext = moduleContextFromModuleAST(ast.body[0]);
+
+		const importedGlobals = getImportedGlobals(ast);
+		const countImportedFunc = getCountImportedFunc(ast);
+		const startAtFuncOffset = moduleContext.getStart();
+		const nextFuncIndex = getNextFuncIndex(ast, countImportedFunc);
+		const nextTypeIndex = getNextTypeIndex(ast);
+
+		const usedDependencyMap = getUsedDependencyMap(
+			moduleGraph,
+			module,
+			this.options.mangleImports
+		);
+		const externalExports = new Set(
+			module.dependencies
+				.filter(d => d instanceof WebAssemblyExportImportedDependency)
+				.map(d => {
+					const wasmDep = /** @type {WebAssemblyExportImportedDependency} */ (
+						d
+					);
+					return wasmDep.exportName;
+				})
+		);
+
+		/** @type {t.Instruction[]} */
+		const additionalInitCode = [];
+
+		const transform = compose(
+			rewriteExportNames({
+				ast,
+				moduleGraph,
+				module,
+				externalExports,
+				runtime
+			}),
+
+			removeStartFunc({ ast }),
+
+			rewriteImportedGlobals({ ast, additionalInitCode }),
+
+			rewriteImports({
+				ast,
+				usedDependencyMap
+			}),
+
+			addInitFunction({
+				ast,
+				initFuncId,
+				importedGlobals,
+				additionalInitCode,
+				startAtFuncOffset,
+				nextFuncIndex,
+				nextTypeIndex
+			})
+		);
+
+		const newBin = transform(bin);
+
+		const newBuf = Buffer.from(newBin);
+
+		return new RawSource(newBuf);
+	}
+}
+
+module.exports = WebAssemblyGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyInInitialChunkError.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyInInitialChunkError.js
new file mode 100644
index 0000000..9d78ed2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyInInitialChunkError.js
@@ -0,0 +1,106 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const WebpackError = require("../WebpackError");
+
+/** @typedef {import("../ChunkGraph")} ChunkGraph */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+/** @typedef {import("../RequestShortener")} RequestShortener */
+
+/**
+ * @param {Module} module module to get chains from
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {ChunkGraph} chunkGraph the chunk graph
+ * @param {RequestShortener} requestShortener to make readable identifiers
+ * @returns {string[]} all chains to the module
+ */
+const getInitialModuleChains = (
+	module,
+	moduleGraph,
+	chunkGraph,
+	requestShortener
+) => {
+	const queue = [
+		{ head: module, message: module.readableIdentifier(requestShortener) }
+	];
+	/** @type {Set<string>} */
+	const results = new Set();
+	/** @type {Set<string>} */
+	const incompleteResults = new Set();
+	/** @type {Set<Module>} */
+	const visitedModules = new Set();
+
+	for (const chain of queue) {
+		const { head, message } = chain;
+		let final = true;
+		/** @type {Set<Module>} */
+		const alreadyReferencedModules = new Set();
+		for (const connection of moduleGraph.getIncomingConnections(head)) {
+			const newHead = connection.originModule;
+			if (newHead) {
+				if (!chunkGraph.getModuleChunks(newHead).some(c => c.canBeInitial()))
+					continue;
+				final = false;
+				if (alreadyReferencedModules.has(newHead)) continue;
+				alreadyReferencedModules.add(newHead);
+				const moduleName = newHead.readableIdentifier(requestShortener);
+				const detail = connection.explanation
+					? ` (${connection.explanation})`
+					: "";
+				const newMessage = `${moduleName}${detail} --> ${message}`;
+				if (visitedModules.has(newHead)) {
+					incompleteResults.add(`... --> ${newMessage}`);
+					continue;
+				}
+				visitedModules.add(newHead);
+				queue.push({
+					head: newHead,
+					message: newMessage
+				});
+			} else {
+				final = false;
+				const newMessage = connection.explanation
+					? `(${connection.explanation}) --> ${message}`
+					: message;
+				results.add(newMessage);
+			}
+		}
+		if (final) {
+			results.add(message);
+		}
+	}
+	for (const result of incompleteResults) {
+		results.add(result);
+	}
+	return Array.from(results);
+};
+
+module.exports = class WebAssemblyInInitialChunkError extends WebpackError {
+	/**
+	 * @param {Module} module WASM module
+	 * @param {ModuleGraph} moduleGraph the module graph
+	 * @param {ChunkGraph} chunkGraph the chunk graph
+	 * @param {RequestShortener} requestShortener request shortener
+	 */
+	constructor(module, moduleGraph, chunkGraph, requestShortener) {
+		const moduleChains = getInitialModuleChains(
+			module,
+			moduleGraph,
+			chunkGraph,
+			requestShortener
+		);
+		const message = `WebAssembly module is included in initial chunk.
+This is not allowed, because WebAssembly download and compilation must happen asynchronous.
+Add an async split point (i. e. import()) somewhere between your entrypoint and the WebAssembly module:
+${moduleChains.map(s => `* ${s}`).join("\n")}`;
+
+		super(message);
+		this.name = "WebAssemblyInInitialChunkError";
+		this.hideStack = true;
+		this.module = module;
+	}
+};
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyJavascriptGenerator.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyJavascriptGenerator.js
new file mode 100644
index 0000000..9fa2b2f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyJavascriptGenerator.js
@@ -0,0 +1,216 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const { RawSource } = require("webpack-sources");
+const { UsageState } = require("../ExportsInfo");
+const Generator = require("../Generator");
+const InitFragment = require("../InitFragment");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const Template = require("../Template");
+const ModuleDependency = require("../dependencies/ModuleDependency");
+const WebAssemblyExportImportedDependency = require("../dependencies/WebAssemblyExportImportedDependency");
+const WebAssemblyImportDependency = require("../dependencies/WebAssemblyImportDependency");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Dependency")} Dependency */
+/** @typedef {import("../DependencyTemplates")} DependencyTemplates */
+/** @typedef {import("../Generator").GenerateContext} GenerateContext */
+/** @typedef {import("../NormalModule")} NormalModule */
+/** @typedef {import("../RuntimeTemplate")} RuntimeTemplate */
+
+const TYPES = new Set(["webassembly"]);
+
+class WebAssemblyJavascriptGenerator extends Generator {
+	/**
+	 * @param {NormalModule} module fresh module
+	 * @returns {Set<string>} available types (do not mutate)
+	 */
+	getTypes(module) {
+		return TYPES;
+	}
+
+	/**
+	 * @param {NormalModule} module the module
+	 * @param {string=} type source type
+	 * @returns {number} estimate size of the module
+	 */
+	getSize(module, type) {
+		return 95 + module.dependencies.length * 5;
+	}
+
+	/**
+	 * @param {NormalModule} module module for which the code should be generated
+	 * @param {GenerateContext} generateContext context for generate
+	 * @returns {Source} generated code
+	 */
+	generate(module, generateContext) {
+		const {
+			runtimeTemplate,
+			moduleGraph,
+			chunkGraph,
+			runtimeRequirements,
+			runtime
+		} = generateContext;
+		/** @type {InitFragment[]} */
+		const initFragments = [];
+
+		const exportsInfo = moduleGraph.getExportsInfo(module);
+
+		let needExportsCopy = false;
+		const importedModules = new Map();
+		const initParams = [];
+		let index = 0;
+		for (const dep of module.dependencies) {
+			const moduleDep =
+				dep && dep instanceof ModuleDependency ? dep : undefined;
+			if (moduleGraph.getModule(dep)) {
+				let importData = importedModules.get(moduleGraph.getModule(dep));
+				if (importData === undefined) {
+					importedModules.set(
+						moduleGraph.getModule(dep),
+						(importData = {
+							importVar: `m${index}`,
+							index,
+							request: (moduleDep && moduleDep.userRequest) || undefined,
+							names: new Set(),
+							reexports: []
+						})
+					);
+					index++;
+				}
+				if (dep instanceof WebAssemblyImportDependency) {
+					importData.names.add(dep.name);
+					if (dep.description.type === "GlobalType") {
+						const exportName = dep.name;
+						const importedModule = moduleGraph.getModule(dep);
+
+						if (importedModule) {
+							const usedName = moduleGraph
+								.getExportsInfo(importedModule)
+								.getUsedName(exportName, runtime);
+							if (usedName) {
+								initParams.push(
+									runtimeTemplate.exportFromImport({
+										moduleGraph,
+										module: importedModule,
+										request: dep.request,
+										importVar: importData.importVar,
+										originModule: module,
+										exportName: dep.name,
+										asiSafe: true,
+										isCall: false,
+										callContext: null,
+										defaultInterop: true,
+										initFragments,
+										runtime,
+										runtimeRequirements
+									})
+								);
+							}
+						}
+					}
+				}
+				if (dep instanceof WebAssemblyExportImportedDependency) {
+					importData.names.add(dep.name);
+					const usedName = moduleGraph
+						.getExportsInfo(module)
+						.getUsedName(dep.exportName, runtime);
+					if (usedName) {
+						runtimeRequirements.add(RuntimeGlobals.exports);
+						const exportProp = `${module.exportsArgument}[${JSON.stringify(
+							usedName
+						)}]`;
+						const defineStatement = Template.asString([
+							`${exportProp} = ${runtimeTemplate.exportFromImport({
+								moduleGraph,
+								module: moduleGraph.getModule(dep),
+								request: dep.request,
+								importVar: importData.importVar,
+								originModule: module,
+								exportName: dep.name,
+								asiSafe: true,
+								isCall: false,
+								callContext: null,
+								defaultInterop: true,
+								initFragments,
+								runtime,
+								runtimeRequirements
+							})};`,
+							`if(WebAssembly.Global) ${exportProp} = ` +
+								`new WebAssembly.Global({ value: ${JSON.stringify(
+									dep.valueType
+								)} }, ${exportProp});`
+						]);
+						importData.reexports.push(defineStatement);
+						needExportsCopy = true;
+					}
+				}
+			}
+		}
+		const importsCode = Template.asString(
+			Array.from(
+				importedModules,
+				([module, { importVar, request, reexports }]) => {
+					const importStatement = runtimeTemplate.importStatement({
+						module,
+						chunkGraph,
+						request,
+						importVar,
+						originModule: module,
+						runtimeRequirements
+					});
+					return importStatement[0] + importStatement[1] + reexports.join("\n");
+				}
+			)
+		);
+
+		const copyAllExports =
+			exportsInfo.otherExportsInfo.getUsed(runtime) === UsageState.Unused &&
+			!needExportsCopy;
+
+		// need these globals
+		runtimeRequirements.add(RuntimeGlobals.module);
+		runtimeRequirements.add(RuntimeGlobals.moduleId);
+		runtimeRequirements.add(RuntimeGlobals.wasmInstances);
+		if (exportsInfo.otherExportsInfo.getUsed(runtime) !== UsageState.Unused) {
+			runtimeRequirements.add(RuntimeGlobals.makeNamespaceObject);
+			runtimeRequirements.add(RuntimeGlobals.exports);
+		}
+		if (!copyAllExports) {
+			runtimeRequirements.add(RuntimeGlobals.exports);
+		}
+
+		// create source
+		const source = new RawSource(
+			[
+				'"use strict";',
+				"// Instantiate WebAssembly module",
+				`var wasmExports = ${RuntimeGlobals.wasmInstances}[${module.moduleArgument}.id];`,
+
+				exportsInfo.otherExportsInfo.getUsed(runtime) !== UsageState.Unused
+					? `${RuntimeGlobals.makeNamespaceObject}(${module.exportsArgument});`
+					: "",
+
+				// this must be before import for circular dependencies
+				"// export exports from WebAssembly module",
+				copyAllExports
+					? `${module.moduleArgument}.exports = wasmExports;`
+					: "for(var name in wasmExports) " +
+					  `if(name) ` +
+					  `${module.exportsArgument}[name] = wasmExports[name];`,
+				"// exec imports from WebAssembly module (for esm order)",
+				importsCode,
+				"",
+				"// exec wasm module",
+				`wasmExports[""](${initParams.join(", ")})`
+			].join("\n")
+		);
+		return InitFragment.addToSource(source, initFragments, generateContext);
+	}
+}
+
+module.exports = WebAssemblyJavascriptGenerator;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyModulesPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyModulesPlugin.js
new file mode 100644
index 0000000..0f2057a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyModulesPlugin.js
@@ -0,0 +1,142 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Generator = require("../Generator");
+const WebAssemblyExportImportedDependency = require("../dependencies/WebAssemblyExportImportedDependency");
+const WebAssemblyImportDependency = require("../dependencies/WebAssemblyImportDependency");
+const { compareModulesByIdentifier } = require("../util/comparators");
+const memoize = require("../util/memoize");
+const WebAssemblyInInitialChunkError = require("./WebAssemblyInInitialChunkError");
+
+/** @typedef {import("webpack-sources").Source} Source */
+/** @typedef {import("../Compiler")} Compiler */
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleTemplate")} ModuleTemplate */
+/** @typedef {import("../javascript/JavascriptModulesPlugin").RenderContext} RenderContext */
+
+const getWebAssemblyGenerator = memoize(() =>
+	require("./WebAssemblyGenerator")
+);
+const getWebAssemblyJavascriptGenerator = memoize(() =>
+	require("./WebAssemblyJavascriptGenerator")
+);
+const getWebAssemblyParser = memoize(() => require("./WebAssemblyParser"));
+
+class WebAssemblyModulesPlugin {
+	constructor(options) {
+		this.options = options;
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.compilation.tap(
+			"WebAssemblyModulesPlugin",
+			(compilation, { normalModuleFactory }) => {
+				compilation.dependencyFactories.set(
+					WebAssemblyImportDependency,
+					normalModuleFactory
+				);
+
+				compilation.dependencyFactories.set(
+					WebAssemblyExportImportedDependency,
+					normalModuleFactory
+				);
+
+				normalModuleFactory.hooks.createParser
+					.for("webassembly/sync")
+					.tap("WebAssemblyModulesPlugin", () => {
+						const WebAssemblyParser = getWebAssemblyParser();
+
+						return new WebAssemblyParser();
+					});
+
+				normalModuleFactory.hooks.createGenerator
+					.for("webassembly/sync")
+					.tap("WebAssemblyModulesPlugin", () => {
+						const WebAssemblyJavascriptGenerator =
+							getWebAssemblyJavascriptGenerator();
+						const WebAssemblyGenerator = getWebAssemblyGenerator();
+
+						return Generator.byType({
+							javascript: new WebAssemblyJavascriptGenerator(),
+							webassembly: new WebAssemblyGenerator(this.options)
+						});
+					});
+
+				compilation.hooks.renderManifest.tap(
+					"WebAssemblyModulesPlugin",
+					(result, options) => {
+						const { chunkGraph } = compilation;
+						const { chunk, outputOptions, codeGenerationResults } = options;
+
+						for (const module of chunkGraph.getOrderedChunkModulesIterable(
+							chunk,
+							compareModulesByIdentifier
+						)) {
+							if (module.type === "webassembly/sync") {
+								const filenameTemplate =
+									outputOptions.webassemblyModuleFilename;
+
+								result.push({
+									render: () =>
+										codeGenerationResults.getSource(
+											module,
+											chunk.runtime,
+											"webassembly"
+										),
+									filenameTemplate,
+									pathOptions: {
+										module,
+										runtime: chunk.runtime,
+										chunkGraph
+									},
+									auxiliary: true,
+									identifier: `webassemblyModule${chunkGraph.getModuleId(
+										module
+									)}`,
+									hash: chunkGraph.getModuleHash(module, chunk.runtime)
+								});
+							}
+						}
+
+						return result;
+					}
+				);
+
+				compilation.hooks.afterChunks.tap("WebAssemblyModulesPlugin", () => {
+					const chunkGraph = compilation.chunkGraph;
+					const initialWasmModules = new Set();
+					for (const chunk of compilation.chunks) {
+						if (chunk.canBeInitial()) {
+							for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
+								if (module.type === "webassembly/sync") {
+									initialWasmModules.add(module);
+								}
+							}
+						}
+					}
+					for (const module of initialWasmModules) {
+						compilation.errors.push(
+							new WebAssemblyInInitialChunkError(
+								module,
+								compilation.moduleGraph,
+								compilation.chunkGraph,
+								compilation.requestShortener
+							)
+						);
+					}
+				});
+			}
+		);
+	}
+}
+
+module.exports = WebAssemblyModulesPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyParser.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyParser.js
new file mode 100644
index 0000000..c3078cf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyParser.js
@@ -0,0 +1,192 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const t = require("@webassemblyjs/ast");
+const { moduleContextFromModuleAST } = require("@webassemblyjs/ast");
+const { decode } = require("@webassemblyjs/wasm-parser");
+const Parser = require("../Parser");
+const StaticExportsDependency = require("../dependencies/StaticExportsDependency");
+const WebAssemblyExportImportedDependency = require("../dependencies/WebAssemblyExportImportedDependency");
+const WebAssemblyImportDependency = require("../dependencies/WebAssemblyImportDependency");
+
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../Parser").ParserState} ParserState */
+/** @typedef {import("../Parser").PreparsedAst} PreparsedAst */
+
+const JS_COMPAT_TYPES = new Set(["i32", "f32", "f64"]);
+
+/**
+ * @param {t.Signature} signature the func signature
+ * @returns {null | string} the type incompatible with js types
+ */
+const getJsIncompatibleType = signature => {
+	for (const param of signature.params) {
+		if (!JS_COMPAT_TYPES.has(param.valtype)) {
+			return `${param.valtype} as parameter`;
+		}
+	}
+	for (const type of signature.results) {
+		if (!JS_COMPAT_TYPES.has(type)) return `${type} as result`;
+	}
+	return null;
+};
+
+/**
+ * TODO why are there two different Signature types?
+ * @param {t.FuncSignature} signature the func signature
+ * @returns {null | string} the type incompatible with js types
+ */
+const getJsIncompatibleTypeOfFuncSignature = signature => {
+	for (const param of signature.args) {
+		if (!JS_COMPAT_TYPES.has(param)) {
+			return `${param} as parameter`;
+		}
+	}
+	for (const type of signature.result) {
+		if (!JS_COMPAT_TYPES.has(type)) return `${type} as result`;
+	}
+	return null;
+};
+
+const decoderOpts = {
+	ignoreCodeSection: true,
+	ignoreDataSection: true,
+
+	// this will avoid having to lookup with identifiers in the ModuleContext
+	ignoreCustomNameSection: true
+};
+
+class WebAssemblyParser extends Parser {
+	constructor(options) {
+		super();
+		this.hooks = Object.freeze({});
+		this.options = options;
+	}
+
+	/**
+	 * @param {string | Buffer | PreparsedAst} source the source to parse
+	 * @param {ParserState} state the parser state
+	 * @returns {ParserState} the parser state
+	 */
+	parse(source, state) {
+		if (!Buffer.isBuffer(source)) {
+			throw new Error("WebAssemblyParser input must be a Buffer");
+		}
+
+		// flag it as ESM
+		state.module.buildInfo.strict = true;
+		state.module.buildMeta.exportsType = "namespace";
+
+		// parse it
+		const program = decode(source, decoderOpts);
+		const module = program.body[0];
+
+		const moduleContext = moduleContextFromModuleAST(module);
+
+		// extract imports and exports
+		const exports = [];
+		let jsIncompatibleExports = (state.module.buildMeta.jsIncompatibleExports =
+			undefined);
+
+		const importedGlobals = [];
+		t.traverse(module, {
+			ModuleExport({ node }) {
+				const descriptor = node.descr;
+
+				if (descriptor.exportType === "Func") {
+					const funcIdx = descriptor.id.value;
+
+					/** @type {t.FuncSignature} */
+					const funcSignature = moduleContext.getFunction(funcIdx);
+
+					const incompatibleType =
+						getJsIncompatibleTypeOfFuncSignature(funcSignature);
+
+					if (incompatibleType) {
+						if (jsIncompatibleExports === undefined) {
+							jsIncompatibleExports =
+								state.module.buildMeta.jsIncompatibleExports = {};
+						}
+						jsIncompatibleExports[node.name] = incompatibleType;
+					}
+				}
+
+				exports.push(node.name);
+
+				if (node.descr && node.descr.exportType === "Global") {
+					const refNode = importedGlobals[node.descr.id.value];
+					if (refNode) {
+						const dep = new WebAssemblyExportImportedDependency(
+							node.name,
+							refNode.module,
+							refNode.name,
+							refNode.descr.valtype
+						);
+
+						state.module.addDependency(dep);
+					}
+				}
+			},
+
+			Global({ node }) {
+				const init = node.init[0];
+
+				let importNode = null;
+
+				if (init.id === "get_global") {
+					const globalIdx = init.args[0].value;
+
+					if (globalIdx < importedGlobals.length) {
+						importNode = importedGlobals[globalIdx];
+					}
+				}
+
+				importedGlobals.push(importNode);
+			},
+
+			ModuleImport({ node }) {
+				/** @type {false | string} */
+				let onlyDirectImport = false;
+
+				if (t.isMemory(node.descr) === true) {
+					onlyDirectImport = "Memory";
+				} else if (t.isTable(node.descr) === true) {
+					onlyDirectImport = "Table";
+				} else if (t.isFuncImportDescr(node.descr) === true) {
+					const incompatibleType = getJsIncompatibleType(node.descr.signature);
+					if (incompatibleType) {
+						onlyDirectImport = `Non-JS-compatible Func Signature (${incompatibleType})`;
+					}
+				} else if (t.isGlobalType(node.descr) === true) {
+					const type = node.descr.valtype;
+					if (!JS_COMPAT_TYPES.has(type)) {
+						onlyDirectImport = `Non-JS-compatible Global Type (${type})`;
+					}
+				}
+
+				const dep = new WebAssemblyImportDependency(
+					node.module,
+					node.name,
+					node.descr,
+					onlyDirectImport
+				);
+
+				state.module.addDependency(dep);
+
+				if (t.isGlobalType(node.descr)) {
+					importedGlobals.push(node);
+				}
+			}
+		});
+
+		state.module.addDependency(new StaticExportsDependency(exports, false));
+
+		return state;
+	}
+}
+
+module.exports = WebAssemblyParser;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyUtils.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyUtils.js
new file mode 100644
index 0000000..fd00b2f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm-sync/WebAssemblyUtils.js
@@ -0,0 +1,65 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const Template = require("../Template");
+const WebAssemblyImportDependency = require("../dependencies/WebAssemblyImportDependency");
+
+/** @typedef {import("../Module")} Module */
+/** @typedef {import("../ModuleGraph")} ModuleGraph */
+
+/** @typedef {Object} UsedWasmDependency
+ * @property {WebAssemblyImportDependency} dependency the dependency
+ * @property {string} name the export name
+ * @property {string} module the module name
+ */
+
+const MANGLED_MODULE = "a";
+
+/**
+ * @param {ModuleGraph} moduleGraph the module graph
+ * @param {Module} module the module
+ * @param {boolean} mangle mangle module and export names
+ * @returns {UsedWasmDependency[]} used dependencies and (mangled) name
+ */
+const getUsedDependencies = (moduleGraph, module, mangle) => {
+	/** @type {UsedWasmDependency[]} */
+	const array = [];
+	let importIndex = 0;
+	for (const dep of module.dependencies) {
+		if (dep instanceof WebAssemblyImportDependency) {
+			if (
+				dep.description.type === "GlobalType" ||
+				moduleGraph.getModule(dep) === null
+			) {
+				continue;
+			}
+
+			const exportName = dep.name;
+			// TODO add the following 3 lines when removing of ModuleExport is possible
+			// const importedModule = moduleGraph.getModule(dep);
+			// const usedName = importedModule && moduleGraph.getExportsInfo(importedModule).getUsedName(exportName, runtime);
+			// if (usedName !== false) {
+			if (mangle) {
+				array.push({
+					dependency: dep,
+					name: Template.numberToIdentifier(importIndex++),
+					module: MANGLED_MODULE
+				});
+			} else {
+				array.push({
+					dependency: dep,
+					name: exportName,
+					module: dep.request
+				});
+			}
+		}
+	}
+	return array;
+};
+
+exports.getUsedDependencies = getUsedDependencies;
+exports.MANGLED_MODULE = MANGLED_MODULE;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/wasm/EnableWasmLoadingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm/EnableWasmLoadingPlugin.js
new file mode 100644
index 0000000..9f4d1de
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/wasm/EnableWasmLoadingPlugin.js
@@ -0,0 +1,118 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+/** @typedef {import("../../declarations/WebpackOptions").LibraryOptions} LibraryOptions */
+/** @typedef {import("../../declarations/WebpackOptions").WasmLoadingType} WasmLoadingType */
+/** @typedef {import("../Compiler")} Compiler */
+
+/** @type {WeakMap<Compiler, Set<WasmLoadingType>>} */
+const enabledTypes = new WeakMap();
+
+const getEnabledTypes = compiler => {
+	let set = enabledTypes.get(compiler);
+	if (set === undefined) {
+		set = new Set();
+		enabledTypes.set(compiler, set);
+	}
+	return set;
+};
+
+class EnableWasmLoadingPlugin {
+	/**
+	 * @param {WasmLoadingType} type library type that should be available
+	 */
+	constructor(type) {
+		this.type = type;
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler instance
+	 * @param {WasmLoadingType} type type of library
+	 * @returns {void}
+	 */
+	static setEnabled(compiler, type) {
+		getEnabledTypes(compiler).add(type);
+	}
+
+	/**
+	 * @param {Compiler} compiler the compiler instance
+	 * @param {WasmLoadingType} type type of library
+	 * @returns {void}
+	 */
+	static checkEnabled(compiler, type) {
+		if (!getEnabledTypes(compiler).has(type)) {
+			throw new Error(
+				`Library type "${type}" is not enabled. ` +
+					"EnableWasmLoadingPlugin need to be used to enable this type of wasm loading. " +
+					'This usually happens through the "output.enabledWasmLoadingTypes" option. ' +
+					'If you are using a function as entry which sets "wasmLoading", you need to add all potential library types to "output.enabledWasmLoadingTypes". ' +
+					"These types are enabled: " +
+					Array.from(getEnabledTypes(compiler)).join(", ")
+			);
+		}
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		const { type } = this;
+
+		// Only enable once
+		const enabled = getEnabledTypes(compiler);
+		if (enabled.has(type)) return;
+		enabled.add(type);
+
+		if (typeof type === "string") {
+			switch (type) {
+				case "fetch": {
+					// TODO webpack 6 remove FetchCompileWasmPlugin
+					const FetchCompileWasmPlugin = require("../web/FetchCompileWasmPlugin");
+					const FetchCompileAsyncWasmPlugin = require("../web/FetchCompileAsyncWasmPlugin");
+					new FetchCompileWasmPlugin({
+						mangleImports: compiler.options.optimization.mangleWasmImports
+					}).apply(compiler);
+					new FetchCompileAsyncWasmPlugin().apply(compiler);
+					break;
+				}
+				case "async-node": {
+					// TODO webpack 6 remove ReadFileCompileWasmPlugin
+					const ReadFileCompileWasmPlugin = require("../node/ReadFileCompileWasmPlugin");
+					// @ts-expect-error typescript bug for duplicate require
+					const ReadFileCompileAsyncWasmPlugin = require("../node/ReadFileCompileAsyncWasmPlugin");
+					new ReadFileCompileWasmPlugin({
+						mangleImports: compiler.options.optimization.mangleWasmImports
+					}).apply(compiler);
+					new ReadFileCompileAsyncWasmPlugin({ type }).apply(compiler);
+					break;
+				}
+				case "async-node-module": {
+					// @ts-expect-error typescript bug for duplicate require
+					const ReadFileCompileAsyncWasmPlugin = require("../node/ReadFileCompileAsyncWasmPlugin");
+					new ReadFileCompileAsyncWasmPlugin({ type, import: true }).apply(
+						compiler
+					);
+					break;
+				}
+				case "universal":
+					throw new Error(
+						"Universal WebAssembly Loading is not implemented yet"
+					);
+				default:
+					throw new Error(`Unsupported wasm loading type ${type}.
+Plugins which provide custom wasm loading types must call EnableWasmLoadingPlugin.setEnabled(compiler, type) to disable this error.`);
+			}
+		} else {
+			// TODO support plugin instances here
+			// apply them to the compiler
+		}
+	}
+}
+
+module.exports = EnableWasmLoadingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/web/FetchCompileAsyncWasmPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/web/FetchCompileAsyncWasmPlugin.js
new file mode 100644
index 0000000..00ca8dd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/web/FetchCompileAsyncWasmPlugin.js
@@ -0,0 +1,62 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const AsyncWasmLoadingRuntimeModule = require("../wasm-async/AsyncWasmLoadingRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class FetchCompileAsyncWasmPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"FetchCompileAsyncWasmPlugin",
+			compilation => {
+				const globalWasmLoading = compilation.outputOptions.wasmLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const wasmLoading =
+						options && options.wasmLoading !== undefined
+							? options.wasmLoading
+							: globalWasmLoading;
+					return wasmLoading === "fetch";
+				};
+				const generateLoadBinaryCode = path =>
+					`fetch(${RuntimeGlobals.publicPath} + ${path})`;
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.instantiateWasm)
+					.tap("FetchCompileAsyncWasmPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						const chunkGraph = compilation.chunkGraph;
+						if (
+							!chunkGraph.hasModuleInGraph(
+								chunk,
+								m => m.type === "webassembly/async"
+							)
+						) {
+							return;
+						}
+						set.add(RuntimeGlobals.publicPath);
+						compilation.addRuntimeModule(
+							chunk,
+							new AsyncWasmLoadingRuntimeModule({
+								generateLoadBinaryCode,
+								supportsStreaming: true
+							})
+						);
+					});
+			}
+		);
+	}
+}
+
+module.exports = FetchCompileAsyncWasmPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/web/FetchCompileWasmPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/web/FetchCompileWasmPlugin.js
new file mode 100644
index 0000000..9ee176f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/web/FetchCompileWasmPlugin.js
@@ -0,0 +1,71 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const WasmChunkLoadingRuntimeModule = require("../wasm-sync/WasmChunkLoadingRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+// TODO webpack 6 remove
+
+class FetchCompileWasmPlugin {
+	constructor(options) {
+		this.options = options || {};
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"FetchCompileWasmPlugin",
+			compilation => {
+				const globalWasmLoading = compilation.outputOptions.wasmLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const wasmLoading =
+						options && options.wasmLoading !== undefined
+							? options.wasmLoading
+							: globalWasmLoading;
+					return wasmLoading === "fetch";
+				};
+				const generateLoadBinaryCode = path =>
+					`fetch(${RuntimeGlobals.publicPath} + ${path})`;
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("FetchCompileWasmPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						const chunkGraph = compilation.chunkGraph;
+						if (
+							!chunkGraph.hasModuleInGraph(
+								chunk,
+								m => m.type === "webassembly/sync"
+							)
+						) {
+							return;
+						}
+						set.add(RuntimeGlobals.moduleCache);
+						set.add(RuntimeGlobals.publicPath);
+						compilation.addRuntimeModule(
+							chunk,
+							new WasmChunkLoadingRuntimeModule({
+								generateLoadBinaryCode,
+								supportsStreaming: true,
+								mangleImports: this.options.mangleImports,
+								runtimeRequirements: set
+							})
+						);
+					});
+			}
+		);
+	}
+}
+
+module.exports = FetchCompileWasmPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpChunkLoadingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpChunkLoadingPlugin.js
new file mode 100644
index 0000000..34f0cc7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpChunkLoadingPlugin.js
@@ -0,0 +1,91 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const JsonpChunkLoadingRuntimeModule = require("./JsonpChunkLoadingRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class JsonpChunkLoadingPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.hooks.thisCompilation.tap(
+			"JsonpChunkLoadingPlugin",
+			compilation => {
+				const globalChunkLoading = compilation.outputOptions.chunkLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const chunkLoading =
+						options && options.chunkLoading !== undefined
+							? options.chunkLoading
+							: globalChunkLoading;
+					return chunkLoading === "jsonp";
+				};
+				const onceForChunkSet = new WeakSet();
+				const handler = (chunk, set) => {
+					if (onceForChunkSet.has(chunk)) return;
+					onceForChunkSet.add(chunk);
+					if (!isEnabledForChunk(chunk)) return;
+					set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					set.add(RuntimeGlobals.hasOwnProperty);
+					compilation.addRuntimeModule(
+						chunk,
+						new JsonpChunkLoadingRuntimeModule(set)
+					);
+				};
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("JsonpChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadUpdateHandlers)
+					.tap("JsonpChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadManifest)
+					.tap("JsonpChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.baseURI)
+					.tap("JsonpChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.onChunksLoaded)
+					.tap("JsonpChunkLoadingPlugin", handler);
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("JsonpChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.publicPath);
+						set.add(RuntimeGlobals.loadScript);
+						set.add(RuntimeGlobals.getChunkScriptFilename);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadUpdateHandlers)
+					.tap("JsonpChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.publicPath);
+						set.add(RuntimeGlobals.loadScript);
+						set.add(RuntimeGlobals.getChunkUpdateScriptFilename);
+						set.add(RuntimeGlobals.moduleCache);
+						set.add(RuntimeGlobals.hmrModuleData);
+						set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadManifest)
+					.tap("JsonpChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.publicPath);
+						set.add(RuntimeGlobals.getUpdateManifestFilename);
+					});
+			}
+		);
+	}
+}
+
+module.exports = JsonpChunkLoadingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpChunkLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpChunkLoadingRuntimeModule.js
new file mode 100644
index 0000000..972d1e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpChunkLoadingRuntimeModule.js
@@ -0,0 +1,450 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const { SyncWaterfallHook } = require("tapable");
+const Compilation = require("../Compilation");
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const chunkHasJs = require("../javascript/JavascriptModulesPlugin").chunkHasJs;
+const { getInitialChunkIds } = require("../javascript/StartupHelpers");
+const compileBooleanMatcher = require("../util/compileBooleanMatcher");
+
+/** @typedef {import("../Chunk")} Chunk */
+
+/**
+ * @typedef {Object} JsonpCompilationPluginHooks
+ * @property {SyncWaterfallHook<[string, Chunk]>} linkPreload
+ * @property {SyncWaterfallHook<[string, Chunk]>} linkPrefetch
+ */
+
+/** @type {WeakMap<Compilation, JsonpCompilationPluginHooks>} */
+const compilationHooksMap = new WeakMap();
+
+class JsonpChunkLoadingRuntimeModule extends RuntimeModule {
+	/**
+	 * @param {Compilation} compilation the compilation
+	 * @returns {JsonpCompilationPluginHooks} hooks
+	 */
+	static getCompilationHooks(compilation) {
+		if (!(compilation instanceof Compilation)) {
+			throw new TypeError(
+				"The 'compilation' argument must be an instance of Compilation"
+			);
+		}
+		let hooks = compilationHooksMap.get(compilation);
+		if (hooks === undefined) {
+			hooks = {
+				linkPreload: new SyncWaterfallHook(["source", "chunk"]),
+				linkPrefetch: new SyncWaterfallHook(["source", "chunk"])
+			};
+			compilationHooksMap.set(compilation, hooks);
+		}
+		return hooks;
+	}
+
+	constructor(runtimeRequirements) {
+		super("jsonp chunk loading", RuntimeModule.STAGE_ATTACH);
+		this._runtimeRequirements = runtimeRequirements;
+	}
+
+	/**
+	 * @private
+	 * @param {Chunk} chunk chunk
+	 * @returns {string} generated code
+	 */
+	_generateBaseUri(chunk) {
+		const options = chunk.getEntryOptions();
+		if (options && options.baseUri) {
+			return `${RuntimeGlobals.baseURI} = ${JSON.stringify(options.baseUri)};`;
+		} else {
+			return `${RuntimeGlobals.baseURI} = document.baseURI || self.location.href;`;
+		}
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const { chunkGraph, compilation, chunk } = this;
+		const {
+			runtimeTemplate,
+			outputOptions: {
+				chunkLoadingGlobal,
+				hotUpdateGlobal,
+				crossOriginLoading,
+				scriptType
+			}
+		} = compilation;
+		const globalObject = runtimeTemplate.globalObject;
+		const { linkPreload, linkPrefetch } =
+			JsonpChunkLoadingRuntimeModule.getCompilationHooks(compilation);
+		const fn = RuntimeGlobals.ensureChunkHandlers;
+		const withBaseURI = this._runtimeRequirements.has(RuntimeGlobals.baseURI);
+		const withLoading = this._runtimeRequirements.has(
+			RuntimeGlobals.ensureChunkHandlers
+		);
+		const withCallback = this._runtimeRequirements.has(
+			RuntimeGlobals.chunkCallback
+		);
+		const withOnChunkLoad = this._runtimeRequirements.has(
+			RuntimeGlobals.onChunksLoaded
+		);
+		const withHmr = this._runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadUpdateHandlers
+		);
+		const withHmrManifest = this._runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadManifest
+		);
+		const withPrefetch = this._runtimeRequirements.has(
+			RuntimeGlobals.prefetchChunkHandlers
+		);
+		const withPreload = this._runtimeRequirements.has(
+			RuntimeGlobals.preloadChunkHandlers
+		);
+		const chunkLoadingGlobalExpr = `${globalObject}[${JSON.stringify(
+			chunkLoadingGlobal
+		)}]`;
+		const conditionMap = chunkGraph.getChunkConditionMap(chunk, chunkHasJs);
+		const hasJsMatcher = compileBooleanMatcher(conditionMap);
+		const initialChunkIds = getInitialChunkIds(chunk, chunkGraph, chunkHasJs);
+
+		const stateExpression = withHmr
+			? `${RuntimeGlobals.hmrRuntimeStatePrefix}_jsonp`
+			: undefined;
+
+		return Template.asString([
+			withBaseURI ? this._generateBaseUri(chunk) : "// no baseURI",
+			"",
+			"// object to store loaded and loading chunks",
+			"// undefined = chunk not loaded, null = chunk preloaded/prefetched",
+			"// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded",
+			`var installedChunks = ${
+				stateExpression ? `${stateExpression} = ${stateExpression} || ` : ""
+			}{`,
+			Template.indent(
+				Array.from(initialChunkIds, id => `${JSON.stringify(id)}: 0`).join(
+					",\n"
+				)
+			),
+			"};",
+			"",
+			withLoading
+				? Template.asString([
+						`${fn}.j = ${runtimeTemplate.basicFunction(
+							"chunkId, promises",
+							hasJsMatcher !== false
+								? Template.indent([
+										"// JSONP chunk loading for javascript",
+										`var installedChunkData = ${RuntimeGlobals.hasOwnProperty}(installedChunks, chunkId) ? installedChunks[chunkId] : undefined;`,
+										'if(installedChunkData !== 0) { // 0 means "already installed".',
+										Template.indent([
+											"",
+											'// a Promise means "currently loading".',
+											"if(installedChunkData) {",
+											Template.indent([
+												"promises.push(installedChunkData[2]);"
+											]),
+											"} else {",
+											Template.indent([
+												hasJsMatcher === true
+													? "if(true) { // all chunks have JS"
+													: `if(${hasJsMatcher("chunkId")}) {`,
+												Template.indent([
+													"// setup Promise in chunk cache",
+													`var promise = new Promise(${runtimeTemplate.expressionFunction(
+														`installedChunkData = installedChunks[chunkId] = [resolve, reject]`,
+														"resolve, reject"
+													)});`,
+													"promises.push(installedChunkData[2] = promise);",
+													"",
+													"// start chunk loading",
+													`var url = ${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkScriptFilename}(chunkId);`,
+													"// create error before stack unwound to get useful stacktrace later",
+													"var error = new Error();",
+													`var loadingEnded = ${runtimeTemplate.basicFunction(
+														"event",
+														[
+															`if(${RuntimeGlobals.hasOwnProperty}(installedChunks, chunkId)) {`,
+															Template.indent([
+																"installedChunkData = installedChunks[chunkId];",
+																"if(installedChunkData !== 0) installedChunks[chunkId] = undefined;",
+																"if(installedChunkData) {",
+																Template.indent([
+																	"var errorType = event && (event.type === 'load' ? 'missing' : event.type);",
+																	"var realSrc = event && event.target && event.target.src;",
+																	"error.message = 'Loading chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';",
+																	"error.name = 'ChunkLoadError';",
+																	"error.type = errorType;",
+																	"error.request = realSrc;",
+																	"installedChunkData[1](error);"
+																]),
+																"}"
+															]),
+															"}"
+														]
+													)};`,
+													`${RuntimeGlobals.loadScript}(url, loadingEnded, "chunk-" + chunkId, chunkId);`
+												]),
+												"} else installedChunks[chunkId] = 0;"
+											]),
+											"}"
+										]),
+										"}"
+								  ])
+								: Template.indent(["installedChunks[chunkId] = 0;"])
+						)};`
+				  ])
+				: "// no chunk on demand loading",
+			"",
+			withPrefetch && hasJsMatcher !== false
+				? `${
+						RuntimeGlobals.prefetchChunkHandlers
+				  }.j = ${runtimeTemplate.basicFunction("chunkId", [
+						`if((!${
+							RuntimeGlobals.hasOwnProperty
+						}(installedChunks, chunkId) || installedChunks[chunkId] === undefined) && ${
+							hasJsMatcher === true ? "true" : hasJsMatcher("chunkId")
+						}) {`,
+						Template.indent([
+							"installedChunks[chunkId] = null;",
+							linkPrefetch.call(
+								Template.asString([
+									"var link = document.createElement('link');",
+									crossOriginLoading
+										? `link.crossOrigin = ${JSON.stringify(
+												crossOriginLoading
+										  )};`
+										: "",
+									`if (${RuntimeGlobals.scriptNonce}) {`,
+									Template.indent(
+										`link.setAttribute("nonce", ${RuntimeGlobals.scriptNonce});`
+									),
+									"}",
+									'link.rel = "prefetch";',
+									'link.as = "script";',
+									`link.href = ${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkScriptFilename}(chunkId);`
+								]),
+								chunk
+							),
+							"document.head.appendChild(link);"
+						]),
+						"}"
+				  ])};`
+				: "// no prefetching",
+			"",
+			withPreload && hasJsMatcher !== false
+				? `${
+						RuntimeGlobals.preloadChunkHandlers
+				  }.j = ${runtimeTemplate.basicFunction("chunkId", [
+						`if((!${
+							RuntimeGlobals.hasOwnProperty
+						}(installedChunks, chunkId) || installedChunks[chunkId] === undefined) && ${
+							hasJsMatcher === true ? "true" : hasJsMatcher("chunkId")
+						}) {`,
+						Template.indent([
+							"installedChunks[chunkId] = null;",
+							linkPreload.call(
+								Template.asString([
+									"var link = document.createElement('link');",
+									scriptType
+										? `link.type = ${JSON.stringify(scriptType)};`
+										: "",
+									"link.charset = 'utf-8';",
+									`if (${RuntimeGlobals.scriptNonce}) {`,
+									Template.indent(
+										`link.setAttribute("nonce", ${RuntimeGlobals.scriptNonce});`
+									),
+									"}",
+									'link.rel = "preload";',
+									'link.as = "script";',
+									`link.href = ${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkScriptFilename}(chunkId);`,
+									crossOriginLoading
+										? Template.asString([
+												"if (link.href.indexOf(window.location.origin + '/') !== 0) {",
+												Template.indent(
+													`link.crossOrigin = ${JSON.stringify(
+														crossOriginLoading
+													)};`
+												),
+												"}"
+										  ])
+										: ""
+								]),
+								chunk
+							),
+							"document.head.appendChild(link);"
+						]),
+						"}"
+				  ])};`
+				: "// no preloaded",
+			"",
+			withHmr
+				? Template.asString([
+						"var currentUpdatedModulesList;",
+						"var waitingUpdateResolves = {};",
+						"function loadUpdateChunk(chunkId) {",
+						Template.indent([
+							`return new Promise(${runtimeTemplate.basicFunction(
+								"resolve, reject",
+								[
+									"waitingUpdateResolves[chunkId] = resolve;",
+									"// start update chunk loading",
+									`var url = ${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkUpdateScriptFilename}(chunkId);`,
+									"// create error before stack unwound to get useful stacktrace later",
+									"var error = new Error();",
+									`var loadingEnded = ${runtimeTemplate.basicFunction("event", [
+										"if(waitingUpdateResolves[chunkId]) {",
+										Template.indent([
+											"waitingUpdateResolves[chunkId] = undefined",
+											"var errorType = event && (event.type === 'load' ? 'missing' : event.type);",
+											"var realSrc = event && event.target && event.target.src;",
+											"error.message = 'Loading hot update chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';",
+											"error.name = 'ChunkLoadError';",
+											"error.type = errorType;",
+											"error.request = realSrc;",
+											"reject(error);"
+										]),
+										"}"
+									])};`,
+									`${RuntimeGlobals.loadScript}(url, loadingEnded);`
+								]
+							)});`
+						]),
+						"}",
+						"",
+						`${globalObject}[${JSON.stringify(
+							hotUpdateGlobal
+						)}] = ${runtimeTemplate.basicFunction(
+							"chunkId, moreModules, runtime",
+							[
+								"for(var moduleId in moreModules) {",
+								Template.indent([
+									`if(${RuntimeGlobals.hasOwnProperty}(moreModules, moduleId)) {`,
+									Template.indent([
+										"currentUpdate[moduleId] = moreModules[moduleId];",
+										"if(currentUpdatedModulesList) currentUpdatedModulesList.push(moduleId);"
+									]),
+									"}"
+								]),
+								"}",
+								"if(runtime) currentUpdateRuntime.push(runtime);",
+								"if(waitingUpdateResolves[chunkId]) {",
+								Template.indent([
+									"waitingUpdateResolves[chunkId]();",
+									"waitingUpdateResolves[chunkId] = undefined;"
+								]),
+								"}"
+							]
+						)};`,
+						"",
+						Template.getFunctionContent(
+							require("../hmr/JavascriptHotModuleReplacement.runtime.js")
+						)
+							.replace(/\$key\$/g, "jsonp")
+							.replace(/\$installedChunks\$/g, "installedChunks")
+							.replace(/\$loadUpdateChunk\$/g, "loadUpdateChunk")
+							.replace(/\$moduleCache\$/g, RuntimeGlobals.moduleCache)
+							.replace(/\$moduleFactories\$/g, RuntimeGlobals.moduleFactories)
+							.replace(
+								/\$ensureChunkHandlers\$/g,
+								RuntimeGlobals.ensureChunkHandlers
+							)
+							.replace(/\$hasOwnProperty\$/g, RuntimeGlobals.hasOwnProperty)
+							.replace(/\$hmrModuleData\$/g, RuntimeGlobals.hmrModuleData)
+							.replace(
+								/\$hmrDownloadUpdateHandlers\$/g,
+								RuntimeGlobals.hmrDownloadUpdateHandlers
+							)
+							.replace(
+								/\$hmrInvalidateModuleHandlers\$/g,
+								RuntimeGlobals.hmrInvalidateModuleHandlers
+							)
+				  ])
+				: "// no HMR",
+			"",
+			withHmrManifest
+				? Template.asString([
+						`${
+							RuntimeGlobals.hmrDownloadManifest
+						} = ${runtimeTemplate.basicFunction("", [
+							'if (typeof fetch === "undefined") throw new Error("No browser support: need fetch API");',
+							`return fetch(${RuntimeGlobals.publicPath} + ${
+								RuntimeGlobals.getUpdateManifestFilename
+							}()).then(${runtimeTemplate.basicFunction("response", [
+								"if(response.status === 404) return; // no update available",
+								'if(!response.ok) throw new Error("Failed to fetch update manifest " + response.statusText);',
+								"return response.json();"
+							])});`
+						])};`
+				  ])
+				: "// no HMR manifest",
+			"",
+			withOnChunkLoad
+				? `${
+						RuntimeGlobals.onChunksLoaded
+				  }.j = ${runtimeTemplate.returningFunction(
+						"installedChunks[chunkId] === 0",
+						"chunkId"
+				  )};`
+				: "// no on chunks loaded",
+			"",
+			withCallback || withLoading
+				? Template.asString([
+						"// install a JSONP callback for chunk loading",
+						`var webpackJsonpCallback = ${runtimeTemplate.basicFunction(
+							"parentChunkLoadingFunction, data",
+							[
+								runtimeTemplate.destructureArray(
+									["chunkIds", "moreModules", "runtime"],
+									"data"
+								),
+								'// add "moreModules" to the modules object,',
+								'// then flag all "chunkIds" as loaded and fire callback',
+								"var moduleId, chunkId, i = 0;",
+								`if(chunkIds.some(${runtimeTemplate.returningFunction(
+									"installedChunks[id] !== 0",
+									"id"
+								)})) {`,
+								Template.indent([
+									"for(moduleId in moreModules) {",
+									Template.indent([
+										`if(${RuntimeGlobals.hasOwnProperty}(moreModules, moduleId)) {`,
+										Template.indent(
+											`${RuntimeGlobals.moduleFactories}[moduleId] = moreModules[moduleId];`
+										),
+										"}"
+									]),
+									"}",
+									"if(runtime) var result = runtime(__webpack_require__);"
+								]),
+								"}",
+								"if(parentChunkLoadingFunction) parentChunkLoadingFunction(data);",
+								"for(;i < chunkIds.length; i++) {",
+								Template.indent([
+									"chunkId = chunkIds[i];",
+									`if(${RuntimeGlobals.hasOwnProperty}(installedChunks, chunkId) && installedChunks[chunkId]) {`,
+									Template.indent("installedChunks[chunkId][0]();"),
+									"}",
+									"installedChunks[chunkId] = 0;"
+								]),
+								"}",
+								withOnChunkLoad
+									? `return ${RuntimeGlobals.onChunksLoaded}(result);`
+									: ""
+							]
+						)}`,
+						"",
+						`var chunkLoadingGlobal = ${chunkLoadingGlobalExpr} = ${chunkLoadingGlobalExpr} || [];`,
+						"chunkLoadingGlobal.forEach(webpackJsonpCallback.bind(null, 0));",
+						"chunkLoadingGlobal.push = webpackJsonpCallback.bind(null, chunkLoadingGlobal.push.bind(chunkLoadingGlobal));"
+				  ])
+				: "// no jsonp function"
+		]);
+	}
+}
+
+module.exports = JsonpChunkLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpTemplatePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpTemplatePlugin.js
new file mode 100644
index 0000000..eeed68a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/web/JsonpTemplatePlugin.js
@@ -0,0 +1,38 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ArrayPushCallbackChunkFormatPlugin = require("../javascript/ArrayPushCallbackChunkFormatPlugin");
+const EnableChunkLoadingPlugin = require("../javascript/EnableChunkLoadingPlugin");
+const JsonpChunkLoadingRuntimeModule = require("./JsonpChunkLoadingRuntimeModule");
+
+/** @typedef {import("../Chunk")} Chunk */
+/** @typedef {import("../Compilation")} Compilation */
+/** @typedef {import("../Compiler")} Compiler */
+
+class JsonpTemplatePlugin {
+	/**
+	 * @deprecated use JsonpChunkLoadingRuntimeModule.getCompilationHooks instead
+	 * @param {Compilation} compilation the compilation
+	 * @returns {JsonpChunkLoadingRuntimeModule.JsonpCompilationPluginHooks} hooks
+	 */
+	static getCompilationHooks(compilation) {
+		return JsonpChunkLoadingRuntimeModule.getCompilationHooks(compilation);
+	}
+
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.options.output.chunkLoading = "jsonp";
+		new ArrayPushCallbackChunkFormatPlugin().apply(compiler);
+		new EnableChunkLoadingPlugin("jsonp").apply(compiler);
+	}
+}
+
+module.exports = JsonpTemplatePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/webpack.js b/node_modules/mathjs/examples/node_modules/webpack/lib/webpack.js
new file mode 100644
index 0000000..a31bf2d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/webpack.js
@@ -0,0 +1,171 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const util = require("util");
+const webpackOptionsSchemaCheck = require("../schemas/WebpackOptions.check.js");
+const webpackOptionsSchema = require("../schemas/WebpackOptions.json");
+const Compiler = require("./Compiler");
+const MultiCompiler = require("./MultiCompiler");
+const WebpackOptionsApply = require("./WebpackOptionsApply");
+const {
+	applyWebpackOptionsDefaults,
+	applyWebpackOptionsBaseDefaults
+} = require("./config/defaults");
+const { getNormalizedWebpackOptions } = require("./config/normalization");
+const NodeEnvironmentPlugin = require("./node/NodeEnvironmentPlugin");
+const memoize = require("./util/memoize");
+
+/** @typedef {import("../declarations/WebpackOptions").WebpackOptions} WebpackOptions */
+/** @typedef {import("./Compiler").WatchOptions} WatchOptions */
+/** @typedef {import("./MultiCompiler").MultiCompilerOptions} MultiCompilerOptions */
+/** @typedef {import("./MultiStats")} MultiStats */
+/** @typedef {import("./Stats")} Stats */
+
+const getValidateSchema = memoize(() => require("./validateSchema"));
+
+/**
+ * @template T
+ * @callback Callback
+ * @param {Error=} err
+ * @param {T=} stats
+ * @returns {void}
+ */
+
+/**
+ * @param {ReadonlyArray<WebpackOptions>} childOptions options array
+ * @param {MultiCompilerOptions} options options
+ * @returns {MultiCompiler} a multi-compiler
+ */
+const createMultiCompiler = (childOptions, options) => {
+	const compilers = childOptions.map(options => createCompiler(options));
+	const compiler = new MultiCompiler(compilers, options);
+	for (const childCompiler of compilers) {
+		if (childCompiler.options.dependencies) {
+			compiler.setDependencies(
+				childCompiler,
+				childCompiler.options.dependencies
+			);
+		}
+	}
+	return compiler;
+};
+
+/**
+ * @param {WebpackOptions} rawOptions options object
+ * @returns {Compiler} a compiler
+ */
+const createCompiler = rawOptions => {
+	const options = getNormalizedWebpackOptions(rawOptions);
+	applyWebpackOptionsBaseDefaults(options);
+	const compiler = new Compiler(options.context, options);
+	new NodeEnvironmentPlugin({
+		infrastructureLogging: options.infrastructureLogging
+	}).apply(compiler);
+	if (Array.isArray(options.plugins)) {
+		for (const plugin of options.plugins) {
+			if (typeof plugin === "function") {
+				plugin.call(compiler, compiler);
+			} else {
+				plugin.apply(compiler);
+			}
+		}
+	}
+	applyWebpackOptionsDefaults(options);
+	compiler.hooks.environment.call();
+	compiler.hooks.afterEnvironment.call();
+	new WebpackOptionsApply().process(options, compiler);
+	compiler.hooks.initialize.call();
+	return compiler;
+};
+
+/**
+ * @callback WebpackFunctionSingle
+ * @param {WebpackOptions} options options object
+ * @param {Callback<Stats>=} callback callback
+ * @returns {Compiler} the compiler object
+ */
+
+/**
+ * @callback WebpackFunctionMulti
+ * @param {ReadonlyArray<WebpackOptions> & MultiCompilerOptions} options options objects
+ * @param {Callback<MultiStats>=} callback callback
+ * @returns {MultiCompiler} the multi compiler object
+ */
+
+const asArray = options =>
+	Array.isArray(options) ? Array.from(options) : [options];
+
+const webpack = /** @type {WebpackFunctionSingle & WebpackFunctionMulti} */ (
+	/**
+	 * @param {WebpackOptions | (ReadonlyArray<WebpackOptions> & MultiCompilerOptions)} options options
+	 * @param {Callback<Stats> & Callback<MultiStats>=} callback callback
+	 * @returns {Compiler | MultiCompiler}
+	 */
+	(options, callback) => {
+		const create = () => {
+			if (!asArray(options).every(webpackOptionsSchemaCheck)) {
+				getValidateSchema()(webpackOptionsSchema, options);
+				util.deprecate(
+					() => {},
+					"webpack bug: Pre-compiled schema reports error while real schema is happy. This has performance drawbacks.",
+					"DEP_WEBPACK_PRE_COMPILED_SCHEMA_INVALID"
+				)();
+			}
+			/** @type {MultiCompiler|Compiler} */
+			let compiler;
+			let watch = false;
+			/** @type {WatchOptions|WatchOptions[]} */
+			let watchOptions;
+			if (Array.isArray(options)) {
+				/** @type {MultiCompiler} */
+				compiler = createMultiCompiler(
+					options,
+					/** @type {MultiCompilerOptions} */ (options)
+				);
+				watch = options.some(options => options.watch);
+				watchOptions = options.map(options => options.watchOptions || {});
+			} else {
+				const webpackOptions = /** @type {WebpackOptions} */ (options);
+				/** @type {Compiler} */
+				compiler = createCompiler(webpackOptions);
+				watch = webpackOptions.watch;
+				watchOptions = webpackOptions.watchOptions || {};
+			}
+			return { compiler, watch, watchOptions };
+		};
+		if (callback) {
+			try {
+				const { compiler, watch, watchOptions } = create();
+				if (watch) {
+					compiler.watch(watchOptions, callback);
+				} else {
+					compiler.run((err, stats) => {
+						compiler.close(err2 => {
+							callback(err || err2, stats);
+						});
+					});
+				}
+				return compiler;
+			} catch (err) {
+				process.nextTick(() => callback(err));
+				return null;
+			}
+		} else {
+			const { compiler, watch } = create();
+			if (watch) {
+				util.deprecate(
+					() => {},
+					"A 'callback' argument needs to be provided to the 'webpack(options, callback)' function when the 'watch' option is set. There is no way to handle the 'watch' option without a callback.",
+					"DEP_WEBPACK_WATCH_WITHOUT_CALLBACK"
+				)();
+			}
+			return compiler;
+		}
+	}
+);
+
+module.exports = webpack;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/ImportScriptsChunkLoadingPlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/ImportScriptsChunkLoadingPlugin.js
new file mode 100644
index 0000000..b0dda12
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/ImportScriptsChunkLoadingPlugin.js
@@ -0,0 +1,94 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const StartupChunkDependenciesPlugin = require("../runtime/StartupChunkDependenciesPlugin");
+const ImportScriptsChunkLoadingRuntimeModule = require("./ImportScriptsChunkLoadingRuntimeModule");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class ImportScriptsChunkLoadingPlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		new StartupChunkDependenciesPlugin({
+			chunkLoading: "import-scripts",
+			asyncChunkLoading: true
+		}).apply(compiler);
+		compiler.hooks.thisCompilation.tap(
+			"ImportScriptsChunkLoadingPlugin",
+			compilation => {
+				const globalChunkLoading = compilation.outputOptions.chunkLoading;
+				const isEnabledForChunk = chunk => {
+					const options = chunk.getEntryOptions();
+					const chunkLoading =
+						options && options.chunkLoading !== undefined
+							? options.chunkLoading
+							: globalChunkLoading;
+					return chunkLoading === "import-scripts";
+				};
+				const onceForChunkSet = new WeakSet();
+				const handler = (chunk, set) => {
+					if (onceForChunkSet.has(chunk)) return;
+					onceForChunkSet.add(chunk);
+					if (!isEnabledForChunk(chunk)) return;
+					const withCreateScriptUrl = !!compilation.outputOptions.trustedTypes;
+					set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					set.add(RuntimeGlobals.hasOwnProperty);
+					if (withCreateScriptUrl) {
+						set.add(RuntimeGlobals.createScriptUrl);
+					}
+					compilation.addRuntimeModule(
+						chunk,
+						new ImportScriptsChunkLoadingRuntimeModule(set, withCreateScriptUrl)
+					);
+				};
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("ImportScriptsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadUpdateHandlers)
+					.tap("ImportScriptsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadManifest)
+					.tap("ImportScriptsChunkLoadingPlugin", handler);
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.baseURI)
+					.tap("ImportScriptsChunkLoadingPlugin", handler);
+
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.ensureChunkHandlers)
+					.tap("ImportScriptsChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.publicPath);
+						set.add(RuntimeGlobals.getChunkScriptFilename);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadUpdateHandlers)
+					.tap("ImportScriptsChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.publicPath);
+						set.add(RuntimeGlobals.getChunkUpdateScriptFilename);
+						set.add(RuntimeGlobals.moduleCache);
+						set.add(RuntimeGlobals.hmrModuleData);
+						set.add(RuntimeGlobals.moduleFactoriesAddOnly);
+					});
+				compilation.hooks.runtimeRequirementInTree
+					.for(RuntimeGlobals.hmrDownloadManifest)
+					.tap("ImportScriptsChunkLoadingPlugin", (chunk, set) => {
+						if (!isEnabledForChunk(chunk)) return;
+						set.add(RuntimeGlobals.publicPath);
+						set.add(RuntimeGlobals.getUpdateManifestFilename);
+					});
+			}
+		);
+	}
+}
+module.exports = ImportScriptsChunkLoadingPlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/ImportScriptsChunkLoadingRuntimeModule.js b/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/ImportScriptsChunkLoadingRuntimeModule.js
new file mode 100644
index 0000000..b9947d6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/ImportScriptsChunkLoadingRuntimeModule.js
@@ -0,0 +1,238 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+*/
+
+"use strict";
+
+const RuntimeGlobals = require("../RuntimeGlobals");
+const RuntimeModule = require("../RuntimeModule");
+const Template = require("../Template");
+const {
+	getChunkFilenameTemplate,
+	chunkHasJs
+} = require("../javascript/JavascriptModulesPlugin");
+const { getInitialChunkIds } = require("../javascript/StartupHelpers");
+const compileBooleanMatcher = require("../util/compileBooleanMatcher");
+const { getUndoPath } = require("../util/identifier");
+
+/** @typedef {import("../Chunk")} Chunk */
+
+class ImportScriptsChunkLoadingRuntimeModule extends RuntimeModule {
+	constructor(runtimeRequirements, withCreateScriptUrl) {
+		super("importScripts chunk loading", RuntimeModule.STAGE_ATTACH);
+		this.runtimeRequirements = runtimeRequirements;
+		this._withCreateScriptUrl = withCreateScriptUrl;
+	}
+
+	/**
+	 * @private
+	 * @param {Chunk} chunk chunk
+	 * @returns {string} generated code
+	 */
+	_generateBaseUri(chunk) {
+		const options = chunk.getEntryOptions();
+		if (options && options.baseUri) {
+			return `${RuntimeGlobals.baseURI} = ${JSON.stringify(options.baseUri)};`;
+		}
+		const outputName = this.compilation.getPath(
+			getChunkFilenameTemplate(chunk, this.compilation.outputOptions),
+			{
+				chunk,
+				contentHashType: "javascript"
+			}
+		);
+		const rootOutputDir = getUndoPath(
+			outputName,
+			this.compilation.outputOptions.path,
+			false
+		);
+		return `${RuntimeGlobals.baseURI} = self.location + ${JSON.stringify(
+			rootOutputDir ? "/../" + rootOutputDir : ""
+		)};`;
+	}
+
+	/**
+	 * @returns {string} runtime code
+	 */
+	generate() {
+		const {
+			chunk,
+			chunkGraph,
+			compilation: {
+				runtimeTemplate,
+				outputOptions: { chunkLoadingGlobal, hotUpdateGlobal }
+			},
+			_withCreateScriptUrl: withCreateScriptUrl
+		} = this;
+		const globalObject = runtimeTemplate.globalObject;
+		const fn = RuntimeGlobals.ensureChunkHandlers;
+		const withBaseURI = this.runtimeRequirements.has(RuntimeGlobals.baseURI);
+		const withLoading = this.runtimeRequirements.has(
+			RuntimeGlobals.ensureChunkHandlers
+		);
+		const withHmr = this.runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadUpdateHandlers
+		);
+		const withHmrManifest = this.runtimeRequirements.has(
+			RuntimeGlobals.hmrDownloadManifest
+		);
+		const chunkLoadingGlobalExpr = `${globalObject}[${JSON.stringify(
+			chunkLoadingGlobal
+		)}]`;
+		const hasJsMatcher = compileBooleanMatcher(
+			chunkGraph.getChunkConditionMap(chunk, chunkHasJs)
+		);
+		const initialChunkIds = getInitialChunkIds(chunk, chunkGraph, chunkHasJs);
+
+		const stateExpression = withHmr
+			? `${RuntimeGlobals.hmrRuntimeStatePrefix}_importScripts`
+			: undefined;
+
+		return Template.asString([
+			withBaseURI ? this._generateBaseUri(chunk) : "// no baseURI",
+			"",
+			"// object to store loaded chunks",
+			'// "1" means "already loaded"',
+			`var installedChunks = ${
+				stateExpression ? `${stateExpression} = ${stateExpression} || ` : ""
+			}{`,
+			Template.indent(
+				Array.from(initialChunkIds, id => `${JSON.stringify(id)}: 1`).join(
+					",\n"
+				)
+			),
+			"};",
+			"",
+			withLoading
+				? Template.asString([
+						"// importScripts chunk loading",
+						`var installChunk = ${runtimeTemplate.basicFunction("data", [
+							runtimeTemplate.destructureArray(
+								["chunkIds", "moreModules", "runtime"],
+								"data"
+							),
+							"for(var moduleId in moreModules) {",
+							Template.indent([
+								`if(${RuntimeGlobals.hasOwnProperty}(moreModules, moduleId)) {`,
+								Template.indent(
+									`${RuntimeGlobals.moduleFactories}[moduleId] = moreModules[moduleId];`
+								),
+								"}"
+							]),
+							"}",
+							"if(runtime) runtime(__webpack_require__);",
+							"while(chunkIds.length)",
+							Template.indent("installedChunks[chunkIds.pop()] = 1;"),
+							"parentChunkLoadingFunction(data);"
+						])};`
+				  ])
+				: "// no chunk install function needed",
+			withLoading
+				? Template.asString([
+						`${fn}.i = ${runtimeTemplate.basicFunction(
+							"chunkId, promises",
+							hasJsMatcher !== false
+								? [
+										'// "1" is the signal for "already loaded"',
+										"if(!installedChunks[chunkId]) {",
+										Template.indent([
+											hasJsMatcher === true
+												? "if(true) { // all chunks have JS"
+												: `if(${hasJsMatcher("chunkId")}) {`,
+											Template.indent(
+												`importScripts(${
+													withCreateScriptUrl
+														? `${RuntimeGlobals.createScriptUrl}(${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkScriptFilename}(chunkId))`
+														: `${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkScriptFilename}(chunkId)`
+												});`
+											),
+											"}"
+										]),
+										"}"
+								  ]
+								: "installedChunks[chunkId] = 1;"
+						)};`,
+						"",
+						`var chunkLoadingGlobal = ${chunkLoadingGlobalExpr} = ${chunkLoadingGlobalExpr} || [];`,
+						"var parentChunkLoadingFunction = chunkLoadingGlobal.push.bind(chunkLoadingGlobal);",
+						"chunkLoadingGlobal.push = installChunk;"
+				  ])
+				: "// no chunk loading",
+			"",
+			withHmr
+				? Template.asString([
+						"function loadUpdateChunk(chunkId, updatedModulesList) {",
+						Template.indent([
+							"var success = false;",
+							`${globalObject}[${JSON.stringify(
+								hotUpdateGlobal
+							)}] = ${runtimeTemplate.basicFunction("_, moreModules, runtime", [
+								"for(var moduleId in moreModules) {",
+								Template.indent([
+									`if(${RuntimeGlobals.hasOwnProperty}(moreModules, moduleId)) {`,
+									Template.indent([
+										"currentUpdate[moduleId] = moreModules[moduleId];",
+										"if(updatedModulesList) updatedModulesList.push(moduleId);"
+									]),
+									"}"
+								]),
+								"}",
+								"if(runtime) currentUpdateRuntime.push(runtime);",
+								"success = true;"
+							])};`,
+							"// start update chunk loading",
+							`importScripts(${
+								withCreateScriptUrl
+									? `${RuntimeGlobals.createScriptUrl}(${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkUpdateScriptFilename}(chunkId))`
+									: `${RuntimeGlobals.publicPath} + ${RuntimeGlobals.getChunkUpdateScriptFilename}(chunkId)`
+							});`,
+							'if(!success) throw new Error("Loading update chunk failed for unknown reason");'
+						]),
+						"}",
+						"",
+						Template.getFunctionContent(
+							require("../hmr/JavascriptHotModuleReplacement.runtime.js")
+						)
+							.replace(/\$key\$/g, "importScrips")
+							.replace(/\$installedChunks\$/g, "installedChunks")
+							.replace(/\$loadUpdateChunk\$/g, "loadUpdateChunk")
+							.replace(/\$moduleCache\$/g, RuntimeGlobals.moduleCache)
+							.replace(/\$moduleFactories\$/g, RuntimeGlobals.moduleFactories)
+							.replace(
+								/\$ensureChunkHandlers\$/g,
+								RuntimeGlobals.ensureChunkHandlers
+							)
+							.replace(/\$hasOwnProperty\$/g, RuntimeGlobals.hasOwnProperty)
+							.replace(/\$hmrModuleData\$/g, RuntimeGlobals.hmrModuleData)
+							.replace(
+								/\$hmrDownloadUpdateHandlers\$/g,
+								RuntimeGlobals.hmrDownloadUpdateHandlers
+							)
+							.replace(
+								/\$hmrInvalidateModuleHandlers\$/g,
+								RuntimeGlobals.hmrInvalidateModuleHandlers
+							)
+				  ])
+				: "// no HMR",
+			"",
+			withHmrManifest
+				? Template.asString([
+						`${
+							RuntimeGlobals.hmrDownloadManifest
+						} = ${runtimeTemplate.basicFunction("", [
+							'if (typeof fetch === "undefined") throw new Error("No browser support: need fetch API");',
+							`return fetch(${RuntimeGlobals.publicPath} + ${
+								RuntimeGlobals.getUpdateManifestFilename
+							}()).then(${runtimeTemplate.basicFunction("response", [
+								"if(response.status === 404) return; // no update available",
+								'if(!response.ok) throw new Error("Failed to fetch update manifest " + response.statusText);',
+								"return response.json();"
+							])});`
+						])};`
+				  ])
+				: "// no HMR manifest"
+		]);
+	}
+}
+
+module.exports = ImportScriptsChunkLoadingRuntimeModule;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/WebWorkerTemplatePlugin.js b/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/WebWorkerTemplatePlugin.js
new file mode 100644
index 0000000..382c812
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/lib/webworker/WebWorkerTemplatePlugin.js
@@ -0,0 +1,25 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+
+"use strict";
+
+const ArrayPushCallbackChunkFormatPlugin = require("../javascript/ArrayPushCallbackChunkFormatPlugin");
+const EnableChunkLoadingPlugin = require("../javascript/EnableChunkLoadingPlugin");
+
+/** @typedef {import("../Compiler")} Compiler */
+
+class WebWorkerTemplatePlugin {
+	/**
+	 * Apply the plugin
+	 * @param {Compiler} compiler the compiler instance
+	 * @returns {void}
+	 */
+	apply(compiler) {
+		compiler.options.output.chunkLoading = "import-scripts";
+		new ArrayPushCallbackChunkFormatPlugin().apply(compiler);
+		new EnableChunkLoadingPlugin("import-scripts").apply(compiler);
+	}
+}
+module.exports = WebWorkerTemplatePlugin;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/module.d.ts b/node_modules/mathjs/examples/node_modules/webpack/module.d.ts
new file mode 100644
index 0000000..8921489
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/module.d.ts
@@ -0,0 +1,215 @@
+declare namespace webpack {
+	type HotEvent =
+		| {
+				type: "disposed";
+				/** The module in question. */
+				moduleId: number;
+		  }
+		| {
+				type: "self-declined" | "unaccepted";
+				/** The module in question. */
+				moduleId: number;
+				/** the chain from where the update was propagated. */
+				chain: number[];
+		  }
+		| {
+				type: "declined";
+				/** The module in question. */
+				moduleId: number;
+				/** the chain from where the update was propagated. */
+				chain: number[];
+				/** the module id of the declining parent */
+				parentId: number;
+		  }
+		| {
+				type: "accepted";
+				/** The module in question. */
+				moduleId: number;
+				/** the chain from where the update was propagated. */
+				chain: number[];
+				/** the modules that are outdated and will be disposed */
+				outdatedModules: number[];
+				/** the accepted dependencies that are outdated */
+				outdatedDependencies: {
+					[id: number]: number[];
+				};
+		  }
+		| {
+				type: "accept-error-handler-errored";
+				/** The module in question. */
+				moduleId: number;
+				/** the module id owning the accept handler. */
+				dependencyId: number;
+				/** the thrown error */
+				error: Error;
+				/** the error thrown by the module before the error handler tried to handle it. */
+				originalError: Error;
+		  }
+		| {
+				type: "self-accept-error-handler-errored";
+				/** The module in question. */
+				moduleId: number;
+				/** the thrown error */
+				error: Error;
+				/** the error thrown by the module before the error handler tried to handle it. */
+				originalError: Error;
+		  }
+		| {
+				type: "accept-errored";
+				/** The module in question. */
+				moduleId: number;
+				/** the module id owning the accept handler. */
+				dependencyId: number;
+				/** the thrown error */
+				error: Error;
+		  }
+		| {
+				type: "self-accept-errored";
+				/** The module in question. */
+				moduleId: number;
+				/** the thrown error */
+				error: Error;
+		  };
+
+	interface ApplyOptions {
+		ignoreUnaccepted?: boolean;
+		ignoreDeclined?: boolean;
+		ignoreErrored?: boolean;
+		onDeclined?(callback: (info: HotEvent) => void): void;
+		onUnaccepted?(callback: (info: HotEvent) => void): void;
+		onAccepted?(callback: (info: HotEvent) => void): void;
+		onDisposed?(callback: (info: HotEvent) => void): void;
+		onErrored?(callback: (info: HotEvent) => void): void;
+	}
+
+	const enum HotUpdateStatus {
+		idle = "idle",
+		check = "check",
+		prepare = "prepare",
+		ready = "ready",
+		dispose = "dispose",
+		apply = "apply",
+		abort = "abort",
+		fail = "fail"
+	}
+
+	interface Hot {
+		accept: {
+			(
+				modules: string | string[],
+				callback?: (outdatedDependencies: string[]) => void,
+				errorHandler?: (
+					err: Error,
+					context: { moduleId: string | number; dependencyId: string | number }
+				) => void
+			): void;
+			(
+				errorHandler?: (
+					err: Error,
+					ids: { moduleId: string | number; module: NodeJS.Module }
+				) => void
+			): void;
+		};
+		status(): HotUpdateStatus;
+		decline(module?: string | string[]): void;
+		dispose(callback: (data: object) => void): void;
+		addDisposeHandler(callback: (data: object) => void): void;
+		removeDisposeHandler(callback: (data: object) => void): void;
+		invalidate(): void;
+		addStatusHandler(callback: (status: HotUpdateStatus) => void): void;
+		removeStatusHandler(callback: (status: HotUpdateStatus) => void): void;
+		data: object;
+		check(
+			autoApply?: boolean | ApplyOptions
+		): Promise<(string | number)[] | null>;
+		apply(options?: ApplyOptions): Promise<(string | number)[] | null>;
+	}
+
+	interface ExportInfo {
+		used: boolean;
+		provideInfo: boolean | null | undefined;
+		useInfo: boolean | null | undefined;
+		canMangle: boolean;
+	}
+
+	interface ExportsInfo {
+		[k: string]: ExportInfo & ExportsInfo;
+	}
+
+	interface Context {
+		resolve(dependency: string): string | number;
+		keys(): Array<string>;
+		id: string | number;
+		(dependency: string): unknown;
+	}
+}
+
+interface ImportMeta {
+	url: string;
+	webpack: number;
+	webpackHot: webpack.Hot;
+	webpackContext: (
+		request: string,
+		options?: {
+			recursive?: boolean;
+			regExp?: RegExp;
+			include?: RegExp;
+			exclude?: RegExp;
+			preload?: boolean | number;
+			prefetch?: boolean | number;
+			chunkName?: string;
+			exports?: string | string[][];
+			mode?: "sync" | "eager" | "weak" | "lazy" | "lazy-once";
+		}
+	) => webpack.Context;
+}
+
+declare const __resourceQuery: string;
+declare var __webpack_public_path__: string;
+declare var __webpack_nonce__: string;
+declare const __webpack_chunkname__: string;
+declare var __webpack_base_uri__: string;
+declare var __webpack_runtime_id__: string;
+declare const __webpack_hash__: string;
+declare const __webpack_modules__: Record<string | number, NodeJS.Module>;
+declare const __webpack_require__: (id: string | number) => unknown;
+declare var __webpack_chunk_load__: (chunkId: string | number) => Promise<void>;
+declare var __webpack_get_script_filename__: (
+	chunkId: string | number
+) => string;
+declare var __webpack_is_included__: (request: string) => boolean;
+declare var __webpack_exports_info__: webpack.ExportsInfo;
+declare const __webpack_share_scopes__: Record<
+	string,
+	Record<
+		string,
+		{ loaded?: 1; get: () => Promise<unknown>; from: string; eager: boolean }
+	>
+>;
+declare var __webpack_init_sharing__: (scope: string) => Promise<void>;
+declare var __non_webpack_require__: (id: any) => unknown;
+declare const __system_context__: object;
+
+declare namespace NodeJS {
+	interface Module {
+		hot: webpack.Hot;
+	}
+
+	interface Require {
+		ensure(
+			dependencies: string[],
+			callback: (require: (module: string) => void) => void,
+			errorCallback?: (error: Error) => void,
+			chunkName?: string
+		): void;
+		context(
+			request: string,
+			includeSubdirectories?: boolean,
+			filter?: RegExp,
+			mode?: "sync" | "eager" | "weak" | "lazy" | "lazy-once"
+		): webpack.Context;
+		include(dependency: string): void;
+		resolveWeak(dependency: string): void;
+		onError?: (error: Error) => void;
+	}
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/package.json b/node_modules/mathjs/examples/node_modules/webpack/package.json
new file mode 100644
index 0000000..bd54c38
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/package.json
@@ -0,0 +1,242 @@
+{
+  "name": "webpack",
+  "version": "5.70.0",
+  "author": "Tobias Koppers @sokra",
+  "description": "Packs CommonJs/AMD modules for the browser. Allows to split your codebase into multiple bundles, which can be loaded on demand. Support loaders to preprocess files, i.e. json, jsx, es7, css, less, ... and your custom stuff.",
+  "license": "MIT",
+  "dependencies": {
+    "@types/eslint-scope": "^3.7.3",
+    "@types/estree": "^0.0.51",
+    "@webassemblyjs/ast": "1.11.1",
+    "@webassemblyjs/wasm-edit": "1.11.1",
+    "@webassemblyjs/wasm-parser": "1.11.1",
+    "acorn": "^8.4.1",
+    "acorn-import-assertions": "^1.7.6",
+    "browserslist": "^4.14.5",
+    "chrome-trace-event": "^1.0.2",
+    "enhanced-resolve": "^5.9.2",
+    "es-module-lexer": "^0.9.0",
+    "eslint-scope": "5.1.1",
+    "events": "^3.2.0",
+    "glob-to-regexp": "^0.4.1",
+    "graceful-fs": "^4.2.9",
+    "json-parse-better-errors": "^1.0.2",
+    "loader-runner": "^4.2.0",
+    "mime-types": "^2.1.27",
+    "neo-async": "^2.6.2",
+    "schema-utils": "^3.1.0",
+    "tapable": "^2.1.1",
+    "terser-webpack-plugin": "^5.1.3",
+    "watchpack": "^2.3.1",
+    "webpack-sources": "^3.2.3"
+  },
+  "peerDependenciesMeta": {
+    "webpack-cli": {
+      "optional": true
+    }
+  },
+  "devDependencies": {
+    "@babel/core": "^7.11.1",
+    "@babel/preset-react": "^7.10.4",
+    "@types/es-module-lexer": "^0.4.1",
+    "@types/jest": "^27.4.0",
+    "@types/node": "^17.0.16",
+    "assemblyscript": "^0.19.16",
+    "babel-loader": "^8.1.0",
+    "benchmark": "^2.1.4",
+    "bundle-loader": "^0.5.6",
+    "coffee-loader": "^1.0.0",
+    "coffeescript": "^2.5.1",
+    "core-js": "^3.6.5",
+    "coveralls": "^3.1.0",
+    "cspell": "^4.0.63",
+    "css-loader": "^5.0.1",
+    "date-fns": "^2.15.0",
+    "es5-ext": "^0.10.53",
+    "es6-promise-polyfill": "^1.2.0",
+    "eslint": "^7.14.0",
+    "eslint-config-prettier": "^8.1.0",
+    "eslint-plugin-jest": "^24.7.0",
+    "eslint-plugin-jsdoc": "^33.0.0",
+    "eslint-plugin-node": "^11.0.0",
+    "eslint-plugin-prettier": "^4.0.0",
+    "file-loader": "^6.0.0",
+    "fork-ts-checker-webpack-plugin": "^6.0.5",
+    "hash-wasm": "^4.9.0",
+    "husky": "^6.0.0",
+    "is-ci": "^3.0.0",
+    "istanbul": "^0.4.5",
+    "jest": "^27.5.0",
+    "jest-circus": "^27.5.0",
+    "jest-cli": "^27.5.0",
+    "jest-diff": "^27.5.0",
+    "jest-junit": "^13.0.0",
+    "json-loader": "^0.5.7",
+    "json5": "^2.1.3",
+    "less": "^4.0.0",
+    "less-loader": "^8.0.0",
+    "lint-staged": "^11.0.0",
+    "loader-utils": "^2.0.0",
+    "lodash": "^4.17.19",
+    "lodash-es": "^4.17.15",
+    "memfs": "^3.2.0",
+    "mini-css-extract-plugin": "^1.6.1",
+    "mini-svg-data-uri": "^1.2.3",
+    "nyc": "^15.1.0",
+    "open-cli": "^6.0.1",
+    "prettier": "^2.2.0",
+    "pretty-format": "^27.0.2",
+    "pug": "^3.0.0",
+    "pug-loader": "^2.4.0",
+    "raw-loader": "^4.0.1",
+    "react": "^17.0.1",
+    "react-dom": "^17.0.1",
+    "rimraf": "^3.0.2",
+    "script-loader": "^0.7.2",
+    "simple-git": "^2.17.0",
+    "strip-ansi": "^6.0.0",
+    "style-loader": "^2.0.0",
+    "terser": "^5.7.0",
+    "toml": "^3.0.0",
+    "tooling": "webpack/tooling#v1.21.0",
+    "ts-loader": "^8.0.2",
+    "typescript": "^4.5.5",
+    "url-loader": "^4.1.0",
+    "wast-loader": "^1.11.0",
+    "webassembly-feature": "1.3.0",
+    "webpack-cli": "^4.3.0",
+    "xxhashjs": "^0.2.2",
+    "yamljs": "^0.3.0",
+    "yarn-deduplicate": "^3.1.0"
+  },
+  "engines": {
+    "node": ">=10.13.0"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/webpack/webpack.git"
+  },
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/webpack"
+  },
+  "homepage": "https://github.com/webpack/webpack",
+  "main": "lib/index.js",
+  "bin": {
+    "webpack": "bin/webpack.js"
+  },
+  "types": "types.d.ts",
+  "files": [
+    "lib/",
+    "bin/",
+    "hot/",
+    "schemas/",
+    "SECURITY.md",
+    "module.d.ts",
+    "types.d.ts"
+  ],
+  "scripts": {
+    "setup": "node ./setup/setup.js",
+    "jest": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules --trace-deprecation node_modules/jest-cli/bin/jest --logHeapUsage",
+    "test": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules --trace-deprecation node_modules/jest-cli/bin/jest --logHeapUsage",
+    "test:update-snapshots": "yarn jest -u",
+    "test:integration": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules --trace-deprecation node_modules/jest-cli/bin/jest --logHeapUsage --testMatch \"<rootDir>/test/*.{basictest,longtest,test}.js\"",
+    "test:basic": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules --trace-deprecation node_modules/jest-cli/bin/jest --logHeapUsage --testMatch \"<rootDir>/test/*.basictest.js\"",
+    "test:unit": "node --max-old-space-size=4096 --experimental-vm-modules --trace-deprecation node_modules/jest-cli/bin/jest --testMatch \"<rootDir>/test/*.unittest.js\"",
+    "build:examples": "cd examples && node buildAll.js",
+    "type-report": "rimraf coverage && yarn cover:types && yarn cover:report && open-cli coverage/lcov-report/index.html",
+    "pretest": "yarn lint",
+    "prelint": "yarn setup",
+    "lint": "yarn code-lint && yarn special-lint && yarn type-lint && yarn typings-test && yarn module-typings-test && yarn yarn-lint && yarn pretty-lint && yarn spellcheck",
+    "code-lint": "eslint . --ext '.js' --cache",
+    "type-lint": "tsc",
+    "typings-test": "tsc -p tsconfig.types.test.json",
+    "module-typings-test": "tsc -p tsconfig.module.test.json",
+    "spellcheck": "cspell \"**/*\"",
+    "special-lint": "node node_modules/tooling/lockfile-lint && node node_modules/tooling/schemas-lint && node node_modules/tooling/inherit-types && node node_modules/tooling/format-schemas && node tooling/generate-runtime-code.js && node tooling/generate-wasm-code.js && node node_modules/tooling/format-file-header && node node_modules/tooling/compile-to-definitions && node node_modules/tooling/precompile-schemas && node node_modules/tooling/generate-types --no-template-literals",
+    "special-lint-fix": "node node_modules/tooling/inherit-types --write && node node_modules/tooling/format-schemas --write && node tooling/generate-runtime-code.js --write && node tooling/generate-wasm-code.js --write && node node_modules/tooling/format-file-header --write && node node_modules/tooling/compile-to-definitions --write && node node_modules/tooling/precompile-schemas --write && node node_modules/tooling/generate-types --no-template-literals --write",
+    "fix": "yarn code-lint --fix && yarn special-lint-fix && yarn pretty-lint-fix",
+    "prepare": "husky install",
+    "pretty-lint-base": "prettier \"*.{ts,json,yml,yaml,md}\" \"{setup,lib,bin,hot,benchmark,tooling,schemas}/**/*.json\" \"examples/*.md\"",
+    "pretty-lint-base-all": "yarn pretty-lint-base \"*.js\" \"{setup,lib,bin,hot,benchmark,tooling,schemas}/**/*.js\" \"module.d.ts\" \"test/*.js\" \"test/helpers/*.js\" \"test/{configCases,watchCases,statsCases,hotCases,benchmarkCases}/**/webpack.config.js\" \"examples/**/webpack.config.js\"",
+    "pretty-lint-fix": "yarn pretty-lint-base-all --loglevel warn --write",
+    "pretty-lint": "yarn pretty-lint-base --check",
+    "yarn-lint": "yarn-deduplicate --fail --list -s highest yarn.lock",
+    "yarn-lint-fix": "yarn-deduplicate -s highest yarn.lock",
+    "benchmark": "node --max-old-space-size=4096 --experimental-vm-modules --trace-deprecation node_modules/jest-cli/bin/jest --testMatch \"<rootDir>/test/*.benchmark.js\" --runInBand",
+    "cover": "yarn cover:all && yarn cover:report",
+    "cover:clean": "rimraf .nyc_output coverage",
+    "cover:all": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules node_modules/jest-cli/bin/jest --logHeapUsage --coverage",
+    "cover:basic": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules node_modules/jest-cli/bin/jest --logHeapUsage --testMatch \"<rootDir>/test/*.basictest.js\" --coverage",
+    "cover:integration": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules node_modules/jest-cli/bin/jest --logHeapUsage --testMatch \"<rootDir>/test/*.{basictest,longtest,test}.js\" --coverage",
+    "cover:integration:a": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules node_modules/jest-cli/bin/jest --logHeapUsage --testMatch \"<rootDir>/test/*.{basictest,test}.js\" --coverage",
+    "cover:integration:b": "node --expose-gc --max-old-space-size=4096 --experimental-vm-modules node_modules/jest-cli/bin/jest --logHeapUsage --testMatch \"<rootDir>/test/*.longtest.js\" --coverage",
+    "cover:unit": "node --max-old-space-size=4096 --experimental-vm-modules node_modules/jest-cli/bin/jest --testMatch \"<rootDir>/test/*.unittest.js\" --coverage",
+    "cover:types": "node node_modules/tooling/type-coverage",
+    "cover:merge": "yarn mkdirp .nyc_output && nyc merge .nyc_output coverage/coverage-nyc.json && rimraf .nyc_output",
+    "cover:report": "nyc report -t coverage"
+  },
+  "lint-staged": {
+    "*.js|{lib,setup,bin,hot,tooling,schemas}/**/*.js|test/*.js|{test,examples}/**/webpack.config.js}": [
+      "eslint --cache"
+    ],
+    "*.{ts,json,yml,yaml,md}|examples/*.md": [
+      "prettier --check"
+    ],
+    "*.md|{.github,benchmark,bin,examples,hot,lib,schemas,setup,tooling}/**/*.{md,yml,yaml,js,json}": [
+      "cspell"
+    ]
+  },
+  "jest": {
+    "forceExit": true,
+    "setupFilesAfterEnv": [
+      "<rootDir>/test/setupTestFramework.js"
+    ],
+    "testMatch": [
+      "<rootDir>/test/*.test.js",
+      "<rootDir>/test/*.basictest.js",
+      "<rootDir>/test/*.longtest.js",
+      "<rootDir>/test/*.unittest.js"
+    ],
+    "watchPathIgnorePatterns": [
+      "<rootDir>/.git",
+      "<rootDir>/node_modules",
+      "<rootDir>/test/js",
+      "<rootDir>/test/browsertest/js",
+      "<rootDir>/test/fixtures/temp-cache-fixture",
+      "<rootDir>/test/fixtures/temp-",
+      "<rootDir>/benchmark",
+      "<rootDir>/assembly",
+      "<rootDir>/tooling",
+      "<rootDir>/examples/*/dist",
+      "<rootDir>/coverage",
+      "<rootDir>/.eslintcache"
+    ],
+    "modulePathIgnorePatterns": [
+      "<rootDir>/.git",
+      "<rootDir>/node_modules/webpack/node_modules",
+      "<rootDir>/test/js",
+      "<rootDir>/test/browsertest/js",
+      "<rootDir>/test/fixtures/temp-cache-fixture",
+      "<rootDir>/test/fixtures/temp-",
+      "<rootDir>/benchmark",
+      "<rootDir>/examples/*/dist",
+      "<rootDir>/coverage",
+      "<rootDir>/.eslintcache"
+    ],
+    "transformIgnorePatterns": [
+      "<rootDir>"
+    ],
+    "coverageDirectory": "<rootDir>/coverage",
+    "coveragePathIgnorePatterns": [
+      "\\.runtime\\.js$",
+      "<rootDir>/test",
+      "<rootDir>/schemas",
+      "<rootDir>/node_modules"
+    ],
+    "testEnvironment": "node",
+    "coverageReporters": [
+      "json"
+    ]
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.check.d.ts
new file mode 100644
index 0000000..16a8271
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../declarations/WebpackOptions").WebpackOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.check.js
new file mode 100644
index 0000000..d5f1a19
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const e=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;module.exports=we,module.exports.default=we;const t={amd:{$ref:"#/definitions/Amd"},bail:{$ref:"#/definitions/Bail"},cache:{$ref:"#/definitions/CacheOptions"},context:{$ref:"#/definitions/Context"},dependencies:{$ref:"#/definitions/Dependencies"},devServer:{$ref:"#/definitions/DevServer"},devtool:{$ref:"#/definitions/DevTool"},entry:{$ref:"#/definitions/Entry"},experiments:{$ref:"#/definitions/Experiments"},externals:{$ref:"#/definitions/Externals"},externalsPresets:{$ref:"#/definitions/ExternalsPresets"},externalsType:{$ref:"#/definitions/ExternalsType"},ignoreWarnings:{$ref:"#/definitions/IgnoreWarnings"},infrastructureLogging:{$ref:"#/definitions/InfrastructureLogging"},loader:{$ref:"#/definitions/Loader"},mode:{$ref:"#/definitions/Mode"},module:{$ref:"#/definitions/ModuleOptions"},name:{$ref:"#/definitions/Name"},node:{$ref:"#/definitions/Node"},optimization:{$ref:"#/definitions/Optimization"},output:{$ref:"#/definitions/Output"},parallelism:{$ref:"#/definitions/Parallelism"},performance:{$ref:"#/definitions/Performance"},plugins:{$ref:"#/definitions/Plugins"},profile:{$ref:"#/definitions/Profile"},recordsInputPath:{$ref:"#/definitions/RecordsInputPath"},recordsOutputPath:{$ref:"#/definitions/RecordsOutputPath"},recordsPath:{$ref:"#/definitions/RecordsPath"},resolve:{$ref:"#/definitions/Resolve"},resolveLoader:{$ref:"#/definitions/ResolveLoader"},snapshot:{$ref:"#/definitions/SnapshotOptions"},stats:{$ref:"#/definitions/StatsValue"},target:{$ref:"#/definitions/Target"},watch:{$ref:"#/definitions/Watch"},watchOptions:{$ref:"#/definitions/WatchOptions"}},n=Object.prototype.hasOwnProperty,r={allowCollectingMemory:{type:"boolean"},buildDependencies:{type:"object",additionalProperties:{type:"array",items:{type:"string",minLength:1}}},cacheDirectory:{type:"string",absolutePath:!0},cacheLocation:{type:"string",absolutePath:!0},compression:{enum:[!1,"gzip","brotli"]},hashAlgorithm:{type:"string"},idleTimeout:{type:"number",minimum:0},idleTimeoutAfterLargeChanges:{type:"number",minimum:0},idleTimeoutForInitialStore:{type:"number",minimum:0},immutablePaths:{type:"array",items:{anyOf:[{instanceof:"RegExp"},{type:"string",absolutePath:!0,minLength:1}]}},managedPaths:{type:"array",items:{anyOf:[{instanceof:"RegExp"},{type:"string",absolutePath:!0,minLength:1}]}},maxAge:{type:"number",minimum:0},maxMemoryGenerations:{type:"number",minimum:0},memoryCacheUnaffected:{type:"boolean"},name:{type:"string"},profile:{type:"boolean"},store:{enum:["pack"]},type:{enum:["filesystem"]},version:{type:"string"}};function s(t,{instancePath:o="",parentData:a,parentDataProperty:i,rootData:l=t}={}){let p=null,u=0;const f=u;let c=!1;const m=u;if(!1!==t){const e={params:{}};null===p?p=[e]:p.push(e),u++}var y=m===u;if(c=c||y,!c){const s=u;if(u==u)if(t&&"object"==typeof t&&!Array.isArray(t)){let e;if(void 0===t.type&&(e="type")){const t={params:{missingProperty:e}};null===p?p=[t]:p.push(t),u++}else{const e=u;for(const e in t)if("cacheUnaffected"!==e&&"maxGenerations"!==e&&"type"!==e){const t={params:{additionalProperty:e}};null===p?p=[t]:p.push(t),u++;break}if(e===u){if(void 0!==t.cacheUnaffected){const e=u;if("boolean"!=typeof t.cacheUnaffected){const e={params:{type:"boolean"}};null===p?p=[e]:p.push(e),u++}var h=e===u}else h=!0;if(h){if(void 0!==t.maxGenerations){let e=t.maxGenerations;const n=u;if(u===n)if("number"==typeof e){if(e<1||isNaN(e)){const e={params:{comparison:">=",limit:1}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"number"}};null===p?p=[e]:p.push(e),u++}h=n===u}else h=!0;if(h)if(void 0!==t.type){const e=u;if("memory"!==t.type){const e={params:{}};null===p?p=[e]:p.push(e),u++}h=e===u}else h=!0}}}}else{const e={params:{type:"object"}};null===p?p=[e]:p.push(e),u++}if(y=s===u,c=c||y,!c){const s=u;if(u==u)if(t&&"object"==typeof t&&!Array.isArray(t)){let s;if(void 0===t.type&&(s="type")){const e={params:{missingProperty:s}};null===p?p=[e]:p.push(e),u++}else{const s=u;for(const e in t)if(!n.call(r,e)){const t={params:{additionalProperty:e}};null===p?p=[t]:p.push(t),u++;break}if(s===u){if(void 0!==t.allowCollectingMemory){const e=u;if("boolean"!=typeof t.allowCollectingMemory){const e={params:{type:"boolean"}};null===p?p=[e]:p.push(e),u++}var d=e===u}else d=!0;if(d){if(void 0!==t.buildDependencies){let e=t.buildDependencies;const n=u;if(u===n)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){let n=e[t];const r=u;if(u===r)if(Array.isArray(n)){const e=n.length;for(let t=0;t<e;t++){let e=n[t];const r=u;if(u===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}if(r!==u)break}}else{const e={params:{type:"array"}};null===p?p=[e]:p.push(e),u++}if(r!==u)break}else{const e={params:{type:"object"}};null===p?p=[e]:p.push(e),u++}d=n===u}else d=!0;if(d){if(void 0!==t.cacheDirectory){let n=t.cacheDirectory;const r=u;if(u===r)if("string"==typeof n){if(n.includes("!")||!0!==e.test(n)){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}d=r===u}else d=!0;if(d){if(void 0!==t.cacheLocation){let n=t.cacheLocation;const r=u;if(u===r)if("string"==typeof n){if(n.includes("!")||!0!==e.test(n)){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}d=r===u}else d=!0;if(d){if(void 0!==t.compression){let e=t.compression;const n=u;if(!1!==e&&"gzip"!==e&&"brotli"!==e){const e={params:{}};null===p?p=[e]:p.push(e),u++}d=n===u}else d=!0;if(d){if(void 0!==t.hashAlgorithm){const e=u;if("string"!=typeof t.hashAlgorithm){const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0;if(d){if(void 0!==t.idleTimeout){let e=t.idleTimeout;const n=u;if(u===n)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"number"}};null===p?p=[e]:p.push(e),u++}d=n===u}else d=!0;if(d){if(void 0!==t.idleTimeoutAfterLargeChanges){let e=t.idleTimeoutAfterLargeChanges;const n=u;if(u===n)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"number"}};null===p?p=[e]:p.push(e),u++}d=n===u}else d=!0;if(d){if(void 0!==t.idleTimeoutForInitialStore){let e=t.idleTimeoutForInitialStore;const n=u;if(u===n)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"number"}};null===p?p=[e]:p.push(e),u++}d=n===u}else d=!0;if(d){if(void 0!==t.immutablePaths){let n=t.immutablePaths;const r=u;if(u===r)if(Array.isArray(n)){const t=n.length;for(let r=0;r<t;r++){let t=n[r];const s=u,o=u;let a=!1;const i=u;if(!(t instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}var g=i===u;if(a=a||g,!a){const n=u;if(u===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===p?p=[e]:p.push(e),u++}else if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}g=n===u,a=a||g}if(a)u=o,null!==p&&(o?p.length=o:p=null);else{const e={params:{}};null===p?p=[e]:p.push(e),u++}if(s!==u)break}}else{const e={params:{type:"array"}};null===p?p=[e]:p.push(e),u++}d=r===u}else d=!0;if(d){if(void 0!==t.managedPaths){let n=t.managedPaths;const r=u;if(u===r)if(Array.isArray(n)){const t=n.length;for(let r=0;r<t;r++){let t=n[r];const s=u,o=u;let a=!1;const i=u;if(!(t instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}var b=i===u;if(a=a||b,!a){const n=u;if(u===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===p?p=[e]:p.push(e),u++}else if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}b=n===u,a=a||b}if(a)u=o,null!==p&&(o?p.length=o:p=null);else{const e={params:{}};null===p?p=[e]:p.push(e),u++}if(s!==u)break}}else{const e={params:{type:"array"}};null===p?p=[e]:p.push(e),u++}d=r===u}else d=!0;if(d){if(void 0!==t.maxAge){let e=t.maxAge;const n=u;if(u===n)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"number"}};null===p?p=[e]:p.push(e),u++}d=n===u}else d=!0;if(d){if(void 0!==t.maxMemoryGenerations){let e=t.maxMemoryGenerations;const n=u;if(u===n)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"number"}};null===p?p=[e]:p.push(e),u++}d=n===u}else d=!0;if(d){if(void 0!==t.memoryCacheUnaffected){const e=u;if("boolean"!=typeof t.memoryCacheUnaffected){const e={params:{type:"boolean"}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0;if(d){if(void 0!==t.name){const e=u;if("string"!=typeof t.name){const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0;if(d){if(void 0!==t.profile){const e=u;if("boolean"!=typeof t.profile){const e={params:{type:"boolean"}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0;if(d){if(void 0!==t.store){const e=u;if("pack"!==t.store){const e={params:{}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0;if(d){if(void 0!==t.type){const e=u;if("filesystem"!==t.type){const e={params:{}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0;if(d)if(void 0!==t.version){const e=u;if("string"!=typeof t.version){const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0}}}}}}}}}}}}}}}}}}}}else{const e={params:{type:"object"}};null===p?p=[e]:p.push(e),u++}y=s===u,c=c||y}}if(!c){const e={params:{}};return null===p?p=[e]:p.push(e),u++,s.errors=p,!1}return u=f,null!==p&&(f?p.length=f:p=null),s.errors=p,0===u}function o(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:a=e}={}){let i=null,l=0;const p=l;let u=!1;const f=l;if(!0!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var c=f===l;if(u=u||c,!u){const o=l;s(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:a})||(i=null===i?s.errors:i.concat(s.errors),l=i.length),c=o===l,u=u||c}if(!u){const e={params:{}};return null===i?i=[e]:i.push(e),l++,o.errors=i,!1}return l=p,null!==i&&(p?i.length=p:i=null),o.errors=i,0===l}const a={asyncChunks:{type:"boolean"},baseUri:{type:"string"},chunkLoading:{$ref:"#/definitions/ChunkLoading"},dependOn:{anyOf:[{type:"array",items:{type:"string",minLength:1},minItems:1,uniqueItems:!0},{type:"string",minLength:1}]},filename:{$ref:"#/definitions/EntryFilename"},import:{$ref:"#/definitions/EntryItem"},layer:{$ref:"#/definitions/Layer"},library:{$ref:"#/definitions/LibraryOptions"},publicPath:{$ref:"#/definitions/PublicPath"},runtime:{$ref:"#/definitions/EntryRuntime"},wasmLoading:{$ref:"#/definitions/WasmLoading"}};function i(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const l=a;let p=!1;const u=a;if(!1!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var f=u===a;if(p=p||f,!p){const t=a,n=a;let r=!1;const s=a;if("jsonp"!==e&&"import-scripts"!==e&&"require"!==e&&"async-node"!==e&&"import"!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var c=s===a;if(r=r||c,!r){const t=a;if("string"!=typeof e){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}c=t===a,r=r||c}if(r)a=n,null!==o&&(n?o.length=n:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}f=t===a,p=p||f}if(!p){const e={params:{}};return null===o?o=[e]:o.push(e),a++,i.errors=o,!1}return a=l,null!==o&&(l?o.length=l:o=null),i.errors=o,0===a}function l(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const p=i;let u=!1,f=null;const c=i,m=i;let y=!1;const h=i;if(i===h)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}else if(t.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var d=h===i;if(y=y||d,!y){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}d=e===i,y=y||d}if(y)i=m,null!==a&&(m?a.length=m:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(c===i&&(u=!0,f=0),!u){const e={params:{passingSchemas:f}};return null===a?a=[e]:a.push(e),i++,l.errors=a,!1}return i=p,null!==a&&(p?a.length=p:a=null),l.errors=a,0===i}function p(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const u=a;if("string"!=typeof e){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var f=u===a;if(l=l||f,!l){const t=a;if(a==a)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=a;for(const t in e)if("amd"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"root"!==t){const e={params:{additionalProperty:t}};null===o?o=[e]:o.push(e),a++;break}if(t===a){if(void 0!==e.amd){const t=a;if("string"!=typeof e.amd){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var c=t===a}else c=!0;if(c){if(void 0!==e.commonjs){const t=a;if("string"!=typeof e.commonjs){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}c=t===a}else c=!0;if(c){if(void 0!==e.commonjs2){const t=a;if("string"!=typeof e.commonjs2){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}c=t===a}else c=!0;if(c)if(void 0!==e.root){const t=a;if("string"!=typeof e.root){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}c=t===a}else c=!0}}}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}f=t===a,l=l||f}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,p.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),p.errors=o,0===a}function u(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(a===p)if(Array.isArray(e))if(e.length<1){const e={params:{limit:1}};null===o?o=[e]:o.push(e),a++}else{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=a;if(a===r)if("string"==typeof t){if(t.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(r!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var f=p===a;if(l=l||f,!l){const t=a;if(a===t)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(f=t===a,l=l||f,!l){const t=a;if(a==a)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=a;for(const t in e)if("amd"!==t&&"commonjs"!==t&&"root"!==t){const e={params:{additionalProperty:t}};null===o?o=[e]:o.push(e),a++;break}if(t===a){if(void 0!==e.amd){let t=e.amd;const n=a;if(a===n)if("string"==typeof t){if(t.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var c=n===a}else c=!0;if(c){if(void 0!==e.commonjs){let t=e.commonjs;const n=a;if(a===n)if("string"==typeof t){if(t.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}c=n===a}else c=!0;if(c)if(void 0!==e.root){let t=e.root;const n=a,r=a;let s=!1;const i=a;if(a===i)if(Array.isArray(t)){const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=a;if(a===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(r!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var m=i===a;if(s=s||m,!s){const e=a;if(a===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}m=e===a,s=s||m}if(s)a=r,null!==o&&(r?o.length=r:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}c=n===a}else c=!0}}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}f=t===a,l=l||f}}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,u.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),u.errors=o,0===a}function f(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return f.errors=[{params:{type:"object"}}],!1;{let n;if(void 0===e.type&&(n="type"))return f.errors=[{params:{missingProperty:n}}],!1;{const n=a;for(const t in e)if("auxiliaryComment"!==t&&"export"!==t&&"name"!==t&&"type"!==t&&"umdNamedDefine"!==t)return f.errors=[{params:{additionalProperty:t}}],!1;if(n===a){if(void 0!==e.auxiliaryComment){const n=a;p(e.auxiliaryComment,{instancePath:t+"/auxiliaryComment",parentData:e,parentDataProperty:"auxiliaryComment",rootData:s})||(o=null===o?p.errors:o.concat(p.errors),a=o.length);var i=n===a}else i=!0;if(i){if(void 0!==e.export){let t=e.export;const n=a,r=a;let s=!1;const p=a;if(a===p)if(Array.isArray(t)){const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=a;if(a===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(r!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var l=p===a;if(s=s||l,!s){const e=a;if(a===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}l=e===a,s=s||l}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,f.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),i=n===a}else i=!0;if(i){if(void 0!==e.name){const n=a;u(e.name,{instancePath:t+"/name",parentData:e,parentDataProperty:"name",rootData:s})||(o=null===o?u.errors:o.concat(u.errors),a=o.length),i=n===a}else i=!0;if(i){if(void 0!==e.type){let t=e.type;const n=a,r=a;let s=!1;const l=a;if("var"!==t&&"module"!==t&&"assign"!==t&&"assign-properties"!==t&&"this"!==t&&"window"!==t&&"self"!==t&&"global"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"commonjs-module"!==t&&"commonjs-static"!==t&&"amd"!==t&&"amd-require"!==t&&"umd"!==t&&"umd2"!==t&&"jsonp"!==t&&"system"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var c=l===a;if(s=s||c,!s){const e=a;if("string"!=typeof t){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}c=e===a,s=s||c}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,f.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),i=n===a}else i=!0;if(i)if(void 0!==e.umdNamedDefine){const t=a;if("boolean"!=typeof e.umdNamedDefine)return f.errors=[{params:{type:"boolean"}}],!1;i=t===a}else i=!0}}}}}}}return f.errors=o,0===a}function c(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if("auto"!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const t=a,n=a;let r=!1;const s=a;if("string"!=typeof e){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var f=s===a;if(r=r||f,!r){const t=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}f=t===a,r=r||f}if(r)a=n,null!==o&&(n?o.length=n:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}u=t===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,c.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),c.errors=o,0===a}function m(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(!1!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const t=a,n=a;let r=!1;const s=a;if("fetch-streaming"!==e&&"fetch"!==e&&"async-node"!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var f=s===a;if(r=r||f,!r){const t=a;if("string"!=typeof e){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}f=t===a,r=r||f}if(r)a=n,null!==o&&(n?o.length=n:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}u=t===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,m.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),m.errors=o,0===a}function y(e,{instancePath:t="",parentData:r,parentDataProperty:s,rootData:o=e}={}){let p=null,u=0;if(0===u){if(!e||"object"!=typeof e||Array.isArray(e))return y.errors=[{params:{type:"object"}}],!1;{let r;if(void 0===e.import&&(r="import"))return y.errors=[{params:{missingProperty:r}}],!1;{const r=u;for(const t in e)if(!n.call(a,t))return y.errors=[{params:{additionalProperty:t}}],!1;if(r===u){if(void 0!==e.asyncChunks){const t=u;if("boolean"!=typeof e.asyncChunks)return y.errors=[{params:{type:"boolean"}}],!1;var h=t===u}else h=!0;if(h){if(void 0!==e.baseUri){const t=u;if("string"!=typeof e.baseUri)return y.errors=[{params:{type:"string"}}],!1;h=t===u}else h=!0;if(h){if(void 0!==e.chunkLoading){const n=u;i(e.chunkLoading,{instancePath:t+"/chunkLoading",parentData:e,parentDataProperty:"chunkLoading",rootData:o})||(p=null===p?i.errors:p.concat(i.errors),u=p.length),h=n===u}else h=!0;if(h){if(void 0!==e.dependOn){let t=e.dependOn;const n=u,r=u;let s=!1;const o=u;if(u===o)if(Array.isArray(t))if(t.length<1){const e={params:{limit:1}};null===p?p=[e]:p.push(e),u++}else{var d=!0;const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=u;if(u===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}if(!(d=r===u))break}if(d){let e,n=t.length;if(n>1){const r={};for(;n--;){let s=t[n];if("string"==typeof s){if("number"==typeof r[s]){e=r[s];const t={params:{i:n,j:e}};null===p?p=[t]:p.push(t),u++;break}r[s]=n}}}}}else{const e={params:{type:"array"}};null===p?p=[e]:p.push(e),u++}var g=o===u;if(s=s||g,!s){const e=u;if(u===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}g=e===u,s=s||g}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,y.errors=p,!1}u=r,null!==p&&(r?p.length=r:p=null),h=n===u}else h=!0;if(h){if(void 0!==e.filename){const n=u;l(e.filename,{instancePath:t+"/filename",parentData:e,parentDataProperty:"filename",rootData:o})||(p=null===p?l.errors:p.concat(l.errors),u=p.length),h=n===u}else h=!0;if(h){if(void 0!==e.import){let t=e.import;const n=u,r=u;let s=!1;const o=u;if(u===o)if(Array.isArray(t))if(t.length<1){const e={params:{limit:1}};null===p?p=[e]:p.push(e),u++}else{var b=!0;const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=u;if(u===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}if(!(b=r===u))break}if(b){let e,n=t.length;if(n>1){const r={};for(;n--;){let s=t[n];if("string"==typeof s){if("number"==typeof r[s]){e=r[s];const t={params:{i:n,j:e}};null===p?p=[t]:p.push(t),u++;break}r[s]=n}}}}}else{const e={params:{type:"array"}};null===p?p=[e]:p.push(e),u++}var v=o===u;if(s=s||v,!s){const e=u;if(u===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}v=e===u,s=s||v}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,y.errors=p,!1}u=r,null!==p&&(r?p.length=r:p=null),h=n===u}else h=!0;if(h){if(void 0!==e.layer){let t=e.layer;const n=u,r=u;let s=!1;const o=u;if(null!==t){const e={params:{}};null===p?p=[e]:p.push(e),u++}var D=o===u;if(s=s||D,!s){const e=u;if(u===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}D=e===u,s=s||D}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,y.errors=p,!1}u=r,null!==p&&(r?p.length=r:p=null),h=n===u}else h=!0;if(h){if(void 0!==e.library){const n=u;f(e.library,{instancePath:t+"/library",parentData:e,parentDataProperty:"library",rootData:o})||(p=null===p?f.errors:p.concat(f.errors),u=p.length),h=n===u}else h=!0;if(h){if(void 0!==e.publicPath){const n=u;c(e.publicPath,{instancePath:t+"/publicPath",parentData:e,parentDataProperty:"publicPath",rootData:o})||(p=null===p?c.errors:p.concat(c.errors),u=p.length),h=n===u}else h=!0;if(h){if(void 0!==e.runtime){let t=e.runtime;const n=u,r=u;let s=!1;const o=u;if(!1!==t){const e={params:{}};null===p?p=[e]:p.push(e),u++}var P=o===u;if(s=s||P,!s){const e=u;if(u===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}P=e===u,s=s||P}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,y.errors=p,!1}u=r,null!==p&&(r?p.length=r:p=null),h=n===u}else h=!0;if(h)if(void 0!==e.wasmLoading){const n=u;m(e.wasmLoading,{instancePath:t+"/wasmLoading",parentData:e,parentDataProperty:"wasmLoading",rootData:o})||(p=null===p?m.errors:p.concat(m.errors),u=p.length),h=n===u}else h=!0}}}}}}}}}}}}}return y.errors=p,0===u}function h(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return h.errors=[{params:{type:"object"}}],!1;for(const n in e){let r=e[n];const u=a,f=a;let c=!1;const m=a,d=a;let g=!1;const b=a;if(a===b)if(Array.isArray(r))if(r.length<1){const e={params:{limit:1}};null===o?o=[e]:o.push(e),a++}else{var i=!0;const e=r.length;for(let t=0;t<e;t++){let e=r[t];const n=a;if(a===n)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(!(i=n===a))break}if(i){let e,t=r.length;if(t>1){const n={};for(;t--;){let s=r[t];if("string"==typeof s){if("number"==typeof n[s]){e=n[s];const r={params:{i:t,j:e}};null===o?o=[r]:o.push(r),a++;break}n[s]=t}}}}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var l=b===a;if(g=g||l,!g){const e=a;if(a===e)if("string"==typeof r){if(r.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}l=e===a,g=g||l}if(g)a=d,null!==o&&(d?o.length=d:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}var p=m===a;if(c=c||p,!c){const i=a;y(r,{instancePath:t+"/"+n.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:e,parentDataProperty:n,rootData:s})||(o=null===o?y.errors:o.concat(y.errors),a=o.length),p=i===a,c=c||p}if(!c){const e={params:{}};return null===o?o=[e]:o.push(e),a++,h.errors=o,!1}if(a=f,null!==o&&(f?o.length=f:o=null),u!==a)break}}return h.errors=o,0===a}function d(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1,p=null;const u=a,f=a;let c=!1;const m=a;if(a===m)if(Array.isArray(e))if(e.length<1){const e={params:{limit:1}};null===o?o=[e]:o.push(e),a++}else{var y=!0;const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=a;if(a===r)if("string"==typeof t){if(t.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(!(y=r===a))break}if(y){let t,n=e.length;if(n>1){const r={};for(;n--;){let s=e[n];if("string"==typeof s){if("number"==typeof r[s]){t=r[s];const e={params:{i:n,j:t}};null===o?o=[e]:o.push(e),a++;break}r[s]=n}}}}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var h=m===a;if(c=c||h,!c){const t=a;if(a===t)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}h=t===a,c=c||h}if(c)a=f,null!==o&&(f?o.length=f:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}if(u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,d.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),d.errors=o,0===a}function g(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;h(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?h.errors:o.concat(h.errors),a=o.length);var u=p===a;if(l=l||u,!l){const i=a;d(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?d.errors:o.concat(d.errors),a=o.length),u=i===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,g.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),g.errors=o,0===a}function b(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const i=a;g(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?g.errors:o.concat(g.errors),a=o.length),u=i===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,b.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),b.errors=o,0===a}const v={asyncWebAssembly:{type:"boolean"},backCompat:{type:"boolean"},buildHttp:{anyOf:[{$ref:"#/definitions/HttpUriAllowedUris"},{$ref:"#/definitions/HttpUriOptions"}]},cacheUnaffected:{type:"boolean"},css:{anyOf:[{type:"boolean"},{$ref:"#/definitions/CssExperimentOptions"}]},futureDefaults:{type:"boolean"},layers:{type:"boolean"},lazyCompilation:{anyOf:[{type:"boolean"},{$ref:"#/definitions/LazyCompilationOptions"}]},outputModule:{type:"boolean"},syncWebAssembly:{type:"boolean"},topLevelAwait:{type:"boolean"}},D=new RegExp("^https?://","u");function P(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1,p=null;const u=a;if(a==a)if(Array.isArray(e)){const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=a,s=a;let i=!1;const l=a;if(!(t instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var f=l===a;if(i=i||f,!i){const e=a;if(a===e)if("string"==typeof t){if(!D.test(t)){const e={params:{pattern:"^https?://"}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(f=e===a,i=i||f,!i){const e=a;if(!(t instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}f=e===a,i=i||f}}if(i)a=s,null!==o&&(s?o.length=s:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}if(r!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}if(u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,P.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),P.errors=o,0===a}function A(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;if(0===i){if(!t||"object"!=typeof t||Array.isArray(t))return A.errors=[{params:{type:"object"}}],!1;{let n;if(void 0===t.allowedUris&&(n="allowedUris"))return A.errors=[{params:{missingProperty:n}}],!1;{const n=i;for(const e in t)if("allowedUris"!==e&&"cacheLocation"!==e&&"frozen"!==e&&"lockfileLocation"!==e&&"proxy"!==e&&"upgrade"!==e)return A.errors=[{params:{additionalProperty:e}}],!1;if(n===i){if(void 0!==t.allowedUris){let e=t.allowedUris;const n=i;if(i==i){if(!Array.isArray(e))return A.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=i,s=i;let o=!1;const p=i;if(!(t instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var l=p===i;if(o=o||l,!o){const e=i;if(i===e)if("string"==typeof t){if(!D.test(t)){const e={params:{pattern:"^https?://"}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(l=e===i,o=o||l,!o){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}l=e===i,o=o||l}}if(!o){const e={params:{}};return null===a?a=[e]:a.push(e),i++,A.errors=a,!1}if(i=s,null!==a&&(s?a.length=s:a=null),r!==i)break}}}var p=n===i}else p=!0;if(p){if(void 0!==t.cacheLocation){let n=t.cacheLocation;const r=i,s=i;let o=!1;const l=i;if(!1!==n){const e={params:{}};null===a?a=[e]:a.push(e),i++}var u=l===i;if(o=o||u,!o){const t=i;if(i===t)if("string"==typeof n){if(n.includes("!")||!0!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}u=t===i,o=o||u}if(!o){const e={params:{}};return null===a?a=[e]:a.push(e),i++,A.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),p=r===i}else p=!0;if(p){if(void 0!==t.frozen){const e=i;if("boolean"!=typeof t.frozen)return A.errors=[{params:{type:"boolean"}}],!1;p=e===i}else p=!0;if(p){if(void 0!==t.lockfileLocation){let n=t.lockfileLocation;const r=i;if(i===r){if("string"!=typeof n)return A.errors=[{params:{type:"string"}}],!1;if(n.includes("!")||!0!==e.test(n))return A.errors=[{params:{}}],!1}p=r===i}else p=!0;if(p){if(void 0!==t.proxy){const e=i;if("string"!=typeof t.proxy)return A.errors=[{params:{type:"string"}}],!1;p=e===i}else p=!0;if(p)if(void 0!==t.upgrade){const e=i;if("boolean"!=typeof t.upgrade)return A.errors=[{params:{type:"boolean"}}],!1;p=e===i}else p=!0}}}}}}}}return A.errors=a,0===i}function x(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return x.errors=[{params:{type:"object"}}],!1;{const t=a;for(const t in e)if("backend"!==t&&"entries"!==t&&"imports"!==t&&"test"!==t)return x.errors=[{params:{additionalProperty:t}}],!1;if(t===a){if(void 0!==e.backend){let t=e.backend;const n=a,r=a;let s=!1;const m=a;if(!(t instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var i=m===a;if(s=s||i,!s){const e=a;if(a==a)if(t&&"object"==typeof t&&!Array.isArray(t)){const e=a;for(const e in t)if("client"!==e&&"listen"!==e&&"protocol"!==e&&"server"!==e){const t={params:{additionalProperty:e}};null===o?o=[t]:o.push(t),a++;break}if(e===a){if(void 0!==t.client){const e=a;if("string"!=typeof t.client){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var l=e===a}else l=!0;if(l){if(void 0!==t.listen){let e=t.listen;const n=a,r=a;let s=!1;const i=a;if("number"!=typeof e){const e={params:{type:"number"}};null===o?o=[e]:o.push(e),a++}var p=i===a;if(s=s||p,!s){const t=a;if(a===t)if(e&&"object"==typeof e&&!Array.isArray(e)){if(void 0!==e.host){const t=a;if("string"!=typeof e.host){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var u=t===a}else u=!0;if(u)if(void 0!==e.port){const t=a;if("number"!=typeof e.port){const e={params:{type:"number"}};null===o?o=[e]:o.push(e),a++}u=t===a}else u=!0}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}if(p=t===a,s=s||p,!s){const t=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}p=t===a,s=s||p}}if(s)a=r,null!==o&&(r?o.length=r:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}l=n===a}else l=!0;if(l){if(void 0!==t.protocol){let e=t.protocol;const n=a;if("http"!==e&&"https"!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}l=n===a}else l=!0;if(l)if(void 0!==t.server){let e=t.server;const n=a,r=a;let s=!1;const i=a;if(a===i)if(e&&"object"==typeof e&&!Array.isArray(e));else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}var f=i===a;if(s=s||f,!s){const t=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}f=t===a,s=s||f}if(s)a=r,null!==o&&(r?o.length=r:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}l=n===a}else l=!0}}}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}i=e===a,s=s||i}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,x.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null);var c=n===a}else c=!0;if(c){if(void 0!==e.entries){const t=a;if("boolean"!=typeof e.entries)return x.errors=[{params:{type:"boolean"}}],!1;c=t===a}else c=!0;if(c){if(void 0!==e.imports){const t=a;if("boolean"!=typeof e.imports)return x.errors=[{params:{type:"boolean"}}],!1;c=t===a}else c=!0;if(c)if(void 0!==e.test){let t=e.test;const n=a,r=a;let s=!1;const i=a;if(!(t instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var m=i===a;if(s=s||m,!s){const e=a;if("string"!=typeof t){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(m=e===a,s=s||m,!s){const e=a;if(!(t instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}m=e===a,s=s||m}}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,x.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),c=n===a}else c=!0}}}}}return x.errors=o,0===a}function k(e,{instancePath:t="",parentData:r,parentDataProperty:s,rootData:o=e}={}){let a=null,i=0;if(0===i){if(!e||"object"!=typeof e||Array.isArray(e))return k.errors=[{params:{type:"object"}}],!1;{const r=i;for(const t in e)if(!n.call(v,t))return k.errors=[{params:{additionalProperty:t}}],!1;if(r===i){if(void 0!==e.asyncWebAssembly){const t=i;if("boolean"!=typeof e.asyncWebAssembly)return k.errors=[{params:{type:"boolean"}}],!1;var l=t===i}else l=!0;if(l){if(void 0!==e.backCompat){const t=i;if("boolean"!=typeof e.backCompat)return k.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.buildHttp){let n=e.buildHttp;const r=i,s=i;let u=!1;const f=i;P(n,{instancePath:t+"/buildHttp",parentData:e,parentDataProperty:"buildHttp",rootData:o})||(a=null===a?P.errors:a.concat(P.errors),i=a.length);var p=f===i;if(u=u||p,!u){const r=i;A(n,{instancePath:t+"/buildHttp",parentData:e,parentDataProperty:"buildHttp",rootData:o})||(a=null===a?A.errors:a.concat(A.errors),i=a.length),p=r===i,u=u||p}if(!u){const e={params:{}};return null===a?a=[e]:a.push(e),i++,k.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l){if(void 0!==e.cacheUnaffected){const t=i;if("boolean"!=typeof e.cacheUnaffected)return k.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.css){let t=e.css;const n=i,r=i;let s=!1;const o=i;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}var u=o===i;if(s=s||u,!s){const e=i;if(i==i)if(t&&"object"==typeof t&&!Array.isArray(t)){const e=i;for(const e in t)if("exportsOnly"!==e){const t={params:{additionalProperty:e}};null===a?a=[t]:a.push(t),i++;break}if(e===i&&void 0!==t.exportsOnly&&"boolean"!=typeof t.exportsOnly){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"object"}};null===a?a=[e]:a.push(e),i++}u=e===i,s=s||u}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,k.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.futureDefaults){const t=i;if("boolean"!=typeof e.futureDefaults)return k.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.layers){const t=i;if("boolean"!=typeof e.layers)return k.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.lazyCompilation){let n=e.lazyCompilation;const r=i,s=i;let p=!1;const u=i;if("boolean"!=typeof n){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}var f=u===i;if(p=p||f,!p){const r=i;x(n,{instancePath:t+"/lazyCompilation",parentData:e,parentDataProperty:"lazyCompilation",rootData:o})||(a=null===a?x.errors:a.concat(x.errors),i=a.length),f=r===i,p=p||f}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,k.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l){if(void 0!==e.outputModule){const t=i;if("boolean"!=typeof e.outputModule)return k.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.syncWebAssembly){const t=i;if("boolean"!=typeof e.syncWebAssembly)return k.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l)if(void 0!==e.topLevelAwait){const t=i;if("boolean"!=typeof e.topLevelAwait)return k.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0}}}}}}}}}}}}return k.errors=a,0===i}const j={validate:S};function S(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(!(e instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const n=a;if("string"!=typeof e){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(u=n===a,l=l||u,!l){const n=a;if(a===n)if(e&&"object"==typeof e&&!Array.isArray(e)){const n=a;for(const t in e)if("byLayer"!==t){let n=e[t];const r=a,s=a;let i=!1;const l=a;if(a===l)if(Array.isArray(n)){const e=n.length;for(let t=0;t<e;t++){let e=n[t];const r=a;if(a===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(r!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var f=l===a;if(i=i||f,!i){const e=a;if("boolean"!=typeof n){const e={params:{type:"boolean"}};null===o?o=[e]:o.push(e),a++}if(f=e===a,i=i||f,!i){const e=a;if("string"!=typeof n){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(f=e===a,i=i||f,!i){const e=a;if(!n||"object"!=typeof n||Array.isArray(n)){const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}f=e===a,i=i||f}}}if(i)a=s,null!==o&&(s?o.length=s:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}if(r!==a)break}if(n===a&&void 0!==e.byLayer){let n=e.byLayer;const r=a;let i=!1;const l=a;if(a===l)if(n&&"object"==typeof n&&!Array.isArray(n))for(const e in n){const r=a;if(j.validate(n[e],{instancePath:t+"/byLayer/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:n,parentDataProperty:e,rootData:s})||(o=null===o?j.validate.errors:o.concat(j.validate.errors),a=o.length),r!==a)break}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}var c=l===a;if(i=i||c,!i){const e=a;if(!(n instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}c=e===a,i=i||c}if(i)a=r,null!==o&&(r?o.length=r:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}if(u=n===a,l=l||u,!l){const t=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}u=t===a,l=l||u}}}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,S.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),S.errors=o,0===a}function C(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(a===p)if(Array.isArray(e)){const n=e.length;for(let r=0;r<n;r++){const n=a;if(S(e[r],{instancePath:t+"/"+r,parentData:e,parentDataProperty:r,rootData:s})||(o=null===o?S.errors:o.concat(S.errors),a=o.length),n!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const i=a;S(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?S.errors:o.concat(S.errors),a=o.length),u=i===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,C.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),C.errors=o,0===a}function O(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1;const u=i;if(i===u)if(Array.isArray(t)){const n=t.length;for(let r=0;r<n;r++){let n=t[r];const s=i,o=i;let l=!1,p=null;const u=i,c=i;let m=!1;const y=i;if(!(n instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var f=y===i;if(m=m||f,!m){const t=i;if(i===t)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(f=t===i,m=m||f,!m){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}f=e===i,m=m||f}}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(u===i&&(l=!0,p=0),l)i=o,null!==a&&(o?a.length=o:a=null);else{const e={params:{passingSchemas:p}};null===a?a=[e]:a.push(e),i++}if(s!==i)break}}else{const e={params:{type:"array"}};null===a?a=[e]:a.push(e),i++}var c=u===i;if(p=p||c,!p){const n=i,r=i;let s=!1;const o=i;if(!(t instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var m=o===i;if(s=s||m,!s){const n=i;if(i===n)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(m=n===i,s=s||m,!s){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}m=e===i,s=s||m}}if(s)i=r,null!==a&&(r?a.length=r:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}c=n===i,p=p||c}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,O.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),O.errors=a,0===i}function F(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return F.errors=[{params:{type:"object"}}],!1;{const n=a;for(const t in e)if("appendOnly"!==t&&"colors"!==t&&"console"!==t&&"debug"!==t&&"level"!==t&&"stream"!==t)return F.errors=[{params:{additionalProperty:t}}],!1;if(n===a){if(void 0!==e.appendOnly){const t=a;if("boolean"!=typeof e.appendOnly)return F.errors=[{params:{type:"boolean"}}],!1;var i=t===a}else i=!0;if(i){if(void 0!==e.colors){const t=a;if("boolean"!=typeof e.colors)return F.errors=[{params:{type:"boolean"}}],!1;i=t===a}else i=!0;if(i){if(void 0!==e.debug){let n=e.debug;const r=a,p=a;let u=!1;const f=a;if("boolean"!=typeof n){const e={params:{type:"boolean"}};null===o?o=[e]:o.push(e),a++}var l=f===a;if(u=u||l,!u){const r=a;O(n,{instancePath:t+"/debug",parentData:e,parentDataProperty:"debug",rootData:s})||(o=null===o?O.errors:o.concat(O.errors),a=o.length),l=r===a,u=u||l}if(!u){const e={params:{}};return null===o?o=[e]:o.push(e),a++,F.errors=o,!1}a=p,null!==o&&(p?o.length=p:o=null),i=r===a}else i=!0;if(i)if(void 0!==e.level){let t=e.level;const n=a;if("none"!==t&&"error"!==t&&"warn"!==t&&"info"!==t&&"log"!==t&&"verbose"!==t)return F.errors=[{params:{}}],!1;i=n===a}else i=!0}}}}}return F.errors=o,0===a}const R={defaultRules:{oneOf:[{$ref:"#/definitions/RuleSetRules"}]},exprContextCritical:{type:"boolean"},exprContextRecursive:{type:"boolean"},exprContextRegExp:{anyOf:[{instanceof:"RegExp"},{type:"boolean"}]},exprContextRequest:{type:"string"},generator:{$ref:"#/definitions/GeneratorOptionsByModuleType"},noParse:{$ref:"#/definitions/NoParse"},parser:{$ref:"#/definitions/ParserOptionsByModuleType"},rules:{oneOf:[{$ref:"#/definitions/RuleSetRules"}]},strictExportPresence:{type:"boolean"},strictThisContextOnImports:{type:"boolean"},unknownContextCritical:{type:"boolean"},unknownContextRecursive:{type:"boolean"},unknownContextRegExp:{anyOf:[{instanceof:"RegExp"},{type:"boolean"}]},unknownContextRequest:{type:"string"},unsafeCache:{anyOf:[{type:"boolean"},{instanceof:"Function"}]},wrappedContextCritical:{type:"boolean"},wrappedContextRecursive:{type:"boolean"},wrappedContextRegExp:{instanceof:"RegExp"}},E={assert:{type:"object",additionalProperties:{$ref:"#/definitions/RuleSetConditionOrConditions"}},compiler:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditions"}]},dependency:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditions"}]},descriptionData:{type:"object",additionalProperties:{$ref:"#/definitions/RuleSetConditionOrConditions"}},enforce:{enum:["pre","post"]},exclude:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditionsAbsolute"}]},generator:{type:"object"},include:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditionsAbsolute"}]},issuer:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditionsAbsolute"}]},issuerLayer:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditions"}]},layer:{type:"string"},loader:{oneOf:[{$ref:"#/definitions/RuleSetLoader"}]},mimetype:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditions"}]},oneOf:{type:"array",items:{oneOf:[{$ref:"#/definitions/RuleSetRule"}]}},options:{oneOf:[{$ref:"#/definitions/RuleSetLoaderOptions"}]},parser:{type:"object",additionalProperties:!0},realResource:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditionsAbsolute"}]},resolve:{type:"object",oneOf:[{$ref:"#/definitions/ResolveOptions"}]},resource:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditionsAbsolute"}]},resourceFragment:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditions"}]},resourceQuery:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditions"}]},rules:{type:"array",items:{oneOf:[{$ref:"#/definitions/RuleSetRule"}]}},scheme:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditions"}]},sideEffects:{type:"boolean"},test:{oneOf:[{$ref:"#/definitions/RuleSetConditionOrConditionsAbsolute"}]},type:{type:"string"},use:{oneOf:[{$ref:"#/definitions/RuleSetUse"}]}},$={validate:w};function z(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!Array.isArray(e))return z.errors=[{params:{type:"array"}}],!1;{const n=e.length;for(let r=0;r<n;r++){const n=a,i=a;let l=!1,p=null;const u=a;if($.validate(e[r],{instancePath:t+"/"+r,parentData:e,parentDataProperty:r,rootData:s})||(o=null===o?$.validate.errors:o.concat($.validate.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,z.errors=o,!1}if(a=i,null!==o&&(i?o.length=i:o=null),n!==a)break}}}return z.errors=o,0===a}function L(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return L.errors=[{params:{type:"object"}}],!1;{const n=a;for(const t in e)if("and"!==t&&"not"!==t&&"or"!==t)return L.errors=[{params:{additionalProperty:t}}],!1;if(n===a){if(void 0!==e.and){const n=a,r=a;let l=!1,p=null;const u=a;if(z(e.and,{instancePath:t+"/and",parentData:e,parentDataProperty:"and",rootData:s})||(o=null===o?z.errors:o.concat(z.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,L.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null);var i=n===a}else i=!0;if(i){if(void 0!==e.not){const n=a,r=a;let l=!1,p=null;const u=a;if($.validate(e.not,{instancePath:t+"/not",parentData:e,parentDataProperty:"not",rootData:s})||(o=null===o?$.validate.errors:o.concat($.validate.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,L.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),i=n===a}else i=!0;if(i)if(void 0!==e.or){const n=a,r=a;let l=!1,p=null;const u=a;if(z(e.or,{instancePath:t+"/or",parentData:e,parentDataProperty:"or",rootData:s})||(o=null===o?z.errors:o.concat(z.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,L.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),i=n===a}else i=!0}}}}return L.errors=o,0===a}function w(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(!(e instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const i=a;if("string"!=typeof e){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(u=i===a,l=l||u,!l){const i=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}if(u=i===a,l=l||u,!l){const i=a;if(L(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?L.errors:o.concat(L.errors),a=o.length),u=i===a,l=l||u,!l){const i=a;z(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?z.errors:o.concat(z.errors),a=o.length),u=i===a,l=l||u}}}}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,w.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),w.errors=o,0===a}function M(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;w(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?w.errors:o.concat(w.errors),a=o.length);var u=p===a;if(l=l||u,!l){const i=a;z(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?z.errors:o.concat(z.errors),a=o.length),u=i===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,M.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),M.errors=o,0===a}const N={validate:B};function T(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!Array.isArray(e))return T.errors=[{params:{type:"array"}}],!1;{const n=e.length;for(let r=0;r<n;r++){const n=a,i=a;let l=!1,p=null;const u=a;if(N.validate(e[r],{instancePath:t+"/"+r,parentData:e,parentDataProperty:r,rootData:s})||(o=null===o?N.validate.errors:o.concat(N.validate.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,T.errors=o,!1}if(a=i,null!==o&&(i?o.length=i:o=null),n!==a)break}}}return T.errors=o,0===a}function I(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return I.errors=[{params:{type:"object"}}],!1;{const n=a;for(const t in e)if("and"!==t&&"not"!==t&&"or"!==t)return I.errors=[{params:{additionalProperty:t}}],!1;if(n===a){if(void 0!==e.and){const n=a,r=a;let l=!1,p=null;const u=a;if(T(e.and,{instancePath:t+"/and",parentData:e,parentDataProperty:"and",rootData:s})||(o=null===o?T.errors:o.concat(T.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,I.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null);var i=n===a}else i=!0;if(i){if(void 0!==e.not){const n=a,r=a;let l=!1,p=null;const u=a;if(N.validate(e.not,{instancePath:t+"/not",parentData:e,parentDataProperty:"not",rootData:s})||(o=null===o?N.validate.errors:o.concat(N.validate.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,I.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),i=n===a}else i=!0;if(i)if(void 0!==e.or){const n=a,r=a;let l=!1,p=null;const u=a;if(T(e.or,{instancePath:t+"/or",parentData:e,parentDataProperty:"or",rootData:s})||(o=null===o?T.errors:o.concat(T.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,I.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),i=n===a}else i=!0}}}}return I.errors=o,0===a}function B(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1;const u=i;if(!(t instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var f=u===i;if(p=p||f,!p){const l=i;if(i===l)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(f=l===i,p=p||f,!p){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}if(f=e===i,p=p||f,!p){const e=i;if(I(t,{instancePath:n,parentData:r,parentDataProperty:s,rootData:o})||(a=null===a?I.errors:a.concat(I.errors),i=a.length),f=e===i,p=p||f,!p){const e=i;T(t,{instancePath:n,parentData:r,parentDataProperty:s,rootData:o})||(a=null===a?T.errors:a.concat(T.errors),i=a.length),f=e===i,p=p||f}}}}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,B.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),B.errors=a,0===i}function U(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;B(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?B.errors:o.concat(B.errors),a=o.length);var u=p===a;if(l=l||u,!l){const i=a;T(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?T.errors:o.concat(T.errors),a=o.length),u=i===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,U.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),U.errors=o,0===a}const q={alias:{$ref:"#/definitions/ResolveAlias"},aliasFields:{type:"array",items:{anyOf:[{type:"array",items:{type:"string",minLength:1}},{type:"string",minLength:1}]}},byDependency:{type:"object",additionalProperties:{oneOf:[{$ref:"#/definitions/ResolveOptions"}]}},cache:{type:"boolean"},cachePredicate:{instanceof:"Function"},cacheWithContext:{type:"boolean"},conditionNames:{type:"array",items:{type:"string"}},descriptionFiles:{type:"array",items:{type:"string",minLength:1}},enforceExtension:{type:"boolean"},exportsFields:{type:"array",items:{type:"string"}},extensions:{type:"array",items:{type:"string"}},fallback:{oneOf:[{$ref:"#/definitions/ResolveAlias"}]},fileSystem:{},fullySpecified:{type:"boolean"},importsFields:{type:"array",items:{type:"string"}},mainFields:{type:"array",items:{anyOf:[{type:"array",items:{type:"string",minLength:1}},{type:"string",minLength:1}]}},mainFiles:{type:"array",items:{type:"string",minLength:1}},modules:{type:"array",items:{type:"string",minLength:1}},plugins:{type:"array",items:{anyOf:[{enum:["..."]},{$ref:"#/definitions/ResolvePluginInstance"}]}},preferAbsolute:{type:"boolean"},preferRelative:{type:"boolean"},resolver:{},restrictions:{type:"array",items:{anyOf:[{instanceof:"RegExp"},{type:"string",absolutePath:!0,minLength:1}]}},roots:{type:"array",items:{type:"string"}},symlinks:{type:"boolean"},unsafeCache:{anyOf:[{type:"boolean"},{type:"object",additionalProperties:!0}]},useSyncFileSystemCalls:{type:"boolean"}},G={validate:W};function W(t,{instancePath:r="",parentData:s,parentDataProperty:o,rootData:a=t}={}){let i=null,l=0;if(0===l){if(!t||"object"!=typeof t||Array.isArray(t))return W.errors=[{params:{type:"object"}}],!1;{const s=l;for(const e in t)if(!n.call(q,e))return W.errors=[{params:{additionalProperty:e}}],!1;if(s===l){if(void 0!==t.alias){let e=t.alias;const n=l,r=l;let s=!1;const o=l;if(l===o)if(Array.isArray(e)){const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l;if(l===r)if(t&&"object"==typeof t&&!Array.isArray(t)){let e;if(void 0===t.alias&&(e="alias")||void 0===t.name&&(e="name")){const t={params:{missingProperty:e}};null===i?i=[t]:i.push(t),l++}else{const e=l;for(const e in t)if("alias"!==e&&"name"!==e&&"onlyModule"!==e){const t={params:{additionalProperty:e}};null===i?i=[t]:i.push(t),l++;break}if(e===l){if(void 0!==t.alias){let e=t.alias;const n=l,r=l;let s=!1;const o=l;if(l===o)if(Array.isArray(e)){const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l;if(l===r)if("string"==typeof t){if(t.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var p=o===l;if(s=s||p,!s){const t=l;if(!1!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}if(p=t===l,s=s||p,!s){const t=l;if(l===t)if("string"==typeof e){if(e.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}p=t===l,s=s||p}}if(s)l=r,null!==i&&(r?i.length=r:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}var u=n===l}else u=!0;if(u){if(void 0!==t.name){const e=l;if("string"!=typeof t.name){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}u=e===l}else u=!0;if(u)if(void 0!==t.onlyModule){const e=l;if("boolean"!=typeof t.onlyModule){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}u=e===l}else u=!0}}}}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var f=o===l;if(s=s||f,!s){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){let n=e[t];const r=l,s=l;let o=!1;const a=l;if(l===a)if(Array.isArray(n)){const e=n.length;for(let t=0;t<e;t++){let e=n[t];const r=l;if(l===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var c=a===l;if(o=o||c,!o){const e=l;if(!1!==n){const e={params:{}};null===i?i=[e]:i.push(e),l++}if(c=e===l,o=o||c,!o){const e=l;if(l===e)if("string"==typeof n){if(n.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}c=e===l,o=o||c}}if(o)l=s,null!==i&&(s?i.length=s:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}f=t===l,s=s||f}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null);var m=n===l}else m=!0;if(m){if(void 0!==t.aliasFields){let e=t.aliasFields;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l,s=l;let o=!1;const a=l;if(l===a)if(Array.isArray(t)){const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=l;if(l===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var y=a===l;if(o=o||y,!o){const e=l;if(l===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}y=e===l,o=o||y}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}if(l=s,null!==i&&(s?i.length=s:i=null),r!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.byDependency){let e=t.byDependency;const n=l;if(l===n){if(!e||"object"!=typeof e||Array.isArray(e))return W.errors=[{params:{type:"object"}}],!1;for(const t in e){const n=l,s=l;let o=!1,p=null;const u=l;if(G.validate(e[t],{instancePath:r+"/byDependency/"+t.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:e,parentDataProperty:t,rootData:a})||(i=null===i?G.validate.errors:i.concat(G.validate.errors),l=i.length),u===l&&(o=!0,p=0),!o){const e={params:{passingSchemas:p}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}if(l=s,null!==i&&(s?i.length=s:i=null),n!==l)break}}m=n===l}else m=!0;if(m){if(void 0!==t.cache){const e=l;if("boolean"!=typeof t.cache)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.cachePredicate){const e=l;if(!(t.cachePredicate instanceof Function))return W.errors=[{params:{}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.cacheWithContext){const e=l;if("boolean"!=typeof t.cacheWithContext)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.conditionNames){let e=t.conditionNames;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){const t=l;if("string"!=typeof e[n])return W.errors=[{params:{type:"string"}}],!1;if(t!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.descriptionFiles){let e=t.descriptionFiles;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l;if(l===r){if("string"!=typeof t)return W.errors=[{params:{type:"string"}}],!1;if(t.length<1)return W.errors=[{params:{}}],!1}if(r!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.enforceExtension){const e=l;if("boolean"!=typeof t.enforceExtension)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.exportsFields){let e=t.exportsFields;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){const t=l;if("string"!=typeof e[n])return W.errors=[{params:{type:"string"}}],!1;if(t!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.extensions){let e=t.extensions;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){const t=l;if("string"!=typeof e[n])return W.errors=[{params:{type:"string"}}],!1;if(t!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.fallback){let e=t.fallback;const n=l,r=l;let s=!1,o=null;const a=l,p=l;let u=!1;const f=l;if(l===f)if(Array.isArray(e)){const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l;if(l===r)if(t&&"object"==typeof t&&!Array.isArray(t)){let e;if(void 0===t.alias&&(e="alias")||void 0===t.name&&(e="name")){const t={params:{missingProperty:e}};null===i?i=[t]:i.push(t),l++}else{const e=l;for(const e in t)if("alias"!==e&&"name"!==e&&"onlyModule"!==e){const t={params:{additionalProperty:e}};null===i?i=[t]:i.push(t),l++;break}if(e===l){if(void 0!==t.alias){let e=t.alias;const n=l,r=l;let s=!1;const o=l;if(l===o)if(Array.isArray(e)){const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l;if(l===r)if("string"==typeof t){if(t.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var h=o===l;if(s=s||h,!s){const t=l;if(!1!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}if(h=t===l,s=s||h,!s){const t=l;if(l===t)if("string"==typeof e){if(e.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}h=t===l,s=s||h}}if(s)l=r,null!==i&&(r?i.length=r:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}var d=n===l}else d=!0;if(d){if(void 0!==t.name){const e=l;if("string"!=typeof t.name){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}d=e===l}else d=!0;if(d)if(void 0!==t.onlyModule){const e=l;if("boolean"!=typeof t.onlyModule){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}d=e===l}else d=!0}}}}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var g=f===l;if(u=u||g,!u){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){let n=e[t];const r=l,s=l;let o=!1;const a=l;if(l===a)if(Array.isArray(n)){const e=n.length;for(let t=0;t<e;t++){let e=n[t];const r=l;if(l===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var b=a===l;if(o=o||b,!o){const e=l;if(!1!==n){const e={params:{}};null===i?i=[e]:i.push(e),l++}if(b=e===l,o=o||b,!o){const e=l;if(l===e)if("string"==typeof n){if(n.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}b=e===l,o=o||b}}if(o)l=s,null!==i&&(s?i.length=s:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}g=t===l,u=u||g}if(u)l=p,null!==i&&(p?i.length=p:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),m=n===l}else m=!0;if(m){if(void 0!==t.fullySpecified){const e=l;if("boolean"!=typeof t.fullySpecified)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.importsFields){let e=t.importsFields;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){const t=l;if("string"!=typeof e[n])return W.errors=[{params:{type:"string"}}],!1;if(t!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.mainFields){let e=t.mainFields;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l,s=l;let o=!1;const a=l;if(l===a)if(Array.isArray(t)){const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=l;if(l===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(r!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var v=a===l;if(o=o||v,!o){const e=l;if(l===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}v=e===l,o=o||v}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}if(l=s,null!==i&&(s?i.length=s:i=null),r!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.mainFiles){let e=t.mainFiles;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l;if(l===r){if("string"!=typeof t)return W.errors=[{params:{type:"string"}}],!1;if(t.length<1)return W.errors=[{params:{}}],!1}if(r!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.modules){let e=t.modules;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l;if(l===r){if("string"!=typeof t)return W.errors=[{params:{type:"string"}}],!1;if(t.length<1)return W.errors=[{params:{}}],!1}if(r!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.plugins){let e=t.plugins;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=l,s=l;let o=!1;const a=l;if("..."!==t){const e={params:{}};null===i?i=[e]:i.push(e),l++}var D=a===l;if(o=o||D,!o){const e=l;if(l==l)if(t&&"object"==typeof t&&!Array.isArray(t)){let e;if(void 0===t.apply&&(e="apply")){const t={params:{missingProperty:e}};null===i?i=[t]:i.push(t),l++}else if(void 0!==t.apply&&!(t.apply instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}D=e===l,o=o||D}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}if(l=s,null!==i&&(s?i.length=s:i=null),r!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.preferAbsolute){const e=l;if("boolean"!=typeof t.preferAbsolute)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.preferRelative){const e=l;if("boolean"!=typeof t.preferRelative)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.restrictions){let n=t.restrictions;const r=l;if(l===r){if(!Array.isArray(n))return W.errors=[{params:{type:"array"}}],!1;{const t=n.length;for(let r=0;r<t;r++){let t=n[r];const s=l,o=l;let a=!1;const p=l;if(!(t instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}var P=p===l;if(a=a||P,!a){const n=l;if(l===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===i?i=[e]:i.push(e),l++}else if(t.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}P=n===l,a=a||P}if(!a){const e={params:{}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}if(l=o,null!==i&&(o?i.length=o:i=null),s!==l)break}}}m=r===l}else m=!0;if(m){if(void 0!==t.roots){let e=t.roots;const n=l;if(l===n){if(!Array.isArray(e))return W.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){const t=l;if("string"!=typeof e[n])return W.errors=[{params:{type:"string"}}],!1;if(t!==l)break}}}m=n===l}else m=!0;if(m){if(void 0!==t.symlinks){const e=l;if("boolean"!=typeof t.symlinks)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0;if(m){if(void 0!==t.unsafeCache){let e=t.unsafeCache;const n=l,r=l;let s=!1;const o=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}var A=o===l;if(s=s||A,!s){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e));else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}A=t===l,s=s||A}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,W.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),m=n===l}else m=!0;if(m)if(void 0!==t.useSyncFileSystemCalls){const e=l;if("boolean"!=typeof t.useSyncFileSystemCalls)return W.errors=[{params:{type:"boolean"}}],!1;m=e===l}else m=!0}}}}}}}}}}}}}}}}}}}}}}}}}}return W.errors=i,0===l}function H(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(a===p)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=a;for(const t in e)if("ident"!==t&&"loader"!==t&&"options"!==t){const e={params:{additionalProperty:t}};null===o?o=[e]:o.push(e),a++;break}if(t===a){if(void 0!==e.ident){const t=a;if("string"!=typeof e.ident){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var u=t===a}else u=!0;if(u){if(void 0!==e.loader){let t=e.loader;const n=a,r=a;let s=!1,i=null;const l=a;if(a==a)if("string"==typeof t){if(t.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(l===a&&(s=!0,i=0),s)a=r,null!==o&&(r?o.length=r:o=null);else{const e={params:{passingSchemas:i}};null===o?o=[e]:o.push(e),a++}u=n===a}else u=!0;if(u)if(void 0!==e.options){let t=e.options;const n=a,r=a;let s=!1,i=null;const l=a,p=a;let c=!1;const m=a;if("string"!=typeof t){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}var f=m===a;if(c=c||f,!c){const e=a;if(!t||"object"!=typeof t||Array.isArray(t)){const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}f=e===a,c=c||f}if(c)a=p,null!==o&&(p?o.length=p:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}if(l===a&&(s=!0,i=0),s)a=r,null!==o&&(r?o.length=r:o=null);else{const e={params:{passingSchemas:i}};null===o?o=[e]:o.push(e),a++}u=n===a}else u=!0}}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}var c=p===a;if(l=l||c,!l){const t=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}if(c=t===a,l=l||c,!l){const t=a;if(a==a)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}c=t===a,l=l||c}}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,H.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),H.errors=o,0===a}function _(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(a===p)if(Array.isArray(e)){const n=e.length;for(let r=0;r<n;r++){const n=a,i=a;let l=!1,p=null;const u=a;if(H(e[r],{instancePath:t+"/"+r,parentData:e,parentDataProperty:r,rootData:s})||(o=null===o?H.errors:o.concat(H.errors),a=o.length),u===a&&(l=!0,p=0),l)a=i,null!==o&&(i?o.length=i:o=null);else{const e={params:{passingSchemas:p}};null===o?o=[e]:o.push(e),a++}if(n!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const i=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}if(u=i===a,l=l||u,!l){const i=a;H(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?H.errors:o.concat(H.errors),a=o.length),u=i===a,l=l||u}}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,_.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),_.errors=o,0===a}const Q={validate:J};function J(e,{instancePath:t="",parentData:r,parentDataProperty:s,rootData:o=e}={}){let a=null,i=0;if(0===i){if(!e||"object"!=typeof e||Array.isArray(e))return J.errors=[{params:{type:"object"}}],!1;{const r=i;for(const t in e)if(!n.call(E,t))return J.errors=[{params:{additionalProperty:t}}],!1;if(r===i){if(void 0!==e.assert){let n=e.assert;const r=i;if(i===r){if(!n||"object"!=typeof n||Array.isArray(n))return J.errors=[{params:{type:"object"}}],!1;for(const e in n){const r=i;if(M(n[e],{instancePath:t+"/assert/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:n,parentDataProperty:e,rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),r!==i)break}}var l=r===i}else l=!0;if(l){if(void 0!==e.compiler){const n=i,r=i;let s=!1,p=null;const u=i;if(M(e.compiler,{instancePath:t+"/compiler",parentData:e,parentDataProperty:"compiler",rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.dependency){const n=i,r=i;let s=!1,p=null;const u=i;if(M(e.dependency,{instancePath:t+"/dependency",parentData:e,parentDataProperty:"dependency",rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.descriptionData){let n=e.descriptionData;const r=i;if(i===r){if(!n||"object"!=typeof n||Array.isArray(n))return J.errors=[{params:{type:"object"}}],!1;for(const e in n){const r=i;if(M(n[e],{instancePath:t+"/descriptionData/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:n,parentDataProperty:e,rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),r!==i)break}}l=r===i}else l=!0;if(l){if(void 0!==e.enforce){let t=e.enforce;const n=i;if("pre"!==t&&"post"!==t)return J.errors=[{params:{}}],!1;l=n===i}else l=!0;if(l){if(void 0!==e.exclude){const n=i,r=i;let s=!1,p=null;const u=i;if(U(e.exclude,{instancePath:t+"/exclude",parentData:e,parentDataProperty:"exclude",rootData:o})||(a=null===a?U.errors:a.concat(U.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.generator){let t=e.generator;const n=i;if(!t||"object"!=typeof t||Array.isArray(t))return J.errors=[{params:{type:"object"}}],!1;l=n===i}else l=!0;if(l){if(void 0!==e.include){const n=i,r=i;let s=!1,p=null;const u=i;if(U(e.include,{instancePath:t+"/include",parentData:e,parentDataProperty:"include",rootData:o})||(a=null===a?U.errors:a.concat(U.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.issuer){const n=i,r=i;let s=!1,p=null;const u=i;if(U(e.issuer,{instancePath:t+"/issuer",parentData:e,parentDataProperty:"issuer",rootData:o})||(a=null===a?U.errors:a.concat(U.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.issuerLayer){const n=i,r=i;let s=!1,p=null;const u=i;if(M(e.issuerLayer,{instancePath:t+"/issuerLayer",parentData:e,parentDataProperty:"issuerLayer",rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.layer){const t=i;if("string"!=typeof e.layer)return J.errors=[{params:{type:"string"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.loader){let t=e.loader;const n=i,r=i;let s=!1,o=null;const p=i;if(i==i)if("string"==typeof t){if(t.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(p===i&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.mimetype){const n=i,r=i;let s=!1,p=null;const u=i;if(M(e.mimetype,{instancePath:t+"/mimetype",parentData:e,parentDataProperty:"mimetype",rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.oneOf){let n=e.oneOf;const r=i;if(i===r){if(!Array.isArray(n))return J.errors=[{params:{type:"array"}}],!1;{const e=n.length;for(let r=0;r<e;r++){const e=i,s=i;let l=!1,p=null;const u=i;if(Q.validate(n[r],{instancePath:t+"/oneOf/"+r,parentData:n,parentDataProperty:r,rootData:o})||(a=null===a?Q.validate.errors:a.concat(Q.validate.errors),i=a.length),u===i&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}if(i=s,null!==a&&(s?a.length=s:a=null),e!==i)break}}}l=r===i}else l=!0;if(l){if(void 0!==e.options){let t=e.options;const n=i,r=i;let s=!1,o=null;const u=i,f=i;let c=!1;const m=i;if("string"!=typeof t){const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var p=m===i;if(c=c||p,!c){const e=i;if(!t||"object"!=typeof t||Array.isArray(t)){const e={params:{type:"object"}};null===a?a=[e]:a.push(e),i++}p=e===i,c=c||p}if(c)i=f,null!==a&&(f?a.length=f:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(u===i&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.parser){let t=e.parser;const n=i;if(i===n&&(!t||"object"!=typeof t||Array.isArray(t)))return J.errors=[{params:{type:"object"}}],!1;l=n===i}else l=!0;if(l){if(void 0!==e.realResource){const n=i,r=i;let s=!1,p=null;const u=i;if(U(e.realResource,{instancePath:t+"/realResource",parentData:e,parentDataProperty:"realResource",rootData:o})||(a=null===a?U.errors:a.concat(U.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.resolve){let n=e.resolve;const r=i;if(!n||"object"!=typeof n||Array.isArray(n))return J.errors=[{params:{type:"object"}}],!1;const s=i;let p=!1,u=null;const f=i;if(W(n,{instancePath:t+"/resolve",parentData:e,parentDataProperty:"resolve",rootData:o})||(a=null===a?W.errors:a.concat(W.errors),i=a.length),f===i&&(p=!0,u=0),!p){const e={params:{passingSchemas:u}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l){if(void 0!==e.resource){const n=i,r=i;let s=!1,p=null;const u=i;if(U(e.resource,{instancePath:t+"/resource",parentData:e,parentDataProperty:"resource",rootData:o})||(a=null===a?U.errors:a.concat(U.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.resourceFragment){const n=i,r=i;let s=!1,p=null;const u=i;if(M(e.resourceFragment,{instancePath:t+"/resourceFragment",parentData:e,parentDataProperty:"resourceFragment",rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.resourceQuery){const n=i,r=i;let s=!1,p=null;const u=i;if(M(e.resourceQuery,{instancePath:t+"/resourceQuery",parentData:e,parentDataProperty:"resourceQuery",rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.rules){let n=e.rules;const r=i;if(i===r){if(!Array.isArray(n))return J.errors=[{params:{type:"array"}}],!1;{const e=n.length;for(let r=0;r<e;r++){const e=i,s=i;let l=!1,p=null;const u=i;if(Q.validate(n[r],{instancePath:t+"/rules/"+r,parentData:n,parentDataProperty:r,rootData:o})||(a=null===a?Q.validate.errors:a.concat(Q.validate.errors),i=a.length),u===i&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}if(i=s,null!==a&&(s?a.length=s:a=null),e!==i)break}}}l=r===i}else l=!0;if(l){if(void 0!==e.scheme){const n=i,r=i;let s=!1,p=null;const u=i;if(M(e.scheme,{instancePath:t+"/scheme",parentData:e,parentDataProperty:"scheme",rootData:o})||(a=null===a?M.errors:a.concat(M.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.sideEffects){const t=i;if("boolean"!=typeof e.sideEffects)return J.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.test){const n=i,r=i;let s=!1,p=null;const u=i;if(U(e.test,{instancePath:t+"/test",parentData:e,parentDataProperty:"test",rootData:o})||(a=null===a?U.errors:a.concat(U.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.type){const t=i;if("string"!=typeof e.type)return J.errors=[{params:{type:"string"}}],!1;l=t===i}else l=!0;if(l)if(void 0!==e.use){const n=i,r=i;let s=!1,p=null;const u=i;if(_(e.use,{instancePath:t+"/use",parentData:e,parentDataProperty:"use",rootData:o})||(a=null===a?_.errors:a.concat(_.errors),i=a.length),u===i&&(s=!0,p=0),!s){const e={params:{passingSchemas:p}};return null===a?a=[e]:a.push(e),i++,J.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0}}}}}}}}}}}}}}}}}}}}}}}}}}}}return J.errors=a,0===i}function V(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!Array.isArray(e))return V.errors=[{params:{type:"array"}}],!1;{const n=e.length;for(let r=0;r<n;r++){let n=e[r];const l=a,p=a;let u=!1;const f=a;if("..."!==n){const e={params:{}};null===o?o=[e]:o.push(e),a++}var i=f===a;if(u=u||i,!u){const l=a;J(n,{instancePath:t+"/"+r,parentData:e,parentDataProperty:r,rootData:s})||(o=null===o?J.errors:o.concat(J.errors),a=o.length),i=l===a,u=u||i}if(!u){const e={params:{}};return null===o?o=[e]:o.push(e),a++,V.errors=o,!1}if(a=p,null!==o&&(p?o.length=p:o=null),l!==a)break}}}return V.errors=o,0===a}function Z(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(a==a)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=a;for(const t in e)if("encoding"!==t&&"mimetype"!==t){const e={params:{additionalProperty:t}};null===o?o=[e]:o.push(e),a++;break}if(t===a){if(void 0!==e.encoding){let t=e.encoding;const n=a;if(!1!==t&&"base64"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=n===a}else u=!0;if(u)if(void 0!==e.mimetype){const t=a;if("string"!=typeof e.mimetype){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}u=t===a}else u=!0}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}var f=p===a;if(l=l||f,!l){const t=a;if(!(e instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}f=t===a,l=l||f}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,Z.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),Z.errors=o,0===a}function K(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;if(0===i){if(!t||"object"!=typeof t||Array.isArray(t))return K.errors=[{params:{type:"object"}}],!1;{const r=i;for(const e in t)if("dataUrl"!==e&&"emit"!==e&&"filename"!==e&&"outputPath"!==e&&"publicPath"!==e)return K.errors=[{params:{additionalProperty:e}}],!1;if(r===i){if(void 0!==t.dataUrl){const e=i;Z(t.dataUrl,{instancePath:n+"/dataUrl",parentData:t,parentDataProperty:"dataUrl",rootData:o})||(a=null===a?Z.errors:a.concat(Z.errors),i=a.length);var l=e===i}else l=!0;if(l){if(void 0!==t.emit){const e=i;if("boolean"!=typeof t.emit)return K.errors=[{params:{type:"boolean"}}],!1;l=e===i}else l=!0;if(l){if(void 0!==t.filename){let n=t.filename;const r=i,s=i;let o=!1;const u=i;if(i===u)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}else if(n.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var p=u===i;if(o=o||p,!o){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}p=e===i,o=o||p}if(!o){const e={params:{}};return null===a?a=[e]:a.push(e),i++,K.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l){if(void 0!==t.outputPath){let n=t.outputPath;const r=i,s=i;let o=!1;const p=i;if(i===p)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var u=p===i;if(o=o||u,!o){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}u=e===i,o=o||u}if(!o){const e={params:{}};return null===a?a=[e]:a.push(e),i++,K.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l)if(void 0!==t.publicPath){let e=t.publicPath;const n=i,r=i;let s=!1;const o=i;if("string"!=typeof e){const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var f=o===i;if(s=s||f,!s){const t=i;if(!(e instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}f=t===i,s=s||f}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,K.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0}}}}}}return K.errors=a,0===i}function X(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return X.errors=[{params:{type:"object"}}],!1;{const n=a;for(const t in e)if("dataUrl"!==t)return X.errors=[{params:{additionalProperty:t}}],!1;n===a&&void 0!==e.dataUrl&&(Z(e.dataUrl,{instancePath:t+"/dataUrl",parentData:e,parentDataProperty:"dataUrl",rootData:s})||(o=null===o?Z.errors:o.concat(Z.errors),a=o.length))}}return X.errors=o,0===a}function Y(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;if(0===i){if(!t||"object"!=typeof t||Array.isArray(t))return Y.errors=[{params:{type:"object"}}],!1;{const n=i;for(const e in t)if("emit"!==e&&"filename"!==e&&"outputPath"!==e&&"publicPath"!==e)return Y.errors=[{params:{additionalProperty:e}}],!1;if(n===i){if(void 0!==t.emit){const e=i;if("boolean"!=typeof t.emit)return Y.errors=[{params:{type:"boolean"}}],!1;var l=e===i}else l=!0;if(l){if(void 0!==t.filename){let n=t.filename;const r=i,s=i;let o=!1;const u=i;if(i===u)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}else if(n.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var p=u===i;if(o=o||p,!o){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}p=e===i,o=o||p}if(!o){const e={params:{}};return null===a?a=[e]:a.push(e),i++,Y.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l){if(void 0!==t.outputPath){let n=t.outputPath;const r=i,s=i;let o=!1;const p=i;if(i===p)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var u=p===i;if(o=o||u,!o){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}u=e===i,o=o||u}if(!o){const e={params:{}};return null===a?a=[e]:a.push(e),i++,Y.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l)if(void 0!==t.publicPath){let e=t.publicPath;const n=i,r=i;let s=!1;const o=i;if("string"!=typeof e){const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var f=o===i;if(s=s||f,!s){const t=i;if(!(e instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}f=t===i,s=s||f}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,Y.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0}}}}}return Y.errors=a,0===i}function ee(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return ee.errors=[{params:{type:"object"}}],!1;{const n=a;for(const t in e)if("asset"!==t&&"asset/inline"!==t&&"asset/resource"!==t&&"javascript"!==t&&"javascript/auto"!==t&&"javascript/dynamic"!==t&&"javascript/esm"!==t){let n=e[t];const r=a;if(a===r&&(!n||"object"!=typeof n||Array.isArray(n)))return ee.errors=[{params:{type:"object"}}],!1;if(r!==a)break}if(n===a){if(void 0!==e.asset){const n=a;K(e.asset,{instancePath:t+"/asset",parentData:e,parentDataProperty:"asset",rootData:s})||(o=null===o?K.errors:o.concat(K.errors),a=o.length);var i=n===a}else i=!0;if(i){if(void 0!==e["asset/inline"]){const n=a;X(e["asset/inline"],{instancePath:t+"/asset~1inline",parentData:e,parentDataProperty:"asset/inline",rootData:s})||(o=null===o?X.errors:o.concat(X.errors),a=o.length),i=n===a}else i=!0;if(i){if(void 0!==e["asset/resource"]){const n=a;Y(e["asset/resource"],{instancePath:t+"/asset~1resource",parentData:e,parentDataProperty:"asset/resource",rootData:s})||(o=null===o?Y.errors:o.concat(Y.errors),a=o.length),i=n===a}else i=!0;if(i){if(void 0!==e.javascript){let t=e.javascript;const n=a;if(a==a){if(!t||"object"!=typeof t||Array.isArray(t))return ee.errors=[{params:{type:"object"}}],!1;for(const e in t)return ee.errors=[{params:{additionalProperty:e}}],!1}i=n===a}else i=!0;if(i){if(void 0!==e["javascript/auto"]){let t=e["javascript/auto"];const n=a;if(a==a){if(!t||"object"!=typeof t||Array.isArray(t))return ee.errors=[{params:{type:"object"}}],!1;for(const e in t)return ee.errors=[{params:{additionalProperty:e}}],!1}i=n===a}else i=!0;if(i){if(void 0!==e["javascript/dynamic"]){let t=e["javascript/dynamic"];const n=a;if(a==a){if(!t||"object"!=typeof t||Array.isArray(t))return ee.errors=[{params:{type:"object"}}],!1;for(const e in t)return ee.errors=[{params:{additionalProperty:e}}],!1}i=n===a}else i=!0;if(i)if(void 0!==e["javascript/esm"]){let t=e["javascript/esm"];const n=a;if(a==a){if(!t||"object"!=typeof t||Array.isArray(t))return ee.errors=[{params:{type:"object"}}],!1;for(const e in t)return ee.errors=[{params:{additionalProperty:e}}],!1}i=n===a}else i=!0}}}}}}}}return ee.errors=o,0===a}function te(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return te.errors=[{params:{type:"object"}}],!1;{const t=a;for(const t in e)if("dataUrlCondition"!==t)return te.errors=[{params:{additionalProperty:t}}],!1;if(t===a&&void 0!==e.dataUrlCondition){let t=e.dataUrlCondition;const n=a;let r=!1;const s=a;if(a==a)if(t&&"object"==typeof t&&!Array.isArray(t)){const e=a;for(const e in t)if("maxSize"!==e){const t={params:{additionalProperty:e}};null===o?o=[t]:o.push(t),a++;break}if(e===a&&void 0!==t.maxSize&&"number"!=typeof t.maxSize){const e={params:{type:"number"}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}var i=s===a;if(r=r||i,!r){const e=a;if(!(t instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}i=e===a,r=r||i}if(!r){const e={params:{}};return null===o?o=[e]:o.push(e),a++,te.errors=o,!1}a=n,null!==o&&(n?o.length=n:o=null)}}}return te.errors=o,0===a}function ne(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(!1!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const t=a;if(a==a)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=a;for(const t in e)if("__dirname"!==t&&"__filename"!==t&&"global"!==t){const e={params:{additionalProperty:t}};null===o?o=[e]:o.push(e),a++;break}if(t===a){if(void 0!==e.__dirname){let t=e.__dirname;const n=a;if(!1!==t&&!0!==t&&"warn-mock"!==t&&"mock"!==t&&"eval-only"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var f=n===a}else f=!0;if(f){if(void 0!==e.__filename){let t=e.__filename;const n=a;if(!1!==t&&!0!==t&&"warn-mock"!==t&&"mock"!==t&&"eval-only"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}f=n===a}else f=!0;if(f)if(void 0!==e.global){let t=e.global;const n=a;if(!1!==t&&!0!==t&&"warn"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}f=n===a}else f=!0}}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}u=t===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,ne.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),ne.errors=o,0===a}function re(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return re.errors=[{params:{type:"object"}}],!1;if(void 0!==e.amd){let t=e.amd;const n=a,r=a;let s=!1;const p=a;if(!1!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var i=p===a;if(s=s||i,!s){const e=a;if(!t||"object"!=typeof t||Array.isArray(t)){const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}i=e===a,s=s||i}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,re.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null);var l=n===a}else l=!0;if(l){if(void 0!==e.browserify){const t=a;if("boolean"!=typeof e.browserify)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.commonjs){const t=a;if("boolean"!=typeof e.commonjs)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.commonjsMagicComments){const t=a;if("boolean"!=typeof e.commonjsMagicComments)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.exportsPresence){let t=e.exportsPresence;const n=a;if("error"!==t&&"warn"!==t&&"auto"!==t&&!1!==t)return re.errors=[{params:{}}],!1;l=n===a}else l=!0;if(l){if(void 0!==e.exprContextCritical){const t=a;if("boolean"!=typeof e.exprContextCritical)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.exprContextRecursive){const t=a;if("boolean"!=typeof e.exprContextRecursive)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.exprContextRegExp){let t=e.exprContextRegExp;const n=a,r=a;let s=!1;const i=a;if(!(t instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var p=i===a;if(s=s||p,!s){const e=a;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===o?o=[e]:o.push(e),a++}p=e===a,s=s||p}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,re.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),l=n===a}else l=!0;if(l){if(void 0!==e.exprContextRequest){const t=a;if("string"!=typeof e.exprContextRequest)return re.errors=[{params:{type:"string"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.harmony){const t=a;if("boolean"!=typeof e.harmony)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.import){const t=a;if("boolean"!=typeof e.import)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.importExportsPresence){let t=e.importExportsPresence;const n=a;if("error"!==t&&"warn"!==t&&"auto"!==t&&!1!==t)return re.errors=[{params:{}}],!1;l=n===a}else l=!0;if(l){if(void 0!==e.importMeta){const t=a;if("boolean"!=typeof e.importMeta)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.importMetaContext){const t=a;if("boolean"!=typeof e.importMetaContext)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.node){const n=a;ne(e.node,{instancePath:t+"/node",parentData:e,parentDataProperty:"node",rootData:s})||(o=null===o?ne.errors:o.concat(ne.errors),a=o.length),l=n===a}else l=!0;if(l){if(void 0!==e.reexportExportsPresence){let t=e.reexportExportsPresence;const n=a;if("error"!==t&&"warn"!==t&&"auto"!==t&&!1!==t)return re.errors=[{params:{}}],!1;l=n===a}else l=!0;if(l){if(void 0!==e.requireContext){const t=a;if("boolean"!=typeof e.requireContext)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.requireEnsure){const t=a;if("boolean"!=typeof e.requireEnsure)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.requireInclude){const t=a;if("boolean"!=typeof e.requireInclude)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.requireJs){const t=a;if("boolean"!=typeof e.requireJs)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.strictExportPresence){const t=a;if("boolean"!=typeof e.strictExportPresence)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.strictThisContextOnImports){const t=a;if("boolean"!=typeof e.strictThisContextOnImports)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.system){const t=a;if("boolean"!=typeof e.system)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.unknownContextCritical){const t=a;if("boolean"!=typeof e.unknownContextCritical)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.unknownContextRecursive){const t=a;if("boolean"!=typeof e.unknownContextRecursive)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.unknownContextRegExp){let t=e.unknownContextRegExp;const n=a,r=a;let s=!1;const i=a;if(!(t instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=i===a;if(s=s||u,!s){const e=a;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===o?o=[e]:o.push(e),a++}u=e===a,s=s||u}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,re.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),l=n===a}else l=!0;if(l){if(void 0!==e.unknownContextRequest){const t=a;if("string"!=typeof e.unknownContextRequest)return re.errors=[{params:{type:"string"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.url){let t=e.url;const n=a,r=a;let s=!1;const i=a;if("relative"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var f=i===a;if(s=s||f,!s){const e=a;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===o?o=[e]:o.push(e),a++}f=e===a,s=s||f}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,re.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),l=n===a}else l=!0;if(l){if(void 0!==e.worker){let t=e.worker;const n=a,r=a;let s=!1;const i=a;if(a===i)if(Array.isArray(t)){const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=a;if(a===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}if(r!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var c=i===a;if(s=s||c,!s){const e=a;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===o?o=[e]:o.push(e),a++}c=e===a,s=s||c}if(!s){const e={params:{}};return null===o?o=[e]:o.push(e),a++,re.errors=o,!1}a=r,null!==o&&(r?o.length=r:o=null),l=n===a}else l=!0;if(l){if(void 0!==e.wrappedContextCritical){const t=a;if("boolean"!=typeof e.wrappedContextCritical)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l){if(void 0!==e.wrappedContextRecursive){const t=a;if("boolean"!=typeof e.wrappedContextRecursive)return re.errors=[{params:{type:"boolean"}}],!1;l=t===a}else l=!0;if(l)if(void 0!==e.wrappedContextRegExp){const t=a;if(!(e.wrappedContextRegExp instanceof RegExp))return re.errors=[{params:{}}],!1;l=t===a}else l=!0}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}return re.errors=o,0===a}function se(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!e||"object"!=typeof e||Array.isArray(e))return se.errors=[{params:{type:"object"}}],!1;{const n=a;for(const t in e)if("asset"!==t&&"asset/inline"!==t&&"asset/resource"!==t&&"asset/source"!==t&&"javascript"!==t&&"javascript/auto"!==t&&"javascript/dynamic"!==t&&"javascript/esm"!==t){let n=e[t];const r=a;if(a===r&&(!n||"object"!=typeof n||Array.isArray(n)))return se.errors=[{params:{type:"object"}}],!1;if(r!==a)break}if(n===a){if(void 0!==e.asset){const n=a;te(e.asset,{instancePath:t+"/asset",parentData:e,parentDataProperty:"asset",rootData:s})||(o=null===o?te.errors:o.concat(te.errors),a=o.length);var i=n===a}else i=!0;if(i){if(void 0!==e["asset/inline"]){let t=e["asset/inline"];const n=a;if(a==a){if(!t||"object"!=typeof t||Array.isArray(t))return se.errors=[{params:{type:"object"}}],!1;for(const e in t)return se.errors=[{params:{additionalProperty:e}}],!1}i=n===a}else i=!0;if(i){if(void 0!==e["asset/resource"]){let t=e["asset/resource"];const n=a;if(a==a){if(!t||"object"!=typeof t||Array.isArray(t))return se.errors=[{params:{type:"object"}}],!1;for(const e in t)return se.errors=[{params:{additionalProperty:e}}],!1}i=n===a}else i=!0;if(i){if(void 0!==e["asset/source"]){let t=e["asset/source"];const n=a;if(a==a){if(!t||"object"!=typeof t||Array.isArray(t))return se.errors=[{params:{type:"object"}}],!1;for(const e in t)return se.errors=[{params:{additionalProperty:e}}],!1}i=n===a}else i=!0;if(i){if(void 0!==e.javascript){const n=a;re(e.javascript,{instancePath:t+"/javascript",parentData:e,parentDataProperty:"javascript",rootData:s})||(o=null===o?re.errors:o.concat(re.errors),a=o.length),i=n===a}else i=!0;if(i){if(void 0!==e["javascript/auto"]){const n=a;re(e["javascript/auto"],{instancePath:t+"/javascript~1auto",parentData:e,parentDataProperty:"javascript/auto",rootData:s})||(o=null===o?re.errors:o.concat(re.errors),a=o.length),i=n===a}else i=!0;if(i){if(void 0!==e["javascript/dynamic"]){const n=a;re(e["javascript/dynamic"],{instancePath:t+"/javascript~1dynamic",parentData:e,parentDataProperty:"javascript/dynamic",rootData:s})||(o=null===o?re.errors:o.concat(re.errors),a=o.length),i=n===a}else i=!0;if(i)if(void 0!==e["javascript/esm"]){const n=a;re(e["javascript/esm"],{instancePath:t+"/javascript~1esm",parentData:e,parentDataProperty:"javascript/esm",rootData:s})||(o=null===o?re.errors:o.concat(re.errors),a=o.length),i=n===a}else i=!0}}}}}}}}}return se.errors=o,0===a}function oe(t,{instancePath:r="",parentData:s,parentDataProperty:o,rootData:a=t}={}){let i=null,l=0;if(0===l){if(!t||"object"!=typeof t||Array.isArray(t))return oe.errors=[{params:{type:"object"}}],!1;{const s=l;for(const e in t)if(!n.call(R,e))return oe.errors=[{params:{additionalProperty:e}}],!1;if(s===l){if(void 0!==t.defaultRules){const e=l,n=l;let s=!1,o=null;const u=l;if(V(t.defaultRules,{instancePath:r+"/defaultRules",parentData:t,parentDataProperty:"defaultRules",rootData:a})||(i=null===i?V.errors:i.concat(V.errors),l=i.length),u===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,oe.errors=i,!1}l=n,null!==i&&(n?i.length=n:i=null);var p=e===l}else p=!0;if(p){if(void 0!==t.exprContextCritical){const e=l;if("boolean"!=typeof t.exprContextCritical)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.exprContextRecursive){const e=l;if("boolean"!=typeof t.exprContextRecursive)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.exprContextRegExp){let e=t.exprContextRegExp;const n=l,r=l;let s=!1;const o=l;if(!(e instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}var u=o===l;if(s=s||u,!s){const t=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}u=t===l,s=s||u}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,oe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.exprContextRequest){const e=l;if("string"!=typeof t.exprContextRequest)return oe.errors=[{params:{type:"string"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.generator){const e=l;ee(t.generator,{instancePath:r+"/generator",parentData:t,parentDataProperty:"generator",rootData:a})||(i=null===i?ee.errors:i.concat(ee.errors),l=i.length),p=e===l}else p=!0;if(p){if(void 0!==t.noParse){let n=t.noParse;const r=l,s=l;let o=!1;const a=l;if(l===a)if(Array.isArray(n))if(n.length<1){const e={params:{limit:1}};null===i?i=[e]:i.push(e),l++}else{const t=n.length;for(let r=0;r<t;r++){let t=n[r];const s=l,o=l;let a=!1;const p=l;if(!(t instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}var f=p===l;if(a=a||f,!a){const n=l;if(l===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(f=n===l,a=a||f,!a){const e=l;if(!(t instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}f=e===l,a=a||f}}if(a)l=o,null!==i&&(o?i.length=o:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(s!==l)break}}else{const e={params:{type:"array"}};null===i?i=[e]:i.push(e),l++}var c=a===l;if(o=o||c,!o){const t=l;if(!(n instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}if(c=t===l,o=o||c,!o){const t=l;if(l===t)if("string"==typeof n){if(n.includes("!")||!0!==e.test(n)){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(c=t===l,o=o||c,!o){const e=l;if(!(n instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}c=e===l,o=o||c}}}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,oe.errors=i,!1}l=s,null!==i&&(s?i.length=s:i=null),p=r===l}else p=!0;if(p){if(void 0!==t.parser){const e=l;se(t.parser,{instancePath:r+"/parser",parentData:t,parentDataProperty:"parser",rootData:a})||(i=null===i?se.errors:i.concat(se.errors),l=i.length),p=e===l}else p=!0;if(p){if(void 0!==t.rules){const e=l,n=l;let s=!1,o=null;const u=l;if(V(t.rules,{instancePath:r+"/rules",parentData:t,parentDataProperty:"rules",rootData:a})||(i=null===i?V.errors:i.concat(V.errors),l=i.length),u===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,oe.errors=i,!1}l=n,null!==i&&(n?i.length=n:i=null),p=e===l}else p=!0;if(p){if(void 0!==t.strictExportPresence){const e=l;if("boolean"!=typeof t.strictExportPresence)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.strictThisContextOnImports){const e=l;if("boolean"!=typeof t.strictThisContextOnImports)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.unknownContextCritical){const e=l;if("boolean"!=typeof t.unknownContextCritical)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.unknownContextRecursive){const e=l;if("boolean"!=typeof t.unknownContextRecursive)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.unknownContextRegExp){let e=t.unknownContextRegExp;const n=l,r=l;let s=!1;const o=l;if(!(e instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}var m=o===l;if(s=s||m,!s){const t=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}m=t===l,s=s||m}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,oe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.unknownContextRequest){const e=l;if("string"!=typeof t.unknownContextRequest)return oe.errors=[{params:{type:"string"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.unsafeCache){let e=t.unsafeCache;const n=l,r=l;let s=!1;const o=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}var y=o===l;if(s=s||y,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}y=t===l,s=s||y}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,oe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.wrappedContextCritical){const e=l;if("boolean"!=typeof t.wrappedContextCritical)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.wrappedContextRecursive){const e=l;if("boolean"!=typeof t.wrappedContextRecursive)return oe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p)if(void 0!==t.wrappedContextRegExp){const e=l;if(!(t.wrappedContextRegExp instanceof RegExp))return oe.errors=[{params:{}}],!1;p=e===l}else p=!0}}}}}}}}}}}}}}}}}}}}return oe.errors=i,0===l}const ae={checkWasmTypes:{type:"boolean"},chunkIds:{enum:["natural","named","deterministic","size","total-size",!1]},concatenateModules:{type:"boolean"},emitOnErrors:{type:"boolean"},flagIncludedChunks:{type:"boolean"},innerGraph:{type:"boolean"},mangleExports:{anyOf:[{enum:["size","deterministic"]},{type:"boolean"}]},mangleWasmImports:{type:"boolean"},mergeDuplicateChunks:{type:"boolean"},minimize:{type:"boolean"},minimizer:{type:"array",items:{anyOf:[{enum:["..."]},{$ref:"#/definitions/WebpackPluginInstance"},{$ref:"#/definitions/WebpackPluginFunction"}]}},moduleIds:{enum:["natural","named","hashed","deterministic","size",!1]},noEmitOnErrors:{type:"boolean"},nodeEnv:{anyOf:[{enum:[!1]},{type:"string"}]},portableRecords:{type:"boolean"},providedExports:{type:"boolean"},realContentHash:{type:"boolean"},removeAvailableModules:{type:"boolean"},removeEmptyChunks:{type:"boolean"},runtimeChunk:{$ref:"#/definitions/OptimizationRuntimeChunk"},sideEffects:{anyOf:[{enum:["flag"]},{type:"boolean"}]},splitChunks:{anyOf:[{enum:[!1]},{$ref:"#/definitions/OptimizationSplitChunksOptions"}]},usedExports:{anyOf:[{enum:["global"]},{type:"boolean"}]}},ie={automaticNameDelimiter:{type:"string",minLength:1},cacheGroups:{type:"object",additionalProperties:{anyOf:[{enum:[!1]},{instanceof:"RegExp"},{type:"string"},{instanceof:"Function"},{$ref:"#/definitions/OptimizationSplitChunksCacheGroup"}]},not:{type:"object",additionalProperties:!0,properties:{test:{anyOf:[{instanceof:"RegExp"},{type:"string"},{instanceof:"Function"}]}},required:["test"]}},chunks:{anyOf:[{enum:["initial","async","all"]},{instanceof:"Function"}]},defaultSizeTypes:{type:"array",items:{type:"string"},minItems:1},enforceSizeThreshold:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},fallbackCacheGroup:{type:"object",additionalProperties:!1,properties:{automaticNameDelimiter:{type:"string",minLength:1},chunks:{anyOf:[{enum:["initial","async","all"]},{instanceof:"Function"}]},maxAsyncSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},maxInitialSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},maxSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minSizeReduction:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]}}},filename:{anyOf:[{type:"string",absolutePath:!1,minLength:1},{instanceof:"Function"}]},hidePathInfo:{type:"boolean"},maxAsyncRequests:{type:"number",minimum:1},maxAsyncSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},maxInitialRequests:{type:"number",minimum:1},maxInitialSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},maxSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minChunks:{type:"number",minimum:1},minRemainingSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minSizeReduction:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},name:{anyOf:[{enum:[!1]},{type:"string"},{instanceof:"Function"}]},usedExports:{type:"boolean"}},le={automaticNameDelimiter:{type:"string",minLength:1},chunks:{anyOf:[{enum:["initial","async","all"]},{instanceof:"Function"}]},enforce:{type:"boolean"},enforceSizeThreshold:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},filename:{anyOf:[{type:"string",absolutePath:!1,minLength:1},{instanceof:"Function"}]},idHint:{type:"string"},layer:{anyOf:[{instanceof:"RegExp"},{type:"string"},{instanceof:"Function"}]},maxAsyncRequests:{type:"number",minimum:1},maxAsyncSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},maxInitialRequests:{type:"number",minimum:1},maxInitialSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},maxSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minChunks:{type:"number",minimum:1},minRemainingSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minSize:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},minSizeReduction:{oneOf:[{$ref:"#/definitions/OptimizationSplitChunksSizes"}]},name:{anyOf:[{enum:[!1]},{type:"string"},{instanceof:"Function"}]},priority:{type:"number"},reuseExistingChunk:{type:"boolean"},test:{anyOf:[{instanceof:"RegExp"},{type:"string"},{instanceof:"Function"}]},type:{anyOf:[{instanceof:"RegExp"},{type:"string"},{instanceof:"Function"}]},usedExports:{type:"boolean"}};function pe(t,{instancePath:r="",parentData:s,parentDataProperty:o,rootData:a=t}={}){let i=null,l=0;if(0===l){if(!t||"object"!=typeof t||Array.isArray(t))return pe.errors=[{params:{type:"object"}}],!1;{const r=l;for(const e in t)if(!n.call(le,e))return pe.errors=[{params:{additionalProperty:e}}],!1;if(r===l){if(void 0!==t.automaticNameDelimiter){let e=t.automaticNameDelimiter;const n=l;if(l===n){if("string"!=typeof e)return pe.errors=[{params:{type:"string"}}],!1;if(e.length<1)return pe.errors=[{params:{}}],!1}var p=n===l}else p=!0;if(p){if(void 0!==t.chunks){let e=t.chunks;const n=l,r=l;let s=!1;const o=l;if("initial"!==e&&"async"!==e&&"all"!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var u=o===l;if(s=s||u,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}u=t===l,s=s||u}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.enforce){const e=l;if("boolean"!=typeof t.enforce)return pe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.enforceSizeThreshold){let e=t.enforceSizeThreshold;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let c=!1;const m=l;if(l===m)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var f=m===l;if(c=c||f,!c){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}f=t===l,c=c||f}if(c)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.filename){let n=t.filename;const r=l,s=l;let o=!1;const a=l;if(l===a)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===i?i=[e]:i.push(e),l++}else if(n.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}var c=a===l;if(o=o||c,!o){const e=l;if(!(n instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}c=e===l,o=o||c}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=s,null!==i&&(s?i.length=s:i=null),p=r===l}else p=!0;if(p){if(void 0!==t.idHint){const e=l;if("string"!=typeof t.idHint)return pe.errors=[{params:{type:"string"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.layer){let e=t.layer;const n=l,r=l;let s=!1;const o=l;if(!(e instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}var m=o===l;if(s=s||m,!s){const t=l;if("string"!=typeof e){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(m=t===l,s=s||m,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}m=t===l,s=s||m}}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.maxAsyncRequests){let e=t.maxAsyncRequests;const n=l;if(l===n){if("number"!=typeof e)return pe.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return pe.errors=[{params:{comparison:">=",limit:1}}],!1}p=n===l}else p=!0;if(p){if(void 0!==t.maxAsyncSize){let e=t.maxAsyncSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var y=c===l;if(f=f||y,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}y=t===l,f=f||y}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.maxInitialRequests){let e=t.maxInitialRequests;const n=l;if(l===n){if("number"!=typeof e)return pe.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return pe.errors=[{params:{comparison:">=",limit:1}}],!1}p=n===l}else p=!0;if(p){if(void 0!==t.maxInitialSize){let e=t.maxInitialSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var h=c===l;if(f=f||h,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}h=t===l,f=f||h}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.maxSize){let e=t.maxSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var d=c===l;if(f=f||d,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}d=t===l,f=f||d}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.minChunks){let e=t.minChunks;const n=l;if(l===n){if("number"!=typeof e)return pe.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return pe.errors=[{params:{comparison:">=",limit:1}}],!1}p=n===l}else p=!0;if(p){if(void 0!==t.minRemainingSize){let e=t.minRemainingSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var g=c===l;if(f=f||g,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}g=t===l,f=f||g}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.minSize){let e=t.minSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var b=c===l;if(f=f||b,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}b=t===l,f=f||b}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.minSizeReduction){let e=t.minSizeReduction;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var v=c===l;if(f=f||v,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}v=t===l,f=f||v}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.name){let e=t.name;const n=l,r=l;let s=!1;const o=l;if(!1!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var D=o===l;if(s=s||D,!s){const t=l;if("string"!=typeof e){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(D=t===l,s=s||D,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}D=t===l,s=s||D}}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.priority){const e=l;if("number"!=typeof t.priority)return pe.errors=[{params:{type:"number"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.reuseExistingChunk){const e=l;if("boolean"!=typeof t.reuseExistingChunk)return pe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.test){let e=t.test;const n=l,r=l;let s=!1;const o=l;if(!(e instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}var P=o===l;if(s=s||P,!s){const t=l;if("string"!=typeof e){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(P=t===l,s=s||P,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}P=t===l,s=s||P}}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.type){let e=t.type;const n=l,r=l;let s=!1;const o=l;if(!(e instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}var A=o===l;if(s=s||A,!s){const t=l;if("string"!=typeof e){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(A=t===l,s=s||A,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}A=t===l,s=s||A}}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,pe.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p)if(void 0!==t.usedExports){const e=l;if("boolean"!=typeof t.usedExports)return pe.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0}}}}}}}}}}}}}}}}}}}}}}}return pe.errors=i,0===l}function ue(t,{instancePath:r="",parentData:s,parentDataProperty:o,rootData:a=t}={}){let i=null,l=0;if(0===l){if(!t||"object"!=typeof t||Array.isArray(t))return ue.errors=[{params:{type:"object"}}],!1;{const s=l;for(const e in t)if(!n.call(ie,e))return ue.errors=[{params:{additionalProperty:e}}],!1;if(s===l){if(void 0!==t.automaticNameDelimiter){let e=t.automaticNameDelimiter;const n=l;if(l===n){if("string"!=typeof e)return ue.errors=[{params:{type:"string"}}],!1;if(e.length<1)return ue.errors=[{params:{}}],!1}var p=n===l}else p=!0;if(p){if(void 0!==t.cacheGroups){let e=t.cacheGroups;const n=l,s=l,o=l;if(l===o)if(e&&"object"==typeof e&&!Array.isArray(e)){let t;if(void 0===e.test&&(t="test")){const e={};null===i?i=[e]:i.push(e),l++}else if(void 0!==e.test){let t=e.test;const n=l;let r=!1;const s=l;if(!(t instanceof RegExp)){const e={};null===i?i=[e]:i.push(e),l++}var u=s===l;if(r=r||u,!r){const e=l;if("string"!=typeof t){const e={};null===i?i=[e]:i.push(e),l++}if(u=e===l,r=r||u,!r){const e=l;if(!(t instanceof Function)){const e={};null===i?i=[e]:i.push(e),l++}u=e===l,r=r||u}}if(r)l=n,null!==i&&(n?i.length=n:i=null);else{const e={};null===i?i=[e]:i.push(e),l++}}}else{const e={};null===i?i=[e]:i.push(e),l++}if(o===l)return ue.errors=[{params:{}}],!1;if(l=s,null!==i&&(s?i.length=s:i=null),l===n){if(!e||"object"!=typeof e||Array.isArray(e))return ue.errors=[{params:{type:"object"}}],!1;for(const t in e){let n=e[t];const s=l,o=l;let p=!1;const u=l;if(!1!==n){const e={params:{}};null===i?i=[e]:i.push(e),l++}var f=u===l;if(p=p||f,!p){const s=l;if(!(n instanceof RegExp)){const e={params:{}};null===i?i=[e]:i.push(e),l++}if(f=s===l,p=p||f,!p){const s=l;if("string"!=typeof n){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(f=s===l,p=p||f,!p){const s=l;if(!(n instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}if(f=s===l,p=p||f,!p){const s=l;pe(n,{instancePath:r+"/cacheGroups/"+t.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:e,parentDataProperty:t,rootData:a})||(i=null===i?pe.errors:i.concat(pe.errors),l=i.length),f=s===l,p=p||f}}}}if(!p){const e={params:{}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}if(l=o,null!==i&&(o?i.length=o:i=null),s!==l)break}}p=n===l}else p=!0;if(p){if(void 0!==t.chunks){let e=t.chunks;const n=l,r=l;let s=!1;const o=l;if("initial"!==e&&"async"!==e&&"all"!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var c=o===l;if(s=s||c,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}c=t===l,s=s||c}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.defaultSizeTypes){let e=t.defaultSizeTypes;const n=l;if(l===n){if(!Array.isArray(e))return ue.errors=[{params:{type:"array"}}],!1;if(e.length<1)return ue.errors=[{params:{limit:1}}],!1;{const t=e.length;for(let n=0;n<t;n++){const t=l;if("string"!=typeof e[n])return ue.errors=[{params:{type:"string"}}],!1;if(t!==l)break}}}p=n===l}else p=!0;if(p){if(void 0!==t.enforceSizeThreshold){let e=t.enforceSizeThreshold;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var m=c===l;if(f=f||m,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}m=t===l,f=f||m}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.fallbackCacheGroup){let e=t.fallbackCacheGroup;const n=l;if(l===n){if(!e||"object"!=typeof e||Array.isArray(e))return ue.errors=[{params:{type:"object"}}],!1;{const t=l;for(const t in e)if("automaticNameDelimiter"!==t&&"chunks"!==t&&"maxAsyncSize"!==t&&"maxInitialSize"!==t&&"maxSize"!==t&&"minSize"!==t&&"minSizeReduction"!==t)return ue.errors=[{params:{additionalProperty:t}}],!1;if(t===l){if(void 0!==e.automaticNameDelimiter){let t=e.automaticNameDelimiter;const n=l;if(l===n){if("string"!=typeof t)return ue.errors=[{params:{type:"string"}}],!1;if(t.length<1)return ue.errors=[{params:{}}],!1}var y=n===l}else y=!0;if(y){if(void 0!==e.chunks){let t=e.chunks;const n=l,r=l;let s=!1;const o=l;if("initial"!==t&&"async"!==t&&"all"!==t){const e={params:{}};null===i?i=[e]:i.push(e),l++}var h=o===l;if(s=s||h,!s){const e=l;if(!(t instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}h=e===l,s=s||h}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),y=n===l}else y=!0;if(y){if(void 0!==e.maxAsyncSize){let t=e.maxAsyncSize;const n=l,r=l;let s=!1,o=null;const a=l,p=l;let u=!1;const f=l;if(l===f)if("number"==typeof t){if(t<0||isNaN(t)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var d=f===l;if(u=u||d,!u){const e=l;if(l===e)if(t&&"object"==typeof t&&!Array.isArray(t))for(const e in t){const n=l;if("number"!=typeof t[e]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}d=e===l,u=u||d}if(u)l=p,null!==i&&(p?i.length=p:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),y=n===l}else y=!0;if(y){if(void 0!==e.maxInitialSize){let t=e.maxInitialSize;const n=l,r=l;let s=!1,o=null;const a=l,p=l;let u=!1;const f=l;if(l===f)if("number"==typeof t){if(t<0||isNaN(t)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var g=f===l;if(u=u||g,!u){const e=l;if(l===e)if(t&&"object"==typeof t&&!Array.isArray(t))for(const e in t){const n=l;if("number"!=typeof t[e]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}g=e===l,u=u||g}if(u)l=p,null!==i&&(p?i.length=p:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),y=n===l}else y=!0;if(y){if(void 0!==e.maxSize){let t=e.maxSize;const n=l,r=l;let s=!1,o=null;const a=l,p=l;let u=!1;const f=l;if(l===f)if("number"==typeof t){if(t<0||isNaN(t)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var b=f===l;if(u=u||b,!u){const e=l;if(l===e)if(t&&"object"==typeof t&&!Array.isArray(t))for(const e in t){const n=l;if("number"!=typeof t[e]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}b=e===l,u=u||b}if(u)l=p,null!==i&&(p?i.length=p:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),y=n===l}else y=!0;if(y){if(void 0!==e.minSize){let t=e.minSize;const n=l,r=l;let s=!1,o=null;const a=l,p=l;let u=!1;const f=l;if(l===f)if("number"==typeof t){if(t<0||isNaN(t)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var v=f===l;if(u=u||v,!u){const e=l;if(l===e)if(t&&"object"==typeof t&&!Array.isArray(t))for(const e in t){const n=l;if("number"!=typeof t[e]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}v=e===l,u=u||v}if(u)l=p,null!==i&&(p?i.length=p:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),y=n===l}else y=!0;if(y)if(void 0!==e.minSizeReduction){let t=e.minSizeReduction;const n=l,r=l;let s=!1,o=null;const a=l,p=l;let u=!1;const f=l;if(l===f)if("number"==typeof t){if(t<0||isNaN(t)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var D=f===l;if(u=u||D,!u){const e=l;if(l===e)if(t&&"object"==typeof t&&!Array.isArray(t))for(const e in t){const n=l;if("number"!=typeof t[e]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}D=e===l,u=u||D}if(u)l=p,null!==i&&(p?i.length=p:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),y=n===l}else y=!0}}}}}}}}p=n===l}else p=!0;if(p){if(void 0!==t.filename){let n=t.filename;const r=l,s=l;let o=!1;const a=l;if(l===a)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===i?i=[e]:i.push(e),l++}else if(n.length<1){const e={params:{}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}var P=a===l;if(o=o||P,!o){const e=l;if(!(n instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}P=e===l,o=o||P}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=s,null!==i&&(s?i.length=s:i=null),p=r===l}else p=!0;if(p){if(void 0!==t.hidePathInfo){const e=l;if("boolean"!=typeof t.hidePathInfo)return ue.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.maxAsyncRequests){let e=t.maxAsyncRequests;const n=l;if(l===n){if("number"!=typeof e)return ue.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return ue.errors=[{params:{comparison:">=",limit:1}}],!1}p=n===l}else p=!0;if(p){if(void 0!==t.maxAsyncSize){let e=t.maxAsyncSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var A=c===l;if(f=f||A,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}A=t===l,f=f||A}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.maxInitialRequests){let e=t.maxInitialRequests;const n=l;if(l===n){if("number"!=typeof e)return ue.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return ue.errors=[{params:{comparison:">=",limit:1}}],!1}p=n===l}else p=!0;if(p){if(void 0!==t.maxInitialSize){let e=t.maxInitialSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var x=c===l;if(f=f||x,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}x=t===l,f=f||x}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.maxSize){let e=t.maxSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var k=c===l;if(f=f||k,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}k=t===l,f=f||k}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.minChunks){let e=t.minChunks;const n=l;if(l===n){if("number"!=typeof e)return ue.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return ue.errors=[{params:{comparison:">=",limit:1}}],!1}p=n===l}else p=!0;if(p){if(void 0!==t.minRemainingSize){let e=t.minRemainingSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var j=c===l;if(f=f||j,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}j=t===l,f=f||j}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.minSize){let e=t.minSize;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var S=c===l;if(f=f||S,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}S=t===l,f=f||S}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.minSizeReduction){let e=t.minSizeReduction;const n=l,r=l;let s=!1,o=null;const a=l,u=l;let f=!1;const c=l;if(l===c)if("number"==typeof e){if(e<0||isNaN(e)){const e={params:{comparison:">=",limit:0}};null===i?i=[e]:i.push(e),l++}}else{const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}var C=c===l;if(f=f||C,!f){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e))for(const t in e){const n=l;if("number"!=typeof e[t]){const e={params:{type:"number"}};null===i?i=[e]:i.push(e),l++}if(n!==l)break}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}C=t===l,f=f||C}if(f)l=u,null!==i&&(u?i.length=u:i=null);else{const e={params:{}};null===i?i=[e]:i.push(e),l++}if(a===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.name){let e=t.name;const n=l,r=l;let s=!1;const o=l;if(!1!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var O=o===l;if(s=s||O,!s){const t=l;if("string"!=typeof e){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}if(O=t===l,s=s||O,!s){const t=l;if(!(e instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),l++}O=t===l,s=s||O}}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,ue.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p)if(void 0!==t.usedExports){const e=l;if("boolean"!=typeof t.usedExports)return ue.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0}}}}}}}}}}}}}}}}}}}}return ue.errors=i,0===l}function fe(e,{instancePath:t="",parentData:r,parentDataProperty:s,rootData:o=e}={}){let a=null,i=0;if(0===i){if(!e||"object"!=typeof e||Array.isArray(e))return fe.errors=[{params:{type:"object"}}],!1;{const r=i;for(const t in e)if(!n.call(ae,t))return fe.errors=[{params:{additionalProperty:t}}],!1;if(r===i){if(void 0!==e.checkWasmTypes){const t=i;if("boolean"!=typeof e.checkWasmTypes)return fe.errors=[{params:{type:"boolean"}}],!1;var l=t===i}else l=!0;if(l){if(void 0!==e.chunkIds){let t=e.chunkIds;const n=i;if("natural"!==t&&"named"!==t&&"deterministic"!==t&&"size"!==t&&"total-size"!==t&&!1!==t)return fe.errors=[{params:{}}],!1;l=n===i}else l=!0;if(l){if(void 0!==e.concatenateModules){const t=i;if("boolean"!=typeof e.concatenateModules)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.emitOnErrors){const t=i;if("boolean"!=typeof e.emitOnErrors)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.flagIncludedChunks){const t=i;if("boolean"!=typeof e.flagIncludedChunks)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.innerGraph){const t=i;if("boolean"!=typeof e.innerGraph)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.mangleExports){let t=e.mangleExports;const n=i,r=i;let s=!1;const o=i;if("size"!==t&&"deterministic"!==t){const e={params:{}};null===a?a=[e]:a.push(e),i++}var p=o===i;if(s=s||p,!s){const e=i;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}p=e===i,s=s||p}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,fe.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.mangleWasmImports){const t=i;if("boolean"!=typeof e.mangleWasmImports)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.mergeDuplicateChunks){const t=i;if("boolean"!=typeof e.mergeDuplicateChunks)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.minimize){const t=i;if("boolean"!=typeof e.minimize)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.minimizer){let t=e.minimizer;const n=i;if(i===n){if(!Array.isArray(t))return fe.errors=[{params:{type:"array"}}],!1;{const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=i,s=i;let o=!1;const l=i;if("..."!==e){const e={params:{}};null===a?a=[e]:a.push(e),i++}var u=l===i;if(o=o||u,!o){const t=i;if(i==i)if(e&&"object"==typeof e&&!Array.isArray(e)){let t;if(void 0===e.apply&&(t="apply")){const e={params:{missingProperty:t}};null===a?a=[e]:a.push(e),i++}else if(void 0!==e.apply&&!(e.apply instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"object"}};null===a?a=[e]:a.push(e),i++}if(u=t===i,o=o||u,!o){const t=i;if(!(e instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}u=t===i,o=o||u}}if(!o){const e={params:{}};return null===a?a=[e]:a.push(e),i++,fe.errors=a,!1}if(i=s,null!==a&&(s?a.length=s:a=null),r!==i)break}}}l=n===i}else l=!0;if(l){if(void 0!==e.moduleIds){let t=e.moduleIds;const n=i;if("natural"!==t&&"named"!==t&&"hashed"!==t&&"deterministic"!==t&&"size"!==t&&!1!==t)return fe.errors=[{params:{}}],!1;l=n===i}else l=!0;if(l){if(void 0!==e.noEmitOnErrors){const t=i;if("boolean"!=typeof e.noEmitOnErrors)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.nodeEnv){let t=e.nodeEnv;const n=i,r=i;let s=!1;const o=i;if(!1!==t){const e={params:{}};null===a?a=[e]:a.push(e),i++}var f=o===i;if(s=s||f,!s){const e=i;if("string"!=typeof t){const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}f=e===i,s=s||f}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,fe.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.portableRecords){const t=i;if("boolean"!=typeof e.portableRecords)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.providedExports){const t=i;if("boolean"!=typeof e.providedExports)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.realContentHash){const t=i;if("boolean"!=typeof e.realContentHash)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.removeAvailableModules){const t=i;if("boolean"!=typeof e.removeAvailableModules)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.removeEmptyChunks){const t=i;if("boolean"!=typeof e.removeEmptyChunks)return fe.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l){if(void 0!==e.runtimeChunk){let t=e.runtimeChunk;const n=i,r=i;let s=!1;const o=i;if("single"!==t&&"multiple"!==t){const e={params:{}};null===a?a=[e]:a.push(e),i++}var c=o===i;if(s=s||c,!s){const e=i;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}if(c=e===i,s=s||c,!s){const e=i;if(i===e)if(t&&"object"==typeof t&&!Array.isArray(t)){const e=i;for(const e in t)if("name"!==e){const t={params:{additionalProperty:e}};null===a?a=[t]:a.push(t),i++;break}if(e===i&&void 0!==t.name){let e=t.name;const n=i;let r=!1;const s=i;if("string"!=typeof e){const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var m=s===i;if(r=r||m,!r){const t=i;if(!(e instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}m=t===i,r=r||m}if(r)i=n,null!==a&&(n?a.length=n:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}}}else{const e={params:{type:"object"}};null===a?a=[e]:a.push(e),i++}c=e===i,s=s||c}}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,fe.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.sideEffects){let t=e.sideEffects;const n=i,r=i;let s=!1;const o=i;if("flag"!==t){const e={params:{}};null===a?a=[e]:a.push(e),i++}var y=o===i;if(s=s||y,!s){const e=i;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}y=e===i,s=s||y}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,fe.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0;if(l){if(void 0!==e.splitChunks){let n=e.splitChunks;const r=i,s=i;let p=!1;const u=i;if(!1!==n){const e={params:{}};null===a?a=[e]:a.push(e),i++}var h=u===i;if(p=p||h,!p){const r=i;ue(n,{instancePath:t+"/splitChunks",parentData:e,parentDataProperty:"splitChunks",rootData:o})||(a=null===a?ue.errors:a.concat(ue.errors),i=a.length),h=r===i,p=p||h}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,fe.errors=a,!1}i=s,null!==a&&(s?a.length=s:a=null),l=r===i}else l=!0;if(l)if(void 0!==e.usedExports){let t=e.usedExports;const n=i,r=i;let s=!1;const o=i;if("global"!==t){const e={params:{}};null===a?a=[e]:a.push(e),i++}var d=o===i;if(s=s||d,!s){const e=i;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}d=e===i,s=s||d}if(!s){const e={params:{}};return null===a?a=[e]:a.push(e),i++,fe.errors=a,!1}i=r,null!==a&&(r?a.length=r:a=null),l=n===i}else l=!0}}}}}}}}}}}}}}}}}}}}}}}}return fe.errors=a,0===i}const ce={assetModuleFilename:{$ref:"#/definitions/AssetModuleFilename"},asyncChunks:{type:"boolean"},auxiliaryComment:{oneOf:[{$ref:"#/definitions/AuxiliaryComment"}]},charset:{$ref:"#/definitions/Charset"},chunkFilename:{$ref:"#/definitions/ChunkFilename"},chunkFormat:{$ref:"#/definitions/ChunkFormat"},chunkLoadTimeout:{$ref:"#/definitions/ChunkLoadTimeout"},chunkLoading:{$ref:"#/definitions/ChunkLoading"},chunkLoadingGlobal:{$ref:"#/definitions/ChunkLoadingGlobal"},clean:{$ref:"#/definitions/Clean"},compareBeforeEmit:{$ref:"#/definitions/CompareBeforeEmit"},crossOriginLoading:{$ref:"#/definitions/CrossOriginLoading"},cssChunkFilename:{$ref:"#/definitions/CssChunkFilename"},cssFilename:{$ref:"#/definitions/CssFilename"},devtoolFallbackModuleFilenameTemplate:{$ref:"#/definitions/DevtoolFallbackModuleFilenameTemplate"},devtoolModuleFilenameTemplate:{$ref:"#/definitions/DevtoolModuleFilenameTemplate"},devtoolNamespace:{$ref:"#/definitions/DevtoolNamespace"},enabledChunkLoadingTypes:{$ref:"#/definitions/EnabledChunkLoadingTypes"},enabledLibraryTypes:{$ref:"#/definitions/EnabledLibraryTypes"},enabledWasmLoadingTypes:{$ref:"#/definitions/EnabledWasmLoadingTypes"},environment:{$ref:"#/definitions/Environment"},filename:{$ref:"#/definitions/Filename"},globalObject:{$ref:"#/definitions/GlobalObject"},hashDigest:{$ref:"#/definitions/HashDigest"},hashDigestLength:{$ref:"#/definitions/HashDigestLength"},hashFunction:{$ref:"#/definitions/HashFunction"},hashSalt:{$ref:"#/definitions/HashSalt"},hotUpdateChunkFilename:{$ref:"#/definitions/HotUpdateChunkFilename"},hotUpdateGlobal:{$ref:"#/definitions/HotUpdateGlobal"},hotUpdateMainFilename:{$ref:"#/definitions/HotUpdateMainFilename"},iife:{$ref:"#/definitions/Iife"},importFunctionName:{$ref:"#/definitions/ImportFunctionName"},importMetaName:{$ref:"#/definitions/ImportMetaName"},library:{$ref:"#/definitions/Library"},libraryExport:{oneOf:[{$ref:"#/definitions/LibraryExport"}]},libraryTarget:{oneOf:[{$ref:"#/definitions/LibraryType"}]},module:{$ref:"#/definitions/OutputModule"},path:{$ref:"#/definitions/Path"},pathinfo:{$ref:"#/definitions/Pathinfo"},publicPath:{$ref:"#/definitions/PublicPath"},scriptType:{$ref:"#/definitions/ScriptType"},sourceMapFilename:{$ref:"#/definitions/SourceMapFilename"},sourcePrefix:{$ref:"#/definitions/SourcePrefix"},strictModuleErrorHandling:{$ref:"#/definitions/StrictModuleErrorHandling"},strictModuleExceptionHandling:{$ref:"#/definitions/StrictModuleExceptionHandling"},trustedTypes:{anyOf:[{enum:[!0]},{type:"string",minLength:1},{$ref:"#/definitions/TrustedTypes"}]},umdNamedDefine:{oneOf:[{$ref:"#/definitions/UmdNamedDefine"}]},uniqueName:{$ref:"#/definitions/UniqueName"},wasmLoading:{$ref:"#/definitions/WasmLoading"},webassemblyModuleFilename:{$ref:"#/definitions/WebassemblyModuleFilename"},workerChunkLoading:{$ref:"#/definitions/ChunkLoading"},workerWasmLoading:{$ref:"#/definitions/WasmLoading"}},me={arrowFunction:{type:"boolean"},bigIntLiteral:{type:"boolean"},const:{type:"boolean"},destructuring:{type:"boolean"},dynamicImport:{type:"boolean"},forOf:{type:"boolean"},module:{type:"boolean"},optionalChaining:{type:"boolean"},templateLiteral:{type:"boolean"}};function ye(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1,u=null;const f=i,c=i;let m=!1;const y=i;if(i===y)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}else if(t.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var h=y===i;if(m=m||h,!m){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}h=e===i,m=m||h}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(f===i&&(p=!0,u=0),!p){const e={params:{passingSchemas:u}};return null===a?a=[e]:a.push(e),i++,ye.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),ye.errors=a,0===i}function he(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1;const u=i;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}var f=u===i;if(p=p||f,!p){const n=i;if(i==i)if(t&&"object"==typeof t&&!Array.isArray(t)){const n=i;for(const e in t)if("dry"!==e&&"keep"!==e){const t={params:{additionalProperty:e}};null===a?a=[t]:a.push(t),i++;break}if(n===i){if(void 0!==t.dry){const e=i;if("boolean"!=typeof t.dry){const e={params:{type:"boolean"}};null===a?a=[e]:a.push(e),i++}var c=e===i}else c=!0;if(c)if(void 0!==t.keep){let n=t.keep;const r=i,s=i;let o=!1;const l=i;if(!(n instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var m=l===i;if(o=o||m,!o){const t=i;if(i===t)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(m=t===i,o=o||m,!o){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}m=e===i,o=o||m}}if(o)i=s,null!==a&&(s?a.length=s:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}c=r===i}else c=!0}}else{const e={params:{type:"object"}};null===a?a=[e]:a.push(e),i++}f=n===i,p=p||f}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,he.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),he.errors=a,0===i}function de(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1,u=null;const f=i,c=i;let m=!1;const y=i;if(i===y)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}else if(t.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var h=y===i;if(m=m||h,!m){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}h=e===i,m=m||h}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(f===i&&(p=!0,u=0),!p){const e={params:{passingSchemas:u}};return null===a?a=[e]:a.push(e),i++,de.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),de.errors=a,0===i}function ge(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1,u=null;const f=i,c=i;let m=!1;const y=i;if(i===y)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}else if(t.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var h=y===i;if(m=m||h,!m){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}h=e===i,m=m||h}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(f===i&&(p=!0,u=0),!p){const e={params:{passingSchemas:u}};return null===a?a=[e]:a.push(e),i++,ge.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),ge.errors=a,0===i}function be(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!Array.isArray(e))return be.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=a,s=a;let l=!1;const p=a;if("jsonp"!==t&&"import-scripts"!==t&&"require"!==t&&"async-node"!==t&&"import"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var i=p===a;if(l=l||i,!l){const e=a;if("string"!=typeof t){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}i=e===a,l=l||i}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,be.errors=o,!1}if(a=s,null!==o&&(s?o.length=s:o=null),r!==a)break}}}return be.errors=o,0===a}function ve(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!Array.isArray(e))return ve.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=a,s=a;let l=!1;const p=a;if("var"!==t&&"module"!==t&&"assign"!==t&&"assign-properties"!==t&&"this"!==t&&"window"!==t&&"self"!==t&&"global"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"commonjs-module"!==t&&"commonjs-static"!==t&&"amd"!==t&&"amd-require"!==t&&"umd"!==t&&"umd2"!==t&&"jsonp"!==t&&"system"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var i=p===a;if(l=l||i,!l){const e=a;if("string"!=typeof t){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}i=e===a,l=l||i}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,ve.errors=o,!1}if(a=s,null!==o&&(s?o.length=s:o=null),r!==a)break}}}return ve.errors=o,0===a}function De(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!Array.isArray(e))return De.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=a,s=a;let l=!1;const p=a;if("fetch-streaming"!==t&&"fetch"!==t&&"async-node"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}var i=p===a;if(l=l||i,!l){const e=a;if("string"!=typeof t){const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}i=e===a,l=l||i}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,De.errors=o,!1}if(a=s,null!==o&&(s?o.length=s:o=null),r!==a)break}}}return De.errors=o,0===a}function Pe(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1,u=null;const f=i,c=i;let m=!1;const y=i;if(i===y)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}else if(t.length<1){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}var h=y===i;if(m=m||h,!m){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}h=e===i,m=m||h}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(f===i&&(p=!0,u=0),!p){const e={params:{passingSchemas:u}};return null===a?a=[e]:a.push(e),i++,Pe.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),Pe.errors=a,0===i}function Ae(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;u(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?u.errors:o.concat(u.errors),a=o.length);var c=p===a;if(l=l||c,!l){const i=a;f(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?f.errors:o.concat(f.errors),a=o.length),c=i===a,l=l||c}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,Ae.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),Ae.errors=o,0===a}function xe(t,{instancePath:r="",parentData:s,parentDataProperty:o,rootData:a=t}={}){let l=null,u=0;if(0===u){if(!t||"object"!=typeof t||Array.isArray(t))return xe.errors=[{params:{type:"object"}}],!1;{const s=u;for(const e in t)if(!n.call(ce,e))return xe.errors=[{params:{additionalProperty:e}}],!1;if(s===u){if(void 0!==t.assetModuleFilename){let n=t.assetModuleFilename;const r=u,s=u;let o=!1;const a=u;if(u===a)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===l?l=[e]:l.push(e),u++}}else{const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}var f=a===u;if(o=o||f,!o){const e=u;if(!(n instanceof Function)){const e={params:{}};null===l?l=[e]:l.push(e),u++}f=e===u,o=o||f}if(!o){const e={params:{}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=s,null!==l&&(s?l.length=s:l=null);var y=r===u}else y=!0;if(y){if(void 0!==t.asyncChunks){const e=u;if("boolean"!=typeof t.asyncChunks)return xe.errors=[{params:{type:"boolean"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.auxiliaryComment){const e=u,n=u;let s=!1,o=null;const i=u;if(p(t.auxiliaryComment,{instancePath:r+"/auxiliaryComment",parentData:t,parentDataProperty:"auxiliaryComment",rootData:a})||(l=null===l?p.errors:l.concat(p.errors),u=l.length),i===u&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=n,null!==l&&(n?l.length=n:l=null),y=e===u}else y=!0;if(y){if(void 0!==t.charset){const e=u;if("boolean"!=typeof t.charset)return xe.errors=[{params:{type:"boolean"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.chunkFilename){const e=u;ye(t.chunkFilename,{instancePath:r+"/chunkFilename",parentData:t,parentDataProperty:"chunkFilename",rootData:a})||(l=null===l?ye.errors:l.concat(ye.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.chunkFormat){let e=t.chunkFormat;const n=u,r=u;let s=!1;const o=u;if("array-push"!==e&&"commonjs"!==e&&"module"!==e&&!1!==e){const e={params:{}};null===l?l=[e]:l.push(e),u++}var h=o===u;if(s=s||h,!s){const t=u;if("string"!=typeof e){const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}h=t===u,s=s||h}if(!s){const e={params:{}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.chunkLoadTimeout){const e=u;if("number"!=typeof t.chunkLoadTimeout)return xe.errors=[{params:{type:"number"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.chunkLoading){const e=u;i(t.chunkLoading,{instancePath:r+"/chunkLoading",parentData:t,parentDataProperty:"chunkLoading",rootData:a})||(l=null===l?i.errors:l.concat(i.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.chunkLoadingGlobal){const e=u;if("string"!=typeof t.chunkLoadingGlobal)return xe.errors=[{params:{type:"string"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.clean){const e=u;he(t.clean,{instancePath:r+"/clean",parentData:t,parentDataProperty:"clean",rootData:a})||(l=null===l?he.errors:l.concat(he.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.compareBeforeEmit){const e=u;if("boolean"!=typeof t.compareBeforeEmit)return xe.errors=[{params:{type:"boolean"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.crossOriginLoading){let e=t.crossOriginLoading;const n=u;if(!1!==e&&"anonymous"!==e&&"use-credentials"!==e)return xe.errors=[{params:{}}],!1;y=n===u}else y=!0;if(y){if(void 0!==t.cssChunkFilename){const e=u;de(t.cssChunkFilename,{instancePath:r+"/cssChunkFilename",parentData:t,parentDataProperty:"cssChunkFilename",rootData:a})||(l=null===l?de.errors:l.concat(de.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.cssFilename){const e=u;ge(t.cssFilename,{instancePath:r+"/cssFilename",parentData:t,parentDataProperty:"cssFilename",rootData:a})||(l=null===l?ge.errors:l.concat(ge.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.devtoolFallbackModuleFilenameTemplate){let e=t.devtoolFallbackModuleFilenameTemplate;const n=u,r=u;let s=!1;const o=u;if("string"!=typeof e){const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}var d=o===u;if(s=s||d,!s){const t=u;if(!(e instanceof Function)){const e={params:{}};null===l?l=[e]:l.push(e),u++}d=t===u,s=s||d}if(!s){const e={params:{}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.devtoolModuleFilenameTemplate){let e=t.devtoolModuleFilenameTemplate;const n=u,r=u;let s=!1;const o=u;if("string"!=typeof e){const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}var g=o===u;if(s=s||g,!s){const t=u;if(!(e instanceof Function)){const e={params:{}};null===l?l=[e]:l.push(e),u++}g=t===u,s=s||g}if(!s){const e={params:{}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.devtoolNamespace){const e=u;if("string"!=typeof t.devtoolNamespace)return xe.errors=[{params:{type:"string"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.enabledChunkLoadingTypes){const e=u;be(t.enabledChunkLoadingTypes,{instancePath:r+"/enabledChunkLoadingTypes",parentData:t,parentDataProperty:"enabledChunkLoadingTypes",rootData:a})||(l=null===l?be.errors:l.concat(be.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.enabledLibraryTypes){const e=u;ve(t.enabledLibraryTypes,{instancePath:r+"/enabledLibraryTypes",parentData:t,parentDataProperty:"enabledLibraryTypes",rootData:a})||(l=null===l?ve.errors:l.concat(ve.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.enabledWasmLoadingTypes){const e=u;De(t.enabledWasmLoadingTypes,{instancePath:r+"/enabledWasmLoadingTypes",parentData:t,parentDataProperty:"enabledWasmLoadingTypes",rootData:a})||(l=null===l?De.errors:l.concat(De.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.environment){let e=t.environment;const r=u;if(u==u){if(!e||"object"!=typeof e||Array.isArray(e))return xe.errors=[{params:{type:"object"}}],!1;{const t=u;for(const t in e)if(!n.call(me,t))return xe.errors=[{params:{additionalProperty:t}}],!1;if(t===u){if(void 0!==e.arrowFunction){const t=u;if("boolean"!=typeof e.arrowFunction)return xe.errors=[{params:{type:"boolean"}}],!1;var b=t===u}else b=!0;if(b){if(void 0!==e.bigIntLiteral){const t=u;if("boolean"!=typeof e.bigIntLiteral)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0;if(b){if(void 0!==e.const){const t=u;if("boolean"!=typeof e.const)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0;if(b){if(void 0!==e.destructuring){const t=u;if("boolean"!=typeof e.destructuring)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0;if(b){if(void 0!==e.dynamicImport){const t=u;if("boolean"!=typeof e.dynamicImport)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0;if(b){if(void 0!==e.forOf){const t=u;if("boolean"!=typeof e.forOf)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0;if(b){if(void 0!==e.module){const t=u;if("boolean"!=typeof e.module)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0;if(b){if(void 0!==e.optionalChaining){const t=u;if("boolean"!=typeof e.optionalChaining)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0;if(b)if(void 0!==e.templateLiteral){const t=u;if("boolean"!=typeof e.templateLiteral)return xe.errors=[{params:{type:"boolean"}}],!1;b=t===u}else b=!0}}}}}}}}}}y=r===u}else y=!0;if(y){if(void 0!==t.filename){const e=u;Pe(t.filename,{instancePath:r+"/filename",parentData:t,parentDataProperty:"filename",rootData:a})||(l=null===l?Pe.errors:l.concat(Pe.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.globalObject){let e=t.globalObject;const n=u;if(u==u){if("string"!=typeof e)return xe.errors=[{params:{type:"string"}}],!1;if(e.length<1)return xe.errors=[{params:{}}],!1}y=n===u}else y=!0;if(y){if(void 0!==t.hashDigest){const e=u;if("string"!=typeof t.hashDigest)return xe.errors=[{params:{type:"string"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.hashDigestLength){let e=t.hashDigestLength;const n=u;if(u==u){if("number"!=typeof e)return xe.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return xe.errors=[{params:{comparison:">=",limit:1}}],!1}y=n===u}else y=!0;if(y){if(void 0!==t.hashFunction){let e=t.hashFunction;const n=u,r=u;let s=!1;const o=u;if(u===o)if("string"==typeof e){if(e.length<1){const e={params:{}};null===l?l=[e]:l.push(e),u++}}else{const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}var v=o===u;if(s=s||v,!s){const t=u;if(!(e instanceof Function)){const e={params:{}};null===l?l=[e]:l.push(e),u++}v=t===u,s=s||v}if(!s){const e={params:{}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.hashSalt){let e=t.hashSalt;const n=u;if(u==u){if("string"!=typeof e)return xe.errors=[{params:{type:"string"}}],!1;if(e.length<1)return xe.errors=[{params:{}}],!1}y=n===u}else y=!0;if(y){if(void 0!==t.hotUpdateChunkFilename){let n=t.hotUpdateChunkFilename;const r=u;if(u==u){if("string"!=typeof n)return xe.errors=[{params:{type:"string"}}],!1;if(n.includes("!")||!1!==e.test(n))return xe.errors=[{params:{}}],!1}y=r===u}else y=!0;if(y){if(void 0!==t.hotUpdateGlobal){const e=u;if("string"!=typeof t.hotUpdateGlobal)return xe.errors=[{params:{type:"string"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.hotUpdateMainFilename){let n=t.hotUpdateMainFilename;const r=u;if(u==u){if("string"!=typeof n)return xe.errors=[{params:{type:"string"}}],!1;if(n.includes("!")||!1!==e.test(n))return xe.errors=[{params:{}}],!1}y=r===u}else y=!0;if(y){if(void 0!==t.iife){const e=u;if("boolean"!=typeof t.iife)return xe.errors=[{params:{type:"boolean"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.importFunctionName){const e=u;if("string"!=typeof t.importFunctionName)return xe.errors=[{params:{type:"string"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.importMetaName){const e=u;if("string"!=typeof t.importMetaName)return xe.errors=[{params:{type:"string"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.library){const e=u;Ae(t.library,{instancePath:r+"/library",parentData:t,parentDataProperty:"library",rootData:a})||(l=null===l?Ae.errors:l.concat(Ae.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.libraryExport){let e=t.libraryExport;const n=u,r=u;let s=!1,o=null;const a=u,i=u;let p=!1;const f=u;if(u===f)if(Array.isArray(e)){const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=u;if(u===r)if("string"==typeof t){if(t.length<1){const e={params:{}};null===l?l=[e]:l.push(e),u++}}else{const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}if(r!==u)break}}else{const e={params:{type:"array"}};null===l?l=[e]:l.push(e),u++}var D=f===u;if(p=p||D,!p){const t=u;if(u===t)if("string"==typeof e){if(e.length<1){const e={params:{}};null===l?l=[e]:l.push(e),u++}}else{const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}D=t===u,p=p||D}if(p)u=i,null!==l&&(i?l.length=i:l=null);else{const e={params:{}};null===l?l=[e]:l.push(e),u++}if(a===u&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.libraryTarget){let e=t.libraryTarget;const n=u,r=u;let s=!1,o=null;const a=u,i=u;let p=!1;const f=u;if("var"!==e&&"module"!==e&&"assign"!==e&&"assign-properties"!==e&&"this"!==e&&"window"!==e&&"self"!==e&&"global"!==e&&"commonjs"!==e&&"commonjs2"!==e&&"commonjs-module"!==e&&"commonjs-static"!==e&&"amd"!==e&&"amd-require"!==e&&"umd"!==e&&"umd2"!==e&&"jsonp"!==e&&"system"!==e){const e={params:{}};null===l?l=[e]:l.push(e),u++}var P=f===u;if(p=p||P,!p){const t=u;if("string"!=typeof e){const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}P=t===u,p=p||P}if(p)u=i,null!==l&&(i?l.length=i:l=null);else{const e={params:{}};null===l?l=[e]:l.push(e),u++}if(a===u&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.module){const e=u;if("boolean"!=typeof t.module)return xe.errors=[{params:{type:"boolean"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.path){let n=t.path;const r=u;if(u==u){if("string"!=typeof n)return xe.errors=[{params:{type:"string"}}],!1;if(n.includes("!")||!0!==e.test(n))return xe.errors=[{params:{}}],!1}y=r===u}else y=!0;if(y){if(void 0!==t.pathinfo){let e=t.pathinfo;const n=u,r=u;let s=!1;const o=u;if("verbose"!==e){const e={params:{}};null===l?l=[e]:l.push(e),u++}var A=o===u;if(s=s||A,!s){const t=u;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===l?l=[e]:l.push(e),u++}A=t===u,s=s||A}if(!s){const e={params:{}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.publicPath){const e=u;c(t.publicPath,{instancePath:r+"/publicPath",parentData:t,parentDataProperty:"publicPath",rootData:a})||(l=null===l?c.errors:l.concat(c.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.scriptType){let e=t.scriptType;const n=u;if(!1!==e&&"text/javascript"!==e&&"module"!==e)return xe.errors=[{params:{}}],!1;y=n===u}else y=!0;if(y){if(void 0!==t.sourceMapFilename){let n=t.sourceMapFilename;const r=u;if(u==u){if("string"!=typeof n)return xe.errors=[{params:{type:"string"}}],!1;if(n.includes("!")||!1!==e.test(n))return xe.errors=[{params:{}}],!1}y=r===u}else y=!0;if(y){if(void 0!==t.sourcePrefix){const e=u;if("string"!=typeof t.sourcePrefix)return xe.errors=[{params:{type:"string"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.strictModuleErrorHandling){const e=u;if("boolean"!=typeof t.strictModuleErrorHandling)return xe.errors=[{params:{type:"boolean"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.strictModuleExceptionHandling){const e=u;if("boolean"!=typeof t.strictModuleExceptionHandling)return xe.errors=[{params:{type:"boolean"}}],!1;y=e===u}else y=!0;if(y){if(void 0!==t.trustedTypes){let e=t.trustedTypes;const n=u,r=u;let s=!1;const o=u;if(!0!==e){const e={params:{}};null===l?l=[e]:l.push(e),u++}var x=o===u;if(s=s||x,!s){const t=u;if(u===t)if("string"==typeof e){if(e.length<1){const e={params:{}};null===l?l=[e]:l.push(e),u++}}else{const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}if(x=t===u,s=s||x,!s){const t=u;if(u==u)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=u;for(const t in e)if("policyName"!==t){const e={params:{additionalProperty:t}};null===l?l=[e]:l.push(e),u++;break}if(t===u&&void 0!==e.policyName){let t=e.policyName;if(u==u)if("string"==typeof t){if(t.length<1){const e={params:{}};null===l?l=[e]:l.push(e),u++}}else{const e={params:{type:"string"}};null===l?l=[e]:l.push(e),u++}}}else{const e={params:{type:"object"}};null===l?l=[e]:l.push(e),u++}x=t===u,s=s||x}}if(!s){const e={params:{}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=r,null!==l&&(r?l.length=r:l=null),y=n===u}else y=!0;if(y){if(void 0!==t.umdNamedDefine){const e=u,n=u;let r=!1,s=null;const o=u;if("boolean"!=typeof t.umdNamedDefine){const e={params:{type:"boolean"}};null===l?l=[e]:l.push(e),u++}if(o===u&&(r=!0,s=0),!r){const e={params:{passingSchemas:s}};return null===l?l=[e]:l.push(e),u++,xe.errors=l,!1}u=n,null!==l&&(n?l.length=n:l=null),y=e===u}else y=!0;if(y){if(void 0!==t.uniqueName){let e=t.uniqueName;const n=u;if(u==u){if("string"!=typeof e)return xe.errors=[{params:{type:"string"}}],!1;if(e.length<1)return xe.errors=[{params:{}}],!1}y=n===u}else y=!0;if(y){if(void 0!==t.wasmLoading){const e=u;m(t.wasmLoading,{instancePath:r+"/wasmLoading",parentData:t,parentDataProperty:"wasmLoading",rootData:a})||(l=null===l?m.errors:l.concat(m.errors),u=l.length),y=e===u}else y=!0;if(y){if(void 0!==t.webassemblyModuleFilename){let n=t.webassemblyModuleFilename;const r=u;if(u==u){if("string"!=typeof n)return xe.errors=[{params:{type:"string"}}],!1;if(n.includes("!")||!1!==e.test(n))return xe.errors=[{params:{}}],!1}y=r===u}else y=!0;if(y){if(void 0!==t.workerChunkLoading){const e=u;i(t.workerChunkLoading,{instancePath:r+"/workerChunkLoading",parentData:t,parentDataProperty:"workerChunkLoading",rootData:a})||(l=null===l?i.errors:l.concat(i.errors),u=l.length),y=e===u}else y=!0;if(y)if(void 0!==t.workerWasmLoading){const e=u;m(t.workerWasmLoading,{instancePath:r+"/workerWasmLoading",parentData:t,parentDataProperty:"workerWasmLoading",rootData:a})||(l=null===l?m.errors:l.concat(m.errors),u=l.length),y=e===u}else y=!0}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}return xe.errors=l,0===u}function ke(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if(!1!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const t=a;if(a==a)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=a;for(const t in e)if("assetFilter"!==t&&"hints"!==t&&"maxAssetSize"!==t&&"maxEntrypointSize"!==t){const e={params:{additionalProperty:t}};null===o?o=[e]:o.push(e),a++;break}if(t===a){if(void 0!==e.assetFilter){const t=a;if(!(e.assetFilter instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var f=t===a}else f=!0;if(f){if(void 0!==e.hints){let t=e.hints;const n=a;if(!1!==t&&"warning"!==t&&"error"!==t){const e={params:{}};null===o?o=[e]:o.push(e),a++}f=n===a}else f=!0;if(f){if(void 0!==e.maxAssetSize){const t=a;if("number"!=typeof e.maxAssetSize){const e={params:{type:"number"}};null===o?o=[e]:o.push(e),a++}f=t===a}else f=!0;if(f)if(void 0!==e.maxEntrypointSize){const t=a;if("number"!=typeof e.maxEntrypointSize){const e={params:{type:"number"}};null===o?o=[e]:o.push(e),a++}f=t===a}else f=!0}}}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}u=t===a,l=l||u}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,ke.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),ke.errors=o,0===a}function je(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;if(0===a){if(!Array.isArray(e))return je.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=a,s=a;let l=!1;const p=a;if(a==a)if(t&&"object"==typeof t&&!Array.isArray(t)){let e;if(void 0===t.apply&&(e="apply")){const t={params:{missingProperty:e}};null===o?o=[t]:o.push(t),a++}else if(void 0!==t.apply&&!(t.apply instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"object"}};null===o?o=[e]:o.push(e),a++}var i=p===a;if(l=l||i,!l){const e=a;if(!(t instanceof Function)){const e={params:{}};null===o?o=[e]:o.push(e),a++}i=e===a,l=l||i}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,je.errors=o,!1}if(a=s,null!==o&&(s?o.length=s:o=null),r!==a)break}}}return je.errors=o,0===a}function Se(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1,p=null;const u=a;if(W(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?W.errors:o.concat(W.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,Se.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),Se.errors=o,0===a}function Ce(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1,p=null;const u=a;if(W(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?W.errors:o.concat(W.errors),a=o.length),u===a&&(l=!0,p=0),!l){const e={params:{passingSchemas:p}};return null===o?o=[e]:o.push(e),a++,Ce.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),Ce.errors=o,0===a}const Oe={all:{type:"boolean"},assets:{type:"boolean"},assetsSort:{type:"string"},assetsSpace:{type:"number"},builtAt:{type:"boolean"},cached:{type:"boolean"},cachedAssets:{type:"boolean"},cachedModules:{type:"boolean"},children:{type:"boolean"},chunkGroupAuxiliary:{type:"boolean"},chunkGroupChildren:{type:"boolean"},chunkGroupMaxAssets:{type:"number"},chunkGroups:{type:"boolean"},chunkModules:{type:"boolean"},chunkModulesSpace:{type:"number"},chunkOrigins:{type:"boolean"},chunkRelations:{type:"boolean"},chunks:{type:"boolean"},chunksSort:{type:"string"},colors:{anyOf:[{type:"boolean"},{type:"object",additionalProperties:!1,properties:{bold:{type:"string"},cyan:{type:"string"},green:{type:"string"},magenta:{type:"string"},red:{type:"string"},yellow:{type:"string"}}}]},context:{type:"string",absolutePath:!0},dependentModules:{type:"boolean"},depth:{type:"boolean"},entrypoints:{anyOf:[{enum:["auto"]},{type:"boolean"}]},env:{type:"boolean"},errorDetails:{anyOf:[{enum:["auto"]},{type:"boolean"}]},errorStack:{type:"boolean"},errors:{type:"boolean"},errorsCount:{type:"boolean"},exclude:{anyOf:[{type:"boolean"},{$ref:"#/definitions/ModuleFilterTypes"}]},excludeAssets:{oneOf:[{$ref:"#/definitions/AssetFilterTypes"}]},excludeModules:{anyOf:[{type:"boolean"},{$ref:"#/definitions/ModuleFilterTypes"}]},groupAssetsByChunk:{type:"boolean"},groupAssetsByEmitStatus:{type:"boolean"},groupAssetsByExtension:{type:"boolean"},groupAssetsByInfo:{type:"boolean"},groupAssetsByPath:{type:"boolean"},groupModulesByAttributes:{type:"boolean"},groupModulesByCacheStatus:{type:"boolean"},groupModulesByExtension:{type:"boolean"},groupModulesByLayer:{type:"boolean"},groupModulesByPath:{type:"boolean"},groupModulesByType:{type:"boolean"},groupReasonsByOrigin:{type:"boolean"},hash:{type:"boolean"},ids:{type:"boolean"},logging:{anyOf:[{enum:["none","error","warn","info","log","verbose"]},{type:"boolean"}]},loggingDebug:{anyOf:[{type:"boolean"},{$ref:"#/definitions/FilterTypes"}]},loggingTrace:{type:"boolean"},moduleAssets:{type:"boolean"},moduleTrace:{type:"boolean"},modules:{type:"boolean"},modulesSort:{type:"string"},modulesSpace:{type:"number"},nestedModules:{type:"boolean"},nestedModulesSpace:{type:"number"},optimizationBailout:{type:"boolean"},orphanModules:{type:"boolean"},outputPath:{type:"boolean"},performance:{type:"boolean"},preset:{anyOf:[{type:"boolean"},{type:"string"}]},providedExports:{type:"boolean"},publicPath:{type:"boolean"},reasons:{type:"boolean"},reasonsSpace:{type:"number"},relatedAssets:{type:"boolean"},runtime:{type:"boolean"},runtimeModules:{type:"boolean"},source:{type:"boolean"},timings:{type:"boolean"},usedExports:{type:"boolean"},version:{type:"boolean"},warnings:{type:"boolean"},warningsCount:{type:"boolean"},warningsFilter:{oneOf:[{$ref:"#/definitions/WarningFilterTypes"}]}};function Fe(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1;const u=i;if(i===u)if(Array.isArray(t)){const n=t.length;for(let r=0;r<n;r++){let n=t[r];const s=i,o=i;let l=!1,p=null;const u=i,c=i;let m=!1;const y=i;if(!(n instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var f=y===i;if(m=m||f,!m){const t=i;if(i===t)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(f=t===i,m=m||f,!m){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}f=e===i,m=m||f}}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(u===i&&(l=!0,p=0),l)i=o,null!==a&&(o?a.length=o:a=null);else{const e={params:{passingSchemas:p}};null===a?a=[e]:a.push(e),i++}if(s!==i)break}}else{const e={params:{type:"array"}};null===a?a=[e]:a.push(e),i++}var c=u===i;if(p=p||c,!p){const n=i,r=i;let s=!1;const o=i;if(!(t instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var m=o===i;if(s=s||m,!s){const n=i;if(i===n)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(m=n===i,s=s||m,!s){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}m=e===i,s=s||m}}if(s)i=r,null!==a&&(r?a.length=r:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}c=n===i,p=p||c}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,Fe.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),Fe.errors=a,0===i}function Re(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1;const u=i;if(i===u)if(Array.isArray(t)){const n=t.length;for(let r=0;r<n;r++){let n=t[r];const s=i,o=i;let l=!1,p=null;const u=i,c=i;let m=!1;const y=i;if(!(n instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var f=y===i;if(m=m||f,!m){const t=i;if(i===t)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(f=t===i,m=m||f,!m){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}f=e===i,m=m||f}}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(u===i&&(l=!0,p=0),l)i=o,null!==a&&(o?a.length=o:a=null);else{const e={params:{passingSchemas:p}};null===a?a=[e]:a.push(e),i++}if(s!==i)break}}else{const e={params:{type:"array"}};null===a?a=[e]:a.push(e),i++}var c=u===i;if(p=p||c,!p){const n=i,r=i;let s=!1;const o=i;if(!(t instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var m=o===i;if(s=s||m,!s){const n=i;if(i===n)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(m=n===i,s=s||m,!s){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}m=e===i,s=s||m}}if(s)i=r,null!==a&&(r?a.length=r:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}c=n===i,p=p||c}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,Re.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),Re.errors=a,0===i}function Ee(t,{instancePath:n="",parentData:r,parentDataProperty:s,rootData:o=t}={}){let a=null,i=0;const l=i;let p=!1;const u=i;if(i===u)if(Array.isArray(t)){const n=t.length;for(let r=0;r<n;r++){let n=t[r];const s=i,o=i;let l=!1,p=null;const u=i,c=i;let m=!1;const y=i;if(!(n instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var f=y===i;if(m=m||f,!m){const t=i;if(i===t)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(f=t===i,m=m||f,!m){const e=i;if(!(n instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}f=e===i,m=m||f}}if(m)i=c,null!==a&&(c?a.length=c:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}if(u===i&&(l=!0,p=0),l)i=o,null!==a&&(o?a.length=o:a=null);else{const e={params:{passingSchemas:p}};null===a?a=[e]:a.push(e),i++}if(s!==i)break}}else{const e={params:{type:"array"}};null===a?a=[e]:a.push(e),i++}var c=u===i;if(p=p||c,!p){const n=i,r=i;let s=!1;const o=i;if(!(t instanceof RegExp)){const e={params:{}};null===a?a=[e]:a.push(e),i++}var m=o===i;if(s=s||m,!s){const n=i;if(i===n)if("string"==typeof t){if(t.includes("!")||!1!==e.test(t)){const e={params:{}};null===a?a=[e]:a.push(e),i++}}else{const e={params:{type:"string"}};null===a?a=[e]:a.push(e),i++}if(m=n===i,s=s||m,!s){const e=i;if(!(t instanceof Function)){const e={params:{}};null===a?a=[e]:a.push(e),i++}m=e===i,s=s||m}}if(s)i=r,null!==a&&(r?a.length=r:a=null);else{const e={params:{}};null===a?a=[e]:a.push(e),i++}c=n===i,p=p||c}if(!p){const e={params:{}};return null===a?a=[e]:a.push(e),i++,Ee.errors=a,!1}return i=l,null!==a&&(l?a.length=l:a=null),Ee.errors=a,0===i}function $e(t,{instancePath:r="",parentData:s,parentDataProperty:o,rootData:a=t}={}){let i=null,l=0;if(0===l){if(!t||"object"!=typeof t||Array.isArray(t))return $e.errors=[{params:{type:"object"}}],!1;{const s=l;for(const e in t)if(!n.call(Oe,e))return $e.errors=[{params:{additionalProperty:e}}],!1;if(s===l){if(void 0!==t.all){const e=l;if("boolean"!=typeof t.all)return $e.errors=[{params:{type:"boolean"}}],!1;var p=e===l}else p=!0;if(p){if(void 0!==t.assets){const e=l;if("boolean"!=typeof t.assets)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.assetsSort){const e=l;if("string"!=typeof t.assetsSort)return $e.errors=[{params:{type:"string"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.assetsSpace){const e=l;if("number"!=typeof t.assetsSpace)return $e.errors=[{params:{type:"number"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.builtAt){const e=l;if("boolean"!=typeof t.builtAt)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.cached){const e=l;if("boolean"!=typeof t.cached)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.cachedAssets){const e=l;if("boolean"!=typeof t.cachedAssets)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.cachedModules){const e=l;if("boolean"!=typeof t.cachedModules)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.children){const e=l;if("boolean"!=typeof t.children)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkGroupAuxiliary){const e=l;if("boolean"!=typeof t.chunkGroupAuxiliary)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkGroupChildren){const e=l;if("boolean"!=typeof t.chunkGroupChildren)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkGroupMaxAssets){const e=l;if("number"!=typeof t.chunkGroupMaxAssets)return $e.errors=[{params:{type:"number"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkGroups){const e=l;if("boolean"!=typeof t.chunkGroups)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkModules){const e=l;if("boolean"!=typeof t.chunkModules)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkModulesSpace){const e=l;if("number"!=typeof t.chunkModulesSpace)return $e.errors=[{params:{type:"number"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkOrigins){const e=l;if("boolean"!=typeof t.chunkOrigins)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunkRelations){const e=l;if("boolean"!=typeof t.chunkRelations)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunks){const e=l;if("boolean"!=typeof t.chunks)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.chunksSort){const e=l;if("string"!=typeof t.chunksSort)return $e.errors=[{params:{type:"string"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.colors){let e=t.colors;const n=l,r=l;let s=!1;const o=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}var u=o===l;if(s=s||u,!s){const t=l;if(l===t)if(e&&"object"==typeof e&&!Array.isArray(e)){const t=l;for(const t in e)if("bold"!==t&&"cyan"!==t&&"green"!==t&&"magenta"!==t&&"red"!==t&&"yellow"!==t){const e={params:{additionalProperty:t}};null===i?i=[e]:i.push(e),l++;break}if(t===l){if(void 0!==e.bold){const t=l;if("string"!=typeof e.bold){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}var f=t===l}else f=!0;if(f){if(void 0!==e.cyan){const t=l;if("string"!=typeof e.cyan){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}f=t===l}else f=!0;if(f){if(void 0!==e.green){const t=l;if("string"!=typeof e.green){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}f=t===l}else f=!0;if(f){if(void 0!==e.magenta){const t=l;if("string"!=typeof e.magenta){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}f=t===l}else f=!0;if(f){if(void 0!==e.red){const t=l;if("string"!=typeof e.red){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}f=t===l}else f=!0;if(f)if(void 0!==e.yellow){const t=l;if("string"!=typeof e.yellow){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}f=t===l}else f=!0}}}}}}else{const e={params:{type:"object"}};null===i?i=[e]:i.push(e),l++}u=t===l,s=s||u}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.context){let n=t.context;const r=l;if(l===r){if("string"!=typeof n)return $e.errors=[{params:{type:"string"}}],!1;if(n.includes("!")||!0!==e.test(n))return $e.errors=[{params:{}}],!1}p=r===l}else p=!0;if(p){if(void 0!==t.dependentModules){const e=l;if("boolean"!=typeof t.dependentModules)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.depth){const e=l;if("boolean"!=typeof t.depth)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.entrypoints){let e=t.entrypoints;const n=l,r=l;let s=!1;const o=l;if("auto"!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var c=o===l;if(s=s||c,!s){const t=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}c=t===l,s=s||c}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.env){const e=l;if("boolean"!=typeof t.env)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.errorDetails){let e=t.errorDetails;const n=l,r=l;let s=!1;const o=l;if("auto"!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var m=o===l;if(s=s||m,!s){const t=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}m=t===l,s=s||m}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.errorStack){const e=l;if("boolean"!=typeof t.errorStack)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.errors){const e=l;if("boolean"!=typeof t.errors)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.errorsCount){const e=l;if("boolean"!=typeof t.errorsCount)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.exclude){let e=t.exclude;const n=l,s=l;let o=!1;const u=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}var y=u===l;if(o=o||y,!o){const n=l;Fe(e,{instancePath:r+"/exclude",parentData:t,parentDataProperty:"exclude",rootData:a})||(i=null===i?Fe.errors:i.concat(Fe.errors),l=i.length),y=n===l,o=o||y}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=s,null!==i&&(s?i.length=s:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.excludeAssets){const e=l,n=l;let s=!1,o=null;const u=l;if(Re(t.excludeAssets,{instancePath:r+"/excludeAssets",parentData:t,parentDataProperty:"excludeAssets",rootData:a})||(i=null===i?Re.errors:i.concat(Re.errors),l=i.length),u===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=n,null!==i&&(n?i.length=n:i=null),p=e===l}else p=!0;if(p){if(void 0!==t.excludeModules){let e=t.excludeModules;const n=l,s=l;let o=!1;const u=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}var h=u===l;if(o=o||h,!o){const n=l;Fe(e,{instancePath:r+"/excludeModules",parentData:t,parentDataProperty:"excludeModules",rootData:a})||(i=null===i?Fe.errors:i.concat(Fe.errors),l=i.length),h=n===l,o=o||h}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=s,null!==i&&(s?i.length=s:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.groupAssetsByChunk){const e=l;if("boolean"!=typeof t.groupAssetsByChunk)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupAssetsByEmitStatus){const e=l;if("boolean"!=typeof t.groupAssetsByEmitStatus)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupAssetsByExtension){const e=l;if("boolean"!=typeof t.groupAssetsByExtension)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupAssetsByInfo){const e=l;if("boolean"!=typeof t.groupAssetsByInfo)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupAssetsByPath){const e=l;if("boolean"!=typeof t.groupAssetsByPath)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupModulesByAttributes){const e=l;if("boolean"!=typeof t.groupModulesByAttributes)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupModulesByCacheStatus){const e=l;if("boolean"!=typeof t.groupModulesByCacheStatus)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupModulesByExtension){const e=l;if("boolean"!=typeof t.groupModulesByExtension)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupModulesByLayer){const e=l;if("boolean"!=typeof t.groupModulesByLayer)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupModulesByPath){const e=l;if("boolean"!=typeof t.groupModulesByPath)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupModulesByType){const e=l;if("boolean"!=typeof t.groupModulesByType)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.groupReasonsByOrigin){const e=l;if("boolean"!=typeof t.groupReasonsByOrigin)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.hash){const e=l;if("boolean"!=typeof t.hash)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.ids){const e=l;if("boolean"!=typeof t.ids)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.logging){let e=t.logging;const n=l,r=l;let s=!1;const o=l;if("none"!==e&&"error"!==e&&"warn"!==e&&"info"!==e&&"log"!==e&&"verbose"!==e){const e={params:{}};null===i?i=[e]:i.push(e),l++}var d=o===l;if(s=s||d,!s){const t=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}d=t===l,s=s||d}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.loggingDebug){let e=t.loggingDebug;const n=l,s=l;let o=!1;const u=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}var g=u===l;if(o=o||g,!o){const n=l;O(e,{instancePath:r+"/loggingDebug",parentData:t,parentDataProperty:"loggingDebug",rootData:a})||(i=null===i?O.errors:i.concat(O.errors),l=i.length),g=n===l,o=o||g}if(!o){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=s,null!==i&&(s?i.length=s:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.loggingTrace){const e=l;if("boolean"!=typeof t.loggingTrace)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.moduleAssets){const e=l;if("boolean"!=typeof t.moduleAssets)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.moduleTrace){const e=l;if("boolean"!=typeof t.moduleTrace)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.modules){const e=l;if("boolean"!=typeof t.modules)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.modulesSort){const e=l;if("string"!=typeof t.modulesSort)return $e.errors=[{params:{type:"string"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.modulesSpace){const e=l;if("number"!=typeof t.modulesSpace)return $e.errors=[{params:{type:"number"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.nestedModules){const e=l;if("boolean"!=typeof t.nestedModules)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.nestedModulesSpace){const e=l;if("number"!=typeof t.nestedModulesSpace)return $e.errors=[{params:{type:"number"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.optimizationBailout){const e=l;if("boolean"!=typeof t.optimizationBailout)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.orphanModules){const e=l;if("boolean"!=typeof t.orphanModules)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.outputPath){const e=l;if("boolean"!=typeof t.outputPath)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.performance){const e=l;if("boolean"!=typeof t.performance)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.preset){let e=t.preset;const n=l,r=l;let s=!1;const o=l;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===i?i=[e]:i.push(e),l++}var b=o===l;if(s=s||b,!s){const t=l;if("string"!=typeof e){const e={params:{type:"string"}};null===i?i=[e]:i.push(e),l++}b=t===l,s=s||b}if(!s){const e={params:{}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=r,null!==i&&(r?i.length=r:i=null),p=n===l}else p=!0;if(p){if(void 0!==t.providedExports){const e=l;if("boolean"!=typeof t.providedExports)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.publicPath){const e=l;if("boolean"!=typeof t.publicPath)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.reasons){const e=l;if("boolean"!=typeof t.reasons)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.reasonsSpace){const e=l;if("number"!=typeof t.reasonsSpace)return $e.errors=[{params:{type:"number"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.relatedAssets){const e=l;if("boolean"!=typeof t.relatedAssets)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.runtime){const e=l;if("boolean"!=typeof t.runtime)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.runtimeModules){const e=l;if("boolean"!=typeof t.runtimeModules)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.source){const e=l;if("boolean"!=typeof t.source)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.timings){const e=l;if("boolean"!=typeof t.timings)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.usedExports){const e=l;if("boolean"!=typeof t.usedExports)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.version){const e=l;if("boolean"!=typeof t.version)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.warnings){const e=l;if("boolean"!=typeof t.warnings)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p){if(void 0!==t.warningsCount){const e=l;if("boolean"!=typeof t.warningsCount)return $e.errors=[{params:{type:"boolean"}}],!1;p=e===l}else p=!0;if(p)if(void 0!==t.warningsFilter){const e=l,n=l;let s=!1,o=null;const u=l;if(Ee(t.warningsFilter,{instancePath:r+"/warningsFilter",parentData:t,parentDataProperty:"warningsFilter",rootData:a})||(i=null===i?Ee.errors:i.concat(Ee.errors),l=i.length),u===l&&(s=!0,o=0),!s){const e={params:{passingSchemas:o}};return null===i?i=[e]:i.push(e),l++,$e.errors=i,!1}l=n,null!==i&&(n?i.length=n:i=null),p=e===l}else p=!0}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}return $e.errors=i,0===l}function ze(e,{instancePath:t="",parentData:n,parentDataProperty:r,rootData:s=e}={}){let o=null,a=0;const i=a;let l=!1;const p=a;if("none"!==e&&"summary"!==e&&"errors-only"!==e&&"errors-warnings"!==e&&"minimal"!==e&&"normal"!==e&&"detailed"!==e&&"verbose"!==e){const e={params:{}};null===o?o=[e]:o.push(e),a++}var u=p===a;if(l=l||u,!l){const i=a;if("boolean"!=typeof e){const e={params:{type:"boolean"}};null===o?o=[e]:o.push(e),a++}if(u=i===a,l=l||u,!l){const i=a;$e(e,{instancePath:t,parentData:n,parentDataProperty:r,rootData:s})||(o=null===o?$e.errors:o.concat($e.errors),a=o.length),u=i===a,l=l||u}}if(!l){const e={params:{}};return null===o?o=[e]:o.push(e),a++,ze.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),ze.errors=o,0===a}const Le=new RegExp("^(inline-|hidden-|eval-)?(nosources-)?(cheap-(module-)?)?source-map$","u");function we(r,{instancePath:s="",parentData:a,parentDataProperty:i,rootData:l=r}={}){let p=null,u=0;if(0===u){if(!r||"object"!=typeof r||Array.isArray(r))return we.errors=[{params:{type:"object"}}],!1;{const a=u;for(const e in r)if(!n.call(t,e))return we.errors=[{params:{additionalProperty:e}}],!1;if(a===u){if(void 0!==r.amd){let e=r.amd;const t=u,n=u;let s=!1;const o=u;if(!1!==e){const e={params:{}};null===p?p=[e]:p.push(e),u++}var f=o===u;if(s=s||f,!s){const t=u;if(!e||"object"!=typeof e||Array.isArray(e)){const e={params:{type:"object"}};null===p?p=[e]:p.push(e),u++}f=t===u,s=s||f}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=n,null!==p&&(n?p.length=n:p=null);var c=t===u}else c=!0;if(c){if(void 0!==r.bail){const e=u;if("boolean"!=typeof r.bail)return we.errors=[{params:{type:"boolean"}}],!1;c=e===u}else c=!0;if(c){if(void 0!==r.cache){const e=u;o(r.cache,{instancePath:s+"/cache",parentData:r,parentDataProperty:"cache",rootData:l})||(p=null===p?o.errors:p.concat(o.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.context){let t=r.context;const n=u;if(u==u){if("string"!=typeof t)return we.errors=[{params:{type:"string"}}],!1;if(t.includes("!")||!0!==e.test(t))return we.errors=[{params:{}}],!1}c=n===u}else c=!0;if(c){if(void 0!==r.dependencies){let e=r.dependencies;const t=u;if(u==u){if(!Array.isArray(e))return we.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){const t=u;if("string"!=typeof e[n])return we.errors=[{params:{type:"string"}}],!1;if(t!==u)break}}}c=t===u}else c=!0;if(c){if(void 0!==r.devServer){let e=r.devServer;const t=u;if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;c=t===u}else c=!0;if(c){if(void 0!==r.devtool){let e=r.devtool;const t=u,n=u;let s=!1;const o=u;if(!1!==e&&"eval"!==e){const e={params:{}};null===p?p=[e]:p.push(e),u++}var m=o===u;if(s=s||m,!s){const t=u;if(u===t)if("string"==typeof e){if(!Le.test(e)){const e={params:{pattern:"^(inline-|hidden-|eval-)?(nosources-)?(cheap-(module-)?)?source-map$"}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}m=t===u,s=s||m}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=n,null!==p&&(n?p.length=n:p=null),c=t===u}else c=!0;if(c){if(void 0!==r.entry){const e=u;b(r.entry,{instancePath:s+"/entry",parentData:r,parentDataProperty:"entry",rootData:l})||(p=null===p?b.errors:p.concat(b.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.experiments){const e=u;k(r.experiments,{instancePath:s+"/experiments",parentData:r,parentDataProperty:"experiments",rootData:l})||(p=null===p?k.errors:p.concat(k.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.externals){const e=u;C(r.externals,{instancePath:s+"/externals",parentData:r,parentDataProperty:"externals",rootData:l})||(p=null===p?C.errors:p.concat(C.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.externalsPresets){let e=r.externalsPresets;const t=u;if(u==u){if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;{const t=u;for(const t in e)if("electron"!==t&&"electronMain"!==t&&"electronPreload"!==t&&"electronRenderer"!==t&&"node"!==t&&"nwjs"!==t&&"web"!==t&&"webAsync"!==t)return we.errors=[{params:{additionalProperty:t}}],!1;if(t===u){if(void 0!==e.electron){const t=u;if("boolean"!=typeof e.electron)return we.errors=[{params:{type:"boolean"}}],!1;var y=t===u}else y=!0;if(y){if(void 0!==e.electronMain){const t=u;if("boolean"!=typeof e.electronMain)return we.errors=[{params:{type:"boolean"}}],!1;y=t===u}else y=!0;if(y){if(void 0!==e.electronPreload){const t=u;if("boolean"!=typeof e.electronPreload)return we.errors=[{params:{type:"boolean"}}],!1;y=t===u}else y=!0;if(y){if(void 0!==e.electronRenderer){const t=u;if("boolean"!=typeof e.electronRenderer)return we.errors=[{params:{type:"boolean"}}],!1;y=t===u}else y=!0;if(y){if(void 0!==e.node){const t=u;if("boolean"!=typeof e.node)return we.errors=[{params:{type:"boolean"}}],!1;y=t===u}else y=!0;if(y){if(void 0!==e.nwjs){const t=u;if("boolean"!=typeof e.nwjs)return we.errors=[{params:{type:"boolean"}}],!1;y=t===u}else y=!0;if(y){if(void 0!==e.web){const t=u;if("boolean"!=typeof e.web)return we.errors=[{params:{type:"boolean"}}],!1;y=t===u}else y=!0;if(y)if(void 0!==e.webAsync){const t=u;if("boolean"!=typeof e.webAsync)return we.errors=[{params:{type:"boolean"}}],!1;y=t===u}else y=!0}}}}}}}}}c=t===u}else c=!0;if(c){if(void 0!==r.externalsType){let e=r.externalsType;const t=u;if("var"!==e&&"module"!==e&&"assign"!==e&&"this"!==e&&"window"!==e&&"self"!==e&&"global"!==e&&"commonjs"!==e&&"commonjs2"!==e&&"commonjs-module"!==e&&"commonjs-static"!==e&&"amd"!==e&&"amd-require"!==e&&"umd"!==e&&"umd2"!==e&&"jsonp"!==e&&"system"!==e&&"promise"!==e&&"import"!==e&&"script"!==e&&"node-commonjs"!==e)return we.errors=[{params:{}}],!1;c=t===u}else c=!0;if(c){if(void 0!==r.ignoreWarnings){let e=r.ignoreWarnings;const t=u;if(u==u){if(!Array.isArray(e))return we.errors=[{params:{type:"array"}}],!1;{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=u,s=u;let o=!1;const a=u;if(!(t instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}var h=a===u;if(o=o||h,!o){const e=u;if(u===e)if(t&&"object"==typeof t&&!Array.isArray(t)){const e=u;for(const e in t)if("file"!==e&&"message"!==e&&"module"!==e){const t={params:{additionalProperty:e}};null===p?p=[t]:p.push(t),u++;break}if(e===u){if(void 0!==t.file){const e=u;if(!(t.file instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}var d=e===u}else d=!0;if(d){if(void 0!==t.message){const e=u;if(!(t.message instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0;if(d)if(void 0!==t.module){const e=u;if(!(t.module instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}d=e===u}else d=!0}}}else{const e={params:{type:"object"}};null===p?p=[e]:p.push(e),u++}if(h=e===u,o=o||h,!o){const e=u;if(!(t instanceof Function)){const e={params:{}};null===p?p=[e]:p.push(e),u++}h=e===u,o=o||h}}if(!o){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}if(u=s,null!==p&&(s?p.length=s:p=null),r!==u)break}}}c=t===u}else c=!0;if(c){if(void 0!==r.infrastructureLogging){const e=u;F(r.infrastructureLogging,{instancePath:s+"/infrastructureLogging",parentData:r,parentDataProperty:"infrastructureLogging",rootData:l})||(p=null===p?F.errors:p.concat(F.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.loader){let e=r.loader;const t=u;if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;c=t===u}else c=!0;if(c){if(void 0!==r.mode){let e=r.mode;const t=u;if("development"!==e&&"production"!==e&&"none"!==e)return we.errors=[{params:{}}],!1;c=t===u}else c=!0;if(c){if(void 0!==r.module){const e=u;oe(r.module,{instancePath:s+"/module",parentData:r,parentDataProperty:"module",rootData:l})||(p=null===p?oe.errors:p.concat(oe.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.name){const e=u;if("string"!=typeof r.name)return we.errors=[{params:{type:"string"}}],!1;c=e===u}else c=!0;if(c){if(void 0!==r.node){const e=u;ne(r.node,{instancePath:s+"/node",parentData:r,parentDataProperty:"node",rootData:l})||(p=null===p?ne.errors:p.concat(ne.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.optimization){const e=u;fe(r.optimization,{instancePath:s+"/optimization",parentData:r,parentDataProperty:"optimization",rootData:l})||(p=null===p?fe.errors:p.concat(fe.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.output){const e=u;xe(r.output,{instancePath:s+"/output",parentData:r,parentDataProperty:"output",rootData:l})||(p=null===p?xe.errors:p.concat(xe.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.parallelism){let e=r.parallelism;const t=u;if(u==u){if("number"!=typeof e)return we.errors=[{params:{type:"number"}}],!1;if(e<1||isNaN(e))return we.errors=[{params:{comparison:">=",limit:1}}],!1}c=t===u}else c=!0;if(c){if(void 0!==r.performance){const e=u;ke(r.performance,{instancePath:s+"/performance",parentData:r,parentDataProperty:"performance",rootData:l})||(p=null===p?ke.errors:p.concat(ke.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.plugins){const e=u;je(r.plugins,{instancePath:s+"/plugins",parentData:r,parentDataProperty:"plugins",rootData:l})||(p=null===p?je.errors:p.concat(je.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.profile){const e=u;if("boolean"!=typeof r.profile)return we.errors=[{params:{type:"boolean"}}],!1;c=e===u}else c=!0;if(c){if(void 0!==r.recordsInputPath){let t=r.recordsInputPath;const n=u,s=u;let o=!1;const a=u;if(!1!==t){const e={params:{}};null===p?p=[e]:p.push(e),u++}var g=a===u;if(o=o||g,!o){const n=u;if(u===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}g=n===u,o=o||g}if(!o){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=s,null!==p&&(s?p.length=s:p=null),c=n===u}else c=!0;if(c){if(void 0!==r.recordsOutputPath){let t=r.recordsOutputPath;const n=u,s=u;let o=!1;const a=u;if(!1!==t){const e={params:{}};null===p?p=[e]:p.push(e),u++}var v=a===u;if(o=o||v,!o){const n=u;if(u===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}v=n===u,o=o||v}if(!o){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=s,null!==p&&(s?p.length=s:p=null),c=n===u}else c=!0;if(c){if(void 0!==r.recordsPath){let t=r.recordsPath;const n=u,s=u;let o=!1;const a=u;if(!1!==t){const e={params:{}};null===p?p=[e]:p.push(e),u++}var D=a===u;if(o=o||D,!o){const n=u;if(u===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}D=n===u,o=o||D}if(!o){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=s,null!==p&&(s?p.length=s:p=null),c=n===u}else c=!0;if(c){if(void 0!==r.resolve){const e=u;Se(r.resolve,{instancePath:s+"/resolve",parentData:r,parentDataProperty:"resolve",rootData:l})||(p=null===p?Se.errors:p.concat(Se.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.resolveLoader){const e=u;Ce(r.resolveLoader,{instancePath:s+"/resolveLoader",parentData:r,parentDataProperty:"resolveLoader",rootData:l})||(p=null===p?Ce.errors:p.concat(Ce.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.snapshot){let t=r.snapshot;const n=u;if(u==u){if(!t||"object"!=typeof t||Array.isArray(t))return we.errors=[{params:{type:"object"}}],!1;{const n=u;for(const e in t)if("buildDependencies"!==e&&"immutablePaths"!==e&&"managedPaths"!==e&&"module"!==e&&"resolve"!==e&&"resolveBuildDependencies"!==e)return we.errors=[{params:{additionalProperty:e}}],!1;if(n===u){if(void 0!==t.buildDependencies){let e=t.buildDependencies;const n=u;if(u===n){if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;{const t=u;for(const t in e)if("hash"!==t&&"timestamp"!==t)return we.errors=[{params:{additionalProperty:t}}],!1;if(t===u){if(void 0!==e.hash){const t=u;if("boolean"!=typeof e.hash)return we.errors=[{params:{type:"boolean"}}],!1;var P=t===u}else P=!0;if(P)if(void 0!==e.timestamp){const t=u;if("boolean"!=typeof e.timestamp)return we.errors=[{params:{type:"boolean"}}],!1;P=t===u}else P=!0}}}var A=n===u}else A=!0;if(A){if(void 0!==t.immutablePaths){let n=t.immutablePaths;const r=u;if(u===r){if(!Array.isArray(n))return we.errors=[{params:{type:"array"}}],!1;{const t=n.length;for(let r=0;r<t;r++){let t=n[r];const s=u,o=u;let a=!1;const i=u;if(!(t instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}var x=i===u;if(a=a||x,!a){const n=u;if(u===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===p?p=[e]:p.push(e),u++}else if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}x=n===u,a=a||x}if(!a){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}if(u=o,null!==p&&(o?p.length=o:p=null),s!==u)break}}}A=r===u}else A=!0;if(A){if(void 0!==t.managedPaths){let n=t.managedPaths;const r=u;if(u===r){if(!Array.isArray(n))return we.errors=[{params:{type:"array"}}],!1;{const t=n.length;for(let r=0;r<t;r++){let t=n[r];const s=u,o=u;let a=!1;const i=u;if(!(t instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}var j=i===u;if(a=a||j,!a){const n=u;if(u===n)if("string"==typeof t){if(t.includes("!")||!0!==e.test(t)){const e={params:{}};null===p?p=[e]:p.push(e),u++}else if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}j=n===u,a=a||j}if(!a){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}if(u=o,null!==p&&(o?p.length=o:p=null),s!==u)break}}}A=r===u}else A=!0;if(A){if(void 0!==t.module){let e=t.module;const n=u;if(u===n){if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;{const t=u;for(const t in e)if("hash"!==t&&"timestamp"!==t)return we.errors=[{params:{additionalProperty:t}}],!1;if(t===u){if(void 0!==e.hash){const t=u;if("boolean"!=typeof e.hash)return we.errors=[{params:{type:"boolean"}}],!1;var S=t===u}else S=!0;if(S)if(void 0!==e.timestamp){const t=u;if("boolean"!=typeof e.timestamp)return we.errors=[{params:{type:"boolean"}}],!1;S=t===u}else S=!0}}}A=n===u}else A=!0;if(A){if(void 0!==t.resolve){let e=t.resolve;const n=u;if(u===n){if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;{const t=u;for(const t in e)if("hash"!==t&&"timestamp"!==t)return we.errors=[{params:{additionalProperty:t}}],!1;if(t===u){if(void 0!==e.hash){const t=u;if("boolean"!=typeof e.hash)return we.errors=[{params:{type:"boolean"}}],!1;var O=t===u}else O=!0;if(O)if(void 0!==e.timestamp){const t=u;if("boolean"!=typeof e.timestamp)return we.errors=[{params:{type:"boolean"}}],!1;O=t===u}else O=!0}}}A=n===u}else A=!0;if(A)if(void 0!==t.resolveBuildDependencies){let e=t.resolveBuildDependencies;const n=u;if(u===n){if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;{const t=u;for(const t in e)if("hash"!==t&&"timestamp"!==t)return we.errors=[{params:{additionalProperty:t}}],!1;if(t===u){if(void 0!==e.hash){const t=u;if("boolean"!=typeof e.hash)return we.errors=[{params:{type:"boolean"}}],!1;var R=t===u}else R=!0;if(R)if(void 0!==e.timestamp){const t=u;if("boolean"!=typeof e.timestamp)return we.errors=[{params:{type:"boolean"}}],!1;R=t===u}else R=!0}}}A=n===u}else A=!0}}}}}}}c=n===u}else c=!0;if(c){if(void 0!==r.stats){const e=u;ze(r.stats,{instancePath:s+"/stats",parentData:r,parentDataProperty:"stats",rootData:l})||(p=null===p?ze.errors:p.concat(ze.errors),u=p.length),c=e===u}else c=!0;if(c){if(void 0!==r.target){let e=r.target;const t=u,n=u;let s=!1;const o=u;if(u===o)if(Array.isArray(e))if(e.length<1){const e={params:{limit:1}};null===p?p=[e]:p.push(e),u++}else{const t=e.length;for(let n=0;n<t;n++){let t=e[n];const r=u;if(u===r)if("string"==typeof t){if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}if(r!==u)break}}else{const e={params:{type:"array"}};null===p?p=[e]:p.push(e),u++}var E=o===u;if(s=s||E,!s){const t=u;if(!1!==e){const e={params:{}};null===p?p=[e]:p.push(e),u++}if(E=t===u,s=s||E,!s){const t=u;if(u===t)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}E=t===u,s=s||E}}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=n,null!==p&&(n?p.length=n:p=null),c=t===u}else c=!0;if(c){if(void 0!==r.watch){const e=u;if("boolean"!=typeof r.watch)return we.errors=[{params:{type:"boolean"}}],!1;c=e===u}else c=!0;if(c)if(void 0!==r.watchOptions){let e=r.watchOptions;const t=u;if(u==u){if(!e||"object"!=typeof e||Array.isArray(e))return we.errors=[{params:{type:"object"}}],!1;{const t=u;for(const t in e)if("aggregateTimeout"!==t&&"followSymlinks"!==t&&"ignored"!==t&&"poll"!==t&&"stdin"!==t)return we.errors=[{params:{additionalProperty:t}}],!1;if(t===u){if(void 0!==e.aggregateTimeout){const t=u;if("number"!=typeof e.aggregateTimeout)return we.errors=[{params:{type:"number"}}],!1;var $=t===u}else $=!0;if($){if(void 0!==e.followSymlinks){const t=u;if("boolean"!=typeof e.followSymlinks)return we.errors=[{params:{type:"boolean"}}],!1;$=t===u}else $=!0;if($){if(void 0!==e.ignored){let t=e.ignored;const n=u,r=u;let s=!1;const o=u;if(u===o)if(Array.isArray(t)){const e=t.length;for(let n=0;n<e;n++){let e=t[n];const r=u;if(u===r)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}if(r!==u)break}}else{const e={params:{type:"array"}};null===p?p=[e]:p.push(e),u++}var z=o===u;if(s=s||z,!s){const e=u;if(!(t instanceof RegExp)){const e={params:{}};null===p?p=[e]:p.push(e),u++}if(z=e===u,s=s||z,!s){const e=u;if(u===e)if("string"==typeof t){if(t.length<1){const e={params:{}};null===p?p=[e]:p.push(e),u++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),u++}z=e===u,s=s||z}}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=r,null!==p&&(r?p.length=r:p=null),$=n===u}else $=!0;if($){if(void 0!==e.poll){let t=e.poll;const n=u,r=u;let s=!1;const o=u;if("number"!=typeof t){const e={params:{type:"number"}};null===p?p=[e]:p.push(e),u++}var L=o===u;if(s=s||L,!s){const e=u;if("boolean"!=typeof t){const e={params:{type:"boolean"}};null===p?p=[e]:p.push(e),u++}L=e===u,s=s||L}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),u++,we.errors=p,!1}u=r,null!==p&&(r?p.length=r:p=null),$=n===u}else $=!0;if($)if(void 0!==e.stdin){const t=u;if("boolean"!=typeof e.stdin)return we.errors=[{params:{type:"boolean"}}],!1;$=t===u}else $=!0}}}}}}c=t===u}else c=!0}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}return we.errors=p,0===u}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.json
new file mode 100644
index 0000000..ae18910
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/WebpackOptions.json
@@ -0,0 +1,5321 @@
+{
+  "definitions": {
+    "Amd": {
+      "description": "Set the value of `require.amd` and `define.amd`. Or disable AMD support.",
+      "anyOf": [
+        {
+          "description": "You can pass `false` to disable AMD support.",
+          "enum": [false]
+        },
+        {
+          "description": "You can pass an object to set the value of `require.amd` and `define.amd`.",
+          "type": "object"
+        }
+      ]
+    },
+    "AssetFilterItemTypes": {
+      "description": "Filtering value, regexp or function.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "absolutePath": false
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((name: string, asset: import('../lib/stats/DefaultStatsFactoryPlugin').StatsAsset) => boolean)"
+        }
+      ]
+    },
+    "AssetFilterTypes": {
+      "description": "Filtering modules.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Rule to filter.",
+            "cli": {
+              "helper": true
+            },
+            "oneOf": [
+              {
+                "$ref": "#/definitions/AssetFilterItemTypes"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/AssetFilterItemTypes"
+        }
+      ]
+    },
+    "AssetGeneratorDataUrl": {
+      "description": "The options for data url generator.",
+      "anyOf": [
+        {
+          "$ref": "#/definitions/AssetGeneratorDataUrlOptions"
+        },
+        {
+          "$ref": "#/definitions/AssetGeneratorDataUrlFunction"
+        }
+      ]
+    },
+    "AssetGeneratorDataUrlFunction": {
+      "description": "Function that executes for module and should return an DataUrl string. It can have a string as 'ident' property which contributes to the module hash.",
+      "instanceof": "Function",
+      "tsType": "((source: string | Buffer, context: { filename: string, module: import('../lib/Module') }) => string)"
+    },
+    "AssetGeneratorDataUrlOptions": {
+      "description": "Options object for data url generation.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "encoding": {
+          "description": "Asset encoding (defaults to base64).",
+          "enum": [false, "base64"]
+        },
+        "mimetype": {
+          "description": "Asset mimetype (getting from file extension by default).",
+          "type": "string"
+        }
+      }
+    },
+    "AssetGeneratorOptions": {
+      "description": "Generator options for asset modules.",
+      "type": "object",
+      "implements": [
+        "#/definitions/AssetInlineGeneratorOptions",
+        "#/definitions/AssetResourceGeneratorOptions"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "dataUrl": {
+          "$ref": "#/definitions/AssetGeneratorDataUrl"
+        },
+        "emit": {
+          "description": "Emit an output asset from this asset module. This can be set to 'false' to omit emitting e. g. for SSR.",
+          "type": "boolean"
+        },
+        "filename": {
+          "$ref": "#/definitions/FilenameTemplate"
+        },
+        "outputPath": {
+          "$ref": "#/definitions/AssetModuleOutputPath"
+        },
+        "publicPath": {
+          "$ref": "#/definitions/RawPublicPath"
+        }
+      }
+    },
+    "AssetInlineGeneratorOptions": {
+      "description": "Generator options for asset/inline modules.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "dataUrl": {
+          "$ref": "#/definitions/AssetGeneratorDataUrl"
+        }
+      }
+    },
+    "AssetModuleFilename": {
+      "description": "The filename of asset modules as relative path inside the 'output.path' directory.",
+      "anyOf": [
+        {
+          "type": "string",
+          "absolutePath": false
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((pathData: import(\"../lib/Compilation\").PathData, assetInfo?: import(\"../lib/Compilation\").AssetInfo) => string)"
+        }
+      ]
+    },
+    "AssetModuleOutputPath": {
+      "description": "Emit the asset in the specified folder relative to 'output.path'. This should only be needed when custom 'publicPath' is specified to match the folder structure there.",
+      "anyOf": [
+        {
+          "type": "string",
+          "absolutePath": false
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((pathData: import(\"../lib/Compilation\").PathData, assetInfo?: import(\"../lib/Compilation\").AssetInfo) => string)"
+        }
+      ]
+    },
+    "AssetParserDataUrlFunction": {
+      "description": "Function that executes for module and should return whenever asset should be inlined as DataUrl.",
+      "instanceof": "Function",
+      "tsType": "((source: string | Buffer, context: { filename: string, module: import('../lib/Module') }) => boolean)"
+    },
+    "AssetParserDataUrlOptions": {
+      "description": "Options object for DataUrl condition.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "maxSize": {
+          "description": "Maximum size of asset that should be inline as modules. Default: 8kb.",
+          "type": "number"
+        }
+      }
+    },
+    "AssetParserOptions": {
+      "description": "Parser options for asset modules.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "dataUrlCondition": {
+          "description": "The condition for inlining the asset as DataUrl.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/AssetParserDataUrlOptions"
+            },
+            {
+              "$ref": "#/definitions/AssetParserDataUrlFunction"
+            }
+          ]
+        }
+      }
+    },
+    "AssetResourceGeneratorOptions": {
+      "description": "Generator options for asset/resource modules.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "emit": {
+          "description": "Emit an output asset from this asset module. This can be set to 'false' to omit emitting e. g. for SSR.",
+          "type": "boolean"
+        },
+        "filename": {
+          "$ref": "#/definitions/FilenameTemplate"
+        },
+        "outputPath": {
+          "$ref": "#/definitions/AssetModuleOutputPath"
+        },
+        "publicPath": {
+          "$ref": "#/definitions/RawPublicPath"
+        }
+      }
+    },
+    "AuxiliaryComment": {
+      "description": "Add a comment in the UMD wrapper.",
+      "anyOf": [
+        {
+          "description": "Append the same comment above each import style.",
+          "type": "string"
+        },
+        {
+          "$ref": "#/definitions/LibraryCustomUmdCommentObject"
+        }
+      ]
+    },
+    "Bail": {
+      "description": "Report the first error as a hard error instead of tolerating it.",
+      "type": "boolean"
+    },
+    "CacheOptions": {
+      "description": "Cache generated modules and chunks to improve performance for multiple incremental builds.",
+      "anyOf": [
+        {
+          "description": "Enable in memory caching.",
+          "enum": [true]
+        },
+        {
+          "$ref": "#/definitions/CacheOptionsNormalized"
+        }
+      ]
+    },
+    "CacheOptionsNormalized": {
+      "description": "Cache generated modules and chunks to improve performance for multiple incremental builds.",
+      "anyOf": [
+        {
+          "description": "Disable caching.",
+          "enum": [false]
+        },
+        {
+          "$ref": "#/definitions/MemoryCacheOptions"
+        },
+        {
+          "$ref": "#/definitions/FileCacheOptions"
+        }
+      ]
+    },
+    "Charset": {
+      "description": "Add charset attribute for script tag.",
+      "type": "boolean"
+    },
+    "ChunkFilename": {
+      "description": "Specifies the filename template of output files of non-initial chunks on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/FilenameTemplate"
+        }
+      ]
+    },
+    "ChunkFormat": {
+      "description": "The format of chunks (formats included by default are 'array-push' (web/WebWorker), 'commonjs' (node.js), 'module' (ESM), but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": ["array-push", "commonjs", "module", false]
+        },
+        {
+          "type": "string"
+        }
+      ]
+    },
+    "ChunkLoadTimeout": {
+      "description": "Number of milliseconds before chunk request expires.",
+      "type": "number"
+    },
+    "ChunkLoading": {
+      "description": "The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "$ref": "#/definitions/ChunkLoadingType"
+        }
+      ]
+    },
+    "ChunkLoadingGlobal": {
+      "description": "The global variable used by webpack for loading of chunks.",
+      "type": "string"
+    },
+    "ChunkLoadingType": {
+      "description": "The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": ["jsonp", "import-scripts", "require", "async-node", "import"]
+        },
+        {
+          "type": "string"
+        }
+      ]
+    },
+    "Clean": {
+      "description": "Clean the output directory before emit.",
+      "anyOf": [
+        {
+          "type": "boolean"
+        },
+        {
+          "$ref": "#/definitions/CleanOptions"
+        }
+      ]
+    },
+    "CleanOptions": {
+      "description": "Advanced options for cleaning assets.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "dry": {
+          "description": "Log the assets that should be removed instead of deleting them.",
+          "type": "boolean"
+        },
+        "keep": {
+          "description": "Keep these assets.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "string",
+              "absolutePath": false
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "((filename: string) => boolean)"
+            }
+          ]
+        }
+      }
+    },
+    "CompareBeforeEmit": {
+      "description": "Check if to be emitted file already exists and have the same content before writing to output filesystem.",
+      "type": "boolean"
+    },
+    "Context": {
+      "description": "The base directory (absolute path!) for resolving the `entry` option. If `output.pathinfo` is set, the included pathinfo is shortened to this directory.",
+      "type": "string",
+      "absolutePath": true
+    },
+    "CrossOriginLoading": {
+      "description": "This option enables cross-origin loading of chunks.",
+      "enum": [false, "anonymous", "use-credentials"]
+    },
+    "CssChunkFilename": {
+      "description": "Specifies the filename template of non-initial output css files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/FilenameTemplate"
+        }
+      ]
+    },
+    "CssExperimentOptions": {
+      "description": "Options for css handling.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "exportsOnly": {
+          "description": "Avoid generating and loading a stylesheet and only embed exports from css into output javascript files.",
+          "type": "boolean"
+        }
+      }
+    },
+    "CssFilename": {
+      "description": "Specifies the filename template of output css files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/FilenameTemplate"
+        }
+      ]
+    },
+    "CssGeneratorOptions": {
+      "description": "Generator options for css modules.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {}
+    },
+    "CssParserOptions": {
+      "description": "Parser options for css modules.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {}
+    },
+    "Dependencies": {
+      "description": "References to other configurations to depend on.",
+      "type": "array",
+      "items": {
+        "description": "References to another configuration to depend on.",
+        "type": "string"
+      }
+    },
+    "DevServer": {
+      "description": "Options for the webpack-dev-server.",
+      "type": "object"
+    },
+    "DevTool": {
+      "description": "A developer tool to enhance debugging (false | eval | [inline-|hidden-|eval-][nosources-][cheap-[module-]]source-map).",
+      "anyOf": [
+        {
+          "enum": [false, "eval"]
+        },
+        {
+          "type": "string",
+          "pattern": "^(inline-|hidden-|eval-)?(nosources-)?(cheap-(module-)?)?source-map$"
+        }
+      ]
+    },
+    "DevtoolFallbackModuleFilenameTemplate": {
+      "description": "Similar to `output.devtoolModuleFilenameTemplate`, but used in the case of duplicate module identifiers.",
+      "anyOf": [
+        {
+          "type": "string"
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "Function"
+        }
+      ]
+    },
+    "DevtoolModuleFilenameTemplate": {
+      "description": "Filename template string of function for the sources array in a generated SourceMap.",
+      "anyOf": [
+        {
+          "type": "string"
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "Function"
+        }
+      ]
+    },
+    "DevtoolNamespace": {
+      "description": "Module namespace to use when interpolating filename template string for the sources array in a generated SourceMap. Defaults to `output.library` if not set. It's useful for avoiding runtime collisions in sourcemaps from multiple webpack projects built as libraries.",
+      "type": "string"
+    },
+    "EmptyGeneratorOptions": {
+      "description": "No generator options are supported for this module type.",
+      "type": "object",
+      "additionalProperties": false
+    },
+    "EmptyParserOptions": {
+      "description": "No parser options are supported for this module type.",
+      "type": "object",
+      "additionalProperties": false
+    },
+    "EnabledChunkLoadingTypes": {
+      "description": "List of chunk loading types enabled for use by entry points.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/ChunkLoadingType"
+      }
+    },
+    "EnabledLibraryTypes": {
+      "description": "List of library types enabled for use by entry points.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/LibraryType"
+      }
+    },
+    "EnabledWasmLoadingTypes": {
+      "description": "List of wasm loading types enabled for use by entry points.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/WasmLoadingType"
+      }
+    },
+    "Entry": {
+      "description": "The entry point(s) of the compilation.",
+      "anyOf": [
+        {
+          "$ref": "#/definitions/EntryDynamic"
+        },
+        {
+          "$ref": "#/definitions/EntryStatic"
+        }
+      ]
+    },
+    "EntryDescription": {
+      "description": "An object with entry point description.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "asyncChunks": {
+          "description": "Enable/disable creating async chunks that are loaded on demand.",
+          "type": "boolean"
+        },
+        "baseUri": {
+          "description": "Base uri for this entry.",
+          "type": "string"
+        },
+        "chunkLoading": {
+          "$ref": "#/definitions/ChunkLoading"
+        },
+        "dependOn": {
+          "description": "The entrypoints that the current entrypoint depend on. They must be loaded when this entrypoint is loaded.",
+          "anyOf": [
+            {
+              "description": "The entrypoints that the current entrypoint depend on. They must be loaded when this entrypoint is loaded.",
+              "type": "array",
+              "items": {
+                "description": "An entrypoint that the current entrypoint depend on. It must be loaded when this entrypoint is loaded.",
+                "type": "string",
+                "minLength": 1
+              },
+              "minItems": 1,
+              "uniqueItems": true
+            },
+            {
+              "description": "An entrypoint that the current entrypoint depend on. It must be loaded when this entrypoint is loaded.",
+              "type": "string",
+              "minLength": 1
+            }
+          ]
+        },
+        "filename": {
+          "$ref": "#/definitions/EntryFilename"
+        },
+        "import": {
+          "$ref": "#/definitions/EntryItem"
+        },
+        "layer": {
+          "$ref": "#/definitions/Layer"
+        },
+        "library": {
+          "$ref": "#/definitions/LibraryOptions"
+        },
+        "publicPath": {
+          "$ref": "#/definitions/PublicPath"
+        },
+        "runtime": {
+          "$ref": "#/definitions/EntryRuntime"
+        },
+        "wasmLoading": {
+          "$ref": "#/definitions/WasmLoading"
+        }
+      },
+      "required": ["import"]
+    },
+    "EntryDescriptionNormalized": {
+      "description": "An object with entry point description.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "asyncChunks": {
+          "description": "Enable/disable creating async chunks that are loaded on demand.",
+          "type": "boolean"
+        },
+        "baseUri": {
+          "description": "Base uri for this entry.",
+          "type": "string"
+        },
+        "chunkLoading": {
+          "$ref": "#/definitions/ChunkLoading"
+        },
+        "dependOn": {
+          "description": "The entrypoints that the current entrypoint depend on. They must be loaded when this entrypoint is loaded.",
+          "type": "array",
+          "items": {
+            "description": "An entrypoint that the current entrypoint depend on. It must be loaded when this entrypoint is loaded.",
+            "type": "string",
+            "minLength": 1
+          },
+          "minItems": 1,
+          "uniqueItems": true
+        },
+        "filename": {
+          "$ref": "#/definitions/Filename"
+        },
+        "import": {
+          "description": "Module(s) that are loaded upon startup. The last one is exported.",
+          "type": "array",
+          "items": {
+            "description": "Module that is loaded upon startup. Only the last one is exported.",
+            "type": "string",
+            "minLength": 1
+          },
+          "minItems": 1,
+          "uniqueItems": true
+        },
+        "layer": {
+          "$ref": "#/definitions/Layer"
+        },
+        "library": {
+          "$ref": "#/definitions/LibraryOptions"
+        },
+        "publicPath": {
+          "$ref": "#/definitions/PublicPath"
+        },
+        "runtime": {
+          "$ref": "#/definitions/EntryRuntime"
+        },
+        "wasmLoading": {
+          "$ref": "#/definitions/WasmLoading"
+        }
+      }
+    },
+    "EntryDynamic": {
+      "description": "A Function returning an entry object, an entry string, an entry array or a promise to these things.",
+      "instanceof": "Function",
+      "tsType": "(() => EntryStatic | Promise<EntryStatic>)"
+    },
+    "EntryDynamicNormalized": {
+      "description": "A Function returning a Promise resolving to a normalized entry.",
+      "instanceof": "Function",
+      "tsType": "(() => Promise<EntryStaticNormalized>)"
+    },
+    "EntryFilename": {
+      "description": "Specifies the filename of the output file on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/FilenameTemplate"
+        }
+      ]
+    },
+    "EntryItem": {
+      "description": "Module(s) that are loaded upon startup.",
+      "anyOf": [
+        {
+          "description": "All modules are loaded upon startup. The last one is exported.",
+          "type": "array",
+          "items": {
+            "description": "A module that is loaded upon startup. Only the last one is exported.",
+            "type": "string",
+            "minLength": 1
+          },
+          "minItems": 1,
+          "uniqueItems": true
+        },
+        {
+          "description": "The string is resolved to a module which is loaded upon startup.",
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "EntryNormalized": {
+      "description": "The entry point(s) of the compilation.",
+      "anyOf": [
+        {
+          "$ref": "#/definitions/EntryDynamicNormalized"
+        },
+        {
+          "$ref": "#/definitions/EntryStaticNormalized"
+        }
+      ]
+    },
+    "EntryObject": {
+      "description": "Multiple entry bundles are created. The key is the entry name. The value can be a string, an array or an entry description object.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "An entry point with name.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/EntryItem"
+          },
+          {
+            "$ref": "#/definitions/EntryDescription"
+          }
+        ]
+      }
+    },
+    "EntryRuntime": {
+      "description": "The name of the runtime chunk. If set a runtime chunk with this name is created or an existing entrypoint is used as runtime.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "EntryStatic": {
+      "description": "A static entry description.",
+      "anyOf": [
+        {
+          "$ref": "#/definitions/EntryObject"
+        },
+        {
+          "$ref": "#/definitions/EntryUnnamed"
+        }
+      ]
+    },
+    "EntryStaticNormalized": {
+      "description": "Multiple entry bundles are created. The key is the entry name. The value is an entry description object.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "An object with entry point description.",
+        "oneOf": [
+          {
+            "$ref": "#/definitions/EntryDescriptionNormalized"
+          }
+        ]
+      }
+    },
+    "EntryUnnamed": {
+      "description": "An entry point without name.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/EntryItem"
+        }
+      ]
+    },
+    "Environment": {
+      "description": "The abilities of the environment where the webpack generated code should run.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "arrowFunction": {
+          "description": "The environment supports arrow functions ('() => { ... }').",
+          "type": "boolean"
+        },
+        "bigIntLiteral": {
+          "description": "The environment supports BigInt as literal (123n).",
+          "type": "boolean"
+        },
+        "const": {
+          "description": "The environment supports const and let for variable declarations.",
+          "type": "boolean"
+        },
+        "destructuring": {
+          "description": "The environment supports destructuring ('{ a, b } = obj').",
+          "type": "boolean"
+        },
+        "dynamicImport": {
+          "description": "The environment supports an async import() function to import EcmaScript modules.",
+          "type": "boolean"
+        },
+        "forOf": {
+          "description": "The environment supports 'for of' iteration ('for (const x of array) { ... }').",
+          "type": "boolean"
+        },
+        "module": {
+          "description": "The environment supports EcmaScript Module syntax to import EcmaScript modules (import ... from '...').",
+          "type": "boolean"
+        },
+        "optionalChaining": {
+          "description": "The environment supports optional chaining ('obj?.a' or 'obj?.()').",
+          "type": "boolean"
+        },
+        "templateLiteral": {
+          "description": "The environment supports template literals.",
+          "type": "boolean"
+        }
+      }
+    },
+    "Experiments": {
+      "description": "Enables/Disables experiments (experimental features with relax SemVer compatibility).",
+      "type": "object",
+      "implements": ["#/definitions/ExperimentsCommon"],
+      "additionalProperties": false,
+      "properties": {
+        "asyncWebAssembly": {
+          "description": "Support WebAssembly as asynchronous EcmaScript Module.",
+          "type": "boolean"
+        },
+        "backCompat": {
+          "description": "Enable backward-compat layer with deprecation warnings for many webpack 4 APIs.",
+          "type": "boolean"
+        },
+        "buildHttp": {
+          "description": "Build http(s): urls using a lockfile and resource content cache.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/HttpUriAllowedUris"
+            },
+            {
+              "$ref": "#/definitions/HttpUriOptions"
+            }
+          ]
+        },
+        "cacheUnaffected": {
+          "description": "Enable additional in memory caching of modules that are unchanged and reference only unchanged modules.",
+          "type": "boolean"
+        },
+        "css": {
+          "description": "Enable css support.",
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "$ref": "#/definitions/CssExperimentOptions"
+            }
+          ]
+        },
+        "futureDefaults": {
+          "description": "Apply defaults of next major version.",
+          "type": "boolean"
+        },
+        "layers": {
+          "description": "Enable module layers.",
+          "type": "boolean"
+        },
+        "lazyCompilation": {
+          "description": "Compile entrypoints and import()s only when they are accessed.",
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "$ref": "#/definitions/LazyCompilationOptions"
+            }
+          ]
+        },
+        "outputModule": {
+          "description": "Allow output javascript files as module source type.",
+          "type": "boolean"
+        },
+        "syncWebAssembly": {
+          "description": "Support WebAssembly as synchronous EcmaScript Module (outdated).",
+          "type": "boolean"
+        },
+        "topLevelAwait": {
+          "description": "Allow using top-level-await in EcmaScript Modules.",
+          "type": "boolean"
+        }
+      }
+    },
+    "ExperimentsCommon": {
+      "description": "Enables/Disables experiments (experimental features with relax SemVer compatibility).",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "asyncWebAssembly": {
+          "description": "Support WebAssembly as asynchronous EcmaScript Module.",
+          "type": "boolean"
+        },
+        "backCompat": {
+          "description": "Enable backward-compat layer with deprecation warnings for many webpack 4 APIs.",
+          "type": "boolean"
+        },
+        "cacheUnaffected": {
+          "description": "Enable additional in memory caching of modules that are unchanged and reference only unchanged modules.",
+          "type": "boolean"
+        },
+        "futureDefaults": {
+          "description": "Apply defaults of next major version.",
+          "type": "boolean"
+        },
+        "layers": {
+          "description": "Enable module layers.",
+          "type": "boolean"
+        },
+        "outputModule": {
+          "description": "Allow output javascript files as module source type.",
+          "type": "boolean"
+        },
+        "syncWebAssembly": {
+          "description": "Support WebAssembly as synchronous EcmaScript Module (outdated).",
+          "type": "boolean"
+        },
+        "topLevelAwait": {
+          "description": "Allow using top-level-await in EcmaScript Modules.",
+          "type": "boolean"
+        }
+      }
+    },
+    "ExperimentsNormalized": {
+      "description": "Enables/Disables experiments (experimental features with relax SemVer compatibility).",
+      "type": "object",
+      "implements": ["#/definitions/ExperimentsCommon"],
+      "additionalProperties": false,
+      "properties": {
+        "asyncWebAssembly": {
+          "description": "Support WebAssembly as asynchronous EcmaScript Module.",
+          "type": "boolean"
+        },
+        "backCompat": {
+          "description": "Enable backward-compat layer with deprecation warnings for many webpack 4 APIs.",
+          "type": "boolean"
+        },
+        "buildHttp": {
+          "description": "Build http(s): urls using a lockfile and resource content cache.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/HttpUriOptions"
+            }
+          ]
+        },
+        "cacheUnaffected": {
+          "description": "Enable additional in memory caching of modules that are unchanged and reference only unchanged modules.",
+          "type": "boolean"
+        },
+        "css": {
+          "description": "Enable css support.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/CssExperimentOptions"
+            }
+          ]
+        },
+        "futureDefaults": {
+          "description": "Apply defaults of next major version.",
+          "type": "boolean"
+        },
+        "layers": {
+          "description": "Enable module layers.",
+          "type": "boolean"
+        },
+        "lazyCompilation": {
+          "description": "Compile entrypoints and import()s only when they are accessed.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/LazyCompilationOptions"
+            }
+          ]
+        },
+        "outputModule": {
+          "description": "Allow output javascript files as module source type.",
+          "type": "boolean"
+        },
+        "syncWebAssembly": {
+          "description": "Support WebAssembly as synchronous EcmaScript Module (outdated).",
+          "type": "boolean"
+        },
+        "topLevelAwait": {
+          "description": "Allow using top-level-await in EcmaScript Modules.",
+          "type": "boolean"
+        }
+      }
+    },
+    "ExternalItem": {
+      "description": "Specify dependency that shouldn't be resolved by webpack, but should become dependencies of the resulting bundle. The kind of the dependency depends on `output.libraryTarget`.",
+      "anyOf": [
+        {
+          "description": "Every matched dependency becomes external.",
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "description": "An exact matched dependency becomes external. The same string is used as external dependency.",
+          "type": "string"
+        },
+        {
+          "description": "If an dependency matches exactly a property of the object, the property value is used as dependency.",
+          "type": "object",
+          "additionalProperties": {
+            "$ref": "#/definitions/ExternalItemValue"
+          },
+          "properties": {
+            "byLayer": {
+              "description": "Specify externals depending on the layer.",
+              "anyOf": [
+                {
+                  "type": "object",
+                  "additionalProperties": {
+                    "$ref": "#/definitions/ExternalItem"
+                  }
+                },
+                {
+                  "instanceof": "Function",
+                  "tsType": "((layer: string | null) => ExternalItem)"
+                }
+              ]
+            }
+          }
+        },
+        {
+          "description": "The function is called on each dependency (`function(context, request, callback(err, result))`).",
+          "instanceof": "Function",
+          "tsType": "(((data: ExternalItemFunctionData, callback: (err?: Error, result?: ExternalItemValue) => void) => void) | ((data: ExternalItemFunctionData) => Promise<ExternalItemValue>))"
+        }
+      ]
+    },
+    "ExternalItemFunctionData": {
+      "description": "Data object passed as argument when a function is set for 'externals'.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "context": {
+          "description": "The directory in which the request is placed.",
+          "type": "string"
+        },
+        "contextInfo": {
+          "description": "Contextual information.",
+          "type": "object",
+          "tsType": "import('../lib/ModuleFactory').ModuleFactoryCreateDataContextInfo"
+        },
+        "dependencyType": {
+          "description": "The category of the referencing dependencies.",
+          "type": "string"
+        },
+        "getResolve": {
+          "description": "Get a resolve function with the current resolver options.",
+          "instanceof": "Function",
+          "tsType": "((options?: ResolveOptions) => ((context: string, request: string, callback: (err?: Error, result?: string) => void) => void) | ((context: string, request: string) => Promise<string>))"
+        },
+        "request": {
+          "description": "The request as written by the user in the require/import expression/statement.",
+          "type": "string"
+        }
+      }
+    },
+    "ExternalItemValue": {
+      "description": "The dependency used for the external.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "A part of the target of the external.",
+            "type": "string",
+            "minLength": 1
+          }
+        },
+        {
+          "description": "`true`: The dependency name is used as target of the external.",
+          "type": "boolean"
+        },
+        {
+          "description": "The target of the external.",
+          "type": "string"
+        },
+        {
+          "type": "object"
+        }
+      ]
+    },
+    "Externals": {
+      "description": "Specify dependencies that shouldn't be resolved by webpack, but should become dependencies of the resulting bundle. The kind of the dependency depends on `output.libraryTarget`.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/ExternalItem"
+          }
+        },
+        {
+          "$ref": "#/definitions/ExternalItem"
+        }
+      ]
+    },
+    "ExternalsPresets": {
+      "description": "Enable presets of externals for specific targets.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "electron": {
+          "description": "Treat common electron built-in modules in main and preload context like 'electron', 'ipc' or 'shell' as external and load them via require() when used.",
+          "type": "boolean"
+        },
+        "electronMain": {
+          "description": "Treat electron built-in modules in the main context like 'app', 'ipc-main' or 'shell' as external and load them via require() when used.",
+          "type": "boolean"
+        },
+        "electronPreload": {
+          "description": "Treat electron built-in modules in the preload context like 'web-frame', 'ipc-renderer' or 'shell' as external and load them via require() when used.",
+          "type": "boolean"
+        },
+        "electronRenderer": {
+          "description": "Treat electron built-in modules in the renderer context like 'web-frame', 'ipc-renderer' or 'shell' as external and load them via require() when used.",
+          "type": "boolean"
+        },
+        "node": {
+          "description": "Treat node.js built-in modules like fs, path or vm as external and load them via require() when used.",
+          "type": "boolean"
+        },
+        "nwjs": {
+          "description": "Treat NW.js legacy nw.gui module as external and load it via require() when used.",
+          "type": "boolean"
+        },
+        "web": {
+          "description": "Treat references to 'http(s)://...' and 'std:...' as external and load them via import when used (Note that this changes execution order as externals are executed before any other code in the chunk).",
+          "type": "boolean"
+        },
+        "webAsync": {
+          "description": "Treat references to 'http(s)://...' and 'std:...' as external and load them via async import() when used (Note that this external type is an async module, which has various effects on the execution).",
+          "type": "boolean"
+        }
+      }
+    },
+    "ExternalsType": {
+      "description": "Specifies the default type of externals ('amd*', 'umd*', 'system' and 'jsonp' depend on output.libraryTarget set to the same value).",
+      "enum": [
+        "var",
+        "module",
+        "assign",
+        "this",
+        "window",
+        "self",
+        "global",
+        "commonjs",
+        "commonjs2",
+        "commonjs-module",
+        "commonjs-static",
+        "amd",
+        "amd-require",
+        "umd",
+        "umd2",
+        "jsonp",
+        "system",
+        "promise",
+        "import",
+        "script",
+        "node-commonjs"
+      ]
+    },
+    "FileCacheOptions": {
+      "description": "Options object for persistent file-based caching.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "allowCollectingMemory": {
+          "description": "Allows to collect unused memory allocated during deserialization. This requires copying data into smaller buffers and has a performance cost.",
+          "type": "boolean"
+        },
+        "buildDependencies": {
+          "description": "Dependencies the build depends on (in multiple categories, default categories: 'defaultWebpack').",
+          "type": "object",
+          "additionalProperties": {
+            "description": "List of dependencies the build depends on.",
+            "type": "array",
+            "items": {
+              "description": "Request to a dependency (resolved as directory relative to the context directory).",
+              "type": "string",
+              "minLength": 1
+            }
+          }
+        },
+        "cacheDirectory": {
+          "description": "Base directory for the cache (defaults to node_modules/.cache/webpack).",
+          "type": "string",
+          "absolutePath": true
+        },
+        "cacheLocation": {
+          "description": "Locations for the cache (defaults to cacheDirectory / name).",
+          "type": "string",
+          "absolutePath": true
+        },
+        "compression": {
+          "description": "Compression type used for the cache files.",
+          "enum": [false, "gzip", "brotli"]
+        },
+        "hashAlgorithm": {
+          "description": "Algorithm used for generation the hash (see node.js crypto package).",
+          "type": "string"
+        },
+        "idleTimeout": {
+          "description": "Time in ms after which idle period the cache storing should happen.",
+          "type": "number",
+          "minimum": 0
+        },
+        "idleTimeoutAfterLargeChanges": {
+          "description": "Time in ms after which idle period the cache storing should happen when larger changes has been detected (cumulative build time > 2 x avg cache store time).",
+          "type": "number",
+          "minimum": 0
+        },
+        "idleTimeoutForInitialStore": {
+          "description": "Time in ms after which idle period the initial cache storing should happen.",
+          "type": "number",
+          "minimum": 0
+        },
+        "immutablePaths": {
+          "description": "List of paths that are managed by a package manager and contain a version or hash in its path so all files are immutable.",
+          "type": "array",
+          "items": {
+            "description": "List of paths that are managed by a package manager and contain a version or hash in its path so all files are immutable.",
+            "anyOf": [
+              {
+                "description": "A RegExp matching an immutable directory (usually a package manager cache directory, including the tailing slash)",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              {
+                "description": "A path to an immutable directory (usually a package manager cache directory).",
+                "type": "string",
+                "absolutePath": true,
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "managedPaths": {
+          "description": "List of paths that are managed by a package manager and can be trusted to not be modified otherwise.",
+          "type": "array",
+          "items": {
+            "description": "List of paths that are managed by a package manager and can be trusted to not be modified otherwise.",
+            "anyOf": [
+              {
+                "description": "A RegExp matching a managed directory (usually a node_modules directory, including the tailing slash)",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              {
+                "description": "A path to a managed directory (usually a node_modules directory).",
+                "type": "string",
+                "absolutePath": true,
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "maxAge": {
+          "description": "Time for which unused cache entries stay in the filesystem cache at minimum (in milliseconds).",
+          "type": "number",
+          "minimum": 0
+        },
+        "maxMemoryGenerations": {
+          "description": "Number of generations unused cache entries stay in memory cache at minimum (0 = no memory cache used, 1 = may be removed after unused for a single compilation, ..., Infinity: kept forever). Cache entries will be deserialized from disk when removed from memory cache.",
+          "type": "number",
+          "minimum": 0
+        },
+        "memoryCacheUnaffected": {
+          "description": "Additionally cache computation of modules that are unchanged and reference only unchanged modules in memory.",
+          "type": "boolean"
+        },
+        "name": {
+          "description": "Name for the cache. Different names will lead to different coexisting caches.",
+          "type": "string"
+        },
+        "profile": {
+          "description": "Track and log detailed timing information for individual cache items.",
+          "type": "boolean"
+        },
+        "store": {
+          "description": "When to store data to the filesystem. (pack: Store data when compiler is idle in a single file).",
+          "enum": ["pack"]
+        },
+        "type": {
+          "description": "Filesystem caching.",
+          "enum": ["filesystem"]
+        },
+        "version": {
+          "description": "Version of the cache data. Different versions won't allow to reuse the cache and override existing content. Update the version when config changed in a way which doesn't allow to reuse cache. This will invalidate the cache.",
+          "type": "string"
+        }
+      },
+      "required": ["type"]
+    },
+    "Filename": {
+      "description": "Specifies the filename of output files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/FilenameTemplate"
+        }
+      ]
+    },
+    "FilenameTemplate": {
+      "description": "Specifies the filename template of output files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.",
+      "anyOf": [
+        {
+          "type": "string",
+          "absolutePath": false,
+          "minLength": 1
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((pathData: import(\"../lib/Compilation\").PathData, assetInfo?: import(\"../lib/Compilation\").AssetInfo) => string)"
+        }
+      ]
+    },
+    "FilterItemTypes": {
+      "description": "Filtering value, regexp or function.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "absolutePath": false
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((value: string) => boolean)"
+        }
+      ]
+    },
+    "FilterTypes": {
+      "description": "Filtering values.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Rule to filter.",
+            "cli": {
+              "helper": true
+            },
+            "oneOf": [
+              {
+                "$ref": "#/definitions/FilterItemTypes"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/FilterItemTypes"
+        }
+      ]
+    },
+    "GeneratorOptionsByModuleType": {
+      "description": "Specify options for each generator.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Options for generating.",
+        "type": "object",
+        "additionalProperties": true
+      },
+      "properties": {
+        "asset": {
+          "$ref": "#/definitions/AssetGeneratorOptions"
+        },
+        "asset/inline": {
+          "$ref": "#/definitions/AssetInlineGeneratorOptions"
+        },
+        "asset/resource": {
+          "$ref": "#/definitions/AssetResourceGeneratorOptions"
+        },
+        "javascript": {
+          "$ref": "#/definitions/EmptyGeneratorOptions"
+        },
+        "javascript/auto": {
+          "$ref": "#/definitions/EmptyGeneratorOptions"
+        },
+        "javascript/dynamic": {
+          "$ref": "#/definitions/EmptyGeneratorOptions"
+        },
+        "javascript/esm": {
+          "$ref": "#/definitions/EmptyGeneratorOptions"
+        }
+      }
+    },
+    "GlobalObject": {
+      "description": "An expression which is used to address the global object/scope in runtime code.",
+      "type": "string",
+      "minLength": 1
+    },
+    "HashDigest": {
+      "description": "Digest type used for the hash.",
+      "type": "string"
+    },
+    "HashDigestLength": {
+      "description": "Number of chars which are used for the hash.",
+      "type": "number",
+      "minimum": 1
+    },
+    "HashFunction": {
+      "description": "Algorithm used for generation the hash (see node.js crypto package).",
+      "anyOf": [
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "typeof import('../lib/util/Hash')"
+        }
+      ]
+    },
+    "HashSalt": {
+      "description": "Any string which is added to the hash to salt it.",
+      "type": "string",
+      "minLength": 1
+    },
+    "HotUpdateChunkFilename": {
+      "description": "The filename of the Hot Update Chunks. They are inside the output.path directory.",
+      "type": "string",
+      "absolutePath": false
+    },
+    "HotUpdateGlobal": {
+      "description": "The global variable used by webpack for loading of hot update chunks.",
+      "type": "string"
+    },
+    "HotUpdateMainFilename": {
+      "description": "The filename of the Hot Update Main File. It is inside the 'output.path' directory.",
+      "type": "string",
+      "absolutePath": false
+    },
+    "HttpUriAllowedUris": {
+      "description": "List of allowed URIs for building http resources.",
+      "cli": {
+        "exclude": true
+      },
+      "oneOf": [
+        {
+          "$ref": "#/definitions/HttpUriOptionsAllowedUris"
+        }
+      ]
+    },
+    "HttpUriOptions": {
+      "description": "Options for building http resources.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "allowedUris": {
+          "$ref": "#/definitions/HttpUriOptionsAllowedUris"
+        },
+        "cacheLocation": {
+          "description": "Location where resource content is stored for lockfile entries. It's also possible to disable storing by passing false.",
+          "anyOf": [
+            {
+              "enum": [false]
+            },
+            {
+              "type": "string",
+              "absolutePath": true
+            }
+          ]
+        },
+        "frozen": {
+          "description": "When set, anything that would lead to a modification of the lockfile or any resource content, will result in an error.",
+          "type": "boolean"
+        },
+        "lockfileLocation": {
+          "description": "Location of the lockfile.",
+          "type": "string",
+          "absolutePath": true
+        },
+        "proxy": {
+          "description": "Proxy configuration, which can be used to specify a proxy server to use for HTTP requests.",
+          "type": "string"
+        },
+        "upgrade": {
+          "description": "When set, resources of existing lockfile entries will be fetched and entries will be upgraded when resource content has changed.",
+          "type": "boolean"
+        }
+      },
+      "required": ["allowedUris"]
+    },
+    "HttpUriOptionsAllowedUris": {
+      "description": "List of allowed URIs (resp. the beginning of them).",
+      "type": "array",
+      "items": {
+        "description": "List of allowed URIs (resp. the beginning of them).",
+        "anyOf": [
+          {
+            "description": "Allowed URI pattern.",
+            "instanceof": "RegExp",
+            "tsType": "RegExp"
+          },
+          {
+            "description": "Allowed URI (resp. the beginning of it).",
+            "type": "string",
+            "pattern": "^https?://"
+          },
+          {
+            "description": "Allowed URI filter function.",
+            "instanceof": "Function",
+            "tsType": "((uri: string) => boolean)"
+          }
+        ]
+      }
+    },
+    "IgnoreWarnings": {
+      "description": "Ignore specific warnings.",
+      "type": "array",
+      "items": {
+        "description": "Ignore specific warnings.",
+        "anyOf": [
+          {
+            "description": "A RegExp to select the warning message.",
+            "instanceof": "RegExp",
+            "tsType": "RegExp"
+          },
+          {
+            "type": "object",
+            "additionalProperties": false,
+            "properties": {
+              "file": {
+                "description": "A RegExp to select the origin file for the warning.",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              "message": {
+                "description": "A RegExp to select the warning message.",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              "module": {
+                "description": "A RegExp to select the origin module for the warning.",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              }
+            }
+          },
+          {
+            "description": "A custom function to select warnings based on the raw warning instance.",
+            "instanceof": "Function",
+            "tsType": "((warning: import('../lib/WebpackError'), compilation: import('../lib/Compilation')) => boolean)"
+          }
+        ]
+      }
+    },
+    "IgnoreWarningsNormalized": {
+      "description": "Ignore specific warnings.",
+      "type": "array",
+      "items": {
+        "description": "A function to select warnings based on the raw warning instance.",
+        "instanceof": "Function",
+        "tsType": "((warning: import('../lib/WebpackError'), compilation: import('../lib/Compilation')) => boolean)"
+      }
+    },
+    "Iife": {
+      "description": "Wrap javascript code into IIFE's to avoid leaking into global scope.",
+      "type": "boolean"
+    },
+    "ImportFunctionName": {
+      "description": "The name of the native import() function (can be exchanged for a polyfill).",
+      "type": "string"
+    },
+    "ImportMetaName": {
+      "description": "The name of the native import.meta object (can be exchanged for a polyfill).",
+      "type": "string"
+    },
+    "InfrastructureLogging": {
+      "description": "Options for infrastructure level logging.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "appendOnly": {
+          "description": "Only appends lines to the output. Avoids updating existing output e. g. for status messages. This option is only used when no custom console is provided.",
+          "type": "boolean"
+        },
+        "colors": {
+          "description": "Enables/Disables colorful output. This option is only used when no custom console is provided.",
+          "type": "boolean"
+        },
+        "console": {
+          "description": "Custom console used for logging.",
+          "tsType": "Console"
+        },
+        "debug": {
+          "description": "Enable debug logging for specific loggers.",
+          "anyOf": [
+            {
+              "description": "Enable/Disable debug logging for all loggers.",
+              "type": "boolean"
+            },
+            {
+              "$ref": "#/definitions/FilterTypes"
+            }
+          ]
+        },
+        "level": {
+          "description": "Log level.",
+          "enum": ["none", "error", "warn", "info", "log", "verbose"]
+        },
+        "stream": {
+          "description": "Stream used for logging output. Defaults to process.stderr. This option is only used when no custom console is provided.",
+          "tsType": "NodeJS.WritableStream"
+        }
+      }
+    },
+    "JavascriptParserOptions": {
+      "description": "Parser options for javascript modules.",
+      "type": "object",
+      "additionalProperties": true,
+      "properties": {
+        "amd": {
+          "$ref": "#/definitions/Amd"
+        },
+        "browserify": {
+          "description": "Enable/disable special handling for browserify bundles.",
+          "type": "boolean"
+        },
+        "commonjs": {
+          "description": "Enable/disable parsing of CommonJs syntax.",
+          "type": "boolean"
+        },
+        "commonjsMagicComments": {
+          "description": "Enable/disable parsing of magic comments in CommonJs syntax.",
+          "type": "boolean"
+        },
+        "exportsPresence": {
+          "description": "Specifies the behavior of invalid export names in \"import ... from ...\" and \"export ... from ...\".",
+          "enum": ["error", "warn", "auto", false]
+        },
+        "exprContextCritical": {
+          "description": "Enable warnings for full dynamic dependencies.",
+          "type": "boolean"
+        },
+        "exprContextRecursive": {
+          "description": "Enable recursive directory lookup for full dynamic dependencies.",
+          "type": "boolean"
+        },
+        "exprContextRegExp": {
+          "description": "Sets the default regular expression for full dynamic dependencies.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "exprContextRequest": {
+          "description": "Set the default request for full dynamic dependencies.",
+          "type": "string"
+        },
+        "harmony": {
+          "description": "Enable/disable parsing of EcmaScript Modules syntax.",
+          "type": "boolean"
+        },
+        "import": {
+          "description": "Enable/disable parsing of import() syntax.",
+          "type": "boolean"
+        },
+        "importExportsPresence": {
+          "description": "Specifies the behavior of invalid export names in \"import ... from ...\".",
+          "enum": ["error", "warn", "auto", false]
+        },
+        "importMeta": {
+          "description": "Enable/disable evaluating import.meta.",
+          "type": "boolean"
+        },
+        "importMetaContext": {
+          "description": "Enable/disable evaluating import.meta.webpackContext.",
+          "type": "boolean"
+        },
+        "node": {
+          "$ref": "#/definitions/Node"
+        },
+        "reexportExportsPresence": {
+          "description": "Specifies the behavior of invalid export names in \"export ... from ...\". This might be useful to disable during the migration from \"export ... from ...\" to \"export type ... from ...\" when reexporting types in TypeScript.",
+          "enum": ["error", "warn", "auto", false]
+        },
+        "requireContext": {
+          "description": "Enable/disable parsing of require.context syntax.",
+          "type": "boolean"
+        },
+        "requireEnsure": {
+          "description": "Enable/disable parsing of require.ensure syntax.",
+          "type": "boolean"
+        },
+        "requireInclude": {
+          "description": "Enable/disable parsing of require.include syntax.",
+          "type": "boolean"
+        },
+        "requireJs": {
+          "description": "Enable/disable parsing of require.js special syntax like require.config, requirejs.config, require.version and requirejs.onError.",
+          "type": "boolean"
+        },
+        "strictExportPresence": {
+          "description": "Deprecated in favor of \"exportsPresence\". Emit errors instead of warnings when imported names don't exist in imported module.",
+          "type": "boolean"
+        },
+        "strictThisContextOnImports": {
+          "description": "Handle the this context correctly according to the spec for namespace objects.",
+          "type": "boolean"
+        },
+        "system": {
+          "description": "Enable/disable parsing of System.js special syntax like System.import, System.get, System.set and System.register.",
+          "type": "boolean"
+        },
+        "unknownContextCritical": {
+          "description": "Enable warnings when using the require function in a not statically analyse-able way.",
+          "type": "boolean"
+        },
+        "unknownContextRecursive": {
+          "description": "Enable recursive directory lookup when using the require function in a not statically analyse-able way.",
+          "type": "boolean"
+        },
+        "unknownContextRegExp": {
+          "description": "Sets the regular expression when using the require function in a not statically analyse-able way.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "unknownContextRequest": {
+          "description": "Sets the request when using the require function in a not statically analyse-able way.",
+          "type": "string"
+        },
+        "url": {
+          "description": "Enable/disable parsing of new URL() syntax.",
+          "anyOf": [
+            {
+              "enum": ["relative"]
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "worker": {
+          "description": "Disable or configure parsing of WebWorker syntax like new Worker() or navigator.serviceWorker.register().",
+          "anyOf": [
+            {
+              "type": "array",
+              "items": {
+                "description": "Specify a syntax that should be parsed as WebWorker reference. 'Abc' handles 'new Abc()', 'Abc from xyz' handles 'import { Abc } from \"xyz\"; new Abc()', 'abc()' handles 'abc()', and combinations are also possible.",
+                "type": "string",
+                "minLength": 1
+              }
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "wrappedContextCritical": {
+          "description": "Enable warnings for partial dynamic dependencies.",
+          "type": "boolean"
+        },
+        "wrappedContextRecursive": {
+          "description": "Enable recursive directory lookup for partial dynamic dependencies.",
+          "type": "boolean"
+        },
+        "wrappedContextRegExp": {
+          "description": "Set the inner regular expression for partial dynamic dependencies.",
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        }
+      }
+    },
+    "Layer": {
+      "description": "Specifies the layer in which modules of this entrypoint are placed.",
+      "anyOf": [
+        {
+          "enum": [null]
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "LazyCompilationDefaultBackendOptions": {
+      "description": "Options for the default backend.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "client": {
+          "description": "A custom client.",
+          "type": "string"
+        },
+        "listen": {
+          "description": "Specifies where to listen to from the server.",
+          "anyOf": [
+            {
+              "description": "A port.",
+              "type": "number"
+            },
+            {
+              "description": "Listen options.",
+              "type": "object",
+              "additionalProperties": true,
+              "properties": {
+                "host": {
+                  "description": "A host.",
+                  "type": "string"
+                },
+                "port": {
+                  "description": "A port.",
+                  "type": "number"
+                }
+              },
+              "tsType": "import(\"net\").ListenOptions"
+            },
+            {
+              "description": "A custom listen function.",
+              "instanceof": "Function",
+              "tsType": "((server: import(\"net\").Server) => void)"
+            }
+          ]
+        },
+        "protocol": {
+          "description": "Specifies the protocol the client should use to connect to the server.",
+          "enum": ["http", "https"]
+        },
+        "server": {
+          "description": "Specifies how to create the server handling the EventSource requests.",
+          "anyOf": [
+            {
+              "description": "ServerOptions for the http or https createServer call.",
+              "type": "object",
+              "additionalProperties": true,
+              "properties": {},
+              "tsType": "(import(\"https\").ServerOptions | import(\"http\").ServerOptions)"
+            },
+            {
+              "description": "A custom create server function.",
+              "instanceof": "Function",
+              "tsType": "(() => import(\"net\").Server)"
+            }
+          ]
+        }
+      }
+    },
+    "LazyCompilationOptions": {
+      "description": "Options for compiling entrypoints and import()s only when they are accessed.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "backend": {
+          "description": "Specifies the backend that should be used for handling client keep alive.",
+          "anyOf": [
+            {
+              "description": "A custom backend.",
+              "instanceof": "Function",
+              "tsType": "(((compiler: import('../lib/Compiler'), callback: (err?: Error, api?: import(\"../lib/hmr/LazyCompilationPlugin\").BackendApi) => void) => void) | ((compiler: import('../lib/Compiler')) => Promise<import(\"../lib/hmr/LazyCompilationPlugin\").BackendApi>))"
+            },
+            {
+              "$ref": "#/definitions/LazyCompilationDefaultBackendOptions"
+            }
+          ]
+        },
+        "entries": {
+          "description": "Enable/disable lazy compilation for entries.",
+          "type": "boolean"
+        },
+        "imports": {
+          "description": "Enable/disable lazy compilation for import() modules.",
+          "type": "boolean"
+        },
+        "test": {
+          "description": "Specify which entrypoints or import()ed modules should be lazily compiled. This is matched with the imported module and not the entrypoint name.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "string"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "((module: import('../lib/Module')) => boolean)"
+            }
+          ]
+        }
+      }
+    },
+    "Library": {
+      "description": "Make the output files a library, exporting the exports of the entry point.",
+      "anyOf": [
+        {
+          "$ref": "#/definitions/LibraryName"
+        },
+        {
+          "$ref": "#/definitions/LibraryOptions"
+        }
+      ]
+    },
+    "LibraryCustomUmdCommentObject": {
+      "description": "Set explicit comments for `commonjs`, `commonjs2`, `amd`, and `root`.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "amd": {
+          "description": "Set comment for `amd` section in UMD.",
+          "type": "string"
+        },
+        "commonjs": {
+          "description": "Set comment for `commonjs` (exports) section in UMD.",
+          "type": "string"
+        },
+        "commonjs2": {
+          "description": "Set comment for `commonjs2` (module.exports) section in UMD.",
+          "type": "string"
+        },
+        "root": {
+          "description": "Set comment for `root` (global variable) section in UMD.",
+          "type": "string"
+        }
+      }
+    },
+    "LibraryCustomUmdObject": {
+      "description": "Description object for all UMD variants of the library name.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "amd": {
+          "description": "Name of the exposed AMD library in the UMD.",
+          "type": "string",
+          "minLength": 1
+        },
+        "commonjs": {
+          "description": "Name of the exposed commonjs export in the UMD.",
+          "type": "string",
+          "minLength": 1
+        },
+        "root": {
+          "description": "Name of the property exposed globally by a UMD library.",
+          "anyOf": [
+            {
+              "type": "array",
+              "items": {
+                "description": "Part of the name of the property exposed globally by a UMD library.",
+                "type": "string",
+                "minLength": 1
+              }
+            },
+            {
+              "type": "string",
+              "minLength": 1
+            }
+          ]
+        }
+      }
+    },
+    "LibraryExport": {
+      "description": "Specify which export should be exposed as library.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Part of the export that should be exposed as library.",
+            "type": "string",
+            "minLength": 1
+          }
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "LibraryName": {
+      "description": "The name of the library (some types allow unnamed libraries too).",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "A part of the library name.",
+            "type": "string",
+            "minLength": 1
+          },
+          "minItems": 1
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "$ref": "#/definitions/LibraryCustomUmdObject"
+        }
+      ]
+    },
+    "LibraryOptions": {
+      "description": "Options for library.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "auxiliaryComment": {
+          "$ref": "#/definitions/AuxiliaryComment"
+        },
+        "export": {
+          "$ref": "#/definitions/LibraryExport"
+        },
+        "name": {
+          "$ref": "#/definitions/LibraryName"
+        },
+        "type": {
+          "$ref": "#/definitions/LibraryType"
+        },
+        "umdNamedDefine": {
+          "$ref": "#/definitions/UmdNamedDefine"
+        }
+      },
+      "required": ["type"]
+    },
+    "LibraryType": {
+      "description": "Type of library (types included by default are 'var', 'module', 'assign', 'assign-properties', 'this', 'window', 'self', 'global', 'commonjs', 'commonjs2', 'commonjs-module', 'commonjs-static', 'amd', 'amd-require', 'umd', 'umd2', 'jsonp', 'system', but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": [
+            "var",
+            "module",
+            "assign",
+            "assign-properties",
+            "this",
+            "window",
+            "self",
+            "global",
+            "commonjs",
+            "commonjs2",
+            "commonjs-module",
+            "commonjs-static",
+            "amd",
+            "amd-require",
+            "umd",
+            "umd2",
+            "jsonp",
+            "system"
+          ]
+        },
+        {
+          "type": "string"
+        }
+      ]
+    },
+    "Loader": {
+      "description": "Custom values available in the loader context.",
+      "type": "object"
+    },
+    "MemoryCacheOptions": {
+      "description": "Options object for in-memory caching.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "cacheUnaffected": {
+          "description": "Additionally cache computation of modules that are unchanged and reference only unchanged modules.",
+          "type": "boolean"
+        },
+        "maxGenerations": {
+          "description": "Number of generations unused cache entries stay in memory cache at minimum (1 = may be removed after unused for a single compilation, ..., Infinity: kept forever).",
+          "type": "number",
+          "minimum": 1
+        },
+        "type": {
+          "description": "In memory caching.",
+          "enum": ["memory"]
+        }
+      },
+      "required": ["type"]
+    },
+    "Mode": {
+      "description": "Enable production optimizations or development hints.",
+      "enum": ["development", "production", "none"]
+    },
+    "ModuleFilterItemTypes": {
+      "description": "Filtering value, regexp or function.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "absolutePath": false
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((name: string, module: import('../lib/stats/DefaultStatsFactoryPlugin').StatsModule, type: 'module' | 'chunk' | 'root-of-chunk' | 'nested') => boolean)"
+        }
+      ]
+    },
+    "ModuleFilterTypes": {
+      "description": "Filtering modules.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Rule to filter.",
+            "cli": {
+              "helper": true
+            },
+            "oneOf": [
+              {
+                "$ref": "#/definitions/ModuleFilterItemTypes"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/ModuleFilterItemTypes"
+        }
+      ]
+    },
+    "ModuleOptions": {
+      "description": "Options affecting the normal modules (`NormalModuleFactory`).",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "defaultRules": {
+          "description": "An array of rules applied by default for modules.",
+          "cli": {
+            "exclude": true
+          },
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetRules"
+            }
+          ]
+        },
+        "exprContextCritical": {
+          "description": "Enable warnings for full dynamic dependencies.",
+          "type": "boolean"
+        },
+        "exprContextRecursive": {
+          "description": "Enable recursive directory lookup for full dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.exprContextRecursive'.",
+          "type": "boolean"
+        },
+        "exprContextRegExp": {
+          "description": "Sets the default regular expression for full dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.exprContextRegExp'.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "exprContextRequest": {
+          "description": "Set the default request for full dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.exprContextRequest'.",
+          "type": "string"
+        },
+        "generator": {
+          "$ref": "#/definitions/GeneratorOptionsByModuleType"
+        },
+        "noParse": {
+          "$ref": "#/definitions/NoParse"
+        },
+        "parser": {
+          "$ref": "#/definitions/ParserOptionsByModuleType"
+        },
+        "rules": {
+          "description": "An array of rules applied for modules.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetRules"
+            }
+          ]
+        },
+        "strictExportPresence": {
+          "description": "Emit errors instead of warnings when imported names don't exist in imported module. Deprecated: This option has moved to 'module.parser.javascript.strictExportPresence'.",
+          "type": "boolean"
+        },
+        "strictThisContextOnImports": {
+          "description": "Handle the this context correctly according to the spec for namespace objects. Deprecated: This option has moved to 'module.parser.javascript.strictThisContextOnImports'.",
+          "type": "boolean"
+        },
+        "unknownContextCritical": {
+          "description": "Enable warnings when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextCritical'.",
+          "type": "boolean"
+        },
+        "unknownContextRecursive": {
+          "description": "Enable recursive directory lookup when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextRecursive'.",
+          "type": "boolean"
+        },
+        "unknownContextRegExp": {
+          "description": "Sets the regular expression when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextRegExp'.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "unknownContextRequest": {
+          "description": "Sets the request when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextRequest'.",
+          "type": "string"
+        },
+        "unsafeCache": {
+          "description": "Cache the resolving of module requests.",
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          ]
+        },
+        "wrappedContextCritical": {
+          "description": "Enable warnings for partial dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.wrappedContextCritical'.",
+          "type": "boolean"
+        },
+        "wrappedContextRecursive": {
+          "description": "Enable recursive directory lookup for partial dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.wrappedContextRecursive'.",
+          "type": "boolean"
+        },
+        "wrappedContextRegExp": {
+          "description": "Set the inner regular expression for partial dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.wrappedContextRegExp'.",
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        }
+      }
+    },
+    "ModuleOptionsNormalized": {
+      "description": "Options affecting the normal modules (`NormalModuleFactory`).",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "defaultRules": {
+          "description": "An array of rules applied by default for modules.",
+          "cli": {
+            "exclude": true
+          },
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetRules"
+            }
+          ]
+        },
+        "generator": {
+          "$ref": "#/definitions/GeneratorOptionsByModuleType"
+        },
+        "noParse": {
+          "$ref": "#/definitions/NoParse"
+        },
+        "parser": {
+          "$ref": "#/definitions/ParserOptionsByModuleType"
+        },
+        "rules": {
+          "description": "An array of rules applied for modules.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetRules"
+            }
+          ]
+        },
+        "unsafeCache": {
+          "description": "Cache the resolving of module requests.",
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          ]
+        }
+      },
+      "required": ["defaultRules", "generator", "parser", "rules"]
+    },
+    "Name": {
+      "description": "Name of the configuration. Used when loading multiple configurations.",
+      "type": "string"
+    },
+    "NoParse": {
+      "description": "Don't parse files matching. It's matched against the full resolved request.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Don't parse files matching. It's matched against the full resolved request.",
+            "anyOf": [
+              {
+                "description": "A regular expression, when matched the module is not parsed.",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              {
+                "description": "An absolute path, when the module starts with this path it is not parsed.",
+                "type": "string",
+                "absolutePath": true
+              },
+              {
+                "instanceof": "Function",
+                "tsType": "Function"
+              }
+            ]
+          },
+          "minItems": 1
+        },
+        {
+          "description": "A regular expression, when matched the module is not parsed.",
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "description": "An absolute path, when the module starts with this path it is not parsed.",
+          "type": "string",
+          "absolutePath": true
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "Function"
+        }
+      ]
+    },
+    "Node": {
+      "description": "Include polyfills or mocks for various node stuff.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "$ref": "#/definitions/NodeOptions"
+        }
+      ]
+    },
+    "NodeOptions": {
+      "description": "Options object for node compatibility features.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "__dirname": {
+          "description": "Include a polyfill for the '__dirname' variable.",
+          "enum": [false, true, "warn-mock", "mock", "eval-only"]
+        },
+        "__filename": {
+          "description": "Include a polyfill for the '__filename' variable.",
+          "enum": [false, true, "warn-mock", "mock", "eval-only"]
+        },
+        "global": {
+          "description": "Include a polyfill for the 'global' variable.",
+          "enum": [false, true, "warn"]
+        }
+      }
+    },
+    "Optimization": {
+      "description": "Enables/Disables integrated optimizations.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "checkWasmTypes": {
+          "description": "Check for incompatible wasm types when importing/exporting from/to ESM.",
+          "type": "boolean"
+        },
+        "chunkIds": {
+          "description": "Define the algorithm to choose chunk ids (named: readable ids for better debugging, deterministic: numeric hash ids for better long term caching, size: numeric ids focused on minimal initial download size, total-size: numeric ids focused on minimal total download size, false: no algorithm used, as custom one can be provided via plugin).",
+          "enum": [
+            "natural",
+            "named",
+            "deterministic",
+            "size",
+            "total-size",
+            false
+          ]
+        },
+        "concatenateModules": {
+          "description": "Concatenate modules when possible to generate less modules, more efficient code and enable more optimizations by the minimizer.",
+          "type": "boolean"
+        },
+        "emitOnErrors": {
+          "description": "Emit assets even when errors occur. Critical errors are emitted into the generated code and will cause errors at runtime.",
+          "type": "boolean"
+        },
+        "flagIncludedChunks": {
+          "description": "Also flag chunks as loaded which contain a subset of the modules.",
+          "type": "boolean"
+        },
+        "innerGraph": {
+          "description": "Creates a module-internal dependency graph for top level symbols, exports and imports, to improve unused exports detection.",
+          "type": "boolean"
+        },
+        "mangleExports": {
+          "description": "Rename exports when possible to generate shorter code (depends on optimization.usedExports and optimization.providedExports, true/\"deterministic\": generate short deterministic names optimized for caching, \"size\": generate the shortest possible names).",
+          "anyOf": [
+            {
+              "enum": ["size", "deterministic"]
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "mangleWasmImports": {
+          "description": "Reduce size of WASM by changing imports to shorter strings.",
+          "type": "boolean"
+        },
+        "mergeDuplicateChunks": {
+          "description": "Merge chunks which contain the same modules.",
+          "type": "boolean"
+        },
+        "minimize": {
+          "description": "Enable minimizing the output. Uses optimization.minimizer.",
+          "type": "boolean"
+        },
+        "minimizer": {
+          "description": "Minimizer(s) to use for minimizing the output.",
+          "type": "array",
+          "cli": {
+            "exclude": true
+          },
+          "items": {
+            "description": "Plugin of type object or instanceof Function.",
+            "anyOf": [
+              {
+                "enum": ["..."]
+              },
+              {
+                "$ref": "#/definitions/WebpackPluginInstance"
+              },
+              {
+                "$ref": "#/definitions/WebpackPluginFunction"
+              }
+            ]
+          }
+        },
+        "moduleIds": {
+          "description": "Define the algorithm to choose module ids (natural: numeric ids in order of usage, named: readable ids for better debugging, hashed: (deprecated) short hashes as ids for better long term caching, deterministic: numeric hash ids for better long term caching, size: numeric ids focused on minimal initial download size, false: no algorithm used, as custom one can be provided via plugin).",
+          "enum": ["natural", "named", "hashed", "deterministic", "size", false]
+        },
+        "noEmitOnErrors": {
+          "description": "Avoid emitting assets when errors occur (deprecated: use 'emitOnErrors' instead).",
+          "type": "boolean",
+          "cli": {
+            "exclude": true
+          }
+        },
+        "nodeEnv": {
+          "description": "Set process.env.NODE_ENV to a specific value.",
+          "anyOf": [
+            {
+              "enum": [false]
+            },
+            {
+              "type": "string"
+            }
+          ]
+        },
+        "portableRecords": {
+          "description": "Generate records with relative paths to be able to move the context folder.",
+          "type": "boolean"
+        },
+        "providedExports": {
+          "description": "Figure out which exports are provided by modules to generate more efficient code.",
+          "type": "boolean"
+        },
+        "realContentHash": {
+          "description": "Use real [contenthash] based on final content of the assets.",
+          "type": "boolean"
+        },
+        "removeAvailableModules": {
+          "description": "Removes modules from chunks when these modules are already included in all parents.",
+          "type": "boolean"
+        },
+        "removeEmptyChunks": {
+          "description": "Remove chunks which are empty.",
+          "type": "boolean"
+        },
+        "runtimeChunk": {
+          "$ref": "#/definitions/OptimizationRuntimeChunk"
+        },
+        "sideEffects": {
+          "description": "Skip over modules which contain no side effects when exports are not used (false: disabled, 'flag': only use manually placed side effects flag, true: also analyse source code for side effects).",
+          "anyOf": [
+            {
+              "enum": ["flag"]
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "splitChunks": {
+          "description": "Optimize duplication and caching by splitting chunks by shared modules and cache group.",
+          "anyOf": [
+            {
+              "enum": [false]
+            },
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksOptions"
+            }
+          ]
+        },
+        "usedExports": {
+          "description": "Figure out which exports are used by modules to mangle export names, omit unused exports and generate more efficient code (true: analyse used exports for each runtime, \"global\": analyse exports globally for all runtimes combined).",
+          "anyOf": [
+            {
+              "enum": ["global"]
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        }
+      }
+    },
+    "OptimizationRuntimeChunk": {
+      "description": "Create an additional chunk which contains only the webpack runtime and chunk hash maps.",
+      "anyOf": [
+        {
+          "enum": ["single", "multiple"]
+        },
+        {
+          "type": "boolean"
+        },
+        {
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "name": {
+              "description": "The name or name factory for the runtime chunks.",
+              "anyOf": [
+                {
+                  "type": "string"
+                },
+                {
+                  "instanceof": "Function",
+                  "tsType": "Function"
+                }
+              ]
+            }
+          }
+        }
+      ]
+    },
+    "OptimizationRuntimeChunkNormalized": {
+      "description": "Create an additional chunk which contains only the webpack runtime and chunk hash maps.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "name": {
+              "description": "The name factory for the runtime chunks.",
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          }
+        }
+      ]
+    },
+    "OptimizationSplitChunksCacheGroup": {
+      "description": "Options object for describing behavior of a cache group selecting modules that should be cached together.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "automaticNameDelimiter": {
+          "description": "Sets the name delimiter for created chunks.",
+          "type": "string",
+          "minLength": 1
+        },
+        "chunks": {
+          "description": "Select chunks for determining cache group content (defaults to \"initial\", \"initial\" and \"all\" requires adding these chunks to the HTML).",
+          "anyOf": [
+            {
+              "enum": ["initial", "async", "all"]
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "((chunk: import('../lib/Chunk')) => boolean)"
+            }
+          ]
+        },
+        "enforce": {
+          "description": "Ignore minimum size, minimum chunks and maximum requests and always create chunks for this cache group.",
+          "type": "boolean"
+        },
+        "enforceSizeThreshold": {
+          "description": "Size threshold at which splitting is enforced and other restrictions (minRemainingSize, maxAsyncRequests, maxInitialRequests) are ignored.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "filename": {
+          "description": "Sets the template for the filename for created chunks.",
+          "anyOf": [
+            {
+              "type": "string",
+              "absolutePath": false,
+              "minLength": 1
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "((pathData: import(\"../lib/Compilation\").PathData, assetInfo?: import(\"../lib/Compilation\").AssetInfo) => string)"
+            }
+          ]
+        },
+        "idHint": {
+          "description": "Sets the hint for chunk id.",
+          "type": "string"
+        },
+        "layer": {
+          "description": "Assign modules to a cache group by module layer.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "string"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          ]
+        },
+        "maxAsyncRequests": {
+          "description": "Maximum number of requests which are accepted for on-demand loading.",
+          "type": "number",
+          "minimum": 1
+        },
+        "maxAsyncSize": {
+          "description": "Maximal size hint for the on-demand chunks.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "maxInitialRequests": {
+          "description": "Maximum number of initial chunks which are accepted for an entry point.",
+          "type": "number",
+          "minimum": 1
+        },
+        "maxInitialSize": {
+          "description": "Maximal size hint for the initial chunks.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "maxSize": {
+          "description": "Maximal size hint for the created chunks.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "minChunks": {
+          "description": "Minimum number of times a module has to be duplicated until it's considered for splitting.",
+          "type": "number",
+          "minimum": 1
+        },
+        "minRemainingSize": {
+          "description": "Minimal size for the chunks the stay after moving the modules to a new chunk.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "minSize": {
+          "description": "Minimal size for the created chunk.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "minSizeReduction": {
+          "description": "Minimum size reduction due to the created chunk.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "name": {
+          "description": "Give chunks for this cache group a name (chunks with equal name are merged).",
+          "anyOf": [
+            {
+              "enum": [false]
+            },
+            {
+              "type": "string"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          ]
+        },
+        "priority": {
+          "description": "Priority of this cache group.",
+          "type": "number"
+        },
+        "reuseExistingChunk": {
+          "description": "Try to reuse existing chunk (with name) when it has matching modules.",
+          "type": "boolean"
+        },
+        "test": {
+          "description": "Assign modules to a cache group by module name.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "string"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          ]
+        },
+        "type": {
+          "description": "Assign modules to a cache group by module type.",
+          "anyOf": [
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "type": "string"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          ]
+        },
+        "usedExports": {
+          "description": "Compare used exports when checking common modules. Modules will only be put in the same chunk when exports are equal.",
+          "type": "boolean"
+        }
+      }
+    },
+    "OptimizationSplitChunksGetCacheGroups": {
+      "description": "A function returning cache groups.",
+      "instanceof": "Function",
+      "tsType": "((module: import('../lib/Module')) => OptimizationSplitChunksCacheGroup | OptimizationSplitChunksCacheGroup[] | void)"
+    },
+    "OptimizationSplitChunksOptions": {
+      "description": "Options object for splitting chunks into smaller chunks.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "automaticNameDelimiter": {
+          "description": "Sets the name delimiter for created chunks.",
+          "type": "string",
+          "minLength": 1
+        },
+        "cacheGroups": {
+          "description": "Assign modules to a cache group (modules from different cache groups are tried to keep in separate chunks, default categories: 'default', 'defaultVendors').",
+          "type": "object",
+          "additionalProperties": {
+            "description": "Configuration for a cache group.",
+            "anyOf": [
+              {
+                "enum": [false]
+              },
+              {
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              {
+                "type": "string"
+              },
+              {
+                "instanceof": "Function",
+                "tsType": "Function"
+              },
+              {
+                "$ref": "#/definitions/OptimizationSplitChunksCacheGroup"
+              }
+            ]
+          },
+          "not": {
+            "description": "Using the cacheGroup shorthand syntax with a cache group named 'test' is a potential config error\nDid you intent to define a cache group with a test instead?\ncacheGroups: {\n  <name>: {\n    test: ...\n  }\n}.",
+            "type": "object",
+            "additionalProperties": true,
+            "properties": {
+              "test": {
+                "description": "The test property is a cache group name, but using the test option of the cache group could be intended instead.",
+                "anyOf": [
+                  {
+                    "instanceof": "RegExp",
+                    "tsType": "RegExp"
+                  },
+                  {
+                    "type": "string"
+                  },
+                  {
+                    "instanceof": "Function",
+                    "tsType": "Function"
+                  }
+                ]
+              }
+            },
+            "required": ["test"]
+          }
+        },
+        "chunks": {
+          "description": "Select chunks for determining shared modules (defaults to \"async\", \"initial\" and \"all\" requires adding these chunks to the HTML).",
+          "anyOf": [
+            {
+              "enum": ["initial", "async", "all"]
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "((chunk: import('../lib/Chunk')) => boolean)"
+            }
+          ]
+        },
+        "defaultSizeTypes": {
+          "description": "Sets the size types which are used when a number is used for sizes.",
+          "type": "array",
+          "items": {
+            "description": "Size type, like 'javascript', 'webassembly'.",
+            "type": "string"
+          },
+          "minItems": 1
+        },
+        "enforceSizeThreshold": {
+          "description": "Size threshold at which splitting is enforced and other restrictions (minRemainingSize, maxAsyncRequests, maxInitialRequests) are ignored.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "fallbackCacheGroup": {
+          "description": "Options for modules not selected by any other cache group.",
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "automaticNameDelimiter": {
+              "description": "Sets the name delimiter for created chunks.",
+              "type": "string",
+              "minLength": 1
+            },
+            "chunks": {
+              "description": "Select chunks for determining shared modules (defaults to \"async\", \"initial\" and \"all\" requires adding these chunks to the HTML).",
+              "anyOf": [
+                {
+                  "enum": ["initial", "async", "all"]
+                },
+                {
+                  "instanceof": "Function",
+                  "tsType": "((chunk: import('../lib/Chunk')) => boolean)"
+                }
+              ]
+            },
+            "maxAsyncSize": {
+              "description": "Maximal size hint for the on-demand chunks.",
+              "oneOf": [
+                {
+                  "$ref": "#/definitions/OptimizationSplitChunksSizes"
+                }
+              ]
+            },
+            "maxInitialSize": {
+              "description": "Maximal size hint for the initial chunks.",
+              "oneOf": [
+                {
+                  "$ref": "#/definitions/OptimizationSplitChunksSizes"
+                }
+              ]
+            },
+            "maxSize": {
+              "description": "Maximal size hint for the created chunks.",
+              "oneOf": [
+                {
+                  "$ref": "#/definitions/OptimizationSplitChunksSizes"
+                }
+              ]
+            },
+            "minSize": {
+              "description": "Minimal size for the created chunk.",
+              "oneOf": [
+                {
+                  "$ref": "#/definitions/OptimizationSplitChunksSizes"
+                }
+              ]
+            },
+            "minSizeReduction": {
+              "description": "Minimum size reduction due to the created chunk.",
+              "oneOf": [
+                {
+                  "$ref": "#/definitions/OptimizationSplitChunksSizes"
+                }
+              ]
+            }
+          }
+        },
+        "filename": {
+          "description": "Sets the template for the filename for created chunks.",
+          "anyOf": [
+            {
+              "type": "string",
+              "absolutePath": false,
+              "minLength": 1
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "((pathData: import(\"../lib/Compilation\").PathData, assetInfo?: import(\"../lib/Compilation\").AssetInfo) => string)"
+            }
+          ]
+        },
+        "hidePathInfo": {
+          "description": "Prevents exposing path info when creating names for parts splitted by maxSize.",
+          "type": "boolean"
+        },
+        "maxAsyncRequests": {
+          "description": "Maximum number of requests which are accepted for on-demand loading.",
+          "type": "number",
+          "minimum": 1
+        },
+        "maxAsyncSize": {
+          "description": "Maximal size hint for the on-demand chunks.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "maxInitialRequests": {
+          "description": "Maximum number of initial chunks which are accepted for an entry point.",
+          "type": "number",
+          "minimum": 1
+        },
+        "maxInitialSize": {
+          "description": "Maximal size hint for the initial chunks.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "maxSize": {
+          "description": "Maximal size hint for the created chunks.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "minChunks": {
+          "description": "Minimum number of times a module has to be duplicated until it's considered for splitting.",
+          "type": "number",
+          "minimum": 1
+        },
+        "minRemainingSize": {
+          "description": "Minimal size for the chunks the stay after moving the modules to a new chunk.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "minSize": {
+          "description": "Minimal size for the created chunks.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "minSizeReduction": {
+          "description": "Minimum size reduction due to the created chunk.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/OptimizationSplitChunksSizes"
+            }
+          ]
+        },
+        "name": {
+          "description": "Give chunks created a name (chunks with equal name are merged).",
+          "anyOf": [
+            {
+              "enum": [false]
+            },
+            {
+              "type": "string"
+            },
+            {
+              "instanceof": "Function",
+              "tsType": "Function"
+            }
+          ]
+        },
+        "usedExports": {
+          "description": "Compare used exports when checking common modules. Modules will only be put in the same chunk when exports are equal.",
+          "type": "boolean"
+        }
+      }
+    },
+    "OptimizationSplitChunksSizes": {
+      "description": "Size description for limits.",
+      "anyOf": [
+        {
+          "description": "Size of the javascript part of the chunk.",
+          "type": "number",
+          "minimum": 0
+        },
+        {
+          "description": "Specify size limits per size type.",
+          "type": "object",
+          "additionalProperties": {
+            "description": "Size of the part of the chunk with the type of the key.",
+            "type": "number"
+          }
+        }
+      ]
+    },
+    "Output": {
+      "description": "Options affecting the output of the compilation. `output` options tell webpack how to write the compiled files to disk.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "assetModuleFilename": {
+          "$ref": "#/definitions/AssetModuleFilename"
+        },
+        "asyncChunks": {
+          "description": "Enable/disable creating async chunks that are loaded on demand.",
+          "type": "boolean"
+        },
+        "auxiliaryComment": {
+          "cli": {
+            "exclude": true
+          },
+          "oneOf": [
+            {
+              "$ref": "#/definitions/AuxiliaryComment"
+            }
+          ]
+        },
+        "charset": {
+          "$ref": "#/definitions/Charset"
+        },
+        "chunkFilename": {
+          "$ref": "#/definitions/ChunkFilename"
+        },
+        "chunkFormat": {
+          "$ref": "#/definitions/ChunkFormat"
+        },
+        "chunkLoadTimeout": {
+          "$ref": "#/definitions/ChunkLoadTimeout"
+        },
+        "chunkLoading": {
+          "$ref": "#/definitions/ChunkLoading"
+        },
+        "chunkLoadingGlobal": {
+          "$ref": "#/definitions/ChunkLoadingGlobal"
+        },
+        "clean": {
+          "$ref": "#/definitions/Clean"
+        },
+        "compareBeforeEmit": {
+          "$ref": "#/definitions/CompareBeforeEmit"
+        },
+        "crossOriginLoading": {
+          "$ref": "#/definitions/CrossOriginLoading"
+        },
+        "cssChunkFilename": {
+          "$ref": "#/definitions/CssChunkFilename"
+        },
+        "cssFilename": {
+          "$ref": "#/definitions/CssFilename"
+        },
+        "devtoolFallbackModuleFilenameTemplate": {
+          "$ref": "#/definitions/DevtoolFallbackModuleFilenameTemplate"
+        },
+        "devtoolModuleFilenameTemplate": {
+          "$ref": "#/definitions/DevtoolModuleFilenameTemplate"
+        },
+        "devtoolNamespace": {
+          "$ref": "#/definitions/DevtoolNamespace"
+        },
+        "enabledChunkLoadingTypes": {
+          "$ref": "#/definitions/EnabledChunkLoadingTypes"
+        },
+        "enabledLibraryTypes": {
+          "$ref": "#/definitions/EnabledLibraryTypes"
+        },
+        "enabledWasmLoadingTypes": {
+          "$ref": "#/definitions/EnabledWasmLoadingTypes"
+        },
+        "environment": {
+          "$ref": "#/definitions/Environment"
+        },
+        "filename": {
+          "$ref": "#/definitions/Filename"
+        },
+        "globalObject": {
+          "$ref": "#/definitions/GlobalObject"
+        },
+        "hashDigest": {
+          "$ref": "#/definitions/HashDigest"
+        },
+        "hashDigestLength": {
+          "$ref": "#/definitions/HashDigestLength"
+        },
+        "hashFunction": {
+          "$ref": "#/definitions/HashFunction"
+        },
+        "hashSalt": {
+          "$ref": "#/definitions/HashSalt"
+        },
+        "hotUpdateChunkFilename": {
+          "$ref": "#/definitions/HotUpdateChunkFilename"
+        },
+        "hotUpdateGlobal": {
+          "$ref": "#/definitions/HotUpdateGlobal"
+        },
+        "hotUpdateMainFilename": {
+          "$ref": "#/definitions/HotUpdateMainFilename"
+        },
+        "iife": {
+          "$ref": "#/definitions/Iife"
+        },
+        "importFunctionName": {
+          "$ref": "#/definitions/ImportFunctionName"
+        },
+        "importMetaName": {
+          "$ref": "#/definitions/ImportMetaName"
+        },
+        "library": {
+          "$ref": "#/definitions/Library"
+        },
+        "libraryExport": {
+          "cli": {
+            "exclude": true
+          },
+          "oneOf": [
+            {
+              "$ref": "#/definitions/LibraryExport"
+            }
+          ]
+        },
+        "libraryTarget": {
+          "cli": {
+            "exclude": true
+          },
+          "oneOf": [
+            {
+              "$ref": "#/definitions/LibraryType"
+            }
+          ]
+        },
+        "module": {
+          "$ref": "#/definitions/OutputModule"
+        },
+        "path": {
+          "$ref": "#/definitions/Path"
+        },
+        "pathinfo": {
+          "$ref": "#/definitions/Pathinfo"
+        },
+        "publicPath": {
+          "$ref": "#/definitions/PublicPath"
+        },
+        "scriptType": {
+          "$ref": "#/definitions/ScriptType"
+        },
+        "sourceMapFilename": {
+          "$ref": "#/definitions/SourceMapFilename"
+        },
+        "sourcePrefix": {
+          "$ref": "#/definitions/SourcePrefix"
+        },
+        "strictModuleErrorHandling": {
+          "$ref": "#/definitions/StrictModuleErrorHandling"
+        },
+        "strictModuleExceptionHandling": {
+          "$ref": "#/definitions/StrictModuleExceptionHandling"
+        },
+        "trustedTypes": {
+          "description": "Use a Trusted Types policy to create urls for chunks. 'output.uniqueName' is used a default policy name. Passing a string sets a custom policy name.",
+          "anyOf": [
+            {
+              "enum": [true]
+            },
+            {
+              "description": "The name of the Trusted Types policy created by webpack to serve bundle chunks.",
+              "type": "string",
+              "minLength": 1
+            },
+            {
+              "$ref": "#/definitions/TrustedTypes"
+            }
+          ]
+        },
+        "umdNamedDefine": {
+          "cli": {
+            "exclude": true
+          },
+          "oneOf": [
+            {
+              "$ref": "#/definitions/UmdNamedDefine"
+            }
+          ]
+        },
+        "uniqueName": {
+          "$ref": "#/definitions/UniqueName"
+        },
+        "wasmLoading": {
+          "$ref": "#/definitions/WasmLoading"
+        },
+        "webassemblyModuleFilename": {
+          "$ref": "#/definitions/WebassemblyModuleFilename"
+        },
+        "workerChunkLoading": {
+          "$ref": "#/definitions/ChunkLoading"
+        },
+        "workerWasmLoading": {
+          "$ref": "#/definitions/WasmLoading"
+        }
+      }
+    },
+    "OutputModule": {
+      "description": "Output javascript files as module source type.",
+      "type": "boolean"
+    },
+    "OutputNormalized": {
+      "description": "Normalized options affecting the output of the compilation. `output` options tell webpack how to write the compiled files to disk.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "assetModuleFilename": {
+          "$ref": "#/definitions/AssetModuleFilename"
+        },
+        "asyncChunks": {
+          "description": "Enable/disable creating async chunks that are loaded on demand.",
+          "type": "boolean"
+        },
+        "charset": {
+          "$ref": "#/definitions/Charset"
+        },
+        "chunkFilename": {
+          "$ref": "#/definitions/ChunkFilename"
+        },
+        "chunkFormat": {
+          "$ref": "#/definitions/ChunkFormat"
+        },
+        "chunkLoadTimeout": {
+          "$ref": "#/definitions/ChunkLoadTimeout"
+        },
+        "chunkLoading": {
+          "$ref": "#/definitions/ChunkLoading"
+        },
+        "chunkLoadingGlobal": {
+          "$ref": "#/definitions/ChunkLoadingGlobal"
+        },
+        "clean": {
+          "$ref": "#/definitions/Clean"
+        },
+        "compareBeforeEmit": {
+          "$ref": "#/definitions/CompareBeforeEmit"
+        },
+        "crossOriginLoading": {
+          "$ref": "#/definitions/CrossOriginLoading"
+        },
+        "cssChunkFilename": {
+          "$ref": "#/definitions/CssChunkFilename"
+        },
+        "cssFilename": {
+          "$ref": "#/definitions/CssFilename"
+        },
+        "devtoolFallbackModuleFilenameTemplate": {
+          "$ref": "#/definitions/DevtoolFallbackModuleFilenameTemplate"
+        },
+        "devtoolModuleFilenameTemplate": {
+          "$ref": "#/definitions/DevtoolModuleFilenameTemplate"
+        },
+        "devtoolNamespace": {
+          "$ref": "#/definitions/DevtoolNamespace"
+        },
+        "enabledChunkLoadingTypes": {
+          "$ref": "#/definitions/EnabledChunkLoadingTypes"
+        },
+        "enabledLibraryTypes": {
+          "$ref": "#/definitions/EnabledLibraryTypes"
+        },
+        "enabledWasmLoadingTypes": {
+          "$ref": "#/definitions/EnabledWasmLoadingTypes"
+        },
+        "environment": {
+          "$ref": "#/definitions/Environment"
+        },
+        "filename": {
+          "$ref": "#/definitions/Filename"
+        },
+        "globalObject": {
+          "$ref": "#/definitions/GlobalObject"
+        },
+        "hashDigest": {
+          "$ref": "#/definitions/HashDigest"
+        },
+        "hashDigestLength": {
+          "$ref": "#/definitions/HashDigestLength"
+        },
+        "hashFunction": {
+          "$ref": "#/definitions/HashFunction"
+        },
+        "hashSalt": {
+          "$ref": "#/definitions/HashSalt"
+        },
+        "hotUpdateChunkFilename": {
+          "$ref": "#/definitions/HotUpdateChunkFilename"
+        },
+        "hotUpdateGlobal": {
+          "$ref": "#/definitions/HotUpdateGlobal"
+        },
+        "hotUpdateMainFilename": {
+          "$ref": "#/definitions/HotUpdateMainFilename"
+        },
+        "iife": {
+          "$ref": "#/definitions/Iife"
+        },
+        "importFunctionName": {
+          "$ref": "#/definitions/ImportFunctionName"
+        },
+        "importMetaName": {
+          "$ref": "#/definitions/ImportMetaName"
+        },
+        "library": {
+          "$ref": "#/definitions/LibraryOptions"
+        },
+        "module": {
+          "$ref": "#/definitions/OutputModule"
+        },
+        "path": {
+          "$ref": "#/definitions/Path"
+        },
+        "pathinfo": {
+          "$ref": "#/definitions/Pathinfo"
+        },
+        "publicPath": {
+          "$ref": "#/definitions/PublicPath"
+        },
+        "scriptType": {
+          "$ref": "#/definitions/ScriptType"
+        },
+        "sourceMapFilename": {
+          "$ref": "#/definitions/SourceMapFilename"
+        },
+        "sourcePrefix": {
+          "$ref": "#/definitions/SourcePrefix"
+        },
+        "strictModuleErrorHandling": {
+          "$ref": "#/definitions/StrictModuleErrorHandling"
+        },
+        "strictModuleExceptionHandling": {
+          "$ref": "#/definitions/StrictModuleExceptionHandling"
+        },
+        "trustedTypes": {
+          "$ref": "#/definitions/TrustedTypes"
+        },
+        "uniqueName": {
+          "$ref": "#/definitions/UniqueName"
+        },
+        "wasmLoading": {
+          "$ref": "#/definitions/WasmLoading"
+        },
+        "webassemblyModuleFilename": {
+          "$ref": "#/definitions/WebassemblyModuleFilename"
+        },
+        "workerChunkLoading": {
+          "$ref": "#/definitions/ChunkLoading"
+        },
+        "workerWasmLoading": {
+          "$ref": "#/definitions/WasmLoading"
+        }
+      }
+    },
+    "Parallelism": {
+      "description": "The number of parallel processed modules in the compilation.",
+      "type": "number",
+      "minimum": 1
+    },
+    "ParserOptionsByModuleType": {
+      "description": "Specify options for each parser.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Options for parsing.",
+        "type": "object",
+        "additionalProperties": true
+      },
+      "properties": {
+        "asset": {
+          "$ref": "#/definitions/AssetParserOptions"
+        },
+        "asset/inline": {
+          "$ref": "#/definitions/EmptyParserOptions"
+        },
+        "asset/resource": {
+          "$ref": "#/definitions/EmptyParserOptions"
+        },
+        "asset/source": {
+          "$ref": "#/definitions/EmptyParserOptions"
+        },
+        "javascript": {
+          "$ref": "#/definitions/JavascriptParserOptions"
+        },
+        "javascript/auto": {
+          "$ref": "#/definitions/JavascriptParserOptions"
+        },
+        "javascript/dynamic": {
+          "$ref": "#/definitions/JavascriptParserOptions"
+        },
+        "javascript/esm": {
+          "$ref": "#/definitions/JavascriptParserOptions"
+        }
+      }
+    },
+    "Path": {
+      "description": "The output directory as **absolute path** (required).",
+      "type": "string",
+      "absolutePath": true
+    },
+    "Pathinfo": {
+      "description": "Include comments with information about the modules.",
+      "anyOf": [
+        {
+          "enum": ["verbose"]
+        },
+        {
+          "type": "boolean"
+        }
+      ]
+    },
+    "Performance": {
+      "description": "Configuration for web performance recommendations.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "$ref": "#/definitions/PerformanceOptions"
+        }
+      ]
+    },
+    "PerformanceOptions": {
+      "description": "Configuration object for web performance recommendations.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "assetFilter": {
+          "description": "Filter function to select assets that are checked.",
+          "instanceof": "Function",
+          "tsType": "Function"
+        },
+        "hints": {
+          "description": "Sets the format of the hints: warnings, errors or nothing at all.",
+          "enum": [false, "warning", "error"]
+        },
+        "maxAssetSize": {
+          "description": "File size limit (in bytes) when exceeded, that webpack will provide performance hints.",
+          "type": "number"
+        },
+        "maxEntrypointSize": {
+          "description": "Total size of an entry point (in bytes).",
+          "type": "number"
+        }
+      }
+    },
+    "Plugins": {
+      "description": "Add additional plugins to the compiler.",
+      "type": "array",
+      "items": {
+        "description": "Plugin of type object or instanceof Function.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/WebpackPluginInstance"
+          },
+          {
+            "$ref": "#/definitions/WebpackPluginFunction"
+          }
+        ]
+      }
+    },
+    "Profile": {
+      "description": "Capture timing information for each module.",
+      "type": "boolean"
+    },
+    "PublicPath": {
+      "description": "The 'publicPath' specifies the public URL address of the output files when referenced in a browser.",
+      "anyOf": [
+        {
+          "enum": ["auto"]
+        },
+        {
+          "$ref": "#/definitions/RawPublicPath"
+        }
+      ]
+    },
+    "RawPublicPath": {
+      "description": "The 'publicPath' specifies the public URL address of the output files when referenced in a browser.",
+      "anyOf": [
+        {
+          "type": "string"
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((pathData: import(\"../lib/Compilation\").PathData, assetInfo?: import(\"../lib/Compilation\").AssetInfo) => string)"
+        }
+      ]
+    },
+    "RecordsInputPath": {
+      "description": "Store compiler state to a json file.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "type": "string",
+          "absolutePath": true
+        }
+      ]
+    },
+    "RecordsOutputPath": {
+      "description": "Load compiler state from a json file.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "type": "string",
+          "absolutePath": true
+        }
+      ]
+    },
+    "RecordsPath": {
+      "description": "Store/Load compiler state from/to a json file. This will result in persistent ids of modules and chunks. An absolute path is expected. `recordsPath` is used for `recordsInputPath` and `recordsOutputPath` if they left undefined.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "type": "string",
+          "absolutePath": true
+        }
+      ]
+    },
+    "Resolve": {
+      "description": "Options for the resolver.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/ResolveOptions"
+        }
+      ]
+    },
+    "ResolveAlias": {
+      "description": "Redirect module requests.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Alias configuration.",
+            "type": "object",
+            "additionalProperties": false,
+            "properties": {
+              "alias": {
+                "description": "New request.",
+                "anyOf": [
+                  {
+                    "description": "Multiple alternative requests.",
+                    "type": "array",
+                    "items": {
+                      "description": "One choice of request.",
+                      "type": "string",
+                      "minLength": 1
+                    }
+                  },
+                  {
+                    "description": "Ignore request (replace with empty module).",
+                    "enum": [false]
+                  },
+                  {
+                    "description": "New request.",
+                    "type": "string",
+                    "minLength": 1
+                  }
+                ]
+              },
+              "name": {
+                "description": "Request to be redirected.",
+                "type": "string"
+              },
+              "onlyModule": {
+                "description": "Redirect only exact matching request.",
+                "type": "boolean"
+              }
+            },
+            "required": ["alias", "name"]
+          }
+        },
+        {
+          "type": "object",
+          "additionalProperties": {
+            "description": "New request.",
+            "anyOf": [
+              {
+                "description": "Multiple alternative requests.",
+                "type": "array",
+                "items": {
+                  "description": "One choice of request.",
+                  "type": "string",
+                  "minLength": 1
+                }
+              },
+              {
+                "description": "Ignore request (replace with empty module).",
+                "enum": [false]
+              },
+              {
+                "description": "New request.",
+                "type": "string",
+                "minLength": 1
+              }
+            ]
+          }
+        }
+      ]
+    },
+    "ResolveLoader": {
+      "description": "Options for the resolver when resolving loaders.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/ResolveOptions"
+        }
+      ]
+    },
+    "ResolveOptions": {
+      "description": "Options object for resolving requests.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "alias": {
+          "$ref": "#/definitions/ResolveAlias"
+        },
+        "aliasFields": {
+          "description": "Fields in the description file (usually package.json) which are used to redirect requests inside the module.",
+          "type": "array",
+          "items": {
+            "description": "Field in the description file (usually package.json) which are used to redirect requests inside the module.",
+            "anyOf": [
+              {
+                "type": "array",
+                "items": {
+                  "description": "Part of the field path in the description file (usually package.json) which are used to redirect requests inside the module.",
+                  "type": "string",
+                  "minLength": 1
+                }
+              },
+              {
+                "type": "string",
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "byDependency": {
+          "description": "Extra resolve options per dependency category. Typical categories are \"commonjs\", \"amd\", \"esm\".",
+          "type": "object",
+          "additionalProperties": {
+            "description": "Options object for resolving requests.",
+            "oneOf": [
+              {
+                "$ref": "#/definitions/ResolveOptions"
+              }
+            ]
+          }
+        },
+        "cache": {
+          "description": "Enable caching of successfully resolved requests (cache entries are revalidated).",
+          "type": "boolean"
+        },
+        "cachePredicate": {
+          "description": "Predicate function to decide which requests should be cached.",
+          "instanceof": "Function",
+          "tsType": "((request: import('enhanced-resolve').ResolveRequest) => boolean)"
+        },
+        "cacheWithContext": {
+          "description": "Include the context information in the cache identifier when caching.",
+          "type": "boolean"
+        },
+        "conditionNames": {
+          "description": "Condition names for exports field entry point.",
+          "type": "array",
+          "items": {
+            "description": "Condition names for exports field entry point.",
+            "type": "string"
+          }
+        },
+        "descriptionFiles": {
+          "description": "Filenames used to find a description file (like a package.json).",
+          "type": "array",
+          "items": {
+            "description": "Filename used to find a description file (like a package.json).",
+            "type": "string",
+            "minLength": 1
+          }
+        },
+        "enforceExtension": {
+          "description": "Enforce the resolver to use one of the extensions from the extensions option (User must specify requests without extension).",
+          "type": "boolean"
+        },
+        "exportsFields": {
+          "description": "Field names from the description file (usually package.json) which are used to provide entry points of a package.",
+          "type": "array",
+          "items": {
+            "description": "Field name from the description file (usually package.json) which is used to provide entry points of a package.",
+            "type": "string"
+          }
+        },
+        "extensions": {
+          "description": "Extensions added to the request when trying to find the file.",
+          "type": "array",
+          "items": {
+            "description": "Extension added to the request when trying to find the file.",
+            "type": "string"
+          }
+        },
+        "fallback": {
+          "description": "Redirect module requests when normal resolving fails.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/ResolveAlias"
+            }
+          ]
+        },
+        "fileSystem": {
+          "description": "Filesystem for the resolver.",
+          "tsType": "(import('../lib/util/fs').InputFileSystem)"
+        },
+        "fullySpecified": {
+          "description": "Treats the request specified by the user as fully specified, meaning no extensions are added and the mainFiles in directories are not resolved (This doesn't affect requests from mainFields, aliasFields or aliases).",
+          "type": "boolean"
+        },
+        "importsFields": {
+          "description": "Field names from the description file (usually package.json) which are used to provide internal request of a package (requests starting with # are considered as internal).",
+          "type": "array",
+          "items": {
+            "description": "Field name from the description file (usually package.json) which is used to provide internal request of a package (requests starting with # are considered as internal).",
+            "type": "string"
+          }
+        },
+        "mainFields": {
+          "description": "Field names from the description file (package.json) which are used to find the default entry point.",
+          "type": "array",
+          "items": {
+            "description": "Field name from the description file (package.json) which are used to find the default entry point.",
+            "anyOf": [
+              {
+                "type": "array",
+                "items": {
+                  "description": "Part of the field path from the description file (package.json) which are used to find the default entry point.",
+                  "type": "string",
+                  "minLength": 1
+                }
+              },
+              {
+                "type": "string",
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "mainFiles": {
+          "description": "Filenames used to find the default entry point if there is no description file or main field.",
+          "type": "array",
+          "items": {
+            "description": "Filename used to find the default entry point if there is no description file or main field.",
+            "type": "string",
+            "minLength": 1
+          }
+        },
+        "modules": {
+          "description": "Folder names or directory paths where to find modules.",
+          "type": "array",
+          "items": {
+            "description": "Folder name or directory path where to find modules.",
+            "type": "string",
+            "minLength": 1
+          }
+        },
+        "plugins": {
+          "description": "Plugins for the resolver.",
+          "type": "array",
+          "cli": {
+            "exclude": true
+          },
+          "items": {
+            "description": "Plugin of type object or instanceof Function.",
+            "anyOf": [
+              {
+                "enum": ["..."]
+              },
+              {
+                "$ref": "#/definitions/ResolvePluginInstance"
+              }
+            ]
+          }
+        },
+        "preferAbsolute": {
+          "description": "Prefer to resolve server-relative URLs (starting with '/') as absolute paths before falling back to resolve in 'resolve.roots'.",
+          "type": "boolean"
+        },
+        "preferRelative": {
+          "description": "Prefer to resolve module requests as relative request and fallback to resolving as module.",
+          "type": "boolean"
+        },
+        "resolver": {
+          "description": "Custom resolver.",
+          "tsType": "(import('enhanced-resolve').Resolver)"
+        },
+        "restrictions": {
+          "description": "A list of resolve restrictions. Resolve results must fulfill all of these restrictions to resolve successfully. Other resolve paths are taken when restrictions are not met.",
+          "type": "array",
+          "items": {
+            "description": "Resolve restriction. Resolve result must fulfill this restriction.",
+            "anyOf": [
+              {
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              {
+                "type": "string",
+                "absolutePath": true,
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "roots": {
+          "description": "A list of directories in which requests that are server-relative URLs (starting with '/') are resolved.",
+          "type": "array",
+          "items": {
+            "description": "Directory in which requests that are server-relative URLs (starting with '/') are resolved.",
+            "type": "string"
+          }
+        },
+        "symlinks": {
+          "description": "Enable resolving symlinks to the original location.",
+          "type": "boolean"
+        },
+        "unsafeCache": {
+          "description": "Enable caching of successfully resolved requests (cache entries are not revalidated).",
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "type": "object",
+              "additionalProperties": true
+            }
+          ]
+        },
+        "useSyncFileSystemCalls": {
+          "description": "Use synchronous filesystem calls for the resolver.",
+          "type": "boolean"
+        }
+      }
+    },
+    "ResolvePluginInstance": {
+      "description": "Plugin instance.",
+      "type": "object",
+      "additionalProperties": true,
+      "properties": {
+        "apply": {
+          "description": "The run point of the plugin, required method.",
+          "instanceof": "Function",
+          "tsType": "(resolver: import('enhanced-resolve').Resolver) => void"
+        }
+      },
+      "required": ["apply"]
+    },
+    "RuleSetCondition": {
+      "description": "A condition matcher.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string"
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((value: string) => boolean)"
+        },
+        {
+          "$ref": "#/definitions/RuleSetLogicalConditions"
+        },
+        {
+          "$ref": "#/definitions/RuleSetConditions"
+        }
+      ]
+    },
+    "RuleSetConditionAbsolute": {
+      "description": "A condition matcher matching an absolute path.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "absolutePath": true
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((value: string) => boolean)"
+        },
+        {
+          "$ref": "#/definitions/RuleSetLogicalConditionsAbsolute"
+        },
+        {
+          "$ref": "#/definitions/RuleSetConditionsAbsolute"
+        }
+      ]
+    },
+    "RuleSetConditionOrConditions": {
+      "description": "One or multiple rule conditions.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "$ref": "#/definitions/RuleSetCondition"
+        },
+        {
+          "$ref": "#/definitions/RuleSetConditions"
+        }
+      ]
+    },
+    "RuleSetConditionOrConditionsAbsolute": {
+      "description": "One or multiple rule conditions matching an absolute path.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "$ref": "#/definitions/RuleSetConditionAbsolute"
+        },
+        {
+          "$ref": "#/definitions/RuleSetConditionsAbsolute"
+        }
+      ]
+    },
+    "RuleSetConditions": {
+      "description": "A list of rule conditions.",
+      "type": "array",
+      "items": {
+        "description": "A rule condition.",
+        "oneOf": [
+          {
+            "$ref": "#/definitions/RuleSetCondition"
+          }
+        ]
+      }
+    },
+    "RuleSetConditionsAbsolute": {
+      "description": "A list of rule conditions matching an absolute path.",
+      "type": "array",
+      "items": {
+        "description": "A rule condition matching an absolute path.",
+        "oneOf": [
+          {
+            "$ref": "#/definitions/RuleSetConditionAbsolute"
+          }
+        ]
+      }
+    },
+    "RuleSetLoader": {
+      "description": "A loader request.",
+      "type": "string",
+      "minLength": 1
+    },
+    "RuleSetLoaderOptions": {
+      "description": "Options passed to a loader.",
+      "anyOf": [
+        {
+          "type": "string"
+        },
+        {
+          "type": "object"
+        }
+      ]
+    },
+    "RuleSetLogicalConditions": {
+      "description": "Logic operators used in a condition matcher.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "and": {
+          "description": "Logical AND.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditions"
+            }
+          ]
+        },
+        "not": {
+          "description": "Logical NOT.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetCondition"
+            }
+          ]
+        },
+        "or": {
+          "description": "Logical OR.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditions"
+            }
+          ]
+        }
+      }
+    },
+    "RuleSetLogicalConditionsAbsolute": {
+      "description": "Logic operators used in a condition matcher.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "and": {
+          "description": "Logical AND.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionsAbsolute"
+            }
+          ]
+        },
+        "not": {
+          "description": "Logical NOT.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionAbsolute"
+            }
+          ]
+        },
+        "or": {
+          "description": "Logical OR.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionsAbsolute"
+            }
+          ]
+        }
+      }
+    },
+    "RuleSetRule": {
+      "description": "A rule description with conditions and effects for modules.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "assert": {
+          "description": "Match on import assertions of the dependency.",
+          "type": "object",
+          "additionalProperties": {
+            "$ref": "#/definitions/RuleSetConditionOrConditions"
+          }
+        },
+        "compiler": {
+          "description": "Match the child compiler name.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditions"
+            }
+          ]
+        },
+        "dependency": {
+          "description": "Match dependency type.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditions"
+            }
+          ]
+        },
+        "descriptionData": {
+          "description": "Match values of properties in the description file (usually package.json).",
+          "type": "object",
+          "additionalProperties": {
+            "$ref": "#/definitions/RuleSetConditionOrConditions"
+          }
+        },
+        "enforce": {
+          "description": "Enforce this rule as pre or post step.",
+          "enum": ["pre", "post"]
+        },
+        "exclude": {
+          "description": "Shortcut for resource.exclude.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditionsAbsolute"
+            }
+          ]
+        },
+        "generator": {
+          "description": "The options for the module generator.",
+          "type": "object"
+        },
+        "include": {
+          "description": "Shortcut for resource.include.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditionsAbsolute"
+            }
+          ]
+        },
+        "issuer": {
+          "description": "Match the issuer of the module (The module pointing to this module).",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditionsAbsolute"
+            }
+          ]
+        },
+        "issuerLayer": {
+          "description": "Match layer of the issuer of this module (The module pointing to this module).",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditions"
+            }
+          ]
+        },
+        "layer": {
+          "description": "Specifies the layer in which the module should be placed in.",
+          "type": "string"
+        },
+        "loader": {
+          "description": "Shortcut for use.loader.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetLoader"
+            }
+          ]
+        },
+        "mimetype": {
+          "description": "Match module mimetype when load from Data URI.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditions"
+            }
+          ]
+        },
+        "oneOf": {
+          "description": "Only execute the first matching rule in this array.",
+          "type": "array",
+          "items": {
+            "description": "A rule.",
+            "oneOf": [
+              {
+                "$ref": "#/definitions/RuleSetRule"
+              }
+            ]
+          }
+        },
+        "options": {
+          "description": "Shortcut for use.options.",
+          "cli": {
+            "exclude": true
+          },
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetLoaderOptions"
+            }
+          ]
+        },
+        "parser": {
+          "description": "Options for parsing.",
+          "type": "object",
+          "additionalProperties": true
+        },
+        "realResource": {
+          "description": "Match the real resource path of the module.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditionsAbsolute"
+            }
+          ]
+        },
+        "resolve": {
+          "description": "Options for the resolver.",
+          "type": "object",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/ResolveOptions"
+            }
+          ]
+        },
+        "resource": {
+          "description": "Match the resource path of the module.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditionsAbsolute"
+            }
+          ]
+        },
+        "resourceFragment": {
+          "description": "Match the resource fragment of the module.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditions"
+            }
+          ]
+        },
+        "resourceQuery": {
+          "description": "Match the resource query of the module.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditions"
+            }
+          ]
+        },
+        "rules": {
+          "description": "Match and execute these rules when this rule is matched.",
+          "type": "array",
+          "items": {
+            "description": "A rule.",
+            "oneOf": [
+              {
+                "$ref": "#/definitions/RuleSetRule"
+              }
+            ]
+          }
+        },
+        "scheme": {
+          "description": "Match module scheme.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditions"
+            }
+          ]
+        },
+        "sideEffects": {
+          "description": "Flags a module as with or without side effects.",
+          "type": "boolean"
+        },
+        "test": {
+          "description": "Shortcut for resource.test.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetConditionOrConditionsAbsolute"
+            }
+          ]
+        },
+        "type": {
+          "description": "Module type to use for the module.",
+          "type": "string"
+        },
+        "use": {
+          "description": "Modifiers applied to the module when rule is matched.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/RuleSetUse"
+            }
+          ]
+        }
+      }
+    },
+    "RuleSetRules": {
+      "description": "A list of rules.",
+      "type": "array",
+      "items": {
+        "description": "A rule.",
+        "anyOf": [
+          {
+            "cli": {
+              "exclude": true
+            },
+            "enum": ["..."]
+          },
+          {
+            "$ref": "#/definitions/RuleSetRule"
+          }
+        ]
+      }
+    },
+    "RuleSetUse": {
+      "description": "A list of descriptions of loaders applied.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "An use item.",
+            "oneOf": [
+              {
+                "$ref": "#/definitions/RuleSetUseItem"
+              }
+            ]
+          }
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((data: { resource: string, realResource: string, resourceQuery: string, issuer: string, compiler: string }) => RuleSetUseItem[])"
+        },
+        {
+          "$ref": "#/definitions/RuleSetUseItem"
+        }
+      ]
+    },
+    "RuleSetUseItem": {
+      "description": "A description of an applied loader.",
+      "anyOf": [
+        {
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "ident": {
+              "description": "Unique loader options identifier.",
+              "type": "string"
+            },
+            "loader": {
+              "description": "Loader name.",
+              "oneOf": [
+                {
+                  "$ref": "#/definitions/RuleSetLoader"
+                }
+              ]
+            },
+            "options": {
+              "description": "Loader options.",
+              "oneOf": [
+                {
+                  "$ref": "#/definitions/RuleSetLoaderOptions"
+                }
+              ]
+            }
+          }
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((data: object) => RuleSetUseItem|RuleSetUseItem[])"
+        },
+        {
+          "$ref": "#/definitions/RuleSetLoader"
+        }
+      ]
+    },
+    "ScriptType": {
+      "description": "This option enables loading async chunks via a custom script type, such as script type=\"module\".",
+      "enum": [false, "text/javascript", "module"]
+    },
+    "SnapshotOptions": {
+      "description": "Options affecting how file system snapshots are created and validated.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "buildDependencies": {
+          "description": "Options for snapshotting build dependencies to determine if the whole cache need to be invalidated.",
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "hash": {
+              "description": "Use hashes of the content of the files/directories to determine invalidation.",
+              "type": "boolean"
+            },
+            "timestamp": {
+              "description": "Use timestamps of the files/directories to determine invalidation.",
+              "type": "boolean"
+            }
+          }
+        },
+        "immutablePaths": {
+          "description": "List of paths that are managed by a package manager and contain a version or hash in its path so all files are immutable.",
+          "type": "array",
+          "items": {
+            "description": "List of paths that are managed by a package manager and contain a version or hash in its path so all files are immutable.",
+            "anyOf": [
+              {
+                "description": "A RegExp matching an immutable directory (usually a package manager cache directory, including the tailing slash)",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              {
+                "description": "A path to an immutable directory (usually a package manager cache directory).",
+                "type": "string",
+                "absolutePath": true,
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "managedPaths": {
+          "description": "List of paths that are managed by a package manager and can be trusted to not be modified otherwise.",
+          "type": "array",
+          "items": {
+            "description": "List of paths that are managed by a package manager and can be trusted to not be modified otherwise.",
+            "anyOf": [
+              {
+                "description": "A RegExp matching a managed directory (usually a node_modules directory, including the tailing slash)",
+                "instanceof": "RegExp",
+                "tsType": "RegExp"
+              },
+              {
+                "description": "A path to a managed directory (usually a node_modules directory).",
+                "type": "string",
+                "absolutePath": true,
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "module": {
+          "description": "Options for snapshotting dependencies of modules to determine if they need to be built again.",
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "hash": {
+              "description": "Use hashes of the content of the files/directories to determine invalidation.",
+              "type": "boolean"
+            },
+            "timestamp": {
+              "description": "Use timestamps of the files/directories to determine invalidation.",
+              "type": "boolean"
+            }
+          }
+        },
+        "resolve": {
+          "description": "Options for snapshotting dependencies of request resolving to determine if requests need to be re-resolved.",
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "hash": {
+              "description": "Use hashes of the content of the files/directories to determine invalidation.",
+              "type": "boolean"
+            },
+            "timestamp": {
+              "description": "Use timestamps of the files/directories to determine invalidation.",
+              "type": "boolean"
+            }
+          }
+        },
+        "resolveBuildDependencies": {
+          "description": "Options for snapshotting the resolving of build dependencies to determine if the build dependencies need to be re-resolved.",
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "hash": {
+              "description": "Use hashes of the content of the files/directories to determine invalidation.",
+              "type": "boolean"
+            },
+            "timestamp": {
+              "description": "Use timestamps of the files/directories to determine invalidation.",
+              "type": "boolean"
+            }
+          }
+        }
+      }
+    },
+    "SourceMapFilename": {
+      "description": "The filename of the SourceMaps for the JavaScript files. They are inside the 'output.path' directory.",
+      "type": "string",
+      "absolutePath": false
+    },
+    "SourcePrefix": {
+      "description": "Prefixes every line of the source in the bundle with this string.",
+      "type": "string"
+    },
+    "StatsOptions": {
+      "description": "Stats options object.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "all": {
+          "description": "Fallback value for stats options when an option is not defined (has precedence over local webpack defaults).",
+          "type": "boolean"
+        },
+        "assets": {
+          "description": "Add assets information.",
+          "type": "boolean"
+        },
+        "assetsSort": {
+          "description": "Sort the assets by that field.",
+          "type": "string"
+        },
+        "assetsSpace": {
+          "description": "Space to display assets (groups will be collapsed to fit this space).",
+          "type": "number"
+        },
+        "builtAt": {
+          "description": "Add built at time information.",
+          "type": "boolean"
+        },
+        "cached": {
+          "description": "Add information about cached (not built) modules (deprecated: use 'cachedModules' instead).",
+          "type": "boolean"
+        },
+        "cachedAssets": {
+          "description": "Show cached assets (setting this to `false` only shows emitted files).",
+          "type": "boolean"
+        },
+        "cachedModules": {
+          "description": "Add information about cached (not built) modules.",
+          "type": "boolean"
+        },
+        "children": {
+          "description": "Add children information.",
+          "type": "boolean"
+        },
+        "chunkGroupAuxiliary": {
+          "description": "Display auxiliary assets in chunk groups.",
+          "type": "boolean"
+        },
+        "chunkGroupChildren": {
+          "description": "Display children of chunk groups.",
+          "type": "boolean"
+        },
+        "chunkGroupMaxAssets": {
+          "description": "Limit of assets displayed in chunk groups.",
+          "type": "number"
+        },
+        "chunkGroups": {
+          "description": "Display all chunk groups with the corresponding bundles.",
+          "type": "boolean"
+        },
+        "chunkModules": {
+          "description": "Add built modules information to chunk information.",
+          "type": "boolean"
+        },
+        "chunkModulesSpace": {
+          "description": "Space to display chunk modules (groups will be collapsed to fit this space, value is in number of modules/group).",
+          "type": "number"
+        },
+        "chunkOrigins": {
+          "description": "Add the origins of chunks and chunk merging info.",
+          "type": "boolean"
+        },
+        "chunkRelations": {
+          "description": "Add information about parent, children and sibling chunks to chunk information.",
+          "type": "boolean"
+        },
+        "chunks": {
+          "description": "Add chunk information.",
+          "type": "boolean"
+        },
+        "chunksSort": {
+          "description": "Sort the chunks by that field.",
+          "type": "string"
+        },
+        "colors": {
+          "description": "Enables/Disables colorful output.",
+          "anyOf": [
+            {
+              "description": "Enables/Disables colorful output.",
+              "type": "boolean"
+            },
+            {
+              "type": "object",
+              "additionalProperties": false,
+              "properties": {
+                "bold": {
+                  "description": "Custom color for bold text.",
+                  "type": "string"
+                },
+                "cyan": {
+                  "description": "Custom color for cyan text.",
+                  "type": "string"
+                },
+                "green": {
+                  "description": "Custom color for green text.",
+                  "type": "string"
+                },
+                "magenta": {
+                  "description": "Custom color for magenta text.",
+                  "type": "string"
+                },
+                "red": {
+                  "description": "Custom color for red text.",
+                  "type": "string"
+                },
+                "yellow": {
+                  "description": "Custom color for yellow text.",
+                  "type": "string"
+                }
+              }
+            }
+          ]
+        },
+        "context": {
+          "description": "Context directory for request shortening.",
+          "type": "string",
+          "absolutePath": true
+        },
+        "dependentModules": {
+          "description": "Show chunk modules that are dependencies of other modules of the chunk.",
+          "type": "boolean"
+        },
+        "depth": {
+          "description": "Add module depth in module graph.",
+          "type": "boolean"
+        },
+        "entrypoints": {
+          "description": "Display the entry points with the corresponding bundles.",
+          "anyOf": [
+            {
+              "enum": ["auto"]
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "env": {
+          "description": "Add --env information.",
+          "type": "boolean"
+        },
+        "errorDetails": {
+          "description": "Add details to errors (like resolving log).",
+          "anyOf": [
+            {
+              "enum": ["auto"]
+            },
+            {
+              "type": "boolean"
+            }
+          ]
+        },
+        "errorStack": {
+          "description": "Add internal stack trace to errors.",
+          "type": "boolean"
+        },
+        "errors": {
+          "description": "Add errors.",
+          "type": "boolean"
+        },
+        "errorsCount": {
+          "description": "Add errors count.",
+          "type": "boolean"
+        },
+        "exclude": {
+          "description": "Please use excludeModules instead.",
+          "cli": {
+            "exclude": true
+          },
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "$ref": "#/definitions/ModuleFilterTypes"
+            }
+          ]
+        },
+        "excludeAssets": {
+          "description": "Suppress assets that match the specified filters. Filters can be Strings, RegExps or Functions.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/AssetFilterTypes"
+            }
+          ]
+        },
+        "excludeModules": {
+          "description": "Suppress modules that match the specified filters. Filters can be Strings, RegExps, Booleans or Functions.",
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "$ref": "#/definitions/ModuleFilterTypes"
+            }
+          ]
+        },
+        "groupAssetsByChunk": {
+          "description": "Group assets by how their are related to chunks.",
+          "type": "boolean"
+        },
+        "groupAssetsByEmitStatus": {
+          "description": "Group assets by their status (emitted, compared for emit or cached).",
+          "type": "boolean"
+        },
+        "groupAssetsByExtension": {
+          "description": "Group assets by their extension.",
+          "type": "boolean"
+        },
+        "groupAssetsByInfo": {
+          "description": "Group assets by their asset info (immutable, development, hotModuleReplacement, etc).",
+          "type": "boolean"
+        },
+        "groupAssetsByPath": {
+          "description": "Group assets by their path.",
+          "type": "boolean"
+        },
+        "groupModulesByAttributes": {
+          "description": "Group modules by their attributes (errors, warnings, assets, optional, orphan, or dependent).",
+          "type": "boolean"
+        },
+        "groupModulesByCacheStatus": {
+          "description": "Group modules by their status (cached or built and cacheable).",
+          "type": "boolean"
+        },
+        "groupModulesByExtension": {
+          "description": "Group modules by their extension.",
+          "type": "boolean"
+        },
+        "groupModulesByLayer": {
+          "description": "Group modules by their layer.",
+          "type": "boolean"
+        },
+        "groupModulesByPath": {
+          "description": "Group modules by their path.",
+          "type": "boolean"
+        },
+        "groupModulesByType": {
+          "description": "Group modules by their type.",
+          "type": "boolean"
+        },
+        "groupReasonsByOrigin": {
+          "description": "Group reasons by their origin module.",
+          "type": "boolean"
+        },
+        "hash": {
+          "description": "Add the hash of the compilation.",
+          "type": "boolean"
+        },
+        "ids": {
+          "description": "Add ids.",
+          "type": "boolean"
+        },
+        "logging": {
+          "description": "Add logging output.",
+          "anyOf": [
+            {
+              "description": "Specify log level of logging output.",
+              "enum": ["none", "error", "warn", "info", "log", "verbose"]
+            },
+            {
+              "description": "Enable/disable logging output (`true`: shows normal logging output, loglevel: log).",
+              "type": "boolean"
+            }
+          ]
+        },
+        "loggingDebug": {
+          "description": "Include debug logging of specified loggers (i. e. for plugins or loaders). Filters can be Strings, RegExps or Functions.",
+          "anyOf": [
+            {
+              "description": "Enable/Disable debug logging for all loggers.",
+              "type": "boolean"
+            },
+            {
+              "$ref": "#/definitions/FilterTypes"
+            }
+          ]
+        },
+        "loggingTrace": {
+          "description": "Add stack traces to logging output.",
+          "type": "boolean"
+        },
+        "moduleAssets": {
+          "description": "Add information about assets inside modules.",
+          "type": "boolean"
+        },
+        "moduleTrace": {
+          "description": "Add dependencies and origin of warnings/errors.",
+          "type": "boolean"
+        },
+        "modules": {
+          "description": "Add built modules information.",
+          "type": "boolean"
+        },
+        "modulesSort": {
+          "description": "Sort the modules by that field.",
+          "type": "string"
+        },
+        "modulesSpace": {
+          "description": "Space to display modules (groups will be collapsed to fit this space, value is in number of modules/groups).",
+          "type": "number"
+        },
+        "nestedModules": {
+          "description": "Add information about modules nested in other modules (like with module concatenation).",
+          "type": "boolean"
+        },
+        "nestedModulesSpace": {
+          "description": "Space to display modules nested within other modules (groups will be collapsed to fit this space, value is in number of modules/group).",
+          "type": "number"
+        },
+        "optimizationBailout": {
+          "description": "Show reasons why optimization bailed out for modules.",
+          "type": "boolean"
+        },
+        "orphanModules": {
+          "description": "Add information about orphan modules.",
+          "type": "boolean"
+        },
+        "outputPath": {
+          "description": "Add output path information.",
+          "type": "boolean"
+        },
+        "performance": {
+          "description": "Add performance hint flags.",
+          "type": "boolean"
+        },
+        "preset": {
+          "description": "Preset for the default values.",
+          "anyOf": [
+            {
+              "type": "boolean"
+            },
+            {
+              "type": "string"
+            }
+          ]
+        },
+        "providedExports": {
+          "description": "Show exports provided by modules.",
+          "type": "boolean"
+        },
+        "publicPath": {
+          "description": "Add public path information.",
+          "type": "boolean"
+        },
+        "reasons": {
+          "description": "Add information about the reasons why modules are included.",
+          "type": "boolean"
+        },
+        "reasonsSpace": {
+          "description": "Space to display reasons (groups will be collapsed to fit this space).",
+          "type": "number"
+        },
+        "relatedAssets": {
+          "description": "Add information about assets that are related to other assets (like SourceMaps for assets).",
+          "type": "boolean"
+        },
+        "runtime": {
+          "description": "Add information about runtime modules (deprecated: use 'runtimeModules' instead).",
+          "type": "boolean"
+        },
+        "runtimeModules": {
+          "description": "Add information about runtime modules.",
+          "type": "boolean"
+        },
+        "source": {
+          "description": "Add the source code of modules.",
+          "type": "boolean"
+        },
+        "timings": {
+          "description": "Add timing information.",
+          "type": "boolean"
+        },
+        "usedExports": {
+          "description": "Show exports used by modules.",
+          "type": "boolean"
+        },
+        "version": {
+          "description": "Add webpack version information.",
+          "type": "boolean"
+        },
+        "warnings": {
+          "description": "Add warnings.",
+          "type": "boolean"
+        },
+        "warningsCount": {
+          "description": "Add warnings count.",
+          "type": "boolean"
+        },
+        "warningsFilter": {
+          "description": "Suppress listing warnings that match the specified filters (they will still be counted). Filters can be Strings, RegExps or Functions.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/WarningFilterTypes"
+            }
+          ]
+        }
+      }
+    },
+    "StatsValue": {
+      "description": "Stats options object or preset name.",
+      "anyOf": [
+        {
+          "enum": [
+            "none",
+            "summary",
+            "errors-only",
+            "errors-warnings",
+            "minimal",
+            "normal",
+            "detailed",
+            "verbose"
+          ]
+        },
+        {
+          "type": "boolean"
+        },
+        {
+          "$ref": "#/definitions/StatsOptions"
+        }
+      ]
+    },
+    "StrictModuleErrorHandling": {
+      "description": "Handles error in module loading correctly at a performance cost. This will handle module error compatible with the EcmaScript Modules spec.",
+      "type": "boolean"
+    },
+    "StrictModuleExceptionHandling": {
+      "description": "Handles exceptions in module loading correctly at a performance cost (Deprecated). This will handle module error compatible with the Node.js CommonJS way.",
+      "type": "boolean"
+    },
+    "Target": {
+      "description": "Environment to build for. An array of environments to build for all of them when possible.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Environment to build for.",
+            "type": "string",
+            "minLength": 1
+          },
+          "minItems": 1
+        },
+        {
+          "enum": [false]
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "TrustedTypes": {
+      "description": "Use a Trusted Types policy to create urls for chunks.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "policyName": {
+          "description": "The name of the Trusted Types policy created by webpack to serve bundle chunks.",
+          "type": "string",
+          "minLength": 1
+        }
+      }
+    },
+    "UmdNamedDefine": {
+      "description": "If `output.libraryTarget` is set to umd and `output.library` is set, setting this to true will name the AMD module.",
+      "type": "boolean"
+    },
+    "UniqueName": {
+      "description": "A unique name of the webpack build to avoid multiple webpack runtimes to conflict when using globals.",
+      "type": "string",
+      "minLength": 1
+    },
+    "WarningFilterItemTypes": {
+      "description": "Filtering value, regexp or function.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "absolutePath": false
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "((warning: import('../lib/stats/DefaultStatsFactoryPlugin').StatsError, value: string) => boolean)"
+        }
+      ]
+    },
+    "WarningFilterTypes": {
+      "description": "Filtering warnings.",
+      "cli": {
+        "helper": true
+      },
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Rule to filter.",
+            "cli": {
+              "helper": true
+            },
+            "oneOf": [
+              {
+                "$ref": "#/definitions/WarningFilterItemTypes"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/WarningFilterItemTypes"
+        }
+      ]
+    },
+    "WasmLoading": {
+      "description": "The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "$ref": "#/definitions/WasmLoadingType"
+        }
+      ]
+    },
+    "WasmLoadingType": {
+      "description": "The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": ["fetch-streaming", "fetch", "async-node"]
+        },
+        {
+          "type": "string"
+        }
+      ]
+    },
+    "Watch": {
+      "description": "Enter watch mode, which rebuilds on file change.",
+      "type": "boolean"
+    },
+    "WatchOptions": {
+      "description": "Options for the watcher.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "aggregateTimeout": {
+          "description": "Delay the rebuilt after the first change. Value is a time in ms.",
+          "type": "number"
+        },
+        "followSymlinks": {
+          "description": "Resolve symlinks and watch symlink and real file. This is usually not needed as webpack already resolves symlinks ('resolve.symlinks').",
+          "type": "boolean"
+        },
+        "ignored": {
+          "description": "Ignore some files from watching (glob pattern or regexp).",
+          "anyOf": [
+            {
+              "type": "array",
+              "items": {
+                "description": "A glob pattern for files that should be ignored from watching.",
+                "type": "string",
+                "minLength": 1
+              }
+            },
+            {
+              "instanceof": "RegExp",
+              "tsType": "RegExp"
+            },
+            {
+              "description": "A single glob pattern for files that should be ignored from watching.",
+              "type": "string",
+              "minLength": 1
+            }
+          ]
+        },
+        "poll": {
+          "description": "Enable polling mode for watching.",
+          "anyOf": [
+            {
+              "description": "`number`: use polling with specified interval.",
+              "type": "number"
+            },
+            {
+              "description": "`true`: use polling.",
+              "type": "boolean"
+            }
+          ]
+        },
+        "stdin": {
+          "description": "Stop watching when stdin stream has ended.",
+          "type": "boolean"
+        }
+      }
+    },
+    "WebassemblyModuleFilename": {
+      "description": "The filename of WebAssembly modules as relative path inside the 'output.path' directory.",
+      "type": "string",
+      "absolutePath": false
+    },
+    "WebpackOptionsNormalized": {
+      "description": "Normalized webpack options object.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "amd": {
+          "$ref": "#/definitions/Amd"
+        },
+        "bail": {
+          "$ref": "#/definitions/Bail"
+        },
+        "cache": {
+          "$ref": "#/definitions/CacheOptionsNormalized"
+        },
+        "context": {
+          "$ref": "#/definitions/Context"
+        },
+        "dependencies": {
+          "$ref": "#/definitions/Dependencies"
+        },
+        "devServer": {
+          "$ref": "#/definitions/DevServer"
+        },
+        "devtool": {
+          "$ref": "#/definitions/DevTool"
+        },
+        "entry": {
+          "$ref": "#/definitions/EntryNormalized"
+        },
+        "experiments": {
+          "$ref": "#/definitions/ExperimentsNormalized"
+        },
+        "externals": {
+          "$ref": "#/definitions/Externals"
+        },
+        "externalsPresets": {
+          "$ref": "#/definitions/ExternalsPresets"
+        },
+        "externalsType": {
+          "$ref": "#/definitions/ExternalsType"
+        },
+        "ignoreWarnings": {
+          "$ref": "#/definitions/IgnoreWarningsNormalized"
+        },
+        "infrastructureLogging": {
+          "$ref": "#/definitions/InfrastructureLogging"
+        },
+        "loader": {
+          "$ref": "#/definitions/Loader"
+        },
+        "mode": {
+          "$ref": "#/definitions/Mode"
+        },
+        "module": {
+          "$ref": "#/definitions/ModuleOptionsNormalized"
+        },
+        "name": {
+          "$ref": "#/definitions/Name"
+        },
+        "node": {
+          "$ref": "#/definitions/Node"
+        },
+        "optimization": {
+          "$ref": "#/definitions/Optimization"
+        },
+        "output": {
+          "$ref": "#/definitions/OutputNormalized"
+        },
+        "parallelism": {
+          "$ref": "#/definitions/Parallelism"
+        },
+        "performance": {
+          "$ref": "#/definitions/Performance"
+        },
+        "plugins": {
+          "$ref": "#/definitions/Plugins"
+        },
+        "profile": {
+          "$ref": "#/definitions/Profile"
+        },
+        "recordsInputPath": {
+          "$ref": "#/definitions/RecordsInputPath"
+        },
+        "recordsOutputPath": {
+          "$ref": "#/definitions/RecordsOutputPath"
+        },
+        "resolve": {
+          "$ref": "#/definitions/Resolve"
+        },
+        "resolveLoader": {
+          "$ref": "#/definitions/ResolveLoader"
+        },
+        "snapshot": {
+          "$ref": "#/definitions/SnapshotOptions"
+        },
+        "stats": {
+          "$ref": "#/definitions/StatsValue"
+        },
+        "target": {
+          "$ref": "#/definitions/Target"
+        },
+        "watch": {
+          "$ref": "#/definitions/Watch"
+        },
+        "watchOptions": {
+          "$ref": "#/definitions/WatchOptions"
+        }
+      },
+      "required": [
+        "cache",
+        "snapshot",
+        "entry",
+        "experiments",
+        "externals",
+        "externalsPresets",
+        "infrastructureLogging",
+        "module",
+        "node",
+        "optimization",
+        "output",
+        "plugins",
+        "resolve",
+        "resolveLoader",
+        "stats",
+        "watchOptions"
+      ]
+    },
+    "WebpackPluginFunction": {
+      "description": "Function acting as plugin.",
+      "instanceof": "Function",
+      "tsType": "(this: import('../lib/Compiler'), compiler: import('../lib/Compiler')) => void"
+    },
+    "WebpackPluginInstance": {
+      "description": "Plugin instance.",
+      "type": "object",
+      "additionalProperties": true,
+      "properties": {
+        "apply": {
+          "description": "The run point of the plugin, required method.",
+          "instanceof": "Function",
+          "tsType": "(compiler: import('../lib/Compiler')) => void"
+        }
+      },
+      "required": ["apply"]
+    }
+  },
+  "title": "WebpackOptions",
+  "description": "Options object as provided by the user.",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "amd": {
+      "$ref": "#/definitions/Amd"
+    },
+    "bail": {
+      "$ref": "#/definitions/Bail"
+    },
+    "cache": {
+      "$ref": "#/definitions/CacheOptions"
+    },
+    "context": {
+      "$ref": "#/definitions/Context"
+    },
+    "dependencies": {
+      "$ref": "#/definitions/Dependencies"
+    },
+    "devServer": {
+      "$ref": "#/definitions/DevServer"
+    },
+    "devtool": {
+      "$ref": "#/definitions/DevTool"
+    },
+    "entry": {
+      "$ref": "#/definitions/Entry"
+    },
+    "experiments": {
+      "$ref": "#/definitions/Experiments"
+    },
+    "externals": {
+      "$ref": "#/definitions/Externals"
+    },
+    "externalsPresets": {
+      "$ref": "#/definitions/ExternalsPresets"
+    },
+    "externalsType": {
+      "$ref": "#/definitions/ExternalsType"
+    },
+    "ignoreWarnings": {
+      "$ref": "#/definitions/IgnoreWarnings"
+    },
+    "infrastructureLogging": {
+      "$ref": "#/definitions/InfrastructureLogging"
+    },
+    "loader": {
+      "$ref": "#/definitions/Loader"
+    },
+    "mode": {
+      "$ref": "#/definitions/Mode"
+    },
+    "module": {
+      "$ref": "#/definitions/ModuleOptions"
+    },
+    "name": {
+      "$ref": "#/definitions/Name"
+    },
+    "node": {
+      "$ref": "#/definitions/Node"
+    },
+    "optimization": {
+      "$ref": "#/definitions/Optimization"
+    },
+    "output": {
+      "$ref": "#/definitions/Output"
+    },
+    "parallelism": {
+      "$ref": "#/definitions/Parallelism"
+    },
+    "performance": {
+      "$ref": "#/definitions/Performance"
+    },
+    "plugins": {
+      "$ref": "#/definitions/Plugins"
+    },
+    "profile": {
+      "$ref": "#/definitions/Profile"
+    },
+    "recordsInputPath": {
+      "$ref": "#/definitions/RecordsInputPath"
+    },
+    "recordsOutputPath": {
+      "$ref": "#/definitions/RecordsOutputPath"
+    },
+    "recordsPath": {
+      "$ref": "#/definitions/RecordsPath"
+    },
+    "resolve": {
+      "$ref": "#/definitions/Resolve"
+    },
+    "resolveLoader": {
+      "$ref": "#/definitions/ResolveLoader"
+    },
+    "snapshot": {
+      "$ref": "#/definitions/SnapshotOptions"
+    },
+    "stats": {
+      "$ref": "#/definitions/StatsValue"
+    },
+    "target": {
+      "$ref": "#/definitions/Target"
+    },
+    "watch": {
+      "$ref": "#/definitions/Watch"
+    },
+    "watchOptions": {
+      "$ref": "#/definitions/WatchOptions"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/_container.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/_container.json
new file mode 100644
index 0000000..e333f1d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/_container.json
@@ -0,0 +1,155 @@
+{
+  "definitions": {
+    "Exposes": {
+      "description": "Modules that should be exposed by this container. When provided, property name is used as public name, otherwise public name is automatically inferred from request.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be exposed by this container.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/ExposesItem"
+              },
+              {
+                "$ref": "#/definitions/ExposesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/ExposesObject"
+        }
+      ]
+    },
+    "ExposesConfig": {
+      "description": "Advanced configuration for modules that should be exposed by this container.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "import": {
+          "description": "Request to a module that should be exposed by this container.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/ExposesItem"
+            },
+            {
+              "$ref": "#/definitions/ExposesItems"
+            }
+          ]
+        },
+        "name": {
+          "description": "Custom chunk name for the exposed module.",
+          "type": "string"
+        }
+      },
+      "required": ["import"]
+    },
+    "ExposesItem": {
+      "description": "Module that should be exposed by this container.",
+      "type": "string",
+      "minLength": 1
+    },
+    "ExposesItems": {
+      "description": "Modules that should be exposed by this container.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/ExposesItem"
+      }
+    },
+    "ExposesObject": {
+      "description": "Modules that should be exposed by this container. Property names are used as public paths.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be exposed by this container.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/ExposesConfig"
+          },
+          {
+            "$ref": "#/definitions/ExposesItem"
+          },
+          {
+            "$ref": "#/definitions/ExposesItems"
+          }
+        ]
+      }
+    },
+    "Remotes": {
+      "description": "Container locations and request scopes from which modules should be resolved and loaded at runtime. When provided, property name is used as request scope, otherwise request scope is automatically inferred from container location.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Container locations and request scopes from which modules should be resolved and loaded at runtime.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/RemotesItem"
+              },
+              {
+                "$ref": "#/definitions/RemotesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/RemotesObject"
+        }
+      ]
+    },
+    "RemotesConfig": {
+      "description": "Advanced configuration for container locations from which modules should be resolved and loaded at runtime.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "external": {
+          "description": "Container locations from which modules should be resolved and loaded at runtime.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/RemotesItem"
+            },
+            {
+              "$ref": "#/definitions/RemotesItems"
+            }
+          ]
+        },
+        "shareScope": {
+          "description": "The name of the share scope shared with this remote.",
+          "type": "string",
+          "minLength": 1
+        }
+      },
+      "required": ["external"]
+    },
+    "RemotesItem": {
+      "description": "Container location from which modules should be resolved and loaded at runtime.",
+      "type": "string",
+      "minLength": 1
+    },
+    "RemotesItems": {
+      "description": "Container locations from which modules should be resolved and loaded at runtime.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/RemotesItem"
+      }
+    },
+    "RemotesObject": {
+      "description": "Container locations from which modules should be resolved and loaded at runtime. Property names are used as request scopes.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Container locations from which modules should be resolved and loaded at runtime.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/RemotesConfig"
+          },
+          {
+            "$ref": "#/definitions/RemotesItem"
+          },
+          {
+            "$ref": "#/definitions/RemotesItems"
+          }
+        ]
+      }
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/_sharing.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/_sharing.json
new file mode 100644
index 0000000..02c1eed
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/_sharing.json
@@ -0,0 +1,118 @@
+{
+  "definitions": {
+    "Shared": {
+      "description": "Modules that should be shared in the share scope. When provided, property names are used to match requested modules in this compilation.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be shared in the share scope.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/SharedItem"
+              },
+              {
+                "$ref": "#/definitions/SharedObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/SharedObject"
+        }
+      ]
+    },
+    "SharedConfig": {
+      "description": "Advanced configuration for modules that should be shared in the share scope.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "eager": {
+          "description": "Include the provided and fallback module directly instead behind an async request. This allows to use this shared module in initial load too. All possible shared modules need to be eager too.",
+          "type": "boolean"
+        },
+        "import": {
+          "description": "Provided module that should be provided to share scope. Also acts as fallback module if no shared module is found in share scope or version isn't valid. Defaults to the property name.",
+          "anyOf": [
+            {
+              "description": "No provided or fallback module.",
+              "enum": [false]
+            },
+            {
+              "$ref": "#/definitions/SharedItem"
+            }
+          ]
+        },
+        "packageName": {
+          "description": "Package name to determine required version from description file. This is only needed when package name can't be automatically determined from request.",
+          "type": "string",
+          "minLength": 1
+        },
+        "requiredVersion": {
+          "description": "Version requirement from module in share scope.",
+          "anyOf": [
+            {
+              "description": "No version requirement check.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Can be prefixed with '^' or '~' for minimum matches. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        },
+        "shareKey": {
+          "description": "Module is looked up under this key from the share scope.",
+          "type": "string",
+          "minLength": 1
+        },
+        "shareScope": {
+          "description": "Share scope name.",
+          "type": "string",
+          "minLength": 1
+        },
+        "singleton": {
+          "description": "Allow only a single version of the shared module in share scope (disabled by default).",
+          "type": "boolean"
+        },
+        "strictVersion": {
+          "description": "Do not accept shared module if version is not valid (defaults to yes, if local fallback module is available and shared module is not a singleton, otherwise no, has no effect if there is no required version specified).",
+          "type": "boolean"
+        },
+        "version": {
+          "description": "Version of the provided module. Will replace lower matching versions, but not higher.",
+          "anyOf": [
+            {
+              "description": "Don't provide a version.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        }
+      }
+    },
+    "SharedItem": {
+      "description": "A module that should be shared in the share scope.",
+      "type": "string",
+      "minLength": 1
+    },
+    "SharedObject": {
+      "description": "Modules that should be shared in the share scope. Property names are used to match requested modules in this compilation. Relative requests are resolved, module requests are matched unresolved, absolute paths will match resolved requests. A trailing slash will match all requests with this prefix. In this case shareKey must also have a trailing slash.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be shared in the share scope.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/SharedConfig"
+          },
+          {
+            "$ref": "#/definitions/SharedItem"
+          }
+        ]
+      }
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.check.d.ts
new file mode 100644
index 0000000..8e19c85
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/BannerPlugin").BannerPluginArgument) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.check.js
new file mode 100644
index 0000000..a780b14
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function n(t,{instancePath:l="",parentData:s,parentDataProperty:e,rootData:a=t}={}){let r=null,o=0;const u=o;let i=!1;const p=o;if(o===p)if(Array.isArray(t)){const n=t.length;for(let l=0;l<n;l++){let n=t[l];const s=o,e=o;let a=!1,u=null;const i=o,p=o;let f=!1;const h=o;if(!(n instanceof RegExp)){const n={params:{}};null===r?r=[n]:r.push(n),o++}var c=h===o;if(f=f||c,!f){const t=o;if(o===t)if("string"==typeof n){if(n.length<1){const n={params:{}};null===r?r=[n]:r.push(n),o++}}else{const n={params:{type:"string"}};null===r?r=[n]:r.push(n),o++}c=t===o,f=f||c}if(f)o=p,null!==r&&(p?r.length=p:r=null);else{const n={params:{}};null===r?r=[n]:r.push(n),o++}if(i===o&&(a=!0,u=0),a)o=e,null!==r&&(e?r.length=e:r=null);else{const n={params:{passingSchemas:u}};null===r?r=[n]:r.push(n),o++}if(s!==o)break}}else{const n={params:{type:"array"}};null===r?r=[n]:r.push(n),o++}var f=p===o;if(i=i||f,!i){const n=o,l=o;let s=!1;const e=o;if(!(t instanceof RegExp)){const n={params:{}};null===r?r=[n]:r.push(n),o++}var h=e===o;if(s=s||h,!s){const n=o;if(o===n)if("string"==typeof t){if(t.length<1){const n={params:{}};null===r?r=[n]:r.push(n),o++}}else{const n={params:{type:"string"}};null===r?r=[n]:r.push(n),o++}h=n===o,s=s||h}if(s)o=l,null!==r&&(l?r.length=l:r=null);else{const n={params:{}};null===r?r=[n]:r.push(n),o++}f=n===o,i=i||f}if(!i){const t={params:{}};return null===r?r=[t]:r.push(t),o++,n.errors=r,!1}return o=u,null!==r&&(u?r.length=u:r=null),n.errors=r,0===o}function t(l,{instancePath:s="",parentData:e,parentDataProperty:a,rootData:r=l}={}){let o=null,u=0;const i=u;let p=!1;const c=u;if(u===c)if("string"==typeof l){if(l.length<1){const n={params:{}};null===o?o=[n]:o.push(n),u++}}else{const n={params:{type:"string"}};null===o?o=[n]:o.push(n),u++}var f=c===u;if(p=p||f,!p){const t=u;if(u===t)if(l&&"object"==typeof l&&!Array.isArray(l)){let t;if(void 0===l.banner&&(t="banner")){const n={params:{missingProperty:t}};null===o?o=[n]:o.push(n),u++}else{const t=u;for(const n in l)if("banner"!==n&&"entryOnly"!==n&&"exclude"!==n&&"include"!==n&&"raw"!==n&&"test"!==n){const t={params:{additionalProperty:n}};null===o?o=[t]:o.push(t),u++;break}if(t===u){if(void 0!==l.banner){let n=l.banner;const t=u,s=u;let e=!1;const a=u;if("string"!=typeof n){const n={params:{type:"string"}};null===o?o=[n]:o.push(n),u++}var h=a===u;if(e=e||h,!e){const t=u;if(!(n instanceof Function)){const n={params:{}};null===o?o=[n]:o.push(n),u++}h=t===u,e=e||h}if(e)u=s,null!==o&&(s?o.length=s:o=null);else{const n={params:{}};null===o?o=[n]:o.push(n),u++}var m=t===u}else m=!0;if(m){if(void 0!==l.entryOnly){const n=u;if("boolean"!=typeof l.entryOnly){const n={params:{type:"boolean"}};null===o?o=[n]:o.push(n),u++}m=n===u}else m=!0;if(m){if(void 0!==l.exclude){const t=u,e=u;let a=!1,i=null;const p=u;if(n(l.exclude,{instancePath:s+"/exclude",parentData:l,parentDataProperty:"exclude",rootData:r})||(o=null===o?n.errors:o.concat(n.errors),u=o.length),p===u&&(a=!0,i=0),a)u=e,null!==o&&(e?o.length=e:o=null);else{const n={params:{passingSchemas:i}};null===o?o=[n]:o.push(n),u++}m=t===u}else m=!0;if(m){if(void 0!==l.include){const t=u,e=u;let a=!1,i=null;const p=u;if(n(l.include,{instancePath:s+"/include",parentData:l,parentDataProperty:"include",rootData:r})||(o=null===o?n.errors:o.concat(n.errors),u=o.length),p===u&&(a=!0,i=0),a)u=e,null!==o&&(e?o.length=e:o=null);else{const n={params:{passingSchemas:i}};null===o?o=[n]:o.push(n),u++}m=t===u}else m=!0;if(m){if(void 0!==l.raw){const n=u;if("boolean"!=typeof l.raw){const n={params:{type:"boolean"}};null===o?o=[n]:o.push(n),u++}m=n===u}else m=!0;if(m)if(void 0!==l.test){const t=u,e=u;let a=!1,i=null;const p=u;if(n(l.test,{instancePath:s+"/test",parentData:l,parentDataProperty:"test",rootData:r})||(o=null===o?n.errors:o.concat(n.errors),u=o.length),p===u&&(a=!0,i=0),a)u=e,null!==o&&(e?o.length=e:o=null);else{const n={params:{passingSchemas:i}};null===o?o=[n]:o.push(n),u++}m=t===u}else m=!0}}}}}}}else{const n={params:{type:"object"}};null===o?o=[n]:o.push(n),u++}if(f=t===u,p=p||f,!p){const n=u;if(!(l instanceof Function)){const n={params:{}};null===o?o=[n]:o.push(n),u++}f=n===u,p=p||f}}if(!p){const n={params:{}};return null===o?o=[n]:o.push(n),u++,t.errors=o,!1}return u=i,null!==o&&(i?o.length=i:o=null),t.errors=o,0===u}module.exports=t,module.exports.default=t;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.json
new file mode 100644
index 0000000..579e139
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/BannerPlugin.json
@@ -0,0 +1,103 @@
+{
+  "definitions": {
+    "BannerFunction": {
+      "description": "The banner as function, it will be wrapped in a comment.",
+      "instanceof": "Function",
+      "tsType": "(data: { hash: string, chunk: import('../../lib/Chunk'), filename: string }) => string"
+    },
+    "Rule": {
+      "description": "Filtering rule as regex or string.",
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "Rules": {
+      "description": "Filtering rules.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "A rule condition.",
+            "oneOf": [
+              {
+                "$ref": "#/definitions/Rule"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/Rule"
+        }
+      ]
+    }
+  },
+  "title": "BannerPluginArgument",
+  "anyOf": [
+    {
+      "description": "The banner as string, it will be wrapped in a comment.",
+      "type": "string",
+      "minLength": 1
+    },
+    {
+      "title": "BannerPluginOptions",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "banner": {
+          "description": "Specifies the banner.",
+          "anyOf": [
+            {
+              "type": "string"
+            },
+            {
+              "$ref": "#/definitions/BannerFunction"
+            }
+          ]
+        },
+        "entryOnly": {
+          "description": "If true, the banner will only be added to the entry chunks.",
+          "type": "boolean"
+        },
+        "exclude": {
+          "description": "Exclude all modules matching any of these conditions.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/Rules"
+            }
+          ]
+        },
+        "include": {
+          "description": "Include all modules matching any of these conditions.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/Rules"
+            }
+          ]
+        },
+        "raw": {
+          "description": "If true, banner will not be wrapped in a comment.",
+          "type": "boolean"
+        },
+        "test": {
+          "description": "Include all modules that pass test assertion.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/Rules"
+            }
+          ]
+        }
+      },
+      "required": ["banner"]
+    },
+    {
+      "$ref": "#/definitions/BannerFunction"
+    }
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.check.d.ts
new file mode 100644
index 0000000..2e6198d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/DllPlugin").DllPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.check.js
new file mode 100644
index 0000000..c1a4603
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(e,{instancePath:t="",parentData:o,parentDataProperty:n,rootData:a=e}={}){if(!e||"object"!=typeof e||Array.isArray(e))return r.errors=[{params:{type:"object"}}],!1;{let t;if(void 0===e.path&&(t="path"))return r.errors=[{params:{missingProperty:t}}],!1;{const t=0;for(const t in e)if("context"!==t&&"entryOnly"!==t&&"format"!==t&&"name"!==t&&"path"!==t&&"type"!==t)return r.errors=[{params:{additionalProperty:t}}],!1;if(0===t){if(void 0!==e.context){let t=e.context;const o=0;if(0===o){if("string"!=typeof t)return r.errors=[{params:{type:"string"}}],!1;if(t.length<1)return r.errors=[{params:{}}],!1}var s=0===o}else s=!0;if(s){if(void 0!==e.entryOnly){const t=0;if("boolean"!=typeof e.entryOnly)return r.errors=[{params:{type:"boolean"}}],!1;s=0===t}else s=!0;if(s){if(void 0!==e.format){const t=0;if("boolean"!=typeof e.format)return r.errors=[{params:{type:"boolean"}}],!1;s=0===t}else s=!0;if(s){if(void 0!==e.name){let t=e.name;const o=0;if(0===o){if("string"!=typeof t)return r.errors=[{params:{type:"string"}}],!1;if(t.length<1)return r.errors=[{params:{}}],!1}s=0===o}else s=!0;if(s){if(void 0!==e.path){let t=e.path;const o=0;if(0===o){if("string"!=typeof t)return r.errors=[{params:{type:"string"}}],!1;if(t.length<1)return r.errors=[{params:{}}],!1}s=0===o}else s=!0;if(s)if(void 0!==e.type){let t=e.type;const o=0;if(0===o){if("string"!=typeof t)return r.errors=[{params:{type:"string"}}],!1;if(t.length<1)return r.errors=[{params:{}}],!1}s=0===o}else s=!0}}}}}}}return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.json
new file mode 100644
index 0000000..9e5b999
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllPlugin.json
@@ -0,0 +1,36 @@
+{
+  "title": "DllPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "context": {
+      "description": "Context of requests in the manifest file (defaults to the webpack context).",
+      "type": "string",
+      "minLength": 1
+    },
+    "entryOnly": {
+      "description": "If true, only entry points will be exposed (default: true).",
+      "type": "boolean"
+    },
+    "format": {
+      "description": "If true, manifest json file (output) will be formatted.",
+      "type": "boolean"
+    },
+    "name": {
+      "description": "Name of the exposed dll function (external name, use value of 'output.library').",
+      "type": "string",
+      "minLength": 1
+    },
+    "path": {
+      "description": "Absolute path to the manifest json file (output).",
+      "type": "string",
+      "minLength": 1
+    },
+    "type": {
+      "description": "Type of the dll bundle (external type, use value of 'output.libraryTarget').",
+      "type": "string",
+      "minLength": 1
+    }
+  },
+  "required": ["path"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.check.d.ts
new file mode 100644
index 0000000..43d31f1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/DllReferencePlugin").DllReferencePluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.check.js
new file mode 100644
index 0000000..6e8734c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const s=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;function t(s,{instancePath:e="",parentData:n,parentDataProperty:l,rootData:o=s}={}){let r=null,i=0;if(0===i){if(!s||"object"!=typeof s||Array.isArray(s))return t.errors=[{params:{type:"object"}}],!1;{let e;if(void 0===s.content&&(e="content"))return t.errors=[{params:{missingProperty:e}}],!1;{const e=i;for(const e in s)if("content"!==e&&"name"!==e&&"type"!==e)return t.errors=[{params:{additionalProperty:e}}],!1;if(e===i){if(void 0!==s.content){let e=s.content;const n=i,l=i;let o=!1,f=null;const m=i;if(i==i)if(e&&"object"==typeof e&&!Array.isArray(e))if(Object.keys(e).length<1){const s={params:{limit:1}};null===r?r=[s]:r.push(s),i++}else for(const s in e){let t=e[s];const n=i;if(i===n)if(t&&"object"==typeof t&&!Array.isArray(t)){let s;if(void 0===t.id&&(s="id")){const t={params:{missingProperty:s}};null===r?r=[t]:r.push(t),i++}else{const s=i;for(const s in t)if("buildMeta"!==s&&"exports"!==s&&"id"!==s){const t={params:{additionalProperty:s}};null===r?r=[t]:r.push(t),i++;break}if(s===i){if(void 0!==t.buildMeta){let s=t.buildMeta;const e=i;if(!s||"object"!=typeof s||Array.isArray(s)){const s={params:{type:"object"}};null===r?r=[s]:r.push(s),i++}var a=e===i}else a=!0;if(a){if(void 0!==t.exports){let s=t.exports;const e=i,n=i;let l=!1;const o=i;if(i===o)if(Array.isArray(s)){const t=s.length;for(let e=0;e<t;e++){let t=s[e];const n=i;if(i===n)if("string"==typeof t){if(t.length<1){const s={params:{}};null===r?r=[s]:r.push(s),i++}}else{const s={params:{type:"string"}};null===r?r=[s]:r.push(s),i++}if(n!==i)break}}else{const s={params:{type:"array"}};null===r?r=[s]:r.push(s),i++}var p=o===i;if(l=l||p,!l){const t=i;if(!0!==s){const s={params:{}};null===r?r=[s]:r.push(s),i++}p=t===i,l=l||p}if(l)i=n,null!==r&&(n?r.length=n:r=null);else{const s={params:{}};null===r?r=[s]:r.push(s),i++}a=e===i}else a=!0;if(a)if(void 0!==t.id){let s=t.id;const e=i,n=i;let l=!1;const o=i;if("number"!=typeof s){const s={params:{type:"number"}};null===r?r=[s]:r.push(s),i++}var u=o===i;if(l=l||u,!l){const t=i;if(i===t)if("string"==typeof s){if(s.length<1){const s={params:{}};null===r?r=[s]:r.push(s),i++}}else{const s={params:{type:"string"}};null===r?r=[s]:r.push(s),i++}u=t===i,l=l||u}if(l)i=n,null!==r&&(n?r.length=n:r=null);else{const s={params:{}};null===r?r=[s]:r.push(s),i++}a=e===i}else a=!0}}}}else{const s={params:{type:"object"}};null===r?r=[s]:r.push(s),i++}if(n!==i)break}else{const s={params:{type:"object"}};null===r?r=[s]:r.push(s),i++}if(m===i&&(o=!0,f=0),!o){const s={params:{passingSchemas:f}};return null===r?r=[s]:r.push(s),i++,t.errors=r,!1}i=l,null!==r&&(l?r.length=l:r=null);var c=n===i}else c=!0;if(c){if(void 0!==s.name){let e=s.name;const n=i;if(i===n){if("string"!=typeof e)return t.errors=[{params:{type:"string"}}],!1;if(e.length<1)return t.errors=[{params:{}}],!1}c=n===i}else c=!0;if(c)if(void 0!==s.type){let e=s.type;const n=i,l=i;let o=!1,a=null;const p=i;if("var"!==e&&"assign"!==e&&"this"!==e&&"window"!==e&&"global"!==e&&"commonjs"!==e&&"commonjs2"!==e&&"commonjs-module"!==e&&"amd"!==e&&"amd-require"!==e&&"umd"!==e&&"umd2"!==e&&"jsonp"!==e&&"system"!==e){const s={params:{}};null===r?r=[s]:r.push(s),i++}if(p===i&&(o=!0,a=0),!o){const s={params:{passingSchemas:a}};return null===r?r=[s]:r.push(s),i++,t.errors=r,!1}i=l,null!==r&&(l?r.length=l:r=null),c=n===i}else c=!0}}}}}return t.errors=r,0===i}function e(n,{instancePath:l="",parentData:o,parentDataProperty:r,rootData:i=n}={}){let a=null,p=0;const u=p;let c=!1;const f=p;if(p===f)if(n&&"object"==typeof n&&!Array.isArray(n)){let e;if(void 0===n.manifest&&(e="manifest")){const s={params:{missingProperty:e}};null===a?a=[s]:a.push(s),p++}else{const e=p;for(const s in n)if("context"!==s&&"extensions"!==s&&"manifest"!==s&&"name"!==s&&"scope"!==s&&"sourceType"!==s&&"type"!==s){const t={params:{additionalProperty:s}};null===a?a=[t]:a.push(t),p++;break}if(e===p){if(void 0!==n.context){let t=n.context;const e=p;if(p===e)if("string"==typeof t){if(t.includes("!")||!0!==s.test(t)){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}var m=e===p}else m=!0;if(m){if(void 0!==n.extensions){let s=n.extensions;const t=p;if(p===t)if(Array.isArray(s)){const t=s.length;for(let e=0;e<t;e++){const t=p;if("string"!=typeof s[e]){const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}if(t!==p)break}}else{const s={params:{type:"array"}};null===a?a=[s]:a.push(s),p++}m=t===p}else m=!0;if(m){if(void 0!==n.manifest){let e=n.manifest;const o=p,r=p;let u=!1;const c=p;if(p===c)if("string"==typeof e){if(e.includes("!")||!0!==s.test(e)){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}var y=c===p;if(u=u||y,!u){const s=p;t(e,{instancePath:l+"/manifest",parentData:n,parentDataProperty:"manifest",rootData:i})||(a=null===a?t.errors:a.concat(t.errors),p=a.length),y=s===p,u=u||y}if(u)p=r,null!==a&&(r?a.length=r:a=null);else{const s={params:{}};null===a?a=[s]:a.push(s),p++}m=o===p}else m=!0;if(m){if(void 0!==n.name){let s=n.name;const t=p;if(p===t)if("string"==typeof s){if(s.length<1){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}m=t===p}else m=!0;if(m){if(void 0!==n.scope){let s=n.scope;const t=p;if(p===t)if("string"==typeof s){if(s.length<1){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}m=t===p}else m=!0;if(m){if(void 0!==n.sourceType){let s=n.sourceType;const t=p,e=p;let l=!1,o=null;const r=p;if("var"!==s&&"assign"!==s&&"this"!==s&&"window"!==s&&"global"!==s&&"commonjs"!==s&&"commonjs2"!==s&&"commonjs-module"!==s&&"amd"!==s&&"amd-require"!==s&&"umd"!==s&&"umd2"!==s&&"jsonp"!==s&&"system"!==s){const s={params:{}};null===a?a=[s]:a.push(s),p++}if(r===p&&(l=!0,o=0),l)p=e,null!==a&&(e?a.length=e:a=null);else{const s={params:{passingSchemas:o}};null===a?a=[s]:a.push(s),p++}m=t===p}else m=!0;if(m)if(void 0!==n.type){let s=n.type;const t=p;if("require"!==s&&"object"!==s){const s={params:{}};null===a?a=[s]:a.push(s),p++}m=t===p}else m=!0}}}}}}}}else{const s={params:{type:"object"}};null===a?a=[s]:a.push(s),p++}var h=f===p;if(c=c||h,!c){const t=p;if(p===t)if(n&&"object"==typeof n&&!Array.isArray(n)){let t;if(void 0===n.content&&(t="content")||void 0===n.name&&(t="name")){const s={params:{missingProperty:t}};null===a?a=[s]:a.push(s),p++}else{const t=p;for(const s in n)if("content"!==s&&"context"!==s&&"extensions"!==s&&"name"!==s&&"scope"!==s&&"sourceType"!==s&&"type"!==s){const t={params:{additionalProperty:s}};null===a?a=[t]:a.push(t),p++;break}if(t===p){if(void 0!==n.content){let s=n.content;const t=p,e=p;let l=!1,o=null;const r=p;if(p==p)if(s&&"object"==typeof s&&!Array.isArray(s))if(Object.keys(s).length<1){const s={params:{limit:1}};null===a?a=[s]:a.push(s),p++}else for(const t in s){let e=s[t];const n=p;if(p===n)if(e&&"object"==typeof e&&!Array.isArray(e)){let s;if(void 0===e.id&&(s="id")){const t={params:{missingProperty:s}};null===a?a=[t]:a.push(t),p++}else{const s=p;for(const s in e)if("buildMeta"!==s&&"exports"!==s&&"id"!==s){const t={params:{additionalProperty:s}};null===a?a=[t]:a.push(t),p++;break}if(s===p){if(void 0!==e.buildMeta){let s=e.buildMeta;const t=p;if(!s||"object"!=typeof s||Array.isArray(s)){const s={params:{type:"object"}};null===a?a=[s]:a.push(s),p++}var d=t===p}else d=!0;if(d){if(void 0!==e.exports){let s=e.exports;const t=p,n=p;let l=!1;const o=p;if(p===o)if(Array.isArray(s)){const t=s.length;for(let e=0;e<t;e++){let t=s[e];const n=p;if(p===n)if("string"==typeof t){if(t.length<1){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}if(n!==p)break}}else{const s={params:{type:"array"}};null===a?a=[s]:a.push(s),p++}var g=o===p;if(l=l||g,!l){const t=p;if(!0!==s){const s={params:{}};null===a?a=[s]:a.push(s),p++}g=t===p,l=l||g}if(l)p=n,null!==a&&(n?a.length=n:a=null);else{const s={params:{}};null===a?a=[s]:a.push(s),p++}d=t===p}else d=!0;if(d)if(void 0!==e.id){let s=e.id;const t=p,n=p;let l=!1;const o=p;if("number"!=typeof s){const s={params:{type:"number"}};null===a?a=[s]:a.push(s),p++}var b=o===p;if(l=l||b,!l){const t=p;if(p===t)if("string"==typeof s){if(s.length<1){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}b=t===p,l=l||b}if(l)p=n,null!==a&&(n?a.length=n:a=null);else{const s={params:{}};null===a?a=[s]:a.push(s),p++}d=t===p}else d=!0}}}}else{const s={params:{type:"object"}};null===a?a=[s]:a.push(s),p++}if(n!==p)break}else{const s={params:{type:"object"}};null===a?a=[s]:a.push(s),p++}if(r===p&&(l=!0,o=0),l)p=e,null!==a&&(e?a.length=e:a=null);else{const s={params:{passingSchemas:o}};null===a?a=[s]:a.push(s),p++}var v=t===p}else v=!0;if(v){if(void 0!==n.context){let t=n.context;const e=p;if(p===e)if("string"==typeof t){if(t.includes("!")||!0!==s.test(t)){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}v=e===p}else v=!0;if(v){if(void 0!==n.extensions){let s=n.extensions;const t=p;if(p===t)if(Array.isArray(s)){const t=s.length;for(let e=0;e<t;e++){const t=p;if("string"!=typeof s[e]){const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}if(t!==p)break}}else{const s={params:{type:"array"}};null===a?a=[s]:a.push(s),p++}v=t===p}else v=!0;if(v){if(void 0!==n.name){let s=n.name;const t=p;if(p===t)if("string"==typeof s){if(s.length<1){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}v=t===p}else v=!0;if(v){if(void 0!==n.scope){let s=n.scope;const t=p;if(p===t)if("string"==typeof s){if(s.length<1){const s={params:{}};null===a?a=[s]:a.push(s),p++}}else{const s={params:{type:"string"}};null===a?a=[s]:a.push(s),p++}v=t===p}else v=!0;if(v){if(void 0!==n.sourceType){let s=n.sourceType;const t=p,e=p;let l=!1,o=null;const r=p;if("var"!==s&&"assign"!==s&&"this"!==s&&"window"!==s&&"global"!==s&&"commonjs"!==s&&"commonjs2"!==s&&"commonjs-module"!==s&&"amd"!==s&&"amd-require"!==s&&"umd"!==s&&"umd2"!==s&&"jsonp"!==s&&"system"!==s){const s={params:{}};null===a?a=[s]:a.push(s),p++}if(r===p&&(l=!0,o=0),l)p=e,null!==a&&(e?a.length=e:a=null);else{const s={params:{passingSchemas:o}};null===a?a=[s]:a.push(s),p++}v=t===p}else v=!0;if(v)if(void 0!==n.type){let s=n.type;const t=p;if("require"!==s&&"object"!==s){const s={params:{}};null===a?a=[s]:a.push(s),p++}v=t===p}else v=!0}}}}}}}}else{const s={params:{type:"object"}};null===a?a=[s]:a.push(s),p++}h=t===p,c=c||h}if(!c){const s={params:{}};return null===a?a=[s]:a.push(s),p++,e.errors=a,!1}return p=u,null!==a&&(u?a.length=u:a=null),e.errors=a,0===p}module.exports=e,module.exports.default=e;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.json
new file mode 100644
index 0000000..612f3b5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/DllReferencePlugin.json
@@ -0,0 +1,206 @@
+{
+  "definitions": {
+    "DllReferencePluginOptionsContent": {
+      "description": "The mappings from request to module info.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Module info.",
+        "type": "object",
+        "additionalProperties": false,
+        "properties": {
+          "buildMeta": {
+            "description": "Meta information about the module.",
+            "type": "object"
+          },
+          "exports": {
+            "description": "Information about the provided exports of the module.",
+            "anyOf": [
+              {
+                "description": "List of provided exports of the module.",
+                "type": "array",
+                "items": {
+                  "description": "Name of the export.",
+                  "type": "string",
+                  "minLength": 1
+                }
+              },
+              {
+                "description": "Exports unknown/dynamic.",
+                "enum": [true]
+              }
+            ]
+          },
+          "id": {
+            "description": "Module ID.",
+            "anyOf": [
+              {
+                "type": "number"
+              },
+              {
+                "type": "string",
+                "minLength": 1
+              }
+            ]
+          }
+        },
+        "required": ["id"]
+      },
+      "minProperties": 1
+    },
+    "DllReferencePluginOptionsManifest": {
+      "description": "An object containing content, name and type.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "content": {
+          "description": "The mappings from request to module info.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/DllReferencePluginOptionsContent"
+            }
+          ]
+        },
+        "name": {
+          "description": "The name where the dll is exposed (external name).",
+          "type": "string",
+          "minLength": 1
+        },
+        "type": {
+          "description": "The type how the dll is exposed (external type).",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/DllReferencePluginOptionsSourceType"
+            }
+          ]
+        }
+      },
+      "required": ["content"]
+    },
+    "DllReferencePluginOptionsSourceType": {
+      "description": "The type how the dll is exposed (external type).",
+      "enum": [
+        "var",
+        "assign",
+        "this",
+        "window",
+        "global",
+        "commonjs",
+        "commonjs2",
+        "commonjs-module",
+        "amd",
+        "amd-require",
+        "umd",
+        "umd2",
+        "jsonp",
+        "system"
+      ]
+    }
+  },
+  "title": "DllReferencePluginOptions",
+  "anyOf": [
+    {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "context": {
+          "description": "Context of requests in the manifest (or content property) as absolute path.",
+          "type": "string",
+          "absolutePath": true
+        },
+        "extensions": {
+          "description": "Extensions used to resolve modules in the dll bundle (only used when using 'scope').",
+          "type": "array",
+          "items": {
+            "description": "An extension.",
+            "type": "string"
+          }
+        },
+        "manifest": {
+          "description": "An object containing content and name or a string to the absolute path of the JSON manifest to be loaded upon compilation.",
+          "anyOf": [
+            {
+              "type": "string",
+              "absolutePath": true
+            },
+            {
+              "$ref": "#/definitions/DllReferencePluginOptionsManifest"
+            }
+          ]
+        },
+        "name": {
+          "description": "The name where the dll is exposed (external name, defaults to manifest.name).",
+          "type": "string",
+          "minLength": 1
+        },
+        "scope": {
+          "description": "Prefix which is used for accessing the content of the dll.",
+          "type": "string",
+          "minLength": 1
+        },
+        "sourceType": {
+          "description": "How the dll is exposed (libraryTarget, defaults to manifest.type).",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/DllReferencePluginOptionsSourceType"
+            }
+          ]
+        },
+        "type": {
+          "description": "The way how the export of the dll bundle is used.",
+          "enum": ["require", "object"]
+        }
+      },
+      "required": ["manifest"]
+    },
+    {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "content": {
+          "description": "The mappings from request to module info.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/DllReferencePluginOptionsContent"
+            }
+          ]
+        },
+        "context": {
+          "description": "Context of requests in the manifest (or content property) as absolute path.",
+          "type": "string",
+          "absolutePath": true
+        },
+        "extensions": {
+          "description": "Extensions used to resolve modules in the dll bundle (only used when using 'scope').",
+          "type": "array",
+          "items": {
+            "description": "An extension.",
+            "type": "string"
+          }
+        },
+        "name": {
+          "description": "The name where the dll is exposed (external name).",
+          "type": "string",
+          "minLength": 1
+        },
+        "scope": {
+          "description": "Prefix which is used for accessing the content of the dll.",
+          "type": "string",
+          "minLength": 1
+        },
+        "sourceType": {
+          "description": "How the dll is exposed (libraryTarget).",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/DllReferencePluginOptionsSourceType"
+            }
+          ]
+        },
+        "type": {
+          "description": "The way how the export of the dll bundle is used.",
+          "enum": ["require", "object"]
+        }
+      },
+      "required": ["content", "name"]
+    }
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.check.d.ts
new file mode 100644
index 0000000..7522e00
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/HashedModuleIdsPlugin").HashedModuleIdsPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.check.js
new file mode 100644
index 0000000..68af3ad
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const t=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;function e(r,{instancePath:s="",parentData:n,parentDataProperty:a,rootData:i=r}={}){let o=null,l=0;if(0===l){if(!r||"object"!=typeof r||Array.isArray(r))return e.errors=[{params:{type:"object"}}],!1;{const s=l;for(const t in r)if("context"!==t&&"hashDigest"!==t&&"hashDigestLength"!==t&&"hashFunction"!==t)return e.errors=[{params:{additionalProperty:t}}],!1;if(s===l){if(void 0!==r.context){let s=r.context;const n=l;if(l===n){if("string"!=typeof s)return e.errors=[{params:{type:"string"}}],!1;if(s.includes("!")||!0!==t.test(s))return e.errors=[{params:{}}],!1}var u=n===l}else u=!0;if(u){if(void 0!==r.hashDigest){let t=r.hashDigest;const s=l;if("hex"!==t&&"latin1"!==t&&"base64"!==t)return e.errors=[{params:{}}],!1;u=s===l}else u=!0;if(u){if(void 0!==r.hashDigestLength){let t=r.hashDigestLength;const s=l;if(l===s){if("number"!=typeof t)return e.errors=[{params:{type:"number"}}],!1;if(t<1||isNaN(t))return e.errors=[{params:{comparison:">=",limit:1}}],!1}u=s===l}else u=!0;if(u)if(void 0!==r.hashFunction){let t=r.hashFunction;const s=l,n=l;let a=!1,i=null;const p=l,h=l;let c=!1;const m=l;if(l===m)if("string"==typeof t){if(t.length<1){const t={params:{}};null===o?o=[t]:o.push(t),l++}}else{const t={params:{type:"string"}};null===o?o=[t]:o.push(t),l++}var f=m===l;if(c=c||f,!c){const e=l;if(!(t instanceof Function)){const t={params:{}};null===o?o=[t]:o.push(t),l++}f=e===l,c=c||f}if(c)l=h,null!==o&&(h?o.length=h:o=null);else{const t={params:{}};null===o?o=[t]:o.push(t),l++}if(p===l&&(a=!0,i=0),!a){const t={params:{passingSchemas:i}};return null===o?o=[t]:o.push(t),l++,e.errors=o,!1}l=n,null!==o&&(n?o.length=n:o=null),u=s===l}else u=!0}}}}}return e.errors=o,0===l}module.exports=e,module.exports.default=e;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.json
new file mode 100644
index 0000000..1b4efc4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/HashedModuleIdsPlugin.json
@@ -0,0 +1,44 @@
+{
+  "definitions": {
+    "HashFunction": {
+      "description": "Algorithm used for generation the hash (see node.js crypto package).",
+      "anyOf": [
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "instanceof": "Function",
+          "tsType": "typeof import('../../lib/util/Hash')"
+        }
+      ]
+    }
+  },
+  "title": "HashedModuleIdsPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "context": {
+      "description": "The context directory for creating names.",
+      "type": "string",
+      "absolutePath": true
+    },
+    "hashDigest": {
+      "description": "The encoding to use when generating the hash, defaults to 'base64'. All encodings from Node.JS' hash.digest are supported.",
+      "enum": ["hex", "latin1", "base64"]
+    },
+    "hashDigestLength": {
+      "description": "The prefix length of the hash digest to use, defaults to 4.",
+      "type": "number",
+      "minimum": 1
+    },
+    "hashFunction": {
+      "description": "The hashing algorithm to use, defaults to 'md4'. All functions from Node.JS' crypto.createHash are supported.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/HashFunction"
+        }
+      ]
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.check.d.ts
new file mode 100644
index 0000000..a036f6d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/IgnorePlugin").IgnorePluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.check.js
new file mode 100644
index 0000000..cde232b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function e(s,{instancePath:o="",parentData:r,parentDataProperty:t,rootData:n=s}={}){let c=null,a=0;const p=a;let l=!1;const i=a;if(a===i)if(s&&"object"==typeof s&&!Array.isArray(s)){let e;if(void 0===s.resourceRegExp&&(e="resourceRegExp")){const s={params:{missingProperty:e}};null===c?c=[s]:c.push(s),a++}else{const e=a;for(const e in s)if("contextRegExp"!==e&&"resourceRegExp"!==e){const s={params:{additionalProperty:e}};null===c?c=[s]:c.push(s),a++;break}if(e===a){if(void 0!==s.contextRegExp){const e=a;if(!(s.contextRegExp instanceof RegExp)){const e={params:{}};null===c?c=[e]:c.push(e),a++}var u=e===a}else u=!0;if(u)if(void 0!==s.resourceRegExp){const e=a;if(!(s.resourceRegExp instanceof RegExp)){const e={params:{}};null===c?c=[e]:c.push(e),a++}u=e===a}else u=!0}}}else{const e={params:{type:"object"}};null===c?c=[e]:c.push(e),a++}var f=i===a;if(l=l||f,!l){const e=a;if(a===e)if(s&&"object"==typeof s&&!Array.isArray(s)){let e;if(void 0===s.checkResource&&(e="checkResource")){const s={params:{missingProperty:e}};null===c?c=[s]:c.push(s),a++}else{const e=a;for(const e in s)if("checkResource"!==e){const s={params:{additionalProperty:e}};null===c?c=[s]:c.push(s),a++;break}if(e===a&&void 0!==s.checkResource&&!(s.checkResource instanceof Function)){const e={params:{}};null===c?c=[e]:c.push(e),a++}}}else{const e={params:{type:"object"}};null===c?c=[e]:c.push(e),a++}f=e===a,l=l||f}if(!l){const s={params:{}};return null===c?c=[s]:c.push(s),a++,e.errors=c,!1}return a=p,null!==c&&(p?c.length=p:c=null),e.errors=c,0===a}module.exports=e,module.exports.default=e;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.json
new file mode 100644
index 0000000..58c1d2c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/IgnorePlugin.json
@@ -0,0 +1,34 @@
+{
+  "title": "IgnorePluginOptions",
+  "anyOf": [
+    {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "contextRegExp": {
+          "description": "A RegExp to test the context (directory) against.",
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        "resourceRegExp": {
+          "description": "A RegExp to test the request against.",
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        }
+      },
+      "required": ["resourceRegExp"]
+    },
+    {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "checkResource": {
+          "description": "A filter function for resource and context.",
+          "instanceof": "Function",
+          "tsType": "((resource: string, context: string) => boolean)"
+        }
+      },
+      "required": ["checkResource"]
+    }
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.check.d.ts
new file mode 100644
index 0000000..938383f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/JsonModulesPluginParser").JsonModulesPluginParserOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.check.js
new file mode 100644
index 0000000..dab4772
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:a,parentDataProperty:o,rootData:n=t}={}){if(!t||"object"!=typeof t||Array.isArray(t))return r.errors=[{params:{type:"object"}}],!1;{const e=0;for(const e in t)if("parse"!==e)return r.errors=[{params:{additionalProperty:e}}],!1;if(0===e&&void 0!==t.parse&&!(t.parse instanceof Function))return r.errors=[{params:{}}],!1}return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.json
new file mode 100644
index 0000000..8b1bed1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/JsonModulesPluginParser.json
@@ -0,0 +1,12 @@
+{
+  "title": "JsonModulesPluginParserOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "parse": {
+      "description": "Function that executes for a module source string and should return json-compatible data.",
+      "instanceof": "Function",
+      "tsType": "((input: string) => any)"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.check.d.ts
new file mode 100644
index 0000000..9bdda55
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/LoaderOptionsPlugin").LoaderOptionsPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.check.js
new file mode 100644
index 0000000..03e210d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const r=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;function e(t,{instancePath:o="",parentData:a,parentDataProperty:i,rootData:n=t}={}){if(!t||"object"!=typeof t||Array.isArray(t))return e.errors=[{params:{type:"object"}}],!1;if(void 0!==t.debug){const r=0;if("boolean"!=typeof t.debug)return e.errors=[{params:{type:"boolean"}}],!1;var s=0===r}else s=!0;if(s){if(void 0!==t.minimize){const r=0;if("boolean"!=typeof t.minimize)return e.errors=[{params:{type:"boolean"}}],!1;s=0===r}else s=!0;if(s)if(void 0!==t.options){let o=t.options;const a=0;if(0===a){if(!o||"object"!=typeof o||Array.isArray(o))return e.errors=[{params:{type:"object"}}],!1;if(void 0!==o.context){let t=o.context;if("string"!=typeof t)return e.errors=[{params:{type:"string"}}],!1;if(t.includes("!")||!0!==r.test(t))return e.errors=[{params:{}}],!1}}s=0===a}else s=!0}return e.errors=null,!0}module.exports=e,module.exports.default=e;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.json
new file mode 100644
index 0000000..912095c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/LoaderOptionsPlugin.json
@@ -0,0 +1,27 @@
+{
+  "title": "LoaderOptionsPluginOptions",
+  "type": "object",
+  "additionalProperties": true,
+  "properties": {
+    "debug": {
+      "description": "Whether loaders should be in debug mode or not. debug will be removed as of webpack 3.",
+      "type": "boolean"
+    },
+    "minimize": {
+      "description": "Where loaders can be switched to minimize mode.",
+      "type": "boolean"
+    },
+    "options": {
+      "description": "A configuration object that can be used to configure older loaders.",
+      "type": "object",
+      "additionalProperties": true,
+      "properties": {
+        "context": {
+          "description": "The context that can be used to configure older loaders.",
+          "type": "string",
+          "absolutePath": true
+        }
+      }
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.check.d.ts
new file mode 100644
index 0000000..95c0e97
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/ProgressPlugin").ProgressPluginArgument) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.check.js
new file mode 100644
index 0000000..656b831
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";module.exports=t,module.exports.default=t;const e={activeModules:{type:"boolean"},dependencies:{type:"boolean"},dependenciesCount:{type:"number"},entries:{type:"boolean"},handler:{oneOf:[{$ref:"#/definitions/HandlerFunction"}]},modules:{type:"boolean"},modulesCount:{type:"number"},percentBy:{enum:["entries","modules","dependencies",null]},profile:{enum:[!0,!1,null]}},r=Object.prototype.hasOwnProperty;function n(t,{instancePath:o="",parentData:s,parentDataProperty:a,rootData:l=t}={}){let i=null,p=0;if(0===p){if(!t||"object"!=typeof t||Array.isArray(t))return n.errors=[{params:{type:"object"}}],!1;{const o=p;for(const o in t)if(!r.call(e,o))return n.errors=[{params:{additionalProperty:o}}],!1;if(o===p){if(void 0!==t.activeModules){const e=p;if("boolean"!=typeof t.activeModules)return n.errors=[{params:{type:"boolean"}}],!1;var u=e===p}else u=!0;if(u){if(void 0!==t.dependencies){const e=p;if("boolean"!=typeof t.dependencies)return n.errors=[{params:{type:"boolean"}}],!1;u=e===p}else u=!0;if(u){if(void 0!==t.dependenciesCount){const e=p;if("number"!=typeof t.dependenciesCount)return n.errors=[{params:{type:"number"}}],!1;u=e===p}else u=!0;if(u){if(void 0!==t.entries){const e=p;if("boolean"!=typeof t.entries)return n.errors=[{params:{type:"boolean"}}],!1;u=e===p}else u=!0;if(u){if(void 0!==t.handler){const e=p,r=p;let o=!1,s=null;const a=p;if(!(t.handler instanceof Function)){const e={params:{}};null===i?i=[e]:i.push(e),p++}if(a===p&&(o=!0,s=0),!o){const e={params:{passingSchemas:s}};return null===i?i=[e]:i.push(e),p++,n.errors=i,!1}p=r,null!==i&&(r?i.length=r:i=null),u=e===p}else u=!0;if(u){if(void 0!==t.modules){const e=p;if("boolean"!=typeof t.modules)return n.errors=[{params:{type:"boolean"}}],!1;u=e===p}else u=!0;if(u){if(void 0!==t.modulesCount){const e=p;if("number"!=typeof t.modulesCount)return n.errors=[{params:{type:"number"}}],!1;u=e===p}else u=!0;if(u){if(void 0!==t.percentBy){let e=t.percentBy;const r=p;if("entries"!==e&&"modules"!==e&&"dependencies"!==e&&null!==e)return n.errors=[{params:{}}],!1;u=r===p}else u=!0;if(u)if(void 0!==t.profile){let e=t.profile;const r=p;if(!0!==e&&!1!==e&&null!==e)return n.errors=[{params:{}}],!1;u=r===p}else u=!0}}}}}}}}}}return n.errors=i,0===p}function t(e,{instancePath:r="",parentData:o,parentDataProperty:s,rootData:a=e}={}){let l=null,i=0;const p=i;let u=!1;const f=i;n(e,{instancePath:r,parentData:o,parentDataProperty:s,rootData:a})||(l=null===l?n.errors:l.concat(n.errors),i=l.length);var c=f===i;if(u=u||c,!u){const r=i;if(!(e instanceof Function)){const e={params:{}};null===l?l=[e]:l.push(e),i++}c=r===i,u=u||c}if(!u){const e={params:{}};return null===l?l=[e]:l.push(e),i++,t.errors=l,!1}return i=p,null!==l&&(p?l.length=p:l=null),t.errors=l,0===i}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.json
new file mode 100644
index 0000000..2867de4
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ProgressPlugin.json
@@ -0,0 +1,65 @@
+{
+  "definitions": {
+    "HandlerFunction": {
+      "description": "Function that executes for every progress step.",
+      "instanceof": "Function",
+      "tsType": "((percentage: number, msg: string, ...args: string[]) => void)"
+    },
+    "ProgressPluginOptions": {
+      "description": "Options object for the ProgressPlugin.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "activeModules": {
+          "description": "Show active modules count and one active module in progress message.",
+          "type": "boolean"
+        },
+        "dependencies": {
+          "description": "Show dependencies count in progress message.",
+          "type": "boolean"
+        },
+        "dependenciesCount": {
+          "description": "Minimum dependencies count to start with. For better progress calculation. Default: 10000.",
+          "type": "number"
+        },
+        "entries": {
+          "description": "Show entries count in progress message.",
+          "type": "boolean"
+        },
+        "handler": {
+          "description": "Function that executes for every progress step.",
+          "oneOf": [
+            {
+              "$ref": "#/definitions/HandlerFunction"
+            }
+          ]
+        },
+        "modules": {
+          "description": "Show modules count in progress message.",
+          "type": "boolean"
+        },
+        "modulesCount": {
+          "description": "Minimum modules count to start with. For better progress calculation. Default: 5000.",
+          "type": "number"
+        },
+        "percentBy": {
+          "description": "Collect percent algorithm. By default it calculates by a median from modules, entries and dependencies percent.",
+          "enum": ["entries", "modules", "dependencies", null]
+        },
+        "profile": {
+          "description": "Collect profile data for progress steps. Default: false.",
+          "enum": [true, false, null]
+        }
+      }
+    }
+  },
+  "title": "ProgressPluginArgument",
+  "anyOf": [
+    {
+      "$ref": "#/definitions/ProgressPluginOptions"
+    },
+    {
+      "$ref": "#/definitions/HandlerFunction"
+    }
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.check.d.ts
new file mode 100644
index 0000000..fecf29e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/SourceMapDevToolPlugin").SourceMapDevToolPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.check.js
new file mode 100644
index 0000000..4e261e0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const e=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;module.exports=l,module.exports.default=l;const n={append:{anyOf:[{enum:[!1,null]},{type:"string",minLength:1}]},columns:{type:"boolean"},exclude:{oneOf:[{$ref:"#/definitions/rules"}]},fallbackModuleFilenameTemplate:{anyOf:[{type:"string",minLength:1},{instanceof:"Function"}]},fileContext:{type:"string"},filename:{anyOf:[{enum:[!1,null]},{type:"string",absolutePath:!1,minLength:1}]},include:{oneOf:[{$ref:"#/definitions/rules"}]},module:{type:"boolean"},moduleFilenameTemplate:{anyOf:[{type:"string",minLength:1},{instanceof:"Function"}]},namespace:{type:"string"},noSources:{type:"boolean"},publicPath:{type:"string"},sourceRoot:{type:"string"},test:{$ref:"#/definitions/rules"}},t=Object.prototype.hasOwnProperty;function s(e,{instancePath:n="",parentData:t,parentDataProperty:l,rootData:r=e}={}){let o=null,a=0;const i=a;let u=!1;const p=a;if(a===p)if(Array.isArray(e)){const n=e.length;for(let t=0;t<n;t++){let n=e[t];const s=a,l=a;let r=!1,i=null;const u=a,p=a;let c=!1;const m=a;if(!(n instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var f=m===a;if(c=c||f,!c){const e=a;if(a===e)if("string"==typeof n){if(n.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}f=e===a,c=c||f}if(c)a=p,null!==o&&(p?o.length=p:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}if(u===a&&(r=!0,i=0),r)a=l,null!==o&&(l?o.length=l:o=null);else{const e={params:{passingSchemas:i}};null===o?o=[e]:o.push(e),a++}if(s!==a)break}}else{const e={params:{type:"array"}};null===o?o=[e]:o.push(e),a++}var c=p===a;if(u=u||c,!u){const n=a,t=a;let s=!1;const l=a;if(!(e instanceof RegExp)){const e={params:{}};null===o?o=[e]:o.push(e),a++}var m=l===a;if(s=s||m,!s){const n=a;if(a===n)if("string"==typeof e){if(e.length<1){const e={params:{}};null===o?o=[e]:o.push(e),a++}}else{const e={params:{type:"string"}};null===o?o=[e]:o.push(e),a++}m=n===a,s=s||m}if(s)a=t,null!==o&&(t?o.length=t:o=null);else{const e={params:{}};null===o?o=[e]:o.push(e),a++}c=n===a,u=u||c}if(!u){const e={params:{}};return null===o?o=[e]:o.push(e),a++,s.errors=o,!1}return a=i,null!==o&&(i?o.length=i:o=null),s.errors=o,0===a}function l(r,{instancePath:o="",parentData:a,parentDataProperty:i,rootData:u=r}={}){let p=null,f=0;if(0===f){if(!r||"object"!=typeof r||Array.isArray(r))return l.errors=[{params:{type:"object"}}],!1;{const a=f;for(const e in r)if(!t.call(n,e))return l.errors=[{params:{additionalProperty:e}}],!1;if(a===f){if(void 0!==r.append){let e=r.append;const n=f,t=f;let s=!1;const o=f;if(!1!==e&&null!==e){const e={params:{}};null===p?p=[e]:p.push(e),f++}var c=o===f;if(s=s||c,!s){const n=f;if(f===n)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),f++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),f++}c=n===f,s=s||c}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),f++,l.errors=p,!1}f=t,null!==p&&(t?p.length=t:p=null);var m=n===f}else m=!0;if(m){if(void 0!==r.columns){const e=f;if("boolean"!=typeof r.columns)return l.errors=[{params:{type:"boolean"}}],!1;m=e===f}else m=!0;if(m){if(void 0!==r.exclude){const e=f,n=f;let t=!1,a=null;const i=f;if(s(r.exclude,{instancePath:o+"/exclude",parentData:r,parentDataProperty:"exclude",rootData:u})||(p=null===p?s.errors:p.concat(s.errors),f=p.length),i===f&&(t=!0,a=0),!t){const e={params:{passingSchemas:a}};return null===p?p=[e]:p.push(e),f++,l.errors=p,!1}f=n,null!==p&&(n?p.length=n:p=null),m=e===f}else m=!0;if(m){if(void 0!==r.fallbackModuleFilenameTemplate){let e=r.fallbackModuleFilenameTemplate;const n=f,t=f;let s=!1;const o=f;if(f===o)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),f++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),f++}var h=o===f;if(s=s||h,!s){const n=f;if(!(e instanceof Function)){const e={params:{}};null===p?p=[e]:p.push(e),f++}h=n===f,s=s||h}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),f++,l.errors=p,!1}f=t,null!==p&&(t?p.length=t:p=null),m=n===f}else m=!0;if(m){if(void 0!==r.fileContext){const e=f;if("string"!=typeof r.fileContext)return l.errors=[{params:{type:"string"}}],!1;m=e===f}else m=!0;if(m){if(void 0!==r.filename){let n=r.filename;const t=f,s=f;let o=!1;const a=f;if(!1!==n&&null!==n){const e={params:{}};null===p?p=[e]:p.push(e),f++}var g=a===f;if(o=o||g,!o){const t=f;if(f===t)if("string"==typeof n){if(n.includes("!")||!1!==e.test(n)){const e={params:{}};null===p?p=[e]:p.push(e),f++}else if(n.length<1){const e={params:{}};null===p?p=[e]:p.push(e),f++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),f++}g=t===f,o=o||g}if(!o){const e={params:{}};return null===p?p=[e]:p.push(e),f++,l.errors=p,!1}f=s,null!==p&&(s?p.length=s:p=null),m=t===f}else m=!0;if(m){if(void 0!==r.include){const e=f,n=f;let t=!1,a=null;const i=f;if(s(r.include,{instancePath:o+"/include",parentData:r,parentDataProperty:"include",rootData:u})||(p=null===p?s.errors:p.concat(s.errors),f=p.length),i===f&&(t=!0,a=0),!t){const e={params:{passingSchemas:a}};return null===p?p=[e]:p.push(e),f++,l.errors=p,!1}f=n,null!==p&&(n?p.length=n:p=null),m=e===f}else m=!0;if(m){if(void 0!==r.module){const e=f;if("boolean"!=typeof r.module)return l.errors=[{params:{type:"boolean"}}],!1;m=e===f}else m=!0;if(m){if(void 0!==r.moduleFilenameTemplate){let e=r.moduleFilenameTemplate;const n=f,t=f;let s=!1;const o=f;if(f===o)if("string"==typeof e){if(e.length<1){const e={params:{}};null===p?p=[e]:p.push(e),f++}}else{const e={params:{type:"string"}};null===p?p=[e]:p.push(e),f++}var y=o===f;if(s=s||y,!s){const n=f;if(!(e instanceof Function)){const e={params:{}};null===p?p=[e]:p.push(e),f++}y=n===f,s=s||y}if(!s){const e={params:{}};return null===p?p=[e]:p.push(e),f++,l.errors=p,!1}f=t,null!==p&&(t?p.length=t:p=null),m=n===f}else m=!0;if(m){if(void 0!==r.namespace){const e=f;if("string"!=typeof r.namespace)return l.errors=[{params:{type:"string"}}],!1;m=e===f}else m=!0;if(m){if(void 0!==r.noSources){const e=f;if("boolean"!=typeof r.noSources)return l.errors=[{params:{type:"boolean"}}],!1;m=e===f}else m=!0;if(m){if(void 0!==r.publicPath){const e=f;if("string"!=typeof r.publicPath)return l.errors=[{params:{type:"string"}}],!1;m=e===f}else m=!0;if(m){if(void 0!==r.sourceRoot){const e=f;if("string"!=typeof r.sourceRoot)return l.errors=[{params:{type:"string"}}],!1;m=e===f}else m=!0;if(m)if(void 0!==r.test){const e=f;s(r.test,{instancePath:o+"/test",parentData:r,parentDataProperty:"test",rootData:u})||(p=null===p?s.errors:p.concat(s.errors),f=p.length),m=e===f}else m=!0}}}}}}}}}}}}}}}return l.errors=p,0===f}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.json
new file mode 100644
index 0000000..a4362aa
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/SourceMapDevToolPlugin.json
@@ -0,0 +1,143 @@
+{
+  "definitions": {
+    "rule": {
+      "description": "Include source maps for modules based on their extension (defaults to .js and .css).",
+      "anyOf": [
+        {
+          "instanceof": "RegExp",
+          "tsType": "RegExp"
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "rules": {
+      "description": "Include source maps for modules based on their extension (defaults to .js and .css).",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "A rule condition.",
+            "oneOf": [
+              {
+                "$ref": "#/definitions/rule"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/rule"
+        }
+      ]
+    }
+  },
+  "title": "SourceMapDevToolPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "append": {
+      "description": "Appends the given value to the original asset. Usually the #sourceMappingURL comment. [url] is replaced with a URL to the source map file. false disables the appending.",
+      "anyOf": [
+        {
+          "description": "Append no SourceMap comment to the bundle, but still generate SourceMaps.",
+          "enum": [false, null]
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "columns": {
+      "description": "Indicates whether column mappings should be used (defaults to true).",
+      "type": "boolean"
+    },
+    "exclude": {
+      "description": "Exclude modules that match the given value from source map generation.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/rules"
+        }
+      ]
+    },
+    "fallbackModuleFilenameTemplate": {
+      "description": "Generator string or function to create identifiers of modules for the 'sources' array in the SourceMap used only if 'moduleFilenameTemplate' would result in a conflict.",
+      "anyOf": [
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "description": "Custom function generating the identifier.",
+          "instanceof": "Function",
+          "tsType": "Function"
+        }
+      ]
+    },
+    "fileContext": {
+      "description": "Path prefix to which the [file] placeholder is relative to.",
+      "type": "string"
+    },
+    "filename": {
+      "description": "Defines the output filename of the SourceMap (will be inlined if no value is provided).",
+      "anyOf": [
+        {
+          "description": "Disable separate SourceMap file and inline SourceMap as DataUrl.",
+          "enum": [false, null]
+        },
+        {
+          "type": "string",
+          "absolutePath": false,
+          "minLength": 1
+        }
+      ]
+    },
+    "include": {
+      "description": "Include source maps for module paths that match the given value.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/rules"
+        }
+      ]
+    },
+    "module": {
+      "description": "Indicates whether SourceMaps from loaders should be used (defaults to true).",
+      "type": "boolean"
+    },
+    "moduleFilenameTemplate": {
+      "description": "Generator string or function to create identifiers of modules for the 'sources' array in the SourceMap.",
+      "anyOf": [
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "description": "Custom function generating the identifier.",
+          "instanceof": "Function",
+          "tsType": "Function"
+        }
+      ]
+    },
+    "namespace": {
+      "description": "Namespace prefix to allow multiple webpack roots in the devtools.",
+      "type": "string"
+    },
+    "noSources": {
+      "description": "Omit the 'sourceContents' array from the SourceMap.",
+      "type": "boolean"
+    },
+    "publicPath": {
+      "description": "Provide a custom public path for the SourceMapping comment.",
+      "type": "string"
+    },
+    "sourceRoot": {
+      "description": "Provide a custom value for the 'sourceRoot' property in the SourceMap.",
+      "type": "string"
+    },
+    "test": {
+      "$ref": "#/definitions/rules"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.check.d.ts
new file mode 100644
index 0000000..da36baf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../declarations/plugins/WatchIgnorePlugin").WatchIgnorePluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.check.js
new file mode 100644
index 0000000..0dd766d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:s,parentDataProperty:a,rootData:n=t}={}){let o=null,i=0;if(0===i){if(!t||"object"!=typeof t||Array.isArray(t))return r.errors=[{params:{type:"object"}}],!1;{let e;if(void 0===t.paths&&(e="paths"))return r.errors=[{params:{missingProperty:e}}],!1;{const e=i;for(const e in t)if("paths"!==e)return r.errors=[{params:{additionalProperty:e}}],!1;if(e===i&&void 0!==t.paths){let e=t.paths;if(i==i){if(!Array.isArray(e))return r.errors=[{params:{type:"array"}}],!1;if(e.length<1)return r.errors=[{params:{limit:1}}],!1;{const t=e.length;for(let s=0;s<t;s++){let t=e[s];const a=i,n=i;let l=!1;const u=i;if(!(t instanceof RegExp)){const r={params:{}};null===o?o=[r]:o.push(r),i++}var p=u===i;if(l=l||p,!l){const r=i;if("string"!=typeof t){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),i++}p=r===i,l=l||p}if(!l){const t={params:{}};return null===o?o=[t]:o.push(t),i++,r.errors=o,!1}if(i=n,null!==o&&(n?o.length=n:o=null),a!==i)break}}}}}}}return r.errors=o,0===i}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.json
new file mode 100644
index 0000000..1e6422e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/WatchIgnorePlugin.json
@@ -0,0 +1,25 @@
+{
+  "title": "WatchIgnorePluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "paths": {
+      "description": "A list of RegExps or absolute paths to directories or files that should be ignored.",
+      "type": "array",
+      "items": {
+        "description": "RegExp or absolute path to directories or files that should be ignored.",
+        "anyOf": [
+          {
+            "instanceof": "RegExp",
+            "tsType": "RegExp"
+          },
+          {
+            "type": "string"
+          }
+        ]
+      },
+      "minItems": 1
+    }
+  },
+  "required": ["paths"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.check.d.ts
new file mode 100644
index 0000000..6b6174c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: any) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.check.js
new file mode 100644
index 0000000..09dce47
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const t=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;function n(t,{instancePath:r="",parentData:e,parentDataProperty:a,rootData:s=t}={}){let o=null,l=0;const i=l;let p=!1;const u=l;if(l==l)if(t&&"object"==typeof t&&!Array.isArray(t)){const n=l;for(const n in t)if("encoding"!==n&&"mimetype"!==n){const t={params:{additionalProperty:n}};null===o?o=[t]:o.push(t),l++;break}if(n===l){if(void 0!==t.encoding){let n=t.encoding;const r=l;if(!1!==n&&"base64"!==n){const t={params:{}};null===o?o=[t]:o.push(t),l++}var c=r===l}else c=!0;if(c)if(void 0!==t.mimetype){const n=l;if("string"!=typeof t.mimetype){const t={params:{type:"string"}};null===o?o=[t]:o.push(t),l++}c=n===l}else c=!0}}else{const t={params:{type:"object"}};null===o?o=[t]:o.push(t),l++}var f=u===l;if(p=p||f,!p){const n=l;if(!(t instanceof Function)){const t={params:{}};null===o?o=[t]:o.push(t),l++}f=n===l,p=p||f}if(!p){const t={params:{}};return null===o?o=[t]:o.push(t),l++,n.errors=o,!1}return l=i,null!==o&&(i?o.length=i:o=null),n.errors=o,0===l}function r(e,{instancePath:a="",parentData:s,parentDataProperty:o,rootData:l=e}={}){let i=null,p=0;if(0===p){if(!e||"object"!=typeof e||Array.isArray(e))return r.errors=[{params:{type:"object"}}],!1;{const s=p;for(const t in e)if("dataUrl"!==t&&"emit"!==t&&"filename"!==t&&"outputPath"!==t&&"publicPath"!==t)return r.errors=[{params:{additionalProperty:t}}],!1;if(s===p){if(void 0!==e.dataUrl){const t=p;n(e.dataUrl,{instancePath:a+"/dataUrl",parentData:e,parentDataProperty:"dataUrl",rootData:l})||(i=null===i?n.errors:i.concat(n.errors),p=i.length);var u=t===p}else u=!0;if(u){if(void 0!==e.emit){const t=p;if("boolean"!=typeof e.emit)return r.errors=[{params:{type:"boolean"}}],!1;u=t===p}else u=!0;if(u){if(void 0!==e.filename){let n=e.filename;const a=p,s=p;let o=!1;const l=p;if(p===l)if("string"==typeof n){if(n.includes("!")||!1!==t.test(n)){const t={params:{}};null===i?i=[t]:i.push(t),p++}else if(n.length<1){const t={params:{}};null===i?i=[t]:i.push(t),p++}}else{const t={params:{type:"string"}};null===i?i=[t]:i.push(t),p++}var c=l===p;if(o=o||c,!o){const t=p;if(!(n instanceof Function)){const t={params:{}};null===i?i=[t]:i.push(t),p++}c=t===p,o=o||c}if(!o){const t={params:{}};return null===i?i=[t]:i.push(t),p++,r.errors=i,!1}p=s,null!==i&&(s?i.length=s:i=null),u=a===p}else u=!0;if(u){if(void 0!==e.outputPath){let n=e.outputPath;const a=p,s=p;let o=!1;const l=p;if(p===l)if("string"==typeof n){if(n.includes("!")||!1!==t.test(n)){const t={params:{}};null===i?i=[t]:i.push(t),p++}}else{const t={params:{type:"string"}};null===i?i=[t]:i.push(t),p++}var f=l===p;if(o=o||f,!o){const t=p;if(!(n instanceof Function)){const t={params:{}};null===i?i=[t]:i.push(t),p++}f=t===p,o=o||f}if(!o){const t={params:{}};return null===i?i=[t]:i.push(t),p++,r.errors=i,!1}p=s,null!==i&&(s?i.length=s:i=null),u=a===p}else u=!0;if(u)if(void 0!==e.publicPath){let t=e.publicPath;const n=p,a=p;let s=!1;const o=p;if("string"!=typeof t){const t={params:{type:"string"}};null===i?i=[t]:i.push(t),p++}var h=o===p;if(s=s||h,!s){const n=p;if(!(t instanceof Function)){const t={params:{}};null===i?i=[t]:i.push(t),p++}h=n===p,s=s||h}if(!s){const t={params:{}};return null===i?i=[t]:i.push(t),p++,r.errors=i,!1}p=a,null!==i&&(a?i.length=a:i=null),u=n===p}else u=!0}}}}}}return r.errors=i,0===p}function e(t,{instancePath:n="",parentData:a,parentDataProperty:s,rootData:o=t}={}){let l=null,i=0;return r(t,{instancePath:n,parentData:a,parentDataProperty:s,rootData:o})||(l=null===l?r.errors:l.concat(r.errors),i=l.length),e.errors=l,0===i}module.exports=e,module.exports.default=e;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.json
new file mode 100644
index 0000000..c00fc87
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetGeneratorOptions.json
@@ -0,0 +1,3 @@
+{
+  "$ref": "../../WebpackOptions.json#/definitions/AssetGeneratorOptions"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.check.d.ts
new file mode 100644
index 0000000..6b6174c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: any) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.check.js
new file mode 100644
index 0000000..0d01a16
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function t(r,{instancePath:a="",parentData:n,parentDataProperty:e,rootData:o=r}={}){let s=null,l=0;const i=l;let p=!1;const c=l;if(l==l)if(r&&"object"==typeof r&&!Array.isArray(r)){const t=l;for(const t in r)if("encoding"!==t&&"mimetype"!==t){const r={params:{additionalProperty:t}};null===s?s=[r]:s.push(r),l++;break}if(t===l){if(void 0!==r.encoding){let t=r.encoding;const a=l;if(!1!==t&&"base64"!==t){const t={params:{}};null===s?s=[t]:s.push(t),l++}var u=a===l}else u=!0;if(u)if(void 0!==r.mimetype){const t=l;if("string"!=typeof r.mimetype){const t={params:{type:"string"}};null===s?s=[t]:s.push(t),l++}u=t===l}else u=!0}}else{const t={params:{type:"object"}};null===s?s=[t]:s.push(t),l++}var f=c===l;if(p=p||f,!p){const t=l;if(!(r instanceof Function)){const t={params:{}};null===s?s=[t]:s.push(t),l++}f=t===l,p=p||f}if(!p){const r={params:{}};return null===s?s=[r]:s.push(r),l++,t.errors=s,!1}return l=i,null!==s&&(i?s.length=i:s=null),t.errors=s,0===l}function r(a,{instancePath:n="",parentData:e,parentDataProperty:o,rootData:s=a}={}){let l=null,i=0;if(0===i){if(!a||"object"!=typeof a||Array.isArray(a))return r.errors=[{params:{type:"object"}}],!1;{const e=i;for(const t in a)if("dataUrl"!==t)return r.errors=[{params:{additionalProperty:t}}],!1;e===i&&void 0!==a.dataUrl&&(t(a.dataUrl,{instancePath:n+"/dataUrl",parentData:a,parentDataProperty:"dataUrl",rootData:s})||(l=null===l?t.errors:l.concat(t.errors),i=l.length))}}return r.errors=l,0===i}function a(t,{instancePath:n="",parentData:e,parentDataProperty:o,rootData:s=t}={}){let l=null,i=0;return r(t,{instancePath:n,parentData:e,parentDataProperty:o,rootData:s})||(l=null===l?r.errors:l.concat(r.errors),i=l.length),a.errors=l,0===i}module.exports=a,module.exports.default=a;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.json
new file mode 100644
index 0000000..a6fff2a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetInlineGeneratorOptions.json
@@ -0,0 +1,3 @@
+{
+  "$ref": "../../WebpackOptions.json#/definitions/AssetInlineGeneratorOptions"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.check.d.ts
new file mode 100644
index 0000000..6b6174c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: any) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.check.js
new file mode 100644
index 0000000..050bca3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function t(r,{instancePath:a="",parentData:n,parentDataProperty:o,rootData:e=r}={}){let s=null,i=0;if(0===i){if(!r||"object"!=typeof r||Array.isArray(r))return t.errors=[{params:{type:"object"}}],!1;{const a=i;for(const a in r)if("dataUrlCondition"!==a)return t.errors=[{params:{additionalProperty:a}}],!1;if(a===i&&void 0!==r.dataUrlCondition){let a=r.dataUrlCondition;const n=i;let o=!1;const e=i;if(i==i)if(a&&"object"==typeof a&&!Array.isArray(a)){const t=i;for(const t in a)if("maxSize"!==t){const r={params:{additionalProperty:t}};null===s?s=[r]:s.push(r),i++;break}if(t===i&&void 0!==a.maxSize&&"number"!=typeof a.maxSize){const t={params:{type:"number"}};null===s?s=[t]:s.push(t),i++}}else{const t={params:{type:"object"}};null===s?s=[t]:s.push(t),i++}var l=e===i;if(o=o||l,!o){const t=i;if(!(a instanceof Function)){const t={params:{}};null===s?s=[t]:s.push(t),i++}l=t===i,o=o||l}if(!o){const r={params:{}};return null===s?s=[r]:s.push(r),i++,t.errors=s,!1}i=n,null!==s&&(n?s.length=n:s=null)}}}return t.errors=s,0===i}function r(a,{instancePath:n="",parentData:o,parentDataProperty:e,rootData:s=a}={}){let i=null,l=0;return t(a,{instancePath:n,parentData:o,parentDataProperty:e,rootData:s})||(i=null===i?t.errors:i.concat(t.errors),l=i.length),r.errors=i,0===l}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.json
new file mode 100644
index 0000000..66bf562
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetParserOptions.json
@@ -0,0 +1,3 @@
+{
+  "$ref": "../../WebpackOptions.json#/definitions/AssetParserOptions"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.check.d.ts
new file mode 100644
index 0000000..6b6174c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: any) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.check.js
new file mode 100644
index 0000000..23b476c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const t=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;function n(r,{instancePath:e="",parentData:s,parentDataProperty:a,rootData:o=r}={}){let l=null,i=0;if(0===i){if(!r||"object"!=typeof r||Array.isArray(r))return n.errors=[{params:{type:"object"}}],!1;{const e=i;for(const t in r)if("emit"!==t&&"filename"!==t&&"outputPath"!==t&&"publicPath"!==t)return n.errors=[{params:{additionalProperty:t}}],!1;if(e===i){if(void 0!==r.emit){const t=i;if("boolean"!=typeof r.emit)return n.errors=[{params:{type:"boolean"}}],!1;var u=t===i}else u=!0;if(u){if(void 0!==r.filename){let e=r.filename;const s=i,a=i;let o=!1;const c=i;if(i===c)if("string"==typeof e){if(e.includes("!")||!1!==t.test(e)){const t={params:{}};null===l?l=[t]:l.push(t),i++}else if(e.length<1){const t={params:{}};null===l?l=[t]:l.push(t),i++}}else{const t={params:{type:"string"}};null===l?l=[t]:l.push(t),i++}var p=c===i;if(o=o||p,!o){const t=i;if(!(e instanceof Function)){const t={params:{}};null===l?l=[t]:l.push(t),i++}p=t===i,o=o||p}if(!o){const t={params:{}};return null===l?l=[t]:l.push(t),i++,n.errors=l,!1}i=a,null!==l&&(a?l.length=a:l=null),u=s===i}else u=!0;if(u){if(void 0!==r.outputPath){let e=r.outputPath;const s=i,a=i;let o=!1;const p=i;if(i===p)if("string"==typeof e){if(e.includes("!")||!1!==t.test(e)){const t={params:{}};null===l?l=[t]:l.push(t),i++}}else{const t={params:{type:"string"}};null===l?l=[t]:l.push(t),i++}var c=p===i;if(o=o||c,!o){const t=i;if(!(e instanceof Function)){const t={params:{}};null===l?l=[t]:l.push(t),i++}c=t===i,o=o||c}if(!o){const t={params:{}};return null===l?l=[t]:l.push(t),i++,n.errors=l,!1}i=a,null!==l&&(a?l.length=a:l=null),u=s===i}else u=!0;if(u)if(void 0!==r.publicPath){let t=r.publicPath;const e=i,s=i;let a=!1;const o=i;if("string"!=typeof t){const t={params:{type:"string"}};null===l?l=[t]:l.push(t),i++}var f=o===i;if(a=a||f,!a){const n=i;if(!(t instanceof Function)){const t={params:{}};null===l?l=[t]:l.push(t),i++}f=n===i,a=a||f}if(!a){const t={params:{}};return null===l?l=[t]:l.push(t),i++,n.errors=l,!1}i=s,null!==l&&(s?l.length=s:l=null),u=e===i}else u=!0}}}}}return n.errors=l,0===i}function r(t,{instancePath:e="",parentData:s,parentDataProperty:a,rootData:o=t}={}){let l=null,i=0;return n(t,{instancePath:e,parentData:s,parentDataProperty:a,rootData:o})||(l=null===l?n.errors:l.concat(n.errors),i=l.length),r.errors=l,0===i}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.json
new file mode 100644
index 0000000..8ae51d5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/asset/AssetResourceGeneratorOptions.json
@@ -0,0 +1,3 @@
+{
+  "$ref": "../../WebpackOptions.json#/definitions/AssetResourceGeneratorOptions"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.check.d.ts
new file mode 100644
index 0000000..acf6841
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/container/ContainerPlugin").ContainerPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.check.js
new file mode 100644
index 0000000..68f4c94
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const r=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;function t(r,{instancePath:e="",parentData:n,parentDataProperty:s,rootData:a=r}={}){if(!Array.isArray(r))return t.errors=[{params:{type:"array"}}],!1;{const e=r.length;for(let n=0;n<e;n++){let e=r[n];const s=0;if("string"!=typeof e)return t.errors=[{params:{type:"string"}}],!1;if(e.length<1)return t.errors=[{params:{}}],!1;if(0!==s)break}}return t.errors=null,!0}function e(r,{instancePath:n="",parentData:s,parentDataProperty:a,rootData:o=r}={}){let l=null,i=0;if(0===i){if(!r||"object"!=typeof r||Array.isArray(r))return e.errors=[{params:{type:"object"}}],!1;{let s;if(void 0===r.import&&(s="import"))return e.errors=[{params:{missingProperty:s}}],!1;{const s=i;for(const t in r)if("import"!==t&&"name"!==t)return e.errors=[{params:{additionalProperty:t}}],!1;if(s===i){if(void 0!==r.import){let s=r.import;const a=i,u=i;let c=!1;const m=i;if(i==i)if("string"==typeof s){if(s.length<1){const r={params:{}};null===l?l=[r]:l.push(r),i++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),i++}var p=m===i;if(c=c||p,!c){const e=i;t(s,{instancePath:n+"/import",parentData:r,parentDataProperty:"import",rootData:o})||(l=null===l?t.errors:l.concat(t.errors),i=l.length),p=e===i,c=c||p}if(!c){const r={params:{}};return null===l?l=[r]:l.push(r),i++,e.errors=l,!1}i=u,null!==l&&(u?l.length=u:l=null);var f=a===i}else f=!0;if(f)if(void 0!==r.name){const t=i;if("string"!=typeof r.name)return e.errors=[{params:{type:"string"}}],!1;f=t===i}else f=!0}}}}return e.errors=l,0===i}function n(r,{instancePath:s="",parentData:a,parentDataProperty:o,rootData:l=r}={}){let i=null,p=0;if(0===p){if(!r||"object"!=typeof r||Array.isArray(r))return n.errors=[{params:{type:"object"}}],!1;for(const a in r){let o=r[a];const u=p,c=p;let m=!1;const y=p;e(o,{instancePath:s+"/"+a.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:a,rootData:l})||(i=null===i?e.errors:i.concat(e.errors),p=i.length);var f=y===p;if(m=m||f,!m){const e=p;if(p==p)if("string"==typeof o){if(o.length<1){const r={params:{}};null===i?i=[r]:i.push(r),p++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),p++}if(f=e===p,m=m||f,!m){const e=p;t(o,{instancePath:s+"/"+a.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:a,rootData:l})||(i=null===i?t.errors:i.concat(t.errors),p=i.length),f=e===p,m=m||f}}if(!m){const r={params:{}};return null===i?i=[r]:i.push(r),p++,n.errors=i,!1}if(p=c,null!==i&&(c?i.length=c:i=null),u!==p)break}}return n.errors=i,0===p}function s(r,{instancePath:t="",parentData:e,parentDataProperty:a,rootData:o=r}={}){let l=null,i=0;const p=i;let f=!1;const u=i;if(i===u)if(Array.isArray(r)){const e=r.length;for(let s=0;s<e;s++){let e=r[s];const a=i,p=i;let f=!1;const u=i;if(i==i)if("string"==typeof e){if(e.length<1){const r={params:{}};null===l?l=[r]:l.push(r),i++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),i++}var c=u===i;if(f=f||c,!f){const a=i;n(e,{instancePath:t+"/"+s,parentData:r,parentDataProperty:s,rootData:o})||(l=null===l?n.errors:l.concat(n.errors),i=l.length),c=a===i,f=f||c}if(f)i=p,null!==l&&(p?l.length=p:l=null);else{const r={params:{}};null===l?l=[r]:l.push(r),i++}if(a!==i)break}}else{const r={params:{type:"array"}};null===l?l=[r]:l.push(r),i++}var m=u===i;if(f=f||m,!f){const s=i;n(r,{instancePath:t,parentData:e,parentDataProperty:a,rootData:o})||(l=null===l?n.errors:l.concat(n.errors),i=l.length),m=s===i,f=f||m}if(!f){const r={params:{}};return null===l?l=[r]:l.push(r),i++,s.errors=l,!1}return i=p,null!==l&&(p?l.length=p:l=null),s.errors=l,0===i}function a(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:s=r}={}){let o=null,l=0;const i=l;let p=!1;const f=l;if("string"!=typeof r){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}var u=f===l;if(p=p||u,!p){const t=l;if(l==l)if(r&&"object"==typeof r&&!Array.isArray(r)){const t=l;for(const t in r)if("amd"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"root"!==t){const r={params:{additionalProperty:t}};null===o?o=[r]:o.push(r),l++;break}if(t===l){if(void 0!==r.amd){const t=l;if("string"!=typeof r.amd){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}var c=t===l}else c=!0;if(c){if(void 0!==r.commonjs){const t=l;if("string"!=typeof r.commonjs){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}c=t===l}else c=!0;if(c){if(void 0!==r.commonjs2){const t=l;if("string"!=typeof r.commonjs2){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}c=t===l}else c=!0;if(c)if(void 0!==r.root){const t=l;if("string"!=typeof r.root){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}c=t===l}else c=!0}}}}else{const r={params:{type:"object"}};null===o?o=[r]:o.push(r),l++}u=t===l,p=p||u}if(!p){const r={params:{}};return null===o?o=[r]:o.push(r),l++,a.errors=o,!1}return l=i,null!==o&&(i?o.length=i:o=null),a.errors=o,0===l}function o(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:s=r}={}){let a=null,l=0;const i=l;let p=!1;const f=l;if(l===f)if(Array.isArray(r))if(r.length<1){const r={params:{limit:1}};null===a?a=[r]:a.push(r),l++}else{const t=r.length;for(let e=0;e<t;e++){let t=r[e];const n=l;if(l===n)if("string"==typeof t){if(t.length<1){const r={params:{}};null===a?a=[r]:a.push(r),l++}}else{const r={params:{type:"string"}};null===a?a=[r]:a.push(r),l++}if(n!==l)break}}else{const r={params:{type:"array"}};null===a?a=[r]:a.push(r),l++}var u=f===l;if(p=p||u,!p){const t=l;if(l===t)if("string"==typeof r){if(r.length<1){const r={params:{}};null===a?a=[r]:a.push(r),l++}}else{const r={params:{type:"string"}};null===a?a=[r]:a.push(r),l++}if(u=t===l,p=p||u,!p){const t=l;if(l==l)if(r&&"object"==typeof r&&!Array.isArray(r)){const t=l;for(const t in r)if("amd"!==t&&"commonjs"!==t&&"root"!==t){const r={params:{additionalProperty:t}};null===a?a=[r]:a.push(r),l++;break}if(t===l){if(void 0!==r.amd){let t=r.amd;const e=l;if(l===e)if("string"==typeof t){if(t.length<1){const r={params:{}};null===a?a=[r]:a.push(r),l++}}else{const r={params:{type:"string"}};null===a?a=[r]:a.push(r),l++}var c=e===l}else c=!0;if(c){if(void 0!==r.commonjs){let t=r.commonjs;const e=l;if(l===e)if("string"==typeof t){if(t.length<1){const r={params:{}};null===a?a=[r]:a.push(r),l++}}else{const r={params:{type:"string"}};null===a?a=[r]:a.push(r),l++}c=e===l}else c=!0;if(c)if(void 0!==r.root){let t=r.root;const e=l,n=l;let s=!1;const o=l;if(l===o)if(Array.isArray(t)){const r=t.length;for(let e=0;e<r;e++){let r=t[e];const n=l;if(l===n)if("string"==typeof r){if(r.length<1){const r={params:{}};null===a?a=[r]:a.push(r),l++}}else{const r={params:{type:"string"}};null===a?a=[r]:a.push(r),l++}if(n!==l)break}}else{const r={params:{type:"array"}};null===a?a=[r]:a.push(r),l++}var m=o===l;if(s=s||m,!s){const r=l;if(l===r)if("string"==typeof t){if(t.length<1){const r={params:{}};null===a?a=[r]:a.push(r),l++}}else{const r={params:{type:"string"}};null===a?a=[r]:a.push(r),l++}m=r===l,s=s||m}if(s)l=n,null!==a&&(n?a.length=n:a=null);else{const r={params:{}};null===a?a=[r]:a.push(r),l++}c=e===l}else c=!0}}}else{const r={params:{type:"object"}};null===a?a=[r]:a.push(r),l++}u=t===l,p=p||u}}if(!p){const r={params:{}};return null===a?a=[r]:a.push(r),l++,o.errors=a,!1}return l=i,null!==a&&(i?a.length=i:a=null),o.errors=a,0===l}function l(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:s=r}={}){let i=null,p=0;if(0===p){if(!r||"object"!=typeof r||Array.isArray(r))return l.errors=[{params:{type:"object"}}],!1;{let e;if(void 0===r.type&&(e="type"))return l.errors=[{params:{missingProperty:e}}],!1;{const e=p;for(const t in r)if("auxiliaryComment"!==t&&"export"!==t&&"name"!==t&&"type"!==t&&"umdNamedDefine"!==t)return l.errors=[{params:{additionalProperty:t}}],!1;if(e===p){if(void 0!==r.auxiliaryComment){const e=p;a(r.auxiliaryComment,{instancePath:t+"/auxiliaryComment",parentData:r,parentDataProperty:"auxiliaryComment",rootData:s})||(i=null===i?a.errors:i.concat(a.errors),p=i.length);var f=e===p}else f=!0;if(f){if(void 0!==r.export){let t=r.export;const e=p,n=p;let s=!1;const a=p;if(p===a)if(Array.isArray(t)){const r=t.length;for(let e=0;e<r;e++){let r=t[e];const n=p;if(p===n)if("string"==typeof r){if(r.length<1){const r={params:{}};null===i?i=[r]:i.push(r),p++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),p++}if(n!==p)break}}else{const r={params:{type:"array"}};null===i?i=[r]:i.push(r),p++}var u=a===p;if(s=s||u,!s){const r=p;if(p===r)if("string"==typeof t){if(t.length<1){const r={params:{}};null===i?i=[r]:i.push(r),p++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),p++}u=r===p,s=s||u}if(!s){const r={params:{}};return null===i?i=[r]:i.push(r),p++,l.errors=i,!1}p=n,null!==i&&(n?i.length=n:i=null),f=e===p}else f=!0;if(f){if(void 0!==r.name){const e=p;o(r.name,{instancePath:t+"/name",parentData:r,parentDataProperty:"name",rootData:s})||(i=null===i?o.errors:i.concat(o.errors),p=i.length),f=e===p}else f=!0;if(f){if(void 0!==r.type){let t=r.type;const e=p,n=p;let s=!1;const a=p;if("var"!==t&&"module"!==t&&"assign"!==t&&"assign-properties"!==t&&"this"!==t&&"window"!==t&&"self"!==t&&"global"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"commonjs-module"!==t&&"commonjs-static"!==t&&"amd"!==t&&"amd-require"!==t&&"umd"!==t&&"umd2"!==t&&"jsonp"!==t&&"system"!==t){const r={params:{}};null===i?i=[r]:i.push(r),p++}var c=a===p;if(s=s||c,!s){const r=p;if("string"!=typeof t){const r={params:{type:"string"}};null===i?i=[r]:i.push(r),p++}c=r===p,s=s||c}if(!s){const r={params:{}};return null===i?i=[r]:i.push(r),p++,l.errors=i,!1}p=n,null!==i&&(n?i.length=n:i=null),f=e===p}else f=!0;if(f)if(void 0!==r.umdNamedDefine){const t=p;if("boolean"!=typeof r.umdNamedDefine)return l.errors=[{params:{type:"boolean"}}],!1;f=t===p}else f=!0}}}}}}}return l.errors=i,0===p}function i(t,{instancePath:e="",parentData:n,parentDataProperty:a,rootData:o=t}={}){let p=null,f=0;if(0===f){if(!t||"object"!=typeof t||Array.isArray(t))return i.errors=[{params:{type:"object"}}],!1;{let n;if(void 0===t.name&&(n="name")||void 0===t.exposes&&(n="exposes"))return i.errors=[{params:{missingProperty:n}}],!1;{const n=f;for(const r in t)if("exposes"!==r&&"filename"!==r&&"library"!==r&&"name"!==r&&"runtime"!==r&&"shareScope"!==r)return i.errors=[{params:{additionalProperty:r}}],!1;if(n===f){if(void 0!==t.exposes){const r=f;s(t.exposes,{instancePath:e+"/exposes",parentData:t,parentDataProperty:"exposes",rootData:o})||(p=null===p?s.errors:p.concat(s.errors),f=p.length);var u=r===f}else u=!0;if(u){if(void 0!==t.filename){let e=t.filename;const n=f;if(f===n){if("string"!=typeof e)return i.errors=[{params:{type:"string"}}],!1;if(e.includes("!")||!1!==r.test(e))return i.errors=[{params:{}}],!1;if(e.length<1)return i.errors=[{params:{}}],!1}u=n===f}else u=!0;if(u){if(void 0!==t.library){const r=f;l(t.library,{instancePath:e+"/library",parentData:t,parentDataProperty:"library",rootData:o})||(p=null===p?l.errors:p.concat(l.errors),f=p.length),u=r===f}else u=!0;if(u){if(void 0!==t.name){let r=t.name;const e=f;if(f===e){if("string"!=typeof r)return i.errors=[{params:{type:"string"}}],!1;if(r.length<1)return i.errors=[{params:{}}],!1}u=e===f}else u=!0;if(u){if(void 0!==t.runtime){let r=t.runtime;const e=f,n=f;let s=!1;const a=f;if(!1!==r){const r={params:{}};null===p?p=[r]:p.push(r),f++}var c=a===f;if(s=s||c,!s){const t=f;if(f===t)if("string"==typeof r){if(r.length<1){const r={params:{}};null===p?p=[r]:p.push(r),f++}}else{const r={params:{type:"string"}};null===p?p=[r]:p.push(r),f++}c=t===f,s=s||c}if(!s){const r={params:{}};return null===p?p=[r]:p.push(r),f++,i.errors=p,!1}f=n,null!==p&&(n?p.length=n:p=null),u=e===f}else u=!0;if(u)if(void 0!==t.shareScope){let r=t.shareScope;const e=f;if(f===e){if("string"!=typeof r)return i.errors=[{params:{type:"string"}}],!1;if(r.length<1)return i.errors=[{params:{}}],!1}u=e===f}else u=!0}}}}}}}}return i.errors=p,0===f}module.exports=i,module.exports.default=i;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.json
new file mode 100644
index 0000000..ac12494
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerPlugin.json
@@ -0,0 +1,286 @@
+{
+  "definitions": {
+    "AuxiliaryComment": {
+      "description": "Add a comment in the UMD wrapper.",
+      "anyOf": [
+        {
+          "description": "Append the same comment above each import style.",
+          "type": "string"
+        },
+        {
+          "$ref": "#/definitions/LibraryCustomUmdCommentObject"
+        }
+      ]
+    },
+    "EntryRuntime": {
+      "description": "The name of the runtime chunk. If set a runtime chunk with this name is created or an existing entrypoint is used as runtime.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "Exposes": {
+      "description": "Modules that should be exposed by this container. When provided, property name is used as public name, otherwise public name is automatically inferred from request.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be exposed by this container.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/ExposesItem"
+              },
+              {
+                "$ref": "#/definitions/ExposesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/ExposesObject"
+        }
+      ]
+    },
+    "ExposesConfig": {
+      "description": "Advanced configuration for modules that should be exposed by this container.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "import": {
+          "description": "Request to a module that should be exposed by this container.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/ExposesItem"
+            },
+            {
+              "$ref": "#/definitions/ExposesItems"
+            }
+          ]
+        },
+        "name": {
+          "description": "Custom chunk name for the exposed module.",
+          "type": "string"
+        }
+      },
+      "required": ["import"]
+    },
+    "ExposesItem": {
+      "description": "Module that should be exposed by this container.",
+      "type": "string",
+      "minLength": 1
+    },
+    "ExposesItems": {
+      "description": "Modules that should be exposed by this container.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/ExposesItem"
+      }
+    },
+    "ExposesObject": {
+      "description": "Modules that should be exposed by this container. Property names are used as public paths.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be exposed by this container.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/ExposesConfig"
+          },
+          {
+            "$ref": "#/definitions/ExposesItem"
+          },
+          {
+            "$ref": "#/definitions/ExposesItems"
+          }
+        ]
+      }
+    },
+    "LibraryCustomUmdCommentObject": {
+      "description": "Set explicit comments for `commonjs`, `commonjs2`, `amd`, and `root`.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "amd": {
+          "description": "Set comment for `amd` section in UMD.",
+          "type": "string"
+        },
+        "commonjs": {
+          "description": "Set comment for `commonjs` (exports) section in UMD.",
+          "type": "string"
+        },
+        "commonjs2": {
+          "description": "Set comment for `commonjs2` (module.exports) section in UMD.",
+          "type": "string"
+        },
+        "root": {
+          "description": "Set comment for `root` (global variable) section in UMD.",
+          "type": "string"
+        }
+      }
+    },
+    "LibraryCustomUmdObject": {
+      "description": "Description object for all UMD variants of the library name.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "amd": {
+          "description": "Name of the exposed AMD library in the UMD.",
+          "type": "string",
+          "minLength": 1
+        },
+        "commonjs": {
+          "description": "Name of the exposed commonjs export in the UMD.",
+          "type": "string",
+          "minLength": 1
+        },
+        "root": {
+          "description": "Name of the property exposed globally by a UMD library.",
+          "anyOf": [
+            {
+              "type": "array",
+              "items": {
+                "description": "Part of the name of the property exposed globally by a UMD library.",
+                "type": "string",
+                "minLength": 1
+              }
+            },
+            {
+              "type": "string",
+              "minLength": 1
+            }
+          ]
+        }
+      }
+    },
+    "LibraryExport": {
+      "description": "Specify which export should be exposed as library.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Part of the export that should be exposed as library.",
+            "type": "string",
+            "minLength": 1
+          }
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "LibraryName": {
+      "description": "The name of the library (some types allow unnamed libraries too).",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "A part of the library name.",
+            "type": "string",
+            "minLength": 1
+          },
+          "minItems": 1
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "$ref": "#/definitions/LibraryCustomUmdObject"
+        }
+      ]
+    },
+    "LibraryOptions": {
+      "description": "Options for library.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "auxiliaryComment": {
+          "$ref": "#/definitions/AuxiliaryComment"
+        },
+        "export": {
+          "$ref": "#/definitions/LibraryExport"
+        },
+        "name": {
+          "$ref": "#/definitions/LibraryName"
+        },
+        "type": {
+          "$ref": "#/definitions/LibraryType"
+        },
+        "umdNamedDefine": {
+          "$ref": "#/definitions/UmdNamedDefine"
+        }
+      },
+      "required": ["type"]
+    },
+    "LibraryType": {
+      "description": "Type of library (types included by default are 'var', 'module', 'assign', 'assign-properties', 'this', 'window', 'self', 'global', 'commonjs', 'commonjs2', 'commonjs-module', 'commonjs-static', 'amd', 'amd-require', 'umd', 'umd2', 'jsonp', 'system', but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": [
+            "var",
+            "module",
+            "assign",
+            "assign-properties",
+            "this",
+            "window",
+            "self",
+            "global",
+            "commonjs",
+            "commonjs2",
+            "commonjs-module",
+            "commonjs-static",
+            "amd",
+            "amd-require",
+            "umd",
+            "umd2",
+            "jsonp",
+            "system"
+          ]
+        },
+        {
+          "type": "string"
+        }
+      ]
+    },
+    "UmdNamedDefine": {
+      "description": "If `output.libraryTarget` is set to umd and `output.library` is set, setting this to true will name the AMD module.",
+      "type": "boolean"
+    }
+  },
+  "title": "ContainerPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "exposes": {
+      "$ref": "#/definitions/Exposes"
+    },
+    "filename": {
+      "description": "The filename for this container relative path inside the `output.path` directory.",
+      "type": "string",
+      "absolutePath": false,
+      "minLength": 1
+    },
+    "library": {
+      "$ref": "#/definitions/LibraryOptions"
+    },
+    "name": {
+      "description": "The name for this container.",
+      "type": "string",
+      "minLength": 1
+    },
+    "runtime": {
+      "$ref": "#/definitions/EntryRuntime"
+    },
+    "shareScope": {
+      "description": "The name of the share scope which is shared with the host (defaults to 'default').",
+      "type": "string",
+      "minLength": 1
+    }
+  },
+  "required": ["name", "exposes"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.check.d.ts
new file mode 100644
index 0000000..a199fbf
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/container/ContainerReferencePlugin").ContainerReferencePluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.check.js
new file mode 100644
index 0000000..ff4e605
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:a,parentDataProperty:n,rootData:o=t}={}){if(!Array.isArray(t))return r.errors=[{params:{type:"array"}}],!1;{const e=t.length;for(let a=0;a<e;a++){let e=t[a];const n=0;if("string"!=typeof e)return r.errors=[{params:{type:"string"}}],!1;if(e.length<1)return r.errors=[{params:{}}],!1;if(0!==n)break}}return r.errors=null,!0}function t(e,{instancePath:a="",parentData:n,parentDataProperty:o,rootData:s=e}={}){let l=null,p=0;if(0===p){if(!e||"object"!=typeof e||Array.isArray(e))return t.errors=[{params:{type:"object"}}],!1;{let n;if(void 0===e.external&&(n="external"))return t.errors=[{params:{missingProperty:n}}],!1;{const n=p;for(const r in e)if("external"!==r&&"shareScope"!==r)return t.errors=[{params:{additionalProperty:r}}],!1;if(n===p){if(void 0!==e.external){let n=e.external;const o=p,u=p;let f=!1;const m=p;if(p==p)if("string"==typeof n){if(n.length<1){const r={params:{}};null===l?l=[r]:l.push(r),p++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),p++}var i=m===p;if(f=f||i,!f){const t=p;r(n,{instancePath:a+"/external",parentData:e,parentDataProperty:"external",rootData:s})||(l=null===l?r.errors:l.concat(r.errors),p=l.length),i=t===p,f=f||i}if(!f){const r={params:{}};return null===l?l=[r]:l.push(r),p++,t.errors=l,!1}p=u,null!==l&&(u?l.length=u:l=null);var c=o===p}else c=!0;if(c)if(void 0!==e.shareScope){let r=e.shareScope;const a=p;if(p===a){if("string"!=typeof r)return t.errors=[{params:{type:"string"}}],!1;if(r.length<1)return t.errors=[{params:{}}],!1}c=a===p}else c=!0}}}}return t.errors=l,0===p}function e(a,{instancePath:n="",parentData:o,parentDataProperty:s,rootData:l=a}={}){let p=null,i=0;if(0===i){if(!a||"object"!=typeof a||Array.isArray(a))return e.errors=[{params:{type:"object"}}],!1;for(const o in a){let s=a[o];const u=i,f=i;let m=!1;const y=i;t(s,{instancePath:n+"/"+o.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:a,parentDataProperty:o,rootData:l})||(p=null===p?t.errors:p.concat(t.errors),i=p.length);var c=y===i;if(m=m||c,!m){const t=i;if(i==i)if("string"==typeof s){if(s.length<1){const r={params:{}};null===p?p=[r]:p.push(r),i++}}else{const r={params:{type:"string"}};null===p?p=[r]:p.push(r),i++}if(c=t===i,m=m||c,!m){const t=i;r(s,{instancePath:n+"/"+o.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:a,parentDataProperty:o,rootData:l})||(p=null===p?r.errors:p.concat(r.errors),i=p.length),c=t===i,m=m||c}}if(!m){const r={params:{}};return null===p?p=[r]:p.push(r),i++,e.errors=p,!1}if(i=f,null!==p&&(f?p.length=f:p=null),u!==i)break}}return e.errors=p,0===i}function a(r,{instancePath:t="",parentData:n,parentDataProperty:o,rootData:s=r}={}){let l=null,p=0;const i=p;let c=!1;const u=p;if(p===u)if(Array.isArray(r)){const a=r.length;for(let n=0;n<a;n++){let a=r[n];const o=p,i=p;let c=!1;const u=p;if(p==p)if("string"==typeof a){if(a.length<1){const r={params:{}};null===l?l=[r]:l.push(r),p++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),p++}var f=u===p;if(c=c||f,!c){const o=p;e(a,{instancePath:t+"/"+n,parentData:r,parentDataProperty:n,rootData:s})||(l=null===l?e.errors:l.concat(e.errors),p=l.length),f=o===p,c=c||f}if(c)p=i,null!==l&&(i?l.length=i:l=null);else{const r={params:{}};null===l?l=[r]:l.push(r),p++}if(o!==p)break}}else{const r={params:{type:"array"}};null===l?l=[r]:l.push(r),p++}var m=u===p;if(c=c||m,!c){const a=p;e(r,{instancePath:t,parentData:n,parentDataProperty:o,rootData:s})||(l=null===l?e.errors:l.concat(e.errors),p=l.length),m=a===p,c=c||m}if(!c){const r={params:{}};return null===l?l=[r]:l.push(r),p++,a.errors=l,!1}return p=i,null!==l&&(i?l.length=i:l=null),a.errors=l,0===p}function n(r,{instancePath:t="",parentData:e,parentDataProperty:o,rootData:s=r}={}){let l=null,p=0;if(0===p){if(!r||"object"!=typeof r||Array.isArray(r))return n.errors=[{params:{type:"object"}}],!1;{let e;if(void 0===r.remoteType&&(e="remoteType")||void 0===r.remotes&&(e="remotes"))return n.errors=[{params:{missingProperty:e}}],!1;{const e=p;for(const t in r)if("remoteType"!==t&&"remotes"!==t&&"shareScope"!==t)return n.errors=[{params:{additionalProperty:t}}],!1;if(e===p){if(void 0!==r.remoteType){let t=r.remoteType;const e=p,a=p;let o=!1,s=null;const c=p;if("var"!==t&&"module"!==t&&"assign"!==t&&"this"!==t&&"window"!==t&&"self"!==t&&"global"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"commonjs-module"!==t&&"commonjs-static"!==t&&"amd"!==t&&"amd-require"!==t&&"umd"!==t&&"umd2"!==t&&"jsonp"!==t&&"system"!==t&&"promise"!==t&&"import"!==t&&"script"!==t&&"node-commonjs"!==t){const r={params:{}};null===l?l=[r]:l.push(r),p++}if(c===p&&(o=!0,s=0),!o){const r={params:{passingSchemas:s}};return null===l?l=[r]:l.push(r),p++,n.errors=l,!1}p=a,null!==l&&(a?l.length=a:l=null);var i=e===p}else i=!0;if(i){if(void 0!==r.remotes){const e=p;a(r.remotes,{instancePath:t+"/remotes",parentData:r,parentDataProperty:"remotes",rootData:s})||(l=null===l?a.errors:l.concat(a.errors),p=l.length),i=e===p}else i=!0;if(i)if(void 0!==r.shareScope){let t=r.shareScope;const e=p;if(p===e){if("string"!=typeof t)return n.errors=[{params:{type:"string"}}],!1;if(t.length<1)return n.errors=[{params:{}}],!1}i=e===p}else i=!0}}}}}return n.errors=l,0===p}module.exports=n,module.exports.default=n;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.json
new file mode 100644
index 0000000..b7270cd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ContainerReferencePlugin.json
@@ -0,0 +1,128 @@
+{
+  "definitions": {
+    "ExternalsType": {
+      "description": "Specifies the default type of externals ('amd*', 'umd*', 'system' and 'jsonp' depend on output.libraryTarget set to the same value).",
+      "enum": [
+        "var",
+        "module",
+        "assign",
+        "this",
+        "window",
+        "self",
+        "global",
+        "commonjs",
+        "commonjs2",
+        "commonjs-module",
+        "commonjs-static",
+        "amd",
+        "amd-require",
+        "umd",
+        "umd2",
+        "jsonp",
+        "system",
+        "promise",
+        "import",
+        "script",
+        "node-commonjs"
+      ]
+    },
+    "Remotes": {
+      "description": "Container locations and request scopes from which modules should be resolved and loaded at runtime. When provided, property name is used as request scope, otherwise request scope is automatically inferred from container location.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Container locations and request scopes from which modules should be resolved and loaded at runtime.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/RemotesItem"
+              },
+              {
+                "$ref": "#/definitions/RemotesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/RemotesObject"
+        }
+      ]
+    },
+    "RemotesConfig": {
+      "description": "Advanced configuration for container locations from which modules should be resolved and loaded at runtime.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "external": {
+          "description": "Container locations from which modules should be resolved and loaded at runtime.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/RemotesItem"
+            },
+            {
+              "$ref": "#/definitions/RemotesItems"
+            }
+          ]
+        },
+        "shareScope": {
+          "description": "The name of the share scope shared with this remote.",
+          "type": "string",
+          "minLength": 1
+        }
+      },
+      "required": ["external"]
+    },
+    "RemotesItem": {
+      "description": "Container location from which modules should be resolved and loaded at runtime.",
+      "type": "string",
+      "minLength": 1
+    },
+    "RemotesItems": {
+      "description": "Container locations from which modules should be resolved and loaded at runtime.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/RemotesItem"
+      }
+    },
+    "RemotesObject": {
+      "description": "Container locations from which modules should be resolved and loaded at runtime. Property names are used as request scopes.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Container locations from which modules should be resolved and loaded at runtime.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/RemotesConfig"
+          },
+          {
+            "$ref": "#/definitions/RemotesItem"
+          },
+          {
+            "$ref": "#/definitions/RemotesItems"
+          }
+        ]
+      }
+    }
+  },
+  "title": "ContainerReferencePluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "remoteType": {
+      "description": "The external type of the remote containers.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/ExternalsType"
+        }
+      ]
+    },
+    "remotes": {
+      "$ref": "#/definitions/Remotes"
+    },
+    "shareScope": {
+      "description": "The name of the share scope shared with all remotes (defaults to 'default').",
+      "type": "string",
+      "minLength": 1
+    }
+  },
+  "required": ["remoteType", "remotes"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.check.d.ts
new file mode 100644
index 0000000..6b6174c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: any) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.check.js
new file mode 100644
index 0000000..2a033da
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function o(r,{instancePath:s="",parentData:m,parentDataProperty:t,rootData:e=r}={}){return"var"!==r&&"module"!==r&&"assign"!==r&&"this"!==r&&"window"!==r&&"self"!==r&&"global"!==r&&"commonjs"!==r&&"commonjs2"!==r&&"commonjs-module"!==r&&"commonjs-static"!==r&&"amd"!==r&&"amd-require"!==r&&"umd"!==r&&"umd2"!==r&&"jsonp"!==r&&"system"!==r&&"promise"!==r&&"import"!==r&&"script"!==r&&"node-commonjs"!==r?(o.errors=[{params:{}}],!1):(o.errors=null,!0)}module.exports=o,module.exports.default=o;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.json
new file mode 100644
index 0000000..d589858
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ExternalsType.json
@@ -0,0 +1,3 @@
+{
+  "$ref": "./ModuleFederationPlugin.json#/definitions/ExternalsType"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.check.d.ts
new file mode 100644
index 0000000..280e7d9
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/container/ModuleFederationPlugin").ModuleFederationPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.check.js
new file mode 100644
index 0000000..f018df8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const r=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;module.exports=d,module.exports.default=d;const t={exposes:{$ref:"#/definitions/Exposes"},filename:{type:"string",absolutePath:!1},library:{$ref:"#/definitions/LibraryOptions"},name:{type:"string"},remoteType:{oneOf:[{$ref:"#/definitions/ExternalsType"}]},remotes:{$ref:"#/definitions/Remotes"},runtime:{$ref:"#/definitions/EntryRuntime"},shareScope:{type:"string",minLength:1},shared:{$ref:"#/definitions/Shared"}},e=Object.prototype.hasOwnProperty;function n(r,{instancePath:t="",parentData:e,parentDataProperty:a,rootData:s=r}={}){if(!Array.isArray(r))return n.errors=[{params:{type:"array"}}],!1;{const t=r.length;for(let e=0;e<t;e++){let t=r[e];const a=0;if("string"!=typeof t)return n.errors=[{params:{type:"string"}}],!1;if(t.length<1)return n.errors=[{params:{}}],!1;if(0!==a)break}}return n.errors=null,!0}function a(r,{instancePath:t="",parentData:e,parentDataProperty:s,rootData:o=r}={}){let l=null,i=0;if(0===i){if(!r||"object"!=typeof r||Array.isArray(r))return a.errors=[{params:{type:"object"}}],!1;{let e;if(void 0===r.import&&(e="import"))return a.errors=[{params:{missingProperty:e}}],!1;{const e=i;for(const t in r)if("import"!==t&&"name"!==t)return a.errors=[{params:{additionalProperty:t}}],!1;if(e===i){if(void 0!==r.import){let e=r.import;const s=i,c=i;let u=!1;const m=i;if(i==i)if("string"==typeof e){if(e.length<1){const r={params:{}};null===l?l=[r]:l.push(r),i++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),i++}var p=m===i;if(u=u||p,!u){const a=i;n(e,{instancePath:t+"/import",parentData:r,parentDataProperty:"import",rootData:o})||(l=null===l?n.errors:l.concat(n.errors),i=l.length),p=a===i,u=u||p}if(!u){const r={params:{}};return null===l?l=[r]:l.push(r),i++,a.errors=l,!1}i=c,null!==l&&(c?l.length=c:l=null);var f=s===i}else f=!0;if(f)if(void 0!==r.name){const t=i;if("string"!=typeof r.name)return a.errors=[{params:{type:"string"}}],!1;f=t===i}else f=!0}}}}return a.errors=l,0===i}function s(r,{instancePath:t="",parentData:e,parentDataProperty:o,rootData:l=r}={}){let i=null,p=0;if(0===p){if(!r||"object"!=typeof r||Array.isArray(r))return s.errors=[{params:{type:"object"}}],!1;for(const e in r){let o=r[e];const c=p,u=p;let m=!1;const y=p;a(o,{instancePath:t+"/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:e,rootData:l})||(i=null===i?a.errors:i.concat(a.errors),p=i.length);var f=y===p;if(m=m||f,!m){const a=p;if(p==p)if("string"==typeof o){if(o.length<1){const r={params:{}};null===i?i=[r]:i.push(r),p++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),p++}if(f=a===p,m=m||f,!m){const a=p;n(o,{instancePath:t+"/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:e,rootData:l})||(i=null===i?n.errors:i.concat(n.errors),p=i.length),f=a===p,m=m||f}}if(!m){const r={params:{}};return null===i?i=[r]:i.push(r),p++,s.errors=i,!1}if(p=u,null!==i&&(u?i.length=u:i=null),c!==p)break}}return s.errors=i,0===p}function o(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let l=null,i=0;const p=i;let f=!1;const c=i;if(i===c)if(Array.isArray(r)){const e=r.length;for(let n=0;n<e;n++){let e=r[n];const o=i,p=i;let f=!1;const c=i;if(i==i)if("string"==typeof e){if(e.length<1){const r={params:{}};null===l?l=[r]:l.push(r),i++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),i++}var u=c===i;if(f=f||u,!f){const o=i;s(e,{instancePath:t+"/"+n,parentData:r,parentDataProperty:n,rootData:a})||(l=null===l?s.errors:l.concat(s.errors),i=l.length),u=o===i,f=f||u}if(f)i=p,null!==l&&(p?l.length=p:l=null);else{const r={params:{}};null===l?l=[r]:l.push(r),i++}if(o!==i)break}}else{const r={params:{type:"array"}};null===l?l=[r]:l.push(r),i++}var m=c===i;if(f=f||m,!f){const o=i;s(r,{instancePath:t,parentData:e,parentDataProperty:n,rootData:a})||(l=null===l?s.errors:l.concat(s.errors),i=l.length),m=o===i,f=f||m}if(!f){const r={params:{}};return null===l?l=[r]:l.push(r),i++,o.errors=l,!1}return i=p,null!==l&&(p?l.length=p:l=null),o.errors=l,0===i}function l(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;const i=o;let p=!1;const f=o;if("string"!=typeof r){const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}var c=f===o;if(p=p||c,!p){const t=o;if(o==o)if(r&&"object"==typeof r&&!Array.isArray(r)){const t=o;for(const t in r)if("amd"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"root"!==t){const r={params:{additionalProperty:t}};null===s?s=[r]:s.push(r),o++;break}if(t===o){if(void 0!==r.amd){const t=o;if("string"!=typeof r.amd){const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}var u=t===o}else u=!0;if(u){if(void 0!==r.commonjs){const t=o;if("string"!=typeof r.commonjs){const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}u=t===o}else u=!0;if(u){if(void 0!==r.commonjs2){const t=o;if("string"!=typeof r.commonjs2){const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}u=t===o}else u=!0;if(u)if(void 0!==r.root){const t=o;if("string"!=typeof r.root){const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}u=t===o}else u=!0}}}}else{const r={params:{type:"object"}};null===s?s=[r]:s.push(r),o++}c=t===o,p=p||c}if(!p){const r={params:{}};return null===s?s=[r]:s.push(r),o++,l.errors=s,!1}return o=i,null!==s&&(i?s.length=i:s=null),l.errors=s,0===o}function i(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;const l=o;let p=!1;const f=o;if(o===f)if(Array.isArray(r))if(r.length<1){const r={params:{limit:1}};null===s?s=[r]:s.push(r),o++}else{const t=r.length;for(let e=0;e<t;e++){let t=r[e];const n=o;if(o===n)if("string"==typeof t){if(t.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}if(n!==o)break}}else{const r={params:{type:"array"}};null===s?s=[r]:s.push(r),o++}var c=f===o;if(p=p||c,!p){const t=o;if(o===t)if("string"==typeof r){if(r.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}if(c=t===o,p=p||c,!p){const t=o;if(o==o)if(r&&"object"==typeof r&&!Array.isArray(r)){const t=o;for(const t in r)if("amd"!==t&&"commonjs"!==t&&"root"!==t){const r={params:{additionalProperty:t}};null===s?s=[r]:s.push(r),o++;break}if(t===o){if(void 0!==r.amd){let t=r.amd;const e=o;if(o===e)if("string"==typeof t){if(t.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}var u=e===o}else u=!0;if(u){if(void 0!==r.commonjs){let t=r.commonjs;const e=o;if(o===e)if("string"==typeof t){if(t.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}u=e===o}else u=!0;if(u)if(void 0!==r.root){let t=r.root;const e=o,n=o;let a=!1;const l=o;if(o===l)if(Array.isArray(t)){const r=t.length;for(let e=0;e<r;e++){let r=t[e];const n=o;if(o===n)if("string"==typeof r){if(r.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}if(n!==o)break}}else{const r={params:{type:"array"}};null===s?s=[r]:s.push(r),o++}var m=l===o;if(a=a||m,!a){const r=o;if(o===r)if("string"==typeof t){if(t.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}m=r===o,a=a||m}if(a)o=n,null!==s&&(n?s.length=n:s=null);else{const r={params:{}};null===s?s=[r]:s.push(r),o++}u=e===o}else u=!0}}}else{const r={params:{type:"object"}};null===s?s=[r]:s.push(r),o++}c=t===o,p=p||c}}if(!p){const r={params:{}};return null===s?s=[r]:s.push(r),o++,i.errors=s,!1}return o=l,null!==s&&(l?s.length=l:s=null),i.errors=s,0===o}function p(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;if(0===o){if(!r||"object"!=typeof r||Array.isArray(r))return p.errors=[{params:{type:"object"}}],!1;{let e;if(void 0===r.type&&(e="type"))return p.errors=[{params:{missingProperty:e}}],!1;{const e=o;for(const t in r)if("auxiliaryComment"!==t&&"export"!==t&&"name"!==t&&"type"!==t&&"umdNamedDefine"!==t)return p.errors=[{params:{additionalProperty:t}}],!1;if(e===o){if(void 0!==r.auxiliaryComment){const e=o;l(r.auxiliaryComment,{instancePath:t+"/auxiliaryComment",parentData:r,parentDataProperty:"auxiliaryComment",rootData:a})||(s=null===s?l.errors:s.concat(l.errors),o=s.length);var f=e===o}else f=!0;if(f){if(void 0!==r.export){let t=r.export;const e=o,n=o;let a=!1;const l=o;if(o===l)if(Array.isArray(t)){const r=t.length;for(let e=0;e<r;e++){let r=t[e];const n=o;if(o===n)if("string"==typeof r){if(r.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}if(n!==o)break}}else{const r={params:{type:"array"}};null===s?s=[r]:s.push(r),o++}var c=l===o;if(a=a||c,!a){const r=o;if(o===r)if("string"==typeof t){if(t.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}c=r===o,a=a||c}if(!a){const r={params:{}};return null===s?s=[r]:s.push(r),o++,p.errors=s,!1}o=n,null!==s&&(n?s.length=n:s=null),f=e===o}else f=!0;if(f){if(void 0!==r.name){const e=o;i(r.name,{instancePath:t+"/name",parentData:r,parentDataProperty:"name",rootData:a})||(s=null===s?i.errors:s.concat(i.errors),o=s.length),f=e===o}else f=!0;if(f){if(void 0!==r.type){let t=r.type;const e=o,n=o;let a=!1;const l=o;if("var"!==t&&"module"!==t&&"assign"!==t&&"assign-properties"!==t&&"this"!==t&&"window"!==t&&"self"!==t&&"global"!==t&&"commonjs"!==t&&"commonjs2"!==t&&"commonjs-module"!==t&&"commonjs-static"!==t&&"amd"!==t&&"amd-require"!==t&&"umd"!==t&&"umd2"!==t&&"jsonp"!==t&&"system"!==t){const r={params:{}};null===s?s=[r]:s.push(r),o++}var u=l===o;if(a=a||u,!a){const r=o;if("string"!=typeof t){const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}u=r===o,a=a||u}if(!a){const r={params:{}};return null===s?s=[r]:s.push(r),o++,p.errors=s,!1}o=n,null!==s&&(n?s.length=n:s=null),f=e===o}else f=!0;if(f)if(void 0!==r.umdNamedDefine){const t=o;if("boolean"!=typeof r.umdNamedDefine)return p.errors=[{params:{type:"boolean"}}],!1;f=t===o}else f=!0}}}}}}}return p.errors=s,0===o}function f(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){if(!Array.isArray(r))return f.errors=[{params:{type:"array"}}],!1;{const t=r.length;for(let e=0;e<t;e++){let t=r[e];const n=0;if("string"!=typeof t)return f.errors=[{params:{type:"string"}}],!1;if(t.length<1)return f.errors=[{params:{}}],!1;if(0!==n)break}}return f.errors=null,!0}function c(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;if(0===o){if(!r||"object"!=typeof r||Array.isArray(r))return c.errors=[{params:{type:"object"}}],!1;{let e;if(void 0===r.external&&(e="external"))return c.errors=[{params:{missingProperty:e}}],!1;{const e=o;for(const t in r)if("external"!==t&&"shareScope"!==t)return c.errors=[{params:{additionalProperty:t}}],!1;if(e===o){if(void 0!==r.external){let e=r.external;const n=o,p=o;let u=!1;const m=o;if(o==o)if("string"==typeof e){if(e.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}var l=m===o;if(u=u||l,!u){const n=o;f(e,{instancePath:t+"/external",parentData:r,parentDataProperty:"external",rootData:a})||(s=null===s?f.errors:s.concat(f.errors),o=s.length),l=n===o,u=u||l}if(!u){const r={params:{}};return null===s?s=[r]:s.push(r),o++,c.errors=s,!1}o=p,null!==s&&(p?s.length=p:s=null);var i=n===o}else i=!0;if(i)if(void 0!==r.shareScope){let t=r.shareScope;const e=o;if(o===e){if("string"!=typeof t)return c.errors=[{params:{type:"string"}}],!1;if(t.length<1)return c.errors=[{params:{}}],!1}i=e===o}else i=!0}}}}return c.errors=s,0===o}function u(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;if(0===o){if(!r||"object"!=typeof r||Array.isArray(r))return u.errors=[{params:{type:"object"}}],!1;for(const e in r){let n=r[e];const i=o,p=o;let m=!1;const y=o;c(n,{instancePath:t+"/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:e,rootData:a})||(s=null===s?c.errors:s.concat(c.errors),o=s.length);var l=y===o;if(m=m||l,!m){const i=o;if(o==o)if("string"==typeof n){if(n.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}if(l=i===o,m=m||l,!m){const i=o;f(n,{instancePath:t+"/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:e,rootData:a})||(s=null===s?f.errors:s.concat(f.errors),o=s.length),l=i===o,m=m||l}}if(!m){const r={params:{}};return null===s?s=[r]:s.push(r),o++,u.errors=s,!1}if(o=p,null!==s&&(p?s.length=p:s=null),i!==o)break}}return u.errors=s,0===o}function m(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;const l=o;let i=!1;const p=o;if(o===p)if(Array.isArray(r)){const e=r.length;for(let n=0;n<e;n++){let e=r[n];const l=o,i=o;let p=!1;const c=o;if(o==o)if("string"==typeof e){if(e.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}var f=c===o;if(p=p||f,!p){const l=o;u(e,{instancePath:t+"/"+n,parentData:r,parentDataProperty:n,rootData:a})||(s=null===s?u.errors:s.concat(u.errors),o=s.length),f=l===o,p=p||f}if(p)o=i,null!==s&&(i?s.length=i:s=null);else{const r={params:{}};null===s?s=[r]:s.push(r),o++}if(l!==o)break}}else{const r={params:{type:"array"}};null===s?s=[r]:s.push(r),o++}var c=p===o;if(i=i||c,!i){const l=o;u(r,{instancePath:t,parentData:e,parentDataProperty:n,rootData:a})||(s=null===s?u.errors:s.concat(u.errors),o=s.length),c=l===o,i=i||c}if(!i){const r={params:{}};return null===s?s=[r]:s.push(r),o++,m.errors=s,!1}return o=l,null!==s&&(l?s.length=l:s=null),m.errors=s,0===o}const y={eager:{type:"boolean"},import:{anyOf:[{enum:[!1]},{$ref:"#/definitions/SharedItem"}]},packageName:{type:"string",minLength:1},requiredVersion:{anyOf:[{enum:[!1]},{type:"string"}]},shareKey:{type:"string",minLength:1},shareScope:{type:"string",minLength:1},singleton:{type:"boolean"},strictVersion:{type:"boolean"},version:{anyOf:[{enum:[!1]},{type:"string"}]}};function h(r,{instancePath:t="",parentData:n,parentDataProperty:a,rootData:s=r}={}){let o=null,l=0;if(0===l){if(!r||"object"!=typeof r||Array.isArray(r))return h.errors=[{params:{type:"object"}}],!1;{const t=l;for(const t in r)if(!e.call(y,t))return h.errors=[{params:{additionalProperty:t}}],!1;if(t===l){if(void 0!==r.eager){const t=l;if("boolean"!=typeof r.eager)return h.errors=[{params:{type:"boolean"}}],!1;var i=t===l}else i=!0;if(i){if(void 0!==r.import){let t=r.import;const e=l,n=l;let a=!1;const s=l;if(!1!==t){const r={params:{}};null===o?o=[r]:o.push(r),l++}var p=s===l;if(a=a||p,!a){const r=l;if(l==l)if("string"==typeof t){if(t.length<1){const r={params:{}};null===o?o=[r]:o.push(r),l++}}else{const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}p=r===l,a=a||p}if(!a){const r={params:{}};return null===o?o=[r]:o.push(r),l++,h.errors=o,!1}l=n,null!==o&&(n?o.length=n:o=null),i=e===l}else i=!0;if(i){if(void 0!==r.packageName){let t=r.packageName;const e=l;if(l===e){if("string"!=typeof t)return h.errors=[{params:{type:"string"}}],!1;if(t.length<1)return h.errors=[{params:{}}],!1}i=e===l}else i=!0;if(i){if(void 0!==r.requiredVersion){let t=r.requiredVersion;const e=l,n=l;let a=!1;const s=l;if(!1!==t){const r={params:{}};null===o?o=[r]:o.push(r),l++}var f=s===l;if(a=a||f,!a){const r=l;if("string"!=typeof t){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}f=r===l,a=a||f}if(!a){const r={params:{}};return null===o?o=[r]:o.push(r),l++,h.errors=o,!1}l=n,null!==o&&(n?o.length=n:o=null),i=e===l}else i=!0;if(i){if(void 0!==r.shareKey){let t=r.shareKey;const e=l;if(l===e){if("string"!=typeof t)return h.errors=[{params:{type:"string"}}],!1;if(t.length<1)return h.errors=[{params:{}}],!1}i=e===l}else i=!0;if(i){if(void 0!==r.shareScope){let t=r.shareScope;const e=l;if(l===e){if("string"!=typeof t)return h.errors=[{params:{type:"string"}}],!1;if(t.length<1)return h.errors=[{params:{}}],!1}i=e===l}else i=!0;if(i){if(void 0!==r.singleton){const t=l;if("boolean"!=typeof r.singleton)return h.errors=[{params:{type:"boolean"}}],!1;i=t===l}else i=!0;if(i){if(void 0!==r.strictVersion){const t=l;if("boolean"!=typeof r.strictVersion)return h.errors=[{params:{type:"boolean"}}],!1;i=t===l}else i=!0;if(i)if(void 0!==r.version){let t=r.version;const e=l,n=l;let a=!1;const s=l;if(!1!==t){const r={params:{}};null===o?o=[r]:o.push(r),l++}var c=s===l;if(a=a||c,!a){const r=l;if("string"!=typeof t){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}c=r===l,a=a||c}if(!a){const r={params:{}};return null===o?o=[r]:o.push(r),l++,h.errors=o,!1}l=n,null!==o&&(n?o.length=n:o=null),i=e===l}else i=!0}}}}}}}}}}return h.errors=o,0===l}function g(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;if(0===o){if(!r||"object"!=typeof r||Array.isArray(r))return g.errors=[{params:{type:"object"}}],!1;for(const e in r){let n=r[e];const i=o,p=o;let f=!1;const c=o;h(n,{instancePath:t+"/"+e.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:e,rootData:a})||(s=null===s?h.errors:s.concat(h.errors),o=s.length);var l=c===o;if(f=f||l,!f){const r=o;if(o==o)if("string"==typeof n){if(n.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}l=r===o,f=f||l}if(!f){const r={params:{}};return null===s?s=[r]:s.push(r),o++,g.errors=s,!1}if(o=p,null!==s&&(p?s.length=p:s=null),i!==o)break}}return g.errors=s,0===o}function D(r,{instancePath:t="",parentData:e,parentDataProperty:n,rootData:a=r}={}){let s=null,o=0;const l=o;let i=!1;const p=o;if(o===p)if(Array.isArray(r)){const e=r.length;for(let n=0;n<e;n++){let e=r[n];const l=o,i=o;let p=!1;const c=o;if(o==o)if("string"==typeof e){if(e.length<1){const r={params:{}};null===s?s=[r]:s.push(r),o++}}else{const r={params:{type:"string"}};null===s?s=[r]:s.push(r),o++}var f=c===o;if(p=p||f,!p){const l=o;g(e,{instancePath:t+"/"+n,parentData:r,parentDataProperty:n,rootData:a})||(s=null===s?g.errors:s.concat(g.errors),o=s.length),f=l===o,p=p||f}if(p)o=i,null!==s&&(i?s.length=i:s=null);else{const r={params:{}};null===s?s=[r]:s.push(r),o++}if(l!==o)break}}else{const r={params:{type:"array"}};null===s?s=[r]:s.push(r),o++}var c=p===o;if(i=i||c,!i){const l=o;g(r,{instancePath:t,parentData:e,parentDataProperty:n,rootData:a})||(s=null===s?g.errors:s.concat(g.errors),o=s.length),c=l===o,i=i||c}if(!i){const r={params:{}};return null===s?s=[r]:s.push(r),o++,D.errors=s,!1}return o=l,null!==s&&(l?s.length=l:s=null),D.errors=s,0===o}function d(n,{instancePath:a="",parentData:s,parentDataProperty:l,rootData:i=n}={}){let f=null,c=0;if(0===c){if(!n||"object"!=typeof n||Array.isArray(n))return d.errors=[{params:{type:"object"}}],!1;{const s=c;for(const r in n)if(!e.call(t,r))return d.errors=[{params:{additionalProperty:r}}],!1;if(s===c){if(void 0!==n.exposes){const r=c;o(n.exposes,{instancePath:a+"/exposes",parentData:n,parentDataProperty:"exposes",rootData:i})||(f=null===f?o.errors:f.concat(o.errors),c=f.length);var u=r===c}else u=!0;if(u){if(void 0!==n.filename){let t=n.filename;const e=c;if(c===e){if("string"!=typeof t)return d.errors=[{params:{type:"string"}}],!1;if(t.includes("!")||!1!==r.test(t))return d.errors=[{params:{}}],!1}u=e===c}else u=!0;if(u){if(void 0!==n.library){const r=c;p(n.library,{instancePath:a+"/library",parentData:n,parentDataProperty:"library",rootData:i})||(f=null===f?p.errors:f.concat(p.errors),c=f.length),u=r===c}else u=!0;if(u){if(void 0!==n.name){const r=c;if("string"!=typeof n.name)return d.errors=[{params:{type:"string"}}],!1;u=r===c}else u=!0;if(u){if(void 0!==n.remoteType){let r=n.remoteType;const t=c,e=c;let a=!1,s=null;const o=c;if("var"!==r&&"module"!==r&&"assign"!==r&&"this"!==r&&"window"!==r&&"self"!==r&&"global"!==r&&"commonjs"!==r&&"commonjs2"!==r&&"commonjs-module"!==r&&"commonjs-static"!==r&&"amd"!==r&&"amd-require"!==r&&"umd"!==r&&"umd2"!==r&&"jsonp"!==r&&"system"!==r&&"promise"!==r&&"import"!==r&&"script"!==r&&"node-commonjs"!==r){const r={params:{}};null===f?f=[r]:f.push(r),c++}if(o===c&&(a=!0,s=0),!a){const r={params:{passingSchemas:s}};return null===f?f=[r]:f.push(r),c++,d.errors=f,!1}c=e,null!==f&&(e?f.length=e:f=null),u=t===c}else u=!0;if(u){if(void 0!==n.remotes){const r=c;m(n.remotes,{instancePath:a+"/remotes",parentData:n,parentDataProperty:"remotes",rootData:i})||(f=null===f?m.errors:f.concat(m.errors),c=f.length),u=r===c}else u=!0;if(u){if(void 0!==n.runtime){let r=n.runtime;const t=c,e=c;let a=!1;const s=c;if(!1!==r){const r={params:{}};null===f?f=[r]:f.push(r),c++}var y=s===c;if(a=a||y,!a){const t=c;if(c===t)if("string"==typeof r){if(r.length<1){const r={params:{}};null===f?f=[r]:f.push(r),c++}}else{const r={params:{type:"string"}};null===f?f=[r]:f.push(r),c++}y=t===c,a=a||y}if(!a){const r={params:{}};return null===f?f=[r]:f.push(r),c++,d.errors=f,!1}c=e,null!==f&&(e?f.length=e:f=null),u=t===c}else u=!0;if(u){if(void 0!==n.shareScope){let r=n.shareScope;const t=c;if(c===t){if("string"!=typeof r)return d.errors=[{params:{type:"string"}}],!1;if(r.length<1)return d.errors=[{params:{}}],!1}u=t===c}else u=!0;if(u)if(void 0!==n.shared){const r=c;D(n.shared,{instancePath:a+"/shared",parentData:n,parentDataProperty:"shared",rootData:i})||(f=null===f?D.errors:f.concat(D.errors),c=f.length),u=r===c}else u=!0}}}}}}}}}}return d.errors=f,0===c}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.json
new file mode 100644
index 0000000..509ad6a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/container/ModuleFederationPlugin.json
@@ -0,0 +1,513 @@
+{
+  "definitions": {
+    "AuxiliaryComment": {
+      "description": "Add a comment in the UMD wrapper.",
+      "anyOf": [
+        {
+          "description": "Append the same comment above each import style.",
+          "type": "string"
+        },
+        {
+          "$ref": "#/definitions/LibraryCustomUmdCommentObject"
+        }
+      ]
+    },
+    "EntryRuntime": {
+      "description": "The name of the runtime chunk. If set a runtime chunk with this name is created or an existing entrypoint is used as runtime.",
+      "anyOf": [
+        {
+          "enum": [false]
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "Exposes": {
+      "description": "Modules that should be exposed by this container. When provided, property name is used as public name, otherwise public name is automatically inferred from request.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be exposed by this container.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/ExposesItem"
+              },
+              {
+                "$ref": "#/definitions/ExposesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/ExposesObject"
+        }
+      ]
+    },
+    "ExposesConfig": {
+      "description": "Advanced configuration for modules that should be exposed by this container.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "import": {
+          "description": "Request to a module that should be exposed by this container.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/ExposesItem"
+            },
+            {
+              "$ref": "#/definitions/ExposesItems"
+            }
+          ]
+        },
+        "name": {
+          "description": "Custom chunk name for the exposed module.",
+          "type": "string"
+        }
+      },
+      "required": ["import"]
+    },
+    "ExposesItem": {
+      "description": "Module that should be exposed by this container.",
+      "type": "string",
+      "minLength": 1
+    },
+    "ExposesItems": {
+      "description": "Modules that should be exposed by this container.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/ExposesItem"
+      }
+    },
+    "ExposesObject": {
+      "description": "Modules that should be exposed by this container. Property names are used as public paths.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be exposed by this container.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/ExposesConfig"
+          },
+          {
+            "$ref": "#/definitions/ExposesItem"
+          },
+          {
+            "$ref": "#/definitions/ExposesItems"
+          }
+        ]
+      }
+    },
+    "ExternalsType": {
+      "description": "Specifies the default type of externals ('amd*', 'umd*', 'system' and 'jsonp' depend on output.libraryTarget set to the same value).",
+      "enum": [
+        "var",
+        "module",
+        "assign",
+        "this",
+        "window",
+        "self",
+        "global",
+        "commonjs",
+        "commonjs2",
+        "commonjs-module",
+        "commonjs-static",
+        "amd",
+        "amd-require",
+        "umd",
+        "umd2",
+        "jsonp",
+        "system",
+        "promise",
+        "import",
+        "script",
+        "node-commonjs"
+      ]
+    },
+    "LibraryCustomUmdCommentObject": {
+      "description": "Set explicit comments for `commonjs`, `commonjs2`, `amd`, and `root`.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "amd": {
+          "description": "Set comment for `amd` section in UMD.",
+          "type": "string"
+        },
+        "commonjs": {
+          "description": "Set comment for `commonjs` (exports) section in UMD.",
+          "type": "string"
+        },
+        "commonjs2": {
+          "description": "Set comment for `commonjs2` (module.exports) section in UMD.",
+          "type": "string"
+        },
+        "root": {
+          "description": "Set comment for `root` (global variable) section in UMD.",
+          "type": "string"
+        }
+      }
+    },
+    "LibraryCustomUmdObject": {
+      "description": "Description object for all UMD variants of the library name.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "amd": {
+          "description": "Name of the exposed AMD library in the UMD.",
+          "type": "string",
+          "minLength": 1
+        },
+        "commonjs": {
+          "description": "Name of the exposed commonjs export in the UMD.",
+          "type": "string",
+          "minLength": 1
+        },
+        "root": {
+          "description": "Name of the property exposed globally by a UMD library.",
+          "anyOf": [
+            {
+              "type": "array",
+              "items": {
+                "description": "Part of the name of the property exposed globally by a UMD library.",
+                "type": "string",
+                "minLength": 1
+              }
+            },
+            {
+              "type": "string",
+              "minLength": 1
+            }
+          ]
+        }
+      }
+    },
+    "LibraryExport": {
+      "description": "Specify which export should be exposed as library.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Part of the export that should be exposed as library.",
+            "type": "string",
+            "minLength": 1
+          }
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        }
+      ]
+    },
+    "LibraryName": {
+      "description": "The name of the library (some types allow unnamed libraries too).",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "A part of the library name.",
+            "type": "string",
+            "minLength": 1
+          },
+          "minItems": 1
+        },
+        {
+          "type": "string",
+          "minLength": 1
+        },
+        {
+          "$ref": "#/definitions/LibraryCustomUmdObject"
+        }
+      ]
+    },
+    "LibraryOptions": {
+      "description": "Options for library.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "auxiliaryComment": {
+          "$ref": "#/definitions/AuxiliaryComment"
+        },
+        "export": {
+          "$ref": "#/definitions/LibraryExport"
+        },
+        "name": {
+          "$ref": "#/definitions/LibraryName"
+        },
+        "type": {
+          "$ref": "#/definitions/LibraryType"
+        },
+        "umdNamedDefine": {
+          "$ref": "#/definitions/UmdNamedDefine"
+        }
+      },
+      "required": ["type"]
+    },
+    "LibraryType": {
+      "description": "Type of library (types included by default are 'var', 'module', 'assign', 'assign-properties', 'this', 'window', 'self', 'global', 'commonjs', 'commonjs2', 'commonjs-module', 'commonjs-static', 'amd', 'amd-require', 'umd', 'umd2', 'jsonp', 'system', but others might be added by plugins).",
+      "anyOf": [
+        {
+          "enum": [
+            "var",
+            "module",
+            "assign",
+            "assign-properties",
+            "this",
+            "window",
+            "self",
+            "global",
+            "commonjs",
+            "commonjs2",
+            "commonjs-module",
+            "commonjs-static",
+            "amd",
+            "amd-require",
+            "umd",
+            "umd2",
+            "jsonp",
+            "system"
+          ]
+        },
+        {
+          "type": "string"
+        }
+      ]
+    },
+    "Remotes": {
+      "description": "Container locations and request scopes from which modules should be resolved and loaded at runtime. When provided, property name is used as request scope, otherwise request scope is automatically inferred from container location.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Container locations and request scopes from which modules should be resolved and loaded at runtime.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/RemotesItem"
+              },
+              {
+                "$ref": "#/definitions/RemotesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/RemotesObject"
+        }
+      ]
+    },
+    "RemotesConfig": {
+      "description": "Advanced configuration for container locations from which modules should be resolved and loaded at runtime.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "external": {
+          "description": "Container locations from which modules should be resolved and loaded at runtime.",
+          "anyOf": [
+            {
+              "$ref": "#/definitions/RemotesItem"
+            },
+            {
+              "$ref": "#/definitions/RemotesItems"
+            }
+          ]
+        },
+        "shareScope": {
+          "description": "The name of the share scope shared with this remote.",
+          "type": "string",
+          "minLength": 1
+        }
+      },
+      "required": ["external"]
+    },
+    "RemotesItem": {
+      "description": "Container location from which modules should be resolved and loaded at runtime.",
+      "type": "string",
+      "minLength": 1
+    },
+    "RemotesItems": {
+      "description": "Container locations from which modules should be resolved and loaded at runtime.",
+      "type": "array",
+      "items": {
+        "$ref": "#/definitions/RemotesItem"
+      }
+    },
+    "RemotesObject": {
+      "description": "Container locations from which modules should be resolved and loaded at runtime. Property names are used as request scopes.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Container locations from which modules should be resolved and loaded at runtime.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/RemotesConfig"
+          },
+          {
+            "$ref": "#/definitions/RemotesItem"
+          },
+          {
+            "$ref": "#/definitions/RemotesItems"
+          }
+        ]
+      }
+    },
+    "Shared": {
+      "description": "Modules that should be shared in the share scope. When provided, property names are used to match requested modules in this compilation.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be shared in the share scope.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/SharedItem"
+              },
+              {
+                "$ref": "#/definitions/SharedObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/SharedObject"
+        }
+      ]
+    },
+    "SharedConfig": {
+      "description": "Advanced configuration for modules that should be shared in the share scope.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "eager": {
+          "description": "Include the provided and fallback module directly instead behind an async request. This allows to use this shared module in initial load too. All possible shared modules need to be eager too.",
+          "type": "boolean"
+        },
+        "import": {
+          "description": "Provided module that should be provided to share scope. Also acts as fallback module if no shared module is found in share scope or version isn't valid. Defaults to the property name.",
+          "anyOf": [
+            {
+              "description": "No provided or fallback module.",
+              "enum": [false]
+            },
+            {
+              "$ref": "#/definitions/SharedItem"
+            }
+          ]
+        },
+        "packageName": {
+          "description": "Package name to determine required version from description file. This is only needed when package name can't be automatically determined from request.",
+          "type": "string",
+          "minLength": 1
+        },
+        "requiredVersion": {
+          "description": "Version requirement from module in share scope.",
+          "anyOf": [
+            {
+              "description": "No version requirement check.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Can be prefixed with '^' or '~' for minimum matches. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        },
+        "shareKey": {
+          "description": "Module is looked up under this key from the share scope.",
+          "type": "string",
+          "minLength": 1
+        },
+        "shareScope": {
+          "description": "Share scope name.",
+          "type": "string",
+          "minLength": 1
+        },
+        "singleton": {
+          "description": "Allow only a single version of the shared module in share scope (disabled by default).",
+          "type": "boolean"
+        },
+        "strictVersion": {
+          "description": "Do not accept shared module if version is not valid (defaults to yes, if local fallback module is available and shared module is not a singleton, otherwise no, has no effect if there is no required version specified).",
+          "type": "boolean"
+        },
+        "version": {
+          "description": "Version of the provided module. Will replace lower matching versions, but not higher.",
+          "anyOf": [
+            {
+              "description": "Don't provide a version.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        }
+      }
+    },
+    "SharedItem": {
+      "description": "A module that should be shared in the share scope.",
+      "type": "string",
+      "minLength": 1
+    },
+    "SharedObject": {
+      "description": "Modules that should be shared in the share scope. Property names are used to match requested modules in this compilation. Relative requests are resolved, module requests are matched unresolved, absolute paths will match resolved requests. A trailing slash will match all requests with this prefix. In this case shareKey must also have a trailing slash.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be shared in the share scope.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/SharedConfig"
+          },
+          {
+            "$ref": "#/definitions/SharedItem"
+          }
+        ]
+      }
+    },
+    "UmdNamedDefine": {
+      "description": "If `output.libraryTarget` is set to umd and `output.library` is set, setting this to true will name the AMD module.",
+      "type": "boolean"
+    }
+  },
+  "title": "ModuleFederationPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "exposes": {
+      "$ref": "#/definitions/Exposes"
+    },
+    "filename": {
+      "description": "The filename of the container as relative path inside the `output.path` directory.",
+      "type": "string",
+      "absolutePath": false
+    },
+    "library": {
+      "$ref": "#/definitions/LibraryOptions"
+    },
+    "name": {
+      "description": "The name of the container.",
+      "type": "string"
+    },
+    "remoteType": {
+      "description": "The external type of the remote containers.",
+      "oneOf": [
+        {
+          "$ref": "#/definitions/ExternalsType"
+        }
+      ]
+    },
+    "remotes": {
+      "$ref": "#/definitions/Remotes"
+    },
+    "runtime": {
+      "$ref": "#/definitions/EntryRuntime"
+    },
+    "shareScope": {
+      "description": "Share scope name used for all shared modules (defaults to 'default').",
+      "type": "string",
+      "minLength": 1
+    },
+    "shared": {
+      "$ref": "#/definitions/Shared"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.check.d.ts
new file mode 100644
index 0000000..6b6174c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: any) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.check.js
new file mode 100644
index 0000000..c41b7d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:a,parentDataProperty:o,rootData:n=t}={}){if(!t||"object"!=typeof t||Array.isArray(t))return r.errors=[{params:{type:"object"}}],!1;for(const e in t)return r.errors=[{params:{additionalProperty:e}}],!1;return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.json
new file mode 100644
index 0000000..dc79f62
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssGeneratorOptions.json
@@ -0,0 +1,3 @@
+{
+  "$ref": "../../WebpackOptions.json#/definitions/CssParserOptions"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.check.d.ts
new file mode 100644
index 0000000..6b6174c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: any) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.check.js
new file mode 100644
index 0000000..c41b7d0
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:a,parentDataProperty:o,rootData:n=t}={}){if(!t||"object"!=typeof t||Array.isArray(t))return r.errors=[{params:{type:"object"}}],!1;for(const e in t)return r.errors=[{params:{additionalProperty:e}}],!1;return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.json
new file mode 100644
index 0000000..193ec90
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/css/CssParserOptions.json
@@ -0,0 +1,3 @@
+{
+  "$ref": "../../WebpackOptions.json#/definitions/CssGeneratorOptions"
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.check.d.ts
new file mode 100644
index 0000000..37407dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/debug/ProfilingPlugin").ProfilingPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.check.js
new file mode 100644
index 0000000..6b87610
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const r=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;function t(e,{instancePath:a="",parentData:o,parentDataProperty:n,rootData:s=e}={}){if(!e||"object"!=typeof e||Array.isArray(e))return t.errors=[{params:{type:"object"}}],!1;{const a=0;for(const r in e)if("outputPath"!==r)return t.errors=[{params:{additionalProperty:r}}],!1;if(0===a&&void 0!==e.outputPath){let a=e.outputPath;if("string"!=typeof a)return t.errors=[{params:{type:"string"}}],!1;if(a.includes("!")||!0!==r.test(a))return t.errors=[{params:{}}],!1}}return t.errors=null,!0}module.exports=t,module.exports.default=t;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.json
new file mode 100644
index 0000000..4de19e5
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/debug/ProfilingPlugin.json
@@ -0,0 +1,12 @@
+{
+  "title": "ProfilingPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "outputPath": {
+      "description": "Path to the output file e.g. `path.resolve(__dirname, 'profiling/events.json')`. Defaults to `events.json`.",
+      "type": "string",
+      "absolutePath": true
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.check.d.ts
new file mode 100644
index 0000000..3332a7b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/ids/OccurrenceChunkIdsPlugin").OccurrenceChunkIdsPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.check.js
new file mode 100644
index 0000000..4507810
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:o,parentDataProperty:a,rootData:i=t}={}){if(!t||"object"!=typeof t||Array.isArray(t))return r.errors=[{params:{type:"object"}}],!1;{const e=0;for(const e in t)if("prioritiseInitial"!==e)return r.errors=[{params:{additionalProperty:e}}],!1;if(0===e&&void 0!==t.prioritiseInitial&&"boolean"!=typeof t.prioritiseInitial)return r.errors=[{params:{type:"boolean"}}],!1}return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.json
new file mode 100644
index 0000000..d1bb734
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceChunkIdsPlugin.json
@@ -0,0 +1,11 @@
+{
+  "title": "OccurrenceChunkIdsPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "prioritiseInitial": {
+      "description": "Prioritise initial size over total size.",
+      "type": "boolean"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.check.d.ts
new file mode 100644
index 0000000..8b5a22f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/ids/OccurrenceModuleIdsPlugin").OccurrenceModuleIdsPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.check.js
new file mode 100644
index 0000000..4507810
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:o,parentDataProperty:a,rootData:i=t}={}){if(!t||"object"!=typeof t||Array.isArray(t))return r.errors=[{params:{type:"object"}}],!1;{const e=0;for(const e in t)if("prioritiseInitial"!==e)return r.errors=[{params:{additionalProperty:e}}],!1;if(0===e&&void 0!==t.prioritiseInitial&&"boolean"!=typeof t.prioritiseInitial)return r.errors=[{params:{type:"boolean"}}],!1}return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.json
new file mode 100644
index 0000000..7feec0c
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/ids/OccurrenceModuleIdsPlugin.json
@@ -0,0 +1,11 @@
+{
+  "title": "OccurrenceModuleIdsPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "prioritiseInitial": {
+      "description": "Prioritise initial size over total size.",
+      "type": "boolean"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.check.d.ts
new file mode 100644
index 0000000..30a281d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/optimize/AggressiveSplittingPlugin").AggressiveSplittingPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.check.js
new file mode 100644
index 0000000..284fe8d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(e,{instancePath:t="",parentData:n,parentDataProperty:i,rootData:o=e}={}){if(!e||"object"!=typeof e||Array.isArray(e))return r.errors=[{params:{type:"object"}}],!1;{const t=0;for(const t in e)if("chunkOverhead"!==t&&"entryChunkMultiplicator"!==t&&"maxSize"!==t&&"minSize"!==t)return r.errors=[{params:{additionalProperty:t}}],!1;if(0===t){if(void 0!==e.chunkOverhead){const t=0;if("number"!=typeof e.chunkOverhead)return r.errors=[{params:{type:"number"}}],!1;var a=0===t}else a=!0;if(a){if(void 0!==e.entryChunkMultiplicator){const t=0;if("number"!=typeof e.entryChunkMultiplicator)return r.errors=[{params:{type:"number"}}],!1;a=0===t}else a=!0;if(a){if(void 0!==e.maxSize){const t=0;if("number"!=typeof e.maxSize)return r.errors=[{params:{type:"number"}}],!1;a=0===t}else a=!0;if(a)if(void 0!==e.minSize){const t=0;if("number"!=typeof e.minSize)return r.errors=[{params:{type:"number"}}],!1;a=0===t}else a=!0}}}}return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.json
new file mode 100644
index 0000000..8abcdd8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/AggressiveSplittingPlugin.json
@@ -0,0 +1,23 @@
+{
+  "title": "AggressiveSplittingPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "chunkOverhead": {
+      "description": "Extra cost for each chunk (Default: 9.8kiB).",
+      "type": "number"
+    },
+    "entryChunkMultiplicator": {
+      "description": "Extra cost multiplicator for entry chunks (Default: 10).",
+      "type": "number"
+    },
+    "maxSize": {
+      "description": "Byte, max size of per file (Default: 50kiB).",
+      "type": "number"
+    },
+    "minSize": {
+      "description": "Byte, split point. (Default: 30kiB).",
+      "type": "number"
+    }
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.check.d.ts
new file mode 100644
index 0000000..32c0525
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/optimize/LimitChunkCountPlugin").LimitChunkCountPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.check.js
new file mode 100644
index 0000000..69d9a81
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(e,{instancePath:t="",parentData:n,parentDataProperty:a,rootData:o=e}={}){if(!e||"object"!=typeof e||Array.isArray(e))return r.errors=[{params:{type:"object"}}],!1;{let t;if(void 0===e.maxChunks&&(t="maxChunks"))return r.errors=[{params:{missingProperty:t}}],!1;{const t=0;for(const t in e)if("chunkOverhead"!==t&&"entryChunkMultiplicator"!==t&&"maxChunks"!==t)return r.errors=[{params:{additionalProperty:t}}],!1;if(0===t){if(void 0!==e.chunkOverhead){const t=0;if("number"!=typeof e.chunkOverhead)return r.errors=[{params:{type:"number"}}],!1;var s=0===t}else s=!0;if(s){if(void 0!==e.entryChunkMultiplicator){const t=0;if("number"!=typeof e.entryChunkMultiplicator)return r.errors=[{params:{type:"number"}}],!1;s=0===t}else s=!0;if(s)if(void 0!==e.maxChunks){let t=e.maxChunks;const n=0;if(0===n){if("number"!=typeof t)return r.errors=[{params:{type:"number"}}],!1;if(t<1||isNaN(t))return r.errors=[{params:{comparison:">=",limit:1}}],!1}s=0===n}else s=!0}}}}return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.json
new file mode 100644
index 0000000..3bbd391
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/LimitChunkCountPlugin.json
@@ -0,0 +1,21 @@
+{
+  "title": "LimitChunkCountPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "chunkOverhead": {
+      "description": "Constant overhead for a chunk.",
+      "type": "number"
+    },
+    "entryChunkMultiplicator": {
+      "description": "Multiplicator for initial chunks.",
+      "type": "number"
+    },
+    "maxChunks": {
+      "description": "Limit the maximum number of chunks using a value greater greater than or equal to 1.",
+      "type": "number",
+      "minimum": 1
+    }
+  },
+  "required": ["maxChunks"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.check.d.ts
new file mode 100644
index 0000000..26de679
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/optimize/MinChunkSizePlugin").MinChunkSizePluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.check.js
new file mode 100644
index 0000000..78717b1
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(e,{instancePath:t="",parentData:n,parentDataProperty:i,rootData:o=e}={}){if(!e||"object"!=typeof e||Array.isArray(e))return r.errors=[{params:{type:"object"}}],!1;{let t;if(void 0===e.minChunkSize&&(t="minChunkSize"))return r.errors=[{params:{missingProperty:t}}],!1;{const t=0;for(const t in e)if("chunkOverhead"!==t&&"entryChunkMultiplicator"!==t&&"minChunkSize"!==t)return r.errors=[{params:{additionalProperty:t}}],!1;if(0===t){if(void 0!==e.chunkOverhead){const t=0;if("number"!=typeof e.chunkOverhead)return r.errors=[{params:{type:"number"}}],!1;var a=0===t}else a=!0;if(a){if(void 0!==e.entryChunkMultiplicator){const t=0;if("number"!=typeof e.entryChunkMultiplicator)return r.errors=[{params:{type:"number"}}],!1;a=0===t}else a=!0;if(a)if(void 0!==e.minChunkSize){const t=0;if("number"!=typeof e.minChunkSize)return r.errors=[{params:{type:"number"}}],!1;a=0===t}else a=!0}}}}return r.errors=null,!0}module.exports=r,module.exports.default=r;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.json
new file mode 100644
index 0000000..ba02156
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/optimize/MinChunkSizePlugin.json
@@ -0,0 +1,20 @@
+{
+  "title": "MinChunkSizePluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "chunkOverhead": {
+      "description": "Constant overhead for a chunk.",
+      "type": "number"
+    },
+    "entryChunkMultiplicator": {
+      "description": "Multiplicator for initial chunks.",
+      "type": "number"
+    },
+    "minChunkSize": {
+      "description": "Minimum number of characters.",
+      "type": "number"
+    }
+  },
+  "required": ["minChunkSize"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.check.d.ts
new file mode 100644
index 0000000..a6fd39a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/schemes/HttpUriPlugin").HttpUriPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.check.js
new file mode 100644
index 0000000..d6ca85e
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+const r=/^(?:[A-Za-z]:[\\/]|\\\\|\/)/;module.exports=n,module.exports.default=n;const t=new RegExp("^https?://","u");function e(n,{instancePath:o="",parentData:s,parentDataProperty:a,rootData:l=n}={}){let i=null,p=0;if(0===p){if(!n||"object"!=typeof n||Array.isArray(n))return e.errors=[{params:{type:"object"}}],!1;{let o;if(void 0===n.allowedUris&&(o="allowedUris"))return e.errors=[{params:{missingProperty:o}}],!1;{const o=p;for(const r in n)if("allowedUris"!==r&&"cacheLocation"!==r&&"frozen"!==r&&"lockfileLocation"!==r&&"proxy"!==r&&"upgrade"!==r)return e.errors=[{params:{additionalProperty:r}}],!1;if(o===p){if(void 0!==n.allowedUris){let r=n.allowedUris;const o=p;if(p==p){if(!Array.isArray(r))return e.errors=[{params:{type:"array"}}],!1;{const n=r.length;for(let o=0;o<n;o++){let n=r[o];const s=p,a=p;let l=!1;const c=p;if(!(n instanceof RegExp)){const r={params:{}};null===i?i=[r]:i.push(r),p++}var f=c===p;if(l=l||f,!l){const r=p;if(p===r)if("string"==typeof n){if(!t.test(n)){const r={params:{pattern:"^https?://"}};null===i?i=[r]:i.push(r),p++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),p++}if(f=r===p,l=l||f,!l){const r=p;if(!(n instanceof Function)){const r={params:{}};null===i?i=[r]:i.push(r),p++}f=r===p,l=l||f}}if(!l){const r={params:{}};return null===i?i=[r]:i.push(r),p++,e.errors=i,!1}if(p=a,null!==i&&(a?i.length=a:i=null),s!==p)break}}}var c=o===p}else c=!0;if(c){if(void 0!==n.cacheLocation){let t=n.cacheLocation;const o=p,s=p;let a=!1;const l=p;if(!1!==t){const r={params:{}};null===i?i=[r]:i.push(r),p++}var u=l===p;if(a=a||u,!a){const e=p;if(p===e)if("string"==typeof t){if(t.includes("!")||!0!==r.test(t)){const r={params:{}};null===i?i=[r]:i.push(r),p++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),p++}u=e===p,a=a||u}if(!a){const r={params:{}};return null===i?i=[r]:i.push(r),p++,e.errors=i,!1}p=s,null!==i&&(s?i.length=s:i=null),c=o===p}else c=!0;if(c){if(void 0!==n.frozen){const r=p;if("boolean"!=typeof n.frozen)return e.errors=[{params:{type:"boolean"}}],!1;c=r===p}else c=!0;if(c){if(void 0!==n.lockfileLocation){let t=n.lockfileLocation;const o=p;if(p===o){if("string"!=typeof t)return e.errors=[{params:{type:"string"}}],!1;if(t.includes("!")||!0!==r.test(t))return e.errors=[{params:{}}],!1}c=o===p}else c=!0;if(c){if(void 0!==n.proxy){const r=p;if("string"!=typeof n.proxy)return e.errors=[{params:{type:"string"}}],!1;c=r===p}else c=!0;if(c)if(void 0!==n.upgrade){const r=p;if("boolean"!=typeof n.upgrade)return e.errors=[{params:{type:"boolean"}}],!1;c=r===p}else c=!0}}}}}}}}return e.errors=i,0===p}function n(r,{instancePath:t="",parentData:o,parentDataProperty:s,rootData:a=r}={}){let l=null,i=0;const p=i;let f=!1,c=null;const u=i;if(e(r,{instancePath:t,parentData:o,parentDataProperty:s,rootData:a})||(l=null===l?e.errors:l.concat(e.errors),i=l.length),u===i&&(f=!0,c=0),!f){const r={params:{passingSchemas:c}};return null===l?l=[r]:l.push(r),i++,n.errors=l,!1}return i=p,null!==l&&(p?l.length=p:l=null),n.errors=l,0===i}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.json
new file mode 100644
index 0000000..d461fca
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/schemes/HttpUriPlugin.json
@@ -0,0 +1,74 @@
+{
+  "definitions": {
+    "HttpUriOptions": {
+      "description": "Options for building http resources.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "allowedUris": {
+          "$ref": "#/definitions/HttpUriOptionsAllowedUris"
+        },
+        "cacheLocation": {
+          "description": "Location where resource content is stored for lockfile entries. It's also possible to disable storing by passing false.",
+          "anyOf": [
+            {
+              "enum": [false]
+            },
+            {
+              "type": "string",
+              "absolutePath": true
+            }
+          ]
+        },
+        "frozen": {
+          "description": "When set, anything that would lead to a modification of the lockfile or any resource content, will result in an error.",
+          "type": "boolean"
+        },
+        "lockfileLocation": {
+          "description": "Location of the lockfile.",
+          "type": "string",
+          "absolutePath": true
+        },
+        "proxy": {
+          "description": "Proxy configuration, which can be used to specify a proxy server to use for HTTP requests.",
+          "type": "string"
+        },
+        "upgrade": {
+          "description": "When set, resources of existing lockfile entries will be fetched and entries will be upgraded when resource content has changed.",
+          "type": "boolean"
+        }
+      },
+      "required": ["allowedUris"]
+    },
+    "HttpUriOptionsAllowedUris": {
+      "description": "List of allowed URIs (resp. the beginning of them).",
+      "type": "array",
+      "items": {
+        "description": "List of allowed URIs (resp. the beginning of them).",
+        "anyOf": [
+          {
+            "description": "Allowed URI pattern.",
+            "instanceof": "RegExp",
+            "tsType": "RegExp"
+          },
+          {
+            "description": "Allowed URI (resp. the beginning of it).",
+            "type": "string",
+            "pattern": "^https?://"
+          },
+          {
+            "description": "Allowed URI filter function.",
+            "instanceof": "Function",
+            "tsType": "((uri: string) => boolean)"
+          }
+        ]
+      }
+    }
+  },
+  "title": "HttpUriPluginOptions",
+  "oneOf": [
+    {
+      "$ref": "#/definitions/HttpUriOptions"
+    }
+  ]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.check.d.ts
new file mode 100644
index 0000000..5d05e0a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/sharing/ConsumeSharedPlugin").ConsumeSharedPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.check.js
new file mode 100644
index 0000000..1f206b6
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(e,{instancePath:t="",parentData:n,parentDataProperty:s,rootData:a=e}={}){let o=null,i=0;if(0===i){if(!e||"object"!=typeof e||Array.isArray(e))return r.errors=[{params:{type:"object"}}],!1;{const t=i;for(const t in e)if("eager"!==t&&"import"!==t&&"packageName"!==t&&"requiredVersion"!==t&&"shareKey"!==t&&"shareScope"!==t&&"singleton"!==t&&"strictVersion"!==t)return r.errors=[{params:{additionalProperty:t}}],!1;if(t===i){if(void 0!==e.eager){const t=i;if("boolean"!=typeof e.eager)return r.errors=[{params:{type:"boolean"}}],!1;var l=t===i}else l=!0;if(l){if(void 0!==e.import){let t=e.import;const n=i,s=i;let a=!1;const f=i;if(!1!==t){const r={params:{}};null===o?o=[r]:o.push(r),i++}var p=f===i;if(a=a||p,!a){const r=i;if(i==i)if("string"==typeof t){if(t.length<1){const r={params:{}};null===o?o=[r]:o.push(r),i++}}else{const r={params:{type:"string"}};null===o?o=[r]:o.push(r),i++}p=r===i,a=a||p}if(!a){const e={params:{}};return null===o?o=[e]:o.push(e),i++,r.errors=o,!1}i=s,null!==o&&(s?o.length=s:o=null),l=n===i}else l=!0;if(l){if(void 0!==e.packageName){let t=e.packageName;const n=i;if(i===n){if("string"!=typeof t)return r.errors=[{params:{type:"string"}}],!1;if(t.length<1)return r.errors=[{params:{}}],!1}l=n===i}else l=!0;if(l){if(void 0!==e.requiredVersion){let t=e.requiredVersion;const n=i,s=i;let a=!1;const p=i;if(!1!==t){const r={params:{}};null===o?o=[r]:o.push(r),i++}var f=p===i;if(a=a||f,!a){const r=i;if("string"!=typeof t){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),i++}f=r===i,a=a||f}if(!a){const e={params:{}};return null===o?o=[e]:o.push(e),i++,r.errors=o,!1}i=s,null!==o&&(s?o.length=s:o=null),l=n===i}else l=!0;if(l){if(void 0!==e.shareKey){let t=e.shareKey;const n=i;if(i===n){if("string"!=typeof t)return r.errors=[{params:{type:"string"}}],!1;if(t.length<1)return r.errors=[{params:{}}],!1}l=n===i}else l=!0;if(l){if(void 0!==e.shareScope){let t=e.shareScope;const n=i;if(i===n){if("string"!=typeof t)return r.errors=[{params:{type:"string"}}],!1;if(t.length<1)return r.errors=[{params:{}}],!1}l=n===i}else l=!0;if(l){if(void 0!==e.singleton){const t=i;if("boolean"!=typeof e.singleton)return r.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0;if(l)if(void 0!==e.strictVersion){const t=i;if("boolean"!=typeof e.strictVersion)return r.errors=[{params:{type:"boolean"}}],!1;l=t===i}else l=!0}}}}}}}}}return r.errors=o,0===i}function e(t,{instancePath:n="",parentData:s,parentDataProperty:a,rootData:o=t}={}){let i=null,l=0;if(0===l){if(!t||"object"!=typeof t||Array.isArray(t))return e.errors=[{params:{type:"object"}}],!1;for(const s in t){let a=t[s];const f=l,c=l;let u=!1;const y=l;r(a,{instancePath:n+"/"+s.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:t,parentDataProperty:s,rootData:o})||(i=null===i?r.errors:i.concat(r.errors),l=i.length);var p=y===l;if(u=u||p,!u){const r=l;if(l==l)if("string"==typeof a){if(a.length<1){const r={params:{}};null===i?i=[r]:i.push(r),l++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),l++}p=r===l,u=u||p}if(!u){const r={params:{}};return null===i?i=[r]:i.push(r),l++,e.errors=i,!1}if(l=c,null!==i&&(c?i.length=c:i=null),f!==l)break}}return e.errors=i,0===l}function t(r,{instancePath:n="",parentData:s,parentDataProperty:a,rootData:o=r}={}){let i=null,l=0;const p=l;let f=!1;const c=l;if(l===c)if(Array.isArray(r)){const t=r.length;for(let s=0;s<t;s++){let t=r[s];const a=l,p=l;let f=!1;const c=l;if(l==l)if("string"==typeof t){if(t.length<1){const r={params:{}};null===i?i=[r]:i.push(r),l++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),l++}var u=c===l;if(f=f||u,!f){const a=l;e(t,{instancePath:n+"/"+s,parentData:r,parentDataProperty:s,rootData:o})||(i=null===i?e.errors:i.concat(e.errors),l=i.length),u=a===l,f=f||u}if(f)l=p,null!==i&&(p?i.length=p:i=null);else{const r={params:{}};null===i?i=[r]:i.push(r),l++}if(a!==l)break}}else{const r={params:{type:"array"}};null===i?i=[r]:i.push(r),l++}var y=c===l;if(f=f||y,!f){const t=l;e(r,{instancePath:n,parentData:s,parentDataProperty:a,rootData:o})||(i=null===i?e.errors:i.concat(e.errors),l=i.length),y=t===l,f=f||y}if(!f){const r={params:{}};return null===i?i=[r]:i.push(r),l++,t.errors=i,!1}return l=p,null!==i&&(p?i.length=p:i=null),t.errors=i,0===l}function n(r,{instancePath:e="",parentData:s,parentDataProperty:a,rootData:o=r}={}){let i=null,l=0;if(0===l){if(!r||"object"!=typeof r||Array.isArray(r))return n.errors=[{params:{type:"object"}}],!1;{let s;if(void 0===r.consumes&&(s="consumes"))return n.errors=[{params:{missingProperty:s}}],!1;{const s=l;for(const e in r)if("consumes"!==e&&"shareScope"!==e)return n.errors=[{params:{additionalProperty:e}}],!1;if(s===l){if(void 0!==r.consumes){const n=l;t(r.consumes,{instancePath:e+"/consumes",parentData:r,parentDataProperty:"consumes",rootData:o})||(i=null===i?t.errors:i.concat(t.errors),l=i.length);var p=n===l}else p=!0;if(p)if(void 0!==r.shareScope){let e=r.shareScope;const t=l;if(l===t){if("string"!=typeof e)return n.errors=[{params:{type:"string"}}],!1;if(e.length<1)return n.errors=[{params:{}}],!1}p=t===l}else p=!0}}}}return n.errors=i,0===l}module.exports=n,module.exports.default=n;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.json
new file mode 100644
index 0000000..8365d5f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ConsumeSharedPlugin.json
@@ -0,0 +1,120 @@
+{
+  "definitions": {
+    "Consumes": {
+      "description": "Modules that should be consumed from share scope. When provided, property names are used to match requested modules in this compilation.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be consumed from share scope.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/ConsumesItem"
+              },
+              {
+                "$ref": "#/definitions/ConsumesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/ConsumesObject"
+        }
+      ]
+    },
+    "ConsumesConfig": {
+      "description": "Advanced configuration for modules that should be consumed from share scope.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "eager": {
+          "description": "Include the fallback module directly instead behind an async request. This allows to use fallback module in initial load too. All possible shared modules need to be eager too.",
+          "type": "boolean"
+        },
+        "import": {
+          "description": "Fallback module if no shared module is found in share scope. Defaults to the property name.",
+          "anyOf": [
+            {
+              "description": "No fallback module.",
+              "enum": [false]
+            },
+            {
+              "$ref": "#/definitions/ConsumesItem"
+            }
+          ]
+        },
+        "packageName": {
+          "description": "Package name to determine required version from description file. This is only needed when package name can't be automatically determined from request.",
+          "type": "string",
+          "minLength": 1
+        },
+        "requiredVersion": {
+          "description": "Version requirement from module in share scope.",
+          "anyOf": [
+            {
+              "description": "No version requirement check.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Can be prefixed with '^' or '~' for minimum matches. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        },
+        "shareKey": {
+          "description": "Module is looked up under this key from the share scope.",
+          "type": "string",
+          "minLength": 1
+        },
+        "shareScope": {
+          "description": "Share scope name.",
+          "type": "string",
+          "minLength": 1
+        },
+        "singleton": {
+          "description": "Allow only a single version of the shared module in share scope (disabled by default).",
+          "type": "boolean"
+        },
+        "strictVersion": {
+          "description": "Do not accept shared module if version is not valid (defaults to yes, if local fallback module is available and shared module is not a singleton, otherwise no, has no effect if there is no required version specified).",
+          "type": "boolean"
+        }
+      }
+    },
+    "ConsumesItem": {
+      "description": "A module that should be consumed from share scope.",
+      "type": "string",
+      "minLength": 1
+    },
+    "ConsumesObject": {
+      "description": "Modules that should be consumed from share scope. Property names are used to match requested modules in this compilation. Relative requests are resolved, module requests are matched unresolved, absolute paths will match resolved requests. A trailing slash will match all requests with this prefix. In this case shareKey must also have a trailing slash.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be consumed from share scope.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/ConsumesConfig"
+          },
+          {
+            "$ref": "#/definitions/ConsumesItem"
+          }
+        ]
+      }
+    }
+  },
+  "title": "ConsumeSharedPluginOptions",
+  "description": "Options for consuming shared modules.",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "consumes": {
+      "$ref": "#/definitions/Consumes"
+    },
+    "shareScope": {
+      "description": "Share scope name used for all consumed modules (defaults to 'default').",
+      "type": "string",
+      "minLength": 1
+    }
+  },
+  "required": ["consumes"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.check.d.ts
new file mode 100644
index 0000000..eb002e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/sharing/ProvideSharedPlugin").ProvideSharedPluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.check.js
new file mode 100644
index 0000000..920f0e2
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";function r(t,{instancePath:e="",parentData:s,parentDataProperty:n,rootData:a=t}={}){let o=null,l=0;if(0===l){if(!t||"object"!=typeof t||Array.isArray(t))return r.errors=[{params:{type:"object"}}],!1;for(const e in t){let s=t[e];const n=l,a=l;let f=!1;const u=l;if(l==l)if(s&&"object"==typeof s&&!Array.isArray(s)){const r=l;for(const r in s)if("eager"!==r&&"shareKey"!==r&&"shareScope"!==r&&"version"!==r){const t={params:{additionalProperty:r}};null===o?o=[t]:o.push(t),l++;break}if(r===l){if(void 0!==s.eager){const r=l;if("boolean"!=typeof s.eager){const r={params:{type:"boolean"}};null===o?o=[r]:o.push(r),l++}var i=r===l}else i=!0;if(i){if(void 0!==s.shareKey){let r=s.shareKey;const t=l;if(l===t)if("string"==typeof r){if(r.length<1){const r={params:{}};null===o?o=[r]:o.push(r),l++}}else{const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}i=t===l}else i=!0;if(i){if(void 0!==s.shareScope){let r=s.shareScope;const t=l;if(l===t)if("string"==typeof r){if(r.length<1){const r={params:{}};null===o?o=[r]:o.push(r),l++}}else{const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}i=t===l}else i=!0;if(i)if(void 0!==s.version){let r=s.version;const t=l,e=l;let n=!1;const a=l;if(!1!==r){const r={params:{}};null===o?o=[r]:o.push(r),l++}var p=a===l;if(n=n||p,!n){const t=l;if("string"!=typeof r){const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}p=t===l,n=n||p}if(n)l=e,null!==o&&(e?o.length=e:o=null);else{const r={params:{}};null===o?o=[r]:o.push(r),l++}i=t===l}else i=!0}}}}else{const r={params:{type:"object"}};null===o?o=[r]:o.push(r),l++}var c=u===l;if(f=f||c,!f){const r=l;if(l==l)if("string"==typeof s){if(s.length<1){const r={params:{}};null===o?o=[r]:o.push(r),l++}}else{const r={params:{type:"string"}};null===o?o=[r]:o.push(r),l++}c=r===l,f=f||c}if(!f){const t={params:{}};return null===o?o=[t]:o.push(t),l++,r.errors=o,!1}if(l=a,null!==o&&(a?o.length=a:o=null),n!==l)break}}return r.errors=o,0===l}function t(e,{instancePath:s="",parentData:n,parentDataProperty:a,rootData:o=e}={}){let l=null,i=0;const p=i;let c=!1;const f=i;if(i===f)if(Array.isArray(e)){const t=e.length;for(let n=0;n<t;n++){let t=e[n];const a=i,p=i;let c=!1;const f=i;if(i==i)if("string"==typeof t){if(t.length<1){const r={params:{}};null===l?l=[r]:l.push(r),i++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),i++}var u=f===i;if(c=c||u,!c){const a=i;r(t,{instancePath:s+"/"+n,parentData:e,parentDataProperty:n,rootData:o})||(l=null===l?r.errors:l.concat(r.errors),i=l.length),u=a===i,c=c||u}if(c)i=p,null!==l&&(p?l.length=p:l=null);else{const r={params:{}};null===l?l=[r]:l.push(r),i++}if(a!==i)break}}else{const r={params:{type:"array"}};null===l?l=[r]:l.push(r),i++}var h=f===i;if(c=c||h,!c){const t=i;r(e,{instancePath:s,parentData:n,parentDataProperty:a,rootData:o})||(l=null===l?r.errors:l.concat(r.errors),i=l.length),h=t===i,c=c||h}if(!c){const r={params:{}};return null===l?l=[r]:l.push(r),i++,t.errors=l,!1}return i=p,null!==l&&(p?l.length=p:l=null),t.errors=l,0===i}function e(r,{instancePath:s="",parentData:n,parentDataProperty:a,rootData:o=r}={}){let l=null,i=0;if(0===i){if(!r||"object"!=typeof r||Array.isArray(r))return e.errors=[{params:{type:"object"}}],!1;{let n;if(void 0===r.provides&&(n="provides"))return e.errors=[{params:{missingProperty:n}}],!1;{const n=i;for(const t in r)if("provides"!==t&&"shareScope"!==t)return e.errors=[{params:{additionalProperty:t}}],!1;if(n===i){if(void 0!==r.provides){const e=i;t(r.provides,{instancePath:s+"/provides",parentData:r,parentDataProperty:"provides",rootData:o})||(l=null===l?t.errors:l.concat(t.errors),i=l.length);var p=e===i}else p=!0;if(p)if(void 0!==r.shareScope){let t=r.shareScope;const s=i;if(i===s){if("string"!=typeof t)return e.errors=[{params:{type:"string"}}],!1;if(t.length<1)return e.errors=[{params:{}}],!1}p=s===i}else p=!0}}}}return e.errors=l,0===i}module.exports=e,module.exports.default=e;
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.json
new file mode 100644
index 0000000..3dead87
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/ProvideSharedPlugin.json
@@ -0,0 +1,94 @@
+{
+  "definitions": {
+    "Provides": {
+      "description": "Modules that should be provided as shared modules to the share scope. When provided, property name is used to match modules, otherwise this is automatically inferred from share key.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be provided as shared modules to the share scope.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/ProvidesItem"
+              },
+              {
+                "$ref": "#/definitions/ProvidesObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/ProvidesObject"
+        }
+      ]
+    },
+    "ProvidesConfig": {
+      "description": "Advanced configuration for modules that should be provided as shared modules to the share scope.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "eager": {
+          "description": "Include the provided module directly instead behind an async request. This allows to use this shared module in initial load too. All possible shared modules need to be eager too.",
+          "type": "boolean"
+        },
+        "shareKey": {
+          "description": "Key in the share scope under which the shared modules should be stored.",
+          "type": "string",
+          "minLength": 1
+        },
+        "shareScope": {
+          "description": "Share scope name.",
+          "type": "string",
+          "minLength": 1
+        },
+        "version": {
+          "description": "Version of the provided module. Will replace lower matching versions, but not higher.",
+          "anyOf": [
+            {
+              "description": "Don't provide a version.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        }
+      }
+    },
+    "ProvidesItem": {
+      "description": "Request to a module that should be provided as shared module to the share scope (will be resolved when relative).",
+      "type": "string",
+      "minLength": 1
+    },
+    "ProvidesObject": {
+      "description": "Modules that should be provided as shared modules to the share scope. Property names are used as share keys.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be provided as shared modules to the share scope.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/ProvidesConfig"
+          },
+          {
+            "$ref": "#/definitions/ProvidesItem"
+          }
+        ]
+      }
+    }
+  },
+  "title": "ProvideSharedPluginOptions",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "provides": {
+      "$ref": "#/definitions/Provides"
+    },
+    "shareScope": {
+      "description": "Share scope name used for all provided modules (defaults to 'default').",
+      "type": "string",
+      "minLength": 1
+    }
+  },
+  "required": ["provides"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.check.d.ts b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.check.d.ts
new file mode 100644
index 0000000..4daf494
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.check.d.ts
@@ -0,0 +1,7 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+declare const check: (options: import("../../../declarations/plugins/sharing/SharePlugin").SharePluginOptions) => boolean;
+export = check;
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.check.js b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.check.js
new file mode 100644
index 0000000..5030df8
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.check.js
@@ -0,0 +1,6 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+"use strict";module.exports=a,module.exports.default=a;const r={eager:{type:"boolean"},import:{anyOf:[{enum:[!1]},{$ref:"#/definitions/SharedItem"}]},packageName:{type:"string",minLength:1},requiredVersion:{anyOf:[{enum:[!1]},{type:"string"}]},shareKey:{type:"string",minLength:1},shareScope:{type:"string",minLength:1},singleton:{type:"boolean"},strictVersion:{type:"boolean"},version:{anyOf:[{enum:[!1]},{type:"string"}]}},e=Object.prototype.hasOwnProperty;function t(n,{instancePath:s="",parentData:a,parentDataProperty:o,rootData:i=n}={}){let l=null,p=0;if(0===p){if(!n||"object"!=typeof n||Array.isArray(n))return t.errors=[{params:{type:"object"}}],!1;{const s=p;for(const s in n)if(!e.call(r,s))return t.errors=[{params:{additionalProperty:s}}],!1;if(s===p){if(void 0!==n.eager){const r=p;if("boolean"!=typeof n.eager)return t.errors=[{params:{type:"boolean"}}],!1;var f=r===p}else f=!0;if(f){if(void 0!==n.import){let r=n.import;const e=p,s=p;let a=!1;const o=p;if(!1!==r){const r={params:{}};null===l?l=[r]:l.push(r),p++}var u=o===p;if(a=a||u,!a){const e=p;if(p==p)if("string"==typeof r){if(r.length<1){const r={params:{}};null===l?l=[r]:l.push(r),p++}}else{const r={params:{type:"string"}};null===l?l=[r]:l.push(r),p++}u=e===p,a=a||u}if(!a){const r={params:{}};return null===l?l=[r]:l.push(r),p++,t.errors=l,!1}p=s,null!==l&&(s?l.length=s:l=null),f=e===p}else f=!0;if(f){if(void 0!==n.packageName){let r=n.packageName;const e=p;if(p===e){if("string"!=typeof r)return t.errors=[{params:{type:"string"}}],!1;if(r.length<1)return t.errors=[{params:{}}],!1}f=e===p}else f=!0;if(f){if(void 0!==n.requiredVersion){let r=n.requiredVersion;const e=p,s=p;let a=!1;const o=p;if(!1!==r){const r={params:{}};null===l?l=[r]:l.push(r),p++}var c=o===p;if(a=a||c,!a){const e=p;if("string"!=typeof r){const r={params:{type:"string"}};null===l?l=[r]:l.push(r),p++}c=e===p,a=a||c}if(!a){const r={params:{}};return null===l?l=[r]:l.push(r),p++,t.errors=l,!1}p=s,null!==l&&(s?l.length=s:l=null),f=e===p}else f=!0;if(f){if(void 0!==n.shareKey){let r=n.shareKey;const e=p;if(p===e){if("string"!=typeof r)return t.errors=[{params:{type:"string"}}],!1;if(r.length<1)return t.errors=[{params:{}}],!1}f=e===p}else f=!0;if(f){if(void 0!==n.shareScope){let r=n.shareScope;const e=p;if(p===e){if("string"!=typeof r)return t.errors=[{params:{type:"string"}}],!1;if(r.length<1)return t.errors=[{params:{}}],!1}f=e===p}else f=!0;if(f){if(void 0!==n.singleton){const r=p;if("boolean"!=typeof n.singleton)return t.errors=[{params:{type:"boolean"}}],!1;f=r===p}else f=!0;if(f){if(void 0!==n.strictVersion){const r=p;if("boolean"!=typeof n.strictVersion)return t.errors=[{params:{type:"boolean"}}],!1;f=r===p}else f=!0;if(f)if(void 0!==n.version){let r=n.version;const e=p,s=p;let a=!1;const o=p;if(!1!==r){const r={params:{}};null===l?l=[r]:l.push(r),p++}var y=o===p;if(a=a||y,!a){const e=p;if("string"!=typeof r){const r={params:{type:"string"}};null===l?l=[r]:l.push(r),p++}y=e===p,a=a||y}if(!a){const r={params:{}};return null===l?l=[r]:l.push(r),p++,t.errors=l,!1}p=s,null!==l&&(s?l.length=s:l=null),f=e===p}else f=!0}}}}}}}}}}return t.errors=l,0===p}function n(r,{instancePath:e="",parentData:s,parentDataProperty:a,rootData:o=r}={}){let i=null,l=0;if(0===l){if(!r||"object"!=typeof r||Array.isArray(r))return n.errors=[{params:{type:"object"}}],!1;for(const s in r){let a=r[s];const f=l,u=l;let c=!1;const y=l;t(a,{instancePath:e+"/"+s.replace(/~/g,"~0").replace(/\//g,"~1"),parentData:r,parentDataProperty:s,rootData:o})||(i=null===i?t.errors:i.concat(t.errors),l=i.length);var p=y===l;if(c=c||p,!c){const r=l;if(l==l)if("string"==typeof a){if(a.length<1){const r={params:{}};null===i?i=[r]:i.push(r),l++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),l++}p=r===l,c=c||p}if(!c){const r={params:{}};return null===i?i=[r]:i.push(r),l++,n.errors=i,!1}if(l=u,null!==i&&(u?i.length=u:i=null),f!==l)break}}return n.errors=i,0===l}function s(r,{instancePath:e="",parentData:t,parentDataProperty:a,rootData:o=r}={}){let i=null,l=0;const p=l;let f=!1;const u=l;if(l===u)if(Array.isArray(r)){const t=r.length;for(let s=0;s<t;s++){let t=r[s];const a=l,p=l;let f=!1;const u=l;if(l==l)if("string"==typeof t){if(t.length<1){const r={params:{}};null===i?i=[r]:i.push(r),l++}}else{const r={params:{type:"string"}};null===i?i=[r]:i.push(r),l++}var c=u===l;if(f=f||c,!f){const a=l;n(t,{instancePath:e+"/"+s,parentData:r,parentDataProperty:s,rootData:o})||(i=null===i?n.errors:i.concat(n.errors),l=i.length),c=a===l,f=f||c}if(f)l=p,null!==i&&(p?i.length=p:i=null);else{const r={params:{}};null===i?i=[r]:i.push(r),l++}if(a!==l)break}}else{const r={params:{type:"array"}};null===i?i=[r]:i.push(r),l++}var y=u===l;if(f=f||y,!f){const s=l;n(r,{instancePath:e,parentData:t,parentDataProperty:a,rootData:o})||(i=null===i?n.errors:i.concat(n.errors),l=i.length),y=s===l,f=f||y}if(!f){const r={params:{}};return null===i?i=[r]:i.push(r),l++,s.errors=i,!1}return l=p,null!==i&&(p?i.length=p:i=null),s.errors=i,0===l}function a(r,{instancePath:e="",parentData:t,parentDataProperty:n,rootData:o=r}={}){let i=null,l=0;if(0===l){if(!r||"object"!=typeof r||Array.isArray(r))return a.errors=[{params:{type:"object"}}],!1;{let t;if(void 0===r.shared&&(t="shared"))return a.errors=[{params:{missingProperty:t}}],!1;{const t=l;for(const e in r)if("shareScope"!==e&&"shared"!==e)return a.errors=[{params:{additionalProperty:e}}],!1;if(t===l){if(void 0!==r.shareScope){let e=r.shareScope;const t=l;if(l===t){if("string"!=typeof e)return a.errors=[{params:{type:"string"}}],!1;if(e.length<1)return a.errors=[{params:{}}],!1}var p=t===l}else p=!0;if(p)if(void 0!==r.shared){const t=l;s(r.shared,{instancePath:e+"/shared",parentData:r,parentDataProperty:"shared",rootData:o})||(i=null===i?s.errors:i.concat(s.errors),l=i.length),p=t===l}else p=!0}}}}return a.errors=i,0===l}
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.json b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.json
new file mode 100644
index 0000000..fd99c27
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/schemas/plugins/sharing/SharePlugin.json
@@ -0,0 +1,133 @@
+{
+  "definitions": {
+    "Shared": {
+      "description": "Modules that should be shared in the share scope. When provided, property names are used to match requested modules in this compilation.",
+      "anyOf": [
+        {
+          "type": "array",
+          "items": {
+            "description": "Modules that should be shared in the share scope.",
+            "anyOf": [
+              {
+                "$ref": "#/definitions/SharedItem"
+              },
+              {
+                "$ref": "#/definitions/SharedObject"
+              }
+            ]
+          }
+        },
+        {
+          "$ref": "#/definitions/SharedObject"
+        }
+      ]
+    },
+    "SharedConfig": {
+      "description": "Advanced configuration for modules that should be shared in the share scope.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "eager": {
+          "description": "Include the provided and fallback module directly instead behind an async request. This allows to use this shared module in initial load too. All possible shared modules need to be eager too.",
+          "type": "boolean"
+        },
+        "import": {
+          "description": "Provided module that should be provided to share scope. Also acts as fallback module if no shared module is found in share scope or version isn't valid. Defaults to the property name.",
+          "anyOf": [
+            {
+              "description": "No provided or fallback module.",
+              "enum": [false]
+            },
+            {
+              "$ref": "#/definitions/SharedItem"
+            }
+          ]
+        },
+        "packageName": {
+          "description": "Package name to determine required version from description file. This is only needed when package name can't be automatically determined from request.",
+          "type": "string",
+          "minLength": 1
+        },
+        "requiredVersion": {
+          "description": "Version requirement from module in share scope.",
+          "anyOf": [
+            {
+              "description": "No version requirement check.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Can be prefixed with '^' or '~' for minimum matches. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        },
+        "shareKey": {
+          "description": "Module is looked up under this key from the share scope.",
+          "type": "string",
+          "minLength": 1
+        },
+        "shareScope": {
+          "description": "Share scope name.",
+          "type": "string",
+          "minLength": 1
+        },
+        "singleton": {
+          "description": "Allow only a single version of the shared module in share scope (disabled by default).",
+          "type": "boolean"
+        },
+        "strictVersion": {
+          "description": "Do not accept shared module if version is not valid (defaults to yes, if local fallback module is available and shared module is not a singleton, otherwise no, has no effect if there is no required version specified).",
+          "type": "boolean"
+        },
+        "version": {
+          "description": "Version of the provided module. Will replace lower matching versions, but not higher.",
+          "anyOf": [
+            {
+              "description": "Don't provide a version.",
+              "enum": [false]
+            },
+            {
+              "description": "Version as string. Each part of the version should be separated by a dot '.'.",
+              "type": "string"
+            }
+          ]
+        }
+      }
+    },
+    "SharedItem": {
+      "description": "A module that should be shared in the share scope.",
+      "type": "string",
+      "minLength": 1
+    },
+    "SharedObject": {
+      "description": "Modules that should be shared in the share scope. Property names are used to match requested modules in this compilation. Relative requests are resolved, module requests are matched unresolved, absolute paths will match resolved requests. A trailing slash will match all requests with this prefix. In this case shareKey must also have a trailing slash.",
+      "type": "object",
+      "additionalProperties": {
+        "description": "Modules that should be shared in the share scope.",
+        "anyOf": [
+          {
+            "$ref": "#/definitions/SharedConfig"
+          },
+          {
+            "$ref": "#/definitions/SharedItem"
+          }
+        ]
+      }
+    }
+  },
+  "title": "SharePluginOptions",
+  "description": "Options for shared modules.",
+  "type": "object",
+  "additionalProperties": false,
+  "properties": {
+    "shareScope": {
+      "description": "Share scope name used for all shared modules (defaults to 'default').",
+      "type": "string",
+      "minLength": 1
+    },
+    "shared": {
+      "$ref": "#/definitions/Shared"
+    }
+  },
+  "required": ["shared"]
+}
diff --git a/node_modules/mathjs/examples/node_modules/webpack/types.d.ts b/node_modules/mathjs/examples/node_modules/webpack/types.d.ts
new file mode 100644
index 0000000..c3838ae
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/webpack/types.d.ts
@@ -0,0 +1,13072 @@
+/*
+ * This file was automatically generated.
+ * DO NOT MODIFY BY HAND.
+ * Run `yarn special-lint-fix` to update
+ */
+
+import { Buffer } from "buffer";
+import {
+	ArrayExpression,
+	ArrayPattern,
+	ArrowFunctionExpression,
+	AssignmentExpression,
+	AssignmentPattern,
+	AssignmentProperty,
+	AwaitExpression,
+	BigIntLiteral,
+	BinaryExpression,
+	BlockStatement,
+	BreakStatement,
+	CatchClause,
+	ChainExpression,
+	ClassBody,
+	ClassDeclaration,
+	ClassExpression,
+	Comment,
+	ConditionalExpression,
+	ContinueStatement,
+	DebuggerStatement,
+	DoWhileStatement,
+	EmptyStatement,
+	ExportAllDeclaration,
+	ExportDefaultDeclaration,
+	ExportNamedDeclaration,
+	ExportSpecifier,
+	ExpressionStatement,
+	ForInStatement,
+	ForOfStatement,
+	ForStatement,
+	FunctionDeclaration,
+	FunctionExpression,
+	Identifier,
+	IfStatement,
+	ImportDeclaration,
+	ImportDefaultSpecifier,
+	ImportExpression,
+	ImportNamespaceSpecifier,
+	ImportSpecifier,
+	LabeledStatement,
+	LogicalExpression,
+	MemberExpression,
+	MetaProperty,
+	MethodDefinition,
+	NewExpression,
+	ObjectExpression,
+	ObjectPattern,
+	PrivateIdentifier,
+	Program,
+	Property,
+	PropertyDefinition,
+	RegExpLiteral,
+	RestElement,
+	ReturnStatement,
+	SequenceExpression,
+	SimpleCallExpression,
+	SimpleLiteral,
+	SpreadElement,
+	StaticBlock,
+	Super,
+	SwitchCase,
+	SwitchStatement,
+	TaggedTemplateExpression,
+	TemplateElement,
+	TemplateLiteral,
+	ThisExpression,
+	ThrowStatement,
+	TryStatement,
+	UnaryExpression,
+	UpdateExpression,
+	VariableDeclaration,
+	VariableDeclarator,
+	WhileStatement,
+	WithStatement,
+	YieldExpression
+} from "estree";
+import { ServerOptions as ServerOptionsImport } from "http";
+import { ListenOptions, Server } from "net";
+import { validate as validateFunction } from "schema-utils";
+import { default as ValidationError } from "schema-utils/declarations/ValidationError";
+import { ValidationErrorConfiguration } from "schema-utils/declarations/validate";
+import {
+	AsArray,
+	AsyncParallelHook,
+	AsyncSeriesBailHook,
+	AsyncSeriesHook,
+	AsyncSeriesWaterfallHook,
+	HookMap,
+	MultiHook,
+	SyncBailHook,
+	SyncHook,
+	SyncWaterfallHook
+} from "tapable";
+import { SecureContextOptions, TlsOptions } from "tls";
+
+declare class AbstractLibraryPlugin<T> {
+	constructor(__0: {
+		/**
+		 * name of the plugin
+		 */
+		pluginName: string;
+		/**
+		 * used library type
+		 */
+		type: string;
+	});
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	parseOptions(library: LibraryOptions): false | T;
+	finishEntryModule(
+		module: Module,
+		entryName: string,
+		libraryContext: LibraryContext<T>
+	): void;
+	embedInRuntimeBailout(
+		module: Module,
+		renderContext: RenderContext,
+		libraryContext: LibraryContext<T>
+	): undefined | string;
+	strictRuntimeBailout(
+		renderContext: RenderContext,
+		libraryContext: LibraryContext<T>
+	): undefined | string;
+	runtimeRequirements(
+		chunk: Chunk,
+		set: Set<string>,
+		libraryContext: LibraryContext<T>
+	): void;
+	render(
+		source: Source,
+		renderContext: RenderContext,
+		libraryContext: LibraryContext<T>
+	): Source;
+	renderStartup(
+		source: Source,
+		module: Module,
+		renderContext: StartupRenderContext,
+		libraryContext: LibraryContext<T>
+	): Source;
+	chunkHash(
+		chunk: Chunk,
+		hash: Hash,
+		chunkHashContext: ChunkHashContext,
+		libraryContext: LibraryContext<T>
+	): void;
+	static COMMON_LIBRARY_NAME_MESSAGE: string;
+}
+declare interface AdditionalData {
+	[index: string]: any;
+	webpackAST: object;
+}
+declare class AggressiveMergingPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class AggressiveSplittingPlugin {
+	constructor(options?: AggressiveSplittingPluginOptions);
+	options: AggressiveSplittingPluginOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static wasChunkRecorded(chunk: Chunk): boolean;
+}
+declare interface AggressiveSplittingPluginOptions {
+	/**
+	 * Extra cost for each chunk (Default: 9.8kiB).
+	 */
+	chunkOverhead?: number;
+
+	/**
+	 * Extra cost multiplicator for entry chunks (Default: 10).
+	 */
+	entryChunkMultiplicator?: number;
+
+	/**
+	 * Byte, max size of per file (Default: 50kiB).
+	 */
+	maxSize?: number;
+
+	/**
+	 * Byte, split point. (Default: 30kiB).
+	 */
+	minSize?: number;
+}
+declare interface AliasOption {
+	alias: string | false | string[];
+	name: string;
+	onlyModule?: boolean;
+}
+type AliasOptionNewRequest = string | false | string[];
+declare interface AliasOptions {
+	[index: string]: AliasOptionNewRequest;
+}
+declare interface Argument {
+	description: string;
+	simpleType: "string" | "number" | "boolean";
+	multiple: boolean;
+	configs: ArgumentConfig[];
+}
+declare interface ArgumentConfig {
+	description: string;
+	negatedDescription?: string;
+	path: string;
+	multiple: boolean;
+	type: "string" | "number" | "boolean" | "path" | "enum" | "RegExp" | "reset";
+	values?: any[];
+}
+declare interface Asset {
+	/**
+	 * the filename of the asset
+	 */
+	name: string;
+
+	/**
+	 * source of the asset
+	 */
+	source: Source;
+
+	/**
+	 * info about the asset
+	 */
+	info: AssetInfo;
+}
+declare interface AssetEmittedInfo {
+	content: Buffer;
+	source: Source;
+	compilation: Compilation;
+	outputPath: string;
+	targetPath: string;
+}
+type AssetFilterItemTypes =
+	| string
+	| RegExp
+	| ((name: string, asset: StatsAsset) => boolean);
+
+/**
+ * Options object for data url generation.
+ */
+declare interface AssetGeneratorDataUrlOptions {
+	/**
+	 * Asset encoding (defaults to base64).
+	 */
+	encoding?: false | "base64";
+
+	/**
+	 * Asset mimetype (getting from file extension by default).
+	 */
+	mimetype?: string;
+}
+type AssetGeneratorOptions = AssetInlineGeneratorOptions &
+	AssetResourceGeneratorOptions;
+type AssetInfo = KnownAssetInfo & Record<string, any>;
+
+/**
+ * Generator options for asset/inline modules.
+ */
+declare interface AssetInlineGeneratorOptions {
+	/**
+	 * The options for data url generator.
+	 */
+	dataUrl?:
+		| AssetGeneratorDataUrlOptions
+		| ((
+				source: string | Buffer,
+				context: { filename: string; module: Module }
+		  ) => string);
+}
+
+/**
+ * Options object for DataUrl condition.
+ */
+declare interface AssetParserDataUrlOptions {
+	/**
+	 * Maximum size of asset that should be inline as modules. Default: 8kb.
+	 */
+	maxSize?: number;
+}
+
+/**
+ * Parser options for asset modules.
+ */
+declare interface AssetParserOptions {
+	/**
+	 * The condition for inlining the asset as DataUrl.
+	 */
+	dataUrlCondition?:
+		| AssetParserDataUrlOptions
+		| ((
+				source: string | Buffer,
+				context: { filename: string; module: Module }
+		  ) => boolean);
+}
+
+/**
+ * Generator options for asset/resource modules.
+ */
+declare interface AssetResourceGeneratorOptions {
+	/**
+	 * Emit an output asset from this asset module. This can be set to 'false' to omit emitting e. g. for SSR.
+	 */
+	emit?: boolean;
+
+	/**
+	 * Specifies the filename template of output files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	filename?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Emit the asset in the specified folder relative to 'output.path'. This should only be needed when custom 'publicPath' is specified to match the folder structure there.
+	 */
+	outputPath?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * The 'publicPath' specifies the public URL address of the output files when referenced in a browser.
+	 */
+	publicPath?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+}
+declare class AsyncDependenciesBlock extends DependenciesBlock {
+	constructor(
+		groupOptions: RawChunkGroupOptions & { name?: string } & {
+			entryOptions?: EntryOptions;
+		},
+		loc?: SyntheticDependencyLocation | RealDependencyLocation,
+		request?: string
+	);
+	groupOptions: RawChunkGroupOptions & { name?: string } & {
+		entryOptions?: EntryOptions;
+	};
+	loc?: SyntheticDependencyLocation | RealDependencyLocation;
+	request?: string;
+	chunkName: string;
+	module: any;
+}
+declare abstract class AsyncQueue<T, K, R> {
+	hooks: {
+		beforeAdd: AsyncSeriesHook<[T]>;
+		added: SyncHook<[T]>;
+		beforeStart: AsyncSeriesHook<[T]>;
+		started: SyncHook<[T]>;
+		result: SyncHook<[T, Error, R]>;
+	};
+	add(item: T, callback: CallbackAsyncQueue<R>): void;
+	invalidate(item: T): void;
+
+	/**
+	 * Waits for an already started item
+	 */
+	waitFor(item: T, callback: CallbackAsyncQueue<R>): void;
+	stop(): void;
+	increaseParallelism(): void;
+	decreaseParallelism(): void;
+	isProcessing(item: T): boolean;
+	isQueued(item: T): boolean;
+	isDone(item: T): boolean;
+	clear(): void;
+}
+declare class AsyncWebAssemblyModulesPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	renderModule(module?: any, renderContext?: any, hooks?: any): any;
+	static getCompilationHooks(
+		compilation: Compilation
+	): CompilationHooksAsyncWebAssemblyModulesPlugin;
+}
+declare class AutomaticPrefetchPlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+type AuxiliaryComment = string | LibraryCustomUmdCommentObject;
+declare interface BackendApi {
+	dispose: (arg0?: Error) => void;
+	module: (arg0: Module) => { client: string; data: string; active: boolean };
+}
+declare class BannerPlugin {
+	constructor(options: BannerPluginArgument);
+	options: BannerPluginOptions;
+	banner: (data: { hash: string; chunk: Chunk; filename: string }) => string;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+type BannerPluginArgument =
+	| string
+	| BannerPluginOptions
+	| ((data: { hash: string; chunk: Chunk; filename: string }) => string);
+declare interface BannerPluginOptions {
+	/**
+	 * Specifies the banner.
+	 */
+	banner:
+		| string
+		| ((data: { hash: string; chunk: Chunk; filename: string }) => string);
+
+	/**
+	 * If true, the banner will only be added to the entry chunks.
+	 */
+	entryOnly?: boolean;
+
+	/**
+	 * Exclude all modules matching any of these conditions.
+	 */
+	exclude?: string | RegExp | Rule[];
+
+	/**
+	 * Include all modules matching any of these conditions.
+	 */
+	include?: string | RegExp | Rule[];
+
+	/**
+	 * If true, banner will not be wrapped in a comment.
+	 */
+	raw?: boolean;
+
+	/**
+	 * Include all modules that pass test assertion.
+	 */
+	test?: string | RegExp | Rule[];
+}
+declare interface BaseResolveRequest {
+	path: string | false;
+	descriptionFilePath?: string;
+	descriptionFileRoot?: string;
+	descriptionFileData?: object;
+	relativePath?: string;
+	ignoreSymlinks?: boolean;
+	fullySpecified?: boolean;
+}
+declare abstract class BasicEvaluatedExpression {
+	type: number;
+	range: [number, number];
+	falsy: boolean;
+	truthy: boolean;
+	nullish?: boolean;
+	sideEffects: boolean;
+	bool?: boolean;
+	number?: number;
+	bigint?: bigint;
+	regExp?: RegExp;
+	string?: string;
+	quasis?: BasicEvaluatedExpression[];
+	parts?: BasicEvaluatedExpression[];
+	array?: any[];
+	items?: BasicEvaluatedExpression[];
+	options?: BasicEvaluatedExpression[];
+	prefix?: BasicEvaluatedExpression;
+	postfix?: BasicEvaluatedExpression;
+	wrappedInnerExpressions: any;
+	identifier?: string;
+	rootInfo: VariableInfoInterface;
+	getMembers: () => string[];
+	expression: NodeEstreeIndex;
+	isUnknown(): boolean;
+	isNull(): boolean;
+	isUndefined(): boolean;
+	isString(): boolean;
+	isNumber(): boolean;
+	isBigInt(): boolean;
+	isBoolean(): boolean;
+	isRegExp(): boolean;
+	isConditional(): boolean;
+	isArray(): boolean;
+	isConstArray(): boolean;
+	isIdentifier(): boolean;
+	isWrapped(): boolean;
+	isTemplateString(): boolean;
+
+	/**
+	 * Is expression a primitive or an object type value?
+	 */
+	isPrimitiveType(): undefined | boolean;
+
+	/**
+	 * Is expression a runtime or compile-time value?
+	 */
+	isCompileTimeValue(): boolean;
+
+	/**
+	 * Gets the compile-time value of the expression
+	 */
+	asCompileTimeValue(): any;
+	isTruthy(): boolean;
+	isFalsy(): boolean;
+	isNullish(): undefined | boolean;
+
+	/**
+	 * Can this expression have side effects?
+	 */
+	couldHaveSideEffects(): boolean;
+	asBool(): any;
+	asNullish(): undefined | boolean;
+	asString(): any;
+	setString(string?: any): BasicEvaluatedExpression;
+	setUndefined(): BasicEvaluatedExpression;
+	setNull(): BasicEvaluatedExpression;
+	setNumber(number?: any): BasicEvaluatedExpression;
+	setBigInt(bigint?: any): BasicEvaluatedExpression;
+	setBoolean(bool?: any): BasicEvaluatedExpression;
+	setRegExp(regExp?: any): BasicEvaluatedExpression;
+	setIdentifier(
+		identifier?: any,
+		rootInfo?: any,
+		getMembers?: any
+	): BasicEvaluatedExpression;
+	setWrapped(
+		prefix?: any,
+		postfix?: any,
+		innerExpressions?: any
+	): BasicEvaluatedExpression;
+	setOptions(options?: any): BasicEvaluatedExpression;
+	addOptions(options?: any): BasicEvaluatedExpression;
+	setItems(items?: any): BasicEvaluatedExpression;
+	setArray(array?: any): BasicEvaluatedExpression;
+	setTemplateString(
+		quasis?: any,
+		parts?: any,
+		kind?: any
+	): BasicEvaluatedExpression;
+	templateStringKind: any;
+	setTruthy(): BasicEvaluatedExpression;
+	setFalsy(): BasicEvaluatedExpression;
+	setNullish(value?: any): BasicEvaluatedExpression;
+	setRange(range?: any): BasicEvaluatedExpression;
+	setSideEffects(sideEffects?: boolean): BasicEvaluatedExpression;
+	setExpression(expression?: any): BasicEvaluatedExpression;
+}
+type BuildMeta = KnownBuildMeta & Record<string, any>;
+declare abstract class ByTypeGenerator extends Generator {
+	map: any;
+}
+declare const CIRCULAR_CONNECTION: unique symbol;
+declare class Cache {
+	constructor();
+	hooks: {
+		get: AsyncSeriesBailHook<
+			[
+				string,
+				null | Etag,
+				((result: any, callback: (arg0?: Error) => void) => void)[]
+			],
+			any
+		>;
+		store: AsyncParallelHook<[string, null | Etag, any]>;
+		storeBuildDependencies: AsyncParallelHook<[Iterable<string>]>;
+		beginIdle: SyncHook<[]>;
+		endIdle: AsyncParallelHook<[]>;
+		shutdown: AsyncParallelHook<[]>;
+	};
+	get<T>(
+		identifier: string,
+		etag: null | Etag,
+		callback: CallbackCache<T>
+	): void;
+	store<T>(
+		identifier: string,
+		etag: null | Etag,
+		data: T,
+		callback: CallbackCache<void>
+	): void;
+
+	/**
+	 * After this method has succeeded the cache can only be restored when build dependencies are
+	 */
+	storeBuildDependencies(
+		dependencies: Iterable<string>,
+		callback: CallbackCache<void>
+	): void;
+	beginIdle(): void;
+	endIdle(callback: CallbackCache<void>): void;
+	shutdown(callback: CallbackCache<void>): void;
+	static STAGE_MEMORY: number;
+	static STAGE_DEFAULT: number;
+	static STAGE_DISK: number;
+	static STAGE_NETWORK: number;
+}
+declare abstract class CacheFacade {
+	getChildCache(name: string): CacheFacade;
+	getItemCache(identifier: string, etag: null | Etag): ItemCacheFacade;
+	getLazyHashedEtag(obj: HashableObject): Etag;
+	mergeEtags(a: Etag, b: Etag): Etag;
+	get<T>(
+		identifier: string,
+		etag: null | Etag,
+		callback: CallbackCache<T>
+	): void;
+	getPromise<T>(identifier: string, etag: null | Etag): Promise<T>;
+	store<T>(
+		identifier: string,
+		etag: null | Etag,
+		data: T,
+		callback: CallbackCache<void>
+	): void;
+	storePromise<T>(
+		identifier: string,
+		etag: null | Etag,
+		data: T
+	): Promise<void>;
+	provide<T>(
+		identifier: string,
+		etag: null | Etag,
+		computer: (arg0: CallbackNormalErrorCache<T>) => void,
+		callback: CallbackNormalErrorCache<T>
+	): void;
+	providePromise<T>(
+		identifier: string,
+		etag: null | Etag,
+		computer: () => T | Promise<T>
+	): Promise<T>;
+}
+declare interface CacheGroupSource {
+	key?: string;
+	priority?: number;
+	getName?: (
+		module?: Module,
+		chunks?: Chunk[],
+		key?: string
+	) => undefined | string;
+	chunksFilter?: (chunk: Chunk) => boolean;
+	enforce?: boolean;
+	minSize: SplitChunksSizes;
+	minSizeReduction: SplitChunksSizes;
+	minRemainingSize: SplitChunksSizes;
+	enforceSizeThreshold: SplitChunksSizes;
+	maxAsyncSize: SplitChunksSizes;
+	maxInitialSize: SplitChunksSizes;
+	minChunks?: number;
+	maxAsyncRequests?: number;
+	maxInitialRequests?: number;
+	filename?: string | ((arg0: PathData, arg1?: AssetInfo) => string);
+	idHint?: string;
+	automaticNameDelimiter: string;
+	reuseExistingChunk?: boolean;
+	usedExports?: boolean;
+}
+declare interface CacheGroupsContext {
+	moduleGraph: ModuleGraph;
+	chunkGraph: ChunkGraph;
+}
+type CacheOptionsNormalized = false | FileCacheOptions | MemoryCacheOptions;
+declare class CachedSource extends Source {
+	constructor(source: Source);
+	constructor(source: Source | (() => Source), cachedData?: any);
+	original(): Source;
+	originalLazy(): Source | (() => Source);
+	getCachedData(): any;
+}
+type CallExpression = SimpleCallExpression | NewExpression;
+declare interface CallExpressionInfo {
+	type: "call";
+	call: CallExpression;
+	calleeName: string;
+	rootInfo: string | VariableInfo;
+	getCalleeMembers: () => string[];
+	name: string;
+	getMembers: () => string[];
+}
+declare interface CallbackAsyncQueue<T> {
+	(err?: null | WebpackError, result?: T): any;
+}
+declare interface CallbackCache<T> {
+	(err?: null | WebpackError, result?: T): void;
+}
+declare interface CallbackFunction<T> {
+	(err?: null | Error, result?: T): any;
+}
+declare interface CallbackNormalErrorCache<T> {
+	(err?: null | Error, result?: T): void;
+}
+declare interface CallbackWebpack<T> {
+	(err?: Error, stats?: T): void;
+}
+type Cell<T> = undefined | T;
+declare class Chunk {
+	constructor(name?: string, backCompat?: boolean);
+	id: null | string | number;
+	ids: null | (string | number)[];
+	debugId: number;
+	name: string;
+	idNameHints: SortableSet<string>;
+	preventIntegration: boolean;
+	filenameTemplate:
+		| null
+		| string
+		| ((arg0: PathData, arg1?: AssetInfo) => string);
+	cssFilenameTemplate:
+		| null
+		| string
+		| ((arg0: PathData, arg1?: AssetInfo) => string);
+	runtime: RuntimeSpec;
+	files: Set<string>;
+	auxiliaryFiles: Set<string>;
+	rendered: boolean;
+	hash?: string;
+	contentHash: Record<string, string>;
+	renderedHash?: string;
+	chunkReason?: string;
+	extraAsync: boolean;
+	readonly entryModule?: Module;
+	hasEntryModule(): boolean;
+	addModule(module: Module): boolean;
+	removeModule(module: Module): void;
+	getNumberOfModules(): number;
+	readonly modulesIterable: Iterable<Module>;
+	compareTo(otherChunk: Chunk): 0 | 1 | -1;
+	containsModule(module: Module): boolean;
+	getModules(): Module[];
+	remove(): void;
+	moveModule(module: Module, otherChunk: Chunk): void;
+	integrate(otherChunk: Chunk): boolean;
+	canBeIntegrated(otherChunk: Chunk): boolean;
+	isEmpty(): boolean;
+	modulesSize(): number;
+	size(options?: ChunkSizeOptions): number;
+	integratedSize(otherChunk: Chunk, options: ChunkSizeOptions): number;
+	getChunkModuleMaps(filterFn: (m: Module) => boolean): ChunkModuleMaps;
+	hasModuleInGraph(
+		filterFn: (m: Module) => boolean,
+		filterChunkFn?: (c: Chunk, chunkGraph: ChunkGraph) => boolean
+	): boolean;
+	getChunkMaps(realHash: boolean): ChunkMaps;
+	hasRuntime(): boolean;
+	canBeInitial(): boolean;
+	isOnlyInitial(): boolean;
+	getEntryOptions(): undefined | EntryOptions;
+	addGroup(chunkGroup: ChunkGroup): void;
+	removeGroup(chunkGroup: ChunkGroup): void;
+	isInGroup(chunkGroup: ChunkGroup): boolean;
+	getNumberOfGroups(): number;
+	readonly groupsIterable: Iterable<ChunkGroup>;
+	disconnectFromGroups(): void;
+	split(newChunk: Chunk): void;
+	updateHash(hash: Hash, chunkGraph: ChunkGraph): void;
+	getAllAsyncChunks(): Set<Chunk>;
+	getAllInitialChunks(): Set<Chunk>;
+	getAllReferencedChunks(): Set<Chunk>;
+	getAllReferencedAsyncEntrypoints(): Set<Entrypoint>;
+	hasAsyncChunks(): boolean;
+	getChildIdsByOrders(
+		chunkGraph: ChunkGraph,
+		filterFn?: (c: Chunk, chunkGraph: ChunkGraph) => boolean
+	): Record<string, (string | number)[]>;
+	getChildrenOfTypeInOrder(
+		chunkGraph: ChunkGraph,
+		type: string
+	): { onChunks: Chunk[]; chunks: Set<Chunk> }[];
+	getChildIdsByOrdersMap(
+		chunkGraph: ChunkGraph,
+		includeDirectChildren?: boolean,
+		filterFn?: (c: Chunk, chunkGraph: ChunkGraph) => boolean
+	): Record<string | number, Record<string, (string | number)[]>>;
+}
+declare class ChunkGraph {
+	constructor(moduleGraph: ModuleGraph, hashFunction?: string | typeof Hash);
+	moduleGraph: ModuleGraph;
+	connectChunkAndModule(chunk: Chunk, module: Module): void;
+	disconnectChunkAndModule(chunk: Chunk, module: Module): void;
+	disconnectChunk(chunk: Chunk): void;
+	attachModules(chunk: Chunk, modules: Iterable<Module>): void;
+	attachRuntimeModules(chunk: Chunk, modules: Iterable<RuntimeModule>): void;
+	attachFullHashModules(chunk: Chunk, modules: Iterable<RuntimeModule>): void;
+	attachDependentHashModules(
+		chunk: Chunk,
+		modules: Iterable<RuntimeModule>
+	): void;
+	replaceModule(oldModule: Module, newModule: Module): void;
+	isModuleInChunk(module: Module, chunk: Chunk): boolean;
+	isModuleInChunkGroup(module: Module, chunkGroup: ChunkGroup): boolean;
+	isEntryModule(module: Module): boolean;
+	getModuleChunksIterable(module: Module): Iterable<Chunk>;
+	getOrderedModuleChunksIterable(
+		module: Module,
+		sortFn: (arg0: Chunk, arg1: Chunk) => 0 | 1 | -1
+	): Iterable<Chunk>;
+	getModuleChunks(module: Module): Chunk[];
+	getNumberOfModuleChunks(module: Module): number;
+	getModuleRuntimes(module: Module): RuntimeSpecSet;
+	getNumberOfChunkModules(chunk: Chunk): number;
+	getNumberOfChunkFullHashModules(chunk: Chunk): number;
+	getChunkModulesIterable(chunk: Chunk): Iterable<Module>;
+	getChunkModulesIterableBySourceType(
+		chunk: Chunk,
+		sourceType: string
+	): undefined | Iterable<Module>;
+	getOrderedChunkModulesIterable(
+		chunk: Chunk,
+		comparator: (arg0: Module, arg1: Module) => 0 | 1 | -1
+	): Iterable<Module>;
+	getOrderedChunkModulesIterableBySourceType(
+		chunk: Chunk,
+		sourceType: string,
+		comparator: (arg0: Module, arg1: Module) => 0 | 1 | -1
+	): undefined | Iterable<Module>;
+	getChunkModules(chunk: Chunk): Module[];
+	getOrderedChunkModules(
+		chunk: Chunk,
+		comparator: (arg0: Module, arg1: Module) => 0 | 1 | -1
+	): Module[];
+	getChunkModuleIdMap(
+		chunk: Chunk,
+		filterFn: (m: Module) => boolean,
+		includeAllChunks?: boolean
+	): Record<string | number, (string | number)[]>;
+	getChunkModuleRenderedHashMap(
+		chunk: Chunk,
+		filterFn: (m: Module) => boolean,
+		hashLength?: number,
+		includeAllChunks?: boolean
+	): Record<string | number, Record<string | number, string>>;
+	getChunkConditionMap(
+		chunk: Chunk,
+		filterFn: (c: Chunk, chunkGraph: ChunkGraph) => boolean
+	): Record<string | number, boolean>;
+	hasModuleInGraph(
+		chunk: Chunk,
+		filterFn: (m: Module) => boolean,
+		filterChunkFn?: (c: Chunk, chunkGraph: ChunkGraph) => boolean
+	): boolean;
+	compareChunks(chunkA: Chunk, chunkB: Chunk): 0 | 1 | -1;
+	getChunkModulesSize(chunk: Chunk): number;
+	getChunkModulesSizes(chunk: Chunk): Record<string, number>;
+	getChunkRootModules(chunk: Chunk): Module[];
+	getChunkSize(chunk: Chunk, options?: ChunkSizeOptions): number;
+	getIntegratedChunksSize(
+		chunkA: Chunk,
+		chunkB: Chunk,
+		options?: ChunkSizeOptions
+	): number;
+	canChunksBeIntegrated(chunkA: Chunk, chunkB: Chunk): boolean;
+	integrateChunks(chunkA: Chunk, chunkB: Chunk): void;
+	upgradeDependentToFullHashModules(chunk: Chunk): void;
+	isEntryModuleInChunk(module: Module, chunk: Chunk): boolean;
+	connectChunkAndEntryModule(
+		chunk: Chunk,
+		module: Module,
+		entrypoint?: Entrypoint
+	): void;
+	connectChunkAndRuntimeModule(chunk: Chunk, module: RuntimeModule): void;
+	addFullHashModuleToChunk(chunk: Chunk, module: RuntimeModule): void;
+	addDependentHashModuleToChunk(chunk: Chunk, module: RuntimeModule): void;
+	disconnectChunkAndEntryModule(chunk: Chunk, module: Module): void;
+	disconnectChunkAndRuntimeModule(chunk: Chunk, module: RuntimeModule): void;
+	disconnectEntryModule(module: Module): void;
+	disconnectEntries(chunk: Chunk): void;
+	getNumberOfEntryModules(chunk: Chunk): number;
+	getNumberOfRuntimeModules(chunk: Chunk): number;
+	getChunkEntryModulesIterable(chunk: Chunk): Iterable<Module>;
+	getChunkEntryDependentChunksIterable(chunk: Chunk): Iterable<Chunk>;
+	hasChunkEntryDependentChunks(chunk: Chunk): boolean;
+	getChunkRuntimeModulesIterable(chunk: Chunk): Iterable<RuntimeModule>;
+	getChunkRuntimeModulesInOrder(chunk: Chunk): RuntimeModule[];
+	getChunkFullHashModulesIterable(
+		chunk: Chunk
+	): undefined | Iterable<RuntimeModule>;
+	getChunkFullHashModulesSet(
+		chunk: Chunk
+	): undefined | ReadonlySet<RuntimeModule>;
+	getChunkDependentHashModulesIterable(
+		chunk: Chunk
+	): undefined | Iterable<RuntimeModule>;
+	getChunkEntryModulesWithChunkGroupIterable(
+		chunk: Chunk
+	): Iterable<[Module, undefined | Entrypoint]>;
+	getBlockChunkGroup(depBlock: AsyncDependenciesBlock): ChunkGroup;
+	connectBlockAndChunkGroup(
+		depBlock: AsyncDependenciesBlock,
+		chunkGroup: ChunkGroup
+	): void;
+	disconnectChunkGroup(chunkGroup: ChunkGroup): void;
+	getModuleId(module: Module): string | number;
+	setModuleId(module: Module, id: string | number): void;
+	getRuntimeId(runtime: string): string | number;
+	setRuntimeId(runtime: string, id: string | number): void;
+	hasModuleHashes(module: Module, runtime: RuntimeSpec): boolean;
+	getModuleHash(module: Module, runtime: RuntimeSpec): string;
+	getRenderedModuleHash(module: Module, runtime: RuntimeSpec): string;
+	setModuleHashes(
+		module: Module,
+		runtime: RuntimeSpec,
+		hash: string,
+		renderedHash: string
+	): void;
+	addModuleRuntimeRequirements(
+		module: Module,
+		runtime: RuntimeSpec,
+		items: Set<string>,
+		transferOwnership?: boolean
+	): void;
+	addChunkRuntimeRequirements(chunk: Chunk, items: Set<string>): void;
+	addTreeRuntimeRequirements(chunk: Chunk, items: Iterable<string>): void;
+	getModuleRuntimeRequirements(
+		module: Module,
+		runtime: RuntimeSpec
+	): ReadonlySet<string>;
+	getChunkRuntimeRequirements(chunk: Chunk): ReadonlySet<string>;
+	getModuleGraphHash(
+		module: Module,
+		runtime: RuntimeSpec,
+		withConnections?: boolean
+	): string;
+	getModuleGraphHashBigInt(
+		module: Module,
+		runtime: RuntimeSpec,
+		withConnections?: boolean
+	): bigint;
+	getTreeRuntimeRequirements(chunk: Chunk): ReadonlySet<string>;
+	static getChunkGraphForModule(
+		module: Module,
+		deprecateMessage: string,
+		deprecationCode: string
+	): ChunkGraph;
+	static setChunkGraphForModule(module: Module, chunkGraph: ChunkGraph): void;
+	static clearChunkGraphForModule(module: Module): void;
+	static getChunkGraphForChunk(
+		chunk: Chunk,
+		deprecateMessage: string,
+		deprecationCode: string
+	): ChunkGraph;
+	static setChunkGraphForChunk(chunk: Chunk, chunkGraph: ChunkGraph): void;
+	static clearChunkGraphForChunk(chunk: Chunk): void;
+}
+declare abstract class ChunkGroup {
+	groupDebugId: number;
+	options: ChunkGroupOptions;
+	chunks: Chunk[];
+	origins: OriginRecord[];
+	index: number;
+
+	/**
+	 * when a new chunk is added to a chunkGroup, addingOptions will occur.
+	 */
+	addOptions(options: ChunkGroupOptions): void;
+
+	/**
+	 * returns the name of current ChunkGroup
+	 * sets a new name for current ChunkGroup
+	 */
+	name?: string;
+
+	/**
+	 * get a uniqueId for ChunkGroup, made up of its member Chunk debugId's
+	 */
+	readonly debugId: string;
+
+	/**
+	 * get a unique id for ChunkGroup, made up of its member Chunk id's
+	 */
+	readonly id: string;
+
+	/**
+	 * Performs an unshift of a specific chunk
+	 */
+	unshiftChunk(chunk: Chunk): boolean;
+
+	/**
+	 * inserts a chunk before another existing chunk in group
+	 */
+	insertChunk(chunk: Chunk, before: Chunk): boolean;
+
+	/**
+	 * add a chunk into ChunkGroup. Is pushed on or prepended
+	 */
+	pushChunk(chunk: Chunk): boolean;
+	replaceChunk(oldChunk: Chunk, newChunk: Chunk): boolean;
+	removeChunk(chunk: Chunk): boolean;
+	isInitial(): boolean;
+	addChild(group: ChunkGroup): boolean;
+	getChildren(): ChunkGroup[];
+	getNumberOfChildren(): number;
+	readonly childrenIterable: SortableSet<ChunkGroup>;
+	removeChild(group: ChunkGroup): boolean;
+	addParent(parentChunk: ChunkGroup): boolean;
+	getParents(): ChunkGroup[];
+	getNumberOfParents(): number;
+	hasParent(parent: ChunkGroup): boolean;
+	readonly parentsIterable: SortableSet<ChunkGroup>;
+	removeParent(chunkGroup: ChunkGroup): boolean;
+	addAsyncEntrypoint(entrypoint: Entrypoint): boolean;
+	readonly asyncEntrypointsIterable: SortableSet<ChunkGroup>;
+	getBlocks(): any[];
+	getNumberOfBlocks(): number;
+	hasBlock(block?: any): boolean;
+	readonly blocksIterable: Iterable<AsyncDependenciesBlock>;
+	addBlock(block: AsyncDependenciesBlock): boolean;
+	addOrigin(module: Module, loc: DependencyLocation, request: string): void;
+	getFiles(): string[];
+	remove(): void;
+	sortItems(): void;
+
+	/**
+	 * Sorting predicate which allows current ChunkGroup to be compared against another.
+	 * Sorting values are based off of number of chunks in ChunkGroup.
+	 */
+	compareTo(chunkGraph: ChunkGraph, otherGroup: ChunkGroup): 0 | 1 | -1;
+	getChildrenByOrders(
+		moduleGraph: ModuleGraph,
+		chunkGraph: ChunkGraph
+	): Record<string, ChunkGroup[]>;
+
+	/**
+	 * Sets the top-down index of a module in this ChunkGroup
+	 */
+	setModulePreOrderIndex(module: Module, index: number): void;
+
+	/**
+	 * Gets the top-down index of a module in this ChunkGroup
+	 */
+	getModulePreOrderIndex(module: Module): number;
+
+	/**
+	 * Sets the bottom-up index of a module in this ChunkGroup
+	 */
+	setModulePostOrderIndex(module: Module, index: number): void;
+
+	/**
+	 * Gets the bottom-up index of a module in this ChunkGroup
+	 */
+	getModulePostOrderIndex(module: Module): number;
+	checkConstraints(): void;
+	getModuleIndex: (module: Module) => number;
+	getModuleIndex2: (module: Module) => number;
+}
+type ChunkGroupOptions = RawChunkGroupOptions & { name?: string };
+declare interface ChunkHashContext {
+	/**
+	 * results of code generation
+	 */
+	codeGenerationResults: CodeGenerationResults;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+}
+declare interface ChunkMaps {
+	hash: Record<string | number, string>;
+	contentHash: Record<string | number, Record<string, string>>;
+	name: Record<string | number, string>;
+}
+declare class ChunkModuleIdRangePlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface ChunkModuleMaps {
+	id: Record<string | number, (string | number)[]>;
+	hash: Record<string | number, string>;
+}
+declare interface ChunkPathData {
+	id: string | number;
+	name?: string;
+	hash: string;
+	hashWithLength?: (arg0: number) => string;
+	contentHash?: Record<string, string>;
+	contentHashWithLength?: Record<string, (length: number) => string>;
+}
+declare class ChunkPrefetchPreloadPlugin {
+	constructor();
+	apply(compiler: Compiler): void;
+}
+declare interface ChunkRenderContext {
+	/**
+	 * the chunk
+	 */
+	chunk: Chunk;
+
+	/**
+	 * the dependency templates
+	 */
+	dependencyTemplates: DependencyTemplates;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * results of code generation
+	 */
+	codeGenerationResults: CodeGenerationResults;
+
+	/**
+	 * init fragments for the chunk
+	 */
+	chunkInitFragments: InitFragment<ChunkRenderContext>[];
+
+	/**
+	 * rendering in strict context
+	 */
+	strictMode: boolean;
+}
+declare interface ChunkSizeOptions {
+	/**
+	 * constant overhead for a chunk
+	 */
+	chunkOverhead?: number;
+
+	/**
+	 * multiplicator for initial chunks
+	 */
+	entryChunkMultiplicator?: number;
+}
+declare abstract class ChunkTemplate {
+	hooks: Readonly<{
+		renderManifest: { tap: (options?: any, fn?: any) => void };
+		modules: { tap: (options?: any, fn?: any) => void };
+		render: { tap: (options?: any, fn?: any) => void };
+		renderWithEntry: { tap: (options?: any, fn?: any) => void };
+		hash: { tap: (options?: any, fn?: any) => void };
+		hashForChunk: { tap: (options?: any, fn?: any) => void };
+	}>;
+	readonly outputOptions: Output;
+}
+
+/**
+ * Advanced options for cleaning assets.
+ */
+declare interface CleanOptions {
+	/**
+	 * Log the assets that should be removed instead of deleting them.
+	 */
+	dry?: boolean;
+
+	/**
+	 * Keep these assets.
+	 */
+	keep?: string | RegExp | ((filename: string) => boolean);
+}
+declare class CleanPlugin {
+	constructor(options?: CleanOptions);
+	options: {
+		/**
+		 * Log the assets that should be removed instead of deleting them.
+		 */
+		dry: boolean;
+		/**
+		 * Keep these assets.
+		 */
+		keep?: string | RegExp | ((filename: string) => boolean);
+	};
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static getCompilationHooks(
+		compilation: Compilation
+	): CleanPluginCompilationHooks;
+}
+declare interface CleanPluginCompilationHooks {
+	/**
+	 * when returning true the file/directory will be kept during cleaning, returning false will clean it and ignore the following plugins and config
+	 */
+	keep: SyncBailHook<[string], boolean>;
+}
+declare interface CodeGenerationContext {
+	/**
+	 * the dependency templates
+	 */
+	dependencyTemplates: DependencyTemplates;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * the runtimes code should be generated for
+	 */
+	runtime: RuntimeSpec;
+
+	/**
+	 * when in concatenated module, information about other concatenated modules
+	 */
+	concatenationScope?: ConcatenationScope;
+
+	/**
+	 * code generation results of other modules (need to have a codeGenerationDependency to use that)
+	 */
+	codeGenerationResults: CodeGenerationResults;
+}
+declare interface CodeGenerationResult {
+	/**
+	 * the resulting sources for all source types
+	 */
+	sources: Map<string, Source>;
+
+	/**
+	 * the resulting data for all source types
+	 */
+	data?: Map<string, any>;
+
+	/**
+	 * the runtime requirements
+	 */
+	runtimeRequirements: ReadonlySet<string>;
+
+	/**
+	 * a hash of the code generation result (will be automatically calculated from sources and runtimeRequirements if not provided)
+	 */
+	hash?: string;
+}
+declare abstract class CodeGenerationResults {
+	map: Map<Module, RuntimeSpecMap<CodeGenerationResult>>;
+	get(module: Module, runtime: RuntimeSpec): CodeGenerationResult;
+	has(module: Module, runtime: RuntimeSpec): boolean;
+	getSource(module: Module, runtime: RuntimeSpec, sourceType: string): Source;
+	getRuntimeRequirements(
+		module: Module,
+		runtime: RuntimeSpec
+	): ReadonlySet<string>;
+	getData(module: Module, runtime: RuntimeSpec, key: string): any;
+	getHash(module: Module, runtime: RuntimeSpec): any;
+	add(module: Module, runtime: RuntimeSpec, result: CodeGenerationResult): void;
+}
+type CodeValue =
+	| undefined
+	| null
+	| string
+	| number
+	| bigint
+	| boolean
+	| Function
+	| RegExp
+	| RuntimeValue
+	| {
+			[index: string]: RecursiveArrayOrRecord<
+				| undefined
+				| null
+				| string
+				| number
+				| bigint
+				| boolean
+				| Function
+				| RegExp
+				| RuntimeValue
+			>;
+	  }
+	| RecursiveArrayOrRecord<
+			| undefined
+			| null
+			| string
+			| number
+			| bigint
+			| boolean
+			| Function
+			| RegExp
+			| RuntimeValue
+	  >[];
+type CodeValuePrimitive =
+	| undefined
+	| null
+	| string
+	| number
+	| bigint
+	| boolean
+	| Function
+	| RegExp;
+declare interface Comparator<T> {
+	(arg0: T, arg1: T): 0 | 1 | -1;
+}
+declare class CompatSource extends Source {
+	constructor(sourceLike: SourceLike);
+	static from(sourceLike: SourceLike): Source;
+}
+declare class Compilation {
+	/**
+	 * Creates an instance of Compilation.
+	 */
+	constructor(compiler: Compiler, params: CompilationParams);
+	hooks: Readonly<{
+		buildModule: SyncHook<[Module]>;
+		rebuildModule: SyncHook<[Module]>;
+		failedModule: SyncHook<[Module, WebpackError]>;
+		succeedModule: SyncHook<[Module]>;
+		stillValidModule: SyncHook<[Module]>;
+		addEntry: SyncHook<[Dependency, EntryOptions]>;
+		failedEntry: SyncHook<[Dependency, EntryOptions, Error]>;
+		succeedEntry: SyncHook<[Dependency, EntryOptions, Module]>;
+		dependencyReferencedExports: SyncWaterfallHook<
+			[(string[] | ReferencedExport)[], Dependency, RuntimeSpec]
+		>;
+		executeModule: SyncHook<[ExecuteModuleArgument, ExecuteModuleContext]>;
+		prepareModuleExecution: AsyncParallelHook<
+			[ExecuteModuleArgument, ExecuteModuleContext]
+		>;
+		finishModules: AsyncSeriesHook<[Iterable<Module>]>;
+		finishRebuildingModule: AsyncSeriesHook<[Module]>;
+		unseal: SyncHook<[]>;
+		seal: SyncHook<[]>;
+		beforeChunks: SyncHook<[]>;
+		afterChunks: SyncHook<[Iterable<Chunk>]>;
+		optimizeDependencies: SyncBailHook<[Iterable<Module>], any>;
+		afterOptimizeDependencies: SyncHook<[Iterable<Module>]>;
+		optimize: SyncHook<[]>;
+		optimizeModules: SyncBailHook<[Iterable<Module>], any>;
+		afterOptimizeModules: SyncHook<[Iterable<Module>]>;
+		optimizeChunks: SyncBailHook<[Iterable<Chunk>, ChunkGroup[]], any>;
+		afterOptimizeChunks: SyncHook<[Iterable<Chunk>, ChunkGroup[]]>;
+		optimizeTree: AsyncSeriesHook<[Iterable<Chunk>, Iterable<Module>]>;
+		afterOptimizeTree: SyncHook<[Iterable<Chunk>, Iterable<Module>]>;
+		optimizeChunkModules: AsyncSeriesBailHook<
+			[Iterable<Chunk>, Iterable<Module>],
+			any
+		>;
+		afterOptimizeChunkModules: SyncHook<[Iterable<Chunk>, Iterable<Module>]>;
+		shouldRecord: SyncBailHook<[], boolean>;
+		additionalChunkRuntimeRequirements: SyncHook<
+			[Chunk, Set<string>, RuntimeRequirementsContext]
+		>;
+		runtimeRequirementInChunk: HookMap<
+			SyncBailHook<[Chunk, Set<string>, RuntimeRequirementsContext], any>
+		>;
+		additionalModuleRuntimeRequirements: SyncHook<
+			[Module, Set<string>, RuntimeRequirementsContext]
+		>;
+		runtimeRequirementInModule: HookMap<
+			SyncBailHook<[Module, Set<string>, RuntimeRequirementsContext], any>
+		>;
+		additionalTreeRuntimeRequirements: SyncHook<
+			[Chunk, Set<string>, RuntimeRequirementsContext]
+		>;
+		runtimeRequirementInTree: HookMap<
+			SyncBailHook<[Chunk, Set<string>, RuntimeRequirementsContext], any>
+		>;
+		runtimeModule: SyncHook<[RuntimeModule, Chunk]>;
+		reviveModules: SyncHook<[Iterable<Module>, any]>;
+		beforeModuleIds: SyncHook<[Iterable<Module>]>;
+		moduleIds: SyncHook<[Iterable<Module>]>;
+		optimizeModuleIds: SyncHook<[Iterable<Module>]>;
+		afterOptimizeModuleIds: SyncHook<[Iterable<Module>]>;
+		reviveChunks: SyncHook<[Iterable<Chunk>, any]>;
+		beforeChunkIds: SyncHook<[Iterable<Chunk>]>;
+		chunkIds: SyncHook<[Iterable<Chunk>]>;
+		optimizeChunkIds: SyncHook<[Iterable<Chunk>]>;
+		afterOptimizeChunkIds: SyncHook<[Iterable<Chunk>]>;
+		recordModules: SyncHook<[Iterable<Module>, any]>;
+		recordChunks: SyncHook<[Iterable<Chunk>, any]>;
+		optimizeCodeGeneration: SyncHook<[Iterable<Module>]>;
+		beforeModuleHash: SyncHook<[]>;
+		afterModuleHash: SyncHook<[]>;
+		beforeCodeGeneration: SyncHook<[]>;
+		afterCodeGeneration: SyncHook<[]>;
+		beforeRuntimeRequirements: SyncHook<[]>;
+		afterRuntimeRequirements: SyncHook<[]>;
+		beforeHash: SyncHook<[]>;
+		contentHash: SyncHook<[Chunk]>;
+		afterHash: SyncHook<[]>;
+		recordHash: SyncHook<[any]>;
+		record: SyncHook<[Compilation, any]>;
+		beforeModuleAssets: SyncHook<[]>;
+		shouldGenerateChunkAssets: SyncBailHook<[], boolean>;
+		beforeChunkAssets: SyncHook<[]>;
+		additionalChunkAssets: FakeHook<
+			Pick<
+				AsyncSeriesHook<[Set<Chunk>]>,
+				"name" | "tap" | "tapAsync" | "tapPromise"
+			>
+		>;
+		additionalAssets: FakeHook<
+			Pick<AsyncSeriesHook<[]>, "name" | "tap" | "tapAsync" | "tapPromise">
+		>;
+		optimizeChunkAssets: FakeHook<
+			Pick<
+				AsyncSeriesHook<[Set<Chunk>]>,
+				"name" | "tap" | "tapAsync" | "tapPromise"
+			>
+		>;
+		afterOptimizeChunkAssets: FakeHook<
+			Pick<
+				AsyncSeriesHook<[Set<Chunk>]>,
+				"name" | "tap" | "tapAsync" | "tapPromise"
+			>
+		>;
+		optimizeAssets: AsyncSeriesHook<
+			[CompilationAssets],
+			ProcessAssetsAdditionalOptions
+		>;
+		afterOptimizeAssets: SyncHook<[CompilationAssets]>;
+		processAssets: AsyncSeriesHook<
+			[CompilationAssets],
+			ProcessAssetsAdditionalOptions
+		>;
+		afterProcessAssets: SyncHook<[CompilationAssets]>;
+		processAdditionalAssets: AsyncSeriesHook<[CompilationAssets]>;
+		needAdditionalSeal: SyncBailHook<[], boolean>;
+		afterSeal: AsyncSeriesHook<[]>;
+		renderManifest: SyncWaterfallHook<
+			[RenderManifestEntry[], RenderManifestOptions]
+		>;
+		fullHash: SyncHook<[Hash]>;
+		chunkHash: SyncHook<[Chunk, Hash, ChunkHashContext]>;
+		moduleAsset: SyncHook<[Module, string]>;
+		chunkAsset: SyncHook<[Chunk, string]>;
+		assetPath: SyncWaterfallHook<[string, object, AssetInfo]>;
+		needAdditionalPass: SyncBailHook<[], boolean>;
+		childCompiler: SyncHook<[Compiler, string, number]>;
+		log: SyncBailHook<[string, LogEntry], true>;
+		processWarnings: SyncWaterfallHook<[WebpackError[]]>;
+		processErrors: SyncWaterfallHook<[WebpackError[]]>;
+		statsPreset: HookMap<
+			SyncHook<[Partial<NormalizedStatsOptions>, CreateStatsOptionsContext]>
+		>;
+		statsNormalize: SyncHook<
+			[Partial<NormalizedStatsOptions>, CreateStatsOptionsContext]
+		>;
+		statsFactory: SyncHook<[StatsFactory, NormalizedStatsOptions]>;
+		statsPrinter: SyncHook<[StatsPrinter, NormalizedStatsOptions]>;
+		readonly normalModuleLoader: SyncHook<[object, NormalModule]>;
+	}>;
+	name?: string;
+	startTime: any;
+	endTime: any;
+	compiler: Compiler;
+	resolverFactory: ResolverFactory;
+	inputFileSystem: InputFileSystem;
+	fileSystemInfo: FileSystemInfo;
+	valueCacheVersions: Map<string, string | Set<string>>;
+	requestShortener: RequestShortener;
+	compilerPath: string;
+	logger: WebpackLogger;
+	options: WebpackOptionsNormalized;
+	outputOptions: OutputNormalized;
+	bail: boolean;
+	profile: boolean;
+	params: CompilationParams;
+	mainTemplate: MainTemplate;
+	chunkTemplate: ChunkTemplate;
+	runtimeTemplate: RuntimeTemplate;
+	moduleTemplates: { javascript: ModuleTemplate };
+	moduleMemCaches?: Map<Module, WeakTupleMap<any, any>>;
+	moduleMemCaches2?: Map<Module, WeakTupleMap<any, any>>;
+	moduleGraph: ModuleGraph;
+	chunkGraph: ChunkGraph;
+	codeGenerationResults: CodeGenerationResults;
+	processDependenciesQueue: AsyncQueue<Module, Module, Module>;
+	addModuleQueue: AsyncQueue<Module, string, Module>;
+	factorizeQueue: AsyncQueue<
+		FactorizeModuleOptions,
+		string,
+		Module | ModuleFactoryResult
+	>;
+	buildQueue: AsyncQueue<Module, Module, Module>;
+	rebuildQueue: AsyncQueue<Module, Module, Module>;
+
+	/**
+	 * Modules in value are building during the build of Module in key.
+	 * Means value blocking key from finishing.
+	 * Needed to detect build cycles.
+	 */
+	creatingModuleDuringBuild: WeakMap<Module, Set<Module>>;
+	entries: Map<string, EntryData>;
+	globalEntry: EntryData;
+	entrypoints: Map<string, Entrypoint>;
+	asyncEntrypoints: Entrypoint[];
+	chunks: Set<Chunk>;
+	chunkGroups: ChunkGroup[];
+	namedChunkGroups: Map<string, ChunkGroup>;
+	namedChunks: Map<string, Chunk>;
+	modules: Set<Module>;
+	records: any;
+	additionalChunkAssets: string[];
+	assets: CompilationAssets;
+	assetsInfo: Map<string, AssetInfo>;
+	errors: WebpackError[];
+	warnings: WebpackError[];
+	children: Compilation[];
+	logging: Map<string, LogEntry[]>;
+	dependencyFactories: Map<DepConstructor, ModuleFactory>;
+	dependencyTemplates: DependencyTemplates;
+	childrenCounters: object;
+	usedChunkIds: Set<string | number>;
+	usedModuleIds: Set<number>;
+	needAdditionalPass: boolean;
+	builtModules: WeakSet<Module>;
+	codeGeneratedModules: WeakSet<Module>;
+	buildTimeExecutedModules: WeakSet<Module>;
+	emittedAssets: Set<string>;
+	comparedForEmitAssets: Set<string>;
+	fileDependencies: LazySet<string>;
+	contextDependencies: LazySet<string>;
+	missingDependencies: LazySet<string>;
+	buildDependencies: LazySet<string>;
+	compilationDependencies: { add: (item?: any) => LazySet<string> };
+	getStats(): Stats;
+	createStatsOptions(
+		optionsOrPreset: string | StatsOptions,
+		context?: CreateStatsOptionsContext
+	): NormalizedStatsOptions;
+	createStatsFactory(options?: any): StatsFactory;
+	createStatsPrinter(options?: any): StatsPrinter;
+	getCache(name: string): CacheFacade;
+	getLogger(name: string | (() => string)): WebpackLogger;
+	addModule(
+		module: Module,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+
+	/**
+	 * Fetches a module from a compilation by its identifier
+	 */
+	getModule(module: Module): Module;
+
+	/**
+	 * Attempts to search for a module by its identifier
+	 */
+	findModule(identifier: string): undefined | Module;
+
+	/**
+	 * Schedules a build of the module object
+	 */
+	buildModule(
+		module: Module,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	processModuleDependencies(
+		module: Module,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	processModuleDependenciesNonRecursive(module: Module): void;
+	handleModuleCreation(
+		__0: HandleModuleCreationOptions,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	addModuleChain(
+		context: string,
+		dependency: Dependency,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	addModuleTree(
+		__0: {
+			/**
+			 * context string path
+			 */
+			context: string;
+			/**
+			 * dependency used to create Module chain
+			 */
+			dependency: Dependency;
+			/**
+			 * additional context info for the root module
+			 */
+			contextInfo?: Partial<ModuleFactoryCreateDataContextInfo>;
+		},
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	addEntry(
+		context: string,
+		entry: Dependency,
+		optionsOrName: string | EntryOptions,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	addInclude(
+		context: string,
+		dependency: Dependency,
+		options: EntryOptions,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	rebuildModule(
+		module: Module,
+		callback: (err?: null | WebpackError, result?: Module) => void
+	): void;
+	finish(callback?: any): void;
+	unseal(): void;
+	seal(callback: (err?: null | WebpackError) => void): void;
+	reportDependencyErrorsAndWarnings(
+		module: Module,
+		blocks: DependenciesBlock[]
+	): boolean;
+	codeGeneration(callback?: any): void;
+	processRuntimeRequirements(__0?: {
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph?: ChunkGraph;
+		/**
+		 * modules
+		 */
+		modules?: Iterable<Module>;
+		/**
+		 * chunks
+		 */
+		chunks?: Iterable<Chunk>;
+		/**
+		 * codeGenerationResults
+		 */
+		codeGenerationResults?: CodeGenerationResults;
+		/**
+		 * chunkGraphEntries
+		 */
+		chunkGraphEntries?: Iterable<Chunk>;
+	}): void;
+	addRuntimeModule(
+		chunk: Chunk,
+		module: RuntimeModule,
+		chunkGraph?: ChunkGraph
+	): void;
+
+	/**
+	 * If `module` is passed, `loc` and `request` must also be passed.
+	 */
+	addChunkInGroup(
+		groupOptions: string | ChunkGroupOptions,
+		module?: Module,
+		loc?: SyntheticDependencyLocation | RealDependencyLocation,
+		request?: string
+	): ChunkGroup;
+	addAsyncEntrypoint(
+		options: EntryOptions,
+		module: Module,
+		loc: DependencyLocation,
+		request: string
+	): Entrypoint;
+
+	/**
+	 * This method first looks to see if a name is provided for a new chunk,
+	 * and first looks to see if any named chunks already exist and reuse that chunk instead.
+	 */
+	addChunk(name?: string): Chunk;
+	assignDepth(module: Module): void;
+	assignDepths(modules: Set<Module>): void;
+	getDependencyReferencedExports(
+		dependency: Dependency,
+		runtime: RuntimeSpec
+	): (string[] | ReferencedExport)[];
+	removeReasonsOfDependencyBlock(
+		module: Module,
+		block: DependenciesBlockLike
+	): void;
+	patchChunksAfterReasonRemoval(module: Module, chunk: Chunk): void;
+	removeChunkFromDependencies(block: DependenciesBlock, chunk: Chunk): void;
+	assignRuntimeIds(): void;
+	sortItemsWithChunkIds(): void;
+	summarizeDependencies(): void;
+	createModuleHashes(): void;
+	createHash(): {
+		module: Module;
+		hash: string;
+		runtime: RuntimeSpec;
+		runtimes: RuntimeSpec[];
+	}[];
+	fullHash?: string;
+	hash?: string;
+	emitAsset(file: string, source: Source, assetInfo?: AssetInfo): void;
+	updateAsset(
+		file: string,
+		newSourceOrFunction: Source | ((arg0: Source) => Source),
+		assetInfoUpdateOrFunction?: AssetInfo | ((arg0?: AssetInfo) => AssetInfo)
+	): void;
+	renameAsset(file?: any, newFile?: any): void;
+	deleteAsset(file: string): void;
+	getAssets(): Readonly<Asset>[];
+	getAsset(name: string): undefined | Readonly<Asset>;
+	clearAssets(): void;
+	createModuleAssets(): void;
+	getRenderManifest(options: RenderManifestOptions): RenderManifestEntry[];
+	createChunkAssets(callback: (err?: null | WebpackError) => void): void;
+	getPath(
+		filename: string | ((arg0: PathData, arg1?: AssetInfo) => string),
+		data?: PathData
+	): string;
+	getPathWithInfo(
+		filename: string | ((arg0: PathData, arg1?: AssetInfo) => string),
+		data?: PathData
+	): { path: string; info: AssetInfo };
+	getAssetPath(
+		filename: string | ((arg0: PathData, arg1?: AssetInfo) => string),
+		data: PathData
+	): string;
+	getAssetPathWithInfo(
+		filename: string | ((arg0: PathData, arg1?: AssetInfo) => string),
+		data: PathData
+	): { path: string; info: AssetInfo };
+	getWarnings(): WebpackError[];
+	getErrors(): WebpackError[];
+
+	/**
+	 * This function allows you to run another instance of webpack inside of webpack however as
+	 * a child with different settings and configurations (if desired) applied. It copies all hooks, plugins
+	 * from parent (or top level compiler) and creates a child Compilation
+	 */
+	createChildCompiler(
+		name: string,
+		outputOptions?: OutputNormalized,
+		plugins?: (
+			| ((this: Compiler, compiler: Compiler) => void)
+			| WebpackPluginInstance
+		)[]
+	): Compiler;
+	executeModule(
+		module: Module,
+		options: ExecuteModuleOptions,
+		callback: (err?: null | WebpackError, result?: ExecuteModuleResult) => void
+	): void;
+	checkConstraints(): void;
+	factorizeModule: {
+		(
+			options: FactorizeModuleOptions & { factoryResult?: false },
+			callback: (err?: null | WebpackError, result?: Module) => void
+		): void;
+		(
+			options: FactorizeModuleOptions & { factoryResult: true },
+			callback: (
+				err?: null | WebpackError,
+				result?: ModuleFactoryResult
+			) => void
+		): void;
+	};
+
+	/**
+	 * Add additional assets to the compilation.
+	 */
+	static PROCESS_ASSETS_STAGE_ADDITIONAL: number;
+
+	/**
+	 * Basic preprocessing of assets.
+	 */
+	static PROCESS_ASSETS_STAGE_PRE_PROCESS: number;
+
+	/**
+	 * Derive new assets from existing assets.
+	 * Existing assets should not be treated as complete.
+	 */
+	static PROCESS_ASSETS_STAGE_DERIVED: number;
+
+	/**
+	 * Add additional sections to existing assets, like a banner or initialization code.
+	 */
+	static PROCESS_ASSETS_STAGE_ADDITIONS: number;
+
+	/**
+	 * Optimize existing assets in a general way.
+	 */
+	static PROCESS_ASSETS_STAGE_OPTIMIZE: number;
+
+	/**
+	 * Optimize the count of existing assets, e. g. by merging them.
+	 * Only assets of the same type should be merged.
+	 * For assets of different types see PROCESS_ASSETS_STAGE_OPTIMIZE_INLINE.
+	 */
+	static PROCESS_ASSETS_STAGE_OPTIMIZE_COUNT: number;
+
+	/**
+	 * Optimize the compatibility of existing assets, e. g. add polyfills or vendor-prefixes.
+	 */
+	static PROCESS_ASSETS_STAGE_OPTIMIZE_COMPATIBILITY: number;
+
+	/**
+	 * Optimize the size of existing assets, e. g. by minimizing or omitting whitespace.
+	 */
+	static PROCESS_ASSETS_STAGE_OPTIMIZE_SIZE: number;
+
+	/**
+	 * Add development tooling to assets, e. g. by extracting a SourceMap.
+	 */
+	static PROCESS_ASSETS_STAGE_DEV_TOOLING: number;
+
+	/**
+	 * Optimize the count of existing assets, e. g. by inlining assets of into other assets.
+	 * Only assets of different types should be inlined.
+	 * For assets of the same type see PROCESS_ASSETS_STAGE_OPTIMIZE_COUNT.
+	 */
+	static PROCESS_ASSETS_STAGE_OPTIMIZE_INLINE: number;
+
+	/**
+	 * Summarize the list of existing assets
+	 * e. g. creating an assets manifest of Service Workers.
+	 */
+	static PROCESS_ASSETS_STAGE_SUMMARIZE: number;
+
+	/**
+	 * Optimize the hashes of the assets, e. g. by generating real hashes of the asset content.
+	 */
+	static PROCESS_ASSETS_STAGE_OPTIMIZE_HASH: number;
+
+	/**
+	 * Optimize the transfer of existing assets, e. g. by preparing a compressed (gzip) file as separate asset.
+	 */
+	static PROCESS_ASSETS_STAGE_OPTIMIZE_TRANSFER: number;
+
+	/**
+	 * Analyse existing assets.
+	 */
+	static PROCESS_ASSETS_STAGE_ANALYSE: number;
+
+	/**
+	 * Creating assets for reporting purposes.
+	 */
+	static PROCESS_ASSETS_STAGE_REPORT: number;
+}
+declare interface CompilationAssets {
+	[index: string]: Source;
+}
+declare interface CompilationHooksAsyncWebAssemblyModulesPlugin {
+	renderModuleContent: SyncWaterfallHook<
+		[Source, Module, WebAssemblyRenderContext]
+	>;
+}
+declare interface CompilationHooksJavascriptModulesPlugin {
+	renderModuleContent: SyncWaterfallHook<[Source, Module, ChunkRenderContext]>;
+	renderModuleContainer: SyncWaterfallHook<
+		[Source, Module, ChunkRenderContext]
+	>;
+	renderModulePackage: SyncWaterfallHook<[Source, Module, ChunkRenderContext]>;
+	renderChunk: SyncWaterfallHook<[Source, RenderContext]>;
+	renderMain: SyncWaterfallHook<[Source, RenderContext]>;
+	renderContent: SyncWaterfallHook<[Source, RenderContext]>;
+	render: SyncWaterfallHook<[Source, RenderContext]>;
+	renderStartup: SyncWaterfallHook<[Source, Module, StartupRenderContext]>;
+	renderRequire: SyncWaterfallHook<[string, RenderBootstrapContext]>;
+	inlineInRuntimeBailout: SyncBailHook<
+		[Module, RenderBootstrapContext],
+		string
+	>;
+	embedInRuntimeBailout: SyncBailHook<[Module, RenderContext], string>;
+	strictRuntimeBailout: SyncBailHook<[RenderContext], string>;
+	chunkHash: SyncHook<[Chunk, Hash, ChunkHashContext]>;
+	useSourceMap: SyncBailHook<[Chunk, RenderContext], boolean>;
+}
+declare interface CompilationHooksRealContentHashPlugin {
+	updateHash: SyncBailHook<[Buffer[], string], string>;
+}
+declare interface CompilationParams {
+	normalModuleFactory: NormalModuleFactory;
+	contextModuleFactory: ContextModuleFactory;
+}
+declare class Compiler {
+	constructor(context: string, options?: WebpackOptionsNormalized);
+	hooks: Readonly<{
+		initialize: SyncHook<[]>;
+		shouldEmit: SyncBailHook<[Compilation], boolean>;
+		done: AsyncSeriesHook<[Stats]>;
+		afterDone: SyncHook<[Stats]>;
+		additionalPass: AsyncSeriesHook<[]>;
+		beforeRun: AsyncSeriesHook<[Compiler]>;
+		run: AsyncSeriesHook<[Compiler]>;
+		emit: AsyncSeriesHook<[Compilation]>;
+		assetEmitted: AsyncSeriesHook<[string, AssetEmittedInfo]>;
+		afterEmit: AsyncSeriesHook<[Compilation]>;
+		thisCompilation: SyncHook<[Compilation, CompilationParams]>;
+		compilation: SyncHook<[Compilation, CompilationParams]>;
+		normalModuleFactory: SyncHook<[NormalModuleFactory]>;
+		contextModuleFactory: SyncHook<[ContextModuleFactory]>;
+		beforeCompile: AsyncSeriesHook<[CompilationParams]>;
+		compile: SyncHook<[CompilationParams]>;
+		make: AsyncParallelHook<[Compilation]>;
+		finishMake: AsyncParallelHook<[Compilation]>;
+		afterCompile: AsyncSeriesHook<[Compilation]>;
+		readRecords: AsyncSeriesHook<[]>;
+		emitRecords: AsyncSeriesHook<[]>;
+		watchRun: AsyncSeriesHook<[Compiler]>;
+		failed: SyncHook<[Error]>;
+		invalid: SyncHook<[null | string, number]>;
+		watchClose: SyncHook<[]>;
+		shutdown: AsyncSeriesHook<[]>;
+		infrastructureLog: SyncBailHook<[string, string, any[]], true>;
+		environment: SyncHook<[]>;
+		afterEnvironment: SyncHook<[]>;
+		afterPlugins: SyncHook<[Compiler]>;
+		afterResolvers: SyncHook<[Compiler]>;
+		entryOption: SyncBailHook<[string, EntryNormalized], boolean>;
+	}>;
+	webpack: typeof exports;
+	name?: string;
+	parentCompilation?: Compilation;
+	root: Compiler;
+	outputPath: string;
+	watching: Watching;
+	outputFileSystem: OutputFileSystem;
+	intermediateFileSystem: IntermediateFileSystem;
+	inputFileSystem: InputFileSystem;
+	watchFileSystem: WatchFileSystem;
+	recordsInputPath: null | string;
+	recordsOutputPath: null | string;
+	records: object;
+	managedPaths: Set<string | RegExp>;
+	immutablePaths: Set<string | RegExp>;
+	modifiedFiles: ReadonlySet<string>;
+	removedFiles: ReadonlySet<string>;
+	fileTimestamps: ReadonlyMap<string, null | FileSystemInfoEntry | "ignore">;
+	contextTimestamps: ReadonlyMap<string, null | FileSystemInfoEntry | "ignore">;
+	fsStartTime: number;
+	resolverFactory: ResolverFactory;
+	infrastructureLogger: any;
+	options: WebpackOptionsNormalized;
+	context: string;
+	requestShortener: RequestShortener;
+	cache: Cache;
+	moduleMemCaches?: Map<
+		Module,
+		{
+			buildInfo: object;
+			references: WeakMap<Dependency, Module>;
+			memCache: WeakTupleMap<any, any>;
+		}
+	>;
+	compilerPath: string;
+	running: boolean;
+	idle: boolean;
+	watchMode: boolean;
+	getCache(name: string): CacheFacade;
+	getInfrastructureLogger(name: string | (() => string)): WebpackLogger;
+	watch(watchOptions: WatchOptions, handler: CallbackFunction<Stats>): Watching;
+	run(callback: CallbackFunction<Stats>): void;
+	runAsChild(
+		callback: (
+			err?: null | Error,
+			entries?: Chunk[],
+			compilation?: Compilation
+		) => any
+	): void;
+	purgeInputFileSystem(): void;
+	emitAssets(compilation: Compilation, callback: CallbackFunction<void>): void;
+	emitRecords(callback: CallbackFunction<void>): void;
+	readRecords(callback: CallbackFunction<void>): void;
+	createChildCompiler(
+		compilation: Compilation,
+		compilerName: string,
+		compilerIndex: number,
+		outputOptions?: OutputNormalized,
+		plugins?: WebpackPluginInstance[]
+	): Compiler;
+	isChild(): boolean;
+	createCompilation(params?: any): Compilation;
+	newCompilation(params: CompilationParams): Compilation;
+	createNormalModuleFactory(): NormalModuleFactory;
+	createContextModuleFactory(): ContextModuleFactory;
+	newCompilationParams(): {
+		normalModuleFactory: NormalModuleFactory;
+		contextModuleFactory: ContextModuleFactory;
+	};
+	compile(callback: CallbackFunction<Compilation>): void;
+	close(callback: CallbackFunction<void>): void;
+}
+declare class ConcatSource extends Source {
+	constructor(...args: (string | Source)[]);
+	getChildren(): Source[];
+	add(item: string | Source): void;
+	addAllSkipOptimizing(items: Source[]): void;
+}
+declare interface ConcatenatedModuleInfo {
+	index: number;
+	module: Module;
+
+	/**
+	 * mapping from export name to symbol
+	 */
+	exportMap: Map<string, string>;
+
+	/**
+	 * mapping from export name to symbol
+	 */
+	rawExportMap: Map<string, string>;
+	namespaceExportSymbol?: string;
+}
+declare interface ConcatenationBailoutReasonContext {
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+}
+declare class ConcatenationScope {
+	constructor(
+		modulesMap: ModuleInfo[] | Map<Module, ModuleInfo>,
+		currentModule: ConcatenatedModuleInfo
+	);
+	isModuleInScope(module: Module): boolean;
+	registerExport(exportName: string, symbol: string): void;
+	registerRawExport(exportName: string, expression: string): void;
+	registerNamespaceExport(symbol: string): void;
+	createModuleReference(
+		module: Module,
+		__1: Partial<ModuleReferenceOptions>
+	): string;
+	static isModuleReference(name: string): boolean;
+	static matchModuleReference(
+		name: string
+	): ModuleReferenceOptions & { index: number };
+	static DEFAULT_EXPORT: string;
+	static NAMESPACE_OBJECT_EXPORT: string;
+}
+
+/**
+ * Options object as provided by the user.
+ */
+declare interface Configuration {
+	/**
+	 * Set the value of `require.amd` and `define.amd`. Or disable AMD support.
+	 */
+	amd?: false | { [index: string]: any };
+
+	/**
+	 * Report the first error as a hard error instead of tolerating it.
+	 */
+	bail?: boolean;
+
+	/**
+	 * Cache generated modules and chunks to improve performance for multiple incremental builds.
+	 */
+	cache?: boolean | FileCacheOptions | MemoryCacheOptions;
+
+	/**
+	 * The base directory (absolute path!) for resolving the `entry` option. If `output.pathinfo` is set, the included pathinfo is shortened to this directory.
+	 */
+	context?: string;
+
+	/**
+	 * References to other configurations to depend on.
+	 */
+	dependencies?: string[];
+
+	/**
+	 * A developer tool to enhance debugging (false | eval | [inline-|hidden-|eval-][nosources-][cheap-[module-]]source-map).
+	 */
+	devtool?: string | false;
+
+	/**
+	 * The entry point(s) of the compilation.
+	 */
+	entry?:
+		| string
+		| (() => string | EntryObject | string[] | Promise<EntryStatic>)
+		| EntryObject
+		| string[];
+
+	/**
+	 * Enables/Disables experiments (experimental features with relax SemVer compatibility).
+	 */
+	experiments?: Experiments;
+
+	/**
+	 * Specify dependencies that shouldn't be resolved by webpack, but should become dependencies of the resulting bundle. The kind of the dependency depends on `output.libraryTarget`.
+	 */
+	externals?:
+		| string
+		| RegExp
+		| ExternalItem[]
+		| (ExternalItemObjectKnown & ExternalItemObjectUnknown)
+		| ((
+				data: ExternalItemFunctionData,
+				callback: (
+					err?: Error,
+					result?: string | boolean | string[] | { [index: string]: any }
+				) => void
+		  ) => void)
+		| ((data: ExternalItemFunctionData) => Promise<ExternalItemValue>);
+
+	/**
+	 * Enable presets of externals for specific targets.
+	 */
+	externalsPresets?: ExternalsPresets;
+
+	/**
+	 * Specifies the default type of externals ('amd*', 'umd*', 'system' and 'jsonp' depend on output.libraryTarget set to the same value).
+	 */
+	externalsType?:
+		| "import"
+		| "var"
+		| "module"
+		| "assign"
+		| "this"
+		| "window"
+		| "self"
+		| "global"
+		| "commonjs"
+		| "commonjs2"
+		| "commonjs-module"
+		| "commonjs-static"
+		| "amd"
+		| "amd-require"
+		| "umd"
+		| "umd2"
+		| "jsonp"
+		| "system"
+		| "promise"
+		| "script"
+		| "node-commonjs";
+
+	/**
+	 * Ignore specific warnings.
+	 */
+	ignoreWarnings?: (
+		| RegExp
+		| {
+				/**
+				 * A RegExp to select the origin file for the warning.
+				 */
+				file?: RegExp;
+				/**
+				 * A RegExp to select the warning message.
+				 */
+				message?: RegExp;
+				/**
+				 * A RegExp to select the origin module for the warning.
+				 */
+				module?: RegExp;
+		  }
+		| ((warning: WebpackError, compilation: Compilation) => boolean)
+	)[];
+
+	/**
+	 * Options for infrastructure level logging.
+	 */
+	infrastructureLogging?: InfrastructureLogging;
+
+	/**
+	 * Custom values available in the loader context.
+	 */
+	loader?: Loader;
+
+	/**
+	 * Enable production optimizations or development hints.
+	 */
+	mode?: "none" | "development" | "production";
+
+	/**
+	 * Options affecting the normal modules (`NormalModuleFactory`).
+	 */
+	module?: ModuleOptions;
+
+	/**
+	 * Name of the configuration. Used when loading multiple configurations.
+	 */
+	name?: string;
+
+	/**
+	 * Include polyfills or mocks for various node stuff.
+	 */
+	node?: false | NodeOptions;
+
+	/**
+	 * Enables/Disables integrated optimizations.
+	 */
+	optimization?: Optimization;
+
+	/**
+	 * Options affecting the output of the compilation. `output` options tell webpack how to write the compiled files to disk.
+	 */
+	output?: Output;
+
+	/**
+	 * The number of parallel processed modules in the compilation.
+	 */
+	parallelism?: number;
+
+	/**
+	 * Configuration for web performance recommendations.
+	 */
+	performance?: false | PerformanceOptions;
+
+	/**
+	 * Add additional plugins to the compiler.
+	 */
+	plugins?: (
+		| ((this: Compiler, compiler: Compiler) => void)
+		| WebpackPluginInstance
+	)[];
+
+	/**
+	 * Capture timing information for each module.
+	 */
+	profile?: boolean;
+
+	/**
+	 * Store compiler state to a json file.
+	 */
+	recordsInputPath?: string | false;
+
+	/**
+	 * Load compiler state from a json file.
+	 */
+	recordsOutputPath?: string | false;
+
+	/**
+	 * Store/Load compiler state from/to a json file. This will result in persistent ids of modules and chunks. An absolute path is expected. `recordsPath` is used for `recordsInputPath` and `recordsOutputPath` if they left undefined.
+	 */
+	recordsPath?: string | false;
+
+	/**
+	 * Options for the resolver.
+	 */
+	resolve?: ResolveOptionsWebpackOptions;
+
+	/**
+	 * Options for the resolver when resolving loaders.
+	 */
+	resolveLoader?: ResolveOptionsWebpackOptions;
+
+	/**
+	 * Options affecting how file system snapshots are created and validated.
+	 */
+	snapshot?: SnapshotOptions;
+
+	/**
+	 * Stats options object or preset name.
+	 */
+	stats?:
+		| boolean
+		| StatsOptions
+		| "none"
+		| "verbose"
+		| "summary"
+		| "errors-only"
+		| "errors-warnings"
+		| "minimal"
+		| "normal"
+		| "detailed";
+
+	/**
+	 * Environment to build for. An array of environments to build for all of them when possible.
+	 */
+	target?: string | false | string[];
+
+	/**
+	 * Enter watch mode, which rebuilds on file change.
+	 */
+	watch?: boolean;
+
+	/**
+	 * Options for the watcher.
+	 */
+	watchOptions?: WatchOptions;
+}
+type ConnectionState =
+	| boolean
+	| typeof TRANSITIVE_ONLY
+	| typeof CIRCULAR_CONNECTION;
+declare class ConstDependency extends NullDependency {
+	constructor(
+		expression: string,
+		range: number | [number, number],
+		runtimeRequirements?: string[]
+	);
+	expression: string;
+	range: number | [number, number];
+	runtimeRequirements: null | Set<string>;
+	static Template: typeof ConstDependencyTemplate;
+	static NO_EXPORTS_REFERENCED: string[][];
+	static EXPORTS_OBJECT_REFERENCED: string[][];
+	static TRANSITIVE: typeof TRANSITIVE;
+}
+declare class ConstDependencyTemplate extends NullDependencyTemplate {
+	constructor();
+}
+declare interface Constructor {
+	new (...params: any[]): any;
+}
+declare class ConsumeSharedPlugin {
+	constructor(options: ConsumeSharedPluginOptions);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+
+/**
+ * Options for consuming shared modules.
+ */
+declare interface ConsumeSharedPluginOptions {
+	/**
+	 * Modules that should be consumed from share scope. When provided, property names are used to match requested modules in this compilation.
+	 */
+	consumes: Consumes;
+
+	/**
+	 * Share scope name used for all consumed modules (defaults to 'default').
+	 */
+	shareScope?: string;
+}
+type Consumes = (string | ConsumesObject)[] | ConsumesObject;
+
+/**
+ * Advanced configuration for modules that should be consumed from share scope.
+ */
+declare interface ConsumesConfig {
+	/**
+	 * Include the fallback module directly instead behind an async request. This allows to use fallback module in initial load too. All possible shared modules need to be eager too.
+	 */
+	eager?: boolean;
+
+	/**
+	 * Fallback module if no shared module is found in share scope. Defaults to the property name.
+	 */
+	import?: string | false;
+
+	/**
+	 * Package name to determine required version from description file. This is only needed when package name can't be automatically determined from request.
+	 */
+	packageName?: string;
+
+	/**
+	 * Version requirement from module in share scope.
+	 */
+	requiredVersion?: string | false;
+
+	/**
+	 * Module is looked up under this key from the share scope.
+	 */
+	shareKey?: string;
+
+	/**
+	 * Share scope name.
+	 */
+	shareScope?: string;
+
+	/**
+	 * Allow only a single version of the shared module in share scope (disabled by default).
+	 */
+	singleton?: boolean;
+
+	/**
+	 * Do not accept shared module if version is not valid (defaults to yes, if local fallback module is available and shared module is not a singleton, otherwise no, has no effect if there is no required version specified).
+	 */
+	strictVersion?: boolean;
+}
+
+/**
+ * Modules that should be consumed from share scope. Property names are used to match requested modules in this compilation. Relative requests are resolved, module requests are matched unresolved, absolute paths will match resolved requests. A trailing slash will match all requests with this prefix. In this case shareKey must also have a trailing slash.
+ */
+declare interface ConsumesObject {
+	[index: string]: string | ConsumesConfig;
+}
+type ContainerOptionsFormat<T> =
+	| Record<string, string | string[] | T>
+	| (string | Record<string, string | string[] | T>)[];
+declare class ContainerPlugin {
+	constructor(options: ContainerPluginOptions);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface ContainerPluginOptions {
+	/**
+	 * Modules that should be exposed by this container. When provided, property name is used as public name, otherwise public name is automatically inferred from request.
+	 */
+	exposes: Exposes;
+
+	/**
+	 * The filename for this container relative path inside the `output.path` directory.
+	 */
+	filename?: string;
+
+	/**
+	 * Options for library.
+	 */
+	library?: LibraryOptions;
+
+	/**
+	 * The name for this container.
+	 */
+	name: string;
+
+	/**
+	 * The name of the runtime chunk. If set a runtime chunk with this name is created or an existing entrypoint is used as runtime.
+	 */
+	runtime?: string | false;
+
+	/**
+	 * The name of the share scope which is shared with the host (defaults to 'default').
+	 */
+	shareScope?: string;
+}
+declare class ContainerReferencePlugin {
+	constructor(options: ContainerReferencePluginOptions);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface ContainerReferencePluginOptions {
+	/**
+	 * The external type of the remote containers.
+	 */
+	remoteType: ExternalsType;
+
+	/**
+	 * Container locations and request scopes from which modules should be resolved and loaded at runtime. When provided, property name is used as request scope, otherwise request scope is automatically inferred from container location.
+	 */
+	remotes: Remotes;
+
+	/**
+	 * The name of the share scope shared with all remotes (defaults to 'default').
+	 */
+	shareScope?: string;
+}
+declare abstract class ContextElementDependency extends ModuleDependency {
+	referencedExports: any;
+}
+declare class ContextExclusionPlugin {
+	constructor(negativeMatcher: RegExp);
+	negativeMatcher: RegExp;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface ContextFileSystemInfoEntry {
+	safeTime: number;
+	timestampHash?: string;
+	resolved?: ResolvedContextFileSystemInfoEntry;
+	symlinks?: Set<string>;
+}
+declare interface ContextHash {
+	hash: string;
+	resolved?: string;
+	symlinks?: Set<string>;
+}
+type ContextMode =
+	| "weak"
+	| "sync"
+	| "eager"
+	| "async-weak"
+	| "lazy"
+	| "lazy-once";
+declare abstract class ContextModuleFactory extends ModuleFactory {
+	hooks: Readonly<{
+		beforeResolve: AsyncSeriesWaterfallHook<[any]>;
+		afterResolve: AsyncSeriesWaterfallHook<[any]>;
+		contextModuleFiles: SyncWaterfallHook<[string[]]>;
+		alternatives: FakeHook<
+			Pick<
+				AsyncSeriesWaterfallHook<[any[]]>,
+				"name" | "tap" | "tapAsync" | "tapPromise"
+			>
+		>;
+		alternativeRequests: AsyncSeriesWaterfallHook<
+			[any[], ContextModuleOptions]
+		>;
+	}>;
+	resolverFactory: ResolverFactory;
+	resolveDependencies(
+		fs: InputFileSystem,
+		options: ContextModuleOptions,
+		callback: (
+			err?: null | Error,
+			dependencies?: ContextElementDependency[]
+		) => any
+	): void;
+}
+
+declare interface ContextModuleOptions {
+	mode: ContextMode;
+	recursive: boolean;
+	regExp: RegExp;
+	namespaceObject?: boolean | "strict";
+	addon?: string;
+	chunkName?: string;
+	include?: RegExp;
+	exclude?: RegExp;
+	groupOptions?: RawChunkGroupOptions;
+	typePrefix?: string;
+	category?: string;
+
+	/**
+	 * exports referenced from modules (won't be mangled)
+	 */
+	referencedExports?: string[][];
+	resource: string | false | string[];
+	resourceQuery?: string;
+	resourceFragment?: string;
+	resolveOptions: any;
+}
+declare class ContextReplacementPlugin {
+	constructor(
+		resourceRegExp?: any,
+		newContentResource?: any,
+		newContentRecursive?: any,
+		newContentRegExp?: any
+	);
+	resourceRegExp: any;
+	newContentCallback: any;
+	newContentResource: any;
+	newContentCreateContextMap: any;
+	newContentRecursive: any;
+	newContentRegExp: any;
+	apply(compiler?: any): void;
+}
+declare interface ContextTimestampAndHash {
+	safeTime: number;
+	timestampHash?: string;
+	hash: string;
+	resolved?: ResolvedContextTimestampAndHash;
+	symlinks?: Set<string>;
+}
+type CreateStatsOptionsContext = KnownCreateStatsOptionsContext &
+	Record<string, any>;
+
+/**
+ * Options for css handling.
+ */
+declare interface CssExperimentOptions {
+	/**
+	 * Avoid generating and loading a stylesheet and only embed exports from css into output javascript files.
+	 */
+	exportsOnly?: boolean;
+}
+type Declaration = FunctionDeclaration | VariableDeclaration | ClassDeclaration;
+declare class DefinePlugin {
+	/**
+	 * Create a new define plugin
+	 */
+	constructor(definitions: Record<string, CodeValue>);
+	definitions: Record<string, CodeValue>;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static runtimeValue(
+		fn: (arg0: {
+			module: NormalModule;
+			key: string;
+			readonly version?: string;
+		}) => CodeValuePrimitive,
+		options?: true | string[] | RuntimeValueOptions
+	): RuntimeValue;
+}
+declare class DelegatedPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface DepConstructor {
+	new (...args: any[]): Dependency;
+}
+declare abstract class DependenciesBlock {
+	dependencies: Dependency[];
+	blocks: AsyncDependenciesBlock[];
+	parent: DependenciesBlock;
+	getRootBlock(): DependenciesBlock;
+
+	/**
+	 * Adds a DependencyBlock to DependencyBlock relationship.
+	 * This is used for when a Module has a AsyncDependencyBlock tie (for code-splitting)
+	 */
+	addBlock(block: AsyncDependenciesBlock): void;
+	addDependency(dependency: Dependency): void;
+	removeDependency(dependency: Dependency): void;
+
+	/**
+	 * Removes all dependencies and blocks
+	 */
+	clearDependenciesAndBlocks(): void;
+	updateHash(hash: Hash, context: UpdateHashContextDependency): void;
+	serialize(__0: { write: any }): void;
+	deserialize(__0: { read: any }): void;
+}
+declare interface DependenciesBlockLike {
+	dependencies: Dependency[];
+	blocks: AsyncDependenciesBlock[];
+}
+declare class Dependency {
+	constructor();
+	weak: boolean;
+	optional: boolean;
+	readonly type: string;
+	readonly category: string;
+	loc: DependencyLocation;
+	setLoc(
+		startLine?: any,
+		startColumn?: any,
+		endLine?: any,
+		endColumn?: any
+	): void;
+	getResourceIdentifier(): null | string;
+	couldAffectReferencingModule(): boolean | typeof TRANSITIVE;
+
+	/**
+	 * Returns the referenced module and export
+	 */
+	getReference(moduleGraph: ModuleGraph): never;
+
+	/**
+	 * Returns list of exports referenced by this dependency
+	 */
+	getReferencedExports(
+		moduleGraph: ModuleGraph,
+		runtime: RuntimeSpec
+	): (string[] | ReferencedExport)[];
+	getCondition(
+		moduleGraph: ModuleGraph
+	):
+		| null
+		| false
+		| ((arg0: ModuleGraphConnection, arg1: RuntimeSpec) => ConnectionState);
+
+	/**
+	 * Returns the exported names
+	 */
+	getExports(moduleGraph: ModuleGraph): undefined | ExportsSpec;
+
+	/**
+	 * Returns warnings
+	 */
+	getWarnings(moduleGraph: ModuleGraph): WebpackError[];
+
+	/**
+	 * Returns errors
+	 */
+	getErrors(moduleGraph: ModuleGraph): WebpackError[];
+
+	/**
+	 * Update the hash
+	 */
+	updateHash(hash: Hash, context: UpdateHashContextDependency): void;
+
+	/**
+	 * implement this method to allow the occurrence order plugin to count correctly
+	 */
+	getNumberOfIdOccurrences(): number;
+	getModuleEvaluationSideEffectsState(
+		moduleGraph: ModuleGraph
+	): ConnectionState;
+	createIgnoredModule(context: string): Module;
+	serialize(__0: { write: any }): void;
+	deserialize(__0: { read: any }): void;
+	module: any;
+	readonly disconnect: any;
+	static NO_EXPORTS_REFERENCED: string[][];
+	static EXPORTS_OBJECT_REFERENCED: string[][];
+	static TRANSITIVE: typeof TRANSITIVE;
+}
+declare interface DependencyConstructor {
+	new (...args: any[]): Dependency;
+}
+type DependencyLocation = SyntheticDependencyLocation | RealDependencyLocation;
+declare class DependencyTemplate {
+	constructor();
+	apply(
+		dependency: Dependency,
+		source: ReplaceSource,
+		templateContext: DependencyTemplateContext
+	): void;
+}
+declare interface DependencyTemplateContext {
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the dependency templates
+	 */
+	dependencyTemplates: DependencyTemplates;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * the requirements for runtime
+	 */
+	runtimeRequirements: Set<string>;
+
+	/**
+	 * current module
+	 */
+	module: Module;
+
+	/**
+	 * current runtimes, for which code is generated
+	 */
+	runtime: RuntimeSpec;
+
+	/**
+	 * mutable array of init fragments for the current module
+	 */
+	initFragments: InitFragment<GenerateContext>[];
+
+	/**
+	 * when in a concatenated module, information about other concatenated modules
+	 */
+	concatenationScope?: ConcatenationScope;
+
+	/**
+	 * the code generation results
+	 */
+	codeGenerationResults: CodeGenerationResults;
+}
+declare abstract class DependencyTemplates {
+	get(dependency: DependencyConstructor): DependencyTemplate;
+	set(
+		dependency: DependencyConstructor,
+		dependencyTemplate: DependencyTemplate
+	): void;
+	updateHash(part: string): void;
+	getHash(): string;
+	clone(): DependencyTemplates;
+}
+declare class DeterministicChunkIdsPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class DeterministicModuleIdsPlugin {
+	constructor(options?: {
+		/**
+		 * context relative to which module identifiers are computed
+		 */
+		context?: string;
+		/**
+		 * selector function for modules
+		 */
+		test?: (arg0: Module) => boolean;
+		/**
+		 * maximum id length in digits (used as starting point)
+		 */
+		maxLength?: number;
+		/**
+		 * hash salt for ids
+		 */
+		salt?: number;
+		/**
+		 * do not increase the maxLength to find an optimal id space size
+		 */
+		fixedLength?: boolean;
+		/**
+		 * throw an error when id conflicts occur (instead of rehashing)
+		 */
+		failOnConflict?: boolean;
+	});
+	options: {
+		/**
+		 * context relative to which module identifiers are computed
+		 */
+		context?: string;
+		/**
+		 * selector function for modules
+		 */
+		test?: (arg0: Module) => boolean;
+		/**
+		 * maximum id length in digits (used as starting point)
+		 */
+		maxLength?: number;
+		/**
+		 * hash salt for ids
+		 */
+		salt?: number;
+		/**
+		 * do not increase the maxLength to find an optimal id space size
+		 */
+		fixedLength?: boolean;
+		/**
+		 * throw an error when id conflicts occur (instead of rehashing)
+		 */
+		failOnConflict?: boolean;
+	};
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+
+/**
+ * Options for the webpack-dev-server.
+ */
+declare interface DevServer {
+	[index: string]: any;
+}
+declare class DllPlugin {
+	constructor(options: DllPluginOptions);
+	options: {
+		entryOnly: boolean;
+		/**
+		 * Context of requests in the manifest file (defaults to the webpack context).
+		 */
+		context?: string;
+		/**
+		 * If true, manifest json file (output) will be formatted.
+		 */
+		format?: boolean;
+		/**
+		 * Name of the exposed dll function (external name, use value of 'output.library').
+		 */
+		name?: string;
+		/**
+		 * Absolute path to the manifest json file (output).
+		 */
+		path: string;
+		/**
+		 * Type of the dll bundle (external type, use value of 'output.libraryTarget').
+		 */
+		type?: string;
+	};
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface DllPluginOptions {
+	/**
+	 * Context of requests in the manifest file (defaults to the webpack context).
+	 */
+	context?: string;
+
+	/**
+	 * If true, only entry points will be exposed (default: true).
+	 */
+	entryOnly?: boolean;
+
+	/**
+	 * If true, manifest json file (output) will be formatted.
+	 */
+	format?: boolean;
+
+	/**
+	 * Name of the exposed dll function (external name, use value of 'output.library').
+	 */
+	name?: string;
+
+	/**
+	 * Absolute path to the manifest json file (output).
+	 */
+	path: string;
+
+	/**
+	 * Type of the dll bundle (external type, use value of 'output.libraryTarget').
+	 */
+	type?: string;
+}
+declare class DllReferencePlugin {
+	constructor(options: DllReferencePluginOptions);
+	options: DllReferencePluginOptions;
+	apply(compiler?: any): void;
+}
+type DllReferencePluginOptions =
+	| {
+			/**
+			 * Context of requests in the manifest (or content property) as absolute path.
+			 */
+			context?: string;
+			/**
+			 * Extensions used to resolve modules in the dll bundle (only used when using 'scope').
+			 */
+			extensions?: string[];
+			/**
+			 * An object containing content and name or a string to the absolute path of the JSON manifest to be loaded upon compilation.
+			 */
+			manifest: string | DllReferencePluginOptionsManifest;
+			/**
+			 * The name where the dll is exposed (external name, defaults to manifest.name).
+			 */
+			name?: string;
+			/**
+			 * Prefix which is used for accessing the content of the dll.
+			 */
+			scope?: string;
+			/**
+			 * How the dll is exposed (libraryTarget, defaults to manifest.type).
+			 */
+			sourceType?:
+				| "var"
+				| "assign"
+				| "this"
+				| "window"
+				| "global"
+				| "commonjs"
+				| "commonjs2"
+				| "commonjs-module"
+				| "amd"
+				| "amd-require"
+				| "umd"
+				| "umd2"
+				| "jsonp"
+				| "system";
+			/**
+			 * The way how the export of the dll bundle is used.
+			 */
+			type?: "object" | "require";
+	  }
+	| {
+			/**
+			 * The mappings from request to module info.
+			 */
+			content: DllReferencePluginOptionsContent;
+			/**
+			 * Context of requests in the manifest (or content property) as absolute path.
+			 */
+			context?: string;
+			/**
+			 * Extensions used to resolve modules in the dll bundle (only used when using 'scope').
+			 */
+			extensions?: string[];
+			/**
+			 * The name where the dll is exposed (external name).
+			 */
+			name: string;
+			/**
+			 * Prefix which is used for accessing the content of the dll.
+			 */
+			scope?: string;
+			/**
+			 * How the dll is exposed (libraryTarget).
+			 */
+			sourceType?:
+				| "var"
+				| "assign"
+				| "this"
+				| "window"
+				| "global"
+				| "commonjs"
+				| "commonjs2"
+				| "commonjs-module"
+				| "amd"
+				| "amd-require"
+				| "umd"
+				| "umd2"
+				| "jsonp"
+				| "system";
+			/**
+			 * The way how the export of the dll bundle is used.
+			 */
+			type?: "object" | "require";
+	  };
+
+/**
+ * The mappings from request to module info.
+ */
+declare interface DllReferencePluginOptionsContent {
+	[index: string]: {
+		/**
+		 * Meta information about the module.
+		 */
+		buildMeta?: { [index: string]: any };
+		/**
+		 * Information about the provided exports of the module.
+		 */
+		exports?: true | string[];
+		/**
+		 * Module ID.
+		 */
+		id: string | number;
+	};
+}
+
+/**
+ * An object containing content, name and type.
+ */
+declare interface DllReferencePluginOptionsManifest {
+	/**
+	 * The mappings from request to module info.
+	 */
+	content: DllReferencePluginOptionsContent;
+
+	/**
+	 * The name where the dll is exposed (external name).
+	 */
+	name?: string;
+
+	/**
+	 * The type how the dll is exposed (external type).
+	 */
+	type?:
+		| "var"
+		| "assign"
+		| "this"
+		| "window"
+		| "global"
+		| "commonjs"
+		| "commonjs2"
+		| "commonjs-module"
+		| "amd"
+		| "amd-require"
+		| "umd"
+		| "umd2"
+		| "jsonp"
+		| "system";
+}
+declare class DynamicEntryPlugin {
+	constructor(context: string, entry: () => Promise<EntryStaticNormalized>);
+	context: string;
+	entry: () => Promise<EntryStaticNormalized>;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface Effect {
+	type: string;
+	value: any;
+}
+declare class ElectronTargetPlugin {
+	constructor(context?: "main" | "preload" | "renderer");
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+
+/**
+ * No generator options are supported for this module type.
+ */
+declare interface EmptyGeneratorOptions {}
+
+/**
+ * No parser options are supported for this module type.
+ */
+declare interface EmptyParserOptions {}
+declare class EnableChunkLoadingPlugin {
+	constructor(type: string);
+	type: string;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static setEnabled(compiler: Compiler, type: string): void;
+	static checkEnabled(compiler: Compiler, type: string): void;
+}
+declare class EnableLibraryPlugin {
+	constructor(type: string);
+	type: string;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static setEnabled(compiler: Compiler, type: string): void;
+	static checkEnabled(compiler: Compiler, type: string): void;
+}
+type Entry =
+	| string
+	| (() => string | EntryObject | string[] | Promise<EntryStatic>)
+	| EntryObject
+	| string[];
+declare interface EntryData {
+	/**
+	 * dependencies of the entrypoint that should be evaluated at startup
+	 */
+	dependencies: Dependency[];
+
+	/**
+	 * dependencies of the entrypoint that should be included but not evaluated
+	 */
+	includeDependencies: Dependency[];
+
+	/**
+	 * options of the entrypoint
+	 */
+	options: EntryOptions;
+}
+declare abstract class EntryDependency extends ModuleDependency {}
+
+/**
+ * An object with entry point description.
+ */
+declare interface EntryDescription {
+	/**
+	 * Enable/disable creating async chunks that are loaded on demand.
+	 */
+	asyncChunks?: boolean;
+
+	/**
+	 * Base uri for this entry.
+	 */
+	baseUri?: string;
+
+	/**
+	 * The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).
+	 */
+	chunkLoading?: string | false;
+
+	/**
+	 * The entrypoints that the current entrypoint depend on. They must be loaded when this entrypoint is loaded.
+	 */
+	dependOn?: string | string[];
+
+	/**
+	 * Specifies the filename of the output file on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	filename?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Module(s) that are loaded upon startup.
+	 */
+	import: EntryItem;
+
+	/**
+	 * Specifies the layer in which modules of this entrypoint are placed.
+	 */
+	layer?: null | string;
+
+	/**
+	 * Options for library.
+	 */
+	library?: LibraryOptions;
+
+	/**
+	 * The 'publicPath' specifies the public URL address of the output files when referenced in a browser.
+	 */
+	publicPath?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * The name of the runtime chunk. If set a runtime chunk with this name is created or an existing entrypoint is used as runtime.
+	 */
+	runtime?: string | false;
+
+	/**
+	 * The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).
+	 */
+	wasmLoading?: string | false;
+}
+
+/**
+ * An object with entry point description.
+ */
+declare interface EntryDescriptionNormalized {
+	/**
+	 * Enable/disable creating async chunks that are loaded on demand.
+	 */
+	asyncChunks?: boolean;
+
+	/**
+	 * Base uri for this entry.
+	 */
+	baseUri?: string;
+
+	/**
+	 * The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).
+	 */
+	chunkLoading?: string | false;
+
+	/**
+	 * The entrypoints that the current entrypoint depend on. They must be loaded when this entrypoint is loaded.
+	 */
+	dependOn?: string[];
+
+	/**
+	 * Specifies the filename of output files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	filename?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Module(s) that are loaded upon startup. The last one is exported.
+	 */
+	import?: string[];
+
+	/**
+	 * Specifies the layer in which modules of this entrypoint are placed.
+	 */
+	layer?: null | string;
+
+	/**
+	 * Options for library.
+	 */
+	library?: LibraryOptions;
+
+	/**
+	 * The 'publicPath' specifies the public URL address of the output files when referenced in a browser.
+	 */
+	publicPath?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * The name of the runtime chunk. If set a runtime chunk with this name is created or an existing entrypoint is used as runtime.
+	 */
+	runtime?: string | false;
+
+	/**
+	 * The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).
+	 */
+	wasmLoading?: string | false;
+}
+type EntryItem = string | string[];
+type EntryNormalized =
+	| (() => Promise<EntryStaticNormalized>)
+	| EntryStaticNormalized;
+
+/**
+ * Multiple entry bundles are created. The key is the entry name. The value can be a string, an array or an entry description object.
+ */
+declare interface EntryObject {
+	[index: string]: string | string[] | EntryDescription;
+}
+declare class EntryOptionPlugin {
+	constructor();
+	apply(compiler: Compiler): void;
+	static applyEntryOption(
+		compiler: Compiler,
+		context: string,
+		entry: EntryNormalized
+	): void;
+	static entryDescriptionToOptions(
+		compiler: Compiler,
+		name: string,
+		desc: EntryDescriptionNormalized
+	): EntryOptions;
+}
+type EntryOptions = { name?: string } & Omit<
+	EntryDescriptionNormalized,
+	"import"
+>;
+declare class EntryPlugin {
+	/**
+	 * An entry plugin which will handle
+	 * creation of the EntryDependency
+	 */
+	constructor(context: string, entry: string, options?: string | EntryOptions);
+	context: string;
+	entry: string;
+	options: string | EntryOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static createDependency(
+		entry: string,
+		options: string | EntryOptions
+	): EntryDependency;
+}
+type EntryStatic = string | EntryObject | string[];
+
+/**
+ * Multiple entry bundles are created. The key is the entry name. The value is an entry description object.
+ */
+declare interface EntryStaticNormalized {
+	[index: string]: EntryDescriptionNormalized;
+}
+declare abstract class Entrypoint extends ChunkGroup {
+	/**
+	 * Sets the runtimeChunk for an entrypoint.
+	 */
+	setRuntimeChunk(chunk: Chunk): void;
+
+	/**
+	 * Fetches the chunk reference containing the webpack bootstrap code
+	 */
+	getRuntimeChunk(): null | Chunk;
+
+	/**
+	 * Sets the chunk with the entrypoint modules for an entrypoint.
+	 */
+	setEntrypointChunk(chunk: Chunk): void;
+
+	/**
+	 * Returns the chunk which contains the entrypoint modules
+	 * (or at least the execution of them)
+	 */
+	getEntrypointChunk(): Chunk;
+}
+
+/**
+ * The abilities of the environment where the webpack generated code should run.
+ */
+declare interface Environment {
+	/**
+	 * The environment supports arrow functions ('() => { ... }').
+	 */
+	arrowFunction?: boolean;
+
+	/**
+	 * The environment supports BigInt as literal (123n).
+	 */
+	bigIntLiteral?: boolean;
+
+	/**
+	 * The environment supports const and let for variable declarations.
+	 */
+	const?: boolean;
+
+	/**
+	 * The environment supports destructuring ('{ a, b } = obj').
+	 */
+	destructuring?: boolean;
+
+	/**
+	 * The environment supports an async import() function to import EcmaScript modules.
+	 */
+	dynamicImport?: boolean;
+
+	/**
+	 * The environment supports 'for of' iteration ('for (const x of array) { ... }').
+	 */
+	forOf?: boolean;
+
+	/**
+	 * The environment supports EcmaScript Module syntax to import EcmaScript modules (import ... from '...').
+	 */
+	module?: boolean;
+
+	/**
+	 * The environment supports optional chaining ('obj?.a' or 'obj?.()').
+	 */
+	optionalChaining?: boolean;
+
+	/**
+	 * The environment supports template literals.
+	 */
+	templateLiteral?: boolean;
+}
+declare class EnvironmentPlugin {
+	constructor(...keys: any[]);
+	keys: any[];
+	defaultValues: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface Etag {
+	toString: () => string;
+}
+declare class EvalDevToolModulePlugin {
+	constructor(options?: any);
+	namespace: any;
+	sourceUrlComment: any;
+	moduleFilenameTemplate: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class EvalSourceMapDevToolPlugin {
+	constructor(inputOptions: string | SourceMapDevToolPluginOptions);
+	sourceMapComment: string;
+	moduleFilenameTemplate: string | Function;
+	namespace: string;
+	options: SourceMapDevToolPluginOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface ExecuteModuleArgument {
+	module: Module;
+	moduleObject?: { id: string; exports: any; loaded: boolean };
+	preparedInfo: any;
+	codeGenerationResult: CodeGenerationResult;
+}
+declare interface ExecuteModuleContext {
+	assets: Map<string, { source: Source; info: AssetInfo }>;
+	chunk: Chunk;
+	chunkGraph: ChunkGraph;
+	__webpack_require__?: (arg0: string) => any;
+}
+declare interface ExecuteModuleOptions {
+	entryOptions?: EntryOptions;
+}
+declare interface ExecuteModuleResult {
+	exports: any;
+	cacheable: boolean;
+	assets: Map<string, { source: Source; info: AssetInfo }>;
+	fileDependencies: LazySet<string>;
+	contextDependencies: LazySet<string>;
+	missingDependencies: LazySet<string>;
+	buildDependencies: LazySet<string>;
+}
+type Experiments = ExperimentsCommon & ExperimentsExtra;
+
+/**
+ * Enables/Disables experiments (experimental features with relax SemVer compatibility).
+ */
+declare interface ExperimentsCommon {
+	/**
+	 * Support WebAssembly as asynchronous EcmaScript Module.
+	 */
+	asyncWebAssembly?: boolean;
+
+	/**
+	 * Enable backward-compat layer with deprecation warnings for many webpack 4 APIs.
+	 */
+	backCompat?: boolean;
+
+	/**
+	 * Enable additional in memory caching of modules that are unchanged and reference only unchanged modules.
+	 */
+	cacheUnaffected?: boolean;
+
+	/**
+	 * Apply defaults of next major version.
+	 */
+	futureDefaults?: boolean;
+
+	/**
+	 * Enable module layers.
+	 */
+	layers?: boolean;
+
+	/**
+	 * Allow output javascript files as module source type.
+	 */
+	outputModule?: boolean;
+
+	/**
+	 * Support WebAssembly as synchronous EcmaScript Module (outdated).
+	 */
+	syncWebAssembly?: boolean;
+
+	/**
+	 * Allow using top-level-await in EcmaScript Modules.
+	 */
+	topLevelAwait?: boolean;
+}
+
+/**
+ * Enables/Disables experiments (experimental features with relax SemVer compatibility).
+ */
+declare interface ExperimentsExtra {
+	/**
+	 * Build http(s): urls using a lockfile and resource content cache.
+	 */
+	buildHttp?: HttpUriOptions | (string | RegExp | ((uri: string) => boolean))[];
+
+	/**
+	 * Enable css support.
+	 */
+	css?: boolean | CssExperimentOptions;
+
+	/**
+	 * Compile entrypoints and import()s only when they are accessed.
+	 */
+	lazyCompilation?: boolean | LazyCompilationOptions;
+}
+type ExperimentsNormalized = ExperimentsCommon & ExperimentsNormalizedExtra;
+
+/**
+ * Enables/Disables experiments (experimental features with relax SemVer compatibility).
+ */
+declare interface ExperimentsNormalizedExtra {
+	/**
+	 * Build http(s): urls using a lockfile and resource content cache.
+	 */
+	buildHttp?: HttpUriOptions;
+
+	/**
+	 * Enable css support.
+	 */
+	css?: CssExperimentOptions;
+
+	/**
+	 * Compile entrypoints and import()s only when they are accessed.
+	 */
+	lazyCompilation?: LazyCompilationOptions;
+}
+declare abstract class ExportInfo {
+	name: string;
+
+	/**
+	 * true: it is provided
+	 * false: it is not provided
+	 * null: only the runtime knows if it is provided
+	 * undefined: it was not determined if it is provided
+	 */
+	provided?: null | boolean;
+
+	/**
+	 * is the export a terminal binding that should be checked for export star conflicts
+	 */
+	terminalBinding: boolean;
+
+	/**
+	 * true: it can be mangled
+	 * false: is can not be mangled
+	 * undefined: it was not determined if it can be mangled
+	 */
+	canMangleProvide?: boolean;
+
+	/**
+	 * true: it can be mangled
+	 * false: is can not be mangled
+	 * undefined: it was not determined if it can be mangled
+	 */
+	canMangleUse?: boolean;
+	exportsInfoOwned: boolean;
+	exportsInfo?: ExportsInfo;
+	readonly canMangle?: boolean;
+	setUsedInUnknownWay(runtime: RuntimeSpec): boolean;
+	setUsedWithoutInfo(runtime: RuntimeSpec): boolean;
+	setHasUseInfo(): void;
+	setUsedConditionally(
+		condition: (arg0: UsageStateType) => boolean,
+		newValue: UsageStateType,
+		runtime: RuntimeSpec
+	): boolean;
+	setUsed(newValue: UsageStateType, runtime: RuntimeSpec): boolean;
+	unsetTarget(key?: any): boolean;
+	setTarget(
+		key: any,
+		connection: ModuleGraphConnection,
+		exportName?: string[],
+		priority?: number
+	): boolean;
+	getUsed(runtime: RuntimeSpec): UsageStateType;
+
+	/**
+	 * get used name
+	 */
+	getUsedName(
+		fallbackName: undefined | string,
+		runtime: RuntimeSpec
+	): string | false;
+	hasUsedName(): boolean;
+
+	/**
+	 * Sets the mangled name of this export
+	 */
+	setUsedName(name: string): void;
+	getTerminalBinding(
+		moduleGraph: ModuleGraph,
+		resolveTargetFilter?: (arg0: {
+			module: Module;
+			export?: string[];
+		}) => boolean
+	): undefined | ExportsInfo | ExportInfo;
+	isReexport(): undefined | boolean;
+	findTarget(
+		moduleGraph: ModuleGraph,
+		validTargetModuleFilter: (arg0: Module) => boolean
+	): undefined | false | { module: Module; export?: string[] };
+	getTarget(
+		moduleGraph: ModuleGraph,
+		resolveTargetFilter?: (arg0: {
+			module: Module;
+			export?: string[];
+		}) => boolean
+	): undefined | { module: Module; export?: string[] };
+
+	/**
+	 * Move the target forward as long resolveTargetFilter is fulfilled
+	 */
+	moveTarget(
+		moduleGraph: ModuleGraph,
+		resolveTargetFilter: (arg0: {
+			module: Module;
+			export?: string[];
+		}) => boolean,
+		updateOriginalConnection?: (arg0: {
+			module: Module;
+			export?: string[];
+		}) => ModuleGraphConnection
+	): undefined | { module: Module; export?: string[] };
+	createNestedExportsInfo(): undefined | ExportsInfo;
+	getNestedExportsInfo(): undefined | ExportsInfo;
+	hasInfo(baseInfo?: any, runtime?: any): boolean;
+	updateHash(hash?: any, runtime?: any): void;
+	getUsedInfo(): string;
+	getProvidedInfo():
+		| "no provided info"
+		| "maybe provided (runtime-defined)"
+		| "provided"
+		| "not provided";
+	getRenameInfo(): string;
+}
+declare interface ExportSpec {
+	/**
+	 * the name of the export
+	 */
+	name: string;
+
+	/**
+	 * can the export be renamed (defaults to true)
+	 */
+	canMangle?: boolean;
+
+	/**
+	 * is the export a terminal binding that should be checked for export star conflicts
+	 */
+	terminalBinding?: boolean;
+
+	/**
+	 * nested exports
+	 */
+	exports?: (string | ExportSpec)[];
+
+	/**
+	 * when reexported: from which module
+	 */
+	from?: ModuleGraphConnection;
+
+	/**
+	 * when reexported: from which export
+	 */
+	export?: null | string[];
+
+	/**
+	 * when reexported: with which priority
+	 */
+	priority?: number;
+
+	/**
+	 * export is not visible, because another export blends over it
+	 */
+	hidden?: boolean;
+}
+type ExportedVariableInfo = string | ScopeInfo | VariableInfo;
+declare abstract class ExportsInfo {
+	readonly ownedExports: Iterable<ExportInfo>;
+	readonly orderedOwnedExports: Iterable<ExportInfo>;
+	readonly exports: Iterable<ExportInfo>;
+	readonly orderedExports: Iterable<ExportInfo>;
+	readonly otherExportsInfo: ExportInfo;
+	setRedirectNamedTo(exportsInfo?: any): boolean;
+	setHasProvideInfo(): void;
+	setHasUseInfo(): void;
+	getOwnExportInfo(name: string): ExportInfo;
+	getExportInfo(name: string): ExportInfo;
+	getReadOnlyExportInfo(name: string): ExportInfo;
+	getReadOnlyExportInfoRecursive(name: string[]): undefined | ExportInfo;
+	getNestedExportsInfo(name?: string[]): undefined | ExportsInfo;
+	setUnknownExportsProvided(
+		canMangle?: boolean,
+		excludeExports?: Set<string>,
+		targetKey?: any,
+		targetModule?: ModuleGraphConnection,
+		priority?: number
+	): boolean;
+	setUsedInUnknownWay(runtime: RuntimeSpec): boolean;
+	setUsedWithoutInfo(runtime: RuntimeSpec): boolean;
+	setAllKnownExportsUsed(runtime: RuntimeSpec): boolean;
+	setUsedForSideEffectsOnly(runtime: RuntimeSpec): boolean;
+	isUsed(runtime: RuntimeSpec): boolean;
+	isModuleUsed(runtime: RuntimeSpec): boolean;
+	getUsedExports(runtime: RuntimeSpec): null | boolean | SortableSet<string>;
+	getProvidedExports(): null | true | string[];
+	getRelevantExports(runtime: RuntimeSpec): ExportInfo[];
+	isExportProvided(name: string | string[]): undefined | null | boolean;
+	getUsageKey(runtime: RuntimeSpec): string;
+	isEquallyUsed(runtimeA: RuntimeSpec, runtimeB: RuntimeSpec): boolean;
+	getUsed(name: string | string[], runtime: RuntimeSpec): UsageStateType;
+	getUsedName(
+		name: string | string[],
+		runtime: RuntimeSpec
+	): string | false | string[];
+	updateHash(hash: Hash, runtime: RuntimeSpec): void;
+	getRestoreProvidedData(): any;
+	restoreProvided(__0: {
+		otherProvided: any;
+		otherCanMangleProvide: any;
+		otherTerminalBinding: any;
+		exports: any;
+	}): void;
+}
+declare interface ExportsSpec {
+	/**
+	 * exported names, true for unknown exports or null for no exports
+	 */
+	exports: null | true | (string | ExportSpec)[];
+
+	/**
+	 * when exports = true, list of unaffected exports
+	 */
+	excludeExports?: Set<string>;
+
+	/**
+	 * list of maybe prior exposed, but now hidden exports
+	 */
+	hideExports?: Set<string>;
+
+	/**
+	 * when reexported: from which module
+	 */
+	from?: ModuleGraphConnection;
+
+	/**
+	 * when reexported: with which priority
+	 */
+	priority?: number;
+
+	/**
+	 * can the export be renamed (defaults to true)
+	 */
+	canMangle?: boolean;
+
+	/**
+	 * are the exports terminal bindings that should be checked for export star conflicts
+	 */
+	terminalBinding?: boolean;
+
+	/**
+	 * module on which the result depends on
+	 */
+	dependencies?: Module[];
+}
+type Exposes = (string | ExposesObject)[] | ExposesObject;
+
+/**
+ * Advanced configuration for modules that should be exposed by this container.
+ */
+declare interface ExposesConfig {
+	/**
+	 * Request to a module that should be exposed by this container.
+	 */
+	import: string | string[];
+
+	/**
+	 * Custom chunk name for the exposed module.
+	 */
+	name?: string;
+}
+
+/**
+ * Modules that should be exposed by this container. Property names are used as public paths.
+ */
+declare interface ExposesObject {
+	[index: string]: string | ExposesConfig | string[];
+}
+type Expression =
+	| UnaryExpression
+	| ThisExpression
+	| ArrayExpression
+	| ObjectExpression
+	| FunctionExpression
+	| ArrowFunctionExpression
+	| YieldExpression
+	| SimpleLiteral
+	| RegExpLiteral
+	| BigIntLiteral
+	| UpdateExpression
+	| BinaryExpression
+	| AssignmentExpression
+	| LogicalExpression
+	| MemberExpression
+	| ConditionalExpression
+	| SimpleCallExpression
+	| NewExpression
+	| SequenceExpression
+	| TemplateLiteral
+	| TaggedTemplateExpression
+	| ClassExpression
+	| MetaProperty
+	| Identifier
+	| AwaitExpression
+	| ImportExpression
+	| ChainExpression;
+declare interface ExpressionExpressionInfo {
+	type: "expression";
+	rootInfo: string | VariableInfo;
+	name: string;
+	getMembers: () => string[];
+}
+type ExternalItem =
+	| string
+	| RegExp
+	| (ExternalItemObjectKnown & ExternalItemObjectUnknown)
+	| ((
+			data: ExternalItemFunctionData,
+			callback: (
+				err?: Error,
+				result?: string | boolean | string[] | { [index: string]: any }
+			) => void
+	  ) => void)
+	| ((data: ExternalItemFunctionData) => Promise<ExternalItemValue>);
+
+/**
+ * Data object passed as argument when a function is set for 'externals'.
+ */
+declare interface ExternalItemFunctionData {
+	/**
+	 * The directory in which the request is placed.
+	 */
+	context?: string;
+
+	/**
+	 * Contextual information.
+	 */
+	contextInfo?: ModuleFactoryCreateDataContextInfo;
+
+	/**
+	 * The category of the referencing dependencies.
+	 */
+	dependencyType?: string;
+
+	/**
+	 * Get a resolve function with the current resolver options.
+	 */
+	getResolve?: (
+		options?: ResolveOptionsWebpackOptions
+	) =>
+		| ((
+				context: string,
+				request: string,
+				callback: (err?: Error, result?: string) => void
+		  ) => void)
+		| ((context: string, request: string) => Promise<string>);
+
+	/**
+	 * The request as written by the user in the require/import expression/statement.
+	 */
+	request?: string;
+}
+
+/**
+ * If an dependency matches exactly a property of the object, the property value is used as dependency.
+ */
+declare interface ExternalItemObjectKnown {
+	/**
+	 * Specify externals depending on the layer.
+	 */
+	byLayer?:
+		| { [index: string]: ExternalItem }
+		| ((layer: null | string) => ExternalItem);
+}
+
+/**
+ * If an dependency matches exactly a property of the object, the property value is used as dependency.
+ */
+declare interface ExternalItemObjectUnknown {
+	[index: string]: ExternalItemValue;
+}
+type ExternalItemValue = string | boolean | string[] | { [index: string]: any };
+declare class ExternalModule extends Module {
+	constructor(request?: any, type?: any, userRequest?: any);
+	request: string | string[] | Record<string, string | string[]>;
+	externalType: string;
+	userRequest: string;
+	restoreFromUnsafeCache(
+		unsafeCacheData?: any,
+		normalModuleFactory?: any
+	): void;
+}
+declare interface ExternalModuleInfo {
+	index: number;
+	module: Module;
+}
+type Externals =
+	| string
+	| RegExp
+	| ExternalItem[]
+	| (ExternalItemObjectKnown & ExternalItemObjectUnknown)
+	| ((
+			data: ExternalItemFunctionData,
+			callback: (
+				err?: Error,
+				result?: string | boolean | string[] | { [index: string]: any }
+			) => void
+	  ) => void)
+	| ((data: ExternalItemFunctionData) => Promise<ExternalItemValue>);
+declare class ExternalsPlugin {
+	constructor(type: undefined | string, externals: Externals);
+	type?: string;
+	externals: Externals;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+
+/**
+ * Enable presets of externals for specific targets.
+ */
+declare interface ExternalsPresets {
+	/**
+	 * Treat common electron built-in modules in main and preload context like 'electron', 'ipc' or 'shell' as external and load them via require() when used.
+	 */
+	electron?: boolean;
+
+	/**
+	 * Treat electron built-in modules in the main context like 'app', 'ipc-main' or 'shell' as external and load them via require() when used.
+	 */
+	electronMain?: boolean;
+
+	/**
+	 * Treat electron built-in modules in the preload context like 'web-frame', 'ipc-renderer' or 'shell' as external and load them via require() when used.
+	 */
+	electronPreload?: boolean;
+
+	/**
+	 * Treat electron built-in modules in the renderer context like 'web-frame', 'ipc-renderer' or 'shell' as external and load them via require() when used.
+	 */
+	electronRenderer?: boolean;
+
+	/**
+	 * Treat node.js built-in modules like fs, path or vm as external and load them via require() when used.
+	 */
+	node?: boolean;
+
+	/**
+	 * Treat NW.js legacy nw.gui module as external and load it via require() when used.
+	 */
+	nwjs?: boolean;
+
+	/**
+	 * Treat references to 'http(s)://...' and 'std:...' as external and load them via import when used (Note that this changes execution order as externals are executed before any other code in the chunk).
+	 */
+	web?: boolean;
+
+	/**
+	 * Treat references to 'http(s)://...' and 'std:...' as external and load them via async import() when used (Note that this external type is an async module, which has various effects on the execution).
+	 */
+	webAsync?: boolean;
+}
+type ExternalsType =
+	| "import"
+	| "var"
+	| "module"
+	| "assign"
+	| "this"
+	| "window"
+	| "self"
+	| "global"
+	| "commonjs"
+	| "commonjs2"
+	| "commonjs-module"
+	| "commonjs-static"
+	| "amd"
+	| "amd-require"
+	| "umd"
+	| "umd2"
+	| "jsonp"
+	| "system"
+	| "promise"
+	| "script"
+	| "node-commonjs";
+declare interface FactorizeModuleOptions {
+	currentProfile: ModuleProfile;
+	factory: ModuleFactory;
+	dependencies: Dependency[];
+
+	/**
+	 * return full ModuleFactoryResult instead of only module
+	 */
+	factoryResult?: boolean;
+	originModule: null | Module;
+	contextInfo?: Partial<ModuleFactoryCreateDataContextInfo>;
+	context?: string;
+}
+type FakeHook<T> = T & FakeHookMarker;
+declare interface FakeHookMarker {}
+declare interface FallbackCacheGroup {
+	chunksFilter: (chunk: Chunk) => boolean;
+	minSize: SplitChunksSizes;
+	maxAsyncSize: SplitChunksSizes;
+	maxInitialSize: SplitChunksSizes;
+	automaticNameDelimiter: string;
+}
+declare class FetchCompileAsyncWasmPlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class FetchCompileWasmPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+
+/**
+ * Options object for persistent file-based caching.
+ */
+declare interface FileCacheOptions {
+	/**
+	 * Allows to collect unused memory allocated during deserialization. This requires copying data into smaller buffers and has a performance cost.
+	 */
+	allowCollectingMemory?: boolean;
+
+	/**
+	 * Dependencies the build depends on (in multiple categories, default categories: 'defaultWebpack').
+	 */
+	buildDependencies?: { [index: string]: string[] };
+
+	/**
+	 * Base directory for the cache (defaults to node_modules/.cache/webpack).
+	 */
+	cacheDirectory?: string;
+
+	/**
+	 * Locations for the cache (defaults to cacheDirectory / name).
+	 */
+	cacheLocation?: string;
+
+	/**
+	 * Compression type used for the cache files.
+	 */
+	compression?: false | "gzip" | "brotli";
+
+	/**
+	 * Algorithm used for generation the hash (see node.js crypto package).
+	 */
+	hashAlgorithm?: string;
+
+	/**
+	 * Time in ms after which idle period the cache storing should happen.
+	 */
+	idleTimeout?: number;
+
+	/**
+	 * Time in ms after which idle period the cache storing should happen when larger changes has been detected (cumulative build time > 2 x avg cache store time).
+	 */
+	idleTimeoutAfterLargeChanges?: number;
+
+	/**
+	 * Time in ms after which idle period the initial cache storing should happen.
+	 */
+	idleTimeoutForInitialStore?: number;
+
+	/**
+	 * List of paths that are managed by a package manager and contain a version or hash in its path so all files are immutable.
+	 */
+	immutablePaths?: (string | RegExp)[];
+
+	/**
+	 * List of paths that are managed by a package manager and can be trusted to not be modified otherwise.
+	 */
+	managedPaths?: (string | RegExp)[];
+
+	/**
+	 * Time for which unused cache entries stay in the filesystem cache at minimum (in milliseconds).
+	 */
+	maxAge?: number;
+
+	/**
+	 * Number of generations unused cache entries stay in memory cache at minimum (0 = no memory cache used, 1 = may be removed after unused for a single compilation, ..., Infinity: kept forever). Cache entries will be deserialized from disk when removed from memory cache.
+	 */
+	maxMemoryGenerations?: number;
+
+	/**
+	 * Additionally cache computation of modules that are unchanged and reference only unchanged modules in memory.
+	 */
+	memoryCacheUnaffected?: boolean;
+
+	/**
+	 * Name for the cache. Different names will lead to different coexisting caches.
+	 */
+	name?: string;
+
+	/**
+	 * Track and log detailed timing information for individual cache items.
+	 */
+	profile?: boolean;
+
+	/**
+	 * When to store data to the filesystem. (pack: Store data when compiler is idle in a single file).
+	 */
+	store?: "pack";
+
+	/**
+	 * Filesystem caching.
+	 */
+	type: "filesystem";
+
+	/**
+	 * Version of the cache data. Different versions won't allow to reuse the cache and override existing content. Update the version when config changed in a way which doesn't allow to reuse cache. This will invalidate the cache.
+	 */
+	version?: string;
+}
+declare interface FileSystem {
+	readFile: {
+		(arg0: string, arg1: FileSystemCallback<string | Buffer>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	readdir: {
+		(
+			arg0: string,
+			arg1: FileSystemCallback<(string | Buffer)[] | FileSystemDirent[]>
+		): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<(string | Buffer)[] | FileSystemDirent[]>
+		): void;
+	};
+	readJson?: {
+		(arg0: string, arg1: FileSystemCallback<object>): void;
+		(arg0: string, arg1: object, arg2: FileSystemCallback<object>): void;
+	};
+	readlink: {
+		(arg0: string, arg1: FileSystemCallback<string | Buffer>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	lstat?: {
+		(arg0: string, arg1: FileSystemCallback<FileSystemStats>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+	stat: {
+		(arg0: string, arg1: FileSystemCallback<FileSystemStats>): void;
+		(
+			arg0: string,
+			arg1: object,
+			arg2: FileSystemCallback<string | Buffer>
+		): void;
+	};
+}
+declare interface FileSystemCallback<T> {
+	(err?: null | (PossibleFileSystemError & Error), result?: T): any;
+}
+declare interface FileSystemDirent {
+	name: string | Buffer;
+	isDirectory: () => boolean;
+	isFile: () => boolean;
+}
+declare abstract class FileSystemInfo {
+	fs: InputFileSystem;
+	logger?: WebpackLogger;
+	fileTimestampQueue: AsyncQueue<string, string, null | FileSystemInfoEntry>;
+	fileHashQueue: AsyncQueue<string, string, null | string>;
+	contextTimestampQueue: AsyncQueue<
+		string,
+		string,
+		null | ContextFileSystemInfoEntry
+	>;
+	contextHashQueue: AsyncQueue<string, string, null | ContextHash>;
+	contextTshQueue: AsyncQueue<string, string, null | ContextTimestampAndHash>;
+	managedItemQueue: AsyncQueue<string, string, null | string>;
+	managedItemDirectoryQueue: AsyncQueue<string, string, Set<string>>;
+	managedPaths: (string | RegExp)[];
+	managedPathsWithSlash: string[];
+	managedPathsRegExps: RegExp[];
+	immutablePaths: (string | RegExp)[];
+	immutablePathsWithSlash: string[];
+	immutablePathsRegExps: RegExp[];
+	logStatistics(): void;
+	clear(): void;
+	addFileTimestamps(
+		map: ReadonlyMap<string, null | FileSystemInfoEntry | "ignore">,
+		immutable?: boolean
+	): void;
+	addContextTimestamps(
+		map: ReadonlyMap<string, null | FileSystemInfoEntry | "ignore">,
+		immutable?: boolean
+	): void;
+	getFileTimestamp(
+		path: string,
+		callback: (
+			arg0?: null | WebpackError,
+			arg1?: null | FileSystemInfoEntry | "ignore"
+		) => void
+	): void;
+	getContextTimestamp(
+		path: string,
+		callback: (
+			arg0?: null | WebpackError,
+			arg1?: null | "ignore" | ResolvedContextFileSystemInfoEntry
+		) => void
+	): void;
+	getFileHash(
+		path: string,
+		callback: (arg0?: null | WebpackError, arg1?: string) => void
+	): void;
+	getContextHash(
+		path: string,
+		callback: (arg0?: null | WebpackError, arg1?: string) => void
+	): void;
+	getContextTsh(
+		path: string,
+		callback: (
+			arg0?: null | WebpackError,
+			arg1?: ResolvedContextTimestampAndHash
+		) => void
+	): void;
+	resolveBuildDependencies(
+		context: string,
+		deps: Iterable<string>,
+		callback: (
+			arg0?: null | Error,
+			arg1?: ResolveBuildDependenciesResult
+		) => void
+	): void;
+	checkResolveResultsValid(
+		resolveResults: Map<string, string | false>,
+		callback: (arg0?: null | Error, arg1?: boolean) => void
+	): void;
+	createSnapshot(
+		startTime: number,
+		files: Iterable<string>,
+		directories: Iterable<string>,
+		missing: Iterable<string>,
+		options: {
+			/**
+			 * Use hashes of the content of the files/directories to determine invalidation.
+			 */
+			hash?: boolean;
+			/**
+			 * Use timestamps of the files/directories to determine invalidation.
+			 */
+			timestamp?: boolean;
+		},
+		callback: (arg0?: null | WebpackError, arg1?: null | Snapshot) => void
+	): void;
+	mergeSnapshots(snapshot1: Snapshot, snapshot2: Snapshot): Snapshot;
+	checkSnapshotValid(
+		snapshot: Snapshot,
+		callback: (arg0?: null | WebpackError, arg1?: boolean) => void
+	): void;
+	getDeprecatedFileTimestamps(): Map<any, any>;
+	getDeprecatedContextTimestamps(): Map<any, any>;
+}
+declare interface FileSystemInfoEntry {
+	safeTime: number;
+	timestamp?: number;
+}
+declare interface FileSystemStats {
+	isDirectory: () => boolean;
+	isFile: () => boolean;
+}
+type FilterItemTypes = string | RegExp | ((value: string) => boolean);
+declare interface GenerateContext {
+	/**
+	 * mapping from dependencies to templates
+	 */
+	dependencyTemplates: DependencyTemplates;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * the requirements for runtime
+	 */
+	runtimeRequirements: Set<string>;
+
+	/**
+	 * the runtime
+	 */
+	runtime: RuntimeSpec;
+
+	/**
+	 * when in concatenated module, information about other concatenated modules
+	 */
+	concatenationScope?: ConcatenationScope;
+
+	/**
+	 * code generation results of other modules (need to have a codeGenerationDependency to use that)
+	 */
+	codeGenerationResults?: CodeGenerationResults;
+
+	/**
+	 * which kind of code should be generated
+	 */
+	type: string;
+
+	/**
+	 * get access to the code generation data
+	 */
+	getData?: () => Map<string, any>;
+}
+declare class Generator {
+	constructor();
+	getTypes(module: NormalModule): Set<string>;
+	getSize(module: NormalModule, type?: string): number;
+	generate(module: NormalModule, __1: GenerateContext): Source;
+	getConcatenationBailoutReason(
+		module: NormalModule,
+		context: ConcatenationBailoutReasonContext
+	): undefined | string;
+	updateHash(hash: Hash, __1: UpdateHashContextGenerator): void;
+	static byType(map?: any): ByTypeGenerator;
+}
+type GeneratorOptionsByModuleType = GeneratorOptionsByModuleTypeKnown &
+	GeneratorOptionsByModuleTypeUnknown;
+
+/**
+ * Specify options for each generator.
+ */
+declare interface GeneratorOptionsByModuleTypeKnown {
+	/**
+	 * Generator options for asset modules.
+	 */
+	asset?: AssetGeneratorOptions;
+
+	/**
+	 * Generator options for asset/inline modules.
+	 */
+	"asset/inline"?: AssetInlineGeneratorOptions;
+
+	/**
+	 * Generator options for asset/resource modules.
+	 */
+	"asset/resource"?: AssetResourceGeneratorOptions;
+
+	/**
+	 * No generator options are supported for this module type.
+	 */
+	javascript?: EmptyGeneratorOptions;
+
+	/**
+	 * No generator options are supported for this module type.
+	 */
+	"javascript/auto"?: EmptyGeneratorOptions;
+
+	/**
+	 * No generator options are supported for this module type.
+	 */
+	"javascript/dynamic"?: EmptyGeneratorOptions;
+
+	/**
+	 * No generator options are supported for this module type.
+	 */
+	"javascript/esm"?: EmptyGeneratorOptions;
+}
+
+/**
+ * Specify options for each generator.
+ */
+declare interface GeneratorOptionsByModuleTypeUnknown {
+	[index: string]: { [index: string]: any };
+}
+declare class GetChunkFilenameRuntimeModule extends RuntimeModule {
+	constructor(
+		contentType: string,
+		name: string,
+		global: string,
+		getFilenameForChunk: (
+			arg0: Chunk
+		) => string | ((arg0: PathData, arg1?: AssetInfo) => string),
+		allChunks: boolean
+	);
+	contentType: string;
+	global: string;
+	getFilenameForChunk: (
+		arg0: Chunk
+	) => string | ((arg0: PathData, arg1?: AssetInfo) => string);
+	allChunks: boolean;
+
+	/**
+	 * Runtime modules without any dependencies to other runtime modules
+	 */
+	static STAGE_NORMAL: number;
+
+	/**
+	 * Runtime modules with simple dependencies on other runtime modules
+	 */
+	static STAGE_BASIC: number;
+
+	/**
+	 * Runtime modules which attach to handlers of other runtime modules
+	 */
+	static STAGE_ATTACH: number;
+
+	/**
+	 * Runtime modules which trigger actions on bootstrap
+	 */
+	static STAGE_TRIGGER: number;
+}
+declare interface GroupConfig {
+	getKeys: (arg0?: any) => string[];
+	createGroup: (arg0: string, arg1: any[], arg2: any[]) => object;
+	getOptions?: (arg0: string, arg1: any[]) => GroupOptions;
+}
+declare interface GroupOptions {
+	groupChildren?: boolean;
+	force?: boolean;
+	targetGroupCount?: number;
+}
+declare interface HMRJavascriptParserHooks {
+	hotAcceptCallback: SyncBailHook<[any, string[]], void>;
+	hotAcceptWithoutCallback: SyncBailHook<[any, string[]], void>;
+}
+declare interface HandleModuleCreationOptions {
+	factory: ModuleFactory;
+	dependencies: Dependency[];
+	originModule: null | Module;
+	contextInfo?: Partial<ModuleFactoryCreateDataContextInfo>;
+	context?: string;
+
+	/**
+	 * recurse into dependencies of the created module
+	 */
+	recursive?: boolean;
+
+	/**
+	 * connect the resolved module with the origin module
+	 */
+	connectOrigin?: boolean;
+}
+declare class Hash {
+	constructor();
+
+	/**
+	 * Update hash {@link https ://nodejs.org/api/crypto.html#crypto_hash_update_data_inputencoding}
+	 */
+	update(data: string | Buffer, inputEncoding?: string): Hash;
+
+	/**
+	 * Calculates the digest {@link https ://nodejs.org/api/crypto.html#crypto_hash_digest_encoding}
+	 */
+	digest(encoding?: string): string | Buffer;
+}
+declare interface HashableObject {
+	updateHash: (arg0: Hash) => void;
+}
+declare class HashedModuleIdsPlugin {
+	constructor(options?: HashedModuleIdsPluginOptions);
+	options: HashedModuleIdsPluginOptions;
+	apply(compiler?: any): void;
+}
+declare interface HashedModuleIdsPluginOptions {
+	/**
+	 * The context directory for creating names.
+	 */
+	context?: string;
+
+	/**
+	 * The encoding to use when generating the hash, defaults to 'base64'. All encodings from Node.JS' hash.digest are supported.
+	 */
+	hashDigest?: "latin1" | "hex" | "base64";
+
+	/**
+	 * The prefix length of the hash digest to use, defaults to 4.
+	 */
+	hashDigestLength?: number;
+
+	/**
+	 * The hashing algorithm to use, defaults to 'md4'. All functions from Node.JS' crypto.createHash are supported.
+	 */
+	hashFunction?: string | typeof Hash;
+}
+declare abstract class HelperRuntimeModule extends RuntimeModule {}
+declare class HotModuleReplacementPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static getParserHooks(parser: JavascriptParser): HMRJavascriptParserHooks;
+}
+
+/**
+ * These properties are added by the HotModuleReplacementPlugin
+ */
+declare interface HotModuleReplacementPluginLoaderContext {
+	hot?: boolean;
+}
+declare class HotUpdateChunk extends Chunk {
+	constructor();
+}
+
+/**
+ * Options for building http resources.
+ */
+declare interface HttpUriOptions {
+	/**
+	 * List of allowed URIs (resp. the beginning of them).
+	 */
+	allowedUris: (string | RegExp | ((uri: string) => boolean))[];
+
+	/**
+	 * Location where resource content is stored for lockfile entries. It's also possible to disable storing by passing false.
+	 */
+	cacheLocation?: string | false;
+
+	/**
+	 * When set, anything that would lead to a modification of the lockfile or any resource content, will result in an error.
+	 */
+	frozen?: boolean;
+
+	/**
+	 * Location of the lockfile.
+	 */
+	lockfileLocation?: string;
+
+	/**
+	 * Proxy configuration, which can be used to specify a proxy server to use for HTTP requests.
+	 */
+	proxy?: string;
+
+	/**
+	 * When set, resources of existing lockfile entries will be fetched and entries will be upgraded when resource content has changed.
+	 */
+	upgrade?: boolean;
+}
+declare class HttpUriPlugin {
+	constructor(options: HttpUriOptions);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface IDirent {
+	isFile: () => boolean;
+	isDirectory: () => boolean;
+	isBlockDevice: () => boolean;
+	isCharacterDevice: () => boolean;
+	isSymbolicLink: () => boolean;
+	isFIFO: () => boolean;
+	isSocket: () => boolean;
+	name: string | Buffer;
+}
+declare interface IStats {
+	isFile: () => boolean;
+	isDirectory: () => boolean;
+	isBlockDevice: () => boolean;
+	isCharacterDevice: () => boolean;
+	isSymbolicLink: () => boolean;
+	isFIFO: () => boolean;
+	isSocket: () => boolean;
+	dev: number | bigint;
+	ino: number | bigint;
+	mode: number | bigint;
+	nlink: number | bigint;
+	uid: number | bigint;
+	gid: number | bigint;
+	rdev: number | bigint;
+	size: number | bigint;
+	blksize: number | bigint;
+	blocks: number | bigint;
+	atimeMs: number | bigint;
+	mtimeMs: number | bigint;
+	ctimeMs: number | bigint;
+	birthtimeMs: number | bigint;
+	atime: Date;
+	mtime: Date;
+	ctime: Date;
+	birthtime: Date;
+}
+declare class IgnorePlugin {
+	constructor(options: IgnorePluginOptions);
+	options: IgnorePluginOptions;
+
+	/**
+	 * Note that if "contextRegExp" is given, both the "resourceRegExp"
+	 * and "contextRegExp" have to match.
+	 */
+	checkIgnore(resolveData: ResolveData): undefined | false;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+type IgnorePluginOptions =
+	| {
+			/**
+			 * A RegExp to test the context (directory) against.
+			 */
+			contextRegExp?: RegExp;
+			/**
+			 * A RegExp to test the request against.
+			 */
+			resourceRegExp: RegExp;
+	  }
+	| {
+			/**
+			 * A filter function for resource and context.
+			 */
+			checkResource: (resource: string, context: string) => boolean;
+	  };
+declare interface ImportModuleOptions {
+	/**
+	 * the target layer
+	 */
+	layer?: string;
+
+	/**
+	 * the target public path
+	 */
+	publicPath?: string;
+
+	/**
+	 * target base uri
+	 */
+	baseUri?: string;
+}
+type ImportSource =
+	| undefined
+	| null
+	| string
+	| SimpleLiteral
+	| RegExpLiteral
+	| BigIntLiteral;
+
+/**
+ * Options for infrastructure level logging.
+ */
+declare interface InfrastructureLogging {
+	/**
+	 * Only appends lines to the output. Avoids updating existing output e. g. for status messages. This option is only used when no custom console is provided.
+	 */
+	appendOnly?: boolean;
+
+	/**
+	 * Enables/Disables colorful output. This option is only used when no custom console is provided.
+	 */
+	colors?: boolean;
+
+	/**
+	 * Custom console used for logging.
+	 */
+	console?: Console;
+
+	/**
+	 * Enable debug logging for specific loggers.
+	 */
+	debug?:
+		| string
+		| boolean
+		| RegExp
+		| FilterItemTypes[]
+		| ((value: string) => boolean);
+
+	/**
+	 * Log level.
+	 */
+	level?: "none" | "error" | "warn" | "info" | "log" | "verbose";
+
+	/**
+	 * Stream used for logging output. Defaults to process.stderr. This option is only used when no custom console is provided.
+	 */
+	stream?: NodeJS.WritableStream;
+}
+declare abstract class InitFragment<Context> {
+	content: string | Source;
+	stage: number;
+	position: number;
+	key?: string;
+	endContent?: string | Source;
+	getContent(context: Context): string | Source;
+	getEndContent(context: Context): undefined | string | Source;
+	serialize(context?: any): void;
+	deserialize(context?: any): void;
+	merge: any;
+}
+declare interface InputFileSystem {
+	readFile: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: string | Buffer) => void
+	) => void;
+	readJson?: (
+		arg0: string,
+		arg1: (arg0?: null | Error | NodeJS.ErrnoException, arg1?: any) => void
+	) => void;
+	readlink: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: string | Buffer) => void
+	) => void;
+	readdir: (
+		arg0: string,
+		arg1: (
+			arg0?: null | NodeJS.ErrnoException,
+			arg1?: (string | Buffer)[] | IDirent[]
+		) => void
+	) => void;
+	stat: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: IStats) => void
+	) => void;
+	lstat?: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: IStats) => void
+	) => void;
+	realpath?: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: string | Buffer) => void
+	) => void;
+	purge?: (arg0?: string) => void;
+	join?: (arg0: string, arg1: string) => string;
+	relative?: (arg0: string, arg1: string) => string;
+	dirname?: (arg0: string) => string;
+}
+type IntermediateFileSystem = InputFileSystem &
+	OutputFileSystem &
+	IntermediateFileSystemExtras;
+declare interface IntermediateFileSystemExtras {
+	mkdirSync: (arg0: string) => void;
+	createWriteStream: (arg0: string) => NodeJS.WritableStream;
+	open: (
+		arg0: string,
+		arg1: string,
+		arg2: (arg0?: null | NodeJS.ErrnoException, arg1?: number) => void
+	) => void;
+	read: (
+		arg0: number,
+		arg1: Buffer,
+		arg2: number,
+		arg3: number,
+		arg4: number,
+		arg5: (arg0?: null | NodeJS.ErrnoException, arg1?: number) => void
+	) => void;
+	close: (
+		arg0: number,
+		arg1: (arg0?: null | NodeJS.ErrnoException) => void
+	) => void;
+	rename: (
+		arg0: string,
+		arg1: string,
+		arg2: (arg0?: null | NodeJS.ErrnoException) => void
+	) => void;
+}
+type InternalCell<T> = T | typeof TOMBSTONE | typeof UNDEFINED_MARKER;
+declare abstract class ItemCacheFacade {
+	get<T>(callback: CallbackCache<T>): void;
+	getPromise<T>(): Promise<T>;
+	store<T>(data: T, callback: CallbackCache<void>): void;
+	storePromise<T>(data: T): Promise<void>;
+	provide<T>(
+		computer: (arg0: CallbackNormalErrorCache<T>) => void,
+		callback: CallbackNormalErrorCache<T>
+	): void;
+	providePromise<T>(computer: () => T | Promise<T>): Promise<T>;
+}
+declare class JavascriptModulesPlugin {
+	constructor(options?: object);
+	options: object;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	renderModule(
+		module: Module,
+		renderContext: ChunkRenderContext,
+		hooks: CompilationHooksJavascriptModulesPlugin,
+		factory: boolean
+	): Source;
+	renderChunk(
+		renderContext: RenderContext,
+		hooks: CompilationHooksJavascriptModulesPlugin
+	): Source;
+	renderMain(
+		renderContext: MainRenderContext,
+		hooks: CompilationHooksJavascriptModulesPlugin,
+		compilation: Compilation
+	): Source;
+	updateHashWithBootstrap(
+		hash: Hash,
+		renderContext: RenderBootstrapContext,
+		hooks: CompilationHooksJavascriptModulesPlugin
+	): void;
+	renderBootstrap(
+		renderContext: RenderBootstrapContext,
+		hooks: CompilationHooksJavascriptModulesPlugin
+	): {
+		header: string[];
+		beforeStartup: string[];
+		startup: string[];
+		afterStartup: string[];
+		allowInlineStartup: boolean;
+	};
+	renderRequire(
+		renderContext: RenderBootstrapContext,
+		hooks: CompilationHooksJavascriptModulesPlugin
+	): string;
+	static getCompilationHooks(
+		compilation: Compilation
+	): CompilationHooksJavascriptModulesPlugin;
+	static getChunkFilenameTemplate(chunk?: any, outputOptions?: any): any;
+	static chunkHasJs: (chunk: Chunk, chunkGraph: ChunkGraph) => boolean;
+}
+declare class JavascriptParser extends Parser {
+	constructor(sourceType?: "module" | "auto" | "script");
+	hooks: Readonly<{
+		evaluateTypeof: HookMap<
+			SyncBailHook<
+				[UnaryExpression],
+				undefined | null | BasicEvaluatedExpression
+			>
+		>;
+		evaluate: HookMap<
+			SyncBailHook<[Expression], undefined | null | BasicEvaluatedExpression>
+		>;
+		evaluateIdentifier: HookMap<
+			SyncBailHook<
+				[ThisExpression | MemberExpression | MetaProperty | Identifier],
+				undefined | null | BasicEvaluatedExpression
+			>
+		>;
+		evaluateDefinedIdentifier: HookMap<
+			SyncBailHook<
+				[ThisExpression | MemberExpression | Identifier],
+				undefined | null | BasicEvaluatedExpression
+			>
+		>;
+		evaluateCallExpressionMember: HookMap<
+			SyncBailHook<
+				[CallExpression, undefined | BasicEvaluatedExpression],
+				undefined | null | BasicEvaluatedExpression
+			>
+		>;
+		isPure: HookMap<
+			SyncBailHook<
+				[
+					(
+						| UnaryExpression
+						| ThisExpression
+						| ArrayExpression
+						| ObjectExpression
+						| FunctionExpression
+						| ArrowFunctionExpression
+						| YieldExpression
+						| SimpleLiteral
+						| RegExpLiteral
+						| BigIntLiteral
+						| UpdateExpression
+						| BinaryExpression
+						| AssignmentExpression
+						| LogicalExpression
+						| MemberExpression
+						| ConditionalExpression
+						| SimpleCallExpression
+						| NewExpression
+						| SequenceExpression
+						| TemplateLiteral
+						| TaggedTemplateExpression
+						| ClassExpression
+						| MetaProperty
+						| Identifier
+						| AwaitExpression
+						| ImportExpression
+						| ChainExpression
+						| FunctionDeclaration
+						| VariableDeclaration
+						| ClassDeclaration
+						| PrivateIdentifier
+					),
+					number
+				],
+				boolean | void
+			>
+		>;
+		preStatement: SyncBailHook<
+			[
+				| FunctionDeclaration
+				| VariableDeclaration
+				| ClassDeclaration
+				| ExpressionStatement
+				| BlockStatement
+				| StaticBlock
+				| EmptyStatement
+				| DebuggerStatement
+				| WithStatement
+				| ReturnStatement
+				| LabeledStatement
+				| BreakStatement
+				| ContinueStatement
+				| IfStatement
+				| SwitchStatement
+				| ThrowStatement
+				| TryStatement
+				| WhileStatement
+				| DoWhileStatement
+				| ForStatement
+				| ForInStatement
+				| ForOfStatement
+				| ImportDeclaration
+				| ExportNamedDeclaration
+				| ExportDefaultDeclaration
+				| ExportAllDeclaration
+			],
+			boolean | void
+		>;
+		blockPreStatement: SyncBailHook<
+			[
+				| FunctionDeclaration
+				| VariableDeclaration
+				| ClassDeclaration
+				| ExpressionStatement
+				| BlockStatement
+				| StaticBlock
+				| EmptyStatement
+				| DebuggerStatement
+				| WithStatement
+				| ReturnStatement
+				| LabeledStatement
+				| BreakStatement
+				| ContinueStatement
+				| IfStatement
+				| SwitchStatement
+				| ThrowStatement
+				| TryStatement
+				| WhileStatement
+				| DoWhileStatement
+				| ForStatement
+				| ForInStatement
+				| ForOfStatement
+				| ImportDeclaration
+				| ExportNamedDeclaration
+				| ExportDefaultDeclaration
+				| ExportAllDeclaration
+			],
+			boolean | void
+		>;
+		statement: SyncBailHook<
+			[
+				| FunctionDeclaration
+				| VariableDeclaration
+				| ClassDeclaration
+				| ExpressionStatement
+				| BlockStatement
+				| StaticBlock
+				| EmptyStatement
+				| DebuggerStatement
+				| WithStatement
+				| ReturnStatement
+				| LabeledStatement
+				| BreakStatement
+				| ContinueStatement
+				| IfStatement
+				| SwitchStatement
+				| ThrowStatement
+				| TryStatement
+				| WhileStatement
+				| DoWhileStatement
+				| ForStatement
+				| ForInStatement
+				| ForOfStatement
+				| ImportDeclaration
+				| ExportNamedDeclaration
+				| ExportDefaultDeclaration
+				| ExportAllDeclaration
+			],
+			boolean | void
+		>;
+		statementIf: SyncBailHook<[IfStatement], boolean | void>;
+		classExtendsExpression: SyncBailHook<
+			[Expression, ClassExpression | ClassDeclaration],
+			boolean | void
+		>;
+		classBodyElement: SyncBailHook<
+			[
+				MethodDefinition | PropertyDefinition,
+				ClassExpression | ClassDeclaration
+			],
+			boolean | void
+		>;
+		classBodyValue: SyncBailHook<
+			[
+				Expression,
+				MethodDefinition | PropertyDefinition,
+				ClassExpression | ClassDeclaration
+			],
+			boolean | void
+		>;
+		label: HookMap<SyncBailHook<[LabeledStatement], boolean | void>>;
+		import: SyncBailHook<[ImportDeclaration, ImportSource], boolean | void>;
+		importSpecifier: SyncBailHook<
+			[ImportDeclaration, ImportSource, string, string],
+			boolean | void
+		>;
+		export: SyncBailHook<
+			[ExportNamedDeclaration | ExportAllDeclaration],
+			boolean | void
+		>;
+		exportImport: SyncBailHook<
+			[ExportNamedDeclaration | ExportAllDeclaration, ImportSource],
+			boolean | void
+		>;
+		exportDeclaration: SyncBailHook<
+			[ExportNamedDeclaration | ExportAllDeclaration, Declaration],
+			boolean | void
+		>;
+		exportExpression: SyncBailHook<
+			[ExportDefaultDeclaration, Declaration],
+			boolean | void
+		>;
+		exportSpecifier: SyncBailHook<
+			[
+				ExportNamedDeclaration | ExportAllDeclaration,
+				string,
+				string,
+				undefined | number
+			],
+			boolean | void
+		>;
+		exportImportSpecifier: SyncBailHook<
+			[
+				ExportNamedDeclaration | ExportAllDeclaration,
+				ImportSource,
+				string,
+				string,
+				undefined | number
+			],
+			boolean | void
+		>;
+		preDeclarator: SyncBailHook<
+			[VariableDeclarator, Statement],
+			boolean | void
+		>;
+		declarator: SyncBailHook<[VariableDeclarator, Statement], boolean | void>;
+		varDeclaration: HookMap<SyncBailHook<[Declaration], boolean | void>>;
+		varDeclarationLet: HookMap<SyncBailHook<[Declaration], boolean | void>>;
+		varDeclarationConst: HookMap<SyncBailHook<[Declaration], boolean | void>>;
+		varDeclarationVar: HookMap<SyncBailHook<[Declaration], boolean | void>>;
+		pattern: HookMap<SyncBailHook<[Identifier], boolean | void>>;
+		canRename: HookMap<SyncBailHook<[Expression], boolean | void>>;
+		rename: HookMap<SyncBailHook<[Expression], boolean | void>>;
+		assign: HookMap<SyncBailHook<[AssignmentExpression], boolean | void>>;
+		assignMemberChain: HookMap<
+			SyncBailHook<[AssignmentExpression, string[]], boolean | void>
+		>;
+		typeof: HookMap<SyncBailHook<[Expression], boolean | void>>;
+		importCall: SyncBailHook<[Expression], boolean | void>;
+		topLevelAwait: SyncBailHook<[Expression], boolean | void>;
+		call: HookMap<SyncBailHook<[Expression], boolean | void>>;
+		callMemberChain: HookMap<
+			SyncBailHook<[CallExpression, string[]], boolean | void>
+		>;
+		memberChainOfCallMemberChain: HookMap<
+			SyncBailHook<
+				[Expression, string[], CallExpression, string[]],
+				boolean | void
+			>
+		>;
+		callMemberChainOfCallMemberChain: HookMap<
+			SyncBailHook<
+				[Expression, string[], CallExpression, string[]],
+				boolean | void
+			>
+		>;
+		optionalChaining: SyncBailHook<[ChainExpression], boolean | void>;
+		new: HookMap<SyncBailHook<[NewExpression], boolean | void>>;
+		expression: HookMap<SyncBailHook<[Expression], boolean | void>>;
+		expressionMemberChain: HookMap<
+			SyncBailHook<[Expression, string[]], boolean | void>
+		>;
+		unhandledExpressionMemberChain: HookMap<
+			SyncBailHook<[Expression, string[]], boolean | void>
+		>;
+		expressionConditionalOperator: SyncBailHook<[Expression], boolean | void>;
+		expressionLogicalOperator: SyncBailHook<[Expression], boolean | void>;
+		program: SyncBailHook<[Program, Comment[]], boolean | void>;
+		finish: SyncBailHook<[Program, Comment[]], boolean | void>;
+	}>;
+	sourceType: "module" | "auto" | "script";
+	scope: ScopeInfo;
+	state: ParserState;
+	comments: any;
+	semicolons: any;
+	statementPath: (
+		| UnaryExpression
+		| ThisExpression
+		| ArrayExpression
+		| ObjectExpression
+		| FunctionExpression
+		| ArrowFunctionExpression
+		| YieldExpression
+		| SimpleLiteral
+		| RegExpLiteral
+		| BigIntLiteral
+		| UpdateExpression
+		| BinaryExpression
+		| AssignmentExpression
+		| LogicalExpression
+		| MemberExpression
+		| ConditionalExpression
+		| SimpleCallExpression
+		| NewExpression
+		| SequenceExpression
+		| TemplateLiteral
+		| TaggedTemplateExpression
+		| ClassExpression
+		| MetaProperty
+		| Identifier
+		| AwaitExpression
+		| ImportExpression
+		| ChainExpression
+		| FunctionDeclaration
+		| VariableDeclaration
+		| ClassDeclaration
+		| ExpressionStatement
+		| BlockStatement
+		| StaticBlock
+		| EmptyStatement
+		| DebuggerStatement
+		| WithStatement
+		| ReturnStatement
+		| LabeledStatement
+		| BreakStatement
+		| ContinueStatement
+		| IfStatement
+		| SwitchStatement
+		| ThrowStatement
+		| TryStatement
+		| WhileStatement
+		| DoWhileStatement
+		| ForStatement
+		| ForInStatement
+		| ForOfStatement
+	)[];
+	prevStatement: any;
+	currentTagData: any;
+	getRenameIdentifier(expr?: any): undefined | string;
+	walkClass(classy: ClassExpression | ClassDeclaration): void;
+	preWalkStatements(statements?: any): void;
+	blockPreWalkStatements(statements?: any): void;
+	walkStatements(statements?: any): void;
+	preWalkStatement(statement?: any): void;
+	blockPreWalkStatement(statement?: any): void;
+	walkStatement(statement?: any): void;
+
+	/**
+	 * Walks a statements that is nested within a parent statement
+	 * and can potentially be a non-block statement.
+	 * This enforces the nested statement to never be in ASI position.
+	 */
+	walkNestedStatement(statement: Statement): void;
+	preWalkBlockStatement(statement?: any): void;
+	walkBlockStatement(statement?: any): void;
+	walkExpressionStatement(statement?: any): void;
+	preWalkIfStatement(statement?: any): void;
+	walkIfStatement(statement?: any): void;
+	preWalkLabeledStatement(statement?: any): void;
+	walkLabeledStatement(statement?: any): void;
+	preWalkWithStatement(statement?: any): void;
+	walkWithStatement(statement?: any): void;
+	preWalkSwitchStatement(statement?: any): void;
+	walkSwitchStatement(statement?: any): void;
+	walkTerminatingStatement(statement?: any): void;
+	walkReturnStatement(statement?: any): void;
+	walkThrowStatement(statement?: any): void;
+	preWalkTryStatement(statement?: any): void;
+	walkTryStatement(statement?: any): void;
+	preWalkWhileStatement(statement?: any): void;
+	walkWhileStatement(statement?: any): void;
+	preWalkDoWhileStatement(statement?: any): void;
+	walkDoWhileStatement(statement?: any): void;
+	preWalkForStatement(statement?: any): void;
+	walkForStatement(statement?: any): void;
+	preWalkForInStatement(statement?: any): void;
+	walkForInStatement(statement?: any): void;
+	preWalkForOfStatement(statement?: any): void;
+	walkForOfStatement(statement?: any): void;
+	preWalkFunctionDeclaration(statement?: any): void;
+	walkFunctionDeclaration(statement?: any): void;
+	blockPreWalkImportDeclaration(statement?: any): void;
+	enterDeclaration(declaration?: any, onIdent?: any): void;
+	blockPreWalkExportNamedDeclaration(statement?: any): void;
+	walkExportNamedDeclaration(statement?: any): void;
+	blockPreWalkExportDefaultDeclaration(statement?: any): void;
+	walkExportDefaultDeclaration(statement?: any): void;
+	blockPreWalkExportAllDeclaration(statement?: any): void;
+	preWalkVariableDeclaration(statement?: any): void;
+	blockPreWalkVariableDeclaration(statement?: any): void;
+	walkVariableDeclaration(statement?: any): void;
+	blockPreWalkClassDeclaration(statement?: any): void;
+	walkClassDeclaration(statement?: any): void;
+	preWalkSwitchCases(switchCases?: any): void;
+	walkSwitchCases(switchCases?: any): void;
+	preWalkCatchClause(catchClause?: any): void;
+	walkCatchClause(catchClause?: any): void;
+	walkPattern(pattern?: any): void;
+	walkAssignmentPattern(pattern?: any): void;
+	walkObjectPattern(pattern?: any): void;
+	walkArrayPattern(pattern?: any): void;
+	walkRestElement(pattern?: any): void;
+	walkExpressions(expressions?: any): void;
+	walkExpression(expression?: any): void;
+	walkAwaitExpression(expression?: any): void;
+	walkArrayExpression(expression?: any): void;
+	walkSpreadElement(expression?: any): void;
+	walkObjectExpression(expression?: any): void;
+	walkProperty(prop?: any): void;
+	walkFunctionExpression(expression?: any): void;
+	walkArrowFunctionExpression(expression?: any): void;
+	walkSequenceExpression(expression: SequenceExpression): void;
+	walkUpdateExpression(expression?: any): void;
+	walkUnaryExpression(expression?: any): void;
+	walkLeftRightExpression(expression?: any): void;
+	walkBinaryExpression(expression?: any): void;
+	walkLogicalExpression(expression?: any): void;
+	walkAssignmentExpression(expression?: any): void;
+	walkConditionalExpression(expression?: any): void;
+	walkNewExpression(expression?: any): void;
+	walkYieldExpression(expression?: any): void;
+	walkTemplateLiteral(expression?: any): void;
+	walkTaggedTemplateExpression(expression?: any): void;
+	walkClassExpression(expression?: any): void;
+	walkChainExpression(expression: ChainExpression): void;
+	walkImportExpression(expression?: any): void;
+	walkCallExpression(expression?: any): void;
+	walkMemberExpression(expression?: any): void;
+	walkMemberExpressionWithExpressionName(
+		expression?: any,
+		name?: any,
+		rootInfo?: any,
+		members?: any,
+		onUnhandled?: any
+	): void;
+	walkThisExpression(expression?: any): void;
+	walkIdentifier(expression?: any): void;
+	walkMetaProperty(metaProperty: MetaProperty): void;
+	callHooksForExpression(hookMap: any, expr: any, ...args: any[]): any;
+	callHooksForExpressionWithFallback<T, R>(
+		hookMap: HookMap<SyncBailHook<T, R>>,
+		expr: MemberExpression,
+		fallback: (
+			arg0: string,
+			arg1: string | ScopeInfo | VariableInfo,
+			arg2: () => string[]
+		) => any,
+		defined: (arg0: string) => any,
+		...args: AsArray<T>
+	): R;
+	callHooksForName<T, R>(
+		hookMap: HookMap<SyncBailHook<T, R>>,
+		name: string,
+		...args: AsArray<T>
+	): R;
+	callHooksForInfo<T, R>(
+		hookMap: HookMap<SyncBailHook<T, R>>,
+		info: ExportedVariableInfo,
+		...args: AsArray<T>
+	): R;
+	callHooksForInfoWithFallback<T, R>(
+		hookMap: HookMap<SyncBailHook<T, R>>,
+		info: ExportedVariableInfo,
+		fallback: (arg0: string) => any,
+		defined: () => any,
+		...args: AsArray<T>
+	): R;
+	callHooksForNameWithFallback<T, R>(
+		hookMap: HookMap<SyncBailHook<T, R>>,
+		name: string,
+		fallback: (arg0: string) => any,
+		defined: () => any,
+		...args: AsArray<T>
+	): R;
+	inScope(params: any, fn: () => void): void;
+	inFunctionScope(hasThis?: any, params?: any, fn?: any): void;
+	inBlockScope(fn?: any): void;
+	detectMode(statements?: any): void;
+	enterPatterns(patterns?: any, onIdent?: any): void;
+	enterPattern(pattern?: any, onIdent?: any): void;
+	enterIdentifier(pattern?: any, onIdent?: any): void;
+	enterObjectPattern(pattern?: any, onIdent?: any): void;
+	enterArrayPattern(pattern?: any, onIdent?: any): void;
+	enterRestElement(pattern?: any, onIdent?: any): void;
+	enterAssignmentPattern(pattern?: any, onIdent?: any): void;
+	evaluateExpression(
+		expression: Expression
+	): undefined | BasicEvaluatedExpression;
+	parseString(expression?: any): any;
+	parseCalculatedString(expression?: any): any;
+	evaluate(source?: any): undefined | BasicEvaluatedExpression;
+	isPure(
+		expr:
+			| undefined
+			| null
+			| UnaryExpression
+			| ThisExpression
+			| ArrayExpression
+			| ObjectExpression
+			| FunctionExpression
+			| ArrowFunctionExpression
+			| YieldExpression
+			| SimpleLiteral
+			| RegExpLiteral
+			| BigIntLiteral
+			| UpdateExpression
+			| BinaryExpression
+			| AssignmentExpression
+			| LogicalExpression
+			| MemberExpression
+			| ConditionalExpression
+			| SimpleCallExpression
+			| NewExpression
+			| SequenceExpression
+			| TemplateLiteral
+			| TaggedTemplateExpression
+			| ClassExpression
+			| MetaProperty
+			| Identifier
+			| AwaitExpression
+			| ImportExpression
+			| ChainExpression
+			| FunctionDeclaration
+			| VariableDeclaration
+			| ClassDeclaration
+			| PrivateIdentifier,
+		commentsStartPos: number
+	): boolean;
+	getComments(range?: any): any[];
+	isAsiPosition(pos: number): boolean;
+	unsetAsiPosition(pos: number): void;
+	isStatementLevelExpression(expr?: any): boolean;
+	getTagData(name?: any, tag?: any): any;
+	tagVariable(name?: any, tag?: any, data?: any): void;
+	defineVariable(name?: any): void;
+	undefineVariable(name?: any): void;
+	isVariableDefined(name?: any): boolean;
+	getVariableInfo(name: string): ExportedVariableInfo;
+	setVariable(name: string, variableInfo: ExportedVariableInfo): void;
+	parseCommentOptions(
+		range?: any
+	): { options: null; errors: null } | { options: object; errors: unknown[] };
+	extractMemberExpressionChain(expression: MemberExpression): {
+		members: string[];
+		object:
+			| UnaryExpression
+			| ThisExpression
+			| ArrayExpression
+			| ObjectExpression
+			| FunctionExpression
+			| ArrowFunctionExpression
+			| YieldExpression
+			| SimpleLiteral
+			| RegExpLiteral
+			| BigIntLiteral
+			| UpdateExpression
+			| BinaryExpression
+			| AssignmentExpression
+			| LogicalExpression
+			| MemberExpression
+			| ConditionalExpression
+			| SimpleCallExpression
+			| NewExpression
+			| SequenceExpression
+			| TemplateLiteral
+			| TaggedTemplateExpression
+			| ClassExpression
+			| MetaProperty
+			| Identifier
+			| AwaitExpression
+			| ImportExpression
+			| ChainExpression
+			| Super;
+	};
+	getFreeInfoFromVariable(varName: string): {
+		name: string;
+		info: string | VariableInfo;
+	};
+	getMemberExpressionInfo(
+		expression: MemberExpression,
+		allowedTypes: number
+	): undefined | CallExpressionInfo | ExpressionExpressionInfo;
+	getNameForExpression(expression: MemberExpression): {
+		name: string;
+		rootInfo: ExportedVariableInfo;
+		getMembers: () => string[];
+	};
+	static ALLOWED_MEMBER_TYPES_ALL: 3;
+	static ALLOWED_MEMBER_TYPES_EXPRESSION: 2;
+	static ALLOWED_MEMBER_TYPES_CALL_EXPRESSION: 1;
+}
+
+/**
+ * Parser options for javascript modules.
+ */
+declare interface JavascriptParserOptions {
+	[index: string]: any;
+
+	/**
+	 * Set the value of `require.amd` and `define.amd`. Or disable AMD support.
+	 */
+	amd?: false | { [index: string]: any };
+
+	/**
+	 * Enable/disable special handling for browserify bundles.
+	 */
+	browserify?: boolean;
+
+	/**
+	 * Enable/disable parsing of CommonJs syntax.
+	 */
+	commonjs?: boolean;
+
+	/**
+	 * Enable/disable parsing of magic comments in CommonJs syntax.
+	 */
+	commonjsMagicComments?: boolean;
+
+	/**
+	 * Specifies the behavior of invalid export names in "import ... from ..." and "export ... from ...".
+	 */
+	exportsPresence?: false | "auto" | "error" | "warn";
+
+	/**
+	 * Enable warnings for full dynamic dependencies.
+	 */
+	exprContextCritical?: boolean;
+
+	/**
+	 * Enable recursive directory lookup for full dynamic dependencies.
+	 */
+	exprContextRecursive?: boolean;
+
+	/**
+	 * Sets the default regular expression for full dynamic dependencies.
+	 */
+	exprContextRegExp?: boolean | RegExp;
+
+	/**
+	 * Set the default request for full dynamic dependencies.
+	 */
+	exprContextRequest?: string;
+
+	/**
+	 * Enable/disable parsing of EcmaScript Modules syntax.
+	 */
+	harmony?: boolean;
+
+	/**
+	 * Enable/disable parsing of import() syntax.
+	 */
+	import?: boolean;
+
+	/**
+	 * Specifies the behavior of invalid export names in "import ... from ...".
+	 */
+	importExportsPresence?: false | "auto" | "error" | "warn";
+
+	/**
+	 * Enable/disable evaluating import.meta.
+	 */
+	importMeta?: boolean;
+
+	/**
+	 * Enable/disable evaluating import.meta.webpackContext.
+	 */
+	importMetaContext?: boolean;
+
+	/**
+	 * Include polyfills or mocks for various node stuff.
+	 */
+	node?: false | NodeOptions;
+
+	/**
+	 * Specifies the behavior of invalid export names in "export ... from ...". This might be useful to disable during the migration from "export ... from ..." to "export type ... from ..." when reexporting types in TypeScript.
+	 */
+	reexportExportsPresence?: false | "auto" | "error" | "warn";
+
+	/**
+	 * Enable/disable parsing of require.context syntax.
+	 */
+	requireContext?: boolean;
+
+	/**
+	 * Enable/disable parsing of require.ensure syntax.
+	 */
+	requireEnsure?: boolean;
+
+	/**
+	 * Enable/disable parsing of require.include syntax.
+	 */
+	requireInclude?: boolean;
+
+	/**
+	 * Enable/disable parsing of require.js special syntax like require.config, requirejs.config, require.version and requirejs.onError.
+	 */
+	requireJs?: boolean;
+
+	/**
+	 * Deprecated in favor of "exportsPresence". Emit errors instead of warnings when imported names don't exist in imported module.
+	 */
+	strictExportPresence?: boolean;
+
+	/**
+	 * Handle the this context correctly according to the spec for namespace objects.
+	 */
+	strictThisContextOnImports?: boolean;
+
+	/**
+	 * Enable/disable parsing of System.js special syntax like System.import, System.get, System.set and System.register.
+	 */
+	system?: boolean;
+
+	/**
+	 * Enable warnings when using the require function in a not statically analyse-able way.
+	 */
+	unknownContextCritical?: boolean;
+
+	/**
+	 * Enable recursive directory lookup when using the require function in a not statically analyse-able way.
+	 */
+	unknownContextRecursive?: boolean;
+
+	/**
+	 * Sets the regular expression when using the require function in a not statically analyse-able way.
+	 */
+	unknownContextRegExp?: boolean | RegExp;
+
+	/**
+	 * Sets the request when using the require function in a not statically analyse-able way.
+	 */
+	unknownContextRequest?: string;
+
+	/**
+	 * Enable/disable parsing of new URL() syntax.
+	 */
+	url?: boolean | "relative";
+
+	/**
+	 * Disable or configure parsing of WebWorker syntax like new Worker() or navigator.serviceWorker.register().
+	 */
+	worker?: boolean | string[];
+
+	/**
+	 * Enable warnings for partial dynamic dependencies.
+	 */
+	wrappedContextCritical?: boolean;
+
+	/**
+	 * Enable recursive directory lookup for partial dynamic dependencies.
+	 */
+	wrappedContextRecursive?: boolean;
+
+	/**
+	 * Set the inner regular expression for partial dynamic dependencies.
+	 */
+	wrappedContextRegExp?: RegExp;
+}
+declare class JsonpChunkLoadingRuntimeModule extends RuntimeModule {
+	constructor(runtimeRequirements?: any);
+	static getCompilationHooks(
+		compilation: Compilation
+	): JsonpCompilationPluginHooks;
+
+	/**
+	 * Runtime modules without any dependencies to other runtime modules
+	 */
+	static STAGE_NORMAL: number;
+
+	/**
+	 * Runtime modules with simple dependencies on other runtime modules
+	 */
+	static STAGE_BASIC: number;
+
+	/**
+	 * Runtime modules which attach to handlers of other runtime modules
+	 */
+	static STAGE_ATTACH: number;
+
+	/**
+	 * Runtime modules which trigger actions on bootstrap
+	 */
+	static STAGE_TRIGGER: number;
+}
+declare interface JsonpCompilationPluginHooks {
+	linkPreload: SyncWaterfallHook<[string, Chunk]>;
+	linkPrefetch: SyncWaterfallHook<[string, Chunk]>;
+}
+declare class JsonpTemplatePlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static getCompilationHooks(
+		compilation: Compilation
+	): JsonpCompilationPluginHooks;
+}
+declare interface KnownAssetInfo {
+	/**
+	 * true, if the asset can be long term cached forever (contains a hash)
+	 */
+	immutable?: boolean;
+
+	/**
+	 * whether the asset is minimized
+	 */
+	minimized?: boolean;
+
+	/**
+	 * the value(s) of the full hash used for this asset
+	 */
+	fullhash?: string | string[];
+
+	/**
+	 * the value(s) of the chunk hash used for this asset
+	 */
+	chunkhash?: string | string[];
+
+	/**
+	 * the value(s) of the module hash used for this asset
+	 */
+	modulehash?: string | string[];
+
+	/**
+	 * the value(s) of the content hash used for this asset
+	 */
+	contenthash?: string | string[];
+
+	/**
+	 * when asset was created from a source file (potentially transformed), the original filename relative to compilation context
+	 */
+	sourceFilename?: string;
+
+	/**
+	 * size in bytes, only set after asset has been emitted
+	 */
+	size?: number;
+
+	/**
+	 * true, when asset is only used for development and doesn't count towards user-facing assets
+	 */
+	development?: boolean;
+
+	/**
+	 * true, when asset ships data for updating an existing application (HMR)
+	 */
+	hotModuleReplacement?: boolean;
+
+	/**
+	 * true, when asset is javascript and an ESM
+	 */
+	javascriptModule?: boolean;
+
+	/**
+	 * object of pointers to other assets, keyed by type of relation (only points from parent to child)
+	 */
+	related?: Record<string, string | string[]>;
+}
+declare interface KnownBuildMeta {
+	moduleArgument?: string;
+	exportsArgument?: string;
+	strict?: boolean;
+	moduleConcatenationBailout?: string;
+	exportsType?: "namespace" | "dynamic" | "default" | "flagged";
+	defaultObject?: false | "redirect" | "redirect-warn";
+	strictHarmonyModule?: boolean;
+	async?: boolean;
+	sideEffectFree?: boolean;
+}
+declare interface KnownCreateStatsOptionsContext {
+	forToString?: boolean;
+}
+declare interface KnownNormalizedStatsOptions {
+	context: string;
+	requestShortener: RequestShortener;
+	chunksSort: string;
+	modulesSort: string;
+	chunkModulesSort: string;
+	nestedModulesSort: string;
+	assetsSort: string;
+	ids: boolean;
+	cachedAssets: boolean;
+	groupAssetsByEmitStatus: boolean;
+	groupAssetsByPath: boolean;
+	groupAssetsByExtension: boolean;
+	assetsSpace: number;
+	excludeAssets: ((value: string, asset: StatsAsset) => boolean)[];
+	excludeModules: ((
+		name: string,
+		module: StatsModule,
+		type: "module" | "chunk" | "root-of-chunk" | "nested"
+	) => boolean)[];
+	warningsFilter: ((warning: StatsError, textValue: string) => boolean)[];
+	cachedModules: boolean;
+	orphanModules: boolean;
+	dependentModules: boolean;
+	runtimeModules: boolean;
+	groupModulesByCacheStatus: boolean;
+	groupModulesByLayer: boolean;
+	groupModulesByAttributes: boolean;
+	groupModulesByPath: boolean;
+	groupModulesByExtension: boolean;
+	groupModulesByType: boolean;
+	entrypoints: boolean | "auto";
+	chunkGroups: boolean;
+	chunkGroupAuxiliary: boolean;
+	chunkGroupChildren: boolean;
+	chunkGroupMaxAssets: number;
+	modulesSpace: number;
+	chunkModulesSpace: number;
+	nestedModulesSpace: number;
+	logging: false | "none" | "error" | "warn" | "info" | "log" | "verbose";
+	loggingDebug: ((value: string) => boolean)[];
+	loggingTrace: boolean;
+}
+declare interface KnownStatsAsset {
+	type: string;
+	name: string;
+	info: AssetInfo;
+	size: number;
+	emitted: boolean;
+	comparedForEmit: boolean;
+	cached: boolean;
+	related?: StatsAsset[];
+	chunkNames?: (string | number)[];
+	chunkIdHints?: (string | number)[];
+	chunks?: (string | number)[];
+	auxiliaryChunkNames?: (string | number)[];
+	auxiliaryChunks?: (string | number)[];
+	auxiliaryChunkIdHints?: (string | number)[];
+	filteredRelated?: number;
+	isOverSizeLimit?: boolean;
+}
+declare interface KnownStatsChunk {
+	rendered: boolean;
+	initial: boolean;
+	entry: boolean;
+	recorded: boolean;
+	reason?: string;
+	size: number;
+	sizes?: Record<string, number>;
+	names?: string[];
+	idHints?: string[];
+	runtime?: string[];
+	files?: string[];
+	auxiliaryFiles?: string[];
+	hash: string;
+	childrenByOrder?: Record<string, (string | number)[]>;
+	id?: string | number;
+	siblings?: (string | number)[];
+	parents?: (string | number)[];
+	children?: (string | number)[];
+	modules?: StatsModule[];
+	filteredModules?: number;
+	origins?: StatsChunkOrigin[];
+}
+declare interface KnownStatsChunkGroup {
+	name?: string;
+	chunks?: (string | number)[];
+	assets?: { name: string; size?: number }[];
+	filteredAssets?: number;
+	assetsSize?: number;
+	auxiliaryAssets?: { name: string; size?: number }[];
+	filteredAuxiliaryAssets?: number;
+	auxiliaryAssetsSize?: number;
+	children?: { [index: string]: StatsChunkGroup[] };
+	childAssets?: { [index: string]: string[] };
+	isOverSizeLimit?: boolean;
+}
+declare interface KnownStatsChunkOrigin {
+	module?: string;
+	moduleIdentifier?: string;
+	moduleName?: string;
+	loc?: string;
+	request?: string;
+	moduleId?: string | number;
+}
+declare interface KnownStatsCompilation {
+	env?: any;
+	name?: string;
+	hash?: string;
+	version?: string;
+	time?: number;
+	builtAt?: number;
+	needAdditionalPass?: boolean;
+	publicPath?: string;
+	outputPath?: string;
+	assetsByChunkName?: Record<string, string[]>;
+	assets?: StatsAsset[];
+	filteredAssets?: number;
+	chunks?: StatsChunk[];
+	modules?: StatsModule[];
+	filteredModules?: number;
+	entrypoints?: Record<string, StatsChunkGroup>;
+	namedChunkGroups?: Record<string, StatsChunkGroup>;
+	errors?: StatsError[];
+	errorsCount?: number;
+	warnings?: StatsError[];
+	warningsCount?: number;
+	children?: StatsCompilation[];
+	logging?: Record<string, StatsLogging>;
+}
+declare interface KnownStatsError {
+	message: string;
+	chunkName?: string;
+	chunkEntry?: boolean;
+	chunkInitial?: boolean;
+	file?: string;
+	moduleIdentifier?: string;
+	moduleName?: string;
+	loc?: string;
+	chunkId?: string | number;
+	moduleId?: string | number;
+	moduleTrace?: StatsModuleTraceItem[];
+	details?: any;
+	stack?: string;
+}
+declare interface KnownStatsFactoryContext {
+	type: string;
+	makePathsRelative?: (arg0: string) => string;
+	compilation?: Compilation;
+	rootModules?: Set<Module>;
+	compilationFileToChunks?: Map<string, Chunk[]>;
+	compilationAuxiliaryFileToChunks?: Map<string, Chunk[]>;
+	runtime?: RuntimeSpec;
+	cachedGetErrors?: (arg0: Compilation) => WebpackError[];
+	cachedGetWarnings?: (arg0: Compilation) => WebpackError[];
+}
+declare interface KnownStatsLogging {
+	entries: StatsLoggingEntry[];
+	filteredEntries: number;
+	debug: boolean;
+}
+declare interface KnownStatsLoggingEntry {
+	type: string;
+	message: string;
+	trace?: string[];
+	children?: StatsLoggingEntry[];
+	args?: any[];
+	time?: number;
+}
+declare interface KnownStatsModule {
+	type?: string;
+	moduleType?: string;
+	layer?: string;
+	identifier?: string;
+	name?: string;
+	nameForCondition?: string;
+	index?: number;
+	preOrderIndex?: number;
+	index2?: number;
+	postOrderIndex?: number;
+	size?: number;
+	sizes?: { [index: string]: number };
+	cacheable?: boolean;
+	built?: boolean;
+	codeGenerated?: boolean;
+	buildTimeExecuted?: boolean;
+	cached?: boolean;
+	optional?: boolean;
+	orphan?: boolean;
+	id?: string | number;
+	issuerId?: string | number;
+	chunks?: (string | number)[];
+	assets?: (string | number)[];
+	dependent?: boolean;
+	issuer?: string;
+	issuerName?: string;
+	issuerPath?: StatsModuleIssuer[];
+	failed?: boolean;
+	errors?: number;
+	warnings?: number;
+	profile?: StatsProfile;
+	reasons?: StatsModuleReason[];
+	usedExports?: boolean | string[];
+	providedExports?: string[];
+	optimizationBailout?: string[];
+	depth?: number;
+	modules?: StatsModule[];
+	filteredModules?: number;
+	source?: string | Buffer;
+}
+declare interface KnownStatsModuleIssuer {
+	identifier?: string;
+	name?: string;
+	id?: string | number;
+	profile?: StatsProfile;
+}
+declare interface KnownStatsModuleReason {
+	moduleIdentifier?: string;
+	module?: string;
+	moduleName?: string;
+	resolvedModuleIdentifier?: string;
+	resolvedModule?: string;
+	type?: string;
+	active: boolean;
+	explanation?: string;
+	userRequest?: string;
+	loc?: string;
+	moduleId?: string | number;
+	resolvedModuleId?: string | number;
+}
+declare interface KnownStatsModuleTraceDependency {
+	loc?: string;
+}
+declare interface KnownStatsModuleTraceItem {
+	originIdentifier?: string;
+	originName?: string;
+	moduleIdentifier?: string;
+	moduleName?: string;
+	dependencies?: StatsModuleTraceDependency[];
+	originId?: string | number;
+	moduleId?: string | number;
+}
+declare interface KnownStatsPrinterContext {
+	type?: string;
+	compilation?: StatsCompilation;
+	chunkGroup?: StatsChunkGroup;
+	asset?: StatsAsset;
+	module?: StatsModule;
+	chunk?: StatsChunk;
+	moduleReason?: StatsModuleReason;
+	bold?: (str: string) => string;
+	yellow?: (str: string) => string;
+	red?: (str: string) => string;
+	green?: (str: string) => string;
+	magenta?: (str: string) => string;
+	cyan?: (str: string) => string;
+	formatFilename?: (file: string, oversize?: boolean) => string;
+	formatModuleId?: (id: string) => string;
+	formatChunkId?: (
+		id: string,
+		direction?: "parent" | "child" | "sibling"
+	) => string;
+	formatSize?: (size: number) => string;
+	formatDateTime?: (dateTime: number) => string;
+	formatFlag?: (flag: string) => string;
+	formatTime?: (time: number, boldQuantity?: boolean) => string;
+	chunkGroupKind?: string;
+}
+declare interface KnownStatsProfile {
+	total: number;
+	resolving: number;
+	restoring: number;
+	building: number;
+	integration: number;
+	storing: number;
+	additionalResolving: number;
+	additionalIntegration: number;
+	factory: number;
+	dependencies: number;
+}
+
+/**
+ * Options for the default backend.
+ */
+declare interface LazyCompilationDefaultBackendOptions {
+	/**
+	 * A custom client.
+	 */
+	client?: string;
+
+	/**
+	 * Specifies where to listen to from the server.
+	 */
+	listen?: number | ListenOptions | ((server: typeof Server) => void);
+
+	/**
+	 * Specifies the protocol the client should use to connect to the server.
+	 */
+	protocol?: "http" | "https";
+
+	/**
+	 * Specifies how to create the server handling the EventSource requests.
+	 */
+	server?: ServerOptionsImport | ServerOptionsHttps | (() => typeof Server);
+}
+
+/**
+ * Options for compiling entrypoints and import()s only when they are accessed.
+ */
+declare interface LazyCompilationOptions {
+	/**
+	 * Specifies the backend that should be used for handling client keep alive.
+	 */
+	backend?:
+		| ((
+				compiler: Compiler,
+				callback: (err?: Error, api?: BackendApi) => void
+		  ) => void)
+		| ((compiler: Compiler) => Promise<BackendApi>)
+		| LazyCompilationDefaultBackendOptions;
+
+	/**
+	 * Enable/disable lazy compilation for entries.
+	 */
+	entries?: boolean;
+
+	/**
+	 * Enable/disable lazy compilation for import() modules.
+	 */
+	imports?: boolean;
+
+	/**
+	 * Specify which entrypoints or import()ed modules should be lazily compiled. This is matched with the imported module and not the entrypoint name.
+	 */
+	test?: string | RegExp | ((module: Module) => boolean);
+}
+declare class LazySet<T> {
+	constructor(iterable?: Iterable<T>);
+	readonly size: number;
+	add(item: T): LazySet<T>;
+	addAll(iterable: LazySet<T> | Iterable<T>): LazySet<T>;
+	clear(): void;
+	delete(value: T): boolean;
+	entries(): IterableIterator<[T, T]>;
+	forEach(
+		callbackFn: (arg0: T, arg1: T, arg2: Set<T>) => void,
+		thisArg?: any
+	): void;
+	has(item: T): boolean;
+	keys(): IterableIterator<T>;
+	values(): IterableIterator<T>;
+	serialize(__0: { write: any }): void;
+	[Symbol.iterator](): IterableIterator<T>;
+	static deserialize(__0: { read: any }): LazySet<any>;
+}
+declare interface LibIdentOptions {
+	/**
+	 * absolute context path to which lib ident is relative to
+	 */
+	context: string;
+
+	/**
+	 * object for caching
+	 */
+	associatedObjectForCache?: Object;
+}
+declare class LibManifestPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface LibraryContext<T> {
+	compilation: Compilation;
+	chunkGraph: ChunkGraph;
+	options: T;
+}
+
+/**
+ * Set explicit comments for `commonjs`, `commonjs2`, `amd`, and `root`.
+ */
+declare interface LibraryCustomUmdCommentObject {
+	/**
+	 * Set comment for `amd` section in UMD.
+	 */
+	amd?: string;
+
+	/**
+	 * Set comment for `commonjs` (exports) section in UMD.
+	 */
+	commonjs?: string;
+
+	/**
+	 * Set comment for `commonjs2` (module.exports) section in UMD.
+	 */
+	commonjs2?: string;
+
+	/**
+	 * Set comment for `root` (global variable) section in UMD.
+	 */
+	root?: string;
+}
+
+/**
+ * Description object for all UMD variants of the library name.
+ */
+declare interface LibraryCustomUmdObject {
+	/**
+	 * Name of the exposed AMD library in the UMD.
+	 */
+	amd?: string;
+
+	/**
+	 * Name of the exposed commonjs export in the UMD.
+	 */
+	commonjs?: string;
+
+	/**
+	 * Name of the property exposed globally by a UMD library.
+	 */
+	root?: string | string[];
+}
+type LibraryExport = string | string[];
+type LibraryName = string | string[] | LibraryCustomUmdObject;
+
+/**
+ * Options for library.
+ */
+declare interface LibraryOptions {
+	/**
+	 * Add a comment in the UMD wrapper.
+	 */
+	auxiliaryComment?: string | LibraryCustomUmdCommentObject;
+
+	/**
+	 * Specify which export should be exposed as library.
+	 */
+	export?: string | string[];
+
+	/**
+	 * The name of the library (some types allow unnamed libraries too).
+	 */
+	name?: string | string[] | LibraryCustomUmdObject;
+
+	/**
+	 * Type of library (types included by default are 'var', 'module', 'assign', 'assign-properties', 'this', 'window', 'self', 'global', 'commonjs', 'commonjs2', 'commonjs-module', 'commonjs-static', 'amd', 'amd-require', 'umd', 'umd2', 'jsonp', 'system', but others might be added by plugins).
+	 */
+	type: string;
+
+	/**
+	 * If `output.libraryTarget` is set to umd and `output.library` is set, setting this to true will name the AMD module.
+	 */
+	umdNamedDefine?: boolean;
+}
+declare class LibraryTemplatePlugin {
+	constructor(
+		name: LibraryName,
+		target: string,
+		umdNamedDefine: boolean,
+		auxiliaryComment: AuxiliaryComment,
+		exportProperty: LibraryExport
+	);
+	library: {
+		type: string;
+		name: LibraryName;
+		umdNamedDefine: boolean;
+		auxiliaryComment: AuxiliaryComment;
+		export: LibraryExport;
+	};
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class LimitChunkCountPlugin {
+	constructor(options?: LimitChunkCountPluginOptions);
+	options?: LimitChunkCountPluginOptions;
+	apply(compiler: Compiler): void;
+}
+declare interface LimitChunkCountPluginOptions {
+	/**
+	 * Constant overhead for a chunk.
+	 */
+	chunkOverhead?: number;
+
+	/**
+	 * Multiplicator for initial chunks.
+	 */
+	entryChunkMultiplicator?: number;
+
+	/**
+	 * Limit the maximum number of chunks using a value greater greater than or equal to 1.
+	 */
+	maxChunks: number;
+}
+declare interface LoadScriptCompilationHooks {
+	createScript: SyncWaterfallHook<[string, Chunk]>;
+}
+declare class LoadScriptRuntimeModule extends HelperRuntimeModule {
+	constructor(withCreateScriptUrl?: boolean);
+	static getCompilationHooks(
+		compilation: Compilation
+	): LoadScriptCompilationHooks;
+
+	/**
+	 * Runtime modules without any dependencies to other runtime modules
+	 */
+	static STAGE_NORMAL: number;
+
+	/**
+	 * Runtime modules with simple dependencies on other runtime modules
+	 */
+	static STAGE_BASIC: number;
+
+	/**
+	 * Runtime modules which attach to handlers of other runtime modules
+	 */
+	static STAGE_ATTACH: number;
+
+	/**
+	 * Runtime modules which trigger actions on bootstrap
+	 */
+	static STAGE_TRIGGER: number;
+}
+
+/**
+ * Custom values available in the loader context.
+ */
+declare interface Loader {
+	[index: string]: any;
+}
+type LoaderContext<OptionsType> = NormalModuleLoaderContext<OptionsType> &
+	LoaderRunnerLoaderContext<OptionsType> &
+	LoaderPluginLoaderContext &
+	HotModuleReplacementPluginLoaderContext;
+type LoaderDefinition<
+	OptionsType = {},
+	ContextAdditions = {}
+> = LoaderDefinitionFunction<OptionsType, ContextAdditions> & {
+	raw?: false;
+	pitch?: PitchLoaderDefinitionFunction<OptionsType, ContextAdditions>;
+};
+declare interface LoaderDefinitionFunction<
+	OptionsType = {},
+	ContextAdditions = {}
+> {
+	(
+		this: NormalModuleLoaderContext<OptionsType> &
+			LoaderRunnerLoaderContext<OptionsType> &
+			LoaderPluginLoaderContext &
+			HotModuleReplacementPluginLoaderContext &
+			ContextAdditions,
+		content: string,
+		sourceMap?: string | SourceMap,
+		additionalData?: AdditionalData
+	): string | void | Buffer | Promise<string | Buffer>;
+}
+declare interface LoaderItem {
+	loader: string;
+	options: any;
+	ident: null | string;
+	type: null | string;
+}
+declare interface LoaderModule<OptionsType = {}, ContextAdditions = {}> {
+	default?:
+		| RawLoaderDefinitionFunction<OptionsType, ContextAdditions>
+		| LoaderDefinitionFunction<OptionsType, ContextAdditions>;
+	raw?: false;
+	pitch?: PitchLoaderDefinitionFunction<OptionsType, ContextAdditions>;
+}
+declare class LoaderOptionsPlugin {
+	constructor(options?: LoaderOptionsPluginOptions);
+	options: LoaderOptionsPluginOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface LoaderOptionsPluginOptions {
+	[index: string]: any;
+
+	/**
+	 * Whether loaders should be in debug mode or not. debug will be removed as of webpack 3.
+	 */
+	debug?: boolean;
+
+	/**
+	 * Where loaders can be switched to minimize mode.
+	 */
+	minimize?: boolean;
+
+	/**
+	 * A configuration object that can be used to configure older loaders.
+	 */
+	options?: {
+		[index: string]: any;
+		/**
+		 * The context that can be used to configure older loaders.
+		 */
+		context?: string;
+	};
+}
+
+/**
+ * These properties are added by the LoaderPlugin
+ */
+declare interface LoaderPluginLoaderContext {
+	/**
+	 * Resolves the given request to a module, applies all configured loaders and calls
+	 * back with the generated source, the sourceMap and the module instance (usually an
+	 * instance of NormalModule). Use this function if you need to know the source code
+	 * of another module to generate the result.
+	 */
+	loadModule(
+		request: string,
+		callback: (
+			err: null | Error,
+			source: string,
+			sourceMap: any,
+			module: NormalModule
+		) => void
+	): void;
+	importModule(
+		request: string,
+		options: ImportModuleOptions,
+		callback: (err?: null | Error, exports?: any) => any
+	): void;
+	importModule(request: string, options?: ImportModuleOptions): Promise<any>;
+}
+
+/**
+ * The properties are added by https://github.com/webpack/loader-runner
+ */
+declare interface LoaderRunnerLoaderContext<OptionsType> {
+	/**
+	 * Add a directory as dependency of the loader result.
+	 */
+	addContextDependency(context: string): void;
+
+	/**
+	 * Adds a file as dependency of the loader result in order to make them watchable.
+	 * For example, html-loader uses this technique as it finds src and src-set attributes.
+	 * Then, it sets the url's for those attributes as dependencies of the html file that is parsed.
+	 */
+	addDependency(file: string): void;
+	addMissingDependency(context: string): void;
+
+	/**
+	 * Make this loader async.
+	 */
+	async(): (
+		err?: null | Error,
+		content?: string | Buffer,
+		sourceMap?: string | SourceMap,
+		additionalData?: AdditionalData
+	) => void;
+
+	/**
+	 * Make this loader result cacheable. By default it's cacheable.
+	 * A cacheable loader must have a deterministic result, when inputs and dependencies haven't changed.
+	 * This means the loader shouldn't have other dependencies than specified with this.addDependency.
+	 * Most loaders are deterministic and cacheable.
+	 */
+	cacheable(flag?: boolean): void;
+	callback: (
+		err?: null | Error,
+		content?: string | Buffer,
+		sourceMap?: string | SourceMap,
+		additionalData?: AdditionalData
+	) => void;
+
+	/**
+	 * Remove all dependencies of the loader result. Even initial dependencies and these of other loaders.
+	 */
+	clearDependencies(): void;
+
+	/**
+	 * The directory of the module. Can be used as context for resolving other stuff.
+	 * eg '/workspaces/ts-loader/examples/vanilla/src'
+	 */
+	context: string;
+	readonly currentRequest: string;
+	readonly data: any;
+
+	/**
+	 * alias of addDependency
+	 * Adds a file as dependency of the loader result in order to make them watchable.
+	 * For example, html-loader uses this technique as it finds src and src-set attributes.
+	 * Then, it sets the url's for those attributes as dependencies of the html file that is parsed.
+	 */
+	dependency(file: string): void;
+	getContextDependencies(): string[];
+	getDependencies(): string[];
+	getMissingDependencies(): string[];
+
+	/**
+	 * The index in the loaders array of the current loader.
+	 * In the example: in loader1: 0, in loader2: 1
+	 */
+	loaderIndex: number;
+	readonly previousRequest: string;
+	readonly query: string | OptionsType;
+	readonly remainingRequest: string;
+	readonly request: string;
+
+	/**
+	 * An array of all the loaders. It is writeable in the pitch phase.
+	 * loaders = [{request: string, path: string, query: string, module: function}]
+	 * In the example:
+	 * [
+	 *   { request: "/abc/loader1.js?xyz",
+	 *     path: "/abc/loader1.js",
+	 *     query: "?xyz",
+	 *     module: [Function]
+	 *   },
+	 *   { request: "/abc/node_modules/loader2/index.js",
+	 *     path: "/abc/node_modules/loader2/index.js",
+	 *     query: "",
+	 *     module: [Function]
+	 *   }
+	 * ]
+	 */
+	loaders: {
+		request: string;
+		path: string;
+		query: string;
+		fragment: string;
+		options?: string | object;
+		ident: string;
+		normal?: Function;
+		pitch?: Function;
+		raw?: boolean;
+		data?: object;
+		pitchExecuted: boolean;
+		normalExecuted: boolean;
+	}[];
+
+	/**
+	 * The resource path.
+	 * In the example: "/abc/resource.js"
+	 */
+	resourcePath: string;
+
+	/**
+	 * The resource query string.
+	 * Example: "?query"
+	 */
+	resourceQuery: string;
+
+	/**
+	 * The resource fragment.
+	 * Example: "#frag"
+	 */
+	resourceFragment: string;
+
+	/**
+	 * The resource inclusive query and fragment.
+	 * Example: "/abc/resource.js?query#frag"
+	 */
+	resource: string;
+}
+declare class LoaderTargetPlugin {
+	constructor(target: string);
+	target: string;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface LogEntry {
+	type: string;
+	args: any[];
+	time: number;
+	trace?: string[];
+}
+declare const MEASURE_END_OPERATION: unique symbol;
+declare const MEASURE_START_OPERATION: unique symbol;
+declare interface MainRenderContext {
+	/**
+	 * the chunk
+	 */
+	chunk: Chunk;
+
+	/**
+	 * the dependency templates
+	 */
+	dependencyTemplates: DependencyTemplates;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * results of code generation
+	 */
+	codeGenerationResults: CodeGenerationResults;
+
+	/**
+	 * hash to be used for render call
+	 */
+	hash: string;
+
+	/**
+	 * rendering in strict context
+	 */
+	strictMode: boolean;
+}
+declare abstract class MainTemplate {
+	hooks: Readonly<{
+		renderManifest: { tap: (options?: any, fn?: any) => void };
+		modules: { tap: () => never };
+		moduleObj: { tap: () => never };
+		require: { tap: (options?: any, fn?: any) => void };
+		beforeStartup: { tap: () => never };
+		startup: { tap: () => never };
+		afterStartup: { tap: () => never };
+		render: { tap: (options?: any, fn?: any) => void };
+		renderWithEntry: { tap: (options?: any, fn?: any) => void };
+		assetPath: {
+			tap: (options?: any, fn?: any) => void;
+			call: (filename?: any, options?: any) => string;
+		};
+		hash: { tap: (options?: any, fn?: any) => void };
+		hashForChunk: { tap: (options?: any, fn?: any) => void };
+		globalHashPaths: { tap: () => void };
+		globalHash: { tap: () => void };
+		hotBootstrap: { tap: () => never };
+		bootstrap: SyncWaterfallHook<
+			[string, Chunk, string, ModuleTemplate, DependencyTemplates]
+		>;
+		localVars: SyncWaterfallHook<[string, Chunk, string]>;
+		requireExtensions: SyncWaterfallHook<[string, Chunk, string]>;
+		requireEnsure: SyncWaterfallHook<[string, Chunk, string, string]>;
+		readonly jsonpScript: SyncWaterfallHook<[string, Chunk]>;
+		readonly linkPrefetch: SyncWaterfallHook<[string, Chunk]>;
+		readonly linkPreload: SyncWaterfallHook<[string, Chunk]>;
+	}>;
+	renderCurrentHashCode: (hash: string, length?: number) => string;
+	getPublicPath: (options: object) => string;
+	getAssetPath: (path?: any, options?: any) => string;
+	getAssetPathWithInfo: (
+		path?: any,
+		options?: any
+	) => { path: string; info: AssetInfo };
+	readonly requireFn: "__webpack_require__";
+	readonly outputOptions: Output;
+}
+declare interface MapOptions {
+	columns?: boolean;
+	module?: boolean;
+}
+
+/**
+ * Options object for in-memory caching.
+ */
+declare interface MemoryCacheOptions {
+	/**
+	 * Additionally cache computation of modules that are unchanged and reference only unchanged modules.
+	 */
+	cacheUnaffected?: boolean;
+
+	/**
+	 * Number of generations unused cache entries stay in memory cache at minimum (1 = may be removed after unused for a single compilation, ..., Infinity: kept forever).
+	 */
+	maxGenerations?: number;
+
+	/**
+	 * In memory caching.
+	 */
+	type: "memory";
+}
+declare class MemoryCachePlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class MinChunkSizePlugin {
+	constructor(options: MinChunkSizePluginOptions);
+	options: MinChunkSizePluginOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface MinChunkSizePluginOptions {
+	/**
+	 * Constant overhead for a chunk.
+	 */
+	chunkOverhead?: number;
+
+	/**
+	 * Multiplicator for initial chunks.
+	 */
+	entryChunkMultiplicator?: number;
+
+	/**
+	 * Minimum number of characters.
+	 */
+	minChunkSize: number;
+}
+declare class Module extends DependenciesBlock {
+	constructor(type: string, context?: string, layer?: string);
+	type: string;
+	context: null | string;
+	layer: null | string;
+	needId: boolean;
+	debugId: number;
+	resolveOptions: ResolveOptionsWebpackOptions;
+	factoryMeta?: object;
+	useSourceMap: boolean;
+	useSimpleSourceMap: boolean;
+	buildMeta: BuildMeta;
+	buildInfo: Record<string, any>;
+	presentationalDependencies?: Dependency[];
+	codeGenerationDependencies?: Dependency[];
+	id: string | number;
+	readonly hash: string;
+	readonly renderedHash: string;
+	profile: null | ModuleProfile;
+	index: number;
+	index2: number;
+	depth: number;
+	issuer: null | Module;
+	readonly usedExports: null | boolean | SortableSet<string>;
+	readonly optimizationBailout: (
+		| string
+		| ((requestShortener: RequestShortener) => string)
+	)[];
+	readonly optional: boolean;
+	addChunk(chunk?: any): boolean;
+	removeChunk(chunk?: any): void;
+	isInChunk(chunk?: any): boolean;
+	isEntryModule(): boolean;
+	getChunks(): Chunk[];
+	getNumberOfChunks(): number;
+	readonly chunksIterable: Iterable<Chunk>;
+	isProvided(exportName: string): null | boolean;
+	readonly exportsArgument: string;
+	readonly moduleArgument: string;
+	getExportsType(
+		moduleGraph: ModuleGraph,
+		strict: boolean
+	): "namespace" | "default-only" | "default-with-named" | "dynamic";
+	addPresentationalDependency(presentationalDependency: Dependency): void;
+	addCodeGenerationDependency(codeGenerationDependency: Dependency): void;
+	addWarning(warning: WebpackError): void;
+	getWarnings(): undefined | Iterable<WebpackError>;
+	getNumberOfWarnings(): number;
+	addError(error: WebpackError): void;
+	getErrors(): undefined | Iterable<WebpackError>;
+	getNumberOfErrors(): number;
+
+	/**
+	 * removes all warnings and errors
+	 */
+	clearWarningsAndErrors(): void;
+	isOptional(moduleGraph: ModuleGraph): boolean;
+	isAccessibleInChunk(
+		chunkGraph: ChunkGraph,
+		chunk: Chunk,
+		ignoreChunk?: Chunk
+	): boolean;
+	isAccessibleInChunkGroup(
+		chunkGraph: ChunkGraph,
+		chunkGroup: ChunkGroup,
+		ignoreChunk?: Chunk
+	): boolean;
+	hasReasonForChunk(
+		chunk: Chunk,
+		moduleGraph: ModuleGraph,
+		chunkGraph: ChunkGraph
+	): boolean;
+	hasReasons(moduleGraph: ModuleGraph, runtime: RuntimeSpec): boolean;
+	needBuild(
+		context: NeedBuildContext,
+		callback: (arg0?: null | WebpackError, arg1?: boolean) => void
+	): void;
+	needRebuild(
+		fileTimestamps: Map<string, null | number>,
+		contextTimestamps: Map<string, null | number>
+	): boolean;
+	invalidateBuild(): void;
+	identifier(): string;
+	readableIdentifier(requestShortener: RequestShortener): string;
+	build(
+		options: WebpackOptionsNormalized,
+		compilation: Compilation,
+		resolver: ResolverWithOptions,
+		fs: InputFileSystem,
+		callback: (arg0?: WebpackError) => void
+	): void;
+	getSourceTypes(): Set<string>;
+	source(
+		dependencyTemplates: DependencyTemplates,
+		runtimeTemplate: RuntimeTemplate,
+		type?: string
+	): Source;
+	size(type?: string): number;
+	libIdent(options: LibIdentOptions): null | string;
+	nameForCondition(): null | string;
+	getConcatenationBailoutReason(
+		context: ConcatenationBailoutReasonContext
+	): undefined | string;
+	getSideEffectsConnectionState(moduleGraph: ModuleGraph): ConnectionState;
+	codeGeneration(context: CodeGenerationContext): CodeGenerationResult;
+	chunkCondition(chunk: Chunk, compilation: Compilation): boolean;
+	hasChunkCondition(): boolean;
+
+	/**
+	 * Assuming this module is in the cache. Update the (cached) module with
+	 * the fresh module from the factory. Usually updates internal references
+	 * and properties.
+	 */
+	updateCacheModule(module: Module): void;
+
+	/**
+	 * Module should be unsafe cached. Get data that's needed for that.
+	 * This data will be passed to restoreFromUnsafeCache later.
+	 */
+	getUnsafeCacheData(): object;
+
+	/**
+	 * Assuming this module is in the cache. Remove internal references to allow freeing some memory.
+	 */
+	cleanupForCache(): void;
+	originalSource(): null | Source;
+	addCacheDependencies(
+		fileDependencies: LazySet<string>,
+		contextDependencies: LazySet<string>,
+		missingDependencies: LazySet<string>,
+		buildDependencies: LazySet<string>
+	): void;
+	readonly hasEqualsChunks: any;
+	readonly isUsed: any;
+	readonly errors: any;
+	readonly warnings: any;
+	used: any;
+}
+declare class ModuleConcatenationPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class ModuleDependency extends Dependency {
+	constructor(request: string);
+	request: string;
+	userRequest: string;
+	range: any;
+	assertions?: Record<string, any>;
+	static Template: typeof DependencyTemplate;
+	static NO_EXPORTS_REFERENCED: string[][];
+	static EXPORTS_OBJECT_REFERENCED: string[][];
+	static TRANSITIVE: typeof TRANSITIVE;
+}
+declare abstract class ModuleFactory {
+	create(
+		data: ModuleFactoryCreateData,
+		callback: (arg0?: Error, arg1?: ModuleFactoryResult) => void
+	): void;
+}
+declare interface ModuleFactoryCreateData {
+	contextInfo: ModuleFactoryCreateDataContextInfo;
+	resolveOptions?: ResolveOptionsWebpackOptions;
+	context: string;
+	dependencies: Dependency[];
+}
+declare interface ModuleFactoryCreateDataContextInfo {
+	issuer: string;
+	issuerLayer?: null | string;
+	compiler: string;
+}
+declare interface ModuleFactoryResult {
+	/**
+	 * the created module or unset if no module was created
+	 */
+	module?: Module;
+	fileDependencies?: Set<string>;
+	contextDependencies?: Set<string>;
+	missingDependencies?: Set<string>;
+
+	/**
+	 * allow to use the unsafe cache
+	 */
+	cacheable?: boolean;
+}
+declare class ModuleFederationPlugin {
+	constructor(options: ModuleFederationPluginOptions);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface ModuleFederationPluginOptions {
+	/**
+	 * Modules that should be exposed by this container. When provided, property name is used as public name, otherwise public name is automatically inferred from request.
+	 */
+	exposes?: (string | ExposesObject)[] | ExposesObject;
+
+	/**
+	 * The filename of the container as relative path inside the `output.path` directory.
+	 */
+	filename?: string;
+
+	/**
+	 * Options for library.
+	 */
+	library?: LibraryOptions;
+
+	/**
+	 * The name of the container.
+	 */
+	name?: string;
+
+	/**
+	 * The external type of the remote containers.
+	 */
+	remoteType?:
+		| "import"
+		| "var"
+		| "module"
+		| "assign"
+		| "this"
+		| "window"
+		| "self"
+		| "global"
+		| "commonjs"
+		| "commonjs2"
+		| "commonjs-module"
+		| "commonjs-static"
+		| "amd"
+		| "amd-require"
+		| "umd"
+		| "umd2"
+		| "jsonp"
+		| "system"
+		| "promise"
+		| "script"
+		| "node-commonjs";
+
+	/**
+	 * Container locations and request scopes from which modules should be resolved and loaded at runtime. When provided, property name is used as request scope, otherwise request scope is automatically inferred from container location.
+	 */
+	remotes?: (string | RemotesObject)[] | RemotesObject;
+
+	/**
+	 * The name of the runtime chunk. If set a runtime chunk with this name is created or an existing entrypoint is used as runtime.
+	 */
+	runtime?: string | false;
+
+	/**
+	 * Share scope name used for all shared modules (defaults to 'default').
+	 */
+	shareScope?: string;
+
+	/**
+	 * Modules that should be shared in the share scope. When provided, property names are used to match requested modules in this compilation.
+	 */
+	shared?: (string | SharedObject)[] | SharedObject;
+}
+type ModuleFilterItemTypes =
+	| string
+	| RegExp
+	| ((
+			name: string,
+			module: StatsModule,
+			type: "module" | "chunk" | "root-of-chunk" | "nested"
+	  ) => boolean);
+declare class ModuleGraph {
+	constructor();
+	setParents(
+		dependency: Dependency,
+		block: DependenciesBlock,
+		module: Module,
+		indexInBlock?: number
+	): void;
+	getParentModule(dependency: Dependency): Module;
+	getParentBlock(dependency: Dependency): DependenciesBlock;
+	getParentBlockIndex(dependency: Dependency): number;
+	setResolvedModule(
+		originModule: Module,
+		dependency: Dependency,
+		module: Module
+	): void;
+	updateModule(dependency: Dependency, module: Module): void;
+	removeConnection(dependency: Dependency): void;
+	addExplanation(dependency: Dependency, explanation: string): void;
+	cloneModuleAttributes(sourceModule: Module, targetModule: Module): void;
+	removeModuleAttributes(module: Module): void;
+	removeAllModuleAttributes(): void;
+	moveModuleConnections(
+		oldModule: Module,
+		newModule: Module,
+		filterConnection: (arg0: ModuleGraphConnection) => boolean
+	): void;
+	copyOutgoingModuleConnections(
+		oldModule: Module,
+		newModule: Module,
+		filterConnection: (arg0: ModuleGraphConnection) => boolean
+	): void;
+	addExtraReason(module: Module, explanation: string): void;
+	getResolvedModule(dependency: Dependency): Module;
+	getConnection(dependency: Dependency): undefined | ModuleGraphConnection;
+	getModule(dependency: Dependency): Module;
+	getOrigin(dependency: Dependency): Module;
+	getResolvedOrigin(dependency: Dependency): Module;
+	getIncomingConnections(module: Module): Iterable<ModuleGraphConnection>;
+	getOutgoingConnections(module: Module): Iterable<ModuleGraphConnection>;
+	getIncomingConnectionsByOriginModule(
+		module: Module
+	): Map<undefined | Module, ReadonlyArray<ModuleGraphConnection>>;
+	getOutgoingConnectionsByModule(
+		module: Module
+	): undefined | Map<undefined | Module, ReadonlyArray<ModuleGraphConnection>>;
+	getProfile(module: Module): null | ModuleProfile;
+	setProfile(module: Module, profile: null | ModuleProfile): void;
+	getIssuer(module: Module): null | Module;
+	setIssuer(module: Module, issuer: null | Module): void;
+	setIssuerIfUnset(module: Module, issuer: null | Module): void;
+	getOptimizationBailout(
+		module: Module
+	): (string | ((requestShortener: RequestShortener) => string))[];
+	getProvidedExports(module: Module): null | true | string[];
+	isExportProvided(
+		module: Module,
+		exportName: string | string[]
+	): null | boolean;
+	getExportsInfo(module: Module): ExportsInfo;
+	getExportInfo(module: Module, exportName: string): ExportInfo;
+	getReadOnlyExportInfo(module: Module, exportName: string): ExportInfo;
+	getUsedExports(
+		module: Module,
+		runtime: RuntimeSpec
+	): null | boolean | SortableSet<string>;
+	getPreOrderIndex(module: Module): number;
+	getPostOrderIndex(module: Module): number;
+	setPreOrderIndex(module: Module, index: number): void;
+	setPreOrderIndexIfUnset(module: Module, index: number): boolean;
+	setPostOrderIndex(module: Module, index: number): void;
+	setPostOrderIndexIfUnset(module: Module, index: number): boolean;
+	getDepth(module: Module): number;
+	setDepth(module: Module, depth: number): void;
+	setDepthIfLower(module: Module, depth: number): boolean;
+	isAsync(module: Module): boolean;
+	setAsync(module: Module): void;
+	getMeta(thing?: any): Object;
+	getMetaIfExisting(thing?: any): Object;
+	freeze(cacheStage?: string): void;
+	unfreeze(): void;
+	cached<T extends any[], V>(
+		fn: (moduleGraph: ModuleGraph, ...args: T) => V,
+		...args: T
+	): V;
+	setModuleMemCaches(
+		moduleMemCaches: Map<Module, WeakTupleMap<any, any>>
+	): void;
+	dependencyCacheProvide(dependency: Dependency, ...args: any[]): any;
+	static getModuleGraphForModule(
+		module: Module,
+		deprecateMessage: string,
+		deprecationCode: string
+	): ModuleGraph;
+	static setModuleGraphForModule(
+		module: Module,
+		moduleGraph: ModuleGraph
+	): void;
+	static clearModuleGraphForModule(module: Module): void;
+	static ModuleGraphConnection: typeof ModuleGraphConnection;
+}
+declare class ModuleGraphConnection {
+	constructor(
+		originModule: null | Module,
+		dependency: null | Dependency,
+		module: Module,
+		explanation?: string,
+		weak?: boolean,
+		condition?:
+			| false
+			| ((arg0: ModuleGraphConnection, arg1: RuntimeSpec) => ConnectionState)
+	);
+	originModule: null | Module;
+	resolvedOriginModule: null | Module;
+	dependency: null | Dependency;
+	resolvedModule: Module;
+	module: Module;
+	weak: boolean;
+	conditional: boolean;
+	condition: (
+		arg0: ModuleGraphConnection,
+		arg1: RuntimeSpec
+	) => ConnectionState;
+	explanations: Set<string>;
+	clone(): ModuleGraphConnection;
+	addCondition(
+		condition: (
+			arg0: ModuleGraphConnection,
+			arg1: RuntimeSpec
+		) => ConnectionState
+	): void;
+	addExplanation(explanation: string): void;
+	readonly explanation: string;
+	active: void;
+	isActive(runtime: RuntimeSpec): boolean;
+	isTargetActive(runtime: RuntimeSpec): boolean;
+	getActiveState(runtime: RuntimeSpec): ConnectionState;
+	setActive(value: boolean): void;
+	static addConnectionStates: (
+		a: ConnectionState,
+		b: ConnectionState
+	) => ConnectionState;
+	static TRANSITIVE_ONLY: typeof TRANSITIVE_ONLY;
+	static CIRCULAR_CONNECTION: typeof CIRCULAR_CONNECTION;
+}
+type ModuleInfo = ConcatenatedModuleInfo | ExternalModuleInfo;
+
+/**
+ * Options affecting the normal modules (`NormalModuleFactory`).
+ */
+declare interface ModuleOptions {
+	/**
+	 * An array of rules applied by default for modules.
+	 */
+	defaultRules?: (RuleSetRule | "...")[];
+
+	/**
+	 * Enable warnings for full dynamic dependencies.
+	 */
+	exprContextCritical?: boolean;
+
+	/**
+	 * Enable recursive directory lookup for full dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.exprContextRecursive'.
+	 */
+	exprContextRecursive?: boolean;
+
+	/**
+	 * Sets the default regular expression for full dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.exprContextRegExp'.
+	 */
+	exprContextRegExp?: boolean | RegExp;
+
+	/**
+	 * Set the default request for full dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.exprContextRequest'.
+	 */
+	exprContextRequest?: string;
+
+	/**
+	 * Specify options for each generator.
+	 */
+	generator?: GeneratorOptionsByModuleType;
+
+	/**
+	 * Don't parse files matching. It's matched against the full resolved request.
+	 */
+	noParse?: string | Function | RegExp | (string | Function | RegExp)[];
+
+	/**
+	 * Specify options for each parser.
+	 */
+	parser?: ParserOptionsByModuleType;
+
+	/**
+	 * An array of rules applied for modules.
+	 */
+	rules?: (RuleSetRule | "...")[];
+
+	/**
+	 * Emit errors instead of warnings when imported names don't exist in imported module. Deprecated: This option has moved to 'module.parser.javascript.strictExportPresence'.
+	 */
+	strictExportPresence?: boolean;
+
+	/**
+	 * Handle the this context correctly according to the spec for namespace objects. Deprecated: This option has moved to 'module.parser.javascript.strictThisContextOnImports'.
+	 */
+	strictThisContextOnImports?: boolean;
+
+	/**
+	 * Enable warnings when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextCritical'.
+	 */
+	unknownContextCritical?: boolean;
+
+	/**
+	 * Enable recursive directory lookup when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextRecursive'.
+	 */
+	unknownContextRecursive?: boolean;
+
+	/**
+	 * Sets the regular expression when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextRegExp'.
+	 */
+	unknownContextRegExp?: boolean | RegExp;
+
+	/**
+	 * Sets the request when using the require function in a not statically analyse-able way. Deprecated: This option has moved to 'module.parser.javascript.unknownContextRequest'.
+	 */
+	unknownContextRequest?: string;
+
+	/**
+	 * Cache the resolving of module requests.
+	 */
+	unsafeCache?: boolean | Function;
+
+	/**
+	 * Enable warnings for partial dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.wrappedContextCritical'.
+	 */
+	wrappedContextCritical?: boolean;
+
+	/**
+	 * Enable recursive directory lookup for partial dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.wrappedContextRecursive'.
+	 */
+	wrappedContextRecursive?: boolean;
+
+	/**
+	 * Set the inner regular expression for partial dynamic dependencies. Deprecated: This option has moved to 'module.parser.javascript.wrappedContextRegExp'.
+	 */
+	wrappedContextRegExp?: RegExp;
+}
+
+/**
+ * Options affecting the normal modules (`NormalModuleFactory`).
+ */
+declare interface ModuleOptionsNormalized {
+	/**
+	 * An array of rules applied by default for modules.
+	 */
+	defaultRules: (RuleSetRule | "...")[];
+
+	/**
+	 * Specify options for each generator.
+	 */
+	generator: GeneratorOptionsByModuleType;
+
+	/**
+	 * Don't parse files matching. It's matched against the full resolved request.
+	 */
+	noParse?: string | Function | RegExp | (string | Function | RegExp)[];
+
+	/**
+	 * Specify options for each parser.
+	 */
+	parser: ParserOptionsByModuleType;
+
+	/**
+	 * An array of rules applied for modules.
+	 */
+	rules: (RuleSetRule | "...")[];
+
+	/**
+	 * Cache the resolving of module requests.
+	 */
+	unsafeCache?: boolean | Function;
+}
+declare interface ModulePathData {
+	id: string | number;
+	hash: string;
+	hashWithLength?: (arg0: number) => string;
+}
+declare abstract class ModuleProfile {
+	startTime: number;
+	factoryStartTime: number;
+	factoryEndTime: number;
+	factory: number;
+	factoryParallelismFactor: number;
+	restoringStartTime: number;
+	restoringEndTime: number;
+	restoring: number;
+	restoringParallelismFactor: number;
+	integrationStartTime: number;
+	integrationEndTime: number;
+	integration: number;
+	integrationParallelismFactor: number;
+	buildingStartTime: number;
+	buildingEndTime: number;
+	building: number;
+	buildingParallelismFactor: number;
+	storingStartTime: number;
+	storingEndTime: number;
+	storing: number;
+	storingParallelismFactor: number;
+	additionalFactoryTimes: any;
+	additionalFactories: number;
+	additionalFactoriesParallelismFactor: number;
+	additionalIntegration: number;
+	markFactoryStart(): void;
+	markFactoryEnd(): void;
+	markRestoringStart(): void;
+	markRestoringEnd(): void;
+	markIntegrationStart(): void;
+	markIntegrationEnd(): void;
+	markBuildingStart(): void;
+	markBuildingEnd(): void;
+	markStoringStart(): void;
+	markStoringEnd(): void;
+
+	/**
+	 * Merge this profile into another one
+	 */
+	mergeInto(realProfile: ModuleProfile): void;
+}
+declare interface ModuleReferenceOptions {
+	/**
+	 * the properties/exports of the module
+	 */
+	ids: string[];
+
+	/**
+	 * true, when this referenced export is called
+	 */
+	call: boolean;
+
+	/**
+	 * true, when this referenced export is directly imported (not via property access)
+	 */
+	directImport: boolean;
+
+	/**
+	 * if the position is ASI safe or unknown
+	 */
+	asiSafe?: boolean;
+}
+declare interface ModuleSettings {
+	/**
+	 * Specifies the layer in which the module should be placed in.
+	 */
+	layer?: string;
+
+	/**
+	 * Module type to use for the module.
+	 */
+	type?: string;
+
+	/**
+	 * Options for the resolver.
+	 */
+	resolve?: ResolveOptionsWebpackOptions;
+
+	/**
+	 * Options for parsing.
+	 */
+	parser?: { [index: string]: any };
+
+	/**
+	 * The options for the module generator.
+	 */
+	generator?: { [index: string]: any };
+
+	/**
+	 * Flags a module as with or without side effects.
+	 */
+	sideEffects?: boolean;
+}
+declare abstract class ModuleTemplate {
+	type: string;
+	hooks: Readonly<{
+		content: { tap: (options?: any, fn?: any) => void };
+		module: { tap: (options?: any, fn?: any) => void };
+		render: { tap: (options?: any, fn?: any) => void };
+		package: { tap: (options?: any, fn?: any) => void };
+		hash: { tap: (options?: any, fn?: any) => void };
+	}>;
+	readonly runtimeTemplate: any;
+}
+declare class MultiCompiler {
+	constructor(
+		compilers: Compiler[] | Record<string, Compiler>,
+		options: MultiCompilerOptions
+	);
+	hooks: Readonly<{
+		done: SyncHook<[MultiStats]>;
+		invalid: MultiHook<SyncHook<[null | string, number]>>;
+		run: MultiHook<AsyncSeriesHook<[Compiler]>>;
+		watchClose: SyncHook<[]>;
+		watchRun: MultiHook<AsyncSeriesHook<[Compiler]>>;
+		infrastructureLog: MultiHook<SyncBailHook<[string, string, any[]], true>>;
+	}>;
+	compilers: Compiler[];
+	dependencies: WeakMap<Compiler, string[]>;
+	running: boolean;
+	readonly options: WebpackOptionsNormalized[] & MultiCompilerOptions;
+	readonly outputPath: string;
+	inputFileSystem: InputFileSystem;
+	outputFileSystem: OutputFileSystem;
+	watchFileSystem: WatchFileSystem;
+	intermediateFileSystem: IntermediateFileSystem;
+	getInfrastructureLogger(name?: any): WebpackLogger;
+	setDependencies(compiler: Compiler, dependencies: string[]): void;
+	validateDependencies(callback: CallbackFunction<MultiStats>): boolean;
+	runWithDependencies(
+		compilers: Compiler[],
+		fn: (compiler: Compiler, callback: CallbackFunction<MultiStats>) => any,
+		callback: CallbackFunction<MultiStats>
+	): void;
+	watch(
+		watchOptions: WatchOptions | WatchOptions[],
+		handler: CallbackFunction<MultiStats>
+	): MultiWatching;
+	run(callback: CallbackFunction<MultiStats>): void;
+	purgeInputFileSystem(): void;
+	close(callback: CallbackFunction<void>): void;
+}
+declare interface MultiCompilerOptions {
+	/**
+	 * how many Compilers are allows to run at the same time in parallel
+	 */
+	parallelism?: number;
+}
+declare abstract class MultiStats {
+	stats: Stats[];
+	readonly hash: string;
+	hasErrors(): boolean;
+	hasWarnings(): boolean;
+	toJson(options?: any): StatsCompilation;
+	toString(options?: any): string;
+}
+declare abstract class MultiWatching {
+	watchings: Watching[];
+	compiler: MultiCompiler;
+	invalidate(callback?: any): void;
+	suspend(): void;
+	resume(): void;
+	close(callback: CallbackFunction<void>): void;
+}
+declare class NamedChunkIdsPlugin {
+	constructor(options?: any);
+	delimiter: any;
+	context: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class NamedModuleIdsPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class NaturalModuleIdsPlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface NeedBuildContext {
+	compilation: Compilation;
+	fileSystemInfo: FileSystemInfo;
+	valueCacheVersions: Map<string, string | Set<string>>;
+}
+declare class NoEmitOnErrorsPlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class NodeEnvironmentPlugin {
+	constructor(options: {
+		/**
+		 * infrastructure logging options
+		 */
+		infrastructureLogging: InfrastructureLogging;
+	});
+	options: {
+		/**
+		 * infrastructure logging options
+		 */
+		infrastructureLogging: InfrastructureLogging;
+	};
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+type NodeEstreeIndex =
+	| UnaryExpression
+	| ThisExpression
+	| ArrayExpression
+	| ObjectExpression
+	| FunctionExpression
+	| ArrowFunctionExpression
+	| YieldExpression
+	| SimpleLiteral
+	| RegExpLiteral
+	| BigIntLiteral
+	| UpdateExpression
+	| BinaryExpression
+	| AssignmentExpression
+	| LogicalExpression
+	| MemberExpression
+	| ConditionalExpression
+	| SimpleCallExpression
+	| NewExpression
+	| SequenceExpression
+	| TemplateLiteral
+	| TaggedTemplateExpression
+	| ClassExpression
+	| MetaProperty
+	| Identifier
+	| AwaitExpression
+	| ImportExpression
+	| ChainExpression
+	| FunctionDeclaration
+	| VariableDeclaration
+	| ClassDeclaration
+	| PrivateIdentifier
+	| ExpressionStatement
+	| BlockStatement
+	| StaticBlock
+	| EmptyStatement
+	| DebuggerStatement
+	| WithStatement
+	| ReturnStatement
+	| LabeledStatement
+	| BreakStatement
+	| ContinueStatement
+	| IfStatement
+	| SwitchStatement
+	| ThrowStatement
+	| TryStatement
+	| WhileStatement
+	| DoWhileStatement
+	| ForStatement
+	| ForInStatement
+	| ForOfStatement
+	| ImportDeclaration
+	| ExportNamedDeclaration
+	| ExportDefaultDeclaration
+	| ExportAllDeclaration
+	| MethodDefinition
+	| PropertyDefinition
+	| VariableDeclarator
+	| Program
+	| Super
+	| SwitchCase
+	| CatchClause
+	| Property
+	| AssignmentProperty
+	| TemplateElement
+	| SpreadElement
+	| ObjectPattern
+	| ArrayPattern
+	| RestElement
+	| AssignmentPattern
+	| ClassBody
+	| ImportSpecifier
+	| ImportDefaultSpecifier
+	| ImportNamespaceSpecifier
+	| ExportSpecifier;
+
+/**
+ * Options object for node compatibility features.
+ */
+declare interface NodeOptions {
+	/**
+	 * Include a polyfill for the '__dirname' variable.
+	 */
+	__dirname?: boolean | "warn-mock" | "mock" | "eval-only";
+
+	/**
+	 * Include a polyfill for the '__filename' variable.
+	 */
+	__filename?: boolean | "warn-mock" | "mock" | "eval-only";
+
+	/**
+	 * Include a polyfill for the 'global' variable.
+	 */
+	global?: boolean | "warn";
+}
+declare class NodeSourcePlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class NodeTargetPlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class NodeTemplatePlugin {
+	constructor(options?: any);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+type NodeWebpackOptions = false | NodeOptions;
+declare class NormalModule extends Module {
+	constructor(__0: NormalModuleCreateData);
+	request: string;
+	userRequest: string;
+	rawRequest: string;
+	binary: boolean;
+	parser: Parser;
+	parserOptions?: Record<string, any>;
+	generator: Generator;
+	generatorOptions?: Record<string, any>;
+	resource: string;
+	resourceResolveData?: Record<string, any>;
+	matchResource?: string;
+	loaders: LoaderItem[];
+	error?: null | WebpackError;
+	restoreFromUnsafeCache(
+		unsafeCacheData?: any,
+		normalModuleFactory?: any
+	): void;
+	createSourceForAsset(
+		context: string,
+		name: string,
+		content: string,
+		sourceMap?: any,
+		associatedObjectForCache?: Object
+	): Source;
+	getCurrentLoader(loaderContext?: any, index?: any): null | LoaderItem;
+	createSource(
+		context: string,
+		content: string | Buffer,
+		sourceMap?: any,
+		associatedObjectForCache?: Object
+	): Source;
+	markModuleAsErrored(error: WebpackError): void;
+	applyNoParseRule(rule?: any, content?: any): any;
+	shouldPreventParsing(noParseRule?: any, request?: any): any;
+	static getCompilationHooks(
+		compilation: Compilation
+	): NormalModuleCompilationHooks;
+	static deserialize(context?: any): NormalModule;
+}
+declare interface NormalModuleCompilationHooks {
+	loader: SyncHook<[object, NormalModule]>;
+	beforeLoaders: SyncHook<[LoaderItem[], NormalModule, object]>;
+	beforeParse: SyncHook<[NormalModule]>;
+	beforeSnapshot: SyncHook<[NormalModule]>;
+	readResourceForScheme: HookMap<
+		AsyncSeriesBailHook<[string, NormalModule], string | Buffer>
+	>;
+	readResource: HookMap<AsyncSeriesBailHook<[object], string | Buffer>>;
+	needBuild: AsyncSeriesBailHook<[NormalModule, NeedBuildContext], boolean>;
+}
+declare interface NormalModuleCreateData {
+	/**
+	 * an optional layer in which the module is
+	 */
+	layer?: string;
+
+	/**
+	 * module type
+	 */
+	type: string;
+
+	/**
+	 * request string
+	 */
+	request: string;
+
+	/**
+	 * request intended by user (without loaders from config)
+	 */
+	userRequest: string;
+
+	/**
+	 * request without resolving
+	 */
+	rawRequest: string;
+
+	/**
+	 * list of loaders
+	 */
+	loaders: LoaderItem[];
+
+	/**
+	 * path + query of the real resource
+	 */
+	resource: string;
+
+	/**
+	 * resource resolve data
+	 */
+	resourceResolveData?: Record<string, any>;
+
+	/**
+	 * context directory for resolving
+	 */
+	context: string;
+
+	/**
+	 * path + query of the matched resource (virtual)
+	 */
+	matchResource?: string;
+
+	/**
+	 * the parser used
+	 */
+	parser: Parser;
+
+	/**
+	 * the options of the parser used
+	 */
+	parserOptions?: Record<string, any>;
+
+	/**
+	 * the generator used
+	 */
+	generator: Generator;
+
+	/**
+	 * the options of the generator used
+	 */
+	generatorOptions?: Record<string, any>;
+
+	/**
+	 * options used for resolving requests from this module
+	 */
+	resolveOptions?: ResolveOptionsWebpackOptions;
+}
+declare abstract class NormalModuleFactory extends ModuleFactory {
+	hooks: Readonly<{
+		resolve: AsyncSeriesBailHook<[ResolveData], false | void | Module>;
+		resolveForScheme: HookMap<
+			AsyncSeriesBailHook<[ResourceDataWithData, ResolveData], true | void>
+		>;
+		resolveInScheme: HookMap<
+			AsyncSeriesBailHook<[ResourceDataWithData, ResolveData], true | void>
+		>;
+		factorize: AsyncSeriesBailHook<[ResolveData], Module>;
+		beforeResolve: AsyncSeriesBailHook<[ResolveData], false | void>;
+		afterResolve: AsyncSeriesBailHook<[ResolveData], false | void>;
+		createModule: AsyncSeriesBailHook<
+			[
+				Partial<NormalModuleCreateData & { settings: ModuleSettings }>,
+				ResolveData
+			],
+			void | Module
+		>;
+		module: SyncWaterfallHook<
+			[
+				Module,
+				Partial<NormalModuleCreateData & { settings: ModuleSettings }>,
+				ResolveData
+			],
+			Module
+		>;
+		createParser: HookMap<SyncBailHook<any, any>>;
+		parser: HookMap<SyncHook<any>>;
+		createGenerator: HookMap<SyncBailHook<any, any>>;
+		generator: HookMap<SyncHook<any>>;
+	}>;
+	resolverFactory: ResolverFactory;
+	ruleSet: RuleSet;
+	context: string;
+	fs: InputFileSystem;
+	parserCache: Map<string, WeakMap<Object, any>>;
+	generatorCache: Map<string, WeakMap<Object, Generator>>;
+	cleanupForCache(): void;
+	resolveResource(
+		contextInfo?: any,
+		context?: any,
+		unresolvedResource?: any,
+		resolver?: any,
+		resolveContext?: any,
+		callback?: any
+	): void;
+	resolveRequestArray(
+		contextInfo?: any,
+		context?: any,
+		array?: any,
+		resolver?: any,
+		resolveContext?: any,
+		callback?: any
+	): any;
+	getParser(type?: any, parserOptions?: object): any;
+	createParser(type: string, parserOptions?: { [index: string]: any }): Parser;
+	getGenerator(type?: any, generatorOptions?: object): undefined | Generator;
+	createGenerator(type?: any, generatorOptions?: object): any;
+	getResolver(type?: any, resolveOptions?: any): ResolverWithOptions;
+}
+
+/**
+ * These properties are added by the NormalModule
+ */
+declare interface NormalModuleLoaderContext<OptionsType> {
+	version: number;
+	getOptions(): OptionsType;
+	getOptions(schema: Parameters<typeof validateFunction>[0]): OptionsType;
+	emitWarning(warning: Error): void;
+	emitError(error: Error): void;
+	getLogger(name?: string): WebpackLogger;
+	resolve(
+		context: string,
+		request: string,
+		callback: (
+			arg0: null | Error,
+			arg1?: string | false,
+			arg2?: ResolveRequest
+		) => void
+	): any;
+	getResolve(options?: ResolveOptionsWithDependencyType): {
+		(
+			context: string,
+			request: string,
+			callback: (
+				arg0: null | Error,
+				arg1?: string | false,
+				arg2?: ResolveRequest
+			) => void
+		): void;
+		(context: string, request: string): Promise<string>;
+	};
+	emitFile(
+		name: string,
+		content: string | Buffer,
+		sourceMap?: string,
+		assetInfo?: AssetInfo
+	): void;
+	addBuildDependency(dep: string): void;
+	utils: {
+		absolutify: (context: string, request: string) => string;
+		contextify: (context: string, request: string) => string;
+		createHash: (algorithm?: string) => Hash;
+	};
+	rootContext: string;
+	fs: InputFileSystem;
+	sourceMap?: boolean;
+	mode: "none" | "development" | "production";
+	webpack?: boolean;
+	_module?: NormalModule;
+	_compilation?: Compilation;
+	_compiler?: Compiler;
+}
+declare class NormalModuleReplacementPlugin {
+	/**
+	 * Create an instance of the plugin
+	 */
+	constructor(
+		resourceRegExp: RegExp,
+		newResource: string | ((arg0?: any) => void)
+	);
+	resourceRegExp: RegExp;
+	newResource: string | ((arg0?: any) => void);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+type NormalizedStatsOptions = KnownNormalizedStatsOptions &
+	Omit<
+		StatsOptions,
+		| "context"
+		| "chunkGroups"
+		| "requestShortener"
+		| "chunksSort"
+		| "modulesSort"
+		| "chunkModulesSort"
+		| "nestedModulesSort"
+		| "assetsSort"
+		| "ids"
+		| "cachedAssets"
+		| "groupAssetsByEmitStatus"
+		| "groupAssetsByPath"
+		| "groupAssetsByExtension"
+		| "assetsSpace"
+		| "excludeAssets"
+		| "excludeModules"
+		| "warningsFilter"
+		| "cachedModules"
+		| "orphanModules"
+		| "dependentModules"
+		| "runtimeModules"
+		| "groupModulesByCacheStatus"
+		| "groupModulesByLayer"
+		| "groupModulesByAttributes"
+		| "groupModulesByPath"
+		| "groupModulesByExtension"
+		| "groupModulesByType"
+		| "entrypoints"
+		| "chunkGroupAuxiliary"
+		| "chunkGroupChildren"
+		| "chunkGroupMaxAssets"
+		| "modulesSpace"
+		| "chunkModulesSpace"
+		| "nestedModulesSpace"
+		| "logging"
+		| "loggingDebug"
+		| "loggingTrace"
+		| "_env"
+	> &
+	Record<string, any>;
+declare class NullDependency extends Dependency {
+	constructor();
+	static Template: typeof NullDependencyTemplate;
+	static NO_EXPORTS_REFERENCED: string[][];
+	static EXPORTS_OBJECT_REFERENCED: string[][];
+	static TRANSITIVE: typeof TRANSITIVE;
+}
+declare class NullDependencyTemplate extends DependencyTemplate {
+	constructor();
+}
+declare interface ObjectDeserializerContext {
+	read: () => any;
+}
+declare interface ObjectSerializer {
+	serialize: (arg0: any, arg1: ObjectSerializerContext) => void;
+	deserialize: (arg0: ObjectDeserializerContext) => any;
+}
+declare interface ObjectSerializerContext {
+	write: (arg0?: any) => void;
+}
+declare class OccurrenceChunkIdsPlugin {
+	constructor(options?: OccurrenceChunkIdsPluginOptions);
+	options: OccurrenceChunkIdsPluginOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface OccurrenceChunkIdsPluginOptions {
+	/**
+	 * Prioritise initial size over total size.
+	 */
+	prioritiseInitial?: boolean;
+}
+declare class OccurrenceModuleIdsPlugin {
+	constructor(options?: OccurrenceModuleIdsPluginOptions);
+	options: OccurrenceModuleIdsPluginOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface OccurrenceModuleIdsPluginOptions {
+	/**
+	 * Prioritise initial size over total size.
+	 */
+	prioritiseInitial?: boolean;
+}
+
+/**
+ * Enables/Disables integrated optimizations.
+ */
+declare interface Optimization {
+	/**
+	 * Check for incompatible wasm types when importing/exporting from/to ESM.
+	 */
+	checkWasmTypes?: boolean;
+
+	/**
+	 * Define the algorithm to choose chunk ids (named: readable ids for better debugging, deterministic: numeric hash ids for better long term caching, size: numeric ids focused on minimal initial download size, total-size: numeric ids focused on minimal total download size, false: no algorithm used, as custom one can be provided via plugin).
+	 */
+	chunkIds?:
+		| false
+		| "natural"
+		| "named"
+		| "deterministic"
+		| "size"
+		| "total-size";
+
+	/**
+	 * Concatenate modules when possible to generate less modules, more efficient code and enable more optimizations by the minimizer.
+	 */
+	concatenateModules?: boolean;
+
+	/**
+	 * Emit assets even when errors occur. Critical errors are emitted into the generated code and will cause errors at runtime.
+	 */
+	emitOnErrors?: boolean;
+
+	/**
+	 * Also flag chunks as loaded which contain a subset of the modules.
+	 */
+	flagIncludedChunks?: boolean;
+
+	/**
+	 * Creates a module-internal dependency graph for top level symbols, exports and imports, to improve unused exports detection.
+	 */
+	innerGraph?: boolean;
+
+	/**
+	 * Rename exports when possible to generate shorter code (depends on optimization.usedExports and optimization.providedExports, true/"deterministic": generate short deterministic names optimized for caching, "size": generate the shortest possible names).
+	 */
+	mangleExports?: boolean | "deterministic" | "size";
+
+	/**
+	 * Reduce size of WASM by changing imports to shorter strings.
+	 */
+	mangleWasmImports?: boolean;
+
+	/**
+	 * Merge chunks which contain the same modules.
+	 */
+	mergeDuplicateChunks?: boolean;
+
+	/**
+	 * Enable minimizing the output. Uses optimization.minimizer.
+	 */
+	minimize?: boolean;
+
+	/**
+	 * Minimizer(s) to use for minimizing the output.
+	 */
+	minimizer?: (
+		| ((this: Compiler, compiler: Compiler) => void)
+		| WebpackPluginInstance
+		| "..."
+	)[];
+
+	/**
+	 * Define the algorithm to choose module ids (natural: numeric ids in order of usage, named: readable ids for better debugging, hashed: (deprecated) short hashes as ids for better long term caching, deterministic: numeric hash ids for better long term caching, size: numeric ids focused on minimal initial download size, false: no algorithm used, as custom one can be provided via plugin).
+	 */
+	moduleIds?: false | "natural" | "named" | "deterministic" | "size" | "hashed";
+
+	/**
+	 * Avoid emitting assets when errors occur (deprecated: use 'emitOnErrors' instead).
+	 */
+	noEmitOnErrors?: boolean;
+
+	/**
+	 * Set process.env.NODE_ENV to a specific value.
+	 */
+	nodeEnv?: string | false;
+
+	/**
+	 * Generate records with relative paths to be able to move the context folder.
+	 */
+	portableRecords?: boolean;
+
+	/**
+	 * Figure out which exports are provided by modules to generate more efficient code.
+	 */
+	providedExports?: boolean;
+
+	/**
+	 * Use real [contenthash] based on final content of the assets.
+	 */
+	realContentHash?: boolean;
+
+	/**
+	 * Removes modules from chunks when these modules are already included in all parents.
+	 */
+	removeAvailableModules?: boolean;
+
+	/**
+	 * Remove chunks which are empty.
+	 */
+	removeEmptyChunks?: boolean;
+
+	/**
+	 * Create an additional chunk which contains only the webpack runtime and chunk hash maps.
+	 */
+	runtimeChunk?:
+		| boolean
+		| "single"
+		| "multiple"
+		| {
+				/**
+				 * The name or name factory for the runtime chunks.
+				 */
+				name?: string | Function;
+		  };
+
+	/**
+	 * Skip over modules which contain no side effects when exports are not used (false: disabled, 'flag': only use manually placed side effects flag, true: also analyse source code for side effects).
+	 */
+	sideEffects?: boolean | "flag";
+
+	/**
+	 * Optimize duplication and caching by splitting chunks by shared modules and cache group.
+	 */
+	splitChunks?: false | OptimizationSplitChunksOptions;
+
+	/**
+	 * Figure out which exports are used by modules to mangle export names, omit unused exports and generate more efficient code (true: analyse used exports for each runtime, "global": analyse exports globally for all runtimes combined).
+	 */
+	usedExports?: boolean | "global";
+}
+
+/**
+ * Options object for describing behavior of a cache group selecting modules that should be cached together.
+ */
+declare interface OptimizationSplitChunksCacheGroup {
+	/**
+	 * Sets the name delimiter for created chunks.
+	 */
+	automaticNameDelimiter?: string;
+
+	/**
+	 * Select chunks for determining cache group content (defaults to "initial", "initial" and "all" requires adding these chunks to the HTML).
+	 */
+	chunks?: "all" | "initial" | "async" | ((chunk: Chunk) => boolean);
+
+	/**
+	 * Ignore minimum size, minimum chunks and maximum requests and always create chunks for this cache group.
+	 */
+	enforce?: boolean;
+
+	/**
+	 * Size threshold at which splitting is enforced and other restrictions (minRemainingSize, maxAsyncRequests, maxInitialRequests) are ignored.
+	 */
+	enforceSizeThreshold?: number | { [index: string]: number };
+
+	/**
+	 * Sets the template for the filename for created chunks.
+	 */
+	filename?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Sets the hint for chunk id.
+	 */
+	idHint?: string;
+
+	/**
+	 * Assign modules to a cache group by module layer.
+	 */
+	layer?: string | Function | RegExp;
+
+	/**
+	 * Maximum number of requests which are accepted for on-demand loading.
+	 */
+	maxAsyncRequests?: number;
+
+	/**
+	 * Maximal size hint for the on-demand chunks.
+	 */
+	maxAsyncSize?: number | { [index: string]: number };
+
+	/**
+	 * Maximum number of initial chunks which are accepted for an entry point.
+	 */
+	maxInitialRequests?: number;
+
+	/**
+	 * Maximal size hint for the initial chunks.
+	 */
+	maxInitialSize?: number | { [index: string]: number };
+
+	/**
+	 * Maximal size hint for the created chunks.
+	 */
+	maxSize?: number | { [index: string]: number };
+
+	/**
+	 * Minimum number of times a module has to be duplicated until it's considered for splitting.
+	 */
+	minChunks?: number;
+
+	/**
+	 * Minimal size for the chunks the stay after moving the modules to a new chunk.
+	 */
+	minRemainingSize?: number | { [index: string]: number };
+
+	/**
+	 * Minimal size for the created chunk.
+	 */
+	minSize?: number | { [index: string]: number };
+
+	/**
+	 * Minimum size reduction due to the created chunk.
+	 */
+	minSizeReduction?: number | { [index: string]: number };
+
+	/**
+	 * Give chunks for this cache group a name (chunks with equal name are merged).
+	 */
+	name?: string | false | Function;
+
+	/**
+	 * Priority of this cache group.
+	 */
+	priority?: number;
+
+	/**
+	 * Try to reuse existing chunk (with name) when it has matching modules.
+	 */
+	reuseExistingChunk?: boolean;
+
+	/**
+	 * Assign modules to a cache group by module name.
+	 */
+	test?: string | Function | RegExp;
+
+	/**
+	 * Assign modules to a cache group by module type.
+	 */
+	type?: string | Function | RegExp;
+
+	/**
+	 * Compare used exports when checking common modules. Modules will only be put in the same chunk when exports are equal.
+	 */
+	usedExports?: boolean;
+}
+
+/**
+ * Options object for splitting chunks into smaller chunks.
+ */
+declare interface OptimizationSplitChunksOptions {
+	/**
+	 * Sets the name delimiter for created chunks.
+	 */
+	automaticNameDelimiter?: string;
+
+	/**
+	 * Assign modules to a cache group (modules from different cache groups are tried to keep in separate chunks, default categories: 'default', 'defaultVendors').
+	 */
+	cacheGroups?: {
+		[index: string]:
+			| string
+			| false
+			| Function
+			| RegExp
+			| OptimizationSplitChunksCacheGroup;
+	};
+
+	/**
+	 * Select chunks for determining shared modules (defaults to "async", "initial" and "all" requires adding these chunks to the HTML).
+	 */
+	chunks?: "all" | "initial" | "async" | ((chunk: Chunk) => boolean);
+
+	/**
+	 * Sets the size types which are used when a number is used for sizes.
+	 */
+	defaultSizeTypes?: string[];
+
+	/**
+	 * Size threshold at which splitting is enforced and other restrictions (minRemainingSize, maxAsyncRequests, maxInitialRequests) are ignored.
+	 */
+	enforceSizeThreshold?: number | { [index: string]: number };
+
+	/**
+	 * Options for modules not selected by any other cache group.
+	 */
+	fallbackCacheGroup?: {
+		/**
+		 * Sets the name delimiter for created chunks.
+		 */
+		automaticNameDelimiter?: string;
+		/**
+		 * Select chunks for determining shared modules (defaults to "async", "initial" and "all" requires adding these chunks to the HTML).
+		 */
+		chunks?: "all" | "initial" | "async" | ((chunk: Chunk) => boolean);
+		/**
+		 * Maximal size hint for the on-demand chunks.
+		 */
+		maxAsyncSize?: number | { [index: string]: number };
+		/**
+		 * Maximal size hint for the initial chunks.
+		 */
+		maxInitialSize?: number | { [index: string]: number };
+		/**
+		 * Maximal size hint for the created chunks.
+		 */
+		maxSize?: number | { [index: string]: number };
+		/**
+		 * Minimal size for the created chunk.
+		 */
+		minSize?: number | { [index: string]: number };
+		/**
+		 * Minimum size reduction due to the created chunk.
+		 */
+		minSizeReduction?: number | { [index: string]: number };
+	};
+
+	/**
+	 * Sets the template for the filename for created chunks.
+	 */
+	filename?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Prevents exposing path info when creating names for parts splitted by maxSize.
+	 */
+	hidePathInfo?: boolean;
+
+	/**
+	 * Maximum number of requests which are accepted for on-demand loading.
+	 */
+	maxAsyncRequests?: number;
+
+	/**
+	 * Maximal size hint for the on-demand chunks.
+	 */
+	maxAsyncSize?: number | { [index: string]: number };
+
+	/**
+	 * Maximum number of initial chunks which are accepted for an entry point.
+	 */
+	maxInitialRequests?: number;
+
+	/**
+	 * Maximal size hint for the initial chunks.
+	 */
+	maxInitialSize?: number | { [index: string]: number };
+
+	/**
+	 * Maximal size hint for the created chunks.
+	 */
+	maxSize?: number | { [index: string]: number };
+
+	/**
+	 * Minimum number of times a module has to be duplicated until it's considered for splitting.
+	 */
+	minChunks?: number;
+
+	/**
+	 * Minimal size for the chunks the stay after moving the modules to a new chunk.
+	 */
+	minRemainingSize?: number | { [index: string]: number };
+
+	/**
+	 * Minimal size for the created chunks.
+	 */
+	minSize?: number | { [index: string]: number };
+
+	/**
+	 * Minimum size reduction due to the created chunk.
+	 */
+	minSizeReduction?: number | { [index: string]: number };
+
+	/**
+	 * Give chunks created a name (chunks with equal name are merged).
+	 */
+	name?: string | false | Function;
+
+	/**
+	 * Compare used exports when checking common modules. Modules will only be put in the same chunk when exports are equal.
+	 */
+	usedExports?: boolean;
+}
+declare abstract class OptionsApply {
+	process(options?: any, compiler?: any): void;
+}
+declare interface OriginRecord {
+	module: Module;
+	loc: DependencyLocation;
+	request: string;
+}
+declare class OriginalSource extends Source {
+	constructor(source: string | Buffer, name: string);
+	getName(): string;
+}
+
+/**
+ * Options affecting the output of the compilation. `output` options tell webpack how to write the compiled files to disk.
+ */
+declare interface Output {
+	/**
+	 * The filename of asset modules as relative path inside the 'output.path' directory.
+	 */
+	assetModuleFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Enable/disable creating async chunks that are loaded on demand.
+	 */
+	asyncChunks?: boolean;
+
+	/**
+	 * Add a comment in the UMD wrapper.
+	 */
+	auxiliaryComment?: string | LibraryCustomUmdCommentObject;
+
+	/**
+	 * Add charset attribute for script tag.
+	 */
+	charset?: boolean;
+
+	/**
+	 * Specifies the filename template of output files of non-initial chunks on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	chunkFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * The format of chunks (formats included by default are 'array-push' (web/WebWorker), 'commonjs' (node.js), 'module' (ESM), but others might be added by plugins).
+	 */
+	chunkFormat?: string | false;
+
+	/**
+	 * Number of milliseconds before chunk request expires.
+	 */
+	chunkLoadTimeout?: number;
+
+	/**
+	 * The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).
+	 */
+	chunkLoading?: string | false;
+
+	/**
+	 * The global variable used by webpack for loading of chunks.
+	 */
+	chunkLoadingGlobal?: string;
+
+	/**
+	 * Clean the output directory before emit.
+	 */
+	clean?: boolean | CleanOptions;
+
+	/**
+	 * Check if to be emitted file already exists and have the same content before writing to output filesystem.
+	 */
+	compareBeforeEmit?: boolean;
+
+	/**
+	 * This option enables cross-origin loading of chunks.
+	 */
+	crossOriginLoading?: false | "anonymous" | "use-credentials";
+
+	/**
+	 * Specifies the filename template of non-initial output css files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	cssChunkFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Specifies the filename template of output css files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	cssFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Similar to `output.devtoolModuleFilenameTemplate`, but used in the case of duplicate module identifiers.
+	 */
+	devtoolFallbackModuleFilenameTemplate?: string | Function;
+
+	/**
+	 * Filename template string of function for the sources array in a generated SourceMap.
+	 */
+	devtoolModuleFilenameTemplate?: string | Function;
+
+	/**
+	 * Module namespace to use when interpolating filename template string for the sources array in a generated SourceMap. Defaults to `output.library` if not set. It's useful for avoiding runtime collisions in sourcemaps from multiple webpack projects built as libraries.
+	 */
+	devtoolNamespace?: string;
+
+	/**
+	 * List of chunk loading types enabled for use by entry points.
+	 */
+	enabledChunkLoadingTypes?: string[];
+
+	/**
+	 * List of library types enabled for use by entry points.
+	 */
+	enabledLibraryTypes?: string[];
+
+	/**
+	 * List of wasm loading types enabled for use by entry points.
+	 */
+	enabledWasmLoadingTypes?: string[];
+
+	/**
+	 * The abilities of the environment where the webpack generated code should run.
+	 */
+	environment?: Environment;
+
+	/**
+	 * Specifies the filename of output files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	filename?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * An expression which is used to address the global object/scope in runtime code.
+	 */
+	globalObject?: string;
+
+	/**
+	 * Digest type used for the hash.
+	 */
+	hashDigest?: string;
+
+	/**
+	 * Number of chars which are used for the hash.
+	 */
+	hashDigestLength?: number;
+
+	/**
+	 * Algorithm used for generation the hash (see node.js crypto package).
+	 */
+	hashFunction?: string | typeof Hash;
+
+	/**
+	 * Any string which is added to the hash to salt it.
+	 */
+	hashSalt?: string;
+
+	/**
+	 * The filename of the Hot Update Chunks. They are inside the output.path directory.
+	 */
+	hotUpdateChunkFilename?: string;
+
+	/**
+	 * The global variable used by webpack for loading of hot update chunks.
+	 */
+	hotUpdateGlobal?: string;
+
+	/**
+	 * The filename of the Hot Update Main File. It is inside the 'output.path' directory.
+	 */
+	hotUpdateMainFilename?: string;
+
+	/**
+	 * Wrap javascript code into IIFE's to avoid leaking into global scope.
+	 */
+	iife?: boolean;
+
+	/**
+	 * The name of the native import() function (can be exchanged for a polyfill).
+	 */
+	importFunctionName?: string;
+
+	/**
+	 * The name of the native import.meta object (can be exchanged for a polyfill).
+	 */
+	importMetaName?: string;
+
+	/**
+	 * Make the output files a library, exporting the exports of the entry point.
+	 */
+	library?: string | string[] | LibraryOptions | LibraryCustomUmdObject;
+
+	/**
+	 * Specify which export should be exposed as library.
+	 */
+	libraryExport?: string | string[];
+
+	/**
+	 * Type of library (types included by default are 'var', 'module', 'assign', 'assign-properties', 'this', 'window', 'self', 'global', 'commonjs', 'commonjs2', 'commonjs-module', 'commonjs-static', 'amd', 'amd-require', 'umd', 'umd2', 'jsonp', 'system', but others might be added by plugins).
+	 */
+	libraryTarget?: string;
+
+	/**
+	 * Output javascript files as module source type.
+	 */
+	module?: boolean;
+
+	/**
+	 * The output directory as **absolute path** (required).
+	 */
+	path?: string;
+
+	/**
+	 * Include comments with information about the modules.
+	 */
+	pathinfo?: boolean | "verbose";
+
+	/**
+	 * The 'publicPath' specifies the public URL address of the output files when referenced in a browser.
+	 */
+	publicPath?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * This option enables loading async chunks via a custom script type, such as script type="module".
+	 */
+	scriptType?: false | "module" | "text/javascript";
+
+	/**
+	 * The filename of the SourceMaps for the JavaScript files. They are inside the 'output.path' directory.
+	 */
+	sourceMapFilename?: string;
+
+	/**
+	 * Prefixes every line of the source in the bundle with this string.
+	 */
+	sourcePrefix?: string;
+
+	/**
+	 * Handles error in module loading correctly at a performance cost. This will handle module error compatible with the EcmaScript Modules spec.
+	 */
+	strictModuleErrorHandling?: boolean;
+
+	/**
+	 * Handles exceptions in module loading correctly at a performance cost (Deprecated). This will handle module error compatible with the Node.js CommonJS way.
+	 */
+	strictModuleExceptionHandling?: boolean;
+
+	/**
+	 * Use a Trusted Types policy to create urls for chunks. 'output.uniqueName' is used a default policy name. Passing a string sets a custom policy name.
+	 */
+	trustedTypes?: string | true | TrustedTypes;
+
+	/**
+	 * If `output.libraryTarget` is set to umd and `output.library` is set, setting this to true will name the AMD module.
+	 */
+	umdNamedDefine?: boolean;
+
+	/**
+	 * A unique name of the webpack build to avoid multiple webpack runtimes to conflict when using globals.
+	 */
+	uniqueName?: string;
+
+	/**
+	 * The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).
+	 */
+	wasmLoading?: string | false;
+
+	/**
+	 * The filename of WebAssembly modules as relative path inside the 'output.path' directory.
+	 */
+	webassemblyModuleFilename?: string;
+
+	/**
+	 * The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).
+	 */
+	workerChunkLoading?: string | false;
+
+	/**
+	 * The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).
+	 */
+	workerWasmLoading?: string | false;
+}
+declare interface OutputFileSystem {
+	writeFile: (
+		arg0: string,
+		arg1: string | Buffer,
+		arg2: (arg0?: null | NodeJS.ErrnoException) => void
+	) => void;
+	mkdir: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException) => void
+	) => void;
+	readdir?: (
+		arg0: string,
+		arg1: (
+			arg0?: null | NodeJS.ErrnoException,
+			arg1?: (string | Buffer)[] | IDirent[]
+		) => void
+	) => void;
+	rmdir?: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException) => void
+	) => void;
+	unlink?: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException) => void
+	) => void;
+	stat: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: IStats) => void
+	) => void;
+	lstat?: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: IStats) => void
+	) => void;
+	readFile: (
+		arg0: string,
+		arg1: (arg0?: null | NodeJS.ErrnoException, arg1?: string | Buffer) => void
+	) => void;
+	join?: (arg0: string, arg1: string) => string;
+	relative?: (arg0: string, arg1: string) => string;
+	dirname?: (arg0: string) => string;
+}
+
+/**
+ * Normalized options affecting the output of the compilation. `output` options tell webpack how to write the compiled files to disk.
+ */
+declare interface OutputNormalized {
+	/**
+	 * The filename of asset modules as relative path inside the 'output.path' directory.
+	 */
+	assetModuleFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Enable/disable creating async chunks that are loaded on demand.
+	 */
+	asyncChunks?: boolean;
+
+	/**
+	 * Add charset attribute for script tag.
+	 */
+	charset?: boolean;
+
+	/**
+	 * Specifies the filename template of output files of non-initial chunks on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	chunkFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * The format of chunks (formats included by default are 'array-push' (web/WebWorker), 'commonjs' (node.js), 'module' (ESM), but others might be added by plugins).
+	 */
+	chunkFormat?: string | false;
+
+	/**
+	 * Number of milliseconds before chunk request expires.
+	 */
+	chunkLoadTimeout?: number;
+
+	/**
+	 * The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).
+	 */
+	chunkLoading?: string | false;
+
+	/**
+	 * The global variable used by webpack for loading of chunks.
+	 */
+	chunkLoadingGlobal?: string;
+
+	/**
+	 * Clean the output directory before emit.
+	 */
+	clean?: boolean | CleanOptions;
+
+	/**
+	 * Check if to be emitted file already exists and have the same content before writing to output filesystem.
+	 */
+	compareBeforeEmit?: boolean;
+
+	/**
+	 * This option enables cross-origin loading of chunks.
+	 */
+	crossOriginLoading?: false | "anonymous" | "use-credentials";
+
+	/**
+	 * Specifies the filename template of non-initial output css files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	cssChunkFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Specifies the filename template of output css files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	cssFilename?:
+		| string
+		| ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * Similar to `output.devtoolModuleFilenameTemplate`, but used in the case of duplicate module identifiers.
+	 */
+	devtoolFallbackModuleFilenameTemplate?: string | Function;
+
+	/**
+	 * Filename template string of function for the sources array in a generated SourceMap.
+	 */
+	devtoolModuleFilenameTemplate?: string | Function;
+
+	/**
+	 * Module namespace to use when interpolating filename template string for the sources array in a generated SourceMap. Defaults to `output.library` if not set. It's useful for avoiding runtime collisions in sourcemaps from multiple webpack projects built as libraries.
+	 */
+	devtoolNamespace?: string;
+
+	/**
+	 * List of chunk loading types enabled for use by entry points.
+	 */
+	enabledChunkLoadingTypes?: string[];
+
+	/**
+	 * List of library types enabled for use by entry points.
+	 */
+	enabledLibraryTypes?: string[];
+
+	/**
+	 * List of wasm loading types enabled for use by entry points.
+	 */
+	enabledWasmLoadingTypes?: string[];
+
+	/**
+	 * The abilities of the environment where the webpack generated code should run.
+	 */
+	environment?: Environment;
+
+	/**
+	 * Specifies the filename of output files on disk. You must **not** specify an absolute path here, but the path may contain folders separated by '/'! The specified path is joined with the value of the 'output.path' option to determine the location on disk.
+	 */
+	filename?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * An expression which is used to address the global object/scope in runtime code.
+	 */
+	globalObject?: string;
+
+	/**
+	 * Digest type used for the hash.
+	 */
+	hashDigest?: string;
+
+	/**
+	 * Number of chars which are used for the hash.
+	 */
+	hashDigestLength?: number;
+
+	/**
+	 * Algorithm used for generation the hash (see node.js crypto package).
+	 */
+	hashFunction?: string | typeof Hash;
+
+	/**
+	 * Any string which is added to the hash to salt it.
+	 */
+	hashSalt?: string;
+
+	/**
+	 * The filename of the Hot Update Chunks. They are inside the output.path directory.
+	 */
+	hotUpdateChunkFilename?: string;
+
+	/**
+	 * The global variable used by webpack for loading of hot update chunks.
+	 */
+	hotUpdateGlobal?: string;
+
+	/**
+	 * The filename of the Hot Update Main File. It is inside the 'output.path' directory.
+	 */
+	hotUpdateMainFilename?: string;
+
+	/**
+	 * Wrap javascript code into IIFE's to avoid leaking into global scope.
+	 */
+	iife?: boolean;
+
+	/**
+	 * The name of the native import() function (can be exchanged for a polyfill).
+	 */
+	importFunctionName?: string;
+
+	/**
+	 * The name of the native import.meta object (can be exchanged for a polyfill).
+	 */
+	importMetaName?: string;
+
+	/**
+	 * Options for library.
+	 */
+	library?: LibraryOptions;
+
+	/**
+	 * Output javascript files as module source type.
+	 */
+	module?: boolean;
+
+	/**
+	 * The output directory as **absolute path** (required).
+	 */
+	path?: string;
+
+	/**
+	 * Include comments with information about the modules.
+	 */
+	pathinfo?: boolean | "verbose";
+
+	/**
+	 * The 'publicPath' specifies the public URL address of the output files when referenced in a browser.
+	 */
+	publicPath?: string | ((pathData: PathData, assetInfo?: AssetInfo) => string);
+
+	/**
+	 * This option enables loading async chunks via a custom script type, such as script type="module".
+	 */
+	scriptType?: false | "module" | "text/javascript";
+
+	/**
+	 * The filename of the SourceMaps for the JavaScript files. They are inside the 'output.path' directory.
+	 */
+	sourceMapFilename?: string;
+
+	/**
+	 * Prefixes every line of the source in the bundle with this string.
+	 */
+	sourcePrefix?: string;
+
+	/**
+	 * Handles error in module loading correctly at a performance cost. This will handle module error compatible with the EcmaScript Modules spec.
+	 */
+	strictModuleErrorHandling?: boolean;
+
+	/**
+	 * Handles exceptions in module loading correctly at a performance cost (Deprecated). This will handle module error compatible with the Node.js CommonJS way.
+	 */
+	strictModuleExceptionHandling?: boolean;
+
+	/**
+	 * Use a Trusted Types policy to create urls for chunks.
+	 */
+	trustedTypes?: TrustedTypes;
+
+	/**
+	 * A unique name of the webpack build to avoid multiple webpack runtimes to conflict when using globals.
+	 */
+	uniqueName?: string;
+
+	/**
+	 * The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).
+	 */
+	wasmLoading?: string | false;
+
+	/**
+	 * The filename of WebAssembly modules as relative path inside the 'output.path' directory.
+	 */
+	webassemblyModuleFilename?: string;
+
+	/**
+	 * The method of loading chunks (methods included by default are 'jsonp' (web), 'import' (ESM), 'importScripts' (WebWorker), 'require' (sync node.js), 'async-node' (async node.js), but others might be added by plugins).
+	 */
+	workerChunkLoading?: string | false;
+
+	/**
+	 * The method of loading WebAssembly Modules (methods included by default are 'fetch' (web/WebWorker), 'async-node' (node.js), but others might be added by plugins).
+	 */
+	workerWasmLoading?: string | false;
+}
+declare interface ParameterizedComparator<TArg, T> {
+	(arg0: TArg): Comparator<T>;
+}
+declare interface ParsedIdentifier {
+	request: string;
+	query: string;
+	fragment: string;
+	directory: boolean;
+	module: boolean;
+	file: boolean;
+	internal: boolean;
+}
+declare class Parser {
+	constructor();
+	parse(
+		source: string | Buffer | PreparsedAst,
+		state: ParserState
+	): ParserState;
+}
+type ParserOptionsByModuleType = ParserOptionsByModuleTypeKnown &
+	ParserOptionsByModuleTypeUnknown;
+
+/**
+ * Specify options for each parser.
+ */
+declare interface ParserOptionsByModuleTypeKnown {
+	/**
+	 * Parser options for asset modules.
+	 */
+	asset?: AssetParserOptions;
+
+	/**
+	 * No parser options are supported for this module type.
+	 */
+	"asset/inline"?: EmptyParserOptions;
+
+	/**
+	 * No parser options are supported for this module type.
+	 */
+	"asset/resource"?: EmptyParserOptions;
+
+	/**
+	 * No parser options are supported for this module type.
+	 */
+	"asset/source"?: EmptyParserOptions;
+
+	/**
+	 * Parser options for javascript modules.
+	 */
+	javascript?: JavascriptParserOptions;
+
+	/**
+	 * Parser options for javascript modules.
+	 */
+	"javascript/auto"?: JavascriptParserOptions;
+
+	/**
+	 * Parser options for javascript modules.
+	 */
+	"javascript/dynamic"?: JavascriptParserOptions;
+
+	/**
+	 * Parser options for javascript modules.
+	 */
+	"javascript/esm"?: JavascriptParserOptions;
+}
+
+/**
+ * Specify options for each parser.
+ */
+declare interface ParserOptionsByModuleTypeUnknown {
+	[index: string]: { [index: string]: any };
+}
+type ParserState = Record<string, any> & ParserStateBase;
+declare interface ParserStateBase {
+	source: string | Buffer;
+	current: NormalModule;
+	module: NormalModule;
+	compilation: Compilation;
+	options: { [index: string]: any };
+}
+declare interface PathData {
+	chunkGraph?: ChunkGraph;
+	hash?: string;
+	hashWithLength?: (arg0: number) => string;
+	chunk?: Chunk | ChunkPathData;
+	module?: Module | ModulePathData;
+	runtime?: RuntimeSpec;
+	filename?: string;
+	basename?: string;
+	query?: string;
+	contentHashType?: string;
+	contentHash?: string;
+	contentHashWithLength?: (arg0: number) => string;
+	noChunkHash?: boolean;
+	url?: string;
+}
+
+/**
+ * Configuration object for web performance recommendations.
+ */
+declare interface PerformanceOptions {
+	/**
+	 * Filter function to select assets that are checked.
+	 */
+	assetFilter?: Function;
+
+	/**
+	 * Sets the format of the hints: warnings, errors or nothing at all.
+	 */
+	hints?: false | "error" | "warning";
+
+	/**
+	 * File size limit (in bytes) when exceeded, that webpack will provide performance hints.
+	 */
+	maxAssetSize?: number;
+
+	/**
+	 * Total size of an entry point (in bytes).
+	 */
+	maxEntrypointSize?: number;
+}
+declare interface PitchLoaderDefinitionFunction<
+	OptionsType = {},
+	ContextAdditions = {}
+> {
+	(
+		this: NormalModuleLoaderContext<OptionsType> &
+			LoaderRunnerLoaderContext<OptionsType> &
+			LoaderPluginLoaderContext &
+			HotModuleReplacementPluginLoaderContext &
+			ContextAdditions,
+		remainingRequest: string,
+		previousRequest: string,
+		data: object
+	): string | void | Buffer | Promise<string | Buffer>;
+}
+type Plugin =
+	| { apply: (arg0: Resolver) => void }
+	| ((this: Resolver, arg1: Resolver) => void);
+declare interface PnpApiImpl {
+	resolveToUnqualified: (arg0: string, arg1: string, arg2: object) => string;
+}
+declare interface PossibleFileSystemError {
+	code?: string;
+	errno?: number;
+	path?: string;
+	syscall?: string;
+}
+declare class PrefetchPlugin {
+	constructor(context?: any, request?: any);
+	context: any;
+	request: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class PrefixSource extends Source {
+	constructor(prefix: string, source: string | Source);
+	original(): Source;
+	getPrefix(): string;
+}
+declare interface PreparsedAst {
+	[index: string]: any;
+}
+declare interface PrintedElement {
+	element: string;
+	content: string;
+}
+declare interface Problem {
+	type: ProblemType;
+	path: string;
+	argument: string;
+	value?: any;
+	index?: number;
+	expected?: string;
+}
+type ProblemType =
+	| "unknown-argument"
+	| "unexpected-non-array-in-path"
+	| "unexpected-non-object-in-path"
+	| "multiple-values-unexpected"
+	| "invalid-value";
+declare interface ProcessAssetsAdditionalOptions {
+	additionalAssets?: true | Function;
+}
+declare class Profiler {
+	constructor(inspector?: any);
+	session: any;
+	inspector: any;
+	hasSession(): boolean;
+	startProfiling(): Promise<void> | Promise<[any, any, any]>;
+	sendCommand(method?: any, params?: any): Promise<any>;
+	destroy(): Promise<void>;
+	stopProfiling(): Promise<{ profile: any }>;
+}
+declare class ProfilingPlugin {
+	constructor(options?: ProfilingPluginOptions);
+	outputPath: string;
+	apply(compiler?: any): void;
+	static Profiler: typeof Profiler;
+}
+declare interface ProfilingPluginOptions {
+	/**
+	 * Path to the output file e.g. `path.resolve(__dirname, 'profiling/events.json')`. Defaults to `events.json`.
+	 */
+	outputPath?: string;
+}
+declare class ProgressPlugin {
+	constructor(options?: ProgressPluginArgument);
+	profile?: null | boolean;
+	handler?: (percentage: number, msg: string, ...args: string[]) => void;
+	modulesCount?: number;
+	dependenciesCount?: number;
+	showEntries?: boolean;
+	showModules?: boolean;
+	showDependencies?: boolean;
+	showActiveModules?: boolean;
+	percentBy?: null | "modules" | "dependencies" | "entries";
+	apply(compiler: Compiler | MultiCompiler): void;
+	static getReporter(
+		compiler: Compiler
+	): (p: number, ...args: string[]) => void;
+	static defaultOptions: {
+		profile: boolean;
+		modulesCount: number;
+		dependenciesCount: number;
+		modules: boolean;
+		dependencies: boolean;
+		activeModules: boolean;
+		entries: boolean;
+	};
+}
+type ProgressPluginArgument =
+	| ProgressPluginOptions
+	| ((percentage: number, msg: string, ...args: string[]) => void);
+
+/**
+ * Options object for the ProgressPlugin.
+ */
+declare interface ProgressPluginOptions {
+	/**
+	 * Show active modules count and one active module in progress message.
+	 */
+	activeModules?: boolean;
+
+	/**
+	 * Show dependencies count in progress message.
+	 */
+	dependencies?: boolean;
+
+	/**
+	 * Minimum dependencies count to start with. For better progress calculation. Default: 10000.
+	 */
+	dependenciesCount?: number;
+
+	/**
+	 * Show entries count in progress message.
+	 */
+	entries?: boolean;
+
+	/**
+	 * Function that executes for every progress step.
+	 */
+	handler?: (percentage: number, msg: string, ...args: string[]) => void;
+
+	/**
+	 * Show modules count in progress message.
+	 */
+	modules?: boolean;
+
+	/**
+	 * Minimum modules count to start with. For better progress calculation. Default: 5000.
+	 */
+	modulesCount?: number;
+
+	/**
+	 * Collect percent algorithm. By default it calculates by a median from modules, entries and dependencies percent.
+	 */
+	percentBy?: null | "modules" | "dependencies" | "entries";
+
+	/**
+	 * Collect profile data for progress steps. Default: false.
+	 */
+	profile?: null | boolean;
+}
+declare class ProvidePlugin {
+	constructor(definitions: Record<string, string | string[]>);
+	definitions: Record<string, string | string[]>;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class ProvideSharedPlugin {
+	constructor(options: ProvideSharedPluginOptions);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface ProvideSharedPluginOptions {
+	/**
+	 * Modules that should be provided as shared modules to the share scope. When provided, property name is used to match modules, otherwise this is automatically inferred from share key.
+	 */
+	provides: Provides;
+
+	/**
+	 * Share scope name used for all provided modules (defaults to 'default').
+	 */
+	shareScope?: string;
+}
+type Provides = (string | ProvidesObject)[] | ProvidesObject;
+
+/**
+ * Advanced configuration for modules that should be provided as shared modules to the share scope.
+ */
+declare interface ProvidesConfig {
+	/**
+	 * Include the provided module directly instead behind an async request. This allows to use this shared module in initial load too. All possible shared modules need to be eager too.
+	 */
+	eager?: boolean;
+
+	/**
+	 * Key in the share scope under which the shared modules should be stored.
+	 */
+	shareKey?: string;
+
+	/**
+	 * Share scope name.
+	 */
+	shareScope?: string;
+
+	/**
+	 * Version of the provided module. Will replace lower matching versions, but not higher.
+	 */
+	version?: string | false;
+}
+
+/**
+ * Modules that should be provided as shared modules to the share scope. Property names are used as share keys.
+ */
+declare interface ProvidesObject {
+	[index: string]: string | ProvidesConfig;
+}
+declare interface RawChunkGroupOptions {
+	preloadOrder?: number;
+	prefetchOrder?: number;
+}
+type RawLoaderDefinition<
+	OptionsType = {},
+	ContextAdditions = {}
+> = RawLoaderDefinitionFunction<OptionsType, ContextAdditions> & {
+	raw: true;
+	pitch?: PitchLoaderDefinitionFunction<OptionsType, ContextAdditions>;
+};
+declare interface RawLoaderDefinitionFunction<
+	OptionsType = {},
+	ContextAdditions = {}
+> {
+	(
+		this: NormalModuleLoaderContext<OptionsType> &
+			LoaderRunnerLoaderContext<OptionsType> &
+			LoaderPluginLoaderContext &
+			HotModuleReplacementPluginLoaderContext &
+			ContextAdditions,
+		content: Buffer,
+		sourceMap?: string | SourceMap,
+		additionalData?: AdditionalData
+	): string | void | Buffer | Promise<string | Buffer>;
+}
+declare class RawSource extends Source {
+	constructor(source: string | Buffer, convertToString?: boolean);
+	isBuffer(): boolean;
+}
+declare class ReadFileCompileWasmPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class RealContentHashPlugin {
+	constructor(__0: { hashFunction: any; hashDigest: any });
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static getCompilationHooks(
+		compilation: Compilation
+	): CompilationHooksRealContentHashPlugin;
+}
+declare interface RealDependencyLocation {
+	start: SourcePosition;
+	end?: SourcePosition;
+	index?: number;
+}
+type RecursiveArrayOrRecord<T> =
+	| { [index: string]: RecursiveArrayOrRecord<T> }
+	| RecursiveArrayOrRecord<T>[]
+	| T;
+declare interface ReferencedExport {
+	/**
+	 * name of the referenced export
+	 */
+	name: string[];
+
+	/**
+	 * when false, referenced export can not be mangled, defaults to true
+	 */
+	canMangle?: boolean;
+}
+type Remotes = (string | RemotesObject)[] | RemotesObject;
+
+/**
+ * Advanced configuration for container locations from which modules should be resolved and loaded at runtime.
+ */
+declare interface RemotesConfig {
+	/**
+	 * Container locations from which modules should be resolved and loaded at runtime.
+	 */
+	external: string | string[];
+
+	/**
+	 * The name of the share scope shared with this remote.
+	 */
+	shareScope?: string;
+}
+
+/**
+ * Container locations from which modules should be resolved and loaded at runtime. Property names are used as request scopes.
+ */
+declare interface RemotesObject {
+	[index: string]: string | RemotesConfig | string[];
+}
+declare interface RenderBootstrapContext {
+	/**
+	 * the chunk
+	 */
+	chunk: Chunk;
+
+	/**
+	 * results of code generation
+	 */
+	codeGenerationResults: CodeGenerationResults;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * hash to be used for render call
+	 */
+	hash: string;
+}
+declare interface RenderContext {
+	/**
+	 * the chunk
+	 */
+	chunk: Chunk;
+
+	/**
+	 * the dependency templates
+	 */
+	dependencyTemplates: DependencyTemplates;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * results of code generation
+	 */
+	codeGenerationResults: CodeGenerationResults;
+
+	/**
+	 * rendering in strict context
+	 */
+	strictMode: boolean;
+}
+type RenderManifestEntry =
+	| RenderManifestEntryTemplated
+	| RenderManifestEntryStatic;
+declare interface RenderManifestEntryStatic {
+	render: () => Source;
+	filename: string;
+	info: AssetInfo;
+	identifier: string;
+	hash?: string;
+	auxiliary?: boolean;
+}
+declare interface RenderManifestEntryTemplated {
+	render: () => Source;
+	filenameTemplate: string | ((arg0: PathData, arg1?: AssetInfo) => string);
+	pathOptions?: PathData;
+	info?: AssetInfo;
+	identifier: string;
+	hash?: string;
+	auxiliary?: boolean;
+}
+declare interface RenderManifestOptions {
+	/**
+	 * the chunk used to render
+	 */
+	chunk: Chunk;
+	hash: string;
+	fullHash: string;
+	outputOptions: Output;
+	codeGenerationResults: CodeGenerationResults;
+	moduleTemplates: { javascript: ModuleTemplate };
+	dependencyTemplates: DependencyTemplates;
+	runtimeTemplate: RuntimeTemplate;
+	moduleGraph: ModuleGraph;
+	chunkGraph: ChunkGraph;
+}
+declare class ReplaceSource extends Source {
+	constructor(source: Source, name?: string);
+	replace(start: number, end: number, newValue: string, name?: string): void;
+	insert(pos: number, newValue: string, name?: string): void;
+	getName(): string;
+	original(): string;
+	getReplacements(): {
+		start: number;
+		end: number;
+		content: string;
+		insertIndex: number;
+		name: string;
+	}[];
+}
+declare abstract class RequestShortener {
+	contextify: (arg0: string) => string;
+	shorten(request?: null | string): undefined | null | string;
+}
+declare interface ResolveBuildDependenciesResult {
+	/**
+	 * list of files
+	 */
+	files: Set<string>;
+
+	/**
+	 * list of directories
+	 */
+	directories: Set<string>;
+
+	/**
+	 * list of missing entries
+	 */
+	missing: Set<string>;
+
+	/**
+	 * stored resolve results
+	 */
+	resolveResults: Map<string, string | false>;
+
+	/**
+	 * dependencies of the resolving
+	 */
+	resolveDependencies: {
+		/**
+		 * list of files
+		 */
+		files: Set<string>;
+		/**
+		 * list of directories
+		 */
+		directories: Set<string>;
+		/**
+		 * list of missing entries
+		 */
+		missing: Set<string>;
+	};
+}
+
+/**
+ * Resolve context
+ */
+declare interface ResolveContext {
+	contextDependencies?: WriteOnlySet<string>;
+
+	/**
+	 * files that was found on file system
+	 */
+	fileDependencies?: WriteOnlySet<string>;
+
+	/**
+	 * dependencies that was not found on file system
+	 */
+	missingDependencies?: WriteOnlySet<string>;
+
+	/**
+	 * set of hooks' calls. For instance, `resolve → parsedResolve → describedResolve`,
+	 */
+	stack?: Set<string>;
+
+	/**
+	 * log function
+	 */
+	log?: (arg0: string) => void;
+
+	/**
+	 * yield result, if provided plugins can return several results
+	 */
+	yield?: (arg0: ResolveRequest) => void;
+}
+declare interface ResolveData {
+	contextInfo: ModuleFactoryCreateDataContextInfo;
+	resolveOptions?: ResolveOptionsWebpackOptions;
+	context: string;
+	request: string;
+	assertions?: Record<string, any>;
+	dependencies: ModuleDependency[];
+	dependencyType: string;
+	createData: Partial<NormalModuleCreateData & { settings: ModuleSettings }>;
+	fileDependencies: LazySet<string>;
+	missingDependencies: LazySet<string>;
+	contextDependencies: LazySet<string>;
+
+	/**
+	 * allow to use the unsafe cache
+	 */
+	cacheable: boolean;
+}
+declare interface ResolveOptionsTypes {
+	alias: AliasOption[];
+	fallback: AliasOption[];
+	aliasFields: Set<string | string[]>;
+	cachePredicate: (arg0: ResolveRequest) => boolean;
+	cacheWithContext: boolean;
+
+	/**
+	 * A list of exports field condition names.
+	 */
+	conditionNames: Set<string>;
+	descriptionFiles: string[];
+	enforceExtension: boolean;
+	exportsFields: Set<string | string[]>;
+	importsFields: Set<string | string[]>;
+	extensions: Set<string>;
+	fileSystem: FileSystem;
+	unsafeCache: false | object;
+	symlinks: boolean;
+	resolver?: Resolver;
+	modules: (string | string[])[];
+	mainFields: { name: string[]; forceRelative: boolean }[];
+	mainFiles: Set<string>;
+	plugins: Plugin[];
+	pnpApi: null | PnpApiImpl;
+	roots: Set<string>;
+	fullySpecified: boolean;
+	resolveToContext: boolean;
+	restrictions: Set<string | RegExp>;
+	preferRelative: boolean;
+	preferAbsolute: boolean;
+}
+
+/**
+ * Options object for resolving requests.
+ */
+declare interface ResolveOptionsWebpackOptions {
+	/**
+	 * Redirect module requests.
+	 */
+	alias?:
+		| {
+				/**
+				 * New request.
+				 */
+				alias: string | false | string[];
+				/**
+				 * Request to be redirected.
+				 */
+				name: string;
+				/**
+				 * Redirect only exact matching request.
+				 */
+				onlyModule?: boolean;
+		  }[]
+		| { [index: string]: string | false | string[] };
+
+	/**
+	 * Fields in the description file (usually package.json) which are used to redirect requests inside the module.
+	 */
+	aliasFields?: (string | string[])[];
+
+	/**
+	 * Extra resolve options per dependency category. Typical categories are "commonjs", "amd", "esm".
+	 */
+	byDependency?: { [index: string]: ResolveOptionsWebpackOptions };
+
+	/**
+	 * Enable caching of successfully resolved requests (cache entries are revalidated).
+	 */
+	cache?: boolean;
+
+	/**
+	 * Predicate function to decide which requests should be cached.
+	 */
+	cachePredicate?: (request: ResolveRequest) => boolean;
+
+	/**
+	 * Include the context information in the cache identifier when caching.
+	 */
+	cacheWithContext?: boolean;
+
+	/**
+	 * Condition names for exports field entry point.
+	 */
+	conditionNames?: string[];
+
+	/**
+	 * Filenames used to find a description file (like a package.json).
+	 */
+	descriptionFiles?: string[];
+
+	/**
+	 * Enforce the resolver to use one of the extensions from the extensions option (User must specify requests without extension).
+	 */
+	enforceExtension?: boolean;
+
+	/**
+	 * Field names from the description file (usually package.json) which are used to provide entry points of a package.
+	 */
+	exportsFields?: string[];
+
+	/**
+	 * Extensions added to the request when trying to find the file.
+	 */
+	extensions?: string[];
+
+	/**
+	 * Redirect module requests when normal resolving fails.
+	 */
+	fallback?:
+		| {
+				/**
+				 * New request.
+				 */
+				alias: string | false | string[];
+				/**
+				 * Request to be redirected.
+				 */
+				name: string;
+				/**
+				 * Redirect only exact matching request.
+				 */
+				onlyModule?: boolean;
+		  }[]
+		| { [index: string]: string | false | string[] };
+
+	/**
+	 * Filesystem for the resolver.
+	 */
+	fileSystem?: InputFileSystem;
+
+	/**
+	 * Treats the request specified by the user as fully specified, meaning no extensions are added and the mainFiles in directories are not resolved (This doesn't affect requests from mainFields, aliasFields or aliases).
+	 */
+	fullySpecified?: boolean;
+
+	/**
+	 * Field names from the description file (usually package.json) which are used to provide internal request of a package (requests starting with # are considered as internal).
+	 */
+	importsFields?: string[];
+
+	/**
+	 * Field names from the description file (package.json) which are used to find the default entry point.
+	 */
+	mainFields?: (string | string[])[];
+
+	/**
+	 * Filenames used to find the default entry point if there is no description file or main field.
+	 */
+	mainFiles?: string[];
+
+	/**
+	 * Folder names or directory paths where to find modules.
+	 */
+	modules?: string[];
+
+	/**
+	 * Plugins for the resolver.
+	 */
+	plugins?: (ResolvePluginInstance | "...")[];
+
+	/**
+	 * Prefer to resolve server-relative URLs (starting with '/') as absolute paths before falling back to resolve in 'resolve.roots'.
+	 */
+	preferAbsolute?: boolean;
+
+	/**
+	 * Prefer to resolve module requests as relative request and fallback to resolving as module.
+	 */
+	preferRelative?: boolean;
+
+	/**
+	 * Custom resolver.
+	 */
+	resolver?: Resolver;
+
+	/**
+	 * A list of resolve restrictions. Resolve results must fulfill all of these restrictions to resolve successfully. Other resolve paths are taken when restrictions are not met.
+	 */
+	restrictions?: (string | RegExp)[];
+
+	/**
+	 * A list of directories in which requests that are server-relative URLs (starting with '/') are resolved.
+	 */
+	roots?: string[];
+
+	/**
+	 * Enable resolving symlinks to the original location.
+	 */
+	symlinks?: boolean;
+
+	/**
+	 * Enable caching of successfully resolved requests (cache entries are not revalidated).
+	 */
+	unsafeCache?: boolean | { [index: string]: any };
+
+	/**
+	 * Use synchronous filesystem calls for the resolver.
+	 */
+	useSyncFileSystemCalls?: boolean;
+}
+type ResolveOptionsWithDependencyType = ResolveOptionsWebpackOptions & {
+	dependencyType?: string;
+	resolveToContext?: boolean;
+};
+
+/**
+ * Plugin instance.
+ */
+declare interface ResolvePluginInstance {
+	[index: string]: any;
+
+	/**
+	 * The run point of the plugin, required method.
+	 */
+	apply: (resolver: Resolver) => void;
+}
+type ResolveRequest = BaseResolveRequest & Partial<ParsedIdentifier>;
+declare interface ResolvedContextFileSystemInfoEntry {
+	safeTime: number;
+	timestampHash?: string;
+}
+declare interface ResolvedContextTimestampAndHash {
+	safeTime: number;
+	timestampHash?: string;
+	hash: string;
+}
+declare abstract class Resolver {
+	fileSystem: FileSystem;
+	options: ResolveOptionsTypes;
+	hooks: {
+		resolveStep: SyncHook<
+			[
+				AsyncSeriesBailHook<
+					[ResolveRequest, ResolveContext],
+					null | ResolveRequest
+				>,
+				ResolveRequest
+			]
+		>;
+		noResolve: SyncHook<[ResolveRequest, Error]>;
+		resolve: AsyncSeriesBailHook<
+			[ResolveRequest, ResolveContext],
+			null | ResolveRequest
+		>;
+		result: AsyncSeriesHook<[ResolveRequest, ResolveContext]>;
+	};
+	ensureHook(
+		name:
+			| string
+			| AsyncSeriesBailHook<
+					[ResolveRequest, ResolveContext],
+					null | ResolveRequest
+			  >
+	): AsyncSeriesBailHook<
+		[ResolveRequest, ResolveContext],
+		null | ResolveRequest
+	>;
+	getHook(
+		name:
+			| string
+			| AsyncSeriesBailHook<
+					[ResolveRequest, ResolveContext],
+					null | ResolveRequest
+			  >
+	): AsyncSeriesBailHook<
+		[ResolveRequest, ResolveContext],
+		null | ResolveRequest
+	>;
+	resolveSync(context: object, path: string, request: string): string | false;
+	resolve(
+		context: object,
+		path: string,
+		request: string,
+		resolveContext: ResolveContext,
+		callback: (
+			arg0: null | Error,
+			arg1?: string | false,
+			arg2?: ResolveRequest
+		) => void
+	): void;
+	doResolve(
+		hook?: any,
+		request?: any,
+		message?: any,
+		resolveContext?: any,
+		callback?: any
+	): any;
+	parse(identifier: string): ParsedIdentifier;
+	isModule(path?: any): boolean;
+	isPrivate(path?: any): boolean;
+	isDirectory(path: string): boolean;
+	join(path?: any, request?: any): string;
+	normalize(path?: any): string;
+}
+declare interface ResolverCache {
+	direct: WeakMap<Object, ResolverWithOptions>;
+	stringified: Map<string, ResolverWithOptions>;
+}
+declare abstract class ResolverFactory {
+	hooks: Readonly<{
+		resolveOptions: HookMap<
+			SyncWaterfallHook<[ResolveOptionsWithDependencyType]>
+		>;
+		resolver: HookMap<
+			SyncHook<[Resolver, UserResolveOptions, ResolveOptionsWithDependencyType]>
+		>;
+	}>;
+	cache: Map<string, ResolverCache>;
+	get(
+		type: string,
+		resolveOptions?: ResolveOptionsWithDependencyType
+	): ResolverWithOptions;
+}
+type ResolverWithOptions = Resolver & WithOptions;
+
+declare interface ResourceDataWithData {
+	resource: string;
+	path: string;
+	query: string;
+	fragment: string;
+	context?: string;
+	data: Record<string, any>;
+}
+type Rule = string | RegExp;
+declare interface RuleSet {
+	/**
+	 * map of references in the rule set (may grow over time)
+	 */
+	references: Map<string, any>;
+
+	/**
+	 * execute the rule set
+	 */
+	exec: (arg0: object) => Effect[];
+}
+type RuleSetCondition =
+	| string
+	| RegExp
+	| ((value: string) => boolean)
+	| RuleSetLogicalConditions
+	| RuleSetCondition[];
+type RuleSetConditionAbsolute =
+	| string
+	| RegExp
+	| ((value: string) => boolean)
+	| RuleSetLogicalConditionsAbsolute
+	| RuleSetConditionAbsolute[];
+type RuleSetConditionOrConditions =
+	| string
+	| RegExp
+	| ((value: string) => boolean)
+	| RuleSetLogicalConditions
+	| RuleSetCondition[];
+
+/**
+ * Logic operators used in a condition matcher.
+ */
+declare interface RuleSetLogicalConditions {
+	/**
+	 * Logical AND.
+	 */
+	and?: RuleSetCondition[];
+
+	/**
+	 * Logical NOT.
+	 */
+	not?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Logical OR.
+	 */
+	or?: RuleSetCondition[];
+}
+
+/**
+ * Logic operators used in a condition matcher.
+ */
+declare interface RuleSetLogicalConditionsAbsolute {
+	/**
+	 * Logical AND.
+	 */
+	and?: RuleSetConditionAbsolute[];
+
+	/**
+	 * Logical NOT.
+	 */
+	not?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditionsAbsolute
+		| RuleSetConditionAbsolute[];
+
+	/**
+	 * Logical OR.
+	 */
+	or?: RuleSetConditionAbsolute[];
+}
+
+/**
+ * A rule description with conditions and effects for modules.
+ */
+declare interface RuleSetRule {
+	/**
+	 * Match on import assertions of the dependency.
+	 */
+	assert?: { [index: string]: RuleSetConditionOrConditions };
+
+	/**
+	 * Match the child compiler name.
+	 */
+	compiler?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Match dependency type.
+	 */
+	dependency?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Match values of properties in the description file (usually package.json).
+	 */
+	descriptionData?: { [index: string]: RuleSetConditionOrConditions };
+
+	/**
+	 * Enforce this rule as pre or post step.
+	 */
+	enforce?: "pre" | "post";
+
+	/**
+	 * Shortcut for resource.exclude.
+	 */
+	exclude?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditionsAbsolute
+		| RuleSetConditionAbsolute[];
+
+	/**
+	 * The options for the module generator.
+	 */
+	generator?: { [index: string]: any };
+
+	/**
+	 * Shortcut for resource.include.
+	 */
+	include?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditionsAbsolute
+		| RuleSetConditionAbsolute[];
+
+	/**
+	 * Match the issuer of the module (The module pointing to this module).
+	 */
+	issuer?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditionsAbsolute
+		| RuleSetConditionAbsolute[];
+
+	/**
+	 * Match layer of the issuer of this module (The module pointing to this module).
+	 */
+	issuerLayer?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Specifies the layer in which the module should be placed in.
+	 */
+	layer?: string;
+
+	/**
+	 * Shortcut for use.loader.
+	 */
+	loader?: string;
+
+	/**
+	 * Match module mimetype when load from Data URI.
+	 */
+	mimetype?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Only execute the first matching rule in this array.
+	 */
+	oneOf?: RuleSetRule[];
+
+	/**
+	 * Shortcut for use.options.
+	 */
+	options?: string | { [index: string]: any };
+
+	/**
+	 * Options for parsing.
+	 */
+	parser?: { [index: string]: any };
+
+	/**
+	 * Match the real resource path of the module.
+	 */
+	realResource?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditionsAbsolute
+		| RuleSetConditionAbsolute[];
+
+	/**
+	 * Options for the resolver.
+	 */
+	resolve?: ResolveOptionsWebpackOptions;
+
+	/**
+	 * Match the resource path of the module.
+	 */
+	resource?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditionsAbsolute
+		| RuleSetConditionAbsolute[];
+
+	/**
+	 * Match the resource fragment of the module.
+	 */
+	resourceFragment?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Match the resource query of the module.
+	 */
+	resourceQuery?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Match and execute these rules when this rule is matched.
+	 */
+	rules?: RuleSetRule[];
+
+	/**
+	 * Match module scheme.
+	 */
+	scheme?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditions
+		| RuleSetCondition[];
+
+	/**
+	 * Flags a module as with or without side effects.
+	 */
+	sideEffects?: boolean;
+
+	/**
+	 * Shortcut for resource.test.
+	 */
+	test?:
+		| string
+		| RegExp
+		| ((value: string) => boolean)
+		| RuleSetLogicalConditionsAbsolute
+		| RuleSetConditionAbsolute[];
+
+	/**
+	 * Module type to use for the module.
+	 */
+	type?: string;
+
+	/**
+	 * Modifiers applied to the module when rule is matched.
+	 */
+	use?:
+		| string
+		| RuleSetUseItem[]
+		| ((data: {
+				resource: string;
+				realResource: string;
+				resourceQuery: string;
+				issuer: string;
+				compiler: string;
+		  }) => RuleSetUseItem[])
+		| {
+				/**
+				 * Unique loader options identifier.
+				 */
+				ident?: string;
+				/**
+				 * Loader name.
+				 */
+				loader?: string;
+				/**
+				 * Loader options.
+				 */
+				options?: string | { [index: string]: any };
+		  }
+		| ((data: object) =>
+				| string
+				| {
+						/**
+						 * Unique loader options identifier.
+						 */
+						ident?: string;
+						/**
+						 * Loader name.
+						 */
+						loader?: string;
+						/**
+						 * Loader options.
+						 */
+						options?: string | { [index: string]: any };
+				  }
+				| __TypeWebpackOptions
+				| RuleSetUseItem[]);
+}
+type RuleSetUse =
+	| string
+	| RuleSetUseItem[]
+	| ((data: {
+			resource: string;
+			realResource: string;
+			resourceQuery: string;
+			issuer: string;
+			compiler: string;
+	  }) => RuleSetUseItem[])
+	| {
+			/**
+			 * Unique loader options identifier.
+			 */
+			ident?: string;
+			/**
+			 * Loader name.
+			 */
+			loader?: string;
+			/**
+			 * Loader options.
+			 */
+			options?: string | { [index: string]: any };
+	  }
+	| __TypeWebpackOptions;
+type RuleSetUseItem =
+	| string
+	| {
+			/**
+			 * Unique loader options identifier.
+			 */
+			ident?: string;
+			/**
+			 * Loader name.
+			 */
+			loader?: string;
+			/**
+			 * Loader options.
+			 */
+			options?: string | { [index: string]: any };
+	  }
+	| __TypeWebpackOptions;
+declare class RuntimeChunkPlugin {
+	constructor(options?: any);
+	options: any;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+type RuntimeCondition = undefined | string | boolean | SortableSet<string>;
+declare class RuntimeModule extends Module {
+	constructor(name: string, stage?: number);
+	name: string;
+	stage: number;
+	compilation: Compilation;
+	chunk: Chunk;
+	chunkGraph: ChunkGraph;
+	fullHash: boolean;
+	dependentHash: boolean;
+	attach(compilation: Compilation, chunk: Chunk, chunkGraph?: ChunkGraph): void;
+	generate(): string;
+	getGeneratedCode(): string;
+	shouldIsolate(): boolean;
+
+	/**
+	 * Runtime modules without any dependencies to other runtime modules
+	 */
+	static STAGE_NORMAL: number;
+
+	/**
+	 * Runtime modules with simple dependencies on other runtime modules
+	 */
+	static STAGE_BASIC: number;
+
+	/**
+	 * Runtime modules which attach to handlers of other runtime modules
+	 */
+	static STAGE_ATTACH: number;
+
+	/**
+	 * Runtime modules which trigger actions on bootstrap
+	 */
+	static STAGE_TRIGGER: number;
+}
+declare interface RuntimeRequirementsContext {
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * the code generation results
+	 */
+	codeGenerationResults: CodeGenerationResults;
+}
+type RuntimeSpec = undefined | string | SortableSet<string>;
+declare class RuntimeSpecMap<T> {
+	constructor(clone?: RuntimeSpecMap<T>);
+	get(runtime: RuntimeSpec): T;
+	has(runtime: RuntimeSpec): boolean;
+	set(runtime?: any, value?: any): void;
+	provide(runtime?: any, computer?: any): any;
+	delete(runtime?: any): void;
+	update(runtime?: any, fn?: any): void;
+	keys(): RuntimeSpec[];
+	values(): IterableIterator<T>;
+	readonly size?: number;
+}
+declare class RuntimeSpecSet {
+	constructor(iterable?: any);
+	add(runtime?: any): void;
+	has(runtime?: any): boolean;
+	readonly size: number;
+	[Symbol.iterator](): IterableIterator<RuntimeSpec>;
+}
+declare abstract class RuntimeTemplate {
+	compilation: Compilation;
+	outputOptions: OutputNormalized;
+	requestShortener: RequestShortener;
+	globalObject: string;
+	contentHashReplacement: string;
+	isIIFE(): undefined | boolean;
+	isModule(): undefined | boolean;
+	supportsConst(): undefined | boolean;
+	supportsArrowFunction(): undefined | boolean;
+	supportsOptionalChaining(): undefined | boolean;
+	supportsForOf(): undefined | boolean;
+	supportsDestructuring(): undefined | boolean;
+	supportsBigIntLiteral(): undefined | boolean;
+	supportsDynamicImport(): undefined | boolean;
+	supportsEcmaScriptModuleSyntax(): undefined | boolean;
+	supportTemplateLiteral(): undefined | boolean;
+	returningFunction(returnValue?: any, args?: string): string;
+	basicFunction(args?: any, body?: any): string;
+	concatenation(...args: (string | { expr: string })[]): string;
+	expressionFunction(expression?: any, args?: string): string;
+	emptyFunction(): "x => {}" | "function() {}";
+	destructureArray(items?: any, value?: any): string;
+	destructureObject(items?: any, value?: any): string;
+	iife(args?: any, body?: any): string;
+	forEach(variable?: any, array?: any, body?: any): string;
+
+	/**
+	 * Add a comment
+	 */
+	comment(__0: {
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+		/**
+		 * name of the chunk referenced
+		 */
+		chunkName?: string;
+		/**
+		 * reason information of the chunk
+		 */
+		chunkReason?: string;
+		/**
+		 * additional message
+		 */
+		message?: string;
+		/**
+		 * name of the export
+		 */
+		exportName?: string;
+	}): string;
+	throwMissingModuleErrorBlock(__0: {
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+	}): string;
+	throwMissingModuleErrorFunction(__0: {
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+	}): string;
+	missingModule(__0: {
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+	}): string;
+	missingModuleStatement(__0: {
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+	}): string;
+	missingModulePromise(__0: {
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+	}): string;
+	weakError(__0: {
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the request that should be printed as comment
+		 */
+		request: string;
+		/**
+		 * expression to use as id expression
+		 */
+		idExpr?: string;
+		/**
+		 * which kind of code should be returned
+		 */
+		type: "promise" | "expression" | "statements";
+	}): string;
+	moduleId(__0: {
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * the request that should be printed as comment
+		 */
+		request: string;
+		/**
+		 * if the dependency is weak (will create a nice error message)
+		 */
+		weak?: boolean;
+	}): string;
+	moduleRaw(__0: {
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * the request that should be printed as comment
+		 */
+		request: string;
+		/**
+		 * if the dependency is weak (will create a nice error message)
+		 */
+		weak?: boolean;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	moduleExports(__0: {
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * the request that should be printed as comment
+		 */
+		request: string;
+		/**
+		 * if the dependency is weak (will create a nice error message)
+		 */
+		weak?: boolean;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	moduleNamespace(__0: {
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * the request that should be printed as comment
+		 */
+		request: string;
+		/**
+		 * if the current module is in strict esm mode
+		 */
+		strict?: boolean;
+		/**
+		 * if the dependency is weak (will create a nice error message)
+		 */
+		weak?: boolean;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	moduleNamespacePromise(__0: {
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * the current dependencies block
+		 */
+		block?: AsyncDependenciesBlock;
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the request that should be printed as comment
+		 */
+		request: string;
+		/**
+		 * a message for the comment
+		 */
+		message: string;
+		/**
+		 * if the current module is in strict esm mode
+		 */
+		strict?: boolean;
+		/**
+		 * if the dependency is weak (will create a nice error message)
+		 */
+		weak?: boolean;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	runtimeConditionExpression(__0: {
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * runtime for which this code will be generated
+		 */
+		runtime?: RuntimeSpec;
+		/**
+		 * only execute the statement in some runtimes
+		 */
+		runtimeCondition?: string | boolean | SortableSet<string>;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	importStatement(__0: {
+		/**
+		 * whether a new variable should be created or the existing one updated
+		 */
+		update?: boolean;
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * the request that should be printed as comment
+		 */
+		request: string;
+		/**
+		 * name of the import variable
+		 */
+		importVar: string;
+		/**
+		 * module in which the statement is emitted
+		 */
+		originModule: Module;
+		/**
+		 * true, if this is a weak dependency
+		 */
+		weak?: boolean;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): [string, string];
+	exportFromImport(__0: {
+		/**
+		 * the module graph
+		 */
+		moduleGraph: ModuleGraph;
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the request
+		 */
+		request: string;
+		/**
+		 * the export name
+		 */
+		exportName: string | string[];
+		/**
+		 * the origin module
+		 */
+		originModule: Module;
+		/**
+		 * true, if location is safe for ASI, a bracket can be emitted
+		 */
+		asiSafe?: boolean;
+		/**
+		 * true, if expression will be called
+		 */
+		isCall: boolean;
+		/**
+		 * when false, call context will not be preserved
+		 */
+		callContext: boolean;
+		/**
+		 * when true and accessing the default exports, interop code will be generated
+		 */
+		defaultInterop: boolean;
+		/**
+		 * the identifier name of the import variable
+		 */
+		importVar: string;
+		/**
+		 * init fragments will be added here
+		 */
+		initFragments: InitFragment<any>[];
+		/**
+		 * runtime for which this code will be generated
+		 */
+		runtime: RuntimeSpec;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	blockPromise(__0: {
+		/**
+		 * the async block
+		 */
+		block: AsyncDependenciesBlock;
+		/**
+		 * the message
+		 */
+		message: string;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	asyncModuleFactory(__0: {
+		/**
+		 * the async block
+		 */
+		block: AsyncDependenciesBlock;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+	}): string;
+	syncModuleFactory(__0: {
+		/**
+		 * the dependency
+		 */
+		dependency: Dependency;
+		/**
+		 * the chunk graph
+		 */
+		chunkGraph: ChunkGraph;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+		/**
+		 * request string used originally
+		 */
+		request?: string;
+	}): string;
+	defineEsModuleFlagStatement(__0: {
+		/**
+		 * the name of the exports object
+		 */
+		exportsArgument: string;
+		/**
+		 * if set, will be filled with runtime requirements
+		 */
+		runtimeRequirements: Set<string>;
+	}): string;
+	assetUrl(__0: {
+		/**
+		 * the module
+		 */
+		module: Module;
+		/**
+		 * the public path
+		 */
+		publicPath: string;
+		/**
+		 * runtime
+		 */
+		runtime?: RuntimeSpec;
+		/**
+		 * the code generation results
+		 */
+		codeGenerationResults: CodeGenerationResults;
+	}): string;
+}
+declare abstract class RuntimeValue {
+	fn: (arg0: {
+		module: NormalModule;
+		key: string;
+		readonly version?: string;
+	}) => CodeValuePrimitive;
+	options: true | RuntimeValueOptions;
+	readonly fileDependencies?: true | string[];
+	exec(
+		parser: JavascriptParser,
+		valueCacheVersions: Map<string, string | Set<string>>,
+		key: string
+	): CodeValuePrimitive;
+	getCacheVersion(): undefined | string;
+}
+declare interface RuntimeValueOptions {
+	fileDependencies?: string[];
+	contextDependencies?: string[];
+	missingDependencies?: string[];
+	buildDependencies?: string[];
+	version?: string | (() => string);
+}
+declare interface ScopeInfo {
+	definitions: StackedMap<string, ScopeInfo | VariableInfo>;
+	topLevelScope: boolean | "arrow";
+	inShorthand: boolean;
+	isStrict: boolean;
+	isAsmJs: boolean;
+	inTry: boolean;
+}
+declare interface Selector<A, B> {
+	(input: A): B;
+}
+declare abstract class Serializer {
+	serializeMiddlewares: any;
+	deserializeMiddlewares: any;
+	context: any;
+	serialize(obj?: any, context?: any): any;
+	deserialize(value?: any, context?: any): any;
+}
+type ServerOptionsHttps = SecureContextOptions &
+	TlsOptions &
+	ServerOptionsImport;
+declare class SharePlugin {
+	constructor(options: SharePluginOptions);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+
+/**
+ * Options for shared modules.
+ */
+declare interface SharePluginOptions {
+	/**
+	 * Share scope name used for all shared modules (defaults to 'default').
+	 */
+	shareScope?: string;
+
+	/**
+	 * Modules that should be shared in the share scope. When provided, property names are used to match requested modules in this compilation.
+	 */
+	shared: Shared;
+}
+type Shared = (string | SharedObject)[] | SharedObject;
+
+/**
+ * Advanced configuration for modules that should be shared in the share scope.
+ */
+declare interface SharedConfig {
+	/**
+	 * Include the provided and fallback module directly instead behind an async request. This allows to use this shared module in initial load too. All possible shared modules need to be eager too.
+	 */
+	eager?: boolean;
+
+	/**
+	 * Provided module that should be provided to share scope. Also acts as fallback module if no shared module is found in share scope or version isn't valid. Defaults to the property name.
+	 */
+	import?: string | false;
+
+	/**
+	 * Package name to determine required version from description file. This is only needed when package name can't be automatically determined from request.
+	 */
+	packageName?: string;
+
+	/**
+	 * Version requirement from module in share scope.
+	 */
+	requiredVersion?: string | false;
+
+	/**
+	 * Module is looked up under this key from the share scope.
+	 */
+	shareKey?: string;
+
+	/**
+	 * Share scope name.
+	 */
+	shareScope?: string;
+
+	/**
+	 * Allow only a single version of the shared module in share scope (disabled by default).
+	 */
+	singleton?: boolean;
+
+	/**
+	 * Do not accept shared module if version is not valid (defaults to yes, if local fallback module is available and shared module is not a singleton, otherwise no, has no effect if there is no required version specified).
+	 */
+	strictVersion?: boolean;
+
+	/**
+	 * Version of the provided module. Will replace lower matching versions, but not higher.
+	 */
+	version?: string | false;
+}
+
+/**
+ * Modules that should be shared in the share scope. Property names are used to match requested modules in this compilation. Relative requests are resolved, module requests are matched unresolved, absolute paths will match resolved requests. A trailing slash will match all requests with this prefix. In this case shareKey must also have a trailing slash.
+ */
+declare interface SharedObject {
+	[index: string]: string | SharedConfig;
+}
+declare class SideEffectsFlagPlugin {
+	constructor(analyseSource?: boolean);
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+	static moduleHasSideEffects(
+		moduleName?: any,
+		flagValue?: any,
+		cache?: any
+	): any;
+}
+declare class SizeOnlySource extends Source {
+	constructor(size: number);
+}
+declare abstract class Snapshot {
+	startTime?: number;
+	fileTimestamps?: Map<string, null | FileSystemInfoEntry>;
+	fileHashes?: Map<string, null | string>;
+	fileTshs?: Map<string, null | string | TimestampAndHash>;
+	contextTimestamps?: Map<string, null | ResolvedContextFileSystemInfoEntry>;
+	contextHashes?: Map<string, null | string>;
+	contextTshs?: Map<string, null | ResolvedContextTimestampAndHash>;
+	missingExistence?: Map<string, boolean>;
+	managedItemInfo?: Map<string, string>;
+	managedFiles?: Set<string>;
+	managedContexts?: Set<string>;
+	managedMissing?: Set<string>;
+	children?: Set<Snapshot>;
+	hasStartTime(): boolean;
+	setStartTime(value?: any): void;
+	setMergedStartTime(value?: any, snapshot?: any): void;
+	hasFileTimestamps(): boolean;
+	setFileTimestamps(value?: any): void;
+	hasFileHashes(): boolean;
+	setFileHashes(value?: any): void;
+	hasFileTshs(): boolean;
+	setFileTshs(value?: any): void;
+	hasContextTimestamps(): boolean;
+	setContextTimestamps(value?: any): void;
+	hasContextHashes(): boolean;
+	setContextHashes(value?: any): void;
+	hasContextTshs(): boolean;
+	setContextTshs(value?: any): void;
+	hasMissingExistence(): boolean;
+	setMissingExistence(value?: any): void;
+	hasManagedItemInfo(): boolean;
+	setManagedItemInfo(value?: any): void;
+	hasManagedFiles(): boolean;
+	setManagedFiles(value?: any): void;
+	hasManagedContexts(): boolean;
+	setManagedContexts(value?: any): void;
+	hasManagedMissing(): boolean;
+	setManagedMissing(value?: any): void;
+	hasChildren(): boolean;
+	setChildren(value?: any): void;
+	addChild(child?: any): void;
+	serialize(__0: { write: any }): void;
+	deserialize(__0: { read: any }): void;
+	getFileIterable(): Iterable<string>;
+	getContextIterable(): Iterable<string>;
+	getMissingIterable(): Iterable<string>;
+}
+
+/**
+ * Options affecting how file system snapshots are created and validated.
+ */
+declare interface SnapshotOptions {
+	/**
+	 * Options for snapshotting build dependencies to determine if the whole cache need to be invalidated.
+	 */
+	buildDependencies?: {
+		/**
+		 * Use hashes of the content of the files/directories to determine invalidation.
+		 */
+		hash?: boolean;
+		/**
+		 * Use timestamps of the files/directories to determine invalidation.
+		 */
+		timestamp?: boolean;
+	};
+
+	/**
+	 * List of paths that are managed by a package manager and contain a version or hash in its path so all files are immutable.
+	 */
+	immutablePaths?: (string | RegExp)[];
+
+	/**
+	 * List of paths that are managed by a package manager and can be trusted to not be modified otherwise.
+	 */
+	managedPaths?: (string | RegExp)[];
+
+	/**
+	 * Options for snapshotting dependencies of modules to determine if they need to be built again.
+	 */
+	module?: {
+		/**
+		 * Use hashes of the content of the files/directories to determine invalidation.
+		 */
+		hash?: boolean;
+		/**
+		 * Use timestamps of the files/directories to determine invalidation.
+		 */
+		timestamp?: boolean;
+	};
+
+	/**
+	 * Options for snapshotting dependencies of request resolving to determine if requests need to be re-resolved.
+	 */
+	resolve?: {
+		/**
+		 * Use hashes of the content of the files/directories to determine invalidation.
+		 */
+		hash?: boolean;
+		/**
+		 * Use timestamps of the files/directories to determine invalidation.
+		 */
+		timestamp?: boolean;
+	};
+
+	/**
+	 * Options for snapshotting the resolving of build dependencies to determine if the build dependencies need to be re-resolved.
+	 */
+	resolveBuildDependencies?: {
+		/**
+		 * Use hashes of the content of the files/directories to determine invalidation.
+		 */
+		hash?: boolean;
+		/**
+		 * Use timestamps of the files/directories to determine invalidation.
+		 */
+		timestamp?: boolean;
+	};
+}
+declare abstract class SortableSet<T> extends Set<T> {
+	/**
+	 * Sort with a comparer function
+	 */
+	sortWith(sortFn: (arg0: T, arg1: T) => number): void;
+	sort(): SortableSet<T>;
+
+	/**
+	 * Get data from cache
+	 */
+	getFromCache<R>(fn: (arg0: SortableSet<T>) => R): R;
+
+	/**
+	 * Get data from cache (ignoring sorting)
+	 */
+	getFromUnorderedCache<R>(fn: (arg0: SortableSet<T>) => R): R;
+	toJSON(): T[];
+
+	/**
+	 * Iterates over values in the set.
+	 */
+	[Symbol.iterator](): IterableIterator<T>;
+}
+declare class Source {
+	constructor();
+	size(): number;
+	map(options?: MapOptions): Object;
+	sourceAndMap(options?: MapOptions): { source: string | Buffer; map: Object };
+	updateHash(hash: Hash): void;
+	source(): string | Buffer;
+	buffer(): Buffer;
+}
+declare interface SourceLike {
+	source(): string | Buffer;
+}
+declare interface SourceMap {
+	version: number;
+	sources: string[];
+	mappings: string;
+	file?: string;
+	sourceRoot?: string;
+	sourcesContent?: string[];
+	names?: string[];
+}
+declare class SourceMapDevToolPlugin {
+	constructor(options?: SourceMapDevToolPluginOptions);
+	sourceMapFilename: string | false;
+	sourceMappingURLComment: string | false;
+	moduleFilenameTemplate: string | Function;
+	fallbackModuleFilenameTemplate: string | Function;
+	namespace: string;
+	options: SourceMapDevToolPluginOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface SourceMapDevToolPluginOptions {
+	/**
+	 * Appends the given value to the original asset. Usually the #sourceMappingURL comment. [url] is replaced with a URL to the source map file. false disables the appending.
+	 */
+	append?: null | string | false;
+
+	/**
+	 * Indicates whether column mappings should be used (defaults to true).
+	 */
+	columns?: boolean;
+
+	/**
+	 * Exclude modules that match the given value from source map generation.
+	 */
+	exclude?: string | RegExp | Rule[];
+
+	/**
+	 * Generator string or function to create identifiers of modules for the 'sources' array in the SourceMap used only if 'moduleFilenameTemplate' would result in a conflict.
+	 */
+	fallbackModuleFilenameTemplate?: string | Function;
+
+	/**
+	 * Path prefix to which the [file] placeholder is relative to.
+	 */
+	fileContext?: string;
+
+	/**
+	 * Defines the output filename of the SourceMap (will be inlined if no value is provided).
+	 */
+	filename?: null | string | false;
+
+	/**
+	 * Include source maps for module paths that match the given value.
+	 */
+	include?: string | RegExp | Rule[];
+
+	/**
+	 * Indicates whether SourceMaps from loaders should be used (defaults to true).
+	 */
+	module?: boolean;
+
+	/**
+	 * Generator string or function to create identifiers of modules for the 'sources' array in the SourceMap.
+	 */
+	moduleFilenameTemplate?: string | Function;
+
+	/**
+	 * Namespace prefix to allow multiple webpack roots in the devtools.
+	 */
+	namespace?: string;
+
+	/**
+	 * Omit the 'sourceContents' array from the SourceMap.
+	 */
+	noSources?: boolean;
+
+	/**
+	 * Provide a custom public path for the SourceMapping comment.
+	 */
+	publicPath?: string;
+
+	/**
+	 * Provide a custom value for the 'sourceRoot' property in the SourceMap.
+	 */
+	sourceRoot?: string;
+
+	/**
+	 * Include source maps for modules based on their extension (defaults to .js and .css).
+	 */
+	test?: string | RegExp | Rule[];
+}
+declare class SourceMapSource extends Source {
+	constructor(
+		source: string | Buffer,
+		name: string,
+		sourceMap: string | Object | Buffer,
+		originalSource?: string | Buffer,
+		innerSourceMap?: string | Object | Buffer,
+		removeOriginalSource?: boolean
+	);
+	getArgsAsBuffers(): [
+		Buffer,
+		string,
+		Buffer,
+		undefined | Buffer,
+		undefined | Buffer,
+		boolean
+	];
+}
+declare interface SourcePosition {
+	line: number;
+	column?: number;
+}
+declare interface SplitChunksOptions {
+	chunksFilter: (chunk: Chunk) => boolean;
+	defaultSizeTypes: string[];
+	minSize: SplitChunksSizes;
+	minSizeReduction: SplitChunksSizes;
+	minRemainingSize: SplitChunksSizes;
+	enforceSizeThreshold: SplitChunksSizes;
+	maxInitialSize: SplitChunksSizes;
+	maxAsyncSize: SplitChunksSizes;
+	minChunks: number;
+	maxAsyncRequests: number;
+	maxInitialRequests: number;
+	hidePathInfo: boolean;
+	filename: string | ((arg0: PathData, arg1?: AssetInfo) => string);
+	automaticNameDelimiter: string;
+	getCacheGroups: (
+		module: Module,
+		context: CacheGroupsContext
+	) => CacheGroupSource[];
+	getName: (
+		module?: Module,
+		chunks?: Chunk[],
+		key?: string
+	) => undefined | string;
+	usedExports: boolean;
+	fallbackCacheGroup: FallbackCacheGroup;
+}
+declare class SplitChunksPlugin {
+	constructor(options?: OptimizationSplitChunksOptions);
+	options: SplitChunksOptions;
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface SplitChunksSizes {
+	[index: string]: number;
+}
+declare abstract class StackedMap<K, V> {
+	map: Map<K, InternalCell<V>>;
+	stack: Map<K, InternalCell<V>>[];
+	set(item: K, value: V): void;
+	delete(item: K): void;
+	has(item: K): boolean;
+	get(item: K): Cell<V>;
+	asArray(): K[];
+	asSet(): Set<K>;
+	asPairArray(): [K, Cell<V>][];
+	asMap(): Map<K, Cell<V>>;
+	readonly size: number;
+	createChild(): StackedMap<K, V>;
+}
+type StartupRenderContext = RenderContext & { inlined: boolean };
+type Statement =
+	| FunctionDeclaration
+	| VariableDeclaration
+	| ClassDeclaration
+	| ExpressionStatement
+	| BlockStatement
+	| StaticBlock
+	| EmptyStatement
+	| DebuggerStatement
+	| WithStatement
+	| ReturnStatement
+	| LabeledStatement
+	| BreakStatement
+	| ContinueStatement
+	| IfStatement
+	| SwitchStatement
+	| ThrowStatement
+	| TryStatement
+	| WhileStatement
+	| DoWhileStatement
+	| ForStatement
+	| ForInStatement
+	| ForOfStatement;
+declare class Stats {
+	constructor(compilation: Compilation);
+	compilation: Compilation;
+	readonly hash?: string;
+	readonly startTime: any;
+	readonly endTime: any;
+	hasWarnings(): boolean;
+	hasErrors(): boolean;
+	toJson(options?: string | StatsOptions): StatsCompilation;
+	toString(options?: any): string;
+}
+type StatsAsset = KnownStatsAsset & Record<string, any>;
+type StatsChunk = KnownStatsChunk & Record<string, any>;
+type StatsChunkGroup = KnownStatsChunkGroup & Record<string, any>;
+type StatsChunkOrigin = KnownStatsChunkOrigin & Record<string, any>;
+type StatsCompilation = KnownStatsCompilation & Record<string, any>;
+type StatsError = KnownStatsError & Record<string, any>;
+declare abstract class StatsFactory {
+	hooks: Readonly<{
+		extract: HookMap<SyncBailHook<[Object, any, StatsFactoryContext], any>>;
+		filter: HookMap<
+			SyncBailHook<[any, StatsFactoryContext, number, number], any>
+		>;
+		sort: HookMap<
+			SyncBailHook<
+				[((arg0?: any, arg1?: any) => number)[], StatsFactoryContext],
+				any
+			>
+		>;
+		filterSorted: HookMap<
+			SyncBailHook<[any, StatsFactoryContext, number, number], any>
+		>;
+		groupResults: HookMap<
+			SyncBailHook<[GroupConfig[], StatsFactoryContext], any>
+		>;
+		sortResults: HookMap<
+			SyncBailHook<
+				[((arg0?: any, arg1?: any) => number)[], StatsFactoryContext],
+				any
+			>
+		>;
+		filterResults: HookMap<
+			SyncBailHook<[any, StatsFactoryContext, number, number], any>
+		>;
+		merge: HookMap<SyncBailHook<[any[], StatsFactoryContext], any>>;
+		result: HookMap<SyncBailHook<[any[], StatsFactoryContext], any>>;
+		getItemName: HookMap<SyncBailHook<[any, StatsFactoryContext], any>>;
+		getItemFactory: HookMap<SyncBailHook<[any, StatsFactoryContext], any>>;
+	}>;
+	create(
+		type: string,
+		data: any,
+		baseContext: Omit<StatsFactoryContext, "type">
+	): any;
+}
+type StatsFactoryContext = KnownStatsFactoryContext & Record<string, any>;
+type StatsLogging = KnownStatsLogging & Record<string, any>;
+type StatsLoggingEntry = KnownStatsLoggingEntry & Record<string, any>;
+type StatsModule = KnownStatsModule & Record<string, any>;
+type StatsModuleIssuer = KnownStatsModuleIssuer & Record<string, any>;
+type StatsModuleReason = KnownStatsModuleReason & Record<string, any>;
+type StatsModuleTraceDependency = KnownStatsModuleTraceDependency &
+	Record<string, any>;
+type StatsModuleTraceItem = KnownStatsModuleTraceItem & Record<string, any>;
+
+/**
+ * Stats options object.
+ */
+declare interface StatsOptions {
+	/**
+	 * Fallback value for stats options when an option is not defined (has precedence over local webpack defaults).
+	 */
+	all?: boolean;
+
+	/**
+	 * Add assets information.
+	 */
+	assets?: boolean;
+
+	/**
+	 * Sort the assets by that field.
+	 */
+	assetsSort?: string;
+
+	/**
+	 * Space to display assets (groups will be collapsed to fit this space).
+	 */
+	assetsSpace?: number;
+
+	/**
+	 * Add built at time information.
+	 */
+	builtAt?: boolean;
+
+	/**
+	 * Add information about cached (not built) modules (deprecated: use 'cachedModules' instead).
+	 */
+	cached?: boolean;
+
+	/**
+	 * Show cached assets (setting this to `false` only shows emitted files).
+	 */
+	cachedAssets?: boolean;
+
+	/**
+	 * Add information about cached (not built) modules.
+	 */
+	cachedModules?: boolean;
+
+	/**
+	 * Add children information.
+	 */
+	children?: boolean;
+
+	/**
+	 * Display auxiliary assets in chunk groups.
+	 */
+	chunkGroupAuxiliary?: boolean;
+
+	/**
+	 * Display children of chunk groups.
+	 */
+	chunkGroupChildren?: boolean;
+
+	/**
+	 * Limit of assets displayed in chunk groups.
+	 */
+	chunkGroupMaxAssets?: number;
+
+	/**
+	 * Display all chunk groups with the corresponding bundles.
+	 */
+	chunkGroups?: boolean;
+
+	/**
+	 * Add built modules information to chunk information.
+	 */
+	chunkModules?: boolean;
+
+	/**
+	 * Space to display chunk modules (groups will be collapsed to fit this space, value is in number of modules/group).
+	 */
+	chunkModulesSpace?: number;
+
+	/**
+	 * Add the origins of chunks and chunk merging info.
+	 */
+	chunkOrigins?: boolean;
+
+	/**
+	 * Add information about parent, children and sibling chunks to chunk information.
+	 */
+	chunkRelations?: boolean;
+
+	/**
+	 * Add chunk information.
+	 */
+	chunks?: boolean;
+
+	/**
+	 * Sort the chunks by that field.
+	 */
+	chunksSort?: string;
+
+	/**
+	 * Enables/Disables colorful output.
+	 */
+	colors?:
+		| boolean
+		| {
+				/**
+				 * Custom color for bold text.
+				 */
+				bold?: string;
+				/**
+				 * Custom color for cyan text.
+				 */
+				cyan?: string;
+				/**
+				 * Custom color for green text.
+				 */
+				green?: string;
+				/**
+				 * Custom color for magenta text.
+				 */
+				magenta?: string;
+				/**
+				 * Custom color for red text.
+				 */
+				red?: string;
+				/**
+				 * Custom color for yellow text.
+				 */
+				yellow?: string;
+		  };
+
+	/**
+	 * Context directory for request shortening.
+	 */
+	context?: string;
+
+	/**
+	 * Show chunk modules that are dependencies of other modules of the chunk.
+	 */
+	dependentModules?: boolean;
+
+	/**
+	 * Add module depth in module graph.
+	 */
+	depth?: boolean;
+
+	/**
+	 * Display the entry points with the corresponding bundles.
+	 */
+	entrypoints?: boolean | "auto";
+
+	/**
+	 * Add --env information.
+	 */
+	env?: boolean;
+
+	/**
+	 * Add details to errors (like resolving log).
+	 */
+	errorDetails?: boolean | "auto";
+
+	/**
+	 * Add internal stack trace to errors.
+	 */
+	errorStack?: boolean;
+
+	/**
+	 * Add errors.
+	 */
+	errors?: boolean;
+
+	/**
+	 * Add errors count.
+	 */
+	errorsCount?: boolean;
+
+	/**
+	 * Please use excludeModules instead.
+	 */
+	exclude?:
+		| string
+		| boolean
+		| RegExp
+		| ModuleFilterItemTypes[]
+		| ((
+				name: string,
+				module: StatsModule,
+				type: "module" | "chunk" | "root-of-chunk" | "nested"
+		  ) => boolean);
+
+	/**
+	 * Suppress assets that match the specified filters. Filters can be Strings, RegExps or Functions.
+	 */
+	excludeAssets?:
+		| string
+		| RegExp
+		| AssetFilterItemTypes[]
+		| ((name: string, asset: StatsAsset) => boolean);
+
+	/**
+	 * Suppress modules that match the specified filters. Filters can be Strings, RegExps, Booleans or Functions.
+	 */
+	excludeModules?:
+		| string
+		| boolean
+		| RegExp
+		| ModuleFilterItemTypes[]
+		| ((
+				name: string,
+				module: StatsModule,
+				type: "module" | "chunk" | "root-of-chunk" | "nested"
+		  ) => boolean);
+
+	/**
+	 * Group assets by how their are related to chunks.
+	 */
+	groupAssetsByChunk?: boolean;
+
+	/**
+	 * Group assets by their status (emitted, compared for emit or cached).
+	 */
+	groupAssetsByEmitStatus?: boolean;
+
+	/**
+	 * Group assets by their extension.
+	 */
+	groupAssetsByExtension?: boolean;
+
+	/**
+	 * Group assets by their asset info (immutable, development, hotModuleReplacement, etc).
+	 */
+	groupAssetsByInfo?: boolean;
+
+	/**
+	 * Group assets by their path.
+	 */
+	groupAssetsByPath?: boolean;
+
+	/**
+	 * Group modules by their attributes (errors, warnings, assets, optional, orphan, or dependent).
+	 */
+	groupModulesByAttributes?: boolean;
+
+	/**
+	 * Group modules by their status (cached or built and cacheable).
+	 */
+	groupModulesByCacheStatus?: boolean;
+
+	/**
+	 * Group modules by their extension.
+	 */
+	groupModulesByExtension?: boolean;
+
+	/**
+	 * Group modules by their layer.
+	 */
+	groupModulesByLayer?: boolean;
+
+	/**
+	 * Group modules by their path.
+	 */
+	groupModulesByPath?: boolean;
+
+	/**
+	 * Group modules by their type.
+	 */
+	groupModulesByType?: boolean;
+
+	/**
+	 * Group reasons by their origin module.
+	 */
+	groupReasonsByOrigin?: boolean;
+
+	/**
+	 * Add the hash of the compilation.
+	 */
+	hash?: boolean;
+
+	/**
+	 * Add ids.
+	 */
+	ids?: boolean;
+
+	/**
+	 * Add logging output.
+	 */
+	logging?: boolean | "none" | "error" | "warn" | "info" | "log" | "verbose";
+
+	/**
+	 * Include debug logging of specified loggers (i. e. for plugins or loaders). Filters can be Strings, RegExps or Functions.
+	 */
+	loggingDebug?:
+		| string
+		| boolean
+		| RegExp
+		| FilterItemTypes[]
+		| ((value: string) => boolean);
+
+	/**
+	 * Add stack traces to logging output.
+	 */
+	loggingTrace?: boolean;
+
+	/**
+	 * Add information about assets inside modules.
+	 */
+	moduleAssets?: boolean;
+
+	/**
+	 * Add dependencies and origin of warnings/errors.
+	 */
+	moduleTrace?: boolean;
+
+	/**
+	 * Add built modules information.
+	 */
+	modules?: boolean;
+
+	/**
+	 * Sort the modules by that field.
+	 */
+	modulesSort?: string;
+
+	/**
+	 * Space to display modules (groups will be collapsed to fit this space, value is in number of modules/groups).
+	 */
+	modulesSpace?: number;
+
+	/**
+	 * Add information about modules nested in other modules (like with module concatenation).
+	 */
+	nestedModules?: boolean;
+
+	/**
+	 * Space to display modules nested within other modules (groups will be collapsed to fit this space, value is in number of modules/group).
+	 */
+	nestedModulesSpace?: number;
+
+	/**
+	 * Show reasons why optimization bailed out for modules.
+	 */
+	optimizationBailout?: boolean;
+
+	/**
+	 * Add information about orphan modules.
+	 */
+	orphanModules?: boolean;
+
+	/**
+	 * Add output path information.
+	 */
+	outputPath?: boolean;
+
+	/**
+	 * Add performance hint flags.
+	 */
+	performance?: boolean;
+
+	/**
+	 * Preset for the default values.
+	 */
+	preset?: string | boolean;
+
+	/**
+	 * Show exports provided by modules.
+	 */
+	providedExports?: boolean;
+
+	/**
+	 * Add public path information.
+	 */
+	publicPath?: boolean;
+
+	/**
+	 * Add information about the reasons why modules are included.
+	 */
+	reasons?: boolean;
+
+	/**
+	 * Space to display reasons (groups will be collapsed to fit this space).
+	 */
+	reasonsSpace?: number;
+
+	/**
+	 * Add information about assets that are related to other assets (like SourceMaps for assets).
+	 */
+	relatedAssets?: boolean;
+
+	/**
+	 * Add information about runtime modules (deprecated: use 'runtimeModules' instead).
+	 */
+	runtime?: boolean;
+
+	/**
+	 * Add information about runtime modules.
+	 */
+	runtimeModules?: boolean;
+
+	/**
+	 * Add the source code of modules.
+	 */
+	source?: boolean;
+
+	/**
+	 * Add timing information.
+	 */
+	timings?: boolean;
+
+	/**
+	 * Show exports used by modules.
+	 */
+	usedExports?: boolean;
+
+	/**
+	 * Add webpack version information.
+	 */
+	version?: boolean;
+
+	/**
+	 * Add warnings.
+	 */
+	warnings?: boolean;
+
+	/**
+	 * Add warnings count.
+	 */
+	warningsCount?: boolean;
+
+	/**
+	 * Suppress listing warnings that match the specified filters (they will still be counted). Filters can be Strings, RegExps or Functions.
+	 */
+	warningsFilter?:
+		| string
+		| RegExp
+		| WarningFilterItemTypes[]
+		| ((warning: StatsError, value: string) => boolean);
+}
+declare abstract class StatsPrinter {
+	hooks: Readonly<{
+		sortElements: HookMap<SyncBailHook<[string[], StatsPrinterContext], true>>;
+		printElements: HookMap<
+			SyncBailHook<[PrintedElement[], StatsPrinterContext], string>
+		>;
+		sortItems: HookMap<SyncBailHook<[any[], StatsPrinterContext], true>>;
+		getItemName: HookMap<SyncBailHook<[any, StatsPrinterContext], string>>;
+		printItems: HookMap<SyncBailHook<[string[], StatsPrinterContext], string>>;
+		print: HookMap<SyncBailHook<[{}, StatsPrinterContext], string>>;
+		result: HookMap<SyncWaterfallHook<[string, StatsPrinterContext]>>;
+	}>;
+	print(type: string, object: Object, baseContext?: Object): string;
+}
+type StatsPrinterContext = KnownStatsPrinterContext & Record<string, any>;
+type StatsProfile = KnownStatsProfile & Record<string, any>;
+type StatsValue =
+	| boolean
+	| StatsOptions
+	| "none"
+	| "verbose"
+	| "summary"
+	| "errors-only"
+	| "errors-warnings"
+	| "minimal"
+	| "normal"
+	| "detailed";
+declare class SyncModuleIdsPlugin {
+	constructor(__0: {
+		/**
+		 * path to file
+		 */
+		path: string;
+		/**
+		 * context for module names
+		 */
+		context?: string;
+		/**
+		 * selector for modules
+		 */
+		test: (arg0: Module) => boolean;
+		/**
+		 * operation mode (defaults to merge)
+		 */
+		mode?: "read" | "create" | "merge" | "update";
+	});
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface SyntheticDependencyLocation {
+	name: string;
+	index?: number;
+}
+declare const TOMBSTONE: unique symbol;
+declare const TRANSITIVE: unique symbol;
+declare const TRANSITIVE_ONLY: unique symbol;
+declare interface TagInfo {
+	tag: any;
+	data: any;
+	next?: TagInfo;
+}
+declare class Template {
+	constructor();
+	static getFunctionContent(fn: Function): string;
+	static toIdentifier(str: string): string;
+	static toComment(str: string): string;
+	static toNormalComment(str: string): string;
+	static toPath(str: string): string;
+	static numberToIdentifier(n: number): string;
+	static numberToIdentifierContinuation(n: number): string;
+	static indent(s: string | string[]): string;
+	static prefix(s: string | string[], prefix: string): string;
+	static asString(str: string | string[]): string;
+	static getModulesArrayBounds(modules: WithId[]): false | [number, number];
+	static renderChunkModules(
+		renderContext: ChunkRenderContext,
+		modules: Module[],
+		renderModule: (arg0: Module) => Source,
+		prefix?: string
+	): Source;
+	static renderRuntimeModules(
+		runtimeModules: RuntimeModule[],
+		renderContext: RenderContext & {
+			codeGenerationResults?: CodeGenerationResults;
+		}
+	): Source;
+	static renderChunkRuntimeModules(
+		runtimeModules: RuntimeModule[],
+		renderContext: RenderContext
+	): Source;
+	static NUMBER_OF_IDENTIFIER_START_CHARS: number;
+	static NUMBER_OF_IDENTIFIER_CONTINUATION_CHARS: number;
+}
+declare interface TimestampAndHash {
+	safeTime: number;
+	timestamp?: number;
+	hash: string;
+}
+declare class TopLevelSymbol {
+	constructor(name: string);
+	name: string;
+}
+
+/**
+ * Use a Trusted Types policy to create urls for chunks.
+ */
+declare interface TrustedTypes {
+	/**
+	 * The name of the Trusted Types policy created by webpack to serve bundle chunks.
+	 */
+	policyName?: string;
+}
+declare const UNDEFINED_MARKER: unique symbol;
+declare interface UpdateHashContextDependency {
+	chunkGraph: ChunkGraph;
+	runtime: RuntimeSpec;
+	runtimeTemplate?: RuntimeTemplate;
+}
+declare interface UpdateHashContextGenerator {
+	/**
+	 * the module
+	 */
+	module: NormalModule;
+	chunkGraph: ChunkGraph;
+	runtime: RuntimeSpec;
+	runtimeTemplate?: RuntimeTemplate;
+}
+type UsageStateType = 0 | 1 | 2 | 3 | 4;
+declare interface UserResolveOptions {
+	/**
+	 * A list of module alias configurations or an object which maps key to value
+	 */
+	alias?: AliasOption[] | AliasOptions;
+
+	/**
+	 * A list of module alias configurations or an object which maps key to value, applied only after modules option
+	 */
+	fallback?: AliasOption[] | AliasOptions;
+
+	/**
+	 * A list of alias fields in description files
+	 */
+	aliasFields?: (string | string[])[];
+
+	/**
+	 * A function which decides whether a request should be cached or not. An object is passed with at least `path` and `request` properties.
+	 */
+	cachePredicate?: (arg0: ResolveRequest) => boolean;
+
+	/**
+	 * Whether or not the unsafeCache should include request context as part of the cache key.
+	 */
+	cacheWithContext?: boolean;
+
+	/**
+	 * A list of description files to read from
+	 */
+	descriptionFiles?: string[];
+
+	/**
+	 * A list of exports field condition names.
+	 */
+	conditionNames?: string[];
+
+	/**
+	 * Enforce that a extension from extensions must be used
+	 */
+	enforceExtension?: boolean;
+
+	/**
+	 * A list of exports fields in description files
+	 */
+	exportsFields?: (string | string[])[];
+
+	/**
+	 * A list of imports fields in description files
+	 */
+	importsFields?: (string | string[])[];
+
+	/**
+	 * A list of extensions which should be tried for files
+	 */
+	extensions?: string[];
+
+	/**
+	 * The file system which should be used
+	 */
+	fileSystem: FileSystem;
+
+	/**
+	 * Use this cache object to unsafely cache the successful requests
+	 */
+	unsafeCache?: boolean | object;
+
+	/**
+	 * Resolve symlinks to their symlinked location
+	 */
+	symlinks?: boolean;
+
+	/**
+	 * A prepared Resolver to which the plugins are attached
+	 */
+	resolver?: Resolver;
+
+	/**
+	 * A list of directories to resolve modules from, can be absolute path or folder name
+	 */
+	modules?: string | string[];
+
+	/**
+	 * A list of main fields in description files
+	 */
+	mainFields?: (
+		| string
+		| string[]
+		| { name: string | string[]; forceRelative: boolean }
+	)[];
+
+	/**
+	 * A list of main files in directories
+	 */
+	mainFiles?: string[];
+
+	/**
+	 * A list of additional resolve plugins which should be applied
+	 */
+	plugins?: Plugin[];
+
+	/**
+	 * A PnP API that should be used - null is "never", undefined is "auto"
+	 */
+	pnpApi?: null | PnpApiImpl;
+
+	/**
+	 * A list of root paths
+	 */
+	roots?: string[];
+
+	/**
+	 * The request is already fully specified and no extensions or directories are resolved for it
+	 */
+	fullySpecified?: boolean;
+
+	/**
+	 * Resolve to a context instead of a file
+	 */
+	resolveToContext?: boolean;
+
+	/**
+	 * A list of resolve restrictions
+	 */
+	restrictions?: (string | RegExp)[];
+
+	/**
+	 * Use only the sync constraints of the file system calls
+	 */
+	useSyncFileSystemCalls?: boolean;
+
+	/**
+	 * Prefer to resolve module requests as relative requests before falling back to modules
+	 */
+	preferRelative?: boolean;
+
+	/**
+	 * Prefer to resolve server-relative urls as absolute paths before falling back to resolve in roots
+	 */
+	preferAbsolute?: boolean;
+}
+declare abstract class VariableInfo {
+	declaredScope: ScopeInfo;
+	freeName: string | true;
+	tagInfo?: TagInfo;
+}
+declare interface VariableInfoInterface {
+	declaredScope: ScopeInfo;
+	freeName: string | true;
+	tagInfo?: TagInfo;
+}
+type WarningFilterItemTypes =
+	| string
+	| RegExp
+	| ((warning: StatsError, value: string) => boolean);
+declare interface WatchFileSystem {
+	watch: (
+		files: Iterable<string>,
+		directories: Iterable<string>,
+		missing: Iterable<string>,
+		startTime: number,
+		options: WatchOptions,
+		callback: (
+			arg0: undefined | Error,
+			arg1: Map<string, FileSystemInfoEntry | "ignore">,
+			arg2: Map<string, FileSystemInfoEntry | "ignore">,
+			arg3: Set<string>,
+			arg4: Set<string>
+		) => void,
+		callbackUndelayed: (arg0: string, arg1: number) => void
+	) => Watcher;
+}
+declare class WatchIgnorePlugin {
+	constructor(options: WatchIgnorePluginOptions);
+	paths: (string | RegExp)[];
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare interface WatchIgnorePluginOptions {
+	/**
+	 * A list of RegExps or absolute paths to directories or files that should be ignored.
+	 */
+	paths: (string | RegExp)[];
+}
+
+/**
+ * Options for the watcher.
+ */
+declare interface WatchOptions {
+	/**
+	 * Delay the rebuilt after the first change. Value is a time in ms.
+	 */
+	aggregateTimeout?: number;
+
+	/**
+	 * Resolve symlinks and watch symlink and real file. This is usually not needed as webpack already resolves symlinks ('resolve.symlinks').
+	 */
+	followSymlinks?: boolean;
+
+	/**
+	 * Ignore some files from watching (glob pattern or regexp).
+	 */
+	ignored?: string | RegExp | string[];
+
+	/**
+	 * Enable polling mode for watching.
+	 */
+	poll?: number | boolean;
+
+	/**
+	 * Stop watching when stdin stream has ended.
+	 */
+	stdin?: boolean;
+}
+declare interface Watcher {
+	/**
+	 * closes the watcher and all underlying file watchers
+	 */
+	close: () => void;
+
+	/**
+	 * closes the watcher, but keeps underlying file watchers alive until the next watch call
+	 */
+	pause: () => void;
+
+	/**
+	 * get current aggregated changes that have not yet send to callback
+	 */
+	getAggregatedChanges?: () => Set<string>;
+
+	/**
+	 * get current aggregated removals that have not yet send to callback
+	 */
+	getAggregatedRemovals?: () => Set<string>;
+
+	/**
+	 * get info about files
+	 */
+	getFileTimeInfoEntries: () => Map<string, FileSystemInfoEntry | "ignore">;
+
+	/**
+	 * get info about directories
+	 */
+	getContextTimeInfoEntries: () => Map<string, FileSystemInfoEntry | "ignore">;
+
+	/**
+	 * get info about timestamps and changes
+	 */
+	getInfo?: () => WatcherInfo;
+}
+declare interface WatcherInfo {
+	/**
+	 * get current aggregated changes that have not yet send to callback
+	 */
+	changes: Set<string>;
+
+	/**
+	 * get current aggregated removals that have not yet send to callback
+	 */
+	removals: Set<string>;
+
+	/**
+	 * get info about files
+	 */
+	fileTimeInfoEntries: Map<string, FileSystemInfoEntry | "ignore">;
+
+	/**
+	 * get info about directories
+	 */
+	contextTimeInfoEntries: Map<string, FileSystemInfoEntry | "ignore">;
+}
+declare abstract class Watching {
+	startTime: null | number;
+	invalid: boolean;
+	handler: CallbackFunction<Stats>;
+	callbacks: CallbackFunction<void>[];
+	closed: boolean;
+	suspended: boolean;
+	blocked: boolean;
+	watchOptions: {
+		/**
+		 * Delay the rebuilt after the first change. Value is a time in ms.
+		 */
+		aggregateTimeout?: number;
+		/**
+		 * Resolve symlinks and watch symlink and real file. This is usually not needed as webpack already resolves symlinks ('resolve.symlinks').
+		 */
+		followSymlinks?: boolean;
+		/**
+		 * Ignore some files from watching (glob pattern or regexp).
+		 */
+		ignored?: string | RegExp | string[];
+		/**
+		 * Enable polling mode for watching.
+		 */
+		poll?: number | boolean;
+		/**
+		 * Stop watching when stdin stream has ended.
+		 */
+		stdin?: boolean;
+	};
+	compiler: Compiler;
+	running: boolean;
+	watcher?: null | Watcher;
+	pausedWatcher?: null | Watcher;
+	lastWatcherStartTime?: number;
+	watch(
+		files: Iterable<string>,
+		dirs: Iterable<string>,
+		missing: Iterable<string>
+	): void;
+	invalidate(callback?: CallbackFunction<void>): void;
+	suspend(): void;
+	resume(): void;
+	close(callback: CallbackFunction<void>): void;
+}
+declare abstract class WeakTupleMap<T extends any[], V> {
+	set(...args: [T, ...V[]]): void;
+	has(...args: T): boolean;
+	get(...args: T): V;
+	provide(...args: [T, ...(() => V)[]]): V;
+	delete(...args: T): void;
+	clear(): void;
+}
+declare interface WebAssemblyRenderContext {
+	/**
+	 * the chunk
+	 */
+	chunk: Chunk;
+
+	/**
+	 * the dependency templates
+	 */
+	dependencyTemplates: DependencyTemplates;
+
+	/**
+	 * the runtime template
+	 */
+	runtimeTemplate: RuntimeTemplate;
+
+	/**
+	 * the module graph
+	 */
+	moduleGraph: ModuleGraph;
+
+	/**
+	 * the chunk graph
+	 */
+	chunkGraph: ChunkGraph;
+
+	/**
+	 * results of code generation
+	 */
+	codeGenerationResults: CodeGenerationResults;
+}
+declare class WebWorkerTemplatePlugin {
+	constructor();
+
+	/**
+	 * Apply the plugin
+	 */
+	apply(compiler: Compiler): void;
+}
+declare class WebpackError extends Error {
+	/**
+	 * Creates an instance of WebpackError.
+	 */
+	constructor(message?: string);
+	details: any;
+	module: Module;
+	loc: DependencyLocation;
+	hideStack: boolean;
+	chunk: Chunk;
+	file: string;
+	serialize(__0: { write: any }): void;
+	deserialize(__0: { read: any }): void;
+
+	/**
+	 * Create .stack property on a target object
+	 */
+	static captureStackTrace(
+		targetObject: object,
+		constructorOpt?: Function
+	): void;
+
+	/**
+	 * Optional override for formatting stack traces
+	 */
+	static prepareStackTrace?: (
+		err: Error,
+		stackTraces: NodeJS.CallSite[]
+	) => any;
+	static stackTraceLimit: number;
+}
+declare abstract class WebpackLogger {
+	getChildLogger: (arg0: string | (() => string)) => WebpackLogger;
+	error(...args: any[]): void;
+	warn(...args: any[]): void;
+	info(...args: any[]): void;
+	log(...args: any[]): void;
+	debug(...args: any[]): void;
+	assert(assertion: any, ...args: any[]): void;
+	trace(): void;
+	clear(): void;
+	status(...args: any[]): void;
+	group(...args: any[]): void;
+	groupCollapsed(...args: any[]): void;
+	groupEnd(...args: any[]): void;
+	profile(label?: any): void;
+	profileEnd(label?: any): void;
+	time(label?: any): void;
+	timeLog(label?: any): void;
+	timeEnd(label?: any): void;
+	timeAggregate(label?: any): void;
+	timeAggregateEnd(label?: any): void;
+}
+declare class WebpackOptionsApply extends OptionsApply {
+	constructor();
+}
+declare class WebpackOptionsDefaulter {
+	constructor();
+	process(options?: any): any;
+}
+
+/**
+ * Normalized webpack options object.
+ */
+declare interface WebpackOptionsNormalized {
+	/**
+	 * Set the value of `require.amd` and `define.amd`. Or disable AMD support.
+	 */
+	amd?: false | { [index: string]: any };
+
+	/**
+	 * Report the first error as a hard error instead of tolerating it.
+	 */
+	bail?: boolean;
+
+	/**
+	 * Cache generated modules and chunks to improve performance for multiple incremental builds.
+	 */
+	cache: CacheOptionsNormalized;
+
+	/**
+	 * The base directory (absolute path!) for resolving the `entry` option. If `output.pathinfo` is set, the included pathinfo is shortened to this directory.
+	 */
+	context?: string;
+
+	/**
+	 * References to other configurations to depend on.
+	 */
+	dependencies?: string[];
+
+	/**
+	 * Options for the webpack-dev-server.
+	 */
+	devServer?: DevServer;
+
+	/**
+	 * A developer tool to enhance debugging (false | eval | [inline-|hidden-|eval-][nosources-][cheap-[module-]]source-map).
+	 */
+	devtool?: string | false;
+
+	/**
+	 * The entry point(s) of the compilation.
+	 */
+	entry: EntryNormalized;
+
+	/**
+	 * Enables/Disables experiments (experimental features with relax SemVer compatibility).
+	 */
+	experiments: ExperimentsNormalized;
+
+	/**
+	 * Specify dependencies that shouldn't be resolved by webpack, but should become dependencies of the resulting bundle. The kind of the dependency depends on `output.libraryTarget`.
+	 */
+	externals: Externals;
+
+	/**
+	 * Enable presets of externals for specific targets.
+	 */
+	externalsPresets: ExternalsPresets;
+
+	/**
+	 * Specifies the default type of externals ('amd*', 'umd*', 'system' and 'jsonp' depend on output.libraryTarget set to the same value).
+	 */
+	externalsType?:
+		| "import"
+		| "var"
+		| "module"
+		| "assign"
+		| "this"
+		| "window"
+		| "self"
+		| "global"
+		| "commonjs"
+		| "commonjs2"
+		| "commonjs-module"
+		| "commonjs-static"
+		| "amd"
+		| "amd-require"
+		| "umd"
+		| "umd2"
+		| "jsonp"
+		| "system"
+		| "promise"
+		| "script"
+		| "node-commonjs";
+
+	/**
+	 * Ignore specific warnings.
+	 */
+	ignoreWarnings?: ((
+		warning: WebpackError,
+		compilation: Compilation
+	) => boolean)[];
+
+	/**
+	 * Options for infrastructure level logging.
+	 */
+	infrastructureLogging: InfrastructureLogging;
+
+	/**
+	 * Custom values available in the loader context.
+	 */
+	loader?: Loader;
+
+	/**
+	 * Enable production optimizations or development hints.
+	 */
+	mode?: "none" | "development" | "production";
+
+	/**
+	 * Options affecting the normal modules (`NormalModuleFactory`).
+	 */
+	module: ModuleOptionsNormalized;
+
+	/**
+	 * Name of the configuration. Used when loading multiple configurations.
+	 */
+	name?: string;
+
+	/**
+	 * Include polyfills or mocks for various node stuff.
+	 */
+	node: NodeWebpackOptions;
+
+	/**
+	 * Enables/Disables integrated optimizations.
+	 */
+	optimization: Optimization;
+
+	/**
+	 * Normalized options affecting the output of the compilation. `output` options tell webpack how to write the compiled files to disk.
+	 */
+	output: OutputNormalized;
+
+	/**
+	 * The number of parallel processed modules in the compilation.
+	 */
+	parallelism?: number;
+
+	/**
+	 * Configuration for web performance recommendations.
+	 */
+	performance?: false | PerformanceOptions;
+
+	/**
+	 * Add additional plugins to the compiler.
+	 */
+	plugins: (
+		| ((this: Compiler, compiler: Compiler) => void)
+		| WebpackPluginInstance
+	)[];
+
+	/**
+	 * Capture timing information for each module.
+	 */
+	profile?: boolean;
+
+	/**
+	 * Store compiler state to a json file.
+	 */
+	recordsInputPath?: string | false;
+
+	/**
+	 * Load compiler state from a json file.
+	 */
+	recordsOutputPath?: string | false;
+
+	/**
+	 * Options for the resolver.
+	 */
+	resolve: ResolveOptionsWebpackOptions;
+
+	/**
+	 * Options for the resolver when resolving loaders.
+	 */
+	resolveLoader: ResolveOptionsWebpackOptions;
+
+	/**
+	 * Options affecting how file system snapshots are created and validated.
+	 */
+	snapshot: SnapshotOptions;
+
+	/**
+	 * Stats options object or preset name.
+	 */
+	stats: StatsValue;
+
+	/**
+	 * Environment to build for. An array of environments to build for all of them when possible.
+	 */
+	target?: string | false | string[];
+
+	/**
+	 * Enter watch mode, which rebuilds on file change.
+	 */
+	watch?: boolean;
+
+	/**
+	 * Options for the watcher.
+	 */
+	watchOptions: WatchOptions;
+}
+
+/**
+ * Plugin instance.
+ */
+declare interface WebpackPluginInstance {
+	[index: string]: any;
+
+	/**
+	 * The run point of the plugin, required method.
+	 */
+	apply: (compiler: Compiler) => void;
+}
+declare interface WithId {
+	id: string | number;
+}
+declare interface WithOptions {
+	/**
+	 * create a resolver with additional/different options
+	 */
+	withOptions: (
+		arg0: Partial<ResolveOptionsWithDependencyType>
+	) => ResolverWithOptions;
+}
+declare interface WriteOnlySet<T> {
+	add: (T?: any) => void;
+}
+type __TypeWebpackOptions = (data: object) =>
+	| string
+	| {
+			/**
+			 * Unique loader options identifier.
+			 */
+			ident?: string;
+			/**
+			 * Loader name.
+			 */
+			loader?: string;
+			/**
+			 * Loader options.
+			 */
+			options?: string | { [index: string]: any };
+	  }
+	| __TypeWebpackOptions
+	| RuleSetUseItem[];
+declare function exports(
+	options: Configuration,
+	callback?: CallbackWebpack<Stats>
+): Compiler;
+declare function exports(
+	options: ReadonlyArray<Configuration> & MultiCompilerOptions,
+	callback?: CallbackWebpack<MultiStats>
+): MultiCompiler;
+declare namespace exports {
+	export const webpack: {
+		(options: Configuration, callback?: CallbackWebpack<Stats>): Compiler;
+		(
+			options: ReadonlyArray<Configuration> & MultiCompilerOptions,
+			callback?: CallbackWebpack<MultiStats>
+		): MultiCompiler;
+	};
+	export const validate: (options?: any) => void;
+	export const validateSchema: (
+		schema: Parameters<typeof validateFunction>[0],
+		options: Parameters<typeof validateFunction>[1],
+		validationConfiguration?: ValidationErrorConfiguration
+	) => void;
+	export const version: string;
+	export namespace cli {
+		export let getArguments: (schema?: any) => Record<string, Argument>;
+		export let processArguments: (
+			args: Record<string, Argument>,
+			config: any,
+			values: Record<
+				string,
+				| string
+				| number
+				| boolean
+				| RegExp
+				| (string | number | boolean | RegExp)[]
+			>
+		) => null | Problem[];
+	}
+	export namespace ModuleFilenameHelpers {
+		export let ALL_LOADERS_RESOURCE: string;
+		export let REGEXP_ALL_LOADERS_RESOURCE: RegExp;
+		export let LOADERS_RESOURCE: string;
+		export let REGEXP_LOADERS_RESOURCE: RegExp;
+		export let RESOURCE: string;
+		export let REGEXP_RESOURCE: RegExp;
+		export let ABSOLUTE_RESOURCE_PATH: string;
+		export let REGEXP_ABSOLUTE_RESOURCE_PATH: RegExp;
+		export let RESOURCE_PATH: string;
+		export let REGEXP_RESOURCE_PATH: RegExp;
+		export let ALL_LOADERS: string;
+		export let REGEXP_ALL_LOADERS: RegExp;
+		export let LOADERS: string;
+		export let REGEXP_LOADERS: RegExp;
+		export let QUERY: string;
+		export let REGEXP_QUERY: RegExp;
+		export let ID: string;
+		export let REGEXP_ID: RegExp;
+		export let HASH: string;
+		export let REGEXP_HASH: RegExp;
+		export let NAMESPACE: string;
+		export let REGEXP_NAMESPACE: RegExp;
+		export let createFilename: (
+			module: string | Module,
+			options: any,
+			__2: {
+				/**
+				 * requestShortener
+				 */
+				requestShortener: RequestShortener;
+				/**
+				 * chunk graph
+				 */
+				chunkGraph: ChunkGraph;
+				/**
+				 * the hash function to use
+				 */
+				hashFunction: string | typeof Hash;
+			}
+		) => string;
+		export let replaceDuplicates: (
+			array?: any,
+			fn?: any,
+			comparator?: any
+		) => any;
+		export let matchPart: (str?: any, test?: any) => any;
+		export let matchObject: (obj?: any, str?: any) => boolean;
+	}
+	export namespace RuntimeGlobals {
+		export let require: string;
+		export let requireScope: string;
+		export let exports: string;
+		export let thisAsExports: string;
+		export let returnExportsFromRuntime: string;
+		export let module: string;
+		export let moduleId: string;
+		export let moduleLoaded: string;
+		export let publicPath: string;
+		export let entryModuleId: string;
+		export let moduleCache: string;
+		export let moduleFactories: string;
+		export let moduleFactoriesAddOnly: string;
+		export let ensureChunk: string;
+		export let ensureChunkHandlers: string;
+		export let ensureChunkIncludeEntries: string;
+		export let prefetchChunk: string;
+		export let prefetchChunkHandlers: string;
+		export let preloadChunk: string;
+		export let preloadChunkHandlers: string;
+		export let definePropertyGetters: string;
+		export let makeNamespaceObject: string;
+		export let createFakeNamespaceObject: string;
+		export let compatGetDefaultExport: string;
+		export let harmonyModuleDecorator: string;
+		export let nodeModuleDecorator: string;
+		export let getFullHash: string;
+		export let wasmInstances: string;
+		export let instantiateWasm: string;
+		export let uncaughtErrorHandler: string;
+		export let scriptNonce: string;
+		export let loadScript: string;
+		export let createScript: string;
+		export let createScriptUrl: string;
+		export let getTrustedTypesPolicy: string;
+		export let chunkName: string;
+		export let runtimeId: string;
+		export let getChunkScriptFilename: string;
+		export let getChunkCssFilename: string;
+		export let hasCssModules: string;
+		export let getChunkUpdateScriptFilename: string;
+		export let getChunkUpdateCssFilename: string;
+		export let startup: string;
+		export let startupNoDefault: string;
+		export let startupOnlyAfter: string;
+		export let startupOnlyBefore: string;
+		export let chunkCallback: string;
+		export let startupEntrypoint: string;
+		export let onChunksLoaded: string;
+		export let externalInstallChunk: string;
+		export let interceptModuleExecution: string;
+		export let global: string;
+		export let shareScopeMap: string;
+		export let initializeSharing: string;
+		export let currentRemoteGetScope: string;
+		export let getUpdateManifestFilename: string;
+		export let hmrDownloadManifest: string;
+		export let hmrDownloadUpdateHandlers: string;
+		export let hmrModuleData: string;
+		export let hmrInvalidateModuleHandlers: string;
+		export let hmrRuntimeStatePrefix: string;
+		export let amdDefine: string;
+		export let amdOptions: string;
+		export let system: string;
+		export let hasOwnProperty: string;
+		export let systemContext: string;
+		export let baseURI: string;
+		export let relativeUrl: string;
+		export let asyncModule: string;
+	}
+	export const UsageState: Readonly<{
+		Unused: 0;
+		OnlyPropertiesUsed: 1;
+		NoInfo: 2;
+		Unknown: 3;
+		Used: 4;
+	}>;
+	export namespace cache {
+		export { MemoryCachePlugin };
+	}
+	export namespace config {
+		export const getNormalizedWebpackOptions: (
+			config: Configuration
+		) => WebpackOptionsNormalized;
+		export const applyWebpackOptionsDefaults: (
+			options: WebpackOptionsNormalized
+		) => void;
+	}
+	export namespace dependencies {
+		export { ModuleDependency, ConstDependency, NullDependency };
+	}
+	export namespace ids {
+		export {
+			ChunkModuleIdRangePlugin,
+			NaturalModuleIdsPlugin,
+			OccurrenceModuleIdsPlugin,
+			NamedModuleIdsPlugin,
+			DeterministicChunkIdsPlugin,
+			DeterministicModuleIdsPlugin,
+			NamedChunkIdsPlugin,
+			OccurrenceChunkIdsPlugin,
+			HashedModuleIdsPlugin
+		};
+	}
+	export namespace javascript {
+		export {
+			EnableChunkLoadingPlugin,
+			JavascriptModulesPlugin,
+			JavascriptParser
+		};
+	}
+	export namespace optimize {
+		export namespace InnerGraph {
+			export let bailout: (parserState: ParserState) => void;
+			export let enable: (parserState: ParserState) => void;
+			export let isEnabled: (parserState: ParserState) => boolean;
+			export let addUsage: (
+				state: ParserState,
+				symbol: null | TopLevelSymbol,
+				usage: string | true | TopLevelSymbol
+			) => void;
+			export let addVariableUsage: (
+				parser: JavascriptParser,
+				name: string,
+				usage: string | true | TopLevelSymbol
+			) => void;
+			export let inferDependencyUsage: (state: ParserState) => void;
+			export let onUsage: (
+				state: ParserState,
+				onUsageCallback: (arg0?: boolean | Set<string>) => void
+			) => void;
+			export let setTopLevelSymbol: (
+				state: ParserState,
+				symbol: TopLevelSymbol
+			) => void;
+			export let getTopLevelSymbol: (
+				state: ParserState
+			) => void | TopLevelSymbol;
+			export let tagTopLevelSymbol: (
+				parser: JavascriptParser,
+				name: string
+			) => TopLevelSymbol;
+			export let isDependencyUsedByExports: (
+				dependency: Dependency,
+				usedByExports: boolean | Set<string>,
+				moduleGraph: ModuleGraph,
+				runtime: RuntimeSpec
+			) => boolean;
+			export let getDependencyUsedByExportsCondition: (
+				dependency: Dependency,
+				usedByExports: boolean | Set<string>,
+				moduleGraph: ModuleGraph
+			) =>
+				| null
+				| false
+				| ((arg0: ModuleGraphConnection, arg1: RuntimeSpec) => ConnectionState);
+			export { TopLevelSymbol, topLevelSymbolTag };
+		}
+		export {
+			AggressiveMergingPlugin,
+			AggressiveSplittingPlugin,
+			LimitChunkCountPlugin,
+			MinChunkSizePlugin,
+			ModuleConcatenationPlugin,
+			RealContentHashPlugin,
+			RuntimeChunkPlugin,
+			SideEffectsFlagPlugin,
+			SplitChunksPlugin
+		};
+	}
+	export namespace runtime {
+		export { GetChunkFilenameRuntimeModule, LoadScriptRuntimeModule };
+	}
+	export namespace prefetch {
+		export { ChunkPrefetchPreloadPlugin };
+	}
+	export namespace web {
+		export {
+			FetchCompileAsyncWasmPlugin,
+			FetchCompileWasmPlugin,
+			JsonpChunkLoadingRuntimeModule,
+			JsonpTemplatePlugin
+		};
+	}
+	export namespace webworker {
+		export { WebWorkerTemplatePlugin };
+	}
+	export namespace node {
+		export {
+			NodeEnvironmentPlugin,
+			NodeSourcePlugin,
+			NodeTargetPlugin,
+			NodeTemplatePlugin,
+			ReadFileCompileWasmPlugin
+		};
+	}
+	export namespace electron {
+		export { ElectronTargetPlugin };
+	}
+	export namespace wasm {
+		export { AsyncWebAssemblyModulesPlugin };
+	}
+	export namespace library {
+		export { AbstractLibraryPlugin, EnableLibraryPlugin };
+	}
+	export namespace container {
+		export const scope: <T>(
+			scope: string,
+			options: ContainerOptionsFormat<T>
+		) => Record<string, string | string[] | T>;
+		export {
+			ContainerPlugin,
+			ContainerReferencePlugin,
+			ModuleFederationPlugin
+		};
+	}
+	export namespace sharing {
+		export const scope: <T>(
+			scope: string,
+			options: ContainerOptionsFormat<T>
+		) => Record<string, string | string[] | T>;
+		export { ConsumeSharedPlugin, ProvideSharedPlugin, SharePlugin };
+	}
+	export namespace debug {
+		export { ProfilingPlugin };
+	}
+	export namespace util {
+		export const createHash: (algorithm: string | typeof Hash) => Hash;
+		export namespace comparators {
+			export let compareChunksById: (a: Chunk, b: Chunk) => 0 | 1 | -1;
+			export let compareModulesByIdentifier: (
+				a: Module,
+				b: Module
+			) => 0 | 1 | -1;
+			export let compareModulesById: ParameterizedComparator<
+				ChunkGraph,
+				Module
+			>;
+			export let compareNumbers: (a: number, b: number) => 0 | 1 | -1;
+			export let compareStringsNumeric: (a: string, b: string) => 0 | 1 | -1;
+			export let compareModulesByPostOrderIndexOrIdentifier: ParameterizedComparator<
+				ModuleGraph,
+				Module
+			>;
+			export let compareModulesByPreOrderIndexOrIdentifier: ParameterizedComparator<
+				ModuleGraph,
+				Module
+			>;
+			export let compareModulesByIdOrIdentifier: ParameterizedComparator<
+				ChunkGraph,
+				Module
+			>;
+			export let compareChunks: ParameterizedComparator<ChunkGraph, Chunk>;
+			export let compareIds: (
+				a: string | number,
+				b: string | number
+			) => 0 | 1 | -1;
+			export let compareStrings: (a: string, b: string) => 0 | 1 | -1;
+			export let compareChunkGroupsByIndex: (
+				a: ChunkGroup,
+				b: ChunkGroup
+			) => 0 | 1 | -1;
+			export let concatComparators: <T>(
+				c1: Comparator<T>,
+				c2: Comparator<T>,
+				...cRest: Comparator<T>[]
+			) => Comparator<T>;
+			export let compareSelect: <T, R>(
+				getter: Selector<T, R>,
+				comparator: Comparator<R>
+			) => Comparator<T>;
+			export let compareIterables: <T>(
+				elementComparator: Comparator<T>
+			) => Comparator<Iterable<T>>;
+			export let keepOriginalOrder: <T>(iterable: Iterable<T>) => Comparator<T>;
+			export let compareChunksNatural: (
+				chunkGraph: ChunkGraph
+			) => Comparator<Chunk>;
+			export let compareLocations: (
+				a: DependencyLocation,
+				b: DependencyLocation
+			) => 0 | 1 | -1;
+		}
+		export namespace runtime {
+			export let getEntryRuntime: (
+				compilation: Compilation,
+				name: string,
+				options?: EntryOptions
+			) => RuntimeSpec;
+			export let forEachRuntime: (
+				runtime: RuntimeSpec,
+				fn: (arg0: string) => void,
+				deterministicOrder?: boolean
+			) => void;
+			export let getRuntimeKey: (runtime: RuntimeSpec) => string;
+			export let keyToRuntime: (key: string) => RuntimeSpec;
+			export let runtimeToString: (runtime: RuntimeSpec) => string;
+			export let runtimeConditionToString: (
+				runtimeCondition: RuntimeCondition
+			) => string;
+			export let runtimeEqual: (a: RuntimeSpec, b: RuntimeSpec) => boolean;
+			export let compareRuntime: (a: RuntimeSpec, b: RuntimeSpec) => 0 | 1 | -1;
+			export let mergeRuntime: (a: RuntimeSpec, b: RuntimeSpec) => RuntimeSpec;
+			export let mergeRuntimeCondition: (
+				a: RuntimeCondition,
+				b: RuntimeCondition,
+				runtime: RuntimeSpec
+			) => RuntimeCondition;
+			export let mergeRuntimeConditionNonFalse: (
+				a: undefined | string | true | SortableSet<string>,
+				b: undefined | string | true | SortableSet<string>,
+				runtime: RuntimeSpec
+			) => undefined | string | true | SortableSet<string>;
+			export let mergeRuntimeOwned: (
+				a: RuntimeSpec,
+				b: RuntimeSpec
+			) => RuntimeSpec;
+			export let intersectRuntime: (
+				a: RuntimeSpec,
+				b: RuntimeSpec
+			) => RuntimeSpec;
+			export let subtractRuntime: (
+				a: RuntimeSpec,
+				b: RuntimeSpec
+			) => RuntimeSpec;
+			export let subtractRuntimeCondition: (
+				a: RuntimeCondition,
+				b: RuntimeCondition,
+				runtime: RuntimeSpec
+			) => RuntimeCondition;
+			export let filterRuntime: (
+				runtime: RuntimeSpec,
+				filter: (arg0: RuntimeSpec) => boolean
+			) => undefined | string | boolean | SortableSet<string>;
+			export { RuntimeSpecMap, RuntimeSpecSet };
+		}
+		export namespace serialization {
+			export const register: (
+				Constructor: Constructor,
+				request: string,
+				name: string,
+				serializer: ObjectSerializer
+			) => void;
+			export const registerLoader: (
+				regExp: RegExp,
+				loader: (arg0: string) => boolean
+			) => void;
+			export const registerNotSerializable: (Constructor: Constructor) => void;
+			export const NOT_SERIALIZABLE: object;
+			export const buffersSerializer: Serializer;
+			export let createFileSerializer: (
+				fs?: any,
+				hashFunction?: any
+			) => Serializer;
+			export { MEASURE_START_OPERATION, MEASURE_END_OPERATION };
+		}
+		export const cleverMerge: <T, O>(first: T, second: O) => T | O | (T & O);
+		export { LazySet };
+	}
+	export namespace sources {
+		export {
+			Source,
+			RawSource,
+			OriginalSource,
+			ReplaceSource,
+			SourceMapSource,
+			ConcatSource,
+			PrefixSource,
+			CachedSource,
+			SizeOnlySource,
+			CompatSource
+		};
+	}
+	export namespace experiments {
+		export namespace schemes {
+			export { HttpUriPlugin };
+		}
+		export namespace ids {
+			export { SyncModuleIdsPlugin };
+		}
+	}
+	export type WebpackPluginFunction = (
+		this: Compiler,
+		compiler: Compiler
+	) => void;
+	export {
+		AutomaticPrefetchPlugin,
+		AsyncDependenciesBlock,
+		BannerPlugin,
+		Cache,
+		Chunk,
+		ChunkGraph,
+		CleanPlugin,
+		Compilation,
+		Compiler,
+		ConcatenationScope,
+		ContextExclusionPlugin,
+		ContextReplacementPlugin,
+		DefinePlugin,
+		DelegatedPlugin,
+		Dependency,
+		DllPlugin,
+		DllReferencePlugin,
+		DynamicEntryPlugin,
+		EntryOptionPlugin,
+		EntryPlugin,
+		EnvironmentPlugin,
+		EvalDevToolModulePlugin,
+		EvalSourceMapDevToolPlugin,
+		ExternalModule,
+		ExternalsPlugin,
+		Generator,
+		HotUpdateChunk,
+		HotModuleReplacementPlugin,
+		IgnorePlugin,
+		JavascriptModulesPlugin,
+		LibManifestPlugin,
+		LibraryTemplatePlugin,
+		LoaderOptionsPlugin,
+		LoaderTargetPlugin,
+		Module,
+		ModuleGraph,
+		ModuleGraphConnection,
+		NoEmitOnErrorsPlugin,
+		NormalModule,
+		NormalModuleReplacementPlugin,
+		MultiCompiler,
+		Parser,
+		PrefetchPlugin,
+		ProgressPlugin,
+		ProvidePlugin,
+		RuntimeModule,
+		EntryPlugin as SingleEntryPlugin,
+		SourceMapDevToolPlugin,
+		Stats,
+		Template,
+		WatchIgnorePlugin,
+		WebpackError,
+		WebpackOptionsApply,
+		WebpackOptionsDefaulter,
+		ValidationError as WebpackOptionsValidationError,
+		ValidationError,
+		Entry,
+		EntryNormalized,
+		EntryObject,
+		FileCacheOptions,
+		LibraryOptions,
+		ModuleOptions,
+		ResolveOptionsWebpackOptions as ResolveOptions,
+		RuleSetCondition,
+		RuleSetConditionAbsolute,
+		RuleSetRule,
+		RuleSetUse,
+		RuleSetUseItem,
+		StatsOptions,
+		Configuration,
+		WebpackOptionsNormalized,
+		WebpackPluginInstance,
+		Asset,
+		AssetInfo,
+		EntryOptions,
+		AssetEmittedInfo,
+		MultiStats,
+		ParserState,
+		ResolvePluginInstance,
+		Resolver,
+		Watching,
+		Argument,
+		Problem,
+		StatsAsset,
+		StatsChunk,
+		StatsChunkGroup,
+		StatsChunkOrigin,
+		StatsCompilation,
+		StatsError,
+		StatsLogging,
+		StatsLoggingEntry,
+		StatsModule,
+		StatsModuleIssuer,
+		StatsModuleReason,
+		StatsModuleTraceDependency,
+		StatsModuleTraceItem,
+		StatsProfile,
+		LoaderModule,
+		RawLoaderDefinition,
+		LoaderDefinition,
+		LoaderDefinitionFunction,
+		PitchLoaderDefinitionFunction,
+		RawLoaderDefinitionFunction,
+		LoaderContext
+	};
+}
+declare const topLevelSymbolTag: unique symbol;
+
+export = exports;
diff --git a/node_modules/mathjs/examples/node_modules/which/CHANGELOG.md b/node_modules/mathjs/examples/node_modules/which/CHANGELOG.md
new file mode 100644
index 0000000..7fb1f20
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/which/CHANGELOG.md
@@ -0,0 +1,166 @@
+# Changes
+
+
+## 2.0.2
+
+* Rename bin to `node-which`
+
+## 2.0.1
+
+* generate changelog and publish on version bump
+* enforce 100% test coverage
+* Promise interface
+
+## 2.0.0
+
+* Parallel tests, modern JavaScript, and drop support for node < 8
+
+## 1.3.1
+
+* update deps
+* update travis
+
+## v1.3.0
+
+* Add nothrow option to which.sync
+* update tap
+
+## v1.2.14
+
+* appveyor: drop node 5 and 0.x
+* travis-ci: add node 6, drop 0.x
+
+## v1.2.13
+
+* test: Pass missing option to pass on windows
+* update tap
+* update isexe to 2.0.0
+* neveragain.tech pledge request
+
+## v1.2.12
+
+* Removed unused require
+
+## v1.2.11
+
+* Prevent changelog script from being included in package
+
+## v1.2.10
+
+* Use env.PATH only, not env.Path
+
+## v1.2.9
+
+* fix for paths starting with ../
+* Remove unused `is-absolute` module
+
+## v1.2.8
+
+* bullet items in changelog that contain (but don't start with) #
+
+## v1.2.7
+
+* strip 'update changelog' changelog entries out of changelog
+
+## v1.2.6
+
+* make the changelog bulleted
+
+## v1.2.5
+
+* make a changelog, and keep it up to date
+* don't include tests in package
+* Properly handle relative-path executables
+* appveyor
+* Attach error code to Not Found error
+* Make tests pass on Windows
+
+## v1.2.4
+
+* Fix typo
+
+## v1.2.3
+
+* update isexe, fix regression in pathExt handling
+
+## v1.2.2
+
+* update deps, use isexe module, test windows
+
+## v1.2.1
+
+* Sometimes windows PATH entries are quoted
+* Fixed a bug in the check for group and user mode bits. This bug was introduced during refactoring for supporting strict mode.
+* doc cli
+
+## v1.2.0
+
+* Add support for opt.all and -as cli flags
+* test the bin
+* update travis
+* Allow checking for multiple programs in bin/which
+* tap 2
+
+## v1.1.2
+
+* travis
+* Refactored and fixed undefined error on Windows
+* Support strict mode
+
+## v1.1.1
+
+* test +g exes against secondary groups, if available
+* Use windows exe semantics on cygwin & msys
+* cwd should be first in path on win32, not last
+* Handle lower-case 'env.Path' on Windows
+* Update docs
+* use single-quotes
+
+## v1.1.0
+
+* Add tests, depend on is-absolute
+
+## v1.0.9
+
+* which.js: root is allowed to execute files owned by anyone
+
+## v1.0.8
+
+* don't use graceful-fs
+
+## v1.0.7
+
+* add license to package.json
+
+## v1.0.6
+
+* isc license
+
+## 1.0.5
+
+* Awful typo
+
+## 1.0.4
+
+* Test for path absoluteness properly
+* win: Allow '' as a pathext if cmd has a . in it
+
+## 1.0.3
+
+* Remove references to execPath
+* Make `which.sync()` work on Windows by honoring the PATHEXT variable.
+* Make `isExe()` always return true on Windows.
+* MIT
+
+## 1.0.2
+
+* Only files can be exes
+
+## 1.0.1
+
+* Respect the PATHEXT env for win32 support
+* should 0755 the bin
+* binary
+* guts
+* package
+* 1st
diff --git a/node_modules/mathjs/examples/node_modules/which/LICENSE b/node_modules/mathjs/examples/node_modules/which/LICENSE
new file mode 100644
index 0000000..19129e3
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/which/LICENSE
@@ -0,0 +1,15 @@
+The ISC License
+
+Copyright (c) Isaac Z. Schlueter and Contributors
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
+IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/which/README.md b/node_modules/mathjs/examples/node_modules/which/README.md
new file mode 100644
index 0000000..cd83350
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/which/README.md
@@ -0,0 +1,54 @@
+# which
+
+Like the unix `which` utility.
+
+Finds the first instance of a specified executable in the PATH
+environment variable.  Does not cache the results, so `hash -r` is not
+needed when the PATH changes.
+
+## USAGE
+
+```javascript
+var which = require('which')
+
+// async usage
+which('node', function (er, resolvedPath) {
+  // er is returned if no "node" is found on the PATH
+  // if it is found, then the absolute path to the exec is returned
+})
+
+// or promise
+which('node').then(resolvedPath => { ... }).catch(er => { ... not found ... })
+
+// sync usage
+// throws if not found
+var resolved = which.sync('node')
+
+// if nothrow option is used, returns null if not found
+resolved = which.sync('node', {nothrow: true})
+
+// Pass options to override the PATH and PATHEXT environment vars.
+which('node', { path: someOtherPath }, function (er, resolved) {
+  if (er)
+    throw er
+  console.log('found at %j', resolved)
+})
+```
+
+## CLI USAGE
+
+Same as the BSD `which(1)` binary.
+
+```
+usage: which [-as] program ...
+```
+
+## OPTIONS
+
+You may pass an options object as the second argument.
+
+- `path`: Use instead of the `PATH` environment variable.
+- `pathExt`: Use instead of the `PATHEXT` environment variable.
+- `all`: Return all matches, instead of just the first one.  Note that
+  this means the function returns an array of strings instead of a
+  single string.
diff --git a/node_modules/mathjs/examples/node_modules/which/bin/node-which b/node_modules/mathjs/examples/node_modules/which/bin/node-which
new file mode 100644
index 0000000..7cee372
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/which/bin/node-which
@@ -0,0 +1,52 @@
+#!/usr/bin/env node
+var which = require("../")
+if (process.argv.length < 3)
+  usage()
+
+function usage () {
+  console.error('usage: which [-as] program ...')
+  process.exit(1)
+}
+
+var all = false
+var silent = false
+var dashdash = false
+var args = process.argv.slice(2).filter(function (arg) {
+  if (dashdash || !/^-/.test(arg))
+    return true
+
+  if (arg === '--') {
+    dashdash = true
+    return false
+  }
+
+  var flags = arg.substr(1).split('')
+  for (var f = 0; f < flags.length; f++) {
+    var flag = flags[f]
+    switch (flag) {
+      case 's':
+        silent = true
+        break
+      case 'a':
+        all = true
+        break
+      default:
+        console.error('which: illegal option -- ' + flag)
+        usage()
+    }
+  }
+  return false
+})
+
+process.exit(args.reduce(function (pv, current) {
+  try {
+    var f = which.sync(current, { all: all })
+    if (all)
+      f = f.join('\n')
+    if (!silent)
+      console.log(f)
+    return pv;
+  } catch (e) {
+    return 1;
+  }
+}, 0))
diff --git a/node_modules/mathjs/examples/node_modules/which/package.json b/node_modules/mathjs/examples/node_modules/which/package.json
new file mode 100644
index 0000000..97ad7fb
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/which/package.json
@@ -0,0 +1,43 @@
+{
+  "author": "Isaac Z. Schlueter <i@izs.me> (http://blog.izs.me)",
+  "name": "which",
+  "description": "Like which(1) unix command. Find the first instance of an executable in the PATH.",
+  "version": "2.0.2",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/isaacs/node-which.git"
+  },
+  "main": "which.js",
+  "bin": {
+    "node-which": "./bin/node-which"
+  },
+  "license": "ISC",
+  "dependencies": {
+    "isexe": "^2.0.0"
+  },
+  "devDependencies": {
+    "mkdirp": "^0.5.0",
+    "rimraf": "^2.6.2",
+    "tap": "^14.6.9"
+  },
+  "scripts": {
+    "test": "tap",
+    "preversion": "npm test",
+    "postversion": "npm publish",
+    "prepublish": "npm run changelog",
+    "prechangelog": "bash gen-changelog.sh",
+    "changelog": "git add CHANGELOG.md",
+    "postchangelog": "git commit -m 'update changelog - '${npm_package_version}",
+    "postpublish": "git push origin --follow-tags"
+  },
+  "files": [
+    "which.js",
+    "bin/node-which"
+  ],
+  "tap": {
+    "check-coverage": true
+  },
+  "engines": {
+    "node": ">= 8"
+  }
+}
diff --git a/node_modules/mathjs/examples/node_modules/which/which.js b/node_modules/mathjs/examples/node_modules/which/which.js
new file mode 100644
index 0000000..82afffd
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/which/which.js
@@ -0,0 +1,125 @@
+const isWindows = process.platform === 'win32' ||
+    process.env.OSTYPE === 'cygwin' ||
+    process.env.OSTYPE === 'msys'
+
+const path = require('path')
+const COLON = isWindows ? ';' : ':'
+const isexe = require('isexe')
+
+const getNotFoundError = (cmd) =>
+  Object.assign(new Error(`not found: ${cmd}`), { code: 'ENOENT' })
+
+const getPathInfo = (cmd, opt) => {
+  const colon = opt.colon || COLON
+
+  // If it has a slash, then we don't bother searching the pathenv.
+  // just check the file itself, and that's it.
+  const pathEnv = cmd.match(/\//) || isWindows && cmd.match(/\\/) ? ['']
+    : (
+      [
+        // windows always checks the cwd first
+        ...(isWindows ? [process.cwd()] : []),
+        ...(opt.path || process.env.PATH ||
+          /* istanbul ignore next: very unusual */ '').split(colon),
+      ]
+    )
+  const pathExtExe = isWindows
+    ? opt.pathExt || process.env.PATHEXT || '.EXE;.CMD;.BAT;.COM'
+    : ''
+  const pathExt = isWindows ? pathExtExe.split(colon) : ['']
+
+  if (isWindows) {
+    if (cmd.indexOf('.') !== -1 && pathExt[0] !== '')
+      pathExt.unshift('')
+  }
+
+  return {
+    pathEnv,
+    pathExt,
+    pathExtExe,
+  }
+}
+
+const which = (cmd, opt, cb) => {
+  if (typeof opt === 'function') {
+    cb = opt
+    opt = {}
+  }
+  if (!opt)
+    opt = {}
+
+  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)
+  const found = []
+
+  const step = i => new Promise((resolve, reject) => {
+    if (i === pathEnv.length)
+      return opt.all && found.length ? resolve(found)
+        : reject(getNotFoundError(cmd))
+
+    const ppRaw = pathEnv[i]
+    const pathPart = /^".*"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw
+
+    const pCmd = path.join(pathPart, cmd)
+    const p = !pathPart && /^\.[\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd
+      : pCmd
+
+    resolve(subStep(p, i, 0))
+  })
+
+  const subStep = (p, i, ii) => new Promise((resolve, reject) => {
+    if (ii === pathExt.length)
+      return resolve(step(i + 1))
+    const ext = pathExt[ii]
+    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {
+      if (!er && is) {
+        if (opt.all)
+          found.push(p + ext)
+        else
+          return resolve(p + ext)
+      }
+      return resolve(subStep(p, i, ii + 1))
+    })
+  })
+
+  return cb ? step(0).then(res => cb(null, res), cb) : step(0)
+}
+
+const whichSync = (cmd, opt) => {
+  opt = opt || {}
+
+  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)
+  const found = []
+
+  for (let i = 0; i < pathEnv.length; i ++) {
+    const ppRaw = pathEnv[i]
+    const pathPart = /^".*"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw
+
+    const pCmd = path.join(pathPart, cmd)
+    const p = !pathPart && /^\.[\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd
+      : pCmd
+
+    for (let j = 0; j < pathExt.length; j ++) {
+      const cur = p + pathExt[j]
+      try {
+        const is = isexe.sync(cur, { pathExt: pathExtExe })
+        if (is) {
+          if (opt.all)
+            found.push(cur)
+          else
+            return cur
+        }
+      } catch (ex) {}
+    }
+  }
+
+  if (opt.all && found.length)
+    return found
+
+  if (opt.nothrow)
+    return null
+
+  throw getNotFoundError(cmd)
+}
+
+module.exports = which
+which.sync = whichSync
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/.travis.yml b/node_modules/mathjs/examples/node_modules/wildcard/.travis.yml
new file mode 100644
index 0000000..3bacc9f
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/.travis.yml
@@ -0,0 +1,9 @@
+language: node_js
+node_js:
+  - 10
+  - 11
+  - 12
+
+notifications:
+  email:
+    - damon.oehlman@gmail.com
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/README.md b/node_modules/mathjs/examples/node_modules/wildcard/README.md
new file mode 100644
index 0000000..c622bd7
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/README.md
@@ -0,0 +1,99 @@
+
+# wildcard
+
+Very simple wildcard matching, which is designed to provide the same
+functionality that is found in the
+[eve](https://github.com/adobe-webplatform/eve) eventing library.
+
+
+[![NPM](https://nodei.co/npm/wildcard.png)](https://nodei.co/npm/wildcard/)
+
+[![Build Status](https://api.travis-ci.org/DamonOehlman/wildcard.svg?branch=master)](https://travis-ci.org/DamonOehlman/wildcard) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/dominictarr/stability#stable)
+
+## NOTE
+
+Work on this project is largely inactive, now so I'd recommend checking out
+the wonderful [`matcher`](https://github.com/sindresorhus/matcher) package
+as a solid alternative.
+
+## Usage
+
+It works with strings:
+
+```js
+var wildcard = require('wildcard');
+
+console.log(wildcard('foo.*', 'foo.bar'));
+// --> true
+
+console.log(wildcard('foo.*', 'foo'));
+// --> true
+
+```
+
+Arrays:
+
+```js
+var wildcard = require('wildcard');
+var testdata = [
+  'a.b.c',
+  'a.b',
+  'a',
+  'a.b.d'
+];
+
+console.log(wildcard('a.b.*', testdata));
+// --> ['a.b.c', 'a.b', 'a.b.d']
+
+```
+
+Objects (matching against keys):
+
+```js
+var wildcard = require('wildcard');
+var testdata = {
+  'a.b.c' : {},
+  'a.b'   : {},
+  'a'     : {},
+  'a.b.d' : {}
+};
+
+console.log(wildcard('a.*.c', testdata));
+// --> { 'a.b.c': {} }
+
+```
+
+## Alternative Implementations
+
+- <https://github.com/isaacs/node-glob>
+
+  Great for full file-based wildcard matching.
+
+- <https://github.com/sindresorhus/matcher>
+
+   A well cared for and loved JS wildcard matcher.
+
+## License(s)
+
+### MIT
+
+Copyright (c) 2017 Damon Oehlman <damon.oehlman@gmail.com>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/docs.json b/node_modules/mathjs/examples/node_modules/wildcard/docs.json
new file mode 100644
index 0000000..553270b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/docs.json
@@ -0,0 +1,9 @@
+{
+  "badges": {
+    "nodeico": true,
+    "travis": true,
+    "stability": "stable"
+  },
+
+  "license": {}
+}
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/examples/arrays.js b/node_modules/mathjs/examples/node_modules/wildcard/examples/arrays.js
new file mode 100644
index 0000000..4e3f86b
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/examples/arrays.js
@@ -0,0 +1,10 @@
+var wildcard = require('..');
+var testdata = [
+  'a.b.c',
+  'a.b',
+  'a',
+  'a.b.d'
+];
+
+console.log(wildcard('a.b.*', testdata));
+// --> ['a.b.c', 'a.b', 'a.b.d']
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/examples/objects.js b/node_modules/mathjs/examples/node_modules/wildcard/examples/objects.js
new file mode 100644
index 0000000..62c934d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/examples/objects.js
@@ -0,0 +1,10 @@
+var wildcard = require('..');
+var testdata = {
+  'a.b.c' : {},
+  'a.b'   : {},
+  'a'     : {},
+  'a.b.d' : {}
+};
+
+console.log(wildcard('a.*.c', testdata));
+// --> { 'a.b.c': {} }
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/examples/strings.js b/node_modules/mathjs/examples/node_modules/wildcard/examples/strings.js
new file mode 100644
index 0000000..31d7efe
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/examples/strings.js
@@ -0,0 +1,7 @@
+var wildcard = require('..');
+
+console.log(wildcard('foo.*', 'foo.bar'));
+// --> true
+
+console.log(wildcard('foo.*', 'foo'));
+// --> true
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/index.js b/node_modules/mathjs/examples/node_modules/wildcard/index.js
new file mode 100644
index 0000000..1d4257a
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/index.js
@@ -0,0 +1,114 @@
+/* jshint node: true */
+'use strict';
+
+var REGEXP_PARTS = /(\*|\?)/g;
+
+/**
+  # wildcard
+
+  Very simple wildcard matching, which is designed to provide the same
+  functionality that is found in the
+  [eve](https://github.com/adobe-webplatform/eve) eventing library.
+
+  ## Usage
+
+  It works with strings:
+
+  <<< examples/strings.js
+
+  Arrays:
+
+  <<< examples/arrays.js
+
+  Objects (matching against keys):
+
+  <<< examples/objects.js
+
+  ## Alternative Implementations
+
+  - <https://github.com/isaacs/node-glob>
+
+    Great for full file-based wildcard matching.
+
+  - <https://github.com/sindresorhus/matcher>
+
+     A well cared for and loved JS wildcard matcher.
+**/
+
+function WildcardMatcher(text, separator) {
+  this.text = text = text || '';
+  this.hasWild = text.indexOf('*') >= 0;
+  this.separator = separator;
+  this.parts = text.split(separator).map(this.classifyPart.bind(this));
+}
+
+WildcardMatcher.prototype.match = function(input) {
+  var matches = true;
+  var parts = this.parts;
+  var ii;
+  var partsCount = parts.length;
+  var testParts;
+
+  if (typeof input == 'string' || input instanceof String) {
+    if (!this.hasWild && this.text != input) {
+      matches = false;
+    } else {
+      testParts = (input || '').split(this.separator);
+      for (ii = 0; matches && ii < partsCount; ii++) {
+        if (parts[ii] === '*')  {
+          continue;
+        } else if (ii < testParts.length) {
+          matches = parts[ii] instanceof RegExp
+            ? parts[ii].test(testParts[ii])
+            : parts[ii] === testParts[ii];
+        } else {
+          matches = false;
+        }
+      }
+
+      // If matches, then return the component parts
+      matches = matches && testParts;
+    }
+  }
+  else if (typeof input.splice == 'function') {
+    matches = [];
+
+    for (ii = input.length; ii--; ) {
+      if (this.match(input[ii])) {
+        matches[matches.length] = input[ii];
+      }
+    }
+  }
+  else if (typeof input == 'object') {
+    matches = {};
+
+    for (var key in input) {
+      if (this.match(key)) {
+        matches[key] = input[key];
+      }
+    }
+  }
+
+  return matches;
+};
+
+WildcardMatcher.prototype.classifyPart = function(part) {
+  // in the event that we have been provided a part that is not just a wildcard
+  // then turn this into a regular expression for matching purposes
+  if (part === '*') {
+    return part;
+  } else if (part.indexOf('*') >= 0 || part.indexOf('?') >= 0) {
+    return new RegExp(part.replace(REGEXP_PARTS, '\.$1'));
+  }
+
+  return part;
+};
+
+module.exports = function(text, test, separator) {
+  var matcher = new WildcardMatcher(text, separator || /[\/\.]/);
+  if (typeof test != 'undefined') {
+    return matcher.match(test);
+  }
+
+  return matcher;
+};
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/package.json b/node_modules/mathjs/examples/node_modules/wildcard/package.json
new file mode 100644
index 0000000..0f51a4d
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/package.json
@@ -0,0 +1,53 @@
+{
+  "name": "wildcard",
+  "description": "Wildcard matching tools",
+  "author": "Damon Oehlman <damon.oehlman@gmail.com>",
+  "keywords": [
+    "string",
+    "wildcard"
+  ],
+  "version": "2.0.0",
+  "dependencies": {},
+  "devDependencies": {
+    "tape": "^4.6.3"
+  },
+  "testling": {
+    "files": "test/all.js",
+    "browsers": {
+      "ie": [
+        "latest"
+      ],
+      "ff": [
+        "latest",
+        "nightly"
+      ],
+      "chrome": [
+        "latest",
+        "canary"
+      ],
+      "opera": [
+        "latest",
+        "next"
+      ],
+      "safari": [
+        "latest"
+      ]
+    }
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/DamonOehlman/wildcard.git"
+  },
+  "bugs": {
+    "url": "http://github.com/DamonOehlman/wildcard/issues"
+  },
+  "scripts": {
+    "test": "node test/all.js",
+    "gendocs": "gendocs > README.md"
+  },
+  "main": "index.js",
+  "directories": {
+    "test": "test"
+  },
+  "license": "MIT"
+}
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/test/all.js b/node_modules/mathjs/examples/node_modules/wildcard/test/all.js
new file mode 100644
index 0000000..e42b836
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/test/all.js
@@ -0,0 +1,3 @@
+require('./arrays');
+require('./objects');
+require('./strings');
\ No newline at end of file
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/test/arrays.js b/node_modules/mathjs/examples/node_modules/wildcard/test/arrays.js
new file mode 100644
index 0000000..5dfec95
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/test/arrays.js
@@ -0,0 +1,33 @@
+var test = require('tape'),
+    wildcard = require('../'),
+    testdata = [
+        'a.b.c',
+        'a.b',
+        'a',
+        'a.b.d'
+    ],
+    testdataSep = [
+        'a:b:c',
+        'a:b',
+        'a',
+        'a:b:d'
+    ];
+
+test('array result matching tests', function(t) {
+    t.plan(5);
+
+    t.equal(wildcard('*', testdata).length, 4, '* matches all testdata');
+    t.equal(wildcard('a.*', testdata).length, 4, '4 matches found');
+    t.equal(wildcard('a.b.*', testdata).length, 3, '3 matches found');
+    t.equal(wildcard('a.*.c', testdata).length, 1);
+    t.equal(wildcard('b.*.d', testdata).length, 0);
+});
+
+test('array result with separator matching tests', function(t) {
+    t.plan(4);
+
+    t.equal(wildcard('a:*', testdataSep, ':').length, 4, '4 matches found');
+    t.equal(wildcard('a:b:*', testdataSep, ':').length, 3, '3 matches found');
+    t.equal(wildcard('a:*:c', testdataSep, ':').length, 1);
+    t.equal(wildcard('b:*:d', testdataSep, ':').length, 0);
+});
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/test/objects.js b/node_modules/mathjs/examples/node_modules/wildcard/test/objects.js
new file mode 100644
index 0000000..2f509dc
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/test/objects.js
@@ -0,0 +1,106 @@
+var wildcard = require('../'),
+    test = require('tape'),
+    testdata = {
+        'a.b.c' : {},
+        'a.b'   : {},
+        'a'     : {},
+        'a.b.d' : {}
+    },
+    testdataSep = {
+        'a:b:c' : {},
+        'a:b'   : {},
+        'a'     : {},
+        'a:b:d' : {}
+    };
+
+test('object result matching tests', function(t) {
+    t.test('should return 4 matches for a.*', function(t) {
+        var matches = wildcard('a.*', testdata);
+
+        t.plan(4);
+        t.ok(matches['a.b.c']);
+        t.ok(matches['a.b']);
+        t.ok(matches['a']);
+        t.ok(matches['a.b.d']);
+        t.end();
+    });
+
+    t.test('should return 4 matches for a:*', function(t) {
+        var matches = wildcard('a:*', testdataSep, ':');
+
+        t.plan(4);
+        t.ok(matches['a:b:c']);
+        t.ok(matches['a:b']);
+        t.ok(matches['a']);
+        t.ok(matches['a:b:d']);
+        t.end();
+    });
+
+    t.test('should return 3 matches for a.b.*', function(t) {
+        var matches = wildcard('a.b.*', testdata);
+
+        t.plan(4);
+        t.ok(matches['a.b.c']);
+        t.ok(matches['a.b']);
+        t.notOk(matches['a']);
+        t.ok(matches['a.b.d']);
+        t.end();
+    });
+
+    t.test('should return 3 matches for a:b:*', function(t) {
+        var matches = wildcard('a:b:*', testdataSep, ':');
+
+        t.plan(4);
+        t.ok(matches['a:b:c']);
+        t.ok(matches['a:b']);
+        t.notOk(matches['a']);
+        t.ok(matches['a:b:d']);
+        t.end();
+    });
+
+    t.test('should return 1 matches for a.*.c', function(t) {
+        var matches = wildcard('a.*.c', testdata);
+
+        t.plan(4);
+        t.ok(matches['a.b.c']);
+        t.notOk(matches['a.b']);
+        t.notOk(matches['a']);
+        t.notOk(matches['a.b.d']);
+        t.end();
+    });
+
+    t.test('should return 1 matches for a:*:c', function(t) {
+        var matches = wildcard('a:*:c', testdataSep, ':');
+
+        t.plan(4);
+        t.ok(matches['a:b:c']);
+        t.notOk(matches['a:b']);
+        t.notOk(matches['a']);
+        t.notOk(matches['a:b:d']);
+        t.end();
+    });
+
+    t.test('should return 0 matches for b.*.d', function(t) {
+        var matches = wildcard('b.*.d', testdata);
+
+        t.plan(4);
+        t.notOk(matches['a.b.c']);
+        t.notOk(matches['a.b']);
+        t.notOk(matches['a']);
+        t.notOk(matches['a.b.d']);
+        t.end();
+    });
+
+    t.test('should return 0 matches for b:*:d', function(t) {
+        var matches = wildcard('b:*:d', testdataSep, ':');
+
+        t.plan(4);
+        t.notOk(matches['a:b:c']);
+        t.notOk(matches['a:b']);
+        t.notOk(matches['a']);
+        t.notOk(matches['a:b:d']);
+        t.end();
+    });
+
+    t.end();
+});
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/test/strings.js b/node_modules/mathjs/examples/node_modules/wildcard/test/strings.js
new file mode 100644
index 0000000..2afc966
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/test/strings.js
@@ -0,0 +1,46 @@
+var test = require('tape'),
+    wildcard = require('../');
+
+test('general wild card matching tests', function(t) {
+
+    t.plan(8);
+    t.ok(wildcard('*', 'test'), '* should match test');
+    t.ok(wildcard('foo.*', 'foo.bar'), 'foo.* should match foo.bar');
+    t.ok(wildcard('foo.*', 'foo'), 'foo.* should match foo');
+    t.ok(wildcard('*.foo.com', 'test.foo.com'), 'test.foo.com should match *.foo.com');
+    t.notOk(wildcard('foo.*', 'bar'), 'foo.* should not match bar');
+    t.ok(wildcard('a.*.c', 'a.b.c'), 'a.*.c should match a.b.c');
+    t.notOk(wildcard('a.*.c', 'a.b'), 'a.*.c should not match a.b');
+    t.notOk(wildcard('a', 'a.b.c'), 'a should not match a.b.c');
+});
+
+test('regex wildcard matching tests', function(t) {
+  t.plan(4);
+  t.ok(wildcard('*foo', 'foo'), '*foo should match foo');
+  t.ok(wildcard('*foo.b', 'foo.b'), '*foo.b should match foo.b');
+  t.ok(wildcard('a.*foo.c', 'a.barfoo.c'), 'a.barfoo.c should match a.*foo.c');
+  t.ok(wildcard('a.foo*.c', 'a.foobar.c'), 'a.foobar.c should match a.foo*.c');
+});
+
+test('general wild card with separator matching tests', function(t) {
+
+    t.plan(5);
+    t.ok(wildcard('foo:*', 'foo:bar', ':'), 'foo:* should match foo:bar');
+    t.ok(wildcard('foo:*', 'foo', ':'), 'foo:* should match foo');
+    t.notOk(wildcard('foo:*', 'bar', ':'), 'foo:* should not match bar');
+    t.ok(wildcard('a:*:c', 'a:b:c', ':'), 'a:*:c should match a:b:c');
+    t.notOk(wildcard('a:*:c', 'a:b', ':'), 'a:*:c should not match a:b');
+});
+
+test('general wild card with tokens being returned', function(t) {
+
+    t.plan(5);
+    var parts = wildcard('foo.*', 'foo.bar');
+    t.ok(parts);
+    t.equal(parts.length, 2);
+    t.equal(parts[0], 'foo');
+    t.equal(parts[1], 'bar');
+
+    parts = wildcard('foo.*', 'not.matching');
+    t.notOk(parts);
+});
diff --git a/node_modules/mathjs/examples/node_modules/wildcard/yarn.lock b/node_modules/mathjs/examples/node_modules/wildcard/yarn.lock
new file mode 100644
index 0000000..0a2b222
--- /dev/null
+++ b/node_modules/mathjs/examples/node_modules/wildcard/yarn.lock
@@ -0,0 +1,228 @@
+# THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY.
+# yarn lockfile v1
+
+
+balanced-match@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/balanced-match/-/balanced-match-1.0.0.tgz#89b4d199ab2bee49de164ea02b89ce462d71b767"
+  integrity sha1-ibTRmasr7kneFk6gK4nORi1xt2c=
+
+brace-expansion@^1.1.7:
+  version "1.1.11"
+  resolved "https://registry.yarnpkg.com/brace-expansion/-/brace-expansion-1.1.11.tgz#3c7fcbf529d87226f3d2f52b966ff5271eb441dd"
+  integrity sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==
+  dependencies:
+    balanced-match "^1.0.0"
+    concat-map "0.0.1"
+
+concat-map@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/concat-map/-/concat-map-0.0.1.tgz#d8a96bd77fd68df7793a73036a3ba0d5405d477b"
+  integrity sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=
+
+deep-equal@~1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-1.0.1.tgz#f5d260292b660e084eff4cdbc9f08ad3247448b5"
+  integrity sha1-9dJgKStmDghO/0zbyfCK0yR0SLU=
+
+define-properties@^1.1.2:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/define-properties/-/define-properties-1.1.3.tgz#cf88da6cbee26fe6db7094f61d870cbd84cee9f1"
+  integrity sha512-3MqfYKj2lLzdMSf8ZIZE/V+Zuy+BgD6f164e8K2w7dgnpKArBDerGYpM46IYYcjnkdPNMjPk9A6VFB8+3SKlXQ==
+  dependencies:
+    object-keys "^1.0.12"
+
+defined@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/defined/-/defined-1.0.0.tgz#c98d9bcef75674188e110969151199e39b1fa693"
+  integrity sha1-yY2bzvdWdBiOEQlpFRGZ45sfppM=
+
+es-abstract@^1.5.0:
+  version "1.13.0"
+  resolved "https://registry.yarnpkg.com/es-abstract/-/es-abstract-1.13.0.tgz#ac86145fdd5099d8dd49558ccba2eaf9b88e24e9"
+  integrity sha512-vDZfg/ykNxQVwup/8E1BZhVzFfBxs9NqMzGcvIJrqg5k2/5Za2bWo40dK2J1pgLngZ7c+Shh8lwYtLGyrwPutg==
+  dependencies:
+    es-to-primitive "^1.2.0"
+    function-bind "^1.1.1"
+    has "^1.0.3"
+    is-callable "^1.1.4"
+    is-regex "^1.0.4"
+    object-keys "^1.0.12"
+
+es-to-primitive@^1.2.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/es-to-primitive/-/es-to-primitive-1.2.0.tgz#edf72478033456e8dda8ef09e00ad9650707f377"
+  integrity sha512-qZryBOJjV//LaxLTV6UC//WewneB3LcXOL9NP++ozKVXsIIIpm/2c13UDiD9Jp2eThsecw9m3jPqDwTyobcdbg==
+  dependencies:
+    is-callable "^1.1.4"
+    is-date-object "^1.0.1"
+    is-symbol "^1.0.2"
+
+for-each@~0.3.3:
+  version "0.3.3"
+  resolved "https://registry.yarnpkg.com/for-each/-/for-each-0.3.3.tgz#69b447e88a0a5d32c3e7084f3f1710034b21376e"
+  integrity sha512-jqYfLp7mo9vIyQf8ykW2v7A+2N4QjeCeI5+Dz9XraiO1ign81wjiH7Fb9vSOWvQfNtmSa4H2RoQTrrXivdUZmw==
+  dependencies:
+    is-callable "^1.1.3"
+
+fs.realpath@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/fs.realpath/-/fs.realpath-1.0.0.tgz#1504ad2523158caa40db4a2787cb01411994ea4f"
+  integrity sha1-FQStJSMVjKpA20onh8sBQRmU6k8=
+
+function-bind@^1.0.2, function-bind@^1.1.1, function-bind@~1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/function-bind/-/function-bind-1.1.1.tgz#a56899d3ea3c9bab874bb9773b7c5ede92f4895d"
+  integrity sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A==
+
+glob@~7.1.4:
+  version "7.1.4"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-7.1.4.tgz#aa608a2f6c577ad357e1ae5a5c26d9a8d1969255"
+  integrity sha512-hkLPepehmnKk41pUGm3sYxoFs/umurYfYJCerbXEyFIWcAzvpipAgVkBqqT9RBKMGjnq6kMuyYwha6csxbiM1A==
+  dependencies:
+    fs.realpath "^1.0.0"
+    inflight "^1.0.4"
+    inherits "2"
+    minimatch "^3.0.4"
+    once "^1.3.0"
+    path-is-absolute "^1.0.0"
+
+has-symbols@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/has-symbols/-/has-symbols-1.0.0.tgz#ba1a8f1af2a0fc39650f5c850367704122063b44"
+  integrity sha1-uhqPGvKg/DllD1yFA2dwQSIGO0Q=
+
+has@^1.0.1, has@^1.0.3, has@~1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/has/-/has-1.0.3.tgz#722d7cbfc1f6aa8241f16dd814e011e1f41e8796"
+  integrity sha512-f2dvO0VU6Oej7RkWJGrehjbzMAjFp5/VKPp5tTpWIV4JHHZK1/BxbFRtf/siA2SWTe09caDmVtYYzWEIbBS4zw==
+  dependencies:
+    function-bind "^1.1.1"
+
+inflight@^1.0.4:
+  version "1.0.6"
+  resolved "https://registry.yarnpkg.com/inflight/-/inflight-1.0.6.tgz#49bd6331d7d02d0c09bc910a1075ba8165b56df9"
+  integrity sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=
+  dependencies:
+    once "^1.3.0"
+    wrappy "1"
+
+inherits@2, inherits@~2.0.3:
+  version "2.0.4"
+  resolved "https://registry.yarnpkg.com/inherits/-/inherits-2.0.4.tgz#0fa2c64f932917c3433a0ded55363aae37416b7c"
+  integrity sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==
+
+is-callable@^1.1.3, is-callable@^1.1.4:
+  version "1.1.4"
+  resolved "https://registry.yarnpkg.com/is-callable/-/is-callable-1.1.4.tgz#1e1adf219e1eeb684d691f9d6a05ff0d30a24d75"
+  integrity sha512-r5p9sxJjYnArLjObpjA4xu5EKI3CuKHkJXMhT7kwbpUyIFD1n5PMAsoPvWnvtZiNz7LjkYDRZhd7FlI0eMijEA==
+
+is-date-object@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/is-date-object/-/is-date-object-1.0.1.tgz#9aa20eb6aeebbff77fbd33e74ca01b33581d3a16"
+  integrity sha1-mqIOtq7rv/d/vTPnTKAbM1gdOhY=
+
+is-regex@^1.0.4:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/is-regex/-/is-regex-1.0.4.tgz#5517489b547091b0930e095654ced25ee97e9491"
+  integrity sha1-VRdIm1RwkbCTDglWVM7SXul+lJE=
+  dependencies:
+    has "^1.0.1"
+
+is-symbol@^1.0.2:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/is-symbol/-/is-symbol-1.0.2.tgz#a055f6ae57192caee329e7a860118b497a950f38"
+  integrity sha512-HS8bZ9ox60yCJLH9snBpIwv9pYUAkcuLhSA1oero1UB5y9aiQpRA8y2ex945AOtCZL1lJDeIk3G5LthswI46Lw==
+  dependencies:
+    has-symbols "^1.0.0"
+
+minimatch@^3.0.4:
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-3.0.4.tgz#5166e286457f03306064be5497e8dbb0c3d32083"
+  integrity sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==
+  dependencies:
+    brace-expansion "^1.1.7"
+
+minimist@~1.2.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-1.2.0.tgz#a35008b20f41383eec1fb914f4cd5df79a264284"
+  integrity sha1-o1AIsg9BOD7sH7kU9M1d95omQoQ=
+
+object-inspect@~1.6.0:
+  version "1.6.0"
+  resolved "https://registry.yarnpkg.com/object-inspect/-/object-inspect-1.6.0.tgz#c70b6cbf72f274aab4c34c0c82f5167bf82cf15b"
+  integrity sha512-GJzfBZ6DgDAmnuaM3104jR4s1Myxr3Y3zfIyN4z3UdqN69oSRacNK8UhnobDdC+7J2AHCjGwxQubNJfE70SXXQ==
+
+object-keys@^1.0.12:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/object-keys/-/object-keys-1.1.1.tgz#1c47f272df277f3b1daf061677d9c82e2322c60e"
+  integrity sha512-NuAESUOUMrlIXOfHKzD6bpPu3tYt3xvjNdRIQ+FeT0lNb4K8WR70CaDxhuNguS2XG+GjkyMwOzsN5ZktImfhLA==
+
+once@^1.3.0:
+  version "1.4.0"
+  resolved "https://registry.yarnpkg.com/once/-/once-1.4.0.tgz#583b1aa775961d4b113ac17d9c50baef9dd76bd1"
+  integrity sha1-WDsap3WWHUsROsF9nFC6753Xa9E=
+  dependencies:
+    wrappy "1"
+
+path-is-absolute@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/path-is-absolute/-/path-is-absolute-1.0.1.tgz#174b9268735534ffbc7ace6bf53a5a9e1b5c5f5f"
+  integrity sha1-F0uSaHNVNP+8es5r9TpanhtcX18=
+
+path-parse@^1.0.6:
+  version "1.0.6"
+  resolved "https://registry.yarnpkg.com/path-parse/-/path-parse-1.0.6.tgz#d62dbb5679405d72c4737ec58600e9ddcf06d24c"
+  integrity sha512-GSmOT2EbHrINBf9SR7CDELwlJ8AENk3Qn7OikK4nFYAu3Ote2+JYNVvkpAEQm3/TLNEJFD/xZJjzyxg3KBWOzw==
+
+resolve@~1.10.1:
+  version "1.10.1"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.10.1.tgz#664842ac960795bbe758221cdccda61fb64b5f18"
+  integrity sha512-KuIe4mf++td/eFb6wkaPbMDnP6kObCaEtIDuHOUED6MNUo4K670KZUHuuvYPZDxNF0WVLw49n06M2m2dXphEzA==
+  dependencies:
+    path-parse "^1.0.6"
+
+resumer@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/resumer/-/resumer-0.0.0.tgz#f1e8f461e4064ba39e82af3cdc2a8c893d076759"
+  integrity sha1-8ej0YeQGS6Oegq883CqMiT0HZ1k=
+  dependencies:
+    through "~2.3.4"
+
+string.prototype.trim@~1.1.2:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/string.prototype.trim/-/string.prototype.trim-1.1.2.tgz#d04de2c89e137f4d7d206f086b5ed2fae6be8cea"
+  integrity sha1-0E3iyJ4Tf019IG8Ia17S+ua+jOo=
+  dependencies:
+    define-properties "^1.1.2"
+    es-abstract "^1.5.0"
+    function-bind "^1.0.2"
+
+tape@^4.6.3:
+  version "4.10.2"
+  resolved "https://registry.yarnpkg.com/tape/-/tape-4.10.2.tgz#129fcf62f86df92687036a52cce7b8ddcaffd7a6"
+  integrity sha512-mgl23h7W2yuk3N85FOYrin2OvThTYWdwbk6XQ1pr2PMJieyW2FM/4Bu/+kD/wecb3aZ0Enm+Syinyq467OPq2w==
+  dependencies:
+    deep-equal "~1.0.1"
+    defined "~1.0.0"
+    for-each "~0.3.3"
+    function-bind "~1.1.1"
+    glob "~7.1.4"
+    has "~1.0.3"
+    inherits "~2.0.3"
+    minimist "~1.2.0"
+    object-inspect "~1.6.0"
+    resolve "~1.10.1"
+    resumer "~0.0.0"
+    string.prototype.trim "~1.1.2"
+    through "~2.3.8"
+
+through@~2.3.4, through@~2.3.8:
+  version "2.3.8"
+  resolved "https://registry.yarnpkg.com/through/-/through-2.3.8.tgz#0dd4c9ffaabc357960b1b724115d7e0e86a2e1f5"
+  integrity sha1-DdTJ/6q8NXlgsbckEV1+Doai4fU=
+
+wrappy@1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/wrappy/-/wrappy-1.0.2.tgz#b5243d8f3ec1aa35f1364605bc0d1036e30ab69f"
+  integrity sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=
diff --git a/node_modules/mathjs/examples/objects.js b/node_modules/mathjs/examples/objects.js
new file mode 100644
index 0000000..5140ac2
--- /dev/null
+++ b/node_modules/mathjs/examples/objects.js
@@ -0,0 +1,35 @@
+// objects
+
+// load math.js (using node.js)
+const { evaluate, format } = require('..')
+
+// create an object. Keys can be symbols or strings
+print(evaluate('{x: 2 + 1, y: 4}')) // {"x": 3, "y": 4}
+print(evaluate('{"name": "John"}')) // {"name": "John"}
+
+// create an object containing an object
+print(evaluate('{a: 2, b: {c: 3, d: 4}}')) // {"a": 2, "b": {"c": 3, "d": 4}}
+
+const scope = {
+  obj: {
+    prop: 42
+  }
+}
+
+// retrieve properties using dot notation or bracket notation
+print(evaluate('obj.prop', scope)) // 42
+print(evaluate('obj["prop"]', scope)) // 42
+
+// set properties (returns the whole object, not the property value!)
+print(evaluate('obj.prop = 43', scope)) // 43
+print(evaluate('obj["prop"] = 43', scope)) // 43
+print(scope.obj) // {"prop": 43}
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  const precision = 14
+  console.log(format(value, precision))
+}
diff --git a/node_modules/mathjs/examples/package.json b/node_modules/mathjs/examples/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/examples/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/examples/serialization.js b/node_modules/mathjs/examples/serialization.js
new file mode 100644
index 0000000..a7a52bb
--- /dev/null
+++ b/node_modules/mathjs/examples/serialization.js
@@ -0,0 +1,16 @@
+// load math.js (using node.js)
+const { complex, replacer, reviver, typeOf } = require('..')
+
+// serialize a math.js data type into a JSON string
+// the replacer function is needed to correctly stringify a value like Infinity
+const x = complex('2+3i')
+const str1 = JSON.stringify(x, replacer)
+console.log(str1)
+// outputs {"mathjs":"Complex","re":2,"im":3}
+
+// deserialize a JSON string into a math.js data type
+// note that the reviver of math.js is needed for this:
+const str2 = '{"mathjs":"Unit","value":5,"unit":"cm"}'
+const y = JSON.parse(str2, reviver)
+console.log(typeOf(y)) // 'Unit'
+console.log(y.toString()) // 5 cm
diff --git a/node_modules/mathjs/examples/sparse_matrices.js b/node_modules/mathjs/examples/sparse_matrices.js
new file mode 100644
index 0000000..4eecb78
--- /dev/null
+++ b/node_modules/mathjs/examples/sparse_matrices.js
@@ -0,0 +1,19 @@
+// load math.js (using node.js)
+const { identity, multiply, transpose, complex } = require('..')
+
+// create a sparse matrix
+console.log('creating a 1000x1000 sparse matrix...')
+const a = identity(1000, 1000, 'sparse')
+
+// do operations with a sparse matrix
+console.log('doing some operations on the sparse matrix...')
+const b = multiply(a, a)
+const c = multiply(b, complex(2, 2))
+const d = transpose(c)
+const e = multiply(d, a)
+console.log('size(e)=', e.size())
+
+// we will not print the output, but doing the same operations
+// with a dense matrix are very slow, try it for yourself.
+console.log('already done')
+console.log('now try this with a dense matrix :)')
diff --git a/node_modules/mathjs/examples/units.js b/node_modules/mathjs/examples/units.js
new file mode 100644
index 0000000..99756b0
--- /dev/null
+++ b/node_modules/mathjs/examples/units.js
@@ -0,0 +1,108 @@
+// units
+
+// load math.js (using node.js)
+const math = require('..')
+
+// units can be created by providing a value and unit name, or by providing
+// a string with a valued unit.
+console.log('create units')
+const a = math.unit(45, 'cm')
+const b = math.unit('0.1m')
+print(a) // 45 cm
+print(b) // 0.1 m
+console.log()
+
+// units can be added, subtracted, and multiplied or divided by numbers and by other units
+console.log('perform operations')
+print(math.add(a, b)) // 55 cm
+print(math.multiply(b, 2)) // 0.2 m
+print(math.divide(math.unit('1 m'), math.unit('1 s'))) // 1 m / s
+print(math.pow(math.unit('12 in'), 3)) // 1728 in^3
+console.log()
+
+// units can be converted to a specific type, or to a number
+console.log('convert to another type or to a number')
+print(b.to('cm')) // 10 cm  Alternatively: math.to(b, 'cm')
+print(math.to(b, 'inch')) // 3.9370078740157 inch
+print(b.toNumber('cm')) // 10
+print(math.number(b, 'cm')) // 10
+console.log()
+
+// the expression parser supports units too
+console.log('parse expressions')
+print(math.evaluate('2 inch to cm')) // 5.08 cm
+print(math.evaluate('cos(45 deg)')) // 0.70710678118655
+print(math.evaluate('90 km/h to m/s')) // 25 m / s
+console.log()
+
+// convert a unit to a number
+// A second parameter with the unit for the exported number must be provided
+print(math.evaluate('number(5 cm, mm)')) // number, 50
+console.log()
+
+// simplify units
+console.log('simplify units')
+print(math.evaluate('100000 N / m^2')) // 100 kPa
+print(math.evaluate('9.81 m/s^2 * 100 kg * 40 m')) // 39.24 kJ
+console.log()
+
+// example engineering calculations
+console.log('compute molar volume of ideal gas at 65 Fahrenheit, 14.7 psi in L/mol')
+const Rg = math.unit('8.314 N m / (mol K)')
+const T = math.unit('65 degF')
+const P = math.unit('14.7 psi')
+const v = math.divide(math.multiply(Rg, T), P)
+console.log('gas constant (Rg) = ', format(Rg))
+console.log('P = ' + format(P))
+console.log('T = ' + format(T))
+console.log('v = Rg * T / P = ' + format(math.to(v, 'L/mol')))
+// 23.910432393453 L / mol
+console.log()
+
+console.log('compute speed of fluid flowing out of hole in a container')
+const g = math.unit('9.81 m / s^2')
+const h = math.unit('1 m')
+const v2 = math.pow(math.multiply(2, math.multiply(g, h)), 0.5) // Can also use math.sqrt
+console.log('g = ' + format(g))
+console.log('h = ' + format(h))
+console.log('v = (2 g h) ^ 0.5 = ' + format(v2))
+// 4.42944691807 m / s
+console.log()
+
+console.log('electrical power consumption:')
+const expr1 = '460 V * 20 A * 30 days to kWh'
+console.log(expr1 + ' = ' + math.evaluate(expr1)) // 6624 kWh
+console.log()
+
+console.log('circuit design:')
+const expr2 = '24 V / (6 mA)'
+console.log(expr2 + ' = ' + math.evaluate(expr2)) // 4 kohm
+console.log()
+
+console.log('operations on arrays:')
+const B = math.evaluate('[1, 0, 0] T')
+const v3 = math.evaluate('[0, 1, 0] m/s')
+const q = math.evaluate('1 C')
+const F = math.multiply(q, math.cross(v3, B))
+console.log('B (magnetic field strength) = ' + format(B)) // [1 T, 0 T, 0 T]
+console.log('v (particle velocity) = ' + format(v3)) // [0 m / s, 1 m / s, 0 m / s]
+console.log('q (particle charge) = ' + format(q)) // 1 C
+console.log('F (force) = q (v cross B) = ' + format(F)) // [0 N, 0 N, -1 N]
+
+/**
+ * Helper function to output a value in the console. Value will be formatted.
+ * @param {*} value
+ */
+function print (value) {
+  console.log(format(value))
+}
+
+/**
+ * Helper function to format an output a value.
+ * @param {*} value
+ * @return {string} Returns the formatted value
+ */
+function format (value) {
+  const precision = 14
+  return math.format(value, precision)
+}
diff --git a/node_modules/mathjs/lib/browser/math.js b/node_modules/mathjs/lib/browser/math.js
new file mode 100644
index 0000000..3d8c236
--- /dev/null
+++ b/node_modules/mathjs/lib/browser/math.js
@@ -0,0 +1,41 @@
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * @version 10.4.3
+ * @date    2022-04-08
+ *
+ * @license
+ * Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License"); you may not
+ * use this file except in compliance with the License. You may obtain a copy
+ * of the License at
+ *
+ * https://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
+ * License for the specific language governing permissions and limitations under
+ * the License.
+ */
+!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?exports.math=t():e.math=t()}(this,(function(){return function(e){var t={};function r(n){if(t[n])return t[n].exports;var i=t[n]={i:n,l:!1,exports:{}};return e[n].call(i.exports,i,i.exports,r),i.l=!0,i.exports}return r.m=e,r.c=t,r.d=function(e,t,n){r.o(e,t)||Object.defineProperty(e,t,{enumerable:!0,get:n})},r.r=function(e){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},r.t=function(e,t){if(1&t&&(e=r(e)),8&t)return e;if(4&t&&"object"==typeof e&&e&&e.__esModule)return e;var n=Object.create(null);if(r.r(n),Object.defineProperty(n,"default",{enumerable:!0,value:e}),2&t&&"string"!=typeof e)for(var i in e)r.d(n,i,function(t){return e[t]}.bind(null,i));return n},r.n=function(e){var t=e&&e.__esModule?function(){return e.default}:function(){return e};return r.d(t,"a",t),t},r.o=function(e,t){return Object.prototype.hasOwnProperty.call(e,t)},r.p="",r(r.s=254)}([function(e,t,r){var n=r(110),i=r(36),a=r(192);n||i(Object.prototype,"toString",a,{unsafe:!0})},function(e,t,r){(function(t){var r=function(e){return e&&e.Math==Math&&e};e.exports=r("object"==typeof globalThis&&globalThis)||r("object"==typeof window&&window)||r("object"==typeof self&&self)||r("object"==typeof t&&t)||function(){return this}()||Function("return this")()}).call(this,r(188))},,function(e,t){function r(t){return e.exports=r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&"function"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?"symbol":typeof e},e.exports.__esModule=!0,e.exports.default=e.exports,r(t)}e.exports=r,e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){"use strict";var n=r(6),i=r(81).map;n({target:"Array",proto:!0,forced:!r(82)("map")},{map:function(e){return i(this,e,arguments.length>1?arguments[1]:void 0)}})},function(e,t,r){var n=r(1),i=r(144),a=r(145),o=r(193),s=r(53),u=function(e){if(e&&e.forEach!==o)try{s(e,"forEach",o)}catch(t){e.forEach=o}};for(var c in i)i[c]&&u(n[c]&&n[c].prototype);u(a)},function(e,t,r){var n=r(1),i=r(58).f,a=r(53),o=r(36),s=r(107),u=r(140),c=r(80);e.exports=function(e,t){var r,f,l,p,m,h=e.target,d=e.global,v=e.stat;if(r=d?n:v?n[h]||s(h,{}):(n[h]||{}).prototype)for(f in t){if(p=t[f],l=e.noTargetGet?(m=i(r,f))&&m.value:r[f],!c(d?f:h+(v?".":"#")+f,e.forced)&&void 0!==l){if(typeof p==typeof l)continue;u(p,l)}(e.sham||l&&l.sham)&&a(p,"sham",!0),o(r,f,p,e)}}},function(e,t,r){"use strict";var n=r(9),i=r(78).PROPER,a=r(36),o=r(21),s=r(52),u=r(34),c=r(8),f=r(116),l=RegExp.prototype,p=l.toString,m=n(f),h=c((function(){return"/a/b"!=p.call({source:"a",flags:"b"})})),d=i&&"toString"!=p.name;(h||d)&&a(RegExp.prototype,"toString",(function(){var e=o(this),t=u(e.source),r=e.flags;return"/"+t+"/"+u(void 0===r&&s(l,e)&&!("flags"in l)?m(e):r)}),{unsafe:!0})},function(e,t){e.exports=function(e){try{return!!e()}catch(e){return!0}}},function(e,t,r){var n=r(86),i=Function.prototype,a=i.bind,o=i.call,s=n&&a.bind(o,o);e.exports=n?function(e){return e&&s(e)}:function(e){return e&&function(){return o.apply(e,arguments)}}},function(e,t,r){"use strict";var n=r(6),i=r(100);n({target:"RegExp",proto:!0,forced:/./.exec!==i},{exec:i})},function(e,t,r){"use strict";var n,i,a,o,s=r(6),u=r(67),c=r(1),f=r(49),l=r(22),p=r(224),m=r(36),h=r(174),d=r(115),v=r(85),y=r(117),g=r(66),x=r(15),b=r(23),w=r(128),N=r(93),M=r(126),E=r(129),S=r(155),A=r(177).set,O=r(226),C=r(229),_=r(230),T=r(179),I=r(231),k=r(232),z=r(44),q=r(80),R=r(16),B=r(233),D=r(130),j=r(76),P=R("species"),F="Promise",U=z.getterFor(F),L=z.set,$=z.getterFor(F),H=p&&p.prototype,G=p,V=H,Z=c.TypeError,W=c.document,Y=c.process,J=T.f,X=J,Q=!!(W&&W.createEvent&&c.dispatchEvent),K=x(c.PromiseRejectionEvent),ee=!1,te=q(F,(function(){var e=N(G),t=e!==String(G);if(!t&&66===j)return!0;if(u&&!V.finally)return!0;if(j>=51&&/native code/.test(e))return!1;var r=new G((function(e){e(1)})),n=function(e){e((function(){}),(function(){}))};return(r.constructor={})[P]=n,!(ee=r.then((function(){}))instanceof n)||!t&&B&&!K})),re=te||!E((function(e){G.all(e).catch((function(){}))})),ne=function(e){var t;return!(!b(e)||!x(t=e.then))&&t},ie=function(e,t){var r,n,i,a=t.value,o=1==t.state,s=o?e.ok:e.fail,u=e.resolve,c=e.reject,f=e.domain;try{s?(o||(2===t.rejection&&ce(t),t.rejection=1),!0===s?r=a:(f&&f.enter(),r=s(a),f&&(f.exit(),i=!0)),r===e.promise?c(Z("Promise-chain cycle")):(n=ne(r))?l(n,r,u,c):u(r)):c(a)}catch(e){f&&!i&&f.exit(),c(e)}},ae=function(e,t){e.notified||(e.notified=!0,O((function(){for(var r,n=e.reactions;r=n.get();)ie(r,e);e.notified=!1,t&&!e.rejection&&se(e)})))},oe=function(e,t,r){var n,i;Q?((n=W.createEvent("Event")).promise=t,n.reason=r,n.initEvent(e,!1,!0),c.dispatchEvent(n)):n={promise:t,reason:r},!K&&(i=c["on"+e])?i(n):"unhandledrejection"===e&&_("Unhandled promise rejection",r)},se=function(e){l(A,c,(function(){var t,r=e.facade,n=e.value;if(ue(e)&&(t=I((function(){D?Y.emit("unhandledRejection",n,r):oe("unhandledrejection",r,n)})),e.rejection=D||ue(e)?2:1,t.error))throw t.value}))},ue=function(e){return 1!==e.rejection&&!e.parent},ce=function(e){l(A,c,(function(){var t=e.facade;D?Y.emit("rejectionHandled",t):oe("rejectionhandled",t,e.value)}))},fe=function(e,t,r){return function(n){e(t,n,r)}},le=function(e,t,r){e.done||(e.done=!0,r&&(e=r),e.value=t,e.state=2,ae(e,!0))},pe=function(e,t,r){if(!e.done){e.done=!0,r&&(e=r);try{if(e.facade===t)throw Z("Promise can't be resolved itself");var n=ne(t);n?O((function(){var r={done:!1};try{l(n,t,fe(pe,r,e),fe(le,r,e))}catch(t){le(r,t,e)}})):(e.value=t,e.state=1,ae(e,!1))}catch(t){le({done:!1},t,e)}}};if(te&&(V=(G=function(e){w(this,V),g(e),l(n,this);var t=U(this);try{e(fe(pe,t),fe(le,t))}catch(e){le(t,e)}}).prototype,(n=function(e){L(this,{type:F,done:!1,notified:!1,parent:!1,reactions:new k,rejection:!1,state:0,value:void 0})}).prototype=h(V,{then:function(e,t){var r=$(this),n=J(S(this,G));return r.parent=!0,n.ok=!x(e)||e,n.fail=x(t)&&t,n.domain=D?Y.domain:void 0,0==r.state?r.reactions.add(n):O((function(){ie(n,r)})),n.promise},catch:function(e){return this.then(void 0,e)}}),i=function(){var e=new n,t=U(e);this.promise=e,this.resolve=fe(pe,t),this.reject=fe(le,t)},T.f=J=function(e){return e===G||e===a?new i(e):X(e)},!u&&x(p)&&H!==Object.prototype)){o=H.then,ee||(m(H,"then",(function(e,t){var r=this;return new G((function(e,t){l(o,r,e,t)})).then(e,t)}),{unsafe:!0}),m(H,"catch",V.catch,{unsafe:!0}));try{delete H.constructor}catch(e){}d&&d(H,V)}s({global:!0,wrap:!0,forced:te},{Promise:G}),v(G,F,!1,!0),y(F),a=f(F),s({target:F,stat:!0,forced:te},{reject:function(e){var t=J(this);return l(t.reject,void 0,e),t.promise}}),s({target:F,stat:!0,forced:u||te},{resolve:function(e){return C(u&&this===a?G:this,e)}}),s({target:F,stat:!0,forced:re},{all:function(e){var t=this,r=J(t),n=r.resolve,i=r.reject,a=I((function(){var r=g(t.resolve),a=[],o=0,s=1;M(e,(function(e){var u=o++,c=!1;s++,l(r,t,e).then((function(e){c||(c=!0,a[u]=e,--s||n(a))}),i)})),--s||n(a)}));return a.error&&i(a.value),r.promise},race:function(e){var t=this,r=J(t),n=r.reject,i=I((function(){var i=g(t.resolve);M(e,(function(e){l(i,t,e).then(r.resolve,n)}))}));return i.error&&n(i.value),r.promise}})},function(e,t,r){var n=r(18),i=r(78).EXISTS,a=r(9),o=r(20).f,s=Function.prototype,u=a(s.toString),c=/function\b(?:\s|\/\*[\S\s]*?\*\/|\/\/[^\n\r]*[\n\r]+)*([^\s(/]*)/,f=a(c.exec);n&&!i&&o(s,"name",{configurable:!0,get:function(){try{return f(c,u(this))[1]}catch(e){return""}}})},function(e,t,r){"use strict";var n=r(6),i=r(22);n({target:"URL",proto:!0,enumerable:!0},{toJSON:function(){return i(URL.prototype.toString,this)}})},function(e,t,r){"use strict";var n=r(6),i=r(9),a=r(104),o=r(40),s=r(112),u=i([].join),c=a!=Object,f=s("join",",");n({target:"Array",proto:!0,forced:c||!f},{join:function(e){return u(o(this),void 0===e?",":e)}})},function(e,t){e.exports=function(e){return"function"==typeof e}},function(e,t,r){var n=r(1),i=r(90),a=r(26),o=r(91),s=r(105),u=r(137),c=i("wks"),f=n.Symbol,l=f&&f.for,p=u?f:f&&f.withoutSetter||o;e.exports=function(e){if(!a(c,e)||!s&&"string"!=typeof c[e]){var t="Symbol."+e;s&&a(f,e)?c[e]=f[e]:c[e]=u&&l?l(t):p(t)}return c[e]}},function(e,t,r){"use strict";var n=r(6),i=r(1),a=r(97),o=r(98),s=r(23),u=r(79),c=r(45),f=r(40),l=r(71),p=r(16),m=r(82),h=r(123),d=m("slice"),v=p("species"),y=i.Array,g=Math.max;n({target:"Array",proto:!0,forced:!d},{slice:function(e,t){var r,n,i,p=f(this),m=c(p),d=u(e,m),x=u(void 0===t?m:t,m);if(a(p)&&(r=p.constructor,(o(r)&&(r===y||a(r.prototype))||s(r)&&null===(r=r[v]))&&(r=void 0),r===y||void 0===r))return h(p,d,x);for(n=new(void 0===r?y:r)(g(x-d,0)),i=0;d<x;d++,i++)d in p&&l(n,i,p[d]);return n.length=i,n}})},function(e,t,r){var n=r(8);e.exports=!n((function(){return 7!=Object.defineProperty({},1,{get:function(){return 7}})[1]}))},function(e,t,r){"use strict";var n=r(6),i=r(1),a=r(8),o=r(97),s=r(23),u=r(35),c=r(45),f=r(71),l=r(111),p=r(82),m=r(16),h=r(76),d=m("isConcatSpreadable"),v=i.TypeError,y=h>=51||!a((function(){var e=[];return e[d]=!1,e.concat()[0]!==e})),g=p("concat"),x=function(e){if(!s(e))return!1;var t=e[d];return void 0!==t?!!t:o(e)};n({target:"Array",proto:!0,forced:!y||!g},{concat:function(e){var t,r,n,i,a,o=u(this),s=l(o,0),p=0;for(t=-1,n=arguments.length;t<n;t++)if(x(a=-1===t?o:arguments[t])){if(p+(i=c(a))>9007199254740991)throw v("Maximum allowed index exceeded");for(r=0;r<i;r++,p++)r in a&&f(s,p,a[r])}else{if(p>=9007199254740991)throw v("Maximum allowed index exceeded");f(s,p++,a)}return s.length=p,s}})},function(e,t,r){var n=r(1),i=r(18),a=r(138),o=r(139),s=r(21),u=r(87),c=n.TypeError,f=Object.defineProperty,l=Object.getOwnPropertyDescriptor;t.f=i?o?function(e,t,r){if(s(e),t=u(t),s(r),"function"==typeof e&&"prototype"===t&&"value"in r&&"writable"in r&&!r.writable){var n=l(e,t);n&&n.writable&&(e[t]=r.value,r={configurable:"configurable"in r?r.configurable:n.configurable,enumerable:"enumerable"in r?r.enumerable:n.enumerable,writable:!1})}return f(e,t,r)}:f:function(e,t,r){if(s(e),t=u(t),s(r),a)try{return f(e,t,r)}catch(e){}if("get"in r||"set"in r)throw c("Accessors not supported");return"value"in r&&(e[t]=r.value),e}},function(e,t,r){var n=r(1),i=r(23),a=n.String,o=n.TypeError;e.exports=function(e){if(i(e))return e;throw o(a(e)+" is not an object")}},function(e,t,r){var n=r(86),i=Function.prototype.call;e.exports=n?i.bind(i):function(){return i.apply(i,arguments)}},function(e,t,r){var n=r(15);e.exports=function(e){return"object"==typeof e?null!==e:n(e)}},function(e,t,r){"use strict";var n=r(6),i=r(81).find,a=r(124),o=!0;"find"in[]&&Array(1).find((function(){o=!1})),n({target:"Array",proto:!0,forced:o},{find:function(e){return i(this,e,arguments.length>1?arguments[1]:void 0)}}),a("find")},function(e,t,r){var n=r(240),i=r(241),a=r(181),o=r(242);e.exports=function(e){return n(e)||i(e)||a(e)||o()},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){var n=r(9),i=r(35),a=n({}.hasOwnProperty);e.exports=Object.hasOwn||function(e,t){return a(i(e),t)}},function(e,t,r){"use strict";var n=r(40),i=r(124),a=r(84),o=r(44),s=r(20).f,u=r(125),c=r(67),f=r(18),l=o.set,p=o.getterFor("Array Iterator");e.exports=u(Array,"Array",(function(e,t){l(this,{type:"Array Iterator",target:n(e),index:0,kind:t})}),(function(){var e=p(this),t=e.target,r=e.kind,n=e.index++;return!t||n>=t.length?(e.target=void 0,{value:void 0,done:!0}):"keys"==r?{value:n,done:!1}:"values"==r?{value:t[n],done:!1}:{value:[n,t[n]],done:!1}}),"values");var m=a.Arguments=a.Array;if(i("keys"),i("values"),i("entries"),!c&&f&&"values"!==m.name)try{s(m,"name",{value:"values"})}catch(e){}},function(e,t,r){var n=r(6),i=r(35),a=r(109);n({target:"Object",stat:!0,forced:r(8)((function(){a(1)}))},{keys:function(e){return a(i(e))}})},function(e,t,r){"use strict";var n=r(6),i=r(1),a=r(79),o=r(60),s=r(45),u=r(35),c=r(111),f=r(71),l=r(82)("splice"),p=i.TypeError,m=Math.max,h=Math.min;n({target:"Array",proto:!0,forced:!l},{splice:function(e,t){var r,n,i,l,d,v,y=u(this),g=s(y),x=a(e,g),b=arguments.length;if(0===b?r=n=0:1===b?(r=0,n=g-x):(r=b-2,n=h(m(o(t),0),g-x)),g+r-n>9007199254740991)throw p("Maximum allowed length exceeded");for(i=c(y,n),l=0;l<n;l++)(d=x+l)in y&&f(i,l,y[d]);if(i.length=n,r<n){for(l=x;l<g-n;l++)v=l+r,(d=l+n)in y?y[v]=y[d]:delete y[v];for(l=g;l>g-n+r;l--)delete y[l-1]}else if(r>n)for(l=g-n;l>x;l--)v=l+r-1,(d=l+n-1)in y?y[v]=y[d]:delete y[v];for(l=0;l<r;l++)y[l+x]=arguments[l+2];return y.length=g-n+r,i}})},function(e,t,r){"use strict";var n=r(18),i=r(1),a=r(9),o=r(80),s=r(36),u=r(26),c=r(114),f=r(52),l=r(88),p=r(136),m=r(8),h=r(68).f,d=r(58).f,v=r(20).f,y=r(160),g=r(161).trim,x=i.Number,b=x.prototype,w=i.TypeError,N=a("".slice),M=a("".charCodeAt),E=function(e){var t=p(e,"number");return"bigint"==typeof t?t:S(t)},S=function(e){var t,r,n,i,a,o,s,u,c=p(e,"number");if(l(c))throw w("Cannot convert a Symbol value to a number");if("string"==typeof c&&c.length>2)if(c=g(c),43===(t=M(c,0))||45===t){if(88===(r=M(c,2))||120===r)return NaN}else if(48===t){switch(M(c,1)){case 66:case 98:n=2,i=49;break;case 79:case 111:n=8,i=55;break;default:return+c}for(o=(a=N(c,2)).length,s=0;s<o;s++)if((u=M(a,s))<48||u>i)return NaN;return parseInt(a,n)}return+c};if(o("Number",!x(" 0o1")||!x("0b1")||x("+0x1"))){for(var A,O=function(e){var t=arguments.length<1?0:x(E(e)),r=this;return f(b,r)&&m((function(){y(r)}))?c(Object(t),r,O):t},C=n?h(x):"MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,EPSILON,MAX_SAFE_INTEGER,MIN_SAFE_INTEGER,isFinite,isInteger,isNaN,isSafeInteger,parseFloat,parseInt,fromString,range".split(","),_=0;C.length>_;_++)u(x,A=C[_])&&!u(O,A)&&v(O,A,d(x,A));O.prototype=b,b.constructor=O,s(i,"Number",O)}},function(e,t,r){var n=r(1),i=r(144),a=r(145),o=r(27),s=r(53),u=r(16),c=u("iterator"),f=u("toStringTag"),l=o.values,p=function(e,t){if(e){if(e[c]!==l)try{s(e,c,l)}catch(t){e[c]=l}if(e[f]||s(e,f,t),i[t])for(var r in o)if(e[r]!==o[r])try{s(e,r,o[r])}catch(t){e[r]=o[r]}}};for(var m in i)p(n[m]&&n[m].prototype,m);p(a,"DOMTokenList")},function(e,t){function r(){return e.exports=r=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(e[n]=r[n])}return e},e.exports.__esModule=!0,e.exports.default=e.exports,r.apply(this,arguments)}e.exports=r,e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){var n;
+/**
+ * @license Complex.js v2.1.0 12/05/2020
+ *
+ * Copyright (c) 2020, Robert Eisele (robert@xarg.org)
+ * Dual licensed under the MIT or GPL Version 2 licenses.
+ **/!function(r){"use strict";var i=function(e){return.5*(Math.exp(e)+Math.exp(-e))},a=function(e){return.5*(Math.exp(e)-Math.exp(-e))},o=function(){throw SyntaxError("Invalid Param")};function s(e,t){var r=Math.abs(e),n=Math.abs(t);return 0===e?Math.log(n):0===t?Math.log(r):r<3e3&&n<3e3?.5*Math.log(e*e+t*t):(e/=2,t/=2,.5*Math.log(e*e+t*t)+Math.LN2)}function u(e,t){if(!(this instanceof u))return new u(e,t);var r=function(e,t){var r={re:0,im:0};if(null==e)r.re=r.im=0;else if(void 0!==t)r.re=e,r.im=t;else switch(typeof e){case"object":if("im"in e&&"re"in e)r.re=e.re,r.im=e.im;else if("abs"in e&&"arg"in e){if(!Number.isFinite(e.abs)&&Number.isFinite(e.arg))return u.INFINITY;r.re=e.abs*Math.cos(e.arg),r.im=e.abs*Math.sin(e.arg)}else if("r"in e&&"phi"in e){if(!Number.isFinite(e.r)&&Number.isFinite(e.phi))return u.INFINITY;r.re=e.r*Math.cos(e.phi),r.im=e.r*Math.sin(e.phi)}else 2===e.length?(r.re=e[0],r.im=e[1]):o();break;case"string":r.im=r.re=0;var n=e.match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g),i=1,a=0;null===n&&o();for(var s=0;s<n.length;s++){var c=n[s];" "===c||"\t"===c||"\n"===c||("+"===c?i++:"-"===c?a++:"i"===c||"I"===c?(i+a===0&&o()," "===n[s+1]||isNaN(n[s+1])?r.im+=parseFloat((a%2?"-":"")+"1"):(r.im+=parseFloat((a%2?"-":"")+n[s+1]),s++),i=a=0):((i+a===0||isNaN(c))&&o(),"i"===n[s+1]||"I"===n[s+1]?(r.im+=parseFloat((a%2?"-":"")+c),s++):r.re+=parseFloat((a%2?"-":"")+c),i=a=0))}i+a>0&&o();break;case"number":r.im=0,r.re=e;break;default:o()}return isNaN(r.re)||isNaN(r.im),r}(e,t);this.re=r.re,this.im=r.im}u.prototype={re:0,im:0,sign:function(){var e=this.abs();return new u(this.re/e,this.im/e)},add:function(e,t){var r=new u(e,t);return this.isInfinite()&&r.isInfinite()?u.NAN:this.isInfinite()||r.isInfinite()?u.INFINITY:new u(this.re+r.re,this.im+r.im)},sub:function(e,t){var r=new u(e,t);return this.isInfinite()&&r.isInfinite()?u.NAN:this.isInfinite()||r.isInfinite()?u.INFINITY:new u(this.re-r.re,this.im-r.im)},mul:function(e,t){var r=new u(e,t);return this.isInfinite()&&r.isZero()||this.isZero()&&r.isInfinite()?u.NAN:this.isInfinite()||r.isInfinite()?u.INFINITY:0===r.im&&0===this.im?new u(this.re*r.re,0):new u(this.re*r.re-this.im*r.im,this.re*r.im+this.im*r.re)},div:function(e,t){var r=new u(e,t);if(this.isZero()&&r.isZero()||this.isInfinite()&&r.isInfinite())return u.NAN;if(this.isInfinite()||r.isZero())return u.INFINITY;if(this.isZero()||r.isInfinite())return u.ZERO;e=this.re,t=this.im;var n,i,a=r.re,o=r.im;return 0===o?new u(e/a,t/a):Math.abs(a)<Math.abs(o)?new u((e*(i=a/o)+t)/(n=a*i+o),(t*i-e)/n):new u((e+t*(i=o/a))/(n=o*i+a),(t-e*i)/n)},pow:function(e,t){var r=new u(e,t);if(e=this.re,t=this.im,r.isZero())return u.ONE;if(0===r.im){if(0===t&&e>0)return new u(Math.pow(e,r.re),0);if(0===e)switch((r.re%4+4)%4){case 0:return new u(Math.pow(t,r.re),0);case 1:return new u(0,Math.pow(t,r.re));case 2:return new u(-Math.pow(t,r.re),0);case 3:return new u(0,-Math.pow(t,r.re))}}if(0===e&&0===t&&r.re>0&&r.im>=0)return u.ZERO;var n=Math.atan2(t,e),i=s(e,t);return e=Math.exp(r.re*i-r.im*n),t=r.im*i+r.re*n,new u(e*Math.cos(t),e*Math.sin(t))},sqrt:function(){var e,t,r=this.re,n=this.im,i=this.abs();if(r>=0){if(0===n)return new u(Math.sqrt(r),0);e=.5*Math.sqrt(2*(i+r))}else e=Math.abs(n)/Math.sqrt(2*(i-r));return t=r<=0?.5*Math.sqrt(2*(i-r)):Math.abs(n)/Math.sqrt(2*(i+r)),new u(e,n<0?-t:t)},exp:function(){var e=Math.exp(this.re);return this.im,new u(e*Math.cos(this.im),e*Math.sin(this.im))},expm1:function(){var e=this.re,t=this.im;return new u(Math.expm1(e)*Math.cos(t)+function(e){var t=Math.PI/4;if(-t>e||e>t)return Math.cos(e)-1;var r=e*e;return r*(r*(r*(r*(r*(r*(r*(r/20922789888e3-1/87178291200)+1/479001600)-1/3628800)+1/40320)-1/720)+1/24)-.5)}(t),Math.exp(e)*Math.sin(t))},log:function(){var e=this.re,t=this.im;return new u(s(e,t),Math.atan2(t,e))},abs:function(){return e=this.re,t=this.im,r=Math.abs(e),n=Math.abs(t),r<3e3&&n<3e3?Math.sqrt(r*r+n*n):(r<n?(r=n,n=e/t):n=t/e,r*Math.sqrt(1+n*n));var e,t,r,n},arg:function(){return Math.atan2(this.im,this.re)},sin:function(){var e=this.re,t=this.im;return new u(Math.sin(e)*i(t),Math.cos(e)*a(t))},cos:function(){var e=this.re,t=this.im;return new u(Math.cos(e)*i(t),-Math.sin(e)*a(t))},tan:function(){var e=2*this.re,t=2*this.im,r=Math.cos(e)+i(t);return new u(Math.sin(e)/r,a(t)/r)},cot:function(){var e=2*this.re,t=2*this.im,r=Math.cos(e)-i(t);return new u(-Math.sin(e)/r,a(t)/r)},sec:function(){var e=this.re,t=this.im,r=.5*i(2*t)+.5*Math.cos(2*e);return new u(Math.cos(e)*i(t)/r,Math.sin(e)*a(t)/r)},csc:function(){var e=this.re,t=this.im,r=.5*i(2*t)-.5*Math.cos(2*e);return new u(Math.sin(e)*i(t)/r,-Math.cos(e)*a(t)/r)},asin:function(){var e=this.re,t=this.im,r=new u(t*t-e*e+1,-2*e*t).sqrt(),n=new u(r.re-t,r.im+e).log();return new u(n.im,-n.re)},acos:function(){var e=this.re,t=this.im,r=new u(t*t-e*e+1,-2*e*t).sqrt(),n=new u(r.re-t,r.im+e).log();return new u(Math.PI/2-n.im,n.re)},atan:function(){var e=this.re,t=this.im;if(0===e){if(1===t)return new u(0,1/0);if(-1===t)return new u(0,-1/0)}var r=e*e+(1-t)*(1-t),n=new u((1-t*t-e*e)/r,-2*e/r).log();return new u(-.5*n.im,.5*n.re)},acot:function(){var e=this.re,t=this.im;if(0===t)return new u(Math.atan2(1,e),0);var r=e*e+t*t;return 0!==r?new u(e/r,-t/r).atan():new u(0!==e?e/0:0,0!==t?-t/0:0).atan()},asec:function(){var e=this.re,t=this.im;if(0===e&&0===t)return new u(0,1/0);var r=e*e+t*t;return 0!==r?new u(e/r,-t/r).acos():new u(0!==e?e/0:0,0!==t?-t/0:0).acos()},acsc:function(){var e=this.re,t=this.im;if(0===e&&0===t)return new u(Math.PI/2,1/0);var r=e*e+t*t;return 0!==r?new u(e/r,-t/r).asin():new u(0!==e?e/0:0,0!==t?-t/0:0).asin()},sinh:function(){var e=this.re,t=this.im;return new u(a(e)*Math.cos(t),i(e)*Math.sin(t))},cosh:function(){var e=this.re,t=this.im;return new u(i(e)*Math.cos(t),a(e)*Math.sin(t))},tanh:function(){var e=2*this.re,t=2*this.im,r=i(e)+Math.cos(t);return new u(a(e)/r,Math.sin(t)/r)},coth:function(){var e=2*this.re,t=2*this.im,r=i(e)-Math.cos(t);return new u(a(e)/r,-Math.sin(t)/r)},csch:function(){var e=this.re,t=this.im,r=Math.cos(2*t)-i(2*e);return new u(-2*a(e)*Math.cos(t)/r,2*i(e)*Math.sin(t)/r)},sech:function(){var e=this.re,t=this.im,r=Math.cos(2*t)+i(2*e);return new u(2*i(e)*Math.cos(t)/r,-2*a(e)*Math.sin(t)/r)},asinh:function(){var e=this.im;this.im=-this.re,this.re=e;var t=this.asin();return this.re=-this.im,this.im=e,e=t.re,t.re=-t.im,t.im=e,t},acosh:function(){var e=this.acos();if(e.im<=0){var t=e.re;e.re=-e.im,e.im=t}else{t=e.im;e.im=-e.re,e.re=t}return e},atanh:function(){var e=this.re,t=this.im,r=e>1&&0===t,n=1-e,i=1+e,a=n*n+t*t,o=0!==a?new u((i*n-t*t)/a,(t*n+i*t)/a):new u(-1!==e?e/0:0,0!==t?t/0:0),c=o.re;return o.re=s(o.re,o.im)/2,o.im=Math.atan2(o.im,c)/2,r&&(o.im=-o.im),o},acoth:function(){var e=this.re,t=this.im;if(0===e&&0===t)return new u(0,Math.PI/2);var r=e*e+t*t;return 0!==r?new u(e/r,-t/r).atanh():new u(0!==e?e/0:0,0!==t?-t/0:0).atanh()},acsch:function(){var e=this.re,t=this.im;if(0===t)return new u(0!==e?Math.log(e+Math.sqrt(e*e+1)):1/0,0);var r=e*e+t*t;return 0!==r?new u(e/r,-t/r).asinh():new u(0!==e?e/0:0,0!==t?-t/0:0).asinh()},asech:function(){var e=this.re,t=this.im;if(this.isZero())return u.INFINITY;var r=e*e+t*t;return 0!==r?new u(e/r,-t/r).acosh():new u(0!==e?e/0:0,0!==t?-t/0:0).acosh()},inverse:function(){if(this.isZero())return u.INFINITY;if(this.isInfinite())return u.ZERO;var e=this.re,t=this.im,r=e*e+t*t;return new u(e/r,-t/r)},conjugate:function(){return new u(this.re,-this.im)},neg:function(){return new u(-this.re,-this.im)},ceil:function(e){return e=Math.pow(10,e||0),new u(Math.ceil(this.re*e)/e,Math.ceil(this.im*e)/e)},floor:function(e){return e=Math.pow(10,e||0),new u(Math.floor(this.re*e)/e,Math.floor(this.im*e)/e)},round:function(e){return e=Math.pow(10,e||0),new u(Math.round(this.re*e)/e,Math.round(this.im*e)/e)},equals:function(e,t){var r=new u(e,t);return Math.abs(r.re-this.re)<=u.EPSILON&&Math.abs(r.im-this.im)<=u.EPSILON},clone:function(){return new u(this.re,this.im)},toString:function(){var e=this.re,t=this.im,r="";return this.isNaN()?"NaN":this.isInfinite()?"Infinity":(Math.abs(e)<u.EPSILON&&(e=0),Math.abs(t)<u.EPSILON&&(t=0),0===t?r+e:(0!==e?(r+=e,r+=" ",t<0?(t=-t,r+="-"):r+="+",r+=" "):t<0&&(t=-t,r+="-"),1!==t&&(r+=t),r+"i"))},toVector:function(){return[this.re,this.im]},valueOf:function(){return 0===this.im?this.re:null},isNaN:function(){return isNaN(this.re)||isNaN(this.im)},isZero:function(){return 0===this.im&&0===this.re},isFinite:function(){return isFinite(this.re)&&isFinite(this.im)},isInfinite:function(){return!(this.isNaN()||this.isFinite())}},u.ZERO=new u(0,0),u.ONE=new u(1,0),u.I=new u(0,1),u.PI=new u(Math.PI,0),u.E=new u(Math.E,0),u.INFINITY=new u(1/0,1/0),u.NAN=new u(NaN,NaN),u.EPSILON=1e-15,void 0===(n=function(){return u}.apply(t,[]))||(e.exports=n)}()},function(e,t,r){var n=r(1),i=r(96),a=n.String;e.exports=function(e){if("Symbol"===i(e))throw TypeError("Cannot convert a Symbol value to a string");return a(e)}},function(e,t,r){var n=r(1),i=r(48),a=n.Object;e.exports=function(e){return a(i(e))}},function(e,t,r){var n=r(1),i=r(15),a=r(26),o=r(53),s=r(107),u=r(93),c=r(44),f=r(78).CONFIGURABLE,l=c.get,p=c.enforce,m=String(String).split("String");(e.exports=function(e,t,r,u){var c,l=!!u&&!!u.unsafe,h=!!u&&!!u.enumerable,d=!!u&&!!u.noTargetGet,v=u&&void 0!==u.name?u.name:t;i(r)&&("Symbol("===String(v).slice(0,7)&&(v="["+String(v).replace(/^Symbol\(([^)]*)\)/,"$1")+"]"),(!a(r,"name")||f&&r.name!==v)&&o(r,"name",v),(c=p(r)).source||(c.source=m.join("string"==typeof v?v:""))),e!==n?(l?!d&&e[t]&&(h=!0):delete e[t],h?e[t]=r:o(e,t,r)):h?e[t]=r:s(t,r)})(Function.prototype,"toString",(function(){return i(this)&&l(this).source||u(this)}))},function(e,t,r){"use strict";var n=r(6),i=r(81).filter;n({target:"Array",proto:!0,forced:!r(82)("filter")},{filter:function(e){return i(this,e,arguments.length>1?arguments[1]:void 0)}})},function(e,t,r){"use strict";var n=r(6),i=r(1),a=r(49),o=r(83),s=r(22),u=r(9),c=r(67),f=r(18),l=r(105),p=r(8),m=r(26),h=r(97),d=r(15),v=r(23),y=r(52),g=r(88),x=r(21),b=r(35),w=r(40),N=r(87),M=r(34),E=r(75),S=r(70),A=r(109),O=r(68),C=r(169),_=r(143),T=r(58),I=r(20),k=r(152),z=r(135),q=r(123),R=r(36),B=r(90),D=r(94),j=r(77),P=r(91),F=r(16),U=r(175),L=r(176),$=r(85),H=r(44),G=r(81).forEach,V=D("hidden"),Z=F("toPrimitive"),W=H.set,Y=H.getterFor("Symbol"),J=Object.prototype,X=i.Symbol,Q=X&&X.prototype,K=i.TypeError,ee=i.QObject,te=a("JSON","stringify"),re=T.f,ne=I.f,ie=C.f,ae=z.f,oe=u([].push),se=B("symbols"),ue=B("op-symbols"),ce=B("string-to-symbol-registry"),fe=B("symbol-to-string-registry"),le=B("wks"),pe=!ee||!ee.prototype||!ee.prototype.findChild,me=f&&p((function(){return 7!=S(ne({},"a",{get:function(){return ne(this,"a",{value:7}).a}})).a}))?function(e,t,r){var n=re(J,t);n&&delete J[t],ne(e,t,r),n&&e!==J&&ne(J,t,n)}:ne,he=function(e,t){var r=se[e]=S(Q);return W(r,{type:"Symbol",tag:e,description:t}),f||(r.description=t),r},de=function(e,t,r){e===J&&de(ue,t,r),x(e);var n=N(t);return x(r),m(se,n)?(r.enumerable?(m(e,V)&&e[V][n]&&(e[V][n]=!1),r=S(r,{enumerable:E(0,!1)})):(m(e,V)||ne(e,V,E(1,{})),e[V][n]=!0),me(e,n,r)):ne(e,n,r)},ve=function(e,t){x(e);var r=w(t),n=A(r).concat(be(r));return G(n,(function(t){f&&!s(ye,r,t)||de(e,t,r[t])})),e},ye=function(e){var t=N(e),r=s(ae,this,t);return!(this===J&&m(se,t)&&!m(ue,t))&&(!(r||!m(this,t)||!m(se,t)||m(this,V)&&this[V][t])||r)},ge=function(e,t){var r=w(e),n=N(t);if(r!==J||!m(se,n)||m(ue,n)){var i=re(r,n);return!i||!m(se,n)||m(r,V)&&r[V][n]||(i.enumerable=!0),i}},xe=function(e){var t=ie(w(e)),r=[];return G(t,(function(e){m(se,e)||m(j,e)||oe(r,e)})),r},be=function(e){var t=e===J,r=ie(t?ue:w(e)),n=[];return G(r,(function(e){!m(se,e)||t&&!m(J,e)||oe(n,se[e])})),n};(l||(R(Q=(X=function(){if(y(Q,this))throw K("Symbol is not a constructor");var e=arguments.length&&void 0!==arguments[0]?M(arguments[0]):void 0,t=P(e),r=function(e){this===J&&s(r,ue,e),m(this,V)&&m(this[V],t)&&(this[V][t]=!1),me(this,t,E(1,e))};return f&&pe&&me(J,t,{configurable:!0,set:r}),he(t,e)}).prototype,"toString",(function(){return Y(this).tag})),R(X,"withoutSetter",(function(e){return he(P(e),e)})),z.f=ye,I.f=de,k.f=ve,T.f=ge,O.f=C.f=xe,_.f=be,U.f=function(e){return he(F(e),e)},f&&(ne(Q,"description",{configurable:!0,get:function(){return Y(this).description}}),c||R(J,"propertyIsEnumerable",ye,{unsafe:!0}))),n({global:!0,wrap:!0,forced:!l,sham:!l},{Symbol:X}),G(A(le),(function(e){L(e)})),n({target:"Symbol",stat:!0,forced:!l},{for:function(e){var t=M(e);if(m(ce,t))return ce[t];var r=X(t);return ce[t]=r,fe[r]=t,r},keyFor:function(e){if(!g(e))throw K(e+" is not a symbol");if(m(fe,e))return fe[e]},useSetter:function(){pe=!0},useSimple:function(){pe=!1}}),n({target:"Object",stat:!0,forced:!l,sham:!f},{create:function(e,t){return void 0===t?S(e):ve(S(e),t)},defineProperty:de,defineProperties:ve,getOwnPropertyDescriptor:ge}),n({target:"Object",stat:!0,forced:!l},{getOwnPropertyNames:xe,getOwnPropertySymbols:be}),n({target:"Object",stat:!0,forced:p((function(){_.f(1)}))},{getOwnPropertySymbols:function(e){return _.f(b(e))}}),te)&&n({target:"JSON",stat:!0,forced:!l||p((function(){var e=X();return"[null]"!=te([e])||"{}"!=te({a:e})||"{}"!=te(Object(e))}))},{stringify:function(e,t,r){var n=q(arguments),i=t;if((v(t)||void 0!==e)&&!g(e))return h(t)||(t=function(e,t){if(d(i)&&(t=s(i,this,e,t)),!g(t))return t}),n[1]=t,o(te,null,n)}});if(!Q[Z]){var we=Q.valueOf;R(Q,Z,(function(e){return s(we,this)}))}$(X,"Symbol"),j[V]=!0},function(e,t){e.exports=function(){throw new Error("define cannot be used indirect")}},function(e,t,r){var n=r(104),i=r(48);e.exports=function(e){return n(i(e))}},function(e,t,r){"use strict";var n=r(6),i=r(9),a=r(66),o=r(35),s=r(45),u=r(34),c=r(8),f=r(197),l=r(112),p=r(198),m=r(199),h=r(76),d=r(200),v=[],y=i(v.sort),g=i(v.push),x=c((function(){v.sort(void 0)})),b=c((function(){v.sort(null)})),w=l("sort"),N=!c((function(){if(h)return h<70;if(!(p&&p>3)){if(m)return!0;if(d)return d<603;var e,t,r,n,i="";for(e=65;e<76;e++){switch(t=String.fromCharCode(e),e){case 66:case 69:case 70:case 72:r=3;break;case 68:case 71:r=4;break;default:r=2}for(n=0;n<47;n++)v.push({k:t+n,v:r})}for(v.sort((function(e,t){return t.v-e.v})),n=0;n<v.length;n++)t=v[n].k.charAt(0),i.charAt(i.length-1)!==t&&(i+=t);return"DGBEFHACIJK"!==i}}));n({target:"Array",proto:!0,forced:x||!b||!w||!N},{sort:function(e){void 0!==e&&a(e);var t=o(this);if(N)return void 0===e?y(t):y(t,e);var r,n,i=[],c=s(t);for(n=0;n<c;n++)n in t&&g(i,t[n]);for(f(i,function(e){return function(t,r){return void 0===r?-1:void 0===t?1:void 0!==e?+e(t,r)||0:u(t)>u(r)?1:-1}}(e)),r=i.length,n=0;n<r;)t[n]=i[n++];for(;n<c;)delete t[n++];return t}})},function(e,t,r){"use strict";var n=r(156).charAt,i=r(34),a=r(44),o=r(125),s=a.set,u=a.getterFor("String Iterator");o(String,"String",(function(e){s(this,{type:"String Iterator",string:i(e),index:0})}),(function(){var e,t=u(this),r=t.string,i=t.index;return i>=r.length?{value:void 0,done:!0}:(e=n(r,i),t.index+=e.length,{value:e,done:!1})}))},function(e,t,r){var n=r(9),i=n({}.toString),a=n("".slice);e.exports=function(e){return a(i(e),8,-1)}},function(e,t,r){var n,i,a,o=r(190),s=r(1),u=r(9),c=r(23),f=r(53),l=r(26),p=r(106),m=r(94),h=r(77),d=s.TypeError,v=s.WeakMap;if(o||p.state){var y=p.state||(p.state=new v),g=u(y.get),x=u(y.has),b=u(y.set);n=function(e,t){if(x(y,e))throw new d("Object already initialized");return t.facade=e,b(y,e,t),t},i=function(e){return g(y,e)||{}},a=function(e){return x(y,e)}}else{var w=m("state");h[w]=!0,n=function(e,t){if(l(e,w))throw new d("Object already initialized");return t.facade=e,f(e,w,t),t},i=function(e){return l(e,w)?e[w]:{}},a=function(e){return l(e,w)}}e.exports={set:n,get:i,has:a,enforce:function(e){return a(e)?i(e):n(e,{})},getterFor:function(e){return function(t){var r;if(!c(t)||(r=i(t)).type!==e)throw d("Incompatible receiver, "+e+" required");return r}}}},function(e,t,r){var n=r(95);e.exports=function(e){return n(e.length)}},function(e,t,r){var n=r(6),i=r(1),a=r(49),o=r(83),s=r(9),u=r(8),c=i.Array,f=a("JSON","stringify"),l=s(/./.exec),p=s("".charAt),m=s("".charCodeAt),h=s("".replace),d=s(1..toString),v=/[\uD800-\uDFFF]/g,y=/^[\uD800-\uDBFF]$/,g=/^[\uDC00-\uDFFF]$/,x=function(e,t,r){var n=p(r,t-1),i=p(r,t+1);return l(y,e)&&!l(g,i)||l(g,e)&&!l(y,n)?"\\u"+d(m(e,0),16):e},b=u((function(){return'"\\udf06\\ud834"'!==f("\udf06\ud834")||'"\\udead"'!==f("\udead")}));f&&n({target:"JSON",stat:!0,forced:b},{stringify:function(e,t,r){for(var n=0,i=arguments.length,a=c(i);n<i;n++)a[n]=arguments[n];var s=o(f,null,a);return"string"==typeof s?h(s,v,x):s}})},function(e,t,r){"use strict";r(10);var n,i,a=r(6),o=r(1),s=r(22),u=r(9),c=r(15),f=r(23),l=(n=!1,(i=/[ac]/).exec=function(){return n=!0,/./.exec.apply(this,arguments)},!0===i.test("abc")&&n),p=o.Error,m=u(/./.test);a({target:"RegExp",proto:!0,forced:!l},{test:function(e){var t=this.exec;if(!c(t))return m(this,e);var r=s(t,this,e);if(null!==r&&!f(r))throw new p("RegExp exec method returned something other than an Object or null");return!!r}})},function(e,t,r){var n=r(1).TypeError;e.exports=function(e){if(null==e)throw n("Can't call method on "+e);return e}},function(e,t,r){var n=r(1),i=r(15),a=function(e){return i(e)?e:void 0};e.exports=function(e,t){return arguments.length<2?a(n[e]):n[e]&&n[e][t]}},function(e,t,r){"use strict";var n=r(83),i=r(22),a=r(9),o=r(119),s=r(149),u=r(21),c=r(48),f=r(155),l=r(120),p=r(95),m=r(34),h=r(65),d=r(121),v=r(122),y=r(100),g=r(99),x=r(8),b=g.UNSUPPORTED_Y,w=Math.min,N=[].push,M=a(/./.exec),E=a(N),S=a("".slice);o("split",(function(e,t,r){var a;return a="c"=="abbc".split(/(b)*/)[1]||4!="test".split(/(?:)/,-1).length||2!="ab".split(/(?:ab)*/).length||4!=".".split(/(.?)(.?)/).length||".".split(/()()/).length>1||"".split(/.?/).length?function(e,r){var a=m(c(this)),o=void 0===r?4294967295:r>>>0;if(0===o)return[];if(void 0===e)return[a];if(!s(e))return i(t,a,e,o);for(var u,f,l,p=[],h=(e.ignoreCase?"i":"")+(e.multiline?"m":"")+(e.unicode?"u":"")+(e.sticky?"y":""),v=0,g=new RegExp(e.source,h+"g");(u=i(y,g,a))&&!((f=g.lastIndex)>v&&(E(p,S(a,v,u.index)),u.length>1&&u.index<a.length&&n(N,p,d(u,1)),l=u[0].length,v=f,p.length>=o));)g.lastIndex===u.index&&g.lastIndex++;return v===a.length?!l&&M(g,"")||E(p,""):E(p,S(a,v)),p.length>o?d(p,0,o):p}:"0".split(void 0,0).length?function(e,r){return void 0===e&&0===r?[]:i(t,this,e,r)}:t,[function(t,r){var n=c(this),o=null==t?void 0:h(t,e);return o?i(o,t,n,r):i(a,m(n),t,r)},function(e,n){var i=u(this),o=m(e),s=r(a,i,o,n,a!==t);if(s.done)return s.value;var c=f(i,RegExp),h=i.unicode,d=(i.ignoreCase?"i":"")+(i.multiline?"m":"")+(i.unicode?"u":"")+(b?"g":"y"),y=new c(b?"^(?:"+i.source+")":i,d),g=void 0===n?4294967295:n>>>0;if(0===g)return[];if(0===o.length)return null===v(y,o)?[o]:[];for(var x=0,N=0,M=[];N<o.length;){y.lastIndex=b?0:N;var A,O=v(y,b?S(o,N):o);if(null===O||(A=w(p(y.lastIndex+(b?N:0)),o.length))===x)N=l(o,N,h);else{if(E(M,S(o,x,N)),M.length===g)return M;for(var C=1;C<=O.length-1;C++)if(E(M,O[C]),M.length===g)return M;N=x=A}}return E(M,S(o,x)),M}]}),!!x((function(){var e=/(?:)/,t=e.exec;e.exec=function(){return t.apply(this,arguments)};var r="ab".split(e);return 2!==r.length||"a"!==r[0]||"b"!==r[1]})),b)},function(e,t,r){"use strict";var n=r(6),i=r(18),a=r(1),o=r(9),s=r(26),u=r(15),c=r(52),f=r(34),l=r(20).f,p=r(140),m=a.Symbol,h=m&&m.prototype;if(i&&u(m)&&(!("description"in h)||void 0!==m().description)){var d={},v=function(){var e=arguments.length<1||void 0===arguments[0]?void 0:f(arguments[0]),t=c(h,this)?new m(e):void 0===e?m():m(e);return""===e&&(d[t]=!0),t};p(v,m),v.prototype=h,h.constructor=v;var y="Symbol(test)"==String(m("test")),g=o(h.toString),x=o(h.valueOf),b=/^Symbol\((.*)\)[^)]+$/,w=o("".replace),N=o("".slice);l(h,"description",{configurable:!0,get:function(){var e=x(this),t=g(e);if(s(d,e))return"";var r=y?N(t,7,-1):w(t,b,"$1");return""===r?void 0:r}}),n({global:!0,forced:!0},{Symbol:v})}},function(e,t,r){var n=r(9);e.exports=n({}.isPrototypeOf)},function(e,t,r){var n=r(18),i=r(20),a=r(75);e.exports=n?function(e,t,r){return i.f(e,t,a(1,r))}:function(e,t,r){return e[t]=r,e}},function(e,t,r){r(176)("iterator")},function(e,t){e.exports=function(e,t,r){return t in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){var n=r(237),i=r(238),a=r(181),o=r(239);e.exports=function(e,t){return n(e)||i(e,t)||a(e,t)||o()},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){e.exports=r(234)},function(e,t,r){var n=r(18),i=r(22),a=r(135),o=r(75),s=r(40),u=r(87),c=r(26),f=r(138),l=Object.getOwnPropertyDescriptor;t.f=n?l:function(e,t){if(e=s(e),t=u(t),f)try{return l(e,t)}catch(e){}if(c(e,t))return o(!i(a.f,e,t),e[t])}},function(e,t,r){var n=r(49);e.exports=n("navigator","userAgent")||""},function(e,t){var r=Math.ceil,n=Math.floor;e.exports=function(e){var t=+e;return t!=t||0===t?0:(t>0?n:r)(t)}},function(e,t,r){var n=r(6),i=r(221);n({target:"Array",stat:!0,forced:!r(129)((function(e){Array.from(e)}))},{from:i})},function(e,t,r){var n;!function(i){"use strict";var a,o,s,u=9e15,c="0123456789abcdef",f="2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058",l="3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789",p={precision:20,rounding:4,modulo:1,toExpNeg:-7,toExpPos:21,minE:-u,maxE:u,crypto:!1},m=!0,h="[DecimalError] Invalid argument: ",d="[object Decimal]",v=Math.floor,y=Math.pow,g=/^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,x=/^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,b=/^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,w=/^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,N=1e7,M=f.length-1,E=l.length-1,S={toStringTag:d};function A(e){var t,r,n,i=e.length-1,a="",o=e[0];if(i>0){for(a+=o,t=1;t<i;t++)(r=7-(n=e[t]+"").length)&&(a+=D(r)),a+=n;(r=7-(n=(o=e[t])+"").length)&&(a+=D(r))}else if(0===o)return"0";for(;o%10==0;)o/=10;return a+o}function O(e,t,r){if(e!==~~e||e<t||e>r)throw Error(h+e)}function C(e,t,r,n){var i,a,o,s;for(a=e[0];a>=10;a/=10)--t;return--t<0?(t+=7,i=0):(i=Math.ceil((t+1)/7),t%=7),a=y(10,7-t),s=e[i]%a|0,null==n?t<3?(0==t?s=s/100|0:1==t&&(s=s/10|0),o=r<4&&99999==s||r>3&&49999==s||5e4==s||0==s):o=(r<4&&s+1==a||r>3&&s+1==a/2)&&(e[i+1]/a/100|0)==y(10,t-2)-1||(s==a/2||0==s)&&0==(e[i+1]/a/100|0):t<4?(0==t?s=s/1e3|0:1==t?s=s/100|0:2==t&&(s=s/10|0),o=(n||r<4)&&9999==s||!n&&r>3&&4999==s):o=((n||r<4)&&s+1==a||!n&&r>3&&s+1==a/2)&&(e[i+1]/a/1e3|0)==y(10,t-3)-1,o}function _(e,t,r){for(var n,i,a=[0],o=0,s=e.length;o<s;){for(i=a.length;i--;)a[i]*=t;for(a[0]+=c.indexOf(e.charAt(o++)),n=0;n<a.length;n++)a[n]>r-1&&(void 0===a[n+1]&&(a[n+1]=0),a[n+1]+=a[n]/r|0,a[n]%=r)}return a.reverse()}S.absoluteValue=S.abs=function(){var e=new this.constructor(this);return e.s<0&&(e.s=1),I(e)},S.ceil=function(){return I(new this.constructor(this),this.e+1,2)},S.clampedTo=S.clamp=function(e,t){var r=this,n=r.constructor;if(e=new n(e),t=new n(t),!e.s||!t.s)return new n(NaN);if(e.gt(t))throw Error(h+t);return r.cmp(e)<0?e:r.cmp(t)>0?t:new n(r)},S.comparedTo=S.cmp=function(e){var t,r,n,i,a=this,o=a.d,s=(e=new a.constructor(e)).d,u=a.s,c=e.s;if(!o||!s)return u&&c?u!==c?u:o===s?0:!o^u<0?1:-1:NaN;if(!o[0]||!s[0])return o[0]?u:s[0]?-c:0;if(u!==c)return u;if(a.e!==e.e)return a.e>e.e^u<0?1:-1;for(t=0,r=(n=o.length)<(i=s.length)?n:i;t<r;++t)if(o[t]!==s[t])return o[t]>s[t]^u<0?1:-1;return n===i?0:n>i^u<0?1:-1},S.cosine=S.cos=function(){var e,t,r=this,n=r.constructor;return r.d?r.d[0]?(e=n.precision,t=n.rounding,n.precision=e+Math.max(r.e,r.sd())+7,n.rounding=1,r=function(e,t){var r,n,i;if(t.isZero())return t;(n=t.d.length)<32?(r=Math.ceil(n/3),i=(1/Z(4,r)).toString()):(r=16,i="2.3283064365386962890625e-10");e.precision+=r,t=V(e,1,t.times(i),new e(1));for(var a=r;a--;){var o=t.times(t);t=o.times(o).minus(o).times(8).plus(1)}return e.precision-=r,t}(n,W(n,r)),n.precision=e,n.rounding=t,I(2==s||3==s?r.neg():r,e,t,!0)):new n(1):new n(NaN)},S.cubeRoot=S.cbrt=function(){var e,t,r,n,i,a,o,s,u,c,f=this,l=f.constructor;if(!f.isFinite()||f.isZero())return new l(f);for(m=!1,(a=f.s*y(f.s*f,1/3))&&Math.abs(a)!=1/0?n=new l(a.toString()):(r=A(f.d),(a=((e=f.e)-r.length+1)%3)&&(r+=1==a||-2==a?"0":"00"),a=y(r,1/3),e=v((e+1)/3)-(e%3==(e<0?-1:2)),(n=new l(r=a==1/0?"5e"+e:(r=a.toExponential()).slice(0,r.indexOf("e")+1)+e)).s=f.s),o=(e=l.precision)+3;;)if(c=(u=(s=n).times(s).times(s)).plus(f),n=T(c.plus(f).times(s),c.plus(u),o+2,1),A(s.d).slice(0,o)===(r=A(n.d)).slice(0,o)){if("9999"!=(r=r.slice(o-3,o+1))&&(i||"4999"!=r)){+r&&(+r.slice(1)||"5"!=r.charAt(0))||(I(n,e+1,1),t=!n.times(n).times(n).eq(f));break}if(!i&&(I(s,e+1,0),s.times(s).times(s).eq(f))){n=s;break}o+=4,i=1}return m=!0,I(n,e,l.rounding,t)},S.decimalPlaces=S.dp=function(){var e,t=this.d,r=NaN;if(t){if(r=7*((e=t.length-1)-v(this.e/7)),e=t[e])for(;e%10==0;e/=10)r--;r<0&&(r=0)}return r},S.dividedBy=S.div=function(e){return T(this,new this.constructor(e))},S.dividedToIntegerBy=S.divToInt=function(e){var t=this.constructor;return I(T(this,new t(e),0,1,1),t.precision,t.rounding)},S.equals=S.eq=function(e){return 0===this.cmp(e)},S.floor=function(){return I(new this.constructor(this),this.e+1,3)},S.greaterThan=S.gt=function(e){return this.cmp(e)>0},S.greaterThanOrEqualTo=S.gte=function(e){var t=this.cmp(e);return 1==t||0===t},S.hyperbolicCosine=S.cosh=function(){var e,t,r,n,i,a=this,o=a.constructor,s=new o(1);if(!a.isFinite())return new o(a.s?1/0:NaN);if(a.isZero())return s;r=o.precision,n=o.rounding,o.precision=r+Math.max(a.e,a.sd())+4,o.rounding=1,(i=a.d.length)<32?t=(1/Z(4,e=Math.ceil(i/3))).toString():(e=16,t="2.3283064365386962890625e-10"),a=V(o,1,a.times(t),new o(1),!0);for(var u,c=e,f=new o(8);c--;)u=a.times(a),a=s.minus(u.times(f.minus(u.times(f))));return I(a,o.precision=r,o.rounding=n,!0)},S.hyperbolicSine=S.sinh=function(){var e,t,r,n,i=this,a=i.constructor;if(!i.isFinite()||i.isZero())return new a(i);if(t=a.precision,r=a.rounding,a.precision=t+Math.max(i.e,i.sd())+4,a.rounding=1,(n=i.d.length)<3)i=V(a,2,i,i,!0);else{e=(e=1.4*Math.sqrt(n))>16?16:0|e,i=V(a,2,i=i.times(1/Z(5,e)),i,!0);for(var o,s=new a(5),u=new a(16),c=new a(20);e--;)o=i.times(i),i=i.times(s.plus(o.times(u.times(o).plus(c))))}return a.precision=t,a.rounding=r,I(i,t,r,!0)},S.hyperbolicTangent=S.tanh=function(){var e,t,r=this,n=r.constructor;return r.isFinite()?r.isZero()?new n(r):(e=n.precision,t=n.rounding,n.precision=e+7,n.rounding=1,T(r.sinh(),r.cosh(),n.precision=e,n.rounding=t)):new n(r.s)},S.inverseCosine=S.acos=function(){var e,t=this,r=t.constructor,n=t.abs().cmp(1),i=r.precision,a=r.rounding;return-1!==n?0===n?t.isNeg()?R(r,i,a):new r(0):new r(NaN):t.isZero()?R(r,i+4,a).times(.5):(r.precision=i+6,r.rounding=1,t=t.asin(),e=R(r,i+4,a).times(.5),r.precision=i,r.rounding=a,e.minus(t))},S.inverseHyperbolicCosine=S.acosh=function(){var e,t,r=this,n=r.constructor;return r.lte(1)?new n(r.eq(1)?0:NaN):r.isFinite()?(e=n.precision,t=n.rounding,n.precision=e+Math.max(Math.abs(r.e),r.sd())+4,n.rounding=1,m=!1,r=r.times(r).minus(1).sqrt().plus(r),m=!0,n.precision=e,n.rounding=t,r.ln()):new n(r)},S.inverseHyperbolicSine=S.asinh=function(){var e,t,r=this,n=r.constructor;return!r.isFinite()||r.isZero()?new n(r):(e=n.precision,t=n.rounding,n.precision=e+2*Math.max(Math.abs(r.e),r.sd())+6,n.rounding=1,m=!1,r=r.times(r).plus(1).sqrt().plus(r),m=!0,n.precision=e,n.rounding=t,r.ln())},S.inverseHyperbolicTangent=S.atanh=function(){var e,t,r,n,i=this,a=i.constructor;return i.isFinite()?i.e>=0?new a(i.abs().eq(1)?i.s/0:i.isZero()?i:NaN):(e=a.precision,t=a.rounding,n=i.sd(),Math.max(n,e)<2*-i.e-1?I(new a(i),e,t,!0):(a.precision=r=n-i.e,i=T(i.plus(1),new a(1).minus(i),r+e,1),a.precision=e+4,a.rounding=1,i=i.ln(),a.precision=e,a.rounding=t,i.times(.5))):new a(NaN)},S.inverseSine=S.asin=function(){var e,t,r,n,i=this,a=i.constructor;return i.isZero()?new a(i):(t=i.abs().cmp(1),r=a.precision,n=a.rounding,-1!==t?0===t?((e=R(a,r+4,n).times(.5)).s=i.s,e):new a(NaN):(a.precision=r+6,a.rounding=1,i=i.div(new a(1).minus(i.times(i)).sqrt().plus(1)).atan(),a.precision=r,a.rounding=n,i.times(2)))},S.inverseTangent=S.atan=function(){var e,t,r,n,i,a,o,s,u,c=this,f=c.constructor,l=f.precision,p=f.rounding;if(c.isFinite()){if(c.isZero())return new f(c);if(c.abs().eq(1)&&l+4<=E)return(o=R(f,l+4,p).times(.25)).s=c.s,o}else{if(!c.s)return new f(NaN);if(l+4<=E)return(o=R(f,l+4,p).times(.5)).s=c.s,o}for(f.precision=s=l+10,f.rounding=1,e=r=Math.min(28,s/7+2|0);e;--e)c=c.div(c.times(c).plus(1).sqrt().plus(1));for(m=!1,t=Math.ceil(s/7),n=1,u=c.times(c),o=new f(c),i=c;-1!==e;)if(i=i.times(u),a=o.minus(i.div(n+=2)),i=i.times(u),void 0!==(o=a.plus(i.div(n+=2))).d[t])for(e=t;o.d[e]===a.d[e]&&e--;);return r&&(o=o.times(2<<r-1)),m=!0,I(o,f.precision=l,f.rounding=p,!0)},S.isFinite=function(){return!!this.d},S.isInteger=S.isInt=function(){return!!this.d&&v(this.e/7)>this.d.length-2},S.isNaN=function(){return!this.s},S.isNegative=S.isNeg=function(){return this.s<0},S.isPositive=S.isPos=function(){return this.s>0},S.isZero=function(){return!!this.d&&0===this.d[0]},S.lessThan=S.lt=function(e){return this.cmp(e)<0},S.lessThanOrEqualTo=S.lte=function(e){return this.cmp(e)<1},S.logarithm=S.log=function(e){var t,r,n,i,a,o,s,u,c=this.constructor,f=c.precision,l=c.rounding;if(null==e)e=new c(10),t=!0;else{if(r=(e=new c(e)).d,e.s<0||!r||!r[0]||e.eq(1))return new c(NaN);t=e.eq(10)}if(r=this.d,this.s<0||!r||!r[0]||this.eq(1))return new c(r&&!r[0]?-1/0:1!=this.s?NaN:r?0:1/0);if(t)if(r.length>1)a=!0;else{for(i=r[0];i%10==0;)i/=10;a=1!==i}if(m=!1,o=L(this,s=f+5),n=t?q(c,s+10):L(e,s),C((u=T(o,n,s,1)).d,i=f,l))do{if(o=L(this,s+=10),n=t?q(c,s+10):L(e,s),u=T(o,n,s,1),!a){+A(u.d).slice(i+1,i+15)+1==1e14&&(u=I(u,f+1,0));break}}while(C(u.d,i+=10,l));return m=!0,I(u,f,l)},S.minus=S.sub=function(e){var t,r,n,i,a,o,s,u,c,f,l,p,h=this,d=h.constructor;if(e=new d(e),!h.d||!e.d)return h.s&&e.s?h.d?e.s=-e.s:e=new d(e.d||h.s!==e.s?h:NaN):e=new d(NaN),e;if(h.s!=e.s)return e.s=-e.s,h.plus(e);if(c=h.d,p=e.d,s=d.precision,u=d.rounding,!c[0]||!p[0]){if(p[0])e.s=-e.s;else{if(!c[0])return new d(3===u?-0:0);e=new d(h)}return m?I(e,s,u):e}if(r=v(e.e/7),f=v(h.e/7),c=c.slice(),a=f-r){for((l=a<0)?(t=c,a=-a,o=p.length):(t=p,r=f,o=c.length),a>(n=Math.max(Math.ceil(s/7),o)+2)&&(a=n,t.length=1),t.reverse(),n=a;n--;)t.push(0);t.reverse()}else{for((l=(n=c.length)<(o=p.length))&&(o=n),n=0;n<o;n++)if(c[n]!=p[n]){l=c[n]<p[n];break}a=0}for(l&&(t=c,c=p,p=t,e.s=-e.s),o=c.length,n=p.length-o;n>0;--n)c[o++]=0;for(n=p.length;n>a;){if(c[--n]<p[n]){for(i=n;i&&0===c[--i];)c[i]=N-1;--c[i],c[n]+=N}c[n]-=p[n]}for(;0===c[--o];)c.pop();for(;0===c[0];c.shift())--r;return c[0]?(e.d=c,e.e=z(c,r),m?I(e,s,u):e):new d(3===u?-0:0)},S.modulo=S.mod=function(e){var t,r=this,n=r.constructor;return e=new n(e),!r.d||!e.s||e.d&&!e.d[0]?new n(NaN):!e.d||r.d&&!r.d[0]?I(new n(r),n.precision,n.rounding):(m=!1,9==n.modulo?(t=T(r,e.abs(),0,3,1)).s*=e.s:t=T(r,e,0,n.modulo,1),t=t.times(e),m=!0,r.minus(t))},S.naturalExponential=S.exp=function(){return U(this)},S.naturalLogarithm=S.ln=function(){return L(this)},S.negated=S.neg=function(){var e=new this.constructor(this);return e.s=-e.s,I(e)},S.plus=S.add=function(e){var t,r,n,i,a,o,s,u,c,f,l=this,p=l.constructor;if(e=new p(e),!l.d||!e.d)return l.s&&e.s?l.d||(e=new p(e.d||l.s===e.s?l:NaN)):e=new p(NaN),e;if(l.s!=e.s)return e.s=-e.s,l.minus(e);if(c=l.d,f=e.d,s=p.precision,u=p.rounding,!c[0]||!f[0])return f[0]||(e=new p(l)),m?I(e,s,u):e;if(a=v(l.e/7),n=v(e.e/7),c=c.slice(),i=a-n){for(i<0?(r=c,i=-i,o=f.length):(r=f,n=a,o=c.length),i>(o=(a=Math.ceil(s/7))>o?a+1:o+1)&&(i=o,r.length=1),r.reverse();i--;)r.push(0);r.reverse()}for((o=c.length)-(i=f.length)<0&&(i=o,r=f,f=c,c=r),t=0;i;)t=(c[--i]=c[i]+f[i]+t)/N|0,c[i]%=N;for(t&&(c.unshift(t),++n),o=c.length;0==c[--o];)c.pop();return e.d=c,e.e=z(c,n),m?I(e,s,u):e},S.precision=S.sd=function(e){var t,r=this;if(void 0!==e&&e!==!!e&&1!==e&&0!==e)throw Error(h+e);return r.d?(t=B(r.d),e&&r.e+1>t&&(t=r.e+1)):t=NaN,t},S.round=function(){var e=this,t=e.constructor;return I(new t(e),e.e+1,t.rounding)},S.sine=S.sin=function(){var e,t,r=this,n=r.constructor;return r.isFinite()?r.isZero()?new n(r):(e=n.precision,t=n.rounding,n.precision=e+Math.max(r.e,r.sd())+7,n.rounding=1,r=function(e,t){var r,n=t.d.length;if(n<3)return t.isZero()?t:V(e,2,t,t);r=(r=1.4*Math.sqrt(n))>16?16:0|r,t=t.times(1/Z(5,r)),t=V(e,2,t,t);for(var i,a=new e(5),o=new e(16),s=new e(20);r--;)i=t.times(t),t=t.times(a.plus(i.times(o.times(i).minus(s))));return t}(n,W(n,r)),n.precision=e,n.rounding=t,I(s>2?r.neg():r,e,t,!0)):new n(NaN)},S.squareRoot=S.sqrt=function(){var e,t,r,n,i,a,o=this,s=o.d,u=o.e,c=o.s,f=o.constructor;if(1!==c||!s||!s[0])return new f(!c||c<0&&(!s||s[0])?NaN:s?o:1/0);for(m=!1,0==(c=Math.sqrt(+o))||c==1/0?(((t=A(s)).length+u)%2==0&&(t+="0"),c=Math.sqrt(t),u=v((u+1)/2)-(u<0||u%2),n=new f(t=c==1/0?"5e"+u:(t=c.toExponential()).slice(0,t.indexOf("e")+1)+u)):n=new f(c.toString()),r=(u=f.precision)+3;;)if(n=(a=n).plus(T(o,a,r+2,1)).times(.5),A(a.d).slice(0,r)===(t=A(n.d)).slice(0,r)){if("9999"!=(t=t.slice(r-3,r+1))&&(i||"4999"!=t)){+t&&(+t.slice(1)||"5"!=t.charAt(0))||(I(n,u+1,1),e=!n.times(n).eq(o));break}if(!i&&(I(a,u+1,0),a.times(a).eq(o))){n=a;break}r+=4,i=1}return m=!0,I(n,u,f.rounding,e)},S.tangent=S.tan=function(){var e,t,r=this,n=r.constructor;return r.isFinite()?r.isZero()?new n(r):(e=n.precision,t=n.rounding,n.precision=e+10,n.rounding=1,(r=r.sin()).s=1,r=T(r,new n(1).minus(r.times(r)).sqrt(),e+10,0),n.precision=e,n.rounding=t,I(2==s||4==s?r.neg():r,e,t,!0)):new n(NaN)},S.times=S.mul=function(e){var t,r,n,i,a,o,s,u,c,f=this,l=f.constructor,p=f.d,h=(e=new l(e)).d;if(e.s*=f.s,!(p&&p[0]&&h&&h[0]))return new l(!e.s||p&&!p[0]&&!h||h&&!h[0]&&!p?NaN:p&&h?0*e.s:e.s/0);for(r=v(f.e/7)+v(e.e/7),(u=p.length)<(c=h.length)&&(a=p,p=h,h=a,o=u,u=c,c=o),a=[],n=o=u+c;n--;)a.push(0);for(n=c;--n>=0;){for(t=0,i=u+n;i>n;)s=a[i]+h[n]*p[i-n-1]+t,a[i--]=s%N|0,t=s/N|0;a[i]=(a[i]+t)%N|0}for(;!a[--o];)a.pop();return t?++r:a.shift(),e.d=a,e.e=z(a,r),m?I(e,l.precision,l.rounding):e},S.toBinary=function(e,t){return Y(this,2,e,t)},S.toDecimalPlaces=S.toDP=function(e,t){var r=this,n=r.constructor;return r=new n(r),void 0===e?r:(O(e,0,1e9),void 0===t?t=n.rounding:O(t,0,8),I(r,e+r.e+1,t))},S.toExponential=function(e,t){var r,n=this,i=n.constructor;return void 0===e?r=k(n,!0):(O(e,0,1e9),void 0===t?t=i.rounding:O(t,0,8),r=k(n=I(new i(n),e+1,t),!0,e+1)),n.isNeg()&&!n.isZero()?"-"+r:r},S.toFixed=function(e,t){var r,n,i=this,a=i.constructor;return void 0===e?r=k(i):(O(e,0,1e9),void 0===t?t=a.rounding:O(t,0,8),r=k(n=I(new a(i),e+i.e+1,t),!1,e+n.e+1)),i.isNeg()&&!i.isZero()?"-"+r:r},S.toFraction=function(e){var t,r,n,i,a,o,s,u,c,f,l,p,d=this,v=d.d,g=d.constructor;if(!v)return new g(d);if(c=r=new g(1),n=u=new g(0),o=(a=(t=new g(n)).e=B(v)-d.e-1)%7,t.d[0]=y(10,o<0?7+o:o),null==e)e=a>0?t:c;else{if(!(s=new g(e)).isInt()||s.lt(c))throw Error(h+s);e=s.gt(t)?a>0?t:c:s}for(m=!1,s=new g(A(v)),f=g.precision,g.precision=a=7*v.length*2;l=T(s,t,0,1,1),1!=(i=r.plus(l.times(n))).cmp(e);)r=n,n=i,i=c,c=u.plus(l.times(i)),u=i,i=t,t=s.minus(l.times(i)),s=i;return i=T(e.minus(r),n,0,1,1),u=u.plus(i.times(c)),r=r.plus(i.times(n)),u.s=c.s=d.s,p=T(c,n,a,1).minus(d).abs().cmp(T(u,r,a,1).minus(d).abs())<1?[c,n]:[u,r],g.precision=f,m=!0,p},S.toHexadecimal=S.toHex=function(e,t){return Y(this,16,e,t)},S.toNearest=function(e,t){var r=this,n=r.constructor;if(r=new n(r),null==e){if(!r.d)return r;e=new n(1),t=n.rounding}else{if(e=new n(e),void 0===t?t=n.rounding:O(t,0,8),!r.d)return e.s?r:e;if(!e.d)return e.s&&(e.s=r.s),e}return e.d[0]?(m=!1,r=T(r,e,0,t,1).times(e),m=!0,I(r)):(e.s=r.s,r=e),r},S.toNumber=function(){return+this},S.toOctal=function(e,t){return Y(this,8,e,t)},S.toPower=S.pow=function(e){var t,r,n,i,a,o,s=this,u=s.constructor,c=+(e=new u(e));if(!(s.d&&e.d&&s.d[0]&&e.d[0]))return new u(y(+s,c));if((s=new u(s)).eq(1))return s;if(n=u.precision,a=u.rounding,e.eq(1))return I(s,n,a);if((t=v(e.e/7))>=e.d.length-1&&(r=c<0?-c:c)<=9007199254740991)return i=j(u,s,r,n),e.s<0?new u(1).div(i):I(i,n,a);if((o=s.s)<0){if(t<e.d.length-1)return new u(NaN);if(0==(1&e.d[t])&&(o=1),0==s.e&&1==s.d[0]&&1==s.d.length)return s.s=o,s}return(t=0!=(r=y(+s,c))&&isFinite(r)?new u(r+"").e:v(c*(Math.log("0."+A(s.d))/Math.LN10+s.e+1)))>u.maxE+1||t<u.minE-1?new u(t>0?o/0:0):(m=!1,u.rounding=s.s=1,r=Math.min(12,(t+"").length),(i=U(e.times(L(s,n+r)),n)).d&&C((i=I(i,n+5,1)).d,n,a)&&(t=n+10,+A((i=I(U(e.times(L(s,t+r)),t),t+5,1)).d).slice(n+1,n+15)+1==1e14&&(i=I(i,n+1,0))),i.s=o,m=!0,u.rounding=a,I(i,n,a))},S.toPrecision=function(e,t){var r,n=this,i=n.constructor;return void 0===e?r=k(n,n.e<=i.toExpNeg||n.e>=i.toExpPos):(O(e,1,1e9),void 0===t?t=i.rounding:O(t,0,8),r=k(n=I(new i(n),e,t),e<=n.e||n.e<=i.toExpNeg,e)),n.isNeg()&&!n.isZero()?"-"+r:r},S.toSignificantDigits=S.toSD=function(e,t){var r=this.constructor;return void 0===e?(e=r.precision,t=r.rounding):(O(e,1,1e9),void 0===t?t=r.rounding:O(t,0,8)),I(new r(this),e,t)},S.toString=function(){var e=this,t=e.constructor,r=k(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()&&!e.isZero()?"-"+r:r},S.truncated=S.trunc=function(){return I(new this.constructor(this),this.e+1,1)},S.valueOf=S.toJSON=function(){var e=this,t=e.constructor,r=k(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()?"-"+r:r};var T=function(){function e(e,t,r){var n,i=0,a=e.length;for(e=e.slice();a--;)n=e[a]*t+i,e[a]=n%r|0,i=n/r|0;return i&&e.unshift(i),e}function t(e,t,r,n){var i,a;if(r!=n)a=r>n?1:-1;else for(i=a=0;i<r;i++)if(e[i]!=t[i]){a=e[i]>t[i]?1:-1;break}return a}function r(e,t,r,n){for(var i=0;r--;)e[r]-=i,i=e[r]<t[r]?1:0,e[r]=i*n+e[r]-t[r];for(;!e[0]&&e.length>1;)e.shift()}return function(n,i,a,s,u,c){var f,l,p,m,h,d,y,g,x,b,w,M,E,S,A,O,C,_,T,k,z=n.constructor,q=n.s==i.s?1:-1,R=n.d,B=i.d;if(!(R&&R[0]&&B&&B[0]))return new z(n.s&&i.s&&(R?!B||R[0]!=B[0]:B)?R&&0==R[0]||!B?0*q:q/0:NaN);for(c?(h=1,l=n.e-i.e):(c=N,h=7,l=v(n.e/h)-v(i.e/h)),T=B.length,C=R.length,b=(x=new z(q)).d=[],p=0;B[p]==(R[p]||0);p++);if(B[p]>(R[p]||0)&&l--,null==a?(S=a=z.precision,s=z.rounding):S=u?a+(n.e-i.e)+1:a,S<0)b.push(1),d=!0;else{if(S=S/h+2|0,p=0,1==T){for(m=0,B=B[0],S++;(p<C||m)&&S--;p++)A=m*c+(R[p]||0),b[p]=A/B|0,m=A%B|0;d=m||p<C}else{for((m=c/(B[0]+1)|0)>1&&(B=e(B,m,c),R=e(R,m,c),T=B.length,C=R.length),O=T,M=(w=R.slice(0,T)).length;M<T;)w[M++]=0;(k=B.slice()).unshift(0),_=B[0],B[1]>=c/2&&++_;do{m=0,(f=t(B,w,T,M))<0?(E=w[0],T!=M&&(E=E*c+(w[1]||0)),(m=E/_|0)>1?(m>=c&&(m=c-1),1==(f=t(y=e(B,m,c),w,g=y.length,M=w.length))&&(m--,r(y,T<g?k:B,g,c))):(0==m&&(f=m=1),y=B.slice()),(g=y.length)<M&&y.unshift(0),r(w,y,M,c),-1==f&&(f=t(B,w,T,M=w.length))<1&&(m++,r(w,T<M?k:B,M,c)),M=w.length):0===f&&(m++,w=[0]),b[p++]=m,f&&w[0]?w[M++]=R[O]||0:(w=[R[O]],M=1)}while((O++<C||void 0!==w[0])&&S--);d=void 0!==w[0]}b[0]||b.shift()}if(1==h)x.e=l,o=d;else{for(p=1,m=b[0];m>=10;m/=10)p++;x.e=p+l*h-1,I(x,u?a+x.e+1:a,s,d)}return x}}();function I(e,t,r,n){var i,a,o,s,u,c,f,l,p,h=e.constructor;e:if(null!=t){if(!(l=e.d))return e;for(i=1,s=l[0];s>=10;s/=10)i++;if((a=t-i)<0)a+=7,o=t,u=(f=l[p=0])/y(10,i-o-1)%10|0;else if((p=Math.ceil((a+1)/7))>=(s=l.length)){if(!n)break e;for(;s++<=p;)l.push(0);f=u=0,i=1,o=(a%=7)-7+1}else{for(f=s=l[p],i=1;s>=10;s/=10)i++;u=(o=(a%=7)-7+i)<0?0:f/y(10,i-o-1)%10|0}if(n=n||t<0||void 0!==l[p+1]||(o<0?f:f%y(10,i-o-1)),c=r<4?(u||n)&&(0==r||r==(e.s<0?3:2)):u>5||5==u&&(4==r||n||6==r&&(a>0?o>0?f/y(10,i-o):0:l[p-1])%10&1||r==(e.s<0?8:7)),t<1||!l[0])return l.length=0,c?(t-=e.e+1,l[0]=y(10,(7-t%7)%7),e.e=-t||0):l[0]=e.e=0,e;if(0==a?(l.length=p,s=1,p--):(l.length=p+1,s=y(10,7-a),l[p]=o>0?(f/y(10,i-o)%y(10,o)|0)*s:0),c)for(;;){if(0==p){for(a=1,o=l[0];o>=10;o/=10)a++;for(o=l[0]+=s,s=1;o>=10;o/=10)s++;a!=s&&(e.e++,l[0]==N&&(l[0]=1));break}if(l[p]+=s,l[p]!=N)break;l[p--]=0,s=1}for(a=l.length;0===l[--a];)l.pop()}return m&&(e.e>h.maxE?(e.d=null,e.e=NaN):e.e<h.minE&&(e.e=0,e.d=[0])),e}function k(e,t,r){if(!e.isFinite())return $(e);var n,i=e.e,a=A(e.d),o=a.length;return t?(r&&(n=r-o)>0?a=a.charAt(0)+"."+a.slice(1)+D(n):o>1&&(a=a.charAt(0)+"."+a.slice(1)),a=a+(e.e<0?"e":"e+")+e.e):i<0?(a="0."+D(-i-1)+a,r&&(n=r-o)>0&&(a+=D(n))):i>=o?(a+=D(i+1-o),r&&(n=r-i-1)>0&&(a=a+"."+D(n))):((n=i+1)<o&&(a=a.slice(0,n)+"."+a.slice(n)),r&&(n=r-o)>0&&(i+1===o&&(a+="."),a+=D(n))),a}function z(e,t){var r=e[0];for(t*=7;r>=10;r/=10)t++;return t}function q(e,t,r){if(t>M)throw m=!0,r&&(e.precision=r),Error("[DecimalError] Precision limit exceeded");return I(new e(f),t,1,!0)}function R(e,t,r){if(t>E)throw Error("[DecimalError] Precision limit exceeded");return I(new e(l),t,r,!0)}function B(e){var t=e.length-1,r=7*t+1;if(t=e[t]){for(;t%10==0;t/=10)r--;for(t=e[0];t>=10;t/=10)r++}return r}function D(e){for(var t="";e--;)t+="0";return t}function j(e,t,r,n){var i,a=new e(1),o=Math.ceil(n/7+4);for(m=!1;;){if(r%2&&J((a=a.times(t)).d,o)&&(i=!0),0===(r=v(r/2))){r=a.d.length-1,i&&0===a.d[r]&&++a.d[r];break}J((t=t.times(t)).d,o)}return m=!0,a}function P(e){return 1&e.d[e.d.length-1]}function F(e,t,r){for(var n,i=new e(t[0]),a=0;++a<t.length;){if(!(n=new e(t[a])).s){i=n;break}i[r](n)&&(i=n)}return i}function U(e,t){var r,n,i,a,o,s,u,c=0,f=0,l=0,p=e.constructor,h=p.rounding,d=p.precision;if(!e.d||!e.d[0]||e.e>17)return new p(e.d?e.d[0]?e.s<0?0:1/0:1:e.s?e.s<0?0:e:NaN);for(null==t?(m=!1,u=d):u=t,s=new p(.03125);e.e>-2;)e=e.times(s),l+=5;for(u+=n=Math.log(y(2,l))/Math.LN10*2+5|0,r=a=o=new p(1),p.precision=u;;){if(a=I(a.times(e),u,1),r=r.times(++f),A((s=o.plus(T(a,r,u,1))).d).slice(0,u)===A(o.d).slice(0,u)){for(i=l;i--;)o=I(o.times(o),u,1);if(null!=t)return p.precision=d,o;if(!(c<3&&C(o.d,u-n,h,c)))return I(o,p.precision=d,h,m=!0);p.precision=u+=10,r=a=s=new p(1),f=0,c++}o=s}}function L(e,t){var r,n,i,a,o,s,u,c,f,l,p,h=1,d=e,v=d.d,y=d.constructor,g=y.rounding,x=y.precision;if(d.s<0||!v||!v[0]||!d.e&&1==v[0]&&1==v.length)return new y(v&&!v[0]?-1/0:1!=d.s?NaN:v?0:d);if(null==t?(m=!1,f=x):f=t,y.precision=f+=10,n=(r=A(v)).charAt(0),!(Math.abs(a=d.e)<15e14))return c=q(y,f+2,x).times(a+""),d=L(new y(n+"."+r.slice(1)),f-10).plus(c),y.precision=x,null==t?I(d,x,g,m=!0):d;for(;n<7&&1!=n||1==n&&r.charAt(1)>3;)n=(r=A((d=d.times(e)).d)).charAt(0),h++;for(a=d.e,n>1?(d=new y("0."+r),a++):d=new y(n+"."+r.slice(1)),l=d,u=o=d=T(d.minus(1),d.plus(1),f,1),p=I(d.times(d),f,1),i=3;;){if(o=I(o.times(p),f,1),A((c=u.plus(T(o,new y(i),f,1))).d).slice(0,f)===A(u.d).slice(0,f)){if(u=u.times(2),0!==a&&(u=u.plus(q(y,f+2,x).times(a+""))),u=T(u,new y(h),f,1),null!=t)return y.precision=x,u;if(!C(u.d,f-10,g,s))return I(u,y.precision=x,g,m=!0);y.precision=f+=10,c=o=d=T(l.minus(1),l.plus(1),f,1),p=I(d.times(d),f,1),i=s=1}u=c,i+=2}}function $(e){return String(e.s*e.s/0)}function H(e,t){var r,n,i;for((r=t.indexOf("."))>-1&&(t=t.replace(".","")),(n=t.search(/e/i))>0?(r<0&&(r=n),r+=+t.slice(n+1),t=t.substring(0,n)):r<0&&(r=t.length),n=0;48===t.charCodeAt(n);n++);for(i=t.length;48===t.charCodeAt(i-1);--i);if(t=t.slice(n,i)){if(i-=n,e.e=r=r-n-1,e.d=[],n=(r+1)%7,r<0&&(n+=7),n<i){for(n&&e.d.push(+t.slice(0,n)),i-=7;n<i;)e.d.push(+t.slice(n,n+=7));n=7-(t=t.slice(n)).length}else n-=i;for(;n--;)t+="0";e.d.push(+t),m&&(e.e>e.constructor.maxE?(e.d=null,e.e=NaN):e.e<e.constructor.minE&&(e.e=0,e.d=[0]))}else e.e=0,e.d=[0];return e}function G(e,t){var r,n,i,o,s,u,c,f,l;if(t.indexOf("_")>-1){if(t=t.replace(/(\d)_(?=\d)/g,"$1"),w.test(t))return H(e,t)}else if("Infinity"===t||"NaN"===t)return+t||(e.s=NaN),e.e=NaN,e.d=null,e;if(x.test(t))r=16,t=t.toLowerCase();else if(g.test(t))r=2;else{if(!b.test(t))throw Error(h+t);r=8}for((o=t.search(/p/i))>0?(c=+t.slice(o+1),t=t.substring(2,o)):t=t.slice(2),s=(o=t.indexOf("."))>=0,n=e.constructor,s&&(o=(u=(t=t.replace(".","")).length)-o,i=j(n,new n(r),o,2*o)),o=l=(f=_(t,r,N)).length-1;0===f[o];--o)f.pop();return o<0?new n(0*e.s):(e.e=z(f,l),e.d=f,m=!1,s&&(e=T(e,i,4*u)),c&&(e=e.times(Math.abs(c)<54?y(2,c):a.pow(2,c))),m=!0,e)}function V(e,t,r,n,i){var a,o,s,u,c=e.precision,f=Math.ceil(c/7);for(m=!1,u=r.times(r),s=new e(n);;){if(o=T(s.times(u),new e(t++*t++),c,1),s=i?n.plus(o):n.minus(o),n=T(o.times(u),new e(t++*t++),c,1),void 0!==(o=s.plus(n)).d[f]){for(a=f;o.d[a]===s.d[a]&&a--;);if(-1==a)break}a=s,s=n,n=o,o=a}return m=!0,o.d.length=f+1,o}function Z(e,t){for(var r=e;--t;)r*=e;return r}function W(e,t){var r,n=t.s<0,i=R(e,e.precision,1),a=i.times(.5);if((t=t.abs()).lte(a))return s=n?4:1,t;if((r=t.divToInt(i)).isZero())s=n?3:2;else{if((t=t.minus(r.times(i))).lte(a))return s=P(r)?n?2:3:n?4:1,t;s=P(r)?n?1:4:n?3:2}return t.minus(i).abs()}function Y(e,t,r,n){var i,a,s,u,f,l,p,m,h,d=e.constructor,v=void 0!==r;if(v?(O(r,1,1e9),void 0===n?n=d.rounding:O(n,0,8)):(r=d.precision,n=d.rounding),e.isFinite()){for(v?(i=2,16==t?r=4*r-3:8==t&&(r=3*r-2)):i=t,(s=(p=k(e)).indexOf("."))>=0&&(p=p.replace(".",""),(h=new d(1)).e=p.length-s,h.d=_(k(h),10,i),h.e=h.d.length),a=f=(m=_(p,10,i)).length;0==m[--f];)m.pop();if(m[0]){if(s<0?a--:((e=new d(e)).d=m,e.e=a,m=(e=T(e,h,r,n,0,i)).d,a=e.e,l=o),s=m[r],u=i/2,l=l||void 0!==m[r+1],l=n<4?(void 0!==s||l)&&(0===n||n===(e.s<0?3:2)):s>u||s===u&&(4===n||l||6===n&&1&m[r-1]||n===(e.s<0?8:7)),m.length=r,l)for(;++m[--r]>i-1;)m[r]=0,r||(++a,m.unshift(1));for(f=m.length;!m[f-1];--f);for(s=0,p="";s<f;s++)p+=c.charAt(m[s]);if(v){if(f>1)if(16==t||8==t){for(s=16==t?4:3,--f;f%s;f++)p+="0";for(f=(m=_(p,i,t)).length;!m[f-1];--f);for(s=1,p="1.";s<f;s++)p+=c.charAt(m[s])}else p=p.charAt(0)+"."+p.slice(1);p=p+(a<0?"p":"p+")+a}else if(a<0){for(;++a;)p="0"+p;p="0."+p}else if(++a>f)for(a-=f;a--;)p+="0";else a<f&&(p=p.slice(0,a)+"."+p.slice(a))}else p=v?"0p+0":"0";p=(16==t?"0x":2==t?"0b":8==t?"0o":"")+p}else p=$(e);return e.s<0?"-"+p:p}function J(e,t){if(e.length>t)return e.length=t,!0}function X(e){return new this(e).abs()}function Q(e){return new this(e).acos()}function K(e){return new this(e).acosh()}function ee(e,t){return new this(e).plus(t)}function te(e){return new this(e).asin()}function re(e){return new this(e).asinh()}function ne(e){return new this(e).atan()}function ie(e){return new this(e).atanh()}function ae(e,t){e=new this(e),t=new this(t);var r,n=this.precision,i=this.rounding,a=n+4;return e.s&&t.s?e.d||t.d?!t.d||e.isZero()?(r=t.s<0?R(this,n,i):new this(0)).s=e.s:!e.d||t.isZero()?(r=R(this,a,1).times(.5)).s=e.s:t.s<0?(this.precision=a,this.rounding=1,r=this.atan(T(e,t,a,1)),t=R(this,a,1),this.precision=n,this.rounding=i,r=e.s<0?r.minus(t):r.plus(t)):r=this.atan(T(e,t,a,1)):(r=R(this,a,1).times(t.s>0?.25:.75)).s=e.s:r=new this(NaN),r}function oe(e){return new this(e).cbrt()}function se(e){return I(e=new this(e),e.e+1,2)}function ue(e,t,r){return new this(e).clamp(t,r)}function ce(e){if(!e||"object"!=typeof e)throw Error("[DecimalError] Object expected");var t,r,n,i=!0===e.defaults,a=["precision",1,1e9,"rounding",0,8,"toExpNeg",-u,0,"toExpPos",0,u,"maxE",0,u,"minE",-u,0,"modulo",0,9];for(t=0;t<a.length;t+=3)if(r=a[t],i&&(this[r]=p[r]),void 0!==(n=e[r])){if(!(v(n)===n&&n>=a[t+1]&&n<=a[t+2]))throw Error(h+r+": "+n);this[r]=n}if(r="crypto",i&&(this[r]=p[r]),void 0!==(n=e[r])){if(!0!==n&&!1!==n&&0!==n&&1!==n)throw Error(h+r+": "+n);if(n){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw Error("[DecimalError] crypto unavailable");this[r]=!0}else this[r]=!1}return this}function fe(e){return new this(e).cos()}function le(e){return new this(e).cosh()}function pe(e,t){return new this(e).div(t)}function me(e){return new this(e).exp()}function he(e){return I(e=new this(e),e.e+1,3)}function de(){var e,t,r=new this(0);for(m=!1,e=0;e<arguments.length;)if((t=new this(arguments[e++])).d)r.d&&(r=r.plus(t.times(t)));else{if(t.s)return m=!0,new this(1/0);r=t}return m=!0,r.sqrt()}function ve(e){return e instanceof a||e&&e.toStringTag===d||!1}function ye(e){return new this(e).ln()}function ge(e,t){return new this(e).log(t)}function xe(e){return new this(e).log(2)}function be(e){return new this(e).log(10)}function we(){return F(this,arguments,"lt")}function Ne(){return F(this,arguments,"gt")}function Me(e,t){return new this(e).mod(t)}function Ee(e,t){return new this(e).mul(t)}function Se(e,t){return new this(e).pow(t)}function Ae(e){var t,r,n,i,a=0,o=new this(1),s=[];if(void 0===e?e=this.precision:O(e,1,1e9),n=Math.ceil(e/7),this.crypto)if(crypto.getRandomValues)for(t=crypto.getRandomValues(new Uint32Array(n));a<n;)(i=t[a])>=429e7?t[a]=crypto.getRandomValues(new Uint32Array(1))[0]:s[a++]=i%1e7;else{if(!crypto.randomBytes)throw Error("[DecimalError] crypto unavailable");for(t=crypto.randomBytes(n*=4);a<n;)(i=t[a]+(t[a+1]<<8)+(t[a+2]<<16)+((127&t[a+3])<<24))>=214e7?crypto.randomBytes(4).copy(t,a):(s.push(i%1e7),a+=4);a=n/4}else for(;a<n;)s[a++]=1e7*Math.random()|0;for(e%=7,(n=s[--a])&&e&&(i=y(10,7-e),s[a]=(n/i|0)*i);0===s[a];a--)s.pop();if(a<0)r=0,s=[0];else{for(r=-1;0===s[0];r-=7)s.shift();for(n=1,i=s[0];i>=10;i/=10)n++;n<7&&(r-=7-n)}return o.e=r,o.d=s,o}function Oe(e){return I(e=new this(e),e.e+1,this.rounding)}function Ce(e){return(e=new this(e)).d?e.d[0]?e.s:0*e.s:e.s||NaN}function _e(e){return new this(e).sin()}function Te(e){return new this(e).sinh()}function Ie(e){return new this(e).sqrt()}function ke(e,t){return new this(e).sub(t)}function ze(){var e=0,t=arguments,r=new this(t[e]);for(m=!1;r.s&&++e<t.length;)r=r.plus(t[e]);return m=!0,I(r,this.precision,this.rounding)}function qe(e){return new this(e).tan()}function Re(e){return new this(e).tanh()}function Be(e){return I(e=new this(e),e.e+1,1)}(a=function e(t){var r,n,i;function a(e){var t,r,n,i=this;if(!(i instanceof a))return new a(e);if(i.constructor=a,ve(e))return i.s=e.s,void(m?!e.d||e.e>a.maxE?(i.e=NaN,i.d=null):e.e<a.minE?(i.e=0,i.d=[0]):(i.e=e.e,i.d=e.d.slice()):(i.e=e.e,i.d=e.d?e.d.slice():e.d));if("number"===(n=typeof e)){if(0===e)return i.s=1/e<0?-1:1,i.e=0,void(i.d=[0]);if(e<0?(e=-e,i.s=-1):i.s=1,e===~~e&&e<1e7){for(t=0,r=e;r>=10;r/=10)t++;return void(m?t>a.maxE?(i.e=NaN,i.d=null):t<a.minE?(i.e=0,i.d=[0]):(i.e=t,i.d=[e]):(i.e=t,i.d=[e]))}return 0*e!=0?(e||(i.s=NaN),i.e=NaN,void(i.d=null)):H(i,e.toString())}if("string"!==n)throw Error(h+e);return 45===(r=e.charCodeAt(0))?(e=e.slice(1),i.s=-1):(43===r&&(e=e.slice(1)),i.s=1),w.test(e)?H(i,e):G(i,e)}if(a.prototype=S,a.ROUND_UP=0,a.ROUND_DOWN=1,a.ROUND_CEIL=2,a.ROUND_FLOOR=3,a.ROUND_HALF_UP=4,a.ROUND_HALF_DOWN=5,a.ROUND_HALF_EVEN=6,a.ROUND_HALF_CEIL=7,a.ROUND_HALF_FLOOR=8,a.EUCLID=9,a.config=a.set=ce,a.clone=e,a.isDecimal=ve,a.abs=X,a.acos=Q,a.acosh=K,a.add=ee,a.asin=te,a.asinh=re,a.atan=ne,a.atanh=ie,a.atan2=ae,a.cbrt=oe,a.ceil=se,a.clamp=ue,a.cos=fe,a.cosh=le,a.div=pe,a.exp=me,a.floor=he,a.hypot=de,a.ln=ye,a.log=ge,a.log10=be,a.log2=xe,a.max=we,a.min=Ne,a.mod=Me,a.mul=Ee,a.pow=Se,a.random=Ae,a.round=Oe,a.sign=Ce,a.sin=_e,a.sinh=Te,a.sqrt=Ie,a.sub=ke,a.sum=ze,a.tan=qe,a.tanh=Re,a.trunc=Be,void 0===t&&(t={}),t&&!0!==t.defaults)for(i=["precision","rounding","toExpNeg","toExpPos","maxE","minE","modulo","crypto"],r=0;r<i.length;)t.hasOwnProperty(n=i[r++])||(t[n]=this[n]);return a.config(t),a}(p)).prototype.constructor=a,a.default=a.Decimal=a,f=new a(f),l=new a(l),void 0===(n=function(){return a}.call(t,r,t,e))||(e.exports=n)}()},function(e,t,r){var n;
+/**
+ * @license Fraction.js v4.2.0 05/03/2022
+ * https://www.xarg.org/2014/03/rational-numbers-in-javascript/
+ *
+ * Copyright (c) 2021, Robert Eisele (robert@xarg.org)
+ * Dual licensed under the MIT or GPL Version 2 licenses.
+ **/!function(r){"use strict";var i={s:1,n:0,d:1};function a(e,t){if(isNaN(e=parseInt(e,10)))throw f.InvalidParameter;return e*t}function o(e,t){if(0===t)throw f.DivisionByZero;var r=Object.create(f.prototype);r.s=e<0?-1:1;var n=c(e=e<0?-e:e,t);return r.n=e/n,r.d=t/n,r}function s(e){for(var t={},r=e,n=2,i=4;i<=r;){for(;r%n==0;)r/=n,t[n]=(t[n]||0)+1;i+=1+2*n++}return r!==e?r>1&&(t[r]=(t[r]||0)+1):t[e]=(t[e]||0)+1,t}var u=function(e,t){var r,n=0,o=1,s=1,u=0,c=0,l=0,p=1,m=1,h=0,d=1,v=1,y=1,g=1e7;if(null==e);else if(void 0!==t){if(s=(n=e)*(o=t),n%1!=0||o%1!=0)throw f.NonIntegerParameter}else switch(typeof e){case"object":if("d"in e&&"n"in e)n=e.n,o=e.d,"s"in e&&(n*=e.s);else{if(!(0 in e))throw f.InvalidParameter;n=e[0],1 in e&&(o=e[1])}s=n*o;break;case"number":if(e<0&&(s=e,e=-e),e%1==0)n=e;else if(e>0){for(e>=1&&(e/=m=Math.pow(10,Math.floor(1+Math.log(e)/Math.LN10)));d<=g&&y<=g;){if(e===(r=(h+v)/(d+y))){d+y<=g?(n=h+v,o=d+y):y>d?(n=v,o=y):(n=h,o=d);break}e>r?(h+=v,d+=y):(v+=h,y+=d),d>g?(n=v,o=y):(n=h,o=d)}n*=m}else(isNaN(e)||isNaN(t))&&(o=n=NaN);break;case"string":if(null===(d=e.match(/\d+|./g)))throw f.InvalidParameter;if("-"===d[h]?(s=-1,h++):"+"===d[h]&&h++,d.length===h+1?c=a(d[h++],s):"."===d[h+1]||"."===d[h]?("."!==d[h]&&(u=a(d[h++],s)),(++h+1===d.length||"("===d[h+1]&&")"===d[h+3]||"'"===d[h+1]&&"'"===d[h+3])&&(c=a(d[h],s),p=Math.pow(10,d[h].length),h++),("("===d[h]&&")"===d[h+2]||"'"===d[h]&&"'"===d[h+2])&&(l=a(d[h+1],s),m=Math.pow(10,d[h+1].length)-1,h+=3)):"/"===d[h+1]||":"===d[h+1]?(c=a(d[h],s),p=a(d[h+2],1),h+=3):"/"===d[h+3]&&" "===d[h+1]&&(u=a(d[h],s),c=a(d[h+2],s),p=a(d[h+4],1),h+=5),d.length<=h){s=n=l+(o=p*m)*u+m*c;break}default:throw f.InvalidParameter}if(0===o)throw f.DivisionByZero;i.s=s<0?-1:1,i.n=Math.abs(n),i.d=Math.abs(o)};function c(e,t){if(!e)return t;if(!t)return e;for(;;){if(!(e%=t))return t;if(!(t%=e))return e}}function f(e,t){if(u(e,t),!(this instanceof f))return o(i.s*i.n,i.d);e=c(i.d,i.n),this.s=i.s,this.n=i.n/e,this.d=i.d/e}f.DivisionByZero=new Error("Division by Zero"),f.InvalidParameter=new Error("Invalid argument"),f.NonIntegerParameter=new Error("Parameters must be integer"),f.prototype={s:1,n:0,d:1,abs:function(){return o(this.n,this.d)},neg:function(){return o(-this.s*this.n,this.d)},add:function(e,t){return u(e,t),o(this.s*this.n*i.d+i.s*this.d*i.n,this.d*i.d)},sub:function(e,t){return u(e,t),o(this.s*this.n*i.d-i.s*this.d*i.n,this.d*i.d)},mul:function(e,t){return u(e,t),o(this.s*i.s*this.n*i.n,this.d*i.d)},div:function(e,t){return u(e,t),o(this.s*i.s*this.n*i.d,this.d*i.n)},clone:function(){return o(this.s*this.n,this.d)},mod:function(e,t){if(isNaN(this.n)||isNaN(this.d))return new f(NaN);if(void 0===e)return o(this.s*this.n%this.d,1);if(u(e,t),0===i.n&&0===this.d)throw f.DivisionByZero;return o(this.s*(i.d*this.n)%(i.n*this.d),i.d*this.d)},gcd:function(e,t){return u(e,t),o(c(i.n,this.n)*c(i.d,this.d),i.d*this.d)},lcm:function(e,t){return u(e,t),0===i.n&&0===this.n?o(0,1):o(i.n*this.n,c(i.n,this.n)*c(i.d,this.d))},ceil:function(e){return e=Math.pow(10,e||0),isNaN(this.n)||isNaN(this.d)?new f(NaN):o(Math.ceil(e*this.s*this.n/this.d),e)},floor:function(e){return e=Math.pow(10,e||0),isNaN(this.n)||isNaN(this.d)?new f(NaN):o(Math.floor(e*this.s*this.n/this.d),e)},round:function(e){return e=Math.pow(10,e||0),isNaN(this.n)||isNaN(this.d)?new f(NaN):o(Math.round(e*this.s*this.n/this.d),e)},inverse:function(){return o(this.s*this.d,this.n)},pow:function(e,t){if(u(e,t),1===i.d)return i.s<0?o(Math.pow(this.s*this.d,i.n),Math.pow(this.n,i.n)):o(Math.pow(this.s*this.n,i.n),Math.pow(this.d,i.n));if(this.s<0)return null;var r=s(this.n),n=s(this.d),a=1,c=1;for(var f in r)if("1"!==f){if("0"===f){a=0;break}if(r[f]*=i.n,r[f]%i.d!=0)return null;r[f]/=i.d,a*=Math.pow(f,r[f])}for(var f in n)if("1"!==f){if(n[f]*=i.n,n[f]%i.d!=0)return null;n[f]/=i.d,c*=Math.pow(f,n[f])}return i.s<0?o(c,a):o(a,c)},equals:function(e,t){return u(e,t),this.s*this.n*i.d==i.s*i.n*this.d},compare:function(e,t){u(e,t);var r=this.s*this.n*i.d-i.s*i.n*this.d;return(0<r)-(r<0)},simplify:function(e){if(isNaN(this.n)||isNaN(this.d))return this;e=e||.001;for(var t=this.abs(),r=t.toContinued(),n=1;n<r.length;n++){for(var i=o(r[n-1],1),a=n-2;a>=0;a--)i=i.inverse().add(r[a]);if(i.sub(t).abs().valueOf()<e)return i.mul(this.s)}return this},divisible:function(e,t){return u(e,t),!(!(i.n*this.d)||this.n*i.d%(i.n*this.d))},valueOf:function(){return this.s*this.n/this.d},toFraction:function(e){var t,r="",n=this.n,i=this.d;return this.s<0&&(r+="-"),1===i?r+=n:(e&&(t=Math.floor(n/i))>0&&(r+=t,r+=" ",n%=i),r+=n,r+="/",r+=i),r},toLatex:function(e){var t,r="",n=this.n,i=this.d;return this.s<0&&(r+="-"),1===i?r+=n:(e&&(t=Math.floor(n/i))>0&&(r+=t,n%=i),r+="\\frac{",r+=n,r+="}{",r+=i,r+="}"),r},toContinued:function(){var e,t=this.n,r=this.d,n=[];if(isNaN(t)||isNaN(r))return n;do{n.push(Math.floor(t/r)),e=t%r,t=r,r=e}while(1!==t);return n},toString:function(e){var t=this.n,r=this.d;if(isNaN(t)||isNaN(r))return"NaN";e=e||15;var n=function(e,t){for(;t%2==0;t/=2);for(;t%5==0;t/=5);if(1===t)return 0;for(var r=10%t,n=1;1!==r;n++)if(r=10*r%t,n>2e3)return 0;return n}(0,r),i=function(e,t,r){for(var n=1,i=function(e,t,r){for(var n=1;t>0;e=e*e%r,t>>=1)1&t&&(n=n*e%r);return n}(10,r,t),a=0;a<300;a++){if(n===i)return a;n=10*n%t,i=10*i%t}return 0}(0,r,n),a=this.s<0?"-":"";if(a+=t/r|0,t%=r,(t*=10)&&(a+="."),n){for(var o=i;o--;)a+=t/r|0,t%=r,t*=10;a+="(";for(o=n;o--;)a+=t/r|0,t%=r,t*=10;a+=")"}else for(o=e;t&&o--;)a+=t/r|0,t%=r,t*=10;return a}},void 0===(n=function(){return f}.apply(t,[]))||(e.exports=n)}()},function(e,t){e.exports=function e(t,r){"use strict";var n,i,a=/(^([+\-]?(?:0|[1-9]\d*)(?:\.\d*)?(?:[eE][+\-]?\d+)?)?$|^0x[0-9a-f]+$|\d+)/gi,o=/(^[ ]*|[ ]*$)/g,s=/(^([\w ]+,?[\w ]+)?[\w ]+,?[\w ]+\d+:\d+(:\d+)?[\w ]?|^\d{1,4}[\/\-]\d{1,4}[\/\-]\d{1,4}|^\w+, \w+ \d+, \d{4})/,u=/^0x[0-9a-f]+$/i,c=/^0/,f=function(t){return e.insensitive&&(""+t).toLowerCase()||""+t},l=f(t).replace(o,"")||"",p=f(r).replace(o,"")||"",m=l.replace(a,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),h=p.replace(a,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),d=parseInt(l.match(u),16)||1!==m.length&&l.match(s)&&Date.parse(l),v=parseInt(p.match(u),16)||d&&p.match(s)&&Date.parse(p)||null;if(v){if(d<v)return-1;if(d>v)return 1}for(var y=0,g=Math.max(m.length,h.length);y<g;y++){if(n=!(m[y]||"").match(c)&&parseFloat(m[y])||m[y]||0,i=!(h[y]||"").match(c)&&parseFloat(h[y])||h[y]||0,isNaN(n)!==isNaN(i))return isNaN(n)?1:-1;if(typeof n!=typeof i&&(n+="",i+=""),n<i)return-1;if(n>i)return 1}return 0}},function(e,t,r){var n=r(66);e.exports=function(e,t){var r=e[t];return null==r?void 0:n(r)}},function(e,t,r){var n=r(1),i=r(15),a=r(89),o=n.TypeError;e.exports=function(e){if(i(e))return e;throw o(a(e)+" is not a function")}},function(e,t){e.exports=!1},function(e,t,r){var n=r(142),i=r(108).concat("length","prototype");t.f=Object.getOwnPropertyNames||function(e){return n(e,i)}},function(e,t,r){var n=r(9),i=r(66),a=r(86),o=n(n.bind);e.exports=function(e,t){return i(e),void 0===t?e:a?o(e,t):function(){return e.apply(t,arguments)}}},function(e,t,r){var n,i=r(21),a=r(152),o=r(108),s=r(77),u=r(153),c=r(92),f=r(94),l=f("IE_PROTO"),p=function(){},m=function(e){return"<script>"+e+"<\/script>"},h=function(e){e.write(m("")),e.close();var t=e.parentWindow.Object;return e=null,t},d=function(){try{n=new ActiveXObject("htmlfile")}catch(e){}var e,t;d="undefined"!=typeof document?document.domain&&n?h(n):((t=c("iframe")).style.display="none",u.appendChild(t),t.src=String("javascript:"),(e=t.contentWindow.document).open(),e.write(m("document.F=Object")),e.close(),e.F):h(n);for(var r=o.length;r--;)delete d.prototype[o[r]];return d()};s[l]=!0,e.exports=Object.create||function(e,t){var r;return null!==e?(p.prototype=i(e),r=new p,p.prototype=null,r[l]=e):r=d(),void 0===t?r:a.f(r,t)}},function(e,t,r){"use strict";var n=r(87),i=r(20),a=r(75);e.exports=function(e,t,r){var o=n(t);o in e?i.f(e,o,a(0,r)):e[o]=r}},function(e,t,r){"use strict";var n=r(83),i=r(22),a=r(9),o=r(119),s=r(8),u=r(21),c=r(15),f=r(60),l=r(95),p=r(34),m=r(48),h=r(120),d=r(65),v=r(207),y=r(122),g=r(16)("replace"),x=Math.max,b=Math.min,w=a([].concat),N=a([].push),M=a("".indexOf),E=a("".slice),S="$0"==="a".replace(/./,"$0"),A=!!/./[g]&&""===/./[g]("a","$0");o("replace",(function(e,t,r){var a=A?"$":"$0";return[function(e,r){var n=m(this),a=null==e?void 0:d(e,g);return a?i(a,e,n,r):i(t,p(n),e,r)},function(e,i){var o=u(this),s=p(e);if("string"==typeof i&&-1===M(i,a)&&-1===M(i,"$<")){var m=r(t,o,s,i);if(m.done)return m.value}var d=c(i);d||(i=p(i));var g=o.global;if(g){var S=o.unicode;o.lastIndex=0}for(var A=[];;){var O=y(o,s);if(null===O)break;if(N(A,O),!g)break;""===p(O[0])&&(o.lastIndex=h(s,l(o.lastIndex),S))}for(var C,_="",T=0,I=0;I<A.length;I++){for(var k=p((O=A[I])[0]),z=x(b(f(O.index),s.length),0),q=[],R=1;R<O.length;R++)N(q,void 0===(C=O[R])?C:String(C));var B=O.groups;if(d){var D=w([k],q,z,s);void 0!==B&&N(D,B);var j=p(n(i,void 0,D))}else j=v(k,s,z,q,B,i);z>=T&&(_+=E(s,T,z)+j,T=z+k.length)}return _+E(s,T)}]}),!!s((function(){var e=/./;return e.exec=function(){var e=[];return e.groups={a:"7"},e},"7"!=="".replace(e,"$<a>")}))||!S||A)},function(e,t){e.exports=function(e){return e.webpackPolyfill||(e.deprecate=function(){},e.paths=[],e.children||(e.children=[]),Object.defineProperty(e,"loaded",{enumerable:!0,get:function(){return e.l}}),Object.defineProperty(e,"id",{enumerable:!0,get:function(){return e.i}}),e.webpackPolyfill=1),e}},function(e,t){(function(t){e.exports=t}).call(this,{})},function(e,t){e.exports=function(e,t){return{enumerable:!(1&e),configurable:!(2&e),writable:!(4&e),value:t}}},function(e,t,r){var n,i,a=r(1),o=r(59),s=a.process,u=a.Deno,c=s&&s.versions||u&&u.version,f=c&&c.v8;f&&(i=(n=f.split("."))[0]>0&&n[0]<4?1:+(n[0]+n[1])),!i&&o&&(!(n=o.match(/Edge\/(\d+)/))||n[1]>=74)&&(n=o.match(/Chrome\/(\d+)/))&&(i=+n[1]),e.exports=i},function(e,t){e.exports={}},function(e,t,r){var n=r(18),i=r(26),a=Function.prototype,o=n&&Object.getOwnPropertyDescriptor,s=i(a,"name"),u=s&&"something"===function(){}.name,c=s&&(!n||n&&o(a,"name").configurable);e.exports={EXISTS:s,PROPER:u,CONFIGURABLE:c}},function(e,t,r){var n=r(60),i=Math.max,a=Math.min;e.exports=function(e,t){var r=n(e);return r<0?i(r+t,0):a(r,t)}},function(e,t,r){var n=r(8),i=r(15),a=/#|\.prototype\./,o=function(e,t){var r=u[s(e)];return r==f||r!=c&&(i(t)?n(t):!!t)},s=o.normalize=function(e){return String(e).replace(a,".").toLowerCase()},u=o.data={},c=o.NATIVE="N",f=o.POLYFILL="P";e.exports=o},function(e,t,r){var n=r(69),i=r(9),a=r(104),o=r(35),s=r(45),u=r(111),c=i([].push),f=function(e){var t=1==e,r=2==e,i=3==e,f=4==e,l=6==e,p=7==e,m=5==e||l;return function(h,d,v,y){for(var g,x,b=o(h),w=a(b),N=n(d,v),M=s(w),E=0,S=y||u,A=t?S(h,M):r||p?S(h,0):void 0;M>E;E++)if((m||E in w)&&(x=N(g=w[E],E,b),e))if(t)A[E]=x;else if(x)switch(e){case 3:return!0;case 5:return g;case 6:return E;case 2:c(A,g)}else switch(e){case 4:return!1;case 7:c(A,g)}return l?-1:i||f?f:A}};e.exports={forEach:f(0),map:f(1),filter:f(2),some:f(3),every:f(4),find:f(5),findIndex:f(6),filterReject:f(7)}},function(e,t,r){var n=r(8),i=r(16),a=r(76),o=i("species");e.exports=function(e){return a>=51||!n((function(){var t=[];return(t.constructor={})[o]=function(){return{foo:1}},1!==t[e](Boolean).foo}))}},function(e,t,r){var n=r(86),i=Function.prototype,a=i.apply,o=i.call;e.exports="object"==typeof Reflect&&Reflect.apply||(n?o.bind(a):function(){return o.apply(a,arguments)})},function(e,t){e.exports={}},function(e,t,r){var n=r(20).f,i=r(26),a=r(16)("toStringTag");e.exports=function(e,t,r){e&&!r&&(e=e.prototype),e&&!i(e,a)&&n(e,a,{configurable:!0,value:t})}},function(e,t,r){var n=r(8);e.exports=!n((function(){var e=function(){}.bind();return"function"!=typeof e||e.hasOwnProperty("prototype")}))},function(e,t,r){var n=r(136),i=r(88);e.exports=function(e){var t=n(e,"string");return i(t)?t:t+""}},function(e,t,r){var n=r(1),i=r(49),a=r(15),o=r(52),s=r(137),u=n.Object;e.exports=s?function(e){return"symbol"==typeof e}:function(e){var t=i("Symbol");return a(t)&&o(t.prototype,u(e))}},function(e,t,r){var n=r(1).String;e.exports=function(e){try{return n(e)}catch(e){return"Object"}}},function(e,t,r){var n=r(67),i=r(106);(e.exports=function(e,t){return i[e]||(i[e]=void 0!==t?t:{})})("versions",[]).push({version:"3.21.1",mode:n?"pure":"global",copyright:"© 2014-2022 Denis Pushkarev (zloirock.ru)",license:"https://github.com/zloirock/core-js/blob/v3.21.1/LICENSE",source:"https://github.com/zloirock/core-js"})},function(e,t,r){var n=r(9),i=0,a=Math.random(),o=n(1..toString);e.exports=function(e){return"Symbol("+(void 0===e?"":e)+")_"+o(++i+a,36)}},function(e,t,r){var n=r(1),i=r(23),a=n.document,o=i(a)&&i(a.createElement);e.exports=function(e){return o?a.createElement(e):{}}},function(e,t,r){var n=r(9),i=r(15),a=r(106),o=n(Function.toString);i(a.inspectSource)||(a.inspectSource=function(e){return o(e)}),e.exports=a.inspectSource},function(e,t,r){var n=r(90),i=r(91),a=n("keys");e.exports=function(e){return a[e]||(a[e]=i(e))}},function(e,t,r){var n=r(60),i=Math.min;e.exports=function(e){return e>0?i(n(e),9007199254740991):0}},function(e,t,r){var n=r(1),i=r(110),a=r(15),o=r(43),s=r(16)("toStringTag"),u=n.Object,c="Arguments"==o(function(){return arguments}());e.exports=i?o:function(e){var t,r,n;return void 0===e?"Undefined":null===e?"Null":"string"==typeof(r=function(e,t){try{return e[t]}catch(e){}}(t=u(e),s))?r:c?o(t):"Object"==(n=o(t))&&a(t.callee)?"Arguments":n}},function(e,t,r){var n=r(43);e.exports=Array.isArray||function(e){return"Array"==n(e)}},function(e,t,r){var n=r(9),i=r(8),a=r(15),o=r(96),s=r(49),u=r(93),c=function(){},f=[],l=s("Reflect","construct"),p=/^\s*(?:class|function)\b/,m=n(p.exec),h=!p.exec(c),d=function(e){if(!a(e))return!1;try{return l(c,f,e),!0}catch(e){return!1}},v=function(e){if(!a(e))return!1;switch(o(e)){case"AsyncFunction":case"GeneratorFunction":case"AsyncGeneratorFunction":return!1}try{return h||!!m(p,u(e))}catch(e){return!0}};v.sham=!0,e.exports=!l||i((function(){var e;return d(d.call)||!d(Object)||!d((function(){e=!0}))||e}))?v:d},function(e,t,r){var n=r(8),i=r(1).RegExp,a=n((function(){var e=i("a","y");return e.lastIndex=2,null!=e.exec("abcd")})),o=a||n((function(){return!i("a","y").sticky})),s=a||n((function(){var e=i("^r","gy");return e.lastIndex=2,null!=e.exec("str")}));e.exports={BROKEN_CARET:s,MISSED_STICKY:o,UNSUPPORTED_Y:a}},function(e,t,r){"use strict";var n,i,a=r(22),o=r(9),s=r(34),u=r(116),c=r(99),f=r(90),l=r(70),p=r(44).get,m=r(118),h=r(150),d=f("native-string-replace",String.prototype.replace),v=RegExp.prototype.exec,y=v,g=o("".charAt),x=o("".indexOf),b=o("".replace),w=o("".slice),N=(i=/b*/g,a(v,n=/a/,"a"),a(v,i,"a"),0!==n.lastIndex||0!==i.lastIndex),M=c.BROKEN_CARET,E=void 0!==/()??/.exec("")[1];(N||E||M||m||h)&&(y=function(e){var t,r,n,i,o,c,f,m=this,h=p(m),S=s(e),A=h.raw;if(A)return A.lastIndex=m.lastIndex,t=a(y,A,S),m.lastIndex=A.lastIndex,t;var O=h.groups,C=M&&m.sticky,_=a(u,m),T=m.source,I=0,k=S;if(C&&(_=b(_,"y",""),-1===x(_,"g")&&(_+="g"),k=w(S,m.lastIndex),m.lastIndex>0&&(!m.multiline||m.multiline&&"\n"!==g(S,m.lastIndex-1))&&(T="(?: "+T+")",k=" "+k,I++),r=new RegExp("^(?:"+T+")",_)),E&&(r=new RegExp("^"+T+"$(?!\\s)",_)),N&&(n=m.lastIndex),i=a(v,C?r:m,k),C?i?(i.input=w(i.input,I),i[0]=w(i[0],I),i.index=m.lastIndex,m.lastIndex+=i[0].length):m.lastIndex=0:N&&i&&(m.lastIndex=m.global?i.index+i[0].length:n),E&&i&&i.length>1&&a(d,i[0],r,(function(){for(o=1;o<arguments.length-2;o++)void 0===arguments[o]&&(i[o]=void 0)})),i&&O)for(i.groups=c=l(null),o=0;o<O.length;o++)c[(f=O[o])[0]]=i[f[1]];return i}),e.exports=y},function(e,t){var r=Math.expm1,n=Math.exp;e.exports=!r||r(10)>22025.465794806718||r(10)<22025.465794806718||-2e-17!=r(-2e-17)?function(e){return 0==(e=+e)?e:e>-1e-6&&e<1e-6?e+e*e/2:n(e)-1}:r},function(e,t,r){"use strict";var n=r(22),i=r(119),a=r(21),o=r(95),s=r(34),u=r(48),c=r(65),f=r(120),l=r(122);i("match",(function(e,t,r){return[function(t){var r=u(this),i=null==t?void 0:c(t,e);return i?n(i,t,r):new RegExp(t)[e](s(r))},function(e){var n=a(this),i=s(e),u=r(t,n,i);if(u.done)return u.value;if(!n.global)return l(n,i);var c=n.unicode;n.lastIndex=0;for(var p,m=[],h=0;null!==(p=l(n,i));){var d=s(p[0]);m[h]=d,""===d&&(n.lastIndex=f(i,o(n.lastIndex),c)),h++}return 0===h?null:m}]}))},function(e,t,r){"use strict";var n=r(6),i=r(215);n({target:"String",proto:!0,forced:r(216)("sub")},{sub:function(){return i(this,"sub","","")}})},function(e,t,r){var n=r(1),i=r(9),a=r(8),o=r(43),s=n.Object,u=i("".split);e.exports=a((function(){return!s("z").propertyIsEnumerable(0)}))?function(e){return"String"==o(e)?u(e,""):s(e)}:s},function(e,t,r){var n=r(76),i=r(8);e.exports=!!Object.getOwnPropertySymbols&&!i((function(){var e=Symbol();return!String(e)||!(Object(e)instanceof Symbol)||!Symbol.sham&&n&&n<41}))},function(e,t,r){var n=r(1),i=r(107),a=n["__core-js_shared__"]||i("__core-js_shared__",{});e.exports=a},function(e,t,r){var n=r(1),i=Object.defineProperty;e.exports=function(e,t){try{i(n,e,{value:t,configurable:!0,writable:!0})}catch(r){n[e]=t}return t}},function(e,t){e.exports=["constructor","hasOwnProperty","isPrototypeOf","propertyIsEnumerable","toLocaleString","toString","valueOf"]},function(e,t,r){var n=r(142),i=r(108);e.exports=Object.keys||function(e){return n(e,i)}},function(e,t,r){var n={};n[r(16)("toStringTag")]="z",e.exports="[object z]"===String(n)},function(e,t,r){var n=r(194);e.exports=function(e,t){return new(n(e))(0===t?0:t)}},function(e,t,r){"use strict";var n=r(8);e.exports=function(e,t){var r=[][e];return!!r&&n((function(){r.call(null,t||function(){return 1},1)}))}},function(e,t,r){var n=r(1),i=r(26),a=r(15),o=r(35),s=r(94),u=r(147),c=s("IE_PROTO"),f=n.Object,l=f.prototype;e.exports=u?f.getPrototypeOf:function(e){var t=o(e);if(i(t,c))return t[c];var r=t.constructor;return a(r)&&t instanceof r?r.prototype:t instanceof f?l:null}},function(e,t,r){var n=r(15),i=r(23),a=r(115);e.exports=function(e,t,r){var o,s;return a&&n(o=t.constructor)&&o!==r&&i(s=o.prototype)&&s!==r.prototype&&a(e,s),e}},function(e,t,r){var n=r(9),i=r(21),a=r(195);e.exports=Object.setPrototypeOf||("__proto__"in{}?function(){var e,t=!1,r={};try{(e=n(Object.getOwnPropertyDescriptor(Object.prototype,"__proto__").set))(r,[]),t=r instanceof Array}catch(e){}return function(r,n){return i(r),a(n),t?e(r,n):r.__proto__=n,r}}():void 0)},function(e,t,r){"use strict";var n=r(21);e.exports=function(){var e=n(this),t="";return e.global&&(t+="g"),e.ignoreCase&&(t+="i"),e.multiline&&(t+="m"),e.dotAll&&(t+="s"),e.unicode&&(t+="u"),e.sticky&&(t+="y"),t}},function(e,t,r){"use strict";var n=r(49),i=r(20),a=r(16),o=r(18),s=a("species");e.exports=function(e){var t=n(e),r=i.f;o&&t&&!t[s]&&r(t,s,{configurable:!0,get:function(){return this}})}},function(e,t,r){var n=r(8),i=r(1).RegExp;e.exports=n((function(){var e=i(".","s");return!(e.dotAll&&e.exec("\n")&&"s"===e.flags)}))},function(e,t,r){"use strict";r(10);var n=r(9),i=r(36),a=r(100),o=r(8),s=r(16),u=r(53),c=s("species"),f=RegExp.prototype;e.exports=function(e,t,r,l){var p=s(e),m=!o((function(){var t={};return t[p]=function(){return 7},7!=""[e](t)})),h=m&&!o((function(){var t=!1,r=/a/;return"split"===e&&((r={}).constructor={},r.constructor[c]=function(){return r},r.flags="",r[p]=/./[p]),r.exec=function(){return t=!0,null},r[p](""),!t}));if(!m||!h||r){var d=n(/./[p]),v=t(p,""[e],(function(e,t,r,i,o){var s=n(e),u=t.exec;return u===a||u===f.exec?m&&!o?{done:!0,value:d(t,r,i)}:{done:!0,value:s(r,t,i)}:{done:!1}}));i(String.prototype,e,v[0]),i(f,p,v[1])}l&&u(f[p],"sham",!0)}},function(e,t,r){"use strict";var n=r(156).charAt;e.exports=function(e,t,r){return t+(r?n(e,t).length:1)}},function(e,t,r){var n=r(1),i=r(79),a=r(45),o=r(71),s=n.Array,u=Math.max;e.exports=function(e,t,r){for(var n=a(e),c=i(t,n),f=i(void 0===r?n:r,n),l=s(u(f-c,0)),p=0;c<f;c++,p++)o(l,p,e[c]);return l.length=p,l}},function(e,t,r){var n=r(1),i=r(22),a=r(21),o=r(15),s=r(43),u=r(100),c=n.TypeError;e.exports=function(e,t){var r=e.exec;if(o(r)){var n=i(r,e,t);return null!==n&&a(n),n}if("RegExp"===s(e))return i(u,e,t);throw c("RegExp#exec called on incompatible receiver")}},function(e,t,r){var n=r(9);e.exports=n([].slice)},function(e,t,r){var n=r(16),i=r(70),a=r(20),o=n("unscopables"),s=Array.prototype;null==s[o]&&a.f(s,o,{configurable:!0,value:i(null)}),e.exports=function(e){s[o][e]=!0}},function(e,t,r){"use strict";var n=r(6),i=r(22),a=r(67),o=r(78),s=r(15),u=r(217),c=r(113),f=r(115),l=r(85),p=r(53),m=r(36),h=r(16),d=r(84),v=r(165),y=o.PROPER,g=o.CONFIGURABLE,x=v.IteratorPrototype,b=v.BUGGY_SAFARI_ITERATORS,w=h("iterator"),N=function(){return this};e.exports=function(e,t,r,o,h,v,M){u(r,t,o);var E,S,A,O=function(e){if(e===h&&k)return k;if(!b&&e in T)return T[e];switch(e){case"keys":case"values":case"entries":return function(){return new r(this,e)}}return function(){return new r(this)}},C=t+" Iterator",_=!1,T=e.prototype,I=T[w]||T["@@iterator"]||h&&T[h],k=!b&&I||O(h),z="Array"==t&&T.entries||I;if(z&&(E=c(z.call(new e)))!==Object.prototype&&E.next&&(a||c(E)===x||(f?f(E,x):s(E[w])||m(E,w,N)),l(E,C,!0,!0),a&&(d[C]=N)),y&&"values"==h&&I&&"values"!==I.name&&(!a&&g?p(T,"name","values"):(_=!0,k=function(){return i(I,this)})),h)if(S={values:O("values"),keys:v?k:O("keys"),entries:O("entries")},M)for(A in S)(b||_||!(A in T))&&m(T,A,S[A]);else n({target:t,proto:!0,forced:b||_},S);return a&&!M||T[w]===k||m(T,w,k,{name:h}),d[t]=k,S}},function(e,t,r){var n=r(1),i=r(69),a=r(22),o=r(21),s=r(89),u=r(170),c=r(45),f=r(52),l=r(171),p=r(127),m=r(172),h=n.TypeError,d=function(e,t){this.stopped=e,this.result=t},v=d.prototype;e.exports=function(e,t,r){var n,y,g,x,b,w,N,M=r&&r.that,E=!(!r||!r.AS_ENTRIES),S=!(!r||!r.IS_ITERATOR),A=!(!r||!r.INTERRUPTED),O=i(t,M),C=function(e){return n&&m(n,"normal",e),new d(!0,e)},_=function(e){return E?(o(e),A?O(e[0],e[1],C):O(e[0],e[1])):A?O(e,C):O(e)};if(S)n=e;else{if(!(y=p(e)))throw h(s(e)+" is not iterable");if(u(y)){for(g=0,x=c(e);x>g;g++)if((b=_(e[g]))&&f(v,b))return b;return new d(!1)}n=l(e,y)}for(w=n.next;!(N=a(w,n)).done;){try{b=_(N.value)}catch(e){m(n,"throw",e)}if("object"==typeof b&&b&&f(v,b))return b}return new d(!1)}},function(e,t,r){var n=r(96),i=r(65),a=r(84),o=r(16)("iterator");e.exports=function(e){if(null!=e)return i(e,o)||i(e,"@@iterator")||a[n(e)]}},function(e,t,r){var n=r(1),i=r(52),a=n.TypeError;e.exports=function(e,t){if(i(t,e))return e;throw a("Incorrect invocation")}},function(e,t,r){var n=r(16)("iterator"),i=!1;try{var a=0,o={next:function(){return{done:!!a++}},return:function(){i=!0}};o[n]=function(){return this},Array.from(o,(function(){throw 2}))}catch(e){}e.exports=function(e,t){if(!t&&!i)return!1;var r=!1;try{var a={};a[n]=function(){return{next:function(){return{done:r=!0}}}},e(a)}catch(e){}return r}},function(e,t,r){var n=r(43),i=r(1);e.exports="process"==n(i.process)},function(e,t,r){var n=r(6),i=r(8),a=r(40),o=r(58).f,s=r(18),u=i((function(){o(1)}));n({target:"Object",stat:!0,forced:!s||u,sham:!s},{getOwnPropertyDescriptor:function(e,t){return o(a(e),t)}})},function(e,t,r){var n=r(6),i=r(18),a=r(141),o=r(40),s=r(58),u=r(71);n({target:"Object",stat:!0,sham:!i},{getOwnPropertyDescriptors:function(e){for(var t,r,n=o(e),i=s.f,c=a(n),f={},l=0;c.length>l;)void 0!==(r=i(n,t=c[l++]))&&u(f,t,r);return f}})},function(e,t,r){"use strict";var n,i,a;i=[],void 0===(a="function"==typeof(n=function(){function e(){return!0}function t(){return!1}function r(){}return function n(){var i=[{name:"number",test:function(e){return"number"==typeof e}},{name:"string",test:function(e){return"string"==typeof e}},{name:"boolean",test:function(e){return"boolean"==typeof e}},{name:"Function",test:function(e){return"function"==typeof e}},{name:"Array",test:Array.isArray},{name:"Date",test:function(e){return e instanceof Date}},{name:"RegExp",test:function(e){return e instanceof RegExp}},{name:"Object",test:function(e){return"object"==typeof e&&null!==e&&e.constructor===Object}},{name:"null",test:function(e){return null===e}},{name:"undefined",test:function(e){return void 0===e}}],a={name:"any",test:e},o=[],s=[],u={types:i,conversions:s,ignore:o};function c(e){var t=F(u.types,(function(t){return t.name===e}));if(t)return t;if("any"===e)return a;var r=F(u.types,(function(t){return t.name.toLowerCase()===e.toLowerCase()}));throw new TypeError('Unknown type "'+e+'"'+(r?'. Did you mean "'+r.name+'"?':""))}function f(e){return e===a?999:u.types.indexOf(e)}function l(e){var t=F(u.types,(function(t){return t.test(e)}));if(t)return t.name;throw new TypeError("Value has unknown type. Value: "+e)}function p(e){return e.map((function(e){var t=e.types.map(b);return(e.restParam?"...":"")+t.join("|")})).join(",")}function m(e,t){var r=0===e.indexOf("..."),n=(r?e.length>3?e.slice(3):"any":e).split("|").map(z).filter(q).filter(k),i=function(e,t){var r={};return e.forEach((function(e){-1!==t.indexOf(e.from)||-1===t.indexOf(e.to)||r[e.from]||(r[e.from]=e)})),Object.keys(r).map((function(e){return r[e]}))}(t,n),a=n.map((function(e){var t=c(e);return{name:e,typeIndex:f(t),test:t.test,conversion:null,conversionIndex:-1}})),o=i.map((function(e){var r=c(e.from);return{name:e.from,typeIndex:f(r),test:r.test,conversion:e,conversionIndex:t.indexOf(e)}}));return{types:a.concat(o),restParam:r}}function h(e){var t=D(e);return!!t&&t.restParam}function d(e){return e.types.some((function(e){return null!=e.conversion}))}function v(t){if(t&&0!==t.types.length){if(1===t.types.length)return c(t.types[0].name).test;if(2===t.types.length){var r=c(t.types[0].name).test,n=c(t.types[1].name).test;return function(e){return r(e)||n(e)}}var i=t.types.map((function(e){return c(e.name).test}));return function(e){for(var t=0;t<i.length;t++)if(i[t](e))return!0;return!1}}return e}function y(e){var t,r,n,i;if(h(e)){var a=(t=(i=e,i.slice(0,i.length-1)).map(v)).length,o=v(D(e));return function(e){for(var r=0;r<t.length;r++)if(!t[r](e[r]))return!1;return function(e){for(var t=a;t<e.length;t++)if(!o(e[t]))return!1;return!0}(e)&&e.length>=a+1}}return 0===e.length?function(e){return 0===e.length}:1===e.length?(r=v(e[0]),function(e){return r(e[0])&&1===e.length}):2===e.length?(r=v(e[0]),n=v(e[1]),function(e){return r(e[0])&&n(e[1])&&2===e.length}):(t=e.map(v),function(e){for(var r=0;r<t.length;r++)if(!t[r](e[r]))return!1;return e.length===t.length})}function g(e,t){return t<e.params.length?e.params[t]:h(e.params)?D(e.params):null}function x(e,t,r){var n=g(e,t);return(n?r?n.types.filter(w):n.types:[]).map(b)}function b(e){return e.name}function w(e){return null===e.conversion||void 0===e.conversion}function N(e,t){var r=function(e){for(var t={},r=0;r<e.length;r++)t[e[r]]=!0;return Object.keys(t)}(U(e,(function(e){return x(e,t,!1)})));return-1!==r.indexOf("any")?["any"]:r}function M(e,t,r){var n,i,a,o=e||"unnamed",s=r;for(a=0;a<t.length;a++){var u=s.filter((function(e){var r=v(g(e,a));return(a<e.params.length||h(e.params))&&r(t[a])}));if(0===u.length){if((i=N(s,a)).length>0){var c=l(t[a]);return(n=new TypeError("Unexpected type of argument in function "+o+" (expected: "+i.join(" or ")+", actual: "+c+", index: "+a+")")).data={category:"wrongType",fn:o,index:a,actual:c,expected:i},n}}else s=u}var f=s.map((function(e){return h(e.params)?1/0:e.params.length}));if(t.length<Math.min.apply(null,f))return i=N(s,a),(n=new TypeError("Too few arguments in function "+o+" (expected: "+i.join(" or ")+", index: "+t.length+")")).data={category:"tooFewArgs",fn:o,index:t.length,expected:i},n;var p=Math.max.apply(null,f);return t.length>p?((n=new TypeError("Too many arguments in function "+o+" (expected: "+p+", actual: "+t.length+")")).data={category:"tooManyArgs",fn:o,index:t.length,expectedLength:p},n):((n=new TypeError('Arguments of type "'+t.join(", ")+'" do not match any of the defined signatures of function '+o+".")).data={category:"mismatch",actual:t.map(l)},n)}function E(e){for(var t=999,r=0;r<e.types.length;r++)w(e.types[r])&&(t=Math.min(t,e.types[r].typeIndex));return t}function S(e){for(var t=999,r=0;r<e.types.length;r++)w(e.types[r])||(t=Math.min(t,e.types[r].conversionIndex));return t}function A(e,t){var r;return 0!=(r=e.restParam-t.restParam)||0!=(r=d(e)-d(t))||0!=(r=E(e)-E(t))?r:S(e)-S(t)}function O(e,t){var r,n,i=Math.min(e.params.length,t.params.length);if(0!=(n=e.params.some(d)-t.params.some(d)))return n;for(r=0;r<i;r++)if(0!=(n=d(e.params[r])-d(t.params[r])))return n;for(r=0;r<i;r++)if(0!==(n=A(e.params[r],t.params[r])))return n;return e.params.length-t.params.length}function C(e){var t,r,n,i,a=[],o=[];switch(e.types.forEach((function(e){e.conversion&&(a.push(c(e.conversion.from).test),o.push(e.conversion.convert))})),o.length){case 0:return function(e){return e};case 1:return t=a[0],n=o[0],function(e){return t(e)?n(e):e};case 2:return t=a[0],r=a[1],n=o[0],i=o[1],function(e){return t(e)?n(e):r(e)?i(e):e};default:return function(e){for(var t=0;t<o.length;t++)if(a[t](e))return o[t](e);return e}}}function _(e,t){return function e(r,n,i){if(n<r.length){var a,o=r[n],s=t?o.types.filter(w):o.types;if(o.restParam){var u=s.filter(w);a=u.length<s.length?[u,s]:[s]}else a=s.map((function(e){return[e]}));return U(a,(function(t){return e(r,n+1,i.concat([t]))}))}return[i.map((function(e,t){return{types:e,restParam:t===r.length-1&&h(r)}}))]}(e,0,[])}function T(e,n){if(0===Object.keys(n).length)throw new SyntaxError("No signatures provided");var i=[];Object.keys(n).map((function(e){return function(e,t,r){var n=[];return""!==e.trim()&&(n=e.split(",").map(z).map((function(e,t,n){var i=m(e,r);if(i.restParam&&t!==n.length-1)throw new SyntaxError('Unexpected rest parameter "'+e+'": only allowed for the last parameter');return i}))),n.some(B)?null:{params:n,fn:t}}(e,n[e],u.conversions)})).filter(R).forEach((function(e){var t=F(i,(function(t){return function(e,t){for(var r=Math.max(e.params.length,t.params.length),n=0;n<r;n++)if(!P(x(e,n,!0),x(t,n,!0)))return!1;var i=e.params.length,a=t.params.length,o=h(e.params),s=h(t.params);return o?s?i===a:a>=i:s?i>=a:i===a}(t,e)}));if(t)throw new TypeError('Conflicting signatures "'+p(t.params)+'" and "'+p(e.params)+'".');i.push(e)}));var a=U(i,(function(e){return(e?_(e.params,!1):[]).map((function(t){return{params:t,fn:e.fn}}))})).filter(R);a.sort(O);var o=a[0]&&a[0].params.length<=2&&!h(a[0].params),s=a[1]&&a[1].params.length<=2&&!h(a[1].params),c=a[2]&&a[2].params.length<=2&&!h(a[2].params),f=a[3]&&a[3].params.length<=2&&!h(a[3].params),l=a[4]&&a[4].params.length<=2&&!h(a[4].params),g=a[5]&&a[5].params.length<=2&&!h(a[5].params),b=o&&s&&c&&f&&l&&g,w=a.map((function(e){return y(e.params)})),N=o?v(a[0].params[0]):t,M=s?v(a[1].params[0]):t,E=c?v(a[2].params[0]):t,S=f?v(a[3].params[0]):t,A=l?v(a[4].params[0]):t,T=g?v(a[5].params[0]):t,I=o?v(a[0].params[1]):t,k=s?v(a[1].params[1]):t,q=c?v(a[2].params[1]):t,D=f?v(a[3].params[1]):t,L=l?v(a[4].params[1]):t,$=g?v(a[5].params[1]):t,H=a.map((function(e){return function(e,t){var r=t;if(e.some(d)){var n=h(e),i=e.map(C);r=function(){for(var e=[],r=n?arguments.length-1:arguments.length,a=0;a<r;a++)e[a]=i[a](arguments[a]);return n&&(e[r]=arguments[r].map(i[r])),t.apply(this,e)}}var a=r;if(h(e)){var o=e.length-1;a=function(){return r.apply(this,j(arguments,0,o).concat([j(arguments,o)]))}}return a}(e.params,e.fn)})),G=o?H[0]:r,V=s?H[1]:r,Z=c?H[2]:r,W=f?H[3]:r,Y=l?H[4]:r,J=g?H[5]:r,X=o?a[0].params.length:-1,Q=s?a[1].params.length:-1,K=c?a[2].params.length:-1,ee=f?a[3].params.length:-1,te=l?a[4].params.length:-1,re=g?a[5].params.length:-1,ne=b?6:0,ie=a.length,ae=function(){for(var t=ne;t<ie;t++)if(w[t](arguments))return H[t].apply(this,arguments);return u.onMismatch(e,arguments,a)},oe=function e(t,r){return arguments.length===X&&N(t)&&I(r)?G.apply(e,arguments):arguments.length===Q&&M(t)&&k(r)?V.apply(e,arguments):arguments.length===K&&E(t)&&q(r)?Z.apply(e,arguments):arguments.length===ee&&S(t)&&D(r)?W.apply(e,arguments):arguments.length===te&&A(t)&&L(r)?Y.apply(e,arguments):arguments.length===re&&T(t)&&$(r)?J.apply(e,arguments):ae.apply(e,arguments)};try{Object.defineProperty(oe,"name",{value:e})}catch(e){}return oe.signatures=function(e){var t={};return e.forEach((function(e){e.params.some(d)||_(e.params,!0).forEach((function(r){t[p(r)]=e.fn}))})),t}(a),oe}function I(e,t,r){throw M(e,t,r)}function k(e){return-1===u.ignore.indexOf(e)}function z(e){return e.trim()}function q(e){return!!e}function R(e){return null!==e}function B(e){return 0===e.types.length}function D(e){return e[e.length-1]}function j(e,t,r){return Array.prototype.slice.call(e,t,r)}function P(e,t){for(var r=0;r<e.length;r++)if(n=t,i=e[r],-1!==n.indexOf(i))return!0;var n,i;return!1}function F(e,t){for(var r=0;r<e.length;r++)if(t(e[r]))return e[r]}function U(e,t){return Array.prototype.concat.apply([],e.map(t))}function L(e){for(var t="",r=0;r<e.length;r++){var n=e[r];if(("object"==typeof n.signatures||"string"==typeof n.signature)&&""!==n.name)if(""===t)t=n.name;else if(t!==n.name){var i=new Error("Function names do not match (expected: "+t+", actual: "+n.name+")");throw i.data={actual:n.name,expected:t},i}}return t}function $(e){var t,r={};function n(e,n){if(r.hasOwnProperty(e)&&n!==r[e])throw(t=new Error('Signature "'+e+'" is defined twice')).data={signature:e},t}for(var i=0;i<e.length;i++){var a=e[i];if("object"==typeof a.signatures)for(var o in a.signatures)a.signatures.hasOwnProperty(o)&&(n(o,a.signatures[o]),r[o]=a.signatures[o]);else{if("string"!=typeof a.signature)throw(t=new TypeError("Function is no typed-function (index: "+i+")")).data={index:i},t;n(a.signature,a),r[a.signature]=a}}return r}return(u=T("typed",{"string, Object":T,Object:function(e){var t=[];for(var r in e)e.hasOwnProperty(r)&&t.push(e[r]);return T(L(t),e)},"...Function":function(e){return T(L(e),$(e))},"string, ...Function":function(e,t){return T(e,$(t))}})).create=n,u.types=i,u.conversions=s,u.ignore=o,u.onMismatch=I,u.throwMismatchError=I,u.createError=M,u.convert=function(e,t){var r=l(e);if(t===r)return e;for(var n=0;n<u.conversions.length;n++){var i=u.conversions[n];if(i.from===r&&i.to===t)return i.convert(e)}throw new Error("Cannot convert from "+r+" to "+t)},u.find=function(e,t){if(!e.signatures)throw new TypeError("Function is no typed-function");var r;if("string"==typeof t){r=t.split(",");for(var n=0;n<r.length;n++)r[n]=r[n].trim()}else{if(!Array.isArray(t))throw new TypeError("String array or a comma separated string expected");r=t}var i=r.join(","),a=e.signatures[i];if(a)return a;throw new TypeError("Signature not found (signature: "+(e.name||"unnamed")+"("+r.join(", ")+"))")},u.addType=function(e,t){if(!e||"string"!=typeof e.name||"function"!=typeof e.test)throw new TypeError("Object with properties {name: string, test: function} expected");if(!1!==t)for(var r=0;r<u.types.length;r++)if("Object"===u.types[r].name)return void u.types.splice(r,0,e);u.types.push(e)},u.addConversion=function(e){if(!e||"string"!=typeof e.from||"string"!=typeof e.to||"function"!=typeof e.convert)throw new TypeError("Object with properties {from: string, to: string, convert: function} expected");u.conversions.push(e)},u}()})?n.apply(t,i):n)||(e.exports=a)},function(e,t,r){var n=r(245),i=r(246),a=r(247),o=r(248),s=r(249),u=r(250),c=r(251);c.alea=n,c.xor128=i,c.xorwow=a,c.xorshift7=o,c.xor4096=s,c.tychei=u,e.exports=c},function(e,t,r){"use strict";var n={}.propertyIsEnumerable,i=Object.getOwnPropertyDescriptor,a=i&&!n.call({1:2},1);t.f=a?function(e){var t=i(this,e);return!!t&&t.enumerable}:n},function(e,t,r){var n=r(1),i=r(22),a=r(23),o=r(88),s=r(65),u=r(189),c=r(16),f=n.TypeError,l=c("toPrimitive");e.exports=function(e,t){if(!a(e)||o(e))return e;var r,n=s(e,l);if(n){if(void 0===t&&(t="default"),r=i(n,e,t),!a(r)||o(r))return r;throw f("Can't convert object to primitive value")}return void 0===t&&(t="number"),u(e,t)}},function(e,t,r){var n=r(105);e.exports=n&&!Symbol.sham&&"symbol"==typeof Symbol.iterator},function(e,t,r){var n=r(18),i=r(8),a=r(92);e.exports=!n&&!i((function(){return 7!=Object.defineProperty(a("div"),"a",{get:function(){return 7}}).a}))},function(e,t,r){var n=r(18),i=r(8);e.exports=n&&i((function(){return 42!=Object.defineProperty((function(){}),"prototype",{value:42,writable:!1}).prototype}))},function(e,t,r){var n=r(26),i=r(141),a=r(58),o=r(20);e.exports=function(e,t,r){for(var s=i(t),u=o.f,c=a.f,f=0;f<s.length;f++){var l=s[f];n(e,l)||r&&n(r,l)||u(e,l,c(t,l))}}},function(e,t,r){var n=r(49),i=r(9),a=r(68),o=r(143),s=r(21),u=i([].concat);e.exports=n("Reflect","ownKeys")||function(e){var t=a.f(s(e)),r=o.f;return r?u(t,r(e)):t}},function(e,t,r){var n=r(9),i=r(26),a=r(40),o=r(191).indexOf,s=r(77),u=n([].push);e.exports=function(e,t){var r,n=a(e),c=0,f=[];for(r in n)!i(s,r)&&i(n,r)&&u(f,r);for(;t.length>c;)i(n,r=t[c++])&&(~o(f,r)||u(f,r));return f}},function(e,t){t.f=Object.getOwnPropertySymbols},function(e,t){e.exports={CSSRuleList:0,CSSStyleDeclaration:0,CSSValueList:0,ClientRectList:0,DOMRectList:0,DOMStringList:0,DOMTokenList:1,DataTransferItemList:0,FileList:0,HTMLAllCollection:0,HTMLCollection:0,HTMLFormElement:0,HTMLSelectElement:0,MediaList:0,MimeTypeArray:0,NamedNodeMap:0,NodeList:1,PaintRequestList:0,Plugin:0,PluginArray:0,SVGLengthList:0,SVGNumberList:0,SVGPathSegList:0,SVGPointList:0,SVGStringList:0,SVGTransformList:0,SourceBufferList:0,StyleSheetList:0,TextTrackCueList:0,TextTrackList:0,TouchList:0}},function(e,t,r){var n=r(92)("span").classList,i=n&&n.constructor&&n.constructor.prototype;e.exports=i===Object.prototype?void 0:i},function(e,t,r){var n=r(6),i=r(8),a=r(35),o=r(113),s=r(147);n({target:"Object",stat:!0,forced:i((function(){o(1)})),sham:!s},{getPrototypeOf:function(e){return o(a(e))}})},function(e,t,r){var n=r(8);e.exports=!n((function(){function e(){}return e.prototype.constructor=null,Object.getPrototypeOf(new e)!==e.prototype}))},function(e,t,r){var n=r(18),i=r(1),a=r(9),o=r(80),s=r(114),u=r(53),c=r(20).f,f=r(68).f,l=r(52),p=r(149),m=r(34),h=r(116),d=r(99),v=r(36),y=r(8),g=r(26),x=r(44).enforce,b=r(117),w=r(16),N=r(118),M=r(150),E=w("match"),S=i.RegExp,A=S.prototype,O=i.SyntaxError,C=a(h),_=a(A.exec),T=a("".charAt),I=a("".replace),k=a("".indexOf),z=a("".slice),q=/^\?<[^\s\d!#%&*+<=>@^][^\s!#%&*+<=>@^]*>/,R=/a/g,B=/a/g,D=new S(R)!==R,j=d.MISSED_STICKY,P=d.UNSUPPORTED_Y,F=n&&(!D||j||N||M||y((function(){return B[E]=!1,S(R)!=R||S(B)==B||"/a/i"!=S(R,"i")})));if(o("RegExp",F)){for(var U=function(e,t){var r,n,i,a,o,c,f=l(A,this),h=p(e),d=void 0===t,v=[],y=e;if(!f&&h&&d&&e.constructor===U)return e;if((h||l(A,e))&&(e=e.source,d&&(t="flags"in y?y.flags:C(y))),e=void 0===e?"":m(e),t=void 0===t?"":m(t),y=e,N&&"dotAll"in R&&(n=!!t&&k(t,"s")>-1)&&(t=I(t,/s/g,"")),r=t,j&&"sticky"in R&&(i=!!t&&k(t,"y")>-1)&&P&&(t=I(t,/y/g,"")),M&&(e=(a=function(e){for(var t,r=e.length,n=0,i="",a=[],o={},s=!1,u=!1,c=0,f="";n<=r;n++){if("\\"===(t=T(e,n)))t+=T(e,++n);else if("]"===t)s=!1;else if(!s)switch(!0){case"["===t:s=!0;break;case"("===t:_(q,z(e,n+1))&&(n+=2,u=!0),i+=t,c++;continue;case">"===t&&u:if(""===f||g(o,f))throw new O("Invalid capture group name");o[f]=!0,a[a.length]=[f,c],u=!1,f="";continue}u?f+=t:i+=t}return[i,a]}(e))[0],v=a[1]),o=s(S(e,t),f?this:A,U),(n||i||v.length)&&(c=x(o),n&&(c.dotAll=!0,c.raw=U(function(e){for(var t,r=e.length,n=0,i="",a=!1;n<=r;n++)"\\"!==(t=T(e,n))?a||"."!==t?("["===t?a=!0:"]"===t&&(a=!1),i+=t):i+="[\\s\\S]":i+=t+T(e,++n);return i}(e),r)),i&&(c.sticky=!0),v.length&&(c.groups=v)),e!==y)try{u(o,"source",""===y?"(?:)":y)}catch(e){}return o},L=function(e){e in U||c(U,e,{configurable:!0,get:function(){return S[e]},set:function(t){S[e]=t}})},$=f(S),H=0;$.length>H;)L($[H++]);A.constructor=U,U.prototype=A,v(i,"RegExp",U)}b("RegExp")},function(e,t,r){var n=r(23),i=r(43),a=r(16)("match");e.exports=function(e){var t;return n(e)&&(void 0!==(t=e[a])?!!t:"RegExp"==i(e))}},function(e,t,r){var n=r(8),i=r(1).RegExp;e.exports=n((function(){var e=i("(?<a>b)","g");return"b"!==e.exec("b").groups.a||"bc"!=="b".replace(e,"$<a>c")}))},function(e,t,r){var n=r(1),i=r(18),a=r(118),o=r(43),s=r(20).f,u=r(44).get,c=RegExp.prototype,f=n.TypeError;i&&a&&s(c,"dotAll",{configurable:!0,get:function(){if(this!==c){if("RegExp"===o(this))return!!u(this).dotAll;throw f("Incompatible receiver, RegExp required")}}})},function(e,t,r){var n=r(18),i=r(139),a=r(20),o=r(21),s=r(40),u=r(109);t.f=n&&!i?Object.defineProperties:function(e,t){o(e);for(var r,n=s(t),i=u(t),c=i.length,f=0;c>f;)a.f(e,r=i[f++],n[r]);return e}},function(e,t,r){var n=r(49);e.exports=n("document","documentElement")},function(e,t,r){var n=r(1),i=r(18),a=r(99).MISSED_STICKY,o=r(43),s=r(20).f,u=r(44).get,c=RegExp.prototype,f=n.TypeError;i&&a&&s(c,"sticky",{configurable:!0,get:function(){if(this!==c){if("RegExp"===o(this))return!!u(this).sticky;throw f("Incompatible receiver, RegExp required")}}})},function(e,t,r){var n=r(21),i=r(196),a=r(16)("species");e.exports=function(e,t){var r,o=n(e).constructor;return void 0===o||null==(r=n(o)[a])?t:i(r)}},function(e,t,r){var n=r(9),i=r(60),a=r(34),o=r(48),s=n("".charAt),u=n("".charCodeAt),c=n("".slice),f=function(e){return function(t,r){var n,f,l=a(o(t)),p=i(r),m=l.length;return p<0||p>=m?e?"":void 0:(n=u(l,p))<55296||n>56319||p+1===m||(f=u(l,p+1))<56320||f>57343?e?s(l,p):n:e?c(l,p,p+2):f-56320+(n-55296<<10)+65536}};e.exports={codeAt:f(!1),charAt:f(!0)}},function(e,t){e.exports=Math.sign||function(e){return 0==(e=+e)||e!=e?e:e<0?-1:1}},function(e,t,r){var n=r(6),i=Math.log,a=Math.LN2;n({target:"Math",stat:!0},{log2:function(e){return i(e)/a}})},function(e,t){var r=Math.log;e.exports=Math.log1p||function(e){return(e=+e)>-1e-8&&e<1e-8?e-e*e/2:r(1+e)}},function(e,t,r){var n=r(9);e.exports=n(1..valueOf)},function(e,t,r){var n=r(9),i=r(48),a=r(34),o=r(162),s=n("".replace),u="["+o+"]",c=RegExp("^"+u+u+"*"),f=RegExp(u+u+"*$"),l=function(e){return function(t){var r=a(i(t));return 1&e&&(r=s(r,c,"")),2&e&&(r=s(r,f,"")),r}};e.exports={start:l(1),end:l(2),trim:l(3)}},function(e,t){e.exports="\t\n\v\f\r                　\u2028\u2029\ufeff"},function(e,t,r){"use strict";var n=r(6),i=r(1),a=r(9),o=r(60),s=r(160),u=r(164),c=r(8),f=i.RangeError,l=i.String,p=Math.floor,m=a(u),h=a("".slice),d=a(1..toFixed),v=function(e,t,r){return 0===t?r:t%2==1?v(e,t-1,r*e):v(e*e,t/2,r)},y=function(e,t,r){for(var n=-1,i=r;++n<6;)i+=t*e[n],e[n]=i%1e7,i=p(i/1e7)},g=function(e,t){for(var r=6,n=0;--r>=0;)n+=e[r],e[r]=p(n/t),n=n%t*1e7},x=function(e){for(var t=6,r="";--t>=0;)if(""!==r||0===t||0!==e[t]){var n=l(e[t]);r=""===r?n:r+m("0",7-n.length)+n}return r};n({target:"Number",proto:!0,forced:c((function(){return"0.000"!==d(8e-5,3)||"1"!==d(.9,0)||"1.25"!==d(1.255,2)||"1000000000000000128"!==d(0xde0b6b3a7640080,0)}))||!c((function(){d({})}))},{toFixed:function(e){var t,r,n,i,a=s(this),u=o(e),c=[0,0,0,0,0,0],p="",d="0";if(u<0||u>20)throw f("Incorrect fraction digits");if(a!=a)return"NaN";if(a<=-1e21||a>=1e21)return l(a);if(a<0&&(p="-",a=-a),a>1e-21)if(r=(t=function(e){for(var t=0,r=e;r>=4096;)t+=12,r/=4096;for(;r>=2;)t+=1,r/=2;return t}(a*v(2,69,1))-69)<0?a*v(2,-t,1):a/v(2,t,1),r*=4503599627370496,(t=52-t)>0){for(y(c,0,r),n=u;n>=7;)y(c,1e7,0),n-=7;for(y(c,v(10,n,1),0),n=t-1;n>=23;)g(c,1<<23),n-=23;g(c,1<<n),y(c,1,1),g(c,2),d=x(c)}else y(c,0,r),y(c,1<<-t,0),d=x(c)+m("0",u);return d=u>0?p+((i=d.length)<=u?"0."+m("0",u-i)+d:h(d,0,i-u)+"."+h(d,i-u)):p+d}})},function(e,t,r){"use strict";var n=r(1),i=r(60),a=r(34),o=r(48),s=n.RangeError;e.exports=function(e){var t=a(o(this)),r="",n=i(e);if(n<0||n==1/0)throw s("Wrong number of repetitions");for(;n>0;(n>>>=1)&&(t+=t))1&n&&(r+=t);return r}},function(e,t,r){"use strict";var n,i,a,o=r(8),s=r(15),u=r(70),c=r(113),f=r(36),l=r(16),p=r(67),m=l("iterator"),h=!1;[].keys&&("next"in(a=[].keys())?(i=c(c(a)))!==Object.prototype&&(n=i):h=!0),null==n||o((function(){var e={};return n[m].call(e)!==e}))?n={}:p&&(n=u(n)),s(n[m])||f(n,m,(function(){return this})),e.exports={IteratorPrototype:n,BUGGY_SAFARI_ITERATORS:h}},function(e,t,r){"use strict";r(167)("Map",(function(e){return function(){return e(this,arguments.length?arguments[0]:void 0)}}),r(173))},function(e,t,r){"use strict";var n=r(6),i=r(1),a=r(9),o=r(80),s=r(36),u=r(168),c=r(126),f=r(128),l=r(15),p=r(23),m=r(8),h=r(129),d=r(85),v=r(114);e.exports=function(e,t,r){var y=-1!==e.indexOf("Map"),g=-1!==e.indexOf("Weak"),x=y?"set":"add",b=i[e],w=b&&b.prototype,N=b,M={},E=function(e){var t=a(w[e]);s(w,e,"add"==e?function(e){return t(this,0===e?0:e),this}:"delete"==e?function(e){return!(g&&!p(e))&&t(this,0===e?0:e)}:"get"==e?function(e){return g&&!p(e)?void 0:t(this,0===e?0:e)}:"has"==e?function(e){return!(g&&!p(e))&&t(this,0===e?0:e)}:function(e,r){return t(this,0===e?0:e,r),this})};if(o(e,!l(b)||!(g||w.forEach&&!m((function(){(new b).entries().next()})))))N=r.getConstructor(t,e,y,x),u.enable();else if(o(e,!0)){var S=new N,A=S[x](g?{}:-0,1)!=S,O=m((function(){S.has(1)})),C=h((function(e){new b(e)})),_=!g&&m((function(){for(var e=new b,t=5;t--;)e[x](t,t);return!e.has(-0)}));C||((N=t((function(e,t){f(e,w);var r=v(new b,e,N);return null!=t&&c(t,r[x],{that:r,AS_ENTRIES:y}),r}))).prototype=w,w.constructor=N),(O||_)&&(E("delete"),E("has"),y&&E("get")),(_||A)&&E(x),g&&w.clear&&delete w.clear}return M[e]=N,n({global:!0,forced:N!=b},M),d(N,e),g||r.setStrong(N,e,y),N}},function(e,t,r){var n=r(6),i=r(9),a=r(77),o=r(23),s=r(26),u=r(20).f,c=r(68),f=r(169),l=r(218),p=r(91),m=r(220),h=!1,d=p("meta"),v=0,y=function(e){u(e,d,{value:{objectID:"O"+v++,weakData:{}}})},g=e.exports={enable:function(){g.enable=function(){},h=!0;var e=c.f,t=i([].splice),r={};r[d]=1,e(r).length&&(c.f=function(r){for(var n=e(r),i=0,a=n.length;i<a;i++)if(n[i]===d){t(n,i,1);break}return n},n({target:"Object",stat:!0,forced:!0},{getOwnPropertyNames:f.f}))},fastKey:function(e,t){if(!o(e))return"symbol"==typeof e?e:("string"==typeof e?"S":"P")+e;if(!s(e,d)){if(!l(e))return"F";if(!t)return"E";y(e)}return e[d].objectID},getWeakData:function(e,t){if(!s(e,d)){if(!l(e))return!0;if(!t)return!1;y(e)}return e[d].weakData},onFreeze:function(e){return m&&h&&l(e)&&!s(e,d)&&y(e),e}};a[d]=!0},function(e,t,r){var n=r(43),i=r(40),a=r(68).f,o=r(121),s="object"==typeof window&&window&&Object.getOwnPropertyNames?Object.getOwnPropertyNames(window):[];e.exports.f=function(e){return s&&"Window"==n(e)?function(e){try{return a(e)}catch(e){return o(s)}}(e):a(i(e))}},function(e,t,r){var n=r(16),i=r(84),a=n("iterator"),o=Array.prototype;e.exports=function(e){return void 0!==e&&(i.Array===e||o[a]===e)}},function(e,t,r){var n=r(1),i=r(22),a=r(66),o=r(21),s=r(89),u=r(127),c=n.TypeError;e.exports=function(e,t){var r=arguments.length<2?u(e):t;if(a(r))return o(i(r,e));throw c(s(e)+" is not iterable")}},function(e,t,r){var n=r(22),i=r(21),a=r(65);e.exports=function(e,t,r){var o,s;i(e);try{if(!(o=a(e,"return"))){if("throw"===t)throw r;return r}o=n(o,e)}catch(e){s=!0,o=e}if("throw"===t)throw r;if(s)throw o;return i(o),r}},function(e,t,r){"use strict";var n=r(20).f,i=r(70),a=r(174),o=r(69),s=r(128),u=r(126),c=r(125),f=r(117),l=r(18),p=r(168).fastKey,m=r(44),h=m.set,d=m.getterFor;e.exports={getConstructor:function(e,t,r,c){var f=e((function(e,n){s(e,m),h(e,{type:t,index:i(null),first:void 0,last:void 0,size:0}),l||(e.size=0),null!=n&&u(n,e[c],{that:e,AS_ENTRIES:r})})),m=f.prototype,v=d(t),y=function(e,t,r){var n,i,a=v(e),o=g(e,t);return o?o.value=r:(a.last=o={index:i=p(t,!0),key:t,value:r,previous:n=a.last,next:void 0,removed:!1},a.first||(a.first=o),n&&(n.next=o),l?a.size++:e.size++,"F"!==i&&(a.index[i]=o)),e},g=function(e,t){var r,n=v(e),i=p(t);if("F"!==i)return n.index[i];for(r=n.first;r;r=r.next)if(r.key==t)return r};return a(m,{clear:function(){for(var e=v(this),t=e.index,r=e.first;r;)r.removed=!0,r.previous&&(r.previous=r.previous.next=void 0),delete t[r.index],r=r.next;e.first=e.last=void 0,l?e.size=0:this.size=0},delete:function(e){var t=v(this),r=g(this,e);if(r){var n=r.next,i=r.previous;delete t.index[r.index],r.removed=!0,i&&(i.next=n),n&&(n.previous=i),t.first==r&&(t.first=n),t.last==r&&(t.last=i),l?t.size--:this.size--}return!!r},forEach:function(e){for(var t,r=v(this),n=o(e,arguments.length>1?arguments[1]:void 0);t=t?t.next:r.first;)for(n(t.value,t.key,this);t&&t.removed;)t=t.previous},has:function(e){return!!g(this,e)}}),a(m,r?{get:function(e){var t=g(this,e);return t&&t.value},set:function(e,t){return y(this,0===e?0:e,t)}}:{add:function(e){return y(this,e=0===e?0:e,e)}}),l&&n(m,"size",{get:function(){return v(this).size}}),f},setStrong:function(e,t,r){var n=t+" Iterator",i=d(t),a=d(n);c(e,t,(function(e,t){h(this,{type:n,target:e,state:i(e),kind:t,last:void 0})}),(function(){for(var e=a(this),t=e.kind,r=e.last;r&&r.removed;)r=r.previous;return e.target&&(e.last=r=r?r.next:e.state.first)?"keys"==t?{value:r.key,done:!1}:"values"==t?{value:r.value,done:!1}:{value:[r.key,r.value],done:!1}:(e.target=void 0,{value:void 0,done:!0})}),r?"entries":"values",!r,!0),f(t)}}},function(e,t,r){var n=r(36);e.exports=function(e,t,r){for(var i in t)n(e,i,t[i],r);return e}},function(e,t,r){var n=r(16);t.f=n},function(e,t,r){var n=r(223),i=r(26),a=r(175),o=r(20).f;e.exports=function(e){var t=n.Symbol||(n.Symbol={});i(t,e)||o(t,e,{value:a.f(e)})}},function(e,t,r){var n,i,a,o,s=r(1),u=r(83),c=r(69),f=r(15),l=r(26),p=r(8),m=r(153),h=r(123),d=r(92),v=r(225),y=r(178),g=r(130),x=s.setImmediate,b=s.clearImmediate,w=s.process,N=s.Dispatch,M=s.Function,E=s.MessageChannel,S=s.String,A=0,O={};try{n=s.location}catch(e){}var C=function(e){if(l(O,e)){var t=O[e];delete O[e],t()}},_=function(e){return function(){C(e)}},T=function(e){C(e.data)},I=function(e){s.postMessage(S(e),n.protocol+"//"+n.host)};x&&b||(x=function(e){v(arguments.length,1);var t=f(e)?e:M(e),r=h(arguments,1);return O[++A]=function(){u(t,void 0,r)},i(A),A},b=function(e){delete O[e]},g?i=function(e){w.nextTick(_(e))}:N&&N.now?i=function(e){N.now(_(e))}:E&&!y?(o=(a=new E).port2,a.port1.onmessage=T,i=c(o.postMessage,o)):s.addEventListener&&f(s.postMessage)&&!s.importScripts&&n&&"file:"!==n.protocol&&!p(I)?(i=I,s.addEventListener("message",T,!1)):i="onreadystatechange"in d("script")?function(e){m.appendChild(d("script")).onreadystatechange=function(){m.removeChild(this),C(e)}}:function(e){setTimeout(_(e),0)}),e.exports={set:x,clear:b}},function(e,t,r){var n=r(59);e.exports=/(?:ipad|iphone|ipod).*applewebkit/i.test(n)},function(e,t,r){"use strict";var n=r(66),i=function(e){var t,r;this.promise=new e((function(e,n){if(void 0!==t||void 0!==r)throw TypeError("Bad Promise constructor");t=e,r=n})),this.resolve=n(t),this.reject=n(r)};e.exports.f=function(e){return new i(e)}},function(e,t,r){r(6)({target:"Number",stat:!0},{isNaN:function(e){return e!=e}})},function(e,t,r){var n=r(182);e.exports=function(e,t){if(e){if("string"==typeof e)return n(e,t);var r=Object.prototype.toString.call(e).slice(8,-1);return"Object"===r&&e.constructor&&(r=e.constructor.name),"Map"===r||"Set"===r?Array.from(e):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?n(e,t):void 0}},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t){e.exports=function(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=new Array(t);r<t;r++)n[r]=e[r];return n},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){"use strict";r(167)("Set",(function(e){return function(){return e(this,arguments.length?arguments[0]:void 0)}}),r(173))},function(e,t){function r(){}r.prototype={on:function(e,t,r){var n=this.e||(this.e={});return(n[e]||(n[e]=[])).push({fn:t,ctx:r}),this},once:function(e,t,r){var n=this;function i(){n.off(e,i),t.apply(r,arguments)}return i._=t,this.on(e,i,r)},emit:function(e){for(var t=[].slice.call(arguments,1),r=((this.e||(this.e={}))[e]||[]).slice(),n=0,i=r.length;n<i;n++)r[n].fn.apply(r[n].ctx,t);return this},off:function(e,t){var r=this.e||(this.e={}),n=r[e],i=[];if(n&&t)for(var a=0,o=n.length;a<o;a++)n[a].fn!==t&&n[a].fn._!==t&&i.push(n[a]);return i.length?r[e]=i:delete r[e],this}},e.exports=r,e.exports.TinyEmitter=r},function(e,t){e.exports=function(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t){function r(e,t){for(var r=0;r<t.length;r++){var n=t[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}e.exports=function(e,t,n){return t&&r(e.prototype,t),n&&r(e,n),Object.defineProperty(e,"prototype",{writable:!1}),e},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){"use strict";var n=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(e[n]=r[n])}return e},i={"{":"\\{","}":"\\}","\\":"\\textbackslash{}","#":"\\#",$:"\\$","%":"\\%","&":"\\&","^":"\\textasciicircum{}",_:"\\_","~":"\\textasciitilde{}"},a={"–":"\\--","—":"\\---"," ":"~","\t":"\\qquad{}","\r\n":"\\newline{}","\n":"\\newline{}"},o=function(e,t){return n({},e,t)};e.exports=function(e){for(var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},r=t.preserveFormatting,s=void 0!==r&&r,u=t.escapeMapFn,c=void 0===u?o:u,f=String(e),l="",p=c(n({},i),s?n({},a):{}),m=Object.keys(p),h=function(){var e=!1;m.forEach((function(t,r){e||f.length>=t.length&&f.slice(0,t.length)===t&&(l+=p[m[r]],f=f.slice(t.length,f.length),e=!0)})),e||(l+=f.slice(0,1),f=f.slice(1,f.length))};f;)h();return l}},function(e,t){var r;r=function(){return this}();try{r=r||new Function("return this")()}catch(e){"object"==typeof window&&(r=window)}e.exports=r},function(e,t,r){var n=r(1),i=r(22),a=r(15),o=r(23),s=n.TypeError;e.exports=function(e,t){var r,n;if("string"===t&&a(r=e.toString)&&!o(n=i(r,e)))return n;if(a(r=e.valueOf)&&!o(n=i(r,e)))return n;if("string"!==t&&a(r=e.toString)&&!o(n=i(r,e)))return n;throw s("Can't convert object to primitive value")}},function(e,t,r){var n=r(1),i=r(15),a=r(93),o=n.WeakMap;e.exports=i(o)&&/native code/.test(a(o))},function(e,t,r){var n=r(40),i=r(79),a=r(45),o=function(e){return function(t,r,o){var s,u=n(t),c=a(u),f=i(o,c);if(e&&r!=r){for(;c>f;)if((s=u[f++])!=s)return!0}else for(;c>f;f++)if((e||f in u)&&u[f]===r)return e||f||0;return!e&&-1}};e.exports={includes:o(!0),indexOf:o(!1)}},function(e,t,r){"use strict";var n=r(110),i=r(96);e.exports=n?{}.toString:function(){return"[object "+i(this)+"]"}},function(e,t,r){"use strict";var n=r(81).forEach,i=r(112)("forEach");e.exports=i?[].forEach:function(e){return n(this,e,arguments.length>1?arguments[1]:void 0)}},function(e,t,r){var n=r(1),i=r(97),a=r(98),o=r(23),s=r(16)("species"),u=n.Array;e.exports=function(e){var t;return i(e)&&(t=e.constructor,(a(t)&&(t===u||i(t.prototype))||o(t)&&null===(t=t[s]))&&(t=void 0)),void 0===t?u:t}},function(e,t,r){var n=r(1),i=r(15),a=n.String,o=n.TypeError;e.exports=function(e){if("object"==typeof e||i(e))return e;throw o("Can't set "+a(e)+" as a prototype")}},function(e,t,r){var n=r(1),i=r(98),a=r(89),o=n.TypeError;e.exports=function(e){if(i(e))return e;throw o(a(e)+" is not a constructor")}},function(e,t,r){var n=r(121),i=Math.floor,a=function(e,t){var r=e.length,u=i(r/2);return r<8?o(e,t):s(e,a(n(e,0,u),t),a(n(e,u),t),t)},o=function(e,t){for(var r,n,i=e.length,a=1;a<i;){for(n=a,r=e[a];n&&t(e[n-1],r)>0;)e[n]=e[--n];n!==a++&&(e[n]=r)}return e},s=function(e,t,r,n){for(var i=t.length,a=r.length,o=0,s=0;o<i||s<a;)e[o+s]=o<i&&s<a?n(t[o],r[s])<=0?t[o++]:r[s++]:o<i?t[o++]:r[s++];return e};e.exports=a},function(e,t,r){var n=r(59).match(/firefox\/(\d+)/i);e.exports=!!n&&+n[1]},function(e,t,r){var n=r(59);e.exports=/MSIE|Trident/.test(n)},function(e,t,r){var n=r(59).match(/AppleWebKit\/(\d+)\./);e.exports=!!n&&+n[1]},function(e,t,r){r(6)({target:"Math",stat:!0},{sign:r(157)})},function(e,t,r){r(6)({target:"Math",stat:!0},{log10:r(203)})},function(e,t){var r=Math.log,n=Math.LOG10E;e.exports=Math.log10||function(e){return r(e)*n}},function(e,t,r){r(6)({target:"Math",stat:!0},{log1p:r(159)})},function(e,t,r){var n=r(6),i=r(157),a=Math.abs,o=Math.pow;n({target:"Math",stat:!0},{cbrt:function(e){return i(e=+e)*o(a(e),1/3)}})},function(e,t,r){var n=r(6),i=r(101);n({target:"Math",stat:!0,forced:i!=Math.expm1},{expm1:i})},function(e,t,r){var n=r(9),i=r(35),a=Math.floor,o=n("".charAt),s=n("".replace),u=n("".slice),c=/\$([$&'`]|\d{1,2}|<[^>]*>)/g,f=/\$([$&'`]|\d{1,2})/g;e.exports=function(e,t,r,n,l,p){var m=r+e.length,h=n.length,d=f;return void 0!==l&&(l=i(l),d=c),s(p,d,(function(i,s){var c;switch(o(s,0)){case"$":return"$";case"&":return e;case"`":return u(t,0,r);case"'":return u(t,m);case"<":c=l[u(s,1,-1)];break;default:var f=+s;if(0===f)return i;if(f>h){var p=a(f/10);return 0===p?i:p<=h?void 0===n[p-1]?o(s,1):n[p-1]+o(s,1):i}c=n[f-1]}return void 0===c?"":c}))}},function(e,t,r){r(6)({target:"Number",stat:!0},{EPSILON:Math.pow(2,-52)})},function(e,t,r){var n=r(6),i=r(159),a=Math.acosh,o=Math.log,s=Math.sqrt,u=Math.LN2;n({target:"Math",stat:!0,forced:!a||710!=Math.floor(a(Number.MAX_VALUE))||a(1/0)!=1/0},{acosh:function(e){return(e=+e)<1?NaN:e>94906265.62425156?o(e)+u:i(e-1+s(e-1)*s(e+1))}})},function(e,t,r){var n=r(6),i=Math.asinh,a=Math.log,o=Math.sqrt;n({target:"Math",stat:!0,forced:!(i&&1/i(0)>0)},{asinh:function e(t){return isFinite(t=+t)&&0!=t?t<0?-e(-t):a(t+o(t*t+1)):t}})},function(e,t,r){var n=r(6),i=Math.atanh,a=Math.log;n({target:"Math",stat:!0,forced:!(i&&1/i(-0)<0)},{atanh:function(e){return 0==(e=+e)?e:a((1+e)/(1-e))/2}})},function(e,t,r){var n=r(6),i=r(101),a=Math.cosh,o=Math.abs,s=Math.E;n({target:"Math",stat:!0,forced:!a||a(710)===1/0},{cosh:function(e){var t=i(o(e)-1)+1;return(t+1/(t*s*s))*(s/2)}})},function(e,t,r){var n=r(6),i=r(8),a=r(101),o=Math.abs,s=Math.exp,u=Math.E;n({target:"Math",stat:!0,forced:i((function(){return-2e-17!=Math.sinh(-2e-17)}))},{sinh:function(e){return o(e=+e)<1?(a(e)-a(-e))/2:(s(e-1)-s(-e-1))*(u/2)}})},function(e,t,r){var n=r(6),i=r(101),a=Math.exp;n({target:"Math",stat:!0},{tanh:function(e){var t=i(e=+e),r=i(-e);return t==1/0?1:r==1/0?-1:(t-r)/(a(e)+a(-e))}})},function(e,t,r){var n=r(9),i=r(48),a=r(34),o=/"/g,s=n("".replace);e.exports=function(e,t,r,n){var u=a(i(e)),c="<"+t;return""!==r&&(c+=" "+r+'="'+s(a(n),o,"&quot;")+'"'),c+">"+u+"</"+t+">"}},function(e,t,r){var n=r(8);e.exports=function(e){return n((function(){var t=""[e]('"');return t!==t.toLowerCase()||t.split('"').length>3}))}},function(e,t,r){"use strict";var n=r(165).IteratorPrototype,i=r(70),a=r(75),o=r(85),s=r(84),u=function(){return this};e.exports=function(e,t,r,c){var f=t+" Iterator";return e.prototype=i(n,{next:a(+!c,r)}),o(e,f,!1,!0),s[f]=u,e}},function(e,t,r){var n=r(8),i=r(23),a=r(43),o=r(219),s=Object.isExtensible,u=n((function(){s(1)}));e.exports=u||o?function(e){return!!i(e)&&((!o||"ArrayBuffer"!=a(e))&&(!s||s(e)))}:s},function(e,t,r){var n=r(8);e.exports=n((function(){if("function"==typeof ArrayBuffer){var e=new ArrayBuffer(8);Object.isExtensible(e)&&Object.defineProperty(e,"a",{value:8})}}))},function(e,t,r){var n=r(8);e.exports=!n((function(){return Object.isExtensible(Object.preventExtensions({}))}))},function(e,t,r){"use strict";var n=r(1),i=r(69),a=r(22),o=r(35),s=r(222),u=r(170),c=r(98),f=r(45),l=r(71),p=r(171),m=r(127),h=n.Array;e.exports=function(e){var t=o(e),r=c(this),n=arguments.length,d=n>1?arguments[1]:void 0,v=void 0!==d;v&&(d=i(d,n>2?arguments[2]:void 0));var y,g,x,b,w,N,M=m(t),E=0;if(!M||this==h&&u(M))for(y=f(t),g=r?new this(y):h(y);y>E;E++)N=v?d(t[E],E):t[E],l(g,E,N);else for(w=(b=p(t,M)).next,g=r?new this:[];!(x=a(w,b)).done;E++)N=v?s(b,d,[x.value,E],!0):x.value,l(g,E,N);return g.length=E,g}},function(e,t,r){var n=r(21),i=r(172);e.exports=function(e,t,r,a){try{return a?t(n(r)[0],r[1]):t(r)}catch(t){i(e,"throw",t)}}},function(e,t,r){var n=r(1);e.exports=n},function(e,t,r){var n=r(1);e.exports=n.Promise},function(e,t,r){var n=r(1).TypeError;e.exports=function(e,t){if(e<t)throw n("Not enough arguments");return e}},function(e,t,r){var n,i,a,o,s,u,c,f,l=r(1),p=r(69),m=r(58).f,h=r(177).set,d=r(178),v=r(227),y=r(228),g=r(130),x=l.MutationObserver||l.WebKitMutationObserver,b=l.document,w=l.process,N=l.Promise,M=m(l,"queueMicrotask"),E=M&&M.value;E||(n=function(){var e,t;for(g&&(e=w.domain)&&e.exit();i;){t=i.fn,i=i.next;try{t()}catch(e){throw i?o():a=void 0,e}}a=void 0,e&&e.enter()},d||g||y||!x||!b?!v&&N&&N.resolve?((c=N.resolve(void 0)).constructor=N,f=p(c.then,c),o=function(){f(n)}):g?o=function(){w.nextTick(n)}:(h=p(h,l),o=function(){h(n)}):(s=!0,u=b.createTextNode(""),new x(n).observe(u,{characterData:!0}),o=function(){u.data=s=!s})),e.exports=E||function(e){var t={fn:e,next:void 0};a&&(a.next=t),i||(i=t,o()),a=t}},function(e,t,r){var n=r(59),i=r(1);e.exports=/ipad|iphone|ipod/i.test(n)&&void 0!==i.Pebble},function(e,t,r){var n=r(59);e.exports=/web0s(?!.*chrome)/i.test(n)},function(e,t,r){var n=r(21),i=r(23),a=r(179);e.exports=function(e,t){if(n(e),i(t)&&t.constructor===e)return t;var r=a.f(e);return(0,r.resolve)(t),r.promise}},function(e,t,r){var n=r(1);e.exports=function(e,t){var r=n.console;r&&r.error&&(1==arguments.length?r.error(e):r.error(e,t))}},function(e,t){e.exports=function(e){try{return{error:!1,value:e()}}catch(e){return{error:!0,value:e}}}},function(e,t){var r=function(){this.head=null,this.tail=null};r.prototype={add:function(e){var t={item:e,next:null};this.head?this.tail.next=t:this.head=t,this.tail=t},get:function(){var e=this.head;if(e)return this.head=e.next,this.tail===e&&(this.tail=null),e.item}},e.exports=r},function(e,t){e.exports="object"==typeof window},function(e,t,r){var n=function(e){"use strict";var t=Object.prototype,r=t.hasOwnProperty,n="function"==typeof Symbol?Symbol:{},i=n.iterator||"@@iterator",a=n.asyncIterator||"@@asyncIterator",o=n.toStringTag||"@@toStringTag";function s(e,t,r){return Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}),e[t]}try{s({},"")}catch(e){s=function(e,t,r){return e[t]=r}}function u(e,t,r,n){var i=t&&t.prototype instanceof l?t:l,a=Object.create(i.prototype),o=new M(n||[]);return a._invoke=function(e,t,r){var n="suspendedStart";return function(i,a){if("executing"===n)throw new Error("Generator is already running");if("completed"===n){if("throw"===i)throw a;return S()}for(r.method=i,r.arg=a;;){var o=r.delegate;if(o){var s=b(o,r);if(s){if(s===f)continue;return s}}if("next"===r.method)r.sent=r._sent=r.arg;else if("throw"===r.method){if("suspendedStart"===n)throw n="completed",r.arg;r.dispatchException(r.arg)}else"return"===r.method&&r.abrupt("return",r.arg);n="executing";var u=c(e,t,r);if("normal"===u.type){if(n=r.done?"completed":"suspendedYield",u.arg===f)continue;return{value:u.arg,done:r.done}}"throw"===u.type&&(n="completed",r.method="throw",r.arg=u.arg)}}}(e,r,o),a}function c(e,t,r){try{return{type:"normal",arg:e.call(t,r)}}catch(e){return{type:"throw",arg:e}}}e.wrap=u;var f={};function l(){}function p(){}function m(){}var h={};s(h,i,(function(){return this}));var d=Object.getPrototypeOf,v=d&&d(d(E([])));v&&v!==t&&r.call(v,i)&&(h=v);var y=m.prototype=l.prototype=Object.create(h);function g(e){["next","throw","return"].forEach((function(t){s(e,t,(function(e){return this._invoke(t,e)}))}))}function x(e,t){var n;this._invoke=function(i,a){function o(){return new t((function(n,o){!function n(i,a,o,s){var u=c(e[i],e,a);if("throw"!==u.type){var f=u.arg,l=f.value;return l&&"object"==typeof l&&r.call(l,"__await")?t.resolve(l.__await).then((function(e){n("next",e,o,s)}),(function(e){n("throw",e,o,s)})):t.resolve(l).then((function(e){f.value=e,o(f)}),(function(e){return n("throw",e,o,s)}))}s(u.arg)}(i,a,n,o)}))}return n=n?n.then(o,o):o()}}function b(e,t){var r=e.iterator[t.method];if(void 0===r){if(t.delegate=null,"throw"===t.method){if(e.iterator.return&&(t.method="return",t.arg=void 0,b(e,t),"throw"===t.method))return f;t.method="throw",t.arg=new TypeError("The iterator does not provide a 'throw' method")}return f}var n=c(r,e.iterator,t.arg);if("throw"===n.type)return t.method="throw",t.arg=n.arg,t.delegate=null,f;var i=n.arg;return i?i.done?(t[e.resultName]=i.value,t.next=e.nextLoc,"return"!==t.method&&(t.method="next",t.arg=void 0),t.delegate=null,f):i:(t.method="throw",t.arg=new TypeError("iterator result is not an object"),t.delegate=null,f)}function w(e){var t={tryLoc:e[0]};1 in e&&(t.catchLoc=e[1]),2 in e&&(t.finallyLoc=e[2],t.afterLoc=e[3]),this.tryEntries.push(t)}function N(e){var t=e.completion||{};t.type="normal",delete t.arg,e.completion=t}function M(e){this.tryEntries=[{tryLoc:"root"}],e.forEach(w,this),this.reset(!0)}function E(e){if(e){var t=e[i];if(t)return t.call(e);if("function"==typeof e.next)return e;if(!isNaN(e.length)){var n=-1,a=function t(){for(;++n<e.length;)if(r.call(e,n))return t.value=e[n],t.done=!1,t;return t.value=void 0,t.done=!0,t};return a.next=a}}return{next:S}}function S(){return{value:void 0,done:!0}}return p.prototype=m,s(y,"constructor",m),s(m,"constructor",p),p.displayName=s(m,o,"GeneratorFunction"),e.isGeneratorFunction=function(e){var t="function"==typeof e&&e.constructor;return!!t&&(t===p||"GeneratorFunction"===(t.displayName||t.name))},e.mark=function(e){return Object.setPrototypeOf?Object.setPrototypeOf(e,m):(e.__proto__=m,s(e,o,"GeneratorFunction")),e.prototype=Object.create(y),e},e.awrap=function(e){return{__await:e}},g(x.prototype),s(x.prototype,a,(function(){return this})),e.AsyncIterator=x,e.async=function(t,r,n,i,a){void 0===a&&(a=Promise);var o=new x(u(t,r,n,i),a);return e.isGeneratorFunction(r)?o:o.next().then((function(e){return e.done?e.value:o.next()}))},g(y),s(y,o,"Generator"),s(y,i,(function(){return this})),s(y,"toString",(function(){return"[object Generator]"})),e.keys=function(e){var t=[];for(var r in e)t.push(r);return t.reverse(),function r(){for(;t.length;){var n=t.pop();if(n in e)return r.value=n,r.done=!1,r}return r.done=!0,r}},e.values=E,M.prototype={constructor:M,reset:function(e){if(this.prev=0,this.next=0,this.sent=this._sent=void 0,this.done=!1,this.delegate=null,this.method="next",this.arg=void 0,this.tryEntries.forEach(N),!e)for(var t in this)"t"===t.charAt(0)&&r.call(this,t)&&!isNaN(+t.slice(1))&&(this[t]=void 0)},stop:function(){this.done=!0;var e=this.tryEntries[0].completion;if("throw"===e.type)throw e.arg;return this.rval},dispatchException:function(e){if(this.done)throw e;var t=this;function n(r,n){return o.type="throw",o.arg=e,t.next=r,n&&(t.method="next",t.arg=void 0),!!n}for(var i=this.tryEntries.length-1;i>=0;--i){var a=this.tryEntries[i],o=a.completion;if("root"===a.tryLoc)return n("end");if(a.tryLoc<=this.prev){var s=r.call(a,"catchLoc"),u=r.call(a,"finallyLoc");if(s&&u){if(this.prev<a.catchLoc)return n(a.catchLoc,!0);if(this.prev<a.finallyLoc)return n(a.finallyLoc)}else if(s){if(this.prev<a.catchLoc)return n(a.catchLoc,!0)}else{if(!u)throw new Error("try statement without catch or finally");if(this.prev<a.finallyLoc)return n(a.finallyLoc)}}}},abrupt:function(e,t){for(var n=this.tryEntries.length-1;n>=0;--n){var i=this.tryEntries[n];if(i.tryLoc<=this.prev&&r.call(i,"finallyLoc")&&this.prev<i.finallyLoc){var a=i;break}}a&&("break"===e||"continue"===e)&&a.tryLoc<=t&&t<=a.finallyLoc&&(a=null);var o=a?a.completion:{};return o.type=e,o.arg=t,a?(this.method="next",this.next=a.finallyLoc,f):this.complete(o)},complete:function(e,t){if("throw"===e.type)throw e.arg;return"break"===e.type||"continue"===e.type?this.next=e.arg:"return"===e.type?(this.rval=this.arg=e.arg,this.method="return",this.next="end"):"normal"===e.type&&t&&(this.next=t),f},finish:function(e){for(var t=this.tryEntries.length-1;t>=0;--t){var r=this.tryEntries[t];if(r.finallyLoc===e)return this.complete(r.completion,r.afterLoc),N(r),f}},catch:function(e){for(var t=this.tryEntries.length-1;t>=0;--t){var r=this.tryEntries[t];if(r.tryLoc===e){var n=r.completion;if("throw"===n.type){var i=n.arg;N(r)}return i}}throw new Error("illegal catch attempt")},delegateYield:function(e,t,r){return this.delegate={iterator:E(e),resultName:t,nextLoc:r},"next"===this.method&&(this.arg=void 0),f}},e}(e.exports);try{regeneratorRuntime=n}catch(e){"object"==typeof globalThis?globalThis.regeneratorRuntime=n:Function("r","regeneratorRuntime = r")(n)}},function(e,t,r){"use strict";var n=r(6),i=r(161).trim;n({target:"String",proto:!0,forced:r(236)("trim")},{trim:function(){return i(this)}})},function(e,t,r){var n=r(78).PROPER,i=r(8),a=r(162);e.exports=function(e){return i((function(){return!!a[e]()||"​…᠎"!=="​…᠎"[e]()||n&&a[e].name!==e}))}},function(e,t){e.exports=function(e){if(Array.isArray(e))return e},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t){e.exports=function(e,t){var r=null==e?null:"undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(null!=r){var n,i,a=[],o=!0,s=!1;try{for(r=r.call(e);!(o=(n=r.next()).done)&&(a.push(n.value),!t||a.length!==t);o=!0);}catch(e){s=!0,i=e}finally{try{o||null==r.return||r.return()}finally{if(s)throw i}}return a}},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t){e.exports=function(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){var n=r(182);e.exports=function(e){if(Array.isArray(e))return n(e)},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t){e.exports=function(e){if("undefined"!=typeof Symbol&&null!=e[Symbol.iterator]||null!=e["@@iterator"])return Array.from(e)},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t){e.exports=function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")},e.exports.__esModule=!0,e.exports.default=e.exports},function(e,t,r){var n=r(6),i=r(244),a=r(124);n({target:"Array",proto:!0},{fill:i}),a("fill")},function(e,t,r){"use strict";var n=r(35),i=r(79),a=r(45);e.exports=function(e){for(var t=n(this),r=a(t),o=arguments.length,s=i(o>1?arguments[1]:void 0,r),u=o>2?arguments[2]:void 0,c=void 0===u?r:i(u,r);c>s;)t[s++]=e;return t}},function(e,t,r){(function(e){var n;!function(e,i,a){function o(e){var t,r=this,n=(t=4022871197,function(e){e=String(e);for(var r=0;r<e.length;r++){var n=.02519603282416938*(t+=e.charCodeAt(r));n-=t=n>>>0,t=(n*=t)>>>0,t+=4294967296*(n-=t)}return 2.3283064365386963e-10*(t>>>0)});r.next=function(){var e=2091639*r.s0+2.3283064365386963e-10*r.c;return r.s0=r.s1,r.s1=r.s2,r.s2=e-(r.c=0|e)},r.c=1,r.s0=n(" "),r.s1=n(" "),r.s2=n(" "),r.s0-=n(e),r.s0<0&&(r.s0+=1),r.s1-=n(e),r.s1<0&&(r.s1+=1),r.s2-=n(e),r.s2<0&&(r.s2+=1),n=null}function s(e,t){return t.c=e.c,t.s0=e.s0,t.s1=e.s1,t.s2=e.s2,t}function u(e,t){var r=new o(e),n=t&&t.state,i=r.next;return i.int32=function(){return 4294967296*r.next()|0},i.double=function(){return i()+11102230246251565e-32*(2097152*i()|0)},i.quick=i,n&&("object"==typeof n&&s(n,r),i.state=function(){return s(r,{})}),i}i&&i.exports?i.exports=u:r(39)&&r(74)?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.alea=u}(0,e,r(39))}).call(this,r(73)(e))},function(e,t,r){(function(e){var n;!function(e,i,a){function o(e){var t=this,r="";t.x=0,t.y=0,t.z=0,t.w=0,t.next=function(){var e=t.x^t.x<<11;return t.x=t.y,t.y=t.z,t.z=t.w,t.w^=t.w>>>19^e^e>>>8},e===(0|e)?t.x=e:r+=e;for(var n=0;n<r.length+64;n++)t.x^=0|r.charCodeAt(n),t.next()}function s(e,t){return t.x=e.x,t.y=e.y,t.z=e.z,t.w=e.w,t}function u(e,t){var r=new o(e),n=t&&t.state,i=function(){return(r.next()>>>0)/4294967296};return i.double=function(){do{var e=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=r.next,i.quick=i,n&&("object"==typeof n&&s(n,r),i.state=function(){return s(r,{})}),i}i&&i.exports?i.exports=u:r(39)&&r(74)?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xor128=u}(0,e,r(39))}).call(this,r(73)(e))},function(e,t,r){(function(e){var n;!function(e,i,a){function o(e){var t=this,r="";t.next=function(){var e=t.x^t.x>>>2;return t.x=t.y,t.y=t.z,t.z=t.w,t.w=t.v,(t.d=t.d+362437|0)+(t.v=t.v^t.v<<4^e^e<<1)|0},t.x=0,t.y=0,t.z=0,t.w=0,t.v=0,e===(0|e)?t.x=e:r+=e;for(var n=0;n<r.length+64;n++)t.x^=0|r.charCodeAt(n),n==r.length&&(t.d=t.x<<10^t.x>>>4),t.next()}function s(e,t){return t.x=e.x,t.y=e.y,t.z=e.z,t.w=e.w,t.v=e.v,t.d=e.d,t}function u(e,t){var r=new o(e),n=t&&t.state,i=function(){return(r.next()>>>0)/4294967296};return i.double=function(){do{var e=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=r.next,i.quick=i,n&&("object"==typeof n&&s(n,r),i.state=function(){return s(r,{})}),i}i&&i.exports?i.exports=u:r(39)&&r(74)?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xorwow=u}(0,e,r(39))}).call(this,r(73)(e))},function(e,t,r){(function(e){var n;!function(e,i,a){function o(e){var t=this;t.next=function(){var e,r,n=t.x,i=t.i;return e=n[i],r=(e^=e>>>7)^e<<24,r^=(e=n[i+1&7])^e>>>10,r^=(e=n[i+3&7])^e>>>3,r^=(e=n[i+4&7])^e<<7,e=n[i+7&7],r^=(e^=e<<13)^e<<9,n[i]=r,t.i=i+1&7,r},function(e,t){var r,n=[];if(t===(0|t))n[0]=t;else for(t=""+t,r=0;r<t.length;++r)n[7&r]=n[7&r]<<15^t.charCodeAt(r)+n[r+1&7]<<13;for(;n.length<8;)n.push(0);for(r=0;r<8&&0===n[r];++r);for(8==r?n[7]=-1:n[r],e.x=n,e.i=0,r=256;r>0;--r)e.next()}(t,e)}function s(e,t){return t.x=e.x.slice(),t.i=e.i,t}function u(e,t){null==e&&(e=+new Date);var r=new o(e),n=t&&t.state,i=function(){return(r.next()>>>0)/4294967296};return i.double=function(){do{var e=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=r.next,i.quick=i,n&&(n.x&&s(n,r),i.state=function(){return s(r,{})}),i}i&&i.exports?i.exports=u:r(39)&&r(74)?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xorshift7=u}(0,e,r(39))}).call(this,r(73)(e))},function(e,t,r){(function(e){var n;!function(e,i,a){function o(e){var t=this;t.next=function(){var e,r,n=t.w,i=t.X,a=t.i;return t.w=n=n+1640531527|0,r=i[a+34&127],e=i[a=a+1&127],r^=r<<13,e^=e<<17,r^=r>>>15,e^=e>>>12,r=i[a]=r^e,t.i=a,r+(n^n>>>16)|0},function(e,t){var r,n,i,a,o,s=[],u=128;for(t===(0|t)?(n=t,t=null):(t+="\0",n=0,u=Math.max(u,t.length)),i=0,a=-32;a<u;++a)t&&(n^=t.charCodeAt((a+32)%t.length)),0===a&&(o=n),n^=n<<10,n^=n>>>15,n^=n<<4,n^=n>>>13,a>=0&&(o=o+1640531527|0,i=0==(r=s[127&a]^=n+o)?i+1:0);for(i>=128&&(s[127&(t&&t.length||0)]=-1),i=127,a=512;a>0;--a)n=s[i+34&127],r=s[i=i+1&127],n^=n<<13,r^=r<<17,n^=n>>>15,r^=r>>>12,s[i]=n^r;e.w=o,e.X=s,e.i=i}(t,e)}function s(e,t){return t.i=e.i,t.w=e.w,t.X=e.X.slice(),t}function u(e,t){null==e&&(e=+new Date);var r=new o(e),n=t&&t.state,i=function(){return(r.next()>>>0)/4294967296};return i.double=function(){do{var e=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=r.next,i.quick=i,n&&(n.X&&s(n,r),i.state=function(){return s(r,{})}),i}i&&i.exports?i.exports=u:r(39)&&r(74)?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xor4096=u}(0,e,r(39))}).call(this,r(73)(e))},function(e,t,r){(function(e){var n;!function(e,i,a){function o(e){var t=this,r="";t.next=function(){var e=t.b,r=t.c,n=t.d,i=t.a;return e=e<<25^e>>>7^r,r=r-n|0,n=n<<24^n>>>8^i,i=i-e|0,t.b=e=e<<20^e>>>12^r,t.c=r=r-n|0,t.d=n<<16^r>>>16^i,t.a=i-e|0},t.a=0,t.b=0,t.c=-1640531527,t.d=1367130551,e===Math.floor(e)?(t.a=e/4294967296|0,t.b=0|e):r+=e;for(var n=0;n<r.length+20;n++)t.b^=0|r.charCodeAt(n),t.next()}function s(e,t){return t.a=e.a,t.b=e.b,t.c=e.c,t.d=e.d,t}function u(e,t){var r=new o(e),n=t&&t.state,i=function(){return(r.next()>>>0)/4294967296};return i.double=function(){do{var e=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=r.next,i.quick=i,n&&("object"==typeof n&&s(n,r),i.state=function(){return s(r,{})}),i}i&&i.exports?i.exports=u:r(39)&&r(74)?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.tychei=u}(0,e,r(39))}).call(this,r(73)(e))},function(e,t,r){var n;!function(i,a,o){var s,u=o.pow(256,6),c=o.pow(2,52),f=2*c;function l(e,t,r){var n=[],l=h(function e(t,r){var n,i=[],a=typeof t;if(r&&"object"==a)for(n in t)try{i.push(e(t[n],r-1))}catch(e){}return i.length?i:"string"==a?t:t+"\0"}((t=1==t?{entropy:!0}:t||{}).entropy?[e,d(a)]:null==e?function(){try{var e;return s&&(e=s.randomBytes)?e=e(256):(e=new Uint8Array(256),(i.crypto||i.msCrypto).getRandomValues(e)),d(e)}catch(e){var t=i.navigator,r=t&&t.plugins;return[+new Date,i,r,i.screen,d(a)]}}():e,3),n),v=new p(n),y=function(){for(var e=v.g(6),t=u,r=0;e<c;)e=256*(e+r),t*=256,r=v.g(1);for(;e>=f;)e/=2,t/=2,r>>>=1;return(e+r)/t};return y.int32=function(){return 0|v.g(4)},y.quick=function(){return v.g(4)/4294967296},y.double=y,h(d(v.S),a),(t.pass||r||function(e,t,r,n){return n&&(n.S&&m(n,v),e.state=function(){return m(v,{})}),r?(o.random=e,t):e})(y,l,"global"in t?t.global:this==o,t.state)}function p(e){var t,r=e.length,n=this,i=0,a=n.i=n.j=0,o=n.S=[];for(r||(e=[r++]);i<256;)o[i]=i++;for(i=0;i<256;i++)o[i]=o[a=255&a+e[i%r]+(t=o[i])],o[a]=t;(n.g=function(e){for(var t,r=0,i=n.i,a=n.j,o=n.S;e--;)t=o[i=255&i+1],r=256*r+o[255&(o[i]=o[a=255&a+t])+(o[a]=t)];return n.i=i,n.j=a,r})(256)}function m(e,t){return t.i=e.i,t.j=e.j,t.S=e.S.slice(),t}function h(e,t){for(var r,n=e+"",i=0;i<n.length;)t[255&i]=255&(r^=19*t[255&i])+n.charCodeAt(i++);return d(t)}function d(e){return String.fromCharCode.apply(0,e)}if(h(o.random(),a),e.exports){e.exports=l;try{s=r(252)}catch(e){}}else void 0===(n=function(){return l}.call(t,r,t,e))||(e.exports=n)}("undefined"!=typeof self?self:this,[],Math)},function(e,t){},function(e,t,r){r(6)({target:"String",proto:!0},{repeat:r(164)})},function(e,t,r){"use strict";r.r(t);var n={};r.r(n),r.d(n,"createTyped",(function(){return bt})),r.d(n,"createResultSet",(function(){return Et})),r.d(n,"createBigNumberClass",(function(){return Ot})),r.d(n,"createComplexClass",(function(){return Tt})),r.d(n,"createFractionClass",(function(){return zt})),r.d(n,"createRangeClass",(function(){return qt})),r.d(n,"createMatrixClass",(function(){return Rt})),r.d(n,"createDenseMatrixClass",(function(){return Ft})),r.d(n,"createClone",(function(){return Ut})),r.d(n,"createIsInteger",(function(){return Yt})),r.d(n,"createIsNegative",(function(){return er})),r.d(n,"createIsNumeric",(function(){return tr})),r.d(n,"createHasNumericValue",(function(){return rr})),r.d(n,"createIsPositive",(function(){return nr})),r.d(n,"createIsZero",(function(){return ir})),r.d(n,"createIsNaN",(function(){return ar})),r.d(n,"createTypeOf",(function(){return or})),r.d(n,"createEqualScalar",(function(){return ur})),r.d(n,"createSparseMatrixClass",(function(){return cr})),r.d(n,"createNumber",(function(){return fr})),r.d(n,"createString",(function(){return lr})),r.d(n,"createBoolean",(function(){return pr})),r.d(n,"createBignumber",(function(){return mr})),r.d(n,"createComplex",(function(){return hr})),r.d(n,"createFraction",(function(){return dr})),r.d(n,"createMatrix",(function(){return vr})),r.d(n,"createMatrixFromFunction",(function(){return yr})),r.d(n,"createMatrixFromRows",(function(){return br})),r.d(n,"createMatrixFromColumns",(function(){return Mr})),r.d(n,"createSplitUnit",(function(){return Er})),r.d(n,"createUnaryMinus",(function(){return Zr})),r.d(n,"createUnaryPlus",(function(){return Wr})),r.d(n,"createAbs",(function(){return Yr})),r.d(n,"createApply",(function(){return Jr})),r.d(n,"createAddScalar",(function(){return Qr})),r.d(n,"createCbrt",(function(){return Kr})),r.d(n,"createCeil",(function(){return an})),r.d(n,"createCube",(function(){return on})),r.d(n,"createExp",(function(){return sn})),r.d(n,"createExpm1",(function(){return un})),r.d(n,"createFix",(function(){return cn})),r.d(n,"createFloor",(function(){return fn})),r.d(n,"createGcd",(function(){return dn})),r.d(n,"createLcm",(function(){return gn})),r.d(n,"createLog10",(function(){return xn})),r.d(n,"createLog2",(function(){return bn})),r.d(n,"createMod",(function(){return En})),r.d(n,"createMultiplyScalar",(function(){return Sn})),r.d(n,"createMultiply",(function(){return An})),r.d(n,"createNthRoot",(function(){return On})),r.d(n,"createSign",(function(){return Cn})),r.d(n,"createSqrt",(function(){return _n})),r.d(n,"createSquare",(function(){return Tn})),r.d(n,"createSubtract",(function(){return In})),r.d(n,"createXgcd",(function(){return zn})),r.d(n,"createInvmod",(function(){return qn})),r.d(n,"createDotMultiply",(function(){return Bn})),r.d(n,"createBitAnd",(function(){return Kn})),r.d(n,"createBitNot",(function(){return ei})),r.d(n,"createBitOr",(function(){return ti})),r.d(n,"createBitXor",(function(){return ni})),r.d(n,"createArg",(function(){return ii})),r.d(n,"createConj",(function(){return ai})),r.d(n,"createIm",(function(){return oi})),r.d(n,"createRe",(function(){return si})),r.d(n,"createNot",(function(){return pi})),r.d(n,"createOr",(function(){return mi})),r.d(n,"createXor",(function(){return hi})),r.d(n,"createConcat",(function(){return di})),r.d(n,"createColumn",(function(){return yi})),r.d(n,"createCount",(function(){return gi})),r.d(n,"createCross",(function(){return xi})),r.d(n,"createDiag",(function(){return bi})),r.d(n,"createFilter",(function(){return Ei})),r.d(n,"createFlatten",(function(){return Ai})),r.d(n,"createForEach",(function(){return Oi})),r.d(n,"createGetMatrixDataType",(function(){return _i})),r.d(n,"createIdentity",(function(){return Ti})),r.d(n,"createKron",(function(){return Ii})),r.d(n,"createMap",(function(){return ki})),r.d(n,"createDiff",(function(){return qi})),r.d(n,"createOnes",(function(){return Ri})),r.d(n,"createRange",(function(){return Pi})),r.d(n,"createReshape",(function(){return Fi})),r.d(n,"createResize",(function(){return Li})),r.d(n,"createRotate",(function(){return $i})),r.d(n,"createRotationMatrix",(function(){return Hi})),r.d(n,"createRow",(function(){return Gi})),r.d(n,"createSize",(function(){return Vi})),r.d(n,"createSqueeze",(function(){return Zi})),r.d(n,"createSubset",(function(){return Wi})),r.d(n,"createTranspose",(function(){return Ki})),r.d(n,"createCtranspose",(function(){return ea})),r.d(n,"createZeros",(function(){return ta})),r.d(n,"createErf",(function(){return ra})),r.d(n,"createMode",(function(){return ua})),r.d(n,"createProd",(function(){return fa})),r.d(n,"createFormat",(function(){return la})),r.d(n,"createBin",(function(){return pa})),r.d(n,"createOct",(function(){return ma})),r.d(n,"createHex",(function(){return ha})),r.d(n,"createPrint",(function(){return da})),r.d(n,"createTo",(function(){return ya})),r.d(n,"createIsPrime",(function(){return ga})),r.d(n,"createNumeric",(function(){return xa})),r.d(n,"createDivideScalar",(function(){return ba})),r.d(n,"createPow",(function(){return wa})),r.d(n,"createRound",(function(){return Oa})),r.d(n,"createLog",(function(){return _a})),r.d(n,"createLog1p",(function(){return Ta})),r.d(n,"createNthRoots",(function(){return Ia})),r.d(n,"createDotPow",(function(){return ka})),r.d(n,"createDotDivide",(function(){return za})),r.d(n,"createLsolve",(function(){return Ra})),r.d(n,"createUsolve",(function(){return Ba})),r.d(n,"createLsolveAll",(function(){return Pa})),r.d(n,"createUsolveAll",(function(){return Fa})),r.d(n,"createLeftShift",(function(){return La})),r.d(n,"createRightArithShift",(function(){return $a})),r.d(n,"createRightLogShift",(function(){return Ha})),r.d(n,"createAnd",(function(){return Ga})),r.d(n,"createCompare",(function(){return Va})),r.d(n,"createCompareNatural",(function(){return Ya})),r.d(n,"createCompareText",(function(){return Ja})),r.d(n,"createEqual",(function(){return Xa})),r.d(n,"createEqualText",(function(){return Qa})),r.d(n,"createSmaller",(function(){return Ka})),r.d(n,"createSmallerEq",(function(){return eo})),r.d(n,"createLarger",(function(){return to})),r.d(n,"createLargerEq",(function(){return ro})),r.d(n,"createDeepEqual",(function(){return no})),r.d(n,"createUnequal",(function(){return io})),r.d(n,"createPartitionSelect",(function(){return ao})),r.d(n,"createSort",(function(){return oo})),r.d(n,"createMax",(function(){return so})),r.d(n,"createMin",(function(){return uo})),r.d(n,"createImmutableDenseMatrixClass",(function(){return co})),r.d(n,"createIndexClass",(function(){return fo})),r.d(n,"createFibonacciHeapClass",(function(){return lo})),r.d(n,"createSpaClass",(function(){return po})),r.d(n,"createUnitClass",(function(){return Mo})),r.d(n,"createUnitFunction",(function(){return Eo})),r.d(n,"createSparse",(function(){return So})),r.d(n,"createCreateUnit",(function(){return Ao})),r.d(n,"createAcos",(function(){return Oo})),r.d(n,"createAcosh",(function(){return Ho})),r.d(n,"createAcot",(function(){return Go})),r.d(n,"createAcoth",(function(){return Vo})),r.d(n,"createAcsc",(function(){return Zo})),r.d(n,"createAcsch",(function(){return Wo})),r.d(n,"createAsec",(function(){return Yo})),r.d(n,"createAsech",(function(){return Jo})),r.d(n,"createAsin",(function(){return Xo})),r.d(n,"createAsinh",(function(){return Qo})),r.d(n,"createAtan",(function(){return Ko})),r.d(n,"createAtan2",(function(){return es})),r.d(n,"createAtanh",(function(){return ts})),r.d(n,"createCos",(function(){return rs})),r.d(n,"createCosh",(function(){return ns})),r.d(n,"createCot",(function(){return is})),r.d(n,"createCoth",(function(){return as})),r.d(n,"createCsc",(function(){return os})),r.d(n,"createCsch",(function(){return ss})),r.d(n,"createSec",(function(){return us})),r.d(n,"createSech",(function(){return cs})),r.d(n,"createSin",(function(){return fs})),r.d(n,"createSinh",(function(){return ls})),r.d(n,"createTan",(function(){return ps})),r.d(n,"createTanh",(function(){return ms})),r.d(n,"createSetCartesian",(function(){return hs})),r.d(n,"createSetDifference",(function(){return ds})),r.d(n,"createSetDistinct",(function(){return vs})),r.d(n,"createSetIntersect",(function(){return ys})),r.d(n,"createSetIsSubset",(function(){return gs})),r.d(n,"createSetMultiplicity",(function(){return xs})),r.d(n,"createSetPowerset",(function(){return bs})),r.d(n,"createSetSize",(function(){return ws})),r.d(n,"createSetSymDifference",(function(){return Ns})),r.d(n,"createSetUnion",(function(){return Ms})),r.d(n,"createAdd",(function(){return Es})),r.d(n,"createHypot",(function(){return Ss})),r.d(n,"createNorm",(function(){return As})),r.d(n,"createDot",(function(){return Os})),r.d(n,"createTrace",(function(){return Cs})),r.d(n,"createIndex",(function(){return _s})),r.d(n,"createNode",(function(){return Is})),r.d(n,"createAccessorNode",(function(){return qs})),r.d(n,"createArrayNode",(function(){return Rs})),r.d(n,"createAssignmentNode",(function(){return Fs})),r.d(n,"createBlockNode",(function(){return Us})),r.d(n,"createConditionalNode",(function(){return Ls})),r.d(n,"createConstantNode",(function(){return Xs})),r.d(n,"createFunctionAssignmentNode",(function(){return Qs})),r.d(n,"createIndexNode",(function(){return Ks})),r.d(n,"createObjectNode",(function(){return eu})),r.d(n,"createOperatorNode",(function(){return tu})),r.d(n,"createParenthesisNode",(function(){return ru})),r.d(n,"createRangeNode",(function(){return nu})),r.d(n,"createRelationalNode",(function(){return iu})),r.d(n,"createSymbolNode",(function(){return au})),r.d(n,"createFunctionNode",(function(){return su})),r.d(n,"createParse",(function(){return uu})),r.d(n,"createCompile",(function(){return cu})),r.d(n,"createEvaluate",(function(){return fu})),r.d(n,"createParserClass",(function(){return lu})),r.d(n,"createParser",(function(){return pu})),r.d(n,"createLup",(function(){return mu})),r.d(n,"createQr",(function(){return hu})),r.d(n,"createSlu",(function(){return Ou})),r.d(n,"createLusolve",(function(){return Tu})),r.d(n,"createHelpClass",(function(){return ku})),r.d(n,"createChainClass",(function(){return qu})),r.d(n,"createHelp",(function(){return ju})),r.d(n,"createChain",(function(){return Pu})),r.d(n,"createDet",(function(){return Fu})),r.d(n,"createInv",(function(){return Uu})),r.d(n,"createEigs",(function(){return Gu})),r.d(n,"createExpm",(function(){return Vu})),r.d(n,"createSqrtm",(function(){return Zu})),r.d(n,"createDivide",(function(){return Wu})),r.d(n,"createDistance",(function(){return Yu})),r.d(n,"createIntersect",(function(){return Ju})),r.d(n,"createSum",(function(){return Xu})),r.d(n,"createCumSum",(function(){return Qu})),r.d(n,"createMean",(function(){return Ku})),r.d(n,"createMedian",(function(){return ec})),r.d(n,"createMad",(function(){return tc})),r.d(n,"createVariance",(function(){return rc})),r.d(n,"createQuantileSeq",(function(){return nc})),r.d(n,"createStd",(function(){return ic})),r.d(n,"createCombinations",(function(){return sc})),r.d(n,"createCombinationsWithRep",(function(){return cc})),r.d(n,"createGamma",(function(){return hc})),r.d(n,"createFactorial",(function(){return dc})),r.d(n,"createKldivergence",(function(){return vc})),r.d(n,"createMultinomial",(function(){return yc})),r.d(n,"createPermutations",(function(){return gc})),r.d(n,"createPickRandom",(function(){return Ec})),r.d(n,"createRandom",(function(){return Ac})),r.d(n,"createRandomInt",(function(){return Oc})),r.d(n,"createStirlingS2",(function(){return Cc})),r.d(n,"createBellNumbers",(function(){return _c})),r.d(n,"createCatalan",(function(){return Tc})),r.d(n,"createComposition",(function(){return Ic})),r.d(n,"createLeafCount",(function(){return kc})),r.d(n,"createSimplify",(function(){return Pc})),r.d(n,"createSimplifyCore",(function(){return Fc})),r.d(n,"createResolve",(function(){return Uc})),r.d(n,"createSymbolicEqual",(function(){return Lc})),r.d(n,"createDerivative",(function(){return $c})),r.d(n,"createRationalize",(function(){return Hc})),r.d(n,"createReviver",(function(){return Gc})),r.d(n,"createReplacer",(function(){return Vc})),r.d(n,"createE",(function(){return nf})),r.d(n,"createUppercaseE",(function(){return hf})),r.d(n,"createFalse",(function(){return Xc})),r.d(n,"createI",(function(){return pf})),r.d(n,"createInfinity",(function(){return Kc})),r.d(n,"createLN10",(function(){return sf})),r.d(n,"createLN2",(function(){return of})),r.d(n,"createLOG10E",(function(){return cf})),r.d(n,"createLOG2E",(function(){return uf})),r.d(n,"createNaN",(function(){return ef})),r.d(n,"createNull",(function(){return Qc})),r.d(n,"createPhi",(function(){return af})),r.d(n,"createPi",(function(){return tf})),r.d(n,"createUppercasePi",(function(){return mf})),r.d(n,"createSQRT1_2",(function(){return ff})),r.d(n,"createSQRT2",(function(){return lf})),r.d(n,"createTau",(function(){return rf})),r.d(n,"createTrue",(function(){return Jc})),r.d(n,"createVersion",(function(){return df})),r.d(n,"createAtomicMass",(function(){return Vf})),r.d(n,"createAvogadro",(function(){return Zf})),r.d(n,"createBohrMagneton",(function(){return Af})),r.d(n,"createBohrRadius",(function(){return kf})),r.d(n,"createBoltzmann",(function(){return Wf})),r.d(n,"createClassicalElectronRadius",(function(){return zf})),r.d(n,"createConductanceQuantum",(function(){return Of})),r.d(n,"createCoulomb",(function(){return Ef})),r.d(n,"createDeuteronMass",(function(){return Pf})),r.d(n,"createEfimovFactor",(function(){return Gf})),r.d(n,"createElectricConstant",(function(){return Nf})),r.d(n,"createElectronMass",(function(){return qf})),r.d(n,"createElementaryCharge",(function(){return Sf})),r.d(n,"createFaraday",(function(){return Yf})),r.d(n,"createFermiCoupling",(function(){return Rf})),r.d(n,"createFineStructure",(function(){return Bf})),r.d(n,"createFirstRadiation",(function(){return Jf})),r.d(n,"createGasConstant",(function(){return Qf})),r.d(n,"createGravitationConstant",(function(){return gf})),r.d(n,"createGravity",(function(){return sl})),r.d(n,"createHartreeEnergy",(function(){return Df})),r.d(n,"createInverseConductanceQuantum",(function(){return Cf})),r.d(n,"createKlitzing",(function(){return If})),r.d(n,"createLoschmidt",(function(){return Xf})),r.d(n,"createMagneticConstant",(function(){return wf})),r.d(n,"createMagneticFluxQuantum",(function(){return _f})),r.d(n,"createMolarMass",(function(){return al})),r.d(n,"createMolarMassC12",(function(){return ol})),r.d(n,"createMolarPlanckConstant",(function(){return Kf})),r.d(n,"createMolarVolume",(function(){return el})),r.d(n,"createNeutronMass",(function(){return Ff})),r.d(n,"createNuclearMagneton",(function(){return Tf})),r.d(n,"createPlanckCharge",(function(){return ll})),r.d(n,"createPlanckConstant",(function(){return xf})),r.d(n,"createPlanckLength",(function(){return ul})),r.d(n,"createPlanckMass",(function(){return cl})),r.d(n,"createPlanckTemperature",(function(){return pl})),r.d(n,"createPlanckTime",(function(){return fl})),r.d(n,"createProtonMass",(function(){return jf})),r.d(n,"createQuantumOfCirculation",(function(){return Uf})),r.d(n,"createReducedPlanckConstant",(function(){return bf})),r.d(n,"createRydberg",(function(){return Lf})),r.d(n,"createSackurTetrode",(function(){return tl})),r.d(n,"createSecondRadiation",(function(){return rl})),r.d(n,"createSpeedOfLight",(function(){return yf})),r.d(n,"createStefanBoltzmann",(function(){return nl})),r.d(n,"createThomsonCrossSection",(function(){return $f})),r.d(n,"createVacuumImpedance",(function(){return Mf})),r.d(n,"createWeakMixingAngle",(function(){return Hf})),r.d(n,"createWienDisplacement",(function(){return il})),r.d(n,"createApplyTransform",(function(){return dl})),r.d(n,"createColumnTransform",(function(){return vl})),r.d(n,"createFilterTransform",(function(){return gl})),r.d(n,"createForEachTransform",(function(){return bl})),r.d(n,"createIndexTransform",(function(){return wl})),r.d(n,"createMapTransform",(function(){return Nl})),r.d(n,"createMaxTransform",(function(){return Sl})),r.d(n,"createMeanTransform",(function(){return Al})),r.d(n,"createMinTransform",(function(){return Ol})),r.d(n,"createRangeTransform",(function(){return Cl})),r.d(n,"createRowTransform",(function(){return _l})),r.d(n,"createSubsetTransform",(function(){return Tl})),r.d(n,"createConcatTransform",(function(){return Il})),r.d(n,"createDiffTransform",(function(){return kl})),r.d(n,"createStdTransform",(function(){return zl})),r.d(n,"createSumTransform",(function(){return ql})),r.d(n,"createCumSumTransform",(function(){return Rl})),r.d(n,"createVarianceTransform",(function(){return Bl}));r(30);var i=r(3),a=r.n(i);r(146),r(148),r(151),r(10),r(154),r(7);function o(e){return"number"==typeof e}function s(e){return!(!e||"object"!==a()(e)||"function"!=typeof e.constructor)&&(!0===e.isBigNumber&&"object"===a()(e.constructor.prototype)&&!0===e.constructor.prototype.isBigNumber||"function"==typeof e.constructor.isDecimal&&!0===e.constructor.isDecimal(e))}function u(e){return e&&"object"===a()(e)&&!0===Object.getPrototypeOf(e).isComplex||!1}function c(e){return e&&"object"===a()(e)&&!0===Object.getPrototypeOf(e).isFraction||!1}function f(e){return e&&!0===e.constructor.prototype.isUnit||!1}function l(e){return"string"==typeof e}var p=Array.isArray;function m(e){return e&&!0===e.constructor.prototype.isMatrix||!1}function h(e){return Array.isArray(e)||m(e)}function d(e){return e&&e.isDenseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function v(e){return e&&e.isSparseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function y(e){return e&&!0===e.constructor.prototype.isRange||!1}function g(e){return e&&!0===e.constructor.prototype.isIndex||!1}function x(e){return"boolean"==typeof e}function b(e){return e&&!0===e.constructor.prototype.isResultSet||!1}function w(e){return e&&!0===e.constructor.prototype.isHelp||!1}function N(e){return"function"==typeof e}function M(e){return e instanceof Date}function E(e){return e instanceof RegExp}function S(e){return!(!e||"object"!==a()(e)||e.constructor!==Object||u(e)||c(e))}function A(e){return null===e}function O(e){return void 0===e}function C(e){return e&&!0===e.isAccessorNode&&!0===e.constructor.prototype.isNode||!1}function _(e){return e&&!0===e.isArrayNode&&!0===e.constructor.prototype.isNode||!1}function T(e){return e&&!0===e.isAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function I(e){return e&&!0===e.isBlockNode&&!0===e.constructor.prototype.isNode||!1}function k(e){return e&&!0===e.isConditionalNode&&!0===e.constructor.prototype.isNode||!1}function z(e){return e&&!0===e.isConstantNode&&!0===e.constructor.prototype.isNode||!1}function q(e){return e&&!0===e.isFunctionAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function R(e){return e&&!0===e.isFunctionNode&&!0===e.constructor.prototype.isNode||!1}function B(e){return e&&!0===e.isIndexNode&&!0===e.constructor.prototype.isNode||!1}function D(e){return e&&!0===e.isNode&&!0===e.constructor.prototype.isNode||!1}function j(e){return e&&!0===e.isObjectNode&&!0===e.constructor.prototype.isNode||!1}function P(e){return e&&!0===e.isOperatorNode&&!0===e.constructor.prototype.isNode||!1}function F(e){return e&&!0===e.isParenthesisNode&&!0===e.constructor.prototype.isNode||!1}function U(e){return e&&!0===e.isRangeNode&&!0===e.constructor.prototype.isNode||!1}function L(e){return e&&!0===e.isSymbolNode&&!0===e.constructor.prototype.isNode||!1}function $(e){return e&&!0===e.constructor.prototype.isChain||!1}function H(e){var t=a()(e);return"object"===t?null===e?"null":Array.isArray(e)?"Array":e instanceof Date?"Date":e instanceof RegExp?"RegExp":s(e)?"BigNumber":u(e)?"Complex":c(e)?"Fraction":m(e)?"Matrix":f(e)?"Unit":g(e)?"Index":y(e)?"Range":b(e)?"ResultSet":D(e)?e.type:$(e)?"Chain":w(e)?"Help":"Object":"function"===t?"Function":t}var G=r(133),V=r.n(G);r(201),r(158),r(202),r(204),r(205),r(206),r(19),r(0),r(72),r(102),r(4),r(50),r(14),r(17),r(29),r(208),r(209),r(210),r(211),r(212),r(213),r(214);function Z(e){return"boolean"==typeof e||!!isFinite(e)&&e===Math.round(e)}var W=Math.sign||function(e){return e>0?1:e<0?-1:0},Y=Math.log2||function(e){return Math.log(e)/Math.LN2},J=Math.log10||function(e){return Math.log(e)/Math.LN10},X=Math.log1p||function(e){return Math.log(e+1)},Q=Math.cbrt||function(e){if(0===e)return e;var t,r=e<0;return r&&(e=-e),t=isFinite(e)?(e/((t=Math.exp(Math.log(e)/3))*t)+2*t)/3:e,r?-t:t},K=Math.expm1||function(e){return e>=2e-4||e<=-2e-4?Math.exp(e)-1:e+e*e/2+e*e*e/6};function ee(e,t,r){var n={2:"0b",8:"0o",16:"0x"}[t],i="";if(r){if(r<1)throw new Error("size must be in greater than 0");if(!Z(r))throw new Error("size must be an integer");if(e>Math.pow(2,r-1)-1||e<-Math.pow(2,r-1))throw new Error("Value must be in range [-2^".concat(r-1,", 2^").concat(r-1,"-1]"));if(!Z(e))throw new Error("Value must be an integer");e<0&&(e+=Math.pow(2,r)),i="i".concat(r)}var a="";return e<0&&(e=-e,a="-"),"".concat(a).concat(n).concat(e.toString(t)).concat(i)}function te(e,t){if("function"==typeof t)return t(e);if(e===1/0)return"Infinity";if(e===-1/0)return"-Infinity";if(isNaN(e))return"NaN";var r,n,i="auto";if(t&&(t.notation&&(i=t.notation),o(t)?r=t:o(t.precision)&&(r=t.precision),t.wordSize&&"number"!=typeof(n=t.wordSize)))throw new Error('Option "wordSize" must be a number');switch(i){case"fixed":return ne(e,r);case"exponential":return ie(e,r);case"engineering":return function(e,t){if(isNaN(e)||!isFinite(e))return String(e);var r=ae(re(e),t),n=r.exponent,i=r.coefficients,a=n%3==0?n:n<0?n-3-n%3:n-n%3;if(o(t))for(;t>i.length||n-a+1>i.length;)i.push(0);else for(var s=Math.abs(n-a)-(i.length-1),u=0;u<s;u++)i.push(0);var c=Math.abs(n-a),f=1;for(;c>0;)f++,c--;var l=i.slice(f).join(""),p=o(t)&&l.length||l.match(/[1-9]/)?"."+l:"",m=i.slice(0,f).join("")+p+"e"+(n>=0?"+":"")+a.toString();return r.sign+m}(e,r);case"bin":return ee(e,2,n);case"oct":return ee(e,8,n);case"hex":return ee(e,16,n);case"auto":return function(e,t,r){if(isNaN(e)||!isFinite(e))return String(e);var n=r&&void 0!==r.lowerExp?r.lowerExp:-3,i=r&&void 0!==r.upperExp?r.upperExp:5,a=re(e),o=t?ae(a,t):a;if(o.exponent<n||o.exponent>=i)return ie(e,t);var s=o.coefficients,u=o.exponent;s.length<t&&(s=s.concat(oe(t-s.length))),s=s.concat(oe(u-s.length+1+(s.length<t?t-s.length:0))),s=oe(-u).concat(s);var c=u>0?u:0;return c<s.length-1&&s.splice(c+1,0,"."),o.sign+s.join("")}(e,r,t&&t).replace(/((\.\d*?)(0+))($|e)/,(function(){var e=arguments[2],t=arguments[4];return"."!==e?e+t:t}));default:throw new Error('Unknown notation "'+i+'". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.')}}function re(e){var t=String(e).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);if(!t)throw new SyntaxError("Invalid number "+e);var r=t[1],n=t[2],i=parseFloat(t[4]||"0"),a=n.indexOf(".");i+=-1!==a?a-1:n.length-1;var o=n.replace(".","").replace(/^0*/,(function(e){return i-=e.length,""})).replace(/0*$/,"").split("").map((function(e){return parseInt(e)}));return 0===o.length&&(o.push(0),i++),{sign:r,coefficients:o,exponent:i}}function ne(e,t){if(isNaN(e)||!isFinite(e))return String(e);var r=re(e),n="number"==typeof t?ae(r,r.exponent+1+t):r,i=n.coefficients,a=n.exponent+1,o=a+(t||0);return i.length<o&&(i=i.concat(oe(o-i.length))),a<0&&(i=oe(1-a).concat(i),a=1),a<i.length&&i.splice(a,0,0===a?"0.":"."),n.sign+i.join("")}function ie(e,t){if(isNaN(e)||!isFinite(e))return String(e);var r=re(e),n=t?ae(r,t):r,i=n.coefficients,a=n.exponent;i.length<t&&(i=i.concat(oe(t-i.length)));var o=i.shift();return n.sign+o+(i.length>0?"."+i.join(""):"")+"e"+(a>=0?"+":"")+a}function ae(e,t){for(var r={sign:e.sign,coefficients:e.coefficients,exponent:e.exponent},n=r.coefficients;t<=0;)n.unshift(0),r.exponent++,t++;if(n.length>t&&n.splice(t,n.length-t)[0]>=5){var i=t-1;for(n[i]++;10===n[i];)n.pop(),0===i&&(n.unshift(0),r.exponent++,i++),n[--i]++}return r}function oe(e){for(var t=[],r=0;r<e;r++)t.push(0);return t}var se=Number.EPSILON||2220446049250313e-31;function ue(e,t,r){if(null==r)return e===t;if(e===t)return!0;if(isNaN(e)||isNaN(t))return!1;if(isFinite(e)&&isFinite(t)){var n=Math.abs(e-t);return n<se||n<=Math.max(Math.abs(e),Math.abs(t))*r}return!1}var ce=Math.acosh||function(e){return Math.log(Math.sqrt(e*e-1)+e)},fe=Math.asinh||function(e){return Math.log(Math.sqrt(e*e+1)+e)},le=Math.atanh||function(e){return Math.log((1+e)/(1-e))/2},pe=Math.cosh||function(e){return(Math.exp(e)+Math.exp(-e))/2},me=Math.sinh||function(e){return(Math.exp(e)-Math.exp(-e))/2},he=Math.tanh||function(e){var t=Math.exp(2*e);return(t-1)/(t+1)};r(41),r(5),r(12),r(37),r(47),r(28),r(103),r(163);function de(e,t,r){var n=new(0,e.constructor)(2),i="";if(r){if(r<1)throw new Error("size must be in greater than 0");if(!Z(r))throw new Error("size must be an integer");if(e.greaterThan(n.pow(r-1).sub(1))||e.lessThan(n.pow(r-1).mul(-1)))throw new Error("Value must be in range [-2^".concat(r-1,", 2^").concat(r-1,"-1]"));if(!e.isInteger())throw new Error("Value must be an integer");e.lessThan(0)&&(e=e.add(n.pow(r))),i="i".concat(r)}switch(t){case 2:return"".concat(e.toBinary()).concat(i);case 8:return"".concat(e.toOctal()).concat(i);case 16:return"".concat(e.toHexadecimal()).concat(i);default:throw new Error("Base ".concat(t," not supported "))}}function ve(e,t){if("function"==typeof t)return t(e);if(!e.isFinite())return e.isNaN()?"NaN":e.gt(0)?"Infinity":"-Infinity";var r,n,i="auto";if(void 0!==t&&(t.notation&&(i=t.notation),"number"==typeof t?r=t:t.precision&&(r=t.precision),t.wordSize&&"number"!=typeof(n=t.wordSize)))throw new Error('Option "wordSize" must be a number');switch(i){case"fixed":return function(e,t){return e.toFixed(t)}(e,r);case"exponential":return ye(e,r);case"engineering":return function(e,t){var r=e.e,n=r%3==0?r:r<0?r-3-r%3:r-r%3,i=e.mul(Math.pow(10,-n)),a=i.toPrecision(t);-1!==a.indexOf("e")&&(a=i.toString());return a+"e"+(r>=0?"+":"")+n.toString()}(e,r);case"bin":return de(e,2,n);case"oct":return de(e,8,n);case"hex":return de(e,16,n);case"auto":var a=t&&void 0!==t.lowerExp?t.lowerExp:-3,o=t&&void 0!==t.upperExp?t.upperExp:5;if(e.isZero())return"0";var s=e.toSignificantDigits(r),u=s.e;return(u>=a&&u<o?s.toFixed():ye(e,r)).replace(/((\.\d*?)(0+))($|e)/,(function(){var e=arguments[2],t=arguments[4];return"."!==e?e+t:t}));default:throw new Error('Unknown notation "'+i+'". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.')}}function ye(e,t){return void 0!==t?e.toExponential(t-1):e.toExponential()}function ge(e,t){var r=e.length-t.length,n=e.length;return e.substring(r,n)===t}function xe(e,t){var r=function(e,t){if("number"==typeof e)return te(e,t);if(s(e))return ve(e,t);if(function(e){return e&&"object"===a()(e)&&"number"==typeof e.s&&"number"==typeof e.n&&"number"==typeof e.d||!1}(e))return t&&"decimal"===t.fraction?e.toString():e.s*e.n+"/"+e.d;if(Array.isArray(e))return function e(t,r){if(Array.isArray(t)){for(var n="[",i=t.length,a=0;a<i;a++)0!==a&&(n+=", "),n+=e(t[a],r);return n+="]"}return xe(t,r)}(e,t);if(l(e))return'"'+e+'"';if("function"==typeof e)return e.syntax?String(e.syntax):"function";if(e&&"object"===a()(e)){return"function"==typeof e.format?e.format(t):e&&e.toString(t)!=={}.toString()?e.toString(t):"{"+Object.keys(e).map((function(r){return'"'+r+'": '+xe(e[r],t)})).join(", ")+"}"}return String(e)}(e,t);return t&&"object"===a()(t)&&"truncate"in t&&r.length>t.truncate?r.substring(0,t.truncate-3)+"...":r}function be(e){for(var t=String(e),r="",n=0;n<t.length;){var i=t.charAt(n);"\\"===i?(r+=i,n++,""!==(i=t.charAt(n))&&-1!=='"\\/bfnrtu'.indexOf(i)||(r+="\\"),r+=i):r+='"'===i?'\\"':i,n++}return'"'+r+'"'}function we(e){var t=String(e);return t=t.replace(/&/g,"&amp;").replace(/"/g,"&quot;").replace(/'/g,"&#39;").replace(/</g,"&lt;").replace(/>/g,"&gt;")}function Ne(e,t){if(!l(e))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+H(e)+", index: 0)");if(!l(t))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+H(t)+", index: 1)");return e===t?0:e>t?1:-1}function Me(e,t,r){if(!(this instanceof Me))throw new SyntaxError("Constructor must be called with the new operator");this.actual=e,this.expected=t,this.relation=r,this.message="Dimension mismatch ("+(Array.isArray(e)?"["+e.join(", ")+"]":e)+" "+(this.relation||"!=")+" "+(Array.isArray(t)?"["+t.join(", ")+"]":t)+")",this.stack=(new Error).stack}function Ee(e,t,r){if(!(this instanceof Ee))throw new SyntaxError("Constructor must be called with the new operator");this.index=e,arguments.length<3?(this.min=0,this.max=t):(this.min=t,this.max=r),void 0!==this.min&&this.index<this.min?this.message="Index out of range ("+this.index+" < "+this.min+")":void 0!==this.max&&this.index>=this.max?this.message="Index out of range ("+this.index+" > "+(this.max-1)+")":this.message="Index out of range ("+this.index+")",this.stack=(new Error).stack}function Se(e){for(var t=[];Array.isArray(e);)t.push(e.length),e=e[0];return t}function Ae(e,t){if(0===t.length){if(Array.isArray(e))throw new Me(e.length,0)}else!function e(t,r,n){var i,a=t.length;if(a!==r[n])throw new Me(a,r[n]);if(n<r.length-1){var o=n+1;for(i=0;i<a;i++){var s=t[i];if(!Array.isArray(s))throw new Me(r.length-1,r.length,"<");e(t[i],r,o)}}else for(i=0;i<a;i++)if(Array.isArray(t[i]))throw new Me(r.length+1,r.length,">")}(e,t,0)}function Oe(e,t){if(!o(e)||!Z(e))throw new TypeError("Index must be an integer (value: "+e+")");if(e<0||"number"==typeof t&&e>=t)throw new Ee(e,t)}function Ce(e,t,r){if(!Array.isArray(e)||!Array.isArray(t))throw new TypeError("Array expected");if(0===t.length)throw new Error("Resizing to scalar is not supported");return t.forEach((function(e){if(!o(e)||!Z(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+xe(t)+")")})),function e(t,r,n,i){var a,o,s=t.length,u=r[n],c=Math.min(s,u);if(t.length=u,n<r.length-1){var f=n+1;for(a=0;a<c;a++)o=t[a],Array.isArray(o)||(o=[o],t[a]=o),e(o,r,f,i);for(a=c;a<u;a++)o=[],t[a]=o,e(o,r,f,i)}else{for(a=0;a<c;a++)for(;Array.isArray(t[a]);)t[a]=t[a][0];for(a=c;a<u;a++)t[a]=i}}(e,t,0,void 0!==r?r:0),e}function _e(e,t){var r=qe(e),n=r.length;if(!Array.isArray(e)||!Array.isArray(t))throw new TypeError("Array expected");if(0===t.length)throw new Me(0,n,"!=");var i=Ie(t=Te(t,n));if(n!==i)throw new Me(i,n,"!=");try{return function(e,t){for(var r,n=e,i=t.length-1;i>0;i--){var a=t[i];r=[];for(var o=n.length/a,s=0;s<o;s++)r.push(n.slice(s*a,(s+1)*a));n=r}return n}(r,t)}catch(e){if(e instanceof Me)throw new Me(i,n,"!=");throw e}}function Te(e,t){var r=Ie(e),n=e.slice(),i=e.indexOf(-1);if(e.indexOf(-1,i+1)>=0)throw new Error("More than one wildcard in sizes");if(i>=0){if(!(t%r==0))throw new Error("Could not replace wildcard, since "+t+" is no multiple of "+-r);n[i]=-t/r}return n}function Ie(e){return e.reduce((function(e,t){return e*t}),1)}function ke(e,t){for(var r=t||Se(e);Array.isArray(e)&&1===e.length;)e=e[0],r.shift();for(var n=r.length;1===r[n-1];)n--;return n<r.length&&(e=function e(t,r,n){var i,a;if(n<r){var o=n+1;for(i=0,a=t.length;i<a;i++)t[i]=e(t[i],r,o)}else for(;Array.isArray(t);)t=t[0];return t}(e,n,0),r.length=n),e}function ze(e,t,r,n){var i=n||Se(e);if(r)for(var a=0;a<r;a++)e=[e],i.unshift(1);for(e=function e(t,r,n){var i,a;if(Array.isArray(t)){var o=n+1;for(i=0,a=t.length;i<a;i++)t[i]=e(t[i],r,o)}else for(var s=n;s<r;s++)t=[t];return t}(e,t,0);i.length<t;)i.push(1);return e}function qe(e){if(!Array.isArray(e))return e;var t=[];return e.forEach((function e(r){Array.isArray(r)?r.forEach(e):t.push(r)})),t}function Re(e,t){return Array.prototype.map.call(e,t)}function Be(e,t){Array.prototype.forEach.call(e,t)}function De(e,t){if(1!==Se(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,t)}function je(e,t){if(1!==Se(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,(function(e){return t.test(e)}))}function Pe(e,t){return Array.prototype.join.call(e,t)}function Fe(e){if(!Array.isArray(e))throw new TypeError("Array input expected");if(0===e.length)return e;var t=[],r=0;t[0]={value:e[0],identifier:0};for(var n=1;n<e.length;n++)e[n]===e[n-1]?r++:r=0,t.push({value:e[n],identifier:r});return t}function Ue(e){if(!Array.isArray(e))throw new TypeError("Array input expected");if(0===e.length)return e;for(var t=[],r=0;r<e.length;r++)t.push(e[r].value);return t}function Le(e,t){for(var r,n=0,i=0;i<e.length;i++){var a=e[i],o=Array.isArray(a);if(0===i&&o&&(n=a.length),o&&a.length!==n)return;var s=o?Le(a,t):t(a);if(void 0===r)r=s;else if(r!==s)return"mixed"}return r}function $e(e,t){return-1!==e.indexOf(t)}function He(e){var t=a()(e);if("number"===t||"string"===t||"boolean"===t||null==e)return e;if("function"==typeof e.clone)return e.clone();if(Array.isArray(e))return e.map((function(e){return He(e)}));if(e instanceof Date)return new Date(e.valueOf());if(s(e))return e;if(e instanceof RegExp)throw new TypeError("Cannot clone "+e);return Ge(e,He)}function Ge(e,t){var r={};for(var n in e)Je(e,n)&&(r[n]=t(e[n]));return r}function Ve(e,t){for(var r in t)Je(t,r)&&(e[r]=t[r]);return e}function Ze(e,t){var r,n,i;if(Array.isArray(e)){if(!Array.isArray(t))return!1;if(e.length!==t.length)return!1;for(n=0,i=e.length;n<i;n++)if(!Ze(e[n],t[n]))return!1;return!0}if("function"==typeof e)return e===t;if(e instanceof Object){if(Array.isArray(t)||!(t instanceof Object))return!1;for(r in e)if(!(r in t)||!Ze(e[r],t[r]))return!1;for(r in t)if(!(r in e))return!1;return!0}return e===t}function We(e){var t={};return function e(t,r){for(var n in t)if(Je(t,n)){var i=t[n];"object"===a()(i)&&null!==i?e(i,r):r[n]=i}}(e,t),t}function Ye(e,t,r){var n,i=!0;Object.defineProperty(e,t,{get:function(){return i&&(n=r(),i=!1),n},set:function(e){n=e,i=!1},configurable:!0,enumerable:!0})}function Je(e,t){return e&&Object.hasOwnProperty.call(e,t)}function Xe(e){return Object.keys(e).map((function(t){return e[t]}))}function Qe(e,t,r,n){function i(n){var i=function(e,t){for(var r={},n=0;n<t.length;n++){var i=t[n],a=e[i];void 0!==a&&(r[i]=a)}return r}(n,t.map(et));return function(e,t,r){if(!t.filter((function(e){return!function(e){return e&&"?"===e[0]}(e)})).every((function(e){return void 0!==r[e]}))){var n=t.filter((function(e){return void 0===r[e]}));throw new Error('Cannot create function "'.concat(e,'", ')+"some dependencies are missing: ".concat(n.map((function(e){return'"'.concat(e,'"')})).join(", "),"."))}}(e,t,n),r(i)}return i.isFactory=!0,i.fn=e,i.dependencies=t.slice().sort(),n&&(i.meta=n),i}function Ke(e){return"function"==typeof e&&"string"==typeof e.fn&&Array.isArray(e.dependencies)}function et(e){return e&&"?"===e[0]?e.slice(1):e}Me.prototype=new RangeError,Me.prototype.constructor=RangeError,Me.prototype.name="DimensionError",Me.prototype.isDimensionError=!0,Ee.prototype=new RangeError,Ee.prototype.constructor=RangeError,Ee.prototype.name="IndexError",Ee.prototype.isIndexError=!0;var tt=r(185),rt=r.n(tt),nt=r(186),it=r.n(nt);r(27),r(166),r(42),r(31),r(61),r(38),r(51),r(54);function at(e,t){if(ct(e)&&st(e,t))return e[t];if("function"==typeof e[t]&&ut(e,t))throw new Error('Cannot access method "'+t+'" as a property');throw new Error('No access to property "'+t+'"')}function ot(e,t,r){if(ct(e)&&st(e,t))return e[t]=r,r;throw new Error('No access to property "'+t+'"')}function st(e,t){return!(!e||"object"!==a()(e))&&(!!Je(ft,t)||!(t in Object.prototype)&&!(t in Function.prototype))}function ut(e,t){return null!=e&&"function"==typeof e[t]&&(!(Je(e,t)&&Object.getPrototypeOf&&t in Object.getPrototypeOf(e))&&(!!Je(lt,t)||!(t in Object.prototype)&&!(t in Function.prototype)))}function ct(e){return"object"===a()(e)&&e&&e.constructor===Object}var ft={length:!0,name:!0},lt={toString:!0,valueOf:!0,toLocaleString:!0};function pt(e,t){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(!r){if(Array.isArray(e)||(r=function(e,t){if(!e)return;if("string"==typeof e)return mt(e,t);var r=Object.prototype.toString.call(e).slice(8,-1);"Object"===r&&e.constructor&&(r=e.constructor.name);if("Map"===r||"Set"===r)return Array.from(e);if("Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r))return mt(e,t)}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,i=function(){};return{s:i,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,s=!1;return{s:function(){r=r.call(e)},n:function(){var e=r.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==r.return||r.return()}finally{if(s)throw a}}}}function mt(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=new Array(t);r<t;r++)n[r]=e[r];return n}var ht=function(){function e(t){rt()(this,e),this.wrappedObject=t}return it()(e,[{key:"keys",value:function(){return Object.keys(this.wrappedObject)}},{key:"get",value:function(e){return at(this.wrappedObject,e)}},{key:"set",value:function(e,t){return ot(this.wrappedObject,e,t),this}},{key:"has",value:function(e){return t=this.wrappedObject,e in t;var t}}]),e}();function dt(){return new Map}function vt(e){if(!e)return dt();if(yt(e))return e;if(S(e))return new ht(e);throw new Error("createMap can create maps from objects or Maps")}function yt(e){return!!e&&(e instanceof Map||e instanceof ht||"function"==typeof e.set&&"function"==typeof e.get&&"function"==typeof e.keys&&"function"==typeof e.has)}function gt(e){for(var t=arguments.length,r=new Array(t>1?t-1:0),n=1;n<t;n++)r[n-1]=arguments[n];for(var i=0,a=r;i<a.length;i++){var o=a[i];if(o)if(yt(o)){var s,u=pt(o.keys());try{for(u.s();!(s=u.n()).done;){var c=s.value;e.set(c,o.get(c))}}catch(e){u.e(e)}finally{u.f()}}else if(S(o))for(var f=0,l=Object.keys(o);f<l.length;f++){var p=l[f];e.set(p,o[p])}}return e}var xt=function(){return xt=V.a.create,V.a},bt=Qe("typed",["?BigNumber","?Complex","?DenseMatrix","?Fraction"],(function(e){var t=e.BigNumber,r=e.Complex,n=e.DenseMatrix,i=e.Fraction,a=xt();return a.types=[{name:"number",test:o},{name:"Complex",test:u},{name:"BigNumber",test:s},{name:"Fraction",test:c},{name:"Unit",test:f},{name:"string",test:l},{name:"Chain",test:$},{name:"Array",test:p},{name:"Matrix",test:m},{name:"DenseMatrix",test:d},{name:"SparseMatrix",test:v},{name:"Range",test:y},{name:"Index",test:g},{name:"boolean",test:x},{name:"ResultSet",test:b},{name:"Help",test:w},{name:"function",test:N},{name:"Date",test:M},{name:"RegExp",test:E},{name:"null",test:A},{name:"undefined",test:O},{name:"AccessorNode",test:C},{name:"ArrayNode",test:_},{name:"AssignmentNode",test:T},{name:"BlockNode",test:I},{name:"ConditionalNode",test:k},{name:"ConstantNode",test:z},{name:"FunctionNode",test:R},{name:"FunctionAssignmentNode",test:q},{name:"IndexNode",test:B},{name:"Node",test:D},{name:"ObjectNode",test:j},{name:"OperatorNode",test:P},{name:"ParenthesisNode",test:F},{name:"RangeNode",test:U},{name:"SymbolNode",test:L},{name:"Map",test:yt},{name:"Object",test:S}],a.conversions=[{from:"number",to:"BigNumber",convert:function(e){if(t||wt(e),e.toExponential().replace(/e.*$/,"").replace(/^0\.?0*|\./,"").length>15)throw new TypeError("Cannot implicitly convert a number with >15 significant digits to BigNumber (value: "+e+"). Use function bignumber(x) to convert to BigNumber.");return new t(e)}},{from:"number",to:"Complex",convert:function(e){return r||Nt(e),new r(e,0)}},{from:"number",to:"string",convert:function(e){return e+""}},{from:"BigNumber",to:"Complex",convert:function(e){return r||Nt(e),new r(e.toNumber(),0)}},{from:"Fraction",to:"BigNumber",convert:function(e){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.")}},{from:"Fraction",to:"Complex",convert:function(e){return r||Nt(e),new r(e.valueOf(),0)}},{from:"number",to:"Fraction",convert:function(e){i||Mt(e);var t=new i(e);if(t.valueOf()!==e)throw new TypeError("Cannot implicitly convert a number to a Fraction when there will be a loss of precision (value: "+e+"). Use function fraction(x) to convert to Fraction.");return t}},{from:"string",to:"number",convert:function(e){var t=Number(e);if(isNaN(t))throw new Error('Cannot convert "'+e+'" to a number');return t}},{from:"string",to:"BigNumber",convert:function(e){t||wt(e);try{return new t(e)}catch(t){throw new Error('Cannot convert "'+e+'" to BigNumber')}}},{from:"string",to:"Fraction",convert:function(e){i||Mt(e);try{return new i(e)}catch(t){throw new Error('Cannot convert "'+e+'" to Fraction')}}},{from:"string",to:"Complex",convert:function(e){r||Nt(e);try{return new r(e)}catch(t){throw new Error('Cannot convert "'+e+'" to Complex')}}},{from:"boolean",to:"number",convert:function(e){return+e}},{from:"boolean",to:"BigNumber",convert:function(e){return t||wt(e),new t(+e)}},{from:"boolean",to:"Fraction",convert:function(e){return i||Mt(e),new i(+e)}},{from:"boolean",to:"string",convert:function(e){return String(e)}},{from:"Array",to:"Matrix",convert:function(e){return n||function(){throw new Error("Cannot convert array into a Matrix: no class 'DenseMatrix' provided")}(),new n(e)}},{from:"Matrix",to:"Array",convert:function(e){return e.valueOf()}}],a}));function wt(e){throw new Error("Cannot convert value ".concat(e," into a BigNumber: no class 'BigNumber' provided"))}function Nt(e){throw new Error("Cannot convert value ".concat(e," into a Complex number: no class 'Complex' provided"))}function Mt(e){throw new Error("Cannot convert value ".concat(e," into a Fraction, no class 'Fraction' provided."))}r(13);var Et=Qe("ResultSet",[],(function(){function e(t){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator");this.entries=t||[]}return e.prototype.type="ResultSet",e.prototype.isResultSet=!0,e.prototype.valueOf=function(){return this.entries},e.prototype.toString=function(){return"["+this.entries.join(", ")+"]"},e.prototype.toJSON=function(){return{mathjs:"ResultSet",entries:this.entries}},e.fromJSON=function(t){return new e(t.entries)},e}),{isClass:!0}),St=r(62),At=r.n(St),Ot=Qe("BigNumber",["?on","config"],(function(e){var t=e.on,r=e.config,n=At.a.clone({precision:r.precision,modulo:At.a.EUCLID});return n.prototype=Object.create(n.prototype),n.prototype.type="BigNumber",n.prototype.isBigNumber=!0,n.prototype.toJSON=function(){return{mathjs:"BigNumber",value:this.toString()}},n.fromJSON=function(e){return new n(e.value)},t&&t("config",(function(e,t){e.precision!==t.precision&&n.config({precision:e.precision})})),n}),{isClass:!0}),Ct=r(33),_t=r.n(Ct),Tt=Qe("Complex",[],(function(){return _t.a.prototype.type="Complex",_t.a.prototype.isComplex=!0,_t.a.prototype.toJSON=function(){return{mathjs:"Complex",re:this.re,im:this.im}},_t.a.prototype.toPolar=function(){return{r:this.abs(),phi:this.arg()}},_t.a.prototype.format=function(e){var t=this.im,r=this.re,n=te(this.re,e),i=te(this.im,e),a=o(e)?e:e?e.precision:null;if(null!==a){var s=Math.pow(10,-a);Math.abs(r/t)<s&&(r=0),Math.abs(t/r)<s&&(t=0)}return 0===t?n:0===r?1===t?"i":-1===t?"-i":i+"i":t<0?-1===t?n+" - i":n+" - "+i.substring(1)+"i":1===t?n+" + i":n+" + "+i+"i"},_t.a.fromPolar=function(e){switch(arguments.length){case 1:var t=arguments[0];if("object"===a()(t))return _t()(t);throw new TypeError("Input has to be an object with r and phi keys.");case 2:var r=arguments[0],n=arguments[1];if(o(r)){if(f(n)&&n.hasBase("ANGLE")&&(n=n.toNumber("rad")),o(n))return new _t.a({r:r,phi:n});throw new TypeError("Phi is not a number nor an angle unit.")}throw new TypeError("Radius r is not a number.");default:throw new SyntaxError("Wrong number of arguments in function fromPolar")}},_t.a.prototype.valueOf=_t.a.prototype.toString,_t.a.fromJSON=function(e){return new _t.a(e)},_t.a.compare=function(e,t){return e.re>t.re?1:e.re<t.re?-1:e.im>t.im?1:e.im<t.im?-1:0},_t.a}),{isClass:!0}),It=r(63),kt=r.n(It),zt=Qe("Fraction",[],(function(){return kt.a.prototype.type="Fraction",kt.a.prototype.isFraction=!0,kt.a.prototype.toJSON=function(){return{mathjs:"Fraction",n:this.s*this.n,d:this.d}},kt.a.fromJSON=function(e){return new kt.a(e)},kt.a}),{isClass:!0}),qt=(r(11),Qe("Range",[],(function(){function e(t,r,n){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator");var i=null!=t,a=null!=r,o=null!=n;if(i)if(s(t))t=t.toNumber();else if("number"!=typeof t)throw new TypeError("Parameter start must be a number");if(a)if(s(r))r=r.toNumber();else if("number"!=typeof r)throw new TypeError("Parameter end must be a number");if(o)if(s(n))n=n.toNumber();else if("number"!=typeof n)throw new TypeError("Parameter step must be a number");this.start=i?parseFloat(t):0,this.end=a?parseFloat(r):0,this.step=o?parseFloat(n):1}return e.prototype.type="Range",e.prototype.isRange=!0,e.parse=function(t){if("string"!=typeof t)return null;var r=t.split(":").map((function(e){return parseFloat(e)}));if(r.some((function(e){return isNaN(e)})))return null;switch(r.length){case 2:return new e(r[0],r[1]);case 3:return new e(r[0],r[2],r[1]);default:return null}},e.prototype.clone=function(){return new e(this.start,this.end,this.step)},e.prototype.size=function(){var e=0,t=this.start,r=this.step,n=this.end-t;return W(r)===W(n)?e=Math.ceil(n/r):0===n&&(e=0),isNaN(e)&&(e=0),[e]},e.prototype.min=function(){var e=this.size()[0];return e>0?this.step>0?this.start:this.start+(e-1)*this.step:void 0},e.prototype.max=function(){var e=this.size()[0];return e>0?this.step>0?this.start+(e-1)*this.step:this.start:void 0},e.prototype.forEach=function(e){var t=this.start,r=this.step,n=this.end,i=0;if(r>0)for(;t<n;)e(t,[i],this),t+=r,i++;else if(r<0)for(;t>n;)e(t,[i],this),t+=r,i++},e.prototype.map=function(e){var t=[];return this.forEach((function(r,n,i){t[n[0]]=e(r,n,i)})),t},e.prototype.toArray=function(){var e=[];return this.forEach((function(t,r){e[r[0]]=t})),e},e.prototype.valueOf=function(){return this.toArray()},e.prototype.format=function(e){var t=te(this.start,e);return 1!==this.step&&(t+=":"+te(this.step,e)),t+=":"+te(this.end,e)},e.prototype.toString=function(){return this.format()},e.prototype.toJSON=function(){return{mathjs:"Range",start:this.start,end:this.end,step:this.step}},e.fromJSON=function(t){return new e(t.start,t.end,t.step)},e}),{isClass:!0})),Rt=Qe("Matrix",[],(function(){function e(){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator")}return e.prototype.type="Matrix",e.prototype.isMatrix=!0,e.prototype.storage=function(){throw new Error("Cannot invoke storage on a Matrix interface")},e.prototype.datatype=function(){throw new Error("Cannot invoke datatype on a Matrix interface")},e.prototype.create=function(e,t){throw new Error("Cannot invoke create on a Matrix interface")},e.prototype.subset=function(e,t,r){throw new Error("Cannot invoke subset on a Matrix interface")},e.prototype.get=function(e){throw new Error("Cannot invoke get on a Matrix interface")},e.prototype.set=function(e,t,r){throw new Error("Cannot invoke set on a Matrix interface")},e.prototype.resize=function(e,t){throw new Error("Cannot invoke resize on a Matrix interface")},e.prototype.reshape=function(e,t){throw new Error("Cannot invoke reshape on a Matrix interface")},e.prototype.clone=function(){throw new Error("Cannot invoke clone on a Matrix interface")},e.prototype.size=function(){throw new Error("Cannot invoke size on a Matrix interface")},e.prototype.map=function(e,t){throw new Error("Cannot invoke map on a Matrix interface")},e.prototype.forEach=function(e){throw new Error("Cannot invoke forEach on a Matrix interface")},e.prototype[Symbol.iterator]=function(){throw new Error("Cannot iterate a Matrix interface")},e.prototype.toArray=function(){throw new Error("Cannot invoke toArray on a Matrix interface")},e.prototype.valueOf=function(){throw new Error("Cannot invoke valueOf on a Matrix interface")},e.prototype.format=function(e){throw new Error("Cannot invoke format on a Matrix interface")},e.prototype.toString=function(){throw new Error("Cannot invoke toString on a Matrix interface")},e}),{isClass:!0}),Bt=r(57),Dt=r.n(Bt);function jt(e,t){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(!r){if(Array.isArray(e)||(r=function(e,t){if(!e)return;if("string"==typeof e)return Pt(e,t);var r=Object.prototype.toString.call(e).slice(8,-1);"Object"===r&&e.constructor&&(r=e.constructor.name);if("Map"===r||"Set"===r)return Array.from(e);if("Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r))return Pt(e,t)}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,i=function(){};return{s:i,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,s=!1;return{s:function(){r=r.call(e)},n:function(){var e=r.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==r.return||r.return()}finally{if(s)throw a}}}}function Pt(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=new Array(t);r<t;r++)n[r]=e[r];return n}var Ft=Qe("DenseMatrix",["Matrix"],(function(e){var t=e.Matrix;function r(e,t){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!l(t))throw new Error("Invalid datatype: "+t);if(m(e))"DenseMatrix"===e.type?(this._data=He(e._data),this._size=He(e._size),this._datatype=t||e._datatype):(this._data=e.toArray(),this._size=e.size(),this._datatype=t||e._datatype);else if(e&&p(e.data)&&p(e.size))this._data=e.data,this._size=e.size,Ae(this._data,this._size),this._datatype=t||e.datatype;else if(p(e))this._data=function e(t){for(var r=0,n=t.length;r<n;r++){var i=t[r];p(i)?t[r]=e(i):i&&!0===i.isMatrix&&(t[r]=e(i.valueOf()))}return t}(e),this._size=Se(this._data),Ae(this._data,this._size),this._datatype=t;else{if(e)throw new TypeError("Unsupported type of data ("+H(e)+")");this._data=[],this._size=[0],this._datatype=t}}function n(e,t){if(!g(t))throw new TypeError("Invalid index");if(t.isScalar())return e.get(t.min());var n=t.size();if(n.length!==e._size.length)throw new Me(n.length,e._size.length);for(var i=t.min(),a=t.max(),o=0,s=e._size.length;o<s;o++)Oe(i[o],e._size[o]),Oe(a[o],e._size[o]);return new r(function e(t,r,n,i){var a=i===n-1,o=r.dimension(i);return a?o.map((function(e){return Oe(e,t.length),t[e]})).valueOf():o.map((function(a){Oe(a,t.length);var o=t[a];return e(o,r,n,i+1)})).valueOf()}(e._data,t,n.length,0),e._datatype)}function i(e,t,r,n){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");var i,a=t.size(),o=t.isScalar();if(m(r)?(i=r.size(),r=r.valueOf()):i=Se(r),o){if(0!==i.length)throw new TypeError("Scalar expected");e.set(t.min(),r,n)}else{if(a.length<e._size.length)throw new Me(a.length,e._size.length,"<");if(i.length<a.length){for(var s=0,c=0;1===a[s]&&1===i[s];)s++;for(;1===a[s];)c++,s++;r=ze(r,a.length,c,i)}if(!Ze(a,i))throw new Me(a,i,">");u(e,t.max().map((function(e){return e+1})),n);var f=a.length;!function e(t,r,n,i,a){var o=a===i-1,s=r.dimension(a);o?s.forEach((function(e,r){Oe(e),t[e]=n[r[0]]})):s.forEach((function(o,s){Oe(o),e(t[o],r,n[s[0]],i,a+1)}))}(e._data,t,r,f,0)}return e}function a(e,t,r){if(0===t.length){for(var n=e._data;p(n);)n=n[0];return n}return e._size=t.slice(0),e._data=Ce(e._data,e._size,r),e}function u(e,t,r){for(var n=e._size.slice(0),i=!1;n.length<t.length;)n.push(0),i=!0;for(var o=0,s=t.length;o<s;o++)t[o]>n[o]&&(n[o]=t[o],i=!0);i&&a(e,n,r)}return r.prototype=new t,r.prototype.createDenseMatrix=function(e,t){return new r(e,t)},r.prototype.type="DenseMatrix",r.prototype.isDenseMatrix=!0,r.prototype.getDataType=function(){return Le(this._data,H)},r.prototype.storage=function(){return"dense"},r.prototype.datatype=function(){return this._datatype},r.prototype.create=function(e,t){return new r(e,t)},r.prototype.subset=function(e,t,r){switch(arguments.length){case 1:return n(this,e);case 2:case 3:return i(this,e,t,r);default:throw new SyntaxError("Wrong number of arguments")}},r.prototype.get=function(e){if(!p(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Me(e.length,this._size.length);for(var t=0;t<e.length;t++)Oe(e[t],this._size[t]);for(var r=this._data,n=0,i=e.length;n<i;n++){var a=e[n];Oe(a,r.length),r=r[a]}return r},r.prototype.set=function(e,t,r){if(!p(e))throw new TypeError("Array expected");if(e.length<this._size.length)throw new Me(e.length,this._size.length,"<");var n,i,a;u(this,e.map((function(e){return e+1})),r);var o=this._data;for(n=0,i=e.length-1;n<i;n++)Oe(a=e[n],o.length),o=o[a];return Oe(a=e[e.length-1],o.length),o[a]=t,this},r.prototype.resize=function(e,t,r){if(!h(e))throw new TypeError("Array or Matrix expected");var n=e.valueOf().map((function(e){return Array.isArray(e)&&1===e.length?e[0]:e}));return a(r?this.clone():this,n,t)},r.prototype.reshape=function(e,t){var r=t?this.clone():this;r._data=_e(r._data,e);var n=r._size.reduce((function(e,t){return e*t}));return r._size=Te(e,n),r},r.prototype.clone=function(){return new r({data:He(this._data),size:He(this._size),datatype:this._datatype})},r.prototype.size=function(){return this._size.slice(0)},r.prototype.map=function(e){var t=this,n=function r(n,i){return p(n)?n.map((function(e,t){return r(e,i.concat(t))})):e(n,i,t)}(this._data,[]);return new r(n,void 0!==this._datatype?Le(n,H):void 0)},r.prototype.forEach=function(e){var t=this;!function r(n,i){p(n)?n.forEach((function(e,t){r(e,i.concat(t))})):e(n,i,t)}(this._data,[])},r.prototype[Symbol.iterator]=Dt.a.mark((function e(){var t;return Dt.a.wrap((function(e){for(;;)switch(e.prev=e.next){case 0:return t=Dt.a.mark((function e(t,r){var n;return Dt.a.wrap((function(i){for(;;)switch(i.prev=i.next){case 0:if(!p(t)){i.next=9;break}n=0;case 2:if(!(n<t.length)){i.next=7;break}return i.delegateYield(e(t[n],r.concat(n)),"t0",4);case 4:n++,i.next=2;break;case 7:i.next=11;break;case 9:return i.next=11,{value:t,index:r};case 11:case"end":return i.stop()}}),e)})),e.delegateYield(t(this._data,[]),"t0",2);case 2:case"end":return e.stop()}}),e,this)})),r.prototype.rows=function(){var e=[];if(2!==this.size().length)throw new TypeError("Rows can only be returned for a 2D matrix.");var t,n=jt(this._data);try{for(n.s();!(t=n.n()).done;){var i=t.value;e.push(new r([i],this._datatype))}}catch(e){n.e(e)}finally{n.f()}return e},r.prototype.columns=function(){var e=this,t=[],n=this.size();if(2!==n.length)throw new TypeError("Rows can only be returned for a 2D matrix.");for(var i=this._data,a=function(n){var a=i.map((function(e){return[e[n]]}));t.push(new r(a,e._datatype))},o=0;o<n[1];o++)a(o);return t},r.prototype.toArray=function(){return He(this._data)},r.prototype.valueOf=function(){return this._data},r.prototype.format=function(e){return xe(this._data,e)},r.prototype.toString=function(){return xe(this._data)},r.prototype.toJSON=function(){return{mathjs:"DenseMatrix",data:this._data,size:this._size,datatype:this._datatype}},r.prototype.diagonal=function(e){if(e){if(s(e)&&(e=e.toNumber()),!o(e)||!Z(e))throw new TypeError("The parameter k must be an integer number")}else e=0;for(var t=e>0?e:0,n=e<0?-e:0,i=this._size[0],a=this._size[1],u=Math.min(i-n,a-t),c=[],f=0;f<u;f++)c[f]=this._data[f+n][f+t];return new r({data:c,size:[u],datatype:this._datatype})},r.diagonal=function(e,t,n,i){if(!p(e))throw new TypeError("Array expected, size parameter");if(2!==e.length)throw new Error("Only two dimensions matrix are supported");if(e=e.map((function(e){if(s(e)&&(e=e.toNumber()),!o(e)||!Z(e)||e<1)throw new Error("Size values must be positive integers");return e})),n){if(s(n)&&(n=n.toNumber()),!o(n)||!Z(n))throw new TypeError("The parameter k must be an integer number")}else n=0;var a,u=n>0?n:0,c=n<0?-n:0,f=e[0],l=e[1],h=Math.min(f-c,l-u);if(p(t)){if(t.length!==h)throw new Error("Invalid value array length");a=function(e){return t[e]}}else if(m(t)){var d=t.size();if(1!==d.length||d[0]!==h)throw new Error("Invalid matrix length");a=function(e){return t.get([e])}}else a=function(){return t};i||(i=s(a(0))?a(0).mul(0):0);var v=[];if(e.length>0){v=Ce(v,e,i);for(var y=0;y<h;y++)v[y+c][y+u]=a(y)}return new r({data:v,size:[f,l]})},r.fromJSON=function(e){return new r(e)},r.prototype.swapRows=function(e,t){if(!(o(e)&&Z(e)&&o(t)&&Z(t)))throw new Error("Row index must be positive integers");if(2!==this._size.length)throw new Error("Only two dimensional matrix is supported");return Oe(e,this._size[0]),Oe(t,this._size[0]),r._swapRows(e,t,this._data),this},r._swapRows=function(e,t,r){var n=r[e];r[e]=r[t],r[t]=n},r}),{isClass:!0}),Ut=Qe("clone",["typed"],(function(e){return(0,e.typed)("clone",{any:He})}));function Lt(e){var t,r,n=e.length,i=e[0].length,a=[];for(r=0;r<i;r++){var o=[];for(t=0;t<n;t++)o.push(e[t][r]);a.push(o)}return a}function $t(e){for(var t=0;t<e.length;t++)if(h(e[t]))return!0;return!1}function Ht(e,t){m(e)&&(e=e.valueOf());for(var r=0,n=e.length;r<n;r++){var i=e[r];Array.isArray(i)?Ht(i,t):t(i)}}function Gt(e,t,r){return e&&"function"==typeof e.map?e.map((function(e){return Gt(e,t,r)})):t(e)}function Vt(e,t,r){var n=Array.isArray(e)?Se(e):e.size();if(t<0||t>=n.length)throw new Ee(t,n.length);return m(e)?e.create(Zt(e.valueOf(),t,r)):Zt(e,t,r)}function Zt(e,t,r){var n,i,a,o;if(t<=0){if(Array.isArray(e[0])){for(o=Lt(e),i=[],n=0;n<o.length;n++)i[n]=Zt(o[n],t-1,r);return i}for(a=e[0],n=1;n<e.length;n++)a=r(a,e[n]);return a}for(i=[],n=0;n<e.length;n++)i[n]=Zt(e[n],t-1,r);return i}function Wt(e,t,r,n,i,a,o,s,u,c,f){var l,p,m,h,d=e._values,v=e._index,y=e._ptr;if(n)for(p=y[t],m=y[t+1],l=p;l<m;l++)r[h=v[l]]!==a?(r[h]=a,o.push(h),c?(n[h]=u?s(d[l],f):s(f,d[l]),i[h]=a):n[h]=d[l]):(n[h]=u?s(d[l],n[h]):s(n[h],d[l]),i[h]=a);else for(p=y[t],m=y[t+1],l=p;l<m;l++)r[h=v[l]]!==a?(r[h]=a,o.push(h)):i[h]=a}var Yt=Qe("isInteger",["typed"],(function(e){return(0,e.typed)("isInteger",{number:Z,BigNumber:function(e){return e.isInt()},Fraction:function(e){return 1===e.d&&isFinite(e.n)},"Array | Matrix":function(e){return Gt(e,this)}})}));r(180);function Jt(e){return e<0}function Xt(e){return e>0}function Qt(e){return 0===e}function Kt(e){return Number.isNaN(e)}Jt.signature="number",Xt.signature="number",Qt.signature="number",Kt.signature="number";var er=Qe("isNegative",["typed"],(function(e){return(0,e.typed)("isNegative",{number:Jt,BigNumber:function(e){return e.isNeg()&&!e.isZero()&&!e.isNaN()},Fraction:function(e){return e.s<0},Unit:function(e){return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),tr=Qe("isNumeric",["typed"],(function(e){return(0,e.typed)("isNumeric",{"number | BigNumber | Fraction | boolean":function(){return!0},"Complex | Unit | string | null | undefined | Node":function(){return!1},"Array | Matrix":function(e){return Gt(e,this)}})})),rr=(r(235),Qe("hasNumericValue",["typed","isNumeric"],(function(e){var t=e.typed,r=e.isNumeric;return t("hasNumericValue",{string:function(e){return e.trim().length>0&&!isNaN(Number(e))},any:function(e){return r(e)}})}))),nr=Qe("isPositive",["typed"],(function(e){return(0,e.typed)("isPositive",{number:Xt,BigNumber:function(e){return!e.isNeg()&&!e.isZero()&&!e.isNaN()},Fraction:function(e){return e.s>0&&e.n>0},Unit:function(e){return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),ir=Qe("isZero",["typed"],(function(e){return(0,e.typed)("isZero",{number:Qt,BigNumber:function(e){return e.isZero()},Complex:function(e){return 0===e.re&&0===e.im},Fraction:function(e){return 1===e.d&&0===e.n},Unit:function(e){return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),ar=Qe("isNaN",["typed"],(function(e){return(0,e.typed)("isNaN",{number:Kt,BigNumber:function(e){return e.isNaN()},Fraction:function(e){return!1},Complex:function(e){return e.isNaN()},Unit:function(e){return Number.isNaN(e.value)},"Array | Matrix":function(e){return Gt(e,Number.isNaN)}})})),or=Qe("typeOf",["typed"],(function(e){return(0,e.typed)("typeOf",{any:H})}));function sr(e,t,r){if(null==r)return e.eq(t);if(e.eq(t))return!0;if(e.isNaN()||t.isNaN())return!1;if(e.isFinite()&&t.isFinite()){var n=e.minus(t).abs();if(n.isZero())return!0;var i=e.constructor.max(e.abs(),t.abs());return n.lte(i.times(r))}return!1}var ur=Qe("equalScalar",["typed","config"],(function(e){var t=e.typed,r=e.config;return t("equalScalar",{"boolean, boolean":function(e,t){return e===t},"number, number":function(e,t){return ue(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.eq(t)||sr(e,t,r.epsilon)},"Fraction, Fraction":function(e,t){return e.equals(t)},"Complex, Complex":function(e,t){return function(e,t,r){return ue(e.re,t.re,r)&&ue(e.im,t.im,r)}(e,t,r.epsilon)},"Unit, Unit":function(e,t){if(!e.equalBase(t))throw new Error("Cannot compare units with different base");return this(e.value,t.value)}})})),cr=(Qe("equalScalar",["typed","config"],(function(e){var t=e.typed,r=e.config;return t("equalScalar",{"number, number":function(e,t){return ue(e,t,r.epsilon)}})})),r(24),Qe("SparseMatrix",["typed","equalScalar","Matrix"],(function(e){var t=e.typed,r=e.equalScalar,n=e.Matrix;function i(e,t){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!l(t))throw new Error("Invalid datatype: "+t);if(m(e))!function(e,t,r){"SparseMatrix"===t.type?(e._values=t._values?He(t._values):void 0,e._index=He(t._index),e._ptr=He(t._ptr),e._size=He(t._size),e._datatype=r||t._datatype):a(e,t.valueOf(),r||t._datatype)}(this,e,t);else if(e&&p(e.index)&&p(e.ptr)&&p(e.size))this._values=e.values,this._index=e.index,this._ptr=e.ptr,this._size=e.size,this._datatype=t||e.datatype;else if(p(e))a(this,e,t);else{if(e)throw new TypeError("Unsupported type of data ("+H(e)+")");this._values=[],this._index=[],this._ptr=[0],this._size=[0,0],this._datatype=t}}function a(e,n,i){e._values=[],e._index=[],e._ptr=[],e._datatype=i;var a=n.length,o=0,s=r,u=0;if(l(i)&&(s=t.find(r,[i,i])||r,u=t.convert(0,i)),a>0){var c=0;do{e._ptr.push(e._index.length);for(var f=0;f<a;f++){var m=n[f];if(p(m)){if(0===c&&o<m.length&&(o=m.length),c<m.length){var h=m[c];s(h,u)||(e._values.push(h),e._index.push(f))}}else 0===c&&o<1&&(o=1),s(m,u)||(e._values.push(m),e._index.push(f))}c++}while(c<o)}e._ptr.push(e._index.length),e._size=[a,o]}function u(e,t){if(!g(t))throw new TypeError("Invalid index");if(t.isScalar())return e.get(t.min());var r,n,a,o,s=t.size();if(s.length!==e._size.length)throw new Me(s.length,e._size.length);var u=t.min(),c=t.max();for(r=0,n=e._size.length;r<n;r++)Oe(u[r],e._size[r]),Oe(c[r],e._size[r]);var f=e._values,l=e._index,p=e._ptr,m=t.dimension(0),h=t.dimension(1),d=[],v=[];m.forEach((function(e,t){v[e]=t[0],d[e]=!0}));var y=f?[]:void 0,x=[],b=[];return h.forEach((function(e){for(b.push(x.length),a=p[e],o=p[e+1];a<o;a++)r=l[a],!0===d[r]&&(x.push(v[r]),y&&y.push(f[a]))})),b.push(x.length),new i({values:y,index:x,ptr:b,size:s,datatype:e._datatype})}function c(e,t,r,n){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");var i,a=t.size(),o=t.isScalar();if(m(r)?(i=r.size(),r=r.toArray()):i=Se(r),o){if(0!==i.length)throw new TypeError("Scalar expected");e.set(t.min(),r,n)}else{if(1!==a.length&&2!==a.length)throw new Me(a.length,e._size.length,"<");if(i.length<a.length){for(var s=0,u=0;1===a[s]&&1===i[s];)s++;for(;1===a[s];)u++,s++;r=ze(r,a.length,u,i)}if(!Ze(a,i))throw new Me(a,i,">");if(1===a.length){t.dimension(0).forEach((function(t,i){Oe(t),e.set([t,0],r[i[0]],n)}))}else{var c=t.dimension(0),f=t.dimension(1);c.forEach((function(t,i){Oe(t),f.forEach((function(a,o){Oe(a),e.set([t,a],r[i[0]][o[0]],n)}))}))}}return e}function f(e,t,r,n){if(r-t==0)return r;for(var i=t;i<r;i++)if(n[i]===e)return i;return t}function d(e,t,r,n,i,a,o){i.splice(e,0,n),a.splice(e,0,t);for(var s=r+1;s<o.length;s++)o[s]++}function v(e,n,i,a){var o=a||0,s=r,u=0;l(e._datatype)&&(s=t.find(r,[e._datatype,e._datatype])||r,u=t.convert(0,e._datatype),o=t.convert(o,e._datatype));var c,f,p,m=!s(o,u),h=e._size[0],d=e._size[1];if(i>d){for(f=d;f<i;f++)if(e._ptr[f]=e._values.length,m)for(c=0;c<h;c++)e._values.push(o),e._index.push(c);e._ptr[i]=e._values.length}else i<d&&(e._ptr.splice(i+1,d-i),e._values.splice(e._ptr[i],e._values.length),e._index.splice(e._ptr[i],e._index.length));if(d=i,n>h){if(m){var v=0;for(f=0;f<d;f++){e._ptr[f]=e._ptr[f]+v,p=e._ptr[f+1]+v;var y=0;for(c=h;c<n;c++,y++)e._values.splice(p+y,0,o),e._index.splice(p+y,0,c),v++}e._ptr[d]=e._values.length}}else if(n<h){var g=0;for(f=0;f<d;f++){e._ptr[f]=e._ptr[f]-g;var x=e._ptr[f],b=e._ptr[f+1]-g;for(p=x;p<b;p++)(c=e._index[p])>n-1&&(e._values.splice(p,1),e._index.splice(p,1),g++)}e._ptr[f]=e._values.length}return e._size[0]=n,e._size[1]=i,e}function y(e,t,r,n,i){var a,o,s=n[0],u=n[1],c=[];for(a=0;a<s;a++)for(c[a]=[],o=0;o<u;o++)c[a][o]=0;for(o=0;o<u;o++)for(var f=r[o],l=r[o+1],p=f;p<l;p++)c[a=t[p]][o]=e?i?He(e[p]):e[p]:1;return c}return i.prototype=new n,i.prototype.createSparseMatrix=function(e,t){return new i(e,t)},i.prototype.type="SparseMatrix",i.prototype.isSparseMatrix=!0,i.prototype.getDataType=function(){return Le(this._values,H)},i.prototype.storage=function(){return"sparse"},i.prototype.datatype=function(){return this._datatype},i.prototype.create=function(e,t){return new i(e,t)},i.prototype.density=function(){var e=this._size[0],t=this._size[1];return 0!==e&&0!==t?this._index.length/(e*t):0},i.prototype.subset=function(e,t,r){if(!this._values)throw new Error("Cannot invoke subset on a Pattern only matrix");switch(arguments.length){case 1:return u(this,e);case 2:case 3:return c(this,e,t,r);default:throw new SyntaxError("Wrong number of arguments")}},i.prototype.get=function(e){if(!p(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Me(e.length,this._size.length);if(!this._values)throw new Error("Cannot invoke get on a Pattern only matrix");var t=e[0],r=e[1];Oe(t,this._size[0]),Oe(r,this._size[1]);var n=f(t,this._ptr[r],this._ptr[r+1],this._index);return n<this._ptr[r+1]&&this._index[n]===t?this._values[n]:0},i.prototype.set=function(e,n,i){if(!p(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Me(e.length,this._size.length);if(!this._values)throw new Error("Cannot invoke set on a Pattern only matrix");var a=e[0],o=e[1],s=this._size[0],u=this._size[1],c=r,m=0;l(this._datatype)&&(c=t.find(r,[this._datatype,this._datatype])||r,m=t.convert(0,this._datatype)),(a>s-1||o>u-1)&&(v(this,Math.max(a+1,s),Math.max(o+1,u),i),s=this._size[0],u=this._size[1]),Oe(a,s),Oe(o,u);var h=f(a,this._ptr[o],this._ptr[o+1],this._index);return h<this._ptr[o+1]&&this._index[h]===a?c(n,m)?function(e,t,r,n,i){r.splice(e,1),n.splice(e,1);for(var a=t+1;a<i.length;a++)i[a]--}(h,o,this._values,this._index,this._ptr):this._values[h]=n:d(h,a,o,n,this._values,this._index,this._ptr),this},i.prototype.resize=function(e,t,r){if(!h(e))throw new TypeError("Array or Matrix expected");var n=e.valueOf().map((function(e){return Array.isArray(e)&&1===e.length?e[0]:e}));if(2!==n.length)throw new Error("Only two dimensions matrix are supported");return n.forEach((function(e){if(!o(e)||!Z(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+xe(n)+")")})),v(r?this.clone():this,n[0],n[1],t)},i.prototype.reshape=function(e,t){if(!p(e))throw new TypeError("Array expected");if(2!==e.length)throw new Error("Sparse matrices can only be reshaped in two dimensions");e.forEach((function(t){if(!o(t)||!Z(t)||t<=-2||0===t)throw new TypeError("Invalid size, must contain positive integers or -1 (size: "+xe(e)+")")}));var r=this._size[0]*this._size[1];if(r!==(e=Te(e,r))[0]*e[1])throw new Error("Reshaping sparse matrix will result in the wrong number of elements");var n=t?this.clone():this;if(this._size[0]===e[0]&&this._size[1]===e[1])return n;for(var i=[],a=0;a<n._ptr.length;a++)for(var s=0;s<n._ptr[a+1]-n._ptr[a];s++)i.push(a);for(var u=n._values.slice(),c=n._index.slice(),l=0;l<n._index.length;l++){var m=c[l],h=i[l],v=m*n._size[1]+h;i[l]=v%e[1],c[l]=Math.floor(v/e[1])}n._values.length=0,n._index.length=0,n._ptr.length=e[1]+1,n._size=e.slice();for(var y=0;y<n._ptr.length;y++)n._ptr[y]=0;for(var g=0;g<u.length;g++){var x=c[g],b=i[g],w=u[g];d(f(x,n._ptr[b],n._ptr[b+1],n._index),x,b,w,n._values,n._index,n._ptr)}return n},i.prototype.clone=function(){return new i({values:this._values?He(this._values):void 0,index:He(this._index),ptr:He(this._ptr),size:He(this._size),datatype:this._datatype})},i.prototype.size=function(){return this._size.slice(0)},i.prototype.map=function(e,n){if(!this._values)throw new Error("Cannot invoke map on a Pattern only matrix");var a=this;return function(e,n,a,o,s,u,c){var f=[],p=[],m=[],h=r,d=0;l(e._datatype)&&(h=t.find(r,[e._datatype,e._datatype])||r,d=t.convert(0,e._datatype));for(var v=function(e,t,r){e=u(e,t,r),h(e,d)||(f.push(e),p.push(t))},y=o;y<=s;y++){m.push(f.length);var g=e._ptr[y],x=e._ptr[y+1];if(c)for(var b=g;b<x;b++){var w=e._index[b];w>=n&&w<=a&&v(e._values[b],w-n,y-o)}else{for(var N={},M=g;M<x;M++){var E=e._index[M];N[E]=e._values[M]}for(var S=n;S<=a;S++){var A=S in N?N[S]:0;v(A,S-n,y-o)}}}return m.push(f.length),new i({values:f,index:p,ptr:m,size:[a-n+1,s-o+1]})}(this,0,this._size[0]-1,0,this._size[1]-1,(function(t,r,n){return e(t,[r,n],a)}),n)},i.prototype.forEach=function(e,t){if(!this._values)throw new Error("Cannot invoke forEach on a Pattern only matrix");for(var r=this._size[0],n=this._size[1],i=0;i<n;i++){var a=this._ptr[i],o=this._ptr[i+1];if(t)for(var s=a;s<o;s++){var u=this._index[s];e(this._values[s],[u,i],this)}else{for(var c={},f=a;f<o;f++){c[this._index[f]]=this._values[f]}for(var l=0;l<r;l++){e(l in c?c[l]:0,[l,i],this)}}}},i.prototype[Symbol.iterator]=Dt.a.mark((function e(){var t,r,n,i,a,o;return Dt.a.wrap((function(e){for(;;)switch(e.prev=e.next){case 0:if(this._values){e.next=2;break}throw new Error("Cannot iterate a Pattern only matrix");case 2:t=this._size[1],r=0;case 4:if(!(r<t)){e.next=18;break}n=this._ptr[r],i=this._ptr[r+1],a=n;case 8:if(!(a<i)){e.next=15;break}return o=this._index[a],e.next=12,{value:this._values[a],index:[o,r]};case 12:a++,e.next=8;break;case 15:r++,e.next=4;break;case 18:case"end":return e.stop()}}),e,this)})),i.prototype.toArray=function(){return y(this._values,this._index,this._ptr,this._size,!0)},i.prototype.valueOf=function(){return y(this._values,this._index,this._ptr,this._size,!1)},i.prototype.format=function(e){for(var t=this._size[0],r=this._size[1],n=this.density(),i="Sparse Matrix ["+xe(t,e)+" x "+xe(r,e)+"] density: "+xe(n,e)+"\n",a=0;a<r;a++)for(var o=this._ptr[a],s=this._ptr[a+1],u=o;u<s;u++){i+="\n    ("+xe(this._index[u],e)+", "+xe(a,e)+") ==> "+(this._values?xe(this._values[u],e):"X")}return i},i.prototype.toString=function(){return xe(this.toArray())},i.prototype.toJSON=function(){return{mathjs:"SparseMatrix",values:this._values,index:this._index,ptr:this._ptr,size:this._size,datatype:this._datatype}},i.prototype.diagonal=function(e){if(e){if(s(e)&&(e=e.toNumber()),!o(e)||!Z(e))throw new TypeError("The parameter k must be an integer number")}else e=0;var t=e>0?e:0,r=e<0?-e:0,n=this._size[0],a=this._size[1],u=Math.min(n-r,a-t),c=[],f=[],l=[];l[0]=0;for(var p=t;p<a&&c.length<u;p++)for(var m=this._ptr[p],h=this._ptr[p+1],d=m;d<h;d++){var v=this._index[d];if(v===p-t+r){c.push(this._values[d]),f[c.length-1]=v-r;break}}return l.push(c.length),new i({values:c,index:f,ptr:l,size:[u,1]})},i.fromJSON=function(e){return new i(e)},i.diagonal=function(e,n,a,u,c){if(!p(e))throw new TypeError("Array expected, size parameter");if(2!==e.length)throw new Error("Only two dimensions matrix are supported");if(e=e.map((function(e){if(s(e)&&(e=e.toNumber()),!o(e)||!Z(e)||e<1)throw new Error("Size values must be positive integers");return e})),a){if(s(a)&&(a=a.toNumber()),!o(a)||!Z(a))throw new TypeError("The parameter k must be an integer number")}else a=0;var f=r,h=0;l(c)&&(f=t.find(r,[c,c])||r,h=t.convert(0,c));var d,v=a>0?a:0,y=a<0?-a:0,g=e[0],x=e[1],b=Math.min(g-y,x-v);if(p(n)){if(n.length!==b)throw new Error("Invalid value array length");d=function(e){return n[e]}}else if(m(n)){var w=n.size();if(1!==w.length||w[0]!==b)throw new Error("Invalid matrix length");d=function(e){return n.get([e])}}else d=function(){return n};for(var N=[],M=[],E=[],S=0;S<x;S++){E.push(N.length);var A=S-v;if(A>=0&&A<b){var O=d(A);f(O,h)||(M.push(A+y),N.push(O))}}return E.push(N.length),new i({values:N,index:M,ptr:E,size:[g,x]})},i.prototype.swapRows=function(e,t){if(!(o(e)&&Z(e)&&o(t)&&Z(t)))throw new Error("Row index must be positive integers");if(2!==this._size.length)throw new Error("Only two dimensional matrix is supported");return Oe(e,this._size[0]),Oe(t,this._size[0]),i._swapRows(e,t,this._size[1],this._values,this._index,this._ptr),this},i._forEachRow=function(e,t,r,n,i){for(var a=n[e],o=n[e+1],s=a;s<o;s++)i(r[s],t[s])},i._swapRows=function(e,t,r,n,i,a){for(var o=0;o<r;o++){var s=a[o],u=a[o+1],c=f(e,s,u,i),l=f(t,s,u,i);if(c<u&&l<u&&i[c]===e&&i[l]===t){if(n){var p=n[c];n[c]=n[l],n[l]=p}}else if(c<u&&i[c]===e&&(l>=u||i[l]!==t)){var m=n?n[c]:void 0;i.splice(l,0,t),n&&n.splice(l,0,m),i.splice(l<=c?c+1:c,1),n&&n.splice(l<=c?c+1:c,1)}else if(l<u&&i[l]===t&&(c>=u||i[c]!==e)){var h=n?n[l]:void 0;i.splice(c,0,e),n&&n.splice(c,0,h),i.splice(c<=l?l+1:l,1),n&&n.splice(c<=l?l+1:l,1)}}},i}),{isClass:!0}));var fr=Qe("number",["typed"],(function(e){var t=(0,e.typed)("number",{"":function(){return 0},number:function(e){return e},string:function(e){if("NaN"===e)return NaN;var t,r,n=(r=(t=e).match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/))?{input:t,radix:{"0b":2,"0o":8,"0x":16}[r[1]],integerPart:r[2],fractionalPart:r[3]}:null;if(n)return function(e){for(var t=parseInt(e.integerPart,e.radix),r=0,n=0;n<e.fractionalPart.length;n++){r+=parseInt(e.fractionalPart[n],e.radix)/Math.pow(e.radix,n+1)}var i=t+r;if(isNaN(i))throw new SyntaxError('String "'+e.input+'" is no valid number');return i}(n);var i=0,a=e.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);a&&(i=Number(a[2]),e=a[1]);var o=Number(e);if(isNaN(o))throw new SyntaxError('String "'+e+'" is no valid number');if(a){if(o>Math.pow(2,i)-1)throw new SyntaxError('String "'.concat(e,'" is out of range'));o>=Math.pow(2,i-1)&&(o-=Math.pow(2,i))}return o},BigNumber:function(e){return e.toNumber()},Fraction:function(e){return e.valueOf()},Unit:function(e){throw new Error("Second argument with valueless unit expected")},null:function(e){return 0},"Unit, string | Unit":function(e,t){return e.toNumber(t)},"Array | Matrix":function(e){return Gt(e,this)}});return t.fromJSON=function(e){return parseFloat(e.value)},t})),lr=Qe("string",["typed"],(function(e){return(0,e.typed)("string",{"":function(){return""},number:te,null:function(e){return"null"},boolean:function(e){return e+""},string:function(e){return e},"Array | Matrix":function(e){return Gt(e,this)},any:function(e){return String(e)}})})),pr=Qe("boolean",["typed"],(function(e){return(0,e.typed)("boolean",{"":function(){return!1},boolean:function(e){return e},number:function(e){return!!e},null:function(e){return!1},BigNumber:function(e){return!e.isZero()},string:function(e){var t=e.toLowerCase();if("true"===t)return!0;if("false"===t)return!1;var r=Number(e);if(""!==e&&!isNaN(r))return!!r;throw new Error('Cannot convert "'+e+'" to a boolean')},"Array | Matrix":function(e){return Gt(e,this)}})})),mr=Qe("bignumber",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("bignumber",{"":function(){return new r(0)},number:function(e){return new r(e+"")},string:function(e){var t=e.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);if(t){var n=t[2],i=r(t[1]),a=new r(2).pow(Number(n));if(i.gt(a.sub(1)))throw new SyntaxError('String "'.concat(e,'" is out of range'));var o=new r(2).pow(Number(n)-1);return i.gte(o)?i.sub(a):i}return new r(e)},BigNumber:function(e){return e},Fraction:function(e){return new r(e.n).div(e.d).times(e.s)},null:function(e){return new r(0)},"Array | Matrix":function(e){return Gt(e,this)}})})),hr=Qe("complex",["typed","Complex"],(function(e){var t=e.typed,r=e.Complex;return t("complex",{"":function(){return r.ZERO},number:function(e){return new r(e,0)},"number, number":function(e,t){return new r(e,t)},"BigNumber, BigNumber":function(e,t){return new r(e.toNumber(),t.toNumber())},Fraction:function(e){return new r(e.valueOf(),0)},Complex:function(e){return e.clone()},string:function(e){return r(e)},null:function(e){return r(0)},Object:function(e){if("re"in e&&"im"in e)return new r(e.re,e.im);if("r"in e&&"phi"in e||"abs"in e&&"arg"in e)return new r(e);throw new Error("Expected object with properties (re and im) or (r and phi) or (abs and arg)")},"Array | Matrix":function(e){return Gt(e,this)}})})),dr=Qe("fraction",["typed","Fraction"],(function(e){var t=e.typed,r=e.Fraction;return t("fraction",{number:function(e){if(!isFinite(e)||isNaN(e))throw new Error(e+" cannot be represented as a fraction");return new r(e)},string:function(e){return new r(e)},"number, number":function(e,t){return new r(e,t)},null:function(e){return new r(0)},BigNumber:function(e){return new r(e.toString())},Fraction:function(e){return e},Object:function(e){return new r(e)},"Array | Matrix":function(e){return Gt(e,this)}})})),vr=(r(46),Qe("matrix",["typed","Matrix","DenseMatrix","SparseMatrix"],(function(e){var t=e.typed,r=(e.Matrix,e.DenseMatrix),n=e.SparseMatrix;return t("matrix",{"":function(){return i([])},string:function(e){return i([],e)},"string, string":function(e,t){return i([],e,t)},Array:function(e){return i(e)},Matrix:function(e){return i(e,e.storage())},"Array | Matrix, string":i,"Array | Matrix, string, string":i});function i(e,t,i){if("dense"===t||"default"===t||void 0===t)return new r(e,i);if("sparse"===t)return new n(e,i);throw new TypeError("Unknown matrix type "+JSON.stringify(t)+".")}}))),yr=Qe("matrixFromFunction",["typed","matrix","isZero"],(function(e){var t=e.typed,r=e.matrix,n=e.isZero;return t("matrixFromFunction",{"Array | Matrix, function, string, string":function(e,t,r,n){return i(e,t,r,n)},"Array | Matrix, function, string":function(e,t,r){return i(e,t,r)},"Matrix, function":function(e,t){return i(e,t,"dense")},"Array, function":function(e,t){return i(e,t,"dense").toArray()},"Array | Matrix, string, function":function(e,t,r){return i(e,r,t)},"Array | Matrix, string, string, function":function(e,t,r,n){return i(e,n,t,r)}});function i(e,t,i,a){var o;return(o=void 0!==a?r(i,a):r(i)).resize(e),o.forEach((function(e,r){var i=t(r);n(i)||o.set(r,i)})),o}}));function gr(e,t){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(!r){if(Array.isArray(e)||(r=function(e,t){if(!e)return;if("string"==typeof e)return xr(e,t);var r=Object.prototype.toString.call(e).slice(8,-1);"Object"===r&&e.constructor&&(r=e.constructor.name);if("Map"===r||"Set"===r)return Array.from(e);if("Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r))return xr(e,t)}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,i=function(){};return{s:i,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,s=!1;return{s:function(){r=r.call(e)},n:function(){var e=r.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==r.return||r.return()}finally{if(s)throw a}}}}function xr(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=new Array(t);r<t;r++)n[r]=e[r];return n}var br=Qe("matrixFromRows",["typed","matrix","flatten","size"],(function(e){var t=e.typed,r=e.matrix,n=e.flatten,i=e.size;return t("matrixFromRows",{"...Array":function(e){return a(e)},"...Matrix":function(e){return r(a(e.map((function(e){return e.toArray()}))))}});function a(e){if(0===e.length)throw new TypeError("At least one row is needed to construct a matrix.");var t,r=o(e[0]),i=[],a=gr(e);try{for(a.s();!(t=a.n()).done;){var s=t.value,u=o(s);if(u!==r)throw new TypeError("The vectors had different length: "+(0|r)+" ≠ "+(0|u));i.push(n(s))}}catch(e){a.e(e)}finally{a.f()}return i}function o(e){var t=i(e);if(1===t.length)return t[0];if(2===t.length){if(1===t[0])return t[1];if(1===t[1])return t[0];throw new TypeError("At least one of the arguments is not a vector.")}throw new TypeError("Only one- or two-dimensional vectors are supported.")}}));function wr(e,t){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(!r){if(Array.isArray(e)||(r=function(e,t){if(!e)return;if("string"==typeof e)return Nr(e,t);var r=Object.prototype.toString.call(e).slice(8,-1);"Object"===r&&e.constructor&&(r=e.constructor.name);if("Map"===r||"Set"===r)return Array.from(e);if("Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r))return Nr(e,t)}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,i=function(){};return{s:i,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,s=!1;return{s:function(){r=r.call(e)},n:function(){var e=r.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==r.return||r.return()}finally{if(s)throw a}}}}function Nr(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=new Array(t);r<t;r++)n[r]=e[r];return n}var Mr=Qe("matrixFromColumns",["typed","matrix","flatten","size"],(function(e){var t=e.typed,r=e.matrix,n=e.flatten,i=e.size;return t("matrixFromColumns",{"...Array":function(e){return a(e)},"...Matrix":function(e){return r(a(e.map((function(e){return e.toArray()}))))}});function a(e){if(0===e.length)throw new TypeError("At least one column is needed to construct a matrix.");for(var t=o(e[0]),r=[],i=0;i<t;i++)r[i]=[];var a,s=wr(e);try{for(s.s();!(a=s.n()).done;){var u=a.value,c=o(u);if(c!==t)throw new TypeError("The vectors had different length: "+(0|t)+" ≠ "+(0|c));for(var f=n(u),l=0;l<t;l++)r[l].push(f[l])}}catch(e){s.e(e)}finally{s.f()}return r}function o(e){var t=i(e);if(1===t.length)return t[0];if(2===t.length){if(1===t[0])return t[1];if(1===t[1])return t[0];throw new TypeError("At least one of the arguments is not a vector.")}throw new TypeError("Only one- or two-dimensional vectors are supported.")}})),Er=Qe("splitUnit",["typed"],(function(e){return(0,e.typed)("splitUnit",{"Unit, Array":function(e,t){return e.splitUnit(t)}})})),Sr="number, number";function Ar(e){return Math.abs(e)}function Or(e,t){return e+t}function Cr(e,t){return e*t}function _r(e){return-e}function Tr(e){return e}function Ir(e){return Q(e)}function kr(e){return Math.ceil(e)}function zr(e){return e*e*e}function qr(e){return Math.exp(e)}function Rr(e){return K(e)}function Br(e,t){if(!Z(e)||!Z(t))throw new Error("Parameters in function gcd must be integer numbers");for(var r;0!==t;)r=e%t,e=t,t=r;return e<0?-e:e}function Dr(e,t){if(!Z(e)||!Z(t))throw new Error("Parameters in function lcm must be integer numbers");if(0===e||0===t)return 0;for(var r,n=e*t;0!==t;)t=e%(r=t),e=r;return Math.abs(n/e)}function jr(e){return J(e)}function Pr(e){return Y(e)}function Fr(e,t){if(t>0)return e-t*Math.floor(e/t);if(0===t)return e;throw new Error("Cannot calculate mod for a negative divisor")}function Ur(e,t){var r=t<0;if(r&&(t=-t),0===t)throw new Error("Root must be non-zero");if(e<0&&Math.abs(t)%2!=1)throw new Error("Root must be odd when a is negative.");if(0===e)return r?1/0:0;if(!isFinite(e))return r?0:e;var n=Math.pow(Math.abs(e),1/t);return n=e<0?-n:n,r?1/n:n}function Lr(e){return W(e)}function $r(e){return e*e}function Hr(e,t){var r,n,i,a=0,o=1,s=1,u=0;if(!Z(e)||!Z(t))throw new Error("Parameters in function xgcd must be integer numbers");for(;t;)i=e-(n=Math.floor(e/t))*t,r=a,a=o-n*a,o=r,r=s,s=u-n*s,u=r,e=t,t=i;return e<0?[-e,-o,-u]:[e,e?o:0,u]}function Gr(e,t){return e*e<1&&t===1/0||e*e>1&&t===-1/0?0:Math.pow(e,t)}function Vr(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;return parseFloat(ne(e,t))}Ar.signature="number",Or.signature=Sr,Cr.signature=Sr,_r.signature="number",Tr.signature="number",Ir.signature="number",kr.signature="number",zr.signature="number",qr.signature="number",Rr.signature="number",Br.signature=Sr,Dr.signature=Sr,jr.signature="number",Pr.signature="number",Fr.signature=Sr,Ur.signature=Sr,Lr.signature="number",$r.signature="number",Hr.signature=Sr,Gr.signature=Sr,Vr.signature=Sr;var Zr=Qe("unaryMinus",["typed"],(function(e){return(0,e.typed)("unaryMinus",{number:_r,Complex:function(e){return e.neg()},BigNumber:function(e){return e.neg()},Fraction:function(e){return e.neg()},Unit:function(e){var t=e.clone();return t.value=this(e.value),t},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),Wr=Qe("unaryPlus",["typed","config","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.BigNumber;return t("unaryPlus",{number:Tr,Complex:function(e){return e},BigNumber:function(e){return e},Fraction:function(e){return e},Unit:function(e){return e.clone()},"Array | Matrix":function(e){return Gt(e,this,!0)},"boolean | string":function(e){return"BigNumber"===r.number?new n(+e):+e}})})),Yr=Qe("abs",["typed"],(function(e){return(0,e.typed)("abs",{number:Ar,Complex:function(e){return e.abs()},BigNumber:function(e){return e.abs()},Fraction:function(e){return e.abs()},"Array | Matrix":function(e){return Gt(e,this,!0)},Unit:function(e){return e.abs()}})})),Jr=Qe("apply",["typed","isInteger"],(function(e){var t=e.typed,r=e.isInteger;return t("apply",{"Array | Matrix, number | BigNumber, function":function(e,t,n){if(!r(t))throw new TypeError("Integer number expected for dimension");var i=Array.isArray(e)?Se(e):e.size();if(t<0||t>=i.length)throw new Ee(t,i.length);return m(e)?e.create(Xr(e.valueOf(),t,n)):Xr(e,t,n)}})}));function Xr(e,t,r){var n,i,a;if(t<=0){if(Array.isArray(e[0])){for(a=function(e){var t,r,n=e.length,i=e[0].length,a=[];for(r=0;r<i;r++){var o=[];for(t=0;t<n;t++)o.push(e[t][r]);a.push(o)}return a}(e),i=[],n=0;n<a.length;n++)i[n]=Xr(a[n],t-1,r);return i}return r(e)}for(i=[],n=0;n<e.length;n++)i[n]=Xr(e[n],t-1,r);return i}var Qr=Qe("addScalar",["typed"],(function(e){return(0,e.typed)("addScalar",{"number, number":Or,"Complex, Complex":function(e,t){return e.add(t)},"BigNumber, BigNumber":function(e,t){return e.plus(t)},"Fraction, Fraction":function(e,t){return e.add(t)},"Unit, Unit":function(e,t){if(null===e.value||void 0===e.value)throw new Error("Parameter x contains a unit with undefined value");if(null===t.value||void 0===t.value)throw new Error("Parameter y contains a unit with undefined value");if(!e.equalBase(t))throw new Error("Units do not match");var r=e.clone();return r.value=this(r.value,t.value),r.fixPrefix=!1,r}})})),Kr=Qe("cbrt",["config","typed","isNegative","unaryMinus","matrix","Complex","BigNumber","Fraction"],(function(e){var t=e.config,r=e.typed,n=e.isNegative,i=e.unaryMinus,a=e.matrix,o=e.Complex,f=e.BigNumber,l=e.Fraction;return r("cbrt",{number:Ir,Complex:p,"Complex, boolean":p,BigNumber:function(e){return e.cbrt()},Unit:function(e){if(e.value&&u(e.value)){var t=e.clone();return t.value=1,(t=t.pow(1/3)).value=p(e.value),t}var r,a=n(e.value);a&&(e.value=i(e.value)),r=s(e.value)?new f(1).div(3):c(e.value)?new l(1,3):1/3;var o=e.pow(r);return a&&(o.value=i(o.value)),o},"Array | Matrix":function(e){return Gt(e,this,!0)}});function p(e,r){var n=e.arg()/3,i=e.abs(),s=new o(Ir(i),0).mul(new o(0,n).exp());if(r){var u=[s,new o(Ir(i),0).mul(new o(0,n+2*Math.PI/3).exp()),new o(Ir(i),0).mul(new o(0,n-2*Math.PI/3).exp())];return"Array"===t.matrix?u:a(u)}return s}})),en=r(56),tn=r.n(en),rn=Qe("algorithm11",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return function(e,n,i,a){var o=e._values,s=e._index,u=e._ptr,c=e._size,f=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var l,p=c[0],m=c[1],h=r,d=0,v=i;"string"==typeof f&&(l=f,h=t.find(r,[l,l]),d=t.convert(0,l),n=t.convert(n,l),v=t.find(i,[l,l]));for(var y=[],g=[],x=[],b=0;b<m;b++){x[b]=g.length;for(var w=u[b],N=u[b+1],M=w;M<N;M++){var E=s[M],S=a?v(n,o[M]):v(o[M],n);h(S,d)||(g.push(E),y.push(S))}}return x[m]=g.length,e.createSparseMatrix({values:y,index:g,ptr:x,size:[p,m],datatype:l})}})),nn=Qe("algorithm14",["typed"],(function(e){var t=e.typed;return function(e,r,n,i){var a,o=e._data,s=e._size,u=e._datatype,c=n;"string"==typeof u&&(a=u,r=t.convert(r,a),c=t.find(n,[a,a]));var f=s.length>0?function e(t,r,n,i,a,o,s){var u=[];if(r===n.length-1)for(var c=0;c<i;c++)u[c]=s?t(o,a[c]):t(a[c],o);else for(var f=0;f<i;f++)u[f]=e(t,r+1,n,n[r+1],a[f],o,s);return u}(c,0,s,s[0],o,r,i):[];return e.createDenseMatrix({data:f,size:He(s),datatype:a})}})),an=Qe("ceil",["typed","config","round","matrix","equalScalar"],(function(e){var t=e.typed,r=e.config,n=e.round,i=e.matrix,a=e.equalScalar,o=rn({typed:t,equalScalar:a}),s=nn({typed:t});return t("ceil",{number:function(e){return ue(e,n(e),r.epsilon)?n(e):kr(e)},"number, number":function(e,t){if(ue(e,n(e,t),r.epsilon))return n(e,t);var i="".concat(e,"e").split("e"),a=tn()(i,2),o=a[0],s=a[1],u=Math.ceil(Number("".concat(o,"e").concat(Number(s)+t))),c="".concat(u,"e").split("e"),f=tn()(c,2);return o=f[0],s=f[1],Number("".concat(o,"e").concat(Number(s)-t))},Complex:function(e){return e.ceil()},"Complex, number":function(e,t){return e.ceil(t)},BigNumber:function(e){return sr(e,n(e),r.epsilon)?n(e):e.ceil()},"BigNumber, BigNumber":function(e,t){return sr(e,n(e,t),r.epsilon)?n(e,t):e.toDecimalPlaces(t.toNumber(),At.a.ROUND_CEIL)},Fraction:function(e){return e.ceil()},"Fraction, number":function(e,t){return e.ceil(t)},"Array | Matrix":function(e){return Gt(e,this,!0)},"Array | Matrix, number":function(e,t){var r=this;return Gt(e,(function(e){return r(e,t)}),!0)},"SparseMatrix, number | BigNumber":function(e,t){return o(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return s(e,t,this,!1)},"number | Complex | BigNumber, Array":function(e,t){return s(i(t),e,this,!0).valueOf()}})})),on=Qe("cube",["typed"],(function(e){return(0,e.typed)("cube",{number:zr,Complex:function(e){return e.mul(e).mul(e)},BigNumber:function(e){return e.times(e).times(e)},Fraction:function(e){return e.pow(3)},"Array | Matrix":function(e){return Gt(e,this,!0)},Unit:function(e){return e.pow(3)}})})),sn=Qe("exp",["typed"],(function(e){return(0,e.typed)("exp",{number:qr,Complex:function(e){return e.exp()},BigNumber:function(e){return e.exp()},"Array | Matrix":function(e){return Gt(e,this)}})})),un=Qe("expm1",["typed","Complex"],(function(e){var t=e.typed,r=e.Complex;return t("expm1",{number:Rr,Complex:function(e){var t=Math.exp(e.re);return new r(t*Math.cos(e.im)-1,t*Math.sin(e.im))},BigNumber:function(e){return e.exp().minus(1)},"Array | Matrix":function(e){return Gt(e,this)}})})),cn=Qe("fix",["typed","Complex","matrix","ceil","floor"],(function(e){var t=e.typed,r=e.Complex,n=e.matrix,i=e.ceil,a=e.floor,o=nn({typed:t});return t("fix",{number:function(e){return e>0?a(e):i(e)},"number, number | BigNumber":function(e,t){return e>0?a(e,t):i(e,t)},Complex:function(e){return new r(e.re>0?Math.floor(e.re):Math.ceil(e.re),e.im>0?Math.floor(e.im):Math.ceil(e.im))},"Complex, number | BigNumber":function(e,t){return new r(e.re>0?a(e.re,t):i(e.re,t),e.im>0?a(e.im,t):i(e.im,t))},BigNumber:function(e){return e.isNegative()?i(e):a(e)},"BigNumber, number | BigNumber":function(e,t){return e.isNegative()?i(e,t):a(e,t)},Fraction:function(e){return e.s<0?e.ceil():e.floor()},"Fraction, number | BigNumber":function(e,t){return e.s<0?e.ceil(t):e.floor(t)},"Array | Matrix":function(e){return Gt(e,this,!0)},"Array | Matrix, number | BigNumber":function(e,t){var r=this;return Gt(e,(function(e){return r(e,t)}),!0)},"number | Complex | BigNumber, Array":function(e,t){return o(n(t),e,this,!0).valueOf()}})})),fn=Qe("floor",["typed","config","round","matrix","equalScalar"],(function(e){var t=e.typed,r=e.config,n=e.round,i=e.matrix,a=e.equalScalar,o=rn({typed:t,equalScalar:a}),s=nn({typed:t});return t("floor",{number:function(e){return ue(e,n(e),r.epsilon)?n(e):Math.floor(e)},"number, number":function(e,t){if(ue(e,n(e,t),r.epsilon))return n(e,t);var i="".concat(e,"e").split("e"),a=tn()(i,2),o=a[0],s=a[1],u=Math.floor(Number("".concat(o,"e").concat(Number(s)+t))),c="".concat(u,"e").split("e"),f=tn()(c,2);return o=f[0],s=f[1],Number("".concat(o,"e").concat(Number(s)-t))},Complex:function(e){return e.floor()},"Complex, number":function(e,t){return e.floor(t)},BigNumber:function(e){return sr(e,n(e),r.epsilon)?n(e):e.floor()},"BigNumber, BigNumber":function(e,t){return sr(e,n(e,t),r.epsilon)?n(e,t):e.toDecimalPlaces(t.toNumber(),At.a.ROUND_FLOOR)},Fraction:function(e){return e.floor()},"Fraction, number":function(e,t){return e.floor(t)},"Array | Matrix":function(e){return Gt(e,this,!0)},"Array | Matrix, number":function(e,t){var r=this;return Gt(e,(function(e){return r(e,t)}),!0)},"SparseMatrix, number | BigNumber":function(e,t){return o(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return s(e,t,this,!1)},"number | Complex | BigNumber, Array":function(e,t){return s(i(t),e,this,!0).valueOf()}})})),ln=Qe("algorithm01",["typed"],(function(e){var t=e.typed;return function(e,r,n,i){var a=e._data,o=e._size,s=e._datatype,u=r._values,c=r._index,f=r._ptr,l=r._size,p=r._datatype;if(o.length!==l.length)throw new Me(o.length,l.length);if(o[0]!==l[0]||o[1]!==l[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+l+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var m,h,d=o[0],v=o[1],y="string"==typeof s&&s===p?s:void 0,g=y?t.find(n,[y,y]):n,x=[];for(m=0;m<d;m++)x[m]=[];var b=[],w=[];for(h=0;h<v;h++){for(var N=h+1,M=f[h],E=f[h+1],S=M;S<E;S++)b[m=c[S]]=i?g(u[S],a[m][h]):g(a[m][h],u[S]),w[m]=N;for(m=0;m<d;m++)w[m]===N?x[m][h]=b[m]:x[m][h]=a[m][h]}return e.createDenseMatrix({data:x,size:[d,v],datatype:y})}})),pn=Qe("algorithm04",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,f=n._values,l=n._index,p=n._ptr,m=n._size,h=n._datatype;if(u.length!==m.length)throw new Me(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");var d,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(d=c,g=t.find(r,[d,d]),x=t.convert(0,d),b=t.find(i,[d,d]));var w,N,M,E,S,A=a&&f?[]:void 0,O=[],C=[],_=a&&f?[]:void 0,T=a&&f?[]:void 0,I=[],k=[];for(N=0;N<y;N++){C[N]=O.length;var z=N+1;for(E=s[N],S=s[N+1],M=E;M<S;M++)w=o[M],O.push(w),I[w]=z,_&&(_[w]=a[M]);for(E=p[N],S=p[N+1],M=E;M<S;M++)if(I[w=l[M]]===z){if(_){var q=b(_[w],f[M]);g(q,x)?I[w]=null:_[w]=q}}else O.push(w),k[w]=z,T&&(T[w]=f[M]);if(_&&T)for(M=C[N];M<O.length;)I[w=O[M]]===z?(A[M]=_[w],M++):k[w]===z?(A[M]=T[w],M++):O.splice(M,1)}return C[y]=O.length,e.createSparseMatrix({values:A,index:O,ptr:C,size:[v,y],datatype:d})}})),mn=Qe("algorithm10",["typed","DenseMatrix"],(function(e){var t=e.typed,r=e.DenseMatrix;return function(e,n,i,a){var o=e._values,s=e._index,u=e._ptr,c=e._size,f=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var l,p=c[0],m=c[1],h=i;"string"==typeof f&&(l=f,n=t.convert(n,l),h=t.find(i,[l,l]));for(var d=[],v=[],y=[],g=0;g<m;g++){for(var x=g+1,b=u[g],w=u[g+1],N=b;N<w;N++){var M=s[N];v[M]=o[N],y[M]=x}for(var E=0;E<p;E++)0===g&&(d[E]=[]),y[E]===x?d[E][g]=a?h(n,v[E]):h(v[E],n):d[E][g]=n}return new r({data:d,size:[p,m],datatype:l})}})),hn=Qe("algorithm13",["typed"],(function(e){var t=e.typed;return function(e,r,n){var i,a=e._data,o=e._size,s=e._datatype,u=r._data,c=r._size,f=r._datatype,l=[];if(o.length!==c.length)throw new Me(o.length,c.length);for(var p=0;p<o.length;p++){if(o[p]!==c[p])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+c+")");l[p]=o[p]}var m=n;"string"==typeof s&&s===f&&(i=s,m=t.find(n,[i,i]));var h=l.length>0?function e(t,r,n,i,a,o){var s=[];if(r===n.length-1)for(var u=0;u<i;u++)s[u]=t(a[u],o[u]);else for(var c=0;c<i;c++)s[c]=e(t,r+1,n,n[r+1],a[c],o[c]);return s}(m,0,l,l[0],a,u):[];return e.createDenseMatrix({data:h,size:l,datatype:i})}})),dn=Qe("gcd",["typed","matrix","equalScalar","BigNumber","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.BigNumber,a=e.DenseMatrix,o=ln({typed:t}),s=pn({typed:t,equalScalar:n}),u=mn({typed:t,DenseMatrix:a}),c=hn({typed:t}),f=nn({typed:t});return t("gcd",{"number, number":Br,"BigNumber, BigNumber":function(e,t){if(!e.isInt()||!t.isInt())throw new Error("Parameters in function gcd must be integer numbers");var r=new i(0);for(;!t.isZero();){var n=e.mod(t);e=t,t=n}return e.lt(r)?e.neg():e},"Fraction, Fraction":function(e,t){return e.gcd(t)},"SparseMatrix, SparseMatrix":function(e,t){return s(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return c(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, number | BigNumber":function(e,t){return u(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return f(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return u(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return f(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return f(r(e),t,this,!1).valueOf()},"number | BigNumber, Array":function(e,t){return f(r(t),e,this,!0).valueOf()},"Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber":function(e,t,r){for(var n=this(e,t),i=0;i<r.length;i++)n=this(n,r[i]);return n}})})),vn=Qe("algorithm02",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return function(e,n,i,a){var o=e._data,s=e._size,u=e._datatype,c=n._values,f=n._index,l=n._ptr,p=n._size,m=n._datatype;if(s.length!==p.length)throw new Me(s.length,p.length);if(s[0]!==p[0]||s[1]!==p[1])throw new RangeError("Dimension mismatch. Matrix A ("+s+") must match Matrix B ("+p+")");if(!c)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var h,d=s[0],v=s[1],y=r,g=0,x=i;"string"==typeof u&&u===m&&(h=u,y=t.find(r,[h,h]),g=t.convert(0,h),x=t.find(i,[h,h]));for(var b=[],w=[],N=[],M=0;M<v;M++){N[M]=w.length;for(var E=l[M],S=l[M+1],A=E;A<S;A++){var O=f[A],C=a?x(c[A],o[O][M]):x(o[O][M],c[A]);y(C,g)||(w.push(O),b.push(C))}}return N[v]=w.length,n.createSparseMatrix({values:b,index:w,ptr:N,size:[d,v],datatype:h})}})),yn=Qe("algorithm06",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return function(e,n,i){var a=e._values,o=e._size,s=e._datatype,u=n._values,c=n._size,f=n._datatype;if(o.length!==c.length)throw new Me(o.length,c.length);if(o[0]!==c[0]||o[1]!==c[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+c+")");var l,p=o[0],m=o[1],h=r,d=0,v=i;"string"==typeof s&&s===f&&(l=s,h=t.find(r,[l,l]),d=t.convert(0,l),v=t.find(i,[l,l]));for(var y=a&&u?[]:void 0,g=[],x=[],b=y?[]:void 0,w=[],N=[],M=0;M<m;M++){x[M]=g.length;var E=M+1;if(Wt(e,M,w,b,N,E,g,v),Wt(n,M,w,b,N,E,g,v),b)for(var S=x[M];S<g.length;){var A=g[S];if(N[A]===E){var O=b[A];h(O,d)?g.splice(S,1):(y.push(O),S++)}else g.splice(S,1)}else for(var C=x[M];C<g.length;){N[g[C]]!==E?g.splice(C,1):C++}}return x[m]=g.length,e.createSparseMatrix({values:y,index:g,ptr:x,size:[p,m],datatype:l})}})),gn=Qe("lcm",["typed","matrix","equalScalar"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=vn({typed:t,equalScalar:n}),a=yn({typed:t,equalScalar:n}),o=rn({typed:t,equalScalar:n}),s=hn({typed:t}),u=nn({typed:t});return t("lcm",{"number, number":Dr,"BigNumber, BigNumber":function(e,t){if(!e.isInt()||!t.isInt())throw new Error("Parameters in function lcm must be integer numbers");if(e.isZero())return e;if(t.isZero())return t;var r=e.times(t);for(;!t.isZero();){var n=t;t=e.mod(n),e=n}return r.div(e).abs()},"Fraction, Fraction":function(e,t){return e.lcm(t)},"SparseMatrix, SparseMatrix":function(e,t){return a(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return i(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return i(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return s(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, number | BigNumber":function(e,t){return o(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return u(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return o(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return u(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return u(r(e),t,this,!1).valueOf()},"number | BigNumber, Array":function(e,t){return u(r(t),e,this,!0).valueOf()},"Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber":function(e,t,r){for(var n=this(e,t),i=0;i<r.length;i++)n=this(n,r[i]);return n}})})),xn=Qe("log10",["typed","config","Complex"],(function(e){var t=e.typed,r=e.config,n=e.Complex;return t("log10",{number:function(e){return e>=0||r.predictable?jr(e):new n(e,0).log().div(Math.LN10)},Complex:function(e){return new n(e).log().div(Math.LN10)},BigNumber:function(e){return!e.isNegative()||r.predictable?e.log():new n(e.toNumber(),0).log().div(Math.LN10)},"Array | Matrix":function(e){return Gt(e,this)}})})),bn=Qe("log2",["typed","config","Complex"],(function(e){var t=e.typed,r=e.config,n=e.Complex;return t("log2",{number:function(e){return e>=0||r.predictable?Pr(e):i(new n(e,0))},Complex:i,BigNumber:function(e){return!e.isNegative()||r.predictable?e.log(2):i(new n(e.toNumber(),0))},"Array | Matrix":function(e){return Gt(e,this)}});function i(e){var t=Math.sqrt(e.re*e.re+e.im*e.im);return new n(Math.log2?Math.log2(t):Math.log(t)/Math.LN2,Math.atan2(e.im,e.re)/Math.LN2)}})),wn=Qe("algorithm03",["typed"],(function(e){var t=e.typed;return function(e,r,n,i){var a=e._data,o=e._size,s=e._datatype,u=r._values,c=r._index,f=r._ptr,l=r._size,p=r._datatype;if(o.length!==l.length)throw new Me(o.length,l.length);if(o[0]!==l[0]||o[1]!==l[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+l+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var m,h=o[0],d=o[1],v=0,y=n;"string"==typeof s&&s===p&&(m=s,v=t.convert(0,m),y=t.find(n,[m,m]));for(var g=[],x=0;x<h;x++)g[x]=[];for(var b=[],w=[],N=0;N<d;N++){for(var M=N+1,E=f[N],S=f[N+1],A=E;A<S;A++){var O=c[A];b[O]=i?y(u[A],a[O][N]):y(a[O][N],u[A]),w[O]=M}for(var C=0;C<h;C++)w[C]===M?g[C][N]=b[C]:g[C][N]=i?y(v,a[C][N]):y(a[C][N],v)}return e.createDenseMatrix({data:g,size:[h,d],datatype:m})}})),Nn=Qe("algorithm05",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,f=n._values,l=n._index,p=n._ptr,m=n._size,h=n._datatype;if(u.length!==m.length)throw new Me(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");var d,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(d=c,g=t.find(r,[d,d]),x=t.convert(0,d),b=t.find(i,[d,d]));var w,N,M,E,S=a&&f?[]:void 0,A=[],O=[],C=S?[]:void 0,_=S?[]:void 0,T=[],I=[];for(N=0;N<y;N++){O[N]=A.length;var k=N+1;for(M=s[N],E=s[N+1];M<E;M++)w=o[M],A.push(w),T[w]=k,C&&(C[w]=a[M]);for(M=p[N],E=p[N+1];M<E;M++)T[w=l[M]]!==k&&A.push(w),I[w]=k,_&&(_[w]=f[M]);if(S)for(M=O[N];M<A.length;){var z=T[w=A[M]],q=I[w];if(z===k||q===k){var R=b(z===k?C[w]:x,q===k?_[w]:x);g(R,x)?A.splice(M,1):(S.push(R),M++)}}}return O[y]=A.length,e.createSparseMatrix({values:S,index:A,ptr:O,size:[v,y],datatype:d})}})),Mn=Qe("algorithm12",["typed","DenseMatrix"],(function(e){var t=e.typed,r=e.DenseMatrix;return function(e,n,i,a){var o=e._values,s=e._index,u=e._ptr,c=e._size,f=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var l,p=c[0],m=c[1],h=i;"string"==typeof f&&(l=f,n=t.convert(n,l),h=t.find(i,[l,l]));for(var d=[],v=[],y=[],g=0;g<m;g++){for(var x=g+1,b=u[g],w=u[g+1],N=b;N<w;N++){var M=s[N];v[M]=o[N],y[M]=x}for(var E=0;E<p;E++)0===g&&(d[E]=[]),y[E]===x?d[E][g]=a?h(n,v[E]):h(v[E],n):d[E][g]=a?h(n,0):h(0,n)}return new r({data:d,size:[p,m],datatype:l})}})),En=Qe("mod",["typed","matrix","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.DenseMatrix,a=vn({typed:t,equalScalar:n}),o=wn({typed:t}),s=Nn({typed:t,equalScalar:n}),u=rn({typed:t,equalScalar:n}),c=Mn({typed:t,DenseMatrix:i}),f=hn({typed:t}),l=nn({typed:t});return t("mod",{"number, number":Fr,"BigNumber, BigNumber":function(e,t){if(t.isNeg())throw new Error("Cannot calculate mod for a negative divisor");return t.isZero()?e:e.mod(t)},"Fraction, Fraction":function(e,t){if(t.compare(0)<0)throw new Error("Cannot calculate mod for a negative divisor");return e.compare(0)>=0?e.mod(t):e.mod(t).add(t).mod(t)},"SparseMatrix, SparseMatrix":function(e,t){return s(e,t,this,!1)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return f(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return u(e,t,this,!1)},"DenseMatrix, any":function(e,t){return l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return c(t,e,this,!0)},"any, DenseMatrix":function(e,t){return l(t,e,this,!0)},"Array, any":function(e,t){return l(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return l(r(t),e,this,!0).valueOf()}})})),Sn=Qe("multiplyScalar",["typed"],(function(e){return(0,e.typed)("multiplyScalar",{"number, number":Cr,"Complex, Complex":function(e,t){return e.mul(t)},"BigNumber, BigNumber":function(e,t){return e.times(t)},"Fraction, Fraction":function(e,t){return e.mul(t)},"number | Fraction | BigNumber | Complex, Unit":function(e,t){var r=t.clone();return r.value=null===r.value?r._normalize(e):this(r.value,e),r},"Unit, number | Fraction | BigNumber | Complex":function(e,t){var r=e.clone();return r.value=null===r.value?r._normalize(t):this(r.value,t),r},"Unit, Unit":function(e,t){return e.multiply(t)}})})),An=Qe("multiply",["typed","matrix","addScalar","multiplyScalar","equalScalar","dot"],(function(e){var t=e.typed,r=e.matrix,n=e.addScalar,i=e.multiplyScalar,a=e.equalScalar,o=e.dot,s=rn({typed:t,equalScalar:a}),u=nn({typed:t});function c(e,t){switch(e.length){case 1:switch(t.length){case 1:if(e[0]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Vectors must have the same length");break;case 2:if(e[0]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Vector length ("+e[0]+") must match Matrix rows ("+t[0]+")");break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix B has "+t.length+" dimensions)")}break;case 2:switch(t.length){case 1:if(e[1]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Matrix columns ("+e[1]+") must match Vector length ("+t[0]+")");break;case 2:if(e[1]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Matrix A columns ("+e[1]+") must match Matrix B rows ("+t[0]+")");break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix B has "+t.length+" dimensions)")}break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix A has "+e.length+" dimensions)")}}function f(e,r){if("dense"!==r.storage())throw new Error("Support for SparseMatrix not implemented");return function(e,r){var a,o=e._data,s=e._size,u=e._datatype,c=r._data,f=r._size,l=r._datatype,p=s[0],m=f[1],h=n,d=i;u&&l&&u===l&&"string"==typeof u&&(a=u,h=t.find(n,[a,a]),d=t.find(i,[a,a]));for(var v=[],y=0;y<m;y++){for(var g=d(o[0],c[0][y]),x=1;x<p;x++)g=h(g,d(o[x],c[x][y]));v[y]=g}return e.createDenseMatrix({data:v,size:[m],datatype:a})}(e,r)}var l=t("_multiplyMatrixVector",{"DenseMatrix, any":function(e,r){var a,o=e._data,s=e._size,u=e._datatype,c=r._data,f=r._datatype,l=s[0],p=s[1],m=n,h=i;u&&f&&u===f&&"string"==typeof u&&(a=u,m=t.find(n,[a,a]),h=t.find(i,[a,a]));for(var d=[],v=0;v<l;v++){for(var y=o[v],g=h(y[0],c[0]),x=1;x<p;x++)g=m(g,h(y[x],c[x]));d[v]=g}return e.createDenseMatrix({data:d,size:[l],datatype:a})},"SparseMatrix, any":function(e,r){var o=e._values,s=e._index,u=e._ptr,c=e._datatype;if(!o)throw new Error("Cannot multiply Pattern only Matrix times Dense Matrix");var f,l=r._data,p=r._datatype,m=e._size[0],h=r._size[0],d=[],v=[],y=[],g=n,x=i,b=a,w=0;c&&p&&c===p&&"string"==typeof c&&(f=c,g=t.find(n,[f,f]),x=t.find(i,[f,f]),b=t.find(a,[f,f]),w=t.convert(0,f));var N=[],M=[];y[0]=0;for(var E=0;E<h;E++){var S=l[E];if(!b(S,w))for(var A=u[E],O=u[E+1],C=A;C<O;C++){var _=s[C];M[_]?N[_]=g(N[_],x(S,o[C])):(M[_]=!0,v.push(_),N[_]=x(S,o[C]))}}for(var T=v.length,I=0;I<T;I++){var k=v[I];d[I]=N[k]}return y[1]=v.length,e.createSparseMatrix({values:d,index:v,ptr:y,size:[m,1],datatype:f})}}),p=t("_multiplyMatrixMatrix",{"DenseMatrix, DenseMatrix":function(e,r){var a,o=e._data,s=e._size,u=e._datatype,c=r._data,f=r._size,l=r._datatype,p=s[0],m=s[1],h=f[1],d=n,v=i;u&&l&&u===l&&"string"==typeof u&&(a=u,d=t.find(n,[a,a]),v=t.find(i,[a,a]));for(var y=[],g=0;g<p;g++){var x=o[g];y[g]=[];for(var b=0;b<h;b++){for(var w=v(x[0],c[0][b]),N=1;N<m;N++)w=d(w,v(x[N],c[N][b]));y[g][b]=w}}return e.createDenseMatrix({data:y,size:[p,h],datatype:a})},"DenseMatrix, SparseMatrix":function(e,r){var o=e._data,s=e._size,u=e._datatype,c=r._values,f=r._index,l=r._ptr,p=r._size,m=r._datatype;if(!c)throw new Error("Cannot multiply Dense Matrix times Pattern only Matrix");var h,d=s[0],v=p[1],y=n,g=i,x=a,b=0;u&&m&&u===m&&"string"==typeof u&&(h=u,y=t.find(n,[h,h]),g=t.find(i,[h,h]),x=t.find(a,[h,h]),b=t.convert(0,h));for(var w=[],N=[],M=[],E=r.createSparseMatrix({values:w,index:N,ptr:M,size:[d,v],datatype:h}),S=0;S<v;S++){M[S]=N.length;var A=l[S],O=l[S+1];if(O>A)for(var C=0,_=0;_<d;_++){for(var T=_+1,I=void 0,k=A;k<O;k++){var z=f[k];C!==T?(I=g(o[_][z],c[k]),C=T):I=y(I,g(o[_][z],c[k]))}C!==T||x(I,b)||(N.push(_),w.push(I))}}return M[v]=N.length,E},"SparseMatrix, DenseMatrix":function(e,r){var o=e._values,s=e._index,u=e._ptr,c=e._datatype;if(!o)throw new Error("Cannot multiply Pattern only Matrix times Dense Matrix");var f,l=r._data,p=r._datatype,m=e._size[0],h=r._size[0],d=r._size[1],v=n,y=i,g=a,x=0;c&&p&&c===p&&"string"==typeof c&&(f=c,v=t.find(n,[f,f]),y=t.find(i,[f,f]),g=t.find(a,[f,f]),x=t.convert(0,f));for(var b=[],w=[],N=[],M=e.createSparseMatrix({values:b,index:w,ptr:N,size:[m,d],datatype:f}),E=[],S=[],A=0;A<d;A++){N[A]=w.length;for(var O=A+1,C=0;C<h;C++){var _=l[C][A];if(!g(_,x))for(var T=u[C],I=u[C+1],k=T;k<I;k++){var z=s[k];S[z]!==O?(S[z]=O,w.push(z),E[z]=y(_,o[k])):E[z]=v(E[z],y(_,o[k]))}}for(var q=N[A],R=w.length,B=q;B<R;B++){var D=w[B];b[B]=E[D]}}return N[d]=w.length,M},"SparseMatrix, SparseMatrix":function(e,r){var a,o=e._values,s=e._index,u=e._ptr,c=e._datatype,f=r._values,l=r._index,p=r._ptr,m=r._datatype,h=e._size[0],d=r._size[1],v=o&&f,y=n,g=i;c&&m&&c===m&&"string"==typeof c&&(a=c,y=t.find(n,[a,a]),g=t.find(i,[a,a]));for(var x,b,w,N,M,E,S,A,O=v?[]:void 0,C=[],_=[],T=e.createSparseMatrix({values:O,index:C,ptr:_,size:[h,d],datatype:a}),I=v?[]:void 0,k=[],z=0;z<d;z++){_[z]=C.length;var q=z+1;for(M=p[z],E=p[z+1],N=M;N<E;N++)if(A=l[N],v)for(b=u[A],w=u[A+1],x=b;x<w;x++)S=s[x],k[S]!==q?(k[S]=q,C.push(S),I[S]=g(f[N],o[x])):I[S]=y(I[S],g(f[N],o[x]));else for(b=u[A],w=u[A+1],x=b;x<w;x++)S=s[x],k[S]!==q&&(k[S]=q,C.push(S));if(v)for(var R=_[z],B=C.length,D=R;D<B;D++){var j=C[D];O[D]=I[j]}}return _[d]=C.length,T}});return t("multiply",Ve({"Array, Array":function(e,t){c(Se(e),Se(t));var n=this(r(e),r(t));return m(n)?n.valueOf():n},"Matrix, Matrix":function(e,t){var r=e.size(),n=t.size();return c(r,n),1===r.length?1===n.length?function(e,t,r){if(0===r)throw new Error("Cannot multiply two empty vectors");return o(e,t)}(e,t,r[0]):f(e,t):1===n.length?l(e,t):p(e,t)},"Matrix, Array":function(e,t){return this(e,r(t))},"Array, Matrix":function(e,t){return this(r(e,t.storage()),t)},"SparseMatrix, any":function(e,t){return s(e,t,i,!1)},"DenseMatrix, any":function(e,t){return u(e,t,i,!1)},"any, SparseMatrix":function(e,t){return s(t,e,i,!0)},"any, DenseMatrix":function(e,t){return u(t,e,i,!0)},"Array, any":function(e,t){return u(r(e),t,i,!1).valueOf()},"any, Array":function(e,t){return u(r(t),e,i,!0).valueOf()},"any, any":i,"any, any, ...any":function(e,t,r){for(var n=this(e,t),i=0;i<r.length;i++)n=this(n,r[i]);return n}},i.signatures))})),On=Qe("nthRoot",["typed","matrix","equalScalar","BigNumber"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.BigNumber,a=ln({typed:t}),o=vn({typed:t,equalScalar:n}),s=yn({typed:t,equalScalar:n}),u=rn({typed:t,equalScalar:n}),c=hn({typed:t}),f=nn({typed:t}),l="Complex number not supported in function nthRoot. Use nthRoots instead.";return t("nthRoot",{number:function(e){return Ur(e,2)},"number, number":Ur,BigNumber:function(e){return p(e,new i(2))},Complex:function(e){throw new Error(l)},"Complex, number":function(e,t){throw new Error(l)},"BigNumber, BigNumber":p,"Array | Matrix":function(e){return this(e,2)},"SparseMatrix, SparseMatrix":function(e,t){if(1===t.density())return s(e,t,this);throw new Error("Root must be non-zero")},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){if(1===t.density())return a(e,t,this,!1);throw new Error("Root must be non-zero")},"DenseMatrix, DenseMatrix":function(e,t){return c(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, number | BigNumber":function(e,t){return u(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return f(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){if(1===t.density())return u(t,e,this,!0);throw new Error("Root must be non-zero")},"number | BigNumber, DenseMatrix":function(e,t){return f(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(r(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,r(t)).valueOf()}});function p(e,t){var r=i.precision,n=i.clone({precision:r+2}),a=new i(0),o=new n(1),s=t.isNegative();if(s&&(t=t.neg()),t.isZero())throw new Error("Root must be non-zero");if(e.isNegative()&&!t.abs().mod(2).equals(1))throw new Error("Root must be odd when a is negative.");if(e.isZero())return s?new n(1/0):0;if(!e.isFinite())return s?a:e;var u=e.abs().pow(o.div(t));return u=e.isNeg()?u.neg():u,new i((s?o.div(u):u).toPrecision(r))}})),Cn=Qe("sign",["typed","BigNumber","Fraction","complex"],(function(e){var t=e.typed,r=e.BigNumber,n=e.complex,i=e.Fraction;return t("sign",{number:Lr,Complex:function(e){return 0===e.im?n(Lr(e.re)):e.sign()},BigNumber:function(e){return new r(e.cmp(0))},Fraction:function(e){return new i(e.s,1)},"Array | Matrix":function(e){return Gt(e,this,!0)},Unit:function(e){if(!e._isDerived()&&0!==e.units[0].unit.offset)throw new TypeError("sign is ambiguous for units with offset");return this(e.value)}})})),_n=Qe("sqrt",["config","typed","Complex"],(function(e){var t=e.config,r=e.typed,n=e.Complex;return r("sqrt",{number:i,Complex:function(e){return e.sqrt()},BigNumber:function(e){return!e.isNegative()||t.predictable?e.sqrt():i(e.toNumber())},"Array | Matrix":function(e){return Gt(e,this,!0)},Unit:function(e){return e.pow(.5)}});function i(e){return isNaN(e)?NaN:e>=0||t.predictable?Math.sqrt(e):new n(e,0).sqrt()}})),Tn=Qe("square",["typed"],(function(e){return(0,e.typed)("square",{number:$r,Complex:function(e){return e.mul(e)},BigNumber:function(e){return e.times(e)},Fraction:function(e){return e.mul(e)},"Array | Matrix":function(e){return Gt(e,this,!0)},Unit:function(e){return e.pow(2)}})})),In=Qe("subtract",["typed","matrix","equalScalar","addScalar","unaryMinus","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.addScalar,a=e.unaryMinus,o=e.DenseMatrix,s=ln({typed:t}),u=wn({typed:t}),c=Nn({typed:t,equalScalar:n}),f=mn({typed:t,DenseMatrix:o}),l=hn({typed:t}),p=nn({typed:t});return t("subtract",{"number, number":function(e,t){return e-t},"Complex, Complex":function(e,t){return e.sub(t)},"BigNumber, BigNumber":function(e,t){return e.minus(t)},"Fraction, Fraction":function(e,t){return e.sub(t)},"Unit, Unit":function(e,t){if(null===e.value)throw new Error("Parameter x contains a unit with undefined value");if(null===t.value)throw new Error("Parameter y contains a unit with undefined value");if(!e.equalBase(t))throw new Error("Units do not match");var r=e.clone();return r.value=this(r.value,t.value),r.fixPrefix=!1,r},"SparseMatrix, SparseMatrix":function(e,t){return kn(e,t),c(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return kn(e,t),u(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return kn(e,t),s(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return kn(e,t),l(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return f(e,a(t),i)},"DenseMatrix, any":function(e,t){return p(e,t,this)},"any, SparseMatrix":function(e,t){return f(t,e,this,!0)},"any, DenseMatrix":function(e,t){return p(t,e,this,!0)},"Array, any":function(e,t){return p(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return p(r(t),e,this,!0).valueOf()}})}));function kn(e,t){var r=e.size(),n=t.size();if(r.length!==n.length)throw new Me(r.length,n.length)}var zn=Qe("xgcd",["typed","config","matrix","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.BigNumber;return t("xgcd",{"number, number":function(e,t){var i=Hr(e,t);return"Array"===r.matrix?i:n(i)},"BigNumber, BigNumber":function(e,t){var a,o,s,u,c=new i(0),f=new i(1),l=c,p=f,m=f,h=c;if(!e.isInt()||!t.isInt())throw new Error("Parameters in function xgcd must be integer numbers");for(;!t.isZero();)o=e.div(t).floor(),s=e.mod(t),a=l,l=p.minus(o.times(l)),p=a,a=m,m=h.minus(o.times(m)),h=a,e=t,t=s;u=e.lt(c)?[e.neg(),p.neg(),h.neg()]:[e,e.isZero()?0:p,h];return"Array"===r.matrix?u:n(u)}})})),qn=Qe("invmod",["typed","config","BigNumber","xgcd","equal","smaller","mod","add","isInteger"],(function(e){var t=e.typed,r=(e.config,e.BigNumber),n=e.xgcd,i=e.equal,a=e.smaller,o=e.mod,s=e.add,u=e.isInteger;return t("invmod",{"number, number":c,"BigNumber, BigNumber":c});function c(e,t){if(!u(e)||!u(t))throw new Error("Parameters in function invmod must be integer numbers");if(e=o(e,t),i(t,0))throw new Error("Divisor must be non zero");var c=n(e,t),f=c=c.valueOf(),l=tn()(f,2),p=l[0],m=l[1];return i(p,r(1))?(m=o(m,t),a(m,r(0))&&(m=s(m,t)),m):NaN}})),Rn=Qe("algorithm09",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,f=n._values,l=n._index,p=n._ptr,m=n._size,h=n._datatype;if(u.length!==m.length)throw new Me(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");var d,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(d=c,g=t.find(r,[d,d]),x=t.convert(0,d),b=t.find(i,[d,d]));var w,N,M,E,S,A=a&&f?[]:void 0,O=[],C=[],_=A?[]:void 0,T=[];for(N=0;N<y;N++){C[N]=O.length;var I=N+1;if(_)for(E=p[N],S=p[N+1],M=E;M<S;M++)T[w=l[M]]=I,_[w]=f[M];for(E=s[N],S=s[N+1],M=E;M<S;M++)if(w=o[M],_){var k=T[w]===I?_[w]:x,z=b(a[M],k);g(z,x)||(O.push(w),A.push(z))}else O.push(w)}return C[y]=O.length,e.createSparseMatrix({values:A,index:O,ptr:C,size:[v,y],datatype:d})}})),Bn=Qe("dotMultiply",["typed","matrix","equalScalar","multiplyScalar"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.multiplyScalar,a=vn({typed:t,equalScalar:n}),o=Rn({typed:t,equalScalar:n}),s=rn({typed:t,equalScalar:n}),u=hn({typed:t}),c=nn({typed:t});return t("dotMultiply",{"any, any":i,"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,i,!1)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,i,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,i,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,i)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return s(e,t,i,!1)},"DenseMatrix, any":function(e,t){return c(e,t,i,!1)},"any, SparseMatrix":function(e,t){return s(t,e,i,!0)},"any, DenseMatrix":function(e,t){return c(t,e,i,!0)},"Array, any":function(e,t){return c(r(e),t,i,!1).valueOf()},"any, Array":function(e,t){return c(r(t),e,i,!0).valueOf()}})}));function Dn(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitAnd");var r=e.constructor;if(e.isNaN()||t.isNaN())return new r(NaN);if(e.isZero()||t.eq(-1)||e.eq(t))return e;if(t.isZero()||e.eq(-1))return t;if(!e.isFinite()||!t.isFinite()){if(!e.isFinite()&&!t.isFinite())return e.isNegative()===t.isNegative()?e:new r(0);if(!e.isFinite())return t.isNegative()?e:e.isNegative()?new r(0):t;if(!t.isFinite())return e.isNegative()?t:t.isNegative()?new r(0):e}return Fn(e,t,(function(e,t){return e&t}))}function jn(e){if(e.isFinite()&&!e.isInteger())throw new Error("Integer expected in function bitNot");var t=e.constructor,r=t.precision;t.config({precision:1e9});var n=e.plus(new t(1));return n.s=-n.s||null,t.config({precision:r}),n}function Pn(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitOr");var r=e.constructor;if(e.isNaN()||t.isNaN())return new r(NaN);var n=new r(-1);return e.isZero()||t.eq(n)||e.eq(t)?t:t.isZero()||e.eq(n)?e:e.isFinite()&&t.isFinite()?Fn(e,t,(function(e,t){return e|t})):!e.isFinite()&&!e.isNegative()&&t.isNegative()||e.isNegative()&&!t.isNegative()&&!t.isFinite()?n:e.isNegative()&&t.isNegative()?e.isFinite()?e:t:e.isFinite()?t:e}function Fn(e,t,r){var n,i,a,o,s,u=e.constructor,c=+(e.s<0),f=+(t.s<0);if(c){n=Un(jn(e));for(var l=0;l<n.length;++l)n[l]^=1}else n=Un(e);if(f){i=Un(jn(t));for(var p=0;p<i.length;++p)i[p]^=1}else i=Un(t);n.length<=i.length?(a=n,o=i,s=c):(a=i,o=n,s=f);var m=a.length,h=o.length,d=1^r(c,f),v=new u(1^d),y=new u(1),g=new u(2),x=u.precision;for(u.config({precision:1e9});m>0;)r(a[--m],o[--h])===d&&(v=v.plus(y)),y=y.times(g);for(;h>0;)r(s,o[--h])===d&&(v=v.plus(y)),y=y.times(g);return u.config({precision:x}),0===d&&(v.s=-v.s),v}function Un(e){for(var t=e.d,r=t[0]+"",n=1;n<t.length;++n){for(var i=t[n]+"",a=7-i.length;a--;)i="0"+i;r+=i}for(var o=r.length;"0"===r.charAt(o);)o--;var s=e.e,u=r.slice(0,o+1||1),c=u.length;if(s>0)if(++s>c)for(s-=c;s--;)u+="0";else s<c&&(u=u.slice(0,s)+"."+u.slice(s));for(var f=[0],l=0;l<u.length;){for(var p=f.length;p--;)f[p]*=10;f[0]+=parseInt(u.charAt(l++));for(var m=0;m<f.length;++m)f[m]>1&&(null!==f[m+1]&&void 0!==f[m+1]||(f[m+1]=0),f[m+1]+=f[m]>>1,f[m]&=1)}return f.reverse()}function Ln(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitXor");var r=e.constructor;if(e.isNaN()||t.isNaN())return new r(NaN);if(e.isZero())return t;if(t.isZero())return e;if(e.eq(t))return new r(0);var n=new r(-1);return e.eq(n)?jn(t):t.eq(n)?jn(e):e.isFinite()&&t.isFinite()?Fn(e,t,(function(e,t){return e^t})):e.isFinite()||t.isFinite()?new r(e.isNegative()===t.isNegative()?1/0:-1/0):n}function $n(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function leftShift");var r=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new r(NaN):e.isZero()||t.isZero()?e:e.isFinite()||t.isFinite()?t.lt(55)?e.times(Math.pow(2,t.toNumber())+""):e.times(new r(2).pow(t)):new r(NaN)}function Hn(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function rightArithShift");var r=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new r(NaN):e.isZero()||t.isZero()?e:t.isFinite()?t.lt(55)?e.div(Math.pow(2,t.toNumber())+"").floor():e.div(new r(2).pow(t)).floor():e.isNegative()?new r(-1):e.isFinite()?new r(0):new r(NaN)}var Gn="number, number";function Vn(e,t){if(!Z(e)||!Z(t))throw new Error("Integers expected in function bitAnd");return e&t}function Zn(e){if(!Z(e))throw new Error("Integer expected in function bitNot");return~e}function Wn(e,t){if(!Z(e)||!Z(t))throw new Error("Integers expected in function bitOr");return e|t}function Yn(e,t){if(!Z(e)||!Z(t))throw new Error("Integers expected in function bitXor");return e^t}function Jn(e,t){if(!Z(e)||!Z(t))throw new Error("Integers expected in function leftShift");return e<<t}function Xn(e,t){if(!Z(e)||!Z(t))throw new Error("Integers expected in function rightArithShift");return e>>t}function Qn(e,t){if(!Z(e)||!Z(t))throw new Error("Integers expected in function rightLogShift");return e>>>t}Vn.signature=Gn,Zn.signature="number",Wn.signature=Gn,Yn.signature=Gn,Jn.signature=Gn,Xn.signature=Gn,Qn.signature=Gn;var Kn=Qe("bitAnd",["typed","matrix","equalScalar"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=vn({typed:t,equalScalar:n}),a=yn({typed:t,equalScalar:n}),o=rn({typed:t,equalScalar:n}),s=hn({typed:t}),u=nn({typed:t});return t("bitAnd",{"number, number":Vn,"BigNumber, BigNumber":Dn,"SparseMatrix, SparseMatrix":function(e,t){return a(e,t,this,!1)},"SparseMatrix, DenseMatrix":function(e,t){return i(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return i(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return s(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return o(e,t,this,!1)},"DenseMatrix, any":function(e,t){return u(e,t,this,!1)},"any, SparseMatrix":function(e,t){return o(t,e,this,!0)},"any, DenseMatrix":function(e,t){return u(t,e,this,!0)},"Array, any":function(e,t){return u(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return u(r(t),e,this,!0).valueOf()}})})),ei=Qe("bitNot",["typed"],(function(e){return(0,e.typed)("bitNot",{number:Zn,BigNumber:jn,"Array | Matrix":function(e){return Gt(e,this)}})})),ti=Qe("bitOr",["typed","matrix","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.DenseMatrix,a=ln({typed:t}),o=pn({typed:t,equalScalar:n}),s=mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("bitOr",{"number, number":Wn,"BigNumber, BigNumber":Pn,"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return s(e,t,this,!1)},"DenseMatrix, any":function(e,t){return c(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(t,e,this,!0)},"any, DenseMatrix":function(e,t){return c(t,e,this,!0)},"Array, any":function(e,t){return c(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return c(r(t),e,this,!0).valueOf()}})})),ri=Qe("algorithm07",["typed","DenseMatrix"],(function(e){var t=e.typed,r=e.DenseMatrix;return function(e,i,a){var o=e._size,s=e._datatype,u=i._size,c=i._datatype;if(o.length!==u.length)throw new Me(o.length,u.length);if(o[0]!==u[0]||o[1]!==u[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+u+")");var f,l,p,m=o[0],h=o[1],d=0,v=a;"string"==typeof s&&s===c&&(f=s,d=t.convert(0,f),v=t.find(a,[f,f]));var y=[];for(l=0;l<m;l++)y[l]=[];var g=[],x=[],b=[],w=[];for(p=0;p<h;p++){var N=p+1;for(n(e,p,b,g,N),n(i,p,w,x,N),l=0;l<m;l++){var M=b[l]===N?g[l]:d,E=w[l]===N?x[l]:d;y[l][p]=v(M,E)}}return new r({data:y,size:[m,h],datatype:f})};function n(e,t,r,n,i){for(var a=e._values,o=e._index,s=e._ptr,u=s[t],c=s[t+1];u<c;u++){var f=o[u];r[f]=i,n[f]=a[u]}}})),ni=Qe("bitXor",["typed","matrix","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.DenseMatrix,i=wn({typed:t}),a=ri({typed:t,DenseMatrix:n}),o=Mn({typed:t,DenseMatrix:n}),s=hn({typed:t}),u=nn({typed:t});return t("bitXor",{"number, number":Yn,"BigNumber, BigNumber":Ln,"SparseMatrix, SparseMatrix":function(e,t){return a(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return i(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return i(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return s(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return o(e,t,this,!1)},"DenseMatrix, any":function(e,t){return u(e,t,this,!1)},"any, SparseMatrix":function(e,t){return o(t,e,this,!0)},"any, DenseMatrix":function(e,t){return u(t,e,this,!0)},"Array, any":function(e,t){return u(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return u(r(t),e,this,!0).valueOf()}})})),ii=Qe("arg",["typed"],(function(e){return(0,e.typed)("arg",{number:function(e){return Math.atan2(0,e)},BigNumber:function(e){return e.constructor.atan2(0,e)},Complex:function(e){return e.arg()},"Array | Matrix":function(e){return Gt(e,this)}})})),ai=Qe("conj",["typed"],(function(e){return(0,e.typed)("conj",{number:function(e){return e},BigNumber:function(e){return e},Complex:function(e){return e.conjugate()},"Array | Matrix":function(e){return Gt(e,this)}})})),oi=Qe("im",["typed"],(function(e){return(0,e.typed)("im",{number:function(e){return 0},BigNumber:function(e){return e.mul(0)},Fraction:function(e){return e.mul(0)},Complex:function(e){return e.im},"Array | Matrix":function(e){return Gt(e,this)}})})),si=Qe("re",["typed"],(function(e){return(0,e.typed)("re",{number:function(e){return e},BigNumber:function(e){return e},Fraction:function(e){return e},Complex:function(e){return e.re},"Array | Matrix":function(e){return Gt(e,this)}})}));function ui(e){return!e}function ci(e,t){return!(!e&&!t)}function fi(e,t){return!!e!=!!t}function li(e,t){return!(!e||!t)}ui.signature="number",ci.signature="number, number",fi.signature="number, number",li.signature="number, number";var pi=Qe("not",["typed"],(function(e){return(0,e.typed)("not",{number:ui,Complex:function(e){return 0===e.re&&0===e.im},BigNumber:function(e){return e.isZero()||e.isNaN()},Unit:function(e){return null===e.value||this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),mi=Qe("or",["typed","matrix","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.DenseMatrix,a=wn({typed:t}),o=Nn({typed:t,equalScalar:n}),s=Mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("or",{"number, number":ci,"Complex, Complex":function(e,t){return 0!==e.re||0!==e.im||0!==t.re||0!==t.im},"BigNumber, BigNumber":function(e,t){return!e.isZero()&&!e.isNaN()||!t.isZero()&&!t.isNaN()},"Unit, Unit":function(e,t){return this(e.value||0,t.value||0)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return s(e,t,this,!1)},"DenseMatrix, any":function(e,t){return c(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(t,e,this,!0)},"any, DenseMatrix":function(e,t){return c(t,e,this,!0)},"Array, any":function(e,t){return c(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return c(r(t),e,this,!0).valueOf()}})})),hi=Qe("xor",["typed","matrix","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.DenseMatrix,i=wn({typed:t}),a=ri({typed:t,DenseMatrix:n}),o=Mn({typed:t,DenseMatrix:n}),s=hn({typed:t}),u=nn({typed:t});return t("xor",{"number, number":fi,"Complex, Complex":function(e,t){return(0!==e.re||0!==e.im)!=(0!==t.re||0!==t.im)},"BigNumber, BigNumber":function(e,t){return(!e.isZero()&&!e.isNaN())!=(!t.isZero()&&!t.isNaN())},"Unit, Unit":function(e,t){return this(e.value||0,t.value||0)},"SparseMatrix, SparseMatrix":function(e,t){return a(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return i(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return i(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return s(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return o(e,t,this,!1)},"DenseMatrix, any":function(e,t){return u(e,t,this,!1)},"any, SparseMatrix":function(e,t){return o(t,e,this,!0)},"any, DenseMatrix":function(e,t){return u(t,e,this,!0)},"Array, any":function(e,t){return u(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return u(r(t),e,this,!0).valueOf()}})})),di=Qe("concat",["typed","matrix","isInteger"],(function(e){var t=e.typed,r=e.matrix,n=e.isInteger;return t("concat",{"...Array | Matrix | number | BigNumber":function(e){var t,i,a=e.length,u=-1,c=!1,f=[];for(t=0;t<a;t++){var l=e[t];if(m(l)&&(c=!0),o(l)||s(l)){if(t!==a-1)throw new Error("Dimension must be specified as last argument");if(i=u,u=l.valueOf(),!n(u))throw new TypeError("Integer number expected for dimension");if(u<0||t>0&&u>i)throw new Ee(u,i+1)}else{var p=He(l).valueOf(),h=Se(p);if(f[t]=p,i=u,u=h.length-1,t>0&&u!==i)throw new Me(i+1,u+1)}}if(0===f.length)throw new SyntaxError("At least one matrix expected");for(var d=f.shift();f.length;)d=vi(d,f.shift(),u,0);return c?r(d):d},"...string":function(e){return e.join("")}})}));function vi(e,t,r,n){if(n<r){if(e.length!==t.length)throw new Me(e.length,t.length);for(var i=[],a=0;a<e.length;a++)i[a]=vi(e[a],t[a],r,n+1);return i}return e.concat(t)}var yi=Qe("column",["typed","Index","matrix","range"],(function(e){var t=e.typed,r=e.Index,n=e.matrix,i=e.range;return t("column",{"Matrix, number":a,"Array, number":function(e,t){return a(n(He(e)),t).valueOf()}});function a(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");Oe(t,e.size()[1]);var n=i(0,e.size()[0]),a=new r(n,t);return e.subset(a)}})),gi=Qe("count",["typed","size","prod"],(function(e){var t=e.typed,r=e.size,n=e.prod;return t("count",{string:function(e){return e.length},"Matrix | Array":function(e){return n(r(e))}})})),xi=Qe("cross",["typed","matrix","subtract","multiply"],(function(e){var t=e.typed,r=e.matrix,n=e.subtract,i=e.multiply;return t("cross",{"Matrix, Matrix":function(e,t){return r(a(e.toArray(),t.toArray()))},"Matrix, Array":function(e,t){return r(a(e.toArray(),t))},"Array, Matrix":function(e,t){return r(a(e,t.toArray()))},"Array, Array":a});function a(e,t){var r=Math.max(Se(e).length,Se(t).length);e=ke(e),t=ke(t);var a=Se(e),o=Se(t);if(1!==a.length||1!==o.length||3!==a[0]||3!==o[0])throw new RangeError("Vectors with length 3 expected (Size A = ["+a.join(", ")+"], B = ["+o.join(", ")+"])");var s=[n(i(e[1],t[2]),i(e[2],t[1])),n(i(e[2],t[0]),i(e[0],t[2])),n(i(e[0],t[1]),i(e[1],t[0]))];return r>1?[s]:s}})),bi=Qe("diag",["typed","matrix","DenseMatrix","SparseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.DenseMatrix,i=e.SparseMatrix;return t("diag",{Array:function(e){return a(e,0,Se(e),null)},"Array, number":function(e,t){return a(e,t,Se(e),null)},"Array, BigNumber":function(e,t){return a(e,t.toNumber(),Se(e),null)},"Array, string":function(e,t){return a(e,0,Se(e),t)},"Array, number, string":function(e,t,r){return a(e,t,Se(e),r)},"Array, BigNumber, string":function(e,t,r){return a(e,t.toNumber(),Se(e),r)},Matrix:function(e){return a(e,0,e.size(),e.storage())},"Matrix, number":function(e,t){return a(e,t,e.size(),e.storage())},"Matrix, BigNumber":function(e,t){return a(e,t.toNumber(),e.size(),e.storage())},"Matrix, string":function(e,t){return a(e,0,e.size(),t)},"Matrix, number, string":function(e,t,r){return a(e,t,e.size(),r)},"Matrix, BigNumber, string":function(e,t,r){return a(e,t.toNumber(),e.size(),r)}});function a(e,t,a,o){if(!Z(t))throw new TypeError("Second parameter in function diag must be an integer");var s=t>0?t:0,u=t<0?-t:0;switch(a.length){case 1:return function(e,t,r,a,o,s){var u=[a+o,a+s];if(r&&"sparse"!==r&&"dense"!==r)throw new TypeError("Unknown matrix type ".concat(r,'"'));var c="sparse"===r?i.diagonal(u,e,t):n.diagonal(u,e,t);return null!==r?c:c.valueOf()}(e,t,o,a[0],u,s);case 2:return function(e,t,n,i,a,o){if(m(e)){var s=e.diagonal(t);return null!==n?n!==s.storage()?r(s,n):s:s.valueOf()}for(var u=Math.min(i[0]-a,i[1]-o),c=[],f=0;f<u;f++)c[f]=e[f+a][f+o];return null!==n?r(c):c}(e,t,o,a,u,s)}throw new RangeError("Matrix for function diag must be 2 dimensional")}}));function wi(e){var t=0,r=1,n=Object.create(null),i=Object.create(null),a=0,o=function(e){var o=i[e];if(o&&(delete n[o],delete i[e],--t,r===o)){if(!t)return a=0,void(r=1);for(;!hasOwnProperty.call(n,++r););}};return e=Math.abs(e),{hit:function(s){var u=i[s],c=++a;if(n[c]=s,i[s]=c,!u){if(++t<=e)return;return s=n[r],o(s),s}if(delete n[u],r===u)for(;!hasOwnProperty.call(n,++r););},delete:o,clear:function(){t=a=0,r=1,n=Object.create(null),i=Object.create(null)}}}function Ni(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},r=t.hasher,n=t.limit;return n=null==n?Number.POSITIVE_INFINITY:n,r=null==r?JSON.stringify:r,function t(){"object"!==a()(t.cache)&&(t.cache={values:new Map,lru:wi(n||Number.POSITIVE_INFINITY)});for(var i=[],o=0;o<arguments.length;o++)i[o]=arguments[o];var s=r(i);if(t.cache.values.has(s))return t.cache.lru.hit(s),t.cache.values.get(s);var u=e.apply(e,i);return t.cache.values.set(s,u),t.cache.values.delete(t.cache.lru.hit(s)),u}}function Mi(e){return Object.keys(e.signatures||{}).reduce((function(e,t){var r=(t.match(/,/g)||[]).length+1;return Math.max(e,r)}),-1)}var Ei=Qe("filter",["typed"],(function(e){return(0,e.typed)("filter",{"Array, function":Si,"Matrix, function":function(e,t){return e.create(Si(e.toArray(),t))},"Array, RegExp":je,"Matrix, RegExp":function(e,t){return e.create(je(e.toArray(),t))}})}));function Si(e,t){var r=Mi(t);return De(e,(function(e,n,i){return 1===r?t(e):2===r?t(e,[n]):t(e,[n],i)}))}var Ai=Qe("flatten",["typed","matrix"],(function(e){var t=e.typed,r=e.matrix;return t("flatten",{Array:function(e){return qe(He(e))},Matrix:function(e){var t=qe(He(e.toArray()));return r(t)}})})),Oi=Qe("forEach",["typed"],(function(e){return(0,e.typed)("forEach",{"Array, function":Ci,"Matrix, function":function(e,t){return e.forEach(t)}})}));function Ci(e,t){var r=Mi(t);!function n(i,a){Array.isArray(i)?Be(i,(function(e,t){n(e,a.concat(t))})):1===r?t(i):2===r?t(i,a):t(i,a,e)}(e,[])}var _i=Qe("getMatrixDataType",["typed"],(function(e){return(0,e.typed)("getMatrixDataType",{Array:function(e){return Le(e,H)},Matrix:function(e){return e.getDataType()}})})),Ti=Qe("identity",["typed","config","matrix","BigNumber","DenseMatrix","SparseMatrix"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.BigNumber,a=e.DenseMatrix,o=e.SparseMatrix;return t("identity",{"":function(){return"Matrix"===r.matrix?n([]):[]},string:function(e){return n(e)},"number | BigNumber":function(e){return c(e,e,"Matrix"===r.matrix?"dense":void 0)},"number | BigNumber, string":function(e,t){return c(e,e,t)},"number | BigNumber, number | BigNumber":function(e,t){return c(e,t,"Matrix"===r.matrix?"dense":void 0)},"number | BigNumber, number | BigNumber, string":function(e,t,r){return c(e,t,r)},Array:function(e){return u(e)},"Array, string":function(e,t){return u(e,t)},Matrix:function(e){return u(e.valueOf(),e.storage())},"Matrix, string":function(e,t){return u(e.valueOf(),t)}});function u(e,t){switch(e.length){case 0:return t?n(t):[];case 1:return c(e[0],e[0],t);case 2:return c(e[0],e[1],t);default:throw new Error("Vector containing two values expected")}}function c(e,t,r){var n=s(e)||s(t)?i:null;if(s(e)&&(e=e.toNumber()),s(t)&&(t=t.toNumber()),!Z(e)||e<1)throw new Error("Parameters in function identity must be positive integers");if(!Z(t)||t<1)throw new Error("Parameters in function identity must be positive integers");var u=n?new i(1):1,c=n?new n(0):0,f=[e,t];if(r){if("sparse"===r)return o.diagonal(f,u,0,c);if("dense"===r)return a.diagonal(f,u,0,c);throw new TypeError('Unknown matrix type "'.concat(r,'"'))}for(var l=Ce([],f,c),p=e<t?e:t,m=0;m<p;m++)l[m][m]=u;return l}})),Ii=Qe("kron",["typed","matrix","multiplyScalar"],(function(e){var t=e.typed,r=e.matrix,n=e.multiplyScalar;return t("kron",{"Matrix, Matrix":function(e,t){return r(i(e.toArray(),t.toArray()))},"Matrix, Array":function(e,t){return r(i(e.toArray(),t))},"Array, Matrix":function(e,t){return r(i(e,t.toArray()))},"Array, Array":i});function i(e,t){if(1===Se(e).length&&(e=[e]),1===Se(t).length&&(t=[t]),Se(e).length>2||Se(t).length>2)throw new RangeError("Vectors with dimensions greater then 2 are not supported expected (Size x = "+JSON.stringify(e.length)+", y = "+JSON.stringify(t.length)+")");var r=[],i=[];return e.map((function(e){return t.map((function(t){return i=[],r.push(i),e.map((function(e){return t.map((function(t){return i.push(n(e,t))}))}))}))}))&&r}})),ki=Qe("map",["typed"],(function(e){return(0,e.typed)("map",{"Array, function":zi,"Matrix, function":function(e,t){return e.map(t)}})}));function zi(e,t){var r=Mi(t);return function n(i,a){if(Array.isArray(i))return i.map((function(e,t){return n(e,a.concat(t))}));try{return 1===r?t(i):2===r?t(i,a):t(i,a,e)}catch(t){if(t instanceof TypeError&&"data"in t&&"wrongType"===t.data.category){var o="map attempted to call '".concat(t.data.fn,"(").concat(i),s=JSON.stringify(a);throw 2===r?o+=","+s:1!==r&&(o+=",".concat(s,",").concat(e)),o+=")' but argument ".concat(t.data.index+1," of type "),o+="".concat(t.data.actual," does not match expected type "),o+=t.data.expected.join(" or "),new TypeError(o)}throw t}}(e,[])}var qi=Qe("diff",["typed","matrix","subtract","number"],(function(e){var t=e.typed,r=e.matrix,n=e.subtract,i=e.number;return t("diff",{"Array | Matrix":function(e){return m(e)?r(o(e.toArray())):o(e)},"Array | Matrix, number":function(e,t){if(!Z(t))throw new RangeError("Dimension must be a whole number");return m(e)?r(a(e.toArray(),t)):a(e,t)},"Array | Matrix, BigNumber":function(e,t){return this(e,i(t))}});function a(e,t){if(m(e)&&(e=e.toArray()),!Array.isArray(e))throw RangeError("Array/Matrix does not have that many dimensions");if(t>0){var r=[];return e.forEach((function(e){r.push(a(e,t-1))})),r}if(0===t)return o(e);throw RangeError("Cannot have negative dimension")}function o(e){var t=[],r=e.length;if(r<2)return e;for(var n=1;n<r;n++)t.push(s(e[n-1],e[n]));return t}function s(e,t){m(e)&&(e=e.toArray()),m(t)&&(t=t.toArray());var r=Array.isArray(e),i=Array.isArray(t);if(r&&i)return function(e,t){if(e.length!==t.length)throw RangeError("Not all sub-arrays have the same length");for(var r=[],n=e.length,i=0;i<n;i++)r.push(s(e[i],t[i]));return r}(e,t);if(!r&&!i)return n(t,e);throw TypeError("Cannot calculate difference between 1 array and 1 non-array")}})),Ri=Qe("ones",["typed","config","matrix","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.BigNumber;return t("ones",{"":function(){return"Array"===r.matrix?a([]):a([],"default")},"...number | BigNumber | string":function(e){if("string"==typeof e[e.length-1]){var t=e.pop();return a(e,t)}return"Array"===r.matrix?a(e):a(e,"default")},Array:a,Matrix:function(e){var t=e.storage();return a(e.valueOf(),t)},"Array | Matrix, string":function(e,t){return a(e.valueOf(),t)}});function a(e,t){var r=function(e){var t=!1;return e.forEach((function(e,r,n){s(e)&&(t=!0,n[r]=e.toNumber())})),t}(e)?new i(1):1;if(function(e){e.forEach((function(e){if("number"!=typeof e||!Z(e)||e<0)throw new Error("Parameters in function ones must be positive integers")}))}(e),t){var a=n(t);return e.length>0?a.resize(e,r):a}var o=[];return e.length>0?Ce(o,e,r):o}}));function Bi(){throw new Error('No "bignumber" implementation available')}function Di(){throw new Error('No "fraction" implementation available')}function ji(){throw new Error('No "matrix" implementation available')}var Pi=Qe("range",["typed","config","?matrix","?bignumber","smaller","smallerEq","larger","largerEq"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.bignumber,a=e.smaller,o=e.smallerEq,s=e.larger,u=e.largerEq;return t("range",{string:f,"string, boolean":f,"number, number":function(e,t){return c(l(e,t,1))},"number, number, number":function(e,t,r){return c(l(e,t,r))},"number, number, boolean":function(e,t,r){return c(r?p(e,t,1):l(e,t,1))},"number, number, number, boolean":function(e,t,r,n){return c(n?p(e,t,r):l(e,t,r))},"BigNumber, BigNumber":function(e,t){return c(m(e,t,new(0,e.constructor)(1)))},"BigNumber, BigNumber, BigNumber":function(e,t,r){return c(m(e,t,r))},"BigNumber, BigNumber, boolean":function(e,t,r){var n=e.constructor;return c(r?h(e,t,new n(1)):m(e,t,new n(1)))},"BigNumber, BigNumber, BigNumber, boolean":function(e,t,r,n){return c(n?h(e,t,r):m(e,t,r))}});function c(e){return"Matrix"===r.matrix?n?n(e):ji():e}function f(e,t){var n=function(e){var t=e.split(":").map((function(e){return Number(e)}));if(t.some((function(e){return isNaN(e)})))return null;switch(t.length){case 2:return{start:t[0],end:t[1],step:1};case 3:return{start:t[0],end:t[2],step:t[1]};default:return null}}(e);if(!n)throw new SyntaxError('String "'+e+'" is no valid range');return"BigNumber"===r.number?(void 0===i&&Bi(),c((t?h:m)(i(n.start),i(n.end),i(n.step)))):c((t?p:l)(n.start,n.end,n.step))}function l(e,t,r){var n=[],i=e;if(r>0)for(;a(i,t);)n.push(i),i+=r;else if(r<0)for(;s(i,t);)n.push(i),i+=r;return n}function p(e,t,r){var n=[],i=e;if(r>0)for(;o(i,t);)n.push(i),i+=r;else if(r<0)for(;u(i,t);)n.push(i),i+=r;return n}function m(e,t,r){var n=i(0),o=[],u=e;if(r.gt(n))for(;a(u,t);)o.push(u),u=u.plus(r);else if(r.lt(n))for(;s(u,t);)o.push(u),u=u.plus(r);return o}function h(e,t,r){var n=i(0),a=[],s=e;if(r.gt(n))for(;o(s,t);)a.push(s),s=s.plus(r);else if(r.lt(n))for(;u(s,t);)a.push(s),s=s.plus(r);return a}})),Fi=Qe("reshape",["typed","isInteger","matrix"],(function(e){var t=e.typed,r=e.isInteger;return t("reshape",{"Matrix, Array":function(e,t){return e.reshape(t)},"Array, Array":function(e,t){return t.forEach((function(e){if(!r(e))throw new TypeError("Invalid size for dimension: "+e)})),_e(e,t)}})}));function Ui(e,t,r,n){if(!(this instanceof Ui))throw new SyntaxError("Constructor must be called with the new operator");this.fn=e,this.count=t,this.min=r,this.max=n,this.message="Wrong number of arguments in function "+e+" ("+t+" provided, "+r+(null!=n?"-"+n:"")+" expected)",this.stack=(new Error).stack}Ui.prototype=new Error,Ui.prototype.constructor=Error,Ui.prototype.name="ArgumentsError",Ui.prototype.isArgumentsError=!0;var Li=Qe("resize",["config","matrix"],(function(e){var t=e.config,r=e.matrix;return function(e,i,a){if(2!==arguments.length&&3!==arguments.length)throw new Ui("resize",arguments.length,2,3);if(m(i)&&(i=i.valueOf()),s(i[0])&&(i=i.map((function(e){return s(e)?e.toNumber():e}))),m(e))return e.resize(i,a,!0);if("string"==typeof e)return n(e,i,a);var o=!Array.isArray(e)&&"Array"!==t.matrix;if(0===i.length){for(;Array.isArray(e);)e=e[0];return He(e)}Array.isArray(e)||(e=[e]);var u=Ce(e=He(e),i,a);return o?r(u):u};function n(e,t,r){if(void 0!==r){if("string"!=typeof r||1!==r.length)throw new TypeError("Single character expected as defaultValue")}else r=" ";if(1!==t.length)throw new Me(t.length,1);var n=t[0];if("number"!=typeof n||!Z(n))throw new TypeError("Invalid size, must contain positive integers (size: "+xe(t)+")");if(e.length>n)return e.substring(0,n);if(e.length<n){for(var i=e,a=0,o=n-e.length;a<o;a++)i+=r;return i}return e}})),$i=Qe("rotate",["typed","multiply","rotationMatrix"],(function(e){var t=e.typed,r=e.multiply,n=e.rotationMatrix;return t("rotate",{"Array , number | BigNumber | Complex | Unit":function(e,t){return i(e,2),r(n(t),e).toArray()},"Matrix , number | BigNumber | Complex | Unit":function(e,t){return i(e,2),r(n(t),e)},"Array, number | BigNumber | Complex | Unit, Array | Matrix":function(e,t,a){return i(e,3),r(n(t,a),e)},"Matrix, number | BigNumber | Complex | Unit, Array | Matrix":function(e,t,a){return i(e,3),r(n(t,a),e)}});function i(e,t){var r=Array.isArray(e)?Se(e):e.size();if(r.length>2)throw new RangeError("Vector must be of dimensions 1x".concat(t));if(2===r.length&&1!==r[1])throw new RangeError("Vector must be of dimensions 1x".concat(t));if(r[0]!==t)throw new RangeError("Vector must be of dimensions 1x".concat(t))}})),Hi=Qe("rotationMatrix",["typed","config","multiplyScalar","addScalar","unaryMinus","norm","matrix","BigNumber","DenseMatrix","SparseMatrix","cos","sin"],(function(e){var t=e.typed,r=e.config,n=e.multiplyScalar,i=e.addScalar,a=e.unaryMinus,o=e.norm,u=e.BigNumber,c=e.matrix,f=e.DenseMatrix,l=e.SparseMatrix,p=e.cos,m=e.sin;return t("rotationMatrix",{"":function(){return"Matrix"===r.matrix?c([]):[]},string:function(e){return c(e)},"number | BigNumber | Complex | Unit":function(e){return h(e,"Matrix"===r.matrix?"dense":void 0)},"number | BigNumber | Complex | Unit, string":function(e,t){return h(e,t)},"number | BigNumber | Complex | Unit, Array":function(e,t){var r=c(t);return d(r),g(e,r,void 0)},"number | BigNumber | Complex | Unit, Matrix":function(e,t){d(t);var n=t.storage()||("Matrix"===r.matrix?"dense":void 0);return g(e,t,n)},"number | BigNumber | Complex | Unit, Array, string":function(e,t,r){var n=c(t);return d(n),g(e,n,r)},"number | BigNumber | Complex | Unit, Matrix, string":function(e,t,r){return d(t),g(e,t,r)}});function h(e,t){var r=s(e)?new u(-1):-1,i=p(e),a=m(e);return y([[i,n(r,a)],[a,i]],t)}function d(e){var t=e.size();if(t.length<1||3!==t[0])throw new RangeError("Vector must be of dimensions 1x3")}function v(e){return e.reduce((function(e,t){return n(e,t)}))}function y(e,t){if(t){if("sparse"===t)return new l(e);if("dense"===t)return new f(e);throw new TypeError('Unknown matrix type "'.concat(t,'"'))}return e}function g(e,t,r){var n=o(t);if(0===n)throw new RangeError("Rotation around zero vector");var c=s(e)?u:null,f=c?new c(1):1,l=c?new c(-1):-1,h=c?new c(t.get([0])/n):t.get([0])/n,d=c?new c(t.get([1])/n):t.get([1])/n,g=c?new c(t.get([2])/n):t.get([2])/n,x=p(e),b=i(f,a(x)),w=m(e);return y([[i(x,v([h,h,b])),i(v([h,d,b]),v([l,g,w])),i(v([h,g,b]),v([d,w]))],[i(v([h,d,b]),v([g,w])),i(x,v([d,d,b])),i(v([d,g,b]),v([l,h,w]))],[i(v([h,g,b]),v([l,d,w])),i(v([d,g,b]),v([h,w])),i(x,v([g,g,b]))]],r)}})),Gi=Qe("row",["typed","Index","matrix","range"],(function(e){var t=e.typed,r=e.Index,n=e.matrix,i=e.range;return t("row",{"Matrix, number":a,"Array, number":function(e,t){return a(n(He(e)),t).valueOf()}});function a(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");Oe(t,e.size()[0]);var n=i(0,e.size()[1]),a=new r(t,n);return e.subset(a)}})),Vi=Qe("size",["typed","config","?matrix"],(function(e){var t=e.typed,r=e.config,n=e.matrix;return t("size",{Matrix:function(e){return e.create(e.size())},Array:Se,string:function(e){return"Array"===r.matrix?[e.length]:n([e.length])},"number | Complex | BigNumber | Unit | boolean | null":function(e){return"Array"===r.matrix?[]:n?n([]):ji()}})})),Zi=Qe("squeeze",["typed","matrix"],(function(e){var t=e.typed,r=e.matrix;return t("squeeze",{Array:function(e){return ke(He(e))},Matrix:function(e){var t=ke(e.toArray());return Array.isArray(t)?r(t):t},any:function(e){return He(e)}})})),Wi=Qe("subset",["typed","matrix"],(function(e){var t=e.typed,r=e.matrix;return t("subset",{"Array, Index":function(e,t){var n=r(e).subset(t);return t.isScalar()?n:n.valueOf()},"Matrix, Index":function(e,t){return e.subset(t)},"Object, Index":Xi,"string, Index":Yi,"Array, Index, any":function(e,t,n){return r(He(e)).subset(t,n,void 0).valueOf()},"Array, Index, any, any":function(e,t,n,i){return r(He(e)).subset(t,n,i).valueOf()},"Matrix, Index, any":function(e,t,r){return e.clone().subset(t,r)},"Matrix, Index, any, any":function(e,t,r,n){return e.clone().subset(t,r,n)},"string, Index, string":Ji,"string, Index, string, string":Ji,"Object, Index, any":Qi})}));function Yi(e,t){if(!g(t))throw new TypeError("Index expected");if(1!==t.size().length)throw new Me(t.size().length,1);var r=e.length;Oe(t.min()[0],r),Oe(t.max()[0],r);var n=t.dimension(0),i="";return n.forEach((function(t){i+=e.charAt(t)})),i}function Ji(e,t,r,n){if(!t||!0!==t.isIndex)throw new TypeError("Index expected");if(1!==t.size().length)throw new Me(t.size().length,1);if(void 0!==n){if("string"!=typeof n||1!==n.length)throw new TypeError("Single character expected as defaultValue")}else n=" ";var i=t.dimension(0);if(i.size()[0]!==r.length)throw new Me(i.size()[0],r.length);var a=e.length;Oe(t.min()[0]),Oe(t.max()[0]);for(var o=[],s=0;s<a;s++)o[s]=e.charAt(s);if(i.forEach((function(e,t){o[e]=r.charAt(t[0])})),o.length>a)for(var u=a-1,c=o.length;u<c;u++)o[u]||(o[u]=n);return o.join("")}function Xi(e,t){if(1!==t.size().length)throw new Me(t.size(),1);var r=t.dimension(0);if("string"!=typeof r)throw new TypeError("String expected as index to retrieve an object property");return at(e,r)}function Qi(e,t,r){if(1!==t.size().length)throw new Me(t.size(),1);var n=t.dimension(0);if("string"!=typeof n)throw new TypeError("String expected as index to retrieve an object property");var i=He(e);return ot(i,n,r),i}var Ki=Qe("transpose",["typed","matrix"],(function(e){var t=e.typed,r=e.matrix;return t("transpose",{Array:function(e){return this(r(e)).valueOf()},Matrix:function(e){var t,r=e.size();switch(r.length){case 1:t=e.clone();break;case 2:var n=r[0],i=r[1];if(0===i)throw new RangeError("Cannot transpose a 2D matrix with no columns (size: "+xe(r)+")");switch(e.storage()){case"dense":t=function(e,t,r){for(var n,i=e._data,a=[],o=0;o<r;o++){n=a[o]=[];for(var s=0;s<t;s++)n[s]=He(i[s][o])}return e.createDenseMatrix({data:a,size:[r,t],datatype:e._datatype})}(e,n,i);break;case"sparse":t=function(e,t,r){for(var n,i,a,o=e._values,s=e._index,u=e._ptr,c=o?[]:void 0,f=[],l=[],p=[],m=0;m<t;m++)p[m]=0;for(n=0,i=s.length;n<i;n++)p[s[n]]++;for(var h=0,d=0;d<t;d++)l.push(h),h+=p[d],p[d]=l[d];for(l.push(h),a=0;a<r;a++)for(var v=u[a],y=u[a+1],g=v;g<y;g++){var x=p[s[g]]++;f[x]=a,o&&(c[x]=He(o[g]))}return e.createSparseMatrix({values:c,index:f,ptr:l,size:[r,t],datatype:e._datatype})}(e,n,i)}break;default:throw new RangeError("Matrix must be a vector or two dimensional (size: "+xe(this._size)+")")}return t},any:function(e){return He(e)}})})),ea=Qe("ctranspose",["typed","transpose","conj"],(function(e){var t=e.typed,r=e.transpose,n=e.conj;return t("ctranspose",{any:function(e){return n(r(e))}})})),ta=Qe("zeros",["typed","config","matrix","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.BigNumber;return t("zeros",{"":function(){return"Array"===r.matrix?a([]):a([],"default")},"...number | BigNumber | string":function(e){if("string"==typeof e[e.length-1]){var t=e.pop();return a(e,t)}return"Array"===r.matrix?a(e):a(e,"default")},Array:a,Matrix:function(e){var t=e.storage();return a(e.valueOf(),t)},"Array | Matrix, string":function(e,t){return a(e.valueOf(),t)}});function a(e,t){var r=function(e){var t=!1;return e.forEach((function(e,r,n){s(e)&&(t=!0,n[r]=e.toNumber())})),t}(e)?new i(0):0;if(function(e){e.forEach((function(e){if("number"!=typeof e||!Z(e)||e<0)throw new Error("Parameters in function zeros must be positive integers")}))}(e),t){var a=n(t);return e.length>0?a.resize(e,r):a}var o=[];return e.length>0?Ce(o,e,r):o}})),ra=Qe("erf",["typed"],(function(e){return(0,e.typed)("name",{number:function(e){var t=Math.abs(e);return t>=sa?W(e):t<=na?W(e)*function(e){var t,r=e*e,n=aa[0][4]*r,i=r;for(t=0;t<3;t+=1)n=(n+aa[0][t])*r,i=(i+oa[0][t])*r;return e*(n+aa[0][3])/(i+oa[0][3])}(t):t<=4?W(e)*(1-function(e){var t,r=aa[1][8]*e,n=e;for(t=0;t<7;t+=1)r=(r+aa[1][t])*e,n=(n+oa[1][t])*e;var i=(r+aa[1][7])/(n+oa[1][7]),a=parseInt(16*e)/16,o=(e-a)*(e+a);return Math.exp(-a*a)*Math.exp(-o)*i}(t)):W(e)*(1-function(e){var t,r=1/(e*e),n=aa[2][5]*r,i=r;for(t=0;t<4;t+=1)n=(n+aa[2][t])*r,i=(i+oa[2][t])*r;var a=r*(n+aa[2][4])/(i+oa[2][4]);a=(ia-a)/e,r=parseInt(16*e)/16;var o=(e-r)*(e+r);return Math.exp(-r*r)*Math.exp(-o)*a}(t))},"Array | Matrix":function(e){return Gt(e,this)}})})),na=.46875,ia=.5641895835477563,aa=[[3.1611237438705655,113.86415415105016,377.485237685302,3209.3775891384694,.18577770618460315],[.5641884969886701,8.883149794388377,66.11919063714163,298.6351381974001,881.952221241769,1712.0476126340707,2051.0783778260716,1230.3393547979972,2.1531153547440383e-8],[.30532663496123236,.36034489994980445,.12578172611122926,.016083785148742275,.0006587491615298378,.016315387137302097]],oa=[[23.601290952344122,244.02463793444417,1282.6165260773723,2844.236833439171],[15.744926110709835,117.6939508913125,537.1811018620099,1621.3895745666903,3290.7992357334597,4362.619090143247,3439.3676741437216,1230.3393548037495],[2.568520192289822,1.8729528499234604,.5279051029514285,.06051834131244132,.0023352049762686918]],sa=Math.pow(2,53),ua=Qe("mode",["typed","isNaN","isNumeric"],(function(e){var t=e.typed,r=e.isNaN,n=e.isNumeric;return t("mode",{"Array | Matrix":i,"...":function(e){return i(e)}});function i(e){if(0===(e=qe(e.valueOf())).length)throw new Error("Cannot calculate mode of an empty array");for(var t={},i=[],a=0,o=0;o<e.length;o++){var s=e[o];if(n(s)&&r(s))throw new Error("Cannot calculate mode of an array containing NaN values");s in t||(t[s]=0),t[s]++,t[s]===a?i.push(s):t[s]>a&&(a=t[s],i=[s])}return i}}));function ca(e,t,r){var n;return-1!==String(e).indexOf("Unexpected type")?(n=arguments.length>2?" (type: "+H(r)+", value: "+JSON.stringify(r)+")":" (type: "+e.data.actual+")",new TypeError("Cannot calculate "+t+", unexpected type of argument"+n)):-1!==String(e).indexOf("complex numbers")?(n=arguments.length>2?" (type: "+H(r)+", value: "+JSON.stringify(r)+")":"",new TypeError("Cannot calculate "+t+", no ordering relation is defined for complex numbers"+n)):e}var fa=Qe("prod",["typed","config","multiplyScalar","numeric"],(function(e){var t=e.typed,r=e.config,n=e.multiplyScalar,i=e.numeric;return t("prod",{"Array | Matrix":a,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("prod(A, dim) is not yet supported")},"...":function(e){return a(e)}});function a(e){var t;if(Ht(e,(function(e){try{t=void 0===t?e:n(t,e)}catch(t){throw ca(t,"prod",e)}})),"string"==typeof t&&(t=i(t,r.number)),void 0===t)throw new Error("Cannot calculate prod of an empty array");return t}})),la=Qe("format",["typed"],(function(e){return(0,e.typed)("format",{any:xe,"any, Object | function | number":xe})})),pa=Qe("bin",["typed","format"],(function(e){var t=e.typed,r=e.format;return t("bin",{"number | BigNumber":function(e){return r(e,{notation:"bin"})},"number | BigNumber, number":function(e,t){return r(e,{notation:"bin",wordSize:t})}})})),ma=Qe("oct",["typed","format"],(function(e){var t=e.typed,r=e.format;return t("oct",{"number | BigNumber":function(e){return r(e,{notation:"oct"})},"number | BigNumber, number":function(e,t){return r(e,{notation:"oct",wordSize:t})}})})),ha=Qe("hex",["typed","format"],(function(e){var t=e.typed,r=e.format;return t("hex",{"number | BigNumber":function(e){return r(e,{notation:"hex"})},"number | BigNumber, number":function(e,t){return r(e,{notation:"hex",wordSize:t})}})})),da=Qe("print",["typed"],(function(e){return(0,e.typed)("print",{"string, Object | Array":va,"string, Object | Array, number | Object":va})}));function va(e,t,r){return e.replace(/\$([\w.]+)/g,(function(e,n){for(var i=n.split("."),a=t[i.shift()];i.length&&void 0!==a;){var o=i.shift();a=o?a[o]:a+"."}return void 0!==a?l(a)?a:xe(a,r):e}))}var ya=Qe("to",["typed","matrix"],(function(e){var t=e.typed,r=e.matrix,n=hn({typed:t}),i=nn({typed:t});return t("to",{"Unit, Unit | string":function(e,t){return e.to(t)},"Matrix, Matrix":function(e,t){return n(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"Matrix, any":function(e,t){return i(e,t,this,!1)},"any, Matrix":function(e,t){return i(t,e,this,!0)},"Array, any":function(e,t){return i(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return i(r(t),e,this,!0).valueOf()}})})),ga=Qe("isPrime",["typed"],(function(e){return(0,e.typed)("isPrime",{number:function(e){if(0*e!=0)return!1;if(e<=3)return e>1;if(e%2==0||e%3==0)return!1;for(var t=5;t*t<=e;t+=6)if(e%t==0||e%(t+2)==0)return!1;return!0},BigNumber:function(e){if(0*e.toNumber()!=0)return!1;if(e.lte(3))return e.gt(1);if(e.mod(2).eq(0)||e.mod(3).eq(0))return!1;if(e.lt(Math.pow(2,32))){for(var t=e.toNumber(),r=5;r*r<=t;r+=6)if(t%r==0||t%(r+2)==0)return!1;return!0}function n(e,t,r){for(var n=1;!t.eq(0);)t.mod(2).eq(0)?(t=t.div(2),e=e.mul(e).mod(r)):(t=t.sub(1),n=e.mul(n).mod(r));return n}for(var i=e.constructor.clone({precision:2*e.toFixed(0).length}),a=0,o=(e=new i(e)).sub(1);o.mod(2).eq(0);)o=o.div(2),a+=1;var s=null;if(e.lt("3317044064679887385961981"))s=[2,3,5,7,11,13,17,19,23,29,31,37,41].filter((function(t){return t<e}));else{var u=Math.min(e.toNumber()-2,Math.floor(2*Math.pow(e.toFixed(0).length*Math.log(10),2)));s=[];for(var c=2;c<=u;c+=1)s.push(u)}for(var f=0;f<s.length;f+=1){var l=s[f],p=n(e.sub(e).add(l),o,e);if(!p.eq(1))for(var m=0,h=p;!h.eq(e.sub(1));m+=1,h=h.mul(h).mod(e))if(m===a-1)return!1}return!0},"Array | Matrix":function(e){return Gt(e,this)}})})),xa=Qe("numeric",["number","?bignumber","?fraction"],(function(e){var t=e.number,r=e.bignumber,n=e.fraction,i={string:!0,number:!0,BigNumber:!0,Fraction:!0},a={number:function(e){return t(e)},BigNumber:r?function(e){return r(e)}:Bi,Fraction:n?function(e){return n(e)}:Di};return function(e,t){var r=H(e);if(!(r in i))throw new TypeError("Cannot convert "+e+' of type "'+r+'"; valid input types are '+Object.keys(i).join(", "));if(!(t in a))throw new TypeError("Cannot convert "+e+' to type "'+t+'"; valid output types are '+Object.keys(a).join(", "));return t===r?e:a[t](e)}})),ba=Qe("divideScalar",["typed","numeric"],(function(e){var t=e.typed,r=e.numeric;return t("divideScalar",{"number, number":function(e,t){return e/t},"Complex, Complex":function(e,t){return e.div(t)},"BigNumber, BigNumber":function(e,t){return e.div(t)},"Fraction, Fraction":function(e,t){return e.div(t)},"Unit, number | Fraction | BigNumber":function(e,t){var n=e.clone(),i=r(1,H(t));return n.value=this(null===n.value?n._normalize(i):n.value,t),n},"number | Fraction | BigNumber, Unit":function(e,t){var n=t.clone();n=n.pow(-1);var i=r(1,H(e));return n.value=this(e,null===t.value?t._normalize(i):t.value),n},"Unit, Unit":function(e,t){return e.divide(t)}})})),wa=Qe("pow",["typed","config","identity","multiply","matrix","fraction","number","Complex"],(function(e){var t=e.typed,r=e.config,n=e.identity,i=e.multiply,a=e.matrix,o=e.number,s=e.fraction,u=e.Complex;return t("pow",{"number, number":c,"Complex, Complex":function(e,t){return e.pow(t)},"BigNumber, BigNumber":function(e,t){return t.isInteger()||e>=0||r.predictable?e.pow(t):new u(e.toNumber(),0).pow(t.toNumber(),0)},"Fraction, Fraction":function(e,t){var n=e.pow(t);if(null!=n)return n;if(r.predictable)throw new Error("Result of pow is non-rational and cannot be expressed as a fraction");return c(e.valueOf(),t.valueOf())},"Array, number":f,"Array, BigNumber":function(e,t){return f(e,t.toNumber())},"Matrix, number":l,"Matrix, BigNumber":function(e,t){return l(e,t.toNumber())},"Unit, number | BigNumber":function(e,t){return e.pow(t)}});function c(e,t){if(r.predictable&&!Z(t)&&e<0)try{var n=s(t),i=o(n);if((t===i||Math.abs((t-i)/t)<1e-14)&&n.d%2==1)return(n.n%2==0?1:-1)*Math.pow(-e,t)}catch(e){}return r.predictable&&(e<-1&&t===1/0||e>-1&&e<0&&t===-1/0)?NaN:Z(t)||e>=0||r.predictable?Gr(e,t):e*e<1&&t===1/0||e*e>1&&t===-1/0?0:new u(e,0).pow(t,0)}function f(e,t){if(!Z(t)||t<0)throw new TypeError("For A^b, b must be a positive integer (value is "+t+")");var r=Se(e);if(2!==r.length)throw new Error("For A^b, A must be 2 dimensional (A has "+r.length+" dimensions)");if(r[0]!==r[1])throw new Error("For A^b, A must be square (size is "+r[0]+"x"+r[1]+")");for(var a=n(r[0]).valueOf(),o=e;t>=1;)1==(1&t)&&(a=i(o,a)),t>>=1,o=i(o,o);return a}function l(e,t){return a(f(e.valueOf(),t))}})),Na=(r(131),r(132),r(55)),Ma=r.n(Na);function Ea(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);t&&(n=n.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),r.push.apply(r,n)}return r}function Sa(e){for(var t=1;t<arguments.length;t++){var r=null!=arguments[t]?arguments[t]:{};t%2?Ea(Object(r),!0).forEach((function(t){Ma()(e,t,r[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(r)):Ea(Object(r)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(r,t))}))}return e}var Aa="Number of decimals in function round must be an integer",Oa=Qe("round",["typed","matrix","equalScalar","zeros","BigNumber","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.zeros,a=e.BigNumber,o=e.DenseMatrix,s=rn({typed:t,equalScalar:n}),u=Mn({typed:t,DenseMatrix:o}),c=nn({typed:t});return t("round",Sa(Sa({},Ca),{},{Complex:function(e){return e.round()},"Complex, number":function(e,t){if(t%1)throw new TypeError(Aa);return e.round(t)},"Complex, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(Aa);var r=t.toNumber();return e.round(r)},"number, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(Aa);return new a(e).toDecimalPlaces(t.toNumber())},BigNumber:function(e){return e.toDecimalPlaces(0)},"BigNumber, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(Aa);return e.toDecimalPlaces(t.toNumber())},Fraction:function(e){return e.round()},"Fraction, number":function(e,t){if(t%1)throw new TypeError(Aa);return e.round(t)},"Array | Matrix":function(e){return Gt(e,this,!0)},"SparseMatrix, number | BigNumber":function(e,t){return s(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return c(e,t,this,!1)},"number | Complex | BigNumber, SparseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):u(t,e,this,!0)},"number | Complex | BigNumber, DenseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):c(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return c(r(e),t,this,!1).valueOf()},"number | Complex | BigNumber, Array":function(e,t){return c(r(t),e,this,!0).valueOf()}}))})),Ca={number:Vr,"number, number":function(e,t){if(!Z(t))throw new TypeError(Aa);if(t<0||t>15)throw new Error("Number of decimals in function round must be in the range of 0-15");return Vr(e,t)}},_a=Qe("log",["config","typed","divideScalar","Complex"],(function(e){var t=e.typed,r=e.config,n=e.divideScalar,i=e.Complex;return t("log",{number:function(e){return e>=0||r.predictable?function(e,t){return t?Math.log(e)/Math.log(t):Math.log(e)}(e):new i(e,0).log()},Complex:function(e){return e.log()},BigNumber:function(e){return!e.isNegative()||r.predictable?e.ln():new i(e.toNumber(),0).log()},"Array | Matrix":function(e){return Gt(e,this)},"any, any":function(e,t){return n(this(e),this(t))}})})),Ta=Qe("log1p",["typed","config","divideScalar","log","Complex"],(function(e){var t=e.typed,r=e.config,n=e.divideScalar,i=e.log,a=e.Complex;return t("log1p",{number:function(e){return e>=-1||r.predictable?X(e):o(new a(e,0))},Complex:o,BigNumber:function(e){var t=e.plus(1);return!t.isNegative()||r.predictable?t.ln():o(new a(e.toNumber(),0))},"Array | Matrix":function(e){return Gt(e,this)},"any, any":function(e,t){return n(this(e),i(t))}});function o(e){var t=e.re+1;return new a(Math.log(Math.sqrt(t*t+e.im*e.im)),Math.atan2(e.im,t))}})),Ia=Qe("nthRoots",["config","typed","divideScalar","Complex"],(function(e){var t=e.typed,r=(e.config,e.divideScalar,e.Complex),n=[function(e){return new r(e,0)},function(e){return new r(0,e)},function(e){return new r(-e,0)},function(e){return new r(0,-e)}];function i(e,t){if(t<0)throw new Error("Root must be greater than zero");if(0===t)throw new Error("Root must be non-zero");if(t%1!=0)throw new Error("Root must be an integer");if(0===e||0===e.abs())return[new r(0,0)];var i,a="number"==typeof e;(a||0===e.re||0===e.im)&&(i=a?2*+(e<0):0===e.im?2*+(e.re<0):2*+(e.im<0)+1);for(var o=e.arg(),s=e.abs(),u=[],c=Math.pow(s,1/t),f=0;f<t;f++){var l=(i+4*f)/t;l!==Math.round(l)?u.push(new r({r:c,phi:(o+2*Math.PI*f)/t})):u.push(n[l%4](c))}return u}return t("nthRoots",{Complex:function(e){return i(e,2)},"Complex, number":i})})),ka=Qe("dotPow",["typed","equalScalar","matrix","pow","DenseMatrix"],(function(e){var t=e.typed,r=e.equalScalar,n=e.matrix,i=e.pow,a=e.DenseMatrix,o=wn({typed:t}),s=ri({typed:t,DenseMatrix:a}),u=rn({typed:t,equalScalar:r}),c=Mn({typed:t,DenseMatrix:a}),f=hn({typed:t}),l=nn({typed:t});return t("dotPow",{"any, any":i,"SparseMatrix, SparseMatrix":function(e,t){return s(e,t,i,!1)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,i,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,i,!1)},"DenseMatrix, DenseMatrix":function(e,t){return f(e,t,i)},"Array, Array":function(e,t){return this(n(e),n(t)).valueOf()},"Array, Matrix":function(e,t){return this(n(e),t)},"Matrix, Array":function(e,t){return this(e,n(t))},"SparseMatrix, any":function(e,t){return u(e,t,this,!1)},"DenseMatrix, any":function(e,t){return l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return c(t,e,this,!0)},"any, DenseMatrix":function(e,t){return l(t,e,this,!0)},"Array, any":function(e,t){return l(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return l(n(t),e,this,!0).valueOf()}})})),za=Qe("dotDivide",["typed","matrix","equalScalar","divideScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.divideScalar,a=e.DenseMatrix,o=vn({typed:t,equalScalar:n}),s=wn({typed:t}),u=ri({typed:t,DenseMatrix:a}),c=rn({typed:t,equalScalar:n}),f=Mn({typed:t,DenseMatrix:a}),l=hn({typed:t}),p=nn({typed:t});return t("dotDivide",{"any, any":i,"SparseMatrix, SparseMatrix":function(e,t){return u(e,t,i,!1)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,i,!0)},"DenseMatrix, SparseMatrix":function(e,t){return s(e,t,i,!1)},"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,i)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return c(e,t,i,!1)},"DenseMatrix, any":function(e,t){return p(e,t,i,!1)},"any, SparseMatrix":function(e,t){return f(t,e,i,!0)},"any, DenseMatrix":function(e,t){return p(t,e,i,!0)},"Array, any":function(e,t){return p(r(e),t,i,!1).valueOf()},"any, Array":function(e,t){return p(r(t),e,i,!0).valueOf()}})}));function qa(e){var t=e.DenseMatrix;return function(e,r,n){var i=e.size();if(2!==i.length)throw new RangeError("Matrix must be two dimensional (size: "+xe(i)+")");var a=i[0];if(a!==i[1])throw new RangeError("Matrix must be square (size: "+xe(i)+")");var o=[];if(m(r)){var s=r.size(),u=r._data;if(1===s.length){if(s[0]!==a)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(var c=0;c<a;c++)o[c]=[u[c]];return new t({data:o,size:[a,1],datatype:r._datatype})}if(2===s.length){if(s[0]!==a||1!==s[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");if(d(r)){if(n){o=[];for(var f=0;f<a;f++)o[f]=[u[f][0]];return new t({data:o,size:[a,1],datatype:r._datatype})}return r}if(v(r)){for(var l=0;l<a;l++)o[l]=[0];for(var h=r._values,y=r._index,g=r._ptr,x=g[1],b=g[0];b<x;b++){o[y[b]][0]=h[b]}return new t({data:o,size:[a,1],datatype:r._datatype})}}throw new RangeError("Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.")}if(p(r)){var w=Se(r);if(1===w.length){if(w[0]!==a)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(var N=0;N<a;N++)o[N]=[r[N]];return new t({data:o,size:[a,1]})}if(2===w.length){if(w[0]!==a||1!==w[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(var M=0;M<a;M++)o[M]=[r[M][0]];return new t({data:o,size:[a,1]})}throw new RangeError("Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.")}}}var Ra=Qe("lsolve",["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.divideScalar,i=e.multiplyScalar,a=e.subtract,o=e.equalScalar,s=e.DenseMatrix,u=qa({DenseMatrix:s});return t("lsolve",{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=(t=u(e,t,!0))._data,c=e._size[0],f=e._size[1],l=e._values,p=e._index,m=e._ptr,h=[],d=0;d<f;d++){var v=r[d][0]||0;if(o(v,0))h[d]=[0];else{for(var y=0,g=[],x=[],b=m[d],w=m[d+1],N=b;N<w;N++){var M=p[N];M===d?y=l[N]:M>d&&(g.push(l[N]),x.push(M))}if(o(y,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var E=n(v,y),S=0,A=x.length;S<A;S++){var O=x[S];r[O]=[a(r[O][0]||0,i(E,g[S]))]}h[d]=[E]}}return new s({data:h,size:[c,1]})}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(r(e),t).valueOf()}});function c(e,t){for(var r=(t=u(e,t,!0))._data,c=e._size[0],f=e._size[1],l=[],p=e._data,m=0;m<f;m++){var h=r[m][0]||0,d=void 0;if(o(h,0))d=0;else{var v=p[m][m];if(o(v,0))throw new Error("Linear system cannot be solved since matrix is singular");d=n(h,v);for(var y=m+1;y<c;y++)r[y]=[a(r[y][0]||0,i(d,p[y][m]))]}l[m]=[d]}return new s({data:l,size:[c,1]})}})),Ba=Qe("usolve",["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.divideScalar,i=e.multiplyScalar,a=e.subtract,o=e.equalScalar,s=e.DenseMatrix,u=qa({DenseMatrix:s});return t("usolve",{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=(t=u(e,t,!0))._data,c=e._size[0],f=e._size[1],l=e._values,p=e._index,m=e._ptr,h=[],d=f-1;d>=0;d--){var v=r[d][0]||0;if(o(v,0))h[d]=[0];else{for(var y=0,g=[],x=[],b=m[d],w=m[d+1]-1;w>=b;w--){var N=p[w];N===d?y=l[w]:N<d&&(g.push(l[w]),x.push(N))}if(o(y,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var M=n(v,y),E=0,S=x.length;E<S;E++){var A=x[E];r[A]=[a(r[A][0],i(M,g[E]))]}h[d]=[M]}}return new s({data:h,size:[c,1]})}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(r(e),t).valueOf()}});function c(e,t){for(var r=(t=u(e,t,!0))._data,c=e._size[0],f=e._size[1],l=[],p=e._data,m=f-1;m>=0;m--){var h=r[m][0]||0,d=void 0;if(o(h,0))d=0;else{var v=p[m][m];if(o(v,0))throw new Error("Linear system cannot be solved since matrix is singular");d=n(h,v);for(var y=m-1;y>=0;y--)r[y]=[a(r[y][0]||0,i(d,p[y][m]))]}l[m]=[d]}return new s({data:l,size:[c,1]})}})),Da=r(25),ja=r.n(Da),Pa=Qe("lsolveAll",["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.divideScalar,i=e.multiplyScalar,a=e.subtract,o=e.equalScalar,s=e.DenseMatrix,u=qa({DenseMatrix:s});return t("lsolveAll",{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=[u(e,t,!0)._data.map((function(e){return e[0]}))],c=e._size[0],f=e._size[1],l=e._values,p=e._index,m=e._ptr,h=0;h<f;h++)for(var d=r.length,v=0;v<d;v++){for(var y=r[v],g=[],x=[],b=m[h],w=m[h+1],N=0,M=b;M<w;M++){var E=p[M];E===h?N=l[M]:E>h&&(g.push(l[M]),x.push(E))}if(o(N,0))if(o(y[h],0)){if(0===v){var S=ja()(y);S[h]=1;for(var A=0,O=x.length;A<O;A++){var C=x[A];S[C]=a(S[C],g[A])}r.push(S)}}else{if(0===v)return[];r.splice(v,1),v-=1,d-=1}else{y[h]=n(y[h],N);for(var _=0,T=x.length;_<T;_++){var I=x[_];y[I]=a(y[I],i(y[h],g[_]))}}}return r.map((function(e){return new s({data:e.map((function(e){return[e]})),size:[c,1]})}))}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(r(e),t).map((function(e){return e.valueOf()}))}});function c(e,t){for(var r=[u(e,t,!0)._data.map((function(e){return e[0]}))],c=e._data,f=e._size[0],l=e._size[1],p=0;p<l;p++)for(var m=r.length,h=0;h<m;h++){var d=r[h];if(o(c[p][p],0))if(o(d[p],0)){if(0===h){var v=ja()(d);v[p]=1;for(var y=p+1;y<l;y++)v[y]=a(v[y],c[y][p]);r.push(v)}}else{if(0===h)return[];r.splice(h,1),h-=1,m-=1}else{d[p]=n(d[p],c[p][p]);for(var g=p+1;g<l;g++)d[g]=a(d[g],i(d[p],c[g][p]))}}return r.map((function(e){return new s({data:e.map((function(e){return[e]})),size:[f,1]})}))}})),Fa=Qe("usolveAll",["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.divideScalar,i=e.multiplyScalar,a=e.subtract,o=e.equalScalar,s=e.DenseMatrix,u=qa({DenseMatrix:s});return t("usolveAll",{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=[u(e,t,!0)._data.map((function(e){return e[0]}))],c=e._size[0],f=e._size[1],l=e._values,p=e._index,m=e._ptr,h=f-1;h>=0;h--)for(var d=r.length,v=0;v<d;v++){for(var y=r[v],g=[],x=[],b=m[h],w=m[h+1],N=0,M=w-1;M>=b;M--){var E=p[M];E===h?N=l[M]:E<h&&(g.push(l[M]),x.push(E))}if(o(N,0))if(o(y[h],0)){if(0===v){var S=ja()(y);S[h]=1;for(var A=0,O=x.length;A<O;A++){var C=x[A];S[C]=a(S[C],g[A])}r.push(S)}}else{if(0===v)return[];r.splice(v,1),v-=1,d-=1}else{y[h]=n(y[h],N);for(var _=0,T=x.length;_<T;_++){var I=x[_];y[I]=a(y[I],i(y[h],g[_]))}}}return r.map((function(e){return new s({data:e.map((function(e){return[e]})),size:[c,1]})}))}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(r(e),t).map((function(e){return e.valueOf()}))}});function c(e,t){for(var r=[u(e,t,!0)._data.map((function(e){return e[0]}))],c=e._data,f=e._size[0],l=e._size[1]-1;l>=0;l--)for(var p=r.length,m=0;m<p;m++){var h=r[m];if(o(c[l][l],0))if(o(h[l],0)){if(0===m){var d=ja()(h);d[l]=1;for(var v=l-1;v>=0;v--)d[v]=a(d[v],c[v][l]);r.push(d)}}else{if(0===m)return[];r.splice(m,1),m-=1,p-=1}else{h[l]=n(h[l],c[l][l]);for(var y=l-1;y>=0;y--)h[y]=a(h[y],i(h[l],c[y][l]))}}return r.map((function(e){return new s({data:e.map((function(e){return[e]})),size:[f,1]})}))}})),Ua=Qe("algorithm08",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,f=n._values,l=n._index,p=n._ptr,m=n._size,h=n._datatype;if(u.length!==m.length)throw new Me(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");if(!a||!f)throw new Error("Cannot perform operation on Pattern Sparse Matrices");var d,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(d=c,g=t.find(r,[d,d]),x=t.convert(0,d),b=t.find(i,[d,d]));for(var w,N,M,E,S=[],A=[],O=[],C=[],_=[],T=0;T<y;T++){O[T]=A.length;var I=T+1;for(N=s[T],M=s[T+1],w=N;w<M;w++)_[E=o[w]]=I,C[E]=a[w],A.push(E);for(N=p[T],M=p[T+1],w=N;w<M;w++)_[E=l[w]]===I&&(C[E]=b(C[E],f[w]));for(w=O[T];w<A.length;){var k=C[E=A[w]];g(k,x)?A.splice(w,1):(S.push(k),w++)}}return O[y]=A.length,e.createSparseMatrix({values:S,index:A,ptr:O,size:[v,y],datatype:d})}})),La=Qe("leftShift",["typed","matrix","equalScalar","zeros","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.zeros,a=e.DenseMatrix,o=ln({typed:t}),s=vn({typed:t,equalScalar:n}),u=Ua({typed:t,equalScalar:n}),c=mn({typed:t,DenseMatrix:a}),f=rn({typed:t,equalScalar:n}),l=hn({typed:t}),p=nn({typed:t});return t("leftShift",{"number, number":Jn,"BigNumber, BigNumber":$n,"SparseMatrix, SparseMatrix":function(e,t){return u(e,t,this,!1)},"SparseMatrix, DenseMatrix":function(e,t){return s(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, number | BigNumber":function(e,t){return n(t,0)?e.clone():f(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return n(t,0)?e.clone():p(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):c(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):p(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(r(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,r(t)).valueOf()}})})),$a=Qe("rightArithShift",["typed","matrix","equalScalar","zeros","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.zeros,a=e.DenseMatrix,o=ln({typed:t}),s=vn({typed:t,equalScalar:n}),u=Ua({typed:t,equalScalar:n}),c=mn({typed:t,DenseMatrix:a}),f=rn({typed:t,equalScalar:n}),l=hn({typed:t}),p=nn({typed:t});return t("rightArithShift",{"number, number":Xn,"BigNumber, BigNumber":Hn,"SparseMatrix, SparseMatrix":function(e,t){return u(e,t,this,!1)},"SparseMatrix, DenseMatrix":function(e,t){return s(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, number | BigNumber":function(e,t){return n(t,0)?e.clone():f(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return n(t,0)?e.clone():p(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):c(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):p(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(r(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,r(t)).valueOf()}})})),Ha=Qe("rightLogShift",["typed","matrix","equalScalar","zeros","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.zeros,a=e.DenseMatrix,o=ln({typed:t}),s=vn({typed:t,equalScalar:n}),u=Ua({typed:t,equalScalar:n}),c=mn({typed:t,DenseMatrix:a}),f=rn({typed:t,equalScalar:n}),l=hn({typed:t}),p=nn({typed:t});return t("rightLogShift",{"number, number":Qn,"SparseMatrix, SparseMatrix":function(e,t){return u(e,t,this,!1)},"SparseMatrix, DenseMatrix":function(e,t){return s(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, number | BigNumber":function(e,t){return n(t,0)?e.clone():f(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return n(t,0)?e.clone():p(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):c(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return n(e,0)?i(t.size(),t.storage()):p(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(r(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,r(t)).valueOf()}})})),Ga=Qe("and",["typed","matrix","equalScalar","zeros","not"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.zeros,a=e.not,o=vn({typed:t,equalScalar:n}),s=yn({typed:t,equalScalar:n}),u=rn({typed:t,equalScalar:n}),c=hn({typed:t}),f=nn({typed:t});return t("and",{"number, number":li,"Complex, Complex":function(e,t){return!(0===e.re&&0===e.im||0===t.re&&0===t.im)},"BigNumber, BigNumber":function(e,t){return!(e.isZero()||t.isZero()||e.isNaN()||t.isNaN())},"Unit, Unit":function(e,t){return this(e.value||0,t.value||0)},"SparseMatrix, SparseMatrix":function(e,t){return s(e,t,this,!1)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return c(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return a(t)?i(e.size(),e.storage()):u(e,t,this,!1)},"DenseMatrix, any":function(e,t){return a(t)?i(e.size(),e.storage()):f(e,t,this,!1)},"any, SparseMatrix":function(e,t){return a(e)?i(e.size(),e.storage()):u(t,e,this,!0)},"any, DenseMatrix":function(e,t){return a(e)?i(e.size(),e.storage()):f(t,e,this,!0)},"Array, any":function(e,t){return this(r(e),t).valueOf()},"any, Array":function(e,t){return this(e,r(t)).valueOf()}})})),Va=Qe("compare",["typed","config","matrix","equalScalar","BigNumber","Fraction","DenseMatrix"],(function(e){var t=e.typed,r=e.config,n=e.equalScalar,i=e.matrix,a=e.BigNumber,o=e.Fraction,s=e.DenseMatrix,u=wn({typed:t}),c=Nn({typed:t,equalScalar:n}),f=Mn({typed:t,DenseMatrix:s}),l=hn({typed:t}),p=nn({typed:t});return t("compare",{"boolean, boolean":function(e,t){return e===t?0:e>t?1:-1},"number, number":function(e,t){return ue(e,t,r.epsilon)?0:e>t?1:-1},"BigNumber, BigNumber":function(e,t){return sr(e,t,r.epsilon)?new a(0):new a(e.cmp(t))},"Fraction, Fraction":function(e,t){return new o(e.compare(t))},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,t){if(!e.equalBase(t))throw new Error("Cannot compare units with different base");return this(e.value,t.value)},"SparseMatrix, SparseMatrix":function(e,t){return c(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return u(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return u(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,this)},"Array, Array":function(e,t){return this(i(e),i(t)).valueOf()},"Array, Matrix":function(e,t){return this(i(e),t)},"Matrix, Array":function(e,t){return this(e,i(t))},"SparseMatrix, any":function(e,t){return f(e,t,this,!1)},"DenseMatrix, any":function(e,t){return p(e,t,this,!1)},"any, SparseMatrix":function(e,t){return f(t,e,this,!0)},"any, DenseMatrix":function(e,t){return p(t,e,this,!0)},"Array, any":function(e,t){return p(i(e),t,this,!1).valueOf()},"any, Array":function(e,t){return p(i(t),e,this,!0).valueOf()}})})),Za=r(64),Wa=r.n(Za),Ya=Qe("compareNatural",["typed","compare"],(function(e){var t=e.typed,r=e.compare,n=r.signatures["boolean,boolean"];return t("compareNatural",{"any, any":function(e,t){var a,o=H(e),s=H(t);if(!("number"!==o&&"BigNumber"!==o&&"Fraction"!==o||"number"!==s&&"BigNumber"!==s&&"Fraction"!==s))return"0"!==(a=r(e,t)).toString()?a>0?1:-1:Wa()(o,s);if("Array"===o||"Matrix"===o||"Array"===s||"Matrix"===s)return 0!==(a=function e(t,r,n){if(v(r)&&v(n))return i(t,r.toJSON().values,n.toJSON().values);if(v(r))return e(t,r.toArray(),n);if(v(n))return e(t,r,n.toArray());if(d(r))return e(t,r.toJSON().data,n);if(d(n))return e(t,r,n.toJSON().data);if(!Array.isArray(r))return e(t,[r],n);if(!Array.isArray(n))return e(t,r,[n]);return i(t,r,n)}(this,e,t))?a:Wa()(o,s);if(o!==s)return Wa()(o,s);if("Complex"===o)return function(e,t){if(e.re>t.re)return 1;if(e.re<t.re)return-1;if(e.im>t.im)return 1;if(e.im<t.im)return-1;return 0}(e,t);if("Unit"===o)return e.equalBase(t)?this(e.value,t.value):i(this,e.formatUnits(),t.formatUnits());if("boolean"===o)return n(e,t);if("string"===o)return Wa()(e,t);if("Object"===o)return function(e,t,r){var n=Object.keys(t),a=Object.keys(r);n.sort(Wa.a),a.sort(Wa.a);var o=i(e,n,a);if(0!==o)return o;for(var s=0;s<n.length;s++){var u=e(t[n[s]],r[a[s]]);if(0!==u)return u}return 0}(this,e,t);if("null"===o)return 0;if("undefined"===o)return 0;throw new TypeError('Unsupported type of value "'+o+'"')}});function i(e,t,r){for(var n=0,i=Math.min(t.length,r.length);n<i;n++){var a=e(t[n],r[n]);if(0!==a)return a}return t.length>r.length?1:t.length<r.length?-1:0}}));var Ja=Qe("compareText",["typed","matrix"],(function(e){var t=e.typed,r=e.matrix,n=hn({typed:t}),i=nn({typed:t});return t("compareText",{"any, any":Ne,"DenseMatrix, DenseMatrix":function(e,t){return n(e,t,Ne)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"DenseMatrix, any":function(e,t){return i(e,t,Ne,!1)},"any, DenseMatrix":function(e,t){return i(t,e,Ne,!0)},"Array, any":function(e,t){return i(r(e),t,Ne,!1).valueOf()},"any, Array":function(e,t){return i(r(t),e,Ne,!0).valueOf()}})})),Xa=Qe("equal",["typed","matrix","equalScalar","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.DenseMatrix,a=wn({typed:t}),o=ri({typed:t,DenseMatrix:i}),s=Mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("equal",{"any, any":function(e,t){return null===e?null===t:null===t?null===e:void 0===e?void 0===t:void 0===t?void 0===e:n(e,t)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,n)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,n,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,n,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,n)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, any":function(e,t){return s(e,t,n,!1)},"DenseMatrix, any":function(e,t){return c(e,t,n,!1)},"any, SparseMatrix":function(e,t){return s(t,e,n,!0)},"any, DenseMatrix":function(e,t){return c(t,e,n,!0)},"Array, any":function(e,t){return c(r(e),t,n,!1).valueOf()},"any, Array":function(e,t){return c(r(t),e,n,!0).valueOf()}})})),Qa=(Qe("equal",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return t("equal",{"any, any":function(e,t){return null===e?null===t:null===t?null===e:void 0===e?void 0===t:void 0===t?void 0===e:r(e,t)}})})),Qe("equalText",["typed","compareText","isZero"],(function(e){var t=e.typed,r=e.compareText,n=e.isZero;return t("equalText",{"any, any":function(e,t){return n(r(e,t))}})}))),Ka=Qe("smaller",["typed","config","matrix","DenseMatrix"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.DenseMatrix,a=wn({typed:t}),o=ri({typed:t,DenseMatrix:i}),s=Mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("smaller",{"boolean, boolean":function(e,t){return e<t},"number, number":function(e,t){return e<t&&!ue(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lt(t)&&!sr(e,t,r.epsilon)},"Fraction, Fraction":function(e,t){return-1===e.compare(t)},"Complex, Complex":function(e,t){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,t){if(!e.equalBase(t))throw new Error("Cannot compare units with different base");return this(e.value,t.value)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,this)},"Array, Array":function(e,t){return this(n(e),n(t)).valueOf()},"Array, Matrix":function(e,t){return this(n(e),t)},"Matrix, Array":function(e,t){return this(e,n(t))},"SparseMatrix, any":function(e,t){return s(e,t,this,!1)},"DenseMatrix, any":function(e,t){return c(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(t,e,this,!0)},"any, DenseMatrix":function(e,t){return c(t,e,this,!0)},"Array, any":function(e,t){return c(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return c(n(t),e,this,!0).valueOf()}})})),eo=Qe("smallerEq",["typed","config","matrix","DenseMatrix"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.DenseMatrix,a=wn({typed:t}),o=ri({typed:t,DenseMatrix:i}),s=Mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("smallerEq",{"boolean, boolean":function(e,t){return e<=t},"number, number":function(e,t){return e<=t||ue(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lte(t)||sr(e,t,r.epsilon)},"Fraction, Fraction":function(e,t){return 1!==e.compare(t)},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,t){if(!e.equalBase(t))throw new Error("Cannot compare units with different base");return this(e.value,t.value)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,this)},"Array, Array":function(e,t){return this(n(e),n(t)).valueOf()},"Array, Matrix":function(e,t){return this(n(e),t)},"Matrix, Array":function(e,t){return this(e,n(t))},"SparseMatrix, any":function(e,t){return s(e,t,this,!1)},"DenseMatrix, any":function(e,t){return c(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(t,e,this,!0)},"any, DenseMatrix":function(e,t){return c(t,e,this,!0)},"Array, any":function(e,t){return c(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return c(n(t),e,this,!0).valueOf()}})})),to=Qe("larger",["typed","config","matrix","DenseMatrix"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.DenseMatrix,a=wn({typed:t}),o=ri({typed:t,DenseMatrix:i}),s=Mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("larger",{"boolean, boolean":function(e,t){return e>t},"number, number":function(e,t){return e>t&&!ue(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gt(t)&&!sr(e,t,r.epsilon)},"Fraction, Fraction":function(e,t){return 1===e.compare(t)},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,t){if(!e.equalBase(t))throw new Error("Cannot compare units with different base");return this(e.value,t.value)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,this)},"Array, Array":function(e,t){return this(n(e),n(t)).valueOf()},"Array, Matrix":function(e,t){return this(n(e),t)},"Matrix, Array":function(e,t){return this(e,n(t))},"SparseMatrix, any":function(e,t){return s(e,t,this,!1)},"DenseMatrix, any":function(e,t){return c(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(t,e,this,!0)},"any, DenseMatrix":function(e,t){return c(t,e,this,!0)},"Array, any":function(e,t){return c(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return c(n(t),e,this,!0).valueOf()}})})),ro=Qe("largerEq",["typed","config","matrix","DenseMatrix"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.DenseMatrix,a=wn({typed:t}),o=ri({typed:t,DenseMatrix:i}),s=Mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("largerEq",{"boolean, boolean":function(e,t){return e>=t},"number, number":function(e,t){return e>=t||ue(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gte(t)||sr(e,t,r.epsilon)},"Fraction, Fraction":function(e,t){return-1!==e.compare(t)},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,t){if(!e.equalBase(t))throw new Error("Cannot compare units with different base");return this(e.value,t.value)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,this)},"Array, Array":function(e,t){return this(n(e),n(t)).valueOf()},"Array, Matrix":function(e,t){return this(n(e),t)},"Matrix, Array":function(e,t){return this(e,n(t))},"SparseMatrix, any":function(e,t){return s(e,t,this,!1)},"DenseMatrix, any":function(e,t){return c(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(t,e,this,!0)},"any, DenseMatrix":function(e,t){return c(t,e,this,!0)},"Array, any":function(e,t){return c(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return c(n(t),e,this,!0).valueOf()}})})),no=Qe("deepEqual",["typed","equal"],(function(e){var t=e.typed,r=e.equal;return t("deepEqual",{"any, any":function(e,t){return function e(t,n){if(Array.isArray(t)){if(Array.isArray(n)){var i=t.length;if(i!==n.length)return!1;for(var a=0;a<i;a++)if(!e(t[a],n[a]))return!1;return!0}return!1}return!Array.isArray(n)&&r(t,n)}(e.valueOf(),t.valueOf())}})})),io=Qe("unequal",["typed","config","equalScalar","matrix","DenseMatrix"],(function(e){var t=e.typed,r=(e.config,e.equalScalar),n=e.matrix,i=e.DenseMatrix,a=wn({typed:t}),o=ri({typed:t,DenseMatrix:i}),s=Mn({typed:t,DenseMatrix:i}),u=hn({typed:t}),c=nn({typed:t});return t("unequal",{"any, any":function(e,t){return null===e?null!==t:null===t?null!==e:void 0===e?void 0!==t:void 0===t?void 0!==e:f(e,t)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,f)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,f,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,f,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,f)},"Array, Array":function(e,t){return this(n(e),n(t)).valueOf()},"Array, Matrix":function(e,t){return this(n(e),t)},"Matrix, Array":function(e,t){return this(e,n(t))},"SparseMatrix, any":function(e,t){return s(e,t,f,!1)},"DenseMatrix, any":function(e,t){return c(e,t,f,!1)},"any, SparseMatrix":function(e,t){return s(t,e,f,!0)},"any, DenseMatrix":function(e,t){return c(t,e,f,!0)},"Array, any":function(e,t){return c(n(e),t,f,!1).valueOf()},"any, Array":function(e,t){return c(n(t),e,f,!0).valueOf()}});function f(e,t){return!r(e,t)}})),ao=(Qe("unequal",["typed","equalScalar"],(function(e){var t=e.typed,r=e.equalScalar;return t("unequal",{"any, any":function(e,t){return null===e?null!==t:null===t?null!==e:void 0===e?void 0!==t:void 0===t?void 0!==e:!r(e,t)}})})),Qe("partitionSelect",["typed","isNumeric","isNaN","compare"],(function(e){var t=e.typed,r=e.isNumeric,n=e.isNaN,i=e.compare,a=i,o=function(e,t){return-i(e,t)};return t("partitionSelect",{"Array | Matrix, number":function(e,t){return s(e,t,a)},"Array | Matrix, number, string":function(e,t,r){if("asc"===r)return s(e,t,a);if("desc"===r)return s(e,t,o);throw new Error('Compare string must be "asc" or "desc"')},"Array | Matrix, number, function":s});function s(e,t,r){if(!Z(t)||t<0)throw new Error("k must be a non-negative integer");if(m(e)){if(e.size().length>1)throw new Error("Only one dimensional matrices supported");return u(e.valueOf(),t,r)}if(Array.isArray(e))return u(e,t,r)}function u(e,t,i){if(t>=e.length)throw new Error("k out of bounds");for(var a=0;a<e.length;a++)if(r(e[a])&&n(e[a]))return e[a];for(var o=0,s=e.length-1;o<s;){for(var u=o,c=s,f=e[Math.floor(Math.random()*(s-o+1))+o];u<c;)if(i(e[u],f)>=0){var l=e[c];e[c]=e[u],e[u]=l,--c}else++u;i(e[u],f)>0&&--u,t<=u?s=u:o=u+1}return e[t]}}))),oo=Qe("sort",["typed","matrix","compare","compareNatural"],(function(e){var t=e.typed,r=e.matrix,n=e.compare,i=e.compareNatural,a=n,o=function(e,t){return-n(e,t)};return t("sort",{Array:function(e){return u(e),e.sort(a)},Matrix:function(e){return c(e),r(e.toArray().sort(a),e.storage())},"Array, function":function(e,t){return u(e),e.sort(t)},"Matrix, function":function(e,t){return c(e),r(e.toArray().sort(t),e.storage())},"Array, string":function(e,t){return u(e),e.sort(s(t))},"Matrix, string":function(e,t){return c(e),r(e.toArray().sort(s(t)),e.storage())}});function s(e){if("asc"===e)return a;if("desc"===e)return o;if("natural"===e)return i;throw new Error('String "asc", "desc", or "natural" expected')}function u(e){if(1!==Se(e).length)throw new Error("One dimensional array expected")}function c(e){if(1!==e.size().length)throw new Error("One dimensional matrix expected")}})),so=Qe("max",["typed","config","numeric","larger"],(function(e){var t=e.typed,r=e.config,n=e.numeric,i=e.larger;return t("max",{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){return Vt(e,t.valueOf(),a)},"...":function(e){if($t(e))throw new TypeError("Scalar values expected in function max");return o(e)}});function a(e,t){try{return i(e,t)?e:t}catch(e){throw ca(e,"max",t)}}function o(e){var t;if(Ht(e,(function(e){try{isNaN(e)&&"number"==typeof e?t=NaN:(void 0===t||i(e,t))&&(t=e)}catch(t){throw ca(t,"max",e)}})),void 0===t)throw new Error("Cannot calculate max of an empty array");return"string"==typeof t&&(t=n(t,r.number)),t}})),uo=Qe("min",["typed","config","numeric","smaller"],(function(e){var t=e.typed,r=e.config,n=e.numeric,i=e.smaller;return t("min",{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){return Vt(e,t.valueOf(),a)},"...":function(e){if($t(e))throw new TypeError("Scalar values expected in function min");return o(e)}});function a(e,t){try{return i(e,t)?e:t}catch(e){throw ca(e,"min",t)}}function o(e){var t;if(Ht(e,(function(e){try{isNaN(e)&&"number"==typeof e?t=NaN:(void 0===t||i(e,t))&&(t=e)}catch(t){throw ca(t,"min",e)}})),void 0===t)throw new Error("Cannot calculate min of an empty array");return"string"==typeof t&&(t=n(t,r.number)),t}})),co=Qe("ImmutableDenseMatrix",["smaller","DenseMatrix"],(function(e){var t=e.smaller,r=e.DenseMatrix;function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!l(t))throw new Error("Invalid datatype: "+t);if(m(e)||p(e)){var i=new r(e,t);this._data=i._data,this._size=i._size,this._datatype=i._datatype,this._min=null,this._max=null}else if(e&&p(e.data)&&p(e.size))this._data=e.data,this._size=e.size,this._datatype=e.datatype,this._min=void 0!==e.min?e.min:null,this._max=void 0!==e.max?e.max:null;else{if(e)throw new TypeError("Unsupported type of data ("+H(e)+")");this._data=[],this._size=[0],this._datatype=t,this._min=null,this._max=null}}return n.prototype=new r,n.prototype.type="ImmutableDenseMatrix",n.prototype.isImmutableDenseMatrix=!0,n.prototype.subset=function(e){switch(arguments.length){case 1:var t=r.prototype.subset.call(this,e);return m(t)?new n({data:t._data,size:t._size,datatype:t._datatype}):t;case 2:case 3:throw new Error("Cannot invoke set subset on an Immutable Matrix instance");default:throw new SyntaxError("Wrong number of arguments")}},n.prototype.set=function(){throw new Error("Cannot invoke set on an Immutable Matrix instance")},n.prototype.resize=function(){throw new Error("Cannot invoke resize on an Immutable Matrix instance")},n.prototype.reshape=function(){throw new Error("Cannot invoke reshape on an Immutable Matrix instance")},n.prototype.clone=function(){return new n({data:He(this._data),size:He(this._size),datatype:this._datatype})},n.prototype.toJSON=function(){return{mathjs:"ImmutableDenseMatrix",data:this._data,size:this._size,datatype:this._datatype}},n.fromJSON=function(e){return new n(e)},n.prototype.swapRows=function(){throw new Error("Cannot invoke swapRows on an Immutable Matrix instance")},n.prototype.min=function(){if(null===this._min){var e=null;this.forEach((function(r){(null===e||t(r,e))&&(e=r)})),this._min=null!==e?e:void 0}return this._min},n.prototype.max=function(){if(null===this._max){var e=null;this.forEach((function(r){(null===e||t(e,r))&&(e=r)})),this._max=null!==e?e:void 0}return this._max},n}),{isClass:!0}),fo=Qe("Index",["ImmutableDenseMatrix"],(function(e){var t=e.ImmutableDenseMatrix;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this._dimensions=[],this._isScalar=!0;for(var t=0,i=arguments.length;t<i;t++){var a=arguments[t];if(y(a))this._dimensions.push(a),this._isScalar=!1;else if(Array.isArray(a)||m(a)){var o=n(a.valueOf());this._dimensions.push(o);var s=o.size();1===s.length&&1===s[0]||(this._isScalar=!1)}else if("number"==typeof a)this._dimensions.push(n([a]));else{if("string"!=typeof a)throw new TypeError("Dimension must be an Array, Matrix, number, string, or Range");this._dimensions.push(a)}}}function n(e){for(var r=0,n=e.length;r<n;r++)if("number"!=typeof e[r]||!Z(e[r]))throw new TypeError("Index parameters must be positive integer numbers");return new t(e)}return r.prototype.type="Index",r.prototype.isIndex=!0,r.prototype.clone=function(){var e=new r;return e._dimensions=He(this._dimensions),e._isScalar=this._isScalar,e},r.create=function(e){var t=new r;return r.apply(t,e),t},r.prototype.size=function(){for(var e=[],t=0,r=this._dimensions.length;t<r;t++){var n=this._dimensions[t];e[t]="string"==typeof n?1:n.size()[0]}return e},r.prototype.max=function(){for(var e=[],t=0,r=this._dimensions.length;t<r;t++){var n=this._dimensions[t];e[t]="string"==typeof n?n:n.max()}return e},r.prototype.min=function(){for(var e=[],t=0,r=this._dimensions.length;t<r;t++){var n=this._dimensions[t];e[t]="string"==typeof n?n:n.min()}return e},r.prototype.forEach=function(e){for(var t=0,r=this._dimensions.length;t<r;t++)e(this._dimensions[t],t,this)},r.prototype.dimension=function(e){return this._dimensions[e]||null},r.prototype.isObjectProperty=function(){return 1===this._dimensions.length&&"string"==typeof this._dimensions[0]},r.prototype.getObjectProperty=function(){return this.isObjectProperty()?this._dimensions[0]:null},r.prototype.isScalar=function(){return this._isScalar},r.prototype.toArray=function(){for(var e=[],t=0,r=this._dimensions.length;t<r;t++){var n=this._dimensions[t];e.push("string"==typeof n?n:n.toArray())}return e},r.prototype.valueOf=r.prototype.toArray,r.prototype.toString=function(){for(var e=[],t=0,r=this._dimensions.length;t<r;t++){var n=this._dimensions[t];"string"==typeof n?e.push(JSON.stringify(n)):e.push(n.toString())}return"["+e.join(", ")+"]"},r.prototype.toJSON=function(){return{mathjs:"Index",dimensions:this._dimensions}},r.fromJSON=function(e){return r.create(e.dimensions)},r}),{isClass:!0}),lo=Qe("FibonacciHeap",["smaller","larger"],(function(e){var t=e.smaller,r=e.larger,n=1/Math.log((1+Math.sqrt(5))/2);function i(){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");this._minimum=null,this._size=0}function a(e,t,r){t.left.right=t.right,t.right.left=t.left,r.degree--,r.child===t&&(r.child=t.right),0===r.degree&&(r.child=null),t.left=e,t.right=e.right,e.right=t,t.right.left=t,t.parent=null,t.mark=!1}i.prototype.type="FibonacciHeap",i.prototype.isFibonacciHeap=!0,i.prototype.insert=function(e,r){var n={key:e,value:r,degree:0};if(this._minimum){var i=this._minimum;n.left=i,n.right=i.right,i.right=n,n.right.left=n,t(e,i.key)&&(this._minimum=n)}else n.left=n,n.right=n,this._minimum=n;return this._size++,n},i.prototype.size=function(){return this._size},i.prototype.clear=function(){this._minimum=null,this._size=0},i.prototype.isEmpty=function(){return 0===this._size},i.prototype.extractMinimum=function(){var e=this._minimum;if(null===e)return e;for(var i=this._minimum,a=e.degree,s=e.child;a>0;){var u=s.right;s.left.right=s.right,s.right.left=s.left,s.left=i,s.right=i.right,i.right=s,s.right.left=s,s.parent=null,s=u,a--}return e.left.right=e.right,e.right.left=e.left,i=e===e.right?null:function(e,i){var a,s=Math.floor(Math.log(i)*n)+1,u=new Array(s),c=0,f=e;if(f)for(c++,f=f.right;f!==e;)c++,f=f.right;for(;c>0;){for(var l=f.degree,p=f.right;a=u[l];){if(r(f.key,a.key)){var m=a;a=f,f=m}o(a,f),u[l]=null,l++}u[l]=f,f=p,c--}e=null;for(var h=0;h<s;h++)(a=u[h])&&(e?(a.left.right=a.right,a.right.left=a.left,a.left=e,a.right=e.right,e.right=a,a.right.left=a,t(a.key,e.key)&&(e=a)):e=a);return e}(i=e.right,this._size),this._size--,this._minimum=i,e},i.prototype.remove=function(e){this._minimum=function(e,r,n){r.key=n;var i=r.parent;i&&t(r.key,i.key)&&(a(e,r,i),function e(t,r){var n=r.parent;if(!n)return;r.mark?(a(t,r,n),e(n)):r.mark=!0}(e,i));t(r.key,e.key)&&(e=r);return e}(this._minimum,e,-1),this.extractMinimum()};var o=function(e,t){e.left.right=e.right,e.right.left=e.left,e.parent=t,t.child?(e.left=t.child,e.right=t.child.right,t.child.right=e,e.right.left=e):(t.child=e,e.right=e,e.left=e),t.degree++,e.mark=!1};return i}),{isClass:!0}),po=Qe("Spa",["addScalar","equalScalar","FibonacciHeap"],(function(e){var t=e.addScalar,r=e.equalScalar,n=e.FibonacciHeap;function i(){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");this._values=[],this._heap=new n}return i.prototype.type="Spa",i.prototype.isSpa=!0,i.prototype.set=function(e,t){if(this._values[e])this._values[e].value=t;else{var r=this._heap.insert(e,t);this._values[e]=r}},i.prototype.get=function(e){var t=this._values[e];return t?t.value:0},i.prototype.accumulate=function(e,r){var n=this._values[e];n?n.value=t(n.value,r):(n=this._heap.insert(e,r),this._values[e]=n)},i.prototype.forEach=function(e,t,n){var i=this._heap,a=this._values,o=[],s=i.extractMinimum();for(s&&o.push(s);s&&s.key<=t;)s.key>=e&&(r(s.value,0)||n(s.key,s.value,this)),(s=i.extractMinimum())&&o.push(s);for(var u=0;u<o.length;u++){var c=o[u];a[(s=i.insert(c.key,c.value)).key]=s}},i.prototype.swap=function(e,t){var r=this._values[e],n=this._values[t];if(!r&&n)r=this._heap.insert(e,n.value),this._heap.remove(n),this._values[e]=r,this._values[t]=void 0;else if(r&&!n)n=this._heap.insert(t,r.value),this._heap.remove(r),this._values[t]=n,this._values[e]=void 0;else if(r&&n){var i=r.value;r.value=n.value,n.value=i}},i}),{isClass:!0}),mo=r(32),ho=r.n(mo),vo=Ni((function(e){return new e(1).exp()}),{hasher:bo}),yo=Ni((function(e){return new e(1).plus(new e(5).sqrt()).div(2)}),{hasher:bo}),go=Ni((function(e){return e.acos(-1)}),{hasher:bo}),xo=Ni((function(e){return go(e).times(2)}),{hasher:bo});function bo(e){return e[0].precision}function wo(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);t&&(n=n.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),r.push.apply(r,n)}return r}function No(e){for(var t=1;t<arguments.length;t++){var r=null!=arguments[t]?arguments[t]:{};t%2?wo(Object(r),!0).forEach((function(t){Ma()(e,t,r[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(r)):wo(Object(r)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(r,t))}))}return e}var Mo=Qe("Unit",["?on","config","addScalar","subtract","multiplyScalar","divideScalar","pow","abs","fix","round","equal","isNumeric","format","number","Complex","BigNumber","Fraction"],(function(e){var t,r,n,i=e.on,o=e.config,s=e.addScalar,c=e.subtract,l=e.multiplyScalar,p=e.divideScalar,m=e.pow,h=e.abs,d=e.fix,v=e.round,y=e.equal,g=e.isNumeric,x=e.format,b=e.number,w=e.Complex,N=e.BigNumber,M=e.Fraction,E=b;function S(e,t){if(!(this instanceof S))throw new Error("Constructor must be called with the new operator");if(null!=e&&!g(e)&&!u(e))throw new TypeError("First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined");if(void 0!==t&&("string"!=typeof t||""===t))throw new TypeError("Second parameter in Unit constructor must be a string");if(void 0!==t){var r=S.parse(t);this.units=r.units,this.dimensions=r.dimensions}else{this.units=[{unit:P,prefix:R.NONE,power:0}],this.dimensions=[];for(var n=0;n<B.length;n++)this.dimensions[n]=0}this.value=null!=e?this._normalize(e):null,this.fixPrefix=!1,this.skipAutomaticSimplification=!0}function A(){for(;" "===n||"\t"===n;)C()}function O(e){return e>="0"&&e<="9"}function C(){r++,n=t.charAt(r)}function _(e){r=e,n=t.charAt(r)}function T(){var e="",t=r;if("+"===n?C():"-"===n&&(e+=n,C()),!function(e){return e>="0"&&e<="9"||"."===e}(n))return _(t),null;if("."===n){if(e+=n,C(),!O(n))return _(t),null}else{for(;O(n);)e+=n,C();"."===n&&(e+=n,C())}for(;O(n);)e+=n,C();if("E"===n||"e"===n){var i="",a=r;if(i+=n,C(),"+"!==n&&"-"!==n||(i+=n,C()),!O(n))return _(a),e;for(e+=i;O(n);)e+=n,C()}return e}function I(){for(var e="";O(n)||S.isValidAlpha(n);)e+=n,C();var t=e.charAt(0);return S.isValidAlpha(t)?e:null}function k(e){return n===e?(C(),e):null}S.prototype.type="Unit",S.prototype.isUnit=!0,S.parse=function(e,i){if(i=i||{},r=-1,n="","string"!=typeof(t=e))throw new TypeError("Invalid argument in Unit.parse, string expected");var a=new S;a.units=[];var s=1,u=!1;C(),A();var c=T(),f=null;if(c){if("BigNumber"===o.number)f=new N(c);else if("Fraction"===o.number)try{f=new M(c)}catch(e){f=parseFloat(c)}else f=parseFloat(c);A(),k("*")?(s=1,u=!0):k("/")&&(s=-1,u=!0)}for(var l=[],p=1;;){for(A();"("===n;)l.push(s),p*=s,s=1,C(),A();var m=void 0;if(!n)break;var h=n;if(null===(m=I()))throw new SyntaxError('Unexpected "'+h+'" in "'+t+'" at index '+r.toString());var d=z(m);if(null===d)throw new SyntaxError('Unit "'+m+'" not found.');var v=s*p;if(A(),k("^")){A();var y=T();if(null===y)throw new SyntaxError('In "'+e+'", "^" must be followed by a floating-point number');v*=y}a.units.push({unit:d.unit,prefix:d.prefix,power:v});for(var g=0;g<B.length;g++)a.dimensions[g]+=(d.unit.dimensions[g]||0)*v;for(A();")"===n;){if(0===l.length)throw new SyntaxError('Unmatched ")" in "'+t+'" at index '+r.toString());p/=l.pop(),C(),A()}if(u=!1,k("*")?(s=1,u=!0):k("/")?(s=-1,u=!0):s=1,d.unit.base){var x=d.unit.base.key;$.auto[x]={unit:d.unit,prefix:d.prefix}}}if(A(),n)throw new SyntaxError('Could not parse: "'+e+'"');if(u)throw new SyntaxError('Trailing characters: "'+e+'"');if(0!==l.length)throw new SyntaxError('Unmatched "(" in "'+t+'"');if(0===a.units.length&&!i.allowNoUnits)throw new SyntaxError('"'+e+'" contains no units');return a.value=void 0!==f?a._normalize(f):null,a},S.prototype.clone=function(){var e=new S;e.fixPrefix=this.fixPrefix,e.skipAutomaticSimplification=this.skipAutomaticSimplification,e.value=He(this.value),e.dimensions=this.dimensions.slice(0),e.units=[];for(var t=0;t<this.units.length;t++)for(var r in e.units[t]={},this.units[t])Je(this.units[t],r)&&(e.units[t][r]=this.units[t][r]);return e},S.prototype._isDerived=function(){return 0!==this.units.length&&(this.units.length>1||Math.abs(this.units[0].power-1)>1e-15)},S.prototype._normalize=function(e){if(null==e||0===this.units.length)return e;for(var t=e,r=S._getNumberConverter(H(e)),n=0;n<this.units.length;n++){var i=r(this.units[n].unit.value),a=r(this.units[n].prefix.value),o=r(this.units[n].power);t=l(t,m(l(i,a),o))}return t},S.prototype._denormalize=function(e,t){if(null==e||0===this.units.length)return e;for(var r=e,n=S._getNumberConverter(H(e)),i=0;i<this.units.length;i++){var a=n(this.units[i].unit.value),o=n(this.units[i].prefix.value),s=n(this.units[i].power);r=p(r,m(l(a,o),s))}return r};var z=Ni((function(e){if(Je(F,e)){var t=F[e];return{unit:t,prefix:t.prefixes[""]}}for(var r in F)if(Je(F,r)&&ge(e,r)){var n=F[r],i=e.length-r.length,a=e.substring(0,i),o=Je(n.prefixes,a)?n.prefixes[a]:void 0;if(void 0!==o)return{unit:n,prefix:o}}return null}),{hasher:function(e){return e[0]},limit:100});function q(e){return e.equalBase(D.NONE)&&null!==e.value&&!o.predictable?e.value:e}S.isValuelessUnit=function(e){return null!==z(e)},S.prototype.hasBase=function(e){if("string"==typeof e&&(e=D[e]),!e)return!1;for(var t=0;t<B.length;t++)if(Math.abs((this.dimensions[t]||0)-(e.dimensions[t]||0))>1e-12)return!1;return!0},S.prototype.equalBase=function(e){for(var t=0;t<B.length;t++)if(Math.abs((this.dimensions[t]||0)-(e.dimensions[t]||0))>1e-12)return!1;return!0},S.prototype.equals=function(e){return this.equalBase(e)&&y(this.value,e.value)},S.prototype.multiply=function(e){for(var t=this.clone(),r=0;r<B.length;r++)t.dimensions[r]=(this.dimensions[r]||0)+(e.dimensions[r]||0);for(var n=0;n<e.units.length;n++){var i=No({},e.units[n]);t.units.push(i)}if(null!==this.value||null!==e.value){var a=null===this.value?this._normalize(1):this.value,o=null===e.value?e._normalize(1):e.value;t.value=l(a,o)}else t.value=null;return t.skipAutomaticSimplification=!1,q(t)},S.prototype.divide=function(e){for(var t=this.clone(),r=0;r<B.length;r++)t.dimensions[r]=(this.dimensions[r]||0)-(e.dimensions[r]||0);for(var n=0;n<e.units.length;n++){var i=No(No({},e.units[n]),{},{power:-e.units[n].power});t.units.push(i)}if(null!==this.value||null!==e.value){var a=null===this.value?this._normalize(1):this.value,o=null===e.value?e._normalize(1):e.value;t.value=p(a,o)}else t.value=null;return t.skipAutomaticSimplification=!1,q(t)},S.prototype.pow=function(e){for(var t=this.clone(),r=0;r<B.length;r++)t.dimensions[r]=(this.dimensions[r]||0)*e;for(var n=0;n<t.units.length;n++)t.units[n].power*=e;return null!==t.value?t.value=m(t.value,e):t.value=null,t.skipAutomaticSimplification=!1,q(t)},S.prototype.abs=function(){var e=this.clone();if(null!==e.value)if(e._isDerived()||0===e.units[0].unit.offset)e.value=h(e.value);else{var t=S._getNumberConverter(H(e.value)),r=t(e.units[0].unit.value),n=t(e.units[0].unit.offset),i=l(r,n);e.value=c(h(s(e.value,i)),i)}for(var a in e.units)"VA"!==e.units[a].unit.name&&"VAR"!==e.units[a].unit.name||(e.units[a].unit=F.W);return e},S.prototype.to=function(e){var t,r=null===this.value?this._normalize(1):this.value;if("string"==typeof e)t=S.parse(e);else{if(!f(e))throw new Error("String or Unit expected as parameter");t=e.clone()}if(!this.equalBase(t))throw new Error("Units do not match ('".concat(t.toString(),"' != '").concat(this.toString(),"')"));if(null!==t.value)throw new Error("Cannot convert to a unit with a value");if(null===this.value||this._isDerived()||this.units[0].unit.offset===t.units[0].unit.offset)t.value=He(r);else{var n=S._getNumberConverter(H(r)),i=n(this.units[0].unit.value),a=n(this.units[0].unit.offset),o=l(i,a),u=n(t.units[0].unit.value),p=n(t.units[0].unit.offset),m=l(u,p);t.value=c(s(r,o),m)}return t.fixPrefix=!0,t.skipAutomaticSimplification=!0,t},S.prototype.toNumber=function(e){return E(this.toNumeric(e))},S.prototype.toNumeric=function(e){var t;return(t=e?this.to(e):this.clone())._isDerived()||0===t.units.length?t._denormalize(t.value):t._denormalize(t.value,t.units[0].prefix.value)},S.prototype.toString=function(){return this.format()},S.prototype.toJSON=function(){return{mathjs:"Unit",value:this._denormalize(this.value),unit:this.formatUnits(),fixPrefix:this.fixPrefix}},S.fromJSON=function(e){var t=new S(e.value,e.unit);return t.fixPrefix=e.fixPrefix||!1,t},S.prototype.valueOf=S.prototype.toString,S.prototype.simplify=function(){var e,t,r=this.clone(),n=[];for(var i in G)if(Je(G,i)&&r.hasBase(D[i])){e=i;break}if("NONE"===e)r.units=[];else if(e&&Je(G,e)&&(t=G[e]),t)r.units=[{unit:t.unit,prefix:t.prefix,power:1}];else{for(var a=!1,o=0;o<B.length;o++){var s=B[o];Math.abs(r.dimensions[o]||0)>1e-12&&(Je(G,s)?n.push({unit:G[s].unit,prefix:G[s].prefix,power:r.dimensions[o]||0}):a=!0)}n.length<r.units.length&&!a&&(r.units=n)}return r},S.prototype.toSI=function(){for(var e=this.clone(),t=[],r=0;r<B.length;r++){var n=B[r];if(Math.abs(e.dimensions[r]||0)>1e-12){if(!Je($.si,n))throw new Error("Cannot express custom unit "+n+" in SI units");t.push({unit:$.si[n].unit,prefix:$.si[n].prefix,power:e.dimensions[r]||0})}}return e.units=t,e.fixPrefix=!0,e.skipAutomaticSimplification=!0,e},S.prototype.formatUnits=function(){for(var e="",t="",r=0,n=0,i=0;i<this.units.length;i++)this.units[i].power>0?(r++,e+=" "+this.units[i].prefix.name+this.units[i].unit.name,Math.abs(this.units[i].power-1)>1e-15&&(e+="^"+this.units[i].power)):this.units[i].power<0&&n++;if(n>0)for(var a=0;a<this.units.length;a++)this.units[a].power<0&&(r>0?(t+=" "+this.units[a].prefix.name+this.units[a].unit.name,Math.abs(this.units[a].power+1)>1e-15&&(t+="^"+-this.units[a].power)):(t+=" "+this.units[a].prefix.name+this.units[a].unit.name,t+="^"+this.units[a].power));e=e.substr(1),t=t.substr(1),r>1&&n>0&&(e="("+e+")"),n>1&&r>0&&(t="("+t+")");var o=e;return r>0&&n>0&&(o+=" / "),o+=t},S.prototype.format=function(e){var t=this.skipAutomaticSimplification||null===this.value?this.clone():this.simplify(),r=!1;for(var n in void 0!==t.value&&null!==t.value&&u(t.value)&&(r=Math.abs(t.value.re)<1e-14),t.units)Je(t.units,n)&&t.units[n].unit&&("VA"===t.units[n].unit.name&&r?t.units[n].unit=F.VAR:"VAR"!==t.units[n].unit.name||r||(t.units[n].unit=F.VA));1!==t.units.length||t.fixPrefix||Math.abs(t.units[0].power-Math.round(t.units[0].power))<1e-14&&(t.units[0].prefix=t._bestPrefix());var i=t._denormalize(t.value),a=null!==t.value?x(i,e||{}):"",o=t.formatUnits();return t.value&&u(t.value)&&(a="("+a+")"),o.length>0&&a.length>0&&(a+=" "),a+=o},S.prototype._bestPrefix=function(){if(1!==this.units.length)throw new Error("Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!");if(Math.abs(this.units[0].power-Math.round(this.units[0].power))>=1e-14)throw new Error("Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!");var e=null!==this.value?h(this.value):0,t=h(this.units[0].unit.value),r=this.units[0].prefix;if(0===e)return r;var n=this.units[0].power,i=Math.log(e/Math.pow(r.value*t,n))/Math.LN10-1.2;if(i>-2.200001&&i<1.800001)return r;i=Math.abs(i);var a=this.units[0].unit.prefixes;for(var o in a)if(Je(a,o)){var s=a[o];if(s.scientific){var u=Math.abs(Math.log(e/Math.pow(s.value*t,n))/Math.LN10-1.2);(u<i||u===i&&s.name.length<r.name.length)&&(r=s,i=u)}}return r},S.prototype.splitUnit=function(e){for(var t=this.clone(),r=[],n=0;n<e.length&&(t=t.to(e[n]),n!==e.length-1);n++){var i=t.toNumeric(),a=v(i),o=new S(y(a,i)?a:d(t.toNumeric()),e[n].toString());r.push(o),t=c(t,o)}for(var u=0,f=0;f<r.length;f++)u=s(u,r[f].value);return y(u,this.value)&&(t.value=0),r.push(t),r};var R={NONE:{"":{name:"",value:1,scientific:!0}},SHORT:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:10,scientific:!1},h:{name:"h",value:100,scientific:!1},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0},d:{name:"d",value:.1,scientific:!1},c:{name:"c",value:.01,scientific:!1},m:{name:"m",value:.001,scientific:!0},u:{name:"u",value:1e-6,scientific:!0},n:{name:"n",value:1e-9,scientific:!0},p:{name:"p",value:1e-12,scientific:!0},f:{name:"f",value:1e-15,scientific:!0},a:{name:"a",value:1e-18,scientific:!0},z:{name:"z",value:1e-21,scientific:!0},y:{name:"y",value:1e-24,scientific:!0}},LONG:{"":{name:"",value:1,scientific:!0},deca:{name:"deca",value:10,scientific:!1},hecto:{name:"hecto",value:100,scientific:!1},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0},deci:{name:"deci",value:.1,scientific:!1},centi:{name:"centi",value:.01,scientific:!1},milli:{name:"milli",value:.001,scientific:!0},micro:{name:"micro",value:1e-6,scientific:!0},nano:{name:"nano",value:1e-9,scientific:!0},pico:{name:"pico",value:1e-12,scientific:!0},femto:{name:"femto",value:1e-15,scientific:!0},atto:{name:"atto",value:1e-18,scientific:!0},zepto:{name:"zepto",value:1e-21,scientific:!0},yocto:{name:"yocto",value:1e-24,scientific:!0}},SQUARED:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:100,scientific:!1},h:{name:"h",value:1e4,scientific:!1},k:{name:"k",value:1e6,scientific:!0},M:{name:"M",value:1e12,scientific:!0},G:{name:"G",value:1e18,scientific:!0},T:{name:"T",value:1e24,scientific:!0},P:{name:"P",value:1e30,scientific:!0},E:{name:"E",value:1e36,scientific:!0},Z:{name:"Z",value:1e42,scientific:!0},Y:{name:"Y",value:1e48,scientific:!0},d:{name:"d",value:.01,scientific:!1},c:{name:"c",value:1e-4,scientific:!1},m:{name:"m",value:1e-6,scientific:!0},u:{name:"u",value:1e-12,scientific:!0},n:{name:"n",value:1e-18,scientific:!0},p:{name:"p",value:1e-24,scientific:!0},f:{name:"f",value:1e-30,scientific:!0},a:{name:"a",value:1e-36,scientific:!0},z:{name:"z",value:1e-42,scientific:!0},y:{name:"y",value:1e-48,scientific:!0}},CUBIC:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:1e3,scientific:!1},h:{name:"h",value:1e6,scientific:!1},k:{name:"k",value:1e9,scientific:!0},M:{name:"M",value:1e18,scientific:!0},G:{name:"G",value:1e27,scientific:!0},T:{name:"T",value:1e36,scientific:!0},P:{name:"P",value:1e45,scientific:!0},E:{name:"E",value:1e54,scientific:!0},Z:{name:"Z",value:1e63,scientific:!0},Y:{name:"Y",value:1e72,scientific:!0},d:{name:"d",value:.001,scientific:!1},c:{name:"c",value:1e-6,scientific:!1},m:{name:"m",value:1e-9,scientific:!0},u:{name:"u",value:1e-18,scientific:!0},n:{name:"n",value:1e-27,scientific:!0},p:{name:"p",value:1e-36,scientific:!0},f:{name:"f",value:1e-45,scientific:!0},a:{name:"a",value:1e-54,scientific:!0},z:{name:"z",value:1e-63,scientific:!0},y:{name:"y",value:1e-72,scientific:!0}},BINARY_SHORT_SI:{"":{name:"",value:1,scientific:!0},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0}},BINARY_SHORT_IEC:{"":{name:"",value:1,scientific:!0},Ki:{name:"Ki",value:1024,scientific:!0},Mi:{name:"Mi",value:Math.pow(1024,2),scientific:!0},Gi:{name:"Gi",value:Math.pow(1024,3),scientific:!0},Ti:{name:"Ti",value:Math.pow(1024,4),scientific:!0},Pi:{name:"Pi",value:Math.pow(1024,5),scientific:!0},Ei:{name:"Ei",value:Math.pow(1024,6),scientific:!0},Zi:{name:"Zi",value:Math.pow(1024,7),scientific:!0},Yi:{name:"Yi",value:Math.pow(1024,8),scientific:!0}},BINARY_LONG_SI:{"":{name:"",value:1,scientific:!0},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0}},BINARY_LONG_IEC:{"":{name:"",value:1,scientific:!0},kibi:{name:"kibi",value:1024,scientific:!0},mebi:{name:"mebi",value:Math.pow(1024,2),scientific:!0},gibi:{name:"gibi",value:Math.pow(1024,3),scientific:!0},tebi:{name:"tebi",value:Math.pow(1024,4),scientific:!0},pebi:{name:"pebi",value:Math.pow(1024,5),scientific:!0},exi:{name:"exi",value:Math.pow(1024,6),scientific:!0},zebi:{name:"zebi",value:Math.pow(1024,7),scientific:!0},yobi:{name:"yobi",value:Math.pow(1024,8),scientific:!0}},BTU:{"":{name:"",value:1,scientific:!0},MM:{name:"MM",value:1e6,scientific:!0}}};R.SHORTLONG=ho()({},R.SHORT,R.LONG),R.BINARY_SHORT=ho()({},R.BINARY_SHORT_SI,R.BINARY_SHORT_IEC),R.BINARY_LONG=ho()({},R.BINARY_LONG_SI,R.BINARY_LONG_IEC);var B=["MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","ANGLE","BIT"],D={NONE:{dimensions:[0,0,0,0,0,0,0,0,0]},MASS:{dimensions:[1,0,0,0,0,0,0,0,0]},LENGTH:{dimensions:[0,1,0,0,0,0,0,0,0]},TIME:{dimensions:[0,0,1,0,0,0,0,0,0]},CURRENT:{dimensions:[0,0,0,1,0,0,0,0,0]},TEMPERATURE:{dimensions:[0,0,0,0,1,0,0,0,0]},LUMINOUS_INTENSITY:{dimensions:[0,0,0,0,0,1,0,0,0]},AMOUNT_OF_SUBSTANCE:{dimensions:[0,0,0,0,0,0,1,0,0]},FORCE:{dimensions:[1,1,-2,0,0,0,0,0,0]},SURFACE:{dimensions:[0,2,0,0,0,0,0,0,0]},VOLUME:{dimensions:[0,3,0,0,0,0,0,0,0]},ENERGY:{dimensions:[1,2,-2,0,0,0,0,0,0]},POWER:{dimensions:[1,2,-3,0,0,0,0,0,0]},PRESSURE:{dimensions:[1,-1,-2,0,0,0,0,0,0]},ELECTRIC_CHARGE:{dimensions:[0,0,1,1,0,0,0,0,0]},ELECTRIC_CAPACITANCE:{dimensions:[-1,-2,4,2,0,0,0,0,0]},ELECTRIC_POTENTIAL:{dimensions:[1,2,-3,-1,0,0,0,0,0]},ELECTRIC_RESISTANCE:{dimensions:[1,2,-3,-2,0,0,0,0,0]},ELECTRIC_INDUCTANCE:{dimensions:[1,2,-2,-2,0,0,0,0,0]},ELECTRIC_CONDUCTANCE:{dimensions:[-1,-2,3,2,0,0,0,0,0]},MAGNETIC_FLUX:{dimensions:[1,2,-2,-1,0,0,0,0,0]},MAGNETIC_FLUX_DENSITY:{dimensions:[1,0,-2,-1,0,0,0,0,0]},FREQUENCY:{dimensions:[0,0,-1,0,0,0,0,0,0]},ANGLE:{dimensions:[0,0,0,0,0,0,0,1,0]},BIT:{dimensions:[0,0,0,0,0,0,0,0,1]}};for(var j in D)Je(D,j)&&(D[j].key=j);var P={name:"",base:{},value:1,offset:0,dimensions:B.map((function(e){return 0}))},F={meter:{name:"meter",base:D.LENGTH,prefixes:R.LONG,value:1,offset:0},inch:{name:"inch",base:D.LENGTH,prefixes:R.NONE,value:.0254,offset:0},foot:{name:"foot",base:D.LENGTH,prefixes:R.NONE,value:.3048,offset:0},yard:{name:"yard",base:D.LENGTH,prefixes:R.NONE,value:.9144,offset:0},mile:{name:"mile",base:D.LENGTH,prefixes:R.NONE,value:1609.344,offset:0},link:{name:"link",base:D.LENGTH,prefixes:R.NONE,value:.201168,offset:0},rod:{name:"rod",base:D.LENGTH,prefixes:R.NONE,value:5.0292,offset:0},chain:{name:"chain",base:D.LENGTH,prefixes:R.NONE,value:20.1168,offset:0},angstrom:{name:"angstrom",base:D.LENGTH,prefixes:R.NONE,value:1e-10,offset:0},m:{name:"m",base:D.LENGTH,prefixes:R.SHORT,value:1,offset:0},in:{name:"in",base:D.LENGTH,prefixes:R.NONE,value:.0254,offset:0},ft:{name:"ft",base:D.LENGTH,prefixes:R.NONE,value:.3048,offset:0},yd:{name:"yd",base:D.LENGTH,prefixes:R.NONE,value:.9144,offset:0},mi:{name:"mi",base:D.LENGTH,prefixes:R.NONE,value:1609.344,offset:0},li:{name:"li",base:D.LENGTH,prefixes:R.NONE,value:.201168,offset:0},rd:{name:"rd",base:D.LENGTH,prefixes:R.NONE,value:5.02921,offset:0},ch:{name:"ch",base:D.LENGTH,prefixes:R.NONE,value:20.1168,offset:0},mil:{name:"mil",base:D.LENGTH,prefixes:R.NONE,value:254e-7,offset:0},m2:{name:"m2",base:D.SURFACE,prefixes:R.SQUARED,value:1,offset:0},sqin:{name:"sqin",base:D.SURFACE,prefixes:R.NONE,value:64516e-8,offset:0},sqft:{name:"sqft",base:D.SURFACE,prefixes:R.NONE,value:.09290304,offset:0},sqyd:{name:"sqyd",base:D.SURFACE,prefixes:R.NONE,value:.83612736,offset:0},sqmi:{name:"sqmi",base:D.SURFACE,prefixes:R.NONE,value:2589988.110336,offset:0},sqrd:{name:"sqrd",base:D.SURFACE,prefixes:R.NONE,value:25.29295,offset:0},sqch:{name:"sqch",base:D.SURFACE,prefixes:R.NONE,value:404.6873,offset:0},sqmil:{name:"sqmil",base:D.SURFACE,prefixes:R.NONE,value:6.4516e-10,offset:0},acre:{name:"acre",base:D.SURFACE,prefixes:R.NONE,value:4046.86,offset:0},hectare:{name:"hectare",base:D.SURFACE,prefixes:R.NONE,value:1e4,offset:0},m3:{name:"m3",base:D.VOLUME,prefixes:R.CUBIC,value:1,offset:0},L:{name:"L",base:D.VOLUME,prefixes:R.SHORT,value:.001,offset:0},l:{name:"l",base:D.VOLUME,prefixes:R.SHORT,value:.001,offset:0},litre:{name:"litre",base:D.VOLUME,prefixes:R.LONG,value:.001,offset:0},cuin:{name:"cuin",base:D.VOLUME,prefixes:R.NONE,value:16387064e-12,offset:0},cuft:{name:"cuft",base:D.VOLUME,prefixes:R.NONE,value:.028316846592,offset:0},cuyd:{name:"cuyd",base:D.VOLUME,prefixes:R.NONE,value:.764554857984,offset:0},teaspoon:{name:"teaspoon",base:D.VOLUME,prefixes:R.NONE,value:5e-6,offset:0},tablespoon:{name:"tablespoon",base:D.VOLUME,prefixes:R.NONE,value:15e-6,offset:0},drop:{name:"drop",base:D.VOLUME,prefixes:R.NONE,value:5e-8,offset:0},gtt:{name:"gtt",base:D.VOLUME,prefixes:R.NONE,value:5e-8,offset:0},minim:{name:"minim",base:D.VOLUME,prefixes:R.NONE,value:6.161152e-8,offset:0},fluiddram:{name:"fluiddram",base:D.VOLUME,prefixes:R.NONE,value:36966911e-13,offset:0},fluidounce:{name:"fluidounce",base:D.VOLUME,prefixes:R.NONE,value:2957353e-11,offset:0},gill:{name:"gill",base:D.VOLUME,prefixes:R.NONE,value:.0001182941,offset:0},cc:{name:"cc",base:D.VOLUME,prefixes:R.NONE,value:1e-6,offset:0},cup:{name:"cup",base:D.VOLUME,prefixes:R.NONE,value:.0002365882,offset:0},pint:{name:"pint",base:D.VOLUME,prefixes:R.NONE,value:.0004731765,offset:0},quart:{name:"quart",base:D.VOLUME,prefixes:R.NONE,value:.0009463529,offset:0},gallon:{name:"gallon",base:D.VOLUME,prefixes:R.NONE,value:.003785412,offset:0},beerbarrel:{name:"beerbarrel",base:D.VOLUME,prefixes:R.NONE,value:.1173478,offset:0},oilbarrel:{name:"oilbarrel",base:D.VOLUME,prefixes:R.NONE,value:.1589873,offset:0},hogshead:{name:"hogshead",base:D.VOLUME,prefixes:R.NONE,value:.238481,offset:0},fldr:{name:"fldr",base:D.VOLUME,prefixes:R.NONE,value:36966911e-13,offset:0},floz:{name:"floz",base:D.VOLUME,prefixes:R.NONE,value:2957353e-11,offset:0},gi:{name:"gi",base:D.VOLUME,prefixes:R.NONE,value:.0001182941,offset:0},cp:{name:"cp",base:D.VOLUME,prefixes:R.NONE,value:.0002365882,offset:0},pt:{name:"pt",base:D.VOLUME,prefixes:R.NONE,value:.0004731765,offset:0},qt:{name:"qt",base:D.VOLUME,prefixes:R.NONE,value:.0009463529,offset:0},gal:{name:"gal",base:D.VOLUME,prefixes:R.NONE,value:.003785412,offset:0},bbl:{name:"bbl",base:D.VOLUME,prefixes:R.NONE,value:.1173478,offset:0},obl:{name:"obl",base:D.VOLUME,prefixes:R.NONE,value:.1589873,offset:0},g:{name:"g",base:D.MASS,prefixes:R.SHORT,value:.001,offset:0},gram:{name:"gram",base:D.MASS,prefixes:R.LONG,value:.001,offset:0},ton:{name:"ton",base:D.MASS,prefixes:R.SHORT,value:907.18474,offset:0},t:{name:"t",base:D.MASS,prefixes:R.SHORT,value:1e3,offset:0},tonne:{name:"tonne",base:D.MASS,prefixes:R.LONG,value:1e3,offset:0},grain:{name:"grain",base:D.MASS,prefixes:R.NONE,value:6479891e-11,offset:0},dram:{name:"dram",base:D.MASS,prefixes:R.NONE,value:.0017718451953125,offset:0},ounce:{name:"ounce",base:D.MASS,prefixes:R.NONE,value:.028349523125,offset:0},poundmass:{name:"poundmass",base:D.MASS,prefixes:R.NONE,value:.45359237,offset:0},hundredweight:{name:"hundredweight",base:D.MASS,prefixes:R.NONE,value:45.359237,offset:0},stick:{name:"stick",base:D.MASS,prefixes:R.NONE,value:.115,offset:0},stone:{name:"stone",base:D.MASS,prefixes:R.NONE,value:6.35029318,offset:0},gr:{name:"gr",base:D.MASS,prefixes:R.NONE,value:6479891e-11,offset:0},dr:{name:"dr",base:D.MASS,prefixes:R.NONE,value:.0017718451953125,offset:0},oz:{name:"oz",base:D.MASS,prefixes:R.NONE,value:.028349523125,offset:0},lbm:{name:"lbm",base:D.MASS,prefixes:R.NONE,value:.45359237,offset:0},cwt:{name:"cwt",base:D.MASS,prefixes:R.NONE,value:45.359237,offset:0},s:{name:"s",base:D.TIME,prefixes:R.SHORT,value:1,offset:0},min:{name:"min",base:D.TIME,prefixes:R.NONE,value:60,offset:0},h:{name:"h",base:D.TIME,prefixes:R.NONE,value:3600,offset:0},second:{name:"second",base:D.TIME,prefixes:R.LONG,value:1,offset:0},sec:{name:"sec",base:D.TIME,prefixes:R.LONG,value:1,offset:0},minute:{name:"minute",base:D.TIME,prefixes:R.NONE,value:60,offset:0},hour:{name:"hour",base:D.TIME,prefixes:R.NONE,value:3600,offset:0},day:{name:"day",base:D.TIME,prefixes:R.NONE,value:86400,offset:0},week:{name:"week",base:D.TIME,prefixes:R.NONE,value:604800,offset:0},month:{name:"month",base:D.TIME,prefixes:R.NONE,value:2629800,offset:0},year:{name:"year",base:D.TIME,prefixes:R.NONE,value:31557600,offset:0},decade:{name:"decade",base:D.TIME,prefixes:R.NONE,value:315576e3,offset:0},century:{name:"century",base:D.TIME,prefixes:R.NONE,value:315576e4,offset:0},millennium:{name:"millennium",base:D.TIME,prefixes:R.NONE,value:315576e5,offset:0},hertz:{name:"Hertz",base:D.FREQUENCY,prefixes:R.LONG,value:1,offset:0,reciprocal:!0},Hz:{name:"Hz",base:D.FREQUENCY,prefixes:R.SHORT,value:1,offset:0,reciprocal:!0},rad:{name:"rad",base:D.ANGLE,prefixes:R.SHORT,value:1,offset:0},radian:{name:"radian",base:D.ANGLE,prefixes:R.LONG,value:1,offset:0},deg:{name:"deg",base:D.ANGLE,prefixes:R.SHORT,value:null,offset:0},degree:{name:"degree",base:D.ANGLE,prefixes:R.LONG,value:null,offset:0},grad:{name:"grad",base:D.ANGLE,prefixes:R.SHORT,value:null,offset:0},gradian:{name:"gradian",base:D.ANGLE,prefixes:R.LONG,value:null,offset:0},cycle:{name:"cycle",base:D.ANGLE,prefixes:R.NONE,value:null,offset:0},arcsec:{name:"arcsec",base:D.ANGLE,prefixes:R.NONE,value:null,offset:0},arcmin:{name:"arcmin",base:D.ANGLE,prefixes:R.NONE,value:null,offset:0},A:{name:"A",base:D.CURRENT,prefixes:R.SHORT,value:1,offset:0},ampere:{name:"ampere",base:D.CURRENT,prefixes:R.LONG,value:1,offset:0},K:{name:"K",base:D.TEMPERATURE,prefixes:R.NONE,value:1,offset:0},degC:{name:"degC",base:D.TEMPERATURE,prefixes:R.NONE,value:1,offset:273.15},degF:{name:"degF",base:D.TEMPERATURE,prefixes:R.NONE,value:1/1.8,offset:459.67},degR:{name:"degR",base:D.TEMPERATURE,prefixes:R.NONE,value:1/1.8,offset:0},kelvin:{name:"kelvin",base:D.TEMPERATURE,prefixes:R.NONE,value:1,offset:0},celsius:{name:"celsius",base:D.TEMPERATURE,prefixes:R.NONE,value:1,offset:273.15},fahrenheit:{name:"fahrenheit",base:D.TEMPERATURE,prefixes:R.NONE,value:1/1.8,offset:459.67},rankine:{name:"rankine",base:D.TEMPERATURE,prefixes:R.NONE,value:1/1.8,offset:0},mol:{name:"mol",base:D.AMOUNT_OF_SUBSTANCE,prefixes:R.SHORT,value:1,offset:0},mole:{name:"mole",base:D.AMOUNT_OF_SUBSTANCE,prefixes:R.LONG,value:1,offset:0},cd:{name:"cd",base:D.LUMINOUS_INTENSITY,prefixes:R.SHORT,value:1,offset:0},candela:{name:"candela",base:D.LUMINOUS_INTENSITY,prefixes:R.LONG,value:1,offset:0},N:{name:"N",base:D.FORCE,prefixes:R.SHORT,value:1,offset:0},newton:{name:"newton",base:D.FORCE,prefixes:R.LONG,value:1,offset:0},dyn:{name:"dyn",base:D.FORCE,prefixes:R.SHORT,value:1e-5,offset:0},dyne:{name:"dyne",base:D.FORCE,prefixes:R.LONG,value:1e-5,offset:0},lbf:{name:"lbf",base:D.FORCE,prefixes:R.NONE,value:4.4482216152605,offset:0},poundforce:{name:"poundforce",base:D.FORCE,prefixes:R.NONE,value:4.4482216152605,offset:0},kip:{name:"kip",base:D.FORCE,prefixes:R.LONG,value:4448.2216,offset:0},kilogramforce:{name:"kilogramforce",base:D.FORCE,prefixes:R.NONE,value:9.80665,offset:0},J:{name:"J",base:D.ENERGY,prefixes:R.SHORT,value:1,offset:0},joule:{name:"joule",base:D.ENERGY,prefixes:R.SHORT,value:1,offset:0},erg:{name:"erg",base:D.ENERGY,prefixes:R.NONE,value:1e-7,offset:0},Wh:{name:"Wh",base:D.ENERGY,prefixes:R.SHORT,value:3600,offset:0},BTU:{name:"BTU",base:D.ENERGY,prefixes:R.BTU,value:1055.05585262,offset:0},eV:{name:"eV",base:D.ENERGY,prefixes:R.SHORT,value:1602176565e-28,offset:0},electronvolt:{name:"electronvolt",base:D.ENERGY,prefixes:R.LONG,value:1602176565e-28,offset:0},W:{name:"W",base:D.POWER,prefixes:R.SHORT,value:1,offset:0},watt:{name:"watt",base:D.POWER,prefixes:R.LONG,value:1,offset:0},hp:{name:"hp",base:D.POWER,prefixes:R.NONE,value:745.6998715386,offset:0},VAR:{name:"VAR",base:D.POWER,prefixes:R.SHORT,value:w.I,offset:0},VA:{name:"VA",base:D.POWER,prefixes:R.SHORT,value:1,offset:0},Pa:{name:"Pa",base:D.PRESSURE,prefixes:R.SHORT,value:1,offset:0},psi:{name:"psi",base:D.PRESSURE,prefixes:R.NONE,value:6894.75729276459,offset:0},atm:{name:"atm",base:D.PRESSURE,prefixes:R.NONE,value:101325,offset:0},bar:{name:"bar",base:D.PRESSURE,prefixes:R.SHORTLONG,value:1e5,offset:0},torr:{name:"torr",base:D.PRESSURE,prefixes:R.NONE,value:133.322,offset:0},mmHg:{name:"mmHg",base:D.PRESSURE,prefixes:R.NONE,value:133.322,offset:0},mmH2O:{name:"mmH2O",base:D.PRESSURE,prefixes:R.NONE,value:9.80665,offset:0},cmH2O:{name:"cmH2O",base:D.PRESSURE,prefixes:R.NONE,value:98.0665,offset:0},coulomb:{name:"coulomb",base:D.ELECTRIC_CHARGE,prefixes:R.LONG,value:1,offset:0},C:{name:"C",base:D.ELECTRIC_CHARGE,prefixes:R.SHORT,value:1,offset:0},farad:{name:"farad",base:D.ELECTRIC_CAPACITANCE,prefixes:R.LONG,value:1,offset:0},F:{name:"F",base:D.ELECTRIC_CAPACITANCE,prefixes:R.SHORT,value:1,offset:0},volt:{name:"volt",base:D.ELECTRIC_POTENTIAL,prefixes:R.LONG,value:1,offset:0},V:{name:"V",base:D.ELECTRIC_POTENTIAL,prefixes:R.SHORT,value:1,offset:0},ohm:{name:"ohm",base:D.ELECTRIC_RESISTANCE,prefixes:R.SHORTLONG,value:1,offset:0},henry:{name:"henry",base:D.ELECTRIC_INDUCTANCE,prefixes:R.LONG,value:1,offset:0},H:{name:"H",base:D.ELECTRIC_INDUCTANCE,prefixes:R.SHORT,value:1,offset:0},siemens:{name:"siemens",base:D.ELECTRIC_CONDUCTANCE,prefixes:R.LONG,value:1,offset:0},S:{name:"S",base:D.ELECTRIC_CONDUCTANCE,prefixes:R.SHORT,value:1,offset:0},weber:{name:"weber",base:D.MAGNETIC_FLUX,prefixes:R.LONG,value:1,offset:0},Wb:{name:"Wb",base:D.MAGNETIC_FLUX,prefixes:R.SHORT,value:1,offset:0},tesla:{name:"tesla",base:D.MAGNETIC_FLUX_DENSITY,prefixes:R.LONG,value:1,offset:0},T:{name:"T",base:D.MAGNETIC_FLUX_DENSITY,prefixes:R.SHORT,value:1,offset:0},b:{name:"b",base:D.BIT,prefixes:R.BINARY_SHORT,value:1,offset:0},bits:{name:"bits",base:D.BIT,prefixes:R.BINARY_LONG,value:1,offset:0},B:{name:"B",base:D.BIT,prefixes:R.BINARY_SHORT,value:8,offset:0},bytes:{name:"bytes",base:D.BIT,prefixes:R.BINARY_LONG,value:8,offset:0}},U={meters:"meter",inches:"inch",feet:"foot",yards:"yard",miles:"mile",links:"link",rods:"rod",chains:"chain",angstroms:"angstrom",lt:"l",litres:"litre",liter:"litre",liters:"litre",teaspoons:"teaspoon",tablespoons:"tablespoon",minims:"minim",fluiddrams:"fluiddram",fluidounces:"fluidounce",gills:"gill",cups:"cup",pints:"pint",quarts:"quart",gallons:"gallon",beerbarrels:"beerbarrel",oilbarrels:"oilbarrel",hogsheads:"hogshead",gtts:"gtt",grams:"gram",tons:"ton",tonnes:"tonne",grains:"grain",drams:"dram",ounces:"ounce",poundmasses:"poundmass",hundredweights:"hundredweight",sticks:"stick",lb:"lbm",lbs:"lbm",kips:"kip",kgf:"kilogramforce",acres:"acre",hectares:"hectare",sqfeet:"sqft",sqyard:"sqyd",sqmile:"sqmi",sqmiles:"sqmi",mmhg:"mmHg",mmh2o:"mmH2O",cmh2o:"cmH2O",seconds:"second",secs:"second",minutes:"minute",mins:"minute",hours:"hour",hr:"hour",hrs:"hour",days:"day",weeks:"week",months:"month",years:"year",decades:"decade",centuries:"century",millennia:"millennium",hertz:"hertz",radians:"radian",degrees:"degree",gradians:"gradian",cycles:"cycle",arcsecond:"arcsec",arcseconds:"arcsec",arcminute:"arcmin",arcminutes:"arcmin",BTUs:"BTU",watts:"watt",joules:"joule",amperes:"ampere",coulombs:"coulomb",volts:"volt",ohms:"ohm",farads:"farad",webers:"weber",teslas:"tesla",electronvolts:"electronvolt",moles:"mole",bit:"bits",byte:"bytes"};function L(e){if("BigNumber"===e.number){var t=go(N);F.rad.value=new N(1),F.deg.value=t.div(180),F.grad.value=t.div(200),F.cycle.value=t.times(2),F.arcsec.value=t.div(648e3),F.arcmin.value=t.div(10800)}else F.rad.value=1,F.deg.value=Math.PI/180,F.grad.value=Math.PI/200,F.cycle.value=2*Math.PI,F.arcsec.value=Math.PI/648e3,F.arcmin.value=Math.PI/10800;F.radian.value=F.rad.value,F.degree.value=F.deg.value,F.gradian.value=F.grad.value}L(o),i&&i("config",(function(e,t){e.number!==t.number&&L(e)}));var $={si:{NONE:{unit:P,prefix:R.NONE[""]},LENGTH:{unit:F.m,prefix:R.SHORT[""]},MASS:{unit:F.g,prefix:R.SHORT.k},TIME:{unit:F.s,prefix:R.SHORT[""]},CURRENT:{unit:F.A,prefix:R.SHORT[""]},TEMPERATURE:{unit:F.K,prefix:R.SHORT[""]},LUMINOUS_INTENSITY:{unit:F.cd,prefix:R.SHORT[""]},AMOUNT_OF_SUBSTANCE:{unit:F.mol,prefix:R.SHORT[""]},ANGLE:{unit:F.rad,prefix:R.SHORT[""]},BIT:{unit:F.bits,prefix:R.SHORT[""]},FORCE:{unit:F.N,prefix:R.SHORT[""]},ENERGY:{unit:F.J,prefix:R.SHORT[""]},POWER:{unit:F.W,prefix:R.SHORT[""]},PRESSURE:{unit:F.Pa,prefix:R.SHORT[""]},ELECTRIC_CHARGE:{unit:F.C,prefix:R.SHORT[""]},ELECTRIC_CAPACITANCE:{unit:F.F,prefix:R.SHORT[""]},ELECTRIC_POTENTIAL:{unit:F.V,prefix:R.SHORT[""]},ELECTRIC_RESISTANCE:{unit:F.ohm,prefix:R.SHORT[""]},ELECTRIC_INDUCTANCE:{unit:F.H,prefix:R.SHORT[""]},ELECTRIC_CONDUCTANCE:{unit:F.S,prefix:R.SHORT[""]},MAGNETIC_FLUX:{unit:F.Wb,prefix:R.SHORT[""]},MAGNETIC_FLUX_DENSITY:{unit:F.T,prefix:R.SHORT[""]},FREQUENCY:{unit:F.Hz,prefix:R.SHORT[""]}}};$.cgs=JSON.parse(JSON.stringify($.si)),$.cgs.LENGTH={unit:F.m,prefix:R.SHORT.c},$.cgs.MASS={unit:F.g,prefix:R.SHORT[""]},$.cgs.FORCE={unit:F.dyn,prefix:R.SHORT[""]},$.cgs.ENERGY={unit:F.erg,prefix:R.NONE[""]},$.us=JSON.parse(JSON.stringify($.si)),$.us.LENGTH={unit:F.ft,prefix:R.NONE[""]},$.us.MASS={unit:F.lbm,prefix:R.NONE[""]},$.us.TEMPERATURE={unit:F.degF,prefix:R.NONE[""]},$.us.FORCE={unit:F.lbf,prefix:R.NONE[""]},$.us.ENERGY={unit:F.BTU,prefix:R.BTU[""]},$.us.POWER={unit:F.hp,prefix:R.NONE[""]},$.us.PRESSURE={unit:F.psi,prefix:R.NONE[""]},$.auto=JSON.parse(JSON.stringify($.si));var G=$.auto;for(var V in S.setUnitSystem=function(e){if(!Je($,e))throw new Error("Unit system "+e+" does not exist. Choices are: "+Object.keys($).join(", "));G=$[e]},S.getUnitSystem=function(){for(var e in $)if(Je($,e)&&$[e]===G)return e},S.typeConverters={BigNumber:function(e){return new N(e+"")},Fraction:function(e){return new M(e)},Complex:function(e){return e},number:function(e){return e}},S._getNumberConverter=function(e){if(!S.typeConverters[e])throw new TypeError('Unsupported type "'+e+'"');return S.typeConverters[e]},F)if(Je(F,V)){var Z=F[V];Z.dimensions=Z.base.dimensions}for(var W in U)if(Je(U,W)){var Y=F[U[W]],J={};for(var X in Y)Je(Y,X)&&(J[X]=Y[X]);J.name=W,F[W]=J}return S.isValidAlpha=function(e){return/^[a-zA-Z]$/.test(e)},S.createUnit=function(e,t){if("object"!==a()(e))throw new TypeError("createUnit expects first parameter to be of type 'Object'");if(t&&t.override)for(var r in e)if(Je(e,r)&&S.deleteUnit(r),e[r].aliases)for(var n=0;n<e[r].aliases.length;n++)S.deleteUnit(e[r].aliases[n]);var i;for(var o in e)Je(e,o)&&(i=S.createUnitSingle(o,e[o]));return i},S.createUnitSingle=function(e,t,r){if(null==t&&(t={}),"string"!=typeof e)throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");if(Je(F,e))throw new Error('Cannot create unit "'+e+'": a unit with that name already exists');!function(e){for(var t=0;t<e.length;t++){if(n=e.charAt(t),0===t&&!S.isValidAlpha(n))throw new Error('Invalid unit name (must begin with alpha character): "'+e+'"');if(t>0&&!S.isValidAlpha(n)&&!O(n))throw new Error('Invalid unit name (only alphanumeric characters are allowed): "'+e+'"')}}(e);var i,o,s,u=null,c=[],f=0;if(t&&"Unit"===t.type)u=t.clone();else if("string"==typeof t)""!==t&&(i=t);else{if("object"!==a()(t))throw new TypeError('Cannot create unit "'+e+'" from "'+t.toString()+'": expecting "string" or "Unit" or "Object"');i=t.definition,o=t.prefixes,f=t.offset,s=t.baseName,t.aliases&&(c=t.aliases.valueOf())}if(c)for(var l=0;l<c.length;l++)if(Je(F,c[l]))throw new Error('Cannot create alias "'+c[l]+'": a unit with that name already exists');if(i&&"string"==typeof i&&!u)try{u=S.parse(i,{allowNoUnits:!0})}catch(t){throw t.message='Could not create unit "'+e+'" from "'+i+'": '+t.message,t}else i&&"Unit"===i.type&&(u=i.clone());c=c||[],f=f||0,o=o&&o.toUpperCase&&R[o.toUpperCase()]||R.NONE;var p={};if(u){p={name:e,value:u.value,dimensions:u.dimensions.slice(0),prefixes:o,offset:f};var m=!1;for(var h in D)if(Je(D,h)){for(var d=!0,v=0;v<B.length;v++)if(Math.abs((p.dimensions[v]||0)-(D[h].dimensions[v]||0))>1e-12){d=!1;break}if(d){m=!0,p.base=D[h];break}}if(!m){s=s||e+"_STUFF";var y={dimensions:u.dimensions.slice(0)};y.key=s,D[s]=y,G[s]={unit:p,prefix:R.NONE[""]},p.base=D[s]}}else{if(s=s||e+"_STUFF",B.indexOf(s)>=0)throw new Error('Cannot create new base unit "'+e+'": a base unit with that name already exists (and cannot be overridden)');for(var g in B.push(s),D)Je(D,g)&&(D[g].dimensions[B.length-1]=0);for(var x={dimensions:[]},b=0;b<B.length;b++)x.dimensions[b]=0;x.dimensions[B.length-1]=1,x.key=s,D[s]=x,p={name:e,value:1,dimensions:D[s].dimensions.slice(0),prefixes:o,offset:f,base:D[s]},G[s]={unit:p,prefix:R.NONE[""]}}S.UNITS[e]=p;for(var w=0;w<c.length;w++){var N=c[w],M={};for(var E in p)Je(p,E)&&(M[E]=p[E]);M.name=N,S.UNITS[N]=M}return delete z.cache,new S(null,e)},S.deleteUnit=function(e){delete S.UNITS[e]},S.PREFIXES=R,S.BASE_DIMENSIONS=B,S.BASE_UNITS=D,S.UNIT_SYSTEMS=$,S.UNITS=F,S}),{isClass:!0}),Eo=Qe("unit",["typed","Unit"],(function(e){var t=e.typed,r=e.Unit;return t("unit",{Unit:function(e){return e.clone()},string:function(e){return r.isValuelessUnit(e)?new r(null,e):r.parse(e,{allowNoUnits:!0})},"number | BigNumber | Fraction | Complex, string":function(e,t){return new r(e,t)},"Array | Matrix":function(e){return Gt(e,this)}})})),So=Qe("sparse",["typed","SparseMatrix"],(function(e){var t=e.typed,r=e.SparseMatrix;return t("sparse",{"":function(){return new r([])},string:function(e){return new r([],e)},"Array | Matrix":function(e){return new r(e)},"Array | Matrix, string":function(e,t){return new r(e,t)}})})),Ao=Qe("createUnit",["typed","Unit"],(function(e){var t=e.typed,r=e.Unit;return t("createUnit",{"Object, Object":function(e,t){return r.createUnit(e,t)},Object:function(e){return r.createUnit(e,{})},"string, Unit | string | Object, Object":function(e,t,n){var i={};return i[e]=t,r.createUnit(i,n)},"string, Unit | string | Object":function(e,t){var n={};return n[e]=t,r.createUnit(n,{})},string:function(e){var t={};return t[e]={},r.createUnit(t,{})}})})),Oo=Qe("acos",["typed","config","Complex"],(function(e){var t=e.typed,r=e.config,n=e.Complex;return t("acos",{number:function(e){return e>=-1&&e<=1||r.predictable?Math.acos(e):new n(e,0).acos()},Complex:function(e){return e.acos()},BigNumber:function(e){return e.acos()},"Array | Matrix":function(e){return Gt(e,this)}})}));function Co(e){return ce(e)}function _o(e){return Math.atan(1/e)}function To(e){return isFinite(e)?(Math.log((e+1)/e)+Math.log(e/(e-1)))/2:0}function Io(e){return Math.asin(1/e)}function ko(e){var t=1/e;return Math.log(t+Math.sqrt(t*t+1))}function zo(e){return Math.acos(1/e)}function qo(e){var t=1/e,r=Math.sqrt(t*t-1);return Math.log(r+t)}function Ro(e){return fe(e)}function Bo(e){return le(e)}function Do(e){return 1/Math.tan(e)}function jo(e){var t=Math.exp(2*e);return(t+1)/(t-1)}function Po(e){return 1/Math.sin(e)}function Fo(e){return 0===e?Number.POSITIVE_INFINITY:Math.abs(2/(Math.exp(e)-Math.exp(-e)))*W(e)}function Uo(e){return 1/Math.cos(e)}function Lo(e){return 2/(Math.exp(e)+Math.exp(-e))}function $o(e){return me(e)}Co.signature="number",_o.signature="number",To.signature="number",Io.signature="number",ko.signature="number",zo.signature="number",qo.signature="number",Ro.signature="number",Bo.signature="number",Do.signature="number",jo.signature="number",Po.signature="number",Fo.signature="number",Uo.signature="number",Lo.signature="number",$o.signature="number";var Ho=Qe("acosh",["typed","config","Complex"],(function(e){var t=e.typed,r=e.config,n=e.Complex;return t("acosh",{number:function(e){return e>=1||r.predictable?Co(e):e<=-1?new n(Math.log(Math.sqrt(e*e-1)-e),Math.PI):new n(e,0).acosh()},Complex:function(e){return e.acosh()},BigNumber:function(e){return e.acosh()},"Array | Matrix":function(e){return Gt(e,this)}})})),Go=Qe("acot",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("acot",{number:_o,Complex:function(e){return e.acot()},BigNumber:function(e){return new r(1).div(e).atan()},"Array | Matrix":function(e){return Gt(e,this)}})})),Vo=Qe("acoth",["typed","config","Complex","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.Complex,i=e.BigNumber;return t("acoth",{number:function(e){return e>=1||e<=-1||r.predictable?To(e):new n(e,0).acoth()},Complex:function(e){return e.acoth()},BigNumber:function(e){return new i(1).div(e).atanh()},"Array | Matrix":function(e){return Gt(e,this)}})})),Zo=Qe("acsc",["typed","config","Complex","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.Complex,i=e.BigNumber;return t("acsc",{number:function(e){return e<=-1||e>=1||r.predictable?Io(e):new n(e,0).acsc()},Complex:function(e){return e.acsc()},BigNumber:function(e){return new i(1).div(e).asin()},"Array | Matrix":function(e){return Gt(e,this)}})})),Wo=Qe("acsch",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("acsch",{number:ko,Complex:function(e){return e.acsch()},BigNumber:function(e){return new r(1).div(e).asinh()},"Array | Matrix":function(e){return Gt(e,this)}})})),Yo=Qe("asec",["typed","config","Complex","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.Complex,i=e.BigNumber;return t("asec",{number:function(e){return e<=-1||e>=1||r.predictable?zo(e):new n(e,0).asec()},Complex:function(e){return e.asec()},BigNumber:function(e){return new i(1).div(e).acos()},"Array | Matrix":function(e){return Gt(e,this)}})})),Jo=Qe("asech",["typed","config","Complex","BigNumber"],(function(e){var t=e.typed,r=e.config,n=e.Complex,i=e.BigNumber;return t("asech",{number:function(e){if(e<=1&&e>=-1||r.predictable){var t=1/e;if(t>0||r.predictable)return qo(e);var i=Math.sqrt(t*t-1);return new n(Math.log(i-t),Math.PI)}return new n(e,0).asech()},Complex:function(e){return e.asech()},BigNumber:function(e){return new i(1).div(e).acosh()},"Array | Matrix":function(e){return Gt(e,this)}})})),Xo=Qe("asin",["typed","config","Complex"],(function(e){var t=e.typed,r=e.config,n=e.Complex;return t("asin",{number:function(e){return e>=-1&&e<=1||r.predictable?Math.asin(e):new n(e,0).asin()},Complex:function(e){return e.asin()},BigNumber:function(e){return e.asin()},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),Qo=Qe("asinh",["typed"],(function(e){return(0,e.typed)("asinh",{number:Ro,Complex:function(e){return e.asinh()},BigNumber:function(e){return e.asinh()},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),Ko=Qe("atan",["typed"],(function(e){return(0,e.typed)("atan",{number:function(e){return Math.atan(e)},Complex:function(e){return e.atan()},BigNumber:function(e){return e.atan()},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),es=Qe("atan2",["typed","matrix","equalScalar","BigNumber","DenseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.equalScalar,i=e.BigNumber,a=e.DenseMatrix,o=vn({typed:t,equalScalar:n}),s=wn({typed:t}),u=Rn({typed:t,equalScalar:n}),c=rn({typed:t,equalScalar:n}),f=Mn({typed:t,DenseMatrix:a}),l=hn({typed:t}),p=nn({typed:t});return t("atan2",{"number, number":Math.atan2,"BigNumber, BigNumber":function(e,t){return i.atan2(e,t)},"SparseMatrix, SparseMatrix":function(e,t){return u(e,t,this,!1)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return s(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,this)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"SparseMatrix, number | BigNumber":function(e,t){return c(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return p(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return f(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return p(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return p(r(e),t,this,!1).valueOf()},"number | BigNumber, Array":function(e,t){return p(r(t),e,this,!0).valueOf()}})})),ts=Qe("atanh",["typed","config","Complex"],(function(e){var t=e.typed,r=e.config,n=e.Complex;return t("atanh",{number:function(e){return e<=1&&e>=-1||r.predictable?Bo(e):new n(e,0).atanh()},Complex:function(e){return e.atanh()},BigNumber:function(e){return e.atanh()},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),rs=Qe("cos",["typed"],(function(e){return(0,e.typed)("cos",{number:Math.cos,Complex:function(e){return e.cos()},BigNumber:function(e){return e.cos()},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cos is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),ns=Qe("cosh",["typed"],(function(e){return(0,e.typed)("cosh",{number:pe,Complex:function(e){return e.cosh()},BigNumber:function(e){return e.cosh()},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cosh is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),is=Qe("cot",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("cot",{number:Do,Complex:function(e){return e.cot()},BigNumber:function(e){return new r(1).div(e.tan())},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cot is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),as=Qe("coth",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("coth",{number:jo,Complex:function(e){return e.coth()},BigNumber:function(e){return new r(1).div(e.tanh())},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function coth is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),os=Qe("csc",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("csc",{number:Po,Complex:function(e){return e.csc()},BigNumber:function(e){return new r(1).div(e.sin())},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function csc is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),ss=Qe("csch",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("csch",{number:Fo,Complex:function(e){return e.csch()},BigNumber:function(e){return new r(1).div(e.sinh())},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function csch is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),us=Qe("sec",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("sec",{number:Uo,Complex:function(e){return e.sec()},BigNumber:function(e){return new r(1).div(e.cos())},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sec is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),cs=Qe("sech",["typed","BigNumber"],(function(e){var t=e.typed,r=e.BigNumber;return t("sech",{number:Lo,Complex:function(e){return e.sech()},BigNumber:function(e){return new r(1).div(e.cosh())},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sech is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this)}})})),fs=Qe("sin",["typed"],(function(e){return(0,e.typed)("sin",{number:Math.sin,Complex:function(e){return e.sin()},BigNumber:function(e){return e.sin()},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sin is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),ls=Qe("sinh",["typed"],(function(e){return(0,e.typed)("sinh",{number:$o,Complex:function(e){return e.sinh()},BigNumber:function(e){return e.sinh()},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sinh is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),ps=Qe("tan",["typed"],(function(e){return(0,e.typed)("tan",{number:Math.tan,Complex:function(e){return e.tan()},BigNumber:function(e){return e.tan()},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function tan is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),ms=Qe("tanh",["typed"],(function(e){return(0,e.typed)("tanh",{number:he,Complex:function(e){return e.tanh()},BigNumber:function(e){return e.tanh()},Unit:function(e){if(!e.hasBase(e.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function tanh is no angle");return this(e.value)},"Array | Matrix":function(e){return Gt(e,this,!0)}})})),hs=Qe("setCartesian",["typed","size","subset","compareNatural","Index","DenseMatrix"],(function(e){var t=e.typed,r=e.size,n=e.subset,i=e.compareNatural,a=e.Index,o=e.DenseMatrix;return t("setCartesian",{"Array | Matrix, Array | Matrix":function(e,t){var s=[];if(0!==n(r(e),new a(0))&&0!==n(r(t),new a(0))){var u=qe(Array.isArray(e)?e:e.toArray()).sort(i),c=qe(Array.isArray(t)?t:t.toArray()).sort(i);s=[];for(var f=0;f<u.length;f++)for(var l=0;l<c.length;l++)s.push([u[f],c[l]])}return Array.isArray(e)&&Array.isArray(t)?s:new o(s)}})})),ds=Qe("setDifference",["typed","size","subset","compareNatural","Index","DenseMatrix"],(function(e){var t=e.typed,r=e.size,n=e.subset,i=e.compareNatural,a=e.Index,o=e.DenseMatrix;return t("setDifference",{"Array | Matrix, Array | Matrix":function(e,t){var s;if(0===n(r(e),new a(0)))s=[];else{if(0===n(r(t),new a(0)))return qe(e.toArray());var u,c=Fe(qe(Array.isArray(e)?e:e.toArray()).sort(i)),f=Fe(qe(Array.isArray(t)?t:t.toArray()).sort(i));s=[];for(var l=0;l<c.length;l++){u=!1;for(var p=0;p<f.length;p++)if(0===i(c[l].value,f[p].value)&&c[l].identifier===f[p].identifier){u=!0;break}u||s.push(c[l])}}return Array.isArray(e)&&Array.isArray(t)?Ue(s):new o(Ue(s))}})})),vs=Qe("setDistinct",["typed","size","subset","compareNatural","Index","DenseMatrix"],(function(e){var t=e.typed,r=e.size,n=e.subset,i=e.compareNatural,a=e.Index,o=e.DenseMatrix;return t("setDistinct",{"Array | Matrix":function(e){var t;if(0===n(r(e),new a(0)))t=[];else{var s=qe(Array.isArray(e)?e:e.toArray()).sort(i);(t=[]).push(s[0]);for(var u=1;u<s.length;u++)0!==i(s[u],s[u-1])&&t.push(s[u])}return Array.isArray(e)?t:new o(t)}})})),ys=Qe("setIntersect",["typed","size","subset","compareNatural","Index","DenseMatrix"],(function(e){var t=e.typed,r=e.size,n=e.subset,i=e.compareNatural,a=e.Index,o=e.DenseMatrix;return t("setIntersect",{"Array | Matrix, Array | Matrix":function(e,t){var s;if(0===n(r(e),new a(0))||0===n(r(t),new a(0)))s=[];else{var u=Fe(qe(Array.isArray(e)?e:e.toArray()).sort(i)),c=Fe(qe(Array.isArray(t)?t:t.toArray()).sort(i));s=[];for(var f=0;f<u.length;f++)for(var l=0;l<c.length;l++)if(0===i(u[f].value,c[l].value)&&u[f].identifier===c[l].identifier){s.push(u[f]);break}}return Array.isArray(e)&&Array.isArray(t)?Ue(s):new o(Ue(s))}})})),gs=Qe("setIsSubset",["typed","size","subset","compareNatural","Index"],(function(e){var t=e.typed,r=e.size,n=e.subset,i=e.compareNatural,a=e.Index;return t("setIsSubset",{"Array | Matrix, Array | Matrix":function(e,t){if(0===n(r(e),new a(0)))return!0;if(0===n(r(t),new a(0)))return!1;for(var o,s=Fe(qe(Array.isArray(e)?e:e.toArray()).sort(i)),u=Fe(qe(Array.isArray(t)?t:t.toArray()).sort(i)),c=0;c<s.length;c++){o=!1;for(var f=0;f<u.length;f++)if(0===i(s[c].value,u[f].value)&&s[c].identifier===u[f].identifier){o=!0;break}if(!1===o)return!1}return!0}})})),xs=Qe("setMultiplicity",["typed","size","subset","compareNatural","Index"],(function(e){var t=e.typed,r=e.size,n=e.subset,i=e.compareNatural,a=e.Index;return t("setMultiplicity",{"number | BigNumber | Fraction | Complex, Array | Matrix":function(e,t){if(0===n(r(t),new a(0)))return 0;for(var o=qe(Array.isArray(t)?t:t.toArray()),s=0,u=0;u<o.length;u++)0===i(o[u],e)&&s++;return s}})})),bs=Qe("setPowerset",["typed","size","subset","compareNatural","Index"],(function(e){var t=e.typed,r=e.size,n=e.subset,i=e.compareNatural,a=e.Index;return t("setPowerset",{"Array | Matrix":function(e){if(0===n(r(e),new a(0)))return[];for(var t=qe(Array.isArray(e)?e:e.toArray()).sort(i),s=[],u=0;u.toString(2).length<=t.length;)s.push(o(t,u.toString(2).split("").reverse())),u++;return function(e){for(var t=[],r=e.length-1;r>0;r--)for(var n=0;n<r;n++)e[n].length>e[n+1].length&&(t=e[n],e[n]=e[n+1],e[n+1]=t);return e}(s)}});function o(e,t){for(var r=[],n=0;n<t.length;n++)"1"===t[n]&&r.push(e[n]);return r}})),ws=Qe("setSize",["typed","compareNatural"],(function(e){var t=e.typed,r=e.compareNatural;return t("setSize",{"Array | Matrix":function(e){return Array.isArray(e)?qe(e).length:qe(e.toArray()).length},"Array | Matrix, boolean":function(e,t){if(!1===t||0===e.length)return Array.isArray(e)?qe(e).length:qe(e.toArray()).length;for(var n=qe(Array.isArray(e)?e:e.toArray()).sort(r),i=1,a=1;a<n.length;a++)0!==r(n[a],n[a-1])&&i++;return i}})})),Ns=Qe("setSymDifference",["typed","size","concat","subset","setDifference","Index"],(function(e){var t=e.typed,r=e.size,n=e.concat,i=e.subset,a=e.setDifference,o=e.Index;return t("setSymDifference",{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(r(e),new o(0)))return qe(t);if(0===i(r(t),new o(0)))return qe(e);var s=qe(e),u=qe(t);return n(a(s,u),a(u,s))}})})),Ms=Qe("setUnion",["typed","size","concat","subset","setIntersect","setSymDifference","Index"],(function(e){var t=e.typed,r=e.size,n=e.concat,i=e.subset,a=e.setIntersect,o=e.setSymDifference,s=e.Index;return t("setUnion",{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(r(e),new s(0)))return qe(t);if(0===i(r(t),new s(0)))return qe(e);var u=qe(e),c=qe(t);return n(o(u,c),a(u,c))}})})),Es=Qe("add",["typed","matrix","addScalar","equalScalar","DenseMatrix","SparseMatrix"],(function(e){var t=e.typed,r=e.matrix,n=e.addScalar,i=e.equalScalar,a=e.DenseMatrix,o=(e.SparseMatrix,ln({typed:t})),s=pn({typed:t,equalScalar:i}),u=mn({typed:t,DenseMatrix:a}),c=hn({typed:t}),f=nn({typed:t});return t("add",Ve({"DenseMatrix, DenseMatrix":function(e,t){return c(e,t,n)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,n,!1)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,n,!0)},"SparseMatrix, SparseMatrix":function(e,t){return s(e,t,n)},"Array, Array":function(e,t){return this(r(e),r(t)).valueOf()},"Array, Matrix":function(e,t){return this(r(e),t)},"Matrix, Array":function(e,t){return this(e,r(t))},"DenseMatrix, any":function(e,t){return f(e,t,n,!1)},"SparseMatrix, any":function(e,t){return u(e,t,n,!1)},"any, DenseMatrix":function(e,t){return f(t,e,n,!0)},"any, SparseMatrix":function(e,t){return u(t,e,n,!0)},"Array, any":function(e,t){return f(r(e),t,n,!1).valueOf()},"any, Array":function(e,t){return f(r(t),e,n,!0).valueOf()},"any, any":n,"any, any, ...any":function(e,t,r){for(var n=this(e,t),i=0;i<r.length;i++)n=this(n,r[i]);return n}},n.signatures))})),Ss=Qe("hypot",["typed","abs","addScalar","divideScalar","multiplyScalar","sqrt","smaller","isPositive"],(function(e){var t=e.typed,r=e.abs,n=e.addScalar,i=e.divideScalar,a=e.multiplyScalar,o=e.sqrt,s=e.smaller,u=e.isPositive;return t("hypot",{"... number | BigNumber":function(e){for(var t=0,c=0,f=0;f<e.length;f++){var l=r(e[f]);s(c,l)?(t=a(t,a(i(c,l),i(c,l))),t=n(t,1),c=l):t=n(t,u(l)?a(i(l,c),i(l,c)):l)}return a(c,o(t))},Array:function(e){return this.apply(this,qe(e))},Matrix:function(e){return this.apply(this,qe(e.toArray()))}})})),As=Qe("norm",["typed","abs","add","pow","conj","sqrt","multiply","equalScalar","larger","smaller","matrix","ctranspose","eigs"],(function(e){var t=e.typed,r=e.abs,n=e.add,i=e.pow,a=e.conj,o=e.sqrt,s=e.multiply,u=e.equalScalar,c=e.larger,f=e.smaller,l=e.matrix,p=e.ctranspose,m=e.eigs;return t("norm",{number:Math.abs,Complex:function(e){return e.abs()},BigNumber:function(e){return e.abs()},boolean:function(e){return Math.abs(e)},Array:function(e){return v(l(e),2)},Matrix:function(e){return v(e,2)},"number | Complex | BigNumber | boolean, number | BigNumber | string":function(e){return this(e)},"Array, number | BigNumber | string":function(e,t){return v(l(e),t)},"Matrix, number | BigNumber | string":function(e,t){return v(e,t)}});function h(e,t){if(t===Number.POSITIVE_INFINITY||"inf"===t)return function(e){var t=0;return e.forEach((function(e){var n=r(e);c(n,t)&&(t=n)}),!0),t}(e);if(t===Number.NEGATIVE_INFINITY||"-inf"===t)return function(e){var t;return e.forEach((function(e){var n=r(e);t&&!f(n,t)||(t=n)}),!0),t||0}(e);if("fro"===t)return v(e,2);if("number"==typeof t&&!isNaN(t)){if(!u(t,0)){var a=0;return e.forEach((function(e){a=n(i(r(e),t),a)}),!0),i(a,1/t)}return Number.POSITIVE_INFINITY}throw new Error("Unsupported parameter value")}function d(e,t){if(1===t)return function(e){var t=[],i=0;return e.forEach((function(e,a){var o=a[1],s=n(t[o]||0,r(e));c(s,i)&&(i=s),t[o]=s}),!0),i}(e);if(t===Number.POSITIVE_INFINITY||"inf"===t)return function(e){var t=[],i=0;return e.forEach((function(e,a){var o=a[0],s=n(t[o]||0,r(e));c(s,i)&&(i=s),t[o]=s}),!0),i}(e);if("fro"===t)return function(e){var t=0;return e.forEach((function(e,r){t=n(t,s(e,a(e)))})),r(o(t))}(e);if(2===t)return function(e){var t=e.size();if(t[0]!==t[1])throw new RangeError("Invalid matrix dimensions");var n=p(e),i=s(n,e),a=m(i).values.toArray(),u=a[a.length-1];return r(o(u))}(e);throw new Error("Unsupported parameter value "+t)}function v(e,t){var r=e.size();if(1===r.length)return h(e,t);if(2===r.length){if(r[0]&&r[1])return d(e,t);throw new RangeError("Invalid matrix dimensions")}}})),Os=Qe("dot",["typed","addScalar","multiplyScalar","conj","size"],(function(e){var t=e.typed,r=e.addScalar,n=e.multiplyScalar,i=e.conj,a=e.size;return t("dot",{"Array | DenseMatrix, Array | DenseMatrix":function(e,a){var u=o(e,a),c=m(e)?e._data:e,f=m(e)?e._datatype:void 0,l=m(a)?a._data:a,p=m(a)?a._datatype:void 0,h=2===s(e).length,d=2===s(a).length,v=r,y=n;if(f&&p&&f===p&&"string"==typeof f){var g=f;v=t.find(r,[g,g]),y=t.find(n,[g,g])}if(!h&&!d){for(var x=y(i(c[0]),l[0]),b=1;b<u;b++)x=v(x,y(i(c[b]),l[b]));return x}if(!h&&d){for(var w=y(i(c[0]),l[0][0]),N=1;N<u;N++)w=v(w,y(i(c[N]),l[N][0]));return w}if(h&&!d){for(var M=y(i(c[0][0]),l[0]),E=1;E<u;E++)M=v(M,y(i(c[E][0]),l[E]));return M}if(h&&d){for(var S=y(i(c[0][0]),l[0][0]),A=1;A<u;A++)S=v(S,y(i(c[A][0]),l[A][0]));return S}},"SparseMatrix, SparseMatrix":function(e,t){o(e,t);var i=e._index,a=e._values,s=t._index,u=t._values,c=0,f=r,l=n,p=0,m=0;for(;p<i.length&&m<s.length;){var h=i[p],d=s[m];h<d?p++:h>d?m++:h===d&&(c=f(c,l(a[p],u[m])),p++,m++)}return c}});function o(e,t){var r,n,i=s(e),a=s(t);if(1===i.length)r=i[0];else{if(2!==i.length||1!==i[1])throw new RangeError("Expected a column vector, instead got a matrix of size ("+i.join(", ")+")");r=i[0]}if(1===a.length)n=a[0];else{if(2!==a.length||1!==a[1])throw new RangeError("Expected a column vector, instead got a matrix of size ("+a.join(", ")+")");n=a[0]}if(r!==n)throw new RangeError("Vectors must have equal length ("+r+" != "+n+")");if(0===r)throw new RangeError("Cannot calculate the dot product of empty vectors");return r}function s(e){return m(e)?e.size():a(e)}})),Cs=Qe("trace",["typed","matrix","add"],(function(e){var t=e.typed,r=e.matrix,n=e.add;return t("trace",{Array:function(e){return i(r(e))},SparseMatrix:function(e){var t=e._values,r=e._index,i=e._ptr,a=e._size,o=a[0],s=a[1];if(o===s){var u=0;if(t.length>0)for(var c=0;c<s;c++)for(var f=i[c],l=i[c+1],p=f;p<l;p++){var m=r[p];if(m===c){u=n(u,t[p]);break}if(m>c)break}return u}throw new RangeError("Matrix must be square (size: "+xe(a)+")")},DenseMatrix:i,any:He});function i(e){var t=e._size,r=e._data;switch(t.length){case 1:if(1===t[0])return He(r[0]);throw new RangeError("Matrix must be square (size: "+xe(t)+")");case 2:var i=t[0];if(i===t[1]){for(var a=0,o=0;o<i;o++)a=n(a,r[o][o]);return a}throw new RangeError("Matrix must be square (size: "+xe(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+xe(t)+")")}}})),_s=Qe("index",["typed","Index"],(function(e){var t=e.typed,r=e.Index;return t("index",{"...number | string | BigNumber | Range | Array | Matrix":function(e){var t=e.map((function(e){return s(e)?e.toNumber():Array.isArray(e)||m(e)?e.map((function(e){return s(e)?e.toNumber():e})):e})),n=new r;return r.apply(n,t),n}})})),Ts=(r(183),new Set(["end"])),Is=Qe("Node",["mathWithTransform"],(function(e){var t=e.mathWithTransform;function r(){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator")}return r.prototype.evaluate=function(e){return this.compile().evaluate(e)},r.prototype.type="Node",r.prototype.isNode=!0,r.prototype.comment="",r.prototype.compile=function(){var e=this._compile(t,{}),r={};return{evaluate:function(t){var n=vt(t);return function(e){for(var t=0,r=ja()(Ts);t<r.length;t++){var n=r[t];if(e.has(n))throw new Error('Scope contains an illegal symbol, "'+n+'" is a reserved keyword')}}(n),e(n,r,null)}}},r.prototype._compile=function(e,t){throw new Error("Method _compile should be implemented by type "+this.type)},r.prototype.forEach=function(e){throw new Error("Cannot run forEach on a Node interface")},r.prototype.map=function(e){throw new Error("Cannot run map on a Node interface")},r.prototype._ifNode=function(e){if(!D(e))throw new TypeError("Callback function must return a Node");return e},r.prototype.traverse=function(e){e(this,null,null),function e(t,r){t.forEach((function(t,n,i){r(t,n,i),e(t,r)}))}(this,e)},r.prototype.transform=function(e){return function t(r,n,i){var a=e(r,n,i);return a!==r?a:r.map(t)}(this,null,null)},r.prototype.filter=function(e){var t=[];return this.traverse((function(r,n,i){e(r,n,i)&&t.push(r)})),t},r.prototype.clone=function(){throw new Error("Cannot clone a Node interface")},r.prototype.cloneDeep=function(){return this.map((function(e){return e.cloneDeep()}))},r.prototype.equals=function(e){return!!e&&Ze(this,e)},r.prototype.toString=function(e){var t=this._getCustomString(e);return void 0!==t?t:this._toString(e)},r.prototype.toJSON=function(){throw new Error("Cannot serialize object: toJSON not implemented by "+this.type)},r.prototype.toHTML=function(e){var t=this._getCustomString(e);return void 0!==t?t:this.toHTML(e)},r.prototype._toString=function(){throw new Error("_toString not implemented for "+this.type)},r.prototype.toTex=function(e){var t=this._getCustomString(e);return void 0!==t?t:this._toTex(e)},r.prototype._toTex=function(e){throw new Error("_toTex not implemented for "+this.type)},r.prototype._getCustomString=function(e){if(e&&"object"===a()(e))switch(a()(e.handler)){case"object":case"undefined":return;case"function":return e.handler(this,e);default:throw new TypeError("Object or function expected as callback")}},r.prototype.getIdentifier=function(){return this.type},r.prototype.getContent=function(){return this},r}),{isClass:!0,isNode:!0});function ks(e){return e&&e.isIndexError?new Ee(e.index+1,e.min+1,void 0!==e.max?e.max+1:void 0):e}function zs(e){var t=e.subset;return function(e,r){try{if(Array.isArray(e))return t(e,r);if(e&&"function"==typeof e.subset)return e.subset(r);if("string"==typeof e)return t(e,r);if("object"===a()(e)){if(!r.isObjectProperty())throw new TypeError("Cannot apply a numeric index as object property");return at(e,r.getObjectProperty())}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw ks(e)}}}var qs=Qe("AccessorNode",["subset","Node"],(function(e){var t=e.subset,r=e.Node,n=zs({subset:t});function i(e,t){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");if(!D(e))throw new TypeError('Node expected for parameter "object"');if(!B(t))throw new TypeError('IndexNode expected for parameter "index"');this.object=e||null,this.index=t,Object.defineProperty(this,"name",{get:function(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():"":this.object.name||""}.bind(this),set:function(){throw new Error("Cannot assign a new name, name is read-only")}})}function a(e){return!(C(e)||_(e)||z(e)||R(e)||j(e)||F(e)||L(e))}return i.prototype=new r,i.prototype.type="AccessorNode",i.prototype.isAccessorNode=!0,i.prototype._compile=function(e,t){var r=this.object._compile(e,t),i=this.index._compile(e,t);if(this.index.isObjectProperty()){var a=this.index.getObjectProperty();return function(e,t,n){return at(r(e,t,n),a)}}return function(e,t,a){var o=r(e,t,a),s=i(e,t,o);return n(o,s)}},i.prototype.forEach=function(e){e(this.object,"object",this),e(this.index,"index",this)},i.prototype.map=function(e){return new i(this._ifNode(e(this.object,"object",this)),this._ifNode(e(this.index,"index",this)))},i.prototype.clone=function(){return new i(this.object,this.index)},i.prototype._toString=function(e){var t=this.object.toString(e);return a(this.object)&&(t="("+t+")"),t+this.index.toString(e)},i.prototype.toHTML=function(e){var t=this.object.toHTML(e);return a(this.object)&&(t='<span class="math-parenthesis math-round-parenthesis">(</span>'+t+'<span class="math-parenthesis math-round-parenthesis">)</span>'),t+this.index.toHTML(e)},i.prototype._toTex=function(e){var t=this.object.toTex(e);return a(this.object)&&(t="\\left(' + object + '\\right)"),t+this.index.toTex(e)},i.prototype.toJSON=function(){return{mathjs:"AccessorNode",object:this.object,index:this.index}},i.fromJSON=function(e){return new i(e.object,e.index)},i}),{isClass:!0,isNode:!0}),Rs=Qe("ArrayNode",["Node"],(function(e){var t=e.Node;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(this.items=e||[],!Array.isArray(this.items)||!this.items.every(D))throw new TypeError("Array containing Nodes expected")}return r.prototype=new t,r.prototype.type="ArrayNode",r.prototype.isArrayNode=!0,r.prototype._compile=function(e,t){var r=Re(this.items,(function(r){return r._compile(e,t)}));if("Array"!==e.config.matrix){var n=e.matrix;return function(e,t,i){return n(Re(r,(function(r){return r(e,t,i)})))}}return function(e,t,n){return Re(r,(function(r){return r(e,t,n)}))}},r.prototype.forEach=function(e){for(var t=0;t<this.items.length;t++){e(this.items[t],"items["+t+"]",this)}},r.prototype.map=function(e){for(var t=[],n=0;n<this.items.length;n++)t[n]=this._ifNode(e(this.items[n],"items["+n+"]",this));return new r(t)},r.prototype.clone=function(){return new r(this.items.slice(0))},r.prototype._toString=function(e){return"["+this.items.map((function(t){return t.toString(e)})).join(", ")+"]"},r.prototype.toJSON=function(){return{mathjs:"ArrayNode",items:this.items}},r.fromJSON=function(e){return new r(e.items)},r.prototype.toHTML=function(e){return'<span class="math-parenthesis math-square-parenthesis">[</span>'+this.items.map((function(t){return t.toHTML(e)})).join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-square-parenthesis">]</span>'},r.prototype._toTex=function(e){return function t(r,n){var i=r.some(_)&&!r.every(_),a=n||i,o=a?"&":"\\\\",s=r.map((function(r){return r.items?t(r.items,!n):r.toTex(e)})).join(o);return i||!a||a&&!n?"\\begin{bmatrix}"+s+"\\end{bmatrix}":s}(this.items,!1)},r}),{isClass:!0,isNode:!0});var Bs=[{AssignmentNode:{},FunctionAssignmentNode:{}},{ConditionalNode:{latexLeftParens:!1,latexRightParens:!1,latexParens:!1}},{"OperatorNode:or":{associativity:"left",associativeWith:[]}},{"OperatorNode:xor":{associativity:"left",associativeWith:[]}},{"OperatorNode:and":{associativity:"left",associativeWith:[]}},{"OperatorNode:bitOr":{associativity:"left",associativeWith:[]}},{"OperatorNode:bitXor":{associativity:"left",associativeWith:[]}},{"OperatorNode:bitAnd":{associativity:"left",associativeWith:[]}},{"OperatorNode:equal":{associativity:"left",associativeWith:[]},"OperatorNode:unequal":{associativity:"left",associativeWith:[]},"OperatorNode:smaller":{associativity:"left",associativeWith:[]},"OperatorNode:larger":{associativity:"left",associativeWith:[]},"OperatorNode:smallerEq":{associativity:"left",associativeWith:[]},"OperatorNode:largerEq":{associativity:"left",associativeWith:[]},RelationalNode:{associativity:"left",associativeWith:[]}},{"OperatorNode:leftShift":{associativity:"left",associativeWith:[]},"OperatorNode:rightArithShift":{associativity:"left",associativeWith:[]},"OperatorNode:rightLogShift":{associativity:"left",associativeWith:[]}},{"OperatorNode:to":{associativity:"left",associativeWith:[]}},{RangeNode:{}},{"OperatorNode:add":{associativity:"left",associativeWith:["OperatorNode:add","OperatorNode:subtract"]},"OperatorNode:subtract":{associativity:"left",associativeWith:[]}},{"OperatorNode:multiply":{associativity:"left",associativeWith:["OperatorNode:multiply","OperatorNode:divide","Operator:dotMultiply","Operator:dotDivide"]},"OperatorNode:divide":{associativity:"left",associativeWith:[],latexLeftParens:!1,latexRightParens:!1,latexParens:!1},"OperatorNode:dotMultiply":{associativity:"left",associativeWith:["OperatorNode:multiply","OperatorNode:divide","OperatorNode:dotMultiply","OperatorNode:doDivide"]},"OperatorNode:dotDivide":{associativity:"left",associativeWith:[]},"OperatorNode:mod":{associativity:"left",associativeWith:[]}},{"OperatorNode:unaryPlus":{associativity:"right"},"OperatorNode:unaryMinus":{associativity:"right"},"OperatorNode:bitNot":{associativity:"right"},"OperatorNode:not":{associativity:"right"}},{"OperatorNode:pow":{associativity:"right",associativeWith:[],latexRightParens:!1},"OperatorNode:dotPow":{associativity:"right",associativeWith:[]}},{"OperatorNode:factorial":{associativity:"left"}},{"OperatorNode:transpose":{associativity:"left"}}];function Ds(e,t){var r=e;"keep"!==t&&(r=e.getContent());for(var n=r.getIdentifier(),i=0;i<Bs.length;i++)if(n in Bs[i])return i;return null}function js(e,t){var r=e;"keep"!==t&&(r=e.getContent());var n=r.getIdentifier(),i=Ds(r,t);if(null===i)return null;var a=Bs[i][n];if(Je(a,"associativity")){if("left"===a.associativity)return"left";if("right"===a.associativity)return"right";throw Error("'"+n+"' has the invalid associativity '"+a.associativity+"'.")}return null}function Ps(e,t,r){var n="keep"!==r?e.getContent():e,i="keep"!==r?e.getContent():t,a=n.getIdentifier(),o=i.getIdentifier(),s=Ds(n,r);if(null===s)return null;var u=Bs[s][a];if(Je(u,"associativeWith")&&u.associativeWith instanceof Array){for(var c=0;c<u.associativeWith.length;c++)if(u.associativeWith[c]===o)return!0;return!1}return null}var Fs=Qe("AssignmentNode",["subset","?matrix","Node"],(function(e){var t=e.subset,r=e.matrix,n=e.Node,i=zs({subset:t}),o=function(e){var t=e.subset,r=e.matrix;return function(e,n,i){try{if(Array.isArray(e))return r(e).subset(n,i).valueOf();if(e&&"function"==typeof e.subset)return e.subset(n,i);if("string"==typeof e)return t(e,n,i);if("object"===a()(e)){if(!n.isObjectProperty())throw TypeError("Cannot apply a numeric index as object property");return ot(e,n.getObjectProperty(),i),e}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw ks(e)}}}({subset:t,matrix:r});function s(e,t,r){if(!(this instanceof s))throw new SyntaxError("Constructor must be called with the new operator");if(this.object=e,this.index=r?t:null,this.value=r||t,!L(e)&&!C(e))throw new TypeError('SymbolNode or AccessorNode expected as "object"');if(L(e)&&"end"===e.name)throw new Error('Cannot assign to symbol "end"');if(this.index&&!B(this.index))throw new TypeError('IndexNode expected as "index"');if(!D(this.value))throw new TypeError('Node expected as "value"');Object.defineProperty(this,"name",{get:function(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():"":this.object.name||""}.bind(this),set:function(){throw new Error("Cannot assign a new name, name is read-only")}})}function u(e,t){t||(t="keep");var r=Ds(e,t),n=Ds(e.value,t);return"all"===t||null!==n&&n<=r}return s.prototype=new n,s.prototype.type="AssignmentNode",s.prototype.isAssignmentNode=!0,s.prototype._compile=function(e,t){var r=this.object._compile(e,t),n=this.index?this.index._compile(e,t):null,a=this.value._compile(e,t),s=this.object.name;if(this.index){if(this.index.isObjectProperty()){var u=this.index.getObjectProperty();return function(e,t,n){var i=r(e,t,n),o=a(e,t,n);return ot(i,u,o),o}}if(L(this.object))return function(e,t,i){var u=r(e,t,i),c=a(e,t,i),f=n(e,t,u);return e.set(s,o(u,f,c)),c};var c=this.object.object._compile(e,t);if(this.object.index.isObjectProperty()){var f=this.object.index.getObjectProperty();return function(e,t,r){var i=c(e,t,r),s=at(i,f),u=n(e,t,s),l=a(e,t,r);return ot(i,f,o(s,u,l)),l}}var l=this.object.index._compile(e,t);return function(e,t,r){var s=c(e,t,r),u=l(e,t,s),f=i(s,u),p=n(e,t,f),m=a(e,t,r);return o(s,u,o(f,p,m)),m}}if(!L(this.object))throw new TypeError("SymbolNode expected as object");return function(e,t,r){var n=a(e,t,r);return e.set(s,n),n}},s.prototype.forEach=function(e){e(this.object,"object",this),this.index&&e(this.index,"index",this),e(this.value,"value",this)},s.prototype.map=function(e){return new s(this._ifNode(e(this.object,"object",this)),this.index?this._ifNode(e(this.index,"index",this)):null,this._ifNode(e(this.value,"value",this)))},s.prototype.clone=function(){return new s(this.object,this.index,this.value)},s.prototype._toString=function(e){var t=this.object.toString(e),r=this.index?this.index.toString(e):"",n=this.value.toString(e);return u(this,e&&e.parenthesis)&&(n="("+n+")"),t+r+" = "+n},s.prototype.toJSON=function(){return{mathjs:"AssignmentNode",object:this.object,index:this.index,value:this.value}},s.fromJSON=function(e){return new s(e.object,e.index,e.value)},s.prototype.toHTML=function(e){var t=this.object.toHTML(e),r=this.index?this.index.toHTML(e):"",n=this.value.toHTML(e);return u(this,e&&e.parenthesis)&&(n='<span class="math-paranthesis math-round-parenthesis">(</span>'+n+'<span class="math-paranthesis math-round-parenthesis">)</span>'),t+r+'<span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>'+n},s.prototype._toTex=function(e){var t=this.object.toTex(e),r=this.index?this.index.toTex(e):"",n=this.value.toTex(e);return u(this,e&&e.parenthesis)&&(n="\\left(".concat(n,"\\right)")),t+r+":="+n},s}),{isClass:!0,isNode:!0}),Us=Qe("BlockNode",["ResultSet","Node"],(function(e){var t=e.ResultSet,r=e.Node;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!Array.isArray(e))throw new Error("Array expected");this.blocks=e.map((function(e){var t=e&&e.node,r=!e||void 0===e.visible||e.visible;if(!D(t))throw new TypeError('Property "node" must be a Node');if("boolean"!=typeof r)throw new TypeError('Property "visible" must be a boolean');return{node:t,visible:r}}))}return n.prototype=new r,n.prototype.type="BlockNode",n.prototype.isBlockNode=!0,n.prototype._compile=function(e,r){var n=Re(this.blocks,(function(t){return{evaluate:t.node._compile(e,r),visible:t.visible}}));return function(e,r,i){var a=[];return Be(n,(function(t){var n=t.evaluate(e,r,i);t.visible&&a.push(n)})),new t(a)}},n.prototype.forEach=function(e){for(var t=0;t<this.blocks.length;t++)e(this.blocks[t].node,"blocks["+t+"].node",this)},n.prototype.map=function(e){for(var t=[],r=0;r<this.blocks.length;r++){var i=this.blocks[r],a=this._ifNode(e(i.node,"blocks["+r+"].node",this));t[r]={node:a,visible:i.visible}}return new n(t)},n.prototype.clone=function(){return new n(this.blocks.map((function(e){return{node:e.node,visible:e.visible}})))},n.prototype._toString=function(e){return this.blocks.map((function(t){return t.node.toString(e)+(t.visible?"":";")})).join("\n")},n.prototype.toJSON=function(){return{mathjs:"BlockNode",blocks:this.blocks}},n.fromJSON=function(e){return new n(e.blocks)},n.prototype.toHTML=function(e){return this.blocks.map((function(t){return t.node.toHTML(e)+(t.visible?"":'<span class="math-separator">;</span>')})).join('<span class="math-separator"><br /></span>')},n.prototype._toTex=function(e){return this.blocks.map((function(t){return t.node.toTex(e)+(t.visible?"":";")})).join("\\;\\;\n")},n}),{isClass:!0,isNode:!0}),Ls=Qe("ConditionalNode",["Node"],(function(e){var t=e.Node;function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!D(e))throw new TypeError("Parameter condition must be a Node");if(!D(t))throw new TypeError("Parameter trueExpr must be a Node");if(!D(n))throw new TypeError("Parameter falseExpr must be a Node");this.condition=e,this.trueExpr=t,this.falseExpr=n}return r.prototype=new t,r.prototype.type="ConditionalNode",r.prototype.isConditionalNode=!0,r.prototype._compile=function(e,t){var r=this.condition._compile(e,t),n=this.trueExpr._compile(e,t),i=this.falseExpr._compile(e,t);return function(e,t,a){return function(e){if("number"==typeof e||"boolean"==typeof e||"string"==typeof e)return!!e;if(e){if(s(e))return!e.isZero();if(u(e))return!(!e.re&&!e.im);if(f(e))return!!e.value}if(null==e)return!1;throw new TypeError('Unsupported type of condition "'+H(e)+'"')}(r(e,t,a))?n(e,t,a):i(e,t,a)}},r.prototype.forEach=function(e){e(this.condition,"condition",this),e(this.trueExpr,"trueExpr",this),e(this.falseExpr,"falseExpr",this)},r.prototype.map=function(e){return new r(this._ifNode(e(this.condition,"condition",this)),this._ifNode(e(this.trueExpr,"trueExpr",this)),this._ifNode(e(this.falseExpr,"falseExpr",this)))},r.prototype.clone=function(){return new r(this.condition,this.trueExpr,this.falseExpr)},r.prototype._toString=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=Ds(this,t),n=this.condition.toString(e),i=Ds(this.condition,t);("all"===t||"OperatorNode"===this.condition.type||null!==i&&i<=r)&&(n="("+n+")");var a=this.trueExpr.toString(e),o=Ds(this.trueExpr,t);("all"===t||"OperatorNode"===this.trueExpr.type||null!==o&&o<=r)&&(a="("+a+")");var s=this.falseExpr.toString(e),u=Ds(this.falseExpr,t);return("all"===t||"OperatorNode"===this.falseExpr.type||null!==u&&u<=r)&&(s="("+s+")"),n+" ? "+a+" : "+s},r.prototype.toJSON=function(){return{mathjs:"ConditionalNode",condition:this.condition,trueExpr:this.trueExpr,falseExpr:this.falseExpr}},r.fromJSON=function(e){return new r(e.condition,e.trueExpr,e.falseExpr)},r.prototype.toHTML=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=Ds(this,t),n=this.condition.toHTML(e),i=Ds(this.condition,t);("all"===t||"OperatorNode"===this.condition.type||null!==i&&i<=r)&&(n='<span class="math-parenthesis math-round-parenthesis">(</span>'+n+'<span class="math-parenthesis math-round-parenthesis">)</span>');var a=this.trueExpr.toHTML(e),o=Ds(this.trueExpr,t);("all"===t||"OperatorNode"===this.trueExpr.type||null!==o&&o<=r)&&(a='<span class="math-parenthesis math-round-parenthesis">(</span>'+a+'<span class="math-parenthesis math-round-parenthesis">)</span>');var s=this.falseExpr.toHTML(e),u=Ds(this.falseExpr,t);return("all"===t||"OperatorNode"===this.falseExpr.type||null!==u&&u<=r)&&(s='<span class="math-parenthesis math-round-parenthesis">(</span>'+s+'<span class="math-parenthesis math-round-parenthesis">)</span>'),n+'<span class="math-operator math-conditional-operator">?</span>'+a+'<span class="math-operator math-conditional-operator">:</span>'+s},r.prototype._toTex=function(e){return"\\begin{cases} {"+this.trueExpr.toTex(e)+"}, &\\quad{\\text{if }\\;"+this.condition.toTex(e)+"}\\\\{"+this.falseExpr.toTex(e)+"}, &\\quad{\\text{otherwise}}\\end{cases}"},r}),{isClass:!0,isNode:!0}),$s=r(187),Hs=r.n($s),Gs={Alpha:"A",alpha:"\\alpha",Beta:"B",beta:"\\beta",Gamma:"\\Gamma",gamma:"\\gamma",Delta:"\\Delta",delta:"\\delta",Epsilon:"E",epsilon:"\\epsilon",varepsilon:"\\varepsilon",Zeta:"Z",zeta:"\\zeta",Eta:"H",eta:"\\eta",Theta:"\\Theta",theta:"\\theta",vartheta:"\\vartheta",Iota:"I",iota:"\\iota",Kappa:"K",kappa:"\\kappa",varkappa:"\\varkappa",Lambda:"\\Lambda",lambda:"\\lambda",Mu:"M",mu:"\\mu",Nu:"N",nu:"\\nu",Xi:"\\Xi",xi:"\\xi",Omicron:"O",omicron:"o",Pi:"\\Pi",pi:"\\pi",varpi:"\\varpi",Rho:"P",rho:"\\rho",varrho:"\\varrho",Sigma:"\\Sigma",sigma:"\\sigma",varsigma:"\\varsigma",Tau:"T",tau:"\\tau",Upsilon:"\\Upsilon",upsilon:"\\upsilon",Phi:"\\Phi",phi:"\\phi",varphi:"\\varphi",Chi:"X",chi:"\\chi",Psi:"\\Psi",psi:"\\psi",Omega:"\\Omega",omega:"\\omega",true:"\\mathrm{True}",false:"\\mathrm{False}",i:"i",inf:"\\infty",Inf:"\\infty",infinity:"\\infty",Infinity:"\\infty",oo:"\\infty",lim:"\\lim",undefined:"\\mathbf{?}"},Vs={transpose:"^\\top",ctranspose:"^H",factorial:"!",pow:"^",dotPow:".^\\wedge",unaryPlus:"+",unaryMinus:"-",bitNot:"\\~",not:"\\neg",multiply:"\\cdot",divide:"\\frac",dotMultiply:".\\cdot",dotDivide:".:",mod:"\\mod",add:"+",subtract:"-",to:"\\rightarrow",leftShift:"<<",rightArithShift:">>",rightLogShift:">>>",equal:"=",unequal:"\\neq",smaller:"<",larger:">",smallerEq:"\\leq",largerEq:"\\geq",bitAnd:"\\&",bitXor:"\\underline{|}",bitOr:"|",and:"\\wedge",xor:"\\veebar",or:"\\vee"},Zs={abs:{1:"\\left|${args[0]}\\right|"},add:{2:"\\left(${args[0]}".concat(Vs.add,"${args[1]}\\right)")},cbrt:{1:"\\sqrt[3]{${args[0]}}"},ceil:{1:"\\left\\lceil${args[0]}\\right\\rceil"},cube:{1:"\\left(${args[0]}\\right)^3"},divide:{2:"\\frac{${args[0]}}{${args[1]}}"},dotDivide:{2:"\\left(${args[0]}".concat(Vs.dotDivide,"${args[1]}\\right)")},dotMultiply:{2:"\\left(${args[0]}".concat(Vs.dotMultiply,"${args[1]}\\right)")},dotPow:{2:"\\left(${args[0]}".concat(Vs.dotPow,"${args[1]}\\right)")},exp:{1:"\\exp\\left(${args[0]}\\right)"},expm1:"\\left(e".concat(Vs.pow,"{${args[0]}}-1\\right)"),fix:{1:"\\mathrm{${name}}\\left(${args[0]}\\right)"},floor:{1:"\\left\\lfloor${args[0]}\\right\\rfloor"},gcd:"\\gcd\\left(${args}\\right)",hypot:"\\hypot\\left(${args}\\right)",log:{1:"\\ln\\left(${args[0]}\\right)",2:"\\log_{${args[1]}}\\left(${args[0]}\\right)"},log10:{1:"\\log_{10}\\left(${args[0]}\\right)"},log1p:{1:"\\ln\\left(${args[0]}+1\\right)",2:"\\log_{${args[1]}}\\left(${args[0]}+1\\right)"},log2:"\\log_{2}\\left(${args[0]}\\right)",mod:{2:"\\left(${args[0]}".concat(Vs.mod,"${args[1]}\\right)")},multiply:{2:"\\left(${args[0]}".concat(Vs.multiply,"${args[1]}\\right)")},norm:{1:"\\left\\|${args[0]}\\right\\|",2:void 0},nthRoot:{2:"\\sqrt[${args[1]}]{${args[0]}}"},nthRoots:{2:"\\{y : $y^{args[1]} = {${args[0]}}\\}"},pow:{2:"\\left(${args[0]}\\right)".concat(Vs.pow,"{${args[1]}}")},round:{1:"\\left\\lfloor${args[0]}\\right\\rceil",2:void 0},sign:{1:"\\mathrm{${name}}\\left(${args[0]}\\right)"},sqrt:{1:"\\sqrt{${args[0]}}"},square:{1:"\\left(${args[0]}\\right)^2"},subtract:{2:"\\left(${args[0]}".concat(Vs.subtract,"${args[1]}\\right)")},unaryMinus:{1:"".concat(Vs.unaryMinus,"\\left(${args[0]}\\right)")},unaryPlus:{1:"".concat(Vs.unaryPlus,"\\left(${args[0]}\\right)")},bitAnd:{2:"\\left(${args[0]}".concat(Vs.bitAnd,"${args[1]}\\right)")},bitNot:{1:Vs.bitNot+"\\left(${args[0]}\\right)"},bitOr:{2:"\\left(${args[0]}".concat(Vs.bitOr,"${args[1]}\\right)")},bitXor:{2:"\\left(${args[0]}".concat(Vs.bitXor,"${args[1]}\\right)")},leftShift:{2:"\\left(${args[0]}".concat(Vs.leftShift,"${args[1]}\\right)")},rightArithShift:{2:"\\left(${args[0]}".concat(Vs.rightArithShift,"${args[1]}\\right)")},rightLogShift:{2:"\\left(${args[0]}".concat(Vs.rightLogShift,"${args[1]}\\right)")},bellNumbers:{1:"\\mathrm{B}_{${args[0]}}"},catalan:{1:"\\mathrm{C}_{${args[0]}}"},stirlingS2:{2:"\\mathrm{S}\\left(${args}\\right)"},arg:{1:"\\arg\\left(${args[0]}\\right)"},conj:{1:"\\left(${args[0]}\\right)^*"},im:{1:"\\Im\\left\\lbrace${args[0]}\\right\\rbrace"},re:{1:"\\Re\\left\\lbrace${args[0]}\\right\\rbrace"},and:{2:"\\left(${args[0]}".concat(Vs.and,"${args[1]}\\right)")},not:{1:Vs.not+"\\left(${args[0]}\\right)"},or:{2:"\\left(${args[0]}".concat(Vs.or,"${args[1]}\\right)")},xor:{2:"\\left(${args[0]}".concat(Vs.xor,"${args[1]}\\right)")},cross:{2:"\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)"},ctranspose:{1:"\\left(${args[0]}\\right)".concat(Vs.ctranspose)},det:{1:"\\det\\left(${args[0]}\\right)"},dot:{2:"\\left(${args[0]}\\cdot${args[1]}\\right)"},expm:{1:"\\exp\\left(${args[0]}\\right)"},inv:{1:"\\left(${args[0]}\\right)^{-1}"},sqrtm:{1:"{${args[0]}}".concat(Vs.pow,"{\\frac{1}{2}}")},trace:{1:"\\mathrm{tr}\\left(${args[0]}\\right)"},transpose:{1:"\\left(${args[0]}\\right)".concat(Vs.transpose)},combinations:{2:"\\binom{${args[0]}}{${args[1]}}"},combinationsWithRep:{2:"\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)"},factorial:{1:"\\left(${args[0]}\\right)".concat(Vs.factorial)},gamma:{1:"\\Gamma\\left(${args[0]}\\right)"},equal:{2:"\\left(${args[0]}".concat(Vs.equal,"${args[1]}\\right)")},larger:{2:"\\left(${args[0]}".concat(Vs.larger,"${args[1]}\\right)")},largerEq:{2:"\\left(${args[0]}".concat(Vs.largerEq,"${args[1]}\\right)")},smaller:{2:"\\left(${args[0]}".concat(Vs.smaller,"${args[1]}\\right)")},smallerEq:{2:"\\left(${args[0]}".concat(Vs.smallerEq,"${args[1]}\\right)")},unequal:{2:"\\left(${args[0]}".concat(Vs.unequal,"${args[1]}\\right)")},erf:{1:"erf\\left(${args[0]}\\right)"},max:"\\max\\left(${args}\\right)",min:"\\min\\left(${args}\\right)",variance:"\\mathrm{Var}\\left(${args}\\right)",acos:{1:"\\cos^{-1}\\left(${args[0]}\\right)"},acosh:{1:"\\cosh^{-1}\\left(${args[0]}\\right)"},acot:{1:"\\cot^{-1}\\left(${args[0]}\\right)"},acoth:{1:"\\coth^{-1}\\left(${args[0]}\\right)"},acsc:{1:"\\csc^{-1}\\left(${args[0]}\\right)"},acsch:{1:"\\mathrm{csch}^{-1}\\left(${args[0]}\\right)"},asec:{1:"\\sec^{-1}\\left(${args[0]}\\right)"},asech:{1:"\\mathrm{sech}^{-1}\\left(${args[0]}\\right)"},asin:{1:"\\sin^{-1}\\left(${args[0]}\\right)"},asinh:{1:"\\sinh^{-1}\\left(${args[0]}\\right)"},atan:{1:"\\tan^{-1}\\left(${args[0]}\\right)"},atan2:{2:"\\mathrm{atan2}\\left(${args}\\right)"},atanh:{1:"\\tanh^{-1}\\left(${args[0]}\\right)"},cos:{1:"\\cos\\left(${args[0]}\\right)"},cosh:{1:"\\cosh\\left(${args[0]}\\right)"},cot:{1:"\\cot\\left(${args[0]}\\right)"},coth:{1:"\\coth\\left(${args[0]}\\right)"},csc:{1:"\\csc\\left(${args[0]}\\right)"},csch:{1:"\\mathrm{csch}\\left(${args[0]}\\right)"},sec:{1:"\\sec\\left(${args[0]}\\right)"},sech:{1:"\\mathrm{sech}\\left(${args[0]}\\right)"},sin:{1:"\\sin\\left(${args[0]}\\right)"},sinh:{1:"\\sinh\\left(${args[0]}\\right)"},tan:{1:"\\tan\\left(${args[0]}\\right)"},tanh:{1:"\\tanh\\left(${args[0]}\\right)"},to:{2:"\\left(${args[0]}".concat(Vs.to,"${args[1]}\\right)")},numeric:function(e,t){return e.args[0].toTex()},number:{0:"0",1:"\\left(${args[0]}\\right)",2:"\\left(\\left(${args[0]}\\right)${args[1]}\\right)"},string:{0:'\\mathtt{""}',1:"\\mathrm{string}\\left(${args[0]}\\right)"},bignumber:{0:"0",1:"\\left(${args[0]}\\right)"},complex:{0:"0",1:"\\left(${args[0]}\\right)",2:"\\left(\\left(${args[0]}\\right)+".concat(Gs.i,"\\cdot\\left(${args[1]}\\right)\\right)")},matrix:{0:"\\begin{bmatrix}\\end{bmatrix}",1:"\\left(${args[0]}\\right)",2:"\\left(${args[0]}\\right)"},sparse:{0:"\\begin{bsparse}\\end{bsparse}",1:"\\left(${args[0]}\\right)"},unit:{1:"\\left(${args[0]}\\right)",2:"\\left(\\left(${args[0]}\\right)${args[1]}\\right)"}},Ws={deg:"^\\circ"};function Ys(e){return Hs()(e,{preserveFormatting:!0})}function Js(e,t){return(t=void 0!==t&&t)?Je(Ws,e)?Ws[e]:"\\mathrm{"+Ys(e)+"}":Je(Gs,e)?Gs[e]:Ys(e)}var Xs=Qe("ConstantNode",["Node"],(function(e){var t=e.Node;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.value=e}return r.prototype=new t,r.prototype.type="ConstantNode",r.prototype.isConstantNode=!0,r.prototype._compile=function(e,t){var r=this.value;return function(){return r}},r.prototype.forEach=function(e){},r.prototype.map=function(e){return this.clone()},r.prototype.clone=function(){return new r(this.value)},r.prototype._toString=function(e){return xe(this.value,e)},r.prototype.toHTML=function(e){var t=this._toString(e);switch(H(this.value)){case"number":case"BigNumber":case"Fraction":return'<span class="math-number">'+t+"</span>";case"string":return'<span class="math-string">'+t+"</span>";case"boolean":return'<span class="math-boolean">'+t+"</span>";case"null":return'<span class="math-null-symbol">'+t+"</span>";case"undefined":return'<span class="math-undefined">'+t+"</span>";default:return'<span class="math-symbol">'+t+"</span>"}},r.prototype.toJSON=function(){return{mathjs:"ConstantNode",value:this.value}},r.fromJSON=function(e){return new r(e.value)},r.prototype._toTex=function(e){var t=this._toString(e);switch(H(this.value)){case"string":return"\\mathtt{"+Ys(t)+"}";case"number":case"BigNumber":if(!isFinite(this.value))return this.value.valueOf()<0?"-\\infty":"\\infty";var r=t.toLowerCase().indexOf("e");return-1!==r?t.substring(0,r)+"\\cdot10^{"+t.substring(r+1)+"}":t;case"Fraction":return this.value.toLatex();default:return t}},r}),{isClass:!0,isNode:!0}),Qs=Qe("FunctionAssignmentNode",["typed","Node"],(function(e){var t=e.typed,r=e.Node;function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if("string"!=typeof e)throw new TypeError('String expected for parameter "name"');if(!Array.isArray(t))throw new TypeError('Array containing strings or objects expected for parameter "params"');if(!D(r))throw new TypeError('Node expected for parameter "expr"');if(Ts.has(e))throw new Error('Illegal function name, "'+e+'" is a reserved keyword');this.name=e,this.params=t.map((function(e){return e&&e.name||e})),this.types=t.map((function(e){return e&&e.type||"any"})),this.expr=r}function i(e,t){var r=Ds(e,t),n=Ds(e.expr,t);return"all"===t||null!==n&&n<=r}return n.prototype=new r,n.prototype.type="FunctionAssignmentNode",n.prototype.isFunctionAssignmentNode=!0,n.prototype._compile=function(e,r){var n=Object.create(r);Be(this.params,(function(e){n[e]=!0}));var i=this.expr._compile(e,n),a=this.name,o=this.params,s=Pe(this.types,","),u=a+"("+Pe(this.params,", ")+")";return function(e,r,n){var c={};c[s]=function(){for(var t=Object.create(r),a=0;a<o.length;a++)t[o[a]]=arguments[a];return i(e,t,n)};var f=t(a,c);return f.syntax=u,e.set(a,f),f}},n.prototype.forEach=function(e){e(this.expr,"expr",this)},n.prototype.map=function(e){var t=this._ifNode(e(this.expr,"expr",this));return new n(this.name,this.params.slice(0),t)},n.prototype.clone=function(){return new n(this.name,this.params.slice(0),this.expr)},n.prototype._toString=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=this.expr.toString(e);return i(this,t)&&(r="("+r+")"),this.name+"("+this.params.join(", ")+") = "+r},n.prototype.toJSON=function(){var e=this.types;return{mathjs:"FunctionAssignmentNode",name:this.name,params:this.params.map((function(t,r){return{name:t,type:e[r]}})),expr:this.expr}},n.fromJSON=function(e){return new n(e.name,e.params,e.expr)},n.prototype.toHTML=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",r=[],n=0;n<this.params.length;n++)r.push('<span class="math-symbol math-parameter">'+we(this.params[n])+"</span>");var a=this.expr.toHTML(e);return i(this,t)&&(a='<span class="math-parenthesis math-round-parenthesis">(</span>'+a+'<span class="math-parenthesis math-round-parenthesis">)</span>'),'<span class="math-function">'+we(this.name)+'</span><span class="math-parenthesis math-round-parenthesis">(</span>'+r.join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-round-parenthesis">)</span><span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>'+a},n.prototype._toTex=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=this.expr.toTex(e);return i(this,t)&&(r="\\left(".concat(r,"\\right)")),"\\mathrm{"+this.name+"}\\left("+this.params.map(Js).join(",")+"\\right):="+r},n}),{isClass:!0,isNode:!0}),Ks=Qe("IndexNode",["Range","Node","size"],(function(e){var t=e.Range,r=e.Node,n=e.size;function i(e,t){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");if(this.dimensions=e,this.dotNotation=t||!1,!Array.isArray(e)||!e.every(D))throw new TypeError('Array containing Nodes expected for parameter "dimensions"');if(this.dotNotation&&!this.isObjectProperty())throw new Error("dotNotation only applicable for object properties")}function a(e,r,n){return new t(s(e)?e.toNumber():e,s(r)?r.toNumber():r,s(n)?n.toNumber():n)}return i.prototype=new r,i.prototype.type="IndexNode",i.prototype.isIndexNode=!0,i.prototype._compile=function(e,t){var r=Re(this.dimensions,(function(r,i){if(U(r)){if(r.needsEnd()){var o=Object.create(t);o.end=!0;var s=r.start._compile(e,o),u=r.end._compile(e,o),c=r.step?r.step._compile(e,o):function(){return 1};return function(e,t,r){var o=n(r).valueOf(),f=Object.create(t);return f.end=o[i],a(s(e,f,r),u(e,f,r),c(e,f,r))}}var f=r.start._compile(e,t),l=r.end._compile(e,t),p=r.step?r.step._compile(e,t):function(){return 1};return function(e,t,r){return a(f(e,t,r),l(e,t,r),p(e,t,r))}}if(L(r)&&"end"===r.name){var m=Object.create(t);m.end=!0;var h=r._compile(e,m);return function(e,t,r){var a=n(r).valueOf(),o=Object.create(t);return o.end=a[i],h(e,o,r)}}var d=r._compile(e,t);return function(e,t,r){return d(e,t,r)}})),i=at(e,"index");return function(e,t,n){var a=Re(r,(function(r){return r(e,t,n)}));return i.apply(void 0,ja()(a))}},i.prototype.forEach=function(e){for(var t=0;t<this.dimensions.length;t++)e(this.dimensions[t],"dimensions["+t+"]",this)},i.prototype.map=function(e){for(var t=[],r=0;r<this.dimensions.length;r++)t[r]=this._ifNode(e(this.dimensions[r],"dimensions["+r+"]",this));return new i(t,this.dotNotation)},i.prototype.clone=function(){return new i(this.dimensions.slice(0),this.dotNotation)},i.prototype.isObjectProperty=function(){return 1===this.dimensions.length&&z(this.dimensions[0])&&"string"==typeof this.dimensions[0].value},i.prototype.getObjectProperty=function(){return this.isObjectProperty()?this.dimensions[0].value:null},i.prototype._toString=function(e){return this.dotNotation?"."+this.getObjectProperty():"["+this.dimensions.join(", ")+"]"},i.prototype.toJSON=function(){return{mathjs:"IndexNode",dimensions:this.dimensions,dotNotation:this.dotNotation}},i.fromJSON=function(e){return new i(e.dimensions,e.dotNotation)},i.prototype.toHTML=function(e){for(var t=[],r=0;r<this.dimensions.length;r++)t[r]=this.dimensions[r].toHTML();return this.dotNotation?'<span class="math-operator math-accessor-operator">.</span><span class="math-symbol math-property">'+we(this.getObjectProperty())+"</span>":'<span class="math-parenthesis math-square-parenthesis">[</span>'+t.join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-square-parenthesis">]</span>'},i.prototype._toTex=function(e){var t=this.dimensions.map((function(t){return t.toTex(e)}));return this.dotNotation?"."+this.getObjectProperty():"_{"+t.join(",")+"}"},i}),{isClass:!0,isNode:!0}),eu=Qe("ObjectNode",["Node"],(function(e){var t=e.Node;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(this.properties=e||{},e&&("object"!==a()(e)||!Object.keys(e).every((function(t){return D(e[t])}))))throw new TypeError("Object containing Nodes expected")}return r.prototype=new t,r.prototype.type="ObjectNode",r.prototype.isObjectNode=!0,r.prototype._compile=function(e,t){var r={};for(var n in this.properties)if(Je(this.properties,n)){var i=be(n),a=JSON.parse(i);if(!st(this.properties,a))throw new Error('No access to property "'+a+'"');r[a]=this.properties[n]._compile(e,t)}return function(e,t,n){var i={};for(var a in r)Je(r,a)&&(i[a]=r[a](e,t,n));return i}},r.prototype.forEach=function(e){for(var t in this.properties)Je(this.properties,t)&&e(this.properties[t],"properties["+be(t)+"]",this)},r.prototype.map=function(e){var t={};for(var n in this.properties)Je(this.properties,n)&&(t[n]=this._ifNode(e(this.properties[n],"properties["+be(n)+"]",this)));return new r(t)},r.prototype.clone=function(){var e={};for(var t in this.properties)Je(this.properties,t)&&(e[t]=this.properties[t]);return new r(e)},r.prototype._toString=function(e){var t=[];for(var r in this.properties)Je(this.properties,r)&&t.push(be(r)+": "+this.properties[r].toString(e));return"{"+t.join(", ")+"}"},r.prototype.toJSON=function(){return{mathjs:"ObjectNode",properties:this.properties}},r.fromJSON=function(e){return new r(e.properties)},r.prototype.toHTML=function(e){var t=[];for(var r in this.properties)Je(this.properties,r)&&t.push('<span class="math-symbol math-property">'+we(r)+'</span><span class="math-operator math-assignment-operator math-property-assignment-operator math-binary-operator">:</span>'+this.properties[r].toHTML(e));return'<span class="math-parenthesis math-curly-parenthesis">{</span>'+t.join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-curly-parenthesis">}</span>'},r.prototype._toTex=function(e){var t=[];for(var r in this.properties)Je(this.properties,r)&&t.push("\\mathbf{"+r+":} & "+this.properties[r].toTex(e)+"\\\\");return"\\left\\{\\begin{array}{ll}".concat(t.join("\n"),"\\end{array}\\right\\}")},r}),{isClass:!0,isNode:!0}),tu=Qe("OperatorNode",["Node"],(function(e){var t=e.Node;function r(e,t,n,i,a){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if("string"!=typeof e)throw new TypeError('string expected for parameter "op"');if("string"!=typeof t)throw new TypeError('string expected for parameter "fn"');if(!Array.isArray(n)||!n.every(D))throw new TypeError('Array containing Nodes expected for parameter "args"');this.implicit=!0===i,this.isPercentage=!0===a,this.op=e,this.fn=t,this.args=n||[]}function n(e,t,r,n,i){var a,o=Ds(e,t),s=js(e,t);if("all"===t||n.length>2&&"OperatorNode:add"!==e.getIdentifier()&&"OperatorNode:multiply"!==e.getIdentifier())return n.map((function(e){switch(e.getContent().type){case"ArrayNode":case"ConstantNode":case"SymbolNode":case"ParenthesisNode":return!1;default:return!0}}));switch(n.length){case 0:a=[];break;case 1:var u=Ds(n[0],t);if(i&&null!==u){var c,f;if("keep"===t?(c=n[0].getIdentifier(),f=e.getIdentifier()):(c=n[0].getContent().getIdentifier(),f=e.getContent().getIdentifier()),!1===Bs[o][f].latexLeftParens){a=[!1];break}if(!1===Bs[u][c].latexParens){a=[!1];break}}if(null===u){a=[!1];break}if(u<=o){a=[!0];break}a=[!1];break;case 2:var l,p,m=Ds(n[0],t),h=Ps(e,n[0],t);l=null!==m&&(m===o&&"right"===s&&!h||m<o);var d,v,y,g=Ds(n[1],t),x=Ps(e,n[1],t);if(p=null!==g&&(g===o&&"left"===s&&!x||g<o),i)"keep"===t?(d=e.getIdentifier(),v=e.args[0].getIdentifier(),y=e.args[1].getIdentifier()):(d=e.getContent().getIdentifier(),v=e.args[0].getContent().getIdentifier(),y=e.args[1].getContent().getIdentifier()),null!==m&&(!1===Bs[o][d].latexLeftParens&&(l=!1),!1===Bs[m][v].latexParens&&(l=!1)),null!==g&&(!1===Bs[o][d].latexRightParens&&(p=!1),!1===Bs[g][y].latexParens&&(p=!1));a=[l,p];break;default:"OperatorNode:add"!==e.getIdentifier()&&"OperatorNode:multiply"!==e.getIdentifier()||(a=n.map((function(r){var n=Ds(r,t),i=Ps(e,r,t),a=js(r,t);return null!==n&&(o===n&&s===a&&!i||n<o)})))}return n.length>=2&&"OperatorNode:multiply"===e.getIdentifier()&&e.implicit&&"auto"===t&&"hide"===r&&(a=n.map((function(e,t){var r="ParenthesisNode"===e.getIdentifier();return!(!a[t]&&!r)}))),a}return r.prototype=new t,r.prototype.type="OperatorNode",r.prototype.isOperatorNode=!0,r.prototype._compile=function(e,t){if("string"!=typeof this.fn||!ut(e,this.fn))throw e[this.fn]?new Error('No access to function "'+this.fn+'"'):new Error("Function "+this.fn+' missing in provided namespace "math"');var r=at(e,this.fn),n=Re(this.args,(function(r){return r._compile(e,t)}));if(1===n.length){var i=n[0];return function(e,t,n){return r(i(e,t,n))}}if(2===n.length){var a=n[0],o=n[1];return function(e,t,n){return r(a(e,t,n),o(e,t,n))}}return function(e,t,i){return r.apply(null,Re(n,(function(r){return r(e,t,i)})))}},r.prototype.forEach=function(e){for(var t=0;t<this.args.length;t++)e(this.args[t],"args["+t+"]",this)},r.prototype.map=function(e){for(var t=[],n=0;n<this.args.length;n++)t[n]=this._ifNode(e(this.args[n],"args["+n+"]",this));return new r(this.op,this.fn,t,this.implicit,this.isPercentage)},r.prototype.clone=function(){return new r(this.op,this.fn,this.args.slice(0),this.implicit,this.isPercentage)},r.prototype.isUnary=function(){return 1===this.args.length},r.prototype.isBinary=function(){return 2===this.args.length},r.prototype._toString=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=e&&e.implicit?e.implicit:"hide",i=this.args,a=n(this,t,r,i,!1);if(1===i.length){var o=js(this,t),s=i[0].toString(e);a[0]&&(s="("+s+")");var u=/[a-zA-Z]+/.test(this.op);return"right"===o?this.op+(u?" ":"")+s:"left"===o?s+(u?" ":"")+this.op:s+this.op}if(2===i.length){var c=i[0].toString(e),f=i[1].toString(e);return a[0]&&(c="("+c+")"),a[1]&&(f="("+f+")"),this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===r?c+" "+f:c+" "+this.op+" "+f}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){var l=i.map((function(t,r){return t=t.toString(e),a[r]&&(t="("+t+")"),t}));return this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===r?l.join(" "):l.join(" "+this.op+" ")}return this.fn+"("+this.args.join(", ")+")"},r.prototype.toJSON=function(){return{mathjs:"OperatorNode",op:this.op,fn:this.fn,args:this.args,implicit:this.implicit,isPercentage:this.isPercentage}},r.fromJSON=function(e){return new r(e.op,e.fn,e.args,e.implicit,e.isPercentage)},r.prototype.toHTML=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=e&&e.implicit?e.implicit:"hide",i=this.args,a=n(this,t,r,i,!1);if(1===i.length){var o=js(this,t),s=i[0].toHTML(e);return a[0]&&(s='<span class="math-parenthesis math-round-parenthesis">(</span>'+s+'<span class="math-parenthesis math-round-parenthesis">)</span>'),"right"===o?'<span class="math-operator math-unary-operator math-lefthand-unary-operator">'+we(this.op)+"</span>"+s:s+'<span class="math-operator math-unary-operator math-righthand-unary-operator">'+we(this.op)+"</span>"}if(2===i.length){var u=i[0].toHTML(e),c=i[1].toHTML(e);return a[0]&&(u='<span class="math-parenthesis math-round-parenthesis">(</span>'+u+'<span class="math-parenthesis math-round-parenthesis">)</span>'),a[1]&&(c='<span class="math-parenthesis math-round-parenthesis">(</span>'+c+'<span class="math-parenthesis math-round-parenthesis">)</span>'),this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===r?u+'<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>'+c:u+'<span class="math-operator math-binary-operator math-explicit-binary-operator">'+we(this.op)+"</span>"+c}var f=i.map((function(t,r){return t=t.toHTML(e),a[r]&&(t='<span class="math-parenthesis math-round-parenthesis">(</span>'+t+'<span class="math-parenthesis math-round-parenthesis">)</span>'),t}));return i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())?this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===r?f.join('<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>'):f.join('<span class="math-operator math-binary-operator math-explicit-binary-operator">'+we(this.op)+"</span>"):'<span class="math-function">'+we(this.fn)+'</span><span class="math-paranthesis math-round-parenthesis">(</span>'+f.join('<span class="math-separator">,</span>')+'<span class="math-paranthesis math-round-parenthesis">)</span>'},r.prototype._toTex=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=e&&e.implicit?e.implicit:"hide",i=this.args,a=n(this,t,r,i,!0),o=Vs[this.fn];if(o=void 0===o?this.op:o,1===i.length){var s=js(this,t),u=i[0].toTex(e);return a[0]&&(u="\\left(".concat(u,"\\right)")),"right"===s?o+u:u+o}if(2===i.length){var c=i[0],f=c.toTex(e);a[0]&&(f="\\left(".concat(f,"\\right)"));var l,p=i[1].toTex(e);switch(a[1]&&(p="\\left(".concat(p,"\\right)")),l="keep"===t?c.getIdentifier():c.getContent().getIdentifier(),this.getIdentifier()){case"OperatorNode:divide":return o+"{"+f+"}{"+p+"}";case"OperatorNode:pow":switch(f="{"+f+"}",p="{"+p+"}",l){case"ConditionalNode":case"OperatorNode:divide":f="\\left(".concat(f,"\\right)")}break;case"OperatorNode:multiply":if(this.implicit&&"hide"===r)return f+"~"+p}return f+o+p}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){var m=i.map((function(t,r){return t=t.toTex(e),a[r]&&(t="\\left(".concat(t,"\\right)")),t}));return"OperatorNode:multiply"===this.getIdentifier()&&this.implicit?m.join("~"):m.join(o)}return"\\mathrm{"+this.fn+"}\\left("+i.map((function(t){return t.toTex(e)})).join(",")+"\\right)"},r.prototype.getIdentifier=function(){return this.type+":"+this.fn},r}),{isClass:!0,isNode:!0}),ru=Qe("ParenthesisNode",["Node"],(function(e){var t=e.Node;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!D(e))throw new TypeError('Node expected for parameter "content"');this.content=e}return r.prototype=new t,r.prototype.type="ParenthesisNode",r.prototype.isParenthesisNode=!0,r.prototype._compile=function(e,t){return this.content._compile(e,t)},r.prototype.getContent=function(){return this.content.getContent()},r.prototype.forEach=function(e){e(this.content,"content",this)},r.prototype.map=function(e){return new r(e(this.content,"content",this))},r.prototype.clone=function(){return new r(this.content)},r.prototype._toString=function(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?"("+this.content.toString(e)+")":this.content.toString(e)},r.prototype.toJSON=function(){return{mathjs:"ParenthesisNode",content:this.content}},r.fromJSON=function(e){return new r(e.content)},r.prototype.toHTML=function(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?'<span class="math-parenthesis math-round-parenthesis">(</span>'+this.content.toHTML(e)+'<span class="math-parenthesis math-round-parenthesis">)</span>':this.content.toHTML(e)},r.prototype._toTex=function(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?"\\left(".concat(this.content.toTex(e),"\\right)"):this.content.toTex(e)},r}),{isClass:!0,isNode:!0}),nu=Qe("RangeNode",["Node"],(function(e){var t=e.Node;function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!D(e))throw new TypeError("Node expected");if(!D(t))throw new TypeError("Node expected");if(n&&!D(n))throw new TypeError("Node expected");if(arguments.length>3)throw new Error("Too many arguments");this.start=e,this.end=t,this.step=n||null}function n(e,t){var r=Ds(e,t),n={},i=Ds(e.start,t);if(n.start=null!==i&&i<=r||"all"===t,e.step){var a=Ds(e.step,t);n.step=null!==a&&a<=r||"all"===t}var o=Ds(e.end,t);return n.end=null!==o&&o<=r||"all"===t,n}return r.prototype=new t,r.prototype.type="RangeNode",r.prototype.isRangeNode=!0,r.prototype.needsEnd=function(){return this.filter((function(e){return L(e)&&"end"===e.name})).length>0},r.prototype._compile=function(e,t){var r=e.range,n=this.start._compile(e,t),i=this.end._compile(e,t);if(this.step){var a=this.step._compile(e,t);return function(e,t,o){return r(n(e,t,o),i(e,t,o),a(e,t,o))}}return function(e,t,a){return r(n(e,t,a),i(e,t,a))}},r.prototype.forEach=function(e){e(this.start,"start",this),e(this.end,"end",this),this.step&&e(this.step,"step",this)},r.prototype.map=function(e){return new r(this._ifNode(e(this.start,"start",this)),this._ifNode(e(this.end,"end",this)),this.step&&this._ifNode(e(this.step,"step",this)))},r.prototype.clone=function(){return new r(this.start,this.end,this.step&&this.step)},r.prototype._toString=function(e){var t,r=n(this,e&&e.parenthesis?e.parenthesis:"keep"),i=this.start.toString(e);if(r.start&&(i="("+i+")"),t=i,this.step){var a=this.step.toString(e);r.step&&(a="("+a+")"),t+=":"+a}var o=this.end.toString(e);return r.end&&(o="("+o+")"),t+=":"+o},r.prototype.toJSON=function(){return{mathjs:"RangeNode",start:this.start,end:this.end,step:this.step}},r.fromJSON=function(e){return new r(e.start,e.end,e.step)},r.prototype.toHTML=function(e){var t,r=n(this,e&&e.parenthesis?e.parenthesis:"keep"),i=this.start.toHTML(e);if(r.start&&(i='<span class="math-parenthesis math-round-parenthesis">(</span>'+i+'<span class="math-parenthesis math-round-parenthesis">)</span>'),t=i,this.step){var a=this.step.toHTML(e);r.step&&(a='<span class="math-parenthesis math-round-parenthesis">(</span>'+a+'<span class="math-parenthesis math-round-parenthesis">)</span>'),t+='<span class="math-operator math-range-operator">:</span>'+a}var o=this.end.toHTML(e);return r.end&&(o='<span class="math-parenthesis math-round-parenthesis">(</span>'+o+'<span class="math-parenthesis math-round-parenthesis">)</span>'),t+='<span class="math-operator math-range-operator">:</span>'+o},r.prototype._toTex=function(e){var t=n(this,e&&e.parenthesis?e.parenthesis:"keep"),r=this.start.toTex(e);if(t.start&&(r="\\left(".concat(r,"\\right)")),this.step){var i=this.step.toTex(e);t.step&&(i="\\left(".concat(i,"\\right)")),r+=":"+i}var a=this.end.toTex(e);return t.end&&(a="\\left(".concat(a,"\\right)")),r+=":"+a},r}),{isClass:!0,isNode:!0}),iu=Qe("RelationalNode",["Node"],(function(e){var t=e.Node;function r(e,t){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!Array.isArray(e))throw new TypeError("Parameter conditionals must be an array");if(!Array.isArray(t))throw new TypeError("Parameter params must be an array");if(e.length!==t.length-1)throw new TypeError("Parameter params must contain exactly one more element than parameter conditionals");this.conditionals=e,this.params=t}return r.prototype=new t,r.prototype.type="RelationalNode",r.prototype.isRelationalNode=!0,r.prototype._compile=function(e,t){var r=this,n=this.params.map((function(r){return r._compile(e,t)}));return function(t,i,a){for(var o,s=n[0](t,i,a),u=0;u<r.conditionals.length;u++){if(o=s,s=n[u+1](t,i,a),!at(e,r.conditionals[u])(o,s))return!1}return!0}},r.prototype.forEach=function(e){var t=this;this.params.forEach((function(r,n){return e(r,"params["+n+"]",t)}),this)},r.prototype.map=function(e){var t=this;return new r(this.conditionals.slice(),this.params.map((function(r,n){return t._ifNode(e(r,"params["+n+"]",t))}),this))},r.prototype.clone=function(){return new r(this.conditionals,this.params)},r.prototype._toString=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",r=Ds(this,t),n=this.params.map((function(n,i){var a=Ds(n,t);return"all"===t||null!==a&&a<=r?"("+n.toString(e)+")":n.toString(e)})),i={equal:"==",unequal:"!=",smaller:"<",larger:">",smallerEq:"<=",largerEq:">="},a=n[0],o=0;o<this.conditionals.length;o++)a+=" "+i[this.conditionals[o]]+" "+n[o+1];return a},r.prototype.toJSON=function(){return{mathjs:"RelationalNode",conditionals:this.conditionals,params:this.params}},r.fromJSON=function(e){return new r(e.conditionals,e.params)},r.prototype.toHTML=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",r=Ds(this,t),n=this.params.map((function(n,i){var a=Ds(n,t);return"all"===t||null!==a&&a<=r?'<span class="math-parenthesis math-round-parenthesis">(</span>'+n.toHTML(e)+'<span class="math-parenthesis math-round-parenthesis">)</span>':n.toHTML(e)})),i={equal:"==",unequal:"!=",smaller:"<",larger:">",smallerEq:"<=",largerEq:">="},a=n[0],o=0;o<this.conditionals.length;o++)a+='<span class="math-operator math-binary-operator math-explicit-binary-operator">'+we(i[this.conditionals[o]])+"</span>"+n[o+1];return a},r.prototype._toTex=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",r=Ds(this,t),n=this.params.map((function(n,i){var a=Ds(n,t);return"all"===t||null!==a&&a<=r?"\\left("+n.toTex(e)+"\right)":n.toTex(e)})),i=n[0],a=0;a<this.conditionals.length;a++)i+=Vs[this.conditionals[a]]+n[a+1];return i},r}),{isClass:!0,isNode:!0}),au=Qe("SymbolNode",["math","?Unit","Node"],(function(e){var t=e.math,r=e.Unit,n=e.Node;function i(e){return!!r&&r.isValuelessUnit(e)}function a(e){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");if("string"!=typeof e)throw new TypeError('String expected for parameter "name"');this.name=e}return a.prototype=new n,a.prototype.type="SymbolNode",a.prototype.isSymbolNode=!0,a.prototype._compile=function(e,t){var n=this.name;if(!0===t[n])return function(e,t,r){return t[n]};if(n in e)return function(t,r,i){return t.has(n)?t.get(n):at(e,n)};var o=i(n);return function(e,t,i){return e.has(n)?e.get(n):o?new r(null,n):a.onUndefinedSymbol(n)}},a.prototype.forEach=function(e){},a.prototype.map=function(e){return this.clone()},a.onUndefinedSymbol=function(e){throw new Error("Undefined symbol "+e)},a.prototype.clone=function(){return new a(this.name)},a.prototype._toString=function(e){return this.name},a.prototype.toHTML=function(e){var t=we(this.name);return"true"===t||"false"===t?'<span class="math-symbol math-boolean">'+t+"</span>":"i"===t?'<span class="math-symbol math-imaginary-symbol">'+t+"</span>":"Infinity"===t?'<span class="math-symbol math-infinity-symbol">'+t+"</span>":"NaN"===t?'<span class="math-symbol math-nan-symbol">'+t+"</span>":"null"===t?'<span class="math-symbol math-null-symbol">'+t+"</span>":"undefined"===t?'<span class="math-symbol math-undefined-symbol">'+t+"</span>":'<span class="math-symbol">'+t+"</span>"},a.prototype.toJSON=function(){return{mathjs:"SymbolNode",name:this.name}},a.fromJSON=function(e){return new a(e.name)},a.prototype._toTex=function(e){var r=!1;void 0===t[this.name]&&i(this.name)&&(r=!0);var n=Js(this.name,r);return"\\"===n[0]?n:" "+n},a}),{isClass:!0,isNode:!0});function ou(e){for(var t=arguments.length,r=new Array(t>1?t-1:0),n=1;n<t;n++)r[n-1]=arguments[n];return"function"==typeof e.createSubScope?gt.apply(void 0,[e.createSubScope()].concat(r)):gt.apply(void 0,[dt(),e].concat(r))}var su=Qe("FunctionNode",["math","Node","SymbolNode"],(function(e){var t=e.math,r=e.Node,n=e.SymbolNode;function i(e,t){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");if("string"==typeof e&&(e=new n(e)),!D(e))throw new TypeError('Node expected as parameter "fn"');if(!Array.isArray(t)||!t.every(D))throw new TypeError('Array containing Nodes expected for parameter "args"');this.fn=e,this.args=t||[],Object.defineProperty(this,"name",{get:function(){return this.fn.name||""}.bind(this),set:function(){throw new Error("Cannot assign a new name, name is read-only")}})}i.prototype=new r,i.prototype.type="FunctionNode",i.prototype.isFunctionNode=!0;var o=function(e){return xe(e,{truncate:78})};i.prototype._compile=function(e,t){if(!(this instanceof i))throw new TypeError("No valid FunctionNode");var r=this.args.map((function(r){return r._compile(e,t)}));if(!L(this.fn)){if(C(this.fn)&&B(this.fn.index)&&this.fn.index.isObjectProperty()){var n=this.fn.object._compile(e,t),a=this.fn.index.getObjectProperty(),s=this.args;return function(t,i,o){var u=n(t,i,o);if(function(e,t){if(!ut(e,t))throw new Error('No access to method "'+t+'"')}(u,a),u[a]&&u[a].rawArgs)return u[a](s,e,ou(t,i),t);var c=r.map((function(e){return e(t,i,o)}));return u[a].apply(u,c)}}var u=this.fn.toString(),c=this.fn._compile(e,t),f=this.args;return function(t,n,i){var a=c(t,n,i);if("function"!=typeof a)throw new TypeError("Expression '".concat(u,"' did not evaluate to a function; value is:")+"\n  ".concat(o(a)));if(a.rawArgs)return a(f,e,ou(t,n),t);var s=r.map((function(e){return e(t,n,i)}));return a.apply(a,s)}}var l=this.fn.name;if(t[l]){var p=this.args;return function(t,n,i){var a=n[l];if("function"!=typeof a)throw new TypeError("Argument '".concat(l,"' was not a function; received: ").concat(o(a)));if(a.rawArgs)return a(p,e,ou(t,n),t);var s=r.map((function(e){return e(t,n,i)}));return a.apply(a,s)}}var m=l in e?at(e,l):void 0,h="function"==typeof m&&!0===m.rawArgs,d=function(t){var r;if(t.has(l))r=t.get(l);else{if(!(l in e))return i.onUndefinedFunction(l);r=at(e,l)}if("function"==typeof r)return r;throw new TypeError("'".concat(l,"' is not a function; its value is:\n  ").concat(o(r)))};if(h){var v=this.args;return function(t,r,n){return d(t)(v,e,ou(t,r),t)}}switch(r.length){case 0:return function(e,t,r){return d(e)()};case 1:return function(e,t,n){return d(e)((0,r[0])(e,t,n))};case 2:return function(e,t,n){var i=d(e),a=r[0],o=r[1];return i(a(e,t,n),o(e,t,n))};default:return function(e,t,n){var i=d(e),a=r.map((function(r){return r(e,t,n)}));return i.apply(void 0,ja()(a))}}},i.prototype.forEach=function(e){e(this.fn,"fn",this);for(var t=0;t<this.args.length;t++)e(this.args[t],"args["+t+"]",this)},i.prototype.map=function(e){for(var t=this._ifNode(e(this.fn,"fn",this)),r=[],n=0;n<this.args.length;n++)r[n]=this._ifNode(e(this.args[n],"args["+n+"]",this));return new i(t,r)},i.prototype.clone=function(){return new i(this.fn,this.args.slice(0))},i.onUndefinedFunction=function(e){throw new Error("Undefined function "+e)};var s=i.prototype.toString;function u(e,t,r){for(var n,i="",o=/\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi,s=0;null!==(n=o.exec(e));)if(i+=e.substring(s,n.index),s=n.index,"$$"===n[0])i+="$",s++;else{s+=n[0].length;var u=t[n[1]];if(!u)throw new ReferenceError("Template: Property "+n[1]+" does not exist.");if(void 0===n[2])switch(a()(u)){case"string":i+=u;break;case"object":if(D(u))i+=u.toTex(r);else{if(!Array.isArray(u))throw new TypeError("Template: "+n[1]+" has to be a Node, String or array of Nodes");i+=u.map((function(e,t){if(D(e))return e.toTex(r);throw new TypeError("Template: "+n[1]+"["+t+"] is not a Node.")})).join(",")}break;default:throw new TypeError("Template: "+n[1]+" has to be a Node, String or array of Nodes")}else{if(!D(u[n[2]]&&u[n[2]]))throw new TypeError("Template: "+n[1]+"["+n[2]+"] is not a Node.");i+=u[n[2]].toTex(r)}}return i+=e.slice(s)}i.prototype.toString=function(e){var t,r=this.fn.toString(e);return e&&"object"===a()(e.handler)&&Je(e.handler,r)&&(t=e.handler[r](this,e)),void 0!==t?t:s.call(this,e)},i.prototype._toString=function(e){var t=this.args.map((function(t){return t.toString(e)}));return(q(this.fn)?"("+this.fn.toString(e)+")":this.fn.toString(e))+"("+t.join(", ")+")"},i.prototype.toJSON=function(){return{mathjs:"FunctionNode",fn:this.fn,args:this.args}},i.fromJSON=function(e){return new i(e.fn,e.args)},i.prototype.toHTML=function(e){var t=this.args.map((function(t){return t.toHTML(e)}));return'<span class="math-function">'+we(this.fn)+'</span><span class="math-paranthesis math-round-parenthesis">(</span>'+t.join('<span class="math-separator">,</span>')+'<span class="math-paranthesis math-round-parenthesis">)</span>'};var c=i.prototype.toTex;return i.prototype.toTex=function(e){var t;return e&&"object"===a()(e.handler)&&Je(e.handler,this.name)&&(t=e.handler[this.name](this,e)),void 0!==t?t:c.call(this,e)},i.prototype._toTex=function(e){var r,n,i=this.args.map((function(t){return t.toTex(e)}));switch(Zs[this.name]&&(r=Zs[this.name]),!t[this.name]||"function"!=typeof t[this.name].toTex&&"object"!==a()(t[this.name].toTex)&&"string"!=typeof t[this.name].toTex||(r=t[this.name].toTex),a()(r)){case"function":n=r(this,e);break;case"string":n=u(r,this,e);break;case"object":switch(a()(r[i.length])){case"function":n=r[i.length](this,e);break;case"string":n=u(r[i.length],this,e)}}return void 0!==n?n:u("\\mathrm{${name}}\\left(${args}\\right)",this,e)},i.prototype.getIdentifier=function(){return this.type+":"+this.name},i}),{isClass:!0,isNode:!0}),uu=Qe("parse",["typed","numeric","config","AccessorNode","ArrayNode","AssignmentNode","BlockNode","ConditionalNode","ConstantNode","FunctionAssignmentNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","RangeNode","RelationalNode","SymbolNode"],(function(e){var t=e.typed,r=e.numeric,n=e.config,i=e.AccessorNode,a=e.ArrayNode,o=e.AssignmentNode,s=e.BlockNode,u=e.ConditionalNode,c=e.ConstantNode,f=e.FunctionAssignmentNode,l=e.FunctionNode,p=e.IndexNode,m=e.ObjectNode,h=e.OperatorNode,d=e.ParenthesisNode,v=e.RangeNode,y=e.RelationalNode,g=e.SymbolNode,x=t("parse",{string:function(e){return H(e,{})},"Array | Matrix":function(e){return b(e,{})},"string, Object":function(e,t){return H(e,void 0!==t.nodes?t.nodes:{})},"Array | Matrix, Object":b});function b(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},r=void 0!==t.nodes?t.nodes:{};return Gt(e,(function(e){if("string"!=typeof e)throw new TypeError("String expected");return H(e,r)}))}var w=0,N=1,M=2,E=3,S=4,A={",":!0,"(":!0,")":!0,"[":!0,"]":!0,"{":!0,"}":!0,'"':!0,"'":!0,";":!0,"+":!0,"-":!0,"*":!0,".*":!0,"/":!0,"./":!0,"%":!0,"^":!0,".^":!0,"~":!0,"!":!0,"&":!0,"|":!0,"^|":!0,"=":!0,":":!0,"?":!0,"==":!0,"!=":!0,"<":!0,">":!0,"<=":!0,">=":!0,"<<":!0,">>":!0,">>>":!0},O={mod:!0,to:!0,in:!0,and:!0,xor:!0,or:!0,not:!0},_={true:!0,false:!1,null:null,undefined:void 0},T=["NaN","Infinity"];function I(e,t){return e.expression.substr(e.index,t)}function k(e){return I(e,1)}function q(e){e.index++}function B(e){return e.expression.charAt(e.index-1)}function D(e){return e.expression.charAt(e.index+1)}function j(e){for(e.tokenType=w,e.token="",e.comment="";;){if("#"===k(e))for(;"\n"!==k(e)&&""!==k(e);)e.comment+=k(e),q(e);if(!x.isWhitespace(k(e),e.nestingLevel))break;q(e)}if(""!==k(e)){if("\n"===k(e)&&!e.nestingLevel)return e.tokenType=N,e.token=k(e),void q(e);var t=k(e),r=I(e,2),n=I(e,3);if(3===n.length&&A[n])return e.tokenType=N,e.token=n,q(e),q(e),void q(e);if(2===r.length&&A[r])return e.tokenType=N,e.token=r,q(e),void q(e);if(A[t])return e.tokenType=N,e.token=t,void q(e);if(x.isDigitDot(t)){e.tokenType=M;var i=I(e,2);if("0b"===i||"0o"===i||"0x"===i){for(e.token+=k(e),q(e),e.token+=k(e),q(e);x.isHexDigit(k(e));)e.token+=k(e),q(e);if("."===k(e))for(e.token+=".",q(e);x.isHexDigit(k(e));)e.token+=k(e),q(e);else if("i"===k(e))for(e.token+="i",q(e);x.isDigit(k(e));)e.token+=k(e),q(e);return}if("."===k(e)){if(e.token+=k(e),q(e),!x.isDigit(k(e)))return void(e.tokenType=N)}else{for(;x.isDigit(k(e));)e.token+=k(e),q(e);x.isDecimalMark(k(e),D(e))&&(e.token+=k(e),q(e))}for(;x.isDigit(k(e));)e.token+=k(e),q(e);if("E"===k(e)||"e"===k(e))if(x.isDigit(D(e))||"-"===D(e)||"+"===D(e)){if(e.token+=k(e),q(e),"+"!==k(e)&&"-"!==k(e)||(e.token+=k(e),q(e)),!x.isDigit(k(e)))throw pe(e,'Digit expected, got "'+k(e)+'"');for(;x.isDigit(k(e));)e.token+=k(e),q(e);if(x.isDecimalMark(k(e),D(e)))throw pe(e,'Digit expected, got "'+k(e)+'"')}else if("."===D(e))throw q(e),pe(e,'Digit expected, got "'+k(e)+'"')}else{if(!x.isAlpha(k(e),B(e),D(e))){for(e.tokenType=S;""!==k(e);)e.token+=k(e),q(e);throw pe(e,'Syntax error in part "'+e.token+'"')}for(;x.isAlpha(k(e),B(e),D(e))||x.isDigit(k(e));)e.token+=k(e),q(e);Je(O,e.token)?e.tokenType=N:e.tokenType=E}}else e.tokenType=N}function F(e){do{j(e)}while("\n"===e.token)}function U(e){e.nestingLevel++}function $(e){e.nestingLevel--}function H(e,t){var r={extraNodes:{},expression:"",comment:"",index:0,token:"",tokenType:w,nestingLevel:0,conditionalLevel:null};ho()(r,{expression:e,extraNodes:t}),j(r);var n=function(e){var t,r,n=[];""!==e.token&&"\n"!==e.token&&";"!==e.token&&((t=G(e)).comment=e.comment);for(;"\n"===e.token||";"===e.token;)0===n.length&&t&&(r=";"!==e.token,n.push({node:t,visible:r})),j(e),"\n"!==e.token&&";"!==e.token&&""!==e.token&&((t=G(e)).comment=e.comment,r=";"!==e.token,n.push({node:t,visible:r}));return n.length>0?new s(n):(t||((t=new c(void 0)).comment=e.comment),t)}(r);if(""!==r.token)throw r.tokenType===N?me(r,"Unexpected operator "+r.token):pe(r,'Unexpected part "'+r.token+'"');return n}function G(e){var t,r,n,i,a=function(e){var t=function(e){var t=V(e);for(;"or"===e.token;)F(e),t=new h("or","or",[t,V(e)]);return t}(e);for(;"?"===e.token;){var r=e.conditionalLevel;e.conditionalLevel=e.nestingLevel,F(e);var n=t,i=G(e);if(":"!==e.token)throw pe(e,"False part of conditional expression expected");e.conditionalLevel=null,F(e);var a=G(e);t=new u(n,i,a),e.conditionalLevel=r}return t}(e);if("="===e.token){if(L(a))return t=a.name,F(e),n=G(e),new o(new g(t),n);if(C(a))return F(e),n=G(e),new o(a.object,a.index,n);if(R(a)&&L(a.fn)&&(i=!0,r=[],t=a.name,a.args.forEach((function(e,t){L(e)?r[t]=e.name:i=!1})),i))return F(e),n=G(e),new f(t,r,n);throw pe(e,"Invalid left hand side of assignment operator =")}return a}function V(e){for(var t=Z(e);"xor"===e.token;)F(e),t=new h("xor","xor",[t,Z(e)]);return t}function Z(e){for(var t=W(e);"and"===e.token;)F(e),t=new h("and","and",[t,W(e)]);return t}function W(e){for(var t=Y(e);"|"===e.token;)F(e),t=new h("|","bitOr",[t,Y(e)]);return t}function Y(e){for(var t=J(e);"^|"===e.token;)F(e),t=new h("^|","bitXor",[t,J(e)]);return t}function J(e){for(var t=X(e);"&"===e.token;)F(e),t=new h("&","bitAnd",[t,X(e)]);return t}function X(e){for(var t=[Q(e)],r=[],n={"==":"equal","!=":"unequal","<":"smaller",">":"larger","<=":"smallerEq",">=":"largerEq"};Je(n,e.token);){var i={name:e.token,fn:n[e.token]};r.push(i),F(e),t.push(Q(e))}return 1===t.length?t[0]:2===t.length?new h(r[0].name,r[0].fn,t):new y(r.map((function(e){return e.fn})),t)}function Q(e){var t,r,n,i;t=K(e);for(var a={"<<":"leftShift",">>":"rightArithShift",">>>":"rightLogShift"};Je(a,e.token);)n=a[r=e.token],F(e),i=[t,K(e)],t=new h(r,n,i);return t}function K(e){var t,r,n,i;t=ee(e);for(var a={to:"to",in:"to"};Je(a,e.token);)n=a[r=e.token],F(e),"in"===r&&""===e.token?t=new h("*","multiply",[t,new g("in")],!0):(i=[t,ee(e)],t=new h(r,n,i));return t}function ee(e){var t,r=[];if(t=":"===e.token?new c(1):te(e),":"===e.token&&e.conditionalLevel!==e.nestingLevel){for(r.push(t);":"===e.token&&r.length<3;)F(e),")"===e.token||"]"===e.token||","===e.token||""===e.token?r.push(new g("end")):r.push(te(e));t=3===r.length?new v(r[0],r[2],r[1]):new v(r[0],r[1])}return t}function te(e){var t,r,n,i;t=re(e);for(var a={"+":"add","-":"subtract"};Je(a,e.token);){n=a[r=e.token],F(e);var o=re(e);i=o.isPercentage?[t,new h("*","multiply",[t,o])]:[t,o],t=new h(r,n,i)}return t}function re(e){var t,r,n,i;r=t=ne(e);for(var a={"*":"multiply",".*":"dotMultiply","/":"divide","./":"dotDivide"};Je(a,e.token);)i=a[n=e.token],F(e),r=ne(e),t=new h(n,i,[t,r]);return t}function ne(e){var t,r;for(r=t=ie(e);e.tokenType===E||"in"===e.token&&z(t)||!(e.tokenType!==M||z(r)||P(r)&&"!"!==r.op)||"("===e.token;)r=ie(e),t=new h("*","multiply",[t,r],!0);return t}function ie(e){for(var t=ae(e),r=t,n=[];"/"===e.token&&z(r);){if(n.push(ho()({},e)),F(e),e.tokenType!==M){ho()(e,n.pop());break}if(n.push(ho()({},e)),F(e),e.tokenType!==E&&"("!==e.token){n.pop(),ho()(e,n.pop());break}ho()(e,n.pop()),n.pop(),r=ae(e),t=new h("/","divide",[t,r])}return t}function ae(e){var t,r,n,i;t=oe(e);for(var a={"%":"mod",mod:"mod"};Je(a,e.token);)n=a[r=e.token],F(e),"%"===r&&e.tokenType===N&&"("!==e.token?t=new h("/","divide",[t,new c(100)],!1,!0):(i=[t,oe(e)],t=new h(r,n,i));return t}function oe(e){var t,i,o,s={"-":"unaryMinus","+":"unaryPlus","~":"bitNot",not:"not"};return Je(s,e.token)?(o=s[e.token],t=e.token,F(e),i=[oe(e)],new h(t,o,i)):function(e){var t,i,o,s;t=function(e){var t,i,o;t=function(e){var t=[];if(e.tokenType===E&&Je(e.extraNodes,e.token)){var i=e.extraNodes[e.token];if(j(e),"("===e.token){if(t=[],U(e),j(e),")"!==e.token)for(t.push(G(e));","===e.token;)j(e),t.push(G(e));if(")"!==e.token)throw pe(e,"Parenthesis ) expected");$(e),j(e)}return new i(t)}return function(e){var t,i;if(e.tokenType===E||e.tokenType===N&&e.token in O)return i=e.token,j(e),t=Je(_,i)?new c(_[i]):-1!==T.indexOf(i)?new c(r(i,"number")):new g(i),t=se(e,t);return function(e){var t,i;if('"'===e.token)return i=ue(e),t=new c(i),t=se(e,t);return function(e){var t,i;if("'"===e.token)return i=ce(e),t=new c(i),t=se(e,t);return function(e){var t,i,o,s;if("["===e.token){if(U(e),j(e),"]"!==e.token){var u=fe(e);if(";"===e.token){for(o=1,i=[u];";"===e.token;)j(e),i[o]=fe(e),o++;if("]"!==e.token)throw pe(e,"End of matrix ] expected");$(e),j(e),s=i[0].items.length;for(var f=1;f<o;f++)if(i[f].items.length!==s)throw me(e,"Column dimensions mismatch ("+i[f].items.length+" !== "+s+")");t=new a(i)}else{if("]"!==e.token)throw pe(e,"End of matrix ] expected");$(e),j(e),t=u}}else $(e),j(e),t=new a([]);return se(e,t)}return function(e){if("{"===e.token){var t;U(e);var i={};do{if(j(e),"}"!==e.token){if('"'===e.token)t=ue(e);else if("'"===e.token)t=ce(e);else{if(!(e.tokenType===E||e.tokenType===N&&e.token in O))throw pe(e,"Symbol or string expected as object key");t=e.token,j(e)}if(":"!==e.token)throw pe(e,"Colon : expected after object key");j(e),i[t]=G(e)}}while(","===e.token);if("}"!==e.token)throw pe(e,"Comma , or bracket } expected after object value");$(e),j(e);var a=new m(i);return a=se(e,a)}return function(e){var t;if(e.tokenType===M)return t=e.token,j(e),new c(r(t,n.number));return function(e){var t;if("("===e.token){if(U(e),j(e),t=G(e),")"!==e.token)throw pe(e,"Parenthesis ) expected");return $(e),j(e),t=new d(t),t=se(e,t)}return function(e){throw""===e.token?pe(e,"Unexpected end of expression"):pe(e,"Value expected")}(e)}(e)}(e)}(e)}(e)}(e)}(e)}(e)}(e);var s={"!":"factorial","'":"ctranspose"};for(;Je(s,e.token);)i=e.token,o=s[i],j(e),t=new h(i,o,[t]),t=se(e,t);return t}(e),("^"===e.token||".^"===e.token)&&(i=e.token,o="^"===i?"pow":"dotPow",F(e),s=[t,oe(e)],t=new h(i,o,s));return t}(e)}function se(e,t,r){for(var n;!("("!==e.token&&"["!==e.token&&"."!==e.token||r&&-1===r.indexOf(e.token));)if(n=[],"("===e.token){if(!L(t)&&!C(t))return t;if(U(e),j(e),")"!==e.token)for(n.push(G(e));","===e.token;)j(e),n.push(G(e));if(")"!==e.token)throw pe(e,"Parenthesis ) expected");$(e),j(e),t=new l(t,n)}else if("["===e.token){if(U(e),j(e),"]"!==e.token)for(n.push(G(e));","===e.token;)j(e),n.push(G(e));if("]"!==e.token)throw pe(e,"Parenthesis ] expected");$(e),j(e),t=new i(t,new p(n))}else{if(j(e),e.tokenType!==E)throw pe(e,"Property name expected after dot");n.push(new c(e.token)),j(e);t=new i(t,new p(n,!0))}return t}function ue(e){for(var t="";""!==k(e)&&'"'!==k(e);)"\\"===k(e)&&(t+=k(e),q(e)),t+=k(e),q(e);if(j(e),'"'!==e.token)throw pe(e,'End of string " expected');return j(e),JSON.parse('"'+t+'"')}function ce(e){for(var t="";""!==k(e)&&"'"!==k(e);)"\\"===k(e)&&(t+=k(e),q(e)),t+=k(e),q(e);if(j(e),"'"!==e.token)throw pe(e,"End of string ' expected");return j(e),JSON.parse('"'+t+'"')}function fe(e){for(var t=[G(e)],r=1;","===e.token;)j(e),t[r]=G(e),r++;return new a(t)}function le(e){return e.index-e.token.length+1}function pe(e,t){var r=le(e),n=new SyntaxError(t+" (char "+r+")");return n.char=r,n}function me(e,t){var r=le(e),n=new SyntaxError(t+" (char "+r+")");return n.char=r,n}return x.isAlpha=function(e,t,r){return x.isValidLatinOrGreek(e)||x.isValidMathSymbol(e,r)||x.isValidMathSymbol(t,e)},x.isValidLatinOrGreek=function(e){return/^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(e)},x.isValidMathSymbol=function(e,t){return/^[\uD835]$/.test(e)&&/^[\uDC00-\uDFFF]$/.test(t)&&/^[^\uDC55\uDC9D\uDCA0\uDCA1\uDCA3\uDCA4\uDCA7\uDCA8\uDCAD\uDCBA\uDCBC\uDCC4\uDD06\uDD0B\uDD0C\uDD15\uDD1D\uDD3A\uDD3F\uDD45\uDD47-\uDD49\uDD51\uDEA6\uDEA7\uDFCC\uDFCD]$/.test(t)},x.isWhitespace=function(e,t){return" "===e||"\t"===e||"\n"===e&&t>0},x.isDecimalMark=function(e,t){return"."===e&&"/"!==t&&"*"!==t&&"^"!==t},x.isDigitDot=function(e){return e>="0"&&e<="9"||"."===e},x.isDigit=function(e){return e>="0"&&e<="9"},x.isHexDigit=function(e){return e>="0"&&e<="9"||e>="a"&&e<="f"||e>="A"&&e<="F"},x})),cu=Qe("compile",["typed","parse"],(function(e){var t=e.typed,r=e.parse;return t("compile",{string:function(e){return r(e).compile()},"Array | Matrix":function(e){return Gt(e,(function(e){return r(e).compile()}))}})})),fu=Qe("evaluate",["typed","parse"],(function(e){var t=e.typed,r=e.parse;return t("evaluate",{string:function(e){var t=dt();return r(e).compile().evaluate(t)},"string, Map | Object":function(e,t){return r(e).compile().evaluate(t)},"Array | Matrix":function(e){var t=dt();return Gt(e,(function(e){return r(e).compile().evaluate(t)}))},"Array | Matrix, Map | Object":function(e,t){return Gt(e,(function(e){return r(e).compile().evaluate(t)}))}})})),lu=Qe("Parser",["evaluate"],(function(e){var t=e.evaluate;function r(){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");Object.defineProperty(this,"scope",{value:dt(),writable:!1})}return r.prototype.type="Parser",r.prototype.isParser=!0,r.prototype.evaluate=function(e){return t(e,this.scope)},r.prototype.get=function(e){if(this.scope.has(e))return this.scope.get(e)},r.prototype.getAll=function(){return function(e){if(e instanceof ht)return e.wrappedObject;var t,r={},n=pt(e.keys());try{for(n.s();!(t=n.n()).done;){var i=t.value;ot(r,i,e.get(i))}}catch(e){n.e(e)}finally{n.f()}return r}(this.scope)},r.prototype.getAllAsMap=function(){return this.scope},r.prototype.set=function(e,t){return this.scope.set(e,t),t},r.prototype.remove=function(e){this.scope.delete(e)},r.prototype.clear=function(){this.scope.clear()},r}),{isClass:!0}),pu=Qe("parser",["typed","Parser"],(function(e){var t=e.typed,r=e.Parser;return t("parser",{"":function(){return new r}})})),mu=Qe("lup",["typed","matrix","abs","addScalar","divideScalar","multiplyScalar","subtract","larger","equalScalar","unaryMinus","DenseMatrix","SparseMatrix","Spa"],(function(e){var t=e.typed,r=e.matrix,n=e.abs,i=e.addScalar,a=e.divideScalar,o=e.multiplyScalar,s=e.subtract,u=e.larger,c=e.equalScalar,f=e.unaryMinus,l=e.DenseMatrix,p=e.SparseMatrix,m=e.Spa;return t("lup",{DenseMatrix:function(e){return h(e)},SparseMatrix:function(e){return d(e)},Array:function(e){var t=h(r(e));return{L:t.L.valueOf(),U:t.U.valueOf(),p:t.p}}});function h(e){var t,r,f,p=e._size[0],m=e._size[1],h=Math.min(p,m),d=He(e._data),v=[],y=[p,h],g=[],x=[h,m],b=[];for(t=0;t<p;t++)b[t]=t;for(r=0;r<m;r++){if(r>0)for(t=0;t<p;t++){var w=Math.min(t,r),N=0;for(f=0;f<w;f++)N=i(N,o(d[t][f],d[f][r]));d[t][r]=s(d[t][r],N)}var M=r,E=0,S=0;for(t=r;t<p;t++){var A=d[t][r],O=n(A);u(O,E)&&(M=t,E=O,S=A)}if(r!==M&&(b[r]=[b[M],b[M]=b[r]][0],l._swapRows(r,M,d)),r<p)for(t=r+1;t<p;t++){var C=d[t][r];c(C,0)||(d[t][r]=a(d[t][r],S))}}for(r=0;r<m;r++)for(t=0;t<p;t++)0===r&&(t<m&&(g[t]=[]),v[t]=[]),t<r?(t<m&&(g[t][r]=d[t][r]),r<p&&(v[t][r]=0)):t!==r?(t<m&&(g[t][r]=0),r<p&&(v[t][r]=d[t][r])):(t<m&&(g[t][r]=d[t][r]),r<p&&(v[t][r]=1));var _=new l({data:v,size:y}),T=new l({data:g,size:x}),I=[];for(t=0,h=b.length;t<h;t++)I[b[t]]=t;return{L:_,U:T,p:I,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}function d(e){var t,r,i,s=e._size[0],l=e._size[1],h=Math.min(s,l),d=e._values,v=e._index,y=e._ptr,g=[],x=[],b=[],w=[s,h],N=[],M=[],E=[],S=[h,l],A=[],O=[];for(t=0;t<s;t++)A[t]=t,O[t]=t;var C=function(){var e=new m;r<s&&(b.push(g.length),g.push(1),x.push(r)),E.push(N.length);var l=y[r],h=y[r+1];for(i=l;i<h;i++)t=v[i],e.set(A[t],d[i]);r>0&&e.forEach(0,r-1,(function(t,r){p._forEachRow(t,g,x,b,(function(n,i){n>t&&e.accumulate(n,f(o(i,r)))}))}));var C,_,T,I,k=r,z=e.get(r),q=n(z);e.forEach(r+1,s-1,(function(e,t){var r=n(t);u(r,q)&&(k=e,q=r,z=t)})),r!==k&&(p._swapRows(r,k,w[1],g,x,b),p._swapRows(r,k,S[1],N,M,E),e.swap(r,k),_=k,T=O[C=r],I=O[_],A[T]=_,A[I]=C,O[C]=I,O[_]=T),e.forEach(0,s-1,(function(e,t){e<=r?(N.push(t),M.push(e)):(t=a(t,z),c(t,0)||(g.push(t),x.push(e)))}))};for(r=0;r<l;r++)C();return E.push(N.length),b.push(g.length),{L:new p({values:g,index:x,ptr:b,size:w}),U:new p({values:N,index:M,ptr:E,size:S}),p:A,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}})),hu=Qe("qr",["typed","matrix","zeros","identity","isZero","equal","sign","sqrt","conj","unaryMinus","addScalar","divideScalar","multiplyScalar","subtract","complex"],(function(e){var t=e.typed,r=e.matrix,n=e.zeros,i=e.identity,a=e.isZero,o=e.equal,s=e.sign,u=e.sqrt,c=e.conj,f=e.unaryMinus,l=e.addScalar,p=e.divideScalar,m=e.multiplyScalar,h=e.subtract,d=e.complex;return ho()(t("qr",{DenseMatrix:function(e){return y(e)},SparseMatrix:function(e){return function(e){throw new Error("qr not implemented for sparse matrices yet")}()},Array:function(e){var t=y(r(e));return{Q:t.Q.valueOf(),R:t.R.valueOf()}}}),{_denseQRimpl:v});function v(e){var t,r,d,v=e._size[0],y=e._size[1],g=i([v],"dense"),x=g._data,b=e.clone(),w=b._data,N=n([v],"");for(d=0;d<Math.min(y,v);++d){var M=w[d][d],E=f(o(M,0)?1:s(M)),S=c(E),A=0;for(t=d;t<v;t++)A=l(A,m(w[t][d],c(w[t][d])));var O=m(E,u(A));if(!a(O)){var C=h(M,O);for(N[d]=1,t=d+1;t<v;t++)N[t]=p(w[t][d],C);var _=f(c(p(C,O))),T=void 0;for(r=d;r<y;r++){for(T=0,t=d;t<v;t++)T=l(T,m(c(N[t]),w[t][r]));for(T=m(T,_),t=d;t<v;t++)w[t][r]=m(h(w[t][r],m(N[t],T)),S)}for(t=0;t<v;t++){for(T=0,r=d;r<v;r++)T=l(T,m(x[t][r],N[r]));for(T=m(T,_),r=d;r<v;++r)x[t][r]=p(h(x[t][r],m(T,c(N[r]))),S)}}}return{Q:g,R:b,toString:function(){return"Q: "+this.Q.toString()+"\nR: "+this.R.toString()}}}function y(e){var t=v(e),r=t.R._data;if(e._data.length>0)for(var n="Complex"===r[0][0].type?d(0):0,i=0;i<r.length;++i)for(var a=0;a<i&&a<(r[0]||[]).length;++a)r[i][a]=n;return t}}));function du(e,t,r,n,i,a,o){var s=0;for(r[o]=e;s>=0;){var u=r[o+s],c=r[n+u];-1===c?(s--,a[t++]=u):(r[n+u]=r[i+c],r[o+ ++s]=c)}return t}function vu(e){return-e-2}var yu=Qe("csAmd",["add","multiply","transpose"],(function(e){var t=e.add,r=e.multiply,n=e.transpose;return function(e,o){if(!o||e<=0||e>3)return null;var s=o._size,u=s[0],c=s[1],f=0,l=Math.max(16,10*Math.sqrt(c)),p=function(e,i,a,o,s){var u=n(i);if(1===e&&o===a)return t(i,u);if(2===e){for(var c=u._index,f=u._ptr,l=0,p=0;p<a;p++){var m=f[p];if(f[p]=l,!(f[p+1]-m>s))for(var h=f[p+1];m<h;m++)c[l++]=c[m]}return f[a]=l,i=n(u),r(u,i)}return r(u,i)}(e,o,u,c,l=Math.min(c-2,l));!function(e,t,r){for(var n=e._values,i=e._index,a=e._ptr,o=e._size[1],s=0,u=0;u<o;u++){var c=a[u];for(a[u]=s;c<a[u+1];c++)t(i[c],u,n?n[c]:1,r)&&(i[s]=i[c],n&&(n[s]=n[c]),s++)}a[o]=s,i.splice(s,i.length-s),n&&n.splice(s,n.length-s)}(p,a,null);for(var m,h,d,v,y,g,x,b,w,N,M,E,S,A,O,C,_=p._index,T=p._ptr,I=T[c],k=[],z=[],q=c+1,R=2*(c+1),B=3*(c+1),D=4*(c+1),j=5*(c+1),P=6*(c+1),F=7*(c+1),U=k,L=function(e,t,r,n,a,o,s,u,c,f,l,p){for(var m=0;m<e;m++)r[n+m]=t[m+1]-t[m];r[n+e]=0;for(var h=0;h<=e;h++)r[a+h]=-1,o[h]=-1,r[s+h]=-1,r[u+h]=-1,r[c+h]=1,r[f+h]=1,r[l+h]=0,r[p+h]=r[n+h];var d=i(0,0,r,f,e);return r[l+e]=-2,t[e]=-1,r[f+e]=0,d}(c,T,z,0,B,U,R,F,q,P,D,j),$=function(e,t,r,n,i,a,o,s,u,c,f){for(var l=0,p=0;p<e;p++){var m=r[n+p];if(0===m)r[i+p]=-2,l++,t[p]=-1,r[a+p]=0;else if(m>o)r[s+p]=0,r[i+p]=-1,l++,t[p]=vu(e),r[s+e]++;else{var h=r[u+m];-1!==h&&(c[h]=p),r[f+p]=r[u+m],r[u+m]=p}}return l}(c,T,z,j,D,P,l,q,B,U,R),H=0;$<c;){for(d=-1;H<c&&-1===(d=z[B+H]);H++);-1!==z[R+d]&&(U[z[R+d]]=-1),z[B+H]=z[R+d];var G=z[D+d],V=z[q+d];$+=V;var Z=0;z[q+d]=-V;var W=T[d],Y=0===G?W:I,J=Y;for(v=1;v<=G+1;v++){for(v>G?(g=d,x=W,b=z[0+d]-G):(x=T[g=_[W++]],b=z[0+g]),y=1;y<=b;y++)(w=z[q+(m=_[x++])])<=0||(Z+=w,z[q+m]=-w,_[J++]=m,-1!==z[R+m]&&(U[z[R+m]]=U[m]),-1!==U[m]?z[R+U[m]]=z[R+m]:z[B+z[j+m]]=z[R+m]);g!==d&&(T[g]=vu(d),z[P+g]=0)}for(0!==G&&(I=J),z[j+d]=Z,T[d]=Y,z[0+d]=J-Y,z[D+d]=-2,L=i(L,f,z,P,c),N=Y;N<J;N++)if(!((M=z[D+(m=_[N])])<=0)){var X=L-(w=-z[q+m]);for(W=T[m],E=T[m]+M-1;W<=E;W++)z[P+(g=_[W])]>=L?z[P+g]-=w:0!==z[P+g]&&(z[P+g]=z[j+g]+X)}for(N=Y;N<J;N++){for(S=(E=T[m=_[N]])+z[D+m]-1,A=E,O=0,C=0,W=E;W<=S;W++)if(0!==z[P+(g=_[W])]){var Q=z[P+g]-L;Q>0?(C+=Q,_[A++]=g,O+=g):(T[g]=vu(d),z[P+g]=0)}z[D+m]=A-E+1;var K=A,ee=E+z[0+m];for(W=S+1;W<ee;W++){var te=z[q+(h=_[W])];te<=0||(C+=te,_[A++]=h,O+=h)}0===C?(T[m]=vu(d),Z-=w=-z[q+m],V+=w,$+=w,z[q+m]=0,z[D+m]=-1):(z[j+m]=Math.min(z[j+m],C),_[A]=_[K],_[K]=_[E],_[E]=d,z[0+m]=A-E+1,O=(O<0?-O:O)%c,z[R+m]=z[F+O],z[F+O]=m,U[m]=O)}for(z[j+d]=Z,L=i(L+(f=Math.max(f,Z)),f,z,P,c),N=Y;N<J;N++)if(!(z[q+(m=_[N])]>=0))for(m=z[F+(O=U[m])],z[F+O]=-1;-1!==m&&-1!==z[R+m];m=z[R+m],L++){for(b=z[0+m],M=z[D+m],W=T[m]+1;W<=T[m]+b-1;W++)z[P+_[W]]=L;var re=m;for(h=z[R+m];-1!==h;){var ne=z[0+h]===b&&z[D+h]===M;for(W=T[h]+1;ne&&W<=T[h]+b-1;W++)z[P+_[W]]!==L&&(ne=0);ne?(T[h]=vu(m),z[q+m]+=z[q+h],z[q+h]=0,z[D+h]=-1,h=z[R+h],z[R+re]=h):(re=h,h=z[R+h])}}for(W=Y,N=Y;N<J;N++)(w=-z[q+(m=_[N])])<=0||(z[q+m]=w,C=z[j+m]+Z-w,-1!==z[B+(C=Math.min(C,c-$-w))]&&(U[z[B+C]]=m),z[R+m]=z[B+C],U[m]=-1,z[B+C]=m,H=Math.min(H,C),z[j+m]=C,_[W++]=m);z[q+d]=V,0==(z[0+d]=W-Y)&&(T[d]=-1,z[P+d]=0),0!==G&&(I=W)}for(m=0;m<c;m++)T[m]=vu(T[m]);for(h=0;h<=c;h++)z[B+h]=-1;for(h=c;h>=0;h--)z[q+h]>0||(z[R+h]=z[B+T[h]],z[B+T[h]]=h);for(g=c;g>=0;g--)z[q+g]<=0||-1!==T[g]&&(z[R+g]=z[B+T[g]],z[B+T[g]]=g);for(d=0,m=0;m<=c;m++)-1===T[m]&&(d=du(m,d,z,B,R,k,P));return k.splice(k.length-1,1),k};function i(e,t,r,n,i){if(e<2||e+t<0){for(var a=0;a<i;a++)0!==r[n+a]&&(r[n+a]=1);e=2}return e}function a(e,t){return e!==t}}));function gu(e,t,r,n,i,a,o){var s,u,c,f=0;if(e<=t||r[n+t]<=r[i+e])return-1;r[i+e]=r[n+t];var l=r[a+e];if(r[a+e]=t,-1===l)f=1,c=e;else{for(f=2,c=l;c!==r[o+c];c=r[o+c]);for(s=l;s!==c;s=u)u=r[o+s],r[o+s]=c}return{jleaf:f,q:c}}var xu=Qe("csCounts",["transpose"],(function(e){var t=e.transpose;return function(e,r,n,i){if(!e||!r||!n)return null;var a,o,s,u,c,f,l,p=e._size,m=p[0],h=p[1],d=4*h+(i?h+m+1:0),v=[],y=h,g=2*h,x=3*h,b=4*h,w=5*h+1;for(s=0;s<d;s++)v[s]=-1;var N=[],M=t(e),E=M._index,S=M._ptr;for(s=0;s<h;s++)for(N[o=n[s]]=-1===v[x+o]?1:0;-1!==o&&-1===v[x+o];o=r[o])v[x+o]=s;if(i){for(s=0;s<h;s++)v[n[s]]=s;for(a=0;a<m;a++){for(s=h,f=S[a],l=S[a+1],c=f;c<l;c++)s=Math.min(s,v[E[c]]);v[w+a]=v[b+s],v[b+s]=a}}for(a=0;a<h;a++)v[0+a]=a;for(s=0;s<h;s++){for(-1!==r[o=n[s]]&&N[r[o]]--,u=i?v[b+s]:o;-1!==u;u=i?v[w+u]:-1)for(c=S[u];c<S[u+1];c++){var A=gu(a=E[c],o,v,x,y,g,0);A.jleaf>=1&&N[o]++,2===A.jleaf&&N[A.q]--}-1!==r[o]&&(v[0+o]=r[o])}for(o=0;o<h;o++)-1!==r[o]&&(N[r[o]]+=N[o]);return N}})),bu=Qe("csSqr",["add","multiply","transpose"],(function(e){var t=e.add,r=e.multiply,n=e.transpose,i=yu({add:t,multiply:r,transpose:n}),a=xu({transpose:n});return function(e,t,r){var n,o=t._ptr,s=t._size[1],u={};if(u.q=i(e,t),e&&!u.q)return null;if(r){var c=e?function(e,t,r,n){for(var i=e._values,a=e._index,o=e._ptr,s=e._size,u=e._datatype,c=s[0],f=s[1],l=n&&e._values?[]:null,p=[],m=[],h=0,d=0;d<f;d++){m[d]=h;for(var v=r?r[d]:d,y=o[v],g=o[v+1],x=y;x<g;x++){var b=t?t[a[x]]:a[x];p[h]=b,l&&(l[h]=i[x]),h++}}return m[f]=h,e.createSparseMatrix({values:l,index:p,ptr:m,size:[c,f],datatype:u})}(t,null,u.q,0):t;u.parent=function(e,t){if(!e)return null;var r,n,i=e._index,a=e._ptr,o=e._size,s=o[0],u=o[1],c=[],f=[],l=u;if(t)for(r=0;r<s;r++)f[l+r]=-1;for(var p=0;p<u;p++){c[p]=-1,f[0+p]=-1;for(var m=a[p],h=a[p+1],d=m;d<h;d++){var v=i[d];for(r=t?f[l+v]:v;-1!==r&&r<p;r=n)n=f[0+r],f[0+r]=p,-1===n&&(c[r]=p);t&&(f[l+v]=p)}}return c}(c,1);var f=function(e,t){if(!e)return null;var r,n=0,i=[],a=[],o=t,s=2*t;for(r=0;r<t;r++)a[0+r]=-1;for(r=t-1;r>=0;r--)-1!==e[r]&&(a[o+r]=a[0+e[r]],a[0+e[r]]=r);for(r=0;r<t;r++)-1===e[r]&&(n=du(r,n,a,0,o,i,s));return i}(u.parent,s);if(u.cp=a(c,u.parent,f,1),c&&u.parent&&u.cp&&function(e,t){var r=e._ptr,n=e._index,i=e._size,a=i[0],o=i[1];t.pinv=[],t.leftmost=[];var s,u,c,f,l,p=t.parent,m=t.pinv,h=t.leftmost,d=[],v=a,y=a+o,g=a+2*o;for(u=0;u<o;u++)d[v+u]=-1,d[y+u]=-1,d[g+u]=0;for(s=0;s<a;s++)h[s]=-1;for(u=o-1;u>=0;u--)for(f=r[u],l=r[u+1],c=f;c<l;c++)h[n[c]]=u;for(s=a-1;s>=0;s--)m[s]=-1,-1!==(u=h[s])&&(0==d[g+u]++&&(d[y+u]=s),d[0+s]=d[v+u],d[v+u]=s);for(t.lnz=0,t.m2=a,u=0;u<o;u++)if(s=d[v+u],t.lnz++,s<0&&(s=t.m2++),m[s]=u,!(--g[u]<=0)){t.lnz+=d[g+u];var x=p[u];-1!==x&&(0===d[g+x]&&(d[y+x]=d[y+u]),d[0+d[y+u]]=d[v+x],d[v+x]=d[0+s],d[g+x]+=d[g+u])}for(s=0;s<a;s++)m[s]<0&&(m[s]=u++);return!0}(c,u))for(u.unz=0,n=0;n<s;n++)u.unz+=u.cp[n]}else u.unz=4*o[s]+s,u.lnz=u.unz;return u}}));function wu(e,t){return e[t]<0}function Nu(e,t){e[t]=vu(e[t])}function Mu(e){return e<0?vu(e):e}function Eu(e,t,r,n,i){var a,o,s,u=t._index,c=t._ptr,f=t._size[1],l=0;for(n[0]=e;l>=0;){e=n[l];var p=i?i[e]:e;wu(c,e)||(Nu(c,e),n[f+l]=p<0?0:Mu(c[p]));var m=1;for(o=n[f+l],s=p<0?0:Mu(c[p+1]);o<s;o++)if(!wu(c,a=u[o])){n[f+l]=o,n[++l]=a,m=0;break}m&&(l--,n[--r]=e)}return r}var Su=Qe("csSpsolve",["divideScalar","multiply","subtract"],(function(e){var t=e.divideScalar,r=e.multiply,n=e.subtract;return function(e,i,a,o,s,u,c){var f,l,p,m,h=e._values,d=e._index,v=e._ptr,y=e._size[1],g=i._values,x=i._index,b=i._ptr,w=function(e,t,r,n,i){var a,o,s,u=e._ptr,c=e._size,f=t._index,l=t._ptr,p=c[1],m=p;for(o=l[r],s=l[r+1],a=o;a<s;a++){var h=f[a];wu(u,h)||(m=Eu(h,e,m,n,i))}for(a=m;a<p;a++)Nu(u,n[a]);return m}(e,i,a,o,u);for(f=w;f<y;f++)s[o[f]]=0;for(l=b[a],p=b[a+1],f=l;f<p;f++)s[x[f]]=g[f];for(var N=w;N<y;N++){var M=o[N],E=u?u[M]:M;if(!(E<0))for(l=v[E],p=v[E+1],s[M]=t(s[M],h[c?l:p-1]),f=c?l+1:l,m=c?p:p-1;f<m;f++){var S=d[f];s[S]=n(s[S],r(h[f],s[M]))}}return w}})),Au=Qe("csLu",["abs","divideScalar","multiply","subtract","larger","largerEq","SparseMatrix"],(function(e){var t=e.abs,r=e.divideScalar,n=e.multiply,i=e.subtract,a=e.larger,o=e.largerEq,s=e.SparseMatrix,u=Su({divideScalar:r,multiply:n,subtract:i});return function(e,i,c){if(!e)return null;var f,l=e._size[1],p=100,m=100;i&&(f=i.q,p=i.lnz||p,m=i.unz||m);var h,d,v=[],y=[],g=[],x=new s({values:v,index:y,ptr:g,size:[l,l]}),b=[],w=[],N=[],M=new s({values:b,index:w,ptr:N,size:[l,l]}),E=[],S=[],A=[];for(h=0;h<l;h++)S[h]=0,E[h]=-1,g[h+1]=0;p=0,m=0;for(var O=0;O<l;O++){g[O]=p,N[O]=m;var C=f?f[O]:O,_=u(x,e,C,A,S,E,1),T=-1,I=-1;for(d=_;d<l;d++)if(E[h=A[d]]<0){var k=t(S[h]);a(k,I)&&(I=k,T=h)}else w[m]=E[h],b[m++]=S[h];if(-1===T||I<=0)return null;E[C]<0&&o(t(S[C]),n(I,c))&&(T=C);var z=S[T];for(w[m]=O,b[m++]=z,E[T]=O,y[p]=T,v[p++]=1,d=_;d<l;d++)E[h=A[d]]<0&&(y[p]=h,v[p++]=r(S[h],z)),S[h]=0}for(g[l]=p,N[l]=m,d=0;d<p;d++)y[d]=E[y[d]];return v.splice(p,v.length-p),y.splice(p,y.length-p),b.splice(m,b.length-m),w.splice(m,w.length-m),{L:x,U:M,pinv:E}}})),Ou=Qe("slu",["typed","abs","add","multiply","transpose","divideScalar","subtract","larger","largerEq","SparseMatrix"],(function(e){var t=e.typed,r=e.abs,n=e.add,i=e.multiply,a=e.transpose,o=e.divideScalar,s=e.subtract,u=e.larger,c=e.largerEq,f=e.SparseMatrix,l=bu({add:n,multiply:i,transpose:a}),p=Au({abs:r,divideScalar:o,multiply:i,subtract:s,larger:u,largerEq:c,SparseMatrix:f});return t("slu",{"SparseMatrix, number, number":function(e,t,r){if(!Z(t)||t<0||t>3)throw new Error("Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]");if(r<0||r>1)throw new Error("Partial pivoting threshold must be a number from 0 to 1");var n=l(t,e,!1),i=p(e,n,r);return{L:i.L,U:i.U,p:i.pinv,q:n.q,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\np: "+this.p.toString()+(this.q?"\nq: "+this.q.toString():"")+"\n"}}}})}));function Cu(e,t){var r,n=t.length,i=[];if(e)for(r=0;r<n;r++)i[e[r]]=t[r];else for(r=0;r<n;r++)i[r]=t[r];return i}var _u=["typed","matrix","lup","slu","usolve","lsolve","DenseMatrix"],Tu=Qe("lusolve",_u,(function(e){var t=e.typed,r=e.matrix,n=e.lup,i=e.slu,a=e.usolve,o=e.lsolve,s=qa({DenseMatrix:e.DenseMatrix});return t("lusolve",{"Array, Array | Matrix":function(e,t){e=r(e);var i=n(e);return c(i.L,i.U,i.p,null,t).valueOf()},"DenseMatrix, Array | Matrix":function(e,t){var r=n(e);return c(r.L,r.U,r.p,null,t)},"SparseMatrix, Array | Matrix":function(e,t){var r=n(e);return c(r.L,r.U,r.p,null,t)},"SparseMatrix, Array | Matrix, number, number":function(e,t,r,n){var a=i(e,r,n);return c(a.L,a.U,a.p,a.q,t)},"Object, Array | Matrix":function(e,t){return c(e.L,e.U,e.p,e.q,t)}});function u(e){if(m(e))return e;if(p(e))return r(e);throw new TypeError("Invalid Matrix LU decomposition")}function c(e,t,r,n,i){e=u(e),t=u(t),r&&((i=s(e,i,!0))._data=Cu(r,i._data));var c=o(e,i),f=a(t,c);return n&&(f._data=Cu(n,f._data)),f}})),Iu=["parse"],ku=Qe("Help",Iu,(function(e){var t=e.parse;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!e)throw new Error('Argument "doc" missing');this.doc=e}return r.prototype.type="Help",r.prototype.isHelp=!0,r.prototype.toString=function(){var e=this.doc||{},r="\n";if(e.name&&(r+="Name: "+e.name+"\n\n"),e.category&&(r+="Category: "+e.category+"\n\n"),e.description&&(r+="Description:\n    "+e.description+"\n\n"),e.syntax&&(r+="Syntax:\n    "+e.syntax.join("\n    ")+"\n\n"),e.examples){r+="Examples:\n";for(var n={},i=0;i<e.examples.length;i++){var a=e.examples[i];r+="    "+a+"\n";var o=void 0;try{o=t(a).compile().evaluate(n)}catch(e){o=e}void 0===o||w(o)||(r+="        "+xe(o,{precision:14})+"\n")}r+="\n"}return e.mayThrow&&e.mayThrow.length&&(r+="Throws: "+e.mayThrow.join(", ")+"\n\n"),e.seealso&&e.seealso.length&&(r+="See also: "+e.seealso.join(", ")+"\n"),r},r.prototype.toJSON=function(){var e=He(this.doc);return e.mathjs="Help",e},r.fromJSON=function(e){var t={};return Object.keys(e).filter((function(e){return"mathjs"!==e})).forEach((function(r){t[r]=e[r]})),new r(t)},r.prototype.valueOf=r.prototype.toString,r}),{isClass:!0}),zu=["?on","math"],qu=Qe("Chain",zu,(function(e){var t=e.on,r=e.math;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");$(e)?this.value=e.value:this.value=e}function i(e,t){Ye(n.prototype,e,(function(){var e=t();if("function"==typeof e)return a(e)}))}function a(e){return function(){for(var t=[this.value],r=0;r<arguments.length;r++)t[r+1]=arguments[r];return new n(e.apply(e,t))}}n.prototype.type="Chain",n.prototype.isChain=!0,n.prototype.done=function(){return this.value},n.prototype.valueOf=function(){return this.value},n.prototype.toString=function(){return xe(this.value)},n.prototype.toJSON=function(){return{mathjs:"Chain",value:this.value}},n.fromJSON=function(e){return new n(e.value)},n.createProxy=function(e,t){if("string"==typeof e)u=e,"function"==typeof(c=t)&&(n.prototype[u]=a(c));else{var r=function(t){Je(e,t)&&void 0===o[t]&&i(t,(function(){return e[t]}))};for(var s in e)r(s)}var u,c};var o={expression:!0,docs:!0,type:!0,classes:!0,json:!0,error:!0,isChain:!0};return n.createProxy(r),t&&t("import",(function(e,t,r){r||i(e,t)})),n}),{isClass:!0}),Ru={name:"e",category:"Constants",syntax:["e"],description:"Euler's number, the base of the natural logarithm. Approximately equal to 2.71828",examples:["e","e ^ 2","exp(2)","log(e)"],seealso:["exp"]},Bu={name:"pi",category:"Constants",syntax:["pi"],description:"The number pi is a mathematical constant that is the ratio of a circle's circumference to its diameter, and is approximately equal to 3.14159",examples:["pi","sin(pi/2)"],seealso:["tau"]},Du={bignumber:{name:"bignumber",category:"Construction",syntax:["bignumber(x)"],description:"Create a big number from a number or string.",examples:["0.1 + 0.2","bignumber(0.1) + bignumber(0.2)",'bignumber("7.2")','bignumber("7.2e500")',"bignumber([0.1, 0.2, 0.3])"],seealso:["boolean","complex","fraction","index","matrix","string","unit"]},boolean:{name:"boolean",category:"Construction",syntax:["x","boolean(x)"],description:"Convert a string or number into a boolean.",examples:["boolean(0)","boolean(1)","boolean(3)",'boolean("true")','boolean("false")',"boolean([1, 0, 1, 1])"],seealso:["bignumber","complex","index","matrix","number","string","unit"]},complex:{name:"complex",category:"Construction",syntax:["complex()","complex(re, im)","complex(string)"],description:"Create a complex number.",examples:["complex()","complex(2, 3)",'complex("7 - 2i")'],seealso:["bignumber","boolean","index","matrix","number","string","unit"]},createUnit:{name:"createUnit",category:"Construction",syntax:["createUnit(definitions)","createUnit(name, definition)"],description:"Create a user-defined unit and register it with the Unit type.",examples:['createUnit("foo")','createUnit("knot", {definition: "0.514444444 m/s", aliases: ["knots", "kt", "kts"]})','createUnit("mph", "1 mile/hour")'],seealso:["unit","splitUnit"]},fraction:{name:"fraction",category:"Construction",syntax:["fraction(num)","fraction(matrix)","fraction(num,den)","fraction({n: num, d: den})"],description:"Create a fraction from a number or from integer numerator and denominator.",examples:["fraction(0.125)","fraction(1, 3) + fraction(2, 5)","fraction({n: 333, d: 53})","fraction([sqrt(9), sqrt(10), sqrt(11)])"],seealso:["bignumber","boolean","complex","index","matrix","string","unit"]},index:{name:"index",category:"Construction",syntax:["[start]","[start:end]","[start:step:end]","[start1, start 2, ...]","[start1:end1, start2:end2, ...]","[start1:step1:end1, start2:step2:end2, ...]"],description:"Create an index to get or replace a subset of a matrix",examples:["[]","[1, 2, 3]","A = [1, 2, 3; 4, 5, 6]","A[1, :]","A[1, 2] = 50","A[0:2, 0:2] = ones(2, 2)"],seealso:["bignumber","boolean","complex","matrix,","number","range","string","unit"]},matrix:{name:"matrix",category:"Construction",syntax:["[]","[a1, b1, ...; a2, b2, ...]","matrix()",'matrix("dense")',"matrix([...])"],description:"Create a matrix.",examples:["[]","[1, 2, 3]","[1, 2, 3; 4, 5, 6]","matrix()","matrix([3, 4])",'matrix([3, 4; 5, 6], "sparse")','matrix([3, 4; 5, 6], "sparse", "number")'],seealso:["bignumber","boolean","complex","index","number","string","unit","sparse"]},number:{name:"number",category:"Construction",syntax:["x","number(x)","number(unit, valuelessUnit)"],description:"Create a number or convert a string or boolean into a number.",examples:["2","2e3","4.05","number(2)",'number("7.2")',"number(true)","number([true, false, true, true])",'number(unit("52cm"), "m")'],seealso:["bignumber","boolean","complex","fraction","index","matrix","string","unit"]},sparse:{name:"sparse",category:"Construction",syntax:["sparse()","sparse([a1, b1, ...; a1, b2, ...])",'sparse([a1, b1, ...; a1, b2, ...], "number")'],description:"Create a sparse matrix.",examples:["sparse()","sparse([3, 4; 5, 6])",'sparse([3, 0; 5, 0], "number")'],seealso:["bignumber","boolean","complex","index","number","string","unit","matrix"]},splitUnit:{name:"splitUnit",category:"Construction",syntax:["splitUnit(unit: Unit, parts: Unit[])"],description:"Split a unit in an array of units whose sum is equal to the original unit.",examples:['splitUnit(1 m, ["feet", "inch"])'],seealso:["unit","createUnit"]},string:{name:"string",category:"Construction",syntax:['"text"',"string(x)"],description:"Create a string or convert a value to a string",examples:['"Hello World!"',"string(4.2)","string(3 + 2i)"],seealso:["bignumber","boolean","complex","index","matrix","number","unit"]},unit:{name:"unit",category:"Construction",syntax:["value unit","unit(value, unit)","unit(string)"],description:"Create a unit.",examples:["5.5 mm","3 inch",'unit(7.1, "kilogram")','unit("23 deg")'],seealso:["bignumber","boolean","complex","index","matrix","number","string"]},e:Ru,E:Ru,false:{name:"false",category:"Constants",syntax:["false"],description:"Boolean value false",examples:["false"],seealso:["true"]},i:{name:"i",category:"Constants",syntax:["i"],description:"Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.",examples:["i","i * i","sqrt(-1)"],seealso:[]},Infinity:{name:"Infinity",category:"Constants",syntax:["Infinity"],description:"Infinity, a number which is larger than the maximum number that can be handled by a floating point number.",examples:["Infinity","1 / 0"],seealso:[]},LN2:{name:"LN2",category:"Constants",syntax:["LN2"],description:"Returns the natural logarithm of 2, approximately equal to 0.693",examples:["LN2","log(2)"],seealso:[]},LN10:{name:"LN10",category:"Constants",syntax:["LN10"],description:"Returns the natural logarithm of 10, approximately equal to 2.302",examples:["LN10","log(10)"],seealso:[]},LOG2E:{name:"LOG2E",category:"Constants",syntax:["LOG2E"],description:"Returns the base-2 logarithm of E, approximately equal to 1.442",examples:["LOG2E","log(e, 2)"],seealso:[]},LOG10E:{name:"LOG10E",category:"Constants",syntax:["LOG10E"],description:"Returns the base-10 logarithm of E, approximately equal to 0.434",examples:["LOG10E","log(e, 10)"],seealso:[]},NaN:{name:"NaN",category:"Constants",syntax:["NaN"],description:"Not a number",examples:["NaN","0 / 0"],seealso:[]},null:{name:"null",category:"Constants",syntax:["null"],description:"Value null",examples:["null"],seealso:["true","false"]},pi:Bu,PI:Bu,phi:{name:"phi",category:"Constants",syntax:["phi"],description:"Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...",examples:["phi"],seealso:[]},SQRT1_2:{name:"SQRT1_2",category:"Constants",syntax:["SQRT1_2"],description:"Returns the square root of 1/2, approximately equal to 0.707",examples:["SQRT1_2","sqrt(1/2)"],seealso:[]},SQRT2:{name:"SQRT2",category:"Constants",syntax:["SQRT2"],description:"Returns the square root of 2, approximately equal to 1.414",examples:["SQRT2","sqrt(2)"],seealso:[]},tau:{name:"tau",category:"Constants",syntax:["tau"],description:"Tau is the ratio constant of a circle's circumference to radius, equal to 2 * pi, approximately 6.2832.",examples:["tau","2 * pi"],seealso:["pi"]},true:{name:"true",category:"Constants",syntax:["true"],description:"Boolean value true",examples:["true"],seealso:["false"]},version:{name:"version",category:"Constants",syntax:["version"],description:"A string with the version number of math.js",examples:["version"],seealso:[]},speedOfLight:{description:"Speed of light in vacuum",examples:["speedOfLight"]},gravitationConstant:{description:"Newtonian constant of gravitation",examples:["gravitationConstant"]},planckConstant:{description:"Planck constant",examples:["planckConstant"]},reducedPlanckConstant:{description:"Reduced Planck constant",examples:["reducedPlanckConstant"]},magneticConstant:{description:"Magnetic constant (vacuum permeability)",examples:["magneticConstant"]},electricConstant:{description:"Electric constant (vacuum permeability)",examples:["electricConstant"]},vacuumImpedance:{description:"Characteristic impedance of vacuum",examples:["vacuumImpedance"]},coulomb:{description:"Coulomb's constant",examples:["coulomb"]},elementaryCharge:{description:"Elementary charge",examples:["elementaryCharge"]},bohrMagneton:{description:"Borh magneton",examples:["bohrMagneton"]},conductanceQuantum:{description:"Conductance quantum",examples:["conductanceQuantum"]},inverseConductanceQuantum:{description:"Inverse conductance quantum",examples:["inverseConductanceQuantum"]},magneticFluxQuantum:{description:"Magnetic flux quantum",examples:["magneticFluxQuantum"]},nuclearMagneton:{description:"Nuclear magneton",examples:["nuclearMagneton"]},klitzing:{description:"Von Klitzing constant",examples:["klitzing"]},bohrRadius:{description:"Borh radius",examples:["bohrRadius"]},classicalElectronRadius:{description:"Classical electron radius",examples:["classicalElectronRadius"]},electronMass:{description:"Electron mass",examples:["electronMass"]},fermiCoupling:{description:"Fermi coupling constant",examples:["fermiCoupling"]},fineStructure:{description:"Fine-structure constant",examples:["fineStructure"]},hartreeEnergy:{description:"Hartree energy",examples:["hartreeEnergy"]},protonMass:{description:"Proton mass",examples:["protonMass"]},deuteronMass:{description:"Deuteron Mass",examples:["deuteronMass"]},neutronMass:{description:"Neutron mass",examples:["neutronMass"]},quantumOfCirculation:{description:"Quantum of circulation",examples:["quantumOfCirculation"]},rydberg:{description:"Rydberg constant",examples:["rydberg"]},thomsonCrossSection:{description:"Thomson cross section",examples:["thomsonCrossSection"]},weakMixingAngle:{description:"Weak mixing angle",examples:["weakMixingAngle"]},efimovFactor:{description:"Efimov factor",examples:["efimovFactor"]},atomicMass:{description:"Atomic mass constant",examples:["atomicMass"]},avogadro:{description:"Avogadro's number",examples:["avogadro"]},boltzmann:{description:"Boltzmann constant",examples:["boltzmann"]},faraday:{description:"Faraday constant",examples:["faraday"]},firstRadiation:{description:"First radiation constant",examples:["firstRadiation"]},loschmidt:{description:"Loschmidt constant at T=273.15 K and p=101.325 kPa",examples:["loschmidt"]},gasConstant:{description:"Gas constant",examples:["gasConstant"]},molarPlanckConstant:{description:"Molar Planck constant",examples:["molarPlanckConstant"]},molarVolume:{description:"Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa",examples:["molarVolume"]},sackurTetrode:{description:"Sackur-Tetrode constant at T=1 K and p=101.325 kPa",examples:["sackurTetrode"]},secondRadiation:{description:"Second radiation constant",examples:["secondRadiation"]},stefanBoltzmann:{description:"Stefan-Boltzmann constant",examples:["stefanBoltzmann"]},wienDisplacement:{description:"Wien displacement law constant",examples:["wienDisplacement"]},molarMass:{description:"Molar mass constant",examples:["molarMass"]},molarMassC12:{description:"Molar mass constant of carbon-12",examples:["molarMassC12"]},gravity:{description:"Standard acceleration of gravity (standard acceleration of free-fall on Earth)",examples:["gravity"]},planckLength:{description:"Planck length",examples:["planckLength"]},planckMass:{description:"Planck mass",examples:["planckMass"]},planckTime:{description:"Planck time",examples:["planckTime"]},planckCharge:{description:"Planck charge",examples:["planckCharge"]},planckTemperature:{description:"Planck temperature",examples:["planckTemperature"]},derivative:{name:"derivative",category:"Algebra",syntax:["derivative(expr, variable)","derivative(expr, variable, {simplify: boolean})"],description:"Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.",examples:['derivative("2x^3", "x")','derivative("2x^3", "x", {simplify: false})','derivative("2x^2 + 3x + 4", "x")','derivative("sin(2x)", "x")','f = parse("x^2 + x")','x = parse("x")',"df = derivative(f, x)","df.evaluate({x: 3})"],seealso:["simplify","parse","evaluate"]},lsolve:{name:"lsolve",category:"Algebra",syntax:["x=lsolve(L, b)"],description:"Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.",examples:["a = [-2, 3; 2, 1]","b = [11, 9]","x = lsolve(a, b)"],seealso:["lsolveAll","lup","lusolve","usolve","matrix","sparse"]},lsolveAll:{name:"lsolveAll",category:"Algebra",syntax:["x=lsolveAll(L, b)"],description:"Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.",examples:["a = [-2, 3; 2, 1]","b = [11, 9]","x = lsolve(a, b)"],seealso:["lsolve","lup","lusolve","usolve","matrix","sparse"]},lup:{name:"lup",category:"Algebra",syntax:["lup(m)"],description:"Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U",examples:["lup([[2, 1], [1, 4]])","lup(matrix([[2, 1], [1, 4]]))","lup(sparse([[2, 1], [1, 4]]))"],seealso:["lusolve","lsolve","usolve","matrix","sparse","slu","qr"]},lusolve:{name:"lusolve",category:"Algebra",syntax:["x=lusolve(A, b)","x=lusolve(lu, b)"],description:"Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.",examples:["a = [-2, 3; 2, 1]","b = [11, 9]","x = lusolve(a, b)"],seealso:["lup","slu","lsolve","usolve","matrix","sparse"]},leafCount:{name:"leafCount",category:"Algebra",syntax:["leafCount(expr)"],description:"Computes the number of leaves in the parse tree of the given expression",examples:['leafCount("e^(i*pi)-1")','leafCount(parse("{a: 22/7, b: 10^(1/2)}"))'],seealso:["simplify"]},resolve:{name:"resolve",category:"Algebra",syntax:["resolve(node, scope)"],description:"Recursively substitute variables in an expression tree.",examples:['resolve(parse("1 + x"), { x: 7 })','resolve(parse("size(text)"), { text: "Hello World" })','resolve(parse("x + y"), { x: parse("3z") })','resolve(parse("3x"), { x: parse("y+z"), z: parse("w^y") })'],seealso:["simplify","evaluate"],mayThrow:["ReferenceError"]},simplify:{name:"simplify",category:"Algebra",syntax:["simplify(expr)","simplify(expr, rules)"],description:"Simplify an expression tree.",examples:['simplify("3 + 2 / 4")','simplify("2x + x")','f = parse("x * (x + 2 + x)")',"simplified = simplify(f)","simplified.evaluate({x: 2})"],seealso:["simplifyCore","derivative","evaluate","parse","rationalize","resolve"]},simplifyCore:{name:"simplifyCore",category:"Algebra",syntax:["simplifyCore(node)"],description:"Perform simple one-pass simplifications on an expression tree.",examples:['simplifyCore(parse("0*x"))','simplifyCore(parse("(x+0)*2"))'],seealso:["simplify","evaluate"]},symbolicEqual:{name:"symbolicEqual",category:"Algebra",syntax:["symbolicEqual(expr1, expr2)","symbolicEqual(expr1, expr2, options)"],description:"Returns true if the difference of the expressions simplifies to 0",examples:['symbolicEqual("x*y","y*x")','symbolicEqual("abs(x^2)", "x^2")','symbolicEqual("abs(x)", "x", {context: {abs: {trivial: true}}})'],seealso:["simplify","evaluate"]},rationalize:{name:"rationalize",category:"Algebra",syntax:["rationalize(expr)","rationalize(expr, scope)","rationalize(expr, scope, detailed)"],description:"Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.",examples:['rationalize("2x/y - y/(x+1)")','rationalize("2x/y - y/(x+1)", true)'],seealso:["simplify"]},slu:{name:"slu",category:"Algebra",syntax:["slu(A, order, threshold)"],description:"Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U",examples:["slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)"],seealso:["lusolve","lsolve","usolve","matrix","sparse","lup","qr"]},usolve:{name:"usolve",category:"Algebra",syntax:["x=usolve(U, b)"],description:"Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.",examples:["x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])"],seealso:["usolveAll","lup","lusolve","lsolve","matrix","sparse"]},usolveAll:{name:"usolveAll",category:"Algebra",syntax:["x=usolve(U, b)"],description:"Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.",examples:["x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])"],seealso:["usolve","lup","lusolve","lsolve","matrix","sparse"]},qr:{name:"qr",category:"Algebra",syntax:["qr(A)"],description:"Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.",examples:["qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])"],seealso:["lup","slu","matrix"]},abs:{name:"abs",category:"Arithmetic",syntax:["abs(x)"],description:"Compute the absolute value.",examples:["abs(3.5)","abs(-4.2)"],seealso:["sign"]},add:{name:"add",category:"Operators",syntax:["x + y","add(x, y)"],description:"Add two values.",examples:["a = 2.1 + 3.6","a - 3.6","3 + 2i","3 cm + 2 inch",'"2.3" + "4"'],seealso:["subtract"]},cbrt:{name:"cbrt",category:"Arithmetic",syntax:["cbrt(x)","cbrt(x, allRoots)"],description:"Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned",examples:["cbrt(64)","cube(4)","cbrt(-8)","cbrt(2 + 3i)","cbrt(8i)","cbrt(8i, true)","cbrt(27 m^3)"],seealso:["square","sqrt","cube","multiply"]},ceil:{name:"ceil",category:"Arithmetic",syntax:["ceil(x)"],description:"Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.",examples:["ceil(3.2)","ceil(3.8)","ceil(-4.2)"],seealso:["floor","fix","round"]},cube:{name:"cube",category:"Arithmetic",syntax:["cube(x)"],description:"Compute the cube of a value. The cube of x is x * x * x.",examples:["cube(2)","2^3","2 * 2 * 2"],seealso:["multiply","square","pow"]},divide:{name:"divide",category:"Operators",syntax:["x / y","divide(x, y)"],description:"Divide two values.",examples:["a = 2 / 3","a * 3","4.5 / 2","3 + 4 / 2","(3 + 4) / 2","18 km / 4.5"],seealso:["multiply"]},dotDivide:{name:"dotDivide",category:"Operators",syntax:["x ./ y","dotDivide(x, y)"],description:"Divide two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a ./ b"],seealso:["multiply","dotMultiply","divide"]},dotMultiply:{name:"dotMultiply",category:"Operators",syntax:["x .* y","dotMultiply(x, y)"],description:"Multiply two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a .* b"],seealso:["multiply","divide","dotDivide"]},dotPow:{name:"dotPow",category:"Operators",syntax:["x .^ y","dotPow(x, y)"],description:"Calculates the power of x to y element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","a .^ 2"],seealso:["pow"]},exp:{name:"exp",category:"Arithmetic",syntax:["exp(x)"],description:"Calculate the exponent of a value.",examples:["exp(1.3)","e ^ 1.3","log(exp(1.3))","x = 2.4","(exp(i*x) == cos(x) + i*sin(x))   # Euler's formula"],seealso:["expm","expm1","pow","log"]},expm:{name:"expm",category:"Arithmetic",syntax:["exp(x)"],description:"Compute the matrix exponential, expm(A) = e^A. The matrix must be square. Not to be confused with exp(a), which performs element-wise exponentiation.",examples:["expm([[0,2],[0,0]])"],seealso:["exp"]},expm1:{name:"expm1",category:"Arithmetic",syntax:["expm1(x)"],description:"Calculate the value of subtracting 1 from the exponential value.",examples:["expm1(2)","pow(e, 2) - 1","log(expm1(2) + 1)"],seealso:["exp","pow","log"]},fix:{name:"fix",category:"Arithmetic",syntax:["fix(x)"],description:"Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.",examples:["fix(3.2)","fix(3.8)","fix(-4.2)","fix(-4.8)"],seealso:["ceil","floor","round"]},floor:{name:"floor",category:"Arithmetic",syntax:["floor(x)"],description:"Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.",examples:["floor(3.2)","floor(3.8)","floor(-4.2)"],seealso:["ceil","fix","round"]},gcd:{name:"gcd",category:"Arithmetic",syntax:["gcd(a, b)","gcd(a, b, c, ...)"],description:"Compute the greatest common divisor.",examples:["gcd(8, 12)","gcd(-4, 6)","gcd(25, 15, -10)"],seealso:["lcm","xgcd"]},hypot:{name:"hypot",category:"Arithmetic",syntax:["hypot(a, b, c, ...)","hypot([a, b, c, ...])"],description:"Calculate the hypotenusa of a list with values. ",examples:["hypot(3, 4)","sqrt(3^2 + 4^2)","hypot(-2)","hypot([3, 4, 5])"],seealso:["abs","norm"]},lcm:{name:"lcm",category:"Arithmetic",syntax:["lcm(x, y)"],description:"Compute the least common multiple.",examples:["lcm(4, 6)","lcm(6, 21)","lcm(6, 21, 5)"],seealso:["gcd"]},log:{name:"log",category:"Arithmetic",syntax:["log(x)","log(x, base)"],description:"Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).",examples:["log(3.5)","a = log(2.4)","exp(a)","10 ^ 4","log(10000, 10)","log(10000) / log(10)","b = log(1024, 2)","2 ^ b"],seealso:["exp","log1p","log2","log10"]},log2:{name:"log2",category:"Arithmetic",syntax:["log2(x)"],description:"Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.",examples:["log2(0.03125)","log2(16)","log2(16) / log2(2)","pow(2, 4)"],seealso:["exp","log1p","log","log10"]},log1p:{name:"log1p",category:"Arithmetic",syntax:["log1p(x)","log1p(x, base)"],description:"Calculate the logarithm of a `value+1`",examples:["log1p(2.5)","exp(log1p(1.4))","pow(10, 4)","log1p(9999, 10)","log1p(9999) / log(10)"],seealso:["exp","log","log2","log10"]},log10:{name:"log10",category:"Arithmetic",syntax:["log10(x)"],description:"Compute the 10-base logarithm of a value.",examples:["log10(0.00001)","log10(10000)","10 ^ 4","log(10000) / log(10)","log(10000, 10)"],seealso:["exp","log"]},mod:{name:"mod",category:"Operators",syntax:["x % y","x mod y","mod(x, y)"],description:"Calculates the modulus, the remainder of an integer division.",examples:["7 % 3","11 % 2","10 mod 4","isOdd(x) = x % 2","isOdd(2)","isOdd(3)"],seealso:["divide"]},multiply:{name:"multiply",category:"Operators",syntax:["x * y","multiply(x, y)"],description:"multiply two values.",examples:["a = 2.1 * 3.4","a / 3.4","2 * 3 + 4","2 * (3 + 4)","3 * 2.1 km"],seealso:["divide"]},norm:{name:"norm",category:"Arithmetic",syntax:["norm(x)","norm(x, p)"],description:"Calculate the norm of a number, vector or matrix.",examples:["abs(-3.5)","norm(-3.5)","norm(3 - 4i)","norm([1, 2, -3], Infinity)","norm([1, 2, -3], -Infinity)","norm([3, 4], 2)","norm([[1, 2], [3, 4]], 1)",'norm([[1, 2], [3, 4]], "inf")','norm([[1, 2], [3, 4]], "fro")']},nthRoot:{name:"nthRoot",category:"Arithmetic",syntax:["nthRoot(a)","nthRoot(a, root)"],description:'Calculate the nth root of a value. The principal nth root of a positive real number A, is the positive real solution of the equation "x^root = A".',examples:["4 ^ 3","nthRoot(64, 3)","nthRoot(9, 2)","sqrt(9)"],seealso:["nthRoots","pow","sqrt"]},nthRoots:{name:"nthRoots",category:"Arithmetic",syntax:["nthRoots(A)","nthRoots(A, root)"],description:'Calculate the nth roots of a value. An nth root of a positive real number A, is a positive real solution of the equation "x^root = A". This function returns an array of complex values.',examples:["nthRoots(1)","nthRoots(1, 3)"],seealso:["sqrt","pow","nthRoot"]},pow:{name:"pow",category:"Operators",syntax:["x ^ y","pow(x, y)"],description:"Calculates the power of x to y, x^y.",examples:["2^3","2*2*2","1 + e ^ (pi * i)"],seealso:["multiply","nthRoot","nthRoots","sqrt"]},round:{name:"round",category:"Arithmetic",syntax:["round(x)","round(x, n)"],description:"round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.",examples:["round(3.2)","round(3.8)","round(-4.2)","round(-4.8)","round(pi, 3)","round(123.45678, 2)"],seealso:["ceil","floor","fix"]},sign:{name:"sign",category:"Arithmetic",syntax:["sign(x)"],description:"Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.",examples:["sign(3.5)","sign(-4.2)","sign(0)"],seealso:["abs"]},sqrt:{name:"sqrt",category:"Arithmetic",syntax:["sqrt(x)"],description:"Compute the square root value. If x = y * y, then y is the square root of x.",examples:["sqrt(25)","5 * 5","sqrt(-1)"],seealso:["square","sqrtm","multiply","nthRoot","nthRoots","pow"]},sqrtm:{name:"sqrtm",category:"Arithmetic",syntax:["sqrtm(x)"],description:"Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.",examples:["sqrtm([[1, 2], [3, 4]])"],seealso:["sqrt","abs","square","multiply"]},square:{name:"square",category:"Arithmetic",syntax:["square(x)"],description:"Compute the square of a value. The square of x is x * x.",examples:["square(3)","sqrt(9)","3^2","3 * 3"],seealso:["multiply","pow","sqrt","cube"]},subtract:{name:"subtract",category:"Operators",syntax:["x - y","subtract(x, y)"],description:"subtract two values.",examples:["a = 5.3 - 2","a + 2","2/3 - 1/6","2 * 3 - 3","2.1 km - 500m"],seealso:["add"]},unaryMinus:{name:"unaryMinus",category:"Operators",syntax:["-x","unaryMinus(x)"],description:"Inverse the sign of a value. Converts booleans and strings to numbers.",examples:["-4.5","-(-5.6)",'-"22"'],seealso:["add","subtract","unaryPlus"]},unaryPlus:{name:"unaryPlus",category:"Operators",syntax:["+x","unaryPlus(x)"],description:"Converts booleans and strings to numbers.",examples:["+true",'+"2"'],seealso:["add","subtract","unaryMinus"]},xgcd:{name:"xgcd",category:"Arithmetic",syntax:["xgcd(a, b)"],description:"Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.",examples:["xgcd(8, 12)","gcd(8, 12)","xgcd(36163, 21199)"],seealso:["gcd","lcm"]},invmod:{name:"invmod",category:"Arithmetic",syntax:["invmod(a, b)"],description:"Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)",examples:["invmod(8, 12)=NaN","invmod(7, 13)=2","math.invmod(15151, 15122)=10429"],seealso:["gcd","xgcd"]},bitAnd:{name:"bitAnd",category:"Bitwise",syntax:["x & y","bitAnd(x, y)"],description:"Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0",examples:["5 & 3","bitAnd(53, 131)","[1, 12, 31] & 42"],seealso:["bitNot","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]},bitNot:{name:"bitNot",category:"Bitwise",syntax:["~x","bitNot(x)"],description:"Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.",examples:["~1","~2","bitNot([2, -3, 4])"],seealso:["bitAnd","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]},bitOr:{name:"bitOr",category:"Bitwise",syntax:["x | y","bitOr(x, y)"],description:"Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.",examples:["5 | 3","bitOr([1, 2, 3], 4)"],seealso:["bitAnd","bitNot","bitXor","leftShift","rightArithShift","rightLogShift"]},bitXor:{name:"bitXor",category:"Bitwise",syntax:["bitXor(x, y)"],description:"Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.",examples:["bitOr(1, 2)","bitXor([2, 3, 4], 4)"],seealso:["bitAnd","bitNot","bitOr","leftShift","rightArithShift","rightLogShift"]},leftShift:{name:"leftShift",category:"Bitwise",syntax:["x << y","leftShift(x, y)"],description:"Bitwise left logical shift of a value x by y number of bits.",examples:["4 << 1","8 >> 1"],seealso:["bitAnd","bitNot","bitOr","bitXor","rightArithShift","rightLogShift"]},rightArithShift:{name:"rightArithShift",category:"Bitwise",syntax:["x >> y","rightArithShift(x, y)"],description:"Bitwise right arithmetic shift of a value x by y number of bits.",examples:["8 >> 1","4 << 1","-12 >> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightLogShift"]},rightLogShift:{name:"rightLogShift",category:"Bitwise",syntax:["x >>> y","rightLogShift(x, y)"],description:"Bitwise right logical shift of a value x by y number of bits.",examples:["8 >>> 1","4 << 1","-12 >>> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightArithShift"]},bellNumbers:{name:"bellNumbers",category:"Combinatorics",syntax:["bellNumbers(n)"],description:"The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.",examples:["bellNumbers(3)","bellNumbers(8)"],seealso:["stirlingS2"]},catalan:{name:"catalan",category:"Combinatorics",syntax:["catalan(n)"],description:"The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.",examples:["catalan(3)","catalan(8)"],seealso:["bellNumbers"]},composition:{name:"composition",category:"Combinatorics",syntax:["composition(n, k)"],description:"The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.",examples:["composition(5, 3)"],seealso:["combinations"]},stirlingS2:{name:"stirlingS2",category:"Combinatorics",syntax:["stirlingS2(n, k)"],description:"he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.",examples:["stirlingS2(5, 3)"],seealso:["bellNumbers"]},config:{name:"config",category:"Core",syntax:["config()","config(options)"],description:"Get configuration or change configuration.",examples:["config()","1/3 + 1/4",'config({number: "Fraction"})',"1/3 + 1/4"],seealso:[]},import:{name:"import",category:"Core",syntax:["import(functions)","import(functions, options)"],description:"Import functions or constants from an object.",examples:["import({myFn: f(x)=x^2, myConstant: 32 })","myFn(2)","myConstant"],seealso:[]},typed:{name:"typed",category:"Core",syntax:["typed(signatures)","typed(name, signatures)"],description:"Create a typed function.",examples:['double = typed({ "number": f(x)=x+x })',"double(2)",'double("hello")'],seealso:[]},arg:{name:"arg",category:"Complex",syntax:["arg(x)"],description:"Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).",examples:["arg(2 + 2i)","atan2(3, 2)","arg(2 + 3i)"],seealso:["re","im","conj","abs"]},conj:{name:"conj",category:"Complex",syntax:["conj(x)"],description:"Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.",examples:["conj(2 + 3i)","conj(2 - 3i)","conj(-5.2i)"],seealso:["re","im","abs","arg"]},re:{name:"re",category:"Complex",syntax:["re(x)"],description:"Get the real part of a complex number.",examples:["re(2 + 3i)","im(2 + 3i)","re(-5.2i)","re(2.4)"],seealso:["im","conj","abs","arg"]},im:{name:"im",category:"Complex",syntax:["im(x)"],description:"Get the imaginary part of a complex number.",examples:["im(2 + 3i)","re(2 + 3i)","im(-5.2i)","im(2.4)"],seealso:["re","conj","abs","arg"]},evaluate:{name:"evaluate",category:"Expression",syntax:["evaluate(expression)","evaluate([expr1, expr2, expr3, ...])"],description:"Evaluate an expression or an array with expressions.",examples:['evaluate("2 + 3")','evaluate("sqrt(" + 4 + ")")'],seealso:[]},help:{name:"help",category:"Expression",syntax:["help(object)","help(string)"],description:"Display documentation on a function or data type.",examples:["help(sqrt)",'help("complex")'],seealso:[]},distance:{name:"distance",category:"Geometry",syntax:["distance([x1, y1], [x2, y2])","distance([[x1, y1], [x2, y2]])"],description:"Calculates the Euclidean distance between two points.",examples:["distance([0,0], [4,4])","distance([[0,0], [4,4]])"],seealso:[]},intersect:{name:"intersect",category:"Geometry",syntax:["intersect(expr1, expr2, expr3, expr4)","intersect(expr1, expr2, expr3)"],description:"Computes the intersection point of lines and/or planes.",examples:["intersect([0, 0], [10, 10], [10, 0], [0, 10])","intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])"],seealso:[]},and:{name:"and",category:"Logical",syntax:["x and y","and(x, y)"],description:"Logical and. Test whether two values are both defined with a nonzero/nonempty value.",examples:["true and false","true and true","2 and 4"],seealso:["not","or","xor"]},not:{name:"not",category:"Logical",syntax:["not x","not(x)"],description:"Logical not. Flips the boolean value of given argument.",examples:["not true","not false","not 2","not 0"],seealso:["and","or","xor"]},or:{name:"or",category:"Logical",syntax:["x or y","or(x, y)"],description:"Logical or. Test if at least one value is defined with a nonzero/nonempty value.",examples:["true or false","false or false","0 or 4"],seealso:["not","and","xor"]},xor:{name:"xor",category:"Logical",syntax:["x xor y","xor(x, y)"],description:"Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.",examples:["true xor false","false xor false","true xor true","0 xor 4"],seealso:["not","and","or"]},concat:{name:"concat",category:"Matrix",syntax:["concat(A, B, C, ...)","concat(A, B, C, ..., dim)"],description:"Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.",examples:["A = [1, 2; 5, 6]","B = [3, 4; 7, 8]","concat(A, B)","concat(A, B, 1)","concat(A, B, 2)"],seealso:["det","diag","identity","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},count:{name:"count",category:"Matrix",syntax:["count(x)"],description:"Count the number of elements of a matrix, array or string.",examples:["a = [1, 2; 3, 4; 5, 6]","count(a)","size(a)",'count("hello world")'],seealso:["size"]},cross:{name:"cross",category:"Matrix",syntax:["cross(A, B)"],description:"Calculate the cross product for two vectors in three dimensional space.",examples:["cross([1, 1, 0],  [0, 1, 1])","cross([3, -3, 1], [4, 9, 2])","cross([2, 3, 4],  [5, 6, 7])"],seealso:["multiply","dot"]},column:{name:"column",category:"Matrix",syntax:["column(x, index)"],description:"Return a column from a matrix or array.",examples:["A = [[1, 2], [3, 4]]","column(A, 1)","column(A, 2)"],seealso:["row","matrixFromColumns"]},ctranspose:{name:"ctranspose",category:"Matrix",syntax:["x'","ctranspose(x)"],description:"Complex Conjugate and Transpose a matrix",examples:["a = [1, 2, 3; 4, 5, 6]","a'","ctranspose(a)"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","trace","zeros"]},det:{name:"det",category:"Matrix",syntax:["det(x)"],description:"Calculate the determinant of a matrix",examples:["det([1, 2; 3, 4])","det([-2, 2, 3; -1, 1, 3; 2, 0, -1])"],seealso:["concat","diag","identity","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},diag:{name:"diag",category:"Matrix",syntax:["diag(x)","diag(x, k)"],description:"Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.",examples:["diag(1:3)","diag(1:3, 1)","a = [1, 2, 3; 4, 5, 6; 7, 8, 9]","diag(a)"],seealso:["concat","det","identity","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},diff:{name:"diff",category:"Matrix",syntax:["diff(arr)","diff(arr, dim)"],description:["Create a new matrix or array with the difference of the passed matrix or array.","Dim parameter is optional and used to indicant the dimension of the array/matrix to apply the difference","If no dimension parameter is passed it is assumed as dimension 0","Dimension is zero-based in javascript and one-based in the parser","Arrays must be 'rectangular' meaning arrays like [1, 2]","If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays"],examples:["diff([1, 2, 4, 7, 0])","diff([1, 2, 4, 7, 0], 0)","diff(matrix([1, 2, 4, 7, 0]))","diff([[1, 2], [3, 4]])","diff([[1, 2], [3, 4]], 0)","diff([[1, 2], [3, 4]], 1)","diff([[1, 2], [3, 4]], bignumber(1))","diff(matrix([[1, 2], [3, 4]]), 1)","diff([[1, 2], matrix([3, 4])], 1)"],seealso:["subtract","partitionSelect"]},dot:{name:"dot",category:"Matrix",syntax:["dot(A, B)","A * B"],description:"Calculate the dot product of two vectors. The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn",examples:["dot([2, 4, 1], [2, 2, 3])","[2, 4, 1] * [2, 2, 3]"],seealso:["multiply","cross"]},getMatrixDataType:{name:"getMatrixDataType",category:"Matrix",syntax:["getMatrixDataType(x)"],description:'Find the data type of all elements in a matrix or array, for example "number" if all items are a number and "Complex" if all values are complex numbers. If a matrix contains more than one data type, it will return "mixed".',examples:["getMatrixDataType([1, 2, 3])","getMatrixDataType([[5 cm], [2 inch]])",'getMatrixDataType([1, "text"])',"getMatrixDataType([1, bignumber(4)])"],seealso:["matrix","sparse","typeOf"]},identity:{name:"identity",category:"Matrix",syntax:["identity(n)","identity(m, n)","identity([m, n])"],description:"Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.",examples:["identity(3)","identity(3, 5)","a = [1, 2, 3; 4, 5, 6]","identity(size(a))"],seealso:["concat","det","diag","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},filter:{name:"filter",category:"Matrix",syntax:["filter(x, test)"],description:"Filter items in a matrix.",examples:["isPositive(x) = x > 0","filter([6, -2, -1, 4, 3], isPositive)","filter([6, -2, 0, 1, 0], x != 0)"],seealso:["sort","map","forEach"]},flatten:{name:"flatten",category:"Matrix",syntax:["flatten(x)"],description:"Flatten a multi dimensional matrix into a single dimensional matrix.",examples:["a = [1, 2, 3; 4, 5, 6]","size(a)","b = flatten(a)","size(b)"],seealso:["concat","resize","size","squeeze"]},forEach:{name:"forEach",category:"Matrix",syntax:["forEach(x, callback)"],description:"Iterates over all elements of a matrix/array, and executes the given callback function.",examples:["numberOfPets = {}","addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;",'forEach(["Dog","Cat","Cat"], addPet)',"numberOfPets"],seealso:["map","sort","filter"]},inv:{name:"inv",category:"Matrix",syntax:["inv(x)"],description:"Calculate the inverse of a matrix",examples:["inv([1, 2; 3, 4])","inv(4)","1 / 4"],seealso:["concat","det","diag","identity","ones","range","size","squeeze","subset","trace","transpose","zeros"]},eigs:{name:"eigs",category:"Matrix",syntax:["eigs(x)"],description:"Calculate the eigenvalues and eigenvectors of a real symmetric matrix",examples:["eigs([[5, 2.3], [2.3, 1]])"],seealso:["inv"]},kron:{name:"kron",category:"Matrix",syntax:["kron(x, y)"],description:"Calculates the kronecker product of 2 matrices or vectors.",examples:["kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])","kron([1,1], [2,3,4])"],seealso:["multiply","dot","cross"]},matrixFromFunction:{name:"matrixFromFunction",category:"Matrix",syntax:["math.matrixFromFunction(size, fn)","math.matrixFromFunction(size, fn, format)","math.matrixFromFunction(size, fn, format, datatype)","math.matrixFromFunction(size, format, fn)","math.matrixFromFunction(size, format, datatype, fn)"],description:"Create a matrix by evaluating a generating function at each index.",examples:["f(I) = I[1] - I[2]","matrixFromFunction([3,3], f)","g(I) = I[1] - I[2] == 1 ? 4 : 0",'matrixFromFunction([100, 100], "sparse", g)',"matrixFromFunction([5], random)"],seealso:["matrix","matrixFromRows","matrixFromColumns","zeros"]},matrixFromRows:{name:"matrixFromRows",category:"Matrix",syntax:["math.matrixFromRows(...arr)","math.matrixFromRows(row1, row2)","math.matrixFromRows(row1, row2, row3)"],description:"Create a dense matrix from vectors as individual rows.",examples:["matrixFromRows([1, 2, 3], [[4],[5],[6]])"],seealso:["matrix","matrixFromColumns","matrixFromFunction","zeros"]},matrixFromColumns:{name:"matrixFromColumns",category:"Matrix",syntax:["math.matrixFromColumns(...arr)","math.matrixFromColumns(row1, row2)","math.matrixFromColumns(row1, row2, row3)"],description:"Create a dense matrix from vectors as individual columns.",examples:["matrixFromColumns([1, 2, 3], [[4],[5],[6]])"],seealso:["matrix","matrixFromRows","matrixFromFunction","zeros"]},map:{name:"map",category:"Matrix",syntax:["map(x, callback)"],description:"Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.",examples:["map([1, 2, 3], square)"],seealso:["filter","forEach"]},ones:{name:"ones",category:"Matrix",syntax:["ones(m)","ones(m, n)","ones(m, n, p, ...)","ones([m])","ones([m, n])","ones([m, n, p, ...])"],description:"Create a matrix containing ones.",examples:["ones(3)","ones(3, 5)","ones([2,3]) * 4.5","a = [1, 2, 3; 4, 5, 6]","ones(size(a))"],seealso:["concat","det","diag","identity","inv","range","size","squeeze","subset","trace","transpose","zeros"]},partitionSelect:{name:"partitionSelect",category:"Matrix",syntax:["partitionSelect(x, k)","partitionSelect(x, k, compare)"],description:"Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.",examples:["partitionSelect([5, 10, 1], 2)",'partitionSelect(["C", "B", "A", "D"], 1)'],seealso:["sort"]},range:{name:"range",category:"Type",syntax:["start:end","start:step:end","range(start, end)","range(start, end, step)","range(string)"],description:"Create a range. Lower bound of the range is included, upper bound is excluded.",examples:["1:5","3:-1:-3","range(3, 7)","range(0, 12, 2)",'range("4:10")',"a = [1, 2, 3, 4; 5, 6, 7, 8]","a[1:2, 1:2]"],seealso:["concat","det","diag","identity","inv","ones","size","squeeze","subset","trace","transpose","zeros"]},resize:{name:"resize",category:"Matrix",syntax:["resize(x, size)","resize(x, size, defaultValue)"],description:"Resize a matrix.",examples:["resize([1,2,3,4,5], [3])","resize([1,2,3], [5])","resize([1,2,3], [5], -1)","resize(2, [2, 3])",'resize("hello", [8], "!")'],seealso:["size","subset","squeeze","reshape"]},reshape:{name:"reshape",category:"Matrix",syntax:["reshape(x, sizes)"],description:"Reshape a multi dimensional array to fit the specified dimensions.",examples:["reshape([1, 2, 3, 4, 5, 6], [2, 3])","reshape([[1, 2], [3, 4]], [1, 4])","reshape([[1, 2], [3, 4]], [4])"],seealso:["size","squeeze","resize"]},rotate:{name:"rotate",category:"Matrix",syntax:["rotate(w, theta)","rotate(w, theta, v)"],description:"Returns a 2-D rotation matrix (2x2) for a given angle (in radians). Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.",examples:["rotate([1, 0], math.pi / 2)",'rotate(matrix([1, 0]), unit("35deg"))','rotate([1, 0, 0], unit("90deg"), [0, 0, 1])','rotate(matrix([1, 0, 0]), unit("90deg"), matrix([0, 0, 1]))'],seealso:["matrix","rotationMatrix"]},rotationMatrix:{name:"rotationMatrix",category:"Matrix",syntax:["rotationMatrix(theta)","rotationMatrix(theta, v)","rotationMatrix(theta, v, format)"],description:"Returns a 2-D rotation matrix (2x2) for a given angle (in radians). Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.",examples:["rotationMatrix(pi / 2)",'rotationMatrix(unit("45deg"), [0, 0, 1])','rotationMatrix(1, matrix([0, 0, 1]), "sparse")'],seealso:["cos","sin"]},row:{name:"row",category:"Matrix",syntax:["row(x, index)"],description:"Return a row from a matrix or array.",examples:["A = [[1, 2], [3, 4]]","row(A, 1)","row(A, 2)"],seealso:["column","matrixFromRows"]},size:{name:"size",category:"Matrix",syntax:["size(x)"],description:"Calculate the size of a matrix.",examples:["size(2.3)",'size("hello world")',"a = [1, 2; 3, 4; 5, 6]","size(a)","size(1:6)"],seealso:["concat","count","det","diag","identity","inv","ones","range","squeeze","subset","trace","transpose","zeros"]},sort:{name:"sort",category:"Matrix",syntax:["sort(x)","sort(x, compare)"],description:'Sort the items in a matrix. Compare can be a string "asc", "desc", "natural", or a custom sort function.',examples:["sort([5, 10, 1])",'sort(["C", "B", "A", "D"])',"sortByLength(a, b) = size(a)[1] - size(b)[1]",'sort(["Langdon", "Tom", "Sara"], sortByLength)','sort(["10", "1", "2"], "natural")'],seealso:["map","filter","forEach"]},squeeze:{name:"squeeze",category:"Matrix",syntax:["squeeze(x)"],description:"Remove inner and outer singleton dimensions from a matrix.",examples:["a = zeros(3,2,1)","size(squeeze(a))","b = zeros(1,1,3)","size(squeeze(b))"],seealso:["concat","det","diag","identity","inv","ones","range","size","subset","trace","transpose","zeros"]},subset:{name:"subset",category:"Matrix",syntax:["value(index)","value(index) = replacement","subset(value, [index])","subset(value, [index], replacement)"],description:"Get or set a subset of the entries of a matrix or characters of a string. Indexes are one-based. There should be one index specification for each dimension of the target. Each specification can be a single index, a list of indices, or a range in colon notation `l:u`. In a range, both the lower bound l and upper bound u are included; and if a bound is omitted it defaults to the most extreme valid value. The cartesian product of the indices specified in each dimension determines the target of the operation.",examples:["d = [1, 2; 3, 4]","e = []","e[1, 1:2] = [5, 6]","e[2, :] = [7, 8]","f = d * e","f[2, 1]","f[:, 1]","f[[1,2], [1,3]] = [9, 10; 11, 12]","f"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","trace","transpose","zeros"]},trace:{name:"trace",category:"Matrix",syntax:["trace(A)"],description:"Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.",examples:["A = [1, 2, 3; -1, 2, 3; 2, 0, 3]","trace(A)"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","transpose","zeros"]},transpose:{name:"transpose",category:"Matrix",syntax:["x'","transpose(x)"],description:"Transpose a matrix",examples:["a = [1, 2, 3; 4, 5, 6]","a'","transpose(a)"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","trace","zeros"]},zeros:{name:"zeros",category:"Matrix",syntax:["zeros(m)","zeros(m, n)","zeros(m, n, p, ...)","zeros([m])","zeros([m, n])","zeros([m, n, p, ...])"],description:"Create a matrix containing zeros.",examples:["zeros(3)","zeros(3, 5)","a = [1, 2, 3; 4, 5, 6]","zeros(size(a))"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","trace","transpose"]},combinations:{name:"combinations",category:"Probability",syntax:["combinations(n, k)"],description:"Compute the number of combinations of n items taken k at a time",examples:["combinations(7, 5)"],seealso:["combinationsWithRep","permutations","factorial"]},combinationsWithRep:{name:"combinationsWithRep",category:"Probability",syntax:["combinationsWithRep(n, k)"],description:"Compute the number of combinations of n items taken k at a time with replacements.",examples:["combinationsWithRep(7, 5)"],seealso:["combinations","permutations","factorial"]},factorial:{name:"factorial",category:"Probability",syntax:["n!","factorial(n)"],description:"Compute the factorial of a value",examples:["5!","5 * 4 * 3 * 2 * 1","3!"],seealso:["combinations","combinationsWithRep","permutations","gamma"]},gamma:{name:"gamma",category:"Probability",syntax:["gamma(n)"],description:"Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.",examples:["gamma(4)","3!","gamma(1/2)","sqrt(pi)"],seealso:["factorial"]},kldivergence:{name:"kldivergence",category:"Probability",syntax:["kldivergence(x, y)"],description:"Calculate the Kullback-Leibler (KL) divergence  between two distributions.",examples:["kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])"],seealso:[]},multinomial:{name:"multinomial",category:"Probability",syntax:["multinomial(A)"],description:"Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.",examples:["multinomial([1, 2, 1])"],seealso:["combinations","factorial"]},permutations:{name:"permutations",category:"Probability",syntax:["permutations(n)","permutations(n, k)"],description:"Compute the number of permutations of n items taken k at a time",examples:["permutations(5)","permutations(5, 3)"],seealso:["combinations","combinationsWithRep","factorial"]},pickRandom:{name:"pickRandom",category:"Probability",syntax:["pickRandom(array)","pickRandom(array, number)","pickRandom(array, weights)","pickRandom(array, number, weights)","pickRandom(array, weights, number)"],description:"Pick a random entry from a given array.",examples:["pickRandom(0:10)","pickRandom([1, 3, 1, 6])","pickRandom([1, 3, 1, 6], 2)","pickRandom([1, 3, 1, 6], [2, 3, 2, 1])","pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])","pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)"],seealso:["random","randomInt"]},random:{name:"random",category:"Probability",syntax:["random()","random(max)","random(min, max)","random(size)","random(size, max)","random(size, min, max)"],description:"Return a random number.",examples:["random()","random(10, 20)","random([2, 3])"],seealso:["pickRandom","randomInt"]},randomInt:{name:"randomInt",category:"Probability",syntax:["randomInt(max)","randomInt(min, max)","randomInt(size)","randomInt(size, max)","randomInt(size, min, max)"],description:"Return a random integer number",examples:["randomInt(10, 20)","randomInt([2, 3], 10)"],seealso:["pickRandom","random"]},compare:{name:"compare",category:"Relational",syntax:["compare(x, y)"],description:"Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.",examples:["compare(2, 3)","compare(3, 2)","compare(2, 2)","compare(5cm, 40mm)","compare(2, [1, 2, 3])"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compareNatural","compareText"]},compareNatural:{name:"compareNatural",category:"Relational",syntax:["compareNatural(x, y)"],description:"Compare two values of any type in a deterministic, natural way. Returns 1 when x > y, -1 when x < y, and 0 when x == y.",examples:["compareNatural(2, 3)","compareNatural(3, 2)","compareNatural(2, 2)","compareNatural(5cm, 40mm)",'compareNatural("2", "10")',"compareNatural(2 + 3i, 2 + 4i)","compareNatural([1, 2, 4], [1, 2, 3])","compareNatural([1, 5], [1, 2, 3])","compareNatural([1, 2], [1, 2])","compareNatural({a: 2}, {a: 4})"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compare","compareText"]},compareText:{name:"compareText",category:"Relational",syntax:["compareText(x, y)"],description:"Compare two strings lexically. Comparison is case sensitive. Returns 1 when x > y, -1 when x < y, and 0 when x == y.",examples:['compareText("B", "A")','compareText("A", "B")','compareText("A", "A")','compareText("2", "10")','compare("2", "10")',"compare(2, 10)",'compareNatural("2", "10")','compareText("B", ["A", "B", "C"])'],seealso:["compare","compareNatural"]},deepEqual:{name:"deepEqual",category:"Relational",syntax:["deepEqual(x, y)"],description:"Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.",examples:["deepEqual([1,3,4], [1,3,4])","deepEqual([1,3,4], [1,3])"],seealso:["equal","unequal","smaller","larger","smallerEq","largerEq","compare"]},equal:{name:"equal",category:"Relational",syntax:["x == y","equal(x, y)"],description:"Check equality of two values. Returns true if the values are equal, and false if not.",examples:["2+2 == 3","2+2 == 4","a = 3.2","b = 6-2.8","a == b","50cm == 0.5m"],seealso:["unequal","smaller","larger","smallerEq","largerEq","compare","deepEqual","equalText"]},equalText:{name:"equalText",category:"Relational",syntax:["equalText(x, y)"],description:"Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.",examples:['equalText("Hello", "Hello")','equalText("a", "A")','equal("2e3", "2000")','equalText("2e3", "2000")','equalText("B", ["A", "B", "C"])'],seealso:["compare","compareNatural","compareText","equal"]},larger:{name:"larger",category:"Relational",syntax:["x > y","larger(x, y)"],description:"Check if value x is larger than y. Returns true if x is larger than y, and false if not.",examples:["2 > 3","5 > 2*2","a = 3.3","b = 6-2.8","(a > b)","(b < a)","5 cm > 2 inch"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compare"]},largerEq:{name:"largerEq",category:"Relational",syntax:["x >= y","largerEq(x, y)"],description:"Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.",examples:["2 >= 1+1","2 > 1+1","a = 3.2","b = 6-2.8","(a >= b)"],seealso:["equal","unequal","smallerEq","smaller","compare"]},smaller:{name:"smaller",category:"Relational",syntax:["x < y","smaller(x, y)"],description:"Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.",examples:["2 < 3","5 < 2*2","a = 3.3","b = 6-2.8","(a < b)","5 cm < 2 inch"],seealso:["equal","unequal","larger","smallerEq","largerEq","compare"]},smallerEq:{name:"smallerEq",category:"Relational",syntax:["x <= y","smallerEq(x, y)"],description:"Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.",examples:["2 <= 1+1","2 < 1+1","a = 3.2","b = 6-2.8","(a <= b)"],seealso:["equal","unequal","larger","smaller","largerEq","compare"]},unequal:{name:"unequal",category:"Relational",syntax:["x != y","unequal(x, y)"],description:"Check unequality of two values. Returns true if the values are unequal, and false if they are equal.",examples:["2+2 != 3","2+2 != 4","a = 3.2","b = 6-2.8","a != b","50cm != 0.5m","5 cm != 2 inch"],seealso:["equal","smaller","larger","smallerEq","largerEq","compare","deepEqual"]},setCartesian:{name:"setCartesian",category:"Set",syntax:["setCartesian(set1, set2)"],description:"Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.",examples:["setCartesian([1, 2], [3, 4])"],seealso:["setUnion","setIntersect","setDifference","setPowerset"]},setDifference:{name:"setDifference",category:"Set",syntax:["setDifference(set1, set2)"],description:"Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setDifference([1, 2, 3, 4], [3, 4, 5, 6])","setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setUnion","setIntersect","setSymDifference"]},setDistinct:{name:"setDistinct",category:"Set",syntax:["setDistinct(set)"],description:"Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.",examples:["setDistinct([1, 1, 1, 2, 2, 3])"],seealso:["setMultiplicity"]},setIntersect:{name:"setIntersect",category:"Set",syntax:["setIntersect(set1, set2)"],description:"Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setIntersect([1, 2, 3, 4], [3, 4, 5, 6])","setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setUnion","setDifference"]},setIsSubset:{name:"setIsSubset",category:"Set",syntax:["setIsSubset(set1, set2)"],description:"Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setIsSubset([1, 2], [3, 4, 5, 6])","setIsSubset([3, 4], [3, 4, 5, 6])"],seealso:["setUnion","setIntersect","setDifference"]},setMultiplicity:{name:"setMultiplicity",category:"Set",syntax:["setMultiplicity(element, set)"],description:"Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.",examples:["setMultiplicity(1, [1, 2, 2, 4])","setMultiplicity(2, [1, 2, 2, 4])"],seealso:["setDistinct","setSize"]},setPowerset:{name:"setPowerset",category:"Set",syntax:["setPowerset(set)"],description:"Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.",examples:["setPowerset([1, 2, 3])"],seealso:["setCartesian"]},setSize:{name:"setSize",category:"Set",syntax:["setSize(set)","setSize(set, unique)"],description:'Count the number of elements of a (multi)set. When the second parameter "unique" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',examples:["setSize([1, 2, 2, 4])","setSize([1, 2, 2, 4], true)"],seealso:["setUnion","setIntersect","setDifference"]},setSymDifference:{name:"setSymDifference",category:"Set",syntax:["setSymDifference(set1, set2)"],description:"Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])","setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setUnion","setIntersect","setDifference"]},setUnion:{name:"setUnion",category:"Set",syntax:["setUnion(set1, set2)"],description:"Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setUnion([1, 2, 3, 4], [3, 4, 5, 6])","setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setIntersect","setDifference"]},erf:{name:"erf",category:"Special",syntax:["erf(x)"],description:"Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x",examples:["erf(0.2)","erf(-0.5)","erf(4)"],seealso:[]},cumsum:{name:"cumsum",category:"Statistics",syntax:["cumsum(a, b, c, ...)","cumsum(A)"],description:"Compute the cumulative sum of all values.",examples:["cumsum(2, 3, 4, 1)","cumsum([2, 3, 4, 1])","cumsum([1, 2; 3, 4])","cumsum([1, 2; 3, 4], 1)","cumsum([1, 2; 3, 4], 2)"],seealso:["max","mean","median","min","prod","std","sum","variance"]},mad:{name:"mad",category:"Statistics",syntax:["mad(a, b, c, ...)","mad(A)"],description:"Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.",examples:["mad(10, 20, 30)","mad([1, 2, 3])"],seealso:["mean","median","std","abs"]},max:{name:"max",category:"Statistics",syntax:["max(a, b, c, ...)","max(A)","max(A, dim)"],description:"Compute the maximum value of a list of values.",examples:["max(2, 3, 4, 1)","max([2, 3, 4, 1])","max([2, 5; 4, 3])","max([2, 5; 4, 3], 1)","max([2, 5; 4, 3], 2)","max(2.7, 7.1, -4.5, 2.0, 4.1)","min(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["mean","median","min","prod","std","sum","variance"]},mean:{name:"mean",category:"Statistics",syntax:["mean(a, b, c, ...)","mean(A)","mean(A, dim)"],description:"Compute the arithmetic mean of a list of values.",examples:["mean(2, 3, 4, 1)","mean([2, 3, 4, 1])","mean([2, 5; 4, 3])","mean([2, 5; 4, 3], 1)","mean([2, 5; 4, 3], 2)","mean([1.0, 2.7, 3.2, 4.0])"],seealso:["max","median","min","prod","std","sum","variance"]},median:{name:"median",category:"Statistics",syntax:["median(a, b, c, ...)","median(A)"],description:"Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.",examples:["median(5, 2, 7)","median([3, -1, 5, 7])"],seealso:["max","mean","min","prod","std","sum","variance","quantileSeq"]},min:{name:"min",category:"Statistics",syntax:["min(a, b, c, ...)","min(A)","min(A, dim)"],description:"Compute the minimum value of a list of values.",examples:["min(2, 3, 4, 1)","min([2, 3, 4, 1])","min([2, 5; 4, 3])","min([2, 5; 4, 3], 1)","min([2, 5; 4, 3], 2)","min(2.7, 7.1, -4.5, 2.0, 4.1)","max(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["max","mean","median","prod","std","sum","variance"]},mode:{name:"mode",category:"Statistics",syntax:["mode(a, b, c, ...)","mode(A)","mode(A, a, b, B, c, ...)"],description:"Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.",examples:["mode(2, 1, 4, 3, 1)","mode([1, 2.7, 3.2, 4, 2.7])","mode(1, 4, 6, 1, 6)"],seealso:["max","mean","min","median","prod","std","sum","variance"]},prod:{name:"prod",category:"Statistics",syntax:["prod(a, b, c, ...)","prod(A)"],description:"Compute the product of all values.",examples:["prod(2, 3, 4)","prod([2, 3, 4])","prod([2, 5; 4, 3])"],seealso:["max","mean","min","median","min","std","sum","variance"]},quantileSeq:{name:"quantileSeq",category:"Statistics",syntax:["quantileSeq(A, prob[, sorted])","quantileSeq(A, [prob1, prob2, ...][, sorted])","quantileSeq(A, N[, sorted])"],description:"Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probablity are: Number, BigNumber. \n\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.",examples:["quantileSeq([3, -1, 5, 7], 0.5)","quantileSeq([3, -1, 5, 7], [1/3, 2/3])","quantileSeq([3, -1, 5, 7], 2)","quantileSeq([-1, 3, 5, 7], 0.5, true)"],seealso:["mean","median","min","max","prod","std","sum","variance"]},std:{name:"std",category:"Statistics",syntax:["std(a, b, c, ...)","std(A)","std(A, normalization)"],description:'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["std(2, 4, 6)","std([2, 4, 6, 8])",'std([2, 4, 6, 8], "uncorrected")','std([2, 4, 6, 8], "biased")',"std([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","prod","sum","variance"]},sum:{name:"sum",category:"Statistics",syntax:["sum(a, b, c, ...)","sum(A)"],description:"Compute the sum of all values.",examples:["sum(2, 3, 4, 1)","sum([2, 3, 4, 1])","sum([2, 5; 4, 3])"],seealso:["max","mean","median","min","prod","std","sum","variance"]},variance:{name:"variance",category:"Statistics",syntax:["variance(a, b, c, ...)","variance(A)","variance(A, normalization)"],description:'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["variance(2, 4, 6)","variance([2, 4, 6, 8])",'variance([2, 4, 6, 8], "uncorrected")','variance([2, 4, 6, 8], "biased")',"variance([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","min","prod","std","sum"]},acos:{name:"acos",category:"Trigonometry",syntax:["acos(x)"],description:"Compute the inverse cosine of a value in radians.",examples:["acos(0.5)","acos(cos(2.3))"],seealso:["cos","atan","asin"]},acosh:{name:"acosh",category:"Trigonometry",syntax:["acosh(x)"],description:"Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.",examples:["acosh(1.5)"],seealso:["cosh","asinh","atanh"]},acot:{name:"acot",category:"Trigonometry",syntax:["acot(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acot(0.5)","acot(cot(0.5))","acot(2)"],seealso:["cot","atan"]},acoth:{name:"acoth",category:"Trigonometry",syntax:["acoth(x)"],description:"Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.",examples:["acoth(2)","acoth(0.5)"],seealso:["acsch","asech"]},acsc:{name:"acsc",category:"Trigonometry",syntax:["acsc(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acsc(2)","acsc(csc(0.5))","acsc(0.5)"],seealso:["csc","asin","asec"]},acsch:{name:"acsch",category:"Trigonometry",syntax:["acsch(x)"],description:"Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.",examples:["acsch(0.5)"],seealso:["asech","acoth"]},asec:{name:"asec",category:"Trigonometry",syntax:["asec(x)"],description:"Calculate the inverse secant of a value.",examples:["asec(0.5)","asec(sec(0.5))","asec(2)"],seealso:["acos","acot","acsc"]},asech:{name:"asech",category:"Trigonometry",syntax:["asech(x)"],description:"Calculate the inverse secant of a value.",examples:["asech(0.5)"],seealso:["acsch","acoth"]},asin:{name:"asin",category:"Trigonometry",syntax:["asin(x)"],description:"Compute the inverse sine of a value in radians.",examples:["asin(0.5)","asin(sin(0.5))"],seealso:["sin","acos","atan"]},asinh:{name:"asinh",category:"Trigonometry",syntax:["asinh(x)"],description:"Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.",examples:["asinh(0.5)"],seealso:["acosh","atanh"]},atan:{name:"atan",category:"Trigonometry",syntax:["atan(x)"],description:"Compute the inverse tangent of a value in radians.",examples:["atan(0.5)","atan(tan(0.5))"],seealso:["tan","acos","asin"]},atanh:{name:"atanh",category:"Trigonometry",syntax:["atanh(x)"],description:"Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.",examples:["atanh(0.5)"],seealso:["acosh","asinh"]},atan2:{name:"atan2",category:"Trigonometry",syntax:["atan2(y, x)"],description:"Computes the principal value of the arc tangent of y/x in radians.",examples:["atan2(2, 2) / pi","angle = 60 deg in rad","x = cos(angle)","y = sin(angle)","atan2(y, x)"],seealso:["sin","cos","tan"]},cos:{name:"cos",category:"Trigonometry",syntax:["cos(x)"],description:"Compute the cosine of x in radians.",examples:["cos(2)","cos(pi / 4) ^ 2","cos(180 deg)","cos(60 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["acos","sin","tan"]},cosh:{name:"cosh",category:"Trigonometry",syntax:["cosh(x)"],description:"Compute the hyperbolic cosine of x in radians.",examples:["cosh(0.5)"],seealso:["sinh","tanh","coth"]},cot:{name:"cot",category:"Trigonometry",syntax:["cot(x)"],description:"Compute the cotangent of x in radians. Defined as 1/tan(x)",examples:["cot(2)","1 / tan(2)"],seealso:["sec","csc","tan"]},coth:{name:"coth",category:"Trigonometry",syntax:["coth(x)"],description:"Compute the hyperbolic cotangent of x in radians.",examples:["coth(2)","1 / tanh(2)"],seealso:["sech","csch","tanh"]},csc:{name:"csc",category:"Trigonometry",syntax:["csc(x)"],description:"Compute the cosecant of x in radians. Defined as 1/sin(x)",examples:["csc(2)","1 / sin(2)"],seealso:["sec","cot","sin"]},csch:{name:"csch",category:"Trigonometry",syntax:["csch(x)"],description:"Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)",examples:["csch(2)","1 / sinh(2)"],seealso:["sech","coth","sinh"]},sec:{name:"sec",category:"Trigonometry",syntax:["sec(x)"],description:"Compute the secant of x in radians. Defined as 1/cos(x)",examples:["sec(2)","1 / cos(2)"],seealso:["cot","csc","cos"]},sech:{name:"sech",category:"Trigonometry",syntax:["sech(x)"],description:"Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)",examples:["sech(2)","1 / cosh(2)"],seealso:["coth","csch","cosh"]},sin:{name:"sin",category:"Trigonometry",syntax:["sin(x)"],description:"Compute the sine of x in radians.",examples:["sin(2)","sin(pi / 4) ^ 2","sin(90 deg)","sin(30 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["asin","cos","tan"]},sinh:{name:"sinh",category:"Trigonometry",syntax:["sinh(x)"],description:"Compute the hyperbolic sine of x in radians.",examples:["sinh(0.5)"],seealso:["cosh","tanh"]},tan:{name:"tan",category:"Trigonometry",syntax:["tan(x)"],description:"Compute the tangent of x in radians.",examples:["tan(0.5)","sin(0.5) / cos(0.5)","tan(pi / 4)","tan(45 deg)"],seealso:["atan","sin","cos"]},tanh:{name:"tanh",category:"Trigonometry",syntax:["tanh(x)"],description:"Compute the hyperbolic tangent of x in radians.",examples:["tanh(0.5)","sinh(0.5) / cosh(0.5)"],seealso:["sinh","cosh"]},to:{name:"to",category:"Units",syntax:["x to unit","to(x, unit)"],description:"Change the unit of a value.",examples:["5 inch to cm","3.2kg to g","16 bytes in bits"],seealso:[]},clone:{name:"clone",category:"Utils",syntax:["clone(x)"],description:"Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices",examples:["clone(3.5)","clone(2 - 4i)","clone(45 deg)","clone([1, 2; 3, 4])",'clone("hello world")'],seealso:[]},format:{name:"format",category:"Utils",syntax:["format(value)","format(value, precision)"],description:"Format a value of any type as string.",examples:["format(2.3)","format(3 - 4i)","format([])","format(pi, 3)"],seealso:["print"]},bin:{name:"bin",category:"Utils",syntax:["bin(value)"],description:"Format a number as binary",examples:["bin(2)"],seealso:["oct","hex"]},oct:{name:"oct",category:"Utils",syntax:["oct(value)"],description:"Format a number as octal",examples:["oct(56)"],seealso:["bin","hex"]},hex:{name:"hex",category:"Utils",syntax:["hex(value)"],description:"Format a number as hexadecimal",examples:["hex(240)"],seealso:["bin","oct"]},isNaN:{name:"isNaN",category:"Utils",syntax:["isNaN(x)"],description:"Test whether a value is NaN (not a number)",examples:["isNaN(2)","isNaN(0 / 0)","isNaN(NaN)","isNaN(Infinity)"],seealso:["isNegative","isNumeric","isPositive","isZero"]},isInteger:{name:"isInteger",category:"Utils",syntax:["isInteger(x)"],description:"Test whether a value is an integer number.",examples:["isInteger(2)","isInteger(3.5)","isInteger([3, 0.5, -2])"],seealso:["isNegative","isNumeric","isPositive","isZero"]},isNegative:{name:"isNegative",category:"Utils",syntax:["isNegative(x)"],description:"Test whether a value is negative: smaller than zero.",examples:["isNegative(2)","isNegative(0)","isNegative(-4)","isNegative([3, 0.5, -2])"],seealso:["isInteger","isNumeric","isPositive","isZero"]},isNumeric:{name:"isNumeric",category:"Utils",syntax:["isNumeric(x)"],description:"Test whether a value is a numeric value. Returns true when the input is a number, BigNumber, Fraction, or boolean.",examples:["isNumeric(2)",'isNumeric("2")','hasNumericValue("2")',"isNumeric(0)","isNumeric(bignumber(500))","isNumeric(fraction(0.125))","isNumeric(2 + 3i)",'isNumeric([2.3, "foo", false])'],seealso:["isInteger","isZero","isNegative","isPositive","isNaN","hasNumericValue"]},hasNumericValue:{name:"hasNumericValue",category:"Utils",syntax:["hasNumericValue(x)"],description:"Test whether a value is an numeric value. In case of a string, true is returned if the string contains a numeric value.",examples:["hasNumericValue(2)",'hasNumericValue("2")','isNumeric("2")',"hasNumericValue(0)","hasNumericValue(bignumber(500))","hasNumericValue(fraction(0.125))","hasNumericValue(2 + 3i)",'hasNumericValue([2.3, "foo", false])'],seealso:["isInteger","isZero","isNegative","isPositive","isNaN","isNumeric"]},isPositive:{name:"isPositive",category:"Utils",syntax:["isPositive(x)"],description:"Test whether a value is positive: larger than zero.",examples:["isPositive(2)","isPositive(0)","isPositive(-4)","isPositive([3, 0.5, -2])"],seealso:["isInteger","isNumeric","isNegative","isZero"]},isPrime:{name:"isPrime",category:"Utils",syntax:["isPrime(x)"],description:"Test whether a value is prime: has no divisors other than itself and one.",examples:["isPrime(3)","isPrime(-2)","isPrime([2, 17, 100])"],seealso:["isInteger","isNumeric","isNegative","isZero"]},isZero:{name:"isZero",category:"Utils",syntax:["isZero(x)"],description:"Test whether a value is zero.",examples:["isZero(2)","isZero(0)","isZero(-4)","isZero([3, 0, -2, 0])"],seealso:["isInteger","isNumeric","isNegative","isPositive"]},print:{name:"print",category:"Utils",syntax:["print(template, values)","print(template, values, precision)"],description:"Interpolate values into a string template.",examples:['print("Lucy is $age years old", {age: 5})','print("The value of pi is $pi", {pi: pi}, 3)','print("Hello, $user.name!", {user: {name: "John"}})','print("Values: $0, $1, $2", [6, 9, 4])'],seealso:["format"]},typeOf:{name:"typeOf",category:"Utils",syntax:["typeOf(x)"],description:"Get the type of a variable.",examples:["typeOf(3.5)","typeOf(2 - 4i)","typeOf(45 deg)",'typeOf("hello world")'],seealso:["getMatrixDataType"]},numeric:{name:"numeric",category:"Utils",syntax:["numeric(x)"],description:"Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.",examples:['numeric("4")','numeric("4", "number")','numeric("4", "BigNumber")','numeric("4", "Fraction)','numeric(4, "Fraction")','numeric(fraction(2, 5), "number)'],seealso:["number","fraction","bignumber","string","format"]}},ju=Qe("help",["typed","mathWithTransform","Help"],(function(e){var t=e.typed,r=e.mathWithTransform,n=e.Help;return t("help",{any:function(e){var t,i=e;if("string"!=typeof e)for(t in r)if(Je(r,t)&&e===r[t]){i=t;break}var a=at(Du,i);if(!a){var o="function"==typeof i?i.name:i;throw new Error('No documentation found on "'+o+'"')}return new n(a)}})})),Pu=Qe("chain",["typed","Chain"],(function(e){var t=e.typed,r=e.Chain;return t("chain",{"":function(){return new r},any:function(e){return new r(e)}})})),Fu=Qe("det",["typed","matrix","subtract","multiply","unaryMinus","lup"],(function(e){var t=e.typed,r=e.matrix,n=e.subtract,i=e.multiply,a=e.unaryMinus,o=e.lup;return t("det",{any:function(e){return He(e)},"Array | Matrix":function(e){var t;switch((t=m(e)?e.size():Array.isArray(e)?(e=r(e)).size():[]).length){case 0:return He(e);case 1:if(1===t[0])return He(e.valueOf()[0]);throw new RangeError("Matrix must be square (size: "+xe(t)+")");case 2:var s=t[0],u=t[1];if(s===u)return function(e,t,r){if(1===t)return He(e[0][0]);if(2===t)return n(i(e[0][0],e[1][1]),i(e[1][0],e[0][1]));for(var s=o(e),u=s.U[0][0],c=1;c<t;c++)u=i(u,s.U[c][c]);for(var f=0,l=0,p=[];;){for(;p[l];)l++;if(l>=t)break;for(var m=l,h=0;!p[s.p[m]];)p[s.p[m]]=!0,m=s.p[m],h++;h%2==0&&f++}return f%2==0?u:a(u)}(e.clone().valueOf(),s);throw new RangeError("Matrix must be square (size: "+xe(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+xe(t)+")")}}})})),Uu=Qe("inv",["typed","matrix","divideScalar","addScalar","multiply","unaryMinus","det","identity","abs"],(function(e){var t=e.typed,r=e.matrix,n=e.divideScalar,i=e.addScalar,a=e.multiply,o=e.unaryMinus,s=e.det,u=e.identity,c=e.abs;return t("inv",{"Array | Matrix":function(e){var t=m(e)?e.size():Se(e);switch(t.length){case 1:if(1===t[0])return m(e)?r([n(1,e.valueOf()[0])]):[n(1,e[0])];throw new RangeError("Matrix must be square (size: "+xe(t)+")");case 2:var i=t[0],a=t[1];if(i===a)return m(e)?r(f(e.valueOf(),i,a),e.storage()):f(e,i,a);throw new RangeError("Matrix must be square (size: "+xe(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+xe(t)+")")}},any:function(e){return n(1,e)}});function f(e,t,r){var f,l,p,m,h;if(1===t){if(0===(m=e[0][0]))throw Error("Cannot calculate inverse, determinant is zero");return[[n(1,m)]]}if(2===t){var d=s(e);if(0===d)throw Error("Cannot calculate inverse, determinant is zero");return[[n(e[1][1],d),n(o(e[0][1]),d)],[n(o(e[1][0]),d),n(e[0][0],d)]]}var v=e.concat();for(f=0;f<t;f++)v[f]=v[f].concat();for(var y=u(t).valueOf(),g=0;g<r;g++){var x=c(v[g][g]),b=g;for(f=g+1;f<t;)c(v[f][g])>x&&(x=c(v[f][g]),b=f),f++;if(0===x)throw Error("Cannot calculate inverse, determinant is zero");(f=b)!==g&&(h=v[g],v[g]=v[f],v[f]=h,h=y[g],y[g]=y[f],y[f]=h);var w=v[g],N=y[g];for(f=0;f<t;f++){var M=v[f],E=y[f];if(f!==g){if(0!==M[g]){for(p=n(o(M[g]),w[g]),l=g;l<r;l++)M[l]=i(M[l],a(p,w[l]));for(l=0;l<r;l++)E[l]=i(E[l],a(p,N[l]))}}else{for(p=w[g],l=g;l<r;l++)M[l]=n(M[l],p);for(l=0;l<r;l++)E[l]=n(E[l],p)}}}return y}}));r(243);function Lu(e,t){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(!r){if(Array.isArray(e)||(r=function(e,t){if(!e)return;if("string"==typeof e)return $u(e,t);var r=Object.prototype.toString.call(e).slice(8,-1);"Object"===r&&e.constructor&&(r=e.constructor.name);if("Map"===r||"Set"===r)return Array.from(e);if("Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r))return $u(e,t)}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,i=function(){};return{s:i,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,s=!1;return{s:function(){r=r.call(e)},n:function(){var e=r.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==r.return||r.return()}finally{if(s)throw a}}}}function $u(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=new Array(t);r<t;r++)n[r]=e[r];return n}function Hu(e){var t=e.addScalar,r=e.subtract,n=e.flatten,i=e.multiply,a=e.multiplyScalar,o=e.divideScalar,s=e.sqrt,u=e.abs,c=e.bignumber,f=e.diag,l=e.inv,p=e.qr,m=e.usolve,h=e.usolveAll,d=e.equal,v=e.complex,y=e.larger,g=e.smaller,x=e.matrixFromColumns,b=e.dot;function w(e,t,n,i,a,o,s,f){var l="BigNumber"===f,p="Complex"===f,m=l?c(0):p?v(0):0,h=l?c(1):p?v(1):1;if(g(u(n),s))return[[h,m],[m,h]];if(y(u(r(a,o)),s))return[[r(a,i),r(o,i)],[n,n]];var d=r(e,a),x=r(t,a),b=r(n,a),w=r(i,a);return g(u(x),s)?[[d,h],[b,m]]:[[x,m],[w,h]]}function N(e,t){for(var r=0;r<e.length;r++){var n;(n=e[r]).push.apply(n,ja()(Array(t-e[r].length).fill(0)))}for(var i=e.length;i<t;i++)e.push(Array(t).fill(0)),e[i][i]=1;return e}function M(e,t,r){for(var n=0;n<e.length;n++)if(r(e[n],t))return n;return-1}function E(e,t,r,n,i){for(var a,o="BigNumber"===i?c(1e3):1e3,s=0;a=S(t,r,i),a=m(e,a),!y(O(a),o);)if(++s>=5)return null;for(s=0;;){var u=m(e,a);if(g(O(A(a,[u])),n))break;if(++s>=10)return null;a=C(u)}return a}function S(e,t,r){var n="BigNumber"===r,i="Complex"===r,a=Array(e).fill(0).map((function(e){return 2*Math.random()-1}));return n&&(a=a.map((function(e){return c(e)}))),i&&(a=a.map((function(e){return v(e)}))),C(a=A(a,t),r)}function A(e,t){var n,a=Lu(t);try{for(a.s();!(n=a.n()).done;){var s=n.value;e=r(e,i(o(b(s,e),b(s,s)),s))}}catch(e){a.e(e)}finally{a.f()}return e}function O(e){return u(s(b(e,e)))}function C(e,t){var r="Complex"===t,n="BigNumber"===t?c(1):r?v(1):1;return i(o(n,O(e)),e)}return function(e,m,b,S,A){void 0===A&&(A=!0);var O=function(e,r,n,i,s){var l,p="BigNumber"===i,m="Complex"===i,h=p?c(0):0,x=p?c(1):m?v(1):1,b=p?c(1):1,w=p?c(10):2,N=a(w,w);s&&(l=Array(r).fill(x));var M=!1;for(;!M;){M=!0;for(var E=0;E<r;E++){for(var S=h,A=h,O=0;O<r;O++)if(E!==O){var C=u(e[E][O]);S=t(S,C),A=t(A,C)}if(!d(S,0)&&!d(A,0)){for(var _=b,T=S,I=o(A,w),k=a(A,w);g(T,I);)T=a(T,N),_=a(_,w);for(;y(T,k);)T=o(T,N),_=o(_,w);if(g(o(t(T,A),_),a(t(S,A),.95))){M=!1;for(var z=o(1,_),q=0;q<r;q++)E!==q&&(e[E][q]=a(e[E][q],_),e[q][E]=a(e[q][E],z));s&&(l[E]=a(l[E],_))}}}}return f(l)}(e,m,0,S,A);!function(e,n,i,s,f,l){var p="BigNumber"===s,m="Complex"===s,h=p?c(0):m?v(0):0;p&&(i=c(i));for(var d=0;d<n-2;d++){for(var y=0,x=h,b=d+1;b<n;b++){var w=e[b][d];g(u(x),u(w))&&(x=w,y=b)}if(!g(u(x),i)){if(y!==d+1){var N=e[y];e[y]=e[d+1],e[d+1]=N;for(var M=0;M<n;M++){var E=e[M][y];e[M][y]=e[M][d+1],e[M][d+1]=E}if(f){var S=l[y];l[y]=l[d+1],l[d+1]=S}}for(var A=d+2;A<n;A++){var O=o(e[A][d],x);if(0!==O){for(var C=0;C<n;C++)e[A][C]=r(e[A][C],a(O,e[d+1][C]));for(var _=0;_<n;_++)e[_][d+1]=t(e[_][d+1],a(O,e[_][A]));if(f)for(var T=0;T<n;T++)l[A][T]=r(l[A][T],a(O,l[d+1][T]))}}}}}(e,m,b,S,A,O);var C,_=function(e,n,o,l,m){var h="BigNumber"===l,d="Complex"===l,y=h?c(1):d?v(1):1;h&&(o=c(o));var x=He(e),b=[],M=n,E=[],S=m?f(Array(n).fill(y)):void 0,A=m?f(Array(M).fill(y)):void 0,O=0;for(;O<=100;){O+=1;for(var C=0;C<M;C++)x[C][C]=r(x[C][C],0);var _=p(x),T=_.Q,I=_.R;x=i(I,T);for(var k=0;k<M;k++)x[k][k]=t(x[k][k],0);if(m&&(A=i(A,T)),1===M||g(u(x[M-1][M-2]),o)){O=0,b.push(x[M-1][M-1]),m&&(E.unshift([[1]]),N(A,n),S=i(S,A),M>1&&(A=f(Array(M-1).fill(y)))),M-=1,x.pop();for(var z=0;z<M;z++)x[z].pop()}else if(2===M||g(u(x[M-2][M-3]),o)){O=0;var q=(B=x[M-2][M-2],D=x[M-2][M-1],j=x[M-1][M-2],P=x[M-1][M-1],F=void 0,U=void 0,L=void 0,$=void 0,F=t(B,P),U=r(a(B,P),a(D,j)),L=a(F,.5),$=a(s(r(a(F,F),a(4,U))),.5),[t(L,$),r(L,$)]);b.push.apply(b,ja()(q)),m&&(E.unshift(w(x[M-2][M-2],x[M-2][M-1],x[M-1][M-2],x[M-1][M-1],q[0],q[1],o,l)),N(A,n),S=i(S,A),M>2&&(A=f(Array(M-2).fill(y)))),M-=2,x.pop(),x.pop();for(var R=0;R<M;R++)x[R].pop(),x[R].pop()}if(0===M)break}var B,D,j,P,F,U,L,$;if(b.sort((function(e,t){return+r(u(e),u(t))})),O>100){var H=Error("The eigenvalues failed to converge. Only found these eigenvalues: "+b.join(", "));throw H.values=b,H.vectors=[],H}var G=m?i(S,function(e,t){for(var r=[],n=0;n<t;n++)r[n]=Array(t).fill(0);var i,a=0,o=Lu(e);try{for(o.s();!(i=o.n()).done;){for(var s=i.value,u=s.length,c=0;c<u;c++)for(var f=0;f<u;f++)r[a+c][a+f]=s[c][f];a+=u}}catch(e){o.e(e)}finally{o.f()}return r}(E,n)):void 0;return{values:b,C:G}}(e,m,b,S,A),T=_.values,I=_.C;return A&&(C=function(e,t,a,o,s,u,p){var m,y=l(a),g=i(y,e,a),x="BigNumber"===p,b="Complex"===p,w=x?c(0):b?v(0):0,N=x?c(1):b?v(1):1,S=[],A=[],O=Lu(s);try{for(O.s();!(m=O.n()).done;){var C=m.value,_=M(S,C,d);-1===_?(S.push(C),A.push(1)):A[_]+=1}}catch(D){O.e(D)}finally{O.f()}for(var T=[],I=S.length,k=Array(t).fill(w),z=f(Array(t).fill(N)),q=[],R=function(e){var s=S[e],c=r(g,i(s,z)),f=h(c,k);for(f.shift();f.length<A[e];){var m=E(c,t,f,u,p);if(null==m){q.push(s);break}f.push(m)}var d=i(l(o),a);f=f.map((function(e){return i(d,e)})),T.push.apply(T,ja()(f.map((function(e){return n(e)}))))},B=0;B<I;B++)R(B);if(0!==q.length){var D=new Error("Failed to find eigenvectors for the following eigenvalues: "+q.join(", "));throw D.values=s,D.vectors=T,D}return T}(e,m,I,O,T,b,S),C=x.apply(void 0,ja()(C))),{values:T,vectors:C}}}var Gu=Qe("eigs",["config","typed","matrix","addScalar","equal","subtract","abs","atan","cos","sin","multiplyScalar","divideScalar","inv","bignumber","multiply","add","larger","column","flatten","number","complex","sqrt","diag","qr","usolve","usolveAll","im","re","smaller","matrixFromColumns","dot"],(function(e){var t=e.config,r=e.typed,n=e.matrix,i=e.addScalar,a=e.subtract,f=e.equal,l=e.abs,p=e.atan,m=e.cos,h=e.sin,d=e.multiplyScalar,v=e.divideScalar,y=e.inv,g=e.bignumber,x=e.multiply,b=e.add,w=e.larger,N=e.column,M=e.flatten,E=e.number,S=e.complex,A=e.sqrt,O=e.diag,C=e.qr,_=e.usolve,T=e.usolveAll,I=e.im,k=e.re,z=e.smaller,q=e.matrixFromColumns,R=e.dot,B=function(e){var t=e.config,r=e.addScalar,n=e.subtract,i=e.abs,a=e.atan,o=e.cos,s=e.sin,u=e.multiplyScalar,c=e.inv,f=e.bignumber,l=e.multiply,p=e.add;function m(e,t){for(var r,n=e.length,i=Math.abs(t/n),a=new Array(n),o=0;o<n;o++)a[o]=E(n,0),a[o][o]=1;for(var s=w(e);Math.abs(s[1])>=Math.abs(i);){var u=s[0][0],c=s[0][1];e=b(e,r=d(e[u][u],e[c][c],e[u][c]),u,c),a=y(a,r,u,c),s=w(e)}for(var f=E(n,0),l=0;l<n;l++)f[l]=e[l][l];return M(He(f),He(a))}function h(e,t){for(var r,n=e.length,a=i(t/n),o=new Array(n),s=0;s<n;s++)o[s]=E(n,0),o[s][s]=1;for(var u=N(e);i(u[1])>=i(a);){var c=u[0][0],f=u[0][1];e=x(e,r=v(e[c][c],e[f][f],e[c][f]),c,f),o=g(o,r,c,f),u=N(e)}for(var l=E(n,0),p=0;p<n;p++)l[p]=e[p][p];return M(He(l),He(o))}function d(e,r,n){var i=r-e;return Math.abs(i)<=t.epsilon?Math.PI/4:.5*Math.atan(2*n/(r-e))}function v(e,r,o){var s=n(r,e);return i(s)<=t.epsilon?f(-1).acos().div(4):u(.5,a(l(2,o,c(s))))}function y(e,t,r,n){for(var i=e.length,a=Math.cos(t),o=Math.sin(t),s=E(i,0),u=E(i,0),c=0;c<i;c++)s[c]=a*e[c][r]-o*e[c][n],u[c]=o*e[c][r]+a*e[c][n];for(var f=0;f<i;f++)e[f][r]=s[f],e[f][n]=u[f];return e}function g(e,t,i,a){for(var c=e.length,l=o(t),p=s(t),m=E(c,f(0)),h=E(c,f(0)),d=0;d<c;d++)m[d]=n(u(l,e[d][i]),u(p,e[d][a])),h[d]=r(u(p,e[d][i]),u(l,e[d][a]));for(var v=0;v<c;v++)e[v][i]=m[v],e[v][a]=h[v];return e}function x(e,t,i,a){for(var c=e.length,m=f(o(t)),h=f(s(t)),d=u(m,m),v=u(h,h),y=E(c,f(0)),g=E(c,f(0)),x=l(f(2),m,h,e[i][a]),b=r(n(u(d,e[i][i]),x),u(v,e[a][a])),w=p(u(v,e[i][i]),x,u(d,e[a][a])),N=0;N<c;N++)y[N]=n(u(m,e[i][N]),u(h,e[a][N])),g[N]=r(u(h,e[i][N]),u(m,e[a][N]));e[i][i]=b,e[a][a]=w,e[i][a]=f(0),e[a][i]=f(0);for(var M=0;M<c;M++)M!==i&&M!==a&&(e[i][M]=y[M],e[M][i]=y[M],e[a][M]=g[M],e[M][a]=g[M]);return e}function b(e,t,r,n){for(var i=e.length,a=Math.cos(t),o=Math.sin(t),s=a*a,u=o*o,c=E(i,0),f=E(i,0),l=s*e[r][r]-2*a*o*e[r][n]+u*e[n][n],p=u*e[r][r]+2*a*o*e[r][n]+s*e[n][n],m=0;m<i;m++)c[m]=a*e[r][m]-o*e[n][m],f[m]=o*e[r][m]+a*e[n][m];e[r][r]=l,e[n][n]=p,e[r][n]=0,e[n][r]=0;for(var h=0;h<i;h++)h!==r&&h!==n&&(e[r][h]=c[h],e[h][r]=c[h],e[n][h]=f[h],e[h][n]=f[h]);return e}function w(e){for(var t=e.length,r=0,n=[0,1],i=0;i<t;i++)for(var a=i+1;a<t;a++)Math.abs(r)<Math.abs(e[i][a])&&(r=Math.abs(e[i][a]),n=[i,a]);return[n,r]}function N(e){for(var t=e.length,r=0,n=[0,1],a=0;a<t;a++)for(var o=a+1;o<t;o++)i(r)<i(e[a][o])&&(r=i(e[a][o]),n=[a,o]);return[n,r]}function M(e,t){for(var r=e.length,n=Array(r),a=Array(r),o=0;o<r;o++)a[o]=Array(r);for(var s=0;s<r;s++){for(var u=0,c=e[0],f=0;f<e.length;f++)i(e[f])<i(c)&&(c=e[u=f]);n[s]=e.splice(u,1)[0];for(var l=0;l<r;l++)a[l][s]=t[l][u],t[l].splice(u,1)}return{values:n,vectors:a}}function E(e,t){for(var r=new Array(e),n=0;n<e;n++)r[n]=t;return r}return function(e,r){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:t.epsilon,i=arguments.length>3?arguments[3]:void 0;if("number"===i)return m(e,n);if("BigNumber"===i)return h(e,n);throw TypeError("Unsupported data type: "+i)}}({config:t,addScalar:i,subtract:a,column:N,flatten:M,equal:f,abs:l,atan:p,cos:m,sin:h,multiplyScalar:d,inv:y,bignumber:g,complex:S,multiply:x,add:b}),D=Hu({config:t,addScalar:i,subtract:a,multiply:x,multiplyScalar:d,flatten:M,divideScalar:v,sqrt:A,abs:l,bignumber:g,diag:O,qr:C,inv:y,usolve:_,usolveAll:T,equal:f,complex:S,larger:w,smaller:z,matrixFromColumns:q,dot:R});return r("eigs",{Array:function(e){return j(n(e))},"Array, number|BigNumber":function(e,t){return j(n(e),t)},Matrix:function(e){var t=j(e),r=t.values,i=t.vectors;return{values:n(r),vectors:n(i)}},"Matrix, number|BigNumber":function(e,t){var r=j(e,t),i=r.values,a=r.vectors;return{values:n(i),vectors:n(a)}}});function j(e,r){void 0===r&&(r=t.epsilon);var n=e.size();if(2!==n.length||n[0]!==n[1])throw new RangeError("Matrix must be square (size: "+xe(n)+")");var i=e.toArray(),o=n[0];if(function(e,t,r){for(var n=0;n<t;n++)for(var i=0;i<t;i++)if(w(g(l(I(e[n][i]))),r))return!1;return!0}(i,o,r)&&(function(e,t){for(var r=0;r<t;r++)for(var n=0;n<t;n++)e[r][n]=k(e[r][n])}(i,o),function(e,t,r){for(var n=0;n<t;n++)for(var i=n;i<t;i++)if(w(g(l(a(e[n][i],e[i][n]))),r))return!1;return!0}(i,o,r))){var s=P(e,i,o);return B(i,o,r,s)}var u=P(e,i,o);return D(i,o,r,u)}function P(e,t,r){var n=e.datatype();if("number"===n||"BigNumber"===n||"Complex"===n)return n;for(var i=!1,a=!1,f=!1,l=0;l<r;l++)for(var p=0;p<r;p++){var m=t[l][p];if(o(m)||c(m))i=!0;else if(s(m))a=!0;else{if(!u(m))throw TypeError("Unsupported type in Matrix: "+H(m));f=!0}}if(a&&f&&console.warn("Complex BigNumbers not supported, this operation will lose precission."),f){for(var h=0;h<r;h++)for(var d=0;d<r;d++)t[h][d]=S(t[h][d]);return"Complex"}if(a){for(var v=0;v<r;v++)for(var y=0;y<r;y++)t[v][y]=g(t[v][y]);return"BigNumber"}if(i){for(var x=0;x<r;x++)for(var b=0;b<r;b++)t[x][b]=E(t[x][b]);return"number"}throw TypeError("Matrix contains unsupported types only.")}})),Vu=Qe("expm",["typed","abs","add","identity","inv","multiply"],(function(e){var t=e.typed,r=e.abs,n=e.add,i=e.identity,a=e.inv,o=e.multiply;return t("expm",{Matrix:function(e){var t=e.size();if(2!==t.length||t[0]!==t[1])throw new RangeError("Matrix must be square (size: "+xe(t)+")");for(var u=t[0],c=function(e,t){for(var r=0;r<30;r++)for(var n=0;n<=r;n++){var i=r-n;if(s(e,n,i)<t)return{q:n,j:i}}throw new Error("Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)")}(function(e){for(var t=e.size()[0],n=0,i=0;i<t;i++){for(var a=0,o=0;o<t;o++)a+=r(e.get([i,o]));n=Math.max(a,n)}return n}(e),1e-15),f=c.q,l=c.j,p=o(e,Math.pow(2,-l)),m=i(u),h=i(u),d=1,y=p,g=-1,x=1;x<=f;x++)x>1&&(y=o(y,p),g=-g),m=n(m,o(d=d*(f-x+1)/((2*f-x+1)*x),y)),h=n(h,o(d*g,y));for(var b=o(a(h),m),w=0;w<l;w++)b=o(b,b);return v(e)?e.createSparseMatrix(b):b}});function s(e,t,r){for(var n=1,i=2;i<=t;i++)n*=i;for(var a=n,o=t+1;o<=2*t;o++)a*=o;var s=a*(2*t+1);return 8*Math.pow(e/Math.pow(2,r),2*t)*n*n/(a*s)}})),Zu=Qe("sqrtm",["typed","abs","add","multiply","sqrt","subtract","inv","size","max","identity"],(function(e){var t=e.typed,r=e.abs,n=e.add,i=e.multiply,a=e.sqrt,o=e.subtract,s=e.inv,u=e.size,c=e.max,f=e.identity;function l(e){var t,a=0,l=e,p=f(u(e));do{var m=l;if(l=i(.5,n(m,s(p))),p=i(.5,n(p,s(m))),(t=c(r(o(l,m))))>1e-6&&++a>1e3)throw new Error("computing square root of matrix: iterative method could not converge")}while(t>1e-6);return l}return t("sqrtm",{"Array | Matrix":function(e){var t=m(e)?e.size():Se(e);switch(t.length){case 1:if(1===t[0])return a(e);throw new RangeError("Matrix must be square (size: "+xe(t)+")");case 2:if(t[0]===t[1])return l(e);throw new RangeError("Matrix must be square (size: "+xe(t)+")");default:throw new RangeError("Matrix must be at most two dimensional (size: "+xe(t)+")")}}})})),Wu=Qe("divide",["typed","matrix","multiply","equalScalar","divideScalar","inv"],(function(e){var t=e.typed,r=e.matrix,n=e.multiply,i=e.equalScalar,a=e.divideScalar,o=e.inv,s=rn({typed:t,equalScalar:i}),u=nn({typed:t});return t("divide",Ve({"Array | Matrix, Array | Matrix":function(e,t){return n(e,o(t))},"DenseMatrix, any":function(e,t){return u(e,t,a,!1)},"SparseMatrix, any":function(e,t){return s(e,t,a,!1)},"Array, any":function(e,t){return u(r(e),t,a,!1).valueOf()},"any, Array | Matrix":function(e,t){return n(e,o(t))}},a.signatures))})),Yu=Qe("distance",["typed","addScalar","subtract","divideScalar","multiplyScalar","unaryMinus","sqrt","abs"],(function(e){var t=e.typed,r=e.addScalar,n=e.subtract,i=e.multiplyScalar,a=e.divideScalar,o=e.unaryMinus,u=e.sqrt,c=e.abs;return t("distance",{"Array, Array, Array":function(e,t,r){if(2===e.length&&2===t.length&&2===r.length){if(!l(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!l(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!l(r))throw new TypeError("Array with 2 numbers or BigNumbers expected for third argument");var s=a(n(r[1],r[0]),n(t[1],t[0])),u=i(i(s,s),t[0]),c=o(i(s,t[0])),f=e[1];return v(e[0],e[1],u,c,f)}throw new TypeError("Invalid Arguments: Try again")},"Object, Object, Object":function(e,t,r){if(2===Object.keys(e).length&&2===Object.keys(t).length&&2===Object.keys(r).length){if(!l(e))throw new TypeError("Values of pointX and pointY should be numbers or BigNumbers");if(!l(t))throw new TypeError("Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers");if(!l(r))throw new TypeError("Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers");if("pointX"in e&&"pointY"in e&&"lineOnePtX"in t&&"lineOnePtY"in t&&"lineTwoPtX"in r&&"lineTwoPtY"in r){var s=a(n(r.lineTwoPtY,r.lineTwoPtX),n(t.lineOnePtY,t.lineOnePtX)),u=i(i(s,s),t.lineOnePtX),c=o(i(s,t.lineOnePtX)),f=e.pointX;return v(e.pointX,e.pointY,u,c,f)}throw new TypeError("Key names do not match")}throw new TypeError("Invalid Arguments: Try again")},"Array, Array":function(e,t){if(2===e.length&&3===t.length){if(!l(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!p(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");return v(e[0],e[1],t[0],t[1],t[2])}if(3===e.length&&6===t.length){if(!p(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!h(t))throw new TypeError("Array with 6 numbers or BigNumbers expected for second argument");return y(e[0],e[1],e[2],t[0],t[1],t[2],t[3],t[4],t[5])}if(e.length===t.length&&e.length>0){if(!m(e))throw new TypeError("All values of an array should be numbers or BigNumbers");if(!m(t))throw new TypeError("All values of an array should be numbers or BigNumbers");return g(e,t)}throw new TypeError("Invalid Arguments: Try again")},"Object, Object":function(e,t){if(2===Object.keys(e).length&&3===Object.keys(t).length){if(!l(e))throw new TypeError("Values of pointX and pointY should be numbers or BigNumbers");if(!p(t))throw new TypeError("Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers");if("pointX"in e&&"pointY"in e&&"xCoeffLine"in t&&"yCoeffLine"in t&&"constant"in t)return v(e.pointX,e.pointY,t.xCoeffLine,t.yCoeffLine,t.constant);throw new TypeError("Key names do not match")}if(3===Object.keys(e).length&&6===Object.keys(t).length){if(!p(e))throw new TypeError("Values of pointX, pointY and pointZ should be numbers or BigNumbers");if(!h(t))throw new TypeError("Values of x0, y0, z0, a, b and c should be numbers or BigNumbers");if("pointX"in e&&"pointY"in e&&"x0"in t&&"y0"in t&&"z0"in t&&"a"in t&&"b"in t&&"c"in t)return y(e.pointX,e.pointY,e.pointZ,t.x0,t.y0,t.z0,t.a,t.b,t.c);throw new TypeError("Key names do not match")}if(2===Object.keys(e).length&&2===Object.keys(t).length){if(!l(e))throw new TypeError("Values of pointOneX and pointOneY should be numbers or BigNumbers");if(!l(t))throw new TypeError("Values of pointTwoX and pointTwoY should be numbers or BigNumbers");if("pointOneX"in e&&"pointOneY"in e&&"pointTwoX"in t&&"pointTwoY"in t)return g([e.pointOneX,e.pointOneY],[t.pointTwoX,t.pointTwoY]);throw new TypeError("Key names do not match")}if(3===Object.keys(e).length&&3===Object.keys(t).length){if(!p(e))throw new TypeError("Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers");if(!p(t))throw new TypeError("Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers");if("pointOneX"in e&&"pointOneY"in e&&"pointOneZ"in e&&"pointTwoX"in t&&"pointTwoY"in t&&"pointTwoZ"in t)return g([e.pointOneX,e.pointOneY,e.pointOneZ],[t.pointTwoX,t.pointTwoY,t.pointTwoZ]);throw new TypeError("Key names do not match")}throw new TypeError("Invalid Arguments: Try again")},Array:function(e){if(!function(e){if(2===e[0].length&&f(e[0][0])&&f(e[0][1])){if(e.some((function(e){return 2!==e.length||!f(e[0])||!f(e[1])})))return!1}else{if(!(3===e[0].length&&f(e[0][0])&&f(e[0][1])&&f(e[0][2])))return!1;if(e.some((function(e){return 3!==e.length||!f(e[0])||!f(e[1])||!f(e[2])})))return!1}return!0}(e))throw new TypeError("Incorrect array format entered for pairwise distance calculation");return function(e){for(var t=[],r=[],n=[],i=0;i<e.length-1;i++)for(var a=i+1;a<e.length;a++)2===e[0].length?(r=[e[i][0],e[i][1]],n=[e[a][0],e[a][1]]):3===e[0].length&&(r=[e[i][0],e[i][1],e[i][2]],n=[e[a][0],e[a][1],e[a][2]]),t.push(g(r,n));return t}(e)}});function f(e){return"number"==typeof e||s(e)}function l(e){return e.constructor!==Array&&(e=d(e)),f(e[0])&&f(e[1])}function p(e){return e.constructor!==Array&&(e=d(e)),f(e[0])&&f(e[1])&&f(e[2])}function m(e){return Array.isArray(e)||(e=d(e)),e.every(f)}function h(e){return e.constructor!==Array&&(e=d(e)),f(e[0])&&f(e[1])&&f(e[2])&&f(e[3])&&f(e[4])&&f(e[5])}function d(e){for(var t=Object.keys(e),r=[],n=0;n<t.length;n++)r.push(e[t[n]]);return r}function v(e,t,n,o,s){var f=c(r(r(i(n,e),i(o,t)),s)),l=u(r(i(n,n),i(o,o)));return a(f,l)}function y(e,t,o,s,c,f,l,p,m){var h=[n(i(n(c,t),m),i(n(f,o),p)),n(i(n(f,o),l),i(n(s,e),m)),n(i(n(s,e),p),i(n(c,t),l))];h=u(r(r(i(h[0],h[0]),i(h[1],h[1])),i(h[2],h[2])));var d=u(r(r(i(l,l),i(p,p)),i(m,m)));return a(h,d)}function g(e,t){for(var a=e.length,o=0,s=0,c=0;c<a;c++)s=n(e[c],t[c]),o=r(i(s,s),o);return u(o)}})),Ju=Qe("intersect",["typed","config","abs","add","addScalar","matrix","multiply","multiplyScalar","divideScalar","subtract","smaller","equalScalar","flatten","isZero","isNumeric"],(function(e){var t=e.typed,r=e.config,n=e.abs,i=e.add,a=e.addScalar,o=e.matrix,s=e.multiply,u=e.multiplyScalar,c=e.divideScalar,f=e.subtract,l=e.smaller,p=e.equalScalar,m=e.flatten,h=e.isZero,d=e.isNumeric;return t("intersect",{"Array, Array, Array":v,"Array, Array, Array, Array":y,"Matrix, Matrix, Matrix":function(e,t,r){var n=v(e.valueOf(),t.valueOf(),r.valueOf());return null===n?null:o(n)},"Matrix, Matrix, Matrix, Matrix":function(e,t,r,n){var i=y(e.valueOf(),t.valueOf(),r.valueOf(),n.valueOf());return null===i?null:o(i)}});function v(e,t,r){if(e=g(e),t=g(t),r=g(r),!b(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!b(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!function(e){return 4===e.length&&d(e[0])&&d(e[1])&&d(e[2])&&d(e[3])}(r))throw new TypeError("Array with 4 numbers expected as third argument");return function(e,t,r,n,i,o,s,l,p,m){var h=u(e,s),d=u(n,s),v=u(t,l),y=u(i,l),g=u(r,p),x=u(o,p),b=f(f(f(m,h),v),g),w=f(f(f(a(a(d,y),x),h),v),g),N=c(b,w),M=a(e,u(N,f(n,e))),E=a(t,u(N,f(i,t))),S=a(r,u(N,f(o,r)));return[M,E,S]}(e[0],e[1],e[2],t[0],t[1],t[2],r[0],r[1],r[2],r[3])}function y(e,t,o,m){if(e=g(e),t=g(t),o=g(o),m=g(m),2===e.length){if(!x(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!x(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!x(o))throw new TypeError("Array with 2 numbers or BigNumbers expected for third argument");if(!x(m))throw new TypeError("Array with 2 numbers or BigNumbers expected for fourth argument");return function(e,t,o,p){var m=e,d=o,v=f(m,t),y=f(d,p),g=f(u(v[0],y[1]),u(y[0],v[1]));if(h(g))return null;if(l(n(g),r.epsilon))return null;var x=u(y[0],m[1]),b=u(y[1],m[0]),w=u(y[0],d[1]),N=u(y[1],d[0]),M=c(a(f(f(x,b),w),N),g);return i(s(v,M),m)}(e,t,o,m)}if(3===e.length){if(!b(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!b(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!b(o))throw new TypeError("Array with 3 numbers or BigNumbers expected for third argument");if(!b(m))throw new TypeError("Array with 3 numbers or BigNumbers expected for fourth argument");return function(e,t,r,n,i,o,s,l,m,d,v,y){var g=w(e,s,d,s,t,l,v,l,r,m,y,m),x=w(d,s,n,e,v,l,i,t,y,m,o,r),b=w(e,s,n,e,t,l,i,t,r,m,o,r),N=w(d,s,d,s,v,l,v,l,y,m,y,m),M=w(n,e,n,e,i,t,i,t,o,r,o,r),E=f(u(g,x),u(b,N)),S=f(u(M,N),u(x,x));if(h(S))return null;var A=c(E,S),O=c(a(g,u(A,x)),N),C=a(e,u(A,f(n,e))),_=a(t,u(A,f(i,t))),T=a(r,u(A,f(o,r))),I=a(s,u(O,f(d,s))),k=a(l,u(O,f(v,l))),z=a(m,u(O,f(y,m)));return p(C,I)&&p(_,k)&&p(T,z)?[C,_,T]:null}(e[0],e[1],e[2],t[0],t[1],t[2],o[0],o[1],o[2],m[0],m[1],m[2])}throw new TypeError("Arrays with two or thee dimensional points expected")}function g(e){return 1===e.length?e[0]:e.length>1&&Array.isArray(e[0])&&e.every((function(e){return Array.isArray(e)&&1===e.length}))?m(e):e}function x(e){return 2===e.length&&d(e[0])&&d(e[1])}function b(e){return 3===e.length&&d(e[0])&&d(e[1])&&d(e[2])}function w(e,t,r,n,i,o,s,c,l,p,m,h){var d=u(f(e,t),f(r,n)),v=u(f(i,o),f(s,c)),y=u(f(l,p),f(m,h));return a(a(d,v),y)}})),Xu=Qe("sum",["typed","config","add","numeric"],(function(e){var t=e.typed,r=e.config,n=e.add,i=e.numeric;return t("sum",{"Array | Matrix":a,"Array | Matrix, number | BigNumber":function(e,t){try{return Vt(e,t,n)}catch(e){throw ca(e,"sum")}},"...":function(e){if($t(e))throw new TypeError("Scalar values expected in function sum");return a(e)}});function a(e){var t;return Ht(e,(function(e){try{t=void 0===t?e:n(t,e)}catch(t){throw ca(t,"sum",e)}})),void 0===t&&(t=i(0,r.number)),"string"==typeof t&&(t=i(t,r.number)),t}})),Qu=Qe("cumsum",["typed","add","unaryPlus"],(function(e){var t=e.typed,r=e.add,n=e.unaryPlus;return t("cumsum",{Array:i,Matrix:function(e){return e.create(i(e.valueOf()))},"Array, number | BigNumber":o,"Matrix, number | BigNumber":function(e,t){return e.create(o(e.valueOf(),t))},"...":function(e){if($t(e))throw new TypeError("All values expected to be scalar in function cumsum");return i(e)}});function i(e){try{return a(e)}catch(e){throw ca(e,"cumsum")}}function a(e){if(0===e.length)return[];for(var t=[n(e[0])],i=1;i<e.length;++i)t.push(r(t[i-1],e[i]));return t}function o(e,t){var r=Se(e);if(t<0||t>=r.length)throw new Ee(t,r.length);try{return function e(t,r){var n,i,o;if(r<=0){var s=t[0][0];if(Array.isArray(s)){for(o=Lt(t),i=[],n=0;n<o.length;n++)i[n]=e(o[n],r-1);return i}return a(t)}for(i=[],n=0;n<t.length;n++)i[n]=e(t[n],r-1);return i}(e,t)}catch(e){throw ca(e,"cumsum")}}})),Ku=Qe("mean",["typed","add","divide"],(function(e){var t=e.typed,r=e.add,n=e.divide;return t("mean",{"Array | Matrix":i,"Array | Matrix, number | BigNumber":function(e,t){try{var i=Vt(e,t,r),a=Array.isArray(e)?Se(e):e.size();return n(i,a[t])}catch(e){throw ca(e,"mean")}},"...":function(e){if($t(e))throw new TypeError("Scalar values expected in function mean");return i(e)}});function i(e){var t,i=0;if(Ht(e,(function(e){try{t=void 0===t?e:r(t,e),i++}catch(t){throw ca(t,"mean",e)}})),0===i)throw new Error("Cannot calculate the mean of an empty array");return n(t,i)}})),ec=Qe("median",["typed","add","divide","compare","partitionSelect"],(function(e){var t=e.typed,r=e.add,n=e.divide,i=e.compare,a=e.partitionSelect;function o(e){try{var t=(e=qe(e.valueOf())).length;if(0===t)throw new Error("Cannot calculate median of an empty array");if(t%2==0){for(var r=t/2-1,n=a(e,r+1),o=e[r],c=0;c<r;++c)i(e[c],o)>0&&(o=e[c]);return u(o,n)}var f=a(e,(t-1)/2);return s(f)}catch(e){throw ca(e,"median")}}var s=t({"number | BigNumber | Complex | Unit":function(e){return e}}),u=t({"number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit":function(e,t){return n(r(e,t),2)}});return t("median",{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("median(A, dim) is not yet supported")},"...":function(e){if($t(e))throw new TypeError("Scalar values expected in function median");return o(e)}})})),tc=Qe("mad",["typed","abs","map","median","subtract"],(function(e){var t=e.typed,r=e.abs,n=e.map,i=e.median,a=e.subtract;return t("mad",{"Array | Matrix":o,"...":function(e){return o(e)}});function o(e){if(0===(e=qe(e.valueOf())).length)throw new Error("Cannot calculate median absolute deviation (mad) of an empty array");try{var t=i(e);return i(n(e,(function(e){return r(a(e,t))})))}catch(e){throw e instanceof TypeError&&-1!==e.message.indexOf("median")?new TypeError(e.message.replace("median","mad")):ca(e,"mad")}}})),rc=Qe("variance",["typed","add","subtract","multiply","divide","apply","isNaN"],(function(e){var t=e.typed,r=e.add,n=e.subtract,i=e.multiply,a=e.divide,o=e.apply,u=e.isNaN;return t("variance",{"Array | Matrix":function(e){return c(e,"unbiased")},"Array | Matrix, string":c,"Array | Matrix, number | BigNumber":function(e,t){return f(e,t,"unbiased")},"Array | Matrix, number | BigNumber, string":f,"...":function(e){return c(e,"unbiased")}});function c(e,t){var o,c=0;if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");if(Ht(e,(function(e){try{o=void 0===o?e:r(o,e),c++}catch(t){throw ca(t,"variance",e)}})),0===c)throw new Error("Cannot calculate variance of an empty array");var f=a(o,c);if(o=void 0,Ht(e,(function(e){var t=n(e,f);o=void 0===o?i(t,t):r(o,i(t,t))})),u(o))return o;switch(t){case"uncorrected":return a(o,c);case"biased":return a(o,c+1);case"unbiased":var l=s(o)?o.mul(0):0;return 1===c?l:a(o,c-1);default:throw new Error('Unknown normalization "'+t+'". Choose "unbiased" (default), "uncorrected", or "biased".')}}function f(e,t,r){try{if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");return o(e,t,(function(e){return c(e,r)}))}catch(e){throw ca(e,"variance")}}})),nc=Qe("quantileSeq",["typed","add","multiply","partitionSelect","compare"],(function(e){var t=e.typed,r=e.add,n=e.multiply,i=e.partitionSelect,a=e.compare;function u(e,t,s){var u=qe(e),f=u.length;if(0===f)throw new Error("Cannot calculate quantile of an empty sequence");if(o(t)){var l=t*(f-1),p=l%1;if(0===p){var m=s?u[l]:i(u,l);return c(m),m}var h,d,v=Math.floor(l);if(s)h=u[v],d=u[v+1];else{d=i(u,v+1),h=u[v];for(var y=0;y<v;++y)a(u[y],h)>0&&(h=u[y])}return c(h),c(d),r(n(h,1-p),n(d,p))}var g=t.times(f-1);if(g.isInteger()){g=g.toNumber();var x=s?u[g]:i(u,g);return c(x),x}var b,w,N=g.floor(),M=g.minus(N),E=N.toNumber();if(s)b=u[E],w=u[E+1];else{w=i(u,E+1),b=u[E];for(var S=0;S<E;++S)a(u[S],b)>0&&(b=u[S])}c(b),c(w);var A=new M.constructor(1);return r(n(b,A.minus(M)),n(w,M))}var c=t({"number | BigNumber | Unit":function(e){return e}});return function(e,t,r){var n,i,a;if(arguments.length<2||arguments.length>3)throw new SyntaxError("Function quantileSeq requires two or three parameters");if(h(e)){if("boolean"==typeof(r=r||!1)){if(i=e.valueOf(),o(t)){if(t<0)throw new Error("N/prob must be non-negative");if(t<=1)return u(i,t,r);if(t>1){if(!Z(t))throw new Error("N must be a positive integer");var c=t+1;n=new Array(t);for(var f=0;f<t;)n[f]=u(i,++f/c,r);return n}}if(s(t)){var l=t.constructor;if(t.isNegative())throw new Error("N/prob must be non-negative");if(a=new l(1),t.lte(a))return new l(u(i,t,r));if(t.gt(a)){if(!t.isInteger())throw new Error("N must be a positive integer");var p=t.toNumber();if(p>4294967295)throw new Error("N must be less than or equal to 2^32-1, as that is the maximum length of an Array");var m=new l(p+1);n=new Array(p);for(var d=0;d<p;)n[d]=new l(u(i,new l(++d).div(m),r));return n}}if(Array.isArray(t)){n=new Array(t.length);for(var v=0;v<n.length;++v){var y=t[v];if(o(y)){if(y<0||y>1)throw new Error("Probability must be between 0 and 1, inclusive")}else{if(!s(y))throw new TypeError("Unexpected type of argument in function quantileSeq");if(a=new y.constructor(1),y.isNegative()||y.gt(a))throw new Error("Probability must be between 0 and 1, inclusive")}n[v]=u(i,y,r)}return n}throw new TypeError("Unexpected type of argument in function quantileSeq")}throw new TypeError("Unexpected type of argument in function quantileSeq")}throw new TypeError("Unexpected type of argument in function quantileSeq")}})),ic=Qe("std",["typed","sqrt","variance"],(function(e){var t=e.typed,r=e.sqrt,n=e.variance;return t("std",{"Array | Matrix":i,"Array | Matrix, string":i,"Array | Matrix, number | BigNumber":i,"Array | Matrix, number | BigNumber, string":i,"...":function(e){return i(e)}});function i(e,t){if(0===e.length)throw new SyntaxError("Function std requires one or more parameters (0 provided)");try{return r(n.apply(null,arguments))}catch(e){throw e instanceof TypeError&&-1!==e.message.indexOf(" variance")?new TypeError(e.message.replace(" variance"," std")):e}}}));function ac(e,t){if(t<e)return 1;if(t===e)return t;var r=t+e>>1;return ac(e,r)*ac(r+1,t)}function oc(e,t){if(!Z(e)||e<0)throw new TypeError("Positive integer value expected in function combinations");if(!Z(t)||t<0)throw new TypeError("Positive integer value expected in function combinations");if(t>e)throw new TypeError("k must be less than or equal to n");for(var r=e-t,n=1,i=2,a=t<r?t:r,o=t<r?r+1:t+1;o<=e;++o)for(n*=o;i<=a&&n%i==0;)n/=i,++i;return i<=a&&(n/=ac(i,a)),n}oc.signature="number, number";var sc=Qe("combinations",["typed"],(function(e){return(0,e.typed)("combinations",{"number, number":oc,"BigNumber, BigNumber":function(e,t){var r,n,i=e.constructor,a=e.minus(t),o=new i(1);if(!uc(e)||!uc(t))throw new TypeError("Positive integer value expected in function combinations");if(t.gt(e))throw new TypeError("k must be less than n in function combinations");if(r=o,t.lt(a))for(n=o;n.lte(a);n=n.plus(o))r=r.times(t.plus(n)).dividedBy(n);else for(n=o;n.lte(t);n=n.plus(o))r=r.times(a.plus(n)).dividedBy(n);return r}})}));function uc(e){return e.isInteger()&&e.gte(0)}var cc=Qe("combinationsWithRep",["typed"],(function(e){return(0,e.typed)("combinationsWithRep",{"number, number":function(e,t){if(!Z(e)||e<0)throw new TypeError("Positive integer value expected in function combinationsWithRep");if(!Z(t)||t<0)throw new TypeError("Positive integer value expected in function combinationsWithRep");if(e<1)throw new TypeError("k must be less than or equal to n + k - 1");return t<e-1?ac(e,e+t-1)/ac(1,t):ac(t+1,e+t-1)/ac(1,e-1)},"BigNumber, BigNumber":function(e,t){var r,n,i=new(0,e.constructor)(1),a=e.minus(i);if(!fc(e)||!fc(t))throw new TypeError("Positive integer value expected in function combinationsWithRep");if(e.lt(i))throw new TypeError("k must be less than or equal to n + k - 1 in function combinationsWithRep");if(r=i,t.lt(a))for(n=i;n.lte(a);n=n.plus(i))r=r.times(t.plus(n)).dividedBy(n);else for(n=i;n.lte(t);n=n.plus(i))r=r.times(a.plus(n)).dividedBy(n);return r}})}));function fc(e){return e.isInteger()&&e.gte(0)}function lc(e){var t;if(Z(e))return e<=0?isFinite(e)?1/0:NaN:e>171?1/0:ac(1,e-1);if(e<.5)return Math.PI/(Math.sin(Math.PI*e)*lc(1-e));if(e>=171.35)return 1/0;if(e>85){var r=e*e,n=r*e,i=n*e,a=i*e;return Math.sqrt(2*Math.PI/e)*Math.pow(e/Math.E,e)*(1+1/(12*e)+1/(288*r)-139/(51840*n)-571/(2488320*i)+163879/(209018880*a)+5246819/(75246796800*a*e))}--e,t=mc[0];for(var o=1;o<mc.length;++o)t+=mc[o]/(e+o);var s=e+pc+.5;return Math.sqrt(2*Math.PI)*Math.pow(s,e+.5)*Math.exp(-s)*t}lc.signature="number";var pc=4.7421875,mc=[.9999999999999971,57.15623566586292,-59.59796035547549,14.136097974741746,-.4919138160976202,3399464998481189e-20,4652362892704858e-20,-9837447530487956e-20,.0001580887032249125,-.00021026444172410488,.00021743961811521265,-.0001643181065367639,8441822398385275e-20,-26190838401581408e-21,36899182659531625e-22],hc=Qe("gamma",["typed","config","multiplyScalar","pow","BigNumber","Complex"],(function(e){var t=e.typed,r=e.config,n=(e.multiplyScalar,e.pow,e.BigNumber),i=e.Complex;return t("gamma",{number:lc,Complex:function(e){if(0===e.im)return this(e.re);if(e.re<.5){var t=new i(1-e.re,-e.im),r=new i(Math.PI*e.re,Math.PI*e.im);return new i(Math.PI).div(r.sin()).div(this(t))}e=new i(e.re-1,e.im);for(var n=new i(mc[0],0),a=1;a<mc.length;++a){var o=new i(mc[a],0);n=n.add(o.div(e.add(a)))}var s=new i(e.re+pc+.5,e.im),u=Math.sqrt(2*Math.PI),c=s.pow(e.add(.5)),f=s.neg().exp();return n.mul(u).mul(c).mul(f)},BigNumber:function(e){if(e.isInteger())return e.isNegative()||e.isZero()?new n(1/0):function e(t){if(t<8)return new n([1,1,2,6,24,120,720,5040][t]);var i=r.precision+(0|Math.log(t.toNumber())),a=n.clone({precision:i});if(t%2==1)return t.times(e(new n(t-1)));var o=t,s=new a(t),u=t.toNumber();for(;o>2;)u+=o-=2,s=s.times(u);return new n(s.toPrecision(n.precision))}(e.minus(1));if(!e.isFinite())return new n(e.isNegative()?NaN:1/0);throw new Error("Integer BigNumber expected")},"Array | Matrix":function(e){return Gt(e,this)}})})),dc=Qe("factorial",["typed","gamma"],(function(e){var t=e.typed,r=e.gamma;return t("factorial",{number:function(e){if(e<0)throw new Error("Value must be non-negative");return r(e+1)},BigNumber:function(e){if(e.isNegative())throw new Error("Value must be non-negative");return r(e.plus(1))},"Array | Matrix":function(e){return Gt(e,this)}})})),vc=Qe("kldivergence",["typed","matrix","divide","sum","multiply","dotDivide","log","isNumeric"],(function(e){var t=e.typed,r=e.matrix,n=e.divide,i=e.sum,a=e.multiply,o=e.dotDivide,s=e.log,u=e.isNumeric;return t("kldivergence",{"Array, Array":function(e,t){return c(r(e),r(t))},"Matrix, Array":function(e,t){return c(e,r(t))},"Array, Matrix":function(e,t){return c(r(e),t)},"Matrix, Matrix":function(e,t){return c(e,t)}});function c(e,t){var r=t.size().length,c=e.size().length;if(r>1)throw new Error("first object must be one dimensional");if(c>1)throw new Error("second object must be one dimensional");if(r!==c)throw new Error("Length of two vectors must be equal");if(0===i(e))throw new Error("Sum of elements in first object must be non zero");if(0===i(t))throw new Error("Sum of elements in second object must be non zero");var f=n(e,i(e)),l=n(t,i(t)),p=i(a(f,s(o(f,l))));return u(p)?p:Number.NaN}})),yc=Qe("multinomial",["typed","add","divide","multiply","factorial","isInteger","isPositive"],(function(e){var t=e.typed,r=e.add,n=e.divide,i=e.multiply,a=e.factorial,o=e.isInteger,s=e.isPositive;return t("multinomial",{"Array | Matrix":function(e){var t=0,u=1;return Ht(e,(function(e){if(!o(e)||!s(e))throw new TypeError("Positive integer value expected in function multinomial");t=r(t,e),u=i(u,a(e))})),n(a(t),u)}})})),gc=Qe("permutations",["typed","factorial"],(function(e){return(0,e.typed)("permutations",{"number | BigNumber":e.factorial,"number, number":function(e,t){if(!Z(e)||e<0)throw new TypeError("Positive integer value expected in function permutations");if(!Z(t)||t<0)throw new TypeError("Positive integer value expected in function permutations");if(t>e)throw new TypeError("second argument k must be less than or equal to first argument n");return ac(e-t+1,e)},"BigNumber, BigNumber":function(e,t){var r,n;if(!xc(e)||!xc(t))throw new TypeError("Positive integer value expected in function permutations");if(t.gt(e))throw new TypeError("second argument k must be less than or equal to first argument n");for(r=e.mul(0).add(1),n=e.minus(t).plus(1);n.lte(e);n=n.plus(1))r=r.times(n);return r}})}));function xc(e){return e.isInteger()&&e.gte(0)}var bc=r(134),wc=r.n(bc),Nc=wc()(Date.now());function Mc(e){var t,r;return t=null===(r=e)?Nc:wc()(String(r)),function(){return t()}}var Ec=Qe("pickRandom",["typed","config","?on"],(function(e){var t=e.typed,r=e.config,n=e.on,i=Mc(r.randomSeed);return n&&n("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Mc(e.randomSeed))})),t("pickRandom",{"Array | Matrix":function(e){return a(e,{})},"Array | Matrix, Object":function(e,t){return a(e,t)},"Array | Matrix, number":function(e,t){return a(e,{number:t})},"Array | Matrix, Array | Matrix":function(e,t){return a(e,{weights:t})},"Array | Matrix, Array | Matrix, number":function(e,t,r){return a(e,{number:r,weights:t})},"Array | Matrix, number, Array | Matrix":function(e,t,r){return a(e,{number:t,weights:r})}});function a(e,t){var r=t.number,n=t.weights,a=t.elementWise,s=void 0===a||a,u=void 0===r;u&&(r=1);var c=m(e)?e.create:m(n)?n.create:null;e=e.valueOf(),n&&(n=n.valueOf()),!0===s&&(e=qe(e),n=qe(n));var f=0;if(void 0!==n){if(n.length!==e.length)throw new Error("Weights must have the same length as possibles");for(var l=0,p=n.length;l<p;l++){if(!o(n[l])||n[l]<0)throw new Error("Weights must be an array of positive numbers");f+=n[l]}}for(var h,d=e.length,v=[];v.length<r;){if(void 0===n)h=e[Math.floor(i()*d)];else for(var y=i()*f,g=0,x=e.length;g<x;g++)if((y-=n[g])<0){h=e[g];break}v.push(h)}return u?v[0]:c?c(v):v}}));function Sc(e,t){var r=[];if((e=e.slice(0)).length>1)for(var n=0,i=e.shift();n<i;n++)r.push(Sc(e,t));else for(var a=0,o=e.shift();a<o;a++)r.push(t());return r}var Ac=Qe("random",["typed","config","?on"],(function(e){var t=e.typed,r=e.config,n=e.on,i=Mc(r.randomSeed);return n&&n("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Mc(e.randomSeed))})),t("random",{"":function(){return o(0,1)},number:function(e){return o(0,e)},"number, number":function(e,t){return o(e,t)},"Array | Matrix":function(e){return a(e,0,1)},"Array | Matrix, number":function(e,t){return a(e,0,t)},"Array | Matrix, number, number":function(e,t,r){return a(e,t,r)}});function a(e,t,r){var n=Sc(e.valueOf(),(function(){return o(t,r)}));return m(e)?e.create(n):n}function o(e,t){return e+i()*(t-e)}})),Oc=Qe("randomInt",["typed","config","?on"],(function(e){var t=e.typed,r=e.config,n=e.on,i=Mc(r.randomSeed);return n&&n("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Mc(e.randomSeed))})),t("randomInt",{"":function(){return o(0,1)},number:function(e){return o(0,e)},"number, number":function(e,t){return o(e,t)},"Array | Matrix":function(e){return a(e,0,1)},"Array | Matrix, number":function(e,t){return a(e,0,t)},"Array | Matrix, number, number":function(e,t,r){return a(e,t,r)}});function a(e,t,r){var n=Sc(e.valueOf(),(function(){return o(t,r)}));return m(e)?e.create(n):n}function o(e,t){return Math.floor(e+i()*(t-e))}})),Cc=Qe("stirlingS2",["typed","addScalar","subtract","multiplyScalar","divideScalar","pow","factorial","combinations","isNegative","isInteger","number","?bignumber","larger"],(function(e){var t=e.typed,r=e.addScalar,n=(e.subtract,e.multiplyScalar),i=(e.divideScalar,e.pow,e.factorial,e.combinations,e.isNegative),a=e.isInteger,s=e.number,u=e.bignumber,c=e.larger,f=[],l=[];return t("stirlingS2",{"number | BigNumber, number | BigNumber":function(e,t){if(!a(e)||i(e)||!a(t)||i(t))throw new TypeError("Non-negative integer value expected in function stirlingS2");if(c(t,e))throw new TypeError("k must be less than or equal to n in function stirlingS2");var p=!(o(e)&&o(t)),m=p?l:f,h=p?u:s,d=s(e),v=s(t);if(m[d]&&m[d].length>v)return m[d][v];for(var y=0;y<=d;++y)if(m[y]||(m[y]=[h(0===y?1:0)]),0!==y)for(var g=m[y],x=m[y-1],b=g.length;b<=y&&b<=v;++b)g[b]=b===y?1:r(n(h(b),x[b]),x[b-1]);return m[d][v]}})})),_c=Qe("bellNumbers",["typed","addScalar","isNegative","isInteger","stirlingS2"],(function(e){var t=e.typed,r=e.addScalar,n=e.isNegative,i=e.isInteger,a=e.stirlingS2;return t("bellNumbers",{"number | BigNumber":function(e){if(!i(e)||n(e))throw new TypeError("Non-negative integer value expected in function bellNumbers");for(var t=0,o=0;o<=e;o++)t=r(t,a(e,o));return t}})})),Tc=Qe("catalan",["typed","addScalar","divideScalar","multiplyScalar","combinations","isNegative","isInteger"],(function(e){var t=e.typed,r=e.addScalar,n=e.divideScalar,i=e.multiplyScalar,a=e.combinations,o=e.isNegative,s=e.isInteger;return t("catalan",{"number | BigNumber":function(e){if(!s(e)||o(e))throw new TypeError("Non-negative integer value expected in function catalan");return n(a(i(e,2),e),r(e,1))}})})),Ic=Qe("composition",["typed","addScalar","combinations","isNegative","isPositive","isInteger","larger"],(function(e){var t=e.typed,r=e.addScalar,n=e.combinations,i=e.isPositive,a=(e.isNegative,e.isInteger),o=e.larger;return t("composition",{"number | BigNumber, number | BigNumber":function(e,t){if(!(a(e)&&i(e)&&a(t)&&i(t)))throw new TypeError("Positive integer value expected in function composition");if(o(t,e))throw new TypeError("k must be less than or equal to n in function composition");return n(r(e,-1),r(t,-1))}})})),kc=Qe("leafCount",["parse","typed"],(function(e){var t=e.parse;return(0,e.typed)("leafCount",{string:function(e){return this(t(e))},Node:function(e){return function e(t){var r=0;return t.forEach((function(t){r+=e(t)})),r||1}(e)}})}));r(253);function zc(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);t&&(n=n.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),r.push.apply(r,n)}return r}function qc(e){for(var t=1;t<arguments.length;t++){var r=null!=arguments[t]?arguments[t]:{};t%2?zc(Object(r),!0).forEach((function(t){Ma()(e,t,r[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(r)):zc(Object(r)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(r,t))}))}return e}var Rc=Qe("simplifyUtil",["FunctionNode","OperatorNode","SymbolNode"],(function(e){var t=e.FunctionNode,r=e.OperatorNode,n=e.SymbolNode,i=!0,a=!1,o={add:{trivial:i,total:i,commutative:i,associative:i},unaryPlus:{trivial:i,total:i,commutative:i,associative:i},subtract:{trivial:a,total:i,commutative:a,associative:a},multiply:{trivial:i,total:i,commutative:i,associative:i},divide:{trivial:a,total:i,commutative:a,associative:a},paren:{trivial:i,total:i,commutative:i,associative:a},defaultF:{trivial:a,total:i,commutative:a,associative:a}};function s(e,t){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:o,n="defaultF";if("string"==typeof e?n=e:P(e)?n=e.fn.toString():R(e)?n=e.name:F(e)&&(n="paren"),Je(r,n)){var i=r[n];if(Je(i,t))return i[t];if(Je(o,n))return o[n][t]}if(Je(r,"defaultF")){var a=r.defaultF;return Je(a,t)?a[t]:o.defaultF[t]}if(Je(o,n)){var s=o[n];if(Je(s,t))return s[t]}return o.defaultF[t]}function u(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:o;return s(e,"associative",t)}function c(e,t){var r,n=[];return u(e,t)?(r=e.op,function e(t){for(var i=0;i<t.args.length;i++){var a=t.args[i];P(a)&&r===a.op?e(a):n.push(a)}}(e),n):e.args}function f(e){return P(e)?function(t){try{return new r(e.op,e.fn,t,e.implicit)}catch(e){return console.error(e),[]}}:function(r){return new t(new n(e.name),r)}}return{createMakeNodeFunction:f,hasProperty:s,isCommutative:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:o;return s(e,"commutative",t)},isAssociative:u,mergeContext:function(e,t){var r=qc({},e);for(var n in t)Je(e,n)?r[n]=qc(qc({},t[n]),e[n]):r[n]=t[n];return r},flatten:function e(t,r){if(!t.args||0===t.args.length)return t;t.args=c(t,r);for(var n=0;n<t.args.length;n++)e(t.args[n],r)},allChildren:c,unflattenr:function e(t,r){if(t.args&&0!==t.args.length){for(var n=f(t),i=t.args.length,a=0;a<i;a++)e(t.args[a],r);if(i>2&&u(t,r)){for(var o=t.args.pop();t.args.length>0;)o=n([t.args.pop(),o]);t.args=o.args}}},unflattenl:function e(t,r){if(t.args&&0!==t.args.length){for(var n=f(t),i=t.args.length,a=0;a<i;a++)e(t.args[a],r);if(i>2&&u(t,r)){for(var o=t.args.shift();t.args.length>0;)o=n([o,t.args.shift()]);t.args=o.args}}},defaultContext:o,realContext:{divide:{total:a},log:{total:a}},positiveContext:{subtract:{total:a},abs:{trivial:i},log:{total:i}}}}));function Bc(e,t){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(!r){if(Array.isArray(e)||(r=function(e,t){if(!e)return;if("string"==typeof e)return Dc(e,t);var r=Object.prototype.toString.call(e).slice(8,-1);"Object"===r&&e.constructor&&(r=e.constructor.name);if("Map"===r||"Set"===r)return Array.from(e);if("Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r))return Dc(e,t)}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,i=function(){};return{s:i,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,s=!1;return{s:function(){r=r.call(e)},n:function(){var e=r.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==r.return||r.return()}finally{if(s)throw a}}}}function Dc(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=new Array(t);r<t;r++)n[r]=e[r];return n}var jc=Qe("simplifyConstant",["typed","config","mathWithTransform","matrix","?fraction","?bignumber","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","SymbolNode"],(function(e){var t=e.typed,r=e.config,n=e.mathWithTransform,i=e.matrix,o=e.fraction,s=e.bignumber,u=e.AccessorNode,f=e.ArrayNode,l=e.ConstantNode,p=e.FunctionNode,h=e.IndexNode,d=e.ObjectNode,v=e.OperatorNode,y=e.SymbolNode,g=Rc({FunctionNode:p,OperatorNode:v,SymbolNode:y}),x=g.isCommutative,b=g.isAssociative,w=g.allChildren,N=g.createMakeNodeFunction;function M(e,t){return O(function e(t,r){switch(t.type){case"SymbolNode":return t;case"ConstantNode":switch(a()(t.value)){case"number":return T(t.value,r);case"string":return t.value;default:if(!isNaN(t.value))return T(t.value,r)}return t;case"FunctionNode":if(n[t.name]&&n[t.name].rawArgs)return t;if(-1===["add","multiply"].indexOf(t.name)){var o=t.args.map((function(t){return e(t,r)}));if(!o.some(D))try{return S(t.name,o,r)}catch(e){}if("size"===t.name&&1===o.length&&_(o[0])){for(var s=[],c=o[0];_(c);)s.push(c.items.length),c=c.items[0];return i(s)}return new p(t.name,o.map(O))}case"OperatorNode":var v,y,g=t.fn.toString(),E=N(t);if(P(t)&&t.isUnary())v=[e(t.args[0],r)],y=D(v[0])?E(v):S(g,v,r);else if(b(t,r.context))if(v=(v=w(t,r.context)).map((function(t){return e(t,r)})),x(g,r.context)){for(var A=[],C=[],I=0;I<v.length;I++)D(v[I])?C.push(v[I]):A.push(v[I]);A.length>1?(y=k(g,A,E,r),C.unshift(y),y=k(g,C,E,r)):y=k(g,v,E,r)}else y=k(g,v,E,r);else v=t.args.map((function(t){return e(t,r)})),y=k(g,v,E,r);return y;case"ParenthesisNode":return e(t.content,r);case"AccessorNode":return function(e,t,r){if(!B(t))return new u(O(e),O(t));if(_(e)||m(e)){for(var n=Array.from(t.dimensions);n.length>0;)if(z(n[0])&&"string"!=typeof n[0].value){var a=T(n.shift().value,r);_(e)?e=e.items[a-1]:(e=e.valueOf()[a-1])instanceof Array&&(e=i(e))}else{if(!(n.length>1&&z(n[1])&&"string"!=typeof n[1].value))break;var o,s=T(n[1].value,r),c=[],p=_(e)?e.items:e.valueOf(),d=Bc(p);try{for(d.s();!(o=d.n()).done;){var v=o.value;if(_(v))c.push(v.items[s-1]);else{if(!m(e))break;c.push(v[s-1])}}}catch(e){d.e(e)}finally{d.f()}if(c.length!==p.length)break;e=_(e)?new f(c):i(c),n.splice(1,1)}return n.length===t.dimensions.length?new u(O(e),t):n.length>0?(t=new h(n),new u(O(e),t)):e}if(j(e)&&1===t.dimensions.length&&z(t.dimensions[0])){var y=t.dimensions[0].value;return y in e.properties?e.properties[y]:new l}return new u(O(e),t)}(e(t.object,r),e(t.index,r),r);case"ArrayNode":var q=t.items.map((function(t){return e(t,r)}));return q.some(D)?new f(q.map(O)):i(q);case"IndexNode":return new h(t.dimensions.map((function(e){return M(e,r)})));case"ObjectNode":var R={};for(var F in t.properties)R[F]=M(t.properties[F],r);return new d(R);case"AssignmentNode":case"BlockNode":case"FunctionAssignmentNode":case"RangeNode":case"ConditionalNode":default:throw new Error("Unimplemented node type in simplifyConstant: ".concat(t.type))}}(e,t))}function E(e){return c(e)?e.valueOf():e instanceof Array?e.map(E):m(e)?i(E(e.valueOf())):e}function S(e,t,r){try{return n[e].apply(null,t)}catch(i){return t=t.map(E),T(n[e].apply(null,t),r)}}var A=t({Fraction:function(e){var t,r=e.s*e.n;t=r<0?new v("-","unaryMinus",[new l(-r)]):new l(r);if(1===e.d)return t;return new v("/","divide",[t,new l(e.d)])},number:function(e){return e<0?I(new l(-e)):new l(e)},BigNumber:function(e){return e<0?I(new l(-e)):new l(e)},Complex:function(e){throw new Error("Cannot convert Complex number to Node")},string:function(e){return new l(e)},Matrix:function(e){return new f(e.valueOf().map((function(e){return A(e)})))}});function O(e){return D(e)?e:A(e)}function C(e,t){if(t&&!1!==t.exactFractions&&isFinite(e)&&o){var r=o(e),n=t&&"number"==typeof t.fractionsLimit?t.fractionsLimit:1/0;if(r.valueOf()===e&&r.n<n&&r.d<n)return r}return e}var T=t({"string, Object":function(e,t){return"BigNumber"===r.number?(void 0===s&&Bi(),s(e)):"Fraction"===r.number?(void 0===o&&Di(),o(e)):C(parseFloat(e),t)},"Fraction, Object":function(e,t){return e},"BigNumber, Object":function(e,t){return e},"number, Object":function(e,t){return C(e,t)},"Complex, Object":function(e,t){return 0!==e.im?e:C(e.re,t)},"Matrix, Object":function(e,t){return i(C(e.valueOf()))},"Array, Object":function(e,t){return e.map(C)}});function I(e){return new v("-","unaryMinus",[e])}function k(e,t,r,n){return t.reduce((function(t,i){if(D(t)||D(i))D(t)?D(i)||(i=A(i)):t=A(t);else{try{return S(e,[t,i],n)}catch(e){}t=A(t),i=A(i)}return r([t,i])}))}return M})),Pc=Qe("simplify",["config","typed","parse","add","subtract","multiply","divide","pow","isZero","equal","resolve","simplifyCore","?fraction","?bignumber","mathWithTransform","matrix","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","SymbolNode"],(function(e){var t=e.config,r=e.typed,n=e.parse,i=(e.add,e.subtract,e.multiply,e.divide,e.pow,e.isZero,e.equal),o=e.resolve,s=e.simplifyCore,u=e.fraction,c=e.bignumber,f=e.mathWithTransform,l=e.matrix,p=e.AccessorNode,m=e.ArrayNode,h=e.ConstantNode,d=e.FunctionNode,v=e.IndexNode,y=e.ObjectNode,g=e.OperatorNode,x=e.ParenthesisNode,b=e.SymbolNode,w=jc({typed:r,config:t,mathWithTransform:f,matrix:l,fraction:u,bignumber:c,AccessorNode:p,ArrayNode:m,ConstantNode:h,FunctionNode:d,IndexNode:v,ObjectNode:y,OperatorNode:g,SymbolNode:b}),N=Rc({FunctionNode:d,OperatorNode:g,SymbolNode:b}),M=N.hasProperty,E=N.isCommutative,S=N.isAssociative,A=N.mergeContext,O=N.flatten,C=N.unflattenr,_=N.unflattenl,T=N.createMakeNodeFunction,I=N.defaultContext,k=N.realContext,q=N.positiveContext,R=r("simplify",{string:function(e){return this(n(e),this.rules,dt(),{})},"string, Map | Object":function(e,t){return this(n(e),this.rules,t,{})},"string, Map | Object, Object":function(e,t,r){return this(n(e),this.rules,t,r)},"string, Array":function(e,t){return this(n(e),t,dt(),{})},"string, Array, Map | Object":function(e,t,r){return this(n(e),t,r,{})},"string, Array, Map | Object, Object":function(e,t,r,i){return this(n(e),t,r,i)},"Node, Map | Object":function(e,t){return this(e,this.rules,t,{})},"Node, Map | Object, Object":function(e,t,r){return this(e,this.rules,t,r)},Node:function(e){return this(e,this.rules,dt(),{})},"Node, Array":function(e,t){return this(e,t,dt(),{})},"Node, Array, Map | Object":function(e,t,r){return this(e,t,r,{})},"Node, Array, Object, Object":function(e,t,r,n){return this(e,t,vt(r),n)},"Node, Array, Map, Object":function(e,t,r,n){var i=n.consoleDebug;t=function(e,t){for(var r=[],n=0;n<e.length;n++){var i=e[n],o=void 0,s=a()(i);switch(s){case"string":i={s:i};case"object":o=j(i,t);break;case"function":o=i;break;default:throw TypeError("Unsupported type of rule: "+s)}r.push(o)}return r}(t,n.context);for(var s=o(e,r),u={},c=(s=B(s)).toString({parenthesis:"all"});!u[c];){u[c]=!0,P=0;var f=c;i&&console.log("Working on: ",c);for(var l=0;l<t.length;l++){var p="";if("function"==typeof t[l]?(s=t[l](s,n),i&&(p=t[l].name)):(O(s,n.context),s=L(s,t[l],n.context),i&&(p="".concat(t[l].l.toString()," -> ").concat(t[l].r.toString()))),i){var m=s.toString({parenthesis:"all"});m!==f&&(console.log("Applying",p,"produced",m),f=m)}_(s,n.context)}c=s.toString({parenthesis:"all"})}return s}});function B(e){return e.transform((function(e,t,r){return F(e)?B(e.content):e}))}R.defaultContext=I,R.realContext=k,R.positiveContext=q;var D={true:!0,false:!0,e:!0,i:!0,Infinity:!0,LN2:!0,LN10:!0,LOG2E:!0,LOG10E:!0,NaN:!0,phi:!0,pi:!0,SQRT1_2:!0,SQRT2:!0,tau:!0};function j(e,t){var r={};if(e.s){var i=e.s.split("->");if(2!==i.length)throw SyntaxError("Could not parse rule: "+e.s);r.l=i[0],r.r=i[1]}else r.l=e.l,r.r=e.r;r.l=B(n(r.l)),r.r=B(n(r.r));for(var a=0,o=["imposeContext","repeat","assuming"];a<o.length;a++){var s=o[a];s in e&&(r[s]=e[s])}if(e.evaluate&&(r.evaluate=n(e.evaluate)),S(r.l,t)){var u=T(r.l),c=new b("_p"+P++);r.expanded={},r.expanded.l=u([r.l.clone(),c]),O(r.expanded.l,t),C(r.expanded.l,t),r.expanded.r=u([r.r,c])}return r}R.rules=[s,{l:"log(e)",r:"1"},{s:"n-n1 -> n+-n1",assuming:{subtract:{total:!0}}},{s:"n-n -> 0",assuming:{subtract:{total:!1}}},{s:"-(c*v) -> v * (-c)",assuming:{multiply:{commutative:!0},subtract:{total:!0}}},{s:"-(c*v) -> (-c) * v",assuming:{multiply:{commutative:!1},subtract:{total:!0}}},{s:"-(v*c) -> v * (-c)",assuming:{multiply:{commutative:!1},subtract:{total:!0}}},{l:"-(n1/n2)",r:"-n1/n2"},{l:"-v",r:"v * (-1)"},{l:"(n1 + n2)*(-1)",r:"n1*(-1) + n2*(-1)",repeat:!0},{l:"n/n1^n2",r:"n*n1^-n2"},{l:"n/n1",r:"n*n1^-1"},{s:"(n1*n2)^n3 -> n1^n3 * n2^n3",assuming:{multiply:{commutative:!0}}},{s:"(n1*n2)^(-1) -> n2^(-1) * n1^(-1)",assuming:{multiply:{commutative:!1}}},{s:"(n ^ n1) ^ n2 -> n ^ (n1 * n2)",assuming:{divide:{total:!0}}},{l:" v   * ( v   * n1 + n2)",r:"v^2       * n1 +  v   * n2"},{s:" v   * (v^n4 * n1 + n2)   ->  v^(1+n4)  * n1 +  v   * n2",assuming:{divide:{total:!0}}},{s:"v^n3 * ( v   * n1 + n2)   ->  v^(n3+1)  * n1 + v^n3 * n2",assuming:{divide:{total:!0}}},{s:"v^n3 * (v^n4 * n1 + n2)   ->  v^(n3+n4) * n1 + v^n3 * n2",assuming:{divide:{total:!0}}},{l:"n*n",r:"n^2"},{s:"n * n^n1 -> n^(n1+1)",assuming:{divide:{total:!0}}},{s:"n^n1 * n^n2 -> n^(n1+n2)",assuming:{divide:{total:!0}}},w,{s:"n+n -> 2*n",assuming:{add:{total:!0}}},{l:"n+-n",r:"0"},{l:"v*n + v",r:"v*(n+1)"},{l:"n3*n1 + n3*n2",r:"n3*(n1+n2)"},{l:"n3^(-n4)*n1 +   n3  * n2",r:"n3^(-n4)*(n1 + n3^(n4+1) *n2)"},{l:"n3^(-n4)*n1 + n3^n5 * n2",r:"n3^(-n4)*(n1 + n3^(n4+n5)*n2)"},{s:"n*v + v -> (n+1)*v",assuming:{multiply:{commutative:!1}}},{s:"n1*n3 + n2*n3 -> (n1+n2)*n3",assuming:{multiply:{commutative:!1}}},{s:"n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)",assuming:{multiply:{commutative:!1}}},{s:"n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)",assuming:{multiply:{commutative:!1}}},{l:"n*c + c",r:"(n+1)*c"},{s:"c*n + c -> c*(n+1)",assuming:{multiply:{commutative:!1}}},w,{s:"(-n)*n1 -> -(n*n1)",assuming:{subtract:{total:!0}}},{s:"n1*(-n) -> -(n1*n)",assuming:{subtract:{total:!0},multiply:{commutative:!1}}},{s:"c+v -> v+c",assuming:{add:{commutative:!0}},imposeContext:{add:{commutative:!1}}},{s:"v*c -> c*v",assuming:{multiply:{commutative:!0}},imposeContext:{multiply:{commutative:!1}}},{l:"n+-n1",r:"n-n1"},{s:"n*(n1^-1) -> n/n1",assuming:{multiply:{commutative:!0}}},{s:"n*n1^-n2 -> n/n1^n2",assuming:{multiply:{commutative:!0}}},{s:"n^-1 -> 1/n",assuming:{multiply:{commutative:!0}}},{l:"n^1",r:"n"},{s:"n*(n1/n2) -> (n*n1)/n2",assuming:{multiply:{associative:!0}}},{s:"n-(n1+n2) -> n-n1-n2",assuming:{addition:{associative:!0,commutative:!0}}},{l:"1*n",r:"n",imposeContext:{multiply:{commutative:!0}}},{s:"n1/(n2/n3) -> (n1*n3)/n2",assuming:{multiply:{associative:!0}}},{l:"n1/(-n2)",r:"-n1/n2"}];var P=0;function U(e,t,r){var n=e;if(e)for(var i=0;i<e.length;++i){var a=L(e[i],t,r);a!==e[i]&&(n===e&&(n=e.slice()),n[i]=a)}return n}function L(e,t,r){if(t.assuming)for(var n in t.assuming)for(var i in t.assuming[n])if(M(n,i,r)!==t.assuming[n][i])return e;var a=A(t.imposeContext,r),o=e;if(o instanceof g||o instanceof d){var s=U(o.args,t,r);s!==o.args&&((o=o.clone()).args=s)}else if(o instanceof x){if(o.content){var u=L(o.content,t,r);u!==o.content&&(o=new x(u))}}else if(o instanceof m){var c=U(o.items,t,r);c!==o.items&&(o=new m(c))}else if(o instanceof p){var f=o.object;o.object&&(f=L(o.object,t,r));var l=o.index;o.index&&(l=L(o.index,t,r)),f===o.object&&l===o.index||(o=new p(f,l))}else if(o instanceof v){var h=U(o.dimensions,t,r);h!==o.dimensions&&(o=new v(h))}else if(o instanceof y){var b=!1,w={};for(var N in o.properties)w[N]=L(o.properties[N],t,r),w[N]!==o.properties[N]&&(b=!0);b&&(o=new y(w))}var E=t.r,S=G(t.l,o,a)[0];if(!S&&t.expanded&&(E=t.expanded.r,S=G(t.expanded.l,o,a)[0]),S){var O=o.implicit;o=E.clone(),O&&"implicit"in E&&(o.implicit=!0),o=o.transform((function(e){return e.isSymbolNode&&Je(S.placeholders,e.name)?S.placeholders[e.name].clone():e}))}return t.repeat&&o!==e&&(o=L(o,t,r)),o}function $(e,t){var r={placeholders:{}};if(!e.placeholders&&!t.placeholders)return r;if(!e.placeholders)return t;if(!t.placeholders)return e;for(var n in e.placeholders)if(Je(e.placeholders,n)&&(r.placeholders[n]=e.placeholders[n],Je(t.placeholders,n)&&!V(e.placeholders[n],t.placeholders[n])))return null;for(var i in t.placeholders)Je(t.placeholders,i)&&(r.placeholders[i]=t.placeholders[i]);return r}function H(e,t){var r,n=[];if(0===e.length||0===t.length)return n;for(var i=0;i<e.length;i++)for(var a=0;a<t.length;a++)(r=$(e[i],t[a]))&&n.push(r);return n}function G(e,t,r,n){var a=[{placeholders:{}}];if(e instanceof g&&t instanceof g||e instanceof d&&t instanceof d){if(e instanceof g){if(e.op!==t.op||e.fn!==t.fn)return[]}else if(e instanceof d&&e.name!==t.name)return[];if(!(1===t.args.length&&1===e.args.length||!S(t,r)&&t.args.length===e.args.length||n)){if(t.args.length>=2&&2===e.args.length){for(var o=function(e,t){var r,n,i=[],a=T(e);if(E(e,t))for(var o=0;o<e.args.length;o++)(n=e.args.slice(0)).splice(o,1),r=1===n.length?n[0]:a(n),i.push(a([e.args[o],r]));else for(var s=1;s<e.args.length;s++){var u=e.args[0];s>1&&(u=a(e.args.slice(0,s))),r=1===(n=e.args.slice(s)).length?n[0]:a(n),i.push(a([u,r]))}return i}(t,r),s=[],u=0;u<o.length;u++){var c=G(e,o[u],r,!0);s=s.concat(c)}return s}if(e.args.length>2)throw Error("Unexpected non-binary associative function: "+e.toString());return[]}for(var f=[],l=0;l<e.args.length;l++){var p=G(e.args[l],t.args[l],r);if(0===p.length)break;f.push(p)}if(f.length!==e.args.length){if(!E(t,r)||1===e.args.length)return[];if(e.args.length>2)throw new Error("permuting >2 commutative non-associative rule arguments not yet implemented");var m=G(e.args[0],t.args[1],r);if(0===m.length)return[];var v=G(e.args[1],t.args[0],r);if(0===v.length)return[];f=[m,v]}a=function(e){if(0===e.length)return e;for(var t=e.reduce(H),r=[],n={},i=0;i<t.length;i++){var a=JSON.stringify(t[i]);n[a]||(n[a]=!0,r.push(t[i]))}return r}(f)}else if(e instanceof b){if(0===e.name.length)throw new Error("Symbol in rule has 0 length...!?");if(D[e.name]){if(e.name!==t.name)return[]}else if("n"===e.name[0]||"_p"===e.name.substring(0,2))a[0].placeholders[e.name]=t;else if("v"===e.name[0]){if(z(t))return[];a[0].placeholders[e.name]=t}else{if("c"!==e.name[0])throw new Error("Invalid symbol in rule: "+e.name);if(!(t instanceof h))return[];a[0].placeholders[e.name]=t}}else{if(!(e instanceof h))return[];if(!i(e.value,t.value))return[]}return a}function V(e,t){if(e instanceof h&&t instanceof h){if(!i(e.value,t.value))return!1}else if(e instanceof b&&t instanceof b){if(e.name!==t.name)return!1}else{if(!(e instanceof g&&t instanceof g||e instanceof d&&t instanceof d))return!1;if(e instanceof g){if(e.op!==t.op||e.fn!==t.fn)return!1}else if(e instanceof d&&e.name!==t.name)return!1;if(e.args.length!==t.args.length)return!1;for(var r=0;r<e.args.length;r++)if(!V(e.args[r],t.args[r]))return!1}return!0}return R})),Fc=Qe("simplifyCore",["equal","isZero","add","subtract","multiply","divide","pow","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","SymbolNode"],(function(e){var t=e.equal,r=e.isZero,n=e.add,i=e.subtract,a=e.multiply,o=e.divide,s=e.pow,u=e.AccessorNode,c=e.ArrayNode,f=e.ConstantNode,l=e.FunctionNode,p=e.IndexNode,m=e.ObjectNode,h=e.OperatorNode,d=(e.ParenthesisNode,e.SymbolNode),v=new f(0),y=new f(1),g=Rc({FunctionNode:l,OperatorNode:h,SymbolNode:d}),x=g.hasProperty,b=g.isCommutative;return function e(d,g){var w=g?g.context:void 0;if(x(d,"trivial",w)){if(R(d)&&1===d.args.length)return e(d.args[0],g);var N=!1,M=0;if(d.forEach((function(t){1===++M&&(N=e(t,g))})),1===M)return N}if(P(d)&&d.isUnary()){var E=e(d.args[0],g);if("-"===d.op){if(P(E)){if(E.isUnary()&&"-"===E.op)return E.args[0];if(E.isBinary()&&"subtract"===E.fn)return new h("-","subtract",[E.args[1],E.args[0]])}return new h(d.op,d.fn,[E])}}else{if(P(d)&&d.isBinary()){var S=e(d.args[0],g),A=e(d.args[1],g);if("+"===d.op){if(z(S)){if(r(S.value))return A;if(z(A))return new f(n(S.value,A.value))}return z(A)&&r(A.value)?S:P(A)&&A.isUnary()&&"-"===A.op?new h("-","subtract",[S,A.args[0]]):new h(d.op,d.fn,A?[S,A]:[S])}if("-"===d.op){if(z(S)&&A){if(z(A))return new f(i(S.value,A.value));if(r(S.value))return new h("-","unaryMinus",[A])}if("subtract"===d.fn)return z(A)&&r(A.value)?S:P(A)&&A.isUnary()&&"-"===A.op?e(new h("+","add",[S,A.args[0]]),g):new h(d.op,d.fn,[S,A])}else{if("*"===d.op){if(z(S)){if(r(S.value))return v;if(t(S.value,1))return A;if(z(A))return new f(a(S.value,A.value))}if(z(A)){if(r(A.value))return v;if(t(A.value,1))return S;if(P(S)&&S.isBinary()&&S.op===d.op&&b(d,w)){var O=S.args[0];if(z(O)){var T=new f(a(O.value,A.value));return new h(d.op,d.fn,[T,S.args[1]],d.implicit)}}return b(d,w)?new h(d.op,d.fn,[A,S],d.implicit):new h(d.op,d.fn,[S,A],d.implicit)}return new h(d.op,d.fn,[S,A],d.implicit)}if("/"===d.op){if(z(S)){if(r(S.value))return v;if(z(A)&&(t(A.value,1)||t(A.value,2)||t(A.value,4)))return new f(o(S.value,A.value))}return new h(d.op,d.fn,[S,A])}if("^"===d.op&&z(A)){if(r(A.value))return y;if(t(A.value,1))return S;if(z(S))return new f(s(S.value,A.value));if(P(S)&&S.isBinary()&&"^"===S.op){var I=S.args[1];if(z(I))return new h(d.op,d.fn,[S.args[0],new f(a(I.value,A.value))])}}}return new h(d.op,d.fn,[S,A])}if(R(d))return new l(e(d.fn),d.args.map((function(t){return e(t,g)})));if(_(d))return new c(d.items.map((function(t){return e(t,g)})));if(C(d))return new u(e(d.object,g),e(d.index,g));if(B(d))return new p(d.dimensions.map((function(t){return e(t,g)})));if(j(d)){var k={};for(var q in d.properties)k[q]=e(d.properties[q],g);return new m(k)}}return d}})),Uc=Qe("resolve",["parse","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode"],(function(e){var t=e.parse,r=e.ConstantNode,n=e.FunctionNode,i=e.OperatorNode,a=e.ParenthesisNode;return function e(o,s){var u=arguments.length>2&&void 0!==arguments[2]?arguments[2]:new Set;if(!s)return o;if(yt(s)||(s=vt(s)),L(o)){if(u.has(o.name)){var c=Array.from(u).join(", ");throw new ReferenceError("recursive loop of variable definitions among {".concat(c,"}"))}var f=s.get(o.name);if(D(f)){var l=new Set(u);return l.add(o.name),e(f,s,l)}return"number"==typeof f?t(String(f)):void 0!==f?new r(f):o}if(P(o)){var p=o.args.map((function(t){return e(t,s,u)}));return new i(o.op,o.fn,p,o.implicit)}if(F(o))return new a(e(o.content,s,u));if(R(o)){var m=o.args.map((function(t){return e(t,s,u)}));return new n(o.name,m)}return o.map((function(t){return e(t,s,u)}))}})),Lc=Qe("symbolicEqual",["parse","simplify","typed","OperatorNode"],(function(e){var t=e.parse,r=e.simplify,n=e.typed,i=e.OperatorNode;return n("symbolicEqual",{"string, string":function(e,r){return this(t(e),t(r),{})},"string, string, Object":function(e,r,n){return this(t(e),t(r),n)},"Node, string":function(e,r){return this(e,t(r),{})},"Node, string, Object":function(e,r,n){return this(e,t(r),n)},"string, Node":function(e,r){return this(t(e),r,{})},"string, Node, Object":function(e,r,n){return this(t(e),r,n)},"Node, Node":function(e,t){return this(e,t,{})},"Node, Node, Object":function(e,t,n){var a=new i("-","subtract",[e,t]),o=r(a,{},n);return z(o)&&!o.value}})})),$c=Qe("derivative",["typed","config","parse","simplify","equal","isZero","numeric","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode","SymbolNode"],(function(e){var t=e.typed,r=e.config,n=e.parse,i=e.simplify,a=e.equal,o=e.isZero,s=e.numeric,u=e.ConstantNode,c=e.FunctionNode,f=e.OperatorNode,l=e.ParenthesisNode,p=e.SymbolNode,m=t("derivative",{"Node, SymbolNode, Object":function(e,t,r){var n={};d(n,e,t.name);var a=v(e,n);return r.simplify?i(a):a},"Node, SymbolNode":function(e,t){return this(e,t,{simplify:!0})},"string, SymbolNode":function(e,t){return this(n(e),t)},"string, SymbolNode, Object":function(e,t,r){return this(n(e),t,r)},"string, string":function(e,t){return this(n(e),n(t))},"string, string, Object":function(e,t,r){return this(n(e),n(t),r)},"Node, string":function(e,t){return this(e,n(t))},"Node, string, Object":function(e,t,r){return this(e,n(t),r)}});m._simplify=!0,m.toTex=function(e){return h.apply(null,e.args)};var h=t("_derivTex",{"Node, SymbolNode":function(e,t){return z(e)&&"string"===H(e.value)?h(n(e.value).toString(),t.toString(),1):h(e.toString(),t.toString(),1)},"Node, ConstantNode":function(e,t){if("string"===H(t.value))return h(e,n(t.value));throw new Error("The second parameter to 'derivative' is a non-string constant")},"Node, SymbolNode, ConstantNode":function(e,t,r){return h(e.toString(),t.name,r.value)},"string, string, number":function(e,t,r){return(1===r?"{d\\over d"+t+"}":"{d^{"+r+"}\\over d"+t+"^{"+r+"}}")+"\\left[".concat(e,"\\right]")}}),d=t("constTag",{"Object, ConstantNode, string":function(e,t){return e[t]=!0,!0},"Object, SymbolNode, string":function(e,t,r){return t.name!==r&&(e[t]=!0,!0)},"Object, ParenthesisNode, string":function(e,t,r){return d(e,t.content,r)},"Object, FunctionAssignmentNode, string":function(e,t,r){return-1===t.params.indexOf(r)?(e[t]=!0,!0):d(e,t.expr,r)},"Object, FunctionNode | OperatorNode, string":function(e,t,r){if(t.args.length>0){for(var n=d(e,t.args[0],r),i=1;i<t.args.length;++i)n=d(e,t.args[i],r)&&n;if(n)return e[t]=!0,!0}return!1}}),v=t("_derivative",{"ConstantNode, Object":function(e){return y(0)},"SymbolNode, Object":function(e,t){return void 0!==t[e]?y(0):y(1)},"ParenthesisNode, Object":function(e,t){return new l(v(e.content,t))},"FunctionAssignmentNode, Object":function(e,t){return void 0!==t[e]?y(0):v(e.expr,t)},"FunctionNode, Object":function(e,t){if(1!==e.args.length&&function(e){if(("log"===e.name||"nthRoot"===e.name||"pow"===e.name)&&2===e.args.length)return;for(var t=0;t<e.args.length;++t)e.args[t]=y(0);throw e.compile().evaluate(),new Error("Expected TypeError, but none found")}(e),void 0!==t[e])return y(0);var r,n,i,a,o=e.args[0],s=!1,u=!1;switch(e.name){case"cbrt":s=!0,n=new f("*","multiply",[y(3),new f("^","pow",[o,new f("/","divide",[y(2),y(3)])])]);break;case"sqrt":case"nthRoot":if(1===e.args.length)s=!0,n=new f("*","multiply",[y(2),new c("sqrt",[o])]);else if(2===e.args.length)return t[r=new f("/","divide",[y(1),e.args[1]])]=t[e.args[1]],v(new f("^","pow",[o,r]),t);break;case"log10":r=y(10);case"log":if(r||1!==e.args.length){if(1===e.args.length&&r||2===e.args.length&&void 0!==t[e.args[1]])n=new f("*","multiply",[o.clone(),new c("log",[r||e.args[1]])]),s=!0;else if(2===e.args.length)return v(new f("/","divide",[new c("log",[o]),new c("log",[e.args[1]])]),t)}else n=o.clone(),s=!0;break;case"pow":return t[r]=t[e.args[1]],v(new f("^","pow",[o,e.args[1]]),t);case"exp":n=new c("exp",[o.clone()]);break;case"sin":n=new c("cos",[o.clone()]);break;case"cos":n=new f("-","unaryMinus",[new c("sin",[o.clone()])]);break;case"tan":n=new f("^","pow",[new c("sec",[o.clone()]),y(2)]);break;case"sec":n=new f("*","multiply",[e,new c("tan",[o.clone()])]);break;case"csc":u=!0,n=new f("*","multiply",[e,new c("cot",[o.clone()])]);break;case"cot":u=!0,n=new f("^","pow",[new c("csc",[o.clone()]),y(2)]);break;case"asin":s=!0,n=new c("sqrt",[new f("-","subtract",[y(1),new f("^","pow",[o.clone(),y(2)])])]);break;case"acos":s=!0,u=!0,n=new c("sqrt",[new f("-","subtract",[y(1),new f("^","pow",[o.clone(),y(2)])])]);break;case"atan":s=!0,n=new f("+","add",[new f("^","pow",[o.clone(),y(2)]),y(1)]);break;case"asec":s=!0,n=new f("*","multiply",[new c("abs",[o.clone()]),new c("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),y(2)]),y(1)])])]);break;case"acsc":s=!0,u=!0,n=new f("*","multiply",[new c("abs",[o.clone()]),new c("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),y(2)]),y(1)])])]);break;case"acot":s=!0,u=!0,n=new f("+","add",[new f("^","pow",[o.clone(),y(2)]),y(1)]);break;case"sinh":n=new c("cosh",[o.clone()]);break;case"cosh":n=new c("sinh",[o.clone()]);break;case"tanh":n=new f("^","pow",[new c("sech",[o.clone()]),y(2)]);break;case"sech":u=!0,n=new f("*","multiply",[e,new c("tanh",[o.clone()])]);break;case"csch":u=!0,n=new f("*","multiply",[e,new c("coth",[o.clone()])]);break;case"coth":u=!0,n=new f("^","pow",[new c("csch",[o.clone()]),y(2)]);break;case"asinh":s=!0,n=new c("sqrt",[new f("+","add",[new f("^","pow",[o.clone(),y(2)]),y(1)])]);break;case"acosh":s=!0,n=new c("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),y(2)]),y(1)])]);break;case"atanh":s=!0,n=new f("-","subtract",[y(1),new f("^","pow",[o.clone(),y(2)])]);break;case"asech":s=!0,u=!0,n=new f("*","multiply",[o.clone(),new c("sqrt",[new f("-","subtract",[y(1),new f("^","pow",[o.clone(),y(2)])])])]);break;case"acsch":s=!0,u=!0,n=new f("*","multiply",[new c("abs",[o.clone()]),new c("sqrt",[new f("+","add",[new f("^","pow",[o.clone(),y(2)]),y(1)])])]);break;case"acoth":s=!0,u=!0,n=new f("-","subtract",[y(1),new f("^","pow",[o.clone(),y(2)])]);break;case"abs":n=new f("/","divide",[new c(new p("abs"),[o.clone()]),o.clone()]);break;case"gamma":default:throw new Error('Function "'+e.name+'" is not supported by derivative, or a wrong number of arguments is passed')}s?(i="/",a="divide"):(i="*",a="multiply");var l=v(o,t);return u&&(l=new f("-","unaryMinus",[l])),new f(i,a,[l,n])},"OperatorNode, Object":function(e,t){if(void 0!==t[e])return y(0);if("+"===e.op)return new f(e.op,e.fn,e.args.map((function(e){return v(e,t)})));if("-"===e.op){if(e.isUnary())return new f(e.op,e.fn,[v(e.args[0],t)]);if(e.isBinary())return new f(e.op,e.fn,[v(e.args[0],t),v(e.args[1],t)])}if("*"===e.op){var r=e.args.filter((function(e){return void 0!==t[e]}));if(r.length>0){var n=e.args.filter((function(e){return void 0===t[e]})),i=1===n.length?n[0]:new f("*","multiply",n),s=r.concat(v(i,t));return new f("*","multiply",s)}return new f("+","add",e.args.map((function(r){return new f("*","multiply",e.args.map((function(e){return e===r?v(e,t):e.clone()})))})))}if("/"===e.op&&e.isBinary()){var u=e.args[0],l=e.args[1];return void 0!==t[l]?new f("/","divide",[v(u,t),l]):void 0!==t[u]?new f("*","multiply",[new f("-","unaryMinus",[u]),new f("/","divide",[v(l,t),new f("^","pow",[l.clone(),y(2)])])]):new f("/","divide",[new f("-","subtract",[new f("*","multiply",[v(u,t),l.clone()]),new f("*","multiply",[u.clone(),v(l,t)])]),new f("^","pow",[l.clone(),y(2)])])}if("^"===e.op&&e.isBinary()){var p=e.args[0],m=e.args[1];if(void 0!==t[p])return z(p)&&(o(p.value)||a(p.value,1))?y(0):new f("*","multiply",[e,new f("*","multiply",[new c("log",[p.clone()]),v(m.clone(),t)])]);if(void 0!==t[m]){if(z(m)){if(o(m.value))return y(0);if(a(m.value,1))return v(p,t)}var h=new f("^","pow",[p.clone(),new f("-","subtract",[m,y(1)])]);return new f("*","multiply",[m.clone(),new f("*","multiply",[v(p,t),h])])}return new f("*","multiply",[new f("^","pow",[p.clone(),m.clone()]),new f("+","add",[new f("*","multiply",[v(p,t),new f("/","divide",[m.clone(),p.clone()])]),new f("*","multiply",[v(m,t),new c("log",[p.clone()])])])])}throw new Error('Operator "'+e.op+'" is not supported by derivative, or a wrong number of arguments is passed')}});function y(e,t){return new u(s(e,t||r.number))}return m})),Hc=Qe("rationalize",["config","typed","equal","isZero","add","subtract","multiply","divide","pow","parse","simplifyCore","simplify","?bignumber","?fraction","mathWithTransform","matrix","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","SymbolNode","ParenthesisNode"],(function(e){var t=e.config,r=e.typed,n=(e.equal,e.isZero,e.add,e.subtract,e.multiply,e.divide,e.pow,e.parse),i=e.simplifyCore,a=e.simplify,o=e.fraction,s=e.bignumber,u=e.mathWithTransform,c=e.matrix,f=e.AccessorNode,l=e.ArrayNode,p=e.ConstantNode,m=e.FunctionNode,h=e.IndexNode,d=e.ObjectNode,v=e.OperatorNode,y=e.SymbolNode,g=(e.ParenthesisNode,jc({typed:r,config:t,mathWithTransform:u,matrix:c,fraction:o,bignumber:s,AccessorNode:f,ArrayNode:l,ConstantNode:p,FunctionNode:m,IndexNode:h,ObjectNode:d,OperatorNode:v,SymbolNode:y}));return r("rationalize",{string:function(e){return this(n(e),{},!1)},"string, boolean":function(e,t){return this(n(e),{},t)},"string, Object":function(e,t){return this(n(e),t,!1)},"string, Object, boolean":function(e,t,r){return this(n(e),t,r)},Node:function(e){return this(e,{},!1)},"Node, boolean":function(e,t){return this(e,{},t)},"Node, Object":function(e,t){return this(e,t,!1)},"Node, Object, boolean":function(e,t,r){var n=function(){var e=[i,{l:"n+n",r:"2*n"},{l:"n+-n",r:"0"},g,{l:"n*(n1^-1)",r:"n/n1"},{l:"n*n1^-n2",r:"n/n1^n2"},{l:"n1^-1",r:"1/n1"},{l:"n*(n1/n2)",r:"(n*n1)/n2"},{l:"1*n",r:"n"}],t=[{l:"(-n1)/(-n2)",r:"n1/n2"},{l:"(-n1)*(-n2)",r:"n1*n2"},{l:"n1--n2",r:"n1+n2"},{l:"n1-n2",r:"n1+(-n2)"},{l:"(n1+n2)*n3",r:"(n1*n3 + n2*n3)"},{l:"n1*(n2+n3)",r:"(n1*n2+n1*n3)"},{l:"c1*n + c2*n",r:"(c1+c2)*n"},{l:"c1*n + n",r:"(c1+1)*n"},{l:"c1*n - c2*n",r:"(c1-c2)*n"},{l:"c1*n - n",r:"(c1-1)*n"},{l:"v/c",r:"(1/c)*v"},{l:"v/-c",r:"-(1/c)*v"},{l:"-v*-c",r:"c*v"},{l:"-v*c",r:"-c*v"},{l:"v*-c",r:"-c*v"},{l:"v*c",r:"c*v"},{l:"-(-n1*n2)",r:"(n1*n2)"},{l:"-(n1*n2)",r:"(-n1*n2)"},{l:"-(-n1+n2)",r:"(n1-n2)"},{l:"-(n1+n2)",r:"(-n1-n2)"},{l:"(n1^n2)^n3",r:"(n1^(n2*n3))"},{l:"-(-n1/n2)",r:"(n1/n2)"},{l:"-(n1/n2)",r:"(-n1/n2)"}],r=[{l:"(n1/(n2/n3))",r:"((n1*n3)/n2)"},{l:"(n1/n2/n3)",r:"(n1/(n2*n3))"}],n={};return n.firstRules=e.concat(t,r),n.distrDivRules=[{l:"(n1/n2 + n3/n4)",r:"((n1*n4 + n3*n2)/(n2*n4))"},{l:"(n1/n2 + n3)",r:"((n1 + n3*n2)/n2)"},{l:"(n1 + n2/n3)",r:"((n1*n3 + n2)/n3)"}],n.sucDivRules=r,n.firstRulesAgain=e.concat(t),n.finalRules=[i,{l:"n*-n",r:"-n^2"},{l:"n*n",r:"n^2"},g,{l:"n*-n^n1",r:"-n^(n1+1)"},{l:"n*n^n1",r:"n^(n1+1)"},{l:"n^n1*-n^n2",r:"-n^(n1+n2)"},{l:"n^n1*n^n2",r:"n^(n1+n2)"},{l:"n^n1*-n",r:"-n^(n1+1)"},{l:"n^n1*n",r:"n^(n1+1)"},{l:"n^n1/-n",r:"-n^(n1-1)"},{l:"n^n1/n",r:"n^(n1-1)"},{l:"n/-n^n1",r:"-n^(1-n1)"},{l:"n/n^n1",r:"n^(1-n1)"},{l:"n^n1/-n^n2",r:"n^(n1-n2)"},{l:"n^n1/n^n2",r:"n^(n1-n2)"},{l:"n1+(-n2*n3)",r:"n1-n2*n3"},{l:"v*(-c)",r:"-c*v"},{l:"n1+-n2",r:"n1-n2"},{l:"v*c",r:"c*v"},{l:"(n1^n2)^n3",r:"(n1^(n2*n3))"}],n}(),o=function(e,t,r,n){var i=[],o=a(e,n,t,{exactFractions:!1}),s="+-*"+((r=!!r)?"/":"");!function e(t){var r=t.type;if("FunctionNode"===r)throw new Error("There is an unsolved function call");if("OperatorNode"===r)if("^"===t.op){if("ConstantNode"!==t.args[1].type||!Z(parseFloat(t.args[1].value)))throw new Error("There is a non-integer exponent");e(t.args[0])}else{if(-1===s.indexOf(t.op))throw new Error("Operator "+t.op+" invalid in polynomial expression");for(var n=0;n<t.args.length;n++)e(t.args[n])}else if("SymbolNode"===r){var a=t.name;-1===i.indexOf(a)&&i.push(a)}else if("ParenthesisNode"===r)e(t.content);else if("ConstantNode"!==r)throw new Error("type "+r+" is not allowed in polynomial expression")}(o);var u={};return u.expression=o,u.variables=i,u}(e,t,!0,n.firstRules),s=o.variables.length,u={exactFractions:!1},c={exactFractions:!0};if(e=o.expression,s>=1){var f,l;e=function e(t,r,n){var i=t.type,a=arguments.length>1;if("OperatorNode"===i&&t.isBinary()){var o,s=!1;if("^"===t.op&&("ParenthesisNode"!==t.args[0].type&&"OperatorNode"!==t.args[0].type||"ConstantNode"!==t.args[1].type||(o=parseFloat(t.args[1].value),s=o>=2&&Z(o))),s){if(o>2){var u=t.args[0],c=new v("^","pow",[t.args[0].cloneDeep(),new p(o-1)]);t=new v("*","multiply",[u,c])}else t=new v("*","multiply",[t.args[0],t.args[0].cloneDeep()]);a&&("content"===n?r.content=t:r.args[n]=t)}}if("ParenthesisNode"===i)e(t.content,t,"content");else if("ConstantNode"!==i&&"SymbolNode"!==i)for(var f=0;f<t.args.length;f++)e(t.args[f],t,f);if(!a)return t}(e);var m,h=!0,d=!1;for(e=a(e,n.firstRules,{},u);l=h?n.distrDivRules:n.sucDivRules,h=!h,(m=(e=a(e,l,{},c)).toString())!==f;)d=!0,f=m;d&&(e=a(e,n.firstRulesAgain,{},u)),e=a(e,n.finalRules,{},u)}var y=[],b={};return"OperatorNode"===e.type&&e.isBinary()&&"/"===e.op?(1===s&&(e.args[0]=x(e.args[0],y),e.args[1]=x(e.args[1])),r&&(b.numerator=e.args[0],b.denominator=e.args[1])):(1===s&&(e=x(e,y)),r&&(b.numerator=e,b.denominator=null)),r?(b.coefficients=y,b.variables=o.variables,b.expression=e,b):e}});function x(e,t){void 0===t&&(t=[]),t[0]=0;var r={cte:1,oper:"+",fire:""},n=0,i="";!function e(r,a,o){var s=r.type;if("FunctionNode"===s)throw new Error("There is an unsolved function call");if("OperatorNode"===s){if(-1==="+-*^".indexOf(r.op))throw new Error("Operator "+r.op+" invalid");if(null!==a){if(("unaryMinus"===r.fn||"pow"===r.fn)&&"add"!==a.fn&&"subtract"!==a.fn&&"multiply"!==a.fn)throw new Error("Invalid "+r.op+" placing");if(("subtract"===r.fn||"add"===r.fn||"multiply"===r.fn)&&"add"!==a.fn&&"subtract"!==a.fn)throw new Error("Invalid "+r.op+" placing");if(("subtract"===r.fn||"add"===r.fn||"unaryMinus"===r.fn)&&0!==o.noFil)throw new Error("Invalid "+r.op+" placing")}"^"!==r.op&&"*"!==r.op||(o.fire=r.op);for(var u=0;u<r.args.length;u++)"unaryMinus"===r.fn&&(o.oper="-"),"+"!==r.op&&"subtract"!==r.fn||(o.fire="",o.cte=1,o.oper=0===u?"+":r.op),o.noFil=u,e(r.args[u],r,o)}else if("SymbolNode"===s){if(r.name!==i&&""!==i)throw new Error("There is more than one variable");if(i=r.name,null===a)return void(t[1]=1);if("^"===a.op&&0!==o.noFil)throw new Error("In power the variable should be the first parameter");if("*"===a.op&&1!==o.noFil)throw new Error("In multiply the variable should be the second parameter");""!==o.fire&&"*"!==o.fire||(n<1&&(t[1]=0),t[1]+=o.cte*("+"===o.oper?1:-1),n=Math.max(1,n))}else{if("ConstantNode"!==s)throw new Error("Type "+s+" is not allowed");var c=parseFloat(r.value);if(null===a)return void(t[0]=c);if("^"===a.op){if(1!==o.noFil)throw new Error("Constant cannot be powered");if(!Z(c)||c<=0)throw new Error("Non-integer exponent is not allowed");for(var f=n+1;f<c;f++)t[f]=0;return c>n&&(t[c]=0),t[c]+=o.cte*("+"===o.oper?1:-1),void(n=Math.max(c,n))}o.cte=c,""===o.fire&&(t[0]+=o.cte*("+"===o.oper?1:-1))}}(e,null,r);for(var a,o=!0,s=n=t.length-1;s>=0;s--)if(0!==t[s]){var u=new p(o?t[s]:Math.abs(t[s])),c=t[s]<0?"-":"+";if(s>0){var f=new y(i);if(s>1){var l=new p(s);f=new v("^","pow",[f,l])}u=-1===t[s]&&o?new v("-","unaryMinus",[f]):1===Math.abs(t[s])?f:new v("*","multiply",[u,f])}a=o?u:"+"===c?new v("+","add",[a,u]):new v("-","subtract",[a,u]),o=!1}return o?new p(0):a}})),Gc=Qe("reviver",["classes"],(function(e){var t=e.classes;return function(e,r){var n=t[r&&r.mathjs];return n&&"function"==typeof n.fromJSON?n.fromJSON(r):r}})),Vc=Qe("replacer",[],(function(){return function(e,t){return"number"!=typeof t||isFinite(t)&&!isNaN(t)?t:{mathjs:"number",value:String(t)}}})),Zc=Math.PI,Wc=2*Math.PI,Yc=Math.E,Jc=Qe("true",[],(function(){return!0})),Xc=Qe("false",[],(function(){return!1})),Qc=Qe("null",[],(function(){return null})),Kc=vf("Infinity",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r(1/0):1/0})),ef=vf("NaN",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r(NaN):NaN})),tf=vf("pi",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?go(r):Zc})),rf=vf("tau",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?xo(r):Wc})),nf=vf("e",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?vo(r):Yc})),af=vf("phi",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?yo(r):1.618033988749895})),of=vf("LN2",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r(2).ln():Math.LN2})),sf=vf("LN10",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r(10).ln():Math.LN10})),uf=vf("LOG2E",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r(1).div(new r(2).ln()):Math.LOG2E})),cf=vf("LOG10E",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r(1).div(new r(10).ln()):Math.LOG10E})),ff=vf("SQRT1_2",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r("0.5").sqrt():Math.SQRT1_2})),lf=vf("SQRT2",["config","?BigNumber"],(function(e){var t=e.config,r=e.BigNumber;return"BigNumber"===t.number?new r(2).sqrt():Math.SQRT2})),pf=vf("i",["Complex"],(function(e){return e.Complex.I})),mf=Qe("PI",["pi"],(function(e){return e.pi})),hf=Qe("E",["e"],(function(e){return e.e})),df=Qe("version",[],(function(){return"10.4.3"}));function vf(e,t,r){return Qe(e,t,r,{recreateOnConfigChange:!0})}var yf=ml("speedOfLight","299792458","m s^-1"),gf=ml("gravitationConstant","6.67430e-11","m^3 kg^-1 s^-2"),xf=ml("planckConstant","6.62607015e-34","J s"),bf=ml("reducedPlanckConstant","1.0545718176461565e-34","J s"),wf=ml("magneticConstant","1.25663706212e-6","N A^-2"),Nf=ml("electricConstant","8.8541878128e-12","F m^-1"),Mf=ml("vacuumImpedance","376.730313667","ohm"),Ef=ml("coulomb","8.987551792261171e9","N m^2 C^-2"),Sf=ml("elementaryCharge","1.602176634e-19","C"),Af=ml("bohrMagneton","9.2740100783e-24","J T^-1"),Of=ml("conductanceQuantum","7.748091729863649e-5","S"),Cf=ml("inverseConductanceQuantum","12906.403729652257","ohm"),_f=ml("magneticFluxQuantum","2.0678338484619295e-15","Wb"),Tf=ml("nuclearMagneton","5.0507837461e-27","J T^-1"),If=ml("klitzing","25812.807459304513","ohm"),kf=ml("bohrRadius","5.29177210903e-11","m"),zf=ml("classicalElectronRadius","2.8179403262e-15","m"),qf=ml("electronMass","9.1093837015e-31","kg"),Rf=ml("fermiCoupling","1.1663787e-5","GeV^-2"),Bf=hl("fineStructure",.0072973525693),Df=ml("hartreeEnergy","4.3597447222071e-18","J"),jf=ml("protonMass","1.67262192369e-27","kg"),Pf=ml("deuteronMass","3.3435830926e-27","kg"),Ff=ml("neutronMass","1.6749271613e-27","kg"),Uf=ml("quantumOfCirculation","3.6369475516e-4","m^2 s^-1"),Lf=ml("rydberg","10973731.568160","m^-1"),$f=ml("thomsonCrossSection","6.6524587321e-29","m^2"),Hf=hl("weakMixingAngle",.2229),Gf=hl("efimovFactor",22.7),Vf=ml("atomicMass","1.66053906660e-27","kg"),Zf=ml("avogadro","6.02214076e23","mol^-1"),Wf=ml("boltzmann","1.380649e-23","J K^-1"),Yf=ml("faraday","96485.33212331001","C mol^-1"),Jf=ml("firstRadiation","3.7417718521927573e-16","W m^2"),Xf=ml("loschmidt","2.686780111798444e25","m^-3"),Qf=ml("gasConstant","8.31446261815324","J K^-1 mol^-1"),Kf=ml("molarPlanckConstant","3.990312712893431e-10","J s mol^-1"),el=ml("molarVolume","0.022413969545014137","m^3 mol^-1"),tl=hl("sackurTetrode",-1.16487052358),rl=ml("secondRadiation","0.014387768775039337","m K"),nl=ml("stefanBoltzmann","5.67037441918443e-8","W m^-2 K^-4"),il=ml("wienDisplacement","2.897771955e-3","m K"),al=ml("molarMass","0.99999999965e-3","kg mol^-1"),ol=ml("molarMassC12","11.9999999958e-3","kg mol^-1"),sl=ml("gravity","9.80665","m s^-2"),ul=ml("planckLength","1.616255e-35","m"),cl=ml("planckMass","2.176435e-8","kg"),fl=ml("planckTime","5.391245e-44","s"),ll=ml("planckCharge","1.87554603778e-18","C"),pl=ml("planckTemperature","1.416785e+32","K");function ml(e,t,r){return Qe(e,["config","Unit","BigNumber"],(function(e){var n=e.config,i=e.Unit,a=e.BigNumber,o=new i("BigNumber"===n.number?new a(t):parseFloat(t),r);return o.fixPrefix=!0,o}))}function hl(e,t){return Qe(e,["config","BigNumber"],(function(e){var r=e.config,n=e.BigNumber;return"BigNumber"===r.number?new n(t):t}))}var dl=Qe("apply",["typed","isInteger"],(function(e){var t=e.typed,r=e.isInteger,n=Jr({typed:t,isInteger:r});return t("apply",{"...any":function(e){var t=e[1];o(t)?e[1]=t-1:s(t)&&(e[1]=t.minus(1));try{return n.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),vl=Qe("column",["typed","Index","matrix","range"],(function(e){var t=e.typed,r=e.Index,n=e.matrix,i=e.range,a=yi({typed:t,Index:r,matrix:n,range:i});return t("column",{"...any":function(e){var t=e.length-1,r=e[t];o(r)&&(e[t]=r-1);try{return a.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0});function yl(e,t,r){var n=e.filter((function(e){return L(e)&&!(e.name in t)&&!r.has(e.name)}))[0];if(!n)throw new Error('No undefined variable found in inline expression "'+e+'"');var i=n.name,a=ou(r),o=e.compile();return function(e){return a.set(i,e),o.evaluate(a)}}var gl=Qe("filter",["typed"],(function(e){var t=e.typed;function r(e,t,r){var i,a;return e[0]&&(i=e[0].compile().evaluate(r)),e[1]&&(a=L(e[1])||q(e[1])?e[1].compile().evaluate(r):yl(e[1],t,r)),n(i,a)}r.rawArgs=!0;var n=t("filter",{"Array, function":xl,"Matrix, function":function(e,t){return e.create(xl(e.toArray(),t))},"Array, RegExp":je,"Matrix, RegExp":function(e,t){return e.create(je(e.toArray(),t))}});return r}),{isTransformFunction:!0});function xl(e,t){var r=Mi(t);return De(e,(function(e,n,i){return 1===r?t(e):2===r?t(e,[n+1]):t(e,[n+1],i)}))}var bl=Qe("forEach",["typed"],(function(e){var t=e.typed;function r(e,t,r){var i,a;return e[0]&&(i=e[0].compile().evaluate(r)),e[1]&&(a=L(e[1])||q(e[1])?e[1].compile().evaluate(r):yl(e[1],t,r)),n(i,a)}r.rawArgs=!0;var n=t("forEach",{"Array | Matrix, function":function(e,t){var r=Mi(t);!function n(i,a){Array.isArray(i)?Be(i,(function(e,t){n(e,a.concat(t+1))})):1===r?t(i):2===r?t(i,a):t(i,a,e)}(e.valueOf(),[])}});return r}),{isTransformFunction:!0}),wl=Qe("index",["Index"],(function(e){var t=e.Index;return function(){for(var e=[],r=0,n=arguments.length;r<n;r++){var i=arguments[r];if(y(i))i.start--,i.end-=i.step>0?0:2;else if(i&&!0===i.isSet)i=i.map((function(e){return e-1}));else if(p(i)||m(i))i=i.map((function(e){return e-1}));else if(o(i))i--;else if(s(i))i=i.toNumber()-1;else if("string"!=typeof i)throw new TypeError("Dimension must be an Array, Matrix, number, string, or Range");e[r]=i}var a=new t;return t.apply(a,e),a}}),{isTransformFunction:!0}),Nl=Qe("map",["typed"],(function(e){var t=e.typed;function r(e,t,r){var i,a;return e[0]&&(i=e[0].compile().evaluate(r)),e[1]&&(a=L(e[1])||q(e[1])?e[1].compile().evaluate(r):yl(e[1],t,r)),n(i,a)}r.rawArgs=!0;var n=t("map",{"Array, function":function(e,t){return Ml(e,t,e)},"Matrix, function":function(e,t){return e.create(Ml(e.valueOf(),t,e))}});return r}),{isTransformFunction:!0});function Ml(e,t,r){var n=Mi(t);return function e(i,a){return Array.isArray(i)?Re(i,(function(t,r){return e(t,a.concat(r+1))})):1===n?t(i):2===n?t(i,a):t(i,a,r)}(e,[])}function El(e){if(2===e.length&&h(e[0])){var t=(e=e.slice())[1];o(t)?e[1]=t-1:s(t)&&(e[1]=t.minus(1))}return e}var Sl=Qe("max",["typed","config","numeric","larger"],(function(e){var t=e.typed,r=e.config,n=e.numeric,i=e.larger,a=so({typed:t,config:r,numeric:n,larger:i});return t("max",{"...any":function(e){e=El(e);try{return a.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Al=Qe("mean",["typed","add","divide"],(function(e){var t=e.typed,r=e.add,n=e.divide,i=Ku({typed:t,add:r,divide:n});return t("mean",{"...any":function(e){e=El(e);try{return i.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Ol=Qe("min",["typed","config","numeric","smaller"],(function(e){var t=e.typed,r=e.config,n=e.numeric,i=e.smaller,a=uo({typed:t,config:r,numeric:n,smaller:i});return t("min",{"...any":function(e){e=El(e);try{return a.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Cl=Qe("range",["typed","config","?matrix","?bignumber","smaller","smallerEq","larger","largerEq"],(function(e){var t=e.typed,r=e.config,n=e.matrix,i=e.bignumber,a=e.smaller,o=e.smallerEq,s=e.larger,u=e.largerEq,c=Pi({typed:t,config:r,matrix:n,bignumber:i,smaller:a,smallerEq:o,larger:s,largerEq:u});return t("range",{"...any":function(e){return"boolean"!=typeof e[e.length-1]&&e.push(!0),c.apply(null,e)}})}),{isTransformFunction:!0}),_l=Qe("row",["typed","Index","matrix","range"],(function(e){var t=e.typed,r=e.Index,n=e.matrix,i=e.range,a=Gi({typed:t,Index:r,matrix:n,range:i});return t("row",{"...any":function(e){var t=e.length-1,r=e[t];o(r)&&(e[t]=r-1);try{return a.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Tl=Qe("subset",["typed","matrix"],(function(e){var t=e.typed,r=e.matrix,n=Wi({typed:t,matrix:r});return t("subset",{"...any":function(e){try{return n.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Il=Qe("concat",["typed","matrix","isInteger"],(function(e){var t=e.typed,r=e.matrix,n=e.isInteger,i=di({typed:t,matrix:r,isInteger:n});return t("concat",{"...any":function(e){var t=e.length-1,r=e[t];o(r)?e[t]=r-1:s(r)&&(e[t]=r.minus(1));try{return i.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),kl=Qe("diff",["typed","matrix","subtract","number","bignumber"],(function(e){var t=e.typed,r=e.matrix,n=e.subtract,i=e.number,a=e.bignumber,o=qi({typed:t,matrix:r,subtract:n,number:i,bignumber:a});return t("diff",{"...any":function(e){e=El(e);try{return o.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),zl=Qe("std",["typed","sqrt","variance"],(function(e){var t=e.typed,r=e.sqrt,n=e.variance,i=ic({typed:t,sqrt:r,variance:n});return t("std",{"...any":function(e){e=El(e);try{return i.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),ql=Qe("sum",["typed","config","add","numeric"],(function(e){var t=e.typed,r=e.config,n=e.add,i=e.numeric,a=Xu({typed:t,config:r,add:n,numeric:i});return t("sum",{"...any":function(e){e=El(e);try{return a.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Rl=Qe("cumsum",["typed","add","unaryPlus"],(function(e){var t=e.typed,r=e.add,n=e.unaryPlus,i=Qu({typed:t,add:r,unaryPlus:n});return t("cumsum",{"...any":function(e){if(2===e.length&&h(e[0])){var t=e[1];o(t)?e[1]=t-1:s(t)&&(e[1]=t.minus(1))}try{return i.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Bl=Qe("variance",["typed","add","subtract","multiply","divide","apply","isNaN"],(function(e){var t=e.typed,r=e.add,n=e.subtract,i=e.multiply,a=e.divide,o=e.apply,s=e.isNaN,u=rc({typed:t,add:r,subtract:n,multiply:i,divide:a,apply:o,isNaN:s});return t("variance",{"...any":function(e){e=El(e);try{return u.apply(null,e)}catch(e){throw ks(e)}}})}),{isTransformFunction:!0}),Dl=r(184),jl=r.n(Dl);function Pl(e,t,r,n){function i(t,i,a){var s;if(a.wrap&&"function"==typeof i&&(i=function(e){var t=function(){for(var t=[],n=0,i=arguments.length;n<i;n++){var a=arguments[n];t[n]=a&&a.valueOf()}return e.apply(r,t)};e.transform&&(t.transform=e.transform);return t}(i)),"function"==typeof(s=i)&&"string"==typeof s.signature&&(i=e(t,Ma()({},i.signature,i))),d(r[t])&&d(i))return i=a.override?e(t,i.signatures):e(r[t],i),r[t]=i,delete n[t],o(t,i),void r.emit("import",t,(function(){return i}));if(void 0===r[t]||a.override)return r[t]=i,delete n[t],o(t,i),void r.emit("import",t,(function(){return i}));if(!a.silent)throw new Error('Cannot import "'+t+'": already exists')}function o(e,t){t&&"function"==typeof t.transform?(r.expression.transform[e]=t.transform,v(e)&&(r.expression.mathWithTransform[e]=t.transform)):(delete r.expression.transform[e],v(e)&&(r.expression.mathWithTransform[e]=t))}function l(e){delete r.expression.transform[e],v(e)?r.expression.mathWithTransform[e]=r[e]:delete r.expression.mathWithTransform[e]}function p(t,i){var a=arguments.length>2&&void 0!==arguments[2]?arguments[2]:t.fn;if($e(a,"."))throw new Error("Factory name should not contain a nested path. Name: "+JSON.stringify(a));var o=g(t)?r.expression.transform:r,s=a in r.expression.transform,u=Je(o,a)?o[a]:void 0,c=function(){var n={};t.dependencies.map(et).forEach((function(e){if($e(e,"."))throw new Error("Factory dependency should not contain a nested path. Name: "+JSON.stringify(e));"math"===e?n.math=r:"mathWithTransform"===e?n.mathWithTransform=r.expression.mathWithTransform:"classes"===e?n.classes=r:n[e]=r[e]}));var o=t(n);if(o&&"function"==typeof o.transform)throw new Error('Transforms cannot be attached to factory functions. Please create a separate function for it with exports.path="expression.transform"');if(void 0===u||i.override)return o;if(d(u)&&d(o))return e(u,o);if(i.silent)return u;throw new Error('Cannot import "'+a+'": already exists')};t.meta&&!1===t.meta.lazy?(o[a]=c(),u&&s?l(a):(g(t)||y(t))&&Ye(r.expression.mathWithTransform,a,(function(){return o[a]}))):(Ye(o,a,c),u&&s?l(a):(g(t)||y(t))&&Ye(r.expression.mathWithTransform,a,(function(){return o[a]}))),n[a]=t,r.emit("import",a,c)}function h(e){return"function"==typeof e||"number"==typeof e||"string"==typeof e||"boolean"==typeof e||null===e||f(e)||u(e)||s(e)||c(e)||m(e)||Array.isArray(e)}function d(e){return"function"==typeof e&&"object"===a()(e.signatures)}function v(e){return!Je(x,e)}function y(e){return!(-1!==e.fn.indexOf(".")||Je(x,e.fn)||e.meta&&e.meta.isClass)}function g(e){return void 0!==e&&void 0!==e.meta&&!0===e.meta.isTransformFunction||!1}var x={expression:!0,type:!0,docs:!0,error:!0,json:!0,chain:!0};return function(e,t){var r=arguments.length;if(1!==r&&2!==r)throw new Ui("import",r,1,2);function n(e,r,i){if(Array.isArray(r))r.forEach((function(t){return n(e,t)}));else if("object"===a()(r))for(var o in r)Je(r,o)&&n(e,r[o],o);else if(Ke(r)||void 0!==i){var s=Ke(r)?g(r)?r.fn+".transform":r.fn:i;if(Je(e,s)&&e[s]!==r&&!t.silent)throw new Error('Cannot import "'+s+'" twice');e[s]=r}else if(!t.silent)throw new TypeError("Factory, Object, or Array expected")}t||(t={});var o={};for(var s in n(o,e),o)if(Je(o,s)){var u=o[s];if(Ke(u))p(u,t);else if(h(u))i(s,u,t);else if(!t.silent)throw new TypeError("Factory, Object, or Array expected")}}}var Fl={epsilon:1e-12,matrix:"Matrix",number:"number",precision:64,predictable:!1,randomSeed:null},Ul=["Matrix","Array"],Ll=["number","BigNumber","Fraction"];function $l(e,t){function r(r){if(r){var n=Ge(e,He);Hl(r,"matrix",Ul),Hl(r,"number",Ll),function e(t,r){if(Array.isArray(r))throw new TypeError("Arrays are not supported by deepExtend");for(var n in r)if(Je(r,n)&&!(n in Object.prototype)&&!(n in Function.prototype))if(r[n]&&r[n].constructor===Object)void 0===t[n]&&(t[n]={}),t[n]&&t[n].constructor===Object?e(t[n],r[n]):t[n]=r[n];else{if(Array.isArray(r[n]))throw new TypeError("Arrays are not supported by deepExtend");t[n]=r[n]}return t}(e,r);var i=Ge(e,He),a=Ge(r,He);return t("config",i,n,a),i}return Ge(e,He)}return r.MATRIX_OPTIONS=Ul,r.NUMBER_OPTIONS=Ll,Object.keys(Fl).forEach((function(t){Object.defineProperty(r,t,{get:function(){return e[t]},enumerable:!0,configurable:!0})})),r}function Hl(e,t,r){var n,i;void 0!==e[t]&&(n=r,i=e[t],-1===n.indexOf(i))&&console.warn('Warning: Unknown value "'+e[t]+'" for configuration option "'+t+'". Available options: '+r.map((function(e){return JSON.stringify(e)})).join(", ")+".")}t.default=function e(t,r){var n=ho()({},Fl,r);if("function"!=typeof Object.create)throw new Error("ES5 not supported by this JavaScript engine. Please load the es5-shim and es5-sham library for compatibility.");var i,a,H=(i={isNumber:o,isComplex:u,isBigNumber:s,isFraction:c,isUnit:f,isString:l,isArray:p,isMatrix:m,isCollection:h,isDenseMatrix:d,isSparseMatrix:v,isRange:y,isIndex:g,isBoolean:x,isResultSet:b,isHelp:w,isFunction:N,isDate:M,isRegExp:E,isObject:S,isNull:A,isUndefined:O,isAccessorNode:C,isArrayNode:_,isAssignmentNode:T,isBlockNode:I,isConditionalNode:k,isConstantNode:z,isFunctionAssignmentNode:q,isFunctionNode:R,isIndexNode:B,isNode:D,isObjectNode:j,isOperatorNode:P,isParenthesisNode:F,isRangeNode:U,isSymbolNode:L,isChain:$},a=new jl.a,i.on=a.on.bind(a),i.off=a.off.bind(a),i.once=a.once.bind(a),i.emit=a.emit.bind(a),i);H.config=$l(n,H.emit),H.expression={transform:{},mathWithTransform:{config:H.config}};var G={},V=Pl((function(){for(var e=arguments.length,t=new Array(e),r=0;r<e;r++)t[r]=arguments[r];return H.typed.apply(H.typed,t)}),0,H,G);return H.import=V,H.on("config",(function(){Xe(G).forEach((function(e){e&&e.meta&&e.meta.recreateOnConfigChange&&V(e,{override:!0})}))})),H.create=e.bind(null,t),H.factory=Qe,H.import(Xe(We(t))),H.ArgumentsError=Ui,H.DimensionError=Me,H.IndexError=Ee,H}(n)}]).default}));
+//# sourceMappingURL=math.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/browser/math.js.map b/node_modules/mathjs/lib/browser/math.js.map
new file mode 100644
index 0000000..c0ec0c4
--- /dev/null
+++ b/node_modules/mathjs/lib/browser/math.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["webpack://math/webpack/universalModuleDefinition","webpack://math/webpack/bootstrap","webpack://math/./node_modules/core-js/modules/es.object.to-string.js","webpack://math/./node_modules/core-js/internals/global.js","webpack://math/./node_modules/@babel/runtime/helpers/typeof.js","webpack://math/./node_modules/core-js/modules/es.array.map.js","webpack://math/./node_modules/core-js/modules/web.dom-collections.for-each.js","webpack://math/./node_modules/core-js/internals/export.js","webpack://math/./node_modules/core-js/modules/es.regexp.to-string.js","webpack://math/./node_modules/core-js/internals/fails.js","webpack://math/./node_modules/core-js/internals/function-uncurry-this.js","webpack://math/./node_modules/core-js/modules/es.regexp.exec.js","webpack://math/./node_modules/core-js/modules/es.promise.js","webpack://math/./node_modules/core-js/modules/es.function.name.js","webpack://math/./node_modules/core-js/modules/web.url.to-json.js","webpack://math/./node_modules/core-js/modules/es.array.join.js","webpack://math/./node_modules/core-js/internals/is-callable.js","webpack://math/./node_modules/core-js/internals/well-known-symbol.js","webpack://math/./node_modules/core-js/modules/es.array.slice.js","webpack://math/./node_modules/core-js/internals/descriptors.js","webpack://math/./node_modules/core-js/modules/es.array.concat.js","webpack://math/./node_modules/core-js/internals/object-define-property.js","webpack://math/./node_modules/core-js/internals/an-object.js","webpack://math/./node_modules/core-js/internals/function-call.js","webpack://math/./node_modules/core-js/internals/is-object.js","webpack://math/./node_modules/core-js/modules/es.array.find.js","webpack://math/./node_modules/@babel/runtime/helpers/toConsumableArray.js","webpack://math/./node_modules/core-js/internals/has-own-property.js","webpack://math/./node_modules/core-js/modules/es.array.iterator.js","webpack://math/./node_modules/core-js/modules/es.object.keys.js","webpack://math/./node_modules/core-js/modules/es.array.splice.js","webpack://math/./node_modules/core-js/modules/es.number.constructor.js","webpack://math/./node_modules/core-js/modules/web.dom-collections.iterator.js","webpack://math/./node_modules/@babel/runtime/helpers/extends.js","webpack://math/./node_modules/complex.js/complex.js","webpack://math/./node_modules/core-js/internals/to-string.js","webpack://math/./node_modules/core-js/internals/to-object.js","webpack://math/./node_modules/core-js/internals/redefine.js","webpack://math/./node_modules/core-js/modules/es.array.filter.js","webpack://math/./node_modules/core-js/modules/es.symbol.js","webpack://math/(webpack)/buildin/amd-define.js","webpack://math/./node_modules/core-js/internals/to-indexed-object.js","webpack://math/./node_modules/core-js/modules/es.array.sort.js","webpack://math/./node_modules/core-js/modules/es.string.iterator.js","webpack://math/./node_modules/core-js/internals/classof-raw.js","webpack://math/./node_modules/core-js/internals/internal-state.js","webpack://math/./node_modules/core-js/internals/length-of-array-like.js","webpack://math/./node_modules/core-js/modules/es.json.stringify.js","webpack://math/./node_modules/core-js/modules/es.regexp.test.js","webpack://math/./node_modules/core-js/internals/require-object-coercible.js","webpack://math/./node_modules/core-js/internals/get-built-in.js","webpack://math/./node_modules/core-js/modules/es.string.split.js","webpack://math/./node_modules/core-js/modules/es.symbol.description.js","webpack://math/./node_modules/core-js/internals/object-is-prototype-of.js","webpack://math/./node_modules/core-js/internals/create-non-enumerable-property.js","webpack://math/./node_modules/core-js/modules/es.symbol.iterator.js","webpack://math/./node_modules/@babel/runtime/helpers/defineProperty.js","webpack://math/./node_modules/@babel/runtime/helpers/slicedToArray.js","webpack://math/./node_modules/@babel/runtime/regenerator/index.js","webpack://math/./node_modules/core-js/internals/object-get-own-property-descriptor.js","webpack://math/./node_modules/core-js/internals/engine-user-agent.js","webpack://math/./node_modules/core-js/internals/to-integer-or-infinity.js","webpack://math/./node_modules/core-js/modules/es.array.from.js","webpack://math/./node_modules/decimal.js/decimal.js","webpack://math/./node_modules/fraction.js/fraction.js","webpack://math/./node_modules/javascript-natural-sort/naturalSort.js","webpack://math/./node_modules/core-js/internals/get-method.js","webpack://math/./node_modules/core-js/internals/a-callable.js","webpack://math/./node_modules/core-js/internals/is-pure.js","webpack://math/./node_modules/core-js/internals/object-get-own-property-names.js","webpack://math/./node_modules/core-js/internals/function-bind-context.js","webpack://math/./node_modules/core-js/internals/object-create.js","webpack://math/./node_modules/core-js/internals/create-property.js","webpack://math/./node_modules/core-js/modules/es.string.replace.js","webpack://math/(webpack)/buildin/module.js","webpack://math/(webpack)/buildin/amd-options.js","webpack://math/./node_modules/core-js/internals/create-property-descriptor.js","webpack://math/./node_modules/core-js/internals/engine-v8-version.js","webpack://math/./node_modules/core-js/internals/hidden-keys.js","webpack://math/./node_modules/core-js/internals/function-name.js","webpack://math/./node_modules/core-js/internals/to-absolute-index.js","webpack://math/./node_modules/core-js/internals/is-forced.js","webpack://math/./node_modules/core-js/internals/array-iteration.js","webpack://math/./node_modules/core-js/internals/array-method-has-species-support.js","webpack://math/./node_modules/core-js/internals/function-apply.js","webpack://math/./node_modules/core-js/internals/iterators.js","webpack://math/./node_modules/core-js/internals/set-to-string-tag.js","webpack://math/./node_modules/core-js/internals/function-bind-native.js","webpack://math/./node_modules/core-js/internals/to-property-key.js","webpack://math/./node_modules/core-js/internals/is-symbol.js","webpack://math/./node_modules/core-js/internals/try-to-string.js","webpack://math/./node_modules/core-js/internals/shared.js","webpack://math/./node_modules/core-js/internals/uid.js","webpack://math/./node_modules/core-js/internals/document-create-element.js","webpack://math/./node_modules/core-js/internals/inspect-source.js","webpack://math/./node_modules/core-js/internals/shared-key.js","webpack://math/./node_modules/core-js/internals/to-length.js","webpack://math/./node_modules/core-js/internals/classof.js","webpack://math/./node_modules/core-js/internals/is-array.js","webpack://math/./node_modules/core-js/internals/is-constructor.js","webpack://math/./node_modules/core-js/internals/regexp-sticky-helpers.js","webpack://math/./node_modules/core-js/internals/regexp-exec.js","webpack://math/./node_modules/core-js/internals/math-expm1.js","webpack://math/./node_modules/core-js/modules/es.string.match.js","webpack://math/./node_modules/core-js/modules/es.string.sub.js","webpack://math/./node_modules/core-js/internals/indexed-object.js","webpack://math/./node_modules/core-js/internals/native-symbol.js","webpack://math/./node_modules/core-js/internals/shared-store.js","webpack://math/./node_modules/core-js/internals/set-global.js","webpack://math/./node_modules/core-js/internals/enum-bug-keys.js","webpack://math/./node_modules/core-js/internals/object-keys.js","webpack://math/./node_modules/core-js/internals/to-string-tag-support.js","webpack://math/./node_modules/core-js/internals/array-species-create.js","webpack://math/./node_modules/core-js/internals/array-method-is-strict.js","webpack://math/./node_modules/core-js/internals/object-get-prototype-of.js","webpack://math/./node_modules/core-js/internals/inherit-if-required.js","webpack://math/./node_modules/core-js/internals/object-set-prototype-of.js","webpack://math/./node_modules/core-js/internals/regexp-flags.js","webpack://math/./node_modules/core-js/internals/set-species.js","webpack://math/./node_modules/core-js/internals/regexp-unsupported-dot-all.js","webpack://math/./node_modules/core-js/internals/fix-regexp-well-known-symbol-logic.js","webpack://math/./node_modules/core-js/internals/advance-string-index.js","webpack://math/./node_modules/core-js/internals/array-slice-simple.js","webpack://math/./node_modules/core-js/internals/regexp-exec-abstract.js","webpack://math/./node_modules/core-js/internals/array-slice.js","webpack://math/./node_modules/core-js/internals/add-to-unscopables.js","webpack://math/./node_modules/core-js/internals/define-iterator.js","webpack://math/./node_modules/core-js/internals/iterate.js","webpack://math/./node_modules/core-js/internals/get-iterator-method.js","webpack://math/./node_modules/core-js/internals/an-instance.js","webpack://math/./node_modules/core-js/internals/check-correctness-of-iteration.js","webpack://math/./node_modules/core-js/internals/engine-is-node.js","webpack://math/./node_modules/core-js/modules/es.object.get-own-property-descriptor.js","webpack://math/./node_modules/core-js/modules/es.object.get-own-property-descriptors.js","webpack://math/./node_modules/typed-function/typed-function.js","webpack://math/./node_modules/seedrandom/index.js","webpack://math/./node_modules/core-js/internals/object-property-is-enumerable.js","webpack://math/./node_modules/core-js/internals/to-primitive.js","webpack://math/./node_modules/core-js/internals/use-symbol-as-uid.js","webpack://math/./node_modules/core-js/internals/ie8-dom-define.js","webpack://math/./node_modules/core-js/internals/v8-prototype-define-bug.js","webpack://math/./node_modules/core-js/internals/copy-constructor-properties.js","webpack://math/./node_modules/core-js/internals/own-keys.js","webpack://math/./node_modules/core-js/internals/object-keys-internal.js","webpack://math/./node_modules/core-js/internals/object-get-own-property-symbols.js","webpack://math/./node_modules/core-js/internals/dom-iterables.js","webpack://math/./node_modules/core-js/internals/dom-token-list-prototype.js","webpack://math/./node_modules/core-js/modules/es.object.get-prototype-of.js","webpack://math/./node_modules/core-js/internals/correct-prototype-getter.js","webpack://math/./node_modules/core-js/modules/es.regexp.constructor.js","webpack://math/./node_modules/core-js/internals/is-regexp.js","webpack://math/./node_modules/core-js/internals/regexp-unsupported-ncg.js","webpack://math/./node_modules/core-js/modules/es.regexp.dot-all.js","webpack://math/./node_modules/core-js/internals/object-define-properties.js","webpack://math/./node_modules/core-js/internals/html.js","webpack://math/./node_modules/core-js/modules/es.regexp.sticky.js","webpack://math/./node_modules/core-js/internals/species-constructor.js","webpack://math/./node_modules/core-js/internals/string-multibyte.js","webpack://math/./node_modules/core-js/internals/math-sign.js","webpack://math/./node_modules/core-js/modules/es.math.log2.js","webpack://math/./node_modules/core-js/internals/math-log1p.js","webpack://math/./node_modules/core-js/internals/this-number-value.js","webpack://math/./node_modules/core-js/internals/string-trim.js","webpack://math/./node_modules/core-js/internals/whitespaces.js","webpack://math/./node_modules/core-js/modules/es.number.to-fixed.js","webpack://math/./node_modules/core-js/internals/string-repeat.js","webpack://math/./node_modules/core-js/internals/iterators-core.js","webpack://math/./node_modules/core-js/modules/es.map.js","webpack://math/./node_modules/core-js/internals/collection.js","webpack://math/./node_modules/core-js/internals/internal-metadata.js","webpack://math/./node_modules/core-js/internals/object-get-own-property-names-external.js","webpack://math/./node_modules/core-js/internals/is-array-iterator-method.js","webpack://math/./node_modules/core-js/internals/get-iterator.js","webpack://math/./node_modules/core-js/internals/iterator-close.js","webpack://math/./node_modules/core-js/internals/collection-strong.js","webpack://math/./node_modules/core-js/internals/redefine-all.js","webpack://math/./node_modules/core-js/internals/well-known-symbol-wrapped.js","webpack://math/./node_modules/core-js/internals/define-well-known-symbol.js","webpack://math/./node_modules/core-js/internals/task.js","webpack://math/./node_modules/core-js/internals/engine-is-ios.js","webpack://math/./node_modules/core-js/internals/new-promise-capability.js","webpack://math/./node_modules/core-js/modules/es.number.is-nan.js","webpack://math/./node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js","webpack://math/./node_modules/@babel/runtime/helpers/arrayLikeToArray.js","webpack://math/./node_modules/core-js/modules/es.set.js","webpack://math/./node_modules/tiny-emitter/index.js","webpack://math/./node_modules/@babel/runtime/helpers/classCallCheck.js","webpack://math/./node_modules/@babel/runtime/helpers/createClass.js","webpack://math/./node_modules/escape-latex/dist/index.js","webpack://math/(webpack)/buildin/global.js","webpack://math/./node_modules/core-js/internals/ordinary-to-primitive.js","webpack://math/./node_modules/core-js/internals/native-weak-map.js","webpack://math/./node_modules/core-js/internals/array-includes.js","webpack://math/./node_modules/core-js/internals/object-to-string.js","webpack://math/./node_modules/core-js/internals/array-for-each.js","webpack://math/./node_modules/core-js/internals/array-species-constructor.js","webpack://math/./node_modules/core-js/internals/a-possible-prototype.js","webpack://math/./node_modules/core-js/internals/a-constructor.js","webpack://math/./node_modules/core-js/internals/array-sort.js","webpack://math/./node_modules/core-js/internals/engine-ff-version.js","webpack://math/./node_modules/core-js/internals/engine-is-ie-or-edge.js","webpack://math/./node_modules/core-js/internals/engine-webkit-version.js","webpack://math/./node_modules/core-js/modules/es.math.sign.js","webpack://math/./node_modules/core-js/modules/es.math.log10.js","webpack://math/./node_modules/core-js/internals/math-log10.js","webpack://math/./node_modules/core-js/modules/es.math.log1p.js","webpack://math/./node_modules/core-js/modules/es.math.cbrt.js","webpack://math/./node_modules/core-js/modules/es.math.expm1.js","webpack://math/./node_modules/core-js/internals/get-substitution.js","webpack://math/./node_modules/core-js/modules/es.number.epsilon.js","webpack://math/./node_modules/core-js/modules/es.math.acosh.js","webpack://math/./node_modules/core-js/modules/es.math.asinh.js","webpack://math/./node_modules/core-js/modules/es.math.atanh.js","webpack://math/./node_modules/core-js/modules/es.math.cosh.js","webpack://math/./node_modules/core-js/modules/es.math.sinh.js","webpack://math/./node_modules/core-js/modules/es.math.tanh.js","webpack://math/./node_modules/core-js/internals/create-html.js","webpack://math/./node_modules/core-js/internals/string-html-forced.js","webpack://math/./node_modules/core-js/internals/create-iterator-constructor.js","webpack://math/./node_modules/core-js/internals/object-is-extensible.js","webpack://math/./node_modules/core-js/internals/array-buffer-non-extensible.js","webpack://math/./node_modules/core-js/internals/freezing.js","webpack://math/./node_modules/core-js/internals/array-from.js","webpack://math/./node_modules/core-js/internals/call-with-safe-iteration-closing.js","webpack://math/./node_modules/core-js/internals/path.js","webpack://math/./node_modules/core-js/internals/native-promise-constructor.js","webpack://math/./node_modules/core-js/internals/validate-arguments-length.js","webpack://math/./node_modules/core-js/internals/microtask.js","webpack://math/./node_modules/core-js/internals/engine-is-ios-pebble.js","webpack://math/./node_modules/core-js/internals/engine-is-webos-webkit.js","webpack://math/./node_modules/core-js/internals/promise-resolve.js","webpack://math/./node_modules/core-js/internals/host-report-errors.js","webpack://math/./node_modules/core-js/internals/perform.js","webpack://math/./node_modules/core-js/internals/queue.js","webpack://math/./node_modules/core-js/internals/engine-is-browser.js","webpack://math/./node_modules/regenerator-runtime/runtime.js","webpack://math/./node_modules/core-js/modules/es.string.trim.js","webpack://math/./node_modules/core-js/internals/string-trim-forced.js","webpack://math/./node_modules/@babel/runtime/helpers/arrayWithHoles.js","webpack://math/./node_modules/@babel/runtime/helpers/iterableToArrayLimit.js","webpack://math/./node_modules/@babel/runtime/helpers/nonIterableRest.js","webpack://math/./node_modules/@babel/runtime/helpers/arrayWithoutHoles.js","webpack://math/./node_modules/@babel/runtime/helpers/iterableToArray.js","webpack://math/./node_modules/@babel/runtime/helpers/nonIterableSpread.js","webpack://math/./node_modules/core-js/modules/es.array.fill.js","webpack://math/./node_modules/core-js/internals/array-fill.js","webpack://math/./node_modules/seedrandom/lib/alea.js","webpack://math/./node_modules/seedrandom/lib/xor128.js","webpack://math/./node_modules/seedrandom/lib/xorwow.js","webpack://math/./node_modules/seedrandom/lib/xorshift7.js","webpack://math/./node_modules/seedrandom/lib/xor4096.js","webpack://math/./node_modules/seedrandom/lib/tychei.js","webpack://math/./node_modules/seedrandom/seedrandom.js","webpack://math/./node_modules/core-js/modules/es.string.repeat.js","webpack://math/./src/utils/is.js","webpack://math/./src/utils/number.js","webpack://math/./src/utils/bignumber/formatter.js","webpack://math/./src/utils/string.js","webpack://math/./src/error/DimensionError.js","webpack://math/./src/error/IndexError.js","webpack://math/./src/utils/array.js","webpack://math/./src/utils/object.js","webpack://math/./src/utils/factory.js","webpack://math/./src/utils/customs.js","webpack://math/./src/utils/map.js","webpack://math/./src/core/function/typed.js","webpack://math/./src/type/resultset/ResultSet.js","webpack://math/./src/type/bignumber/BigNumber.js","webpack://math/./src/type/complex/Complex.js","webpack://math/./src/type/fraction/Fraction.js","webpack://math/./src/type/matrix/Range.js","webpack://math/./src/type/matrix/Matrix.js","webpack://math/./src/type/matrix/DenseMatrix.js","webpack://math/./src/function/utils/clone.js","webpack://math/./src/utils/switch.js","webpack://math/./src/utils/collection.js","webpack://math/./src/function/utils/isInteger.js","webpack://math/./src/plain/number/utils.js","webpack://math/./src/function/utils/isNegative.js","webpack://math/./src/function/utils/isNumeric.js","webpack://math/./src/function/utils/hasNumericValue.js","webpack://math/./src/function/utils/isPositive.js","webpack://math/./src/function/utils/isZero.js","webpack://math/./src/function/utils/isNaN.js","webpack://math/./src/function/utils/typeOf.js","webpack://math/./src/utils/bignumber/nearlyEqual.js","webpack://math/./src/function/relational/equalScalar.js","webpack://math/./src/utils/complex.js","webpack://math/./src/type/matrix/SparseMatrix.js","webpack://math/./src/type/number.js","webpack://math/./src/type/string.js","webpack://math/./src/type/boolean.js","webpack://math/./src/type/bignumber/function/bignumber.js","webpack://math/./src/type/complex/function/complex.js","webpack://math/./src/type/fraction/function/fraction.js","webpack://math/./src/type/matrix/function/matrix.js","webpack://math/./src/function/matrix/matrixFromFunction.js","webpack://math/./src/function/matrix/matrixFromRows.js","webpack://math/./src/function/matrix/matrixFromColumns.js","webpack://math/./src/type/unit/function/splitUnit.js","webpack://math/./src/plain/number/arithmetic.js","webpack://math/./src/function/arithmetic/unaryMinus.js","webpack://math/./src/function/arithmetic/unaryPlus.js","webpack://math/./src/function/arithmetic/abs.js","webpack://math/./src/function/matrix/apply.js","webpack://math/./src/function/arithmetic/addScalar.js","webpack://math/./src/function/arithmetic/cbrt.js","webpack://math/./src/type/matrix/utils/algorithm11.js","webpack://math/./src/type/matrix/utils/algorithm14.js","webpack://math/./src/function/arithmetic/ceil.js","webpack://math/./src/function/arithmetic/cube.js","webpack://math/./src/function/arithmetic/exp.js","webpack://math/./src/function/arithmetic/expm1.js","webpack://math/./src/function/arithmetic/fix.js","webpack://math/./src/function/arithmetic/floor.js","webpack://math/./src/type/matrix/utils/algorithm01.js","webpack://math/./src/type/matrix/utils/algorithm04.js","webpack://math/./src/type/matrix/utils/algorithm10.js","webpack://math/./src/type/matrix/utils/algorithm13.js","webpack://math/./src/function/arithmetic/gcd.js","webpack://math/./src/type/matrix/utils/algorithm02.js","webpack://math/./src/type/matrix/utils/algorithm06.js","webpack://math/./src/function/arithmetic/lcm.js","webpack://math/./src/function/arithmetic/log10.js","webpack://math/./src/function/arithmetic/log2.js","webpack://math/./src/type/matrix/utils/algorithm03.js","webpack://math/./src/type/matrix/utils/algorithm05.js","webpack://math/./src/type/matrix/utils/algorithm12.js","webpack://math/./src/function/arithmetic/mod.js","webpack://math/./src/function/arithmetic/multiplyScalar.js","webpack://math/./src/function/arithmetic/multiply.js","webpack://math/./src/function/arithmetic/nthRoot.js","webpack://math/./src/function/arithmetic/sign.js","webpack://math/./src/function/arithmetic/sqrt.js","webpack://math/./src/function/arithmetic/square.js","webpack://math/./src/function/arithmetic/subtract.js","webpack://math/./src/function/arithmetic/xgcd.js","webpack://math/./src/function/arithmetic/invmod.js","webpack://math/./src/type/matrix/utils/algorithm09.js","webpack://math/./src/function/arithmetic/dotMultiply.js","webpack://math/./src/utils/bignumber/bitwise.js","webpack://math/./src/plain/number/bitwise.js","webpack://math/./src/function/bitwise/bitAnd.js","webpack://math/./src/function/bitwise/bitNot.js","webpack://math/./src/function/bitwise/bitOr.js","webpack://math/./src/type/matrix/utils/algorithm07.js","webpack://math/./src/function/bitwise/bitXor.js","webpack://math/./src/function/complex/arg.js","webpack://math/./src/function/complex/conj.js","webpack://math/./src/function/complex/im.js","webpack://math/./src/function/complex/re.js","webpack://math/./src/plain/number/logical.js","webpack://math/./src/function/logical/not.js","webpack://math/./src/function/logical/or.js","webpack://math/./src/function/logical/xor.js","webpack://math/./src/function/matrix/concat.js","webpack://math/./src/function/matrix/column.js","webpack://math/./src/function/matrix/count.js","webpack://math/./src/function/matrix/cross.js","webpack://math/./src/function/matrix/diag.js","webpack://math/./src/utils/lruQueue.js","webpack://math/./src/utils/function.js","webpack://math/./src/function/matrix/filter.js","webpack://math/./src/function/matrix/flatten.js","webpack://math/./src/function/matrix/forEach.js","webpack://math/./src/function/matrix/getMatrixDataType.js","webpack://math/./src/function/matrix/identity.js","webpack://math/./src/function/matrix/kron.js","webpack://math/./src/function/matrix/map.js","webpack://math/./src/function/matrix/diff.js","webpack://math/./src/function/matrix/ones.js","webpack://math/./src/utils/noop.js","webpack://math/./src/function/matrix/range.js","webpack://math/./src/function/matrix/reshape.js","webpack://math/./src/error/ArgumentsError.js","webpack://math/./src/function/matrix/resize.js","webpack://math/./src/function/matrix/rotate.js","webpack://math/./src/function/matrix/rotationMatrix.js","webpack://math/./src/function/matrix/row.js","webpack://math/./src/function/matrix/size.js","webpack://math/./src/function/matrix/squeeze.js","webpack://math/./src/function/matrix/subset.js","webpack://math/./src/function/matrix/transpose.js","webpack://math/./src/function/matrix/ctranspose.js","webpack://math/./src/function/matrix/zeros.js","webpack://math/./src/function/special/erf.js","webpack://math/./src/function/statistics/mode.js","webpack://math/./src/function/statistics/utils/improveErrorMessage.js","webpack://math/./src/function/statistics/prod.js","webpack://math/./src/function/string/format.js","webpack://math/./src/function/string/bin.js","webpack://math/./src/function/string/oct.js","webpack://math/./src/function/string/hex.js","webpack://math/./src/function/string/print.js","webpack://math/./src/function/unit/to.js","webpack://math/./src/function/utils/isPrime.js","webpack://math/./src/function/utils/numeric.js","webpack://math/./src/function/arithmetic/divideScalar.js","webpack://math/./src/function/arithmetic/pow.js","webpack://math/./src/function/arithmetic/round.js","webpack://math/./src/function/arithmetic/log.js","webpack://math/./src/function/arithmetic/log1p.js","webpack://math/./src/function/arithmetic/nthRoots.js","webpack://math/./src/function/arithmetic/dotPow.js","webpack://math/./src/function/arithmetic/dotDivide.js","webpack://math/./src/function/algebra/solver/utils/solveValidation.js","webpack://math/./src/function/algebra/solver/lsolve.js","webpack://math/./src/function/algebra/solver/usolve.js","webpack://math/./src/function/algebra/solver/lsolveAll.js","webpack://math/./src/function/algebra/solver/usolveAll.js","webpack://math/./src/type/matrix/utils/algorithm08.js","webpack://math/./src/function/bitwise/leftShift.js","webpack://math/./src/function/bitwise/rightArithShift.js","webpack://math/./src/function/bitwise/rightLogShift.js","webpack://math/./src/function/logical/and.js","webpack://math/./src/function/relational/compare.js","webpack://math/./src/function/relational/compareNatural.js","webpack://math/./src/function/relational/compareText.js","webpack://math/./src/function/relational/equal.js","webpack://math/./src/function/relational/equalText.js","webpack://math/./src/function/relational/smaller.js","webpack://math/./src/function/relational/smallerEq.js","webpack://math/./src/function/relational/larger.js","webpack://math/./src/function/relational/largerEq.js","webpack://math/./src/function/relational/deepEqual.js","webpack://math/./src/function/relational/unequal.js","webpack://math/./src/function/matrix/partitionSelect.js","webpack://math/./src/function/matrix/sort.js","webpack://math/./src/function/statistics/max.js","webpack://math/./src/function/statistics/min.js","webpack://math/./src/type/matrix/ImmutableDenseMatrix.js","webpack://math/./src/type/matrix/MatrixIndex.js","webpack://math/./src/type/matrix/FibonacciHeap.js","webpack://math/./src/type/matrix/Spa.js","webpack://math/./src/utils/bignumber/constants.js","webpack://math/./src/type/unit/Unit.js","webpack://math/./src/type/unit/function/unit.js","webpack://math/./src/type/matrix/function/sparse.js","webpack://math/./src/type/unit/function/createUnit.js","webpack://math/./src/function/trigonometry/acos.js","webpack://math/./src/plain/number/trigonometry.js","webpack://math/./src/function/trigonometry/acosh.js","webpack://math/./src/function/trigonometry/acot.js","webpack://math/./src/function/trigonometry/acoth.js","webpack://math/./src/function/trigonometry/acsc.js","webpack://math/./src/function/trigonometry/acsch.js","webpack://math/./src/function/trigonometry/asec.js","webpack://math/./src/function/trigonometry/asech.js","webpack://math/./src/function/trigonometry/asin.js","webpack://math/./src/function/trigonometry/asinh.js","webpack://math/./src/function/trigonometry/atan.js","webpack://math/./src/function/trigonometry/atan2.js","webpack://math/./src/function/trigonometry/atanh.js","webpack://math/./src/function/trigonometry/cos.js","webpack://math/./src/function/trigonometry/cosh.js","webpack://math/./src/function/trigonometry/cot.js","webpack://math/./src/function/trigonometry/coth.js","webpack://math/./src/function/trigonometry/csc.js","webpack://math/./src/function/trigonometry/csch.js","webpack://math/./src/function/trigonometry/sec.js","webpack://math/./src/function/trigonometry/sech.js","webpack://math/./src/function/trigonometry/sin.js","webpack://math/./src/function/trigonometry/sinh.js","webpack://math/./src/function/trigonometry/tan.js","webpack://math/./src/function/trigonometry/tanh.js","webpack://math/./src/function/set/setCartesian.js","webpack://math/./src/function/set/setDifference.js","webpack://math/./src/function/set/setDistinct.js","webpack://math/./src/function/set/setIntersect.js","webpack://math/./src/function/set/setIsSubset.js","webpack://math/./src/function/set/setMultiplicity.js","webpack://math/./src/function/set/setPowerset.js","webpack://math/./src/function/set/setSize.js","webpack://math/./src/function/set/setSymDifference.js","webpack://math/./src/function/set/setUnion.js","webpack://math/./src/function/arithmetic/add.js","webpack://math/./src/function/arithmetic/hypot.js","webpack://math/./src/function/arithmetic/norm.js","webpack://math/./src/function/matrix/dot.js","webpack://math/./src/function/matrix/trace.js","webpack://math/./src/type/matrix/function/index.js","webpack://math/./src/expression/keywords.js","webpack://math/./src/expression/node/Node.js","webpack://math/./src/expression/transform/utils/errorTransform.js","webpack://math/./src/expression/node/utils/access.js","webpack://math/./src/expression/node/AccessorNode.js","webpack://math/./src/expression/node/ArrayNode.js","webpack://math/./src/expression/operators.js","webpack://math/./src/expression/node/AssignmentNode.js","webpack://math/./src/expression/node/utils/assign.js","webpack://math/./src/expression/node/BlockNode.js","webpack://math/./src/expression/node/ConditionalNode.js","webpack://math/./src/utils/latex.js","webpack://math/./src/expression/node/ConstantNode.js","webpack://math/./src/expression/node/FunctionAssignmentNode.js","webpack://math/./src/expression/node/IndexNode.js","webpack://math/./src/expression/node/ObjectNode.js","webpack://math/./src/expression/node/OperatorNode.js","webpack://math/./src/expression/node/ParenthesisNode.js","webpack://math/./src/expression/node/RangeNode.js","webpack://math/./src/expression/node/RelationalNode.js","webpack://math/./src/expression/node/SymbolNode.js","webpack://math/./src/utils/scope.js","webpack://math/./src/expression/node/FunctionNode.js","webpack://math/./src/expression/parse.js","webpack://math/./src/expression/function/compile.js","webpack://math/./src/expression/function/evaluate.js","webpack://math/./src/expression/Parser.js","webpack://math/./src/expression/function/parser.js","webpack://math/./src/function/algebra/decomposition/lup.js","webpack://math/./src/function/algebra/decomposition/qr.js","webpack://math/./src/function/algebra/sparse/csTdfs.js","webpack://math/./src/function/algebra/sparse/csFlip.js","webpack://math/./src/function/algebra/sparse/csAmd.js","webpack://math/./src/function/algebra/sparse/csFkeep.js","webpack://math/./src/function/algebra/sparse/csLeaf.js","webpack://math/./src/function/algebra/sparse/csCounts.js","webpack://math/./src/function/algebra/sparse/csSqr.js","webpack://math/./src/function/algebra/sparse/csPermute.js","webpack://math/./src/function/algebra/sparse/csEtree.js","webpack://math/./src/function/algebra/sparse/csPost.js","webpack://math/./src/function/algebra/sparse/csMarked.js","webpack://math/./src/function/algebra/sparse/csMark.js","webpack://math/./src/function/algebra/sparse/csUnflip.js","webpack://math/./src/function/algebra/sparse/csDfs.js","webpack://math/./src/function/algebra/sparse/csSpsolve.js","webpack://math/./src/function/algebra/sparse/csReach.js","webpack://math/./src/function/algebra/sparse/csLu.js","webpack://math/./src/function/algebra/decomposition/slu.js","webpack://math/./src/function/algebra/sparse/csIpvec.js","webpack://math/./src/function/algebra/solver/lusolve.js","webpack://math/./src/expression/Help.js","webpack://math/./src/type/chain/Chain.js","webpack://math/./src/expression/embeddedDocs/constants/e.js","webpack://math/./src/expression/embeddedDocs/constants/pi.js","webpack://math/./src/expression/embeddedDocs/embeddedDocs.js","webpack://math/./src/expression/embeddedDocs/construction/bignumber.js","webpack://math/./src/expression/embeddedDocs/construction/boolean.js","webpack://math/./src/expression/embeddedDocs/construction/complex.js","webpack://math/./src/expression/embeddedDocs/construction/createUnit.js","webpack://math/./src/expression/embeddedDocs/construction/fraction.js","webpack://math/./src/expression/embeddedDocs/construction/index.js","webpack://math/./src/expression/embeddedDocs/construction/matrix.js","webpack://math/./src/expression/embeddedDocs/construction/number.js","webpack://math/./src/expression/embeddedDocs/construction/sparse.js","webpack://math/./src/expression/embeddedDocs/construction/splitUnit.js","webpack://math/./src/expression/embeddedDocs/construction/string.js","webpack://math/./src/expression/embeddedDocs/construction/unit.js","webpack://math/./src/expression/embeddedDocs/constants/false.js","webpack://math/./src/expression/embeddedDocs/constants/i.js","webpack://math/./src/expression/embeddedDocs/constants/Infinity.js","webpack://math/./src/expression/embeddedDocs/constants/LN2.js","webpack://math/./src/expression/embeddedDocs/constants/LN10.js","webpack://math/./src/expression/embeddedDocs/constants/LOG2E.js","webpack://math/./src/expression/embeddedDocs/constants/LOG10E.js","webpack://math/./src/expression/embeddedDocs/constants/NaN.js","webpack://math/./src/expression/embeddedDocs/constants/null.js","webpack://math/./src/expression/embeddedDocs/constants/phi.js","webpack://math/./src/expression/embeddedDocs/constants/SQRT1_2.js","webpack://math/./src/expression/embeddedDocs/constants/SQRT2.js","webpack://math/./src/expression/embeddedDocs/constants/tau.js","webpack://math/./src/expression/embeddedDocs/constants/true.js","webpack://math/./src/expression/embeddedDocs/constants/version.js","webpack://math/./src/expression/embeddedDocs/function/algebra/derivative.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lsolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lsolveAll.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lup.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lusolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/leafCount.js","webpack://math/./src/expression/embeddedDocs/function/algebra/resolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/simplify.js","webpack://math/./src/expression/embeddedDocs/function/algebra/simplifyCore.js","webpack://math/./src/expression/embeddedDocs/function/algebra/symbolicEqual.js","webpack://math/./src/expression/embeddedDocs/function/algebra/rationalize.js","webpack://math/./src/expression/embeddedDocs/function/algebra/slu.js","webpack://math/./src/expression/embeddedDocs/function/algebra/usolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/usolveAll.js","webpack://math/./src/expression/embeddedDocs/function/algebra/qr.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/abs.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/add.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/cbrt.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/ceil.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/cube.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/divide.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/dotDivide.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/dotMultiply.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/dotPow.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/exp.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/expm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/expm1.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/fix.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/floor.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/gcd.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/hypot.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/lcm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log2.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log1p.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log10.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/mod.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/multiply.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/norm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/nthRoot.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/nthRoots.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/pow.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/round.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/sign.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/sqrt.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/sqrtm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/square.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/subtract.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/unaryMinus.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/unaryPlus.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/xgcd.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/invmod.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitAnd.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitNot.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitOr.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitXor.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/leftShift.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/rightArithShift.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/rightLogShift.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/bellNumbers.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/catalan.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/composition.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/stirlingS2.js","webpack://math/./src/expression/embeddedDocs/core/config.js","webpack://math/./src/expression/embeddedDocs/core/import.js","webpack://math/./src/expression/embeddedDocs/core/typed.js","webpack://math/./src/expression/embeddedDocs/function/complex/arg.js","webpack://math/./src/expression/embeddedDocs/function/complex/conj.js","webpack://math/./src/expression/embeddedDocs/function/complex/re.js","webpack://math/./src/expression/embeddedDocs/function/complex/im.js","webpack://math/./src/expression/embeddedDocs/function/expression/evaluate.js","webpack://math/./src/expression/embeddedDocs/function/expression/help.js","webpack://math/./src/expression/embeddedDocs/function/geometry/distance.js","webpack://math/./src/expression/embeddedDocs/function/geometry/intersect.js","webpack://math/./src/expression/embeddedDocs/function/logical/and.js","webpack://math/./src/expression/embeddedDocs/function/logical/not.js","webpack://math/./src/expression/embeddedDocs/function/logical/or.js","webpack://math/./src/expression/embeddedDocs/function/logical/xor.js","webpack://math/./src/expression/embeddedDocs/function/matrix/concat.js","webpack://math/./src/expression/embeddedDocs/function/matrix/count.js","webpack://math/./src/expression/embeddedDocs/function/matrix/cross.js","webpack://math/./src/expression/embeddedDocs/function/matrix/column.js","webpack://math/./src/expression/embeddedDocs/function/matrix/ctranspose.js","webpack://math/./src/expression/embeddedDocs/function/matrix/det.js","webpack://math/./src/expression/embeddedDocs/function/matrix/diag.js","webpack://math/./src/expression/embeddedDocs/function/matrix/diff.js","webpack://math/./src/expression/embeddedDocs/function/matrix/dot.js","webpack://math/./src/expression/embeddedDocs/function/matrix/getMatrixDataType.js","webpack://math/./src/expression/embeddedDocs/function/matrix/identity.js","webpack://math/./src/expression/embeddedDocs/function/matrix/filter.js","webpack://math/./src/expression/embeddedDocs/function/matrix/flatten.js","webpack://math/./src/expression/embeddedDocs/function/matrix/forEach.js","webpack://math/./src/expression/embeddedDocs/function/matrix/inv.js","webpack://math/./src/expression/embeddedDocs/function/matrix/eigs.js","webpack://math/./src/expression/embeddedDocs/function/matrix/kron.js","webpack://math/./src/expression/embeddedDocs/function/matrix/matrixFromFunction.js","webpack://math/./src/expression/embeddedDocs/function/matrix/matrixFromRows.js","webpack://math/./src/expression/embeddedDocs/function/matrix/matrixFromColumns.js","webpack://math/./src/expression/embeddedDocs/function/matrix/map.js","webpack://math/./src/expression/embeddedDocs/function/matrix/ones.js","webpack://math/./src/expression/embeddedDocs/function/matrix/partitionSelect.js","webpack://math/./src/expression/embeddedDocs/function/matrix/range.js","webpack://math/./src/expression/embeddedDocs/function/matrix/resize.js","webpack://math/./src/expression/embeddedDocs/function/matrix/reshape.js","webpack://math/./src/expression/embeddedDocs/function/matrix/rotate.js","webpack://math/./src/expression/embeddedDocs/function/matrix/rotationMatrix.js","webpack://math/./src/expression/embeddedDocs/function/matrix/row.js","webpack://math/./src/expression/embeddedDocs/function/matrix/size.js","webpack://math/./src/expression/embeddedDocs/function/matrix/sort.js","webpack://math/./src/expression/embeddedDocs/function/matrix/squeeze.js","webpack://math/./src/expression/embeddedDocs/function/matrix/subset.js","webpack://math/./src/expression/embeddedDocs/function/matrix/trace.js","webpack://math/./src/expression/embeddedDocs/function/matrix/transpose.js","webpack://math/./src/expression/embeddedDocs/function/matrix/zeros.js","webpack://math/./src/expression/embeddedDocs/function/probability/combinations.js","webpack://math/./src/expression/embeddedDocs/function/probability/combinationsWithRep.js","webpack://math/./src/expression/embeddedDocs/function/probability/factorial.js","webpack://math/./src/expression/embeddedDocs/function/probability/gamma.js","webpack://math/./src/expression/embeddedDocs/function/probability/kldivergence.js","webpack://math/./src/expression/embeddedDocs/function/probability/multinomial.js","webpack://math/./src/expression/embeddedDocs/function/probability/permutations.js","webpack://math/./src/expression/embeddedDocs/function/probability/pickRandom.js","webpack://math/./src/expression/embeddedDocs/function/probability/random.js","webpack://math/./src/expression/embeddedDocs/function/probability/randomInt.js","webpack://math/./src/expression/embeddedDocs/function/relational/compare.js","webpack://math/./src/expression/embeddedDocs/function/relational/compareNatural.js","webpack://math/./src/expression/embeddedDocs/function/relational/compareText.js","webpack://math/./src/expression/embeddedDocs/function/relational/deepEqual.js","webpack://math/./src/expression/embeddedDocs/function/relational/equal.js","webpack://math/./src/expression/embeddedDocs/function/relational/equalText.js","webpack://math/./src/expression/embeddedDocs/function/relational/larger.js","webpack://math/./src/expression/embeddedDocs/function/relational/largerEq.js","webpack://math/./src/expression/embeddedDocs/function/relational/smaller.js","webpack://math/./src/expression/embeddedDocs/function/relational/smallerEq.js","webpack://math/./src/expression/embeddedDocs/function/relational/unequal.js","webpack://math/./src/expression/embeddedDocs/function/set/setCartesian.js","webpack://math/./src/expression/embeddedDocs/function/set/setDifference.js","webpack://math/./src/expression/embeddedDocs/function/set/setDistinct.js","webpack://math/./src/expression/embeddedDocs/function/set/setIntersect.js","webpack://math/./src/expression/embeddedDocs/function/set/setIsSubset.js","webpack://math/./src/expression/embeddedDocs/function/set/setMultiplicity.js","webpack://math/./src/expression/embeddedDocs/function/set/setPowerset.js","webpack://math/./src/expression/embeddedDocs/function/set/setSize.js","webpack://math/./src/expression/embeddedDocs/function/set/setSymDifference.js","webpack://math/./src/expression/embeddedDocs/function/set/setUnion.js","webpack://math/./src/expression/embeddedDocs/function/special/erf.js","webpack://math/./src/expression/embeddedDocs/function/statistics/cumsum.js","webpack://math/./src/expression/embeddedDocs/function/statistics/mad.js","webpack://math/./src/expression/embeddedDocs/function/statistics/max.js","webpack://math/./src/expression/embeddedDocs/function/statistics/mean.js","webpack://math/./src/expression/embeddedDocs/function/statistics/median.js","webpack://math/./src/expression/embeddedDocs/function/statistics/min.js","webpack://math/./src/expression/embeddedDocs/function/statistics/mode.js","webpack://math/./src/expression/embeddedDocs/function/statistics/prod.js","webpack://math/./src/expression/embeddedDocs/function/statistics/quantileSeq.js","webpack://math/./src/expression/embeddedDocs/function/statistics/std.js","webpack://math/./src/expression/embeddedDocs/function/statistics/sum.js","webpack://math/./src/expression/embeddedDocs/function/statistics/variance.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acos.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acosh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acot.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acoth.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acsc.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acsch.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asec.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asech.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asin.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asinh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/atan.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/atanh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/atan2.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/cos.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/cosh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/cot.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/coth.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/csc.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/csch.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sec.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sech.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sin.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sinh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/tan.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/tanh.js","webpack://math/./src/expression/embeddedDocs/function/units/to.js","webpack://math/./src/expression/embeddedDocs/function/utils/clone.js","webpack://math/./src/expression/embeddedDocs/function/utils/format.js","webpack://math/./src/expression/embeddedDocs/function/utils/bin.js","webpack://math/./src/expression/embeddedDocs/function/utils/oct.js","webpack://math/./src/expression/embeddedDocs/function/utils/hex.js","webpack://math/./src/expression/embeddedDocs/function/utils/isNaN.js","webpack://math/./src/expression/embeddedDocs/function/utils/isInteger.js","webpack://math/./src/expression/embeddedDocs/function/utils/isNegative.js","webpack://math/./src/expression/embeddedDocs/function/utils/isNumeric.js","webpack://math/./src/expression/embeddedDocs/function/utils/hasNumericValue.js","webpack://math/./src/expression/embeddedDocs/function/utils/isPositive.js","webpack://math/./src/expression/embeddedDocs/function/utils/isPrime.js","webpack://math/./src/expression/embeddedDocs/function/utils/isZero.js","webpack://math/./src/expression/embeddedDocs/function/utils/print.js","webpack://math/./src/expression/embeddedDocs/function/utils/typeOf.js","webpack://math/./src/expression/embeddedDocs/function/utils/numeric.js","webpack://math/./src/expression/function/help.js","webpack://math/./src/type/chain/function/chain.js","webpack://math/./src/function/matrix/det.js","webpack://math/./src/function/matrix/inv.js","webpack://math/./src/function/matrix/eigs/complexEigs.js","webpack://math/./src/function/matrix/eigs.js","webpack://math/./src/function/matrix/eigs/realSymetric.js","webpack://math/./src/function/matrix/expm.js","webpack://math/./src/function/matrix/sqrtm.js","webpack://math/./src/function/arithmetic/divide.js","webpack://math/./src/function/geometry/distance.js","webpack://math/./src/function/geometry/intersect.js","webpack://math/./src/function/statistics/sum.js","webpack://math/./src/function/statistics/cumsum.js","webpack://math/./src/function/statistics/mean.js","webpack://math/./src/function/statistics/median.js","webpack://math/./src/function/statistics/mad.js","webpack://math/./src/function/statistics/variance.js","webpack://math/./src/function/statistics/quantileSeq.js","webpack://math/./src/function/statistics/std.js","webpack://math/./src/utils/product.js","webpack://math/./src/plain/number/combinations.js","webpack://math/./src/function/probability/combinations.js","webpack://math/./src/function/probability/combinationsWithRep.js","webpack://math/./src/plain/number/probability.js","webpack://math/./src/function/probability/gamma.js","webpack://math/./src/function/probability/factorial.js","webpack://math/./src/function/probability/kldivergence.js","webpack://math/./src/function/probability/multinomial.js","webpack://math/./src/function/probability/permutations.js","webpack://math/./src/function/probability/util/seededRNG.js","webpack://math/./src/function/probability/pickRandom.js","webpack://math/./src/function/probability/util/randomMatrix.js","webpack://math/./src/function/probability/random.js","webpack://math/./src/function/probability/randomInt.js","webpack://math/./src/function/combinatorics/stirlingS2.js","webpack://math/./src/function/combinatorics/bellNumbers.js","webpack://math/./src/function/combinatorics/catalan.js","webpack://math/./src/function/combinatorics/composition.js","webpack://math/./src/function/algebra/leafCount.js","webpack://math/./src/function/algebra/simplify/util.js","webpack://math/./src/function/algebra/simplify/simplifyConstant.js","webpack://math/./src/function/algebra/simplify.js","webpack://math/./src/function/algebra/simplifyCore.js","webpack://math/./src/function/algebra/resolve.js","webpack://math/./src/function/algebra/symbolicEqual.js","webpack://math/./src/function/algebra/derivative.js","webpack://math/./src/function/algebra/rationalize.js","webpack://math/./src/json/reviver.js","webpack://math/./src/json/replacer.js","webpack://math/./src/plain/number/constants.js","webpack://math/./src/constants.js","webpack://math/./src/version.js","webpack://math/./src/type/unit/physicalConstants.js","webpack://math/./src/expression/transform/apply.transform.js","webpack://math/./src/expression/transform/column.transform.js","webpack://math/./src/expression/transform/utils/compileInlineExpression.js","webpack://math/./src/expression/transform/filter.transform.js","webpack://math/./src/expression/transform/forEach.transform.js","webpack://math/./src/expression/transform/index.transform.js","webpack://math/./src/expression/transform/map.transform.js","webpack://math/./src/expression/transform/utils/lastDimToZeroBase.js","webpack://math/./src/expression/transform/max.transform.js","webpack://math/./src/expression/transform/mean.transform.js","webpack://math/./src/expression/transform/min.transform.js","webpack://math/./src/expression/transform/range.transform.js","webpack://math/./src/expression/transform/row.transform.js","webpack://math/./src/expression/transform/subset.transform.js","webpack://math/./src/expression/transform/concat.transform.js","webpack://math/./src/expression/transform/diff.transform.js","webpack://math/./src/expression/transform/std.transform.js","webpack://math/./src/expression/transform/sum.transform.js","webpack://math/./src/expression/transform/cumsum.transform.js","webpack://math/./src/expression/transform/variance.transform.js","webpack://math/./src/core/function/import.js","webpack://math/./src/core/config.js","webpack://math/./src/core/function/config.js","webpack://math/./src/defaultInstance.js","webpack://math/./src/core/create.js","webpack://math/./src/utils/emitter.js"],"names":["root","factory","exports","module","define","amd","this","installedModules","__webpack_require__","moduleId","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","TO_STRING_TAG_SUPPORT","redefine","toString","unsafe","it","Math","check","globalThis","window","self","global","Function","_typeof","obj","iterator","constructor","$","$map","map","target","proto","forced","arrayMethodHasSpeciesSupport","callbackfn","arguments","length","undefined","DOMIterables","DOMTokenListPrototype","forEach","createNonEnumerableProperty","handlePrototype","CollectionPrototype","error","COLLECTION_NAME","getOwnPropertyDescriptor","f","setGlobal","copyConstructorProperties","isForced","options","source","targetProperty","sourceProperty","descriptor","TARGET","GLOBAL","STATIC","stat","noTargetGet","sham","uncurryThis","PROPER_FUNCTION_NAME","PROPER","anObject","isPrototypeOf","$toString","fails","regExpFlags","RegExpPrototype","RegExp","n$ToString","getFlags","NOT_GENERIC","flags","INCORRECT_NAME","R","rf","exec","NATIVE_BIND","FunctionPrototype","fn","apply","Internal","OwnPromiseCapability","PromiseWrapper","nativeThen","IS_PURE","getBuiltIn","NativePromise","redefineAll","setPrototypeOf","setToStringTag","setSpecies","aCallable","isCallable","isObject","anInstance","inspectSource","iterate","checkCorrectnessOfIteration","speciesConstructor","task","set","microtask","promiseResolve","hostReportErrors","newPromiseCapabilityModule","perform","Queue","InternalStateModule","wellKnownSymbol","IS_BROWSER","IS_NODE","V8_VERSION","SPECIES","PROMISE","getInternalState","getterFor","setInternalState","getInternalPromiseState","NativePromisePrototype","PromiseConstructor","PromisePrototype","TypeError","document","process","newPromiseCapability","newGenericPromiseCapability","DISPATCH_EVENT","createEvent","dispatchEvent","NATIVE_REJECTION_EVENT","PromiseRejectionEvent","SUBCLASSING","FORCED","PROMISE_CONSTRUCTOR_SOURCE","GLOBAL_CORE_JS_PROMISE","String","test","promise","resolve","FakePromise","then","INCORRECT_ITERATION","iterable","all","isThenable","callReaction","reaction","state","result","exited","ok","handler","fail","reject","domain","rejection","onHandleUnhandled","enter","exit","notify","isReject","notified","reactions","onUnhandled","reason","event","initEvent","facade","isUnhandled","emit","parent","unwrap","internalReject","done","internalResolve","wrapper","executor","type","onFulfilled","onRejected","add","C","that","wrap","Promise","capability","x","$promiseResolve","values","counter","remaining","index","alreadyCalled","race","DESCRIPTORS","FUNCTION_NAME_EXISTS","EXISTS","functionToString","nameRE","regExpExec","configurable","toJSON","URL","IndexedObject","toIndexedObject","arrayMethodIsStrict","un$Join","join","ES3_STRINGS","STRICT_METHOD","separator","argument","shared","hasOwn","uid","NATIVE_SYMBOL","USE_SYMBOL_AS_UID","WellKnownSymbolsStore","symbolFor","createWellKnownSymbol","withoutSetter","description","isArray","isConstructor","toAbsoluteIndex","lengthOfArrayLike","createProperty","un$Slice","HAS_SPECIES_SUPPORT","Array","max","slice","start","end","Constructor","O","k","fin","toObject","arraySpeciesCreate","IS_CONCAT_SPREADABLE","IS_CONCAT_SPREADABLE_SUPPORT","array","concat","SPECIES_SUPPORT","isConcatSpreadable","spreadable","arg","len","E","A","IE8_DOM_DEFINE","V8_PROTOTYPE_DEFINE_BUG","toPropertyKey","$defineProperty","$getOwnPropertyDescriptor","P","Attributes","current","writable","$find","find","addToUnscopables","SKIPS_HOLES","arrayWithoutHoles","iterableToArray","unsupportedIterableToArray","nonIterableSpread","arr","Iterators","defineIterator","iterated","kind","Arguments","nativeKeys","keys","toIntegerOrInfinity","min","splice","deleteCount","insertCount","actualDeleteCount","from","to","actualStart","argumentsLength","inheritIfRequired","isSymbol","toPrimitive","getOwnPropertyNames","thisNumberValue","trim","NativeNumber","NumberPrototype","arraySlice","charCodeAt","toNumeric","primValue","toNumber","first","third","radix","maxCode","digits","code","NaN","parseInt","NumberWrapper","dummy","split","j","ArrayIteratorMethods","ITERATOR","TO_STRING_TAG","ArrayValues","METHOD_NAME","_extends","assign","cosh","exp","sinh","parser_exit","SyntaxError","logHypot","a","b","_a","abs","_b","log","LN2","Complex","z","Number","isFinite","cos","sin","tokens","match","plus","minus","isNaN","parseFloat","parse","pow","atan2","loh","re","im","sqrt","tmp","expm1","PI","xx","cosm1","y","t1","t2","Infinity","atan","acos","asin","res","noIM","oneMinus","onePlus","temp","atanh","asinh","acosh","places","ceil","floor","round","ret","classof","requireObjectCoercible","CONFIGURABLE_FUNCTION_NAME","CONFIGURABLE","enforceInternalState","enforce","TEMPLATE","simple","replace","$filter","filter","createPropertyDescriptor","nativeObjectCreate","objectKeys","getOwnPropertyNamesModule","getOwnPropertyNamesExternal","getOwnPropertySymbolsModule","getOwnPropertyDescriptorModule","definePropertyModule","definePropertiesModule","propertyIsEnumerableModule","sharedKey","hiddenKeys","wrappedWellKnownSymbolModule","defineWellKnownSymbol","$forEach","HIDDEN","TO_PRIMITIVE","ObjectPrototype","$Symbol","SymbolPrototype","QObject","$stringify","nativeGetOwnPropertyDescriptor","nativeDefineProperty","nativeGetOwnPropertyNames","nativePropertyIsEnumerable","push","AllSymbols","ObjectPrototypeSymbols","StringToSymbolRegistry","SymbolToStringRegistry","USE_SETTER","findChild","setSymbolDescriptor","ObjectPrototypeDescriptor","tag","symbol","$defineProperties","Properties","properties","$getOwnPropertySymbols","$propertyIsEnumerable","V","$getOwnPropertyNames","names","IS_OBJECT_PROTOTYPE","setter","string","keyFor","sym","useSetter","useSimple","defineProperties","getOwnPropertySymbols","stringify","replacer","space","args","$replacer","valueOf","hint","Error","internalSort","FF","IE_OR_EDGE","V8","WEBKIT","un$Sort","sort","FAILS_ON_UNDEFINED","FAILS_ON_NULL","STABLE_SORT","chr","fromCharCode","v","charAt","comparefn","itemsLength","items","arrayLength","getSortCompare","point","stringSlice","has","NATIVE_WEAK_MAP","WeakMap","store","wmget","wmhas","wmset","metadata","STATE","TYPE","toLength","numberToString","tester","low","hi","fix","offset","prev","next","execCalled","DELEGATES_TO_EXEC","un$Test","str","aFunction","namespace","method","fixRegExpWellKnownSymbolLogic","isRegExp","advanceStringIndex","getMethod","callRegExpExec","regexpExec","stickyHelpers","UNSUPPORTED_Y","$push","SPLIT","nativeSplit","maybeCallNative","internalSplit","limit","lim","lastIndex","lastLength","output","ignoreCase","multiline","unicode","sticky","lastLastIndex","separatorCopy","splitter","rx","S","unicodeMatching","q","e","originalExec","NativeSymbol","EmptyStringDescriptionStore","SymbolWrapper","symbolToString","symbolValueOf","regexp","desc","arrayWithHoles","iterableToArrayLimit","nonIterableRest","number","globalScope","Decimal","inexact","quadrant","EXP_LIMIT","NUMERALS","LN10","DEFAULTS","precision","rounding","modulo","toExpNeg","toExpPos","minE","maxE","crypto","external","invalidArgument","decimalError","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LN10_PRECISION","PI_PRECISION","digitsToString","ws","indexOfLastWord","w","getZeroString","checkInt32","checkRoundingDigits","rm","repeating","di","rd","convertBase","baseIn","baseOut","arrL","strL","indexOf","reverse","absoluteValue","finalise","clampedTo","clamp","Ctor","gt","cmp","comparedTo","xdL","ydL","xd","yd","xs","ys","cosine","pr","sd","isZero","tinyPow","taylorSeries","times","cos2x","toLessThanHalfPi","neg","cubeRoot","cbrt","rep","t3","t3plusx","toExponential","divide","eq","decimalPlaces","dp","dividedBy","div","dividedToIntegerBy","divToInt","equals","greaterThan","greaterThanOrEqualTo","gte","hyperbolicCosine","one","cosh2_x","d8","hyperbolicSine","sinh2_x","d5","d16","d20","hyperbolicTangent","tanh","inverseCosine","halfPi","isNeg","getPi","inverseHyperbolicCosine","lte","ln","inverseHyperbolicSine","inverseHyperbolicTangent","wpr","xsd","inverseSine","inverseTangent","px","x2","isInteger","isInt","isNegative","isPositive","isPos","lessThan","lt","lessThanOrEqualTo","logarithm","base","isBase10","denominator","inf","num","naturalLogarithm","getLn10","sub","xe","xLTy","pop","shift","getBase10Exponent","mod","naturalExponential","negated","carry","unshift","getPrecision","sine","sin2_x","squareRoot","tangent","tan","mul","rL","toBinary","toStringBinary","toDecimalPlaces","toDP","finiteToString","toFixed","toFraction","maxD","d0","d1","d2","n0","n1","toHexadecimal","toHex","toNearest","toOctal","toPower","yn","intPow","toPrecision","toSignificantDigits","toSD","truncated","trunc","multiplyInteger","compare","aL","bL","subtract","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","sign","isTruncated","roundUp","xdi","out","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","ltgt","guard","sum","c0","numerator","x1","parseDecimal","search","substring","parseOther","divisor","isFloat","toLowerCase","isHyperbolic","u","pi","config","useDefaults","defaults","ps","getRandomValues","randomBytes","hypot","isDecimalInstance","log2","log10","random","Uint32Array","copy","clone","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","Fraction","newFraction","gcd","factorize","factors","p1","p2","M","B","D","N","eps","thisABS","cont","excludeWhole","whole","dec","cycLen","cycleLen","cycOff","rem1","rem2","modpow","cycleStart","naturalSort","oFxNcL","oFyNcL","sre","dre","hre","ore","insensitive","xN","yN","xD","Date","yD","cLoc","numS","func","tryToString","internalObjectKeys","activeXDocument","enumBugKeys","html","documentCreateElement","IE_PROTO","EmptyConstructor","scriptTag","content","LT","NullProtoObjectViaActiveX","write","close","parentWindow","NullProtoObject","ActiveXObject","iframeDocument","iframe","style","display","appendChild","src","contentWindow","open","F","propertyKey","getSubstitution","REPLACE","stringIndexOf","REPLACE_KEEPS_$0","REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE","_","nativeReplace","UNSAFE_SUBSTITUTE","searchValue","replaceValue","functionalReplace","fullUnicode","results","accumulatedResult","nextSourcePosition","matched","position","captures","namedCaptures","groups","replacerArgs","replacement","webpackPolyfill","deprecate","paths","children","__webpack_amd_options__","bitmap","version","userAgent","Deno","versions","v8","getDescriptor","integer","feature","detection","data","normalize","POLYFILL","NATIVE","createMethod","IS_MAP","IS_FILTER","IS_SOME","IS_EVERY","IS_FIND_INDEX","IS_FILTER_REJECT","NO_HOLES","$this","specificCreate","boundFunction","some","every","findIndex","filterReject","foo","Boolean","Reflect","TAG","copyright","license","id","postfix","createElement","classofRaw","CORRECT_ARGUMENTS","tryGet","callee","noop","empty","construct","constructorRegExp","INCORRECT_TO_STRING","isConstructorModern","isConstructorLegacy","called","$RegExp","MISSED_STICKY","BROKEN_CARET","re1","re2","regexpFlags","UNSUPPORTED_DOT_ALL","UNSUPPORTED_NCG","nativeExec","patchedExec","UPDATES_LAST_INDEX_WRONG","NPCG_INCLUDED","reCopy","group","raw","charsAdded","strCopy","input","$expm1","MATCH","nativeMatch","matcher","matchStr","createHTML","forcedStringHTMLMethod","propertyIsEnumerable","arraySpeciesConstructor","originalArray","CORRECT_PROTOTYPE_GETTER","getPrototypeOf","Wrapper","NewTarget","NewTargetPrototype","aPossiblePrototype","CORRECT_SETTER","__proto__","dotAll","CONSTRUCTOR_NAME","KEY","SHAM","SYMBOL","DELEGATES_TO_SYMBOL","uncurriedNativeRegExpMethod","methods","nativeMethod","arg2","forceStringMethod","uncurriedNativeMethod","$exec","UNSCOPABLES","ArrayPrototype","FunctionName","createIteratorConstructor","IteratorsCore","IteratorPrototype","BUGGY_SAFARI_ITERATORS","returnThis","Iterable","NAME","IteratorConstructor","DEFAULT","IS_SET","CurrentIteratorPrototype","getIterationMethod","KIND","defaultIterator","IterablePrototype","INCORRECT_VALUES_NAME","nativeIterator","anyNativeIterator","entries","isArrayIteratorMethod","getIterator","getIteratorMethod","iteratorClose","Result","stopped","ResultPrototype","unboundFunction","iterFn","step","AS_ENTRIES","IS_ITERATOR","INTERRUPTED","stop","condition","callFn","Prototype","SAFE_CLOSING","iteratorWithReturn","SKIP_CLOSING","ITERATION_SUPPORT","FAILS_ON_PRIMITIVES","ownKeys","getOwnPropertyDescriptors","notOk","undef","_types","anyType","_ignore","_conversions","typed","types","conversions","ignore","findTypeByName","typeName","entry","findInArray","findTypeIndex","findTypeName","stringifyParams","params","param","typeNames","getTypeName","restParam","parseParam","notEmpty","notIgnore","matchingConversions","matches","conversion","filterConversions","exactTypes","typeIndex","conversionIndex","convertibleTypes","hasRestParam","last","hasConversions","compileTest","test0","test1","tests","compileTests","varIndex","lastTest","testRestParam","getParamAtIndex","signature","getExpectedTypeNames","excludeConversions","isExactType","mergeExpectedParams","signatures","uniq","flatMap","createError","err","expected","_name","matchingSignatures","nextMatchingDefs","actualType","category","actual","lengths","maxLength","expectedLength","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","compareSignatures","signature1","signature2","compileArgConversion","conversion0","conversion1","convert","splitParams","ignoreConversionTypes","_splitParams","typeGroups","filteredTypes","typeGroup","createTypedFunction","signaturesMap","parsedSignatures","parsedParam","isInvalidParam","parseSignature","notNull","parsedSignature","conflictingSignature","ii","hasOverlap","len1","len2","restParam1","restParam2","hasConflictingParams","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","fns","fnConvert","compiledConversions","fnPreprocess","compileArgsPreprocessing","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","generic","onMismatch","arg0","arg1","createSignaturesMap","_onMismatch","array1","array2","item","callback","getName","extractSignatures","validateUnique","_signature","_fn","throwMismatchError","addType","beforeObjectTest","addConversion","alea","xor128","xorwow","xorshift7","xor4096","tychei","sr","NASHORN_BUG","1","ordinaryToPrimitive","pref","exoticToPrim","exceptions","CSSRuleList","CSSStyleDeclaration","CSSValueList","ClientRectList","DOMRectList","DOMStringList","DOMTokenList","DataTransferItemList","FileList","HTMLAllCollection","HTMLCollection","HTMLFormElement","HTMLSelectElement","MediaList","MimeTypeArray","NamedNodeMap","NodeList","PaintRequestList","Plugin","PluginArray","SVGLengthList","SVGNumberList","SVGPathSegList","SVGPointList","SVGStringList","SVGTransformList","SourceBufferList","StyleSheetList","TextTrackCueList","TextTrackList","TouchList","classList","nativeGetPrototypeOf","NativeRegExp","IS_NCG","CORRECT_NEW","BASE_FORCED","RegExpWrapper","pattern","rawFlags","handled","thisIsRegExp","patternIsRegExp","flagsAreUndefined","rawPattern","named","brackets","ncg","groupid","groupname","handleNCG","handleDotAll","proxy","props","aConstructor","defaultConstructor","CONVERT_TO_STRING","pos","second","size","codeAt","log1p","whitespaces","whitespace","ltrim","rtrim","$repeat","RangeError","repeat","un$ToFixed","acc","multiply","c2","dataToString","fractionDigits","fractDigits","count","PrototypeOfArrayIteratorPrototype","arrayIterator","collection","init","InternalMetadataModule","common","IS_WEAK","ADDER","NativeConstructor","NativePrototype","exported","fixMethod","getConstructor","enable","instance","HASNT_CHAINING","THROWS_ON_PRIMITIVES","ACCEPT_ITERABLES","BUGGY_ZERO","$instance","clear","setStrong","getOwnPropertyNamesExternalModule","isExtensible","FREEZING","REQUIRED","METADATA","setMetadata","objectID","weakData","meta","fastKey","getWeakData","onFreeze","windowNames","getWindowNames","usingIterator","iteratorMethod","innerResult","innerError","internalStateGetterFor","previous","getEntry","removed","ITERATOR_NAME","getInternalCollectionState","getInternalIteratorState","path","location","defer","channel","port","validateArgumentsLength","IS_IOS","setImmediate","clearImmediate","Dispatch","MessageChannel","queue","run","runner","listener","post","postMessage","protocol","host","nextTick","now","port2","port1","onmessage","addEventListener","importScripts","removeChild","setTimeout","PromiseCapability","$$resolve","$$reject","arrayLikeToArray","minLen","arr2","on","ctx","once","off","evtArr","evts","liveEvents","TinyEmitter","_defineProperties","protoProps","staticProps","defaultEscapes","formatEscapes","defaultEscapeMapFn","_ref","_ref$preserveFormatti","preserveFormatting","_ref$escapeMapFn","escapeMapFn","runningStr","escapes","escapeKeys","_loop","specialCharFound","g","val","IS_INCLUDES","el","fromIndex","includes","mergeSort","middle","insertionSort","merge","element","left","right","llength","rlength","lindex","rindex","firefox","UA","webkit","LOG10E","SUBSTITUTION_SYMBOLS","SUBSTITUTION_SYMBOLS_NO_NAMED","tailPos","symbols","ch","capture","EPSILON","$acosh","MAX_VALUE","$asinh","$atanh","$cosh","quot","attribute","ENUMERABLE_NEXT","ARRAY_BUFFER_NON_EXTENSIBLE","$isExtensible","ArrayBuffer","buffer","preventExtensions","callWithSafeIterationClosing","arrayLike","IS_CONSTRUCTOR","mapfn","mapping","ENTRIES","passed","required","flush","head","toggle","node","macrotask","IS_IOS_PEBBLE","IS_WEBOS_WEBKIT","MutationObserver","WebKitMutationObserver","queueMicrotaskDescriptor","queueMicrotask","createTextNode","observe","characterData","Pebble","promiseCapability","console","tail","runtime","Op","iteratorSymbol","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","context","Context","_invoke","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","record","tryCatch","makeInvokeMethod","GeneratorFunction","GeneratorFunctionPrototype","getProto","NativeIteratorPrototype","Gp","defineIteratorMethods","AsyncIterator","PromiseImpl","previousPromise","callInvokeWithMethodAndArg","invoke","__await","unwrapped","info","resultName","nextLoc","pushTryEntry","locs","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","reset","displayName","isGeneratorFunction","genFun","ctor","mark","awrap","async","iter","skipTempReset","rootRecord","rval","exception","handle","loc","caught","hasCatch","hasFinally","finallyEntry","complete","finish","thrown","delegateYield","regeneratorRuntime","accidentalStrictMode","$trim","forcedStringTrimMethod","_i","_s","_e","_arr","_n","_d","fill","endPos","Alea","seed","me","mash","h","s0","s1","s2","impl","opts","xg","prng","int32","double","quick","XorGen","strseed","X","pool","math","nodecrypto","startdenom","significance","overflow","seedrandom","shortseed","mixkey","flatten","depth","prop","typ","entropy","tostring","Uint8Array","msCrypto","browser","navigator","plugins","screen","autoseed","arc4","ARC4","pass","is_math_call","keylen","width","smear","stringseed","ex","isNumber","isBigNumber","isComplex","isFraction","isUnit","isString","isMatrix","isCollection","isDenseMatrix","isSparseMatrix","isRange","isIndex","isBoolean","isResultSet","isHelp","isFunction","isDate","isNull","isUndefined","isAccessorNode","isNode","isArrayNode","isAssignmentNode","isBlockNode","isConditionalNode","isConstantNode","isFunctionAssignmentNode","isFunctionNode","isIndexNode","isObjectNode","isOperatorNode","isParenthesisNode","isRangeNode","isSymbolNode","isChain","typeOf","negate","formatNumberToBase","prefix","2","8","16","suffix","format","wordSize","notation","rounded","roundDigits","splitNumber","exponent","coefficients","newExp","missingZeros","expDiff","decimalIdx","decimals","decimalVal","toEngineering","lowerExp","upperExp","zeros","dot","splitValue","pp","DBL_EPSILON","nearlyEqual","epsilon","diff","formatBigNumberToBase","big2","BigNumberCtor","valueWithoutExp","valueStr","endsWith","text","formatNumber","formatBigNumber","looksLikeFraction","fraction","formatArray","syntax","_format","escaped","escape","compareText","DimensionError","relation","message","stack","IndexError","arraySize","validate","_validate","dim","dimNext","child","validateIndex","resize","defaultValue","_resize","elem","oldLen","newLen","reshape","sizes","flatArray","currentLength","newLength","product","processSizesWildcard","tmpArray2","tmpArray","sizeIndex","_reshape","processedSizes","wildCardIndex","reduce","curr","squeeze","dims","_squeeze","unsqueeze","outer","_unsqueeze","flat","filterRegExp","identify","identifier","generalize","getArrayDataType","itemType","contains","mapObject","extend","deepStrictEqual","deepFlatten","nestedObject","flattenedObject","_deepFlatten","lazy","valueResolver","_value","_uninitialized","dependencies","assertAndCreate","scope","deps","pickShallow","stripOptionalNotation","dependency","isOptionalDependency","missingDependencies","assertDependencies","isFactory","isDimensionError","isIndexError","getSafeProperty","isPlainObject","isSafeProperty","isSafeMethod","setSafeProperty","safeNativeProperties","safeNativeMethods","toLocaleString","ObjectWrappingMap","wrappedObject","createEmptyMap","Map","createMap","mapOrObject","isMap","objects","_createTyped","typedFunction","createTyped","BigNumber","DenseMatrix","throwNoBignumber","throwNoComplex","throwNoFraction","throwNoMatrix","matrix","createResultSet","ResultSet","mathjs","fromJSON","json","isClass","createBigNumberClass","createComplexClass","toPolar","phi","strRe","strIm","fromPolar","hasBase","createFractionClass","createRangeClass","Range","hasStart","hasEnd","hasStep","nums","toArray","createMatrixClass","Matrix","storage","datatype","subset","skipZeros","createDenseMatrixClass","_data","_size","_datatype","preprocess","_get","isScalar","_getSubmatrix","range","dimension","_set","submatrix","sSize","iSize","_fit","_setSubmatrix","dataIndex","subIndex","newSize","changed","createDenseMatrix","getDataType","indexI","sizeArray","recurse","rows","row","columns","col","diagonal","kSuper","kSub","ms","swapRows","_swapRows","vi","createClone","any","objectClone","_switch","mat","I","J","containsCollections","deepForEach","deepMap","_reduce","tran","scatter","cindex","inverse","update","k0","k1","avalues","_values","aindex","_index","aptr","_ptr","createIsInteger","isIntegerNumber","isNegativeNumber","isPositiveNumber","isZeroNumber","isNaNNumber","createIsNegative","Unit","createIsNumeric","createHasNumericValue","isNumeric","createIsPositive","createIsZero","createIsNaN","createTypeOf","_typeOf","createEqualScalar","bigNearlyEqual","complexEquals","equalBase","createSparseMatrixClass","equalScalar","SparseMatrix","_createFromArray","_createFromMatrix","ptr","zero","_getsubset","idx","kk","mvalues","mindex","mptr","pv","_setsubset","firstDimensionRange","secondDimensionRange","firstDataIndex","firstSubIndex","secondDataIndex","secondSubIndex","_getValueIndex","top","bottom","_insert","ins","_toArray","createSparseMatrix","density","_remove","colIndex","rowIndex","r1","c1","minRow","maxRow","minColumn","maxColumn","_map","_forEachRow","kx","ky","vx","vy","createNumber","nonDecimalWithRadixMatch","nonDecimalNumberParts","integerPart","fractionalPart","parts","makeNumberFromNonDecimalParts","wordSizeSuffixMatch","null","unit","valuelessUnit","createString","boolean","createBoolean","lcase","createBignumber","twoPowSize","twoPowSizeSubOne","createComplex","ZERO","createFraction","createMatrix","_create","JSON","createMatrixFromFunction","createMatrixFromRows","_createArray","checkVectorTypeAndReturnLength","rowLength","vec","createMatrixFromColumns","colLength","createSplitUnit","splitUnit","n2","absNumber","addNumber","multiplyNumber","unaryMinusNumber","unaryPlusNumber","cbrtNumber","ceilNumber","cubeNumber","expNumber","expm1Number","gcdNumber","lcmNumber","log10Number","log2Number","modNumber","nthRootNumber","inv","signNumber","squareNumber","xgcdNumber","lastx","lasty","powNumber","roundNumber","createUnaryMinus","createUnaryPlus","createAbs","createApply","_apply","createAddScalar","fixPrefix","createCbrt","unaryMinus","_cbrtComplex","allRoots","arg3","principal","createAlgorithm11","asize","adt","dt","cf","cvalues","cptr","createAlgorithm14","adata","cdata","_iterate","level","av","bv","cv","createCeil","algorithm11","algorithm14","createCube","createExp","createExpm1","createFix","createFloor","createAlgorithm01","denseMatrix","sparseMatrix","bvalues","bindex","bptr","bsize","bdt","createAlgorithm04","xa","xb","wa","wb","createAlgorithm10","createAlgorithm13","bdata","csize","createGcd","algorithm01","algorithm04","algorithm10","algorithm13","createAlgorithm02","cij","createAlgorithm06","createLcm","algorithm02","algorithm06","lcm","createLog10","predictable","createLog2","_log2Complex","newX","createAlgorithm03","createAlgorithm05","wai","wbi","vc","createAlgorithm12","createMod","algorithm03","algorithm05","algorithm12","createMultiplyScalar","_normalize","createMultiply","addScalar","multiplyScalar","_validateMatrixDimensions","size1","size2","_multiplyVectorMatrix","alength","bcolumns","af","mf","_multiplyVectorDenseMatrix","_multiplyMatrixVector","arows","acolumns","brows","ib","vbi","ka0","ka1","ka","ia","ic","_multiplyMatrixMatrix","jb","kb0","kb1","kb","vbij","p0","xsize","ysize","_multiplyVectorVector","rest","createNthRoot","complexErr","_bigNthRoot","Big","createSign","complex","_isDerived","units","createSqrt","_sqrtNumber","createSquare","createSubtract","checkEqualDimensions","createXgcd","createInvmod","xgcd","equal","smaller","invmod","createAlgorithm09","vb","createDotMultiply","algorithm09","bitAndBigNumber","bitwise","bitNotBigNumber","prevPrec","bitOrBigNumber","negOne","xBits","yBits","minBits","maxBits","minSign","xSign","ySign","decCoefficientToBinaryString","shortLen","longLen","expFuncVal","outVal","twoPower","two","bitXor","leftShiftBigNumber","rightArithShiftBigNumber","bitAndNumber","bitNotNumber","bitOrNumber","bitXorNumber","leftShiftNumber","rightArithShiftNumber","rightLogShiftNumber","createBitAnd","createBitNot","createBitOr","createAlgorithm07","_scatter","va","createBitXor","algorithm07","bigBitXor","createArg","createConj","conjugate","createIm","createRe","notNumber","orNumber","xorNumber","andNumber","createNot","createOr","createXor","createConcat","prevDim","asMatrix","matrices","_concat","concatDim","createColumn","Index","_column","column","rowRange","createCount","createCross","_cross","highestDimension","xSize","ySize","createDiag","_diag","_createDiagonalMatrix","dm","vector","_getDiagonal","lruQueue","del","oldIndex","hit","nuIndex","delete","memoize","hasher","POSITIVE_INFINITY","cache","lru","hash","newVal","maxArgumentCount","createFilter","_filterCallback","createFlatten","flattenArray","createForEach","_forEach","forEachArray","createGetMatrixDataType","createIdentity","_identity","cols","_identityVector","minimum","createKron","_kron","newmsg","indexString","createDiff","_diff","_recursive","_ElementDiff","obj1","obj2","obj1IsArray","obj2IsArray","arr1","_ArrayDiff","createOnes","_ones","hasBigNumbers","noBignumber","noFraction","noMatrix","createRange","bignumber","smallerEq","larger","largerEq","_strRange","_out","_rangeEx","includeEnd","_rangeInc","_bigRangeEx","_bigRangeInc","_parse","createReshape","arrayReshape","ArgumentsError","isArgumentsError","createResize","_resizeString","arrayResize","defaultChar","createRotate","rotationMatrix","theta","_validateSize","expectedSize","actualSize","createRotationMatrix","norm","_rotationMatrix2x2","matrixV","_validateVector","_rotationMatrix3x3","storageType","minusOne","cosTheta","sinTheta","_convertToFormat","_mul","normV","vz","oneMinusC","createRow","_row","columnRange","createSize","createSqueeze","arraySqueeze","createSubset","_getObjectProperty","_getSubstring","_setSubstring","_setObjectProperty","strLen","substr","chars","updated","createTranspose","transposedRow","transposed","_denseTranspose","_sparseTranspose","createCtranspose","transpose","conj","createZeros","_zeros","createErf","MAX_NUM","THRESH","ysq","xnum","xden","Q","erf1","erfc2","SQRPI","erfc3","createMode","_mode","improveErrorMessage","fnName","details","createProd","numeric","_prod","createFormat","formatString","createBin","createOct","createHex","createPrint","_print","template","original","createTo","createIsPrime","modPow","modulus","accumulator","bases","adn","createNumeric","validInputTypes","validOutputTypes","outputType","inputType","createDivideScalar","createPow","identity","_pow","_powArray","_powMatrix","yFrac","yNum","NO_INT","createRound","roundNumberSignatures","createLog","divideScalar","logNumber","createLog1p","_log1p","_log1pComplex","xRe1p","createNthRoots","_calculateExactResult","_nthComplexRoots","aIsNumeric","roots","halfPiFactor","createDotPow","createDotDivide","createSolveValidation","mSize","bSize","createLsolve","solveValidation","bj","vjj","jValues","jIndices","firstIndex","xj","_sparseForwardSubstitution","_denseForwardSubstitution","mdata","createUsolve","_sparseBackwardSubstitution","_denseBackwardSubstitution","createLsolveAll","b_","L","iValues","iIndices","Mii","bNew","createUsolveAll","createAlgorithm08","createLeftShift","algorithm08","createRightArithShift","createRightLogShift","createAnd","not","createCompare","createCompareNatural","compareBooleans","typeX","typeY","compareMatricesAndArrays","compareNatural","compareArrays","compareComplexNumbers","formatUnits","keysX","keysY","compareObjects","createCompareText","_compareText","createEqual","createEqualText","createSmaller","createSmallerEq","createLarger","createLargerEq","createDeepEqual","_deepEqual","createUnequal","_unequal","createPartitionSelect","asc","_partitionSelect","quickSelect","pivot","createSort","compareAsc","compareDesc","_arrayIsVector","_matrixIsVector","_comparator","order","createMax","_max","_largest","createMin","_min","_smallest","createImmutableDenseMatrixClass","ImmutableDenseMatrix","isImmutableDenseMatrix","createIndexClass","ranges","_dimensions","_isScalar","_createImmutableMatrix","isObjectProperty","getObjectProperty","strings","dimensions","createFibonacciHeapClass","oneOverLogPhi","FibonacciHeap","_minimum","_cut","degree","isFibonacciHeap","insert","isEmpty","extractMinimum","numberOfChildren","tempRight","numRoots","_linkNodes","_findMinimumNode","remove","_cascadingCut","_decreaseKey","createSpaClass","Spa","_heap","isSpa","accumulate","heap","nodes","swap","nodei","nodej","createBigNumberE","createBigNumberPhi","createBigNumberPi","createBigNumberTau","createUnitClass","UNIT_NONE","PREFIXES","NONE","power","BASE_DIMENSIONS","skipAutomaticSimplification","skipWhitespace","isDigit","revert","parseNumber","isDigitDot","tentativeNumber","tentativeIndex","parseUnit","unitName","isValidAlpha","firstC","parseCharacter","toFind","powerMultiplierCurrent","expectingUnit","powerMultiplierStack","powerMultiplierStackProduct","uStr","oldC","_findUnit","baseDim","UNIT_SYSTEMS","auto","allowNoUnits","_getNumberConverter","unitValue","unitPrefixValue","unitPower","_denormalize","prefixValue","UNITS","prefixes","prefixLen","prefixName","getNumericIfUnitless","BASE_UNITS","isValuelessUnit","other","inverted","valThis","valOther","nominalOffset","unitOffset","W","thisUnitValue","thisNominalOffset","thisUnitOffset","otherUnitValue","otherNominalOffset","otherUnitOffset","simplify","matchingBase","matchingUnit","proposedUnitList","currentUnitSystem","missingBaseDim","toSI","si","strNum","strDen","nNum","nDen","simp","isImaginary","VAR","VA","_bestPrefix","unitStr","absValue","absUnitValue","bestPrefix","bestDiff","scientific","xNumeric","xRounded","testSum","SHORT","da","G","T","Z","Y","LONG","deca","hecto","kilo","mega","giga","tera","peta","exa","zetta","yotta","deci","centi","milli","micro","nano","pico","femto","atto","zepto","yocto","SQUARED","CUBIC","BINARY_SHORT_SI","BINARY_SHORT_IEC","Ki","Mi","Gi","Ti","Pi","Ei","Zi","Yi","BINARY_LONG_SI","BINARY_LONG_IEC","kibi","mebi","gibi","tebi","pebi","exi","zebi","yobi","BTU","MM","SHORTLONG","BINARY_SHORT","BINARY_LONG","MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","FORCE","SURFACE","VOLUME","ENERGY","POWER","PRESSURE","ELECTRIC_CHARGE","ELECTRIC_CAPACITANCE","ELECTRIC_POTENTIAL","ELECTRIC_RESISTANCE","ELECTRIC_INDUCTANCE","ELECTRIC_CONDUCTANCE","MAGNETIC_FLUX","MAGNETIC_FLUX_DENSITY","FREQUENCY","ANGLE","BIT","meter","inch","foot","yard","mile","link","rod","chain","angstrom","in","ft","mi","li","mil","m2","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","acre","hectare","m3","litre","cuin","cuft","cuyd","teaspoon","tablespoon","drop","gtt","minim","fluiddram","fluidounce","gill","cc","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","fldr","floz","gi","cp","pt","qt","gal","bbl","obl","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","stone","gr","dr","oz","lbm","cwt","sec","minute","hour","day","week","month","year","decade","century","millennium","hertz","reciprocal","Hz","rad","radian","deg","grad","gradian","cycle","arcsec","arcmin","ampere","K","degC","degF","degR","kelvin","celsius","fahrenheit","rankine","mol","mole","cd","candela","newton","dyn","dyne","lbf","poundforce","kip","kilogramforce","joule","erg","Wh","eV","electronvolt","watt","hp","Pa","psi","atm","bar","torr","mmHg","mmH2O","cmH2O","coulomb","farad","volt","ohm","henry","H","siemens","weber","Wb","tesla","bits","bytes","ALIASES","meters","inches","feet","yards","miles","links","rods","chains","angstroms","litres","liter","liters","teaspoons","tablespoons","minims","fluiddrams","fluidounces","gills","cups","pints","quarts","gallons","beerbarrels","oilbarrels","hogsheads","gtts","grams","tons","tonnes","grains","drams","ounces","poundmasses","hundredweights","sticks","lb","lbs","kips","kgf","acres","hectares","sqfeet","sqyard","sqmile","sqmiles","mmhg","mmh2o","cmh2o","seconds","secs","minutes","mins","hours","hr","hrs","days","weeks","months","years","decades","centuries","millennia","radians","degrees","gradians","cycles","arcsecond","arcseconds","arcminute","arcminutes","BTUs","watts","joules","amperes","coulombs","volts","ohms","farads","webers","teslas","electronvolts","moles","bit","byte","calculateAngleValues","createPi","cgs","us","setUnitSystem","getUnitSystem","typeConverters","alias","createUnit","override","deleteUnit","aliases","lastUnit","createUnitSingle","assertUnitNameIsValid","definition","baseName","defUnit","toUpperCase","newUnit","anyMatch","newBaseUnit","aliasName","createUnitFunction","createSparse","createCreateUnit","def","createAcos","acoshNumber","acotNumber","acothNumber","acscNumber","acschNumber","xInv","asecNumber","asechNumber","asinhNumber","atanhNumber","cotNumber","cothNumber","cscNumber","cschNumber","secNumber","sechNumber","sinhNumber","createAcosh","createAcot","acot","createAcoth","acoth","createAcsc","acsc","createAcsch","acsch","createAsec","asec","createAsech","asech","createAsin","createAsinh","createAtan","createAtan2","createAtanh","createCos","createCosh","coshNumber","createCot","cot","createCoth","coth","createCsc","csc","createCsch","csch","createSec","createSech","sech","createSin","createSinh","createTan","createTanh","_tanh","createSetCartesian","a1","a2","b1","b2","createSetDifference","inb2","createSetDistinct","createSetIntersect","createSetIsSubset","createSetMultiplicity","createSetPowerset","_subset","_sort","bitarray","createSetSize","unique","createSetSymDifference","setDifference","createSetUnion","setIntersect","setSymDifference","createAdd","createHypot","largest","createNorm","ctranspose","eigs","_norm","_vectorNorm","pinf","_vectorNormPlusInfinity","NEGATIVE_INFINITY","ninf","_vectorNormMinusInfinity","_matrixNorm","maxc","cj","_matrixNormOne","maxr","ri","_matrixNormInfinity","fro","_matrixNormFrobenius","sizeX","tx","squaredX","eigenVals","rho","_matrixNormTwo","createDot","_validateDim","aIsColumn","bIsColumn","xindex","xvalues","yindex","yvalues","xLen","yLen","createTrace","_denseTrace","createIndex","keywords","Set","createNode","mathWithTransform","Node","evaluate","compile","comment","expr","_compile","_validateScope","argNames","_ifNode","traverse","_traverse","transform","_transform","cloneDeep","customString","_getCustomString","_toString","toHTML","toTex","_toTex","getIdentifier","getContent","errorTransform","accessFactory","createAccessorNode","access","AccessorNode","needParenthesis","evalObject","evalIndex","createArrayNode","ArrayNode","evalItems","evalItem","itemsToTex","nested","mixedItems","itemsFormRow","itemSep","itemsTex","AssignmentNode","FunctionAssignmentNode","ConditionalNode","latexLeftParens","latexRightParens","latexParens","associativity","associativeWith","RelationalNode","RangeNode","getPrecedence","_node","parenthesis","getAssociativity","isAssociativeWith","nodeA","nodeB","identifierA","identifierB","createAssignmentNode","assignFactory","precedence","exprPrecedence","evalValue","childObject","evalParentObject","parentProp","evalParentIndex","parentIndex","createBlockNode","BlockNode","blocks","block","visible","evalBlocks","createConditionalNode","trueExpr","falseExpr","evalCondition","evalTrueExpr","evalFalseExpr","testCondition","conditionPrecedence","truePrecedence","falsePrecedence","latexSymbols","Alpha","alpha","Beta","beta","Gamma","gamma","Delta","delta","Epsilon","varepsilon","Zeta","zeta","Eta","eta","Theta","vartheta","Iota","iota","Kappa","kappa","varkappa","Lambda","lambda","Mu","mu","Nu","nu","Xi","Omicron","omicron","varpi","Rho","varrho","Sigma","sigma","varsigma","Tau","tau","Upsilon","upsilon","Phi","varphi","Chi","chi","Psi","Omega","omega","true","false","Inf","infinity","oo","latexOperators","factorial","dotPow","unaryPlus","bitNot","dotMultiply","dotDivide","leftShift","rightArithShift","rightLogShift","unequal","bitAnd","bitOr","and","xor","or","latexFunctions","cube","nthRoot","nthRoots","square","bellNumbers","catalan","stirlingS2","cross","det","expm","sqrtm","trace","combinations","combinationsWithRep","erf","variance","0","sparse","latexUnits","escapeLatex","escapeLatexLib","toSymbol","createConstantNode","ConstantNode","toLatex","createFunctionAssignmentNode","childArgNames","evalExpr","childArgs","createIndexNode","IndexNode","dotNotation","evalDimensions","needsEnd","evalStart","evalEnd","evalStep","evalRange","evalDimension","createObjectNode","ObjectNode","evalEntries","stringifiedKey","parsedKey","createOperatorNode","OperatorNode","op","implicit","isPercentage","calculateNecessaryParentheses","latex","operandPrecedence","operandIdentifier","rootIdentifier","lhsParens","rhsParens","lhsPrecedence","assocWithLhs","lhsIdentifier","rhsIdentifier","rhsPrecedence","assocWithRhs","argPrecedence","assocWithArg","argAssociativity","evalArgs","evalArg0","evalArg1","evalArg","isUnary","parens","assoc","operand","opIsNamed","lhs","rhs","stringifiedArgs","lhsTex","rhsTex","texifiedArgs","createParenthesisNode","ParenthesisNode","createRangeNode","startPrecedence","stepPrecedence","endPrecedence","createRelationalNode","conditionals","isRelationalNode","compiled","evalLhs","evalRhs","condFn","paramStrings","paramPrecedence","operatorMap","createSymbolNode","SymbolNode","onUndefinedSymbol","createSubScope","parentScope","createFunctionNode","FunctionNode","strin","entity","rawArgs","validateSafeMethod","fnExpr","evalFn","isRaw","resolveFn","onUndefinedFunction","nodeToString","expandTemplate","regex","inputPos","ReferenceError","nodeToTex","customTex","latexConverter","customToTex","createParse","expression","parseStart","expressions","parseMultiple","extraNodes","TOKENTYPE","DELIMITERS","'","NAMED_DELIMITERS","CONSTANTS","NUMERIC_CONSTANTS","currentString","currentCharacter","prevCharacter","nextCharacter","getToken","tokenType","token","isWhitespace","nestingLevel","c3","isHexDigit","isDecimalMark","createSyntaxError","isAlpha","getTokenSkipNewline","openParams","closeParams","conditionalLevel","parseAssignment","parseBlock","valid","parseLogicalXor","parseLogicalOr","parseConditional","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","parseShift","operators","cond","parseConversion","parseRange","parseAddSubtract","parseMultiplyDivide","rightNode","parseImplicitMultiplication","parseRule2","parsePercentage","tokenStates","parseUnary","CustomNode","parseAccessors","parseDoubleQuotesStringToken","parseSingleQuotesStringToken","parseRow","numberStr","parseEnd","parseParentheses","parseObject","parseMatrix","parseSingleQuotesString","parseDoubleQuotesString","parseSymbol","parseCustomNodes","parseLeftHandOperators","parsePow","char","cPrev","cNext","isValidLatinOrGreek","isValidMathSymbol","high","createCompile","createEvaluate","createParserClass","Parser","isParser","getAll","getAllAsMap","createParser","createLup","_denseLUP","_sparseLUP","U","ldata","lsize","udata","usize","pabsv","absv","vij","lvalues","lptr","uvalues","uindex","uptr","pvCo","pvOc","spa","vkj","vik","createQr","_denseQR","_sparseQR","_denseQRimpl","Qdata","Rdata","sgn","conjSgn","alphaSquared","u1","csTdfs","csFlip","createCsAmd","lemax","dense","cm","at","tindex","tptr","_createTargetMatrix","nz","csFkeep","k2","pj","nvi","pk","eln","pn","cnz","nv","elen","hhead","_wclear","_initializeQuotientGraph","nel","_initializeDegreeLists","mindeg","elenk","nvk","dk","pk1","pk2","wnvi","dext","p3","p4","nvj","jlast","csLeaf","maxfirst","prevleaf","ancestor","sparent","jleaf","jprev","createCsCounts","ata","colcount","createCsSqr","csAmd","csCounts","qr","pinv","t0","csPermute","inext","csEtree","csPost","leftmost","nque","lnz","pa","_vcount","unz","csMarked","csMark","csUnflip","csDfs","jnew","createCsSpsolve","lo","gvalues","gindex","gptr","gsize","csReach","createCsLu","csSpsolve","tol","ipiv","xabs","createSlu","csSqr","csLu","threshold","csIpvec","createLusolve","lup","slu","usolve","lsolve","_lusolve","_toMatrix","createHelpClass","Help","doc","examples","mayThrow","seealso","createChainClass","Chain","createLazyProxy","resolver","chainify","createProxy","excludedNames","docs","classes","eDocs","piDocs","embeddedDocs","LOG2E","SQRT1_2","SQRT2","speedOfLight","gravitationConstant","planckConstant","reducedPlanckConstant","magneticConstant","electricConstant","vacuumImpedance","elementaryCharge","bohrMagneton","conductanceQuantum","inverseConductanceQuantum","magneticFluxQuantum","nuclearMagneton","klitzing","bohrRadius","classicalElectronRadius","electronMass","fermiCoupling","fineStructure","hartreeEnergy","protonMass","deuteronMass","neutronMass","quantumOfCirculation","rydberg","thomsonCrossSection","weakMixingAngle","efimovFactor","atomicMass","avogadro","boltzmann","faraday","firstRadiation","loschmidt","gasConstant","molarPlanckConstant","molarVolume","sackurTetrode","secondRadiation","stefanBoltzmann","wienDisplacement","molarMass","molarMassC12","gravity","planckLength","planckMass","planckTime","planckCharge","planckTemperature","derivative","lsolveAll","lusolve","leafCount","simplifyCore","symbolicEqual","rationalize","usolveAll","composition","import","help","distance","intersect","diag","getMatrixDataType","kron","matrixFromFunction","matrixFromRows","matrixFromColumns","ones","partitionSelect","rotate","kldivergence","multinomial","permutations","pickRandom","randomInt","deepEqual","equalText","setCartesian","setDistinct","setIsSubset","setMultiplicity","setPowerset","setSize","setUnion","cumsum","mad","mean","median","quantileSeq","std","bin","oct","hex","hasNumericValue","isPrime","print","createHelp","searchName","searchText","createChain","createDet","decomp","evenCycles","visited","_det","createInv","_inv","ABig","rBig","Ac","Bc","Ar","Br","createComplexEigs","jordanBase2x2","l1","l2","prec","big","cplx","na","nb","nc","nd","inflateMatrix","inverseIterate","orthog","largeNum","randomOrthogonalVector","orthogonalComplement","findVectors","Rdiag","realzero","realone","radixSq","colNorm","rowNorm","rowDivRadix","rowMulRadix","balance","maxIndex","tmp1","tmp2","tmp3","reduceToHessenberg","vectors","lambdas","Sdiag","Qtotal","Qpartial","lastConvergenceBefore","ll","trA","detA","blockDiag","iterateUntilTriangular","Cinv","uniqueValues","multiplicities","λ","failedLambdas","solutions","approxVec","correction","findEigenvectors","createEigs","doRealSymetric","e0","Sij","createArray","Vab","getAij","getTheta","Sij1","sorting","diagBig","getAijBig","x1Big","getThetaBig","Sij1Big","aii","ajj","aij","denom","Ski","Skj","Hij","Aki","Akj","csHij","Aii","Ajj","Mij","maxMij","maxIJ","minID","createRealSymmetric","doComplexEigs","computeValuesAndVectors","isReal","coerceReal","isSymmetric","coerceTypes","hasNumber","hasBig","hasComplex","warn","createExpm","infNorm","errorEstimate","findParams","rowSum","infinityNorm","Apos","factor","AposToI","alternate","qfac","twoqfac","twoqp1fac","createSqrtm","_denmanBeavers","iterations","Yk","createDivide","createDistance","_2d","xCoeff","yCoeff","constant","_distancePointLine2D","lineTwoPtY","lineTwoPtX","lineOnePtY","lineOnePtX","pointX","pointY","_3d","_parametricLine","_distancePointLine3D","_containsOnlyNumbers","_euclideanDistance","xCoeffLine","yCoeffLine","pointZ","x0","y0","z0","pointOneX","pointOneY","pointTwoX","pointTwoY","pointOneZ","pointTwoZ","_isNumber","aI","_pairwise","pointA","pointB","_distancePairwise","_objectToArray","den","vectorSize","createIntersect","_AAA","_AAAA","plane","_coerceArr","_4d","y1","z1","y2","z2","x1x","x2x","y1y","y2y","z1z","z2z","py","pz","_intersectLinePlane","p1a","p1b","p2a","p2b","o1","o2","d20o11","d21o10","d20o21","d21o20","_intersect2d","x3","y3","z3","x4","y4","z4","d1343","_intersect3dHelper","d4321","d1321","d4343","d2121","ta","tb","pax","pay","paz","pbx","pby","pbz","_intersect3d","add1","add2","add3","createSum","_sum","createCumSum","_cumsum","_ncumSumDim","_cumsummap","sums","_cumsumDimensional","initialValue","createMean","_mean","createMedian","_median","mid","middle2","createMad","_mad","med","createVariance","_var","_varDim","normalization","createQuantileSeq","_quantileSeq","prob","sorted","fracPart","integerPartNumber","probOrN","probArr","dataArr","nPlusOne","intN","currProb","createStd","_std","half","combinationsNumber","nMinusk","answer","nextdivisor","lastdivisor","nextnumerator","createCombinations","isPositiveInteger","createCombinationsWithRep","nMinusOne","gammaNumber","twoN","threeN","fourN","fiveN","gammaP","gammaG","createGamma","gammaPval","twoPiSqrt","tpow","expt","bigFactorial","createFactorial","createKldivergence","_kldiv","plength","qlength","qnorm","pnorm","createMultinomial","ai","createPermutations","singletonRandom","createRng","randomSeed","createPickRandom","rng","possibles","_pickRandom","weights","elementWise","single","totalWeights","pick","randKey","randomMatrix","createRandom","_random","_randomMatrix","createRandomInt","_randomInt","_randomIntMatrix","createStirlingS2","smallCache","bigCache","make","nn","nk","createBellNumbers","createCatalan","createComposition","createLeafCount","countLeaves","createUtil","defaultContext","trivial","total","commutative","associative","paren","defaultF","hasProperty","nodeOrName","isAssociative","allChildren","findChildren","createMakeNodeFunction","isCommutative","mergeContext","primary","secondary","merged","unflattenr","makeNode","curnode","unflattenl","realContext","positiveContext","createSimplifyConstant","simplifyConstant","_ensureNode","foldFraction","_toNumber","_eval","ignoreandcontinue","sz","section","consts","vars","foldOp","remainingDims","tryItems","fromItems","_foldAccessor","foldItems","foldProps","_removeFractions","thing","fnname","_toNode","vn","unaryMinusNode","_exactFraction","exactFractions","fractionsLimit","createSimplify","rules","debug","consoleDebug","ruleSet","rule","newRule","ruleType","_canonicalizeRule","_buildRules","removeParens","_lastsym","laststr","rulestr","applyRule","newstr","SUPPORTED_CONSTANTS","ruleObject","lr","expandsym","expanded","assuming","imposeContext","addition","mapRule","resNodes","newNode","mergedContext","newArgs","newContent","newItems","newObj","newIndex","newDims","newProps","repl","_ruleMatch","placeholders","mergeMatch","match1","match2","_exactMatch","combineChildMatches","list1","list2","i1","i2","isSplit","splits","rightArgs","getSplits","splitMatches","matchSet","childMatches","childMatch","leftMatch","rightMatch","sets","uniqueSets","mergeChildMatches","createSimplifyCore","node0","node1","simpChild","childCount","a0","a00","a00a1","a01","createResolve","within","variables","nextWithin","createSymbolicEqual","e1","e2","simplified","createDerivative","variable","constNodes","constTag","_derivative","_simplify","deriv","_derivTex","varName","isConst","funcArgsCheck","funcDerivative","negative","chainDerivative","constantTerms","nonConstantTerms","nonConstantNode","argOuter","argInner","powMinusOne","valueType","createRationalize","detailed","setRules","oldRules","rulesFirst","rulesSucDiv","firstRules","distrDivRules","sucDivRules","firstRulesAgain","finalRules","rulesRationalize","polyRet","extended","oper","recPoly","tp","retFunc","polynomial","nVars","noExactFractions","withExactFractions","sBefore","expandPower","indParent","internal","does","nEsqTopo","nDirTopo","eDistrDiv","redoInic","retRationalize","polyToCanonical","maxExpo","varname","recurPol","noPai","noFil","fire","cte","valor","no","n3","createReviver","createReplacer","createTrue","createFalse","createNull","createInfinity","recreateFactory","createNaN","createTau","createE","createPhi","createLN2","createLN10","createLOG2E","createLOG10E","createSQRT1_2","createSQRT2","createI","createUppercasePi","createUppercaseE","createVersion","recreateOnConfigChange","createSpeedOfLight","unitFactory","createGravitationConstant","createPlanckConstant","createReducedPlanckConstant","createMagneticConstant","createElectricConstant","createVacuumImpedance","createCoulomb","createElementaryCharge","createBohrMagneton","createConductanceQuantum","createInverseConductanceQuantum","createMagneticFluxQuantum","createNuclearMagneton","createKlitzing","createBohrRadius","createClassicalElectronRadius","createElectronMass","createFermiCoupling","createFineStructure","numberFactory","createHartreeEnergy","createProtonMass","createDeuteronMass","createNeutronMass","createQuantumOfCirculation","createRydberg","createThomsonCrossSection","createWeakMixingAngle","createEfimovFactor","createAtomicMass","createAvogadro","createBoltzmann","createFaraday","createFirstRadiation","createLoschmidt","createGasConstant","createMolarPlanckConstant","createMolarVolume","createSackurTetrode","createSecondRadiation","createStefanBoltzmann","createWienDisplacement","createMolarMass","createMolarMassC12","createGravity","createPlanckLength","createPlanckMass","createPlanckTime","createPlanckCharge","createPlanckTemperature","createApplyTransform","isTransformFunction","createColumnTransform","compileInlineExpression","subScope","createFilterTransform","filterTransform","_filter","createForEachTransform","forEachTransform","createIndexTransform","isSet","createMapTransform","mapTransform","orig","argsCount","lastDimToZeroBase","createMaxTransform","createMeanTransform","createMinTransform","createRangeTransform","createRowTransform","createSubsetTransform","createConcatTransform","createDiffTransform","createStdTransform","createSumTransform","createCumSumTransform","createVarianceTransform","importFactory","load","importedFactories","_import","_wrap","isTypedFunction","_importTransform","silent","allowedInExpressions","_deleteTransform","_importFactory","isTransformFunctionFactory","existingTransform","existing","factoryAllowedInExpressions","isSupportedType","functions","flattenImports","flatValues","flatName","DEFAULT_CONFIG","MATRIX_OPTIONS","NUMBER_OPTIONS","configFactory","_config","validateOption","deepExtend","changes","factories","configInternal","emitter","Emitter","internalImport"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAc,KAAID,IAElBD,EAAW,KAAIC,IARjB,CASGK,MAAM,WACT,O,YCTE,IAAIC,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUP,QAGnC,IAAIC,EAASI,EAAiBE,GAAY,CACzCC,EAAGD,EACHE,GAAG,EACHT,QAAS,IAUV,OANAU,EAAQH,GAAUI,KAAKV,EAAOD,QAASC,EAAQA,EAAOD,QAASM,GAG/DL,EAAOQ,GAAI,EAGJR,EAAOD,QA0Df,OArDAM,EAAoBM,EAAIF,EAGxBJ,EAAoBO,EAAIR,EAGxBC,EAAoBQ,EAAI,SAASd,EAASe,EAAMC,GAC3CV,EAAoBW,EAAEjB,EAASe,IAClCG,OAAOC,eAAenB,EAASe,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEV,EAAoBgB,EAAI,SAAStB,GACX,oBAAXuB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAenB,EAASuB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAenB,EAAS,aAAc,CAAEyB,OAAO,KAQvDnB,EAAoBoB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQnB,EAAoBmB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFAxB,EAAoBgB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOnB,EAAoBQ,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRvB,EAAoB2B,EAAI,SAAShC,GAChC,IAAIe,EAASf,GAAUA,EAAO2B,WAC7B,WAAwB,OAAO3B,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAK,EAAoBQ,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRV,EAAoBW,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG7B,EAAoBgC,EAAI,GAIjBhC,EAAoBA,EAAoBiC,EAAI,K,kBClFrD,IAAIC,EAAwB,EAAQ,KAChCC,EAAW,EAAQ,IACnBC,EAAW,EAAQ,KAIlBF,GACHC,EAASvB,OAAOkB,UAAW,WAAYM,EAAU,CAAEC,QAAQ,K,iBCP7D,8BACE,OAAOC,GAAMA,EAAGC,MAAQA,MAAQD,GAIlC3C,EAAOD,QAEL8C,EAA2B,iBAAdC,YAA0BA,aACvCD,EAAuB,iBAAVE,QAAsBA,SAEnCF,EAAqB,iBAARG,MAAoBA,OACjCH,EAAuB,iBAAVI,GAAsBA,IAEnC,WAAe,OAAO9C,KAAtB,IAAoC+C,SAAS,cAATA,K,kCCbtC,SAASC,EAAQC,GAGf,OAAQpD,EAAOD,QAAUoD,EAAU,mBAAqB7B,QAAU,iBAAmBA,OAAO+B,SAAW,SAAUD,GAC/G,cAAcA,GACZ,SAAUA,GACZ,OAAOA,GAAO,mBAAqB9B,QAAU8B,EAAIE,cAAgBhC,QAAU8B,IAAQ9B,OAAOa,UAAY,gBAAkBiB,GACvHpD,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,QAAUoD,EAAQC,GAG5FpD,EAAOD,QAAUoD,EAASnD,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,6BCT/F,IAAIwD,EAAI,EAAQ,GACZC,EAAO,EAAQ,IAAgCC,IAQnDF,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,QAPC,EAAQ,GAEjBC,CAA6B,QAKW,CAChEJ,IAAK,SAAaK,GAChB,OAAON,EAAKrD,KAAM2D,EAAYC,UAAUC,OAAS,EAAID,UAAU,QAAKE,O,gBCZxE,IAAIhB,EAAS,EAAQ,GACjBiB,EAAe,EAAQ,KACvBC,EAAwB,EAAQ,KAChCC,EAAU,EAAQ,KAClBC,EAA8B,EAAQ,IAEtCC,EAAkB,SAAUC,GAE9B,GAAIA,GAAuBA,EAAoBH,UAAYA,EAAS,IAClEC,EAA4BE,EAAqB,UAAWH,GAC5D,MAAOI,GACPD,EAAoBH,QAAUA,IAIlC,IAAK,IAAIK,KAAmBP,EACtBA,EAAaO,IACfH,EAAgBrB,EAAOwB,IAAoBxB,EAAOwB,GAAiBtC,WAIvEmC,EAAgBH,I,gBCrBhB,IAAIlB,EAAS,EAAQ,GACjByB,EAA2B,EAAQ,IAAmDC,EACtFN,EAA8B,EAAQ,IACtC7B,EAAW,EAAQ,IACnBoC,EAAY,EAAQ,KACpBC,EAA4B,EAAQ,KACpCC,EAAW,EAAQ,IAiBvB9E,EAAOD,QAAU,SAAUgF,EAASC,GAClC,IAGYtB,EAAQ5B,EAAKmD,EAAgBC,EAAgBC,EAHrDC,EAASL,EAAQrB,OACjB2B,EAASN,EAAQ9B,OACjBqC,EAASP,EAAQQ,KASrB,GANE7B,EADE2B,EACOpC,EACAqC,EACArC,EAAOmC,IAAWR,EAAUQ,EAAQ,KAEnCnC,EAAOmC,IAAW,IAAIjD,UAEtB,IAAKL,KAAOkD,EAAQ,CAQ9B,GAPAE,EAAiBF,EAAOlD,GAGtBmD,EAFEF,EAAQS,aACVL,EAAaT,EAAyBhB,EAAQ5B,KACfqD,EAAW3D,MACpBkC,EAAO5B,IACtBgD,EAASO,EAASvD,EAAMsD,GAAUE,EAAS,IAAM,KAAOxD,EAAKiD,EAAQnB,cAE5CK,IAAnBgB,EAA8B,CAC3C,UAAWC,UAAyBD,EAAgB,SACpDJ,EAA0BK,EAAgBD,IAGxCF,EAAQU,MAASR,GAAkBA,EAAeQ,OACpDpB,EAA4Ba,EAAgB,QAAQ,GAGtD1C,EAASkB,EAAQ5B,EAAKoD,EAAgBH,M,6BCnD1C,IAAIW,EAAc,EAAQ,GACtBC,EAAuB,EAAQ,IAA8BC,OAC7DpD,EAAW,EAAQ,IACnBqD,EAAW,EAAQ,IACnBC,EAAgB,EAAQ,IACxBC,EAAY,EAAQ,IACpBC,EAAQ,EAAQ,GAChBC,EAAc,EAAQ,KAGtBC,EAAkBC,OAAOhE,UACzBiE,EAAaF,EAAyB,SACtCG,EAAWX,EAAYO,GAEvBK,EAAcN,GAAM,WAAc,MAAuD,QAAhDI,EAAW1F,KAAK,CAAEsE,OAAQ,IAAKuB,MAAO,SAE/EC,EAAiBb,GAPL,YAO6BS,EAAWtF,MAIpDwF,GAAeE,IACjBhE,EAAS2D,OAAOhE,UAZF,YAYwB,WACpC,IAAIsE,EAAIZ,EAAS1F,MACbkC,EAAI0D,EAAUU,EAAEzB,QAChB0B,EAAKD,EAAEF,MAEX,MAAO,IAAMlE,EAAI,IADT0D,OAAiB9B,IAAPyC,GAAoBZ,EAAcI,EAAiBO,MAAQ,UAAWP,GAAmBG,EAASI,GAAKC,KAExH,CAAEhE,QAAQ,K,cC5Bf1C,EAAOD,QAAU,SAAU4G,GACzB,IACE,QAASA,IACT,MAAOnC,GACP,OAAO,K,gBCJX,IAAIoC,EAAc,EAAQ,IAEtBC,EAAoB3D,SAASf,UAC7BJ,EAAO8E,EAAkB9E,KACzBrB,EAAOmG,EAAkBnG,KACzBgF,EAAckB,GAAe7E,EAAKA,KAAKrB,EAAMA,GAEjDV,EAAOD,QAAU6G,EAAc,SAAUE,GACvC,OAAOA,GAAMpB,EAAYoB,IACvB,SAAUA,GACZ,OAAOA,GAAM,WACX,OAAOpG,EAAKqG,MAAMD,EAAI/C,c,6BCV1B,IAAIR,EAAI,EAAQ,GACZoD,EAAO,EAAQ,KAInBpD,EAAE,CAAEG,OAAQ,SAAUC,OAAO,EAAMC,OAAQ,IAAI+C,OAASA,GAAQ,CAC9DA,KAAMA,K,6BCNR,IA2DIK,EAAUC,EAAsBC,EAAgBC,EA3DhD5D,EAAI,EAAQ,GACZ6D,EAAU,EAAQ,IAClBnE,EAAS,EAAQ,GACjBoE,EAAa,EAAQ,IACrB3G,EAAO,EAAQ,IACf4G,EAAgB,EAAQ,KACxB9E,EAAW,EAAQ,IACnB+E,EAAc,EAAQ,KACtBC,EAAiB,EAAQ,KACzBC,EAAiB,EAAQ,IACzBC,EAAa,EAAQ,KACrBC,EAAY,EAAQ,IACpBC,EAAa,EAAQ,IACrBC,EAAW,EAAQ,IACnBC,EAAa,EAAQ,KACrBC,EAAgB,EAAQ,IACxBC,EAAU,EAAQ,KAClBC,EAA8B,EAAQ,KACtCC,EAAqB,EAAQ,KAC7BC,EAAO,EAAQ,KAAqBC,IACpCC,EAAY,EAAQ,KACpBC,EAAiB,EAAQ,KACzBC,EAAmB,EAAQ,KAC3BC,EAA6B,EAAQ,KACrCC,EAAU,EAAQ,KAClBC,EAAQ,EAAQ,KAChBC,EAAsB,EAAQ,IAC9B7D,EAAW,EAAQ,IACnB8D,EAAkB,EAAQ,IAC1BC,EAAa,EAAQ,KACrBC,EAAU,EAAQ,KAClBC,EAAa,EAAQ,IAErBC,EAAUJ,EAAgB,WAC1BK,EAAU,UAEVC,EAAmBP,EAAoBQ,UAAUF,GACjDG,EAAmBT,EAAoBP,IACvCiB,EAA0BV,EAAoBQ,UAAUF,GACxDK,EAAyBhC,GAAiBA,EAAcnF,UACxDoH,EAAqBjC,EACrBkC,EAAmBF,EACnBG,EAAYxG,EAAOwG,UACnBC,EAAWzG,EAAOyG,SAClBC,EAAU1G,EAAO0G,QACjBC,EAAuBpB,EAA2B7D,EAClDkF,EAA8BD,EAE9BE,KAAoBJ,GAAYA,EAASK,aAAe9G,EAAO+G,eAC/DC,EAAyBrC,EAAW3E,EAAOiH,uBAQ3CC,IAAc,EAIdC,GAAStF,EAASmE,GAAS,WAC7B,IAAIoB,EAA6BtC,EAAcwB,GAC3Ce,EAAyBD,IAA+BE,OAAOhB,GAInE,IAAKe,GAAyC,KAAfvB,EAAmB,OAAO,EAEzD,GAAI3B,IAAYoC,EAA0B,QAAG,OAAO,EAIpD,GAAIT,GAAc,IAAM,cAAcyB,KAAKH,GAA6B,OAAO,EAE/E,IAAII,EAAU,IAAIlB,GAAmB,SAAUmB,GAAWA,EAAQ,MAC9DC,EAAc,SAAUhE,GAC1BA,GAAK,eAA6B,gBAKpC,OAHkB8D,EAAQnH,YAAc,IAC5B0F,GAAW2B,IACvBR,GAAcM,EAAQG,MAAK,yBAAwCD,KAG3DL,GAA0BzB,IAAeoB,KAG/CY,GAAsBT,KAAWnC,GAA4B,SAAU6C,GACzEvB,EAAmBwB,IAAID,GAAiB,OAAE,kBAIxCE,GAAa,SAAUrI,GACzB,IAAIiI,EACJ,SAAO/C,EAASlF,KAAOiF,EAAWgD,EAAOjI,EAAGiI,QAAQA,GAGlDK,GAAe,SAAUC,EAAUC,GACrC,IAMIC,EAAQR,EAAMS,EANd7J,EAAQ2J,EAAM3J,MACd8J,EA9CU,GA8CLH,EAAMA,MACXI,EAAUD,EAAKJ,EAASI,GAAKJ,EAASM,KACtCd,EAAUQ,EAASR,QACnBe,EAASP,EAASO,OAClBC,EAASR,EAASQ,OAEtB,IACMH,GACGD,IAnDK,IAoDJH,EAAMQ,WAAyBC,GAAkBT,GACrDA,EAAMQ,UAtDA,IAwDQ,IAAZJ,EAAkBH,EAAS5J,GAEzBkK,GAAQA,EAAOG,QACnBT,EAASG,EAAQ/J,GACbkK,IACFA,EAAOI,OACPT,GAAS,IAGTD,IAAWF,EAAST,QACtBgB,EAAOhC,EAAU,yBACRmB,EAAOI,GAAWI,IAC3B1K,EAAKkK,EAAMQ,EAAQV,EAASe,GACvBf,EAAQU,IACVK,EAAOjK,GACd,MAAOgD,GACHkH,IAAWL,GAAQK,EAAOI,OAC9BL,EAAOjH,KAIPuH,GAAS,SAAUZ,EAAOa,GACxBb,EAAMc,WACVd,EAAMc,UAAW,EACjB5D,GAAU,WAGR,IAFA,IACI6C,EADAgB,EAAYf,EAAMe,UAEfhB,EAAWgB,EAAU9K,OAC1B6J,GAAaC,EAAUC,GAEzBA,EAAMc,UAAW,EACbD,IAAab,EAAMQ,WAAWQ,GAAYhB,QAI9CnB,GAAgB,SAAUlJ,EAAM2J,EAAS2B,GAC3C,IAAIC,EAAOd,EACPzB,IACFuC,EAAQ3C,EAASK,YAAY,UACvBU,QAAUA,EAChB4B,EAAMD,OAASA,EACfC,EAAMC,UAAUxL,GAAM,GAAO,GAC7BmC,EAAO+G,cAAcqC,IAChBA,EAAQ,CAAE5B,QAASA,EAAS2B,OAAQA,IACtCnC,IAA2BsB,EAAUtI,EAAO,KAAOnC,IAAQyK,EAAQc,GAzGhD,uBA0GfvL,GAA8ByH,EAAiB,8BAA+B6D,IAGrFD,GAAc,SAAUhB,GAC1BzK,EAAKyH,EAAMlF,GAAQ,WACjB,IAGImI,EAHAX,EAAUU,EAAMoB,OAChB/K,EAAQ2J,EAAM3J,MAGlB,GAFmBgL,GAAYrB,KAG7BC,EAAS3C,GAAQ,WACXK,EACFa,EAAQ8C,KAAK,qBAAsBjL,EAAOiJ,GACrCT,GAvHW,qBAuHwBS,EAASjJ,MAGrD2J,EAAMQ,UAAY7C,GAAW0D,GAAYrB,GApH/B,EADF,EAsHJC,EAAO5G,OAAO,MAAM4G,EAAO5J,UAKjCgL,GAAc,SAAUrB,GAC1B,OA5HY,IA4HLA,EAAMQ,YAA0BR,EAAMuB,QAG3Cd,GAAoB,SAAUT,GAChCzK,EAAKyH,EAAMlF,GAAQ,WACjB,IAAIwH,EAAUU,EAAMoB,OAChBzD,EACFa,EAAQ8C,KAAK,mBAAoBhC,GAC5BT,GAxIa,mBAwIoBS,EAASU,EAAM3J,WAIvDO,GAAO,SAAU+E,EAAIqE,EAAOwB,GAC9B,OAAO,SAAUnL,GACfsF,EAAGqE,EAAO3J,EAAOmL,KAIjBC,GAAiB,SAAUzB,EAAO3J,EAAOmL,GACvCxB,EAAM0B,OACV1B,EAAM0B,MAAO,EACTF,IAAQxB,EAAQwB,GACpBxB,EAAM3J,MAAQA,EACd2J,EAAMA,MApJO,EAqJbY,GAAOZ,GAAO,KAGZ2B,GAAkB,SAAU3B,EAAO3J,EAAOmL,GAC5C,IAAIxB,EAAM0B,KAAV,CACA1B,EAAM0B,MAAO,EACTF,IAAQxB,EAAQwB,GACpB,IACE,GAAIxB,EAAMoB,SAAW/K,EAAO,MAAMiI,EAAU,oCAC5C,IAAImB,EAAOI,GAAWxJ,GAClBoJ,EACFvC,GAAU,WACR,IAAI0E,EAAU,CAAEF,MAAM,GACtB,IACEnM,EAAKkK,EAAMpJ,EACTO,GAAK+K,GAAiBC,EAAS5B,GAC/BpJ,GAAK6K,GAAgBG,EAAS5B,IAEhC,MAAO3G,GACPoI,GAAeG,EAASvI,EAAO2G,QAInCA,EAAM3J,MAAQA,EACd2J,EAAMA,MA9KI,EA+KVY,GAAOZ,GAAO,IAEhB,MAAO3G,GACPoI,GAAe,CAAEC,MAAM,GAASrI,EAAO2G,MAK3C,GAAIf,KAaFZ,GAXAD,EAAqB,SAAiByD,GACpClF,EAAW3H,KAAMqJ,GACjB7B,EAAUqF,GACVtM,EAAKsG,EAAU7G,MACf,IAAIgL,EAAQjC,EAAiB/I,MAC7B,IACE6M,EAASjL,GAAK+K,GAAiB3B,GAAQpJ,GAAK6K,GAAgBzB,IAC5D,MAAO3G,GACPoI,GAAezB,EAAO3G,MAGYrC,WAEtC6E,EAAW,SAAiBgG,GAC1B5D,EAAiBjJ,KAAM,CACrB8M,KAAMhE,EACN4D,MAAM,EACNZ,UAAU,EACVS,QAAQ,EACRR,UAAW,IAAIxD,EACfiD,WAAW,EACXR,MA/MQ,EAgNR3J,WAAOyC,MAGF9B,UAAYoF,EAAYiC,EAAkB,CAIjDoB,KAAM,SAAcsC,EAAaC,GAC/B,IAAIhC,EAAQ9B,EAAwBlJ,MAChC+K,EAAWtB,EAAqB1B,EAAmB/H,KAAMoJ,IAS7D,OARA4B,EAAMuB,QAAS,EACfxB,EAASI,IAAK1D,EAAWsF,IAAeA,EACxChC,EAASM,KAAO5D,EAAWuF,IAAeA,EAC1CjC,EAASQ,OAAS5C,EAAUa,EAAQ+B,YAASzH,EA7NrC,GA8NJkH,EAAMA,MAAkBA,EAAMe,UAAUkB,IAAIlC,GAC3C7C,GAAU,WACb4C,GAAaC,EAAUC,MAElBD,EAAST,SAIlB,MAAS,SAAU0C,GACjB,OAAOhN,KAAKyK,UAAK3G,EAAWkJ,MAGhClG,EAAuB,WACrB,IAAIwD,EAAU,IAAIzD,EACdmE,EAAQjC,EAAiBuB,GAC7BtK,KAAKsK,QAAUA,EACftK,KAAKuK,QAAU3I,GAAK+K,GAAiB3B,GACrChL,KAAKsL,OAAS1J,GAAK6K,GAAgBzB,IAErC3C,EAA2B7D,EAAIiF,EAAuB,SAAUyD,GAC9D,OAAOA,IAAM9D,GAAsB8D,IAAMnG,EACrC,IAAID,EAAqBoG,GACzBxD,EAA4BwD,KAG7BjG,GAAWQ,EAAWN,IAAkBgC,IAA2BrI,OAAOkB,WAAW,CACxFgF,EAAamC,EAAuBsB,KAE/BT,KAEH3H,EAAS8G,EAAwB,QAAQ,SAAc4D,EAAaC,GAClE,IAAIG,EAAOnN,KACX,OAAO,IAAIoJ,GAAmB,SAAUmB,EAASe,GAC/C/K,EAAKyG,EAAYmG,EAAM5C,EAASe,MAC/Bb,KAAKsC,EAAaC,KAEpB,CAAEzK,QAAQ,IAGbF,EAAS8G,EAAwB,QAASE,EAAwB,MAAG,CAAE9G,QAAQ,KAIjF,WACS4G,EAAuBhG,YAC9B,MAAOkB,IAGLgD,GACFA,EAAe8B,EAAwBE,GAK7CjG,EAAE,CAAEN,QAAQ,EAAMsK,MAAM,EAAM3J,OAAQwG,IAAU,CAC9CoD,QAASjE,IAGX9B,EAAe8B,EAAoBN,GAAS,GAAO,GACnDvB,EAAWuB,GAEX/B,EAAiBG,EAAW4B,GAG5B1F,EAAE,CAAEG,OAAQuF,EAAS1D,MAAM,EAAM3B,OAAQwG,IAAU,CAGjDqB,OAAQ,SAAgBpK,GACtB,IAAIoM,EAAa7D,EAAqBzJ,MAEtC,OADAO,EAAK+M,EAAWhC,YAAQxH,EAAW5C,GAC5BoM,EAAWhD,WAItBlH,EAAE,CAAEG,OAAQuF,EAAS1D,MAAM,EAAM3B,OAAQwD,GAAWgD,IAAU,CAG5DM,QAAS,SAAiBgD,GACxB,OAAOpF,EAAelB,GAAWjH,OAAS+G,EAAiBqC,EAAqBpJ,KAAMuN,MAI1FnK,EAAE,CAAEG,OAAQuF,EAAS1D,MAAM,EAAM3B,OAAQiH,IAAuB,CAG9DE,IAAK,SAAaD,GAChB,IAAIuC,EAAIlN,KACJsN,EAAa7D,EAAqByD,GAClC3C,EAAU+C,EAAW/C,QACrBe,EAASgC,EAAWhC,OACpBL,EAAS3C,GAAQ,WACnB,IAAIkF,EAAkBhG,EAAU0F,EAAE3C,SAC9BkD,EAAS,GACTC,EAAU,EACVC,EAAY,EAChB9F,EAAQ8C,GAAU,SAAUL,GAC1B,IAAIsD,EAAQF,IACRG,GAAgB,EACpBF,IACApN,EAAKiN,EAAiBN,EAAG5C,GAASG,MAAK,SAAUpJ,GAC3CwM,IACJA,GAAgB,EAChBJ,EAAOG,GAASvM,IACdsM,GAAapD,EAAQkD,MACtBnC,QAEHqC,GAAapD,EAAQkD,MAGzB,OADIxC,EAAO5G,OAAOiH,EAAOL,EAAO5J,OACzBiM,EAAWhD,SAIpBwD,KAAM,SAAcnD,GAClB,IAAIuC,EAAIlN,KACJsN,EAAa7D,EAAqByD,GAClC5B,EAASgC,EAAWhC,OACpBL,EAAS3C,GAAQ,WACnB,IAAIkF,EAAkBhG,EAAU0F,EAAE3C,SAClC1C,EAAQ8C,GAAU,SAAUL,GAC1B/J,EAAKiN,EAAiBN,EAAG5C,GAASG,KAAK6C,EAAW/C,QAASe,SAI/D,OADIL,EAAO5G,OAAOiH,EAAOL,EAAO5J,OACzBiM,EAAWhD,Y,gBC/YtB,IAAIyD,EAAc,EAAQ,IACtBC,EAAuB,EAAQ,IAA8BC,OAC7D1I,EAAc,EAAQ,GACtBxE,EAAiB,EAAQ,IAAuCyD,EAEhEkC,EAAoB3D,SAASf,UAC7BkM,EAAmB3I,EAAYmB,EAAkBpE,UACjD6L,EAAS,mEACTC,EAAa7I,EAAY4I,EAAO3H,MAKhCuH,IAAgBC,GAClBjN,EAAe2F,EALN,OAK+B,CACtC2H,cAAc,EACdpN,IAAK,WACH,IACE,OAAOmN,EAAWD,EAAQD,EAAiBlO,OAAO,GAClD,MAAOqE,GACP,MAAO,Q,6BCnBf,IAAIjB,EAAI,EAAQ,GACZ7C,EAAO,EAAQ,IAInB6C,EAAE,CAAEG,OAAQ,MAAOC,OAAO,EAAMxC,YAAY,GAAQ,CAClDsN,OAAQ,WACN,OAAO/N,EAAKgO,IAAIvM,UAAUM,SAAUtC,U,6BCPxC,IAAIoD,EAAI,EAAQ,GACZmC,EAAc,EAAQ,GACtBiJ,EAAgB,EAAQ,KACxBC,EAAkB,EAAQ,IAC1BC,EAAsB,EAAQ,KAE9BC,EAAUpJ,EAAY,GAAGqJ,MAEzBC,EAAcL,GAAiB1N,OAC/BgO,EAAgBJ,EAAoB,OAAQ,KAIhDtL,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,OAAQoL,IAAgBC,GAAiB,CACzEF,KAAM,SAAcG,GAClB,OAAOJ,EAAQF,EAAgBzO,WAAqB8D,IAAdiL,EAA0B,IAAMA,O,cCd1ElP,EAAOD,QAAU,SAAUoP,GACzB,MAA0B,mBAAZA,I,gBCHhB,IAAIlM,EAAS,EAAQ,GACjBmM,EAAS,EAAQ,IACjBC,EAAS,EAAQ,IACjBC,EAAM,EAAQ,IACdC,EAAgB,EAAQ,KACxBC,EAAoB,EAAQ,KAE5BC,EAAwBL,EAAO,OAC/B9N,EAAS2B,EAAO3B,OAChBoO,EAAYpO,GAAUA,EAAY,IAClCqO,EAAwBH,EAAoBlO,EAASA,GAAUA,EAAOsO,eAAiBN,EAE3FtP,EAAOD,QAAU,SAAUe,GACzB,IAAKuO,EAAOI,EAAuB3O,KAAWyO,GAAuD,iBAA/BE,EAAsB3O,GAAoB,CAC9G,IAAI+O,EAAc,UAAY/O,EAC1ByO,GAAiBF,EAAO/N,EAAQR,GAClC2O,EAAsB3O,GAAQQ,EAAOR,GAErC2O,EAAsB3O,GADb0O,GAAqBE,EACAA,EAAUG,GAEVF,EAAsBE,GAEtD,OAAOJ,EAAsB3O,K,6BCrBjC,IAAIyC,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjB6M,EAAU,EAAQ,IAClBC,EAAgB,EAAQ,IACxBlI,EAAW,EAAQ,IACnBmI,EAAkB,EAAQ,IAC1BC,EAAoB,EAAQ,IAC5BrB,EAAkB,EAAQ,IAC1BsB,EAAiB,EAAQ,IACzBtH,EAAkB,EAAQ,IAC1B/E,EAA+B,EAAQ,IACvCsM,EAAW,EAAQ,KAEnBC,EAAsBvM,EAA6B,SAEnDmF,EAAUJ,EAAgB,WAC1ByH,EAAQpN,EAAOoN,MACfC,EAAM1N,KAAK0N,IAKf/M,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,QAASwM,GAAuB,CAChEG,MAAO,SAAeC,EAAOC,GAC3B,IAKIC,EAAatF,EAAQpJ,EALrB2O,EAAI/B,EAAgBzO,MACpB6D,EAASiM,EAAkBU,GAC3BC,EAAIZ,EAAgBQ,EAAOxM,GAC3B6M,EAAMb,OAAwB/L,IAARwM,EAAoBzM,EAASyM,EAAKzM,GAG5D,GAAI8L,EAAQa,KACVD,EAAcC,EAAErN,aAEZyM,EAAcW,KAAiBA,IAAgBL,GAASP,EAAQY,EAAYvO,aAErE0F,EAAS6I,IAEE,QADpBA,EAAcA,EAAY1H,OAF1B0H,OAAczM,GAKZyM,IAAgBL,QAAyBpM,IAAhByM,GAC3B,OAAOP,EAASQ,EAAGC,EAAGC,GAI1B,IADAzF,EAAS,SAAqBnH,IAAhByM,EAA4BL,EAAQK,GAAaJ,EAAIO,EAAMD,EAAG,IACvE5O,EAAI,EAAG4O,EAAIC,EAAKD,IAAK5O,IAAS4O,KAAKD,GAAGT,EAAe9E,EAAQpJ,EAAG2O,EAAEC,IAEvE,OADAxF,EAAOpH,OAAShC,EACToJ,M,gBC/CX,IAAIpF,EAAQ,EAAQ,GAGpBhG,EAAOD,SAAWiG,GAAM,WAEtB,OAA8E,GAAvE/E,OAAOC,eAAe,GAAI,EAAG,CAAEE,IAAK,WAAc,OAAO,KAAQ,O,6BCJ1E,IAAImC,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjB+C,EAAQ,EAAQ,GAChB8J,EAAU,EAAQ,IAClBjI,EAAW,EAAQ,IACnBiJ,EAAW,EAAQ,IACnBb,EAAoB,EAAQ,IAC5BC,EAAiB,EAAQ,IACzBa,EAAqB,EAAQ,KAC7BlN,EAA+B,EAAQ,IACvC+E,EAAkB,EAAQ,IAC1BG,EAAa,EAAQ,IAErBiI,EAAuBpI,EAAgB,sBAGvCa,EAAYxG,EAAOwG,UAKnBwH,EAA+BlI,GAAc,KAAO/C,GAAM,WAC5D,IAAIkL,EAAQ,GAEZ,OADAA,EAAMF,IAAwB,EACvBE,EAAMC,SAAS,KAAOD,KAG3BE,EAAkBvN,EAA6B,UAE/CwN,EAAqB,SAAUV,GACjC,IAAK9I,EAAS8I,GAAI,OAAO,EACzB,IAAIW,EAAaX,EAAEK,GACnB,YAAsB/M,IAAfqN,IAA6BA,EAAaxB,EAAQa,IAQ3DpN,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,QALpBqN,IAAiCG,GAKK,CAElDD,OAAQ,SAAgBI,GACtB,IAGIhR,EAAGqQ,EAAG5M,EAAQwN,EAAKC,EAHnBd,EAAIG,EAAS3Q,MACbuR,EAAIX,EAAmBJ,EAAG,GAC1B3O,EAAI,EAER,IAAKzB,GAAK,EAAGyD,EAASD,UAAUC,OAAQzD,EAAIyD,EAAQzD,IAElD,GAAI8Q,EADJI,GAAW,IAAPlR,EAAWoQ,EAAI5M,UAAUxD,IACF,CAEzB,GAAIyB,GADJwP,EAAMvB,EAAkBwB,IApCT,iBAqCiB,MAAMhI,EApCT,kCAqC7B,IAAKmH,EAAI,EAAGA,EAAIY,EAAKZ,IAAK5O,IAAS4O,KAAKa,GAAGvB,EAAewB,EAAG1P,EAAGyP,EAAEb,QAC7D,CACL,GAAI5O,GAxCW,iBAwCY,MAAMyH,EAvCJ,kCAwC7ByG,EAAewB,EAAG1P,IAAKyP,GAI3B,OADAC,EAAE1N,OAAShC,EACJ0P,M,gBC5DX,IAAIzO,EAAS,EAAQ,GACjBiL,EAAc,EAAQ,IACtByD,EAAiB,EAAQ,KACzBC,EAA0B,EAAQ,KAClC/L,EAAW,EAAQ,IACnBgM,EAAgB,EAAQ,IAExBpI,EAAYxG,EAAOwG,UAEnBqI,EAAkB7Q,OAAOC,eAEzB6Q,EAA4B9Q,OAAOyD,yBAOvC3E,EAAQ4E,EAAIuJ,EAAc0D,EAA0B,SAAwBjB,EAAGqB,EAAGC,GAIhF,GAHApM,EAAS8K,GACTqB,EAAIH,EAAcG,GAClBnM,EAASoM,GACQ,mBAANtB,GAA0B,cAANqB,GAAqB,UAAWC,GARlD,aAQ4EA,IAAeA,EAAmB,SAAG,CAC5H,IAAIC,EAAUH,EAA0BpB,EAAGqB,GACvCE,GAAWA,EAAgB,WAC7BvB,EAAEqB,GAAKC,EAAWzQ,MAClByQ,EAAa,CACXzD,aAdW,iBAcmByD,EAAaA,EAAuB,aAAIC,EAAoB,aAC1F/Q,WAhBS,eAgBiB8Q,EAAaA,EAAqB,WAAIC,EAAkB,WAClFC,UAAU,IAGd,OAAOL,EAAgBnB,EAAGqB,EAAGC,IAC7BH,EAAkB,SAAwBnB,EAAGqB,EAAGC,GAIlD,GAHApM,EAAS8K,GACTqB,EAAIH,EAAcG,GAClBnM,EAASoM,GACLN,EAAgB,IAClB,OAAOG,EAAgBnB,EAAGqB,EAAGC,GAC7B,MAAOzN,IACT,GAAI,QAASyN,GAAc,QAASA,EAAY,MAAMxI,EAAU,2BAEhE,MADI,UAAWwI,IAAYtB,EAAEqB,GAAKC,EAAWzQ,OACtCmP,I,gBC1CT,IAAI1N,EAAS,EAAQ,GACjB4E,EAAW,EAAQ,IAEnB0C,EAAStH,EAAOsH,OAChBd,EAAYxG,EAAOwG,UAGvBzJ,EAAOD,QAAU,SAAUoP,GACzB,GAAItH,EAASsH,GAAW,OAAOA,EAC/B,MAAM1F,EAAUc,EAAO4E,GAAY,uB,gBCTrC,IAAIvI,EAAc,EAAQ,IAEtBlG,EAAOwC,SAASf,UAAUzB,KAE9BV,EAAOD,QAAU6G,EAAclG,EAAKqB,KAAKrB,GAAQ,WAC/C,OAAOA,EAAKqG,MAAMrG,EAAMqD,a,gBCL1B,IAAI6D,EAAa,EAAQ,IAEzB5H,EAAOD,QAAU,SAAU4C,GACzB,MAAoB,iBAANA,EAAwB,OAAPA,EAAciF,EAAWjF,K,6BCF1D,IAAIY,EAAI,EAAQ,GACZ6O,EAAQ,EAAQ,IAAgCC,KAChDC,EAAmB,EAAQ,KAG3BC,GAAc,EADP,QAIC,IAAIlC,MAAM,GAAO,MAAE,WAAckC,GAAc,KAI3DhP,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,OAAQ2O,GAAe,CACvDF,KAAM,SAAcvO,GAClB,OAAOsO,EAAMjS,KAAM2D,EAAYC,UAAUC,OAAS,EAAID,UAAU,QAAKE,MAKzEqO,EAfW,S,gBCLX,IAAIE,EAAoB,EAAQ,KAE5BC,EAAkB,EAAQ,KAE1BC,EAA6B,EAAQ,KAErCC,EAAoB,EAAQ,KAMhC3S,EAAOD,QAJP,SAA4B6S,GAC1B,OAAOJ,EAAkBI,IAAQH,EAAgBG,IAAQF,EAA2BE,IAAQD,KAGzD3S,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,gBCZ1G,IAAI2F,EAAc,EAAQ,GACtBoL,EAAW,EAAQ,IAEnB1O,EAAiBsD,EAAY,GAAGtD,gBAIpCpC,EAAOD,QAAUkB,OAAOoO,QAAU,SAAgB1M,EAAIb,GACpD,OAAOM,EAAe0O,EAASnO,GAAKb,K,6BCPtC,IAAI8M,EAAkB,EAAQ,IAC1B0D,EAAmB,EAAQ,KAC3BO,EAAY,EAAQ,IACpBlK,EAAsB,EAAQ,IAC9BzH,EAAiB,EAAQ,IAAuCyD,EAChEmO,EAAiB,EAAQ,KACzB1L,EAAU,EAAQ,IAClB8G,EAAc,EAAQ,IAGtB9E,EAAmBT,EAAoBP,IACvCc,EAAmBP,EAAoBQ,UAFtB,kBAcrBnJ,EAAOD,QAAU+S,EAAezC,MAAO,SAAS,SAAU0C,EAAUC,GAClE5J,EAAiBjJ,KAAM,CACrB8M,KAhBiB,iBAiBjBvJ,OAAQkL,EAAgBmE,GACxBhF,MAAO,EACPiF,KAAMA,OAIP,WACD,IAAI7H,EAAQjC,EAAiB/I,MACzBuD,EAASyH,EAAMzH,OACfsP,EAAO7H,EAAM6H,KACbjF,EAAQ5C,EAAM4C,QAClB,OAAKrK,GAAUqK,GAASrK,EAAOM,QAC7BmH,EAAMzH,YAASO,EACR,CAAEzC,WAAOyC,EAAW4I,MAAM,IAEvB,QAARmG,EAAuB,CAAExR,MAAOuM,EAAOlB,MAAM,GACrC,UAARmG,EAAyB,CAAExR,MAAOkC,EAAOqK,GAAQlB,MAAM,GACpD,CAAErL,MAAO,CAACuM,EAAOrK,EAAOqK,IAASlB,MAAM,KAC7C,UAKH,IAAIe,EAASiF,EAAUI,UAAYJ,EAAUxC,MAQ7C,GALAiC,EAAiB,QACjBA,EAAiB,UACjBA,EAAiB,YAGZlL,GAAW8G,GAA+B,WAAhBN,EAAO9M,KAAmB,IACvDI,EAAe0M,EAAQ,OAAQ,CAAEpM,MAAO,WACxC,MAAOgD,M,gBC5DT,IAAIjB,EAAI,EAAQ,GACZuN,EAAW,EAAQ,IACnBoC,EAAa,EAAQ,KAOzB3P,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAM3B,OANtB,EAAQ,EAEMoC,EAAM,WAAckN,EAAW,OAIQ,CAC/DC,KAAM,SAAcxQ,GAClB,OAAOuQ,EAAWpC,EAASnO,Q,6BCV/B,IAAIY,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjB+M,EAAkB,EAAQ,IAC1BoD,EAAsB,EAAQ,IAC9BnD,EAAoB,EAAQ,IAC5Ba,EAAW,EAAQ,IACnBC,EAAqB,EAAQ,KAC7Bb,EAAiB,EAAQ,IAGzBE,EAF+B,EAAQ,GAEjBvM,CAA6B,UAEnD4F,EAAYxG,EAAOwG,UACnB6G,EAAM1N,KAAK0N,IACX+C,EAAMzQ,KAAKyQ,IAOf9P,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,QAASwM,GAAuB,CAChEkD,OAAQ,SAAgB9C,EAAO+C,GAC7B,IAIIC,EAAaC,EAAmB/B,EAAGd,EAAG8C,EAAMC,EAJ5ChD,EAAIG,EAAS3Q,MACbqR,EAAMvB,EAAkBU,GACxBiD,EAAc5D,EAAgBQ,EAAOgB,GACrCqC,EAAkB9P,UAAUC,OAWhC,GATwB,IAApB6P,EACFL,EAAcC,EAAoB,EACL,IAApBI,GACTL,EAAc,EACdC,EAAoBjC,EAAMoC,IAE1BJ,EAAcK,EAAkB,EAChCJ,EAAoBJ,EAAI/C,EAAI8C,EAAoBG,GAAc,GAAI/B,EAAMoC,IAEtEpC,EAAMgC,EAAcC,EAtBL,iBAuBjB,MAAMhK,EAtB0B,mCAyBlC,IADAiI,EAAIX,EAAmBJ,EAAG8C,GACrB7C,EAAI,EAAGA,EAAI6C,EAAmB7C,KACjC8C,EAAOE,EAAchD,KACTD,GAAGT,EAAewB,EAAGd,EAAGD,EAAE+C,IAGxC,GADAhC,EAAE1N,OAASyP,EACPD,EAAcC,EAAmB,CACnC,IAAK7C,EAAIgD,EAAahD,EAAIY,EAAMiC,EAAmB7C,IAEjD+C,EAAK/C,EAAI4C,GADTE,EAAO9C,EAAI6C,KAEC9C,EAAGA,EAAEgD,GAAMhD,EAAE+C,UACb/C,EAAEgD,GAEhB,IAAK/C,EAAIY,EAAKZ,EAAIY,EAAMiC,EAAoBD,EAAa5C,WAAYD,EAAEC,EAAI,QACtE,GAAI4C,EAAcC,EACvB,IAAK7C,EAAIY,EAAMiC,EAAmB7C,EAAIgD,EAAahD,IAEjD+C,EAAK/C,EAAI4C,EAAc,GADvBE,EAAO9C,EAAI6C,EAAoB,KAEnB9C,EAAGA,EAAEgD,GAAMhD,EAAE+C,UACb/C,EAAEgD,GAGlB,IAAK/C,EAAI,EAAGA,EAAI4C,EAAa5C,IAC3BD,EAAEC,EAAIgD,GAAe7P,UAAU6M,EAAI,GAGrC,OADAD,EAAE3M,OAASwN,EAAMiC,EAAoBD,EAC9B9B,M,6BClEX,IAAIxD,EAAc,EAAQ,IACtBjL,EAAS,EAAQ,GACjByC,EAAc,EAAQ,GACtBZ,EAAW,EAAQ,IACnBtC,EAAW,EAAQ,IACnB6M,EAAS,EAAQ,IACjByE,EAAoB,EAAQ,KAC5BhO,EAAgB,EAAQ,IACxBiO,EAAW,EAAQ,IACnBC,EAAc,EAAQ,KACtBhO,EAAQ,EAAQ,GAChBiO,EAAsB,EAAQ,IAA8CtP,EAC5ED,EAA2B,EAAQ,IAAmDC,EACtFzD,EAAiB,EAAQ,IAAuCyD,EAChEuP,EAAkB,EAAQ,KAC1BC,EAAO,EAAQ,KAA4BA,KAG3CC,EAAenR,EAAa,OAC5BoR,EAAkBD,EAAajS,UAC/BsH,EAAYxG,EAAOwG,UACnB6K,EAAa5O,EAAY,GAAG6K,OAC5BgE,EAAa7O,EAAY,GAAG6O,YAI5BC,EAAY,SAAUhT,GACxB,IAAIiT,EAAYT,EAAYxS,EAAO,UACnC,MAA2B,iBAAbiT,EAAwBA,EAAYC,EAASD,IAKzDC,EAAW,SAAUvF,GACvB,IACIwF,EAAOC,EAAOC,EAAOC,EAASC,EAAQ/Q,EAAQ+J,EAAOiH,EADrDrS,EAAKqR,EAAY7E,EAAU,UAE/B,GAAI4E,EAASpR,GAAK,MAAM8G,EAAU,6CAClC,GAAiB,iBAAN9G,GAAkBA,EAAGqB,OAAS,EAGvC,GAFArB,EAAKwR,EAAKxR,GAEI,MADdgS,EAAQJ,EAAW5R,EAAI,KACO,KAAVgS,GAElB,GAAc,MADdC,EAAQL,EAAW5R,EAAI,KACO,MAAViS,EAAe,OAAOK,SACrC,GAAc,KAAVN,EAAc,CACvB,OAAQJ,EAAW5R,EAAI,IACrB,KAAK,GAAI,KAAK,GAAIkS,EAAQ,EAAGC,EAAU,GAAI,MAC3C,KAAK,GAAI,KAAK,IAAKD,EAAQ,EAAGC,EAAU,GAAI,MAC5C,QAAS,OAAQnS,EAInB,IADAqB,GADA+Q,EAAST,EAAW3R,EAAI,IACRqB,OACX+J,EAAQ,EAAGA,EAAQ/J,EAAQ+J,IAI9B,IAHAiH,EAAOT,EAAWQ,EAAQhH,IAGf,IAAMiH,EAAOF,EAAS,OAAOG,IACxC,OAAOC,SAASH,EAAQF,GAE5B,OAAQlS,GAKZ,GAAImC,EA9CS,UA8CSsP,EAAa,UAAYA,EAAa,QAAUA,EAAa,SAAU,CAQ3F,IAPA,IAcqBtS,EAdjBqT,EAAgB,SAAgB3T,GAClC,IAAIQ,EAAI+B,UAAUC,OAAS,EAAI,EAAIoQ,EAAaI,EAAUhT,IACtD4T,EAAQjV,KAEZ,OAAO2F,EAAcuO,EAAiBe,IAAUpP,GAAM,WAAckO,EAAgBkB,MAChFtB,EAAkB7S,OAAOe,GAAIoT,EAAOD,GAAiBnT,GAElDmR,EAAOjF,EAAc+F,EAAoBG,GAAgB,oLAOhEiB,MAAM,KAAMC,EAAI,EAAQnC,EAAKnP,OAASsR,EAAGA,IACrCjG,EAAO+E,EAActS,EAAMqR,EAAKmC,MAAQjG,EAAO8F,EAAerT,IAChEZ,EAAeiU,EAAerT,EAAK4C,EAAyB0P,EAActS,IAG9EqT,EAAchT,UAAYkS,EAC1BA,EAAgB/Q,YAAc6R,EAC9B3S,EAASS,EApEE,SAoEckS,K,gBCtF3B,IAAIlS,EAAS,EAAQ,GACjBiB,EAAe,EAAQ,KACvBC,EAAwB,EAAQ,KAChCoR,EAAuB,EAAQ,IAC/BlR,EAA8B,EAAQ,IACtCuE,EAAkB,EAAQ,IAE1B4M,EAAW5M,EAAgB,YAC3B6M,EAAgB7M,EAAgB,eAChC8M,EAAcH,EAAqB3H,OAEnCtJ,EAAkB,SAAUC,EAAqBE,GACnD,GAAIF,EAAqB,CAEvB,GAAIA,EAAoBiR,KAAcE,EAAa,IACjDrR,EAA4BE,EAAqBiR,EAAUE,GAC3D,MAAOlR,GACPD,EAAoBiR,GAAYE,EAKlC,GAHKnR,EAAoBkR,IACvBpR,EAA4BE,EAAqBkR,EAAehR,GAE9DP,EAAaO,GAAkB,IAAK,IAAIkR,KAAeJ,EAEzD,GAAIhR,EAAoBoR,KAAiBJ,EAAqBI,GAAc,IAC1EtR,EAA4BE,EAAqBoR,EAAaJ,EAAqBI,IACnF,MAAOnR,GACPD,EAAoBoR,GAAeJ,EAAqBI,MAMhE,IAAK,IAAIlR,KAAmBP,EAC1BI,EAAgBrB,EAAOwB,IAAoBxB,EAAOwB,GAAiBtC,UAAWsC,GAGhFH,EAAgBH,EAAuB,iB,cCrCvC,SAASyR,IAcP,OAbA5V,EAAOD,QAAU6V,EAAW3U,OAAO4U,QAAU,SAAUnS,GACrD,IAAK,IAAInD,EAAI,EAAGA,EAAIwD,UAAUC,OAAQzD,IAAK,CACzC,IAAIyE,EAASjB,UAAUxD,GAEvB,IAAK,IAAIuB,KAAOkD,EACV/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAQlD,KAC/C4B,EAAO5B,GAAOkD,EAAOlD,IAK3B,OAAO4B,GACN1D,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,QACjE6V,EAAS7O,MAAM5G,KAAM4D,WAG9B/D,EAAOD,QAAU6V,EAAU5V,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,gBCjBhG;;;;;;KAmCA,SAAUF,GAER,aAEA,IAAIiW,EAAO,SAASpI,GAClB,MAAsC,IAA9B9K,KAAKmT,IAAIrI,GAAK9K,KAAKmT,KAAKrI,KAG9BsI,EAAO,SAAStI,GAClB,MAAsC,IAA9B9K,KAAKmT,IAAIrI,GAAK9K,KAAKmT,KAAKrI,KAgE9BuI,EAAc,WAChB,MAAMC,YAAY,kBAUpB,SAASC,EAASC,EAAGC,GAEnB,IAAIC,EAAK1T,KAAK2T,IAAIH,GACdI,EAAK5T,KAAK2T,IAAIF,GAElB,OAAU,IAAND,EACKxT,KAAK6T,IAAID,GAGR,IAANH,EACKzT,KAAK6T,IAAIH,GAGdA,EAAK,KAAQE,EAAK,IACa,GAA1B5T,KAAK6T,IAAIL,EAAIA,EAAIC,EAAIA,IAmC7BD,GAAQ,EACRC,GAAQ,EAEF,GAAMzT,KAAK6T,IAAIL,EAAIA,EAAIC,EAAIA,GAAKzT,KAAK8T,KAyH9C,SAASC,EAAQP,EAAGC,GAElB,KAAMlW,gBAAgBwW,GACpB,OAAO,IAAIA,EAAQP,EAAGC,GAGxB,IAAIO,EA5HM,SAASR,EAAGC,GAEtB,IAAIO,EAAI,CAAE,GAAM,EAAG,GAAM,GAEzB,GAAIR,QACFQ,EAAM,GACNA,EAAM,GAAI,OACL,QAAU3S,IAANoS,EACTO,EAAM,GAAIR,EACVQ,EAAM,GAAIP,OAEV,cAAeD,GAEb,IAAK,SAEH,GAAI,OAAQA,GAAK,OAAQA,EACvBQ,EAAM,GAAIR,EAAM,GAChBQ,EAAM,GAAIR,EAAM,QACX,GAAI,QAASA,GAAK,QAASA,EAAG,CACnC,IAAKS,OAAOC,SAASV,EAAO,MAAMS,OAAOC,SAASV,EAAO,KACvD,OAAOO,EAAkB,SAE3BC,EAAM,GAAIR,EAAO,IAAIxT,KAAKmU,IAAIX,EAAO,KACrCQ,EAAM,GAAIR,EAAO,IAAIxT,KAAKoU,IAAIZ,EAAO,UAChC,GAAI,MAAOA,GAAK,QAASA,EAAG,CACjC,IAAKS,OAAOC,SAASV,EAAK,IAAMS,OAAOC,SAASV,EAAO,KACrD,OAAOO,EAAkB,SAE3BC,EAAM,GAAIR,EAAK,EAAIxT,KAAKmU,IAAIX,EAAO,KACnCQ,EAAM,GAAIR,EAAK,EAAIxT,KAAKoU,IAAIZ,EAAO,UACb,IAAbA,EAAEpS,QACX4S,EAAM,GAAIR,EAAE,GACZQ,EAAM,GAAIR,EAAE,IAEZH,IAEF,MAEF,IAAK,SAEHW,EAAM,GACNA,EAAM,GAAI,EAEV,IAAIK,EAASb,EAAEc,MAAM,yCACjBC,EAAO,EACPC,EAAQ,EAEG,OAAXH,GACFhB,IAGF,IAAK,IAAI1V,EAAI,EAAGA,EAAI0W,EAAOjT,OAAQzD,IAAK,CAEtC,IAAIK,EAAIqW,EAAO1W,GAEL,MAANK,GAAmB,OAANA,GAAoB,OAANA,IAEd,MAANA,EACTuW,IACe,MAANvW,EACTwW,IACe,MAANxW,GAAmB,MAANA,GAElBuW,EAAOC,IAAU,GACnBnB,IAGoB,MAAlBgB,EAAO1W,EAAI,IAAe8W,MAAMJ,EAAO1W,EAAI,IAI7CqW,EAAM,IAAKU,YAAYF,EAAQ,EAAI,IAAM,IAAM,MAH/CR,EAAM,IAAKU,YAAYF,EAAQ,EAAI,IAAM,IAAMH,EAAO1W,EAAI,IAC1DA,KAIF4W,EAAOC,EAAQ,KAIXD,EAAOC,IAAU,GAAKC,MAAMzW,KAC9BqV,IAGoB,MAAlBgB,EAAO1W,EAAI,IAAgC,MAAlB0W,EAAO1W,EAAI,IACtCqW,EAAM,IAAKU,YAAYF,EAAQ,EAAI,IAAM,IAAMxW,GAC/CL,KAEAqW,EAAM,IAAKU,YAAYF,EAAQ,EAAI,IAAM,IAAMxW,GAEjDuW,EAAOC,EAAQ,IAKfD,EAAOC,EAAQ,GACjBnB,IAEF,MAEF,IAAK,SACHW,EAAM,GAAI,EACVA,EAAM,GAAIR,EACV,MAEF,QACEH,IAQN,OALIoB,MAAMT,EAAM,KAAMS,MAAMT,EAAM,IAK3BA,EAaCW,CAAMnB,EAAGC,GAEjBlW,KAAS,GAAIyW,EAAM,GACnBzW,KAAS,GAAIyW,EAAM,GAGrBD,EAAQxU,UAAY,CAElB,GAAM,EACN,GAAM,EAON,KAAQ,WAEN,IAAIoU,EAAMpW,KAAU,MAEpB,OAAO,IAAIwW,EACTxW,KAAS,GAAIoW,EACbpW,KAAS,GAAIoW,IAQjB,IAAO,SAASH,EAAGC,GAEjB,IAAIO,EAAI,IAAID,EAAQP,EAAGC,GAGvB,OAAIlW,KAAiB,cAAOyW,EAAc,aACjCD,EAAa,IAIlBxW,KAAiB,cAAOyW,EAAc,aACjCD,EAAkB,SAGpB,IAAIA,EACTxW,KAAS,GAAIyW,EAAM,GACnBzW,KAAS,GAAIyW,EAAM,KAQvB,IAAO,SAASR,EAAGC,GAEjB,IAAIO,EAAI,IAAID,EAAQP,EAAGC,GAGvB,OAAIlW,KAAiB,cAAOyW,EAAc,aACjCD,EAAa,IAIlBxW,KAAiB,cAAOyW,EAAc,aACjCD,EAAkB,SAGpB,IAAIA,EACTxW,KAAS,GAAIyW,EAAM,GACnBzW,KAAS,GAAIyW,EAAM,KAQvB,IAAO,SAASR,EAAGC,GAEjB,IAAIO,EAAI,IAAID,EAAQP,EAAGC,GAGvB,OAAKlW,KAAiB,cAAOyW,EAAU,UAASzW,KAAa,UAAOyW,EAAc,aACzED,EAAa,IAIlBxW,KAAiB,cAAOyW,EAAc,aACjCD,EAAkB,SAIX,IAAZC,EAAM,IAA0B,IAAfzW,KAAS,GACrB,IAAIwW,EAAQxW,KAAS,GAAIyW,EAAM,GAAG,GAGpC,IAAID,EACTxW,KAAS,GAAIyW,EAAM,GAAIzW,KAAS,GAAIyW,EAAM,GAC1CzW,KAAS,GAAIyW,EAAM,GAAIzW,KAAS,GAAIyW,EAAM,KAQ9C,IAAO,SAASR,EAAGC,GAEjB,IAAIO,EAAI,IAAID,EAAQP,EAAGC,GAGvB,GAAKlW,KAAa,UAAOyW,EAAU,UAASzW,KAAiB,cAAOyW,EAAc,aAChF,OAAOD,EAAa,IAItB,GAAIxW,KAAiB,cAAOyW,EAAU,SACpC,OAAOD,EAAkB,SAI3B,GAAIxW,KAAa,UAAOyW,EAAc,aACpC,OAAOD,EAAc,KAGvBP,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEb,IAEIsB,EAAGiM,EAFH9M,EAAIgW,EAAM,GACV/V,EAAI+V,EAAM,GAGd,OAAI,IAAM/V,EAED,IAAI8V,EAAQP,EAAIxV,EAAGyV,EAAIzV,GAG5BgC,KAAK2T,IAAI3V,GAAKgC,KAAK2T,IAAI1V,GAKlB,IAAI8V,GACRP,GAJH1I,EAAI9M,EAAIC,GAIGwV,IAHX5U,EAAIb,EAAI8M,EAAI7M,IAITwV,EAAI3I,EAAI0I,GAAK3U,GAOT,IAAIkV,GACRP,EAAIC,GAJP3I,EAAI7M,EAAID,KACRa,EAAIZ,EAAI6M,EAAI9M,IAITyV,EAAID,EAAI1I,GAAKjM,IASpB,IAAO,SAAS2U,EAAGC,GAEjB,IAAIO,EAAI,IAAID,EAAQP,EAAGC,GAKvB,GAHAD,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAETyW,EAAU,SACZ,OAAOD,EAAa,IAItB,GAAgB,IAAZC,EAAM,GAAS,CAEjB,GAAU,IAANP,GAAWD,EAAI,EAEjB,OAAO,IAAIO,EAAQ/T,KAAK4U,IAAIpB,EAAGQ,EAAM,IAAI,GAEpC,GAAU,IAANR,EAET,QAASQ,EAAM,GAAI,EAAI,GAAK,GAC1B,KAAK,EACH,OAAO,IAAID,EAAQ/T,KAAK4U,IAAInB,EAAGO,EAAM,IAAI,GAC3C,KAAK,EACH,OAAO,IAAID,EAAQ,EAAG/T,KAAK4U,IAAInB,EAAGO,EAAM,KAC1C,KAAK,EACH,OAAO,IAAID,GAAS/T,KAAK4U,IAAInB,EAAGO,EAAM,IAAI,GAC5C,KAAK,EACH,OAAO,IAAID,EAAQ,GAAI/T,KAAK4U,IAAInB,EAAGO,EAAM,MAwBjD,GAAU,IAANR,GAAiB,IAANC,GAAWO,EAAM,GAAI,GAAKA,EAAM,IAAK,EAClD,OAAOD,EAAc,KAGvB,IAAIpF,EAAM3O,KAAK6U,MAAMpB,EAAGD,GACpBsB,EAAMvB,EAASC,EAAGC,GAItB,OAFAD,EAAIxT,KAAKmT,IAAIa,EAAM,GAAIc,EAAMd,EAAM,GAAIrF,GACvC8E,EAAIO,EAAM,GAAIc,EAAMd,EAAM,GAAIrF,EACvB,IAAIoF,EACTP,EAAIxT,KAAKmU,IAAIV,GACbD,EAAIxT,KAAKoU,IAAIX,KAQjB,KAAQ,WAEN,IAIIsB,EAAIC,EAJJxB,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GACbkB,EAAIlB,KAAU,MAIlB,GAAIiW,GAAK,EAAG,CAEV,GAAU,IAANC,EACF,OAAO,IAAIM,EAAQ/T,KAAKiV,KAAKzB,GAAI,GAGnCuB,EAAK,GAAM/U,KAAKiV,KAAK,GAAOxW,EAAI+U,SAEhCuB,EAAK/U,KAAK2T,IAAIF,GAAKzT,KAAKiV,KAAK,GAAKxW,EAAI+U,IASxC,OALEwB,EADExB,GAAK,EACF,GAAMxT,KAAKiV,KAAK,GAAOxW,EAAI+U,IAE3BxT,KAAK2T,IAAIF,GAAKzT,KAAKiV,KAAK,GAAKxW,EAAI+U,IAGjC,IAAIO,EAAQgB,EAAItB,EAAI,GAAKuB,EAAKA,IAQvC,IAAO,WAEL,IAAIE,EAAMlV,KAAKmT,IAAI5V,KAAS,IAK5B,OAHIA,KAAS,GAGN,IAAIwW,EACTmB,EAAMlV,KAAKmU,IAAI5W,KAAS,IACxB2X,EAAMlV,KAAKoU,IAAI7W,KAAS,MAW5B,MAAS,WAQP,IAAIiW,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,OAAO,IAAIwW,EACT/T,KAAKmV,MAAM3B,GAAKxT,KAAKmU,IAAIV,GAhiBnB,SAAS3I,GAEnB,IAAI2I,EAAIzT,KAAKoV,GAAK,EAClB,IAAK3B,EAAI3I,GAAKA,EAAI2I,EAChB,OAAOzT,KAAKmU,IAAIrJ,GAAK,EAevB,IAAIuK,EAAKvK,EAAIA,EACb,OAAOuK,GACLA,GACEA,GACEA,GACEA,GACEA,GACEA,GACEA,EAAK,cACH,EAAI,aACN,EAAI,WACN,EAAI,SACN,EAAI,OACN,EAAI,KACN,EAAI,IACN,IA8f8BC,CAAM7B,GACpCzT,KAAKmT,IAAIK,GAAKxT,KAAKoU,IAAIX,KAQ3B,IAAO,WAEL,IAAID,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAMjB,OAAO,IAAIwW,EACTR,EAASC,EAAGC,GACZzT,KAAK6U,MAAMpB,EAAGD,KAQlB,IAAO,WAEL,OAzhBiB1I,EAyhBJvN,KAAS,GAzhBFgY,EAyhBKhY,KAAS,GAvhBhCiW,EAAIxT,KAAK2T,IAAI7I,GACb2I,EAAIzT,KAAK2T,IAAI4B,GAEb/B,EAAI,KAAQC,EAAI,IACXzT,KAAKiV,KAAKzB,EAAIA,EAAIC,EAAIA,IAG3BD,EAAIC,GACND,EAAIC,EACJA,EAAI3I,EAAIyK,GAER9B,EAAI8B,EAAIzK,EAEH0I,EAAIxT,KAAKiV,KAAK,EAAIxB,EAAIA,IAfnB,IAAS3I,EAAGyK,EAElB/B,EACAC,GA8hBJ,IAAO,WAEL,OAAOzT,KAAK6U,MAAMtX,KAAS,GAAGA,KAAS,KAQzC,IAAO,WAKL,IAAIiW,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,OAAO,IAAIwW,EACT/T,KAAKoU,IAAIZ,GAAKN,EAAKO,GACnBzT,KAAKmU,IAAIX,GAAKJ,EAAKK,KAQvB,IAAO,WAKL,IAAID,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,OAAO,IAAIwW,EACT/T,KAAKmU,IAAIX,GAAKN,EAAKO,IAClBzT,KAAKoU,IAAIZ,GAAKJ,EAAKK,KAQxB,IAAO,WAOL,IAAID,EAAI,EAAIjW,KAAS,GACjBkW,EAAI,EAAIlW,KAAS,GACjBU,EAAI+B,KAAKmU,IAAIX,GAAKN,EAAKO,GAE3B,OAAO,IAAIM,EACT/T,KAAKoU,IAAIZ,GAAKvV,EACdmV,EAAKK,GAAKxV,IAQd,IAAO,WAIL,IAAIuV,EAAI,EAAIjW,KAAS,GACjBkW,EAAI,EAAIlW,KAAS,GACjBU,EAAI+B,KAAKmU,IAAIX,GAAKN,EAAKO,GAE3B,OAAO,IAAIM,GACR/T,KAAKoU,IAAIZ,GAAKvV,EACfmV,EAAKK,GAAKxV,IAQd,IAAO,WAIL,IAAIuV,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GACbU,EAAI,GAAMiV,EAAK,EAAIO,GAAK,GAAMzT,KAAKmU,IAAI,EAAIX,GAE/C,OAAO,IAAIO,EACT/T,KAAKmU,IAAIX,GAAKN,EAAKO,GAAKxV,EACxB+B,KAAKoU,IAAIZ,GAAKJ,EAAKK,GAAKxV,IAQ5B,IAAO,WAIL,IAAIuV,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GACbU,EAAI,GAAMiV,EAAK,EAAIO,GAAK,GAAMzT,KAAKmU,IAAI,EAAIX,GAE/C,OAAO,IAAIO,EACT/T,KAAKoU,IAAIZ,GAAKN,EAAKO,GAAKxV,GACvB+B,KAAKmU,IAAIX,GAAKJ,EAAKK,GAAKxV,IAQ7B,KAAQ,WAIN,IAAIuV,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEbiY,EAAK,IAAIzB,EACXN,EAAIA,EAAID,EAAIA,EAAI,GACf,EAAIA,EAAIC,GAAS,OAEhBgC,EAAK,IAAI1B,EACXyB,EAAO,GAAI/B,EACX+B,EAAO,GAAIhC,GAAQ,MAErB,OAAO,IAAIO,EAAQ0B,EAAO,IAAIA,EAAO,KAQvC,KAAQ,WAIN,IAAIjC,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEbiY,EAAK,IAAIzB,EACXN,EAAIA,EAAID,EAAIA,EAAI,GACf,EAAIA,EAAIC,GAAS,OAEhBgC,EAAK,IAAI1B,EACXyB,EAAO,GAAI/B,EACX+B,EAAO,GAAIhC,GAAQ,MAErB,OAAO,IAAIO,EAAQ/T,KAAKoV,GAAK,EAAIK,EAAO,GAAGA,EAAO,KAQpD,KAAQ,WAIN,IAAIjC,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,GAAU,IAANiW,EAAS,CAEX,GAAU,IAANC,EACF,OAAO,IAAIM,EAAQ,EAAG2B,KAGxB,IAAW,IAAPjC,EACF,OAAO,IAAIM,EAAQ,GAAI2B,KAI3B,IAAIzX,EAAIuV,EAAIA,GAAK,EAAMC,IAAM,EAAMA,GAE/B+B,EAAK,IAAIzB,GACV,EAAIN,EAAIA,EAAID,EAAIA,GAAKvV,GACrB,EAAIuV,EAAIvV,GAAG4V,MAEd,OAAO,IAAIE,GAAS,GAAMyB,EAAO,GAAG,GAAMA,EAAO,KAQnD,KAAQ,WAIN,IAAIhC,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,GAAU,IAANkW,EACF,OAAO,IAAIM,EAAQ/T,KAAK6U,MAAM,EAAGrB,GAAI,GAGvC,IAAIvV,EAAIuV,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANxV,EACJ,IAAI8V,EACJP,EAAIvV,GACHwV,EAAIxV,GAAG0X,OACR,IAAI5B,EACG,IAANP,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGkC,QAQ9B,KAAQ,WAIN,IAAInC,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,GAAU,IAANiW,GAAiB,IAANC,EACb,OAAO,IAAIM,EAAQ,EAAG2B,KAGxB,IAAIzX,EAAIuV,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANxV,EACJ,IAAI8V,EACJP,EAAIvV,GACHwV,EAAIxV,GAAG2X,OACR,IAAI7B,EACG,IAANP,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGmC,QAQ9B,KAAQ,WAIN,IAAIpC,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,GAAU,IAANiW,GAAiB,IAANC,EACb,OAAO,IAAIM,EAAQ/T,KAAKoV,GAAK,EAAGM,KAGlC,IAAIzX,EAAIuV,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANxV,EACJ,IAAI8V,EACJP,EAAIvV,GACHwV,EAAIxV,GAAG4X,OACR,IAAI9B,EACG,IAANP,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGoC,QAQ9B,KAAQ,WAIN,IAAIrC,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,OAAO,IAAIwW,EACTX,EAAKI,GAAKxT,KAAKmU,IAAIV,GACnBP,EAAKM,GAAKxT,KAAKoU,IAAIX,KAQvB,KAAQ,WAIN,IAAID,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,OAAO,IAAIwW,EACTb,EAAKM,GAAKxT,KAAKmU,IAAIV,GACnBL,EAAKI,GAAKxT,KAAKoU,IAAIX,KAQvB,KAAQ,WAIN,IAAID,EAAI,EAAIjW,KAAS,GACjBkW,EAAI,EAAIlW,KAAS,GACjBU,EAAIiV,EAAKM,GAAKxT,KAAKmU,IAAIV,GAE3B,OAAO,IAAIM,EACTX,EAAKI,GAAKvV,EACV+B,KAAKoU,IAAIX,GAAKxV,IAQlB,KAAQ,WAIN,IAAIuV,EAAI,EAAIjW,KAAS,GACjBkW,EAAI,EAAIlW,KAAS,GACjBU,EAAIiV,EAAKM,GAAKxT,KAAKmU,IAAIV,GAE3B,OAAO,IAAIM,EACTX,EAAKI,GAAKvV,GACT+B,KAAKoU,IAAIX,GAAKxV,IAQnB,KAAQ,WAIN,IAAIuV,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GACbU,EAAI+B,KAAKmU,IAAI,EAAIV,GAAKP,EAAK,EAAIM,GAEnC,OAAO,IAAIO,GACR,EAAIX,EAAKI,GAAKxT,KAAKmU,IAAIV,GAAKxV,EAC7B,EAAIiV,EAAKM,GAAKxT,KAAKoU,IAAIX,GAAKxV,IAQhC,KAAQ,WAIN,IAAIuV,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GACbU,EAAI+B,KAAKmU,IAAI,EAAIV,GAAKP,EAAK,EAAIM,GAEnC,OAAO,IAAIO,EACT,EAAIb,EAAKM,GAAKxT,KAAKmU,IAAIV,GAAKxV,GAC3B,EAAImV,EAAKI,GAAKxT,KAAKoU,IAAIX,GAAKxV,IAQjC,MAAS,WAIP,IAAIiX,EAAM3X,KAAS,GACnBA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAI2X,EACb,IAAIY,EAAMvY,KAAW,OAQrB,OANAA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAI2X,EACbA,EAAMY,EAAQ,GAEdA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIZ,EACLY,GAQT,MAAS,WAIP,IAAIA,EAAMvY,KAAW,OACrB,GAAIuY,EAAQ,IAAK,EAAG,CAClB,IAAIZ,EAAMY,EAAQ,GAClBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIZ,MACP,CACDA,EAAMY,EAAQ,GAClBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIZ,EAEd,OAAOY,GAQT,MAAS,WAIP,IAAItC,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEbwY,EAAOvC,EAAI,GAAW,IAANC,EAChBuC,EAAW,EAAIxC,EACfyC,EAAU,EAAIzC,EACdvV,EAAI+X,EAAWA,EAAWvC,EAAIA,EAE9B3I,EAAW,IAAN7M,EACL,IAAI8V,GACHkC,EAAUD,EAAWvC,EAAIA,GAAKxV,GAC9BwV,EAAIuC,EAAWC,EAAUxC,GAAKxV,GAC/B,IAAI8V,GACI,IAAPP,EAAaA,EAAI,EAAK,EAChB,IAANC,EAAYA,EAAI,EAAK,GAEtByC,EAAOpL,EAAM,GAMjB,OALAA,EAAM,GAAIyI,EAASzI,EAAM,GAAGA,EAAM,IAAK,EACvCA,EAAM,GAAI9K,KAAK6U,MAAM/J,EAAM,GAAGoL,GAAQ,EAClCH,IACFjL,EAAM,IAAKA,EAAM,IAEZA,GAQT,MAAS,WAIP,IAAI0I,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,GAAU,IAANiW,GAAiB,IAANC,EACb,OAAO,IAAIM,EAAQ,EAAG/T,KAAKoV,GAAK,GAGlC,IAAInX,EAAIuV,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANxV,EACJ,IAAI8V,EACJP,EAAIvV,GACHwV,EAAIxV,GAAGkY,QACR,IAAIpC,EACG,IAANP,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG0C,SAQ9B,MAAS,WAIP,IAAI3C,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,GAAU,IAANkW,EAEF,OAAO,IAAIM,EACF,IAANP,EACGxT,KAAK6T,IAAIL,EAAIxT,KAAKiV,KAAKzB,EAAIA,EAAI,IAC/BkC,IAAU,GAGlB,IAAIzX,EAAIuV,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANxV,EACJ,IAAI8V,EACJP,EAAIvV,GACHwV,EAAIxV,GAAGmY,QACR,IAAIrC,EACG,IAANP,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG2C,SAQ9B,MAAS,WAIP,IAAI5C,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEjB,GAAIA,KAAa,SACf,OAAOwW,EAAkB,SAG3B,IAAI9V,EAAIuV,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANxV,EACJ,IAAI8V,EACJP,EAAIvV,GACHwV,EAAIxV,GAAGoY,QACR,IAAItC,EACG,IAANP,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG4C,SAQ9B,QAAW,WAGT,GAAI9Y,KAAa,SACf,OAAOwW,EAAkB,SAG3B,GAAIxW,KAAiB,aACnB,OAAOwW,EAAc,KAGvB,IAAIP,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GAEbU,EAAIuV,EAAIA,EAAIC,EAAIA,EAEpB,OAAO,IAAIM,EAAQP,EAAIvV,GAAIwV,EAAIxV,IAQjC,UAAa,WAEX,OAAO,IAAI8V,EAAQxW,KAAS,IAAIA,KAAS,KAQ3C,IAAO,WAEL,OAAO,IAAIwW,GAASxW,KAAS,IAAIA,KAAS,KAQ5C,KAAQ,SAAS+Y,GAIf,OAFAA,EAAStW,KAAK4U,IAAI,GAAI0B,GAAU,GAEzB,IAAIvC,EACT/T,KAAKuW,KAAKhZ,KAAS,GAAI+Y,GAAUA,EACjCtW,KAAKuW,KAAKhZ,KAAS,GAAI+Y,GAAUA,IAQrC,MAAS,SAASA,GAIhB,OAFAA,EAAStW,KAAK4U,IAAI,GAAI0B,GAAU,GAEzB,IAAIvC,EACT/T,KAAKwW,MAAMjZ,KAAS,GAAI+Y,GAAUA,EAClCtW,KAAKwW,MAAMjZ,KAAS,GAAI+Y,GAAUA,IAQtC,MAAS,SAASA,GAIhB,OAFAA,EAAStW,KAAK4U,IAAI,GAAI0B,GAAU,GAEzB,IAAIvC,EACT/T,KAAKyW,MAAMlZ,KAAS,GAAI+Y,GAAUA,EAClCtW,KAAKyW,MAAMlZ,KAAS,GAAI+Y,GAAUA,IAUtC,OAAU,SAAS9C,EAAGC,GAEpB,IAAIO,EAAI,IAAID,EAAQP,EAAGC,GAEvB,OAAOzT,KAAK2T,IAAIK,EAAM,GAAIzW,KAAS,KAAMwW,EAAiB,SACxD/T,KAAK2T,IAAIK,EAAM,GAAIzW,KAAS,KAAMwW,EAAiB,SAQvD,MAAS,WAEP,OAAO,IAAIA,EAAQxW,KAAS,GAAGA,KAAS,KAQ1C,SAAY,WAEV,IAAIiW,EAAIjW,KAAS,GACbkW,EAAIlW,KAAS,GACbmZ,EAAM,GAEV,OAAInZ,KAAY,QACP,MAGLA,KAAiB,aACZ,YAGLyC,KAAK2T,IAAIH,GAAKO,EAAiB,UACjCP,EAAI,GAGFxT,KAAK2T,IAAIF,GAAKM,EAAiB,UACjCN,EAAI,GAII,IAANA,EACKiD,EAAMlD,GAGL,IAANA,GACFkD,GAAOlD,EACPkD,GAAO,IACHjD,EAAI,GACNA,GAAKA,EACLiD,GAAO,KAEPA,GAAO,IAETA,GAAO,KACEjD,EAAI,IACbA,GAAKA,EACLiD,GAAO,KAGL,IAAMjD,IACRiD,GAAOjD,GAEFiD,EAAM,OAQf,SAAY,WAEV,MAAO,CAACnZ,KAAS,GAAGA,KAAS,KAQ/B,QAAW,WAET,OAAmB,IAAfA,KAAS,GACJA,KAAS,GAEX,MAQT,MAAS,WACP,OAAOkX,MAAMlX,KAAS,KAAMkX,MAAMlX,KAAS,KAS7C,OAAU,WACR,OAAsB,IAAfA,KAAS,IAA0B,IAAfA,KAAS,IAStC,SAAY,WACV,OAAO2W,SAAS3W,KAAS,KAAM2W,SAAS3W,KAAS,KASnD,WAAc,WACZ,QAASA,KAAY,SAAOA,KAAe,cAI/CwW,EAAc,KAAI,IAAIA,EAAQ,EAAG,GACjCA,EAAa,IAAI,IAAIA,EAAQ,EAAG,GAChCA,EAAW,EAAI,IAAIA,EAAQ,EAAG,GAC9BA,EAAY,GAAI,IAAIA,EAAQ/T,KAAKoV,GAAI,GACrCrB,EAAW,EAAI,IAAIA,EAAQ/T,KAAK6O,EAAG,GACnCkF,EAAkB,SAAI,IAAIA,EAAQ2B,IAAUA,KAC5C3B,EAAa,IAAI,IAAIA,EAAQ1B,IAAKA,KAClC0B,EAAiB,QAAI,WAKlB,KAFU,EAAF,WACP,OAAOA,GACR,QAFM,OAEN,aAl2CL,I,gBCnCA,IAAI1T,EAAS,EAAQ,GACjBsW,EAAU,EAAQ,IAElBhP,EAAStH,EAAOsH,OAEpBvK,EAAOD,QAAU,SAAUoP,GACzB,GAA0B,WAAtBoK,EAAQpK,GAAwB,MAAM1F,UAAU,6CACpD,OAAOc,EAAO4E,K,gBCPhB,IAAIlM,EAAS,EAAQ,GACjBuW,EAAyB,EAAQ,IAEjCvY,EAASgC,EAAOhC,OAIpBjB,EAAOD,QAAU,SAAUoP,GACzB,OAAOlO,EAAOuY,EAAuBrK,M,gBCRvC,IAAIlM,EAAS,EAAQ,GACjB2E,EAAa,EAAQ,IACrByH,EAAS,EAAQ,IACjBhL,EAA8B,EAAQ,IACtCO,EAAY,EAAQ,KACpBmD,EAAgB,EAAQ,IACxBY,EAAsB,EAAQ,IAC9B8Q,EAA6B,EAAQ,IAA8BC,aAEnExQ,EAAmBP,EAAoBvH,IACvCuY,EAAuBhR,EAAoBiR,QAC3CC,EAAWtP,OAAOA,QAAQ8K,MAAM,WAEnCrV,EAAOD,QAAU,SAAU4Q,EAAG7O,EAAKN,EAAOuD,GACzC,IAIIoG,EAJAzI,IAASqC,KAAYA,EAAQrC,OAC7BoX,IAAS/U,KAAYA,EAAQ5D,WAC7BqE,IAAcT,KAAYA,EAAQS,YAClC1E,EAAOiE,QAA4Bd,IAAjBc,EAAQjE,KAAqBiE,EAAQjE,KAAOgB,EAE9D8F,EAAWpG,KACoB,YAA7B+I,OAAOzJ,GAAMyP,MAAM,EAAG,KACxBzP,EAAO,IAAMyJ,OAAOzJ,GAAMiZ,QAAQ,qBAAsB,MAAQ,OAE7D1K,EAAO7N,EAAO,SAAYiY,GAA8BjY,EAAMV,OAASA,IAC1EuD,EAA4B7C,EAAO,OAAQV,IAE7CqK,EAAQwO,EAAqBnY,IAClBwD,SACTmG,EAAMnG,OAAS6U,EAAS9K,KAAoB,iBAARjO,EAAmBA,EAAO,MAG9D6P,IAAM1N,GAIEP,GAEA8C,GAAemL,EAAE7O,KAC3BgY,GAAS,UAFFnJ,EAAE7O,GAIPgY,EAAQnJ,EAAE7O,GAAON,EAChB6C,EAA4BsM,EAAG7O,EAAKN,IATnCsY,EAAQnJ,EAAE7O,GAAON,EAChBoD,EAAU9C,EAAKN,KAUrB0B,SAASf,UAAW,YAAY,WACjC,OAAOyF,EAAWzH,OAAS+I,EAAiB/I,MAAM6E,QAAU+C,EAAc5H,U,6BC3C5E,IAAIoD,EAAI,EAAQ,GACZyW,EAAU,EAAQ,IAAgCC,OAQtD1W,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,QAPC,EAAQ,GAEjBC,CAA6B,WAKW,CAChEoW,OAAQ,SAAgBnW,GACtB,OAAOkW,EAAQ7Z,KAAM2D,EAAYC,UAAUC,OAAS,EAAID,UAAU,QAAKE,O,6BCX3E,IAAIV,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjBoE,EAAa,EAAQ,IACrBN,EAAQ,EAAQ,IAChBrG,EAAO,EAAQ,IACfgF,EAAc,EAAQ,GACtB0B,EAAU,EAAQ,IAClB8G,EAAc,EAAQ,IACtBqB,EAAgB,EAAQ,KACxBvJ,EAAQ,EAAQ,GAChBqJ,EAAS,EAAQ,IACjBS,EAAU,EAAQ,IAClBlI,EAAa,EAAQ,IACrBC,EAAW,EAAQ,IACnB/B,EAAgB,EAAQ,IACxBiO,EAAW,EAAQ,IACnBlO,EAAW,EAAQ,IACnBiL,EAAW,EAAQ,IACnBlC,EAAkB,EAAQ,IAC1BiD,EAAgB,EAAQ,IACxB9L,EAAY,EAAQ,IACpBmU,EAA2B,EAAQ,IACnCC,EAAqB,EAAQ,IAC7BC,EAAa,EAAQ,KACrBC,EAA4B,EAAQ,IACpCC,EAA8B,EAAQ,KACtCC,EAA8B,EAAQ,KACtCC,EAAiC,EAAQ,IACzCC,EAAuB,EAAQ,IAC/BC,EAAyB,EAAQ,KACjCC,EAA6B,EAAQ,KACrCrG,EAAa,EAAQ,KACrB9R,EAAW,EAAQ,IACnB4M,EAAS,EAAQ,IACjBwL,EAAY,EAAQ,IACpBC,EAAa,EAAQ,IACrBvL,EAAM,EAAQ,IACd1G,EAAkB,EAAQ,IAC1BkS,EAA+B,EAAQ,KACvCC,EAAwB,EAAQ,KAChCtT,EAAiB,EAAQ,IACzBkB,EAAsB,EAAQ,IAC9BqS,EAAW,EAAQ,IAAgC5W,QAEnD6W,EAASL,EAAU,UAGnBM,EAAetS,EAAgB,eAE/BQ,EAAmBT,EAAoBP,IACvCc,EAAmBP,EAAoBQ,UAL9B,UAOTgS,EAAkBla,OAAgB,UAClCma,EAAUnY,EAAO3B,OACjB+Z,EAAkBD,GAAWA,EAAiB,UAC9C3R,EAAYxG,EAAOwG,UACnB6R,GAAUrY,EAAOqY,QACjBC,GAAalU,EAAW,OAAQ,aAChCmU,GAAiChB,EAA+B7V,EAChE8W,GAAuBhB,EAAqB9V,EAC5C+W,GAA4BpB,EAA4B3V,EACxDgX,GAA6BhB,EAA2BhW,EACxDiX,GAAOlW,EAAY,GAAGkW,MAEtBC,GAAazM,EAAO,WACpB0M,GAAyB1M,EAAO,cAChC2M,GAAyB3M,EAAO,6BAChC4M,GAAyB5M,EAAO,6BAChCK,GAAwBL,EAAO,OAG/B6M,IAAcX,KAAYA,GAAiB,YAAMA,GAAiB,UAAEY,UAGpEC,GAAsBjO,GAAelI,GAAM,WAC7C,OAES,GAFFmU,EAAmBsB,GAAqB,GAAI,IAAK,CACtDra,IAAK,WAAc,OAAOqa,GAAqBtb,KAAM,IAAK,CAAEqB,MAAO,IAAK4U,MACtEA,KACD,SAAUzF,EAAGqB,EAAGC,GACnB,IAAImK,EAA4BZ,GAA+BL,EAAiBnJ,GAC5EoK,UAAkCjB,EAAgBnJ,GACtDyJ,GAAqB9K,EAAGqB,EAAGC,GACvBmK,GAA6BzL,IAAMwK,GACrCM,GAAqBN,EAAiBnJ,EAAGoK,IAEzCX,GAEAlO,GAAO,SAAU8O,EAAKxM,GACxB,IAAIyM,EAAST,GAAWQ,GAAOlC,EAAmBkB,GAOlD,OANAjS,EAAiBkT,EAAQ,CACvBrP,KA7CS,SA8CToP,IAAKA,EACLxM,YAAaA,IAEV3B,IAAaoO,EAAOzM,YAAcA,GAChCyM,GAGLxK,GAAkB,SAAwBnB,EAAGqB,EAAGC,GAC9CtB,IAAMwK,GAAiBrJ,GAAgBgK,GAAwB9J,EAAGC,GACtEpM,EAAS8K,GACT,IAAI7O,EAAM+P,EAAcG,GAExB,OADAnM,EAASoM,GACL5C,EAAOwM,GAAY/Z,IAChBmQ,EAAW9Q,YAIVkO,EAAOsB,EAAGsK,IAAWtK,EAAEsK,GAAQnZ,KAAM6O,EAAEsK,GAAQnZ,IAAO,GAC1DmQ,EAAakI,EAAmBlI,EAAY,CAAE9Q,WAAY+Y,EAAyB,GAAG,OAJjF7K,EAAOsB,EAAGsK,IAASQ,GAAqB9K,EAAGsK,EAAQf,EAAyB,EAAG,KACpFvJ,EAAEsK,GAAQnZ,IAAO,GAIVqa,GAAoBxL,EAAG7O,EAAKmQ,IAC9BwJ,GAAqB9K,EAAG7O,EAAKmQ,IAGpCsK,GAAoB,SAA0B5L,EAAG6L,GACnD3W,EAAS8K,GACT,IAAI8L,EAAa7N,EAAgB4N,GAC7BrJ,EAAOiH,EAAWqC,GAAYtL,OAAOuL,GAAuBD,IAIhE,OAHAzB,EAAS7H,GAAM,SAAUrR,GAClBoM,IAAexN,EAAKic,GAAuBF,EAAY3a,IAAMgQ,GAAgBnB,EAAG7O,EAAK2a,EAAW3a,OAEhG6O,GAOLgM,GAAwB,SAA8BC,GACxD,IAAI5K,EAAIH,EAAc+K,GAClBzb,EAAaT,EAAKib,GAA4Bxb,KAAM6R,GACxD,QAAI7R,OAASgb,GAAmB9L,EAAOwM,GAAY7J,KAAO3C,EAAOyM,GAAwB9J,QAClF7Q,IAAekO,EAAOlP,KAAM6R,KAAO3C,EAAOwM,GAAY7J,IAAM3C,EAAOlP,KAAM8a,IAAW9a,KAAK8a,GAAQjJ,KACpG7Q,IAGF4Q,GAA4B,SAAkCpB,EAAGqB,GACnE,IAAIrP,EAAKiM,EAAgB+B,GACrB7O,EAAM+P,EAAcG,GACxB,GAAIrP,IAAOwY,IAAmB9L,EAAOwM,GAAY/Z,IAASuN,EAAOyM,GAAwBha,GAAzF,CACA,IAAIqD,EAAaqW,GAA+B7Y,EAAIb,GAIpD,OAHIqD,IAAckK,EAAOwM,GAAY/Z,IAAUuN,EAAO1M,EAAIsY,IAAWtY,EAAGsY,GAAQnZ,KAC9EqD,EAAWhE,YAAa,GAEnBgE,IAGL0X,GAAuB,SAA6BlM,GACtD,IAAImM,EAAQpB,GAA0B9M,EAAgB+B,IAClDvF,EAAS,GAIb,OAHA4P,EAAS8B,GAAO,SAAUhb,GACnBuN,EAAOwM,GAAY/Z,IAASuN,EAAOwL,EAAY/Y,IAAM8Z,GAAKxQ,EAAQtJ,MAElEsJ,GAGLsR,GAAyB,SAA+B/L,GAC1D,IAAIoM,EAAsBpM,IAAMwK,EAC5B2B,EAAQpB,GAA0BqB,EAAsBjB,GAAyBlN,EAAgB+B,IACjGvF,EAAS,GAMb,OALA4P,EAAS8B,GAAO,SAAUhb,IACpBuN,EAAOwM,GAAY/Z,IAAUib,IAAuB1N,EAAO8L,EAAiBrZ,IAC9E8Z,GAAKxQ,EAAQyQ,GAAW/Z,OAGrBsJ,IAKJmE,IAgBH/M,EAFA6Y,GAbAD,EAAU,WACR,GAAItV,EAAcuV,EAAiBlb,MAAO,MAAMsJ,EAAU,+BAC1D,IAAIoG,EAAe9L,UAAUC,aAA2BC,IAAjBF,UAAU,GAA+BgC,EAAUhC,UAAU,SAAhCE,EAChEoY,EAAM/M,EAAIO,GACVmN,EAAS,SAAUxb,GACjBrB,OAASgb,GAAiBza,EAAKsc,EAAQlB,GAAwBta,GAC/D6N,EAAOlP,KAAM8a,IAAW5L,EAAOlP,KAAK8a,GAASoB,KAAMlc,KAAK8a,GAAQoB,IAAO,GAC3EF,GAAoBhc,KAAMkc,EAAKnC,EAAyB,EAAG1Y,KAG7D,OADI0M,GAAe+N,IAAYE,GAAoBhB,EAAiBkB,EAAK,CAAE7N,cAAc,EAAMpG,IAAK4U,IAC7FzP,GAAK8O,EAAKxM,KAGgB,UAET,YAAY,WACpC,OAAO3G,EAAiB/I,MAAMkc,OAGhC7Z,EAAS4Y,EAAS,iBAAiB,SAAUvL,GAC3C,OAAOtC,GAAK+B,EAAIO,GAAcA,MAGhC8K,EAA2BhW,EAAIgY,GAC/BlC,EAAqB9V,EAAImN,GACzB4I,EAAuB/V,EAAI4X,GAC3B/B,EAA+B7V,EAAIoN,GACnCsI,EAA0B1V,EAAI2V,EAA4B3V,EAAIkY,GAC9DtC,EAA4B5V,EAAI+X,GAEhC5B,EAA6BnW,EAAI,SAAU7D,GACzC,OAAOyM,GAAK3E,EAAgB9H,GAAOA,IAGjCoN,IAEFuN,GAAqBJ,EAAiB,cAAe,CACnD7M,cAAc,EACdpN,IAAK,WACH,OAAO8H,EAAiB/I,MAAM0P,eAG7BzI,GACH5E,EAAS2Y,EAAiB,uBAAwBwB,GAAuB,CAAEja,QAAQ,MAKzFa,EAAE,CAAEN,QAAQ,EAAMsK,MAAM,EAAM3J,QAAS2L,EAAe9J,MAAO8J,GAAiB,CAC5EjO,OAAQ8Z,IAGVJ,EAASZ,EAAW3K,KAAwB,SAAU3O,GACpDia,EAAsBja,MAGxByC,EAAE,CAAEG,OAtLS,SAsLO6B,MAAM,EAAM3B,QAAS2L,GAAiB,CAGxD,IAAO,SAAUzN,GACf,IAAImb,EAASlX,EAAUjE,GACvB,GAAIuN,EAAO0M,GAAwBkB,GAAS,OAAOlB,GAAuBkB,GAC1E,IAAIX,EAASlB,EAAQ6B,GAGrB,OAFAlB,GAAuBkB,GAAUX,EACjCN,GAAuBM,GAAUW,EAC1BX,GAITY,OAAQ,SAAgBC,GACtB,IAAKpJ,EAASoJ,GAAM,MAAM1T,EAAU0T,EAAM,oBAC1C,GAAI9N,EAAO2M,GAAwBmB,GAAM,OAAOnB,GAAuBmB,IAEzEC,UAAW,WAAcnB,IAAa,GACtCoB,UAAW,WAAcpB,IAAa,KAGxC1Y,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAM3B,QAAS2L,EAAe9J,MAAOyI,GAAe,CAG9ErM,OA/HY,SAAgB8O,EAAG6L,GAC/B,YAAsBvY,IAAfuY,EAA2BrC,EAAmBxJ,GAAK4L,GAAkBpC,EAAmBxJ,GAAI6L,IAiInGtb,eAAgB4Q,GAGhBwL,iBAAkBf,GAGlB7X,yBAA0BqN,KAG5BxO,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAM3B,QAAS2L,GAAiB,CAG1D0E,oBAAqB4I,GAGrBU,sBAAuBb,KAKzBnZ,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAM3B,OAAQoC,GAAM,WAAcuU,EAA4B5V,EAAE,OAAU,CACpG4Y,sBAAuB,SAA+B5a,GACpD,OAAO4X,EAA4B5V,EAAEmM,EAASnO,OAM9C4Y,KAWFhY,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,QAVH2L,GAAiBvJ,GAAM,WAClD,IAAIsW,EAASlB,IAEb,MAA+B,UAAxBG,GAAW,CAACe,KAEe,MAA7Bf,GAAW,CAAEnF,EAAGkG,KAEc,MAA9Bf,GAAWta,OAAOqb,QAGwC,CAE/DkB,UAAW,SAAmB7a,EAAI8a,EAAUC,GAC1C,IAAIC,EAAOrJ,EAAWvQ,WAClB6Z,EAAYH,EAChB,IAAK5V,EAAS4V,SAAoBxZ,IAAPtB,KAAoBoR,EAASpR,GAMxD,OALKmN,EAAQ2N,KAAWA,EAAW,SAAU3b,EAAKN,GAEhD,GADIoG,EAAWgW,KAAYpc,EAAQd,EAAKkd,EAAWzd,KAAM2B,EAAKN,KACzDuS,EAASvS,GAAQ,OAAOA,IAE/Bmc,EAAK,GAAKF,EACH1W,EAAMwU,GAAY,KAAMoC,MAOrC,IAAKtC,EAAgBH,GAAe,CAClC,IAAI2C,GAAUxC,EAAgBwC,QAE9Brb,EAAS6Y,EAAiBH,GAAc,SAAU4C,GAEhD,OAAOpd,EAAKmd,GAAS1d,SAKzBsH,EAAe2T,EApRF,UAsRbP,EAAWI,IAAU,G,cCpUrBjb,EAAOD,QAAU,WAChB,MAAM,IAAIge,MAAM,oC,gBCAjB,IAAIpP,EAAgB,EAAQ,KACxB6K,EAAyB,EAAQ,IAErCxZ,EAAOD,QAAU,SAAU4C,GACzB,OAAOgM,EAAc6K,EAAuB7W,M,6BCJ9C,IAAIY,EAAI,EAAQ,GACZmC,EAAc,EAAQ,GACtBiC,EAAY,EAAQ,IACpBmJ,EAAW,EAAQ,IACnBb,EAAoB,EAAQ,IAC5BxN,EAAW,EAAQ,IACnBuD,EAAQ,EAAQ,GAChBgY,EAAe,EAAQ,KACvBnP,EAAsB,EAAQ,KAC9BoP,EAAK,EAAQ,KACbC,EAAa,EAAQ,KACrBC,EAAK,EAAQ,IACbC,EAAS,EAAQ,KAEjB5T,EAAO,GACP6T,EAAU3Y,EAAY8E,EAAK8T,MAC3B1C,EAAOlW,EAAY8E,EAAKoR,MAGxB2C,EAAqBvY,GAAM,WAC7BwE,EAAK8T,UAAKra,MAGRua,EAAgBxY,GAAM,WACxBwE,EAAK8T,KAAK,SAGRrP,EAAgBJ,EAAoB,QAEpC4P,GAAezY,GAAM,WAEvB,GAAImY,EAAI,OAAOA,EAAK,GACpB,KAAIF,GAAMA,EAAK,GAAf,CACA,GAAIC,EAAY,OAAO,EACvB,GAAIE,EAAQ,OAAOA,EAAS,IAE5B,IACIpJ,EAAM0J,EAAKld,EAAOuM,EADlB3C,EAAS,GAIb,IAAK4J,EAAO,GAAIA,EAAO,GAAIA,IAAQ,CAGjC,OAFA0J,EAAMnU,OAAOoU,aAAa3J,GAElBA,GACN,KAAK,GAAI,KAAK,GAAI,KAAK,GAAI,KAAK,GAAIxT,EAAQ,EAAG,MAC/C,KAAK,GAAI,KAAK,GAAIA,EAAQ,EAAG,MAC7B,QAASA,EAAQ,EAGnB,IAAKuM,EAAQ,EAAGA,EAAQ,GAAIA,IAC1BvD,EAAKoR,KAAK,CAAEhL,EAAG8N,EAAM3Q,EAAO6Q,EAAGpd,IAMnC,IAFAgJ,EAAK8T,MAAK,SAAUlI,EAAGC,GAAK,OAAOA,EAAEuI,EAAIxI,EAAEwI,KAEtC7Q,EAAQ,EAAGA,EAAQvD,EAAKxG,OAAQ+J,IACnC2Q,EAAMlU,EAAKuD,GAAO6C,EAAEiO,OAAO,GACvBzT,EAAOyT,OAAOzT,EAAOpH,OAAS,KAAO0a,IAAKtT,GAAUsT,GAG1D,MAAkB,gBAAXtT,MAgBT7H,EAAE,CAAEG,OAAQ,QAASC,OAAO,EAAMC,OAbrB2a,IAAuBC,IAAkBvP,IAAkBwP,GAapB,CAClDH,KAAM,SAAcQ,QACA7a,IAAd6a,GAAyBnX,EAAUmX,GAEvC,IAAI5N,EAAQJ,EAAS3Q,MAErB,GAAIse,EAAa,YAAqBxa,IAAd6a,EAA0BT,EAAQnN,GAASmN,EAAQnN,EAAO4N,GAElF,IAEIC,EAAahR,EAFbiR,EAAQ,GACRC,EAAchP,EAAkBiB,GAGpC,IAAKnD,EAAQ,EAAGA,EAAQkR,EAAalR,IAC/BA,KAASmD,GAAO0K,EAAKoD,EAAO9N,EAAMnD,IAQxC,IALAiQ,EAAagB,EA3BI,SAAUF,GAC7B,OAAO,SAAUpR,EAAGyK,GAClB,YAAUlU,IAANkU,GAAyB,OACnBlU,IAANyJ,EAAwB,OACVzJ,IAAd6a,GAAiCA,EAAUpR,EAAGyK,IAAM,EACjD1V,EAASiL,GAAKjL,EAAS0V,GAAK,GAAK,GAsBpB+G,CAAeJ,IAEnCC,EAAcC,EAAMhb,OACpB+J,EAAQ,EAEDA,EAAQgR,GAAa7N,EAAMnD,GAASiR,EAAMjR,KACjD,KAAOA,EAAQkR,UAAoB/N,EAAMnD,KAEzC,OAAOmD,M,6BCrGX,IAAI2N,EAAS,EAAQ,KAAiCA,OAClDpc,EAAW,EAAQ,IACnBkG,EAAsB,EAAQ,IAC9BmK,EAAiB,EAAQ,KAGzB1J,EAAmBT,EAAoBP,IACvCc,EAAmBP,EAAoBQ,UAFrB,mBAMtB2J,EAAevI,OAAQ,UAAU,SAAUwI,GACzC3J,EAAiBjJ,KAAM,CACrB8M,KARkB,kBASlBgQ,OAAQxa,EAASsQ,GACjBhF,MAAO,OAIR,WACD,IAGIoR,EAHAhU,EAAQjC,EAAiB/I,MACzB8c,EAAS9R,EAAM8R,OACflP,EAAQ5C,EAAM4C,MAElB,OAAIA,GAASkP,EAAOjZ,OAAe,CAAExC,WAAOyC,EAAW4I,MAAM,IAC7DsS,EAAQN,EAAO5B,EAAQlP,GACvB5C,EAAM4C,OAASoR,EAAMnb,OACd,CAAExC,MAAO2d,EAAOtS,MAAM,Q,gBC5B/B,IAAInH,EAAc,EAAQ,GAEtBjD,EAAWiD,EAAY,GAAGjD,UAC1B2c,EAAc1Z,EAAY,GAAG6K,OAEjCvQ,EAAOD,QAAU,SAAU4C,GACzB,OAAOyc,EAAY3c,EAASE,GAAK,GAAI,K,gBCNvC,IAaIyF,EAAKhH,EAAKie,EAbVC,EAAkB,EAAQ,KAC1Brc,EAAS,EAAQ,GACjByC,EAAc,EAAQ,GACtBmC,EAAW,EAAQ,IACnBxD,EAA8B,EAAQ,IACtCgL,EAAS,EAAQ,IACjBD,EAAS,EAAQ,KACjBwL,EAAY,EAAQ,IACpBC,EAAa,EAAQ,IAGrBpR,EAAYxG,EAAOwG,UACnB8V,EAAUtc,EAAOsc,QAgBrB,GAAID,GAAmBlQ,EAAOjE,MAAO,CACnC,IAAIqU,EAAQpQ,EAAOjE,QAAUiE,EAAOjE,MAAQ,IAAIoU,GAC5CE,EAAQ/Z,EAAY8Z,EAAMpe,KAC1Bse,EAAQha,EAAY8Z,EAAMH,KAC1BM,EAAQja,EAAY8Z,EAAMpX,KAC9BA,EAAM,SAAUzF,EAAIid,GAClB,GAAIF,EAAMF,EAAO7c,GAAK,MAAM,IAAI8G,EAxBH,8BA2B7B,OAFAmW,EAASrT,OAAS5J,EAClBgd,EAAMH,EAAO7c,EAAIid,GACVA,GAETxe,EAAM,SAAUuB,GACd,OAAO8c,EAAMD,EAAO7c,IAAO,IAE7B0c,EAAM,SAAU1c,GACd,OAAO+c,EAAMF,EAAO7c,QAEjB,CACL,IAAIkd,EAAQjF,EAAU,SACtBC,EAAWgF,IAAS,EACpBzX,EAAM,SAAUzF,EAAIid,GAClB,GAAIvQ,EAAO1M,EAAIkd,GAAQ,MAAM,IAAIpW,EAvCJ,8BA0C7B,OAFAmW,EAASrT,OAAS5J,EAClB0B,EAA4B1B,EAAIkd,EAAOD,GAChCA,GAETxe,EAAM,SAAUuB,GACd,OAAO0M,EAAO1M,EAAIkd,GAASld,EAAGkd,GAAS,IAEzCR,EAAM,SAAU1c,GACd,OAAO0M,EAAO1M,EAAIkd,IAItB7f,EAAOD,QAAU,CACfqI,IAAKA,EACLhH,IAAKA,EACLie,IAAKA,EACLzF,QAnDY,SAAUjX,GACtB,OAAO0c,EAAI1c,GAAMvB,EAAIuB,GAAMyF,EAAIzF,EAAI,KAmDnCwG,UAhDc,SAAU2W,GACxB,OAAO,SAAUnd,GACf,IAAIwI,EACJ,IAAKtD,EAASlF,KAAQwI,EAAQ/J,EAAIuB,IAAKsK,OAAS6S,EAC9C,MAAMrW,EAAU,0BAA4BqW,EAAO,aACnD,OAAO3U,M,gBCxBb,IAAI4U,EAAW,EAAQ,IAIvB/f,EAAOD,QAAU,SAAUqD,GACzB,OAAO2c,EAAS3c,EAAIY,U,gBCLtB,IAAIT,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjBoE,EAAa,EAAQ,IACrBN,EAAQ,EAAQ,IAChBrB,EAAc,EAAQ,GACtBM,EAAQ,EAAQ,GAEhBqK,EAAQpN,EAAOoN,MACfkL,EAAalU,EAAW,OAAQ,aAChCV,EAAOjB,EAAY,IAAIiB,MACvBkY,EAASnZ,EAAY,GAAGmZ,QACxBtK,EAAa7O,EAAY,GAAG6O,YAC5BwF,EAAUrU,EAAY,GAAGqU,SACzBiG,EAAiBta,EAAY,GAAIjD,UAEjCwd,EAAS,mBACTC,EAAM,oBACNC,EAAK,oBAELC,EAAM,SAAUlJ,EAAOmJ,EAAQpD,GACjC,IAAIqD,EAAOzB,EAAO5B,EAAQoD,EAAS,GAC/BE,EAAO1B,EAAO5B,EAAQoD,EAAS,GACnC,OAAK1Z,EAAKuZ,EAAKhJ,KAAWvQ,EAAKwZ,EAAII,IAAW5Z,EAAKwZ,EAAIjJ,KAAWvQ,EAAKuZ,EAAKI,GACnE,MAAQN,EAAezL,EAAW2C,EAAO,GAAI,IAC7CA,GAGP9M,EAASpE,GAAM,WACjB,MAAsC,qBAA/BuV,EAAW,iBACY,cAAzBA,EAAW,aAGdA,GAIFhY,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,OAAQwG,GAAU,CAEhDoT,UAAW,SAAmB7a,EAAI8a,EAAUC,GAC1C,IAAK,IAAInd,EAAI,EAAGC,EAAIuD,UAAUC,OAAQ2Z,EAAOtN,EAAM7P,GAAID,EAAIC,EAAGD,IAAKod,EAAKpd,GAAKwD,UAAUxD,GACvF,IAAI6K,EAASrE,EAAMwU,EAAY,KAAMoC,GACrC,MAAwB,iBAAVvS,EAAqB2O,EAAQ3O,EAAQ6U,EAAQG,GAAOhV,M,6BCvCxE,EAAQ,IACR,IAQMoV,EACA7I,EATFpU,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjBvC,EAAO,EAAQ,IACfgF,EAAc,EAAQ,GACtBkC,EAAa,EAAQ,IACrBC,EAAW,EAAQ,IAEnB4Y,GACED,GAAa,GACb7I,EAAK,QACNhR,KAAO,WAER,OADA6Z,GAAa,EACN,IAAI7Z,KAAKI,MAAM5G,KAAM4D,aAEJ,IAAnB4T,EAAGnN,KAAK,QAAmBgW,GAGhCzC,EAAQ9a,EAAO8a,MACf2C,EAAUhb,EAAY,IAAI8E,MAI9BjH,EAAE,CAAEG,OAAQ,SAAUC,OAAO,EAAMC,QAAS6c,GAAqB,CAC/DjW,KAAM,SAAUmW,GACd,IAAIha,EAAOxG,KAAKwG,KAChB,IAAKiB,EAAWjB,GAAO,OAAO+Z,EAAQvgB,KAAMwgB,GAC5C,IAAIvV,EAAS1K,EAAKiG,EAAMxG,KAAMwgB,GAC9B,GAAe,OAAXvV,IAAoBvD,EAASuD,GAC/B,MAAM,IAAI2S,EAAM,sEAElB,QAAS3S,M,gBCjCb,IAEI3B,EAFS,EAAQ,GAEEA,UAIvBzJ,EAAOD,QAAU,SAAU4C,GACzB,GAAUsB,MAANtB,EAAiB,MAAM8G,EAAU,wBAA0B9G,GAC/D,OAAOA,I,gBCRT,IAAIM,EAAS,EAAQ,GACjB2E,EAAa,EAAQ,IAErBgZ,EAAY,SAAUzR,GACxB,OAAOvH,EAAWuH,GAAYA,OAAWlL,GAG3CjE,EAAOD,QAAU,SAAU8gB,EAAWC,GACpC,OAAO/c,UAAUC,OAAS,EAAI4c,EAAU3d,EAAO4d,IAAc5d,EAAO4d,IAAc5d,EAAO4d,GAAWC,K,6BCPtG,IAAI/Z,EAAQ,EAAQ,IAChBrG,EAAO,EAAQ,IACfgF,EAAc,EAAQ,GACtBqb,EAAgC,EAAQ,KACxCC,EAAW,EAAQ,KACnBnb,EAAW,EAAQ,IACnB2T,EAAyB,EAAQ,IACjCtR,EAAqB,EAAQ,KAC7B+Y,EAAqB,EAAQ,KAC7BlB,EAAW,EAAQ,IACnBtd,EAAW,EAAQ,IACnBye,EAAY,EAAQ,IACpB5M,EAAa,EAAQ,KACrB6M,EAAiB,EAAQ,KACzBC,EAAa,EAAQ,KACrBC,EAAgB,EAAQ,IACxBrb,EAAQ,EAAQ,GAEhBsb,EAAgBD,EAAcC,cAE9BjO,EAAMzQ,KAAKyQ,IACXkO,EAAQ,GAAG3F,KACXjV,EAAOjB,EAAY,IAAIiB,MACvBiV,EAAOlW,EAAY6b,GACnBnC,EAAc1Z,EAAY,GAAG6K,OAcjCwQ,EAA8B,SAAS,SAAUS,EAAOC,EAAaC,GACnE,IAAIC,EAqDJ,OAzCEA,EAV2B,KAA3B,OAAOtM,MAAM,QAAQ,IAEc,GAAnC,OAAOA,MAAM,QAAS,GAAGrR,QACO,GAAhC,KAAKqR,MAAM,WAAWrR,QACU,GAAhC,IAAIqR,MAAM,YAAYrR,QAEtB,IAAIqR,MAAM,QAAQrR,OAAS,GAC3B,GAAGqR,MAAM,MAAMrR,OAGC,SAAUkL,EAAW0S,GACnC,IAAI3E,EAASxa,EAAS+W,EAAuBrZ,OACzC0hB,OAAgB5d,IAAV2d,EAlCC,WAkCkCA,IAAU,EACvD,GAAY,IAARC,EAAW,MAAO,GACtB,QAAkB5d,IAAdiL,EAAyB,MAAO,CAAC+N,GAErC,IAAK+D,EAAS9R,GACZ,OAAOxO,EAAK+gB,EAAaxE,EAAQ/N,EAAW2S,GAW9C,IATA,IAQI3K,EAAO4K,EAAWC,EARlBC,EAAS,GACTzb,GAAS2I,EAAU+S,WAAa,IAAM,KAC7B/S,EAAUgT,UAAY,IAAM,KAC5BhT,EAAUiT,QAAU,IAAM,KAC1BjT,EAAUkT,OAAS,IAAM,IAClCC,EAAgB,EAEhBC,EAAgB,IAAInc,OAAO+I,EAAUlK,OAAQuB,EAAQ,MAElD2Q,EAAQxW,EAAK0gB,EAAYkB,EAAerF,QAC7C6E,EAAYQ,EAAcR,WACVO,IACdzG,EAAKoG,EAAQ5C,EAAYnC,EAAQoF,EAAenL,EAAMnJ,QAClDmJ,EAAMlT,OAAS,GAAKkT,EAAMnJ,MAAQkP,EAAOjZ,QAAQ+C,EAAMwa,EAAOS,EAAQ1N,EAAW4C,EAAO,IAC5F6K,EAAa7K,EAAM,GAAGlT,OACtBqe,EAAgBP,EACZE,EAAOhe,QAAU6d,KAEnBS,EAAcR,YAAc5K,EAAMnJ,OAAOuU,EAAcR,YAK7D,OAHIO,IAAkBpF,EAAOjZ,QACvB+d,GAAepb,EAAK2b,EAAe,KAAK1G,EAAKoG,EAAQ,IACpDpG,EAAKoG,EAAQ5C,EAAYnC,EAAQoF,IACjCL,EAAOhe,OAAS6d,EAAMvN,EAAW0N,EAAQ,EAAGH,GAAOG,GAGnD,IAAI3M,WAAMpR,EAAW,GAAGD,OACjB,SAAUkL,EAAW0S,GACnC,YAAqB3d,IAAdiL,GAAqC,IAAV0S,EAAc,GAAKlhB,EAAK+gB,EAAathB,KAAM+O,EAAW0S,IAErEH,EAEhB,CAGL,SAAevS,EAAW0S,GACxB,IAAIjR,EAAI6I,EAAuBrZ,MAC3BoiB,EAAwBte,MAAbiL,OAAyBjL,EAAYid,EAAUhS,EAAWsS,GACzE,OAAOe,EACH7hB,EAAK6hB,EAAUrT,EAAWyB,EAAGiR,GAC7BlhB,EAAKihB,EAAelf,EAASkO,GAAIzB,EAAW0S,IAOlD,SAAU3E,EAAQ2E,GAChB,IAAIY,EAAK3c,EAAS1F,MACdsiB,EAAIhgB,EAASwa,GACbvE,EAAMgJ,EAAgBC,EAAea,EAAIC,EAAGb,EAAOD,IAAkBF,GAEzE,GAAI/I,EAAI7L,KAAM,OAAO6L,EAAIlX,MAEzB,IAAI6L,EAAInF,EAAmBsa,EAAIrc,QAE3Buc,EAAkBF,EAAGL,QACrB5b,GAASic,EAAGP,WAAa,IAAM,KACtBO,EAAGN,UAAY,IAAM,KACrBM,EAAGL,QAAU,IAAM,KACnBb,EAAgB,IAAM,KAI/BiB,EAAW,IAAIlV,EAAEiU,EAAgB,OAASkB,EAAGxd,OAAS,IAAMwd,EAAIjc,GAChEsb,OAAgB5d,IAAV2d,EA1GC,WA0GkCA,IAAU,EACvD,GAAY,IAARC,EAAW,MAAO,GACtB,GAAiB,IAAbY,EAAEze,OAAc,OAAuC,OAAhCmd,EAAeoB,EAAUE,GAAc,CAACA,GAAK,GAIxE,IAHA,IAAIpgB,EAAI,EACJsgB,EAAI,EACJjR,EAAI,GACDiR,EAAIF,EAAEze,QAAQ,CACnBue,EAAST,UAAYR,EAAgB,EAAIqB,EACzC,IACIC,EADAhM,EAAIuK,EAAeoB,EAAUjB,EAAgBlC,EAAYqD,EAAGE,GAAKF,GAErE,GACQ,OAAN7L,IACCgM,EAAIvP,EAAI0M,EAASwC,EAAST,WAAaR,EAAgBqB,EAAI,IAAKF,EAAEze,WAAa3B,EAEhFsgB,EAAI1B,EAAmBwB,EAAGE,EAAGD,OACxB,CAEL,GADA9G,EAAKlK,EAAG0N,EAAYqD,EAAGpgB,EAAGsgB,IACtBjR,EAAE1N,SAAW6d,EAAK,OAAOnQ,EAC7B,IAAK,IAAInR,EAAI,EAAGA,GAAKqW,EAAE5S,OAAS,EAAGzD,IAEjC,GADAqb,EAAKlK,EAAGkF,EAAErW,IACNmR,EAAE1N,SAAW6d,EAAK,OAAOnQ,EAE/BiR,EAAItgB,EAAIugB,GAIZ,OADAhH,EAAKlK,EAAG0N,EAAYqD,EAAGpgB,IAChBqP,QA3H4B1L,GAAM,WAE7C,IAAI2R,EAAK,OACLkL,EAAelL,EAAGhR,KACtBgR,EAAGhR,KAAO,WAAc,OAAOkc,EAAa9b,MAAM5G,KAAM4D,YACxD,IAAIqH,EAAS,KAAKiK,MAAMsC,GACxB,OAAyB,IAAlBvM,EAAOpH,QAA8B,MAAdoH,EAAO,IAA4B,MAAdA,EAAO,MAwHrBkW,I,6BCxJvC,IAAI/d,EAAI,EAAQ,GACZ2K,EAAc,EAAQ,IACtBjL,EAAS,EAAQ,GACjByC,EAAc,EAAQ,GACtB2J,EAAS,EAAQ,IACjBzH,EAAa,EAAQ,IACrB9B,EAAgB,EAAQ,IACxBrD,EAAW,EAAQ,IACnBvB,EAAiB,EAAQ,IAAuCyD,EAChEE,EAA4B,EAAQ,KAEpCie,EAAe7f,EAAO3B,OACtB+Z,EAAkByH,GAAgBA,EAAa3gB,UAEnD,GAAI+L,GAAetG,EAAWkb,OAAoB,gBAAiBzH,SAElCpX,IAA/B6e,IAAejT,aACd,CACD,IAAIkT,EAA8B,GAE9BC,EAAgB,WAClB,IAAInT,EAAc9L,UAAUC,OAAS,QAAsBC,IAAjBF,UAAU,QAAmBE,EAAYxB,EAASsB,UAAU,IAClGqH,EAAStF,EAAcuV,EAAiBlb,MACxC,IAAI2iB,EAAajT,QAED5L,IAAhB4L,EAA4BiT,IAAiBA,EAAajT,GAE9D,MADoB,KAAhBA,IAAoBkT,EAA4B3X,IAAU,GACvDA,GAGTvG,EAA0Bme,EAAeF,GACzCE,EAAc7gB,UAAYkZ,EAC1BA,EAAgB/X,YAAc0f,EAE9B,IAAIzT,EAAgD,gBAAhChF,OAAOuY,EAAa,SACpCG,EAAiBvd,EAAY2V,EAAgB5Y,UAC7CygB,EAAgBxd,EAAY2V,EAAgBwC,SAC5CsF,EAAS,wBACTpJ,EAAUrU,EAAY,GAAGqU,SACzBqF,EAAc1Z,EAAY,GAAG6K,OAEjCrP,EAAema,EAAiB,cAAe,CAC7C7M,cAAc,EACdpN,IAAK,WACH,IAAIkb,EAAS4G,EAAc/iB,MACvB8c,EAASgG,EAAe3G,GAC5B,GAAIjN,EAAO0T,EAA6BzG,GAAS,MAAO,GACxD,IAAI8G,EAAO7T,EAAgB6P,EAAYnC,EAAQ,GAAI,GAAKlD,EAAQkD,EAAQkG,EAAQ,MAChF,MAAgB,KAATC,OAAcnf,EAAYmf,KAIrC7f,EAAE,CAAEN,QAAQ,EAAMW,QAAQ,GAAQ,CAChCtC,OAAQ0hB,M,gBCxDZ,IAAItd,EAAc,EAAQ,GAE1B1F,EAAOD,QAAU2F,EAAY,GAAGI,gB,gBCFhC,IAAIoI,EAAc,EAAQ,IACtBuM,EAAuB,EAAQ,IAC/BP,EAA2B,EAAQ,IAEvCla,EAAOD,QAAUmO,EAAc,SAAUjM,EAAQH,EAAKN,GACpD,OAAOiZ,EAAqB9V,EAAE1C,EAAQH,EAAKoY,EAAyB,EAAG1Y,KACrE,SAAUS,EAAQH,EAAKN,GAEzB,OADAS,EAAOH,GAAON,EACPS,I,gBCRmB,EAAQ,IAIpC8Y,CAAsB,a,cCWtB/a,EAAOD,QAfP,SAAyBqD,EAAKtB,EAAKN,GAYjC,OAXIM,KAAOsB,EACTnC,OAAOC,eAAekC,EAAKtB,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZqN,cAAc,EACd2D,UAAU,IAGZ/O,EAAItB,GAAON,EAGN4B,GAGyBpD,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,gBCfvG,IAAIsjB,EAAiB,EAAQ,KAEzBC,EAAuB,EAAQ,KAE/B5Q,EAA6B,EAAQ,KAErC6Q,EAAkB,EAAQ,KAM9BvjB,EAAOD,QAJP,SAAwB6S,EAAKrS,GAC3B,OAAO8iB,EAAezQ,IAAQ0Q,EAAqB1Q,EAAKrS,IAAMmS,EAA2BE,EAAKrS,IAAMgjB,KAGrEvjB,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,gBCZtGC,EAAOD,QAAU,EAAQ,M,gBCAzB,IAAImO,EAAc,EAAQ,IACtBxN,EAAO,EAAQ,IACfia,EAA6B,EAAQ,KACrCT,EAA2B,EAAQ,IACnCtL,EAAkB,EAAQ,IAC1BiD,EAAgB,EAAQ,IACxBxC,EAAS,EAAQ,IACjBsC,EAAiB,EAAQ,KAGzBI,EAA4B9Q,OAAOyD,yBAIvC3E,EAAQ4E,EAAIuJ,EAAc6D,EAA4B,SAAkCpB,EAAGqB,GAGzF,GAFArB,EAAI/B,EAAgB+B,GACpBqB,EAAIH,EAAcG,GACdL,EAAgB,IAClB,OAAOI,EAA0BpB,EAAGqB,GACpC,MAAOxN,IACT,GAAI6K,EAAOsB,EAAGqB,GAAI,OAAOkI,GAA0BxZ,EAAKia,EAA2BhW,EAAGgM,EAAGqB,GAAIrB,EAAEqB,M,gBCpBjG,IAAI3K,EAAa,EAAQ,IAEzBrH,EAAOD,QAAUsH,EAAW,YAAa,cAAgB,I,cCFzD,IAAI8R,EAAOvW,KAAKuW,KACZC,EAAQxW,KAAKwW,MAIjBpZ,EAAOD,QAAU,SAAUoP,GACzB,IAAIqU,GAAUrU,EAEd,OAAOqU,GAAWA,GAAqB,IAAXA,EAAe,GAAKA,EAAS,EAAIpK,EAAQD,GAAMqK,K,gBCR7E,IAAIjgB,EAAI,EAAQ,GACZmQ,EAAO,EAAQ,KAUnBnQ,EAAE,CAAEG,OAAQ,QAAS6B,MAAM,EAAM3B,QATC,EAAQ,IAEfqE,EAA4B,SAAU6C,GAE/DuF,MAAMqD,KAAK5I,OAKmD,CAC9D4I,KAAMA,K,gBCZR,OAAC,SAAW+P,GACV,aAiBA,IAkFEC,EAASC,EAAqBC,EAlF5BC,EAAY,KAOdC,EAAW,mBAGXC,EAAO,qgCAGP/L,EAAK,qgCAILgM,EAAW,CAOTC,UAAW,GAiBXC,SAAU,EAeVC,OAAQ,EAIRC,UAAW,EAIXC,SAAW,GAIXC,MAAOT,EAIPU,KAAMV,EAGNW,QAAQ,GAQVC,GAAW,EAGXC,EAAkBC,oCAGlBtI,EAAM,mBAENuI,EAAYhiB,KAAKwW,MACjByL,EAAUjiB,KAAK4U,IAEfsN,EAAW,6CACXC,EAAQ,yDACRC,EAAU,gDACVC,EAAY,qCAEZC,EAAO,IAIPC,EAAiBpB,EAAK/f,OAAS,EAC/BohB,EAAepN,EAAGhU,OAAS,EAG3BgO,EAAI,CAAEzQ,YAAa8a,GA01ErB,SAASgJ,EAAexkB,GACtB,IAAIN,EAAGqQ,EAAG0U,EACRC,EAAkB1kB,EAAEmD,OAAS,EAC7B2c,EAAM,GACN6E,EAAI3kB,EAAE,GAER,GAAI0kB,EAAkB,EAAG,CAEvB,IADA5E,GAAO6E,EACFjlB,EAAI,EAAGA,EAAIglB,EAAiBhlB,KAE/BqQ,EA32EO,GA02EP0U,EAAKzkB,EAAEN,GAAK,IACMyD,UACX2c,GAAO8E,EAAc7U,IAC5B+P,GAAO2E,GAKT1U,EAl3ES,GAi3ET0U,GADAE,EAAI3kB,EAAEN,IACG,IACSyD,UACX2c,GAAO8E,EAAc7U,SACvB,GAAU,IAAN4U,EACT,MAAO,IAIT,KAAOA,EAAI,IAAO,GAAIA,GAAK,GAE3B,OAAO7E,EAAM6E,EAIf,SAASE,EAAWnlB,EAAG8S,EAAK/C,GAC1B,GAAI/P,MAAQA,GAAKA,EAAI8S,GAAO9S,EAAI+P,EAC9B,MAAMyN,MAAM2G,EAAkBnkB,GAUlC,SAASolB,EAAoB9kB,EAAGN,EAAGqlB,EAAIC,GACrC,IAAIC,EAAIlV,EAAGvP,EAAG0kB,EAGd,IAAKnV,EAAI/P,EAAE,GAAI+P,GAAK,GAAIA,GAAK,KAAMrQ,EAwCnC,QArCMA,EAAI,GACRA,GAn5ES,EAo5ETulB,EAAK,IAELA,EAAKljB,KAAKuW,MAAM5Y,EAAI,GAt5EX,GAu5ETA,GAv5ES,GA65EXqQ,EAAIiU,EAAQ,GA75ED,EA65EgBtkB,GAC3BwlB,EAAKllB,EAAEilB,GAAMlV,EAAI,EAEA,MAAbiV,EACEtlB,EAAI,GACG,GAALA,EAAQwlB,EAAKA,EAAK,IAAM,EACd,GAALxlB,IAAQwlB,EAAKA,EAAK,GAAK,GAChC1kB,EAAIukB,EAAK,GAAW,OAANG,GAAeH,EAAK,GAAW,OAANG,GAAqB,KAANA,GAAqB,GAANA,GAErE1kB,GAAKukB,EAAK,GAAKG,EAAK,GAAKnV,GAAKgV,EAAK,GAAKG,EAAK,GAAKnV,EAAI,KACnD/P,EAAEilB,EAAK,GAAKlV,EAAI,IAAM,IAAMiU,EAAQ,GAAItkB,EAAI,GAAK,IAC/CwlB,GAAMnV,EAAI,GAAW,GAANmV,IAAyC,IAA5BllB,EAAEilB,EAAK,GAAKlV,EAAI,IAAM,GAGrDrQ,EAAI,GACG,GAALA,EAAQwlB,EAAKA,EAAK,IAAO,EACf,GAALxlB,EAAQwlB,EAAKA,EAAK,IAAM,EACnB,GAALxlB,IAAQwlB,EAAKA,EAAK,GAAK,GAChC1kB,GAAKwkB,GAAaD,EAAK,IAAY,MAANG,IAAeF,GAAaD,EAAK,GAAW,MAANG,GAEnE1kB,IAAMwkB,GAAaD,EAAK,IAAMG,EAAK,GAAKnV,IACtCiV,GAAaD,EAAK,GAAMG,EAAK,GAAKnV,EAAI,KACrC/P,EAAEilB,EAAK,GAAKlV,EAAI,IAAO,IAAMiU,EAAQ,GAAItkB,EAAI,GAAK,EAIlDc,EAOT,SAAS2kB,EAAYrF,EAAKsF,EAAQC,GAOhC,IANA,IAAI5Q,EAEF6Q,EADAvT,EAAM,CAAC,GAEPrS,EAAI,EACJ6lB,EAAOzF,EAAI3c,OAENzD,EAAI6lB,GAAO,CAChB,IAAKD,EAAOvT,EAAI5O,OAAQmiB,KAASvT,EAAIuT,IAASF,EAE9C,IADArT,EAAI,IAAMkR,EAASuC,QAAQ1F,EAAI9B,OAAOte,MACjC+U,EAAI,EAAGA,EAAI1C,EAAI5O,OAAQsR,IACtB1C,EAAI0C,GAAK4Q,EAAU,SACF,IAAftT,EAAI0C,EAAI,KAAe1C,EAAI0C,EAAI,GAAK,GACxC1C,EAAI0C,EAAI,IAAM1C,EAAI0C,GAAK4Q,EAAU,EACjCtT,EAAI0C,IAAM4Q,GAKhB,OAAOtT,EAAI0T,UAh4EbtU,EAAEuU,cAAgBvU,EAAEuE,IAAM,WACxB,IAAI7I,EAAI,IAAIvN,KAAKmD,YAAYnD,MAE7B,OADIuN,EAAEpL,EAAI,IAAGoL,EAAEpL,EAAI,GACZkkB,EAAS9Y,IASlBsE,EAAEmH,KAAO,WACP,OAAOqN,EAAS,IAAIrmB,KAAKmD,YAAYnD,MAAOA,KAAKyiB,EAAI,EAAG,IAY1D5Q,EAAEyU,UAAYzU,EAAE0U,MAAQ,SAAUrT,EAAK/C,GACrC,IACE5C,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAGX,GAFA+P,EAAM,IAAIsT,EAAKtT,GACf/C,EAAM,IAAIqW,EAAKrW,IACV+C,EAAI/Q,IAAMgO,EAAIhO,EAAG,OAAO,IAAIqkB,EAAK1R,KACtC,GAAI5B,EAAIuT,GAAGtW,GAAM,MAAMyN,MAAM2G,EAAkBpU,GAE/C,OADI5C,EAAEmZ,IAAIxT,GACC,EAAIA,EAAM3F,EAAEmZ,IAAIvW,GAAO,EAAIA,EAAM,IAAIqW,EAAKjZ,IAYvDsE,EAAE8U,WAAa9U,EAAE6U,IAAM,SAAU1O,GAC/B,IAAI5X,EAAG+U,EAAGyR,EAAKC,EACbtZ,EAAIvN,KACJ8mB,EAAKvZ,EAAE7M,EACPqmB,GAAM/O,EAAI,IAAIzK,EAAEpK,YAAY6U,IAAItX,EAChCsmB,EAAKzZ,EAAEpL,EACP8kB,EAAKjP,EAAE7V,EAGT,IAAK2kB,IAAOC,EACV,OAAQC,GAAOC,EAAWD,IAAOC,EAAKD,EAAKF,IAAOC,EAAK,GAAKD,EAAKE,EAAK,EAAI,GAAK,EAA3DlS,IAItB,IAAKgS,EAAG,KAAOC,EAAG,GAAI,OAAOD,EAAG,GAAKE,EAAKD,EAAG,IAAME,EAAK,EAGxD,GAAID,IAAOC,EAAI,OAAOD,EAGtB,GAAIzZ,EAAEkV,IAAMzK,EAAEyK,EAAG,OAAOlV,EAAEkV,EAAIzK,EAAEyK,EAAIuE,EAAK,EAAI,GAAK,EAMlD,IAAK5mB,EAAI,EAAG+U,GAJZyR,EAAME,EAAGjjB,SACTgjB,EAAME,EAAGljB,QAGmB+iB,EAAMC,EAAKzmB,EAAI+U,IAAK/U,EAC9C,GAAI0mB,EAAG1mB,KAAO2mB,EAAG3mB,GAAI,OAAO0mB,EAAG1mB,GAAK2mB,EAAG3mB,GAAK4mB,EAAK,EAAI,GAAK,EAI5D,OAAOJ,IAAQC,EAAM,EAAID,EAAMC,EAAMG,EAAK,EAAI,GAAK,GAiBrDnV,EAAEqV,OAASrV,EAAE+E,IAAM,WACjB,IAAIuQ,EAAI1B,EACNlY,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAKoK,EAAE7M,EAGF6M,EAAE7M,EAAE,IAETymB,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK1kB,KAAK0N,IAAI5C,EAAEkV,EAAGlV,EAAE6Z,MA3L3B,EA4LXZ,EAAKzC,SAAW,EAEhBxW,EA4xEF,SAAgBiZ,EAAMjZ,GACpB,IAAIkD,EAAGY,EAAK2G,EAEZ,GAAIzK,EAAE8Z,SAAU,OAAO9Z,GAMvB8D,EAAM9D,EAAE7M,EAAEmD,QACA,IACR4M,EAAIhO,KAAKuW,KAAK3H,EAAM,GACpB2G,GAAK,EAAIsP,EAAQ,EAAG7W,IAAInO,aAExBmO,EAAI,GACJuH,EAAI,gCAGNwO,EAAK1C,WAAarT,EAElBlD,EAAIga,EAAaf,EAAM,EAAGjZ,EAAEia,MAAMxP,GAAI,IAAIwO,EAAK,IAG/C,IAAK,IAAIpmB,EAAIqQ,EAAGrQ,KAAM,CACpB,IAAIqnB,EAAQla,EAAEia,MAAMja,GACpBA,EAAIka,EAAMD,MAAMC,GAAOxQ,MAAMwQ,GAAOD,MAAM,GAAGxQ,KAAK,GAKpD,OAFAwP,EAAK1C,WAAarT,EAEXlD,EA1zEH2Z,CAAOV,EAAMkB,EAAiBlB,EAAMjZ,IAExCiZ,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETY,EAAqB,GAAZ5C,GAA6B,GAAZA,EAAgBlW,EAAEoa,MAAQpa,EAAG4Z,EAAI1B,GAAI,IAZlD,IAAIe,EAAK,GAHZ,IAAIA,EAAK1R,MAmC5BjD,EAAE+V,SAAW/V,EAAEgW,KAAO,WACpB,IAAIpF,EAAGjiB,EAAGqB,EAAGX,EAAG4mB,EAAK3lB,EAAGilB,EAAI9lB,EAAGymB,EAAIC,EACjCza,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,IAAKoK,EAAEoJ,YAAcpJ,EAAE8Z,SAAU,OAAO,IAAIb,EAAKjZ,GAoCjD,IAnCA+W,GAAW,GAGXniB,EAAIoL,EAAEpL,EAAIuiB,EAAQnX,EAAEpL,EAAIoL,EAAG,EAAI,KAIrB9K,KAAK2T,IAAIjU,IAAM,IAqBvBjB,EAAI,IAAIslB,EAAKrkB,EAAEG,aApBfT,EAAIqjB,EAAe3X,EAAE7M,IAIjByB,IAHJsgB,EAAIlV,EAAEkV,GAGO5gB,EAAEgC,OAAS,GAAK,KAAGhC,GAAW,GAALM,IAAgB,GAANA,EAAU,IAAM,MAChEA,EAAIuiB,EAAQ7iB,EAAG,EAAI,GAGnB4gB,EAAIgC,GAAWhC,EAAI,GAAK,IAAMA,EAAI,IAAMA,EAAI,GAAK,EAAI,KASrDvhB,EAAI,IAAIslB,EANN3kB,EADEM,GAAK,IACH,KAAOsgB,GAEX5gB,EAAIM,EAAE8lB,iBACA7X,MAAM,EAAGvO,EAAEqkB,QAAQ,KAAO,GAAKzD,IAIrCtgB,EAAIoL,EAAEpL,GAKVilB,GAAM3E,EAAI+D,EAAK1C,WAAa,IAW1B,GAJAkE,GADAD,GADAzmB,EAAIJ,GACGsmB,MAAMlmB,GAAGkmB,MAAMlmB,IACT0V,KAAKzJ,GAClBrM,EAAIgnB,EAAOF,EAAQhR,KAAKzJ,GAAGia,MAAMlmB,GAAI0mB,EAAQhR,KAAK+Q,GAAKX,EAAK,EAAG,GAG3DlC,EAAe5jB,EAAEZ,GAAG0P,MAAM,EAAGgX,MAASvlB,EAAIqjB,EAAehkB,EAAER,IAAI0P,MAAM,EAAGgX,GAAK,CAK/E,GAAS,SAJTvlB,EAAIA,EAAEuO,MAAMgX,EAAK,EAAGA,EAAK,MAILU,GAAY,QAALjmB,GAepB,EAICA,KAAOA,EAAEuO,MAAM,IAAqB,KAAfvO,EAAE6c,OAAO,MAGlC2H,EAASnlB,EAAGuhB,EAAI,EAAG,GACnBjiB,GAAKU,EAAEsmB,MAAMtmB,GAAGsmB,MAAMtmB,GAAGinB,GAAG5a,IAG9B,MAtBA,IAAKua,IACHzB,EAAS/kB,EAAGmhB,EAAI,EAAG,GAEfnhB,EAAEkmB,MAAMlmB,GAAGkmB,MAAMlmB,GAAG6mB,GAAG5a,IAAI,CAC7BrM,EAAII,EACJ,MAIJ8lB,GAAM,EACNU,EAAM,EAmBZ,OAFAxD,GAAW,EAEJ+B,EAASnlB,EAAGuhB,EAAG+D,EAAKzC,SAAUvjB,IAQvCqR,EAAEuW,cAAgBvW,EAAEwW,GAAK,WACvB,IAAIhD,EACF3kB,EAAIV,KAAKU,EACTmB,EAAIiT,IAEN,GAAIpU,EAAG,CAML,GAJAmB,EA5TS,IA2TTwjB,EAAI3kB,EAAEmD,OAAS,GACN4gB,EAAUzkB,KAAKyiB,EA5Tf,IA+TT4C,EAAI3kB,EAAE2kB,GACC,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIxjB,IAChCA,EAAI,IAAGA,EAAI,GAGjB,OAAOA,GAyBTgQ,EAAEyW,UAAYzW,EAAE0W,IAAM,SAAUvQ,GAC9B,OAAOkQ,EAAOloB,KAAM,IAAIA,KAAKmD,YAAY6U,KAS3CnG,EAAE2W,mBAAqB3W,EAAE4W,SAAW,SAAUzQ,GAC5C,IACEwO,EADMxmB,KACGmD,YACX,OAAOkjB,EAAS6B,EAFRloB,KAEkB,IAAIwmB,EAAKxO,GAAI,EAAG,EAAG,GAAIwO,EAAK1C,UAAW0C,EAAKzC,WAQxElS,EAAE6W,OAAS7W,EAAEsW,GAAK,SAAUnQ,GAC1B,OAAuB,IAAhBhY,KAAK0mB,IAAI1O,IASlBnG,EAAEoH,MAAQ,WACR,OAAOoN,EAAS,IAAIrmB,KAAKmD,YAAYnD,MAAOA,KAAKyiB,EAAI,EAAG,IAS1D5Q,EAAE8W,YAAc9W,EAAE4U,GAAK,SAAUzO,GAC/B,OAAOhY,KAAK0mB,IAAI1O,GAAK,GASvBnG,EAAE+W,qBAAuB/W,EAAEgX,IAAM,SAAU7Q,GACzC,IAAIvH,EAAIzQ,KAAK0mB,IAAI1O,GACjB,OAAY,GAALvH,GAAgB,IAANA,GA6BnBoB,EAAEiX,iBAAmBjX,EAAE8D,KAAO,WAC5B,IAAIlF,EAAG5O,EAAGslB,EAAI1B,EAAIpU,EAChB9D,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YACT4lB,EAAM,IAAIvC,EAAK,GAEjB,IAAKjZ,EAAEoJ,WAAY,OAAO,IAAI6P,EAAKjZ,EAAEpL,EAAI,IAAQ2S,KACjD,GAAIvH,EAAE8Z,SAAU,OAAO0B,EAEvB5B,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK1kB,KAAK0N,IAAI5C,EAAEkV,EAAGlV,EAAE6Z,MAAQ,EAC9CZ,EAAKzC,SAAW,GAChB1S,EAAM9D,EAAE7M,EAAEmD,QAOA,GAERhC,GAAK,EAAIylB,EAAQ,EADjB7W,EAAIhO,KAAKuW,KAAK3H,EAAM,KACI/O,YAExBmO,EAAI,GACJ5O,EAAI,gCAGN0L,EAAIga,EAAaf,EAAM,EAAGjZ,EAAEia,MAAM3lB,GAAI,IAAI2kB,EAAK,IAAI,GAMnD,IAHA,IAAIwC,EACF5oB,EAAIqQ,EACJwY,EAAK,IAAIzC,EAAK,GACTpmB,KACL4oB,EAAUzb,EAAEia,MAAMja,GAClBA,EAAIwb,EAAI9R,MAAM+R,EAAQxB,MAAMyB,EAAGhS,MAAM+R,EAAQxB,MAAMyB,MAGrD,OAAO5C,EAAS9Y,EAAGiZ,EAAK1C,UAAYqD,EAAIX,EAAKzC,SAAW0B,GAAI,IAkC9D5T,EAAEqX,eAAiBrX,EAAEgE,KAAO,WAC1B,IAAIpF,EAAG0W,EAAI1B,EAAIpU,EACb9D,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,IAAKoK,EAAEoJ,YAAcpJ,EAAE8Z,SAAU,OAAO,IAAIb,EAAKjZ,GAQjD,GANA4Z,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK1kB,KAAK0N,IAAI5C,EAAEkV,EAAGlV,EAAE6Z,MAAQ,EAC9CZ,EAAKzC,SAAW,GAChB1S,EAAM9D,EAAE7M,EAAEmD,QAEA,EACR0J,EAAIga,EAAaf,EAAM,EAAGjZ,EAAGA,GAAG,OAC3B,CAYLkD,GADAA,EAAI,IAAMhO,KAAKiV,KAAKrG,IACZ,GAAK,GAAS,EAAJZ,EAGlBlD,EAAIga,EAAaf,EAAM,EADvBjZ,EAAIA,EAAEia,MAAM,EAAIF,EAAQ,EAAG7W,IACElD,GAAG,GAOhC,IAJA,IAAI4b,EACFC,EAAK,IAAI5C,EAAK,GACd6C,EAAM,IAAI7C,EAAK,IACf8C,EAAM,IAAI9C,EAAK,IACV/V,KACL0Y,EAAU5b,EAAEia,MAAMja,GAClBA,EAAIA,EAAEia,MAAM4B,EAAGpS,KAAKmS,EAAQ3B,MAAM6B,EAAI7B,MAAM2B,GAASnS,KAAKsS,MAO9D,OAHA9C,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETY,EAAS9Y,EAAG4Z,EAAI1B,GAAI,IAoB7B5T,EAAE0X,kBAAoB1X,EAAE2X,KAAO,WAC7B,IAAIrC,EAAI1B,EACNlY,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAKoK,EAAEoJ,WACHpJ,EAAE8Z,SAAiB,IAAIb,EAAKjZ,IAEhC4Z,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK,EACtBX,EAAKzC,SAAW,EAETmE,EAAO3a,EAAEsI,OAAQtI,EAAEoI,OAAQ6Q,EAAK1C,UAAYqD,EAAIX,EAAKzC,SAAW0B,IAR7C,IAAIe,EAAKjZ,EAAEpL,IA+BvC0P,EAAE4X,cAAgB5X,EAAEwG,KAAO,WACzB,IAAIqR,EACFnc,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YACTsN,EAAIlD,EAAE6I,MAAMsQ,IAAI,GAChBS,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SAEZ,OAAW,IAAPtT,EACW,IAANA,EAEHlD,EAAEoc,QAAUC,EAAMpD,EAAMW,EAAI1B,GAAM,IAAIe,EAAK,GAE3C,IAAIA,EAAK1R,KAGXvH,EAAE8Z,SAAiBuC,EAAMpD,EAAMW,EAAK,EAAG1B,GAAI+B,MAAM,KAIrDhB,EAAK1C,UAAYqD,EAAK,EACtBX,EAAKzC,SAAW,EAEhBxW,EAAIA,EAAE+K,OACNoR,EAASE,EAAMpD,EAAMW,EAAK,EAAG1B,GAAI+B,MAAM,IAEvChB,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETiE,EAAOzS,MAAM1J,KAuBtBsE,EAAEgY,wBAA0BhY,EAAEiH,MAAQ,WACpC,IAAIqO,EAAI1B,EACNlY,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAIoK,EAAEuc,IAAI,GAAW,IAAItD,EAAKjZ,EAAE4a,GAAG,GAAK,EAAIrT,KACvCvH,EAAEoJ,YAEPwQ,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK1kB,KAAK0N,IAAI1N,KAAK2T,IAAI7I,EAAEkV,GAAIlV,EAAE6Z,MAAQ,EACxDZ,EAAKzC,SAAW,EAChBO,GAAW,EAEX/W,EAAIA,EAAEia,MAAMja,GAAG0J,MAAM,GAAGS,OAAOV,KAAKzJ,GAEpC+W,GAAW,EACXkC,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETlY,EAAEwc,MAdiB,IAAIvD,EAAKjZ,IAkCrCsE,EAAEmY,sBAAwBnY,EAAEgH,MAAQ,WAClC,IAAIsO,EAAI1B,EACNlY,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAKoK,EAAEoJ,YAAcpJ,EAAE8Z,SAAiB,IAAIb,EAAKjZ,IAEjD4Z,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK,EAAI1kB,KAAK0N,IAAI1N,KAAK2T,IAAI7I,EAAEkV,GAAIlV,EAAE6Z,MAAQ,EAC5DZ,EAAKzC,SAAW,EAChBO,GAAW,EAEX/W,EAAIA,EAAEia,MAAMja,GAAGyJ,KAAK,GAAGU,OAAOV,KAAKzJ,GAEnC+W,GAAW,EACXkC,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETlY,EAAEwc,OAuBXlY,EAAEoY,yBAA2BpY,EAAE+G,MAAQ,WACrC,IAAIuO,EAAI1B,EAAIyE,EAAKC,EACf5c,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAKoK,EAAEoJ,WACHpJ,EAAEkV,GAAK,EAAU,IAAI+D,EAAKjZ,EAAE6I,MAAM+R,GAAG,GAAK5a,EAAEpL,EAAI,EAAIoL,EAAE8Z,SAAW9Z,EAAIuH,MAEzEqS,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVoG,EAAM5c,EAAE6Z,KAEJ3kB,KAAK0N,IAAIga,EAAKhD,GAAM,GAAK5Z,EAAEkV,EAAI,EAAU4D,EAAS,IAAIG,EAAKjZ,GAAI4Z,EAAI1B,GAAI,IAE3Ee,EAAK1C,UAAYoG,EAAMC,EAAM5c,EAAEkV,EAE/BlV,EAAI2a,EAAO3a,EAAEyJ,KAAK,GAAI,IAAIwP,EAAK,GAAGvP,MAAM1J,GAAI2c,EAAM/C,EAAI,GAEtDX,EAAK1C,UAAYqD,EAAK,EACtBX,EAAKzC,SAAW,EAEhBxW,EAAIA,EAAEwc,KAENvD,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETlY,EAAEia,MAAM,MArBW,IAAIhB,EAAK1R,MA8CrCjD,EAAEuY,YAAcvY,EAAEyG,KAAO,WACvB,IAAIoR,EAAQjZ,EACV0W,EAAI1B,EACJlY,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAIoK,EAAE8Z,SAAiB,IAAIb,EAAKjZ,IAEhCkD,EAAIlD,EAAE6I,MAAMsQ,IAAI,GAChBS,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,UAEC,IAAPtT,EAGQ,IAANA,IACFiZ,EAASE,EAAMpD,EAAMW,EAAK,EAAG1B,GAAI+B,MAAM,KAChCrlB,EAAIoL,EAAEpL,EACNunB,GAIF,IAAIlD,EAAK1R,MAKlB0R,EAAK1C,UAAYqD,EAAK,EACtBX,EAAKzC,SAAW,EAEhBxW,EAAIA,EAAEgb,IAAI,IAAI/B,EAAK,GAAGvP,MAAM1J,EAAEia,MAAMja,IAAImK,OAAOV,KAAK,IAAIoB,OAExDoO,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETlY,EAAEia,MAAM,MAsBjB3V,EAAEwY,eAAiBxY,EAAEuG,KAAO,WAC1B,IAAIhY,EAAG+U,EAAG1E,EAAG5O,EAAGyoB,EAAIhpB,EAAGJ,EAAGgpB,EAAKK,EAC7Bhd,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YACTgkB,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SAEZ,GAAKxW,EAAEoJ,WAOA,IAAIpJ,EAAE8Z,SACX,OAAO,IAAIb,EAAKjZ,GACX,GAAIA,EAAE6I,MAAM+R,GAAG,IAAMhB,EAAK,GAAKlC,EAGpC,OAFA/jB,EAAI0oB,EAAMpD,EAAMW,EAAK,EAAG1B,GAAI+B,MAAM,MAChCrlB,EAAIoL,EAAEpL,EACDjB,MAZU,CACjB,IAAKqM,EAAEpL,EAAG,OAAO,IAAIqkB,EAAK1R,KAC1B,GAAIqS,EAAK,GAAKlC,EAGZ,OAFA/jB,EAAI0oB,EAAMpD,EAAMW,EAAK,EAAG1B,GAAI+B,MAAM,KAChCrlB,EAAIoL,EAAEpL,EACDjB,EAqBX,IAXAslB,EAAK1C,UAAYoG,EAAM/C,EAAK,GAC5BX,EAAKzC,SAAW,EAUX3jB,EAFLqQ,EAAIhO,KAAKyQ,IAAI,GAAIgX,EA/2BN,EA+2BuB,EAAI,GAE1B9pB,IAAKA,EAAGmN,EAAIA,EAAEgb,IAAIhb,EAAEia,MAAMja,GAAGyJ,KAAK,GAAGU,OAAOV,KAAK,IAW7D,IATAsN,GAAW,EAEXnP,EAAI1S,KAAKuW,KAAKkR,EAr3BH,GAs3BXroB,EAAI,EACJ0oB,EAAKhd,EAAEia,MAAMja,GACbrM,EAAI,IAAIslB,EAAKjZ,GACb+c,EAAK/c,GAGS,IAAPnN,GAOL,GANAkqB,EAAKA,EAAG9C,MAAM+C,GACdjpB,EAAIJ,EAAE+V,MAAMqT,EAAG/B,IAAI1mB,GAAK,IAExByoB,EAAKA,EAAG9C,MAAM+C,QAGC,KAFfrpB,EAAII,EAAE0V,KAAKsT,EAAG/B,IAAI1mB,GAAK,KAEjBnB,EAAEyU,GAAe,IAAK/U,EAAI+U,EAAGjU,EAAER,EAAEN,KAAOkB,EAAEZ,EAAEN,IAAMA,MAO1D,OAJIqQ,IAAGvP,EAAIA,EAAEsmB,MAAM,GAAM/W,EAAI,IAE7B6T,GAAW,EAEJ+B,EAASnlB,EAAGslB,EAAK1C,UAAYqD,EAAIX,EAAKzC,SAAW0B,GAAI,IAQ9D5T,EAAE8E,SAAW,WACX,QAAS3W,KAAKU,GAQhBmR,EAAE2Y,UAAY3Y,EAAE4Y,MAAQ,WACtB,QAASzqB,KAAKU,GAAK+jB,EAAUzkB,KAAKyiB,EA55BvB,GA45BuCziB,KAAKU,EAAEmD,OAAS,GAQpEgO,EAAEqF,MAAQ,WACR,OAAQlX,KAAKmC,GAQf0P,EAAE6Y,WAAa7Y,EAAE8X,MAAQ,WACvB,OAAO3pB,KAAKmC,EAAI,GAQlB0P,EAAE8Y,WAAa9Y,EAAE+Y,MAAQ,WACvB,OAAO5qB,KAAKmC,EAAI,GAQlB0P,EAAEwV,OAAS,WACT,QAASrnB,KAAKU,GAAmB,IAAdV,KAAKU,EAAE,IAQ5BmR,EAAEgZ,SAAWhZ,EAAEiZ,GAAK,SAAU9S,GAC5B,OAAOhY,KAAK0mB,IAAI1O,GAAK,GAQvBnG,EAAEkZ,kBAAoBlZ,EAAEiY,IAAM,SAAU9R,GACtC,OAAOhY,KAAK0mB,IAAI1O,GAAK,GAkCvBnG,EAAEmZ,UAAYnZ,EAAEyE,IAAM,SAAU2U,GAC9B,IAAIC,EAAUxqB,EAAGyqB,EAAa1a,EAAG2a,EAAKC,EAAKjE,EAAIlmB,EAE7CslB,EADMxmB,KACKmD,YACXgkB,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SAIZ,GAAY,MAARkH,EACFA,EAAO,IAAIzE,EAAK,IAChB0E,GAAW,MACN,CAKL,GAHAxqB,GADAuqB,EAAO,IAAIzE,EAAKyE,IACPvqB,EAGLuqB,EAAK9oB,EAAI,IAAMzB,IAAMA,EAAE,IAAMuqB,EAAK9C,GAAG,GAAI,OAAO,IAAI3B,EAAK1R,KAE7DoW,EAAWD,EAAK9C,GAAG,IAMrB,GAHAznB,EApBQV,KAoBAU,EApBAV,KAuBAmC,EAAI,IAAMzB,IAAMA,EAAE,IAvBlBV,KAuB4BmoB,GAAG,GACrC,OAAO,IAAI3B,EAAK9lB,IAAMA,EAAE,IAAK,IAAkB,GAxBzCV,KAwBoCmC,EAAS2S,IAAMpU,EAAI,EAAI,KAKnE,GAAIwqB,EACF,GAAIxqB,EAAEmD,OAAS,EACbunB,GAAM,MACD,CACL,IAAK3a,EAAI/P,EAAE,GAAI+P,EAAI,IAAO,GAAIA,GAAK,GACnC2a,EAAY,IAAN3a,EA0BV,GAtBA6T,GAAW,EAEX+G,EAAMC,EAxCEtrB,KAuCRonB,EAAKD,EAnCK,GAqCVgE,EAAcD,EAAWK,EAAQ/E,EAAMY,EAAK,IAAMkE,EAAiBL,EAAM7D,GAmBrE5B,GAhBJtkB,EAAIgnB,EAAOmD,EAAKF,EAAa/D,EAAI,IAgBP1mB,EAAG+P,EAAI0W,EAAI1B,GAEnC,GAME,GAJA4F,EAAMC,EAhEFtrB,KA+DJonB,GAAM,IAEN+D,EAAcD,EAAWK,EAAQ/E,EAAMY,EAAK,IAAMkE,EAAiBL,EAAM7D,GACzElmB,EAAIgnB,EAAOmD,EAAKF,EAAa/D,EAAI,IAE5BgE,EAAK,EAGHlG,EAAehkB,EAAER,GAAG0P,MAAMK,EAAI,EAAGA,EAAI,IAAM,GAAK,OACnDvP,EAAImlB,EAASnlB,EAAGimB,EAAK,EAAG,IAG1B,aAEK3B,EAAoBtkB,EAAER,EAAG+P,GAAK,GAAIgV,IAK7C,OAFAnB,GAAW,EAEJ+B,EAASnlB,EAAGimB,EAAI1B,IAiDzB5T,EAAEoF,MAAQpF,EAAE2Z,IAAM,SAAUxT,GAC1B,IAAItX,EAAG+hB,EAAGriB,EAAG+U,EAAG1E,EAAGY,EAAK8V,EAAI1B,EAAIqB,EAAI2E,EAAIC,EAAM3E,EAC5CxZ,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAKX,GAHA6U,EAAI,IAAIwO,EAAKxO,IAGRzK,EAAE7M,IAAMsX,EAAEtX,EAab,OAVK6M,EAAEpL,GAAM6V,EAAE7V,EAGNoL,EAAE7M,EAAGsX,EAAE7V,GAAK6V,EAAE7V,EAKlB6V,EAAI,IAAIwO,EAAKxO,EAAEtX,GAAK6M,EAAEpL,IAAM6V,EAAE7V,EAAIoL,EAAIuH,KARzBkD,EAAI,IAAIwO,EAAK1R,KAUxBkD,EAIT,GAAIzK,EAAEpL,GAAK6V,EAAE7V,EAEX,OADA6V,EAAE7V,GAAK6V,EAAE7V,EACFoL,EAAEyJ,KAAKgB,GAShB,GANA8O,EAAKvZ,EAAE7M,EACPqmB,EAAK/O,EAAEtX,EACPymB,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,UAGL+C,EAAG,KAAOC,EAAG,GAAI,CAGpB,GAAIA,EAAG,GAAI/O,EAAE7V,GAAK6V,EAAE7V,MAGf,KAAI2kB,EAAG,GAIP,OAAO,IAAIN,EAAY,IAAPf,GAAY,EAAI,GAJrBzN,EAAI,IAAIwO,EAAKjZ,GAM7B,OAAO+W,EAAW+B,EAASrO,EAAGmP,EAAI1B,GAAMzN,EAa1C,GAPAyK,EAAIgC,EAAUzM,EAAEyK,EA/qCL,GAgrCXgJ,EAAKhH,EAAUlX,EAAEkV,EAhrCN,GAkrCXqE,EAAKA,EAAG1W,QACRK,EAAIgb,EAAKhJ,EAGF,CAyBL,KAxBAiJ,EAAOjb,EAAI,IAGT/P,EAAIomB,EACJrW,GAAKA,EACLY,EAAM0V,EAAGljB,SAETnD,EAAIqmB,EACJtE,EAAIgJ,EACJpa,EAAMyV,EAAGjjB,QAQP4M,GAFJrQ,EAAIqC,KAAK0N,IAAI1N,KAAKuW,KAAKmO,EAtsCd,GAssC8B9V,GAAO,KAG5CZ,EAAIrQ,EACJM,EAAEmD,OAAS,GAIbnD,EAAEylB,UACG/lB,EAAIqQ,EAAGrQ,KAAMM,EAAE+a,KAAK,GACzB/a,EAAEylB,cAGG,CASL,KAHAuF,GAFAtrB,EAAI0mB,EAAGjjB,SACPwN,EAAM0V,EAAGljB,WAECwN,EAAMjR,GAEXA,EAAI,EAAGA,EAAIiR,EAAKjR,IACnB,GAAI0mB,EAAG1mB,IAAM2mB,EAAG3mB,GAAI,CAClBsrB,EAAO5E,EAAG1mB,GAAK2mB,EAAG3mB,GAClB,MAIJqQ,EAAI,EAcN,IAXIib,IACFhrB,EAAIomB,EACJA,EAAKC,EACLA,EAAKrmB,EACLsX,EAAE7V,GAAK6V,EAAE7V,GAGXkP,EAAMyV,EAAGjjB,OAIJzD,EAAI2mB,EAAGljB,OAASwN,EAAKjR,EAAI,IAAKA,EAAG0mB,EAAGzV,KAAS,EAGlD,IAAKjR,EAAI2mB,EAAGljB,OAAQzD,EAAIqQ,GAAI,CAE1B,GAAIqW,IAAK1mB,GAAK2mB,EAAG3mB,GAAI,CACnB,IAAK+U,EAAI/U,EAAG+U,GAAiB,IAAZ2R,IAAK3R,IAAW2R,EAAG3R,GAAK4P,EAAO,IAC9C+B,EAAG3R,GACL2R,EAAG1mB,IAAM2kB,EAGX+B,EAAG1mB,IAAM2mB,EAAG3mB,GAId,KAAqB,IAAd0mB,IAAKzV,IAAayV,EAAG6E,MAG5B,KAAiB,IAAV7E,EAAG,GAAUA,EAAG8E,UAAWnJ,EAGlC,OAAKqE,EAAG,IAER9O,EAAEtX,EAAIomB,EACN9O,EAAEyK,EAAIoJ,EAAkB/E,EAAIrE,GAErB6B,EAAW+B,EAASrO,EAAGmP,EAAI1B,GAAMzN,GALrB,IAAIwO,EAAY,IAAPf,GAAY,EAAI,IAiC9C5T,EAAEmS,OAASnS,EAAEia,IAAM,SAAU9T,GAC3B,IAAIwK,EACFjV,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAKX,OAHA6U,EAAI,IAAIwO,EAAKxO,IAGRzK,EAAE7M,IAAMsX,EAAE7V,GAAK6V,EAAEtX,IAAMsX,EAAEtX,EAAE,GAAW,IAAI8lB,EAAK1R,MAG/CkD,EAAEtX,GAAK6M,EAAE7M,IAAM6M,EAAE7M,EAAE,GACf2lB,EAAS,IAAIG,EAAKjZ,GAAIiZ,EAAK1C,UAAW0C,EAAKzC,WAIpDO,GAAW,EAEQ,GAAfkC,EAAKxC,QAIPxB,EAAI0F,EAAO3a,EAAGyK,EAAE5B,MAAO,EAAG,EAAG,IAC3BjU,GAAK6V,EAAE7V,EAETqgB,EAAI0F,EAAO3a,EAAGyK,EAAG,EAAGwO,EAAKxC,OAAQ,GAGnCxB,EAAIA,EAAEgF,MAAMxP,GAEZsM,GAAW,EAEJ/W,EAAE0J,MAAMuL,KAUjB3Q,EAAEka,mBAAqBla,EAAE+D,IAAM,WAC7B,OAAOmW,EAAmB/rB,OAS5B6R,EAAEyZ,iBAAmBzZ,EAAEkY,GAAK,WAC1B,OAAOuB,EAAiBtrB,OAS1B6R,EAAEma,QAAUna,EAAE8V,IAAM,WAClB,IAAIpa,EAAI,IAAIvN,KAAKmD,YAAYnD,MAE7B,OADAuN,EAAEpL,GAAKoL,EAAEpL,EACFkkB,EAAS9Y,IAyBlBsE,EAAEmF,KAAOnF,EAAE5E,IAAM,SAAU+K,GACzB,IAAIiU,EAAOvrB,EAAG+hB,EAAGriB,EAAGqQ,EAAGY,EAAK8V,EAAI1B,EAAIqB,EAAIC,EACtCxZ,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAKX,GAHA6U,EAAI,IAAIwO,EAAKxO,IAGRzK,EAAE7M,IAAMsX,EAAEtX,EAWb,OARK6M,EAAEpL,GAAM6V,EAAE7V,EAMLoL,EAAE7M,IAAGsX,EAAI,IAAIwO,EAAKxO,EAAEtX,GAAK6M,EAAEpL,IAAM6V,EAAE7V,EAAIoL,EAAIuH,MANnCkD,EAAI,IAAIwO,EAAK1R,KAQxBkD,EAIT,GAAIzK,EAAEpL,GAAK6V,EAAE7V,EAEX,OADA6V,EAAE7V,GAAK6V,EAAE7V,EACFoL,EAAE0J,MAAMe,GASjB,GANA8O,EAAKvZ,EAAE7M,EACPqmB,EAAK/O,EAAEtX,EACPymB,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,UAGL+C,EAAG,KAAOC,EAAG,GAMhB,OAFKA,EAAG,KAAI/O,EAAI,IAAIwO,EAAKjZ,IAElB+W,EAAW+B,EAASrO,EAAGmP,EAAI1B,GAAMzN,EAa1C,GAPAvH,EAAIgU,EAAUlX,EAAEkV,EA/6CL,GAg7CXA,EAAIgC,EAAUzM,EAAEyK,EAh7CL,GAk7CXqE,EAAKA,EAAG1W,QACRhQ,EAAIqQ,EAAIgS,EAGD,CAuBL,IArBIriB,EAAI,GACNM,EAAIomB,EACJ1mB,GAAKA,EACLiR,EAAM0V,EAAGljB,SAETnD,EAAIqmB,EACJtE,EAAIhS,EACJY,EAAMyV,EAAGjjB,QAOPzD,GAFJiR,GADAZ,EAAIhO,KAAKuW,KAAKmO,EAn8CL,IAo8CC9V,EAAMZ,EAAI,EAAIY,EAAM,KAG5BjR,EAAIiR,EACJ3Q,EAAEmD,OAAS,GAIbnD,EAAEylB,UACK/lB,KAAMM,EAAE+a,KAAK,GACpB/a,EAAEylB,UAeJ,KAZA9U,EAAMyV,EAAGjjB,SACTzD,EAAI2mB,EAAGljB,QAGO,IACZzD,EAAIiR,EACJ3Q,EAAIqmB,EACJA,EAAKD,EACLA,EAAKpmB,GAIFurB,EAAQ,EAAG7rB,GACd6rB,GAASnF,IAAK1mB,GAAK0mB,EAAG1mB,GAAK2mB,EAAG3mB,GAAK6rB,GAASlH,EAAO,EACnD+B,EAAG1mB,IAAM2kB,EAUX,IAPIkH,IACFnF,EAAGoF,QAAQD,KACTxJ,GAKCpR,EAAMyV,EAAGjjB,OAAqB,GAAbijB,IAAKzV,IAAYyV,EAAG6E,MAK1C,OAHA3T,EAAEtX,EAAIomB,EACN9O,EAAEyK,EAAIoJ,EAAkB/E,EAAIrE,GAErB6B,EAAW+B,EAASrO,EAAGmP,EAAI1B,GAAMzN,GAU1CnG,EAAEiS,UAAYjS,EAAEuV,GAAK,SAAU3Q,GAC7B,IAAIhG,EACFlD,EAAIvN,KAEN,QAAU,IAANyW,GAAgBA,MAAQA,GAAW,IAANA,GAAiB,IAANA,EAAS,MAAMmH,MAAM2G,EAAkB9N,GASnF,OAPIlJ,EAAE7M,GACJ+P,EAAI0b,EAAa5e,EAAE7M,GACf+V,GAAKlJ,EAAEkV,EAAI,EAAIhS,IAAGA,EAAIlD,EAAEkV,EAAI,IAEhChS,EAAIqE,IAGCrE,GASToB,EAAEqH,MAAQ,WACR,IAAI3L,EAAIvN,KACNwmB,EAAOjZ,EAAEpK,YAEX,OAAOkjB,EAAS,IAAIG,EAAKjZ,GAAIA,EAAEkV,EAAI,EAAG+D,EAAKzC,WAmB7ClS,EAAEua,KAAOva,EAAEgF,IAAM,WACf,IAAIsQ,EAAI1B,EACNlY,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAKoK,EAAEoJ,WACHpJ,EAAE8Z,SAAiB,IAAIb,EAAKjZ,IAEhC4Z,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK1kB,KAAK0N,IAAI5C,EAAEkV,EAAGlV,EAAE6Z,MA/iD3B,EAgjDXZ,EAAKzC,SAAW,EAEhBxW,EAs7DF,SAAciZ,EAAMjZ,GAClB,IAAIkD,EACFY,EAAM9D,EAAE7M,EAAEmD,OAEZ,GAAIwN,EAAM,EACR,OAAO9D,EAAE8Z,SAAW9Z,EAAIga,EAAaf,EAAM,EAAGjZ,EAAGA,GASnDkD,GADAA,EAAI,IAAMhO,KAAKiV,KAAKrG,IACZ,GAAK,GAAS,EAAJZ,EAElBlD,EAAIA,EAAEia,MAAM,EAAIF,EAAQ,EAAG7W,IAC3BlD,EAAIga,EAAaf,EAAM,EAAGjZ,EAAGA,GAO7B,IAJA,IAAI8e,EACFjD,EAAK,IAAI5C,EAAK,GACd6C,EAAM,IAAI7C,EAAK,IACf8C,EAAM,IAAI9C,EAAK,IACV/V,KACL4b,EAAS9e,EAAEia,MAAMja,GACjBA,EAAIA,EAAEia,MAAM4B,EAAGpS,KAAKqV,EAAO7E,MAAM6B,EAAI7B,MAAM6E,GAAQpV,MAAMqS,MAG3D,OAAO/b,EAn9DH6e,CAAK5F,EAAMkB,EAAiBlB,EAAMjZ,IAEtCiZ,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETY,EAAS5C,EAAW,EAAIlW,EAAEoa,MAAQpa,EAAG4Z,EAAI1B,GAAI,IAb1B,IAAIe,EAAK1R,MA6BrCjD,EAAEya,WAAaza,EAAE6F,KAAO,WACtB,IAAIlX,EAAGqB,EAAGulB,EAAIlmB,EAAG4mB,EAAKxmB,EACpBiM,EAAIvN,KACJU,EAAI6M,EAAE7M,EACN+hB,EAAIlV,EAAEkV,EACNtgB,EAAIoL,EAAEpL,EACNqkB,EAAOjZ,EAAEpK,YAGX,GAAU,IAANhB,IAAYzB,IAAMA,EAAE,GACtB,OAAO,IAAI8lB,GAAMrkB,GAAKA,EAAI,KAAOzB,GAAKA,EAAE,IAAMoU,IAAMpU,EAAI6M,EAAI,KAgC9D,IA7BA+W,GAAW,EAOF,IAJTniB,EAAIM,KAAKiV,MAAMnK,KAIDpL,GAAK,OACjBN,EAAIqjB,EAAexkB,IAEZmD,OAAS4e,GAAK,GAAK,IAAG5gB,GAAK,KAClCM,EAAIM,KAAKiV,KAAK7V,GACd4gB,EAAIgC,GAAWhC,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS3CvhB,EAAI,IAAIslB,EANN3kB,EADEM,GAAK,IACH,KAAOsgB,GAEX5gB,EAAIM,EAAE8lB,iBACA7X,MAAM,EAAGvO,EAAEqkB,QAAQ,KAAO,GAAKzD,IAKvCvhB,EAAI,IAAIslB,EAAKrkB,EAAEG,YAGjB8kB,GAAM3E,EAAI+D,EAAK1C,WAAa,IAQ1B,GAHA5iB,GADAI,EAAIJ,GACE8V,KAAKkR,EAAO3a,EAAGjM,EAAG8lB,EAAK,EAAG,IAAII,MAAM,IAGtCtC,EAAe5jB,EAAEZ,GAAG0P,MAAM,EAAGgX,MAASvlB,EAAIqjB,EAAehkB,EAAER,IAAI0P,MAAM,EAAGgX,GAAK,CAK/E,GAAS,SAJTvlB,EAAIA,EAAEuO,MAAMgX,EAAK,EAAGA,EAAK,MAILU,GAAY,QAALjmB,GAepB,EAICA,KAAOA,EAAEuO,MAAM,IAAqB,KAAfvO,EAAE6c,OAAO,MAGlC2H,EAASnlB,EAAGuhB,EAAI,EAAG,GACnBjiB,GAAKU,EAAEsmB,MAAMtmB,GAAGinB,GAAG5a,IAGrB,MAtBA,IAAKua,IACHzB,EAAS/kB,EAAGmhB,EAAI,EAAG,GAEfnhB,EAAEkmB,MAAMlmB,GAAG6mB,GAAG5a,IAAI,CACpBrM,EAAII,EACJ,MAIJ8lB,GAAM,EACNU,EAAM,EAmBZ,OAFAxD,GAAW,EAEJ+B,EAASnlB,EAAGuhB,EAAG+D,EAAKzC,SAAUvjB,IAiBvCqR,EAAE0a,QAAU1a,EAAE2a,IAAM,WAClB,IAAIrF,EAAI1B,EACNlY,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAEX,OAAKoK,EAAEoJ,WACHpJ,EAAE8Z,SAAiB,IAAIb,EAAKjZ,IAEhC4Z,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SACVyC,EAAK1C,UAAYqD,EAAK,GACtBX,EAAKzC,SAAW,GAEhBxW,EAAIA,EAAEsJ,OACJ1U,EAAI,EACNoL,EAAI2a,EAAO3a,EAAG,IAAIiZ,EAAK,GAAGvP,MAAM1J,EAAEia,MAAMja,IAAImK,OAAQyP,EAAK,GAAI,GAE7DX,EAAK1C,UAAYqD,EACjBX,EAAKzC,SAAW0B,EAETY,EAAqB,GAAZ5C,GAA6B,GAAZA,EAAgBlW,EAAEoa,MAAQpa,EAAG4Z,EAAI1B,GAAI,IAf5C,IAAIe,EAAK1R,MAwCrCjD,EAAE2V,MAAQ3V,EAAE4a,IAAM,SAAUzU,GAC1B,IAAIiU,EAAOxJ,EAAGriB,EAAGqQ,EAAGvP,EAAGwrB,EAAIprB,EAAGslB,EAAKC,EACjCtZ,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YACT2jB,EAAKvZ,EAAE7M,EACPqmB,GAAM/O,EAAI,IAAIwO,EAAKxO,IAAItX,EAKzB,GAHAsX,EAAE7V,GAAKoL,EAAEpL,IAGJ2kB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAIP,GAAMxO,EAAE7V,GAAK2kB,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAI5DhS,IAICgS,GAAOC,EAAqB,EAAN/O,EAAE7V,EAAZ6V,EAAE7V,EAAI,GAoBzB,IAjBAsgB,EAAIgC,EAAUlX,EAAEkV,EAjvDL,GAivDqBgC,EAAUzM,EAAEyK,EAjvDjC,IAkvDXmE,EAAME,EAAGjjB,SACTgjB,EAAME,EAAGljB,UAIP3C,EAAI4lB,EACJA,EAAKC,EACLA,EAAK7lB,EACLwrB,EAAK9F,EACLA,EAAMC,EACNA,EAAM6F,GAIRxrB,EAAI,GAECd,EADLssB,EAAK9F,EAAMC,EACEzmB,KAAMc,EAAEua,KAAK,GAG1B,IAAKrb,EAAIymB,IAAOzmB,GAAK,GAAI,CAEvB,IADA6rB,EAAQ,EACHxb,EAAImW,EAAMxmB,EAAGqQ,EAAIrQ,GACpBkB,EAAIJ,EAAEuP,GAAKsW,EAAG3mB,GAAK0mB,EAAGrW,EAAIrQ,EAAI,GAAK6rB,EACnC/qB,EAAEuP,KAAOnP,EAAIyjB,EAAO,EACpBkH,EAAQ3qB,EAAIyjB,EAAO,EAGrB7jB,EAAEuP,IAAMvP,EAAEuP,GAAKwb,GAASlH,EAAO,EAIjC,MAAQ7jB,IAAIwrB,IAAMxrB,EAAEyqB,MAQpB,OANIM,IAASxJ,EACRvhB,EAAE0qB,QAEP5T,EAAEtX,EAAIQ,EACN8W,EAAEyK,EAAIoJ,EAAkB3qB,EAAGuhB,GAEpB6B,EAAW+B,EAASrO,EAAGwO,EAAK1C,UAAW0C,EAAKzC,UAAY/L,GAcjEnG,EAAE8a,SAAW,SAAUvF,EAAI3B,GACzB,OAAOmH,EAAe5sB,KAAM,EAAGonB,EAAI3B,IAcrC5T,EAAEgb,gBAAkBhb,EAAEib,KAAO,SAAUzE,EAAI5C,GACzC,IAAIlY,EAAIvN,KACNwmB,EAAOjZ,EAAEpK,YAGX,OADAoK,EAAI,IAAIiZ,EAAKjZ,QACF,IAAP8a,EAAsB9a,GAE1BgY,EAAW8C,EAAI,EA75DF,UA+5DF,IAAP5C,EAAeA,EAAKe,EAAKzC,SACxBwB,EAAWE,EAAI,EAAG,GAEhBY,EAAS9Y,EAAG8a,EAAK9a,EAAEkV,EAAI,EAAGgD,KAYnC5T,EAAEoW,cAAgB,SAAUI,EAAI5C,GAC9B,IAAIjF,EACFjT,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAcX,YAZW,IAAPklB,EACF7H,EAAMuM,EAAexf,GAAG,IAExBgY,EAAW8C,EAAI,EAt7DJ,UAw7DA,IAAP5C,EAAeA,EAAKe,EAAKzC,SACxBwB,EAAWE,EAAI,EAAG,GAGvBjF,EAAMuM,EADNxf,EAAI8Y,EAAS,IAAIG,EAAKjZ,GAAI8a,EAAK,EAAG5C,IACV,EAAM4C,EAAK,IAG9B9a,EAAEoc,UAAYpc,EAAE8Z,SAAW,IAAM7G,EAAMA,GAoBhD3O,EAAEmb,QAAU,SAAU3E,EAAI5C,GACxB,IAAIjF,EAAKxI,EACPzK,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAgBX,YAdW,IAAPklB,EACF7H,EAAMuM,EAAexf,IAErBgY,EAAW8C,EAAI,EA39DJ,UA69DA,IAAP5C,EAAeA,EAAKe,EAAKzC,SACxBwB,EAAWE,EAAI,EAAG,GAGvBjF,EAAMuM,EADN/U,EAAIqO,EAAS,IAAIG,EAAKjZ,GAAI8a,EAAK9a,EAAEkV,EAAI,EAAGgD,IAChB,EAAO4C,EAAKrQ,EAAEyK,EAAI,IAKrClV,EAAEoc,UAAYpc,EAAE8Z,SAAW,IAAM7G,EAAMA,GAehD3O,EAAEob,WAAa,SAAUC,GACvB,IAAIxsB,EAAGysB,EAAIC,EAAIC,EAAI5K,EAAGhS,EAAG5O,EAAGyrB,EAAIC,EAAIpG,EAAI3E,EAAGthB,EACzCqM,EAAIvN,KACJ8mB,EAAKvZ,EAAE7M,EACP8lB,EAAOjZ,EAAEpK,YAEX,IAAK2jB,EAAI,OAAO,IAAIN,EAAKjZ,GAUzB,GARAggB,EAAKJ,EAAK,IAAI3G,EAAK,GACnB4G,EAAKE,EAAK,IAAI9G,EAAK,GAInB/V,GADAgS,GADA/hB,EAAI,IAAI8lB,EAAK4G,IACP3K,EAAI0J,EAAarF,GAAMvZ,EAAEkV,EAAI,GAj6DxB,EAm6DX/hB,EAAEA,EAAE,GAAKgkB,EAAQ,GAAIjU,EAAI,EAn6Dd,EAm6D6BA,EAAIA,GAEhC,MAARyc,EAGFA,EAAOzK,EAAI,EAAI/hB,EAAI6sB,MACd,CAEL,KADA1rB,EAAI,IAAI2kB,EAAK0G,IACNzC,SAAW5oB,EAAEipB,GAAGyC,GAAK,MAAM3P,MAAM2G,EAAkB1iB,GAC1DqrB,EAAOrrB,EAAE4kB,GAAG/lB,GAAM+hB,EAAI,EAAI/hB,EAAI6sB,EAAM1rB,EAQtC,IALAyiB,GAAW,EACXziB,EAAI,IAAI2kB,EAAKtB,EAAe4B,IAC5BK,EAAKX,EAAK1C,UACV0C,EAAK1C,UAAYrB,EAl7DN,EAk7DUqE,EAAGjjB,OAAoB,EAG1C2e,EAAI0F,EAAOrmB,EAAGnB,EAAG,EAAG,EAAG,GAEH,IADpB2sB,EAAKF,EAAGnW,KAAKwL,EAAEgF,MAAM4F,KACd1G,IAAIwG,IACXC,EAAKC,EACLA,EAAKC,EACLA,EAAKE,EACLA,EAAKD,EAAGtW,KAAKwL,EAAEgF,MAAM6F,IACrBC,EAAKD,EACLA,EAAK3sB,EACLA,EAAImB,EAAEoV,MAAMuL,EAAEgF,MAAM6F,IACpBxrB,EAAIwrB,EAeN,OAZAA,EAAKnF,EAAOgF,EAAKjW,MAAMkW,GAAKC,EAAI,EAAG,EAAG,GACtCE,EAAKA,EAAGtW,KAAKqW,EAAG7F,MAAM+F,IACtBJ,EAAKA,EAAGnW,KAAKqW,EAAG7F,MAAM4F,IACtBE,EAAGnrB,EAAIorB,EAAGprB,EAAIoL,EAAEpL,EAGhBjB,EAAIgnB,EAAOqF,EAAIH,EAAI3K,EAAG,GAAGxL,MAAM1J,GAAG6I,MAAMsQ,IAAIwB,EAAOoF,EAAIH,EAAI1K,EAAG,GAAGxL,MAAM1J,GAAG6I,OAAS,EAC7E,CAACmX,EAAIH,GAAM,CAACE,EAAIH,GAEtB3G,EAAK1C,UAAYqD,EACjB7C,GAAW,EAEJpjB,GAcT2Q,EAAE2b,cAAgB3b,EAAE4b,MAAQ,SAAUrG,EAAI3B,GACxC,OAAOmH,EAAe5sB,KAAM,GAAIonB,EAAI3B,IAoBtC5T,EAAE6b,UAAY,SAAU1V,EAAGyN,GACzB,IAAIlY,EAAIvN,KACNwmB,EAAOjZ,EAAEpK,YAIX,GAFAoK,EAAI,IAAIiZ,EAAKjZ,GAEJ,MAALyK,EAAW,CAGb,IAAKzK,EAAE7M,EAAG,OAAO6M,EAEjByK,EAAI,IAAIwO,EAAK,GACbf,EAAKe,EAAKzC,aACL,CASL,GARA/L,EAAI,IAAIwO,EAAKxO,QACF,IAAPyN,EACFA,EAAKe,EAAKzC,SAEVwB,EAAWE,EAAI,EAAG,IAIflY,EAAE7M,EAAG,OAAOsX,EAAE7V,EAAIoL,EAAIyK,EAG3B,IAAKA,EAAEtX,EAEL,OADIsX,EAAE7V,IAAG6V,EAAE7V,EAAIoL,EAAEpL,GACV6V,EAiBX,OAZIA,EAAEtX,EAAE,IACN4jB,GAAW,EACX/W,EAAI2a,EAAO3a,EAAGyK,EAAG,EAAGyN,EAAI,GAAG+B,MAAMxP,GACjCsM,GAAW,EACX+B,EAAS9Y,KAITyK,EAAE7V,EAAIoL,EAAEpL,EACRoL,EAAIyK,GAGCzK,GASTsE,EAAE0C,SAAW,WACX,OAAQvU,MAcV6R,EAAE8b,QAAU,SAAUvG,EAAI3B,GACxB,OAAOmH,EAAe5sB,KAAM,EAAGonB,EAAI3B,IA+CrC5T,EAAE+b,QAAU/b,EAAEwF,IAAM,SAAUW,GAC5B,IAAIyK,EAAGhS,EAAG0W,EAAIjmB,EAAGukB,EAAItjB,EACnBoL,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YACT0qB,IAAO7V,EAAI,IAAIwO,EAAKxO,IAGtB,KAAKzK,EAAE7M,GAAMsX,EAAEtX,GAAM6M,EAAE7M,EAAE,IAAOsX,EAAEtX,EAAE,IAAI,OAAO,IAAI8lB,EAAK9B,GAASnX,EAAGsgB,IAIpE,IAFAtgB,EAAI,IAAIiZ,EAAKjZ,IAEP4a,GAAG,GAAI,OAAO5a,EAKpB,GAHA4Z,EAAKX,EAAK1C,UACV2B,EAAKe,EAAKzC,SAEN/L,EAAEmQ,GAAG,GAAI,OAAO9B,EAAS9Y,EAAG4Z,EAAI1B,GAMpC,IAHAhD,EAAIgC,EAAUzM,EAAEyK,EAxnEL,KA2nEFzK,EAAEtX,EAAEmD,OAAS,IAAM4M,EAAIod,EAAK,GAAKA,EAAKA,IA1nE5B,iBA4nEjB,OADA3sB,EAAI4sB,EAAOtH,EAAMjZ,EAAGkD,EAAG0W,GAChBnP,EAAE7V,EAAI,EAAI,IAAIqkB,EAAK,GAAG+B,IAAIrnB,GAAKmlB,EAASnlB,EAAGimB,EAAI1B,GAMxD,IAHAtjB,EAAIoL,EAAEpL,GAGE,EAAG,CAGT,GAAIsgB,EAAIzK,EAAEtX,EAAEmD,OAAS,EAAG,OAAO,IAAI2iB,EAAK1R,KAMxC,GAHoB,IAAN,EAATkD,EAAEtX,EAAE+hB,MAActgB,EAAI,GAGhB,GAAPoL,EAAEkV,GAAoB,GAAVlV,EAAE7M,EAAE,IAAyB,GAAd6M,EAAE7M,EAAEmD,OAEjC,OADA0J,EAAEpL,EAAIA,EACCoL,EAgBX,OAPAkV,EAAS,IADThS,EAAIiU,GAASnX,EAAGsgB,KACDlX,SAASlG,GAEpB,IAAI+V,EAAK/V,EAAI,IAAIgS,EADjBgC,EAAUoJ,GAAMprB,KAAK6T,IAAI,KAAO4O,EAAe3X,EAAE7M,IAAM+B,KAAKmhB,KAAOrW,EAAEkV,EAAI,KAMrE+D,EAAKpC,KAAO,GAAK3B,EAAI+D,EAAKrC,KAAO,EAAU,IAAIqC,EAAK/D,EAAI,EAAItgB,EAAI,EAAI,IAE5EmiB,GAAW,EACXkC,EAAKzC,SAAWxW,EAAEpL,EAAI,EAMtBsO,EAAIhO,KAAKyQ,IAAI,IAAKuP,EAAI,IAAI5e,SAG1B3C,EAAI6qB,EAAmB/T,EAAEwP,MAAM8D,EAAiB/d,EAAG4Z,EAAK1W,IAAK0W,IAGvDzmB,GAOA8kB,GAJJtkB,EAAImlB,EAASnlB,EAAGimB,EAAK,EAAG,IAIEzmB,EAAGymB,EAAI1B,KAC/BhD,EAAI0E,EAAK,IAMJjC,GAHLhkB,EAAImlB,EAAS0F,EAAmB/T,EAAEwP,MAAM8D,EAAiB/d,EAAGkV,EAAIhS,IAAKgS,GAAIA,EAAI,EAAG,IAG1D/hB,GAAG0P,MAAM+W,EAAK,EAAGA,EAAK,IAAM,GAAK,OACrDjmB,EAAImlB,EAASnlB,EAAGimB,EAAK,EAAG,KAK9BjmB,EAAEiB,EAAIA,EACNmiB,GAAW,EACXkC,EAAKzC,SAAW0B,EAETY,EAASnlB,EAAGimB,EAAI1B,KAezB5T,EAAEkc,YAAc,SAAU3G,EAAI3B,GAC5B,IAAIjF,EACFjT,EAAIvN,KACJwmB,EAAOjZ,EAAEpK,YAcX,YAZW,IAAPikB,EACF5G,EAAMuM,EAAexf,EAAGA,EAAEkV,GAAK+D,EAAKvC,UAAY1W,EAAEkV,GAAK+D,EAAKtC,WAE5DqB,EAAW6B,EAAI,EA5zEJ,UA8zEA,IAAP3B,EAAeA,EAAKe,EAAKzC,SACxBwB,EAAWE,EAAI,EAAG,GAGvBjF,EAAMuM,EADNxf,EAAI8Y,EAAS,IAAIG,EAAKjZ,GAAI6Z,EAAI3B,GACN2B,GAAM7Z,EAAEkV,GAAKlV,EAAEkV,GAAK+D,EAAKvC,SAAUmD,IAGtD7Z,EAAEoc,UAAYpc,EAAE8Z,SAAW,IAAM7G,EAAMA,GAkBhD3O,EAAEmc,oBAAsBnc,EAAEoc,KAAO,SAAU7G,EAAI3B,GAC7C,IACEe,EADMxmB,KACGmD,YAYX,YAVW,IAAPikB,GACFA,EAAKZ,EAAK1C,UACV2B,EAAKe,EAAKzC,WAEVwB,EAAW6B,EAAI,EA/1EJ,UAi2EA,IAAP3B,EAAeA,EAAKe,EAAKzC,SACxBwB,EAAWE,EAAI,EAAG,IAGlBY,EAAS,IAAIG,EAbZxmB,MAaqBonB,EAAI3B,IAWnC5T,EAAEvP,SAAW,WACX,IAAIiL,EAAIvN,KACNwmB,EAAOjZ,EAAEpK,YACTqd,EAAMuM,EAAexf,EAAGA,EAAEkV,GAAK+D,EAAKvC,UAAY1W,EAAEkV,GAAK+D,EAAKtC,UAE9D,OAAO3W,EAAEoc,UAAYpc,EAAE8Z,SAAW,IAAM7G,EAAMA,GAQhD3O,EAAEqc,UAAYrc,EAAEsc,MAAQ,WACtB,OAAO9H,EAAS,IAAIrmB,KAAKmD,YAAYnD,MAAOA,KAAKyiB,EAAI,EAAG,IAS1D5Q,EAAE6L,QAAU7L,EAAEvD,OAAS,WACrB,IAAIf,EAAIvN,KACNwmB,EAAOjZ,EAAEpK,YACTqd,EAAMuM,EAAexf,EAAGA,EAAEkV,GAAK+D,EAAKvC,UAAY1W,EAAEkV,GAAK+D,EAAKtC,UAE9D,OAAO3W,EAAEoc,QAAU,IAAMnJ,EAAMA,GAmNjC,IAAI0H,EAAS,WAGX,SAASkG,EAAgB7gB,EAAGkD,EAAGwa,GAC7B,IAAItS,EACFsT,EAAQ,EACR7rB,EAAImN,EAAE1J,OAER,IAAK0J,EAAIA,EAAE6C,QAAShQ,KAClBuY,EAAOpL,EAAEnN,GAAKqQ,EAAIwb,EAClB1e,EAAEnN,GAAKuY,EAAOsS,EAAO,EACrBgB,EAAQtT,EAAOsS,EAAO,EAKxB,OAFIgB,GAAO1e,EAAE2e,QAAQD,GAEd1e,EAGT,SAAS8gB,EAAQpY,EAAGC,EAAGoY,EAAIC,GACzB,IAAInuB,EAAGc,EAEP,GAAIotB,GAAMC,EACRrtB,EAAIotB,EAAKC,EAAK,GAAK,OAEnB,IAAKnuB,EAAIc,EAAI,EAAGd,EAAIkuB,EAAIluB,IACtB,GAAI6V,EAAE7V,IAAM8V,EAAE9V,GAAI,CAChBc,EAAI+U,EAAE7V,GAAK8V,EAAE9V,GAAK,GAAK,EACvB,MAKN,OAAOc,EAGT,SAASstB,EAASvY,EAAGC,EAAGoY,EAAIrD,GAI1B,IAHA,IAAI7qB,EAAI,EAGDkuB,KACLrY,EAAEqY,IAAOluB,EACTA,EAAI6V,EAAEqY,GAAMpY,EAAEoY,GAAM,EAAI,EACxBrY,EAAEqY,GAAMluB,EAAI6qB,EAAOhV,EAAEqY,GAAMpY,EAAEoY,GAI/B,MAAQrY,EAAE,IAAMA,EAAEpS,OAAS,GAAIoS,EAAE2V,QAGnC,OAAO,SAAUre,EAAGyK,EAAGmP,EAAI1B,EAAI4C,EAAI4C,GACjC,IAAIvE,EAAKjE,EAAGriB,EAAGqQ,EAAGge,EAASC,EAAMC,EAAMC,EAAOpM,EAAGqM,EAAIC,EAAKC,EAAMC,EAAM5H,EAAI9lB,EAAG2tB,EAAIC,EAAIC,EACnFC,EAAIC,EACJ7I,EAAOjZ,EAAEpK,YACTmsB,EAAO/hB,EAAEpL,GAAK6V,EAAE7V,EAAI,GAAK,EACzB2kB,EAAKvZ,EAAE7M,EACPqmB,EAAK/O,EAAEtX,EAGT,KAAKomB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAIP,EACRjZ,EAAEpL,GAAM6V,EAAE7V,IAAM2kB,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG9CD,GAAe,GAATA,EAAG,KAAYC,EAAY,EAAPuI,EAAWA,EAAO,EAHQxa,KAsBxD,IAhBImW,GACFwD,EAAU,EACVhM,EAAIlV,EAAEkV,EAAIzK,EAAEyK,IAEZwI,EAAOlG,EACP0J,EAxkFO,EAykFPhM,EAAIgC,EAAUlX,EAAEkV,EAAIgM,GAAWhK,EAAUzM,EAAEyK,EAAIgM,IAGjDW,EAAKrI,EAAGljB,OACRqrB,EAAKpI,EAAGjjB,OAERgrB,GADArM,EAAI,IAAIgE,EAAK8I,IACN5uB,EAAI,GAINN,EAAI,EAAG2mB,EAAG3mB,KAAO0mB,EAAG1mB,IAAM,GAAIA,KAanC,GAXI2mB,EAAG3mB,IAAM0mB,EAAG1mB,IAAM,IAAIqiB,IAEhB,MAAN0E,GACFC,EAAKD,EAAKX,EAAK1C,UACf2B,EAAKe,EAAKzC,UAEVqD,EADSiB,EACJlB,GAAM5Z,EAAEkV,EAAIzK,EAAEyK,GAAK,EAEnB0E,EAGHC,EAAK,EACPyH,EAAGpT,KAAK,GACRiT,GAAO,MACF,CAOL,GAJAtH,EAAKA,EAAKqH,EAAU,EAAI,EACxBruB,EAAI,EAGM,GAANgvB,EAAS,CAMX,IALA3e,EAAI,EACJsW,EAAKA,EAAG,GACRK,KAGQhnB,EAAI8uB,GAAMze,IAAM2W,IAAMhnB,IAC5BkB,EAAImP,EAAIwa,GAAQnE,EAAG1mB,IAAM,GACzByuB,EAAGzuB,GAAKkB,EAAIylB,EAAK,EACjBtW,EAAInP,EAAIylB,EAAK,EAGf2H,EAAOje,GAAKrQ,EAAI8uB,MAGX,CAiBL,KAdAze,EAAIwa,GAAQlE,EAAG,GAAK,GAAK,GAEjB,IACNA,EAAKqH,EAAgBrH,EAAItW,EAAGwa,GAC5BnE,EAAKsH,EAAgBtH,EAAIrW,EAAGwa,GAC5BmE,EAAKrI,EAAGljB,OACRqrB,EAAKpI,EAAGjjB,QAGVorB,EAAKG,EAELL,GADAD,EAAMhI,EAAG1W,MAAM,EAAGgf,IACPvrB,OAGJkrB,EAAOK,GAAKN,EAAIC,KAAU,GAEjCM,EAAKtI,EAAG3W,SACL8b,QAAQ,GACXiD,EAAMpI,EAAG,GAELA,EAAG,IAAMkE,EAAO,KAAKkE,EAEzB,GACE1e,EAAI,GAGJiW,EAAM2H,EAAQtH,EAAI+H,EAAKM,EAAIL,IAGjB,GAGRC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAO/D,GAAQ6D,EAAI,IAAM,KAGhDre,EAAIue,EAAOG,EAAM,GAUT,GACF1e,GAAKwa,IAAMxa,EAAIwa,EAAO,GAWf,IAHXvE,EAAM2H,EALNM,EAAOP,EAAgBrH,EAAItW,EAAGwa,GAKV6D,EAJpBF,EAAQD,EAAK9qB,OACbkrB,EAAOD,EAAIjrB,WAOT4M,IAGA+d,EAASG,EAAMS,EAAKR,EAAQS,EAAKtI,EAAI6H,EAAO3D,MAOrC,GAALxa,IAAQiW,EAAMjW,EAAI,GACtBke,EAAO5H,EAAG3W,UAGZwe,EAAQD,EAAK9qB,QACDkrB,GAAMJ,EAAKzC,QAAQ,GAG/BsC,EAASM,EAAKH,EAAMI,EAAM9D,IAGd,GAARvE,IAIFA,EAAM2H,EAAQtH,EAAI+H,EAAKM,EAHvBL,EAAOD,EAAIjrB,SAMD,IACR4M,IAGA+d,EAASM,EAAKM,EAAKL,EAAOM,EAAKtI,EAAIgI,EAAM9D,IAI7C8D,EAAOD,EAAIjrB,QACM,IAAR6iB,IACTjW,IACAqe,EAAM,CAAC,IAITD,EAAGzuB,KAAOqQ,EAGNiW,GAAOoI,EAAI,GACbA,EAAIC,KAAUjI,EAAGmI,IAAO,GAExBH,EAAM,CAAChI,EAAGmI,IACVF,EAAO,UAGDE,IAAOC,QAAiB,IAAXJ,EAAI,KAAkB1H,KAE7CsH,OAAkB,IAAXI,EAAI,GAIRD,EAAG,IAAIA,EAAGjD,QAIjB,GAAe,GAAX6C,EACFjM,EAAEC,EAAIA,EACNe,EAAUkL,MACL,CAGL,IAAKtuB,EAAI,EAAGqQ,EAAIoe,EAAG,GAAIpe,GAAK,GAAIA,GAAK,GAAIrQ,IACzCoiB,EAAEC,EAAIriB,EAAIqiB,EAAIgM,EAAU,EAExBpI,EAAS7D,EAAG6F,EAAKlB,EAAK3E,EAAEC,EAAI,EAAI0E,EAAI1B,EAAIiJ,GAG1C,OAAOlM,GAnQE,GA4QZ,SAAS6D,EAAS9Y,EAAG6Z,EAAI3B,EAAI8J,GAC5B,IAAI3a,EAAQxU,EAAG+U,EAAG1E,EAAGmV,EAAI4J,EAASnK,EAAGyB,EAAI2I,EACvCjJ,EAAOjZ,EAAEpK,YAGXusB,EAAK,GAAU,MAANtI,EAAY,CAInB,KAHAN,EAAKvZ,EAAE7M,GAGE,OAAO6M,EAWhB,IAAKqH,EAAS,EAAGnE,EAAIqW,EAAG,GAAIrW,GAAK,GAAIA,GAAK,GAAImE,IAI9C,IAHAxU,EAAIgnB,EAAKxS,GAGD,EACNxU,GApyFO,EAqyFP+U,EAAIiS,EAIJxB,GAHAP,EAAIyB,EAAG2I,EAAM,IAGJ/K,EAAQ,GAAI9P,EAASO,EAAI,GAAK,GAAK,OAI5C,IAFAsa,EAAMhtB,KAAKuW,MAAM5Y,EAAI,GA3yFd,MA4yFPqQ,EAAIqW,EAAGjjB,QACO,CACZ,IAAI0rB,EASF,MAAMG,EANN,KAAOjf,KAAOgf,GAAM3I,EAAGrL,KAAK,GAC5B4J,EAAIO,EAAK,EACThR,EAAS,EAETO,GADA/U,GApzFG,KAqzFgB,MAIhB,CAIL,IAHAilB,EAAI5U,EAAIqW,EAAG2I,GAGN7a,EAAS,EAAGnE,GAAK,GAAIA,GAAK,GAAImE,IAUnCgR,GAHAzQ,GAJA/U,GAh0FK,KAo0FcwU,GAGV,EAAI,EAAIyQ,EAAIX,EAAQ,GAAI9P,EAASO,EAAI,GAAK,GAAK,EAoB5D,GAfAoa,EAAcA,GAAenI,EAAK,QAChB,IAAhBN,EAAG2I,EAAM,KAAkBta,EAAI,EAAIkQ,EAAIA,EAAIX,EAAQ,GAAI9P,EAASO,EAAI,IAMtEqa,EAAU/J,EAAK,GACVG,GAAM2J,KAAuB,GAAN9J,GAAWA,IAAOlY,EAAEpL,EAAI,EAAI,EAAI,IACxDyjB,EAAK,GAAW,GAANA,IAAkB,GAANH,GAAW8J,GAAqB,GAAN9J,IAG9CrlB,EAAI,EAAI+U,EAAI,EAAIkQ,EAAIX,EAAQ,GAAI9P,EAASO,GAAK,EAAI2R,EAAG2I,EAAM,IAAM,GAAM,GACvEhK,IAAOlY,EAAEpL,EAAI,EAAI,EAAI,IAEvBilB,EAAK,IAAMN,EAAG,GAgBhB,OAfAA,EAAGjjB,OAAS,EACR2rB,GAGFpI,GAAM7Z,EAAEkV,EAAI,EAGZqE,EAAG,GAAKpC,EAAQ,IAn2FX,EAm2F2B0C,EAn2F3B,MAo2FL7Z,EAAEkV,GAAK2E,GAAM,GAIbN,EAAG,GAAKvZ,EAAEkV,EAAI,EAGTlV,EAiBT,GAbS,GAALnN,GACF0mB,EAAGjjB,OAAS4rB,EACZhf,EAAI,EACJgf,MAEA3I,EAAGjjB,OAAS4rB,EAAM,EAClBhf,EAAIiU,EAAQ,GAr3FL,EAq3FoBtkB,GAI3B0mB,EAAG2I,GAAOta,EAAI,GAAKkQ,EAAIX,EAAQ,GAAI9P,EAASO,GAAKuP,EAAQ,GAAIvP,GAAK,GAAK1E,EAAI,GAGzE+e,EACF,OAAS,CAGP,GAAW,GAAPC,EAAU,CAGZ,IAAKrvB,EAAI,EAAG+U,EAAI2R,EAAG,GAAI3R,GAAK,GAAIA,GAAK,GAAI/U,IAEzC,IADA+U,EAAI2R,EAAG,IAAMrW,EACRA,EAAI,EAAG0E,GAAK,GAAIA,GAAK,GAAI1E,IAG1BrQ,GAAKqQ,IACPlD,EAAEkV,IACEqE,EAAG,IAAM/B,IAAM+B,EAAG,GAAK,IAG7B,MAGA,GADAA,EAAG2I,IAAQhf,EACPqW,EAAG2I,IAAQ1K,EAAM,MACrB+B,EAAG2I,KAAS,EACZhf,EAAI,EAMV,IAAKrQ,EAAI0mB,EAAGjjB,OAAoB,IAAZijB,IAAK1mB,IAAW0mB,EAAG6E,MAsBzC,OAnBIrH,IAGE/W,EAAEkV,EAAI+D,EAAKpC,MAGb7W,EAAE7M,EAAI,KACN6M,EAAEkV,EAAI3N,KAGGvH,EAAEkV,EAAI+D,EAAKrC,OAGpB5W,EAAEkV,EAAI,EACNlV,EAAE7M,EAAI,CAAC,KAKJ6M,EAIT,SAASwf,EAAexf,EAAGoiB,EAAOvI,GAChC,IAAK7Z,EAAEoJ,WAAY,OAAOiZ,EAAkBriB,GAC5C,IAAIkD,EACFgS,EAAIlV,EAAEkV,EACNjC,EAAM0E,EAAe3X,EAAE7M,GACvB2Q,EAAMmP,EAAI3c,OAwBZ,OAtBI8rB,GACEvI,IAAO3W,EAAI2W,EAAK/V,GAAO,EACzBmP,EAAMA,EAAI9B,OAAO,GAAK,IAAM8B,EAAIpQ,MAAM,GAAKkV,EAAc7U,GAChDY,EAAM,IACfmP,EAAMA,EAAI9B,OAAO,GAAK,IAAM8B,EAAIpQ,MAAM,IAGxCoQ,EAAMA,GAAOjT,EAAEkV,EAAI,EAAI,IAAM,MAAQlV,EAAEkV,GAC9BA,EAAI,GACbjC,EAAM,KAAO8E,GAAe7C,EAAI,GAAKjC,EACjC4G,IAAO3W,EAAI2W,EAAK/V,GAAO,IAAGmP,GAAO8E,EAAc7U,KAC1CgS,GAAKpR,GACdmP,GAAO8E,EAAc7C,EAAI,EAAIpR,GACzB+V,IAAO3W,EAAI2W,EAAK3E,EAAI,GAAK,IAAGjC,EAAMA,EAAM,IAAM8E,EAAc7U,OAE3DA,EAAIgS,EAAI,GAAKpR,IAAKmP,EAAMA,EAAIpQ,MAAM,EAAGK,GAAK,IAAM+P,EAAIpQ,MAAMK,IAC3D2W,IAAO3W,EAAI2W,EAAK/V,GAAO,IACrBoR,EAAI,IAAMpR,IAAKmP,GAAO,KAC1BA,GAAO8E,EAAc7U,KAIlB+P,EAKT,SAASqL,EAAkBjX,EAAQ6N,GACjC,IAAI4C,EAAIzQ,EAAO,GAGf,IAAM6N,GAx9FK,EAw9FU4C,GAAK,GAAIA,GAAK,GAAI5C,IACvC,OAAOA,EAIT,SAAS8I,EAAQ/E,EAAMY,EAAID,GACzB,GAAIC,EAAKpC,EAKP,MAFAV,GAAW,EACP6C,IAAIX,EAAK1C,UAAYqD,GACnBvJ,MAh/FiB4G,2CAk/FzB,OAAO6B,EAAS,IAAIG,EAAK5C,GAAOwD,EAAI,GAAG,GAIzC,SAASwC,EAAMpD,EAAMY,EAAI3B,GACvB,GAAI2B,EAAKnC,EAAc,MAAMrH,MAv/FJ4G,2CAw/FzB,OAAO6B,EAAS,IAAIG,EAAK3O,GAAKuP,EAAI3B,GAAI,GAIxC,SAAS0G,EAAavX,GACpB,IAAIyQ,EAAIzQ,EAAO/Q,OAAS,EACtBwN,EAj/FS,EAi/FHgU,EAAe,EAKvB,GAHAA,EAAIzQ,EAAOyQ,GAGJ,CAGL,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIhU,IAG7B,IAAKgU,EAAIzQ,EAAO,GAAIyQ,GAAK,GAAIA,GAAK,GAAIhU,IAGxC,OAAOA,EAIT,SAASiU,EAAc7U,GAErB,IADA,IAAIof,EAAK,GACFpf,KAAMof,GAAM,IACnB,OAAOA,EAWT,SAAS/B,EAAOtH,EAAMjZ,EAAG1L,EAAGslB,GAC1B,IAAIoI,EACFruB,EAAI,IAAIslB,EAAK,GAIb/V,EAAIhO,KAAKuW,KAAKmO,EAvhGL,EAuhGqB,GAIhC,IAFA7C,GAAW,IAEF,CAOP,GANIziB,EAAI,GAEFiuB,GADJ5uB,EAAIA,EAAEsmB,MAAMja,IACG7M,EAAG+P,KAAI8e,GAAc,GAI5B,KADV1tB,EAAI4iB,EAAU5iB,EAAI,IACL,CAGXA,EAAIX,EAAER,EAAEmD,OAAS,EACb0rB,GAA0B,IAAXruB,EAAER,EAAEmB,MAAYX,EAAER,EAAEmB,GACvC,MAIFiuB,GADAviB,EAAIA,EAAEia,MAAMja,IACD7M,EAAG+P,GAKhB,OAFA6T,GAAW,EAEJpjB,EAIT,SAAS6uB,EAAMluB,GACb,OAA6B,EAAtBA,EAAEnB,EAAEmB,EAAEnB,EAAEmD,OAAS,GAO1B,SAASmsB,EAASxJ,EAAMhJ,EAAMyS,GAK5B,IAJA,IAAIjY,EACFzK,EAAI,IAAIiZ,EAAKhJ,EAAK,IAClBpd,EAAI,IAEGA,EAAIod,EAAK3Z,QAAS,CAEzB,KADAmU,EAAI,IAAIwO,EAAKhJ,EAAKpd,KACX+B,EAAG,CACRoL,EAAIyK,EACJ,MACSzK,EAAE0iB,GAAMjY,KACjBzK,EAAIyK,GAIR,OAAOzK,EAmCT,SAASwe,EAAmBxe,EAAG6Z,GAC7B,IAAI+D,EAAa+E,EAAO/a,EAAGkC,EAAK8Y,EAAK7uB,EAAG4oB,EACtCpC,EAAM,EACN1nB,EAAI,EACJqQ,EAAI,EACJ+V,EAAOjZ,EAAEpK,YACTsiB,EAAKe,EAAKzC,SACVoD,EAAKX,EAAK1C,UAGZ,IAAKvW,EAAE7M,IAAM6M,EAAE7M,EAAE,IAAM6M,EAAEkV,EAAI,GAE3B,OAAO,IAAI+D,EAAKjZ,EAAE7M,EACb6M,EAAE7M,EAAE,GAAS6M,EAAEpL,EAAI,EAAI,EAAI,IAAlB,EACVoL,EAAEpL,EAAIoL,EAAEpL,EAAI,EAAI,EAAIoL,EAAI,KAa9B,IAVU,MAAN6Z,GACF9C,GAAW,EACX4F,EAAM/C,GAEN+C,EAAM9C,EAGR9lB,EAAI,IAAIklB,EAAK,QAGNjZ,EAAEkV,GAAK,GAGZlV,EAAIA,EAAEia,MAAMlmB,GACZmP,GAAK,EAUP,IAJAyZ,GADAgG,EAAQztB,KAAK6T,IAAIoO,EAAQ,EAAGjU,IAAMhO,KAAKmhB,KAAO,EAAI,EAAI,EAEtDuH,EAAc9T,EAAM8Y,EAAM,IAAI3J,EAAK,GACnCA,EAAK1C,UAAYoG,IAER,CAKP,GAJA7S,EAAMgP,EAAShP,EAAImQ,MAAMja,GAAI2c,EAAK,GAClCiB,EAAcA,EAAY3D,QAAQpnB,GAG9B8kB,GAFJ5jB,EAAI6uB,EAAInZ,KAAKkR,EAAO7Q,EAAK8T,EAAajB,EAAK,KAEtBxpB,GAAG0P,MAAM,EAAG8Z,KAAShF,EAAeiL,EAAIzvB,GAAG0P,MAAM,EAAG8Z,GAAM,CAE7E,IADA/U,EAAI1E,EACG0E,KAAKgb,EAAM9J,EAAS8J,EAAI3I,MAAM2I,GAAMjG,EAAK,GAOhD,GAAU,MAAN9C,EAYF,OADAZ,EAAK1C,UAAYqD,EACVgJ,EAVP,KAAIrI,EAAM,GAAKtC,EAAoB2K,EAAIzvB,EAAGwpB,EAAMgG,EAAOzK,EAAIqC,IAMzD,OAAOzB,EAAS8J,EAAK3J,EAAK1C,UAAYqD,EAAI1B,EAAInB,GAAW,GALzDkC,EAAK1C,UAAYoG,GAAO,GACxBiB,EAAc9T,EAAM/V,EAAI,IAAIklB,EAAK,GACjCpmB,EAAI,EACJ0nB,IAUNqI,EAAM7uB,GAoBV,SAASgqB,EAAiBtT,EAAGoP,GAC3B,IAAI3mB,EAAG2vB,EAAIjF,EAAa1I,EAAG4N,EAAWvI,EAAKqI,EAAK7uB,EAAG4oB,EAAKoG,EAAI/F,EAC1D1oB,EAAI,EAEJ0L,EAAIyK,EACJ8O,EAAKvZ,EAAE7M,EACP8lB,EAAOjZ,EAAEpK,YACTsiB,EAAKe,EAAKzC,SACVoD,EAAKX,EAAK1C,UAGZ,GAAIvW,EAAEpL,EAAI,IAAM2kB,IAAOA,EAAG,KAAOvZ,EAAEkV,GAAc,GAATqE,EAAG,IAAwB,GAAbA,EAAGjjB,OACvD,OAAO,IAAI2iB,EAAKM,IAAOA,EAAG,IAAK,IAAgB,GAAPvZ,EAAEpL,EAAS2S,IAAMgS,EAAK,EAAIvZ,GAcpE,GAXU,MAAN6Z,GACF9C,GAAW,EACX4F,EAAM/C,GAEN+C,EAAM9C,EAGRZ,EAAK1C,UAAYoG,GAnBP,GAqBVkG,GADA3vB,EAAIykB,EAAe4B,IACZpI,OAAO,KAEVjc,KAAK2T,IAAIqM,EAAIlV,EAAEkV,GAAK,OAqCtB,OAJAnhB,EAAIiqB,EAAQ/E,EAAM0D,EAAM,EAAG/C,GAAIK,MAAM/E,EAAI,IACzClV,EAAI+d,EAAiB,IAAI9E,EAAK4J,EAAK,IAAM3vB,EAAE2P,MAAM,IAAK8Z,EAzD9C,IAyD2DlT,KAAK1V,GACxEklB,EAAK1C,UAAYqD,EAEJ,MAANC,EAAaf,EAAS9Y,EAAG4Z,EAAI1B,EAAInB,GAAW,GAAQ/W,EAxB3D,KAAO6iB,EAAK,GAAW,GAANA,GAAiB,GAANA,GAAW3vB,EAAEie,OAAO,GAAK,GAGnD0R,GADA3vB,EAAIykB,GADJ3X,EAAIA,EAAEia,MAAMxP,IACStX,IACdge,OAAO,GACd7c,IAiCJ,IA9BE4gB,EAAIlV,EAAEkV,EAEF2N,EAAK,GACP7iB,EAAI,IAAIiZ,EAAK,KAAO/lB,GACpBgiB,KAEAlV,EAAI,IAAIiZ,EAAK4J,EAAK,IAAM3vB,EAAE2P,MAAM,IAepCkgB,EAAK/iB,EAKL4iB,EAAME,EAAY9iB,EAAI2a,EAAO3a,EAAE0J,MAAM,GAAI1J,EAAEyJ,KAAK,GAAIkT,EAAK,GACzDK,EAAKlE,EAAS9Y,EAAEia,MAAMja,GAAI2c,EAAK,GAC/BiB,EAAc,IAEL,CAIP,GAHAkF,EAAYhK,EAASgK,EAAU7I,MAAM+C,GAAKL,EAAK,GAG3ChF,GAFJ5jB,EAAI6uB,EAAInZ,KAAKkR,EAAOmI,EAAW,IAAI7J,EAAK2E,GAAcjB,EAAK,KAEtCxpB,GAAG0P,MAAM,EAAG8Z,KAAShF,EAAeiL,EAAIzvB,GAAG0P,MAAM,EAAG8Z,GAAM,CAc7E,GAbAiG,EAAMA,EAAI3I,MAAM,GAIN,IAAN/E,IAAS0N,EAAMA,EAAInZ,KAAKuU,EAAQ/E,EAAM0D,EAAM,EAAG/C,GAAIK,MAAM/E,EAAI,MACjE0N,EAAMjI,EAAOiI,EAAK,IAAI3J,EAAK3kB,GAAIqoB,EAAK,GAQ1B,MAAN9C,EAWF,OADAZ,EAAK1C,UAAYqD,EACVgJ,EAVP,IAAI3K,EAAoB2K,EAAIzvB,EAAGwpB,EA5F3B,GA4FwCzE,EAAIqC,GAM9C,OAAOzB,EAAS8J,EAAK3J,EAAK1C,UAAYqD,EAAI1B,EAAInB,GAAW,GALzDkC,EAAK1C,UAAYoG,GA7Ff,GA8FF5oB,EAAI+uB,EAAY9iB,EAAI2a,EAAOoI,EAAGrZ,MAAM,GAAIqZ,EAAGtZ,KAAK,GAAIkT,EAAK,GACzDK,EAAKlE,EAAS9Y,EAAEia,MAAMja,GAAI2c,EAAK,GAC/BiB,EAAcrD,EAAM,EAU1BqI,EAAM7uB,EACN6pB,GAAe,GAMnB,SAASyE,EAAkBriB,GAEzB,OAAOnD,OAAOmD,EAAEpL,EAAIoL,EAAEpL,EAAI,GAO5B,SAASouB,EAAahjB,EAAGiT,GACvB,IAAIiC,EAAGriB,EAAGiR,EAmBV,KAhBKoR,EAAIjC,EAAI0F,QAAQ,OAAS,IAAG1F,EAAMA,EAAI5G,QAAQ,IAAK,MAGnDxZ,EAAIogB,EAAIgQ,OAAO,OAAS,GAGvB/N,EAAI,IAAGA,EAAIriB,GACfqiB,IAAMjC,EAAIpQ,MAAMhQ,EAAI,GACpBogB,EAAMA,EAAIiQ,UAAU,EAAGrwB,IACdqiB,EAAI,IAGbA,EAAIjC,EAAI3c,QAILzD,EAAI,EAAyB,KAAtBogB,EAAIpM,WAAWhU,GAAWA,KAGtC,IAAKiR,EAAMmP,EAAI3c,OAAoC,KAA5B2c,EAAIpM,WAAW/C,EAAM,KAAaA,GAGzD,GAFAmP,EAAMA,EAAIpQ,MAAMhQ,EAAGiR,GAEV,CAYP,GAXAA,GAAOjR,EACPmN,EAAEkV,EAAIA,EAAIA,EAAIriB,EAAI,EAClBmN,EAAE7M,EAAI,GAMNN,GAAKqiB,EAAI,GAz2GA,EA02GLA,EAAI,IAAGriB,GA12GF,GA42GLA,EAAIiR,EAAK,CAEX,IADIjR,GAAGmN,EAAE7M,EAAE+a,MAAM+E,EAAIpQ,MAAM,EAAGhQ,IACzBiR,GA92GE,EA82GejR,EAAIiR,GAAM9D,EAAE7M,EAAE+a,MAAM+E,EAAIpQ,MAAMhQ,EAAGA,GA92GhD,IAg3GPA,EAh3GO,GA+2GPogB,EAAMA,EAAIpQ,MAAMhQ,IACGyD,YAEnBzD,GAAKiR,EAGP,KAAOjR,KAAMogB,GAAO,IACpBjT,EAAE7M,EAAE+a,MAAM+E,GAEN8D,IAGE/W,EAAEkV,EAAIlV,EAAEpK,YAAYihB,MAGtB7W,EAAE7M,EAAI,KACN6M,EAAEkV,EAAI3N,KAGGvH,EAAEkV,EAAIlV,EAAEpK,YAAYghB,OAG7B5W,EAAEkV,EAAI,EACNlV,EAAE7M,EAAI,CAAC,UAOX6M,EAAEkV,EAAI,EACNlV,EAAE7M,EAAI,CAAC,GAGT,OAAO6M,EAOT,SAASmjB,EAAWnjB,EAAGiT,GACrB,IAAIyK,EAAMzE,EAAMmK,EAASvwB,EAAGwwB,EAASvf,EAAKnP,EAAG4kB,EAAI2E,EAEjD,GAAIjL,EAAI0F,QAAQ,MAAQ,GAEtB,GADA1F,EAAMA,EAAI5G,QAAQ,eAAgB,MAC9BkL,EAAUza,KAAKmW,GAAM,OAAO+P,EAAahjB,EAAGiT,QAC3C,GAAY,aAARA,GAA8B,QAARA,EAI/B,OAHMA,IAAKjT,EAAEpL,EAAI2S,KACjBvH,EAAEkV,EAAI3N,IACNvH,EAAE7M,EAAI,KACC6M,EAGT,GAAIqX,EAAMva,KAAKmW,GACbyK,EAAO,GACPzK,EAAMA,EAAIqQ,mBACL,GAAIlM,EAASta,KAAKmW,GACvByK,EAAO,MACF,KAAIpG,EAAQxa,KAAKmW,GAGtB,MAAM5C,MAAM2G,EAAkB/D,GAF9ByK,EAAO,EAkCT,KA5BA7qB,EAAIogB,EAAIgQ,OAAO,OAEP,GACNtuB,GAAKse,EAAIpQ,MAAMhQ,EAAI,GACnBogB,EAAMA,EAAIiQ,UAAU,EAAGrwB,IAEvBogB,EAAMA,EAAIpQ,MAAM,GAMlBwgB,GADAxwB,EAAIogB,EAAI0F,QAAQ,OACD,EACfM,EAAOjZ,EAAEpK,YAELytB,IAGFxwB,GADAiR,GADAmP,EAAMA,EAAI5G,QAAQ,IAAK,KACb/V,QACAzD,EAGVuwB,EAAU7C,EAAOtH,EAAM,IAAIA,EAAKyE,GAAO7qB,EAAO,EAAJA,IAOvCA,EAHLqrB,GADA3E,EAAKjB,EAAYrF,EAAKyK,EAAMlG,IACpBlhB,OAAS,EAGM,IAAVijB,EAAG1mB,KAAYA,EAAG0mB,EAAG6E,MAClC,OAAIvrB,EAAI,EAAU,IAAIomB,EAAW,EAANjZ,EAAEpL,IAC7BoL,EAAEkV,EAAIoJ,EAAkB/E,EAAI2E,GAC5Ble,EAAE7M,EAAIomB,EACNxC,GAAW,EAQPsM,IAASrjB,EAAI2a,EAAO3a,EAAGojB,EAAe,EAANtf,IAGhCnP,IAAGqL,EAAIA,EAAEia,MAAM/kB,KAAK2T,IAAIlU,GAAK,GAAKwiB,EAAQ,EAAGxiB,GAAKqhB,EAAQlM,IAAI,EAAGnV,KACrEoiB,GAAW,EAEJ/W,GA2CT,SAASga,EAAaf,EAAM3kB,EAAG0L,EAAGyK,EAAG8Y,GACnC,IAAI3b,EAAG7T,EAAGyvB,EAAGxG,EAEXpD,EAAKX,EAAK1C,UACVrT,EAAIhO,KAAKuW,KAAKmO,EA9gHL,GAohHX,IAJA7C,GAAW,EACXiG,EAAKhd,EAAEia,MAAMja,GACbwjB,EAAI,IAAIvK,EAAKxO,KAEJ,CAMP,GALA1W,EAAI4mB,EAAO6I,EAAEvJ,MAAM+C,GAAK,IAAI/D,EAAK3kB,IAAMA,KAAMslB,EAAI,GACjD4J,EAAID,EAAe9Y,EAAEhB,KAAK1V,GAAK0W,EAAEf,MAAM3V,GACvC0W,EAAIkQ,EAAO5mB,EAAEkmB,MAAM+C,GAAK,IAAI/D,EAAK3kB,IAAMA,KAAMslB,EAAI,QAGlC,KAFf7lB,EAAIyvB,EAAE/Z,KAAKgB,IAELtX,EAAE+P,GAAe,CACrB,IAAK0E,EAAI1E,EAAGnP,EAAEZ,EAAEyU,KAAO4b,EAAErwB,EAAEyU,IAAMA,MACjC,IAAU,GAANA,EAAS,MAGfA,EAAI4b,EACJA,EAAI/Y,EACJA,EAAI1W,EACJA,EAAI6T,EAON,OAHAmP,GAAW,EACXhjB,EAAEZ,EAAEmD,OAAS4M,EAAI,EAEVnP,EAKT,SAASgmB,EAAQpR,EAAGuM,GAElB,IADA,IAAI5gB,EAAIqU,IACCuM,GAAG5gB,GAAKqU,EACjB,OAAOrU,EAKT,SAAS6lB,EAAiBlB,EAAMjZ,GAC9B,IAAIjM,EACFqoB,EAAQpc,EAAEpL,EAAI,EACd6uB,EAAKpH,EAAMpD,EAAMA,EAAK1C,UAAW,GACjC4F,EAASsH,EAAGxJ,MAAM,IAIpB,IAFAja,EAAIA,EAAE6I,OAEA0T,IAAIJ,GAER,OADAjG,EAAWkG,EAAQ,EAAI,EAChBpc,EAKT,IAFAjM,EAAIiM,EAAEkb,SAASuI,IAET3J,SACJ5D,EAAWkG,EAAQ,EAAI,MAClB,CAIL,IAHApc,EAAIA,EAAE0J,MAAM3V,EAAEkmB,MAAMwJ,KAGdlH,IAAIJ,GAER,OADAjG,EAAWsM,EAAMzuB,GAAMqoB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAC9Cpc,EAGTkW,EAAWsM,EAAMzuB,GAAMqoB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAGvD,OAAOpc,EAAE0J,MAAM+Z,GAAI5a,MASrB,SAASwW,EAAerf,EAAGwY,EAASqB,EAAI3B,GACtC,IAAIwF,EAAMxI,EAAGriB,EAAGqQ,EAAGY,EAAKme,EAAShP,EAAKsG,EAAI9O,EACxCwO,EAAOjZ,EAAEpK,YACTwsB,OAAe,IAAPvI,EAWV,GATIuI,GACFpK,EAAW6B,EAAI,EAlsHJ,UAmsHA,IAAP3B,EAAeA,EAAKe,EAAKzC,SACxBwB,EAAWE,EAAI,EAAG,KAEvB2B,EAAKZ,EAAK1C,UACV2B,EAAKe,EAAKzC,UAGPxW,EAAEoJ,WAEA,CAoCL,IA3BIgZ,GACF1E,EAAO,EACQ,IAAXlF,EACFqB,EAAU,EAALA,EAAS,EACM,GAAXrB,IACTqB,EAAU,EAALA,EAAS,IAGhB6D,EAAOlF,GAfT3lB,GADAogB,EAAMuM,EAAexf,IACb2Y,QAAQ,OAsBP,IACP1F,EAAMA,EAAI5G,QAAQ,IAAK,KACvB5B,EAAI,IAAIwO,EAAK,IACX/D,EAAIjC,EAAI3c,OAASzD,EACnB4X,EAAEtX,EAAImlB,EAAYkH,EAAe/U,GAAI,GAAIiT,GACzCjT,EAAEyK,EAAIzK,EAAEtX,EAAEmD,QAIZ4e,EAAIpR,GADJyV,EAAKjB,EAAYrF,EAAK,GAAIyK,IACbpnB,OAGO,GAAbijB,IAAKzV,IAAYyV,EAAG6E,MAE3B,GAAK7E,EAAG,GAED,CAyBL,GAxBI1mB,EAAI,EACNqiB,MAEAlV,EAAI,IAAIiZ,EAAKjZ,IACX7M,EAAIomB,EACNvZ,EAAEkV,EAAIA,EAENqE,GADAvZ,EAAI2a,EAAO3a,EAAGyK,EAAGoP,EAAI3B,EAAI,EAAGwF,IACrBvqB,EACP+hB,EAAIlV,EAAEkV,EACN+M,EAAUhM,GAIZpjB,EAAI0mB,EAAGM,GACP3W,EAAIwa,EAAO,EACXuE,EAAUA,QAA0B,IAAf1I,EAAGM,EAAK,GAE7BoI,EAAU/J,EAAK,QACJ,IAANrlB,GAAgBovB,KAAoB,IAAP/J,GAAYA,KAAQlY,EAAEpL,EAAI,EAAI,EAAI,IAChE/B,EAAIqQ,GAAKrQ,IAAMqQ,IAAa,IAAPgV,GAAY+J,GAAkB,IAAP/J,GAAyB,EAAbqB,EAAGM,EAAK,IAChE3B,KAAQlY,EAAEpL,EAAI,EAAI,EAAI,IAE1B2kB,EAAGjjB,OAASujB,EAERoI,EAGF,OAAS1I,IAAKM,GAAM6D,EAAO,GACzBnE,EAAGM,GAAM,EACJA,MACD3E,EACFqE,EAAGoF,QAAQ,IAMjB,IAAK7a,EAAMyV,EAAGjjB,QAASijB,EAAGzV,EAAM,KAAMA,GAGtC,IAAKjR,EAAI,EAAGogB,EAAM,GAAIpgB,EAAIiR,EAAKjR,IAAKogB,GAAOmD,EAASjF,OAAOoI,EAAG1mB,IAG9D,GAAIuvB,EAAO,CACT,GAAIte,EAAM,EACR,GAAe,IAAX0U,GAA4B,GAAXA,EAAc,CAEjC,IADA3lB,EAAe,IAAX2lB,EAAgB,EAAI,IACjB1U,EAAKA,EAAMjR,EAAGiR,IAAOmP,GAAO,IAEnC,IAAKnP,GADLyV,EAAKjB,EAAYrF,EAAKyK,EAAMlF,IACdliB,QAASijB,EAAGzV,EAAM,KAAMA,GAGtC,IAAKjR,EAAI,EAAGogB,EAAM,KAAMpgB,EAAIiR,EAAKjR,IAAKogB,GAAOmD,EAASjF,OAAOoI,EAAG1mB,SAEhEogB,EAAMA,EAAI9B,OAAO,GAAK,IAAM8B,EAAIpQ,MAAM,GAI1CoQ,EAAOA,GAAOiC,EAAI,EAAI,IAAM,MAAQA,OAC/B,GAAIA,EAAI,EAAG,CAChB,OAASA,GAAIjC,EAAM,IAAMA,EACzBA,EAAM,KAAOA,OAEb,KAAMiC,EAAIpR,EAAK,IAAKoR,GAAKpR,EAAKoR,KAAOjC,GAAO,SACnCiC,EAAIpR,IAAKmP,EAAMA,EAAIpQ,MAAM,EAAGqS,GAAK,IAAMjC,EAAIpQ,MAAMqS,SAlE5DjC,EAAMmP,EAAQ,OAAS,IAsEzBnP,GAAkB,IAAXuF,EAAgB,KAAkB,GAAXA,EAAe,KAAkB,GAAXA,EAAe,KAAO,IAAMvF,OA9GhFA,EAAMoP,EAAkBriB,GAiH1B,OAAOA,EAAEpL,EAAI,EAAI,IAAMqe,EAAMA,EAK/B,SAASsP,EAASrd,EAAKpB,GACrB,GAAIoB,EAAI5O,OAASwN,EAEf,OADAoB,EAAI5O,OAASwN,GACN,EA2DX,SAAS+E,EAAI7I,GACX,OAAO,IAAIvN,KAAKuN,GAAG6I,MAUrB,SAASiC,EAAK9K,GACZ,OAAO,IAAIvN,KAAKuN,GAAG8K,OAWrB,SAASS,EAAMvL,GACb,OAAO,IAAIvN,KAAKuN,GAAGuL,QAYrB,SAAS7L,GAAIM,EAAGyK,GACd,OAAO,IAAIhY,KAAKuN,GAAGyJ,KAAKgB,GAW1B,SAASM,GAAK/K,GACZ,OAAO,IAAIvN,KAAKuN,GAAG+K,OAWrB,SAASO,GAAMtL,GACb,OAAO,IAAIvN,KAAKuN,GAAGsL,QAWrB,SAAST,GAAK7K,GACZ,OAAO,IAAIvN,KAAKuN,GAAG6K,OAWrB,SAASQ,GAAMrL,GACb,OAAO,IAAIvN,KAAKuN,GAAGqL,QA6BrB,SAAStB,GAAMU,EAAGzK,GAChByK,EAAI,IAAIhY,KAAKgY,GACbzK,EAAI,IAAIvN,KAAKuN,GACb,IAAIrM,EACFimB,EAAKnnB,KAAK8jB,UACV2B,EAAKzlB,KAAK+jB,SACVmG,EAAM/C,EAAK,EAkCb,OA/BKnP,EAAE7V,GAAMoL,EAAEpL,EAIH6V,EAAEtX,GAAM6M,EAAE7M,GAKV6M,EAAE7M,GAAKsX,EAAEqP,UACnBnmB,EAAIqM,EAAEpL,EAAI,EAAIynB,EAAM5pB,KAAMmnB,EAAI1B,GAAM,IAAIzlB,KAAK,IAC3CmC,EAAI6V,EAAE7V,GAGE6V,EAAEtX,GAAK6M,EAAE8Z,UACnBnmB,EAAI0oB,EAAM5pB,KAAMkqB,EAAK,GAAG1C,MAAM,KAC5BrlB,EAAI6V,EAAE7V,EAGCoL,EAAEpL,EAAI,GACfnC,KAAK8jB,UAAYoG,EACjBlqB,KAAK+jB,SAAW,EAChB7iB,EAAIlB,KAAKoY,KAAK8P,EAAOlQ,EAAGzK,EAAG2c,EAAK,IAChC3c,EAAIqc,EAAM5pB,KAAMkqB,EAAK,GACrBlqB,KAAK8jB,UAAYqD,EACjBnnB,KAAK+jB,SAAW0B,EAChBvkB,EAAI8W,EAAE7V,EAAI,EAAIjB,EAAE+V,MAAM1J,GAAKrM,EAAE8V,KAAKzJ,IAElCrM,EAAIlB,KAAKoY,KAAK8P,EAAOlQ,EAAGzK,EAAG2c,EAAK,KAvBhChpB,EAAI0oB,EAAM5pB,KAAMkqB,EAAK,GAAG1C,MAAMja,EAAEpL,EAAI,EAAI,IAAO,MAC7CA,EAAI6V,EAAE7V,EALRjB,EAAI,IAAIlB,KAAK8U,KA8BR5T,EAWT,SAAS2mB,GAAKta,GACZ,OAAO,IAAIvN,KAAKuN,GAAGsa,OAUrB,SAAS7O,GAAKzL,GACZ,OAAO8Y,EAAS9Y,EAAI,IAAIvN,KAAKuN,GAAIA,EAAEkV,EAAI,EAAG,GAY5C,SAAS8D,GAAMhZ,EAAG2F,EAAK/C,GACrB,OAAO,IAAInQ,KAAKuN,GAAGgZ,MAAMrT,EAAK/C,GAsBhC,SAAS8gB,GAAOhuB,GACd,IAAKA,GAAsB,iBAARA,EAAkB,MAAM2a,MAAM4G,kCACjD,IAAIpkB,EAAG8B,EAAGuc,EACRyS,GAA+B,IAAjBjuB,EAAIkuB,SAClBC,EAAK,CACH,YAAa,EAxlIJ,IAylIT,WAAY,EAAG,EACf,YAAa1N,EAAW,EACxB,WAAY,EAAGA,EACf,OAAQ,EAAGA,EACX,QAASA,EAAW,EACpB,SAAU,EAAG,GAGjB,IAAKtjB,EAAI,EAAGA,EAAIgxB,EAAGvtB,OAAQzD,GAAK,EAE9B,GADI8B,EAAIkvB,EAAGhxB,GAAI8wB,IAAalxB,KAAKkC,GAAK2hB,EAAS3hB,SAC1B,KAAhBuc,EAAIxb,EAAIf,IAAgB,CAC3B,KAAIuiB,EAAUhG,KAAOA,GAAKA,GAAK2S,EAAGhxB,EAAI,IAAMqe,GAAK2S,EAAGhxB,EAAI,IACnD,MAAMwd,MAAM2G,EAAkBriB,EAAI,KAAOuc,GADcze,KAAKkC,GAAKuc,EAM1E,GADIvc,EAAI,SAAUgvB,IAAalxB,KAAKkC,GAAK2hB,EAAS3hB,SAC7B,KAAhBuc,EAAIxb,EAAIf,IAAgB,CAC3B,IAAU,IAANuc,IAAoB,IAANA,GAAqB,IAANA,GAAiB,IAANA,EAY1C,MAAMb,MAAM2G,EAAkBriB,EAAI,KAAOuc,GAXzC,GAAIA,EAAG,CACL,GAAqB,oBAAV4F,SAAyBA,SACjCA,OAAOgN,kBAAmBhN,OAAOiN,YAGlC,MAAM1T,MA7hIM4G,qCA2hIZxkB,KAAKkC,IAAK,OAKZlC,KAAKkC,IAAK,EAOhB,OAAOlC,KAWT,SAAS4W,GAAIrJ,GACX,OAAO,IAAIvN,KAAKuN,GAAGqJ,MAWrB,SAASjB,GAAKpI,GACZ,OAAO,IAAIvN,KAAKuN,GAAGoI,OAyMrB,SAAS4S,GAAIhb,EAAGyK,GACd,OAAO,IAAIhY,KAAKuN,GAAGgb,IAAIvQ,GAWzB,SAASpC,GAAIrI,GACX,OAAO,IAAIvN,KAAKuN,GAAGqI,MAUrB,SAASqD,GAAM1L,GACb,OAAO8Y,EAAS9Y,EAAI,IAAIvN,KAAKuN,GAAIA,EAAEkV,EAAI,EAAG,GAa5C,SAAS8O,KACP,IAAInxB,EAAGyB,EACLP,EAAI,IAAItB,KAAK,GAIf,IAFAskB,GAAW,EAENlkB,EAAI,EAAGA,EAAIwD,UAAUC,QAExB,IADAhC,EAAI,IAAI7B,KAAK4D,UAAUxD,OAChBM,EAMIY,EAAEZ,IACXY,EAAIA,EAAE0V,KAAKnV,EAAE2lB,MAAM3lB,SAPX,CACR,GAAIA,EAAEM,EAEJ,OADAmiB,GAAW,EACJ,IAAItkB,KAAK,KAElBsB,EAAIO,EAQR,OAFAyiB,GAAW,EAEJhjB,EAAEoW,OASX,SAAS8Z,GAAkBvuB,GACzB,OAAOA,aAAesgB,GAAWtgB,GAAOA,EAAI7B,cAAgB8a,IAAO,EAWrE,SAAS6N,GAAGxc,GACV,OAAO,IAAIvN,KAAKuN,GAAGwc,KAcrB,SAASzT,GAAI/I,EAAGyK,GACd,OAAO,IAAIhY,KAAKuN,GAAG+I,IAAI0B,GAWzB,SAASyZ,GAAKlkB,GACZ,OAAO,IAAIvN,KAAKuN,GAAG+I,IAAI,GAWzB,SAASob,GAAMnkB,GACb,OAAO,IAAIvN,KAAKuN,GAAG+I,IAAI,IAUzB,SAASnG,KACP,OAAO6f,EAAShwB,KAAM4D,UAAW,MAUnC,SAASsP,KACP,OAAO8c,EAAShwB,KAAM4D,UAAW,MAYnC,SAASkoB,GAAIve,EAAGyK,GACd,OAAO,IAAIhY,KAAKuN,GAAGue,IAAI9T,GAYzB,SAASyU,GAAIlf,EAAGyK,GACd,OAAO,IAAIhY,KAAKuN,GAAGkf,IAAIzU,GAYzB,SAASX,GAAI9J,EAAGyK,GACd,OAAO,IAAIhY,KAAKuN,GAAG8J,IAAIW,GAYzB,SAAS2Z,GAAOvK,GACd,IAAI1mB,EAAG+hB,EAAGhS,EAAG5O,EACXzB,EAAI,EACJc,EAAI,IAAIlB,KAAK,GACb4lB,EAAK,GAOP,QALW,IAAPwB,EAAeA,EAAKpnB,KAAK8jB,UACxByB,EAAW6B,EAAI,EAniJP,KAqiJb3W,EAAIhO,KAAKuW,KAAKoO,EAr8IH,GAu8INpnB,KAAKqkB,OAIH,GAAIA,OAAOgN,gBAGhB,IAFA3wB,EAAI2jB,OAAOgN,gBAAgB,IAAIO,YAAYnhB,IAEpCrQ,EAAIqQ,IACT5O,EAAInB,EAAEN,KAIG,MACPM,EAAEN,GAAKikB,OAAOgN,gBAAgB,IAAIO,YAAY,IAAI,GAKlDhM,EAAGxlB,KAAOyB,EAAI,QAKb,KAAIwiB,OAAOiN,YAwBhB,MAAM1T,MAlgJY4G,qCA++IlB,IAFA9jB,EAAI2jB,OAAOiN,YAAY7gB,GAAK,GAErBrQ,EAAIqQ,IAGT5O,EAAInB,EAAEN,IAAMM,EAAEN,EAAI,IAAM,IAAMM,EAAEN,EAAI,IAAM,MAAmB,IAAXM,EAAEN,EAAI,KAAc,MAG7D,MACPikB,OAAOiN,YAAY,GAAGO,KAAKnxB,EAAGN,IAK9BwlB,EAAGnK,KAAK5Z,EAAI,KACZzB,GAAK,GAITA,EAAIqQ,EAAI,OA5CR,KAAOrQ,EAAIqQ,GAAImV,EAAGxlB,KAAuB,IAAhBqC,KAAKkvB,SAAiB,EA2DjD,IATAvK,GA1/IW,GAy/IX3W,EAAImV,IAAKxlB,KAIAgnB,IACPvlB,EAAI6iB,EAAQ,GA9/IH,EA8/IkB0C,GAC3BxB,EAAGxlB,IAAMqQ,EAAI5O,EAAI,GAAKA,GAIP,IAAV+jB,EAAGxlB,GAAUA,IAAKwlB,EAAG+F,MAG5B,GAAIvrB,EAAI,EACNqiB,EAAI,EACJmD,EAAK,CAAC,OACD,CAIL,IAHAnD,GAAK,EAGY,IAAVmD,EAAG,GAAUnD,GA7gJX,EA6gJ0BmD,EAAGgG,QAGtC,IAAKnb,EAAI,EAAG5O,EAAI+jB,EAAG,GAAI/jB,GAAK,GAAIA,GAAK,GAAI4O,IAGrCA,EAnhJK,IAmhJSgS,GAnhJT,EAmhJyBhS,GAMpC,OAHAvP,EAAEuhB,EAAIA,EACNvhB,EAAER,EAAIklB,EAEC1kB,EAYT,SAASgY,GAAM3L,GACb,OAAO8Y,EAAS9Y,EAAI,IAAIvN,KAAKuN,GAAIA,EAAEkV,EAAI,EAAGziB,KAAK+jB,UAejD,SAASuL,GAAK/hB,GAEZ,OADAA,EAAI,IAAIvN,KAAKuN,IACJ7M,EAAK6M,EAAE7M,EAAE,GAAK6M,EAAEpL,EAAI,EAAIoL,EAAEpL,EAAKoL,EAAEpL,GAAK2S,IAWjD,SAAS+B,GAAItJ,GACX,OAAO,IAAIvN,KAAKuN,GAAGsJ,MAWrB,SAAShB,GAAKtI,GACZ,OAAO,IAAIvN,KAAKuN,GAAGsI,OAWrB,SAAS6B,GAAKnK,GACZ,OAAO,IAAIvN,KAAKuN,GAAGmK,OAYrB,SAAS8T,GAAIje,EAAGyK,GACd,OAAO,IAAIhY,KAAKuN,GAAGie,IAAIxT,GAazB,SAASmY,KACP,IAAI/vB,EAAI,EACNod,EAAO5Z,UACP2J,EAAI,IAAIvN,KAAKwd,EAAKpd,IAGpB,IADAkkB,GAAW,EACJ/W,EAAEpL,KAAO/B,EAAIod,EAAK3Z,QAAS0J,EAAIA,EAAEyJ,KAAKwG,EAAKpd,IAGlD,OAFAkkB,GAAW,EAEJ+B,EAAS9Y,EAAGvN,KAAK8jB,UAAW9jB,KAAK+jB,UAW1C,SAASyI,GAAIjf,GACX,OAAO,IAAIvN,KAAKuN,GAAGif,MAWrB,SAAShD,GAAKjc,GACZ,OAAO,IAAIvN,KAAKuN,GAAGic,OAUrB,SAAS2E,GAAM5gB,GACb,OAAO8Y,EAAS9Y,EAAI,IAAIvN,KAAKuN,GAAIA,EAAEkV,EAAI,EAAG,IAK5Cc,EA1mBA,SAASuO,EAAM7uB,GACb,IAAI7C,EAAG8B,EAAGkvB,EASV,SAAS7N,EAAQ9E,GACf,IAAIgE,EAAGriB,EAAGkB,EACRiM,EAAIvN,KAGN,KAAMuN,aAAagW,GAAU,OAAO,IAAIA,EAAQ9E,GAOhD,GAHAlR,EAAEpK,YAAcogB,EAGZiO,GAAkB/S,GAuBpB,OAtBAlR,EAAEpL,EAAIsc,EAAEtc,OAEJmiB,GACG7F,EAAE/d,GAAK+d,EAAEgE,EAAIc,EAAQa,MAGxB7W,EAAEkV,EAAI3N,IACNvH,EAAE7M,EAAI,MACG+d,EAAEgE,EAAIc,EAAQY,MAGvB5W,EAAEkV,EAAI,EACNlV,EAAE7M,EAAI,CAAC,KAEP6M,EAAEkV,EAAIhE,EAAEgE,EACRlV,EAAE7M,EAAI+d,EAAE/d,EAAE0P,UAGZ7C,EAAEkV,EAAIhE,EAAEgE,EACRlV,EAAE7M,EAAI+d,EAAE/d,EAAI+d,EAAE/d,EAAE0P,QAAUqO,EAAE/d,IAQhC,GAAU,YAFVY,SAAWmd,GAES,CAClB,GAAU,IAANA,EAIF,OAHAlR,EAAEpL,EAAI,EAAIsc,EAAI,GAAK,EAAI,EACvBlR,EAAEkV,EAAI,OACNlV,EAAE7M,EAAI,CAAC,IAYT,GARI+d,EAAI,GACNA,GAAKA,EACLlR,EAAEpL,GAAK,GAEPoL,EAAEpL,EAAI,EAIJsc,MAAQA,GAAKA,EAAI,IAAK,CACxB,IAAKgE,EAAI,EAAGriB,EAAIqe,EAAGre,GAAK,GAAIA,GAAK,GAAIqiB,IAkBrC,YAhBI6B,EACE7B,EAAIc,EAAQa,MACd7W,EAAEkV,EAAI3N,IACNvH,EAAE7M,EAAI,MACG+hB,EAAIc,EAAQY,MACrB5W,EAAEkV,EAAI,EACNlV,EAAE7M,EAAI,CAAC,KAEP6M,EAAEkV,EAAIA,EACNlV,EAAE7M,EAAI,CAAC+d,KAGTlR,EAAEkV,EAAIA,EACNlV,EAAE7M,EAAI,CAAC+d,KAMJ,OAAQ,EAAJA,GAAU,GACdA,IAAGlR,EAAEpL,EAAI2S,KACdvH,EAAEkV,EAAI3N,SACNvH,EAAE7M,EAAI,OAID6vB,EAAahjB,EAAGkR,EAAEnc,YAEpB,GAAU,WAANhB,EACT,MAAMsc,MAAM2G,EAAkB9F,GAahC,OAT8B,MAAzBre,EAAIqe,EAAErK,WAAW,KACpBqK,EAAIA,EAAErO,MAAM,GACZ7C,EAAEpL,GAAK,IAGG,KAAN/B,IAAUqe,EAAIA,EAAErO,MAAM,IAC1B7C,EAAEpL,EAAI,GAGD2iB,EAAUza,KAAKoU,GAAK8R,EAAahjB,EAAGkR,GAAKiS,EAAWnjB,EAAGkR,GA4DhE,GAzDA8E,EAAQvhB,UAAY6P,EAEpB0R,EAAQwO,SAAW,EACnBxO,EAAQyO,WAAa,EACrBzO,EAAQ0O,WAAa,EACrB1O,EAAQ2O,YAAc,EACtB3O,EAAQ4O,cAAgB,EACxB5O,EAAQ6O,gBAAkB,EAC1B7O,EAAQ8O,gBAAkB,EAC1B9O,EAAQ+O,gBAAkB,EAC1B/O,EAAQgP,iBAAmB,EAC3BhP,EAAQiP,OAAS,EAEjBjP,EAAQ0N,OAAS1N,EAAQtb,IAAMgpB,GAC/B1N,EAAQuO,MAAQA,EAChBvO,EAAQuB,UAAY0M,GAEpBjO,EAAQnN,IAAMA,EACdmN,EAAQlL,KAAOA,EACfkL,EAAQzK,MAAQA,EAChByK,EAAQtW,IAAMA,GACdsW,EAAQjL,KAAOA,GACfiL,EAAQ1K,MAAQA,GAChB0K,EAAQnL,KAAOA,GACfmL,EAAQ3K,MAAQA,GAChB2K,EAAQjM,MAAQA,GAChBiM,EAAQsE,KAAOA,GACftE,EAAQvK,KAAOA,GACfuK,EAAQgD,MAAQA,GAChBhD,EAAQ3M,IAAMA,GACd2M,EAAQ5N,KAAOA,GACf4N,EAAQgF,IAAMA,GACdhF,EAAQ3N,IAAMA,GACd2N,EAAQtK,MAAQA,GAChBsK,EAAQgO,MAAQA,GAChBhO,EAAQwG,GAAKA,GACbxG,EAAQjN,IAAMA,GACdiN,EAAQmO,MAAQA,GAChBnO,EAAQkO,KAAOA,GACflO,EAAQpT,IAAMA,GACdoT,EAAQrQ,IAAMA,GACdqQ,EAAQuI,IAAMA,GACdvI,EAAQkJ,IAAMA,GACdlJ,EAAQlM,IAAMA,GACdkM,EAAQoO,OAASA,GACjBpO,EAAQrK,MAAQA,GAChBqK,EAAQ+L,KAAOA,GACf/L,EAAQ1M,IAAMA,GACd0M,EAAQ1N,KAAOA,GACf0N,EAAQ7L,KAAOA,GACf6L,EAAQiI,IAAMA,GACdjI,EAAQ4M,IAAMA,GACd5M,EAAQiJ,IAAMA,GACdjJ,EAAQiG,KAAOA,GACfjG,EAAQ4K,MAAQA,QAEJ,IAARlrB,IAAgBA,EAAM,IACtBA,IACmB,IAAjBA,EAAIkuB,SAEN,IADAC,EAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,UAC5EhxB,EAAI,EAAGA,EAAIgxB,EAAGvtB,QAAcZ,EAAIhB,eAAeC,EAAIkvB,EAAGhxB,QAAO6C,EAAIf,GAAKlC,KAAKkC,IAMpF,OAFAqhB,EAAQ0N,OAAOhuB,GAERsgB,EAsbCuO,CAAMjO,IACR7hB,UAAUmB,YAAcogB,EAChCA,EAAiB,QAAIA,EAAQA,QAAUA,EAGvCK,EAAO,IAAIL,EAAQK,GACnB/L,EAAK,IAAI0L,EAAQ1L,QAUd,KAFD,aACE,OAAO0L,GACR,8BA5yJJ,I,gBCAD;;;;;;;KAuCA,SAAU7jB,GAER,aAKA,IAGImS,EAAI,CACN,EAAK,EACL,EAAK,EACL,EAAK,GAGP,SAAS6D,EAAO7T,EAAGM,GAEjB,GAAI+U,MAAMrV,EAAIkT,SAASlT,EAAG,KACxB,MAAM4wB,EAA2B,iBAEnC,OAAO5wB,EAAIM,EAIb,SAASuwB,EAAY7wB,EAAGnB,GAEtB,GAAU,IAANA,EACF,MAAM+xB,EAAyB,eAGjC,IAAIjuB,EAAI1D,OAAOY,OAAO+wB,EAASzwB,WAC/BwC,EAAK,EAAI3C,EAAI,GAAK,EAAI,EAItB,IAAIoU,EAAI0c,EAFR9wB,EAAIA,EAAI,GAAKA,EAAIA,EAEFnB,GAIf,OAFA8D,EAAK,EAAI3C,EAAIoU,EACbzR,EAAK,EAAI9D,EAAIuV,EACNzR,EAGT,SAASouB,EAAUvH,GAQjB,IANA,IAAIwH,EAAU,GAEVhxB,EAAIwpB,EACJjrB,EAAI,EACJ+B,EAAI,EAEDA,GAAKN,GAAG,CAEb,KAAOA,EAAIzB,GAAM,GACfyB,GAAIzB,EACJyyB,EAAQzyB,IAAMyyB,EAAQzyB,IAAM,GAAK,EAEnC+B,GAAI,EAAI,EAAI/B,IASd,OANIyB,IAAMwpB,EACJxpB,EAAI,IACNgxB,EAAQhxB,IAAMgxB,EAAQhxB,IAAM,GAAK,GAEnCgxB,EAAQxH,IAAQwH,EAAQxH,IAAQ,GAAK,EAEhCwH,EAGT,IAAIzb,EAAQ,SAAS0b,EAAIC,GAEvB,IAOIC,EAPAnxB,EAAI,EAAGnB,EAAI,EAAGyB,EAAI,EAClBsc,EAAI,EAAG4G,EAAI,EAAG9X,EAAI,EAAGyK,EAAI,EAAGvB,EAAI,EAEhClF,EAAI,EAAG0hB,EAAI,EACX/lB,EAAI,EAAGgmB,EAAI,EAEXC,EAAI,IAGR,GAAIL,cAEG,QAAWhvB,IAAPivB,GAKT,GAFA5wB,GAFAN,EAAIixB,IACJpyB,EAAIqyB,GAGAlxB,EAAI,GAAM,GAAKnB,EAAI,GAAM,EAC3B,MAAM+xB,EAA8B,yBAItC,cAAeK,GAEb,IAAK,SAED,GAAI,MAAOA,GAAM,MAAOA,EACtBjxB,EAAIixB,EAAM,EACVpyB,EAAIoyB,EAAM,EACN,MAAOA,IACTjxB,GAAIixB,EAAM,OACP,MAAI,KAAKA,GAKd,MAAML,EAA2B,iBAJjC5wB,EAAIixB,EAAG,GACH,KAAKA,IACPpyB,EAAIoyB,EAAG,IAIX3wB,EAAIN,EAAInB,EACR,MAEJ,IAAK,SAOD,GALIoyB,EAAK,IACP3wB,EAAI2wB,EACJA,GAAMA,GAGJA,EAAK,GAAM,EACbjxB,EAAIixB,OACC,GAAIA,EAAK,EAAG,CAUjB,IARIA,GAAM,IAERA,GADArc,EAAIhU,KAAK4U,IAAI,GAAI5U,KAAKwW,MAAM,EAAIxW,KAAK6T,IAAIwc,GAAMrwB,KAAKmhB,QAO/CqP,GAAKE,GAAKD,GAAKC,GAAG,CAGvB,GAAIL,KAFJE,GAAKzhB,EAAIrE,IAAM+lB,EAAIC,IAEL,CACRD,EAAIC,GAAKC,GACXtxB,EAAI0P,EAAIrE,EACRxM,EAAIuyB,EAAIC,GACCA,EAAID,GACbpxB,EAAIqL,EACJxM,EAAIwyB,IAEJrxB,EAAI0P,EACJ7Q,EAAIuyB,GAEN,MAIIH,EAAKE,GACPzhB,GAAIrE,EACJ+lB,GAAIC,IAEJhmB,GAAIqE,EACJ2hB,GAAID,GAGFA,EAAIE,GACNtxB,EAAIqL,EACJxM,EAAIwyB,IAEJrxB,EAAI0P,EACJ7Q,EAAIuyB,GAIVpxB,GAAI4U,OACKS,MAAM4b,IAAO5b,MAAM6b,MAC5BryB,EAAImB,EAAIiT,KAEV,MAEJ,IAAK,SAID,GAAU,QAFVme,EAAIH,EAAG/b,MAAM,WAGX,MAAM0b,EAA2B,iBA2CnC,GAzCa,MAATQ,EAAE1hB,IACJpP,GAAK,EACLoP,KACkB,MAAT0hB,EAAE1hB,IACXA,IAGE0hB,EAAEpvB,SAAW0N,EAAI,EACnB8T,EAAI3P,EAAOud,EAAE1hB,KAAMpP,GACG,MAAb8wB,EAAE1hB,EAAI,IAAuB,MAAT0hB,EAAE1hB,IAElB,MAAT0hB,EAAE1hB,KACJkN,EAAI/I,EAAOud,EAAE1hB,KAAMpP,OAErBoP,EAGQ,IAAM0hB,EAAEpvB,QAAuB,MAAbovB,EAAE1hB,EAAI,IAA2B,MAAb0hB,EAAE1hB,EAAI,IAA2B,MAAb0hB,EAAE1hB,EAAI,IAA2B,MAAb0hB,EAAE1hB,EAAI,MAC1F8T,EAAI3P,EAAOud,EAAE1hB,GAAIpP,GACjB6V,EAAIvV,KAAK4U,IAAI,GAAI4b,EAAE1hB,GAAG1N,QACtB0N,MAIW,MAAT0hB,EAAE1hB,IAA2B,MAAb0hB,EAAE1hB,EAAI,IAAuB,MAAT0hB,EAAE1hB,IAA2B,MAAb0hB,EAAE1hB,EAAI,MAC5DhE,EAAImI,EAAOud,EAAE1hB,EAAI,GAAIpP,GACrBsU,EAAIhU,KAAK4U,IAAI,GAAI4b,EAAE1hB,EAAI,GAAG1N,QAAU,EACpC0N,GAAI,IAGgB,MAAb0hB,EAAE1hB,EAAI,IAA2B,MAAb0hB,EAAE1hB,EAAI,IACnC8T,EAAI3P,EAAOud,EAAE1hB,GAAIpP,GACjB6V,EAAItC,EAAOud,EAAE1hB,EAAI,GAAI,GACrBA,GAAI,GACkB,MAAb0hB,EAAE1hB,EAAI,IAA2B,MAAb0hB,EAAE1hB,EAAI,KACnCkN,EAAI/I,EAAOud,EAAE1hB,GAAIpP,GACjBkjB,EAAI3P,EAAOud,EAAE1hB,EAAI,GAAIpP,GACrB6V,EAAItC,EAAOud,EAAE1hB,EAAI,GAAI,GACrBA,GAAI,GAGF0hB,EAAEpvB,QAAU0N,EAAG,CAEjBpP,EACAN,EAAI0L,GAFJ7M,EAAIsX,EAAIvB,GAEIgI,EAAIhI,EAAI4O,EACpB,MAKN,QACE,MAAMoN,EAA2B,iBAGvC,GAAU,IAAN/xB,EACF,MAAM+xB,EAAyB,eAGjC5gB,EAAK,EAAI1P,EAAI,GAAK,EAAI,EACtB0P,EAAK,EAAIpP,KAAK2T,IAAIvU,GAClBgQ,EAAK,EAAIpP,KAAK2T,IAAI1V,IAgEpB,SAASiyB,EAAI1c,EAAGC,GAEd,IAAKD,EACH,OAAOC,EACT,IAAKA,EACH,OAAOD,EAET,OAAU,CAER,KADAA,GAAIC,GAEF,OAAOA,EAET,KADAA,GAAID,GAEF,OAAOA,GAWb,SAASwc,EAASxc,EAAGC,GAInB,GAFAkB,EAAMnB,EAAGC,KAELlW,gBAAgByyB,GAMlB,OAAOC,EAAY7gB,EAAK,EAAIA,EAAK,EAAGA,EAAK,GALzCoE,EAAI0c,EAAI9gB,EAAK,EAAGA,EAAK,GACrB7R,KAAQ,EAAI6R,EAAK,EACjB7R,KAAQ,EAAI6R,EAAK,EAAIoE,EACrBjW,KAAQ,EAAI6R,EAAK,EAAIoE,EAMzBwc,EAAyB,eAAI,IAAI7U,MAAM,oBACvC6U,EAA2B,iBAAI,IAAI7U,MAAM,oBACzC6U,EAA8B,oBAAI,IAAI7U,MAAM,8BAE5C6U,EAASzwB,UAAY,CAEnB,EAAK,EACL,EAAK,EACL,EAAK,EAOL,IAAO,WAEL,OAAO0wB,EAAY1yB,KAAQ,EAAGA,KAAQ,IAQxC,IAAO,WAEL,OAAO0yB,GAAa1yB,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,IAQrD,IAAO,SAASiW,EAAGC,GAGjB,OADAkB,EAAMnB,EAAGC,GACFwc,EACL1yB,KAAQ,EAAIA,KAAQ,EAAI6R,EAAK,EAAIA,EAAK,EAAI7R,KAAQ,EAAI6R,EAAK,EAC3D7R,KAAQ,EAAI6R,EAAK,IASrB,IAAO,SAASoE,EAAGC,GAGjB,OADAkB,EAAMnB,EAAGC,GACFwc,EACL1yB,KAAQ,EAAIA,KAAQ,EAAI6R,EAAK,EAAIA,EAAK,EAAI7R,KAAQ,EAAI6R,EAAK,EAC3D7R,KAAQ,EAAI6R,EAAK,IASrB,IAAO,SAASoE,EAAGC,GAGjB,OADAkB,EAAMnB,EAAGC,GACFwc,EACL1yB,KAAQ,EAAI6R,EAAK,EAAI7R,KAAQ,EAAI6R,EAAK,EACtC7R,KAAQ,EAAI6R,EAAK,IASrB,IAAO,SAASoE,EAAGC,GAGjB,OADAkB,EAAMnB,EAAGC,GACFwc,EACL1yB,KAAQ,EAAI6R,EAAK,EAAI7R,KAAQ,EAAI6R,EAAK,EACtC7R,KAAQ,EAAI6R,EAAK,IASrB,MAAS,WACP,OAAO6gB,EAAY1yB,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,IAQpD,IAAO,SAASiW,EAAGC,GAEjB,GAAIgB,MAAMlX,KAAQ,IAAMkX,MAAMlX,KAAQ,GACpC,OAAO,IAAIyyB,EAAS3d,KAGtB,QAAUhR,IAANmS,EACF,OAAOyc,EAAY1yB,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,EAAG,GAIxD,GADAoX,EAAMnB,EAAGC,GACL,IAAMrE,EAAK,GAAK,IAAM7R,KAAQ,EAChC,MAAMyyB,EAAyB,eAiBjC,OAAOC,EACL1yB,KAAQ,GAAK6R,EAAK,EAAI7R,KAAQ,IAAM6R,EAAK,EAAI7R,KAAQ,GACrD6R,EAAK,EAAI7R,KAAQ,IASrB,IAAO,SAASiW,EAAGC,GAMjB,OAJAkB,EAAMnB,EAAGC,GAIFwc,EAAYC,EAAI9gB,EAAK,EAAG7R,KAAQ,GAAK2yB,EAAI9gB,EAAK,EAAG7R,KAAQ,GAAI6R,EAAK,EAAI7R,KAAQ,IAQvF,IAAO,SAASiW,EAAGC,GAMjB,OAJAkB,EAAMnB,EAAGC,GAIM,IAAXrE,EAAK,GAAyB,IAAd7R,KAAQ,EACnB0yB,EAAY,EAAG,GAEjBA,EAAY7gB,EAAK,EAAI7R,KAAQ,EAAG2yB,EAAI9gB,EAAK,EAAG7R,KAAQ,GAAK2yB,EAAI9gB,EAAK,EAAG7R,KAAQ,KAQtF,KAAQ,SAAS+Y,GAIf,OAFAA,EAAStW,KAAK4U,IAAI,GAAI0B,GAAU,GAE5B7B,MAAMlX,KAAQ,IAAMkX,MAAMlX,KAAQ,GAC7B,IAAIyyB,EAAS3d,KAEf4d,EAAYjwB,KAAKuW,KAAKD,EAAS/Y,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI+Y,IAQ5E,MAAS,SAASA,GAIhB,OAFAA,EAAStW,KAAK4U,IAAI,GAAI0B,GAAU,GAE5B7B,MAAMlX,KAAQ,IAAMkX,MAAMlX,KAAQ,GAC7B,IAAIyyB,EAAS3d,KAEf4d,EAAYjwB,KAAKwW,MAAMF,EAAS/Y,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI+Y,IAQ7E,MAAS,SAASA,GAIhB,OAFAA,EAAStW,KAAK4U,IAAI,GAAI0B,GAAU,GAE5B7B,MAAMlX,KAAQ,IAAMkX,MAAMlX,KAAQ,GAC7B,IAAIyyB,EAAS3d,KAEf4d,EAAYjwB,KAAKyW,MAAMH,EAAS/Y,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI+Y,IAQ7E,QAAW,WAET,OAAO2Z,EAAY1yB,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,IAQpD,IAAO,SAASiW,EAAGC,GAMjB,GAJAkB,EAAMnB,EAAGC,GAIM,IAAXrE,EAAK,EAEP,OAAIA,EAAK,EAAI,EACJ6gB,EAAYjwB,KAAK4U,IAAIrX,KAAQ,EAAIA,KAAQ,EAAG6R,EAAK,GAAIpP,KAAK4U,IAAIrX,KAAQ,EAAG6R,EAAK,IAE9E6gB,EAAYjwB,KAAK4U,IAAIrX,KAAQ,EAAIA,KAAQ,EAAG6R,EAAK,GAAIpP,KAAK4U,IAAIrX,KAAQ,EAAG6R,EAAK,IAUzF,GAAI7R,KAAQ,EAAI,EAAG,OAAO,KAG1B,IAAImzB,EAAIP,EAAU5yB,KAAQ,GACtBkzB,EAAIN,EAAU5yB,KAAQ,GAGtB6B,EAAI,EACJnB,EAAI,EACR,IAAK,IAAI+P,KAAK0iB,EACZ,GAAU,MAAN1iB,EAAJ,CACA,GAAU,MAANA,EAAW,CACb5O,EAAI,EACJ,MAIF,GAFAsxB,EAAE1iB,IAAKoB,EAAK,EAERshB,EAAE1iB,GAAKoB,EAAK,GAAM,EAEf,OAAO,KADZshB,EAAE1iB,IAAKoB,EAAK,EAEdhQ,GAAIY,KAAK4U,IAAI5G,EAAG0iB,EAAE1iB,IAGpB,IAAK,IAAIA,KAAKyiB,EACZ,GAAU,MAANziB,EAAJ,CAGA,GAFAyiB,EAAEziB,IAAKoB,EAAK,EAERqhB,EAAEziB,GAAKoB,EAAK,GAAM,EAEf,OAAO,KADZqhB,EAAEziB,IAAKoB,EAAK,EAEdnR,GAAI+B,KAAK4U,IAAI5G,EAAGyiB,EAAEziB,IAGpB,OAAIoB,EAAK,EAAI,EACJ6gB,EAAYhyB,EAAGmB,GAEjB6wB,EAAY7wB,EAAGnB,IAQxB,OAAU,SAASuV,EAAGC,GAGpB,OADAkB,EAAMnB,EAAGC,GACFlW,KAAQ,EAAIA,KAAQ,EAAI6R,EAAK,GAAMA,EAAK,EAAIA,EAAK,EAAI7R,KAAQ,GAQtE,QAAW,SAASiW,EAAGC,GAErBkB,EAAMnB,EAAGC,GACT,IAAI5U,EAAKtB,KAAQ,EAAIA,KAAQ,EAAI6R,EAAK,EAAIA,EAAK,EAAIA,EAAK,EAAI7R,KAAQ,EACpE,OAAQ,EAAIsB,IAAMA,EAAI,IAGxB,SAAY,SAAS8xB,GAEnB,GAAIlc,MAAMlX,KAAQ,IAAMkX,MAAMlX,KAAQ,GACpC,OAAOA,KAGTozB,EAAMA,GAAO,KAKb,IAHA,IAAIC,EAAUrzB,KAAU,MACpBszB,EAAOD,EAAqB,cAEvBjzB,EAAI,EAAGA,EAAIkzB,EAAKzvB,OAAQzD,IAAK,CAGpC,IADA,IAAI+B,EAAIuwB,EAAYY,EAAKlzB,EAAI,GAAI,GACxBqQ,EAAIrQ,EAAI,EAAGqQ,GAAK,EAAGA,IAC1BtO,EAAIA,EAAW,UAAS,IAAEmxB,EAAK7iB,IAGjC,GAAItO,EAAO,IAAEkxB,GAAc,MAAI3V,UAAY0V,EACzC,OAAOjxB,EAAO,IAAEnC,KAAQ,GAG5B,OAAOA,MAQT,UAAa,SAASiW,EAAGC,GAGvB,OADAkB,EAAMnB,EAAGC,OACErE,EAAK,EAAI7R,KAAQ,IAAQA,KAAQ,EAAI6R,EAAK,GAAMA,EAAK,EAAI7R,KAAQ,KAQ9E,QAAW,WAET,OAAOA,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAQzC,WAAc,SAASuzB,GAErB,IAAIC,EAAOhT,EAAM,GACb3e,EAAI7B,KAAQ,EACZU,EAAIV,KAAQ,EAmBhB,OAlBIA,KAAQ,EAAI,IACdwgB,GAAM,KAGE,IAAN9f,EACF8f,GAAM3e,GAGF0xB,IAAiBC,EAAQ/wB,KAAKwW,MAAMpX,EAAInB,IAAM,IAChD8f,GAAMgT,EACNhT,GAAM,IACN3e,GAAInB,GAGN8f,GAAM3e,EACN2e,GAAM,IACNA,GAAM9f,GAED8f,GAQT,QAAW,SAAS+S,GAElB,IAAIC,EAAOhT,EAAM,GACb3e,EAAI7B,KAAQ,EACZU,EAAIV,KAAQ,EAoBhB,OAnBIA,KAAQ,EAAI,IACdwgB,GAAM,KAGE,IAAN9f,EACF8f,GAAM3e,GAGF0xB,IAAiBC,EAAQ/wB,KAAKwW,MAAMpX,EAAInB,IAAM,IAChD8f,GAAMgT,EACN3xB,GAAInB,GAGN8f,GAAM,UACNA,GAAM3e,EACN2e,GAAM,KACNA,GAAM9f,EACN8f,GAAM,KAEDA,GAQT,YAAe,WAEb,IAAIlf,EACA2U,EAAIjW,KAAQ,EACZkW,EAAIlW,KAAQ,EACZuY,EAAM,GAEV,GAAIrB,MAAMjB,IAAMiB,MAAMhB,GACpB,OAAOqC,EAGT,GACEA,EAAIkD,KAAKhZ,KAAKwW,MAAMhD,EAAIC,IACxB5U,EAAI2U,EAAIC,EACRD,EAAIC,EACJA,EAAI5U,QACS,IAAN2U,GAET,OAAOsC,GAQT,SAAY,SAASkb,GAEnB,IAAIN,EAAInzB,KAAQ,EACZkzB,EAAIlzB,KAAQ,EAEhB,GAAIkX,MAAMic,IAAMjc,MAAMgc,GACpB,MAAO,MAGTO,EAAMA,GAAO,GAEb,IAAIC,EAliBR,SAAkB7xB,EAAGnB,GAEnB,KAAOA,EAAI,GAAM,EACfA,GAAI,GAGN,KAAOA,EAAI,GAAM,EACfA,GAAI,GAGN,GAAU,IAANA,EACF,OAAO,EAUT,IAHA,IAAIouB,EAAM,GAAKpuB,EACXY,EAAI,EAEO,IAARwtB,EAAWxtB,IAGhB,GAFAwtB,EAAY,GAANA,EAAWpuB,EAEbY,EA/QY,IAgRd,OAAO,EAEX,OAAOA,EAugBQqyB,CAASR,EAAGD,GACrBU,EApgBR,SAAoB/xB,EAAGnB,EAAG2Q,GAKxB,IAHA,IAAIwiB,EAAO,EACPC,EA/CN,SAAgB5d,EAAGuM,EAAGjiB,GAGpB,IADA,IAAIU,EAAI,EACDuhB,EAAI,EAAGvM,EAAKA,EAAIA,EAAK1V,EAAGiiB,IAAM,EAE3B,EAAJA,IACFvhB,EAAKA,EAAIgV,EAAK1V,GAGlB,OAAOU,EAsCI6yB,CAAO,GAAI1iB,EAAK3Q,GAElBY,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAG5B,GAAIuyB,IAASC,EACX,OAAOxyB,EAETuyB,EAAc,GAAPA,EAAYnzB,EACnBozB,EAAc,GAAPA,EAAYpzB,EAErB,OAAO,EAsfQszB,CAAWb,EAAGD,EAAGQ,GAE1BlT,EAAMxgB,KAAQ,EAAI,EAAI,IAAM,GAUhC,GARAwgB,GAAM2S,EAAID,EAAI,EAEdC,GAAID,GACJC,GAAI,MAGF3S,GAAM,KAEJkT,EAAQ,CAEV,IAAK,IAAItzB,EAAIwzB,EAAQxzB,KACnBogB,GAAM2S,EAAID,EAAI,EACdC,GAAID,EACJC,GAAI,GAEN3S,GAAM,IACN,IAASpgB,EAAIszB,EAAQtzB,KACnBogB,GAAM2S,EAAID,EAAI,EACdC,GAAID,EACJC,GAAI,GAEN3S,GAAM,SAEN,IAASpgB,EAAIqzB,EAAKN,GAAK/yB,KACrBogB,GAAM2S,EAAID,EAAI,EACdC,GAAID,EACJC,GAAI,GAGR,OAAO3S,SAOR,KAFU,EAAF,WACP,OAAOiS,GACR,QAFM,OAEN,aAz0BL,I,cClCA5yB,EAAOD,QAAU,SAASq0B,EAAahe,EAAGC,GACzC,aACA,IAeCge,EAAQC,EAfL3c,EAAK,8EACR4c,EAAM,iBACNC,EAAM,iHACNC,EAAM,iBACNC,EAAM,KACNn0B,EAAI,SAAS+B,GAAK,OAAO8xB,EAAYO,cAAgB,GAAKryB,GAAG0uB,eAAiB,GAAK1uB,GAEnFoL,EAAInN,EAAE6V,GAAG2D,QAAQwa,EAAK,KAAO,GAC7Bpc,EAAI5X,EAAE8V,GAAG0D,QAAQwa,EAAK,KAAO,GAE7BK,EAAKlnB,EAAEqM,QAAQpC,EAAI,UAAUoC,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAI1E,MAAM,MACvEwf,EAAK1c,EAAE4B,QAAQpC,EAAI,UAAUoC,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAI1E,MAAM,MAEvEyf,EAAK5f,SAASxH,EAAEwJ,MAAMud,GAAM,KAAsB,IAAdG,EAAG5wB,QAAgB0J,EAAEwJ,MAAMsd,IAAQO,KAAKxd,MAAM7J,GAClFsnB,EAAK9f,SAASiD,EAAEjB,MAAMud,GAAM,KAAOK,GAAM3c,EAAEjB,MAAMsd,IAAQO,KAAKxd,MAAMY,IAAM,KAG3E,GAAI6c,EAAI,CACP,GAAKF,EAAKE,EAAO,OAAQ,EACpB,GAAKF,EAAKE,EAAO,OAAO,EAG9B,IAAI,IAAIC,EAAK,EAAGC,EAAKtyB,KAAK0N,IAAIskB,EAAG5wB,OAAQ6wB,EAAG7wB,QAASixB,EAAOC,EAAMD,IAAQ,CAKzE,GAHAZ,IAAWO,EAAGK,IAAS,IAAI/d,MAAMwd,IAAQpd,WAAWsd,EAAGK,KAAUL,EAAGK,IAAS,EAC7EX,IAAWO,EAAGI,IAAS,IAAI/d,MAAMwd,IAAQpd,WAAWud,EAAGI,KAAUJ,EAAGI,IAAS,EAEzE5d,MAAMgd,KAAYhd,MAAMid,GAAW,OAAQjd,MAAMgd,GAAW,GAAK,EAMrE,UAJgBA,UAAkBC,IACjCD,GAAU,GACVC,GAAU,IAEPD,EAASC,EAAU,OAAQ,EAC/B,GAAID,EAASC,EAAU,OAAO,EAE/B,OAAO,I,gBC3CR,IAAI3sB,EAAY,EAAQ,IAIxB3H,EAAOD,QAAU,SAAU6c,EAAG5K,GAC5B,IAAImjB,EAAOvY,EAAE5K,GACb,OAAe,MAARmjB,OAAelxB,EAAY0D,EAAUwtB,K,gBCN9C,IAAIlyB,EAAS,EAAQ,GACjB2E,EAAa,EAAQ,IACrBwtB,EAAc,EAAQ,IAEtB3rB,EAAYxG,EAAOwG,UAGvBzJ,EAAOD,QAAU,SAAUoP,GACzB,GAAIvH,EAAWuH,GAAW,OAAOA,EACjC,MAAM1F,EAAU2rB,EAAYjmB,GAAY,wB,cCT1CnP,EAAOD,SAAU,G,gBCAjB,IAAIs1B,EAAqB,EAAQ,KAG7Bxa,EAFc,EAAQ,KAEG1J,OAAO,SAAU,aAK9CpR,EAAQ4E,EAAI1D,OAAOgT,qBAAuB,SAA6BtD,GACrE,OAAO0kB,EAAmB1kB,EAAGkK,K,gBCT/B,IAAInV,EAAc,EAAQ,GACtBiC,EAAY,EAAQ,IACpBf,EAAc,EAAQ,IAEtB7E,EAAO2D,EAAYA,EAAY3D,MAGnC/B,EAAOD,QAAU,SAAU+G,EAAIwG,GAE7B,OADA3F,EAAUb,QACM7C,IAATqJ,EAAqBxG,EAAKF,EAAc7E,EAAK+E,EAAIwG,GAAQ,WAC9D,OAAOxG,EAAGC,MAAMuG,EAAMvJ,c,gBCT1B,IAmDIuxB,EAnDAzvB,EAAW,EAAQ,IACnB6U,EAAyB,EAAQ,KACjC6a,EAAc,EAAQ,KACtB1a,EAAa,EAAQ,IACrB2a,EAAO,EAAQ,KACfC,EAAwB,EAAQ,IAChC7a,EAAY,EAAQ,IAMpB8a,EAAW9a,EAAU,YAErB+a,EAAmB,aAEnBC,EAAY,SAAUC,GACxB,MAAOC,WAAmBD,EAAnBC,cAILC,EAA4B,SAAUT,GACxCA,EAAgBU,MAAMJ,EAAU,KAChCN,EAAgBW,QAChB,IAAInd,EAAOwc,EAAgBY,aAAaj1B,OAExC,OADAq0B,EAAkB,KACXxc,GA0BLqd,EAAkB,WACpB,IACEb,EAAkB,IAAIc,cAAc,YACpC,MAAO5xB,IAzBoB,IAIzB6xB,EAFAC,EAwBJH,EAAqC,oBAAZzsB,SACrBA,SAASgC,QAAU4pB,EACjBS,EAA0BT,KA1B5BgB,EAASb,EAAsB,WAG5Bc,MAAMC,QAAU,OACvBhB,EAAKiB,YAAYH,GAEjBA,EAAOI,IAAMnsB,OALJ,gBAMT8rB,EAAiBC,EAAOK,cAAcjtB,UACvBktB,OACfP,EAAeL,MAAMJ,EAAU,sBAC/BS,EAAeJ,QACRI,EAAeQ,GAiBlBd,EAA0BT,GAE9B,IADA,IAAItxB,EAASuxB,EAAYvxB,OAClBA,YAAiBmyB,EAAyB,UAAEZ,EAAYvxB,IAC/D,OAAOmyB,KAGTtb,EAAW6a,IAAY,EAIvB11B,EAAOD,QAAUkB,OAAOY,QAAU,SAAgB8O,EAAG6L,GACnD,IAAIpR,EAQJ,OAPU,OAANuF,GACFglB,EAA0B,UAAI9vB,EAAS8K,GACvCvF,EAAS,IAAIuqB,EACbA,EAA0B,UAAI,KAE9BvqB,EAAOsqB,GAAY/kB,GACdvF,EAAS+qB,SACMlyB,IAAfuY,EAA2BpR,EAASsP,EAAuB/V,EAAEyG,EAAQoR,K,6BC/E9E,IAAI3K,EAAgB,EAAQ,IACxB4I,EAAuB,EAAQ,IAC/BP,EAA2B,EAAQ,IAEvCla,EAAOD,QAAU,SAAUkC,EAAQH,EAAKN,GACtC,IAAIs1B,EAAcjlB,EAAc/P,GAC5Bg1B,KAAe70B,EAAQwY,EAAqB9V,EAAE1C,EAAQ60B,EAAa5c,EAAyB,EAAG1Y,IAC9FS,EAAO60B,GAAet1B,I,6BCP7B,IAAIuF,EAAQ,EAAQ,IAChBrG,EAAO,EAAQ,IACfgF,EAAc,EAAQ,GACtBqb,EAAgC,EAAQ,KACxC/a,EAAQ,EAAQ,GAChBH,EAAW,EAAQ,IACnB+B,EAAa,EAAQ,IACrBwL,EAAsB,EAAQ,IAC9B2M,EAAW,EAAQ,IACnBtd,EAAW,EAAQ,IACnB+W,EAAyB,EAAQ,IACjCyH,EAAqB,EAAQ,KAC7BC,EAAY,EAAQ,IACpB6V,EAAkB,EAAQ,KAC1BxoB,EAAa,EAAQ,KAGrByoB,EAFkB,EAAQ,GAEhBpuB,CAAgB,WAC1B0H,EAAM1N,KAAK0N,IACX+C,EAAMzQ,KAAKyQ,IACXlC,EAASzL,EAAY,GAAGyL,QACxByK,EAAOlW,EAAY,GAAGkW,MACtBqb,EAAgBvxB,EAAY,GAAG2gB,SAC/BjH,EAAc1Z,EAAY,GAAG6K,OAQ7B2mB,EAEgC,OAA3B,IAAInd,QAAQ,IAAK,MAItBod,IACE,IAAIH,IAC6B,KAA5B,IAAIA,GAAS,IAAK,MAiB7BjW,EAA8B,WAAW,SAAUqW,EAAGC,EAAe3V,GACnE,IAAI4V,EAAoBH,EAA+C,IAAM,KAE7E,MAAO,CAGL,SAAiBI,EAAaC,GAC5B,IAAI7mB,EAAI6I,EAAuBrZ,MAC3Bsd,EAA0BxZ,MAAfszB,OAA2BtzB,EAAYid,EAAUqW,EAAaP,GAC7E,OAAOvZ,EACH/c,EAAK+c,EAAU8Z,EAAa5mB,EAAG6mB,GAC/B92B,EAAK22B,EAAe50B,EAASkO,GAAI4mB,EAAaC,IAIpD,SAAUva,EAAQua,GAChB,IAAIhV,EAAK3c,EAAS1F,MACdsiB,EAAIhgB,EAASwa,GAEjB,GACyB,iBAAhBua,IAC6C,IAApDP,EAAcO,EAAcF,KACW,IAAvCL,EAAcO,EAAc,MAC5B,CACA,IAAI9e,EAAMgJ,EAAgB2V,EAAe7U,EAAIC,EAAG+U,GAChD,GAAI9e,EAAI7L,KAAM,OAAO6L,EAAIlX,MAG3B,IAAIi2B,EAAoB7vB,EAAW4vB,GAC9BC,IAAmBD,EAAe/0B,EAAS+0B,IAEhD,IAAIv0B,EAASuf,EAAGvf,OAChB,GAAIA,EAAQ,CACV,IAAIy0B,EAAclV,EAAGL,QACrBK,EAAGV,UAAY,EAGjB,IADA,IAAI6V,EAAU,KACD,CACX,IAAIvsB,EAASmD,EAAWiU,EAAIC,GAC5B,GAAe,OAAXrX,EAAiB,MAGrB,GADAwQ,EAAK+b,EAASvsB,IACTnI,EAAQ,MAGI,KADFR,EAAS2I,EAAO,MACVoX,EAAGV,UAAYb,EAAmBwB,EAAG1C,EAASyC,EAAGV,WAAY4V,IAKpF,IAFA,IA/EwB/0B,EA+EpBi1B,EAAoB,GACpBC,EAAqB,EAChBt3B,EAAI,EAAGA,EAAIo3B,EAAQ3zB,OAAQzD,IAAK,CAWvC,IARA,IAAIu3B,EAAUr1B,GAFd2I,EAASusB,EAAQp3B,IAEa,IAC1Bw3B,EAAWznB,EAAI+C,EAAID,EAAoBhI,EAAO2C,OAAQ0U,EAAEze,QAAS,GACjEg0B,EAAW,GAMN1iB,EAAI,EAAGA,EAAIlK,EAAOpH,OAAQsR,IAAKsG,EAAKoc,OA3FrC/zB,KADctB,EA4F+CyI,EAAOkK,IA3FxD3S,EAAK4H,OAAO5H,IA4FhC,IAAIs1B,EAAgB7sB,EAAO8sB,OAC3B,GAAIT,EAAmB,CACrB,IAAIU,EAAehnB,EAAO,CAAC2mB,GAAUE,EAAUD,EAAUtV,QACnCxe,IAAlBg0B,GAA6Brc,EAAKuc,EAAcF,GACpD,IAAIG,EAAc31B,EAASsE,EAAMywB,OAAcvzB,EAAWk0B,SAE1DC,EAAcrB,EAAgBe,EAASrV,EAAGsV,EAAUC,EAAUC,EAAeT,GAE3EO,GAAYF,IACdD,GAAqBxY,EAAYqD,EAAGoV,EAAoBE,GAAYK,EACpEP,EAAqBE,EAAWD,EAAQ9zB,QAG5C,OAAO4zB,EAAoBxY,EAAYqD,EAAGoV,SAvFX7xB,GAAM,WACzC,IAAI2R,EAAK,IAOT,OANAA,EAAGhR,KAAO,WACR,IAAIyE,EAAS,GAEb,OADAA,EAAO8sB,OAAS,CAAE9hB,EAAG,KACdhL,GAGyB,MAA3B,GAAG2O,QAAQpC,EAAI,aAkFcuf,GAAoBC,I,cCvI1Dn3B,EAAOD,QAAU,SAASC,GAoBzB,OAnBKA,EAAOq4B,kBACXr4B,EAAOs4B,UAAY,aACnBt4B,EAAOu4B,MAAQ,GAEVv4B,EAAOw4B,WAAUx4B,EAAOw4B,SAAW,IACxCv3B,OAAOC,eAAelB,EAAQ,SAAU,CACvCmB,YAAY,EACZC,IAAK,WACJ,OAAOpB,EAAOQ,KAGhBS,OAAOC,eAAelB,EAAQ,KAAM,CACnCmB,YAAY,EACZC,IAAK,WACJ,OAAOpB,EAAOO,KAGhBP,EAAOq4B,gBAAkB,GAEnBr4B,I,eCpBR,YACAA,EAAOD,QAAU04B,I,6BCDjBz4B,EAAOD,QAAU,SAAU24B,EAAQl3B,GACjC,MAAO,CACLL,aAAuB,EAATu3B,GACdlqB,eAAyB,EAATkqB,GAChBvmB,WAAqB,EAATumB,GACZl3B,MAAOA,K,gBCLX,IAOI0V,EAAOyhB,EAPP11B,EAAS,EAAQ,GACjB21B,EAAY,EAAQ,IAEpBjvB,EAAU1G,EAAO0G,QACjBkvB,EAAO51B,EAAO41B,KACdC,EAAWnvB,GAAWA,EAAQmvB,UAAYD,GAAQA,EAAKF,QACvDI,EAAKD,GAAYA,EAASC,GAG1BA,IAIFJ,GAHAzhB,EAAQ6hB,EAAG1jB,MAAM,MAGD,GAAK,GAAK6B,EAAM,GAAK,EAAI,IAAMA,EAAM,GAAKA,EAAM,MAK7DyhB,GAAWC,MACd1hB,EAAQ0hB,EAAU1hB,MAAM,iBACVA,EAAM,IAAM,MACxBA,EAAQ0hB,EAAU1hB,MAAM,oBACbyhB,GAAWzhB,EAAM,IAIhClX,EAAOD,QAAU44B,G,cC1BjB34B,EAAOD,QAAU,I,gBCAjB,IAAImO,EAAc,EAAQ,IACtBmB,EAAS,EAAQ,IAEjBxI,EAAoB3D,SAASf,UAE7B62B,EAAgB9qB,GAAejN,OAAOyD,yBAEtC0J,EAASiB,EAAOxI,EAAmB,QAEnCjB,EAASwI,GAA0D,cAAhD,aAAuCtN,KAC1D4Y,EAAetL,KAAYF,GAAgBA,GAAe8qB,EAAcnyB,EAAmB,QAAQ2H,cAEvGxO,EAAOD,QAAU,CACfqO,OAAQA,EACRxI,OAAQA,EACR8T,aAAcA,I,gBCfhB,IAAItG,EAAsB,EAAQ,IAE9B9C,EAAM1N,KAAK0N,IACX+C,EAAMzQ,KAAKyQ,IAKfrT,EAAOD,QAAU,SAAUgO,EAAO/J,GAChC,IAAIi1B,EAAU7lB,EAAoBrF,GAClC,OAAOkrB,EAAU,EAAI3oB,EAAI2oB,EAAUj1B,EAAQ,GAAKqP,EAAI4lB,EAASj1B,K,gBCV/D,IAAIgC,EAAQ,EAAQ,GAChB4B,EAAa,EAAQ,IAErBwwB,EAAc,kBAEdtzB,EAAW,SAAUo0B,EAASC,GAChC,IAAI33B,EAAQ43B,EAAKC,EAAUH,IAC3B,OAAO13B,GAAS83B,GACZ93B,GAAS+3B,IACT3xB,EAAWuxB,GAAanzB,EAAMmzB,KAC5BA,IAGJE,EAAYv0B,EAASu0B,UAAY,SAAUpc,GAC7C,OAAO1S,OAAO0S,GAAQlD,QAAQqe,EAAa,KAAKpH,eAG9CoI,EAAOt0B,EAASs0B,KAAO,GACvBG,EAASz0B,EAASy0B,OAAS,IAC3BD,EAAWx0B,EAASw0B,SAAW,IAEnCt5B,EAAOD,QAAU+E,G,gBCrBjB,IAAI/C,EAAO,EAAQ,IACf2D,EAAc,EAAQ,GACtBiJ,EAAgB,EAAQ,KACxBmC,EAAW,EAAQ,IACnBb,EAAoB,EAAQ,IAC5Bc,EAAqB,EAAQ,KAE7B6K,EAAOlW,EAAY,GAAGkW,MAGtB4d,EAAe,SAAU1Z,GAC3B,IAAI2Z,EAAiB,GAAR3Z,EACT4Z,EAAoB,GAAR5Z,EACZ6Z,EAAkB,GAAR7Z,EACV8Z,EAAmB,GAAR9Z,EACX+Z,EAAwB,GAAR/Z,EAChBga,EAA2B,GAARha,EACnBia,EAAmB,GAARja,GAAa+Z,EAC5B,OAAO,SAAUG,EAAOl2B,EAAYwJ,EAAM2sB,GASxC,IARA,IAOIz4B,EAAO4J,EAPPuF,EAAIG,EAASkpB,GACbh3B,EAAO2L,EAAcgC,GACrBupB,EAAgBn4B,EAAK+B,EAAYwJ,GACjCtJ,EAASiM,EAAkBjN,GAC3B+K,EAAQ,EACRlM,EAASo4B,GAAkBlpB,EAC3BrN,EAAS+1B,EAAS53B,EAAOm4B,EAAOh2B,GAAU01B,GAAaI,EAAmBj4B,EAAOm4B,EAAO,QAAK/1B,EAE3FD,EAAS+J,EAAOA,IAAS,IAAIgsB,GAAYhsB,KAAS/K,KAEtDoI,EAAS8uB,EADT14B,EAAQwB,EAAK+K,GACiBA,EAAO4C,GACjCmP,GACF,GAAI2Z,EAAQ/1B,EAAOqK,GAAS3C,OACvB,GAAIA,EAAQ,OAAQ0U,GACvB,KAAK,EAAG,OAAO,EACf,KAAK,EAAG,OAAOte,EACf,KAAK,EAAG,OAAOuM,EACf,KAAK,EAAG6N,EAAKlY,EAAQlC,QAChB,OAAQse,GACb,KAAK,EAAG,OAAO,EACf,KAAK,EAAGlE,EAAKlY,EAAQlC,GAI3B,OAAOq4B,GAAiB,EAAIF,GAAWC,EAAWA,EAAWl2B,IAIjE1D,EAAOD,QAAU,CAGfqE,QAASo1B,EAAa,GAGtB/1B,IAAK+1B,EAAa,GAGlBvf,OAAQuf,EAAa,GAGrBW,KAAMX,EAAa,GAGnBY,MAAOZ,EAAa,GAGpBnnB,KAAMmnB,EAAa,GAGnBa,UAAWb,EAAa,GAGxBc,aAAcd,EAAa,K,gBCvE7B,IAAIxzB,EAAQ,EAAQ,GAChB4C,EAAkB,EAAQ,IAC1BG,EAAa,EAAQ,IAErBC,EAAUJ,EAAgB,WAE9B5I,EAAOD,QAAU,SAAU4V,GAIzB,OAAO5M,GAAc,KAAO/C,GAAM,WAChC,IAAIkL,EAAQ,GAKZ,OAJkBA,EAAM5N,YAAc,IAC1B0F,GAAW,WACrB,MAAO,CAAEuxB,IAAK,IAE2B,IAApCrpB,EAAMyE,GAAa6kB,SAASD,S,gBChBvC,IAAI3zB,EAAc,EAAQ,IAEtBC,EAAoB3D,SAASf,UAC7B4E,EAAQF,EAAkBE,MAC1BrG,EAAOmG,EAAkBnG,KAG7BV,EAAOD,QAA4B,iBAAX06B,SAAuBA,QAAQ1zB,QAAUH,EAAclG,EAAKqB,KAAKgF,GAAS,WAChG,OAAOrG,EAAKqG,MAAMA,EAAOhD,c,cCR3B/D,EAAOD,QAAU,I,gBCAjB,IAAImB,EAAiB,EAAQ,IAAuCyD,EAChE0K,EAAS,EAAQ,IAGjBoG,EAFkB,EAAQ,GAEV7M,CAAgB,eAEpC5I,EAAOD,QAAU,SAAU2D,EAAQg3B,EAAKp1B,GAClC5B,IAAW4B,IAAQ5B,EAASA,EAAOvB,WACnCuB,IAAW2L,EAAO3L,EAAQ+R,IAC5BvU,EAAewC,EAAQ+R,EAAe,CAAEjH,cAAc,EAAMhN,MAAOk5B,M,gBCTvE,IAAI10B,EAAQ,EAAQ,GAEpBhG,EAAOD,SAAWiG,GAAM,WACtB,IAAIwE,EAAO,aAA8BzI,OAEzC,MAAsB,mBAARyI,GAAsBA,EAAKpI,eAAe,iB,gBCL1D,IAAI4R,EAAc,EAAQ,KACtBD,EAAW,EAAQ,IAIvB/T,EAAOD,QAAU,SAAUoP,GACzB,IAAIrN,EAAMkS,EAAY7E,EAAU,UAChC,OAAO4E,EAASjS,GAAOA,EAAMA,EAAM,K,gBCPrC,IAAImB,EAAS,EAAQ,GACjBoE,EAAa,EAAQ,IACrBO,EAAa,EAAQ,IACrB9B,EAAgB,EAAQ,IACxB0J,EAAoB,EAAQ,KAE5BvO,EAASgC,EAAOhC,OAEpBjB,EAAOD,QAAUyP,EAAoB,SAAU7M,GAC7C,MAAoB,iBAANA,GACZ,SAAUA,GACZ,IAAIyY,EAAU/T,EAAW,UACzB,OAAOO,EAAWwT,IAAYtV,EAAcsV,EAAQjZ,UAAWlB,EAAO0B,M,gBCZxE,IAEI4H,EAFS,EAAQ,GAEDA,OAEpBvK,EAAOD,QAAU,SAAUoP,GACzB,IACE,OAAO5E,EAAO4E,GACd,MAAO3K,GACP,MAAO,Y,gBCRX,IAAI4C,EAAU,EAAQ,IAClBoY,EAAQ,EAAQ,MAEnBxf,EAAOD,QAAU,SAAU+B,EAAKN,GAC/B,OAAOge,EAAM1d,KAAS0d,EAAM1d,QAAiBmC,IAAVzC,EAAsBA,EAAQ,MAChE,WAAY,IAAIoa,KAAK,CACtB+c,QAAS,SACTj3B,KAAM0F,EAAU,OAAS,SACzBuzB,UAAW,4CACXC,QAAS,2DACT51B,OAAQ,yC,gBCVV,IAAIU,EAAc,EAAQ,GAEtBm1B,EAAK,EACLC,EAAUl4B,KAAKkvB,SACfrvB,EAAWiD,EAAY,GAAIjD,UAE/BzC,EAAOD,QAAU,SAAU+B,GACzB,MAAO,gBAAqBmC,IAARnC,EAAoB,GAAKA,GAAO,KAAOW,IAAWo4B,EAAKC,EAAS,M,gBCPtF,IAAI73B,EAAS,EAAQ,GACjB4E,EAAW,EAAQ,IAEnB6B,EAAWzG,EAAOyG,SAElB0E,EAASvG,EAAS6B,IAAa7B,EAAS6B,EAASqxB,eAErD/6B,EAAOD,QAAU,SAAU4C,GACzB,OAAOyL,EAAS1E,EAASqxB,cAAcp4B,GAAM,K,gBCR/C,IAAI+C,EAAc,EAAQ,GACtBkC,EAAa,EAAQ,IACrB4X,EAAQ,EAAQ,KAEhBnR,EAAmB3I,EAAYxC,SAAST,UAGvCmF,EAAW4X,EAAMzX,iBACpByX,EAAMzX,cAAgB,SAAUpF,GAC9B,OAAO0L,EAAiB1L,KAI5B3C,EAAOD,QAAUyf,EAAMzX,e,gBCbvB,IAAIqH,EAAS,EAAQ,IACjBE,EAAM,EAAQ,IAEd6D,EAAO/D,EAAO,QAElBpP,EAAOD,QAAU,SAAU+B,GACzB,OAAOqR,EAAKrR,KAASqR,EAAKrR,GAAOwN,EAAIxN,M,gBCNvC,IAAIsR,EAAsB,EAAQ,IAE9BC,EAAMzQ,KAAKyQ,IAIfrT,EAAOD,QAAU,SAAUoP,GACzB,OAAOA,EAAW,EAAIkE,EAAID,EAAoBjE,GAAW,kBAAoB,I,gBCP/E,IAAIlM,EAAS,EAAQ,GACjBV,EAAwB,EAAQ,KAChCqF,EAAa,EAAQ,IACrBozB,EAAa,EAAQ,IAGrBvlB,EAFkB,EAAQ,GAEV7M,CAAgB,eAChC3H,EAASgC,EAAOhC,OAGhBg6B,EAAuE,aAAnDD,EAAW,WAAc,OAAOj3B,UAArB,IAUnC/D,EAAOD,QAAUwC,EAAwBy4B,EAAa,SAAUr4B,GAC9D,IAAIgO,EAAG0L,EAAKjR,EACZ,YAAcnH,IAAPtB,EAAmB,YAAqB,OAAPA,EAAc,OAEM,iBAAhD0Z,EAXD,SAAU1Z,EAAIb,GACzB,IACE,OAAOa,EAAGb,GACV,MAAO0C,KAQS02B,CAAOvqB,EAAI1P,EAAO0B,GAAK8S,IAA8B4G,EAEnE4e,EAAoBD,EAAWrqB,GAEH,WAA3BvF,EAAS4vB,EAAWrqB,KAAmB/I,EAAW+I,EAAEwqB,QAAU,YAAc/vB,I,gBC5BnF,IAAImO,EAAU,EAAQ,IAKtBvZ,EAAOD,QAAUsQ,MAAMP,SAAW,SAAiBX,GACjD,MAA4B,SAArBoK,EAAQpK,K,gBCNjB,IAAIzJ,EAAc,EAAQ,GACtBM,EAAQ,EAAQ,GAChB4B,EAAa,EAAQ,IACrB2R,EAAU,EAAQ,IAClBlS,EAAa,EAAQ,IACrBU,EAAgB,EAAQ,IAExBqzB,EAAO,aACPC,EAAQ,GACRC,EAAYj0B,EAAW,UAAW,aAClCk0B,EAAoB,2BACpB50B,EAAOjB,EAAY61B,EAAkB50B,MACrC60B,GAAuBD,EAAkB50B,KAAKy0B,GAE9CK,EAAsB,SAAuBtsB,GAC/C,IAAKvH,EAAWuH,GAAW,OAAO,EAClC,IAEE,OADAmsB,EAAUF,EAAMC,EAAOlsB,IAChB,EACP,MAAO3K,GACP,OAAO,IAIPk3B,EAAsB,SAAuBvsB,GAC/C,IAAKvH,EAAWuH,GAAW,OAAO,EAClC,OAAQoK,EAAQpK,IACd,IAAK,gBACL,IAAK,oBACL,IAAK,yBAA0B,OAAO,EAExC,IAIE,OAAOqsB,KAAyB70B,EAAK40B,EAAmBxzB,EAAcoH,IACtE,MAAO3K,GACP,OAAO,IAIXk3B,EAAoBj2B,MAAO,EAI3BzF,EAAOD,SAAWu7B,GAAat1B,GAAM,WACnC,IAAI21B,EACJ,OAAOF,EAAoBA,EAAoB/6B,QACzC+6B,EAAoBx6B,UACpBw6B,GAAoB,WAAcE,GAAS,MAC5CA,KACFD,EAAsBD,G,gBCnD3B,IAAIz1B,EAAQ,EAAQ,GAIhB41B,EAHS,EAAQ,GAGAz1B,OAEjBmb,EAAgBtb,GAAM,WACxB,IAAI2R,EAAKikB,EAAQ,IAAK,KAEtB,OADAjkB,EAAGmK,UAAY,EACW,MAAnBnK,EAAGhR,KAAK,WAKbk1B,EAAgBva,GAAiBtb,GAAM,WACzC,OAAQ41B,EAAQ,IAAK,KAAKxZ,UAGxB0Z,EAAexa,GAAiBtb,GAAM,WAExC,IAAI2R,EAAKikB,EAAQ,KAAM,MAEvB,OADAjkB,EAAGmK,UAAY,EACU,MAAlBnK,EAAGhR,KAAK,UAGjB3G,EAAOD,QAAU,CACf+7B,aAAcA,EACdD,cAAeA,EACfva,cAAeA,I,6BCzBjB,IAoBMya,EACAC,EArBFt7B,EAAO,EAAQ,IACfgF,EAAc,EAAQ,GACtBjD,EAAW,EAAQ,IACnBw5B,EAAc,EAAQ,KACtB5a,EAAgB,EAAQ,IACxBjS,EAAS,EAAQ,IACjBvN,EAAS,EAAQ,IACjBqH,EAAmB,EAAQ,IAA+B9H,IAC1D86B,EAAsB,EAAQ,KAC9BC,EAAkB,EAAQ,KAE1B9E,EAAgBjoB,EAAO,wBAAyB7E,OAAOpI,UAAU4X,SACjEqiB,EAAaj2B,OAAOhE,UAAUwE,KAC9B01B,EAAcD,EACdvd,EAASnZ,EAAY,GAAGmZ,QACxBwH,EAAU3gB,EAAY,GAAG2gB,SACzBtM,EAAUrU,EAAY,GAAGqU,SACzBqF,EAAc1Z,EAAY,GAAG6K,OAE7B+rB,GAEEN,EAAM,MACVt7B,EAAK07B,EAFDL,EAAM,IAEY,KACtBr7B,EAAK07B,EAAYJ,EAAK,KACG,IAAlBD,EAAIja,WAAqC,IAAlBka,EAAIla,WAGhCR,EAAgBD,EAAcya,aAG9BS,OAAuCt4B,IAAvB,OAAO0C,KAAK,IAAI,IAExB21B,GAA4BC,GAAiBjb,GAAiB4a,GAAuBC,KAG/FE,EAAc,SAAcpf,GAC1B,IAII7R,EAAQoxB,EAAQ1a,EAAW5K,EAAO3W,EAAG0B,EAAQw6B,EAJ7C9kB,EAAKxX,KACLgL,EAAQjC,EAAiByO,GACzBgJ,EAAMle,EAASwa,GACfyf,EAAMvxB,EAAMuxB,IAGhB,GAAIA,EAIF,OAHAA,EAAI5a,UAAYnK,EAAGmK,UACnB1W,EAAS1K,EAAK27B,EAAaK,EAAK/b,GAChChJ,EAAGmK,UAAY4a,EAAI5a,UACZ1W,EAGT,IAAI8sB,EAAS/sB,EAAM+sB,OACf9V,EAASd,GAAiB3J,EAAGyK,OAC7B7b,EAAQ7F,EAAKu7B,EAAatkB,GAC1B3S,EAAS2S,EAAG3S,OACZ23B,EAAa,EACbC,EAAUjc,EA+Cd,GA7CIyB,IACF7b,EAAQwT,EAAQxT,EAAO,IAAK,KACC,IAAzB8f,EAAQ9f,EAAO,OACjBA,GAAS,KAGXq2B,EAAUxd,EAAYuB,EAAKhJ,EAAGmK,WAE1BnK,EAAGmK,UAAY,KAAOnK,EAAGuK,WAAavK,EAAGuK,WAA+C,OAAlCrD,EAAO8B,EAAKhJ,EAAGmK,UAAY,MACnF9c,EAAS,OAASA,EAAS,IAC3B43B,EAAU,IAAMA,EAChBD,KAIFH,EAAS,IAAIr2B,OAAO,OAASnB,EAAS,IAAKuB,IAGzCg2B,IACFC,EAAS,IAAIr2B,OAAO,IAAMnB,EAAS,WAAYuB,IAE7C+1B,IAA0Bxa,EAAYnK,EAAGmK,WAE7C5K,EAAQxW,EAAK07B,EAAYha,EAASoa,EAAS7kB,EAAIilB,GAE3Cxa,EACElL,GACFA,EAAM2lB,MAAQzd,EAAYlI,EAAM2lB,MAAOF,GACvCzlB,EAAM,GAAKkI,EAAYlI,EAAM,GAAIylB,GACjCzlB,EAAMnJ,MAAQ4J,EAAGmK,UACjBnK,EAAGmK,WAAa5K,EAAM,GAAGlT,QACpB2T,EAAGmK,UAAY,EACbwa,GAA4BplB,IACrCS,EAAGmK,UAAYnK,EAAG1U,OAASiU,EAAMnJ,MAAQmJ,EAAM,GAAGlT,OAAS8d,GAEzDya,GAAiBrlB,GAASA,EAAMlT,OAAS,GAG3CtD,EAAK22B,EAAengB,EAAM,GAAIslB,GAAQ,WACpC,IAAKj8B,EAAI,EAAGA,EAAIwD,UAAUC,OAAS,EAAGzD,SACf0D,IAAjBF,UAAUxD,KAAkB2W,EAAM3W,QAAK0D,MAK7CiT,GAASghB,EAEX,IADAhhB,EAAMghB,OAASj2B,EAASJ,EAAO,MAC1BtB,EAAI,EAAGA,EAAI23B,EAAOl0B,OAAQzD,IAE7B0B,GADAw6B,EAAQvE,EAAO33B,IACF,IAAM2W,EAAMulB,EAAM,IAInC,OAAOvlB,IAIXlX,EAAOD,QAAUs8B,G,cCnHjB,IAAIS,EAASl6B,KAAKmV,MACdhC,EAAMnT,KAAKmT,IAIf/V,EAAOD,SAAY+8B,GAEdA,EAAO,IAAM,oBAAsBA,EAAO,IAAM,qBAE7B,OAAnBA,GAAQ,OACT,SAAepvB,GACjB,OAAmB,IAAXA,GAAKA,GAAUA,EAAIA,GAAK,MAAQA,EAAI,KAAOA,EAAIA,EAAIA,EAAI,EAAIqI,EAAIrI,GAAK,GAC1EovB,G,6BCZJ,IAAIp8B,EAAO,EAAQ,IACfqgB,EAAgC,EAAQ,KACxClb,EAAW,EAAQ,IACnBka,EAAW,EAAQ,IACnBtd,EAAW,EAAQ,IACnB+W,EAAyB,EAAQ,IACjC0H,EAAY,EAAQ,IACpBD,EAAqB,EAAQ,KAC7B1S,EAAa,EAAQ,KAGzBwS,EAA8B,SAAS,SAAUgc,EAAOC,EAAatb,GACnE,MAAO,CAGL,SAAeyB,GACb,IAAIxS,EAAI6I,EAAuBrZ,MAC3B88B,EAAoBh5B,MAAVkf,OAAsBlf,EAAYid,EAAUiC,EAAQ4Z,GAClE,OAAOE,EAAUv8B,EAAKu8B,EAAS9Z,EAAQxS,GAAK,IAAIxK,OAAOgd,GAAQ4Z,GAAOt6B,EAASkO,KAIjF,SAAUsM,GACR,IAAIuF,EAAK3c,EAAS1F,MACdsiB,EAAIhgB,EAASwa,GACbvE,EAAMgJ,EAAgBsb,EAAaxa,EAAIC,GAE3C,GAAI/J,EAAI7L,KAAM,OAAO6L,EAAIlX,MAEzB,IAAKghB,EAAGvf,OAAQ,OAAOsL,EAAWiU,EAAIC,GAEtC,IAAIiV,EAAclV,EAAGL,QACrBK,EAAGV,UAAY,EAIf,IAHA,IAEI1W,EAFAsG,EAAI,GACJ1P,EAAI,EAEgC,QAAhCoJ,EAASmD,EAAWiU,EAAIC,KAAc,CAC5C,IAAIya,EAAWz6B,EAAS2I,EAAO,IAC/BsG,EAAE1P,GAAKk7B,EACU,KAAbA,IAAiB1a,EAAGV,UAAYb,EAAmBwB,EAAG1C,EAASyC,EAAGV,WAAY4V,IAClF11B,IAEF,OAAa,IAANA,EAAU,KAAO0P,Q,6BC1C9B,IAAInO,EAAI,EAAQ,GACZ45B,EAAa,EAAQ,KAKzB55B,EAAE,CAAEG,OAAQ,SAAUC,OAAO,EAAMC,OAJN,EAAQ,IAIMw5B,CAAuB,QAAU,CAC1EzR,IAAK,WACH,OAAOwR,EAAWh9B,KAAM,MAAO,GAAI,Q,gBCTvC,IAAI8C,EAAS,EAAQ,GACjByC,EAAc,EAAQ,GACtBM,EAAQ,EAAQ,GAChBuT,EAAU,EAAQ,IAElBtY,EAASgC,EAAOhC,OAChBoU,EAAQ3P,EAAY,GAAG2P,OAG3BrV,EAAOD,QAAUiG,GAAM,WAGrB,OAAQ/E,EAAO,KAAKo8B,qBAAqB,MACtC,SAAU16B,GACb,MAAsB,UAAf4W,EAAQ5W,GAAkB0S,EAAM1S,EAAI,IAAM1B,EAAO0B,IACtD1B,G,gBCdJ,IAAI8H,EAAa,EAAQ,IACrB/C,EAAQ,EAAQ,GAGpBhG,EAAOD,UAAYkB,OAAOsc,wBAA0BvX,GAAM,WACxD,IAAIsW,EAAShb,SAGb,OAAQiJ,OAAO+R,MAAarb,OAAOqb,aAAmBhb,UAEnDA,OAAOmE,MAAQsD,GAAcA,EAAa,O,gBCX/C,IAAI9F,EAAS,EAAQ,GACjB2B,EAAY,EAAQ,KAGpB4a,EAAQvc,EADC,uBACiB2B,EADjB,qBACmC,IAEhD5E,EAAOD,QAAUyf,G,gBCNjB,IAAIvc,EAAS,EAAQ,GAGjB/B,EAAiBD,OAAOC,eAE5BlB,EAAOD,QAAU,SAAU+B,EAAKN,GAC9B,IACEN,EAAe+B,EAAQnB,EAAK,CAAEN,MAAOA,EAAOgN,cAAc,EAAM2D,UAAU,IAC1E,MAAO3N,GACPvB,EAAOnB,GAAON,EACd,OAAOA,I,cCTXxB,EAAOD,QAAU,CACf,cACA,iBACA,gBACA,uBACA,iBACA,WACA,Y,gBCRF,IAAIs1B,EAAqB,EAAQ,KAC7BE,EAAc,EAAQ,KAK1Bv1B,EAAOD,QAAUkB,OAAOkS,MAAQ,SAAcxC,GAC5C,OAAO0kB,EAAmB1kB,EAAG4kB,K,gBCP/B,IAGI/qB,EAAO,GAEXA,EALsB,EAAQ,GAEV5B,CAAgB,gBAGd,IAEtB5I,EAAOD,QAA2B,eAAjBwK,OAAOC,I,gBCPxB,IAAI8yB,EAA0B,EAAQ,KAItCt9B,EAAOD,QAAU,SAAUw9B,EAAev5B,GACxC,OAAO,IAAKs5B,EAAwBC,GAA7B,CAAwD,IAAXv5B,EAAe,EAAIA,K,6BCJzE,IAAIgC,EAAQ,EAAQ,GAEpBhG,EAAOD,QAAU,SAAU4V,EAAaxG,GACtC,IAAI2R,EAAS,GAAGnL,GAChB,QAASmL,GAAU9a,GAAM,WAEvB8a,EAAOpgB,KAAK,KAAMyO,GAAY,WAAc,OAAO,GAAM,Q,gBCP7D,IAAIlM,EAAS,EAAQ,GACjBoM,EAAS,EAAQ,IACjBzH,EAAa,EAAQ,IACrBkJ,EAAW,EAAQ,IACnB8J,EAAY,EAAQ,IACpB4iB,EAA2B,EAAQ,KAEnC9H,EAAW9a,EAAU,YACrB3Z,EAASgC,EAAOhC,OAChBka,EAAkBla,EAAOkB,UAI7BnC,EAAOD,QAAUy9B,EAA2Bv8B,EAAOw8B,eAAiB,SAAU9sB,GAC5E,IAAI1O,EAAS6O,EAASH,GACtB,GAAItB,EAAOpN,EAAQyzB,GAAW,OAAOzzB,EAAOyzB,GAC5C,IAAIpyB,EAAcrB,EAAOqB,YACzB,OAAIsE,EAAWtE,IAAgBrB,aAAkBqB,EACxCA,EAAYnB,UACZF,aAAkBhB,EAASka,EAAkB,O,gBCnBxD,IAAIvT,EAAa,EAAQ,IACrBC,EAAW,EAAQ,IACnBL,EAAiB,EAAQ,KAG7BxH,EAAOD,QAAU,SAAUi6B,EAAO5kB,EAAOsoB,GACvC,IAAIC,EAAWC,EAUf,OAPEp2B,GAEAI,EAAW+1B,EAAYvoB,EAAM9R,cAC7Bq6B,IAAcD,GACd71B,EAAS+1B,EAAqBD,EAAUx7B,YACxCy7B,IAAuBF,EAAQv7B,WAC/BqF,EAAewyB,EAAO4D,GACjB5D,I,gBCfT,IAAIt0B,EAAc,EAAQ,GACtBG,EAAW,EAAQ,IACnBg4B,EAAqB,EAAQ,KAMjC79B,EAAOD,QAAUkB,OAAOuG,iBAAmB,aAAe,GAAK,WAC7D,IAEIwV,EAFA8gB,GAAiB,EACjBtzB,EAAO,GAEX,KAEEwS,EAAStX,EAAYzE,OAAOyD,yBAAyBzD,OAAOkB,UAAW,aAAaiG,MAC7EoC,EAAM,IACbszB,EAAiBtzB,aAAgB6F,MACjC,MAAO7L,IACT,OAAO,SAAwBmM,EAAGhN,GAKhC,OAJAkC,EAAS8K,GACTktB,EAAmBl6B,GACfm6B,EAAgB9gB,EAAOrM,EAAGhN,GACzBgN,EAAEotB,UAAYp6B,EACZgN,GAfoD,QAiBzD1M,I,6BCzBN,IAAI4B,EAAW,EAAQ,IAIvB7F,EAAOD,QAAU,WACf,IAAIuN,EAAOzH,EAAS1F,MAChBiL,EAAS,GAOb,OANIkC,EAAKrK,SAAQmI,GAAU,KACvBkC,EAAK2U,aAAY7W,GAAU,KAC3BkC,EAAK4U,YAAW9W,GAAU,KAC1BkC,EAAK0wB,SAAQ5yB,GAAU,KACvBkC,EAAK6U,UAAS/W,GAAU,KACxBkC,EAAK8U,SAAQhX,GAAU,KACpBA,I,6BCbT,IAAI/D,EAAa,EAAQ,IACrBoT,EAAuB,EAAQ,IAC/B7R,EAAkB,EAAQ,IAC1BsF,EAAc,EAAQ,IAEtBlF,EAAUJ,EAAgB,WAE9B5I,EAAOD,QAAU,SAAUk+B,GACzB,IAAIvtB,EAAcrJ,EAAW42B,GACzB/8B,EAAiBuZ,EAAqB9V,EAEtCuJ,GAAewC,IAAgBA,EAAY1H,IAC7C9H,EAAewP,EAAa1H,EAAS,CACnCwF,cAAc,EACdpN,IAAK,WAAc,OAAOjB,U,gBCfhC,IAAI6F,EAAQ,EAAQ,GAIhB41B,EAHS,EAAQ,GAGAz1B,OAErBnG,EAAOD,QAAUiG,GAAM,WACrB,IAAI2R,EAAKikB,EAAQ,IAAK,KACtB,QAASjkB,EAAGqmB,QAAUrmB,EAAGhR,KAAK,OAAsB,MAAbgR,EAAGpR,W,6BCN5C,EAAQ,IACR,IAAIb,EAAc,EAAQ,GACtBlD,EAAW,EAAQ,IACnB4e,EAAa,EAAQ,KACrBpb,EAAQ,EAAQ,GAChB4C,EAAkB,EAAQ,IAC1BvE,EAA8B,EAAQ,IAEtC2E,EAAUJ,EAAgB,WAC1B1C,EAAkBC,OAAOhE,UAE7BnC,EAAOD,QAAU,SAAUm+B,EAAKv3B,EAAMyD,EAAQ+zB,GAC5C,IAAIC,EAASx1B,EAAgBs1B,GAEzBG,GAAuBr4B,GAAM,WAE/B,IAAI2K,EAAI,GAER,OADAA,EAAEytB,GAAU,WAAc,OAAO,GACZ,GAAd,GAAGF,GAAKvtB,MAGb8P,EAAoB4d,IAAwBr4B,GAAM,WAEpD,IAAIwa,GAAa,EACb7I,EAAK,IAkBT,MAhBY,UAARumB,KAIFvmB,EAAK,IAGFrU,YAAc,GACjBqU,EAAGrU,YAAY0F,GAAW,WAAc,OAAO2O,GAC/CA,EAAGpR,MAAQ,GACXoR,EAAGymB,GAAU,IAAIA,IAGnBzmB,EAAGhR,KAAO,WAAiC,OAAnB6Z,GAAa,EAAa,MAElD7I,EAAGymB,GAAQ,KACH5d,KAGV,IACG6d,IACA5d,GACDrW,EACA,CACA,IAAIk0B,EAA8B54B,EAAY,IAAI04B,IAC9CG,EAAU53B,EAAKy3B,EAAQ,GAAGF,IAAM,SAAUM,EAAcrb,EAAQxC,EAAK8d,EAAMC,GAC7E,IAAIC,EAAwBj5B,EAAY84B,GACpCI,EAAQzb,EAAOxc,KACnB,OAAIi4B,IAAUxd,GAAcwd,IAAU14B,EAAgBS,KAChD03B,IAAwBK,EAInB,CAAE7xB,MAAM,EAAMrL,MAAO88B,EAA4Bnb,EAAQxC,EAAK8d,IAEhE,CAAE5xB,MAAM,EAAMrL,MAAOm9B,EAAsBhe,EAAKwC,EAAQsb,IAE1D,CAAE5xB,MAAM,MAGjBrK,EAAS+H,OAAOpI,UAAW+7B,EAAKK,EAAQ,IACxC/7B,EAAS0D,EAAiBk4B,EAAQG,EAAQ,IAGxCJ,GAAM95B,EAA4B6B,EAAgBk4B,GAAS,QAAQ,K,6BCvEzE,IAAIvf,EAAS,EAAQ,KAAiCA,OAItD7e,EAAOD,QAAU,SAAU0iB,EAAG1U,EAAOoU,GACnC,OAAOpU,GAASoU,EAAUtD,EAAO4D,EAAG1U,GAAO/J,OAAS,K,gBCNtD,IAAIf,EAAS,EAAQ,GACjB+M,EAAkB,EAAQ,IAC1BC,EAAoB,EAAQ,IAC5BC,EAAiB,EAAQ,IAEzBG,EAAQpN,EAAOoN,MACfC,EAAM1N,KAAK0N,IAEftQ,EAAOD,QAAU,SAAU4Q,EAAGH,EAAOC,GAKnC,IAJA,IAAIzM,EAASiM,EAAkBU,GAC3BC,EAAIZ,EAAgBQ,EAAOxM,GAC3B6M,EAAMb,OAAwB/L,IAARwM,EAAoBzM,EAASyM,EAAKzM,GACxDoH,EAASiF,EAAMC,EAAIO,EAAMD,EAAG,IACvB5O,EAAI,EAAG4O,EAAIC,EAAKD,IAAK5O,IAAKkO,EAAe9E,EAAQpJ,EAAG2O,EAAEC,IAE/D,OADAxF,EAAOpH,OAAShC,EACToJ,I,gBCfT,IAAInI,EAAS,EAAQ,GACjBvC,EAAO,EAAQ,IACfmF,EAAW,EAAQ,IACnB+B,EAAa,EAAQ,IACrB2R,EAAU,EAAQ,IAClB6H,EAAa,EAAQ,KAErB3X,EAAYxG,EAAOwG,UAIvBzJ,EAAOD,QAAU,SAAU0G,EAAGgc,GAC5B,IAAI9b,EAAOF,EAAEE,KACb,GAAIiB,EAAWjB,GAAO,CACpB,IAAIyE,EAAS1K,EAAKiG,EAAMF,EAAGgc,GAE3B,OADe,OAAXrX,GAAiBvF,EAASuF,GACvBA,EAET,GAAmB,WAAfmO,EAAQ9S,GAAiB,OAAO/F,EAAK0gB,EAAY3a,EAAGgc,GACxD,MAAMhZ,EAAU,iD,gBCnBlB,IAAI/D,EAAc,EAAQ,GAE1B1F,EAAOD,QAAU2F,EAAY,GAAG6K,Q,gBCFhC,IAAI3H,EAAkB,EAAQ,IAC1B/G,EAAS,EAAQ,IACjB4Y,EAAuB,EAAQ,IAE/BokB,EAAcj2B,EAAgB,eAC9Bk2B,EAAiBzuB,MAAMlO,UAIQ8B,MAA/B66B,EAAeD,IACjBpkB,EAAqB9V,EAAEm6B,EAAgBD,EAAa,CAClDrwB,cAAc,EACdhN,MAAOK,EAAO,QAKlB7B,EAAOD,QAAU,SAAU+B,GACzBg9B,EAAeD,GAAa/8B,IAAO,I,6BCjBrC,IAAIyB,EAAI,EAAQ,GACZ7C,EAAO,EAAQ,IACf0G,EAAU,EAAQ,IAClB23B,EAAe,EAAQ,IACvBn3B,EAAa,EAAQ,IACrBo3B,EAA4B,EAAQ,KACpCvB,EAAiB,EAAQ,KACzBj2B,EAAiB,EAAQ,KACzBC,EAAiB,EAAQ,IACzBpD,EAA8B,EAAQ,IACtC7B,EAAW,EAAQ,IACnBoG,EAAkB,EAAQ,IAC1BiK,EAAY,EAAQ,IACpBosB,EAAgB,EAAQ,KAExBt5B,EAAuBo5B,EAAan5B,OACpC6T,EAA6BslB,EAAarlB,aAC1CwlB,EAAoBD,EAAcC,kBAClCC,EAAyBF,EAAcE,uBACvC3pB,EAAW5M,EAAgB,YAK3Bw2B,EAAa,WAAc,OAAOj/B,MAEtCH,EAAOD,QAAU,SAAUs/B,EAAUC,EAAMC,EAAqBhf,EAAMif,EAASC,EAAQr1B,GACrF40B,EAA0BO,EAAqBD,EAAM/e,GAErD,IAkBImf,EAA0BnB,EAASL,EAlBnCyB,EAAqB,SAAUC,GACjC,GAAIA,IAASJ,GAAWK,EAAiB,OAAOA,EAChD,IAAKV,GAA0BS,KAAQE,EAAmB,OAAOA,EAAkBF,GACnF,OAAQA,GACN,IAbK,OAcL,IAbO,SAcP,IAbQ,UAaM,OAAO,WAAqB,OAAO,IAAIL,EAAoBp/B,KAAMy/B,IAC/E,OAAO,WAAc,OAAO,IAAIL,EAAoBp/B,QAGpDsV,EAAgB6pB,EAAO,YACvBS,GAAwB,EACxBD,EAAoBT,EAASl9B,UAC7B69B,EAAiBF,EAAkBtqB,IAClCsqB,EAAkB,eAClBN,GAAWM,EAAkBN,GAC9BK,GAAmBV,GAA0Ba,GAAkBL,EAAmBH,GAClFS,EAA4B,SAARX,GAAkBQ,EAAkBI,SAA4BF,EA+BxF,GA3BIC,IACFP,EAA2BjC,EAAewC,EAAkBv/B,KAAK,IAAI2+B,OACpCp+B,OAAOkB,WAAau9B,EAAyBnf,OACvEnZ,GAAWq2B,EAAeiC,KAA8BR,IACvD13B,EACFA,EAAek4B,EAA0BR,GAC/Bt3B,EAAW83B,EAAyBlqB,KAC9ChT,EAASk9B,EAA0BlqB,EAAU4pB,IAIjD33B,EAAei4B,EAA0BjqB,GAAe,GAAM,GAC1DrO,IAASyL,EAAU4C,GAAiB2pB,IAKxCz5B,GA9CO,UA8CiB65B,GAAqBQ,GA9CtC,WA8CwDA,EAAel/B,QAC3EsG,GAAWqS,EACdpV,EAA4By7B,EAAmB,OAhDxC,WAkDPC,GAAwB,EACxBF,EAAkB,WAAoB,OAAOn/B,EAAKs/B,EAAgB7/B,SAKlEq/B,EAMF,GALAjB,EAAU,CACR3wB,OAAQ+xB,EA1DD,UA2DPxsB,KAAMssB,EAASI,EAAkBF,EA5D5B,QA6DLO,QAASP,EA3DD,YA6DNv1B,EAAQ,IAAK8zB,KAAOK,GAClBY,GAA0BY,KAA2B7B,KAAO4B,KAC9Dt9B,EAASs9B,EAAmB5B,EAAKK,EAAQL,SAEtC36B,EAAE,CAAEG,OAAQ47B,EAAM37B,OAAO,EAAMC,OAAQu7B,GAA0BY,GAAyBxB,GASnG,OALMn3B,IAAWgD,GAAW01B,EAAkBtqB,KAAcqqB,GAC1Dr9B,EAASs9B,EAAmBtqB,EAAUqqB,EAAiB,CAAE/+B,KAAM0+B,IAEjE3sB,EAAUysB,GAAQO,EAEXtB,I,gBCjGT,IAAIt7B,EAAS,EAAQ,GACjBlB,EAAO,EAAQ,IACfrB,EAAO,EAAQ,IACfmF,EAAW,EAAQ,IACnBuvB,EAAc,EAAQ,IACtB+K,EAAwB,EAAQ,KAChClwB,EAAoB,EAAQ,IAC5BnK,EAAgB,EAAQ,IACxBs6B,EAAc,EAAQ,KACtBC,EAAoB,EAAQ,KAC5BC,EAAgB,EAAQ,KAExB72B,EAAYxG,EAAOwG,UAEnB82B,EAAS,SAAUC,EAASp1B,GAC9BjL,KAAKqgC,QAAUA,EACfrgC,KAAKiL,OAASA,GAGZq1B,EAAkBF,EAAOp+B,UAE7BnC,EAAOD,QAAU,SAAU+K,EAAU41B,EAAiB37B,GACpD,IAKI1B,EAAUs9B,EAAQ5yB,EAAO/J,EAAQoH,EAAQmV,EAAMqgB,EAL/CtzB,EAAOvI,GAAWA,EAAQuI,KAC1BuzB,KAAgB97B,IAAWA,EAAQ87B,YACnCC,KAAiB/7B,IAAWA,EAAQ+7B,aACpCC,KAAiBh8B,IAAWA,EAAQg8B,aACpCj6B,EAAK/E,EAAK2+B,EAAiBpzB,GAG3B0zB,EAAO,SAAUC,GAEnB,OADI59B,GAAUi9B,EAAcj9B,EAAU,SAAU49B,GACzC,IAAIV,GAAO,EAAMU,IAGtBC,EAAS,SAAU1/B,GACrB,OAAIq/B,GACFh7B,EAASrE,GACFu/B,EAAcj6B,EAAGtF,EAAM,GAAIA,EAAM,GAAIw/B,GAAQl6B,EAAGtF,EAAM,GAAIA,EAAM,KAChEu/B,EAAcj6B,EAAGtF,EAAOw/B,GAAQl6B,EAAGtF,IAG9C,GAAIs/B,EACFz9B,EAAWyH,MACN,CAEL,KADA61B,EAASN,EAAkBv1B,IACd,MAAMrB,EAAU2rB,EAAYtqB,GAAY,oBAErD,GAAIq1B,EAAsBQ,GAAS,CACjC,IAAK5yB,EAAQ,EAAG/J,EAASiM,EAAkBnF,GAAW9G,EAAS+J,EAAOA,IAEpE,IADA3C,EAAS81B,EAAOp2B,EAASiD,MACXjI,EAAc26B,EAAiBr1B,GAAS,OAAOA,EAC7D,OAAO,IAAIm1B,GAAO,GAEtBl9B,EAAW+8B,EAAYt1B,EAAU61B,GAInC,IADApgB,EAAOld,EAASkd,OACPqgB,EAAOlgC,EAAK6f,EAAMld,IAAWwJ,MAAM,CAC1C,IACEzB,EAAS81B,EAAON,EAAKp/B,OACrB,MAAOgD,GACP87B,EAAcj9B,EAAU,QAASmB,GAEnC,GAAqB,iBAAV4G,GAAsBA,GAAUtF,EAAc26B,EAAiBr1B,GAAS,OAAOA,EAC1F,OAAO,IAAIm1B,GAAO,K,gBChEtB,IAAIhnB,EAAU,EAAQ,IAClB2H,EAAY,EAAQ,IACpBrO,EAAY,EAAQ,IAGpB2C,EAFkB,EAAQ,GAEf5M,CAAgB,YAE/B5I,EAAOD,QAAU,SAAU4C,GACzB,GAAUsB,MAANtB,EAAiB,OAAOue,EAAUve,EAAI6S,IACrC0L,EAAUve,EAAI,eACdkQ,EAAU0G,EAAQ5W,M,gBCVzB,IAAIM,EAAS,EAAQ,GACjB6C,EAAgB,EAAQ,IAExB2D,EAAYxG,EAAOwG,UAEvBzJ,EAAOD,QAAU,SAAU4C,EAAIw+B,GAC7B,GAAIr7B,EAAcq7B,EAAWx+B,GAAK,OAAOA,EACzC,MAAM8G,EAAU,0B,gBCPlB,IAEI+L,EAFkB,EAAQ,GAEf5M,CAAgB,YAC3Bw4B,GAAe,EAEnB,IACE,IAAIzF,EAAS,EACT0F,EAAqB,CACvB9gB,KAAM,WACJ,MAAO,CAAE1T,OAAQ8uB,MAEnB,OAAU,WACRyF,GAAe,IAGnBC,EAAmB7rB,GAAY,WAC7B,OAAOrV,MAGTkQ,MAAMqD,KAAK2tB,GAAoB,WAAc,MAAM,KACnD,MAAO78B,IAETxE,EAAOD,QAAU,SAAU4G,EAAM26B,GAC/B,IAAKA,IAAiBF,EAAc,OAAO,EAC3C,IAAIG,GAAoB,EACxB,IACE,IAAIt/B,EAAS,GACbA,EAAOuT,GAAY,WACjB,MAAO,CACL+K,KAAM,WACJ,MAAO,CAAE1T,KAAM00B,GAAoB,MAIzC56B,EAAK1E,GACL,MAAOuC,IACT,OAAO+8B,I,gBCpCT,IAAIhoB,EAAU,EAAQ,IAClBtW,EAAS,EAAQ,GAErBjD,EAAOD,QAAqC,WAA3BwZ,EAAQtW,EAAO0G,U,gBCHhC,IAAIpG,EAAI,EAAQ,GACZyC,EAAQ,EAAQ,GAChB4I,EAAkB,EAAQ,IAC1B4M,EAAiC,EAAQ,IAAmD7W,EAC5FuJ,EAAc,EAAQ,IAEtBszB,EAAsBx7B,GAAM,WAAcwV,EAA+B,MAK7EjY,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAM3B,QAJpBsK,GAAeszB,EAIqB/7B,MAAOyI,GAAe,CACtExJ,yBAA0B,SAAkC/B,EAAIb,GAC9D,OAAO0Z,EAA+B5M,EAAgBjM,GAAKb,O,gBCb/D,IAAIyB,EAAI,EAAQ,GACZ2K,EAAc,EAAQ,IACtBuzB,EAAU,EAAQ,KAClB7yB,EAAkB,EAAQ,IAC1B4L,EAAiC,EAAQ,IACzCtK,EAAiB,EAAQ,IAI7B3M,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAME,MAAOyI,GAAe,CACtDwzB,0BAA2B,SAAmCz/B,GAO5D,IANA,IAKIH,EAAKqD,EALLwL,EAAI/B,EAAgB3M,GACpByC,EAA2B8V,EAA+B7V,EAC1DwO,EAAOsuB,EAAQ9wB,GACfvF,EAAS,GACT2C,EAAQ,EAELoF,EAAKnP,OAAS+J,QAEA9J,KADnBkB,EAAaT,EAAyBiM,EAAG7O,EAAMqR,EAAKpF,QACtBmC,EAAe9E,EAAQtJ,EAAKqD,GAE5D,OAAOiG,M,6BCrBX,UAYI,EAAO,QAAW,0BAAP,EAUP,WAEN,SAASE,IACP,OAAO,EAGT,SAASq2B,IACP,OAAO,EAGT,SAASC,KA01CT,OAtzCA,SAAS//B,IAEP,IAAIggC,EAAS,CACX,CAAE/gC,KAAM,SAAa0J,KAAM,SAAUkD,GAAK,MAAoB,iBAANA,IACxD,CAAE5M,KAAM,SAAa0J,KAAM,SAAUkD,GAAK,MAAoB,iBAANA,IACxD,CAAE5M,KAAM,UAAa0J,KAAM,SAAUkD,GAAK,MAAoB,kBAANA,IACxD,CAAE5M,KAAM,WAAa0J,KAAM,SAAUkD,GAAK,MAAoB,mBAANA,IACxD,CAAE5M,KAAM,QAAa0J,KAAM6F,MAAMP,SACjC,CAAEhP,KAAM,OAAa0J,KAAM,SAAUkD,GAAK,OAAOA,aAAaqnB,OAC9D,CAAEj0B,KAAM,SAAa0J,KAAM,SAAUkD,GAAK,OAAOA,aAAavH,SAC9D,CAAErF,KAAM,SAAa0J,KAAM,SAAUkD,GACnC,MAAoB,iBAANA,GAAwB,OAANA,GAAcA,EAAEpK,cAAgBrC,SAElE,CAAEH,KAAM,OAAa0J,KAAM,SAAUkD,GAAK,OAAa,OAANA,IACjD,CAAE5M,KAAM,YAAa0J,KAAM,SAAUkD,GAAK,YAAazJ,IAANyJ,KAG/Co0B,EAAU,CACZhhC,KAAM,MACN0J,KAAMc,GAIJy2B,EAAU,GAGVC,EAAe,GAGfC,EAAQ,CACVC,MAAOL,EACPM,YAAaH,EACbI,OAAQL,GASV,SAASM,EAAgBC,GACvB,IAAIC,EAAQC,EAAYP,EAAMC,OAAO,SAAUK,GAC7C,OAAOA,EAAMzhC,OAASwhC,KAGxB,GAAIC,EACF,OAAOA,EAGT,GAAiB,QAAbD,EACF,OAAOR,EAGT,IAAIhkB,EAAO0kB,EAAYP,EAAMC,OAAO,SAAUK,GAC5C,OAAOA,EAAMzhC,KAAKkwB,gBAAkBsR,EAAStR,iBAG/C,MAAM,IAAIvnB,UAAU,iBAAmB64B,EAAW,KAC7CxkB,EAAQ,mBAAqBA,EAAKhd,KAAO,KAAQ,KAQxD,SAAS2hC,EAAcx1B,GACrB,OAAIA,IAAS60B,EACJ,IAGFG,EAAMC,MAAM7b,QAAQpZ,GAS7B,SAASy1B,EAAalhC,GACpB,IAAI+gC,EAAQC,EAAYP,EAAMC,OAAO,SAAUK,GAC7C,OAAOA,EAAM/3B,KAAKhJ,MAGpB,GAAI+gC,EACF,OAAOA,EAAMzhC,KAGf,MAAM,IAAI2I,UAAU,kCAAoCjI,GA+E1D,SAASmhC,EAAiBC,GACxB,OAAOA,EACFn/B,KAAI,SAAUo/B,GACb,IAAIC,EAAYD,EAAMX,MAAMz+B,IAAIs/B,GAEhC,OAAQF,EAAMG,UAAY,MAAQ,IAAMF,EAAU/zB,KAAK,QAExDA,KAAK,KASZ,SAASk0B,EAAYJ,EAAOV,GAC1B,IAAIa,EAAqC,IAAzBH,EAAMxc,QAAQ,OAO1Byc,GANUE,EAEPH,EAAM7+B,OAAS,EACZ6+B,EAAMtyB,MAAM,GACZ,MAHJsyB,GAKgBxtB,MAAM,KAAK5R,IAAI0Q,GAChC8F,OAAOipB,GACPjpB,OAAOkpB,GAERC,EA+cN,SAA2BjB,EAAaW,GACtC,IAAIO,EAAU,GAUd,OARAlB,EAAY/9B,SAAQ,SAAUk/B,IACgB,IAAxCR,EAAUzc,QAAQid,EAAW5vB,QACS,IAAtCovB,EAAUzc,QAAQid,EAAW3vB,KAC5B0vB,EAAQC,EAAW5vB,QACtB2vB,EAAQC,EAAW5vB,MAAQ4vB,MAIxBriC,OAAOkS,KAAKkwB,GAAS5/B,KAAI,SAAUiQ,GACxC,OAAO2vB,EAAQ3vB,MA3dS6vB,CAAkBpB,EAAaW,GAErDU,EAAaV,EAAUr/B,KAAI,SAAU6+B,GACvC,IAAIr1B,EAAOo1B,EAAeC,GAE1B,MAAO,CACLxhC,KAAMwhC,EACNmB,UAAWhB,EAAcx1B,GACzBzC,KAAMyC,EAAKzC,KACX84B,WAAY,KACZI,iBAAkB,MAIlBC,EAAmBP,EAAoB3/B,KAAI,SAAU6/B,GACvD,IAAIr2B,EAAOo1B,EAAeiB,EAAW5vB,MAErC,MAAO,CACL5S,KAAMwiC,EAAW5vB,KACjB+vB,UAAWhB,EAAcx1B,GACzBzC,KAAMyC,EAAKzC,KACX84B,WAAYA,EACZI,gBAAiBvB,EAAY9b,QAAQid,OAIzC,MAAO,CACLpB,MAAOsB,EAAWryB,OAAOwyB,GACzBX,UAAWA,GAgDf,SAASY,EAAahB,GACpB,IAAIC,EAAQgB,EAAKjB,GACjB,QAAOC,GAAQA,EAAMG,UASvB,SAASc,EAAejB,GACtB,OAAOA,EAAMX,MAAM/H,MAAK,SAAUltB,GAChC,OAA0B,MAAnBA,EAAKq2B,cAUhB,SAASS,EAAYlB,GACnB,GAAKA,GAAgC,IAAvBA,EAAMX,MAAMl+B,OAIrB,IAA2B,IAAvB6+B,EAAMX,MAAMl+B,OACnB,OAAOq+B,EAAeQ,EAAMX,MAAM,GAAGphC,MAAM0J,KAExC,GAA2B,IAAvBq4B,EAAMX,MAAMl+B,OAAc,CACjC,IAAIggC,EAAQ3B,EAAeQ,EAAMX,MAAM,GAAGphC,MAAM0J,KAC5Cy5B,EAAQ5B,EAAeQ,EAAMX,MAAM,GAAGphC,MAAM0J,KAChD,OAAO,SAAYkD,GACjB,OAAOs2B,EAAMt2B,IAAMu2B,EAAMv2B,IAI3B,IAAIw2B,EAAQrB,EAAMX,MAAMz+B,KAAI,SAAUwJ,GACpC,OAAOo1B,EAAep1B,EAAKnM,MAAM0J,QAEnC,OAAO,SAAYkD,GACjB,IAAK,IAAInN,EAAI,EAAGA,EAAI2jC,EAAMlgC,OAAQzD,IAChC,GAAI2jC,EAAM3jC,GAAGmN,GACX,OAAO,EAGX,OAAO,GAtBT,OAAOpC,EAgCX,SAAS64B,EAAavB,GACpB,IAAIsB,EAAOF,EAAOC,EAkwBHrxB,EAhwBf,GAAIgxB,EAAahB,GAAS,CAGxB,IAAIwB,GADJF,GA8vBatxB,EA9vBGgwB,EA+vBXhwB,EAAIrC,MAAM,EAAGqC,EAAI5O,OAAS,IA/vBPP,IAAIsgC,IACP//B,OACjBqgC,EAAWN,EAAYF,EAAKjB,IAUhC,OAAO,SAAkBjlB,GACvB,IAAK,IAAIpd,EAAI,EAAGA,EAAI2jC,EAAMlgC,OAAQzD,IAChC,IAAK2jC,EAAM3jC,GAAGod,EAAKpd,IACjB,OAAO,EAGX,OAfkB,SAAUod,GAC5B,IAAK,IAAIpd,EAAI6jC,EAAU7jC,EAAIod,EAAK3Z,OAAQzD,IACtC,IAAK8jC,EAAS1mB,EAAKpd,IACjB,OAAO,EAGX,OAAO,EASA+jC,CAAc3mB,IAAUA,EAAK3Z,QAAUogC,EAAW,GAK3D,OAAsB,IAAlBxB,EAAO5+B,OACF,SAAkB2Z,GACvB,OAAuB,IAAhBA,EAAK3Z,QAGW,IAAlB4+B,EAAO5+B,QACdggC,EAAQD,EAAYnB,EAAO,IACpB,SAAkBjlB,GACvB,OAAOqmB,EAAMrmB,EAAK,KAAuB,IAAhBA,EAAK3Z,SAGP,IAAlB4+B,EAAO5+B,QACdggC,EAAQD,EAAYnB,EAAO,IAC3BqB,EAAQF,EAAYnB,EAAO,IACpB,SAAkBjlB,GACvB,OAAOqmB,EAAMrmB,EAAK,KAAOsmB,EAAMtmB,EAAK,KAAuB,IAAhBA,EAAK3Z,UAIlDkgC,EAAQtB,EAAOn/B,IAAIsgC,GACZ,SAAkBpmB,GACvB,IAAK,IAAIpd,EAAI,EAAGA,EAAI2jC,EAAMlgC,OAAQzD,IAChC,IAAK2jC,EAAM3jC,GAAGod,EAAKpd,IACjB,OAAO,EAGX,OAAOod,EAAK3Z,SAAWkgC,EAAMlgC,SAcrC,SAASugC,EAAgBC,EAAWz2B,GAClC,OAAOA,EAAQy2B,EAAU5B,OAAO5+B,OAC1BwgC,EAAU5B,OAAO70B,GACjB61B,EAAaY,EAAU5B,QACnBiB,EAAKW,EAAU5B,QACf,KAUZ,SAAS6B,EAAsBD,EAAWz2B,EAAO22B,GAC/C,IAAI7B,EAAQ0B,EAAgBC,EAAWz2B,GAOvC,OANY80B,EACN6B,EACQ7B,EAAMX,MAAMjoB,OAAO0qB,GACnB9B,EAAMX,MACd,IAEOz+B,IAAIs/B,GAQnB,SAASA,EAAY91B,GACnB,OAAOA,EAAKnM,KAQd,SAAS6jC,EAAY13B,GACnB,OAA2B,OAApBA,EAAKq2B,iBAA2Cr/B,IAApBgJ,EAAKq2B,WAU1C,SAASsB,EAAoBC,EAAY92B,GACvC,IAAI+0B,EAktBN,SAAclwB,GAEZ,IADA,IAAIstB,EAAU,GACL3/B,EAAI,EAAGA,EAAIqS,EAAI5O,OAAQzD,IAC9B2/B,EAAQttB,EAAIrS,KAAM,EAEpB,OAAOU,OAAOkS,KAAK+sB,GAvtBH4E,CAAKC,EAAQF,GAAY,SAAUL,GACjD,OAAOC,EAAqBD,EAAWz2B,GAAO,OAGhD,OAAsC,IAA9B+0B,EAAUzc,QAAQ,OAAiB,CAAC,OAASyc,EAWvD,SAASkC,EAAYlkC,EAAM6c,EAAMknB,GAC/B,IAAII,EAAKC,EAKLn3B,EAJAo3B,EAAQrkC,GAAQ,UAGhBskC,EAAqBP,EAEzB,IAAK92B,EAAQ,EAAGA,EAAQ4P,EAAK3Z,OAAQ+J,IAAS,CAC5C,IAAIs3B,EAAmBD,EAAmBnrB,QAAO,SAAUuqB,GACzD,IAAIh6B,EAAOu5B,EAAYQ,EAAgBC,EAAWz2B,IAClD,OAAQA,EAAQy2B,EAAU5B,OAAO5+B,QAAU4/B,EAAaY,EAAU5B,UAC9Dp4B,EAAKmT,EAAK5P,OAGhB,GAAgC,IAA5Bs3B,EAAiBrhC,QAGnB,IADAkhC,EAAWN,EAAoBQ,EAAoBr3B,IACtC/J,OAAS,EAAG,CACvB,IAAIshC,EAAa5C,EAAa/kB,EAAK5P,IAYnC,OAVAk3B,EAAM,IAAIx7B,UAAU,2CAA6C07B,EAC7D,eAAiBD,EAASn2B,KAAK,QAC/B,aAAeu2B,EAAa,YAAcv3B,EAAQ,MAClDqrB,KAAO,CACTmM,SAAU,YACVz+B,GAAIq+B,EACJp3B,MAAOA,EACPy3B,OAAQF,EACRJ,SAAUA,GAELD,QAITG,EAAqBC,EAKzB,IAAII,EAAUL,EAAmB3hC,KAAI,SAAU+gC,GAC7C,OAAOZ,EAAaY,EAAU5B,QAAUtqB,IAAWksB,EAAU5B,OAAO5+B,UAEtE,GAAI2Z,EAAK3Z,OAASpB,KAAKyQ,IAAItM,MAAM,KAAM0+B,GAWrC,OAVAP,EAAWN,EAAoBQ,EAAoBr3B,IACnDk3B,EAAM,IAAIx7B,UAAU,iCAAmC07B,EACnD,eAAiBD,EAASn2B,KAAK,QAC/B,YAAc4O,EAAK3Z,OAAS,MAC5Bo1B,KAAO,CACTmM,SAAU,aACVz+B,GAAIq+B,EACJp3B,MAAO4P,EAAK3Z,OACZkhC,SAAUA,GAELD,EAIT,IAAIS,EAAY9iC,KAAK0N,IAAIvJ,MAAM,KAAM0+B,GACrC,OAAI9nB,EAAK3Z,OAAS0hC,IAChBT,EAAM,IAAIx7B,UAAU,kCAAoC07B,EACpD,eAAiBO,EAAY,aAAe/nB,EAAK3Z,OAAS,MAC1Do1B,KAAO,CACTmM,SAAU,cACVz+B,GAAIq+B,EACJp3B,MAAO4P,EAAK3Z,OACZ2hC,eAAgBD,GAEXT,KAGTA,EAAM,IAAIx7B,UAAU,sBAAwBkU,EAAK5O,KAAK,MAClD,4DAA8Do2B,EAAQ,MACtE/L,KAAO,CACTmM,SAAU,WACVC,OAAQ7nB,EAAKla,IAAIi/B,IAEZuC,GAQT,SAASW,EAAoB/C,GAG3B,IAFA,IAAIxvB,EAAM,IAED9S,EAAI,EAAGA,EAAIsiC,EAAMX,MAAMl+B,OAAQzD,IAClCokC,EAAY9B,EAAMX,MAAM3hC,MAC1B8S,EAAMzQ,KAAKyQ,IAAIA,EAAKwvB,EAAMX,MAAM3hC,GAAGkjC,YAIvC,OAAOpwB,EAST,SAASwyB,EAA0BhD,GAGjC,IAFA,IAAIxvB,EAAM,IAED9S,EAAI,EAAGA,EAAIsiC,EAAMX,MAAMl+B,OAAQzD,IACjCokC,EAAY9B,EAAMX,MAAM3hC,MAC3B8S,EAAMzQ,KAAKyQ,IAAIA,EAAKwvB,EAAMX,MAAM3hC,GAAGmjC,kBAIvC,OAAOrwB,EAWT,SAASyyB,EAAeC,EAAQC,GAC9B,IAAIplC,EAIJ,OAAU,IADVA,EAAImlC,EAAO/C,UAAYgD,EAAOhD,YAOpB,IADVpiC,EAAIkjC,EAAeiC,GAAUjC,EAAekC,KAOlC,IADVplC,EAAIglC,EAAmBG,GAAUH,EAAmBI,IAV3CplC,EAgBFilC,EAAyBE,GAAUF,EAAyBG,GAWrE,SAASC,EAAmBC,EAAYC,GACtC,IACI5lC,EACAK,EAFA4Q,EAAM5O,KAAKyQ,IAAI6yB,EAAWtD,OAAO5+B,OAAQmiC,EAAWvD,OAAO5+B,QAM/D,GAAU,IADVpD,EAAIslC,EAAWtD,OAAOzI,KAAK2J,GAAkBqC,EAAWvD,OAAOzI,KAAK2J,IAElE,OAAOljC,EAIT,IAAKL,EAAI,EAAGA,EAAIiR,EAAKjR,IAEnB,GAAU,IADVK,EAAIkjC,EAAeoC,EAAWtD,OAAOriC,IAAMujC,EAAeqC,EAAWvD,OAAOriC,KAE1E,OAAOK,EAKX,IAAKL,EAAI,EAAGA,EAAIiR,EAAKjR,IAEnB,GAAU,KADVK,EAAIklC,EAAcI,EAAWtD,OAAOriC,GAAI4lC,EAAWvD,OAAOriC,KAExD,OAAOK,EAKX,OAAOslC,EAAWtD,OAAO5+B,OAASmiC,EAAWvD,OAAO5+B,OA6EtD,SAASoiC,EAAqBvD,GAC5B,IAAImB,EAAOC,EAAOoC,EAAaC,EAC3BpC,EAAQ,GACR/B,EAAc,GAUlB,OARAU,EAAMX,MAAM99B,SAAQ,SAAU6I,GACxBA,EAAKq2B,aACPY,EAAMtoB,KAAKymB,EAAep1B,EAAKq2B,WAAW5vB,MAAMlJ,MAChD23B,EAAYvmB,KAAK3O,EAAKq2B,WAAWiD,aAK7BpE,EAAYn+B,QAClB,KAAK,EACH,OAAO,SAAoBuN,GACzB,OAAOA,GAGX,KAAK,EAGH,OAFAyyB,EAAQE,EAAM,GACdmC,EAAclE,EAAY,GACnB,SAAoB5wB,GACzB,OAAIyyB,EAAMzyB,GACD80B,EAAY90B,GAEdA,GAGX,KAAK,EAKH,OAJAyyB,EAAQE,EAAM,GACdD,EAAQC,EAAM,GACdmC,EAAclE,EAAY,GAC1BmE,EAAcnE,EAAY,GACnB,SAAoB5wB,GACzB,OAAIyyB,EAAMzyB,GACD80B,EAAY90B,GAEjB0yB,EAAM1yB,GACD+0B,EAAY/0B,GAEdA,GAGX,QACE,OAAO,SAAoBA,GACzB,IAAK,IAAIhR,EAAI,EAAGA,EAAI4hC,EAAYn+B,OAAQzD,IACtC,GAAI2jC,EAAM3jC,GAAGgR,GACX,OAAO4wB,EAAY5hC,GAAGgR,GAG1B,OAAOA,IA+Cf,SAASi1B,EAAY5D,EAAQ6D,GA4C3B,OA3CA,SAASC,EAAa9D,EAAQ70B,EAAOm0B,GACnC,GAAIn0B,EAAQ60B,EAAO5+B,OAAQ,CACzB,IAII2iC,EAJA9D,EAAQD,EAAO70B,GACf64B,EAAgBH,EACd5D,EAAMX,MAAMjoB,OAAO0qB,GACnB9B,EAAMX,MAGZ,GAAIW,EAAMG,UAAW,CAGnB,IAAIQ,EAAaoD,EAAc3sB,OAAO0qB,GACtCgC,EAAanD,EAAWx/B,OAAS4iC,EAAc5iC,OACzC,CAACw/B,EAAYoD,GACb,CAACA,QAKPD,EAAaC,EAAcnjC,KAAI,SAAUwJ,GACvC,MAAO,CAACA,MAKZ,OAAO83B,EAAQ4B,GAAY,SAAUE,GACnC,OAAOH,EAAa9D,EAAQ70B,EAAQ,EAAGm0B,EAAM/wB,OAAO,CAAC01B,QAavD,MAAO,CAPc3E,EAAMz+B,KAAI,SAAUwJ,EAAMw2B,GAC7C,MAAO,CACLvB,MAAOj1B,EACP+1B,UAAYS,IAAcb,EAAO5+B,OAAS,GAAM4/B,EAAahB,QAQ9D8D,CAAa9D,EAAQ,EAAG,IAyCjC,SAASkE,EAAoBhmC,EAAMimC,GACjC,GAA0C,IAAtC9lC,OAAOkS,KAAK4zB,GAAe/iC,OAC7B,MAAM,IAAIkS,YAAY,0BAIxB,IAAI8wB,EAAmB,GACvB/lC,OAAOkS,KAAK4zB,GACPtjC,KAAI,SAAU+gC,GACb,OAzqBR,SAAyBA,EAAW19B,EAAIq7B,GACtC,IAAIS,EAAS,GAkBb,MAhByB,KAArB4B,EAAUrwB,SACZyuB,EAAS4B,EACJnvB,MAAM,KACN5R,IAAI0Q,GACJ1Q,KAAI,SAAUo/B,EAAO90B,EAAOmD,GAC3B,IAAI+1B,EAAchE,EAAWJ,EAAOV,GAEpC,GAAI8E,EAAYjE,WAAcj1B,IAAUmD,EAAMlN,OAAS,EACrD,MAAM,IAAIkS,YAAY,8BAAgC2sB,EAAhC,0CAIxB,OAAOoE,MAIXrE,EAAOzI,KAAK+M,GAGP,KAGF,CACLtE,OAAQA,EACR97B,GAAIA,GA8oBOqgC,CAAe3C,EAAWuC,EAAcvC,GAAYvC,EAAME,gBAElEloB,OAAOmtB,GACPhjC,SAAQ,SAAUijC,GAEjB,IAAIC,EAAuB9E,EAAYwE,GAAkB,SAAU1kC,GACjE,OA/CV,SAA8B4jC,EAAYC,GAGxC,IAFA,IAAIoB,EAAK3kC,KAAK0N,IAAI41B,EAAWtD,OAAO5+B,OAAQmiC,EAAWvD,OAAO5+B,QAErDzD,EAAI,EAAGA,EAAIgnC,EAAIhnC,IAItB,IAAKinC,EAHa/C,EAAqByB,EAAY3lC,GAAG,GACpCkkC,EAAqB0B,EAAY5lC,GAAG,IAGpD,OAAO,EAIX,IAAIknC,EAAOvB,EAAWtD,OAAO5+B,OACzB0jC,EAAOvB,EAAWvD,OAAO5+B,OACzB2jC,EAAa/D,EAAasC,EAAWtD,QACrCgF,EAAahE,EAAauC,EAAWvD,QAEzC,OAAO+E,EACDC,EAAcH,IAASC,EAASA,GAAQD,EACxCG,EAAcH,GAAQC,EAAUD,IAASC,EA4BhCG,CAAqBvlC,EAAG+kC,MAEjC,GAAIC,EACF,MAAM,IAAI79B,UAAU,2BAChBk5B,EAAgB2E,EAAqB1E,QAAU,UAC/CD,EAAgB0E,EAAgBzE,QAAU,MAGhDoE,EAAiBprB,KAAKyrB,MAI5B,IAAIxC,EAAaE,EAAQiC,GAAkB,SAAUK,GAGnD,OAFaA,EAAkBb,EAAYa,EAAgBzE,QAAQ,GAAS,IAE9Dn/B,KAAI,SAAUm/B,GAC1B,MAAO,CACLA,OAAQA,EACR97B,GAAIugC,EAAgBvgC,UAGvBmT,OAAOmtB,GAEVvC,EAAWvmB,KAAK2nB,GAGhB,IAAI6B,EAAMjD,EAAW,IAAMA,EAAW,GAAGjC,OAAO5+B,QAAU,IAAM4/B,EAAaiB,EAAW,GAAGjC,QACvFmF,EAAMlD,EAAW,IAAMA,EAAW,GAAGjC,OAAO5+B,QAAU,IAAM4/B,EAAaiB,EAAW,GAAGjC,QACvFoF,EAAMnD,EAAW,IAAMA,EAAW,GAAGjC,OAAO5+B,QAAU,IAAM4/B,EAAaiB,EAAW,GAAGjC,QACvFqF,EAAMpD,EAAW,IAAMA,EAAW,GAAGjC,OAAO5+B,QAAU,IAAM4/B,EAAaiB,EAAW,GAAGjC,QACvFsF,EAAMrD,EAAW,IAAMA,EAAW,GAAGjC,OAAO5+B,QAAU,IAAM4/B,EAAaiB,EAAW,GAAGjC,QACvFuF,EAAMtD,EAAW,IAAMA,EAAW,GAAGjC,OAAO5+B,QAAU,IAAM4/B,EAAaiB,EAAW,GAAGjC,QACvFwF,EAAQN,GAAOC,GAAOC,GAAOC,GAAOC,GAAOC,EAG3CjE,EAAQW,EAAWphC,KAAI,SAAU+gC,GACnC,OAAOL,EAAaK,EAAU5B,WAG5ByF,EAASP,EAAM/D,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtD2G,EAASP,EAAMhE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtD4G,EAASP,EAAMjE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtD6G,EAASP,EAAMlE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtD8G,EAASP,EAAMnE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtD+G,EAASP,EAAMpE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EAEtDgH,EAASb,EAAM/D,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtDiH,EAASb,EAAMhE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtDkH,EAASb,EAAMjE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtDmH,EAASb,EAAMlE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtDoH,EAASb,EAAMnE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EACtDqH,EAASb,EAAMpE,EAAYc,EAAW,GAAGjC,OAAO,IAAMjB,EAGtDsH,EAAMpE,EAAWphC,KAAI,SAAS+gC,GAChC,OAvSJ,SAAkC5B,EAAQ97B,GACxC,IAAIoiC,EAAYpiC,EAIhB,GAAI87B,EAAOzI,KAAK2J,GAAiB,CAC/B,IAAId,EAAYY,EAAahB,GACzBuG,EAAsBvG,EAAOn/B,IAAI2iC,GAErC8C,EAAY,WAGV,IAFA,IAAIvrB,EAAO,GACPkmB,EAAOb,EAAYj/B,UAAUC,OAAS,EAAID,UAAUC,OAC/CzD,EAAI,EAAGA,EAAIsjC,EAAMtjC,IACxBod,EAAKpd,GAAK4oC,EAAoB5oC,GAAGwD,UAAUxD,IAM7C,OAJIyiC,IACFrlB,EAAKkmB,GAAQ9/B,UAAU8/B,GAAMpgC,IAAI0lC,EAAoBtF,KAGhD/8B,EAAGC,MAAM5G,KAAMwd,IAI1B,IAAIyrB,EAAeF,EACnB,GAAItF,EAAahB,GAAS,CACxB,IAAIviB,EAASuiB,EAAO5+B,OAAS,EAE7BolC,EAAe,WACb,OAAOF,EAAUniC,MAAM5G,KACnBoQ,EAAMxM,UAAW,EAAGsc,GAAQlP,OAAO,CAACZ,EAAMxM,UAAWsc,OAI7D,OAAO+oB,EAsQEC,CAAyB7E,EAAU5B,OAAQ4B,EAAU19B,OAG1DwiC,EAAMxB,EAAMmB,EAAI,GAAKrH,EACrB2H,EAAMxB,EAAMkB,EAAI,GAAKrH,EACrB4H,EAAMxB,EAAMiB,EAAI,GAAKrH,EACrB6H,EAAMxB,EAAMgB,EAAI,GAAKrH,EACrB8H,EAAMxB,EAAMe,EAAI,GAAKrH,EACrB+H,EAAMxB,EAAMc,EAAI,GAAKrH,EAErBgI,EAAO9B,EAAMjD,EAAW,GAAGjC,OAAO5+B,QAAU,EAC5CyjC,EAAOM,EAAMlD,EAAW,GAAGjC,OAAO5+B,QAAU,EAC5C0jC,EAAOM,EAAMnD,EAAW,GAAGjC,OAAO5+B,QAAU,EAC5C6lC,GAAO5B,EAAMpD,EAAW,GAAGjC,OAAO5+B,QAAU,EAC5C8lC,GAAO5B,EAAMrD,EAAW,GAAGjC,OAAO5+B,QAAU,EAC5C+lC,GAAO5B,EAAMtD,EAAW,GAAGjC,OAAO5+B,QAAU,EAG5CgmC,GAAS5B,EAAQ,EAAI,EACrB6B,GAAOpF,EAAW7gC,OAClBkmC,GAAU,WAGZ,IAAK,IAAI3pC,EAAIypC,GAAQzpC,EAAI0pC,GAAM1pC,IAC7B,GAAI2jC,EAAM3jC,GAAGwD,WACX,OAAOklC,EAAI1oC,GAAGwG,MAAM5G,KAAM4D,WAI9B,OAAOk+B,EAAMkI,WAAWrpC,EAAMiD,UAAW8gC,IAKvC/9B,GAAK,SAASA,EAAGsjC,EAAMC,GAGzB,OAAItmC,UAAUC,SAAW4lC,GAAQvB,EAAO+B,IAASzB,EAAO0B,GAAgBf,EAAIviC,MAAMD,EAAI/C,WAClFA,UAAUC,SAAWyjC,GAAQa,EAAO8B,IAASxB,EAAOyB,GAAgBd,EAAIxiC,MAAMD,EAAI/C,WAClFA,UAAUC,SAAW0jC,GAAQa,EAAO6B,IAASvB,EAAOwB,GAAgBb,EAAIziC,MAAMD,EAAI/C,WAClFA,UAAUC,SAAW6lC,IAAQrB,EAAO4B,IAAStB,EAAOuB,GAAgBZ,EAAI1iC,MAAMD,EAAI/C,WAClFA,UAAUC,SAAW8lC,IAAQrB,EAAO2B,IAASrB,EAAOsB,GAAgBX,EAAI3iC,MAAMD,EAAI/C,WAClFA,UAAUC,SAAW+lC,IAAQrB,EAAO0B,IAASpB,EAAOqB,GAAgBV,EAAI5iC,MAAMD,EAAI/C,WAE/EmmC,GAAQnjC,MAAMD,EAAI/C,YAI3B,IACE9C,OAAOC,eAAe4F,GAAI,OAAQ,CAACtF,MAAOV,IAE5C,MAAOmkC,IASP,OAFAn+B,GAAG+9B,WApPL,SAA6BA,GAC3B,IAAIkC,EAAgB,GASpB,OARAlC,EAAWzgC,SAAQ,SAAUogC,GACtBA,EAAU5B,OAAOzI,KAAK2J,IACzB0C,EAAYhC,EAAU5B,QAAQ,GAAMx+B,SAAQ,SAAUw+B,GACpDmE,EAAcpE,EAAgBC,IAAW4B,EAAU19B,SAKlDigC,EA0OSuD,CAAoBzF,GAE7B/9B,GAST,SAASyjC,EAAYzpC,EAAM6c,EAAMknB,GAC/B,MAAMG,EAAYlkC,EAAM6c,EAAMknB,GAQhC,SAAS1B,EAAUb,GACjB,OAA2C,IAApCL,EAAMG,OAAO/b,QAAQic,GAQ9B,SAASnuB,EAAKwM,GACZ,OAAOA,EAAIxM,OAQb,SAAS+uB,EAASviB,GAChB,QAASA,EAQX,SAASymB,EAAQ5lC,GACf,OAAiB,OAAVA,EAQT,SAAS0lC,EAAgBrE,GACvB,OAA8B,IAAvBA,EAAMX,MAAMl+B,OAiBrB,SAAS6/B,EAAKjxB,GACZ,OAAOA,EAAIA,EAAI5O,OAAS,GAU1B,SAASuM,EAAMqC,EAAKpC,EAAOC,GACzB,OAAOJ,MAAMlO,UAAUoO,MAAM7P,KAAKkS,EAAKpC,EAAOC,GAmBhD,SAAS+2B,EAAWgD,EAAQC,GAC1B,IAAK,IAAIlqC,EAAI,EAAGA,EAAIiqC,EAAOxmC,OAAQzD,IACjC,GAZc2Q,EAYDu5B,EAZQC,EAYAF,EAAOjqC,IAXE,IAAzB2Q,EAAMmV,QAAQqkB,GAYjB,OAAO,EAbb,IAAkBx5B,EAAOw5B,EAiBvB,OAAO,EAUT,SAASlI,EAAY5vB,EAAKpI,GACxB,IAAK,IAAIjK,EAAI,EAAGA,EAAIqS,EAAI5O,OAAQzD,IAC9B,GAAIiK,EAAKoI,EAAIrS,IACX,OAAOqS,EAAIrS,GA0BjB,SAASwkC,EAAQnyB,EAAK+3B,GACpB,OAAOt6B,MAAMlO,UAAUgP,OAAOpK,MAAM,GAAI6L,EAAInP,IAAIknC,IAQlD,SAASC,EAAS3B,GAGhB,IAFA,IAAInoC,EAAO,GAEFP,EAAI,EAAGA,EAAI0oC,EAAIjlC,OAAQzD,IAAK,CACnC,IAAIuG,EAAKmiC,EAAI1oC,GAGb,IAA8B,iBAAlBuG,EAAG+9B,YAAmD,iBAAjB/9B,EAAG09B,YAAuC,KAAZ19B,EAAGhG,KAChF,GAAa,KAATA,EACFA,EAAOgG,EAAGhG,UAEP,GAAIA,IAASgG,EAAGhG,KAAM,CACzB,IAAImkC,EAAM,IAAIlnB,MAAM,0CAA4Cjd,EAAO,aAAegG,EAAGhG,KAAO,KAKhG,MAJAmkC,EAAI7L,KAAO,CACToM,OAAQ1+B,EAAGhG,KACXokC,SAAUpkC,GAENmkC,GAKZ,OAAOnkC,EAIT,SAAS+pC,EAAkB5B,GACzB,IAAIhE,EACA8B,EAAgB,GAEpB,SAAS+D,EAAeC,EAAYC,GAClC,GAAIjE,EAAc3kC,eAAe2oC,IAAeC,IAAQjE,EAAcgE,GAGpE,MAFA9F,EAAM,IAAIlnB,MAAM,cAAgBgtB,EAAa,uBACzC3R,KAAO,CAACoL,UAAWuG,GACjB9F,EAKV,IAAK,IAAI1kC,EAAI,EAAGA,EAAI0oC,EAAIjlC,OAAQzD,IAAK,CACnC,IAAIuG,EAAKmiC,EAAI1oC,GAGb,GAA6B,iBAAlBuG,EAAG+9B,WAEZ,IAAK,IAAIL,KAAa19B,EAAG+9B,WACnB/9B,EAAG+9B,WAAWziC,eAAeoiC,KAC/BsG,EAAetG,EAAW19B,EAAG+9B,WAAWL,IACxCuC,EAAcvC,GAAa19B,EAAG+9B,WAAWL,QAI1C,IAA4B,iBAAjB19B,EAAG09B,UAOjB,MAFAS,EAAM,IAAIx7B,UAAU,yCAA2ClJ,EAAI,MAC/D64B,KAAO,CAACrrB,MAAOxN,GACb0kC,EANN6F,EAAehkC,EAAG09B,UAAW19B,GAC7BigC,EAAcjgC,EAAG09B,WAAa19B,GASlC,OAAOigC,EAuET,OApEA9E,EAAQ6E,EAAoB,QAAS,CACnC,iBAAkBA,EAClB,OAAU,SAAUC,GAElB,IAAIkC,EAAM,GACV,IAAK,IAAIzE,KAAauC,EAChBA,EAAc3kC,eAAeoiC,IAC/ByE,EAAIrtB,KAAKmrB,EAAcvC,IAI3B,OAAOsC,EADI8D,EAAQ3B,GACclC,IAEnC,cAAe,SAAUkC,GACvB,OAAOnC,EAAoB8D,EAAQ3B,GAAM4B,EAAkB5B,KAE7D,sBAAuB,SAAUnoC,EAAMmoC,GACrC,OAAOnC,EAAoBhmC,EAAM+pC,EAAkB5B,QAIjDpnC,OAASA,EACfogC,EAAMC,MAAQL,EACdI,EAAME,YAAcH,EACpBC,EAAMG,OAASL,EACfE,EAAMkI,WAAaI,EACnBtI,EAAMgJ,mBAAqBV,EAC3BtI,EAAM+C,YAAcA,EACpB/C,EAAMsE,QAznCN,SAAkB/kC,EAAOyL,GACvB,IAAIyG,EAAOgvB,EAAalhC,GAGxB,GAAIyL,IAASyG,EACX,OAAOlS,EAGT,IAAK,IAAIjB,EAAI,EAAGA,EAAI0hC,EAAME,YAAYn+B,OAAQzD,IAAK,CACjD,IAAI+iC,EAAarB,EAAME,YAAY5hC,GACnC,GAAI+iC,EAAW5vB,OAASA,GAAQ4vB,EAAW3vB,KAAO1G,EAChD,OAAOq2B,EAAWiD,QAAQ/kC,GAI9B,MAAM,IAAIuc,MAAM,uBAAyBrK,EAAO,OAASzG,IA2mC3Dg1B,EAAM5vB,KAhqCN,SAAevL,EAAI09B,GACjB,IAAK19B,EAAG+9B,WACN,MAAM,IAAIp7B,UAAU,iCAItB,IAAImJ,EACJ,GAAyB,iBAAd4xB,EAAwB,CACjC5xB,EAAM4xB,EAAUnvB,MAAM,KACtB,IAAK,IAAI9U,EAAI,EAAGA,EAAIqS,EAAI5O,OAAQzD,IAC9BqS,EAAIrS,GAAKqS,EAAIrS,GAAG4T,WAGf,KAAI9D,MAAMP,QAAQ00B,GAIrB,MAAM,IAAI/6B,UAAU,qDAHpBmJ,EAAM4xB,EAMR,IAAI7jB,EAAM/N,EAAI7D,KAAK,KAGfmI,EAAQpQ,EAAG+9B,WAAWlkB,GAC1B,GAAIzJ,EACF,OAAOA,EAKT,MAAM,IAAIzN,UAAU,oCAAsC3C,EAAGhG,MAAQ,WAAa,IAAM8R,EAAI7D,KAAK,MAAQ,OA4oC3GkzB,EAAMiJ,QAAU,SAAUj+B,EAAMk+B,GAC9B,IAAKl+B,GAA6B,iBAAdA,EAAKnM,MAA0C,mBAAdmM,EAAKzC,KACxD,MAAM,IAAIf,UAAU,kEAGtB,IAAyB,IAArB0hC,EACF,IAAK,IAAI5qC,EAAI,EAAGA,EAAI0hC,EAAMC,MAAMl+B,OAAQzD,IACtC,GAA4B,WAAxB0hC,EAAMC,MAAM3hC,GAAGO,KAEjB,YADAmhC,EAAMC,MAAM5uB,OAAO/S,EAAG,EAAG0M,GAM/Bg1B,EAAMC,MAAMtmB,KAAK3O,IAInBg1B,EAAMmJ,cAAgB,SAAU9H,GAC9B,IAAKA,GAC6B,iBAApBA,EAAW5vB,MACO,iBAAlB4vB,EAAW3vB,IACY,mBAAvB2vB,EAAWiD,QACvB,MAAM,IAAI98B,UAAU,iFAGtBw4B,EAAME,YAAYvmB,KAAK0nB,IAGlBrB,EAGFpgC,KA92Ca,gC,gBCAtB,IAAIwpC,EAAO,EAAQ,KAKfC,EAAS,EAAQ,KAKjBC,EAAS,EAAQ,KAQjBC,EAAY,EAAQ,KASpBC,EAAU,EAAQ,KAOlBC,EAAS,EAAQ,KAIjBC,EAAK,EAAQ,KAEjBA,EAAGN,KAAOA,EACVM,EAAGL,OAASA,EACZK,EAAGJ,OAASA,EACZI,EAAGH,UAAYA,EACfG,EAAGF,QAAUA,EACbE,EAAGD,OAASA,EAEZ1rC,EAAOD,QAAU4rC,G,6BC1DjB,IAAIhvB,EAAwB,GAAG0gB,qBAE3B34B,EAA2BzD,OAAOyD,yBAGlCknC,EAAclnC,IAA6BiY,EAAsBjc,KAAK,CAAEmrC,EAAG,GAAK,GAIpF9rC,EAAQ4E,EAAIinC,EAAc,SAA8BhvB,GACtD,IAAIzX,EAAaT,EAAyBvE,KAAMyc,GAChD,QAASzX,GAAcA,EAAWhE,YAChCwb,G,gBCbJ,IAAI1Z,EAAS,EAAQ,GACjBvC,EAAO,EAAQ,IACfmH,EAAW,EAAQ,IACnBkM,EAAW,EAAQ,IACnBmN,EAAY,EAAQ,IACpB4qB,EAAsB,EAAQ,KAC9BljC,EAAkB,EAAQ,IAE1Ba,EAAYxG,EAAOwG,UACnByR,EAAetS,EAAgB,eAInC5I,EAAOD,QAAU,SAAU88B,EAAOkP,GAChC,IAAKlkC,EAASg1B,IAAU9oB,EAAS8oB,GAAQ,OAAOA,EAChD,IACIzxB,EADA4gC,EAAe9qB,EAAU2b,EAAO3hB,GAEpC,GAAI8wB,EAAc,CAGhB,QAFa/nC,IAAT8nC,IAAoBA,EAAO,WAC/B3gC,EAAS1K,EAAKsrC,EAAcnP,EAAOkP,IAC9BlkC,EAASuD,IAAW2I,EAAS3I,GAAS,OAAOA,EAClD,MAAM3B,EAAU,2CAGlB,YADaxF,IAAT8nC,IAAoBA,EAAO,UACxBD,EAAoBjP,EAAOkP,K,gBCvBpC,IAAIx8B,EAAgB,EAAQ,KAE5BvP,EAAOD,QAAUwP,IACXjO,OAAOmE,MACkB,iBAAnBnE,OAAO+B,U,gBCLnB,IAAI6K,EAAc,EAAQ,IACtBlI,EAAQ,EAAQ,GAChB+0B,EAAgB,EAAQ,IAG5B/6B,EAAOD,SAAWmO,IAAgBlI,GAAM,WAEtC,OAEQ,GAFD/E,OAAOC,eAAe65B,EAAc,OAAQ,IAAK,CACtD35B,IAAK,WAAc,OAAO,KACzBgV,M,gBCTL,IAAIlI,EAAc,EAAQ,IACtBlI,EAAQ,EAAQ,GAIpBhG,EAAOD,QAAUmO,GAAelI,GAAM,WAEpC,OAGgB,IAHT/E,OAAOC,gBAAe,cAA6B,YAAa,CACrEM,MAAO,GACP2Q,UAAU,IACThQ,c,gBCVL,IAAIkN,EAAS,EAAQ,IACjBoyB,EAAU,EAAQ,KAClBjnB,EAAiC,EAAQ,IACzCC,EAAuB,EAAQ,IAEnCza,EAAOD,QAAU,SAAU2D,EAAQsB,EAAQinC,GAIzC,IAHA,IAAI94B,EAAOsuB,EAAQz8B,GACf9D,EAAiBuZ,EAAqB9V,EACtCD,EAA2B8V,EAA+B7V,EACrDpE,EAAI,EAAGA,EAAI4S,EAAKnP,OAAQzD,IAAK,CACpC,IAAIuB,EAAMqR,EAAK5S,GACV8O,EAAO3L,EAAQ5B,IAAUmqC,GAAc58B,EAAO48B,EAAYnqC,IAC7DZ,EAAewC,EAAQ5B,EAAK4C,EAAyBM,EAAQlD,O,gBCZnE,IAAIuF,EAAa,EAAQ,IACrB3B,EAAc,EAAQ,GACtB2U,EAA4B,EAAQ,IACpCE,EAA8B,EAAQ,KACtC1U,EAAW,EAAQ,IAEnBsL,EAASzL,EAAY,GAAGyL,QAG5BnR,EAAOD,QAAUsH,EAAW,UAAW,YAAc,SAAiB1E,GACpE,IAAIwQ,EAAOkH,EAA0B1V,EAAEkB,EAASlD,IAC5C4a,EAAwBhD,EAA4B5V,EACxD,OAAO4Y,EAAwBpM,EAAOgC,EAAMoK,EAAsB5a,IAAOwQ,I,gBCZ3E,IAAIzN,EAAc,EAAQ,GACtB2J,EAAS,EAAQ,IACjBT,EAAkB,EAAQ,IAC1ByX,EAAU,EAAQ,KAA+BA,QACjDxL,EAAa,EAAQ,IAErBe,EAAOlW,EAAY,GAAGkW,MAE1B5b,EAAOD,QAAU,SAAUkC,EAAQ6a,GACjC,IAGIhb,EAHA6O,EAAI/B,EAAgB3M,GACpB1B,EAAI,EACJ6K,EAAS,GAEb,IAAKtJ,KAAO6O,GAAItB,EAAOwL,EAAY/Y,IAAQuN,EAAOsB,EAAG7O,IAAQ8Z,EAAKxQ,EAAQtJ,GAE1E,KAAOgb,EAAM9Y,OAASzD,GAAO8O,EAAOsB,EAAG7O,EAAMgb,EAAMvc,SAChD8lB,EAAQjb,EAAQtJ,IAAQ8Z,EAAKxQ,EAAQtJ,IAExC,OAAOsJ,I,cCjBTrL,EAAQ4E,EAAI1D,OAAOsc,uB,cCCnBvd,EAAOD,QAAU,CACfmsC,YAAa,EACbC,oBAAqB,EACrBC,aAAc,EACdC,eAAgB,EAChBC,YAAa,EACbC,cAAe,EACfC,aAAc,EACdC,qBAAsB,EACtBC,SAAU,EACVC,kBAAmB,EACnBC,eAAgB,EAChBC,gBAAiB,EACjBC,kBAAmB,EACnBC,UAAW,EACXC,cAAe,EACfC,aAAc,EACdC,SAAU,EACVC,iBAAkB,EAClBC,OAAQ,EACRC,YAAa,EACbC,cAAe,EACfC,cAAe,EACfC,eAAgB,EAChBC,aAAc,EACdC,cAAe,EACfC,iBAAkB,EAClBC,iBAAkB,EAClBC,eAAgB,EAChBC,iBAAkB,EAClBC,cAAe,EACfC,UAAW,I,gBChCb,IAEIC,EAFwB,EAAQ,GAEpBxY,CAAsB,QAAQwY,UAC1C9pC,EAAwB8pC,GAAaA,EAAU3qC,aAAe2qC,EAAU3qC,YAAYnB,UAExFnC,EAAOD,QAAUoE,IAA0BlD,OAAOkB,eAAY8B,EAAYE,G,gBCN1E,IAAIZ,EAAI,EAAQ,GACZyC,EAAQ,EAAQ,GAChB8K,EAAW,EAAQ,IACnBo9B,EAAuB,EAAQ,KAC/B1Q,EAA2B,EAAQ,KAMvCj6B,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAM3B,OAJRoC,GAAM,WAAckoC,EAAqB,MAIJzoC,MAAO+3B,GAA4B,CAChGC,eAAgB,SAAwB96B,GACtC,OAAOurC,EAAqBp9B,EAASnO,Q,gBCZzC,IAAIqD,EAAQ,EAAQ,GAEpBhG,EAAOD,SAAWiG,GAAM,WACtB,SAAS6wB,KAGT,OAFAA,EAAE10B,UAAUmB,YAAc,KAEnBrC,OAAOw8B,eAAe,IAAI5G,KAASA,EAAE10B,c,gBCN9C,IAAI+L,EAAc,EAAQ,IACtBjL,EAAS,EAAQ,GACjByC,EAAc,EAAQ,GACtBZ,EAAW,EAAQ,IACnBgP,EAAoB,EAAQ,KAC5BzP,EAA8B,EAAQ,IACtCnD,EAAiB,EAAQ,IAAuCyD,EAChEsP,EAAsB,EAAQ,IAA8CtP,EAC5EmB,EAAgB,EAAQ,IACxBkb,EAAW,EAAQ,KACnBve,EAAW,EAAQ,IACnBwD,EAAc,EAAQ,KACtBob,EAAgB,EAAQ,IACxB7e,EAAW,EAAQ,IACnBwD,EAAQ,EAAQ,GAChBqJ,EAAS,EAAQ,IACjBsK,EAAuB,EAAQ,IAA+BC,QAC9DlS,EAAa,EAAQ,KACrBkB,EAAkB,EAAQ,IAC1BszB,EAAsB,EAAQ,KAC9BC,EAAkB,EAAQ,KAE1BY,EAAQn0B,EAAgB,SACxBulC,EAAelrC,EAAOkD,OACtBD,EAAkBioC,EAAahsC,UAC/B+T,EAAcjT,EAAOiT,YACrB7P,EAAWX,EAAYO,GACvBU,EAAOjB,EAAYQ,EAAgBS,MACnCkY,EAASnZ,EAAY,GAAGmZ,QACxB9E,EAAUrU,EAAY,GAAGqU,SACzBkd,EAAgBvxB,EAAY,GAAG2gB,SAC/BjH,EAAc1Z,EAAY,GAAG6K,OAE7B69B,EAAS,2CACTrS,EAAM,KACNC,EAAM,KAGNqS,EAAc,IAAIF,EAAapS,KAASA,EAExCF,EAAgBxa,EAAcwa,cAC9Bva,EAAgBD,EAAcC,cAE9BgtB,EAAcpgC,KACdmgC,GAAexS,GAAiBK,GAAuBC,GAAmBn2B,GAAM,WAGhF,OAFAg2B,EAAIe,IAAS,EAENoR,EAAapS,IAAQA,GAAOoS,EAAanS,IAAQA,GAAiC,QAA1BmS,EAAapS,EAAK,SAyErF,GAAIj3B,EAAS,SAAUwpC,GAAc,CAoEnC,IAnEA,IAAIC,EAAgB,SAAgBC,EAASjoC,GAC3C,IAKIkoC,EAAUzQ,EAAQ5b,EAAQssB,EAAStjC,EAAQD,EAL3CwjC,EAAe7oC,EAAcI,EAAiB/F,MAC9CyuC,EAAkB5tB,EAASwtB,GAC3BK,OAA8B5qC,IAAVsC,EACpB2xB,EAAS,GACT4W,EAAaN,EAGjB,IAAKG,GAAgBC,GAAmBC,GAAqBL,EAAQlrC,cAAgBirC,EACnF,OAAOC,EA0CT,IAvCII,GAAmB9oC,EAAcI,EAAiBsoC,MACpDA,EAAUA,EAAQxpC,OACd6pC,IAAmBtoC,EAAQ,UAAWuoC,EAAaA,EAAWvoC,MAAQF,EAASyoC,KAGrFN,OAAsBvqC,IAAZuqC,EAAwB,GAAK/rC,EAAS+rC,GAChDjoC,OAAkBtC,IAAVsC,EAAsB,GAAK9D,EAAS8D,GAC5CuoC,EAAaN,EAETtS,GAAuB,WAAYH,IACrCiC,IAAWz3B,GAAS0wB,EAAc1wB,EAAO,MAAQ,KACrCA,EAAQwT,EAAQxT,EAAO,KAAM,KAG3CkoC,EAAWloC,EAEPs1B,GAAiB,WAAYE,IAC/B3Z,IAAW7b,GAAS0wB,EAAc1wB,EAAO,MAAQ,IACnC+a,IAAe/a,EAAQwT,EAAQxT,EAAO,KAAM,KAGxD41B,IAEFqS,GADAE,EAjFU,SAAUzxB,GAWxB,IAVA,IASIyB,EATA1a,EAASiZ,EAAOjZ,OAChB+J,EAAQ,EACR3C,EAAS,GACT2jC,EAAQ,GACRjyB,EAAQ,GACRkyB,GAAW,EACXC,GAAM,EACNC,EAAU,EACVC,EAAY,GAETphC,GAAS/J,EAAQ+J,IAAS,CAE/B,GAAY,QADZ2Q,EAAMG,EAAO5B,EAAQlP,IAEnB2Q,GAAYG,EAAO5B,IAAUlP,QACxB,GAAY,MAAR2Q,EACTswB,GAAW,OACN,IAAKA,EAAU,QAAQ,GAC5B,IAAa,MAARtwB,EACHswB,GAAW,EACX,MACF,IAAa,MAARtwB,EACC/X,EAAKynC,EAAQhvB,EAAYnC,EAAQlP,EAAQ,MAC3CA,GAAS,EACTkhC,GAAM,GAER7jC,GAAUsT,EACVwwB,IACA,SACF,IAAa,MAARxwB,GAAeuwB,EAClB,GAAkB,KAAdE,GAAoB9/B,EAAOyN,EAAOqyB,GACpC,MAAM,IAAIj5B,EAAY,8BAExB4G,EAAMqyB,IAAa,EACnBJ,EAAMA,EAAM/qC,QAAU,CAACmrC,EAAWD,GAClCD,GAAM,EACNE,EAAY,GACZ,SAEAF,EAAKE,GAAazwB,EACjBtT,GAAUsT,EACf,MAAO,CAACtT,EAAQ2jC,GAwCJK,CAAUZ,IACF,GAClBtW,EAASwW,EAAQ,IAGnBtjC,EAAS0I,EAAkBq6B,EAAaK,EAASjoC,GAAQooC,EAAexuC,KAAO+F,EAAiBqoC,IAE5FvQ,GAAU5b,GAAU8V,EAAOl0B,UAC7BmH,EAAQwO,EAAqBvO,GACzB4yB,IACF7yB,EAAM6yB,QAAS,EACf7yB,EAAMuxB,IAAM6R,EApHD,SAAUtxB,GAM3B,IALA,IAIIyB,EAJA1a,EAASiZ,EAAOjZ,OAChB+J,EAAQ,EACR3C,EAAS,GACT4jC,GAAW,EAERjhC,GAAS/J,EAAQ+J,IAEV,QADZ2Q,EAAMG,EAAO5B,EAAQlP,IAKhBihC,GAAoB,MAARtwB,GAGH,MAARA,EACFswB,GAAW,EACM,MAARtwB,IACTswB,GAAW,GACX5jC,GAAUsT,GANZtT,GAAU,WAJVA,GAAUsT,EAAMG,EAAO5B,IAAUlP,GAYnC,OAAO3C,EA+FuBikC,CAAab,GAAUC,IAE/CrsB,IAAQjX,EAAMiX,QAAS,GACvB8V,EAAOl0B,SAAQmH,EAAM+sB,OAASA,IAGhCsW,IAAYM,EAAY,IAE1BzqC,EAA4B+G,EAAQ,SAAyB,KAAf0jC,EAAoB,OAASA,GAC3E,MAAOtqC,IAET,OAAO4G,GAGLkkC,EAAQ,SAAUxtC,GACpBA,KAAOysC,GAAiBrtC,EAAeqtC,EAAezsC,EAAK,CACzD0M,cAAc,EACdpN,IAAK,WAAc,OAAO+sC,EAAarsC,IACvCsG,IAAK,SAAUzF,GAAMwrC,EAAarsC,GAAOa,MAIpCwQ,EAAOc,EAAoBk6B,GAAepgC,EAAQ,EAAGoF,EAAKnP,OAAS+J,GAC1EuhC,EAAMn8B,EAAKpF,MAGb7H,EAAgB5C,YAAcirC,EAC9BA,EAAcpsC,UAAY+D,EAC1B1D,EAASS,EAAQ,SAAUsrC,GAI7B7mC,EAAW,W,gBCtMX,IAAIG,EAAW,EAAQ,IACnB0R,EAAU,EAAQ,IAGlBwjB,EAFkB,EAAQ,GAElBn0B,CAAgB,SAI5B5I,EAAOD,QAAU,SAAU4C,GACzB,IAAIqe,EACJ,OAAOnZ,EAASlF,UAAmCsB,KAA1B+c,EAAWre,EAAGo6B,MAA0B/b,EAA0B,UAAfzH,EAAQ5W,M,gBCVtF,IAAIqD,EAAQ,EAAQ,GAIhB41B,EAHS,EAAQ,GAGAz1B,OAErBnG,EAAOD,QAAUiG,GAAM,WACrB,IAAI2R,EAAKikB,EAAQ,UAAW,KAC5B,MAAiC,MAA1BjkB,EAAGhR,KAAK,KAAKuxB,OAAO9hB,GACI,OAA7B,IAAI2D,QAAQpC,EAAI,a,gBCTpB,IAAI1U,EAAS,EAAQ,GACjBiL,EAAc,EAAQ,IACtBguB,EAAsB,EAAQ,KAC9B3iB,EAAU,EAAQ,IAClBrY,EAAiB,EAAQ,IAAuCyD,EAChEuE,EAAmB,EAAQ,IAA+B9H,IAE1D8E,EAAkBC,OAAOhE,UACzBsH,EAAYxG,EAAOwG,UAInByE,GAAeguB,GACjBh7B,EAAegF,EAAiB,SAAU,CACxCsI,cAAc,EACdpN,IAAK,WACH,GAAIjB,OAAS+F,EAAb,CAGA,GAAsB,WAAlBqT,EAAQpZ,MACV,QAAS+I,EAAiB/I,MAAM69B,OAElC,MAAMv0B,EAAU,+C,gBCtBtB,IAAIyE,EAAc,EAAQ,IACtB0D,EAA0B,EAAQ,KAClC6I,EAAuB,EAAQ,IAC/B5U,EAAW,EAAQ,IACnB+I,EAAkB,EAAQ,IAC1BwL,EAAa,EAAQ,KAKzBra,EAAQ4E,EAAIuJ,IAAgB0D,EAA0B3Q,OAAOqc,iBAAmB,SAA0B3M,EAAG6L,GAC3G3W,EAAS8K,GAMT,IALA,IAII7O,EAJAytC,EAAQ3gC,EAAgB4N,GACxBrJ,EAAOiH,EAAWoC,GAClBxY,EAASmP,EAAKnP,OACd+J,EAAQ,EAEL/J,EAAS+J,GAAO0M,EAAqB9V,EAAEgM,EAAG7O,EAAMqR,EAAKpF,KAAUwhC,EAAMztC,IAC5E,OAAO6O,I,gBClBT,IAAItJ,EAAa,EAAQ,IAEzBrH,EAAOD,QAAUsH,EAAW,WAAY,oB,gBCFxC,IAAIpE,EAAS,EAAQ,GACjBiL,EAAc,EAAQ,IACtB2tB,EAAgB,EAAQ,IAAsCA,cAC9DtiB,EAAU,EAAQ,IAClBrY,EAAiB,EAAQ,IAAuCyD,EAChEuE,EAAmB,EAAQ,IAA+B9H,IAE1D8E,EAAkBC,OAAOhE,UACzBsH,EAAYxG,EAAOwG,UAInByE,GAAe2tB,GACjB36B,EAAegF,EAAiB,SAAU,CACxCsI,cAAc,EACdpN,IAAK,WACH,GAAIjB,OAAS+F,EAAb,CAGA,GAAsB,WAAlBqT,EAAQpZ,MACV,QAAS+I,EAAiB/I,MAAMiiB,OAElC,MAAM3Y,EAAU,+C,gBCtBtB,IAAI5D,EAAW,EAAQ,IACnB2pC,EAAe,EAAQ,KAGvBxmC,EAFkB,EAAQ,GAEhBJ,CAAgB,WAI9B5I,EAAOD,QAAU,SAAU4Q,EAAG8+B,GAC5B,IACIhtB,EADApV,EAAIxH,EAAS8K,GAAGrN,YAEpB,YAAaW,IAANoJ,GAAiDpJ,OAA7Bwe,EAAI5c,EAASwH,GAAGrE,IAAyBymC,EAAqBD,EAAa/sB,K,gBCXxG,IAAI/c,EAAc,EAAQ,GACtB0N,EAAsB,EAAQ,IAC9B3Q,EAAW,EAAQ,IACnB+W,EAAyB,EAAQ,IAEjCqF,EAASnZ,EAAY,GAAGmZ,QACxBtK,EAAa7O,EAAY,GAAG6O,YAC5B6K,EAAc1Z,EAAY,GAAG6K,OAE7BipB,EAAe,SAAUkW,GAC3B,OAAO,SAAU1V,EAAO2V,GACtB,IAGIh7B,EAAOi7B,EAHPntB,EAAIhgB,EAAS+W,EAAuBwgB,IACpCjC,EAAW3kB,EAAoBu8B,GAC/BE,EAAOptB,EAAEze,OAEb,OAAI+zB,EAAW,GAAKA,GAAY8X,EAAaH,EAAoB,QAAKzrC,GACtE0Q,EAAQJ,EAAWkO,EAAGsV,IACP,OAAUpjB,EAAQ,OAAUojB,EAAW,IAAM8X,IACtDD,EAASr7B,EAAWkO,EAAGsV,EAAW,IAAM,OAAU6X,EAAS,MAC3DF,EACE7wB,EAAO4D,EAAGsV,GACVpjB,EACF+6B,EACEtwB,EAAYqD,EAAGsV,EAAUA,EAAW,GACV6X,EAAS,OAAlCj7B,EAAQ,OAAU,IAA0B,QAIzD3U,EAAOD,QAAU,CAGf+vC,OAAQtW,GAAa,GAGrB3a,OAAQ2a,GAAa,K,cC/BvBx5B,EAAOD,QAAU6C,KAAK6sB,MAAQ,SAAc/hB,GAE1C,OAAmB,IAAXA,GAAKA,IAAWA,GAAKA,EAAIA,EAAIA,EAAI,GAAK,EAAI,I,gBCLpD,IAAInK,EAAI,EAAQ,GAEZkT,EAAM7T,KAAK6T,IACXC,EAAM9T,KAAK8T,IAIfnT,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,GAAQ,CAChCqsB,KAAM,SAAclkB,GAClB,OAAO+I,EAAI/I,GAAKgJ,M,cCTpB,IAAID,EAAM7T,KAAK6T,IAKfzW,EAAOD,QAAU6C,KAAKmtC,OAAS,SAAeriC,GAC5C,OAAQA,GAAKA,IAAM,MAAQA,EAAI,KAAOA,EAAIA,EAAIA,EAAI,EAAI+I,EAAI,EAAI/I,K,gBCNhE,IAAIhI,EAAc,EAAQ,GAI1B1F,EAAOD,QAAU2F,EAAY,GAAImY,U,gBCJjC,IAAInY,EAAc,EAAQ,GACtB8T,EAAyB,EAAQ,IACjC/W,EAAW,EAAQ,IACnButC,EAAc,EAAQ,KAEtBj2B,EAAUrU,EAAY,GAAGqU,SACzBk2B,EAAa,IAAMD,EAAc,IACjCE,EAAQ/pC,OAAO,IAAM8pC,EAAaA,EAAa,KAC/CE,EAAQhqC,OAAO8pC,EAAaA,EAAa,MAGzCzW,EAAe,SAAU1Z,GAC3B,OAAO,SAAUka,GACf,IAAI/c,EAASxa,EAAS+W,EAAuBwgB,IAG7C,OAFW,EAAPla,IAAU7C,EAASlD,EAAQkD,EAAQizB,EAAO,KACnC,EAAPpwB,IAAU7C,EAASlD,EAAQkD,EAAQkzB,EAAO,KACvClzB,IAIXjd,EAAOD,QAAU,CAGfyQ,MAAOgpB,EAAa,GAGpB/oB,IAAK+oB,EAAa,GAGlBrlB,KAAMqlB,EAAa,K,cC5BrBx5B,EAAOD,QAAU,iD,6BCAjB,IAAIwD,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjByC,EAAc,EAAQ,GACtB0N,EAAsB,EAAQ,IAC9Bc,EAAkB,EAAQ,KAC1Bk8B,EAAU,EAAQ,KAClBpqC,EAAQ,EAAQ,GAEhBqqC,EAAaptC,EAAOotC,WACpB9lC,EAAStH,EAAOsH,OAChB6O,EAAQxW,KAAKwW,MACbk3B,EAAS5qC,EAAY0qC,GACrBhxB,EAAc1Z,EAAY,GAAG6K,OAC7BggC,EAAa7qC,EAAY,GAAIynB,SAE7B3V,EAAM,SAAU9J,EAAG1L,EAAGwuC,GACxB,OAAa,IAANxuC,EAAUwuC,EAAMxuC,EAAI,GAAM,EAAIwV,EAAI9J,EAAG1L,EAAI,EAAGwuC,EAAM9iC,GAAK8J,EAAI9J,EAAIA,EAAG1L,EAAI,EAAGwuC,IAgB9EC,EAAW,SAAUrX,EAAMp3B,EAAGpB,GAGhC,IAFA,IAAImN,GAAS,EACT2iC,EAAK9vC,IACAmN,EAAQ,GACf2iC,GAAM1uC,EAAIo3B,EAAKrrB,GACfqrB,EAAKrrB,GAAS2iC,EAAK,IACnBA,EAAKt3B,EAAMs3B,EAAK,MAIhBroB,EAAS,SAAU+Q,EAAMp3B,GAG3B,IAFA,IAAI+L,EAAQ,EACRnN,EAAI,IACCmN,GAAS,GAChBnN,GAAKw4B,EAAKrrB,GACVqrB,EAAKrrB,GAASqL,EAAMxY,EAAIoB,GACxBpB,EAAKA,EAAIoB,EAAK,KAId2uC,EAAe,SAAUvX,GAG3B,IAFA,IAAIrrB,EAAQ,EACRzL,EAAI,KACCyL,GAAS,GAChB,GAAU,KAANzL,GAAsB,IAAVyL,GAA+B,IAAhBqrB,EAAKrrB,GAAc,CAChD,IAAItM,EAAI8I,EAAO6uB,EAAKrrB,IACpBzL,EAAU,KAANA,EAAWb,EAAIa,EAAIguC,EAAO,IAAK,EAAI7uC,EAAEuC,QAAUvC,EAErD,OAAOa,GAeXiB,EAAE,CAAEG,OAAQ,SAAUC,OAAO,EAAMC,OAZtBoC,GAAM,WACjB,MAAkC,UAA3BuqC,EAAW,KAAS,IACF,MAAvBA,EAAW,GAAK,IACS,SAAzBA,EAAW,MAAO,IACuB,wBAAzCA,EAAW,kBAAuB,QAC/BvqC,GAAM,WAEXuqC,EAAW,QAKwC,CACnDpjB,QAAS,SAAiByjB,GACxB,IAKIhuB,EAAGhM,EAAGtB,EAAG1E,EALT4S,EAAStP,EAAgB/T,MACzB0wC,EAAcz9B,EAAoBw9B,GAClCxX,EAAO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GACvB3J,EAAO,GACPrkB,EAAS,IAIb,GAAIylC,EAAc,GAAKA,EAAc,GAAI,MAAMR,EAAW,6BAE1D,GAAI7sB,GAAUA,EAAQ,MAAO,MAC7B,GAAIA,IAAW,MAAQA,GAAU,KAAM,OAAOjZ,EAAOiZ,GAKrD,GAJIA,EAAS,IACXiM,EAAO,IACPjM,GAAUA,GAERA,EAAS,MAKX,GAHA5M,GADAgM,EA3EI,SAAUlV,GAGlB,IAFA,IAAI1L,EAAI,EACJ0oB,EAAKhd,EACFgd,GAAM,MACX1oB,GAAK,GACL0oB,GAAM,KAER,KAAOA,GAAM,GACX1oB,GAAK,EACL0oB,GAAM,EACN,OAAO1oB,EAiEDyU,CAAI+M,EAAShM,EAAI,EAAG,GAAI,IAAM,IAC1B,EAAIgM,EAAShM,EAAI,GAAIoL,EAAG,GAAKY,EAAShM,EAAI,EAAGoL,EAAG,GACxDhM,GAAK,kBACLgM,EAAI,GAAKA,GACD,EAAG,CAGT,IAFA6tB,EAASrX,EAAM,EAAGxiB,GAClBtB,EAAIu7B,EACGv7B,GAAK,GACVm7B,EAASrX,EAAM,IAAK,GACpB9jB,GAAK,EAIP,IAFAm7B,EAASrX,EAAM5hB,EAAI,GAAIlC,EAAG,GAAI,GAC9BA,EAAIsN,EAAI,EACDtN,GAAK,IACV+S,EAAO+Q,EAAM,GAAK,IAClB9jB,GAAK,GAEP+S,EAAO+Q,EAAM,GAAK9jB,GAClBm7B,EAASrX,EAAM,EAAG,GAClB/Q,EAAO+Q,EAAM,GACbhuB,EAASulC,EAAavX,QAEtBqX,EAASrX,EAAM,EAAGxiB,GAClB65B,EAASrX,EAAM,IAAMxW,EAAG,GACxBxX,EAASulC,EAAavX,GAAQkX,EAAO,IAAKO,GAU5C,OALAzlC,EAFEylC,EAAc,EAEPphB,IADT7e,EAAIxF,EAAOpH,SACW6sC,EAClB,KAAOP,EAAO,IAAKO,EAAcjgC,GAAKxF,EACtCgU,EAAYhU,EAAQ,EAAGwF,EAAIigC,GAAe,IAAMzxB,EAAYhU,EAAQwF,EAAIigC,IAEnEphB,EAAOrkB,M,6BC/HtB,IAAInI,EAAS,EAAQ,GACjBmQ,EAAsB,EAAQ,IAC9B3Q,EAAW,EAAQ,IACnB+W,EAAyB,EAAQ,IAEjC62B,EAAaptC,EAAOotC,WAIxBrwC,EAAOD,QAAU,SAAgB+wC,GAC/B,IAAInwB,EAAMle,EAAS+W,EAAuBrZ,OACtCiL,EAAS,GACTpJ,EAAIoR,EAAoB09B,GAC5B,GAAI9uC,EAAI,GAAKA,GAAKsW,IAAU,MAAM+3B,EAAW,+BAC7C,KAAMruC,EAAI,GAAIA,KAAO,KAAO2e,GAAOA,GAAc,EAAJ3e,IAAOoJ,GAAUuV,GAC9D,OAAOvV,I,6BCfT,IAaI8zB,EAAmB6R,EAAmCC,EAbtDhrC,EAAQ,EAAQ,GAChB4B,EAAa,EAAQ,IACrB/F,EAAS,EAAQ,IACjB47B,EAAiB,EAAQ,KACzBj7B,EAAW,EAAQ,IACnBoG,EAAkB,EAAQ,IAC1BxB,EAAU,EAAQ,IAElBoO,EAAW5M,EAAgB,YAC3Bu2B,GAAyB,EAOzB,GAAGhsB,OAGC,SAFN69B,EAAgB,GAAG79B,SAIjB49B,EAAoCtT,EAAeA,EAAeuT,OACxB/vC,OAAOkB,YAAW+8B,EAAoB6R,GAHlD5R,GAAyB,GAOTl7B,MAArBi7B,GAAkCl5B,GAAM,WACnE,IAAIwE,EAAO,GAEX,OAAO00B,EAAkB1pB,GAAU9U,KAAK8J,KAAUA,KAGxB00B,EAAoB,GACvC93B,IAAS83B,EAAoBr9B,EAAOq9B,IAIxCt3B,EAAWs3B,EAAkB1pB,KAChChT,EAAS08B,EAAmB1pB,GAAU,WACpC,OAAOrV,QAIXH,EAAOD,QAAU,CACfm/B,kBAAmBA,EACnBC,uBAAwBA,I,6BC7CT,EAAQ,IAKzB8R,CAAW,OAAO,SAAUC,GAC1B,OAAO,WAAiB,OAAOA,EAAK/wC,KAAM4D,UAAUC,OAASD,UAAU,QAAKE,MALvD,EAAQ,O,6BCD/B,IAAIV,EAAI,EAAQ,GACZN,EAAS,EAAQ,GACjByC,EAAc,EAAQ,GACtBZ,EAAW,EAAQ,IACnBtC,EAAW,EAAQ,IACnB2uC,EAAyB,EAAQ,KACjCnpC,EAAU,EAAQ,KAClBF,EAAa,EAAQ,KACrBF,EAAa,EAAQ,IACrBC,EAAW,EAAQ,IACnB7B,EAAQ,EAAQ,GAChBiC,EAA8B,EAAQ,KACtCR,EAAiB,EAAQ,IACzBqM,EAAoB,EAAQ,KAEhC9T,EAAOD,QAAU,SAAUk+B,EAAkBlxB,EAASqkC,GACpD,IAAI3X,GAA8C,IAArCwE,EAAiB5X,QAAQ,OAClCgrB,GAAgD,IAAtCpT,EAAiB5X,QAAQ,QACnCirB,EAAQ7X,EAAS,MAAQ,MACzB8X,EAAoBtuC,EAAOg7B,GAC3BuT,EAAkBD,GAAqBA,EAAkBpvC,UACzDuO,EAAc6gC,EACdE,EAAW,GAEXC,EAAY,SAAUxT,GACxB,IAAIS,EAAwBj5B,EAAY8rC,EAAgBtT,IACxD17B,EAASgvC,EAAiBtT,EACjB,OAAPA,EAAe,SAAa18B,GAE1B,OADAm9B,EAAsBx+B,KAAgB,IAAVqB,EAAc,EAAIA,GACvCrB,MACE,UAAP+9B,EAAkB,SAAUp8B,GAC9B,QAAOuvC,IAAYxpC,EAAS/F,KAAe68B,EAAsBx+B,KAAc,IAAR2B,EAAY,EAAIA,IAC9E,OAAPo8B,EAAe,SAAap8B,GAC9B,OAAOuvC,IAAYxpC,EAAS/F,QAAOmC,EAAY06B,EAAsBx+B,KAAc,IAAR2B,EAAY,EAAIA,IAClF,OAAPo8B,EAAe,SAAap8B,GAC9B,QAAOuvC,IAAYxpC,EAAS/F,KAAe68B,EAAsBx+B,KAAc,IAAR2B,EAAY,EAAIA,IACrF,SAAaA,EAAKN,GAEpB,OADAm9B,EAAsBx+B,KAAc,IAAR2B,EAAY,EAAIA,EAAKN,GAC1CrB,QAYb,GAPc2E,EACZm5B,GACCr2B,EAAW2pC,MAAwBF,GAAWG,EAAgBptC,UAAY4B,GAAM,YAC/E,IAAIurC,GAAoBrR,UAAU3f,YAMpC7P,EAAc0gC,EAAOO,eAAe5kC,EAASkxB,EAAkBxE,EAAQ6X,GACvEH,EAAuBS,cAClB,GAAI9sC,EAASm5B,GAAkB,GAAO,CAC3C,IAAI4T,EAAW,IAAInhC,EAEfohC,EAAiBD,EAASP,GAAOD,EAAU,IAAM,EAAG,IAAMQ,EAE1DE,EAAuB/rC,GAAM,WAAc6rC,EAASxyB,IAAI,MAGxD2yB,EAAmB/pC,GAA4B,SAAU6C,GAAY,IAAIymC,EAAkBzmC,MAE3FmnC,GAAcZ,GAAWrrC,GAAM,WAIjC,IAFA,IAAIksC,EAAY,IAAIX,EAChBxjC,EAAQ,EACLA,KAASmkC,EAAUZ,GAAOvjC,EAAOA,GACxC,OAAQmkC,EAAU7yB,KAAK,MAGpB2yB,KACHthC,EAAc3D,GAAQ,SAAUqI,EAAOtK,GACrChD,EAAWsN,EAAOo8B,GAClB,IAAIlkC,EAAOwG,EAAkB,IAAIy9B,EAAqBn8B,EAAO1E,GAE7D,OADgBzM,MAAZ6G,GAAuB9C,EAAQ8C,EAAUwC,EAAKgkC,GAAQ,CAAEhkC,KAAMA,EAAMuzB,WAAYpH,IAC7EnsB,MAEGnL,UAAYqvC,EACxBA,EAAgBluC,YAAcoN,IAG5BqhC,GAAwBE,KAC1BP,EAAU,UACVA,EAAU,OACVjY,GAAUiY,EAAU,SAGlBO,GAAcH,IAAgBJ,EAAUJ,GAGxCD,GAAWG,EAAgBW,cAAcX,EAAgBW,MAU/D,OAPAV,EAASxT,GAAoBvtB,EAC7BnN,EAAE,CAAEN,QAAQ,EAAMW,OAAQ8M,GAAe6gC,GAAqBE,GAE9DhqC,EAAeiJ,EAAautB,GAEvBoT,GAASD,EAAOgB,UAAU1hC,EAAautB,EAAkBxE,GAEvD/oB,I,gBCvGT,IAAInN,EAAI,EAAQ,GACZmC,EAAc,EAAQ,GACtBmV,EAAa,EAAQ,IACrBhT,EAAW,EAAQ,IACnBwH,EAAS,EAAQ,IACjBnO,EAAiB,EAAQ,IAAuCyD,EAChE0V,EAA4B,EAAQ,IACpCg4B,EAAoC,EAAQ,KAC5CC,EAAe,EAAQ,KACvBhjC,EAAM,EAAQ,IACdijC,EAAW,EAAQ,KAEnBC,GAAW,EACXC,EAAWnjC,EAAI,QACfurB,EAAK,EAEL6X,EAAc,SAAU/vC,GAC1BzB,EAAeyB,EAAI8vC,EAAU,CAAEjxC,MAAO,CACpCmxC,SAAU,IAAM9X,IAChB+X,SAAU,OA8DVC,EAAO7yC,EAAOD,QAAU,CAC1B6xC,OA3BW,WACXiB,EAAKjB,OAAS,aACdY,GAAW,EACX,IAAIv+B,EAAsBoG,EAA0B1V,EAChD2O,EAAS5N,EAAY,GAAG4N,QACxB9I,EAAO,GACXA,EAAKioC,GAAY,EAGbx+B,EAAoBzJ,GAAMxG,SAC5BqW,EAA0B1V,EAAI,SAAUhC,GAEtC,IADA,IAAIyI,EAAS6I,EAAoBtR,GACxBpC,EAAI,EAAGyD,EAASoH,EAAOpH,OAAQzD,EAAIyD,EAAQzD,IAClD,GAAI6K,EAAO7K,KAAOkyC,EAAU,CAC1Bn/B,EAAOlI,EAAQ7K,EAAG,GAClB,MAEF,OAAO6K,GAGX7H,EAAE,CAAEG,OAAQ,SAAU6B,MAAM,EAAM3B,QAAQ,GAAQ,CAChDqQ,oBAAqBo+B,EAAkC1tC,MAO3DmuC,QA5DY,SAAUnwC,EAAId,GAE1B,IAAKgG,EAASlF,GAAK,MAAoB,iBAANA,EAAiBA,GAAmB,iBAANA,EAAiB,IAAM,KAAOA,EAC7F,IAAK0M,EAAO1M,EAAI8vC,GAAW,CAEzB,IAAKH,EAAa3vC,GAAK,MAAO,IAE9B,IAAKd,EAAQ,MAAO,IAEpB6wC,EAAY/vC,GAEZ,OAAOA,EAAG8vC,GAAUE,UAkDtBI,YA/CgB,SAAUpwC,EAAId,GAC9B,IAAKwN,EAAO1M,EAAI8vC,GAAW,CAEzB,IAAKH,EAAa3vC,GAAK,OAAO,EAE9B,IAAKd,EAAQ,OAAO,EAEpB6wC,EAAY/vC,GAEZ,OAAOA,EAAG8vC,GAAUG,UAuCtBI,SAnCa,SAAUrwC,GAEvB,OADI4vC,GAAYC,GAAYF,EAAa3vC,KAAQ0M,EAAO1M,EAAI8vC,IAAWC,EAAY/vC,GAC5EA,IAoCTkY,EAAW43B,IAAY,G,gBCvFvB,IAAIl5B,EAAU,EAAQ,IAClB3K,EAAkB,EAAQ,IAC1BiO,EAAuB,EAAQ,IAA8ClY,EAC7E2P,EAAa,EAAQ,KAErB2+B,EAA+B,iBAAVlwC,QAAsBA,QAAU9B,OAAOgT,oBAC5DhT,OAAOgT,oBAAoBlR,QAAU,GAWzC/C,EAAOD,QAAQ4E,EAAI,SAA6BhC,GAC9C,OAAOswC,GAA8B,UAAf15B,EAAQ5W,GAVX,SAAUA,GAC7B,IACE,OAAOka,EAAqBla,GAC5B,MAAO6B,GACP,OAAO8P,EAAW2+B,IAOhBC,CAAevwC,GACfka,EAAqBjO,EAAgBjM,M,gBCrB3C,IAAIiG,EAAkB,EAAQ,IAC1BiK,EAAY,EAAQ,IAEpB2C,EAAW5M,EAAgB,YAC3Bk2B,EAAiBzuB,MAAMlO,UAG3BnC,EAAOD,QAAU,SAAU4C,GACzB,YAAcsB,IAAPtB,IAAqBkQ,EAAUxC,QAAU1N,GAAMm8B,EAAetpB,KAAc7S,K,gBCRrF,IAAIM,EAAS,EAAQ,GACjBvC,EAAO,EAAQ,IACfiH,EAAY,EAAQ,IACpB9B,EAAW,EAAQ,IACnBuvB,EAAc,EAAQ,IACtBiL,EAAoB,EAAQ,KAE5B52B,EAAYxG,EAAOwG,UAEvBzJ,EAAOD,QAAU,SAAUoP,EAAUgkC,GACnC,IAAIC,EAAiBrvC,UAAUC,OAAS,EAAIq8B,EAAkBlxB,GAAYgkC,EAC1E,GAAIxrC,EAAUyrC,GAAiB,OAAOvtC,EAASnF,EAAK0yC,EAAgBjkC,IACpE,MAAM1F,EAAU2rB,EAAYjmB,GAAY,sB,gBCZ1C,IAAIzO,EAAO,EAAQ,IACfmF,EAAW,EAAQ,IACnBqb,EAAY,EAAQ,IAExBlhB,EAAOD,QAAU,SAAUsD,EAAU2P,EAAMxR,GACzC,IAAI6xC,EAAaC,EACjBztC,EAASxC,GACT,IAEE,KADAgwC,EAAcnyB,EAAU7d,EAAU,WAChB,CAChB,GAAa,UAAT2P,EAAkB,MAAMxR,EAC5B,OAAOA,EAET6xC,EAAc3yC,EAAK2yC,EAAahwC,GAChC,MAAOmB,GACP8uC,GAAa,EACbD,EAAc7uC,EAEhB,GAAa,UAATwO,EAAkB,MAAMxR,EAC5B,GAAI8xC,EAAY,MAAMD,EAEtB,OADAxtC,EAASwtC,GACF7xC,I,6BCpBT,IAAIN,EAAiB,EAAQ,IAAuCyD,EAChE9C,EAAS,EAAQ,IACjB0F,EAAc,EAAQ,KACtBxF,EAAO,EAAQ,IACf+F,EAAa,EAAQ,KACrBE,EAAU,EAAQ,KAClB8K,EAAiB,EAAQ,KACzBpL,EAAa,EAAQ,KACrBwG,EAAc,EAAQ,IACtB4kC,EAAU,EAAQ,KAAkCA,QACpDnqC,EAAsB,EAAQ,IAE9BS,EAAmBT,EAAoBP,IACvCmrC,EAAyB5qC,EAAoBQ,UAEjDnJ,EAAOD,QAAU,CACf4xC,eAAgB,SAAU5kC,EAASkxB,EAAkBxE,EAAQ6X,GAC3D,IAAI5gC,EAAc3D,GAAQ,SAAUO,EAAMxC,GACxChD,EAAWwF,EAAM6zB,GACjB/3B,EAAiBkE,EAAM,CACrBL,KAAMgxB,EACNlwB,MAAOlM,EAAO,MACd8S,WAAO1Q,EACP4/B,UAAM5/B,EACN4rC,KAAM,IAEH3hC,IAAaZ,EAAKuiC,KAAO,GACd5rC,MAAZ6G,GAAuB9C,EAAQ8C,EAAUwC,EAAKgkC,GAAQ,CAAEhkC,KAAMA,EAAMuzB,WAAYpH,OAGlF0H,EAAYzwB,EAAYvO,UAExB+G,EAAmBqqC,EAAuBtV,GAE1Ch+B,EAAS,SAAUqN,EAAMxL,EAAKN,GAChC,IAEIgyC,EAAUzlC,EAFV5C,EAAQjC,EAAiBoE,GACzBi1B,EAAQkR,EAASnmC,EAAMxL,GAqBzB,OAlBEygC,EACFA,EAAM/gC,MAAQA,GAGd2J,EAAM04B,KAAOtB,EAAQ,CACnBx0B,MAAOA,EAAQ+kC,EAAQhxC,GAAK,GAC5BA,IAAKA,EACLN,MAAOA,EACPgyC,SAAUA,EAAWroC,EAAM04B,KAC3BtjB,UAAMtc,EACNyvC,SAAS,GAENvoC,EAAMwJ,QAAOxJ,EAAMwJ,MAAQ4tB,GAC5BiR,IAAUA,EAASjzB,KAAOgiB,GAC1Br0B,EAAa/C,EAAM0kC,OAClBviC,EAAKuiC,OAEI,MAAV9hC,IAAe5C,EAAM4C,MAAMA,GAASw0B,IACjCj1B,GAGPmmC,EAAW,SAAUnmC,EAAMxL,GAC7B,IAGIygC,EAHAp3B,EAAQjC,EAAiBoE,GAEzBS,EAAQ+kC,EAAQhxC,GAEpB,GAAc,MAAViM,EAAe,OAAO5C,EAAM4C,MAAMA,GAEtC,IAAKw0B,EAAQp3B,EAAMwJ,MAAO4tB,EAAOA,EAAQA,EAAMhiB,KAC7C,GAAIgiB,EAAMzgC,KAAOA,EAAK,OAAOygC,GAwFjC,OApFAh7B,EAAY45B,EAAW,CAIrBgR,MAAO,WAKL,IAJA,IACIhnC,EAAQjC,EADD/I,MAEPi5B,EAAOjuB,EAAM4C,MACbw0B,EAAQp3B,EAAMwJ,MACX4tB,GACLA,EAAMmR,SAAU,EACZnR,EAAMiR,WAAUjR,EAAMiR,SAAWjR,EAAMiR,SAASjzB,UAAOtc,UACpDm1B,EAAKmJ,EAAMx0B,OAClBw0B,EAAQA,EAAMhiB,KAEhBpV,EAAMwJ,MAAQxJ,EAAM04B,UAAO5/B,EACvBiK,EAAa/C,EAAM0kC,KAAO,EAXnB1vC,KAYD0vC,KAAO,GAKnB,OAAU,SAAU/tC,GAClB,IACIqJ,EAAQjC,EADD/I,MAEPoiC,EAAQkR,EAFDtzC,KAEgB2B,GAC3B,GAAIygC,EAAO,CACT,IAAIhiB,EAAOgiB,EAAMhiB,KACbD,EAAOiiB,EAAMiR,gBACVroC,EAAM4C,MAAMw0B,EAAMx0B,OACzBw0B,EAAMmR,SAAU,EACZpzB,IAAMA,EAAKC,KAAOA,GAClBA,IAAMA,EAAKizB,SAAWlzB,GACtBnV,EAAMwJ,OAAS4tB,IAAOp3B,EAAMwJ,MAAQ4L,GACpCpV,EAAM04B,MAAQtB,IAAOp3B,EAAM04B,KAAOvjB,GAClCpS,EAAa/C,EAAM0kC,OAZd1vC,KAaC0vC,OACV,QAAStN,GAKbn+B,QAAS,SAAiBN,GAIxB,IAHA,IAEIy+B,EAFAp3B,EAAQjC,EAAiB/I,MACzB+5B,EAAgBn4B,EAAK+B,EAAYC,UAAUC,OAAS,EAAID,UAAU,QAAKE,GAEpEs+B,EAAQA,EAAQA,EAAMhiB,KAAOpV,EAAMwJ,OAGxC,IAFAulB,EAAcqI,EAAM/gC,MAAO+gC,EAAMzgC,IAAK3B,MAE/BoiC,GAASA,EAAMmR,SAASnR,EAAQA,EAAMiR,UAMjDn0B,IAAK,SAAavd,GAChB,QAAS2xC,EAAStzC,KAAM2B,MAI5ByF,EAAY45B,EAAW1H,EAAS,CAG9Br4B,IAAK,SAAaU,GAChB,IAAIygC,EAAQkR,EAAStzC,KAAM2B,GAC3B,OAAOygC,GAASA,EAAM/gC,OAIxB4G,IAAK,SAAatG,EAAKN,GACrB,OAAOvB,EAAOE,KAAc,IAAR2B,EAAY,EAAIA,EAAKN,KAEzC,CAGF4L,IAAK,SAAa5L,GAChB,OAAOvB,EAAOE,KAAMqB,EAAkB,IAAVA,EAAc,EAAIA,EAAOA,MAGrD0M,GAAahN,EAAeigC,EAAW,OAAQ,CACjD//B,IAAK,WACH,OAAO8H,EAAiB/I,MAAM0vC,QAG3Bn/B,GAET0hC,UAAW,SAAU1hC,EAAautB,EAAkBxE,GAClD,IAAIka,EAAgB1V,EAAmB,YACnC2V,EAA6BL,EAAuBtV,GACpD4V,EAA2BN,EAAuBI,GAUtD7gC,EAAepC,EAAautB,GAAkB,SAAUlrB,EAAUC,GAChE5J,EAAiBjJ,KAAM,CACrB8M,KAAM0mC,EACNjwC,OAAQqP,EACR5H,MAAOyoC,EAA2B7gC,GAClCC,KAAMA,EACN6wB,UAAM5/B,OAEP,WAKD,IAJA,IAAIkH,EAAQ0oC,EAAyB1zC,MACjC6S,EAAO7H,EAAM6H,KACbuvB,EAAQp3B,EAAM04B,KAEXtB,GAASA,EAAMmR,SAASnR,EAAQA,EAAMiR,SAE7C,OAAKroC,EAAMzH,SAAYyH,EAAM04B,KAAOtB,EAAQA,EAAQA,EAAMhiB,KAAOpV,EAAMA,MAAMwJ,OAMjE,QAAR3B,EAAuB,CAAExR,MAAO+gC,EAAMzgC,IAAK+K,MAAM,GACzC,UAARmG,EAAyB,CAAExR,MAAO+gC,EAAM/gC,MAAOqL,MAAM,GAClD,CAAErL,MAAO,CAAC+gC,EAAMzgC,IAAKygC,EAAM/gC,OAAQqL,MAAM,IAN9C1B,EAAMzH,YAASO,EACR,CAAEzC,WAAOyC,EAAW4I,MAAM,MAMlC4sB,EAAS,UAAY,UAAWA,GAAQ,GAK3C/xB,EAAWu2B,M,gBCzMf,IAAIz7B,EAAW,EAAQ,IAEvBxC,EAAOD,QAAU,SAAU2D,EAAQgzB,EAAK3xB,GACtC,IAAK,IAAIjD,KAAO40B,EAAKl0B,EAASkB,EAAQ5B,EAAK40B,EAAI50B,GAAMiD,GACrD,OAAOrB,I,gBCJT,IAAIkF,EAAkB,EAAQ,IAE9B7I,EAAQ4E,EAAIiE,G,gBCFZ,IAAIkrC,EAAO,EAAQ,KACfzkC,EAAS,EAAQ,IACjByL,EAA+B,EAAQ,KACvC5Z,EAAiB,EAAQ,IAAuCyD,EAEpE3E,EAAOD,QAAU,SAAUu/B,GACzB,IAAIh+B,EAASwyC,EAAKxyC,SAAWwyC,EAAKxyC,OAAS,IACtC+N,EAAO/N,EAAQg+B,IAAOp+B,EAAeI,EAAQg+B,EAAM,CACtD99B,MAAOsZ,EAA6BnW,EAAE26B,O,gBCR1C,IAuBIyU,EAAUC,EAAOC,EAASC,EAvB1BjxC,EAAS,EAAQ,GACjB8D,EAAQ,EAAQ,IAChBhF,EAAO,EAAQ,IACf6F,EAAa,EAAQ,IACrByH,EAAS,EAAQ,IACjBrJ,EAAQ,EAAQ,GAChBwvB,EAAO,EAAQ,KACflhB,EAAa,EAAQ,KACrBymB,EAAgB,EAAQ,IACxBoZ,EAA0B,EAAQ,KAClCC,EAAS,EAAQ,KACjBtrC,EAAU,EAAQ,KAElBV,EAAMnF,EAAOoxC,aACblC,EAAQlvC,EAAOqxC,eACf3qC,EAAU1G,EAAO0G,QACjB4qC,EAAWtxC,EAAOsxC,SAClBrxC,EAAWD,EAAOC,SAClBsxC,EAAiBvxC,EAAOuxC,eACxBjqC,EAAStH,EAAOsH,OAChBsD,EAAU,EACV4mC,EAAQ,GAIZ,IAEEV,EAAW9wC,EAAO8wC,SAClB,MAAOvvC,IAET,IAAIkwC,EAAM,SAAU7Z,GAClB,GAAIxrB,EAAOolC,EAAO5Z,GAAK,CACrB,IAAI/zB,EAAK2tC,EAAM5Z,UACR4Z,EAAM5Z,GACb/zB,MAIA6tC,EAAS,SAAU9Z,GACrB,OAAO,WACL6Z,EAAI7Z,KAIJ+Z,EAAW,SAAUvoC,GACvBqoC,EAAIroC,EAAM+sB,OAGRyb,EAAO,SAAUha,GAEnB53B,EAAO6xC,YAAYvqC,EAAOswB,GAAKkZ,EAASgB,SAAW,KAAOhB,EAASiB,OAIhE5sC,GAAQ+pC,IACX/pC,EAAM,SAAsBmD,GAC1B4oC,EAAwBpwC,UAAUC,OAAQ,GAC1C,IAAI8C,EAAKc,EAAW2D,GAAWA,EAAUrI,EAASqI,GAC9CoS,EAAOrJ,EAAWvQ,UAAW,GAKjC,OAJA0wC,IAAQ5mC,GAAW,WACjB9G,EAAMD,OAAI7C,EAAW0Z,IAEvBq2B,EAAMnmC,GACCA,GAETskC,EAAQ,SAAwBtX,UACvB4Z,EAAM5Z,IAGX/xB,EACFkrC,EAAQ,SAAUnZ,GAChBlxB,EAAQsrC,SAASN,EAAO9Z,KAGjB0Z,GAAYA,EAASW,IAC9BlB,EAAQ,SAAUnZ,GAChB0Z,EAASW,IAAIP,EAAO9Z,KAIb2Z,IAAmBJ,GAE5BF,GADAD,EAAU,IAAIO,GACCW,MACflB,EAAQmB,MAAMC,UAAYT,EAC1BZ,EAAQjyC,EAAKmyC,EAAKY,YAAaZ,IAI/BjxC,EAAOqyC,kBACP1tC,EAAW3E,EAAO6xC,eACjB7xC,EAAOsyC,eACRxB,GAAkC,UAAtBA,EAASgB,WACpB/uC,EAAM6uC,IAEPb,EAAQa,EACR5xC,EAAOqyC,iBAAiB,UAAWV,GAAU,IAG7CZ,EA5EqB,uBA2EUjZ,EAAc,UACrC,SAAUF,GAChBrF,EAAKiB,YAAYsE,EAAc,WAA6B,mBAAI,WAC9DvF,EAAKggB,YAAYr1C,MACjBu0C,EAAI7Z,KAKA,SAAUA,GAChB4a,WAAWd,EAAO9Z,GAAK,KAK7B76B,EAAOD,QAAU,CACfqI,IAAKA,EACL+pC,MAAOA,I,gBClHT,IAAIvZ,EAAY,EAAQ,IAExB54B,EAAOD,QAAU,qCAAqCyK,KAAKouB,I,6BCD3D,IAAIjxB,EAAY,EAAQ,IAEpB+tC,EAAoB,SAAUroC,GAChC,IAAI3C,EAASe,EACbtL,KAAKsK,QAAU,IAAI4C,GAAE,SAAUsoC,EAAWC,GACxC,QAAgB3xC,IAAZyG,QAAoCzG,IAAXwH,EAAsB,MAAMhC,UAAU,2BACnEiB,EAAUirC,EACVlqC,EAASmqC,KAEXz1C,KAAKuK,QAAU/C,EAAU+C,GACzBvK,KAAKsL,OAAS9D,EAAU8D,IAK1BzL,EAAOD,QAAQ4E,EAAI,SAAU0I,GAC3B,OAAO,IAAIqoC,EAAkBroC,K,gBCjBvB,EAAQ,EAIhB9J,CAAE,CAAEG,OAAQ,SAAU6B,MAAM,GAAQ,CAClC8R,MAAO,SAAemM,GAEpB,OAAOA,GAAUA,M,gBCPrB,IAAIqyB,EAAmB,EAAQ,KAW/B71C,EAAOD,QATP,SAAqCiB,EAAG80C,GACtC,GAAK90C,EAAL,CACA,GAAiB,iBAANA,EAAgB,OAAO60C,EAAiB70C,EAAG80C,GACtD,IAAI9zC,EAAIf,OAAOkB,UAAUM,SAAS/B,KAAKM,GAAGuP,MAAM,GAAI,GAEpD,MADU,WAANvO,GAAkBhB,EAAEsC,cAAatB,EAAIhB,EAAEsC,YAAYxC,MAC7C,QAANkB,GAAqB,QAANA,EAAoBqO,MAAMqD,KAAK1S,GACxC,cAANgB,GAAqB,2CAA2CwI,KAAKxI,GAAW6zC,EAAiB70C,EAAG80C,QAAxG,IAG4C91C,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,cCDnHC,EAAOD,QAVP,SAA2B6S,EAAKpB,IACnB,MAAPA,GAAeA,EAAMoB,EAAI5O,UAAQwN,EAAMoB,EAAI5O,QAE/C,IAAK,IAAIzD,EAAI,EAAGw1C,EAAO,IAAI1lC,MAAMmB,GAAMjR,EAAIiR,EAAKjR,IAC9Cw1C,EAAKx1C,GAAKqS,EAAIrS,GAGhB,OAAOw1C,GAG2B/1C,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,6BCTxF,EAAQ,IAKzBkxC,CAAW,OAAO,SAAUC,GAC1B,OAAO,WAAiB,OAAOA,EAAK/wC,KAAM4D,UAAUC,OAASD,UAAU,QAAKE,MALvD,EAAQ,O,cCF/B,SAASwN,KAKTA,EAAEtP,UAAY,CACZ6zC,GAAI,SAAUl1C,EAAM6pC,EAAUsL,GAC5B,IAAIrzB,EAAIziB,KAAKyiB,IAAMziB,KAAKyiB,EAAI,IAO5B,OALCA,EAAE9hB,KAAU8hB,EAAE9hB,GAAQ,KAAK8a,KAAK,CAC/B9U,GAAI6jC,EACJsL,IAAKA,IAGA91C,MAGT+1C,KAAM,SAAUp1C,EAAM6pC,EAAUsL,GAC9B,IAAIjzC,EAAO7C,KACX,SAASy0C,IACP5xC,EAAKmzC,IAAIr1C,EAAM8zC,GACfjK,EAAS5jC,MAAMkvC,EAAKlyC,WAItB,OADA6wC,EAASxd,EAAIuT,EACNxqC,KAAK61C,GAAGl1C,EAAM8zC,EAAUqB,IAGjCxpC,KAAM,SAAU3L,GAMd,IALA,IAAIs4B,EAAO,GAAG7oB,MAAM7P,KAAKqD,UAAW,GAChCqyC,IAAWj2C,KAAKyiB,IAAMziB,KAAKyiB,EAAI,KAAK9hB,IAAS,IAAIyP,QACjDhQ,EAAI,EACJiR,EAAM4kC,EAAOpyC,OAETzD,EAAIiR,EAAKjR,IACf61C,EAAO71C,GAAGuG,GAAGC,MAAMqvC,EAAO71C,GAAG01C,IAAK7c,GAGpC,OAAOj5B,MAGTg2C,IAAK,SAAUr1C,EAAM6pC,GACnB,IAAI/nB,EAAIziB,KAAKyiB,IAAMziB,KAAKyiB,EAAI,IACxByzB,EAAOzzB,EAAE9hB,GACTw1C,EAAa,GAEjB,GAAID,GAAQ1L,EACV,IAAK,IAAIpqC,EAAI,EAAGiR,EAAM6kC,EAAKryC,OAAQzD,EAAIiR,EAAKjR,IACtC81C,EAAK91C,GAAGuG,KAAO6jC,GAAY0L,EAAK91C,GAAGuG,GAAGswB,IAAMuT,GAC9C2L,EAAW16B,KAAKy6B,EAAK91C,IAY3B,OAJC+1C,EAAiB,OACd1zB,EAAE9hB,GAAQw1C,SACH1zB,EAAE9hB,GAENX,OAIXH,EAAOD,QAAU0R,EACjBzR,EAAOD,QAAQw2C,YAAc9kC,G,cC5D7BzR,EAAOD,QANP,SAAyB8xC,EAAUnhC,GACjC,KAAMmhC,aAAoBnhC,GACxB,MAAM,IAAIjH,UAAU,sCAIUzJ,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,cCNvG,SAASy2C,EAAkB9yC,EAAQ6rC,GACjC,IAAK,IAAIhvC,EAAI,EAAGA,EAAIgvC,EAAMvrC,OAAQzD,IAAK,CACrC,IAAI4E,EAAaoqC,EAAMhvC,GACvB4E,EAAWhE,WAAagE,EAAWhE,aAAc,EACjDgE,EAAWqJ,cAAe,EACtB,UAAWrJ,IAAYA,EAAWgN,UAAW,GACjDlR,OAAOC,eAAewC,EAAQyB,EAAWrD,IAAKqD,IAalDnF,EAAOD,QATP,SAAsB2Q,EAAa+lC,EAAYC,GAM7C,OALID,GAAYD,EAAkB9lC,EAAYvO,UAAWs0C,GACrDC,GAAaF,EAAkB9lC,EAAagmC,GAChDz1C,OAAOC,eAAewP,EAAa,YAAa,CAC9CyB,UAAU,IAELzB,GAGsB1Q,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,6BCdpG,IAAI6V,EAAW3U,OAAO4U,QAAU,SAAUnS,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwD,UAAUC,OAAQzD,IAAK,CAAE,IAAIyE,EAASjB,UAAUxD,GAAI,IAAK,IAAIuB,KAAOkD,EAAc/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAQlD,KAAQ4B,EAAO5B,GAAOkD,EAAOlD,IAAY,OAAO4B,GAEnPizC,EAAiB,CACnB,IAAK,MACL,IAAK,MACL,KAAM,oBACN,IAAK,MACLpzC,EAAG,MACH,IAAK,MACL,IAAK,MACL,IAAK,sBACL6zB,EAAG,MACH,IAAK,sBAEHwf,EAAgB,CAClB,IAAU,OACV,IAAU,QACV,IAAK,IACL,KAAM,YACN,OAAQ,cACR,KAAM,eAGJC,EAAqB,SAA4BF,EAAgBC,GACnE,OAAOhhC,EAAS,GAAI+gC,EAAgBC,IAWtC52C,EAAOD,QAAU,SAAU4gB,GAmCzB,IAlCA,IAAIm2B,EAAO/yC,UAAUC,OAAS,QAAsBC,IAAjBF,UAAU,GAAmBA,UAAU,GAAK,GAC3EgzC,EAAwBD,EAAKE,mBAC7BA,OAA+C/yC,IAA1B8yC,GAA8CA,EACnEE,EAAmBH,EAAKI,YACxBA,OAAmCjzC,IAArBgzC,EAAiCJ,EAAqBI,EAEpEE,EAAa5sC,OAAOoW,GACpBvV,EAAS,GAETgsC,EAAUF,EAAYthC,EAAS,GAAI+gC,GAAiBK,EAAqBphC,EAAS,GAAIghC,GAAiB,IACvGS,EAAap2C,OAAOkS,KAAKikC,GAMzBE,EAAQ,WACV,IAAIC,GAAmB,EACvBF,EAAWjzC,SAAQ,SAAUtC,EAAKiM,GAC5BwpC,GAGAJ,EAAWnzC,QAAUlC,EAAIkC,QAAUmzC,EAAW5mC,MAAM,EAAGzO,EAAIkC,UAAYlC,IACzEsJ,GAAUgsC,EAAQC,EAAWtpC,IAC7BopC,EAAaA,EAAW5mC,MAAMzO,EAAIkC,OAAQmzC,EAAWnzC,QACrDuzC,GAAmB,MAGlBA,IACHnsC,GAAU+rC,EAAW5mC,MAAM,EAAG,GAC9B4mC,EAAaA,EAAW5mC,MAAM,EAAG4mC,EAAWnzC,UAIzCmzC,GACLG,IAEF,OAAOlsC,I,cC9ET,IAAIosC,EAGJA,EAAI,WACH,OAAOr3C,KADJ,GAIJ,IAECq3C,EAAIA,GAAK,IAAIt0C,SAAS,cAAb,GACR,MAAO0f,GAEc,iBAAX7f,SAAqBy0C,EAAIz0C,QAOrC/C,EAAOD,QAAUy3C,G,gBCnBjB,IAAIv0C,EAAS,EAAQ,GACjBvC,EAAO,EAAQ,IACfkH,EAAa,EAAQ,IACrBC,EAAW,EAAQ,IAEnB4B,EAAYxG,EAAOwG,UAIvBzJ,EAAOD,QAAU,SAAU88B,EAAOkP,GAChC,IAAIjlC,EAAI2wC,EACR,GAAa,WAAT1L,GAAqBnkC,EAAWd,EAAK+1B,EAAMp6B,YAAcoF,EAAS4vC,EAAM/2C,EAAKoG,EAAI+1B,IAAS,OAAO4a,EACrG,GAAI7vC,EAAWd,EAAK+1B,EAAMhf,WAAahW,EAAS4vC,EAAM/2C,EAAKoG,EAAI+1B,IAAS,OAAO4a,EAC/E,GAAa,WAAT1L,GAAqBnkC,EAAWd,EAAK+1B,EAAMp6B,YAAcoF,EAAS4vC,EAAM/2C,EAAKoG,EAAI+1B,IAAS,OAAO4a,EACrG,MAAMhuC,EAAU,6C,gBCdlB,IAAIxG,EAAS,EAAQ,GACjB2E,EAAa,EAAQ,IACrBG,EAAgB,EAAQ,IAExBwX,EAAUtc,EAAOsc,QAErBvf,EAAOD,QAAU6H,EAAW2X,IAAY,cAAc/U,KAAKzC,EAAcwX,K,gBCNzE,IAAI3Q,EAAkB,EAAQ,IAC1BoB,EAAkB,EAAQ,IAC1BC,EAAoB,EAAQ,IAG5BupB,EAAe,SAAUke,GAC3B,OAAO,SAAU1d,EAAO2d,EAAIC,GAC1B,IAGIp2C,EAHAmP,EAAI/B,EAAgBorB,GACpBh2B,EAASiM,EAAkBU,GAC3B5C,EAAQiC,EAAgB4nC,EAAW5zC,GAIvC,GAAI0zC,GAAeC,GAAMA,GAAI,KAAO3zC,EAAS+J,GAG3C,IAFAvM,EAAQmP,EAAE5C,OAEGvM,EAAO,OAAO,OAEtB,KAAMwC,EAAS+J,EAAOA,IAC3B,IAAK2pC,GAAe3pC,KAAS4C,IAAMA,EAAE5C,KAAW4pC,EAAI,OAAOD,GAAe3pC,GAAS,EACnF,OAAQ2pC,IAAgB,IAI9B13C,EAAOD,QAAU,CAGf83C,SAAUre,GAAa,GAGvBnT,QAASmT,GAAa,K,6BC7BxB,IAAIj3B,EAAwB,EAAQ,KAChCgX,EAAU,EAAQ,IAItBvZ,EAAOD,QAAUwC,EAAwB,GAAGE,SAAW,WACrD,MAAO,WAAa8W,EAAQpZ,MAAQ,M,6BCNtC,IAAI6a,EAAW,EAAQ,IAAgC5W,QAGnD6K,EAFsB,EAAQ,IAEdJ,CAAoB,WAIxC7O,EAAOD,QAAWkP,EAGd,GAAG7K,QAH2B,SAAiBN,GACjD,OAAOkX,EAAS7a,KAAM2D,EAAYC,UAAUC,OAAS,EAAID,UAAU,QAAKE,K,gBCT1E,IAAIhB,EAAS,EAAQ,GACjB6M,EAAU,EAAQ,IAClBC,EAAgB,EAAQ,IACxBlI,EAAW,EAAQ,IAGnBmB,EAFkB,EAAQ,GAEhBJ,CAAgB,WAC1ByH,EAAQpN,EAAOoN,MAInBrQ,EAAOD,QAAU,SAAUw9B,GACzB,IAAIlwB,EASF,OAREyC,EAAQytB,KACVlwB,EAAIkwB,EAAcj6B,aAEdyM,EAAc1C,KAAOA,IAAMgD,GAASP,EAAQzC,EAAElL,aACzC0F,EAASwF,IAEN,QADVA,EAAIA,EAAErE,OAFuDqE,OAAIpJ,SAKtDA,IAANoJ,EAAkBgD,EAAQhD,I,gBCrBrC,IAAIpK,EAAS,EAAQ,GACjB2E,EAAa,EAAQ,IAErB2C,EAAStH,EAAOsH,OAChBd,EAAYxG,EAAOwG,UAEvBzJ,EAAOD,QAAU,SAAUoP,GACzB,GAAuB,iBAAZA,GAAwBvH,EAAWuH,GAAW,OAAOA,EAChE,MAAM1F,EAAU,aAAec,EAAO4E,GAAY,qB,gBCRpD,IAAIlM,EAAS,EAAQ,GACjB8M,EAAgB,EAAQ,IACxBqlB,EAAc,EAAQ,IAEtB3rB,EAAYxG,EAAOwG,UAGvBzJ,EAAOD,QAAU,SAAUoP,GACzB,GAAIY,EAAcZ,GAAW,OAAOA,EACpC,MAAM1F,EAAU2rB,EAAYjmB,GAAY,2B,gBCT1C,IAAImF,EAAa,EAAQ,KAErB8E,EAAQxW,KAAKwW,MAEb0+B,EAAY,SAAU5mC,EAAO4N,GAC/B,IAAI9a,EAASkN,EAAMlN,OACf+zC,EAAS3+B,EAAMpV,EAAS,GAC5B,OAAOA,EAAS,EAAIg0C,EAAc9mC,EAAO4N,GAAam5B,EACpD/mC,EACA4mC,EAAUxjC,EAAWpD,EAAO,EAAG6mC,GAASj5B,GACxCg5B,EAAUxjC,EAAWpD,EAAO6mC,GAASj5B,GACrCA,IAIAk5B,EAAgB,SAAU9mC,EAAO4N,GAKnC,IAJA,IAEIo5B,EAAS5iC,EAFTtR,EAASkN,EAAMlN,OACfzD,EAAI,EAGDA,EAAIyD,GAAQ,CAGjB,IAFAsR,EAAI/U,EACJ23C,EAAUhnC,EAAM3Q,GACT+U,GAAKwJ,EAAU5N,EAAMoE,EAAI,GAAI4iC,GAAW,GAC7ChnC,EAAMoE,GAAKpE,IAAQoE,GAEjBA,IAAM/U,MAAK2Q,EAAMoE,GAAK4iC,GAC1B,OAAOhnC,GAGP+mC,EAAQ,SAAU/mC,EAAOinC,EAAMC,EAAOt5B,GAMxC,IALA,IAAIu5B,EAAUF,EAAKn0C,OACfs0C,EAAUF,EAAMp0C,OAChBu0C,EAAS,EACTC,EAAS,EAEND,EAASF,GAAWG,EAASF,GAClCpnC,EAAMqnC,EAASC,GAAWD,EAASF,GAAWG,EAASF,EACnDx5B,EAAUq5B,EAAKI,GAASH,EAAMI,KAAY,EAAIL,EAAKI,KAAYH,EAAMI,KACrED,EAASF,EAAUF,EAAKI,KAAYH,EAAMI,KAC9C,OAAOtnC,GAGXlR,EAAOD,QAAU+3C,G,gBC3CjB,IAEIW,EAFY,EAAQ,IAEAvhC,MAAM,mBAE9BlX,EAAOD,UAAY04C,IAAYA,EAAQ,I,gBCJvC,IAAIC,EAAK,EAAQ,IAEjB14C,EAAOD,QAAU,eAAeyK,KAAKkuC,I,gBCFrC,IAEIC,EAFY,EAAQ,IAEDzhC,MAAM,wBAE7BlX,EAAOD,UAAY44C,IAAWA,EAAO,I,gBCJ7B,EAAQ,EAKhBp1C,CAAE,CAAEG,OAAQ,OAAQ6B,MAAM,GAAQ,CAChCkqB,KALS,EAAQ,Q,gBCDX,EAAQ,EAKhBlsB,CAAE,CAAEG,OAAQ,OAAQ6B,MAAM,GAAQ,CAChCssB,MALU,EAAQ,Q,cCDpB,IAAIpb,EAAM7T,KAAK6T,IACXmiC,EAASh2C,KAAKg2C,OAGlB54C,EAAOD,QAAU6C,KAAKivB,OAAS,SAAenkB,GAC5C,OAAO+I,EAAI/I,GAAKkrC,I,gBCLV,EAAQ,EAKhBr1C,CAAE,CAAEG,OAAQ,OAAQ6B,MAAM,GAAQ,CAAEwqC,MAJxB,EAAQ,Q,gBCDpB,IAAIxsC,EAAI,EAAQ,GACZksB,EAAO,EAAQ,KAEflZ,EAAM3T,KAAK2T,IACXiB,EAAM5U,KAAK4U,IAIfjU,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,GAAQ,CAChCyiB,KAAM,SAActa,GAClB,OAAO+hB,EAAK/hB,GAAKA,GAAK8J,EAAIjB,EAAI7I,GAAI,EAAI,O,gBCV1C,IAAInK,EAAI,EAAQ,GACZwU,EAAQ,EAAQ,KAKpBxU,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,OAAQmU,GAASnV,KAAKmV,OAAS,CAAEA,MAAOA,K,gBCNxE,IAAIrS,EAAc,EAAQ,GACtBoL,EAAW,EAAQ,IAEnBsI,EAAQxW,KAAKwW,MACbyF,EAASnZ,EAAY,GAAGmZ,QACxB9E,EAAUrU,EAAY,GAAGqU,SACzBqF,EAAc1Z,EAAY,GAAG6K,OAC7BsoC,EAAuB,8BACvBC,EAAgC,sBAIpC94C,EAAOD,QAAU,SAAU+3B,EAASnX,EAAKoX,EAAUC,EAAUC,EAAeG,GAC1E,IAAI2gB,EAAUhhB,EAAWD,EAAQ9zB,OAC7BrD,EAAIq3B,EAASh0B,OACbg1C,EAAUF,EAKd,YAJsB70C,IAAlBg0B,IACFA,EAAgBnnB,EAASmnB,GACzB+gB,EAAUH,GAEL9+B,EAAQqe,EAAa4gB,GAAS,SAAU9hC,EAAO+hC,GACpD,IAAIC,EACJ,OAAQr6B,EAAOo6B,EAAI,IACjB,IAAK,IAAK,MAAO,IACjB,IAAK,IAAK,OAAOnhB,EACjB,IAAK,IAAK,OAAO1Y,EAAYuB,EAAK,EAAGoX,GACrC,IAAK,IAAK,OAAO3Y,EAAYuB,EAAKo4B,GAClC,IAAK,IACHG,EAAUjhB,EAAc7Y,EAAY65B,EAAI,GAAI,IAC5C,MACF,QACE,IAAIj3C,GAAKi3C,EACT,GAAU,IAANj3C,EAAS,OAAOkV,EACpB,GAAIlV,EAAIrB,EAAG,CACT,IAAIgE,EAAIyU,EAAMpX,EAAI,IAClB,OAAU,IAAN2C,EAAgBuS,EAChBvS,GAAKhE,OAA8BsD,IAApB+zB,EAASrzB,EAAI,GAAmBka,EAAOo6B,EAAI,GAAKjhB,EAASrzB,EAAI,GAAKka,EAAOo6B,EAAI,GACzF/hC,EAETgiC,EAAUlhB,EAASh2B,EAAI,GAE3B,YAAmBiC,IAAZi1C,EAAwB,GAAKA,O,gBCzChC,EAAQ,EAIhB31C,CAAE,CAAEG,OAAQ,SAAU6B,MAAM,GAAQ,CAClC4zC,QAASv2C,KAAK4U,IAAI,GAAI,O,gBCLxB,IAAIjU,EAAI,EAAQ,GACZwsC,EAAQ,EAAQ,KAGhBqJ,EAASx2C,KAAKqW,MACdxC,EAAM7T,KAAK6T,IACXoB,EAAOjV,KAAKiV,KACZnB,EAAM9T,KAAK8T,IAUfnT,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,QARlBw1C,GAE+B,KAAxCx2C,KAAKwW,MAAMggC,EAAOviC,OAAOwiC,aAEzBD,EAAO9gC,MAAaA,KAIyB,CAChDW,MAAO,SAAevL,GACpB,OAAQA,GAAKA,GAAK,EAAIuH,IAAMvH,EAAI,kBAC5B+I,EAAI/I,GAAKgJ,EACTq5B,EAAMriC,EAAI,EAAImK,EAAKnK,EAAI,GAAKmK,EAAKnK,EAAI,Q,gBCrB7C,IAAInK,EAAI,EAAQ,GAGZ+1C,EAAS12C,KAAKoW,MACdvC,EAAM7T,KAAK6T,IACXoB,EAAOjV,KAAKiV,KAShBtU,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,SAAU01C,GAAU,EAAIA,EAAO,GAAK,IAAM,CACxEtgC,MARF,SAASA,EAAMtL,GACb,OAAQoJ,SAASpJ,GAAKA,IAAW,GAALA,EAAaA,EAAI,GAAKsL,GAAOtL,GAAK+I,EAAI/I,EAAImK,EAAKnK,EAAIA,EAAI,IAA9CA,M,gBCRvC,IAAInK,EAAI,EAAQ,GAGZg2C,EAAS32C,KAAKmW,MACdtC,EAAM7T,KAAK6T,IAKflT,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,SAAU21C,GAAU,EAAIA,GAAQ,GAAK,IAAM,CACzExgC,MAAO,SAAerL,GACpB,OAAmB,IAAXA,GAAKA,GAAUA,EAAI+I,GAAK,EAAI/I,IAAM,EAAIA,IAAM,M,gBCXxD,IAAInK,EAAI,EAAQ,GACZwU,EAAQ,EAAQ,KAGhByhC,EAAQ52C,KAAKkT,KACbS,EAAM3T,KAAK2T,IACX9E,EAAI7O,KAAK6O,EAIblO,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,QAAS41C,GAASA,EAAM,OAASlhC,KAAY,CAC3ExC,KAAM,SAAcpI,GAClB,IAAIjM,EAAIsW,EAAMxB,EAAI7I,GAAK,GAAK,EAC5B,OAAQjM,EAAI,GAAKA,EAAIgQ,EAAIA,KAAOA,EAAI,O,gBCbxC,IAAIlO,EAAI,EAAQ,GACZyC,EAAQ,EAAQ,GAChB+R,EAAQ,EAAQ,KAEhBxB,EAAM3T,KAAK2T,IACXR,EAAMnT,KAAKmT,IACXtE,EAAI7O,KAAK6O,EAUblO,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,EAAM3B,OARnBoC,GAAM,WAEjB,OAA6B,OAAtBpD,KAAKoT,MAAM,WAM8B,CAChDA,KAAM,SAActI,GAClB,OAAO6I,EAAI7I,GAAKA,GAAK,GAAKqK,EAAMrK,GAAKqK,GAAOrK,IAAM,GAAKqI,EAAIrI,EAAI,GAAKqI,GAAKrI,EAAI,KAAO+D,EAAI,O,gBClB5F,IAAIlO,EAAI,EAAQ,GACZwU,EAAQ,EAAQ,KAEhBhC,EAAMnT,KAAKmT,IAIfxS,EAAE,CAAEG,OAAQ,OAAQ6B,MAAM,GAAQ,CAChCokB,KAAM,SAAcjc,GAClB,IAAI0I,EAAI2B,EAAMrK,GAAKA,GACf2I,EAAI0B,GAAOrK,GACf,OAAO0I,GAAKkC,IAAW,EAAIjC,GAAKiC,KAAY,GAAKlC,EAAIC,IAAMN,EAAIrI,GAAKqI,GAAKrI,Q,gBCX7E,IAAIhI,EAAc,EAAQ,GACtB8T,EAAyB,EAAQ,IACjC/W,EAAW,EAAQ,IAEnBg3C,EAAO,KACP1/B,EAAUrU,EAAY,GAAGqU,SAI7B/Z,EAAOD,QAAU,SAAUkd,EAAQZ,EAAKq9B,EAAWl4C,GACjD,IAAIihB,EAAIhgB,EAAS+W,EAAuByD,IACpCgW,EAAK,IAAM5W,EAEf,MADkB,KAAdq9B,IAAkBzmB,GAAM,IAAMymB,EAAY,KAAO3/B,EAAQtX,EAASjB,GAAQi4C,EAAM,UAAY,KACzFxmB,EAAK,IAAMxQ,EAAI,KAAOpG,EAAM,M,gBCbrC,IAAIrW,EAAQ,EAAQ,GAIpBhG,EAAOD,QAAU,SAAU4V,GACzB,OAAO3P,GAAM,WACX,IAAIwE,EAAO,GAAGmL,GAAa,KAC3B,OAAOnL,IAASA,EAAKwmB,eAAiBxmB,EAAK6K,MAAM,KAAKrR,OAAS,O,6BCNnE,IAAIk7B,EAAoB,EAAQ,KAA+BA,kBAC3Dr9B,EAAS,EAAQ,IACjBqY,EAA2B,EAAQ,IACnCzS,EAAiB,EAAQ,IACzBoL,EAAY,EAAQ,IAEpBusB,EAAa,WAAc,OAAOj/B,MAEtCH,EAAOD,QAAU,SAAUw/B,EAAqBD,EAAM/e,EAAMo5B,GAC1D,IAAIlkC,EAAgB6pB,EAAO,YAI3B,OAHAC,EAAoBp9B,UAAYN,EAAOq9B,EAAmB,CAAE3e,KAAMrG,IAA2By/B,EAAiBp5B,KAC9G9Y,EAAe83B,EAAqB9pB,GAAe,GAAO,GAC1D5C,EAAU4C,GAAiB2pB,EACpBG,I,gBCdT,IAAIv5B,EAAQ,EAAQ,GAChB6B,EAAW,EAAQ,IACnB0R,EAAU,EAAQ,IAClBqgC,EAA8B,EAAQ,KAGtCC,EAAgB54C,OAAOqxC,aACvB9Q,EAAsBx7B,GAAM,WAAc6zC,EAAc,MAI5D75C,EAAOD,QAAWyhC,GAAuBoY,EAA+B,SAAsBj3C,GAC5F,QAAKkF,EAASlF,OACVi3C,GAA8C,eAAfrgC,EAAQ5W,OACpCk3C,GAAgBA,EAAcl3C,MACnCk3C,G,gBCdJ,IAAI7zC,EAAQ,EAAQ,GAEpBhG,EAAOD,QAAUiG,GAAM,WACrB,GAA0B,mBAAf8zC,YAA2B,CACpC,IAAIC,EAAS,IAAID,YAAY,GAEzB74C,OAAOqxC,aAAayH,IAAS94C,OAAOC,eAAe64C,EAAQ,IAAK,CAAEv4C,MAAO,S,gBCPjF,IAAIwE,EAAQ,EAAQ,GAEpBhG,EAAOD,SAAWiG,GAAM,WAEtB,OAAO/E,OAAOqxC,aAAarxC,OAAO+4C,kBAAkB,S,6BCHtD,IAAI/2C,EAAS,EAAQ,GACjBlB,EAAO,EAAQ,IACfrB,EAAO,EAAQ,IACfoQ,EAAW,EAAQ,IACnBmpC,EAA+B,EAAQ,KACvC9Z,EAAwB,EAAQ,KAChCpwB,EAAgB,EAAQ,IACxBE,EAAoB,EAAQ,IAC5BC,EAAiB,EAAQ,IACzBkwB,EAAc,EAAQ,KACtBC,EAAoB,EAAQ,KAE5BhwB,EAAQpN,EAAOoN,MAInBrQ,EAAOD,QAAU,SAAcm6C,GAC7B,IAAIvpC,EAAIG,EAASopC,GACbC,EAAiBpqC,EAAc5P,MAC/B0T,EAAkB9P,UAAUC,OAC5Bo2C,EAAQvmC,EAAkB,EAAI9P,UAAU,QAAKE,EAC7Co2C,OAAoBp2C,IAAVm2C,EACVC,IAASD,EAAQr4C,EAAKq4C,EAAOvmC,EAAkB,EAAI9P,UAAU,QAAKE,IACtE,IAEID,EAAQoH,EAAQw1B,EAAMv9B,EAAUkd,EAAM/e,EAFtC4xC,EAAiB/S,EAAkB1vB,GACnC5C,EAAQ,EAGZ,IAAIqlC,GAAoBjzC,MAAQkQ,GAAS8vB,EAAsBiT,GAW7D,IAFApvC,EAASiM,EAAkBU,GAC3BvF,EAAS+uC,EAAiB,IAAIh6C,KAAK6D,GAAUqM,EAAMrM,GAC7CA,EAAS+J,EAAOA,IACpBvM,EAAQ64C,EAAUD,EAAMzpC,EAAE5C,GAAQA,GAAS4C,EAAE5C,GAC7CmC,EAAe9E,EAAQ2C,EAAOvM,QAThC,IAFA+e,GADAld,EAAW+8B,EAAYzvB,EAAGyiC,IACV7yB,KAChBnV,EAAS+uC,EAAiB,IAAIh6C,KAAS,KAC/BygC,EAAOlgC,EAAK6f,EAAMld,IAAWwJ,KAAMkB,IACzCvM,EAAQ64C,EAAUJ,EAA6B52C,EAAU+2C,EAAO,CAACxZ,EAAKp/B,MAAOuM,IAAQ,GAAQ6yB,EAAKp/B,MAClG0O,EAAe9E,EAAQ2C,EAAOvM,GAWlC,OADA4J,EAAOpH,OAAS+J,EACT3C,I,gBC7CT,IAAIvF,EAAW,EAAQ,IACnBy6B,EAAgB,EAAQ,KAG5BtgC,EAAOD,QAAU,SAAUsD,EAAUyD,EAAItF,EAAO84C,GAC9C,IACE,OAAOA,EAAUxzC,EAAGjB,EAASrE,GAAO,GAAIA,EAAM,IAAMsF,EAAGtF,GACvD,MAAOgD,GACP87B,EAAcj9B,EAAU,QAASmB,M,gBCRrC,IAAIvB,EAAS,EAAQ,GAErBjD,EAAOD,QAAUkD,G,gBCFjB,IAAIA,EAAS,EAAQ,GAErBjD,EAAOD,QAAUkD,EAAOuK,S,gBCFxB,IAEI/D,EAFS,EAAQ,GAEEA,UAEvBzJ,EAAOD,QAAU,SAAUw6C,EAAQC,GACjC,GAAID,EAASC,EAAU,MAAM/wC,EAAU,wBACvC,OAAO8wC,I,gBCNT,IAiBIE,EAAOC,EAAM7W,EAAM93B,EAAQ4uC,EAAQC,EAAMnwC,EAASG,EAjBlD3H,EAAS,EAAQ,GACjBlB,EAAO,EAAQ,IACf2C,EAA2B,EAAQ,IAAmDC,EACtFk2C,EAAY,EAAQ,KAAqBzyC,IACzCgsC,EAAS,EAAQ,KACjB0G,EAAgB,EAAQ,KACxBC,EAAkB,EAAQ,KAC1BjyC,EAAU,EAAQ,KAElBkyC,EAAmB/3C,EAAO+3C,kBAAoB/3C,EAAOg4C,uBACrDvxC,EAAWzG,EAAOyG,SAClBC,EAAU1G,EAAO0G,QACjB6D,EAAUvK,EAAOuK,QAEjB0tC,EAA2Bx2C,EAAyBzB,EAAQ,kBAC5Dk4C,EAAiBD,GAA4BA,EAAyB15C,MAKrE25C,IACHV,EAAQ,WACN,IAAI/tC,EAAQ5F,EAEZ,IADIgC,IAAY4D,EAAS/C,EAAQ+B,SAASgB,EAAOZ,OAC1C4uC,GAAM,CACX5zC,EAAK4zC,EAAK5zC,GACV4zC,EAAOA,EAAKn6B,KACZ,IACEzZ,IACA,MAAOtC,GAGP,MAFIk2C,EAAM3uC,IACL83B,OAAO5/B,EACNO,GAERq/B,OAAO5/B,EACLyI,GAAQA,EAAOb,SAKhBuoC,GAAWtrC,GAAYiyC,IAAmBC,IAAoBtxC,GAQvDoxC,GAAiBttC,GAAWA,EAAQ9C,UAE9CD,EAAU+C,EAAQ9C,aAAQzG,IAElBX,YAAckK,EACtB5C,EAAO7I,EAAK0I,EAAQG,KAAMH,GAC1BsB,EAAS,WACPnB,EAAK6vC,KAGE3xC,EACTiD,EAAS,WACPpC,EAAQsrC,SAASwF,KAUnBI,EAAY94C,EAAK84C,EAAW53C,GAC5B8I,EAAS,WACP8uC,EAAUJ,MA/BZE,GAAS,EACTC,EAAOlxC,EAAS0xC,eAAe,IAC/B,IAAIJ,EAAiBP,GAAOY,QAAQT,EAAM,CAAEU,eAAe,IAC3DvvC,EAAS,WACP6uC,EAAKxhB,KAAOuhB,GAAUA,KAgC5B36C,EAAOD,QAAUo7C,GAAkB,SAAUr0C,GAC3C,IAAIqB,EAAO,CAAErB,GAAIA,EAAIyZ,UAAMtc,GACvB4/B,IAAMA,EAAKtjB,KAAOpY,GACjBuyC,IACHA,EAAOvyC,EACP4D,KACA83B,EAAO17B,I,gBCnFX,IAAIywB,EAAY,EAAQ,IACpB31B,EAAS,EAAQ,GAErBjD,EAAOD,QAAU,oBAAoByK,KAAKouB,SAAgC30B,IAAlBhB,EAAOs4C,Q,gBCH/D,IAAI3iB,EAAY,EAAQ,IAExB54B,EAAOD,QAAU,qBAAqByK,KAAKouB,I,gBCF3C,IAAI/yB,EAAW,EAAQ,IACnBgC,EAAW,EAAQ,IACnB+B,EAAuB,EAAQ,KAEnC5J,EAAOD,QAAU,SAAUsN,EAAGK,GAE5B,GADA7H,EAASwH,GACLxF,EAAS6F,IAAMA,EAAEpK,cAAgB+J,EAAG,OAAOK,EAC/C,IAAI8tC,EAAoB5xC,EAAqBjF,EAAE0I,GAG/C,OADA3C,EADc8wC,EAAkB9wC,SACxBgD,GACD8tC,EAAkB/wC,U,gBCV3B,IAAIxH,EAAS,EAAQ,GAErBjD,EAAOD,QAAU,SAAUqW,EAAGC,GAC5B,IAAIolC,EAAUx4C,EAAOw4C,QACjBA,GAAWA,EAAQj3C,QACD,GAApBT,UAAUC,OAAcy3C,EAAQj3C,MAAM4R,GAAKqlC,EAAQj3C,MAAM4R,EAAGC,M,cCLhErW,EAAOD,QAAU,SAAU4G,GACzB,IACE,MAAO,CAAEnC,OAAO,EAAOhD,MAAOmF,KAC9B,MAAOnC,GACP,MAAO,CAAEA,OAAO,EAAMhD,MAAOgD,M,cCJjC,IAAIkE,EAAQ,WACVvI,KAAKu6C,KAAO,KACZv6C,KAAKu7C,KAAO,MAGdhzC,EAAMvG,UAAY,CAChBiL,IAAK,SAAUs9B,GACb,IAAInI,EAAQ,CAAEmI,KAAMA,EAAMnqB,KAAM,MAC5BpgB,KAAKu6C,KAAMv6C,KAAKu7C,KAAKn7B,KAAOgiB,EAC3BpiC,KAAKu6C,KAAOnY,EACjBpiC,KAAKu7C,KAAOnZ,GAEdnhC,IAAK,WACH,IAAImhC,EAAQpiC,KAAKu6C,KACjB,GAAInY,EAGF,OAFApiC,KAAKu6C,KAAOnY,EAAMhiB,KACdpgB,KAAKu7C,OAASnZ,IAAOpiC,KAAKu7C,KAAO,MAC9BnZ,EAAMmI,OAKnB1qC,EAAOD,QAAU2I,G,cCtBjB1I,EAAOD,QAA2B,iBAAVgD,Q,gBCOxB,IAAI44C,EAAW,SAAU57C,GACvB,aAEA,IAAI67C,EAAK36C,OAAOkB,UACZkN,EAASusC,EAAGx5C,eAEZgZ,EAA4B,mBAAX9Z,OAAwBA,OAAS,GAClDu6C,EAAiBzgC,EAAQ/X,UAAY,aACrCy4C,EAAsB1gC,EAAQ2gC,eAAiB,kBAC/CC,EAAoB5gC,EAAQ7Z,aAAe,gBAE/C,SAAStB,EAAOmD,EAAKtB,EAAKN,GAOxB,OANAP,OAAOC,eAAekC,EAAKtB,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZqN,cAAc,EACd2D,UAAU,IAEL/O,EAAItB,GAEb,IAEE7B,EAAO,GAAI,IACX,MAAOglC,GACPhlC,EAAS,SAASmD,EAAKtB,EAAKN,GAC1B,OAAO4B,EAAItB,GAAON,GAItB,SAAS+L,EAAK0uC,EAASC,EAASl5C,EAAMm5C,GAEpC,IAAIC,EAAiBF,GAAWA,EAAQ/5C,qBAAqBk6C,EAAYH,EAAUG,EAC/EC,EAAYr7C,OAAOY,OAAOu6C,EAAej6C,WACzCo6C,EAAU,IAAIC,EAAQL,GAAe,IAMzC,OAFAG,EAAUG,QAuMZ,SAA0BR,EAASj5C,EAAMu5C,GACvC,IAAIpxC,EAhLuB,iBAkL3B,OAAO,SAAgB2V,EAAQvP,GAC7B,GAjLoB,cAiLhBpG,EACF,MAAM,IAAI4S,MAAM,gCAGlB,GApLoB,cAoLhB5S,EAA6B,CAC/B,GAAe,UAAX2V,EACF,MAAMvP,EAKR,OAAOmrC,IAMT,IAHAH,EAAQz7B,OAASA,EACjBy7B,EAAQhrC,IAAMA,IAED,CACX,IAAIorC,EAAWJ,EAAQI,SACvB,GAAIA,EAAU,CACZ,IAAIC,EAAiBC,EAAoBF,EAAUJ,GACnD,GAAIK,EAAgB,CAClB,GAAIA,IAAmBE,EAAkB,SACzC,OAAOF,GAIX,GAAuB,SAAnBL,EAAQz7B,OAGVy7B,EAAQQ,KAAOR,EAAQS,MAAQT,EAAQhrC,SAElC,GAAuB,UAAnBgrC,EAAQz7B,OAAoB,CACrC,GApNqB,mBAoNjB3V,EAEF,MADAA,EAlNc,YAmNRoxC,EAAQhrC,IAGhBgrC,EAAQU,kBAAkBV,EAAQhrC,SAEN,WAAnBgrC,EAAQz7B,QACjBy7B,EAAQW,OAAO,SAAUX,EAAQhrC,KAGnCpG,EA7NkB,YA+NlB,IAAIgyC,EAASC,EAASnB,EAASj5C,EAAMu5C,GACrC,GAAoB,WAAhBY,EAAOlwC,KAAmB,CAO5B,GAJA9B,EAAQoxC,EAAQ1vC,KAlOA,YAFK,iBAwOjBswC,EAAO5rC,MAAQurC,EACjB,SAGF,MAAO,CACLt7C,MAAO27C,EAAO5rC,IACd1E,KAAM0vC,EAAQ1vC,MAGS,UAAhBswC,EAAOlwC,OAChB9B,EAhPgB,YAmPhBoxC,EAAQz7B,OAAS,QACjBy7B,EAAQhrC,IAAM4rC,EAAO5rC,OA/QP8rC,CAAiBpB,EAASj5C,EAAMu5C,GAE7CD,EAcT,SAASc,EAASt2C,EAAI1D,EAAKmO,GACzB,IACE,MAAO,CAAEtE,KAAM,SAAUsE,IAAKzK,EAAGpG,KAAK0C,EAAKmO,IAC3C,MAAO0zB,GACP,MAAO,CAAEh4B,KAAM,QAASsE,IAAK0zB,IAhBjCllC,EAAQwN,KAAOA,EAoBf,IAOIuvC,EAAmB,GAMvB,SAAST,KACT,SAASiB,KACT,SAASC,KAIT,IAAIre,EAAoB,GACxBj/B,EAAOi/B,EAAmB2c,GAAgB,WACxC,OAAO17C,QAGT,IAAIq9C,EAAWv8C,OAAOw8B,eAClBggB,EAA0BD,GAAYA,EAASA,EAAS5vC,EAAO,MAC/D6vC,GACAA,IAA4B7B,GAC5BvsC,EAAO3O,KAAK+8C,EAAyB5B,KAGvC3c,EAAoBue,GAGtB,IAAIC,EAAKH,EAA2Bp7C,UAClCk6C,EAAUl6C,UAAYlB,OAAOY,OAAOq9B,GAYtC,SAASye,EAAsBx7C,GAC7B,CAAC,OAAQ,QAAS,UAAUiC,SAAQ,SAAS0c,GAC3C7gB,EAAOkC,EAAW2e,GAAQ,SAASvP,GACjC,OAAOpR,KAAKs8C,QAAQ37B,EAAQvP,SAkClC,SAASqsC,EAActB,EAAWuB,GAgChC,IAAIC,EAgCJ39C,KAAKs8C,QA9BL,SAAiB37B,EAAQvP,GACvB,SAASwsC,IACP,OAAO,IAAIF,GAAY,SAASnzC,EAASe,IAnC7C,SAASuyC,EAAOl9B,EAAQvP,EAAK7G,EAASe,GACpC,IAAI0xC,EAASC,EAASd,EAAUx7B,GAASw7B,EAAW/qC,GACpD,GAAoB,UAAhB4rC,EAAOlwC,KAEJ,CACL,IAAI7B,EAAS+xC,EAAO5rC,IAChB/P,EAAQ4J,EAAO5J,MACnB,OAAIA,GACiB,iBAAVA,GACP6N,EAAO3O,KAAKc,EAAO,WACdq8C,EAAYnzC,QAAQlJ,EAAMy8C,SAASrzC,MAAK,SAASpJ,GACtDw8C,EAAO,OAAQx8C,EAAOkJ,EAASe,MAC9B,SAASw5B,GACV+Y,EAAO,QAAS/Y,EAAKv6B,EAASe,MAI3BoyC,EAAYnzC,QAAQlJ,GAAOoJ,MAAK,SAASszC,GAI9C9yC,EAAO5J,MAAQ08C,EACfxzC,EAAQU,MACP,SAAS5G,GAGV,OAAOw5C,EAAO,QAASx5C,EAAOkG,EAASe,MAvBzCA,EAAO0xC,EAAO5rC,KAiCZysC,CAAOl9B,EAAQvP,EAAK7G,EAASe,MAIjC,OAAOqyC,EAaLA,EAAkBA,EAAgBlzC,KAChCmzC,EAGAA,GACEA,KAkHV,SAASlB,EAAoBF,EAAUJ,GACrC,IAAIz7B,EAAS67B,EAASt5C,SAASk5C,EAAQz7B,QACvC,QA3TE7c,IA2TE6c,EAAsB,CAKxB,GAFAy7B,EAAQI,SAAW,KAEI,UAAnBJ,EAAQz7B,OAAoB,CAE9B,GAAI67B,EAASt5C,SAAiB,SAG5Bk5C,EAAQz7B,OAAS,SACjBy7B,EAAQhrC,SAtUZtN,EAuUI44C,EAAoBF,EAAUJ,GAEP,UAAnBA,EAAQz7B,QAGV,OAAOg8B,EAIXP,EAAQz7B,OAAS,QACjBy7B,EAAQhrC,IAAM,IAAI9H,UAChB,kDAGJ,OAAOqzC,EAGT,IAAIK,EAASC,EAASt8B,EAAQ67B,EAASt5C,SAAUk5C,EAAQhrC,KAEzD,GAAoB,UAAhB4rC,EAAOlwC,KAIT,OAHAsvC,EAAQz7B,OAAS,QACjBy7B,EAAQhrC,IAAM4rC,EAAO5rC,IACrBgrC,EAAQI,SAAW,KACZG,EAGT,IAAIqB,EAAOhB,EAAO5rC,IAElB,OAAM4sC,EAOFA,EAAKtxC,MAGP0vC,EAAQI,EAASyB,YAAcD,EAAK38C,MAGpC+6C,EAAQh8B,KAAOo8B,EAAS0B,QAQD,WAAnB9B,EAAQz7B,SACVy7B,EAAQz7B,OAAS,OACjBy7B,EAAQhrC,SA1XVtN,GAoYFs4C,EAAQI,SAAW,KACZG,GANEqB,GA3BP5B,EAAQz7B,OAAS,QACjBy7B,EAAQhrC,IAAM,IAAI9H,UAAU,oCAC5B8yC,EAAQI,SAAW,KACZG,GAoDX,SAASwB,EAAaC,GACpB,IAAIhc,EAAQ,CAAEic,OAAQD,EAAK,IAEvB,KAAKA,IACPhc,EAAMkc,SAAWF,EAAK,IAGpB,KAAKA,IACPhc,EAAMmc,WAAaH,EAAK,GACxBhc,EAAMoc,SAAWJ,EAAK,IAGxBp+C,KAAKy+C,WAAWhjC,KAAK2mB,GAGvB,SAASsc,EAActc,GACrB,IAAI4a,EAAS5a,EAAMuc,YAAc,GACjC3B,EAAOlwC,KAAO,gBACPkwC,EAAO5rC,IACdgxB,EAAMuc,WAAa3B,EAGrB,SAASX,EAAQL,GAIfh8C,KAAKy+C,WAAa,CAAC,CAAEJ,OAAQ,SAC7BrC,EAAY/3C,QAAQk6C,EAAcn+C,MAClCA,KAAK4+C,OAAM,GA8Bb,SAASnxC,EAAO9C,GACd,GAAIA,EAAU,CACZ,IAAIsoC,EAAiBtoC,EAAS+wC,GAC9B,GAAIzI,EACF,OAAOA,EAAe1yC,KAAKoK,GAG7B,GAA6B,mBAAlBA,EAASyV,KAClB,OAAOzV,EAGT,IAAKuM,MAAMvM,EAAS9G,QAAS,CAC3B,IAAIzD,GAAK,EAAGggB,EAAO,SAASA,IAC1B,OAAShgB,EAAIuK,EAAS9G,QACpB,GAAIqL,EAAO3O,KAAKoK,EAAUvK,GAGxB,OAFAggB,EAAK/e,MAAQsJ,EAASvK,GACtBggB,EAAK1T,MAAO,EACL0T,EAOX,OAHAA,EAAK/e,WA1eTyC,EA2eIsc,EAAK1T,MAAO,EAEL0T,GAGT,OAAOA,EAAKA,KAAOA,GAKvB,MAAO,CAAEA,KAAMm8B,GAIjB,SAASA,IACP,MAAO,CAAEl7C,WA1fPyC,EA0fyB4I,MAAM,GA+MnC,OA7mBAywC,EAAkBn7C,UAAYo7C,EAC9Bt9C,EAAOy9C,EAAI,cAAeH,GAC1Bt9C,EAAOs9C,EAA4B,cAAeD,GAClDA,EAAkB0B,YAAc/+C,EAC9Bs9C,EACAvB,EACA,qBAaFj8C,EAAQk/C,oBAAsB,SAASC,GACrC,IAAIC,EAAyB,mBAAXD,GAAyBA,EAAO57C,YAClD,QAAO67C,IACHA,IAAS7B,GAG2B,uBAAnC6B,EAAKH,aAAeG,EAAKr+C,QAIhCf,EAAQq/C,KAAO,SAASF,GAQtB,OAPIj+C,OAAOuG,eACTvG,OAAOuG,eAAe03C,EAAQ3B,IAE9B2B,EAAOnhB,UAAYwf,EACnBt9C,EAAOi/C,EAAQlD,EAAmB,sBAEpCkD,EAAO/8C,UAAYlB,OAAOY,OAAO67C,GAC1BwB,GAOTn/C,EAAQs/C,MAAQ,SAAS9tC,GACvB,MAAO,CAAE0sC,QAAS1sC,IAsEpBosC,EAAsBC,EAAcz7C,WACpClC,EAAO29C,EAAcz7C,UAAW25C,GAAqB,WACnD,OAAO37C,QAETJ,EAAQ69C,cAAgBA,EAKxB79C,EAAQu/C,MAAQ,SAASrD,EAASC,EAASl5C,EAAMm5C,EAAa0B,QACxC,IAAhBA,IAAwBA,EAAcrwC,SAE1C,IAAI+xC,EAAO,IAAI3B,EACbrwC,EAAK0uC,EAASC,EAASl5C,EAAMm5C,GAC7B0B,GAGF,OAAO99C,EAAQk/C,oBAAoB/C,GAC/BqD,EACAA,EAAKh/B,OAAO3V,MAAK,SAASQ,GACxB,OAAOA,EAAOyB,KAAOzB,EAAO5J,MAAQ+9C,EAAKh/B,WAuKjDo9B,EAAsBD,GAEtBz9C,EAAOy9C,EAAI1B,EAAmB,aAO9B/7C,EAAOy9C,EAAI7B,GAAgB,WACzB,OAAO17C,QAGTF,EAAOy9C,EAAI,YAAY,WACrB,MAAO,wBAkCT39C,EAAQoT,KAAO,SAASlR,GACtB,IAAIkR,EAAO,GACX,IAAK,IAAIrR,KAAOG,EACdkR,EAAKyI,KAAK9Z,GAMZ,OAJAqR,EAAKmT,UAIE,SAAS/F,IACd,KAAOpN,EAAKnP,QAAQ,CAClB,IAAIlC,EAAMqR,EAAK2Y,MACf,GAAIhqB,KAAOG,EAGT,OAFAse,EAAK/e,MAAQM,EACbye,EAAK1T,MAAO,EACL0T,EAQX,OADAA,EAAK1T,MAAO,EACL0T,IAsCXxgB,EAAQ6N,OAASA,EAMjB4uC,EAAQr6C,UAAY,CAClBmB,YAAak5C,EAEbuC,MAAO,SAASS,GAcd,GAbAr/C,KAAKmgB,KAAO,EACZngB,KAAKogB,KAAO,EAGZpgB,KAAK48C,KAAO58C,KAAK68C,WArgBjB/4C,EAsgBA9D,KAAK0M,MAAO,EACZ1M,KAAKw8C,SAAW,KAEhBx8C,KAAK2gB,OAAS,OACd3gB,KAAKoR,SA1gBLtN,EA4gBA9D,KAAKy+C,WAAWx6C,QAAQy6C,IAEnBW,EACH,IAAK,IAAI1+C,KAAQX,KAEQ,MAAnBW,EAAK+d,OAAO,IACZxP,EAAO3O,KAAKP,KAAMW,KACjBuW,OAAOvW,EAAKyP,MAAM,MACrBpQ,KAAKW,QAphBXmD,IA0hBF+8B,KAAM,WACJ7gC,KAAK0M,MAAO,EAEZ,IACI4yC,EADYt/C,KAAKy+C,WAAW,GACLE,WAC3B,GAAwB,UAApBW,EAAWxyC,KACb,MAAMwyC,EAAWluC,IAGnB,OAAOpR,KAAKu/C,MAGdzC,kBAAmB,SAAS0C,GAC1B,GAAIx/C,KAAK0M,KACP,MAAM8yC,EAGR,IAAIpD,EAAUp8C,KACd,SAASy/C,EAAOC,EAAKC,GAYnB,OAXA3C,EAAOlwC,KAAO,QACdkwC,EAAO5rC,IAAMouC,EACbpD,EAAQh8B,KAAOs/B,EAEXC,IAGFvD,EAAQz7B,OAAS,OACjBy7B,EAAQhrC,SArjBZtN,KAwjBY67C,EAGZ,IAAK,IAAIv/C,EAAIJ,KAAKy+C,WAAW56C,OAAS,EAAGzD,GAAK,IAAKA,EAAG,CACpD,IAAIgiC,EAAQpiC,KAAKy+C,WAAWr+C,GACxB48C,EAAS5a,EAAMuc,WAEnB,GAAqB,SAAjBvc,EAAMic,OAIR,OAAOoB,EAAO,OAGhB,GAAIrd,EAAMic,QAAUr+C,KAAKmgB,KAAM,CAC7B,IAAIy/B,EAAW1wC,EAAO3O,KAAK6hC,EAAO,YAC9Byd,EAAa3wC,EAAO3O,KAAK6hC,EAAO,cAEpC,GAAIwd,GAAYC,EAAY,CAC1B,GAAI7/C,KAAKmgB,KAAOiiB,EAAMkc,SACpB,OAAOmB,EAAOrd,EAAMkc,UAAU,GACzB,GAAIt+C,KAAKmgB,KAAOiiB,EAAMmc,WAC3B,OAAOkB,EAAOrd,EAAMmc,iBAGjB,GAAIqB,GACT,GAAI5/C,KAAKmgB,KAAOiiB,EAAMkc,SACpB,OAAOmB,EAAOrd,EAAMkc,UAAU,OAG3B,KAAIuB,EAMT,MAAM,IAAIjiC,MAAM,0CALhB,GAAI5d,KAAKmgB,KAAOiiB,EAAMmc,WACpB,OAAOkB,EAAOrd,EAAMmc,gBAU9BxB,OAAQ,SAASjwC,EAAMsE,GACrB,IAAK,IAAIhR,EAAIJ,KAAKy+C,WAAW56C,OAAS,EAAGzD,GAAK,IAAKA,EAAG,CACpD,IAAIgiC,EAAQpiC,KAAKy+C,WAAWr+C,GAC5B,GAAIgiC,EAAMic,QAAUr+C,KAAKmgB,MACrBjR,EAAO3O,KAAK6hC,EAAO,eACnBpiC,KAAKmgB,KAAOiiB,EAAMmc,WAAY,CAChC,IAAIuB,EAAe1d,EACnB,OAIA0d,IACU,UAAThzC,GACS,aAATA,IACDgzC,EAAazB,QAAUjtC,GACvBA,GAAO0uC,EAAavB,aAGtBuB,EAAe,MAGjB,IAAI9C,EAAS8C,EAAeA,EAAanB,WAAa,GAItD,OAHA3B,EAAOlwC,KAAOA,EACdkwC,EAAO5rC,IAAMA,EAET0uC,GACF9/C,KAAK2gB,OAAS,OACd3gB,KAAKogB,KAAO0/B,EAAavB,WAClB5B,GAGF38C,KAAK+/C,SAAS/C,IAGvB+C,SAAU,SAAS/C,EAAQwB,GACzB,GAAoB,UAAhBxB,EAAOlwC,KACT,MAAMkwC,EAAO5rC,IAcf,MAXoB,UAAhB4rC,EAAOlwC,MACS,aAAhBkwC,EAAOlwC,KACT9M,KAAKogB,KAAO48B,EAAO5rC,IACM,WAAhB4rC,EAAOlwC,MAChB9M,KAAKu/C,KAAOv/C,KAAKoR,IAAM4rC,EAAO5rC,IAC9BpR,KAAK2gB,OAAS,SACd3gB,KAAKogB,KAAO,OACa,WAAhB48B,EAAOlwC,MAAqB0xC,IACrCx+C,KAAKogB,KAAOo+B,GAGP7B,GAGTqD,OAAQ,SAASzB,GACf,IAAK,IAAIn+C,EAAIJ,KAAKy+C,WAAW56C,OAAS,EAAGzD,GAAK,IAAKA,EAAG,CACpD,IAAIgiC,EAAQpiC,KAAKy+C,WAAWr+C,GAC5B,GAAIgiC,EAAMmc,aAAeA,EAGvB,OAFAv+C,KAAK+/C,SAAS3d,EAAMuc,WAAYvc,EAAMoc,UACtCE,EAActc,GACPua,IAKb,MAAS,SAAS0B,GAChB,IAAK,IAAIj+C,EAAIJ,KAAKy+C,WAAW56C,OAAS,EAAGzD,GAAK,IAAKA,EAAG,CACpD,IAAIgiC,EAAQpiC,KAAKy+C,WAAWr+C,GAC5B,GAAIgiC,EAAMic,SAAWA,EAAQ,CAC3B,IAAIrB,EAAS5a,EAAMuc,WACnB,GAAoB,UAAhB3B,EAAOlwC,KAAkB,CAC3B,IAAImzC,EAASjD,EAAO5rC,IACpBstC,EAActc,GAEhB,OAAO6d,GAMX,MAAM,IAAIriC,MAAM,0BAGlBsiC,cAAe,SAASv1C,EAAUszC,EAAYC,GAa5C,OAZAl+C,KAAKw8C,SAAW,CACdt5C,SAAUuK,EAAO9C,GACjBszC,WAAYA,EACZC,QAASA,GAGS,SAAhBl+C,KAAK2gB,SAGP3gB,KAAKoR,SA9rBPtN,GAisBO64C,IAQJ/8C,EA9sBK,CAqtBiBC,EAAOD,SAGtC,IACEugD,mBAAqB3E,EACrB,MAAO4E,GAWmB,iBAAfz9C,WACTA,WAAWw9C,mBAAqB3E,EAEhCz4C,SAAS,IAAK,yBAAdA,CAAwCy4C,K,6BC9uB5C,IAAIp4C,EAAI,EAAQ,GACZi9C,EAAQ,EAAQ,KAA4BrsC,KAKhD5Q,EAAE,CAAEG,OAAQ,SAAUC,OAAO,EAAMC,OAJN,EAAQ,IAIM68C,CAAuB,SAAW,CAC3EtsC,KAAM,WACJ,OAAOqsC,EAAMrgD,U,gBCTjB,IAAIwF,EAAuB,EAAQ,IAA8BC,OAC7DI,EAAQ,EAAQ,GAChBgqC,EAAc,EAAQ,KAM1BhwC,EAAOD,QAAU,SAAU4V,GACzB,OAAO3P,GAAM,WACX,QAASgqC,EAAYr6B,MANf,cAOGA,MACHhQ,GAAwBqqC,EAAYr6B,GAAa7U,OAAS6U,O,cCRpE3V,EAAOD,QAJP,SAAyB6S,GACvB,GAAIvC,MAAMP,QAAQ8C,GAAM,OAAOA,GAGC5S,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,cC0BvGC,EAAOD,QA9BP,SAA+B6S,EAAKrS,GAClC,IAAImgD,EAAY,MAAP9tC,EAAc,KAAyB,oBAAXtR,QAA0BsR,EAAItR,OAAO+B,WAAauP,EAAI,cAE3F,GAAU,MAAN8tC,EAAJ,CACA,IAIIC,EAAIC,EAJJC,EAAO,GACPC,GAAK,EACLC,GAAK,EAIT,IACE,IAAKL,EAAKA,EAAGhgD,KAAKkS,KAAQkuC,GAAMH,EAAKD,EAAGngC,QAAQ1T,QAC9Cg0C,EAAKjlC,KAAK+kC,EAAGn/C,QAETjB,GAAKsgD,EAAK78C,SAAWzD,GAH4BugD,GAAK,IAK5D,MAAO7b,GACP8b,GAAK,EACLH,EAAK3b,EACL,QACA,IACO6b,GAAsB,MAAhBJ,EAAW,QAAWA,EAAW,SAC5C,QACA,GAAIK,EAAI,MAAMH,GAIlB,OAAOC,IAG+B7gD,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,cC1B7GC,EAAOD,QAJP,WACE,MAAM,IAAI0J,UAAU,8IAGazJ,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,gBCJxG,IAAI81C,EAAmB,EAAQ,KAM/B71C,EAAOD,QAJP,SAA4B6S,GAC1B,GAAIvC,MAAMP,QAAQ8C,GAAM,OAAOijC,EAAiBjjC,IAGb5S,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,cCF1GC,EAAOD,QAJP,SAA0Bw/C,GACxB,GAAsB,oBAAXj+C,QAAmD,MAAzBi+C,EAAKj+C,OAAO+B,WAA2C,MAAtBk8C,EAAK,cAAuB,OAAOlvC,MAAMqD,KAAK6rC,IAGnFv/C,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,cCAxGC,EAAOD,QAJP,WACE,MAAM,IAAI0J,UAAU,yIAGezJ,EAAOD,QAAQ4B,YAAa,EAAM3B,EAAOD,QAAiB,QAAIC,EAAOD,S,gBCJ1G,IAAIwD,EAAI,EAAQ,GACZy9C,EAAO,EAAQ,KACf1uC,EAAmB,EAAQ,KAI/B/O,EAAE,CAAEG,OAAQ,QAASC,OAAO,GAAQ,CAClCq9C,KAAMA,IAIR1uC,EAAiB,S,6BCVjB,IAAIxB,EAAW,EAAQ,IACnBd,EAAkB,EAAQ,IAC1BC,EAAoB,EAAQ,IAIhCjQ,EAAOD,QAAU,SAAcyB,GAO7B,IANA,IAAImP,EAAIG,EAAS3Q,MACb6D,EAASiM,EAAkBU,GAC3BkD,EAAkB9P,UAAUC,OAC5B+J,EAAQiC,EAAgB6D,EAAkB,EAAI9P,UAAU,QAAKE,EAAWD,GACxEyM,EAAMoD,EAAkB,EAAI9P,UAAU,QAAKE,EAC3Cg9C,OAAiBh9C,IAARwM,EAAoBzM,EAASgM,EAAgBS,EAAKzM,GACxDi9C,EAASlzC,GAAO4C,EAAE5C,KAAWvM,EACpC,OAAOmP,I,iBCfT,mBA2BA,SAAU1N,EAAQjD,EAAQC,GAE1B,SAASihD,EAAKC,GACZ,IAgDIn/C,EAhDAo/C,EAAKjhD,KAAMkhD,GAgDXr/C,EAAI,WAEG,SAASo3B,GAClBA,EAAO7uB,OAAO6uB,GACd,IAAK,IAAI74B,EAAI,EAAGA,EAAI64B,EAAKp1B,OAAQzD,IAAK,CAEpC,IAAI+gD,EAAI,oBADRt/C,GAAKo3B,EAAK7kB,WAAWhU,IAGrB+gD,GADAt/C,EAAIs/C,IAAM,EAGVt/C,GADAs/C,GAAKt/C,KACK,EAEVA,GAAS,YADTs/C,GAAKt/C,GAGP,OAAmB,wBAAXA,IAAM,KA5DhBo/C,EAAG7gC,KAAO,WACR,IAAI9e,EAAI,QAAU2/C,EAAGG,GAAY,uBAAPH,EAAGxgD,EAG7B,OAFAwgD,EAAGG,GAAKH,EAAGI,GACXJ,EAAGI,GAAKJ,EAAGK,GACJL,EAAGK,GAAKhgD,GAAK2/C,EAAGxgD,EAAQ,EAAJa,IAI7B2/C,EAAGxgD,EAAI,EACPwgD,EAAGG,GAAKF,EAAK,KACbD,EAAGI,GAAKH,EAAK,KACbD,EAAGK,GAAKJ,EAAK,KACbD,EAAGG,IAAMF,EAAKF,GACVC,EAAGG,GAAK,IAAKH,EAAGG,IAAM,GAC1BH,EAAGI,IAAMH,EAAKF,GACVC,EAAGI,GAAK,IAAKJ,EAAGI,IAAM,GAC1BJ,EAAGK,IAAMJ,EAAKF,GACVC,EAAGK,GAAK,IAAKL,EAAGK,IAAM,GAC1BJ,EAAO,KAGT,SAASrvB,EAAKrtB,EAAGlD,GAKf,OAJAA,EAAEb,EAAI+D,EAAE/D,EACRa,EAAE8/C,GAAK58C,EAAE48C,GACT9/C,EAAE+/C,GAAK78C,EAAE68C,GACT//C,EAAEggD,GAAK98C,EAAE88C,GACFhgD,EAGT,SAASigD,EAAKP,EAAMQ,GAClB,IAAIC,EAAK,IAAIV,EAAKC,GACdh2C,EAAQw2C,GAAQA,EAAKx2C,MACrB02C,EAAOD,EAAGrhC,KAUd,OATAshC,EAAKC,MAAQ,WAAa,OAAoB,WAAZF,EAAGrhC,OAAwB,GAC7DshC,EAAKE,OAAS,WACZ,OAAOF,IAAmC,uBAAhB,QAATA,IAAoB,IAEvCA,EAAKG,MAAQH,EACT12C,IACmB,iBAAX,GAAqB6mB,EAAK7mB,EAAOy2C,GAC3CC,EAAK12C,MAAQ,WAAa,OAAO6mB,EAAK4vB,EAAI,MAErCC,EAyBL7hD,GAAUA,EAAOD,QACnBC,EAAOD,QAAU2hD,EACR,OAAU,WACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElCvhD,KAAKkrC,KAAOqW,EA7Ed,CAiFEvhD,EAC+BH,EAC/B,S,sCC9GF,mBAGA,SAAUiD,EAAQjD,EAAQC,GAE1B,SAASgiD,EAAOd,GACd,IAAIC,EAAKjhD,KAAM+hD,EAAU,GAEzBd,EAAG1zC,EAAI,EACP0zC,EAAGjpC,EAAI,EACPipC,EAAGxqC,EAAI,EACPwqC,EAAG57B,EAAI,EAGP47B,EAAG7gC,KAAO,WACR,IAAI9e,EAAI2/C,EAAG1zC,EAAK0zC,EAAG1zC,GAAK,GAIxB,OAHA0zC,EAAG1zC,EAAI0zC,EAAGjpC,EACVipC,EAAGjpC,EAAIipC,EAAGxqC,EACVwqC,EAAGxqC,EAAIwqC,EAAG57B,EACH47B,EAAG57B,GAAM47B,EAAG57B,IAAM,GAAM/jB,EAAKA,IAAM,GAGxC0/C,KAAiB,EAAPA,GAEZC,EAAG1zC,EAAIyzC,EAGPe,GAAWf,EAIb,IAAK,IAAIvwC,EAAI,EAAGA,EAAIsxC,EAAQl+C,OAAS,GAAI4M,IACvCwwC,EAAG1zC,GAA6B,EAAxBw0C,EAAQ3tC,WAAW3D,GAC3BwwC,EAAG7gC,OAIP,SAASyR,EAAKrtB,EAAGlD,GAKf,OAJAA,EAAEiM,EAAI/I,EAAE+I,EACRjM,EAAE0W,EAAIxT,EAAEwT,EACR1W,EAAEmV,EAAIjS,EAAEiS,EACRnV,EAAE+jB,EAAI7gB,EAAE6gB,EACD/jB,EAGT,SAASigD,EAAKP,EAAMQ,GAClB,IAAIC,EAAK,IAAIK,EAAOd,GAChBh2C,EAAQw2C,GAAQA,EAAKx2C,MACrB02C,EAAO,WAAa,OAAQD,EAAGrhC,SAAW,GAAK,YAenD,OAdAshC,EAAKE,OAAS,WACZ,GACE,IAEI32C,IAFMw2C,EAAGrhC,SAAW,KACbqhC,EAAGrhC,SAAW,GAAK,aACF,GAAK,UACf,IAAXnV,GACT,OAAOA,GAETy2C,EAAKC,MAAQF,EAAGrhC,KAChBshC,EAAKG,MAAQH,EACT12C,IACmB,iBAAX,GAAqB6mB,EAAK7mB,EAAOy2C,GAC3CC,EAAK12C,MAAQ,WAAa,OAAO6mB,EAAK4vB,EAAI,MAErCC,EAGL7hD,GAAUA,EAAOD,QACnBC,EAAOD,QAAU2hD,EACR,OAAU,WACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElCvhD,KAAKmrC,OAASoW,EApEhB,CAwEEvhD,EAC+BH,EAC/B,S,sCC7EF,mBAGA,SAAUiD,EAAQjD,EAAQC,GAE1B,SAASgiD,EAAOd,GACd,IAAIC,EAAKjhD,KAAM+hD,EAAU,GAGzBd,EAAG7gC,KAAO,WACR,IAAI9e,EAAK2/C,EAAG1zC,EAAK0zC,EAAG1zC,IAAM,EAE1B,OADA0zC,EAAG1zC,EAAI0zC,EAAGjpC,EAAGipC,EAAGjpC,EAAIipC,EAAGxqC,EAAGwqC,EAAGxqC,EAAIwqC,EAAG57B,EAAG47B,EAAG57B,EAAI47B,EAAGxiC,GACzCwiC,EAAGvgD,EAAKugD,EAAGvgD,EAAI,OAAS,IAC5BugD,EAAGxiC,EAAKwiC,EAAGxiC,EAAKwiC,EAAGxiC,GAAK,EAAOnd,EAAKA,GAAK,GAAO,GAGtD2/C,EAAG1zC,EAAI,EACP0zC,EAAGjpC,EAAI,EACPipC,EAAGxqC,EAAI,EACPwqC,EAAG57B,EAAI,EACP47B,EAAGxiC,EAAI,EAEHuiC,KAAiB,EAAPA,GAEZC,EAAG1zC,EAAIyzC,EAGPe,GAAWf,EAIb,IAAK,IAAIvwC,EAAI,EAAGA,EAAIsxC,EAAQl+C,OAAS,GAAI4M,IACvCwwC,EAAG1zC,GAA6B,EAAxBw0C,EAAQ3tC,WAAW3D,GACvBA,GAAKsxC,EAAQl+C,SACfo9C,EAAGvgD,EAAIugD,EAAG1zC,GAAK,GAAK0zC,EAAG1zC,IAAM,GAE/B0zC,EAAG7gC,OAIP,SAASyR,EAAKrtB,EAAGlD,GAOf,OANAA,EAAEiM,EAAI/I,EAAE+I,EACRjM,EAAE0W,EAAIxT,EAAEwT,EACR1W,EAAEmV,EAAIjS,EAAEiS,EACRnV,EAAE+jB,EAAI7gB,EAAE6gB,EACR/jB,EAAEmd,EAAIja,EAAEia,EACRnd,EAAEZ,EAAI8D,EAAE9D,EACDY,EAGT,SAASigD,EAAKP,EAAMQ,GAClB,IAAIC,EAAK,IAAIK,EAAOd,GAChBh2C,EAAQw2C,GAAQA,EAAKx2C,MACrB02C,EAAO,WAAa,OAAQD,EAAGrhC,SAAW,GAAK,YAenD,OAdAshC,EAAKE,OAAS,WACZ,GACE,IAEI32C,IAFMw2C,EAAGrhC,SAAW,KACbqhC,EAAGrhC,SAAW,GAAK,aACF,GAAK,UACf,IAAXnV,GACT,OAAOA,GAETy2C,EAAKC,MAAQF,EAAGrhC,KAChBshC,EAAKG,MAAQH,EACT12C,IACmB,iBAAX,GAAqB6mB,EAAK7mB,EAAOy2C,GAC3CC,EAAK12C,MAAQ,WAAa,OAAO6mB,EAAK4vB,EAAI,MAErCC,EAGL7hD,GAAUA,EAAOD,QACnBC,EAAOD,QAAU2hD,EACR,OAAU,WACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElCvhD,KAAKorC,OAASmW,EAzEhB,CA6EEvhD,EAC+BH,EAC/B,S,sCClFF,mBAKA,SAAUiD,EAAQjD,EAAQC,GAE1B,SAASgiD,EAAOd,GACd,IAAIC,EAAKjhD,KAGTihD,EAAG7gC,KAAO,WAER,IAAwB9e,EAAGmd,EAAvBujC,EAAIf,EAAG1zC,EAAGnN,EAAI6gD,EAAG7gD,EAQrB,OAPAkB,EAAI0gD,EAAE5hD,GAAoBqe,GAAhBnd,GAAMA,IAAM,GAAaA,GAAK,GACpBmd,IAApBnd,EAAI0gD,EAAG5hD,EAAI,EAAK,IAAckB,IAAM,GAChBmd,IAApBnd,EAAI0gD,EAAG5hD,EAAI,EAAK,IAAckB,IAAM,EAChBmd,IAApBnd,EAAI0gD,EAAG5hD,EAAI,EAAK,IAAckB,GAAK,EACnCA,EAAI0gD,EAAG5hD,EAAI,EAAK,GAAuBqe,IAAnBnd,GAASA,GAAK,IAAeA,GAAK,EACtD0gD,EAAE5hD,GAAKqe,EACPwiC,EAAG7gD,EAAKA,EAAI,EAAK,EACVqe,GAGT,SAAcwiC,EAAID,GAChB,IAAI7rC,EAAM6sC,EAAI,GAEd,GAAIhB,KAAiB,EAAPA,GAERgB,EAAE,GAAKhB,OAIX,IADAA,EAAO,GAAKA,EACP7rC,EAAI,EAAGA,EAAI6rC,EAAKn9C,SAAUsR,EAC7B6sC,EAAM,EAAJ7sC,GAAU6sC,EAAM,EAAJ7sC,IAAU,GACnB6rC,EAAK5sC,WAAWe,GAAK6sC,EAAG7sC,EAAI,EAAK,IAAM,GAIhD,KAAO6sC,EAAEn+C,OAAS,GAAGm+C,EAAEvmC,KAAK,GAC5B,IAAKtG,EAAI,EAAGA,EAAI,GAAc,IAAT6sC,EAAE7sC,KAAYA,GAOnC,IANS,GAALA,EAAY6sC,EAAE,IAAM,EAAYA,EAAE7sC,GAEtC8rC,EAAG1zC,EAAIy0C,EACPf,EAAG7gD,EAAI,EAGF+U,EAAI,IAAKA,EAAI,IAAKA,EACrB8rC,EAAG7gC,OAIP2wB,CAAKkQ,EAAID,GAGX,SAASnvB,EAAKrtB,EAAGlD,GAGf,OAFAA,EAAEiM,EAAI/I,EAAE+I,EAAE6C,QACV9O,EAAElB,EAAIoE,EAAEpE,EACDkB,EAGT,SAASigD,EAAKP,EAAMQ,GACN,MAARR,IAAcA,GAAQ,IAAKpsB,MAC/B,IAAI6sB,EAAK,IAAIK,EAAOd,GAChBh2C,EAAQw2C,GAAQA,EAAKx2C,MACrB02C,EAAO,WAAa,OAAQD,EAAGrhC,SAAW,GAAK,YAenD,OAdAshC,EAAKE,OAAS,WACZ,GACE,IAEI32C,IAFMw2C,EAAGrhC,SAAW,KACbqhC,EAAGrhC,SAAW,GAAK,aACF,GAAK,UACf,IAAXnV,GACT,OAAOA,GAETy2C,EAAKC,MAAQF,EAAGrhC,KAChBshC,EAAKG,MAAQH,EACT12C,IACEA,EAAMuC,GAAGskB,EAAK7mB,EAAOy2C,GACzBC,EAAK12C,MAAQ,WAAa,OAAO6mB,EAAK4vB,EAAI,MAErCC,EAGL7hD,GAAUA,EAAOD,QACnBC,EAAOD,QAAU2hD,EACR,OAAU,WACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElCvhD,KAAKqrC,UAAYkW,EAnFnB,CAuFEvhD,EAC+BH,EAC/B,S,sCC9FF,mBAyBA,SAAUiD,EAAQjD,EAAQC,GAE1B,SAASgiD,EAAOd,GACd,IAAIC,EAAKjhD,KAGTihD,EAAG7gC,KAAO,WACR,IACwB9e,EAAGmd,EADvB4G,EAAI47B,EAAG57B,EACP28B,EAAIf,EAAGe,EAAG5hD,EAAI6gD,EAAG7gD,EAcrB,OAZA6gD,EAAG57B,EAAIA,EAAKA,EAAI,WAAc,EAE9B5G,EAAIujC,EAAG5hD,EAAI,GAAM,KACjBkB,EAAI0gD,EAAE5hD,EAAMA,EAAI,EAAK,KACrBqe,GAAKA,GAAK,GACVnd,GAAKA,GAAK,GACVmd,GAAKA,IAAM,GACXnd,GAAKA,IAAM,GAEXmd,EAAIujC,EAAE5hD,GAAKqe,EAAInd,EACf2/C,EAAG7gD,EAAIA,EAECqe,GAAK4G,EAAKA,IAAM,IAAQ,GAGlC,SAAc47B,EAAID,GAChB,IAAI1/C,EAAGmd,EAAGre,EAAG+U,EAAGkQ,EAAG28B,EAAI,GAAIvgC,EAAQ,IAYnC,IAXIu/B,KAAiB,EAAPA,IAEZviC,EAAIuiC,EACJA,EAAO,OAGPA,GAAc,KACdviC,EAAI,EACJgD,EAAQhf,KAAK0N,IAAIsR,EAAOu/B,EAAKn9C,SAG1BzD,EAAI,EAAG+U,GAAK,GAAIA,EAAIsM,IAAStM,EAE5B6rC,IAAMviC,GAAKuiC,EAAK5sC,YAAYe,EAAI,IAAM6rC,EAAKn9C,SAErC,IAANsR,IAASkQ,EAAI5G,GACjBA,GAAKA,GAAK,GACVA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,GAAKA,IAAM,GACPtJ,GAAK,IACPkQ,EAAKA,EAAI,WAAc,EAEvBjlB,EAAK,IADLkB,EAAK0gD,EAAM,IAAJ7sC,IAAasJ,EAAI4G,GACTjlB,EAAI,EAAI,GAW3B,IAPIA,GAAK,MACP4hD,EAA+B,KAA5BhB,GAAQA,EAAKn9C,QAAU,KAAa,GAKzCzD,EAAI,IACC+U,EAAI,IAASA,EAAI,IAAKA,EACzBsJ,EAAIujC,EAAG5hD,EAAI,GAAM,KACjBkB,EAAI0gD,EAAE5hD,EAAMA,EAAI,EAAK,KACrBqe,GAAKA,GAAK,GACVnd,GAAKA,GAAK,GACVmd,GAAKA,IAAM,GACXnd,GAAKA,IAAM,GACX0gD,EAAE5hD,GAAKqe,EAAInd,EAGb2/C,EAAG57B,EAAIA,EACP47B,EAAGe,EAAIA,EACPf,EAAG7gD,EAAIA,EAGT2wC,CAAKkQ,EAAID,GAGX,SAASnvB,EAAKrtB,EAAGlD,GAIf,OAHAA,EAAElB,EAAIoE,EAAEpE,EACRkB,EAAE+jB,EAAI7gB,EAAE6gB,EACR/jB,EAAE0gD,EAAIx9C,EAAEw9C,EAAE5xC,QACH9O,EAGT,SAASigD,EAAKP,EAAMQ,GACN,MAARR,IAAcA,GAAQ,IAAKpsB,MAC/B,IAAI6sB,EAAK,IAAIK,EAAOd,GAChBh2C,EAAQw2C,GAAQA,EAAKx2C,MACrB02C,EAAO,WAAa,OAAQD,EAAGrhC,SAAW,GAAK,YAenD,OAdAshC,EAAKE,OAAS,WACZ,GACE,IAEI32C,IAFMw2C,EAAGrhC,SAAW,KACbqhC,EAAGrhC,SAAW,GAAK,aACF,GAAK,UACf,IAAXnV,GACT,OAAOA,GAETy2C,EAAKC,MAAQF,EAAGrhC,KAChBshC,EAAKG,MAAQH,EACT12C,IACEA,EAAMg3C,GAAGnwB,EAAK7mB,EAAOy2C,GACzBC,EAAK12C,MAAQ,WAAa,OAAO6mB,EAAK4vB,EAAI,MAErCC,EAGL7hD,GAAUA,EAAOD,QACnBC,EAAOD,QAAU2hD,EACR,OAAU,WACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElCvhD,KAAKsrC,QAAUiW,EAjHjB,CAqHEvhD,EAC+BH,EAC/B,S,sCChJF,mBAIA,SAAUiD,EAAQjD,EAAQC,GAE1B,SAASgiD,EAAOd,GACd,IAAIC,EAAKjhD,KAAM+hD,EAAU,GAGzBd,EAAG7gC,KAAO,WACR,IAAIlK,EAAI+qC,EAAG/qC,EAAGzV,EAAIwgD,EAAGxgD,EAAGC,EAAIugD,EAAGvgD,EAAGuV,EAAIgrC,EAAGhrC,EAQzC,OAPAC,EAAKA,GAAK,GAAOA,IAAM,EAAKzV,EAC5BA,EAAKA,EAAIC,EAAK,EACdA,EAAKA,GAAK,GAAOA,IAAM,EAAKuV,EAC5BA,EAAKA,EAAIC,EAAK,EACd+qC,EAAG/qC,EAAIA,EAAKA,GAAK,GAAOA,IAAM,GAAMzV,EACpCwgD,EAAGxgD,EAAIA,EAAKA,EAAIC,EAAK,EACrBugD,EAAGvgD,EAAKA,GAAK,GAAOD,IAAM,GAAMwV,EACzBgrC,EAAGhrC,EAAKA,EAAIC,EAAK,GAmB1B+qC,EAAGhrC,EAAI,EACPgrC,EAAG/qC,EAAI,EACP+qC,EAAGxgD,GAAI,WACPwgD,EAAGvgD,EAAI,WAEHsgD,IAASv+C,KAAKwW,MAAM+nC,IAEtBC,EAAGhrC,EAAK+qC,EAAO,WAAe,EAC9BC,EAAG/qC,EAAW,EAAP8qC,GAGPe,GAAWf,EAIb,IAAK,IAAIvwC,EAAI,EAAGA,EAAIsxC,EAAQl+C,OAAS,GAAI4M,IACvCwwC,EAAG/qC,GAA6B,EAAxB6rC,EAAQ3tC,WAAW3D,GAC3BwwC,EAAG7gC,OAIP,SAASyR,EAAKrtB,EAAGlD,GAKf,OAJAA,EAAE2U,EAAIzR,EAAEyR,EACR3U,EAAE4U,EAAI1R,EAAE0R,EACR5U,EAAEb,EAAI+D,EAAE/D,EACRa,EAAEZ,EAAI8D,EAAE9D,EACDY,EAGT,SAASigD,EAAKP,EAAMQ,GAClB,IAAIC,EAAK,IAAIK,EAAOd,GAChBh2C,EAAQw2C,GAAQA,EAAKx2C,MACrB02C,EAAO,WAAa,OAAQD,EAAGrhC,SAAW,GAAK,YAenD,OAdAshC,EAAKE,OAAS,WACZ,GACE,IAEI32C,IAFMw2C,EAAGrhC,SAAW,KACbqhC,EAAGrhC,SAAW,GAAK,aACF,GAAK,UACf,IAAXnV,GACT,OAAOA,GAETy2C,EAAKC,MAAQF,EAAGrhC,KAChBshC,EAAKG,MAAQH,EACT12C,IACmB,iBAAX,GAAqB6mB,EAAK7mB,EAAOy2C,GAC3CC,EAAK12C,MAAQ,WAAa,OAAO6mB,EAAK4vB,EAAI,MAErCC,EAGL7hD,GAAUA,EAAOD,QACnBC,EAAOD,QAAU2hD,EACR,OAAU,WACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElCvhD,KAAKurC,OAASgW,EAzFhB,CA6FEvhD,EAC+BH,EAC/B,S,qCCnGF,OAwBA,SAAWiD,EAAQm/C,EAAMC,GAKzB,IAQIC,EAJAC,EAAaF,EAAK7qC,IAJV,IACC,GAITgrC,EAAeH,EAAK7qC,IAAI,EAHf,IAITirC,EAA0B,EAAfD,EAQf,SAASE,EAAWvB,EAAMp8C,EAAS4lC,GACjC,IAAI7oC,EAAM,GAIN6gD,EAAYC,EAmHlB,SAASC,EAAQz/C,EAAK0/C,GACpB,IAAqCC,EAAjC33C,EAAS,GAAI43C,SAAc5/C,EAC/B,GAAI0/C,GAAgB,UAAPE,EACX,IAAKD,KAAQ3/C,EACX,IAAMgI,EAAOwQ,KAAKinC,EAAQz/C,EAAI2/C,GAAOD,EAAQ,IAAO,MAAOlgC,IAG/D,OAAQxX,EAAOpH,OAASoH,EAAgB,UAAP43C,EAAkB5/C,EAAMA,EAAM,KA1HxCy/C,EAHvB99C,EAAsB,GAAXA,EAAmB,CAAEk+C,SAAS,GAAUl+C,GAAW,IAIpDk+C,QAAU,CAAC9B,EAAM+B,EAASd,IACzB,MAARjB,EA8IL,WACE,IACE,IAAItxB,EAQJ,OAPIyyB,IAAezyB,EAAMyyB,EAAW7wB,aAElC5B,EAAMA,EAxKA,MA0KNA,EAAM,IAAIszB,WA1KJ,MA2KLlgD,EAAOuhB,QAAUvhB,EAAOmgD,UAAU5xB,gBAAgB3B,IAE9CqzB,EAASrzB,GAChB,MAAOjN,GACP,IAAIygC,EAAUpgD,EAAOqgD,UACjBC,EAAUF,GAAWA,EAAQE,QACjC,MAAO,EAAE,IAAIxuB,KAAM9xB,EAAQsgD,EAAStgD,EAAOugD,OAAQN,EAASd,KA5J3CqB,GAAatC,EAAM,GAAIr/C,GAGtC4hD,EAAO,IAAIC,EAAK7hD,GAIhB+/C,EAAO,WAIT,IAHA,IAAI7/C,EAAI0hD,EAAKlM,EA5BJ,GA6BL32C,EAAI0hD,EACJ70C,EAAI,EACD1L,EAAIwgD,GACTxgD,EAjCM,KAiCDA,EAAI0L,GACT7M,GAlCM,IAmCN6M,EAAIg2C,EAAKlM,EAAE,GAEb,KAAOx1C,GAAKygD,GACVzgD,GAAK,EACLnB,GAAK,EACL6M,KAAO,EAET,OAAQ1L,EAAI0L,GAAK7M,GAWnB,OARAghD,EAAKC,MAAQ,WAAa,OAAmB,EAAZ4B,EAAKlM,EAAE,IACxCqK,EAAKG,MAAQ,WAAa,OAAO0B,EAAKlM,EAAE,GAAK,YAC7CqK,EAAKE,OAASF,EAGde,EAAOM,EAASQ,EAAKjhC,GAAI2/B,IAGjBr9C,EAAQ6+C,MAAQjZ,GACpB,SAASkX,EAAMV,EAAM0C,EAAc14C,GAUjC,OATIA,IAEEA,EAAMsX,GAAKuP,EAAK7mB,EAAOu4C,GAE3B7B,EAAK12C,MAAQ,WAAa,OAAO6mB,EAAK0xB,EAAM,MAK1CG,GAAgBxB,EAAY,OAAIR,EAAaV,GAIrCU,IAElBA,EACAc,EACA,WAAY59C,EAAUA,EAAQ9B,OAAU9C,MAAQkiD,EAChDt9C,EAAQoG,OAaV,SAASw4C,EAAK7hD,GACZ,IAAIL,EAAGqiD,EAAShiD,EAAIkC,OAChBo9C,EAAKjhD,KAAMI,EAAI,EAAG+U,EAAI8rC,EAAG7gD,EAAI6gD,EAAG9rC,EAAI,EAAGhT,EAAI8+C,EAAG3+B,EAAI,GAMtD,IAHKqhC,IAAUhiD,EAAM,CAACgiD,MAGfvjD,EA9FG,KA+FR+B,EAAE/B,GAAKA,IAET,IAAKA,EAAI,EAAGA,EAjGF,IAiGaA,IACrB+B,EAAE/B,GAAK+B,EAAEgT,EA3FFyuC,IA2FczuC,EAAIxT,EAAIvB,EAAIujD,IAAWriD,EAAIa,EAAE/B,KAClD+B,EAAEgT,GAAK7T,GAIR2/C,EAAG5J,EAAI,SAAS1G,GAIf,IAFA,IAAIrvC,EAAGJ,EAAI,EACPd,EAAI6gD,EAAG7gD,EAAG+U,EAAI8rC,EAAG9rC,EAAGhT,EAAI8+C,EAAG3+B,EACxBquB,KACLrvC,EAAIa,EAAE/B,EArGDwjD,IAqGaxjD,EAAI,GACtBc,EA7GM,IA6GFA,EAAYiB,EAtGXyhD,KAsGsBzhD,EAAE/B,GAAK+B,EAAEgT,EAtG/ByuC,IAsG2CzuC,EAAI7T,KAAQa,EAAEgT,GAAK7T,IAGrE,OADA2/C,EAAG7gD,EAAIA,EAAG6gD,EAAG9rC,EAAIA,EACVjU,IAhHC,KA2HZ,SAAS2wB,EAAKrtB,EAAGlD,GAIf,OAHAA,EAAElB,EAAIoE,EAAEpE,EACRkB,EAAE6T,EAAI3Q,EAAE2Q,EACR7T,EAAEghB,EAAI9d,EAAE8d,EAAElS,QACH9O,EAsBT,SAASmhD,EAAOzB,EAAMr/C,GAEpB,IADA,IAA4BkiD,EAAxBC,EAAa9C,EAAO,GAAW7rC,EAAI,EAChCA,EAAI2uC,EAAWjgD,QACpBlC,EAjJOiiD,IAiJIzuC,GAjJJyuC,KAkJIC,GAAyB,GAAhBliD,EAlJbiiD,IAkJwBzuC,IAAW2uC,EAAW1vC,WAAWe,KAElE,OAAO4tC,EAASphD,GA8BlB,SAASohD,EAAS9sC,GAChB,OAAO7L,OAAOoU,aAAa5X,MAAM,EAAGqP,GAgBtC,GANAwsC,EAAOP,EAAKvwB,SAAUswB,GAMapiD,EAAOD,QAAS,CACjDC,EAAOD,QAAU2iD,EAEjB,IACEJ,EAAa,EAAQ,KACrB,MAAO4B,eAE+B,KAAxC,aAAoB,OAAOxB,GAAa,8BAtN1C,CAiOmB,oBAAT1/C,KAAwBA,KAAO7C,KACvC,GACAyC,O,gCC3PM,EAAQ,EAKhBW,CAAE,CAAEG,OAAQ,SAAUC,OAAO,GAAQ,CACnC2sC,OALW,EAAQ,Q,stgBCad,SAAS6T,EAAUz2C,GACxB,MAAoB,iBAANA,EAGT,SAAS02C,EAAa12C,GAC3B,SACGA,GAAkB,WAAb,IAAOA,IACY,mBAAlBA,EAAEpK,gBAMS,IAAlBoK,EAAE02C,aACiC,WAAnC,IAAO12C,EAAEpK,YAAYnB,aACmB,IAAxCuL,EAAEpK,YAAYnB,UAAUiiD,aAMW,mBAA5B12C,EAAEpK,YAAY2hB,YACU,IAA/BvX,EAAEpK,YAAY2hB,UAAUvX,IAQrB,SAAS22C,EAAW32C,GACzB,OAAQA,GAAkB,WAAb,IAAOA,KAAyD,IAAvCzM,OAAOw8B,eAAe/vB,GAAG22C,YAAuB,EAGjF,SAASC,EAAY52C,GAC1B,OAAQA,GAAkB,WAAb,IAAOA,KAA0D,IAAxCzM,OAAOw8B,eAAe/vB,GAAG42C,aAAwB,EAGlF,SAASC,EAAQ72C,GACtB,OAAQA,IAAwC,IAAnCA,EAAEpK,YAAYnB,UAAUoiD,SAAoB,EAGpD,SAASC,EAAU92C,GACxB,MAAoB,iBAANA,EAGT,IAAMoC,EAAUO,MAAMP,QAEtB,SAAS20C,EAAU/2C,GACxB,OAAQA,IAA0C,IAArCA,EAAEpK,YAAYnB,UAAUsiD,WAAsB,EAQtD,SAASC,EAAch3C,GAC5B,OAAO2C,MAAMP,QAAQpC,IAAM+2C,EAAS/2C,GAG/B,SAASi3C,EAAej3C,GAC7B,OAAQA,GAAKA,EAAEi3C,gBAAsD,IAArCj3C,EAAEpK,YAAYnB,UAAUsiD,WAAsB,EAGzE,SAASG,EAAgBl3C,GAC9B,OAAQA,GAAKA,EAAEk3C,iBAAuD,IAArCl3C,EAAEpK,YAAYnB,UAAUsiD,WAAsB,EAG1E,SAASI,EAASn3C,GACvB,OAAQA,IAAyC,IAApCA,EAAEpK,YAAYnB,UAAU0iD,UAAqB,EAGrD,SAASC,EAASp3C,GACvB,OAAQA,IAAyC,IAApCA,EAAEpK,YAAYnB,UAAU2iD,UAAqB,EAGrD,SAASC,EAAWr3C,GACzB,MAAoB,kBAANA,EAGT,SAASs3C,EAAat3C,GAC3B,OAAQA,IAA6C,IAAxCA,EAAEpK,YAAYnB,UAAU6iD,cAAyB,EAGzD,SAASC,EAAQv3C,GACtB,OAAQA,IAAwC,IAAnCA,EAAEpK,YAAYnB,UAAU8iD,SAAoB,EAGpD,SAASC,EAAYx3C,GAC1B,MAAoB,mBAANA,EAGT,SAASy3C,EAAQz3C,GACtB,OAAOA,aAAaqnB,KAGf,SAAS/T,EAAUtT,GACxB,OAAOA,aAAavH,OAGf,SAAS0B,EAAU6F,GACxB,SAAUA,GACK,WAAb,IAAOA,IACPA,EAAEpK,cAAgBrC,QACjBojD,EAAU32C,IACV42C,EAAW52C,IAGT,SAAS03C,EAAQ13C,GACtB,OAAa,OAANA,EAGF,SAAS23C,EAAa33C,GAC3B,YAAazJ,IAANyJ,EAGF,SAAS43C,EAAgB53C,GAC9B,OAAQA,IAA0B,IAArBA,EAAE43C,iBAA8D,IAAnC53C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGjF,SAASC,EAAa93C,GAC3B,OAAQA,IAAuB,IAAlBA,EAAE83C,cAA2D,IAAnC93C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAG9E,SAASE,EAAkB/3C,GAChC,OAAQA,IAA4B,IAAvBA,EAAE+3C,mBAAgE,IAAnC/3C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGnF,SAASG,EAAah4C,GAC3B,OAAQA,IAAuB,IAAlBA,EAAEg4C,cAA2D,IAAnCh4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAG9E,SAASI,EAAmBj4C,GACjC,OAAQA,IAA6B,IAAxBA,EAAEi4C,oBAAiE,IAAnCj4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGpF,SAASK,EAAgBl4C,GAC9B,OAAQA,IAA0B,IAArBA,EAAEk4C,iBAA8D,IAAnCl4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGjF,SAASM,EAA0Bn4C,GACxC,OAAQA,IAAoC,IAA/BA,EAAEm4C,2BAAwE,IAAnCn4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAG3F,SAASO,EAAgBp4C,GAC9B,OAAQA,IAA0B,IAArBA,EAAEo4C,iBAA8D,IAAnCp4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGjF,SAASQ,EAAar4C,GAC3B,OAAQA,IAAuB,IAAlBA,EAAEq4C,cAA2D,IAAnCr4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAG9E,SAASA,EAAQ73C,GACtB,OAAQA,IAAkB,IAAbA,EAAE63C,SAAsD,IAAnC73C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGzE,SAASS,EAAct4C,GAC5B,OAAQA,IAAwB,IAAnBA,EAAEs4C,eAA4D,IAAnCt4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAG/E,SAASU,EAAgBv4C,GAC9B,OAAQA,IAA0B,IAArBA,EAAEu4C,iBAA8D,IAAnCv4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGjF,SAASW,EAAmBx4C,GACjC,OAAQA,IAA6B,IAAxBA,EAAEw4C,oBAAiE,IAAnCx4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAGpF,SAASY,EAAaz4C,GAC3B,OAAQA,IAAuB,IAAlBA,EAAEy4C,cAA2D,IAAnCz4C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAG9E,SAASa,EAAc14C,GAC5B,OAAQA,IAAwB,IAAnBA,EAAE04C,eAA4D,IAAnC14C,EAAEpK,YAAYnB,UAAUojD,SAAoB,EAG/E,SAASc,EAAS34C,GACvB,OAAQA,IAAyC,IAApCA,EAAEpK,YAAYnB,UAAUkkD,UAAqB,EAGrD,SAASC,EAAQ54C,GACtB,IAAMjM,EAAI,IAAOiM,GAEjB,MAAU,WAANjM,EAEQ,OAANiM,EAAmB,OACnB2C,MAAMP,QAAQpC,GAAW,QACzBA,aAAaqnB,KAAa,OAC1BrnB,aAAavH,OAAe,SAG5Bi+C,EAAY12C,GAAW,YACvB22C,EAAU32C,GAAW,UACrB42C,EAAW52C,GAAW,WACtB+2C,EAAS/2C,GAAW,SACpB62C,EAAO72C,GAAW,OAClBo3C,EAAQp3C,GAAW,QACnBm3C,EAAQn3C,GAAW,QACnBs3C,EAAYt3C,GAAW,YACvB63C,EAAO73C,GAAWA,EAAET,KACpBo5C,EAAQ34C,GAAW,QACnBu3C,EAAOv3C,GAAW,OAEf,SAGC,aAANjM,EAAyB,WAEtBA,E,sKCpNF,SAASkpB,EAAWnpB,GACzB,MAAqB,kBAAVA,KAIJsV,SAAStV,IACXA,IAAUoB,KAAKyW,MAAM7X,GASrB,IAAMiuB,EAAuB7sB,KAAK6sB,MAAQ,SAAU/hB,GACzD,OAAIA,EAAI,EACC,EACEA,EAAI,GACL,EAED,GASEkkB,EAAuBhvB,KAAKgvB,MAAQ,SAAelkB,GAC9D,OAAO9K,KAAK6T,IAAI/I,GAAK9K,KAAK8T,KAQfmb,EAAwBjvB,KAAKivB,OAAS,SAAgBnkB,GACjE,OAAO9K,KAAK6T,IAAI/I,GAAK9K,KAAKmhB,MAQfgsB,EAAwBntC,KAAKmtC,OAAS,SAAUriC,GAC3D,OAAO9K,KAAK6T,IAAI/I,EAAI,IAYTsa,EAAuBplB,KAAKolB,MAAQ,SAAeta,GAC9D,GAAU,IAANA,EACF,OAAOA,EAGT,IACItC,EADEm7C,EAAS74C,EAAI,EAcnB,OAZI64C,IACF74C,GAAKA,GAMLtC,EAHE0L,SAASpJ,IAGDA,IAFVtC,EAASxI,KAAKmT,IAAInT,KAAK6T,IAAI/I,GAAK,IAERtC,GAAW,EAAIA,GAAW,EAEzCsC,EAGJ64C,GAAUn7C,EAASA,GAQf2M,EAAwBnV,KAAKmV,OAAS,SAAgBrK,GACjE,OAAQA,GAAK,MAAQA,IAAM,KACvB9K,KAAKmT,IAAIrI,GAAK,EACdA,EAAIA,EAAIA,EAAI,EAAIA,EAAIA,EAAIA,EAAI,GAUlC,SAAS84C,GAAoBxkD,EAAGopB,EAAMykB,GACpC,IACM4W,EADW,CAAEC,EAAG,KAAMC,EAAG,KAAMC,GAAI,MACjBx7B,GACpBy7B,EAAS,GACb,GAAIhX,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI9xB,MAAM,kCAElB,IAAK4M,EAAUklB,GACb,MAAM,IAAI9xB,MAAM,2BAElB,GAAI/b,EAAI,WAAM6tC,EAAO,GAAK,GAAK7tC,GAAK,KAAD,IAAE,EAAM6tC,EAAO,GAChD,MAAM,IAAI9xB,MAAJ,qCAAwC8xB,EAAO,EAA/C,eAAuDA,EAAO,EAA9D,QAER,IAAKllB,EAAU3oB,GACb,MAAM,IAAI+b,MAAM,4BAEd/b,EAAI,IACNA,GAAQ,KAAH,IAAG,EAAK6tC,IAEfgX,EAAS,IAAH,OAAOhX,GAEf,IAAIpgB,EAAO,GAKX,OAJIztB,EAAI,IACNA,GAAKA,EACLytB,EAAO,KAET,UAAUA,GAAV,OAAiBg3B,GAAjB,OAA0BzkD,EAAES,SAAS2oB,IAArC,OAA6Cy7B,GAuFxC,SAASC,GAAQtlD,EAAOuD,GAC7B,GAAuB,mBAAZA,EAET,OAAOA,EAAQvD,GAIjB,GAAIA,IAAU8W,IACZ,MAAO,WACF,GAAI9W,KAAW8W,IACpB,MAAO,YACF,GAAIjB,MAAM7V,GACf,MAAO,MAIT,IACIyiB,EACA8iC,EAFAC,EAAW,OAIf,GAAIjiD,IAEEA,EAAQiiD,WACVA,EAAWjiD,EAAQiiD,UAIjB7C,EAASp/C,GACXkf,EAAYlf,EACHo/C,EAASp/C,EAAQkf,aAC1BA,EAAYlf,EAAQkf,WAGlBlf,EAAQgiD,UAEgB,iBAD1BA,EAAWhiD,EAAQgiD,WAEjB,MAAM,IAAIhpC,MAAM,sCAMtB,OAAQipC,GACN,IAAK,QACH,OAAO75B,GAAQ3rB,EAAOyiB,GAExB,IAAK,cACH,OAAOmE,GAAc5mB,EAAOyiB,GAE9B,IAAK,cACH,OA4EC,SAAwBziB,EAAOyiB,GACpC,GAAI5M,MAAM7V,KAAWsV,SAAStV,GAC5B,OAAO+I,OAAO/I,GAGhB,IACMylD,EAAUC,GADFC,GAAY3lD,GACSyiB,GAE7BrB,EAAIqkC,EAAQG,SACZxmD,EAAIqmD,EAAQI,aAGZC,EAAS1kC,EAAI,GAAM,EAAIA,EAAKA,EAAI,EAAKA,EAAI,EAAMA,EAAI,EAAKA,EAAKA,EAAI,EAEvE,GAAIuhC,EAASlgC,GAEX,KAAOA,EAAYrjB,EAAEoD,QAAW4e,EAAI0kC,EAAU,EAAI1mD,EAAEoD,QAClDpD,EAAEgb,KAAK,QAMT,IADA,IAAM2rC,EAAe3kD,KAAK2T,IAAIqM,EAAI0kC,IAAW1mD,EAAEoD,OAAS,GAC/CzD,EAAI,EAAGA,EAAIgnD,EAAchnD,IAChCK,EAAEgb,KAAK,GAKX,IAAI4rC,EAAU5kD,KAAK2T,IAAIqM,EAAI0kC,GACvBG,EAAa,EAGjB,KAAOD,EAAU,GACfC,IACAD,IAKF,IAAME,EAAW9mD,EAAE2P,MAAMk3C,GAAY14C,KAAK,IACpC44C,EAAexD,EAASlgC,IAAcyjC,EAAS1jD,QAAW0jD,EAASxwC,MAAM,SAAa,IAAMwwC,EAAY,GAExG/mC,EAAM/f,EAAE2P,MAAM,EAAGk3C,GAAY14C,KAAK,IACtC44C,EACA,KAAO/kC,GAAK,EAAI,IAAM,IAAM0kC,EAAO7kD,WACrC,OAAOwkD,EAAQx3B,KAAO9O,EA1HXinC,CAAcpmD,EAAOyiB,GAE9B,IAAK,MACH,OAAOuiC,GAAmBhlD,EAAO,EAAGulD,GAEtC,IAAK,MACH,OAAOP,GAAmBhlD,EAAO,EAAGulD,GAEtC,IAAK,MACH,OAAOP,GAAmBhlD,EAAO,GAAIulD,GAEvC,IAAK,OAEH,OA6LC,SAAsBvlD,EAAOyiB,EAAWlf,GAC7C,GAAIsS,MAAM7V,KAAWsV,SAAStV,GAC5B,OAAO+I,OAAO/I,GAIhB,IAAMqmD,EAAY9iD,QAAgCd,IAArBc,EAAQ8iD,SAA0B9iD,EAAQ8iD,UAAY,EAC7EC,EAAY/iD,QAAgCd,IAArBc,EAAQ+iD,SAA0B/iD,EAAQ+iD,SAAW,EAE5EzyC,EAAQ8xC,GAAY3lD,GACpBylD,EAAUhjC,EAAYijC,GAAY7xC,EAAO4O,GAAa5O,EAC5D,GAAI4xC,EAAQG,SAAWS,GAAYZ,EAAQG,UAAYU,EAErD,OAAO1/B,GAAc5mB,EAAOyiB,GAE5B,IAAIrjB,EAAIqmD,EAAQI,aACVzkC,EAAIqkC,EAAQG,SAGdxmD,EAAEoD,OAASigB,IACbrjB,EAAIA,EAAEuQ,OAAO42C,GAAM9jC,EAAYrjB,EAAEoD,UAKnCpD,EAAIA,EAAEuQ,OAAO42C,GAAMnlC,EAAIhiB,EAAEoD,OAAS,GAC/BpD,EAAEoD,OAASigB,EAAYA,EAAYrjB,EAAEoD,OAAS,KAGjDpD,EAAImnD,IAAOnlC,GAAGzR,OAAOvQ,GAErB,IAAMonD,EAAMplC,EAAI,EAAIA,EAAI,EAKxB,OAJIolC,EAAMpnD,EAAEoD,OAAS,GACnBpD,EAAE0S,OAAO00C,EAAM,EAAG,EAAG,KAGhBf,EAAQx3B,KAAO7uB,EAAEmO,KAAK,IAjOpBmf,CAAY1sB,EAAOyiB,EAAWlf,GAAWA,GAC7CgV,QAAQ,uBAAuB,WAC9B,IAAMhF,EAAShR,UAAU,GACnB6e,EAAI7e,UAAU,GACpB,MAAmB,MAAXgR,EAAkBA,EAAS6N,EAAIA,KAG7C,QACE,MAAM,IAAI7E,MAAM,qBAAuBipC,EAAvB,qEAWf,SAASG,GAAa3lD,GAE3B,IAAM0V,EAAQ3M,OAAO/I,GAAOwvB,cAAc9Z,MAAM,mCAChD,IAAKA,EACH,MAAM,IAAIhB,YAAY,kBAAoB1U,GAG5C,IAAMiuB,EAAOvY,EAAM,GACbnC,EAASmC,EAAM,GACjBkwC,EAAW9vC,WAAWJ,EAAM,IAAM,KAEhC8wC,EAAMjzC,EAAOsR,QAAQ,KAC3B+gC,IAAsB,IAATY,EAAeA,EAAM,EAAMjzC,EAAO/Q,OAAS,EAExD,IAAMqjD,EAAetyC,EAClBgF,QAAQ,IAAK,IACbA,QAAQ,OAAO,SAAUguC,GAGxB,OADAX,GAAYW,EAAM/jD,OACX,MAER+V,QAAQ,MAAO,IACf1E,MAAM,IACN5R,KAAI,SAAU5C,GACb,OAAOqU,SAASrU,MAQpB,OAL4B,IAAxBwmD,EAAarjD,SACfqjD,EAAazrC,KAAK,GAClBwrC,KAGK,CACL33B,KAAMA,EACN43B,aAAcA,EACdD,SAAUA,GAgEP,SAASj6B,GAAS3rB,EAAOyiB,GAC9B,GAAI5M,MAAM7V,KAAWsV,SAAStV,GAC5B,OAAO+I,OAAO/I,GAGhB,IAAMymD,EAAad,GAAY3lD,GACzBylD,EAAgC,iBAAdhjC,EACpBijC,GAAYe,EAAYA,EAAWb,SAAW,EAAInjC,GAClDgkC,EACArnD,EAAIqmD,EAAQI,aACZhlD,EAAI4kD,EAAQG,SAAW,EAGrBc,EAAK7lD,GAAK4hB,GAAa,GAgB7B,OAfIrjB,EAAEoD,OAASkkD,IACbtnD,EAAIA,EAAEuQ,OAAO42C,GAAMG,EAAKtnD,EAAEoD,UAIxB3B,EAAI,IACNzB,EAAImnD,GAAW,EAAJ1lD,GAAO8O,OAAOvQ,GACzByB,EAAI,GAIFA,EAAIzB,EAAEoD,QACRpD,EAAE0S,OAAOjR,EAAG,EAAU,IAANA,EAAW,KAAO,KAG7B4kD,EAAQx3B,KAAO7uB,EAAEmO,KAAK,IAUxB,SAASqZ,GAAe5mB,EAAOyiB,GACpC,GAAI5M,MAAM7V,KAAWsV,SAAStV,GAC5B,OAAO+I,OAAO/I,GAIhB,IAAM6T,EAAQ8xC,GAAY3lD,GACpBylD,EAAUhjC,EAAYijC,GAAY7xC,EAAO4O,GAAa5O,EACxDzU,EAAIqmD,EAAQI,aACVzkC,EAAIqkC,EAAQG,SAGdxmD,EAAEoD,OAASigB,IACbrjB,EAAIA,EAAEuQ,OAAO42C,GAAM9jC,EAAYrjB,EAAEoD,UAInC,IAAM2Q,EAAQ/T,EAAEmrB,QAChB,OAAOk7B,EAAQx3B,KAAO9a,GAAS/T,EAAEoD,OAAS,EAAK,IAAMpD,EAAEmO,KAAK,IAAO,IACjE,KAAO6T,GAAK,EAAI,IAAM,IAAMA,EA6DzB,SAASskC,GAAa7xC,EAAO4O,GAUlC,IARA,IAAMgjC,EAAU,CACdx3B,KAAMpa,EAAMoa,KACZ43B,aAAchyC,EAAMgyC,aACpBD,SAAU/xC,EAAM+xC,UAEZxmD,EAAIqmD,EAAQI,aAGXpjC,GAAa,GAClBrjB,EAAEyrB,QAAQ,GACV46B,EAAQG,WACRnjC,IAGF,GAAIrjB,EAAEoD,OAASigB,GACGrjB,EAAE0S,OAAO2Q,EAAWrjB,EAAEoD,OAASigB,GAEnC,IAAM,EAAG,CACnB,IAAI1jB,EAAI0jB,EAAY,EAEpB,IADArjB,EAAEL,KACc,KAATK,EAAEL,IACPK,EAAEkrB,MACQ,IAANvrB,IACFK,EAAEyrB,QAAQ,GACV46B,EAAQG,WACR7mD,KAGFK,IADAL,KAMN,OAAO0mD,EAQT,SAASc,GAAO/jD,GAEd,IADA,IAAM4O,EAAM,GACHrS,EAAI,EAAGA,EAAIyD,EAAQzD,IAC1BqS,EAAIgJ,KAAK,GAEX,OAAOhJ,EAyBF,IAAMu1C,GAActxC,OAAOsiC,SAAW,qBAWtC,SAASiP,GAAa16C,EAAGyK,EAAGkwC,GAEjC,GAAIA,QACF,OAAO36C,IAAMyK,EAGf,GAAIzK,IAAMyK,EACR,OAAO,EAIT,GAAId,MAAM3J,IAAM2J,MAAMc,GACpB,OAAO,EAIT,GAAIrB,SAASpJ,IAAMoJ,SAASqB,GAAI,CAE9B,IAAMmwC,EAAO1lD,KAAK2T,IAAI7I,EAAIyK,GAC1B,OAAImwC,EAAOH,IAIFG,GAAQ1lD,KAAK0N,IAAI1N,KAAK2T,IAAI7I,GAAI9K,KAAK2T,IAAI4B,IAAMkwC,EAKxD,OAAO,EAQF,IAAMpvC,GAAQrW,KAAKqW,OAAS,SAAUvL,GAC3C,OAAO9K,KAAK6T,IAAI7T,KAAKiV,KAAKnK,EAAIA,EAAI,GAAKA,IAG5BsL,GAAQpW,KAAKoW,OAAS,SAAUtL,GAC3C,OAAO9K,KAAK6T,IAAI7T,KAAKiV,KAAKnK,EAAIA,EAAI,GAAKA,IAQ5BqL,GAAQnW,KAAKmW,OAAS,SAAUrL,GAC3C,OAAO9K,KAAK6T,KAAK,EAAI/I,IAAM,EAAIA,IAAM,GAQ1BoI,GAAOlT,KAAKkT,MAAQ,SAAUpI,GACzC,OAAQ9K,KAAKmT,IAAIrI,GAAK9K,KAAKmT,KAAKrI,IAAM,GAQ3BsI,GAAOpT,KAAKoT,MAAQ,SAAUtI,GACzC,OAAQ9K,KAAKmT,IAAIrI,GAAK9K,KAAKmT,KAAKrI,IAAM,GAQ3Bic,GAAO/mB,KAAK+mB,MAAQ,SAAUjc,GACzC,IAAMkV,EAAIhgB,KAAKmT,IAAI,EAAIrI,GACvB,OAAQkV,EAAI,IAAMA,EAAI,I,iDCvqBxB,SAAS2lC,GAAuBvmD,EAAGopB,EAAMykB,GACvC,IACM2Y,EAAO,IAAIC,EADKzmD,EAAEsB,aACO,GAC3BujD,EAAS,GACb,GAAIhX,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI9xB,MAAM,kCAElB,IAAK4M,EAAUklB,GACb,MAAM,IAAI9xB,MAAM,2BAElB,GAAI/b,EAAE8mB,YAAY0/B,EAAKhxC,IAAIq4B,EAAO,GAAGlkB,IAAI,KAAO3pB,EAAEgpB,SAASw9B,EAAKhxC,IAAIq4B,EAAO,GAAGjjB,KAAK,IACjF,MAAM,IAAI7O,MAAJ,qCAAwC8xB,EAAO,EAA/C,eAAuDA,EAAO,EAA9D,QAER,IAAK7tC,EAAE2oB,YACL,MAAM,IAAI5M,MAAM,4BAEd/b,EAAEgpB,SAAS,KACbhpB,EAAIA,EAAEoL,IAAIo7C,EAAKhxC,IAAIq4B,KAErBgX,EAAS,IAAH,OAAOhX,GAEf,OAAQzkB,GACN,KAAK,EAAG,gBAAUppB,EAAE8qB,YAAZ,OAAyB+5B,GACjC,KAAK,EAAG,gBAAU7kD,EAAE8rB,WAAZ,OAAwB+4B,GAChC,KAAK,GAAI,gBAAU7kD,EAAE2rB,iBAAZ,OAA8Bk5B,GACvC,QAAS,MAAM,IAAI9oC,MAAJ,eAAkBqN,EAAlB,qBAqFZ,SAAS07B,GAAQtlD,EAAOuD,GAC7B,GAAuB,mBAAZA,EAET,OAAOA,EAAQvD,GAIjB,IAAKA,EAAMsV,WACT,OAAOtV,EAAM6V,QAAU,MAAS7V,EAAMolB,GAAG,GAAK,WAAa,YAI7D,IACI3C,EACA8iC,EAFAC,EAAW,OAIf,QAAgB/iD,IAAZc,IAEEA,EAAQiiD,WACVA,EAAWjiD,EAAQiiD,UAIE,iBAAZjiD,EACTkf,EAAYlf,EACHA,EAAQkf,YACjBA,EAAYlf,EAAQkf,WAGlBlf,EAAQgiD,UAEgB,iBAD1BA,EAAWhiD,EAAQgiD,WAEjB,MAAM,IAAIhpC,MAAM,sCAMtB,OAAQipC,GACN,IAAK,QACH,OA+FC,SAAkBxlD,EAAOyiB,GAC9B,OAAOziB,EAAM2rB,QAAQlJ,GAhGVkJ,CAAQ3rB,EAAOyiB,GAExB,IAAK,cACH,OAAOmE,GAAc5mB,EAAOyiB,GAE9B,IAAK,cACH,OAmDC,SAAwBziB,EAAOyiB,GAEpC,IAAMrB,EAAIphB,EAAMohB,EACV0kC,EAAS1kC,EAAI,GAAM,EAAIA,EAAKA,EAAI,EAAKA,EAAI,EAAMA,EAAI,EAAKA,EAAKA,EAAI,EAGjE8lC,EAAkBlnD,EAAMorB,IAAIhqB,KAAK4U,IAAI,IAAK8vC,IAE5CqB,EAAWD,EAAgBx6B,YAAYjK,IACZ,IAA3B0kC,EAAStiC,QAAQ,OACnBsiC,EAAWD,EAAgBjmD,YAG7B,OAAOkmD,EAAW,KAAO/lC,GAAK,EAAI,IAAM,IAAM0kC,EAAO7kD,WAhE1CmlD,CAAcpmD,EAAOyiB,GAE9B,IAAK,MACH,OAAOskC,GAAsB/mD,EAAO,EAAGulD,GAEzC,IAAK,MACH,OAAOwB,GAAsB/mD,EAAO,EAAGulD,GAEzC,IAAK,MACH,OAAOwB,GAAsB/mD,EAAO,GAAIulD,GAE1C,IAAK,OAIH,IAAMc,EAAY9iD,QAAgCd,IAArBc,EAAQ8iD,SAA0B9iD,EAAQ8iD,UAAY,EAC7EC,EAAY/iD,QAAgCd,IAArBc,EAAQ+iD,SAA0B/iD,EAAQ+iD,SAAW,EAGlF,GAAItmD,EAAMgmB,SAAU,MAAO,IAI3B,IAAMy/B,EAAUzlD,EAAM2sB,oBAAoBlK,GACpClO,EAAMkxC,EAAQrkC,EAUpB,OATI7M,GAAO8xC,GAAY9xC,EAAM+xC,EAErBb,EAAQ95B,UAGR/E,GAAc5mB,EAAOyiB,IAIlBlK,QAAQ,uBAAuB,WACxC,IAAMhF,EAAShR,UAAU,GACnB6e,EAAI7e,UAAU,GACpB,MAAmB,MAAXgR,EAAkBA,EAAS6N,EAAIA,KAG3C,QACE,MAAM,IAAI7E,MAAM,qBAAuBipC,EAAvB,qEAkCf,SAAS5+B,GAAe5mB,EAAOyiB,GACpC,YAAkBhgB,IAAdggB,EACKziB,EAAM4mB,cAAcnE,EAAY,GAEhCziB,EAAM4mB,gBC5OV,SAASwgC,GAAUC,EAAMl4B,GAC9B,IAAMngB,EAAQq4C,EAAK7kD,OAAS2sB,EAAO3sB,OAC7ByM,EAAMo4C,EAAK7kD,OACjB,OAAQ6kD,EAAKj4B,UAAUpgB,EAAOC,KAASkgB,EAyClC,SAASm2B,GAAQtlD,EAAOuD,GAC7B,IAAMqG,EAQR,SAAkB5J,EAAOuD,GACvB,GAAqB,iBAAVvD,EACT,OAAOsnD,GAAatnD,EAAOuD,GAG7B,GAAIq/C,EAAY5iD,GACd,OAAOunD,GAAgBvnD,EAAOuD,GAKhC,GAyHF,SAA4BvD,GAC1B,OAAQA,GACa,WAAjB,IAAOA,IACY,iBAAZA,EAAMc,GACM,iBAAZd,EAAMQ,GACM,iBAAZR,EAAMX,IAAmB,EA9HhCmoD,CAAkBxnD,GACpB,OAAKuD,GAAgC,YAArBA,EAAQkkD,SAKfznD,EAAMiB,WAHLjB,EAAMc,EAAId,EAAMQ,EAAK,IAAMR,EAAMX,EAO7C,GAAIwP,MAAMP,QAAQtO,GAChB,OAwFJ,SAAS0nD,EAAah4C,EAAOnM,GAC3B,GAAIsL,MAAMP,QAAQoB,GAAQ,CAGxB,IAFA,IAAIyP,EAAM,IACJnP,EAAMN,EAAMlN,OACTzD,EAAI,EAAGA,EAAIiR,EAAKjR,IACb,IAANA,IACFogB,GAAO,MAETA,GAAOuoC,EAAYh4C,EAAM3Q,GAAIwE,GAG/B,OADA4b,GAAO,IAGP,OAAOmmC,GAAO51C,EAAOnM,GArGdmkD,CAAY1nD,EAAOuD,GAG5B,GAAIy/C,EAAShjD,GACX,MAAO,IAAMA,EAAQ,IAGvB,GAAqB,mBAAVA,EACT,OAAOA,EAAM2nD,OAAS5+C,OAAO/I,EAAM2nD,QAAU,WAG/C,GAAI3nD,GAA0B,WAAjB,IAAOA,GAAoB,CACtC,MAA4B,mBAAjBA,EAAMslD,OACRtlD,EAAMslD,OAAO/hD,GACXvD,GAASA,EAAMiB,SAASsC,KAAa,GAAGtC,WAE1CjB,EAAMiB,SAASsC,GAMf,IAJS9D,OAAOkS,KAAK3R,GAAOiC,KAAI,SAAA3B,GACrC,MAAO,IAAMA,EAAM,MAAQglD,GAAOtlD,EAAMM,GAAMiD,MAG3BgK,KAAK,MAAQ,IAItC,OAAOxE,OAAO/I,GAxDC4nD,CAAQ5nD,EAAOuD,GAC9B,OAAIA,GAA8B,WAAnB,IAAOA,IAAwB,aAAcA,GACxDqG,EAAOpH,OAASe,EAAQkrB,SACnB7kB,EAAOwlB,UAAU,EAAG7rB,EAAQkrB,SAAW,GAAK,MAE9C7kB,EA4DF,SAASoS,GAAWhc,GAIzB,IAHA,IAAMqnD,EAAOt+C,OAAO/I,GAChB6nD,EAAU,GACV9oD,EAAI,EACDA,EAAIsoD,EAAK7kD,QAAQ,CACtB,IAAIpD,EAAIioD,EAAKhqC,OAAOte,GAEV,OAANK,GACFyoD,GAAWzoD,EACXL,IAGU,MADVK,EAAIioD,EAAKhqC,OAAOte,MAC6B,IAA7B,aAAa8lB,QAAQzlB,KACnCyoD,GAAW,MAEbA,GAAWzoD,GAEXyoD,GADe,MAANzoD,EACE,MAEAA,EAEbL,IAGF,MAAO,IAAM8oD,EAAU,IAQlB,SAASC,GAAQ9nD,GACtB,IAAIqnD,EAAOt+C,OAAO/I,GAOlB,OANAqnD,EAAOA,EAAK9uC,QAAQ,KAAM,SACvBA,QAAQ,KAAM,UACdA,QAAQ,KAAM,SACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,QAmDZ,SAASwvC,GAAa77C,EAAGyK,GAE9B,IAAKqsC,EAAS92C,GACZ,MAAM,IAAIjE,UAAU,qGACiC68C,EAAO54C,GAAK,eAEnE,IAAK82C,EAASrsC,GACZ,MAAM,IAAI1O,UAAU,qGACiC68C,EAAOnuC,GAAK,eAGnE,OAAQzK,IAAMyK,EACV,EACCzK,EAAIyK,EAAI,GAAK,ECpNb,SAASqxC,GAAgBhkB,EAAQN,EAAUukB,GAChD,KAAMtpD,gBAAgBqpD,IACpB,MAAM,IAAItzC,YAAY,oDAGxB/V,KAAKqlC,OAASA,EACdrlC,KAAK+kC,SAAWA,EAChB/kC,KAAKspD,SAAWA,EAEhBtpD,KAAKupD,QAAU,wBACVr5C,MAAMP,QAAQ01B,GAAW,IAAMA,EAAOz2B,KAAK,MAAQ,IAAOy2B,GAC3D,KAAOrlC,KAAKspD,UAAY,MAAQ,KAC/Bp5C,MAAMP,QAAQo1B,GAAa,IAAMA,EAASn2B,KAAK,MAAQ,IAAOm2B,GAC/D,IAEJ/kC,KAAKwpD,OAAS,IAAI5rC,OAAS4rC,MCdtB,SAASC,GAAY77C,EAAOsF,EAAK/C,GACtC,KAAMnQ,gBAAgBypD,IACpB,MAAM,IAAI1zC,YAAY,oDAGxB/V,KAAK4N,MAAQA,EACThK,UAAUC,OAAS,GACrB7D,KAAKkT,IAAM,EACXlT,KAAKmQ,IAAM+C,IAEXlT,KAAKkT,IAAMA,EACXlT,KAAKmQ,IAAMA,QAGIrM,IAAb9D,KAAKkT,KAAqBlT,KAAK4N,MAAQ5N,KAAKkT,IAC9ClT,KAAKupD,QAAU,uBAAyBvpD,KAAK4N,MAAQ,MAAQ5N,KAAKkT,IAAM,SAClDpP,IAAb9D,KAAKmQ,KAAqBnQ,KAAK4N,OAAS5N,KAAKmQ,IACtDnQ,KAAKupD,QAAU,uBAAyBvpD,KAAK4N,MAAQ,OAAS5N,KAAKmQ,IAAM,GAAK,IAE9EnQ,KAAKupD,QAAU,uBAAyBvpD,KAAK4N,MAAQ,IAGvD5N,KAAKwpD,OAAS,IAAI5rC,OAAS4rC,MCnBtB,SAASE,GAAWn8C,GAGzB,IAFA,IAAMpL,EAAI,GAEH+N,MAAMP,QAAQpC,IACnBpL,EAAEsZ,KAAKlO,EAAE1J,QACT0J,EAAIA,EAAE,GAGR,OAAOpL,EA+CF,SAASwnD,GAAU54C,EAAO2+B,GAE/B,GADkC,IAAhBA,EAAK7rC,QAGrB,GAAIqM,MAAMP,QAAQoB,GAChB,MAAM,IAAIs4C,GAAet4C,EAAMlN,OAAQ,QAxC7C,SAAS+lD,EAAW74C,EAAO2+B,EAAMma,GAC/B,IAAIzpD,EACEiR,EAAMN,EAAMlN,OAElB,GAAIwN,IAAQq+B,EAAKma,GACf,MAAM,IAAIR,GAAeh4C,EAAKq+B,EAAKma,IAGrC,GAAIA,EAAMna,EAAK7rC,OAAS,EAAG,CAEzB,IAAMimD,EAAUD,EAAM,EACtB,IAAKzpD,EAAI,EAAGA,EAAIiR,EAAKjR,IAAK,CACxB,IAAM2pD,EAAQh5C,EAAM3Q,GACpB,IAAK8P,MAAMP,QAAQo6C,GACjB,MAAM,IAAIV,GAAe3Z,EAAK7rC,OAAS,EAAG6rC,EAAK7rC,OAAQ,KAEzD+lD,EAAU74C,EAAM3Q,GAAIsvC,EAAMoa,SAI5B,IAAK1pD,EAAI,EAAGA,EAAIiR,EAAKjR,IACnB,GAAI8P,MAAMP,QAAQoB,EAAM3Q,IACtB,MAAM,IAAIipD,GAAe3Z,EAAK7rC,OAAS,EAAG6rC,EAAK7rC,OAAQ,KAsB3D+lD,CAAU74C,EAAO2+B,EAAM,GAUpB,SAASsa,GAAep8C,EAAO/J,GACpC,IAAKmgD,EAASp2C,KAAW4c,EAAU5c,GACjC,MAAM,IAAItE,UAAU,oCAAsCsE,EAAQ,KAEpE,GAAIA,EAAQ,GAAwB,iBAAX/J,GAAuB+J,GAAS/J,EACvD,MAAM,IAAI4lD,GAAW77C,EAAO/J,GAczB,SAASomD,GAAQl5C,EAAO2+B,EAAMwa,GAInC,IAAKh6C,MAAMP,QAAQoB,KAAWb,MAAMP,QAAQ+/B,GAC1C,MAAM,IAAIpmC,UAAU,kBAEtB,GAAoB,IAAhBomC,EAAK7rC,OACP,MAAM,IAAI+Z,MAAM,uCAelB,OAXA8xB,EAAKzrC,SAAQ,SAAU5C,GACrB,IAAK2iD,EAAS3iD,KAAWmpB,EAAUnpB,IAAUA,EAAQ,EACnD,MAAM,IAAIiI,UAAU,uDACNq9C,GAAOjX,GAAQ,QAoBnC,SAASya,EAASp5C,EAAO2+B,EAAMma,EAAKK,GAClC,IAAI9pD,EACAgqD,EACEC,EAASt5C,EAAMlN,OACfymD,EAAS5a,EAAKma,GACdlU,EAASlzC,KAAKyQ,IAAIm3C,EAAQC,GAKhC,GAFAv5C,EAAMlN,OAASymD,EAEXT,EAAMna,EAAK7rC,OAAS,EAAG,CAEzB,IAAMimD,EAAUD,EAAM,EAGtB,IAAKzpD,EAAI,EAAGA,EAAIu1C,EAAQv1C,IAEtBgqD,EAAOr5C,EAAM3Q,GACR8P,MAAMP,QAAQy6C,KACjBA,EAAO,CAACA,GACRr5C,EAAM3Q,GAAKgqD,GAEbD,EAAQC,EAAM1a,EAAMoa,EAASI,GAI/B,IAAK9pD,EAAIu1C,EAAQv1C,EAAIkqD,EAAQlqD,IAE3BgqD,EAAO,GACPr5C,EAAM3Q,GAAKgqD,EAGXD,EAAQC,EAAM1a,EAAMoa,EAASI,OAE1B,CAIL,IAAK9pD,EAAI,EAAGA,EAAIu1C,EAAQv1C,IACtB,KAAO8P,MAAMP,QAAQoB,EAAM3Q,KACzB2Q,EAAM3Q,GAAK2Q,EAAM3Q,GAAG,GAKxB,IAAKA,EAAIu1C,EAAQv1C,EAAIkqD,EAAQlqD,IAC3B2Q,EAAM3Q,GAAK8pD,GA5DfC,CAAQp5C,EAAO2+B,EAAM,OADmB5rC,IAAjBomD,EAA8BA,EAAe,GAG7Dn5C,EAyEF,SAASw5C,GAASx5C,EAAOy5C,GAC9B,IAAMC,EAAY/H,GAAQ3xC,GACpB25C,EAAgBD,EAAU5mD,OAEhC,IAAKqM,MAAMP,QAAQoB,KAAWb,MAAMP,QAAQ66C,GAC1C,MAAM,IAAIlhD,UAAU,kBAGtB,GAAqB,IAAjBkhD,EAAM3mD,OACR,MAAM,IAAIwlD,GAAe,EAAGqB,EAAe,MAI7C,IAAMC,EAAYC,GADlBJ,EAAQK,GAAqBL,EAAOE,IAEpC,GAAIA,IAAkBC,EACpB,MAAM,IAAItB,GACRsB,EACAD,EACA,MAIJ,IACE,OA6DJ,SAAmB35C,EAAOy5C,GAKxB,IAHA,IACIM,EADAC,EAAWh6C,EAGNi6C,EAAYR,EAAM3mD,OAAS,EAAGmnD,EAAY,EAAGA,IAAa,CACjE,IAAMtb,EAAO8a,EAAMQ,GACnBF,EAAY,GAIZ,IADA,IAAMjnD,EAASknD,EAASlnD,OAAS6rC,EACxBtvC,EAAI,EAAGA,EAAIyD,EAAQzD,IAC1B0qD,EAAUrvC,KAAKsvC,EAAS36C,MAAMhQ,EAAIsvC,GAAOtvC,EAAI,GAAKsvC,IAGpDqb,EAAWD,EAGb,OAAOC,EA/EEE,CAASR,EAAWD,GAC3B,MAAO/nC,GACP,GAAIA,aAAa4mC,GACf,MAAM,IAAIA,GACRsB,EACAD,EACA,MAGJ,MAAMjoC,GAWH,SAASooC,GAAsBL,EAAOE,GAC3C,IAAMC,EAAYC,GAAQJ,GACpBU,EAAiBV,EAAMp6C,QAEvB+6C,EAAgBX,EAAMtkC,SADX,GAIjB,GAD8BskC,EAAMtkC,SAHnB,EAGqCilC,EAAgB,IAAM,EAE1E,MAAM,IAAIvtC,MAAM,mCAMlB,GAHoButC,GAAiB,EAGpB,CACf,KAHyBT,EAAgBC,GAAc,GAMrD,MAAM,IAAI/sC,MAAM,qCAAuC8sC,EAAgB,uBAA0BC,GAFjGO,EAAeC,IAAkBT,EAAgBC,EAKrD,OAAOO,EAQT,SAASN,GAAS75C,GAChB,OAAOA,EAAMq6C,QAAO,SAACjrC,EAAMkrC,GAAP,OAAgBlrC,EAAOkrC,IAAM,GAsC5C,SAASC,GAASv6C,EAAO2+B,GAI9B,IAHA,IAAMvtC,EAAIutC,GAAQga,GAAU34C,GAGrBb,MAAMP,QAAQoB,IAA2B,IAAjBA,EAAMlN,QACnCkN,EAAQA,EAAM,GACd5O,EAAEypB,QAKJ,IADA,IAAI2/B,EAAOppD,EAAE0B,OACU,IAAhB1B,EAAEopD,EAAO,IACdA,IASF,OALIA,EAAOppD,EAAE0B,SACXkN,EAeJ,SAASy6C,EAAUz6C,EAAOw6C,EAAM1B,GAC9B,IAAIzpD,EAAGgnC,EAEP,GAAIyiB,EAAM0B,EAAM,CACd,IAAMnrC,EAAOypC,EAAM,EACnB,IAAKzpD,EAAI,EAAGgnC,EAAKr2B,EAAMlN,OAAQzD,EAAIgnC,EAAIhnC,IACrC2Q,EAAM3Q,GAAKorD,EAASz6C,EAAM3Q,GAAImrD,EAAMnrC,QAGtC,KAAOlQ,MAAMP,QAAQoB,IACnBA,EAAQA,EAAM,GAIlB,OAAOA,EA7BGy6C,CAASz6C,EAAOw6C,EAAM,GAC9BppD,EAAE0B,OAAS0nD,GAGNx6C,EAwCF,SAAS06C,GAAW16C,EAAOw6C,EAAMG,EAAOhc,GAC7C,IAAMvtC,EAAIutC,GAAQga,GAAU34C,GAG5B,GAAI26C,EACF,IAAK,IAAItrD,EAAI,EAAGA,EAAIsrD,EAAOtrD,IACzB2Q,EAAQ,CAACA,GACT5O,EAAE+pB,QAAQ,GAMd,IADAnb,EAgBF,SAAS46C,EAAY56C,EAAOw6C,EAAM1B,GAChC,IAAIzpD,EAAGgnC,EAEP,GAAIl3B,MAAMP,QAAQoB,GAAQ,CACxB,IAAMqP,EAAOypC,EAAM,EACnB,IAAKzpD,EAAI,EAAGgnC,EAAKr2B,EAAMlN,OAAQzD,EAAIgnC,EAAIhnC,IACrC2Q,EAAM3Q,GAAKurD,EAAW56C,EAAM3Q,GAAImrD,EAAMnrC,QAGxC,IAAK,IAAI1f,EAAImpD,EAAKnpD,EAAI6qD,EAAM7qD,IAC1BqQ,EAAQ,CAACA,GAIb,OAAOA,EA9BC46C,CAAW56C,EAAOw6C,EAAM,GACzBppD,EAAE0B,OAAS0nD,GAChBppD,EAAEsZ,KAAK,GAGT,OAAO1K,EAiCF,SAAS2xC,GAAS3xC,GACvB,IAAKb,MAAMP,QAAQoB,GAEjB,OAAOA,EAET,IAAM66C,EAAO,GAUb,OARA76C,EAAM9M,SAAQ,SAASumC,EAAUnpC,GAC3B6O,MAAMP,QAAQtO,GAChBA,EAAM4C,QAAQumC,GAEdohB,EAAKnwC,KAAKpa,MAIPuqD,EAQF,SAAStoD,GAAKyN,EAAOy5B,GAC1B,OAAOt6B,MAAMlO,UAAUsB,IAAI/C,KAAKwQ,EAAOy5B,GAQlC,SAASvmC,GAAS8M,EAAOy5B,GAC9Bt6B,MAAMlO,UAAUiC,QAAQ1D,KAAKwQ,EAAOy5B,GAQ/B,SAAS1wB,GAAQ/I,EAAOy5B,GAC7B,GAAgC,IAA5Bkf,GAAU34C,GAAOlN,OACnB,MAAM,IAAI+Z,MAAM,2CAGlB,OAAO1N,MAAMlO,UAAU8X,OAAOvZ,KAAKwQ,EAAOy5B,GAUrC,SAASqhB,GAAc96C,EAAOiS,GACnC,GAAgC,IAA5B0mC,GAAU34C,GAAOlN,OACnB,MAAM,IAAI+Z,MAAM,2CAGlB,OAAO1N,MAAMlO,UAAU8X,OAAOvZ,KAAKwQ,GAAO,SAACqxB,GAAD,OAAWpf,EAAO3Y,KAAK+3B,MAQ5D,SAASxzB,GAAMmC,EAAOhC,GAC3B,OAAOmB,MAAMlO,UAAU4M,KAAKrO,KAAKwQ,EAAOhC,GAQnC,SAAS+8C,GAAU71C,GACxB,IAAK/F,MAAMP,QAAQsG,GACjB,MAAM,IAAI3M,UAAU,wBAGtB,GAAiB,IAAb2M,EAAEpS,OACJ,OAAOoS,EAGT,IAAMC,EAAI,GACNy6B,EAAQ,EACZz6B,EAAE,GAAK,CAAE7U,MAAO4U,EAAE,GAAI81C,WAAY,GAClC,IAAK,IAAI3rD,EAAI,EAAGA,EAAI6V,EAAEpS,OAAQzD,IACxB6V,EAAE7V,KAAO6V,EAAE7V,EAAI,GACjBuwC,IAEAA,EAAQ,EAEVz6B,EAAEuF,KAAK,CAAEpa,MAAO4U,EAAE7V,GAAI2rD,WAAYpb,IAEpC,OAAOz6B,EAQF,SAAS81C,GAAY/1C,GAC1B,IAAK/F,MAAMP,QAAQsG,GACjB,MAAM,IAAI3M,UAAU,wBAGtB,GAAiB,IAAb2M,EAAEpS,OACJ,OAAOoS,EAIT,IADA,IAAMC,EAAI,GACD9V,EAAI,EAAGA,EAAI6V,EAAEpS,OAAQzD,IAC5B8V,EAAEuF,KAAKxF,EAAE7V,GAAGiB,OAEd,OAAO6U,EAYF,SAAS+1C,GAAkBl7C,EAAOo1C,GAIvC,IAHA,IAAIr5C,EACAjJ,EAAS,EAEJzD,EAAI,EAAGA,EAAI2Q,EAAMlN,OAAQzD,IAAK,CACrC,IAAMmqC,EAAOx5B,EAAM3Q,GACbuP,EAAUO,MAAMP,QAAQ46B,GAQ9B,GALU,IAANnqC,GAAWuP,IACb9L,EAAS0mC,EAAK1mC,QAIZ8L,GAAW46B,EAAK1mC,SAAWA,EAC7B,OAGF,IAAMqoD,EAAWv8C,EACbs8C,GAAiB1hB,EAAM4b,GACvBA,EAAO5b,GAEX,QAAazmC,IAATgJ,EACFA,EAAOo/C,OACF,GAAIp/C,IAASo/C,EAClB,MAAO,QAMX,OAAOp/C,EAyBF,SAASq/C,GAAUp7C,EAAOw5B,GAC/B,OAAgC,IAAzBx5B,EAAMmV,QAAQqkB,GCvlBhB,SAASzY,GAAOvkB,GACrB,IAAMT,EAAO,IAAOS,GAGpB,GAAa,WAATT,GAA8B,WAATA,GAA8B,YAATA,GAA1CA,MACAS,EACF,OAAOA,EAIT,GAAuB,mBAAZA,EAAEukB,MACX,OAAOvkB,EAAEukB,QAIX,GAAI5hB,MAAMP,QAAQpC,GAChB,OAAOA,EAAEjK,KAAI,SAAUjC,GACrB,OAAOywB,GAAMzwB,MAIjB,GAAIkM,aAAaqnB,KAAM,OAAO,IAAIA,KAAKrnB,EAAEmQ,WACzC,GAAIumC,EAAY12C,GAAI,OAAOA,EAC3B,GAAIA,aAAavH,OAAQ,MAAM,IAAIsD,UAAU,gBAAkBiE,GAG/D,OAAO6+C,GAAU7+C,EAAGukB,IASf,SAASs6B,GAAWtqD,EAAQ0oC,GACjC,IAAM1Y,EAAQ,GAEd,IAAK,IAAMnwB,KAAOG,EACZG,GAAeH,EAAQH,KACzBmwB,EAAMnwB,GAAO6oC,EAAS1oC,EAAOH,KAIjC,OAAOmwB,EASF,SAASu6B,GAAQp2C,EAAGC,GACzB,IAAK,IAAM0sC,KAAQ1sC,EACbjU,GAAeiU,EAAG0sC,KACpB3sC,EAAE2sC,GAAQ1sC,EAAE0sC,IAGhB,OAAO3sC,EA6CF,SAASq2C,GAAiBr2C,EAAGC,GAClC,IAAI0sC,EAAMxiD,EAAGiR,EACb,GAAInB,MAAMP,QAAQsG,GAAI,CACpB,IAAK/F,MAAMP,QAAQuG,GACjB,OAAO,EAGT,GAAID,EAAEpS,SAAWqS,EAAErS,OACjB,OAAO,EAGT,IAAKzD,EAAI,EAAGiR,EAAM4E,EAAEpS,OAAQzD,EAAIiR,EAAKjR,IACnC,IAAKksD,GAAgBr2C,EAAE7V,GAAI8V,EAAE9V,IAC3B,OAAO,EAGX,OAAO,EACF,GAAiB,mBAAN6V,EAChB,OAAQA,IAAMC,EACT,GAAID,aAAanV,OAAQ,CAC9B,GAAIoP,MAAMP,QAAQuG,MAAQA,aAAapV,QACrC,OAAO,EAGT,IAAK8hD,KAAQ3sC,EAEX,KAAM2sC,KAAQ1sC,KAAOo2C,GAAgBr2C,EAAE2sC,GAAO1sC,EAAE0sC,IAC9C,OAAO,EAGX,IAAKA,KAAQ1sC,EAEX,KAAM0sC,KAAQ3sC,GACZ,OAAO,EAGX,OAAO,EAEP,OAAQA,IAAMC,EASX,SAASq2C,GAAaC,GAC3B,IAAMC,EAAkB,GAIxB,OAIF,SAASC,EAAcF,EAAcC,GACnC,IAAK,IAAM7J,KAAQ4J,EACjB,GAAIvqD,GAAeuqD,EAAc5J,GAAO,CACtC,IAAMvhD,EAAQmrD,EAAa5J,GACN,WAAjB,IAAOvhD,IAAgC,OAAVA,EAC/BqrD,EAAarrD,EAAOorD,GAEpBA,EAAgB7J,GAAQvhD,GAb9BqrD,CAAaF,EAAcC,GAEpBA,EA0CF,SAASE,GAAM7qD,EAAQ8gD,EAAMgK,GAClC,IACIC,EADAC,GAAiB,EAGrBhsD,OAAOC,eAAee,EAAQ8gD,EAAM,CAClC3hD,IAAK,WAKH,OAJI6rD,IACFD,EAASD,IACTE,GAAiB,GAEZD,GAGT5kD,IAAK,SAAU5G,GACbwrD,EAASxrD,EACTyrD,GAAiB,GAGnBz+C,cAAc,EACdrN,YAAY,IAoCT,SAASiB,GAAgBH,EAAQC,GACtC,OAAOD,GAAUhB,OAAOmB,eAAe1B,KAAKuB,EAAQC,GA0H/C,SAAS0L,GAAQ3L,GACtB,OAAOhB,OAAOkS,KAAKlR,GAAQwB,KAAI,SAAA3B,GAAG,OAAIG,EAAOH,MC3WxC,SAAShC,GAASgB,EAAMosD,EAAcrrD,EAAQgxC,GACnD,SAASsa,EAAiBC,GAIxB,IAAMC,EDuVH,SAAsBprD,EAAQwa,GAGnC,IAFA,IAAMuV,EAAO,GAEJzxB,EAAI,EAAGA,EAAIkc,EAAWzY,OAAQzD,IAAK,CAC1C,IAAMuB,EAAM2a,EAAWlc,GACjBiB,EAAQS,EAAOH,QACPmC,IAAVzC,IACFwwB,EAAKlwB,GAAON,GAIhB,OAAOwwB,EClWQs7B,CAAYF,EAAOF,EAAazpD,IAAI8pD,KAIjD,OA8FG,SAA6BzsD,EAAMosD,EAAcE,GAKtD,IAJmBF,EAChBjzC,QAAO,SAAAuzC,GAAU,OAYf,SAA+BA,GACpC,OAAOA,GAAgC,MAAlBA,EAAW,GAbPC,CAAqBD,MAC3CpzB,OAAM,SAAAozB,GAAU,YAA0BvpD,IAAtBmpD,EAAMI,MAEZ,CACf,IAAME,EAAsBR,EAAajzC,QAAO,SAAAuzC,GAAU,YAA0BvpD,IAAtBmpD,EAAMI,MAGpE,MAAM,IAAIzvC,MAAM,kCAA2Bjd,EAA3B,gDACoB4sD,EAAoBjqD,KAAI,SAAA5C,GAAC,iBAAQA,EAAR,QAAckO,KAAK,MADhE,OAzGhB4+C,CAAmB7sD,EAAMosD,EAAcE,GAEhCvrD,EAAOwrD,GAUhB,OAPAF,EAAgBS,WAAY,EAC5BT,EAAgBrmD,GAAKhG,EACrBqsD,EAAgBD,aAAeA,EAAa38C,QAAQ+N,OAChDu0B,IACFsa,EAAgBta,KAAOA,GAGlBsa,EAqEF,SAASS,GAAWxqD,GACzB,MAAsB,mBAARA,GACM,iBAAXA,EAAI0D,IACXuJ,MAAMP,QAAQ1M,EAAI8pD,cA8Bf,SAASK,GAAuBC,GACrC,OAAOA,GAAgC,MAAlBA,EAAW,GAC5BA,EAAWj9C,MAAM,GACjBi9C,EJ5HNhE,GAAernD,UAAY,IAAIkuC,WAC/BmZ,GAAernD,UAAUmB,YAAc+sC,WACvCmZ,GAAernD,UAAUrB,KAAO,iBAChC0oD,GAAernD,UAAU0rD,kBAAmB,ECK5CjE,GAAWznD,UAAY,IAAIkuC,WAC3BuZ,GAAWznD,UAAUmB,YAAc+sC,WACnCuZ,GAAWznD,UAAUrB,KAAO,aAC5B8oD,GAAWznD,UAAU2rD,cAAe,E,+FI5BpC,SAASC,GAAiB9rD,EAAQ8gD,GAEhC,GAAIiL,GAAc/rD,IAAWgsD,GAAehsD,EAAQ8gD,GAClD,OAAO9gD,EAAO8gD,GAGhB,GAA4B,mBAAjB9gD,EAAO8gD,IAAwBmL,GAAajsD,EAAQ8gD,GAC7D,MAAM,IAAIhlC,MAAM,yBAA2BglC,EAAO,mBAGpD,MAAM,IAAIhlC,MAAM,0BAA4BglC,EAAO,KAarD,SAASoL,GAAiBlsD,EAAQ8gD,EAAMvhD,GAEtC,GAAIwsD,GAAc/rD,IAAWgsD,GAAehsD,EAAQ8gD,GAElD,OADA9gD,EAAO8gD,GAAQvhD,EACRA,EAGT,MAAM,IAAIuc,MAAM,0BAA4BglC,EAAO,KAiBrD,SAASkL,GAAgBhsD,EAAQ8gD,GAC/B,SAAK9gD,GAA4B,WAAlB,IAAOA,QAKlBG,GAAegsD,GAAsBrL,MAKrCA,KAAQ9hD,OAAOkB,cAQf4gD,KAAQ7/C,SAASf,YA6BvB,SAAS+rD,GAAcjsD,EAAQ6e,GAC7B,OAAI7e,SAAqE,mBAAnBA,EAAO6e,OAMzD1e,GAAeH,EAAQ6e,IACtB7f,OAAOw8B,gBAAmB3c,KAAU7f,OAAOw8B,eAAex7B,QAK3DG,GAAeisD,GAAmBvtC,MAKlCA,KAAU7f,OAAOkB,cAQjB2e,KAAU5d,SAASf,aASzB,SAAS6rD,GAAe/rD,GACtB,MAAyB,WAAlB,IAAOA,IAAuBA,GAAUA,EAAOqB,cAAgBrC,OAGxE,IAAMmtD,GAAuB,CAC3BpqD,QAAQ,EACRlD,MAAM,GAGFutD,GAAoB,CACxB5rD,UAAU,EACVob,SAAS,EACTywC,gBAAgB,G,whCC7IX,IAAMC,GAAb,WACE,WAAatsD,GAAQ,aACnB9B,KAAKquD,cAAgBvsD,EAFzB,iCAKE,WACE,OAAOhB,OAAOkS,KAAKhT,KAAKquD,iBAN5B,iBASE,SAAK1sD,GACH,OAAOisD,GAAgB5tD,KAAKquD,cAAe1sD,KAV/C,iBAaE,SAAKA,EAAKN,GAER,OADA2sD,GAAgBhuD,KAAKquD,cAAe1sD,EAAKN,GAClCrB,OAfX,iBAkBE,SAAK2B,GACH,ODiBsBG,ECjBC9B,KAAKquD,cAAe1sD,KDkB9BG,EADjB,IAA0BA,MCpC1B,KA4BO,SAASwsD,KACd,OAAO,IAAIC,IASN,SAASC,GAAWC,GACzB,IAAKA,EACH,OAAOH,KAET,GAAII,GAAMD,GACR,OAAOA,EAET,GAAI/mD,EAAS+mD,GACX,OAAO,IAAIL,GAAkBK,GAG/B,MAAM,IAAI7wC,MAAM,kDA6BX,SAAS8wC,GAAO5sD,GAGrB,QAAKA,IAGEA,aAAkBysD,KACvBzsD,aAAkBssD,IAEM,mBAAftsD,EAAOmG,KACQ,mBAAfnG,EAAOb,KACS,mBAAhBa,EAAOkR,MACQ,mBAAflR,EAAOod,KAWb,SAASxJ,GAAQpS,GAAiB,2BAATqrD,EAAS,iCAATA,EAAS,kBACvC,cAAmBA,EAAnB,eAA4B,CAAvB,IAAMnxC,EAAI,KACb,GAAKA,EAGL,GAAIkxC,GAAMlxC,GAAO,YACGA,EAAKxK,QADR,IACf,2BAA+B,KAApBrR,EAAoB,QAC7B2B,EAAI2E,IAAItG,EAAK6b,EAAKvc,IAAIU,KAFT,oCAIV,GAAI+F,EAAS8V,GAClB,cAAkB1c,OAAOkS,KAAKwK,GAA9B,eAAqC,CAAhC,IAAM7b,EAAG,KACZ2B,EAAI2E,IAAItG,EAAK6b,EAAK7b,KAIxB,OAAO2B,EC5CT,IAAIsrD,GAAe,WAIjB,OADAA,GAAeC,IAAcntD,OACtBmtD,KAeIC,GAA8BnvD,GAAQ,QAZ9B,CACnB,aACA,WACA,eACA,cAQwE,YAAqE,IAA7CovD,EAA6C,EAA7CA,UAAWv4C,EAAkC,EAAlCA,QAASw4C,EAAyB,EAAzBA,YAAav8B,EAAY,EAAZA,SAI3HqP,EAAQ8sB,KA0Od,OArOA9sB,EAAMC,MAAQ,CACZ,CAAEphC,KAAM,SAAU0J,KAAM25C,GACxB,CAAErjD,KAAM,UAAW0J,KAAM65C,GACzB,CAAEvjD,KAAM,YAAa0J,KAAM45C,GAC3B,CAAEtjD,KAAM,WAAY0J,KAAM85C,GAC1B,CAAExjD,KAAM,OAAQ0J,KAAM+5C,GACtB,CAAEzjD,KAAM,SAAU0J,KAAMg6C,GACxB,CAAE1jD,KAAM,QAAS0J,KAAM67C,GACvB,CAAEvlD,KAAM,QAAS0J,KAAMsF,GACvB,CAAEhP,KAAM,SAAU0J,KAAMi6C,GACxB,CAAE3jD,KAAM,cAAe0J,KAAMm6C,GAC7B,CAAE7jD,KAAM,eAAgB0J,KAAMo6C,GAC9B,CAAE9jD,KAAM,QAAS0J,KAAMq6C,GACvB,CAAE/jD,KAAM,QAAS0J,KAAMs6C,GACvB,CAAEhkD,KAAM,UAAW0J,KAAMu6C,GACzB,CAAEjkD,KAAM,YAAa0J,KAAMw6C,GAC3B,CAAElkD,KAAM,OAAQ0J,KAAMy6C,GACtB,CAAEnkD,KAAM,WAAY0J,KAAM06C,GAC1B,CAAEpkD,KAAM,OAAQ0J,KAAM26C,GACtB,CAAErkD,KAAM,SAAU0J,KAAMwW,GACxB,CAAElgB,KAAM,OAAQ0J,KAAM46C,GACtB,CAAEtkD,KAAM,YAAa0J,KAAM66C,GAE3B,CAAEvkD,KAAM,eAAgB0J,KAAM86C,GAC9B,CAAExkD,KAAM,YAAa0J,KAAMg7C,GAC3B,CAAE1kD,KAAM,iBAAkB0J,KAAMi7C,GAChC,CAAE3kD,KAAM,YAAa0J,KAAMk7C,GAC3B,CAAE5kD,KAAM,kBAAmB0J,KAAMm7C,GACjC,CAAE7kD,KAAM,eAAgB0J,KAAMo7C,GAC9B,CAAE9kD,KAAM,eAAgB0J,KAAMs7C,GAC9B,CAAEhlD,KAAM,yBAA0B0J,KAAMq7C,GACxC,CAAE/kD,KAAM,YAAa0J,KAAMu7C,GAC3B,CAAEjlD,KAAM,OAAQ0J,KAAM+6C,GACtB,CAAEzkD,KAAM,aAAc0J,KAAMw7C,GAC5B,CAAEllD,KAAM,eAAgB0J,KAAMy7C,GAC9B,CAAEnlD,KAAM,kBAAmB0J,KAAM07C,GACjC,CAAEplD,KAAM,YAAa0J,KAAM27C,GAC3B,CAAErlD,KAAM,aAAc0J,KAAM47C,GAE5B,CAAEtlD,KAAM,MAAO0J,KAAMqkD,IACrB,CAAE/tD,KAAM,SAAU0J,KAAM3C,IAG1Bo6B,EAAME,YAAc,CAClB,CACEzuB,KAAM,SACNC,GAAI,YACJ4yB,QAAS,SAAU74B,GAMjB,GALKwhD,GACHE,GAAiB1hD,GAIRA,EV0ad0a,gBACArO,QAAQ,OAAQ,IAChBA,QAAQ,aAAc,IACtB/V,OU7amB,GACd,MAAM,IAAIyF,UAAU,uFACLiE,EADK,yDAItB,OAAO,IAAIwhD,EAAUxhD,KAEtB,CACDgG,KAAM,SACNC,GAAI,UACJ4yB,QAAS,SAAU74B,GAKjB,OAJKiJ,GACH04C,GAAe3hD,GAGV,IAAIiJ,EAAQjJ,EAAG,KAEvB,CACDgG,KAAM,SACNC,GAAI,SACJ4yB,QAAS,SAAU74B,GACjB,OAAOA,EAAI,KAEZ,CACDgG,KAAM,YACNC,GAAI,UACJ4yB,QAAS,SAAU74B,GAKjB,OAJKiJ,GACH04C,GAAe3hD,GAGV,IAAIiJ,EAAQjJ,EAAEgH,WAAY,KAElC,CACDhB,KAAM,WACNC,GAAI,YACJ4yB,QAAS,SAAU74B,GACjB,MAAM,IAAIjE,UAAU,+JAGrB,CACDiK,KAAM,WACNC,GAAI,UACJ4yB,QAAS,SAAU74B,GAKjB,OAJKiJ,GACH04C,GAAe3hD,GAGV,IAAIiJ,EAAQjJ,EAAEmQ,UAAW,KAEjC,CACDnK,KAAM,SACNC,GAAI,WACJ4yB,QAAS,SAAU74B,GACZklB,GACH08B,GAAgB5hD,GAGlB,IAAM/I,EAAI,IAAIiuB,EAASllB,GACvB,GAAI/I,EAAEkZ,YAAcnQ,EAClB,MAAM,IAAIjE,UAAU,mGACLiE,EADK,uDAItB,OAAO/I,IAER,CAQD+O,KAAM,SACNC,GAAI,SACJ4yB,QAAS,SAAU74B,GACjB,IAAM1L,EAAI6U,OAAOnJ,GACjB,GAAI2J,MAAMrV,GACR,MAAM,IAAI+b,MAAM,mBAAqBrQ,EAAI,iBAE3C,OAAO1L,IAER,CACD0R,KAAM,SACNC,GAAI,YACJ4yB,QAAS,SAAU74B,GACZwhD,GACHE,GAAiB1hD,GAGnB,IACE,OAAO,IAAIwhD,EAAUxhD,GACrB,MAAOu3B,GACP,MAAM,IAAIlnB,MAAM,mBAAqBrQ,EAAI,qBAG5C,CACDgG,KAAM,SACNC,GAAI,WACJ4yB,QAAS,SAAU74B,GACZklB,GACH08B,GAAgB5hD,GAGlB,IACE,OAAO,IAAIklB,EAASllB,GACpB,MAAOu3B,GACP,MAAM,IAAIlnB,MAAM,mBAAqBrQ,EAAI,oBAG5C,CACDgG,KAAM,SACNC,GAAI,UACJ4yB,QAAS,SAAU74B,GACZiJ,GACH04C,GAAe3hD,GAGjB,IACE,OAAO,IAAIiJ,EAAQjJ,GACnB,MAAOu3B,GACP,MAAM,IAAIlnB,MAAM,mBAAqBrQ,EAAI,mBAG5C,CACDgG,KAAM,UACNC,GAAI,SACJ4yB,QAAS,SAAU74B,GACjB,OAAQA,IAET,CACDgG,KAAM,UACNC,GAAI,YACJ4yB,QAAS,SAAU74B,GAKjB,OAJKwhD,GACHE,GAAiB1hD,GAGZ,IAAIwhD,GAAWxhD,KAEvB,CACDgG,KAAM,UACNC,GAAI,WACJ4yB,QAAS,SAAU74B,GAKjB,OAJKklB,GACH08B,GAAgB5hD,GAGX,IAAIklB,GAAUllB,KAEtB,CACDgG,KAAM,UACNC,GAAI,SACJ4yB,QAAS,SAAU74B,GACjB,OAAOnD,OAAOmD,KAEf,CACDgG,KAAM,QACNC,GAAI,SACJ4yB,QAAS,SAAUr1B,GAKjB,OAJKi+C,GA0Bb,WACE,MAAM,IAAIpxC,MAAM,uEA1BRwxC,GAGK,IAAIJ,EAAYj+C,KAExB,CACDwC,KAAM,SACNC,GAAI,QACJ4yB,QAAS,SAAUipB,GACjB,OAAOA,EAAO3xC,aAKbokB,KAGT,SAASmtB,GAAkB1hD,GACzB,MAAM,IAAIqQ,MAAJ,+BAAkCrQ,EAAlC,qDAGR,SAAS2hD,GAAgB3hD,GACvB,MAAM,IAAIqQ,MAAJ,+BAAkCrQ,EAAlC,wDAOR,SAAS4hD,GAAiB5hD,GACxB,MAAM,IAAIqQ,MAAJ,+BAAkCrQ,EAAlC,oD,UC/VK+hD,GAAkC3vD,GAHlC,YACQ,IAEsD,WAOzE,SAAS4vD,EAAWxvB,GAClB,KAAM//B,gBAAgBuvD,GACpB,MAAM,IAAIx5C,YAAY,oDAGxB/V,KAAK+/B,QAAUA,GAAW,GAmD5B,OA7CAwvB,EAAUvtD,UAAU8K,KAAO,YAC3ByiD,EAAUvtD,UAAU6iD,aAAc,EAOlC0K,EAAUvtD,UAAU0b,QAAU,WAC5B,OAAO1d,KAAK+/B,SAQdwvB,EAAUvtD,UAAUM,SAAW,WAC7B,MAAO,IAAMtC,KAAK+/B,QAAQnxB,KAAK,MAAQ,KASzC2gD,EAAUvtD,UAAUsM,OAAS,WAC3B,MAAO,CACLkhD,OAAQ,YACRzvB,QAAS//B,KAAK+/B,UAWlBwvB,EAAUE,SAAW,SAAUC,GAC7B,OAAO,IAAIH,EAAUG,EAAK3vB,UAGrBwvB,IACN,CAAEI,SAAS,I,oBC/DDC,GAAuCjwD,GAHvC,YACQ,CAAC,MAAO,WAEmD,YAAoB,IAAjBk2C,EAAiB,EAAjBA,GAAI5kB,EAAa,EAAbA,OAC/E89B,EAAYxrC,KAAQuO,MAAM,CAAEhO,UAAWmN,EAAOnN,UAAWE,OAAQT,KAAQiP,SAyC/E,OAxCAu8B,EAAU/sD,UAAYlB,OAAOY,OAAOqtD,EAAU/sD,WAK9C+sD,EAAU/sD,UAAU8K,KAAO,YAC3BiiD,EAAU/sD,UAAUiiD,aAAc,EAQlC8K,EAAU/sD,UAAUsM,OAAS,WAC3B,MAAO,CACLkhD,OAAQ,YACRnuD,MAAOrB,KAAKsC,aAUhBysD,EAAUU,SAAW,SAAUC,GAC7B,OAAO,IAAIX,EAAUW,EAAKruD,QAGxBw0C,GAEFA,EAAG,UAAU,SAAUwV,EAAMlrC,GACvBkrC,EAAKvnC,YAAc3D,EAAK2D,WAC1BirC,EAAU99B,OAAO,CAAEnN,UAAWunC,EAAKvnC,eAKlCirC,IACN,CAAEY,SAAS,I,oBCzCDE,GAAqClwD,GAHrC,UACQ,IAEyD,WAiL5E,OA7KA6W,KAAQxU,UAAU8K,KAAO,UACzB0J,KAAQxU,UAAUkiD,WAAY,EAO9B1tC,KAAQxU,UAAUsM,OAAS,WACzB,MAAO,CACLkhD,OAAQ,UACRh4C,GAAIxX,KAAKwX,GACTC,GAAIzX,KAAKyX,KASbjB,KAAQxU,UAAU8tD,QAAU,WAC1B,MAAO,CACL5uD,EAAGlB,KAAKoW,MACR25C,IAAK/vD,KAAKoR,QAadoF,KAAQxU,UAAU2kD,OAAS,SAAU/hD,GACnC,IACI6S,EAAKzX,KAAKyX,GACVD,EAAKxX,KAAKwX,GACRw4C,EAAQrJ,GAAO3mD,KAAKwX,GAAI5S,GACxBqrD,EAAQtJ,GAAO3mD,KAAKyX,GAAI7S,GAGxBkf,EAAYkgC,EAASp/C,GAAWA,EAAUA,EAAUA,EAAQkf,UAAY,KAC9E,GAAkB,OAAdA,EAAoB,CACtB,IAAMokC,EAAUzlD,KAAK4U,IAAI,IAAKyM,GAC1BrhB,KAAK2T,IAAIoB,EAAKC,GAAMywC,IACtB1wC,EAAK,GAEH/U,KAAK2T,IAAIqB,EAAKD,GAAM0wC,IACtBzwC,EAAK,GAgCT,OA5BW,IAAPA,EAEIu4C,EACU,IAAPx4C,EAEE,IAAPC,EACI,KACW,IAARA,EACH,KAEAw4C,EAAQ,IAIZx4C,EAAK,GACK,IAARA,EACIu4C,EAAQ,OAERA,EAAQ,MAAQC,EAAMx/B,UAAU,GAAK,IAGlC,IAAPhZ,EACIu4C,EAAQ,OAERA,EAAQ,MAAQC,EAAQ,KAkBtCz5C,KAAQ05C,UAAY,SAAU1yC,GAC5B,OAAQ5Z,UAAUC,QAChB,KAAK,EAEH,IAAMuN,EAAMxN,UAAU,GACtB,GAAmB,WAAf,IAAOwN,GACT,OAAOoF,KAAQpF,GAEf,MAAM,IAAI9H,UAAU,kDAGxB,KAAK,EAEH,IAAMpI,EAAI0C,UAAU,GAChBmsD,EAAMnsD,UAAU,GACpB,GAAIogD,EAAS9iD,GAAI,CAMf,GALIkjD,EAAO2L,IAAQA,EAAII,QAAQ,WAE7BJ,EAAMA,EAAIx7C,SAAS,QAGjByvC,EAAS+L,GACX,OAAO,IAAIv5C,KAAQ,CAAEtV,EAAGA,EAAG6uD,IAAKA,IAGlC,MAAM,IAAIzmD,UAAU,0CAEpB,MAAM,IAAIA,UAAU,6BAIxB,QACE,MAAM,IAAIyM,YAAY,qDAI5BS,KAAQxU,UAAU0b,QAAUlH,KAAQxU,UAAUM,SAU9CkU,KAAQi5C,SAAW,SAAUC,GAC3B,OAAO,IAAIl5C,KAAQk5C,IAkBrBl5C,KAAQ6X,QAAU,SAAUpY,EAAGC,GAC7B,OAAID,EAAEuB,GAAKtB,EAAEsB,GAAa,EACtBvB,EAAEuB,GAAKtB,EAAEsB,IAAc,EAEvBvB,EAAEwB,GAAKvB,EAAEuB,GAAa,EACtBxB,EAAEwB,GAAKvB,EAAEuB,IAAc,EAEpB,GAGFjB,OACN,CAAEm5C,SAAS,I,oBCpLDS,GAAsCzwD,GAHtC,WACQ,IAE0D,WA8B7E,OA1BA8yB,KAASzwB,UAAU8K,KAAO,WAC1B2lB,KAASzwB,UAAUmiD,YAAa,EAOhC1xB,KAASzwB,UAAUsM,OAAS,WAC1B,MAAO,CACLkhD,OAAQ,WACR3tD,EAAG7B,KAAKmC,EAAInC,KAAK6B,EACjBnB,EAAGV,KAAKU,IAUZ+xB,KAASg9B,SAAW,SAAUC,GAC5B,OAAO,IAAIj9B,KAASi9B,IAGfj9B,OACN,CAAEk9B,SAAS,IC9BDU,I,MAAmC1wD,GAHnC,QACQ,IAEuD,WAgC1E,SAAS2wD,EAAOjgD,EAAOC,EAAKmwB,GAC1B,KAAMzgC,gBAAgBswD,GACpB,MAAM,IAAIv6C,YAAY,oDAGxB,IAAMw6C,EAAWlgD,QACXmgD,EAASlgD,QACTmgD,EAAUhwB,QAEhB,GAAI8vB,EACF,GAAItM,EAAY5zC,GACdA,EAAQA,EAAMkE,gBACT,GAAqB,iBAAVlE,EAChB,MAAM,IAAI/G,UAAU,oCAGxB,GAAIknD,EACF,GAAIvM,EAAY3zC,GACdA,EAAMA,EAAIiE,gBACL,GAAmB,iBAARjE,EAChB,MAAM,IAAIhH,UAAU,kCAGxB,GAAImnD,EACF,GAAIxM,EAAYxjB,GACdA,EAAOA,EAAKlsB,gBACP,GAAoB,iBAATksB,EAChB,MAAM,IAAIn3B,UAAU,mCAIxBtJ,KAAKqQ,MAAQkgD,EAAWp5C,WAAW9G,GAAS,EAC5CrQ,KAAKsQ,IAAMkgD,EAASr5C,WAAW7G,GAAO,EACtCtQ,KAAKygC,KAAOgwB,EAAUt5C,WAAWspB,GAAQ,EAmP3C,OA7OA6vB,EAAMtuD,UAAU8K,KAAO,QACvBwjD,EAAMtuD,UAAU0iD,SAAU,EAW1B4L,EAAMl5C,MAAQ,SAAUoJ,GACtB,GAAmB,iBAARA,EACT,OAAO,KAGT,IACMkwC,EADOlwC,EAAItL,MAAM,KACL5R,KAAI,SAAU8N,GAC9B,OAAO+F,WAAW/F,MAMpB,GAHgBs/C,EAAK12B,MAAK,SAAU3O,GAClC,OAAOnU,MAAMmU,MAGb,OAAO,KAGT,OAAQqlC,EAAK7sD,QACX,KAAK,EACH,OAAO,IAAIysD,EAAMI,EAAK,GAAIA,EAAK,IACjC,KAAK,EACH,OAAO,IAAIJ,EAAMI,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1C,QACE,OAAO,OAQbJ,EAAMtuD,UAAU8vB,MAAQ,WACtB,OAAO,IAAIw+B,EAAMtwD,KAAKqQ,MAAOrQ,KAAKsQ,IAAKtQ,KAAKygC,OAS9C6vB,EAAMtuD,UAAU0tC,KAAO,WACrB,IAAIr+B,EAAM,EACJhB,EAAQrQ,KAAKqQ,MACbowB,EAAOzgC,KAAKygC,KAEZ0nB,EADMnoD,KAAKsQ,IACED,EAWnB,OATIif,EAAKmR,KAAUnR,EAAK64B,GACtB92C,EAAM5O,KAAKuW,KAAMmvC,EAAQ1nB,GACP,IAAT0nB,IACT92C,EAAM,GAGJ6F,MAAM7F,KACRA,EAAM,GAED,CAACA,IAQVi/C,EAAMtuD,UAAUkR,IAAM,WACpB,IAAMw8B,EAAO1vC,KAAK0vC,OAAO,GAEzB,OAAIA,EAAO,EACL1vC,KAAKygC,KAAO,EAEPzgC,KAAKqQ,MAGLrQ,KAAKqQ,OAASq/B,EAAO,GAAK1vC,KAAKygC,UAGxC,GASJ6vB,EAAMtuD,UAAUmO,IAAM,WACpB,IAAMu/B,EAAO1vC,KAAK0vC,OAAO,GAEzB,OAAIA,EAAO,EACL1vC,KAAKygC,KAAO,EAEPzgC,KAAKqQ,OAASq/B,EAAO,GAAK1vC,KAAKygC,KAG/BzgC,KAAKqQ,WAGd,GAWJigD,EAAMtuD,UAAUiC,QAAU,SAAUumC,GAClC,IAAIj9B,EAAIvN,KAAKqQ,MACPowB,EAAOzgC,KAAKygC,KACZnwB,EAAMtQ,KAAKsQ,IACblQ,EAAI,EAER,GAAIqgC,EAAO,EACT,KAAOlzB,EAAI+C,GACTk6B,EAASj9B,EAAG,CAACnN,GAAIJ,MACjBuN,GAAKkzB,EACLrgC,SAEG,GAAIqgC,EAAO,EAChB,KAAOlzB,EAAI+C,GACTk6B,EAASj9B,EAAG,CAACnN,GAAIJ,MACjBuN,GAAKkzB,EACLrgC,KAcNkwD,EAAMtuD,UAAUsB,IAAM,SAAUknC,GAC9B,IAAMz5B,EAAQ,GAId,OAHA/Q,KAAKiE,SAAQ,SAAU5C,EAAOuM,EAAO3K,GACnC8N,EAAMnD,EAAM,IAAM48B,EAASnpC,EAAOuM,EAAO3K,MAEpC8N,GAQTu/C,EAAMtuD,UAAU2uD,QAAU,WACxB,IAAM5/C,EAAQ,GAId,OAHA/Q,KAAKiE,SAAQ,SAAU5C,EAAOuM,GAC5BmD,EAAMnD,EAAM,IAAMvM,KAEb0P,GAQTu/C,EAAMtuD,UAAU0b,QAAU,WAExB,OAAO1d,KAAK2wD,WAadL,EAAMtuD,UAAU2kD,OAAS,SAAU/hD,GACjC,IAAI4b,EAAMmmC,GAAO3mD,KAAKqQ,MAAOzL,GAM7B,OAJkB,IAAd5E,KAAKygC,OACPjgB,GAAO,IAAMmmC,GAAO3mD,KAAKygC,KAAM77B,IAEjC4b,GAAO,IAAMmmC,GAAO3mD,KAAKsQ,IAAK1L,IAShC0rD,EAAMtuD,UAAUM,SAAW,WACzB,OAAOtC,KAAK2mD,UASd2J,EAAMtuD,UAAUsM,OAAS,WACvB,MAAO,CACLkhD,OAAQ,QACRn/C,MAAOrQ,KAAKqQ,MACZC,IAAKtQ,KAAKsQ,IACVmwB,KAAMzgC,KAAKygC,OAWf6vB,EAAMb,SAAW,SAAUC,GACzB,OAAO,IAAIY,EAAMZ,EAAKr/C,MAAOq/C,EAAKp/C,IAAKo/C,EAAKjvB,OAGvC6vB,IACN,CAAEX,SAAS,KCvTDiB,GAAoCjxD,GAHpC,SACQ,IAEwD,WAuB3E,SAASkxD,IACP,KAAM7wD,gBAAgB6wD,GACpB,MAAM,IAAI96C,YAAY,oDAmN1B,OA5MA86C,EAAO7uD,UAAU8K,KAAO,SACxB+jD,EAAO7uD,UAAUsiD,UAAW,EAU5BuM,EAAO7uD,UAAU8uD,QAAU,WAEzB,MAAM,IAAIlzC,MAAM,gDAWlBizC,EAAO7uD,UAAU+uD,SAAW,WAE1B,MAAM,IAAInzC,MAAM,iDAQlBizC,EAAO7uD,UAAUN,OAAS,SAAUu3B,EAAM83B,GACxC,MAAM,IAAInzC,MAAM,+CAgBlBizC,EAAO7uD,UAAUgvD,OAAS,SAAUpjD,EAAOqqB,EAAaiyB,GAEtD,MAAM,IAAItsC,MAAM,+CAQlBizC,EAAO7uD,UAAUf,IAAM,SAAU2M,GAE/B,MAAM,IAAIgQ,MAAM,4CAYlBizC,EAAO7uD,UAAUiG,IAAM,SAAU2F,EAAOvM,EAAO6oD,GAE7C,MAAM,IAAItsC,MAAM,4CAelBizC,EAAO7uD,UAAUioD,OAAS,SAAUva,EAAMwa,GAExC,MAAM,IAAItsC,MAAM,+CAYlBizC,EAAO7uD,UAAUuoD,QAAU,SAAU7a,EAAMwa,GAEzC,MAAM,IAAItsC,MAAM,gDAOlBizC,EAAO7uD,UAAU8vB,MAAQ,WAEvB,MAAM,IAAIlU,MAAM,8CAOlBizC,EAAO7uD,UAAU0tC,KAAO,WAEtB,MAAM,IAAI9xB,MAAM,6CAalBizC,EAAO7uD,UAAUsB,IAAM,SAAUknC,EAAUymB,GAEzC,MAAM,IAAIrzC,MAAM,4CASlBizC,EAAO7uD,UAAUiC,QAAU,SAAUumC,GAEnC,MAAM,IAAI5sB,MAAM,gDAOlBizC,EAAO7uD,UAAUb,OAAO+B,UAAY,WAElC,MAAM,IAAI0a,MAAM,sCAOlBizC,EAAO7uD,UAAU2uD,QAAU,WAEzB,MAAM,IAAI/yC,MAAM,gDAOlBizC,EAAO7uD,UAAU0b,QAAU,WAEzB,MAAM,IAAIE,MAAM,gDAWlBizC,EAAO7uD,UAAU2kD,OAAS,SAAU/hD,GAElC,MAAM,IAAIgZ,MAAM,+CAOlBizC,EAAO7uD,UAAUM,SAAW,WAE1B,MAAM,IAAIsb,MAAM,iDAGXizC,IACN,CAAElB,SAAS,I,4iCC1Od,IAKauB,GAAyCvxD,GALzC,cACQ,CACnB,WAGgF,YAAgB,IAAbkxD,EAAa,EAAbA,OAMnF,SAAS7B,EAAa/1B,EAAM83B,GAC1B,KAAM/wD,gBAAgBgvD,GAAgB,MAAM,IAAIj5C,YAAY,oDAC5D,GAAIg7C,IAAa1M,EAAS0M,GAAa,MAAM,IAAInzC,MAAM,qBAAuBmzC,GAE9E,GAAIzM,EAASrrB,GAEO,gBAAdA,EAAKnsB,MAEP9M,KAAKmxD,MAAQr/B,GAAMmH,EAAKk4B,OACxBnxD,KAAKoxD,MAAQt/B,GAAMmH,EAAKm4B,OACxBpxD,KAAKqxD,UAAYN,GAAY93B,EAAKo4B,YAGlCrxD,KAAKmxD,MAAQl4B,EAAK03B,UAClB3wD,KAAKoxD,MAAQn4B,EAAKyW,OAClB1vC,KAAKqxD,UAAYN,GAAY93B,EAAKo4B,gBAE/B,GAAIp4B,GAAQtpB,EAAQspB,EAAKA,OAAStpB,EAAQspB,EAAKyW,MAEpD1vC,KAAKmxD,MAAQl4B,EAAKA,KAClBj5B,KAAKoxD,MAAQn4B,EAAKyW,KAElBia,GAAS3pD,KAAKmxD,MAAOnxD,KAAKoxD,OAC1BpxD,KAAKqxD,UAAYN,GAAY93B,EAAK83B,cAC7B,GAAIphD,EAAQspB,GAEjBj5B,KAAKmxD,MAu2BT,SAASG,EAAYr4B,GACnB,IAAK,IAAI74B,EAAI,EAAGgnC,EAAKnO,EAAKp1B,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CAC7C,IAAMgqD,EAAOnxB,EAAK74B,GACduP,EAAQy6C,GACVnxB,EAAK74B,GAAKkxD,EAAWlH,GACZA,IAA0B,IAAlBA,EAAK9F,WACtBrrB,EAAK74B,GAAKkxD,EAAWlH,EAAK1sC,YAI9B,OAAOub,EAj3BQq4B,CAAWr4B,GAExBj5B,KAAKoxD,MAAQ1H,GAAU1pD,KAAKmxD,OAE5BxH,GAAS3pD,KAAKmxD,MAAOnxD,KAAKoxD,OAE1BpxD,KAAKqxD,UAAYN,MACZ,IAAI93B,EAET,MAAM,IAAI3vB,UAAU,6BAA+B68C,EAAOltB,GAAQ,KAGlEj5B,KAAKmxD,MAAQ,GACbnxD,KAAKoxD,MAAQ,CAAC,GACdpxD,KAAKqxD,UAAYN,GAqKrB,SAASQ,EAAMlC,EAAQzhD,GACrB,IAAK+2C,EAAQ/2C,GACX,MAAM,IAAItE,UAAU,iBAItB,GADiBsE,EAAM4jD,WAGrB,OAAOnC,EAAOpuD,IAAI2M,EAAMsF,OAGxB,IAAMw8B,EAAO9hC,EAAM8hC,OACnB,GAAIA,EAAK7rC,SAAWwrD,EAAO+B,MAAMvtD,OAC/B,MAAM,IAAIwlD,GAAe3Z,EAAK7rC,OAAQwrD,EAAO+B,MAAMvtD,QAMrD,IAFA,IAAMqP,EAAMtF,EAAMsF,MACZ/C,EAAMvC,EAAMuC,MACT/P,EAAI,EAAGgnC,EAAKioB,EAAO+B,MAAMvtD,OAAQzD,EAAIgnC,EAAIhnC,IAChD4pD,GAAc92C,EAAI9S,GAAIivD,EAAO+B,MAAMhxD,IACnC4pD,GAAc75C,EAAI/P,GAAIivD,EAAO+B,MAAMhxD,IAKrC,OAAO,IAAI4uD,EAef,SAASyC,EAAex4B,EAAMrrB,EAAO29C,EAAM1B,GACzC,IAAMnmB,EAAQmmB,IAAQ0B,EAAO,EACvBmG,EAAQ9jD,EAAM+jD,UAAU9H,GAE9B,OAAInmB,EACKguB,EAAMpuD,KAAI,SAAUlD,GAEzB,OADA4pD,GAAc5pD,EAAG64B,EAAKp1B,QACfo1B,EAAK74B,MACXsd,UAEIg0C,EAAMpuD,KAAI,SAAUlD,GACzB4pD,GAAc5pD,EAAG64B,EAAKp1B,QACtB,IAAMkmD,EAAQ9wB,EAAK74B,GACnB,OAAOqxD,EAAc1H,EAAOn8C,EAAO29C,EAAM1B,EAAM,MAC9CnsC,UA7BoB+zC,CAAcpC,EAAO8B,MAAOvjD,EAAO8hC,EAAK7rC,OAAQ,GAAIwrD,EAAOgC,WA6CtF,SAASO,EAAMvC,EAAQzhD,EAAOikD,EAAW3H,GACvC,IAAKt8C,IAA2B,IAAlBA,EAAM+2C,QAClB,MAAM,IAAIr7C,UAAU,iBAItB,IAIIwoD,EAJEC,EAAQnkD,EAAM8hC,OACd8hB,EAAW5jD,EAAM4jD,WAWvB,GAPIlN,EAASuN,IACXC,EAAQD,EAAUniB,OAClBmiB,EAAYA,EAAUn0C,WAEtBo0C,EAAQpI,GAAUmI,GAGhBL,EAAU,CAIZ,GAAqB,IAAjBM,EAAMjuD,OACR,MAAM,IAAIyF,UAAU,mBAGtB+lD,EAAOpnD,IAAI2F,EAAMsF,MAAO2+C,EAAW3H,OAC9B,CAIL,GAAI6H,EAAMluD,OAASwrD,EAAO+B,MAAMvtD,OAC9B,MAAM,IAAIwlD,GAAe0I,EAAMluD,OAAQwrD,EAAO+B,MAAMvtD,OAAQ,KAG9D,GAAIiuD,EAAMjuD,OAASkuD,EAAMluD,OAAQ,CAI/B,IAFA,IAAIzD,EAAI,EACJsrD,EAAQ,EACQ,IAAbqG,EAAM3xD,IAAyB,IAAb0xD,EAAM1xD,IAC7BA,IAEF,KAAoB,IAAb2xD,EAAM3xD,IACXsrD,IACAtrD,IAIFyxD,EAAYpG,GAAUoG,EAAWE,EAAMluD,OAAQ6nD,EAAOoG,GAIxD,IAAKxF,GAAgByF,EAAOD,GAC1B,MAAM,IAAIzI,GAAe0I,EAAOD,EAAO,KAOzCE,EAAK3C,EAHQzhD,EAAMuC,MAAM7M,KAAI,SAAUlD,GACrC,OAAOA,EAAI,KAEM8pD,GAGnB,IAAMqB,EAAOwG,EAAMluD,QAkBvB,SAASouD,EAAeh5B,EAAMrrB,EAAOikD,EAAWtG,EAAM1B,GACpD,IAAMnmB,EAAQmmB,IAAQ0B,EAAO,EACvBmG,EAAQ9jD,EAAM+jD,UAAU9H,GAE1BnmB,EACFguB,EAAMztD,SAAQ,SAAUiuD,EAAWC,GACjCnI,GAAckI,GACdj5B,EAAKi5B,GAAaL,EAAUM,EAAS,OAGvCT,EAAMztD,SAAQ,SAAUiuD,EAAWC,GACjCnI,GAAckI,GACdD,EAAch5B,EAAKi5B,GAAYtkD,EAAOikD,EAAUM,EAAS,IAAK5G,EAAM1B,EAAM,MA5B5EoI,CAAc5C,EAAO8B,MAAOvjD,EAAOikD,EAAWtG,EADlC,GAId,OAAO8D,EA8DT,SAASlF,EAASkF,EAAQ3f,EAAMwa,GAE9B,GAAoB,IAAhBxa,EAAK7rC,OAAc,CAIrB,IAFA,IAAI4a,EAAI4wC,EAAO8B,MAERxhD,EAAQ8O,IACbA,EAAIA,EAAE,GAER,OAAOA,EAMT,OAHA4wC,EAAO+B,MAAQ1hB,EAAKt/B,MAAM,GAC1Bi/C,EAAO8B,MAAQlH,GAAOoF,EAAO8B,MAAO9B,EAAO+B,MAAOlH,GAE3CmF,EAmCT,SAAS2C,EAAM3C,EAAQ3f,EAAMwa,GAO3B,IANA,IACEkI,EAAU/C,EAAO+B,MAAMhhD,MAAM,GAE3BiiD,GAAU,EAGPD,EAAQvuD,OAAS6rC,EAAK7rC,QAC3BuuD,EAAQ32C,KAAK,GACb42C,GAAU,EAIZ,IAAK,IAAIjyD,EAAI,EAAGgnC,EAAKsI,EAAK7rC,OAAQzD,EAAIgnC,EAAIhnC,IACpCsvC,EAAKtvC,GAAKgyD,EAAQhyD,KACpBgyD,EAAQhyD,GAAKsvC,EAAKtvC,GAClBiyD,GAAU,GAIVA,GAEFlI,EAAQkF,EAAQ+C,EAASlI,GAgb7B,OAl2BA8E,EAAYhtD,UAAY,IAAI6uD,EAK5B7B,EAAYhtD,UAAUswD,kBAAoB,SAAUr5B,EAAM83B,GACxD,OAAO,IAAI/B,EAAY/1B,EAAM83B,IAM/B/B,EAAYhtD,UAAU8K,KAAO,cAC7BkiD,EAAYhtD,UAAUwiD,eAAgB,EAWtCwK,EAAYhtD,UAAUuwD,YAAc,WAClC,OAAOtG,GAAiBjsD,KAAKmxD,MAAOhL,IAYtC6I,EAAYhtD,UAAU8uD,QAAU,WAC9B,MAAO,SAYT9B,EAAYhtD,UAAU+uD,SAAW,WAC/B,OAAO/wD,KAAKqxD,WASdrC,EAAYhtD,UAAUN,OAAS,SAAUu3B,EAAM83B,GAC7C,OAAO,IAAI/B,EAAY/1B,EAAM83B,IAiB/B/B,EAAYhtD,UAAUgvD,OAAS,SAAUpjD,EAAOqqB,EAAaiyB,GAC3D,OAAQtmD,UAAUC,QAChB,KAAK,EACH,OAAO0tD,EAAKvxD,KAAM4N,GAGpB,KAAK,EACL,KAAK,EACH,OAAOgkD,EAAK5xD,KAAM4N,EAAOqqB,EAAaiyB,GAExC,QACE,MAAM,IAAIn0C,YAAY,+BAU5Bi5C,EAAYhtD,UAAUf,IAAM,SAAU2M,GACpC,IAAK+B,EAAQ/B,GAAU,MAAM,IAAItE,UAAU,kBAC3C,GAAIsE,EAAM/J,SAAW7D,KAAKoxD,MAAMvtD,OAAU,MAAM,IAAIwlD,GAAez7C,EAAM/J,OAAQ7D,KAAKoxD,MAAMvtD,QAG5F,IAAK,IAAI0J,EAAI,EAAGA,EAAIK,EAAM/J,OAAQ0J,IAAOy8C,GAAcp8C,EAAML,GAAIvN,KAAKoxD,MAAM7jD,IAG5E,IADA,IAAI0rB,EAAOj5B,KAAKmxD,MACP/wD,EAAI,EAAGgnC,EAAKx5B,EAAM/J,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CAC9C,IAAMoyD,EAAS5kD,EAAMxN,GACrB4pD,GAAcwI,EAAQv5B,EAAKp1B,QAC3Bo1B,EAAOA,EAAKu5B,GAGd,OAAOv5B,GAaT+1B,EAAYhtD,UAAUiG,IAAM,SAAU2F,EAAOvM,EAAO6oD,GAClD,IAAKv6C,EAAQ/B,GAAU,MAAM,IAAItE,UAAU,kBAC3C,GAAIsE,EAAM/J,OAAS7D,KAAKoxD,MAAMvtD,OAAU,MAAM,IAAIwlD,GAAez7C,EAAM/J,OAAQ7D,KAAKoxD,MAAMvtD,OAAQ,KAElG,IAAIzD,EAAGgnC,EAAIorB,EAMXR,EAAKhyD,KAHQ4N,EAAMtK,KAAI,SAAUlD,GAC/B,OAAOA,EAAI,KAEI8pD,GAGjB,IAAIjxB,EAAOj5B,KAAKmxD,MAChB,IAAK/wD,EAAI,EAAGgnC,EAAKx5B,EAAM/J,OAAS,EAAGzD,EAAIgnC,EAAIhnC,IAEzC4pD,GADAwI,EAAS5kD,EAAMxN,GACO64B,EAAKp1B,QAC3Bo1B,EAAOA,EAAKu5B,GAQd,OAHAxI,GADAwI,EAAS5kD,EAAMA,EAAM/J,OAAS,GACRo1B,EAAKp1B,QAC3Bo1B,EAAKu5B,GAAUnxD,EAERrB,MAgMTgvD,EAAYhtD,UAAUioD,OAAS,SAAUva,EAAMwa,EAAcr4B,GAE3D,IAAK0yB,EAAa7U,GAChB,MAAM,IAAIpmC,UAAU,4BAItB,IAAMmpD,EAAY/iB,EAAKhyB,UAAUpa,KAAI,SAAAjC,GACnC,OAAO6O,MAAMP,QAAQtO,IAA2B,IAAjBA,EAAMwC,OACjCxC,EAAM,GACNA,KAMN,OAAO8oD,EAFGt4B,EAAO7xB,KAAK8xB,QAAU9xB,KAEdyyD,EAAWvI,IAmC/B8E,EAAYhtD,UAAUuoD,QAAU,SAAU7a,EAAM7d,GAC9C,IAAMrxB,EAAIqxB,EAAO7xB,KAAK8xB,QAAU9xB,KAEhCQ,EAAE2wD,MAAQ5G,GAAQ/pD,EAAE2wD,MAAOzhB,GAC3B,IAAMgb,EAAgBlqD,EAAE4wD,MAAMhG,QAAO,SAACvnD,EAAQ6rC,GAAT,OAAkB7rC,EAAS6rC,KAEhE,OADAlvC,EAAE4wD,MAAQvG,GAAqBnb,EAAMgb,GAC9BlqD,GA2CTwuD,EAAYhtD,UAAU8vB,MAAQ,WAM5B,OALU,IAAIk9B,EAAY,CACxB/1B,KAAMnH,GAAM9xB,KAAKmxD,OACjBzhB,KAAM5d,GAAM9xB,KAAKoxD,OACjBL,SAAU/wD,KAAKqxD,aAUnBrC,EAAYhtD,UAAU0tC,KAAO,WAC3B,OAAO1vC,KAAKoxD,MAAMhhD,MAAM,IAa1B4+C,EAAYhtD,UAAUsB,IAAM,SAAUknC,GAEpC,IAAMyW,EAAKjhD,KAaLi5B,EAZU,SAAVy5B,EAAoBrxD,EAAOuM,GAC/B,OAAI+B,EAAQtO,GACHA,EAAMiC,KAAI,SAAUymD,EAAO3pD,GAChC,OAAOsyD,EAAQ3I,EAAOn8C,EAAMoD,OAAO5Q,OAG9BoqC,EAASnpC,EAAOuM,EAAOqzC,GAMrByR,CAAQ1yD,KAAKmxD,MAAO,IAIjC,OAAO,IAAInC,EAAY/1B,OAHan1B,IAAnB9D,KAAKqxD,UAClBpF,GAAiBhzB,EAAMktB,QACvBriD,IAWNkrD,EAAYhtD,UAAUiC,QAAU,SAAUumC,GAExC,IAAMyW,EAAKjhD,MACK,SAAV0yD,EAAoBrxD,EAAOuM,GAC3B+B,EAAQtO,GACVA,EAAM4C,SAAQ,SAAU8lD,EAAO3pD,GAC7BsyD,EAAQ3I,EAAOn8C,EAAMoD,OAAO5Q,OAG9BoqC,EAASnpC,EAAOuM,EAAOqzC,GAG3ByR,CAAQ1yD,KAAKmxD,MAAO,KAOtBnC,EAAYhtD,UAAUb,OAAO+B,UAA7B,WAAyC,SAAS,IAAT,wEAUvC,OATMwvD,EADiC,WACvB,SAAVA,EAAsBrxD,EAAOuM,GAAnB,4EACV+B,EAAQtO,GADE,gBAEHjB,EAAI,EAFD,YAEIA,EAAIiB,EAAMwC,QAFd,gBAGV,uBAAQ6uD,EAAQrxD,EAAMjB,GAAIwN,EAAMoD,OAAO5Q,IAAvC,QAHU,OAEsBA,IAFtB,6CAMZ,OANY,UAML,CAAEiB,QAAOuM,SANJ,qCAAV8kD,MASN,gBAAQA,EAAQ1yD,KAAKmxD,MAAO,IAA5B,QAVuC,+CAiBzCnC,EAAYhtD,UAAU2wD,KAAO,WAC3B,IAAM1nD,EAAS,GAGf,GAAiB,IADPjL,KAAK0vC,OACT7rC,OACJ,MAAM,IAAIyF,UAAU,8CAGtB,IARuC,OAQ1BtJ,KAAKmxD,OARqB,IASvC,2BAAwB,KAAbyB,EAAa,QACtB3nD,EAAOwQ,KAAK,IAAIuzC,EAAY,CAAC4D,GAAM5yD,KAAKqxD,aAVH,8BAavC,OAAOpmD,GAOT+jD,EAAYhtD,UAAU6wD,QAAU,WAAY,WACpC5nD,EAAS,GAET9I,EAAInC,KAAK0vC,OACf,GAAiB,IAAbvtC,EAAE0B,OACJ,MAAM,IAAIyF,UAAU,8CAItB,IADA,IAAM2vB,EAAOj5B,KAAKmxD,MARwB,WASjC/wD,GACP,IAAM0yD,EAAM75B,EAAK31B,KAAI,SAAAsvD,GAAG,MAAI,CAACA,EAAIxyD,OACjC6K,EAAOwQ,KAAK,IAAIuzC,EAAY8D,EAAK,EAAKzB,aAF/BjxD,EAAI,EAAGA,EAAI+B,EAAE,GAAI/B,IAAK,EAAtBA,GAKT,OAAO6K,GAQT+jD,EAAYhtD,UAAU2uD,QAAU,WAC9B,OAAO7+B,GAAM9xB,KAAKmxD,QAQpBnC,EAAYhtD,UAAU0b,QAAU,WAC9B,OAAO1d,KAAKmxD,OAYdnC,EAAYhtD,UAAU2kD,OAAS,SAAU/hD,GACvC,OAAO+hD,GAAO3mD,KAAKmxD,MAAOvsD,IAQ5BoqD,EAAYhtD,UAAUM,SAAW,WAC/B,OAAOqkD,GAAO3mD,KAAKmxD,QAQrBnC,EAAYhtD,UAAUsM,OAAS,WAC7B,MAAO,CACLkhD,OAAQ,cACRv2B,KAAMj5B,KAAKmxD,MACXzhB,KAAM1vC,KAAKoxD,MACXL,SAAU/wD,KAAKqxD,YAYnBrC,EAAYhtD,UAAU+wD,SAAW,SAAUtiD,GAEzC,GAAIA,GAIF,GAFIwzC,EAAYxzC,KAAMA,EAAIA,EAAE8D,aAEvByvC,EAASvzC,KAAO+Z,EAAU/Z,GAC7B,MAAM,IAAInH,UAAU,kDAItBmH,EAAI,EAiBN,IAdA,IAAMuiD,EAASviD,EAAI,EAAIA,EAAI,EACrBwiD,EAAOxiD,EAAI,GAAKA,EAAI,EAGpBkiD,EAAO3yD,KAAKoxD,MAAM,GAClByB,EAAU7yD,KAAKoxD,MAAM,GAGrBvvD,EAAIY,KAAKyQ,IAAIy/C,EAAOM,EAAMJ,EAAUG,GAGpC/5B,EAAO,GAGJ74B,EAAI,EAAGA,EAAIyB,EAAGzB,IACrB64B,EAAK74B,GAAKJ,KAAKmxD,MAAM/wD,EAAI6yD,GAAM7yD,EAAI4yD,GAIrC,OAAO,IAAIhE,EAAY,CACrB/1B,KAAMA,EACNyW,KAAM,CAAC7tC,GACPkvD,SAAU/wD,KAAKqxD,aAgBnBrC,EAAY+D,SAAW,SAAUrjB,EAAMruC,EAAOoP,EAAGy5C,GAC/C,IAAKv6C,EAAQ+/B,GAAS,MAAM,IAAIpmC,UAAU,kCAC1C,GAAoB,IAAhBomC,EAAK7rC,OAAgB,MAAM,IAAI+Z,MAAM,4CAiBzC,GAdA8xB,EAAOA,EAAKpsC,KAAI,SAAUnB,GAOxB,GALI8hD,EAAY9hD,KAEdA,EAAIA,EAAEoS,aAGHyvC,EAAS7hD,KAAOqoB,EAAUroB,IAAMA,EAAI,EACvC,MAAM,IAAIyb,MAAM,yCAElB,OAAOzb,KAILsO,GAIF,GAFIwzC,EAAYxzC,KAAMA,EAAIA,EAAE8D,aAEvByvC,EAASvzC,KAAO+Z,EAAU/Z,GAC7B,MAAM,IAAInH,UAAU,kDAItBmH,EAAI,EAGN,IAWIo8C,EAXEmG,EAASviD,EAAI,EAAIA,EAAI,EACrBwiD,EAAOxiD,EAAI,GAAKA,EAAI,EAGpBkiD,EAAOjjB,EAAK,GACZmjB,EAAUnjB,EAAK,GAGf7tC,EAAIY,KAAKyQ,IAAIy/C,EAAOM,EAAMJ,EAAUG,GAM1C,GAAIrjD,EAAQtO,GAAQ,CAElB,GAAIA,EAAMwC,SAAWhC,EAEnB,MAAM,IAAI+b,MAAM,8BAGlBivC,EAAS,SAAUzsD,GAEjB,OAAOiB,EAAMjB,SAEV,GAAIkkD,EAASjjD,GAAQ,CAE1B,IAAM6xD,EAAK7xD,EAAMquC,OAEjB,GAAkB,IAAdwjB,EAAGrvD,QAAgBqvD,EAAG,KAAOrxD,EAE/B,MAAM,IAAI+b,MAAM,yBAGlBivC,EAAS,SAAUzsD,GAEjB,OAAOiB,EAAMJ,IAAI,CAACb,UAIpBysD,EAAS,WAEP,OAAOxrD,GAKN6oD,IAEHA,EAAejG,EAAY4I,EAAO,IAC9BA,EAAO,GAAGpgC,IAAI,GACd,GAIN,IAAIwM,EAAO,GAGX,GAAIyW,EAAK7rC,OAAS,EAAG,CAEnBo1B,EAAOgxB,GAAOhxB,EAAMyW,EAAMwa,GAE1B,IAAK,IAAIxpD,EAAI,EAAGA,EAAImB,EAAGnB,IACrBu4B,EAAKv4B,EAAIuyD,GAAMvyD,EAAIsyD,GAAUnG,EAAOnsD,GAKxC,OAAO,IAAIsuD,EAAY,CACrB/1B,KAAMA,EACNyW,KAAM,CAACijB,EAAME,MAYjB7D,EAAYS,SAAW,SAAUC,GAC/B,OAAO,IAAIV,EAAYU,IAYzBV,EAAYhtD,UAAUmxD,SAAW,SAAU/yD,EAAG+U,GAE5C,KAAK6uC,EAAS5jD,IAAOoqB,EAAUpqB,IAAO4jD,EAAS7uC,IAAOqV,EAAUrV,IAC9D,MAAM,IAAIyI,MAAM,uCAGlB,GAA0B,IAAtB5d,KAAKoxD,MAAMvtD,OACb,MAAM,IAAI+Z,MAAM,4CASlB,OANAosC,GAAc5pD,EAAGJ,KAAKoxD,MAAM,IAC5BpH,GAAc70C,EAAGnV,KAAKoxD,MAAM,IAG5BpC,EAAYoE,UAAUhzD,EAAG+U,EAAGnV,KAAKmxD,OAE1BnxD,MAUTgvD,EAAYoE,UAAY,SAAUhzD,EAAG+U,EAAG8jB,GAEtC,IAAMo6B,EAAKp6B,EAAK74B,GAChB64B,EAAK74B,GAAK64B,EAAK9jB,GACf8jB,EAAK9jB,GAAKk+C,GAuBLrE,IACN,CAAEW,SAAS,IC55BD2D,GAA8B3zD,GAH9B,QACQ,CAAC,UAEiD,YAmBrE,OAAOmiC,EAnB6E,EAAZA,OAH7D,QAsBQ,CACjByxB,IAAKC,QCpBF,SAASC,GAASC,GACvB,IAEItzD,EAAG+U,EAFDw+C,EAAID,EAAI7vD,OACR+vD,EAAIF,EAAI,GAAG7vD,OAEXsV,EAAM,GACZ,IAAKhE,EAAI,EAAGA,EAAIy+C,EAAGz+C,IAAK,CACtB,IAAMwC,EAAM,GACZ,IAAKvX,EAAI,EAAGA,EAAIuzD,EAAGvzD,IACjBuX,EAAI8D,KAAKi4C,EAAItzD,GAAG+U,IAElBgE,EAAIsC,KAAK9D,GAEX,OAAOwB,ECPF,SAAS06C,GAAqB9iD,GACnC,IAAK,IAAI3Q,EAAI,EAAGA,EAAI2Q,EAAMlN,OAAQzD,IAChC,GAAImkD,EAAaxzC,EAAM3Q,IACrB,OAAO,EAGX,OAAO,EAUF,SAAS0zD,GAAa/iD,EAAOy5B,GAC9B8Z,EAASvzC,KACXA,EAAQA,EAAM2M,WAGhB,IAAK,IAAItd,EAAI,EAAGgnC,EAAKr2B,EAAMlN,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CAC9C,IAAMiB,EAAQ0P,EAAM3Q,GAEhB8P,MAAMP,QAAQtO,GAChByyD,GAAYzyD,EAAOmpC,GAEnBA,EAASnpC,IAiBR,SAAS0yD,GAAShjD,EAAOy5B,EAAUymB,GACxC,OAAIlgD,GAA+B,mBAAdA,EAAMzN,IAElByN,EAAMzN,KAAI,SAAUiK,GACzB,OAAOwmD,GAAQxmD,EAAGi9B,EAAUymB,MAGvBzmB,EAASz5B,GAab,SAASq6C,GAAQsI,EAAK7J,EAAKrf,GAChC,IAAMkF,EAAOx/B,MAAMP,QAAQ+jD,GAAOhK,GAAUgK,GAAOA,EAAIhkB,OACvD,GAAIma,EAAM,GAAMA,GAAOna,EAAK7rC,OAE1B,MAAM,IAAI4lD,GAAWI,EAAKna,EAAK7rC,QAGjC,OAAIygD,EAASoP,GACJA,EAAIhyD,OAAOsyD,GAAQN,EAAIh2C,UAAWmsC,EAAKrf,IAEvCwpB,GAAQN,EAAK7J,EAAKrf,GAY7B,SAASwpB,GAASN,EAAK7J,EAAKrf,GAC1B,IAAIpqC,EAAG+Y,EAAKm+B,EAAK2c,EAEjB,GAAIpK,GAAO,EAAG,CACZ,GAAK35C,MAAMP,QAAQ+jD,EAAI,IAMhB,CAGL,IAFAO,EAAOR,GAAQC,GACfv6C,EAAM,GACD/Y,EAAI,EAAGA,EAAI6zD,EAAKpwD,OAAQzD,IAC3B+Y,EAAI/Y,GAAK4zD,GAAQC,EAAK7zD,GAAIypD,EAAM,EAAGrf,GAErC,OAAOrxB,EAVP,IADAm+B,EAAMoc,EAAI,GACLtzD,EAAI,EAAGA,EAAIszD,EAAI7vD,OAAQzD,IAC1Bk3C,EAAM9M,EAAS8M,EAAKoc,EAAItzD,IAE1B,OAAOk3C,EAWT,IADAn+B,EAAM,GACD/Y,EAAI,EAAGA,EAAIszD,EAAI7vD,OAAQzD,IAC1B+Y,EAAI/Y,GAAK4zD,GAAQN,EAAItzD,GAAIypD,EAAM,EAAGrf,GAEpC,OAAOrxB,EAKJ,SAAS+6C,GAASj+C,EAAGd,EAAGkQ,EAAG9X,EAAGwjB,EAAGkuB,EAAMkV,EAAQ3vD,EAAG4vD,EAASC,EAAQhzD,GAExE,IAKIoP,EAAG6jD,EAAIC,EAAIn0D,EALTo0D,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KAMf,GAAItnD,EAEF,IAAK+mD,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAI/C4U,EAFJjlB,EAAIs0D,EAAOjkD,MAEEwuC,GAEX55B,EAAEjlB,GAAK6+C,EAEPkV,EAAO14C,KAAKrb,GAERi0D,GAEF9mD,EAAEnN,GAAKg0D,EAAU5vD,EAAEgwD,EAAQ/jD,GAAIpP,GAASmD,EAAEnD,EAAOmzD,EAAQ/jD,IAEzDsgB,EAAE3wB,GAAK6+C,GAGP1xC,EAAEnN,GAAKo0D,EAAQ/jD,KAIjBlD,EAAEnN,GAAKg0D,EAAU5vD,EAAEgwD,EAAQ/jD,GAAIlD,EAAEnN,IAAMoE,EAAE+I,EAAEnN,GAAIo0D,EAAQ/jD,IAEvDsgB,EAAE3wB,GAAK6+C,QAKX,IAAKqV,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAI/C4U,EAFJjlB,EAAIs0D,EAAOjkD,MAEEwuC,GAEX55B,EAAEjlB,GAAK6+C,EAEPkV,EAAO14C,KAAKrb,IAGZ2wB,EAAE3wB,GAAK6+C,EC5Kf,IAGa6V,GAAkCn1D,GAHlC,YACQ,CAAC,UAEqD,YA8BzE,OAAOmiC,EA9BiF,EAAZA,OAHjE,YAiCQ,CACjBze,OAAQ0xC,EAERhG,UAAW,SAAUxhD,GACnB,OAAOA,EAAEkd,SAGXgI,SAAU,SAAUllB,GAClB,OAAe,IAARA,EAAE7M,GAAWiW,SAASpJ,EAAE1L,IAGjC,iBAAkB,SAAU0L,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,Y,OCxCjB,SAASg1D,GAAkBznD,GAChC,OAAOA,EAAI,EAIN,SAAS0nD,GAAkB1nD,GAChC,OAAOA,EAAI,EAIN,SAAS2nD,GAAc3nD,GAC5B,OAAa,IAANA,EAIF,SAAS4nD,GAAa5nD,GAC3B,OAAOmJ,OAAOQ,MAAM3J,GAbtBynD,GAAiB3wB,UAVN,SAeX4wB,GAAiB5wB,UAfN,SAoBX6wB,GAAa7wB,UApBF,SAyBX8wB,GAAY9wB,UAzBD,SCEX,IAGa+wB,GAAmCz1D,GAHnC,aACQ,CAAC,UAEsD,YA8B1E,OAAOmiC,EA9BkF,EAAZA,OAHlE,aAiCQ,CACjBze,OAAQ2xC,GAERjG,UAAW,SAAUxhD,GACnB,OAAOA,EAAEoc,UAAYpc,EAAE8Z,WAAa9Z,EAAE2J,SAGxCub,SAAU,SAAUllB,GAClB,OAAOA,EAAEpL,EAAI,GAGfkzD,KAAM,SAAU9nD,GACd,OAAOvN,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC/CXs1D,GAAkC31D,GAHlC,YACQ,CAAC,UAEqD,YA8BzE,OAAOmiC,EA9BiF,EAAZA,OAHjE,YAiCQ,CACjB,0CAA2C,WACzC,OAAO,GAGT,oDAAqD,WACnD,OAAO,GAGT,iBAAkB,SAAUv0B,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzCXu1D,I,OAAwC51D,GAHxC,kBACQ,CAAC,QAAS,cAEkD,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAO0zB,EAAgB,EAAhBA,UA8BzF,OAAO1zB,EAjCI,kBAiCQ,CACjBhlB,OAAQ,SAAUvP,GAChB,OAAOA,EAAEyG,OAAOnQ,OAAS,IAAMqT,MAAMR,OAAOnJ,KAE9CgmD,IAAK,SAAUhmD,GACb,OAAOioD,EAAUjoD,UCjCVkoD,GAAmC91D,GAHnC,aACQ,CAAC,UAEsD,YAgC1E,OAAOmiC,EAhCkF,EAAZA,OAHlE,aAmCQ,CACjBze,OAAQ4xC,GAERlG,UAAW,SAAUxhD,GACnB,OAAQA,EAAEoc,UAAYpc,EAAE8Z,WAAa9Z,EAAE2J,SAGzCub,SAAU,SAAUllB,GAClB,OAAOA,EAAEpL,EAAI,GAAKoL,EAAE1L,EAAI,GAG1BwzD,KAAM,SAAU9nD,GACd,OAAOvN,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YChDX01D,GAA+B/1D,GAH/B,SACQ,CAAC,UAEkD,YAkCtE,OAAOmiC,EAlC8E,EAAZA,OAH9D,SAqCQ,CACjBze,OAAQ6xC,GAERnG,UAAW,SAAUxhD,GACnB,OAAOA,EAAE8Z,UAGX7Q,QAAS,SAAUjJ,GACjB,OAAgB,IAATA,EAAEiK,IAAqB,IAATjK,EAAEkK,IAGzBgb,SAAU,SAAUllB,GAClB,OAAe,IAARA,EAAE7M,GAAmB,IAAR6M,EAAE1L,GAGxBwzD,KAAM,SAAU9nD,GACd,OAAOvN,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCtDX21D,GAA8Bh2D,GAH9B,QACQ,CAAC,UAEiD,YA8BrE,OAAOmiC,EA9B6E,EAAZA,OAH7D,QAiCQ,CACjBze,OAAQ8xC,GAERpG,UAAW,SAAUxhD,GACnB,OAAOA,EAAE2J,SAGXub,SAAU,SAAUllB,GAClB,OAAO,GAGTiJ,QAAS,SAAUjJ,GACjB,OAAOA,EAAE2J,SAGXm+C,KAAM,SAAU9nD,GACd,OAAOmJ,OAAOQ,MAAM3J,EAAElM,QAGxB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGmJ,OAAOQ,aCnDlB0+C,GAA+Bj2D,GAH/B,SACQ,CAAC,UAEkD,YA2DtE,OAAOmiC,EA3D8E,EAAZA,OAH9D,SA8DQ,CACjByxB,IAAKsC,OCzDF,SAAS5N,GAAa16C,EAAGyK,EAAGkwC,GAEjC,GAAIA,QACF,OAAO36C,EAAE4a,GAAGnQ,GAId,GAAIzK,EAAE4a,GAAGnQ,GACP,OAAO,EAIT,GAAIzK,EAAE2J,SAAWc,EAAEd,QACjB,OAAO,EAIT,GAAI3J,EAAEoJ,YAAcqB,EAAErB,WAAY,CAEhC,IAAMwxC,EAAO56C,EAAE0J,MAAMe,GAAG5B,MACxB,GAAI+xC,EAAK9gC,SACP,OAAO,EAGP,IAAMlX,EAAM5C,EAAEpK,YAAYgN,IAAI5C,EAAE6I,MAAO4B,EAAE5B,OACzC,OAAO+xC,EAAKr+B,IAAI3Z,EAAIqX,MAAM0gC,IAK9B,OAAO,EClCT,IAGa4N,GAAoCn2D,GAHpC,cACQ,CAAC,QAAS,WAE8C,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAO7Q,EAAa,EAAbA,OASrF,OAAO6Q,EAZI,cAYQ,CAEjB,mBAAoB,SAAUv0B,EAAGyK,GAC/B,OAAOzK,IAAMyK,GAGf,iBAAkB,SAAUzK,EAAGyK,GAC7B,OAAOiwC,GAAY16C,EAAGyK,EAAGiZ,EAAOi3B,UAGlC,uBAAwB,SAAU36C,EAAGyK,GACnC,OAAOzK,EAAE4a,GAAGnQ,IAAM+9C,GAAexoD,EAAGyK,EAAGiZ,EAAOi3B,UAGhD,qBAAsB,SAAU36C,EAAGyK,GACjC,OAAOzK,EAAEmb,OAAO1Q,IAGlB,mBAAoB,SAAUzK,EAAGyK,GAC/B,OC1BC,SAAwBzK,EAAGyK,EAAGkwC,GACnC,OAAOD,GAAY16C,EAAEiK,GAAIQ,EAAER,GAAI0wC,IAAYD,GAAY16C,EAAEkK,GAAIO,EAAEP,GAAIywC,GDyBxD8N,CAAczoD,EAAGyK,EAAGiZ,EAAOi3B,UAGpC,aAAc,SAAU36C,EAAGyK,GACzB,IAAKzK,EAAE0oD,UAAUj+C,GACf,MAAM,IAAI4F,MAAM,4CAElB,OAAO5d,KAAKuN,EAAElM,MAAO2W,EAAE3W,aE5BhB60D,IFiC0Bv2D,GA3C1B,cA2CwC,CAAC,QAAS,WAAW,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAO7Q,EAAa,EAAbA,OAClF,OAAO6Q,EA5CI,cA4CQ,CACjB,iBAAkB,SAAUv0B,EAAGyK,GAC7B,OAAOiwC,GAAY16C,EAAGyK,EAAGiZ,EAAOi3B,e,MEpCiBvoD,GAP1C,eACQ,CACnB,QACA,cACA,WAGiF,YAAoC,IAAjCmiC,EAAiC,EAAjCA,MAAOq0B,EAA0B,EAA1BA,YAAatF,EAAa,EAAbA,OAOxG,SAASuF,EAAcn9B,EAAM83B,GAC3B,KAAM/wD,gBAAgBo2D,GAAiB,MAAM,IAAIrgD,YAAY,oDAC7D,GAAIg7C,IAAa1M,EAAS0M,GAAa,MAAM,IAAInzC,MAAM,qBAAuBmzC,GAE9E,GAAIzM,EAASrrB,IA0Bf,SAA4Bo2B,EAAQxqD,EAAQksD,GAEtB,iBAAhBlsD,EAAOiI,MAETuiD,EAAOoF,QAAU5vD,EAAO4vD,QAAU3iC,GAAMjtB,EAAO4vD,cAAW3wD,EAC1DurD,EAAOsF,OAAS7iC,GAAMjtB,EAAO8vD,QAC7BtF,EAAOwF,KAAO/iC,GAAMjtB,EAAOgwD,MAC3BxF,EAAO+B,MAAQt/B,GAAMjtB,EAAOusD,OAC5B/B,EAAOgC,UAAYN,GAAYlsD,EAAOwsD,WAGtCgF,EAAiBhH,EAAQxqD,EAAO6Y,UAAWqzC,GAAYlsD,EAAOwsD,WAnC9DiF,CAAkBt2D,KAAMi5B,EAAM83B,QACzB,GAAI93B,GAAQtpB,EAAQspB,EAAKrrB,QAAU+B,EAAQspB,EAAKs9B,MAAQ5mD,EAAQspB,EAAKyW,MAE1E1vC,KAAKy0D,QAAUx7B,EAAKxrB,OACpBzN,KAAK20D,OAAS17B,EAAKrrB,MACnB5N,KAAK60D,KAAO57B,EAAKs9B,IACjBv2D,KAAKoxD,MAAQn4B,EAAKyW,KAClB1vC,KAAKqxD,UAAYN,GAAY93B,EAAK83B,cAC7B,GAAIphD,EAAQspB,GAEjBo9B,EAAiBr2D,KAAMi5B,EAAM83B,OACxB,IAAI93B,EAET,MAAM,IAAI3vB,UAAU,6BAA+B68C,EAAOltB,GAAQ,KAGlEj5B,KAAKy0D,QAAU,GACfz0D,KAAK20D,OAAS,GACd30D,KAAK60D,KAAO,CAAC,GACb70D,KAAKoxD,MAAQ,CAAC,EAAG,GACjBpxD,KAAKqxD,UAAYN,GAmBrB,SAASsF,EAAkBhH,EAAQp2B,EAAM83B,GAEvC1B,EAAOoF,QAAU,GACjBpF,EAAOsF,OAAS,GAChBtF,EAAOwF,KAAO,GACdxF,EAAOgC,UAAYN,EAEnB,IAAM4B,EAAO15B,EAAKp1B,OACdgvD,EAAU,EAGV1qC,EAAKguC,EAELK,EAAO,EAUX,GARInS,EAAS0M,KAEX5oC,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACpF,EAAUA,KAAcoF,EAEtDK,EAAO10B,EAAMsE,QAAQ,EAAG2qB,IAItB4B,EAAO,EAAG,CAEZ,IAAIx9C,EAAI,EACR,EAAG,CAEDk6C,EAAOwF,KAAKp5C,KAAK4zC,EAAOsF,OAAO9wD,QAE/B,IAAK,IAAIzD,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAK,CAE7B,IAAMwyD,EAAM35B,EAAK74B,GAEjB,GAAIuP,EAAQijD,IAIV,GAFU,IAANz9C,GAAW09C,EAAUD,EAAI/uD,SAAUgvD,EAAUD,EAAI/uD,QAEjDsR,EAAIy9C,EAAI/uD,OAAQ,CAElB,IAAM4a,EAAIm0C,EAAIz9C,GAETgT,EAAG1J,EAAG+3C,KAETnH,EAAOoF,QAAQh5C,KAAKgD,GAEpB4wC,EAAOsF,OAAOl5C,KAAKrb,UAKb,IAAN+U,GAAW09C,EAAU,IAAKA,EAAU,GAEnC1qC,EAAGyqC,EAAK4D,KAEXnH,EAAOoF,QAAQh5C,KAAKm3C,GAEpBvD,EAAOsF,OAAOl5C,KAAKrb,IAKzB+U,UAEKA,EAAI09C,GAGbxD,EAAOwF,KAAKp5C,KAAK4zC,EAAOsF,OAAO9wD,QAE/BwrD,EAAO+B,MAAQ,CAACuB,EAAME,GAoHxB,SAAS4D,EAAYpH,EAAQqH,GAE3B,IAAK/R,EAAQ+R,GACX,MAAM,IAAIptD,UAAU,iBAItB,GADiBotD,EAAIlF,WAGnB,OAAOnC,EAAOpuD,IAAIy1D,EAAIxjD,OAGxB,IAMI9S,EAAGgnC,EAAI32B,EAAGkmD,EANRjnB,EAAOgnB,EAAIhnB,OACjB,GAAIA,EAAK7rC,SAAWwrD,EAAO+B,MAAMvtD,OAC/B,MAAM,IAAIwlD,GAAe3Z,EAAK7rC,OAAQwrD,EAAO+B,MAAMvtD,QAOrD,IAAMqP,EAAMwjD,EAAIxjD,MACV/C,EAAMumD,EAAIvmD,MAChB,IAAK/P,EAAI,EAAGgnC,EAAKioB,EAAO+B,MAAMvtD,OAAQzD,EAAIgnC,EAAIhnC,IAC5C4pD,GAAc92C,EAAI9S,GAAIivD,EAAO+B,MAAMhxD,IACnC4pD,GAAc75C,EAAI/P,GAAIivD,EAAO+B,MAAMhxD,IAIrC,IAAMw2D,EAAUvH,EAAOoF,QACjBoC,EAASxH,EAAOsF,OAChBmC,EAAOzH,EAAOwF,KAGdlC,EAAO+D,EAAI/E,UAAU,GACrBkB,EAAU6D,EAAI/E,UAAU,GAGxBtsC,EAAI,GACJ0xC,EAAK,GAGXpE,EAAK1uD,SAAQ,SAAU7D,EAAGc,GAExB61D,EAAG32D,GAAKc,EAAE,GAEVmkB,EAAEjlB,IAAK,KAIT,IAAMqN,EAASmpD,EAAU,QAAK9yD,EACxB8J,EAAQ,GACR2oD,EAAM,GAuBZ,OApBA1D,EAAQ5uD,SAAQ,SAAUkR,GAIxB,IAFAohD,EAAI96C,KAAK7N,EAAM/J,QAEV4M,EAAIqmD,EAAK3hD,GAAIwhD,EAAKG,EAAK3hD,EAAI,GAAI1E,EAAIkmD,EAAIlmD,IAE1CrQ,EAAIy2D,EAAOpmD,IAEE,IAAT4U,EAAEjlB,KAEJwN,EAAM6N,KAAKs7C,EAAG32D,IAEVqN,GAAUA,EAAOgO,KAAKm7C,EAAQnmD,QAKxC8lD,EAAI96C,KAAK7N,EAAM/J,QAGR,IAAIuyD,EAAa,CACtB3oD,OAAQA,EACRG,MAAOA,EACP2oD,IAAKA,EACL7mB,KAAMA,EACNqhB,SAAU1B,EAAOgC,YAIrB,SAAS2F,EAAY3H,EAAQzhD,EAAOikD,EAAW3H,GAE7C,IAAKt8C,IAA2B,IAAlBA,EAAM+2C,QAClB,MAAM,IAAIr7C,UAAU,iBAItB,IAIIwoD,EAJEC,EAAQnkD,EAAM8hC,OACd8hB,EAAW5jD,EAAM4jD,WAevB,GAXIlN,EAASuN,IAEXC,EAAQD,EAAUniB,OAElBmiB,EAAYA,EAAUlB,WAGtBmB,EAAQpI,GAAUmI,GAIhBL,EAAU,CAEZ,GAAqB,IAAjBM,EAAMjuD,OACR,MAAM,IAAIyF,UAAU,mBAGtB+lD,EAAOpnD,IAAI2F,EAAMsF,MAAO2+C,EAAW3H,OAC9B,CAEL,GAAqB,IAAjB6H,EAAMluD,QAAiC,IAAjBkuD,EAAMluD,OAC9B,MAAM,IAAIwlD,GAAe0I,EAAMluD,OAAQwrD,EAAO+B,MAAMvtD,OAAQ,KAI9D,GAAIiuD,EAAMjuD,OAASkuD,EAAMluD,OAAQ,CAI/B,IAFA,IAAIzD,EAAI,EACJsrD,EAAQ,EACQ,IAAbqG,EAAM3xD,IAAyB,IAAb0xD,EAAM1xD,IAC7BA,IAEF,KAAoB,IAAb2xD,EAAM3xD,IACXsrD,IACAtrD,IAGFyxD,EAAYpG,GAAUoG,EAAWE,EAAMluD,OAAQ6nD,EAAOoG,GAIxD,IAAKxF,GAAgByF,EAAOD,GAC1B,MAAM,IAAIzI,GAAe0I,EAAOD,EAAO,KAIzC,GAAqB,IAAjBC,EAAMluD,OAAc,CAER+J,EAAM+jD,UAAU,GACxB1tD,SAAQ,SAAUiuD,EAAWC,GACjCnI,GAAckI,GACd7C,EAAOpnD,IAAI,CAACiqD,EAAW,GAAIL,EAAUM,EAAS,IAAKjI,UAEhD,CAEL,IAAM+M,EAAsBrpD,EAAM+jD,UAAU,GACtCuF,EAAuBtpD,EAAM+jD,UAAU,GAC7CsF,EAAoBhzD,SAAQ,SAAUkzD,EAAgBC,GACpDpN,GAAcmN,GACdD,EAAqBjzD,SAAQ,SAAUozD,EAAiBC,GACtDtN,GAAcqN,GACdhI,EAAOpnD,IAAI,CAACkvD,EAAgBE,GAAkBxF,EAAUuF,EAAc,IAAIE,EAAe,IAAKpN,UAKtG,OAAOmF,EAsGT,SAASkI,EAAgBn3D,EAAGo3D,EAAKC,EAAQ7pD,GAEvC,GAAI6pD,EAASD,GAAQ,EAAK,OAAOC,EAEjC,IAAK,IAAIv2D,EAAIs2D,EAAKt2D,EAAIu2D,EAAQv2D,IAE5B,GAAI0M,EAAM1M,KAAOd,EAAK,OAAOc,EAG/B,OAAOs2D,EAWT,SAASE,EAASjnD,EAAGrQ,EAAG+U,EAAGsJ,EAAGhR,EAAQG,EAAO2oD,GAE3C9oD,EAAO0F,OAAO1C,EAAG,EAAGgO,GAEpB7Q,EAAMuF,OAAO1C,EAAG,EAAGrQ,GAEnB,IAAK,IAAImN,EAAI4H,EAAI,EAAG5H,EAAIgpD,EAAI1yD,OAAQ0J,IAAOgpD,EAAIhpD,KA+CjD,SAAS48C,EAASkF,EAAQsD,EAAME,EAAS3I,GAEvC,IAAI7oD,EAAQ6oD,GAAgB,EAGxB/hC,EAAKguC,EAELK,EAAO,EAEPnS,EAASgL,EAAOgC,aAElBlpC,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAAC9G,EAAOgC,UAAWhC,EAAOgC,aAAe8E,EAEtEK,EAAO10B,EAAMsE,QAAQ,EAAGipB,EAAOgC,WAE/BhwD,EAAQygC,EAAMsE,QAAQ/kC,EAAOguD,EAAOgC,YAItC,IAMIjxD,EAAG+U,EAAG1E,EANJknD,GAAOxvC,EAAG9mB,EAAOm1D,GAGjBt1D,EAAImuD,EAAO+B,MAAM,GACnB3wD,EAAI4uD,EAAO+B,MAAM,GAKrB,GAAIyB,EAAUpyD,EAAG,CAEf,IAAK0U,EAAI1U,EAAG0U,EAAI09C,EAAS19C,IAIvB,GAFAk6C,EAAOwF,KAAK1/C,GAAKk6C,EAAOoF,QAAQ5wD,OAE5B8zD,EAEF,IAAKv3D,EAAI,EAAGA,EAAIc,EAAGd,IAEjBivD,EAAOoF,QAAQh5C,KAAKpa,GAEpBguD,EAAOsF,OAAOl5C,KAAKrb,GAKzBivD,EAAOwF,KAAKhC,GAAWxD,EAAOoF,QAAQ5wD,YAC7BgvD,EAAUpyD,IAEnB4uD,EAAOwF,KAAK1hD,OAAO0/C,EAAU,EAAGpyD,EAAIoyD,GAEpCxD,EAAOoF,QAAQthD,OAAOk8C,EAAOwF,KAAKhC,GAAUxD,EAAOoF,QAAQ5wD,QAC3DwrD,EAAOsF,OAAOxhD,OAAOk8C,EAAOwF,KAAKhC,GAAUxD,EAAOsF,OAAO9wD,SAM3D,GAHApD,EAAIoyD,EAGAF,EAAOzxD,GAET,GAAIy2D,EAAK,CAEP,IAAI91D,EAAI,EAER,IAAKsT,EAAI,EAAGA,EAAI1U,EAAG0U,IAAK,CAEtBk6C,EAAOwF,KAAK1/C,GAAKk6C,EAAOwF,KAAK1/C,GAAKtT,EAElC4O,EAAI4+C,EAAOwF,KAAK1/C,EAAI,GAAKtT,EAEzB,IAAIK,EAAI,EAER,IAAK9B,EAAIc,EAAGd,EAAIuyD,EAAMvyD,IAAK8B,IAEzBmtD,EAAOoF,QAAQthD,OAAO1C,EAAIvO,EAAG,EAAGb,GAEhCguD,EAAOsF,OAAOxhD,OAAO1C,EAAIvO,EAAG,EAAG9B,GAE/ByB,IAIJwtD,EAAOwF,KAAKp0D,GAAK4uD,EAAOoF,QAAQ5wD,aAE7B,GAAI8uD,EAAOzxD,EAAG,CAEnB,IAAIR,EAAI,EAER,IAAKyU,EAAI,EAAGA,EAAI1U,EAAG0U,IAAK,CAEtBk6C,EAAOwF,KAAK1/C,GAAKk6C,EAAOwF,KAAK1/C,GAAKzU,EAElC,IAAM4zD,EAAKjF,EAAOwF,KAAK1/C,GACjBo/C,EAAKlF,EAAOwF,KAAK1/C,EAAI,GAAKzU,EAEhC,IAAK+P,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,KAEnBrQ,EAAIivD,EAAOsF,OAAOlkD,IAEVkiD,EAAO,IAEbtD,EAAOoF,QAAQthD,OAAO1C,EAAG,GAEzB4+C,EAAOsF,OAAOxhD,OAAO1C,EAAG,GAExB/P,KAKN2uD,EAAOwF,KAAK1/C,GAAKk6C,EAAOoF,QAAQ5wD,OAMlC,OAHAwrD,EAAO+B,MAAM,GAAKuB,EAClBtD,EAAO+B,MAAM,GAAKyB,EAEXxD,EAuUT,SAASuI,EAAUnqD,EAAQG,EAAO2oD,EAAK7mB,EAAM7d,GAE3C,IAKIzxB,EAAG+U,EALDw9C,EAAOjjB,EAAK,GACZmjB,EAAUnjB,EAAK,GAEfz5B,EAAI,GAIV,IAAK7V,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAEpB,IADA6V,EAAE7V,GAAK,GACF+U,EAAI,EAAGA,EAAI09C,EAAS19C,IAAOc,EAAE7V,GAAG+U,GAAK,EAI5C,IAAKA,EAAI,EAAGA,EAAI09C,EAAS19C,IAKvB,IAHA,IAAMm/C,EAAKiC,EAAIphD,GACTo/C,EAAKgC,EAAIphD,EAAI,GAEV1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAIvBwF,EAFA7V,EAAIwN,EAAM6C,IAEL0E,GAAK1H,EAAUokB,EAAOC,GAAMrkB,EAAOgD,IAAMhD,EAAOgD,GAAM,EAG/D,OAAOwF,EAgYT,OAvxCAmgD,EAAap0D,UAAY,IAAI6uD,EAK7BuF,EAAap0D,UAAU61D,mBAAqB,SAAU5+B,EAAM83B,GAC1D,OAAO,IAAIqF,EAAan9B,EAAM83B,IAMhCqF,EAAap0D,UAAU8K,KAAO,eAC9BspD,EAAap0D,UAAUyiD,gBAAiB,EAWxC2R,EAAap0D,UAAUuwD,YAAc,WACnC,OAAOtG,GAAiBjsD,KAAKy0D,QAAStO,IAYxCiQ,EAAap0D,UAAU8uD,QAAU,WAC/B,MAAO,UAYTsF,EAAap0D,UAAU+uD,SAAW,WAChC,OAAO/wD,KAAKqxD,WASd+E,EAAap0D,UAAUN,OAAS,SAAUu3B,EAAM83B,GAC9C,OAAO,IAAIqF,EAAan9B,EAAM83B,IAYhCqF,EAAap0D,UAAU81D,QAAU,WAE/B,IAAMnF,EAAO3yD,KAAKoxD,MAAM,GAClByB,EAAU7yD,KAAKoxD,MAAM,GAE3B,OAAgB,IAATuB,GAA0B,IAAZE,EAAiB7yD,KAAK20D,OAAO9wD,QAAU8uD,EAAOE,GAAY,GAiBjFuD,EAAap0D,UAAUgvD,OAAS,SAAUpjD,EAAOqqB,EAAaiyB,GAC5D,IAAKlqD,KAAKy0D,QAAW,MAAM,IAAI72C,MAAM,iDAGrC,OAAQha,UAAUC,QAChB,KAAK,EACH,OAAO4yD,EAAWz2D,KAAM4N,GAG1B,KAAK,EACL,KAAK,EACH,OAAOopD,EAAWh3D,KAAM4N,EAAOqqB,EAAaiyB,GAE9C,QACE,MAAM,IAAIn0C,YAAY,+BA+K5BqgD,EAAap0D,UAAUf,IAAM,SAAU2M,GACrC,IAAK+B,EAAQ/B,GAAU,MAAM,IAAItE,UAAU,kBAC3C,GAAIsE,EAAM/J,SAAW7D,KAAKoxD,MAAMvtD,OAAU,MAAM,IAAIwlD,GAAez7C,EAAM/J,OAAQ7D,KAAKoxD,MAAMvtD,QAG5F,IAAK7D,KAAKy0D,QAAW,MAAM,IAAI72C,MAAM,8CAGrC,IAAMxd,EAAIwN,EAAM,GACVuH,EAAIvH,EAAM,GAGhBo8C,GAAc5pD,EAAGJ,KAAKoxD,MAAM,IAC5BpH,GAAc70C,EAAGnV,KAAKoxD,MAAM,IAG5B,IAAM3gD,EAAI8mD,EAAen3D,EAAGJ,KAAK60D,KAAK1/C,GAAInV,KAAK60D,KAAK1/C,EAAI,GAAInV,KAAK20D,QAEjE,OAAIlkD,EAAIzQ,KAAK60D,KAAK1/C,EAAI,IAAMnV,KAAK20D,OAAOlkD,KAAOrQ,EAAYJ,KAAKy0D,QAAQhkD,GAEjE,GAaT2lD,EAAap0D,UAAUiG,IAAM,SAAU2F,EAAO6Q,EAAGyrC,GAC/C,IAAKv6C,EAAQ/B,GAAU,MAAM,IAAItE,UAAU,kBAC3C,GAAIsE,EAAM/J,SAAW7D,KAAKoxD,MAAMvtD,OAAU,MAAM,IAAIwlD,GAAez7C,EAAM/J,OAAQ7D,KAAKoxD,MAAMvtD,QAG5F,IAAK7D,KAAKy0D,QAAW,MAAM,IAAI72C,MAAM,8CAGrC,IAAMxd,EAAIwN,EAAM,GACVuH,EAAIvH,EAAM,GAGZ+kD,EAAO3yD,KAAKoxD,MAAM,GAClByB,EAAU7yD,KAAKoxD,MAAM,GAGrBjpC,EAAKguC,EAELK,EAAO,EAEPnS,EAASrkD,KAAKqxD,aAEhBlpC,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACn2D,KAAKqxD,UAAWrxD,KAAKqxD,aAAe8E,EAElEK,EAAO10B,EAAMsE,QAAQ,EAAGpmC,KAAKqxD,aAI3BjxD,EAAIuyD,EAAO,GAAKx9C,EAAI09C,EAAU,KAEhC1I,EAAQnqD,KAAMyC,KAAK0N,IAAI/P,EAAI,EAAGuyD,GAAOlwD,KAAK0N,IAAIgF,EAAI,EAAG09C,GAAU3I,GAE/DyI,EAAO3yD,KAAKoxD,MAAM,GAClByB,EAAU7yD,KAAKoxD,MAAM,IAIvBpH,GAAc5pD,EAAGuyD,GACjB3I,GAAc70C,EAAG09C,GAGjB,IAAMpiD,EAAI8mD,EAAen3D,EAAGJ,KAAK60D,KAAK1/C,GAAInV,KAAK60D,KAAK1/C,EAAI,GAAInV,KAAK20D,QAgBjE,OAdIlkD,EAAIzQ,KAAK60D,KAAK1/C,EAAI,IAAMnV,KAAK20D,OAAOlkD,KAAOrQ,EAExC+nB,EAAG1J,EAAG+3C,GA2Bf,SAAkB/lD,EAAG0E,EAAG1H,EAAQG,EAAO2oD,GAErC9oD,EAAO0F,OAAO1C,EAAG,GACjB7C,EAAMuF,OAAO1C,EAAG,GAEhB,IAAK,IAAIlD,EAAI4H,EAAI,EAAG5H,EAAIgpD,EAAI1yD,OAAQ0J,IAAOgpD,EAAIhpD,KA3B3CwqD,CAAQtnD,EAAG0E,EAAGnV,KAAKy0D,QAASz0D,KAAK20D,OAAQ30D,KAAK60D,MAH9C70D,KAAKy0D,QAAQhkD,GAAKgO,EAOpBi5C,EAAQjnD,EAAGrQ,EAAG+U,EAAGsJ,EAAGze,KAAKy0D,QAASz0D,KAAK20D,OAAQ30D,KAAK60D,MAG/C70D,MA+CTo2D,EAAap0D,UAAUioD,OAAS,SAAUva,EAAMwa,EAAcr4B,GAE5D,IAAK0yB,EAAa7U,GAChB,MAAM,IAAIpmC,UAAU,4BAItB,IAAMmpD,EAAY/iB,EAAKhyB,UAAUpa,KAAI,SAAAjC,GACnC,OAAO6O,MAAMP,QAAQtO,IAA2B,IAAjBA,EAAMwC,OACjCxC,EAAM,GACNA,KAGN,GAAyB,IAArBoxD,EAAU5uD,OAAgB,MAAM,IAAI+Z,MAAM,4CAa9C,OAVA60C,EAAUxuD,SAAQ,SAAU5C,GAC1B,IAAK2iD,EAAS3iD,KAAWmpB,EAAUnpB,IAAUA,EAAQ,EACnD,MAAM,IAAIiI,UAAU,uDACNq9C,GAAO8L,GAAa,QAO/BtI,EAFGt4B,EAAO7xB,KAAK8xB,QAAU9xB,KAEdyyD,EAAU,GAAIA,EAAU,GAAIvI,IAyIhDkM,EAAap0D,UAAUuoD,QAAU,SAAUC,EAAO34B,GAEhD,IAAKliB,EAAQ66C,GAAU,MAAM,IAAIlhD,UAAU,kBAC3C,GAAqB,IAAjBkhD,EAAM3mD,OAAgB,MAAM,IAAI+Z,MAAM,0DAG1C4sC,EAAMvmD,SAAQ,SAAU5C,GACtB,IAAK2iD,EAAS3iD,KAAWmpB,EAAUnpB,IAAUA,IAAU,GAAe,IAAVA,EAC1D,MAAM,IAAIiI,UAAU,6DACNq9C,GAAO6D,GAAS,QAIlC,IAAME,EAAgB1qD,KAAKoxD,MAAM,GAAKpxD,KAAKoxD,MAAM,GAKjD,GAAI1G,KAJJF,EAAQK,GAAqBL,EAAOE,IACZ,GAAKF,EAAM,GAIjC,MAAM,IAAI5sC,MAAM,uEAIlB,IAAMpd,EAAIqxB,EAAO7xB,KAAK8xB,QAAU9xB,KAGhC,GAAIA,KAAKoxD,MAAM,KAAO5G,EAAM,IAAMxqD,KAAKoxD,MAAM,KAAO5G,EAAM,GACxD,OAAOhqD,EAKT,IADA,IAAMw3D,EAAW,GACR53D,EAAI,EAAGA,EAAII,EAAEq0D,KAAKhxD,OAAQzD,IACjC,IAAK,IAAI+U,EAAI,EAAGA,EAAI3U,EAAEq0D,KAAKz0D,EAAI,GAAKI,EAAEq0D,KAAKz0D,GAAI+U,IAC7C6iD,EAASv8C,KAAKrb,GAWlB,IANA,IAAMqN,EAASjN,EAAEi0D,QAAQrkD,QAGnB6nD,EAAWz3D,EAAEm0D,OAAOvkD,QAGjBhQ,EAAI,EAAGA,EAAII,EAAEm0D,OAAO9wD,OAAQzD,IAAK,CACxC,IAAM83D,EAAKD,EAAS73D,GACd+3D,EAAKH,EAAS53D,GACdwrD,EAAOsM,EAAK13D,EAAE4wD,MAAM,GAAK+G,EAC/BH,EAAS53D,GAAKwrD,EAAOpB,EAAM,GAC3ByN,EAAS73D,GAAKqC,KAAKwW,MAAM2yC,EAAOpB,EAAM,IAUxChqD,EAAEi0D,QAAQ5wD,OAAS,EACnBrD,EAAEm0D,OAAO9wD,OAAS,EAClBrD,EAAEq0D,KAAKhxD,OAAS2mD,EAAM,GAAK,EAC3BhqD,EAAE4wD,MAAQ5G,EAAMp6C,QAChB,IAAK,IAAIhQ,EAAI,EAAGA,EAAII,EAAEq0D,KAAKhxD,OAAQzD,IACjCI,EAAEq0D,KAAKz0D,GAAK,EAKd,IAAK,IAAI+gD,EAAI,EAAGA,EAAI1zC,EAAO5J,OAAQs9C,IAAK,CACtC,IAAM/gD,EAAI63D,EAAS9W,GACbhsC,EAAI6iD,EAAS7W,GACb1iC,EAAIhR,EAAO0zC,GAEjBuW,EADUH,EAAen3D,EAAGI,EAAEq0D,KAAK1/C,GAAI3U,EAAEq0D,KAAK1/C,EAAI,GAAI3U,EAAEm0D,QAC7Cv0D,EAAG+U,EAAGsJ,EAAGje,EAAEi0D,QAASj0D,EAAEm0D,OAAQn0D,EAAEq0D,MAK7C,OAAOr0D,GAQT41D,EAAap0D,UAAU8vB,MAAQ,WAQ7B,OAPU,IAAIskC,EAAa,CACzB3oD,OAAQzN,KAAKy0D,QAAU3iC,GAAM9xB,KAAKy0D,cAAW3wD,EAC7C8J,MAAOkkB,GAAM9xB,KAAK20D,QAClB4B,IAAKzkC,GAAM9xB,KAAK60D,MAChBnlB,KAAM5d,GAAM9xB,KAAKoxD,OACjBL,SAAU/wD,KAAKqxD,aAUnB+E,EAAap0D,UAAU0tC,KAAO,WAC5B,OAAO1vC,KAAKoxD,MAAMhhD,MAAM,IAc1BgmD,EAAap0D,UAAUsB,IAAM,SAAUknC,EAAUymB,GAE/C,IAAKjxD,KAAKy0D,QAAW,MAAM,IAAI72C,MAAM,8CAErC,IAAMqjC,EAAKjhD,KAUX,OAOF,SAAeqvD,EAAQ+I,EAAQC,EAAQC,EAAWC,EAAW/tB,EAAUymB,GAErE,IAAMxjD,EAAS,GACTG,EAAQ,GACR2oD,EAAM,GAGRpuC,EAAKguC,EAELK,EAAO,EAEPnS,EAASgL,EAAOgC,aAElBlpC,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAAC9G,EAAOgC,UAAWhC,EAAOgC,aAAe8E,EAEtEK,EAAO10B,EAAMsE,QAAQ,EAAGipB,EAAOgC,YAgBjC,IAZA,IAAMxT,EAAS,SAAUp/B,EAAGlR,EAAGyK,GAE7ByG,EAAI+rB,EAAS/rB,EAAGlR,EAAGyK,GAEdmQ,EAAG1J,EAAG+3C,KAET/oD,EAAOgO,KAAKgD,GAEZ7Q,EAAM6N,KAAKlO,KAIN4H,EAAImjD,EAAWnjD,GAAKojD,EAAWpjD,IAAK,CAE3CohD,EAAI96C,KAAKhO,EAAO5J,QAEhB,IAAMywD,EAAKjF,EAAOwF,KAAK1/C,GACjBo/C,EAAKlF,EAAOwF,KAAK1/C,EAAI,GAE3B,GAAI87C,EAEF,IAAK,IAAIxgD,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5B,IAAMrQ,EAAIivD,EAAOsF,OAAOlkD,GAEpBrQ,GAAKg4D,GAAUh4D,GAAKi4D,GAEtBxa,EAAOwR,EAAOoF,QAAQhkD,GAAIrQ,EAAIg4D,EAAQjjD,EAAImjD,OAGzC,CAGL,IADA,IAAM7qD,EAAS,GACNgD,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAC5B,IAAMrQ,EAAIivD,EAAOsF,OAAOlkD,GACxBhD,EAAOrN,GAAKivD,EAAOoF,QAAQhkD,GAK7B,IAAK,IAAIrQ,EAAIg4D,EAAQh4D,GAAKi4D,EAAQj4D,IAAK,CACrC,IAAMiB,EAASjB,KAAKqN,EAAUA,EAAOrN,GAAK,EAC1Cy9C,EAAOx8C,EAAOjB,EAAIg4D,EAAQjjD,EAAImjD,KAQpC,OAFA/B,EAAI96C,KAAKhO,EAAO5J,QAET,IAAIuyD,EAAa,CACtB3oD,OAAQA,EACRG,MAAOA,EACP2oD,IAAKA,EACL7mB,KAAM,CAAC2oB,EAASD,EAAS,EAAGG,EAAYD,EAAY,KAhF/CE,CAAKx4D,KAAM,EARLA,KAAKoxD,MAAM,GAQI,EAAG,EAPfpxD,KAAKoxD,MAAM,GAOiB,GAL7B,SAAU3yC,EAAGre,EAAG+U,GAE7B,OAAOq1B,EAAS/rB,EAAG,CAACre,EAAG+U,GAAI8rC,KAG0BgQ,IA8FzDmF,EAAap0D,UAAUiC,QAAU,SAAUumC,EAAUymB,GAEnD,IAAKjxD,KAAKy0D,QAAW,MAAM,IAAI72C,MAAM,kDAOrC,IALA,IAEM+0C,EAAO3yD,KAAKoxD,MAAM,GAClByB,EAAU7yD,KAAKoxD,MAAM,GAElBj8C,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhC,IAAMm/C,EAAKt0D,KAAK60D,KAAK1/C,GACfo/C,EAAKv0D,KAAK60D,KAAK1/C,EAAI,GAEzB,GAAI87C,EAEF,IAAK,IAAIxgD,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5B,IAAMrQ,EAAIJ,KAAK20D,OAAOlkD,GAGtB+5B,EAASxqC,KAAKy0D,QAAQhkD,GAAI,CAACrQ,EAAG+U,GAjBzBnV,UAmBF,CAGL,IADA,IAAMyN,EAAS,GACNgD,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5BhD,EADUzN,KAAK20D,OAAOlkD,IACVzQ,KAAKy0D,QAAQhkD,GAK3B,IAAK,IAAIrQ,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAK,CAE7BoqC,EADepqC,KAAKqN,EAAUA,EAAOrN,GAAK,EAC1B,CAACA,EAAG+U,GA/BfnV,UAyCbo2D,EAAap0D,UAAUb,OAAO+B,UAA9B,WAA0C,SAAS,IAAT,qFACnClD,KAAKy0D,QAD8B,sBACb,IAAI72C,MAAM,wCADG,OAGlCi1C,EAAU7yD,KAAKoxD,MAAM,GAElBj8C,EAAI,EAL2B,YAKxBA,EAAI09C,GALoB,iBAMhCyB,EAAKt0D,KAAK60D,KAAK1/C,GACfo/C,EAAKv0D,KAAK60D,KAAK1/C,EAAI,GAEhB1E,EAAI6jD,EATyB,YASrB7jD,EAAI8jD,GATiB,iBAapC,OAFMn0D,EAAIJ,KAAK20D,OAAOlkD,GAXc,UAa7B,CAAEpP,MAAOrB,KAAKy0D,QAAQhkD,GAAI7C,MAAO,CAACxN,EAAG+U,IAbR,QASb1E,IATa,uBAKX0E,IALW,+DAuB1CihD,EAAap0D,UAAU2uD,QAAU,WAC/B,OAAOiH,EAAS53D,KAAKy0D,QAASz0D,KAAK20D,OAAQ30D,KAAK60D,KAAM70D,KAAKoxD,OAAO,IAQpEgF,EAAap0D,UAAU0b,QAAU,WAC/B,OAAOk6C,EAAS53D,KAAKy0D,QAASz0D,KAAK20D,OAAQ30D,KAAK60D,KAAM70D,KAAKoxD,OAAO,IA0CpEgF,EAAap0D,UAAU2kD,OAAS,SAAU/hD,GASxC,IAPA,IAAM+tD,EAAO3yD,KAAKoxD,MAAM,GAClByB,EAAU7yD,KAAKoxD,MAAM,GAErB0G,EAAU93D,KAAK83D,UAEjBt3C,EAAM,kBAAoBmmC,GAAOgM,EAAM/tD,GAAW,MAAQ+hD,GAAOkM,EAASjuD,GAAW,cAAgB+hD,GAAOmR,EAASlzD,GAAW,KAE3HuQ,EAAI,EAAGA,EAAI09C,EAAS19C,IAK3B,IAHA,IAAMm/C,EAAKt0D,KAAK60D,KAAK1/C,GACfo/C,EAAKv0D,KAAK60D,KAAK1/C,EAAI,GAEhB1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAI5B+P,GAAO,UAAYmmC,GAFT3mD,KAAK20D,OAAOlkD,GAEO7L,GAAW,KAAO+hD,GAAOxxC,EAAGvQ,GAAW,UAAY5E,KAAKy0D,QAAU9N,GAAO3mD,KAAKy0D,QAAQhkD,GAAI7L,GAAW,KAGtI,OAAO4b,GAQT41C,EAAap0D,UAAUM,SAAW,WAChC,OAAOqkD,GAAO3mD,KAAK2wD,YAQrByF,EAAap0D,UAAUsM,OAAS,WAC9B,MAAO,CACLkhD,OAAQ,eACR/hD,OAAQzN,KAAKy0D,QACb7mD,MAAO5N,KAAK20D,OACZ4B,IAAKv2D,KAAK60D,KACVnlB,KAAM1vC,KAAKoxD,MACXL,SAAU/wD,KAAKqxD,YAYnB+E,EAAap0D,UAAU+wD,SAAW,SAAUtiD,GAE1C,GAAIA,GAIF,GAFIwzC,EAAYxzC,KAAMA,EAAIA,EAAE8D,aAEvByvC,EAASvzC,KAAO+Z,EAAU/Z,GAC7B,MAAM,IAAInH,UAAU,kDAItBmH,EAAI,EAGN,IAAMuiD,EAASviD,EAAI,EAAIA,EAAI,EACrBwiD,EAAOxiD,EAAI,GAAKA,EAAI,EAGpBkiD,EAAO3yD,KAAKoxD,MAAM,GAClByB,EAAU7yD,KAAKoxD,MAAM,GAGrBvvD,EAAIY,KAAKyQ,IAAIy/C,EAAOM,EAAMJ,EAAUG,GAGpCvlD,EAAS,GACTG,EAAQ,GACR2oD,EAAM,GAEZA,EAAI,GAAK,EAET,IAAK,IAAIphD,EAAI69C,EAAQ79C,EAAI09C,GAAWplD,EAAO5J,OAAShC,EAAGsT,IAKrD,IAHA,IAAMm/C,EAAKt0D,KAAK60D,KAAK1/C,GACfo/C,EAAKv0D,KAAK60D,KAAK1/C,EAAI,GAEhB5H,EAAI+mD,EAAI/mD,EAAIgnD,EAAIhnD,IAAK,CAE5B,IAAMnN,EAAIJ,KAAK20D,OAAOpnD,GAEtB,GAAInN,IAAM+U,EAAI69C,EAASC,EAAM,CAE3BxlD,EAAOgO,KAAKzb,KAAKy0D,QAAQlnD,IAEzBK,EAAMH,EAAO5J,OAAS,GAAKzD,EAAI6yD,EAE/B,OAON,OAFAsD,EAAI96C,KAAKhO,EAAO5J,QAET,IAAIuyD,EAAa,CACtB3oD,OAAQA,EACRG,MAAOA,EACP2oD,IAAKA,EACL7mB,KAAM,CAAC7tC,EAAG,MAYdu0D,EAAa3G,SAAW,SAAUC,GAChC,OAAO,IAAI0G,EAAa1G,IAe1B0G,EAAarD,SAAW,SAAUrjB,EAAMruC,EAAOoP,EAAGy5C,EAAc6G,GAC9D,IAAKphD,EAAQ+/B,GAAS,MAAM,IAAIpmC,UAAU,kCAC1C,GAAoB,IAAhBomC,EAAK7rC,OAAgB,MAAM,IAAI+Z,MAAM,4CAiBzC,GAdA8xB,EAAOA,EAAKpsC,KAAI,SAAUnB,GAOxB,GALI8hD,EAAY9hD,KAEdA,EAAIA,EAAEoS,aAGHyvC,EAAS7hD,KAAOqoB,EAAUroB,IAAMA,EAAI,EACvC,MAAM,IAAIyb,MAAM,yCAElB,OAAOzb,KAILsO,GAIF,GAFIwzC,EAAYxzC,KAAMA,EAAIA,EAAE8D,aAEvByvC,EAASvzC,KAAO+Z,EAAU/Z,GAC7B,MAAM,IAAInH,UAAU,kDAItBmH,EAAI,EAIN,IAAI0X,EAAKguC,EAELK,EAAO,EAEPnS,EAAS0M,KAEX5oC,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACpF,EAAUA,KAAcoF,EAEtDK,EAAO10B,EAAMsE,QAAQ,EAAG2qB,IAG1B,IAWIlE,EAXEmG,EAASviD,EAAI,EAAIA,EAAI,EACrBwiD,EAAOxiD,EAAI,GAAKA,EAAI,EAGpBkiD,EAAOjjB,EAAK,GACZmjB,EAAUnjB,EAAK,GAGf7tC,EAAIY,KAAKyQ,IAAIy/C,EAAOM,EAAMJ,EAAUG,GAM1C,GAAIrjD,EAAQtO,GAAQ,CAElB,GAAIA,EAAMwC,SAAWhC,EAEnB,MAAM,IAAI+b,MAAM,8BAGlBivC,EAAS,SAAUzsD,GAEjB,OAAOiB,EAAMjB,SAEV,GAAIkkD,EAASjjD,GAAQ,CAE1B,IAAM6xD,EAAK7xD,EAAMquC,OAEjB,GAAkB,IAAdwjB,EAAGrvD,QAAgBqvD,EAAG,KAAOrxD,EAE/B,MAAM,IAAI+b,MAAM,yBAGlBivC,EAAS,SAAUzsD,GAEjB,OAAOiB,EAAMJ,IAAI,CAACb,UAIpBysD,EAAS,WAEP,OAAOxrD,GAUX,IALA,IAAMoM,EAAS,GACTG,EAAQ,GACR2oD,EAAM,GAGHphD,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhCohD,EAAI96C,KAAKhO,EAAO5J,QAEhB,IAAMzD,EAAI+U,EAAI69C,EAEd,GAAI5yD,GAAK,GAAKA,EAAIyB,EAAG,CAEnB,IAAM4c,EAAIouC,EAAOzsD,GAEZ+nB,EAAG1J,EAAG+3C,KAET5oD,EAAM6N,KAAKrb,EAAI6yD,GAEfxlD,EAAOgO,KAAKgD,KAOlB,OAFA83C,EAAI96C,KAAKhO,EAAO5J,QAET,IAAIuyD,EAAa,CACtB3oD,OAAQA,EACRG,MAAOA,EACP2oD,IAAKA,EACL7mB,KAAM,CAACijB,EAAME,MAajBuD,EAAap0D,UAAUmxD,SAAW,SAAU/yD,EAAG+U,GAE7C,KAAK6uC,EAAS5jD,IAAOoqB,EAAUpqB,IAAO4jD,EAAS7uC,IAAOqV,EAAUrV,IAC9D,MAAM,IAAIyI,MAAM,uCAGlB,GAA0B,IAAtB5d,KAAKoxD,MAAMvtD,OACb,MAAM,IAAI+Z,MAAM,4CASlB,OANAosC,GAAc5pD,EAAGJ,KAAKoxD,MAAM,IAC5BpH,GAAc70C,EAAGnV,KAAKoxD,MAAM,IAG5BgF,EAAahD,UAAUhzD,EAAG+U,EAAGnV,KAAKoxD,MAAM,GAAIpxD,KAAKy0D,QAASz0D,KAAK20D,OAAQ30D,KAAK60D,MAErE70D,MAYTo2D,EAAaqC,YAAc,SAAUtjD,EAAG1H,EAAQG,EAAO2oD,EAAK/rB,GAK1D,IAHA,IAAM8pB,EAAKiC,EAAIphD,GACTo/C,EAAKgC,EAAIphD,EAAI,GAEV1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAEvB+5B,EAAS58B,EAAM6C,GAAIhD,EAAOgD,KAc9B2lD,EAAahD,UAAY,SAAU7lD,EAAGyK,EAAG66C,EAASplD,EAAQG,EAAO2oD,GAE/D,IAAK,IAAIphD,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhC,IAAMm/C,EAAKiC,EAAIphD,GACTo/C,EAAKgC,EAAIphD,EAAI,GAEbujD,EAAKnB,EAAehqD,EAAG+mD,EAAIC,EAAI3mD,GAE/B+qD,EAAKpB,EAAev/C,EAAGs8C,EAAIC,EAAI3mD,GAErC,GAAI8qD,EAAKnE,GAAMoE,EAAKpE,GAAM3mD,EAAM8qD,KAAQnrD,GAAKK,EAAM+qD,KAAQ3gD,GAEzD,GAAIvK,EAAQ,CACV,IAAMgR,EAAIhR,EAAOirD,GACjBjrD,EAAOirD,GAAMjrD,EAAOkrD,GACpBlrD,EAAOkrD,GAAMl6C,QAMjB,GAAIi6C,EAAKnE,GAAM3mD,EAAM8qD,KAAQnrD,IAAMorD,GAAMpE,GAAM3mD,EAAM+qD,KAAQ3gD,GAA7D,CAEE,IAAM4gD,EAAKnrD,EAASA,EAAOirD,QAAM50D,EAEjC8J,EAAMuF,OAAOwlD,EAAI,EAAG3gD,GAChBvK,GAAUA,EAAO0F,OAAOwlD,EAAI,EAAGC,GAEnChrD,EAAMuF,OAAOwlD,GAAMD,EAAKA,EAAK,EAAIA,EAAI,GACjCjrD,GAAUA,EAAO0F,OAAOwlD,GAAMD,EAAKA,EAAK,EAAIA,EAAI,QAKtD,GAAIC,EAAKpE,GAAM3mD,EAAM+qD,KAAQ3gD,IAAM0gD,GAAMnE,GAAM3mD,EAAM8qD,KAAQnrD,GAAI,CAE/D,IAAMsrD,EAAKprD,EAASA,EAAOkrD,QAAM70D,EAEjC8J,EAAMuF,OAAOulD,EAAI,EAAGnrD,GAChBE,GAAUA,EAAO0F,OAAOulD,EAAI,EAAGG,GAEnCjrD,EAAMuF,OAAOulD,GAAMC,EAAKA,EAAK,EAAIA,EAAI,GACjClrD,GAAUA,EAAO0F,OAAOulD,GAAMC,EAAKA,EAAK,EAAIA,EAAI,MAKnDvC,IACN,CAAEzG,SAAS,KCz3CP,IAAMmJ,GAA+Bn5D,GAvC/B,SACQ,CAAC,UAsCkD,YAAe,IA0B/E0jB,GAASye,EA1BsE,EAAZA,OA0BpD,SAAU,CAC7B,GAAI,WACF,OAAO,GAGTze,OAAQ,SAAU9V,GAChB,OAAOA,GAGTuP,OAAQ,SAAUvP,GAChB,GAAU,QAANA,EAAa,OAAOuH,IACxB,IApE6B4nB,EAC3Bq8B,EAmEIC,GAnEJD,GAD2Br8B,EAoE0BnvB,GAnEpBwJ,MAAM,2CAKpC,CAAE2lB,QAAOhoB,MAHD,CAAE,KAAM,EAAG,KAAM,EAAG,KAAM,IAAMqkD,EAAyB,IAGjDE,YAFHF,EAAyB,GAETG,eADbH,EAAyB,IAGzC,KA6DL,GAAIC,EACF,OArDR,SAAwCG,GAGtC,IAFA,IAAMt3D,EAAIkT,SAASokD,EAAMF,YAAaE,EAAMzkD,OACxClQ,EAAI,EACCpE,EAAI,EAAGA,EAAI+4D,EAAMD,eAAer1D,OAAQzD,IAAK,CAEpDoE,GADmBuQ,SAASokD,EAAMD,eAAe94D,GAAI+4D,EAAMzkD,OACzCjS,KAAK4U,IAAI8hD,EAAMzkD,MAAOtU,EAAI,GAE9C,IAAM6K,EAASpJ,EAAI2C,EACnB,GAAI0S,MAAMjM,GACR,MAAM,IAAI8K,YAAY,WAAaojD,EAAMz8B,MAAQ,wBAEnD,OAAOzxB,EA0CMmuD,CAA8BJ,GAEvC,IAAItpB,EAAO,EACL2pB,EAAsB9rD,EAAEwJ,MAAM,iCAChCsiD,IAGF3pB,EAAOh5B,OAAO2iD,EAAoB,IAClC9rD,EAAI8rD,EAAoB,IAE1B,IAAIhuC,EAAM3U,OAAOnJ,GACjB,GAAI2J,MAAMmU,GACR,MAAM,IAAItV,YAAY,WAAaxI,EAAI,wBAEzC,GAAI8rD,EAAqB,CAGvB,GAAIhuC,EAAM,WAAKqkB,GAAO,EAEpB,MAAM,IAAI35B,YAAJ,kBAA2BxI,EAA3B,sBAGJ8d,GAAO,KAAJ,IAAI,EAAMqkB,EAAO,KACtBrkB,GAAY,KAAH,IAAG,EAAKqkB,IAGrB,OAAOrkB,GAGT0jC,UAAW,SAAUxhD,GACnB,OAAOA,EAAEgH,YAGXke,SAAU,SAAUllB,GAClB,OAAOA,EAAEmQ,WAGX23C,KAAM,SAAU9nD,GACd,MAAM,IAAIqQ,MAAM,iDAGlB07C,KAAM,SAAU/rD,GACd,OAAO,GAGT,sBAAuB,SAAUgsD,EAAMC,GACrC,OAAOD,EAAKhlD,SAASilD,IAGvB,iBAAkB,SAAUjsD,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,SAatB,OAJAqjB,EAAOosC,SAAW,SAAUC,GAC1B,OAAOv4C,WAAWu4C,EAAKruD,QAGlBgiB,KCzIIo2C,GAA+B95D,GAH/B,SACQ,CAAC,UAEkD,YA0BtE,OAAOmiC,EA1B8E,EAAZA,OAH9D,SA6BQ,CACjB,GAAI,WACF,MAAO,IAGTze,OAAQsjC,GAER2S,KAAM,SAAU/rD,GACd,MAAO,QAGTmsD,QAAS,SAAUnsD,GACjB,OAAOA,EAAI,IAGbuP,OAAQ,SAAUvP,GAChB,OAAOA,GAGT,iBAAkB,SAAUA,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,OAGpBuzD,IAAK,SAAUhmD,GACb,OAAOnD,OAAOmD,SCnDPosD,GAAgCh6D,GAHhC,UACQ,CAAC,UAEmD,YA4BvE,OAAOmiC,EA5B+E,EAAZA,OAH/D,UA+BQ,CACjB,GAAI,WACF,OAAO,GAGT43B,QAAS,SAAUnsD,GACjB,OAAOA,GAGT8V,OAAQ,SAAU9V,GAChB,QAASA,GAGX+rD,KAAM,SAAU/rD,GACd,OAAO,GAGTwhD,UAAW,SAAUxhD,GACnB,OAAQA,EAAE8Z,UAGZvK,OAAQ,SAAUvP,GAEhB,IAAMqsD,EAAQrsD,EAAEsjB,cAChB,GAAc,SAAV+oC,EACF,OAAO,EACF,GAAc,UAAVA,EACT,OAAO,EAIT,IAAMvuC,EAAM3U,OAAOnJ,GACnB,GAAU,KAANA,IAAa2J,MAAMmU,GACrB,QAASA,EAGX,MAAM,IAAIzN,MAAM,mBAAqBrQ,EAAI,mBAG3C,iBAAkB,SAAUA,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCpEX65D,GAAkCl6D,GAHlC,YACQ,CAAC,QAAS,cAE4C,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UA0BnF,OAAOjtB,EAAM,YAAa,CACxB,GAAI,WACF,OAAO,IAAIitB,EAAU,IAGvB1rC,OAAQ,SAAU9V,GAEhB,OAAO,IAAIwhD,EAAUxhD,EAAI,KAG3BuP,OAAQ,SAAUvP,GAChB,IAAM8rD,EAAsB9rD,EAAEwJ,MAAM,iCACpC,GAAIsiD,EAAqB,CAEvB,IAAM3pB,EAAO2pB,EAAoB,GAC3Bx3D,EAAIktD,EAAUsK,EAAoB,IAClCS,EAAa,IAAI/K,EAAU,GAAG13C,IAAIX,OAAOg5B,IAC/C,GAAI7tC,EAAE4kB,GAAGqzC,EAAWtuC,IAAI,IACtB,MAAM,IAAIzV,YAAJ,kBAA2BxI,EAA3B,sBAER,IAAMwsD,EAAmB,IAAIhL,EAAU,GAAG13C,IAAIX,OAAOg5B,GAAQ,GAC7D,OAAI7tC,EAAEgnB,IAAIkxC,GACDl4D,EAAE2pB,IAAIsuC,GAENj4D,EAGX,OAAO,IAAIktD,EAAUxhD,IAGvBwhD,UAAW,SAAUxhD,GAEnB,OAAOA,GAGTklB,SAAU,SAAUllB,GAClB,OAAO,IAAIwhD,EAAUxhD,EAAE1L,GAAG0mB,IAAIhb,EAAE7M,GAAG8mB,MAAMja,EAAEpL,IAG7Cm3D,KAAM,SAAU/rD,GACd,OAAO,IAAIwhD,EAAU,IAGvB,iBAAkB,SAAUxhD,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCtEXg6D,GAAgCr6D,GAHhC,UACQ,CAAC,QAAS,YAE0C,YAAwB,IAArBmiC,EAAqB,EAArBA,MAAOtrB,EAAc,EAAdA,QAuCjF,OAAOsrB,EAAM,UAAW,CACtB,GAAI,WACF,OAAOtrB,EAAQyjD,MAGjB52C,OAAQ,SAAU9V,GAChB,OAAO,IAAIiJ,EAAQjJ,EAAG,IAGxB,iBAAkB,SAAUiK,EAAIC,GAC9B,OAAO,IAAIjB,EAAQgB,EAAIC,IAIzB,uBAAwB,SAAUD,EAAIC,GACpC,OAAO,IAAIjB,EAAQgB,EAAGjD,WAAYkD,EAAGlD,aAGvCke,SAAU,SAAUllB,GAClB,OAAO,IAAIiJ,EAAQjJ,EAAEmQ,UAAW,IAGlClH,QAAS,SAAUjJ,GACjB,OAAOA,EAAEukB,SAGXhV,OAAQ,SAAUvP,GAChB,OAAOiJ,EAAQjJ,IAGjB+rD,KAAM,SAAU/rD,GACd,OAAOiJ,EAAQ,IAGjB1V,OAAQ,SAAUyM,GAChB,GAAI,OAAQA,GAAK,OAAQA,EACvB,OAAO,IAAIiJ,EAAQjJ,EAAEiK,GAAIjK,EAAEkK,IAG7B,GAAK,MAAOlK,GAAK,QAASA,GAAO,QAASA,GAAK,QAASA,EACtD,OAAO,IAAIiJ,EAAQjJ,GAGrB,MAAM,IAAIqQ,MAAM,gFAGlB,iBAAkB,SAAUrQ,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCtFXk6D,GAAiCv6D,GAHjC,WACQ,CAAC,QAAS,aAE2C,YAAyB,IAAtBmiC,EAAsB,EAAtBA,MAAOrP,EAAe,EAAfA,SAsClF,OAAOqP,EAAM,WAAY,CACvBze,OAAQ,SAAU9V,GAChB,IAAKoJ,SAASpJ,IAAM2J,MAAM3J,GACxB,MAAM,IAAIqQ,MAAMrQ,EAAI,wCAGtB,OAAO,IAAIklB,EAASllB,IAGtBuP,OAAQ,SAAUvP,GAChB,OAAO,IAAIklB,EAASllB,IAGtB,iBAAkB,SAAU8iB,EAAWlF,GACrC,OAAO,IAAIsH,EAASpC,EAAWlF,IAGjCmuC,KAAM,SAAU/rD,GACd,OAAO,IAAIklB,EAAS,IAGtBs8B,UAAW,SAAUxhD,GACnB,OAAO,IAAIklB,EAASllB,EAAEjL,aAGxBmwB,SAAU,SAAUllB,GAClB,OAAOA,GAGTzM,OAAQ,SAAUyM,GAChB,OAAO,IAAIklB,EAASllB,IAGtB,iBAAkB,SAAUA,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzEXm6D,I,MAA+Bx6D,GAH/B,SACQ,CAAC,QAAS,SAAU,cAAe,iBAEgB,YAAkD,IAA/CmiC,EAA+C,EAA/CA,MAAektB,GAAgC,EAAxC6B,OAAwC,EAAhC7B,aAAaoH,EAAmB,EAAnBA,aAkCrG,OAAOt0B,EArCI,SAqCQ,CACjB,GAAI,WACF,OAAOs4B,EAAQ,KAGjBt9C,OAAQ,SAAU6pC,GAChB,OAAOyT,EAAQ,GAAIzT,IAGrB,iBAAkB,SAAUA,EAAQoK,GAClC,OAAOqJ,EAAQ,GAAIzT,EAAQoK,IAG7B7gD,MAAO,SAAU+oB,GACf,OAAOmhC,EAAQnhC,IAGjB43B,OAAQ,SAAU53B,GAChB,OAAOmhC,EAAQnhC,EAAMA,EAAK63B,YAG5B,yBAA0BsJ,EAE1B,iCAAkCA,IAWpC,SAASA,EAASnhC,EAAM0tB,EAAQoK,GAE9B,GAAe,UAAXpK,GAAiC,YAAXA,QAAmC7iD,IAAX6iD,EAChD,OAAO,IAAIqI,EAAY/1B,EAAM83B,GAG/B,GAAe,WAAXpK,EACF,OAAO,IAAIyP,EAAan9B,EAAM83B,GAGhC,MAAM,IAAIznD,UAAU,uBAAyB+wD,KAAKh9C,UAAUspC,GAAU,UC9E7D2T,GAA2C36D,GAH3C,qBACQ,CAAC,QAAS,SAAU,WAE2C,YAA+B,IAA5BmiC,EAA4B,EAA5BA,MAAOutB,EAAqB,EAArBA,OAAQhoC,EAAa,EAAbA,OA8BpG,OAAOya,EAjCI,qBAiCQ,CACjB,2CAA4C,SAAU4N,EAAM/oC,EAAIggD,EAAQoK,GACtE,OAAOqJ,EAAQ1qB,EAAM/oC,EAAIggD,EAAQoK,IAEnC,mCAAoC,SAAUrhB,EAAM/oC,EAAIggD,GACtD,OAAOyT,EAAQ1qB,EAAM/oC,EAAIggD,IAE3B,mBAAoB,SAAUjX,EAAM/oC,GAClC,OAAOyzD,EAAQ1qB,EAAM/oC,EAAI,UAE3B,kBAAmB,SAAU+oC,EAAM/oC,GACjC,OAAOyzD,EAAQ1qB,EAAM/oC,EAAI,SAASgqD,WAEpC,mCAAoC,SAAUjhB,EAAMiX,EAAQhgD,GAC1D,OAAOyzD,EAAQ1qB,EAAM/oC,EAAIggD,IAE3B,2CAA4C,SAAUjX,EAAMiX,EAAQoK,EAAUpqD,GAC5E,OAAOyzD,EAAQ1qB,EAAM/oC,EAAIggD,EAAQoK,MAIrC,SAASqJ,EAAS1qB,EAAM/oC,EAAIggD,EAAQoK,GAClC,IAAIvwD,EAcJ,OAZEA,OADesD,IAAbitD,EACE1B,EAAO1I,EAAQoK,GAEf1B,EAAO1I,IAGXsD,OAAOva,GACTlvC,EAAEyD,SAAQ,SAAUgzB,EAAGrpB,GACrB,IAAM0pC,EAAM3wC,EAAGiH,GACXyZ,EAAOiwB,IACX92C,EAAEyH,IAAI2F,EAAO0pC,MAGR92C,M,whCCrEX,IAGa+5D,GAAuC56D,GAHvC,iBACQ,CAAC,QAAS,SAAU,UAAW,SAE4B,YAAsC,IAAnCmiC,EAAmC,EAAnCA,MAAOutB,EAA4B,EAA5BA,OAAQ3M,EAAoB,EAApBA,QAAShT,EAAW,EAAXA,KAuBzG,OAAO5N,EA1BI,iBA0BQ,CACjB,WAAY,SAAUrvB,GACpB,OAAO+nD,EAAa/nD,IAEtB,YAAa,SAAUA,GACrB,OAAO48C,EAAOmL,EAAa/nD,EAAInP,KAAI,SAAA9C,GAAC,OAAIA,EAAEmwD,kBAM9C,SAAS6J,EAAc/nD,GACrB,GAAmB,IAAfA,EAAI5O,OAAc,MAAM,IAAIyF,UAAU,qDAC1C,IAF0B,EAEpB6pB,EAAIsnC,EAA+BhoD,EAAI,IAEvCxH,EAAS,GAJW,KAKRwH,GALQ,IAK1B,2BAAuB,KAAZmgD,EAAY,QACf8H,EAAYD,EAA+B7H,GAEjD,GAAI8H,IAAcvnC,EAChB,MAAM,IAAI7pB,UAAU,sCAA4C,EAAJ6pB,GAAS,OAAqB,EAAZunC,IAGhFzvD,EAAOwQ,KAAKinC,EAAQkQ,KAZI,8BAe1B,OAAO3nD,EAGT,SAASwvD,EAAgCE,GACvC,IAAMx4D,EAAIutC,EAAKirB,GAEf,GAAiB,IAAbx4D,EAAE0B,OACJ,OAAO1B,EAAE,GACJ,GAAiB,IAAbA,EAAE0B,OAAc,CACzB,GAAa,IAAT1B,EAAE,GACJ,OAAOA,EAAE,GACJ,GAAa,IAATA,EAAE,GACX,OAAOA,EAAE,GAET,MAAM,IAAImH,UAAU,kDAGtB,MAAM,IAAIA,UAAU,2D,whCCrE1B,IAGasxD,GAA0Cj7D,GAH1C,oBACQ,CAAC,QAAS,SAAU,UAAW,SAE+B,YAAsC,IAAnCmiC,EAAmC,EAAnCA,MAAOutB,EAA4B,EAA5BA,OAAQ3M,EAAoB,EAApBA,QAAShT,EAAW,EAAXA,KAuB5G,OAAO5N,EA1BI,oBA0BQ,CACjB,WAAY,SAAUrvB,GACpB,OAAO+nD,EAAa/nD,IAEtB,YAAa,SAAUA,GACrB,OAAO48C,EAAOmL,EAAa/nD,EAAInP,KAAI,SAAA9C,GAAC,OAAIA,EAAEmwD,kBAM9C,SAAS6J,EAAc/nD,GACrB,GAAmB,IAAfA,EAAI5O,OAAc,MAAM,IAAIyF,UAAU,wDAK1C,IAJA,IAAM6pB,EAAIsnC,EAA+BhoD,EAAI,IAGvCxH,EAAS,GACN7K,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB6K,EAAO7K,GAAK,GAPY,WAWRqS,GAXQ,IAW1B,2BAAuB,KAAZqgD,EAAY,QACf+H,EAAYJ,EAA+B3H,GAEjD,GAAI+H,IAAc1nC,EAChB,MAAM,IAAI7pB,UAAU,sCAA4C,EAAJ6pB,GAAS,OAAqB,EAAZ0nC,IAMhF,IAHA,IAAMr2D,EAAIk+C,EAAQoQ,GAGT1yD,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB6K,EAAO7K,GAAGqb,KAAKjX,EAAEpE,KAtBK,8BA0B1B,OAAO6K,EAGT,SAASwvD,EAAgCE,GACvC,IAAMx4D,EAAIutC,EAAKirB,GAEf,GAAiB,IAAbx4D,EAAE0B,OACJ,OAAO1B,EAAE,GACJ,GAAiB,IAAbA,EAAE0B,OAAc,CACzB,GAAa,IAAT1B,EAAE,GACJ,OAAOA,EAAE,GACJ,GAAa,IAATA,EAAE,GACX,OAAOA,EAAE,GAET,MAAM,IAAImH,UAAU,kDAGtB,MAAM,IAAIA,UAAU,2DC7EbwxD,GAAkCn7D,GAHlC,YACQ,CAAC,UAEqD,YAoBzE,OAAOmiC,EApBiF,EAAZA,OAHjE,YAuBQ,CACjB,cAAe,SAAUy3B,EAAMJ,GAC7B,OAAOI,EAAKwB,UAAU5B,SCxBtB6B,GAAK,iBAEJ,SAASC,GAAWhlD,GACzB,OAAOxT,KAAK2T,IAAIH,GAIX,SAASilD,GAAWjlD,EAAGC,GAC5B,OAAOD,EAAIC,EASN,SAASilD,GAAgBllD,EAAGC,GACjC,OAAOD,EAAIC,EASN,SAASklD,GAAkB7tD,GAChC,OAAQA,EAIH,SAAS8tD,GAAiB9tD,GAC/B,OAAOA,EAIF,SAAS+tD,GAAY/tD,GAC1B,OAAOsa,EAAKta,GAIP,SAASguD,GAAYhuD,GAC1B,OAAO9K,KAAKuW,KAAKzL,GAIZ,SAASiuD,GAAYjuD,GAC1B,OAAOA,EAAIA,EAAIA,EAIV,SAASkuD,GAAWluD,GACzB,OAAO9K,KAAKmT,IAAIrI,GAIX,SAASmuD,GAAanuD,GAC3B,OAAOqK,EAAMrK,GAoBR,SAASouD,GAAW1lD,EAAGC,GAC5B,IAAKsU,EAAUvU,KAAOuU,EAAUtU,GAC9B,MAAM,IAAI0H,MAAM,sDAKlB,IADA,IAAI1c,EACS,IAANgV,GACLhV,EAAI+U,EAAIC,EACRD,EAAIC,EACJA,EAAIhV,EAEN,OAAQ+U,EAAI,GAAMA,EAAIA,EAUjB,SAAS2lD,GAAW3lD,EAAGC,GAC5B,IAAKsU,EAAUvU,KAAOuU,EAAUtU,GAC9B,MAAM,IAAI0H,MAAM,sDAGlB,GAAU,IAAN3H,GAAiB,IAANC,EACb,OAAO,EAOT,IAFA,IAAI5U,EACEqtB,EAAO1Y,EAAIC,EACJ,IAANA,GAELA,EAAID,GADJ3U,EAAI4U,GAEJD,EAAI3U,EAEN,OAAOmB,KAAK2T,IAAIuY,EAAO1Y,GAoBlB,SAAS4lD,GAAatuD,GAC3B,OAAOmkB,EAAMnkB,GASR,SAASuuD,GAAYvuD,GAC1B,OAAOkkB,EAAKlkB,GAqBP,SAASwuD,GAAWxuD,EAAGyK,GAC5B,GAAIA,EAAI,EAIN,OAAOzK,EAAIyK,EAAIvV,KAAKwW,MAAM1L,EAAIyK,GACzB,GAAU,IAANA,EACT,OAAOzK,EAGP,MAAM,IAAIqQ,MAAM,+CAYb,SAASo+C,GAAe/lD,EAAGvW,GAChC,IAAMu8D,EAAMv8D,EAAO,EAKnB,GAJIu8D,IACFv8D,GAAQA,GAGG,IAATA,EACF,MAAM,IAAIke,MAAM,yBAElB,GAAI3H,EAAI,GAAMxT,KAAK2T,IAAI1W,GAAQ,GAAM,EACnC,MAAM,IAAIke,MAAM,wCAIlB,GAAU,IAAN3H,EACF,OAAOgmD,EAAM9jD,IAAW,EAE1B,IAAKxB,SAASV,GACZ,OAAOgmD,EAAM,EAAIhmD,EAGnB,IAAI1I,EAAI9K,KAAK4U,IAAI5U,KAAK2T,IAAIH,GAAI,EAAIvW,GAIlC,OADA6N,EAAI0I,EAAI,GAAK1I,EAAIA,EACV0uD,EAAM,EAAI1uD,EAAIA,EA2BhB,SAAS2uD,GAAY3uD,GAC1B,OAAO+hB,EAAK/hB,GASP,SAAS4uD,GAAc5uD,GAC5B,OAAOA,EAAIA,EAWN,SAAS6uD,GAAYnmD,EAAGC,GAE7B,IAAI5U,EACAkhB,EACAthB,EACAqM,EAAI,EACJ8uD,EAAQ,EACRrkD,EAAI,EACJskD,EAAQ,EAEZ,IAAK9xC,EAAUvU,KAAOuU,EAAUtU,GAC9B,MAAM,IAAI0H,MAAM,uDAGlB,KAAO1H,GAELhV,EAAI+U,GADJuM,EAAI/f,KAAKwW,MAAMhD,EAAIC,IACPA,EAEZ5U,EAAIiM,EACJA,EAAI8uD,EAAQ75C,EAAIjV,EAChB8uD,EAAQ/6D,EAERA,EAAI0W,EACJA,EAAIskD,EAAQ95C,EAAIxK,EAChBskD,EAAQh7D,EAER2U,EAAIC,EACJA,EAAIhV,EASN,OALI+U,EAAI,EACA,EAAEA,GAAIomD,GAAQC,GAEd,CAACrmD,EAAGA,EAAIomD,EAAQ,EAAGC,GAYtB,SAASC,GAAWhvD,EAAGyK,GAG5B,OAAKzK,EAAIA,EAAI,GAAKyK,IAAMG,KACrB5K,EAAIA,EAAI,GAAKyK,KAAOG,IACd,EAGF1V,KAAK4U,IAAI9J,EAAGyK,GAWd,SAASwkD,GAAan7D,GAAqB,IAAdkmD,EAAc,uDAAH,EAC7C,OAAOpwC,WAAW6V,GAAQ3rB,EAAOkmD,IAvUnC0T,GAAU52B,UANC,SAWX62B,GAAU72B,UAAY22B,GAUtBG,GAAe92B,UAAY22B,GAU3BI,GAAiB/2B,UA/BN,SAoCXg3B,GAAgBh3B,UApCL,SAyCXi3B,GAAWj3B,UAzCA,SA8CXk3B,GAAWl3B,UA9CA,SAmDXm3B,GAAWn3B,UAnDA,SAwDXo3B,GAAUp3B,UAxDC,SA6DXq3B,GAAYr3B,UA7DD,SA6FXs3B,GAAUt3B,UAAY22B,GA4BtBY,GAAUv3B,UAAY22B,GAqBtBa,GAAYx3B,UA9ID,SAwJXy3B,GAAWz3B,UAxJA,SAwLX03B,GAAU13B,UAAY22B,GA2DtBgB,GAAc33B,UAAY22B,GAK1BkB,GAAW73B,UAxPA,SAkQX83B,GAAa93B,UAlQF,SAiTX+3B,GAAW/3B,UAAY22B,GAkBvBuB,GAAUl4B,UAAY22B,GAYtBwB,GAAYn4B,UAAY22B,GC7UxB,IAGayB,GAAmC98D,GAHnC,aACQ,CAAC,UAEsD,YAwB1E,OAAOmiC,EAxBkF,EAAZA,OAHlE,aA2BQ,CACjBze,OAAQ+3C,GAER5kD,QAAS,SAAUjJ,GACjB,OAAOA,EAAEoa,OAGXonC,UAAW,SAAUxhD,GACnB,OAAOA,EAAEoa,OAGX8K,SAAU,SAAUllB,GAClB,OAAOA,EAAEoa,OAGX0tC,KAAM,SAAU9nD,GACd,IAAMgL,EAAMhL,EAAEukB,QAEd,OADAvZ,EAAIlX,MAAQrB,KAAKuN,EAAElM,OACZkX,GAGT,iBAAkB,SAAUhL,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SC/CjB08D,GAAkC/8D,GAHlC,YACQ,CAAC,QAAS,SAAU,cAEkC,YAAkC,IAA/BmiC,EAA+B,EAA/BA,MAAO7Q,EAAwB,EAAxBA,OAAQ89B,EAAgB,EAAhBA,UAyB3F,OAAOjtB,EA5BI,YA4BQ,CACjBze,OAAQg4C,GAER7kD,QAAS,SAAUjJ,GACjB,OAAOA,GAGTwhD,UAAW,SAAUxhD,GACnB,OAAOA,GAGTklB,SAAU,SAAUllB,GAClB,OAAOA,GAGT8nD,KAAM,SAAU9nD,GACd,OAAOA,EAAEukB,SAGX,iBAAkB,SAAUvkB,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1B,mBAAoB,SAAUuN,GAE5B,MAA0B,cAAlB0jB,EAAO5N,OAA0B,IAAI0rC,GAAWxhD,IAAMA,QCnDvDovD,GAA4Bh9D,GAH5B,MACQ,CAAC,UAE+C,YAyBnE,OAAOmiC,EAzB2E,EAAZA,OAH3D,MA4BQ,CACjBze,OAAQ43C,GAERzkD,QAAS,SAAUjJ,GACjB,OAAOA,EAAE6I,OAGX24C,UAAW,SAAUxhD,GACnB,OAAOA,EAAE6I,OAGXqc,SAAU,SAAUllB,GAClB,OAAOA,EAAE6I,OAGX,iBAAkB,SAAU7I,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1Bq1D,KAAM,SAAU9nD,GACd,OAAOA,EAAE6I,YC7CFwmD,GAA8Bj9D,GAH9B,QACQ,CAAC,QAAS,cAEwC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOtX,EAAgB,EAAhBA,UAiC/E,OAAOsX,EApCI,QAoCQ,CACjB,+CAAgD,SAAU4xB,EAAK7J,EAAKrf,GAClE,IAAKhgB,EAAUq/B,GACb,MAAM,IAAIvgD,UAAU,yCAGtB,IAAMomC,EAAOx/B,MAAMP,QAAQ+jD,GAAOhK,GAAUgK,GAAOA,EAAIhkB,OACvD,GAAIma,EAAM,GAAMA,GAAOna,EAAK7rC,OAC1B,MAAM,IAAI4lD,GAAWI,EAAKna,EAAK7rC,QAGjC,OAAIygD,EAASoP,GACJA,EAAIhyD,OAAOm7D,GAAOnJ,EAAIh2C,UAAWmsC,EAAKrf,IAEtCqyB,GAAOnJ,EAAK7J,EAAKrf,SAchC,SAASqyB,GAAQnJ,EAAK7J,EAAKrf,GACzB,IAAIpqC,EAAG+Y,EAAK86C,EAEZ,GAAIpK,GAAO,EAAG,CACZ,GAAK35C,MAAMP,QAAQ+jD,EAAI,IAEhB,CAGL,IAFAO,EAsBN,SAAkBP,GAChB,IAEItzD,EAAG+U,EAFDw+C,EAAID,EAAI7vD,OACR+vD,EAAIF,EAAI,GAAG7vD,OAEXsV,EAAM,GACZ,IAAKhE,EAAI,EAAGA,EAAIy+C,EAAGz+C,IAAK,CACtB,IAAMwC,EAAM,GACZ,IAAKvX,EAAI,EAAGA,EAAIuzD,EAAGvzD,IACjBuX,EAAI8D,KAAKi4C,EAAItzD,GAAG+U,IAElBgE,EAAIsC,KAAK9D,GAEX,OAAOwB,EAlCIs6C,CAAQC,GACfv6C,EAAM,GACD/Y,EAAI,EAAGA,EAAI6zD,EAAKpwD,OAAQzD,IAC3B+Y,EAAI/Y,GAAKy8D,GAAO5I,EAAK7zD,GAAIypD,EAAM,EAAGrf,GAEpC,OAAOrxB,EAPP,OAAOqxB,EAASkpB,GAWlB,IADAv6C,EAAM,GACD/Y,EAAI,EAAGA,EAAIszD,EAAI7vD,OAAQzD,IAC1B+Y,EAAI/Y,GAAKy8D,GAAOnJ,EAAItzD,GAAIypD,EAAM,EAAGrf,GAEnC,OAAOrxB,ECrFX,IAGa2jD,GAAkCn9D,GAHlC,YACQ,CAAC,UAEqD,YAazE,OAAOmiC,EAbiF,EAAZA,OAHjE,YAgBQ,CAEjB,iBAAkBo5B,GAElB,mBAAoB,SAAU3tD,EAAGyK,GAC/B,OAAOzK,EAAEN,IAAI+K,IAGf,uBAAwB,SAAUzK,EAAGyK,GACnC,OAAOzK,EAAEyJ,KAAKgB,IAGhB,qBAAsB,SAAUzK,EAAGyK,GACjC,OAAOzK,EAAEN,IAAI+K,IAGf,aAAc,SAAUzK,EAAGyK,GACzB,GAAgB,OAAZzK,EAAElM,YAA8ByC,IAAZyJ,EAAElM,MAAqB,MAAM,IAAIuc,MAAM,oDAC/D,GAAgB,OAAZ5F,EAAE3W,YAA8ByC,IAAZkU,EAAE3W,MAAqB,MAAM,IAAIuc,MAAM,oDAC/D,IAAKrQ,EAAE0oD,UAAUj+C,GAAI,MAAM,IAAI4F,MAAM,sBAErC,IAAMrF,EAAMhL,EAAEukB,QAGd,OAFAvZ,EAAIlX,MAAQrB,KAAKuY,EAAIlX,MAAO2W,EAAE3W,OAC9BkX,EAAIwkD,WAAY,EACTxkD,QC1BAykD,GAA6Br9D,GAZ7B,OACQ,CACnB,SACA,QACA,aACA,aACA,SACA,UACA,YACA,aAGoE,YAAqF,IAAlFsxB,EAAkF,EAAlFA,OAAQ6Q,EAA0E,EAA1EA,MAAOpX,EAAmE,EAAnEA,WAAYuyC,EAAuD,EAAvDA,WAAY5N,EAA2C,EAA3CA,OAAQ74C,EAAmC,EAAnCA,QAASu4C,EAA0B,EAA1BA,UAAWt8B,EAAe,EAAfA,SAwC1I,OAAOqP,EApDI,OAoDQ,CACjBze,OAAQi4C,GAIR9kD,QAAS0mD,EAET,mBAAoBA,EAEpBnO,UAAW,SAAUxhD,GACnB,OAAOA,EAAEsa,QAGXwtC,KA6CF,SAAoB9nD,GAClB,GAAIA,EAAElM,OAAS6iD,EAAU32C,EAAElM,OAAQ,CACjC,IAAI4J,EAASsC,EAAEukB,QAIf,OAHA7mB,EAAO5J,MAAQ,GACf4J,EAASA,EAAOoM,IAAI,EAAM,IACnBhW,MAAQ67D,EAAa3vD,EAAElM,OACvB4J,EAEP,IAMIwJ,EANE2xC,EAAS17B,EAAWnd,EAAElM,OACxB+kD,IACF74C,EAAElM,MAAQ47D,EAAW1vD,EAAElM,QAMvBoT,EADEwvC,EAAY12C,EAAElM,OACR,IAAI0tD,EAAU,GAAGxmC,IAAI,GACpB47B,EAAW52C,EAAElM,OACd,IAAIoxB,EAAS,EAAG,GAEhB,EAAI,EAGd,IAAMxnB,EAASsC,EAAE8J,IAAI5C,GAMrB,OAJI2xC,IACFn7C,EAAO5J,MAAQ47D,EAAWhyD,EAAO5J,QAG5B4J,GAxET,iBAAkB,SAAUsC,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,MAa5B,SAASk9D,EAAc3vD,EAAG4vD,GAGxB,IAAMC,EAAO7vD,EAAE6D,MAAQ,EACjBgF,EAAM7I,EAAE6I,MAGRinD,EAAY,IAAI7mD,EAAQ8kD,GAAWllD,GAAM,GAAGqW,IAAI,IAAIjW,EAAQ,EAAG4mD,GAAMxnD,OAE3E,GAAIunD,EAAU,CACZ,IAAMvyD,EAAM,CACVyyD,EACA,IAAI7mD,EAAQ8kD,GAAWllD,GAAM,GAAGqW,IAAI,IAAIjW,EAAQ,EAAG4mD,EAAiB,EAAV36D,KAAKoV,GAAS,GAAGjC,OAC3E,IAAIY,EAAQ8kD,GAAWllD,GAAM,GAAGqW,IAAI,IAAIjW,EAAQ,EAAG4mD,EAAiB,EAAV36D,KAAKoV,GAAS,GAAGjC,QAG7E,MAA0B,UAAlBqb,EAAOo+B,OAAsBzkD,EAAMykD,EAAOzkD,GAElD,OAAOyyD,M,oBCpGAC,GAAoC39D,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YAoBrF,OAAO,SAAsBh0D,EAAG+T,EAAGs0B,EAAU4pB,GAE3C,IAAMI,EAAUryD,EAAEsyD,QACZC,EAASvyD,EAAEwyD,OACXC,EAAOzyD,EAAE0yD,KACT0I,EAAQp7D,EAAEivD,MACVoM,EAAMr7D,EAAEkvD,UAGd,IAAKmD,EAAW,MAAM,IAAI52C,MAAM,sEAGhC,IAII6/C,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBp1C,EAAKguC,EAELK,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,IAETC,EAAKD,EAELr1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBvnD,EAAI4rB,EAAMsE,QAAQlwB,EAAGunD,GAErBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KASjC,IALA,IAAME,EAAU,GACVxJ,EAAS,GACTyJ,EAAO,GAGJzoD,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhCyoD,EAAKzoD,GAAKg/C,EAAOtwD,OAEjB,IAAK,IAAIywD,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5D,IAAMrQ,EAAIs0D,EAAOjkD,GAEXgO,EAAI21C,EAAUsJ,EAAGxnD,EAAGs+C,EAAQ/jD,IAAMitD,EAAGlJ,EAAQ/jD,GAAIyF,GAElDiS,EAAG1J,EAAG+3C,KAETrC,EAAO14C,KAAKrb,GACZu9D,EAAQliD,KAAKgD,KAQnB,OAHAm/C,EAAK/K,GAAWsB,EAAOtwD,OAGhB1B,EAAE01D,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QCzFHI,GAAoCl+D,GAHpC,cACQ,CAAC,UAEuD,YAAe,IAAZmiC,EAAY,EAAZA,MAgB9E,OAAO,SAAsB7rB,EAAGC,EAAGs0B,EAAU4pB,GAE3C,IAKIqJ,EALEK,EAAQ7nD,EAAEk7C,MACVoM,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAKVqM,EAAKlzB,EAGU,iBAARgzB,IAETC,EAAKD,EAELtnD,EAAI4rB,EAAMsE,QAAQlwB,EAAGunD,GAErBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAIjC,IAAMM,EAAQR,EAAM15D,OAAS,EAW/B,SAASm6D,EAAUx5D,EAAGy5D,EAAO97D,EAAGN,EAAGq8D,EAAIC,EAAI/J,GAEzC,IAAMgK,EAAK,GAEX,GAAIH,IAAU97D,EAAE0B,OAAS,EAEvB,IAAK,IAAIzD,EAAI,EAAGA,EAAIyB,EAAGzB,IAErBg+D,EAAGh+D,GAAKg0D,EAAU5vD,EAAE25D,EAAID,EAAG99D,IAAMoE,EAAE05D,EAAG99D,GAAI+9D,QAI5C,IAAK,IAAIhpD,EAAI,EAAGA,EAAItT,EAAGsT,IAErBipD,EAAGjpD,GAAK6oD,EAASx5D,EAAGy5D,EAAQ,EAAG97D,EAAGA,EAAE87D,EAAQ,GAAIC,EAAG/oD,GAAIgpD,EAAI/J,GAG/D,OAAOgK,EA5B0BJ,CAASN,EAAI,EAAGH,EAAOA,EAAM,GAAIO,EAAO5nD,EAAGk+C,GAAW,GAGvF,OAAOn+C,EAAEq8C,kBAAkB,CACzBr5B,KAAM8kC,EACNruB,KAAM5d,GAAMyrC,GACZxM,SAAU0M,QCtCHY,GAA6B1+D,GAH7B,OACQ,CAAC,QAAS,SAAU,QAAS,SAAU,gBAEU,YAAmD,IAAhDmiC,EAAgD,EAAhDA,MAAO7Q,EAAyC,EAAzCA,OAAQ/X,EAAiC,EAAjCA,MAAOm2C,EAA0B,EAA1BA,OAAQ8G,EAAkB,EAAlBA,YAC/FmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCoI,EAAcV,GAAkB,CAAE/7B,UAuCxC,OAAOA,EAAM,OAAQ,CACnBze,OAAQ,SAAU9V,GAChB,OAAI06C,GAAY16C,EAAG2L,EAAM3L,GAAI0jB,EAAOi3B,SAC3BhvC,EAAM3L,GAENguD,GAAWhuD,IAItB,iBAAkB,SAAUA,EAAG1L,GAC7B,GAAIomD,GAAY16C,EAAG2L,EAAM3L,EAAG1L,GAAIovB,EAAOi3B,SACrC,OAAOhvC,EAAM3L,EAAG1L,GAEhB,MAAyB,UAAG0L,EAAH,KAAQ2H,MAAM,KAAvC,YAAKmO,EAAL,KAAa4jC,EAAb,KACMh8C,EAASxI,KAAKuW,KAAKtC,OAAO,GAAD,OAAI2M,EAAJ,YAAc3M,OAAOuwC,GAAYplD,KAF3D,EAGgB,UAAGoJ,EAAH,KAAaiK,MAAM,KAHnC,YAIL,OADCmO,EAHI,KAGI4jC,EAHJ,KAIEvwC,OAAO,GAAD,OAAI2M,EAAJ,YAAc3M,OAAOuwC,GAAYplD,KAIlD2U,QAAS,SAAUjJ,GACjB,OAAOA,EAAEyL,QAGX,kBAAmB,SAAUzL,EAAG1L,GAC9B,OAAO0L,EAAEyL,KAAKnX,IAGhBktD,UAAW,SAAUxhD,GACnB,OAAIwoD,GAAexoD,EAAG2L,EAAM3L,GAAI0jB,EAAOi3B,SAC9BhvC,EAAM3L,GAENA,EAAEyL,QAIb,uBAAwB,SAAUzL,EAAG1L,GACnC,OAAIk0D,GAAexoD,EAAG2L,EAAM3L,EAAG1L,GAAIovB,EAAOi3B,SACjChvC,EAAM3L,EAAG1L,GAET0L,EAAEsf,gBAAgBhrB,EAAE0S,WAAYgP,KAAQ0O,aAInDQ,SAAU,SAAUllB,GAClB,OAAOA,EAAEyL,QAGX,mBAAoB,SAAUzL,EAAG1L,GAC/B,OAAO0L,EAAEyL,KAAKnX,IAGhB,iBAAkB,SAAU0L,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1B,yBAA0B,SAAUuN,EAAG1L,GAAG,WAExC,OAAOkyD,GAAQxmD,GAAG,SAAAnN,GAAC,OAAI,EAAKA,EAAGyB,MAAI,IAGrC,mCAAoC,SAAU0L,EAAGyK,GAC/C,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,sCAAuC,SAAUuN,EAAGyK,GAElD,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCtHtC8gD,GAA6B7+D,GAH7B,OACQ,CAAC,UAEgD,YAyBpE,OAAOmiC,EAzB4E,EAAZA,OAH5D,OA4BQ,CACjBze,OAAQm4C,GAERhlD,QAAS,SAAUjJ,GACjB,OAAOA,EAAEkf,IAAIlf,GAAGkf,IAAIlf,IAGtBwhD,UAAW,SAAUxhD,GACnB,OAAOA,EAAEia,MAAMja,GAAGia,MAAMja,IAG1BklB,SAAU,SAAUllB,GAClB,OAAOA,EAAE8J,IAAI,IAGf,iBAAkB,SAAU9J,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1Bq1D,KAAM,SAAU9nD,GACd,OAAOA,EAAE8J,IAAI,SC9CNonD,GAA4B9+D,GAH5B,MACQ,CAAC,UAE+C,YA6BnE,OAAOmiC,EA7B2E,EAAZA,OAH3D,MAgCQ,CACjBze,OAAQo4C,GAERjlD,QAAS,SAAUjJ,GACjB,OAAOA,EAAEqI,OAGXm5C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEqI,OAGX,iBAAkB,SAAUrI,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,YC1CX0+D,GAA8B/+D,GAH9B,QACQ,CAAC,QAAS,YAEwC,YAAwB,IAArBmiC,EAAqB,EAArBA,MAAOtrB,EAAc,EAAdA,QA6B/E,OAAOsrB,EAhCI,QAgCQ,CACjBze,OAAQq4C,GAERllD,QAAS,SAAUjJ,GACjB,IAAMrM,EAAIuB,KAAKmT,IAAIrI,EAAEiK,IACrB,OAAO,IAAIhB,EACTtV,EAAIuB,KAAKmU,IAAIrJ,EAAEkK,IAAM,EACrBvW,EAAIuB,KAAKoU,IAAItJ,EAAEkK,MAInBs3C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEqI,MAAMqB,MAAM,IAGvB,iBAAkB,SAAU1J,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC7CX2+D,GAA4Bh/D,GAH5B,MACQ,CAAC,QAAS,UAAW,SAAU,OAAQ,UAES,YAA6C,IAA1CmiC,EAA0C,EAA1CA,MAAOtrB,EAAmC,EAAnCA,QAAS64C,EAA0B,EAA1BA,OAAQr2C,EAAkB,EAAlBA,KAAMC,EAAY,EAAZA,MAC9FslD,EAAcV,GAAkB,CAAE/7B,UAoCxC,OAAOA,EAAM,MAAO,CAClBze,OAAQ,SAAU9V,GAChB,OAAQA,EAAI,EAAK0L,EAAM1L,GAAKyL,EAAKzL,IAGnC,6BAA8B,SAAUA,EAAG1L,GACzC,OAAQ0L,EAAI,EAAK0L,EAAM1L,EAAG1L,GAAKmX,EAAKzL,EAAG1L,IAGzC2U,QAAS,SAAUjJ,GACjB,OAAO,IAAIiJ,EACRjJ,EAAEiK,GAAK,EAAK/U,KAAKwW,MAAM1L,EAAEiK,IAAM/U,KAAKuW,KAAKzL,EAAEiK,IAC3CjK,EAAEkK,GAAK,EAAKhV,KAAKwW,MAAM1L,EAAEkK,IAAMhV,KAAKuW,KAAKzL,EAAEkK,MAIhD,8BAA+B,SAAUlK,EAAG1L,GAC1C,OAAO,IAAI2U,EACRjJ,EAAEiK,GAAK,EAAKyB,EAAM1L,EAAEiK,GAAI3V,GAAKmX,EAAKzL,EAAEiK,GAAI3V,GACxC0L,EAAEkK,GAAK,EAAKwB,EAAM1L,EAAEkK,GAAI5V,GAAKmX,EAAKzL,EAAEkK,GAAI5V,KAI7CktD,UAAW,SAAUxhD,GACnB,OAAOA,EAAEmd,aAAe1R,EAAKzL,GAAK0L,EAAM1L,IAG1C,gCAAiC,SAAUA,EAAG1L,GAC5C,OAAO0L,EAAEmd,aAAe1R,EAAKzL,EAAG1L,GAAKoX,EAAM1L,EAAG1L,IAGhD4wB,SAAU,SAAUllB,GAClB,OAAOA,EAAEpL,EAAI,EAAIoL,EAAEyL,OAASzL,EAAE0L,SAGhC,+BAAgC,SAAU1L,EAAG1L,GAC3C,OAAO0L,EAAEpL,EAAI,EAAIoL,EAAEyL,KAAKnX,GAAK0L,EAAE0L,MAAMpX,IAGvC,iBAAkB,SAAU0L,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1B,qCAAsC,SAAUuN,EAAG1L,GAAG,WAEpD,OAAOkyD,GAAQxmD,GAAG,SAAAnN,GAAC,OAAI,EAAKA,EAAGyB,MAAI,IAGrC,sCAAuC,SAAU0L,EAAGyK,GAElD,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCpFtCkhD,GAA8Bj/D,GAH9B,QACQ,CAAC,QAAS,SAAU,QAAS,SAAU,gBAEW,YAAmD,IAAhDmiC,EAAgD,EAAhDA,MAAO7Q,EAAyC,EAAzCA,OAAQ/X,EAAiC,EAAjCA,MAAOm2C,EAA0B,EAA1BA,OAAQ8G,EAAkB,EAAlBA,YAChGmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCoI,EAAcV,GAAkB,CAAE/7B,UAsCxC,OAAOA,EAAM,QAAS,CACpBze,OAAQ,SAAU9V,GAChB,OAAI06C,GAAY16C,EAAG2L,EAAM3L,GAAI0jB,EAAOi3B,SAC3BhvC,EAAM3L,GAEN9K,KAAKwW,MAAM1L,IAItB,iBAAkB,SAAUA,EAAG1L,GAC7B,GAAIomD,GAAY16C,EAAG2L,EAAM3L,EAAG1L,GAAIovB,EAAOi3B,SACrC,OAAOhvC,EAAM3L,EAAG1L,GAEhB,MAAyB,UAAG0L,EAAH,KAAQ2H,MAAM,KAAvC,YAAKmO,EAAL,KAAa4jC,EAAb,KACMh8C,EAASxI,KAAKwW,MAAMvC,OAAO,GAAD,OAAI2M,EAAJ,YAAc3M,OAAOuwC,GAAYplD,KAF5D,EAGgB,UAAGoJ,EAAH,KAAaiK,MAAM,KAHnC,YAIL,OADCmO,EAHI,KAGI4jC,EAHJ,KAIEvwC,OAAO,GAAD,OAAI2M,EAAJ,YAAc3M,OAAOuwC,GAAYplD,KAIlD2U,QAAS,SAAUjJ,GACjB,OAAOA,EAAE0L,SAGX,kBAAmB,SAAU1L,EAAG1L,GAC9B,OAAO0L,EAAE0L,MAAMpX,IAGjBktD,UAAW,SAAUxhD,GACnB,OAAIwoD,GAAexoD,EAAG2L,EAAM3L,GAAI0jB,EAAOi3B,SAC9BhvC,EAAM3L,GAENA,EAAE0L,SAIb,uBAAwB,SAAU1L,EAAG1L,GACnC,OAAIk0D,GAAexoD,EAAG2L,EAAM3L,EAAG1L,GAAIovB,EAAOi3B,SACjChvC,EAAM3L,EAAG1L,GAET0L,EAAEsf,gBAAgBhrB,EAAE0S,WAAYgP,KAAQ2O,cAInDO,SAAU,SAAUllB,GAClB,OAAOA,EAAE0L,SAGX,mBAAoB,SAAU1L,EAAG1L,GAC/B,OAAO0L,EAAE0L,MAAMpX,IAGjB,iBAAkB,SAAU0L,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1B,yBAA0B,SAAUuN,EAAG1L,GAAG,WAExC,OAAOkyD,GAAQxmD,GAAG,SAAAnN,GAAC,OAAI,EAAKA,EAAGyB,MAAI,IAGrC,mCAAoC,SAAU0L,EAAGyK,GAC/C,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,sCAAuC,SAAUuN,EAAGyK,GAElD,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCrHtCmhD,GAAoCl/D,GAHpC,cACQ,CAAC,UAEuD,YAAe,IAAZmiC,EAAY,EAAZA,MAoB9E,OAAO,SAAqBg9B,EAAaC,EAAcv0B,EAAU4pB,GAE/D,IAAM0J,EAAQgB,EAAY3N,MACpBoM,EAAQuB,EAAY1N,MACpBoM,EAAMsB,EAAYzN,UAElB2N,EAAUD,EAAatK,QACvBwK,EAASF,EAAapK,OACtBuK,EAAOH,EAAalK,KACpBsK,EAAQJ,EAAa3N,MACrBgO,EAAML,EAAa1N,UAGzB,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAAKH,EAAW,MAAM,IAAIphD,MAAM,sEAGhC,IASIxd,EAAG+U,EATDw9C,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAGhBE,EAAoB,iBAARD,GAAoBA,IAAQ4B,EAAM5B,OAAM15D,EAEpD45D,EAAKD,EAAK37B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,IAAOjzB,EAM3CuzB,EAAQ,GAEd,IAAK39D,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAO29D,EAAM39D,GAAK,GAGxC,IAAMmN,EAAI,GAEJ8X,EAAI,GAGV,IAAKlQ,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAI5B,IAFA,IAAM8pC,EAAO9pC,EAAI,EAERm/C,EAAK4K,EAAK/pD,GAAIo/C,EAAK2K,EAAK/pD,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAIvDlD,EAFAnN,EAAI6+D,EAAOxuD,IAEJ2jD,EAAUsJ,EAAGsB,EAAQvuD,GAAIqtD,EAAM19D,GAAG+U,IAAMuoD,EAAGI,EAAM19D,GAAG+U,GAAI6pD,EAAQvuD,IAEvE4U,EAAEjlB,GAAK6+C,EAGT,IAAK7+C,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAEhBilB,EAAEjlB,KAAO6+C,EAEX8e,EAAM39D,GAAG+U,GAAK5H,EAAEnN,GAGhB29D,EAAM39D,GAAG+U,GAAK2oD,EAAM19D,GAAG+U,GAM7B,OAAO2pD,EAAYxM,kBAAkB,CACnCr5B,KAAM8kC,EACNruB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QC7FH4B,GAAoC1/D,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YAmBrF,OAAO,SAAsBlgD,EAAGC,EAAGs0B,GAEjC,IAAMgqB,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT0I,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER2N,EAAU9oD,EAAEu+C,QACZwK,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KACTsK,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAGd,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAII1B,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBp1C,EAAKguC,EAELK,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELr1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAIjC,IAYIr9D,EAAG+U,EAAG1E,EAAG6jD,EAAIC,EAZXoJ,EAAUnJ,GAAWwK,EAAU,QAAKl7D,EACpCqwD,EAAS,GACTyJ,EAAO,GAGP0B,EAAK9K,GAAWwK,EAAU,QAAKl7D,EAC/By7D,EAAK/K,GAAWwK,EAAU,QAAKl7D,EAE/B07D,EAAK,GACLC,EAAK,GAMX,IAAKtqD,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAE5ByoD,EAAKzoD,GAAKg/C,EAAOtwD,OAEjB,IAAMo7C,EAAO9pC,EAAI,EAEjB,IAAKm/C,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAEnDrQ,EAAIs0D,EAAOjkD,GAEX0jD,EAAO14C,KAAKrb,GAEZo/D,EAAGp/D,GAAK6+C,EAEJqgB,IAAMA,EAAGl/D,GAAKo0D,EAAQ/jD,IAG5B,IAAK6jD,EAAK4K,EAAK/pD,GAAIo/C,EAAK2K,EAAK/pD,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAInD,GAAI+uD,EAFJp/D,EAAI6+D,EAAOxuD,MAEGwuC,GAEZ,GAAIqgB,EAAI,CAEN,IAAM7gD,EAAIi/C,EAAG4B,EAAGl/D,GAAI4+D,EAAQvuD,IAEvB0X,EAAG1J,EAAG+3C,GAKTgJ,EAAGp/D,GAAK,KAHRk/D,EAAGl/D,GAAKqe,QAQZ01C,EAAO14C,KAAKrb,GAEZq/D,EAAGr/D,GAAK6+C,EAEJsgB,IAAMA,EAAGn/D,GAAK4+D,EAAQvuD,IAI9B,GAAI6uD,GAAMC,EAIR,IAFA9uD,EAAImtD,EAAKzoD,GAEF1E,EAAI0jD,EAAOtwD,QAIZ27D,EAFJp/D,EAAI+zD,EAAO1jD,MAEGwuC,GAEZ0e,EAAQltD,GAAK6uD,EAAGl/D,GAEhBqQ,KACSgvD,EAAGr/D,KAAO6+C,GAEnB0e,EAAQltD,GAAK8uD,EAAGn/D,GAEhBqQ,KAGA0jD,EAAOhhD,OAAO1C,EAAG,GASzB,OAHAmtD,EAAK/K,GAAWsB,EAAOtwD,OAGhBoS,EAAE4hD,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QChKHiC,GAAoC//D,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOktB,EAAkB,EAAlBA,YAoBrF,OAAO,SAAsB7sD,EAAG+T,EAAGs0B,EAAU4pB,GAE3C,IAAMI,EAAUryD,EAAEsyD,QACZC,EAASvyD,EAAEwyD,OACXC,EAAOzyD,EAAE0yD,KACT0I,EAAQp7D,EAAEivD,MACVoM,EAAMr7D,EAAEkvD,UAGd,IAAKmD,EAAW,MAAM,IAAI52C,MAAM,sEAGhC,IAII6/C,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBG,EAAKlzB,EAGU,iBAARgzB,IAETC,EAAKD,EAELtnD,EAAI4rB,EAAMsE,QAAQlwB,EAAGunD,GAErBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAYjC,IARA,IAAMM,EAAQ,GAGRxwD,EAAI,GAEJ8X,EAAI,GAGDlQ,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAIhC,IAFA,IAAM8pC,EAAO9pC,EAAI,EAERm/C,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5D,IAAMvP,EAAIwzD,EAAOjkD,GAEjBlD,EAAErM,GAAKszD,EAAQ/jD,GACf4U,EAAEnkB,GAAK+9C,EAGT,IAAK,IAAI7+C,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAEd,IAAN+U,IAEF4oD,EAAM39D,GAAK,IAGTilB,EAAEjlB,KAAO6+C,EAEX8e,EAAM39D,GAAG+U,GAAKi/C,EAAUsJ,EAAGxnD,EAAG3I,EAAEnN,IAAMs9D,EAAGnwD,EAAEnN,GAAI8V,GAG/C6nD,EAAM39D,GAAG+U,GAAKe,EAMpB,OAAO,IAAI84C,EAAY,CACrB/1B,KAAM8kC,EACNruB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QC3FHkC,GAAoChgE,GAHpC,cACQ,CAAC,UAEuD,YAAe,IAAZmiC,EAAY,EAAZA,MAe9E,OAAO,SAAsB7rB,EAAGC,EAAGs0B,GAEjC,IAsBIizB,EAtBEK,EAAQ7nD,EAAEk7C,MACVoM,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAERuO,EAAQ1pD,EAAEi7C,MACVgO,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAERwO,EAAQ,GAGd,GAAItC,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,IAAK,IAAI1B,EAAI,EAAGA,EAAIo7D,EAAM15D,OAAQ1B,IAAK,CAErC,GAAIo7D,EAAMp7D,KAAOg9D,EAAMh9D,GAAM,MAAM,IAAI+tC,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAEjIU,EAAM19D,GAAKo7D,EAAMp7D,GAMnB,IAAIu7D,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELE,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAIjC,IAAMM,EAAQ8B,EAAMh8D,OAAS,EAW/B,SAASm6D,EAAUx5D,EAAGy5D,EAAO97D,EAAGN,EAAGq8D,EAAIC,GAErC,IAAMC,EAAK,GAEX,GAAIH,IAAU97D,EAAE0B,OAAS,EAEvB,IAAK,IAAIzD,EAAI,EAAGA,EAAIyB,EAAGzB,IAErBg+D,EAAGh+D,GAAKoE,EAAE05D,EAAG99D,GAAI+9D,EAAG/9D,SAItB,IAAK,IAAI+U,EAAI,EAAGA,EAAItT,EAAGsT,IAErBipD,EAAGjpD,GAAK6oD,EAASx5D,EAAGy5D,EAAQ,EAAG97D,EAAGA,EAAE87D,EAAQ,GAAIC,EAAG/oD,GAAIgpD,EAAGhpD,IAG9D,OAAOipD,EA5B0BJ,CAASN,EAAI,EAAGmC,EAAOA,EAAM,GAAI/B,EAAO8B,GAAS,GAGlF,OAAO3pD,EAAEq8C,kBAAkB,CACzBr5B,KAAM8kC,EACNruB,KAAMmwB,EACN9O,SAAU0M,QC/CHqC,GAA4BngE,GAT5B,MACQ,CACnB,QACA,SACA,cACA,YACA,gBAGmE,YAA4D,IAAzDmiC,EAAyD,EAAzDA,MAAOutB,EAAkD,EAAlDA,OAAQ8G,EAA0C,EAA1CA,YAAapH,EAA6B,EAA7BA,UAAWC,EAAkB,EAAlBA,YACvG+Q,EAAclB,GAAkB,CAAE/8B,UAClCk+B,EAAcX,GAAkB,CAAEv9B,QAAOq0B,gBACzC8J,EAAcP,GAAkB,CAAE59B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA2BxC,OAAOA,EAzCI,MAyCQ,CAEjB,iBAAkB65B,GAElB,uBAgFF,SAAwB1lD,EAAGC,GACzB,IAAKD,EAAEwU,UAAYvU,EAAEuU,QACnB,MAAM,IAAI7M,MAAM,sDAIlB,IAAM44C,EAAO,IAAIzH,EAAU,GAC3B,MAAQ74C,EAAEmR,UAAU,CAClB,IAAMnmB,EAAI+U,EAAE6V,IAAI5V,GAChBD,EAAIC,EACJA,EAAIhV,EAEN,OAAO+U,EAAE6U,GAAG0rC,GAAQvgD,EAAE0R,MAAQ1R,GA1F9B,qBAAsB,SAAU1I,EAAGyK,GACjC,OAAOzK,EAAEolB,IAAI3a,IAGf,6BAA8B,SAAUzK,EAAGyK,GACzC,OAAOgoD,EAAYzyD,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAO+nD,EAAY/nD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAO+nD,EAAYxyD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mCAAoC,SAAUzK,EAAGyK,GAC/C,OAAOioD,EAAY1yD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,mCAAoC,SAAUuN,EAAGyK,GAC/C,OAAOioD,EAAYjoD,EAAGzK,EAAGvN,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,4BAA6B,SAAUnQ,EAAGyK,GAExC,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,WAI/C,mHAAoH,SAAUzH,EAAGC,EAAGsH,GAElI,IADA,IAAIjF,EAAMvY,KAAKiW,EAAGC,GACT9V,EAAI,EAAGA,EAAIod,EAAK3Z,OAAQzD,IAC/BmY,EAAMvY,KAAKuY,EAAKiF,EAAKpd,IAEvB,OAAOmY,QCpHA4nD,GAAoCxgE,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YAoBrF,OAAO,SAAsB2I,EAAaC,EAAcv0B,EAAU4pB,GAEhE,IAAM0J,EAAQgB,EAAY3N,MACpBoM,EAAQuB,EAAY1N,MACpBoM,EAAMsB,EAAYzN,UAElB2N,EAAUD,EAAatK,QACvBwK,EAASF,EAAapK,OACtBuK,EAAOH,EAAalK,KACpBsK,EAAQJ,EAAa3N,MACrBgO,EAAML,EAAa1N,UAGzB,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAAKH,EAAW,MAAM,IAAIphD,MAAM,sEAGhC,IAII6/C,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBp1C,EAAKguC,EAELK,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELr1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KASjC,IALA,IAAME,EAAU,GACVxJ,EAAS,GACTyJ,EAAO,GAGJzoD,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhCyoD,EAAKzoD,GAAKg/C,EAAOtwD,OAEjB,IAAK,IAAIywD,EAAK4K,EAAK/pD,GAAIo/C,EAAK2K,EAAK/pD,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5D,IAAMrQ,EAAI6+D,EAAOxuD,GAEX2vD,EAAMhM,EAAUsJ,EAAGsB,EAAQvuD,GAAIqtD,EAAM19D,GAAG+U,IAAMuoD,EAAGI,EAAM19D,GAAG+U,GAAI6pD,EAAQvuD,IAEvE0X,EAAGi4C,EAAK5J,KAEXrC,EAAO14C,KAAKrb,GACZu9D,EAAQliD,KAAK2kD,KAQnB,OAHAxC,EAAK/K,GAAWsB,EAAOtwD,OAGhBk7D,EAAalH,mBAAmB,CACrCpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QCjGH4C,GAAoC1gE,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YAmBrF,OAAO,SAAsBlgD,EAAGC,EAAGs0B,GAEjC,IAAMgqB,EAAUv+C,EAAEw+C,QACZ8I,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER2N,EAAU9oD,EAAEu+C,QACZ0K,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAGd,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAII1B,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBp1C,EAAKguC,EAELK,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELr1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAgBjC,IAZA,IAAME,EAAUnJ,GAAWwK,EAAU,QAAKl7D,EACpCqwD,EAAS,GACTyJ,EAAO,GAGPrwD,EAAIowD,EAAU,QAAK75D,EAEnBuhB,EAAI,GAEJ0L,EAAI,GAGD5b,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhCyoD,EAAKzoD,GAAKg/C,EAAOtwD,OAEjB,IAAMo7C,EAAO9pC,EAAI,EAMjB,GAJA++C,GAAQj+C,EAAGd,EAAGkQ,EAAG9X,EAAGwjB,EAAGkuB,EAAMkV,EAAQuJ,GAErCxJ,GAAQh+C,EAAGf,EAAGkQ,EAAG9X,EAAGwjB,EAAGkuB,EAAMkV,EAAQuJ,GAEjCnwD,EAIF,IAFA,IAAIkD,EAAImtD,EAAKzoD,GAEN1E,EAAI0jD,EAAOtwD,QAAQ,CAExB,IAAMzD,EAAI+zD,EAAO1jD,GAEjB,GAAIsgB,EAAE3wB,KAAO6+C,EAAM,CAEjB,IAAMxgC,EAAIlR,EAAEnN,GAEP+nB,EAAG1J,EAAG+3C,GAOTrC,EAAOhhD,OAAO1C,EAAG,IALjBktD,EAAQliD,KAAKgD,GAEbhO,UAOF0jD,EAAOhhD,OAAO1C,EAAG,QAOrB,IAFA,IAAIvO,EAAI07D,EAAKzoD,GAENjT,EAAIiyD,EAAOtwD,QAAQ,CAIpBktB,EAFMojC,EAAOjyD,MAEJ+8C,EAEXkV,EAAOhhD,OAAOjR,EAAG,GAGjBA,KASR,OAHA07D,EAAK/K,GAAWsB,EAAOtwD,OAGhBoS,EAAE4hD,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QChIH6C,GAA4B3gE,GAP5B,MACQ,CACnB,QACA,SACA,gBAGmE,YAAoC,IAAjCmiC,EAAiC,EAAjCA,MAAOutB,EAA0B,EAA1BA,OAAQ8G,EAAkB,EAAlBA,YAC/EoK,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCqK,EAAcH,GAAkB,CAAEv+B,QAAOq0B,gBACzCmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA+BxC,OAAOA,EA3CI,MA2CQ,CACjB,iBAAkB85B,GAElB,uBAgFF,SAAwB3lD,EAAGC,GACzB,IAAKD,EAAEwU,UAAYvU,EAAEuU,QACnB,MAAM,IAAI7M,MAAM,sDAGlB,GAAI3H,EAAEoR,SACJ,OAAOpR,EAET,GAAIC,EAAEmR,SACJ,OAAOnR,EAKT,IAAMyY,EAAO1Y,EAAEuR,MAAMtR,GACrB,MAAQA,EAAEmR,UAAU,CAClB,IAAM/lB,EAAI4U,EACVA,EAAID,EAAE6V,IAAIxqB,GACV2U,EAAI3U,EAEN,OAAOqtB,EAAKpG,IAAItS,GAAGG,OAlGnB,qBAAsB,SAAU7I,EAAGyK,GACjC,OAAOzK,EAAEkzD,IAAIzoD,IAGf,6BAA8B,SAAUzK,EAAGyK,GACzC,OAAOwoD,EAAYjzD,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYhzD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mCAAoC,SAAUzK,EAAGyK,GAC/C,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,mCAAoC,SAAUuN,EAAGyK,GAC/C,OAAOsmD,EAAYtmD,EAAGzK,EAAGvN,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,4BAA6B,SAAUnQ,EAAGyK,GAExC,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,WAI/C,mHAAoH,SAAUzH,EAAGC,EAAGsH,GAElI,IADA,IAAIjF,EAAMvY,KAAKiW,EAAGC,GACT9V,EAAI,EAAGA,EAAIod,EAAK3Z,OAAQzD,IAC/BmY,EAAMvY,KAAKuY,EAAKiF,EAAKpd,IAEvB,OAAOmY,QCpHAmoD,GAA8B/gE,GAH9B,QACQ,CAAC,QAAS,SAAU,YAE8B,YAAgC,IAA7BmiC,EAA6B,EAA7BA,MAAO7Q,EAAsB,EAAtBA,OAAQza,EAAc,EAAdA,QA0BvF,OAAOsrB,EA7BI,QA6BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,GAAK,GAAK0jB,EAAO0vC,YACZ9E,GAAYtuD,GAGZ,IAAIiJ,EAAQjJ,EAAG,GAAG+I,MAAMiS,IAAI9lB,KAAKmhB,OAI5CpN,QAAS,SAAUjJ,GACjB,OAAO,IAAIiJ,EAAQjJ,GAAG+I,MAAMiS,IAAI9lB,KAAKmhB,OAGvCmrC,UAAW,SAAUxhD,GACnB,OAAKA,EAAEmd,cAAgBuG,EAAO0vC,YACrBpzD,EAAE+I,MAGF,IAAIE,EAAQjJ,EAAEgH,WAAY,GAAG+B,MAAMiS,IAAI9lB,KAAKmhB,OAIvD,iBAAkB,SAAUrW,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YClDX4gE,GAA6BjhE,GAH7B,OACQ,CAAC,QAAS,SAAU,YAE6B,YAAgC,IAA7BmiC,EAA6B,EAA7BA,MAAO7Q,EAAsB,EAAtBA,OAAQza,EAAc,EAAdA,QA0BtF,OAAOsrB,EA7BI,OA6BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,GAAK,GAAK0jB,EAAO0vC,YACZ7E,GAAWvuD,GAGXszD,EAAa,IAAIrqD,EAAQjJ,EAAG,KAIvCiJ,QAASqqD,EAET9R,UAAW,SAAUxhD,GACnB,OAAKA,EAAEmd,cAAgBuG,EAAO0vC,YACrBpzD,EAAE+I,IAAI,GAGNuqD,EAAa,IAAIrqD,EAAQjJ,EAAEgH,WAAY,KAIlD,iBAAkB,SAAUhH,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,SAUtB,SAAS6gE,EAActzD,GACrB,IAAMuzD,EAAOr+D,KAAKiV,KAAKnK,EAAEiK,GAAKjK,EAAEiK,GAAKjK,EAAEkK,GAAKlK,EAAEkK,IAC9C,OAAO,IAAIjB,EACR/T,KAAKgvB,KAAQhvB,KAAKgvB,KAAKqvC,GAAQr+D,KAAK6T,IAAIwqD,GAAQr+D,KAAK8T,IACtD9T,KAAK6U,MAAM/J,EAAEkK,GAAIlK,EAAEiK,IAAM/U,KAAK8T,SC/DvBwqD,GAAoCphE,GAHpC,cACQ,CAAC,UAEuD,YAAe,IAAZmiC,EAAY,EAAZA,MAoB9E,OAAO,SAAsBg9B,EAAaC,EAAcv0B,EAAU4pB,GAEhE,IAAM0J,EAAQgB,EAAY3N,MACpBoM,EAAQuB,EAAY1N,MACpBoM,EAAMsB,EAAYzN,UAElB2N,EAAUD,EAAatK,QACvBwK,EAASF,EAAapK,OACtBuK,EAAOH,EAAalK,KACpBsK,EAAQJ,EAAa3N,MACrBgO,EAAML,EAAa1N,UAGzB,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAAKH,EAAW,MAAM,IAAIphD,MAAM,sEAGhC,IAII6/C,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlB/G,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELhH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAOjC,IAHA,IAAMM,EAAQ,GAGLtnD,EAAI,EAAGA,EAAIk8C,EAAMl8C,IAExBsnD,EAAMtnD,GAAK,GASb,IALA,IAAMlJ,EAAI,GAEJ8X,EAAI,GAGDlQ,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAIhC,IAFA,IAAM8pC,EAAO9pC,EAAI,EAERm/C,EAAK4K,EAAK/pD,GAAIo/C,EAAK2K,EAAK/pD,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5D,IAAMrQ,EAAI6+D,EAAOxuD,GAEjBlD,EAAEnN,GAAKg0D,EAAUsJ,EAAGsB,EAAQvuD,GAAIqtD,EAAM19D,GAAG+U,IAAMuoD,EAAGI,EAAM19D,GAAG+U,GAAI6pD,EAAQvuD,IACvE4U,EAAEjlB,GAAK6+C,EAGT,IAAK,IAAIjnC,EAAI,EAAGA,EAAI26C,EAAM36C,IAEpBqN,EAAErN,KAAOinC,EAEX8e,EAAM/lD,GAAG7C,GAAK5H,EAAEyK,GAGhB+lD,EAAM/lD,GAAG7C,GAAKi/C,EAAUsJ,EAAGlH,EAAMsH,EAAM9lD,GAAG7C,IAAMuoD,EAAGI,EAAM9lD,GAAG7C,GAAIqhD,GAMtE,OAAOsI,EAAYxM,kBAAkB,CACnCr5B,KAAM8kC,EACNruB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QCzGHuD,GAAoCrhE,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YAmBrF,OAAO,SAAsBlgD,EAAGC,EAAGs0B,GAEjC,IAAMgqB,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT0I,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER2N,EAAU9oD,EAAEu+C,QACZwK,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KACTsK,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAGd,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAII1B,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBp1C,EAAKguC,EAELK,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELr1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAIjC,IAYIr9D,EAAG+U,EAAG1E,EAAG8jD,EAZPoJ,EAAUnJ,GAAWwK,EAAU,QAAKl7D,EACpCqwD,EAAS,GACTyJ,EAAO,GAGP0B,EAAK3B,EAAU,QAAK75D,EACpBy7D,EAAK5B,EAAU,QAAK75D,EAEpB07D,EAAK,GACLC,EAAK,GAMX,IAAKtqD,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAE5ByoD,EAAKzoD,GAAKg/C,EAAOtwD,OAEjB,IAAMo7C,EAAO9pC,EAAI,EAEjB,IAAK1E,EAAImkD,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI8jD,EAAI9jD,IAE1CrQ,EAAIs0D,EAAOjkD,GAEX0jD,EAAO14C,KAAKrb,GAEZo/D,EAAGp/D,GAAK6+C,EAEJqgB,IAAMA,EAAGl/D,GAAKo0D,EAAQ/jD,IAG5B,IAAKA,EAAIyuD,EAAK/pD,GAAIo/C,EAAK2K,EAAK/pD,EAAI,GAAI1E,EAAI8jD,EAAI9jD,IAItC+uD,EAFJp/D,EAAI6+D,EAAOxuD,MAEGwuC,GAEZkV,EAAO14C,KAAKrb,GAGdq/D,EAAGr/D,GAAK6+C,EAEJsgB,IAAMA,EAAGn/D,GAAK4+D,EAAQvuD,IAG5B,GAAIktD,EAIF,IAFAltD,EAAImtD,EAAKzoD,GAEF1E,EAAI0jD,EAAOtwD,QAAQ,CAIxB,IAAMo9D,EAAMzB,EAFZp/D,EAAI+zD,EAAO1jD,IAGLywD,EAAMzB,EAAGr/D,GAEf,GAAI6gE,IAAQhiB,GAAQiiB,IAAQjiB,EAAM,CAEhC,IAGMkiB,EAAKzD,EAHAuD,IAAQhiB,EAAOqgB,EAAGl/D,GAAKo2D,EACvB0K,IAAQjiB,EAAOsgB,EAAGn/D,GAAKo2D,GAI7BruC,EAAGg5C,EAAI3K,GAOVrC,EAAOhhD,OAAO1C,EAAG,IALjBktD,EAAQliD,KAAK0lD,GAEb1wD,OAaV,OAHAmtD,EAAK/K,GAAWsB,EAAOtwD,OAGhBoS,EAAE4hD,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QCxJH2D,GAAoCzhE,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOktB,EAAkB,EAAlBA,YAoBrF,OAAO,SAAsB7sD,EAAG+T,EAAGs0B,EAAU4pB,GAE3C,IAAMI,EAAUryD,EAAEsyD,QACZC,EAASvyD,EAAEwyD,OACXC,EAAOzyD,EAAE0yD,KACT0I,EAAQp7D,EAAEivD,MACVoM,EAAMr7D,EAAEkvD,UAGd,IAAKmD,EAAW,MAAM,IAAI52C,MAAM,sEAGhC,IAII6/C,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBG,EAAKlzB,EAGU,iBAARgzB,IAETC,EAAKD,EAELtnD,EAAI4rB,EAAMsE,QAAQlwB,EAAGunD,GAErBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAYjC,IARA,IAAMM,EAAQ,GAGRxwD,EAAI,GAEJ8X,EAAI,GAGDlQ,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAIhC,IAFA,IAAM8pC,EAAO9pC,EAAI,EAERm/C,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5D,IAAMvP,EAAIwzD,EAAOjkD,GAEjBlD,EAAErM,GAAKszD,EAAQ/jD,GACf4U,EAAEnkB,GAAK+9C,EAGT,IAAK,IAAI7+C,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAEd,IAAN+U,IAEF4oD,EAAM39D,GAAK,IAGTilB,EAAEjlB,KAAO6+C,EAEX8e,EAAM39D,GAAG+U,GAAKi/C,EAAUsJ,EAAGxnD,EAAG3I,EAAEnN,IAAMs9D,EAAGnwD,EAAEnN,GAAI8V,GAG/C6nD,EAAM39D,GAAG+U,GAAKi/C,EAAUsJ,EAAGxnD,EAAG,GAAKwnD,EAAG,EAAGxnD,GAM/C,OAAO,IAAI84C,EAAY,CACrB/1B,KAAM8kC,EACNruB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QC/EH4D,GAA4B1hE,GAR5B,MACQ,CACnB,QACA,SACA,cACA,gBAGmE,YAAiD,IAA9CmiC,EAA8C,EAA9CA,MAAOutB,EAAuC,EAAvCA,OAAQ8G,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YAC5FuR,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCmL,EAAcP,GAAkB,CAAEj/B,UAClCy/B,EAAcP,GAAkB,CAAEl/B,QAAOq0B,gBACzCmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCqL,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAqCxC,OAAOA,EApDI,MAoDQ,CAEjB,iBAAkBi6B,GAElB,uBAAwB,SAAUxuD,EAAGyK,GACnC,GAAIA,EAAE2R,QACJ,MAAM,IAAI/L,MAAM,+CAElB,OAAO5F,EAAEqP,SAAW9Z,EAAIA,EAAEue,IAAI9T,IAGhC,qBAAsB,SAAUzK,EAAGyK,GACjC,GAAIA,EAAEqW,QAAQ,GAAK,EACjB,MAAM,IAAIzQ,MAAM,+CAGlB,OAAOrQ,EAAE8gB,QAAQ,IAAM,EAAI9gB,EAAEue,IAAI9T,GAAKzK,EAAEue,IAAI9T,GAAG/K,IAAI+K,GAAG8T,IAAI9T,IAG5D,6BAA8B,SAAUzK,EAAGyK,GACzC,OAAOupD,EAAYh0D,EAAGyK,EAAGhY,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCjItC+jD,GAAuC9hE,GAHvC,iBACQ,CAAC,UAE0D,YAa9E,OAAOmiC,EAbsF,EAAZA,OAapE,iBAAkB,CAE7B,iBAAkBq5B,GAElB,mBAAoB,SAAU5tD,EAAGyK,GAC/B,OAAOzK,EAAEkf,IAAIzU,IAGf,uBAAwB,SAAUzK,EAAGyK,GACnC,OAAOzK,EAAEia,MAAMxP,IAGjB,qBAAsB,SAAUzK,EAAGyK,GACjC,OAAOzK,EAAEkf,IAAIzU,IAGf,gDAAiD,SAAUzK,EAAGyK,GAC5D,IAAMO,EAAMP,EAAE8Z,QAEd,OADAvZ,EAAIlX,MAAuB,OAAdkX,EAAIlX,MAAkBkX,EAAImpD,WAAWn0D,GAAKvN,KAAKuY,EAAIlX,MAAOkM,GAChEgL,GAGT,gDAAiD,SAAUhL,EAAGyK,GAC5D,IAAMO,EAAMhL,EAAEukB,QAEd,OADAvZ,EAAIlX,MAAuB,OAAdkX,EAAIlX,MAAkBkX,EAAImpD,WAAW1pD,GAAKhY,KAAKuY,EAAIlX,MAAO2W,GAChEO,GAGT,aAAc,SAAUhL,EAAGyK,GACzB,OAAOzK,EAAE+iC,SAASt4B,SC/BX2pD,GAAiChiE,GAVjC,WACQ,CACnB,QACA,SACA,YACA,iBACA,cACA,QAGwE,YAAoE,IAAjEmiC,EAAiE,EAAjEA,MAAOutB,EAA0D,EAA1DA,OAAQuS,EAAkD,EAAlDA,UAAWC,EAAuC,EAAvCA,eAAgB1L,EAAuB,EAAvBA,YAAatO,EAAU,EAAVA,IAC5HyW,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCoI,EAAcV,GAAkB,CAAE/7B,UAExC,SAASggC,EAA2BC,EAAOC,GAEzC,OAAQD,EAAMl+D,QACZ,KAAK,EAEH,OAAQm+D,EAAMn+D,QACZ,KAAK,EAEH,GAAIk+D,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAI9xB,WAAW,2EAEvB,MACF,KAAK,EAEH,GAAI6xB,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAI9xB,WAAW,wDAA0D6xB,EAAM,GAAK,6BAA+BC,EAAM,GAAK,KAEtI,MACF,QACE,MAAM,IAAIpkD,MAAM,+DAAiEokD,EAAMn+D,OAAS,gBAEpG,MACF,KAAK,EAEH,OAAQm+D,EAAMn+D,QACZ,KAAK,EAEH,GAAIk+D,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAI9xB,WAAW,yDAA2D6xB,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAEzI,MACF,KAAK,EAEH,GAAID,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAI9xB,WAAW,2DAA6D6xB,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAE3I,MACF,QACE,MAAM,IAAIpkD,MAAM,+DAAiEokD,EAAMn+D,OAAS,gBAEpG,MACF,QACE,MAAM,IAAI+Z,MAAM,+DAAiEmkD,EAAMl+D,OAAS,iBA0BtG,SAASo+D,EAAuBhsD,EAAGC,GAEjC,GAAoB,UAAhBA,EAAE46C,UACJ,MAAM,IAAIlzC,MAAM,4CAElB,OAWF,SAAqC3H,EAAGC,GAEtC,IAYIunD,EAZEK,EAAQ7nD,EAAEk7C,MACVoM,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAERuO,EAAQ1pD,EAAEi7C,MACVgO,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAER6Q,EAAU3E,EAAM,GAChB4E,EAAWhD,EAAM,GAKnBiD,EAAKR,EAELS,EAAKR,EAGLrE,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,IAEtCC,EAAKD,EAEL4E,EAAKtgC,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IAChC4E,EAAKvgC,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,KAOvC,IAHA,IAAMh9D,EAAI,GAGD0U,EAAI,EAAGA,EAAIgtD,EAAUhtD,IAAK,CAIjC,IAFA,IAAIgb,EAAMkyC,EAAGvE,EAAM,GAAI8B,EAAM,GAAGzqD,IAEvB/U,EAAI,EAAGA,EAAI8hE,EAAS9hE,IAE3B+vB,EAAMiyC,EAAGjyC,EAAKkyC,EAAGvE,EAAM19D,GAAIw/D,EAAMx/D,GAAG+U,KAEtC1U,EAAE0U,GAAKgb,EAIT,OAAOla,EAAEq8C,kBAAkB,CACzBr5B,KAAMx4B,EACNivC,KAAM,CAACyyB,GACPpR,SAAU0M,IA3DL6E,CAA2BrsD,EAAGC,GAuEvC,IAAMqsD,EAAwBzgC,EAAM,wBAAyB,CAC3D,mBA2BF,SAAqC7rB,EAAGC,GAEtC,IAWIunD,EAXEK,EAAQ7nD,EAAEk7C,MACVoM,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAERuO,EAAQ1pD,EAAEi7C,MACViO,EAAMlpD,EAAEm7C,UAERmR,EAAQjF,EAAM,GACdkF,EAAWlF,EAAM,GAKnB6E,EAAKR,EAELS,EAAKR,EAGLrE,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,IAEtCC,EAAKD,EAEL4E,EAAKtgC,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IAChC4E,EAAKvgC,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,KAOvC,IAHA,IAAMh9D,EAAI,GAGDL,EAAI,EAAGA,EAAIoiE,EAAOpiE,IAAK,CAM9B,IAJA,IAAMwyD,EAAMkL,EAAM19D,GAEd+vB,EAAMkyC,EAAGzP,EAAI,GAAIgN,EAAM,IAElBzqD,EAAI,EAAGA,EAAIstD,EAAUttD,IAE5Bgb,EAAMiyC,EAAGjyC,EAAKkyC,EAAGzP,EAAIz9C,GAAIyqD,EAAMzqD,KAEjC1U,EAAEL,GAAK+vB,EAIT,OAAOla,EAAEq8C,kBAAkB,CACzBr5B,KAAMx4B,EACNivC,KAAM,CAAC8yB,GACPzR,SAAU0M,KA3EZ,oBAwQF,SAAsCxnD,EAAGC,GAEvC,IAAMs+C,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT2I,EAAMvnD,EAAEo7C,UAEd,IAAKmD,EAAW,MAAM,IAAI52C,MAAM,0DAEhC,IAWI6/C,EAXEmC,EAAQ1pD,EAAEi7C,MACViO,EAAMlpD,EAAEm7C,UAERmR,EAAQvsD,EAAEm7C,MAAM,GAChBsR,EAAQxsD,EAAEk7C,MAAM,GAEhBuM,EAAU,GACVxJ,EAAS,GACTyJ,EAAO,GAKTwE,EAAKR,EAELS,EAAKR,EAEL15C,EAAKguC,EAELK,EAAO,EAGPgH,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,IAEtCC,EAAKD,EAEL4E,EAAKtgC,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IAChC4E,EAAKvgC,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,IACrCt1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,IAI1B,IAAMlwD,EAAI,GAEJ8X,EAAI,GAGVu4C,EAAK,GAAK,EAEV,IAAK,IAAI+E,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,IAAMC,EAAMhD,EAAM+C,GAElB,IAAKx6C,EAAGy6C,EAAKpM,GAEX,IAAK,IAAIqM,EAAMjO,EAAK+N,GAAKG,EAAMlO,EAAK+N,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,IAAMC,EAAKtO,EAAOqO,GAEb19C,EAAE29C,GASLz1D,EAAEy1D,GAAMZ,EAAG70D,EAAEy1D,GAAKX,EAAGO,EAAKpO,EAAQuO,MAPlC19C,EAAE29C,IAAM,EAER7O,EAAO14C,KAAKunD,GAEZz1D,EAAEy1D,GAAMX,EAAGO,EAAKpO,EAAQuO,MAShC,IAAK,IAAIjwC,EAAKqhC,EAAOtwD,OAAQ3B,EAAI,EAAGA,EAAI4wB,EAAI5wB,IAAK,CAE/C,IAAM+gE,EAAK9O,EAAOjyD,GAElBy7D,EAAQz7D,GAAKqL,EAAE01D,GAMjB,OAHArF,EAAK,GAAKzJ,EAAOtwD,OAGVoS,EAAE4hD,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAAC8yB,EAAO,GACdzR,SAAU0M,OAvVRyF,EAAwBphC,EAAM,wBAAyB,CAC3D,2BA2EF,SAA0C7rB,EAAGC,GAE3C,IAaIunD,EAbEK,EAAQ7nD,EAAEk7C,MACVoM,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAERuO,EAAQ1pD,EAAEi7C,MACVgO,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAERmR,EAAQjF,EAAM,GACdkF,EAAWlF,EAAM,GACjB4E,EAAWhD,EAAM,GAKnBiD,EAAKR,EAELS,EAAKR,EAGLrE,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,IAEtCC,EAAKD,EAEL4E,EAAKtgC,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IAChC4E,EAAKvgC,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,KAOvC,IAHA,IAAMh9D,EAAI,GAGDL,EAAI,EAAGA,EAAIoiE,EAAOpiE,IAAK,CAE9B,IAAMwyD,EAAMkL,EAAM19D,GAElBK,EAAEL,GAAK,GAEP,IAAK,IAAI+U,EAAI,EAAGA,EAAIgtD,EAAUhtD,IAAK,CAIjC,IAFA,IAAIgb,EAAMkyC,EAAGzP,EAAI,GAAIgN,EAAM,GAAGzqD,IAErB5H,EAAI,EAAGA,EAAIk1D,EAAUl1D,IAE5B4iB,EAAMiyC,EAAGjyC,EAAKkyC,EAAGzP,EAAIrlD,GAAIqyD,EAAMryD,GAAG4H,KAEpC1U,EAAEL,GAAG+U,GAAKgb,GAKd,OAAOla,EAAEq8C,kBAAkB,CACzBr5B,KAAMx4B,EACNivC,KAAM,CAAC8yB,EAAOL,GACdpR,SAAU0M,KAlIZ,4BA8IF,SAA2CxnD,EAAGC,GAE5C,IAAM4nD,EAAQ7nD,EAAEk7C,MACVoM,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER2N,EAAU9oD,EAAEu+C,QACZwK,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KACTsK,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAEd,IAAK2N,EAAW,MAAM,IAAIphD,MAAM,0DAEhC,IAII6/C,EAJE+E,EAAQjF,EAAM,GACd4E,EAAWhD,EAAM,GAKnBiD,EAAKR,EAELS,EAAKR,EAEL15C,EAAKguC,EAELK,EAAO,EAGPgH,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,IAEtCC,EAAKD,EAEL4E,EAAKtgC,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IAChC4E,EAAKvgC,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,IACrCt1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,IAiB1B,IAbA,IAAME,EAAU,GACVxJ,EAAS,GACTyJ,EAAO,GAEPn9D,EAAIyV,EAAE2hD,mBAAmB,CAC7BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAAC8yB,EAAOL,GACdpR,SAAU0M,IAIH0F,EAAK,EAAGA,EAAKhB,EAAUgB,IAAM,CAEpCvF,EAAKuF,GAAMhP,EAAOtwD,OAElB,IAAMu/D,EAAMlE,EAAKiE,GACXE,EAAMnE,EAAKiE,EAAK,GAEtB,GAAIE,EAAMD,EAIR,IAFA,IAAI1/B,EAAO,EAEFtjC,EAAI,EAAGA,EAAIoiE,EAAOpiE,IAAK,CAM9B,IAJA,IAAM6+C,EAAO7+C,EAAI,EAEbggE,OAAG,EAEEkD,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAEjC,IAAMX,EAAK1D,EAAOqE,GAEd5/B,IAASub,GAEXmhB,EAAMiC,EAAGvE,EAAM19D,GAAGuiE,GAAK3D,EAAQsE,IAE/B5/B,EAAOub,GAGPmhB,EAAMgC,EAAGhC,EAAKiC,EAAGvE,EAAM19D,GAAGuiE,GAAK3D,EAAQsE,KAIvC5/B,IAASub,GAAS92B,EAAGi4C,EAAK5J,KAE5BrC,EAAO14C,KAAKrb,GACZu9D,EAAQliD,KAAK2kD,KASrB,OAHAxC,EAAKuE,GAAYhO,EAAOtwD,OAGjBpD,GA/OP,4BAgWF,SAA2CwV,EAAGC,GAE5C,IAAMs+C,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT2I,EAAMvnD,EAAEo7C,UAEd,IAAKmD,EAAW,MAAM,IAAI52C,MAAM,0DAEhC,IAQI6/C,EAREmC,EAAQ1pD,EAAEi7C,MACViO,EAAMlpD,EAAEm7C,UAERmR,EAAQvsD,EAAEm7C,MAAM,GAChBsR,EAAQxsD,EAAEk7C,MAAM,GAChB+Q,EAAWjsD,EAAEk7C,MAAM,GAKrBgR,EAAKR,EAELS,EAAKR,EAEL15C,EAAKguC,EAELK,EAAO,EAGPgH,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,IAEtCC,EAAKD,EAEL4E,EAAKtgC,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IAChC4E,EAAKvgC,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,IACrCt1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,IAsB1B,IAlBA,IAAME,EAAU,GACVxJ,EAAS,GACTyJ,EAAO,GAEPn9D,EAAIwV,EAAE4hD,mBAAmB,CAC7BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAAC8yB,EAAOL,GACdpR,SAAU0M,IAINlwD,EAAI,GAEJ8X,EAAI,GAGD89C,EAAK,EAAGA,EAAKhB,EAAUgB,IAAM,CAEpCvF,EAAKuF,GAAMhP,EAAOtwD,OAIlB,IAFA,IAAMo7C,EAAOkkB,EAAK,EAETR,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,IAAMY,EAAO3D,EAAM+C,GAAIQ,GAEvB,IAAKh7C,EAAGo7C,EAAM/M,GAEZ,IAAK,IAAIqM,EAAMjO,EAAK+N,GAAKG,EAAMlO,EAAK+N,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,IAAMC,EAAKtO,EAAOqO,GAEd19C,EAAE29C,KAAQ/jB,GAEZ55B,EAAE29C,GAAM/jB,EAERkV,EAAO14C,KAAKunD,GAEZz1D,EAAEy1D,GAAMX,EAAGkB,EAAM/O,EAAQuO,KAGzBx1D,EAAEy1D,GAAMZ,EAAG70D,EAAEy1D,GAAKX,EAAGkB,EAAM/O,EAAQuO,MAM3C,IAAK,IAAIS,EAAK5F,EAAKuF,GAAKrwC,EAAKqhC,EAAOtwD,OAAQ3B,EAAIshE,EAAIthE,EAAI4wB,EAAI5wB,IAAK,CAE/D,IAAM+gE,EAAK9O,EAAOjyD,GAElBy7D,EAAQz7D,GAAKqL,EAAE01D,IAOnB,OAHArF,EAAKuE,GAAYhO,EAAOtwD,OAGjBpD,GAncP,6BA8cF,SAA4CwV,EAAGC,GAE7C,IAiBIunD,EAjBEjJ,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT2I,EAAMvnD,EAAEo7C,UAER2N,EAAU9oD,EAAEu+C,QACZwK,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KACTuK,EAAMlpD,EAAEm7C,UAGRmR,EAAQvsD,EAAEm7C,MAAM,GAChB+Q,EAAWjsD,EAAEk7C,MAAM,GAEnB3jD,EAAS+mD,GAAWwK,EAKtBoD,EAAKR,EAELS,EAAKR,EAGLrE,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,IAEtCC,EAAKD,EAEL4E,EAAKtgC,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IAChC4E,EAAKvgC,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,KAuBvC,IAnBA,IAiBIsF,EAAIF,EAAKC,EAAKQ,EAAIF,EAAKC,EAAKL,EAAIL,EAjB9BhF,EAAUlwD,EAAS,QAAK3J,EACxBqwD,EAAS,GACTyJ,EAAO,GAEPn9D,EAAIwV,EAAE4hD,mBAAmB,CAC7BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAAC8yB,EAAOL,GACdpR,SAAU0M,IAINlwD,EAAIE,EAAS,QAAK3J,EAElBuhB,EAAI,GAID89C,EAAK,EAAGA,EAAKhB,EAAUgB,IAAM,CAEpCvF,EAAKuF,GAAMhP,EAAOtwD,OAElB,IAAMo7C,EAAOkkB,EAAK,EAElB,IAAKC,EAAMlE,EAAKiE,GAAKE,EAAMnE,EAAKiE,EAAK,GAAIG,EAAKF,EAAKE,EAAKD,EAAKC,IAI3D,GAFAX,EAAK1D,EAAOqE,GAER71D,EAEF,IAAKo1D,EAAMjO,EAAK+N,GAAKG,EAAMlO,EAAK+N,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAE3DC,EAAKtO,EAAOqO,GAER19C,EAAE29C,KAAQ/jB,GAEZ55B,EAAE29C,GAAM/jB,EAERkV,EAAO14C,KAAKunD,GAEZz1D,EAAEy1D,GAAMX,EAAGrD,EAAQsE,GAAK9O,EAAQuO,KAGhCx1D,EAAEy1D,GAAMZ,EAAG70D,EAAEy1D,GAAKX,EAAGrD,EAAQsE,GAAK9O,EAAQuO,UAK9C,IAAKF,EAAMjO,EAAK+N,GAAKG,EAAMlO,EAAK+N,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAE3DC,EAAKtO,EAAOqO,GAER19C,EAAE29C,KAAQ/jB,IAEZ55B,EAAE29C,GAAM/jB,EAERkV,EAAO14C,KAAKunD,IAMpB,GAAIv1D,EAEF,IAAK,IAAI+1D,EAAK5F,EAAKuF,GAAKrwC,EAAKqhC,EAAOtwD,OAAQ3B,EAAIshE,EAAIthE,EAAI4wB,EAAI5wB,IAAK,CAE/D,IAAM+gE,EAAK9O,EAAOjyD,GAElBy7D,EAAQz7D,GAAKqL,EAAE01D,IAQrB,OAHArF,EAAKuE,GAAYhO,EAAOtwD,OAGjBpD,KAoCT,OAAOqhC,EArxBI,WAqxBQuqB,GAAO,CAGxB,eAAgB,SAAU9+C,EAAGyK,GAE3B8pD,EAA0BpY,GAAUn8C,GAAIm8C,GAAU1xC,IAGlD,IAAMxX,EAAIR,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAEjC,OAAOssC,EAAS9jD,GAAKA,EAAEkd,UAAYld,GAGrC,iBAAkB,SAAU+M,EAAGyK,GAE7B,IAAMyrD,EAAQl2D,EAAEmiC,OACVg0B,EAAQ1rD,EAAE03B,OAMhB,OAHAoyB,EAA0B2B,EAAOC,GAGZ,IAAjBD,EAAM5/D,OAEa,IAAjB6/D,EAAM7/D,OAruBhB,SAAgCoS,EAAGC,EAAGrU,GAEpC,GAAU,IAANA,EAAW,MAAM,IAAI+b,MAAM,qCAC/B,OAAOiqC,EAAI5xC,EAAGC,GAouBDytD,CAAsBp2D,EAAGyK,EAAGyrD,EAAM,IAGpCxB,EAAsB10D,EAAGyK,GAGb,IAAjB0rD,EAAM7/D,OAED0+D,EAAsBh1D,EAAGyK,GAG3BkrD,EAAsB31D,EAAGyK,IAGlC,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,EAAGyK,EAAE84C,WAAY94C,IAGtC,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOsmD,EAAY/wD,EAAGyK,EAAG6pD,GAAgB,IAG3C,mBAAoB,SAAUt0D,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAG6pD,GAAgB,IAG3C,oBAAqB,SAAUt0D,EAAGyK,GAChC,OAAOsmD,EAAYtmD,EAAGzK,EAAGs0D,GAAgB,IAG3C,mBAAoB,SAAUt0D,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGs0D,GAAgB,IAG3C,aAAc,SAAUt0D,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAG6pD,GAAgB,GAAOnkD,WAG1D,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGs0D,GAAgB,GAAMnkD,WAGzD,WAAYmkD,EAEZ,mBAAoB,SAAUt0D,EAAGyK,EAAG4rD,GAGlC,IAFA,IAAI34D,EAASjL,KAAKuN,EAAGyK,GAEZ5X,EAAI,EAAGA,EAAIwjE,EAAK//D,OAAQzD,IAC/B6K,EAASjL,KAAKiL,EAAQ24D,EAAKxjE,IAG7B,OAAO6K,IAER42D,EAAen9B,gBCl2BPm/B,GAAgClkE,GARhC,UACQ,CACnB,QACA,SACA,cACA,cAGuE,YAA+C,IAA5CmiC,EAA4C,EAA5CA,MAAOutB,EAAqC,EAArCA,OAAQ8G,EAA6B,EAA7BA,YAAapH,EAAgB,EAAhBA,UAChGgR,EAAclB,GAAkB,CAAE/8B,UAClCy+B,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCqK,EAAcH,GAAkB,CAAEv+B,QAAOq0B,gBACzCmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA+BlCgiC,EAAc,0EAIpB,OAAOhiC,EAjDI,UAiDQ,CAEjBze,OAAQ,SAAU9V,GAChB,OAAOyuD,GAAczuD,EAAG,IAG1B,iBAAkByuD,GAElBjN,UAAW,SAAUxhD,GACnB,OAAOw2D,EAAYx2D,EAAG,IAAIwhD,EAAU,KAEtCv4C,QAAS,SAAUjJ,GACjB,MAAM,IAAIqQ,MAAMkmD,IAElB,kBAAmB,SAAUv2D,EAAGyK,GAC9B,MAAM,IAAI4F,MAAMkmD,IAElB,uBAAwBC,EAExB,iBAAkB,SAAUx2D,GAC1B,OAAOvN,KAAKuN,EAAG,IAGjB,6BAA8B,SAAUA,EAAGyK,GAEzC,GAAoB,IAAhBA,EAAE8/C,UAEJ,OAAO0I,EAAYjzD,EAAGyK,EAAGhY,MAGzB,MAAM,IAAI4d,MAAM,0BAIpB,4BAA6B,SAAUrQ,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,GAAoB,IAAhBA,EAAE8/C,UAEJ,OAAOiI,EAAYxyD,EAAGyK,EAAGhY,MAAM,GAG/B,MAAM,IAAI4d,MAAM,0BAIpB,2BAA4B,SAAUrQ,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mCAAoC,SAAUzK,EAAGyK,GAC/C,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,mCAAoC,SAAUuN,EAAGyK,GAE/C,GAAoB,IAAhBA,EAAE8/C,UAEJ,OAAOwG,EAAYtmD,EAAGzK,EAAGvN,MAAM,GAG/B,MAAM,IAAI4d,MAAM,0BAIpB,kCAAmC,SAAUrQ,EAAGyK,GAC9C,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,GAAG0F,WAG5B,4BAA6B,SAAUnQ,EAAGyK,GAExC,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,IAAI0F,aAW9B,SAASqmD,EAAa9tD,EAAGvW,GACvB,IAAMokB,EAAYirC,EAAUjrC,UACtBkgD,EAAMjV,EAAUj9B,MAAM,CAAEhO,UAAWA,EAAY,IAC/C0yC,EAAO,IAAIzH,EAAU,GAErBhmC,EAAM,IAAIi7C,EAAI,GACd/H,EAAMv8D,EAAKgrB,aAKjB,GAJIuxC,IACFv8D,EAAOA,EAAKioB,OAGVjoB,EAAK2nB,SACP,MAAM,IAAIzJ,MAAM,yBAElB,GAAI3H,EAAEyU,eAAiBhrB,EAAK0W,MAAM0V,IAAI,GAAGpD,OAAO,GAC9C,MAAM,IAAI9K,MAAM,wCAIlB,GAAI3H,EAAEoR,SACJ,OAAO40C,EAAM,IAAI+H,EAAI7rD,KAAY,EAEnC,IAAKlC,EAAEU,WACL,OAAOslD,EAAMzF,EAAOvgD,EAGtB,IAAI1I,EAAI0I,EAAEG,MAAMiB,IAAI0R,EAAIR,IAAI7oB,IAI5B,OADA6N,EAAI0I,EAAE0T,QAAUpc,EAAEoa,MAAQpa,EACnB,IAAIwhD,GAAWkN,EAAMlzC,EAAIR,IAAIhb,GAAKA,GAAGwgB,YAAYjK,QC9L/CmgD,GAA6BtkE,GAH7B,OACQ,CAAC,QAAS,YAAa,WAAY,YAEc,YAA6C,IAA1CmiC,EAA0C,EAA1CA,MAAOitB,EAAmC,EAAnCA,UAAWmV,EAAwB,EAAxBA,QAASzxC,EAAe,EAAfA,SA+BlG,OAAOqP,EAlCI,OAkCQ,CACjBze,OAAQ64C,GAER1lD,QAAS,SAAUjJ,GACjB,OAAgB,IAATA,EAAEkK,GAAWysD,EAAQhI,GAAW3uD,EAAEiK,KAAOjK,EAAE+hB,QAGpDy/B,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAUxhD,EAAEmZ,IAAI,KAG7B+L,SAAU,SAAUllB,GAClB,OAAO,IAAIklB,EAASllB,EAAEpL,EAAG,IAG3B,iBAAkB,SAAUoL,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1Bq1D,KAAM,SAAU9nD,GACd,IAAKA,EAAE42D,cAA2C,IAA3B52D,EAAE62D,MAAM,GAAG7K,KAAKr5C,OACrC,MAAM,IAAI5W,UAAU,2CAEtB,OAAOtJ,KAAKuN,EAAElM,aCxDPgjE,GAA6B1kE,GAH7B,OACQ,CAAC,SAAU,QAAS,YAE6B,YAAgC,IAA7BsxB,EAA6B,EAA7BA,OAAQ6Q,EAAqB,EAArBA,MAAOtrB,EAAc,EAAdA,QAyBtF,OAAOsrB,EAAM,OAAQ,CACnBze,OAAQihD,EAER9tD,QAAS,SAAUjJ,GACjB,OAAOA,EAAEmK,QAGXq3C,UAAW,SAAUxhD,GACnB,OAAKA,EAAEmd,cAAgBuG,EAAO0vC,YACrBpzD,EAAEmK,OAGF4sD,EAAY/2D,EAAEgH,aAIzB,iBAAkB,SAAUhH,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1Bq1D,KAAM,SAAU9nD,GAEd,OAAOA,EAAE8J,IAAI,OAWjB,SAASitD,EAAa/2D,GACpB,OAAI2J,MAAM3J,GACDuH,IACEvH,GAAK,GAAK0jB,EAAO0vC,YACnBl+D,KAAKiV,KAAKnK,GAEV,IAAIiJ,EAAQjJ,EAAG,GAAGmK,WChElB6sD,GAA+B5kE,GAH/B,SACQ,CAAC,UAEkD,YA2BtE,OAAOmiC,EA3B8E,EAAZA,OAH9D,SA8BQ,CACjBze,OAAQ84C,GAER3lD,QAAS,SAAUjJ,GACjB,OAAOA,EAAEkf,IAAIlf,IAGfwhD,UAAW,SAAUxhD,GACnB,OAAOA,EAAEia,MAAMja,IAGjBklB,SAAU,SAAUllB,GAClB,OAAOA,EAAEkf,IAAIlf,IAGf,iBAAkB,SAAUA,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1Bq1D,KAAM,SAAU9nD,GACd,OAAOA,EAAE8J,IAAI,SCpCNmtD,GAAiC7kE,GAVjC,WACQ,CACnB,QACA,SACA,cACA,YACA,aACA,gBAGwE,YAAwE,IAArEmiC,EAAqE,EAArEA,MAAOutB,EAA8D,EAA9DA,OAAQ8G,EAAsD,EAAtDA,YAAayL,EAAyC,EAAzCA,UAAW3E,EAA8B,EAA9BA,WAAYjO,EAAkB,EAAlBA,YAGxH+Q,EAAclB,GAAkB,CAAE/8B,UAClCw/B,EAAcP,GAAkB,CAAEj/B,UAClCy/B,EAAcP,GAAkB,CAAEl/B,QAAOq0B,gBACzC8J,EAAcP,GAAkB,CAAE59B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAmCxC,OAAOA,EArDI,WAqDQ,CAEjB,iBAAkB,SAAUv0B,EAAGyK,GAC7B,OAAOzK,EAAIyK,GAGb,mBAAoB,SAAUzK,EAAGyK,GAC/B,OAAOzK,EAAEie,IAAIxT,IAGf,uBAAwB,SAAUzK,EAAGyK,GACnC,OAAOzK,EAAE0J,MAAMe,IAGjB,qBAAsB,SAAUzK,EAAGyK,GACjC,OAAOzK,EAAEie,IAAIxT,IAGf,aAAc,SAAUzK,EAAGyK,GACzB,GAAgB,OAAZzK,EAAElM,MACJ,MAAM,IAAIuc,MAAM,oDAGlB,GAAgB,OAAZ5F,EAAE3W,MACJ,MAAM,IAAIuc,MAAM,oDAGlB,IAAKrQ,EAAE0oD,UAAUj+C,GACf,MAAM,IAAI4F,MAAM,sBAGlB,IAAMrF,EAAMhL,EAAEukB,QAId,OAHAvZ,EAAIlX,MAAQrB,KAAKuY,EAAIlX,MAAO2W,EAAE3W,OAC9BkX,EAAIwkD,WAAY,EAETxkD,GAGT,6BAA8B,SAAUhL,EAAGyK,GAEzC,OADAysD,GAAqBl3D,EAAGyK,GACjBupD,EAAYh0D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GAExC,OADAysD,GAAqBl3D,EAAGyK,GACjBspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OADAysD,GAAqBl3D,EAAGyK,GACjB+nD,EAAYxyD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GAEvC,OADAysD,GAAqBl3D,EAAGyK,GACjBkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOioD,EAAY1yD,EAAG0vD,EAAWjlD,GAAI4pD,IAGvC,mBAAoB,SAAUr0D,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,OAG3B,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOioD,EAAYjoD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBAWnD,SAAS+mD,GAAsBl3D,EAAGyK,GAChC,IAAMyrD,EAAQl2D,EAAEmiC,OACVg0B,EAAQ1rD,EAAE03B,OAEhB,GAAI+zB,EAAM5/D,SAAW6/D,EAAM7/D,OACzB,MAAM,IAAIwlD,GAAeoa,EAAM5/D,OAAQ6/D,EAAM7/D,QC3KjD,IAGa6gE,GAA6B/kE,GAH7B,OACQ,CAAC,QAAS,SAAU,SAAU,cAEmB,YAA0C,IAAvCmiC,EAAuC,EAAvCA,MAAO7Q,EAAgC,EAAhCA,OAAQo+B,EAAwB,EAAxBA,OAAQN,EAAgB,EAAhBA,UAwB9F,OAAOjtB,EA3BI,OA2BQ,CACjB,iBAAkB,SAAU7rB,EAAGC,GAC7B,IAAMqC,EAAM6jD,GAAWnmD,EAAGC,GAE1B,MAA0B,UAAlB+a,EAAOo+B,OACX92C,EACA82C,EAAO92C,IAEb,uBAWF,SAAyBtC,EAAGC,GAE1B,IACE5U,EAGAkhB,EAGAthB,EA6BEqX,EA3BEi+C,EAAO,IAAIzH,EAAU,GACrBhmC,EAAM,IAAIgmC,EAAU,GACtBxhD,EAAIipD,EACJ6F,EAAQtzC,EACR/Q,EAAI+Q,EACJuzC,EAAQ9F,EAEZ,IAAKvgD,EAAEwU,UAAYvU,EAAEuU,QACnB,MAAM,IAAI7M,MAAM,uDAGlB,MAAQ1H,EAAEmR,UACR7E,EAAIvM,EAAEsS,IAAIrS,GAAG+C,QACb/X,EAAI+U,EAAE6V,IAAI5V,GAEV5U,EAAIiM,EACJA,EAAI8uD,EAAMplD,MAAMuL,EAAEgF,MAAMja,IACxB8uD,EAAQ/6D,EAERA,EAAI0W,EACJA,EAAIskD,EAAMrlD,MAAMuL,EAAEgF,MAAMxP,IACxBskD,EAAQh7D,EAER2U,EAAIC,EACJA,EAAIhV,EAKJqX,EADEtC,EAAE6U,GAAG0rC,GACD,CAACvgD,EAAE0R,MAAO00C,EAAM10C,MAAO20C,EAAM30C,OAE7B,CAAC1R,EAAIA,EAAEoR,SAAmB,EAARg1C,EAAWC,GAErC,MAA0B,UAAlBrrC,EAAOo+B,OAAsB92C,EAAM82C,EAAO92C,SCxFzCosD,GAA+BhlE,GAH/B,SACQ,CAAC,QAAS,SAAU,YAAa,OAAQ,QAAS,UAAW,MAAO,MAAO,cAExB,YAA6E,IAA1EmiC,EAA0E,EAA1EA,MAAeitB,GAA2D,EAAnE99B,OAAmE,EAA3D89B,WAAW6V,EAAgD,EAAhDA,KAAMC,EAA0C,EAA1CA,MAAOC,EAAmC,EAAnCA,QAASh5C,EAA0B,EAA1BA,IAAK7e,EAAqB,EAArBA,IAAKud,EAAgB,EAAhBA,UAwBnI,OAAOsX,EA3BI,SA2BQ,CACjB,iBAAkBijC,EAClB,uBAAwBA,IAG1B,SAASA,EAAQ9uD,EAAGC,GAClB,IAAKsU,EAAUvU,KAAOuU,EAAUtU,GAAI,MAAM,IAAI0H,MAAM,yDAEpD,GADA3H,EAAI6V,EAAI7V,EAAGC,GACP2uD,EAAM3uD,EAAG,GAAI,MAAM,IAAI0H,MAAM,4BACjC,IAAIrF,EAAMqsD,EAAK3uD,EAAGC,GAElB,EADAqC,EAAMA,EAAImF,UACV,YAAKiV,EAAL,KAAUspC,EAAV,KACA,OAAK4I,EAAMlyC,EAAKo8B,EAAU,KAC1BkN,EAAMnwC,EAAImwC,EAAK/lD,GACX4uD,EAAQ7I,EAAKlN,EAAU,MAAKkN,EAAMhvD,EAAIgvD,EAAK/lD,IACxC+lD,GAH+BnnD,QCnC7BkwD,GAAoCrlE,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YAmBrF,OAAO,SAAsBlgD,EAAGC,EAAGs0B,GAEjC,IAAMgqB,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT0I,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER2N,EAAU9oD,EAAEu+C,QACZwK,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KACTsK,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAGd,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAII1B,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBp1C,EAAKguC,EAELK,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELr1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAIjC,IAUIr9D,EAAG+U,EAAG1E,EAAG6jD,EAAIC,EAVXoJ,EAAUnJ,GAAWwK,EAAU,QAAKl7D,EACpCqwD,EAAS,GACTyJ,EAAO,GAGPrwD,EAAIowD,EAAU,QAAK75D,EAEnBuhB,EAAI,GAMV,IAAKlQ,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAE5ByoD,EAAKzoD,GAAKg/C,EAAOtwD,OAEjB,IAAMo7C,EAAO9pC,EAAI,EAEjB,GAAI5H,EAEF,IAAK+mD,EAAK4K,EAAK/pD,GAAIo/C,EAAK2K,EAAK/pD,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAInD4U,EAFAjlB,EAAI6+D,EAAOxuD,IAEJwuC,EACP1xC,EAAEnN,GAAK4+D,EAAQvuD,GAInB,IAAK6jD,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAInD,GAFArQ,EAAIs0D,EAAOjkD,GAEPlD,EAAG,CAEL,IAAM03D,EAAK5/C,EAAEjlB,KAAO6+C,EAAO1xC,EAAEnN,GAAKo2D,EAE5B2K,EAAKzD,EAAGlJ,EAAQ/jD,GAAIw0D,GAErB98C,EAAGg5C,EAAI3K,KAEVrC,EAAO14C,KAAKrb,GAEZu9D,EAAQliD,KAAK0lD,SAIfhN,EAAO14C,KAAKrb,GAQlB,OAHAw9D,EAAK/K,GAAWsB,EAAOtwD,OAGhBoS,EAAE4hD,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QCrHHyH,GAAoCvlE,GARpC,cACQ,CACnB,QACA,SACA,cACA,mBAG2E,YAAoD,IAAjDmiC,EAAiD,EAAjDA,MAAOutB,EAA0C,EAA1CA,OAAQ8G,EAAkC,EAAlCA,YAAa0L,EAAqB,EAArBA,eACpGtB,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCgP,EAAcH,GAAkB,CAAEljC,QAAOq0B,gBACzCmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA4BxC,OAAOA,EAzCI,cAyCQ,CAEjB,WAAY+/B,EAEZ,6BAA8B,SAAUt0D,EAAGyK,GACzC,OAAOmtD,EAAY53D,EAAGyK,EAAG6pD,GAAgB,IAG3C,4BAA6B,SAAUt0D,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGs0D,GAAgB,IAG3C,4BAA6B,SAAUt0D,EAAGyK,GACxC,OAAOuoD,EAAYhzD,EAAGyK,EAAG6pD,GAAgB,IAG3C,2BAA4B,SAAUt0D,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAG6pD,IAG3B,eAAgB,SAAUt0D,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOsmD,EAAY/wD,EAAGyK,EAAG6pD,GAAgB,IAG3C,mBAAoB,SAAUt0D,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAG6pD,GAAgB,IAG3C,oBAAqB,SAAUt0D,EAAGyK,GAChC,OAAOsmD,EAAYtmD,EAAGzK,EAAGs0D,GAAgB,IAG3C,mBAAoB,SAAUt0D,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGs0D,GAAgB,IAG3C,aAAc,SAAUt0D,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAG6pD,GAAgB,GAAOnkD,WAG1D,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGs0D,GAAgB,GAAMnkD,gBCrFtD,SAAS0nD,GAAiB73D,EAAGyK,GAClC,GAAKzK,EAAEoJ,aAAepJ,EAAEid,aAAiBxS,EAAErB,aAAeqB,EAAEwS,YAC1D,MAAM,IAAI5M,MAAM,wCAGlB,IAAMmxC,EAAYxhD,EAAEpK,YACpB,GAAIoK,EAAE2J,SAAWc,EAAEd,QACjB,OAAO,IAAI63C,EAAUj6C,KAGvB,GAAIvH,EAAE8Z,UAAYrP,EAAEmQ,IAAI,IAAM5a,EAAE4a,GAAGnQ,GACjC,OAAOzK,EAET,GAAIyK,EAAEqP,UAAY9Z,EAAE4a,IAAI,GACtB,OAAOnQ,EAGT,IAAKzK,EAAEoJ,aAAeqB,EAAErB,WAAY,CAClC,IAAKpJ,EAAEoJ,aAAeqB,EAAErB,WACtB,OAAIpJ,EAAEmd,eAAiB1S,EAAE0S,aAChBnd,EAEF,IAAIwhD,EAAU,GAEvB,IAAKxhD,EAAEoJ,WACL,OAAIqB,EAAE0S,aACGnd,EAELA,EAAEmd,aACG,IAAIqkC,EAAU,GAEhB/2C,EAET,IAAKA,EAAErB,WACL,OAAIpJ,EAAEmd,aACG1S,EAELA,EAAE0S,aACG,IAAIqkC,EAAU,GAEhBxhD,EAGX,OAAO83D,GAAQ93D,EAAGyK,GAAG,SAAU/B,EAAGC,GAAK,OAAOD,EAAIC,KAS7C,SAASovD,GAAiB/3D,GAC/B,GAAIA,EAAEoJ,aAAepJ,EAAEid,YACrB,MAAM,IAAI5M,MAAM,uCAGlB,IAAMmxC,EAAYxhD,EAAEpK,YACdoiE,EAAWxW,EAAUjrC,UAC3BirC,EAAU99B,OAAO,CAAEnN,UAAW,MAE9B,IAAM7Y,EAASsC,EAAEyJ,KAAK,IAAI+3C,EAAU,IAIpC,OAHA9jD,EAAO9I,GAAK8I,EAAO9I,GAAK,KAExB4sD,EAAU99B,OAAO,CAAEnN,UAAWyhD,IACvBt6D,EAuBF,SAASu6D,GAAgBj4D,EAAGyK,GACjC,GAAKzK,EAAEoJ,aAAepJ,EAAEid,aAAiBxS,EAAErB,aAAeqB,EAAEwS,YAC1D,MAAM,IAAI5M,MAAM,uCAGlB,IAAMmxC,EAAYxhD,EAAEpK,YACpB,GAAIoK,EAAE2J,SAAWc,EAAEd,QACjB,OAAO,IAAI63C,EAAUj6C,KAGvB,IAAM2wD,EAAS,IAAI1W,GAAW,GAC9B,OAAIxhD,EAAE8Z,UAAYrP,EAAEmQ,GAAGs9C,IAAWl4D,EAAE4a,GAAGnQ,GAC9BA,EAELA,EAAEqP,UAAY9Z,EAAE4a,GAAGs9C,GACdl4D,EAGJA,EAAEoJ,YAAeqB,EAAErB,WAWjB0uD,GAAQ93D,EAAGyK,GAAG,SAAU/B,EAAGC,GAAK,OAAOD,EAAIC,MAV1C3I,EAAEoJ,aAAepJ,EAAEmd,cAAgB1S,EAAE0S,cACxCnd,EAAEmd,eAAiB1S,EAAE0S,eAAiB1S,EAAErB,WAClC8uD,EAELl4D,EAAEmd,cAAgB1S,EAAE0S,aACfnd,EAAEoJ,WAAapJ,EAAIyK,EAErBzK,EAAEoJ,WAAaqB,EAAIzK,EAavB,SAAS83D,GAAS93D,EAAGyK,EAAGgd,GAC7B,IAEI0wC,EAAOC,EAoBPC,EAASC,EAASC,EAtBhB/W,EAAYxhD,EAAEpK,YAGd4iE,IAAUx4D,EAAEpL,EAAI,GAChB6jE,IAAUhuD,EAAE7V,EAAI,GACtB,GAAI4jE,EAAO,CACTL,EAAQO,GAA6BX,GAAgB/3D,IACrD,IAAK,IAAInN,EAAI,EAAGA,EAAIslE,EAAM7hE,SAAUzD,EAClCslE,EAAMtlE,IAAM,OAGdslE,EAAQO,GAA6B14D,GAEvC,GAAIy4D,EAAO,CACTL,EAAQM,GAA6BX,GAAgBttD,IACrD,IAAK,IAAI5X,EAAI,EAAGA,EAAIulE,EAAM9hE,SAAUzD,EAClCulE,EAAMvlE,IAAM,OAGdulE,EAAQM,GAA6BjuD,GAInC0tD,EAAM7hE,QAAU8hE,EAAM9hE,QACxB+hE,EAAUF,EACVG,EAAUF,EACVG,EAAUC,IAEVH,EAAUD,EACVE,EAAUH,EACVI,EAAUE,GAGZ,IAAIE,EAAWN,EAAQ/hE,OACnBsiE,EAAUN,EAAQhiE,OAChBuiE,EAAkC,EAArBpxC,EAAK+wC,EAAOC,GAC3BK,EAAS,IAAItX,EAAuB,EAAbqX,GACvBE,EAAW,IAAIvX,EAAU,GACvBwX,EAAM,IAAIxX,EAAU,GAEpBwW,EAAWxW,EAAUjrC,UAG3B,IAFAirC,EAAU99B,OAAO,CAAEnN,UAAW,MAEvBoiD,EAAW,GACZlxC,EAAK4wC,IAAUM,GAAWL,IAAUM,MAAcC,IACpDC,EAASA,EAAOrvD,KAAKsvD,IAEvBA,EAAWA,EAAS9+C,MAAM++C,GAE5B,KAAOJ,EAAU,GACXnxC,EAAK8wC,EAASD,IAAUM,MAAcC,IACxCC,EAASA,EAAOrvD,KAAKsvD,IAEvBA,EAAWA,EAAS9+C,MAAM++C,GAQ5B,OALAxX,EAAU99B,OAAO,CAAEnN,UAAWyhD,IAEX,IAAfa,IACFC,EAAOlkE,GAAKkkE,EAAOlkE,GAEdkkE,EAIT,SAASJ,GAA8B14D,GAKrC,IAHA,IAAM0I,EAAI1I,EAAE7M,EACRQ,EAAI+U,EAAE,GAAK,GAEN7V,EAAI,EAAGA,EAAI6V,EAAEpS,SAAUzD,EAAG,CAEjC,IADA,IAAI+B,EAAI8T,EAAE7V,GAAK,GACNqW,EAAI,EAAItU,EAAE0B,OAAQ4S,KACzBtU,EAAI,IAAMA,EAGZjB,GAAKiB,EAIP,IADA,IAAIgT,EAAIjU,EAAE2C,OACa,MAAhB3C,EAAEwd,OAAOvJ,IACdA,IAGF,IAAIsW,EAAKle,EAAEkV,EACPjC,EAAMtf,EAAEkP,MAAM,EAAG+E,EAAI,GAAK,GACxB8Q,EAAOzF,EAAI3c,OACjB,GAAI4nB,EAAK,EACP,KAAMA,EAAKxF,EAGT,IADAwF,GAAMxF,EACCwF,KACLjL,GAAO,SAEAiL,EAAKxF,IACdzF,EAAMA,EAAIpQ,MAAM,EAAGqb,GAAM,IAAMjL,EAAIpQ,MAAMqb,IAM7C,IADA,IAAMhZ,EAAM,CAAC,GACJrS,EAAI,EAAGA,EAAIogB,EAAI3c,QAAS,CAE/B,IADA,IAAImiB,EAAOvT,EAAI5O,OACRmiB,KACLvT,EAAIuT,IAAS,GAGfvT,EAAI,IAAMsC,SAASyL,EAAI9B,OAAOte,MAC9B,IAAK,IAAI+U,EAAI,EAAGA,EAAI1C,EAAI5O,SAAUsR,EAC5B1C,EAAI0C,GAAK,IACQ,OAAf1C,EAAI0C,EAAI,SAA8BrR,IAAf2O,EAAI0C,EAAI,KACjC1C,EAAI0C,EAAI,GAAK,GAGf1C,EAAI0C,EAAI,IAAM1C,EAAI0C,IAAM,EACxB1C,EAAI0C,IAAM,GAKhB,OAAO1C,EAAI0T,UAsBN,SAASqgD,GAAQj5D,EAAGyK,GACzB,GAAKzK,EAAEoJ,aAAepJ,EAAEid,aAAiBxS,EAAErB,aAAeqB,EAAEwS,YAC1D,MAAM,IAAI5M,MAAM,wCAGlB,IAAMmxC,EAAYxhD,EAAEpK,YACpB,GAAIoK,EAAE2J,SAAWc,EAAEd,QACjB,OAAO,IAAI63C,EAAUj6C,KAEvB,GAAIvH,EAAE8Z,SACJ,OAAOrP,EAET,GAAIA,EAAEqP,SACJ,OAAO9Z,EAGT,GAAIA,EAAE4a,GAAGnQ,GACP,OAAO,IAAI+2C,EAAU,GAGvB,IAAM0W,EAAS,IAAI1W,GAAW,GAC9B,OAAIxhD,EAAE4a,GAAGs9C,GACAH,GAAgBttD,GAErBA,EAAEmQ,GAAGs9C,GACAH,GAAgB/3D,GAGpBA,EAAEoJ,YAAeqB,EAAErB,WAQjB0uD,GAAQ93D,EAAGyK,GAAG,SAAU/B,EAAGC,GAAK,OAAOD,EAAIC,KAP3C3I,EAAEoJ,YAAeqB,EAAErB,WAGjB,IAAIo4C,EAAUxhD,EAAEmd,eAAiB1S,EAAE0S,aACtCvS,KACCA,KAJIstD,EA2BN,SAASgB,GAAoBl5D,EAAGyK,GACrC,GAAKzK,EAAEoJ,aAAepJ,EAAEid,aAAiBxS,EAAErB,aAAeqB,EAAEwS,YAC1D,MAAM,IAAI5M,MAAM,2CAGlB,IAAMmxC,EAAYxhD,EAAEpK,YACpB,OAAIoK,EAAE2J,SAAWc,EAAEd,SAAYc,EAAE0S,eAAiB1S,EAAEqP,SAC3C,IAAI0nC,EAAUj6C,KAEnBvH,EAAE8Z,UAAYrP,EAAEqP,SACX9Z,EAEJA,EAAEoJ,YAAeqB,EAAErB,WAKpBqB,EAAE8S,GAAG,IACAvd,EAAEia,MAAM/kB,KAAK4U,IAAI,EAAGW,EAAEzD,YAAc,IAEtChH,EAAEia,MAAM,IAAIunC,EAAU,GAAG13C,IAAIW,IAP3B,IAAI+2C,EAAUj6C,KA6BlB,SAAS4xD,GAA0Bn5D,EAAGyK,GAC3C,GAAKzK,EAAEoJ,aAAepJ,EAAEid,aAAiBxS,EAAErB,aAAeqB,EAAEwS,YAC1D,MAAM,IAAI5M,MAAM,iDAGlB,IAAMmxC,EAAYxhD,EAAEpK,YACpB,OAAIoK,EAAE2J,SAAWc,EAAEd,SAAYc,EAAE0S,eAAiB1S,EAAEqP,SAC3C,IAAI0nC,EAAUj6C,KAEnBvH,EAAE8Z,UAAYrP,EAAEqP,SACX9Z,EAEJyK,EAAErB,WAWHqB,EAAE8S,GAAG,IACAvd,EAAEgb,IAAI9lB,KAAK4U,IAAI,EAAGW,EAAEzD,YAAc,IAAI0E,QAExC1L,EAAEgb,IAAI,IAAIwmC,EAAU,GAAG13C,IAAIW,IAAIiB,QAbhC1L,EAAEmd,aACG,IAAIqkC,GAAW,GAEnBxhD,EAAEoJ,WAGA,IAAIo4C,EAAU,GAFZ,IAAIA,EAAUj6C,KCrZ3B,IACMkmD,GAAK,iBAEJ,SAAS2L,GAAcp5D,EAAGyK,GAC/B,IAAKwS,EAAUjd,KAAOid,EAAUxS,GAC9B,MAAM,IAAI4F,MAAM,wCAGlB,OAAOrQ,EAAIyK,EAIN,SAAS4uD,GAAcr5D,GAC5B,IAAKid,EAAUjd,GACb,MAAM,IAAIqQ,MAAM,uCAGlB,OAAQrQ,EAIH,SAASs5D,GAAat5D,EAAGyK,GAC9B,IAAKwS,EAAUjd,KAAOid,EAAUxS,GAC9B,MAAM,IAAI4F,MAAM,uCAGlB,OAAOrQ,EAAIyK,EAIN,SAAS8uD,GAAcv5D,EAAGyK,GAC/B,IAAKwS,EAAUjd,KAAOid,EAAUxS,GAC9B,MAAM,IAAI4F,MAAM,wCAGlB,OAAOrQ,EAAIyK,EAIN,SAAS+uD,GAAiBx5D,EAAGyK,GAClC,IAAKwS,EAAUjd,KAAOid,EAAUxS,GAC9B,MAAM,IAAI4F,MAAM,2CAGlB,OAAOrQ,GAAKyK,EAIP,SAASgvD,GAAuBz5D,EAAGyK,GACxC,IAAKwS,EAAUjd,KAAOid,EAAUxS,GAC9B,MAAM,IAAI4F,MAAM,iDAGlB,OAAOrQ,GAAKyK,EAIP,SAASivD,GAAqB15D,EAAGyK,GACtC,IAAKwS,EAAUjd,KAAOid,EAAUxS,GAC9B,MAAM,IAAI4F,MAAM,+CAGlB,OAAOrQ,IAAMyK,EApDf2uD,GAAatiC,UAAY22B,GASzB4L,GAAaviC,UAnBF,SA4BXwiC,GAAYxiC,UAAY22B,GASxB8L,GAAaziC,UAAY22B,GASzB+L,GAAgB1iC,UAAY22B,GAS5BgM,GAAsB3iC,UAAY22B,GASlCiM,GAAoB5iC,UAAY22B,GCzDhC,IAOakM,GAA+BvnE,GAP/B,SACQ,CACnB,QACA,SACA,gBAGsE,YAAoC,IAAjCmiC,EAAiC,EAAjCA,MAAOutB,EAA0B,EAA1BA,OAAQ8G,EAAkB,EAAlBA,YAClFoK,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCqK,EAAcH,GAAkB,CAAEv+B,QAAOq0B,gBACzCmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAwBxC,OAAOA,EApCI,SAoCQ,CAEjB,iBAAkB6kC,GAElB,uBAAwBvB,GAExB,6BAA8B,SAAU73D,EAAGyK,GACzC,OAAOwoD,EAAYjzD,EAAGyK,EAAGhY,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYhzD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOsmD,EAAYtmD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCjGtCypD,GAA+BxnE,GAH/B,SACQ,CAAC,UAEkD,YAuBtE,OAAOmiC,EAvB8E,EAAZA,OAH9D,SA0BQ,CACjBze,OAAQujD,GAER7X,UAAWuW,GAEX,iBAAkB,SAAU/3D,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCpBXonE,GAA8BznE,GAR9B,QACQ,CACnB,QACA,SACA,cACA,gBAGqE,YAAiD,IAA9CmiC,EAA8C,EAA9CA,MAAOutB,EAAuC,EAAvCA,OAAQ8G,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YAC9F+Q,EAAclB,GAAkB,CAAE/8B,UAClCk+B,EAAcX,GAAkB,CAAEv9B,QAAOq0B,gBACzC8J,EAAcP,GAAkB,CAAE59B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAyBxC,OAAOA,EAtCI,QAsCQ,CAEjB,iBAAkB+kC,GAElB,uBAAwBrB,GAExB,6BAA8B,SAAUj4D,EAAGyK,GACzC,OAAOgoD,EAAYzyD,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAO+nD,EAAY/nD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAO+nD,EAAYxyD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOioD,EAAY1yD,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOioD,EAAYjoD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCrGtC2pD,GAAoC1nE,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOktB,EAAkB,EAAlBA,YAerF,OAAO,SAAsB/4C,EAAGC,EAAGs0B,GAEjC,IAAM+yB,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER8N,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAGd,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAII1B,EAiBAr9D,EAAG+U,EArBDw9C,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlB/G,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELhH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAOjC,IAAMM,EAAQ,GAEd,IAAK39D,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAO29D,EAAM39D,GAAK,GAGxC,IAAMk/D,EAAK,GACLC,EAAK,GAELC,EAAK,GACLC,EAAK,GAGX,IAAKtqD,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAE5B,IAAM8pC,EAAO9pC,EAAI,EAMjB,IAJAmyD,EAASrxD,EAAGd,EAAGqqD,EAAIF,EAAIrgB,GAEvBqoB,EAASpxD,EAAGf,EAAGsqD,EAAIF,EAAItgB,GAElB7+C,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAK,CAEzB,IAAMmnE,EAAK/H,EAAGp/D,KAAO6+C,EAAOqgB,EAAGl/D,GAAKo2D,EAC9ByO,EAAKxF,EAAGr/D,KAAO6+C,EAAOsgB,EAAGn/D,GAAKo2D,EAEpCuH,EAAM39D,GAAG+U,GAAKuoD,EAAG6J,EAAItC,IAKzB,OAAO,IAAIjW,EAAY,CACrB/1B,KAAM8kC,EACNruB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,KAId,SAAS6J,EAAU9mE,EAAG2U,EAAGkQ,EAAG9X,EAAG0xC,GAM7B,IAJA,IAAMxxC,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KAELpkD,EAAI8lD,EAAIphD,GAAIo/C,EAAKgC,EAAIphD,EAAI,GAAI1E,EAAI8jD,EAAI9jD,IAAK,CAEjD,IAAMrQ,EAAIwN,EAAM6C,GAEhB4U,EAAEjlB,GAAK6+C,EACP1xC,EAAEnN,GAAKqN,EAAOgD,QC5FP+2D,GAA+B7nE,GAP/B,SACQ,CACnB,QACA,SACA,gBAGsE,YAAoC,IAAjCmiC,EAAiC,EAAjCA,MAAOutB,EAA0B,EAA1BA,OAAQL,EAAkB,EAAlBA,YAClFsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAwBxC,OAAOA,EApCI,SAoCQ,CAEjB,iBAAkBglC,GAElB,uBAAwBY,GAExB,6BAA8B,SAAUn6D,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCnGtCiqD,GAA4BhoE,GAH5B,MACQ,CAAC,UAE+C,YA4BnE,OAAOmiC,EA5B2E,EAAZA,OAH3D,MA+BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAO9K,KAAK6U,MAAM,EAAG/J,IAGvBwhD,UAAW,SAAUxhD,GACnB,OAAOA,EAAEpK,YAAYmU,MAAM,EAAG/J,IAGhCiJ,QAAS,SAAUjJ,GACjB,OAAOA,EAAE6D,OAKX,iBAAkB,SAAU7D,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC5CX4nE,GAA6BjoE,GAH7B,OACQ,CAAC,UAEgD,YA0BpE,OAAOmiC,EA1B4E,EAAZA,OAH5D,OA6BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAOA,GAGTwhD,UAAW,SAAUxhD,GACnB,OAAOA,GAGTiJ,QAAS,SAAUjJ,GACjB,OAAOA,EAAEs6D,aAGX,iBAAkB,SAAUt6D,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCxCX8nE,GAA2BnoE,GAH3B,KACQ,CAAC,UAE8C,YA4BlE,OAAOmiC,EA5B0E,EAAZA,OAH1D,KA+BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAO,GAGTwhD,UAAW,SAAUxhD,GACnB,OAAOA,EAAEkf,IAAI,IAGfgG,SAAU,SAAUllB,GAClB,OAAOA,EAAEkf,IAAI,IAGfjW,QAAS,SAAUjJ,GACjB,OAAOA,EAAEkK,IAGX,iBAAkB,SAAUlK,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC9CX+nE,GAA2BpoE,GAH3B,KACQ,CAAC,UAE8C,YA4BlE,OAAOmiC,EA5B0E,EAAZA,OAH1D,KA+BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAOA,GAGTwhD,UAAW,SAAUxhD,GACnB,OAAOA,GAGTklB,SAAU,SAAUllB,GAClB,OAAOA,GAGTiJ,QAAS,SAAUjJ,GACjB,OAAOA,EAAEiK,IAGX,iBAAkB,SAAUjK,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCjDjB,SAASgoE,GAAWz6D,GACzB,OAAQA,EAIH,SAAS06D,GAAU16D,EAAGyK,GAC3B,SAAUzK,IAAKyK,GAIV,SAASkwD,GAAW36D,EAAGyK,GAC5B,QAASzK,KAAQyK,EAIZ,SAASmwD,GAAW56D,EAAGyK,GAC5B,SAAUzK,IAAKyK,GAbjBgwD,GAAU3jC,UANC,SAWX4jC,GAAS5jC,UAVE,iBAeX6jC,GAAU7jC,UAfC,iBAoBX8jC,GAAU9jC,UApBC,iBCGX,IAGa+jC,GAA4BzoE,GAH5B,MACQ,CAAC,UAE+C,YA0BnE,OAAOmiC,EA1B2E,EAAZA,OAH3D,MA6BQ,CACjBze,OAAQ2kD,GAERxxD,QAAS,SAAUjJ,GACjB,OAAgB,IAATA,EAAEiK,IAAqB,IAATjK,EAAEkK,IAGzBs3C,UAAW,SAAUxhD,GACnB,OAAOA,EAAE8Z,UAAY9Z,EAAE2J,SAGzBm+C,KAAM,SAAU9nD,GACd,OAAmB,OAAZA,EAAElM,OAAiBrB,KAAKuN,EAAElM,QAGnC,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCjCXqoE,GAA2B1oE,GAR3B,KACQ,CACnB,QACA,SACA,cACA,gBAGkE,YAAiD,IAA9CmiC,EAA8C,EAA9CA,MAAOutB,EAAuC,EAAvCA,OAAQ8G,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YAC3FsS,EAAcP,GAAkB,CAAEj/B,UAClCy/B,EAAcP,GAAkB,CAAEl/B,QAAOq0B,gBACzCqL,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA8BxC,OAAOA,EA3CI,KA2CQ,CAEjB,iBAAkBmmC,GAElB,mBAAoB,SAAU16D,EAAGyK,GAC/B,OAAiB,IAATzK,EAAEiK,IAAqB,IAATjK,EAAEkK,IAAuB,IAATO,EAAER,IAAqB,IAATQ,EAAEP,IAGxD,uBAAwB,SAAUlK,EAAGyK,GACnC,OAASzK,EAAE8Z,WAAa9Z,EAAE2J,UAAcc,EAAEqP,WAAarP,EAAEd,SAG3D,aAAc,SAAU3J,EAAGyK,GACzB,OAAOhY,KAAKuN,EAAElM,OAAS,EAAG2W,EAAE3W,OAAS,IAGvC,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOupD,EAAYh0D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBC1GtC4qD,GAA4B3oE,GAP5B,MACQ,CACnB,QACA,SACA,gBAGmE,YAAoC,IAAjCmiC,EAAiC,EAAjCA,MAAOutB,EAA0B,EAA1BA,OAAQL,EAAkB,EAAlBA,YAC/EsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA8BxC,OAAOA,EA1CI,MA0CQ,CAEjB,iBAAkBomC,GAElB,mBAAoB,SAAU36D,EAAGyK,GAC/B,OAAkB,IAATzK,EAAEiK,IAAqB,IAATjK,EAAEkK,MAAwB,IAATO,EAAER,IAAqB,IAATQ,EAAEP,KAG1D,uBAAwB,SAAUlK,EAAGyK,GACnC,QAAUzK,EAAE8Z,WAAa9Z,EAAE2J,YAAec,EAAEqP,WAAarP,EAAEd,UAG7D,aAAc,SAAU3J,EAAGyK,GACzB,OAAOhY,KAAKuN,EAAElM,OAAS,EAAG2W,EAAE3W,OAAS,IAGvC,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBC9GtC6qD,GAA+B5oE,GAH/B,SACQ,CAAC,QAAS,SAAU,cAE+B,YAAkC,IAA/BmiC,EAA+B,EAA/BA,MAAOutB,EAAwB,EAAxBA,OAAQ7kC,EAAgB,EAAhBA,UA8BxF,OAAOsX,EAjCI,SAiCQ,CAEjB,yCAA0C,SAAUtkB,GAClD,IAAIpd,EAGAooE,EAFEn3D,EAAMmM,EAAK3Z,OACbgmD,GAAO,EAEP4e,GAAW,EACTC,EAAW,GAEjB,IAAKtoE,EAAI,EAAGA,EAAIiR,EAAKjR,IAAK,CACxB,IAAMgR,EAAMoM,EAAKpd,GAOjB,GAJIkkD,EAASlzC,KACXq3D,GAAW,GAGTzkB,EAAS5yC,IAAQ6yC,EAAY7yC,GAAM,CACrC,GAAIhR,IAAMiR,EAAM,EACd,MAAM,IAAIuM,MAAM,gDAOlB,GAHA4qD,EAAU3e,EACVA,EAAMz4C,EAAIsM,WAEL8M,EAAUq/B,GACb,MAAM,IAAIvgD,UAAU,yCAGtB,GAAIugD,EAAM,GAAMzpD,EAAI,GAAKypD,EAAM2e,EAE7B,MAAM,IAAI/e,GAAWI,EAAK2e,EAAU,OAEjC,CAEL,IAAMhoE,EAAIsxB,GAAM1gB,GAAKsM,UACfgyB,EAAOga,GAAUlpD,GAMvB,GALAkoE,EAAStoE,GAAKI,EACdgoE,EAAU3e,EACVA,EAAMna,EAAK7rC,OAAS,EAGhBzD,EAAI,GAAKypD,IAAQ2e,EACnB,MAAM,IAAInf,GAAemf,EAAU,EAAG3e,EAAM,IAKlD,GAAwB,IAApB6e,EAAS7kE,OACX,MAAM,IAAIkS,YAAY,gCAIxB,IADA,IAAIwC,EAAMmwD,EAAS98C,QACZ88C,EAAS7kE,QACd0U,EAAMowD,GAAQpwD,EAAKmwD,EAAS98C,QAASi+B,EAAK,GAG5C,OAAO4e,EAAWpZ,EAAO92C,GAAOA,GAGlC,YAAa,SAAUiF,GACrB,OAAOA,EAAK5O,KAAK,UAevB,SAAS+5D,GAAS1yD,EAAGC,EAAG0yD,EAAW/e,GACjC,GAAIA,EAAM+e,EAAW,CAEnB,GAAI3yD,EAAEpS,SAAWqS,EAAErS,OACjB,MAAM,IAAIwlD,GAAepzC,EAAEpS,OAAQqS,EAAErS,QAIvC,IADA,IAAMpD,EAAI,GACDL,EAAI,EAAGA,EAAI6V,EAAEpS,OAAQzD,IAC5BK,EAAEL,GAAKuoE,GAAQ1yD,EAAE7V,GAAI8V,EAAE9V,GAAIwoE,EAAW/e,EAAM,GAE9C,OAAOppD,EAGP,OAAOwV,EAAEjF,OAAOkF,GChIpB,IAGa2yD,GAA+BlpE,GAH/B,SACQ,CAAC,QAAS,QAAS,SAAU,UAEsB,YAAqC,IAAlCmiC,EAAkC,EAAlCA,MAAOgnC,EAA2B,EAA3BA,MAAOzZ,EAAoB,EAApBA,OAAQqC,EAAY,EAAZA,MAsB/F,OAAO5vB,EAzBI,SAyBQ,CACjB,iBAAkBinC,EAElB,gBAAiB,SAAU1nE,EAAO2nE,GAChC,OAAOD,EAAQ1Z,EAAOv9B,GAAMzwB,IAAS2nE,GAAQtrD,aAUjD,SAASqrD,EAAS1nE,EAAO2nE,GAEvB,GAA4B,IAAxB3nE,EAAMquC,OAAO7rC,OACf,MAAM,IAAI+Z,MAAM,4CAGlBosC,GAAcgf,EAAQ3nE,EAAMquC,OAAO,IAEnC,IAAMu5B,EAAWvX,EAAM,EAAGrwD,EAAMquC,OAAO,IACjC9hC,EAAQ,IAAIk7D,EAAMG,EAAUD,GAClC,OAAO3nE,EAAM2vD,OAAOpjD,OChDXs7D,GAA8BvpE,GAH9B,QACQ,CAAC,QAAS,OAAQ,SAEgC,YAA2B,IAAxBmiC,EAAwB,EAAxBA,MAAO4N,EAAiB,EAAjBA,KAAM/gB,EAAW,EAAXA,KAsBrF,OAAOmT,EAzBI,QAyBQ,CACjBhlB,OAAQ,SAAUvP,GAChB,OAAOA,EAAE1J,QAGX,iBAAkB,SAAU0J,GAC1B,OAAOohB,EAAK+gB,EAAKniC,UC3BV47D,GAA8BxpE,GAH9B,QACQ,CAAC,QAAS,SAAU,WAAY,aAEkB,YAA2C,IAAxCmiC,EAAwC,EAAxCA,MAAOutB,EAAiC,EAAjCA,OAAQ7gC,EAAyB,EAAzBA,SAAU8hB,EAAe,EAAfA,SAkCjG,OAAOxO,EArCI,QAqCQ,CACjB,iBAAkB,SAAUv0B,EAAGyK,GAC7B,OAAOq3C,EAAO+Z,EAAO77D,EAAEojD,UAAW34C,EAAE24C,aAGtC,gBAAiB,SAAUpjD,EAAGyK,GAC5B,OAAOq3C,EAAO+Z,EAAO77D,EAAEojD,UAAW34C,KAGpC,gBAAiB,SAAUzK,EAAGyK,GAC5B,OAAOq3C,EAAO+Z,EAAO77D,EAAGyK,EAAE24C,aAG5B,eAAgByY,IAUlB,SAASA,EAAQ77D,EAAGyK,GAClB,IAAMqxD,EAAmB5mE,KAAK0N,IAAIu5C,GAAUn8C,GAAG1J,OAAQ6lD,GAAU1xC,GAAGnU,QAEpE0J,EAAI+9C,GAAQ/9C,GACZyK,EAAIszC,GAAQtzC,GAEZ,IAAMsxD,EAAQ5f,GAAUn8C,GAClBg8D,EAAQ7f,GAAU1xC,GAExB,GAAqB,IAAjBsxD,EAAMzlE,QAAiC,IAAjB0lE,EAAM1lE,QAA6B,IAAbylE,EAAM,IAAyB,IAAbC,EAAM,GACtE,MAAM,IAAIr5B,WAAW,6CACLo5B,EAAM16D,KAAK,MAAQ,WAAa26D,EAAM36D,KAAK,MAAQ,MAGrE,IAAMg8C,EAAU,CACdp8B,EAAS8hB,EAAS/iC,EAAE,GAAIyK,EAAE,IAAKs4B,EAAS/iC,EAAE,GAAIyK,EAAE,KAChDwW,EAAS8hB,EAAS/iC,EAAE,GAAIyK,EAAE,IAAKs4B,EAAS/iC,EAAE,GAAIyK,EAAE,KAChDwW,EAAS8hB,EAAS/iC,EAAE,GAAIyK,EAAE,IAAKs4B,EAAS/iC,EAAE,GAAIyK,EAAE,MAGlD,OAAIqxD,EAAmB,EACd,CAACze,GAEDA,MC9EA4e,GAA6B7pE,GAH7B,OACQ,CAAC,QAAS,SAAU,cAAe,iBAEc,YAAkD,IAA/CmiC,EAA+C,EAA/CA,MAAOutB,EAAwC,EAAxCA,OAAQL,EAAgC,EAAhCA,YAAaoH,EAAmB,EAAnBA,aAsCnG,OAAOt0B,EAzCI,OAyCQ,CAGjB5xB,MAAO,SAAU3C,GACf,OAAOk8D,EAAMl8D,EAAG,EAAGm8C,GAAUn8C,GAAI,OAGnC,gBAAiB,SAAUA,EAAGkD,GAC5B,OAAOg5D,EAAMl8D,EAAGkD,EAAGi5C,GAAUn8C,GAAI,OAGnC,mBAAoB,SAAUA,EAAGkD,GAC/B,OAAOg5D,EAAMl8D,EAAGkD,EAAE8D,WAAYm1C,GAAUn8C,GAAI,OAG9C,gBAAiB,SAAUA,EAAGo5C,GAC5B,OAAO8iB,EAAMl8D,EAAG,EAAGm8C,GAAUn8C,GAAIo5C,IAGnC,wBAAyB,SAAUp5C,EAAGkD,EAAGk2C,GACvC,OAAO8iB,EAAMl8D,EAAGkD,EAAGi5C,GAAUn8C,GAAIo5C,IAGnC,2BAA4B,SAAUp5C,EAAGkD,EAAGk2C,GAC1C,OAAO8iB,EAAMl8D,EAAGkD,EAAE8D,WAAYm1C,GAAUn8C,GAAIo5C,IAG9CkK,OAAQ,SAAUtjD,GAChB,OAAOk8D,EAAMl8D,EAAG,EAAGA,EAAEmiC,OAAQniC,EAAEujD,YAGjC,iBAAkB,SAAUvjD,EAAGkD,GAC7B,OAAOg5D,EAAMl8D,EAAGkD,EAAGlD,EAAEmiC,OAAQniC,EAAEujD,YAGjC,oBAAqB,SAAUvjD,EAAGkD,GAChC,OAAOg5D,EAAMl8D,EAAGkD,EAAE8D,WAAYhH,EAAEmiC,OAAQniC,EAAEujD,YAG5C,iBAAkB,SAAUvjD,EAAGo5C,GAC7B,OAAO8iB,EAAMl8D,EAAG,EAAGA,EAAEmiC,OAAQiX,IAG/B,yBAA0B,SAAUp5C,EAAGkD,EAAGk2C,GACxC,OAAO8iB,EAAMl8D,EAAGkD,EAAGlD,EAAEmiC,OAAQiX,IAG/B,4BAA6B,SAAUp5C,EAAGkD,EAAGk2C,GAC3C,OAAO8iB,EAAMl8D,EAAGkD,EAAE8D,WAAYhH,EAAEmiC,OAAQiX,MAa5C,SAAS8iB,EAAOl8D,EAAGkD,EAAGi/B,EAAMiX,GAC1B,IAAKn8B,EAAU/Z,GACb,MAAM,IAAInH,UAAU,wDAGtB,IAAM0pD,EAASviD,EAAI,EAAIA,EAAI,EACrBwiD,EAAOxiD,EAAI,GAAKA,EAAI,EAG1B,OAAQi/B,EAAK7rC,QACX,KAAK,EACH,OAON,SAAgC0J,EAAGkD,EAAGk2C,EAAQtmD,EAAG4yD,EAAMD,GAErD,IAAME,EAAK,CAAC7yD,EAAI4yD,EAAM5yD,EAAI2yD,GAE1B,GAAIrM,GAAqB,WAAXA,GAAkC,UAAXA,EACnC,MAAM,IAAIr9C,UAAJ,8BAAqCq9C,EAArC,MAIR,IAAMnmD,EAAe,WAAXmmD,EACNyP,EAAarD,SAASG,EAAI3lD,EAAGkD,GAC7Bu+C,EAAY+D,SAASG,EAAI3lD,EAAGkD,GAEhC,OAAkB,OAAXk2C,EAAkBnmD,EAAIA,EAAEkd,UApBpBgsD,CAAsBn8D,EAAGkD,EAAGk2C,EAAQjX,EAAK,GAAIujB,EAAMD,GAC5D,KAAK,EACH,OAqBN,SAAuBzlD,EAAGkD,EAAGk2C,EAAQxkD,EAAG8wD,EAAMD,GAE5C,GAAI1O,EAAS/2C,GAAI,CAEf,IAAMo8D,EAAKp8D,EAAEwlD,SAAStiD,GAEtB,OAAe,OAAXk2C,EAEEA,IAAWgjB,EAAG7Y,UAAoBzB,EAAOsa,EAAIhjB,GAC1CgjB,EAEFA,EAAGjsD,UAOZ,IAJA,IAAM7b,EAAIY,KAAKyQ,IAAI/Q,EAAE,GAAK8wD,EAAM9wD,EAAE,GAAK6wD,GAEjC4W,EAAS,GAENxpE,EAAI,EAAGA,EAAIyB,EAAGzB,IACrBwpE,EAAOxpE,GAAKmN,EAAEnN,EAAI6yD,GAAM7yD,EAAI4yD,GAG9B,OAAkB,OAAXrM,EAAkB0I,EAAOua,GAAUA,EA3C/BC,CAAat8D,EAAGkD,EAAGk2C,EAAQjX,EAAMujB,EAAMD,GAElD,MAAM,IAAI9iB,WAAW,sDCvHlB,SAAS45B,GAAUroD,GACxB,IAAIiuB,EAAO,EACPzkB,EAAO,EACPqpB,EAAQxzC,OAAOY,OAAO,MACtB4B,EAAMxC,OAAOY,OAAO,MACpBkM,EAAQ,EACNm8D,EAAM,SAAUrvC,GACpB,IAAMsvC,EAAW1mE,EAAIo3B,GACrB,GAAKsvC,WACE11B,EAAM01B,UACN1mE,EAAIo3B,KACTgV,EACEzkB,IAAS++C,GAAb,CACA,IAAKt6B,EAGH,OAFA9hC,EAAQ,OACRqd,EAAO,GAGT,MAAQhpB,eAAe1B,KAAK+zC,IAASrpB,QAGvC,OADAxJ,EAAQhf,KAAK2T,IAAIqL,GACV,CACLwoD,IAAK,SAAUvvC,GACb,IAAMsvC,EAAW1mE,EAAIo3B,GAAWwvC,IAAYt8D,EAG5C,GAFA0mC,EAAM41B,GAAWxvC,EACjBp3B,EAAIo3B,GAAMwvC,GACLF,EAAU,CAEb,KADEt6B,GACUjuB,EAAO,OAGnB,OAFAiZ,EAAK4Z,EAAMrpB,GACX8+C,EAAIrvC,GACGA,EAGT,UADO4Z,EAAM01B,GACT/+C,IAAS++C,EACb,MAAQ/nE,eAAe1B,KAAK+zC,IAASrpB,OAGvCk/C,OAAQJ,EACR/3B,MAAO,WACLtC,EAAO9hC,EAAQ,EACfqd,EAAO,EACPqpB,EAAQxzC,OAAOY,OAAO,MACtB4B,EAAMxC,OAAOY,OAAO,QC3BnB,SAAS0oE,GAASzjE,GAA4B,6DAAJ,GAAlB0jE,EAAsB,EAAtBA,OAAQ5oD,EAAc,EAAdA,MAIrC,OAHAA,EAAiB,MAATA,EAAgB/K,OAAO4zD,kBAAoB7oD,EACnD4oD,EAAmB,MAAVA,EAAiBhQ,KAAKh9C,UAAYgtD,EAEpC,SAASD,IACe,WAAzB,IAAOA,EAAQG,SACjBH,EAAQG,MAAQ,CACd98D,OAAQ,IAAI8gD,IACZic,IAAKV,GAASroD,GAAS/K,OAAO4zD,qBAIlC,IADA,IAAM9sD,EAAO,GACJpd,EAAI,EAAGA,EAAIwD,UAAUC,OAAQzD,IACpCod,EAAKpd,GAAKwD,UAAUxD,GAEtB,IAAMqqE,EAAOJ,EAAO7sD,GAEpB,GAAI4sD,EAAQG,MAAM98D,OAAOyR,IAAIurD,GAE3B,OADAL,EAAQG,MAAMC,IAAIP,IAAIQ,GACfL,EAAQG,MAAM98D,OAAOxM,IAAIwpE,GAGlC,IAAMC,EAAS/jE,EAAGC,MAAMD,EAAI6W,GAI5B,OAHA4sD,EAAQG,MAAM98D,OAAOxF,IAAIwiE,EAAMC,GAC/BN,EAAQG,MAAM98D,OAAO08D,OAAOC,EAAQG,MAAMC,IAAIP,IAAIQ,IAE3CC,GAmDJ,SAASC,GAAkBhkE,GAChC,OAAO7F,OAAOkS,KAAKrM,EAAG+9B,YAAc,IACjC0mB,QAAO,SAAU5tC,EAAM6mB,GACtB,IAAMsM,GAAStM,EAAUttB,MAAM,OAAS,IAAIlT,OAAS,EACrD,OAAOpB,KAAK0N,IAAIqN,EAAMmzB,MACpB,GCjGR,IAGai6B,GAA+BjrE,GAH/B,SACQ,CAAC,UAEkD,YA8BtE,OAAOmiC,EA9B8E,EAAZA,OA8B5D,SAAU,CACrB,kBAAmB+oC,GAEnB,mBAAoB,SAAUt9D,EAAGlD,GAC/B,OAAOkD,EAAE7L,OAAOmpE,GAAgBt9D,EAAEojD,UAAWtmD,KAG/C,gBAAiBwhD,GAEjB,iBAAkB,SAAUt+C,EAAGlD,GAC7B,OAAOkD,EAAE7L,OAAOmqD,GAAat+C,EAAEojD,UAAWtmD,UAYhD,SAASwgE,GAAiBt9D,EAAGi9B,GAE3B,IAAMhtB,EAAOmtD,GAAiBngC,GAE9B,OAAO1wB,GAAOvM,GAAG,SAAUlM,EAAOuM,EAAOmD,GAEvC,OAAa,IAATyM,EACKgtB,EAASnpC,GACE,IAATmc,EACFgtB,EAASnpC,EAAO,CAACuM,IAEjB48B,EAASnpC,EAAO,CAACuM,GAAQmD,MClEtC,IAGa+5D,GAAgCnrE,GAHhC,UACQ,CAAC,QAAS,WAE0C,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOutB,EAAa,EAAbA,OAoBjF,OAAOvtB,EAvBI,UAuBQ,CACjB5xB,MAAO,SAAU3C,GACf,OAAOw9D,GAAaj5C,GAAMvkB,KAG5BsjD,OAAQ,SAAUtjD,GAChB,IAAMq+C,EAAOmf,GAAaj5C,GAAMvkB,EAAEojD,YAElC,OAAOtB,EAAOzD,SC5BPof,GAAgCrrE,GAHhC,UACQ,CAAC,UAEmD,YAwBvE,OAAOmiC,EAxB+E,EAAZA,OAH/D,UA2BQ,CACjB,kBAAmBmpC,GAEnB,mBAAoB,SAAU19D,EAAGi9B,GAC/B,OAAOj9B,EAAEtJ,QAAQumC,SAWvB,SAASygC,GAAUl6D,EAAOy5B,GAExB,IAAMhtB,EAAOmtD,GAAiBngC,IAEd,SAAVkoB,EAAoBrxD,EAAOuM,GAC3BsC,MAAMP,QAAQtO,GAChB6pE,GAAa7pE,GAAO,SAAU0oD,EAAO3pD,GAEnCsyD,EAAQ3I,EAAOn8C,EAAMoD,OAAO5Q,OAIjB,IAATod,EACFgtB,EAASnpC,GACS,IAATmc,EACTgtB,EAASnpC,EAAOuM,GAEhB48B,EAASnpC,EAAOuM,EAAOmD,GAI7B2hD,CAAQ3hD,EAAO,IC/DjB,IAGao6D,GAA0CxrE,GAH1C,oBACQ,CAAC,UAE6D,YAmCjF,OAAOmiC,EAnCyF,EAAZA,OAHzE,oBAsCQ,CACjB5xB,MAAO,SAAU3C,GACf,OAAO0+C,GAAiB1+C,EAAG44C,IAE7B0K,OAAQ,SAAUtjD,GAChB,OAAOA,EAAEglD,oBChCF6Y,GAAiCzrE,GAVjC,WACQ,CACnB,QACA,SACA,SACA,YACA,cACA,iBAGwE,YAAqE,IAAlEmiC,EAAkE,EAAlEA,MAAO7Q,EAA2D,EAA3DA,OAAQo+B,EAAmD,EAAnDA,OAAQN,EAA2C,EAA3CA,UAAWC,EAAgC,EAAhCA,YAAaoH,EAAmB,EAAnBA,aA+B1H,OAAOt0B,EAzCI,WAyCQ,CACjB,GAAI,WACF,MAA0B,WAAlB7Q,EAAOo+B,OAAuBA,EAAO,IAAM,IAGrDvyC,OAAQ,SAAU6pC,GAChB,OAAO0I,EAAO1I,IAGhB,qBAAsB,SAAUgM,GAC9B,OAAO0Y,EAAU1Y,EAAMA,EAAwB,WAAlB1hC,EAAOo+B,OAAsB,aAAUvrD,IAGtE,6BAA8B,SAAU6uD,EAAMhM,GAC5C,OAAO0kB,EAAU1Y,EAAMA,EAAMhM,IAG/B,yCAA0C,SAAUgM,EAAM2Y,GACxD,OAAOD,EAAU1Y,EAAM2Y,EAAwB,WAAlBr6C,EAAOo+B,OAAsB,aAAUvrD,IAGtE,iDAAkD,SAAU6uD,EAAM2Y,EAAM3kB,GACtE,OAAO0kB,EAAU1Y,EAAM2Y,EAAM3kB,IAG/Bz2C,MAAO,SAAUw/B,GACf,OAAO67B,EAAgB77B,IAGzB,gBAAiB,SAAUA,EAAMiX,GAC/B,OAAO4kB,EAAgB77B,EAAMiX,IAG/BkK,OAAQ,SAAUnhB,GAChB,OAAO67B,EAAgB77B,EAAKhyB,UAAWgyB,EAAKohB,YAG9C,iBAAkB,SAAUphB,EAAMiX,GAChC,OAAO4kB,EAAgB77B,EAAKhyB,UAAWipC,MAI3C,SAAS4kB,EAAiB77B,EAAMiX,GAC9B,OAAQjX,EAAK7rC,QACX,KAAK,EAAG,OAAO8iD,EAAS0I,EAAO1I,GAAU,GACzC,KAAK,EAAG,OAAO0kB,EAAU37B,EAAK,GAAIA,EAAK,GAAIiX,GAC3C,KAAK,EAAG,OAAO0kB,EAAU37B,EAAK,GAAIA,EAAK,GAAIiX,GAC3C,QAAS,MAAM,IAAI/oC,MAAM,0CAY7B,SAASytD,EAAW1Y,EAAM2Y,EAAM3kB,GAE9B,IAAMqd,EAAO/f,EAAY0O,IAAS1O,EAAYqnB,GAC1Cvc,EACA,KAKJ,GAHI9K,EAAY0O,KAAOA,EAAOA,EAAKp+C,YAC/B0vC,EAAYqnB,KAAOA,EAAOA,EAAK/2D,aAE9BiW,EAAUmoC,IAASA,EAAO,EAC7B,MAAM,IAAI/0C,MAAM,6DAElB,IAAK4M,EAAU8gD,IAASA,EAAO,EAC7B,MAAM,IAAI1tD,MAAM,6DAGlB,IAAMmL,EAAMi7C,EAAM,IAAIjV,EAAU,GAAK,EAC/B7E,EAAe8Z,EAAM,IAAIA,EAAI,GAAK,EAClCt0B,EAAO,CAACijB,EAAM2Y,GAGpB,GAAI3kB,EAAQ,CAEV,GAAe,WAAXA,EACF,OAAOyP,EAAarD,SAASrjB,EAAM3mB,EAAK,EAAGmhC,GAE7C,GAAe,UAAXvD,EACF,OAAOqI,EAAY+D,SAASrjB,EAAM3mB,EAAK,EAAGmhC,GAE5C,MAAM,IAAI5gD,UAAJ,+BAAsCq9C,EAAtC,MAQR,IAJA,IAAMpuC,EAAM0xC,GAAO,GAAIva,EAAMwa,GAEvBshB,EAAU7Y,EAAO2Y,EAAO3Y,EAAO2Y,EAE5B5qE,EAAI,EAAGA,EAAI8qE,EAAS9qE,IAC3B6X,EAAI7X,GAAGA,GAAKqoB,EAEd,OAAOxQ,MC3IEkzD,GAA6B9rE,GAH7B,OACQ,CAAC,QAAS,SAAU,mBAE6B,YAAuC,IAApCmiC,EAAoC,EAApCA,MAAOutB,EAA6B,EAA7BA,OAAQwS,EAAqB,EAArBA,eA4BtF,OAAO//B,EA/BI,OA+BQ,CACjB,iBAAkB,SAAUv0B,EAAGyK,GAC7B,OAAOq3C,EAAOqc,EAAMn+D,EAAEojD,UAAW34C,EAAE24C,aAGrC,gBAAiB,SAAUpjD,EAAGyK,GAC5B,OAAOq3C,EAAOqc,EAAMn+D,EAAEojD,UAAW34C,KAGnC,gBAAiB,SAAUzK,EAAGyK,GAC5B,OAAOq3C,EAAOqc,EAAMn+D,EAAGyK,EAAE24C,aAG3B,eAAgB+a,IAUlB,SAASA,EAAOz1D,EAAGC,GAUjB,GARuB,IAAnBw5B,GAAKz5B,GAAGpS,SAEVoS,EAAI,CAACA,IAEgB,IAAnBy5B,GAAKx5B,GAAGrS,SAEVqS,EAAI,CAACA,IAEHw5B,GAAKz5B,GAAGpS,OAAS,GAAK6rC,GAAKx5B,GAAGrS,OAAS,EACzC,MAAM,IAAIqsC,WAAW,+EACAmqB,KAAKh9C,UAAUpH,EAAEpS,QAAU,SAAWw2D,KAAKh9C,UAAUnH,EAAErS,QAAU,KAExF,IAAMvC,EAAI,GACNJ,EAAI,GAER,OAAO+U,EAAE3S,KAAI,SAAU2S,GACrB,OAAOC,EAAE5S,KAAI,SAAU4S,GAGrB,OAFAhV,EAAI,GACJI,EAAEma,KAAKva,GACA+U,EAAE3S,KAAI,SAAU0U,GACrB,OAAO9B,EAAE5S,KAAI,SAAUiK,GACrB,OAAOrM,EAAEua,KAAKomD,EAAe7pD,EAAGzK,iBAIlCjM,MC9EGktD,GAA4B7uD,GAH5B,MACQ,CAAC,UAE+C,YA0CnE,OAAOmiC,EA1C2E,EAAZA,OAH3D,MA6CQ,CACjB,kBAAmB02B,GAEnB,mBAAoB,SAAUjrD,EAAGi9B,GAC/B,OAAOj9B,EAAEjK,IAAIknC,SAYnB,SAASguB,GAAMznD,EAAOy5B,GAEpB,IAAMhtB,EAAOmtD,GAAiBngC,GAwC9B,OAtCgB,SAAVkoB,EAAoBrxD,EAAOuM,GAC/B,GAAIsC,MAAMP,QAAQtO,GAChB,OAAOA,EAAMiC,KAAI,SAAUymD,EAAO3pD,GAEhC,OAAOsyD,EAAQ3I,EAAOn8C,EAAMoD,OAAO5Q,OAGrC,IAEE,OAAa,IAATod,EACKgtB,EAASnpC,GACE,IAATmc,EACFgtB,EAASnpC,EAAOuM,GAEhB48B,EAASnpC,EAAOuM,EAAOmD,GAEhC,MAAO+zB,GAEP,GAAIA,aAAex7B,WACf,SAAUw7B,GACY,cAAtBA,EAAI7L,KAAKmM,SAA0B,CACrC,IAAIumC,EAAS,0BAAH,OAA6B7mC,EAAI7L,KAAKtyB,GAAtC,YAA4CtF,GAChDuqE,EAAcvR,KAAKh9C,UAAUzP,GASnC,MARa,IAAT4P,EACFmuD,GAAU,IAAMC,EACE,IAATpuD,IACTmuD,GAAU,IAAJ,OAAQC,EAAR,YAAuB76D,IAE/B46D,GAAU,mBAAJ,OAAuB7mC,EAAI7L,KAAKrrB,MAAQ,EAAxC,aACN+9D,GAAU,GAAJ,OAAO7mC,EAAI7L,KAAKoM,OAAhB,kCACNsmC,GAAU7mC,EAAI7L,KAAK8L,SAASn2B,KAAK,QAC3B,IAAItF,UAAUqiE,GAEtB,MAAM7mC,GAKL4tB,CAAQ3hD,EAAO,ICtGxB,IAGa86D,GAA6BlsE,GAH7B,OACQ,CAAC,QAAS,SAAU,WAAY,WAEiB,YAAyC,IAAtCmiC,EAAsC,EAAtCA,MAAOutB,EAA+B,EAA/BA,OAAQ7gC,EAAuB,EAAvBA,SAAUnL,EAAa,EAAbA,OA+ChG,OAAOye,EAlDI,OAkDQ,CACjB,iBAAkB,SAAUrvB,GAC1B,OAAI6xC,EAAS7xC,GACJ48C,EAAOyc,EAAMr5D,EAAIk+C,YAEjBmb,EAAMr5D,IAGjB,yBAA0B,SAAUA,EAAKo3C,GACvC,IAAKr/B,EAAUq/B,GAAM,MAAM,IAAI3Z,WAAW,oCAC1C,OAAIoU,EAAS7xC,GACJ48C,EAAO0c,EAAWt5D,EAAIk+C,UAAW9G,IAEjCkiB,EAAWt5D,EAAKo3C,IAG3B,4BAA6B,SAAUp3C,EAAKo3C,GAC1C,OAAO7pD,KAAKyS,EAAK4Q,EAAOwmC,OAY5B,SAASkiB,EAAYt5D,EAAKo3C,GAIxB,GAHIvF,EAAS7xC,KACXA,EAAMA,EAAIk+C,YAEPzgD,MAAMP,QAAQ8C,GACjB,MAAMy9B,WAAW,mDAEnB,GAAI2Z,EAAM,EAAG,CACX,IAAM5+C,EAAS,GAIf,OAHAwH,EAAIxO,SAAQ,SAAA8zC,GACV9sC,EAAOwQ,KAAKswD,EAAWh0B,EAAS8R,EAAM,OAEjC5+C,EACF,GAAY,IAAR4+C,EACT,OAAOiiB,EAAMr5D,GAEb,MAAMy9B,WAAW,kCAUrB,SAAS47B,EAAOr5D,GACd,IAAMxH,EAAS,GACTykC,EAAOj9B,EAAI5O,OACjB,GAAI6rC,EAAO,EACT,OAAOj9B,EAET,IAAK,IAAIrS,EAAI,EAAGA,EAAIsvC,EAAMtvC,IACxB6K,EAAOwQ,KAAKuwD,EAAav5D,EAAIrS,EAAI,GAAIqS,EAAIrS,KAE3C,OAAO6K,EAUT,SAAS+gE,EAAcC,EAAMC,GAEvB5nB,EAAS2nB,KAAOA,EAAOA,EAAKtb,WAC5BrM,EAAS4nB,KAAOA,EAAOA,EAAKvb,WAEhC,IAAMwb,EAAcj8D,MAAMP,QAAQs8D,GAC5BG,EAAcl8D,MAAMP,QAAQu8D,GAClC,GAAIC,GAAeC,EACjB,OAeJ,SAAqBC,EAAMz2B,GACzB,GAAIy2B,EAAKxoE,SAAW+xC,EAAK/xC,OACvB,MAAMqsC,WAAW,2CAInB,IAFA,IAAMjlC,EAAS,GACTykC,EAAO28B,EAAKxoE,OACTzD,EAAI,EAAGA,EAAIsvC,EAAMtvC,IACxB6K,EAAOwQ,KAAKuwD,EAAaK,EAAKjsE,GAAIw1C,EAAKx1C,KAEzC,OAAO6K,EAxBEqhE,CAAWL,EAAMC,GAE1B,IAAKC,IAAgBC,EACnB,OAAO59C,EAAS09C,EAAMD,GAExB,MAAM3iE,UAAU,mECrIPijE,GAA6B5sE,GAH7B,OACQ,CAAC,QAAS,SAAU,SAAU,cAEmB,YAA0C,IAAvCmiC,EAAuC,EAAvCA,MAAO7Q,EAAgC,EAAhCA,OAAQo+B,EAAwB,EAAxBA,OAAQN,EAAgB,EAAhBA,UAkC9F,OAAOjtB,EAAM,OAAQ,CACnB,GAAI,WACF,MAA0B,UAAlB7Q,EAAOo+B,OACXmd,EAAM,IACNA,EAAM,GAAI,YAKhB,iCAAkC,SAAU98B,GAE1C,GAAoB,iBADPA,EAAKA,EAAK7rC,OAAS,GACF,CAC5B,IAAM8iD,EAASjX,EAAK/jB,MACpB,OAAO6gD,EAAM98B,EAAMiX,GACd,MAAsB,UAAlB11B,EAAOo+B,OACTmd,EAAM98B,GAEN88B,EAAM98B,EAAM,YAIvBx/B,MAAOs8D,EAEP3b,OAAQ,SAAUnhB,GAChB,IAAMiX,EAASjX,EAAKohB,UACpB,OAAO0b,EAAM98B,EAAKhyB,UAAWipC,IAG/B,yBAA0B,SAAUjX,EAAMiX,GACxC,OAAO6lB,EAAM98B,EAAKhyB,UAAWipC,MAWjC,SAAS6lB,EAAO98B,EAAMiX,GACpB,IACMuD,EAqBR,SAAqBxa,GACnB,IAAI+8B,GAAgB,EAOpB,OANA/8B,EAAKzrC,SAAQ,SAAU5C,EAAOuM,EAAO6E,GAC/BwxC,EAAY5iD,KACdorE,GAAgB,EAChBh6D,EAAI7E,GAASvM,EAAMkT,eAGhBk4D,EA9Be/K,CAAWhyB,GACI,IAAIqf,EAAU,GAAK,EAGxD,GA8BF,SAAoBrf,GAClBA,EAAKzrC,SAAQ,SAAU5C,GACrB,GAAqB,iBAAVA,IAAuBmpB,EAAUnpB,IAAUA,EAAQ,EAC5D,MAAM,IAAIuc,MAAM,4DAnCpBgsC,CAAUla,GAENiX,EAAQ,CAEV,IAAMnmD,EAAI6uD,EAAO1I,GACjB,OAAIjX,EAAK7rC,OAAS,EACTrD,EAAEypD,OAAOva,EAAMwa,GAEjB1pD,EAGP,IAAMiS,EAAM,GACZ,OAAIi9B,EAAK7rC,OAAS,EACTomD,GAAOx3C,EAAKi9B,EAAMwa,GAEpBz3C,MCnGN,SAASi6D,KACd,MAAM,IAAI9uD,MAAM,2CAGX,SAAS+uD,KACd,MAAM,IAAI/uD,MAAM,0CAGX,SAASgvD,KACd,MAAM,IAAIhvD,MAAM,wCCPlB,IAGaivD,GAA8BltE,GAH9B,QACQ,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,aAE7B,YAAgF,IAA7EmiC,EAA6E,EAA7EA,MAAO7Q,EAAsE,EAAtEA,OAAQo+B,EAA8D,EAA9DA,OAAQyd,EAAsD,EAAtDA,UAAWhI,EAA2C,EAA3CA,QAASiI,EAAkC,EAAlCA,UAAWC,EAAuB,EAAvBA,OAAQC,EAAe,EAAfA,SA4CtI,OAAOnrC,EA/CI,QA+CQ,CAIjBhlB,OAAQowD,EACR,kBAAmBA,EAEnB,iBAAkB,SAAU78D,EAAOC,GACjC,OAAO68D,EAAKC,EAAS/8D,EAAOC,EAAK,KAEnC,yBAA0B,SAAUD,EAAOC,EAAKmwB,GAC9C,OAAO0sC,EAAKC,EAAS/8D,EAAOC,EAAKmwB,KAEnC,0BAA2B,SAAUpwB,EAAOC,EAAK+8D,GAC/C,OACIF,EADGE,EACEC,EAAUj9D,EAAOC,EAAK,GACtB88D,EAAS/8D,EAAOC,EAAK,KAEhC,kCAAmC,SAAUD,EAAOC,EAAKmwB,EAAM4sC,GAC7D,OACIF,EADGE,EACEC,EAAUj9D,EAAOC,EAAKmwB,GACtB2sC,EAAS/8D,EAAOC,EAAKmwB,KAGhC,uBAAwB,SAAUpwB,EAAOC,GAGvC,OAAO68D,EAAKI,EAAYl9D,EAAOC,EAAK,IAAIy+C,EAFtB1+C,EAAMlN,aAE0B,MAEpD,kCAAmC,SAAUkN,EAAOC,EAAKmwB,GACvD,OAAO0sC,EAAKI,EAAYl9D,EAAOC,EAAKmwB,KAEtC,gCAAiC,SAAUpwB,EAAOC,EAAK+8D,GACrD,IAAMte,EAAY1+C,EAAMlN,YAExB,OACIgqE,EADGE,EACEG,EAAan9D,EAAOC,EAAK,IAAIy+C,EAAU,IACvCwe,EAAYl9D,EAAOC,EAAK,IAAIy+C,EAAU,MAEjD,2CAA4C,SAAU1+C,EAAOC,EAAKmwB,EAAM4sC,GACtE,OACIF,EADGE,EACEG,EAAan9D,EAAOC,EAAKmwB,GACzB8sC,EAAYl9D,EAAOC,EAAKmwB,OAKrC,SAAS0sC,EAAM16D,GACb,MAAsB,WAAlBwe,EAAOo+B,OACFA,EAASA,EAAO58C,GAAOm6D,KAGzBn6D,EAGT,SAASy6D,EAAW1sD,EAAK6sD,GACvB,IAAMnsE,EAyIR,SAAiBsf,GACf,IAGMkwC,EAHOlwC,EAAItL,MAAM,KAGL5R,KAAI,SAAU8N,GAE9B,OAAOsF,OAAOtF,MAMhB,GAHgBs/C,EAAK12B,MAAK,SAAU3O,GAClC,OAAOnU,MAAMmU,MAGb,OAAO,KAGT,OAAQqlC,EAAK7sD,QACX,KAAK,EACH,MAAO,CACLwM,MAAOqgD,EAAK,GACZpgD,IAAKogD,EAAK,GACVjwB,KAAM,GAGV,KAAK,EACH,MAAO,CACLpwB,MAAOqgD,EAAK,GACZpgD,IAAKogD,EAAK,GACVjwB,KAAMiwB,EAAK,IAGf,QACE,OAAO,MAzKD+c,CAAOjtD,GACjB,IAAKtf,EACH,MAAM,IAAI6U,YAAY,WAAayK,EAAM,uBAI3C,MAAsB,cAAlByQ,EAAO5N,aACSvf,IAAdgpE,GACFJ,KAIKS,GADFE,EAAaG,EAAeD,GAE/BT,EAAU5rE,EAAEmP,OACZy8D,EAAU5rE,EAAEoP,KACZw8D,EAAU5rE,EAAEu/B,SAGP0sC,GADFE,EAAaC,EAAYF,GACflsE,EAAEmP,MAAOnP,EAAEoP,IAAKpP,EAAEu/B,OAYrC,SAAS2sC,EAAU/8D,EAAOC,EAAKmwB,GAC7B,IAAM1vB,EAAQ,GACVxD,EAAI8C,EACR,GAAIowB,EAAO,EACT,KAAOqkC,EAAQv3D,EAAG+C,IAChBS,EAAM0K,KAAKlO,GACXA,GAAKkzB,OAEF,GAAIA,EAAO,EAChB,KAAOusC,EAAOz/D,EAAG+C,IACfS,EAAM0K,KAAKlO,GACXA,GAAKkzB,EAIT,OAAO1vB,EAWT,SAASu8D,EAAWj9D,EAAOC,EAAKmwB,GAC9B,IAAM1vB,EAAQ,GACVxD,EAAI8C,EACR,GAAIowB,EAAO,EACT,KAAOssC,EAAUx/D,EAAG+C,IAClBS,EAAM0K,KAAKlO,GACXA,GAAKkzB,OAEF,GAAIA,EAAO,EAChB,KAAOwsC,EAAS1/D,EAAG+C,IACjBS,EAAM0K,KAAKlO,GACXA,GAAKkzB,EAIT,OAAO1vB,EAWT,SAASw8D,EAAal9D,EAAOC,EAAKmwB,GAChC,IAAM+1B,EAAOsW,EAAU,GACjB/7D,EAAQ,GACVxD,EAAI8C,EACR,GAAIowB,EAAKha,GAAG+vC,GACV,KAAOsO,EAAQv3D,EAAG+C,IAChBS,EAAM0K,KAAKlO,GACXA,EAAIA,EAAEyJ,KAAKypB,QAER,GAAIA,EAAK3V,GAAG0rC,GACjB,KAAOwW,EAAOz/D,EAAG+C,IACfS,EAAM0K,KAAKlO,GACXA,EAAIA,EAAEyJ,KAAKypB,GAIf,OAAO1vB,EAWT,SAASy8D,EAAcn9D,EAAOC,EAAKmwB,GACjC,IAAM+1B,EAAOsW,EAAU,GACjB/7D,EAAQ,GACVxD,EAAI8C,EACR,GAAIowB,EAAKha,GAAG+vC,GACV,KAAOuW,EAAUx/D,EAAG+C,IAClBS,EAAM0K,KAAKlO,GACXA,EAAIA,EAAEyJ,KAAKypB,QAER,GAAIA,EAAK3V,GAAG0rC,GACjB,KAAOyW,EAAS1/D,EAAG+C,IACjBS,EAAM0K,KAAKlO,GACXA,EAAIA,EAAEyJ,KAAKypB,GAIf,OAAO1vB,MCjOE28D,GAAgC/tE,GAHhC,UACQ,CAAC,QAAS,YAAa,WAE6B,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOtX,EAAgB,EAAhBA,UAyCjF,OAAOsX,EA5CI,UA4CQ,CAEjB,gBAAiB,SAAUv0B,EAAGi9C,GAC5B,OAAOj9C,EAAEg9C,QAAQC,IAGnB,eAAgB,SAAUj9C,EAAGi9C,GAM3B,OALAA,EAAMvmD,SAAQ,SAAUyrC,GACtB,IAAKllB,EAAUklB,GACb,MAAM,IAAIpmC,UAAU,+BAAiComC,MAGlDi+B,GAAapgE,EAAGi9C,SClDtB,SAASojB,GAAgBjnE,EAAIgqC,EAAOz9B,EAAK/C,GAC9C,KAAMnQ,gBAAgB4tE,IACpB,MAAM,IAAI73D,YAAY,oDAGxB/V,KAAK2G,GAAKA,EACV3G,KAAK2wC,MAAQA,EACb3wC,KAAKkT,IAAMA,EACXlT,KAAKmQ,IAAMA,EAEXnQ,KAAKupD,QAAU,yCAA2C5iD,EACtD,KAAOgqC,EAAQ,cACfz9B,GAAQ/C,QAAsC,IAAMA,EAAO,IAAM,aAErEnQ,KAAKwpD,OAAS,IAAI5rC,OAAS4rC,MAG7BokB,GAAe5rE,UAAY,IAAI4b,MAC/BgwD,GAAe5rE,UAAUmB,YAAcya,MACvCgwD,GAAe5rE,UAAUrB,KAAO,iBAChCitE,GAAe5rE,UAAU6rE,kBAAmB,ECpB5C,IAGaC,GAA+BnuE,GAH/B,SACQ,CAAC,SAAU,WAEwC,YAAwB,IAArBsxB,EAAqB,EAArBA,OAAQo+B,EAAa,EAAbA,OA4BjF,OAAO,SAAiB9hD,EAAGmiC,EAAMwa,GAC/B,GAAyB,IAArBtmD,UAAUC,QAAqC,IAArBD,UAAUC,OACtC,MAAM,IAAI+pE,GAAe,SAAUhqE,UAAUC,OAAQ,EAAG,GAe1D,GAZIygD,EAAS5U,KACXA,EAAOA,EAAKhyB,WAGVumC,EAAYvU,EAAK,MAEnBA,EAAOA,EAAKpsC,KAAI,SAAUjC,GACxB,OAAQ4iD,EAAY5iD,GAAiBA,EAAMkT,WAAdlT,MAK7BijD,EAAS/2C,GAEX,OAAOA,EAAE08C,OAAOva,EAAMwa,GAAc,GAGtC,GAAiB,iBAAN38C,EAET,OAAOwgE,EAAcxgE,EAAGmiC,EAAMwa,GAIhC,IAAMue,GAAWv4D,MAAMP,QAAQpC,IAAgC,UAAlB0jB,EAAOo+B,OAEpD,GAAoB,IAAhB3f,EAAK7rC,OAAc,CAErB,KAAOqM,MAAMP,QAAQpC,IACnBA,EAAIA,EAAE,GAGR,OAAOukB,GAAMvkB,GAGR2C,MAAMP,QAAQpC,KACjBA,EAAI,CAACA,IAIP,IAAMgL,EAAMy1D,GAFZzgE,EAAIukB,GAAMvkB,GAEiBmiC,EAAMwa,GACjC,OAAOue,EAAWpZ,EAAO92C,GAAOA,GAWpC,SAASw1D,EAAevtD,EAAKkvB,EAAMu+B,GACjC,QAAoBnqE,IAAhBmqE,GACF,GAA2B,iBAAhBA,GAAmD,IAAvBA,EAAYpqE,OACjD,MAAM,IAAIyF,UAAU,kDAGtB2kE,EAAc,IAGhB,GAAoB,IAAhBv+B,EAAK7rC,OACP,MAAM,IAAIwlD,GAAe3Z,EAAK7rC,OAAQ,GAExC,IAAMwN,EAAMq+B,EAAK,GACjB,GAAmB,iBAARr+B,IAAqBmZ,EAAUnZ,GACxC,MAAM,IAAI/H,UAAU,uDACJq9C,GAAOjX,GAAQ,KAGjC,GAAIlvB,EAAI3c,OAASwN,EACf,OAAOmP,EAAIiQ,UAAU,EAAGpf,GACnB,GAAImP,EAAI3c,OAASwN,EAAK,CAE3B,IADA,IAAIkH,EAAMiI,EACDpgB,EAAI,EAAGgnC,EAAK/1B,EAAMmP,EAAI3c,OAAQzD,EAAIgnC,EAAIhnC,IAC7CmY,GAAO01D,EAET,OAAO11D,EAEP,OAAOiI,MCjHA0tD,GAA+BvuE,GAP/B,SACQ,CACnB,QACA,WACA,mBAGsE,YAGhE,IADJmiC,EACI,EADJA,MAAOwO,EACH,EADGA,SAAU69B,EACb,EADaA,eA8BnB,OAAOrsC,EAvCI,SAuCQ,CACjB,8CAA+C,SAAUzc,EAAG+oD,GAG1D,OAFAC,EAAchpD,EAAG,GACCirB,EAAS69B,EAAeC,GAAQ/oD,GACjCsrC,WAGnB,+CAAgD,SAAUtrC,EAAG+oD,GAE3D,OADAC,EAAchpD,EAAG,GACVirB,EAAS69B,EAAeC,GAAQ/oD,IAGzC,6DAA8D,SAAUA,EAAG+oD,EAAO3vD,GAGhF,OAFA4vD,EAAchpD,EAAG,GACCirB,EAAS69B,EAAeC,EAAO3vD,GAAI4G,IAIvD,8DAA+D,SAAUA,EAAG+oD,EAAO3vD,GAEjF,OADA4vD,EAAchpD,EAAG,GACVirB,EAAS69B,EAAeC,EAAO3vD,GAAI4G,MAI9C,SAASgpD,EAAe5vD,EAAG6vD,GACzB,IAAMC,EAAar+D,MAAMP,QAAQ8O,GAAKirC,GAAUjrC,GAAKA,EAAEixB,OACvD,GAAI6+B,EAAW1qE,OAAS,EACtB,MAAM,IAAIqsC,WAAJ,yCAAiDo+B,IAEzD,GAA0B,IAAtBC,EAAW1qE,QAAkC,IAAlB0qE,EAAW,GACxC,MAAM,IAAIr+B,WAAJ,yCAAiDo+B,IAEzD,GAAIC,EAAW,KAAOD,EACpB,MAAM,IAAIp+B,WAAJ,yCAAiDo+B,QCxDhDE,GAAuC7uE,GAhBvC,iBACQ,CACnB,QACA,SACA,iBACA,YACA,aACA,OACA,SACA,YACA,cACA,eACA,MACA,QAG8E,YAKxE,IAHJmiC,EAGI,EAHJA,MAAO7Q,EAGH,EAHGA,OAAQ4wC,EAGX,EAHWA,eACfD,EAEI,EAFJA,UAAW3E,EAEP,EAFOA,WAAYwR,EAEnB,EAFmBA,KAAM1f,EAEzB,EAFyBA,UAC7BM,EACI,EADJA,OAAQL,EACJ,EADIA,YAAaoH,EACjB,EADiBA,aAAcx/C,EAC/B,EAD+BA,IAAKC,EACpC,EADoCA,IAmC1C,OAAOirB,EAvDI,iBAuDQ,CACjB,GAAI,WACF,MAA0B,WAAlB7Q,EAAOo+B,OAAuBA,EAAO,IAAM,IAGrDvyC,OAAQ,SAAU6pC,GAChB,OAAO0I,EAAO1I,IAGhB,sCAAuC,SAAUynB,GAC/C,OAAOM,EAAmBN,EAAyB,WAAlBn9C,EAAOo+B,OAAsB,aAAUvrD,IAG1E,8CAA+C,SAAUsqE,EAAOznB,GAC9D,OAAO+nB,EAAmBN,EAAOznB,IAGnC,6CAA8C,SAAUynB,EAAO3vD,GAC7D,IAAMkwD,EAAUtf,EAAO5wC,GAEvB,OADAmwD,EAAgBD,GACTE,EAAmBT,EAAOO,OAAS7qE,IAG5C,8CAA+C,SAAUsqE,EAAO3vD,GAC9DmwD,EAAgBnwD,GAChB,IAAMqwD,EAAcrwD,EAAEqyC,YAAgC,WAAlB7/B,EAAOo+B,OAAsB,aAAUvrD,GAC3E,OAAO+qE,EAAmBT,EAAO3vD,EAAGqwD,IAGtC,qDAAsD,SAAUV,EAAO3vD,EAAGkoC,GACxE,IAAMgoB,EAAUtf,EAAO5wC,GAEvB,OADAmwD,EAAgBD,GACTE,EAAmBT,EAAOO,EAAShoB,IAG5C,sDAAuD,SAAUynB,EAAO3vD,EAAGkoC,GAEzE,OADAioB,EAAgBnwD,GACTowD,EAAmBT,EAAO3vD,EAAGkoC,MAaxC,SAAS+nB,EAAoBN,EAAOznB,GAClC,IAEMooB,EAFM9qB,EAAYmqB,GAED,IAAIrf,GAAW,IAAM,EACtCigB,EAAWp4D,EAAIw3D,GACfa,EAAWp4D,EAAIu3D,GAGrB,OAAOc,EAFM,CAAC,CAACF,EAAUnN,EAAekN,EAAUE,IAAY,CAACA,EAAUD,IAE3CroB,GAGhC,SAASioB,EAAiBnwD,GACxB,IAAMixB,EAAOjxB,EAAEixB,OACf,GAAIA,EAAK7rC,OAAS,GAAiB,IAAZ6rC,EAAK,GAC1B,MAAM,IAAIQ,WAAW,oCAIzB,SAASi/B,EAAMp+D,GACb,OAAOA,EAAMq6C,QAAO,SAAClpD,EAAGmpD,GAAJ,OAAawW,EAAe3/D,EAAGmpD,MAGrD,SAAS6jB,EAAkBj2C,EAAM0tB,GAC/B,GAAIA,EAAQ,CACV,GAAe,WAAXA,EACF,OAAO,IAAIyP,EAAan9B,GAE1B,GAAe,UAAX0tB,EACF,OAAO,IAAIqI,EAAY/1B,GAEzB,MAAM,IAAI3vB,UAAJ,+BAAsCq9C,EAAtC,MAER,OAAO1tB,EAYT,SAAS41C,EAAoBT,EAAO3vD,EAAGkoC,GACrC,IAAMyoB,EAAQX,EAAKhwD,GACnB,GAAc,IAAV2wD,EACF,MAAM,IAAIl/B,WAAW,+BAGvB,IAAM8zB,EAAM/f,EAAYmqB,GAASrf,EAAY,KAEvChmC,EAAMi7C,EAAM,IAAIA,EAAI,GAAK,EACzB+K,EAAW/K,EAAM,IAAIA,GAAK,IAAM,EAChCpL,EAAKoL,EAAM,IAAIA,EAAIvlD,EAAExd,IAAI,CAAC,IAAMmuE,GAAS3wD,EAAExd,IAAI,CAAC,IAAMmuE,EACtDvW,EAAKmL,EAAM,IAAIA,EAAIvlD,EAAExd,IAAI,CAAC,IAAMmuE,GAAS3wD,EAAExd,IAAI,CAAC,IAAMmuE,EACtDC,EAAKrL,EAAM,IAAIA,EAAIvlD,EAAExd,IAAI,CAAC,IAAMmuE,GAAS3wD,EAAExd,IAAI,CAAC,IAAMmuE,EACtD3uE,EAAImW,EAAIw3D,GACRkB,EAAY1N,EAAU74C,EAAKk0C,EAAWx8D,IACtC0B,EAAI0U,EAAIu3D,GAgBd,OAAOc,EAFM,CAAC,CAZFtN,EAAUnhE,EAAG0uE,EAAK,CAACvW,EAAIA,EAAI0W,KAC3B1N,EAAUuN,EAAK,CAACvW,EAAIC,EAAIyW,IAAaH,EAAK,CAACJ,EAAUM,EAAIltE,KACzDy/D,EAAUuN,EAAK,CAACvW,EAAIyW,EAAIC,IAAaH,EAAK,CAACtW,EAAI12D,MAU5B,CARnBy/D,EAAUuN,EAAK,CAACvW,EAAIC,EAAIyW,IAAaH,EAAK,CAACE,EAAIltE,KAC/Cy/D,EAAUnhE,EAAG0uE,EAAK,CAACtW,EAAIA,EAAIyW,KAC3B1N,EAAUuN,EAAK,CAACtW,EAAIwW,EAAIC,IAAaH,EAAK,CAACJ,EAAUnW,EAAIz2D,MAMrB,CAJpCy/D,EAAUuN,EAAK,CAACvW,EAAIyW,EAAIC,IAAaH,EAAK,CAACJ,EAAUlW,EAAI12D,KACzDy/D,EAAUuN,EAAK,CAACtW,EAAIwW,EAAIC,IAAaH,EAAK,CAACvW,EAAIz2D,KAC/Cy/D,EAAUnhE,EAAG0uE,EAAK,CAACE,EAAIA,EAAIC,OAIT3oB,OChLrB4oB,GAA4B5vE,GAH5B,MACQ,CAAC,QAAS,QAAS,SAAU,UAEmB,YAAqC,IAAlCmiC,EAAkC,EAAlCA,MAAOgnC,EAA2B,EAA3BA,MAAOzZ,EAAoB,EAApBA,OAAQqC,EAAY,EAAZA,MAsB5F,OAAO5vB,EAzBI,MAyBQ,CACjB,iBAAkB0tC,EAElB,gBAAiB,SAAUnuE,EAAOuxD,GAChC,OAAO4c,EAAKngB,EAAOv9B,GAAMzwB,IAASuxD,GAAKl1C,aAU3C,SAAS8xD,EAAMnuE,EAAOuxD,GAEpB,GAA4B,IAAxBvxD,EAAMquC,OAAO7rC,OACf,MAAM,IAAI+Z,MAAM,4CAGlBosC,GAAc4I,EAAKvxD,EAAMquC,OAAO,IAEhC,IAAM+/B,EAAc/d,EAAM,EAAGrwD,EAAMquC,OAAO,IACpC9hC,EAAQ,IAAIk7D,EAAMlW,EAAK6c,GAC7B,OAAOpuE,EAAM2vD,OAAOpjD,OC9CX8hE,GAA6B/vE,GAH7B,OACQ,CAAC,QAAS,SAAU,YAE6B,YAA+B,IAA5BmiC,EAA4B,EAA5BA,MAAO7Q,EAAqB,EAArBA,OAAQo+B,EAAa,EAAbA,OAwBtF,OAAOvtB,EA3BI,OA2BQ,CACjB+uB,OAAQ,SAAUtjD,GAChB,OAAOA,EAAE7L,OAAO6L,EAAEmiC,SAGpBx/B,MAAOw5C,GAEP5sC,OAAQ,SAAUvP,GAChB,MAA0B,UAAlB0jB,EAAOo+B,OAAsB,CAAC9hD,EAAE1J,QAAUwrD,EAAO,CAAC9hD,EAAE1J,UAG9D,uDAAwD,SAAU0J,GAEhE,MAA0B,UAAlB0jB,EAAOo+B,OACX,GACAA,EAASA,EAAO,IAAMud,WCvCnB+C,GAAgChwE,GAHhC,UACQ,CAAC,QAAS,WAE0C,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOutB,EAAa,EAAbA,OA8BjF,OAAOvtB,EAjCI,UAiCQ,CACjB5xB,MAAO,SAAU3C,GACf,OAAOqiE,GAAa99C,GAAMvkB,KAG5BsjD,OAAQ,SAAUtjD,GAChB,IAAMgL,EAAMq3D,GAAariE,EAAEojD,WAE3B,OAAOzgD,MAAMP,QAAQ4I,GAAO82C,EAAO92C,GAAOA,GAG5Cg7C,IAAK,SAAUhmD,GAEb,OAAOukB,GAAMvkB,SCxCNsiE,GAA+BlwE,GAH/B,SACQ,CAAC,QAAS,WAEyC,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOutB,EAAa,EAAbA,OA6ChF,OAAOvtB,EAhDI,SAgDQ,CAEjB,eAAgB,SAAUzgC,EAAOuM,GAC/B,IACMojD,EADI3B,EAAOhuD,GACA2vD,OAAOpjD,GACxB,OAAOA,EAAM4jD,WACTR,EACAA,EAAOtzC,WAGb,gBAAiB,SAAUrc,EAAOuM,GAChC,OAAOvM,EAAM2vD,OAAOpjD,IAGtB,gBAAiBkiE,GAEjB,gBAAiBC,GAGjB,oBAAqB,SAAU1uE,EAAOuM,EAAOqqB,GAC3C,OAAOo3B,EAAOv9B,GAAMzwB,IACjB2vD,OAAOpjD,EAAOqqB,OAAan0B,GAC3B4Z,WAGL,yBAA0B,SAAUrc,EAAOuM,EAAOqqB,EAAaiyB,GAC7D,OAAOmF,EAAOv9B,GAAMzwB,IACjB2vD,OAAOpjD,EAAOqqB,EAAaiyB,GAC3BxsC,WAGL,qBAAsB,SAAUrc,EAAOuM,EAAOqqB,GAC5C,OAAO52B,EAAMywB,QAAQk/B,OAAOpjD,EAAOqqB,IAGrC,0BAA2B,SAAU52B,EAAOuM,EAAOqqB,EAAaiyB,GAC9D,OAAO7oD,EAAMywB,QAAQk/B,OAAOpjD,EAAOqqB,EAAaiyB,IAGlD,wBAAyB8lB,GACzB,gCAAiCA,GACjC,qBAAsBC,QAW1B,SAASF,GAAevvD,EAAK5S,GAC3B,IAAK+2C,EAAQ/2C,GAEX,MAAM,IAAItE,UAAU,kBAEtB,GAA4B,IAAxBsE,EAAM8hC,OAAO7rC,OACf,MAAM,IAAIwlD,GAAez7C,EAAM8hC,OAAO7rC,OAAQ,GAIhD,IAAMqsE,EAAS1vD,EAAI3c,OACnBmmD,GAAcp8C,EAAMsF,MAAM,GAAIg9D,GAC9BlmB,GAAcp8C,EAAMuC,MAAM,GAAI+/D,GAE9B,IAAMxe,EAAQ9jD,EAAM+jD,UAAU,GAE1Bwe,EAAS,GAKb,OAJAze,EAAMztD,SAAQ,SAAUwa,GACtB0xD,GAAU3vD,EAAI9B,OAAOD,MAGhB0xD,EAaT,SAASH,GAAexvD,EAAK5S,EAAOqqB,EAAaiyB,GAC/C,IAAKt8C,IAA2B,IAAlBA,EAAM+2C,QAElB,MAAM,IAAIr7C,UAAU,kBAEtB,GAA4B,IAAxBsE,EAAM8hC,OAAO7rC,OACf,MAAM,IAAIwlD,GAAez7C,EAAM8hC,OAAO7rC,OAAQ,GAEhD,QAAqBC,IAAjBomD,GACF,GAA4B,iBAAjBA,GAAqD,IAAxBA,EAAarmD,OACnD,MAAM,IAAIyF,UAAU,kDAGtB4gD,EAAe,IAGjB,IAAMwH,EAAQ9jD,EAAM+jD,UAAU,GAG9B,GAFYD,EAAMhiB,OAAO,KAEbzX,EAAYp0B,OACtB,MAAM,IAAIwlD,GAAeqI,EAAMhiB,OAAO,GAAIzX,EAAYp0B,QAIxD,IAAMqsE,EAAS1vD,EAAI3c,OACnBmmD,GAAcp8C,EAAMsF,MAAM,IAC1B82C,GAAcp8C,EAAMuC,MAAM,IAI1B,IADA,IAAMigE,EAAQ,GACLhwE,EAAI,EAAGA,EAAI8vE,EAAQ9vE,IAC1BgwE,EAAMhwE,GAAKogB,EAAI9B,OAAOte,GAQxB,GALAsxD,EAAMztD,SAAQ,SAAUwa,EAAGre,GACzBgwE,EAAM3xD,GAAKwZ,EAAYvZ,OAAOte,EAAE,OAI9BgwE,EAAMvsE,OAASqsE,EACjB,IAAK,IAAI9vE,EAAI8vE,EAAS,EAAG7+D,EAAM++D,EAAMvsE,OAAQzD,EAAIiR,EAAKjR,IAC/CgwE,EAAMhwE,KACTgwE,EAAMhwE,GAAK8pD,GAKjB,OAAOkmB,EAAMxhE,KAAK,IAUpB,SAASkhE,GAAoBhuE,EAAQ8L,GACnC,GAA4B,IAAxBA,EAAM8hC,OAAO7rC,OACf,MAAM,IAAIwlD,GAAez7C,EAAM8hC,OAAQ,GAGzC,IAAM/tC,EAAMiM,EAAM+jD,UAAU,GAC5B,GAAmB,iBAARhwD,EACT,MAAM,IAAI2H,UAAU,2DAGtB,OAAOskD,GAAgB9rD,EAAQH,GAWjC,SAASsuE,GAAoBnuE,EAAQ8L,EAAOqqB,GAC1C,GAA4B,IAAxBrqB,EAAM8hC,OAAO7rC,OACf,MAAM,IAAIwlD,GAAez7C,EAAM8hC,OAAQ,GAGzC,IAAM/tC,EAAMiM,EAAM+jD,UAAU,GAC5B,GAAmB,iBAARhwD,EACT,MAAM,IAAI2H,UAAU,2DAItB,IAAM+mE,EAAUv+C,GAAMhwB,GAGtB,OAFAksD,GAAgBqiB,EAAS1uE,EAAKs2B,GAEvBo4C,ECrOT,IAGaC,GAAkC3wE,GAHlC,YACQ,CAAC,QAAS,WAE4C,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOutB,EAAa,EAAbA,OAuBnF,OAAOvtB,EAAM,YAAa,CAExB5xB,MAAO,SAAU3C,GAEf,OAAOvN,KAAKqvD,EAAO9hD,IAAImQ,WAGzBmzC,OAAQ,SAAUtjD,GAEhB,IAGI9M,EAHEivC,EAAOniC,EAAEmiC,OAMf,OAAQA,EAAK7rC,QACX,KAAK,EAEHpD,EAAI8M,EAAEukB,QACN,MAEF,KAAK,EAGD,IAAM6gC,EAAOjjB,EAAK,GACZmjB,EAAUnjB,EAAK,GAGrB,GAAgB,IAAZmjB,EAEF,MAAM,IAAI3iB,WAAW,uDAAyDyW,GAAOjX,GAAQ,KAI/F,OAAQniC,EAAEujD,WACR,IAAK,QACHrwD,EAsBd,SAA0BD,EAAGmyD,EAAME,GAOjC,IALA,IAGI0d,EAHEt3C,EAAOz4B,EAAE2wD,MAETqf,EAAa,GAGVr7D,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhCo7D,EAAgBC,EAAWr7D,GAAK,GAEhC,IAAK,IAAI/U,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAExBmwE,EAAcnwE,GAAK0xB,GAAMmH,EAAK74B,GAAG+U,IAIrC,OAAO3U,EAAE8xD,kBAAkB,CACzBr5B,KAAMu3C,EACN9gC,KAAM,CAACmjB,EAASF,GAChB5B,SAAUvwD,EAAE6wD,YA1CEof,CAAgBljE,EAAGolD,EAAME,GAC7B,MACF,IAAK,SACHpyD,EA2Cd,SAA2BD,EAAGmyD,EAAME,GAWlC,IATA,IAWI3wD,EAAG7B,EAAG8U,EAXJ1H,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KAER8I,EAAUlwD,EAAS,QAAK3J,EACxBqwD,EAAS,GACTyJ,EAAO,GAEPv4C,EAAI,GACD9X,EAAI,EAAGA,EAAIolD,EAAMplD,IAAO8X,EAAE9X,GAAK,EAIxC,IAAKrL,EAAI,EAAG7B,EAAIuN,EAAM/J,OAAQ3B,EAAI7B,EAAG6B,IAEnCmjB,EAAEzX,EAAM1L,MAKV,IAFA,IAAIiuB,EAAM,EAED/vB,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAExBw9D,EAAKniD,KAAK0U,GAEVA,GAAO9K,EAAEjlB,GAETilB,EAAEjlB,GAAKw9D,EAAKx9D,GAKd,IAFAw9D,EAAKniD,KAAK0U,GAELhb,EAAI,EAAGA,EAAI09C,EAAS19C,IAEvB,IAAK,IAAIm/C,EAAKiC,EAAIphD,GAAIo/C,EAAKgC,EAAIphD,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE1D,IAAM+R,EAAI6C,EAAEzX,EAAM6C,MAElB0jD,EAAO3xC,GAAKrN,EAER1H,IAAUkwD,EAAQn7C,GAAKsP,GAAMrkB,EAAOgD,KAI5C,OAAOjQ,EAAEq3D,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACmjB,EAASF,GAChB5B,SAAUvwD,EAAE6wD,YA7FEqf,CAAiBnjE,EAAGolD,EAAME,GAIpC,MAEF,QAEE,MAAM,IAAI3iB,WAAW,qDAAuDyW,GAAO3mD,KAAKoxD,OAAS,KAErG,OAAO3wD,GAIT8yD,IAAK,SAAUhmD,GACb,OAAOukB,GAAMvkB,SC/ENojE,GAAmChxE,GAHnC,aACQ,CAAC,QAAS,YAAa,SAEgC,YAAgC,IAA7BmiC,EAA6B,EAA7BA,MAAO8uC,EAAsB,EAAtBA,UAAWC,EAAW,EAAXA,KAuB/F,OAAO/uC,EA1BI,aA0BQ,CACjByxB,IAAK,SAAUhmD,GACb,OAAOsjE,EAAKD,EAAUrjE,UCtBfujE,GAA8BnxE,GAH9B,QACQ,CAAC,QAAS,SAAU,SAAU,cAEoB,YAA0C,IAAvCmiC,EAAuC,EAAvCA,MAAO7Q,EAAgC,EAAhCA,OAAQo+B,EAAwB,EAAxBA,OAAQN,EAAgB,EAAhBA,UAgC/F,OAAOjtB,EAnCI,QAmCQ,CACjB,GAAI,WACF,MAA0B,UAAlB7Q,EAAOo+B,OACX0hB,EAAO,IACPA,EAAO,GAAI,YAKjB,iCAAkC,SAAUrhC,GAE1C,GAAoB,iBADPA,EAAKA,EAAK7rC,OAAS,GACF,CAC5B,IAAM8iD,EAASjX,EAAK/jB,MACpB,OAAOolD,EAAOrhC,EAAMiX,GACf,MAAsB,UAAlB11B,EAAOo+B,OACT0hB,EAAOrhC,GAEPqhC,EAAOrhC,EAAM,YAIxBx/B,MAAO6gE,EAEPlgB,OAAQ,SAAUnhB,GAChB,IAAMiX,EAASjX,EAAKohB,UACpB,OAAOigB,EAAOrhC,EAAKhyB,UAAWipC,IAGhC,yBAA0B,SAAUjX,EAAMiX,GACxC,OAAOoqB,EAAOrhC,EAAKhyB,UAAWipC,MAWlC,SAASoqB,EAAQrhC,EAAMiX,GACrB,IACMuD,EAqBR,SAAqBxa,GACnB,IAAI+8B,GAAgB,EAOpB,OANA/8B,EAAKzrC,SAAQ,SAAU5C,EAAOuM,EAAO6E,GAC/BwxC,EAAY5iD,KACdorE,GAAgB,EAChBh6D,EAAI7E,GAASvM,EAAMkT,eAGhBk4D,EA9Be/K,CAAWhyB,GACI,IAAIqf,EAAU,GAAK,EAGxD,GA8BF,SAAoBrf,GAClBA,EAAKzrC,SAAQ,SAAU5C,GACrB,GAAqB,iBAAVA,IAAuBmpB,EAAUnpB,IAAUA,EAAQ,EAC5D,MAAM,IAAIuc,MAAM,6DAnCpBgsC,CAAUla,GAENiX,EAAQ,CAEV,IAAMnmD,EAAI6uD,EAAO1I,GACjB,OAAIjX,EAAK7rC,OAAS,EACTrD,EAAEypD,OAAOva,EAAMwa,GAEjB1pD,EAGP,IAAMiS,EAAM,GACZ,OAAIi9B,EAAK7rC,OAAS,EACTomD,GAAOx3C,EAAKi9B,EAAMwa,GAEpBz3C,MCvFAu+D,GAA4BrxE,GAL5B,MACQ,CACnB,UAGmE,YAyBnE,OAAOmiC,EAzB2E,EAAZA,OAyBzD,OAAQ,CACnBze,OAAQ,SAAU9V,GAChB,IAAMyK,EAAIvV,KAAK2T,IAAI7I,GAEnB,OAAIyK,GAAKi5D,GACA3hD,EAAK/hB,GAEVyK,GAAKk5D,GACA5hD,EAAK/hB,GAuBlB,SAAeyK,GACb,IAGI5X,EAHE+wE,EAAMn5D,EAAIA,EACZo5D,EAAOv/D,GAAE,GAAG,GAAKs/D,EACjBE,EAAOF,EAGX,IAAK/wE,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBgxE,GAAQA,EAAOv/D,GAAE,GAAGzR,IAAM+wE,EAC1BE,GAAQA,EAAOC,GAAE,GAAGlxE,IAAM+wE,EAE5B,OAAOn5D,GAAKo5D,EAAOv/D,GAAE,GAAG,KAAOw/D,EAAOC,GAAE,GAAG,IAjCtBC,CAAKv5D,GAEpBA,GAAK,EACAsX,EAAK/hB,IAAM,EAwCxB,SAAgByK,GACd,IAEI5X,EAFAgxE,EAAOv/D,GAAE,GAAG,GAAKmG,EACjBq5D,EAAOr5D,EAGX,IAAK5X,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBgxE,GAAQA,EAAOv/D,GAAE,GAAGzR,IAAM4X,EAC1Bq5D,GAAQA,EAAOC,GAAE,GAAGlxE,IAAM4X,EAE5B,IAAM/M,GAAUmmE,EAAOv/D,GAAE,GAAG,KAAOw/D,EAAOC,GAAE,GAAG,IACzCH,EAAMp8D,SAAa,GAAJiD,GAAU,GACzB+xD,GAAO/xD,EAAIm5D,IAAQn5D,EAAIm5D,GAC7B,OAAO1uE,KAAKmT,KAAKu7D,EAAMA,GAAO1uE,KAAKmT,KAAKm0D,GAAO9+D,EApDrBumE,CAAMx5D,IAEvBsX,EAAK/hB,IAAM,EA8DtB,SAAgByK,GACd,IAGI5X,EAHA+wE,EAAM,GAAKn5D,EAAIA,GACfo5D,EAAOv/D,GAAE,GAAG,GAAKs/D,EACjBE,EAAOF,EAGX,IAAK/wE,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBgxE,GAAQA,EAAOv/D,GAAE,GAAGzR,IAAM+wE,EAC1BE,GAAQA,EAAOC,GAAE,GAAGlxE,IAAM+wE,EAE5B,IAAIlmE,EAASkmE,GAAOC,EAAOv/D,GAAE,GAAG,KAAOw/D,EAAOC,GAAE,GAAG,IACnDrmE,GAAUwmE,GAAQxmE,GAAU+M,EAC5Bm5D,EAAMp8D,SAAa,GAAJiD,GAAU,GACzB,IAAM+xD,GAAO/xD,EAAIm5D,IAAQn5D,EAAIm5D,GAC7B,OAAO1uE,KAAKmT,KAAKu7D,EAAMA,GAAO1uE,KAAKmT,KAAKm0D,GAAO9+D,EA5EvBymE,CAAM15D,KAG9B,iBAAkB,SAAUnW,GAC1B,OAAOkyD,GAAQlyD,EAAG7B,YAgFlBkxE,GAAS,OAMTO,GAAQ,kBAOR5/D,GAAI,CAAC,CACT,mBAAwB,mBACxB,iBAAwB,mBACxB,oBACC,CACD,kBAAwB,kBACxB,kBAAwB,kBACxB,iBAAwB,mBACxB,mBAAwB,mBACxB,uBACC,CACD,mBAAwB,mBACxB,mBAAwB,oBACxB,qBAAwB,sBAQpBy/D,GAAI,CAAC,CACT,mBAAwB,mBACxB,mBAAwB,mBACvB,CACD,mBAAwB,kBACxB,kBAAwB,mBACxB,mBAAwB,kBACxB,mBAAwB,oBACvB,CACD,kBAAwB,mBACxB,kBAAwB,mBACxB,uBAQIL,GAAUxuE,KAAK4U,IAAI,EAAG,ICpLfs6D,GAA6BhyE,GAH7B,OACQ,CAAC,QAAS,QAAS,cAE8B,YAAiC,IAA9BmiC,EAA8B,EAA9BA,MAAO5qB,EAAuB,EAAvBA,MAAOs+C,EAAgB,EAAhBA,UA0BrF,OAAO1zB,EA7BI,OA6BQ,CACjB,iBAAkB8vC,EAElB,MAAO,SAAUp0D,GACf,OAAOo0D,EAAMp0D,MAUjB,SAASo0D,EAAOnkE,GAGd,GAAY,KAFZA,EAASi1C,GAAQj1C,EAAOiQ,YACL7Z,OAEjB,MAAM,IAAI+Z,MAAM,2CAMlB,IAHA,IAAM+yB,EAAQ,GACVpvC,EAAO,GACP4O,EAAM,EACD/P,EAAI,EAAGA,EAAIqN,EAAO5J,OAAQzD,IAAK,CACtC,IAAMiB,EAAQoM,EAAOrN,GAErB,GAAIo1D,EAAUn0D,IAAU6V,EAAM7V,GAC5B,MAAM,IAAIuc,MAAM,2DAGZvc,KAASsvC,IACbA,EAAMtvC,GAAS,GAGjBsvC,EAAMtvC,KAEFsvC,EAAMtvC,KAAW8O,EACnB5O,EAAKka,KAAKpa,GACDsvC,EAAMtvC,GAAS8O,IACxBA,EAAMwgC,EAAMtvC,GACZE,EAAO,CAACF,IAGZ,OAAOE,MChEJ,SAASswE,GAAqB/sC,EAAKgtC,EAAQzwE,GAEhD,IAAI0wE,EAEJ,OAAgD,IAA5C3nE,OAAO06B,GAAK5e,QAAQ,oBACtB6rD,EAAUnuE,UAAUC,OAAS,EACzB,WAAasiD,EAAO9kD,GAAS,YAAcg5D,KAAKh9C,UAAUhc,GAAS,IACnE,WAAayjC,EAAI7L,KAAKoM,OAAS,IAE5B,IAAI/7B,UAAU,oBAAsBwoE,EAAS,gCAAkCC,KAGxC,IAA5C3nE,OAAO06B,GAAK5e,QAAQ,oBACtB6rD,EAAUnuE,UAAUC,OAAS,EACzB,WAAasiD,EAAO9kD,GAAS,YAAcg5D,KAAKh9C,UAAUhc,GAAS,IACnE,GAEG,IAAIiI,UAAU,oBAAsBwoE,EAAS,wDAA0DC,IAGzGjtC,EC5BT,IAGaktC,GAA6BryE,GAH7B,OACQ,CAAC,QAAS,SAAU,iBAAkB,YAEW,YAAgD,IAA7CmiC,EAA6C,EAA7CA,MAAO7Q,EAAsC,EAAtCA,OAAQ4wC,EAA8B,EAA9BA,eAAgBoQ,EAAc,EAAdA,QA0BtG,OAAOnwC,EA7BI,OA6BQ,CAEjB,iBAAkBowC,EAGlB,qCAAsC,SAAUnhE,EAAO84C,GAErD,MAAM,IAAIjsC,MAAM,sCAKlB,MAAO,SAAUJ,GACf,OAAO00D,EAAM10D,MAUjB,SAAS00D,EAAOnhE,GACd,IAAI4d,EAeJ,GAbAmlC,GAAY/iD,GAAO,SAAU1P,GAC3B,IACEstB,OAAiB7qB,IAAT6qB,EAAsBttB,EAAQwgE,EAAelzC,EAAMttB,GAC3D,MAAOyjC,GACP,MAAM+sC,GAAoB/sC,EAAK,OAAQzjC,OAKvB,iBAATstB,IACTA,EAAOsjD,EAAQtjD,EAAMsC,EAAO5N,cAGjBvf,IAAT6qB,EACF,MAAM,IAAI/Q,MAAM,2CAGlB,OAAO+Q,MCtEEwjD,GAA+BxyE,GAH/B,SACQ,CAAC,UAEkD,YAuHtE,OAAOmiC,EAvH8E,EAAZA,OAH9D,SA0HQ,CACjByxB,IAAK6e,GACL,kCAAmCA,QCrG1BC,GAAY1yE,GAxBZ,MACQ,CAAC,QAAS,WAuBsB,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAO6kB,EAAa,EAAbA,OAC7D,OAAO7kB,EAzBI,MAyBQ,CACjB,qBAAsB,SAAUjgC,GAC9B,OAAO8kD,EAAO9kD,EAAG,CAAEglD,SAAU,SAE/B,6BAA8B,SAAUhlD,EAAG+kD,GACzC,OAAOD,EAAO9kD,EAAG,CAAEglD,SAAU,MAAOD,SAAUA,UCLvC0rB,GAAY3yE,GAzBZ,MACQ,CAAC,QAAS,WAwBsB,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAO6kB,EAAa,EAAbA,OAC7D,OAAO7kB,EA1BI,MA0BQ,CACjB,qBAAsB,SAAUjgC,GAC9B,OAAO8kD,EAAO9kD,EAAG,CAAEglD,SAAU,SAE/B,6BAA8B,SAAUhlD,EAAG+kD,GACzC,OAAOD,EAAO9kD,EAAG,CAAEglD,SAAU,MAAOD,SAAUA,UCPvC2rB,GAAY5yE,GAxBZ,MACQ,CAAC,QAAS,WAuBsB,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAO6kB,EAAa,EAAbA,OAC7D,OAAO7kB,EAzBI,MAyBQ,CACjB,qBAAsB,SAAUjgC,GAC9B,OAAO8kD,EAAO9kD,EAAG,CAAEglD,SAAU,SAE/B,6BAA8B,SAAUhlD,EAAG+kD,GACzC,OAAOD,EAAO9kD,EAAG,CAAEglD,SAAU,MAAOD,SAAUA,UCzBvC4rB,GAA8B7yE,GAH9B,QACQ,CAAC,UAEiD,YA6CrE,OAAOmiC,EA7C6E,EAAZA,OAH7D,QAgDQ,CAEjB,yBAA0B2wC,GAC1B,0CAA2CA,QAY/C,SAASA,GAAQC,EAAUjlE,EAAQ7I,GACjC,OAAO8tE,EAAS94D,QAAQ,eAAe,SAAU+4D,EAAUhxE,GAGzD,IAFA,IAAMqR,EAAOrR,EAAIuT,MAAM,KACnB7T,EAAQoM,EAAOuF,EAAK4Y,SACjB5Y,EAAKnP,aAAoBC,IAAVzC,GAAqB,CACzC,IAAMoP,EAAIuC,EAAK4Y,QACfvqB,EAAQoP,EAAIpP,EAAMoP,GAAKpP,EAAQ,IAGjC,YAAcyC,IAAVzC,EACGgjD,EAAShjD,GAGLA,EAFAslD,GAAOtlD,EAAOuD,GAMlB+tE,KChFX,IAMaC,GAA2BjzE,GAN3B,KACQ,CACnB,QACA,WAGkE,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOutB,EAAa,EAAbA,OACtE6Q,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA0BxC,OAAOA,EAlCI,KAkCQ,CACjB,sBAAuB,SAAUv0B,EAAGgsD,GAClC,OAAOhsD,EAAEiG,GAAG+lD,IAGd,iBAAkB,SAAUhsD,EAAGyK,GAE7B,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,cAAe,SAAUzK,EAAGyK,GAE1B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,cAAe,SAAUuN,EAAGyK,GAE1B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBC1EtCm1D,GAAgClzE,GAHhC,UACQ,CAAC,UAEmD,YA6BvE,OAAOmiC,EA7B+E,EAAZA,OAH/D,UAgCQ,CACjBze,OAAQ,SAAU9V,GAChB,GAAQ,EAAJA,GAAU,EACZ,OAAO,EAET,GAAIA,GAAK,EACP,OAAOA,EAAI,EAEb,GAAIA,EAAI,GAAM,GAAKA,EAAI,GAAM,EAC3B,OAAO,EAET,IAAK,IAAInN,EAAI,EAAGA,EAAIA,GAAKmN,EAAGnN,GAAK,EAC/B,GAAImN,EAAInN,GAAM,GAAKmN,GAAKnN,EAAI,IAAO,EACjC,OAAO,EAGX,OAAO,GAGT2uD,UAAW,SAAUltD,GACnB,GAAmB,EAAfA,EAAE0S,YAAmB,EACvB,OAAO,EAET,GAAI1S,EAAEioB,IAAI,GAAI,OAAOjoB,EAAE4kB,GAAG,GAC1B,GAAI5kB,EAAEiqB,IAAI,GAAG3D,GAAG,IAAMtmB,EAAEiqB,IAAI,GAAG3D,GAAG,GAAI,OAAO,EAC7C,GAAItmB,EAAEipB,GAAGroB,KAAK4U,IAAI,EAAG,KAAM,CAEzB,IADA,IAAM9J,EAAI1L,EAAE0S,WACHnU,EAAI,EAAGA,EAAIA,GAAKmN,EAAGnN,GAAK,EAC/B,GAAImN,EAAInN,GAAM,GAAKmN,GAAKnN,EAAI,IAAO,EACjC,OAAO,EAGX,OAAO,EAGT,SAAS0yE,EAAQ7nD,EAAMg8B,EAAU8rB,GAG/B,IADA,IAAIC,EAAc,GACV/rB,EAAS9+B,GAAG,IACd8+B,EAASn7B,IAAI,GAAG3D,GAAG,IACrB8+B,EAAWA,EAAS1+B,IAAI,GACxB0C,EAAOA,EAAKwB,IAAIxB,GAAMa,IAAIinD,KAE1B9rB,EAAWA,EAASz7B,IAAI,GACxBwnD,EAAc/nD,EAAKwB,IAAIumD,GAAalnD,IAAIinD,IAG5C,OAAOC,EAQT,IAJA,IAAMzvD,EAAU1hB,EAAEsB,YAAY2uB,MAAM,CAAEhO,UAAiC,EAAtBjiB,EAAEmrB,QAAQ,GAAGnpB,SAE1D3C,EAAI,EACJR,GAFJmB,EAAI,IAAI0hB,EAAQ1hB,IAEN2pB,IAAI,GACP9qB,EAAEorB,IAAI,GAAG3D,GAAG,IACjBznB,EAAIA,EAAE6nB,IAAI,GACVrnB,GAAK,EAEP,IAAI+xE,EAAQ,KAEZ,GAAIpxE,EAAEipB,GAAG,6BACPmoD,EAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAIn5D,QAAO,SAAAvM,GAAC,OAAIA,EAAI1L,SACpE,CACL,IAAMsO,EAAM1N,KAAKyQ,IAAIrR,EAAE0S,WAAa,EAAG9R,KAAKwW,MAAM,EAAIxW,KAAK4U,IAAIxV,EAAEmrB,QAAQ,GAAGnpB,OAASpB,KAAK6T,IAAI,IAAK,KACnG28D,EAAQ,GACR,IAAK,IAAI7yE,EAAI,EAAGA,GAAK+P,EAAK/P,GAAK,EAC7B6yE,EAAMx3D,KAAKtL,GAGf,IAAK,IAAI/P,EAAI,EAAGA,EAAI6yE,EAAMpvE,OAAQzD,GAAK,EAAG,CACxC,IAAM6V,EAAIg9D,EAAM7yE,GACV8yE,EAAMJ,EAAOjxE,EAAE2pB,IAAI3pB,GAAGoL,IAAIgJ,GAAIvV,EAAGmB,GACvC,IAAKqxE,EAAI/qD,GAAG,GACV,IAAK,IAAI/nB,EAAI,EAAGmN,EAAI2lE,GAAM3lE,EAAE4a,GAAGtmB,EAAE2pB,IAAI,IAAKprB,GAAK,EAAGmN,EAAIA,EAAEkf,IAAIlf,GAAGue,IAAIjqB,GACjE,GAAIzB,IAAMc,EAAI,EACZ,OAAO,EAKf,OAAO,GAGT,iBAAkB,SAAUqM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCjHXmzE,GAAgCxzE,GAHhC,UACQ,CAAC,SAAU,aAAc,cAE2B,YAAqC,IAAlC0jB,EAAkC,EAAlCA,OAAQypD,EAA0B,EAA1BA,UAAWhkB,EAAe,EAAfA,SACvFsqB,EAAkB,CACtBt2D,QAAQ,EACRuG,QAAQ,EACR0rC,WAAW,EACXt8B,UAAU,GAIN4gD,EAAmB,CACvBhwD,OAAQ,SAAC9V,GAAD,OAAO8V,EAAO9V,IACtBwhD,UAAW+d,EACP,SAACv/D,GAAD,OAAOu/D,EAAUv/D,IACjBm/D,GACJj6C,SAAUq2B,EACN,SAACv7C,GAAD,OAAOu7C,EAASv7C,IAChBo/D,IA+BN,OAAO,SAAkBtrE,EAAOiyE,GAC9B,IAAMC,EAAYptB,EAAO9kD,GAEzB,KAAMkyE,KAAaH,GACjB,MAAM,IAAI9pE,UAAU,kBAAoBjI,EAAQ,aAAekyE,EAAY,4BAA8BzyE,OAAOkS,KAAKogE,GAAiBxkE,KAAK,OAE7I,KAAM0kE,KAAcD,GAClB,MAAM,IAAI/pE,UAAU,kBAAoBjI,EAAQ,aAAeiyE,EAAa,6BAA+BxyE,OAAOkS,KAAKqgE,GAAkBzkE,KAAK,OAGhJ,OAAI0kE,IAAeC,EACVlyE,EAEAgyE,EAAiBC,GAAYjyE,OC7D7BmyE,GAAqC7zE,GAHrC,eACQ,CAAC,QAAS,YAE+C,YAAwB,IAArBmiC,EAAqB,EAArBA,MAAOmwC,EAAc,EAAdA,QAatF,OAAOnwC,EAhBI,eAgBQ,CACjB,iBAAkB,SAAUv0B,EAAGyK,GAC7B,OAAOzK,EAAIyK,GAGb,mBAAoB,SAAUzK,EAAGyK,GAC/B,OAAOzK,EAAEgb,IAAIvQ,IAGf,uBAAwB,SAAUzK,EAAGyK,GACnC,OAAOzK,EAAEgb,IAAIvQ,IAGf,qBAAsB,SAAUzK,EAAGyK,GACjC,OAAOzK,EAAEgb,IAAIvQ,IAGf,sCAAuC,SAAUzK,EAAGyK,GAClD,IAAMO,EAAMhL,EAAEukB,QAER/I,EAAMkpD,EAAQ,EAAG9rB,EAAOnuC,IAE9B,OADAO,EAAIlX,MAAQrB,KAAqB,OAAduY,EAAIlX,MAAkBkX,EAAImpD,WAAW34C,GAAOxQ,EAAIlX,MAAQ2W,GACpEO,GAGT,sCAAuC,SAAUhL,EAAGyK,GAClD,IAAIO,EAAMP,EAAE8Z,QACZvZ,EAAMA,EAAIlB,KAAK,GAEf,IAAM0R,EAAMkpD,EAAQ,EAAG9rB,EAAO54C,IAE9B,OADAgL,EAAIlX,MAAQrB,KAAKuN,EAAiB,OAAZyK,EAAE3W,MAAkB2W,EAAE0pD,WAAW34C,GAAO/Q,EAAE3W,OACzDkX,GAGT,aAAc,SAAUhL,EAAGyK,GACzB,OAAOzK,EAAE2a,OAAOlQ,SCrCTy7D,GAA4B9zE,GAZ5B,MACQ,CACnB,QACA,SACA,WACA,WACA,SACA,WACA,SACA,YAGmE,YAA8E,IAA3EmiC,EAA2E,EAA3EA,MAAO7Q,EAAoE,EAApEA,OAAQyiD,EAA4D,EAA5DA,SAAUpjC,EAAkD,EAAlDA,SAAU+e,EAAwC,EAAxCA,OAAQhsC,EAAgC,EAAhCA,OAAQylC,EAAwB,EAAxBA,SAAUtyC,EAAc,EAAdA,QAiCnI,OAAOsrB,EA7CI,MA6CQ,CACjB,iBAAkB6xC,EAElB,mBAAoB,SAAUpmE,EAAGyK,GAC/B,OAAOzK,EAAE8J,IAAIW,IAGf,uBAAwB,SAAUzK,EAAGyK,GACnC,OAAIA,EAAEwS,aAAejd,GAAK,GAAK0jB,EAAO0vC,YAC7BpzD,EAAE8J,IAAIW,GAEN,IAAIxB,EAAQjJ,EAAEgH,WAAY,GAAG8C,IAAIW,EAAEzD,WAAY,IAI1D,qBAAsB,SAAUhH,EAAGyK,GACjC,IAAM/M,EAASsC,EAAE8J,IAAIW,GAErB,GAAc,MAAV/M,EACF,OAAOA,EAGT,GAAIgmB,EAAO0vC,YACT,MAAM,IAAI/iD,MAAM,uEAEhB,OAAO+1D,EAAKpmE,EAAEmQ,UAAW1F,EAAE0F,YAI/B,gBAAiBk2D,EAEjB,mBAAoB,SAAUrmE,EAAGyK,GAC/B,OAAO47D,EAAUrmE,EAAGyK,EAAEzD,aAGxB,iBAAkBs/D,EAElB,oBAAqB,SAAUtmE,EAAGyK,GAChC,OAAO67D,EAAWtmE,EAAGyK,EAAEzD,aAGzB,2BAA4B,SAAUhH,EAAGyK,GACvC,OAAOzK,EAAE8J,IAAIW,MAYjB,SAAS27D,EAAMpmE,EAAGyK,GAGhB,GAAIiZ,EAAO0vC,cAAgBn2C,EAAUxS,IAAMzK,EAAI,EAE7C,IACE,IAAMumE,EAAQhrB,EAAS9wC,GACjB+7D,EAAO1wD,EAAOywD,GACpB,IAAI97D,IAAM+7D,GAAQtxE,KAAK2T,KAAK4B,EAAI+7D,GAAQ/7D,GAAK,QACvC87D,EAAMpzE,EAAI,GAAM,EAClB,OAAQozE,EAAMjyE,EAAI,GAAM,EAAI,GAAK,GAAKY,KAAK4U,KAAK9J,EAAGyK,GAGvD,MAAO+rC,IAUX,OAAI9yB,EAAO0vC,cACLpzD,GAAK,GAAKyK,IAAMG,KAChB5K,GAAK,GAAKA,EAAI,GAAKyK,KAAOG,KACvBrD,IAGL0V,EAAUxS,IAAMzK,GAAK,GAAK0jB,EAAO0vC,YAC5BpE,GAAUhvD,EAAGyK,GAMfzK,EAAIA,EAAI,GAAKyK,IAAMG,KACrB5K,EAAIA,EAAI,GAAKyK,KAAOG,IACd,EAGF,IAAI3B,EAAQjJ,EAAG,GAAG8J,IAAIW,EAAG,GAWpC,SAAS47D,EAAWrmE,EAAGyK,GACrB,IAAKwS,EAAUxS,IAAMA,EAAI,EACvB,MAAM,IAAI1O,UAAU,mDAAqD0O,EAAI,KAG/E,IAAM7V,EAAIutC,GAAKniC,GACf,GAAiB,IAAbpL,EAAE0B,OACJ,MAAM,IAAI+Z,MAAM,2CAA6Czb,EAAE0B,OAAS,gBAE1E,GAAI1B,EAAE,KAAOA,EAAE,GACb,MAAM,IAAIyb,MAAM,sCAAwCzb,EAAE,GAAK,IAAMA,EAAE,GAAK,KAK9E,IAFA,IAAIoW,EAAMm7D,EAASvxE,EAAE,IAAIub,UACrB4M,EAAK/c,EACFyK,GAAK,GACM,IAAP,EAAJA,KACHO,EAAM+3B,EAAShmB,EAAI/R,IAErBP,IAAM,EACNsS,EAAKgmB,EAAShmB,EAAIA,GAEpB,OAAO/R,EAUT,SAASs7D,EAAYtmE,EAAGyK,GACtB,OAAOq3C,EAAOukB,EAAUrmE,EAAEmQ,UAAW1F,Q,0mBCrLzC,IAAMg8D,GAAS,0DAYFC,GAA8Bt0E,GAV9B,QACQ,CACnB,QACA,SACA,cACA,QACA,YACA,gBAGqE,YAAmE,IAAhEmiC,EAAgE,EAAhEA,MAAOutB,EAAyD,EAAzDA,OAAQ8G,EAAiD,EAAjDA,YAAavO,EAAoC,EAApCA,MAAOmH,EAA6B,EAA7BA,UAAWC,EAAkB,EAAlBA,YAChHsP,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCqL,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCuP,EAAcV,GAAkB,CAAE/7B,UAqCxC,OAAOA,EAlDI,QAkDC,SACPoyC,IADO,IAGV19D,QAAS,SAAUjJ,GACjB,OAAOA,EAAE2L,SAGX,kBAAmB,SAAU3L,EAAG1L,GAC9B,GAAIA,EAAI,EAAK,MAAM,IAAIyH,UAAU0qE,IAEjC,OAAOzmE,EAAE2L,MAAMrX,IAGjB,qBAAsB,SAAU0L,EAAG1L,GACjC,IAAKA,EAAE2oB,YAAe,MAAM,IAAIlhB,UAAU0qE,IAE1C,IAAMrzB,EAAK9+C,EAAE0S,WACb,OAAOhH,EAAE2L,MAAMynC,IAGjB,oBAAqB,SAAUpzC,EAAG1L,GAChC,IAAKA,EAAE2oB,YAAe,MAAM,IAAIlhB,UAAU0qE,IAE1C,OAAO,IAAIjlB,EAAUxhD,GAAGsf,gBAAgBhrB,EAAE0S,aAG5Cw6C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEsf,gBAAgB,IAG3B,uBAAwB,SAAUtf,EAAG1L,GACnC,IAAKA,EAAE2oB,YAAe,MAAM,IAAIlhB,UAAU0qE,IAE1C,OAAOzmE,EAAEsf,gBAAgBhrB,EAAE0S,aAG7Bke,SAAU,SAAUllB,GAClB,OAAOA,EAAE2L,SAGX,mBAAoB,SAAU3L,EAAG1L,GAC/B,GAAIA,EAAI,EAAK,MAAM,IAAIyH,UAAU0qE,IACjC,OAAOzmE,EAAE2L,MAAMrX,IAGjB,iBAAkB,SAAU0L,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,IAG1B,mCAAoC,SAAUuN,EAAGyK,GAC/C,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,6CAA8C,SAAUuN,EAAGyK,GAEzD,OAAIm+C,EAAY5oD,EAAG,GAEVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpB0Q,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,4CAA6C,SAAUuN,EAAGyK,GAExD,OAAIm+C,EAAY5oD,EAAG,GAEVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpByN,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,sCAAuC,SAAUnQ,EAAGyK,GAElD,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,iBAK7Cw2D,GAAwB,CAC5B7wD,OAAQm5C,GAER,iBAAkB,SAAUjvD,EAAG1L,GAC7B,IAAK2oB,EAAU3oB,GAAM,MAAM,IAAIyH,UAAU0qE,IACzC,GAAInyE,EAAI,GAAKA,EAAI,GAAM,MAAM,IAAI+b,MAAM,qEAEvC,OAAO4+C,GAAYjvD,EAAG1L,KCpJbsyE,GAA4Bx0E,GAH5B,MACQ,CAAC,SAAU,QAAS,eAAgB,YAEY,YAA8C,IAA3CmiC,EAA2C,EAA3CA,MAAO7Q,EAAoC,EAApCA,OAAQmjD,EAA4B,EAA5BA,aAAc59D,EAAc,EAAdA,QAmCnG,OAAOsrB,EAtCI,MAsCQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,GAAK,GAAK0jB,EAAO0vC,YpGuFpB,SAAoBpzD,EAAGyK,GAC5B,OAAIA,EAAYvV,KAAK6T,IAAI/I,GAAK9K,KAAK6T,IAAI0B,GAChCvV,KAAK6T,IAAI/I,GoGxFH8mE,CAAU9mE,GAGV,IAAIiJ,EAAQjJ,EAAG,GAAG+I,OAI7BE,QAAS,SAAUjJ,GACjB,OAAOA,EAAE+I,OAGXy4C,UAAW,SAAUxhD,GACnB,OAAKA,EAAEmd,cAAgBuG,EAAO0vC,YACrBpzD,EAAEwc,KAGF,IAAIvT,EAAQjJ,EAAEgH,WAAY,GAAG+B,OAIxC,iBAAkB,SAAU/I,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,OAGpB,WAAY,SAAUuN,EAAG0d,GAEvB,OAAOmpD,EAAap0E,KAAKuN,GAAIvN,KAAKirB,UChE3BqpD,GAA8B30E,GAH9B,QACQ,CAAC,QAAS,SAAU,eAAgB,MAAO,YAEO,YAAmD,IAAhDmiC,EAAgD,EAAhDA,MAAO7Q,EAAyC,EAAzCA,OAAQmjD,EAAiC,EAAjCA,aAAc99D,EAAmB,EAAnBA,IAAKE,EAAc,EAAdA,QAgC1G,OAAOsrB,EAnCI,QAmCQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,IAAM,GAAK0jB,EAAO0vC,YACb4T,EAAOhnE,GAGPinE,EAAc,IAAIh+D,EAAQjJ,EAAG,KAIxCiJ,QAASg+D,EAETzlB,UAAW,SAAUxhD,GACnB,IAAMyK,EAAIzK,EAAEyJ,KAAK,GACjB,OAAKgB,EAAE0S,cAAgBuG,EAAO0vC,YACrB3oD,EAAE+R,KAGFyqD,EAAc,IAAIh+D,EAAQjJ,EAAEgH,WAAY,KAInD,iBAAkB,SAAUhH,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,OAGpB,WAAY,SAAUuN,EAAG0d,GAEvB,OAAOmpD,EAAap0E,KAAKuN,GAAI+I,EAAI2U,OAUrC,SAASupD,EAAejnE,GACtB,IAAMknE,EAAQlnE,EAAEiK,GAAK,EACrB,OAAO,IAAIhB,EACT/T,KAAK6T,IAAI7T,KAAKiV,KAAK+8D,EAAQA,EAAQlnE,EAAEkK,GAAKlK,EAAEkK,KAC5ChV,KAAK6U,MAAM/J,EAAEkK,GAAIg9D,QC5EVC,GAAiC/0E,GAHjC,WACQ,CAAC,SAAU,QAAS,eAAgB,YAEiB,YAA8C,IAA3CmiC,EAA2C,EAA3CA,MAA6BtrB,GAAc,EAApCya,OAAoC,EAA5BmjD,aAA4B,EAAd59D,SAOlGm+D,EAAwB,CAC5B,SAAkBr9B,GAAO,OAAO,IAAI9gC,EAAQ8gC,EAAK,IACjD,SAAkBA,GAAO,OAAO,IAAI9gC,EAAQ,EAAG8gC,IAC/C,SAAkBA,GAAO,OAAO,IAAI9gC,GAAS8gC,EAAK,IAClD,SAAkBA,GAAO,OAAO,IAAI9gC,EAAQ,GAAI8gC,KASlD,SAASs9B,EAAkB3+D,EAAGvW,GAC5B,GAAIA,EAAO,EAAG,MAAM,IAAIke,MAAM,kCAC9B,GAAa,IAATle,EAAY,MAAM,IAAIke,MAAM,yBAChC,GAAIle,EAAO,GAAM,EAAG,MAAM,IAAIke,MAAM,2BACpC,GAAU,IAAN3H,GAAuB,IAAZA,EAAEG,MAAa,MAAO,CAAC,IAAII,EAAQ,EAAG,IACrD,IACI0J,EADE20D,EAA4B,iBAAP5+D,GAGvB4+D,GAAuB,IAAT5+D,EAAEuB,IAAqB,IAATvB,EAAEwB,MAE9ByI,EADE20D,EACO,IAAO5+D,EAAI,GACF,IAATA,EAAEwB,GACF,IAAOxB,EAAEuB,GAAK,GAEd,IAAOvB,EAAEwB,GAAK,GAAM,GAOjC,IAJA,IAAMrG,EAAM6E,EAAE7E,MACRgF,EAAMH,EAAEG,MACR0+D,EAAQ,GACR5zE,EAAIuB,KAAK4U,IAAIjB,EAAK,EAAI1W,GACnB+Q,EAAI,EAAGA,EAAI/Q,EAAM+Q,IAAK,CAC7B,IAAMskE,GAAgB70D,EAAS,EAAIzP,GAAK/Q,EAKpCq1E,IAAiBtyE,KAAKyW,MAAM67D,GAIhCD,EAAMr5D,KAAK,IAAIjF,EAAQ,CAAEtV,EAAGA,EAAG6uD,KAAM3+C,EAAM,EAAI3O,KAAKoV,GAAKpH,GAAK/Q,KAH5Do1E,EAAMr5D,KAAKk5D,EAAsBI,EAAe,GAAG7zE,IAKvD,OAAO4zE,EAmCT,OAAOhzC,EA3FI,WA2FQ,CACjBtrB,QAAS,SAAUjJ,GACjB,OAAOqnE,EAAiBrnE,EAAG,IAE7B,kBAAmBqnE,OChFVI,GAA+Br1E,GAT/B,SACQ,CACnB,QACA,cACA,SACA,MACA,gBAGsE,YAAsD,IAAnDmiC,EAAmD,EAAnDA,MAAOq0B,EAA4C,EAA5CA,YAAa9G,EAA+B,EAA/BA,OAAQh4C,EAAuB,EAAvBA,IAAK23C,EAAkB,EAAlBA,YACpGsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCsP,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCqL,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAyBxC,OAAOA,EAxCI,SAwCQ,CAEjB,WAAYzqB,EAEZ,6BAA8B,SAAU9J,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGX,GAAK,IAGhC,4BAA6B,SAAU9J,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAG8J,GAAK,IAGhC,4BAA6B,SAAU9J,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGX,GAAK,IAGhC,2BAA4B,SAAU9J,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGX,IAG3B,eAAgB,SAAU9J,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCxFtCu3D,GAAkCt1E,GATlC,YACQ,CACnB,QACA,SACA,cACA,eACA,gBAGyE,YAA+D,IAA5DmiC,EAA4D,EAA5DA,MAAOutB,EAAqD,EAArDA,OAAQ8G,EAA6C,EAA7CA,YAAaie,EAAgC,EAAhCA,aAAcplB,EAAkB,EAAlBA,YAChHuR,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCmL,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCsP,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCqL,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA4BxC,OAAOA,EA5CI,YA4CQ,CAEjB,WAAYsyC,EAEZ,6BAA8B,SAAU7mE,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGo8D,GAAc,IAGzC,4BAA6B,SAAU7mE,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAG6mE,GAAc,IAGzC,4BAA6B,SAAU7mE,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGo8D,GAAc,IAGzC,2BAA4B,SAAU7mE,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGo8D,IAG3B,eAAgB,SAAU7mE,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOsmD,EAAY/wD,EAAGyK,EAAGo8D,GAAc,IAGzC,mBAAoB,SAAU7mE,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGo8D,GAAc,IAGzC,oBAAqB,SAAU7mE,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAG6mE,GAAc,IAGzC,mBAAoB,SAAU7mE,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAG6mE,GAAc,IAGzC,aAAc,SAAU7mE,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGo8D,GAAc,GAAO12D,WAGxD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAG6mE,GAAc,GAAM12D,gBC3GpD,SAASw3D,GAAT,GAAiD,IAAflmB,EAAe,EAAfA,YAUvC,OAAO,SAA0BxuD,EAAG0V,EAAG2b,GACrC,IAAMsjD,EAAQ30E,EAAEkvC,OAEhB,GAAqB,IAAjBylC,EAAMtxE,OACR,MAAM,IAAIqsC,WAAW,yCAA2CyW,GAAOwuB,GAAS,KAGlF,IAAMxiB,EAAOwiB,EAAM,GAGnB,GAAIxiB,IAFYwiB,EAAM,GAGpB,MAAM,IAAIjlC,WAAW,gCAAkCyW,GAAOwuB,GAAS,KAGzE,IAAIl8C,EAAO,GAEX,GAAIqrB,EAASpuC,GAAI,CACf,IAAMk/D,EAAQl/D,EAAEw5B,OACVkwB,EAAQ1pD,EAAEi7C,MAGhB,GAAqB,IAAjBikB,EAAMvxE,OAAc,CACtB,GAAIuxE,EAAM,KAAOziB,EACf,MAAM,IAAIziB,WAAW,gEAGvB,IAAK,IAAI9vC,EAAI,EAAGA,EAAIuyD,EAAMvyD,IACxB64B,EAAK74B,GAAK,CAACw/D,EAAMx/D,IAGnB,OAAO,IAAI4uD,EAAY,CACrB/1B,KAAMA,EACNyW,KAAM,CAACijB,EAAM,GACb5B,SAAU76C,EAAEm7C,YAKhB,GAAqB,IAAjB+jB,EAAMvxE,OAAc,CACtB,GAAIuxE,EAAM,KAAOziB,GAAqB,IAAbyiB,EAAM,GAC7B,MAAM,IAAIllC,WAAW,gEAGvB,GAAIsU,EAActuC,GAAI,CACpB,GAAI2b,EAAM,CACRoH,EAAO,GAEP,IAAK,IAAI74B,EAAI,EAAGA,EAAIuyD,EAAMvyD,IACxB64B,EAAK74B,GAAK,CAACw/D,EAAMx/D,GAAG,IAGtB,OAAO,IAAI4uD,EAAY,CACrB/1B,KAAMA,EACNyW,KAAM,CAACijB,EAAM,GACb5B,SAAU76C,EAAEm7C,YAIhB,OAAOn7C,EAGT,GAAIuuC,EAAevuC,GAAI,CACrB,IAAK,IAAI9V,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAO64B,EAAK74B,GAAK,CAAC,GAM5C,IAJA,IAAMqN,EAASyI,EAAEu+C,QACX7mD,EAAQsI,EAAEy+C,OACV4B,EAAMrgD,EAAE2+C,KAELN,EAAKgC,EAAI,GAAI9lD,EAAI8lD,EAAI,GAAI9lD,EAAI8jD,EAAI9jD,IAAK,CAE7CwoB,EADUrrB,EAAM6C,IACR,GAAKhD,EAAOgD,GAGtB,OAAO,IAAIu+C,EAAY,CACrB/1B,KAAMA,EACNyW,KAAM,CAACijB,EAAM,GACb5B,SAAU76C,EAAEm7C,aAKlB,MAAM,IAAInhB,WAAW,mFAGvB,GAAIvgC,EAAQuG,GAAI,CACd,IAAMipD,EAAQzV,GAAUxzC,GAExB,GAAqB,IAAjBipD,EAAMt7D,OAAc,CACtB,GAAIs7D,EAAM,KAAOxM,EACf,MAAM,IAAIziB,WAAW,gEAGvB,IAAK,IAAI9vC,EAAI,EAAGA,EAAIuyD,EAAMvyD,IACxB64B,EAAK74B,GAAK,CAAC8V,EAAE9V,IAGf,OAAO,IAAI4uD,EAAY,CACrB/1B,KAAMA,EACNyW,KAAM,CAACijB,EAAM,KAIjB,GAAqB,IAAjBwM,EAAMt7D,OAAc,CACtB,GAAIs7D,EAAM,KAAOxM,GAAqB,IAAbwM,EAAM,GAC7B,MAAM,IAAIjvB,WAAW,gEAGvB,IAAK,IAAI9vC,EAAI,EAAGA,EAAIuyD,EAAMvyD,IACxB64B,EAAK74B,GAAK,CAAC8V,EAAE9V,GAAG,IAGlB,OAAO,IAAI4uD,EAAY,CACrB/1B,KAAMA,EACNyW,KAAM,CAACijB,EAAM,KAIjB,MAAM,IAAIziB,WAAW,qFChI3B,IAWamlC,GAA+B11E,GAX/B,SACQ,CACnB,QACA,SACA,eACA,iBACA,WACA,cACA,gBAGsE,YAAyF,IAAtFmiC,EAAsF,EAAtFA,MAAOutB,EAA+E,EAA/EA,OAAQ+kB,EAAuE,EAAvEA,aAAcvS,EAAyD,EAAzDA,eAAgBrzC,EAAyC,EAAzCA,SAAU2nC,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YACvIsmB,EAAkBJ,GAAsB,CAAElmB,gBA0BhD,OAAOltB,EAtCI,SAsCQ,CAEjB,+BAAgC,SAAUthC,EAAG0V,GAC3C,OA6DJ,SAAqC1V,EAAG0V,GAiBtC,IAbA,IAAM0pD,GAFN1pD,EAAIo/D,EAAgB90E,EAAG0V,GAAG,IAEVi7C,MAEVwB,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAElB3jD,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KAGRtnD,EAAI,GAGD4H,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAChC,IAAMogE,EAAK3V,EAAMzqD,GAAG,IAAM,EAE1B,GAAKghD,EAAYof,EAAI,GAyCnBhoE,EAAE4H,GAAK,CAAC,OAzCe,CAavB,IAVA,IAAIqgE,EAAM,EAEJC,EAAU,GACVC,EAAW,GAGXC,EAAapf,EAAIphD,GACjBwM,EAAY40C,EAAIphD,EAAI,GAGjB1E,EAAIklE,EAAYllE,EAAIkR,EAAWlR,IAAK,CAC3C,IAAMrQ,EAAIwN,EAAM6C,GAGZrQ,IAAM+U,EACRqgE,EAAM/nE,EAAOgD,GACJrQ,EAAI+U,IAEbsgE,EAAQh6D,KAAKhO,EAAOgD,IACpBilE,EAASj6D,KAAKrb,IAKlB,GAAI+1D,EAAYqf,EAAK,GACnB,MAAM,IAAI53D,MAAM,2DAKlB,IAFA,IAAMg4D,EAAKxB,EAAamB,EAAIC,GAEnB/kE,EAAI,EAAGpQ,EAAIq1E,EAAS7xE,OAAQ4M,EAAIpQ,EAAGoQ,IAAK,CAC/C,IAAMrQ,EAAIs1E,EAASjlE,GACnBmvD,EAAMx/D,GAAK,CAACouB,EAASoxC,EAAMx/D,GAAG,IAAM,EAAGyhE,EAAe+T,EAAIH,EAAQhlE,MAGpElD,EAAE4H,GAAK,CAACygE,IAOZ,OAAO,IAAI5mB,EAAY,CACrB/1B,KAAM1rB,EACNmiC,KAAM,CAACijB,EAAM,KAhINkjB,CAA2Br1E,EAAG0V,IAGvC,8BAA+B,SAAU1V,EAAG0V,GAC1C,OAAO4/D,EAA0Bt1E,EAAG0V,IAGtC,wBAAyB,SAAUD,EAAGC,GAGpC,OADU4/D,EADAzmB,EAAOp5C,GACsBC,GAC9BwH,aAIb,SAASo4D,EAA2Bt1E,EAAG0V,GAcrC,IAXA,IAAM0pD,GADN1pD,EAAIo/D,EAAgB90E,EAAG0V,GAAG,IACVi7C,MAEVwB,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAGlB7jD,EAAI,GAEJwoE,EAAQv1E,EAAE2wD,MAGPh8C,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAChC,IAAMogE,EAAK3V,EAAMzqD,GAAG,IAAM,EACtBygE,OAAE,EAEN,GAAKzf,EAAYof,EAAI,GAiBnBK,EAAK,MAjBkB,CAGvB,IAAMJ,EAAMO,EAAM5gE,GAAGA,GAErB,GAAIghD,EAAYqf,EAAK,GACnB,MAAM,IAAI53D,MAAM,2DAGlBg4D,EAAKxB,EAAamB,EAAIC,GAGtB,IAAK,IAAIp1E,EAAI+U,EAAI,EAAG/U,EAAIuyD,EAAMvyD,IAC5Bw/D,EAAMx/D,GAAK,CAACouB,EAASoxC,EAAMx/D,GAAG,IAAM,EAAGyhE,EAAe+T,EAAIG,EAAM31E,GAAG+U,MAOvE5H,EAAE4H,GAAK,CAACygE,GAGV,OAAO,IAAI5mB,EAAY,CACrB/1B,KAAM1rB,EACNmiC,KAAM,CAACijB,EAAM,SCvFNqjB,GAA+Br2E,GAX/B,SACQ,CACnB,QACA,SACA,eACA,iBACA,WACA,cACA,gBAGsE,YAAyF,IAAtFmiC,EAAsF,EAAtFA,MAAOutB,EAA+E,EAA/EA,OAAQ+kB,EAAuE,EAAvEA,aAAcvS,EAAyD,EAAzDA,eAAgBrzC,EAAyC,EAAzCA,SAAU2nC,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YACvIsmB,EAAkBJ,GAAsB,CAAElmB,gBA0BhD,OAAOltB,EAtCI,SAsCQ,CAEjB,+BAAgC,SAAUthC,EAAG0V,GAC3C,OAgEJ,SAAsC1V,EAAG0V,GAiBvC,IAbA,IAAM0pD,GAFN1pD,EAAIo/D,EAAgB90E,EAAG0V,GAAG,IAEVi7C,MAEVwB,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAElB3jD,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KAGRtnD,EAAI,GAGD4H,EAAI09C,EAAU,EAAG19C,GAAK,EAAGA,IAAK,CACrC,IAAMogE,EAAK3V,EAAMzqD,GAAG,IAAM,EAE1B,GAAKghD,EAAYof,EAAI,GA0CnBhoE,EAAE4H,GAAK,CAAC,OA1Ce,CAcvB,IAXA,IAAIqgE,EAAM,EAGJC,EAAU,GACVC,EAAW,GAGXC,EAAapf,EAAIphD,GAId1E,EAHS8lD,EAAIphD,EAAI,GAGD,EAAG1E,GAAKklE,EAAYllE,IAAK,CAChD,IAAMrQ,EAAIwN,EAAM6C,GAGZrQ,IAAM+U,EACRqgE,EAAM/nE,EAAOgD,GACJrQ,EAAI+U,IAEbsgE,EAAQh6D,KAAKhO,EAAOgD,IACpBilE,EAASj6D,KAAKrb,IAKlB,GAAI+1D,EAAYqf,EAAK,GACnB,MAAM,IAAI53D,MAAM,2DAKlB,IAFA,IAAMg4D,EAAKxB,EAAamB,EAAIC,GAEnB/kE,EAAI,EAAGkR,EAAY+zD,EAAS7xE,OAAQ4M,EAAIkR,EAAWlR,IAAK,CAC/D,IAAMrQ,EAAIs1E,EAASjlE,GACnBmvD,EAAMx/D,GAAK,CAACouB,EAASoxC,EAAMx/D,GAAG,GAAIyhE,EAAe+T,EAAIH,EAAQhlE,MAG/DlD,EAAE4H,GAAK,CAACygE,IAOZ,OAAO,IAAI5mB,EAAY,CACrB/1B,KAAM1rB,EACNmiC,KAAM,CAACijB,EAAM,KApINsjB,CAA4Bz1E,EAAG0V,IAGxC,8BAA+B,SAAU1V,EAAG0V,GAC1C,OAAOggE,EAA2B11E,EAAG0V,IAGvC,wBAAyB,SAAUD,EAAGC,GAGpC,OADUggE,EADA7mB,EAAOp5C,GACuBC,GAC/BwH,aAIb,SAASw4D,EAA4B11E,EAAG0V,GActC,IAVA,IAAM0pD,GAFN1pD,EAAIo/D,EAAgB90E,EAAG0V,GAAG,IAEVi7C,MAEVwB,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAGlB7jD,EAAI,GAEJwoE,EAAQv1E,EAAE2wD,MAEPh8C,EAAI09C,EAAU,EAAG19C,GAAK,EAAGA,IAAK,CAErC,IAAMogE,EAAK3V,EAAMzqD,GAAG,IAAM,EAEtBygE,OAAE,EAEN,GAAKzf,EAAYof,EAAI,GAkBnBK,EAAK,MAlBkB,CAEvB,IAAMJ,EAAMO,EAAM5gE,GAAGA,GAErB,GAAIghD,EAAYqf,EAAK,GAEnB,MAAM,IAAI53D,MAAM,2DAGlBg4D,EAAKxB,EAAamB,EAAIC,GAGtB,IAAK,IAAIp1E,EAAI+U,EAAI,EAAG/U,GAAK,EAAGA,IAE1Bw/D,EAAMx/D,GAAK,CAACouB,EAASoxC,EAAMx/D,GAAG,IAAM,EAAGyhE,EAAe+T,EAAIG,EAAM31E,GAAG+U,MAOvE5H,EAAE4H,GAAK,CAACygE,GAGV,OAAO,IAAI5mB,EAAY,CACrB/1B,KAAM1rB,EACNmiC,KAAM,CAACijB,EAAM,S,oBC1FNwjB,GAAkCx2E,GAXlC,YACQ,CACnB,QACA,SACA,eACA,iBACA,WACA,cACA,gBAGyE,YAAyF,IAAtFmiC,EAAsF,EAAtFA,MAAOutB,EAA+E,EAA/EA,OAAQ+kB,EAAuE,EAAvEA,aAAcvS,EAAyD,EAAzDA,eAAgBrzC,EAAyC,EAAzCA,SAAU2nC,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YAC1IsmB,EAAkBJ,GAAsB,CAAElmB,gBA0BhD,OAAOltB,EAtCI,YAsCQ,CAEjB,+BAAgC,SAAUthC,EAAG0V,GAC3C,OAwEJ,SAAqC1V,EAAG41E,GAYtC,IAVA,IAAMnjD,EAAI,CAACqiD,EAAgB90E,EAAG41E,GAAI,GAAMjlB,MAAM7tD,KAAI,SAAAmf,GAAC,OAAIA,EAAE,OAEnDkwC,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAElB3jD,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KAGLz0D,EAAI,EAAGA,EAAIyyD,EAASzyD,IAI3B,IAHA,IAAIi2E,EAAIpjD,EAAEpvB,OAGD4M,EAAI,EAAGA,EAAI4lE,EAAG5lE,IAAK,CAa1B,IAZA,IAAMyF,EAAI+c,EAAExiB,GAGN6lE,EAAU,GACVC,EAAW,GAGXZ,EAAapf,EAAIn2D,GACjBuhB,EAAY40C,EAAIn2D,EAAI,GAGtBo2E,EAAM,EACDrhE,EAAIwgE,EAAYxgE,EAAIwM,EAAWxM,IAAK,CAC3C,IAAMy+C,EAAIhmD,EAAMuH,GAEZy+C,IAAMxzD,EACRo2E,EAAM/oE,EAAO0H,GACJy+C,EAAIxzD,IAEbk2E,EAAQ76D,KAAKhO,EAAO0H,IACpBohE,EAAS96D,KAAKm4C,IAIlB,GAAKuC,EAAYqgB,EAAK,GASf,GAAKrgB,EAAYjgD,EAAE9V,GAAI,IAYvB,GAAU,IAANqQ,EAAS,CAGlB,IAAMgmE,EAAO,KAAIvgE,GACjBugE,EAAKr2E,GAAK,EAEV,IAAK,IAAI+U,EAAI,EAAGwM,EAAY40D,EAAS1yE,OAAQsR,EAAIwM,EAAWxM,IAAK,CAC/D,IAAMy+C,EAAI2iB,EAASphE,GACnBshE,EAAK7iB,GAAKplC,EAASioD,EAAK7iB,GAAI0iB,EAAQnhE,IAGtC8d,EAAExX,KAAKg7D,QAvByB,CAGhC,GAAU,IAANhmE,EAEF,MAAO,GAGPwiB,EAAE9f,OAAO1C,EAAG,GACZA,GAAK,EACL4lE,GAAK,MAnBiB,CAGxBngE,EAAE9V,GAAKg0E,EAAal+D,EAAE9V,GAAIo2E,GAE1B,IAAK,IAAIrhE,EAAI,EAAGwM,EAAY40D,EAAS1yE,OAAQsR,EAAIwM,EAAWxM,IAAK,CAC/D,IAAMy+C,EAAI2iB,EAASphE,GACnBe,EAAE09C,GAAKplC,EAAStY,EAAE09C,GAAIiO,EAAe3rD,EAAE9V,GAAIk2E,EAAQnhE,OA8B3D,OAAO8d,EAAE3vB,KAAI,SAAAiK,GAAC,OAAI,IAAIyhD,EAAY,CAAE/1B,KAAM1rB,EAAEjK,KAAI,SAAAmf,GAAC,MAAI,CAACA,MAAKitB,KAAM,CAACijB,EAAM,QAtJ/DkjB,CAA2Br1E,EAAG0V,IAGvC,8BAA+B,SAAU1V,EAAG0V,GAC1C,OAAO4/D,EAA0Bt1E,EAAG0V,IAGtC,wBAAyB,SAAUD,EAAGC,GAGpC,OADU4/D,EADAzmB,EAAOp5C,GACsBC,GAC9B5S,KAAI,SAAApC,GAAC,OAAIA,EAAEwc,gBAIxB,SAASo4D,EAA2Bt1E,EAAG41E,GAYrC,IAPA,IAAMnjD,EAAI,CAACqiD,EAAgB90E,EAAG41E,GAAI,GAAMjlB,MAAM7tD,KAAI,SAAAmf,GAAC,OAAIA,EAAE,OAEnDuQ,EAAIxyB,EAAE2wD,MACNwB,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAGfhxD,EAAI,EAAGA,EAAIyyD,EAASzyD,IAI3B,IAHA,IAAIi2E,EAAIpjD,EAAEpvB,OAGD4M,EAAI,EAAGA,EAAI4lE,EAAG5lE,IAAK,CAC1B,IAAMyF,EAAI+c,EAAExiB,GAEZ,GAAK0lD,EAAYnjC,EAAE5yB,GAAGA,GAAI,GASnB,GAAK+1D,EAAYjgD,EAAE9V,GAAI,IAYvB,GAAU,IAANqQ,EAAS,CAGlB,IAAMgmE,EAAO,KAAIvgE,GACjBugE,EAAKr2E,GAAK,EAEV,IAAK,IAAI+U,EAAI/U,EAAI,EAAG+U,EAAI09C,EAAS19C,IAC/BshE,EAAKthE,GAAKqZ,EAASioD,EAAKthE,GAAI6d,EAAE7d,GAAG/U,IAGnC6yB,EAAExX,KAAKg7D,QAtByB,CAGhC,GAAU,IAANhmE,EAEF,MAAO,GAGPwiB,EAAE9f,OAAO1C,EAAG,GACZA,GAAK,EACL4lE,GAAK,MAnBqB,CAG5BngE,EAAE9V,GAAKg0E,EAAal+D,EAAE9V,GAAI4yB,EAAE5yB,GAAGA,IAE/B,IAAK,IAAI+U,EAAI/U,EAAI,EAAG+U,EAAI09C,EAAS19C,IAE/Be,EAAEf,GAAKqZ,EAAStY,EAAEf,GAAI0sD,EAAe3rD,EAAE9V,GAAI4yB,EAAE7d,GAAG/U,MA6BxD,OAAO6yB,EAAE3vB,KAAI,SAAAiK,GAAC,OAAI,IAAIyhD,EAAY,CAAE/1B,KAAM1rB,EAAEjK,KAAI,SAAAmf,GAAC,MAAI,CAACA,MAAKitB,KAAM,CAACijB,EAAM,YCnG/D+jB,GAAkC/2E,GAXlC,YACQ,CACnB,QACA,SACA,eACA,iBACA,WACA,cACA,gBAGyE,YAAyF,IAAtFmiC,EAAsF,EAAtFA,MAAOutB,EAA+E,EAA/EA,OAAQ+kB,EAAuE,EAAvEA,aAAcvS,EAAyD,EAAzDA,eAAgBrzC,EAAyC,EAAzCA,SAAU2nC,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YAC1IsmB,EAAkBJ,GAAsB,CAAElmB,gBA0BhD,OAAOltB,EAtCI,YAsCQ,CAEjB,+BAAgC,SAAUthC,EAAG0V,GAC3C,OAwEJ,SAAsC1V,EAAG41E,GAYvC,IAVA,IAAMnjD,EAAI,CAACqiD,EAAgB90E,EAAG41E,GAAI,GAAMjlB,MAAM7tD,KAAI,SAAAmf,GAAC,OAAIA,EAAE,OAEnDkwC,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAElB3jD,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KAGLz0D,EAAIyyD,EAAU,EAAGzyD,GAAK,EAAGA,IAIhC,IAHA,IAAIi2E,EAAIpjD,EAAEpvB,OAGD4M,EAAI,EAAGA,EAAI4lE,EAAG5lE,IAAK,CAa1B,IAZA,IAAMyF,EAAI+c,EAAExiB,GAGN6lE,EAAU,GACVC,EAAW,GAGXZ,EAAapf,EAAIn2D,GACjBuhB,EAAY40C,EAAIn2D,EAAI,GAGtBo2E,EAAM,EACDrhE,EAAIwM,EAAY,EAAGxM,GAAKwgE,EAAYxgE,IAAK,CAChD,IAAMy+C,EAAIhmD,EAAMuH,GAEZy+C,IAAMxzD,EACRo2E,EAAM/oE,EAAO0H,GACJy+C,EAAIxzD,IAEbk2E,EAAQ76D,KAAKhO,EAAO0H,IACpBohE,EAAS96D,KAAKm4C,IAIlB,GAAKuC,EAAYqgB,EAAK,GAUf,GAAKrgB,EAAYjgD,EAAE9V,GAAI,IAYvB,GAAU,IAANqQ,EAAS,CAGlB,IAAMgmE,EAAO,KAAIvgE,GACjBugE,EAAKr2E,GAAK,EAGV,IAAK,IAAI+U,EAAI,EAAGwM,EAAY40D,EAAS1yE,OAAQsR,EAAIwM,EAAWxM,IAAK,CAC/D,IAAMy+C,EAAI2iB,EAASphE,GACnBshE,EAAK7iB,GAAKplC,EAASioD,EAAK7iB,GAAI0iB,EAAQnhE,IAGtC8d,EAAExX,KAAKg7D,QAxByB,CAGhC,GAAU,IAANhmE,EAEF,MAAO,GAGPwiB,EAAE9f,OAAO1C,EAAG,GACZA,GAAK,EACL4lE,GAAK,MApBiB,CAGxBngE,EAAE9V,GAAKg0E,EAAal+D,EAAE9V,GAAIo2E,GAG1B,IAAK,IAAIrhE,EAAI,EAAGwM,EAAY40D,EAAS1yE,OAAQsR,EAAIwM,EAAWxM,IAAK,CAC/D,IAAMy+C,EAAI2iB,EAASphE,GACnBe,EAAE09C,GAAKplC,EAAStY,EAAE09C,GAAIiO,EAAe3rD,EAAE9V,GAAIk2E,EAAQnhE,OA+B3D,OAAO8d,EAAE3vB,KAAI,SAAAiK,GAAC,OAAI,IAAIyhD,EAAY,CAAE/1B,KAAM1rB,EAAEjK,KAAI,SAAAmf,GAAC,MAAI,CAACA,MAAKitB,KAAM,CAACijB,EAAM,QAxJ/DsjB,CAA4Bz1E,EAAG0V,IAGxC,8BAA+B,SAAU1V,EAAG0V,GAC1C,OAAOggE,EAA2B11E,EAAG0V,IAGvC,wBAAyB,SAAUD,EAAGC,GAGpC,OADUggE,EADA7mB,EAAOp5C,GACuBC,GAC/B5S,KAAI,SAAApC,GAAC,OAAIA,EAAEwc,gBAIxB,SAASw4D,EAA4B11E,EAAG41E,GAYtC,IAPA,IAAMnjD,EAAI,CAACqiD,EAAgB90E,EAAG41E,GAAI,GAAMjlB,MAAM7tD,KAAI,SAAAmf,GAAC,OAAIA,EAAE,OAEnDuQ,EAAIxyB,EAAE2wD,MACNwB,EAAOnyD,EAAE4wD,MAAM,GAIZhxD,EAHOI,EAAE4wD,MAAM,GAGD,EAAGhxD,GAAK,EAAGA,IAIhC,IAHA,IAAIi2E,EAAIpjD,EAAEpvB,OAGD4M,EAAI,EAAGA,EAAI4lE,EAAG5lE,IAAK,CAC1B,IAAMyF,EAAI+c,EAAExiB,GAEZ,GAAK0lD,EAAYnjC,EAAE5yB,GAAGA,GAAI,GASnB,GAAK+1D,EAAYjgD,EAAE9V,GAAI,IAYvB,GAAU,IAANqQ,EAAS,CAGlB,IAAMgmE,EAAO,KAAIvgE,GACjBugE,EAAKr2E,GAAK,EAEV,IAAK,IAAI+U,EAAI/U,EAAI,EAAG+U,GAAK,EAAGA,IAC1BshE,EAAKthE,GAAKqZ,EAASioD,EAAKthE,GAAI6d,EAAE7d,GAAG/U,IAGnC6yB,EAAExX,KAAKg7D,QAtByB,CAGhC,GAAU,IAANhmE,EAEF,MAAO,GAGPwiB,EAAE9f,OAAO1C,EAAG,GACZA,GAAK,EACL4lE,GAAK,MAnBqB,CAG5BngE,EAAE9V,GAAKg0E,EAAal+D,EAAE9V,GAAI4yB,EAAE5yB,GAAGA,IAE/B,IAAK,IAAI+U,EAAI/U,EAAI,EAAG+U,GAAK,EAAGA,IAE1Be,EAAEf,GAAKqZ,EAAStY,EAAEf,GAAI0sD,EAAe3rD,EAAE9V,GAAI4yB,EAAE7d,GAAG/U,MA6BxD,OAAO6yB,EAAE3vB,KAAI,SAAAiK,GAAC,OAAI,IAAIyhD,EAAY,CAAE/1B,KAAM1rB,EAAEjK,KAAI,SAAAmf,GAAC,MAAI,CAACA,MAAKitB,KAAM,CAACijB,EAAM,YC3G/DgkB,GAAoCh3E,GAHpC,cACQ,CAAC,QAAS,gBAE8C,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YAmBrF,OAAO,SAAsBlgD,EAAGC,EAAGs0B,GAEjC,IAAMgqB,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT0I,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER2N,EAAU9oD,EAAEu+C,QACZwK,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KACTsK,EAAQjpD,EAAEk7C,MACVgO,EAAMlpD,EAAEm7C,UAGd,GAAIkM,EAAM15D,SAAWs7D,EAAMt7D,OAAU,MAAM,IAAIwlD,GAAekU,EAAM15D,OAAQs7D,EAAMt7D,QAGlF,GAAI05D,EAAM,KAAO4B,EAAM,IAAM5B,EAAM,KAAO4B,EAAM,GAAM,MAAM,IAAIjvB,WAAW,iCAAmCqtB,EAAQ,0BAA4B4B,EAAQ,KAG1J,IAAK3K,IAAYwK,EAAW,MAAM,IAAIphD,MAAM,uDAG5C,IAII6/C,EAJE9K,EAAO4K,EAAM,GACb1K,EAAU0K,EAAM,GAKlBp1C,EAAKguC,EAELK,EAAO,EAEPkH,EAAKlzB,EAGU,iBAARgzB,GAAoBA,IAAQ4B,IAErC3B,EAAKD,EAELr1C,EAAK2Z,EAAM5vB,KAAKikD,EAAa,CAACsH,EAAIA,IAElCjH,EAAO10B,EAAMsE,QAAQ,EAAGq3B,GAExBC,EAAK57B,EAAM5vB,KAAKs4B,EAAU,CAACizB,EAAIA,KAiBjC,IAbA,IAUIhtD,EAAG6jD,EAAIC,EAAIn0D,EAVTu9D,EAAU,GACVxJ,EAAS,GACTyJ,EAAO,GAGPrwD,EAAI,GAEJ8X,EAAI,GAMDlQ,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAEhCyoD,EAAKzoD,GAAKg/C,EAAOtwD,OAEjB,IAAMo7C,EAAO9pC,EAAI,EAEjB,IAAKm/C,EAAKM,EAAKz/C,GAAIo/C,EAAKK,EAAKz/C,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAInD4U,EAFAjlB,EAAIs0D,EAAOjkD,IAEJwuC,EAEP1xC,EAAEnN,GAAKo0D,EAAQ/jD,GAEf0jD,EAAO14C,KAAKrb,GAGd,IAAKk0D,EAAK4K,EAAK/pD,GAAIo/C,EAAK2K,EAAK/pD,EAAI,GAAI1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAI/C4U,EAFJjlB,EAAI6+D,EAAOxuD,MAEEwuC,IAEX1xC,EAAEnN,GAAKs9D,EAAGnwD,EAAEnN,GAAI4+D,EAAQvuD,KAM5B,IAFAA,EAAImtD,EAAKzoD,GAEF1E,EAAI0jD,EAAOtwD,QAAQ,CAIxB,IAAM4a,EAAIlR,EAFVnN,EAAI+zD,EAAO1jD,IAIN0X,EAAG1J,EAAG+3C,GAOTrC,EAAOhhD,OAAO1C,EAAG,IALjBktD,EAAQliD,KAAKgD,GAEbhO,MAWN,OAHAmtD,EAAK/K,GAAWsB,EAAOtwD,OAGhBoS,EAAE4hD,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAACijB,EAAME,GACb9B,SAAU0M,QC1HHmZ,GAAkCj3E,GATlC,YACQ,CACnB,QACA,SACA,cACA,QACA,gBAGyE,YAAwD,IAArDmiC,EAAqD,EAArDA,MAAOutB,EAA8C,EAA9CA,OAAQ8G,EAAsC,EAAtCA,YAAavO,EAAyB,EAAzBA,MAAOoH,EAAkB,EAAlBA,YACzG+Q,EAAclB,GAAkB,CAAE/8B,UAClCy+B,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzC0gB,EAAcF,GAAkB,CAAE70C,QAAOq0B,gBACzC8J,EAAcP,GAAkB,CAAE59B,QAAOktB,gBACzCsP,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAyBxC,OAAOA,EAzCI,YAyCQ,CAEjB,iBAAkBilC,GAElB,uBAAwBN,GAExB,6BAA8B,SAAUl5D,EAAGyK,GACzC,OAAO6+D,EAAYtpE,EAAGyK,EAAGhY,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAO+nD,EAAYxyD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mCAAoC,SAAUzK,EAAGyK,GAE/C,OAAIm+C,EAAYn+C,EAAG,GACVzK,EAAEukB,QAEJwsC,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAE9C,OAAIm+C,EAAYn+C,EAAG,GACVzK,EAAEukB,QAEJysC,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,mCAAoC,SAAUuN,EAAGyK,GAE/C,OAAIm+C,EAAY5oD,EAAG,GACVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpBmP,EAAYjoD,EAAGzK,EAAGvN,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAE9C,OAAIm+C,EAAY5oD,EAAG,GACVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpByN,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,GAAG0F,WAG5B,4BAA6B,SAAUnQ,EAAGyK,GAExC,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,IAAI0F,gBC5GnBo5D,GAAwCn3E,GATxC,kBACQ,CACnB,QACA,SACA,cACA,QACA,gBAG+E,YAAwD,IAArDmiC,EAAqD,EAArDA,MAAOutB,EAA8C,EAA9CA,OAAQ8G,EAAsC,EAAtCA,YAAavO,EAAyB,EAAzBA,MAAOoH,EAAkB,EAAlBA,YAC/G+Q,EAAclB,GAAkB,CAAE/8B,UAClCy+B,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzC0gB,EAAcF,GAAkB,CAAE70C,QAAOq0B,gBACzC8J,EAAcP,GAAkB,CAAE59B,QAAOktB,gBACzCsP,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAyBxC,OAAOA,EAzCI,kBAyCQ,CAEjB,iBAAkBklC,GAElB,uBAAwBN,GAExB,6BAA8B,SAAUn5D,EAAGyK,GACzC,OAAO6+D,EAAYtpE,EAAGyK,EAAGhY,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAO+nD,EAAYxyD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mCAAoC,SAAUzK,EAAGyK,GAE/C,OAAIm+C,EAAYn+C,EAAG,GACVzK,EAAEukB,QAEJwsC,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAE9C,OAAIm+C,EAAYn+C,EAAG,GACVzK,EAAEukB,QAEJysC,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,mCAAoC,SAAUuN,EAAGyK,GAE/C,OAAIm+C,EAAY5oD,EAAG,GACVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpBmP,EAAYjoD,EAAGzK,EAAGvN,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAE9C,OAAIm+C,EAAY5oD,EAAG,GACVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpByN,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,GAAG0F,WAG5B,4BAA6B,SAAUnQ,EAAGyK,GAExC,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,IAAI0F,gBC7GnBq5D,GAAsCp3E,GATtC,gBACQ,CACnB,QACA,SACA,cACA,QACA,gBAG6E,YAAwD,IAArDmiC,EAAqD,EAArDA,MAAOutB,EAA8C,EAA9CA,OAAQ8G,EAAsC,EAAtCA,YAAavO,EAAyB,EAAzBA,MAAOoH,EAAkB,EAAlBA,YAC7G+Q,EAAclB,GAAkB,CAAE/8B,UAClCy+B,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzC0gB,EAAcF,GAAkB,CAAE70C,QAAOq0B,gBACzC8J,EAAcP,GAAkB,CAAE59B,QAAOktB,gBACzCsP,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA0BxC,OAAOA,EA1CI,gBA0CQ,CAEjB,iBAAkBmlC,GAIlB,6BAA8B,SAAU15D,EAAGyK,GACzC,OAAO6+D,EAAYtpE,EAAGyK,EAAGhY,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAO+nD,EAAYxyD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mCAAoC,SAAUzK,EAAGyK,GAE/C,OAAIm+C,EAAYn+C,EAAG,GACVzK,EAAEukB,QAEJwsC,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAE9C,OAAIm+C,EAAYn+C,EAAG,GACVzK,EAAEukB,QAEJysC,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,mCAAoC,SAAUuN,EAAGyK,GAE/C,OAAIm+C,EAAY5oD,EAAG,GACVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpBmP,EAAYjoD,EAAGzK,EAAGvN,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAE9C,OAAIm+C,EAAY5oD,EAAG,GACVq6C,EAAM5vC,EAAE03B,OAAQ13B,EAAE84C,WAEpByN,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,GAAG0F,WAG5B,4BAA6B,SAAUnQ,EAAGyK,GAExC,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,IAAI0F,gBC/GnBs5D,GAA4Br3E,GAT5B,MACQ,CACnB,QACA,SACA,cACA,QACA,QAGmE,YAAgD,IAA7CmiC,EAA6C,EAA7CA,MAAOutB,EAAsC,EAAtCA,OAAQ8G,EAA8B,EAA9BA,YAAavO,EAAiB,EAAjBA,MAAOqvB,EAAU,EAAVA,IACnG1W,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCqK,EAAcH,GAAkB,CAAEv+B,QAAOq0B,gBACzCmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzC+J,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA8BxC,OAAOA,EA5CI,MA4CQ,CAEjB,iBAAkBqmC,GAElB,mBAAoB,SAAU56D,EAAGyK,GAC/B,QAAiB,IAATzK,EAAEiK,IAAqB,IAATjK,EAAEkK,IAAuB,IAATO,EAAER,IAAqB,IAATQ,EAAEP,KAGxD,uBAAwB,SAAUlK,EAAGyK,GACnC,QAAQzK,EAAE8Z,UAAarP,EAAEqP,UAAa9Z,EAAE2J,SAAYc,EAAEd,UAGxD,aAAc,SAAU3J,EAAGyK,GACzB,OAAOhY,KAAKuN,EAAElM,OAAS,EAAG2W,EAAE3W,OAAS,IAGvC,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOwoD,EAAYjzD,EAAGyK,EAAGhY,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOuoD,EAAYhzD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAEhC,OAAIi/D,EAAIj/D,GAEC4vC,EAAMr6C,EAAEmiC,OAAQniC,EAAEujD,WAEpBwN,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAE/B,OAAIi/D,EAAIj/D,GAEC4vC,EAAMr6C,EAAEmiC,OAAQniC,EAAEujD,WAEpByN,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAEhC,OAAIi/D,EAAI1pE,GAECq6C,EAAMr6C,EAAEmiC,OAAQniC,EAAEujD,WAEpBwN,EAAYtmD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAE/B,OAAIi/D,EAAI1pE,GAECq6C,EAAMr6C,EAAEmiC,OAAQniC,EAAEujD,WAEpByN,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,GAAG0F,WAG5B,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,IAAI0F,gBC1HnBw5D,GAAgCv3E,GAXhC,UACQ,CACnB,QACA,SACA,SACA,cACA,YACA,WACA,gBAGuE,YAA8E,IAA3EmiC,EAA2E,EAA3EA,MAAO7Q,EAAoE,EAApEA,OAAQklC,EAA4D,EAA5DA,YAAa9G,EAA+C,EAA/CA,OAAQN,EAAuC,EAAvCA,UAAWt8B,EAA4B,EAA5BA,SAAUu8B,EAAkB,EAAlBA,YAC7HsS,EAAcP,GAAkB,CAAEj/B,UAClCy/B,EAAcP,GAAkB,CAAEl/B,QAAOq0B,gBACzCqL,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAuCxC,OAAOA,EAvDI,UAuDQ,CAEjB,mBAAoB,SAAUv0B,EAAGyK,GAC/B,OAAOzK,IAAMyK,EAAI,EAAKzK,EAAIyK,EAAI,GAAK,GAGrC,iBAAkB,SAAUzK,EAAGyK,GAC7B,OAAOiwC,GAAY16C,EAAGyK,EAAGiZ,EAAOi3B,SAC5B,EACC36C,EAAIyK,EAAI,GAAK,GAGpB,uBAAwB,SAAUzK,EAAGyK,GACnC,OAAO+9C,GAAexoD,EAAGyK,EAAGiZ,EAAOi3B,SAC/B,IAAI6G,EAAU,GACd,IAAIA,EAAUxhD,EAAEmZ,IAAI1O,KAG1B,qBAAsB,SAAUzK,EAAGyK,GACjC,OAAO,IAAIya,EAASllB,EAAE8gB,QAAQrW,KAGhC,mBAAoB,WAClB,MAAM,IAAI1O,UAAU,wDAGtB,aAAc,SAAUiE,EAAGyK,GACzB,IAAKzK,EAAE0oD,UAAUj+C,GACf,MAAM,IAAI4F,MAAM,4CAElB,OAAO5d,KAAKuN,EAAElM,MAAO2W,EAAE3W,QAGzB,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOupD,EAAYh0D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gB,oBC7ItCy5D,GAAuCx3E,GANvC,iBACQ,CACnB,QACA,YAG8E,YAAwB,IAArBmiC,EAAqB,EAArBA,MAAOzT,EAAc,EAAdA,QAClF+oD,EAAkB/oD,EAAQqW,WAAW,mBAsE3C,OAAO5C,EA7EI,iBA6EQ,CACjB,WAAY,SAAUv0B,EAAGyK,GACvB,IAEIvX,EAFE42E,EAAQlxB,EAAO54C,GACf+pE,EAAQnxB,EAAOnuC,GAIrB,KAAe,WAAVq/D,GAAgC,cAAVA,GAAmC,aAAVA,GACrC,WAAVC,GAAgC,cAAVA,GAAmC,aAAVA,GAElD,MAAqB,OADrB72E,EAAI4tB,EAAQ9gB,EAAGyK,IACT1V,WAEG7B,EAAI,EAAI,GAAK,EAEbwzB,KAAYojD,EAAOC,GAK9B,GAAc,UAAVD,GAA+B,WAAVA,GACX,UAAVC,GAA+B,WAAVA,EAEvB,OAAU,KADV72E,EA0DN,SAAS82E,EAA0BC,EAAgBjqE,EAAGyK,GACpD,GAAIysC,EAAel3C,IAAMk3C,EAAezsC,GACtC,OAAOy/D,EAAcD,EAAgBjqE,EAAEe,SAASb,OAAQuK,EAAE1J,SAASb,QAErE,GAAIg3C,EAAel3C,GAEjB,OAAOgqE,EAAyBC,EAAgBjqE,EAAEojD,UAAW34C,GAE/D,GAAIysC,EAAezsC,GAEjB,OAAOu/D,EAAyBC,EAAgBjqE,EAAGyK,EAAE24C,WAIvD,GAAInM,EAAcj3C,GAChB,OAAOgqE,EAAyBC,EAAgBjqE,EAAEe,SAAS2qB,KAAMjhB,GAEnE,GAAIwsC,EAAcxsC,GAChB,OAAOu/D,EAAyBC,EAAgBjqE,EAAGyK,EAAE1J,SAAS2qB,MAIhE,IAAK/oB,MAAMP,QAAQpC,GACjB,OAAOgqE,EAAyBC,EAAgB,CAACjqE,GAAIyK,GAEvD,IAAK9H,MAAMP,QAAQqI,GACjB,OAAOu/D,EAAyBC,EAAgBjqE,EAAG,CAACyK,IAGtD,OAAOy/D,EAAcD,EAAgBjqE,EAAGyK,GAvFhCu/D,CAAyBv3E,KAAMuN,EAAGyK,IAE7BvX,EAEAwzB,KAAYojD,EAAOC,GAK9B,GAAID,IAAUC,EACZ,OAAOrjD,KAAYojD,EAAOC,GAG5B,GAAc,YAAVD,EACF,OAoJR,SAAgC9pE,EAAGyK,GACjC,GAAIzK,EAAEiK,GAAKQ,EAAER,GAAM,OAAO,EAC1B,GAAIjK,EAAEiK,GAAKQ,EAAER,GAAM,OAAQ,EAE3B,GAAIjK,EAAEkK,GAAKO,EAAEP,GAAM,OAAO,EAC1B,GAAIlK,EAAEkK,GAAKO,EAAEP,GAAM,OAAQ,EAE3B,OAAO,EA3JMigE,CAAsBnqE,EAAGyK,GAGlC,GAAc,SAAVq/D,EACF,OAAI9pE,EAAE0oD,UAAUj+C,GACPhY,KAAKuN,EAAElM,MAAO2W,EAAE3W,OAIlBo2E,EAAcz3E,KAAMuN,EAAEoqE,cAAe3/D,EAAE2/D,eAGhD,GAAc,YAAVN,EACF,OAAOD,EAAgB7pE,EAAGyK,GAG5B,GAAc,WAAVq/D,EACF,OAAOpjD,KAAY1mB,EAAGyK,GAGxB,GAAc,WAAVq/D,EACF,OA6FN,SAAyBG,EAAgBjqE,EAAGyK,GAC1C,IAAM4/D,EAAQ92E,OAAOkS,KAAKzF,GACpBsqE,EAAQ/2E,OAAOkS,KAAKgF,GAG1B4/D,EAAMz5D,KAAK8V,MACX4jD,EAAM15D,KAAK8V,MACX,IAAMxzB,EAAIg3E,EAAcD,EAAgBI,EAAOC,GAC/C,GAAU,IAANp3E,EACF,OAAOA,EAIT,IAAK,IAAIL,EAAI,EAAGA,EAAIw3E,EAAM/zE,OAAQzD,IAAK,CACrC,IAAMqe,EAAI+4D,EAAejqE,EAAEqqE,EAAMx3E,IAAK4X,EAAE6/D,EAAMz3E,KAC9C,GAAU,IAANqe,EACF,OAAOA,EAIX,OAAO,EAjHIq5D,CAAe93E,KAAMuN,EAAGyK,GAGjC,GAAc,SAAVq/D,EACF,OAAO,EAGT,GAAc,cAAVA,EACF,OAAO,EAIT,MAAM,IAAI/tE,UAAU,8BAAgC+tE,EAAQ,QAsDhE,SAASI,EAAeD,EAAgBjqE,EAAGyK,GAEzC,IAAK,IAAI5X,EAAI,EAAGgnC,EAAK3kC,KAAKyQ,IAAI3F,EAAE1J,OAAQmU,EAAEnU,QAASzD,EAAIgnC,EAAIhnC,IAAK,CAC9D,IAAMqe,EAAI+4D,EAAejqE,EAAEnN,GAAI4X,EAAE5X,IACjC,GAAU,IAANqe,EACF,OAAOA,EAKX,OAAIlR,EAAE1J,OAASmU,EAAEnU,OAAiB,EAC9B0J,EAAE1J,OAASmU,EAAEnU,QAAkB,EAG5B,MCpNX,IAMak0E,GAAoCp4E,GANpC,cACQ,CACnB,QACA,WAG2E,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOutB,EAAa,EAAbA,OAC/E6Q,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA8BxC,OAAOA,EAtCI,cAsCQ,CAEjB,WAAYk2C,GAEZ,2BAA4B,SAAUzqE,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGggE,KAG3B,eAAgB,SAAUzqE,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mBAAoB,SAAUzK,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGggE,IAAc,IAGzC,mBAAoB,SAAUzqE,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGyqE,IAAc,IAGzC,aAAc,SAAUzqE,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGggE,IAAc,GAAOt6D,WAGxD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGyqE,IAAc,GAAMt6D,gBClE9Cu6D,GAA8Bt4E,GAR9B,QACQ,CACnB,QACA,SACA,cACA,gBAGqE,YAAiD,IAA9CmiC,EAA8C,EAA9CA,MAAOutB,EAAuC,EAAvCA,OAAQ8G,EAA+B,EAA/BA,YAAanH,EAAkB,EAAlBA,YAC9FsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA8CxC,OAAOA,EA3DI,QA2DQ,CAEjB,WAAY,SAAUv0B,EAAGyK,GAEvB,OAAU,OAANzK,EAA2B,OAANyK,EACf,OAANA,EAA2B,OAANzK,OACfzJ,IAANyJ,OAAgCzJ,IAANkU,OACpBlU,IAANkU,OAAgClU,IAANyJ,EAEvB4oD,EAAY5oD,EAAGyK,IAGxB,6BAA8B,SAAUzK,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGm+C,IAG3B,4BAA6B,SAAU5oD,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAG4oD,GAAa,IAGxC,4BAA6B,SAAU5oD,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGm+C,GAAa,IAGxC,2BAA4B,SAAU5oD,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGm+C,IAG3B,eAAgB,SAAU5oD,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGm+C,GAAa,IAGxC,mBAAoB,SAAU5oD,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGm+C,GAAa,IAGxC,oBAAqB,SAAU5oD,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAG4oD,GAAa,IAGxC,mBAAoB,SAAU5oD,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAG4oD,GAAa,IAGxC,aAAc,SAAU5oD,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGm+C,GAAa,GAAOz4C,WAGvD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAG4oD,GAAa,GAAMz4C,gBC3H7Cw6D,IDgIoBv4E,GAlIpB,QAkIkC,CAAC,QAAS,gBAAgB,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YACjF,OAAOr0B,EAnII,QAmIQ,CACjB,WAAY,SAAUv0B,EAAGyK,GAEvB,OAAU,OAANzK,EAA2B,OAANyK,EACf,OAANA,EAA2B,OAANzK,OACfzJ,IAANyJ,OAAgCzJ,IAANkU,OACpBlU,IAANkU,OAAgClU,IAANyJ,EAEvB4oD,EAAY5oD,EAAGyK,SCzImBrY,GAPlC,YACQ,CACnB,QACA,cACA,WAGyE,YAAoC,IAAjCmiC,EAAiC,EAAjCA,MAAOsnB,EAA0B,EAA1BA,YAAa/hC,EAAa,EAAbA,OA2BhG,OAAOya,EAlCI,YAkCQ,CACjB,WAAY,SAAUv0B,EAAGyK,GACvB,OAAOqP,EAAO+hC,EAAY77C,EAAGyK,WCrBtBmgE,GAAgCx4E,GARhC,UACQ,CACnB,QACA,SACA,SACA,gBAGuE,YAA4C,IAAzCmiC,EAAyC,EAAzCA,MAAO7Q,EAAkC,EAAlCA,OAAQo+B,EAA0B,EAA1BA,OAAQL,EAAkB,EAAlBA,YAC3FsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAiCxC,OAAOA,EA9CI,UA8CQ,CAEjB,mBAAoB,SAAUv0B,EAAGyK,GAC/B,OAAOzK,EAAIyK,GAGb,iBAAkB,SAAUzK,EAAGyK,GAC7B,OAAOzK,EAAIyK,IAAMiwC,GAAY16C,EAAGyK,EAAGiZ,EAAOi3B,UAG5C,uBAAwB,SAAU36C,EAAGyK,GACnC,OAAOzK,EAAEud,GAAG9S,KAAO+9C,GAAexoD,EAAGyK,EAAGiZ,EAAOi3B,UAGjD,qBAAsB,SAAU36C,EAAGyK,GACjC,OAAyB,IAAlBzK,EAAE8gB,QAAQrW,IAGnB,mBAAoB,SAAUzK,EAAGyK,GAC/B,MAAM,IAAI1O,UAAU,wDAGtB,aAAc,SAAUiE,EAAGyK,GACzB,IAAKzK,EAAE0oD,UAAUj+C,GACf,MAAM,IAAI4F,MAAM,4CAElB,OAAO5d,KAAKuN,EAAElM,MAAO2W,EAAE3W,QAGzB,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCzHtC06D,GAAkCz4E,GARlC,YACQ,CACnB,QACA,SACA,SACA,gBAGyE,YAA4C,IAAzCmiC,EAAyC,EAAzCA,MAAO7Q,EAAkC,EAAlCA,OAAQo+B,EAA0B,EAA1BA,OAAQL,EAAkB,EAAlBA,YAC7FsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA6BxC,OAAOA,EA1CI,YA0CQ,CAEjB,mBAAoB,SAAUv0B,EAAGyK,GAC/B,OAAOzK,GAAKyK,GAGd,iBAAkB,SAAUzK,EAAGyK,GAC7B,OAAOzK,GAAKyK,GAAKiwC,GAAY16C,EAAGyK,EAAGiZ,EAAOi3B,UAG5C,uBAAwB,SAAU36C,EAAGyK,GACnC,OAAOzK,EAAEuc,IAAI9R,IAAM+9C,GAAexoD,EAAGyK,EAAGiZ,EAAOi3B,UAGjD,qBAAsB,SAAU36C,EAAGyK,GACjC,OAAwB,IAAjBzK,EAAE8gB,QAAQrW,IAGnB,mBAAoB,WAClB,MAAM,IAAI1O,UAAU,wDAGtB,aAAc,SAAUiE,EAAGyK,GACzB,IAAKzK,EAAE0oD,UAAUj+C,GACf,MAAM,IAAI4F,MAAM,4CAElB,OAAO5d,KAAKuN,EAAElM,MAAO2W,EAAE3W,QAGzB,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCrHtC26D,GAA+B14E,GAR/B,SACQ,CACnB,QACA,SACA,SACA,gBAGsE,YAA4C,IAAzCmiC,EAAyC,EAAzCA,MAAO7Q,EAAkC,EAAlCA,OAAQo+B,EAA0B,EAA1BA,OAAQL,EAAkB,EAAlBA,YAC1FsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAiCxC,OAAOA,EA9CI,SA8CQ,CAEjB,mBAAoB,SAAUv0B,EAAGyK,GAC/B,OAAOzK,EAAIyK,GAGb,iBAAkB,SAAUzK,EAAGyK,GAC7B,OAAOzK,EAAIyK,IAAMiwC,GAAY16C,EAAGyK,EAAGiZ,EAAOi3B,UAG5C,uBAAwB,SAAU36C,EAAGyK,GACnC,OAAOzK,EAAEkZ,GAAGzO,KAAO+9C,GAAexoD,EAAGyK,EAAGiZ,EAAOi3B,UAGjD,qBAAsB,SAAU36C,EAAGyK,GACjC,OAAwB,IAAjBzK,EAAE8gB,QAAQrW,IAGnB,mBAAoB,WAClB,MAAM,IAAI1O,UAAU,wDAGtB,aAAc,SAAUiE,EAAGyK,GACzB,IAAKzK,EAAE0oD,UAAUj+C,GACf,MAAM,IAAI4F,MAAM,4CAElB,OAAO5d,KAAKuN,EAAElM,MAAO2W,EAAE3W,QAGzB,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCzHtC46D,GAAiC34E,GARjC,WACQ,CACnB,QACA,SACA,SACA,gBAGwE,YAA4C,IAAzCmiC,EAAyC,EAAzCA,MAAO7Q,EAAkC,EAAlCA,OAAQo+B,EAA0B,EAA1BA,OAAQL,EAAkB,EAAlBA,YAC5FsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA6BxC,OAAOA,EA1CI,WA0CQ,CAEjB,mBAAoB,SAAUv0B,EAAGyK,GAC/B,OAAOzK,GAAKyK,GAGd,iBAAkB,SAAUzK,EAAGyK,GAC7B,OAAOzK,GAAKyK,GAAKiwC,GAAY16C,EAAGyK,EAAGiZ,EAAOi3B,UAG5C,uBAAwB,SAAU36C,EAAGyK,GACnC,OAAOzK,EAAEsb,IAAI7Q,IAAM+9C,GAAexoD,EAAGyK,EAAGiZ,EAAOi3B,UAGjD,qBAAsB,SAAU36C,EAAGyK,GACjC,OAAyB,IAAlBzK,EAAE8gB,QAAQrW,IAGnB,mBAAoB,WAClB,MAAM,IAAI1O,UAAU,wDAGtB,aAAc,SAAUiE,EAAGyK,GACzB,IAAKzK,EAAE0oD,UAAUj+C,GACf,MAAM,IAAI4F,MAAM,4CAElB,OAAO5d,KAAKuN,EAAElM,MAAO2W,EAAE3W,QAGzB,6BAA8B,SAAUkM,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAGhY,OAG3B,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAGhY,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,oBAAqB,SAAUuN,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,mBAAoB,SAAUuN,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,aAAc,SAAUuN,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBC9HtC66D,GAAkC54E,GANlC,YACQ,CACnB,QACA,UAGyE,YAAsB,IAAnBmiC,EAAmB,EAAnBA,MAAO+iC,EAAY,EAAZA,MA8BnF,OAAO/iC,EApCI,YAoCQ,CACjB,WAAY,SAAUv0B,EAAGyK,GACvB,OAUJ,SAASwgE,EAAYjrE,EAAGyK,GACtB,GAAI9H,MAAMP,QAAQpC,GAAI,CACpB,GAAI2C,MAAMP,QAAQqI,GAAI,CACpB,IAAM3G,EAAM9D,EAAE1J,OACd,GAAIwN,IAAQ2G,EAAEnU,OACZ,OAAO,EAGT,IAAK,IAAIzD,EAAI,EAAGA,EAAIiR,EAAKjR,IACvB,IAAKo4E,EAAWjrE,EAAEnN,GAAI4X,EAAE5X,IACtB,OAAO,EAIX,OAAO,EAEP,OAAO,EAGT,OAAI8P,MAAMP,QAAQqI,IAGT6sD,EAAMt3D,EAAGyK,GAhCXwgE,CAAWjrE,EAAEmQ,UAAW1F,EAAE0F,iBCxB1B+6D,GAAgC94E,GAThC,UACQ,CACnB,QACA,SACA,cACA,SACA,gBAGuE,YAAyD,IAAtDmiC,EAAsD,EAAtDA,MAAeq0B,GAAuC,EAA/CllC,OAA+C,EAAvCklC,aAAa9G,EAA0B,EAA1BA,OAAQL,EAAkB,EAAlBA,YACxGsS,EAAcP,GAAkB,CAAEj/B,UAClC2lC,EAAcJ,GAAkB,CAAEvlC,QAAOktB,gBACzCwS,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA6CxC,OAAOA,EAAM,UAAW,CAEtB,WAAY,SAAUv0B,EAAGyK,GAEvB,OAAU,OAANzK,EAA2B,OAANyK,EACf,OAANA,EAA2B,OAANzK,OACfzJ,IAANyJ,OAAgCzJ,IAANkU,OACpBlU,IAANkU,OAAgClU,IAANyJ,EAEvBmrE,EAASnrE,EAAGyK,IAGrB,6BAA8B,SAAUzK,EAAGyK,GACzC,OAAOyvD,EAAYl6D,EAAGyK,EAAG0gE,IAG3B,4BAA6B,SAAUnrE,EAAGyK,GACxC,OAAOspD,EAAYtpD,EAAGzK,EAAGmrE,GAAU,IAGrC,4BAA6B,SAAUnrE,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAG0gE,GAAU,IAGrC,2BAA4B,SAAUnrE,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAG0gE,IAG3B,eAAgB,SAAUnrE,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,oBAAqB,SAAUzK,EAAGyK,GAChC,OAAOwpD,EAAYj0D,EAAGyK,EAAG0gE,GAAU,IAGrC,mBAAoB,SAAUnrE,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAG0gE,GAAU,IAGrC,oBAAqB,SAAUnrE,EAAGyK,GAChC,OAAOwpD,EAAYxpD,EAAGzK,EAAGmrE,GAAU,IAGrC,mBAAoB,SAAUnrE,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGmrE,GAAU,IAGrC,aAAc,SAAUnrE,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAG0gE,GAAU,GAAOh7D,WAGpD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGmrE,GAAU,GAAMh7D,aAIrD,SAASg7D,EAAUnrE,EAAGyK,GACpB,OAAQm+C,EAAY5oD,EAAGyK,OClId2gE,IDsIsBh5E,GAtItB,UAsIoC,CAAC,QAAS,gBAAgB,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOq0B,EAAkB,EAAlBA,YACnF,OAAOr0B,EAvII,UAuIQ,CACjB,WAAY,SAAUv0B,EAAGyK,GAEvB,OAAU,OAANzK,EAA2B,OAANyK,EACf,OAANA,EAA2B,OAANzK,OACfzJ,IAANyJ,OAAgCzJ,IAANkU,OACpBlU,IAANkU,OAAgClU,IAANyJ,GAEtB4oD,EAAY5oD,EAAGyK,SC/IwBrY,GAHxC,kBACQ,CAAC,QAAS,YAAa,QAAS,YAE4B,YAA0C,IAAvCmiC,EAAuC,EAAvCA,MAAO0zB,EAAgC,EAAhCA,UAAWt+C,EAAqB,EAArBA,MAAOmX,EAAc,EAAdA,QACrGuqD,EAAMvqD,EACNpL,EAAO,SAAChN,EAAGC,GAAJ,OAAWmY,EAAQpY,EAAGC,IAkCnC,OAAO4rB,EAvCI,kBAuCQ,CACjB,yBAA0B,SAAUv0B,EAAGkD,GACrC,OAAOooE,EAAiBtrE,EAAGkD,EAAGmoE,IAGhC,iCAAkC,SAAUrrE,EAAGkD,EAAG4d,GAChD,GAAgB,QAAZA,EACF,OAAOwqD,EAAiBtrE,EAAGkD,EAAGmoE,GACzB,GAAgB,SAAZvqD,EACT,OAAOwqD,EAAiBtrE,EAAGkD,EAAGwS,GAE9B,MAAM,IAAIrF,MAAM,2CAIpB,mCAAoCi7D,IAGtC,SAASA,EAAkBtrE,EAAGkD,EAAG4d,GAC/B,IAAK7D,EAAU/Z,IAAMA,EAAI,EACvB,MAAM,IAAImN,MAAM,oCAGlB,GAAI0mC,EAAS/2C,GAAI,CAEf,GADaA,EAAEmiC,OACN7rC,OAAS,EAChB,MAAM,IAAI+Z,MAAM,2CAElB,OAAOk7D,EAAYvrE,EAAEmQ,UAAWjN,EAAG4d,GAGrC,GAAIne,MAAMP,QAAQpC,GAChB,OAAOurE,EAAYvrE,EAAGkD,EAAG4d,GAc7B,SAASyqD,EAAarmE,EAAKhC,EAAG4d,GAC5B,GAAI5d,GAAKgC,EAAI5O,OACX,MAAM,IAAI+Z,MAAM,mBAIlB,IAAK,IAAIxd,EAAI,EAAGA,EAAIqS,EAAI5O,OAAQzD,IAC9B,GAAIo1D,EAAU/iD,EAAIrS,KAAO8W,EAAMzE,EAAIrS,IACjC,OAAOqS,EAAIrS,GAQf,IAJA,IAAImT,EAAO,EACPC,EAAKf,EAAI5O,OAAS,EAGf0P,EAAOC,GAAI,CAMhB,IALA,IAAItS,EAAIqS,EACJ8R,EAAI7R,EACFulE,EAAQtmE,EAAIhQ,KAAKwW,MAAMxW,KAAKkvB,UAAYne,EAAKD,EAAO,IAAMA,GAGzDrS,EAAImkB,GAET,GAAIgJ,EAAQ5b,EAAIvR,GAAI63E,IAAU,EAAG,CAC/B,IAAMphE,EAAMlF,EAAI4S,GAChB5S,EAAI4S,GAAK5S,EAAIvR,GACbuR,EAAIvR,GAAKyW,IACP0N,QAEAnkB,EAKFmtB,EAAQ5b,EAAIvR,GAAI63E,GAAS,KACzB73E,EAIAuP,GAAKvP,EACPsS,EAAKtS,EAELqS,EAAOrS,EAAI,EAIf,OAAOuR,EAAIhC,QClIFuoE,GAA6Br5E,GAH7B,OACQ,CAAC,QAAS,SAAU,UAAW,mBAEkB,YAAgD,IAA7CmiC,EAA6C,EAA7CA,MAAOutB,EAAsC,EAAtCA,OAAQhhC,EAA8B,EAA9BA,QAASmpD,EAAqB,EAArBA,eACzFyB,EAAa5qD,EACb6qD,EAAc,SAACjjE,EAAGC,GAAJ,OAAWmY,EAAQpY,EAAGC,IAiC1C,OAAO4rB,EAtCI,OAsCQ,CACjB5xB,MAAO,SAAU3C,GAEf,OADA4rE,EAAe5rE,GACRA,EAAE4Q,KAAK86D,IAGhBpoB,OAAQ,SAAUtjD,GAEhB,OADA6rE,EAAgB7rE,GACT8hD,EAAO9hD,EAAEojD,UAAUxyC,KAAK86D,GAAa1rE,EAAEujD,YAGhD,kBAAmB,SAAUvjD,EAAG8rE,GAE9B,OADAF,EAAe5rE,GACRA,EAAE4Q,KAAKk7D,IAGhB,mBAAoB,SAAU9rE,EAAG8rE,GAE/B,OADAD,EAAgB7rE,GACT8hD,EAAO9hD,EAAEojD,UAAUxyC,KAAKk7D,GAAc9rE,EAAEujD,YAGjD,gBAAiB,SAAUvjD,EAAG+rE,GAE5B,OADAH,EAAe5rE,GACRA,EAAE4Q,KAAKk7D,EAAYC,KAG5B,iBAAkB,SAAU/rE,EAAG+rE,GAE7B,OADAF,EAAgB7rE,GACT8hD,EAAO9hD,EAAEojD,UAAUxyC,KAAKk7D,EAAYC,IAAS/rE,EAAEujD,cAS1D,SAASuoB,EAAaC,GACpB,GAAc,QAAVA,EACF,OAAOL,EACF,GAAc,SAAVK,EACT,OAAOJ,EACF,GAAc,YAAVI,EACT,OAAO9B,EAEP,MAAM,IAAI55D,MAAM,+CAUpB,SAASu7D,EAAgBpoE,GACvB,GAA2B,IAAvB2+B,GAAK3+B,GAAOlN,OACd,MAAM,IAAI+Z,MAAM,kCAUpB,SAASw7D,EAAiB/pB,GACxB,GAA6B,IAAzBA,EAAO3f,OAAO7rC,OAChB,MAAM,IAAI+Z,MAAM,uCCvGT27D,GAA4B55E,GAH5B,MACQ,CAAC,QAAS,SAAU,UAAW,WAEiB,YAAwC,IAArCmiC,EAAqC,EAArCA,MAAO7Q,EAA8B,EAA9BA,OAAQghD,EAAsB,EAAtBA,QAASjF,EAAa,EAAbA,OAgC9F,OAAOlrC,EAnCI,MAmCQ,CAEjB,iBAAkB03C,EAGlB,qCAAsC,SAAUzoE,EAAO84C,GACrD,OAAOuB,GAAOr6C,EAAO84C,EAAInsC,UAAW+7D,IAItC,MAAO,SAAUj8D,GACf,GAAIq2C,GAAoBr2C,GACtB,MAAM,IAAIlU,UAAU,0CAGtB,OAAOkwE,EAAKh8D,MAWhB,SAASi8D,EAAUlsE,EAAGyK,GACpB,IACE,OAAOg1D,EAAOz/D,EAAGyK,GAAKzK,EAAIyK,EAC1B,MAAO8sB,GACP,MAAM+sC,GAAoB/sC,EAAK,MAAO9sB,IAU1C,SAASwhE,EAAMzoE,GACb,IAAIwH,EAcJ,GAZAu7C,GAAY/iD,GAAO,SAAU1P,GAC3B,IACM6V,MAAM7V,IAA2B,iBAAVA,EACzBkX,EAAMzD,UACWhR,IAARyU,GAAqBy0D,EAAO3rE,EAAOkX,MAC5CA,EAAMlX,GAER,MAAOyjC,GACP,MAAM+sC,GAAoB/sC,EAAK,MAAOzjC,YAI9ByC,IAARyU,EACF,MAAM,IAAIqF,MAAM,0CAQlB,MAJmB,iBAARrF,IACTA,EAAM05D,EAAQ15D,EAAK0Y,EAAO5N,SAGrB9K,MChGEmhE,GAA4B/5E,GAH5B,MACQ,CAAC,QAAS,SAAU,UAAW,YAEiB,YAAyC,IAAtCmiC,EAAsC,EAAtCA,MAAO7Q,EAA+B,EAA/BA,OAAQghD,EAAuB,EAAvBA,QAASnN,EAAc,EAAdA,QAgC9F,OAAOhjC,EAnCI,MAmCQ,CAEjB,iBAAkB63C,EAGlB,qCAAsC,SAAU5oE,EAAO84C,GACrD,OAAOuB,GAAOr6C,EAAO84C,EAAInsC,UAAWk8D,IAItC,MAAO,SAAUp8D,GACf,GAAIq2C,GAAoBr2C,GACtB,MAAM,IAAIlU,UAAU,0CAGtB,OAAOqwE,EAAKn8D,MAWhB,SAASo8D,EAAWrsE,EAAGyK,GACrB,IACE,OAAO8sD,EAAQv3D,EAAGyK,GAAKzK,EAAIyK,EAC3B,MAAO8sB,GACP,MAAM+sC,GAAoB/sC,EAAK,MAAO9sB,IAU1C,SAAS2hE,EAAM5oE,GACb,IAAImC,EAcJ,GAZA4gD,GAAY/iD,GAAO,SAAU1P,GAC3B,IACM6V,MAAM7V,IAA2B,iBAAVA,EACzB6R,EAAM4B,UACWhR,IAARoP,GAAqB4xD,EAAQzjE,EAAO6R,MAC7CA,EAAM7R,GAER,MAAOyjC,GACP,MAAM+sC,GAAoB/sC,EAAK,MAAOzjC,YAI9ByC,IAARoP,EACF,MAAM,IAAI0K,MAAM,0CAQlB,MAJmB,iBAAR1K,IACTA,EAAM++D,EAAQ/+D,EAAK+d,EAAO5N,SAGrBnQ,MC7FE2mE,GAAkDl6E,GANlD,uBACQ,CACnB,UACA,gBAGyF,YAA8B,IAA3BmlE,EAA2B,EAA3BA,QAAS9V,EAAkB,EAAlBA,YACrG,SAAS8qB,EAAsB7gD,EAAM83B,GACnC,KAAM/wD,gBAAgB85E,GAAyB,MAAM,IAAI/jE,YAAY,oDACrE,GAAIg7C,IAAa1M,EAAS0M,GAAa,MAAM,IAAInzC,MAAM,qBAAuBmzC,GAE9E,GAAIzM,EAASrrB,IAAStpB,EAAQspB,GAAO,CAEnC,IAAMo2B,EAAS,IAAIL,EAAY/1B,EAAM83B,GAErC/wD,KAAKmxD,MAAQ9B,EAAO8B,MACpBnxD,KAAKoxD,MAAQ/B,EAAO+B,MACpBpxD,KAAKqxD,UAAYhC,EAAOgC,UACxBrxD,KAAK25E,KAAO,KACZ35E,KAAKw5E,KAAO,UACP,GAAIvgD,GAAQtpB,EAAQspB,EAAKA,OAAStpB,EAAQspB,EAAKyW,MAEpD1vC,KAAKmxD,MAAQl4B,EAAKA,KAClBj5B,KAAKoxD,MAAQn4B,EAAKyW,KAClB1vC,KAAKqxD,UAAYp4B,EAAK83B,SACtB/wD,KAAK25E,UAA2B,IAAb1gD,EAAK/lB,IAAsB+lB,EAAK/lB,IAAM,KACzDlT,KAAKw5E,UAA2B,IAAbvgD,EAAK9oB,IAAsB8oB,EAAK9oB,IAAM,SACpD,IAAI8oB,EAET,MAAM,IAAI3vB,UAAU,6BAA+B68C,EAAOltB,GAAQ,KAGlEj5B,KAAKmxD,MAAQ,GACbnxD,KAAKoxD,MAAQ,CAAC,GACdpxD,KAAKqxD,UAAYN,EACjB/wD,KAAK25E,KAAO,KACZ35E,KAAKw5E,KAAO,MA8KhB,OA1KAM,EAAqB93E,UAAY,IAAIgtD,EAKrC8qB,EAAqB93E,UAAU8K,KAAO,uBACtCgtE,EAAqB93E,UAAU+3E,wBAAyB,EAexDD,EAAqB93E,UAAUgvD,OAAS,SAAUpjD,GAChD,OAAQhK,UAAUC,QAChB,KAAK,EAGH,IAAMrD,EAAIwuD,EAAYhtD,UAAUgvD,OAAOzwD,KAAKP,KAAM4N,GAElD,OAAI02C,EAAS9jD,GAEJ,IAAIs5E,EAAqB,CAC9B7gD,KAAMz4B,EAAE2wD,MACRzhB,KAAMlvC,EAAE4wD,MACRL,SAAUvwD,EAAE6wD,YAGT7wD,EAGT,KAAK,EACL,KAAK,EACH,MAAM,IAAIod,MAAM,4DAElB,QACE,MAAM,IAAI7H,YAAY,+BAa5B+jE,EAAqB93E,UAAUiG,IAAM,WACnC,MAAM,IAAI2V,MAAM,sDAelBk8D,EAAqB93E,UAAUioD,OAAS,WACtC,MAAM,IAAIrsC,MAAM,yDAQlBk8D,EAAqB93E,UAAUuoD,QAAU,WACvC,MAAM,IAAI3sC,MAAM,0DAOlBk8D,EAAqB93E,UAAU8vB,MAAQ,WACrC,OAAO,IAAIgoD,EAAqB,CAC9B7gD,KAAMnH,GAAM9xB,KAAKmxD,OACjBzhB,KAAM5d,GAAM9xB,KAAKoxD,OACjBL,SAAU/wD,KAAKqxD,aAQnByoB,EAAqB93E,UAAUsM,OAAS,WACtC,MAAO,CACLkhD,OAAQ,uBACRv2B,KAAMj5B,KAAKmxD,MACXzhB,KAAM1vC,KAAKoxD,MACXL,SAAU/wD,KAAKqxD,YAWnByoB,EAAqBrqB,SAAW,SAAUC,GACxC,OAAO,IAAIoqB,EAAqBpqB,IAWlCoqB,EAAqB93E,UAAUmxD,SAAW,WACxC,MAAM,IAAIv1C,MAAM,2DAOlBk8D,EAAqB93E,UAAUkR,IAAM,WAEnC,GAAkB,OAAdlT,KAAK25E,KAAe,CAEtB,IAAIn5E,EAAI,KAERR,KAAKiE,SAAQ,SAAUwa,IACX,OAANje,GAAcskE,EAAQrmD,EAAGje,MAAMA,EAAIie,MAEzCze,KAAK25E,KAAa,OAANn5E,EAAaA,OAAIsD,EAE/B,OAAO9D,KAAK25E,MAOdG,EAAqB93E,UAAUmO,IAAM,WAEnC,GAAkB,OAAdnQ,KAAKw5E,KAAe,CAEtB,IAAIh5E,EAAI,KAERR,KAAKiE,SAAQ,SAAUwa,IACX,OAANje,GAAcskE,EAAQtkE,EAAGie,MAAMje,EAAIie,MAEzCze,KAAKw5E,KAAa,OAANh5E,EAAaA,OAAIsD,EAE/B,OAAO9D,KAAKw5E,MAGPM,IACN,CAAEnqB,SAAS,IC/MDqqB,GAAmCr6E,GAHnC,QACQ,CAAC,yBAEsD,YAA8B,IAA3Bm6E,EAA2B,EAA3BA,qBAqB7E,SAAShR,EAAOmR,GACd,KAAMj6E,gBAAgB8oE,GACpB,MAAM,IAAI/yD,YAAY,oDAGxB/V,KAAKk6E,YAAc,GACnBl6E,KAAKm6E,WAAY,EAEjB,IAAK,IAAI/5E,EAAI,EAAGgnC,EAAKxjC,UAAUC,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CAClD,IAAMgR,EAAMxN,UAAUxD,GAEtB,GAAIskD,EAAQtzC,GACVpR,KAAKk6E,YAAYz+D,KAAKrK,GACtBpR,KAAKm6E,WAAY,OACZ,GAAIjqE,MAAMP,QAAQyB,IAAQkzC,EAASlzC,GAAM,CAE9C,IAAM5Q,EAAI45E,EAAuBhpE,EAAIsM,WACrC1d,KAAKk6E,YAAYz+D,KAAKjb,GAEtB,IAAMkvC,EAAOlvC,EAAEkvC,OAEK,IAAhBA,EAAK7rC,QAA4B,IAAZ6rC,EAAK,KAC5B1vC,KAAKm6E,WAAY,QAEd,GAAmB,iBAAR/oE,EAChBpR,KAAKk6E,YAAYz+D,KAAK2+D,EAAuB,CAAChpE,SACzC,IAAmB,iBAARA,EAIhB,MAAM,IAAI9H,UAAU,gEAFpBtJ,KAAKk6E,YAAYz+D,KAAKrK,KAc5B,SAASgpE,EAAwBhpE,GAE/B,IAAK,IAAIhR,EAAI,EAAGC,EAAI+Q,EAAIvN,OAAQzD,EAAIC,EAAGD,IACrC,GAAsB,iBAAXgR,EAAIhR,KAAoBoqB,EAAUpZ,EAAIhR,IAC/C,MAAM,IAAIkJ,UAAU,qDAIxB,OAAO,IAAIwwE,EAAqB1oE,GAmMlC,OA9MA03D,EAAM9mE,UAAU8K,KAAO,QACvBg8D,EAAM9mE,UAAU2iD,SAAU,EAkB1BmkB,EAAM9mE,UAAU8vB,MAAQ,WACtB,IAAMlkB,EAAQ,IAAIk7D,EAGlB,OAFAl7D,EAAMssE,YAAcpoD,GAAM9xB,KAAKk6E,aAC/BtsE,EAAMusE,UAAYn6E,KAAKm6E,UAChBvsE,GAUTk7D,EAAMpnE,OAAS,SAAUu4E,GACvB,IAAMrsE,EAAQ,IAAIk7D,EAElB,OADAA,EAAMliE,MAAMgH,EAAOqsE,GACZrsE,GAQTk7D,EAAM9mE,UAAU0tC,KAAO,WAGrB,IAFA,IAAMA,EAAO,GAEJtvC,EAAI,EAAGgnC,EAAKpnC,KAAKk6E,YAAYr2E,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CACzD,IAAMM,EAAIV,KAAKk6E,YAAY95E,GAC3BsvC,EAAKtvC,GAAmB,iBAANM,EAAkB,EAAIA,EAAEgvC,OAAO,GAGnD,OAAOA,GAQTo5B,EAAM9mE,UAAUmO,IAAM,WAGpB,IAFA,IAAM1C,EAAS,GAENrN,EAAI,EAAGgnC,EAAKpnC,KAAKk6E,YAAYr2E,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CACzD,IAAMsxD,EAAQ1xD,KAAKk6E,YAAY95E,GAC/BqN,EAAOrN,GAAuB,iBAAVsxD,EAAsBA,EAAQA,EAAMvhD,MAG1D,OAAO1C,GAQTq7D,EAAM9mE,UAAUkR,IAAM,WAGpB,IAFA,IAAMzF,EAAS,GAENrN,EAAI,EAAGgnC,EAAKpnC,KAAKk6E,YAAYr2E,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CACzD,IAAMsxD,EAAQ1xD,KAAKk6E,YAAY95E,GAC/BqN,EAAOrN,GAAuB,iBAAVsxD,EAAsBA,EAAQA,EAAMx+C,MAG1D,OAAOzF,GAUTq7D,EAAM9mE,UAAUiC,QAAU,SAAUumC,GAClC,IAAK,IAAIpqC,EAAI,EAAGgnC,EAAKpnC,KAAKk6E,YAAYr2E,OAAQzD,EAAIgnC,EAAIhnC,IACpDoqC,EAASxqC,KAAKk6E,YAAY95E,GAAIA,EAAGJ,OAUrC8oE,EAAM9mE,UAAU2vD,UAAY,SAAU9H,GACpC,OAAO7pD,KAAKk6E,YAAYrwB,IAAQ,MAOlCif,EAAM9mE,UAAUq4E,iBAAmB,WACjC,OAAmC,IAA5Br6E,KAAKk6E,YAAYr2E,QAA+C,iBAAxB7D,KAAKk6E,YAAY,IAQlEpR,EAAM9mE,UAAUs4E,kBAAoB,WAClC,OAAOt6E,KAAKq6E,mBAAqBr6E,KAAKk6E,YAAY,GAAK,MAWzDpR,EAAM9mE,UAAUwvD,SAAW,WACzB,OAAOxxD,KAAKm6E,WASdrR,EAAM9mE,UAAU2uD,QAAU,WAExB,IADA,IAAM5/C,EAAQ,GACL3Q,EAAI,EAAGgnC,EAAKpnC,KAAKk6E,YAAYr2E,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CACzD,IAAMuxD,EAAY3xD,KAAKk6E,YAAY95E,GACnC2Q,EAAM0K,KAA2B,iBAAdk2C,EAA0BA,EAAYA,EAAUhB,WAErE,OAAO5/C,GAST+3D,EAAM9mE,UAAU0b,QAAUorD,EAAM9mE,UAAU2uD,QAO1CmY,EAAM9mE,UAAUM,SAAW,WAGzB,IAFA,IAAMi4E,EAAU,GAEPn6E,EAAI,EAAGgnC,EAAKpnC,KAAKk6E,YAAYr2E,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CACzD,IAAMuxD,EAAY3xD,KAAKk6E,YAAY95E,GACV,iBAAduxD,EACT4oB,EAAQ9+D,KAAK4+C,KAAKh9C,UAAUs0C,IAE5B4oB,EAAQ9+D,KAAKk2C,EAAUrvD,YAI3B,MAAO,IAAMi4E,EAAQ3rE,KAAK,MAAQ,KASpCk6D,EAAM9mE,UAAUsM,OAAS,WACvB,MAAO,CACLkhD,OAAQ,QACRgrB,WAAYx6E,KAAKk6E,cAWrBpR,EAAMrZ,SAAW,SAAUC,GACzB,OAAOoZ,EAAMpnE,OAAOguD,EAAK8qB,aAGpB1R,IACN,CAAEnZ,SAAS,IC9QD8qB,GAA2C96E,GAH3C,gBACQ,CAAC,UAAW,WAEmD,YAAyB,IAAtBmlE,EAAsB,EAAtBA,QAASkI,EAAa,EAAbA,OACxF0N,EAAgB,EAAMj4E,KAAK6T,KAAK,EAAM7T,KAAKiV,KAAK,IAAQ,GAO9D,SAASijE,IACP,KAAM36E,gBAAgB26E,GAAkB,MAAM,IAAI5kE,YAAY,oDAG9D/V,KAAK46E,SAAW,KAChB56E,KAAKoxD,MAAQ,EA0Kf,SAASypB,EAAMrP,EAAS/wB,EAAMluC,GAE5BkuC,EAAKzC,KAAKC,MAAQwC,EAAKxC,MACvBwC,EAAKxC,MAAMD,KAAOyC,EAAKzC,KACvBzrC,EAAOuuE,SAEHvuE,EAAOw9C,QAAUtP,IAAQluC,EAAOw9C,MAAQtP,EAAKxC,OAE3B,IAAlB1rC,EAAOuuE,SAAgBvuE,EAAOw9C,MAAQ,MAE1CtP,EAAKzC,KAAOwzB,EACZ/wB,EAAKxC,MAAQuzB,EAAQvzB,MACrBuzB,EAAQvzB,MAAQwC,EAChBA,EAAKxC,MAAMD,KAAOyC,EAElBA,EAAKluC,OAAS,KAEdkuC,EAAKwE,MAAO,EArLd07B,EAAc34E,UAAU8K,KAAO,gBAC/B6tE,EAAc34E,UAAU+4E,iBAAkB,EAQ1CJ,EAAc34E,UAAUg5E,OAAS,SAAUr5E,EAAKN,GAE9C,IAAMo5C,EAAO,CACX94C,IAAKA,EACLN,MAAOA,EACPy5E,OAAQ,GAGV,GAAI96E,KAAK46E,SAAU,CAEjB,IAAMpP,EAAUxrE,KAAK46E,SAErBngC,EAAKzC,KAAOwzB,EACZ/wB,EAAKxC,MAAQuzB,EAAQvzB,MACrBuzB,EAAQvzB,MAAQwC,EAChBA,EAAKxC,MAAMD,KAAOyC,EAEdqqB,EAAQnjE,EAAK6pE,EAAQ7pE,OAEvB3B,KAAK46E,SAAWngC,QAIlBA,EAAKzC,KAAOyC,EACZA,EAAKxC,MAAQwC,EAEbz6C,KAAK46E,SAAWngC,EAKlB,OAFAz6C,KAAKoxD,QAEE3W,GAOTkgC,EAAc34E,UAAU0tC,KAAO,WAC7B,OAAO1vC,KAAKoxD,OAOdupB,EAAc34E,UAAUgwC,MAAQ,WAC9BhyC,KAAK46E,SAAW,KAChB56E,KAAKoxD,MAAQ,GAOfupB,EAAc34E,UAAUi5E,QAAU,WAChC,OAAsB,IAAfj7E,KAAKoxD,OAQdupB,EAAc34E,UAAUk5E,eAAiB,WAEvC,IAAMzgC,EAAOz6C,KAAK46E,SAElB,GAAa,OAATngC,EAAiB,OAAOA,EAQ5B,IANA,IAAI+wB,EAAUxrE,KAAK46E,SAEfO,EAAmB1gC,EAAKqgC,OAExBvtE,EAAIktC,EAAKsP,MAENoxB,EAAmB,GAAG,CAE3B,IAAMC,EAAY7tE,EAAE0qC,MAEpB1qC,EAAEyqC,KAAKC,MAAQ1qC,EAAE0qC,MACjB1qC,EAAE0qC,MAAMD,KAAOzqC,EAAEyqC,KAEjBzqC,EAAEyqC,KAAOwzB,EACTj+D,EAAE0qC,MAAQuzB,EAAQvzB,MAClBuzB,EAAQvzB,MAAQ1qC,EAChBA,EAAE0qC,MAAMD,KAAOzqC,EAEfA,EAAEhB,OAAS,KACXgB,EAAI6tE,EACJD,IAoBF,OAjBA1gC,EAAKzC,KAAKC,MAAQwC,EAAKxC,MACvBwC,EAAKxC,MAAMD,KAAOyC,EAAKzC,KAIrBwzB,EAFE/wB,IAASA,EAAKxC,MAEN,KA6Hd,SAA2BuzB,EAAS97B,GAElC,IAeI13B,EAfE0xC,EAAYjnD,KAAKwW,MAAMxW,KAAK6T,IAAIo5B,GAAQgrC,GAAiB,EAEzD3pE,EAAQ,IAAIb,MAAMw5C,GAEpB2xB,EAAW,EACX9tE,EAAIi+D,EACR,GAAIj+D,EAGF,IAFA8tE,IACA9tE,EAAIA,EAAE0qC,MACC1qC,IAAMi+D,GACX6P,IACA9tE,EAAIA,EAAE0qC,MAMV,KAAOojC,EAAW,GAAG,CAMnB,IAJA,IAAI36E,EAAI6M,EAAEutE,OAEJ16D,EAAO7S,EAAE0qC,MAIbjgC,EAAIjH,EAAMrQ,IAFC,CAKX,GAAIssE,EAAOz/D,EAAE5L,IAAKqW,EAAErW,KAAM,CACxB,IAAMgX,EAAOX,EACbA,EAAIzK,EACJA,EAAIoL,EAGN2iE,EAAWtjE,EAAGzK,GAEdwD,EAAMrQ,GAAK,KACXA,IAGFqQ,EAAMrQ,GAAK6M,EAEXA,EAAI6S,EACJi7D,IAGF7P,EAAU,KAEV,IAAK,IAAIprE,EAAI,EAAGA,EAAIspD,EAAWtpD,KAE7B4X,EAAIjH,EAAM3Q,MAGNorE,GAEFxzD,EAAEggC,KAAKC,MAAQjgC,EAAEigC,MACjBjgC,EAAEigC,MAAMD,KAAOhgC,EAAEggC,KAEjBhgC,EAAEggC,KAAOwzB,EACTxzD,EAAEigC,MAAQuzB,EAAQvzB,MAClBuzB,EAAQvzB,MAAQjgC,EAChBA,EAAEigC,MAAMD,KAAOhgC,EAEX8sD,EAAQ9sD,EAAErW,IAAK6pE,EAAQ7pE,OAAQ6pE,EAAUxzD,IACtCwzD,EAAUxzD,GAErB,OAAOwzD,EA5LK+P,CAFV/P,EAAU/wB,EAAKxC,MAEqBj4C,KAAKoxD,OAG3CpxD,KAAKoxD,QAELpxD,KAAK46E,SAAWpP,EAET/wB,GAUTkgC,EAAc34E,UAAUw5E,OAAS,SAAU/gC,GAEzCz6C,KAAK46E,SAWP,SAAuBpP,EAAS/wB,EAAM94C,GAEpC84C,EAAK94C,IAAMA,EAEX,IAAM4K,EAASkuC,EAAKluC,OAChBA,GAAUu4D,EAAQrqB,EAAK94C,IAAK4K,EAAO5K,OAErCk5E,EAAKrP,EAAS/wB,EAAMluC,GAyCxB,SAASkvE,EAAejQ,EAAS/wB,GAE/B,IAAMluC,EAASkuC,EAAKluC,OAEpB,IAAKA,EAAU,OAEVkuC,EAAKwE,MAIR47B,EAAKrP,EAAS/wB,EAAMluC,GAEpBkvE,EAAclvE,IALdkuC,EAAKwE,MAAO,EA9CZw8B,CAAcjQ,EAASj/D,IAGrBu4D,EAAQrqB,EAAK94C,IAAK6pE,EAAQ7pE,OAAQ6pE,EAAU/wB,GAEhD,OAAO+wB,EAzBSkQ,CAAa17E,KAAK46E,SAAUngC,GAAO,GAEnDz6C,KAAKk7E,kBA6EP,IAAMI,EAAa,SAAU7gC,EAAMluC,GAEjCkuC,EAAKzC,KAAKC,MAAQwC,EAAKxC,MACvBwC,EAAKxC,MAAMD,KAAOyC,EAAKzC,KAEvByC,EAAKluC,OAASA,EACTA,EAAOw9C,OAKVtP,EAAKzC,KAAOzrC,EAAOw9C,MACnBtP,EAAKxC,MAAQ1rC,EAAOw9C,MAAM9R,MAC1B1rC,EAAOw9C,MAAM9R,MAAQwC,EACrBA,EAAKxC,MAAMD,KAAOyC,IAPlBluC,EAAOw9C,MAAQtP,EACfA,EAAKxC,MAAQwC,EACbA,EAAKzC,KAAOyC,GAQdluC,EAAOuuE,SAEPrgC,EAAKwE,MAAO,GA0Ed,OAAO07B,IACN,CAAEhrB,SAAS,ICnUDgsB,GAAiCh8E,GAHjC,MACQ,CAAC,YAAa,cAAe,kBAEwB,YAA+C,IAA5CiiE,EAA4C,EAA5CA,UAAWzL,EAAiC,EAAjCA,YAAawkB,EAAoB,EAApBA,cAKnG,SAASiB,IACP,KAAM57E,gBAAgB47E,GAAQ,MAAM,IAAI7lE,YAAY,oDAGpD/V,KAAKy0D,QAAU,GACfz0D,KAAK67E,MAAQ,IAAIlB,EA+GnB,OAzGAiB,EAAI55E,UAAU8K,KAAO,MACrB8uE,EAAI55E,UAAU85E,OAAQ,EAQtBF,EAAI55E,UAAUiG,IAAM,SAAU7H,EAAGqe,GAE/B,GAAKze,KAAKy0D,QAAQr0D,GAOhBJ,KAAKy0D,QAAQr0D,GAAGiB,MAAQod,MAPJ,CAEpB,IAAMg8B,EAAOz6C,KAAK67E,MAAMb,OAAO56E,EAAGqe,GAElCze,KAAKy0D,QAAQr0D,GAAKq6C,IAOtBmhC,EAAI55E,UAAUf,IAAM,SAAUb,GAC5B,IAAMq6C,EAAOz6C,KAAKy0D,QAAQr0D,GAC1B,OAAIq6C,EAAeA,EAAKp5C,MACjB,GAGTu6E,EAAI55E,UAAU+5E,WAAa,SAAU37E,EAAGqe,GAEtC,IAAIg8B,EAAOz6C,KAAKy0D,QAAQr0D,GACnBq6C,EAOHA,EAAKp5C,MAAQugE,EAAUnnB,EAAKp5C,MAAOod,IALnCg8B,EAAOz6C,KAAK67E,MAAMb,OAAO56E,EAAGqe,GAE5Bze,KAAKy0D,QAAQr0D,GAAKq6C,IAOtBmhC,EAAI55E,UAAUiC,QAAU,SAAUsP,EAAMC,EAAIg3B,GAE1C,IAAMwxC,EAAOh8E,KAAK67E,MACZpuE,EAASzN,KAAKy0D,QAEdwnB,EAAQ,GAEVxhC,EAAOuhC,EAAKd,iBAGhB,IAFIzgC,GAAQwhC,EAAMxgE,KAAKg/B,GAEhBA,GAAQA,EAAK94C,KAAO6R,GAErBinC,EAAK94C,KAAO4R,IAET4iD,EAAY1b,EAAKp5C,MAAO,IAE3BmpC,EAASiQ,EAAK94C,IAAK84C,EAAKp5C,MAAOrB,QAInCy6C,EAAOuhC,EAAKd,mBACAe,EAAMxgE,KAAKg/B,GAGzB,IAAK,IAAIr6C,EAAI,EAAGA,EAAI67E,EAAMp4E,OAAQzD,IAAK,CAErC,IAAMyB,EAAIo6E,EAAM77E,GAIhBqN,GAFAgtC,EAAOuhC,EAAKhB,OAAOn5E,EAAEF,IAAKE,EAAER,QAEhBM,KAAO84C,IAIvBmhC,EAAI55E,UAAUk6E,KAAO,SAAU97E,EAAG+U,GAEhC,IAAIgnE,EAAQn8E,KAAKy0D,QAAQr0D,GACrBg8E,EAAQp8E,KAAKy0D,QAAQt/C,GAEzB,IAAKgnE,GAASC,EAEZD,EAAQn8E,KAAK67E,MAAMb,OAAO56E,EAAGg8E,EAAM/6E,OAEnCrB,KAAK67E,MAAML,OAAOY,GAElBp8E,KAAKy0D,QAAQr0D,GAAK+7E,EAClBn8E,KAAKy0D,QAAQt/C,QAAKrR,OACb,GAAIq4E,IAAUC,EAEnBA,EAAQp8E,KAAK67E,MAAMb,OAAO7lE,EAAGgnE,EAAM96E,OAEnCrB,KAAK67E,MAAML,OAAOW,GAElBn8E,KAAKy0D,QAAQt/C,GAAKinE,EAClBp8E,KAAKy0D,QAAQr0D,QAAK0D,OACb,GAAIq4E,GAASC,EAAO,CAEzB,IAAM39D,EAAI09D,EAAM96E,MAChB86E,EAAM96E,MAAQ+6E,EAAM/6E,MACpB+6E,EAAM/6E,MAAQod,IAIXm9D,IACN,CAAEjsB,SAAS,I,oBCxHD0sB,GAAmBjS,IAAQ,SAAUrb,GAChD,OAAO,IAAIA,EAAU,GAAGn5C,QACvB,CAAEy0D,YAOQiS,GAAqBlS,IAAQ,SAAUrb,GAClD,OAAO,IAAIA,EAAU,GAAG/3C,KAAK,IAAI+3C,EAAU,GAAGr3C,QAAQ6Q,IAAI,KACzD,CAAE8hD,YAOQkS,GAAoBnS,IAAQ,SAAUrb,GACjD,OAAOA,EAAU12C,MAAM,KACtB,CAAEgyD,YAOQmS,GAAqBpS,IAAQ,SAAUrb,GAClD,OAAOwtB,GAAkBxtB,GAAWvnC,MAAM,KACzC,CAAE6iD,YAUL,SAASA,GAAQ7sD,GACf,OAAOA,EAAK,GAAGsG,U,skBCxCjB,IAqBa24D,GAAkC98E,GArBlC,OACQ,CACnB,MACA,SACA,YACA,WACA,iBACA,eACA,MACA,MACA,MACA,QACA,QACA,YACA,SACA,SACA,UACA,YACA,aAGyE,YAkBrE,IAqEA+oD,EAAM96C,EAAOnN,EAtFjBo1C,EAiBI,EAjBJA,GACA5kB,EAgBI,EAhBJA,OACA2wC,EAeI,EAfJA,UACApzC,EAcI,EAdJA,SACAqzC,EAaI,EAbJA,eACAuS,EAYI,EAZJA,aACA/8D,EAWI,EAXJA,IACAjB,EAUI,EAVJA,IACA6J,EASI,EATJA,IACA/G,EAQI,EARJA,MACA2rD,EAOI,EAPJA,MACArP,EAMI,EANJA,UACA7O,EAKI,EALJA,OACAtjC,EAII,EAJJA,OACA7M,EAGI,EAHJA,QACAu4C,EAEI,EAFJA,UACAt8B,EACI,EADJA,SAEMle,EAAW8O,EAoBjB,SAASgyC,EAAMh0D,EAAOV,GACpB,KAAMX,gBAAgBq1D,GACpB,MAAM,IAAIz3C,MAAM,oDAGlB,GAAMvc,UAAyCm0D,EAAUn0D,KAAU6iD,EAAU7iD,GAC3E,MAAM,IAAIiI,UAAU,kGAEtB,QAAaxF,IAATnD,IAAuC,iBAATA,GAA8B,KAATA,GACrD,MAAM,IAAI2I,UAAU,yDAGtB,QAAaxF,IAATnD,EAAoB,CACtB,IAAMowB,EAAIskC,EAAKj+C,MAAMzW,GACrBX,KAAKokE,MAAQrzC,EAAEqzC,MACfpkE,KAAKw6E,WAAazpD,EAAEypD,eACf,CACLx6E,KAAKokE,MAAQ,CACX,CACE7K,KAAMmjB,EACNp2B,OAAQq2B,EAASC,KACjBC,MAAO,IAGX78E,KAAKw6E,WAAa,GAClB,IAAK,IAAIp6E,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAC1CJ,KAAKw6E,WAAWp6E,GAAK,EAIzBJ,KAAKqB,MAASA,QAAyCrB,KAAK0hE,WAAWrgE,GAAS,KAEhFrB,KAAK+8D,WAAY,EAMjB/8D,KAAK+8E,6BAA8B,EAYrC,SAASC,IACP,KAAa,MAANv8E,GAAmB,OAANA,GAClB2f,IAQJ,SAAS68D,EAASx8E,GAChB,OAASA,GAAK,KAAOA,GAAK,IAG5B,SAAS2f,IACPxS,IACAnN,EAAIioD,EAAKhqC,OAAO9Q,GAGlB,SAASsvE,EAAQlT,GACfp8D,EAAQo8D,EACRvpE,EAAIioD,EAAKhqC,OAAO9Q,GAGlB,SAASuvE,IACP,IAAI95D,EAAS,GACP2mD,EAAWp8D,EASjB,GAPU,MAANnN,EACF2f,IACe,MAAN3f,IACT4iB,GAAU5iB,EACV2f,MA1BJ,SAAqB3f,GACnB,OAASA,GAAK,KAAOA,GAAK,KAAc,MAANA,EA4B7B28E,CAAW38E,GAGd,OADAy8E,EAAOlT,GACA,KAIT,GAAU,MAANvpE,GAGF,GAFA4iB,GAAU5iB,EACV2f,KACK68D,EAAQx8E,GAGX,OADAy8E,EAAOlT,GACA,SAEJ,CACL,KAAOiT,EAAQx8E,IACb4iB,GAAU5iB,EACV2f,IAEQ,MAAN3f,IACF4iB,GAAU5iB,EACV2f,KAGJ,KAAO68D,EAAQx8E,IACb4iB,GAAU5iB,EACV2f,IAIF,GAAU,MAAN3f,GAAmB,MAANA,EAAW,CAG1B,IAAI48E,EAAkB,GAChBC,EAAiB1vE,EAWvB,GATAyvE,GAAmB58E,EACnB2f,IAEU,MAAN3f,GAAmB,MAANA,IACf48E,GAAmB58E,EACnB2f,MAIG68D,EAAQx8E,GAGX,OADAy8E,EAAOI,GACAj6D,EAKT,IADAA,GAAkBg6D,EACXJ,EAAQx8E,IACb4iB,GAAU5iB,EACV2f,IAIJ,OAAOiD,EAGT,SAASk6D,IAIP,IAHA,IAAIC,EAAW,GAGRP,EAAQx8E,IAAM40D,EAAKooB,aAAah9E,IACrC+8E,GAAY/8E,EACZ2f,IAIF,IAAMs9D,EAASF,EAAS9+D,OAAO,GAC/B,OAAI22C,EAAKooB,aAAaC,GACbF,EAEA,KAIX,SAASG,EAAgBC,GACvB,OAAIn9E,IAAMm9E,GACRx9D,IACOw9D,GAEA,KA/HXvoB,EAAKrzD,UAAU8K,KAAO,OACtBuoD,EAAKrzD,UAAUoiD,QAAS,EA4IxBiR,EAAKj+C,MAAQ,SAAUoJ,EAAK5b,GAM1B,GALAA,EAAUA,GAAW,GAErBgJ,GAAS,EACTnN,EAAI,GAEgB,iBAJpBioD,EAAOloC,GAKL,MAAM,IAAIlX,UAAU,mDAGtB,IAAMiwD,EAAO,IAAIlE,EACjBkE,EAAK6K,MAAQ,GAEb,IAAIyZ,EAAyB,EACzBC,GAAgB,EAgBpB19D,IACA48D,IAGA,IAAMx0B,EAAW20B,IACb97E,EAAQ,KACZ,GAAImnD,EAAU,CACZ,GAAsB,cAAlBv3B,EAAO5N,OACThiB,EAAQ,IAAI0tD,EAAUvG,QACjB,GAAsB,aAAlBv3B,EAAO5N,OAChB,IAEEhiB,EAAQ,IAAIoxB,EAAS+1B,GACrB,MAAO1jB,GACPzjC,EAAQ8V,WAAWqxC,QAGrBnnD,EAAQ8V,WAAWqxC,GAGrBw0B,IAGIW,EAAe,MACjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,OACxBE,GAA0B,EAC1BC,GAAgB,GAUpB,IALA,IAAMC,EAAuB,GAGzBC,EAA8B,IAErB,CAKX,IAJAhB,IAIa,MAANv8E,GACLs9E,EAAqBtiE,KAAKoiE,GAC1BG,GAA+BH,EAC/BA,EAAyB,EACzBz9D,IACA48D,IAIF,IAAIiB,OAAI,EACR,IAAIx9E,EAQF,MAPA,IAAMy9E,EAAOz9E,EAEb,GAAa,QADbw9E,EAAOV,KAEL,MAAM,IAAIxnE,YAAY,eAAiBmoE,EAAO,SAAWx1B,EAAO,cAAgB96C,EAAMtL,YAQ1F,IAAMiW,EAAM4lE,EAAUF,GACtB,GAAY,OAAR1lE,EAEF,MAAM,IAAIxC,YAAY,SAAWkoE,EAAO,gBAG1C,IAAIpB,EAAQgB,EAAyBG,EAGrC,GADAhB,IACIW,EAAe,KAAM,CACvBX,IACA,IAAM96E,EAAIi7E,IACV,GAAU,OAANj7E,EAEF,MAAM,IAAI6T,YAAY,OAASyK,EAAM,sDAEvCq8D,GAAS36E,EAIXq3D,EAAK6K,MAAM3oD,KAAK,CACd89C,KAAMhhD,EAAIghD,KACVjT,OAAQ/tC,EAAI+tC,OACZu2B,MAAOA,IAET,IAAK,IAAIz8E,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAC1Cm5D,EAAKihB,WAAWp6E,KAAOmY,EAAIghD,KAAKihB,WAAWp6E,IAAM,GAAKy8E,EAMxD,IADAG,IACa,MAANv8E,GAAW,CAChB,GAAoC,IAAhCs9E,EAAqBl6E,OACvB,MAAM,IAAIkS,YAAY,qBAAuB2yC,EAAO,cAAgB96C,EAAMtL,YAE5E07E,GAA+BD,EAAqBpyD,MACpDvL,IACA48D,IAqBF,GAhBAc,GAAgB,EAEZH,EAAe,MAEjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,MAExBE,GAA0B,EAC1BC,GAAgB,GAGhBD,EAAyB,EAIvBtlE,EAAIghD,KAAKtuC,KAAM,CACjB,IAAMmzD,EAAU7lE,EAAIghD,KAAKtuC,KAAKtpB,IAC9B08E,EAAaC,KAAKF,GAAW,CAC3B7kB,KAAMhhD,EAAIghD,KACVjT,OAAQ/tC,EAAI+tC,SAOlB,GADA02B,IACIv8E,EACF,MAAM,IAAIsV,YAAY,qBAAuByK,EAAM,KAIrD,GAAIs9D,EACF,MAAM,IAAI/nE,YAAY,yBAA2ByK,EAAM,KAIzD,GAAoC,IAAhCu9D,EAAqBl6E,OACvB,MAAM,IAAIkS,YAAY,qBAAuB2yC,EAAO,KAItD,GAA0B,IAAtB6Q,EAAK6K,MAAMvgE,SAAiBe,EAAQ25E,aACtC,MAAM,IAAIxoE,YAAY,IAAMyK,EAAM,uBAIpC,OADA+4C,EAAKl4D,WAAmByC,IAAVzC,EAAuBk4D,EAAKmI,WAAWrgE,GAAS,KACvDk4D,GAQTlE,EAAKrzD,UAAU8vB,MAAQ,WACrB,IAAMynC,EAAO,IAAIlE,EAEjBkE,EAAKwD,UAAY/8D,KAAK+8D,UACtBxD,EAAKwjB,4BAA8B/8E,KAAK+8E,4BAExCxjB,EAAKl4D,MAAQywB,GAAM9xB,KAAKqB,OACxBk4D,EAAKihB,WAAax6E,KAAKw6E,WAAWpqE,MAAM,GACxCmpD,EAAK6K,MAAQ,GACb,IAAK,IAAIhkE,EAAI,EAAGA,EAAIJ,KAAKokE,MAAMvgE,OAAQzD,IAErC,IAAK,IAAM8B,KADXq3D,EAAK6K,MAAMhkE,GAAK,GACAJ,KAAKokE,MAAMhkE,GACrB6B,GAAejC,KAAKokE,MAAMhkE,GAAI8B,KAChCq3D,EAAK6K,MAAMhkE,GAAG8B,GAAKlC,KAAKokE,MAAMhkE,GAAG8B,IAKvC,OAAOq3D,GAQTlE,EAAKrzD,UAAUmiE,WAAa,WAC1B,OAA0B,IAAtBnkE,KAAKokE,MAAMvgE,SAGR7D,KAAKokE,MAAMvgE,OAAS,GAAKpB,KAAK2T,IAAIpW,KAAKokE,MAAM,GAAGyY,MAAQ,GAAO,QAUxExnB,EAAKrzD,UAAU0/D,WAAa,SAAUrgE,GACpC,GAAIA,SAA+D,IAAtBrB,KAAKokE,MAAMvgE,OACtD,OAAOxC,EAKT,IAHA,IAAIkX,EAAMlX,EACJ+kC,EAAUivB,EAAKmpB,oBAAoBr4B,EAAO9kD,IAEvCjB,EAAI,EAAGA,EAAIJ,KAAKokE,MAAMvgE,OAAQzD,IAAK,CAC1C,IAAMq+E,EAAYr4C,EAAQpmC,KAAKokE,MAAMhkE,GAAGm5D,KAAKl4D,OACvCq9E,EAAkBt4C,EAAQpmC,KAAKokE,MAAMhkE,GAAGkmD,OAAOjlD,OAC/Cs9E,EAAYv4C,EAAQpmC,KAAKokE,MAAMhkE,GAAGy8E,OACxCtkE,EAAMspD,EAAetpD,EAAKlB,EAAIwqD,EAAe4c,EAAWC,GAAkBC,IAG5E,OAAOpmE,GAWT88C,EAAKrzD,UAAU48E,aAAe,SAAUv9E,EAAOw9E,GAC7C,GAAIx9E,SAA+D,IAAtBrB,KAAKokE,MAAMvgE,OACtD,OAAOxC,EAKT,IAHA,IAAIkX,EAAMlX,EACJ+kC,EAAUivB,EAAKmpB,oBAAoBr4B,EAAO9kD,IAEvCjB,EAAI,EAAGA,EAAIJ,KAAKokE,MAAMvgE,OAAQzD,IAAK,CAC1C,IAAMq+E,EAAYr4C,EAAQpmC,KAAKokE,MAAMhkE,GAAGm5D,KAAKl4D,OACvCq9E,EAAkBt4C,EAAQpmC,KAAKokE,MAAMhkE,GAAGkmD,OAAOjlD,OAC/Cs9E,EAAYv4C,EAAQpmC,KAAKokE,MAAMhkE,GAAGy8E,OACxCtkE,EAAM67D,EAAa77D,EAAKlB,EAAIwqD,EAAe4c,EAAWC,GAAkBC,IAG1E,OAAOpmE,GAWT,IAAM4lE,EAAY/T,IAAQ,SAAC5pD,GAEzB,GAAIve,GAAe68E,EAAOt+D,GAAM,CAC9B,IAAM+4C,EAAOulB,EAAMt+D,GAEnB,MAAO,CACL+4C,OACAjT,OAHaiT,EAAKwlB,SAAS,KAO/B,IAAK,IAAMp+E,KAAQm+E,EACjB,GAAI78E,GAAe68E,EAAOn+E,IACpB8nD,GAASjoC,EAAK7f,GAAO,CACvB,IAAM44D,EAAOulB,EAAMn+E,GACbq+E,EAAax+D,EAAI3c,OAASlD,EAAKkD,OAC/Bo7E,EAAaz+D,EAAIiQ,UAAU,EAAGuuD,GAC9B14B,EAASrkD,GAAes3D,EAAKwlB,SAAUE,GACzC1lB,EAAKwlB,SAASE,QACdn7E,EACJ,QAAeA,IAAXwiD,EAEF,MAAO,CACLiT,OACAjT,UAOV,OAAO,OACN,CAAE+jB,OAAQ,SAAC7sD,GAAD,OAAUA,EAAK,IAAIiE,MAAO,MAmLvC,SAASy9D,EAAsB3lB,GAC7B,OAAIA,EAAKtD,UAAUkpB,EAAWvC,OAAwB,OAAfrjB,EAAKl4D,QAAmB4vB,EAAO0vC,YAC7DpH,EAAKl4D,MAELk4D,EA7KXlE,EAAK+pB,gBAAkB,SAAUz+E,GAC/B,OAA4B,OAApBw9E,EAAUx9E,IASpB00D,EAAKrzD,UAAUmuD,QAAU,SAAUllC,GAKjC,GAJsB,iBAAVA,IACVA,EAAOk0D,EAAWl0D,KAGfA,EAAQ,OAAO,EAGpB,IAAK,IAAI7qB,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAC1C,GAAIqC,KAAK2T,KAAKpW,KAAKw6E,WAAWp6E,IAAM,IAAM6qB,EAAKuvD,WAAWp6E,IAAM,IAAM,MACpE,OAAO,EAGX,OAAO,GAUTi1D,EAAKrzD,UAAUi0D,UAAY,SAAUopB,GAEnC,IAAK,IAAIj/E,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAC1C,GAAIqC,KAAK2T,KAAKpW,KAAKw6E,WAAWp6E,IAAM,IAAMi/E,EAAM7E,WAAWp6E,IAAM,IAAM,MACrE,OAAO,EAGX,OAAO,GASTi1D,EAAKrzD,UAAU0mB,OAAS,SAAU22D,GAChC,OAAQr/E,KAAKi2D,UAAUopB,IAAUxa,EAAM7kE,KAAKqB,MAAOg+E,EAAMh+E,QAS3Dg0D,EAAKrzD,UAAUsuC,SAAW,SAAU+uC,GAGlC,IAFA,IAAM9mE,EAAMvY,KAAK8xB,QAER1xB,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAE1CmY,EAAIiiE,WAAWp6E,IAAMJ,KAAKw6E,WAAWp6E,IAAM,IAAMi/E,EAAM7E,WAAWp6E,IAAM,GAI1E,IAAK,IAAIA,EAAI,EAAGA,EAAIi/E,EAAMjb,MAAMvgE,OAAQzD,IAAK,CAE3C,IAAMk/E,EAAW,MACZD,EAAMjb,MAAMhkE,IAEjBmY,EAAI6rD,MAAM3oD,KAAK6jE,GAIjB,GAAmB,OAAft/E,KAAKqB,OAAkC,OAAhBg+E,EAAMh+E,MAAgB,CAC/C,IAAMk+E,EAAyB,OAAfv/E,KAAKqB,MAAiBrB,KAAK0hE,WAAW,GAAK1hE,KAAKqB,MAC1Dm+E,EAA2B,OAAhBH,EAAMh+E,MAAiBg+E,EAAM3d,WAAW,GAAK2d,EAAMh+E,MACpEkX,EAAIlX,MAAQwgE,EAAe0d,EAASC,QAEpCjnE,EAAIlX,MAAQ,KAKd,OAFAkX,EAAIwkE,6BAA8B,EAE3BmC,EAAqB3mE,IAS9B88C,EAAKrzD,UAAUkmB,OAAS,SAAUm3D,GAGhC,IAFA,IAAM9mE,EAAMvY,KAAK8xB,QAER1xB,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAE1CmY,EAAIiiE,WAAWp6E,IAAMJ,KAAKw6E,WAAWp6E,IAAM,IAAMi/E,EAAM7E,WAAWp6E,IAAM,GAI1E,IAAK,IAAIA,EAAI,EAAGA,EAAIi/E,EAAMjb,MAAMvgE,OAAQzD,IAAK,CAE3C,IAAMk/E,EAAW,SACZD,EAAMjb,MAAMhkE,IADH,IAEZy8E,OAAQwC,EAAMjb,MAAMhkE,GAAGy8E,QAEzBtkE,EAAI6rD,MAAM3oD,KAAK6jE,GAIjB,GAAmB,OAAft/E,KAAKqB,OAAkC,OAAhBg+E,EAAMh+E,MAAgB,CAC/C,IAAMk+E,EAAyB,OAAfv/E,KAAKqB,MAAiBrB,KAAK0hE,WAAW,GAAK1hE,KAAKqB,MAC1Dm+E,EAA2B,OAAhBH,EAAMh+E,MAAiBg+E,EAAM3d,WAAW,GAAK2d,EAAMh+E,MACpEkX,EAAIlX,MAAQ+yE,EAAamL,EAASC,QAElCjnE,EAAIlX,MAAQ,KAKd,OAFAkX,EAAIwkE,6BAA8B,EAE3BmC,EAAqB3mE,IAS9B88C,EAAKrzD,UAAUqV,IAAM,SAAUnV,GAG7B,IAFA,IAAMqW,EAAMvY,KAAK8xB,QAER1xB,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAE1CmY,EAAIiiE,WAAWp6E,IAAMJ,KAAKw6E,WAAWp6E,IAAM,GAAK8B,EAIlD,IAAK,IAAI9B,EAAI,EAAGA,EAAImY,EAAI6rD,MAAMvgE,OAAQzD,IACpCmY,EAAI6rD,MAAMhkE,GAAGy8E,OAAS36E,EAiBxB,OAdkB,OAAdqW,EAAIlX,MACNkX,EAAIlX,MAAQgW,EAAIkB,EAAIlX,MAAOa,GAQ3BqW,EAAIlX,MAAQ,KAGdkX,EAAIwkE,6BAA8B,EAE3BmC,EAAqB3mE,IAsB9B88C,EAAKrzD,UAAUoU,IAAM,WACnB,IAAM+C,EAAMnZ,KAAK8xB,QACjB,GAAkB,OAAd3Y,EAAI9X,MACN,GAAI8X,EAAIgrD,cAA6C,IAA7BhrD,EAAIirD,MAAM,GAAG7K,KAAKr5C,OACxC/G,EAAI9X,MAAQ+U,EAAI+C,EAAI9X,WACf,CAIL,IAAM+kC,EAAUivB,EAAKmpB,oBAAoBr4B,EAAOhtC,EAAI9X,QAC9Co9E,EAAYr4C,EAAQjtB,EAAIirD,MAAM,GAAG7K,KAAKl4D,OACtCo+E,EAAgBr5C,EAAQjtB,EAAIirD,MAAM,GAAG7K,KAAKr5C,QAC1Cw/D,EAAa7d,EAAe4c,EAAWgB,GAC7CtmE,EAAI9X,MAAQmtB,EAASpY,EAAIwrD,EAAUzoD,EAAI9X,MAAOq+E,IAAcA,GAIhE,IAAK,IAAMt/E,KAAK+Y,EAAIirD,MACa,OAA3BjrD,EAAIirD,MAAMhkE,GAAGm5D,KAAK54D,MAA4C,QAA3BwY,EAAIirD,MAAMhkE,GAAGm5D,KAAK54D,OACvDwY,EAAIirD,MAAMhkE,GAAGm5D,KAAOulB,EAAMa,GAI9B,OAAOxmE,GASTk8C,EAAKrzD,UAAUwR,GAAK,SAAUgmD,GAC5B,IACI6lB,EADEh+E,EAAuB,OAAfrB,KAAKqB,MAAiBrB,KAAK0hE,WAAW,GAAK1hE,KAAKqB,MAE9D,GAA6B,iBAAlBm4D,EACT6lB,EAAQhqB,EAAKj+C,MAAMoiD,OACd,KAAIpV,EAAOoV,GAGhB,MAAM,IAAI57C,MAAM,wCAFhByhE,EAAQ7lB,EAAc1nC,QAKxB,IAAK9xB,KAAKi2D,UAAUopB,GAClB,MAAM,IAAIzhE,MAAJ,+BAAkCyhE,EAAM/8E,WAAxC,iBAA2DtC,KAAKsC,WAAhE,OAER,GAAoB,OAAhB+8E,EAAMh+E,MACR,MAAM,IAAIuc,MAAM,yCAGlB,GAAmB,OAAf5d,KAAKqB,OAAkBrB,KAAKmkE,cAC5BnkE,KAAKokE,MAAM,GAAG7K,KAAKr5C,SAAWm/D,EAAMjb,MAAM,GAAG7K,KAAKr5C,OACpDm/D,EAAMh+E,MAAQywB,GAAMzwB,OACf,CAEL,IAAM+kC,EAAUivB,EAAKmpB,oBAAoBr4B,EAAO9kD,IAE1Cu+E,EAAgBx5C,EAAQpmC,KAAKokE,MAAM,GAAG7K,KAAKl4D,OAC3Cw+E,EAAoBz5C,EAAQpmC,KAAKokE,MAAM,GAAG7K,KAAKr5C,QAC/C4/D,EAAiBje,EAAe+d,EAAeC,GAE/CE,EAAiB35C,EAAQi5C,EAAMjb,MAAM,GAAG7K,KAAKl4D,OAC7C2+E,EAAqB55C,EAAQi5C,EAAMjb,MAAM,GAAG7K,KAAKr5C,QACjD+/D,EAAkBpe,EAAeke,EAAgBC,GAEvDX,EAAMh+E,MAAQmtB,EAASozC,EAAUvgE,EAAOy+E,GAAiBG,GAI3D,OAFAZ,EAAMtiB,WAAY,EAClBsiB,EAAMtC,6BAA8B,EAC7BsC,GAUThqB,EAAKrzD,UAAUuS,SAAW,SAAUilD,GAClC,OAAOjlD,EAASvU,KAAKqU,UAAUmlD,KASjCnE,EAAKrzD,UAAUqS,UAAY,SAAUmlD,GACnC,IAAI6lB,EAQJ,OALEA,EAFE7lB,EAEMx5D,KAAKwT,GAAGgmD,GAERx5D,KAAK8xB,SAGLqyC,cAAuC,IAAvBkb,EAAMjb,MAAMvgE,OAC7Bw7E,EAAMT,aAAaS,EAAMh+E,OAEzBg+E,EAAMT,aAAaS,EAAMh+E,MAAOg+E,EAAMjb,MAAM,GAAG9d,OAAOjlD,QASjEg0D,EAAKrzD,UAAUM,SAAW,WACxB,OAAOtC,KAAK2mD,UASd0O,EAAKrzD,UAAUsM,OAAS,WACtB,MAAO,CACLkhD,OAAQ,OACRnuD,MAAOrB,KAAK4+E,aAAa5+E,KAAKqB,OAC9Bk4D,KAAMv5D,KAAK23E,cACX5a,UAAW/8D,KAAK+8D,YAWpB1H,EAAK5F,SAAW,SAAUC,GACxB,IAAM6J,EAAO,IAAIlE,EAAK3F,EAAKruD,MAAOquD,EAAK6J,MAEvC,OADAA,EAAKwD,UAAYrN,EAAKqN,YAAa,EAC5BxD,GAQTlE,EAAKrzD,UAAU0b,QAAU23C,EAAKrzD,UAAUM,SAMxC+yD,EAAKrzD,UAAUk+E,SAAW,WACxB,IAKIC,EAaEC,EAlBAjnE,EAAMnZ,KAAK8xB,QAEXuuD,EAAmB,GAIzB,IAAK,IAAM1+E,KAAO2+E,EAChB,GAAIr+E,GAAeq+E,EAAmB3+E,IAChCwX,EAAIg3C,QAAQgvB,EAAWx9E,IAAO,CAChCw+E,EAAex+E,EACf,MAKN,GAAqB,SAAjBw+E,EACFhnE,EAAIirD,MAAQ,QASZ,GANI+b,GAEEl+E,GAAeq+E,EAAmBH,KACpCC,EAAeE,EAAkBH,IAGjCC,EACFjnE,EAAIirD,MAAQ,CAAC,CACX7K,KAAM6mB,EAAa7mB,KACnBjT,OAAQ85B,EAAa95B,OACrBu2B,MAAO,QAEJ,CAKL,IADA,IAAI0D,GAAiB,EACZngF,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAAK,CAC/C,IAAMg+E,EAAUtB,EAAgB18E,GAC5BqC,KAAK2T,IAAI+C,EAAIqhE,WAAWp6E,IAAM,GAAK,QACjC6B,GAAeq+E,EAAmBlC,GACpCiC,EAAiB5kE,KAAK,CACpB89C,KAAM+mB,EAAkBlC,GAAS7kB,KACjCjT,OAAQg6B,EAAkBlC,GAAS93B,OACnCu2B,MAAO1jE,EAAIqhE,WAAWp6E,IAAM,IAG9BmgF,GAAiB,GAMnBF,EAAiBx8E,OAASsV,EAAIirD,MAAMvgE,SAAW08E,IAEjDpnE,EAAIirD,MAAQic,GAKlB,OAAOlnE,GAMTk8C,EAAKrzD,UAAUw+E,KAAO,WAQpB,IAPA,IAAMrnE,EAAMnZ,KAAK8xB,QAEXuuD,EAAmB,GAKhBjgF,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAAK,CAC/C,IAAMg+E,EAAUtB,EAAgB18E,GAChC,GAAIqC,KAAK2T,IAAI+C,EAAIqhE,WAAWp6E,IAAM,GAAK,MAAO,CAC5C,IAAI6B,GAAeo8E,EAAaoC,GAAIrC,GAOlC,MAAM,IAAIxgE,MAAM,8BAAgCwgE,EAAU,gBAN1DiC,EAAiB5kE,KAAK,CACpB89C,KAAM8kB,EAAaoC,GAAGrC,GAAS7kB,KAC/BjT,OAAQ+3B,EAAaoC,GAAGrC,GAAS93B,OACjCu2B,MAAO1jE,EAAIqhE,WAAWp6E,IAAM,KAcpC,OALA+Y,EAAIirD,MAAQic,EAEZlnE,EAAI4jD,WAAY,EAChB5jD,EAAI4jE,6BAA8B,EAE3B5jE,GAQTk8C,EAAKrzD,UAAU21E,YAAc,WAM3B,IALA,IAAI+I,EAAS,GACTC,EAAS,GACTC,EAAO,EACPC,EAAO,EAEFzgF,EAAI,EAAGA,EAAIJ,KAAKokE,MAAMvgE,OAAQzD,IACjCJ,KAAKokE,MAAMhkE,GAAGy8E,MAAQ,GACxB+D,IACAF,GAAU,IAAM1gF,KAAKokE,MAAMhkE,GAAGkmD,OAAO3lD,KAAOX,KAAKokE,MAAMhkE,GAAGm5D,KAAK54D,KAC3D8B,KAAK2T,IAAIpW,KAAKokE,MAAMhkE,GAAGy8E,MAAQ,GAAO,QACxC6D,GAAU,IAAM1gF,KAAKokE,MAAMhkE,GAAGy8E,QAEvB78E,KAAKokE,MAAMhkE,GAAGy8E,MAAQ,GAC/BgE,IAIJ,GAAIA,EAAO,EACT,IAAK,IAAIzgF,EAAI,EAAGA,EAAIJ,KAAKokE,MAAMvgE,OAAQzD,IACjCJ,KAAKokE,MAAMhkE,GAAGy8E,MAAQ,IACpB+D,EAAO,GACTD,GAAU,IAAM3gF,KAAKokE,MAAMhkE,GAAGkmD,OAAO3lD,KAAOX,KAAKokE,MAAMhkE,GAAGm5D,KAAK54D,KAC3D8B,KAAK2T,IAAIpW,KAAKokE,MAAMhkE,GAAGy8E,MAAQ,GAAO,QACxC8D,GAAU,KAAQ3gF,KAAKokE,MAAMhkE,GAAGy8E,SAGlC8D,GAAU,IAAM3gF,KAAKokE,MAAMhkE,GAAGkmD,OAAO3lD,KAAOX,KAAKokE,MAAMhkE,GAAGm5D,KAAK54D,KAC/DggF,GAAU,IAAO3gF,KAAKokE,MAAMhkE,GAAGy8E,QAMvC6D,EAASA,EAAOvQ,OAAO,GACvBwQ,EAASA,EAAOxQ,OAAO,GAGnByQ,EAAO,GAAKC,EAAO,IACrBH,EAAS,IAAMA,EAAS,KAEtBG,EAAO,GAAKD,EAAO,IACrBD,EAAS,IAAMA,EAAS,KAG1B,IAAIngE,EAAMkgE,EAMV,OALIE,EAAO,GAAKC,EAAO,IACrBrgE,GAAO,OAETA,GAAOmgE,GAcTtrB,EAAKrzD,UAAU2kD,OAAS,SAAU/hD,GAGhC,IAAMk8E,EAAO9gF,KAAK+8E,6BAA8C,OAAf/8E,KAAKqB,MAClDrB,KAAK8xB,QACL9xB,KAAKkgF,WAGLa,GAAc,EAMlB,IAAK,IAAM3gF,UALiB,IAAhB0gF,EAAKz/E,OAAyC,OAAfy/E,EAAKz/E,OAAkB6iD,EAAU48B,EAAKz/E,SAE/E0/E,EAAct+E,KAAK2T,IAAI0qE,EAAKz/E,MAAMmW,IAAM,OAG1BspE,EAAK1c,MACfniE,GAAe6+E,EAAK1c,MAAOhkE,IACzB0gF,EAAK1c,MAAMhkE,GAAGm5D,OACgB,OAA5BunB,EAAK1c,MAAMhkE,GAAGm5D,KAAK54D,MAAiBogF,EACtCD,EAAK1c,MAAMhkE,GAAGm5D,KAAOulB,EAAMkC,IACU,QAA5BF,EAAK1c,MAAMhkE,GAAGm5D,KAAK54D,MAAmBogF,IAC/CD,EAAK1c,MAAMhkE,GAAGm5D,KAAOulB,EAAMmC,KAQT,IAAtBH,EAAK1c,MAAMvgE,QAAiBi9E,EAAK/jB,WAG/Bt6D,KAAK2T,IAAI0qE,EAAK1c,MAAM,GAAGyY,MAAQp6E,KAAKyW,MAAM4nE,EAAK1c,MAAM,GAAGyY,QAAU,QAEpEiE,EAAK1c,MAAM,GAAG9d,OAASw6B,EAAKI,eAIhC,IAAM7/E,EAAQy/E,EAAKlC,aAAakC,EAAKz/E,OACjCmf,EAAsB,OAAfsgE,EAAKz/E,MAAkBslD,EAAOtlD,EAAOuD,GAAW,IAAM,GAC3Du8E,EAAUL,EAAKnJ,cASrB,OARImJ,EAAKz/E,OAAS6iD,EAAU48B,EAAKz/E,SAC/Bmf,EAAM,IAAMA,EAAM,KAEhB2gE,EAAQt9E,OAAS,GAAK2c,EAAI3c,OAAS,IACrC2c,GAAO,KAETA,GAAO2gE,GAWT9rB,EAAKrzD,UAAUk/E,YAAc,WAC3B,GAA0B,IAAtBlhF,KAAKokE,MAAMvgE,OACb,MAAM,IAAI+Z,MAAM,4GAElB,GAAInb,KAAK2T,IAAIpW,KAAKokE,MAAM,GAAGyY,MAAQp6E,KAAKyW,MAAMlZ,KAAKokE,MAAM,GAAGyY,SAAW,MACrE,MAAM,IAAIj/D,MAAM,4GAWlB,IAAMwjE,EAA0B,OAAfphF,KAAKqB,MAAiB+U,EAAIpW,KAAKqB,OAAS,EACnDggF,EAAejrE,EAAIpW,KAAKokE,MAAM,GAAG7K,KAAKl4D,OACxCigF,EAAathF,KAAKokE,MAAM,GAAG9d,OAC/B,GAAiB,IAAb86B,EACF,OAAOE,EAET,IAAMzE,EAAQ78E,KAAKokE,MAAM,GAAGyY,MACxB0E,EAAW9+E,KAAK6T,IAAI8qE,EAAW3+E,KAAK4U,IAAIiqE,EAAWjgF,MAAQggF,EAAcxE,IAAUp6E,KAAKmhB,KAAO,IACnG,GAAI29D,GAAY,UAAYA,EAAW,SAAU,OAAOD,EACxDC,EAAW9+E,KAAK2T,IAAImrE,GACpB,IAAMxC,EAAW/+E,KAAKokE,MAAM,GAAG7K,KAAKwlB,SACpC,IAAK,IAAM78E,KAAK68E,EACd,GAAI98E,GAAe88E,EAAU78E,GAAI,CAC/B,IAAMokD,EAASy4B,EAAS78E,GACxB,GAAIokD,EAAOk7B,WAAY,CACrB,IAAMr5B,EAAO1lD,KAAK2T,IAChB3T,KAAK6T,IAAI8qE,EAAW3+E,KAAK4U,IAAIivC,EAAOjlD,MAAQggF,EAAcxE,IAAUp6E,KAAKmhB,KAAO,MAE9EukC,EAAOo5B,GACRp5B,IAASo5B,GAAYj7B,EAAO3lD,KAAKkD,OAASy9E,EAAW3gF,KAAKkD,UAG3Dy9E,EAAah7B,EACbi7B,EAAWp5B,IAMnB,OAAOm5B,GAgBTjsB,EAAKrzD,UAAU+4D,UAAY,SAAU5B,GAGnC,IAFA,IAAI5rD,EAAIvN,KAAK8xB,QACP3Y,EAAM,GACH/Y,EAAI,EAAGA,EAAI+4D,EAAMt1D,SAExB0J,EAAIA,EAAEiG,GAAG2lD,EAAM/4D,IACXA,IAAM+4D,EAAMt1D,OAAS,GAHOzD,IAAK,CAMrC,IAAMqhF,EAAWl0E,EAAE8G,YAIbqtE,EAAWxoE,EAAMuoE,GASjBzpE,EAAI,IAAIq9C,EAPQwP,EAAM6c,EAAUD,GAE3BC,EAEAzhE,EAAI1S,EAAE8G,aAGU8kD,EAAM/4D,GAAGkC,YACpC6W,EAAIsC,KAAKzD,GACTzK,EAAIihB,EAASjhB,EAAGyK,GAQlB,IADA,IAAI2pE,EAAU,EACLvhF,EAAI,EAAGA,EAAI+Y,EAAItV,OAAQzD,IAC9BuhF,EAAU/f,EAAU+f,EAASxoE,EAAI/Y,GAAGiB,OAQtC,OANIwjE,EAAM8c,EAAS3hF,KAAKqB,SACtBkM,EAAElM,MAAQ,GAGZ8X,EAAIsC,KAAKlO,GAEF4L,GAGT,IAAMwjE,EAAW,CACfC,KAAM,CACJ,GAAI,CAAEj8E,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,IAExCI,MAAO,CACL,GAAI,CAAEjhF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GAEtCK,GAAI,CAAElhF,KAAM,KAAMU,MAAO,GAAKmgF,YAAY,GAC1CrgC,EAAG,CAAExgD,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxC/wE,EAAG,CAAE9P,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCxuD,EAAG,CAAEryB,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCM,EAAG,CAAEnhF,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCO,EAAG,CAAEphF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzC3vE,EAAG,CAAElR,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzClwE,EAAG,CAAE3Q,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCQ,EAAG,CAAErhF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCS,EAAG,CAAEthF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GAEzC9gF,EAAG,CAAEC,KAAM,IAAKU,MAAO,GAAMmgF,YAAY,GACzC/gF,EAAG,CAAEE,KAAM,IAAKU,MAAO,IAAMmgF,YAAY,GACzChhF,EAAG,CAAEG,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCzwD,EAAG,CAAEpwB,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzC3/E,EAAG,CAAElB,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCt/E,EAAG,CAAEvB,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1Ch9E,EAAG,CAAE7D,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1CvrE,EAAG,CAAEtV,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1C/qE,EAAG,CAAE9V,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1CxpE,EAAG,CAAErX,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,IAE5CU,KAAM,CACJ,GAAI,CAAEvhF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GAEtCW,KAAM,CAAExhF,KAAM,OAAQU,MAAO,GAAKmgF,YAAY,GAC9CY,MAAO,CAAEzhF,KAAM,QAASU,MAAO,IAAKmgF,YAAY,GAChDa,KAAM,CAAE1hF,KAAM,OAAQU,MAAO,IAAKmgF,YAAY,GAC9Cc,KAAM,CAAE3hF,KAAM,OAAQU,MAAO,IAAKmgF,YAAY,GAC9Ce,KAAM,CAAE5hF,KAAM,OAAQU,MAAO,IAAKmgF,YAAY,GAC9CgB,KAAM,CAAE7hF,KAAM,OAAQU,MAAO,KAAMmgF,YAAY,GAC/CiB,KAAM,CAAE9hF,KAAM,OAAQU,MAAO,KAAMmgF,YAAY,GAC/CkB,IAAK,CAAE/hF,KAAM,MAAOU,MAAO,KAAMmgF,YAAY,GAC7CmB,MAAO,CAAEhiF,KAAM,QAASU,MAAO,KAAMmgF,YAAY,GACjDoB,MAAO,CAAEjiF,KAAM,QAASU,MAAO,KAAMmgF,YAAY,GAEjDqB,KAAM,CAAEliF,KAAM,OAAQU,MAAO,GAAMmgF,YAAY,GAC/CsB,MAAO,CAAEniF,KAAM,QAASU,MAAO,IAAMmgF,YAAY,GACjDuB,MAAO,CAAEpiF,KAAM,QAASU,MAAO,KAAMmgF,YAAY,GACjDwB,MAAO,CAAEriF,KAAM,QAASU,MAAO,KAAMmgF,YAAY,GACjDyB,KAAM,CAAEtiF,KAAM,OAAQU,MAAO,KAAMmgF,YAAY,GAC/C0B,KAAM,CAAEviF,KAAM,OAAQU,MAAO,MAAOmgF,YAAY,GAChD2B,MAAO,CAAExiF,KAAM,QAASU,MAAO,MAAOmgF,YAAY,GAClD4B,KAAM,CAAEziF,KAAM,OAAQU,MAAO,MAAOmgF,YAAY,GAChD6B,MAAO,CAAE1iF,KAAM,QAASU,MAAO,MAAOmgF,YAAY,GAClD8B,MAAO,CAAE3iF,KAAM,QAASU,MAAO,MAAOmgF,YAAY,IAEpD+B,QAAS,CACP,GAAI,CAAE5iF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GAEtCK,GAAI,CAAElhF,KAAM,KAAMU,MAAO,IAAKmgF,YAAY,GAC1CrgC,EAAG,CAAExgD,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxC/wE,EAAG,CAAE9P,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCxuD,EAAG,CAAEryB,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCM,EAAG,CAAEnhF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCO,EAAG,CAAEphF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzC3vE,EAAG,CAAElR,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzClwE,EAAG,CAAE3Q,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCQ,EAAG,CAAErhF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCS,EAAG,CAAEthF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GAEzC9gF,EAAG,CAAEC,KAAM,IAAKU,MAAO,IAAMmgF,YAAY,GACzC/gF,EAAG,CAAEE,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzChhF,EAAG,CAAEG,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCzwD,EAAG,CAAEpwB,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1C3/E,EAAG,CAAElB,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1Ct/E,EAAG,CAAEvB,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1Ch9E,EAAG,CAAE7D,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1CvrE,EAAG,CAAEtV,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1C/qE,EAAG,CAAE9V,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1CxpE,EAAG,CAAErX,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,IAE5CgC,MAAO,CACL,GAAI,CAAE7iF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GAEtCK,GAAI,CAAElhF,KAAM,KAAMU,MAAO,IAAKmgF,YAAY,GAC1CrgC,EAAG,CAAExgD,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxC/wE,EAAG,CAAE9P,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCxuD,EAAG,CAAEryB,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCM,EAAG,CAAEnhF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCO,EAAG,CAAEphF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzC3vE,EAAG,CAAElR,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzClwE,EAAG,CAAE3Q,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCQ,EAAG,CAAErhF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCS,EAAG,CAAEthF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GAEzC9gF,EAAG,CAAEC,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzC/gF,EAAG,CAAEE,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzChhF,EAAG,CAAEG,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCzwD,EAAG,CAAEpwB,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1C3/E,EAAG,CAAElB,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1Ct/E,EAAG,CAAEvB,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1Ch9E,EAAG,CAAE7D,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1CvrE,EAAG,CAAEtV,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1C/qE,EAAG,CAAE9V,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,GAC1CxpE,EAAG,CAAErX,KAAM,IAAKU,MAAO,MAAOmgF,YAAY,IAE5CiC,gBAAiB,CACf,GAAI,CAAE9iF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GACtC/wE,EAAG,CAAE9P,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCxuD,EAAG,CAAEryB,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCM,EAAG,CAAEnhF,KAAM,IAAKU,MAAO,IAAKmgF,YAAY,GACxCO,EAAG,CAAEphF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzC3vE,EAAG,CAAElR,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzClwE,EAAG,CAAE3Q,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCQ,EAAG,CAAErhF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,GACzCS,EAAG,CAAEthF,KAAM,IAAKU,MAAO,KAAMmgF,YAAY,IAE3CkC,iBAAkB,CAChB,GAAI,CAAE/iF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GACtCmC,GAAI,CAAEhjF,KAAM,KAAMU,MAAO,KAAMmgF,YAAY,GAC3CoC,GAAI,CAAEjjF,KAAM,KAAMU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GACxDqC,GAAI,CAAEljF,KAAM,KAAMU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GACxDsC,GAAI,CAAEnjF,KAAM,KAAMU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GACxDuC,GAAI,CAAEpjF,KAAM,KAAMU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GACxDwC,GAAI,CAAErjF,KAAM,KAAMU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GACxDyC,GAAI,CAAEtjF,KAAM,KAAMU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GACxD0C,GAAI,CAAEvjF,KAAM,KAAMU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,IAE1D2C,eAAgB,CACd,GAAI,CAAExjF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GACtCa,KAAM,CAAE1hF,KAAM,OAAQU,MAAO,IAAKmgF,YAAY,GAC9Cc,KAAM,CAAE3hF,KAAM,OAAQU,MAAO,IAAKmgF,YAAY,GAC9Ce,KAAM,CAAE5hF,KAAM,OAAQU,MAAO,IAAKmgF,YAAY,GAC9CgB,KAAM,CAAE7hF,KAAM,OAAQU,MAAO,KAAMmgF,YAAY,GAC/CiB,KAAM,CAAE9hF,KAAM,OAAQU,MAAO,KAAMmgF,YAAY,GAC/CkB,IAAK,CAAE/hF,KAAM,MAAOU,MAAO,KAAMmgF,YAAY,GAC7CmB,MAAO,CAAEhiF,KAAM,QAASU,MAAO,KAAMmgF,YAAY,GACjDoB,MAAO,CAAEjiF,KAAM,QAASU,MAAO,KAAMmgF,YAAY,IAEnD4C,gBAAiB,CACf,GAAI,CAAEzjF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GACtC6C,KAAM,CAAE1jF,KAAM,OAAQU,MAAO,KAAMmgF,YAAY,GAC/C8C,KAAM,CAAE3jF,KAAM,OAAQU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GAC5D+C,KAAM,CAAE5jF,KAAM,OAAQU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GAC5DgD,KAAM,CAAE7jF,KAAM,OAAQU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GAC5DiD,KAAM,CAAE9jF,KAAM,OAAQU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GAC5DkD,IAAK,CAAE/jF,KAAM,MAAOU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GAC1DmD,KAAM,CAAEhkF,KAAM,OAAQU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,GAC5DoD,KAAM,CAAEjkF,KAAM,OAAQU,MAAOoB,KAAK4U,IAAI,KAAM,GAAImqE,YAAY,IAE9DqD,IAAK,CACH,GAAI,CAAElkF,KAAM,GAAIU,MAAO,EAAGmgF,YAAY,GACtCsD,GAAI,CAAEnkF,KAAM,KAAMU,MAAO,IAAKmgF,YAAY,KAI9C7E,EAASoI,UAAY,KAAc,GAAIpI,EAASiF,MAAOjF,EAASuF,MAChEvF,EAASqI,aAAe,KAAc,GAAIrI,EAAS8G,gBAAiB9G,EAAS+G,kBAC7E/G,EAASsI,YAAc,KAAc,GAAItI,EAASwH,eAAgBxH,EAASyH,iBAkB3E,IAAMtH,EAAkB,CAAC,OAAQ,SAAU,OAAQ,UAAW,cAAe,qBAAsB,sBAAuB,QAAS,OAE7HqC,EAAa,CACjBvC,KAAM,CACJpC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC0K,KAAM,CACJ1K,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC2K,OAAQ,CACN3K,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC4K,KAAM,CACJ5K,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC6K,QAAS,CACP7K,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC8K,YAAa,CACX9K,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC+K,mBAAoB,CAClB/K,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCgL,oBAAqB,CACnBhL,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAGvCiL,MAAO,CACLjL,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCkL,QAAS,CACPlL,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCmL,OAAQ,CACNnL,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCoL,OAAQ,CACNpL,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCqL,MAAO,CACLrL,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCsL,SAAU,CACRtL,WAAY,CAAC,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAGzCuL,gBAAiB,CACfvL,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCwL,qBAAsB,CACpBxL,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCyL,mBAAoB,CAClBzL,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC0L,oBAAqB,CACnB1L,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC2L,oBAAqB,CACnB3L,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC4L,qBAAsB,CACpB5L,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC6L,cAAe,CACb7L,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC8L,sBAAuB,CACrB9L,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAGzC+L,UAAW,CACT/L,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCgM,MAAO,CACLhM,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCiM,IAAK,CACHjM,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAIzC,IAAK,IAAM74E,KAAOw9E,EACZl9E,GAAek9E,EAAYx9E,KAC7Bw9E,EAAWx9E,GAAKA,IAAMA,GAI1B,IAEM+6E,EAAY,CAAE/7E,KAAM,GAAIsqB,KAFP,GAE6B5pB,MAAO,EAAG6e,OAAQ,EAAGs6D,WAAYsC,EAAgBx5E,KAAI,SAAAiK,GAAC,OAAI,MAExGuxE,EAAQ,CAEZ4H,MAAO,CACL/lF,KAAM,QACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEVymE,KAAM,CACJhmF,KAAM,OACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAEV0mE,KAAM,CACJjmF,KAAM,OACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAEV2mE,KAAM,CACJlmF,KAAM,OACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAEV4mE,KAAM,CACJnmF,KAAM,OACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEV6mE,KAAM,CACJpmF,KAAM,OACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEV8mE,IAAK,CACHrmF,KAAM,MACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,OACP6e,OAAQ,GAEV+mE,MAAO,CACLtmF,KAAM,QACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEVgnE,SAAU,CACRvmF,KAAM,WACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAGV1f,EAAG,CACDG,KAAM,IACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEVinE,GAAI,CACFxmF,KAAM,KACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAEVknE,GAAI,CACFzmF,KAAM,KACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAEV6G,GAAI,CACFpmB,KAAM,KACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAEVmnE,GAAI,CACF1mF,KAAM,KACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEVonE,GAAI,CACF3mF,KAAM,KACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEV0F,GAAI,CACFjlB,KAAM,KACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEV44B,GAAI,CACFn4C,KAAM,KACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEVqnE,IAAK,CACH5mF,KAAM,MACNsqB,KAAMk0D,EAAWgG,OACjBpG,SAAUpC,EAASC,KACnBv7E,MAAO,OACP6e,OAAQ,GAIVsnE,GAAI,CACF7mF,KAAM,KACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAAS4G,QACnBliF,MAAO,EACP6e,OAAQ,GAEVunE,KAAM,CACJ9mF,KAAM,OACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEVwnE,KAAM,CACJ/mF,KAAM,OACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,UACP6e,OAAQ,GAEVynE,KAAM,CACJhnF,KAAM,OACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,UACP6e,OAAQ,GAEV0nE,KAAM,CACJjnF,KAAM,OACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,eACP6e,OAAQ,GAEV2nE,KAAM,CACJlnF,KAAM,OACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEV4nE,KAAM,CACJnnF,KAAM,OACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEV6nE,MAAO,CACLpnF,KAAM,QACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,WACP6e,OAAQ,GAEV8nE,KAAM,CACJrnF,KAAM,OACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEV+nE,QAAS,CACPtnF,KAAM,UACNsqB,KAAMk0D,EAAWuG,QACjB3G,SAAUpC,EAASC,KACnBv7E,MAAO,IACP6e,OAAQ,GAIVgoE,GAAI,CACFvnF,KAAM,KACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAAS6G,MACnBniF,MAAO,EACP6e,OAAQ,GAEVm2D,EAAG,CACD11E,KAAM,IACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASiF,MACnBvgF,MAAO,KACP6e,OAAQ,GAEV7f,EAAG,CACDM,KAAM,IACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASiF,MACnBvgF,MAAO,KACP6e,OAAQ,GAEVioE,MAAO,CACLxnF,KAAM,QACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASuF,KACnB7gF,MAAO,KACP6e,OAAQ,GAEVkoE,KAAM,CACJznF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,aACP6e,OAAQ,GAEVmoE,KAAM,CACJ1nF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,cACP6e,OAAQ,GAEVooE,KAAM,CACJ3nF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,cACP6e,OAAQ,GAEVqoE,SAAU,CACR5nF,KAAM,WACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAEVsoE,WAAY,CACV7nF,KAAM,aACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAGVuoE,KAAM,CACJ9nF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAEVwoE,IAAK,CACH/nF,KAAM,MACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAIVyoE,MAAO,CACLhoF,KAAM,QACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEV0oE,UAAW,CACTjoF,KAAM,YACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,aACP6e,OAAQ,GAEV2oE,WAAY,CACVloF,KAAM,aACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEV4oE,KAAM,CACJnoF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEV6oE,GAAI,CACFpoF,KAAM,KACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAEV8oE,IAAK,CACHroF,KAAM,MACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEV+oE,KAAM,CACJtoF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEVgpE,MAAO,CACLvoF,KAAM,QACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEVipE,OAAQ,CACNxoF,KAAM,SACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,WACP6e,OAAQ,GAEVkpE,WAAY,CACVzoF,KAAM,aACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEVmpE,UAAW,CACT1oF,KAAM,YACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEVopE,SAAU,CACR3oF,KAAM,WACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAIVqpE,KAAM,CACJ5oF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,aACP6e,OAAQ,GAEVspE,KAAM,CACJ7oF,KAAM,OACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEVupE,GAAI,CACF9oF,KAAM,KACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEVwpE,GAAI,CACF/oF,KAAM,KACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEVypE,GAAI,CACFhpF,KAAM,KACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEV0pE,GAAI,CACFjpF,KAAM,KACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEV2pE,IAAK,CACHlpF,KAAM,MACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,WACP6e,OAAQ,GAEV4pE,IAAK,CACHnpF,KAAM,MACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEV6pE,IAAK,CACHppF,KAAM,MACNsqB,KAAMk0D,EAAWwG,OACjB5G,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAKVm3B,EAAG,CACD12C,KAAM,IACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASiF,MACnBvgF,MAAO,KACP6e,OAAQ,GAEV8pE,KAAM,CACJrpF,KAAM,OACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASuF,KACnB7gF,MAAO,KACP6e,OAAQ,GAGV+pE,IAAK,CACHtpF,KAAM,MACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASiF,MACnBvgF,MAAO,UACP6e,OAAQ,GAEV5e,EAAG,CACDX,KAAM,IACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASiF,MACnBvgF,MAAO,IACP6e,OAAQ,GAEVgqE,MAAO,CACLvpF,KAAM,QACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASuF,KACnB7gF,MAAO,IACP6e,OAAQ,GAGViqE,MAAO,CACLxpF,KAAM,QACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEVkqE,KAAM,CACJzpF,KAAM,OACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,kBACP6e,OAAQ,GAEVmqE,MAAO,CACL1pF,KAAM,QACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,cACP6e,OAAQ,GAEVoqE,UAAW,CACT3pF,KAAM,YACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,UACP6e,OAAQ,GAEVqqE,cAAe,CACb5pF,KAAM,gBACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,UACP6e,OAAQ,GAEVsqE,MAAO,CACL7pF,KAAM,QACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAEVuqE,MAAO,CACL9pF,KAAM,QACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,WACP6e,OAAQ,GAGVwqE,GAAI,CACF/pF,KAAM,KACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,YACP6e,OAAQ,GAEVyqE,GAAI,CACFhqF,KAAM,KACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,kBACP6e,OAAQ,GAEV0qE,GAAI,CACFjqF,KAAM,KACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,cACP6e,OAAQ,GAEV2qE,IAAK,CACHlqF,KAAM,MACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,UACP6e,OAAQ,GAEV4qE,IAAK,CACHnqF,KAAM,MACNsqB,KAAMk0D,EAAW+F,KACjBnG,SAAUpC,EAASC,KACnBv7E,MAAO,UACP6e,OAAQ,GAIV/d,EAAG,CACDxB,KAAM,IACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEVhN,IAAK,CACHvS,KAAM,MACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,GACP6e,OAAQ,GAEVihC,EAAG,CACDxgD,KAAM,IACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAEVuvB,OAAQ,CACN9uC,KAAM,SACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEV6qE,IAAK,CACHpqF,KAAM,MACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEV8qE,OAAQ,CACNrqF,KAAM,SACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,GACP6e,OAAQ,GAEV+qE,KAAM,CACJtqF,KAAM,OACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAEVgrE,IAAK,CACHvqF,KAAM,MACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,MACP6e,OAAQ,GAEVirE,KAAM,CACJxqF,KAAM,OACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,OACP6e,OAAQ,GAEVkrE,MAAO,CACLzqF,KAAM,QACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEVmrE,KAAM,CACJ1qF,KAAM,OACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEVorE,OAAQ,CACN3qF,KAAM,SACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEVqrE,QAAS,CACP5qF,KAAM,UACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAEVsrE,WAAY,CACV7qF,KAAM,aACNsqB,KAAMk0D,EAAWiG,KACjBrG,SAAUpC,EAASC,KACnBv7E,MAAO,SACP6e,OAAQ,GAIVurE,MAAO,CACL9qF,KAAM,QACNsqB,KAAMk0D,EAAWoH,UACjBxH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,EACRwrE,YAAY,GAEdC,GAAI,CACFhrF,KAAM,KACNsqB,KAAMk0D,EAAWoH,UACjBxH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,EACRwrE,YAAY,GAIdE,IAAK,CACHjrF,KAAM,MACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEV2rE,OAAQ,CACNlrF,KAAM,SACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAGV4rE,IAAK,CACHnrF,KAAM,MACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASiF,MACnBvgF,MAAO,KACP6e,OAAQ,GAEV46D,OAAQ,CACNn6E,KAAM,SACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASuF,KACnB7gF,MAAO,KACP6e,OAAQ,GAGV6rE,KAAM,CACJprF,KAAM,OACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASiF,MACnBvgF,MAAO,KACP6e,OAAQ,GAEV8rE,QAAS,CACPrrF,KAAM,UACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASuF,KACnB7gF,MAAO,KACP6e,OAAQ,GAGV+rE,MAAO,CACLtrF,KAAM,QACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAGVgsE,OAAQ,CACNvrF,KAAM,SACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAGVisE,OAAQ,CACNxrF,KAAM,SACNsqB,KAAMk0D,EAAWqH,MACjBzH,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAIV3O,EAAG,CACD5Q,KAAM,IACNsqB,KAAMk0D,EAAWkG,QACjBtG,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEVksE,OAAQ,CACNzrF,KAAM,SACNsqB,KAAMk0D,EAAWkG,QACjBtG,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAOVmsE,EAAG,CACD1rF,KAAM,IACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EACP6e,OAAQ,GAEVosE,KAAM,CACJ3rF,KAAM,OACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EACP6e,OAAQ,QAEVqsE,KAAM,CACJ5rF,KAAM,OACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EAAI,IACX6e,OAAQ,QAEVssE,KAAM,CACJ7rF,KAAM,OACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EAAI,IACX6e,OAAQ,GAEVusE,OAAQ,CACN9rF,KAAM,SACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EACP6e,OAAQ,GAEVwsE,QAAS,CACP/rF,KAAM,UACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EACP6e,OAAQ,QAEVysE,WAAY,CACVhsF,KAAM,aACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EAAI,IACX6e,OAAQ,QAEV0sE,QAAS,CACPjsF,KAAM,UACNsqB,KAAMk0D,EAAWmG,YACjBvG,SAAUpC,EAASC,KACnBv7E,MAAO,EAAI,IACX6e,OAAQ,GAIV2sE,IAAK,CACHlsF,KAAM,MACNsqB,KAAMk0D,EAAWqG,oBACjBzG,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEV4sE,KAAM,CACJnsF,KAAM,OACNsqB,KAAMk0D,EAAWqG,oBACjBzG,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAIV6sE,GAAI,CACFpsF,KAAM,KACNsqB,KAAMk0D,EAAWoG,mBACjBxG,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEV8sE,QAAS,CACPrsF,KAAM,UACNsqB,KAAMk0D,EAAWoG,mBACjBxG,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAOViT,EAAG,CACDxyB,KAAM,IACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEV+sE,OAAQ,CACNtsF,KAAM,SACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEVgtE,IAAK,CACHvsF,KAAM,MACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASiF,MACnBvgF,MAAO,KACP6e,OAAQ,GAEVitE,KAAM,CACJxsF,KAAM,OACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASuF,KACnB7gF,MAAO,KACP6e,OAAQ,GAEVktE,IAAK,CACHzsF,KAAM,MACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASC,KACnBv7E,MAAO,gBACP6e,OAAQ,GAEVmtE,WAAY,CACV1sF,KAAM,aACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASC,KACnBv7E,MAAO,gBACP6e,OAAQ,GAEVotE,IAAK,CACH3sF,KAAM,MACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASuF,KACnB7gF,MAAO,UACP6e,OAAQ,GAEVqtE,cAAe,CACb5sF,KAAM,gBACNsqB,KAAMk0D,EAAWsG,MACjB1G,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAIV0zC,EAAG,CACDjzD,KAAM,IACNsqB,KAAMk0D,EAAWyG,OACjB7G,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEVstE,MAAO,CACL7sF,KAAM,QACNsqB,KAAMk0D,EAAWyG,OACjB7G,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEVutE,IAAK,CACH9sF,KAAM,MACNsqB,KAAMk0D,EAAWyG,OACjB7G,SAAUpC,EAASC,KACnBv7E,MAAO,KACP6e,OAAQ,GAEVwtE,GAAI,CACF/sF,KAAM,KACNsqB,KAAMk0D,EAAWyG,OACjB7G,SAAUpC,EAASiF,MACnBvgF,MAAO,KACP6e,OAAQ,GAEV2kE,IAAK,CACHlkF,KAAM,MACNsqB,KAAMk0D,EAAWyG,OACjB7G,SAAUpC,EAASkI,IACnBxjF,MAAO,cACP6e,OAAQ,GAEVytE,GAAI,CACFhtF,KAAM,KACNsqB,KAAMk0D,EAAWyG,OACjB7G,SAAUpC,EAASiF,MACnBvgF,MAAO,eACP6e,OAAQ,GAEV0tE,aAAc,CACZjtF,KAAM,eACNsqB,KAAMk0D,EAAWyG,OACjB7G,SAAUpC,EAASuF,KACnB7gF,MAAO,eACP6e,OAAQ,GAIVy/D,EAAG,CACDh/E,KAAM,IACNsqB,KAAMk0D,EAAW0G,MACjB9G,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEV2tE,KAAM,CACJltF,KAAM,OACNsqB,KAAMk0D,EAAW0G,MACjB9G,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEV4tE,GAAI,CACFntF,KAAM,KACNsqB,KAAMk0D,EAAW0G,MACjB9G,SAAUpC,EAASC,KACnBv7E,MAAO,eACP6e,OAAQ,GAIV8gE,IAAK,CACHrgF,KAAM,MACNsqB,KAAMk0D,EAAW0G,MACjB9G,SAAUpC,EAASiF,MACnBvgF,MAAOmV,EAAQm9C,EACfzzC,OAAQ,GAGV+gE,GAAI,CACFtgF,KAAM,KACNsqB,KAAMk0D,EAAW0G,MACjB9G,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAIV6tE,GAAI,CACFptF,KAAM,KACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAEV8tE,IAAK,CACHrtF,KAAM,MACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASC,KACnBv7E,MAAO,iBACP6e,OAAQ,GAEV+tE,IAAK,CACHttF,KAAM,MACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASC,KACnBv7E,MAAO,OACP6e,OAAQ,GAEVguE,IAAK,CACHvtF,KAAM,MACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASoI,UACnB1jF,MAAO,IACP6e,OAAQ,GAEViuE,KAAM,CACJxtF,KAAM,OACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEVkuE,KAAM,CACJztF,KAAM,OACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEVmuE,MAAO,CACL1tF,KAAM,QACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAEVouE,MAAO,CACL3tF,KAAM,QACNsqB,KAAMk0D,EAAW2G,SACjB/G,SAAUpC,EAASC,KACnBv7E,MAAO,QACP6e,OAAQ,GAIVquE,QAAS,CACP5tF,KAAM,UACNsqB,KAAMk0D,EAAW4G,gBACjBhH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEVhT,EAAG,CACDvM,KAAM,IACNsqB,KAAMk0D,EAAW4G,gBACjBhH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAGVsuE,MAAO,CACL7tF,KAAM,QACNsqB,KAAMk0D,EAAW6G,qBACjBjH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEVwW,EAAG,CACD/1B,KAAM,IACNsqB,KAAMk0D,EAAW6G,qBACjBjH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAGVuuE,KAAM,CACJ9tF,KAAM,OACNsqB,KAAMk0D,EAAW8G,mBACjBlH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEVzD,EAAG,CACD9b,KAAM,IACNsqB,KAAMk0D,EAAW8G,mBACjBlH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAGVwuE,IAAK,CACH/tF,KAAM,MACNsqB,KAAMk0D,EAAW+G,oBACjBnH,SAAUpC,EAASoI,UACnB1jF,MAAO,EACP6e,OAAQ,GAaVyuE,MAAO,CACLhuF,KAAM,QACNsqB,KAAMk0D,EAAWgH,oBACjBpH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEV0uE,EAAG,CACDjuF,KAAM,IACNsqB,KAAMk0D,EAAWgH,oBACjBpH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAGV2uE,QAAS,CACPluF,KAAM,UACNsqB,KAAMk0D,EAAWiH,qBACjBrH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEVoC,EAAG,CACD3hB,KAAM,IACNsqB,KAAMk0D,EAAWiH,qBACjBrH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAGV4uE,MAAO,CACLnuF,KAAM,QACNsqB,KAAMk0D,EAAWkH,cACjBtH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEV6uE,GAAI,CACFpuF,KAAM,KACNsqB,KAAMk0D,EAAWkH,cACjBtH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAGV8uE,MAAO,CACLruF,KAAM,QACNsqB,KAAMk0D,EAAWmH,sBACjBvH,SAAUpC,EAASuF,KACnB7gF,MAAO,EACP6e,OAAQ,GAEV6hE,EAAG,CACDphF,KAAM,IACNsqB,KAAMk0D,EAAWmH,sBACjBvH,SAAUpC,EAASiF,MACnBvgF,MAAO,EACP6e,OAAQ,GAIVhK,EAAG,CACDvV,KAAM,IACNsqB,KAAMk0D,EAAWsH,IACjB1H,SAAUpC,EAASqI,aACnB3jF,MAAO,EACP6e,OAAQ,GAEV+uE,KAAM,CACJtuF,KAAM,OACNsqB,KAAMk0D,EAAWsH,IACjB1H,SAAUpC,EAASsI,YACnB5jF,MAAO,EACP6e,OAAQ,GAEV+S,EAAG,CACDtyB,KAAM,IACNsqB,KAAMk0D,EAAWsH,IACjB1H,SAAUpC,EAASqI,aACnB3jF,MAAO,EACP6e,OAAQ,GAEVgvE,MAAO,CACLvuF,KAAM,QACNsqB,KAAMk0D,EAAWsH,IACjB1H,SAAUpC,EAASsI,YACnB5jF,MAAO,EACP6e,OAAQ,IAKNivE,EAAU,CACdC,OAAQ,QACRC,OAAQ,OACRC,KAAM,OACNC,MAAO,OACPC,MAAO,OACPC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,UAAW,WAEX9kE,GAAI,IACJ+kE,OAAQ,QACRC,MAAO,QACPC,OAAQ,QACRC,UAAW,WACXC,YAAa,aACbC,OAAQ,QACRC,WAAY,YACZC,YAAa,aACbC,MAAO,OACPC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,QAAS,SACTC,YAAa,aACbC,WAAY,YACZC,UAAW,WACXC,KAAM,MAENC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,MAAO,OACPC,OAAQ,QACRC,YAAa,YACbC,eAAgB,gBAChBC,OAAQ,QACRC,GAAI,MACJC,IAAK,MAELC,KAAM,MACNC,IAAK,gBAELC,MAAO,OACPC,SAAU,UACVC,OAAQ,OACRC,OAAQ,OACRC,OAAQ,OACRC,QAAS,OAETC,KAAM,OACNC,MAAO,QACPC,MAAO,QAEPC,QAAS,SACTC,KAAM,SACNC,QAAS,SACTC,KAAM,SACNC,MAAO,OACPC,GAAI,OACJC,IAAK,OACLC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,MAAO,OACPC,QAAS,SACTC,UAAW,UACXC,UAAW,aAEXxH,MAAO,QAEPyH,QAAS,SACTC,QAAS,SACTC,SAAU,UACVC,OAAQ,QACRC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,WAAY,SAEZC,KAAM,MACNC,MAAO,OACPC,OAAQ,QAERC,QAAS,SACTC,SAAU,UACVC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,OAAQ,QACRC,cAAe,eACfC,MAAO,OAEPC,IAAK,OACLC,KAAM,SAQR,SAASC,EAAsBvjE,GAC7B,GAAsB,cAAlBA,EAAO5N,OAAwB,CACjC,IAAM2N,EAAKyjE,GAAS1lC,GACpB+vB,EAAM8M,IAAIvqF,MAAQ,IAAI0tD,EAAU,GAChC+vB,EAAMgN,IAAIzqF,MAAQ2vB,EAAGzI,IAAI,KACzBu2D,EAAMiN,KAAK1qF,MAAQ2vB,EAAGzI,IAAI,KAC1Bu2D,EAAMmN,MAAM5qF,MAAQ2vB,EAAGxJ,MAAM,GAC7Bs3D,EAAMoN,OAAO7qF,MAAQ2vB,EAAGzI,IAAI,OAC5Bu2D,EAAMqN,OAAO9qF,MAAQ2vB,EAAGzI,IAAI,YAE5Bu2D,EAAM8M,IAAIvqF,MAAQ,EAClBy9E,EAAMgN,IAAIzqF,MAAQoB,KAAKoV,GAAK,IAC5BinE,EAAMiN,KAAK1qF,MAAQoB,KAAKoV,GAAK,IAC7BinE,EAAMmN,MAAM5qF,MAAkB,EAAVoB,KAAKoV,GACzBinE,EAAMoN,OAAO7qF,MAAQoB,KAAKoV,GAAK,MAC/BinE,EAAMqN,OAAO9qF,MAAQoB,KAAKoV,GAAK,MAIjCinE,EAAM+M,OAAOxqF,MAAQy9E,EAAM8M,IAAIvqF,MAC/By9E,EAAMhE,OAAOz5E,MAAQy9E,EAAMgN,IAAIzqF,MAC/By9E,EAAMkN,QAAQ3qF,MAAQy9E,EAAMiN,KAAK1qF,MAInCmzF,EAAqBvjE,GAEjB4kB,GAEFA,EAAG,UAAU,SAAUwV,EAAMlrC,GACvBkrC,EAAKhoC,SAAWlD,EAAKkD,QACvBmxE,EAAqBnpC,MAU3B,IAAMgzB,EAAe,CACnBoC,GAAI,CAEF7D,KAAM,CAAErjB,KAAMmjB,EAAWp2B,OAAQq2B,EAASC,KAAK,KAC/CuI,OAAQ,CAAE5rB,KAAMulB,EAAMt+E,EAAG8lD,OAAQq2B,EAASiF,MAAM,KAChDsD,KAAM,CAAE3rB,KAAMulB,EAAMznC,EAAGiP,OAAQq2B,EAASiF,MAAMnxE,GAC9C20E,KAAM,CAAE7rB,KAAMulB,EAAM38E,EAAGmkD,OAAQq2B,EAASiF,MAAM,KAC9CyD,QAAS,CAAE9rB,KAAMulB,EAAMvtE,EAAG+0C,OAAQq2B,EAASiF,MAAM,KACjD0D,YAAa,CAAE/rB,KAAMulB,EAAMuN,EAAG/lC,OAAQq2B,EAASiF,MAAM,KACrD2D,mBAAoB,CAAEhsB,KAAMulB,EAAMiO,GAAIzmC,OAAQq2B,EAASiF,MAAM,KAC7D4D,oBAAqB,CAAEjsB,KAAMulB,EAAM+N,IAAKvmC,OAAQq2B,EAASiF,MAAM,KAC/D4E,MAAO,CAAEjtB,KAAMulB,EAAM8M,IAAKtlC,OAAQq2B,EAASiF,MAAM,KACjD6E,IAAK,CAAEltB,KAAMulB,EAAMmQ,KAAM3oC,OAAQq2B,EAASiF,MAAM,KAGhD6D,MAAO,CAAElsB,KAAMulB,EAAM3rD,EAAGmzB,OAAQq2B,EAASiF,MAAM,KAC/CgE,OAAQ,CAAErsB,KAAMulB,EAAMlrB,EAAGtN,OAAQq2B,EAASiF,MAAM,KAChDiE,MAAO,CAAEtsB,KAAMulB,EAAMa,EAAGr5B,OAAQq2B,EAASiF,MAAM,KAC/CkE,SAAU,CAAEvsB,KAAMulB,EAAMiP,GAAIznC,OAAQq2B,EAASiF,MAAM,KACnDmE,gBAAiB,CAAExsB,KAAMulB,EAAM5xE,EAAGo5C,OAAQq2B,EAASiF,MAAM,KACzDoE,qBAAsB,CAAEzsB,KAAMulB,EAAMpoD,EAAG4vB,OAAQq2B,EAASiF,MAAM,KAC9DqE,mBAAoB,CAAE1sB,KAAMulB,EAAMriE,EAAG6pC,OAAQq2B,EAASiF,MAAM,KAC5DsE,oBAAqB,CAAE3sB,KAAMulB,EAAM4P,IAAKpoC,OAAQq2B,EAASiF,MAAM,KAC/DuE,oBAAqB,CAAE5sB,KAAMulB,EAAM8P,EAAGtoC,OAAQq2B,EAASiF,MAAM,KAC7DwE,qBAAsB,CAAE7sB,KAAMulB,EAAMx8D,EAAGgkC,OAAQq2B,EAASiF,MAAM,KAC9DyE,cAAe,CAAE9sB,KAAMulB,EAAMiQ,GAAIzoC,OAAQq2B,EAASiF,MAAM,KACxD0E,sBAAuB,CAAE/sB,KAAMulB,EAAMiD,EAAGz7B,OAAQq2B,EAASiF,MAAM,KAC/D2E,UAAW,CAAEhtB,KAAMulB,EAAM6M,GAAIrlC,OAAQq2B,EAASiF,MAAM,OAKxDvD,EAAaqW,IAAMr6B,KAAKjjD,MAAMijD,KAAKh9C,UAAUghE,EAAaoC,KAC1DpC,EAAaqW,IAAIvP,OAAS,CAAE5rB,KAAMulB,EAAMt+E,EAAG8lD,OAAQq2B,EAASiF,MAAMnhF,GAClE49E,EAAaqW,IAAIxP,KAAO,CAAE3rB,KAAMulB,EAAMznC,EAAGiP,OAAQq2B,EAASiF,MAAM,KAChEvD,EAAaqW,IAAIjP,MAAQ,CAAElsB,KAAMulB,EAAMoO,IAAK5mC,OAAQq2B,EAASiF,MAAM,KACnEvD,EAAaqW,IAAI9O,OAAS,CAAErsB,KAAMulB,EAAM2O,IAAKnnC,OAAQq2B,EAASC,KAAK,KAInEyB,EAAasW,GAAKt6B,KAAKjjD,MAAMijD,KAAKh9C,UAAUghE,EAAaoC,KACzDpC,EAAasW,GAAGxP,OAAS,CAAE5rB,KAAMulB,EAAMsI,GAAI9gC,OAAQq2B,EAASC,KAAK,KACjEyB,EAAasW,GAAGzP,KAAO,CAAE3rB,KAAMulB,EAAM+L,IAAKvkC,OAAQq2B,EAASC,KAAK,KAChEyB,EAAasW,GAAGrP,YAAc,CAAE/rB,KAAMulB,EAAMyN,KAAMjmC,OAAQq2B,EAASC,KAAK,KACxEyB,EAAasW,GAAGlP,MAAQ,CAAElsB,KAAMulB,EAAMsO,IAAK9mC,OAAQq2B,EAASC,KAAK,KACjEyB,EAAasW,GAAG/O,OAAS,CAAErsB,KAAMulB,EAAM+F,IAAKv+B,OAAQq2B,EAASkI,IAAI,KACjExG,EAAasW,GAAG9O,MAAQ,CAAEtsB,KAAMulB,EAAMgP,GAAIxnC,OAAQq2B,EAASC,KAAK,KAChEyB,EAAasW,GAAG7O,SAAW,CAAEvsB,KAAMulB,EAAMkP,IAAK1nC,OAAQq2B,EAASC,KAAK,KAKpEyB,EAAaC,KAAOjkB,KAAKjjD,MAAMijD,KAAKh9C,UAAUghE,EAAaoC,KAG3D,IAAIH,EAAoBjC,EAAaC,KAmErC,IAAK,IAAM38E,KA7DX0zD,EAAKu/B,cAAgB,SAAUj0F,GAC7B,IAAIsB,GAAeo8E,EAAc19E,GAG/B,MAAM,IAAIid,MAAM,eAAiBjd,EAAO,iCAAmCG,OAAOkS,KAAKqrE,GAAczvE,KAAK,OAF1G0xE,EAAoBjC,EAAa19E,IAUrC00D,EAAKw/B,cAAgB,WACnB,IAAK,IAAMlzF,KAAO08E,EAChB,GAAIp8E,GAAeo8E,EAAc18E,IAC3B08E,EAAa18E,KAAS2+E,EACxB,OAAO3+E,GAUf0zD,EAAKy/B,eAAiB,CACpB/lC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAUxhD,EAAI,KAG3BklB,SAAU,SAAUllB,GAClB,OAAO,IAAIklB,EAASllB,IAGtBiJ,QAAS,SAAUjJ,GACjB,OAAOA,GAGT8V,OAAQ,SAAU9V,GAChB,OAAOA,IAYX8nD,EAAKmpB,oBAAsB,SAAU1xE,GACnC,IAAKuoD,EAAKy/B,eAAehoF,GACvB,MAAM,IAAIxD,UAAU,qBAAuBwD,EAAO,KAGpD,OAAOuoD,EAAKy/B,eAAehoF,IAIXgyE,EAChB,GAAI78E,GAAe68E,EAAOn9E,GAAM,CAC9B,IAAM43D,EAAOulB,EAAMn9E,GACnB43D,EAAKihB,WAAajhB,EAAKtuC,KAAKuvD,WAKhC,IAAK,IAAM75E,KAAQwuF,EACjB,GAAIltF,GAAektF,EAASxuF,GAAO,CACjC,IAAM44D,EAAOulB,EAAMqQ,EAAQxuF,IACrBo0F,EAAQ,GACd,IAAK,IAAMpzF,KAAO43D,EACZt3D,GAAes3D,EAAM53D,KACvBozF,EAAMpzF,GAAO43D,EAAK53D,IAGtBozF,EAAMp0F,KAAOA,EACbm+E,EAAMn+E,GAAQo0F,EAsRlB,OA7QA1/B,EAAKooB,aAAe,SAAuBh9E,GACzC,MAAO,aAAa4J,KAAK5J,IAgC3B40D,EAAK2/B,WAAa,SAAU/xF,EAAK2B,GAC/B,GAAqB,WAAjB,IAAQ3B,GACV,MAAM,IAAIqG,UAAU,6DAItB,GAAI1E,GAAWA,EAAQqwF,SACrB,IAAK,IAAMtzF,KAAOsB,EAIhB,GAHIhB,GAAegB,EAAKtB,IACtB0zD,EAAK6/B,WAAWvzF,GAEdsB,EAAItB,GAAKwzF,QACX,IAAK,IAAI/0F,EAAI,EAAGA,EAAI6C,EAAItB,GAAKwzF,QAAQtxF,OAAQzD,IAC3Ci1D,EAAK6/B,WAAWjyF,EAAItB,GAAKwzF,QAAQ/0F,IAOzC,IAAIg1F,EACJ,IAAK,IAAMzzF,KAAOsB,EACZhB,GAAegB,EAAKtB,KACtByzF,EAAW//B,EAAKggC,iBAAiB1zF,EAAKsB,EAAItB,KAG9C,OAAOyzF,GA+BT//B,EAAKggC,iBAAmB,SAAU10F,EAAMsC,EAAK2B,GAK3C,GAJI,MAAQ3B,IACVA,EAAM,IAGc,iBAAVtC,EACV,MAAM,IAAI2I,UAAU,mEAItB,GAAIrH,GAAe68E,EAAOn+E,GACxB,MAAM,IAAIid,MAAM,uBAAyBjd,EAAO,4CAjGpD,SAAgCA,GAC9B,IAAK,IAAIP,EAAI,EAAGA,EAAIO,EAAKkD,OAAQzD,IAAK,CAGpC,GAFAK,EAAIE,EAAK+d,OAAOte,GAEN,IAANA,IAAYi1D,EAAKooB,aAAah9E,GAAM,MAAM,IAAImd,MAAM,yDAA2Djd,EAAO,KAE1H,GAAIP,EAAI,IAAOi1D,EAAKooB,aAAah9E,KAC/Bw8E,EAAQx8E,GAAO,MAAM,IAAImd,MAAM,kEAAoEjd,EAAO,MA+F9G20F,CAAsB30F,GAEtB,IAGI40F,EACAxW,EACAyW,EALAC,EAAU,KACVN,EAAU,GACVj1E,EAAS,EAIb,GAAIjd,GAAoB,SAAbA,EAAI6J,KACb2oF,EAAUxyF,EAAI6uB,aACT,GAAqB,iBAAT7uB,EACL,KAARA,IACFsyF,EAAatyF,OAEV,IAAqB,WAAjB,IAAQA,GASjB,MAAM,IAAIqG,UAAU,uBAAyB3I,EAAO,WAAasC,EAAIX,WAAa,+CARlFizF,EAAatyF,EAAIsyF,WACjBxW,EAAW97E,EAAI87E,SACf7+D,EAASjd,EAAIid,OACbs1E,EAAWvyF,EAAIuyF,SACXvyF,EAAIkyF,UACNA,EAAUlyF,EAAIkyF,QAAQz3E,WAM1B,GAAIy3E,EACF,IAAK,IAAI/0F,EAAI,EAAGA,EAAI+0F,EAAQtxF,OAAQzD,IAClC,GAAI6B,GAAe68E,EAAOqW,EAAQ/0F,IAChC,MAAM,IAAIwd,MAAM,wBAA0Bu3E,EAAQ/0F,GAAK,2CAK7D,GAAIm1F,GAAsC,iBAAhBA,IAA6BE,EACrD,IACEA,EAAUpgC,EAAKj+C,MAAMm+E,EAAY,CAAEhX,cAAc,IACjD,MAAOx6B,GAEP,MADAA,EAAGwF,QAAU,0BAA4B5oD,EAAO,WAAa40F,EAAa,MAAQxxC,EAAGwF,QAC9ExF,OAEAwxC,GAAkC,SAApBA,EAAWzoF,OAClC2oF,EAAUF,EAAWzjE,SAGvBqjE,EAAUA,GAAW,GACrBj1E,EAASA,GAAU,EACqB6+D,EAApCA,GAAYA,EAAS2W,aAA0B/Y,EAASoC,EAAS2W,gBAAoD/Y,EAASC,KAIlI,IAAI+Y,EAAU,GACd,GAAKF,EAqCE,CACLE,EAAU,CACRh1F,KAAMA,EACNU,MAAOo0F,EAAQp0F,MACfm5E,WAAYib,EAAQjb,WAAWpqE,MAAM,GACrC2uE,SAAUA,EACV7+D,OAAQA,GAIV,IAAI01E,GAAW,EACf,IAAK,IAAMx1F,KAAK++E,EACd,GAAIl9E,GAAek9E,EAAY/+E,GAAI,CAEjC,IADA,IAAI2W,GAAQ,EACH5B,EAAI,EAAGA,EAAI2nE,EAAgBj5E,OAAQsR,IAC1C,GAAI1S,KAAK2T,KAAKu/E,EAAQnb,WAAWrlE,IAAM,IAAMgqE,EAAW/+E,GAAGo6E,WAAWrlE,IAAM,IAAM,MAAO,CACvF4B,GAAQ,EACR,MAGJ,GAAIA,EAAO,CACT6+E,GAAW,EACXD,EAAQ1qE,KAAOk0D,EAAW/+E,GAC1B,OAIN,IAAKw1F,EAAU,CACbJ,EAAWA,GAAY70F,EAAO,SAE9B,IAAMk1F,EAAc,CAAErb,WAAYib,EAAQjb,WAAWpqE,MAAM,IAC3DylF,EAAYl0F,IAAM6zF,EAClBrW,EAAWqW,GAAYK,EAEvBvV,EAAkBkV,GAAY,CAC5Bj8B,KAAMo8B,EACNrvC,OAAQq2B,EAASC,KAAK,KAGxB+Y,EAAQ1qE,KAAOk0D,EAAWqW,QA5EhB,CAGZ,GADAA,EAAWA,GAAY70F,EAAO,SAC1Bm8E,EAAgB52D,QAAQsvE,IAAa,EACvC,MAAM,IAAI53E,MAAM,gCAAkCjd,EAAO,2EAK3D,IAAK,IAAMuV,KAHX4mE,EAAgBrhE,KAAK+5E,GAGLrW,EACVl9E,GAAek9E,EAAYjpE,KAC7BipE,EAAWjpE,GAAGskE,WAAWsC,EAAgBj5E,OAAS,GAAK,GAM3D,IADA,IAAMgyF,EAAc,CAAErb,WAAY,IACzBp6E,EAAI,EAAGA,EAAI08E,EAAgBj5E,OAAQzD,IAC1Cy1F,EAAYrb,WAAWp6E,GAAK,EAE9By1F,EAAYrb,WAAWsC,EAAgBj5E,OAAS,GAAK,EACrDgyF,EAAYl0F,IAAM6zF,EAClBrW,EAAWqW,GAAYK,EAEvBF,EAAU,CACRh1F,KAAMA,EACNU,MAAO,EACPm5E,WAAY2E,EAAWqW,GAAUhb,WAAWpqE,MAAM,GAClD2uE,SAAUA,EACV7+D,OAAQA,EACR+K,KAAMk0D,EAAWqW,IAGnBlV,EAAkBkV,GAAY,CAC5Bj8B,KAAMo8B,EACNrvC,OAAQq2B,EAASC,KAAK,KA6C1BvnB,EAAKypB,MAAMn+E,GAAQg1F,EAEnB,IAAK,IAAIv1F,EAAI,EAAGA,EAAI+0F,EAAQtxF,OAAQzD,IAAK,CACvC,IAAM01F,EAAYX,EAAQ/0F,GACpB20F,EAAQ,GACd,IAAK,IAAMpzF,KAAOg0F,EACZ1zF,GAAe0zF,EAASh0F,KAC1BozF,EAAMpzF,GAAOg0F,EAAQh0F,IAGzBozF,EAAMp0F,KAAOm1F,EACbzgC,EAAKypB,MAAMgX,GAAaf,EAM1B,cAFO5W,EAAU5T,MAEV,IAAIlV,EAAK,KAAM10D,IAGxB00D,EAAK6/B,WAAa,SAAUv0F,UACnB00D,EAAKypB,MAAMn+E,IAIpB00D,EAAKsnB,SAAWA,EAChBtnB,EAAKynB,gBAAkBA,EACvBznB,EAAK8pB,WAAaA,EAClB9pB,EAAKgpB,aAAeA,EACpBhpB,EAAKypB,MAAQA,EAENzpB,IACN,CAAE1F,SAAS,ICvtGDomC,GAAqCp2F,GAJrC,OACQ,CAAC,QAAS,SAG+C,YAAqB,IAAlBmiC,EAAkB,EAAlBA,MAAOuzB,EAAW,EAAXA,KAyBtF,OAAOvzB,EA7BI,OA6BQ,CACjBuzB,KAAM,SAAU9nD,GACd,OAAOA,EAAEukB,SAGXhV,OAAQ,SAAUvP,GAChB,OAAI8nD,EAAK+pB,gBAAgB7xE,GAChB,IAAI8nD,EAAK,KAAM9nD,GAGjB8nD,EAAKj+C,MAAM7J,EAAG,CAAEgxE,cAAc,KAGvC,kDAAmD,SAAUl9E,EAAOk4D,GAClE,OAAO,IAAIlE,EAAKh0D,EAAOk4D,IAGzB,iBAAkB,SAAUhsD,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC7CXg2F,GAA+Br2F,GAH/B,SACQ,CAAC,QAAS,iBAEyC,YAA6B,IAA1BmiC,EAA0B,EAA1BA,MAAOs0B,EAAmB,EAAnBA,aA4BhF,OAAOt0B,EA/BI,SA+BQ,CACjB,GAAI,WACF,OAAO,IAAIs0B,EAAa,KAG1Bt5C,OAAQ,SAAUi0C,GAChB,OAAO,IAAIqF,EAAa,GAAIrF,IAG9B,iBAAkB,SAAU93B,GAC1B,OAAO,IAAIm9B,EAAan9B,IAG1B,yBAA0B,SAAUA,EAAM83B,GACxC,OAAO,IAAIqF,EAAan9B,EAAM83B,SC1CvBklC,GAAmCt2F,GAHnC,aACQ,CAAC,QAAS,SAE6C,YAAqB,IAAlBmiC,EAAkB,EAAlBA,MAAOuzB,EAAW,EAAXA,KA0CpF,OAAOvzB,EA7CI,aA6CQ,CAGjB,iBAAkB,SAAU7+B,EAAK2B,GAC/B,OAAOywD,EAAK2/B,WAAW/xF,EAAK2B,IAI9B9D,OAAQ,SAAUmC,GAChB,OAAOoyD,EAAK2/B,WAAW/xF,EAAK,KAI9B,yCAA0C,SAAUtC,EAAMu1F,EAAKtxF,GAC7D,IAAM3B,EAAM,GAEZ,OADAA,EAAItC,GAAQu1F,EACL7gC,EAAK2/B,WAAW/xF,EAAK2B,IAI9B,iCAAkC,SAAUjE,EAAMu1F,GAChD,IAAMjzF,EAAM,GAEZ,OADAA,EAAItC,GAAQu1F,EACL7gC,EAAK2/B,WAAW/xF,EAAK,KAI9B6Z,OAAQ,SAAUnc,GAChB,IAAMsC,EAAM,GAEZ,OADAA,EAAItC,GAAQ,GACL00D,EAAK2/B,WAAW/xF,EAAK,UCvErBkzF,GAA6Bx2F,GAH7B,OACQ,CAAC,QAAS,SAAU,YAE6B,YAAgC,IAA7BmiC,EAA6B,EAA7BA,MAAO7Q,EAAsB,EAAtBA,OAAQza,EAAc,EAAdA,QAwBtF,OAAOsrB,EA3BI,OA2BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAKA,IAAM,GAAKA,GAAK,GAAM0jB,EAAO0vC,YACzBl+D,KAAK4V,KAAK9K,GAEV,IAAIiJ,EAAQjJ,EAAG,GAAG8K,QAI7B7B,QAAS,SAAUjJ,GACjB,OAAOA,EAAE8K,QAGX02C,UAAW,SAAUxhD,GACnB,OAAOA,EAAE8K,QAGX,iBAAkB,SAAU9K,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCtCjB,SAASo2F,GAAa7oF,GAC3B,OAAOuL,GAAMvL,GAIR,SAAS8oF,GAAY9oF,GAC1B,OAAO9K,KAAK2V,KAAK,EAAI7K,GAIhB,SAAS+oF,GAAa/oF,GAC3B,OAAOoJ,SAASpJ,IACX9K,KAAK6T,KAAK/I,EAAI,GAAKA,GAAK9K,KAAK6T,IAAI/I,GAAKA,EAAI,KAAO,EAClD,EAIC,SAASgpF,GAAYhpF,GAC1B,OAAO9K,KAAK6V,KAAK,EAAI/K,GAIhB,SAASipF,GAAajpF,GAC3B,IAAMkpF,EAAO,EAAIlpF,EACjB,OAAO9K,KAAK6T,IAAImgF,EAAOh0F,KAAKiV,KAAK++E,EAAOA,EAAO,IAI1C,SAASC,GAAYnpF,GAC1B,OAAO9K,KAAK4V,KAAK,EAAI9K,GAIhB,SAASopF,GAAappF,GAC3B,IAAMkpF,EAAO,EAAIlpF,EACX4L,EAAM1W,KAAKiV,KAAK++E,EAAOA,EAAO,GACpC,OAAOh0F,KAAK6T,IAAI6C,EAAMs9E,GASjB,SAASG,GAAarpF,GAC3B,OAAOsL,GAAMtL,GAcR,SAASspF,GAAatpF,GAC3B,OAAOqL,GAAMrL,GAcR,SAASupF,GAAWvpF,GACzB,OAAO,EAAI9K,KAAK+pB,IAAIjf,GAIf,SAASwpF,GAAYxpF,GAC1B,IAAMkV,EAAIhgB,KAAKmT,IAAI,EAAIrI,GACvB,OAAQkV,EAAI,IAAMA,EAAI,GAIjB,SAASu0E,GAAWzpF,GACzB,OAAO,EAAI9K,KAAKoU,IAAItJ,GAIf,SAAS0pF,GAAY1pF,GAE1B,OAAU,IAANA,EACKmJ,OAAO4zD,kBAEP7nE,KAAK2T,IAAI,GAAK3T,KAAKmT,IAAIrI,GAAK9K,KAAKmT,KAAKrI,KAAO+hB,EAAK/hB,GAKtD,SAAS2pF,GAAW3pF,GACzB,OAAO,EAAI9K,KAAKmU,IAAIrJ,GAIf,SAAS4pF,GAAY5pF,GAC1B,OAAO,GAAK9K,KAAKmT,IAAIrI,GAAK9K,KAAKmT,KAAKrI,IAS/B,SAAS6pF,GAAY7pF,GAC1B,OAAOsI,GAAKtI,GAlHd6oF,GAAY/xD,UAXD,SAgBXgyD,GAAWhyD,UAhBA,SAuBXiyD,GAAYjyD,UAvBD,SA4BXkyD,GAAWlyD,UA5BA,SAkCXmyD,GAAYnyD,UAlCD,SAuCXqyD,GAAWryD,UAvCA,SA8CXsyD,GAAYtyD,UA9CD,SAwDXuyD,GAAYvyD,UAxDD,SAuEXwyD,GAAYxyD,UAvED,SAsFXyyD,GAAUzyD,UAtFC,SA4FX0yD,GAAW1yD,UA5FA,SAiGX2yD,GAAU3yD,UAjGC,SA2GX4yD,GAAW5yD,UA3GA,SAgHX6yD,GAAU7yD,UAhHC,SAqHX8yD,GAAW9yD,UArHA,SA+HX+yD,GAAW/yD,UA/HA,SCEX,IAGagzD,GAA8B13F,GAH9B,QACQ,CAAC,QAAS,SAAU,YAE8B,YAAgC,IAA7BmiC,EAA6B,EAA7BA,MAAO7Q,EAAsB,EAAtBA,OAAQza,EAAc,EAAdA,QAsBvF,OAAOsrB,EAzBI,QAyBQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,GAAK,GAAK0jB,EAAO0vC,YACZy1B,GAAY7oF,GAEjBA,IAAM,EACD,IAAIiJ,EAAQ/T,KAAK6T,IAAI7T,KAAKiV,KAAKnK,EAAIA,EAAI,GAAKA,GAAI9K,KAAKoV,IAEvD,IAAIrB,EAAQjJ,EAAG,GAAGuL,SAG3BtC,QAAS,SAAUjJ,GACjB,OAAOA,EAAEuL,SAGXi2C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEuL,SAGX,iBAAkB,SAAUvL,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC1CXs3F,GAA6B33F,GAH7B,OACQ,CAAC,QAAS,cAEuC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAwB9E,OAAOjtB,EA3BI,OA2BQ,CACjBze,OAAQgzE,GAER7/E,QAAS,SAAUjJ,GACjB,OAAOA,EAAEgqF,QAGXxoC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,GAAG6K,QAGjC,iBAAkB,SAAU7K,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCpCXw3F,GAA8B73F,GAH9B,QACQ,CAAC,QAAS,SAAU,UAAW,cAEmB,YAA2C,IAAxCmiC,EAAwC,EAAxCA,MAAO7Q,EAAiC,EAAjCA,OAAQza,EAAyB,EAAzBA,QAASu4C,EAAgB,EAAhBA,UAsBhG,OAAOjtB,EAzBI,QAyBQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,GAAK,GAAKA,IAAM,GAAK0jB,EAAO0vC,YACvB21B,GAAY/oF,GAEd,IAAIiJ,EAAQjJ,EAAG,GAAGkqF,SAG3BjhF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEkqF,SAGX1oC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,GAAGqL,SAGjC,iBAAkB,SAAUrL,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCvCX03F,GAA6B/3F,GAH7B,OACQ,CAAC,QAAS,SAAU,UAAW,cAEkB,YAA2C,IAAxCmiC,EAAwC,EAAxCA,MAAO7Q,EAAiC,EAAjCA,OAAQza,EAAyB,EAAzBA,QAASu4C,EAAgB,EAAhBA,UAwB/F,OAAOjtB,EA3BI,OA2BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,IAAM,GAAKA,GAAK,GAAK0jB,EAAO0vC,YACvB41B,GAAWhpF,GAEb,IAAIiJ,EAAQjJ,EAAG,GAAGoqF,QAG3BnhF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEoqF,QAGX5oC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,GAAG+K,QAGjC,iBAAkB,SAAU/K,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzCX43F,GAA8Bj4F,GAH9B,QACQ,CAAC,QAAS,cAEwC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAsB/E,OAAOjtB,EAzBI,QAyBQ,CACjBze,OAAQmzE,GAERhgF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEsqF,SAGX9oC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,GAAGsL,SAGjC,iBAAkB,SAAUtL,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YClCX83F,GAA6Bn4F,GAH7B,OACQ,CAAC,QAAS,SAAU,UAAW,cAEkB,YAA2C,IAAxCmiC,EAAwC,EAAxCA,MAAO7Q,EAAiC,EAAjCA,OAAQza,EAAyB,EAAzBA,QAASu4C,EAAgB,EAAhBA,UAwB/F,OAAOjtB,EA3BI,OA2BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAIA,IAAM,GAAKA,GAAK,GAAK0jB,EAAO0vC,YACvB+1B,GAAWnpF,GAEb,IAAIiJ,EAAQjJ,EAAG,GAAGwqF,QAG3BvhF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEwqF,QAGXhpC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,GAAG8K,QAGjC,iBAAkB,SAAU9K,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzCXg4F,GAA8Br4F,GAH9B,QACQ,CAAC,QAAS,SAAU,UAAW,cAEmB,YAA2C,IAAxCmiC,EAAwC,EAAxCA,MAAO7Q,EAAiC,EAAjCA,OAAQza,EAAyB,EAAzBA,QAASu4C,EAAgB,EAAhBA,UAsBhG,OAAOjtB,EAzBI,QAyBQ,CACjBze,OAAQ,SAAU9V,GAChB,GAAKA,GAAK,GAAKA,IAAM,GAAM0jB,EAAO0vC,YAAa,CAC7C,IAAM81B,EAAO,EAAIlpF,EACjB,GAAIkpF,EAAO,GAAKxlE,EAAO0vC,YACrB,OAAOg2B,GAAYppF,GAGrB,IAAM4L,EAAM1W,KAAKiV,KAAK++E,EAAOA,EAAO,GACpC,OAAO,IAAIjgF,EAAQ/T,KAAK6T,IAAI6C,EAAMs9E,GAAOh0F,KAAKoV,IAGhD,OAAO,IAAIrB,EAAQjJ,EAAG,GAAG0qF,SAG3BzhF,QAAS,SAAUjJ,GACjB,OAAOA,EAAE0qF,SAGXlpC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,GAAGuL,SAGjC,iBAAkB,SAAUvL,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC/CXk4F,GAA6Bv4F,GAH7B,OACQ,CAAC,QAAS,SAAU,YAE6B,YAAgC,IAA7BmiC,EAA6B,EAA7BA,MAAO7Q,EAAsB,EAAtBA,OAAQza,EAAc,EAAdA,QAwBtF,OAAOsrB,EA3BI,OA2BQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAKA,IAAM,GAAKA,GAAK,GAAM0jB,EAAO0vC,YACzBl+D,KAAK6V,KAAK/K,GAEV,IAAIiJ,EAAQjJ,EAAG,GAAG+K,QAI7B9B,QAAS,SAAUjJ,GACjB,OAAOA,EAAE+K,QAGXy2C,UAAW,SAAUxhD,GACnB,OAAOA,EAAE+K,QAGX,iBAAkB,SAAU/K,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SC1CjBm4F,GAA8Bx4F,GAH9B,QACQ,CAAC,UAEiD,YAsBrE,OAAOmiC,EAtB6E,EAAZA,OAsB3D,QAAS,CACpBze,OAAQuzE,GAERpgF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEsL,SAGXk2C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEsL,SAGX,iBAAkB,SAAUtL,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SCpCjBo4F,GAA6Bz4F,GAH7B,OACQ,CAAC,UAEgD,YAwBpE,OAAOmiC,EAxB4E,EAAZA,OAwB1D,OAAQ,CACnBze,OAAQ,SAAU9V,GAChB,OAAO9K,KAAK2V,KAAK7K,IAGnBiJ,QAAS,SAAUjJ,GACjB,OAAOA,EAAE6K,QAGX22C,UAAW,SAAUxhD,GACnB,OAAOA,EAAE6K,QAGX,iBAAkB,SAAU7K,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SC3BjBq4F,GAA8B14F,GAT9B,QACQ,CACnB,QACA,SACA,cACA,YACA,gBAGqE,YAA4D,IAAzDmiC,EAAyD,EAAzDA,MAAOutB,EAAkD,EAAlDA,OAAQ8G,EAA0C,EAA1CA,YAAapH,EAA6B,EAA7BA,UAAWC,EAAkB,EAAlBA,YACzGuR,EAAcJ,GAAkB,CAAEr+B,QAAOq0B,gBACzCmL,EAAcP,GAAkB,CAAEj/B,UAClCqjC,EAAcH,GAAkB,CAAEljC,QAAOq0B,gBACzCmI,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCqL,EAAcJ,GAAkB,CAAEt/B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UA+BxC,OAAOA,EA/CI,QA+CQ,CAEjB,iBAAkBr/B,KAAK6U,MAMvB,uBAAwB,SAAUU,EAAGzK,GACnC,OAAOwhD,EAAUz3C,MAAMU,EAAGzK,IAG5B,6BAA8B,SAAUA,EAAGyK,GACzC,OAAOmtD,EAAY53D,EAAGyK,EAAGhY,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GAExC,OAAOuoD,EAAYvoD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOspD,EAAY/zD,EAAGyK,EAAGhY,MAAM,IAGjC,2BAA4B,SAAUuN,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAGhY,OAG3B,eAAgB,SAAUuN,EAAGyK,GAC3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAC5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAC5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mCAAoC,SAAUzK,EAAGyK,GAC/C,OAAOsmD,EAAY/wD,EAAGyK,EAAGhY,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAC9C,OAAOumD,EAAYhxD,EAAGyK,EAAGhY,MAAM,IAGjC,mCAAoC,SAAUuN,EAAGyK,GAE/C,OAAOwpD,EAAYxpD,EAAGzK,EAAGvN,MAAM,IAGjC,kCAAmC,SAAUuN,EAAGyK,GAE9C,OAAOumD,EAAYvmD,EAAGzK,EAAGvN,MAAM,IAGjC,4BAA6B,SAAUuN,EAAGyK,GACxC,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGhY,MAAM,GAAO0d,WAGhD,4BAA6B,SAAUnQ,EAAGyK,GACxC,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGvN,MAAM,GAAM0d,gBCjHtC46E,GAA8B34F,GAH9B,QACQ,CAAC,QAAS,SAAU,YAE8B,YAAgC,IAA7BmiC,EAA6B,EAA7BA,MAAO7Q,EAAsB,EAAtBA,OAAQza,EAAc,EAAdA,QAsBvF,OAAOsrB,EAzBI,QAyBQ,CACjBze,OAAQ,SAAU9V,GAChB,OAAKA,GAAK,GAAKA,IAAM,GAAM0jB,EAAO0vC,YACzBk2B,GAAYtpF,GAEd,IAAIiJ,EAAQjJ,EAAG,GAAGqL,SAG3BpC,QAAS,SAAUjJ,GACjB,OAAOA,EAAEqL,SAGXm2C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEqL,SAGX,iBAAkB,SAAUrL,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SCzCjBu4F,GAA4B54F,GAH5B,MACQ,CAAC,UAE+C,YA2BnE,OAAOmiC,EA3B2E,EAAZA,OAH3D,MA8BQ,CACjBze,OAAQ5gB,KAAKmU,IAEbJ,QAAS,SAAUjJ,GACjB,OAAOA,EAAEqJ,OAGXm4C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEqJ,OAGXy+C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,oCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC7CXw4F,GAA6B74F,GAH7B,OACQ,CAAC,UAEgD,YAsBpE,OAAOmiC,EAtB4E,EAAZA,OAH5D,OAyBQ,CACjBze,OAAQo1E,GAERjiF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEoI,QAGXo5C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEoI,QAGX0/C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,qCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzCX04F,GAA4B/4F,GAH5B,MACQ,CAAC,QAAS,cAEsC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAsB7E,OAAOjtB,EAzBI,MAyBQ,CACjBze,OAAQyzE,GAERtgF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEorF,OAGX5pC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,EAAEif,QAGhC6oC,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,oCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzCX44F,GAA6Bj5F,GAH7B,OACQ,CAAC,QAAS,cAEuC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAwB9E,OAAOjtB,EA3BI,OA2BQ,CACjBze,OAAQ0zE,GAERvgF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEsrF,QAGX9pC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,EAAEic,SAGhC6rC,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,qCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC3CX84F,GAA4Bn5F,GAH5B,MACQ,CAAC,QAAS,cAEsC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAsB7E,OAAOjtB,EAzBI,MAyBQ,CACjBze,OAAQ2zE,GAERxgF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEwrF,OAGXhqC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,EAAEsJ,QAGhCw+C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,oCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzCXg5F,GAA6Br5F,GAH7B,OACQ,CAAC,QAAS,cAEuC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAwB9E,OAAOjtB,EA3BI,OA2BQ,CACjBze,OAAQ4zE,GAERzgF,QAAS,SAAUjJ,GACjB,OAAOA,EAAE0rF,QAGXlqC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,EAAEsI,SAGhCw/C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,qCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC3CXk5F,GAA4Bv5F,GAH5B,MACQ,CAAC,QAAS,cAEsC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAsB7E,OAAOjtB,EAzBI,MAyBQ,CACjBze,OAAQ6zE,GAER1gF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEw9E,OAGXh8B,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,EAAEqJ,QAGhCy+C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,oCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YCzCXm5F,GAA6Bx5F,GAH7B,OACQ,CAAC,QAAS,cAEuC,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOitB,EAAgB,EAAhBA,UAwB9E,OAAOjtB,EA3BI,OA2BQ,CACjBze,OAAQ8zE,GAER3gF,QAAS,SAAUjJ,GACjB,OAAOA,EAAE6rF,QAGXrqC,UAAW,SAAUxhD,GACnB,OAAO,IAAIwhD,EAAU,GAAGxmC,IAAIhb,EAAEoI,SAGhC0/C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,qCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAC1B,OAAOwmD,GAAQxmD,EAAGvN,YC5CXq5F,GAA4B15F,GAH5B,MACQ,CAAC,UAE+C,YA2BnE,OAAOmiC,EA3B2E,EAAZA,OAH3D,MA8BQ,CACjBze,OAAQ5gB,KAAKoU,IAEbL,QAAS,SAAUjJ,GACjB,OAAOA,EAAEsJ,OAGXk4C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEsJ,OAGXw+C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,oCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SC9CjBs5F,GAA6B35F,GAH7B,OACQ,CAAC,UAEgD,YAsBpE,OAAOmiC,EAtB4E,EAAZA,OAH5D,OAyBQ,CACjBze,OAAQ+zE,GAER5gF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEsI,QAGXk5C,UAAW,SAAUxhD,GACnB,OAAOA,EAAEsI,QAGXw/C,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,qCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SC3CjBu5F,GAA4B55F,GAH5B,MACQ,CAAC,UAE+C,YAwBnE,OAAOmiC,EAxB2E,EAAZA,OAH3D,MA2BQ,CACjBze,OAAQ5gB,KAAK+pB,IAEbhW,QAAS,SAAUjJ,GACjB,OAAOA,EAAEif,OAGXuiC,UAAW,SAAUxhD,GACnB,OAAOA,EAAEif,OAGX6oC,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,oCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SC3CjBw5F,GAA6B75F,GAH7B,OACQ,CAAC,UAEgD,YAyBpE,OAAOmiC,EAzB4E,EAAZA,OAyB1D,OAAQ,CACnBze,OAAQo2E,GAERjjF,QAAS,SAAUjJ,GACjB,OAAOA,EAAEic,QAGXulC,UAAW,SAAUxhD,GACnB,OAAOA,EAAEic,QAGX6rC,KAAM,SAAU9nD,GACd,IAAKA,EAAE4iD,QAAQ5iD,EAAEpK,YAAYg8E,WAAWqH,OACtC,MAAM,IAAIl9E,UAAU,qCAEtB,OAAOtJ,KAAKuN,EAAElM,QAGhB,iBAAkB,SAAUkM,GAE1B,OAAOwmD,GAAQxmD,EAAGvN,MAAM,SC9CjB05F,GAAqC/5F,GAHrC,eACQ,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEE,YAAiE,IAA9DmiC,EAA8D,EAA9DA,MAAO4N,EAAuD,EAAvDA,KAAMshB,EAAiD,EAAjDA,OAAQwmB,EAAyC,EAAzCA,eAAgB1O,EAAyB,EAAzBA,MAAO9Z,EAAkB,EAAlBA,YAuB3H,OAAOltB,EA1BI,eA0BQ,CACjB,iCAAkC,SAAU63D,EAAIC,GAC9C,IAAI3uF,EAAS,GAEb,GAAuC,IAAnC+lD,EAAOthB,EAAKiqD,GAAK,IAAI7wB,EAAM,KAAgD,IAAnC9X,EAAOthB,EAAKkqD,GAAK,IAAI9wB,EAAM,IAAW,CAChF,IAAM+wB,EAAKn3C,GAAQxyC,MAAMP,QAAQgqF,GAAMA,EAAKA,EAAGhpC,WAAWxyC,KAAKq5D,GACzDsiB,EAAKp3C,GAAQxyC,MAAMP,QAAQiqF,GAAMA,EAAKA,EAAGjpC,WAAWxyC,KAAKq5D,GAC/DvsE,EAAS,GACT,IAAK,IAAI7K,EAAI,EAAGA,EAAIy5F,EAAGh2F,OAAQzD,IAC7B,IAAK,IAAI+U,EAAI,EAAGA,EAAI2kF,EAAGj2F,OAAQsR,IAC7BlK,EAAOwQ,KAAK,CAACo+E,EAAGz5F,GAAI05F,EAAG3kF,KAK7B,OAAIjF,MAAMP,QAAQgqF,IAAOzpF,MAAMP,QAAQiqF,GAC9B3uF,EAGF,IAAI+jD,EAAY/jD,SC1ChB8uF,GAAsCp6F,GAHtC,gBACQ,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEG,YAAiE,IAA9DmiC,EAA8D,EAA9DA,MAAO4N,EAAuD,EAAvDA,KAAMshB,EAAiD,EAAjDA,OAAQwmB,EAAyC,EAAzCA,eAAgB1O,EAAyB,EAAzBA,MAAO9Z,EAAkB,EAAlBA,YAsB5H,OAAOltB,EAzBI,gBAyBQ,CACjB,iCAAkC,SAAU63D,EAAIC,GAC9C,IAAI3uF,EACJ,GAAuC,IAAnC+lD,EAAOthB,EAAKiqD,GAAK,IAAI7wB,EAAM,IAC7B79D,EAAS,OACJ,IAAuC,IAAnC+lD,EAAOthB,EAAKkqD,GAAK,IAAI9wB,EAAM,IACpC,OAAOpmB,GAAQi3C,EAAGhpC,WAElB,IAGIqpC,EAHEH,EAAK/tC,GAASpJ,GAAQxyC,MAAMP,QAAQgqF,GAAMA,EAAKA,EAAGhpC,WAAWxyC,KAAKq5D,IAClEsiB,EAAKhuC,GAASpJ,GAAQxyC,MAAMP,QAAQiqF,GAAMA,EAAKA,EAAGjpC,WAAWxyC,KAAKq5D,IACxEvsE,EAAS,GAET,IAAK,IAAI7K,EAAI,EAAGA,EAAIy5F,EAAGh2F,OAAQzD,IAAK,CAClC45F,GAAO,EACP,IAAK,IAAI7kF,EAAI,EAAGA,EAAI2kF,EAAGj2F,OAAQsR,IAC7B,GAAiD,IAA7CqiE,EAAeqiB,EAAGz5F,GAAGiB,MAAOy4F,EAAG3kF,GAAG9T,QAAgBw4F,EAAGz5F,GAAG2rD,aAAe+tC,EAAG3kF,GAAG42C,WAAY,CAC3FiuC,GAAO,EACP,MAGCA,GACH/uF,EAAOwQ,KAAKo+E,EAAGz5F,KAKrB,OAAI8P,MAAMP,QAAQgqF,IAAOzpF,MAAMP,QAAQiqF,GAC9B5tC,GAAW/gD,GAGb,IAAI+jD,EAAYhD,GAAW/gD,UCpD3BgvF,GAAoCt6F,GAHpC,cACQ,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEC,YAAiE,IAA9DmiC,EAA8D,EAA9DA,MAAO4N,EAAuD,EAAvDA,KAAMshB,EAAiD,EAAjDA,OAAQwmB,EAAyC,EAAzCA,eAAgB1O,EAAyB,EAAzBA,MAAO9Z,EAAkB,EAAlBA,YAoB1H,OAAOltB,EAvBI,cAuBQ,CACjB,iBAAkB,SAAU7rB,GAC1B,IAAIhL,EACJ,GAAsC,IAAlC+lD,EAAOthB,EAAKz5B,GAAI,IAAI6yD,EAAM,IAC5B79D,EAAS,OACJ,CACL,IAAMiL,EAAIwsC,GAAQxyC,MAAMP,QAAQsG,GAAKA,EAAIA,EAAE06C,WAAWxyC,KAAKq5D,IAC3DvsE,EAAS,IACFwQ,KAAKvF,EAAE,IACd,IAAK,IAAI9V,EAAI,EAAGA,EAAI8V,EAAErS,OAAQzD,IACW,IAAnCo3E,EAAethE,EAAE9V,GAAI8V,EAAE9V,EAAI,KAC7B6K,EAAOwQ,KAAKvF,EAAE9V,IAKpB,OAAI8P,MAAMP,QAAQsG,GACThL,EAGF,IAAI+jD,EAAY/jD,SCxChBivF,GAAqCv6F,GAHrC,eACQ,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEE,YAAiE,IAA9DmiC,EAA8D,EAA9DA,MAAO4N,EAAuD,EAAvDA,KAAMshB,EAAiD,EAAjDA,OAAQwmB,EAAyC,EAAzCA,eAAgB1O,EAAyB,EAAzBA,MAAO9Z,EAAkB,EAAlBA,YAsB3H,OAAOltB,EAzBI,eAyBQ,CACjB,iCAAkC,SAAU63D,EAAIC,GAC9C,IAAI3uF,EACJ,GAAuC,IAAnC+lD,EAAOthB,EAAKiqD,GAAK,IAAI7wB,EAAM,KAAgD,IAAnC9X,EAAOthB,EAAKkqD,GAAK,IAAI9wB,EAAM,IACrE79D,EAAS,OACJ,CACL,IAAM4uF,EAAK/tC,GAASpJ,GAAQxyC,MAAMP,QAAQgqF,GAAMA,EAAKA,EAAGhpC,WAAWxyC,KAAKq5D,IAClEsiB,EAAKhuC,GAASpJ,GAAQxyC,MAAMP,QAAQiqF,GAAMA,EAAKA,EAAGjpC,WAAWxyC,KAAKq5D,IACxEvsE,EAAS,GACT,IAAK,IAAI7K,EAAI,EAAGA,EAAIy5F,EAAGh2F,OAAQzD,IAC7B,IAAK,IAAI+U,EAAI,EAAGA,EAAI2kF,EAAGj2F,OAAQsR,IAC7B,GAAiD,IAA7CqiE,EAAeqiB,EAAGz5F,GAAGiB,MAAOy4F,EAAG3kF,GAAG9T,QAAgBw4F,EAAGz5F,GAAG2rD,aAAe+tC,EAAG3kF,GAAG42C,WAAY,CAC3F9gD,EAAOwQ,KAAKo+E,EAAGz5F,IACf,OAMR,OAAI8P,MAAMP,QAAQgqF,IAAOzpF,MAAMP,QAAQiqF,GAC9B5tC,GAAW/gD,GAGb,IAAI+jD,EAAYhD,GAAW/gD,UC7C3BkvF,GAAoCx6F,GAHpC,cACQ,CAAC,QAAS,OAAQ,SAAU,iBAAkB,UAEU,YAAoD,IAAjDmiC,EAAiD,EAAjDA,MAAO4N,EAA0C,EAA1CA,KAAMshB,EAAoC,EAApCA,OAAQwmB,EAA4B,EAA5BA,eAAgB1O,EAAY,EAAZA,MAsBnH,OAAOhnC,EAzBI,cAyBQ,CACjB,iCAAkC,SAAU63D,EAAIC,GAC9C,GAAuC,IAAnC5oC,EAAOthB,EAAKiqD,GAAK,IAAI7wB,EAAM,IAC7B,OAAO,EACF,GAAuC,IAAnC9X,EAAOthB,EAAKkqD,GAAK,IAAI9wB,EAAM,IACpC,OAAO,EAKT,IAHA,IAEIkxB,EAFEH,EAAK/tC,GAASpJ,GAAQxyC,MAAMP,QAAQgqF,GAAMA,EAAKA,EAAGhpC,WAAWxyC,KAAKq5D,IAClEsiB,EAAKhuC,GAASpJ,GAAQxyC,MAAMP,QAAQiqF,GAAMA,EAAKA,EAAGjpC,WAAWxyC,KAAKq5D,IAE/Dp3E,EAAI,EAAGA,EAAIy5F,EAAGh2F,OAAQzD,IAAK,CAClC45F,GAAO,EACP,IAAK,IAAI7kF,EAAI,EAAGA,EAAI2kF,EAAGj2F,OAAQsR,IAC7B,GAAiD,IAA7CqiE,EAAeqiB,EAAGz5F,GAAGiB,MAAOy4F,EAAG3kF,GAAG9T,QAAgBw4F,EAAGz5F,GAAG2rD,aAAe+tC,EAAG3kF,GAAG42C,WAAY,CAC3FiuC,GAAO,EACP,MAGJ,IAAa,IAATA,EACF,OAAO,EAGX,OAAO,QC5CAI,GAAwCz6F,GAHxC,kBACQ,CAAC,QAAS,OAAQ,SAAU,iBAAkB,UAEc,YAAoD,IAAjDmiC,EAAiD,EAAjDA,MAAO4N,EAA0C,EAA1CA,KAAMshB,EAAoC,EAApCA,OAAQwmB,EAA4B,EAA5BA,eAAgB1O,EAAY,EAAZA,MAsBvH,OAAOhnC,EAzBI,kBAyBQ,CACjB,0DAA2D,SAAUrf,EAAGxM,GACtE,GAAsC,IAAlC+6C,EAAOthB,EAAKz5B,GAAI,IAAI6yD,EAAM,IAC5B,OAAO,EAIT,IAFA,IAAM5yD,EAAIwsC,GAAQxyC,MAAMP,QAAQsG,GAAKA,EAAIA,EAAE06C,WACvChgB,EAAQ,EACHvwC,EAAI,EAAGA,EAAI8V,EAAErS,OAAQzD,IACI,IAA5Bo3E,EAAethE,EAAE9V,GAAIqiB,IACvBkuB,IAGJ,OAAOA,QClCA0pD,GAAoC16F,GAHpC,cACQ,CAAC,QAAS,OAAQ,SAAU,iBAAkB,UAEU,YAAoD,IAAjDmiC,EAAiD,EAAjDA,MAAO4N,EAA0C,EAA1CA,KAAMshB,EAAoC,EAApCA,OAAQwmB,EAA4B,EAA5BA,eAAgB1O,EAAY,EAAZA,MAoBnH,OAAOhnC,EAvBI,cAuBQ,CACjB,iBAAkB,SAAU7rB,GAC1B,GAAsC,IAAlC+6C,EAAOthB,EAAKz5B,GAAI,IAAI6yD,EAAM,IAC5B,MAAO,GAKT,IAHA,IAAM5yD,EAAIwsC,GAAQxyC,MAAMP,QAAQsG,GAAKA,EAAIA,EAAE06C,WAAWxyC,KAAKq5D,GACrDvsE,EAAS,GACXoY,EAAS,EACNA,EAAO/gB,SAAS,GAAGuB,QAAUqS,EAAErS,QACpCoH,EAAOwQ,KAAK6+E,EAAQpkF,EAAGmN,EAAO/gB,SAAS,GAAG4S,MAAM,IAAIiR,YACpD9C,IAGF,OAgBJ,SAAgBtS,GAEd,IADA,IAAI4H,EAAO,GACFvY,EAAI2Q,EAAMlN,OAAS,EAAGzD,EAAI,EAAGA,IACpC,IAAK,IAAI+U,EAAI,EAAGA,EAAI/U,EAAG+U,IACjBpE,EAAMoE,GAAGtR,OAASkN,EAAMoE,EAAI,GAAGtR,SACjC8U,EAAO5H,EAAMoE,GACbpE,EAAMoE,GAAKpE,EAAMoE,EAAI,GACrBpE,EAAMoE,EAAI,GAAKwD,GAIrB,OAAO5H,EA3BEwpF,CAAMtvF,MAKjB,SAASqvF,EAASvpF,EAAOypF,GAEvB,IADA,IAAMvvF,EAAS,GACN7K,EAAI,EAAGA,EAAIo6F,EAAS32F,OAAQzD,IACf,MAAhBo6F,EAASp6F,IACX6K,EAAOwQ,KAAK1K,EAAM3Q,IAGtB,OAAO6K,MC7CEwvF,GAAgC96F,GAHhC,UACQ,CAAC,QAAS,mBAE0C,YAA+B,IAA5BmiC,EAA4B,EAA5BA,MAAO01C,EAAqB,EAArBA,eAsBjF,OAAO11C,EAzBI,UAyBQ,CACjB,iBAAkB,SAAU7rB,GAC1B,OAAO/F,MAAMP,QAAQsG,GAAKysC,GAAQzsC,GAAGpS,OAAS6+C,GAAQzsC,EAAE06C,WAAW9sD,QAErE,0BAA2B,SAAUoS,EAAGykF,GACtC,IAAe,IAAXA,GAAiC,IAAbzkF,EAAEpS,OACxB,OAAOqM,MAAMP,QAAQsG,GAAKysC,GAAQzsC,GAAGpS,OAAS6+C,GAAQzsC,EAAE06C,WAAW9sD,OAInE,IAFA,IAAMqS,EAAIwsC,GAAQxyC,MAAMP,QAAQsG,GAAKA,EAAIA,EAAE06C,WAAWxyC,KAAKq5D,GACvD7mC,EAAQ,EACHvwC,EAAI,EAAGA,EAAI8V,EAAErS,OAAQzD,IACW,IAAnCo3E,EAAethE,EAAE9V,GAAI8V,EAAE9V,EAAI,KAC7BuwC,IAGJ,OAAOA,QCrCFgqD,GAAyCh7F,GAHzC,mBACQ,CAAC,QAAS,OAAQ,SAAU,SAAU,gBAAiB,UAEM,YAA2D,IAAxDmiC,EAAwD,EAAxDA,MAAO4N,EAAiD,EAAjDA,KAAM1+B,EAA2C,EAA3CA,OAAQggD,EAAmC,EAAnCA,OAAQ4pC,EAA2B,EAA3BA,cAAe9xB,EAAY,EAAZA,MAsB/H,OAAOhnC,EAzBI,mBAyBQ,CACjB,iCAAkC,SAAU63D,EAAIC,GAC9C,GAAuC,IAAnC5oC,EAAOthB,EAAKiqD,GAAK,IAAI7wB,EAAM,IAC7B,OAAOpmB,GAAQk3C,GACV,GAAuC,IAAnC5oC,EAAOthB,EAAKkqD,GAAK,IAAI9wB,EAAM,IACpC,OAAOpmB,GAAQi3C,GAEjB,IAAME,EAAKn3C,GAAQi3C,GACbG,EAAKp3C,GAAQk3C,GACnB,OAAO5oF,EAAO4pF,EAAcf,EAAIC,GAAKc,EAAcd,EAAID,UC/BhDgB,GAAiCl7F,GAHjC,WACQ,CAAC,QAAS,OAAQ,SAAU,SAAU,eAAgB,mBAAoB,UAErB,YAA4E,IAAzEmiC,EAAyE,EAAzEA,MAAO4N,EAAkE,EAAlEA,KAAM1+B,EAA4D,EAA5DA,OAAQggD,EAAoD,EAApDA,OAAQ8pC,EAA4C,EAA5CA,aAAcC,EAA8B,EAA9BA,iBAAkBjyB,EAAY,EAAZA,MAsBxI,OAAOhnC,EAzBI,WAyBQ,CACjB,iCAAkC,SAAU63D,EAAIC,GAC9C,GAAuC,IAAnC5oC,EAAOthB,EAAKiqD,GAAK,IAAI7wB,EAAM,IAC7B,OAAOpmB,GAAQk3C,GACV,GAAuC,IAAnC5oC,EAAOthB,EAAKkqD,GAAK,IAAI9wB,EAAM,IACpC,OAAOpmB,GAAQi3C,GAEjB,IAAME,EAAKn3C,GAAQi3C,GACbG,EAAKp3C,GAAQk3C,GACnB,OAAO5oF,EAAO+pF,EAAiBlB,EAAIC,GAAKgB,EAAajB,EAAIC,UCnBlDkB,GAA4Br7F,GAV5B,MACQ,CACnB,QACA,SACA,YACA,cACA,cACA,iBAGmE,YAA0E,IAAvEmiC,EAAuE,EAAvEA,MAAOutB,EAAgE,EAAhEA,OAAQuS,EAAwD,EAAxDA,UAAWzL,EAA6C,EAA7CA,YAAanH,EAAgC,EAAhCA,YACvG+Q,GADuI,EAAnB3J,aACtGyI,GAAkB,CAAE/8B,WAClCk+B,EAAcX,GAAkB,CAAEv9B,QAAOq0B,gBACzC8J,EAAcP,GAAkB,CAAE59B,QAAOktB,gBACzCkR,EAAcP,GAAkB,CAAE79B,UAClCy8B,EAAcV,GAAkB,CAAE/7B,UAoCxC,OAAOA,EAnDI,MAmDQuqB,GAAO,CAGxB,2BAA4B,SAAU9+C,EAAGyK,GACvC,OAAOkoD,EAAY3yD,EAAGyK,EAAG4pD,IAG3B,4BAA6B,SAAUr0D,EAAGyK,GACxC,OAAO+nD,EAAYxyD,EAAGyK,EAAG4pD,GAAW,IAGtC,4BAA6B,SAAUr0D,EAAGyK,GACxC,OAAO+nD,EAAY/nD,EAAGzK,EAAGq0D,GAAW,IAGtC,6BAA8B,SAAUr0D,EAAGyK,GACzC,OAAOgoD,EAAYzyD,EAAGyK,EAAG4pD,IAG3B,eAAgB,SAAUr0D,EAAGyK,GAE3B,OAAOhY,KAAKqvD,EAAO9hD,GAAI8hD,EAAOr3C,IAAI0F,WAGpC,gBAAiB,SAAUnQ,EAAGyK,GAE5B,OAAOhY,KAAKqvD,EAAO9hD,GAAIyK,IAGzB,gBAAiB,SAAUzK,EAAGyK,GAE5B,OAAOhY,KAAKuN,EAAG8hD,EAAOr3C,KAGxB,mBAAoB,SAAUzK,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAG4pD,GAAW,IAGtC,oBAAqB,SAAUr0D,EAAGyK,GAChC,OAAOioD,EAAY1yD,EAAGyK,EAAG4pD,GAAW,IAGtC,mBAAoB,SAAUr0D,EAAGyK,GAC/B,OAAOumD,EAAYvmD,EAAGzK,EAAGq0D,GAAW,IAGtC,oBAAqB,SAAUr0D,EAAGyK,GAChC,OAAOioD,EAAYjoD,EAAGzK,EAAGq0D,GAAW,IAGtC,aAAc,SAAUr0D,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAG4pD,GAAW,GAAOlkD,WAGrD,aAAc,SAAUnQ,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAOr3C,GAAIzK,EAAGq0D,GAAW,GAAMlkD,WAGpD,WAAYkkD,EAEZ,mBAAoB,SAAUr0D,EAAGyK,EAAG4rD,GAGlC,IAFA,IAAI34D,EAASjL,KAAKuN,EAAGyK,GAEZ5X,EAAI,EAAGA,EAAIwjE,EAAK//D,OAAQzD,IAC/B6K,EAASjL,KAAKiL,EAAQ24D,EAAKxjE,IAG7B,OAAO6K,IAER22D,EAAUl9B,gBCnHFu2D,GAA8Bt7F,GAZ9B,QACQ,CACnB,QACA,MACA,YACA,eACA,iBACA,OACA,UACA,eAGqE,YAAwF,IAArFmiC,EAAqF,EAArFA,MAAO1rB,EAA8E,EAA9EA,IAAKwrD,EAAyE,EAAzEA,UAAWwS,EAA8D,EAA9DA,aAAcvS,EAAgD,EAAhDA,eAAgBnqD,EAAgC,EAAhCA,KAAMotD,EAA0B,EAA1BA,QAASn6C,EAAiB,EAAjBA,WA6B5I,OAAOmX,EAzCI,QAyCQ,CACjB,yBAiBF,SAAiBtkB,GAMf,IAHA,IAAIvS,EAAS,EACTiwF,EAAU,EAEL96F,EAAI,EAAGA,EAAIod,EAAK3Z,OAAQzD,IAAK,CACpC,IAAMiB,EAAQ+U,EAAIoH,EAAKpd,IACnB0kE,EAAQo2B,EAAS75F,IACnB4J,EAAS42D,EAAe52D,EACtB42D,EAAeuS,EAAa8mB,EAAS75F,GAAQ+yE,EAAa8mB,EAAS75F,KACrE4J,EAAS22D,EAAU32D,EAAQ,GAC3BiwF,EAAU75F,GAEV4J,EAAS22D,EAAU32D,EAAQ0f,EAAWtpB,GAClCwgE,EAAeuS,EAAa/yE,EAAO65F,GAAU9mB,EAAa/yE,EAAO65F,IACjE75F,GAIR,OAAOwgE,EAAeq5B,EAASxjF,EAAKzM,KAnCpCiF,MAAO,SAAU3C,GACf,OAAOvN,KAAK4G,MAAM5G,KAAM0iD,GAAQn1C,KAGlCsjD,OAAQ,SAAUtjD,GAChB,OAAOvN,KAAK4G,MAAM5G,KAAM0iD,GAAQn1C,EAAEojD,kBCjC3BwqC,GAA6Bx7F,GAjB7B,OACQ,CACnB,QACA,MACA,MACA,MACA,OACA,OACA,WACA,cACA,SACA,UACA,SACA,aACA,SAMA,YAcM,IAbJmiC,EAaI,EAbJA,MACA1rB,EAYI,EAZJA,IACAnJ,EAWI,EAXJA,IACAoK,EAUI,EAVJA,IACAw5D,EASI,EATJA,KACAn5D,EAQI,EARJA,KACA44B,EAOI,EAPJA,SACA6lB,EAMI,EANJA,YACA6W,EAKI,EALJA,OACAlI,EAII,EAJJA,QACAzV,EAGI,EAHJA,OACA+rC,EAEI,EAFJA,WACAC,EACI,EADJA,KAwCA,OAAOv5D,EAzEE,OAyEU,CACjBze,OAAQ5gB,KAAK2T,IAEbI,QAAS,SAAUjJ,GACjB,OAAOA,EAAE6I,OAGX24C,UAAW,SAAUxhD,GAEnB,OAAOA,EAAE6I,OAGXsjD,QAAS,SAAUnsD,GAEjB,OAAO9K,KAAK2T,IAAI7I,IAGlB2C,MAAO,SAAU3C,GACf,OAAO+tF,EAAMjsC,EAAO9hD,GAAI,IAG1BsjD,OAAQ,SAAUtjD,GAChB,OAAO+tF,EAAM/tF,EAAG,IAGlB,sEAAuE,SACrEA,GAGA,OAAOvN,KAAKuN,IAGd,qCAAsC,SAAUA,EAAGrL,GACjD,OAAOo5F,EAAMjsC,EAAO9hD,GAAIrL,IAG1B,sCAAuC,SAAUqL,EAAGrL,GAClD,OAAOo5F,EAAM/tF,EAAGrL,MAiDpB,SAASq5F,EAAahuF,EAAGrL,GAEvB,GAAIA,IAAMwU,OAAO4zD,mBAA2B,QAANpoE,EACpC,OA1CJ,SAAkCqL,GAEhC,IAAIiuF,EAAO,EAQX,OANAjuF,EAAEtJ,SAAQ,SAAU5C,GAClB,IAAMod,EAAIrI,EAAI/U,GACV2rE,EAAOvuD,EAAG+8E,KACZA,EAAO/8E,MAER,GACI+8E,EAgCEC,CAAwBluF,GAEjC,GAAIrL,IAAMwU,OAAOglF,mBAA2B,SAANx5F,EACpC,OA1BJ,SAAmCqL,GAEjC,IAAIouF,EAQJ,OANApuF,EAAEtJ,SAAQ,SAAU5C,GAClB,IAAMod,EAAIrI,EAAI/U,GACTs6F,IAAQ72B,EAAQrmD,EAAGk9E,KACtBA,EAAOl9E,MAER,GACIk9E,GAAQ,EAgBNC,CAAyBruF,GAElC,GAAU,QAANrL,EACF,OAAOo5F,EAAM/tF,EAAG,GAElB,GAAiB,iBAANrL,IAAmBgV,MAAMhV,GAAI,CAEtC,IAAKi0D,EAAYj0D,EAAG,GAAI,CAEtB,IAAIL,EAAI,EAKR,OAHA0L,EAAEtJ,SAAQ,SAAU5C,GAClBQ,EAAIoL,EAAIoK,EAAIjB,EAAI/U,GAAQa,GAAIL,MAC3B,GACIwV,EAAIxV,EAAG,EAAIK,GAEpB,OAAOwU,OAAO4zD,kBAGhB,MAAM,IAAI1sD,MAAM,+BA0FlB,SAASi+E,EAAatuF,EAAGrL,GAEvB,GAAU,IAANA,EACF,OArEJ,SAAyBqL,GAEvB,IAAM9M,EAAI,GAENq7F,EAAO,EAUX,OARAvuF,EAAEtJ,SAAQ,SAAU5C,EAAOuM,GACzB,IAAMuH,EAAIvH,EAAM,GACVmuF,EAAK9uF,EAAIxM,EAAE0U,IAAM,EAAGiB,EAAI/U,IAC1B2rE,EAAO+uB,EAAID,KACbA,EAAOC,GAETt7F,EAAE0U,GAAK4mF,KACN,GACID,EAuDEE,CAAezuF,GAExB,GAAIrL,IAAMwU,OAAO4zD,mBAA2B,QAANpoE,EACpC,OA9BJ,SAA8BqL,GAE5B,IAAMrM,EAAI,GAEN+6F,EAAO,EAUX,OARA1uF,EAAEtJ,SAAQ,SAAU5C,EAAOuM,GACzB,IAAMxN,EAAIwN,EAAM,GACVsuF,EAAKjvF,EAAI/L,EAAEd,IAAM,EAAGgW,EAAI/U,IAC1B2rE,EAAOkvB,EAAID,KACbA,EAAOC,GAETh7F,EAAEd,GAAK87F,KACN,GACID,EAgBEE,CAAoB5uF,GAE7B,GAAU,QAANrL,EACF,OA1FJ,SAA+BqL,GAE7B,IAAI6uF,EAAM,EAIV,OAHA7uF,EAAEtJ,SAAQ,SAAU5C,EAAOuM,GACzBwuF,EAAMnvF,EAAImvF,EAAK9rD,EAASjvC,EAAOwvE,EAAKxvE,QAE/B+U,EAAIsB,EAAK0kF,IAoFPC,CAAqB9uF,GAE9B,GAAU,IAANrL,EACF,OAvDJ,SAAyBqL,GAEvB,IAAM+uF,EAAQ/uF,EAAEmiC,OAChB,GAAI4sD,EAAM,KAAOA,EAAM,GACrB,MAAM,IAAIpsD,WAAW,6BAEvB,IAAMqsD,EAAKnB,EAAW7tF,GAChBivF,EAAWlsD,EAASisD,EAAIhvF,GACxBkvF,EAAYpB,EAAKmB,GAAU/uF,OAAOkjD,UAClC+rC,EAAMD,EAAUA,EAAU54F,OAAS,GACzC,OAAOuS,EAAIsB,EAAKglF,IA6CPC,CAAepvF,GAGxB,MAAM,IAAIqQ,MAAM,+BAAiC1b,GAUnD,SAASo5F,EAAO/tF,EAAGrL,GAEjB,IAAMo6F,EAAQ/uF,EAAEmiC,OAGhB,GAAqB,IAAjB4sD,EAAMz4F,OACR,OAAO03F,EAAYhuF,EAAGrL,GAGxB,GAAqB,IAAjBo6F,EAAMz4F,OAAc,CACtB,GAAIy4F,EAAM,IAAMA,EAAM,GACpB,OAAOT,EAAYtuF,EAAGrL,GAEtB,MAAM,IAAIguC,WAAW,kCCpTlB0sD,GAA4Bj9F,GAH5B,MACQ,CAAC,QAAS,YAAa,iBAAkB,OAAQ,SAED,YAAsD,IAAnDmiC,EAAmD,EAAnDA,MAAO8/B,EAA4C,EAA5CA,UAAWC,EAAiC,EAAjCA,eAAgBgP,EAAiB,EAAjBA,KAAMnhC,EAAW,EAAXA,KAwB9G,OAAO5N,EA3BI,MA2BQ,CACjB,2CA+BF,SAAoB7rB,EAAGC,GACrB,IAAMid,EAAI0pE,EAAa5mF,EAAGC,GAEpB4nD,EAAQxZ,EAASruC,GAAKA,EAAEk7C,MAAQl7C,EAChCunD,EAAMlZ,EAASruC,GAAKA,EAAEo7C,eAAYvtD,EAElC87D,EAAQtb,EAASpuC,GAAKA,EAAEi7C,MAAQj7C,EAChCkpD,EAAM9a,EAASpuC,GAAKA,EAAEm7C,eAAYvtD,EAGlCg5F,EAAgC,IAApB1rC,EAAMn7C,GAAGpS,OACrBk5F,EAAgC,IAApB3rC,EAAMl7C,GAAGrS,OAEvBoJ,EAAM20D,EACNn1C,EAAMo1C,EAGV,GAAIrE,GAAO4B,GAAO5B,IAAQ4B,GAAsB,iBAAR5B,EAAkB,CACxD,IAAMC,EAAKD,EAEXvwD,EAAM60B,EAAM5vB,KAAK0vD,EAAW,CAACnE,EAAIA,IACjChxC,EAAMqV,EAAM5vB,KAAK2vD,EAAgB,CAACpE,EAAIA,IAIxC,IAAKq/B,IAAcC,EAAW,CAE5B,IADA,IAAIt8F,EAAIgsB,EAAIokD,EAAK/S,EAAM,IAAK8B,EAAM,IACzBx/D,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrBK,EAAIwM,EAAIxM,EAAGgsB,EAAIokD,EAAK/S,EAAM19D,IAAKw/D,EAAMx/D,KAEvC,OAAOK,EAIT,IAAKq8F,GAAaC,EAAW,CAE3B,IADA,IAAIt8F,EAAIgsB,EAAIokD,EAAK/S,EAAM,IAAK8B,EAAM,GAAG,IAC5Bx/D,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrBK,EAAIwM,EAAIxM,EAAGgsB,EAAIokD,EAAK/S,EAAM19D,IAAKw/D,EAAMx/D,GAAG,KAE1C,OAAOK,EAIT,GAAIq8F,IAAcC,EAAW,CAE3B,IADA,IAAIt8F,EAAIgsB,EAAIokD,EAAK/S,EAAM,GAAG,IAAK8B,EAAM,IAC5Bx/D,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrBK,EAAIwM,EAAIxM,EAAGgsB,EAAIokD,EAAK/S,EAAM19D,GAAG,IAAKw/D,EAAMx/D,KAE1C,OAAOK,EAIT,GAAIq8F,GAAaC,EAAW,CAE1B,IADA,IAAIt8F,EAAIgsB,EAAIokD,EAAK/S,EAAM,GAAG,IAAK8B,EAAM,GAAG,IAC/Bx/D,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrBK,EAAIwM,EAAIxM,EAAGgsB,EAAIokD,EAAK/S,EAAM19D,GAAG,IAAKw/D,EAAMx/D,GAAG,KAE7C,OAAOK,IAvFT,6BA2FF,SAAqB8M,EAAGyK,GACtB6kF,EAAatvF,EAAGyK,GAEhB,IAAMglF,EAASzvF,EAAEonD,OACXsoC,EAAU1vF,EAAEknD,QAEZyoC,EAASllF,EAAE28C,OACXwoC,EAAUnlF,EAAEy8C,QAGdh0D,EAAI,EACFwM,EAAM20D,EACNn1C,EAAMo1C,EAERzhE,EAAI,EACJ+U,EAAI,EACR,KAAO/U,EAAI48F,EAAOn5F,QAAUsR,EAAI+nF,EAAOr5F,QAAQ,CAC7C,IAAM8vD,EAAIqpC,EAAO58F,GACXwzD,EAAIspC,EAAO/nF,GAEbw+C,EAAIC,EACNxzD,IAGEuzD,EAAIC,EACNz+C,IAGEw+C,IAAMC,IACRnzD,EAAIwM,EAAIxM,EAAGgsB,EAAIwwE,EAAQ78F,GAAI+8F,EAAQhoF,KACnC/U,IACA+U,KAIJ,OAAO1U,KA3HT,SAASo8F,EAActvF,EAAGyK,GACxB,IAEIolF,EAAMC,EAFJ/zB,EAAQlY,EAAM7jD,GACdg8D,EAAQnY,EAAMp5C,GAGpB,GAAqB,IAAjBsxD,EAAMzlE,OACRu5F,EAAO9zB,EAAM,OACR,IAAqB,IAAjBA,EAAMzlE,QAA6B,IAAbylE,EAAM,GAGrC,MAAM,IAAIp5B,WAAW,2DAA6Do5B,EAAM16D,KAAK,MAAQ,KAFrGwuF,EAAO9zB,EAAM,GAKf,GAAqB,IAAjBC,EAAM1lE,OACRw5F,EAAO9zB,EAAM,OACR,IAAqB,IAAjBA,EAAM1lE,QAA6B,IAAb0lE,EAAM,GAGrC,MAAM,IAAIr5B,WAAW,2DAA6Dq5B,EAAM36D,KAAK,MAAQ,KAFrGyuF,EAAO9zB,EAAM,GAKf,GAAI6zB,IAASC,EAAM,MAAM,IAAIntD,WAAW,mCAAqCktD,EAAO,OAASC,EAAO,KACpG,GAAa,IAATD,EAAY,MAAM,IAAIltD,WAAW,qDAErC,OAAOktD,EAuGT,SAAShsC,EAAO7jD,GACd,OAAO+2C,EAAS/2C,GAAKA,EAAEmiC,OAASA,EAAKniC,OC5J5B+vF,GAA8B39F,GAH9B,QACQ,CAAC,QAAS,SAAU,QAE8B,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAOutB,EAAkB,EAAlBA,OAAQpiD,EAAU,EAAVA,IA4BvF,OAAO60B,EAAM,QAAS,CACpB5xB,MAAO,SAAsB3C,GAE3B,OAAOgwF,EAAYluC,EAAO9hD,KAG5B6oD,aA2CF,SAAuB51D,GAErB,IAAMiN,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KACRnlB,EAAOlvC,EAAE4wD,MAETuB,EAAOjjB,EAAK,GACZmjB,EAAUnjB,EAAK,GAErB,GAAIijB,IAASE,EAAS,CAEpB,IAAI1iC,EAAM,EAEV,GAAI1iB,EAAO5J,OAAS,EAElB,IAAK,IAAIsR,EAAI,EAAGA,EAAI09C,EAAS19C,IAK3B,IAHA,IAAMm/C,EAAKiC,EAAIphD,GACTo/C,EAAKgC,EAAIphD,EAAI,GAEV1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAAK,CAE5B,IAAMrQ,EAAIwN,EAAM6C,GAEhB,GAAIrQ,IAAM+U,EAAG,CAEXgb,EAAMljB,EAAIkjB,EAAK1iB,EAAOgD,IAEtB,MAEF,GAAIrQ,EAAI+U,EAEN,MAMR,OAAOgb,EAET,MAAM,IAAI+f,WAAW,gCAAkCyW,GAAOjX,GAAQ,MAlFtEsf,YAAauuC,EAEbhqC,IAAKzhC,KAGP,SAASyrE,EAAa/8F,GAEpB,IAAMkvC,EAAOlvC,EAAE4wD,MACTn4B,EAAOz4B,EAAE2wD,MAGf,OAAQzhB,EAAK7rC,QACX,KAAK,EAEH,GAAgB,IAAZ6rC,EAAK,GAEP,OAAO5d,GAAMmH,EAAK,IAEpB,MAAM,IAAIiX,WAAW,gCAAkCyW,GAAOjX,GAAQ,KACxE,KAAK,EAGH,IAAMijB,EAAOjjB,EAAK,GAElB,GAAIijB,IADSjjB,EAAK,GACC,CAIjB,IAFA,IAAIvf,EAAM,EAED/vB,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAO+vB,EAAMljB,EAAIkjB,EAAK8I,EAAK74B,GAAGA,IAExD,OAAO+vB,EAEP,MAAM,IAAI+f,WAAW,gCAAkCyW,GAAOjX,GAAQ,KAG1E,QAEE,MAAM,IAAIQ,WAAW,yCAA2CyW,GAAOjX,GAAQ,UC1E1E8tD,GAA8B79F,GAH9B,QACQ,CAAC,QAAS,UAEwC,YAAsB,IAAnBmiC,EAAmB,EAAnBA,MAAOgnC,EAAY,EAAZA,MAkC/E,OAAOhnC,EArCI,QAqCQ,CACjB,0DAA2D,SAAUtkB,GACnE,IAAMy8D,EAASz8D,EAAKla,KAAI,SAAU8N,GAChC,OAAI6yC,EAAY7yC,GACPA,EAAImD,WACFrE,MAAMP,QAAQyB,IAAQkzC,EAASlzC,GACjCA,EAAI9N,KAAI,SAAU8mD,GAEvB,OAAOnG,EAAYmG,GAAQA,EAAK71C,WAAa61C,KAGxCh5C,KAILmH,EAAM,IAAIuwD,EAEhB,OADAA,EAAMliE,MAAM2R,EAAK0hE,GACV1hE,QCxDAklF,I,OAAW,IAAIC,IAAI,CAC9B,SCQWC,GAA6Bh+F,GAH7B,OACQ,CAAC,sBAEgD,YAA2B,IAAxBi+F,EAAwB,EAAxBA,kBAIvE,SAASC,IACP,KAAM79F,gBAAgB69F,GACpB,MAAM,IAAI9nF,YAAY,oDA2W1B,OAlWA8nF,EAAK77F,UAAU87F,SAAW,SAAU7wC,GAClC,OAAOjtD,KAAK+9F,UAAUD,SAAS7wC,IAGjC4wC,EAAK77F,UAAU8K,KAAO,OAEtB+wF,EAAK77F,UAAUojD,QAAS,EAExBy4C,EAAK77F,UAAUg8F,QAAU,GAUzBH,EAAK77F,UAAU+7F,QAAU,WACvB,IAAME,EAAOj+F,KAAKk+F,SAASN,EAAmB,IACxCpgF,EAAO,GASb,MAAO,CACLsgF,SAPF,SAAmB7wC,GACjB,IAAM9qD,EAAIqsD,GAAUvB,GAEpB,OAgUJ,SAAyBA,GACvB,mBAAyBwwC,IAAzB,eAAoC,CAA/B,IAAMthF,EAAM,KACf,GAAI8wC,EAAM/tC,IAAI/C,GACZ,MAAM,IAAIyB,MAAM,sCAAwCzB,EAAS,4BApUnEgiF,CAAeh8F,GACR87F,EAAK97F,EAAGqb,EALD,SA0BlBqgF,EAAK77F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GACxC,MAAM,IAAIxgF,MAAM,iDAAmD5d,KAAK8M,OAO1E+wF,EAAK77F,UAAUiC,QAAU,SAAUumC,GAEjC,MAAM,IAAI5sB,MAAM,2CASlBigF,EAAK77F,UAAUsB,IAAM,SAAUknC,GAE7B,MAAM,IAAI5sB,MAAM,uCASlBigF,EAAK77F,UAAUq8F,QAAU,SAAU5jD,GACjC,IAAK2K,EAAO3K,GACV,MAAM,IAAInxC,UAAU,wCAGtB,OAAOmxC,GASTojD,EAAK77F,UAAUs8F,SAAW,SAAU9zD,GAGlCA,EAASxqC,KAAM,KAAM,MAGrB,SAASu+F,EAAW9jD,EAAMjQ,GACxBiQ,EAAKx2C,SAAQ,SAAU8lD,EAAOpW,EAAMpnC,GAClCi+B,EAASuf,EAAOpW,EAAMpnC,GACtBgyF,EAAUx0C,EAAOvf,MAIrB+zD,CAAUv+F,KAAMwqC,IAwBlBqzD,EAAK77F,UAAUw8F,UAAY,SAAUh0D,GAYnC,OAXA,SAASi0D,EAAY10C,EAAOpW,EAAMpnC,GAChC,IAAM0rB,EAAcuS,EAASuf,EAAOpW,EAAMpnC,GAE1C,OAAI0rB,IAAgB8xB,EAEX9xB,EAGF8xB,EAAMzmD,IAAIm7F,GAGZA,CAAWz+F,KAAM,KAAM,OAiBhC69F,EAAK77F,UAAU8X,OAAS,SAAU0wB,GAChC,IAAMyxC,EAAQ,GAQd,OANAj8E,KAAKs+F,UAAS,SAAU7jD,EAAM9G,EAAMpnC,GAC9Bi+B,EAASiQ,EAAM9G,EAAMpnC,IACvB0vE,EAAMxgE,KAAKg/B,MAIRwhC,GAOT4hB,EAAK77F,UAAU8vB,MAAQ,WAErB,MAAM,IAAIlU,MAAM,kCAOlBigF,EAAK77F,UAAU08F,UAAY,WACzB,OAAO1+F,KAAKsD,KAAI,SAAUm3C,GACxB,OAAOA,EAAKikD,gBAUhBb,EAAK77F,UAAU0mB,OAAS,SAAU22D,GAChC,QAAOA,GACH/yB,GAAgBtsD,KAAMq/E,IAmB5Bwe,EAAK77F,UAAUM,SAAW,SAAUsC,GAClC,IAAM+5F,EAAe3+F,KAAK4+F,iBAAiBh6F,GAE3C,YAA4B,IAAjB+5F,EACFA,EAGF3+F,KAAK6+F,UAAUj6F,IASxBi5F,EAAK77F,UAAUsM,OAAS,WACtB,MAAM,IAAIsP,MAAM,sDAAwD5d,KAAK8M,OAkB/E+wF,EAAK77F,UAAU88F,OAAS,SAAUl6F,GAChC,IAAM+5F,EAAe3+F,KAAK4+F,iBAAiBh6F,GAE3C,YAA4B,IAAjB+5F,EACFA,EAGF3+F,KAAK8+F,OAAOl6F,IASrBi5F,EAAK77F,UAAU68F,UAAY,WAEzB,MAAM,IAAIjhF,MAAM,iCAAmC5d,KAAK8M,OAkB1D+wF,EAAK77F,UAAU+8F,MAAQ,SAAUn6F,GAC/B,IAAM+5F,EAAe3+F,KAAK4+F,iBAAiBh6F,GAE3C,YAA4B,IAAjB+5F,EACFA,EAGF3+F,KAAKg/F,OAAOp6F,IAUrBi5F,EAAK77F,UAAUg9F,OAAS,SAAUp6F,GAEhC,MAAM,IAAIgZ,MAAM,8BAAgC5d,KAAK8M,OAMvD+wF,EAAK77F,UAAU48F,iBAAmB,SAAUh6F,GAC1C,GAAIA,GAA8B,WAAnB,IAAOA,GACpB,WAAeA,EAAQwG,UACrB,IAAK,SACL,IAAK,YACH,OACF,IAAK,WACH,OAAOxG,EAAQwG,QAAQpL,KAAM4E,GAC/B,QACE,MAAM,IAAI0E,UAAU,6CAS5Bu0F,EAAK77F,UAAUi9F,cAAgB,WAC7B,OAAOj/F,KAAK8M,MAOd+wF,EAAK77F,UAAUk9F,WAAa,WAC1B,OAAOl/F,MAgBF69F,IACN,CAAEluC,SAAS,EAAMvK,QAAQ,ICrXrB,SAAS+5C,GAAgBr6D,GAC9B,OAAIA,GAAOA,EAAI6oB,aACN,IAAIlE,GACT3kB,EAAIl3B,MAAQ,EACZk3B,EAAI5xB,IAAM,OACEpP,IAAZghC,EAAI30B,IAAoB20B,EAAI30B,IAAM,OAAIrM,GAGnCghC,ECZF,SAASs6D,GAAT,GAAoC,IAAVpuC,EAAU,EAAVA,OAY/B,OAAO,SAAiBlvD,EAAQ8L,GAC9B,IACE,GAAIsC,MAAMP,QAAQ7N,GAChB,OAAOkvD,EAAOlvD,EAAQ8L,GACjB,GAAI9L,GAAmC,mBAAlBA,EAAOkvD,OACjC,OAAOlvD,EAAOkvD,OAAOpjD,GAChB,GAAsB,iBAAX9L,EAEhB,OAAOkvD,EAAOlvD,EAAQ8L,GACjB,GAAsB,WAAlB,IAAO9L,GAAqB,CACrC,IAAK8L,EAAMysE,mBACT,MAAM,IAAI/wE,UAAU,mDAGtB,OAAOskD,GAAgB9rD,EAAQ8L,EAAM0sE,qBAErC,MAAM,IAAIhxE,UAAU,kDAEtB,MAAOw7B,GACP,MAAMq6D,GAAer6D,KCnB3B,IAMau6D,GAAqC1/F,GANrC,eACQ,CACnB,SACA,SAG4E,YAAsB,IAAnBqxD,EAAmB,EAAnBA,OAAQ6sC,EAAW,EAAXA,KACjFyB,EAASF,GAAc,CAAEpuC,WAW/B,SAASuuC,EAAcz9F,EAAQ8L,GAC7B,KAAM5N,gBAAgBu/F,GACpB,MAAM,IAAIxpF,YAAY,oDAGxB,IAAKqvC,EAAOtjD,GACV,MAAM,IAAIwH,UAAU,wCAEtB,IAAKs8C,EAAYh4C,GACf,MAAM,IAAItE,UAAU,4CAGtBtJ,KAAK8B,OAASA,GAAU,KACxB9B,KAAK4N,MAAQA,EAGb9M,OAAOC,eAAef,KAAM,OAAQ,CAClCiB,IAAK,WACH,OAAIjB,KAAK4N,MACC5N,KAAK4N,MAAMysE,mBACfr6E,KAAK4N,MAAM0sE,oBACX,GAEGt6E,KAAK8B,OAAOnB,MAAQ,IAE7BiB,KAAK5B,MACPiI,IAAK,WACH,MAAM,IAAI2V,MAAM,kDA8ItB,SAAS4hF,EAAiB/kD,GAExB,QACE0K,EAAe1K,IACb4K,EAAY5K,IACZgL,EAAehL,IACfkL,EAAelL,IACfoL,EAAapL,IACbsL,EAAkBtL,IAClBwL,EAAaxL,IAGnB,OArJA8kD,EAAav9F,UAAY,IAAI67F,EAE7B0B,EAAav9F,UAAU8K,KAAO,eAE9ByyF,EAAav9F,UAAUmjD,gBAAiB,EAexCo6C,EAAav9F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAChD,IAAMqB,EAAaz/F,KAAK8B,OAAOo8F,SAASh8C,EAAMk8C,GACxCsB,EAAY1/F,KAAK4N,MAAMswF,SAASh8C,EAAMk8C,GAE5C,GAAIp+F,KAAK4N,MAAMysE,mBAAoB,CACjC,IAAMz3B,EAAO5iD,KAAK4N,MAAM0sE,oBACxB,OAAO,SAA2BrtB,EAAOzvC,EAAM4+B,GAE7C,OAAOwR,GAAgB6xC,EAAWxyC,EAAOzvC,EAAM4+B,GAAUwG,IAG3D,OAAO,SAA2BqK,EAAOzvC,EAAM4+B,GAC7C,IAAMt6C,EAAS29F,EAAWxyC,EAAOzvC,EAAM4+B,GACjCxuC,EAAQ8xF,EAAUzyC,EAAOzvC,EAAM1b,GACrC,OAAOw9F,EAAOx9F,EAAQ8L,KAS5B2xF,EAAav9F,UAAUiC,QAAU,SAAUumC,GACzCA,EAASxqC,KAAK8B,OAAQ,SAAU9B,MAChCwqC,EAASxqC,KAAK4N,MAAO,QAAS5N,OAShCu/F,EAAav9F,UAAUsB,IAAM,SAAUknC,GACrC,OAAO,IAAI+0D,EACTv/F,KAAKq+F,QAAQ7zD,EAASxqC,KAAK8B,OAAQ,SAAU9B,OAC7CA,KAAKq+F,QAAQ7zD,EAASxqC,KAAK4N,MAAO,QAAS5N,SAQ/Cu/F,EAAav9F,UAAU8vB,MAAQ,WAC7B,OAAO,IAAIytE,EAAav/F,KAAK8B,OAAQ9B,KAAK4N,QAQ5C2xF,EAAav9F,UAAU68F,UAAY,SAAUj6F,GAC3C,IAAI9C,EAAS9B,KAAK8B,OAAOQ,SAASsC,GAKlC,OAJI46F,EAAgBx/F,KAAK8B,UACvBA,EAAS,IAAMA,EAAS,KAGnBA,EAAS9B,KAAK4N,MAAMtL,SAASsC,IAQtC26F,EAAav9F,UAAU88F,OAAS,SAAUl6F,GACxC,IAAI9C,EAAS9B,KAAK8B,OAAOg9F,OAAOl6F,GAKhC,OAJI46F,EAAgBx/F,KAAK8B,UACvBA,EAAS,iEAAmEA,EAAS,kEAGhFA,EAAS9B,KAAK4N,MAAMkxF,OAAOl6F,IAQpC26F,EAAav9F,UAAUg9F,OAAS,SAAUp6F,GACxC,IAAI9C,EAAS9B,KAAK8B,OAAOi9F,MAAMn6F,GAK/B,OAJI46F,EAAgBx/F,KAAK8B,UACvBA,EAAS,iCAGJA,EAAS9B,KAAK4N,MAAMmxF,MAAMn6F,IAOnC26F,EAAav9F,UAAUsM,OAAS,WAC9B,MAAO,CACLkhD,OAAQ,eACR1tD,OAAQ9B,KAAK8B,OACb8L,MAAO5N,KAAK4N,QAWhB2xF,EAAa9vC,SAAW,SAAUC,GAChC,OAAO,IAAI6vC,EAAa7vC,EAAK5tD,OAAQ4tD,EAAK9hD,QAmBrC2xF,IACN,CAAE5vC,SAAS,EAAMvK,QAAQ,IC9Mfu6C,GAAkChgG,GALlC,YACQ,CACnB,SAGyE,YAAc,IAAXk+F,EAAW,EAAXA,KAO5E,SAAS+B,EAAW/gF,GAClB,KAAM7e,gBAAgB4/F,GACpB,MAAM,IAAI7pF,YAAY,oDAMxB,GAHA/V,KAAK6e,MAAQA,GAAS,IAGjB3O,MAAMP,QAAQ3P,KAAK6e,SAAW7e,KAAK6e,MAAMob,MAAMmrB,GAClD,MAAM,IAAI97C,UAAU,mCAwJxB,OApJAs2F,EAAU59F,UAAY,IAAI67F,EAE1B+B,EAAU59F,UAAU8K,KAAO,YAE3B8yF,EAAU59F,UAAUqjD,aAAc,EAelCu6C,EAAU59F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAC7C,IAAMyB,EAAYv8F,GAAItD,KAAK6e,OAAO,SAAU0rB,GAC1C,OAAOA,EAAK2zD,SAASh8C,EAAMk8C,MAI7B,GADyC,UAAvBl8C,EAAKjxB,OAAOo+B,OAChB,CACZ,IAAMA,EAASnN,EAAKmN,OACpB,OAAO,SAAwBpC,EAAOzvC,EAAM4+B,GAC1C,OAAOiT,EAAO/rD,GAAIu8F,GAAW,SAAUC,GACrC,OAAOA,EAAS7yC,EAAOzvC,EAAM4+B,QAIjC,OAAO,SAAwB6Q,EAAOzvC,EAAM4+B,GAC1C,OAAO94C,GAAIu8F,GAAW,SAAUC,GAC9B,OAAOA,EAAS7yC,EAAOzvC,EAAM4+B,QAUrCwjD,EAAU59F,UAAUiC,QAAU,SAAUumC,GACtC,IAAK,IAAIpqC,EAAI,EAAGA,EAAIJ,KAAK6e,MAAMhb,OAAQzD,IAAK,CAE1CoqC,EADaxqC,KAAK6e,MAAMze,GACT,SAAWA,EAAI,IAAKJ,QAUvC4/F,EAAU59F,UAAUsB,IAAM,SAAUknC,GAElC,IADA,IAAM3rB,EAAQ,GACLze,EAAI,EAAGA,EAAIJ,KAAK6e,MAAMhb,OAAQzD,IACrCye,EAAMze,GAAKJ,KAAKq+F,QAAQ7zD,EAASxqC,KAAK6e,MAAMze,GAAI,SAAWA,EAAI,IAAKJ,OAEtE,OAAO,IAAI4/F,EAAU/gF,IAOvB+gF,EAAU59F,UAAU8vB,MAAQ,WAC1B,OAAO,IAAI8tE,EAAU5/F,KAAK6e,MAAMzO,MAAM,KASxCwvF,EAAU59F,UAAU68F,UAAY,SAAUj6F,GAIxC,MAAO,IAHO5E,KAAK6e,MAAMvb,KAAI,SAAUm3C,GACrC,OAAOA,EAAKn4C,SAASsC,MAEJgK,KAAK,MAAQ,KAOlCgxF,EAAU59F,UAAUsM,OAAS,WAC3B,MAAO,CACLkhD,OAAQ,YACR3wC,MAAO7e,KAAK6e,QAWhB+gF,EAAUnwC,SAAW,SAAUC,GAC7B,OAAO,IAAIkwC,EAAUlwC,EAAK7wC,QAS5B+gF,EAAU59F,UAAU88F,OAAS,SAAUl6F,GAIrC,MAAO,kEAHO5E,KAAK6e,MAAMvb,KAAI,SAAUm3C,GACrC,OAAOA,EAAKqkD,OAAOl6F,MAE4DgK,KAAK,yCAA2C,mEAQnIgxF,EAAU59F,UAAUg9F,OAAS,SAAUp6F,GAkBrC,OAjBA,SAASm7F,EAAYlhF,EAAOmhF,GAC1B,IAAMC,EAAaphF,EAAMmb,KAAKqrB,KAAiBxmC,EAAMob,MAAMorB,GACrD66C,EAAeF,GAAUC,EACzBE,EAAUD,EAAe,IAAM,OAC/BE,EAAWvhF,EACdvb,KAAI,SAAUm3C,GACb,OAAIA,EAAK57B,MACAkhF,EAAWtlD,EAAK57B,OAAQmhF,GAExBvlD,EAAKskD,MAAMn6F,MAGrBgK,KAAKuxF,GACR,OAAOF,IAAeC,GAAiBA,IAAiBF,EACpD,mBAAqBI,EAAW,iBAChCA,EAECL,CAAW//F,KAAK6e,OAAO,IAGzB+gF,IACN,CAAEjwC,SAAS,EAAMvK,QAAQ,IC9JrB,IAAM9oC,GAAa,CACxB,CACE+jF,eAAgB,GAChBC,uBAAwB,IAE1B,CACEC,gBAAiB,CACfC,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,IAKjB,CACE,kBAAmB,CACjBC,cAAe,OACfC,gBAAiB,KAIrB,CACE,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAGrB,CACE,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAGrB,CACE,qBAAsB,CACpBD,cAAe,OACfC,gBAAiB,KAGrB,CACE,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAGrB,CACE,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAGrB,CACE,qBAAsB,CACpBD,cAAe,OACfC,gBAAiB,IAEnB,uBAAwB,CACtBD,cAAe,OACfC,gBAAiB,IAEnB,uBAAwB,CACtBD,cAAe,OACfC,gBAAiB,IAEnB,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,IAEnB,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,IAEnBC,eAAgB,CACdF,cAAe,OACfC,gBAAiB,KAGrB,CACE,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,+BAAgC,CAC9BD,cAAe,OACfC,gBAAiB,IAEnB,6BAA8B,CAC5BD,cAAe,OACfC,gBAAiB,KAGrB,CACE,kBAAmB,CACjBD,cAAe,OACfC,gBAAiB,KAGrB,CACEE,UAAW,IAEb,CACE,mBAAoB,CAClBH,cAAe,OACfC,gBAAiB,CAAC,mBAAoB,0BAExC,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,KAGrB,CACE,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,CACf,wBACA,sBACA,uBACA,uBAGJ,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,GACjBJ,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,GAKf,2BAA4B,CAC1BC,cAAe,OACfC,gBAAiB,CACf,wBACA,sBACA,2BACA,0BAGJ,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAGrB,CACE,yBAA0B,CACxBD,cAAe,SAEjB,0BAA2B,CACzBA,cAAe,SAEjB,sBAAuB,CACrBA,cAAe,SAEjB,mBAAoB,CAClBA,cAAe,UAGnB,CACE,mBAAoB,CAClBA,cAAe,QACfC,gBAAiB,GACjBH,kBAAkB,GAKpB,sBAAuB,CACrBE,cAAe,QACfC,gBAAiB,KAGrB,CACE,yBAA0B,CACxBD,cAAe,SAGnB,CACE,yBAA0B,CACxBA,cAAe,UAcd,SAASI,GAAeC,EAAOC,GACpC,IAAIxmD,EAAOumD,EACS,SAAhBC,IAEFxmD,EAAOumD,EAAM9B,cAGf,IADA,IAAMnzC,EAAatR,EAAKwkD,gBACf7+F,EAAI,EAAGA,EAAIkc,GAAWzY,OAAQzD,IACrC,GAAI2rD,KAAczvC,GAAWlc,GAC3B,OAAOA,EAGX,OAAO,KAaF,SAAS8gG,GAAkBF,EAAOC,GACvC,IAAIxmD,EAAOumD,EACS,SAAhBC,IAEFxmD,EAAOumD,EAAM9B,cAEf,IAAMnzC,EAAatR,EAAKwkD,gBAClBrxF,EAAQmzF,GAActmD,EAAMwmD,GAClC,GAAc,OAAVrzF,EAEF,OAAO,KAET,IAAM7L,EAAWua,GAAW1O,GAAOm+C,GAEnC,GAAI9pD,GAAeF,EAAU,iBAAkB,CAC7C,GAA+B,SAA3BA,EAAS4+F,cACX,MAAO,OAET,GAA+B,UAA3B5+F,EAAS4+F,cACX,MAAO,QAGT,MAAM/iF,MAAM,IAAOmuC,EAAa,oCACpBhqD,EAAS4+F,cAAgB,MAIvC,OAAO,KAYF,SAASQ,GAAmBC,EAAOC,EAAOJ,GAE/C,IAAMhrF,EAAqB,SAAhBgrF,EAA0BG,EAAMlC,aAAekC,EACpDlrF,EAAqB,SAAhB+qF,EAA0BG,EAAMlC,aAAemC,EACpDC,EAAcrrF,EAAEgpF,gBAChBsC,EAAcrrF,EAAE+oF,gBAChBrxF,EAAQmzF,GAAc9qF,EAAGgrF,GAC/B,GAAc,OAAVrzF,EAEF,OAAO,KAET,IAAM7L,EAAWua,GAAW1O,GAAO0zF,GAEnC,GAAIr/F,GAAeF,EAAU,oBACxBA,EAAS6+F,2BAA2B1wF,MAAQ,CAC/C,IAAK,IAAI9P,EAAI,EAAGA,EAAI2B,EAAS6+F,gBAAgB/8F,OAAQzD,IACnD,GAAI2B,EAAS6+F,gBAAgBxgG,KAAOmhG,EAClC,OAAO,EAGX,OAAO,EAIT,OAAO,KC9ST,IAOaC,GAAuC7hG,GAPvC,iBACQ,CACnB,SACA,UACA,SAG8E,YAA8B,IAA3BqxD,EAA2B,EAA3BA,OAAQ3B,EAAmB,EAAnBA,OAAQwuC,EAAW,EAAXA,KAC3FyB,EAASF,GAAc,CAAEpuC,WACzBt7C,ECbD,YAA4C,IAAlBs7C,EAAkB,EAAlBA,OAAQ3B,EAAU,EAAVA,OAevC,OAAO,SAAiBvtD,EAAQ8L,EAAOvM,GACrC,IACE,GAAI6O,MAAMP,QAAQ7N,GAEhB,OAAOutD,EAAOvtD,GAAQkvD,OAAOpjD,EAAOvM,GAAOqc,UACtC,GAAI5b,GAAmC,mBAAlBA,EAAOkvD,OACjC,OAAOlvD,EAAOkvD,OAAOpjD,EAAOvM,GACvB,GAAsB,iBAAXS,EAEhB,OAAOkvD,EAAOlvD,EAAQ8L,EAAOvM,GACxB,GAAsB,WAAlB,IAAOS,GAAqB,CACrC,IAAK8L,EAAMysE,mBACT,MAAM/wE,UAAU,mDAGlB,OADA0kD,GAAgBlsD,EAAQ8L,EAAM0sE,oBAAqBj5E,GAC5CS,EAEP,MAAM,IAAIwH,UAAU,kDAEtB,MAAOw7B,GACP,MAAMq6D,GAAer6D,KDtBV28D,CAAc,CAAEzwC,SAAQ3B,WA4BvC,SAASgxC,EAAgBv+F,EAAQ8L,EAAOvM,GACtC,KAAMrB,gBAAgBqgG,GACpB,MAAM,IAAItqF,YAAY,oDAQxB,GALA/V,KAAK8B,OAASA,EACd9B,KAAK4N,MAAQvM,EAAQuM,EAAQ,KAC7B5N,KAAKqB,MAAQA,GAASuM,GAGjBq4C,EAAankD,KAAYqjD,EAAerjD,GAC3C,MAAM,IAAIwH,UAAU,mDAEtB,GAAI28C,EAAankD,IAA2B,QAAhBA,EAAOnB,KACjC,MAAM,IAAIid,MAAM,iCAElB,GAAI5d,KAAK4N,QAAUg4C,EAAY5lD,KAAK4N,OAClC,MAAM,IAAItE,UAAU,iCAEtB,IAAK87C,EAAOplD,KAAKqB,OACf,MAAM,IAAIiI,UAAU,4BAItBxI,OAAOC,eAAef,KAAM,OAAQ,CAClCiB,IAAK,WACH,OAAIjB,KAAK4N,MACC5N,KAAK4N,MAAMysE,mBACfr6E,KAAK4N,MAAM0sE,oBACX,GAEGt6E,KAAK8B,OAAOnB,MAAQ,IAE7BiB,KAAK5B,MACPiI,IAAK,WACH,MAAM,IAAI2V,MAAM,kDA4ItB,SAAS4hF,EAAiB/kD,EAAMwmD,GACzBA,IACHA,EAAc,QAGhB,IAAMS,EAAaX,GAActmD,EAAMwmD,GACjCU,EAAiBZ,GAActmD,EAAKp5C,MAAO4/F,GACjD,MAAwB,QAAhBA,GACe,OAAnBU,GAA6BA,GAAkBD,EA2ErD,OA1NArB,EAAer+F,UAAY,IAAI67F,EAE/BwC,EAAer+F,UAAU8K,KAAO,iBAEhCuzF,EAAer+F,UAAUsjD,kBAAmB,EAe5C+6C,EAAer+F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAClD,IAAMqB,EAAaz/F,KAAK8B,OAAOo8F,SAASh8C,EAAMk8C,GACxCsB,EAAY1/F,KAAK4N,MAAQ5N,KAAK4N,MAAMswF,SAASh8C,EAAMk8C,GAAY,KAC/DwD,EAAY5hG,KAAKqB,MAAM68F,SAASh8C,EAAMk8C,GACtCz9F,EAAOX,KAAK8B,OAAOnB,KAEzB,GAAKX,KAAK4N,MAWH,IAAI5N,KAAK4N,MAAMysE,mBAAoB,CAExC,IAAMz3B,EAAO5iD,KAAK4N,MAAM0sE,oBAExB,OAAO,SAA6BrtB,EAAOzvC,EAAM4+B,GAC/C,IAAMt6C,EAAS29F,EAAWxyC,EAAOzvC,EAAM4+B,GACjC/6C,EAAQugG,EAAU30C,EAAOzvC,EAAM4+B,GAErC,OADA4R,GAAgBlsD,EAAQ8gD,EAAMvhD,GACvBA,GAEJ,GAAI4kD,EAAajmD,KAAK8B,QAE3B,OAAO,SAA6BmrD,EAAOzvC,EAAM4+B,GAC/C,IAAMylD,EAAcpC,EAAWxyC,EAAOzvC,EAAM4+B,GACtC/6C,EAAQugG,EAAU30C,EAAOzvC,EAAM4+B,GAC/BxuC,EAAQ8xF,EAAUzyC,EAAOzvC,EAAMqkF,GAErC,OADA50C,EAAMhlD,IAAItH,EAAM+U,EAAOmsF,EAAaj0F,EAAOvM,IACpCA,GAQT,IAAMygG,EAAmB9hG,KAAK8B,OAAOA,OAAOo8F,SAASh8C,EAAMk8C,GAE3D,GAAIp+F,KAAK8B,OAAO8L,MAAMysE,mBAAoB,CACxC,IAAM0nB,EAAa/hG,KAAK8B,OAAO8L,MAAM0sE,oBAErC,OAAO,SAA6BrtB,EAAOzvC,EAAM4+B,GAC/C,IAAM7vC,EAASu1F,EAAiB70C,EAAOzvC,EAAM4+B,GACvCylD,EAAcj0C,GAAgBrhD,EAAQw1F,GACtCn0F,EAAQ8xF,EAAUzyC,EAAOzvC,EAAMqkF,GAC/BxgG,EAAQugG,EAAU30C,EAAOzvC,EAAM4+B,GAErC,OADA4R,GAAgBzhD,EAAQw1F,EAAYrsF,EAAOmsF,EAAaj0F,EAAOvM,IACxDA,GAIT,IAAM2gG,EAAkBhiG,KAAK8B,OAAO8L,MAAMswF,SAASh8C,EAAMk8C,GAEzD,OAAO,SAA6BnxC,EAAOzvC,EAAM4+B,GAC/C,IAAM7vC,EAASu1F,EAAiB70C,EAAOzvC,EAAM4+B,GACvC6lD,EAAcD,EAAgB/0C,EAAOzvC,EAAMjR,GAC3Cs1F,EAAcvC,EAAO/yF,EAAQ01F,GAC7Br0F,EAAQ8xF,EAAUzyC,EAAOzvC,EAAMqkF,GAC/BxgG,EAAQugG,EAAU30C,EAAOzvC,EAAM4+B,GAIrC,OAFA1mC,EAAOnJ,EAAQ01F,EAAavsF,EAAOmsF,EAAaj0F,EAAOvM,IAEhDA,GA5DX,IAAK4kD,EAAajmD,KAAK8B,QACrB,MAAM,IAAIwH,UAAU,iCAGtB,OAAO,SAA6B2jD,EAAOzvC,EAAM4+B,GAC/C,IAAM/6C,EAAQugG,EAAU30C,EAAOzvC,EAAM4+B,GAErC,OADA6Q,EAAMhlD,IAAItH,EAAMU,GACTA,IA+Dbg/F,EAAer+F,UAAUiC,QAAU,SAAUumC,GAC3CA,EAASxqC,KAAK8B,OAAQ,SAAU9B,MAC5BA,KAAK4N,OACP48B,EAASxqC,KAAK4N,MAAO,QAAS5N,MAEhCwqC,EAASxqC,KAAKqB,MAAO,QAASrB,OAShCqgG,EAAer+F,UAAUsB,IAAM,SAAUknC,GAOvC,OAAO,IAAI61D,EANIrgG,KAAKq+F,QAAQ7zD,EAASxqC,KAAK8B,OAAQ,SAAU9B,OAC9CA,KAAK4N,MACf5N,KAAKq+F,QAAQ7zD,EAASxqC,KAAK4N,MAAO,QAAS5N,OAC3C,KACUA,KAAKq+F,QAAQ7zD,EAASxqC,KAAKqB,MAAO,QAASrB,SAS3DqgG,EAAer+F,UAAU8vB,MAAQ,WAC/B,OAAO,IAAIuuE,EAAergG,KAAK8B,OAAQ9B,KAAK4N,MAAO5N,KAAKqB,QAyB1Dg/F,EAAer+F,UAAU68F,UAAY,SAAUj6F,GAC7C,IAAM9C,EAAS9B,KAAK8B,OAAOQ,SAASsC,GAC9BgJ,EAAQ5N,KAAK4N,MAAQ5N,KAAK4N,MAAMtL,SAASsC,GAAW,GACtDvD,EAAQrB,KAAKqB,MAAMiB,SAASsC,GAKhC,OAJI46F,EAAgBx/F,KAAM4E,GAAWA,EAAQq8F,eAC3C5/F,EAAQ,IAAMA,EAAQ,KAGjBS,EAAS8L,EAAQ,MAAQvM,GAOlCg/F,EAAer+F,UAAUsM,OAAS,WAChC,MAAO,CACLkhD,OAAQ,iBACR1tD,OAAQ9B,KAAK8B,OACb8L,MAAO5N,KAAK4N,MACZvM,MAAOrB,KAAKqB,QAWhBg/F,EAAe5wC,SAAW,SAAUC,GAClC,OAAO,IAAI2wC,EAAe3wC,EAAK5tD,OAAQ4tD,EAAK9hD,MAAO8hD,EAAKruD,QAQ1Dg/F,EAAer+F,UAAU88F,OAAS,SAAUl6F,GAC1C,IAAM9C,EAAS9B,KAAK8B,OAAOg9F,OAAOl6F,GAC5BgJ,EAAQ5N,KAAK4N,MAAQ5N,KAAK4N,MAAMkxF,OAAOl6F,GAAW,GACpDvD,EAAQrB,KAAKqB,MAAMy9F,OAAOl6F,GAK9B,OAJI46F,EAAgBx/F,KAAM4E,GAAWA,EAAQq8F,eAC3C5/F,EAAQ,iEAAmEA,EAAQ,kEAG9ES,EAAS8L,EAAQ,uHAAyHvM,GAQnJg/F,EAAer+F,UAAUg9F,OAAS,SAAUp6F,GAC1C,IAAM9C,EAAS9B,KAAK8B,OAAOi9F,MAAMn6F,GAC3BgJ,EAAQ5N,KAAK4N,MAAQ5N,KAAK4N,MAAMmxF,MAAMn6F,GAAW,GACnDvD,EAAQrB,KAAKqB,MAAM09F,MAAMn6F,GAK7B,OAJI46F,EAAgBx/F,KAAM4E,GAAWA,EAAQq8F,eAC3C5/F,EAAQ,UAAH,OAAaA,EAAb,aAGAS,EAAS8L,EAAQ,KAAOvM,GAG1Bg/F,IACN,CAAE1wC,SAAS,EAAMvK,QAAQ,IErSf88C,GAAkCviG,GANlC,YACQ,CACnB,YACA,SAGyE,YAAyB,IAAtB4vD,EAAsB,EAAtBA,UAAWsuC,EAAW,EAAXA,KAUvF,SAASsE,EAAWC,GAClB,KAAMpiG,gBAAgBmiG,GACpB,MAAM,IAAIpsF,YAAY,oDAIxB,IAAK7F,MAAMP,QAAQyyF,GAAS,MAAM,IAAIxkF,MAAM,kBAC5C5d,KAAKoiG,OAASA,EAAO9+F,KAAI,SAAU++F,GACjC,IAAM5nD,EAAO4nD,GAASA,EAAM5nD,KACtB6nD,GAAUD,QAA2Bv+F,IAAlBu+F,EAAMC,SAAwBD,EAAMC,QAE7D,IAAKl9C,EAAO3K,GAAO,MAAM,IAAInxC,UAAU,kCACvC,GAAuB,kBAAZg5F,EAAuB,MAAM,IAAIh5F,UAAU,wCAEtD,MAAO,CACLmxC,KAAMA,EACN6nD,QAASA,MAmJf,OA9IAH,EAAUngG,UAAY,IAAI67F,EAE1BsE,EAAUngG,UAAU8K,KAAO,YAE3Bq1F,EAAUngG,UAAUujD,aAAc,EAelC48C,EAAUngG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAC7C,IAAMmE,EAAaj/F,GAAItD,KAAKoiG,QAAQ,SAAUC,GAC5C,MAAO,CACLvE,SAAUuE,EAAM5nD,KAAKyjD,SAASh8C,EAAMk8C,GACpCkE,QAASD,EAAMC,YAInB,OAAO,SAAyBr1C,EAAOzvC,EAAM4+B,GAC3C,IAAM5kB,EAAU,GAShB,OAPAvzB,GAAQs+F,GAAY,SAAwBF,GAC1C,IAAMp3F,EAASo3F,EAAMvE,SAAS7wC,EAAOzvC,EAAM4+B,GACvCimD,EAAMC,SACR9qE,EAAQ/b,KAAKxQ,MAIV,IAAIskD,EAAU/3B,KAQzB2qE,EAAUngG,UAAUiC,QAAU,SAAUumC,GACtC,IAAK,IAAIpqC,EAAI,EAAGA,EAAIJ,KAAKoiG,OAAOv+F,OAAQzD,IACtCoqC,EAASxqC,KAAKoiG,OAAOhiG,GAAGq6C,KAAM,UAAYr6C,EAAI,SAAUJ,OAU5DmiG,EAAUngG,UAAUsB,IAAM,SAAUknC,GAElC,IADA,IAAM43D,EAAS,GACNhiG,EAAI,EAAGA,EAAIJ,KAAKoiG,OAAOv+F,OAAQzD,IAAK,CAC3C,IAAMiiG,EAAQriG,KAAKoiG,OAAOhiG,GACpBq6C,EAAOz6C,KAAKq+F,QAAQ7zD,EAAS63D,EAAM5nD,KAAM,UAAYr6C,EAAI,SAAUJ,OACzEoiG,EAAOhiG,GAAK,CACVq6C,KAAMA,EACN6nD,QAASD,EAAMC,SAGnB,OAAO,IAAIH,EAAUC,IAOvBD,EAAUngG,UAAU8vB,MAAQ,WAQ1B,OAAO,IAAIqwE,EAPIniG,KAAKoiG,OAAO9+F,KAAI,SAAU++F,GACvC,MAAO,CACL5nD,KAAM4nD,EAAM5nD,KACZ6nD,QAASD,EAAMC,cAarBH,EAAUngG,UAAU68F,UAAY,SAAUj6F,GACxC,OAAO5E,KAAKoiG,OAAO9+F,KAAI,SAAUo/B,GAC/B,OAAOA,EAAM+X,KAAKn4C,SAASsC,IAAY89B,EAAM4/D,QAAU,GAAK,QAC3D1zF,KAAK,OAOVuzF,EAAUngG,UAAUsM,OAAS,WAC3B,MAAO,CACLkhD,OAAQ,YACR4yC,OAAQpiG,KAAKoiG,SAWjBD,EAAU1yC,SAAW,SAAUC,GAC7B,OAAO,IAAIyyC,EAAUzyC,EAAK0yC,SAS5BD,EAAUngG,UAAU88F,OAAS,SAAUl6F,GACrC,OAAO5E,KAAKoiG,OAAO9+F,KAAI,SAAUo/B,GAC/B,OAAOA,EAAM+X,KAAKqkD,OAAOl6F,IAAY89B,EAAM4/D,QAAU,GAAK,4CACzD1zF,KAAK,+CAQVuzF,EAAUngG,UAAUg9F,OAAS,SAAUp6F,GACrC,OAAO5E,KAAKoiG,OAAO9+F,KAAI,SAAUo/B,GAC/B,OAAOA,EAAM+X,KAAKskD,MAAMn6F,IAAY89B,EAAM4/D,QAAU,GAAK,QACxD1zF,KAAK,aAGHuzF,IACN,CAAExyC,SAAS,EAAMvK,QAAQ,IC/Kfo9C,GAAwC7iG,GALxC,kBACQ,CACnB,SAG+E,YAAc,IAAXk+F,EAAW,EAAXA,KAWlF,SAAS0C,EAAiBz/D,EAAW2hE,EAAUC,GAC7C,KAAM1iG,gBAAgBugG,GACpB,MAAM,IAAIxqF,YAAY,oDAExB,IAAKqvC,EAAOtkB,GAAY,MAAM,IAAIx3B,UAAU,sCAC5C,IAAK87C,EAAOq9C,GAAW,MAAM,IAAIn5F,UAAU,qCAC3C,IAAK87C,EAAOs9C,GAAY,MAAM,IAAIp5F,UAAU,sCAE5CtJ,KAAK8gC,UAAYA,EACjB9gC,KAAKyiG,SAAWA,EAChBziG,KAAK0iG,UAAYA,EAsNnB,OAnNAnC,EAAgBv+F,UAAY,IAAI67F,EAEhC0C,EAAgBv+F,UAAU8K,KAAO,kBAEjCyzF,EAAgBv+F,UAAUwjD,mBAAoB,EAe9C+6C,EAAgBv+F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GACnD,IAAMuE,EAAgB3iG,KAAK8gC,UAAUo9D,SAASh8C,EAAMk8C,GAC9CwE,EAAe5iG,KAAKyiG,SAASvE,SAASh8C,EAAMk8C,GAC5CyE,EAAgB7iG,KAAK0iG,UAAUxE,SAASh8C,EAAMk8C,GAEpD,OAAO,SAA8BnxC,EAAOzvC,EAAM4+B,GAChD,OA8JJ,SAAwBtb,GACtB,GAAyB,iBAAdA,GACc,kBAAdA,GACc,iBAAdA,EACT,QAASA,EAGX,GAAIA,EAAW,CACb,GAAImjB,EAAYnjB,GACd,OAAQA,EAAUzZ,SAGpB,GAAI68B,EAAUpjB,GACZ,SAAWA,EAAUtpB,KAAMspB,EAAUrpB,IAGvC,GAAI2sC,EAAOtjB,GACT,QAASA,EAAUz/B,MAIvB,GAAIy/B,QACF,OAAO,EAGT,MAAM,IAAIx3B,UAAU,kCAAoC68C,EAAOrlB,GAAa,KAvLnEgiE,CAAcH,EAAc11C,EAAOzvC,EAAM4+B,IAC5CwmD,EAAa31C,EAAOzvC,EAAM4+B,GAC1BymD,EAAc51C,EAAOzvC,EAAM4+B,KAQnCmkD,EAAgBv+F,UAAUiC,QAAU,SAAUumC,GAC5CA,EAASxqC,KAAK8gC,UAAW,YAAa9gC,MACtCwqC,EAASxqC,KAAKyiG,SAAU,WAAYziG,MACpCwqC,EAASxqC,KAAK0iG,UAAW,YAAa1iG,OASxCugG,EAAgBv+F,UAAUsB,IAAM,SAAUknC,GACxC,OAAO,IAAI+1D,EACTvgG,KAAKq+F,QAAQ7zD,EAASxqC,KAAK8gC,UAAW,YAAa9gC,OACnDA,KAAKq+F,QAAQ7zD,EAASxqC,KAAKyiG,SAAU,WAAYziG,OACjDA,KAAKq+F,QAAQ7zD,EAASxqC,KAAK0iG,UAAW,YAAa1iG,SAQvDugG,EAAgBv+F,UAAU8vB,MAAQ,WAChC,OAAO,IAAIyuE,EAAgBvgG,KAAK8gC,UAAW9gC,KAAKyiG,SAAUziG,KAAK0iG,YAQjEnC,EAAgBv+F,UAAU68F,UAAY,SAAUj6F,GAC9C,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvES,EAAaX,GAAc/gG,KAAMihG,GAMnCngE,EAAY9gC,KAAK8gC,UAAUx+B,SAASsC,GAClCm+F,EAAsBhC,GAAc/gG,KAAK8gC,UAAWmgE,IACrC,QAAhBA,GACwB,iBAAxBjhG,KAAK8gC,UAAUh0B,MACU,OAAxBi2F,GAAkCA,GAAuBrB,KAC7D5gE,EAAY,IAAMA,EAAY,KAGhC,IAAI2hE,EAAWziG,KAAKyiG,SAASngG,SAASsC,GAChCo+F,EAAiBjC,GAAc/gG,KAAKyiG,SAAUxB,IAC/B,QAAhBA,GACuB,iBAAvBjhG,KAAKyiG,SAAS31F,MACM,OAAnBk2F,GAA6BA,GAAkBtB,KACnDe,EAAW,IAAMA,EAAW,KAG9B,IAAIC,EAAY1iG,KAAK0iG,UAAUpgG,SAASsC,GAClCq+F,EAAkBlC,GAAc/gG,KAAK0iG,UAAWzB,GAMtD,OALqB,QAAhBA,GACwB,iBAAxBjhG,KAAK0iG,UAAU51F,MACM,OAApBm2F,GAA8BA,GAAmBvB,KACrDgB,EAAY,IAAMA,EAAY,KAEzB5hE,EAAY,MAAQ2hE,EAAW,MAAQC,GAOhDnC,EAAgBv+F,UAAUsM,OAAS,WACjC,MAAO,CACLkhD,OAAQ,kBACR1uB,UAAW9gC,KAAK8gC,UAChB2hE,SAAUziG,KAAKyiG,SACfC,UAAW1iG,KAAK0iG,YAWpBnC,EAAgB9wC,SAAW,SAAUC,GACnC,OAAO,IAAI6wC,EAAgB7wC,EAAK5uB,UAAW4uB,EAAK+yC,SAAU/yC,EAAKgzC,YAQjEnC,EAAgBv+F,UAAU88F,OAAS,SAAUl6F,GAC3C,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvES,EAAaX,GAAc/gG,KAAMihG,GAMnCngE,EAAY9gC,KAAK8gC,UAAUg+D,OAAOl6F,GAChCm+F,EAAsBhC,GAAc/gG,KAAK8gC,UAAWmgE,IACrC,QAAhBA,GACwB,iBAAxBjhG,KAAK8gC,UAAUh0B,MACU,OAAxBi2F,GAAkCA,GAAuBrB,KAC7D5gE,EAAY,iEAAmEA,EAAY,kEAG7F,IAAI2hE,EAAWziG,KAAKyiG,SAAS3D,OAAOl6F,GAC9Bo+F,EAAiBjC,GAAc/gG,KAAKyiG,SAAUxB,IAC/B,QAAhBA,GACuB,iBAAvBjhG,KAAKyiG,SAAS31F,MACM,OAAnBk2F,GAA6BA,GAAkBtB,KACnDe,EAAW,iEAAmEA,EAAW,kEAG3F,IAAIC,EAAY1iG,KAAK0iG,UAAU5D,OAAOl6F,GAChCq+F,EAAkBlC,GAAc/gG,KAAK0iG,UAAWzB,GAMtD,OALqB,QAAhBA,GACwB,iBAAxBjhG,KAAK0iG,UAAU51F,MACM,OAApBm2F,GAA8BA,GAAmBvB,KACrDgB,EAAY,iEAAmEA,EAAY,kEAEtF5hE,EAAY,iEAAmE2hE,EAAW,iEAAmEC,GAQtKnC,EAAgBv+F,UAAUg9F,OAAS,SAAUp6F,GAC3C,MAAO,mBACH5E,KAAKyiG,SAAS1D,MAAMn6F,GAAW,4BAC/B5E,KAAK8gC,UAAUi+D,MAAMn6F,GACrB,SAAW5E,KAAK0iG,UAAU3D,MAAMn6F,GAChC,6CAoCC27F,IACN,CAAE5wC,SAAS,EAAMvK,QAAQ,I,qBChPf89C,GAAe,CAE1BC,MAAO,IACPC,MAAO,UACPC,KAAM,IACNC,KAAM,SACNC,MAAO,UACPC,MAAO,UACPC,MAAO,UACPC,MAAO,UACPC,QAAS,IACTz7C,QAAS,YACT07C,WAAY,eACZC,KAAM,IACNC,KAAM,SACNC,IAAK,IACLC,IAAK,QACLC,MAAO,UACP71B,MAAO,UACP81B,SAAU,aACVC,KAAM,IACNC,KAAM,SACNC,MAAO,IACPC,MAAO,UACPC,SAAU,aACVC,OAAQ,WACRC,OAAQ,WACRC,GAAI,IACJC,GAAI,OACJC,GAAI,IACJC,GAAI,OACJC,GAAI,OACJ71E,GAAI,OACJ81E,QAAS,IACTC,QAAS,IACTjhB,GAAI,OACJ/yD,GAAI,OACJi0E,MAAO,UACPC,IAAK,IACLxI,IAAK,QACLyI,OAAQ,WACRC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,IAAK,IACLC,IAAK,QACLC,QAAS,YACTC,QAAS,YACTC,IAAK,QACL51C,IAAK,QACL61C,OAAQ,WACRC,IAAK,IACLC,IAAK,QACLC,IAAK,QACL/X,IAAK,QACLgY,MAAO,UACPC,MAAO,UAEPC,KAAM,iBACNC,MAAO,kBAEP/lG,EAAG,IACHgrB,IAAK,UACLg7E,IAAK,UACLC,SAAU,UACVluF,SAAU,UACVmuF,GAAI,UACJ5kF,IAAK,QACL5d,UAAW,eAGAyiG,GAAiB,CAC5B31B,UAAW,SACXwqB,WAAY,KACZoL,UAAW,IACXnvF,IAAK,IACLovF,OAAQ,YACRC,UAAW,IACXzpC,WAAY,IACZ0pC,OAAQ,MACR1vB,IAAK,QACL3mC,SAAU,SACVpoB,OAAQ,SACR0+E,YAAa,UACbC,UAAW,KACX/6E,IAAK,QACL7e,IAAK,IACLuhB,SAAU,IACVhb,GAAI,eACJszF,UAAW,KACXC,gBAAiB,KACjBC,cAAe,MACfniC,MAAO,IACPoiC,QAAS,QACTniC,QAAS,IACTkI,OAAQ,IACRD,UAAW,QACXE,SAAU,QACVi6B,OAAQ,MACR1gC,OAAQ,iBACR2gC,MAAO,IACPC,IAAK,UACLC,IAAK,WACLC,GAAI,SAGOC,GAAiB,CAE5BnxF,IAAK,CAAEs1B,EAAG,6BACVz+B,IAAK,CAAEs5C,EAAA,2BAAwBggD,GAAet5F,IAAvC,uBACP4a,KAAM,CAAE6jB,EAAG,yBACX1yB,KAAM,CAAE0yB,EAAG,yCACX87D,KAAM,CAAE97D,EAAG,+BACXxjB,OAAQ,CAAEq+B,EAAG,kCACbsgD,UAAW,CAAEtgD,EAAA,2BAAwBggD,GAAeM,UAAvC,uBACbD,YAAa,CAAErgD,EAAA,2BAAwBggD,GAAeK,YAAvC,uBACfH,OAAQ,CAAElgD,EAAA,2BAAwBggD,GAAeE,OAAvC,uBACV7wF,IAAK,CAAE81B,EAAG,kCACV9zB,MAAO,WAAF,OAAa2uF,GAAelvF,IAA5B,0BACL4I,IAAK,CAAEyrB,EAAG,8CACVzyB,MAAO,CAAEyyB,EAAG,2CACZ/Y,IAAK,8BACLpB,MAAO,gCACPjb,IAAK,CACHo1B,EAAG,gCACH6a,EAAG,+CAEL70B,MAAO,CAAEga,EAAG,uCACZkE,MAAO,CACLlE,EAAG,kCACH6a,EAAG,iDAEL90B,KAAM,qCACN3F,IAAK,CAAEy6B,EAAA,2BAAwBggD,GAAez6E,IAAvC,uBACPwkB,SAAU,CAAEiW,EAAA,2BAAwBggD,GAAej2D,SAAvC,uBACZm+B,KAAM,CACJ/iC,EAAG,gCACH6a,OAAGziD,GAEL2jG,QAAS,CAAElhD,EAAG,kCACdmhD,SAAU,CAAEnhD,EAAG,yCACflvC,IAAK,CAAEkvC,EAAA,mCAAgCggD,GAAelvF,IAA/C,iBACP6B,MAAO,CACLwyB,EAAG,yCACH6a,OAAGziD,GAELwrB,KAAM,CAAEoc,EAAG,8CACXh0B,KAAM,CAAEg0B,EAAG,sBACXi8D,OAAQ,CAAEj8D,EAAG,+BACbld,SAAU,CAAE+3B,EAAA,2BAAwBggD,GAAe/3E,SAAvC,uBACZyuC,WAAY,CAAEvxB,EAAA,UAAM66D,GAAetpC,WAArB,8BACdypC,UAAW,CAAEh7D,EAAA,UAAM66D,GAAeG,UAArB,8BAGbQ,OAAQ,CAAE3gD,EAAA,2BAAwBggD,GAAeW,OAAvC,uBACVP,OAAQ,CAAEj7D,EAAG66D,GAAeI,OAAS,6BACrCQ,MAAO,CAAE5gD,EAAA,2BAAwBggD,GAAeY,MAAvC,uBACT3gC,OAAQ,CAAEjgB,EAAA,2BAAwBggD,GAAe//B,OAAvC,uBACVsgC,UAAW,CAAEvgD,EAAA,2BAAwBggD,GAAeO,UAAvC,uBACbC,gBAAiB,CAAExgD,EAAA,2BAAwBggD,GAAeQ,gBAAvC,uBACnBC,cAAe,CAAEzgD,EAAA,2BAAwBggD,GAAeS,cAAvC,uBAGjBY,YAAa,CAAEl8D,EAAG,4BAClBm8D,QAAS,CAAEn8D,EAAG,4BACdo8D,WAAY,CAAEvhD,EAAG,qCAGjBn1C,IAAK,CAAEs6B,EAAG,kCACVmlC,KAAM,CAAEnlC,EAAG,+BACXj0B,GAAI,CAAEi0B,EAAG,+CACTl0B,GAAI,CAAEk0B,EAAG,+CAGT07D,IAAK,CAAE7gD,EAAA,2BAAwBggD,GAAea,IAAvC,uBACPnwB,IAAK,CAAEvrC,EAAG66D,GAAetvB,IAAM,6BAC/BqwB,GAAI,CAAE/gD,EAAA,2BAAwBggD,GAAee,GAAvC,uBACND,IAAK,CAAE9gD,EAAA,2BAAwBggD,GAAec,IAAvC,uBAGPU,MAAO,CAAExhD,EAAG,6DACZ60C,WAAY,CAAE1vD,EAAA,mCAAgC66D,GAAenL,aAC7D4M,IAAK,CAAEt8D,EAAG,kCACVmc,IAAK,CAAEtB,EAAG,6CACV0hD,KAAM,CAAEv8D,EAAG,kCACXuwB,IAAK,CAAEvwB,EAAG,kCACVw8D,MAAO,CAAEx8D,EAAA,sBAAmB66D,GAAelvF,IAAlC,mBACT8wF,MAAO,CAAEz8D,EAAG,yCACZklC,UAAW,CAAEllC,EAAA,mCAAgC66D,GAAe31B,YAG5Dw3B,aAAc,CAAE7hD,EAAG,mCACnB8hD,oBAAqB,CAAE9hD,EAAG,gEAC1BigD,UAAW,CAAE96D,EAAA,mCAAgC66D,GAAeC,YAC5DhD,MAAO,CAAE93D,EAAG,oCAGZm5B,MAAO,CAAEte,EAAA,2BAAwBggD,GAAe1hC,MAAvC,uBACTmI,OAAQ,CAAEzmB,EAAA,2BAAwBggD,GAAev5B,OAAvC,uBACVC,SAAU,CAAE1mB,EAAA,2BAAwBggD,GAAet5B,SAAvC,uBACZnI,QAAS,CAAEve,EAAA,2BAAwBggD,GAAezhC,QAAvC,uBACXiI,UAAW,CAAExmB,EAAA,2BAAwBggD,GAAex5B,UAAvC,uBACbk6B,QAAS,CAAE1gD,EAAA,2BAAwBggD,GAAeU,QAAvC,uBAGXqB,IAAK,CAAE58D,EAAG,gCAGVv7B,IAAK,8BACL+C,IAAK,8BACLq1F,SAAU,sCAGVlwF,KAAM,CAAEqzB,EAAG,uCACX5yB,MAAO,CAAE4yB,EAAG,wCACZ6rD,KAAM,CAAE7rD,EAAG,uCACX+rD,MAAO,CAAE/rD,EAAG,wCACZisD,KAAM,CAAEjsD,EAAG,uCACXmsD,MAAO,CAAEnsD,EAAG,gDACZqsD,KAAM,CAAErsD,EAAG,uCACXusD,MAAO,CAAEvsD,EAAG,gDACZpzB,KAAM,CAAEozB,EAAG,uCACX7yB,MAAO,CAAE6yB,EAAG,wCACZtzB,KAAM,CAAEszB,EAAG,uCACXp0B,MAAO,CAAEivC,EAAG,yCACZ3tC,MAAO,CAAE8yB,EAAG,wCACZ90B,IAAK,CAAE80B,EAAG,kCACV/1B,KAAM,CAAE+1B,EAAG,mCACXitD,IAAK,CAAEjtD,EAAG,kCACVmtD,KAAM,CAAEntD,EAAG,mCACXqtD,IAAK,CAAErtD,EAAG,kCACVutD,KAAM,CAAEvtD,EAAG,2CACXq/C,IAAK,CAAEr/C,EAAG,kCACV0tD,KAAM,CAAE1tD,EAAG,2CACX70B,IAAK,CAAE60B,EAAG,kCACV71B,KAAM,CAAE61B,EAAG,mCACXlf,IAAK,CAAEkf,EAAG,kCACVliB,KAAM,CAAEkiB,EAAG,mCAGXl4B,GAAI,CAAE+yC,EAAA,2BAAwBggD,GAAe/yF,GAAvC,uBAGNy+D,QAAS,SAAUx3B,EAAM71C,GAEvB,OAAO61C,EAAKj9B,KAAK,GAAGuhF,SAItB17E,OAAQ,CACNmlF,EAAG,IACH98D,EAAG,4BACH6a,EAAG,sDAELzpC,OAAQ,CACN0rF,EAAG,eACH98D,EAAG,6CAELohC,UAAW,CACT07B,EAAG,IACH98D,EAAG,6BAELw4B,QAAS,CACPskC,EAAG,IACH98D,EAAG,4BACH6a,EAAA,2CAAwC28C,GAAa9iG,EAArD,4CAEFivD,OAAQ,CACNm5C,EAAG,iCACH98D,EAAG,4BACH6a,EAAG,6BAELkiD,OAAQ,CACND,EAAG,iCACH98D,EAAG,6BAEL6tB,KAAM,CACJ7tB,EAAG,4BACH6a,EAAG,uDAODmiD,GAAa,CACjB5c,IAAK,WAGA,SAAS6c,GAAa7rF,GAC3B,OAAO8rF,KAAe9rF,EAAQ,CAAE+5B,oBAAoB,IAK/C,SAASgyD,GAAUloG,EAAMyjD,GAE9B,OADAA,OAA2B,IAAXA,GAAiCA,GAE3CniD,GAAeymG,GAAY/nG,GACtB+nG,GAAW/nG,GAGb,YAAcgoG,GAAYhoG,GAAQ,IAGvCsB,GAAeihG,GAAcviG,GACxBuiG,GAAaviG,GAGfgoG,GAAYhoG,GCrTrB,IAKamoG,GAAqCnpG,GALrC,eACQ,CACnB,SAG4E,YAAc,IAAXk+F,EAAW,EAAXA,KAa/E,SAASkL,EAAc1nG,GACrB,KAAMrB,gBAAgB+oG,GACpB,MAAM,IAAIhzF,YAAY,oDAGxB/V,KAAKqB,MAAQA,EAsJf,OAnJA0nG,EAAa/mG,UAAY,IAAI67F,EAE7BkL,EAAa/mG,UAAU8K,KAAO,eAE9Bi8F,EAAa/mG,UAAUyjD,gBAAiB,EAexCsjD,EAAa/mG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAChD,IAAM/8F,EAAQrB,KAAKqB,MAEnB,OAAO,WACL,OAAOA,IAQX0nG,EAAa/mG,UAAUiC,QAAU,SAAUumC,KAU3Cu+D,EAAa/mG,UAAUsB,IAAM,SAAUknC,GACrC,OAAOxqC,KAAK8xB,SAOdi3E,EAAa/mG,UAAU8vB,MAAQ,WAC7B,OAAO,IAAIi3E,EAAa/oG,KAAKqB,QAQ/B0nG,EAAa/mG,UAAU68F,UAAY,SAAUj6F,GAC3C,OAAO+hD,GAAO3mD,KAAKqB,MAAOuD,IAQ5BmkG,EAAa/mG,UAAU88F,OAAS,SAAUl6F,GACxC,IAAMvD,EAAQrB,KAAK6+F,UAAUj6F,GAE7B,OAAQuhD,EAAOnmD,KAAKqB,QAClB,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+BA,EAAQ,UAChD,IAAK,SACH,MAAO,6BAA+BA,EAAQ,UAChD,IAAK,UACH,MAAO,8BAAgCA,EAAQ,UACjD,IAAK,OACH,MAAO,kCAAoCA,EAAQ,UACrD,IAAK,YACH,MAAO,gCAAkCA,EAAQ,UAEnD,QACE,MAAO,6BAA+BA,EAAQ,YAQpD0nG,EAAa/mG,UAAUsM,OAAS,WAC9B,MAAO,CACLkhD,OAAQ,eACRnuD,MAAOrB,KAAKqB,QAWhB0nG,EAAat5C,SAAW,SAAUC,GAChC,OAAO,IAAIq5C,EAAar5C,EAAKruD,QAQ/B0nG,EAAa/mG,UAAUg9F,OAAS,SAAUp6F,GACxC,IAAMvD,EAAQrB,KAAK6+F,UAAUj6F,GAE7B,OAAQuhD,EAAOnmD,KAAKqB,QAClB,IAAK,SACH,MAAO,YAAcsnG,GAAYtnG,GAAS,IAE5C,IAAK,SACL,IAAK,YAED,IAAKsV,SAAS3W,KAAKqB,OACjB,OAAQrB,KAAKqB,MAAMqc,UAAY,EAC3B,WACA,UAGN,IAAM9P,EAAQvM,EAAMwvB,cAAc3K,QAAQ,KAC1C,OAAe,IAAXtY,EACKvM,EAAMovB,UAAU,EAAG7iB,GAAS,aAC/BvM,EAAMovB,UAAU7iB,EAAQ,GAAK,IAG9BvM,EACT,IAAK,WACH,OAAOrB,KAAKqB,MAAM2nG,UAEpB,QACE,OAAO3nG,IAIN0nG,IACN,CAAEp5C,SAAS,EAAMvK,QAAQ,ICpKf6jD,GAA+CtpG,GAN/C,yBACQ,CACnB,QACA,SAGsF,YAAqB,IAAlBmiC,EAAkB,EAAlBA,MAAO+7D,EAAW,EAAXA,KAahG,SAASyC,EAAwB3/F,EAAM8hC,EAAQw7D,GAC7C,KAAMj+F,gBAAgBsgG,GACpB,MAAM,IAAIvqF,YAAY,oDAIxB,GAAoB,iBAATpV,EAAmB,MAAM,IAAI2I,UAAU,wCAClD,IAAK4G,MAAMP,QAAQ8yB,GAAS,MAAM,IAAIn5B,UAAU,uEAChD,IAAK87C,EAAO64C,GAAO,MAAM,IAAI30F,UAAU,sCACvC,GAAIm0F,GAASv+E,IAAIve,GAAO,MAAM,IAAIid,MAAM,2BAA6Bjd,EAAO,2BAE5EX,KAAKW,KAAOA,EACZX,KAAKyiC,OAASA,EAAOn/B,KAAI,SAAUo/B,GACjC,OAAQA,GAASA,EAAM/hC,MAAS+hC,KAElC1iC,KAAK+hC,MAAQU,EAAOn/B,KAAI,SAAUo/B,GAChC,OAAQA,GAASA,EAAM51B,MAAS,SAElC9M,KAAKi+F,KAAOA,EAyFd,SAASuB,EAAiB/kD,EAAMwmD,GAC9B,IAAMS,EAAaX,GAActmD,EAAMwmD,GACjCU,EAAiBZ,GAActmD,EAAKwjD,KAAMgD,GAEhD,MAAwB,QAAhBA,GACe,OAAnBU,GAA6BA,GAAkBD,EAkFrD,OA7KApB,EAAuBt+F,UAAY,IAAI67F,EAEvCyC,EAAuBt+F,UAAU8K,KAAO,yBAExCwzF,EAAuBt+F,UAAU0jD,0BAA2B,EAe5D46C,EAAuBt+F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAC1D,IAAM8K,EAAgBpoG,OAAOY,OAAO08F,GACpCn6F,GAAQjE,KAAKyiC,QAAQ,SAAUC,GAC7BwmE,EAAcxmE,IAAS,KAIzB,IAAMymE,EAAWnpG,KAAKi+F,KAAKC,SAASh8C,EAAMgnD,GACpCvoG,EAAOX,KAAKW,KACZ8hC,EAASziC,KAAKyiC,OACd4B,EAAYz1B,GAAK5O,KAAK+hC,MAAO,KAC7BinB,EAASroD,EAAO,IAAMiO,GAAK5O,KAAKyiC,OAAQ,MAAQ,IAEtD,OAAO,SAAqCwqB,EAAOzvC,EAAM4+B,GACvD,IAAM1X,EAAa,GACnBA,EAAWL,GAAa,WAGtB,IAFA,IAAM+kE,EAAYtoG,OAAOY,OAAO8b,GAEvBpd,EAAI,EAAGA,EAAIqiC,EAAO5+B,OAAQzD,IACjCgpG,EAAU3mE,EAAOriC,IAAMwD,UAAUxD,GAGnC,OAAO+oG,EAASl8C,EAAOm8C,EAAWhtD,IAEpC,IAAMz1C,EAAKm7B,EAAMnhC,EAAM+jC,GAKvB,OAJA/9B,EAAGqiD,OAASA,EAEZiE,EAAMhlD,IAAItH,EAAMgG,GAETA,IAQX25F,EAAuBt+F,UAAUiC,QAAU,SAAUumC,GACnDA,EAASxqC,KAAKi+F,KAAM,OAAQj+F,OAS9BsgG,EAAuBt+F,UAAUsB,IAAM,SAAUknC,GAC/C,IAAMyzD,EAAOj+F,KAAKq+F,QAAQ7zD,EAASxqC,KAAKi+F,KAAM,OAAQj+F,OAEtD,OAAO,IAAIsgG,EAAuBtgG,KAAKW,KAAMX,KAAKyiC,OAAOryB,MAAM,GAAI6tF,IAOrEqC,EAAuBt+F,UAAU8vB,MAAQ,WACvC,OAAO,IAAIwuE,EAAuBtgG,KAAKW,KAAMX,KAAKyiC,OAAOryB,MAAM,GAAIpQ,KAAKi+F,OAsB1EqC,EAAuBt+F,UAAU68F,UAAY,SAAUj6F,GACrD,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACzEhD,EAAOj+F,KAAKi+F,KAAK37F,SAASsC,GAI9B,OAHI46F,EAAgBx/F,KAAMihG,KACxBhD,EAAO,IAAMA,EAAO,KAEfj+F,KAAKW,KAAO,IAAMX,KAAKyiC,OAAO7zB,KAAK,MAAQ,OAASqvF,GAO7DqC,EAAuBt+F,UAAUsM,OAAS,WACxC,IAAMyzB,EAAQ/hC,KAAK+hC,MAEnB,MAAO,CACLytB,OAAQ,yBACR7uD,KAAMX,KAAKW,KACX8hC,OAAQziC,KAAKyiC,OAAOn/B,KAAI,SAAUo/B,EAAO90B,GACvC,MAAO,CACLjN,KAAM+hC,EACN51B,KAAMi1B,EAAMn0B,OAGhBqwF,KAAMj+F,KAAKi+F,OAWfqC,EAAuB7wC,SAAW,SAAUC,GAC1C,OAAO,IAAI4wC,EAAuB5wC,EAAK/uD,KAAM+uD,EAAKjtB,OAAQitB,EAAKuuC,OAQjEqC,EAAuBt+F,UAAU88F,OAAS,SAAUl6F,GAGlD,IAFA,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvEx+D,EAAS,GACNriC,EAAI,EAAGA,EAAIJ,KAAKyiC,OAAO5+B,OAAQzD,IACtCqiC,EAAOhnB,KAAK,4CAA8C0tC,GAAOnpD,KAAKyiC,OAAOriC,IAAM,WAErF,IAAI69F,EAAOj+F,KAAKi+F,KAAKa,OAAOl6F,GAI5B,OAHI46F,EAAgBx/F,KAAMihG,KACxBhD,EAAO,iEAAmEA,EAAO,kEAE5E,+BAAiC90C,GAAOnpD,KAAKW,MAA7C,wEAAoI8hC,EAAO7zB,KAAK,yCAA2C,qLAAuLqvF,GAQ3XqC,EAAuBt+F,UAAUg9F,OAAS,SAAUp6F,GAClD,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACzEhD,EAAOj+F,KAAKi+F,KAAKc,MAAMn6F,GAK3B,OAJI46F,EAAgBx/F,KAAMihG,KACxBhD,EAAO,UAAH,OAAaA,EAAb,aAGC,YAAcj+F,KAAKW,KACtB,WAAaX,KAAKyiC,OAAOn/B,IAAIulG,IAAUj6F,KAAK,KAAO,aAAeqvF,GAGjEqC,IACN,CAAE3wC,SAAS,EAAMvK,QAAQ,IClNfikD,GAAkC1pG,GAPlC,YACQ,CACnB,QACA,OACA,SAGyE,YAA2B,IAAxB2wD,EAAwB,EAAxBA,MAAOutC,EAAiB,EAAjBA,KAAMnuD,EAAW,EAAXA,KAgBzF,SAAS45D,EAAW9uB,EAAY+uB,GAC9B,KAAMvpG,gBAAgBspG,GACpB,MAAM,IAAIvzF,YAAY,oDAOxB,GAJA/V,KAAKw6E,WAAaA,EAClBx6E,KAAKupG,YAAcA,IAAe,GAG7Br5F,MAAMP,QAAQ6qE,KAAgBA,EAAWvgD,MAAMmrB,GAClD,MAAM,IAAI97C,UAAU,8DAEtB,GAAItJ,KAAKupG,cAAgBvpG,KAAKq6E,mBAC5B,MAAM,IAAIz8D,MAAM,qDAkOpB,SAASivD,EAAax8D,EAAOC,EAAKmwB,GAChC,OAAO,IAAI6vB,EACTrM,EAAY5zC,GAASA,EAAMkE,WAAalE,EACxC4zC,EAAY3zC,GAAOA,EAAIiE,WAAajE,EACpC2zC,EAAYxjB,GAAQA,EAAKlsB,WAAaksB,GAI1C,OAtOA6oE,EAAUtnG,UAAY,IAAI67F,EAE1ByL,EAAUtnG,UAAU8K,KAAO,YAE3Bw8F,EAAUtnG,UAAU4jD,aAAc,EAelC0jD,EAAUtnG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAQ7C,IAAMoL,EAAiBlmG,GAAItD,KAAKw6E,YAAY,SAAU9oB,EAAOtxD,GAC3D,GAAI4lD,EAAY0L,GAAQ,CACtB,GAAIA,EAAM+3C,WAAY,CAEpB,IAAMP,EAAgBpoG,OAAOY,OAAO08F,GACpC8K,EAAc54F,KAAM,EAEpB,IAAMo5F,EAAYh4C,EAAMrhD,MAAM6tF,SAASh8C,EAAMgnD,GACvCS,EAAUj4C,EAAMphD,IAAI4tF,SAASh8C,EAAMgnD,GACnCU,EAAWl4C,EAAMjxB,KACnBixB,EAAMjxB,KAAKy9D,SAASh8C,EAAMgnD,GAC1B,WAAc,OAAO,GAEzB,OAAO,SAAwBj8C,EAAOzvC,EAAM4+B,GAC1C,IAAMj6C,EAAIutC,EAAK0M,GAAS1+B,UAClB0rF,EAAYtoG,OAAOY,OAAO8b,GAGhC,OAFA4rF,EAAU94F,IAAMnO,EAAE/B,GAEXysE,EACL68B,EAAUz8C,EAAOm8C,EAAWhtD,GAC5ButD,EAAQ18C,EAAOm8C,EAAWhtD,GAC1BwtD,EAAS38C,EAAOm8C,EAAWhtD,KAK/B,IAAMstD,EAAYh4C,EAAMrhD,MAAM6tF,SAASh8C,EAAMk8C,GACvCuL,EAAUj4C,EAAMphD,IAAI4tF,SAASh8C,EAAMk8C,GACnCwL,EAAWl4C,EAAMjxB,KACnBixB,EAAMjxB,KAAKy9D,SAASh8C,EAAMk8C,GAC1B,WAAc,OAAO,GAEzB,OAAO,SAAwBnxC,EAAOzvC,EAAM4+B,GAC1C,OAAOywB,EACL68B,EAAUz8C,EAAOzvC,EAAM4+B,GACvButD,EAAQ18C,EAAOzvC,EAAM4+B,GACrBwtD,EAAS38C,EAAOzvC,EAAM4+B,KAIvB,GAAI6J,EAAayL,IAAyB,QAAfA,EAAM/wD,KAAgB,CAEtD,IAAMuoG,EAAgBpoG,OAAOY,OAAO08F,GACpC8K,EAAc54F,KAAM,EAEpB,IAAMu5F,EAAYn4C,EAAMwsC,SAASh8C,EAAMgnD,GAEvC,OAAO,SAAwBj8C,EAAOzvC,EAAM4+B,GAC1C,IAAMj6C,EAAIutC,EAAK0M,GAAS1+B,UAClB0rF,EAAYtoG,OAAOY,OAAO8b,GAGhC,OAFA4rF,EAAU94F,IAAMnO,EAAE/B,GAEXypG,EAAU58C,EAAOm8C,EAAWhtD,IAIrC,IAAMytD,EAAYn4C,EAAMwsC,SAASh8C,EAAMk8C,GACvC,OAAO,SAAwBnxC,EAAOzvC,EAAM4+B,GAC1C,OAAOytD,EAAU58C,EAAOzvC,EAAM4+B,OAK9BxuC,EAAQggD,GAAgB1L,EAAM,SAEpC,OAAO,SAAwB+K,EAAOzvC,EAAM4+B,GAC1C,IAAMo+B,EAAal3E,GAAIkmG,GAAgB,SAAUM,GAC/C,OAAOA,EAAc78C,EAAOzvC,EAAM4+B,MAGpC,OAAOxuC,EAAK,WAAL,OAAS4sE,MAQpB8uB,EAAUtnG,UAAUiC,QAAU,SAAUumC,GACtC,IAAK,IAAIpqC,EAAI,EAAGA,EAAIJ,KAAKw6E,WAAW32E,OAAQzD,IAC1CoqC,EAASxqC,KAAKw6E,WAAWp6E,GAAI,cAAgBA,EAAI,IAAKJ,OAU1DspG,EAAUtnG,UAAUsB,IAAM,SAAUknC,GAElC,IADA,IAAMgwC,EAAa,GACVp6E,EAAI,EAAGA,EAAIJ,KAAKw6E,WAAW32E,OAAQzD,IAC1Co6E,EAAWp6E,GAAKJ,KAAKq+F,QAAQ7zD,EAASxqC,KAAKw6E,WAAWp6E,GAAI,cAAgBA,EAAI,IAAKJ,OAGrF,OAAO,IAAIspG,EAAU9uB,EAAYx6E,KAAKupG,cAOxCD,EAAUtnG,UAAU8vB,MAAQ,WAC1B,OAAO,IAAIw3E,EAAUtpG,KAAKw6E,WAAWpqE,MAAM,GAAIpQ,KAAKupG,cAOtDD,EAAUtnG,UAAUq4E,iBAAmB,WACrC,OAAkC,IAA3Br6E,KAAKw6E,WAAW32E,QACnB4hD,EAAezlD,KAAKw6E,WAAW,KACK,iBAA7Bx6E,KAAKw6E,WAAW,GAAGn5E,OAQhCioG,EAAUtnG,UAAUs4E,kBAAoB,WACtC,OAAOt6E,KAAKq6E,mBAAqBr6E,KAAKw6E,WAAW,GAAGn5E,MAAQ,MAQ9DioG,EAAUtnG,UAAU68F,UAAY,SAAUj6F,GAExC,OAAO5E,KAAKupG,YACP,IAAMvpG,KAAKs6E,oBACX,IAAMt6E,KAAKw6E,WAAW5rE,KAAK,MAAQ,KAO1C06F,EAAUtnG,UAAUsM,OAAS,WAC3B,MAAO,CACLkhD,OAAQ,YACRgrB,WAAYx6E,KAAKw6E,WACjB+uB,YAAavpG,KAAKupG,cAWtBD,EAAU75C,SAAW,SAAUC,GAC7B,OAAO,IAAI45C,EAAU55C,EAAK8qB,WAAY9qB,EAAK65C,cAQ7CD,EAAUtnG,UAAU88F,OAAS,SAAUl6F,GAGrC,IADA,IAAM41E,EAAa,GACVp6E,EAAI,EAAGA,EAAIJ,KAAKw6E,WAAW32E,OAAQzD,IAC1Co6E,EAAWp6E,GAAKJ,KAAKw6E,WAAWp6E,GAAG0+F,SAErC,OAAI9+F,KAAKupG,YACA,sGAA6GpgD,GAAOnpD,KAAKs6E,qBAAuB,UAEhJ,kEAAoEE,EAAW5rE,KAAK,yCAA2C,mEAS1I06F,EAAUtnG,UAAUg9F,OAAS,SAAUp6F,GACrC,IAAM41E,EAAax6E,KAAKw6E,WAAWl3E,KAAI,SAAUouD,GAC/C,OAAOA,EAAMqtC,MAAMn6F,MAGrB,OAAO5E,KAAKupG,YACP,IAAMvpG,KAAKs6E,oBACX,KAAOE,EAAW5rE,KAAK,KAAO,KAY9B06F,IACN,CAAE35C,SAAS,EAAMvK,QAAQ,IC1Qf2kD,GAAmCpqG,GALnC,aACQ,CACnB,SAG0E,YAAc,IAAXk+F,EAAW,EAAXA,KAO7E,SAASmM,EAAY1tF,GACnB,KAAMtc,gBAAgBgqG,GACpB,MAAM,IAAIj0F,YAAY,oDAMxB,GAHA/V,KAAKsc,WAAaA,GAAc,GAG5BA,IAC0B,WAAtB,IAAOA,KAA6Bxb,OAAOkS,KAAKsJ,GAAY2d,OAAM,SAAUt4B,GAChF,OAAOyjD,EAAO9oC,EAAW3a,QAEzB,MAAM,IAAI2H,UAAU,oCAsK1B,OAjKA0gG,EAAWhoG,UAAY,IAAI67F,EAE3BmM,EAAWhoG,UAAU8K,KAAO,aAE5Bk9F,EAAWhoG,UAAU6jD,cAAe,EAepCmkD,EAAWhoG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAC9C,IAAM6L,EAAc,GAEpB,IAAK,IAAMtoG,KAAO3B,KAAKsc,WACrB,GAAIra,GAAejC,KAAKsc,WAAY3a,GAAM,CAGxC,IAAMuoG,EAAiB7sF,GAAU1b,GAC3BwoG,EAAY9vC,KAAKjjD,MAAM8yF,GAC7B,IAAKp8C,GAAe9tD,KAAKsc,WAAY6tF,GACnC,MAAM,IAAIvsF,MAAM,0BAA4BusF,EAAY,KAG1DF,EAAYE,GAAanqG,KAAKsc,WAAW3a,GAAKu8F,SAASh8C,EAAMk8C,GAIjE,OAAO,SAAyBnxC,EAAOzvC,EAAM4+B,GAC3C,IAAMn5C,EAAM,GAEZ,IAAK,IAAMtB,KAAOsoG,EACZhoG,GAAegoG,EAAatoG,KAC9BsB,EAAItB,GAAOsoG,EAAYtoG,GAAKsrD,EAAOzvC,EAAM4+B,IAI7C,OAAOn5C,IAQX+mG,EAAWhoG,UAAUiC,QAAU,SAAUumC,GACvC,IAAK,IAAM7oC,KAAO3B,KAAKsc,WACjBra,GAAejC,KAAKsc,WAAY3a,IAClC6oC,EAASxqC,KAAKsc,WAAW3a,GAAM,cAAgB0b,GAAU1b,GAAO,IAAK3B,OAW3EgqG,EAAWhoG,UAAUsB,IAAM,SAAUknC,GACnC,IAAMluB,EAAa,GACnB,IAAK,IAAM3a,KAAO3B,KAAKsc,WACjBra,GAAejC,KAAKsc,WAAY3a,KAClC2a,EAAW3a,GAAO3B,KAAKq+F,QAAQ7zD,EAASxqC,KAAKsc,WAAW3a,GACtD,cAAgB0b,GAAU1b,GAAO,IAAK3B,QAG5C,OAAO,IAAIgqG,EAAW1tF,IAOxB0tF,EAAWhoG,UAAU8vB,MAAQ,WAC3B,IAAMxV,EAAa,GACnB,IAAK,IAAM3a,KAAO3B,KAAKsc,WACjBra,GAAejC,KAAKsc,WAAY3a,KAClC2a,EAAW3a,GAAO3B,KAAKsc,WAAW3a,IAGtC,OAAO,IAAIqoG,EAAW1tF,IASxB0tF,EAAWhoG,UAAU68F,UAAY,SAAUj6F,GACzC,IAAMm7B,EAAU,GAChB,IAAK,IAAMp+B,KAAO3B,KAAKsc,WACjBra,GAAejC,KAAKsc,WAAY3a,IAClCo+B,EAAQtkB,KAAK4B,GAAU1b,GAAO,KAAO3B,KAAKsc,WAAW3a,GAAKW,SAASsC,IAGvE,MAAO,IAAMm7B,EAAQnxB,KAAK,MAAQ,KAOpCo7F,EAAWhoG,UAAUsM,OAAS,WAC5B,MAAO,CACLkhD,OAAQ,aACRlzC,WAAYtc,KAAKsc,aAWrB0tF,EAAWv6C,SAAW,SAAUC,GAC9B,OAAO,IAAIs6C,EAAWt6C,EAAKpzC,aAS7B0tF,EAAWhoG,UAAU88F,OAAS,SAAUl6F,GACtC,IAAMm7B,EAAU,GAChB,IAAK,IAAMp+B,KAAO3B,KAAKsc,WACjBra,GAAejC,KAAKsc,WAAY3a,IAClCo+B,EAAQtkB,KAAK,2CAA6C0tC,GAAOxnD,GAApD,8HAAgM3B,KAAKsc,WAAW3a,GAAKm9F,OAAOl6F,IAG7O,MAAO,iEAAmEm7B,EAAQnxB,KAAK,yCAA2C,kEAQpIo7F,EAAWhoG,UAAUg9F,OAAS,SAAUp6F,GACtC,IAAMm7B,EAAU,GAChB,IAAK,IAAMp+B,KAAO3B,KAAKsc,WACjBra,GAAejC,KAAKsc,WAAY3a,IAClCo+B,EAAQtkB,KAAK,YAAc9Z,EAAM,QAAU3B,KAAKsc,WAAW3a,GAAKo9F,MAAMn6F,GAAW,QAGrF,2CAAqCm7B,EAAQnxB,KAAK,MAAlD,2BAGKo7F,IACN,CAAEr6C,SAAS,EAAMvK,QAAQ,ICxLfglD,GAAqCzqG,GALrC,eACQ,CACnB,SAG4E,YAAc,IAAXk+F,EAAW,EAAXA,KAY/E,SAASwM,EAAcC,EAAI3jG,EAAI6W,EAAM+sF,EAAUC,GAC7C,KAAMxqG,gBAAgBqqG,GACpB,MAAM,IAAIt0F,YAAY,oDAIxB,GAAkB,iBAAPu0F,EACT,MAAM,IAAIhhG,UAAU,sCAEtB,GAAkB,iBAAP3C,EACT,MAAM,IAAI2C,UAAU,sCAEtB,IAAK4G,MAAMP,QAAQ6N,KAAUA,EAAKyc,MAAMmrB,GACtC,MAAM,IAAI97C,UAAU,wDAGtBtJ,KAAKuqG,UAAyB,IAAbA,EACjBvqG,KAAKwqG,cAAiC,IAAjBA,EACrBxqG,KAAKsqG,GAAKA,EACVtqG,KAAK2G,GAAKA,EACV3G,KAAKwd,KAAOA,GAAQ,GAwHtB,SAASitF,EAA+B/qG,EAAMuhG,EAAasJ,EAAU/sF,EAAMktF,GAEzE,IAiBIz/F,EAjBEy2F,EAAaX,GAAcrhG,EAAMuhG,GACjCN,EAAgBO,GAAiBxhG,EAAMuhG,GAE7C,GAAqB,QAAhBA,GAA4BzjF,EAAK3Z,OAAS,GAAgC,qBAAzBnE,EAAKu/F,iBAAqE,0BAAzBv/F,EAAKu/F,gBAC1G,OAAOzhF,EAAKla,KAAI,SAAU8N,GACxB,OAAQA,EAAI8tF,aAAapyF,MACvB,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,OAAO,EACT,QACE,OAAO,MAMf,OAAQ0Q,EAAK3Z,QACX,KAAK,EACHoH,EAAS,GACT,MAEF,KAAK,EAGD,IAAM0/F,EAAoB5J,GAAcvjF,EAAK,GAAIyjF,GAGjD,GAAIyJ,GAAgC,OAAtBC,EAA6B,CACzC,IAAIC,EACAC,EASJ,GARoB,SAAhB5J,GACF2J,EAAoBptF,EAAK,GAAGyhF,gBAC5B4L,EAAiBnrG,EAAKu/F,kBAGtB2L,EAAoBptF,EAAK,GAAG0hF,aAAaD,gBACzC4L,EAAiBnrG,EAAKw/F,aAAaD,kBAE0B,IAA3D3iF,GAAWolF,GAAYmJ,GAAgBrK,gBAA2B,CACpEv1F,EAAS,EAAC,GACV,MAGF,IAAqE,IAAjEqR,GAAWquF,GAAmBC,GAAmBlK,YAAuB,CAC1Ez1F,EAAS,EAAC,GACV,OAIJ,GAA0B,OAAtB0/F,EAA4B,CAE9B1/F,EAAS,EAAC,GACV,MAGF,GAAI0/F,GAAqBjJ,EAAY,CAEnCz2F,EAAS,EAAC,GACV,MAIFA,EAAS,EAAC,GAEZ,MACF,KAAK,EAED,IAAI6/F,EAsBAC,EApBEC,EAAgBjK,GAAcvjF,EAAK,GAAIyjF,GAEvCgK,EAAe9J,GAAkBzhG,EAAM8d,EAAK,GAAIyjF,GAKpD6J,EAHoB,OAAlBE,IAIQA,IAAkBtJ,GAAkC,UAAlBf,IAA+BsK,GAMlED,EAAgBtJ,GAQ3B,IAsBMmJ,EACAK,EACAC,EAxBAC,EAAgBrK,GAAcvjF,EAAK,GAAIyjF,GAEvCoK,EAAelK,GAAkBzhG,EAAM8d,EAAK,GAAIyjF,GAmBtD,GAdE8J,EAHoB,OAAlBK,IAIQA,IAAkB1J,GAAkC,SAAlBf,IAA8B0K,GAMjED,EAAgB1J,GAOvBgJ,EAIkB,SAAhBzJ,GACF4J,EAAiBnrG,EAAKu/F,gBACtBiM,EAAgBxrG,EAAK8d,KAAK,GAAGyhF,gBAC7BkM,EAAgBzrG,EAAK8d,KAAK,GAAGyhF,kBAG7B4L,EAAiBnrG,EAAKw/F,aAAaD,gBACnCiM,EAAgBxrG,EAAK8d,KAAK,GAAG0hF,aAAaD,gBAC1CkM,EAAgBzrG,EAAK8d,KAAK,GAAG0hF,aAAaD,iBAGtB,OAAlB+L,KAC6D,IAA3D1uF,GAAWolF,GAAYmJ,GAAgBrK,kBACzCsK,GAAY,IAG+C,IAAzDxuF,GAAW0uF,GAAeE,GAAexK,cAC3CoK,GAAY,IAIM,OAAlBM,KAC8D,IAA5D9uF,GAAWolF,GAAYmJ,GAAgBpK,mBACzCsK,GAAY,IAG+C,IAAzDzuF,GAAW8uF,GAAeD,GAAezK,cAC3CqK,GAAY,IAKlB9/F,EAAS,CAAC6/F,EAAWC,GAEvB,MAEF,QACgC,qBAAzBrrG,EAAKu/F,iBAAqE,0BAAzBv/F,EAAKu/F,kBACzDh0F,EAASuS,EAAKla,KAAI,SAAU8N,GAC1B,IAAMk6F,EAAgBvK,GAAc3vF,EAAK6vF,GACnCsK,EAAepK,GAAkBzhG,EAAM0R,EAAK6vF,GAC5CuK,EAAmBtK,GAAiB9vF,EAAK6vF,GAC/C,OAAsB,OAAlBqK,IAGQ5J,IAAe4J,GAAmB3K,IAAkB6K,IAAsBD,GAE3ED,EAAgB5J,OAwBnC,OAXKlkF,EAAK3Z,QAAU,GAAgC,0BAAzBnE,EAAKu/F,iBAAgDv/F,EAAK6qG,UAA6B,SAAhBtJ,GAAyC,SAAbsJ,IAC5Ht/F,EAASuS,EAAKla,KAAI,SAAU8N,EAAKxD,GAC/B,IAAMm4C,EAA6C,oBAAxB30C,EAAI6tF,gBAC/B,SAAIh0F,EAAO2C,KAAUm4C,OAQlB96C,EAmQT,OAvjBAo/F,EAAaroG,UAAY,IAAI67F,EAE7BwM,EAAaroG,UAAU8K,KAAO,eAE9Bu9F,EAAaroG,UAAU8jD,gBAAiB,EAexCukD,EAAaroG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAEhD,GAAuB,iBAAZp+F,KAAK2G,KAAoBonD,GAAa7L,EAAMliD,KAAK2G,IAC1D,MAAKu7C,EAAKliD,KAAK2G,IAGP,IAAIiX,MAAM,0BAA4B5d,KAAK2G,GAAK,KAFhD,IAAIiX,MAAM,YAAc5d,KAAK2G,GAAK,yCAM5C,IAAMA,EAAKinD,GAAgB1L,EAAMliD,KAAK2G,IAChC8kG,EAAWnoG,GAAItD,KAAKwd,MAAM,SAAUpM,GACxC,OAAOA,EAAI8sF,SAASh8C,EAAMk8C,MAG5B,GAAwB,IAApBqN,EAAS5nG,OAAc,CACzB,IAAM6nG,EAAWD,EAAS,GAC1B,OAAO,SAA2Bx+C,EAAOzvC,EAAM4+B,GAC7C,OAAOz1C,EAAG+kG,EAASz+C,EAAOzvC,EAAM4+B,KAE7B,GAAwB,IAApBqvD,EAAS5nG,OAAc,CAChC,IAAM6nG,EAAWD,EAAS,GACpBE,EAAWF,EAAS,GAC1B,OAAO,SAA2Bx+C,EAAOzvC,EAAM4+B,GAC7C,OAAOz1C,EAAG+kG,EAASz+C,EAAOzvC,EAAM4+B,GAAUuvD,EAAS1+C,EAAOzvC,EAAM4+B,KAGlE,OAAO,SAA2B6Q,EAAOzvC,EAAM4+B,GAC7C,OAAOz1C,EAAGC,MAAM,KAAMtD,GAAImoG,GAAU,SAAUG,GAC5C,OAAOA,EAAQ3+C,EAAOzvC,EAAM4+B,SAUpCiuD,EAAaroG,UAAUiC,QAAU,SAAUumC,GACzC,IAAK,IAAIpqC,EAAI,EAAGA,EAAIJ,KAAKwd,KAAK3Z,OAAQzD,IACpCoqC,EAASxqC,KAAKwd,KAAKpd,GAAI,QAAUA,EAAI,IAAKJ,OAU9CqqG,EAAaroG,UAAUsB,IAAM,SAAUknC,GAErC,IADA,IAAMhtB,EAAO,GACJpd,EAAI,EAAGA,EAAIJ,KAAKwd,KAAK3Z,OAAQzD,IACpCod,EAAKpd,GAAKJ,KAAKq+F,QAAQ7zD,EAASxqC,KAAKwd,KAAKpd,GAAI,QAAUA,EAAI,IAAKJ,OAEnE,OAAO,IAAIqqG,EAAarqG,KAAKsqG,GAAItqG,KAAK2G,GAAI6W,EAAMxd,KAAKuqG,SAAUvqG,KAAKwqG,eAOtEH,EAAaroG,UAAU8vB,MAAQ,WAC7B,OAAO,IAAIu4E,EAAarqG,KAAKsqG,GAAItqG,KAAK2G,GAAI3G,KAAKwd,KAAKpN,MAAM,GAAIpQ,KAAKuqG,SAAUvqG,KAAKwqG,eAQpFH,EAAaroG,UAAU6pG,QAAU,WAC/B,OAA4B,IAArB7rG,KAAKwd,KAAK3Z,QAQnBwmG,EAAaroG,UAAU2iB,SAAW,WAChC,OAA4B,IAArB3kB,KAAKwd,KAAK3Z,QAuNnBwmG,EAAaroG,UAAU68F,UAAY,SAAUj6F,GAC3C,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvEsJ,EAAY3lG,GAAWA,EAAQ2lG,SAAY3lG,EAAQ2lG,SAAW,OAC9D/sF,EAAOxd,KAAKwd,KACZsuF,EAASrB,EAA8BzqG,KAAMihG,EAAasJ,EAAU/sF,GAAM,GAEhF,GAAoB,IAAhBA,EAAK3Z,OAAc,CACrB,IAAMkoG,EAAQ7K,GAAiBlhG,KAAMihG,GAEjC+K,EAAUxuF,EAAK,GAAGlb,SAASsC,GAC3BknG,EAAO,KACTE,EAAU,IAAMA,EAAU,KAI5B,IAAMC,EAAY,YAAY5hG,KAAKrK,KAAKsqG,IAExC,MAAc,UAAVyB,EACK/rG,KAAKsqG,IAAM2B,EAAY,IAAM,IAAMD,EACvB,SAAVD,EACFC,GAAWC,EAAY,IAAM,IAAMjsG,KAAKsqG,GAI1C0B,EAAUhsG,KAAKsqG,GACjB,GAAoB,IAAhB9sF,EAAK3Z,OAAc,CAC5B,IAAIqoG,EAAM1uF,EAAK,GAAGlb,SAASsC,GACvBunG,EAAM3uF,EAAK,GAAGlb,SAASsC,GAQ3B,OAPIknG,EAAO,KACTI,EAAM,IAAMA,EAAM,KAEhBJ,EAAO,KACTK,EAAM,IAAMA,EAAM,KAGhBnsG,KAAKuqG,UAAsC,0BAAzBvqG,KAAKi/F,iBAA8D,SAAbsL,EACnE2B,EAAM,IAAMC,EAGdD,EAAM,IAAMlsG,KAAKsqG,GAAK,IAAM6B,EAC9B,GAAK3uF,EAAK3Z,OAAS,IAAiC,qBAAzB7D,KAAKi/F,iBAAqE,0BAAzBj/F,KAAKi/F,iBAA+C,CACrI,IAAMmN,EAAkB5uF,EAAKla,KAAI,SAAU8N,EAAKxD,GAM9C,OALAwD,EAAMA,EAAI9O,SAASsC,GACfknG,EAAOl+F,KACTwD,EAAM,IAAMA,EAAM,KAGbA,KAGT,OAAIpR,KAAKuqG,UAAsC,0BAAzBvqG,KAAKi/F,iBAA8D,SAAbsL,EACnE6B,EAAgBx9F,KAAK,KAGvBw9F,EAAgBx9F,KAAK,IAAM5O,KAAKsqG,GAAK,KAG5C,OAAOtqG,KAAK2G,GAAK,IAAM3G,KAAKwd,KAAK5O,KAAK,MAAQ,KAQlDy7F,EAAaroG,UAAUsM,OAAS,WAC9B,MAAO,CACLkhD,OAAQ,eACR86C,GAAItqG,KAAKsqG,GACT3jG,GAAI3G,KAAK2G,GACT6W,KAAMxd,KAAKwd,KACX+sF,SAAUvqG,KAAKuqG,SACfC,aAAcxqG,KAAKwqG,eAWvBH,EAAa56C,SAAW,SAAUC,GAChC,OAAO,IAAI26C,EAAa36C,EAAK46C,GAAI56C,EAAK/oD,GAAI+oD,EAAKlyC,KAAMkyC,EAAK66C,SAAU76C,EAAK86C,eAQ3EH,EAAaroG,UAAU88F,OAAS,SAAUl6F,GACxC,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvEsJ,EAAY3lG,GAAWA,EAAQ2lG,SAAY3lG,EAAQ2lG,SAAW,OAC9D/sF,EAAOxd,KAAKwd,KACZsuF,EAASrB,EAA8BzqG,KAAMihG,EAAasJ,EAAU/sF,GAAM,GAEhF,GAAoB,IAAhBA,EAAK3Z,OAAc,CACrB,IAAMkoG,EAAQ7K,GAAiBlhG,KAAMihG,GAEjC+K,EAAUxuF,EAAK,GAAGshF,OAAOl6F,GAK7B,OAJIknG,EAAO,KACTE,EAAU,iEAAmEA,EAAU,kEAG3E,UAAVD,EACK,gFAAkF5iD,GAAOnpD,KAAKsqG,IAAM,UAAY0B,EAEhHA,EAAU,iFAAmF7iD,GAAOnpD,KAAKsqG,IAAM,UAEnH,GAAoB,IAAhB9sF,EAAK3Z,OAAc,CAC5B,IAAIqoG,EAAM1uF,EAAK,GAAGshF,OAAOl6F,GACrBunG,EAAM3uF,EAAK,GAAGshF,OAAOl6F,GAQzB,OAPIknG,EAAO,KACTI,EAAM,iEAAmEA,EAAM,kEAE7EJ,EAAO,KACTK,EAAM,iEAAmEA,EAAM,kEAG7EnsG,KAAKuqG,UAAsC,0BAAzBvqG,KAAKi/F,iBAA8D,SAAbsL,EACnE2B,EAAM,yFAA2FC,EAGnGD,EAAM,kFAAoF/iD,GAAOnpD,KAAKsqG,IAAM,UAAY6B,EAE/H,IAAMC,EAAkB5uF,EAAKla,KAAI,SAAU8N,EAAKxD,GAM9C,OALAwD,EAAMA,EAAI0tF,OAAOl6F,GACbknG,EAAOl+F,KACTwD,EAAM,iEAAmEA,EAAM,kEAG1EA,KAGT,OAAKoM,EAAK3Z,OAAS,IAAiC,qBAAzB7D,KAAKi/F,iBAAqE,0BAAzBj/F,KAAKi/F,iBAC3Ej/F,KAAKuqG,UAAsC,0BAAzBvqG,KAAKi/F,iBAA8D,SAAbsL,EACnE6B,EAAgBx9F,KAAK,0FAGvBw9F,EAAgBx9F,KAAK,kFAAoFu6C,GAAOnpD,KAAKsqG,IAAM,WAG3H,+BAAiCnhD,GAAOnpD,KAAK2G,IAAM,wEAA0EylG,EAAgBx9F,KAAK,yCAA2C,kEAU1My7F,EAAaroG,UAAUg9F,OAAS,SAAUp6F,GACxC,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvEsJ,EAAY3lG,GAAWA,EAAQ2lG,SAAY3lG,EAAQ2lG,SAAW,OAC9D/sF,EAAOxd,KAAKwd,KACZsuF,EAASrB,EAA8BzqG,KAAMihG,EAAasJ,EAAU/sF,GAAM,GAC5E8sF,EAAK/D,GAAevmG,KAAK2G,IAG7B,GAFA2jG,OAAmB,IAAPA,EAAqBtqG,KAAKsqG,GAAKA,EAEvB,IAAhB9sF,EAAK3Z,OAAc,CACrB,IAAMkoG,EAAQ7K,GAAiBlhG,KAAMihG,GAEjC+K,EAAUxuF,EAAK,GAAGuhF,MAAMn6F,GAK5B,OAJIknG,EAAO,KACTE,EAAU,UAAH,OAAaA,EAAb,aAGK,UAAVD,EACKzB,EAAK0B,EAELA,EAAU1B,EAKd,GAAoB,IAAhB9sF,EAAK3Z,OAAc,CAC5B,IAAMqoG,EAAM1uF,EAAK,GACb6uF,EAASH,EAAInN,MAAMn6F,GACnBknG,EAAO,KACTO,EAAS,UAAH,OAAaA,EAAb,aAGR,IAOInB,EANAoB,EADQ9uF,EAAK,GACAuhF,MAAMn6F,GAavB,OAZIknG,EAAO,KACTQ,EAAS,UAAH,OAAaA,EAAb,aAMNpB,EADkB,SAAhBjK,EACciL,EAAIjN,gBAGJiN,EAAIhN,aAAaD,gBAE3Bj/F,KAAKi/F,iBACX,IAAK,sBAEH,OAAOqL,EAAK,IAAM+B,EAAX/B,KAAgCgC,EAAS,IAClD,IAAK,mBAGH,OAFAD,EAAS,IAAMA,EAAS,IACxBC,EAAS,IAAMA,EAAS,IAChBpB,GACN,IAAK,kBACL,IAAK,sBACHmB,EAAS,UAAH,OAAaA,EAAb,YAEV,MACF,IAAK,wBACH,GAAIrsG,KAAKuqG,UAA0B,SAAbA,EACpB,OAAO8B,EAAS,IAAMC,EAG5B,OAAOD,EAAS/B,EAAKgC,EAChB,GAAK9uF,EAAK3Z,OAAS,IAAiC,qBAAzB7D,KAAKi/F,iBAAqE,0BAAzBj/F,KAAKi/F,iBAA+C,CACrI,IAAMsN,EAAe/uF,EAAKla,KAAI,SAAU8N,EAAKxD,GAK3C,OAJAwD,EAAMA,EAAI2tF,MAAMn6F,GACZknG,EAAOl+F,KACTwD,EAAM,UAAH,OAAaA,EAAb,aAEEA,KAGT,MAA8B,0BAAzBpR,KAAKi/F,iBAAgDj/F,KAAKuqG,SACtDgC,EAAa39F,KAAK,KAGpB29F,EAAa39F,KAAK07F,GAKzB,MAAO,YAActqG,KAAK2G,GAAK,WAC3B6W,EAAKla,KAAI,SAAU8N,GACjB,OAAOA,EAAI2tF,MAAMn6F,MAChBgK,KAAK,KAAO,YAQvBy7F,EAAaroG,UAAUi9F,cAAgB,WACrC,OAAOj/F,KAAK8M,KAAO,IAAM9M,KAAK2G,IAGzB0jG,IACN,CAAE16C,SAAS,EAAMvK,QAAQ,IChmBfonD,GAAwC7sG,GALxC,kBACQ,CACnB,SAG+E,YAAc,IAAXk+F,EAAW,EAAXA,KAQlF,SAAS4O,EAAiB/2E,GACxB,KAAM11B,gBAAgBysG,GACpB,MAAM,IAAI12F,YAAY,oDAIxB,IAAKqvC,EAAO1vB,GACV,MAAM,IAAIpsB,UAAU,yCAGtBtJ,KAAK01B,QAAUA,EA2HjB,OAxHA+2E,EAAgBzqG,UAAY,IAAI67F,EAEhC4O,EAAgBzqG,UAAU8K,KAAO,kBAEjC2/F,EAAgBzqG,UAAU+jD,mBAAoB,EAe9C0mD,EAAgBzqG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GACnD,OAAOp+F,KAAK01B,QAAQwoE,SAASh8C,EAAMk8C,IAQrCqO,EAAgBzqG,UAAUk9F,WAAa,WACrC,OAAOl/F,KAAK01B,QAAQwpE,cAOtBuN,EAAgBzqG,UAAUiC,QAAU,SAAUumC,GAC5CA,EAASxqC,KAAK01B,QAAS,UAAW11B,OASpCysG,EAAgBzqG,UAAUsB,IAAM,SAAUknC,GAExC,OAAO,IAAIiiE,EADKjiE,EAASxqC,KAAK01B,QAAS,UAAW11B,QAQpDysG,EAAgBzqG,UAAU8vB,MAAQ,WAChC,OAAO,IAAI26E,EAAgBzsG,KAAK01B,UASlC+2E,EAAgBzqG,UAAU68F,UAAY,SAAUj6F,GAC9C,OAAMA,GAAaA,IAAYA,EAAQq8F,aAAiBr8F,GAAmC,SAAxBA,EAAQq8F,YAClE,IAAMjhG,KAAK01B,QAAQpzB,SAASsC,GAAW,IAEzC5E,KAAK01B,QAAQpzB,SAASsC,IAO/B6nG,EAAgBzqG,UAAUsM,OAAS,WACjC,MAAO,CACLkhD,OAAQ,kBACR95B,QAAS11B,KAAK01B,UAWlB+2E,EAAgBh9C,SAAW,SAAUC,GACnC,OAAO,IAAI+8C,EAAgB/8C,EAAKh6B,UASlC+2E,EAAgBzqG,UAAU88F,OAAS,SAAUl6F,GAC3C,OAAMA,GAAaA,IAAYA,EAAQq8F,aAAiBr8F,GAAmC,SAAxBA,EAAQq8F,YAClE,iEAAmEjhG,KAAK01B,QAAQopE,OAAOl6F,GAAW,iEAEpG5E,KAAK01B,QAAQopE,OAAOl6F,IAS7B6nG,EAAgBzqG,UAAUg9F,OAAS,SAAUp6F,GAC3C,OAAMA,GAAaA,IAAYA,EAAQq8F,aAAiBr8F,GAAmC,SAAxBA,EAAQq8F,YACzE,iBAAiBjhG,KAAK01B,QAAQqpE,MAAMn6F,GAApC,YAEK5E,KAAK01B,QAAQqpE,MAAMn6F,IAGrB6nG,IACN,CAAE98C,SAAS,EAAMvK,QAAQ,IC7IfsnD,GAAkC/sG,GALlC,YACQ,CACnB,SAGyE,YAAc,IAAXk+F,EAAW,EAAXA,KAS5E,SAASiD,EAAWzwF,EAAOC,EAAKmwB,GAC9B,KAAMzgC,gBAAgB8gG,GACpB,MAAM,IAAI/qF,YAAY,oDAIxB,IAAKqvC,EAAO/0C,GAAQ,MAAM,IAAI/G,UAAU,iBACxC,IAAK87C,EAAO90C,GAAM,MAAM,IAAIhH,UAAU,iBACtC,GAAIm3B,IAAS2kB,EAAO3kB,GAAO,MAAM,IAAIn3B,UAAU,iBAC/C,GAAI1F,UAAUC,OAAS,EAAG,MAAM,IAAI+Z,MAAM,sBAE1C5d,KAAKqQ,MAAQA,EACbrQ,KAAKsQ,IAAMA,EACXtQ,KAAKygC,KAAOA,GAAQ,KAsGtB,SAASgqE,EAA+BhwD,EAAMwmD,GAC5C,IAAMS,EAAaX,GAActmD,EAAMwmD,GACjC6K,EAAS,GAETa,EAAkB5L,GAActmD,EAAKpqC,MAAO4wF,GAIlD,GAHA6K,EAAOz7F,MAA8B,OAApBs8F,GAA8BA,GAAmBjL,GAC/C,QAAhBT,EAECxmD,EAAKha,KAAM,CACb,IAAMmsE,EAAiB7L,GAActmD,EAAKha,KAAMwgE,GAChD6K,EAAOrrE,KAA4B,OAAnBmsE,GAA6BA,GAAkBlL,GAC5C,QAAhBT,EAGL,IAAM4L,EAAgB9L,GAActmD,EAAKnqC,IAAK2wF,GAI9C,OAHA6K,EAAOx7F,IAA0B,OAAlBu8F,GAA4BA,GAAiBnL,GACzC,QAAhBT,EAEI6K,EAgIT,OArPAhL,EAAU9+F,UAAY,IAAI67F,EAE1BiD,EAAU9+F,UAAU8K,KAAO,YAE3Bg0F,EAAU9+F,UAAUgkD,aAAc,EAOlC86C,EAAU9+F,UAAUynG,SAAW,WAM7B,OAJmBzpG,KAAK8Z,QAAO,SAAU2gC,GACvC,OAAOwL,EAAaxL,IAAwB,QAAdA,EAAK95C,QAGnBkD,OAAS,GAgB7Bi9F,EAAU9+F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAC7C,IAAM1sC,EAAQxP,EAAKwP,MACbg4C,EAAY1pG,KAAKqQ,MAAM6tF,SAASh8C,EAAMk8C,GACtCuL,EAAU3pG,KAAKsQ,IAAI4tF,SAASh8C,EAAMk8C,GAExC,GAAIp+F,KAAKygC,KAAM,CACb,IAAMmpE,EAAW5pG,KAAKygC,KAAKy9D,SAASh8C,EAAMk8C,GAE1C,OAAO,SAAwBnxC,EAAOzvC,EAAM4+B,GAC1C,OAAOsV,EACLg4C,EAAUz8C,EAAOzvC,EAAM4+B,GACvButD,EAAQ18C,EAAOzvC,EAAM4+B,GACrBwtD,EAAS38C,EAAOzvC,EAAM4+B,KAI1B,OAAO,SAAwB6Q,EAAOzvC,EAAM4+B,GAC1C,OAAOsV,EACLg4C,EAAUz8C,EAAOzvC,EAAM4+B,GACvButD,EAAQ18C,EAAOzvC,EAAM4+B,MAU7B0kD,EAAU9+F,UAAUiC,QAAU,SAAUumC,GACtCA,EAASxqC,KAAKqQ,MAAO,QAASrQ,MAC9BwqC,EAASxqC,KAAKsQ,IAAK,MAAOtQ,MACtBA,KAAKygC,MACP+J,EAASxqC,KAAKygC,KAAM,OAAQzgC,OAUhC8gG,EAAU9+F,UAAUsB,IAAM,SAAUknC,GAClC,OAAO,IAAIs2D,EACT9gG,KAAKq+F,QAAQ7zD,EAASxqC,KAAKqQ,MAAO,QAASrQ,OAC3CA,KAAKq+F,QAAQ7zD,EAASxqC,KAAKsQ,IAAK,MAAOtQ,OACvCA,KAAKygC,MAAQzgC,KAAKq+F,QAAQ7zD,EAASxqC,KAAKygC,KAAM,OAAQzgC,SAQ1D8gG,EAAU9+F,UAAU8vB,MAAQ,WAC1B,OAAO,IAAIgvE,EAAU9gG,KAAKqQ,MAAOrQ,KAAKsQ,IAAKtQ,KAAKygC,MAAQzgC,KAAKygC,OAoC/DqgE,EAAU9+F,UAAU68F,UAAY,SAAUj6F,GACxC,IAII4b,EAHEsrF,EAASrB,EAA8BzqG,KADxB4E,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,QAMzE5wF,EAAQrQ,KAAKqQ,MAAM/N,SAASsC,GAMhC,GALIknG,EAAOz7F,QACTA,EAAQ,IAAMA,EAAQ,KAExBmQ,EAAMnQ,EAEFrQ,KAAKygC,KAAM,CACb,IAAIA,EAAOzgC,KAAKygC,KAAKn+B,SAASsC,GAC1BknG,EAAOrrE,OACTA,EAAO,IAAMA,EAAO,KAEtBjgB,GAAO,IAAMigB,EAGf,IAAInwB,EAAMtQ,KAAKsQ,IAAIhO,SAASsC,GAM5B,OALIknG,EAAOx7F,MACTA,EAAM,IAAMA,EAAM,KAEpBkQ,GAAO,IAAMlQ,GASfwwF,EAAU9+F,UAAUsM,OAAS,WAC3B,MAAO,CACLkhD,OAAQ,YACRn/C,MAAOrQ,KAAKqQ,MACZC,IAAKtQ,KAAKsQ,IACVmwB,KAAMzgC,KAAKygC,OAWfqgE,EAAUrxC,SAAW,SAAUC,GAC7B,OAAO,IAAIoxC,EAAUpxC,EAAKr/C,MAAOq/C,EAAKp/C,IAAKo/C,EAAKjvB,OAQlDqgE,EAAU9+F,UAAU88F,OAAS,SAAUl6F,GACrC,IAII4b,EAHEsrF,EAASrB,EAA8BzqG,KADxB4E,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,QAMzE5wF,EAAQrQ,KAAKqQ,MAAMyuF,OAAOl6F,GAM9B,GALIknG,EAAOz7F,QACTA,EAAQ,iEAAmEA,EAAQ,kEAErFmQ,EAAMnQ,EAEFrQ,KAAKygC,KAAM,CACb,IAAIA,EAAOzgC,KAAKygC,KAAKq+D,OAAOl6F,GACxBknG,EAAOrrE,OACTA,EAAO,iEAAmEA,EAAO,kEAEnFjgB,GAAO,2DAA6DigB,EAGtE,IAAInwB,EAAMtQ,KAAKsQ,IAAIwuF,OAAOl6F,GAM1B,OALIknG,EAAOx7F,MACTA,EAAM,iEAAmEA,EAAM,kEAEjFkQ,GAAO,2DAA6DlQ,GAUtEwwF,EAAU9+F,UAAUg9F,OAAS,SAAUp6F,GACrC,IACMknG,EAASrB,EAA8BzqG,KADxB4E,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,QAGzEzgF,EAAMxgB,KAAKqQ,MAAM0uF,MAAMn6F,GAK3B,GAJIknG,EAAOz7F,QACTmQ,EAAM,UAAH,OAAaA,EAAb,aAGDxgB,KAAKygC,KAAM,CACb,IAAIA,EAAOzgC,KAAKygC,KAAKs+D,MAAMn6F,GACvBknG,EAAOrrE,OACTA,EAAO,UAAH,OAAaA,EAAb,aAENjgB,GAAO,IAAMigB,EAGf,IAAInwB,EAAMtQ,KAAKsQ,IAAIyuF,MAAMn6F,GAMzB,OALIknG,EAAOx7F,MACTA,EAAM,UAAH,OAAaA,EAAb,aAELkQ,GAAO,IAAMlQ,GAKRwwF,IACN,CAAEnxC,SAAS,EAAMvK,QAAQ,IC7Qf0nD,GAAuCntG,GALvC,iBACQ,CACnB,SAG8E,YAAc,IAAXk+F,EAAW,EAAXA,KAUjF,SAASgD,EAAgBkM,EAActqE,GACrC,KAAMziC,gBAAgB6gG,GACpB,MAAM,IAAI9qF,YAAY,oDAExB,IAAK7F,MAAMP,QAAQo9F,GAAe,MAAM,IAAIzjG,UAAU,2CACtD,IAAK4G,MAAMP,QAAQ8yB,GAAS,MAAM,IAAIn5B,UAAU,qCAChD,GAAIyjG,EAAalpG,SAAW4+B,EAAO5+B,OAAS,EAAG,MAAM,IAAIyF,UAAU,sFAEnEtJ,KAAK+sG,aAAeA,EACpB/sG,KAAKyiC,OAASA,EAsLhB,OAnLAo+D,EAAe7+F,UAAY,IAAI67F,EAE/BgD,EAAe7+F,UAAU8K,KAAO,iBAEhC+zF,EAAe7+F,UAAUgrG,kBAAmB,EAe5CnM,EAAe7+F,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAClD,IAAMv7F,EAAO7C,KAEPitG,EAAWjtG,KAAKyiC,OAAOn/B,KAAI,SAAApB,GAAC,OAAIA,EAAEg8F,SAASh8C,EAAMk8C,MAEvD,OAAO,SAA6BnxC,EAAOzvC,EAAM4+B,GAI/C,IAHA,IAAI8wD,EACAC,EAAUF,EAAS,GAAGhgD,EAAOzvC,EAAM4+B,GAE9Bh8C,EAAI,EAAGA,EAAIyC,EAAKkqG,aAAalpG,OAAQzD,IAAK,CAIjD,GAHA8sG,EAAUC,EACVA,EAAUF,EAAS7sG,EAAI,GAAG6sD,EAAOzvC,EAAM4+B,IACxBwR,GAAgB1L,EAAMr/C,EAAKkqG,aAAa3sG,GAClDgtG,CAAOF,EAASC,GACnB,OAAO,EAGX,OAAO,IAQXtM,EAAe7+F,UAAUiC,QAAU,SAAUumC,GAAU,WACrDxqC,KAAKyiC,OAAOx+B,SAAQ,SAACpC,EAAGzB,GAAJ,OAAUoqC,EAAS3oC,EAAG,UAAYzB,EAAI,IAAK,KAAOJ,OASxE6gG,EAAe7+F,UAAUsB,IAAM,SAAUknC,GAAU,WACjD,OAAO,IAAIq2D,EAAe7gG,KAAK+sG,aAAa38F,QAASpQ,KAAKyiC,OAAOn/B,KAAI,SAACzB,EAAGzB,GAAJ,OAAU,EAAKi+F,QAAQ7zD,EAAS3oC,EAAG,UAAYzB,EAAI,IAAK,MAAQJ,QAOvI6gG,EAAe7+F,UAAU8vB,MAAQ,WAC/B,OAAO,IAAI+uE,EAAe7gG,KAAK+sG,aAAc/sG,KAAKyiC,SAQpDo+D,EAAe7+F,UAAU68F,UAAY,SAAUj6F,GAqB7C,IApBA,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvES,EAAaX,GAAc/gG,KAAMihG,GAEjCoM,EAAertG,KAAKyiC,OAAOn/B,KAAI,SAAUpB,EAAG0L,GAChD,IAAM0/F,EAAkBvM,GAAc7+F,EAAG++F,GACzC,MAAwB,QAAhBA,GAA8C,OAApBqM,GAA4BA,GAAmB5L,EAC7E,IAAMx/F,EAAEI,SAASsC,GAAW,IAC5B1C,EAAEI,SAASsC,MAGX2oG,EAAc,CAClB1oC,MAAO,KACPoiC,QAAS,KACTniC,QAAS,IACTkI,OAAQ,IACRD,UAAW,KACXE,SAAU,MAGR9zD,EAAMk0F,EAAa,GACdjtG,EAAI,EAAGA,EAAIJ,KAAK+sG,aAAalpG,OAAQzD,IAC5C+Y,GAAO,IAAMo0F,EAAYvtG,KAAK+sG,aAAa3sG,IAAM,IAAMitG,EAAajtG,EAAI,GAG1E,OAAO+Y,GAOT0nF,EAAe7+F,UAAUsM,OAAS,WAChC,MAAO,CACLkhD,OAAQ,iBACRu9C,aAAc/sG,KAAK+sG,aACnBtqE,OAAQziC,KAAKyiC,SAWjBo+D,EAAepxC,SAAW,SAAUC,GAClC,OAAO,IAAImxC,EAAenxC,EAAKq9C,aAAcr9C,EAAKjtB,SAQpDo+D,EAAe7+F,UAAU88F,OAAS,SAAUl6F,GAqB1C,IApBA,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvES,EAAaX,GAAc/gG,KAAMihG,GAEjCoM,EAAertG,KAAKyiC,OAAOn/B,KAAI,SAAUpB,EAAG0L,GAChD,IAAM0/F,EAAkBvM,GAAc7+F,EAAG++F,GACzC,MAAwB,QAAhBA,GAA8C,OAApBqM,GAA4BA,GAAmB5L,EAC7E,iEAAmEx/F,EAAE48F,OAAOl6F,GAAW,iEACvF1C,EAAE48F,OAAOl6F,MAGT2oG,EAAc,CAClB1oC,MAAO,KACPoiC,QAAS,KACTniC,QAAS,IACTkI,OAAQ,IACRD,UAAW,KACXE,SAAU,MAGR9zD,EAAMk0F,EAAa,GACdjtG,EAAI,EAAGA,EAAIJ,KAAK+sG,aAAalpG,OAAQzD,IAC5C+Y,GAAO,kFAAoFgwC,GAAOokD,EAAYvtG,KAAK+sG,aAAa3sG,KAAO,UAAYitG,EAAajtG,EAAI,GAGtK,OAAO+Y,GAQT0nF,EAAe7+F,UAAUg9F,OAAS,SAAUp6F,GAY1C,IAXA,IAAMq8F,EAAer8F,GAAWA,EAAQq8F,YAAer8F,EAAQq8F,YAAc,OACvES,EAAaX,GAAc/gG,KAAMihG,GAEjCoM,EAAertG,KAAKyiC,OAAOn/B,KAAI,SAAUpB,EAAG0L,GAChD,IAAM0/F,EAAkBvM,GAAc7+F,EAAG++F,GACzC,MAAwB,QAAhBA,GAA8C,OAApBqM,GAA4BA,GAAmB5L,EAC7E,UAAYx/F,EAAE68F,MAAMn6F,GAAW,UAC/B1C,EAAE68F,MAAMn6F,MAGVuU,EAAMk0F,EAAa,GACdjtG,EAAI,EAAGA,EAAIJ,KAAK+sG,aAAalpG,OAAQzD,IAC5C+Y,GAAOotF,GAAevmG,KAAK+sG,aAAa3sG,IAAMitG,EAAajtG,EAAI,GAGjE,OAAO+Y,GAGF0nF,IACN,CAAElxC,SAAS,EAAMvK,QAAQ,ICzMfooD,GAAmC7tG,GAPnC,aACQ,CACnB,OACA,QACA,SAG0E,YAA0B,IAAvBuiD,EAAuB,EAAvBA,KAAMmT,EAAiB,EAAjBA,KAAMwoC,EAAW,EAAXA,KAMzF,SAASze,EAAiBz+E,GACxB,QAAO00D,GAAOA,EAAK+pB,gBAAgBz+E,GAUrC,SAAS8sG,EAAY9sG,GACnB,KAAMX,gBAAgBytG,GACpB,MAAM,IAAI13F,YAAY,oDAIxB,GAAoB,iBAATpV,EAAmB,MAAM,IAAI2I,UAAU,wCAElDtJ,KAAKW,KAAOA,EAkKd,OA/JA8sG,EAAWzrG,UAAY,IAAI67F,EAE3B4P,EAAWzrG,UAAU8K,KAAO,aAE5B2gG,EAAWzrG,UAAUikD,cAAe,EAepCwnD,EAAWzrG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAC9C,IAAMz9F,EAAOX,KAAKW,KAElB,IAAuB,IAAnBy9F,EAASz9F,GAGX,OAAO,SAAUssD,EAAOzvC,EAAM4+B,GAC5B,OAAO5+B,EAAK7c,IAET,GAAIA,KAAQuhD,EACjB,OAAO,SAAU+K,EAAOzvC,EAAM4+B,GAC5B,OAAO6Q,EAAM/tC,IAAIve,GACbssD,EAAMhsD,IAAIN,GACVitD,GAAgB1L,EAAMvhD,IAG5B,IAAMyjD,EAASg7B,EAAgBz+E,GAE/B,OAAO,SAAUssD,EAAOzvC,EAAM4+B,GAC5B,OAAO6Q,EAAM/tC,IAAIve,GACbssD,EAAMhsD,IAAIN,GACVyjD,EACE,IAAIiR,EAAK,KAAM10D,GACf8sG,EAAWC,kBAAkB/sG,KASzC8sG,EAAWzrG,UAAUiC,QAAU,SAAUumC,KAUzCijE,EAAWzrG,UAAUsB,IAAM,SAAUknC,GACnC,OAAOxqC,KAAK8xB,SAOd27E,EAAWC,kBAAoB,SAAU/sG,GACvC,MAAM,IAAIid,MAAM,oBAAsBjd,IAOxC8sG,EAAWzrG,UAAU8vB,MAAQ,WAC3B,OAAO,IAAI27E,EAAWztG,KAAKW,OAS7B8sG,EAAWzrG,UAAU68F,UAAY,SAAUj6F,GACzC,OAAO5E,KAAKW,MASd8sG,EAAWzrG,UAAU88F,OAAS,SAAUl6F,GACtC,IAAMjE,EAAOwoD,GAAOnpD,KAAKW,MAEzB,MAAa,SAATA,GAA4B,UAATA,EACd,0CAA4CA,EAAO,UACxC,MAATA,EACF,mDAAqDA,EAAO,UACjD,aAATA,EACF,kDAAoDA,EAAO,UAChD,QAATA,EACF,6CAA+CA,EAAO,UAC3C,SAATA,EACF,8CAAgDA,EAAO,UAC5C,cAATA,EACF,mDAAqDA,EAAO,UAG9D,6BAA+BA,EAAO,WAO/C8sG,EAAWzrG,UAAUsM,OAAS,WAC5B,MAAO,CACLkhD,OAAQ,aACR7uD,KAAMX,KAAKW,OAWf8sG,EAAWh+C,SAAW,SAAUC,GAC9B,OAAO,IAAI+9C,EAAW/9C,EAAK/uD,OAS7B8sG,EAAWzrG,UAAUg9F,OAAS,SAAUp6F,GACtC,IAAIw/C,GAAS,OACmB,IAApBlC,EAAKliD,KAAKW,OAA0By+E,EAAgBp/E,KAAKW,QACnEyjD,GAAS,GAEX,IAAMjoC,EAAS0sF,GAAS7oG,KAAKW,KAAMyjD,GACnC,MAAkB,OAAdjoC,EAAO,GAEFA,EAGF,IAAMA,GAGRsxF,IACN,CAAE99C,SAAS,EAAMvK,QAAQ,ICzLrB,SAASuoD,GAAgBC,GAAsB,2BAANpwF,EAAM,iCAANA,EAAM,kBACpD,MAA0C,mBAA/BowF,EAAYD,eACdj4F,GAAM,WAAN,GAAOk4F,EAAYD,kBAAnB,OAAwCnwF,IAG1C9H,GAAM,WAAN,GAAO44C,KAAkBs/C,GAAzB,OAAyCpwF,ICZlD,IAOaqwF,GAAqCluG,GAPrC,eACQ,CACnB,OACA,OACA,eAG4E,YAAgC,IAA7BuiD,EAA6B,EAA7BA,KAAM27C,EAAuB,EAAvBA,KAAM4P,EAAiB,EAAjBA,WAS3F,SAASK,EAAcnnG,EAAI6W,GACzB,KAAMxd,gBAAgB8tG,GACpB,MAAM,IAAI/3F,YAAY,oDAQxB,GALkB,iBAAPpP,IACTA,EAAK,IAAI8mG,EAAW9mG,KAIjBy+C,EAAOz+C,GAAK,MAAM,IAAI2C,UAAU,mCACrC,IAAK4G,MAAMP,QAAQ6N,KAAUA,EAAKyc,MAAMmrB,GACtC,MAAM,IAAI97C,UAAU,wDAGtBtJ,KAAK2G,GAAKA,EACV3G,KAAKwd,KAAOA,GAAQ,GAGpB1c,OAAOC,eAAef,KAAM,OAAQ,CAClCiB,IAAK,WACH,OAAOjB,KAAK2G,GAAGhG,MAAQ,IACvBiB,KAAK5B,MACPiI,IAAK,WACH,MAAM,IAAI2V,MAAM,kDAKtBkwF,EAAa9rG,UAAY,IAAI67F,EAE7BiQ,EAAa9rG,UAAU8K,KAAO,eAE9BghG,EAAa9rG,UAAU2jD,gBAAiB,EAGxC,IAAMooD,EAAQ,SAAAC,GAAM,OAAIrnD,GAAOqnD,EAAQ,CAAEl+E,SAAU,MAenDg+E,EAAa9rG,UAAUk8F,SAAW,SAAUh8C,EAAMk8C,GAChD,KAAMp+F,gBAAgB8tG,GACpB,MAAM,IAAIxkG,UAAU,yBAItB,IAAMmiG,EAAWzrG,KAAKwd,KAAKla,KAAI,SAAC8N,GAAD,OAASA,EAAI8sF,SAASh8C,EAAMk8C,MAE3D,IAAIn4C,EAAajmD,KAAK2G,IA+Ef,IACLw+C,EAAenlD,KAAK2G,KACpBi/C,EAAY5lD,KAAK2G,GAAGiH,QACpB5N,KAAK2G,GAAGiH,MAAMysE,mBACd,CAGA,IAAMolB,EAAaz/F,KAAK2G,GAAG7E,OAAOo8F,SAASh8C,EAAMk8C,GAC3Cx7C,EAAO5iD,KAAK2G,GAAGiH,MAAM0sE,oBACrB2zB,EAAUjuG,KAAKwd,KAErB,OAAO,SAA2ByvC,EAAOzvC,EAAM4+B,GAC7C,IAAMt6C,EAAS29F,EAAWxyC,EAAOzvC,EAAM4+B,GAIvC,GhPtFR,SAA6Bt6C,EAAQ6e,GACnC,IAAKotC,GAAajsD,EAAQ6e,GACxB,MAAM,IAAI/C,MAAM,wBAA0B+C,EAAS,KgPiF/CutF,CAAmBpsG,EAAQ8gD,GACb9gD,EAAO8gD,IAAS9gD,EAAO8gD,GAAMqrD,QAGzC,OAAOnsG,EAAO8gD,GAAMqrD,EAAS/rD,EAAMyrD,GAAe1gD,EAAOzvC,GAAOyvC,GAGhE,IAAMx/C,EAASg+F,EAASnoG,KAAI,SAACsoG,GAAD,OAAaA,EAAQ3+C,EAAOzvC,EAAM4+B,MAC9D,OAAOt6C,EAAO8gD,GAAMh8C,MAAM9E,EAAQ2L,IAMtC,IAAM0gG,EAASnuG,KAAK2G,GAAGrE,WACjB8rG,EAASpuG,KAAK2G,GAAGu3F,SAASh8C,EAAMk8C,GAChC6P,EAAUjuG,KAAKwd,KAErB,OAAO,SAA2ByvC,EAAOzvC,EAAM4+B,GAC7C,IAAMz1C,EAAKynG,EAAOnhD,EAAOzvC,EAAM4+B,GAC/B,GAAkB,mBAAPz1C,EACT,MAAM,IAAI2C,UACR,sBAAe6kG,EAAf,6DACOJ,EAAMpnG,KAGjB,GAAIA,EAAGsnG,QACL,OAAOtnG,EAAGsnG,EAAS/rD,EAAMyrD,GAAe1gD,EAAOzvC,GAAOyvC,GAGtD,IAAMx/C,EAASg+F,EAASnoG,KAAI,SAACsoG,GAAD,OAAaA,EAAQ3+C,EAAOzvC,EAAM4+B,MAC9D,OAAOz1C,EAAGC,MAAMD,EAAI8G,IA1HxB,IAAM9M,EAAOX,KAAK2G,GAAGhG,KACrB,GAAKy9F,EAASz9F,GA4DP,CACL,IAAMstG,EAAUjuG,KAAKwd,KACrB,OAAO,SAA2ByvC,EAAOzvC,EAAM4+B,GAC7C,IAAMz1C,EAAK6W,EAAK7c,GAChB,GAAkB,mBAAPgG,EACT,MAAM,IAAI2C,UAAJ,oBACS3I,EADT,2CACgDotG,EAAMpnG,KAG9D,GAAIA,EAAGsnG,QACL,OAAOtnG,EAAGsnG,EAAS/rD,EAAMyrD,GAAe1gD,EAAOzvC,GAAOyvC,GAEtD,IAAMx/C,EAASg+F,EAASnoG,KAAI,SAACsoG,GAAD,OAAaA,EAAQ3+C,EAAOzvC,EAAM4+B,MAC9D,OAAOz1C,EAAGC,MAAMD,EAAI8G,IAvExB,IAAM9G,EAAKhG,KAAQuhD,EAAO0L,GAAgB1L,EAAMvhD,QAAQmD,EAClDuqG,EAAsB,mBAAP1nG,IAAoC,IAAfA,EAAGsnG,QAEvCK,EAAY,SAACrhD,GACjB,IAAI5rD,EACJ,GAAI4rD,EAAM/tC,IAAIve,GACZU,EAAQ4rD,EAAMhsD,IAAIN,OACb,MAAIA,KAAQuhD,GAGjB,OAAO4rD,EAAaS,oBAAoB5tG,GAFxCU,EAAQusD,GAAgB1L,EAAMvhD,GAIhC,GAAqB,mBAAVU,EACT,OAAOA,EAET,MAAM,IAAIiI,UAAJ,WACA3I,EADA,iDAC6CotG,EAAM1sG,MAI3D,GAAIgtG,EAAO,CAGT,IAAMJ,EAAUjuG,KAAKwd,KACrB,OAAO,SAA2ByvC,EAAOzvC,EAAM4+B,GAE7C,OADWkyD,EAAUrhD,EACdtmD,CAAGsnG,EAAS/rD,EAAMyrD,GAAe1gD,EAAOzvC,GAAOyvC,IAIxD,OAAQw+C,EAAS5nG,QACf,KAAK,EAAG,OAAO,SAA2BopD,EAAOzvC,EAAM4+B,GAErD,OADWkyD,EAAUrhD,EACdtmD,IAET,KAAK,EAAG,OAAO,SAA2BsmD,EAAOzvC,EAAM4+B,GAGrD,OAFWkyD,EAAUrhD,EAEdtmD,EACL+kG,EAFeD,EAAS,IAEfx+C,EAAOzvC,EAAM4+B,KAG1B,KAAK,EAAG,OAAO,SAA2B6Q,EAAOzvC,EAAM4+B,GACrD,IAAMz1C,EAAK2nG,EAAUrhD,GACfy+C,EAAWD,EAAS,GACpBE,EAAWF,EAAS,GAC1B,OAAO9kG,EACL+kG,EAASz+C,EAAOzvC,EAAM4+B,GACtBuvD,EAAS1+C,EAAOzvC,EAAM4+B,KAG1B,QAAS,OAAO,SAA2B6Q,EAAOzvC,EAAM4+B,GACtD,IAAMz1C,EAAK2nG,EAAUrhD,GACfx/C,EAASg+F,EAASnoG,KAAI,SAACsoG,GAAD,OAAaA,EAAQ3+C,EAAOzvC,EAAM4+B,MAC9D,OAAOz1C,EAAE,WAAF,OAAM8G,OA2EzBqgG,EAAa9rG,UAAUiC,QAAU,SAAUumC,GACzCA,EAASxqC,KAAK2G,GAAI,KAAM3G,MAExB,IAAK,IAAII,EAAI,EAAGA,EAAIJ,KAAKwd,KAAK3Z,OAAQzD,IACpCoqC,EAASxqC,KAAKwd,KAAKpd,GAAI,QAAUA,EAAI,IAAKJ,OAU9C8tG,EAAa9rG,UAAUsB,IAAM,SAAUknC,GAGrC,IAFA,IAAM7jC,EAAK3G,KAAKq+F,QAAQ7zD,EAASxqC,KAAK2G,GAAI,KAAM3G,OAC1Cwd,EAAO,GACJpd,EAAI,EAAGA,EAAIJ,KAAKwd,KAAK3Z,OAAQzD,IACpCod,EAAKpd,GAAKJ,KAAKq+F,QAAQ7zD,EAASxqC,KAAKwd,KAAKpd,GAAI,QAAUA,EAAI,IAAKJ,OAEnE,OAAO,IAAI8tG,EAAannG,EAAI6W,IAO9BswF,EAAa9rG,UAAU8vB,MAAQ,WAC7B,OAAO,IAAIg8E,EAAa9tG,KAAK2G,GAAI3G,KAAKwd,KAAKpN,MAAM,KAOnD09F,EAAaS,oBAAsB,SAAU5tG,GAC3C,MAAM,IAAIid,MAAM,sBAAwBjd,IAK1C,IAAM6tG,EAAeV,EAAa9rG,UAAUM,SA6F5C,SAASmsG,EAAgB/7B,EAAUj4B,EAAM71C,GASvC,IARA,IAOImS,EAPA2zF,EAAQ,GAINgE,EAAQ,qDAEVC,EAAW,EAE2B,QAAlC53F,EAAQ23F,EAAMloG,KAAKksE,KAKzB,GAHAg4B,GAASh4B,EAASjiD,UAAUk+E,EAAU53F,EAAMnJ,OAC5C+gG,EAAW53F,EAAMnJ,MAEA,OAAbmJ,EAAM,GACR2zF,GAAS,IACTiE,QACK,CACLA,GAAY53F,EAAM,GAAGlT,OACrB,IAAM9B,EAAW04C,EAAK1jC,EAAM,IAC5B,IAAKhV,EACH,MAAM,IAAI6sG,eAAe,sBAAwB73F,EAAM,GAAK,oBAE9D,QAAiBjT,IAAbiT,EAAM,GACR,WAAehV,IACb,IAAK,SACH2oG,GAAS3oG,EACT,MACF,IAAK,SACH,GAAIqjD,EAAOrjD,GACT2oG,GAAS3oG,EAASg9F,MAAMn6F,OACnB,KAAIsL,MAAMP,QAAQ5N,GASvB,MAAM,IAAIuH,UAAU,aAAeyN,EAAM,GAAK,+CAP9C2zF,GAAS3oG,EAASuB,KAAI,SAAU8N,EAAKxD,GACnC,GAAIw3C,EAAOh0C,GACT,OAAOA,EAAI2tF,MAAMn6F,GAEnB,MAAM,IAAI0E,UAAU,aAAeyN,EAAM,GAAK,IAAMnJ,EAAQ,uBAC3DgB,KAAK,KAIV,MACF,QACE,MAAM,IAAItF,UAAU,aAAeyN,EAAM,GAAK,mDAE7C,CACL,IAAIquC,EAAOrjD,EAASgV,EAAM,KAAOhV,EAASgV,EAAM,KAG9C,MAAM,IAAIzN,UAAU,aAAeyN,EAAM,GAAK,IAAMA,EAAM,GAAK,oBAF/D2zF,GAAS3oG,EAASgV,EAAM,IAAIgoF,MAAMn6F,IAS1C,OAFA8lG,GAASh4B,EAAStiE,MAAMu+F,GAtI1Bb,EAAa9rG,UAAUM,SAAW,SAAUsC,GAC1C,IAAI+5F,EACEh+F,EAAOX,KAAK2G,GAAGrE,SAASsC,GAM9B,OALIA,GAAuC,WAA3B,IAAOA,EAAQwG,UAAyBnJ,GAAe2C,EAAQwG,QAASzK,KAEtFg+F,EAAe/5F,EAAQwG,QAAQzK,GAAMX,KAAM4E,SAGjB,IAAjB+5F,EACFA,EAIF6P,EAAajuG,KAAKP,KAAM4E,IAQjCkpG,EAAa9rG,UAAU68F,UAAY,SAAUj6F,GAC3C,IAAM4Y,EAAOxd,KAAKwd,KAAKla,KAAI,SAAU8N,GACnC,OAAOA,EAAI9O,SAASsC,MAQtB,OALW8gD,EAAyB1lD,KAAK2G,IACpC,IAAM3G,KAAK2G,GAAGrE,SAASsC,GAAW,IACnC5E,KAAK2G,GAAGrE,SAASsC,IAGT,IAAM4Y,EAAK5O,KAAK,MAAQ,KAOtCk/F,EAAa9rG,UAAUsM,OAAS,WAC9B,MAAO,CACLkhD,OAAQ,eACR7oD,GAAI3G,KAAK2G,GACT6W,KAAMxd,KAAKwd,OAWfswF,EAAar+C,SAAW,SAAUC,GAChC,OAAO,IAAIo+C,EAAap+C,EAAK/oD,GAAI+oD,EAAKlyC,OAQxCswF,EAAa9rG,UAAU88F,OAAS,SAAUl6F,GACxC,IAAM4Y,EAAOxd,KAAKwd,KAAKla,KAAI,SAAU8N,GACnC,OAAOA,EAAI0tF,OAAOl6F,MAIpB,MAAO,+BAAiCukD,GAAOnpD,KAAK2G,IAAM,wEAA0E6W,EAAK5O,KAAK,yCAA2C,kEAyE3L,IAAMigG,EAAYf,EAAa9rG,UAAU+8F,MAwFzC,OA3EA+O,EAAa9rG,UAAU+8F,MAAQ,SAAUn6F,GACvC,IAAIkqG,EAMJ,OALIlqG,GAAuC,WAA3B,IAAOA,EAAQwG,UAAyBnJ,GAAe2C,EAAQwG,QAASpL,KAAKW,QAE3FmuG,EAAYlqG,EAAQwG,QAAQpL,KAAKW,MAAMX,KAAM4E,SAGtB,IAAdkqG,EACFA,EAIFD,EAAUtuG,KAAKP,KAAM4E,IAQ9BkpG,EAAa9rG,UAAUg9F,OAAS,SAAUp6F,GACxC,IAIImqG,EAgBAC,EApBExxF,EAAOxd,KAAKwd,KAAKla,KAAI,SAAU8N,GACnC,OAAOA,EAAI2tF,MAAMn6F,MAoBnB,OAfI2iG,GAAevnG,KAAKW,QACtBouG,EAAiBxH,GAAevnG,KAAKW,QAInCuhD,EAAKliD,KAAKW,OACuB,mBAA1BuhD,EAAKliD,KAAKW,MAAMo+F,OACW,WAAjC,IAAO78C,EAAKliD,KAAKW,MAAMo+F,QACU,iBAA1B78C,EAAKliD,KAAKW,MAAMo+F,QAG1BgQ,EAAiB7sD,EAAKliD,KAAKW,MAAMo+F,OAInC,IAAegQ,IACb,IAAK,WACHC,EAAcD,EAAe/uG,KAAM4E,GACnC,MACF,IAAK,SACHoqG,EAAcP,EAAeM,EAAgB/uG,KAAM4E,GACnD,MACF,IAAK,SACH,WAAemqG,EAAevxF,EAAK3Z,UACjC,IAAK,WACHmrG,EAAcD,EAAevxF,EAAK3Z,QAAQ7D,KAAM4E,GAChD,MACF,IAAK,SACHoqG,EAAcP,EAAeM,EAAevxF,EAAK3Z,QAAS7D,KAAM4E,IAKxE,YAA2B,IAAhBoqG,EACFA,EAGFP,EXzMoB,0CWyMYzuG,KAAM4E,IAO/CkpG,EAAa9rG,UAAUi9F,cAAgB,WACrC,OAAOj/F,KAAK8M,KAAO,IAAM9M,KAAKW,MAGzBmtG,IACN,CAAEn+C,SAAS,EAAMvK,QAAQ,IC1df6pD,GAA8BtvG,GAtB9B,QACQ,CACnB,QACA,UACA,SACA,eACA,YACA,iBACA,YACA,kBACA,eACA,yBACA,eACA,YACA,aACA,eACA,kBACA,YACA,iBACA,eAGqE,YAmBjE,IAlBJmiC,EAkBI,EAlBJA,MACAmwC,EAiBI,EAjBJA,QACAhhD,EAgBI,EAhBJA,OACAsuE,EAeI,EAfJA,aACAK,EAcI,EAdJA,UACAS,EAaI,EAbJA,eACA8B,EAYI,EAZJA,UACA5B,EAWI,EAXJA,gBACAwI,EAUI,EAVJA,aACAzI,EASI,EATJA,uBACAwN,EAQI,EARJA,aACAxE,EAOI,EAPJA,UACAU,EAMI,EANJA,WACAK,EAKI,EALJA,aACAoC,EAII,EAJJA,gBACA3L,EAGI,EAHJA,UACAD,EAEI,EAFJA,eACA4M,EACI,EADJA,WAyCMr2F,EAAQ0qB,EAjFH,QAiFe,CACxBhlB,OAAQ,SAAUoyF,GAChB,OAAOC,EAAWD,EAAY,KAEhC,iBAAkB,SAAUE,GAC1B,OAAOC,EAAcD,EAAa,KAEpC,iBAAkB,SAAUF,EAAYtqG,GAGtC,OAAOuqG,EAAWD,OAFmBprG,IAAlBc,EAAQq3E,MAAsBr3E,EAAQq3E,MAAQ,KAInE,yBAA0BozB,IAG5B,SAASA,EAAeD,GAA2B,IAAdxqG,EAAc,uDAAJ,GACvC0qG,OAA+BxrG,IAAlBc,EAAQq3E,MAAsBr3E,EAAQq3E,MAAQ,GAGjE,OAAOloB,GAAQq7C,GAAa,SAAUhlD,GACpC,GAAoB,iBAATA,EAAmB,MAAM,IAAI9gD,UAAU,mBAElD,OAAO6lG,EAAW/kD,EAAMklD,MAK5B,IAAMC,EACE,EADFA,EAEO,EAFPA,EAGI,EAHJA,EAII,EAJJA,EAKK,EAILC,EAAa,CACjB,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACLC,KAAM,EACN,KAAK,EAEL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EAEL,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EAEN,MAAM,EACN,MAAM,EACN,OAAO,GAIHC,EAAmB,CACvB5jF,KAAK,EACLtY,IAAI,EACJ2zE,IAAI,EACJigB,KAAK,EACLC,KAAK,EACLC,IAAI,EACJrwB,KAAK,GAGD04B,EAAY,CAChBzJ,MAAM,EACNC,OAAO,EACP7sC,KAAM,KACNx1D,eAAWA,GAGP8rG,EAAoB,CACxB,MACA,YAwBF,SAASC,EAAe7kG,EAAOnH,GAC7B,OAAOmH,EAAMkkG,WAAW/+B,OAAOnlE,EAAM4C,MAAO/J,GAU9C,SAASisG,EAAkB9kG,GACzB,OAAO6kG,EAAc7kG,EAAO,GAS9B,SAASoV,EAAMpV,GACbA,EAAM4C,QAQR,SAASmiG,EAAe/kG,GACtB,OAAOA,EAAMkkG,WAAWxwF,OAAO1T,EAAM4C,MAAQ,GAQ/C,SAASoiG,EAAehlG,GACtB,OAAOA,EAAMkkG,WAAWxwF,OAAO1T,EAAM4C,MAAQ,GAQ/C,SAASqiG,EAAUjlG,GAMjB,IALAA,EAAMklG,UAAYX,EAClBvkG,EAAMmlG,MAAQ,GACdnlG,EAAMgzF,QAAU,KAGH,CAEX,GAAgC,MAA5B8R,EAAiB9kG,GACnB,KAAmC,OAA5B8kG,EAAiB9kG,IACW,KAA5B8kG,EAAiB9kG,IACtBA,EAAMgzF,SAAW8R,EAAiB9kG,GAClCoV,EAAKpV,GAIT,IAAIoM,EAAMg5F,aAAaN,EAAiB9kG,GAAQA,EAAMqlG,cAGpD,MAFAjwF,EAAKpV,GAOT,GAAgC,KAA5B8kG,EAAiB9kG,GAArB,CAOA,GAAgC,OAA5B8kG,EAAiB9kG,KAAoBA,EAAMqlG,aAI7C,OAHArlG,EAAMklG,UAAYX,EAClBvkG,EAAMmlG,MAAQL,EAAiB9kG,QAC/BoV,EAAKpV,GAIP,IAAMmtD,EAAK23C,EAAiB9kG,GACtBulC,EAAKs/D,EAAc7kG,EAAO,GAC1BslG,EAAKT,EAAc7kG,EAAO,GAChC,GAAkB,IAAdslG,EAAGzsG,QAAgB2rG,EAAWc,GAMhC,OALAtlG,EAAMklG,UAAYX,EAClBvkG,EAAMmlG,MAAQG,EACdlwF,EAAKpV,GACLoV,EAAKpV,QACLoV,EAAKpV,GAKP,GAAkB,IAAdulC,EAAG1sC,QAAgB2rG,EAAWj/D,GAKhC,OAJAvlC,EAAMklG,UAAYX,EAClBvkG,EAAMmlG,MAAQ5/D,EACdnwB,EAAKpV,QACLoV,EAAKpV,GAKP,GAAIwkG,EAAWr3C,GAIb,OAHAntD,EAAMklG,UAAYX,EAClBvkG,EAAMmlG,MAAQh4C,OACd/3C,EAAKpV,GAKP,GAAIoM,EAAMgmE,WAAWjlB,GAArB,CACEntD,EAAMklG,UAAYX,EAGlB,IAAMh/D,EAAKs/D,EAAc7kG,EAAO,GAChC,GAAW,OAAPulC,GAAsB,OAAPA,GAAsB,OAAPA,EAAa,CAK7C,IAJAvlC,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GACLA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GACEoM,EAAMm5F,WAAWT,EAAiB9kG,KACvCA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAEP,GAAgC,MAA5B8kG,EAAiB9kG,GAKnB,IAHAA,EAAMmlG,OAAS,IACf/vF,EAAKpV,GAEEoM,EAAMm5F,WAAWT,EAAiB9kG,KACvCA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,QAEF,GAAgC,MAA5B8kG,EAAiB9kG,GAK1B,IAHAA,EAAMmlG,OAAS,IACf/vF,EAAKpV,GAEEoM,EAAM6lE,QAAQ6yB,EAAiB9kG,KACpCA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAGT,OAIF,GAAgC,MAA5B8kG,EAAiB9kG,IAInB,GAHAA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,IAEAoM,EAAM6lE,QAAQ6yB,EAAiB9kG,IAGlC,YADAA,EAAMklG,UAAYX,OAGf,CACL,KAAOn4F,EAAM6lE,QAAQ6yB,EAAiB9kG,KACpCA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAEHoM,EAAMo5F,cAAcV,EAAiB9kG,GAAQglG,EAAchlG,MAC7DA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,IAIT,KAAOoM,EAAM6lE,QAAQ6yB,EAAiB9kG,KACpCA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAGP,GAAgC,MAA5B8kG,EAAiB9kG,IAA8C,MAA5B8kG,EAAiB9kG,GACtD,GAAIoM,EAAM6lE,QAAQ+yB,EAAchlG,KAAoC,MAAzBglG,EAAchlG,IAA2C,MAAzBglG,EAAchlG,GAAgB,CASvG,GARAA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAE2B,MAA5B8kG,EAAiB9kG,IAA8C,MAA5B8kG,EAAiB9kG,KACtDA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,KAGFoM,EAAM6lE,QAAQ6yB,EAAiB9kG,IAClC,MAAMylG,GAAkBzlG,EAAO,wBAA0B8kG,EAAiB9kG,GAAS,KAGrF,KAAOoM,EAAM6lE,QAAQ6yB,EAAiB9kG,KACpCA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAGP,GAAIoM,EAAMo5F,cAAcV,EAAiB9kG,GAAQglG,EAAchlG,IAC7D,MAAMylG,GAAkBzlG,EAAO,wBAA0B8kG,EAAiB9kG,GAAS,UAEhF,GAA6B,MAAzBglG,EAAchlG,GAEvB,MADAoV,EAAKpV,GACCylG,GAAkBzlG,EAAO,wBAA0B8kG,EAAiB9kG,GAAS,SAtFzF,CA8FA,IAAIoM,EAAMs5F,QAAQZ,EAAiB9kG,GAAQ+kG,EAAc/kG,GAAQglG,EAAchlG,IAA/E,CAiBA,IADAA,EAAMklG,UAAYX,EACiB,KAA5BO,EAAiB9kG,IACtBA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAEP,MAAMylG,GAAkBzlG,EAAO,yBAA2BA,EAAMmlG,MAAQ,KApBtE,KAAO/4F,EAAMs5F,QAAQZ,EAAiB9kG,GAAQ+kG,EAAc/kG,GAAQglG,EAAchlG,KAAWoM,EAAM6lE,QAAQ6yB,EAAiB9kG,KAC1HA,EAAMmlG,OAASL,EAAiB9kG,GAChCoV,EAAKpV,GAGH/I,GAAeytG,EAAkB1kG,EAAMmlG,OACzCnlG,EAAMklG,UAAYX,EAElBvkG,EAAMklG,UAAYX,QAjJpBvkG,EAAMklG,UAAYX,EAmKtB,SAASoB,EAAqB3lG,GAC5B,GACEilG,EAASjlG,SAEY,OAAhBA,EAAMmlG,OAOf,SAASS,EAAY5lG,GACnBA,EAAMqlG,eAOR,SAASQ,EAAa7lG,GACpBA,EAAMqlG,eAiHR,SAASlB,EAAYD,EAAYI,GAC/B,IAAMtkG,EAvYC,CACLskG,WAAY,GACZJ,WAAY,GACZlR,QAAS,GACTpwF,MAAO,EACPuiG,MAAO,GACPD,UAAWX,EACXc,aAAc,EACdS,iBAAkB,MAgYpB,KAAc9lG,EAAO,CAAEkkG,aAAYI,eACnCW,EAASjlG,GAET,IAAMyvC,EAyBR,SAAqBzvC,GACnB,IAAIyvC,EAEA6nD,EADEF,EAAS,GAGK,KAAhBp3F,EAAMmlG,OAAgC,OAAhBnlG,EAAMmlG,OAAkC,MAAhBnlG,EAAMmlG,SACtD11D,EAAOs2D,EAAgB/lG,IAClBgzF,QAAUhzF,EAAMgzF,SAIvB,KAAuB,OAAhBhzF,EAAMmlG,OAAkC,MAAhBnlG,EAAMmlG,OACb,IAAlB/N,EAAOv+F,QAAgB42C,IACzB6nD,EAA2B,MAAhBt3F,EAAMmlG,MACjB/N,EAAO3mF,KAAK,CACVg/B,KAAMA,EACN6nD,QAASA,KAIb2N,EAASjlG,GACW,OAAhBA,EAAMmlG,OAAkC,MAAhBnlG,EAAMmlG,OAAiC,KAAhBnlG,EAAMmlG,SACvD11D,EAAOs2D,EAAgB/lG,IAClBgzF,QAAUhzF,EAAMgzF,QAErBsE,EAA2B,MAAhBt3F,EAAMmlG,MACjB/N,EAAO3mF,KAAK,CACVg/B,KAAMA,EACN6nD,QAASA,KAKf,OAAIF,EAAOv+F,OAAS,EACX,IAAIs+F,EAAUC,IAEhB3nD,KACHA,EAAO,IAAIsuD,OAAajlG,IACnBk6F,QAAUhzF,EAAMgzF,SAGhBvjD,GAlEIu2D,CAAWhmG,GAIxB,GAAoB,KAAhBA,EAAMmlG,MACR,MAAInlG,EAAMklG,YAAcX,EAIhB1qE,GAAY75B,EAAO,uBAAyBA,EAAMmlG,OAElDM,GAAkBzlG,EAAO,oBAAsBA,EAAMmlG,MAAQ,KAIvE,OAAO11D,EA+DT,SAASs2D,EAAiB/lG,GACxB,IAAIrK,EAAM6c,EAAMnc,EAAO4vG,EAEjBx2D,EAmDR,SAA2BzvC,GACzB,IAAIyvC,EAiCN,SAAyBzvC,GACvB,IAAIyvC,EAAOy2D,EAAgBlmG,GAE3B,KAAuB,OAAhBA,EAAMmlG,OACXQ,EAAoB3lG,GACpByvC,EAAO,IAAI4vD,EAAa,KAAM,KAAM,CAAC5vD,EAAMy2D,EAAgBlmG,KAG7D,OAAOyvC,EAzCI02D,CAAenmG,GAE1B,KAAuB,MAAhBA,EAAMmlG,OAAe,CAG1B,IAAMhwF,EAAOnV,EAAM8lG,iBACnB9lG,EAAM8lG,iBAAmB9lG,EAAMqlG,aAC/BM,EAAoB3lG,GAEpB,IAAM81B,EAAY2Z,EACZgoD,EAAWsO,EAAgB/lG,GAEjC,GAAoB,MAAhBA,EAAMmlG,MAAe,MAAMM,GAAkBzlG,EAAO,iDAExDA,EAAM8lG,iBAAmB,KACzBH,EAAoB3lG,GAEpB,IAAM03F,EAAYqO,EAAgB/lG,GAElCyvC,EAAO,IAAI8lD,EAAgBz/D,EAAW2hE,EAAUC,GAGhD13F,EAAM8lG,iBAAmB3wF,EAG3B,OAAOs6B,EA7EM22D,CAAiBpmG,GAE9B,GAAoB,MAAhBA,EAAMmlG,MAAe,CACvB,GAAIlqD,EAAaxL,GAKf,OAHA95C,EAAO85C,EAAK95C,KACZgwG,EAAoB3lG,GACpB3J,EAAQ0vG,EAAgB/lG,GACjB,IAAIq1F,EAAe,IAAIoN,EAAW9sG,GAAOU,GAC3C,GAAI8jD,EAAe1K,GAIxB,OAFAk2D,EAAoB3lG,GACpB3J,EAAQ0vG,EAAgB/lG,GACjB,IAAIq1F,EAAe5lD,EAAK34C,OAAQ24C,EAAK7sC,MAAOvM,GAC9C,GAAIskD,EAAelL,IAASwL,EAAaxL,EAAK9zC,MAEnDsqG,GAAQ,EACRzzF,EAAO,GAEP7c,EAAO85C,EAAK95C,KACZ85C,EAAKj9B,KAAKvZ,SAAQ,SAAUmN,EAAKxD,GAC3Bq4C,EAAa70C,GACfoM,EAAK5P,GAASwD,EAAIzQ,KAElBswG,GAAQ,KAIRA,GAGF,OAFAN,EAAoB3lG,GACpB3J,EAAQ0vG,EAAgB/lG,GACjB,IAAIs1F,EAAuB3/F,EAAM6c,EAAMnc,GAIlD,MAAMovG,GAAkBzlG,EAAO,mDAGjC,OAAOyvC,EA+DT,SAASy2D,EAAiBlmG,GAGxB,IAFA,IAAIyvC,EAAO42D,EAAgBrmG,GAEJ,QAAhBA,EAAMmlG,OACXQ,EAAoB3lG,GACpByvC,EAAO,IAAI4vD,EAAa,MAAO,MAAO,CAAC5vD,EAAM42D,EAAgBrmG,KAG/D,OAAOyvC,EAQT,SAAS42D,EAAiBrmG,GAGxB,IAFA,IAAIyvC,EAAO62D,EAAetmG,GAEH,QAAhBA,EAAMmlG,OACXQ,EAAoB3lG,GACpByvC,EAAO,IAAI4vD,EAAa,MAAO,MAAO,CAAC5vD,EAAM62D,EAAetmG,KAG9D,OAAOyvC,EAQT,SAAS62D,EAAgBtmG,GAGvB,IAFA,IAAIyvC,EAAO82D,EAAgBvmG,GAEJ,MAAhBA,EAAMmlG,OACXQ,EAAoB3lG,GACpByvC,EAAO,IAAI4vD,EAAa,IAAK,QAAS,CAAC5vD,EAAM82D,EAAgBvmG,KAG/D,OAAOyvC,EAQT,SAAS82D,EAAiBvmG,GAGxB,IAFA,IAAIyvC,EAAO+2D,EAAgBxmG,GAEJ,OAAhBA,EAAMmlG,OACXQ,EAAoB3lG,GACpByvC,EAAO,IAAI4vD,EAAa,KAAM,SAAU,CAAC5vD,EAAM+2D,EAAgBxmG,KAGjE,OAAOyvC,EAQT,SAAS+2D,EAAiBxmG,GAGxB,IAFA,IAAIyvC,EAAOg3D,EAAgBzmG,GAEJ,MAAhBA,EAAMmlG,OACXQ,EAAoB3lG,GACpByvC,EAAO,IAAI4vD,EAAa,IAAK,SAAU,CAAC5vD,EAAMg3D,EAAgBzmG,KAGhE,OAAOyvC,EAOT,SAASg3D,EAAiBzmG,GAaxB,IAZA,IAAMy3B,EAAS,CAACivE,EAAW1mG,IACrB+hG,EAAe,GAEf4E,EAAY,CAChB,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,YAGD1vG,GAAe0vG,EAAW3mG,EAAMmlG,QAAQ,CAC7C,IAAMyB,EAAO,CAAEjxG,KAAMqK,EAAMmlG,MAAOxpG,GAAIgrG,EAAU3mG,EAAMmlG,QACtDpD,EAAatxF,KAAKm2F,GAClBjB,EAAoB3lG,GACpBy3B,EAAOhnB,KAAKi2F,EAAW1mG,IAGzB,OAAsB,IAAlBy3B,EAAO5+B,OACF4+B,EAAO,GACa,IAAlBA,EAAO5+B,OACT,IAAIwmG,EAAa0C,EAAa,GAAGpsG,KAAMosG,EAAa,GAAGpmG,GAAI87B,GAE3D,IAAIo+D,EAAekM,EAAazpG,KAAI,SAAA7C,GAAC,OAAIA,EAAEkG,MAAK87B,GAS3D,SAASivE,EAAY1mG,GACnB,IAAIyvC,EAAM95C,EAAMgG,EAAI87B,EAEpBgY,EAAOo3D,EAAgB7mG,GAQvB,IANA,IAAM2mG,EAAY,CAChB,KAAM,YACN,KAAM,kBACN,MAAO,iBAGF1vG,GAAe0vG,EAAW3mG,EAAMmlG,QAErCxpG,EAAKgrG,EADLhxG,EAAOqK,EAAMmlG,OAGbQ,EAAoB3lG,GACpBy3B,EAAS,CAACgY,EAAMo3D,EAAgB7mG,IAChCyvC,EAAO,IAAI4vD,EAAa1pG,EAAMgG,EAAI87B,GAGpC,OAAOgY,EAQT,SAASo3D,EAAiB7mG,GACxB,IAAIyvC,EAAM95C,EAAMgG,EAAI87B,EAEpBgY,EAAOq3D,GAAW9mG,GAOlB,IALA,IAAM2mG,EAAY,CAChBn+F,GAAI,KACJ2zE,GAAI,MAGCllF,GAAe0vG,EAAW3mG,EAAMmlG,QAErCxpG,EAAKgrG,EADLhxG,EAAOqK,EAAMmlG,OAGbQ,EAAoB3lG,GAEP,OAATrK,GAAiC,KAAhBqK,EAAMmlG,MAEzB11D,EAAO,IAAI4vD,EAAa,IAAK,WAAY,CAAC5vD,EAAM,IAAIgzD,EAAW,QAAQ,IAGvEhrE,EAAS,CAACgY,EAAMq3D,GAAW9mG,IAC3ByvC,EAAO,IAAI4vD,EAAa1pG,EAAMgG,EAAI87B,IAItC,OAAOgY,EAQT,SAASq3D,GAAY9mG,GACnB,IAAIyvC,EACEhY,EAAS,GAUf,GANEgY,EAFkB,MAAhBzvC,EAAMmlG,MAED,IAAIpH,EAAa,GAGjBgJ,GAAiB/mG,GAGN,MAAhBA,EAAMmlG,OAAkBnlG,EAAM8lG,mBAAqB9lG,EAAMqlG,aAAe,CAK1E,IAHA5tE,EAAOhnB,KAAKg/B,GAGW,MAAhBzvC,EAAMmlG,OAAiB1tE,EAAO5+B,OAAS,GAC5C8sG,EAAoB3lG,GAEA,MAAhBA,EAAMmlG,OAAiC,MAAhBnlG,EAAMmlG,OAAiC,MAAhBnlG,EAAMmlG,OAAiC,KAAhBnlG,EAAMmlG,MAE7E1tE,EAAOhnB,KAAK,IAAIgyF,EAAW,QAG3BhrE,EAAOhnB,KAAKs2F,GAAiB/mG,IAM/ByvC,EAFoB,IAAlBhY,EAAO5+B,OAEF,IAAIi9F,EAAUr+D,EAAO,GAAIA,EAAO,GAAIA,EAAO,IAG3C,IAAIq+D,EAAUr+D,EAAO,GAAIA,EAAO,IAI3C,OAAOgY,EAQT,SAASs3D,GAAkB/mG,GACzB,IAAIyvC,EAAM95C,EAAMgG,EAAI87B,EAEpBgY,EAAOu3D,GAAoBhnG,GAM3B,IAJA,IAAM2mG,EAAY,CAChB,IAAK,MACL,IAAK,YAEA1vG,GAAe0vG,EAAW3mG,EAAMmlG,QAAQ,CAE7CxpG,EAAKgrG,EADLhxG,EAAOqK,EAAMmlG,OAGbQ,EAAoB3lG,GACpB,IAAMinG,EAAYD,GAAoBhnG,GAEpCy3B,EADEwvE,EAAUzH,aACH,CAAC/vD,EAAM,IAAI4vD,EAAa,IAAK,WAAY,CAAC5vD,EAAMw3D,KAEhD,CAACx3D,EAAMw3D,GAElBx3D,EAAO,IAAI4vD,EAAa1pG,EAAMgG,EAAI87B,GAGpC,OAAOgY,EAQT,SAASu3D,GAAqBhnG,GAC5B,IAAIyvC,EAAM/W,EAAM/iC,EAAMgG,EAGtB+8B,EADA+W,EAAOy3D,GAA4BlnG,GAUnC,IAPA,IAAM2mG,EAAY,CAChB,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,aAIF1vG,GAAe0vG,EAAW3mG,EAAMmlG,QAGlCxpG,EAAKgrG,EADLhxG,EAAOqK,EAAMmlG,OAGbQ,EAAoB3lG,GAEpB04B,EAAOwuE,GAA4BlnG,GACnCyvC,EAAO,IAAI4vD,EAAa1pG,EAAMgG,EAAI,CAAC8zC,EAAM/W,IAM7C,OAAO+W,EAQT,SAASy3D,GAA6BlnG,GACpC,IAAIyvC,EAAM/W,EAKV,IAFAA,EADA+W,EAAO03D,GAAWnnG,GAIXA,EAAMklG,YAAcX,GACJ,OAAhBvkG,EAAMmlG,OAAkB1qD,EAAehL,MACvCzvC,EAAMklG,YAAcX,GAChB9pD,EAAe/hB,IACdoiB,EAAepiB,IAAqB,MAAZA,EAAK4mE,KAClB,MAAhBt/F,EAAMmlG,OAMTzsE,EAAOyuE,GAAWnnG,GAClByvC,EAAO,IAAI4vD,EAAa,IAAK,WAAY,CAAC5vD,EAAM/W,IAAO,GAM3D,OAAO+W,EAUT,SAAS03D,GAAYnnG,GAKnB,IAJA,IAAIyvC,EAAO23D,GAAgBpnG,GACvB04B,EAAO+W,EACL43D,EAAc,GAIE,MAAhBrnG,EAAMmlG,OAAiB1qD,EAAe/hB,IAF/B,CAQT,GAJA2uE,EAAY52F,KAAK,KAAc,GAAIzQ,IACnC2lG,EAAoB3lG,GAGhBA,EAAMklG,YAAcX,EAmBjB,CAEL,KAAcvkG,EAAOqnG,EAAY1mF,OACjC,MAhBA,GAJA0mF,EAAY52F,KAAK,KAAc,GAAIzQ,IACnC2lG,EAAoB3lG,GAGhBA,EAAMklG,YAAcX,GAAoC,MAAhBvkG,EAAMmlG,MAO3C,CAELkC,EAAY1mF,MACZ,KAAc3gB,EAAOqnG,EAAY1mF,OACjC,MARA,KAAc3gB,EAAOqnG,EAAY1mF,OACjC0mF,EAAY1mF,MACZ+X,EAAO0uE,GAAgBpnG,GACvByvC,EAAO,IAAI4vD,EAAa,IAAK,SAAU,CAAC5vD,EAAM/W,IAiBtD,OAAO+W,EAQT,SAAS23D,GAAiBpnG,GACxB,IAAIyvC,EAAM95C,EAAMgG,EAAI87B,EAEpBgY,EAAO63D,GAAWtnG,GAMlB,IAJA,IAAM2mG,EAAY,CAChB,IAAK,MACL7lF,IAAK,OAEA7pB,GAAe0vG,EAAW3mG,EAAMmlG,QAErCxpG,EAAKgrG,EADLhxG,EAAOqK,EAAMmlG,OAGbQ,EAAoB3lG,GAEP,MAATrK,GAAgBqK,EAAMklG,YAAcX,GAAuC,MAAhBvkG,EAAMmlG,MAEnE11D,EAAO,IAAI4vD,EAAa,IAAK,SAAU,CAAC5vD,EAAM,IAAIsuD,EAAa,OAAO,GAAO,IAE7EtmE,EAAS,CAACgY,EAAM63D,GAAWtnG,IAC3ByvC,EAAO,IAAI4vD,EAAa1pG,EAAMgG,EAAI87B,IAItC,OAAOgY,EAQT,SAAS63D,GAAYtnG,GACnB,IAAIrK,EAAM8hC,EAAQ97B,EACZgrG,EAAY,CAChB,IAAK,aACL,IAAK,YACL,IAAK,SACL16B,IAAK,OAGP,OAAIh1E,GAAe0vG,EAAW3mG,EAAMmlG,QAClCxpG,EAAKgrG,EAAU3mG,EAAMmlG,OACrBxvG,EAAOqK,EAAMmlG,MAEbQ,EAAoB3lG,GACpBy3B,EAAS,CAAC6vE,GAAWtnG,IAEd,IAAIq/F,EAAa1pG,EAAMgG,EAAI87B,IAYtC,SAAmBz3B,GACjB,IAAIyvC,EAAM95C,EAAMgG,EAAI87B,EAEpBgY,EAmBF,SAAiCzvC,GAC/B,IAAIyvC,EAAM95C,EAAMgG,EAEhB8zC,EAiDF,SAA2BzvC,GACzB,IAAIy3B,EAAS,GAEb,GAAIz3B,EAAMklG,YAAcX,GAAoBttG,GAAe+I,EAAMskG,WAAYtkG,EAAMmlG,OAAQ,CACzF,IAAMoC,EAAavnG,EAAMskG,WAAWtkG,EAAMmlG,OAK1C,GAHAF,EAASjlG,GAGW,MAAhBA,EAAMmlG,MAAe,CAMvB,GALA1tE,EAAS,GAETmuE,EAAW5lG,GACXilG,EAASjlG,GAEW,MAAhBA,EAAMmlG,MAIR,IAHA1tE,EAAOhnB,KAAKs1F,EAAgB/lG,IAGL,MAAhBA,EAAMmlG,OACXF,EAASjlG,GACTy3B,EAAOhnB,KAAKs1F,EAAgB/lG,IAIhC,GAAoB,MAAhBA,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,0BAEjC6lG,EAAY7lG,GACZilG,EAASjlG,GAKX,OAAO,IAAIunG,EAAW9vE,GAGxB,OAQF,SAAsBz3B,GACpB,IAAIyvC,EAAM95C,EAEV,GAAIqK,EAAMklG,YAAcX,GACnBvkG,EAAMklG,YAAcX,GAAuBvkG,EAAMmlG,SAAST,EAe7D,OAdA/uG,EAAOqK,EAAMmlG,MAEbF,EAASjlG,GAGPyvC,EADEx4C,GAAe0tG,EAAWhvG,GACrB,IAAIooG,EAAa4G,EAAUhvG,KACY,IAArCivG,EAAkB1pF,QAAQvlB,GAC5B,IAAIooG,EAAa92B,EAAQtxE,EAAM,WAE/B,IAAI8sG,EAAW9sG,GAIxB85C,EAAO+3D,GAAexnG,EAAOyvC,GAI/B,OAkGF,SAAkCzvC,GAChC,IAAIyvC,EAAMj6B,EAEV,GAAoB,MAAhBxV,EAAMmlG,MASR,OARA3vF,EAAMiyF,GAA6BznG,GAGnCyvC,EAAO,IAAIsuD,EAAavoF,GAGxBi6B,EAAO+3D,GAAexnG,EAAOyvC,GAK/B,OAoCF,SAAkCzvC,GAChC,IAAIyvC,EAAMj6B,EAEV,GAAoB,MAAhBxV,EAAMmlG,MASR,OARA3vF,EAAMkyF,GAA6B1nG,GAGnCyvC,EAAO,IAAIsuD,EAAavoF,GAGxBi6B,EAAO+3D,GAAexnG,EAAOyvC,GAK/B,OAoCF,SAAsBzvC,GACpB,IAAI+F,EAAO0xB,EAAQkwB,EAAM2Y,EAEzB,GAAoB,MAAhBtgE,EAAMmlG,MAAe,CAKvB,GAHAS,EAAW5lG,GACXilG,EAASjlG,GAEW,MAAhBA,EAAMmlG,MAAe,CAEvB,IAAMv9C,EAAM+/C,GAAS3nG,GAErB,GAAoB,MAAhBA,EAAMmlG,MAAe,CAMvB,IAJAx9C,EAAO,EACPlwB,EAAS,CAACmwB,GAGa,MAAhB5nD,EAAMmlG,OACXF,EAASjlG,GAETy3B,EAAOkwB,GAAQggD,GAAS3nG,GACxB2nD,IAGF,GAAoB,MAAhB3nD,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,4BAEjC6lG,EAAY7lG,GACZilG,EAASjlG,GAGTsgE,EAAO7oC,EAAO,GAAG5jB,MAAMhb,OACvB,IAAK,IAAI3C,EAAI,EAAGA,EAAIyxD,EAAMzxD,IACxB,GAAIuhC,EAAOvhC,GAAG2d,MAAMhb,SAAWynE,EAC7B,MAAMzmC,GAAY75B,EAAO,+BACfy3B,EAAOvhC,GAAG2d,MAAMhb,OAAS,QAAUynE,EAAO,KAIxDv6D,EAAQ,IAAI6uF,EAAUn9D,OACjB,CAEL,GAAoB,MAAhBz3B,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,4BAEjC6lG,EAAY7lG,GACZilG,EAASjlG,GAET+F,EAAQ6hD,QAIVi+C,EAAY7lG,GACZilG,EAASjlG,GACT+F,EAAQ,IAAI6uF,EAAU,IAGxB,OAAO4S,GAAexnG,EAAO+F,GAG/B,OA2BF,SAAsB/F,GACpB,GAAoB,MAAhBA,EAAMmlG,MAAe,CAEvB,IAAIxuG,EADJivG,EAAW5lG,GAGX,IAAMsR,EAAa,GACnB,GAGE,GAFA2zF,EAASjlG,GAEW,MAAhBA,EAAMmlG,MAAe,CAEvB,GAAoB,MAAhBnlG,EAAMmlG,MACRxuG,EAAM8wG,GAA6BznG,QAC9B,GAAoB,MAAhBA,EAAMmlG,MACfxuG,EAAM+wG,GAA6B1nG,OAC9B,MAAIA,EAAMklG,YAAcX,GAAqBvkG,EAAMklG,YAAcX,GAAuBvkG,EAAMmlG,SAAST,GAI5G,MAAMe,GAAkBzlG,EAAO,2CAH/BrJ,EAAMqJ,EAAMmlG,MACZF,EAASjlG,GAMX,GAAoB,MAAhBA,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,qCAEjCilG,EAASjlG,GAGTsR,EAAW3a,GAAOovG,EAAgB/lG,UAGf,MAAhBA,EAAMmlG,OAEb,GAAoB,MAAhBnlG,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,oDAEjC6lG,EAAY7lG,GACZilG,EAASjlG,GAET,IAAIyvC,EAAO,IAAIuvD,EAAW1tF,GAK1B,OAFAm+B,EAAO+3D,GAAexnG,EAAOyvC,GAK/B,OAQF,SAAsBzvC,GACpB,IAAI4nG,EAEJ,GAAI5nG,EAAMklG,YAAcX,EAKtB,OAHAqD,EAAY5nG,EAAMmlG,MAClBF,EAASjlG,GAEF,IAAI+9F,EAAa92B,EAAQ2gC,EAAW3hF,EAAO5N,SAGpD,OAQF,SAA2BrY,GACzB,IAAIyvC,EAGJ,GAAoB,MAAhBzvC,EAAMmlG,MAAe,CAOvB,GALAS,EAAW5lG,GACXilG,EAASjlG,GAETyvC,EAAOs2D,EAAgB/lG,GAEH,MAAhBA,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,0BAOjC,OALA6lG,EAAY7lG,GACZilG,EAASjlG,GAETyvC,EAAO,IAAIgyD,EAAgBhyD,GAC3BA,EAAO+3D,GAAexnG,EAAOyvC,GAI/B,OAQF,SAAmBzvC,GACjB,KAAoB,KAAhBA,EAAMmlG,MAEFM,GAAkBzlG,EAAO,gCAEzBylG,GAAkBzlG,EAAO,kBAb1B6nG,CAAS7nG,GA9BT8nG,CAAiB9nG,GAnBjBmyE,CAAYnyE,GA3EZ+nG,CAAY/nG,GAjGZgoG,CAAYhoG,GAnDZioG,CAAwBjoG,GAjHxBkoG,CAAwBloG,GA9BxBmoG,CAAYnoG,GAtFZooG,CAAiBpoG,GAExB,IAAM2mG,EAAY,CAChB,IAAK,YACLlC,IAAM,cAGR,KAAOxtG,GAAe0vG,EAAW3mG,EAAMmlG,QACrCxvG,EAAOqK,EAAMmlG,MACbxpG,EAAKgrG,EAAUhxG,GAEfsvG,EAASjlG,GAGTyvC,EAAO,IAAI4vD,EAAa1pG,EAAMgG,EAFrB,CAAC8zC,IAGVA,EAAO+3D,GAAexnG,EAAOyvC,GAG/B,OAAOA,EAxCA44D,CAAuBroG,IAEV,MAAhBA,EAAMmlG,OAAiC,OAAhBnlG,EAAMmlG,SAC/BxvG,EAAOqK,EAAMmlG,MACbxpG,EAAe,MAAThG,EAAgB,MAAQ,SAE9BgwG,EAAoB3lG,GACpBy3B,EAAS,CAACgY,EAAM63D,GAAWtnG,IAC3ByvC,EAAO,IAAI4vD,EAAa1pG,EAAMgG,EAAI87B,IAGpC,OAAOgY,EAvBA64D,CAAStoG,GAuKlB,SAASwnG,GAAgBxnG,EAAOyvC,EAAM1Y,GAGpC,IAFA,IAAIU,IAEoB,MAAhBz3B,EAAMmlG,OAAiC,MAAhBnlG,EAAMmlG,OAAiC,MAAhBnlG,EAAMmlG,OACtDpuE,IAAyC,IAAhCA,EAAM7b,QAAQlb,EAAMmlG,SAGjC,GAFA1tE,EAAS,GAEW,MAAhBz3B,EAAMmlG,MAAe,CACvB,IAAIlqD,EAAaxL,KAAS0K,EAAe1K,GA0BvC,OAAOA,EArBP,GAHAm2D,EAAW5lG,GACXilG,EAASjlG,GAEW,MAAhBA,EAAMmlG,MAIR,IAHA1tE,EAAOhnB,KAAKs1F,EAAgB/lG,IAGL,MAAhBA,EAAMmlG,OACXF,EAASjlG,GACTy3B,EAAOhnB,KAAKs1F,EAAgB/lG,IAIhC,GAAoB,MAAhBA,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,0BAEjC6lG,EAAY7lG,GACZilG,EAASjlG,GAETyvC,EAAO,IAAIqzD,EAAarzD,EAAMhY,QAO3B,GAAoB,MAAhBz3B,EAAMmlG,MAAe,CAK9B,GAHAS,EAAW5lG,GACXilG,EAASjlG,GAEW,MAAhBA,EAAMmlG,MAIR,IAHA1tE,EAAOhnB,KAAKs1F,EAAgB/lG,IAGL,MAAhBA,EAAMmlG,OACXF,EAASjlG,GACTy3B,EAAOhnB,KAAKs1F,EAAgB/lG,IAIhC,GAAoB,MAAhBA,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,0BAEjC6lG,EAAY7lG,GACZilG,EAASjlG,GAETyvC,EAAO,IAAI8kD,EAAa9kD,EAAM,IAAI6uD,EAAU7mE,QACvC,CAIL,GAFAwtE,EAASjlG,GAELA,EAAMklG,YAAcX,EACtB,MAAMkB,GAAkBzlG,EAAO,oCAEjCy3B,EAAOhnB,KAAK,IAAIstF,EAAa/9F,EAAMmlG,QACnCF,EAASjlG,GAGTyvC,EAAO,IAAI8kD,EAAa9kD,EAAM,IAAI6uD,EAAU7mE,GADxB,IAKxB,OAAOgY,EA8BT,SAASg4D,GAA8BznG,GAGrC,IAFA,IAAIwV,EAAM,GAEyB,KAA5BsvF,EAAiB9kG,IAA6C,MAA5B8kG,EAAiB9kG,IACxB,OAA5B8kG,EAAiB9kG,KAGnBwV,GAAOsvF,EAAiB9kG,GACxBoV,EAAKpV,IAGPwV,GAAOsvF,EAAiB9kG,GACxBoV,EAAKpV,GAIP,GADAilG,EAASjlG,GACW,MAAhBA,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,4BAIjC,OAFAilG,EAASjlG,GAEFqvD,KAAKjjD,MAAM,IAAMoJ,EAAM,KA8BhC,SAASkyF,GAA8B1nG,GAGrC,IAFA,IAAIwV,EAAM,GAEyB,KAA5BsvF,EAAiB9kG,IAA6C,MAA5B8kG,EAAiB9kG,IACxB,OAA5B8kG,EAAiB9kG,KAGnBwV,GAAOsvF,EAAiB9kG,GACxBoV,EAAKpV,IAGPwV,GAAOsvF,EAAiB9kG,GACxBoV,EAAKpV,GAIP,GADAilG,EAASjlG,GACW,MAAhBA,EAAMmlG,MACR,MAAMM,GAAkBzlG,EAAO,4BAIjC,OAFAilG,EAASjlG,GAEFqvD,KAAKjjD,MAAM,IAAMoJ,EAAM,KA4EhC,SAASmyF,GAAU3nG,GAIjB,IAHA,IAAMy3B,EAAS,CAACsuE,EAAgB/lG,IAC5BqG,EAAM,EAEa,MAAhBrG,EAAMmlG,OACXF,EAASjlG,GAGTy3B,EAAOpxB,GAAO0/F,EAAgB/lG,GAC9BqG,IAGF,OAAO,IAAIuuF,EAAUn9D,GA0IvB,SAASqwB,GAAK9nD,GACZ,OAAOA,EAAM4C,MAAQ5C,EAAMmlG,MAAMtsG,OAAS,EAU5C,SAAS4sG,GAAmBzlG,EAAOu+C,GACjC,IAAM9oD,EAAIqyD,GAAI9nD,GACR3G,EAAQ,IAAI0R,YAAYwzC,EAAU,UAAY9oD,EAAI,KAGxD,OAFA4D,EAAMkvG,KAAO9yG,EAEN4D,EAUT,SAASwgC,GAAa75B,EAAOu+C,GAC3B,IAAM9oD,EAAIqyD,GAAI9nD,GACR3G,EAAQ,IAAI0R,YAAYwzC,EAAU,UAAY9oD,EAAI,KAGxD,OAFA4D,EAAMkvG,KAAO9yG,EAEN4D,EAGT,OAzxCA+S,EAAMs5F,QAAU,SAAkBjwG,EAAG+yG,EAAOC,GAC1C,OAAOr8F,EAAMs8F,oBAAoBjzG,IAC7B2W,EAAMu8F,kBAAkBlzG,EAAGgzG,IAC3Br8F,EAAMu8F,kBAAkBH,EAAO/yG,IAQrC2W,EAAMs8F,oBAAsB,SAA8BjzG,GACxD,MAAO,sDAAsD4J,KAAK5J,IAkBpE2W,EAAMu8F,kBAAoB,SAA4BC,EAAM7zF,GAC1D,MAAO,aAAa1V,KAAKupG,IACrB,oBAAoBvpG,KAAK0V,IACzB,2KAA2K1V,KAAK0V,IAStL3I,EAAMg5F,aAAe,SAAuB3vG,EAAG4vG,GAE7C,MAAa,MAAN5vG,GAAmB,OAANA,GAAqB,OAANA,GAAc4vG,EAAe,GAUlEj5F,EAAMo5F,cAAgB,SAAwB/vG,EAAGgzG,GAC/C,MAAa,MAANhzG,GAAuB,MAAVgzG,GAA2B,MAAVA,GAA2B,MAAVA,GAQxDr8F,EAAMgmE,WAAa,SAAqB38E,GACtC,OAASA,GAAK,KAAOA,GAAK,KAAc,MAANA,GAQpC2W,EAAM6lE,QAAU,SAAkBx8E,GAChC,OAAQA,GAAK,KAAOA,GAAK,KAQ3B2W,EAAMm5F,WAAa,SAAqB9vG,GACtC,OAASA,GAAK,KAAOA,GAAK,KACjBA,GAAK,KAAOA,GAAK,KACjBA,GAAK,KAAOA,GAAK,KAqsCrB2W,KCzvDIy8F,GAAgCl0G,GAHhC,UACQ,CAAC,QAAS,UAE0C,YAAsB,IAAnBmiC,EAAmB,EAAnBA,MAAO1qB,EAAY,EAAZA,MAmCjF,OAAO0qB,EAtCI,UAsCQ,CACjBhlB,OAAQ,SAAUmhF,GAChB,OAAO7mF,EAAM6mF,GAAMF,WAGrB,iBAAkB,SAAUE,GAC1B,OAAOlqC,GAAQkqC,GAAM,SAAU77D,GAC7B,OAAOhrB,EAAMgrB,GAAO27D,mBCzCf+V,GAAiCn0G,GAHjC,WACQ,CAAC,QAAS,UAE2C,YAAsB,IAAnBmiC,EAAmB,EAAnBA,MAAO1qB,EAAY,EAAZA,MAiClF,OAAO0qB,EApCI,WAoCQ,CACjBhlB,OAAQ,SAAUmhF,GAChB,IAAMhxC,EAAQqB,KACd,OAAOl3C,EAAM6mF,GAAMF,UAAUD,SAAS7wC,IAGxC,uBAAwB,SAAUgxC,EAAMhxC,GACtC,OAAO71C,EAAM6mF,GAAMF,UAAUD,SAAS7wC,IAGxC,iBAAkB,SAAUgxC,GAC1B,IAAMhxC,EAAQqB,KACd,OAAOyF,GAAQkqC,GAAM,SAAU77D,GAC7B,OAAOhrB,EAAMgrB,GAAO27D,UAAUD,SAAS7wC,OAI3C,+BAAgC,SAAUgxC,EAAMhxC,GAC9C,OAAO8G,GAAQkqC,GAAM,SAAU77D,GAC7B,OAAOhrB,EAAMgrB,GAAO27D,UAAUD,SAAS7wC,YCrDlC8mD,GAAoCp0G,GAHpC,SACQ,CAAC,aAEuD,YAAkB,IAAfm+F,EAAe,EAAfA,SAiD9E,SAASkW,IACP,KAAMh0G,gBAAgBg0G,GACpB,MAAM,IAAIj+F,YACR,oDAGJjV,OAAOC,eAAef,KAAM,QAAS,CACnCqB,MAAOitD,KACPt8C,UAAU,IA4Ed,OArEAgiG,EAAOhyG,UAAU8K,KAAO,SACxBknG,EAAOhyG,UAAUiyG,UAAW,EAS5BD,EAAOhyG,UAAU87F,SAAW,SAAUG,GAEpC,OAAOH,EAASG,EAAMj+F,KAAKitD,QAS7B+mD,EAAOhyG,UAAUf,IAAM,SAAUN,GAE/B,GAAIX,KAAKitD,MAAM/tC,IAAIve,GACjB,OAAOX,KAAKitD,MAAMhsD,IAAIN,IAQ1BqzG,EAAOhyG,UAAUkyG,OAAS,WACxB,OnPlCG,SAAmB5wG,GACxB,GAAIA,aAAe8qD,GACjB,OAAO9qD,EAAI+qD,cAEb,IAJ6B,EAIvBvsD,EAAS,GAJc,KAKXwB,EAAI0P,QALO,IAK7B,2BAA8B,KAAnBrR,EAAmB,QAE5BqsD,GAAgBlsD,EAAQH,EADV2B,EAAIrC,IAAIU,KANK,8BAS7B,OAAOG,EmPyBE6O,CAAS3Q,KAAKitD,QAOvB+mD,EAAOhyG,UAAUmyG,YAAc,WAC7B,OAAOn0G,KAAKitD,OAQd+mD,EAAOhyG,UAAUiG,IAAM,SAAUtH,EAAMU,GAErC,OADArB,KAAKitD,MAAMhlD,IAAItH,EAAMU,GACdA,GAOT2yG,EAAOhyG,UAAUw5E,OAAS,SAAU76E,GAClCX,KAAKitD,MAAMkd,OAAOxpE,IAMpBqzG,EAAOhyG,UAAUgwC,MAAQ,WACvBhyC,KAAKitD,MAAMjb,SAGNgiE,IACN,CAAErkD,SAAS,ICvIDykD,GAA+Bz0G,GAH/B,SACQ,CAAC,QAAS,WAEyC,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOkyE,EAAa,EAAbA,OA4ChF,OAAOlyE,EA/CI,SA+CQ,CACjB,GAAI,WACF,OAAO,IAAIkyE,QC/BJK,GAA4B10G,GAjB5B,MACQ,CACnB,QACA,SACA,MACA,YACA,eACA,iBACA,WACA,SACA,cACA,aACA,cACA,eACA,QAGmE,YAgBhE,IAdDmiC,EAcC,EAdDA,MACAutB,EAaC,EAbDA,OACAj5C,EAYC,EAZDA,IACAwrD,EAWC,EAXDA,UACAwS,EAUC,EAVDA,aACAvS,EASC,EATDA,eACArzC,EAQC,EARDA,SACAw+C,EAOC,EAPDA,OACA7W,EAMC,EANDA,YACA8G,EAKC,EALDA,WACAjO,EAIC,EAJDA,YACAoH,EAGC,EAHDA,aACAwlB,EAEC,EAFDA,IA6BF,OAAO95C,EA5DI,MA4DQ,CAEjBktB,YAAa,SAAUxuD,GACrB,OAAO8zG,EAAU9zG,IAGnB41D,aAAc,SAAU51D,GACtB,OAAO+zG,EAAW/zG,IAGpB0P,MAAO,SAAU+F,GAEf,IAEM/U,EAAIozG,EAFAjlD,EAAOp5C,IAIjB,MAAO,CACLogE,EAAGn1E,EAAEm1E,EAAE34D,UACP82F,EAAGtzG,EAAEszG,EAAE92F,UACPxb,EAAGhB,EAAEgB,MAKX,SAASoyG,EAAW9zG,GAElB,IAaIJ,EAAG+U,EAAG1E,EAbJkiD,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAEpBvvD,EAAIY,KAAKyQ,IAAIy/C,EAAME,GAEjB55B,EAAOnH,GAAMtxB,EAAE2wD,OAEfsjD,EAAQ,GACRC,EAAQ,CAAC/hD,EAAM9wD,GAEf8yG,EAAQ,GACRC,EAAQ,CAAC/yG,EAAGgxD,GAIZ3wD,EAAI,GACV,IAAK9B,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAO8B,EAAE9B,GAAKA,EAEpC,IAAK+U,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,CAE5B,GAAIA,EAAI,EAEN,IAAK/U,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAK,CAEzB,IAAM8S,EAAMzQ,KAAKyQ,IAAI9S,EAAG+U,GAEpBhT,EAAI,EAER,IAAKsO,EAAI,EAAGA,EAAIyC,EAAKzC,IAEnBtO,EAAIy/D,EAAUz/D,EAAG0/D,EAAe5oC,EAAK74B,GAAGqQ,GAAIwoB,EAAKxoB,GAAG0E,KAEtD8jB,EAAK74B,GAAG+U,GAAKqZ,EAASyK,EAAK74B,GAAG+U,GAAIhT,GAItC,IAAI6uB,EAAK7b,EACL0/F,EAAQ,EACRr/B,EAAM,EAEV,IAAKp1E,EAAI+U,EAAG/U,EAAIuyD,EAAMvyD,IAAK,CAEzB,IAAMqe,EAAIwa,EAAK74B,GAAG+U,GAEZ2/F,EAAO1+F,EAAIqI,GAEbuuD,EAAO8nC,EAAMD,KAEf7jF,EAAK5wB,EAELy0G,EAAQC,EAERt/B,EAAM/2D,GAWV,GAPItJ,IAAM6b,IAER9uB,EAAEiT,GAAK,CAACjT,EAAE8uB,GAAK9uB,EAAE8uB,GAAM9uB,EAAEiT,IAAI,GAE7B65C,EAAYoE,UAAUj+C,EAAG6b,EAAIiI,IAG3B9jB,EAAIw9C,EAEN,IAAKvyD,EAAI+U,EAAI,EAAG/U,EAAIuyD,EAAMvyD,IAAK,CAE7B,IAAM20G,EAAM97E,EAAK74B,GAAG+U,GACfghD,EAAY4+C,EAAK,KAEpB97E,EAAK74B,GAAG+U,GAAKi/D,EAAan7C,EAAK74B,GAAG+U,GAAIqgE,KAM9C,IAAKrgE,EAAI,EAAGA,EAAI09C,EAAS19C,IAEvB,IAAK/U,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAEV,IAAN+U,IAEE/U,EAAIyyD,IAEN8hD,EAAMv0G,GAAK,IAGbq0G,EAAMr0G,GAAK,IAGTA,EAAI+U,GAEF/U,EAAIyyD,IAEN8hD,EAAMv0G,GAAG+U,GAAK8jB,EAAK74B,GAAG+U,IAGpBA,EAAIw9C,IAEN8hD,EAAMr0G,GAAG+U,GAAK,IAKd/U,IAAM+U,GAcN/U,EAAIyyD,IAEN8hD,EAAMv0G,GAAG+U,GAAK,GAGZA,EAAIw9C,IAEN8hD,EAAMr0G,GAAG+U,GAAK8jB,EAAK74B,GAAG+U,MAnBlB/U,EAAIyyD,IAEN8hD,EAAMv0G,GAAG+U,GAAK8jB,EAAK74B,GAAG+U,IAGpBA,EAAIw9C,IAEN8hD,EAAMr0G,GAAG+U,GAAK,IAiBtB,IAAM9U,EAAI,IAAI2uD,EAAY,CACxB/1B,KAAMw7E,EACN/kE,KAAMglE,IAGF3jF,EAAI,IAAIi+B,EAAY,CACxB/1B,KAAM07E,EACNjlE,KAAMklE,IAGF79C,EAAK,GACX,IAAK32D,EAAI,EAAGyB,EAAIK,EAAE2B,OAAQzD,EAAIyB,EAAGzB,IAAO22D,EAAG70D,EAAE9B,IAAMA,EAEnD,MAAO,CACLi2E,EAAGh2E,EACHm0G,EAAGzjF,EACH7uB,EAAG60D,EACHz0D,SAAU,WACR,MAAO,MAAQtC,KAAKq2E,EAAE/zE,WAAa,QAAUtC,KAAKw0G,EAAElyG,WAAa,QAAUtC,KAAKkC,IAKtF,SAASqyG,EAAY/zG,GAEnB,IAmBIJ,EAAG+U,EAAG1E,EAnBJkiD,EAAOnyD,EAAE4wD,MAAM,GACfyB,EAAUryD,EAAE4wD,MAAM,GAElBvvD,EAAIY,KAAKyQ,IAAIy/C,EAAME,GAEnBplD,EAASjN,EAAEi0D,QACX7mD,EAAQpN,EAAEm0D,OACV4B,EAAM/1D,EAAEq0D,KAERmgD,EAAU,GACV58D,EAAS,GACT68D,EAAO,GACPP,EAAQ,CAAC/hD,EAAM9wD,GAEfqzG,EAAU,GACVC,EAAS,GACTC,EAAO,GACPR,EAAQ,CAAC/yG,EAAGgxD,GAIZwiD,EAAO,GACPC,EAAO,GACb,IAAKl1G,EAAI,EAAGA,EAAIuyD,EAAMvyD,IACpBi1G,EAAKj1G,GAAKA,EACVk1G,EAAKl1G,GAAKA,EAGZ,IA9BsB,aA4CpB,IAAMm1G,EAAM,IAAI35B,EAEZzmE,EAAIw9C,IAENsiD,EAAKx5F,KAAKu5F,EAAQnxG,QAElBmxG,EAAQv5F,KAAK,GACb28B,EAAO38B,KAAKtG,IAGdigG,EAAK35F,KAAKy5F,EAAQrxG,QAElB,IAAMywD,EAAKiC,EAAIphD,GACTo/C,EAAKgC,EAAIphD,EAAI,GAEnB,IAAK1E,EAAI6jD,EAAI7jD,EAAI8jD,EAAI9jD,IAEnBrQ,EAAIwN,EAAM6C,GAEV8kG,EAAIttG,IAAIotG,EAAKj1G,GAAIqN,EAAOgD,IAGtB0E,EAAI,GAENogG,EAAItxG,QAAQ,EAAGkR,EAAI,GAAG,SAAU1E,EAAG+kG,GAEjCp/C,EAAaqC,YAAYhoD,EAAGukG,EAAS58D,EAAQ68D,GAAM,SAAU70G,EAAGq1G,GAE1Dr1G,EAAIqQ,GAEN8kG,EAAIx5B,WAAW37E,EAAG68D,EAAW4E,EAAe4zC,EAAKD,WAMzD,IAlD4BjoG,EAAGyK,EAEzB0gD,EACAC,EA+CF3nC,EAAK7b,EACLqgE,EAAM+/B,EAAIt0G,IAAIkU,GACd0/F,EAAQz+F,EAAIo/D,GAEhB+/B,EAAItxG,QAAQkR,EAAI,EAAGw9C,EAAO,GAAG,SAAUplD,EAAGkR,GAExC,IAAMq2F,EAAO1+F,EAAIqI,GAEbuuD,EAAO8nC,EAAMD,KAEf7jF,EAAKzjB,EAELsnG,EAAQC,EAERt/B,EAAM/2D,MAINtJ,IAAM6b,IAERolC,EAAahD,UAAUj+C,EAAG6b,EAAI0jF,EAAM,GAAIM,EAAS58D,EAAQ68D,GAEzD7+C,EAAahD,UAAUj+C,EAAG6b,EAAI4jF,EAAM,GAAIM,EAASC,EAAQC,GAEzDG,EAAIr5B,KAAK/mE,EAAG6b,GA1EiBhZ,EA4EdgZ,EA1EX0nC,EAAK48C,EAFiB/nG,EA4Ed4H,GAzERwjD,EAAK28C,EAAKt9F,GAEhBq9F,EAAK38C,GAAM1gD,EACXq9F,EAAK18C,GAAMprD,EAEX+nG,EAAK/nG,GAAKorD,EACV28C,EAAKt9F,GAAK0gD,GAsEV68C,EAAItxG,QAAQ,EAAG0uD,EAAO,GAAG,SAAUplD,EAAGkR,GAEhClR,GAAK4H,GAEP+/F,EAAQz5F,KAAKgD,GACb02F,EAAO15F,KAAKlO,KAGZkR,EAAI21D,EAAa31D,EAAG+2D,GAEfrf,EAAY13C,EAAG,KAElBu2F,EAAQv5F,KAAKgD,GACb25B,EAAO38B,KAAKlO,SAhFpB,IAAK4H,EAAI,EAAGA,EAAI09C,EAAS19C,IAAK,IA0F9B,OAJAigG,EAAK35F,KAAKy5F,EAAQrxG,QAClBoxG,EAAKx5F,KAAKu5F,EAAQnxG,QAGX,CACLwyE,EAAG,IAAIjgB,EAAa,CAClB3oD,OAAQunG,EACRpnG,MAAOwqC,EACPme,IAAK0+C,EACLvlE,KAAMglE,IAERF,EAAG,IAAIp+C,EAAa,CAClB3oD,OAAQynG,EACRtnG,MAAOunG,EACP5+C,IAAK6+C,EACL1lE,KAAMklE,IAER1yG,EAAGmzG,EACH/yG,SAAU,WACR,MAAO,MAAQtC,KAAKq2E,EAAE/zE,WAAa,QAAUtC,KAAKw0G,EAAElyG,WAAa,QAAUtC,KAAKkC,QChX3EwzG,GAA2B/1G,GAnB3B,KACQ,CACnB,QACA,SACA,QACA,WACA,SACA,QACA,OACA,OACA,OACA,aACA,YACA,eACA,iBACA,WACA,YAGkE,YAkB/D,IAhBDmiC,EAgBC,EAhBDA,MACAutB,EAeC,EAfDA,OACAzH,EAcC,EAdDA,MACA8rB,EAaC,EAbDA,SACArsD,EAYC,EAZDA,OACAw9C,EAWC,EAXDA,MACAv1C,EAUC,EAVDA,KACA5X,EASC,EATDA,KACAm5D,EAQC,EARDA,KACA5T,EAOC,EAPDA,WACA2E,EAMC,EANDA,UACAwS,EAKC,EALDA,aACAvS,EAIC,EAJDA,eACArzC,EAGC,EAHDA,SACA01C,EAEC,EAFDA,QA8CF,OAAO,KAAcpiC,EAjFV,KAiFsB,CAE/BktB,YAAa,SAAUxuD,GACrB,OAAOm1G,EAASn1G,IAGlB41D,aAAc,SAAU51D,GACtB,OAyKJ,SAAoBA,GAClB,MAAM,IAAIod,MAAM,8CA1KPg4F,IAGT1lG,MAAO,SAAU+F,GAEf,IAEM/U,EAAIy0G,EAFAtmD,EAAOp5C,IAIjB,MAAO,CACLq7D,EAAGpwE,EAAEowE,EAAE5zD,UACPpX,EAAGpF,EAAEoF,EAAEoX,cAGT,CAAEm4F,iBAEN,SAASA,EAAcr1G,GAErB,IAUIJ,EAAG+U,EAAG1E,EAVJkiD,EAAOnyD,EAAE4wD,MAAM,GACfka,EAAO9qE,EAAE4wD,MAAM,GAEfkgB,EAAIoC,EAAS,CAAC/gB,GAAO,SACrBmjD,EAAQxkC,EAAEngB,MAEV7qD,EAAI9F,EAAEsxB,QACNikF,EAAQzvG,EAAE6qD,MAKV9rC,EAAIuiC,EAAM,CAAC+K,GAAO,IAExB,IAAKliD,EAAI,EAAGA,EAAIhO,KAAKyQ,IAAIo4D,EAAM3Y,KAASliD,EAAG,CAyBzC,IAAMsoE,EAAQg9B,EAAMtlG,GAAGA,GACjBulG,EAAM/4C,EAAW4H,EAAMkU,EAAO,GAAK,EAAIzpD,EAAKypD,IAC5Ck9B,EAAUplC,EAAKmlC,GAEjBE,EAAe,EAEnB,IAAK91G,EAAIqQ,EAAGrQ,EAAIuyD,EAAMvyD,IACpB81G,EAAet0C,EAAUs0C,EAAcr0C,EAAek0C,EAAM31G,GAAGqQ,GAAIogE,EAAKklC,EAAM31G,GAAGqQ,MAGnF,IAAM2yF,EAAQvhC,EAAem0C,EAAKt+F,EAAKw+F,IAEvC,IAAK7uF,EAAO+7E,GAAQ,CAElB,IAAM+S,EAAK3nF,EAASuqD,EAAOqqB,GAK3B,IAFA/9E,EAAE5U,GAAK,EAEFrQ,EAAIqQ,EAAI,EAAGrQ,EAAIuyD,EAAMvyD,IACxBilB,EAAEjlB,GAAKg0E,EAAa2hC,EAAM31G,GAAGqQ,GAAI0lG,GAInC,IAAM3Q,EAAMvoC,EAAW4T,EAAKuD,EAAa+hC,EAAI/S,KAEzCjhG,OAAC,EAcL,IAAKgT,EAAI1E,EAAG0E,EAAIm2D,EAAMn2D,IAAK,CAIzB,IAHAhT,EAAI,EAGC/B,EAAIqQ,EAAGrQ,EAAIuyD,EAAMvyD,IACpB+B,EAAIy/D,EAAUz/D,EAAG0/D,EAAegP,EAAKxrD,EAAEjlB,IAAK21G,EAAM31G,GAAG+U,KAMvD,IAFAhT,EAAI0/D,EAAe1/D,EAAGqjG,GAEjBplG,EAAIqQ,EAAGrQ,EAAIuyD,EAAMvyD,IACpB21G,EAAM31G,GAAG+U,GAAK0sD,EACZrzC,EAASunF,EAAM31G,GAAG+U,GAAI0sD,EAAex8C,EAAEjlB,GAAI+B,IAC3C8zG,GAWN,IAAK71G,EAAI,EAAGA,EAAIuyD,EAAMvyD,IAAK,CAIzB,IAHA+B,EAAI,EAGCgT,EAAI1E,EAAG0E,EAAIw9C,EAAMx9C,IACpBhT,EAAIy/D,EAAUz/D,EAAG0/D,EAAei0C,EAAM11G,GAAG+U,GAAIkQ,EAAElQ,KAMjD,IAFAhT,EAAI0/D,EAAe1/D,EAAGqjG,GAEjBrwF,EAAI1E,EAAG0E,EAAIw9C,IAAQx9C,EACtB2gG,EAAM11G,GAAG+U,GAAKi/D,EACZ5lD,EAASsnF,EAAM11G,GAAG+U,GAAI0sD,EAAe1/D,EAAG0uE,EAAKxrD,EAAElQ,MAC/C8gG,KAQV,MAAO,CACL3kC,EAAGA,EACHhrE,EAAGA,EACHhE,SAAU,WACR,MAAO,MAAQtC,KAAKsxE,EAAEhvE,WAAa,QAAUtC,KAAKsG,EAAEhE,aAK1D,SAASqzG,EAAUn1G,GACjB,IAAM2Y,EAAM08F,EAAar1G,GACnBu1G,EAAQ58F,EAAI7S,EAAE6qD,MACpB,GAAI3wD,EAAE2wD,MAAMttD,OAAS,EAGnB,IAFA,IAAM2yD,EAA4B,YAArBu/C,EAAM,GAAG,GAAGjpG,KAAqBo3D,EAAQ,GAAK,EAElD9jE,EAAI,EAAGA,EAAI21G,EAAMlyG,SAAUzD,EAClC,IAAK,IAAI+U,EAAI,EAAGA,EAAI/U,GAAK+U,GAAK4gG,EAAM,IAAM,IAAIlyG,SAAUsR,EACtD4gG,EAAM31G,GAAG+U,GAAKqhD,EAKpB,OAAOr9C,MCnPJ,SAASi9F,GAAQjhG,EAAG1E,EAAG4U,EAAGk1B,EAAMn6B,EAAMs0B,EAAM8U,GAEjD,IAAIgO,EAAM,EAIV,IAFAnyC,EAAEmkC,GAASr0C,EAEJqiD,GAAO,GAAG,CAEf,IAAMt1D,EAAImjB,EAAEmkC,EAAQgO,GAEdp3D,EAAIilB,EAAEk1B,EAAOr4C,IACR,IAAP9B,GAEFo3D,IAEA9iB,EAAKjkC,KAAOvO,IAGZmjB,EAAEk1B,EAAOr4C,GAAKmjB,EAAEjF,EAAOhgB,GAIvBilB,EAAEmkC,KAFAgO,GAEep3D,GAGrB,OAAOqQ,EC/BF,SAAS4lG,GAAQj2G,GAEtB,OAAQA,EAAI,ECJd,IAOak2G,GAA8B32G,GAP9B,QACQ,CACnB,MACA,WACA,cAGqE,YAAkC,IAA/BsN,EAA+B,EAA/BA,IAAKqjC,EAA0B,EAA1BA,SAAUsgC,EAAgB,EAAhBA,UAYvF,OAAO,SAAgB0I,EAAOrjE,GAE5B,IAAKA,GAAKqjE,GAAS,GAAKA,EAAQ,EAAK,OAAO,KAE5C,IAAM/b,EAAQtnD,EAAEm7C,MAEV5wD,EAAI+8D,EAAM,GACV17D,EAAI07D,EAAM,GAEZg5C,EAAQ,EAERC,EAAQ/zG,KAAK0N,IAAI,GAAI,GAAK1N,KAAKiV,KAAK7V,IAGlC40G,EAyWR,SAA8Bn9B,EAAOrjE,EAAGzV,EAAGqB,EAAG20G,GAE5C,IAAME,EAAK9lC,EAAU36D,GAGrB,GAAc,IAAVqjE,GAAez3E,IAAMrB,EAEvB,OAAOyM,EAAIgJ,EAAGygG,GAIhB,GAAc,IAAVp9B,EAAa,CAOf,IALA,IAAMq9B,EAASD,EAAG/hD,OACZiiD,EAAOF,EAAG7hD,KAEZ9hC,EAAK,EAEA5d,EAAI,EAAGA,EAAI3U,EAAG2U,IAAK,CAE1B,IAAIjT,EAAI00G,EAAKzhG,GAIb,GAFAyhG,EAAKzhG,GAAK4d,IAEN6jF,EAAKzhG,EAAI,GAAKjT,EAAIs0G,GAEtB,IAAK,IAAM1jF,EAAK8jF,EAAKzhG,EAAI,GAAIjT,EAAI4wB,EAAI5wB,IAAOy0G,EAAO5jF,KAAQ4jF,EAAOz0G,GAOpE,OAJA00G,EAAKp2G,GAAKuyB,EAEV9c,EAAI26D,EAAU8lC,GAEPpmE,EAASomE,EAAIzgG,GAItB,OAAOq6B,EAASomE,EAAIzgG,GA9YT4gG,CAAoBv9B,EAAOrjE,EAAGzV,EAAGqB,EAF5C20G,EAAQ/zG,KAAKyQ,IAAIrR,EAAI,EAAG20G,KCrBrB,SAAkBvgG,EAAGu0B,EAAU60C,GAWpC,IATA,IAAM7qB,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KAGThzD,EAFQoU,EAAEm7C,MAEA,GAEZ0lD,EAAK,EAEA3hG,EAAI,EAAGA,EAAItT,EAAGsT,IAAK,CAE1B,IAAIjT,EAAI0yD,EAAKz/C,GAGb,IADAy/C,EAAKz/C,GAAK2hG,EACH50G,EAAI0yD,EAAKz/C,EAAI,GAAIjT,IAElBsoC,EAASkqB,EAAOxyD,GAAIiT,EAAGq/C,EAAUA,EAAQtyD,GAAK,EAAGm9E,KAEnD3qB,EAAOoiD,GAAMpiD,EAAOxyD,GAEhBsyD,IAAWA,EAAQsiD,GAAMtiD,EAAQtyD,IAErC40G,KAKNliD,EAAK/yD,GAAKi1G,EAEVpiD,EAAOvhD,OAAO2jG,EAAIpiD,EAAO7wD,OAASizG,GAE9BtiD,GAAWA,EAAQrhD,OAAO2jG,EAAItiD,EAAQ3wD,OAASizG,GDRjDC,CAAQN,EAAIhtC,EAAO,MAsCnB,IApCA,IAiCIrpE,EAAG+U,EAAG1E,EAAG8jD,EAAIyiD,EAAIv0F,EAAGw0F,EAAIltF,EAAImtF,EAAKC,EAAIC,EAAKtkF,EAAIC,EAAIskF,EAAIl2D,EAAGzgD,EAjCvDyzD,EAASsiD,EAAG9hD,OACZiJ,EAAO64C,EAAG5hD,KAGZyiD,EAAM15C,EAAK/7D,GAGTgQ,EAAI,GAGJ8tE,EAAI,GAEJ43B,EAAK11G,EAAI,EACTue,EAAO,GAAKve,EAAI,GAChB04C,EAAO,GAAK14C,EAAI,GAChB21G,EAAO,GAAK31G,EAAI,GAChBi5E,EAAS,GAAKj5E,EAAI,GAClBwjB,EAAI,GAAKxjB,EAAI,GACb41G,EAAQ,GAAK51G,EAAI,GAGjB6hC,EAAO7xB,EAGTotC,EA6XN,SAAmCp9C,EAAG+7D,EAAM+hB,EAAGtuE,EAAKkpC,EAAM7W,EAAMtjB,EAAMq3F,EAAOF,EAAIlyF,EAAGmyF,EAAM18B,GAExF,IAAK,IAAIrqE,EAAI,EAAGA,EAAI5O,EAAG4O,IAAOkvE,EAAEtuE,EAAMZ,GAAKmtD,EAAKntD,EAAI,GAAKmtD,EAAKntD,GAC9DkvE,EAAEtuE,EAAMxP,GAAK,EAEb,IAAK,IAAIzB,EAAI,EAAGA,GAAKyB,EAAGzB,IAEtBu/E,EAAEplC,EAAOn6C,IAAM,EACfsjC,EAAKtjC,IAAM,EACXu/E,EAAEv/D,EAAOhgB,IAAM,EAEfu/E,EAAE83B,EAAQr3G,IAAM,EAEhBu/E,EAAE43B,EAAKn3G,GAAK,EAEZu/E,EAAEt6D,EAAIjlB,GAAK,EAEXu/E,EAAE63B,EAAOp3G,GAAK,EAEdu/E,EAAE7E,EAAS16E,GAAKu/E,EAAEtuE,EAAMjR,GAG1B,IAAM6+C,EAAOy4D,EAAQ,EAAG,EAAG/3B,EAAGt6D,EAAGxjB,GAQjC,OANA89E,EAAE63B,EAAO31G,IAAM,EAEf+7D,EAAK/7D,IAAM,EAEX89E,EAAEt6D,EAAIxjB,GAAK,EAEJo9C,EA3ZI04D,CAAyB91G,EAAG+7D,EAAM+hB,EAbjC,EAayCplC,EAAM7W,EAAMtjB,EAAMq3F,EAAOF,EAAIlyF,EAAGmyF,EAAM18B,GAGvF88B,EAgaN,SAAiC/1G,EAAG+7D,EAAM+hB,EAAG7E,EAAQ08B,EAAMnyF,EAAGmxF,EAAOe,EAAIh9D,EAAM7W,EAAMtjB,GAInF,IAFA,IAAIw3F,EAAM,EAEDx3G,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK,CAE1B,IAAMM,EAAIi/E,EAAE7E,EAAS16E,GAErB,GAAU,IAANM,EAEFi/E,EAAE63B,EAAOp3G,IAAM,EACfw3G,IAEAh6C,EAAKx9D,IAAM,EACXu/E,EAAEt6D,EAAIjlB,GAAK,OACN,GAAIM,EAAI81G,EAEb72B,EAAE43B,EAAKn3G,GAAK,EAEZu/E,EAAE63B,EAAOp3G,IAAM,EACfw3G,IACAh6C,EAAKx9D,GAAKi2G,GAAOx0G,GACjB89E,EAAE43B,EAAK11G,SACF,CACL,IAAMs/C,EAAIw+B,EAAEplC,EAAO75C,IACR,IAAPygD,IAAYzd,EAAKyd,GAAK/gD,GAE1Bu/E,EAAEv/D,EAAOhgB,GAAKu/E,EAAEplC,EAAO75C,GACvBi/E,EAAEplC,EAAO75C,GAAKN,GAGlB,OAAOw3G,EA/bGC,CAAuBh2G,EAAG+7D,EAAM+hB,EAAG7E,EAAQ08B,EAAMnyF,EAAGmxF,EAAOe,EAAIh9D,EAAM7W,EAAMtjB,GAGjF03F,EAAS,EAMNF,EAAM/1G,GAAG,CAId,IAAK4O,GAAK,EAAGqnG,EAASj2G,IAAiC,KAA3B4O,EAAIkvE,EAAEplC,EAAOu9D,IAAiBA,MACrC,IAAjBn4B,EAAEv/D,EAAO3P,KAAaizB,EAAKi8C,EAAEv/D,EAAO3P,KAAO,GAE/CkvE,EAAEplC,EAAOu9D,GAAUn4B,EAAEv/D,EAAO3P,GAE5B,IAAMsnG,EAAQp4B,EAAE63B,EAAO/mG,GAEnBunG,EAAMr4B,EAAE43B,EAAK9mG,GAEjBmnG,GAAOI,EAKP,IAAIC,EAAK,EAETt4B,EAAE43B,EAAK9mG,IAAMunG,EACb,IAAI91G,EAAI07D,EAAKntD,GAEPynG,EAAiB,IAAVH,EAAe71G,EAAIo1G,EAC5Ba,EAAMD,EACV,IAAK3jD,EAAK,EAAGA,GAAMwjD,EAAQ,EAAGxjD,IAAM,CAelC,IAdIA,EAAKwjD,GAEPt1F,EAAIhS,EAEJwmG,EAAK/0G,EAEL6nB,EAAK41D,EAzDC,EAyDOlvE,GAAKsnG,IAIlBd,EAAKr5C,EADLn7C,EAAI0xC,EAAOjyD,MAGX6nB,EAAK41D,EA/DC,EA+DOl9D,IAEVu0F,EAAK,EAAGA,GAAMjtF,EAAIitF,KAGhBE,EAAMv3B,EAAE43B,GAFbn3G,EAAI+zD,EAAO8iD,SAEc,IAEzBgB,GAAMf,EAENv3B,EAAE43B,EAAKn3G,IAAM82G,EAEb/iD,EAAOgkD,KAAS/3G,GACK,IAAjBu/E,EAAEv/D,EAAOhgB,KAAasjC,EAAKi8C,EAAEv/D,EAAOhgB,IAAMsjC,EAAKtjC,KAElC,IAAbsjC,EAAKtjC,GAAau/E,EAAEv/D,EAAOsjB,EAAKtjC,IAAMu/E,EAAEv/D,EAAOhgB,GAAYu/E,EAAEplC,EAAOolC,EAAE7E,EAAS16E,IAAMu/E,EAAEv/D,EAAOhgB,IAEhGqiB,IAAMhS,IAERmtD,EAAKn7C,GAAK4zF,GAAO5lG,GAEjBkvE,EAAEt6D,EAAI5C,GAAK,GAmBf,IAfc,IAAVs1F,IAAeT,EAAMa,GAEzBx4B,EAAE7E,EAASrqE,GAAKwnG,EAEhBr6C,EAAKntD,GAAKynG,EACVv4B,EA5FU,EA4FFlvE,GAAK0nG,EAAMD,EAEnBv4B,EAAE63B,EAAO/mG,IAAM,EAMfwuC,EAAOy4D,EAAQz4D,EAAMs3D,EAAO52B,EAAGt6D,EAAGxjB,GAE7Bs1G,EAAKe,EAAKf,EAAKgB,EAAKhB,IAGvB,MAAKC,EAAMz3B,EAAE63B,GAFbp3G,EAAI+zD,EAAOgjD,OAEgB,GAA3B,CAGA,IAAMiB,EAAOn5D,GADbi4D,GAAOv3B,EAAE43B,EAAKn3G,IAGd,IAAK8B,EAAI07D,EAAKx9D,GAAI0yB,EAAK8qC,EAAKx9D,GAAKg3G,EAAM,EAAGl1G,GAAK4wB,EAAI5wB,IAE7Cy9E,EAAEt6D,GADN5C,EAAI0xC,EAAOjyD,MACK+8C,EAEd0gC,EAAEt6D,EAAI5C,IAAMy0F,EACU,IAAbv3B,EAAEt6D,EAAI5C,KAEfk9D,EAAEt6D,EAAI5C,GAAKk9D,EAAE7E,EAASr4D,GAAK21F,GAUjC,IAAKjB,EAAKe,EAAKf,EAAKgB,EAAKhB,IAAM,CAO7B,IAHApkF,GADAD,EAAK8qC,EADLx9D,EAAI+zD,EAAOgjD,KAEDx3B,EAAE63B,EAAOp3G,GAAK,EACxBi3G,EAAKvkF,EAEAquB,EAAI,EAAGzgD,EAAI,EAAGwB,EAAI4wB,EAAI5wB,GAAK6wB,EAAI7wB,IAGlC,GAAiB,IAAby9E,EAAEt6D,GAFN5C,EAAI0xC,EAAOjyD,KAES,CAElB,IAAMm2G,EAAO14B,EAAEt6D,EAAI5C,GAAKw8B,EACpBo5D,EAAO,GAET33G,GAAK23G,EAELlkD,EAAOkjD,KAAQ50F,EAEf0+B,GAAK1+B,IAGLm7C,EAAKn7C,GAAK4zF,GAAO5lG,GAEjBkvE,EAAEt6D,EAAI5C,GAAK,GAKjBk9D,EAAE63B,EAAOp3G,GAAKi3G,EAAKvkF,EAAK,EACxB,IAAMwlF,EAAKjB,EACLkB,GAAKzlF,EAAK6sD,EA9JR,EA8JgBv/E,GAExB,IAAK8B,EAAI6wB,EAAK,EAAG7wB,EAAIq2G,GAAIr2G,IAAK,CAG5B,IAAMs2G,GAAM74B,EAAE43B,GAFdpiG,EAAIg/C,EAAOjyD,KAGPs2G,IAAO,IAEX93G,GAAK83G,GAELrkD,EAAOkjD,KAAQliG,EAEfgsC,GAAKhsC,GAGG,IAANzU,GAEFk9D,EAAKx9D,GAAKi2G,GAAO5lG,GAGjBwnG,GAFAf,GAAOv3B,EAAE43B,EAAKn3G,GAId43G,GAAOd,EACPU,GAAOV,EACPv3B,EAAE43B,EAAKn3G,GAAK,EAEZu/E,EAAE63B,EAAOp3G,IAAM,IAGfu/E,EAAE7E,EAAS16E,GAAKqC,KAAKyQ,IAAIysE,EAAE7E,EAAS16E,GAAIM,GAExCyzD,EAAOkjD,GAAMljD,EAAOmkD,GAEpBnkD,EAAOmkD,GAAMnkD,EAAOrhC,GAEpBqhC,EAAOrhC,GAAMriB,EAEbkvE,EAnMM,EAmMEv/E,GAAKi3G,EAAKvkF,EAAK,EAEvBquB,GAAKA,EAAI,GAAKA,EAAIA,GAAKt/C,EAEvB89E,EAAEv/D,EAAOhgB,GAAKu/E,EAAE83B,EAAQt2D,GACxBw+B,EAAE83B,EAAQt2D,GAAK/gD,EAEfsjC,EAAKtjC,GAAK+gD,GAWd,IAPAw+B,EAAE7E,EAASrqE,GAAKwnG,EAGhBh5D,EAAOy4D,EAAQz4D,GAFfs3D,EAAQ9zG,KAAK0N,IAAIomG,EAAO0B,IAEK1B,EAAO52B,EAAGt6D,EAAGxjB,GAIrCs1G,EAAKe,EAAKf,EAAKgB,EAAKhB,IAGvB,KAAIx3B,EAAE43B,GAFNn3G,EAAI+zD,EAAOgjD,MAEM,GAMjB,IAHA/2G,EAAIu/E,EAAE83B,GADNt2D,EAAIzd,EAAKtjC,KAGTu/E,EAAE83B,EAAQt2D,IAAM,GACF,IAAP/gD,IAA6B,IAAjBu/E,EAAEv/D,EAAOhgB,GAAWA,EAAIu/E,EAAEv/D,EAAOhgB,GAAI6+C,IAAQ,CAG9D,IAFAl1B,EAAK41D,EA/NC,EA+NOv/E,GACbg3G,EAAMz3B,EAAE63B,EAAOp3G,GACV8B,EAAI07D,EAAKx9D,GAAK,EAAG8B,GAAK07D,EAAKx9D,GAAK2pB,EAAK,EAAG7nB,IAAOy9E,EAAEt6D,EAAI8uC,EAAOjyD,IAAM+8C,EACvE,IAAIw5D,GAAQr4G,EAEZ,IAAK+U,EAAIwqE,EAAEv/D,EAAOhgB,IAAW,IAAP+U,GAAW,CAC/B,IAAIhK,GAAKw0E,EArOL,EAqOaxqE,KAAO4U,GAAM41D,EAAE63B,EAAOriG,KAAOiiG,EAC9C,IAAKl1G,EAAI07D,EAAKzoD,GAAK,EAAGhK,IAAMjJ,GAAK07D,EAAKzoD,GAAK4U,EAAK,EAAG7nB,IAE7Cy9E,EAAEt6D,EAAI8uC,EAAOjyD,MAAQ+8C,IAAQ9zC,GAAK,GAGpCA,IAEFyyD,EAAKzoD,GAAKkhG,GAAOj2G,GACjBu/E,EAAE43B,EAAKn3G,IAAMu/E,EAAE43B,EAAKpiG,GACpBwqE,EAAE43B,EAAKpiG,GAAK,EAEZwqE,EAAE63B,EAAOriG,IAAM,EAEfA,EAAIwqE,EAAEv/D,EAAOjL,GACbwqE,EAAEv/D,EAAOq4F,IAAStjG,IAGlBsjG,GAAQtjG,EACRA,EAAIwqE,EAAEv/D,EAAOjL,KAQrB,IAAKjT,EAAIg2G,EAAKf,EAAKe,EAAKf,EAAKgB,EAAKhB,KAG3BD,GAAOv3B,EAAE43B,GAFdn3G,EAAI+zD,EAAOgjD,OAEe,IAE1Bx3B,EAAE43B,EAAKn3G,GAAK82G,EAEZx2G,EAAIi/E,EAAE7E,EAAS16E,GAAK63G,EAAKf,GAEJ,IAAjBv3B,EAAEplC,GADN75C,EAAI+B,KAAKyQ,IAAIxS,EAAGmB,EAAI+1G,EAAMV,OACAxzE,EAAKi8C,EAAEplC,EAAO75C,IAAMN,GAE9Cu/E,EAAEv/D,EAAOhgB,GAAKu/E,EAAEplC,EAAO75C,GACvBgjC,EAAKtjC,IAAM,EACXu/E,EAAEplC,EAAO75C,GAAKN,EAEd03G,EAASr1G,KAAKyQ,IAAI4kG,EAAQp3G,GAC1Bi/E,EAAE7E,EAAS16E,GAAKM,EAEhByzD,EAAOjyD,KAAO9B,GAGhBu/E,EAAE43B,EAAK9mG,GAAKunG,EAEmB,IAA1Br4B,EAvRK,EAuRGlvE,GAAKvO,EAAIg2G,KAEpBt6C,EAAKntD,IAAM,EAEXkvE,EAAEt6D,EAAI5U,GAAK,GAEC,IAAVsnG,IAEFT,EAAMp1G,GAUV,IAAK9B,EAAI,EAAGA,EAAIyB,EAAGzB,IAAOw9D,EAAKx9D,GAAKi2G,GAAOz4C,EAAKx9D,IAChD,IAAK+U,EAAI,EAAGA,GAAKtT,EAAGsT,IAAOwqE,EAAEplC,EAAOplC,IAAM,EAE1C,IAAKA,EAAItT,EAAGsT,GAAK,EAAGA,IAEdwqE,EAAE43B,EAAKpiG,GAAK,IAEhBwqE,EAAEv/D,EAAOjL,GAAKwqE,EAAEplC,EAAOqjB,EAAKzoD,IAC5BwqE,EAAEplC,EAAOqjB,EAAKzoD,IAAMA,GAGtB,IAAKsN,EAAI5gB,EAAG4gB,GAAK,EAAGA,IAEdk9D,EAAE43B,EAAK90F,IAAM,IACA,IAAbm7C,EAAKn7C,KAEPk9D,EAAEv/D,EAAOqC,GAAKk9D,EAAEplC,EAAOqjB,EAAKn7C,IAC5Bk9D,EAAEplC,EAAOqjB,EAAKn7C,IAAMA,GAIxB,IAAKhS,EAAI,EAAGrQ,EAAI,EAAGA,GAAKyB,EAAGzB,KACR,IAAbw9D,EAAKx9D,KAAaqQ,EAAI2lG,GAAOh2G,EAAGqQ,EAAGkvE,EAAGplC,EAAMn6B,EAAMvO,EAAGwT,IAK3D,OAFAxT,EAAEsB,OAAOtB,EAAEhO,OAAS,EAAG,GAEhBgO,GA8IT,SAAS6lG,EAASz4D,EAAMs3D,EAAO52B,EAAGt6D,EAAGxjB,GACnC,GAAIo9C,EAAO,GAAMA,EAAOs3D,EAAQ,EAAI,CAClC,IAAK,IAAI9lG,EAAI,EAAGA,EAAI5O,EAAG4O,IACJ,IAAbkvE,EAAEt6D,EAAI5U,KAAYkvE,EAAEt6D,EAAI5U,GAAK,GAEnCwuC,EAAO,EAGT,OAAOA,EAGT,SAASwqB,EAAOrpE,EAAG+U,GACjB,OAAO/U,IAAM+U,MEngBV,SAASujG,GAAQt4G,EAAG+U,EAAGkQ,EAAG7Q,EAAOmkG,EAAUC,EAAUC,GAC1D,IAAI12G,EAAG22G,EAIHt2F,EADAu2F,EAAQ,EAIZ,GAAI34G,GAAK+U,GAAKkQ,EAAE7Q,EAAQW,IAAMkQ,EAAEszF,EAAWv4G,GAAM,OAAS,EAE1DilB,EAAEszF,EAAWv4G,GAAKilB,EAAE7Q,EAAQW,GAE5B,IAAM6jG,EAAQ3zF,EAAEuzF,EAAWx4G,GAI3B,GAHAilB,EAAEuzF,EAAWx4G,GAAK+U,GAGH,IAAX6jG,EAEFD,EAAQ,EACRv2F,EAAIpiB,MACC,CAIL,IAFA24G,EAAQ,EAEHv2F,EAAIw2F,EAAOx2F,IAAM6C,EAAEwzF,EAAWr2F,GAAIA,EAAI6C,EAAEwzF,EAAWr2F,IACxD,IAAKrgB,EAAI62G,EAAO72G,IAAMqgB,EAAGrgB,EAAI22G,EAE3BA,EAAUzzF,EAAEwzF,EAAW12G,GACvBkjB,EAAEwzF,EAAW12G,GAAKqgB,EAGtB,MAAO,CACLu2F,MAAOA,EACPv2F,EAAGA,GC9CP,IAKay2F,GAAiCt5G,GALjC,WACQ,CACnB,cAGwE,YAAmB,IAAhBixE,EAAgB,EAAhBA,UAa3E,OAAO,SAAU36D,EAAG1J,EAAQmoC,EAAMwkE,GAEhC,IAAKjjG,IAAM1J,IAAWmoC,EAAQ,OAAO,KAErC,IAKIt0C,EAAG+U,EAAG1E,EAAGmjD,EAAG1xD,EAAGshE,EAAI1wC,EALjByqC,EAAQtnD,EAAEm7C,MAEV5wD,EAAI+8D,EAAM,GACV17D,EAAI07D,EAAM,GAKVp7D,EAAI,EAAIN,GAAKq3G,EAAOr3G,EAAIrB,EAAI,EAAK,GAEjC6kB,EAAI,GAEJszF,EAAW92G,EACX+2G,EAAW,EAAI/2G,EACf2S,EAAQ,EAAI3S,EACZ04C,EAAO,EAAI14C,EACXue,EAAO,EAAIve,EAAI,EAErB,IAAK4O,EAAI,EAAGA,EAAItO,EAAGsO,IAAO4U,EAAE5U,IAAM,EAGlC,IAAM0oG,EAAW,GAGXzC,EAAK9lC,EAAU36D,GAEf0gG,EAASD,EAAG/hD,OACZiiD,EAAOF,EAAG7hD,KAGhB,IAAKpkD,EAAI,EAAGA,EAAI5O,EAAG4O,IAIjB,IADA0oG,EAFAhkG,EAAIu/B,EAAKjkC,KAEwB,IAAlB4U,EAAE7Q,EAAQW,GAAa,EAAI,GAC5B,IAAPA,IAA8B,IAAlBkQ,EAAE7Q,EAAQW,GAAWA,EAAI5I,EAAO4I,GAAMkQ,EAAE7Q,EAAQW,GAAK1E,EAI1E,GAAIyoG,EAAK,CAEP,IAAKzoG,EAAI,EAAGA,EAAI5O,EAAG4O,IAAO4U,EAAEqvB,EAAKjkC,IAAMA,EAEvC,IAAKrQ,EAAI,EAAGA,EAAII,EAAGJ,IAAK,CAEtB,IAAKqQ,EAAI5O,EAAG2hE,EAAKozC,EAAKx2G,GAAI0yB,EAAK8jF,EAAKx2G,EAAI,GAAI8B,EAAIshE,EAAIthE,EAAI4wB,EAAI5wB,IAAOuO,EAAIhO,KAAKyQ,IAAIzC,EAAG4U,EAAEsxF,EAAOz0G,KAE5FmjB,EAAEjF,EAAOhgB,GAAKilB,EAAEk1B,EAAO9pC,GACvB4U,EAAEk1B,EAAO9pC,GAAKrQ,GAKlB,IAAKA,EAAI,EAAGA,EAAIyB,EAAGzB,IAAOilB,EAzCT,EAyCsBjlB,GAAKA,EAE5C,IAAKqQ,EAAI,EAAGA,EAAI5O,EAAG4O,IAAK,CAOtB,KAHmB,IAAflE,EAFJ4I,EAAIu/B,EAAKjkC,KAEe0oG,EAAS5sG,EAAO4I,MAGnCy+C,EAAKslD,EAAM7zF,EAAEk1B,EAAO9pC,GAAK0E,GAAW,IAAPy+C,EAAUA,EAAKslD,EAAM7zF,EAAEjF,EAAOwzC,IAAM,EACpE,IAAK1xD,EAAI00G,EAAKhjD,GAAI1xD,EAAI00G,EAAKhjD,EAAI,GAAI1xD,IAAK,CAEtC,IAAMhB,EAAIw3G,GADVt4G,EAAIu2G,EAAOz0G,GACSiT,EAAGkQ,EAAG7Q,EAAOmkG,EAAUC,EArDhC,GAuDP13G,EAAE63G,OAAS,GAAKI,EAAShkG,KAEb,IAAZjU,EAAE63G,OAAeI,EAASj4G,EAAEshB,MAGjB,IAAfjW,EAAO4I,KAAakQ,EA5DT,EA4DsBlQ,GAAK5I,EAAO4I,IAGnD,IAAKA,EAAI,EAAGA,EAAItT,EAAGsT,KACE,IAAf5I,EAAO4I,KAAagkG,EAAS5sG,EAAO4I,KAAOgkG,EAAShkG,IAE1D,OAAOgkG,MCxFEC,GAA8Bz5G,GAP9B,QACQ,CACnB,MACA,WACA,cAGqE,YAAkC,IAA/BsN,EAA+B,EAA/BA,IAAKqjC,EAA0B,EAA1BA,SAAUsgC,EAAgB,EAAhBA,UACjFyoC,EAAQ/C,GAAY,CAAErpG,MAAKqjC,WAAUsgC,cACrC0oC,EAAWL,GAAe,CAAEroC,cAclC,OAAO,SAAgB0I,EAAOrjE,EAAGsjG,GAE/B,IAKI9oG,EALEmkD,EAAO3+C,EAAE4+C,KAGThzD,EAFQoU,EAAEm7C,MAEA,GAIVjvD,EAAI,GAIV,GAFAA,EAAEqgB,EAAI62F,EAAM//B,EAAOrjE,GAEfqjE,IAAUn3E,EAAEqgB,EAAK,OAAO,KAE5B,GAAI+2F,EAAI,CAEN,IAAM94G,EAAI64E,ECnCT,SAAoBrjE,EAAGujG,EAAMh3F,EAAG/U,GAiBrC,IAfA,IAAM+mD,EAAUv+C,EAAEw+C,QACZC,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT0I,EAAQtnD,EAAEm7C,MACVoM,EAAMvnD,EAAEo7C,UAER7wD,EAAI+8D,EAAM,GACV17D,EAAI07D,EAAM,GAEVI,EAAUlwD,GAAUwI,EAAEw+C,QAAU,GAAK,KACrCN,EAAS,GACTyJ,EAAO,GAETk5C,EAAK,EAEArmG,EAAI,EAAGA,EAAI5O,EAAG4O,IAAK,CAE1BmtD,EAAKntD,GAAKqmG,EAIV,IAFA,IAAM3hG,EAAIqN,EAAKA,EAAE/R,GAAMA,EAEdgpG,EAAK7kD,EAAKz/C,GAAI8C,EAAK28C,EAAKz/C,EAAI,GAAI7T,EAAIm4G,EAAIn4G,EAAI2W,EAAI3W,IAAK,CAE5D,IAAMJ,EAAIs4G,EAAOA,EAAK9kD,EAAOpzD,IAAMozD,EAAOpzD,GAE1C6yD,EAAO2iD,GAAM51G,EAETy8D,IAAWA,EAAQm5C,GAAMtiD,EAAQlzD,IAErCw1G,KAMJ,OAFAl5C,EAAK/7D,GAAKi1G,EAEH7gG,EAAE4hD,mBAAmB,CAC1BpqD,OAAQkwD,EACR/vD,MAAOumD,EACPoC,IAAKqH,EACLluB,KAAM,CAAClvC,EAAGqB,GACVkvD,SAAUyM,IDPUk8C,CAAUzjG,EAAG,KAAM9T,EAAEqgB,EAAG,GAAKvM,EAE/C9T,EAAEoK,OExCD,SAAkB0J,EAAGijG,GAE1B,IAAKjjG,EAAK,OAAO,KAEjB,IAeI7V,EAAGu5G,EAfDjlD,EAASz+C,EAAE0+C,OACXC,EAAO3+C,EAAE4+C,KACT0I,EAAQtnD,EAAEm7C,MAEV5wD,EAAI+8D,EAAM,GACV17D,EAAI07D,EAAM,GAGVhxD,EAAS,GAGT8Y,EAAI,GAEJlF,EAAOte,EAKb,GAAIq3G,EAEF,IAAK94G,EAAI,EAAGA,EAAII,EAAGJ,IAAOilB,EAAElF,EAAO/f,IAAM,EAG3C,IAAK,IAAIqQ,EAAI,EAAGA,EAAI5O,EAAG4O,IAAK,CAE1BlE,EAAOkE,IAAM,EAEb4U,EAfe,EAeF5U,IAAM,EAEnB,IAAK,IAAI+yD,EAAK5O,EAAKnkD,GAAIqiB,EAAK8hC,EAAKnkD,EAAI,GAAIvO,EAAIshE,EAAIthE,EAAI4wB,EAAI5wB,IAAK,CAE5D,IAAMhB,EAAIwzD,EAAOxyD,GAIjB,IAFA9B,EAAI84G,EAAO7zF,EAAElF,EAAOjf,GAAMA,GAEZ,IAAPd,GAAYA,EAAIqQ,EAAGrQ,EAAIu5G,EAE5BA,EAAQt0F,EAzBG,EAyBUjlB,GAErBilB,EA3BW,EA2BEjlB,GAAKqQ,GAEH,IAAXkpG,IAAgBptG,EAAOnM,GAAKqQ,GAE9ByoG,IAAO7zF,EAAElF,EAAOjf,GAAKuP,IAG7B,OAAOlE,EFVQqtG,CAAQn5G,EAAG,GAEtB,IAAMi0C,EGzCL,SAAiBnoC,EAAQ1K,GAE9B,IAAK0K,EAAU,OAAO,KAEtB,IACI4I,EADA1E,EAAI,EAGFikC,EAAO,GAEPrvB,EAAI,GAEJjF,EAAOve,EACP2nD,EAAQ,EAAI3nD,EAElB,IAAKsT,EAAI,EAAGA,EAAItT,EAAGsT,IAEjBkQ,EANW,EAMFlQ,IAAM,EAGjB,IAAKA,EAAItT,EAAI,EAAGsT,GAAK,EAAGA,KAEH,IAAf5I,EAAO4I,KAEXkQ,EAAEjF,EAAOjL,GAAKkQ,EAbH,EAaY9Y,EAAO4I,IAC9BkQ,EAdW,EAcF9Y,EAAO4I,IAAMA,GAGxB,IAAKA,EAAI,EAAGA,EAAItT,EAAGsT,KAEE,IAAf5I,EAAO4I,KAEX1E,EAAI2lG,GAAOjhG,EAAG1E,EAAG4U,EArBN,EAqBejF,EAAMs0B,EAAM8U,IAExC,OAAO9U,EHQUmlE,CAAO13G,EAAEoK,OAAQ1K,GAI9B,GAFAM,EAAEunF,GAAK4vB,EAAS74G,EAAG0B,EAAEoK,OAAQmoC,EAAM,GAE/Bj0C,GAAK0B,EAAEoK,QAAUpK,EAAEunF,IAgB3B,SAAkBzzE,EAAG9T,GAEnB,IAAMyyD,EAAO3+C,EAAE4+C,KACTH,EAASz+C,EAAE0+C,OACX4I,EAAQtnD,EAAEm7C,MAEV5wD,EAAI+8D,EAAM,GACV17D,EAAI07D,EAAM,GAEhBp7D,EAAEq3G,KAAO,GACTr3G,EAAE23G,SAAW,GAEb,IAUI15G,EAAGqQ,EAAGvO,EAAGshE,EAAI1wC,EAVXvmB,EAASpK,EAAEoK,OACXitG,EAAOr3G,EAAEq3G,KACTM,EAAW33G,EAAE23G,SAEbz0F,EAAI,GAEJk1B,EAAO/5C,EACP+6C,EAAO/6C,EAAIqB,EACXk4G,EAAOv5G,EAAI,EAAIqB,EAIrB,IAAK4O,EAAI,EAAGA,EAAI5O,EAAG4O,IAEjB4U,EAAEk1B,EAAO9pC,IAAM,EACf4U,EAAEk2B,EAAO9qC,IAAM,EACf4U,EAAE00F,EAAOtpG,GAAK,EAGhB,IAAKrQ,EAAI,EAAGA,EAAII,EAAGJ,IAAO05G,EAAS15G,IAAM,EAEzC,IAAKqQ,EAAI5O,EAAI,EAAG4O,GAAK,EAAGA,IAEtB,IAAK+yD,EAAK5O,EAAKnkD,GAAIqiB,EAAK8hC,EAAKnkD,EAAI,GAAIvO,EAAIshE,EAAIthE,EAAI4wB,EAAI5wB,IAEnD43G,EAASplD,EAAOxyD,IAAMuO,EAI1B,IAAKrQ,EAAII,EAAI,EAAGJ,GAAK,EAAGA,IAEtBo5G,EAAKp5G,IAAM,GAGA,KAFXqQ,EAAIqpG,EAAS15G,MAIS,GAAlBilB,EAAE00F,EAAOtpG,OAAc4U,EAAEk2B,EAAO9qC,GAAKrQ,GAEzCilB,EAjCW,EAiCFjlB,GAAKilB,EAAEk1B,EAAO9pC,GACvB4U,EAAEk1B,EAAO9pC,GAAKrQ,GAKhB,IAHA+B,EAAE63G,IAAM,EACR73G,EAAEqlF,GAAKhnF,EAEFiQ,EAAI,EAAGA,EAAI5O,EAAG4O,IAUjB,GARArQ,EAAIilB,EAAEk1B,EAAO9pC,GAEbtO,EAAE63G,MAEE55G,EAAI,IAAKA,EAAI+B,EAAEqlF,MAEnBgyB,EAAKp5G,GAAKqQ,MAEJspG,EAAKtpG,IAAM,GAAjB,CAEAtO,EAAE63G,KAAO30F,EAAE00F,EAAOtpG,GAElB,IAAMwpG,EAAK1tG,EAAOkE,IACN,IAARwpG,IACmB,IAAjB50F,EAAE00F,EAAOE,KAAa50F,EAAEk2B,EAAO0+D,GAAM50F,EAAEk2B,EAAO9qC,IAClD4U,EAxDS,EAwDAA,EAAEk2B,EAAO9qC,IAAM4U,EAAEk1B,EAAO0/D,GACjC50F,EAAEk1B,EAAO0/D,GAAM50F,EAzDN,EAyDejlB,GACxBilB,EAAE00F,EAAOE,IAAO50F,EAAE00F,EAAOtpG,IAG7B,IAAKrQ,EAAI,EAAGA,EAAII,EAAGJ,IACbo5G,EAAKp5G,GAAK,IAAKo5G,EAAKp5G,GAAKqQ,KAE/B,OAAO,EAjGwBypG,CAAQz5G,EAAG0B,GAEtC,IAAKA,EAAEg4G,IAAM,EAAG1pG,EAAI,EAAGA,EAAI5O,EAAG4O,IAAOtO,EAAEg4G,KAAOh4G,EAAEunF,GAAGj5E,QAIrDtO,EAAEg4G,IAAM,EAAKvlD,EAAK/yD,GAAMA,EACxBM,EAAE63G,IAAM73G,EAAEg4G,IAGZ,OAAOh4G,MIzDJ,SAASi4G,GAAU/0F,EAAGlQ,GAE3B,OAAOkQ,EAAElQ,GAAK,ECAT,SAASklG,GAAQh1F,EAAGlQ,GAEzBkQ,EAAElQ,GAAKkhG,GAAOhxF,EAAElQ,ICHX,SAASmlG,GAAUl6G,GAExB,OAAOA,EAAI,EAAIi2G,GAAOj2G,GAAKA,ECStB,SAASm6G,GAAOplG,EAAGkiC,EAAGmgB,EAAKvoC,EAAIuqF,GAEpC,IAMIp5G,EAAG8B,EAAG6wB,EANJnlB,EAAQypC,EAAEsd,OACV4B,EAAMlf,EAAEwd,KAGRhzD,EAFOw1C,EAAE+Z,MAEA,GAIX7W,EAAO,EAIX,IAFAtrB,EAAG,GAAK9Z,EAEDolC,GAAQ,GAAG,CAEhBplC,EAAI8Z,EAAGsrB,GAEP,IAAMigE,EAAOhB,EAAOA,EAAKrkG,GAAKA,EAEzBilG,GAAS7jD,EAAKphD,KAEjBklG,GAAO9jD,EAAKphD,GAEZ8Z,EAAGptB,EAAI04C,GAAQigE,EAAO,EAAI,EAAIF,GAAS/jD,EAAIikD,KAG7C,IAAI9tG,EAAO,EAEX,IAAKxK,EAAI+sB,EAAGptB,EAAI04C,GAAOxnB,EAAKynF,EAAO,EAAI,EAAIF,GAAS/jD,EAAIikD,EAAO,IAAKt4G,EAAI6wB,EAAI7wB,IAI1E,IAAIk4G,GAAS7jD,EAFbn2D,EAAIwN,EAAM1L,IAEV,CAEA+sB,EAAGptB,EAAI04C,GAAQr4C,EAEf+sB,IAAKsrB,GAAQn6C,EAEbsM,EAAO,EAEP,MAGEA,IAEF6tC,IAEAtrB,IAAKuoC,GAAOriD,GAGhB,OAAOqiD,ECpET,IAOaijD,GAAkC96G,GAPlC,YACQ,CACnB,eACA,WACA,aAGyE,YAA0C,IAAvCy0E,EAAuC,EAAvCA,aAAc9jC,EAAyB,EAAzBA,SAAU9hB,EAAe,EAAfA,SAoBpG,OAAO,SAAoB6oB,EAAGnhC,EAAGzF,EAAGwe,EAAI1hB,EAAGisG,EAAMkB,GAE/C,IAWIx4G,EAAGshE,EAAI1wC,EAAItQ,EAXTm4F,EAAUtjE,EAAEod,QACZmmD,EAASvjE,EAAEsd,OACXkmD,EAAOxjE,EAAEwd,KAGThzD,EAFQw1C,EAAE+Z,MAEA,GAEV4N,EAAU9oD,EAAEu+C,QACZwK,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KAIT2C,ECzBH,SAAkBngB,EAAGnhC,EAAGzF,EAAGwe,EAAIuqF,GAEpC,IAQIt3G,EAAGshE,EAAI1wC,EARL+nF,EAAOxjE,EAAEwd,KACTimD,EAAQzjE,EAAE+Z,MAEV6N,EAAS/oD,EAAEy+C,OACXuK,EAAOhpD,EAAE2+C,KAEThzD,EAAIi5G,EAAM,GAIZtjD,EAAM31D,EAEV,IAAK2hE,EAAKtE,EAAKzuD,GAAIqiB,EAAKosC,EAAKzuD,EAAI,GAAIvO,EAAIshE,EAAIthE,EAAI4wB,EAAI5wB,IAAK,CAExD,IAAM9B,EAAI6+D,EAAO/8D,GAEZk4G,GAASS,EAAMz6G,KAElBo3D,EAAM+iD,GAAMn6G,EAAGi3C,EAAGmgB,EAAKvoC,EAAIuqF,IAI/B,IAAKt3G,EAAIs1D,EAAKt1D,EAAIL,EAAGK,IAEnBm4G,GAAOQ,EAAM5rF,EAAG/sB,IAElB,OAAOs1D,EDHOujD,CAAQ1jE,EAAGnhC,EAAGzF,EAAGwe,EAAIuqF,GAEjC,IAAKt3G,EAAIs1D,EAAKt1D,EAAIL,EAAGK,IAAOqL,EAAE0hB,EAAG/sB,IAAM,EAEvC,IAAKshE,EAAKtE,EAAKzuD,GAAIqiB,EAAKosC,EAAKzuD,EAAI,GAAIvO,EAAIshE,EAAIthE,EAAI4wB,EAAI5wB,IAAOqL,EAAE0xD,EAAO/8D,IAAM88D,EAAQ98D,GAEnF,IAAK,IAAIooB,EAAKktC,EAAKltC,EAAKzoB,EAAGyoB,IAAM,CAE/B,IAAMnV,EAAI8Z,EAAG3E,GAEPspC,EAAI4lD,EAAOA,EAAKrkG,GAAKA,EAE3B,KAAIy+C,EAAI,GAUR,IARA4P,EAAKq3C,EAAKjnD,GACV9gC,EAAK+nF,EAAKjnD,EAAI,GAEdrmD,EAAE4H,GAAKi/D,EAAa7mE,EAAE4H,GAAIwlG,EAAQD,EAAKl3C,EAAM1wC,EAAK,IAElD5wB,EAAIw4G,EAAMl3C,EAAK,EAAKA,EACpBhhD,EAAIk4F,EAAM5nF,EAAOA,EAAK,EAEf5wB,EAAIsgB,EAAGtgB,IAAK,CAEjB,IAAM9B,EAAIw6G,EAAO14G,GAEjBqL,EAAEnN,GAAKouB,EAASjhB,EAAEnN,GAAIkwC,EAASqqE,EAAQz4G,GAAIqL,EAAE4H,MAIjD,OAAOqiD,ME7DEwjD,GAA6Br7G,GAX7B,OACQ,CACnB,MACA,eACA,WACA,WACA,SACA,WACA,iBAGoE,YAA+E,IAA5EyW,EAA4E,EAA5EA,IAAKg+D,EAAuE,EAAvEA,aAAc9jC,EAAyD,EAAzDA,SAAU9hB,EAA+C,EAA/CA,SAAUw+C,EAAqC,EAArCA,OAAQC,EAA6B,EAA7BA,SAAU7W,EAAmB,EAAnBA,aAC1H6kD,EAAYR,GAAgB,CAAErmC,eAAc9jC,WAAU9hB,aAiB5D,OAAO,SAAehuB,EAAG2B,EAAG+4G,GAE1B,IAAK16G,EAAK,OAAO,KAEjB,IAIIgiB,EAFE3gB,EAFOrB,EAAE4wD,MAEA,GAGX4oD,EAAM,IACNG,EAAM,IAENh4G,IACFqgB,EAAIrgB,EAAEqgB,EACNw3F,EAAM73G,EAAE63G,KAAOA,EACfG,EAAMh4G,EAAEg4G,KAAOA,GAGjB,IAwBI/5G,EAAG8B,EAxBD8yG,EAAU,GACV58D,EAAS,GACT68D,EAAO,GAEP5+B,EAAI,IAAIjgB,EAAa,CACzB3oD,OAAQunG,EACRpnG,MAAOwqC,EACPme,IAAK0+C,EACLvlE,KAAM,CAAC7tC,EAAGA,KAGNqzG,EAAU,GACVC,EAAS,GACTC,EAAO,GAEPZ,EAAI,IAAIp+C,EAAa,CACzB3oD,OAAQynG,EACRtnG,MAAOunG,EACP5+C,IAAK6+C,EACL1lE,KAAM,CAAC7tC,EAAGA,KAGN23G,EAAO,GAIPjsG,EAAI,GACJ0hB,EAAK,GAEX,IAAK7uB,EAAI,EAAGA,EAAIyB,EAAGzB,IAEjBmN,EAAEnN,GAAK,EAEPo5G,EAAKp5G,IAAM,EAEX60G,EAAK70G,EAAI,GAAK,EAGhB45G,EAAM,EACNG,EAAM,EAEN,IAAK,IAAI1pG,EAAI,EAAGA,EAAI5O,EAAG4O,IAAK,CAE1BwkG,EAAKxkG,GAAKupG,EACV5E,EAAK3kG,GAAK0pG,EAEV,IAAMrnD,EAAMtwC,EAAIA,EAAE/R,GAAKA,EAEjB+mD,EAAMyjD,EAAU5kC,EAAG71E,EAAGsyD,EAAK7jC,EAAI1hB,EAAGisG,EAAM,GAE1C2B,GAAQ,EACRllG,GAAK,EAET,IAAK/T,EAAIs1D,EAAKt1D,EAAIL,EAAGK,IAInB,GAAIs3G,EAFJp5G,EAAI6uB,EAAG/sB,IAEO,EAAG,CAEf,IAAMk5G,EAAOhlG,EAAI7I,EAAEnN,IAEf4sE,EAAOouC,EAAMnlG,KAEfA,EAAImlG,EACJD,EAAO/6G,QAIT+0G,EAAOgF,GAAOX,EAAKp5G,GACnB80G,EAAQiF,KAAS5sG,EAAEnN,GAIvB,IAAc,IAAV+6G,GAAellG,GAAK,EAAK,OAAO,KAEhCujG,EAAK1mD,GAAO,GAAKma,EAAS72D,EAAI7I,EAAEulD,IAAOxiB,EAASr6B,EAAGilG,MAASC,EAAOroD,GAEvE,IAAMimB,EAAQxrE,EAAE4tG,GAUhB,IARAhG,EAAOgF,GAAO1pG,EACdykG,EAAQiF,KAASphC,EAEjBygC,EAAK2B,GAAQ1qG,EAEb2nC,EAAO4hE,GAAOmB,EACdnG,EAAQgF,KAAS,EAEZ93G,EAAIs1D,EAAKt1D,EAAIL,EAAGK,IAIfs3G,EAFJp5G,EAAI6uB,EAAG/sB,IAEO,IAEZk2C,EAAO4hE,GAAO55G,EAEd40G,EAAQgF,KAAS5lC,EAAa7mE,EAAEnN,GAAI24E,IAGtCxrE,EAAEnN,GAAK,EAOX,IAHA60G,EAAKpzG,GAAKm4G,EACV5E,EAAKvzG,GAAKs4G,EAELj4G,EAAI,EAAGA,EAAI83G,EAAK93G,IAAOk2C,EAAOl2C,GAAKs3G,EAAKphE,EAAOl2C,IAOpD,OALA8yG,EAAQ7hG,OAAO6mG,EAAKhF,EAAQnxG,OAASm2G,GACrC5hE,EAAOjlC,OAAO6mG,EAAK5hE,EAAOv0C,OAASm2G,GACnC9E,EAAQ/hG,OAAOgnG,EAAKjF,EAAQrxG,OAASs2G,GACrChF,EAAOhiG,OAAOgnG,EAAKhF,EAAOtxG,OAASs2G,GAE5B,CACL9jC,EAAGA,EACHm+B,EAAGA,EACHgF,KAAMA,OClJC6B,GAA4B17G,GAd5B,MACQ,CACnB,QACA,MACA,MACA,WACA,YACA,eACA,WACA,SACA,WACA,iBAGmE,YAAsG,IAAnGmiC,EAAmG,EAAnGA,MAAO1rB,EAA4F,EAA5FA,IAAKnJ,EAAuF,EAAvFA,IAAKqjC,EAAkF,EAAlFA,SAAUsgC,EAAwE,EAAxEA,UAAWwD,EAA6D,EAA7DA,aAAc5lD,EAA+C,EAA/CA,SAAUw+C,EAAqC,EAArCA,OAAQC,EAA6B,EAA7BA,SAAU7W,EAAmB,EAAnBA,aAChJklD,EAAQlC,GAAY,CAAEnsG,MAAKqjC,WAAUsgC,cACrC2qC,EAAOP,GAAW,CAAE5kG,MAAKg+D,eAAc9jC,WAAU9hB,WAAUw+C,SAAQC,WAAU7W,iBAuCnF,OAAOt0B,EAvDI,MAuDQ,CAEjB,+BAAgC,SAAU7rB,EAAGqjE,EAAOkiC,GAElD,IAAKhxF,EAAU8uD,IAAUA,EAAQ,GAAKA,EAAQ,EAAK,MAAM,IAAI17D,MAAM,yFAEnE,GAAI49F,EAAY,GAAKA,EAAY,EAAK,MAAM,IAAI59F,MAAM,2DAGtD,IAAMzb,EAAIm5G,EAAMhiC,EAAOrjE,GAAG,GAGpBzR,EAAI+2G,EAAKtlG,EAAG9T,EAAGq5G,GAGrB,MAAO,CACLnlC,EAAG7xE,EAAE6xE,EACLm+B,EAAGhwG,EAAEgwG,EACLtyG,EAAGsC,EAAEg1G,KACLh3F,EAAGrgB,EAAEqgB,EACLlgB,SAAU,WACR,MAAO,MAAQtC,KAAKq2E,EAAE/zE,WAAa,QAAUtC,KAAKw0G,EAAElyG,WAAa,QAAUtC,KAAKkC,EAAEI,YAActC,KAAKwiB,EAAI,QAAUxiB,KAAKwiB,EAAElgB,WAAa,IAAM,aCzEhJ,SAASm5G,GAASv5G,EAAGgU,GAE1B,IAAIzF,EACE5O,EAAIqU,EAAErS,OACN0J,EAAI,GAEV,GAAIrL,EAEF,IAAKuO,EAAI,EAAGA,EAAI5O,EAAG4O,IAEjBlD,EAAErL,EAAEuO,IAAMyF,EAAEzF,QAId,IAAKA,EAAI,EAAGA,EAAI5O,EAAG4O,IAEjBlD,EAAEkD,GAAKyF,EAAEzF,GAGb,OAAOlD,ECtBT,IACMw/C,GAAe,CACnB,QACA,SACA,MACA,MACA,SACA,SACA,eAGW2uD,GAAgC/7G,GAXhC,UAW8CotD,IAAc,YAA8D,IAA3DjrB,EAA2D,EAA3DA,MAAOutB,EAAoD,EAApDA,OAAQssD,EAA4C,EAA5CA,IAAKC,EAAuC,EAAvCA,IAAKC,EAAkC,EAAlCA,OAAQC,EAA0B,EAA1BA,OACrGxmC,EAAkBJ,GAAsB,CAAElmB,YADqF,EAAlBA,cAoCnH,OAAOltB,EA/CI,UA+CQ,CAEjB,wBAAyB,SAAU7rB,EAAGC,GACpCD,EAAIo5C,EAAOp5C,GACX,IAAMvV,EAAIi7G,EAAI1lG,GAEd,OADU8lG,EAASr7G,EAAE21E,EAAG31E,EAAE8zG,EAAG9zG,EAAEwB,EAAG,KAAMgU,GAC/BwH,WAGX,8BAA+B,SAAUzH,EAAGC,GAC1C,IAAMxV,EAAIi7G,EAAI1lG,GACd,OAAO8lG,EAASr7G,EAAE21E,EAAG31E,EAAE8zG,EAAG9zG,EAAEwB,EAAG,KAAMgU,IAGvC,+BAAgC,SAAUD,EAAGC,GAC3C,IAAMxV,EAAIi7G,EAAI1lG,GACd,OAAO8lG,EAASr7G,EAAE21E,EAAG31E,EAAE8zG,EAAG9zG,EAAEwB,EAAG,KAAMgU,IAGvC,+CAAgD,SAAUD,EAAGC,EAAGojE,EAAOkiC,GACrE,IAAM96G,EAAIk7G,EAAI3lG,EAAGqjE,EAAOkiC,GACxB,OAAOO,EAASr7G,EAAE21E,EAAG31E,EAAE8zG,EAAG9zG,EAAEwB,EAAGxB,EAAE8hB,EAAGtM,IAGtC,yBAA0B,SAAUxV,EAAGwV,GACrC,OAAO6lG,EAASr7G,EAAE21E,EAAG31E,EAAE8zG,EAAG9zG,EAAEwB,EAAGxB,EAAE8hB,EAAGtM,MAIxC,SAAS8lG,EAAW/lG,GAClB,GAAIquC,EAASruC,GAAM,OAAOA,EAC1B,GAAItG,EAAQsG,GAAM,OAAOo5C,EAAOp5C,GAChC,MAAM,IAAI3M,UAAU,mCAGtB,SAASyyG,EAAU17G,EAAG0wB,EAAG7uB,EAAGsgB,EAAGtM,GAE7B7V,EAAI27G,EAAU37G,GACd0wB,EAAIirF,EAAUjrF,GAGV7uB,KACFgU,EAAIo/D,EAAgBj1E,EAAG6V,GAAG,IACxBi7C,MAAQsqD,GAAQv5G,EAAGgU,EAAEi7C,QAIzB,IAAMn5C,EAAI8jG,EAAOz7G,EAAG6V,GAEd3I,EAAIsuG,EAAO9qF,EAAG/Y,GAKpB,OAFIwK,IAAKjV,EAAE4jD,MAAQsqD,GAAQj5F,EAAGjV,EAAE4jD,QAEzB5jD,MCpGLw/C,GAAe,CAAC,SAETkvD,GAAkCt8G,GAHlC,OAGgDotD,IAAc,YAAe,IAAZ31C,EAAY,EAAZA,MAY5E,SAAS8kG,EAAMC,GACb,KAAMn8G,gBAAgBk8G,GACpB,MAAM,IAAInmG,YAAY,oDAGxB,IAAKomG,EAAK,MAAM,IAAIv+F,MAAM,0BAE1B5d,KAAKm8G,IAAMA,EA4Fb,OAtFAD,EAAKl6G,UAAU8K,KAAO,OACtBovG,EAAKl6G,UAAU8iD,QAAS,EAOxBo3D,EAAKl6G,UAAUM,SAAW,WACxB,IAAM65G,EAAMn8G,KAAKm8G,KAAO,GACpBl5F,EAAO,KAcX,GAZIk5F,EAAIx7G,OACNsiB,GAAQ,SAAWk5F,EAAIx7G,KAAO,QAE5Bw7G,EAAI/2E,WACNniB,GAAQ,aAAek5F,EAAI/2E,SAAW,QAEpC+2E,EAAIzsG,cACNuT,GAAQ,qBAAuBk5F,EAAIzsG,YAAc,QAE/CysG,EAAInzD,SACN/lC,GAAQ,gBAAkBk5F,EAAInzD,OAAOp6C,KAAK,UAAY,QAEpDutG,EAAIC,SAAU,CAChBn5F,GAAQ,cAGR,IADA,IAAMgqC,EAAQ,GACL7sD,EAAI,EAAGA,EAAI+7G,EAAIC,SAASv4G,OAAQzD,IAAK,CAC5C,IAAM69F,EAAOke,EAAIC,SAASh8G,GAC1B6iB,GAAQ,OAASg7E,EAAO,KAExB,IAAI1lF,OAAG,EACP,IAEEA,EAAMnB,EAAM6mF,GAAMF,UAAUD,SAAS7wC,GACrC,MAAOxqC,GACPlK,EAAMkK,OAEI3e,IAARyU,GAAsBusC,EAAOvsC,KAC/B0K,GAAQ,WAAa0jC,GAAOpuC,EAAK,CAAEuL,UAAW,KAAQ,MAG1Db,GAAQ,KASV,OAPIk5F,EAAIE,UAAYF,EAAIE,SAASx4G,SAC/Bof,GAAQ,WAAak5F,EAAIE,SAASztG,KAAK,MAAQ,QAE7CutG,EAAIG,SAAWH,EAAIG,QAAQz4G,SAC7Bof,GAAQ,aAAek5F,EAAIG,QAAQ1tG,KAAK,MAAQ,MAG3CqU,GAMTi5F,EAAKl6G,UAAUsM,OAAS,WACtB,IAAMrL,EAAM6uB,GAAM9xB,KAAKm8G,KAEvB,OADAl5G,EAAIusD,OAAS,OACNvsD,GAQTi5G,EAAKzsD,SAAW,SAAUC,GACxB,IAAMysD,EAAM,GAQZ,OANAr7G,OAAOkS,KAAK08C,GACT51C,QAAO,SAAA8oC,GAAI,MAAa,WAATA,KACf3+C,SAAQ,SAAA2+C,GACPu5D,EAAIv5D,GAAQ8M,EAAK9M,MAGd,IAAIs5D,EAAKC,IAMlBD,EAAKl6G,UAAU0b,QAAUw+F,EAAKl6G,UAAUM,SAEjC45G,IACN,CAAEvsD,SAAS,IClHR5C,GAAe,CAAC,MAAO,QAEhBwvD,GAAmC58G,GAHnC,QAGiDotD,IAAc,YAAkB,IAAflX,EAAe,EAAfA,GAAIqM,EAAW,EAAXA,KAmBjF,SAASs6D,EAAOn7G,GACd,KAAMrB,gBAAgBw8G,GACpB,MAAM,IAAIzmG,YAAY,oDAGpBmwC,EAAQ7kD,GACVrB,KAAKqB,MAAQA,EAAMA,MAEnBrB,KAAKqB,MAAQA,EA8EjB,SAASo7G,EAAiB97G,EAAM+7G,GAC9B/vD,GAAK6vD,EAAMx6G,UAAWrB,GAAM,WAC1B,IAAMgG,EAAK+1G,IACX,GAAkB,mBAAP/1G,EACT,OAAOg2G,EAASh2G,MAatB,SAASg2G,EAAUh2G,GACjB,OAAO,WAEL,IADA,IAAM6W,EAAO,CAACxd,KAAKqB,OACVjB,EAAI,EAAGA,EAAIwD,UAAUC,OAAQzD,IACpCod,EAAKpd,EAAI,GAAKwD,UAAUxD,GAG1B,OAAO,IAAIo8G,EAAM71G,EAAGC,MAAMD,EAAI6W,KA/FlCg/F,EAAMx6G,UAAU8K,KAAO,QACvB0vG,EAAMx6G,UAAUkkD,SAAU,EAO1Bs2D,EAAMx6G,UAAU0K,KAAO,WACrB,OAAO1M,KAAKqB,OAQdm7G,EAAMx6G,UAAU0b,QAAU,WACxB,OAAO1d,KAAKqB,OAOdm7G,EAAMx6G,UAAUM,SAAW,WACzB,OAAOqkD,GAAO3mD,KAAKqB,QAOrBm7G,EAAMx6G,UAAUsM,OAAS,WACvB,MAAO,CACLkhD,OAAQ,QACRnuD,MAAOrB,KAAKqB,QAWhBm7G,EAAM/sD,SAAW,SAAUC,GACzB,OAAO,IAAI8sD,EAAM9sD,EAAKruD,QAiExBm7G,EAAMI,YAAc,SAAU3yE,EAAMC,GAClC,GAAoB,iBAATD,EAxDStpC,EA0DNspC,EAzDI,mBADQtjC,EA0DNujC,KAxDlBsyE,EAAMx6G,UAAUrB,GAAQg8G,EAASh2G,QAyD5B,gBAEMhG,GACLsB,GAAegoC,EAAMtpC,SAAiCmD,IAAxB+4G,EAAcl8G,IAC9C87G,EAAgB97G,GAAM,kBAAMspC,EAAKtpC,OAFrC,IAAK,IAAMA,KAAQspC,EAAM,EAAdtpC,GA7Df,IAAsBA,EAAMgG,GAqE5B,IAAMk2G,EAAgB,CACpB3N,YAAY,EACZ4N,MAAM,EACNhwG,MAAM,EACNiwG,SAAS,EACTrtD,MAAM,EACNrrD,OAAO,EACP6hD,SAAS,GAgBX,OAZAs2D,EAAMI,YAAY16D,GAGdrM,GACFA,EAAG,UAAU,SAAUl1C,EAAM+7G,EAAU/oE,GAChCA,GAEH8oE,EAAgB97G,EAAM+7G,MAKrBF,IACN,CAAE7sD,SAAS,ICjMDqtD,GAAQ,CACnBr8G,KAAM,IACNykC,SAAU,YACV4jB,OAAQ,CACN,KAEFt5C,YAAa,oFACb0sG,SAAU,CACR,IACA,QACA,SACA,UAEFE,QAAS,CAAC,QCbCW,GAAS,CACpBt8G,KAAM,KACNykC,SAAU,YACV4jB,OAAQ,CACN,MAEFt5C,YAAa,gJACb0sG,SAAU,CACR,KACA,aAEFE,QAAS,CAAC,QC2NCY,GAAe,CAG1BpwC,UCzO2B,CAC3BnsE,KAAM,YACNykC,SAAU,eACV4jB,OAAQ,CACN,gBAEFt5C,YACI,+CACJ0sG,SAAU,CACR,YACA,kCACA,mBACA,uBACA,8BAEFE,QAAS,CACP,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,SD0NjE5iD,QE1OyB,CACzB/4D,KAAM,UACNykC,SAAU,eACV4jB,OAAQ,CACN,IACA,cAEFt5C,YACI,6CACJ0sG,SAAU,CACR,aACA,aACA,aACA,kBACA,mBACA,yBAEFE,QAAS,CACP,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SFyNjEp4C,QG3OyB,CACzBvjE,KAAM,UACNykC,SAAU,eACV4jB,OAAQ,CACN,YACA,kBACA,mBAEFt5C,YACI,2BACJ0sG,SAAU,CACR,YACA,gBACA,qBAEFE,QAAS,CACP,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SH4NjEtnB,WI5O4B,CAC5Br0F,KAAM,aACNykC,SAAU,eACV4jB,OAAQ,CACN,0BACA,gCAEFt5C,YACI,iEACJ0sG,SAAU,CACR,oBACA,uFACA,oCAEFE,QAAS,CACP,OAAQ,cJ8NVxzD,SK7O0B,CAC1BnoD,KAAM,WACNykC,SAAU,eACV4jB,OAAQ,CACN,gBACA,mBACA,oBACA,8BAEFt5C,YACE,6EACF0sG,SAAU,CACR,kBACA,kCACA,4BACA,2CAEFE,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SL4NlE1uG,MM9OuB,CACvBjN,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,UACA,cACA,mBACA,yBACA,kCACA,+CAEFt5C,YACI,yDACJ0sG,SAAU,CACR,KACA,YACA,yBACA,UACA,eACA,4BAEFE,QAAS,CACP,YAAa,UAAW,UAAW,UAAW,SAAU,QAAS,SAAU,SNyN7EjtD,OO/OwB,CACxB1uD,KAAM,SACNykC,SAAU,eACV4jB,OAAQ,CACN,KACA,6BACA,WACA,kBACA,iBAEFt5C,YACI,mBACJ0sG,SAAU,CACR,KACA,YACA,qBACA,WACA,iBACA,iCACA,4CAEFE,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WP0N1Ej5F,OQhPwB,CACxB1iB,KAAM,SACNykC,SAAU,eACV4jB,OAAQ,CACN,IACA,YACA,+BAEFt5C,YACI,gEACJ0sG,SAAU,CACR,IACA,MACA,OACA,YACA,gBACA,eACA,oCACA,6BAEFE,QAAS,CACP,YAAa,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,SR4N9E7T,OSjPwB,CACxB9nG,KAAM,SACNykC,SAAU,eACV4jB,OAAQ,CACN,WACA,qCACA,gDAEFt5C,YACA,0BACA0sG,SAAU,CACR,WACA,uBACA,kCAEFE,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WTkO1EvhD,UUlP2B,CAC3Bp6D,KAAM,YACNykC,SAAU,eACV4jB,OAAQ,CACN,wCAEFt5C,YACI,6EACJ0sG,SAAU,CACR,oCAEFE,QAAS,CACP,OAAQ,eVuOVx/F,OWnPwB,CACxBnc,KAAM,SACNykC,SAAU,eACV4jB,OAAQ,CACN,SACA,aAEFt5C,YACI,iDACJ0sG,SAAU,CACR,iBACA,cACA,kBAEFE,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SXqOlE/iD,KYpPsB,CACtB54D,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,aACA,oBACA,gBAEFt5C,YACI,iBACJ0sG,SAAU,CACR,SACA,SACA,wBACA,kBAEFE,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,WZsOlE75F,EAAGu6F,GACH1rG,EAAG0rG,GACH7W,MazPuB,CACvBxlG,KAAM,QACNykC,SAAU,YACV4jB,OAAQ,CACN,SAEFt5C,YAAa,sBACb0sG,SAAU,CACR,SAEFE,QAAS,CAAC,SbgPVl8G,Ec1PmB,CACnBO,KAAM,IACNykC,SAAU,YACV4jB,OAAQ,CACN,KAEFt5C,YAAa,sIACb0sG,SAAU,CACR,IACA,QACA,YAEFE,QAAS,Id+OTnkG,Se3P0B,CAC1BxX,KAAM,WACNykC,SAAU,YACV4jB,OAAQ,CACN,YAEFt5C,YAAa,6GACb0sG,SAAU,CACR,WACA,SAEFE,QAAS,IfiPT/lG,IgB5PqB,CACrB5V,KAAM,MACNykC,SAAU,YACV4jB,OAAQ,CACN,OAEFt5C,YAAa,mEACb0sG,SAAU,CACR,MACA,UAEFE,QAAS,IhBkPT14F,KiB7PsB,CACtBjjB,KAAM,OACNykC,SAAU,YACV4jB,OAAQ,CACN,QAEFt5C,YAAa,oEACb0sG,SAAU,CACR,OACA,WAEFE,QAAS,IjBmPTa,MkB9PuB,CACvBx8G,KAAM,QACNykC,SAAU,YACV4jB,OAAQ,CACN,SAEFt5C,YAAa,kEACb0sG,SAAU,CACR,QACA,aAEFE,QAAS,IlBoPT7jE,OmB/PwB,CACxB93C,KAAM,SACNykC,SAAU,YACV4jB,OAAQ,CACN,UAEFt5C,YAAa,mEACb0sG,SAAU,CACR,SACA,cAEFE,QAAS,InBqPTxnG,IoBhQqB,CACrBnU,KAAM,MACNykC,SAAU,YACV4jB,OAAQ,CACN,OAEFt5C,YAAa,eACb0sG,SAAU,CACR,MACA,SAEFE,QAAS,IpBsPThjD,KqBjQsB,CACtB34D,KAAM,OACNykC,SAAU,YACV4jB,OAAQ,CACN,QAEFt5C,YAAa,aACb0sG,SAAU,CACR,QAEFE,QAAS,CAAC,OAAQ,UrBwPlBtrF,GAAIisF,GACJplG,GAAIolG,GACJltD,IsBpQqB,CACrBpvD,KAAM,MACNykC,SAAU,YACV4jB,OAAQ,CACN,OAEFt5C,YAAa,mOACb0sG,SAAU,CACR,OAEFE,QAAS,ItB2PTc,QuBrQwB,CACxBz8G,KAAM,UACNykC,SAAU,YACV4jB,OAAQ,CACN,WAEFt5C,YAAa,+DACb0sG,SAAU,CACR,UACA,aAEFE,QAAS,IvB2PTe,MwBtQuB,CACvB18G,KAAM,QACNykC,SAAU,YACV4jB,OAAQ,CACN,SAEFt5C,YAAa,6DACb0sG,SAAU,CACR,QACA,WAEFE,QAAS,IxB4PT9W,IyBvQqB,CACrB7kG,KAAM,MACNykC,SAAU,YACV4jB,OAAQ,CACN,OAEFt5C,YAAa,0GACb0sG,SAAU,CACR,MACA,UAEFE,QAAS,CAAC,OzB6PVpW,K0BxQsB,CACtBvlG,KAAM,OACNykC,SAAU,YACV4jB,OAAQ,CACN,QAEFt5C,YAAa,qBACb0sG,SAAU,CACR,QAEFE,QAAS,CAAC,U1B+PV9jF,Q2BzQyB,CACzB73B,KAAM,UACNykC,SAAU,YACV4jB,OAAQ,CACN,WAEFt5C,YAAa,8CACb0sG,SAAU,CACR,WAEFE,QAAS,I3BmQTgB,aAAc,CAAE5tG,YAAa,2BAA4B0sG,SAAU,CAAC,iBACpEmB,oBAAqB,CAAE7tG,YAAa,oCAAqC0sG,SAAU,CAAC,wBACpFoB,eAAgB,CAAE9tG,YAAa,kBAAmB0sG,SAAU,CAAC,mBAC7DqB,sBAAuB,CAAE/tG,YAAa,0BAA2B0sG,SAAU,CAAC,0BAE5EsB,iBAAkB,CAAEhuG,YAAa,0CAA2C0sG,SAAU,CAAC,qBACvFuB,iBAAkB,CAAEjuG,YAAa,0CAA2C0sG,SAAU,CAAC,qBACvFwB,gBAAiB,CAAEluG,YAAa,qCAAsC0sG,SAAU,CAAC,oBACjF7tB,QAAS,CAAE7+E,YAAa,qBAAuB0sG,SAAU,CAAC,YAC1DyB,iBAAkB,CAAEnuG,YAAa,oBAAqB0sG,SAAU,CAAC,qBACjE0B,aAAc,CAAEpuG,YAAa,gBAAiB0sG,SAAU,CAAC,iBACzD2B,mBAAoB,CAAEruG,YAAa,sBAAuB0sG,SAAU,CAAC,uBACrE4B,0BAA2B,CAAEtuG,YAAa,8BAA+B0sG,SAAU,CAAC,8BAEpF6B,oBAAqB,CAAEvuG,YAAa,wBAAyB0sG,SAAU,CAAC,wBACxE8B,gBAAiB,CAAExuG,YAAa,mBAAoB0sG,SAAU,CAAC,oBAC/D+B,SAAU,CAAEzuG,YAAa,wBAAyB0sG,SAAU,CAAC,aAE7DgC,WAAY,CAAE1uG,YAAa,cAAe0sG,SAAU,CAAC,eACrDiC,wBAAyB,CAAE3uG,YAAa,4BAA6B0sG,SAAU,CAAC,4BAChFkC,aAAc,CAAE5uG,YAAa,gBAAiB0sG,SAAU,CAAC,iBACzDmC,cAAe,CAAE7uG,YAAa,0BAA2B0sG,SAAU,CAAC,kBACpEoC,cAAe,CAAE9uG,YAAa,0BAA2B0sG,SAAU,CAAC,kBACpEqC,cAAe,CAAE/uG,YAAa,iBAAkB0sG,SAAU,CAAC,kBAC3DsC,WAAY,CAAEhvG,YAAa,cAAe0sG,SAAU,CAAC,eACrDuC,aAAc,CAAEjvG,YAAa,gBAAiB0sG,SAAU,CAAC,iBACzDwC,YAAa,CAAElvG,YAAa,eAAgB0sG,SAAU,CAAC,gBACvDyC,qBAAsB,CAAEnvG,YAAa,yBAA0B0sG,SAAU,CAAC,yBAC1E0C,QAAS,CAAEpvG,YAAa,mBAAoB0sG,SAAU,CAAC,YACvD2C,oBAAqB,CAAErvG,YAAa,wBAAyB0sG,SAAU,CAAC,wBACxE4C,gBAAiB,CAAEtvG,YAAa,oBAAqB0sG,SAAU,CAAC,oBAChE6C,aAAc,CAAEvvG,YAAa,gBAAiB0sG,SAAU,CAAC,iBAEzD8C,WAAY,CAAExvG,YAAa,uBAAwB0sG,SAAU,CAAC,eAC9D+C,SAAU,CAAEzvG,YAAa,oBAAsB0sG,SAAU,CAAC,aAC1DgD,UAAW,CAAE1vG,YAAa,qBAAsB0sG,SAAU,CAAC,cAC3DiD,QAAS,CAAE3vG,YAAa,mBAAoB0sG,SAAU,CAAC,YACvDkD,eAAgB,CAAE5vG,YAAa,2BAA4B0sG,SAAU,CAAC,mBACtEmD,UAAW,CAAE7vG,YAAa,qDAAsD0sG,SAAU,CAAC,cAC3FoD,YAAa,CAAE9vG,YAAa,eAAgB0sG,SAAU,CAAC,gBACvDqD,oBAAqB,CAAE/vG,YAAa,wBAAyB0sG,SAAU,CAAC,wBACxEsD,YAAa,CAAEhwG,YAAa,+DAAgE0sG,SAAU,CAAC,gBACvGuD,cAAe,CAAEjwG,YAAa,qDAAsD0sG,SAAU,CAAC,kBAC/FwD,gBAAiB,CAAElwG,YAAa,4BAA6B0sG,SAAU,CAAC,oBACxEyD,gBAAiB,CAAEnwG,YAAa,4BAA6B0sG,SAAU,CAAC,oBACxE0D,iBAAkB,CAAEpwG,YAAa,iCAAkC0sG,SAAU,CAAC,qBAG9E2D,UAAW,CAAErwG,YAAa,sBAAuB0sG,SAAU,CAAC,cAC5D4D,aAAc,CAAEtwG,YAAa,mCAAoC0sG,SAAU,CAAC,iBAC5E6D,QAAS,CAAEvwG,YAAa,iFAAkF0sG,SAAU,CAAC,YAErH8D,aAAc,CAAExwG,YAAa,gBAAiB0sG,SAAU,CAAC,iBACzD+D,WAAY,CAAEzwG,YAAa,cAAe0sG,SAAU,CAAC,eACrDgE,WAAY,CAAE1wG,YAAa,cAAe0sG,SAAU,CAAC,eACrDiE,aAAc,CAAE3wG,YAAa,gBAAiB0sG,SAAU,CAAC,iBACzDkE,kBAAmB,CAAE5wG,YAAa,qBAAsB0sG,SAAU,CAAC,sBAGnEmE,W4BxU4B,CAC5B5/G,KAAM,aACNykC,SAAU,UACV4jB,OAAQ,CACN,6BACA,mDAEFt5C,YAAa,4OACb0sG,SAAU,CACR,0BACA,6CACA,mCACA,6BACA,uBACA,iBACA,wBACA,uBAEFE,QAAS,CACP,WAAY,QAAS,a5BsTvBR,O6BzUwB,CACxBn7G,KAAM,SACNykC,SAAU,UACV4jB,OAAQ,CACN,kBAEFt5C,YACA,gIACA0sG,SAAU,CACR,oBACA,cACA,oBAEFE,QAAS,CACP,YAAa,MAAO,UAAW,SAAU,SAAU,W7B4TrDkE,U8B1U2B,CAC3B7/G,KAAM,YACNykC,SAAU,UACV4jB,OAAQ,CACN,qBAEFt5C,YACA,iIACA0sG,SAAU,CACR,oBACA,cACA,oBAEFE,QAAS,CACP,SAAU,MAAO,UAAW,SAAU,SAAU,W9B6TlDX,I+B3UqB,CACrBh7G,KAAM,MACNykC,SAAU,UACV4jB,OAAQ,CACN,UAEFt5C,YACA,sIACA0sG,SAAU,CACR,wBACA,gCACA,iCAEFE,QAAS,CACP,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,O/B8T5DmE,QgC5UyB,CACzB9/G,KAAM,UACNykC,SAAU,UACV4jB,OAAQ,CACN,kBACA,oBAEFt5C,YAAa,gGACb0sG,SAAU,CACR,oBACA,cACA,qBAEFE,QAAS,CACP,MAAO,MAAO,SAAU,SAAU,SAAU,WhC+T9CoE,UiC7U2B,CAC3B//G,KAAM,YACNykC,SAAU,UACV4jB,OAAQ,CAAC,mBACTt5C,YAAa,0EACb0sG,SAAU,CACR,0BACA,8CAEFE,QAAS,CAAC,ajCqUV/xG,QkC9UyB,CACzB5J,KAAM,UACNykC,SAAU,UACV4jB,OAAQ,CACN,wBAEFt5C,YAAa,0DACb0sG,SAAU,CACR,oCACA,wDACA,8CACA,8DAEFE,QAAS,CACP,WAAY,YAEdD,SAAU,CACR,mBlC8TFn8B,SmC/U0B,CAC1Bv/E,KAAM,WACNykC,SAAU,UACV4jB,OAAQ,CACN,iBACA,yBAEFt5C,YAAa,+BACb0sG,SAAU,CACR,wBACA,qBACA,+BACA,2BACA,+BAEFE,QAAS,CACP,eAAgB,aAAc,WAAY,QAAS,cAAe,YnCgUpEqE,aoChV8B,CAC9BhgH,KAAM,eACNykC,SAAU,UACV4jB,OAAQ,CACN,sBAEFt5C,YAAa,iEACb0sG,SAAU,CACR,6BACA,kCAEFE,QAAS,CACP,WAAY,apCqUdsE,cqCjV+B,CAC/BjgH,KAAM,gBACNykC,SAAU,UACV4jB,OAAQ,CACN,8BACA,wCAEFt5C,YAAa,oEACb0sG,SAAU,CACR,6BACA,mCACA,mEAEFE,QAAS,CAAC,WAAY,arCqUtBuE,YsClV6B,CAC7BlgH,KAAM,cACNykC,SAAU,UACV4jB,OAAQ,CACN,oBACA,2BACA,sCAEFt5C,YAAa,mPACb0sG,SAAU,CACR,gCACA,uCAEFE,QAAS,CACP,atCqUFV,IuCnVqB,CACrBj7G,KAAM,MACNykC,SAAU,UACV4jB,OAAQ,CACN,4BAEFt5C,YAAa,wKACb0sG,SAAU,CACR,2FAEFE,QAAS,CACP,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,OvCyU5DT,OwCpVwB,CACxBl7G,KAAM,SACNykC,SAAU,UACV4jB,OAAQ,CACN,kBAEFt5C,YACA,gIACA0sG,SAAU,CACR,oFAEFE,QAAS,CACP,YAAa,MAAO,UAAW,SAAU,SAAU,WxCyUrDwE,UyCrV2B,CAC3BngH,KAAM,YACNykC,SAAU,UACV4jB,OAAQ,CACN,kBAEFt5C,YACA,iIACA0sG,SAAU,CACR,oFAEFE,QAAS,CACP,SAAU,MAAO,UAAW,SAAU,SAAU,WzC0UlD/C,G0CtVoB,CACpB54G,KAAM,KACNykC,SAAU,UACV4jB,OAAQ,CACN,SAEFt5C,YACA,uKACA0sG,SAAU,CACR,4DAEFE,QAAS,CACP,MAAO,MAAO,W1C6UhBlmG,I2CzVqB,CACrBzV,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,UAEFt5C,YAAa,8BACb0sG,SAAU,CACR,WACA,aAEFE,QAAS,CAAC,S3C+UVrvG,I4C1VqB,CACrBtM,KAAM,MACNykC,SAAU,YACV4jB,OAAQ,CACN,QACA,aAEFt5C,YAAa,kBACb0sG,SAAU,CACR,gBACA,UACA,SACA,gBACA,eAEFE,QAAS,CACP,a5C2UFz0F,K6C3VsB,CACtBlnB,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,UACA,qBAEFt5C,YACI,iQACJ0sG,SAAU,CACR,WACA,UACA,WACA,eACA,WACA,iBACA,gBAEFE,QAAS,CACP,SACA,OACA,OACA,a7CsUFtjG,K8C5VsB,CACtBrY,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,WAEFt5C,YACI,wHACJ0sG,SAAU,CACR,YACA,YACA,cAEFE,QAAS,CAAC,QAAS,MAAO,U9CgV1B9U,K+C7VsB,CACtB7mG,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,WAEFt5C,YAAa,2DACb0sG,SAAU,CACR,UACA,MACA,aAEFE,QAAS,CACP,WACA,SACA,Q/C+UFp0F,OgD9VwB,CACxBvnB,KAAM,SACNykC,SAAU,YACV4jB,OAAQ,CACN,QACA,gBAEFt5C,YAAa,qBACb0sG,SAAU,CACR,YACA,QACA,UACA,YACA,cACA,eAEFE,QAAS,CACP,ahD8UFzV,UiD/V2B,CAC3BlmG,KAAM,YACNykC,SAAU,YACV4jB,OAAQ,CACN,SACA,mBAEFt5C,YAAa,kCACb0sG,SAAU,CACR,yBACA,yBACA,UAEFE,QAAS,CACP,WACA,cACA,WjDgVF1V,YkDhW6B,CAC7BjmG,KAAM,cACNykC,SAAU,YACV4jB,OAAQ,CACN,SACA,qBAEFt5C,YAAa,oCACb0sG,SAAU,CACR,yBACA,yBACA,UAEFE,QAAS,CACP,WACA,SACA,clDiVF7V,OmDjWwB,CACxB9lG,KAAM,SACNykC,SAAU,YACV4jB,OAAQ,CACN,SACA,gBAEFt5C,YACI,+CACJ0sG,SAAU,CACR,yBACA,UAEFE,QAAS,CACP,QnDoVF1mG,IoDlWqB,CACrBjV,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,UAEFt5C,YAAa,qCACb0sG,SAAU,CACR,WACA,UACA,gBACA,UACA,uDAEFE,QAAS,CACP,OACA,QACA,MACA,QpDiVFrU,KqDnWsB,CACtBtnG,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,UAEFt5C,YAAa,wJAGb0sG,SAAU,CACR,uBAEFE,QAAS,CACP,QrDuVF1kG,MsDpWuB,CACvBjX,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,YAEFt5C,YAAa,mEACb0sG,SAAU,CACR,WACA,gBACA,qBAEFE,QAAS,CACP,MACA,MACA,QtDsVFr8F,IuDrWqB,CACrBtf,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,UAEFt5C,YACI,sGACJ0sG,SAAU,CACR,WACA,WACA,YACA,aAEFE,QAAS,CAAC,OAAQ,QAAS,UvDwV3BrjG,MwDtWuB,CACvBtY,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,YAEFt5C,YACI,yHACJ0sG,SAAU,CACR,aACA,aACA,eAEFE,QAAS,CAAC,OAAQ,MAAO,UxD0VzB3pF,IyDvWqB,CACrBhyB,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,YACA,qBAEFt5C,YAAa,uCACb0sG,SAAU,CACR,aACA,aACA,oBAEFE,QAAS,CAAC,MAAO,SzD2VjB/qF,M0DxWuB,CACvB5wB,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,sBACA,yBAEFt5C,YAAa,mDACb0sG,SAAU,CACR,cACA,kBACA,YACA,oBAEFE,QAAS,CAAC,MAAO,S1D2VjB77C,I2DzWqB,CACrB9/D,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,aAEFt5C,YAAa,qCACb0sG,SAAU,CACR,YACA,aACA,iBAEFE,QAAS,CAAC,Q3D8VVhmG,I4D1WqB,CACrB3V,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,SACA,gBAEFt5C,YAAa,8NACb0sG,SAAU,CACR,WACA,eACA,SACA,SACA,iBACA,uBACA,mBACA,SAEFE,QAAS,CACP,MACA,QACA,OACA,U5DqVF7qF,K6D3WsB,CACtB9wB,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,WAEFt5C,YAAa,gFACb0sG,SAAU,CACR,gBACA,WACA,qBACA,aAEFE,QAAS,CACP,MACA,QACA,MACA,U7D2VF1sE,M8D5WuB,CACvBjvC,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,WACA,kBAEFt5C,YAAa,yCACb0sG,SAAU,CACR,aACA,kBACA,aACA,kBACA,yBAEFE,QAAS,CACP,MACA,MACA,OACA,U9D0VF5qF,M+D7WuB,CACvB/wB,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,YAEFt5C,YAAa,4CACb0sG,SAAU,CACR,iBACA,eACA,SACA,uBACA,kBAEFE,QAAS,CACP,MACA,Q/D8VFxwF,IgE9WqB,CACrBnrB,KAAM,MACNykC,SAAU,YACV4jB,OAAQ,CACN,QACA,UACA,aAEFt5C,YACI,gEACJ0sG,SAAU,CACR,QACA,SACA,WACA,mBACA,WACA,YAEFE,QAAS,CAAC,WhE6VVhsE,SiE/W0B,CAC1B3vC,KAAM,WACNykC,SAAU,YACV4jB,OAAQ,CACN,QACA,kBAEFt5C,YAAa,uBACb0sG,SAAU,CACR,gBACA,UACA,YACA,cACA,cAEFE,QAAS,CACP,WjEgWF7tC,KkEhXsB,CACtB9tE,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,UACA,cAEFt5C,YAAa,oDACb0sG,SAAU,CACR,YACA,aACA,eACA,6BACA,8BACA,kBACA,4BACA,gCACA,kClEgWF3U,QmEjXyB,CACzB9mG,KAAM,UACNykC,SAAU,aACV4jB,OAAQ,CACN,aACA,oBAEFt5C,YAAa,qJAGb0sG,SAAU,CACR,QACA,iBACA,gBACA,WAEFE,QAAS,CACP,WACA,MACA,SnE+VF5U,SoElX0B,CAC1B/mG,KAAM,WACNykC,SAAU,aACV4jB,OAAQ,CACN,cACA,qBAEFt5C,YAAc,2LAMd0sG,SAAU,CACR,cACA,kBAEFE,QAAS,CACP,OACA,MACA,YpE+VFjlG,IqEnXqB,CACrB1W,KAAM,MACNykC,SAAU,YACV4jB,OAAQ,CACN,QACA,aAEFt5C,YACI,uCACJ0sG,SAAU,CACR,MACA,QACA,oBAEFE,QAAS,CACP,WACA,UACA,WACA,SrEkWFpjG,MsEpXuB,CACvBvY,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,WACA,eAEFt5C,YACI,4LACJ0sG,SAAU,CACR,aACA,aACA,cACA,cACA,eACA,uBAEFE,QAAS,CAAC,OAAQ,QAAS,QtEoW3BhtF,KuErXsB,CACtB3uB,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,WAEFt5C,YACI,iGACJ0sG,SAAU,CACR,YACA,aACA,WAEFE,QAAS,CACP,QvEwWF5kG,KwEtXsB,CACtB/W,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,WAEFt5C,YACI,+EACJ0sG,SAAU,CACR,WACA,QACA,YAEFE,QAAS,CACP,SACA,QACA,WACA,UACA,WACA,QxEoWFpU,MyEvXuB,CACvBvnG,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,YAEFt5C,YACI,+IACJ0sG,SAAU,CACR,2BAEFE,QAAS,CACP,OACA,MACA,SACA,azEyWF3U,O0ExXwB,CACxBhnG,KAAM,SACNykC,SAAU,aACV4jB,OAAQ,CACN,aAEFt5C,YACI,2DACJ0sG,SAAU,CACR,YACA,UACA,MACA,SAEFE,QAAS,CACP,WACA,MACA,OACA,S1EuWF9tF,S2EzX0B,CAC1B7tB,KAAM,WACNykC,SAAU,YACV4jB,OAAQ,CACN,QACA,kBAEFt5C,YAAa,uBACb0sG,SAAU,CACR,cACA,QACA,YACA,YACA,iBAEFE,QAAS,CACP,Q3E0WFr/C,W4E1X4B,CAC5Bt8D,KAAM,aACNykC,SAAU,YACV4jB,OAAQ,CACN,KACA,iBAEFt5C,YACI,yEACJ0sG,SAAU,CACR,OACA,UACA,SAEFE,QAAS,CACP,MAAO,WAAY,c5E4WrB5V,U6E3X2B,CAC3B/lG,KAAM,YACNykC,SAAU,YACV4jB,OAAQ,CACN,KACA,gBAEFt5C,YACI,4CACJ0sG,SAAU,CACR,QACA,QAEFE,QAAS,CACP,MAAO,WAAY,e7E8WrB13C,K8E5XsB,CACtBjkE,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,cAEFt5C,YAAa,iLACb0sG,SAAU,CACR,cACA,aACA,sBAEFE,QAAS,CAAC,MAAO,Q9EiXjBv3C,O+E7XwB,CACxBpkE,KAAM,SACNykC,SAAU,aACV4jB,OAAQ,CACN,gBAEFt5C,YAAa,wGACb0sG,SAAU,CACR,oBACA,kBACA,mCAEFE,QAAS,CAAC,MAAO,S/EoXjBpV,OgFhYwB,CACxBvmG,KAAM,SACNykC,SAAU,UACV4jB,OAAQ,CACN,QACA,gBAEFt5C,YAAa,6QACb0sG,SAAU,CACR,QACA,kBACA,oBAEFE,QAAS,CACP,SAAU,QAAS,SAAU,YAAa,kBAAmB,kBhFmX/D3V,OiFjYwB,CACxBhmG,KAAM,SACNykC,SAAU,UACV4jB,OAAQ,CACN,KACA,aAEFt5C,YAAa,8IACb0sG,SAAU,CACR,KACA,KACA,sBAEFE,QAAS,CACP,SAAU,QAAS,SAAU,YAAa,kBAAmB,kBjFoX/DnV,MkFlYuB,CACvBxmG,KAAM,QACNykC,SAAU,UACV4jB,OAAQ,CACN,QACA,eAEFt5C,YAAa,8PACb0sG,SAAU,CACR,QACA,uBAEFE,QAAS,CACP,SAAU,SAAU,SAAU,YAAa,kBAAmB,kBlFsXhE91C,OmFnYwB,CACxB7lE,KAAM,SACNykC,SAAU,UACV4jB,OAAQ,CACN,gBAEFt5C,YAAa,mRACb0sG,SAAU,CACR,cACA,wBAEFE,QAAS,CACP,SAAU,SAAU,QAAS,YAAa,kBAAmB,kBnFwX/DxV,UoFpY2B,CAC3BnmG,KAAM,YACNykC,SAAU,UACV4jB,OAAQ,CACN,SACA,mBAEFt5C,YAAa,+DACb0sG,SAAU,CACR,SACA,UAEFE,QAAS,CACP,SAAU,SAAU,QAAS,SAAU,kBAAmB,kBpFwX5DvV,gBqFrYiC,CACjCpmG,KAAM,kBACNykC,SAAU,UACV4jB,OAAQ,CACN,SACA,yBAEFt5C,YAAa,mEACb0sG,SAAU,CACR,SACA,SACA,YAEFE,QAAS,CACP,SAAU,SAAU,QAAS,SAAU,YAAa,kBrFwXtDtV,csFtY+B,CAC/BrmG,KAAM,gBACNykC,SAAU,UACV4jB,OAAQ,CACN,UACA,uBAEFt5C,YAAa,gEACb0sG,SAAU,CACR,UACA,SACA,aAEFE,QAAS,CACP,SAAU,SAAU,QAAS,SAAU,YAAa,oBtF2XtD1U,YuFzY6B,CAC7BjnG,KAAM,cACNykC,SAAU,gBACV4jB,OAAQ,CACN,kBAEFt5C,YAAa,2NACb0sG,SAAU,CACR,iBACA,kBAEFE,QAAS,CAAC,evF+XVzU,QwF1YyB,CACzBlnG,KAAM,UACNykC,SAAU,gBACV4jB,OAAQ,CACN,cAEFt5C,YAAa,0KACb0sG,SAAU,CACR,aACA,cAEFE,QAAS,CAAC,gBxFgYVyE,YyF3Y6B,CAC7BpgH,KAAM,cACNykC,SAAU,gBACV4jB,OAAQ,CACN,qBAEFt5C,YAAa,wIACb0sG,SAAU,CACR,qBAEFE,QAAS,CAAC,iBzFkYVxU,W0F5Y4B,CAC5BnnG,KAAM,aACNykC,SAAU,gBACV4jB,OAAQ,CACN,oBAEFt5C,YAAa,kRACb0sG,SAAU,CACR,oBAEFE,QAAS,CAAC,gB1FqYVrrF,O2F/YwB,CACxBtwB,KAAM,SACNykC,SAAU,OACV4jB,OAAQ,CACN,WACA,mBAEFt5C,YAAa,6CACb0sG,SAAU,CACR,WACA,YACA,+BACA,aAEFE,QAAS,I3FkYT0E,O4FhZwB,CACxBrgH,KAAM,SACNykC,SAAU,OACV4jB,OAAQ,CACN,oBACA,8BAEFt5C,YAAa,gDACb0sG,SAAU,CACR,4CACA,UACA,cAEFE,QAAS,I5FoYTx6E,M6FjZuB,CACvBnhC,KAAM,QACNykC,SAAU,OACV4jB,OAAQ,CACN,oBACA,2BAEFt5C,YAAa,2BACb0sG,SAAU,CACR,yCACA,YACA,mBAEFE,QAAS,I7FuYTlrG,I8FpZqB,CACrBzQ,KAAM,MACNykC,SAAU,UACV4jB,OAAQ,CACN,UAEFt5C,YACI,iGACJ0sG,SAAU,CACR,cACA,cACA,eAEFE,QAAS,CACP,KACA,KACA,OACA,Q9FoYFzrC,K+FrZsB,CACtBlwE,KAAM,OACNykC,SAAU,UACV4jB,OAAQ,CACN,WAEFt5C,YACI,gGACJ0sG,SAAU,CACR,eACA,eACA,eAEFE,QAAS,CACP,KACA,KACA,MACA,Q/FqYF9kG,GgGtZoB,CACpB7W,KAAM,KACNykC,SAAU,UACV4jB,OAAQ,CACN,SAEFt5C,YAAa,yCACb0sG,SAAU,CACR,aACA,aACA,YACA,WAEFE,QAAS,CACP,KACA,OACA,MACA,QhGsYF7kG,GiGvZoB,CACpB9W,KAAM,KACNykC,SAAU,UACV4jB,OAAQ,CACN,SAEFt5C,YAAa,8CACb0sG,SAAU,CACR,aACA,aACA,YACA,WAEFE,QAAS,CACP,KACA,OACA,MACA,QjGyYFxe,SkG1Z0B,CAC1Bn9F,KAAM,WACNykC,SAAU,aACV4jB,OAAQ,CACN,uBACA,wCAEFt5C,YAAa,uDACb0sG,SAAU,CACR,oBACA,+BAEFE,QAAS,IlG+YT2E,KmG3ZsB,CACtBtgH,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,eACA,gBAEFt5C,YAAa,oDACb0sG,SAAU,CACR,aACA,mBAEFE,QAAS,InGkZT4E,SoG9Z0B,CAC1BvgH,KAAM,WACNykC,SAAU,WACV4jB,OAAQ,CACN,+BACA,kCAEFt5C,YAAa,wDACb0sG,SAAU,CACR,yBACA,4BAEFE,QAAS,IpGmZT6E,UqG/Z2B,CAC3BxgH,KAAM,YACNykC,SAAU,WACV4jB,OAAQ,CACN,wCACA,kCAEFt5C,YAAa,0DACb0sG,SAAU,CACR,gDACA,mDAEFE,QAAS,IrGsZTlV,IsGlaqB,CACrBzmG,KAAM,MACNykC,SAAU,UACV4jB,OAAQ,CACN,UACA,aAEFt5C,YAAa,uFACb0sG,SAAU,CACR,iBACA,gBACA,WAEFE,QAAS,CACP,MAAO,KAAM,QtGqZfrlC,IuGnaqB,CACrBt2E,KAAM,MACNykC,SAAU,UACV4jB,OAAQ,CACN,QACA,UAEFt5C,YAAa,0DACb0sG,SAAU,CACR,WACA,YACA,QACA,SAEFE,QAAS,CACP,MAAO,KAAM,QvGqZfhV,GwGpaoB,CACpB3mG,KAAM,KACNykC,SAAU,UACV4jB,OAAQ,CACN,SACA,YAEFt5C,YAAa,mFACb0sG,SAAU,CACR,gBACA,iBACA,UAEFE,QAAS,CACP,MAAO,MAAO,QxGuZhBjV,IyGraqB,CACrB1mG,KAAM,MACNykC,SAAU,UACV4jB,OAAQ,CACN,UACA,aAEFt5C,YAAa,2GACb0sG,SAAU,CACR,iBACA,kBACA,gBACA,WAEFE,QAAS,CACP,MAAO,MAAO,OzGyZhBtrG,O0GxawB,CACxBrQ,KAAM,SACNykC,SAAU,SACV4jB,OAAQ,CACN,uBACA,6BAEFt5C,YAAa,iKACb0sG,SAAU,CACR,mBACA,mBACA,eACA,kBACA,mBAEFE,QAAS,CACP,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U1GyZxG3rE,M2GzauB,CACvBhwC,KAAM,QACNykC,SAAU,SACV4jB,OAAQ,CACN,YAEFt5C,YAAa,6DACb0sG,SAAU,CACR,yBACA,WACA,UACA,wBAEFE,QAAS,CACP,S3G4ZFvU,M4G1auB,CACvBpnG,KAAM,QACNykC,SAAU,SACV4jB,OAAQ,CACN,eAEFt5C,YAAa,0EACb0sG,SAAU,CACR,+BACA,+BACA,gCAEFE,QAAS,CACP,WACA,Q5G6ZFtzC,O6G3awB,CACxBroE,KAAM,SACNykC,SAAU,SACV4jB,OAAQ,CACN,oBAEFt5C,YAAa,0CACb0sG,SAAU,CACR,uBACA,eACA,gBAEFE,QAAS,CAAC,MAAO,sB7GgajBlhB,W8G5a4B,CAC5Bz6F,KAAM,aACNykC,SAAU,SACV4jB,OAAQ,CACN,KACA,iBAEFt5C,YAAa,2CACb0sG,SAAU,CACR,yBACA,KACA,iBAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,U9G+ZrGtU,I+G7aqB,CACrBrnG,KAAM,MACNykC,SAAU,SACV4jB,OAAQ,CACN,UAEFt5C,YAAa,wCACb0sG,SAAU,CACR,oBACA,uCAEFE,QAAS,CACP,SAAU,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U/Gka3G8E,KgH9asB,CACtBzgH,KAAM,OACNykC,SAAU,SACV4jB,OAAQ,CACN,UACA,cAEFt5C,YAAa,4aACb0sG,SAAU,CACR,YACA,eACA,kCACA,WAEFE,QAAS,CACP,SAAU,MAAO,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UhHga1Gn0D,KiH/asB,CACtBxnD,KAAM,OACNykC,SAAU,SACV4jB,OAAQ,CACN,YACA,kBAEFt5C,YAAa,CACX,kFACA,2GACA,mEACA,oEACA,0DACA,+HAEF0sG,SAAU,CACR,wBACA,2BACA,gCACA,yBACA,4BACA,4BACA,uCACA,oCACA,qCAGFE,QAAS,CAAC,WAAY,oBjHqZtBz0D,IkHhbqB,CACrBlnD,KAAM,MACNykC,SAAU,SACV4jB,OAAQ,CACN,YACA,SAEFt5C,YAAa,6LAGb0sG,SAAU,CACR,4BACA,yBAEFE,QAAS,CACP,WACA,UlHiaF+E,kBmHjbmC,CACnC1gH,KAAM,oBACNykC,SAAU,SACV4jB,OAAQ,CACN,wBAEFt5C,YAAa,iOAIb0sG,SAAU,CACR,+BACA,wCACA,iCACA,wCAEFE,QAAS,CAAC,SAAU,SAAU,WnHka9B5oC,SoHlb0B,CAC1B/yE,KAAM,WACNykC,SAAU,SACV4jB,OAAQ,CACN,cACA,iBACA,oBAEFt5C,YAAa,yGACb0sG,SAAU,CACR,cACA,iBACA,yBACA,qBAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UpHmatGxiG,OqHnbwB,CACxBnZ,KAAM,SACNykC,SAAU,SACV4jB,OAAQ,CACN,mBAEFt5C,YAAa,4BACb0sG,SAAU,CACR,wBACA,wCACA,oCAEFE,QAAS,CAAC,OAAQ,MAAO,YrHwazB55D,QsHpbyB,CACzB/hD,KAAM,UACNykC,SAAU,SACV4jB,OAAQ,CACN,cAEFt5C,YAAa,uEACb0sG,SAAU,CACR,yBACA,UACA,iBACA,WAEFE,QAAS,CACP,SAAU,SAAU,OAAQ,YtHua9Br4G,QuHrbyB,CACzBtD,KAAM,UACNykC,SAAU,SACV4jB,OAAQ,CACN,wBAEFt5C,YAAa,0FACb0sG,SAAU,CACR,oBACA,4EACA,uCACA,gBAEFE,QAAS,CAAC,MAAO,OAAQ,WvHyazBrgD,IwHtbqB,CACrBt7D,KAAM,MACNykC,SAAU,SACV4jB,OAAQ,CACN,UAEFt5C,YAAa,oCACb0sG,SAAU,CACR,oBACA,SACA,SAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UxH0a3GjhB,KyHvbsB,CACtB16F,KAAM,OACNykC,SAAU,SACV4jB,OAAQ,CACN,WAEFt5C,YAAa,wEACb0sG,SAAU,CACR,8BAEFE,QAAS,CACP,QzH6aFgF,K0HxbsB,CACtB3gH,KAAM,OACNykC,SAAU,SACV4jB,OAAQ,CACN,cAEFt5C,YAAa,6DACb0sG,SAAU,CACR,2CACA,wBAEFE,QAAS,CACP,WAAY,MAAO,U1H6arBiF,mB2HzboC,CACpC5gH,KAAM,qBACNykC,SAAU,SACV4jB,OAAQ,CACN,oCACA,4CACA,sDACA,4CACA,uDAEFt5C,YAAa,qEACb0sG,SAAU,CACR,qBACA,+BACA,kCACA,8CACA,mCAEFE,QAAS,CACP,SAAU,iBAAkB,oBAAqB,U3HuanDkF,e4H1bgC,CAChC7gH,KAAM,iBACNykC,SAAU,SACV4jB,OAAQ,CACN,8BACA,kCACA,yCAEFt5C,YAAa,yDACb0sG,SAAU,CACR,4CAEFE,QAAS,CACP,SAAU,oBAAqB,qBAAsB,U5H8avDmF,kB6H3bmC,CACnC9gH,KAAM,oBACNykC,SAAU,SACV4jB,OAAQ,CACN,iCACA,qCACA,4CAEFt5C,YAAa,4DACb0sG,SAAU,CACR,+CAEFE,QAAS,CACP,SAAU,iBAAkB,qBAAsB,U7H+apDh5G,I8H5bqB,CACrB3C,KAAM,MACNykC,SAAU,SACV4jB,OAAQ,CACN,oBAEFt5C,YAAa,qHACb0sG,SAAU,CACR,0BAEFE,QAAS,CAAC,SAAU,Y9HmbpBoF,K+H7bsB,CACtB/gH,KAAM,OACNykC,SAAU,SACV4jB,OAAQ,CACN,UACA,aACA,qBACA,YACA,eACA,wBAEFt5C,YAAa,mCACb0sG,SAAU,CACR,UACA,aACA,oBACA,yBACA,iBAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U/H0a1GqF,gBgI9biC,CACjChhH,KAAM,kBACNykC,SAAU,SACV4jB,OAAQ,CACN,wBACA,kCAEFt5C,YAAa,uIACb0sG,SAAU,CACR,iCACA,4CAEFE,QAAS,CAAC,ShImbV5qD,MiI/buB,CACvB/wD,KAAM,QACNykC,SAAU,OACV4jB,OAAQ,CACN,YACA,iBACA,oBACA,0BACA,iBAEFt5C,YACI,iFACJ0sG,SAAU,CACR,MACA,UACA,cACA,kBACA,gBACA,+BACA,eAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,OAAQ,UAAW,SAAU,QAAS,YAAa,UjI0azGryD,OkIhcwB,CACxBtpD,KAAM,SACNykC,SAAU,SACV4jB,OAAQ,CACN,kBACA,iCAEFt5C,YAAa,mBACb0sG,SAAU,CACR,2BACA,uBACA,2BACA,oBACA,6BAEFE,QAAS,CACP,OAAQ,SAAU,UAAW,YlIib/B/xD,QmIjcyB,CACzB5pD,KAAM,UACNykC,SAAU,SACV4jB,OAAQ,CACN,qBAEFt5C,YAAa,qEACb0sG,SAAU,CACR,sCACA,oCACA,kCAEFE,QAAS,CACP,OAAQ,UAAW,WnIqbrBsF,OoIlcwB,CACxBjhH,KAAM,SACNykC,SAAU,SACV4jB,OAAQ,CACN,mBACA,uBAEFt5C,YAAa,2JAEb0sG,SAAU,CACR,8BACA,wCACA,8CACA,+DAEFE,QAAS,CACP,SAAU,mBpImbZnuC,eqIncgC,CAChCxtE,KAAM,iBACNykC,SAAU,SACV4jB,OAAQ,CACN,wBACA,2BACA,oCAEFt5C,YAAa,2JAEb0sG,SAAU,CACR,yBACA,2CACA,kDAEFE,QAAS,CACP,MAAO,QrIobT1pD,IsIpcqB,CACrBjyD,KAAM,MACNykC,SAAU,SACV4jB,OAAQ,CACN,iBAEFt5C,YAAa,uCACb0sG,SAAU,CACR,uBACA,YACA,aAEFE,QAAS,CAAC,SAAU,mBtIybpB5sE,KuIrcsB,CACtB/uC,KAAM,OACNykC,SAAU,SACV4jB,OAAQ,CACN,WAEFt5C,YAAa,kCACb0sG,SAAU,CACR,YACA,sBACA,yBACA,UACA,aAEFE,QAAS,CACP,SAAU,QAAS,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,UAAW,SAAU,QAAS,YAAa,UvIubnHn+F,KwItcsB,CACtBxd,KAAM,OACNykC,SAAU,SACV4jB,OAAQ,CACN,UACA,oBAEFt5C,YAAa,2GACb0sG,SAAU,CACR,mBACA,6BACA,+CACA,iDACA,qCAEFE,QAAS,CAAC,MAAO,SAAU,YxIwb3BhxD,QyIvcyB,CACzB3qD,KAAM,UACNykC,SAAU,SACV4jB,OAAQ,CACN,cAEFt5C,YAAa,6DACb0sG,SAAU,CACR,mBACA,mBACA,mBACA,oBAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,SAAU,QAAS,YAAa,UzI0bvGtrD,O0IxcwB,CACxBrwD,KAAM,SACNykC,SAAU,SACV4jB,OAAQ,CACN,eACA,6BACA,yBACA,uCAEFt5C,YAAa,igBASb0sG,SAAU,CACR,mBACA,SACA,qBACA,mBACA,YACA,UACA,UACA,oCACA,KAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,QAAS,YAAa,U1I2axGnU,M2IzcuB,CACvBxnG,KAAM,QACNykC,SAAU,SACV4jB,OAAQ,CACN,YAEFt5C,YAAa,oGACb0sG,SAAU,CACR,mCACA,YAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,YAAa,U3I8bzG1rC,U4I1c2B,CAC3BjwE,KAAM,YACNykC,SAAU,SACV4jB,OAAQ,CACN,KACA,gBAEFt5C,YAAa,qBACb0sG,SAAU,CACR,yBACA,KACA,gBAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,U5I6brG10D,M6I3cuB,CACvBjnD,KAAM,QACNykC,SAAU,SACV4jB,OAAQ,CACN,WACA,cACA,sBACA,aACA,gBACA,yBAEFt5C,YAAa,oCACb0sG,SAAU,CACR,WACA,cACA,yBACA,kBAEFE,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,c7I2brGlU,a8I9c8B,CAC9BznG,KAAM,eACNykC,SAAU,cACV4jB,OAAQ,CACN,sBAEFt5C,YAAa,kEACb0sG,SAAU,CACR,sBAEFE,QAAS,CAAC,sBAAuB,eAAgB,c9IqcjDjU,oB+I/cqC,CACrC1nG,KAAM,sBACNykC,SAAU,cACV4jB,OAAQ,CACN,6BAEFt5C,YAAa,qFACb0sG,SAAU,CACR,6BAEFE,QAAS,CAAC,eAAgB,eAAgB,c/Iuc1C9V,UgJjd2B,CAC3B7lG,KAAM,YACNykC,SAAU,cACV4jB,OAAQ,CACN,KACA,gBAEFt5C,YAAa,mCACb0sG,SAAU,CACR,KACA,oBACA,MAEFE,QAAS,CAAC,eAAgB,sBAAuB,eAAgB,UhJqcjE9Y,MiJlduB,CACvB7iG,KAAM,QACNykC,SAAU,cACV4jB,OAAQ,CACN,YAEFt5C,YAAa,6IACb0sG,SAAU,CACR,WACA,KACA,aACA,YAEFE,QAAS,CAAC,cjJscVuF,akJnd8B,CAC9BlhH,KAAM,eACNykC,SAAU,cACV4jB,OAAQ,CACN,sBAEFt5C,YAAa,6EACb0sG,SAAU,CACR,8CAEFE,QAAS,IlJ0cTwF,YmJpd6B,CAC7BnhH,KAAM,cACNykC,SAAU,cACV4jB,OAAQ,CACN,kBAEFt5C,YAAa,4OACb0sG,SAAU,CACR,0BAEFE,QAAS,CAAC,eAAgB,cnJ2c1ByF,aoJrd8B,CAC9BphH,KAAM,eACNykC,SAAU,cACV4jB,OAAQ,CACN,kBACA,sBAEFt5C,YAAa,kEACb0sG,SAAU,CACR,kBACA,sBAEFE,QAAS,CAAC,eAAgB,sBAAuB,cpJ0cjD0F,WqJtd4B,CAC5BrhH,KAAM,aACNykC,SAAU,cACV4jB,OAAQ,CACN,oBACA,4BACA,6BACA,qCACA,sCAEFt5C,YACI,0CACJ0sG,SAAU,CACR,mBACA,2BACA,8BACA,yCACA,4CACA,6CAEFE,QAAS,CAAC,SAAU,crJmcpB3qF,OsJvdwB,CACxBhxB,KAAM,SACNykC,SAAU,cACV4jB,OAAQ,CACN,WACA,cACA,mBACA,eACA,oBACA,0BAEFt5C,YACI,0BACJ0sG,SAAU,CACR,WACA,iBACA,kBAEFE,QAAS,CAAC,aAAc,ctJscxB2F,UuJxd2B,CAC3BthH,KAAM,YACNykC,SAAU,cACV4jB,OAAQ,CACN,iBACA,sBACA,kBACA,uBACA,6BAEFt5C,YACI,iCACJ0sG,SAAU,CACR,oBACA,yBAEFE,QAAS,CAAC,aAAc,WvJ2cxBjuF,QwJ3dyB,CACzB1tB,KAAM,UACNykC,SAAU,aACV4jB,OAAQ,CACN,iBAEFt5C,YACI,8EAEJ0sG,SAAU,CACR,gBACA,gBACA,gBACA,qBACA,yBAEFE,QAAS,CACP,QAAS,UAAW,UAAW,YAAa,WAAY,iBAAkB,gBxJ2c5E9kC,eyJ5dgC,CAChC72E,KAAM,iBACNykC,SAAU,aACV4jB,OAAQ,CACN,wBAEFt5C,YACI,0HAEJ0sG,SAAU,CACR,uBACA,uBACA,uBACA,4BACA,4BACA,iCACA,uCACA,oCACA,iCACA,kCAEFE,QAAS,CACP,QAAS,UAAW,UAAW,YAAa,WAAY,UAAW,gBzJucrElzD,Y0J7d6B,CAC7BzoD,KAAM,cACNykC,SAAU,aACV4jB,OAAQ,CACN,qBAEFt5C,YACI,uHAEJ0sG,SAAU,CACR,wBACA,wBACA,wBACA,yBACA,qBACA,iBACA,4BACA,qCAEFE,QAAS,CACP,UAAW,mB1J0cb4F,U2J9d2B,CAC3BvhH,KAAM,YACNykC,SAAU,aACV4jB,OAAQ,CACN,mBAEFt5C,YACI,+IACJ0sG,SAAU,CACR,8BACA,6BAEFE,QAAS,CACP,QAAS,UAAW,UAAW,SAAU,YAAa,WAAY,Y3JkdpEz3C,M4J/duB,CACvBlkE,KAAM,QACNykC,SAAU,aACV4jB,OAAQ,CACN,SACA,eAEFt5C,YACI,wFACJ0sG,SAAU,CACR,WACA,WACA,UACA,YACA,SACA,gBAEFE,QAAS,CACP,UAAW,UAAW,SAAU,YAAa,WAAY,UAAW,YAAa,c5J8cnF6F,U6Jhe2B,CAC3BxhH,KAAM,YACNykC,SAAU,aACV4jB,OAAQ,CACN,mBAEFt5C,YACI,uHACJ0sG,SAAU,CACR,8BACA,sBACA,uBACA,2BACA,mCAEFE,QAAS,CACP,UAAW,iBAAkB,cAAe,U7Jid9CtvC,O8JjewB,CACxBrsE,KAAM,SACNykC,SAAU,aACV4jB,OAAQ,CACN,QACA,gBAEFt5C,YACI,2FACJ0sG,SAAU,CACR,QACA,UACA,UACA,YACA,UACA,UACA,iBAEFE,QAAS,CACP,QAAS,UAAW,UAAW,YAAa,WAAY,Y9J+c1DrvC,S+Jle0B,CAC1BtsE,KAAM,WACNykC,SAAU,aACV4jB,OAAQ,CACN,SACA,kBAEFt5C,YACI,yGACJ0sG,SAAU,CACR,WACA,UACA,UACA,YACA,YAEFE,QAAS,CACP,QAAS,UAAW,YAAa,UAAW,Y/Jkd9Cx3C,QgKneyB,CACzBnkE,KAAM,UACNykC,SAAU,aACV4jB,OAAQ,CACN,QACA,iBAEFt5C,YACI,mGACJ0sG,SAAU,CACR,QACA,UACA,UACA,YACA,UACA,iBAEFE,QAAS,CACP,QAAS,UAAW,SAAU,YAAa,WAAY,YhKkdzDvvC,UiKpe2B,CAC3BpsE,KAAM,YACNykC,SAAU,aACV4jB,OAAQ,CACN,SACA,mBAEFt5C,YACI,0GACJ0sG,SAAU,CACR,WACA,UACA,UACA,YACA,YAEFE,QAAS,CACP,QAAS,UAAW,SAAU,UAAW,WAAY,YjKodvDrV,QkKreyB,CACzBtmG,KAAM,UACNykC,SAAU,aACV4jB,OAAQ,CACN,SACA,iBAEFt5C,YACI,uGACJ0sG,SAAU,CACR,WACA,WACA,UACA,YACA,SACA,eACA,kBAEFE,QAAS,CACP,QAAS,UAAW,SAAU,YAAa,WAAY,UAAW,clKqdpE8F,amKxe8B,CAC9BzhH,KAAM,eACNykC,SAAU,MACV4jB,OAAQ,CACN,4BAEFt5C,YACI,8LACJ0sG,SAAU,CACR,gCAEFE,QAAS,CACP,WAAY,eAAgB,gBAAiB,gBnK6d/C1hB,coKze+B,CAC/Bj6F,KAAM,gBACNykC,SAAU,MACV4jB,OAAQ,CACN,6BAEFt5C,YACI,8LACJ0sG,SAAU,CACR,4CACA,qDAEFE,QAAS,CACP,WAAY,eAAgB,qBpK6d9B+F,YqK1e6B,CAC7B1hH,KAAM,cACNykC,SAAU,MACV4jB,OAAQ,CACN,oBAEFt5C,YACI,2IACJ0sG,SAAU,CACR,mCAEFE,QAAS,CACP,oBrK+dFxhB,asK3e8B,CAC9Bn6F,KAAM,eACNykC,SAAU,MACV4jB,OAAQ,CACN,4BAEFt5C,YACI,wIACJ0sG,SAAU,CACR,2CACA,oDAEFE,QAAS,CACP,WAAY,kBtK+ddgG,YuK5e6B,CAC7B3hH,KAAM,cACNykC,SAAU,MACV4jB,OAAQ,CACN,2BAEFt5C,YACI,wMACJ0sG,SAAU,CACR,oCACA,qCAEFE,QAAS,CACP,WAAY,eAAgB,kBvKge9BiG,gBwK7eiC,CACjC5hH,KAAM,kBACNykC,SAAU,MACV4jB,OAAQ,CACN,iCAEFt5C,YACI,kJACJ0sG,SAAU,CACR,mCACA,oCAEFE,QAAS,CACP,cAAe,YxKiejBkG,YyK9e6B,CAC7B7hH,KAAM,cACNykC,SAAU,MACV4jB,OAAQ,CACN,oBAEFt5C,YACI,gMACJ0sG,SAAU,CACR,0BAEFE,QAAS,CACP,iBzKmeFmG,Q0K/eyB,CACzB9hH,KAAM,UACNykC,SAAU,MACV4jB,OAAQ,CACN,eACA,wBAEFt5C,YACI,sNACJ0sG,SAAU,CACR,wBACA,+BAEFE,QAAS,CACP,WAAY,eAAgB,kB1Kke9BvhB,iB2KhfkC,CAClCp6F,KAAM,mBACNykC,SAAU,MACV4jB,OAAQ,CACN,gCAEFt5C,YACI,gJACJ0sG,SAAU,CACR,+CACA,wDAEFE,QAAS,CACP,WAAY,eAAgB,kB3Koe9BoG,S4Kjf0B,CAC1B/hH,KAAM,WACNykC,SAAU,MACV4jB,OAAQ,CACN,wBAEFt5C,YACI,iIACJ0sG,SAAU,CACR,uCACA,gDAEFE,QAAS,CACP,eAAgB,kB5KuelBhU,I6KpfqB,CACrB3nG,KAAM,MACNykC,SAAU,UACV4jB,OAAQ,CACN,UAEFt5C,YAAa,6GACb0sG,SAAU,CACR,WACA,YACA,UAEFE,QAAS,I7K2eTqG,O8KvfwB,CACxBhiH,KAAM,SACNykC,SAAU,aACV4jB,OAAQ,CACN,uBACA,aAEFt5C,YAAa,4CACb0sG,SAAU,CACR,qBACA,uBACA,uBACA,0BACA,2BAEFE,QAAS,CACP,MACA,OACA,SACA,MACA,OACA,MACA,MACA,a9KieFsG,I+KxfqB,CACrBjiH,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,oBACA,UAEFt5C,YAAa,8KACb0sG,SAAU,CACR,kBACA,kBAEFE,QAAS,CACP,OACA,SACA,MACA,Q/KyeFnsG,IgLzfqB,CACrBxP,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,oBACA,SACA,eAEFt5C,YAAa,iDACb0sG,SAAU,CACR,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFE,QAAS,CACP,OACA,SACA,MACA,OACA,MACA,MACA,ahLieFuG,KiL1fsB,CACtBliH,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,qBACA,UACA,gBAEFt5C,YAAa,mDACb0sG,SAAU,CACR,mBACA,qBACA,qBACA,wBACA,wBACA,8BAEFE,QAAS,CACP,MACA,SACA,MACA,OACA,MACA,MACA,ajLmeFwG,OkL3fwB,CACxBniH,KAAM,SACNykC,SAAU,aACV4jB,OAAQ,CACN,uBACA,aAEFt5C,YAAa,mLACb0sG,SAAU,CACR,kBACA,yBAEFE,QAAS,CACP,MACA,OACA,MACA,OACA,MACA,MACA,WACA,gBlLweFppG,ImL5fqB,CACrBvS,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,oBACA,SACA,eAEFt5C,YAAa,iDACb0sG,SAAU,CACR,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFE,QAAS,CACP,MACA,OACA,SACA,OACA,MACA,MACA,anLoeF/6G,KoL7fsB,CACtBZ,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,qBACA,UACA,4BAEFt5C,YAAa,2HACb0sG,SAAU,CACR,sBACA,8BACA,uBAEFE,QAAS,CACP,MACA,OACA,MACA,SACA,OACA,MACA,MACA,apLweF3tF,KqL9fsB,CACtBhuB,KAAM,OACNykC,SAAU,aACV4jB,OAAQ,CACN,qBACA,WAEFt5C,YAAa,qCACb0sG,SAAU,CACR,gBACA,kBACA,sBAEFE,QAAS,CACP,MACA,OACA,MACA,SACA,MACA,MACA,MACA,arL0eFyG,YsL/f6B,CAC7BpiH,KAAM,cACNykC,SAAU,aACV4jB,OAAQ,CACN,iCACA,gDACA,+BAEFt5C,YAAa,sWACb0sG,SAAU,CACR,kCACA,yCACA,gCACA,yCAEFE,QAAS,CACP,OACA,SACA,MACA,MACA,OACA,MACA,MACA,atLyeF0G,IuLhgBqB,CACrBriH,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,oBACA,SACA,yBAEFt5C,YAAa,iLACb0sG,SAAU,CACR,eACA,oBACA,mCACA,8BACA,2BAEFE,QAAS,CACP,MACA,OACA,MACA,SACA,OACA,MACA,avL0eFnsF,IwLjgBqB,CACrBxvB,KAAM,MACNykC,SAAU,aACV4jB,OAAQ,CACN,oBACA,UAEFt5C,YAAa,iCACb0sG,SAAU,CACR,kBACA,oBACA,qBAEFE,QAAS,CACP,MACA,OACA,SACA,MACA,OACA,MACA,MACA,axL6eF/T,SyLlgB0B,CAC1B5nG,KAAM,WACNykC,SAAU,aACV4jB,OAAQ,CACN,yBACA,cACA,8BAEFt5C,YAAa,gIACb0sG,SAAU,CACR,oBACA,yBACA,wCACA,mCACA,gCAEFE,QAAS,CACP,MACA,OACA,MACA,SACA,MACA,OACA,MACA,QzL6eFjkG,K0LrgBsB,CACtB1X,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,oDACb0sG,SAAU,CACR,YACA,kBAEFE,QAAS,CACP,MACA,OACA,S1LwfFxjG,M2LtgBuB,CACvBnY,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,YAEFt5C,YAAa,6FACb0sG,SAAU,CACR,cAEFE,QAAS,CACP,OACA,QACA,U3L0fF/kB,K4LvgBsB,CACtB52F,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,8CACb0sG,SAAU,CACR,YACA,iBACA,WAEFE,QAAS,CACP,MACA,S5L0fF7kB,M6LxgBuB,CACvB92F,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,YAEFt5C,YAAa,6GACb0sG,SAAU,CACR,WACA,cAEFE,QAAS,CACP,QACA,U7L4fF3kB,K8LzgBsB,CACtBh3F,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,8CACb0sG,SAAU,CACR,UACA,iBACA,aAEFE,QAAS,CACP,MACA,OACA,S9L2fFzkB,M+L1gBuB,CACvBl3F,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,YAEFt5C,YAAa,sGACb0sG,SAAU,CACR,cAEFE,QAAS,CACP,QACA,U/L+fFvkB,KgM3gBsB,CACtBp3F,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,2CACb0sG,SAAU,CACR,YACA,iBACA,WAEFE,QAAS,CACP,OACA,OACA,ShM6fFrkB,MiM5gBuB,CACvBt3F,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,YAEFt5C,YAAa,2CACb0sG,SAAU,CACR,cAEFE,QAAS,CACP,QACA,UjMigBFhkG,KkM7gBsB,CACtB3X,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,kDACb0sG,SAAU,CACR,YACA,kBAEFE,QAAS,CACP,MACA,OACA,SlMggBFzjG,MmM9gBuB,CACvBlY,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,YAEFt5C,YAAa,8FACb0sG,SAAU,CACR,cAEFE,QAAS,CACP,QACA,UnMmgBFlkG,KoM/gBsB,CACtBzX,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,qDACb0sG,SAAU,CACR,YACA,kBAEFE,QAAS,CACP,MACA,OACA,SpMkgBF1jG,MqMhhBuB,CACvBjY,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,YAEFt5C,YAAa,mGACb0sG,SAAU,CACR,cAEFE,QAAS,CACP,QACA,UrMqgBFhlG,MsMjhBuB,CACvB3W,KAAM,QACNykC,SAAU,eACV4jB,OAAQ,CACN,eAEFt5C,YACI,qEACJ0sG,SAAU,CACR,mBACA,wBACA,iBACA,iBACA,eAEFE,QAAS,CACP,MACA,MACA,QtMggBF1lG,IuMlhBqB,CACrBjW,KAAM,MACNykC,SAAU,eACV4jB,OAAQ,CACN,UAEFt5C,YAAa,sCACb0sG,SAAU,CACR,SACA,kBACA,eACA,cACA,2BAEFE,QAAS,CACP,OACA,MACA,QvMkgBF3mG,KwMnhBsB,CACtBhV,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,iDACb0sG,SAAU,CACR,aAEFE,QAAS,CACP,OACA,OACA,SxMugBF3jB,IyMphBqB,CACrBh4F,KAAM,MACNykC,SAAU,eACV4jB,OAAQ,CACN,UAEFt5C,YAAa,6DACb0sG,SAAU,CACR,SACA,cAEFE,QAAS,CACP,MACA,MACA,QzMugBFzjB,K0MrhBsB,CACtBl4F,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,oDACb0sG,SAAU,CACR,UACA,eAEFE,QAAS,CACP,OACA,OACA,S1MwgBFvjB,I2MthBqB,CACrBp4F,KAAM,MACNykC,SAAU,eACV4jB,OAAQ,CACN,UAEFt5C,YAAa,4DACb0sG,SAAU,CACR,SACA,cAEFE,QAAS,CACP,MACA,MACA,Q3MygBFrjB,K4MvhBsB,CACtBt4F,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,wEACb0sG,SAAU,CACR,UACA,eAEFE,QAAS,CACP,OACA,OACA,S5M0gBFvxB,I6MxhBqB,CACrBpqF,KAAM,MACNykC,SAAU,eACV4jB,OAAQ,CACN,UAEFt5C,YAAa,0DACb0sG,SAAU,CACR,SACA,cAEFE,QAAS,CACP,MACA,MACA,Q7M2gBFljB,K8MzhBsB,CACtBz4F,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,sEACb0sG,SAAU,CACR,UACA,eAEFE,QAAS,CACP,OACA,OACA,S9M4gBFzlG,I+M1hBqB,CACrBlW,KAAM,MACNykC,SAAU,eACV4jB,OAAQ,CACN,UAEFt5C,YAAa,oCACb0sG,SAAU,CACR,SACA,kBACA,cACA,cACA,2BAEFE,QAAS,CACP,OACA,MACA,Q/M0gBFzmG,KgN3hBsB,CACtBlV,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,+CACb0sG,SAAU,CACR,aAEFE,QAAS,CACP,OACA,ShNghBF9vF,IiN5hBqB,CACrB7rB,KAAM,MACNykC,SAAU,eACV4jB,OAAQ,CACN,UAEFt5C,YAAa,uCACb0sG,SAAU,CACR,WACA,sBACA,cACA,eAEFE,QAAS,CACP,OACA,MACA,QjN6gBF9yF,KkN7hBsB,CACtB7oB,KAAM,OACNykC,SAAU,eACV4jB,OAAQ,CACN,WAEFt5C,YAAa,kDACb0sG,SAAU,CACR,YACA,yBAEFE,QAAS,CACP,OACA,SlNmhBF9oG,GmNhiBoB,CACpB7S,KAAM,KACNykC,SAAU,QACV4jB,OAAQ,CACN,YACA,eAEFt5C,YAAa,8BACb0sG,SAAU,CACR,eACA,aACA,oBAEFE,QAAS,InNshBTxqF,MoNniBuB,CACvBnxB,KAAM,QACNykC,SAAU,QACV4jB,OAAQ,CACN,YAEFt5C,YAAa,sFACb0sG,SAAU,CACR,aACA,gBACA,gBACA,sBACA,wBAEFE,QAAS,IpNshBT31D,OqNpiBwB,CACxBhmD,KAAM,SACNykC,SAAU,QACV4jB,OAAQ,CACN,gBACA,4BAEFt5C,YAAa,wCACb0sG,SAAU,CACR,cACA,iBACA,aACA,iBAEFE,QAAS,CAAC,UrNuhBV2G,IsNriBqB,CACrBtiH,KAAM,MACNykC,SAAU,QACV4jB,OAAQ,CACN,cAEFt5C,YAAa,4BACb0sG,SAAU,CACR,UAEFE,QAAS,CAAC,MAAO,QtN4hBjB4G,IuNtiBqB,CACrBviH,KAAM,MACNykC,SAAU,QACV4jB,OAAQ,CACN,cAEFt5C,YAAa,2BACb0sG,SAAU,CACR,WAEFE,QAAS,CAAC,MAAO,QvN6hBjB6G,IwNviBqB,CACrBxiH,KAAM,MACNykC,SAAU,QACV4jB,OAAQ,CACN,cAEFt5C,YAAa,iCACb0sG,SAAU,CACR,YAEFE,QAAS,CAAC,MAAO,QxN8hBjBplG,MyNxiBuB,CACvBvW,KAAM,QACNykC,SAAU,QACV4jB,OAAQ,CACN,YAEFt5C,YAAa,6CACb0sG,SAAU,CACR,WACA,eACA,aACA,mBAEFE,QAAS,CAAC,aAAc,YAAa,aAAc,WzN4hBnD9xF,U0NziB2B,CAC3B7pB,KAAM,YACNykC,SAAU,QACV4jB,OAAQ,CACN,gBAEFt5C,YAAa,6CACb0sG,SAAU,CACR,eACA,iBACA,2BAEFE,QAAS,CAAC,aAAc,YAAa,aAAc,W1N8hBnD5xF,W2N1iB4B,CAC5B/pB,KAAM,aACNykC,SAAU,QACV4jB,OAAQ,CACN,iBAEFt5C,YAAa,uDACb0sG,SAAU,CACR,gBACA,gBACA,iBACA,4BAEFE,QAAS,CAAC,YAAa,YAAa,aAAc,W3N8hBlD9mD,U4N3iB2B,CAC3B70D,KAAM,YACNykC,SAAU,QACV4jB,OAAQ,CACN,gBAEFt5C,YAAa,qHAEb0sG,SAAU,CACR,eACA,iBACA,uBACA,eACA,4BACA,6BACA,oBACA,kCAEFE,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,oB5N0hBtE8G,gB6N5iBiC,CACjCziH,KAAM,kBACNykC,SAAU,QACV4jB,OAAQ,CACN,sBAEFt5C,YAAa,0HAEb0sG,SAAU,CACR,qBACA,uBACA,iBACA,qBACA,kCACA,mCACA,0BACA,wCAEFE,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,c7N2hBtE3xF,W8N7iB4B,CAC5BhqB,KAAM,aACNykC,SAAU,QACV4jB,OAAQ,CACN,iBAEFt5C,YAAa,sDACb0sG,SAAU,CACR,gBACA,gBACA,iBACA,4BAEFE,QAAS,CAAC,YAAa,YAAa,aAAc,W9NiiBlD+G,Q+N9iByB,CACzB1iH,KAAM,UACNykC,SAAU,QACV4jB,OAAQ,CACN,cAEFt5C,YAAa,4EACb0sG,SAAU,CACR,aACA,cACA,yBAEFE,QAAS,CAAC,YAAa,YAAa,aAAc,W/NmiBlDj1F,OgO/iBwB,CACxB1mB,KAAM,SACNykC,SAAU,QACV4jB,OAAQ,CACN,aAEFt5C,YAAa,gCACb0sG,SAAU,CACR,YACA,YACA,aACA,yBAEFE,QAAS,CAAC,YAAa,YAAa,aAAc,ehOmiBlDgH,MiOhjBuB,CACvB3iH,KAAM,QACNykC,SAAU,QACV4jB,OAAQ,CACN,0BACA,sCAEFt5C,YAAa,6CACb0sG,SAAU,CACR,4CACA,+CACA,sDACA,0CAEFE,QAAS,CAAC,WjOmiBVn2D,OkOjjBwB,CACxBxlD,KAAM,SACNykC,SAAU,QACV4jB,OAAQ,CACN,aAEFt5C,YAAa,8BACb0sG,SAAU,CACR,cACA,iBACA,iBACA,yBAEFE,QAAS,CAAC,sBlOqiBVrqC,QmOljByB,CACzBtxE,KAAM,UACNykC,SAAU,QACV4jB,OAAQ,CACN,cAEFt5C,YAAa,sFACb0sG,SAAU,CACR,eACA,yBACA,4BACA,0BACA,yBACA,oCAEFE,QAAS,CAAC,SAAU,WAAY,YAAa,SAAU,YCP5CiH,GAA6B5jH,GAH7B,OACQ,CAAC,QAAS,oBAAqB,SAEkB,YAAwC,IAArCmiC,EAAqC,EAArCA,MAAO87D,EAA8B,EAA9BA,kBAAmBse,EAAW,EAAXA,KAmBjG,OAAOp6E,EAtBI,OAsBQ,CACjByxB,IAAK,SAAU/iC,GACb,IAAIoyB,EACA4gE,EAAahzF,EAEjB,GAAsB,iBAAXA,EACT,IAAKoyB,KAAQg7C,EAEX,GAAI37F,GAAe27F,EAAmBh7C,IAAUpyB,IAAWotE,EAAkBh7C,GAAQ,CACnF4gE,EAAa5gE,EACb,MAmBN,IAAMu5D,EAAMvuD,GAAgBsvD,GAAcsG,GAC1C,IAAKrH,EAAK,CACR,IAAMsH,EAAmC,mBAAfD,EAA4BA,EAAW7iH,KAAO6iH,EACxE,MAAM,IAAI5lG,MAAM,8BAAgC6lG,EAAa,KAE/D,OAAO,IAAIvH,EAAKC,SCxDTuH,GAA8B/jH,GAH9B,QACQ,CAAC,QAAS,UAEwC,YAAsB,IAAnBmiC,EAAmB,EAAnBA,MAAO06E,EAAY,EAAZA,MAoC/E,OAAO16E,EAvCI,QAuCQ,CACjB,GAAI,WACF,OAAO,IAAI06E,GAGbjpD,IAAK,SAAUlyD,GACb,OAAO,IAAIm7G,EAAMn7G,SCvCVsiH,GAA4BhkH,GAH5B,MACQ,CAAC,QAAS,SAAU,WAAY,WAAY,aAAc,QAEV,YAA4D,IAAzDmiC,EAAyD,EAAzDA,MAAOutB,EAAkD,EAAlDA,OAAQ7gC,EAA0C,EAA1CA,SAAU8hB,EAAgC,EAAhCA,SAAU2sB,EAAsB,EAAtBA,WAAY0+C,EAAU,EAAVA,IA0BrH,OAAO75E,EA7BI,MA6BQ,CACjByxB,IAAK,SAAUhmD,GACb,OAAOukB,GAAMvkB,IAGf,iBAAkB,SAAcA,GAC9B,IAAImiC,EAWJ,QATEA,EADE4U,EAAS/2C,GACJA,EAAEmiC,OACAx/B,MAAMP,QAAQpC,IACvBA,EAAI8hD,EAAO9hD,IACFmiC,OAGF,IAGI7rC,QACX,KAAK,EAEH,OAAOiuB,GAAMvkB,GAEf,KAAK,EAEH,GAAgB,IAAZmiC,EAAK,GACP,OAAO5d,GAAMvkB,EAAEmQ,UAAU,IAEzB,MAAM,IAAIwyB,WAAW,gCACTyW,GAAOjX,GAAQ,KAG/B,KAAK,EAGH,IAAMijB,EAAOjjB,EAAK,GACZ47B,EAAO57B,EAAK,GAClB,GAAIijB,IAAS2Y,EACX,OAuBV,SAAejc,EAAQsD,EAAM2Y,GAC3B,GAAa,IAAT3Y,EAEF,OAAO7gC,GAAMu9B,EAAO,GAAG,IAClB,GAAa,IAATsD,EAGT,OAAOnkC,EACL8hB,EAAS+e,EAAO,GAAG,GAAIA,EAAO,GAAG,IACjC/e,EAAS+e,EAAO,GAAG,GAAIA,EAAO,GAAG,KAQnC,IAJA,IAAMu0D,EAASjI,EAAItsD,GAGf24C,EAAM4b,EAAOpP,EAAE,GAAG,GACbp0G,EAAI,EAAGA,EAAIuyD,EAAMvyD,IACxB4nG,EAAM13D,EAAS03D,EAAK4b,EAAOpP,EAAEp0G,GAAGA,IAQlC,IAHA,IAAIyjH,EAAa,EACbzjH,EAAI,EACF0jH,EAAU,KACH,CACX,KAAOA,EAAQ1jH,IACbA,IAEF,GAAIA,GAAKuyD,EAAM,MAGf,IAFA,IAAIx9C,EAAI/U,EACJuzB,EAAW,GACPmwF,EAAQF,EAAO1hH,EAAEiT,KACvB2uG,EAAQF,EAAO1hH,EAAEiT,KAAM,EACvBA,EAAIyuG,EAAO1hH,EAAEiT,GACbwe,IAEEA,EAAW,GAAM,GACnBkwF,IAIJ,OAAOA,EAAa,GAAM,EAAI7b,EAAM/qC,EAAW+qC,GAlElC+b,CAAKx2G,EAAEukB,QAAQpU,UAAWi1C,GAEjC,MAAM,IAAIziB,WAAW,gCACPyW,GAAOjX,GAAQ,KAIjC,QAEE,MAAM,IAAIQ,WAAW,yCACTyW,GAAOjX,GAAQ,YC/DxBs0E,GAA4BrkH,GAb5B,MACQ,CACnB,QACA,SACA,eACA,YACA,WACA,aACA,MACA,WACA,QAGmE,YAA0F,IAAvFmiC,EAAuF,EAAvFA,MAAOutB,EAAgF,EAAhFA,OAAQ+kB,EAAwE,EAAxEA,aAAcxS,EAA0D,EAA1DA,UAAWtxB,EAA+C,EAA/CA,SAAU2sB,EAAqC,EAArCA,WAAY+qC,EAAyB,EAAzBA,IAAKt0B,EAAoB,EAApBA,SAAUt9D,EAAU,EAAVA,IAqBnJ,OAAO0rB,EAlCI,MAkCQ,CACjB,iBAAkB,SAAUv0B,GAC1B,IAAMmiC,EAAO4U,EAAS/2C,GAAKA,EAAEmiC,OAASga,GAAUn8C,GAChD,OAAQmiC,EAAK7rC,QACX,KAAK,EAEH,GAAgB,IAAZ6rC,EAAK,GACP,OAAI4U,EAAS/2C,GACJ8hD,EAAO,CACZ+kB,EAAa,EAAG7mE,EAAEmQ,UAAU,MAGvB,CACL02D,EAAa,EAAG7mE,EAAE,KAItB,MAAM,IAAI2iC,WAAW,gCACTyW,GAAOjX,GAAQ,KAG/B,KAAK,EAGH,IAAMijB,EAAOjjB,EAAK,GACZ47B,EAAO57B,EAAK,GAClB,GAAIijB,IAAS2Y,EACX,OAAIhnB,EAAS/2C,GACJ8hD,EACL40D,EAAK12G,EAAEmQ,UAAWi1C,EAAM2Y,GACxB/9D,EAAEujD,WAIGmzD,EAAK12G,EAAGolD,EAAM2Y,GAGvB,MAAM,IAAIp7B,WAAW,gCACPyW,GAAOjX,GAAQ,KAIjC,QAEE,MAAM,IAAIQ,WAAW,yCACTyW,GAAOjX,GAAQ,OAIjC6jB,IAAK,SAAUhmD,GAEb,OAAO6mE,EAAa,EAAG7mE,MAY3B,SAAS02G,EAAMvwD,EAAKf,EAAM2Y,GACxB,IAAIpqE,EAAGiB,EAAGqC,EAAGnD,EAAOsX,EAEpB,GAAa,IAATg6C,EAAY,CAGd,GAAc,KADdtxD,EAAQqyD,EAAI,GAAG,IAEb,MAAM91C,MAAM,iDAEd,MAAO,CAAC,CACNw2D,EAAa,EAAG/yE,KAEb,GAAa,IAATsxD,EAAY,CAErB,IAAMjyD,EAAIsnG,EAAIt0C,GACd,GAAU,IAANhzD,EACF,MAAMkd,MAAM,iDAEd,MAAO,CACL,CACEw2D,EAAa1gB,EAAI,GAAG,GAAIhzD,GACxB0zE,EAAanX,EAAWvJ,EAAI,GAAG,IAAKhzD,IAEtC,CACE0zE,EAAanX,EAAWvJ,EAAI,GAAG,IAAKhzD,GACpC0zE,EAAa1gB,EAAI,GAAG,GAAIhzD,KAW5B,IAAM6Q,EAAImiD,EAAI1iD,SACd,IAAK9P,EAAI,EAAGA,EAAIyxD,EAAMzxD,IACpBqQ,EAAErQ,GAAKqQ,EAAErQ,GAAG8P,SAQd,IAHA,IAAMiiB,EAAIygD,EAAS/gB,GAAMj1C,UAGhBjd,EAAI,EAAGA,EAAI6qE,EAAM7qE,IAAK,CAE7B,IAAIyjH,EAAO9tG,EAAI7E,EAAE9Q,GAAGA,IAChB0jH,EAAO1jH,EAEX,IADAS,EAAIT,EAAI,EACDS,EAAIyxD,GACLv8C,EAAI7E,EAAErQ,GAAGT,IAAMyjH,IACjBA,EAAO9tG,EAAI7E,EAAErQ,GAAGT,IAChB0jH,EAAOjjH,GAETA,IAEF,GAAa,IAATgjH,EACF,MAAMtmG,MAAM,kDAEd1c,EAAIijH,KACM1jH,IACRkY,EAAOpH,EAAE9Q,GAAI8Q,EAAE9Q,GAAK8Q,EAAErQ,GAAIqQ,EAAErQ,GAAKyX,EACjCA,EAAOsa,EAAExyB,GAAIwyB,EAAExyB,GAAKwyB,EAAE/xB,GAAI+xB,EAAE/xB,GAAKyX,GAInC,IAAMyrG,EAAK7yG,EAAE9Q,GACP4jH,EAAKpxF,EAAExyB,GACb,IAAKS,EAAI,EAAGA,EAAIyxD,EAAMzxD,IAAK,CACzB,IAAMojH,EAAK/yG,EAAErQ,GACPqjH,EAAKtxF,EAAE/xB,GACb,GAAIA,IAAMT,GAER,GAAc,IAAV6jH,EAAG7jH,GAAU,CAKf,IAJA+D,EAAI4vE,EAAanX,EAAWqnD,EAAG7jH,IAAK2jH,EAAG3jH,IAIlC0B,EAAI1B,EAAG0B,EAAImpE,EAAMnpE,IACpBmiH,EAAGniH,GAAKy/D,EAAU0iD,EAAGniH,GAAImuC,EAAS9rC,EAAG4/G,EAAGjiH,KAE1C,IAAKA,EAAI,EAAGA,EAAImpE,EAAMnpE,IACpBoiH,EAAGpiH,GAAKy/D,EAAU2iD,EAAGpiH,GAAImuC,EAAS9rC,EAAG6/G,EAAGliH,UAGvC,CAIL,IADAqC,EAAI4/G,EAAG3jH,GACF0B,EAAI1B,EAAG0B,EAAImpE,EAAMnpE,IACpBmiH,EAAGniH,GAAKiyE,EAAakwC,EAAGniH,GAAIqC,GAE9B,IAAKrC,EAAI,EAAGA,EAAImpE,EAAMnpE,IACpBoiH,EAAGpiH,GAAKiyE,EAAamwC,EAAGpiH,GAAIqC,KAKpC,OAAOyuB,M,+hCCxMN,SAASuxF,GAAT,GAAuN,IAAzL5iD,EAAyL,EAAzLA,UAAWpzC,EAA8K,EAA9KA,SAAUk0B,EAAoK,EAApKA,QAASpS,EAA2J,EAA3JA,SAAUuxB,EAAiJ,EAAjJA,eAAgBuS,EAAiI,EAAjIA,aAAc18D,EAAmH,EAAnHA,KAAMtB,EAA6G,EAA7GA,IAAK02D,EAAwG,EAAxGA,UAAWs0C,EAA6F,EAA7FA,KAAMnlD,EAAuF,EAAvFA,IAAKs9C,EAAkF,EAAlFA,GAAIsC,EAA8E,EAA9EA,OAAQiF,EAAsE,EAAtEA,UAAWj8C,EAA2D,EAA3DA,MAAOX,EAAoD,EAApDA,QAAS8I,EAA2C,EAA3CA,OAAQlI,EAAmC,EAAnCA,QAAS28C,EAA0B,EAA1BA,kBAAmB55D,EAAO,EAAPA,IA8erN,SAAS48D,EAAexuG,EAAGC,EAAGzV,EAAGC,EAAGgkH,EAAIC,EAAIC,EAAM93G,GAChD,IAAM+3G,EAAe,cAAT/3G,EACNg4G,EAAgB,YAATh4G,EAEP0pD,EAAOquD,EAAM/3C,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAChDn7C,EAAM87F,EAAM/3C,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAIrD,GAAIY,EAAQ1uD,EAAI3V,GAAImkH,GAClB,MAAO,CAAC,CAAC77F,EAAKytC,GAAO,CAACA,EAAMztC,IAK9B,GAAIikD,EAAO52D,EAAIoY,EAASk2F,EAAIC,IAAMC,GAChC,MAAO,CAAC,CAACp2F,EAASk2F,EAAIhkH,GAAI8tB,EAASm2F,EAAIjkH,IAAK,CAACD,EAAGA,IAQlD,IAAMskH,EAAKv2F,EAASvY,EAAGyuG,GACjBM,EAAKx2F,EAAStY,EAAGwuG,GACjBO,EAAKz2F,EAAS/tB,EAAGikH,GACjBQ,EAAK12F,EAAS9tB,EAAGgkH,GAEvB,OAAI5/C,EAAQ1uD,EAAI4uG,GAAKJ,GACZ,CAAC,CAACG,EAAIh8F,GAAM,CAACk8F,EAAIzuD,IAEjB,CAAC,CAACwuD,EAAIxuD,GAAO,CAAC0uD,EAAIn8F,IAQ7B,SAASo8F,EAAe1yG,EAAK0gB,GAE3B,IAAK,IAAI/yB,EAAI,EAAGA,EAAIqS,EAAI5O,OAAQzD,IAAK,QACnC,EAAAqS,EAAIrS,IAAGqb,KAAP,aAAevL,MAAMijB,EAAI1gB,EAAIrS,GAAGyD,QAAQg9C,KAAK,KAI/C,IAAK,IAAIzgD,EAAIqS,EAAI5O,OAAQzD,EAAI+yB,EAAG/yB,IAC9BqS,EAAIgJ,KAAKvL,MAAMijB,GAAG0tB,KAAK,IACvBpuC,EAAIrS,GAAGA,GAAK,EAGd,OAAOqS,EAsCT,SAASyT,EAASzT,EAAK+kC,EAAI7wC,GACzB,IAAK,IAAIvG,EAAI,EAAGA,EAAIqS,EAAI5O,OAAQzD,IAC9B,GAAIuG,EAAG8L,EAAIrS,GAAIo3C,GACb,OAAOp3C,EAGX,OAAQ,EAiBV,SAASglH,EAAgB7zG,EAAG4hB,EAAGkyF,EAAQT,EAAM93G,GAO3C,IANA,IAEIoJ,EAFEovG,EAAoB,cAATx4G,EAAuBggE,EAAU,KAAQ,IAKtD1sE,EAAI,EAEN8V,EAAIqvG,EAAuBpyF,EAAGkyF,EAAQv4G,GACtCoJ,EAAI2lG,EAAOtqG,EAAG2E,IAEV82D,EAAOyB,EAAKv4D,GAAIovG,IACpB,KAAMllH,GAAK,EAAK,OAAO,KAKzB,IADAA,EAAI,IACS,CACX,IAAMK,EAAIo7G,EAAOtqG,EAAG2E,GAEpB,GAAI4uD,EAAQ2J,EAAK+2C,EAAqBtvG,EAAG,CAACzV,KAAMmkH,GAAS,MACzD,KAAMxkH,GAAK,GAAM,OAAO,KAExB8V,EAAIgjB,EAAUz4B,GAGhB,OAAOyV,EAWT,SAASqvG,EAAwBpyF,EAAGkyF,EAAQv4G,GAC1C,IAAM+3G,EAAe,cAAT/3G,EACNg4G,EAAgB,YAATh4G,EAGT2R,EAAIvO,MAAMijB,GAAG0tB,KAAK,GAAGv9C,KAAI,SAAA2zB,GAAC,OAAI,EAAIx0B,KAAKkvB,SAAW,KAQtD,OAPIkzF,IAAOpmG,EAAIA,EAAEnb,KAAI,SAAAzB,GAAC,OAAIirE,EAAUjrE,OAChCijH,IAAQrmG,EAAIA,EAAEnb,KAAI,SAAAzB,GAAC,OAAIqiE,EAAQriE,OAM5Bq3B,EAHPza,EAAI+mG,EAAqB/mG,EAAG4mG,GAGRv4G,GAMtB,SAAS04G,EAAsB/mG,EAAG4mG,GAAQ,WACxBA,GADwB,IACxC,2BAAwB,KAAbhgG,EAAa,QAEtB5G,EAAI+P,EAAS/P,EAAG6xB,EAAS8jC,EAAavsB,EAAIxiC,EAAG5G,GAAIopC,EAAIxiC,EAAGA,IAAKA,KAHvB,8BAMxC,OAAO5G,EAQT,SAASgwD,EAAMhwD,GACb,OAAOrI,EAAIsB,EAAKmwC,EAAIppC,EAAGA,KAUzB,SAASya,EAAWza,EAAG3R,GACrB,IACMg4G,EAAgB,YAATh4G,EACPic,EAFe,cAATjc,EAEMggE,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAErD,OAAO5zB,EAAS8jC,EAAarrD,EAAK0lD,EAAKhwD,IAAKA,GAG9C,OA9qBA,SAAsBhM,EAAK0gB,EAAGyxF,EAAM93G,EAAM24G,QACpB3hH,IAAhB2hH,IACFA,GAAc,GAQhB,IAAMn/G,EA2CR,SAAkBmM,EAAK0gB,EAAGyxF,EAAM93G,EAAM24G,GACpC,IAYIC,EAZEb,EAAe,cAAT/3G,EACNg4G,EAAgB,YAATh4G,EAEP64G,EAAWd,EAAM/3C,EAAU,GAAK,EAChC/jD,EAAM87F,EAAM/3C,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAC/C0hD,EAAUf,EAAM/3C,EAAU,GAAK,EAG/Bp4D,EAAQmwG,EAAM/3C,EAAU,IAAM,EAC9B+4C,EAAUhkD,EAAentD,EAAOA,GAIlC+wG,IACFC,EAAQx1G,MAAMijB,GAAG0tB,KAAK93B,IAIxB,IAAI2a,GAAO,EAEX,MAAQA,GAAM,CAEZA,GAAO,EAEP,IAAK,IAAItjC,EAAI,EAAGA,EAAI+yB,EAAG/yB,IAAK,CAM1B,IAHA,IAAI0lH,EAAUH,EACVI,EAAUJ,EAELxwG,EAAI,EAAGA,EAAIge,EAAGhe,IACrB,GAAI/U,IAAM+U,EAAV,CACA,IAAM1U,EAAI2V,EAAI3D,EAAIrS,GAAG+U,IACrB2wG,EAAUlkD,EAAUkkD,EAASrlH,GAC7BslH,EAAUnkD,EAAUmkD,EAAStlH,GAG/B,IAAKokE,EAAMihD,EAAS,KAAOjhD,EAAMkhD,EAAS,GAAI,CAW5C,IANA,IAAIvhH,EAAIohH,EACJnlH,EAAIqlH,EAEFE,EAAc5xC,EAAa2xC,EAASrxG,GACpCuxG,EAAcpkD,EAAekkD,EAASrxG,GAErCowD,EAAQrkE,EAAGulH,IAChBvlH,EAAIohE,EAAephE,EAAGolH,GACtBrhH,EAAIq9D,EAAer9D,EAAGkQ,GAExB,KAAOs4D,EAAOvsE,EAAGwlH,IACfxlH,EAAI2zE,EAAa3zE,EAAGolH,GACpBrhH,EAAI4vE,EAAa5vE,EAAGkQ,GAQtB,GAHkBowD,EAAQsP,EAAaxS,EAAUnhE,EAAGslH,GAAUvhH,GAAIq9D,EAAeD,EAAUkkD,EAASC,GAAU,MAG/F,CAGbriF,GAAO,EAIP,IAFA,IAAM2T,EAAI+8B,EAAa,EAAG5vE,GAEjB2Q,EAAI,EAAGA,EAAIge,EAAGhe,IACjB/U,IAAM+U,IAGV1C,EAAIrS,GAAG+U,GAAK0sD,EAAepvD,EAAIrS,GAAG+U,GAAI3Q,GACtCiO,EAAI0C,GAAG/U,GAAKyhE,EAAepvD,EAAI0C,GAAG/U,GAAIi3C,IAIpCouE,IACFC,EAAMtlH,GAAKyhE,EAAe6jD,EAAMtlH,GAAIoE,OAQ9C,OAAO48G,EAAKsE,GAnIFQ,CAAQzzG,EAAK0gB,EAAGyxF,EAAM93G,EAAM24G,IA8IxC,SAA6BhzG,EAAK0gB,EAAGyxF,EAAM93G,EAAM24G,EAAan/G,GAC5D,IAAMu+G,EAAe,cAAT/3G,EACNg4G,EAAgB,YAATh4G,EAEP0pD,EAAOquD,EAAM/3C,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAElD2gD,IAAOD,EAAO93C,EAAU83C,IAE5B,IAAK,IAAIxkH,EAAI,EAAGA,EAAI+yB,EAAI,EAAG/yB,IAAK,CAM9B,IAHA,IAAI+lH,EAAW,EACXh2G,EAAMqmD,EAEDrhD,EAAI/U,EAAI,EAAG+U,EAAIge,EAAGhe,IAAK,CAC9B,IAAMqiC,EAAK/kC,EAAI0C,GAAG/U,GACd0kE,EAAQ1uD,EAAIjG,GAAMiG,EAAIohC,MACxBrnC,EAAMqnC,EACN2uE,EAAWhxG,GAKf,IAAI2vD,EAAQ1uD,EAAIjG,GAAMy0G,GAAtB,CAIA,GAAIuB,IAAa/lH,EAAI,EAAG,CAEtB,IAAMgmH,EAAO3zG,EAAI0zG,GACjB1zG,EAAI0zG,GAAY1zG,EAAIrS,EAAI,GACxBqS,EAAIrS,EAAI,GAAKgmH,EAGb,IAAK,IAAIjxG,EAAI,EAAGA,EAAIge,EAAGhe,IAAK,CAC1B,IAAMkxG,EAAO5zG,EAAI0C,GAAGgxG,GACpB1zG,EAAI0C,GAAGgxG,GAAY1zG,EAAI0C,GAAG/U,EAAI,GAC9BqS,EAAI0C,GAAG/U,EAAI,GAAKimH,EAIlB,GAAIZ,EAAa,CACf,IAAMa,EAAOhgH,EAAE6/G,GACf7/G,EAAE6/G,GAAY7/G,EAAElG,EAAI,GACpBkG,EAAElG,EAAI,GAAKkmH,GAKf,IAAK,IAAInxG,EAAI/U,EAAI,EAAG+U,EAAIge,EAAGhe,IAAK,CAC9B,IAAMtT,EAAIuyE,EAAa3hE,EAAI0C,GAAG/U,GAAI+P,GAElC,GAAU,IAANtO,EAAJ,CAKA,IAAK,IAAI4O,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBgC,EAAI0C,GAAG1E,GAAK+d,EAAS/b,EAAI0C,GAAG1E,GAAIoxD,EAAehgE,EAAG4Q,EAAIrS,EAAI,GAAGqQ,KAI/D,IAAK,IAAIA,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBgC,EAAIhC,GAAGrQ,EAAI,GAAKwhE,EAAUnvD,EAAIhC,GAAGrQ,EAAI,GAAIyhE,EAAehgE,EAAG4Q,EAAIhC,GAAG0E,KAIpE,GAAIswG,EACF,IAAK,IAAIh1G,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBnK,EAAE6O,GAAG1E,GAAK+d,EAASloB,EAAE6O,GAAG1E,GAAIoxD,EAAehgE,EAAGyE,EAAElG,EAAI,GAAGqQ,SArM/D81G,CAAmB9zG,EAAK0gB,EAAGyxF,EAAM93G,EAAM24G,EAAan/G,GAIpD,IAQIkgH,EARJ,EA+MF,SAAiCj1G,EAAG4hB,EAAGyxF,EAAM93G,EAAM24G,GACjD,IAAMZ,EAAe,cAAT/3G,EACNg4G,EAAgB,YAATh4G,EAEPic,EAAM87F,EAAM/3C,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAEjD2gD,IAAOD,EAAO93C,EAAU83C,IAW5B,IAAInyG,EAAMqf,GAAMvgB,GAGVk1G,EAAU,GAGZ5kH,EAAIsxB,EAIFuzF,EAAQ,GAGVC,EAASlB,EAAcrE,EAAKlxG,MAAMijB,GAAG0tB,KAAK93B,SAAQjlB,EAGlD8iH,EAAWnB,EAAcrE,EAAKlxG,MAAMrO,GAAGg/C,KAAK93B,SAAQjlB,EAGpD+iH,EAAwB,EAE5B,KAAOA,GAAyB,KAAK,CACnCA,GAAyB,EAQzB,IAFA,IAESzmH,EAAI,EAAGA,EAAIyB,EAAGzB,IACrBqS,EAAIrS,GAAGA,GAAKouB,EAAS/b,EAAIrS,GAAGA,GAHpB,GAOV,MAAiBm5G,EAAG9mG,GAAZ6+D,EAAR,EAAQA,EAAGhrE,EAAX,EAAWA,EACXmM,EAAM69B,EAAShqC,EAAGgrE,GAElB,IAAK,IAAIlxE,EAAI,EAAGA,EAAIyB,EAAGzB,IACrBqS,EAAIrS,GAAGA,GAAKwhE,EAAUnvD,EAAIrS,GAAGA,GAXrB,GAoBV,GALIqlH,IACFmB,EAAWt2E,EAASs2E,EAAUt1C,IAItB,IAANzvE,GAAWijE,EAAQ1uD,EAAI3D,EAAI5Q,EAAI,GAAGA,EAAI,IAAK+iH,GAAO,CACpDiC,EAAwB,EACxBJ,EAAQhrG,KAAKhJ,EAAI5Q,EAAI,GAAGA,EAAI,IAGxB4jH,IACFiB,EAAMx6F,QAAQ,CAAC,CAAC,KAChBi5F,EAAcyB,EAAUzzF,GACxBwzF,EAASr2E,EAASq2E,EAAQC,GAEtB/kH,EAAI,IACN+kH,EAAWxF,EAAKlxG,MAAMrO,EAAI,GAAGg/C,KAAK93B,MAKtClnB,GAAK,EACL4Q,EAAIkZ,MACJ,IAAK,IAAIvrB,EAAI,EAAGA,EAAIyB,EAAGzB,IACrBqS,EAAIrS,GAAGurB,WAIJ,GAAU,IAAN9pB,GAAWijE,EAAQ1uD,EAAI3D,EAAI5Q,EAAI,GAAGA,EAAI,IAAK+iH,GAAO,CAC3DiC,EAAwB,EACxB,IAAMC,GA8Ia7wG,EA7IjBxD,EAAI5Q,EAAI,GAAGA,EAAI,GA6IKqU,EA7IDzD,EAAI5Q,EAAI,GAAGA,EAAI,GA6IXpB,EA5IvBgS,EAAI5Q,EAAI,GAAGA,EAAI,GA4IWnB,EA5IP+R,EAAI5Q,EAAI,GAAGA,EAAI,GA8IlCklH,SACAC,SACAz5G,SACAyK,SAHA+uG,EAAMnlD,EAAU3rD,EAAGvV,GACnBsmH,EAAOx4F,EAASqzC,EAAe5rD,EAAGvV,GAAImhE,EAAe3rD,EAAGzV,IACxD8M,EAAIs0D,EAAeklD,EAAK,IACxB/uG,EAAI6pD,EAAenqD,EAAK8W,EAASqzC,EAAeklD,EAAKA,GAAMllD,EAAe,EAAGmlD,KAAS,IAErF,CAACplD,EAAUr0D,EAAGyK,GAAIwW,EAASjhB,EAAGyK,KAjJjCyuG,EAAQhrG,KAAR,MAAAgrG,EAAO,KAASK,IAGZrB,IACFiB,EAAMx6F,QAAQu4F,EACZhyG,EAAI5Q,EAAI,GAAGA,EAAI,GAAI4Q,EAAI5Q,EAAI,GAAGA,EAAI,GAClC4Q,EAAI5Q,EAAI,GAAGA,EAAI,GAAI4Q,EAAI5Q,EAAI,GAAGA,EAAI,GAClCilH,EAAG,GAAIA,EAAG,GAAIlC,EAAM93G,IAEtBq4G,EAAcyB,EAAUzzF,GACxBwzF,EAASr2E,EAASq2E,EAAQC,GAEtB/kH,EAAI,IACN+kH,EAAWxF,EAAKlxG,MAAMrO,EAAI,GAAGg/C,KAAK93B,MAKtClnB,GAAK,EACL4Q,EAAIkZ,MACJlZ,EAAIkZ,MACJ,IAAK,IAAIvrB,EAAI,EAAGA,EAAIyB,EAAGzB,IACrBqS,EAAIrS,GAAGurB,MACPlZ,EAAIrS,GAAGurB,MAIX,GAAU,IAAN9pB,EACF,MA8GN,IAAyBoU,EAAGC,EAAGzV,EAAGC,EAE1BqmH,EACAC,EACAz5G,EACAyK,EA3GN,GAHAyuG,EAAQtoG,MAAK,SAAClI,EAAGC,GAAJ,OAAWsY,EAASpY,EAAIH,GAAIG,EAAIF,OAGzC2wG,EAAwB,IAAK,CAC/B,IAAM/hF,EAAMlnB,MAAM,qEAAuE6oG,EAAQ73G,KAAK,OAGtG,MAFAk2B,EAAIr3B,OAASg5G,EACb3hF,EAAI0hF,QAAU,GACR1hF,EAKR,IAAM53B,EAAIu4G,EAAcn1E,EAASq2E,EA0KnC,SAAoBl0G,EAAK0gB,GAEvB,IADA,IAAMH,EAAI,GACD5yB,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB4yB,EAAE5yB,GAAK8P,MAAMijB,GAAG0tB,KAAK,GAGvB,IAN0B,EAMtB8S,EAAI,EANkB,KAORlhD,GAPQ,IAO1B,2BAAuB,CAGrB,IAHqB,IAAZ+Y,EAAY,QACf3pB,EAAI2pB,EAAI3nB,OAELzD,EAAI,EAAGA,EAAIyB,EAAGzB,IACrB,IAAK,IAAI+U,EAAI,EAAGA,EAAItT,EAAGsT,IACrB6d,EAAE2gC,EAAIvzD,GAAGuzD,EAAIx+C,GAAKqW,EAAIprB,GAAG+U,GAI7Bw+C,GAAK9xD,GAhBmB,8BAmB1B,OAAOmxB,EA7LkCi0F,CAAUP,EAAOvzF,SAAMrvB,EAEhE,MAAO,CAAE2J,OAAQg5G,EAASv5G,KA5VJg6G,CAAuBz0G,EAAK0gB,EAAGyxF,EAAM93G,EAAM24G,GAAzDh4G,EAAR,EAAQA,OAAQP,EAAhB,EAAgBA,EAehB,OALIu4G,IACFe,EA6VJ,SAA2Bj1G,EAAG4hB,EAAGjmB,EAAG5G,EAAGmH,EAAQm3G,EAAM93G,GACnD,IADyD,EACnDq6G,EAAOlrD,EAAI/uD,GACXsnG,EAAIlkE,EAAS62E,EAAM51G,EAAGrE,GAEtB23G,EAAe,cAAT/3G,EACNg4G,EAAgB,YAATh4G,EAEP0pD,EAAOquD,EAAM/3C,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAChDn7C,EAAM87F,EAAM/3C,EAAU,GAAKg4C,EAAO5gD,EAAQ,GAAK,EAI/CkjD,EAAe,GACfC,EAAiB,GAbkC,KAezC55G,GAfyC,IAezD,2BAAwB,KAAb65G,EAAa,QAChBlnH,EAAI8lB,EAAQkhG,EAAcE,EAAGziD,IAExB,IAAPzkE,GACFgnH,EAAa3rG,KAAK6rG,GAClBD,EAAe5rG,KAAK,IAEpB4rG,EAAejnH,IAAM,GAtBgC,8BAsCzD,IARA,IAAMomH,EAAU,GACVn1G,EAAM+1G,EAAavjH,OACnBqS,EAAIhG,MAAMijB,GAAG0tB,KAAK2V,GAClBllD,EAAI8vG,EAAKlxG,MAAMijB,GAAG0tB,KAAK93B,IAGvBw+F,EAAgB,GApCmC,WAsChDnnH,GACP,IAAMknH,EAAIF,EAAahnH,GACjBkiB,EAAIkM,EAASgmF,EAAGlkE,EAASg3E,EAAGh2G,IAE9Bk2G,EAAY1G,EAAUx+F,EAAGpM,GAI7B,IAHAsxG,EAAU57F,QAGH47F,EAAU3jH,OAASwjH,EAAejnH,IAAI,CAC3C,IAAMqnH,EAAYrC,EAAe9iG,EAAG6Q,EAAGq0F,EAAW5C,EAAM93G,GAExD,GAAiB,MAAb26G,EAAmB,CAErBF,EAAc9rG,KAAK6rG,GACnB,MAGFE,EAAU/rG,KAAKgsG,GAIjB,IAAMC,EAAap3E,EAAS2rB,EAAI31D,GAAI4G,GACpCs6G,EAAYA,EAAUlkH,KAAI,SAAAmb,GAAC,OAAI6xB,EAASo3E,EAAYjpG,MAEpD+nG,EAAQ/qG,KAAR,MAAA+qG,EAAO,KAASgB,EAAUlkH,KAAI,SAAAmb,GAAC,OAAIikC,EAAQjkC,SAxBpCre,EAAI,EAAGA,EAAIiR,EAAKjR,IAAK,EAArBA,GA2BT,GAA6B,IAAzBmnH,EAAc1jH,OAAc,CAC9B,IAAMihC,EAAM,IAAIlnB,MAAM,8DAAgE2pG,EAAc34G,KAAK,OAGzG,MAFAk2B,EAAIr3B,OAASA,EACbq3B,EAAI0hF,QAAUA,EACR1hF,EAGR,OAAO0hF,EAraKmB,CAAiBl1G,EAAK0gB,EAAGjmB,EAAG5G,EAAGmH,EAAQm3G,EAAM93G,GACvD05G,EAAU/E,EAAiB,WAAjB,OAAqB+E,KAG1B,CAAE/4G,SAAQ+4G,YCjDrB,IAIaoB,GAA6BjoH,GAJ7B,OAGQ,CAAC,SAAU,QAAS,SAAU,YAAa,QAAS,WAAY,MAAO,OAAQ,MAAO,MAAO,iBAAkB,eAAgB,MAAO,YAAa,WAAY,MAAO,SAAU,SAAU,UAAW,SAAU,UAAW,OAAQ,OAAQ,KAAM,SAAU,YAAa,KAAM,KAAM,UAAW,oBAAqB,QAClQ,YAAmQ,IAAhQsxB,EAAgQ,EAAhQA,OAAQ6Q,EAAwP,EAAxPA,MAAOutB,EAAiP,EAAjPA,OAAQuS,EAAyO,EAAzOA,UAAWpzC,EAA8N,EAA9NA,SAAUq2C,EAAoN,EAApNA,MAAOzuD,EAA6M,EAA7MA,IAAKgC,EAAwM,EAAxMA,KAAMxB,EAAkM,EAAlMA,IAAKC,EAA6L,EAA7LA,IAAKgrD,EAAwL,EAAxLA,eAAgBuS,EAAwK,EAAxKA,aAAcnY,EAA0J,EAA1JA,IAAK6Q,EAAqJ,EAArJA,UAAWx8B,EAA0I,EAA1IA,SAAUrjC,EAAgI,EAAhIA,IAAK+/D,EAA2H,EAA3HA,OAAQhE,EAAmH,EAAnHA,OAAQtmB,EAA2G,EAA3GA,QAASr/B,EAAkG,EAAlGA,OAAQ6gD,EAA0F,EAA1FA,QAASxsD,EAAiF,EAAjFA,KAAM0pG,EAA2E,EAA3EA,KAAM7H,EAAqE,EAArEA,GAAIsC,EAAiE,EAAjEA,OAAQiF,EAAyD,EAAzDA,UAAWrpG,EAA8C,EAA9CA,GAAID,EAA0C,EAA1CA,GAAIstD,EAAsC,EAAtCA,QAAS28C,EAA6B,EAA7BA,kBAAmB55D,EAAU,EAAVA,IACvTggE,ECTD,YAAmI,IAAnG52F,EAAmG,EAAnGA,OAAQ2wC,EAA2F,EAA3FA,UAAWpzC,EAAgF,EAAhFA,SAAUpY,EAAsE,EAAtEA,IAAKgC,EAAiE,EAAjEA,KAAMxB,EAA2D,EAA3DA,IAAKC,EAAsD,EAAtDA,IAAKgrD,EAAiD,EAAjDA,eAAgB5F,EAAiC,EAAjCA,IAAK6Q,EAA4B,EAA5BA,UAAWx8B,EAAiB,EAAjBA,SAAUrjC,EAAO,EAAPA,IAoBjI,SAASm0G,EAAM7zG,EAAGuW,GAMhB,IALA,IAEIkqE,EAFE76D,EAAI5lB,EAAE1J,OACNikH,EAAKrlH,KAAK2T,IAAI0N,EAAYqP,GAE5B40F,EAAM,IAAI73G,MAAMijB,GAEX/yB,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB2nH,EAAI3nH,GAAK4nH,EAAY70F,EAAG,GACxB40F,EAAI3nH,GAAGA,GAAK,EAId,IADA,IAAI6nH,EAAMC,EAAO36G,GACV9K,KAAK2T,IAAI6xG,EAAI,KAAOxlH,KAAK2T,IAAI0xG,IAAK,CACvC,IAAM1nH,EAAI6nH,EAAI,GAAG,GACX9yG,EAAI8yG,EAAI,GAAG,GAEjB16G,EAAI+iB,EAAG/iB,EADPygF,EAAMm6B,EAAS56G,EAAEnN,GAAGA,GAAImN,EAAE4H,GAAGA,GAAI5H,EAAEnN,GAAG+U,IACvB/U,EAAG+U,GAClB4yG,EAAMK,EAAKL,EAAK/5B,EAAK5tF,EAAG+U,GACxB8yG,EAAMC,EAAO36G,GAGf,IADA,IAAMy2E,EAAKgkC,EAAY70F,EAAG,GACjB/yB,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB4jF,EAAG5jF,GAAKmN,EAAEnN,GAAGA,GAEf,OAAOioH,EAAQv2F,GAAMkyD,GAAKlyD,GAAMi2F,IAIlC,SAASO,EAAS/6G,EAAGuW,GAMnB,IALA,IAEIkqE,EAFE76D,EAAI5lB,EAAE1J,OACNikH,EAAK1xG,EAAI0N,EAAYqP,GAEvB40F,EAAM,IAAI73G,MAAMijB,GAEX/yB,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB2nH,EAAI3nH,GAAK4nH,EAAY70F,EAAG,GACxB40F,EAAI3nH,GAAGA,GAAK,EAId,IADA,IAAI6nH,EAAMM,EAAUh7G,GACb6I,EAAI6xG,EAAI,KAAO7xG,EAAI0xG,IAAK,CAC7B,IAAM1nH,EAAI6nH,EAAI,GAAG,GACX9yG,EAAI8yG,EAAI,GAAG,GAEjB16G,EAAIi7G,EAAMj7G,EADVygF,EAAMy6B,EAAYl7G,EAAEnN,GAAGA,GAAImN,EAAE4H,GAAGA,GAAI5H,EAAEnN,GAAG+U,IACvB/U,EAAG+U,GACrB4yG,EAAMW,EAAQX,EAAK/5B,EAAK5tF,EAAG+U,GAC3B8yG,EAAMM,EAAUh7G,GAGlB,IADA,IAAMy2E,EAAKgkC,EAAY70F,EAAG,GACjB/yB,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB4jF,EAAG5jF,GAAKmN,EAAEnN,GAAGA,GAGf,OAAOioH,EAAQv2F,GAAMkyD,GAAKlyD,GAAMi2F,IAIlC,SAASI,EAAUQ,EAAKC,EAAKC,GAC3B,IAAMC,EAASF,EAAMD,EACrB,OAAIlmH,KAAK2T,IAAI0yG,IAAU73F,EAAOi3B,QACrBzlD,KAAKoV,GAAK,EAEV,GAAMpV,KAAK2V,KAAK,EAAMywG,GAAOD,EAAMD,IAK9C,SAASF,EAAaE,EAAKC,EAAKC,GAC9B,IAAMC,EAAQt6F,EAASo6F,EAAKD,GAC5B,OAAIvyG,EAAI0yG,IAAU73F,EAAOi3B,QAChB4kB,GAAW,GAAGz0D,OAAOkQ,IAAI,GAEzBs5C,EAAe,GAAKzpD,EAAKk4B,EAAS,EAAKu4E,EAAK5sD,EAAI6sD,MAK3D,SAASV,EAAML,EAAK35C,EAAOhuE,EAAG+U,GAM5B,IALA,IAAMge,EAAI40F,EAAIlkH,OACRpD,EAAIgC,KAAKmU,IAAIw3D,GACbjsE,EAAIM,KAAKoU,IAAIu3D,GACb26C,EAAMf,EAAY70F,EAAG,GACrB61F,EAAMhB,EAAY70F,EAAG,GAClB1iB,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBs4G,EAAIt4G,GAAKhQ,EAAIsnH,EAAIt3G,GAAGrQ,GAAK+B,EAAI4lH,EAAIt3G,GAAG0E,GACpC6zG,EAAIv4G,GAAKtO,EAAI4lH,EAAIt3G,GAAGrQ,GAAKK,EAAIsnH,EAAIt3G,GAAG0E,GAEtC,IAAK,IAAI1E,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBs3G,EAAIt3G,GAAGrQ,GAAK2oH,EAAIt4G,GAChBs3G,EAAIt3G,GAAG0E,GAAK6zG,EAAIv4G,GAElB,OAAOs3G,EAGT,SAASW,EAASX,EAAK35C,EAAOhuE,EAAG+U,GAM/B,IALA,IAAMge,EAAI40F,EAAIlkH,OACRpD,EAAImW,EAAIw3D,GACRjsE,EAAI0U,EAAIu3D,GACR26C,EAAMf,EAAY70F,EAAG25C,EAAU,IAC/Bk8C,EAAMhB,EAAY70F,EAAG25C,EAAU,IAC5Br8D,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBs4G,EAAIt4G,GAAK+d,EAASqzC,EAAephE,EAAGsnH,EAAIt3G,GAAGrQ,IAAKyhE,EAAe1/D,EAAG4lH,EAAIt3G,GAAG0E,KACzE6zG,EAAIv4G,GAAKmxD,EAAUC,EAAe1/D,EAAG4lH,EAAIt3G,GAAGrQ,IAAKyhE,EAAephE,EAAGsnH,EAAIt3G,GAAG0E,KAE5E,IAAK,IAAI1E,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBs3G,EAAIt3G,GAAGrQ,GAAK2oH,EAAIt4G,GAChBs3G,EAAIt3G,GAAG0E,GAAK6zG,EAAIv4G,GAElB,OAAOs3G,EAIT,SAASS,EAAOS,EAAK76C,EAAOhuE,EAAG+U,GAc7B,IAbA,IAAMge,EAAI81F,EAAIplH,OACRpD,EAAIqsE,EAAUl2D,EAAIw3D,IAClBjsE,EAAI2qE,EAAUj2D,EAAIu3D,IAClB79B,EAAKsxB,EAAephE,EAAGA,GACvB6gD,EAAKugB,EAAe1/D,EAAGA,GACvB+mH,EAAMlB,EAAY70F,EAAG25C,EAAU,IAC/Bq8C,EAAMnB,EAAY70F,EAAG25C,EAAU,IAE/Bs8C,EAAQ94E,EAASw8B,EAAU,GAAIrsE,EAAG0B,EAAG8mH,EAAI7oH,GAAG+U,IAE5Ck0G,EAAMznD,EAAUpzC,EAASqzC,EAAetxB,EAAI04E,EAAI7oH,GAAGA,IAAKgpH,GAAQvnD,EAAevgB,EAAI2nE,EAAI9zG,GAAGA,KAC1Fm0G,EAAMr8G,EAAI40D,EAAevgB,EAAI2nE,EAAI7oH,GAAGA,IAAKgpH,EAAOvnD,EAAetxB,EAAI04E,EAAI9zG,GAAGA,KAEvE1E,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBy4G,EAAIz4G,GAAK+d,EAASqzC,EAAephE,EAAGwoH,EAAI7oH,GAAGqQ,IAAKoxD,EAAe1/D,EAAG8mH,EAAI9zG,GAAG1E,KACzE04G,EAAI14G,GAAKmxD,EAAUC,EAAe1/D,EAAG8mH,EAAI7oH,GAAGqQ,IAAKoxD,EAAephE,EAAGwoH,EAAI9zG,GAAG1E,KAG5Ew4G,EAAI7oH,GAAGA,GAAKipH,EACZJ,EAAI9zG,GAAGA,GAAKm0G,EACZL,EAAI7oH,GAAG+U,GAAK23D,EAAU,GACtBm8C,EAAI9zG,GAAG/U,GAAK0sE,EAAU,GAEtB,IAAK,IAAIr8D,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACjBA,IAAMrQ,GAAKqQ,IAAM0E,IACnB8zG,EAAI7oH,GAAGqQ,GAAKy4G,EAAIz4G,GAChBw4G,EAAIx4G,GAAGrQ,GAAK8oH,EAAIz4G,GAChBw4G,EAAI9zG,GAAG1E,GAAK04G,EAAI14G,GAChBw4G,EAAIx4G,GAAG0E,GAAKg0G,EAAI14G,IAGpB,OAAOw4G,EAIT,SAAS34F,EAAI24F,EAAK76C,EAAOhuE,EAAG+U,GAY1B,IAXA,IAAMge,EAAI81F,EAAIplH,OACRpD,EAAIgC,KAAKmU,IAAIw3D,GACbjsE,EAAIM,KAAKoU,IAAIu3D,GACb79B,EAAK9vC,EAAIA,EACT6gD,EAAKn/C,EAAIA,EACT+mH,EAAMlB,EAAY70F,EAAG,GACrBg2F,EAAMnB,EAAY70F,EAAG,GAErBk2F,EAAM94E,EAAK04E,EAAI7oH,GAAGA,GAAK,EAAIK,EAAI0B,EAAI8mH,EAAI7oH,GAAG+U,GAAKmsC,EAAK2nE,EAAI9zG,GAAGA,GAC3Dm0G,EAAMhoE,EAAK2nE,EAAI7oH,GAAGA,GAAK,EAAIK,EAAI0B,EAAI8mH,EAAI7oH,GAAG+U,GAAKo7B,EAAK04E,EAAI9zG,GAAGA,GAExD1E,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrBy4G,EAAIz4G,GAAKhQ,EAAIwoH,EAAI7oH,GAAGqQ,GAAKtO,EAAI8mH,EAAI9zG,GAAG1E,GACpC04G,EAAI14G,GAAKtO,EAAI8mH,EAAI7oH,GAAGqQ,GAAKhQ,EAAIwoH,EAAI9zG,GAAG1E,GAGtCw4G,EAAI7oH,GAAGA,GAAKipH,EACZJ,EAAI9zG,GAAGA,GAAKm0G,EACZL,EAAI7oH,GAAG+U,GAAK,EACZ8zG,EAAI9zG,GAAG/U,GAAK,EAEZ,IAAK,IAAIqQ,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACjBA,IAAMrQ,GAAKqQ,IAAM0E,IACnB8zG,EAAI7oH,GAAGqQ,GAAKy4G,EAAIz4G,GAChBw4G,EAAIx4G,GAAGrQ,GAAK8oH,EAAIz4G,GAChBw4G,EAAI9zG,GAAG1E,GAAK04G,EAAI14G,GAChBw4G,EAAIx4G,GAAG0E,GAAKg0G,EAAI14G,IAGpB,OAAOw4G,EAIT,SAASf,EAAQqB,GAIf,IAHA,IAAMp2F,EAAIo2F,EAAI1lH,OACV2lH,EAAS,EACTC,EAAQ,CAAC,EAAG,GACPrpH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI/U,EAAI,EAAG+U,EAAIge,EAAGhe,IACrB1S,KAAK2T,IAAIozG,GAAU/mH,KAAK2T,IAAImzG,EAAInpH,GAAG+U,MACrCq0G,EAAS/mH,KAAK2T,IAAImzG,EAAInpH,GAAG+U,IACzBs0G,EAAQ,CAACrpH,EAAG+U,IAIlB,MAAO,CAACs0G,EAAOD,GAIjB,SAASjB,EAAWgB,GAIlB,IAHA,IAAMp2F,EAAIo2F,EAAI1lH,OACV2lH,EAAS,EACTC,EAAQ,CAAC,EAAG,GACPrpH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI/U,EAAI,EAAG+U,EAAIge,EAAGhe,IACrBiB,EAAIozG,GAAUpzG,EAAImzG,EAAInpH,GAAG+U,MAC3Bq0G,EAASpzG,EAAImzG,EAAInpH,GAAG+U,IACpBs0G,EAAQ,CAACrpH,EAAG+U,IAIlB,MAAO,CAACs0G,EAAOD,GAIjB,SAASnB,EAAS/2G,EAAGgR,GAKnB,IAJA,IAAM6Q,EAAI7hB,EAAEzN,OACN4J,EAASyC,MAAMijB,GACfqzF,EAAUt2G,MAAMijB,GAEb1iB,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrB+1G,EAAQ/1G,GAAKP,MAAMijB,GAErB,IAAK,IAAI/yB,EAAI,EAAGA,EAAI+yB,EAAG/yB,IAAK,CAG1B,IAFA,IAAIspH,EAAQ,EACRvlG,EAAO7S,EAAE,GACJ6D,EAAI,EAAGA,EAAI7D,EAAEzN,OAAQsR,IACxBiB,EAAI9E,EAAE6D,IAAMiB,EAAI+N,KAElBA,EAAO7S,EADPo4G,EAAQv0G,IAIZ1H,EAAOrN,GAAKkR,EAAE6B,OAAOu2G,EAAO,GAAG,GAC/B,IAAK,IAAIj5G,EAAI,EAAGA,EAAI0iB,EAAG1iB,IACrB+1G,EAAQ/1G,GAAGrQ,GAAKkiB,EAAE7R,GAAGi5G,GACrBpnG,EAAE7R,GAAG0C,OAAOu2G,EAAO,GAIvB,MAAO,CAAEj8G,SAAQ+4G,WASnB,SAASwB,EAAat4E,EAAMruC,GAI1B,IAFA,IAAM0P,EAAQ,IAAIb,MAAMw/B,GAEftvC,EAAI,EAAGA,EAAIsvC,EAAMtvC,IACxB2Q,EAAM3Q,GAAKiB,EAGb,OAAO0P,EAGT,OA/QA,SAAe0B,EAAK0gB,GAAgC,IAA7ByxF,EAA6B,uDAAtB3zF,EAAOi3B,QAASp7C,EAAM,uCAClD,GAAa,WAATA,EACF,OAAOs0G,EAAK3uG,EAAKmyG,GAGnB,GAAa,cAAT93G,EACF,OAAOw7G,EAAQ71G,EAAKmyG,GAGtB,MAAMt7G,UAAU,0BAA4BwD,IDPvB68G,CAAoB,CAAE14F,SAAQ2wC,YAAWpzC,WAAUw6C,SAAQtmB,UAASmiB,QAAOzuD,MAAKgC,OAAMxB,MAAKC,MAAKgrD,iBAAgB5F,MAAK6Q,YAAW5I,UAAS5zB,WAAUrjC,QACpK28G,EAAgBpF,GAAkB,CAAEvzF,SAAQ2wC,YAAWpzC,WAAU8hB,WAAUuxB,iBAAgBnf,UAAS0xB,eAAc18D,OAAMtB,MAAK02D,YAAWs0C,OAAM7H,KAAIt9C,MAAK4/C,SAAQiF,YAAWj8C,QAAOX,UAAS8I,SAAQlI,UAAS28C,oBAAmB55D,QAkCpO,OAAO/lB,EAAM,OAAQ,CAEnB5xB,MAAO,SAAU3C,GAEf,OAAOs8G,EADKx6D,EAAO9hD,KAIrB,0BAA2B,SAAUA,EAAGq3G,GAEtC,OAAOiF,EADKx6D,EAAO9hD,GACiBq3G,IAGtC/zD,OAAQ,SAAU6C,GAChB,MAA4Bm2D,EAAwBn2D,GAA5CjmD,EAAR,EAAQA,OAAQ+4G,EAAhB,EAAgBA,QAChB,MAAO,CACL/4G,OAAQ4hD,EAAO5hD,GACf+4G,QAASn3D,EAAOm3D,KAIpB,2BAA4B,SAAU9yD,EAAKkxD,GACzC,MAA4BiF,EAAwBn2D,EAAKkxD,GAAjDn3G,EAAR,EAAQA,OAAQ+4G,EAAhB,EAAgBA,QAChB,MAAO,CACL/4G,OAAQ4hD,EAAO5hD,GACf+4G,QAASn3D,EAAOm3D,OAKtB,SAASqD,EAAyBn2D,EAAKkxD,QACxB9gH,IAAT8gH,IACFA,EAAO3zF,EAAOi3B,SAGhB,IAAMxY,EAAOgkB,EAAIhkB,OAEjB,GAAoB,IAAhBA,EAAK7rC,QAAgB6rC,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAIQ,WAAW,gCAAkCyW,GAAOjX,GAAQ,KAGxE,IAAMj9B,EAAMihD,EAAI/C,UACVx9B,EAAIuc,EAAK,GAEf,GA4BF,SAAiBj9B,EAAK0gB,EAAGyxF,GACvB,IAAK,IAAIxkH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI,EAAGA,EAAIge,EAAGhe,IAErB,GAAI63D,EAAOF,EAAU12D,EAAIqB,EAAGhF,EAAIrS,GAAG+U,MAAOyvG,GACxC,OAAO,EAKb,OAAO,EAtCHkF,CAAOr3G,EAAK0gB,EAAGyxF,KAyCrB,SAAqBnyG,EAAK0gB,GACxB,IAAK,IAAI/yB,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI,EAAGA,EAAIge,EAAGhe,IACrB1C,EAAIrS,GAAG+U,GAAKqC,EAAG/E,EAAIrS,GAAG+U,IA3CxB40G,CAAWt3G,EAAK0gB,GAapB,SAAsB1gB,EAAK0gB,EAAGyxF,GAC5B,IAAK,IAAIxkH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI/U,EAAG+U,EAAIge,EAAGhe,IAErB,GAAI63D,EAAOF,EAAU12D,EAAIoY,EAAS/b,EAAIrS,GAAG+U,GAAI1C,EAAI0C,GAAG/U,MAAOwkH,GACzD,OAAO,EAKb,OAAO,EArBDoF,CAAYv3G,EAAK0gB,EAAGyxF,IAAO,CAC7B,IAAM93G,EAAOm9G,EAAYv2D,EAAKjhD,EAAK0gB,GACnC,OAAO00F,EAAep1G,EAAK0gB,EAAGyxF,EAAM93G,GAIxC,IAAMA,EAAOm9G,EAAYv2D,EAAKjhD,EAAK0gB,GACnC,OAAOy2F,EAAcn3G,EAAK0gB,EAAGyxF,EAAM93G,GAwCrC,SAASm9G,EAAav2D,EAAKjhD,EAAK0gB,GAE9B,IAAMrmB,EAAO4mD,EAAI3C,WAEjB,GAAa,WAATjkD,GAA8B,cAATA,GAAiC,YAATA,EAC/C,OAAOA,EAOT,IAJA,IAAIo9G,GAAY,EACZC,GAAS,EACTC,GAAa,EAERhqH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI,EAAGA,EAAIge,EAAGhe,IAAK,CAC1B,IAAMqiC,EAAK/kC,EAAIrS,GAAG+U,GAElB,GAAI6uC,EAASxM,IAAO2M,EAAW3M,GAC7B0yE,GAAY,OACP,GAAIjmE,EAAYzM,GACrB2yE,GAAS,MACJ,KAAIjmE,EAAU1M,GAGnB,MAAMluC,UAAU,+BAAiC68C,EAAO3O,IAFxD4yE,GAAa,GAWnB,GAJID,GAAUC,GACZ9uE,QAAQ+uE,KAAK,0EAGXD,EAAY,CACd,IAAK,IAAIhqH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI,EAAGA,EAAIge,EAAGhe,IACrB1C,EAAIrS,GAAG+U,GAAK+uD,EAAQzxD,EAAIrS,GAAG+U,IAI/B,MAAO,UAGT,GAAIg1G,EAAQ,CACV,IAAK,IAAI/pH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI,EAAGA,EAAIge,EAAGhe,IACrB1C,EAAIrS,GAAG+U,GAAK23D,EAAUr6D,EAAIrS,GAAG+U,IAIjC,MAAO,YAGT,GAAI+0G,EAAW,CACb,IAAK,IAAI9pH,EAAI,EAAGA,EAAI+yB,EAAG/yB,IACrB,IAAK,IAAI+U,EAAI,EAAGA,EAAIge,EAAGhe,IACrB1C,EAAIrS,GAAG+U,GAAKkO,EAAO5Q,EAAIrS,GAAG+U,IAI9B,MAAO,SAEP,MAAM7L,UAAU,+CEjMTghH,GAA6B3qH,GAH7B,OACQ,CAAC,QAAS,MAAO,MAAO,WAAY,MAAO,aAEM,YAAkD,IAA/CmiC,EAA+C,EAA/CA,MAAO1rB,EAAwC,EAAxCA,IAAKnJ,EAAmC,EAAnCA,IAAKymE,EAA8B,EAA9BA,SAAUzX,EAAoB,EAApBA,IAAK3rB,EAAe,EAAfA,SA0BvG,OAAOxO,EA7BI,OA6BQ,CAEjB+uB,OAAQ,SAAUt/C,GAEhB,IAAMm+B,EAAOn+B,EAAEm+B,OAEf,GAAoB,IAAhBA,EAAK7rC,QAAgB6rC,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAIQ,WAAW,gCACPyW,GAAOjX,GAAQ,KA2C/B,IAxCA,IAAM7tC,EAAI6tC,EAAK,GAgBTjN,EAmEV,SAAqB8nF,EAASn3F,GAE5B,IADA,IACS3iB,EAAI,EAAGA,EADM,GACaA,IACjC,IAAK,IAAI+R,EAAI,EAAGA,GAAK/R,EAAG+R,IAAK,CAC3B,IAAMrN,EAAI1E,EAAI+R,EACd,GAAIgoG,EAAcD,EAAS/nG,EAAGrN,GAAKie,EACjC,MAAO,CAAE5Q,EAAGA,EAAGrN,EAAGA,GAIxB,MAAM,IAAIyI,MAAM,oHA7EC6sG,CAiDnB,SAAuBl5G,GAGrB,IAFA,IAAM1P,EAAI0P,EAAEm+B,OAAO,GACf66E,EAAU,EACLnqH,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK,CAE1B,IADA,IAAIsqH,EAAS,EACJv1G,EAAI,EAAGA,EAAItT,EAAGsT,IACrBu1G,GAAUt0G,EAAI7E,EAAEtQ,IAAI,CAACb,EAAG+U,KAE1Bo1G,EAAU9nH,KAAK0N,IAAIu6G,EAAQH,GAE7B,OAAOA,EA/DWI,CAAap5G,GARjB,OAaNiR,EAAIigB,EAAOjgB,EACXrN,EAAIstB,EAAOttB,EASXy1G,EAAOt6E,EAAS/+B,EAAG9O,KAAK4U,IAAI,GAAIlC,IAGlCge,EAAIugD,EAAS7xE,GACbqxB,EAAIwgD,EAAS7xE,GAGbgpH,EAAS,EAGTC,EAAUF,EACVG,GAAa,EAER3qH,EAAI,EAAGA,GAAKoiB,EAAGpiB,IAClBA,EAAI,IACN0qH,EAAUx6E,EAASw6E,EAASF,GAC5BG,GAAaA,GAIf53F,EAAIlmB,EAAIkmB,EAAGmd,EAFXu6E,EAASA,GAAUroG,EAAIpiB,EAAI,KAAO,EAAIoiB,EAAIpiB,EAAI,GAAKA,GAEvB0qH,IAC5B53F,EAAIjmB,EAAIimB,EAAGod,EAASu6E,EAASE,EAAWD,IAM1C,IAHA,IAAIxkH,EAAIgqC,EAAS2rB,EAAI/oC,GAAIC,GAGhB/yB,EAAI,EAAGA,EAAI+U,EAAG/U,IACrBkG,EAAIgqC,EAAShqC,EAAGA,GAGlB,OAAOm+C,EAAelzC,GAClBA,EAAEsmD,mBAAmBvxD,GACrBA,KAwCR,SAASkkH,EAAeD,EAAS/nG,EAAGrN,GAElC,IADA,IAAI61G,EAAO,EACF5qH,EAAI,EAAGA,GAAKoiB,EAAGpiB,IACtB4qH,GAAQ5qH,EAGV,IADA,IAAI6qH,EAAUD,EACL5qH,EAAIoiB,EAAI,EAAGpiB,GAAK,EAAIoiB,EAAGpiB,IAC9B6qH,GAAW7qH,EAEb,IAAM8qH,EAAYD,GAAW,EAAIzoG,EAAI,GAErC,OAAO,EACL/f,KAAK4U,IAAIkzG,EAAU9nH,KAAK4U,IAAI,EAAGlC,GAAI,EAAIqN,GACvCwoG,EAAOA,GAAQC,EAAUC,OCrJlBC,GAA8BxrH,GAH9B,QACQ,CAAC,QAAS,MAAO,MAAO,WAAY,OAAQ,WAAY,MAAO,OAAQ,MAAO,aAE5B,YAA6E,IAA1EmiC,EAA0E,EAA1EA,MAAO1rB,EAAmE,EAAnEA,IAAKnJ,EAA8D,EAA9DA,IAAKqjC,EAAyD,EAAzDA,SAAU54B,EAA+C,EAA/CA,KAAM8W,EAAyC,EAAzCA,SAAUytC,EAA+B,EAA/BA,IAAKvsB,EAA0B,EAA1BA,KAAMv/B,EAAoB,EAApBA,IAAKujE,EAAe,EAAfA,SAanI,SAAS03C,EAAgB75G,GACvB,IAAIlN,EACAgnH,EAAa,EAEbppC,EAAI1wE,EACJywE,EAAItO,EAAShkC,EAAKn+B,IAEtB,EAAG,CACD,IAAM+5G,EAAKrpC,EAMX,GALAA,EAAI3xC,EAAS,GAAKrjC,EAAIq+G,EAAIrvD,EAAI+lB,KAC9BA,EAAI1xC,EAAS,GAAKrjC,EAAI+0E,EAAG/lB,EAAIqvD,MAE7BjnH,EAAQ8L,EAAIiG,EAAIoY,EAASyzD,EAAGqpC,MAvBb,QAyBaD,EA1BT,IA2BjB,MAAM,IAAIztG,MAAM,8EAEXvZ,EA5BQ,MA8BjB,OAAO49E,EAwBT,OAAOngD,EA3DI,QA2DQ,CACjB,iBAAkB,SAAUvwB,GAC1B,IAAMm+B,EAAO4U,EAAS/yC,GAAKA,EAAEm+B,OAASga,GAAUn4C,GAChD,OAAQm+B,EAAK7rC,QACX,KAAK,EAEH,GAAgB,IAAZ6rC,EAAK,GACP,OAAOh4B,EAAKnG,GAEZ,MAAM,IAAI2+B,WAAW,gCACTyW,GAAOjX,GAAQ,KAG/B,KAAK,EAKH,GAFaA,EAAK,KACLA,EAAK,GAEhB,OAAO07E,EAAe75G,GAEtB,MAAM,IAAI2+B,WAAW,gCACPyW,GAAOjX,GAAQ,KAGjC,QAEE,MAAM,IAAIQ,WAAW,iDACTyW,GAAOjX,GAAQ,YC7ExB67E,GAA+B5rH,GAV/B,SACQ,CACnB,QACA,SACA,WACA,cACA,eACA,QAGsE,YAAiE,IAA9DmiC,EAA8D,EAA9DA,MAAOutB,EAAuD,EAAvDA,OAAQ/e,EAA+C,EAA/CA,SAAU6lB,EAAqC,EAArCA,YAAaie,EAAwB,EAAxBA,aAAcnY,EAAU,EAAVA,IACvHqC,EAAchB,GAAkB,CAAEx7B,QAAOq0B,gBACzCoI,EAAcV,GAAkB,CAAE/7B,UAiCxC,OAAOA,EAAM,SAAUuqB,GAAO,CAG5B,iCAAkC,SAAU9+C,EAAGyK,GAK7C,OAAOs4B,EAAS/iC,EAAG0uD,EAAIjkD,KAGzB,mBAAoB,SAAUzK,EAAGyK,GAC/B,OAAOumD,EAAYhxD,EAAGyK,EAAGo8D,GAAc,IAGzC,oBAAqB,SAAU7mE,EAAGyK,GAChC,OAAOsmD,EAAY/wD,EAAGyK,EAAGo8D,GAAc,IAGzC,aAAc,SAAU7mE,EAAGyK,GAEzB,OAAOumD,EAAYlP,EAAO9hD,GAAIyK,EAAGo8D,GAAc,GAAO12D,WAGxD,sBAAuB,SAAUnQ,EAAGyK,GAClC,OAAOs4B,EAAS/iC,EAAG0uD,EAAIjkD,MAExBo8D,EAAa1vC,gBC9DL8mF,GAAiC7rH,GAZjC,WACQ,CACnB,QACA,YACA,WACA,eACA,iBACA,aACA,OACA,QAGwE,YAAyF,IAAtFmiC,EAAsF,EAAtFA,MAAO8/B,EAA+E,EAA/EA,UAAWpzC,EAAoE,EAApEA,SAAUqzC,EAA0D,EAA1DA,eAAgBuS,EAA0C,EAA1CA,aAAcnX,EAA4B,EAA5BA,WAAYvlD,EAAgB,EAAhBA,KAAMtB,EAAU,EAAVA,IAsDvJ,OAAO0rB,EAlEI,WAkEQ,CACjB,sBAAuB,SAAUv0B,EAAGyK,EAAGvB,GAErC,GAAiB,IAAblJ,EAAE1J,QAA6B,IAAbmU,EAAEnU,QAA6B,IAAb4S,EAAE5S,OAAc,CACtD,IAAK4nH,EAAIl+G,GAAM,MAAM,IAAIjE,UAAU,kEACnC,IAAKmiH,EAAIzzG,GAAM,MAAM,IAAI1O,UAAU,mEACnC,IAAKmiH,EAAIh1G,GAAM,MAAM,IAAInN,UAAU,kEACnC,IAAM9I,EAAI4zE,EAAa5lD,EAAS/X,EAAE,GAAIA,EAAE,IAAK+X,EAASxW,EAAE,GAAIA,EAAE,KACxD0zG,EAAS7pD,EAAeA,EAAerhE,EAAGA,GAAIwX,EAAE,IAChD2zG,EAAS1uD,EAAW4E,EAAerhE,EAAGwX,EAAE,KACxC4zG,EAAWr+G,EAAE,GAEnB,OAAOs+G,EAAqBt+G,EAAE,GAAIA,EAAE,GAAIm+G,EAAQC,EAAQC,GAExD,MAAM,IAAItiH,UAAU,iCAGxB,yBAA0B,SAAUiE,EAAGyK,EAAGvB,GACxC,GAA8B,IAA1B3V,OAAOkS,KAAKzF,GAAG1J,QAA0C,IAA1B/C,OAAOkS,KAAKgF,GAAGnU,QAA0C,IAA1B/C,OAAOkS,KAAKyD,GAAG5S,OAAc,CAC7F,IAAK4nH,EAAIl+G,GAAM,MAAM,IAAIjE,UAAU,+DACnC,IAAKmiH,EAAIzzG,GAAM,MAAM,IAAI1O,UAAU,uEACnC,IAAKmiH,EAAIh1G,GAAM,MAAM,IAAInN,UAAU,uEACnC,GAAI,WAAYiE,GAAK,WAAYA,GAAK,eAAgByK,GACpD,eAAgBA,GAAK,eAAgBvB,GAAK,eAAgBA,EAAG,CAC7D,IAAMjW,EAAI4zE,EAAa5lD,EAAS/X,EAAEq1G,WAAYr1G,EAAEs1G,YAAav9F,EAASxW,EAAEg0G,WAAYh0G,EAAEi0G,aAChFP,EAAS7pD,EAAeA,EAAerhE,EAAGA,GAAIwX,EAAEi0G,YAChDN,EAAS1uD,EAAW4E,EAAerhE,EAAGwX,EAAEi0G,aACxCL,EAAWr+G,EAAE2+G,OAEnB,OAAOL,EAAqBt+G,EAAE2+G,OAAQ3+G,EAAE4+G,OAAQT,EAAQC,EAAQC,GAEhE,MAAM,IAAItiH,UAAU,0BAGtB,MAAM,IAAIA,UAAU,iCAGxB,eAAgB,SAAUiE,EAAGyK,GAE3B,GAAiB,IAAbzK,EAAE1J,QAA6B,IAAbmU,EAAEnU,OAAc,CACpC,IAAK4nH,EAAIl+G,GACP,MAAM,IAAIjE,UAAU,kEAEtB,IAAK8iH,EAAIp0G,GACP,MAAM,IAAI1O,UAAU,mEAGtB,OAAOuiH,EAAqBt+G,EAAE,GAAIA,EAAE,GAAIyK,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACjD,GAAiB,IAAbzK,EAAE1J,QAA6B,IAAbmU,EAAEnU,OAAc,CAE3C,IAAKuoH,EAAI7+G,GACP,MAAM,IAAIjE,UAAU,kEAEtB,IAAK+iH,EAAgBr0G,GACnB,MAAM,IAAI1O,UAAU,mEAGtB,OAAOgjH,EAAqB/+G,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIyK,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACzE,GAAIzK,EAAE1J,SAAWmU,EAAEnU,QAAU0J,EAAE1J,OAAS,EAAG,CAEhD,IAAK0oH,EAAqBh/G,GACxB,MAAM,IAAIjE,UAAU,0DAEtB,IAAKijH,EAAqBv0G,GACxB,MAAM,IAAI1O,UAAU,0DAGtB,OAAOkjH,EAAmBj/G,EAAGyK,GAE7B,MAAM,IAAI1O,UAAU,iCAGxB,iBAAkB,SAAUiE,EAAGyK,GAC7B,GAA8B,IAA1BlX,OAAOkS,KAAKzF,GAAG1J,QAA0C,IAA1B/C,OAAOkS,KAAKgF,GAAGnU,OAAc,CAC9D,IAAK4nH,EAAIl+G,GACP,MAAM,IAAIjE,UAAU,+DAEtB,IAAK8iH,EAAIp0G,GACP,MAAM,IAAI1O,UAAU,iFAEtB,GAAI,WAAYiE,GAAK,WAAYA,GAAK,eAAgByK,GAAK,eAAgBA,GAAK,aAAcA,EAC5F,OAAO6zG,EAAqBt+G,EAAE2+G,OAAQ3+G,EAAE4+G,OAAQn0G,EAAEy0G,WAAYz0G,EAAE00G,WAAY10G,EAAE4zG,UAE9E,MAAM,IAAItiH,UAAU,0BAEjB,GAA8B,IAA1BxI,OAAOkS,KAAKzF,GAAG1J,QAA0C,IAA1B/C,OAAOkS,KAAKgF,GAAGnU,OAAc,CAErE,IAAKuoH,EAAI7+G,GACP,MAAM,IAAIjE,UAAU,uEAEtB,IAAK+iH,EAAgBr0G,GACnB,MAAM,IAAI1O,UAAU,oEAEtB,GAAI,WAAYiE,GAAK,WAAYA,GAAK,OAAQyK,GAAK,OAAQA,GAAK,OAAQA,GAAK,MAAOA,GAAK,MAAOA,GAAK,MAAOA,EAC1G,OAAOs0G,EAAqB/+G,EAAE2+G,OAAQ3+G,EAAE4+G,OAAQ5+G,EAAEo/G,OAAQ30G,EAAE40G,GAAI50G,EAAE60G,GAAI70G,EAAE80G,GAAI90G,EAAE/B,EAAG+B,EAAE9B,EAAG8B,EAAEvX,GAExF,MAAM,IAAI6I,UAAU,0BAEjB,GAA8B,IAA1BxI,OAAOkS,KAAKzF,GAAG1J,QAA0C,IAA1B/C,OAAOkS,KAAKgF,GAAGnU,OAAc,CAErE,IAAK4nH,EAAIl+G,GACP,MAAM,IAAIjE,UAAU,qEAEtB,IAAKmiH,EAAIzzG,GACP,MAAM,IAAI1O,UAAU,qEAEtB,GAAI,cAAeiE,GAAK,cAAeA,GAAK,cAAeyK,GAAK,cAAeA,EAC7E,OAAOw0G,EAAmB,CAACj/G,EAAEw/G,UAAWx/G,EAAEy/G,WAAY,CAACh1G,EAAEi1G,UAAWj1G,EAAEk1G,YAEtE,MAAM,IAAI5jH,UAAU,0BAEjB,GAA8B,IAA1BxI,OAAOkS,KAAKzF,GAAG1J,QAA0C,IAA1B/C,OAAOkS,KAAKgF,GAAGnU,OAAc,CAErE,IAAKuoH,EAAI7+G,GACP,MAAM,IAAIjE,UAAU,gFAEtB,IAAK8iH,EAAIp0G,GACP,MAAM,IAAI1O,UAAU,gFAEtB,GAAI,cAAeiE,GAAK,cAAeA,GAAK,cAAeA,GACzD,cAAeyK,GAAK,cAAeA,GAAK,cAAeA,EAEvD,OAAOw0G,EAAmB,CAACj/G,EAAEw/G,UAAWx/G,EAAEy/G,UAAWz/G,EAAE4/G,WAAY,CAACn1G,EAAEi1G,UAAWj1G,EAAEk1G,UAAWl1G,EAAEo1G,YAEhG,MAAM,IAAI9jH,UAAU,0BAGtB,MAAM,IAAIA,UAAU,iCAGxB4G,MAAO,SAAUuC,GACf,IAoDJ,SAAoBwD,GAElB,GAAoB,IAAhBA,EAAE,GAAGpS,QAAgBwpH,EAAUp3G,EAAE,GAAG,KAAOo3G,EAAUp3G,EAAE,GAAG,KAC5D,GAAIA,EAAE+jB,MAAK,SAAAszF,GAAE,OAAkB,IAAdA,EAAGzpH,SAAiBwpH,EAAUC,EAAG,MAAQD,EAAUC,EAAG,OACrE,OAAO,MAEJ,MAAoB,IAAhBr3G,EAAE,GAAGpS,QAAgBwpH,EAAUp3G,EAAE,GAAG,KAAOo3G,EAAUp3G,EAAE,GAAG,KAAOo3G,EAAUp3G,EAAE,GAAG,KAKzF,OAAO,EAJP,GAAIA,EAAE+jB,MAAK,SAAAszF,GAAE,OAAkB,IAAdA,EAAGzpH,SAAiBwpH,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MAAQD,EAAUC,EAAG,OAC1F,OAAO,EAKX,OAAO,EAjEAC,CAAU96G,GAAQ,MAAM,IAAInJ,UAAU,oEAE3C,OA4FJ,SAA4B2M,GAI1B,IAHA,IAAMhL,EAAS,GACXuiH,EAAS,GACTC,EAAS,GACJrtH,EAAI,EAAGA,EAAI6V,EAAEpS,OAAS,EAAGzD,IAChC,IAAK,IAAI+U,EAAI/U,EAAI,EAAG+U,EAAIc,EAAEpS,OAAQsR,IACZ,IAAhBc,EAAE,GAAGpS,QACP2pH,EAAS,CAACv3G,EAAE7V,GAAG,GAAI6V,EAAE7V,GAAG,IACxBqtH,EAAS,CAACx3G,EAAEd,GAAG,GAAIc,EAAEd,GAAG,KACC,IAAhBc,EAAE,GAAGpS,SACd2pH,EAAS,CAACv3G,EAAE7V,GAAG,GAAI6V,EAAE7V,GAAG,GAAI6V,EAAE7V,GAAG,IACjCqtH,EAAS,CAACx3G,EAAEd,GAAG,GAAIc,EAAEd,GAAG,GAAIc,EAAEd,GAAG,KAEnClK,EAAOwQ,KAAK+wG,EAAmBgB,EAAQC,IAG3C,OAAOxiH,EA5GEyiH,CAAkBj7G,MAI7B,SAAS46G,EAAWp3G,GAElB,MAAqB,iBAANA,GAAkBguC,EAAYhuC,GAG/C,SAASw1G,EAAKx1G,GAKZ,OAHIA,EAAE9S,cAAgB+M,QACpB+F,EAAI03G,EAAe13G,IAEdo3G,EAAUp3G,EAAE,KAAOo3G,EAAUp3G,EAAE,IAGxC,SAASm2G,EAAKn2G,GAKZ,OAHIA,EAAE9S,cAAgB+M,QACpB+F,EAAI03G,EAAe13G,IAEdo3G,EAAUp3G,EAAE,KAAOo3G,EAAUp3G,EAAE,KAAOo3G,EAAUp3G,EAAE,IAG3D,SAASs2G,EAAsBt2G,GAK7B,OAHK/F,MAAMP,QAAQsG,KACjBA,EAAI03G,EAAe13G,IAEdA,EAAEgkB,MAAMozF,GAGjB,SAAShB,EAAiBp2G,GAIxB,OAHIA,EAAE9S,cAAgB+M,QACpB+F,EAAI03G,EAAe13G,IAEdo3G,EAAUp3G,EAAE,KAAOo3G,EAAUp3G,EAAE,KAAOo3G,EAAUp3G,EAAE,KACvDo3G,EAAUp3G,EAAE,KAAOo3G,EAAUp3G,EAAE,KAAOo3G,EAAUp3G,EAAE,IAGtD,SAAS03G,EAAgB9sH,GAGvB,IAFA,IAAMmS,EAAOlS,OAAOkS,KAAKnS,GACnBoV,EAAI,GACD7V,EAAI,EAAGA,EAAI4S,EAAKnP,OAAQzD,IAC/B6V,EAAEwF,KAAK5a,EAAEmS,EAAK5S,KAEhB,OAAO6V,EAmBT,SAAS41G,EAAsBt+G,EAAGyK,EAAG/B,EAAGC,EAAGzV,GACzC,IAAM4qB,EAAMjV,EAAIwrD,EAAUA,EAAUC,EAAe5rD,EAAG1I,GAAIs0D,EAAe3rD,EAAG8B,IAAKvX,IAC3EmtH,EAAMl2G,EAAKkqD,EAAUC,EAAe5rD,EAAGA,GAAI4rD,EAAe3rD,EAAGA,KACnE,OAAOk+D,EAAa/oD,EAAKuiG,GAG3B,SAAStB,EAAsB/+G,EAAGyK,EAAGvB,EAAGm2G,EAAIC,EAAIC,EAAI72G,EAAGC,EAAGzV,GACxD,IAAI4qB,EAAM,CAACmD,EAASqzC,EAAerzC,EAASq+F,EAAI70G,GAAIvX,GAAIohE,EAAerzC,EAASs+F,EAAIr2G,GAAIP,IACtFsY,EAASqzC,EAAerzC,EAASs+F,EAAIr2G,GAAIR,GAAI4rD,EAAerzC,EAASo+F,EAAIr/G,GAAI9M,IAC7E+tB,EAASqzC,EAAerzC,EAASo+F,EAAIr/G,GAAI2I,GAAI2rD,EAAerzC,EAASq+F,EAAI70G,GAAI/B,KAC/EoV,EAAM3T,EAAKkqD,EAAUA,EAAUC,EAAex2C,EAAI,GAAIA,EAAI,IAAKw2C,EAAex2C,EAAI,GAAIA,EAAI,KAAMw2C,EAAex2C,EAAI,GAAIA,EAAI,MAC3H,IAAMuiG,EAAMl2G,EAAKkqD,EAAUA,EAAUC,EAAe5rD,EAAGA,GAAI4rD,EAAe3rD,EAAGA,IAAK2rD,EAAephE,EAAGA,KACpG,OAAO2zE,EAAa/oD,EAAKuiG,GAG3B,SAASpB,EAAoBj/G,EAAGyK,GAI9B,IAHA,IAAM61G,EAAatgH,EAAE1J,OACjBoH,EAAS,EACTk9C,EAAO,EACF/nD,EAAI,EAAGA,EAAIytH,EAAYztH,IAC9B+nD,EAAO35B,EAASjhB,EAAEnN,GAAI4X,EAAE5X,IACxB6K,EAAS22D,EAAUC,EAAe1Z,EAAMA,GAAOl9C,GAEjD,OAAOyM,EAAKzM,OC5RH6iH,GAAkCnuH,GALlC,YACQ,CACnB,QAAS,SAAU,MAAO,MAAO,YAAa,SAAU,WAAY,iBAAkB,eAAgB,WAAY,UAAW,cAAe,UAAW,SAAU,cAGxF,YAAwJ,IAArJmiC,EAAqJ,EAArJA,MAAO7Q,EAA8I,EAA9IA,OAAQ7a,EAAsI,EAAtIA,IAAKnJ,EAAiI,EAAjIA,IAAK20D,EAA4H,EAA5HA,UAAWvS,EAAiH,EAAjHA,OAAQ/e,EAAyG,EAAzGA,SAAUuxB,EAA+F,EAA/FA,eAAgBuS,EAA+E,EAA/EA,aAAc5lD,EAAiE,EAAjEA,SAAUs2C,EAAuD,EAAvDA,QAAS3O,EAA8C,EAA9CA,YAAazT,EAAiC,EAAjCA,QAASr7B,EAAwB,EAAxBA,OAAQmuC,EAAgB,EAAhBA,UA4BjN,OAAO1zB,EAAM,YAAa,CACxB,sBAAuBisF,EAEvB,6BAA8BC,EAE9B,yBAA0B,SAAUzgH,EAAGyK,EAAGi2G,GACxC,IAAMx7G,EAAMs7G,EAAKxgH,EAAEmQ,UAAW1F,EAAE0F,UAAWuwG,EAAMvwG,WACjD,OAAe,OAARjL,EAAe,KAAO48C,EAAO58C,IAGtC,iCAAkC,SAAU4S,EAAG9X,EAAGyK,EAAGvB,GAEnD,IAAMhE,EAAMu7G,EAAM3oG,EAAE3H,UAAWnQ,EAAEmQ,UAAW1F,EAAE0F,UAAWjH,EAAEiH,WAC3D,OAAe,OAARjL,EAAe,KAAO48C,EAAO58C,MAIxC,SAASs7G,EAAMxgH,EAAGyK,EAAGi2G,GAKnB,GAJA1gH,EAAI2gH,EAAW3gH,GACfyK,EAAIk2G,EAAWl2G,GACfi2G,EAAQC,EAAWD,IAEd7B,EAAI7+G,GAAM,MAAM,IAAIjE,UAAU,kEACnC,IAAK8iH,EAAIp0G,GAAM,MAAM,IAAI1O,UAAU,mEACnC,IAmDF,SAAciE,GACZ,OAAoB,IAAbA,EAAE1J,QAAgB2xD,EAAUjoD,EAAE,KAAOioD,EAAUjoD,EAAE,KAAOioD,EAAUjoD,EAAE,KAAOioD,EAAUjoD,EAAE,IApDzF4gH,CAAIF,GAAU,MAAM,IAAI3kH,UAAU,mDAEvC,OAwGF,SAA8BgnB,EAAI89F,EAAIC,EAAI9jG,EAAI+jG,EAAIC,EAAIhhH,EAAGyK,EAAGvB,EAAGhW,GAC7D,IAAM+tH,EAAM3sD,EAAevxC,EAAI/iB,GACzBkhH,EAAM5sD,EAAet3C,EAAIhd,GACzBmhH,EAAM7sD,EAAeusD,EAAIp2G,GACzB22G,EAAM9sD,EAAeysD,EAAIt2G,GACzB42G,EAAM/sD,EAAewsD,EAAI53G,GACzBo4G,EAAMhtD,EAAe0sD,EAAI93G,GAEzB4Z,EAAY7B,EAASA,EAASA,EAAS/tB,EAAG+tH,GAAME,GAAME,GACtDzjG,EAAcqD,EAASA,EAASA,EAASozC,EAAUA,EAAU6sD,EAAKE,GAAME,GAAML,GAAME,GAAME,GAE1FttH,EAAI8yE,EAAa/jD,EAAWlF,GAE5Bb,EAAKs3C,EAAUtxC,EAAIuxC,EAAevgE,EAAGktB,EAASjE,EAAI+F,KAClDw+F,EAAKltD,EAAUwsD,EAAIvsD,EAAevgE,EAAGktB,EAAS8/F,EAAIF,KAClDW,EAAKntD,EAAUysD,EAAIxsD,EAAevgE,EAAGktB,EAAS+/F,EAAIF,KACxD,MAAO,CAAC/jG,EAAIwkG,EAAIC,GAxHTC,CAAoBzhH,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIyK,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIi2G,EAAM,GAAIA,EAAM,GAAIA,EAAM,GAAIA,EAAM,IAGrG,SAASD,EAAO3oG,EAAG9X,EAAGyK,EAAGvB,GAMvB,GALA4O,EAAI6oG,EAAW7oG,GACf9X,EAAI2gH,EAAW3gH,GACfyK,EAAIk2G,EAAWl2G,GACfvB,EAAIy3G,EAAWz3G,GAEE,IAAb4O,EAAExhB,OAAc,CAClB,IAAK4nH,EAAIpmG,GAAM,MAAM,IAAI/b,UAAU,kEACnC,IAAKmiH,EAAIl+G,GAAM,MAAM,IAAIjE,UAAU,mEACnC,IAAKmiH,EAAIzzG,GAAM,MAAM,IAAI1O,UAAU,kEACnC,IAAKmiH,EAAIh1G,GAAM,MAAM,IAAInN,UAAU,mEAEnC,OAsCJ,SAAuB2lH,EAAKC,EAAKC,EAAKC,GACpC,IAAMC,EAAKJ,EACLK,EAAKH,EACL/hG,EAAKoB,EAAS6gG,EAAIH,GAClB7hG,EAAKmB,EAAS8gG,EAAIF,GAClBpnB,EAAMx5E,EAASqzC,EAAez0C,EAAG,GAAIC,EAAG,IAAKw0C,EAAex0C,EAAG,GAAID,EAAG,KAC5E,GAAI/F,EAAO2gF,GAAM,OAAO,KACxB,GAAIljC,EAAQ1uD,EAAI4xF,GAAM/2E,EAAOi3B,SAC3B,OAAO,KAET,IAAMqnE,EAAS1tD,EAAex0C,EAAG,GAAIgiG,EAAG,IAClCG,EAAS3tD,EAAex0C,EAAG,GAAIgiG,EAAG,IAClCI,EAAS5tD,EAAex0C,EAAG,GAAIiiG,EAAG,IAClCI,EAAS7tD,EAAex0C,EAAG,GAAIiiG,EAAG,IAClChuH,EAAI8yE,EAAaxS,EAAUpzC,EAASA,EAAS+gG,EAAQC,GAASC,GAASC,GAAS1nB,GACtF,OAAO/6F,EAAIqjC,EAASljB,EAAI9rB,GAAI+tH,GArDnBM,CAAatqG,EAAG9X,EAAGyK,EAAGvB,GACxB,GAAiB,IAAb4O,EAAExhB,OAAc,CACzB,IAAKuoH,EAAI/mG,GAAM,MAAM,IAAI/b,UAAU,kEACnC,IAAK8iH,EAAI7+G,GAAM,MAAM,IAAIjE,UAAU,mEACnC,IAAK8iH,EAAIp0G,GAAM,MAAM,IAAI1O,UAAU,kEACnC,IAAK8iH,EAAI31G,GAAM,MAAM,IAAInN,UAAU,mEAEnC,OAyDJ,SAAuBgnB,EAAI89F,EAAIC,EAAI9jG,EAAI+jG,EAAIC,EAAIqB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAMC,EAAQC,EAAmB7/F,EAAIs/F,EAAIG,EAAIH,EAAIxB,EAAIyB,EAAIG,EAAIH,EAAIxB,EAAIyB,EAAIG,EAAIH,GACvEM,EAAQD,EAAmBJ,EAAIH,EAAIrlG,EAAI+F,EAAI0/F,EAAIH,EAAIvB,EAAIF,EAAI6B,EAAIH,EAAIvB,EAAIF,GACvEgC,EAAQF,EAAmB7/F,EAAIs/F,EAAIrlG,EAAI+F,EAAI89F,EAAIyB,EAAIvB,EAAIF,EAAIC,EAAIyB,EAAIvB,EAAIF,GACvEiC,EAAQH,EAAmBJ,EAAIH,EAAIG,EAAIH,EAAII,EAAIH,EAAIG,EAAIH,EAAII,EAAIH,EAAIG,EAAIH,GACvES,EAAQJ,EAAmB5lG,EAAI+F,EAAI/F,EAAI+F,EAAIg+F,EAAIF,EAAIE,EAAIF,EAAIG,EAAIF,EAAIE,EAAIF,GACvEh+F,EAAY7B,EAASqzC,EAAequD,EAAOE,GAAQvuD,EAAewuD,EAAOC,IACzEnlG,EAAcqD,EAASqzC,EAAe0uD,EAAOD,GAAQzuD,EAAeuuD,EAAOA,IACjF,GAAI/oG,EAAO8D,GAAc,OAAO,KAChC,IAAMqlG,EAAKp8C,EAAa/jD,EAAWlF,GAC7BslG,EAAKr8C,EAAaxS,EAAUsuD,EAAOruD,EAAe2uD,EAAIJ,IAASE,GAE/DI,EAAM9uD,EAAUtxC,EAAIuxC,EAAe2uD,EAAIhiG,EAASjE,EAAI+F,KACpDqgG,EAAM/uD,EAAUwsD,EAAIvsD,EAAe2uD,EAAIhiG,EAAS8/F,EAAIF,KACpDwC,EAAMhvD,EAAUysD,EAAIxsD,EAAe2uD,EAAIhiG,EAAS+/F,EAAIF,KACpDwC,EAAMjvD,EAAUguD,EAAI/tD,EAAe4uD,EAAIjiG,EAASuhG,EAAIH,KACpDkB,EAAMlvD,EAAUiuD,EAAIhuD,EAAe4uD,EAAIjiG,EAASwhG,EAAIH,KACpDkB,EAAMnvD,EAAUkuD,EAAIjuD,EAAe4uD,EAAIjiG,EAASyhG,EAAIH,KAC1D,OAAI35D,EAAYu6D,EAAKG,IAAQ16D,EAAYw6D,EAAKG,IAAQ36D,EAAYy6D,EAAKG,GAC9D,CAACL,EAAKC,EAAKC,GAEX,KA9EAI,CAAa3rG,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAI9X,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIyK,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIvB,EAAE,GAAIA,EAAE,GAAIA,EAAE,IAExF,MAAM,IAAInN,UAAU,uDAKxB,SAAS4kH,EAAYz7G,GAEnB,OAAmB,IAAfA,EAAI5O,OAAqB4O,EAAI,GAG7BA,EAAI5O,OAAS,GAAKqM,MAAMP,QAAQ8C,EAAI,KAClCA,EAAIwnB,OAAM,SAAAud,GAAE,OAAItnC,MAAMP,QAAQ6nC,IAAqB,IAAdA,EAAG3zC,UAAsB6+C,EAAQjwC,GAGrEA,EAGT,SAASg5G,EAAKl+G,GACZ,OAAoB,IAAbA,EAAE1J,QAAgB2xD,EAAUjoD,EAAE,KAAOioD,EAAUjoD,EAAE,IAG1D,SAAS6+G,EAAK7+G,GACZ,OAAoB,IAAbA,EAAE1J,QAAgB2xD,EAAUjoD,EAAE,KAAOioD,EAAUjoD,EAAE,KAAOioD,EAAUjoD,EAAE,IAyB7E,SAAS4iH,EAAoBl6G,EAAGC,EAAGzV,EAAGC,EAAG+hB,EAAGje,EAAG6yC,EAAG8J,EAAG/gD,EAAG+U,EAAG1E,EAAGpQ,GAE5D,IAAM4wH,EAAOpvD,EAAerzC,EAASvY,EAAGC,GAAIsY,EAAS/tB,EAAGC,IAClDwwH,EAAOrvD,EAAerzC,EAAS/L,EAAGje,GAAIgqB,EAAS6oB,EAAG8J,IAClDgwE,EAAOtvD,EAAerzC,EAASpuB,EAAG+U,GAAIqZ,EAAS/d,EAAGpQ,IACxD,OAAOuhE,EAAUA,EAAUqvD,EAAMC,GAAOC,OClI/BC,GAA4BzxH,GAH5B,MACQ,CAAC,QAAS,SAAU,MAAO,YAEqB,YAAqC,IAAlCmiC,EAAkC,EAAlCA,MAAO7Q,EAA2B,EAA3BA,OAAQhkB,EAAmB,EAAnBA,IAAKglE,EAAc,EAAdA,QAwB1F,OAAOnwC,EA3BI,MA2BQ,CAEjB,iBAAkBuvF,EAGlB,qCAwCF,SAAmBtgH,EAAO84C,GACxB,IAEE,OADYuB,GAAOr6C,EAAO84C,EAAK58C,GAE/B,MAAO63B,GACP,MAAM+sC,GAAoB/sC,EAAK,SA1CjC,MAAO,SAAUtnB,GACf,GAAIq2C,GAAoBr2C,GACtB,MAAM,IAAIlU,UAAU,0CAGtB,OAAO+nH,EAAK7zG,MAUhB,SAAS6zG,EAAMtgH,GACb,IAAIof,EAkBJ,OAhBA2jC,GAAY/iD,GAAO,SAAU1P,GAC3B,IACE8uB,OAAersB,IAARqsB,EAAqB9uB,EAAQ4L,EAAIkjB,EAAK9uB,GAC7C,MAAOyjC,GACP,MAAM+sC,GAAoB/sC,EAAK,MAAOzjC,YAK9ByC,IAARqsB,IACFA,EAAM8hD,EAAQ,EAAGhhD,EAAO5N,SAEP,iBAAR8M,IACTA,EAAM8hD,EAAQ9hD,EAAKc,EAAO5N,SAGrB8M,MC/DEmhG,GAA+B3xH,GAH/B,SACQ,CAAC,QAAS,MAAO,cAEkC,YAA+B,IAA5BmiC,EAA4B,EAA5BA,MAAO70B,EAAqB,EAArBA,IAAKy5F,EAAgB,EAAhBA,UA2BrF,OAAO5kE,EA9BI,SA8BQ,CAEjB5xB,MAAOqhH,EACP1gE,OAAQ,SAAUxB,GAChB,OAAOA,EAAO3tD,OAAO6vH,EAAQliE,EAAO3xC,aAItC,4BAA6B8zG,EAC7B,6BAA8B,SAAUniE,EAAQxF,GAC9C,OAAOwF,EAAO3tD,OAAO8vH,EAAYniE,EAAO3xC,UAAWmsC,KAIrD,MAAO,SAAUrsC,GACf,GAAIq2C,GAAoBr2C,GACtB,MAAM,IAAIlU,UAAU,uDAGtB,OAAOioH,EAAQ/zG,MAUnB,SAAS+zG,EAASxgH,GAChB,IACE,OAAO0gH,EAAW1gH,GAClB,MAAO+zB,GACP,MAAM+sC,GAAoB/sC,EA/DnB,WAmEX,SAAS2sF,EAAY1gH,GACnB,GAAqB,IAAjBA,EAAMlN,OACR,MAAO,GAIT,IADA,IAAM6tH,EAAO,CAAChrB,EAAU31F,EAAM,KACrB3Q,EAAI,EAAGA,EAAI2Q,EAAMlN,SAAUzD,EAIlCsxH,EAAKj2G,KAAKxO,EAAIykH,EAAKtxH,EAAI,GAAI2Q,EAAM3Q,KAEnC,OAAOsxH,EAGT,SAASF,EAAazgH,EAAO84C,GAC3B,IAAMna,EAAOga,GAAU34C,GACvB,GAAI84C,EAAM,GAAMA,GAAOna,EAAK7rC,OAE1B,MAAM,IAAI4lD,GAAWI,EAAKna,EAAK7rC,QAGjC,IACE,OAOJ,SAAS8tH,EAAoBj+D,EAAK7J,GAChC,IAAIzpD,EAAG+Y,EAAK86C,EAEZ,GAAIpK,GAAO,EAAG,CACZ,IAAM+nE,EAAel+D,EAAI,GAAG,GAC5B,GAAKxjD,MAAMP,QAAQiiH,GAEZ,CAGL,IAFA39D,EAAOR,GAAQC,GACfv6C,EAAM,GACD/Y,EAAI,EAAGA,EAAI6zD,EAAKpwD,OAAQzD,IAC3B+Y,EAAI/Y,GAAKuxH,EAAmB19D,EAAK7zD,GAAIypD,EAAM,GAE7C,OAAO1wC,EAPP,OAAOs4G,EAAW/9D,GAWpB,IADAv6C,EAAM,GACD/Y,EAAI,EAAGA,EAAIszD,EAAI7vD,OAAQzD,IAC1B+Y,EAAI/Y,GAAKuxH,EAAmBj+D,EAAItzD,GAAIypD,EAAM,GAE5C,OAAO1wC,EA3BAw4G,CAAmB5gH,EAAO84C,GACjC,MAAO/kB,GACP,MAAM+sC,GAAoB/sC,EA5FnB,eCCA+sF,GAA6BlyH,GAH7B,OACQ,CAAC,QAAS,MAAO,WAEgC,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAO70B,EAAkB,EAAlBA,IAAKib,EAAa,EAAbA,OA4BnF,OAAO4Z,EA/BI,OA+BQ,CAEjB,iBAAkBgwF,EAGlB,qCAoBF,SAAoB/gH,EAAO84C,GACzB,IACE,IAAM15B,EAAMi7B,GAAOr6C,EAAO84C,EAAK58C,GACzB9K,EAAI+N,MAAMP,QAAQoB,GAAS24C,GAAU34C,GAASA,EAAM2+B,OAC1D,OAAOxnB,EAAOiI,EAAKhuB,EAAE0nD,IACrB,MAAO/kB,GACP,MAAM+sC,GAAoB/sC,EAAK,UAvBjC,MAAO,SAAUtnB,GACf,GAAIq2C,GAAoBr2C,GACtB,MAAM,IAAIlU,UAAU,2CAGtB,OAAOwoH,EAAMt0G,MA4BjB,SAASs0G,EAAO/gH,GACd,IAAIof,EACA9E,EAAM,EAWV,GATAyoC,GAAY/iD,GAAO,SAAU1P,GAC3B,IACE8uB,OAAcrsB,IAARqsB,EAAoB9uB,EAAQ4L,EAAIkjB,EAAK9uB,GAC3CgqB,IACA,MAAOyZ,GACP,MAAM+sC,GAAoB/sC,EAAK,OAAQzjC,OAI/B,IAARgqB,EACF,MAAM,IAAIzN,MAAM,+CAElB,OAAOsK,EAAOiI,EAAK9E,OCrFV0mG,GAA+BpyH,GAH/B,SACQ,CAAC,QAAS,MAAO,SAAU,UAAW,oBAEa,YAAsD,IAAnDmiC,EAAmD,EAAnDA,MAAO70B,EAA4C,EAA5CA,IAAKib,EAAuC,EAAvCA,OAAQmG,EAA+B,EAA/BA,QAASszF,EAAsB,EAAtBA,gBAOtG,SAASqQ,EAASjhH,GAChB,IAGE,IAAMsa,GAFNta,EAAQ2xC,GAAQ3xC,EAAM2M,YAEJ7Z,OAClB,GAAY,IAARwnB,EACF,MAAM,IAAIzN,MAAM,6CAGlB,GAAIyN,EAAM,GAAM,EAAG,CAOjB,IALA,IAAM4mG,EAAM5mG,EAAM,EAAI,EAChB4sB,EAAQ0pE,EAAgB5wG,EAAOkhH,EAAM,GAGvCj6E,EAAOjnC,EAAMkhH,GACR7xH,EAAI,EAAGA,EAAI6xH,IAAO7xH,EACrBiuB,EAAQtd,EAAM3Q,GAAI43C,GAAQ,IAC5BA,EAAOjnC,EAAM3Q,IAIjB,OAAO8xH,EAAQl6E,EAAMC,GAGrB,IAAMz3C,EAAImhH,EAAgB5wG,GAAQsa,EAAM,GAAK,GAE7C,OAAOusB,EAAOp3C,GAEhB,MAAOskC,GACP,MAAM+sC,GAAoB/sC,EAAK,WAKnC,IAAM8S,EAAS9V,EAAM,CACnB,sCAAuC,SAAUzgC,GAC/C,OAAOA,KAKL6wH,EAAUpwF,EAAM,CACpB,2EAA4E,SAAUkW,EAAMC,GAC1F,OAAO/vB,EAAOjb,EAAI+qC,EAAMC,GAAQ,MA8BpC,OAAOnW,EApFI,SAoFQ,CAEjB,iBAAkBkwF,EAGlB,qCAAsC,SAAUjhH,EAAO84C,GAErD,MAAM,IAAIjsC,MAAM,wCAKlB,MAAO,SAAUJ,GACf,GAAIq2C,GAAoBr2C,GACtB,MAAM,IAAIlU,UAAU,6CAGtB,OAAO0oH,EAAQx0G,SCnGR20G,GAA4BxyH,GAH5B,MACQ,CAAC,QAAS,MAAO,MAAO,SAAU,aAEc,YAA2C,IAAxCmiC,EAAwC,EAAxCA,MAAO1rB,EAAiC,EAAjCA,IAAK9S,EAA4B,EAA5BA,IAAKw/G,EAAuB,EAAvBA,OAAQt0F,EAAe,EAAfA,SAyB/F,OAAOsT,EA5BI,MA4BQ,CAEjB,iBAAkBswF,EAGlB,MAAO,SAAU50G,GACf,OAAO40G,EAAK50G,MAIhB,SAAS40G,EAAMrhH,GAGb,GAAqB,KAFrBA,EAAQ2xC,GAAQ3xC,EAAM2M,YAEZ7Z,OACR,MAAM,IAAI+Z,MAAM,sEAGlB,IACE,IAAMy0G,EAAMvP,EAAO/xG,GACnB,OAAO+xG,EAAOx/G,EAAIyN,GAAO,SAAU1P,GACjC,OAAO+U,EAAIoY,EAASntB,EAAOgxH,QAE7B,MAAOvtF,GACP,MAAIA,aAAex7B,YAAgD,IAAnCw7B,EAAIykB,QAAQrjC,QAAQ,UAC5C,IAAI5c,UAAUw7B,EAAIykB,QAAQ3vC,QAAQ,SAAU,QAE5Ci4D,GAAoB/sC,EAAK,YChD1BwtF,GAAiC3yH,GAHjC,WACQ,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,UAEP,YAA8D,IAA3DmiC,EAA2D,EAA3DA,MAAO70B,EAAoD,EAApDA,IAAKuhB,EAA+C,EAA/CA,SAAU8hB,EAAqC,EAArCA,SAAUpoB,EAA2B,EAA3BA,OAAQthB,EAAmB,EAAnBA,MAAOsQ,EAAY,EAAZA,MAsD1H,OAAO4qB,EAzDI,WAyDQ,CAEjB,iBAAkB,SAAU/wB,GAC1B,OAAOwhH,EAAKxhH,EA9DY,aAkE1B,yBAA0BwhH,EAG1B,qCAAsC,SAAUxhH,EAAO84C,GACrD,OAAO2oE,EAAQzhH,EAAO84C,EAtEE,aA0E1B,6CAA8C2oE,EAG9C,MAAO,SAAUh1G,GACf,OAAO+0G,EAAK/0G,EA9EY,eA6F5B,SAAS+0G,EAAMxhH,EAAO0hH,GACpB,IAAItiG,EACA9E,EAAM,EAEV,GAAqB,IAAjBta,EAAMlN,OACR,MAAM,IAAIkS,YAAY,kEAYxB,GARA+9C,GAAY/iD,GAAO,SAAU1P,GAC3B,IACE8uB,OAAcrsB,IAARqsB,EAAoB9uB,EAAQ4L,EAAIkjB,EAAK9uB,GAC3CgqB,IACA,MAAOyZ,GACP,MAAM+sC,GAAoB/sC,EAAK,WAAYzjC,OAGnC,IAARgqB,EAAW,MAAM,IAAIzN,MAAM,+CAE/B,IAAMilG,EAAO36F,EAAOiI,EAAK9E,GASzB,GANA8E,OAAMrsB,EACNgwD,GAAY/iD,GAAO,SAAU1P,GAC3B,IAAM8mD,EAAO35B,EAASntB,EAAOwhH,GAC7B1yF,OAAcrsB,IAARqsB,EAAoBmgB,EAAS6X,EAAMA,GAAQl7C,EAAIkjB,EAAKmgB,EAAS6X,EAAMA,OAGvEjxC,EAAMiZ,GACR,OAAOA,EAGT,OAAQsiG,GACN,IAAK,cACH,OAAOvqG,EAAOiI,EAAK9E,GAErB,IAAK,SACH,OAAOnD,EAAOiI,EAAK9E,EAAM,GAE3B,IAAK,WAEH,IAAMmrC,EAAOvS,EAAY9zB,GAAOA,EAAI1D,IAAI,GAAK,EAC7C,OAAgB,IAARpB,EAAamrC,EAAOtuC,EAAOiI,EAAK9E,EAAM,GAGhD,QACE,MAAM,IAAIzN,MAAM,0BAA4B60G,EAA5B,gEAKtB,SAASD,EAASzhH,EAAO84C,EAAK4oE,GAC5B,IACE,GAAqB,IAAjB1hH,EAAMlN,OACR,MAAM,IAAIkS,YAAY,kEAExB,OAAOnP,EAAMmK,EAAO84C,GAAK,SAACt8C,GAAD,OAAOglH,EAAKhlH,EAAGklH,MACxC,MAAO3tF,GACP,MAAM+sC,GAAoB/sC,EAAK,iBCpJxB4tF,GAAoC/yH,GAHpC,cACQ,CAAC,QAAS,MAAO,WAAY,kBAAmB,YAEQ,YAAwD,IAArDmiC,EAAqD,EAArDA,MAAO70B,EAA8C,EAA9CA,IAAKqjC,EAAyC,EAAzCA,SAAUqxE,EAA+B,EAA/BA,gBAAiBtzF,EAAc,EAAdA,QAoJrH,SAASskG,EAAc5hH,EAAO6hH,EAAMC,GAClC,IAAMjnE,EAAOlJ,GAAQ3xC,GACfM,EAAMu6C,EAAK/nD,OACjB,GAAY,IAARwN,EACF,MAAM,IAAIuM,MAAM,kDAGlB,GAAIomC,EAAS4uE,GAAO,CAClB,IAAMhlH,EAAQglH,GAAQvhH,EAAM,GACtByhH,EAAWllH,EAAQ,EACzB,GAAiB,IAAbklH,EAAgB,CAClB,IAAMzxH,EAAQwxH,EAASjnE,EAAKh+C,GAAS+zG,EAAgB/1D,EAAMh+C,GAI3D,OAFA+7C,EAAStoD,GAEFA,EAGT,IAEI22C,EACAC,EAHEghB,EAAcx2D,KAAKwW,MAAMrL,GAI/B,GAAIilH,EACF76E,EAAO4T,EAAKqN,GACZhhB,EAAQ2T,EAAKqN,EAAc,OACtB,CACLhhB,EAAQ0pE,EAAgB/1D,EAAMqN,EAAc,GAG5CjhB,EAAO4T,EAAKqN,GACZ,IAAK,IAAI74D,EAAI,EAAGA,EAAI64D,IAAe74D,EAC7BiuB,EAAQu9B,EAAKxrD,GAAI43C,GAAQ,IAC3BA,EAAO4T,EAAKxrD,IASlB,OAJAupD,EAAS3R,GACT2R,EAAS1R,GAGFhrC,EAAIqjC,EAAS0H,EAAM,EAAI86E,GAAWxiF,EAAS2H,EAAO66E,IAI3D,IAAIllH,EAAQglH,EAAKprG,MAAMnW,EAAM,GAC7B,GAAIzD,EAAM4c,YAAa,CACrB5c,EAAQA,EAAM2G,WACd,IAAMlT,EAAQwxH,EAASjnE,EAAKh+C,GAAS+zG,EAAgB/1D,EAAMh+C,GAI3D,OAFA+7C,EAAStoD,GAEFA,EAGT,IAII22C,EACAC,EALEghB,EAAcrrD,EAAMqL,QACpB65G,EAAWllH,EAAMqJ,MAAMgiD,GACvB85D,EAAoB95D,EAAY1kD,WAItC,GAAIs+G,EACF76E,EAAO4T,EAAKmnE,GACZ96E,EAAQ2T,EAAKmnE,EAAoB,OAC5B,CACL96E,EAAQ0pE,EAAgB/1D,EAAMmnE,EAAoB,GAGlD/6E,EAAO4T,EAAKmnE,GACZ,IAAK,IAAI3yH,EAAI,EAAGA,EAAI2yH,IAAqB3yH,EACnCiuB,EAAQu9B,EAAKxrD,GAAI43C,GAAQ,IAC3BA,EAAO4T,EAAKxrD,IAKlBupD,EAAS3R,GACT2R,EAAS1R,GAGT,IAAMlvB,EAAM,IAAI+pG,EAAS3vH,YAAY,GACrC,OAAO8J,EAAIqjC,EAAS0H,EAAMjvB,EAAI9R,MAAM67G,IAAYxiF,EAAS2H,EAAO66E,IASlE,IAAMnpE,EAAW7nB,EAAM,CACrB,4BAA6B,SAAUv0B,GACrC,OAAOA,KAIX,OAjNA,SAAsB0rB,EAAM+5F,EAASH,GACnC,IAAII,EAASC,EAASnqG,EAEtB,GAAInlB,UAAUC,OAAS,GAAKD,UAAUC,OAAS,EAC7C,MAAM,IAAIkS,YAAY,yDAGxB,GAAIwuC,EAAatrB,GAAO,CAEtB,GAAsB,kBADtB45F,EAASA,IAAU,GACc,CAE/B,GADAK,EAAUj6F,EAAKvb,UACXsmC,EAASgvE,GAAU,CACrB,GAAIA,EAAU,EACZ,MAAM,IAAIp1G,MAAM,+BAGlB,GAAIo1G,GAAW,EAEb,OAAOL,EAAaO,EAASF,EAASH,GAGxC,GAAIG,EAAU,EAAG,CAEf,IAAKxoG,EAAUwoG,GACb,MAAM,IAAIp1G,MAAM,gCAGlB,IAAMu1G,EAAWH,EAAU,EAC3BC,EAAU,IAAI/iH,MAAM8iH,GACpB,IAAK,IAAI5yH,EAAI,EAAGA,EAAI4yH,GAClBC,EAAQ7yH,GAAKuyH,EAAaO,IAAY9yH,EAAK+yH,EAAUN,GAEvD,OAAOI,GAIX,GAAIhvE,EAAY+uE,GAAU,CACxB,IAAMjkE,EAAYikE,EAAQ7vH,YAE1B,GAAI6vH,EAAQtoG,aACV,MAAM,IAAI9M,MAAM,+BAKlB,GAFAmL,EAAM,IAAIgmC,EAAU,GAEhBikE,EAAQlpG,IAAIf,GAEd,OAAO,IAAIgmC,EAAU4jE,EAAaO,EAASF,EAASH,IAGtD,GAAIG,EAAQvsG,GAAGsC,GAAM,CAEnB,IAAKiqG,EAAQxoG,YACX,MAAM,IAAI5M,MAAM,gCAKlB,IAAMw1G,EAAOJ,EAAQz+G,WACrB,GAAI6+G,EAAO,WACT,MAAM,IAAIx1G,MAAM,qFAGlB,IAAMu1G,EAAW,IAAIpkE,EAAUqkE,EAAO,GACtCH,EAAU,IAAI/iH,MAAMkjH,GACpB,IAAK,IAAIhzH,EAAI,EAAGA,EAAIgzH,GAClBH,EAAQ7yH,GAAK,IAAI2uD,EAAU4jE,EAAaO,EAAS,IAAInkE,IAAY3uD,GAAGmoB,IAAI4qG,GAAWN,IAErF,OAAOI,GAIX,GAAI/iH,MAAMP,QAAQqjH,GAAU,CAE1BC,EAAU,IAAI/iH,MAAM8iH,EAAQnvH,QAC5B,IAAK,IAAIzD,EAAI,EAAGA,EAAI6yH,EAAQpvH,SAAUzD,EAAG,CACvC,IAAMizH,EAAWL,EAAQ5yH,GACzB,GAAI4jD,EAASqvE,IACX,GAAIA,EAAW,GAAKA,EAAW,EAC7B,MAAM,IAAIz1G,MAAM,sDAEb,KAAIqmC,EAAYovE,GAMrB,MAAM,IAAI/pH,UAAU,uDAJpB,GADAyf,EAAM,IAAIsqG,EAASlwH,YAAY,GAC3BkwH,EAAS3oG,cAAgB2oG,EAAS5sG,GAAGsC,GACvC,MAAM,IAAInL,MAAM,kDAMpBq1G,EAAQ7yH,GAAKuyH,EAAaO,EAASG,EAAUR,GAE/C,OAAOI,EAGT,MAAM,IAAI3pH,UAAU,uDAGtB,MAAM,IAAIA,UAAU,uDAGtB,MAAM,IAAIA,UAAU,2DC3IXgqH,GAA4B3zH,GAH5B,MACQ,CAAC,QAAS,OAAQ,aAE8B,YAA+B,IAA5BmiC,EAA4B,EAA5BA,MAAOpqB,EAAqB,EAArBA,KAAM6wF,EAAe,EAAfA,SAqDnF,OAAOzmE,EAxDI,MAwDQ,CAEjB,iBAAkByxF,EAGlB,yBAA0BA,EAG1B,qCAAsCA,EAGtC,6CAA8CA,EAG9C,MAAO,SAAU/1G,GACf,OAAO+1G,EAAK/1G,MAIhB,SAAS+1G,EAAMxiH,EAAO0hH,GACpB,GAAqB,IAAjB1hH,EAAMlN,OACR,MAAM,IAAIkS,YAAY,6DAGxB,IACE,OAAO2B,EAAK6wF,EAAS3hG,MAAM,KAAMhD,YACjC,MAAOkhC,GACP,MAAIA,aAAex7B,YAAmD,IAAtCw7B,EAAIykB,QAAQrjC,QAAQ,aAC5C,IAAI5c,UAAUw7B,EAAIykB,QAAQ3vC,QAAQ,YAAa,SAE/CkrB,OCpFP,SAAS8lB,GAASxqD,EAAGyB,GAC1B,GAAIA,EAAIzB,EACN,OAAO,EAGT,GAAIyB,IAAMzB,EACR,OAAOyB,EAGT,IAAM2xH,EAAQ3xH,EAAIzB,GAAM,EACxB,OAAOwqD,GAAQxqD,EAAGozH,GAAQ5oE,GAAQ4oE,EAAO,EAAG3xH,GCXvC,SAAS4xH,GAAoB5xH,EAAG4O,GACrC,IAAK+Z,EAAU3oB,IAAMA,EAAI,EACvB,MAAM,IAAIyH,UAAU,4DAEtB,IAAKkhB,EAAU/Z,IAAMA,EAAI,EACvB,MAAM,IAAInH,UAAU,4DAEtB,GAAImH,EAAI5O,EACN,MAAM,IAAIyH,UAAU,qCAWtB,IARA,IAAMoqH,EAAU7xH,EAAI4O,EAEhBkjH,EAAS,EAETC,EAAc,EACZC,EAAepjH,EAAIijH,EAAWjjH,EAAIijH,EAG/BI,EALerjH,EAAIijH,EAAWA,EAAU,EAAIjjH,EAAI,EAKhBqjH,GAAiBjyH,IAAKiyH,EAE7D,IADAH,GAAUG,EACHF,GAAeC,GAAeF,EAASC,GAAgB,GAC5DD,GAAUC,IACRA,EAON,OAHIA,GAAeC,IACjBF,GAAU/oE,GAAQgpE,EAAaC,IAE1BF,EAETF,GAAmBpvF,UAAY,iBChC/B,IAGa0vF,GAAqCp0H,GAHrC,eACQ,CAAC,UAEwD,YAwB5E,OAAOmiC,EAxBoF,EAAZA,OAHpE,eA2BQ,CACjB,iBAAkB2xF,GAElB,uBAAwB,SAAU5xH,EAAG4O,GACnC,IACIxF,EAAQ7K,EADN2uD,EAAYltD,EAAEsB,YAEduwH,EAAU7xH,EAAEoV,MAAMxG,GAClBsY,EAAM,IAAIgmC,EAAU,GAE1B,IAAKilE,GAAkBnyH,KAAOmyH,GAAkBvjH,GAC9C,MAAM,IAAInH,UAAU,4DAEtB,GAAImH,EAAEgW,GAAG5kB,GACP,MAAM,IAAIyH,UAAU,kDAItB,GADA2B,EAAS8d,EACLtY,EAAEqa,GAAG4oG,GACP,IAAKtzH,EAAI2oB,EAAK3oB,EAAE0pB,IAAI4pG,GAAUtzH,EAAIA,EAAE4W,KAAK+R,GACvC9d,EAASA,EAAOuc,MAAM/W,EAAEuG,KAAK5W,IAAIkoB,UAAUloB,QAG7C,IAAKA,EAAI2oB,EAAK3oB,EAAE0pB,IAAIrZ,GAAIrQ,EAAIA,EAAE4W,KAAK+R,GACjC9d,EAASA,EAAOuc,MAAMksG,EAAQ18G,KAAK5W,IAAIkoB,UAAUloB,GAIrD,OAAO6K,QAYb,SAAS+oH,GAAmBnyH,GAC1B,OAAOA,EAAE2oB,aAAe3oB,EAAEgnB,IAAI,GClEhC,IAGaorG,GAA4Ct0H,GAH5C,sBACQ,CAAC,UAE+D,YAwBnF,OAAOmiC,EAxB2F,EAAZA,OAH3E,sBA2BQ,CACjB,iBAAkB,SAAUjgC,EAAG4O,GAC7B,IAAK+Z,EAAU3oB,IAAMA,EAAI,EACvB,MAAM,IAAIyH,UAAU,mEAEtB,IAAKkhB,EAAU/Z,IAAMA,EAAI,EACvB,MAAM,IAAInH,UAAU,mEAEtB,GAAIzH,EAAI,EACN,MAAM,IAAIyH,UAAU,6CAGtB,OAAImH,EAAI5O,EAAI,EACQ+oD,GAAQ/oD,EAAGA,EAAI4O,EAAI,GAClBm6C,GAAQ,EAAGn6C,GAEdm6C,GAAQn6C,EAAI,EAAG5O,EAAI4O,EAAI,GACtBm6C,GAAQ,EAAG/oD,EAAI,IAGpC,uBAAwB,SAAUA,EAAG4O,GACnC,IACIxF,EAAQ7K,EACN2oB,EAAM,IAAIgmC,EAFEltD,EAAEsB,aAEM,GACpB+wH,EAAYryH,EAAEoV,MAAM8R,GAE1B,IAAKirG,GAAkBnyH,KAAOmyH,GAAkBvjH,GAC9C,MAAM,IAAInH,UAAU,mEAEtB,GAAIzH,EAAEipB,GAAG/B,GACP,MAAM,IAAIzf,UAAU,6EAItB,GADA2B,EAAS8d,EACLtY,EAAEqa,GAAGopG,GACP,IAAK9zH,EAAI2oB,EAAK3oB,EAAE0pB,IAAIoqG,GAAY9zH,EAAIA,EAAE4W,KAAK+R,GACzC9d,EAASA,EAAOuc,MAAM/W,EAAEuG,KAAK5W,IAAIkoB,UAAUloB,QAG7C,IAAKA,EAAI2oB,EAAK3oB,EAAE0pB,IAAIrZ,GAAIrQ,EAAIA,EAAE4W,KAAK+R,GACjC9d,EAASA,EAAOuc,MAAM0sG,EAAUl9G,KAAK5W,IAAIkoB,UAAUloB,GAIvD,OAAO6K,QAUb,SAAS+oH,GAAmBnyH,GAC1B,OAAOA,EAAE2oB,aAAe3oB,EAAEgnB,IAAI,GCjFzB,SAASsrG,GAAatyH,GAC3B,IAAI0L,EAEJ,GAAIid,EAAU3oB,GACZ,OAAIA,GAAK,EACA8U,SAAS9U,GAAKsW,IAAWrD,IAG9BjT,EAAI,IACCsW,IAGFyyC,GAAQ,EAAG/oD,EAAI,GAGxB,GAAIA,EAAI,GACN,OAAOY,KAAKoV,IAAMpV,KAAKoU,IAAIpU,KAAKoV,GAAKhW,GAAKsyH,GAAY,EAAItyH,IAG5D,GAAIA,GAAK,OACP,OAAOsW,IAGT,GAAItW,EAAI,GAAM,CACZ,IAAMuyH,EAAOvyH,EAAIA,EACXwyH,EAASD,EAAOvyH,EAChByyH,EAAQD,EAASxyH,EACjB0yH,EAAQD,EAAQzyH,EACtB,OAAOY,KAAKiV,KAAK,EAAIjV,KAAKoV,GAAKhW,GAAKY,KAAK4U,IAAKxV,EAAIY,KAAK6O,EAAIzP,IACxD,EAAI,GAAK,GAAKA,GAAK,GAAK,IAAMuyH,GAAQ,KAAO,MAAQC,GACpD,KAAO,QAAUC,GAAS,QAAU,UAAYC,GAChD,SAAW,YAAcA,EAAQ1yH,MAGrCA,EACF0L,EAAIinH,GAAO,GACX,IAAK,IAAIp0H,EAAI,EAAGA,EAAIo0H,GAAO3wH,SAAUzD,EACnCmN,GAAKinH,GAAOp0H,IAAMyB,EAAIzB,GAGxB,IAAMkB,EAAIO,EAAI4yH,GAAS,GACvB,OAAOhyH,KAAKiV,KAAK,EAAIjV,KAAKoV,IAAMpV,KAAK4U,IAAI/V,EAAGO,EAAI,IAAOY,KAAKmT,KAAKtU,GAAKiM,EAExE4mH,GAAY9vF,UAAY,SAIjB,IAAMowF,GAAS,UAETD,GAAS,CACpB,kBACA,mBACC,kBACD,oBACC,kBACD,qBACA,sBACC,qBACD,sBACC,sBACD,uBACC,qBACD,sBACC,sBACD,uBC9DWE,GAA8B/0H,GAH9B,QACQ,CAAC,QAAS,SAAU,iBAAkB,MAAO,YAAa,YAER,YAAgE,IAA7DmiC,EAA6D,EAA7DA,MAAO7Q,EAAsD,EAAtDA,OAA6B89B,GAAyB,EAA9C8S,eAA8C,EAA9BxqD,IAA8B,EAAzB03C,WAAWv4C,EAAc,EAAdA,QAyBvH,OAAOsrB,EA5BI,QA4BQ,CAEjBze,OAAQ8wG,GAER39G,QAAS,SAAU3U,GACjB,GAAa,IAATA,EAAE4V,GACJ,OAAOzX,KAAK6B,EAAE2V,IAKhB,GAAI3V,EAAE2V,GAAK,GAAK,CAKd,IAAMlW,EAAI,IAAIkV,EAAQ,EAAI3U,EAAE2V,IAAK3V,EAAE4V,IAC7BvW,EAAI,IAAIsV,EAAQ/T,KAAKoV,GAAKhW,EAAE2V,GAAI/U,KAAKoV,GAAKhW,EAAE4V,IAElD,OAAO,IAAIjB,EAAQ/T,KAAKoV,IAAI0Q,IAAIrnB,EAAE2V,OAAO0R,IAAIvoB,KAAKsB,IAKpDO,EAAI,IAAI2U,EAAQ3U,EAAE2V,GAAK,EAAG3V,EAAE4V,IAK5B,IAFA,IAAIlK,EAAI,IAAIiJ,EAAQg+G,GAAO,GAAI,GAEtBp0H,EAAI,EAAGA,EAAIo0H,GAAO3wH,SAAUzD,EAAG,CAEtC,IAAMu0H,EAAY,IAAIn+G,EAAQg+G,GAAOp0H,GAAI,GACzCmN,EAAIA,EAAEN,IAAI0nH,EAAUpsG,IAAI1mB,EAAEoL,IAAI7M,KAGhC,IAAMkB,EAAI,IAAIkV,EAAQ3U,EAAE2V,GAAKi9G,GAAS,GAAK5yH,EAAE4V,IAGvCm9G,EAAYnyH,KAAKiV,KAAK,EAAIjV,KAAKoV,IAC/Bg9G,EAAOvzH,EAAE+V,IAAIxV,EAAEoL,IAAI,KACnB6nH,EAAOxzH,EAAEqmB,MAAM/R,MAGrB,OAAOrI,EAAEkf,IAAImoG,GAAWnoG,IAAIooG,GAAMpoG,IAAIqoG,IAGxC/lE,UAAW,SAAUltD,GACnB,GAAIA,EAAE2oB,YACJ,OAAQ3oB,EAAE6oB,cAAgB7oB,EAAEwlB,SACxB,IAAI0nC,EAAU52C,KAqBxB,SAAS48G,EAAclzH,GACrB,GAAIA,EAAI,EACN,OAAO,IAAIktD,EAAU,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,IAAK,IAAK,MAAMltD,IAGxD,IAAMiiB,EAAYmN,EAAOnN,WAAsC,EAAzBrhB,KAAK6T,IAAIzU,EAAE0S,aAC3CyvD,EAAMjV,EAAUj9B,MAAM,CAAEhO,UAAWA,IAEzC,GAAIjiB,EAAI,GAAM,EACZ,OAAOA,EAAE2lB,MAAMutG,EAAa,IAAIhmE,EAAUltD,EAAI,KAGhD,IAAIK,EAAIL,EACJ8sB,EAAO,IAAIq1C,EAAIniE,GACfsuB,EAAMtuB,EAAE0S,WAEZ,KAAOrS,EAAI,GAETiuB,GADAjuB,GAAK,EAELysB,EAAOA,EAAKnH,MAAM2I,GAGpB,OAAO,IAAI4+B,EAAUpgC,EAAKZ,YAAYghC,EAAUjrC,YA1CxCixG,CAAalzH,EAAEoV,MAAM,IAG3B,IAAKpV,EAAE8U,WACL,OAAO,IAAIo4C,EAAUltD,EAAE6oB,aAAe5V,IAAMqD,KAG9C,MAAM,IAAIyF,MAAM,+BAGlB,iBAAkB,SAAU/b,GAC1B,OAAOkyD,GAAQlyD,EAAG7B,YCvFXg1H,GAAkCr1H,GAHlC,YACQ,CAAC,QAAS,UAE4C,YAAsB,IAAnBmiC,EAAmB,EAAnBA,MAAO0hE,EAAY,EAAZA,MAuBnF,OAAO1hE,EA1BI,YA0BQ,CACjBze,OAAQ,SAAUxhB,GAChB,GAAIA,EAAI,EACN,MAAM,IAAI+b,MAAM,8BAGlB,OAAO4lF,EAAM3hG,EAAI,IAGnBktD,UAAW,SAAUltD,GACnB,GAAIA,EAAE6oB,aACJ,MAAM,IAAI9M,MAAM,8BAGlB,OAAO4lF,EAAM3hG,EAAEmV,KAAK,KAGtB,iBAAkB,SAAUnV,GAC1B,OAAOkyD,GAAQlyD,EAAG7B,YC1CXi1H,GAAqCt1H,GAHrC,eACQ,CAAC,QAAS,SAAU,SAAU,MAAO,WAAY,YAAa,MAAO,cAEZ,YAAyE,IAAtEmiC,EAAsE,EAAtEA,MAAOutB,EAA+D,EAA/DA,OAAQnnC,EAAuD,EAAvDA,OAAQiI,EAA+C,EAA/CA,IAAKmgB,EAA0C,EAA1CA,SAAUu2D,EAAgC,EAAhCA,UAAWvwF,EAAqB,EAArBA,IAAKk/C,EAAgB,EAAhBA,UAiBrI,OAAO1zB,EApBI,eAoBQ,CACjB,eAAgB,SAAUtf,EAAGtgB,GAC3B,OAAOgzH,EAAO7lE,EAAO7sC,GAAI6sC,EAAOntD,KAGlC,gBAAiB,SAAUsgB,EAAGtgB,GAC5B,OAAOgzH,EAAO1yG,EAAG6sC,EAAOntD,KAG1B,gBAAiB,SAAUsgB,EAAGtgB,GAC5B,OAAOgzH,EAAO7lE,EAAO7sC,GAAItgB,IAG3B,iBAAkB,SAAUsgB,EAAGtgB,GAC7B,OAAOgzH,EAAO1yG,EAAGtgB,MAKrB,SAASgzH,EAAQ1yG,EAAGtgB,GAClB,IAAMizH,EAAUjzH,EAAEwtC,OAAO7rC,OACnBuxH,EAAU5yG,EAAEktB,OAAO7rC,OACzB,GAAIsxH,EAAU,EACZ,MAAM,IAAIv3G,MAAM,wCAGlB,GAAIw3G,EAAU,EACZ,MAAM,IAAIx3G,MAAM,yCAGlB,GAAIu3G,IAAYC,EACd,MAAM,IAAIx3G,MAAM,uCAKlB,GAAa,IADAuS,EAAI3N,GAEf,MAAM,IAAI5E,MAAM,oDAIlB,GAAa,IADAuS,EAAIjuB,GAEf,MAAM,IAAI0b,MAAM,qDAElB,IAAMy3G,EAAQntG,EAAO1F,EAAG2N,EAAI3N,IACtB8yG,EAAQptG,EAAOhmB,EAAGiuB,EAAIjuB,IAEtB+I,EAASklB,EAAImgB,EAAS+kF,EAAO/+G,EAAIuwF,EAAUwuB,EAAOC,MACxD,OAAI9/D,EAAUvqD,GACLA,EAEAyL,OAAO5B,QCnEPygH,GAAoC51H,GAHpC,cACQ,CAAC,QAAS,MAAO,SAAU,WAAY,YAAa,YAAa,eAET,YAAwE,IAArEmiC,EAAqE,EAArEA,MAAO70B,EAA8D,EAA9DA,IAAKib,EAAyD,EAAzDA,OAAQooB,EAAiD,EAAjDA,SAAUk2D,EAAuC,EAAvCA,UAAWh8E,EAA4B,EAA5BA,UAAWG,EAAiB,EAAjBA,WAsBlI,OAAOmX,EAzBI,cAyBQ,CACjB,iBAAkB,SAAU7rB,GAC1B,IAAIka,EAAM,EACN24F,EAAQ,EAUZ,OARAh1D,GAAY79C,GAAG,SAAUu/G,GACvB,IAAKhrG,EAAUgrG,KAAQ7qG,EAAW6qG,GAChC,MAAM,IAAIlsH,UAAU,2DAEtB6mB,EAAMljB,EAAIkjB,EAAKqlG,GACf1M,EAAQx4E,EAASw4E,EAAOtiB,EAAUgvB,OAG7BttG,EAAOs+E,EAAUr2E,GAAM24F,SClCvB2M,GAAqC91H,GAHrC,eACQ,CAAC,QAAS,cAE+C,YA0B5E,OAAOmiC,EA1B+F,EAAvBA,OAHpE,eA6BQ,CACjB,qBA3BoG,EAAhB0kE,UA4BpF,iBAAkB,SAAU3kG,EAAG4O,GAC7B,IAAK+Z,EAAU3oB,IAAMA,EAAI,EACvB,MAAM,IAAIyH,UAAU,4DAEtB,IAAKkhB,EAAU/Z,IAAMA,EAAI,EACvB,MAAM,IAAInH,UAAU,4DAEtB,GAAImH,EAAI5O,EACN,MAAM,IAAIyH,UAAU,oEAGtB,OAAOshD,GAAS/oD,EAAI4O,EAAK,EAAG5O,IAG9B,uBAAwB,SAAUA,EAAG4O,GACnC,IAAIxF,EAAQ7K,EAEZ,IAAK4zH,GAAkBnyH,KAAOmyH,GAAkBvjH,GAC9C,MAAM,IAAInH,UAAU,4DAEtB,GAAImH,EAAEgW,GAAG5kB,GACP,MAAM,IAAIyH,UAAU,oEAKtB,IADA2B,EADYpJ,EAAE4qB,IAAI,GAAGxf,IAAI,GAEpB7M,EAAIyB,EAAEoV,MAAMxG,GAAGuG,KAAK,GAAI5W,EAAE0pB,IAAIjoB,GAAIzB,EAAIA,EAAE4W,KAAK,GAChD/L,EAASA,EAAOuc,MAAMpnB,GAGxB,OAAO6K,QAYb,SAAS+oH,GAAmBnyH,GAC1B,OAAOA,EAAE2oB,aAAe3oB,EAAEgnB,IAAI,G,yBC5E1B6sG,GAAkCnzE,KAAW3tB,KAAKmgB,OAEjD,SAAS4gF,GAAWC,GACzB,IAAIjkG,EAGcqvB,EAYlB,OAXErvB,EAAkB,QADFqvB,EAKV40E,GAJmBF,GAAkBnzE,KAAWn4C,OAAO42C,IAO/D,WACE,OAAOrvB,KCZX,IAGakkG,GAAmCl2H,GAHnC,aACQ,CAAC,QAAS,SAAU,QAEmC,YAA2B,IAAxBmiC,EAAwB,EAAxBA,MAAO7Q,EAAiB,EAAjBA,OAAQ4kB,EAAS,EAATA,GAExFigF,EAAMH,GAAU1kG,EAAO2kG,YA6C3B,OA3CI//E,GACFA,EAAG,UAAU,SAAUwV,EAAMlrC,GACvBkrC,EAAKuqE,aAAez1G,EAAKy1G,aAC3BE,EAAMH,GAAUtqE,EAAKuqE,gBAwCpB9zF,EAlDI,aAkDQ,CACjB,iBAAkB,SAAUi0F,GAC1B,OAAOC,EAAYD,EAAW,KAGhC,yBAA0B,SAAUA,EAAWnxH,GAC7C,OAAOoxH,EAAYD,EAAWnxH,IAGhC,yBAA0B,SAAUmxH,EAAW1yG,GAC7C,OAAO2yG,EAAYD,EAAW,CAAE1yG,YAGlC,iCAAkC,SAAU0yG,EAAWE,GACrD,OAAOD,EAAYD,EAAW,CAAEE,aAGlC,yCAA0C,SAAUF,EAAWE,EAAS5yG,GACtE,OAAO2yG,EAAYD,EAAW,CAAE1yG,SAAQ4yG,aAG1C,yCAA0C,SAAUF,EAAW1yG,EAAQ4yG,GACrE,OAAOD,EAAYD,EAAW,CAAE1yG,SAAQ4yG,eAc5C,SAASD,EAAaD,EAAtB,GAA0E,IAAvC1yG,EAAuC,EAAvCA,OAAQ4yG,EAA+B,EAA/BA,QAA+B,IAAtBC,mBAAsB,SAClEC,OAA4B,IAAX9yG,EACnB8yG,IACF9yG,EAAS,GAGX,IAAM82C,EAAe7V,EAASyxE,GAC1BA,EAAUr0H,OACV4iD,EAAS2xE,GACPA,EAAQv0H,OACR,KAENq0H,EAAYA,EAAUr4G,UAClBu4G,IACFA,EAAUA,EAAQv4G,YAGA,IAAhBw4G,IACFH,EAAYrzE,GAAQqzE,GACpBE,EAAUvzE,GAAQuzE,IAGpB,IAAIG,EAAe,EAEnB,QAAuB,IAAZH,EAAyB,CAClC,GAAIA,EAAQpyH,SAAWkyH,EAAUlyH,OAC/B,MAAM,IAAI+Z,MAAM,kDAGlB,IAAK,IAAIxd,EAAI,EAAGiR,EAAM4kH,EAAQpyH,OAAQzD,EAAIiR,EAAKjR,IAAK,CAClD,IAAK4jD,EAASiyE,EAAQ71H,KAAO61H,EAAQ71H,GAAK,EACxC,MAAM,IAAIwd,MAAM,gDAGlBw4G,GAAgBH,EAAQ71H,IAS5B,IALA,IAGIi2H,EAHExyH,EAASkyH,EAAUlyH,OAEnBoH,EAAS,GAGRA,EAAOpH,OAASwf,GAAQ,CAC7B,QAAuB,IAAZ4yG,EACTI,EAAON,EAAUtzH,KAAKwW,MAAM68G,IAAQjyH,SAIpC,IAFA,IAAIyyH,EAAUR,IAAQM,EAEbh2H,EAAI,EAAGiR,EAAM0kH,EAAUlyH,OAAQzD,EAAIiR,EAAKjR,IAG/C,IAFAk2H,GAAWL,EAAQ71H,IAEL,EAAG,CACfi2H,EAAON,EAAU31H,GACjB,MAKN6K,EAAOwQ,KAAK46G,GAGd,OAAOF,EACHlrH,EAAO,GACPkvD,EACEA,EAAalvD,GACbA,MCvJH,SAASsrH,GAAc7mF,EAAM/d,GAClC,IAAMsH,EAAO,GAGb,IAFAyW,EAAOA,EAAKt/B,MAAM,IAETvM,OAAS,EAChB,IAAK,IAAIzD,EAAI,EAAGyD,EAAS6rC,EAAK9jB,QAASxrB,EAAIyD,EAAQzD,IACjD64B,EAAKxd,KAAK86G,GAAa7mF,EAAM/d,SAG/B,IAAK,IAAIvxB,EAAI,EAAGyD,EAAS6rC,EAAK9jB,QAASxrB,EAAIyD,EAAQzD,IACjD64B,EAAKxd,KAAKkW,KAId,OAAOsH,ECfT,IAGau9F,GAA+B72H,GAH/B,SACQ,CAAC,QAAS,SAAU,QAE+B,YAA2B,IAAxBmiC,EAAwB,EAAxBA,MAAO7Q,EAAiB,EAAjBA,OAAQ4kB,EAAS,EAATA,GAEpFigF,EAAMH,GAAU1kG,EAAO2kG,YAwC3B,OAtCI//E,GACFA,EAAG,UAAU,SAAUwV,EAAMlrC,GACvBkrC,EAAKuqE,aAAez1G,EAAKy1G,aAC3BE,EAAMH,GAAUtqE,EAAKuqE,gBAmCpB9zF,EA7CI,SA6CQ,CACjB,GAAI,kBAAM20F,EAAQ,EAAG,IACrBpzG,OAAQ,SAAClT,GAAD,OAASsmH,EAAQ,EAAGtmH,IAC5B,iBAAkB,SAAC+C,EAAK/C,GAAN,OAAcsmH,EAAQvjH,EAAK/C,IAC7C,iBAAkB,SAACu/B,GAAD,OAAUgnF,EAAchnF,EAAM,EAAG,IACnD,yBAA0B,SAACA,EAAMv/B,GAAP,OAAeumH,EAAchnF,EAAM,EAAGv/B,IAChE,iCAAkC,SAACu/B,EAAMx8B,EAAK/C,GAAZ,OAAoBumH,EAAchnF,EAAMx8B,EAAK/C,MAGjF,SAASumH,EAAehnF,EAAMx8B,EAAK/C,GACjC,IAAMoI,EAAMg+G,GAAa7mF,EAAKhyB,WAAW,kBAAM+4G,EAAQvjH,EAAK/C,MAC5D,OAAOm0C,EAAS5U,GAAQA,EAAKhuC,OAAO6W,GAAOA,EAG7C,SAASk+G,EAASvjH,EAAK/C,GACrB,OAAO+C,EAAM4iH,KAAS3lH,EAAM+C,OCzDnByjH,GAAkCh3H,GAHlC,YACQ,CAAC,QAAS,SAAU,QAEkC,YAA2B,IAAxBmiC,EAAwB,EAAxBA,MAAO7Q,EAAiB,EAAjBA,OAAQ4kB,EAAS,EAATA,GAEvFigF,EAAMH,GAAU1kG,EAAO2kG,YAuC3B,OArCI//E,GACFA,EAAG,UAAU,SAAUwV,EAAMlrC,GACvBkrC,EAAKuqE,aAAez1G,EAAKy1G,aAC3BE,EAAMH,GAAUtqE,EAAKuqE,gBAkCpB9zF,EA5CI,YA4CQ,CACjB,GAAI,kBAAM80F,EAAW,EAAG,IACxBvzG,OAAQ,SAAClT,GAAD,OAASymH,EAAW,EAAGzmH,IAC/B,iBAAkB,SAAC+C,EAAK/C,GAAN,OAAcymH,EAAW1jH,EAAK/C,IAChD,iBAAkB,SAACu/B,GAAD,OAAUmnF,EAAiBnnF,EAAM,EAAG,IACtD,yBAA0B,SAACA,EAAMv/B,GAAP,OAAe0mH,EAAiBnnF,EAAM,EAAGv/B,IACnE,iCAAkC,SAACu/B,EAAMx8B,EAAK/C,GAAZ,OAAoB0mH,EAAiBnnF,EAAMx8B,EAAK/C,MAGpF,SAAS0mH,EAAkBnnF,EAAMx8B,EAAK/C,GACpC,IAAMoI,EAAMg+G,GAAa7mF,EAAKhyB,WAAW,kBAAMk5G,EAAW1jH,EAAK/C,MAC/D,OAAOm0C,EAAS5U,GAAQA,EAAKhuC,OAAO6W,GAAOA,EAG7C,SAASq+G,EAAY1jH,EAAK/C,GACxB,OAAO1N,KAAKwW,MAAM/F,EAAM4iH,KAAS3lH,EAAM+C,QC5C9B4jH,GAAmCn3H,GAjBnC,aACQ,CACnB,QACA,YACA,WACA,iBACA,eACA,MACA,YACA,eACA,aACA,YACA,SACA,aACA,WAG0E,YAgBvE,IAdDmiC,EAcC,EAdDA,MACA8/B,EAaC,EAbDA,UAEAC,GAWC,EAZDrzC,SAYC,EAXDqzC,gBAKAn3C,GAMC,EAVD0pD,aAUC,EATD/8D,IASC,EARDmvF,UAQC,EAPD4B,aAOC,EAND19E,YACAF,EAKC,EALDA,UACAnH,EAIC,EAJDA,OACAypD,EAGC,EAHDA,UACAE,EAEC,EAFDA,OAGI+pD,EAAa,GACbC,EAAW,GA6BjB,OAAOl1F,EAhEI,aAgEQ,CACjB,yCAA0C,SAAUjgC,EAAG4O,GACrD,IAAK+Z,EAAU3oB,IAAM6oB,EAAW7oB,KAAO2oB,EAAU/Z,IAAMia,EAAWja,GAChE,MAAM,IAAInH,UAAU,8DACf,GAAI0jE,EAAOv8D,EAAG5O,GACnB,MAAM,IAAIyH,UAAU,4DAGtB,IAAMu7G,IAAQ7gE,EAASniD,IAAMmiD,EAASvzC,IAChC85D,EAAQs6C,EAAMmS,EAAWD,EACzBE,EAAOpS,EAAM/3C,EAAYzpD,EACzB6zG,EAAK7zG,EAAOxhB,GACZs1H,EAAK9zG,EAAO5S,GAElB,GAAI85D,EAAM2sD,IAAO3sD,EAAM2sD,GAAIrzH,OAASszH,EAClC,OAAO5sD,EAAM2sD,GAAIC,GAGnB,IAAK,IAAI32H,EAAI,EAAGA,GAAK02H,IAAM12H,EAIzB,GAHK+pE,EAAM/pE,KACT+pE,EAAM/pE,GAAK,CAAWy2H,EAAJ,IAANz2H,EAAe,EAAU,KAE7B,IAANA,EAGJ,IAFA,IAAMoyD,EAAM2X,EAAM/pE,GACZ2f,EAAOoqD,EAAM/pE,EAAI,GACdJ,EAAIwyD,EAAI/uD,OAAQzD,GAAKI,GAAKJ,GAAK+2H,IAAM/2H,EAE1CwyD,EAAIxyD,GADFA,IAAMI,EACC,EAEAohE,EAAUC,EAAeo1D,EAAK72H,GAAI+f,EAAK/f,IAAK+f,EAAK/f,EAAI,IAIpE,OAAOmqE,EAAM2sD,GAAIC,SC/FVC,GAAoCz3H,GAHpC,cACQ,CAAC,QAAS,YAAa,aAAc,YAAa,eAEM,YAA6D,IAA1DmiC,EAA0D,EAA1DA,MAAO8/B,EAAmD,EAAnDA,UAAWl3C,EAAwC,EAAxCA,WAAYF,EAA4B,EAA5BA,UAAWs9E,EAAiB,EAAjBA,WAsBvH,OAAOhmE,EAzBI,cAyBQ,CACjB,qBAAsB,SAAUjgC,GAC9B,IAAK2oB,EAAU3oB,IAAM6oB,EAAW7oB,GAC9B,MAAM,IAAIyH,UAAU,+DAKtB,IADA,IAAI2B,EAAS,EACJ7K,EAAI,EAAGA,GAAKyB,EAAGzB,IACtB6K,EAAS22D,EAAU32D,EAAQ68F,EAAWjmG,EAAGzB,IAG3C,OAAO6K,QC1BAosH,GAAgC13H,GAXhC,UACQ,CACnB,QACA,YACA,eACA,iBACA,eACA,aACA,cAGuE,YAUpE,IARDmiC,EAQC,EARDA,MACA8/B,EAOC,EAPDA,UACAwS,EAMC,EANDA,aACAvS,EAKC,EALDA,eACAumC,EAIC,EAJDA,aACA19E,EAGC,EAHDA,WACAF,EAEC,EAFDA,UAwBF,OAAOsX,EA3CI,UA2CQ,CACjB,qBAAsB,SAAUjgC,GAC9B,IAAK2oB,EAAU3oB,IAAM6oB,EAAW7oB,GAC9B,MAAM,IAAIyH,UAAU,2DAGtB,OAAO8qE,EAAag0B,EAAavmC,EAAehgE,EAAG,GAAIA,GAAI+/D,EAAU//D,EAAG,UCtCjEy1H,GAAoC33H,GAXpC,cACQ,CACnB,QACA,YACA,eACA,aACA,aACA,YACA,WAG2E,YAUxE,IARDmiC,EAQC,EARDA,MACA8/B,EAOC,EAPDA,UACAwmC,EAMC,EANDA,aACAz9E,EAKC,EALDA,WAEAH,GAGC,EAJDE,WAIC,EAHDF,WACAwiD,EAEC,EAFDA,OAyBF,OAAOlrC,EA5CI,cA4CQ,CACjB,yCAA0C,SAAUjgC,EAAG4O,GACrD,KAAK+Z,EAAU3oB,IAAO8oB,EAAW9oB,IAAO2oB,EAAU/Z,IAAOka,EAAWla,IAClE,MAAM,IAAInH,UAAU,2DACf,GAAI0jE,EAAOv8D,EAAG5O,GACnB,MAAM,IAAIyH,UAAU,6DAGtB,OAAO8+F,EAAaxmC,EAAU//D,GAAI,GAAI+/D,EAAUnxD,GAAI,UC9C7C8mH,GAAkC53H,GANlC,YACQ,CACnB,QACA,UAGyE,YAGrE,IAFJyX,EAEI,EAFJA,MAyCA,OAAO0qB,EAvCH,EADJA,OARW,YAgDQ,CACjBhlB,OAAQ,SAAUmhF,GAChB,OAAOj+F,KAAKoX,EAAM6mF,KAEpBJ,KAAM,SAAUI,GACd,OAzCJ,SAASu5B,EAAa/8E,GACpB,IAAI9J,EAAQ,EAEZ,OADA8J,EAAKx2C,SAAQ,SAAApC,GAAO8uC,GAAS6mF,EAAY31H,MAClC8uC,GAAS,EAsCP6mF,CAAYv5B,S,6kBCnDzB,IAOaw5B,GAA6B93H,GAP7B,eACQ,CACnB,eACA,eACA,eAGoE,YAAgD,IAA7CmuG,EAA6C,EAA7CA,aAAczD,EAA+B,EAA/BA,aAAcoD,EAAiB,EAAjBA,WAO7F1rB,GAAI,EACJrrD,GAAI,EAGJghG,EAAiB,CACVzqH,IAAK,CAAE0qH,QAAS51C,EAAG61C,MAAO71C,EAAG81C,YAAa91C,EAAG+1C,YAAa/1C,GAChE2kB,UAAW,CAAEixB,QAAS51C,EAAG61C,MAAO71C,EAAG81C,YAAa91C,EAAG+1C,YAAa/1C,GAC/DvzD,SAAU,CAAEmpG,QAASjhG,EAAGkhG,MAAO71C,EAAG81C,YAAanhG,EAAGohG,YAAaphG,GAC/D4Z,SAAU,CAAEqnF,QAAS51C,EAAG61C,MAAO71C,EAAG81C,YAAa91C,EAAG+1C,YAAa/1C,GAC7D75D,OAAQ,CAAEyvG,QAASjhG,EAAGkhG,MAAO71C,EAAG81C,YAAanhG,EAAGohG,YAAaphG,GAC5DqhG,MAAO,CAAEJ,QAAS51C,EAAG61C,MAAO71C,EAAG81C,YAAa91C,EAAG+1C,YAAaphG,GAC/DshG,SAAU,CAAEL,QAASjhG,EAAGkhG,MAAO71C,EAAG81C,YAAanhG,EAAGohG,YAAaphG,IASvE,SAASuhG,EAAaC,EAAYn2H,GAAoC,IAA1Bq6C,EAA0B,uDAAhBs7E,EAChD/2H,EAlBc,WA4BlB,GAT0B,iBAAfu3H,EACTv3H,EAAOu3H,EACEpyE,EAAeoyE,GACxBv3H,EAAOu3H,EAAWvxH,GAAGrE,WACZqjD,EAAeuyE,GACxBv3H,EAAOu3H,EAAWv3H,KACTolD,EAAkBmyE,KAC3Bv3H,EAAO,SAELsB,GAAem6C,EAASz7C,GAAO,CACjC,IAAM2b,EAAa8/B,EAAQz7C,GAC3B,GAAIsB,GAAeqa,EAAYva,GAC7B,OAAOua,EAAWva,GAEpB,GAAIE,GAAey1H,EAAgB/2H,GACjC,OAAO+2H,EAAe/2H,GAAMoB,GAGhC,GAAIE,GAAem6C,EArCD,YAqCwB,CACxC,IAAM9/B,EAAa8/B,EAAO,SAC1B,OAAIn6C,GAAeqa,EAAYva,GACtBua,EAAWva,GAEb21H,EAAc,SAAc31H,GAIrC,GAAIE,GAAey1H,EAAgB/2H,GAAO,CACxC,IAAM2b,EAAao7G,EAAe/2H,GAClC,GAAIsB,GAAeqa,EAAYva,GAC7B,OAAOua,EAAWva,GAGtB,OAAO21H,EAAc,SAAc31H,GAOrC,SAASo2H,EAAe19E,GAAgC,IAA1B2B,EAA0B,uDAAhBs7E,EACtC,OAAOO,EAAYx9E,EAAM,cAAe2B,GAqC1C,SAASg8E,EAAa39E,EAAM2B,GAC1B,IAAIkuD,EACEjyE,EAAW,GAYjB,OAAI8/F,EAAc19E,EAAM2B,IACtBkuD,EAAK7vD,EAAK6vD,GAZS,SAAf+tB,EAAyB59E,GAC7B,IAAK,IAAIr6C,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,OAAQzD,IAAK,CACzC,IAAM2pD,EAAQtP,EAAKj9B,KAAKpd,GACpB0lD,EAAeiE,IAAUugD,IAAOvgD,EAAMugD,GACxC+tB,EAAatuE,GAEb1xB,EAAS5c,KAAKsuC,IAOlBsuE,CAAa59E,GACNpiB,GAEAoiB,EAAKj9B,KA8ChB,SAAS86G,EAAwB79E,GAC/B,OAAIqL,EAAerL,GACV,SAAUj9B,GACf,IACE,OAAO,IAAI6sF,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI6W,EAAMi9B,EAAK8vD,UACrD,MAAOzlE,GAEP,OADAwW,QAAQj3C,MAAMygC,GACP,KAIJ,SAAUtnB,GACf,OAAO,IAAIswF,EAAa,IAAIL,EAAWhzD,EAAK95C,MAAO6c,IAKzD,MAAO,CACL86G,yBACAL,cACAM,cA/HF,SAAwB99E,GAAgC,IAA1B2B,EAA0B,uDAAhBs7E,EACtC,OAAOO,EAAYx9E,EAAM,cAAe2B,IA+HxC+7E,gBACAK,aArHF,SAAuBC,EAASC,GAC9B,IAAMC,EAAS,MAAKF,GACpB,IAAK,IAAM71E,KAAQ81E,EACbz2H,GAAew2H,EAAS71E,GAC1B+1E,EAAO/1E,GAAP,SAAoB81E,EAAU91E,IAAU61E,EAAQ71E,IAEhD+1E,EAAO/1E,GAAQ81E,EAAU91E,GAG7B,OAAO+1E,GA6GPj2E,QAtGF,SAASA,EAASjI,EAAM2B,GACtB,IAAK3B,EAAKj9B,MAA6B,IAArBi9B,EAAKj9B,KAAK3Z,OAC1B,OAAO42C,EAETA,EAAKj9B,KAAO46G,EAAY39E,EAAM2B,GAC9B,IAAK,IAAIh8C,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,OAAQzD,IACpCsiD,EAAQjI,EAAKj9B,KAAKpd,GAAIg8C,IAiGxBg8E,cACAQ,WAhEF,SAASA,EAAYn+E,EAAM2B,GACzB,GAAK3B,EAAKj9B,MAA6B,IAArBi9B,EAAKj9B,KAAK3Z,OAA5B,CAKA,IAFA,IAAMg1H,EAAWP,EAAuB79E,GAClCp6C,EAAIo6C,EAAKj9B,KAAK3Z,OACXzD,EAAI,EAAGA,EAAIC,EAAGD,IACrBw4H,EAAWn+E,EAAKj9B,KAAKpd,GAAIg8C,GAE3B,GAAI/7C,EAAI,GAAK83H,EAAc19E,EAAM2B,GAAU,CAEzC,IADA,IAAI08E,EAAUr+E,EAAKj9B,KAAKmO,MACjB8uB,EAAKj9B,KAAK3Z,OAAS,GACxBi1H,EAAUD,EAAS,CAACp+E,EAAKj9B,KAAKmO,MAAOmtG,IAEvCr+E,EAAKj9B,KAAOs7G,EAAQt7G,QAmDtBu7G,WA5CF,SAASA,EAAYt+E,EAAM2B,GACzB,GAAK3B,EAAKj9B,MAA6B,IAArBi9B,EAAKj9B,KAAK3Z,OAA5B,CAKA,IAFA,IAAMg1H,EAAWP,EAAuB79E,GAClCp6C,EAAIo6C,EAAKj9B,KAAK3Z,OACXzD,EAAI,EAAGA,EAAIC,EAAGD,IACrB24H,EAAWt+E,EAAKj9B,KAAKpd,GAAIg8C,GAE3B,GAAI/7C,EAAI,GAAK83H,EAAc19E,EAAM2B,GAAU,CAEzC,IADA,IAAI08E,EAAUr+E,EAAKj9B,KAAKoO,QACjB6uB,EAAKj9B,KAAK3Z,OAAS,GACxBi1H,EAAUD,EAAS,CAACC,EAASr+E,EAAKj9B,KAAKoO,UAEzC6uB,EAAKj9B,KAAOs7G,EAAQt7G,QA+BtBk6G,iBACAsB,YApLkB,CAAE9wG,OAAQ,CAAE0vG,MAAOlhG,GAAKpgB,IAAK,CAAEshH,MAAOlhG,IAqLxDuiG,gBApLsB,CACtBzqG,SAAU,CAAEopG,MAAOlhG,GACnBtgB,IAAK,CAAEuhH,QAAS51C,GAChBzrE,IAAK,CAAEshH,MAAO71C,Q,whCC7BlB,IAkBam3C,GAAyCv5H,GAlBzC,mBACQ,CACnB,QACA,SACA,oBACA,SACA,YACA,aACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,eAGgF,YAe5E,IAdJmiC,EAcI,EAdJA,MACA7Q,EAaI,EAbJA,OACA2sE,EAYI,EAZJA,kBACAvuC,EAWI,EAXJA,OACAvG,EAUI,EAVJA,SACAgkB,EASI,EATJA,UACAyyB,EAQI,EARJA,aACAK,EAOI,EAPJA,UACAmJ,EAMI,EANJA,aACA+E,EAKI,EALJA,aACAxE,EAII,EAJJA,UACAU,EAGI,EAHJA,WACAK,EAEI,EAFJA,aACAoD,EACI,EADJA,WAEA,EACEgqB,GAAW,CAAE3pB,eAAczD,eAAcoD,eADnC8qB,EAAR,EAAQA,cAAeJ,EAAvB,EAAuBA,cAAeC,EAAtC,EAAsCA,YAAaE,EAAnD,EAAmDA,uBAGnD,SAASa,EAAkBl7B,EAAMr5F,GAC/B,OAAOw0H,EAsPT,SAASC,EAAc5+E,EAAM71C,GAC3B,OAAQ61C,EAAK3tC,MACX,IAAK,aACH,OAAO2tC,EACT,IAAK,eACH,WAAeA,EAAKp5C,QAClB,IAAK,SAAU,OAAOi4H,EAAU7+E,EAAKp5C,MAAOuD,GAC5C,IAAK,SAAU,OAAO61C,EAAKp5C,MAC3B,QACE,IAAK6V,MAAMujC,EAAKp5C,OAAQ,OAAOi4H,EAAU7+E,EAAKp5C,MAAOuD,GAEzD,OAAO61C,EACT,IAAK,eACH,GAAImjD,EAAkBnjD,EAAK95C,OAASi9F,EAAkBnjD,EAAK95C,MAAMstG,QAC/D,OAAOxzD,EAKP,IAA8C,IADpB,CAAC,MAAO,YACZv0B,QAAQu0B,EAAK95C,MAAc,CAC/C,IAAM6c,EAAOi9B,EAAKj9B,KAAKla,KAAI,SAAA8N,GAAG,OAAIioH,EAAajoH,EAAKxM,MAGpD,IAAK4Y,EAAKwc,KAAKorB,GACb,IACE,OAAOm0E,EAAM9+E,EAAK95C,KAAM6c,EAAM5Y,GAC9B,MAAO40H,IAIX,GAAkB,SAAd/+E,EAAK95C,MACW,IAAhB6c,EAAK3Z,QACLwhD,EAAY7nC,EAAK,IAAK,CAGxB,IAFA,IAAMi8G,EAAK,GACPC,EAAUl8G,EAAK,GACZ6nC,EAAYq0E,IACjBD,EAAGh+G,KAAKi+G,EAAQ76G,MAAMhb,QACtB61H,EAAUA,EAAQ76G,MAAM,GAE1B,OAAOwwC,EAAOoqE,GAIhB,OAAO,IAAI3rB,EAAarzD,EAAK95C,KAAM6c,EAAKla,IAAI81H,IAMlD,IAAK,eAEH,IACI57G,EACAjF,EAFE5R,EAAK8zC,EAAK9zC,GAAGrE,WAGbu2H,EAAWP,EAAuB79E,GACxC,GAAIqL,EAAerL,IAASA,EAAKoxD,UAC/BruF,EAAO,CAAC67G,EAAa5+E,EAAKj9B,KAAK,GAAI5Y,IAIjC2T,EAHG6sC,EAAO5nC,EAAK,IAGTq7G,EAASr7G,GAFT+7G,EAAM5yH,EAAI6W,EAAM5Y,QAInB,GAAIuzH,EAAc19E,EAAM71C,EAAQw3C,SAIrC,GAFA5+B,GADAA,EAAO46G,EAAY39E,EAAM71C,EAAQw3C,UACrB94C,KAAI,SAAA8N,GAAG,OAAIioH,EAAajoH,EAAKxM,MAErC2zH,EAAc5xH,EAAI/B,EAAQw3C,SAAU,CAKtC,IAHA,IAAMu9E,EAAS,GACTC,EAAO,GAEJx5H,EAAI,EAAGA,EAAIod,EAAK3Z,OAAQzD,IAC1BglD,EAAO5nC,EAAKpd,IAGfw5H,EAAKn+G,KAAK+B,EAAKpd,IAFfu5H,EAAOl+G,KAAK+B,EAAKpd,IAMjBu5H,EAAO91H,OAAS,GAClB0U,EAAMshH,EAAOlzH,EAAIgzH,EAAQd,EAAUj0H,GACnCg1H,EAAK1tG,QAAQ3T,GACbA,EAAMshH,EAAOlzH,EAAIizH,EAAMf,EAAUj0H,IAGjC2T,EAAMshH,EAAOlzH,EAAI6W,EAAMq7G,EAAUj0H,QAInC2T,EAAMshH,EAAOlzH,EAAI6W,EAAMq7G,EAAUj0H,QAInC4Y,EAAOi9B,EAAKj9B,KAAKla,KAAI,SAAA8N,GAAG,OAAIioH,EAAajoH,EAAKxM,MAC9C2T,EAAMshH,EAAOlzH,EAAI6W,EAAMq7G,EAAUj0H,GAEnC,OAAO2T,EAET,IAAK,kBAEH,OAAO8gH,EAAa5+E,EAAK/kB,QAAS9wB,GACpC,IAAK,eACH,OAjNN,SAAwB3B,EAAK2K,EAAOhJ,GAClC,IAAKghD,EAAYh4C,GACf,OAAO,IAAI2xF,EAAa65B,EAAYn2H,GAAMm2H,EAAYxrH,IAExD,GAAIy3C,EAAYpiD,IAAQqhD,EAASrhD,GAAM,CAQrC,IAPA,IAAM62H,EAAgB5pH,MAAMqD,KAAK3F,EAAM4sE,YAOhCs/C,EAAcj2H,OAAS,GAC5B,GAAI4hD,EAAeq0E,EAAc,KACK,iBAA3BA,EAAc,GAAGz4H,MAAoB,CAC9C,IAAMmT,EAAQ8kH,EAAUQ,EAAcluG,QAAQvqB,MAAOuD,GACjDygD,EAAYpiD,GACdA,EAAMA,EAAI4b,MAAMrK,EAAQ,IAExBvR,EAAMA,EAAIya,UAAUlJ,EAAQ,cACTtE,QACjBjN,EAAMosD,EAAOpsD,QAGZ,MAAI62H,EAAcj2H,OAAS,GACvB4hD,EAAeq0E,EAAc,KACK,iBAA3BA,EAAc,GAAGz4H,OAwBjC,MAvBA,IADqD,EAC/CouC,EAAS6pF,EAAUQ,EAAc,GAAGz4H,MAAOuD,GAC3Cm1H,EAAW,GACXC,EAAY30E,EAAYpiD,GAAOA,EAAI4b,MAAQ5b,EAAIya,UAHA,KAIlCs8G,GAJkC,IAIrD,2BAA8B,KAAnBzvF,EAAmB,QAC5B,GAAI8a,EAAY9a,GACdwvF,EAASt+G,KAAK8uB,EAAK1rB,MAAM4wB,EAAS,QAC7B,KAAI6U,EAASrhD,GAGlB,MAFA82H,EAASt+G,KAAK8uB,EAAKkF,EAAS,MARqB,8BAarD,GAAIsqF,EAASl2H,SAAWm2H,EAAUn2H,OAQhC,MANEZ,EADEoiD,EAAYpiD,GACR,IAAI28F,EAAUm6B,GAEd1qE,EAAO0qE,GAEfD,EAAc3mH,OAAO,EAAG,GAQ9B,OAAI2mH,EAAcj2H,SAAW+J,EAAM4sE,WAAW32E,OAErC,IAAI07F,EAAa65B,EAAYn2H,GAAM2K,GAExCksH,EAAcj2H,OAAS,GAEzB+J,EAAQ,IAAI07F,EAAUwwB,GACf,IAAIv6B,EAAa65B,EAAYn2H,GAAM2K,IAGrC3K,EAET,GAAI4iD,EAAa5iD,IACe,IAA5B2K,EAAM4sE,WAAW32E,QACjB4hD,EAAe73C,EAAM4sE,WAAW,IAAK,CACvC,IAAM74E,EAAMiM,EAAM4sE,WAAW,GAAGn5E,MAChC,OAAIM,KAAOsB,EAAIqZ,WACNrZ,EAAIqZ,WAAW3a,GAEjB,IAAIonG,EAGb,OAAO,IAAIxJ,EAAa65B,EAAYn2H,GAAM2K,GAsI/BqsH,CACLZ,EAAa5+E,EAAK34C,OAAQ8C,GAC1By0H,EAAa5+E,EAAK7sC,MAAOhJ,GACzBA,GACJ,IAAK,YACH,IAAMs1H,EAAYz/E,EAAK57B,MAAMvb,KAAI,SAAAinC,GAAI,OAAI8uF,EAAa9uF,EAAM3lC,MAC5D,OAAIs1H,EAAUlgG,KAAKorB,GACV,IAAIw6C,EAAUs6B,EAAU52H,IAAI81H,IAG9B/pE,EAAO6qE,GAEhB,IAAK,YACH,OAAO,IAAI5wB,EACT7uD,EAAK+/B,WAAWl3E,KAAI,SAAAzB,GAAC,OAAIs3H,EAAiBt3H,EAAG+C,OAEjD,IAAK,aACH,IAAMu1H,EAAY,GAClB,IAAK,IAAMv3E,KAAQnI,EAAKn+B,WACtB69G,EAAUv3E,GAAQu2E,EAAiB1+E,EAAKn+B,WAAWsmC,GAAOh+C,GAE5D,OAAO,IAAIolG,EAAWmwB,GAExB,IAAK,iBAEL,IAAK,YAEL,IAAK,yBAEL,IAAK,YAEL,IAAK,kBAEL,QACE,MAAM,IAAIv8G,MAAJ,uDAA0D68B,EAAK3tC,QA9XtDusH,CAAap7B,EAAMr5F,IAGxC,SAASw1H,EAAkBC,GACzB,OAAIl2E,EAAWk2E,GACNA,EAAM38G,UAEX28G,aAAiBnqH,MACZmqH,EAAM/2H,IAAI82H,GAEf91E,EAAS+1E,GACJhrE,EAAO+qE,EAAiBC,EAAM38G,YAEhC28G,EAGT,SAASd,EAAOe,EAAQ98G,EAAM5Y,GAC5B,IACE,OAAOg5F,EAAkB08B,GAAQ1zH,MAAM,KAAM4W,GAC7C,MAAOykB,GAGP,OADAzkB,EAAOA,EAAKla,IAAI82H,GACTd,EAAU17B,EAAkB08B,GAAQ1zH,MAAM,KAAM4W,GAAO5Y,IAIlE,IAAM21H,EAAUz4F,EAAM,CACpBrP,SAgGF,SAA0BjuB,GACxB,IAAI3C,EACE24H,EAAKh2H,EAAErC,EAAIqC,EAAE3C,EAEjBA,EADE24H,EAAK,EACH,IAAInwB,EAAa,IAAK,aAAc,CAAC,IAAItB,GAAcyxB,KAEvD,IAAIzxB,EAAayxB,GAGvB,GAAY,IAARh2H,EAAE9D,EACJ,OAAOmB,EAET,OAAO,IAAIwoG,EAAa,IAAK,SAAU,CAACxoG,EAAG,IAAIknG,EAAavkG,EAAE9D,MA3G9D2iB,OAAQ,SAAUxhB,GAChB,OAAIA,EAAI,EACC44H,EAAe,IAAI1xB,GAAclnG,IAEnC,IAAIknG,EAAalnG,IAE1BktD,UAAW,SAAUltD,GACnB,OAAIA,EAAI,EACC44H,EAAe,IAAI1xB,GAAclnG,IAEnC,IAAIknG,EAAalnG,IAE1B2U,QAAS,SAAUrU,GACjB,MAAM,IAAIyb,MAAM,0CAElBd,OAAQ,SAAU3a,GAChB,OAAO,IAAI4mG,EAAa5mG,IAE1B0uD,OAAQ,SAAUrwD,GAChB,OAAO,IAAIo/F,EAAUp/F,EAAEkd,UAAUpa,KAAI,SAAAmf,GAAC,OAAI83G,EAAQ93G,UAItD,SAAS22G,EAAaiB,GACpB,OAAIj1E,EAAOi1E,GACFA,EAEFE,EAAQF,GAKjB,SAASK,EAAgB74H,EAAG+C,GAE1B,GADwBA,IAAsC,IAA3BA,EAAQ+1H,gBACrBhkH,SAAS9U,IAAMinD,EAAU,CAC7C,IAAMtkD,EAAIskD,EAASjnD,GACb+4H,EAAkBh2H,GAA6C,iBAA3BA,EAAQg2H,eAC9Ch2H,EAAQg2H,eACRziH,IAEJ,GAAI3T,EAAEkZ,YAAc7b,GAAK2C,EAAE3C,EAAI+4H,GAAkBp2H,EAAE9D,EAAIk6H,EACrD,OAAOp2H,EAGX,OAAO3C,EAKT,IAAMy3H,EAAYx3F,EAAM,CACtB,iBAAkB,SAAU3/B,EAAGyC,GAC7B,MAAsB,cAAlBqsB,EAAO5N,aACSvf,IAAdgpE,GACFJ,KAEKI,EAAU3qE,IACU,aAAlB8uB,EAAO5N,aACCvf,IAAbglD,GACF6jB,KAEK7jB,EAAS3mD,IAGTu4H,EADGvjH,WAAWhV,GACIyC,IAI7B,mBAAoB,SAAUzC,EAAGyC,GAAW,OAAOzC,GAEnD,oBAAqB,SAAUA,EAAGyC,GAAW,OAAOzC,GAEpD,iBAAkB,SAAUA,EAAGyC,GAC7B,OAAO81H,EAAev4H,EAAGyC,IAG3B,kBAAmB,SAAUzC,EAAGyC,GAC9B,OAAa,IAATzC,EAAEsV,GACGtV,EAEFu4H,EAAev4H,EAAEqV,GAAI5S,IAG9B,iBAAkB,SAAUzC,EAAGyC,GAC7B,OAAOyqD,EAAOqrE,EAAev4H,EAAEub,aAGjC,gBAAiB,SAAUvb,EAAGyC,GAC5B,OAAOzC,EAAEmB,IAAIo3H,MAIjB,SAASD,EAAgB54H,GACvB,OAAO,IAAIwoG,EAAa,IAAK,aAAc,CAACxoG,IA2G9C,SAASg4H,EAAQlzH,EAAI6W,EAAMq7G,EAAUj0H,GACnC,OAAO4Y,EAAK4tC,QAAO,SAAUn1C,EAAGC,GAC9B,GAAKkvC,EAAOnvC,IAAOmvC,EAAOlvC,GAMdkvC,EAAOnvC,GAEPmvC,EAAOlvC,KACjBA,EAAIqkH,EAAQrkH,IAFZD,EAAIskH,EAAQtkH,OAPgB,CAC5B,IACE,OAAOsjH,EAAM5yH,EAAI,CAACsP,EAAGC,GAAItR,GACzB,MAAO40H,IACTvjH,EAAIskH,EAAQtkH,GACZC,EAAIqkH,EAAQrkH,GAOd,OAAO2iH,EAAS,CAAC5iH,EAAGC,OAiJxB,OAAOijH,KC1YI0B,GAAiCl7H,GA7BjC,WACQ,CACnB,SACA,QACA,QACA,MACA,WACA,WACA,SACA,MACA,SACA,QACA,UACA,eACA,YACA,aACA,oBACA,SACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,kBACA,eAGwE,YA4BrE,IA1BDsxB,EA0BC,EA1BDA,OACA6Q,EAyBC,EAzBDA,MACA1qB,EAwBC,EAxBDA,MAOAytD,GAiBC,EAvBD53D,IAuBC,EAtBDuhB,SAsBC,EArBD8hB,SAqBC,EApBDpoB,OAoBC,EAnBD7Q,IAmBC,EAlBDgQ,OAkBC,EAjBDw9C,OACAt6D,EAgBC,EAhBDA,QACAo2G,EAeC,EAfDA,aACA73D,EAcC,EAdDA,SACAgkB,EAaC,EAbDA,UACA8wB,EAYC,EAZDA,kBACAvuC,EAWC,EAXDA,OACAkwC,EAUC,EAVDA,aACAK,EASC,EATDA,UACAmJ,EAQC,EARDA,aACA+E,EAOC,EAPDA,aACAxE,EAMC,EANDA,UACAU,EAKC,EALDA,WACAK,EAIC,EAJDA,aACAoC,EAGC,EAHDA,gBACAgB,EAEC,EAFDA,WAGI0rB,EAAmBD,GAAuB,CAC9Cp3F,QACA7Q,SACA2sE,oBACAvuC,SACAvG,WACAgkB,YACAyyB,eACAK,YACAmJ,eACA+E,eACAxE,YACAU,aACAK,eACAoD,eAGF,EACEgqB,GAAW,CAAE3pB,eAAczD,eAAcoD,eADnCwqB,EAAR,EAAQA,YAAaM,EAArB,EAAqBA,cAAeJ,EAApC,EAAoCA,cAAeK,EAAnD,EAAmDA,aAAc91E,EAAjE,EAAiEA,QAASk2E,EAA1E,EAA0EA,WAAYG,EAAtF,EAAsFA,WAAYT,EAAlG,EAAkGA,uBAAwBZ,EAA1H,EAA0HA,eAAgBsB,EAA1I,EAA0IA,YAAaC,EAAvJ,EAAuJA,gBA0GjJ/4C,EAAWp+C,EAAM,WAAY,CACjChlB,OAAQ,SAAUmhF,GAChB,OAAOj+F,KAAKoX,EAAM6mF,GAAOj+F,KAAK86H,MAAOxsE,KAAkB,KAGzD,uBAAwB,SAAU2vC,EAAMhxC,GACtC,OAAOjtD,KAAKoX,EAAM6mF,GAAOj+F,KAAK86H,MAAO7tE,EAAO,KAG9C,+BAAgC,SAAUgxC,EAAMhxC,EAAOroD,GACrD,OAAO5E,KAAKoX,EAAM6mF,GAAOj+F,KAAK86H,MAAO7tE,EAAOroD,IAG9C,gBAAiB,SAAUq5F,EAAM68B,GAC/B,OAAO96H,KAAKoX,EAAM6mF,GAAO68B,EAAOxsE,KAAkB,KAGpD,8BAA+B,SAAU2vC,EAAM68B,EAAO7tE,GACpD,OAAOjtD,KAAKoX,EAAM6mF,GAAO68B,EAAO7tE,EAAO,KAGzC,sCAAuC,SAAUgxC,EAAM68B,EAAO7tE,EAAOroD,GACnE,OAAO5E,KAAKoX,EAAM6mF,GAAO68B,EAAO7tE,EAAOroD,IAGzC,qBAAsB,SAAUq5F,EAAMhxC,GACpC,OAAOjtD,KAAKi+F,EAAMj+F,KAAK86H,MAAO7tE,EAAO,KAGvC,6BAA8B,SAAUgxC,EAAMhxC,EAAOroD,GACnD,OAAO5E,KAAKi+F,EAAMj+F,KAAK86H,MAAO7tE,EAAOroD,IAGvCi5F,KAAM,SAAUI,GACd,OAAOj+F,KAAKi+F,EAAMj+F,KAAK86H,MAAOxsE,KAAkB,KAGlD,cAAe,SAAU2vC,EAAM68B,GAC7B,OAAO96H,KAAKi+F,EAAM68B,EAAOxsE,KAAkB,KAG7C,4BAA6B,SAAU2vC,EAAM68B,EAAO7tE,GAClD,OAAOjtD,KAAKi+F,EAAM68B,EAAO7tE,EAAO,KAGlC,8BAA+B,SAAUgxC,EAAM68B,EAAO7tE,EAAOroD,GAC3D,OAAO5E,KAAKi+F,EAAM68B,EAAOtsE,GAAUvB,GAAQroD,IAG7C,2BAA4B,SAAUq5F,EAAM68B,EAAO7tE,EAAOroD,GACxD,IAAMm2H,EAAQn2H,EAAQo2H,aACtBF,EAkUJ,SAAsBA,EAAO1+E,GAG3B,IADA,IAAM6+E,EAAU,GACP76H,EAAI,EAAGA,EAAI06H,EAAMj3H,OAAQzD,IAAK,CACrC,IAAI86H,EAAOJ,EAAM16H,GACb+6H,OAAO,EACLC,EAAW,IAAOF,GACxB,OAAQE,GACN,IAAK,SACHF,EAAO,CAAE/4H,EAAG+4H,GAEd,IAAK,SACHC,EAAUE,EAAkBH,EAAM9+E,GAClC,MACF,IAAK,WACH++E,EAAUD,EACV,MACF,QACE,MAAM5xH,UAAU,6BAA+B8xH,GAInDH,EAAQx/G,KAAK0/G,GAEf,OAAOF,EA1VGK,CAAYR,EAAOl2H,EAAQw3C,SAKnC,IAJA,IAAI7jC,EAAMhO,EAAQ0zF,EAAMhxC,GAElB62D,EAAU,GACZtjG,GAFJjI,EAAMgjH,EAAahjH,IAELjW,SAAS,CAAE2+F,YAAa,SAC9B6iB,EAAQtjG,IAAM,CACpBsjG,EAAQtjG,IAAO,EACfg7G,EAAW,EACX,IAAIC,EAAUj7G,EACVu6G,GAAOz/E,QAAQhlC,IAAI,eAAgBkK,GACvC,IAAK,IAAIpgB,EAAI,EAAGA,EAAI06H,EAAMj3H,OAAQzD,IAAK,CACrC,IAAIs7H,EAAU,GAWd,GAVwB,mBAAbZ,EAAM16H,IACfmY,EAAMuiH,EAAM16H,GAAGmY,EAAK3T,GAChBm2H,IAAOW,EAAUZ,EAAM16H,GAAGO,QAE9B+hD,EAAQnqC,EAAK3T,EAAQw3C,SACrB7jC,EAAMojH,EAAUpjH,EAAKuiH,EAAM16H,GAAIwE,EAAQw3C,SACnC2+E,IACFW,EAAU,GAAH,OAAMZ,EAAM16H,GAAGC,EAAEiC,WAAjB,eAAkCw4H,EAAM16H,GAAGc,EAAEoB,cAGpDy4H,EAAO,CACT,IAAMa,EAASrjH,EAAIjW,SAAS,CAAE2+F,YAAa,QACvC26B,IAAWH,IACbngF,QAAQhlC,IAAI,WAAYolH,EAAS,WAAYE,GAC7CH,EAAUG,GAMd7C,EAAWxgH,EAAK3T,EAAQw3C,SAE1B57B,EAAMjI,EAAIjW,SAAS,CAAE2+F,YAAa,QAEpC,OAAO1oF,KAOX,SAASgjH,EAAc9gF,GACrB,OAAOA,EAAK+jD,WAAU,SAAU/jD,EAAM9G,EAAMpnC,GAC1C,OAAOw5C,EAAkBtL,GACrB8gF,EAAa9gF,EAAK/kB,SAClB+kB,KARRylC,EAASw3C,eAAiBA,EAC1Bx3C,EAAS84C,YAAcA,EACvB94C,EAAS+4C,gBAAkBA,EAW3B,IAAM4C,EAAsB,CAC1B31B,MAAM,EACNC,OAAO,EACP1jF,GAAG,EACHriB,GAAG,EACH+X,UAAU,EACV5B,KAAK,EACLqN,MAAM,EACNu5F,OAAO,EACP1kE,QAAQ,EACR3jC,KAAK,EACLi7C,KAAK,EACL/+B,IAAI,EACJosF,SAAS,EACTC,OAAO,EACP7X,KAAK,GAuMP,SAAS61B,EAAmBS,EAAY1/E,GACtC,IAAM++E,EAAU,GAChB,GAAIW,EAAW35H,EAAG,CAChB,IAAM45H,EAAKD,EAAW35H,EAAE+S,MAAM,MAC9B,GAAkB,IAAd6mH,EAAGl4H,OAIL,MAAMkS,YAAY,yBAA2B+lH,EAAW35H,GAHxDg5H,EAAQ96H,EAAI07H,EAAG,GACfZ,EAAQj6H,EAAI66H,EAAG,QAKjBZ,EAAQ96H,EAAIy7H,EAAWz7H,EACvB86H,EAAQj6H,EAAI46H,EAAW56H,EAEzBi6H,EAAQ96H,EAAIk7H,EAAankH,EAAM+jH,EAAQ96H,IACvC86H,EAAQj6H,EAAIq6H,EAAankH,EAAM+jH,EAAQj6H,IACvC,cAAmB,CAAC,gBAAiB,SAAU,YAA/C,eAA4D,CAAvD,IAAM0hD,EAAI,KACTA,KAAQk5E,IACVX,EAAQv4E,GAAQk5E,EAAWl5E,IAO/B,GAJIk5E,EAAWh+B,WACbq9B,EAAQr9B,SAAW1mF,EAAM0kH,EAAWh+B,WAGlCq6B,EAAcgD,EAAQ96H,EAAG+7C,GAAU,CACrC,IAAMy8E,EAAWP,EAAuB6C,EAAQ96H,GAC1C27H,EA0DD,IAAIvuB,EAAW,KAAO+tB,KAzD3BL,EAAQc,SAAW,GACnBd,EAAQc,SAAS57H,EAAIw4H,EAAS,CAACsC,EAAQ96H,EAAEyxB,QAASkqG,IAGlDt5E,EAAQy4E,EAAQc,SAAS57H,EAAG+7C,GAC5Bw8E,EAAWuC,EAAQc,SAAS57H,EAAG+7C,GAC/B++E,EAAQc,SAAS/6H,EAAI23H,EAAS,CAACsC,EAAQj6H,EAAG86H,IAG5C,OAAOb,EA7NTj7C,EAAS46C,MAAQ,CACfna,EAQA,CAAEtgH,EAAG,SAAUa,EAAG,KAKlB,CACEiB,EAAG,gBACH+5H,SAAU,CAAE1tG,SAAU,CAAEopG,OAAO,KAEjC,CACEz1H,EAAG,WACH+5H,SAAU,CAAE1tG,SAAU,CAAEopG,OAAO,KAEjC,CACEz1H,EAAG,qBACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,GAAQrpG,SAAU,CAAEopG,OAAO,KAElE,CACEz1H,EAAG,qBACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,GAASrpG,SAAU,CAAEopG,OAAO,KAEnE,CACEz1H,EAAG,qBACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,GAASrpG,SAAU,CAAEopG,OAAO,KAEnE,CAAEv3H,EAAG,WAAYa,EAAG,UACpB,CAAEb,EAAG,KAAMa,EAAG,YACd,CAAEb,EAAG,iBAAkBa,EAAG,oBAAqBivC,QAAQ,GACvD,CAAE9vC,EAAG,UAAWa,EAAG,YACnB,CAAEb,EAAG,OAAQa,EAAG,WAChB,CACEiB,EAAG,8BACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CACE11H,EAAG,oCACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAIvC,CACE11H,EAAG,iCACH+5H,SAAU,CAAEh0G,OAAQ,CAAE0vG,OAAO,KAI/B,CAAEv3H,EAAG,0BAA2Ba,EAAG,8BACnC,CACEiB,EAAG,2DACH+5H,SAAU,CAAEh0G,OAAQ,CAAE0vG,OAAO,KAE/B,CACEz1H,EAAG,2DACH+5H,SAAU,CAAEh0G,OAAQ,CAAE0vG,OAAO,KAE/B,CACEz1H,EAAG,2DACH+5H,SAAU,CAAEh0G,OAAQ,CAAE0vG,OAAO,KAE/B,CAAEv3H,EAAG,MAAOa,EAAG,OACf,CACEiB,EAAG,uBACH+5H,SAAU,CAAEh0G,OAAQ,CAAE0vG,OAAO,KAE/B,CACEz1H,EAAG,2BACH+5H,SAAU,CAAEh0G,OAAQ,CAAE0vG,OAAO,KAO/BuB,EAGA,CACEh3H,EAAG,aACH+5H,SAAU,CAAEjvH,IAAK,CAAE2qH,OAAO,KAE5B,CAAEv3H,EAAG,OAAQa,EAAG,KAChB,CAAEb,EAAG,UAAWa,EAAG,WACnB,CAAEb,EAAG,gBAAiBa,EAAG,cACzB,CAAEb,EAAG,2BAA4Ba,EAAG,iCACpC,CAAEb,EAAG,2BAA4Ba,EAAG,iCACpC,CACEiB,EAAG,qBACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CACE11H,EAAG,8BACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CACE11H,EAAG,8DACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CACE11H,EAAG,8DACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CAAEx3H,EAAG,UAAWa,EAAG,WACnB,CACEiB,EAAG,qBACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAGvCsB,EAGA,CACEh3H,EAAG,qBACH+5H,SAAU,CAAE1tG,SAAU,CAAEopG,OAAO,KAEjC,CACEz1H,EAAG,qBACH+5H,SAAU,CAAE1tG,SAAU,CAAEopG,OAAO,GAAQtnF,SAAU,CAAEunF,aAAa,KAIlE,CACE11H,EAAG,aACH+5H,SAAU,CAAEjvH,IAAK,CAAE4qH,aAAa,IAChCsE,cAAe,CAAElvH,IAAK,CAAE4qH,aAAa,KAEvC,CACE11H,EAAG,aACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,IACrCsE,cAAe,CAAE7rF,SAAU,CAAEunF,aAAa,KAK5C,CAAEx3H,EAAG,QAASa,EAAG,QACjB,CACEiB,EAAG,oBACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CACE11H,EAAG,sBACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CACE11H,EAAG,cACH+5H,SAAU,CAAE5rF,SAAU,CAAEunF,aAAa,KAEvC,CAAEx3H,EAAG,MAAOa,EAAG,KACf,CACEiB,EAAG,yBACH+5H,SAAU,CAAE5rF,SAAU,CAAEwnF,aAAa,KAEvC,CACE31H,EAAG,uBACH+5H,SAAU,CAAEE,SAAU,CAAEtE,aAAa,EAAMD,aAAa,KAO1D,CAAEx3H,EAAG,MAAOa,EAAG,IAAKi7H,cAAe,CAAE7rF,SAAU,CAAEunF,aAAa,KAE9D,CACE11H,EAAG,2BACH+5H,SAAU,CAAE5rF,SAAU,CAAEwnF,aAAa,KAGvC,CAAEz3H,EAAG,WAAYa,EAAG,WA2FtB,IAAIs6H,EAAW,EAKf,SAASa,EAASpgD,EAAOi/C,EAAM9+E,GAC7B,IAAIkgF,EAAWrgD,EACf,GAAIA,EACF,IAAK,IAAI77E,EAAI,EAAGA,EAAI67E,EAAMp4E,SAAUzD,EAAG,CACrC,IAAMm8H,EAAUZ,EAAU1/C,EAAM77E,GAAI86H,EAAM9+E,GACtCmgF,IAAYtgD,EAAM77E,KAChBk8H,IAAargD,IACfqgD,EAAWrgD,EAAM7rE,SAEnBksH,EAASl8H,GAAKm8H,GAIpB,OAAOD,EAWT,SAASX,EAAWlhF,EAAMygF,EAAM9+E,GAK9B,GAAI8+E,EAAKgB,SACP,IAAK,IAAM//G,KAAU++G,EAAKgB,SACxB,IAAK,IAAMn6H,KAAYm5H,EAAKgB,SAAS//G,GACnC,GAAI87G,EAAY97G,EAAQpa,EAAUq6C,KAC9B8+E,EAAKgB,SAAS//G,GAAQpa,GACxB,OAAO04C,EAMf,IAAM+hF,EAAgBhE,EAAa0C,EAAKiB,cAAe//E,GAGnD7jC,EAAMkiC,EAKV,GAAIliC,aAAe8xF,GAAgB9xF,aAAeu1F,EAAc,CAC9D,IAAM2uB,EAAUJ,EAAQ9jH,EAAIiF,KAAM09G,EAAM9+E,GACpCqgF,IAAYlkH,EAAIiF,QAClBjF,EAAMA,EAAIuZ,SACNtU,KAAOi/G,QAER,GAAIlkH,aAAek0F,GACxB,GAAIl0F,EAAImd,QAAS,CACf,IAAMgnG,EAAaf,EAAUpjH,EAAImd,QAASwlG,EAAM9+E,GAC5CsgF,IAAenkH,EAAImd,UACrBnd,EAAM,IAAIk0F,EAAgBiwB,UAGzB,GAAInkH,aAAeqnF,EAAW,CACnC,IAAM+8B,EAAWN,EAAQ9jH,EAAIsG,MAAOq8G,EAAM9+E,GACtCugF,IAAapkH,EAAIsG,QACnBtG,EAAM,IAAIqnF,EAAU+8B,SAEjB,GAAIpkH,aAAegnF,EAAc,CACtC,IAAIq9B,EAASrkH,EAAIzW,OACbyW,EAAIzW,SACN86H,EAASjB,EAAUpjH,EAAIzW,OAAQo5H,EAAM9+E,IAEvC,IAAIygF,EAAWtkH,EAAI3K,MACf2K,EAAI3K,QACNivH,EAAWlB,EAAUpjH,EAAI3K,MAAOstH,EAAM9+E,IAEpCwgF,IAAWrkH,EAAIzW,QAAU+6H,IAAatkH,EAAI3K,QAC5C2K,EAAM,IAAIgnF,EAAaq9B,EAAQC,SAE5B,GAAItkH,aAAe+wF,EAAW,CACnC,IAAMwzB,EAAUT,EAAQ9jH,EAAIiiE,WAAY0gD,EAAM9+E,GAC1C0gF,IAAYvkH,EAAIiiE,aAClBjiE,EAAM,IAAI+wF,EAAUwzB,SAEjB,GAAIvkH,aAAeyxF,EAAY,CACpC,IAAI33C,GAAU,EACR0qE,EAAW,GACjB,IAAK,IAAMn6E,KAAQrqC,EAAI+D,WACrBygH,EAASn6E,GAAQ+4E,EAAUpjH,EAAI+D,WAAWsmC,GAAOs4E,EAAM9+E,GACnD2gF,EAASn6E,KAAUrqC,EAAI+D,WAAWsmC,KACpCyP,GAAU,GAGVA,IACF95C,EAAM,IAAIyxF,EAAW+yB,IAKzB,IAAIC,EAAO9B,EAAKh6H,EACZgiC,EAAU+5F,EAAW/B,EAAK76H,EAAGkY,EAAKikH,GAAe,GASrD,IALKt5F,GAAWg4F,EAAKe,WACnBe,EAAO9B,EAAKe,SAAS/6H,EACrBgiC,EAAU+5F,EAAW/B,EAAKe,SAAS57H,EAAGkY,EAAKikH,GAAe,IAGxDt5F,EAAS,CAKX,IAAMqnE,EAAWhyF,EAAIgyF,SACrBhyF,EAAMykH,EAAKlrG,QACPy4E,GAAY,aAAcyyB,IAC5BzkH,EAAIgyF,UAAW,GAIjBhyF,EAAMA,EAAIimF,WAAU,SAAU/jD,GAC5B,OAAIA,EAAKwL,cAAgBhkD,GAAeihC,EAAQg6F,aAAcziF,EAAK95C,MAC1DuiC,EAAQg6F,aAAaziF,EAAK95C,MAAMmxB,QAEhC2oB,KAYb,OAJIygF,EAAK/qF,QAAU53B,IAAQkiC,IACzBliC,EAAMojH,EAAUpjH,EAAK2iH,EAAM9+E,IAGtB7jC,EAwCT,SAAS4kH,EAAYC,EAAQC,GAC3B,IAAM9kH,EAAM,CAAE2kH,aAAc,IAG5B,IAAKE,EAAOF,eAAiBG,EAAOH,aAClC,OAAO3kH,EACF,IAAK6kH,EAAOF,aACjB,OAAOG,EACF,IAAKA,EAAOH,aACjB,OAAOE,EAIT,IAAK,IAAMz7H,KAAOy7H,EAAOF,aACvB,GAAIj7H,GAAem7H,EAAOF,aAAcv7H,KACtC4W,EAAI2kH,aAAav7H,GAAOy7H,EAAOF,aAAav7H,GAExCM,GAAeo7H,EAAOH,aAAcv7H,KACjC27H,EAAYF,EAAOF,aAAav7H,GAAM07H,EAAOH,aAAav7H,KAC7D,OAAO,KAMf,IAAK,IAAMA,KAAO07H,EAAOH,aACnBj7H,GAAeo7H,EAAOH,aAAcv7H,KACtC4W,EAAI2kH,aAAav7H,GAAO07H,EAAOH,aAAav7H,IAIhD,OAAO4W,EAOT,SAASglH,EAAqBC,EAAOC,GACnC,IAMI9E,EANEpgH,EAAM,GAEZ,GAAqB,IAAjBilH,EAAM35H,QAAiC,IAAjB45H,EAAM55H,OAC9B,OAAO0U,EAIT,IAAK,IAAImlH,EAAK,EAAGA,EAAKF,EAAM35H,OAAQ65H,IAClC,IAAK,IAAIC,EAAK,EAAGA,EAAKF,EAAM55H,OAAQ85H,KAClChF,EAASwE,EAAWK,EAAME,GAAKD,EAAME,MAEnCplH,EAAIkD,KAAKk9G,GAIf,OAAOpgH,EAqCT,SAAS0kH,EAAY/B,EAAMzgF,EAAM2B,EAASwhF,GAMxC,IAAIrlH,EAAM,CAAC,CAAE2kH,aAAc,KAE3B,GAAKhC,aAAgB7wB,GAAgB5vD,aAAgB4vD,GAClD6wB,aAAgBptB,GAAgBrzD,aAAgBqzD,EAAe,CAEhE,GAAIotB,aAAgB7wB,GAClB,GAAI6wB,EAAK5wB,KAAO7vD,EAAK6vD,IAAM4wB,EAAKv0H,KAAO8zC,EAAK9zC,GAC1C,MAAO,QAEJ,GAAIu0H,aAAgBptB,GACrBotB,EAAKv6H,OAAS85C,EAAK95C,KACrB,MAAO,GAKX,KAA0B,IAArB85C,EAAKj9B,KAAK3Z,QAAqC,IAArBq3H,EAAK19G,KAAK3Z,SACnCs0H,EAAc19E,EAAM2B,IACrB3B,EAAKj9B,KAAK3Z,SAAWq3H,EAAK19G,KAAK3Z,QAChC+5H,GAqCG,IAAInjF,EAAKj9B,KAAK3Z,QAAU,GAA0B,IAArBq3H,EAAK19G,KAAK3Z,OAAc,CAK1D,IAFA,IAAMg6H,EAzLZ,SAAoBpjF,EAAM2B,GACxB,IACInE,EAAO6lF,EADLvlH,EAAM,GAENsgH,EAAWP,EAAuB79E,GACxC,GAAI89E,EAAc99E,EAAM2B,GACtB,IAAK,IAAIh8C,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,OAAQzD,KACpC09H,EAAYrjF,EAAKj9B,KAAKpN,MAAM,IAClB+C,OAAO/S,EAAG,GACpB63C,EAA8B,IAArB6lF,EAAUj6H,OAAgBi6H,EAAU,GAAKjF,EAASiF,GAC3DvlH,EAAIkD,KAAKo9G,EAAS,CAACp+E,EAAKj9B,KAAKpd,GAAI63C,UAInC,IAAK,IAAI73C,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,OAAQzD,IAAK,CACzC,IAAI43C,EAAOyC,EAAKj9B,KAAK,GACjBpd,EAAI,IACN43C,EAAO6gF,EAASp+E,EAAKj9B,KAAKpN,MAAM,EAAGhQ,KAGrC63C,EAA8B,KAD9B6lF,EAAYrjF,EAAKj9B,KAAKpN,MAAMhQ,IACTyD,OAAgBi6H,EAAU,GAAKjF,EAASiF,GAC3DvlH,EAAIkD,KAAKo9G,EAAS,CAAC7gF,EAAMC,KAG7B,OAAO1/B,EAkKYwlH,CAAUtjF,EAAM2B,GAC3B4hF,EAAe,GACV59H,EAAI,EAAGA,EAAIy9H,EAAOh6H,OAAQzD,IAAK,CACtC,IAAM69H,EAAWhB,EAAW/B,EAAM2C,EAAOz9H,GAAIg8C,GAAS,GACtD4hF,EAAeA,EAAahtH,OAAOitH,GAErC,OAAOD,EACF,GAAI9C,EAAK19G,KAAK3Z,OAAS,EAC5B,MAAM+Z,MAAM,+CAAiDs9G,EAAK54H,YAGlE,MAAO,GA/CP,IADA,IAAI47H,EAAe,GACV99H,EAAI,EAAGA,EAAI86H,EAAK19G,KAAK3Z,OAAQzD,IAAK,CACzC,IAAM+9H,EAAalB,EAAW/B,EAAK19G,KAAKpd,GAAIq6C,EAAKj9B,KAAKpd,GAAIg8C,GAC1D,GAA0B,IAAtB+hF,EAAWt6H,OAEb,MAGFq6H,EAAaziH,KAAK0iH,GAEpB,GAAID,EAAar6H,SAAWq3H,EAAK19G,KAAK3Z,OAAQ,CAC5C,IAAK00H,EAAc99E,EAAM2B,IACA,IAArB8+E,EAAK19G,KAAK3Z,OACZ,MAAO,GAET,GAAIq3H,EAAK19G,KAAK3Z,OAAS,EAKrB,MAAM,IAAI+Z,MAAM,+EAGlB,IAAMwgH,EAAYnB,EAAW/B,EAAK19G,KAAK,GAAIi9B,EAAKj9B,KAAK,GAAI4+B,GACzD,GAAyB,IAArBgiF,EAAUv6H,OACZ,MAAO,GAET,IAAMw6H,EAAapB,EAAW/B,EAAK19G,KAAK,GAAIi9B,EAAKj9B,KAAK,GAAI4+B,GAC1D,GAA0B,IAAtBiiF,EAAWx6H,OACb,MAAO,GAETq6H,EAAe,CAACE,EAAWC,GAE7B9lH,EA1FN,SAA4B2lH,GAC1B,GAA4B,IAAxBA,EAAar6H,OACf,OAAOq6H,EAMT,IAHA,IAAMI,EAAOJ,EAAa9yE,OAAOmyE,GAC3BgB,EAAa,GACb7jC,EAAS,GACNt6F,EAAI,EAAGA,EAAIk+H,EAAKz6H,OAAQzD,IAAK,CACpC,IAAM+B,EAAIk4D,KAAKh9C,UAAUihH,EAAKl+H,IACzBs6F,EAAOv4F,KACVu4F,EAAOv4F,IAAK,EACZo8H,EAAW9iH,KAAK6iH,EAAKl+H,KAGzB,OAAOm+H,EA2EGC,CAAkBN,QAiBrB,GAAIhD,aAAgBztB,EAAY,CAKrC,GAAyB,IAArBytB,EAAKv6H,KAAKkD,OACZ,MAAM,IAAI+Z,MAAM,oCAElB,GAAIi+G,EAAoBX,EAAKv6H,OAE3B,GAAIu6H,EAAKv6H,OAAS85C,EAAK95C,KACrB,MAAO,QAEJ,GAAqB,MAAjBu6H,EAAKv6H,KAAK,IAA4C,OAA9Bu6H,EAAKv6H,KAAK8vB,UAAU,EAAG,GAIxDlY,EAAI,GAAG2kH,aAAahC,EAAKv6H,MAAQ85C,OAC5B,GAAqB,MAAjBygF,EAAKv6H,KAAK,GAAY,CAE/B,GAAK8kD,EAAehL,GAIlB,MAAO,GAHPliC,EAAI,GAAG2kH,aAAahC,EAAKv6H,MAAQ85C,MAK9B,IAAqB,MAAjBygF,EAAKv6H,KAAK,GASnB,MAAM,IAAIid,MAAM,2BAA6Bs9G,EAAKv6H,MAPlD,KAAI85C,aAAgBsuD,GAIlB,MAAO,GAHPxwF,EAAI,GAAG2kH,aAAahC,EAAKv6H,MAAQ85C,OAQhC,MAAIygF,aAAgBnyB,GAOzB,MAAO,GALP,IAAKlkC,EAAMq2D,EAAK75H,MAAOo5C,EAAKp5C,OAC1B,MAAO,GAUX,OAAOkX,EAUT,SAAS+kH,EAAap7H,EAAGsgB,GACvB,GAAItgB,aAAa6mG,GAAgBvmF,aAAaumF,GAC5C,IAAKlkC,EAAM3iE,EAAEb,MAAOmhB,EAAEnhB,OACpB,OAAO,OAEJ,GAAIa,aAAaurG,GAAcjrF,aAAairF,GACjD,GAAIvrG,EAAEvB,OAAS6hB,EAAE7hB,KACf,OAAO,MAEJ,MAAKuB,aAAamoG,GAAgB7nF,aAAa6nF,GACjDnoG,aAAa4rG,GAAgBtrF,aAAasrF,GAqB7C,OAAO,EApBP,GAAI5rG,aAAamoG,GACf,GAAInoG,EAAEooG,KAAO9nF,EAAE8nF,IAAMpoG,EAAEyE,KAAO6b,EAAE7b,GAC9B,OAAO,OAEJ,GAAIzE,aAAa4rG,GAClB5rG,EAAEvB,OAAS6hB,EAAE7hB,KACf,OAAO,EAIX,GAAIuB,EAAEsb,KAAK3Z,SAAW2e,EAAEhF,KAAK3Z,OAC3B,OAAO,EAGT,IAAK,IAAIzD,EAAI,EAAGA,EAAI8B,EAAEsb,KAAK3Z,OAAQzD,IACjC,IAAKk9H,EAAYp7H,EAAEsb,KAAKpd,GAAIoiB,EAAEhF,KAAKpd,IACjC,OAAO,EAOb,OAAO,EAGT,OAAO8/E,KCn/BIu+C,GAAqC9+H,GApBrC,eACQ,CACnB,QACA,SACA,MACA,WACA,WACA,SACA,MACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,kBACA,eAG4E,YAiBxE,IAhBJklE,EAgBI,EAhBJA,MACAx9C,EAeI,EAfJA,OACApa,EAcI,EAdJA,IACAuhB,EAaI,EAbJA,SACA8hB,EAYI,EAZJA,SACApoB,EAWI,EAXJA,OACA7Q,EAUI,EAVJA,IACAkoF,EASI,EATJA,aACAK,EAQI,EARJA,UACAmJ,EAOI,EAPJA,aACA+E,EAMI,EANJA,aACAxE,EAKI,EALJA,UACAU,EAII,EAJJA,WACAK,EAGI,EAHJA,aAEAoD,GACI,EAFJhB,gBAEI,EADJgB,YAEMixB,EAAQ,IAAI31B,EAAa,GACzB41B,EAAQ,IAAI51B,EAAa,GAE/B,EACE0uB,GAAW,CAAE3pB,eAAczD,eAAcoD,eADnCwqB,EAAR,EAAQA,YAAaM,EAArB,EAAqBA,cA2LrB,OA/JA,SAAS5X,EAAclmE,EAAM71C,GAC3B,IAAMw3C,EAAUx3C,EAAUA,EAAQw3C,aAAUt4C,EAC5C,GAAIm0H,EAAYx9E,EAAM,UAAW2B,GAAU,CAGzC,GAAIuJ,EAAelL,IAA8B,IAArBA,EAAKj9B,KAAK3Z,OACpC,OAAO88G,EAAalmE,EAAKj9B,KAAK,GAAI5Y,GAGpC,IAAIg6H,GAAY,EACZC,EAAa,EAOjB,GANApkF,EAAKx2C,SAAQ,SAAAxD,GAEQ,MADjBo+H,IAEAD,EAAYje,EAAalgH,EAAGmE,OAGb,IAAfi6H,EACF,OAAOD,EAGX,GAAI94E,EAAerL,IAASA,EAAKoxD,UAAW,CAC1C,IAAMizB,EAAKne,EAAalmE,EAAKj9B,KAAK,GAAI5Y,GAEtC,GAAgB,MAAZ61C,EAAK6vD,GAAY,CACnB,GAAIxkD,EAAeg5E,GAAK,CACtB,GAAIA,EAAGjzB,WAAuB,MAAVizB,EAAGx0B,GACrB,OAAOw0B,EAAGthH,KAAK,GACV,GAAIshH,EAAGn6G,YAAwB,aAAVm6G,EAAGn4H,GAC7B,OAAO,IAAI0jG,EAAa,IAAK,WAAY,CAACy0B,EAAGthH,KAAK,GAAIshH,EAAGthH,KAAK,KAGlE,OAAO,IAAI6sF,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACm4H,SAExC,IAAIh5E,EAAerL,IAASA,EAAK91B,WAAY,CAClD,IAAMm6G,EAAKne,EAAalmE,EAAKj9B,KAAK,GAAI5Y,GAChC+0F,EAAKgnB,EAAalmE,EAAKj9B,KAAK,GAAI5Y,GAEtC,GAAgB,MAAZ61C,EAAK6vD,GAAY,CACnB,GAAI7kD,EAAeq5E,GAAK,CACtB,GAAIz3G,EAAOy3G,EAAGz9H,OACZ,OAAOs4F,EACF,GAAIl0C,EAAek0C,GACxB,OAAO,IAAIoP,EAAa97F,EAAI6xH,EAAGz9H,MAAOs4F,EAAGt4F,QAG7C,OAAIokD,EAAek0C,IAAOtyE,EAAOsyE,EAAGt4F,OAC3By9H,EAELh5E,EAAe6zC,IAAOA,EAAGkS,WAAuB,MAAVlS,EAAG2Q,GACpC,IAAID,EAAa,IAAK,WAAY,CAACy0B,EAAInlC,EAAGn8E,KAAK,KAEjD,IAAI6sF,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAIgzF,EAAK,CAACmlC,EAAInlC,GAAM,CAACmlC,IACtD,GAAgB,MAAZrkF,EAAK6vD,GAAY,CAC1B,GAAI7kD,EAAeq5E,IAAOnlC,EAAI,CAC5B,GAAIl0C,EAAek0C,GACjB,OAAO,IAAIoP,EAAav6E,EAASswG,EAAGz9H,MAAOs4F,EAAGt4F,QACzC,GAAIgmB,EAAOy3G,EAAGz9H,OACnB,OAAO,IAAIgpG,EAAa,IAAK,aAAc,CAAC1Q,IAIhD,GAAgB,aAAZl/C,EAAK9zC,GACP,OAAI8+C,EAAek0C,IAAOtyE,EAAOsyE,EAAGt4F,OAC3By9H,EAELh5E,EAAe6zC,IAAOA,EAAGkS,WAAuB,MAAVlS,EAAG2Q,GACpCqW,EACL,IAAItW,EAAa,IAAK,MAAO,CAACy0B,EAAInlC,EAAGn8E,KAAK,KAAM5Y,GAE7C,IAAIylG,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACm4H,EAAInlC,QAE5C,IAAgB,MAAZl/C,EAAK6vD,GAAY,CAC1B,GAAI7kD,EAAeq5E,GAAK,CACtB,GAAIz3G,EAAOy3G,EAAGz9H,OACZ,OAAOq9H,EACF,GAAI75D,EAAMi6D,EAAGz9H,MAAO,GACzB,OAAOs4F,EACF,GAAIl0C,EAAek0C,GACxB,OAAO,IAAIoP,EAAaz4D,EAASwuF,EAAGz9H,MAAOs4F,EAAGt4F,QAGlD,GAAIokD,EAAek0C,GAAK,CACtB,GAAItyE,EAAOsyE,EAAGt4F,OACZ,OAAOq9H,EACF,GAAI75D,EAAM80B,EAAGt4F,MAAO,GACzB,OAAOy9H,EACF,GAAIh5E,EAAeg5E,IAAOA,EAAGn6G,YACzBm6G,EAAGx0B,KAAO7vD,EAAK6vD,IAAMiuB,EAAc99E,EAAM2B,GAAU,CAC5D,IAAM2iF,EAAMD,EAAGthH,KAAK,GACpB,GAAIioC,EAAes5E,GAAM,CACvB,IAAMC,EAAQ,IAAIj2B,EAAaz4D,EAASyuF,EAAI19H,MAAOs4F,EAAGt4F,QACtD,OAAO,IAAIgpG,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACq4H,EAAOF,EAAGthH,KAAK,IAAKi9B,EAAK8vD,WAGxE,OAAIguB,EAAc99E,EAAM2B,GACf,IAAIiuD,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACgzF,EAAImlC,GAAKrkF,EAAK8vD,UAElD,IAAIF,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACm4H,EAAInlC,GAAKl/C,EAAK8vD,UAG7D,OAAO,IAAIF,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACm4H,EAAInlC,GAAKl/C,EAAK8vD,UACpD,GAAgB,MAAZ9vD,EAAK6vD,GAAY,CAC1B,GAAI7kD,EAAeq5E,GAAK,CACtB,GAAIz3G,EAAOy3G,EAAGz9H,OACZ,OAAOq9H,EACF,GAAIj5E,EAAek0C,KACb90B,EAAM80B,EAAGt4F,MAAO,IAAMwjE,EAAM80B,EAAGt4F,MAAO,IAAMwjE,EAAM80B,EAAGt4F,MAAO,IACvE,OAAO,IAAI0nG,EAAa7gF,EAAO42G,EAAGz9H,MAAOs4F,EAAGt4F,QAGhD,OAAO,IAAIgpG,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACm4H,EAAInlC,IAC1C,GAAgB,MAAZl/C,EAAK6vD,IACV7kD,EAAek0C,GAAK,CACtB,GAAItyE,EAAOsyE,EAAGt4F,OACZ,OAAOs9H,EACF,GAAI95D,EAAM80B,EAAGt4F,MAAO,GACzB,OAAOy9H,EAEP,GAAIr5E,EAAeq5E,GAEjB,OAAO,IAAI/1B,EAAa1xF,EAAIynH,EAAGz9H,MAAOs4F,EAAGt4F,QACpC,GAAIykD,EAAeg5E,IAAOA,EAAGn6G,YAAwB,MAAVm6G,EAAGx0B,GAAY,CAC/D,IAAM20B,EAAMH,EAAGthH,KAAK,GACpB,GAAIioC,EAAew5E,GACjB,OAAO,IAAI50B,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CACxCm4H,EAAGthH,KAAK,GACR,IAAIurF,EAAaz4D,EAAS2uF,EAAI59H,MAAOs4F,EAAGt4F,YAOpD,OAAO,IAAIgpG,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CAACm4H,EAAInlC,IAC1C,GAAIh0C,EAAelL,GACxB,OAAO,IAAIqzD,EACT6S,EAAalmE,EAAK9zC,IAAK8zC,EAAKj9B,KAAKla,KAAI,SAAAzB,GAAC,OAAI8+G,EAAa9+G,EAAG+C,OACvD,GAAIygD,EAAY5K,GACrB,OAAO,IAAImlD,EACTnlD,EAAK57B,MAAMvb,KAAI,SAAAzB,GAAC,OAAI8+G,EAAa9+G,EAAG+C,OACjC,GAAIugD,EAAe1K,GACxB,OAAO,IAAI8kD,EACTohB,EAAalmE,EAAK34C,OAAQ8C,GAAU+7G,EAAalmE,EAAK7sC,MAAOhJ,IAC1D,GAAIghD,EAAYnL,GACrB,OAAO,IAAI6uD,EACT7uD,EAAK+/B,WAAWl3E,KAAI,SAAAzB,GAAC,OAAI8+G,EAAa9+G,EAAG+C,OACtC,GAAIihD,EAAapL,GAAO,CAC7B,IAAMsiF,EAAW,GACjB,IAAK,IAAMn6E,KAAQnI,EAAKn+B,WACtBygH,EAASn6E,GAAQ+9D,EAAalmE,EAAKn+B,WAAWsmC,GAAOh+C,GAEvD,OAAO,IAAIolG,EAAW+yB,IAIxB,OAAOtiF,MCxNEykF,GAAgCv/H,GAThC,UACQ,CACnB,QACA,eACA,eACA,eACA,oBAGuE,YAMnE,IALJyX,EAKI,EALJA,MACA2xF,EAII,EAJJA,aACA+E,EAGI,EAHJA,aACAzD,EAEI,EAFJA,aACAoC,EACI,EADJA,gBA0EA,OA9CA,SAASliG,EAASkwC,EAAMwS,GAA2B,IAApBkyE,EAAoB,uDAAX,IAAIzhC,IAG1C,IAAKzwC,EACH,OAAOxS,EAKT,GAHKiU,GAAMzB,KACTA,EAAQuB,GAAUvB,IAEhBhH,EAAaxL,GAAO,CACtB,GAAI0kF,EAAOjgH,IAAIu7B,EAAK95C,MAAO,CACzB,IAAMy+H,EAAYlvH,MAAMqD,KAAK4rH,GAAQvwH,KAAK,MAC1C,MAAM,IAAIggG,eAAJ,wDAC6CwwB,EAD7C,MAIR,IAAM/9H,EAAQ4rD,EAAMhsD,IAAIw5C,EAAK95C,MAC7B,GAAIykD,EAAO/jD,GAAQ,CACjB,IAAMg+H,EAAa,IAAI3hC,IAAIyhC,GAE3B,OADAE,EAAWpyH,IAAIwtC,EAAK95C,MACb4J,EAAQlJ,EAAO4rD,EAAOoyE,GACxB,MAAqB,iBAAVh+H,EACT+V,EAAMhN,OAAO/I,SACDyC,IAAVzC,EACF,IAAI0nG,EAAa1nG,GAEjBo5C,EAEJ,GAAIqL,EAAerL,GAAO,CAC/B,IAAMj9B,EAAOi9B,EAAKj9B,KAAKla,KAAI,SAAU8N,GACnC,OAAO7G,EAAQ6G,EAAK67C,EAAOkyE,MAE7B,OAAO,IAAI90B,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI6W,EAAMi9B,EAAK8vD,UAChD,GAAIxkD,EAAkBtL,GAC3B,OAAO,IAAIgyD,EAAgBliG,EAAQkwC,EAAK/kB,QAASu3B,EAAOkyE,IACnD,GAAIx5E,EAAelL,GAAO,CAC/B,IAAMj9B,EAAOi9B,EAAKj9B,KAAKla,KAAI,SAAU8N,GACnC,OAAO7G,EAAQ6G,EAAK67C,EAAOkyE,MAE7B,OAAO,IAAIrxB,EAAarzD,EAAK95C,KAAM6c,GAIrC,OAAOi9B,EAAKn3C,KAAI,SAAAymD,GAAK,OAAIx/C,EAAQw/C,EAAOkD,EAAOkyE,UC9EtCG,GAAsC3/H,GARtC,gBACQ,CACnB,QACA,WACA,QACA,iBAG6E,YAKzE,IAJJyX,EAII,EAJJA,MACA8oE,EAGI,EAHJA,SACAp+C,EAEI,EAFJA,MACAuoE,EACI,EADJA,aAyCA,OAAOvoE,EArDI,gBAqDQ,CACjB,iBAAkB,SAAUuf,EAAIC,GAC9B,OAAOthD,KAAKoX,EAAMiqC,GAAKjqC,EAAMkqC,GAAK,KAEpC,yBAA0B,SAAUD,EAAIC,EAAI18C,GAC1C,OAAO5E,KAAKoX,EAAMiqC,GAAKjqC,EAAMkqC,GAAK18C,IAEpC,eAAgB,SAAU26H,EAAIj+E,GAC5B,OAAOthD,KAAKu/H,EAAInoH,EAAMkqC,GAAK,KAE7B,uBAAwB,SAAUi+E,EAAIj+E,EAAI18C,GACxC,OAAO5E,KAAKu/H,EAAInoH,EAAMkqC,GAAK18C,IAE7B,eAAgB,SAAUy8C,EAAIm+E,GAC5B,OAAOx/H,KAAKoX,EAAMiqC,GAAKm+E,EAAI,KAE7B,uBAAwB,SAAUn+E,EAAIm+E,EAAI56H,GACxC,OAAO5E,KAAKoX,EAAMiqC,GAAKm+E,EAAI56H,IAE7B,aAAc,SAAU26H,EAAIC,GAC1B,OAAOx/H,KAAKu/H,EAAIC,EAAI,KAEtB,qBAAsB,SAAUD,EAAIC,EAAI56H,GACtC,IAAMujD,EAAO,IAAIkiD,EAAa,IAAK,WAAY,CAACk1B,EAAIC,IAC9CC,EAAav/C,EAAS/3B,EAAM,GAAIvjD,GACtC,OAAQ6gD,EAAeg6E,KAAiBA,EAAWp+H,YC9D5Cq+H,GAAmC//H,GAhBnC,aACQ,CACnB,QACA,SACA,QACA,WACA,QACA,SACA,UACA,eACA,eACA,eACA,kBACA,eAG0E,YAatE,IAZJmiC,EAYI,EAZJA,MACA7Q,EAWI,EAXJA,OACA7Z,EAUI,EAVJA,MACA8oE,EASI,EATJA,SACArb,EAQI,EARJA,MACAx9C,EAOI,EAPJA,OACA4qD,EAMI,EANJA,QACA82B,EAKI,EALJA,aACA+E,EAII,EAJJA,aACAzD,EAGI,EAHJA,aACAoC,EAEI,EAFJA,gBACAgB,EACI,EADJA,WAwCM8S,EAAaz+E,EAAM,aAAc,CACrC,2BAA4B,SAAUm8D,EAAM0hC,EAAU/6H,GACpD,IAAMg7H,EAAa,GACnBC,EAASD,EAAY3hC,EAAM0hC,EAASh/H,MACpC,IAAM4X,EAAMunH,EAAY7hC,EAAM2hC,GAC9B,OAAOh7H,EAAQs7E,SAAWA,EAAS3nE,GAAOA,GAE5C,mBAAoB,SAAU0lF,EAAM0hC,GAClC,OAAO3/H,KAAKi+F,EAAM0hC,EAAU,CAAEz/C,UAAU,KAG1C,qBAAsB,SAAU+d,EAAM0hC,GACpC,OAAO3/H,KAAKoX,EAAM6mF,GAAO0hC,IAE3B,6BAA8B,SAAU1hC,EAAM0hC,EAAU/6H,GACtD,OAAO5E,KAAKoX,EAAM6mF,GAAO0hC,EAAU/6H,IAGrC,iBAAkB,SAAUq5F,EAAM0hC,GAChC,OAAO3/H,KAAKoX,EAAM6mF,GAAO7mF,EAAMuoH,KAEjC,yBAA0B,SAAU1hC,EAAM0hC,EAAU/6H,GAClD,OAAO5E,KAAKoX,EAAM6mF,GAAO7mF,EAAMuoH,GAAW/6H,IAG5C,eAAgB,SAAUq5F,EAAM0hC,GAC9B,OAAO3/H,KAAKi+F,EAAM7mF,EAAMuoH,KAE1B,uBAAwB,SAAU1hC,EAAM0hC,EAAU/6H,GAChD,OAAO5E,KAAKi+F,EAAM7mF,EAAMuoH,GAAW/6H,MAkBvC27G,EAAWwf,WAAY,EAEvBxf,EAAWxhB,MAAQ,SAAUihC,GAC3B,OAAOC,EAAUr5H,MAAM,KAAMo5H,EAAMxiH,OAKrC,IAAMyiH,EAAYn+F,EAAM,YAAa,CACnC,mBAAoB,SAAUm8D,EAAM1wF,GAClC,OAAIk4C,EAAew4C,IAAgC,WAAvB93C,EAAO83C,EAAK58F,OAC/B4+H,EAAU7oH,EAAM6mF,EAAK58F,OAAOiB,WAAYiL,EAAEjL,WAAY,GAEtD29H,EAAUhiC,EAAK37F,WAAYiL,EAAEjL,WAAY,IAGpD,qBAAsB,SAAU27F,EAAM1wF,GACpC,GAAwB,WAApB44C,EAAO54C,EAAElM,OACX,OAAO4+H,EAAUhiC,EAAM7mF,EAAM7J,EAAElM,QAE/B,MAAM,IAAIuc,MAAM,kEAGpB,iCAAkC,SAAUqgF,EAAM1wF,EAAG+rE,GACnD,OAAO2mD,EAAUhiC,EAAK37F,WAAYiL,EAAE5M,KAAM24E,EAAMj4E,QAElD,yBAA0B,SAAU48F,EAAM1wF,EAAG+rE,GAO3C,OALc,IAAVA,EACE,aAAe/rE,EAAI,IAEnB,OAAS+rE,EAAQ,YAAc/rE,EAAI,KAAO+rE,EAAQ,MAE7C,UAAH,OAAa2kB,EAAb,eAmBN4hC,EAAW/9F,EAAM,WAAY,CACjC,+BAAgC,SAAU89F,EAAYnlF,GAEpD,OADAmlF,EAAWnlF,IAAQ,GACZ,GAGT,6BAA8B,SAAUmlF,EAAYnlF,EAAMylF,GAGxD,OAAIzlF,EAAK95C,OAASu/H,IAChBN,EAAWnlF,IAAQ,GACZ,IAKX,kCAAmC,SAAUmlF,EAAYnlF,EAAMylF,GAC7D,OAAOL,EAASD,EAAYnlF,EAAK/kB,QAASwqG,IAG5C,yCAA0C,SAAUN,EAAYnlF,EAAMylF,GACpE,OAAsC,IAAlCzlF,EAAKhY,OAAOvc,QAAQg6G,IACtBN,EAAWnlF,IAAQ,GACZ,GAEFolF,EAASD,EAAYnlF,EAAKwjD,KAAMiiC,IAGzC,8CAA+C,SAAUN,EAAYnlF,EAAMylF,GACzE,GAAIzlF,EAAKj9B,KAAK3Z,OAAS,EAAG,CAExB,IADA,IAAIs8H,EAAUN,EAASD,EAAYnlF,EAAKj9B,KAAK,GAAI0iH,GACxC9/H,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,SAAUzD,EACtC+/H,EAAUN,EAASD,EAAYnlF,EAAKj9B,KAAKpd,GAAI8/H,IAAYC,EAG3D,GAAIA,EAEF,OADAP,EAAWnlF,IAAQ,GACZ,EAGX,OAAO,KAWLqlF,EAAch+F,EAAM,cAAe,CACvC,uBAAwB,SAAU2Y,GAChC,OAAOquD,EAAmB,IAG5B,qBAAsB,SAAUruD,EAAMmlF,GACpC,YAAyB97H,IAArB87H,EAAWnlF,GACNquD,EAAmB,GAErBA,EAAmB,IAG5B,0BAA2B,SAAUruD,EAAMmlF,GACzC,OAAO,IAAInzB,EAAgBqzB,EAAYrlF,EAAK/kB,QAASkqG,KAGvD,iCAAkC,SAAUnlF,EAAMmlF,GAChD,YAAyB97H,IAArB87H,EAAWnlF,GACNquD,EAAmB,GAErBg3B,EAAYrlF,EAAKwjD,KAAM2hC,IAGhC,uBAAwB,SAAUnlF,EAAMmlF,GAKtC,GAJyB,IAArBnlF,EAAKj9B,KAAK3Z,QA4gBlB,SAAwB42C,GAEtB,IAAmB,QAAdA,EAAK95C,MAAgC,YAAd85C,EAAK95C,MAAoC,QAAd85C,EAAK95C,OAAwC,IAArB85C,EAAKj9B,KAAK3Z,OACvF,OAOF,IAAK,IAAIzD,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,SAAUzD,EACtCq6C,EAAKj9B,KAAKpd,GAAK0oG,EAAmB,GAIpC,MADAruD,EAAKsjD,UAAUD,WACT,IAAIlgF,MAAM,sCA1hBZwiH,CAAc3lF,QAGS32C,IAArB87H,EAAWnlF,GACb,OAAOquD,EAAmB,GAG5B,IACI5+D,EAKAm2F,EAsUA/1B,EAAIt1E,EA5UFiV,EAAOwQ,EAAKj9B,KAAK,GAGnB+K,GAAM,EACN+3G,GAAW,EAGf,OAAQ7lF,EAAK95C,MACX,IAAK,OAEH4nB,GAAM,EACN83G,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjDvB,EAAmB,GACnB,IAAIuB,EAAa,IAAK,MAAO,CAC3BpgE,EACA,IAAIogE,EAAa,IAAK,SAAU,CAC9BvB,EAAmB,GACnBA,EAAmB,SAIzB,MACF,IAAK,OACL,IAAK,UAEH,GAAyB,IAArBruD,EAAKj9B,KAAK3Z,OACZ0kB,GAAM,EACN83G,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjDvB,EAAmB,GACnB,IAAIgF,EAAa,OAAQ,CAAC7jE,WAEvB,GAAyB,IAArBwQ,EAAKj9B,KAAK3Z,OAUnB,OAFA+7H,EANA11F,EAAO,IAAImgE,EAAa,IAAK,SAAU,CACrCvB,EAAmB,GACnBruD,EAAKj9B,KAAK,MAIOoiH,EAAWnlF,EAAKj9B,KAAK,IAEjCsiH,EAAY,IAAIz1B,EAAa,IAAK,MAAO,CAACpgE,EAAMC,IAAQ01F,GAEjE,MACF,IAAK,QACH11F,EAAO4+D,EAAmB,IAE5B,IAAK,MACH,GAAK5+D,GAA6B,IAArBuQ,EAAKj9B,KAAK3Z,QAIhB,GAA0B,IAArB42C,EAAKj9B,KAAK3Z,QAAgBqmC,GACZ,IAArBuQ,EAAKj9B,KAAK3Z,aAA6CC,IAA7B87H,EAAWnlF,EAAKj9B,KAAK,IAElD6iH,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjDpgE,EAAKnY,QACL,IAAIg8E,EAAa,MAAO,CAAC5jE,GAAQuQ,EAAKj9B,KAAK,OAE7C+K,GAAM,OACD,GAAyB,IAArBkyB,EAAKj9B,KAAK3Z,OAEnB,OAAOi8H,EAAY,IAAIz1B,EAAa,IAAK,SAAU,CACjD,IAAIyD,EAAa,MAAO,CAAC7jE,IACzB,IAAI6jE,EAAa,MAAO,CAACrzD,EAAKj9B,KAAK,OACjCoiH,QAfJS,EAAiBp2F,EAAKnY,QACtBvJ,GAAM,EAgBR,MACF,IAAK,MAGH,OAFAq3G,EAAW11F,GAAQ01F,EAAWnlF,EAAKj9B,KAAK,IAEjCsiH,EAAY,IAAIz1B,EAAa,IAAK,MAAO,CAACpgE,EAAMwQ,EAAKj9B,KAAK,KAAMoiH,GACzE,IAAK,MAEHS,EAAiB,IAAIvyB,EAAa,MAAO,CAAC7jE,EAAKnY,UAC/C,MACF,IAAK,MAEHuuG,EAAiB,IAAIvyB,EAAa,MAAO,CAAC7jE,EAAKnY,UAC/C,MACF,IAAK,MAEHuuG,EAAiB,IAAIh2B,EAAa,IAAK,aAAc,CACnD,IAAIyD,EAAa,MAAO,CAAC7jE,EAAKnY,YAEhC,MACF,IAAK,MAEHuuG,EAAiB,IAAIh2B,EAAa,IAAK,MAAO,CAC5C,IAAIyD,EAAa,MAAO,CAAC7jE,EAAKnY,UAC9Bg3E,EAAmB,KAErB,MACF,IAAK,MAEHu3B,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjD5vD,EACA,IAAIqzD,EAAa,MAAO,CAAC7jE,EAAKnY,YAEhC,MACF,IAAK,MAEHwuG,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjD5vD,EACA,IAAIqzD,EAAa,MAAO,CAAC7jE,EAAKnY,YAEhC,MACF,IAAK,MAEHwuG,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,MAAO,CAC5C,IAAIyD,EAAa,MAAO,CAAC7jE,EAAKnY,UAC9Bg3E,EAAmB,KAErB,MACF,IAAK,OAEHvgF,GAAM,EACN83G,EAAiB,IAAIvyB,EAAa,OAAQ,CACxC,IAAIzD,EAAa,IAAK,WAAY,CAChCvB,EAAmB,GACnB,IAAIuB,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,SAIzB,MACF,IAAK,OAEHvgF,GAAM,EACN+3G,GAAW,EACXD,EAAiB,IAAIvyB,EAAa,OAAQ,CACxC,IAAIzD,EAAa,IAAK,WAAY,CAChCvB,EAAmB,GACnB,IAAIuB,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,SAIzB,MACF,IAAK,OAEHvgF,GAAM,EACN83G,EAAiB,IAAIh2B,EAAa,IAAK,MAAO,CAC5C,IAAIA,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,KAErBA,EAAmB,KAErB,MACF,IAAK,OAEHvgF,GAAM,EACN83G,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjD,IAAIyD,EAAa,MAAO,CAAC7jE,EAAKnY,UAC9B,IAAIg8E,EAAa,OAAQ,CACvB,IAAIzD,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,KAErBA,EAAmB,SAIzB,MACF,IAAK,OAEHvgF,GAAM,EACN+3G,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjD,IAAIyD,EAAa,MAAO,CAAC7jE,EAAKnY,UAC9B,IAAIg8E,EAAa,OAAQ,CACvB,IAAIzD,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,KAErBA,EAAmB,SAIzB,MACF,IAAK,OAEHvgF,GAAM,EACN+3G,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,MAAO,CAC5C,IAAIA,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,KAErBA,EAAmB,KAErB,MACF,IAAK,OAEHu3B,EAAiB,IAAIvyB,EAAa,OAAQ,CAAC7jE,EAAKnY,UAChD,MACF,IAAK,OAEHuuG,EAAiB,IAAIvyB,EAAa,OAAQ,CAAC7jE,EAAKnY,UAChD,MACF,IAAK,OAEHuuG,EAAiB,IAAIh2B,EAAa,IAAK,MAAO,CAC5C,IAAIyD,EAAa,OAAQ,CAAC7jE,EAAKnY,UAC/Bg3E,EAAmB,KAErB,MACF,IAAK,OAEHw3B,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjD5vD,EACA,IAAIqzD,EAAa,OAAQ,CAAC7jE,EAAKnY,YAEjC,MACF,IAAK,OAEHwuG,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjD5vD,EACA,IAAIqzD,EAAa,OAAQ,CAAC7jE,EAAKnY,YAEjC,MACF,IAAK,OAEHwuG,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,MAAO,CAC5C,IAAIyD,EAAa,OAAQ,CAAC7jE,EAAKnY,UAC/Bg3E,EAAmB,KAErB,MACF,IAAK,QAEHvgF,GAAM,EACN83G,EAAiB,IAAIvyB,EAAa,OAAQ,CACxC,IAAIzD,EAAa,IAAK,MAAO,CAC3B,IAAIA,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,KAErBA,EAAmB,OAGvB,MACF,IAAK,QAEHvgF,GAAM,EACN83G,EAAiB,IAAIvyB,EAAa,OAAQ,CACxC,IAAIzD,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,KAErBA,EAAmB,OAGvB,MACF,IAAK,QAEHvgF,GAAM,EACN83G,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjDvB,EAAmB,GACnB,IAAIuB,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,OAGvB,MACF,IAAK,QAEHvgF,GAAM,EACN+3G,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjDpgE,EAAKnY,QACL,IAAIg8E,EAAa,OAAQ,CACvB,IAAIzD,EAAa,IAAK,WAAY,CAChCvB,EAAmB,GACnB,IAAIuB,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,WAK3B,MACF,IAAK,QAEHvgF,GAAM,EACN+3G,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjD,IAAIyD,EAAa,MAAO,CAAC7jE,EAAKnY,UAC9B,IAAIg8E,EAAa,OAAQ,CACvB,IAAIzD,EAAa,IAAK,MAAO,CAC3B,IAAIA,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,KAErBA,EAAmB,SAIzB,MACF,IAAK,QAEHvgF,GAAM,EACN+3G,GAAW,EACXD,EAAiB,IAAIh2B,EAAa,IAAK,WAAY,CACjDvB,EAAmB,GACnB,IAAIuB,EAAa,IAAK,MAAO,CAC3BpgE,EAAKnY,QACLg3E,EAAmB,OAGvB,MACF,IAAK,MAEHu3B,EAAiB,IAAIh2B,EAAa,IAAK,SAAU,CAC/C,IAAIyD,EAAa,IAAIL,EAAW,OAAQ,CAACxjE,EAAKnY,UAC9CmY,EAAKnY,UAEP,MACF,IAAK,QACL,QAAS,MAAM,IAAIlU,MAAM,aAAe68B,EAAK95C,KAAO,8EAIlD4nB,GACF+hF,EAAK,IACLt1E,EAAO,WAEPs1E,EAAK,IACLt1E,EAAO,YAMT,IAAIurG,EAAkBT,EAAY71F,EAAM21F,GAIxC,OAHIU,IACFC,EAAkB,IAAIl2B,EAAa,IAAK,aAAc,CAACk2B,KAElD,IAAIl2B,EAAaC,EAAIt1E,EAAM,CAACurG,EAAiBF,KAGtD,uBAAwB,SAAU5lF,EAAMmlF,GACtC,QAAyB97H,IAArB87H,EAAWnlF,GACb,OAAOquD,EAAmB,GAG5B,GAAgB,MAAZruD,EAAK6vD,GAEP,OAAO,IAAID,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI8zC,EAAKj9B,KAAKla,KAAI,SAAU8N,GAChE,OAAO0uH,EAAY1uH,EAAKwuH,OAI5B,GAAgB,MAAZnlF,EAAK6vD,GAAY,CAEnB,GAAI7vD,EAAKoxD,UACP,OAAO,IAAIxB,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CACxCm5H,EAAYrlF,EAAKj9B,KAAK,GAAIoiH,KAK9B,GAAInlF,EAAK91B,WACP,OAAO,IAAI0lF,EAAa5vD,EAAK6vD,GAAI7vD,EAAK9zC,GAAI,CACxCm5H,EAAYrlF,EAAKj9B,KAAK,GAAIoiH,GAC1BE,EAAYrlF,EAAKj9B,KAAK,GAAIoiH,KAKhC,GAAgB,MAAZnlF,EAAK6vD,GAAY,CAEnB,IAAMk2B,EAAgB/lF,EAAKj9B,KAAK1D,QAAO,SAAU1I,GAC/C,YAA2BtN,IAApB87H,EAAWxuH,MAGpB,GAAIovH,EAAc38H,OAAS,EAAG,CAC5B,IAAM48H,EAAmBhmF,EAAKj9B,KAAK1D,QAAO,SAAU1I,GAClD,YAA2BtN,IAApB87H,EAAWxuH,MAGdsvH,EAA8C,IAA5BD,EAAiB58H,OACrC48H,EAAiB,GACjB,IAAIp2B,EAAa,IAAK,WAAYo2B,GAEhChE,EAAU+D,EAAcxvH,OAAO8uH,EAAYY,EAAiBd,IAElE,OAAO,IAAIv1B,EAAa,IAAK,WAAYoyB,GAI3C,OAAO,IAAIpyB,EAAa,IAAK,MAAO5vD,EAAKj9B,KAAKla,KAAI,SAAUq9H,GAC1D,OAAO,IAAIt2B,EAAa,IAAK,WAAY5vD,EAAKj9B,KAAKla,KAAI,SAAUs9H,GAC/D,OAAQA,IAAaD,EACjBb,EAAYc,EAAUhB,GACtBgB,EAAS9uG,gBAKnB,GAAgB,MAAZ2oB,EAAK6vD,IAAc7vD,EAAK91B,WAAY,CACtC,IAAMslB,EAAOwQ,EAAKj9B,KAAK,GACjB0sB,EAAOuQ,EAAKj9B,KAAK,GAGvB,YAAyB1Z,IAArB87H,EAAW11F,GACN,IAAImgE,EAAa,IAAK,SAAU,CAACy1B,EAAY71F,EAAM21F,GAAa11F,SAIhDpmC,IAArB87H,EAAW31F,GACN,IAAIogE,EAAa,IAAK,WAAY,CACvC,IAAIA,EAAa,IAAK,aAAc,CAACpgE,IACrC,IAAIogE,EAAa,IAAK,SAAU,CAC9By1B,EAAY51F,EAAM01F,GAClB,IAAIv1B,EAAa,IAAK,MAAO,CAACngE,EAAKpY,QAASg3E,EAAmB,SAM9D,IAAIuB,EAAa,IAAK,SAAU,CACrC,IAAIA,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,WAAY,CAACy1B,EAAY71F,EAAM21F,GAAa11F,EAAKpY,UACvE,IAAIu4E,EAAa,IAAK,WAAY,CAACpgE,EAAKnY,QAASguG,EAAY51F,EAAM01F,OAErE,IAAIv1B,EAAa,IAAK,MAAO,CAACngE,EAAKpY,QAASg3E,EAAmB,OAInE,GAAgB,MAAZruD,EAAK6vD,IAAc7vD,EAAK91B,WAAY,CACtC,IAAMslB,EAAOwQ,EAAKj9B,KAAK,GACjB0sB,EAAOuQ,EAAKj9B,KAAK,GAEvB,QAAyB1Z,IAArB87H,EAAW31F,GAEb,OAAIwb,EAAexb,KAAU5iB,EAAO4iB,EAAK5oC,QAAUwjE,EAAM56B,EAAK5oC,MAAO,IAC5DynG,EAAmB,GAIrB,IAAIuB,EAAa,IAAK,WAAY,CACvC5vD,EACA,IAAI4vD,EAAa,IAAK,WAAY,CAChC,IAAIyD,EAAa,MAAO,CAAC7jE,EAAKnY,UAC9BguG,EAAY51F,EAAKpY,QAAS8tG,OAKhC,QAAyB97H,IAArB87H,EAAW11F,GAAqB,CAClC,GAAIub,EAAevb,GAAO,CAExB,GAAI7iB,EAAO6iB,EAAK7oC,OACd,OAAOynG,EAAmB,GAG5B,GAAIjkC,EAAM36B,EAAK7oC,MAAO,GACpB,OAAOy+H,EAAY71F,EAAM21F,GAK7B,IAAMiB,EAAc,IAAIx2B,EAAa,IAAK,MAAO,CAC/CpgE,EAAKnY,QACL,IAAIu4E,EAAa,IAAK,WAAY,CAChCngE,EACA4+D,EAAmB,OAIvB,OAAO,IAAIuB,EAAa,IAAK,WAAY,CACvCngE,EAAKpY,QACL,IAAIu4E,EAAa,IAAK,WAAY,CAChCy1B,EAAY71F,EAAM21F,GAClBiB,MAMN,OAAO,IAAIx2B,EAAa,IAAK,WAAY,CACvC,IAAIA,EAAa,IAAK,MAAO,CAACpgE,EAAKnY,QAASoY,EAAKpY,UACjD,IAAIu4E,EAAa,IAAK,MAAO,CAC3B,IAAIA,EAAa,IAAK,WAAY,CAChCy1B,EAAY71F,EAAM21F,GAClB,IAAIv1B,EAAa,IAAK,SAAU,CAACngE,EAAKpY,QAASmY,EAAKnY,YAEtD,IAAIu4E,EAAa,IAAK,WAAY,CAChCy1B,EAAY51F,EAAM01F,GAClB,IAAI9xB,EAAa,MAAO,CAAC7jE,EAAKnY,gBAMtC,MAAM,IAAIlU,MAAM,aAAe68B,EAAK6vD,GAAK,iFAmC7C,SAASxB,EAAoBznG,EAAOy/H,GAClC,OAAO,IAAI/3B,EAAa92B,EAAQ5wE,EAAOy/H,GAAa7vG,EAAO5N,SAG7D,OAAOk9F,KC7vBIwgB,GAAoCphI,GA7BpC,cACQ,CACnB,SACA,QACA,QACA,SACA,MACA,WACA,WACA,SACA,MACA,QACA,eACA,WACA,aACA,YACA,oBACA,SACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,aACA,oBAG2E,YA0BvE,IAzBJsxB,EAyBI,EAzBJA,OACA6Q,EAwBI,EAxBJA,MAQA1qB,GAgBI,EAvBJytD,MAuBI,EAtBJx9C,OAsBI,EArBJpa,IAqBI,EApBJuhB,SAoBI,EAnBJ8hB,SAmBI,EAlBJpoB,OAkBI,EAjBJ7Q,IAiBI,EAhBJD,OACAupG,EAeI,EAfJA,aACAzgC,EAcI,EAdJA,SACAp3B,EAaI,EAbJA,SACAgkB,EAYI,EAZJA,UACA8wB,EAWI,EAXJA,kBACAvuC,EAUI,EAVJA,OACAkwC,EASI,EATJA,aACAK,EAQI,EARJA,UACAmJ,EAOI,EAPJA,aACA+E,EAMI,EANJA,aACAxE,EAKI,EALJA,UACAU,EAII,EAJJA,WACAK,EAGI,EAHJA,aACAoD,EAEI,EAFJA,WAGM0rB,GADF,EADJ1sB,gBAEyBysB,GAAuB,CAC9Cp3F,QACA7Q,SACA2sE,oBACAvuC,SACAvG,WACAgkB,YACAyyB,eACAK,YACAmJ,eACA+E,eACAxE,YACAU,aACAK,eACAoD,gBAwDF,OAAO3rE,EA9HI,cA8HQ,CACjBhlB,OAAQ,SAAUmhF,GAChB,OAAOj+F,KAAKoX,EAAM6mF,GAAO,IAAI,IAG/B,kBAAmB,SAAUA,EAAM+iC,GACjC,OAAOhhI,KAAKoX,EAAM6mF,GAAO,GAAI+iC,IAG/B,iBAAkB,SAAU/iC,EAAMhxC,GAChC,OAAOjtD,KAAKoX,EAAM6mF,GAAOhxC,GAAO,IAGlC,0BAA2B,SAAUgxC,EAAMhxC,EAAO+zE,GAChD,OAAOhhI,KAAKoX,EAAM6mF,GAAOhxC,EAAO+zE,IAGlCnjC,KAAM,SAAUI,GACd,OAAOj+F,KAAKi+F,EAAM,IAAI,IAGxB,gBAAiB,SAAUA,EAAM+iC,GAC/B,OAAOhhI,KAAKi+F,EAAM,GAAI+iC,IAGxB,eAAgB,SAAU/iC,EAAMhxC,GAC9B,OAAOjtD,KAAKi+F,EAAMhxC,GAAO,IAG3B,wBAAyB,SAAUgxC,EAAMhxC,EAAO+zE,GAC9C,IAAMC,EAqKV,WACE,IAAMC,EAAW,CAACvgB,EAChB,CAAEtgH,EAAG,MAAOa,EAAG,OACf,CAAEb,EAAG,OAAQa,EAAG,KAChBi4H,EACA,CAAE94H,EAAG,YAAaa,EAAG,QACrB,CAAEb,EAAG,WAAYa,EAAG,WACpB,CAAEb,EAAG,QAASa,EAAG,QACjB,CAAEb,EAAG,YAAaa,EAAG,aACrB,CAAEb,EAAG,MAAOa,EAAG,MAEXigI,EAAa,CACjB,CAAE9gI,EAAG,cAAea,EAAG,SACvB,CAAEb,EAAG,cAAea,EAAG,SACvB,CAAEb,EAAG,SAAUa,EAAG,SAClB,CAAEb,EAAG,QAASa,EAAG,YACjB,CAAEb,EAAG,aAAca,EAAG,mBACtB,CAAEb,EAAG,aAAca,EAAG,iBACtB,CAAEb,EAAG,cAAea,EAAG,aACvB,CAAEb,EAAG,WAAYa,EAAG,YACpB,CAAEb,EAAG,cAAea,EAAG,aACvB,CAAEb,EAAG,WAAYa,EAAG,YACpB,CAAEb,EAAG,MAAOa,EAAG,WACf,CAAEb,EAAG,OAAQa,EAAG,YAChB,CAAEb,EAAG,QAASa,EAAG,OACjB,CAAEb,EAAG,OAAQa,EAAG,QAChB,CAAEb,EAAG,OAAQa,EAAG,QAChB,CAAEb,EAAG,MAAOa,EAAG,OACf,CAAEb,EAAG,YAAaa,EAAG,WACrB,CAAEb,EAAG,WAAYa,EAAG,YACpB,CAAEb,EAAG,YAAaa,EAAG,WACrB,CAAEb,EAAG,WAAYa,EAAG,YACpB,CAAEb,EAAG,aAAca,EAAG,gBACtB,CAAEb,EAAG,YAAaa,EAAG,WACrB,CAAEb,EAAG,WAAYa,EAAG,aAOhBkgI,EAAc,CAClB,CAAE/gI,EAAG,eAAgBa,EAAG,gBACxB,CAAEb,EAAG,aAAca,EAAG,iBAElB+/H,EAAW,GAqCjB,OAhCAA,EAASI,WAAaH,EAASlwH,OAAOmwH,EAAYC,GAClDH,EAASK,cAfa,CACpB,CAAEjhI,EAAG,kBAAmBa,EAAG,6BAC3B,CAAEb,EAAG,eAAgBa,EAAG,qBACxB,CAAEb,EAAG,eAAgBa,EAAG,sBAa1B+/H,EAASM,YAAcH,EACvBH,EAASO,gBAAkBN,EAASlwH,OAAOmwH,GAM3CF,EAASQ,WAAa,CAAC9gB,EACrB,CAAEtgH,EAAG,OAAQa,EAAG,QAChB,CAAEb,EAAG,MAAOa,EAAG,OACfi4H,EACA,CAAE94H,EAAG,UAAWa,EAAG,aACnB,CAAEb,EAAG,SAAUa,EAAG,YAClB,CAAEb,EAAG,aAAca,EAAG,cACtB,CAAEb,EAAG,YAAaa,EAAG,aACrB,CAAEb,EAAG,UAAWa,EAAG,aACnB,CAAEb,EAAG,SAAUa,EAAG,YAClB,CAAEb,EAAG,UAAWa,EAAG,aACnB,CAAEb,EAAG,SAAUa,EAAG,YAClB,CAAEb,EAAG,UAAWa,EAAG,aACnB,CAAEb,EAAG,SAAUa,EAAG,YAClB,CAAEb,EAAG,aAAca,EAAG,aACtB,CAAEb,EAAG,YAAaa,EAAG,aACrB,CAAEb,EAAG,cAAea,EAAG,YACvB,CAAEb,EAAG,SAAUa,EAAG,QAClB,CAAEb,EAAG,SAAUa,EAAG,SAClB,CAAEb,EAAG,MAAOa,EAAG,OACf,CAAEb,EAAG,aAAca,EAAG,iBAGjB+/H,EAvPYS,GACXC,EAyFV,SAAqB1jC,EAAMhxC,EAAO20E,EAAU9G,GAC1C,IAAMsE,EAAY,GACZ3kF,EAAOylC,EAAS+d,EAAM68B,EAAO7tE,EAAO,CAAE0tE,gBAAgB,IAGtDkH,EAAO,QAFbD,IAAaA,GAEoB,IAAM,KAwBvC,SAASE,EAASrnF,GAChB,IAAMsnF,EAAKtnF,EAAK3tC,KAChB,GAAW,iBAAPi1H,EAEF,MAAM,IAAInkH,MAAM,sCACX,GAAW,iBAAPmkH,EACT,GAAgB,MAAZtnF,EAAK6vD,GAAY,CAEnB,GAA0B,iBAAtB7vD,EAAKj9B,KAAK,GAAG1Q,OAA4B0d,EAAUrT,WAAWsjC,EAAKj9B,KAAK,GAAGnc,QAC7E,MAAM,IAAIuc,MAAM,mCAEhBkkH,EAAQrnF,EAAKj9B,KAAK,QAEf,CACL,IAA+B,IAA3BqkH,EAAK37G,QAAQu0B,EAAK6vD,IACpB,MAAM,IAAI1sF,MAAM,YAAc68B,EAAK6vD,GAAK,qCAE1C,IAAK,IAAIlqG,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,OAAQzD,IACpC0hI,EAAQrnF,EAAKj9B,KAAKpd,SAGjB,GAAW,eAAP2hI,EAAqB,CAC9B,IAAMphI,EAAO85C,EAAK95C,MAEL,IADDy+H,EAAUl5G,QAAQvlB,IAG5By+H,EAAU3jH,KAAK9a,QAEZ,GAAW,oBAAPohI,EACTD,EAAQrnF,EAAK/kB,cACR,GAAW,iBAAPqsG,EACT,MAAM,IAAInkH,MAAM,QAAUmkH,EAAK,4CAtDnCD,CAAQrnF,GACR,IAAMunF,EAAU,GAGhB,OAFAA,EAAQ9yB,WAAaz0D,EACrBunF,EAAQ5C,UAAYA,EACb4C,EAnGWC,CAAWhkC,EAAMhxC,GAAO,EAAMg0E,EAASI,YACjDa,EAAQP,EAAQvC,UAAUv7H,OAC1Bs+H,EAAmB,CAAExH,gBAAgB,GACrCyH,EAAqB,CAAEzH,gBAAgB,GAG7C,GAFA18B,EAAO0jC,EAAQzyB,WAEXgzB,GAAS,EAAG,CAEd,IAAIG,EACAvH,EAFJ78B,EAkQN,SAASqkC,EAAa7nF,EAAMluC,EAAQg2H,GAClC,IAAMR,EAAKtnF,EAAK3tC,KACV01H,EAAY5+H,UAAUC,OAAS,EAErC,GAAW,iBAAPk+H,GAAyBtnF,EAAK91B,WAAY,CAC5C,IACI2yB,EADAmrF,GAAO,EAWX,GATgB,MAAZhoF,EAAK6vD,KACoB,oBAAtB7vD,EAAKj9B,KAAK,GAAG1Q,MACQ,iBAAtB2tC,EAAKj9B,KAAK,GAAG1Q,MACU,iBAAtB2tC,EAAKj9B,KAAK,GAAG1Q,OAChBwqC,EAAMngC,WAAWsjC,EAAKj9B,KAAK,GAAGnc,OAC9BohI,EAAQnrF,GAAO,GAAK9sB,EAAU8sB,KAI9BmrF,EAAM,CAMR,GAAInrF,EAAM,EAAG,CAQX,IAAMorF,EAAWjoF,EAAKj9B,KAAK,GACrBmlH,EAAW,IAAIt4B,EAAa,IAAK,MAAO,CAAC5vD,EAAKj9B,KAAK,GAAGkhF,YAAa,IAAIqK,EAAazxD,EAAM,KAChGmD,EAAO,IAAI4vD,EAAa,IAAK,WAAY,CAACq4B,EAAUC,SAOpDloF,EAAO,IAAI4vD,EAAa,IAAK,WAAY,CAAC5vD,EAAKj9B,KAAK,GAAIi9B,EAAKj9B,KAAK,GAAGkhF,cAGnE8jC,IAEgB,YAAdD,EAA2Bh2H,EAAOmpB,QAAU+kB,EAAcluC,EAAOiR,KAAK+kH,GAAa9nF,IAK7F,GAAW,oBAAPsnF,EAEFO,EAAY7nF,EAAK/kB,QAAS+kB,EAAM,gBAC3B,GAAW,iBAAPsnF,GAAgC,eAAPA,EAClC,IAAK,IAAI3hI,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,OAAQzD,IACpCkiI,EAAY7nF,EAAKj9B,KAAKpd,GAAIq6C,EAAMr6C,GAIpC,IAAKoiI,EAEH,OAAO/nF,EA9TE6nF,CAAYrkC,GAGnB,IAII97F,EAJAygI,GAAY,EACZC,GAAW,EAIf,IAFA5kC,EAAO/d,EAAS+d,EAAMgjC,EAASI,WAAY,GAAIc,GAK7CrH,EAAQ8H,EAAY3B,EAASK,cAAgBL,EAASM,YAEtDqB,GAAaA,GAEbzgI,GAHA87F,EAAO/d,EAAS+d,EAAM68B,EAAO,GAAIsH,IAGxB9/H,cACC+/H,GAIVQ,GAAW,EACXR,EAAUlgI,EAGR0gI,IACF5kC,EAAO/d,EAAS+d,EAAMgjC,EAASO,gBAAiB,GAAIW,IAGtDlkC,EAAO/d,EAAS+d,EAAMgjC,EAASQ,WAAY,GAAIU,GAGjD,IAAMj7E,EAAe,GACf47E,EAAiB,GAsBvB,MApBkB,iBAAd7kC,EAAKnxF,MAA2BmxF,EAAKt5E,YAA0B,MAAZs5E,EAAKqM,IAC5C,IAAV43B,IACFjkC,EAAKzgF,KAAK,GAAKulH,EAAgB9kC,EAAKzgF,KAAK,GAAI0pC,GAC7C+2C,EAAKzgF,KAAK,GAAKulH,EAAgB9kC,EAAKzgF,KAAK,KAEvCwjH,IACF8B,EAAezyG,UAAY4tE,EAAKzgF,KAAK,GACrCslH,EAAe33G,YAAc8yE,EAAKzgF,KAAK,MAG3B,IAAV0kH,IACFjkC,EAAO8kC,EAAgB9kC,EAAM/2C,IAE3B85E,IACF8B,EAAezyG,UAAY4tE,EAC3B6kC,EAAe33G,YAAc,OAK5B61G,GACL8B,EAAe57E,aAAeA,EAC9B47E,EAAe1D,UAAYuC,EAAQvC,UACnC0D,EAAe5zB,WAAajR,EACrB6kC,GAJe7kC,KAmS1B,SAAS8kC,EAAiBtoF,EAAMyM,QACTpjD,IAAjBojD,IAA8BA,EAAe,IAEjDA,EAAa,GAAK,EAClB,IAAMrmD,EAAI,CACVA,IAAQ,EACRA,KAAS,IAITA,KAAS,IAELmiI,EAAU,EACVC,EAAU,IA2Cd,SAASC,EAAUzoF,EAAM0oF,EAAOtiI,GAC9B,IAAMkhI,EAAKtnF,EAAK3tC,KAChB,GAAW,iBAAPi1H,EAGF,MAAM,IAAInkH,MAAM,sCACX,GAAW,iBAAPmkH,EAAuB,CAEhC,IAAiC,IAA7B,OAAO77G,QAAQu0B,EAAK6vD,IAAY,MAAM,IAAI1sF,MAAM,YAAc68B,EAAK6vD,GAAK,YAE5E,GAAc,OAAV64B,EAAgB,CAElB,IAAiB,eAAZ1oF,EAAK9zC,IAAmC,QAAZ8zC,EAAK9zC,KAA8B,QAAbw8H,EAAMx8H,IAC1B,aAAbw8H,EAAMx8H,IAAkC,aAAbw8H,EAAMx8H,GAAqB,MAAM,IAAIiX,MAAM,WAAa68B,EAAK6vD,GAAK,YAGnH,IAAiB,aAAZ7vD,EAAK9zC,IAAiC,QAAZ8zC,EAAK9zC,IAA4B,aAAZ8zC,EAAK9zC,KACxC,QAAbw8H,EAAMx8H,IAA6B,aAAbw8H,EAAMx8H,GAAqB,MAAM,IAAIiX,MAAM,WAAa68B,EAAK6vD,GAAK,YAG5F,IAAiB,aAAZ7vD,EAAK9zC,IAAiC,QAAZ8zC,EAAK9zC,IACtB,eAAZ8zC,EAAK9zC,KAAoC,IAAZ9F,EAAEuiI,MAAe,MAAM,IAAIxlH,MAAM,WAAa68B,EAAK6vD,GAAK,YAIzE,MAAZ7vD,EAAK6vD,IAA0B,MAAZ7vD,EAAK6vD,KAC1BzpG,EAAEwiI,KAAO5oF,EAAK6vD,IAGhB,IAAK,IAAIlqG,EAAI,EAAGA,EAAIq6C,EAAKj9B,KAAK3Z,OAAQzD,IAEpB,eAAZq6C,EAAK9zC,KAAqB9F,EAAEghI,KAAO,KACvB,MAAZpnF,EAAK6vD,IAA0B,aAAZ7vD,EAAK9zC,KAC1B9F,EAAEwiI,KAAO,GACTxiI,EAAEyiI,IAAM,EACRziI,EAAEghI,KAAc,IAANzhI,EAAU,IAAMq6C,EAAK6vD,IAEjCzpG,EAAEuiI,MAAQhjI,EACV8iI,EAASzoF,EAAKj9B,KAAKpd,GAAIq6C,EAAM55C,QAE1B,GAAW,eAAPkhI,EAAqB,CAC9B,GAAItnF,EAAK95C,OAASsiI,GAAuB,KAAZA,EAAkB,MAAM,IAAIrlH,MAAM,mCAE/D,GADAqlH,EAAUxoF,EAAK95C,KACD,OAAVwiI,EAEF,YADAj8E,EAAa,GAAK,GAKpB,GAAiB,MAAbi8E,EAAM74B,IAA0B,IAAZzpG,EAAEuiI,MAAe,MAAM,IAAIxlH,MAAM,uDAGzD,GAAiB,MAAbulH,EAAM74B,IAA0B,IAAZzpG,EAAEuiI,MAAe,MAAM,IAAIxlH,MAAM,2DAG1C,KAAX/c,EAAEwiI,MAA0B,MAAXxiI,EAAEwiI,OACjBL,EAAU,IAAG97E,EAAa,GAAK,GACnCA,EAAa,IAAMrmD,EAAEyiI,KAAkB,MAAXziI,EAAEghI,KAAe,GAAK,GAClDmB,EAAUvgI,KAAK0N,IAAI,EAAG6yH,QAEnB,IAAW,iBAAPjB,EAsBF,MAAM,IAAInkH,MAAM,QAAUmkH,EAAK,mBArBtC,IAAMwB,EAAQpsH,WAAWsjC,EAAKp5C,OAC9B,GAAc,OAAV8hI,EAEF,YADAj8E,EAAa,GAAKq8E,GAGpB,GAAiB,MAAbJ,EAAM74B,GAAY,CAEpB,GAAgB,IAAZzpG,EAAEuiI,MAAa,MAAM,IAAIxlH,MAAM,8BAEnC,IAAK4M,EAAU+4G,IAAUA,GAAS,EAAK,MAAM,IAAI3lH,MAAM,uCAEvD,IAAK,IAAIxd,EAAI4iI,EAAU,EAAG5iI,EAAImjI,EAAOnjI,IAAK8mD,EAAa9mD,GAAK,EAI5D,OAHImjI,EAAQP,IAAS97E,EAAaq8E,GAAS,GAC3Cr8E,EAAaq8E,IAAU1iI,EAAEyiI,KAAkB,MAAXziI,EAAEghI,KAAe,GAAK,QACtDmB,EAAUvgI,KAAK0N,IAAIozH,EAAOP,IAG5BniI,EAAEyiI,IAAMC,EAGO,KAAX1iI,EAAEwiI,OAAen8E,EAAa,IAAMrmD,EAAEyiI,KAAkB,MAAXziI,EAAEghI,KAAe,GAAK,KA1H3EqB,CAASzoF,EAAM,KAAM55C,GAKrB,IAHA,IACI2iI,EADAhvH,GAAQ,EAGHpU,EAJT4iI,EAAU97E,EAAarjD,OAAS,EAIVzD,GAAK,EAAGA,IAC5B,GAAwB,IAApB8mD,EAAa9mD,GAAjB,CACA,IAAImtB,EAAK,IAAIw7E,EACXv0F,EAAQ0yC,EAAa9mD,GAAKqC,KAAK2T,IAAI8wC,EAAa9mD,KAC5CkqG,EAAKpjD,EAAa9mD,GAAK,EAAI,IAAM,IAEvC,GAAIA,EAAI,EAAG,CACT,IAAI46D,EAAK,IAAIyyC,EAAWw1B,GACxB,GAAI7iI,EAAI,EAAG,CACT,IAAMqjI,EAAK,IAAI16B,EAAa3oG,GAC5B46D,EAAK,IAAIqvC,EAAa,IAAK,MAAO,CAACrvC,EAAIyoE,IAEFl2G,GAAd,IAArB25B,EAAa9mD,IAAaoU,EAAc,IAAI61F,EAAa,IAAK,aAAc,CAACrvC,IAA8C,IAA9Bv4D,KAAK2T,IAAI8wC,EAAa9mD,IAAkB46D,EAAiB,IAAIqvC,EAAa,IAAK,WAAY,CAAC98E,EAAIytC,IAGtLwoE,EAAThvH,EAAc+Y,EAAqB,MAAP+8E,EAAmB,IAAID,EAAa,IAAK,MAAO,CAACm5B,EAAIj2G,IAAmB,IAAI88E,EAAa,IAAK,WAAY,CAACm5B,EAAIj2G,IAE/I/Y,GAAQ,EAGV,OAAIA,EAAgB,IAAIu0F,EAAa,GAAmBy6B,MCliB/CE,GAAgC/jI,GALhC,UACQ,CACnB,YAGuE,YAAiB,IAAdo9G,EAAc,EAAdA,QAO1E,OAAO,SAAkBp7G,EAAKN,GAC5B,IAAM8B,EAAc45G,EAAQ17G,GAASA,EAAMmuD,QAE3C,OAAIrsD,GAA+C,mBAAzBA,EAAYssD,SAC7BtsD,EAAYssD,SAASpuD,GAGvBA,MChBEsiI,GAAiChkI,GAHjC,WACQ,IAEqD,WAaxE,OAAO,SAAmBgC,EAAKN,GAE7B,MAAqB,iBAAVA,GAAwBsV,SAAStV,KAAU6V,MAAM7V,GAOrDA,EANE,CACLmuD,OAAQ,SACRnuD,MAAO+I,OAAO/I,QCtBT2vB,GAAKvuB,KAAKoV,GACV2tF,GAAM,EAAI/iG,KAAKoV,GACf4K,GAAIhgB,KAAK6O,ECOTsyH,GAA6BjkI,GAAQ,OAAQ,IAAI,kBAAM,KACvDkkI,GAA8BlkI,GAAQ,QAAS,IAAI,kBAAM,KACzDmkI,GAA6BnkI,GAAQ,OAAQ,IAAI,kBAAM,QAEvDokI,GAAiCC,GAC5C,WACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAU52C,KACdA,OAGO8rH,GAA4BD,GACvC,MACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAUj6C,KACdA,OAGO2/E,GAA2BuvC,GACtC,KACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/Bk5D,GAAkBxtB,GAClB/9B,MAGOkzG,GAA4BF,GACvC,MACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/Bm5D,GAAmBztB,GACnBy2C,MAGO2+B,GAA0BH,GACrC,IACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/Bg5D,GAAiBttB,GACjBtsC,MAIO2hH,GAA4BJ,GACvC,MACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/Bi5D,GAAmBvtB,GDvDN,qBC2DNs1E,GAA4BL,GACvC,MACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAU,GAAGhlC,KACjBtnB,KAAK8T,OAGE+tH,GAA6BN,GACxC,OACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAU,IAAIhlC,KAClBtnB,KAAKmhB,QAGE2gH,GAA8BP,GACzC,QACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAU,GAAGxmC,IAAI,IAAIwmC,EAAU,GAAGhlC,MACtCtnB,KAAK06G,SAGEqnB,GAA+BR,GAC1C,SACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAU,GAAGxmC,IAAI,IAAIwmC,EAAU,IAAIhlC,MACvCtnB,KAAKg2C,UAGEgsF,GAAgCT,GAC3C,UACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAU,OAAOr3C,OACrBjV,KAAK26G,WAGEsnB,GAA8BV,GACzC,QACA,CAAC,SAAU,eACX,gBAAG/yG,EAAH,EAAGA,OAAQ89B,EAAX,EAAWA,UAAX,MAA8C,cAAlB99B,EAAO5N,OAC/B,IAAI0rC,EAAU,GAAGr3C,OACjBjV,KAAK46G,SAGEsnB,GAA0BX,GACrC,IACA,CAAC,YACD,qBAAGxtH,QAAsBm9C,KAIdixE,GAAoCjlI,GAAQ,KAAM,CAAC,OAAO,qBAAGqxB,MAC7D6zG,GAAmCllI,GAAQ,IAAK,CAAC,MAAM,qBAAG8iB,KAE1DqiH,GAAgCnlI,GAAQ,UAAW,IAAI,iBCzH7C,YD6HvB,SAASqkI,GAAiBrjI,EAAMosD,EAAcrrD,GAC5C,OAAO/B,GAAQgB,EAAMosD,EAAcrrD,EAAQ,CACzCqjI,wBAAwB,IE1HrB,IAAMC,GAAqCC,GAAY,eAAgB,YAAa,UAC9EC,GAA4CD,GAAY,sBAAuB,cAAe,kBAC9FE,GAAuCF,GAAY,iBAAkB,iBAAkB,OACvFG,GAA8CH,GAAY,wBAAyB,yBAA0B,OAG7GI,GAAyCJ,GAAY,mBAAoB,mBAAoB,UAC7FK,GAAyCL,GAAY,mBAAoB,mBAAoB,UAC7FM,GAAwCN,GAAY,kBAAmB,gBAAiB,OACxFO,GAAgCP,GAAY,UAAW,sBAAuB,cAC9EQ,GAAyCR,GAAY,mBAAoB,kBAAmB,KAC5FS,GAAqCT,GAAY,eAAgB,mBAAoB,UACrFU,GAA2CV,GAAY,qBAAsB,uBAAwB,KACrGW,GAAkDX,GAAY,4BAA6B,qBAAsB,OACjHY,GAA4CZ,GAAY,sBAAuB,yBAA0B,MACzGa,GAAwCb,GAAY,kBAAmB,mBAAoB,UAC3Fc,GAAiCd,GAAY,WAAY,qBAAsB,OAI/Ee,GAAmCf,GAAY,aAAc,oBAAqB,KAClFgB,GAAgDhB,GAAY,0BAA2B,mBAAoB,KAC3GiB,GAAqCjB,GAAY,eAAgB,mBAAoB,MACrFkB,GAAsClB,GAAY,gBAAiB,eAAgB,UACnFmB,GAAsBC,GAAc,gBAAiB,gBACrDC,GAAsCrB,GAAY,gBAAiB,sBAAuB,KAC1FsB,GAAmCtB,GAAY,aAAc,oBAAqB,MAClFuB,GAAqCvB,GAAY,eAAgB,mBAAoB,MACrFwB,GAAoCxB,GAAY,cAAe,mBAAoB,MACnFyB,GAA6CzB,GAAY,uBAAwB,kBAAmB,YACpG0B,GAAgC1B,GAAY,UAAW,kBAAmB,QAC1E2B,GAA4C3B,GAAY,sBAAuB,mBAAoB,OACnG4B,GAAwBR,GAAc,kBAAmB,OACzDS,GAAqBT,GAAc,eAAgB,MAGnDU,GAAmC9B,GAAY,aAAc,oBAAqB,MAClF+B,GAAiC/B,GAAY,WAAY,gBAAiB,UAC1EgC,GAAkChC,GAAY,YAAa,eAAgB,UAC3EiC,GAAgCjC,GAAY,UAAW,oBAAqB,YAC5EkC,GAAuClC,GAAY,iBAAkB,yBAA0B,SAE/FmC,GAAkCnC,GAAY,YAAa,uBAAwB,QACnFoC,GAAoCpC,GAAY,cAAe,mBAAoB,iBACnFqC,GAA4CrC,GAAY,sBAAuB,wBAAyB,cACxGsC,GAAoCtC,GAAY,cAAe,uBAAwB,cACvFuC,GAAsBnB,GAAc,iBAAkB,eACtDoB,GAAwCxC,GAAY,kBAAmB,uBAAwB,OAC/FyC,GAAwCzC,GAAY,kBAAmB,sBAAuB,eAC9F0C,GAAyC1C,GAAY,mBAAoB,iBAAkB,OAG3F2C,GAAkC3C,GAAY,YAAa,mBAAoB,aAC/E4C,GAAqC5C,GAAY,eAAgB,mBAAoB,aACrF6C,GAAgC7C,GAAY,UAAW,UAAW,UAIlE8C,GAAqC9C,GAAY,eAAgB,eAAgB,KACjF+C,GAAmC/C,GAAY,aAAc,cAAe,MAC5EgD,GAAmChD,GAAY,aAAc,eAAgB,KAC7EiD,GAAqCjD,GAAY,eAAgB,oBAAqB,KACtFkD,GAA0ClD,GAAY,oBAAqB,eAAgB,KAIxG,SAASA,GAAatkI,EAAM6nD,EAAU24B,GAGpC,OAAOxhF,GAAQgB,EAFM,CAAC,SAAU,OAAQ,cAEL,YAAiC,IAA9BswB,EAA8B,EAA9BA,OAAQokC,EAAsB,EAAtBA,KAAMtG,EAAgB,EAAhBA,UAQ5CwK,EAAO,IAAIlE,EAJe,cAAlBpkC,EAAO5N,OACjB,IAAI0rC,EAAUvG,GACdrxC,WAAWqxC,GAEc24B,GAE7B,OADA5nB,EAAKwD,WAAY,EACVxD,KAMX,SAAS8sE,GAAe1lI,EAAMU,GAG5B,OAAO1B,GAAQgB,EAFM,CAAC,SAAU,cAEG,YAA2B,IAAxBswB,EAAwB,EAAxBA,OAAQ89B,EAAgB,EAAhBA,UAC5C,MAAyB,cAAlB99B,EAAO5N,OACV,IAAI0rC,EAAU1tD,GACdA,KC3FR,IAUa+mI,GAAuCzoI,GAVvC,QACQ,CAAC,QAAS,cASiD,YAA0B,IAAvBmiC,EAAuB,EAAvBA,MAAOtX,EAAgB,EAAhBA,UAClF5jB,EAAQg2D,GAAY,CAAE96B,QAAOtX,cAGnC,OAAOsX,EAAM,QAAS,CACpB,SAAU,SAAUtkB,GAElB,IAAMqsC,EAAMrsC,EAAK,GAEbwmC,EAAS6F,GACXrsC,EAAK,GAAKqsC,EAAM,EACP5F,EAAY4F,KACrBrsC,EAAK,GAAKqsC,EAAI5yC,MAAM,IAGtB,IACE,OAAOrQ,EAAMA,MAAM,KAAM4W,GACzB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICtBbC,GAAwC3oI,GAVxC,SACQ,CAAC,QAAS,QAAS,SAAU,UAS+B,YAAqC,IAAlCmiC,EAAkC,EAAlCA,MAAOgnC,EAA2B,EAA3BA,MAAOzZ,EAAoB,EAApBA,OAAQqC,EAAY,EAAZA,MAClGsX,EAASH,GAAa,CAAE/mC,QAAOgnC,QAAOzZ,SAAQqC,UAGpD,OAAO5vB,EAAM,SAAU,CACrB,SAAU,SAAUtkB,GAElB,IAAMmE,EAAYnE,EAAK3Z,OAAS,EAC1B6/B,EAAOlmB,EAAKmE,GACdqiC,EAAStgB,KACXlmB,EAAKmE,GAAa+hB,EAAO,GAG3B,IACE,OAAOslC,EAAOpiE,MAAM,KAAM4W,GAC1B,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICxBnB,SAASE,GAAyBr5B,EAAYhtD,EAAM+K,GAEzD,IAAM9wC,EAAS+yF,EAAWp1F,QAAO,SAAU2gC,GACzC,OAAOwL,EAAaxL,MACdA,EAAK95C,QAAQuhD,KACb+K,EAAM/tC,IAAIu7B,EAAK95C,SACpB,GAEH,IAAKwb,EACH,MAAM,IAAIyB,MAAM,qDAAuDsxF,EAAa,KAItF,IAAMvuG,EAAOwb,EAAOxb,KACd6nI,EAAW76B,GAAe1gD,GAC1B9kC,EAAK+mF,EAAWnR,UACtB,OAAO,SAA2BxwF,GAEhC,OADAi7H,EAASvgI,IAAItH,EAAM4M,GACZ4a,EAAG21E,SAAS0qC,ICvBvB,IAGaC,GAAwC9oI,GAHxC,SACQ,CAAC,UAE2D,YAAe,IAAZmiC,EAAY,EAAZA,MAQlF,SAAS4mG,EAAiBlrH,EAAM0kC,EAAM+K,GACpC,IAAI1/C,EAAGi9B,EAgBP,OAdIhtB,EAAK,KACPjQ,EAAIiQ,EAAK,GAAGugF,UAAUD,SAAS7wC,IAG7BzvC,EAAK,KAGLgtB,EAFEyb,EAAazoC,EAAK,KAAOkoC,EAAyBloC,EAAK,IAE9CA,EAAK,GAAGugF,UAAUD,SAAS7wC,GAG3Bs7E,GAAwB/qH,EAAK,GAAI0kC,EAAM+K,IAI/CnzC,EAAOvM,EAAGi9B,GAEnBk+F,EAAgBz6B,SAAU,EAG1B,IAAMn0F,EAASgoB,EAAM,SAAU,CAC7B,kBAAmB6mG,GAEnB,mBAAoB,SAAUp7H,EAAGlD,GAC/B,OAAOkD,EAAE7L,OAAOinI,GAAQp7H,EAAEojD,UAAWtmD,KAGvC,gBAAiBwhD,GAEjB,iBAAkB,SAAUt+C,EAAGlD,GAC7B,OAAOkD,EAAE7L,OAAOmqD,GAAat+C,EAAEojD,UAAWtmD,OAI9C,OAAOq+H,IACN,CAAEL,qBAAqB,IAY1B,SAASM,GAASp7H,EAAGi9B,GAEnB,IAAMhtB,EAAOmtD,GAAiBngC,GAE9B,OAAO1wB,GAAOvM,GAAG,SAAUlM,EAAOuM,EAAOmD,GAEvC,OAAa,IAATyM,EACKgtB,EAASnpC,GACE,IAATmc,EACFgtB,EAASnpC,EAAO,CAACuM,EAAQ,IAEzB48B,EAASnpC,EAAO,CAACuM,EAAQ,GAAImD,MCvE1C,IAGa63H,GAAyCjpI,GAHzC,UACQ,CAAC,UAE4D,YAAe,IAAZmiC,EAAY,EAAZA,MAOnF,SAAS+mG,EAAkBrrH,EAAM0kC,EAAM+K,GACrC,IAAI1/C,EAAGi9B,EAgBP,OAdIhtB,EAAK,KACPjQ,EAAIiQ,EAAK,GAAGugF,UAAUD,SAAS7wC,IAG7BzvC,EAAK,KAGLgtB,EAFEyb,EAAazoC,EAAK,KAAOkoC,EAAyBloC,EAAK,IAE9CA,EAAK,GAAGugF,UAAUD,SAAS7wC,GAG3Bs7E,GAAwB/qH,EAAK,GAAI0kC,EAAM+K,IAI/Cge,EAAS19D,EAAGi9B,GAErBq+F,EAAiB56B,SAAU,EAG3B,IAAMhjC,EAAWnpC,EAAM,UAAW,CAChC,2BAA4B,SAAU/wB,EAAOy5B,GAE3C,IAAMhtB,EAAOmtD,GAAiBngC,IAEd,SAAVkoB,EAAoBrxD,EAAOuM,GAC3BsC,MAAMP,QAAQtO,GAChB4C,GAAQ5C,GAAO,SAAU0oD,EAAO3pD,GAE9BsyD,EAAQ3I,EAAOn8C,EAAMoD,OAAO5Q,EAAI,OAIrB,IAATod,EACFgtB,EAASnpC,GACS,IAATmc,EACTgtB,EAASnpC,EAAOuM,GAEhB48B,EAASnpC,EAAOuM,EAAOmD,GAI7B2hD,CAAQ3hD,EAAM2M,UAAW,OAI7B,OAAOmrH,IACN,CAAER,qBAAqB,IC3DbS,GAAuCnpI,GAHvC,QACQ,CAAC,UAE0D,YAAe,IAAZmpE,EAAY,EAAZA,MAOjF,OAAO,WAEL,IADA,IAAMtrD,EAAO,GACJpd,EAAI,EAAGgnC,EAAKxjC,UAAUC,OAAQzD,EAAIgnC,EAAIhnC,IAAK,CAClD,IAAIgR,EAAMxN,UAAUxD,GAGpB,GAAIskD,EAAQtzC,GACVA,EAAIf,QACJe,EAAId,KAAQc,EAAIqvB,KAAO,EAAI,EAAI,OAC1B,GAAIrvB,IAAqB,IAAdA,EAAI23H,MACpB33H,EAAMA,EAAI9N,KAAI,SAAUmb,GAAK,OAAOA,EAAI,UACnC,GAAI9O,EAAQyB,IAAQkzC,EAASlzC,GAClCA,EAAMA,EAAI9N,KAAI,SAAUmb,GAAK,OAAOA,EAAI,UACnC,GAAIulC,EAAS5yC,GAClBA,SACK,GAAI6yC,EAAY7yC,GACrBA,EAAMA,EAAImD,WAAa,OAClB,GAAmB,iBAARnD,EAGhB,MAAM,IAAI9H,UAAU,gEAGtBkU,EAAKpd,GAAKgR,EAGZ,IAAMmH,EAAM,IAAIuwD,EAEhB,OADAA,EAAMliE,MAAM2R,EAAKiF,GACVjF,KAER,CAAE8vH,qBAAqB,IClCbW,GAAqCrpI,GAHrC,MACQ,CAAC,UAEwD,YAAe,IAAZmiC,EAAY,EAAZA,MAO/E,SAASmnG,EAAczrH,EAAM0kC,EAAM+K,GACjC,IAAI1/C,EAAGi9B,EAgBP,OAdIhtB,EAAK,KACPjQ,EAAIiQ,EAAK,GAAGugF,UAAUD,SAAS7wC,IAG7BzvC,EAAK,KAGLgtB,EAFEyb,EAAazoC,EAAK,KAAOkoC,EAAyBloC,EAAK,IAE9CA,EAAK,GAAGugF,UAAUD,SAAS7wC,GAG3Bs7E,GAAwB/qH,EAAK,GAAI0kC,EAAM+K,IAI/C3pD,EAAIiK,EAAGi9B,GAEhBy+F,EAAah7B,SAAU,EAGvB,IAAM3qG,EAAMw+B,EAAM,MAAO,CACvB,kBAAmB,SAAUv0B,EAAGi9B,GAC9B,OAAOguB,GAAKjrD,EAAGi9B,EAAUj9B,IAG3B,mBAAoB,SAAUA,EAAGi9B,GAC/B,OAAOj9B,EAAE7L,OAAO82D,GAAKjrD,EAAEmQ,UAAW8sB,EAAUj9B,OAIhD,OAAO07H,IACN,CAAEZ,qBAAqB,IAU1B,SAAS7vE,GAAMznD,EAAOy5B,EAAU0+F,GAE9B,IAAMC,EAAYx+D,GAAiBngC,GAoBnC,OAlBA,SAASkoB,EAASrxD,EAAOuM,GACvB,OAAIsC,MAAMP,QAAQtO,GACTiC,GAAIjC,GAAO,SAAU0oD,EAAO3pD,GAEjC,OAAOsyD,EAAQ3I,EAAOn8C,EAAMoD,OAAO5Q,EAAI,OAIvB,IAAd+oI,EACK3+F,EAASnpC,GACO,IAAd8nI,EACF3+F,EAASnpC,EAAOuM,GAEhB48B,EAASnpC,EAAOuM,EAAOs7H,GAK7Bx2E,CAAQ3hD,EAAO,IC5EjB,SAASq4H,GAAmB5rH,GACjC,GAAoB,IAAhBA,EAAK3Z,QAAgB0gD,EAAa/mC,EAAK,IAAK,CAE9C,IAAMqsC,GADNrsC,EAAOA,EAAKpN,SACK,GACb4zC,EAAS6F,GACXrsC,EAAK,GAAKqsC,EAAM,EACP5F,EAAY4F,KACrBrsC,EAAK,GAAKqsC,EAAI5yC,MAAM,IAGxB,OAAOuG,ECVT,IAGa6rH,GAAqC1pI,GAHrC,MACQ,CAAC,QAAS,SAAU,UAAW,WAE0B,YAAwC,IAArCmiC,EAAqC,EAArCA,MAAO7Q,EAA8B,EAA9BA,OAAQghD,EAAsB,EAAtBA,QAASjF,EAAa,EAAbA,OACjG78D,EAAMopE,GAAU,CAAEz3C,QAAO7Q,SAAQghD,UAASjF,WAShD,OAAOlrC,EAAM,MAAO,CAClB,SAAU,SAAUtkB,GAClBA,EAAO4rH,GAAkB5rH,GAEzB,IACE,OAAOrN,EAAIvJ,MAAM,KAAM4W,GACvB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICrBbiB,GAAsC3pI,GAHtC,OACQ,CAAC,QAAS,MAAO,WAEyC,YAA4B,IAAzBmiC,EAAyB,EAAzBA,MAAO70B,EAAkB,EAAlBA,IAAKib,EAAa,EAAbA,OACtF26F,EAAOgP,GAAW,CAAE/vF,QAAO70B,MAAKib,WAStC,OAAO4Z,EAAM,OAAQ,CACnB,SAAU,SAAUtkB,GAClBA,EAAO4rH,GAAkB5rH,GAEzB,IACE,OAAOqlG,EAAKj8G,MAAM,KAAM4W,GACxB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICrBbkB,GAAqC5pI,GAHrC,MACQ,CAAC,QAAS,SAAU,UAAW,YAE0B,YAAyC,IAAtCmiC,EAAsC,EAAtCA,MAAO7Q,EAA+B,EAA/BA,OAAQghD,EAAuB,EAAvBA,QAASnN,EAAc,EAAdA,QACjG5xD,EAAMwmE,GAAU,CAAE53C,QAAO7Q,SAAQghD,UAASnN,YAShD,OAAOhjC,EAAM,MAAO,CAClB,SAAU,SAAUtkB,GAClBA,EAAO4rH,GAAkB5rH,GAEzB,IACE,OAAOtK,EAAItM,MAAM,KAAM4W,GACvB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICvBbmB,GAAuC7pI,GAHvC,QACQ,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,aAEpB,YAAgF,IAA7EmiC,EAA6E,EAA7EA,MAAO7Q,EAAsE,EAAtEA,OAAQo+B,EAA8D,EAA9DA,OAAQyd,EAAsD,EAAtDA,UAAWhI,EAA2C,EAA3CA,QAASiI,EAAkC,EAAlCA,UAAWC,EAAuB,EAAvBA,OAAQC,EAAe,EAAfA,SACzIvb,EAAQmb,GAAY,CAAE/qC,QAAO7Q,SAAQo+B,SAAQyd,YAAWhI,UAASiI,YAAWC,SAAQC,aAQ1F,OAAOnrC,EAAM,QAAS,CACpB,SAAU,SAAUtkB,GAQlB,MALoB,kBADPA,EADKA,EAAK3Z,OAAS,IAI9B2Z,EAAK/B,MAAK,GAGLi2C,EAAM9qD,MAAM,KAAM4W,QAG5B,CAAE6qH,qBAAqB,ICZboB,GAAqC9pI,GAVrC,MACQ,CAAC,QAAS,QAAS,SAAU,UAS4B,YAAqC,IAAlCmiC,EAAkC,EAAlCA,MAAOgnC,EAA2B,EAA3BA,MAAOzZ,EAAoB,EAApBA,OAAQqC,EAAY,EAAZA,MAC/FkB,EAAM2c,GAAU,CAAEztC,QAAOgnC,QAAOzZ,SAAQqC,UAG9C,OAAO5vB,EAAM,MAAO,CAClB,SAAU,SAAUtkB,GAElB,IAAMmE,EAAYnE,EAAK3Z,OAAS,EAC1B6/B,EAAOlmB,EAAKmE,GACdqiC,EAAStgB,KACXlmB,EAAKmE,GAAa+hB,EAAO,GAG3B,IACE,OAAOkvB,EAAIhsD,MAAM,KAAM4W,GACvB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,IC5BbqB,GAAwC/pI,GAHxC,SACQ,CAAC,QAAS,WAEkD,YAAuB,IAApBmiC,EAAoB,EAApBA,MAAOutB,EAAa,EAAbA,OACnF2B,EAAS6e,GAAa,CAAE/tC,QAAOutB,WAQrC,OAAOvtB,EAAM,SAAU,CACrB,SAAU,SAAUtkB,GAClB,IACE,OAAOwzC,EAAOpqD,MAAM,KAAM4W,GAC1B,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICjBbsB,GAAwChqI,GAHxC,SACQ,CAAC,QAAS,SAAU,cAEwC,YAAkC,IAA/BmiC,EAA+B,EAA/BA,MAAOutB,EAAwB,EAAxBA,OAAQ7kC,EAAgB,EAAhBA,UAC3FxZ,EAASu3D,GAAa,CAAEzmC,QAAOutB,SAAQ7kC,cAS7C,OAAOsX,EAAM,SAAU,CACrB,SAAU,SAAUtkB,GAElB,IAAMmE,EAAYnE,EAAK3Z,OAAS,EAC1B6/B,EAAOlmB,EAAKmE,GACdqiC,EAAStgB,GACXlmB,EAAKmE,GAAa+hB,EAAO,EAChBugB,EAAYvgB,KACrBlmB,EAAKmE,GAAa+hB,EAAKzsB,MAAM,IAG/B,IACE,OAAOjG,EAAOpK,MAAM,KAAM4W,GAC1B,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,IC5BbuB,GAAsCjqI,GAHtC,OACQ,CAAC,QAAS,SAAU,WAAY,SAAU,cAEgB,YAAoD,IAAjDmiC,EAAiD,EAAjDA,MAAOutB,EAA0C,EAA1CA,OAAQ7gC,EAAkC,EAAlCA,SAAUnL,EAAwB,EAAxBA,OAAQypD,EAAgB,EAAhBA,UAC3G3kB,EAAO0jB,GAAW,CAAE/pC,QAAOutB,SAAQ7gC,WAAUnL,SAAQypD,cAQ3D,OAAOhrC,EAZI,OAYQ,CACjB,SAAU,SAAUtkB,GAClBA,EAAO4rH,GAAkB5rH,GAEzB,IACE,OAAO2qC,EAAKvhD,MAAM,KAAM4W,GACxB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICbbwB,GAAqClqI,GAVrC,MACQ,CAAC,QAAS,OAAQ,aASuC,YAA+B,IAA5BmiC,EAA4B,EAA5BA,MAAOpqB,EAAqB,EAArBA,KAAM6wF,EAAe,EAAfA,SACtFya,EAAMsQ,GAAU,CAAExxF,QAAOpqB,OAAM6wF,aAErC,OAAOzmE,EAAM,MAAO,CAClB,SAAU,SAAUtkB,GAClBA,EAAO4rH,GAAkB5rH,GAEzB,IACE,OAAOwlG,EAAIp8G,MAAM,KAAM4W,GACvB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICdbyB,GAAqCnqI,GAHrC,MACQ,CAAC,QAAS,SAAU,MAAO,YAE8B,YAAqC,IAAlCmiC,EAAkC,EAAlCA,MAAO7Q,EAA2B,EAA3BA,OAAQhkB,EAAmB,EAAnBA,IAAKglE,EAAc,EAAdA,QAC7F9hD,EAAMihG,GAAU,CAAEtvF,QAAO7Q,SAAQhkB,MAAKglE,YAE5C,OAAOnwC,EANI,MAMQ,CACjB,SAAU,SAAUtkB,GAClBA,EAAO4rH,GAAkB5rH,GAEzB,IACE,OAAO2S,EAAIvpB,MAAM,KAAM4W,GACvB,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICdb0B,GAAwCpqI,GAHxC,SACQ,CAAC,QAAS,MAAO,cAE2C,YAA+B,IAA5BmiC,EAA4B,EAA5BA,MAAO70B,EAAqB,EAArBA,IAAKy5F,EAAgB,EAAhBA,UACxFic,EAAS2O,GAAa,CAAExvF,QAAO70B,MAAKy5F,cAE1C,OAAO5kE,EANI,SAMQ,CACjB,SAAU,SAAUtkB,GAElB,GAAoB,IAAhBA,EAAK3Z,QAAgB0gD,EAAa/mC,EAAK,IAAK,CAC9C,IAAMqsC,EAAMrsC,EAAK,GACbwmC,EAAS6F,GACXrsC,EAAK,GAAKqsC,EAAM,EACP5F,EAAY4F,KACrBrsC,EAAK,GAAKqsC,EAAI5yC,MAAM,IAIxB,IACE,OAAO0rG,EAAO/7G,MAAM,KAAM4W,GAC1B,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,ICtBb2B,GAA0CrqI,GAV1C,WACQ,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,UASE,YAA8D,IAA3DmiC,EAA2D,EAA3DA,MAAO70B,EAAoD,EAApDA,IAAKuhB,EAA+C,EAA/CA,SAAU8hB,EAAqC,EAArCA,SAAUpoB,EAA2B,EAA3BA,OAAQthB,EAAmB,EAAnBA,MAAOsQ,EAAY,EAAZA,MAC7HqxF,EAAW+pB,GAAe,CAAExwF,QAAO70B,MAAKuhB,WAAU8hB,WAAUpoB,SAAQthB,QAAOsQ,UAEjF,OAAO4qB,EAbI,WAaQ,CACjB,SAAU,SAAUtkB,GAClBA,EAAO4rH,GAAkB5rH,GAEzB,IACE,OAAO+qF,EAAS3hG,MAAM,KAAM4W,GAC5B,MAAOsnB,GACP,MAAMq6D,GAAer6D,SAI1B,CAAEujG,qBAAqB,I,qBCvBnB,SAAS4B,GAAenoG,EAAOooG,EAAMhoF,EAAMioF,GA8HhD,SAASC,EAASzpI,EAAMU,EAAOuD,GA+N/B,IAAoC+B,EAjNlC,GAZI/B,EAAQwI,MAAyB,mBAAV/L,IAEzBA,EA4EJ,SAAgBsF,GACd,IAAMiG,EAAU,WAEd,IADA,IAAM4Q,EAAO,GACJpd,EAAI,EAAGiR,EAAMzN,UAAUC,OAAQzD,EAAIiR,EAAKjR,IAAK,CACpD,IAAMgR,EAAMxN,UAAUxD,GACtBod,EAAKpd,GAAKgR,GAAOA,EAAIsM,UAEvB,OAAO/W,EAAGC,MAAMs7C,EAAM1kC,IAGpB7W,EAAG63F,YACL5xF,EAAQ4xF,UAAY73F,EAAG63F,WAGzB,OAAO5xF,EA1FGy9H,CAAMhpI,IA4NK,mBADasF,EAvNJtF,IAwN6B,iBAAjBsF,EAAG09B,YAvN3ChjC,EAAQygC,EAAMnhC,EAAD,QACVU,EAAMgjC,UAAYhjC,KAInBipI,EAAgBpoF,EAAKvhD,KAAU2pI,EAAgBjpI,GAgBjD,OAbEA,EAFEuD,EAAQqwF,SAEFnzD,EAAMnhC,EAAMU,EAAMqjC,YAGlB5C,EAAMogB,EAAKvhD,GAAOU,GAG5B6gD,EAAKvhD,GAAQU,SACN8oI,EAAkBxpI,GAEzB4pI,EAAiB5pI,EAAMU,QACvB6gD,EAAK51C,KAAK,SAAU3L,GAAM,WACxB,OAAOU,KAKX,QAAmByC,IAAfo+C,EAAKvhD,IAAuBiE,EAAQqwF,SAQtC,OAPA/yC,EAAKvhD,GAAQU,SACN8oI,EAAkBxpI,GAEzB4pI,EAAiB5pI,EAAMU,QACvB6gD,EAAK51C,KAAK,SAAU3L,GAAM,WACxB,OAAOU,KAKX,IAAKuD,EAAQ4lI,OACX,MAAM,IAAI5sH,MAAM,kBAAoBjd,EAAO,qBAI/C,SAAS4pI,EAAkB5pI,EAAMU,GAC3BA,GAAoC,mBAApBA,EAAMm9F,WACxBt8C,EAAKgtD,WAAW1Q,UAAU79F,GAAQU,EAAMm9F,UACpCisC,EAAqB9pI,KACvBuhD,EAAKgtD,WAAWtR,kBAAkBj9F,GAAQU,EAAMm9F,oBAI3Ct8C,EAAKgtD,WAAW1Q,UAAU79F,GAC7B8pI,EAAqB9pI,KACvBuhD,EAAKgtD,WAAWtR,kBAAkBj9F,GAAQU,IAKhD,SAASqpI,EAAkB/pI,UAClBuhD,EAAKgtD,WAAW1Q,UAAU79F,GAC7B8pI,EAAqB9pI,GACvBuhD,EAAKgtD,WAAWtR,kBAAkBj9F,GAAQuhD,EAAKvhD,UAExCuhD,EAAKgtD,WAAWtR,kBAAkBj9F,GAmC7C,SAASgqI,EAAgBhrI,EAASiF,GAA4B,IAAnBjE,EAAmB,uDAAZhB,EAAQgH,GACxD,GAAIwlD,GAASxrD,EAAM,KACjB,MAAM,IAAIid,MAAM,wDACHy8C,KAAKh9C,UAAU1c,IAG9B,IAAM+f,EAAYkqH,EAA2BjrI,GACzCuiD,EAAKgtD,WAAW1Q,UAChBt8C,EAEE2oF,EAAoBlqI,KAAQuhD,EAAKgtD,WAAW1Q,UAC5CssC,EAAW7oI,GAAeye,EAAW/f,GAAQ+f,EAAU/f,QAAQmD,EAE/D44G,EAAW,WAEf,IAAM3vD,EAAe,GACrBptD,EAAQotD,aACLzpD,IAAI8pD,IACJnpD,SAAQ,SAAAopD,GACP,GAAIlB,GAASkB,EAAY,KACvB,MAAM,IAAIzvC,MAAM,8DACHy8C,KAAKh9C,UAAUgwC,IAGX,SAAfA,EACFN,EAAa7K,KAAOA,EACI,sBAAfmL,EACTN,EAAa6wC,kBAAoB17C,EAAKgtD,WAAWtR,kBACzB,YAAfvwC,EACTN,EAAagwD,QAAU76D,EAEvB6K,EAAaM,GAAcnL,EAAKmL,MAItC,IAAM3b,EAA2B/xC,EAAQotD,GAEzC,GAAIrb,GAA0C,mBAAvBA,EAAS8sD,UAC9B,MAAM,IAAI5gF,MAAM,yIAIlB,QAAiB9Z,IAAbgnI,GAA0BlmI,EAAQqwF,SACpC,OAAOvjD,EAGT,GAAI44F,EAAgBQ,IAAaR,EAAgB54F,GAE/C,OAAO5P,EAAMgpG,EAAUp5F,GAGzB,GAAI9sC,EAAQ4lI,OAEV,OAAOM,EAEP,MAAM,IAAIltH,MAAM,kBAAoBjd,EAAO,sBAK1ChB,EAAQ+yC,OAA8B,IAAtB/yC,EAAQ+yC,KAAKia,MAYhCjsC,EAAU/f,GAAQ+7G,IAGdouB,GAAYD,EACdH,EAAiB/pI,IAEbiqI,EAA2BjrI,IAAYorI,EAA4BprI,KACrEgtD,GAAKzK,EAAKgtD,WAAWtR,kBAAmBj9F,GAAM,kBAAM+f,EAAU/f,QAlBlEgsD,GAAKjsC,EAAW/f,EAAM+7G,GAGlBouB,GAAYD,EACdH,EAAiB/pI,IAEbiqI,EAA2BjrI,IAAYorI,EAA4BprI,KACrEgtD,GAAKzK,EAAKgtD,WAAWtR,kBAAmBj9F,GAAM,kBAAM+f,EAAU/f,OAiBpEwpI,EAAkBxpI,GAAQhB,EAE1BuiD,EAAK51C,KAAK,SAAU3L,EAAM+7G,GAS5B,SAASsuB,EAAiBlpI,GACxB,MAAyB,mBAAXA,GACQ,iBAAXA,GACW,iBAAXA,GACW,kBAAXA,GACI,OAAXA,GACAsiD,EAAOtiD,IACPoiD,EAAUpiD,IACVmiD,EAAYniD,IACZqiD,EAAWriD,IACXwiD,EAASxiD,IACToO,MAAMP,QAAQ7N,GAQpB,SAASwoI,EAAiB3jI,GACxB,MAAqB,mBAAPA,GAA8C,WAAzB,IAAOA,EAAG+9B,YAO/C,SAAS+lG,EAAsB9pI,GAC7B,OAAQsB,GAAeM,EAAQ5B,GAGjC,SAASoqI,EAA6BprI,GACpC,SAAoC,IAA7BA,EAAQgH,GAAGuf,QAAQ,MACvBjkB,GAAeM,EAAQ5C,EAAQgH,KAC9BhH,EAAQ+yC,MAAS/yC,EAAQ+yC,KAAKid,SAGpC,SAASi7E,EAA4BjrI,GACnC,YAAoBmE,IAAZnE,QACWmE,IAAjBnE,EAAQ+yC,OAC6B,IAArC/yC,EAAQ+yC,KAAK21F,sBAAiC,EAIlD,IAAM9lI,EAAS,CACb2sG,YAAY,EACZpiG,MAAM,EACNgwG,MAAM,EACNz4G,OAAO,EACPqrD,MAAM,EACNu3B,OAAO,GAGT,OAnUA,SAAqBgkD,EAAWrmI,GAC9B,IAAMymB,EAAMznB,UAAUC,OACtB,GAAY,IAARwnB,GAAqB,IAARA,EACf,MAAM,IAAIuiD,GAAe,SAAUviD,EAAK,EAAG,GAO7C,SAAS6/G,EAAgBC,EAAY9pI,EAAOV,GAC1C,GAAIuP,MAAMP,QAAQtO,GAChBA,EAAM4C,SAAQ,SAAAsmC,GAAI,OAAI2gG,EAAeC,EAAY5gG,WAC5C,GAAqB,WAAjB,IAAOlpC,GAChB,IAAK,IAAMV,KAAQU,EACbY,GAAeZ,EAAOV,IACxBuqI,EAAeC,EAAY9pI,EAAMV,GAAOA,QAGvC,GAAI8sD,GAAUpsD,SAAmByC,IAATnD,EAAoB,CACjD,IAAMyqI,EAAW39E,GAAUpsD,GACvBupI,EAA2BvpI,GACtBA,EAAMsF,GAAK,aACZtF,EAAMsF,GACVhG,EAGJ,GAAIsB,GAAekpI,EAAYC,IAAaD,EAAWC,KAAc/pI,IAAUuD,EAAQ4lI,OACrF,MAAM,IAAI5sH,MAAM,kBAAoBwtH,EAAW,WAGjDD,EAAWC,GAAY/pI,OAEvB,IAAKuD,EAAQ4lI,OACX,MAAM,IAAIlhI,UAAU,sCA5BrB1E,IACHA,EAAU,IAgCZ,IAAMumI,EAAa,GAGnB,IAAK,IAAMxqI,KAFXuqI,EAAeC,EAAYF,GAERE,EACjB,GAAIlpI,GAAekpI,EAAYxqI,GAAO,CAEpC,IAAMU,EAAQ8pI,EAAWxqI,GAEzB,GAAI8sD,GAAUpsD,GAIZspI,EAAetpI,EAAOuD,QACjB,GAAIomI,EAAgB3pI,GACzB+oI,EAAQzpI,EAAMU,EAAOuD,QAErB,IAAKA,EAAQ4lI,OACX,MAAM,IAAIlhI,UAAU,wCCtHzB,IAAM+hI,GAAiB,CAG5BnjF,QAAS,MAGTmH,OAAQ,SAGRhsC,OAAQ,SAGRS,UAAW,GAMX68C,aAAa,EAIbi1D,WAAY,MCnBD0V,GAAiB,CAAC,SAAU,SAC5BC,GAAiB,CAAC,SAAU,YAAa,YAE/C,SAASC,GAAev6G,EAAQ3kB,GA2CrC,SAASm/H,EAAS7mI,GAChB,GAAIA,EAAS,CACX,IAAMub,EAAOisC,GAAUn7B,EAAQa,IAG/B45G,GAAe9mI,EAAS,SAAU0mI,IAClCI,GAAe9mI,EAAS,SAAU2mI,IlkB0BjC,SAASI,EAAY11H,EAAGC,GAE7B,GAAIhG,MAAMP,QAAQuG,GAChB,MAAM,IAAI5M,UAAU,0CAGtB,IAAK,IAAMs5C,KAAQ1sC,EAGjB,GAAIjU,GAAeiU,EAAG0sC,MAAWA,KAAQ9hD,OAAOkB,cAAgB4gD,KAAQ7/C,SAASf,WAC/E,GAAIkU,EAAE0sC,IAAS1sC,EAAE0sC,GAAMz/C,cAAgBrC,YACrBgD,IAAZmS,EAAE2sC,KACJ3sC,EAAE2sC,GAAQ,IAER3sC,EAAE2sC,IAAS3sC,EAAE2sC,GAAMz/C,cAAgBrC,OACrC6qI,EAAW11H,EAAE2sC,GAAO1sC,EAAE0sC,IAEtB3sC,EAAE2sC,GAAQ1sC,EAAE0sC,OAET,IAAI1yC,MAAMP,QAAQuG,EAAE0sC,IACzB,MAAM,IAAIt5C,UAAU,0CAEpB2M,EAAE2sC,GAAQ1sC,EAAE0sC,GAIlB,OAAO3sC,EkkBjDH01H,CAAW16G,EAAQrsB,GAEnB,IAAMymD,EAAOe,GAAUn7B,EAAQa,IAEzB85G,EAAUx/E,GAAUxnD,EAASktB,IAKnC,OAFAxlB,EAAK,SAAU++C,EAAMlrC,EAAMyrH,GAEpBvgF,EAEP,OAAOe,GAAUn7B,EAAQa,IAiB7B,OAZA25G,EAAQH,eAAiBA,GACzBG,EAAQF,eAAiBA,GAGzBzqI,OAAOkS,KAAKq4H,IAAgBpnI,SAAQ,SAAAtC,GAClCb,OAAOC,eAAe0qI,EAAS9pI,EAAK,CAClCV,IAAK,kBAAMgwB,EAAOtvB,IAClBX,YAAY,EACZqN,cAAc,OAIXo9H,EAmBT,SAASC,GAAgB9mI,EAASjE,EAAM8M,GAVxC,IAAmBsD,EAAOw5B,OAWFzmC,IAAlBc,EAAQjE,KAXKoQ,EAW4BtD,EAXrB88B,EAW6B3lC,EAAQjE,IAV7B,IAAzBoQ,EAAMmV,QAAQqkB,KAYnB+Q,QAAQ+uE,KAAK,2BAA6BzlH,EAAQjE,GAAQ,+BAAiCA,EAA9E,yBACa8M,EAAOnK,KAAI,SAAAjC,GAAK,OAAIg5D,KAAKh9C,UAAUhc,MAAQuN,KAAK,MAAQ,KC1GvElN,UCuFR,SAASA,EAAQmqI,EAAW56G,GACjC,IAAM66G,EAAiB,KAAc,GAAIT,GAAgBp6G,GAGzD,GAA6B,mBAAlBnwB,OAAOY,OAChB,MAAM,IAAIkc,MAAM,iHAKlB,IC7FqB3a,EAEf8oI,ED2FA7pF,GC7Fej/C,ED6FM,CAEzB+gD,WACAE,YACAD,cACAE,aACAC,SACAC,WACA10C,UACA20C,WACAC,eACAC,gBACAC,iBACAC,UACAC,UACAC,YACAC,cACAC,SACAC,aACAC,SACAnkC,WACAnZ,WACAu9C,SACAC,cAEAC,iBACAE,cACAC,mBACAC,cACAC,oBACAC,iBACAC,2BACAC,iBACAC,cACAR,SACAS,eACAC,iBACAC,oBACAC,cACAC,eAEAC,WCpII6lF,EAAU,IAAIC,KAGpB/oI,EAAI4yC,GAAKk2F,EAAQl2F,GAAGj0C,KAAKmqI,GACzB9oI,EAAI+yC,IAAM+1F,EAAQ/1F,IAAIp0C,KAAKmqI,GAC3B9oI,EAAI8yC,KAAOg2F,EAAQh2F,KAAKn0C,KAAKmqI,GAC7B9oI,EAAIqJ,KAAOy/H,EAAQz/H,KAAK1K,KAAKmqI,GAEtB9oI,GDgIPi/C,EAAKjxB,OAASu6G,GAAcM,EAAgB5pF,EAAK51C,MAEjD41C,EAAKgtD,WAAa,CAChB1Q,UAAW,GACXZ,kBAAmB,CACjB3sE,OAAQixB,EAAKjxB,SAoDjB,IAAMk5G,EAAoB,GAMpB8B,EAAiBhC,IAHvB,WAA6B,2BAANzsH,EAAM,yBAANA,EAAM,gBAC3B,OAAO0kC,EAAKpgB,MAAMl7B,MAAMs7C,EAAKpgB,MAAOtkB,KAzCtC,EA2CsD0kC,EAAMioF,GA8B5D,OA7BAjoF,EAAK8+D,OAASirB,EAId/pF,EAAKrM,GAAG,UAAU,WAChBpoC,GAAO08H,GAAmBlmI,SAAQ,SAAAtE,GAC5BA,GAAWA,EAAQ+yC,MAAQ/yC,EAAQ+yC,KAAKqyF,wBAG1CkH,EAAetsI,EAAS,CAAEs1F,UAAU,UAO1C/yC,EAAKxgD,OAASA,EAAOE,KAAK,KAAMiqI,GAGhC3pF,EAAKviD,QAAUA,GAIfuiD,EAAK8+D,OAAOvzG,GAAO8+C,GAAYs/E,KAE/B3pF,EAAK0rB,eAAiBA,GACtB1rB,EAAKmH,eAAiBA,GACtBnH,EAAKuH,WAAaA,GAEXvH,ED3OMxgD,CAAOkJ,M","file":"math.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"math\"] = factory();\n\telse\n\t\troot[\"math\"] = factory();\n})(this, function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 254);\n","var TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar redefine = require('../internals/redefine');\nvar toString = require('../internals/object-to-string');\n\n// `Object.prototype.toString` method\n// https://tc39.es/ecma262/#sec-object.prototype.tostring\nif (!TO_STRING_TAG_SUPPORT) {\n  redefine(Object.prototype, 'toString', toString, { unsafe: true });\n}\n","var check = function (it) {\n  return it && it.Math == Math && it;\n};\n\n// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nmodule.exports =\n  // eslint-disable-next-line es/no-global-this -- safe\n  check(typeof globalThis == 'object' && globalThis) ||\n  check(typeof window == 'object' && window) ||\n  // eslint-disable-next-line no-restricted-globals -- safe\n  check(typeof self == 'object' && self) ||\n  check(typeof global == 'object' && global) ||\n  // eslint-disable-next-line no-new-func -- fallback\n  (function () { return this; })() || Function('return this')();\n","function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  return (module.exports = _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n    return typeof obj;\n  } : function (obj) {\n    return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports), _typeof(obj);\n}\n\nmodule.exports = _typeof, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","'use strict';\nvar $ = require('../internals/export');\nvar $map = require('../internals/array-iteration').map;\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('map');\n\n// `Array.prototype.map` method\n// https://tc39.es/ecma262/#sec-array.prototype.map\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  map: function map(callbackfn /* , thisArg */) {\n    return $map(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","var global = require('../internals/global');\nvar DOMIterables = require('../internals/dom-iterables');\nvar DOMTokenListPrototype = require('../internals/dom-token-list-prototype');\nvar forEach = require('../internals/array-for-each');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nvar handlePrototype = function (CollectionPrototype) {\n  // some Chrome versions have non-configurable methods on DOMTokenList\n  if (CollectionPrototype && CollectionPrototype.forEach !== forEach) try {\n    createNonEnumerableProperty(CollectionPrototype, 'forEach', forEach);\n  } catch (error) {\n    CollectionPrototype.forEach = forEach;\n  }\n};\n\nfor (var COLLECTION_NAME in DOMIterables) {\n  if (DOMIterables[COLLECTION_NAME]) {\n    handlePrototype(global[COLLECTION_NAME] && global[COLLECTION_NAME].prototype);\n  }\n}\n\nhandlePrototype(DOMTokenListPrototype);\n","var global = require('../internals/global');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar setGlobal = require('../internals/set-global');\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\nvar isForced = require('../internals/is-forced');\n\n/*\n  options.target      - name of the target object\n  options.global      - target is the global object\n  options.stat        - export as static methods of target\n  options.proto       - export as prototype methods of target\n  options.real        - real prototype method for the `pure` version\n  options.forced      - export even if the native feature is available\n  options.bind        - bind methods to the target, required for the `pure` version\n  options.wrap        - wrap constructors to preventing global pollution, required for the `pure` version\n  options.unsafe      - use the simple assignment of property instead of delete + defineProperty\n  options.sham        - add a flag to not completely full polyfills\n  options.enumerable  - export as enumerable property\n  options.noTargetGet - prevent calling a getter on target\n  options.name        - the .name of the function if it does not match the key\n*/\nmodule.exports = function (options, source) {\n  var TARGET = options.target;\n  var GLOBAL = options.global;\n  var STATIC = options.stat;\n  var FORCED, target, key, targetProperty, sourceProperty, descriptor;\n  if (GLOBAL) {\n    target = global;\n  } else if (STATIC) {\n    target = global[TARGET] || setGlobal(TARGET, {});\n  } else {\n    target = (global[TARGET] || {}).prototype;\n  }\n  if (target) for (key in source) {\n    sourceProperty = source[key];\n    if (options.noTargetGet) {\n      descriptor = getOwnPropertyDescriptor(target, key);\n      targetProperty = descriptor && descriptor.value;\n    } else targetProperty = target[key];\n    FORCED = isForced(GLOBAL ? key : TARGET + (STATIC ? '.' : '#') + key, options.forced);\n    // contained in target\n    if (!FORCED && targetProperty !== undefined) {\n      if (typeof sourceProperty == typeof targetProperty) continue;\n      copyConstructorProperties(sourceProperty, targetProperty);\n    }\n    // add a flag to not completely full polyfills\n    if (options.sham || (targetProperty && targetProperty.sham)) {\n      createNonEnumerableProperty(sourceProperty, 'sham', true);\n    }\n    // extend global\n    redefine(target, key, sourceProperty, options);\n  }\n};\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar PROPER_FUNCTION_NAME = require('../internals/function-name').PROPER;\nvar redefine = require('../internals/redefine');\nvar anObject = require('../internals/an-object');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar $toString = require('../internals/to-string');\nvar fails = require('../internals/fails');\nvar regExpFlags = require('../internals/regexp-flags');\n\nvar TO_STRING = 'toString';\nvar RegExpPrototype = RegExp.prototype;\nvar n$ToString = RegExpPrototype[TO_STRING];\nvar getFlags = uncurryThis(regExpFlags);\n\nvar NOT_GENERIC = fails(function () { return n$ToString.call({ source: 'a', flags: 'b' }) != '/a/b'; });\n// FF44- RegExp#toString has a wrong name\nvar INCORRECT_NAME = PROPER_FUNCTION_NAME && n$ToString.name != TO_STRING;\n\n// `RegExp.prototype.toString` method\n// https://tc39.es/ecma262/#sec-regexp.prototype.tostring\nif (NOT_GENERIC || INCORRECT_NAME) {\n  redefine(RegExp.prototype, TO_STRING, function toString() {\n    var R = anObject(this);\n    var p = $toString(R.source);\n    var rf = R.flags;\n    var f = $toString(rf === undefined && isPrototypeOf(RegExpPrototype, R) && !('flags' in RegExpPrototype) ? getFlags(R) : rf);\n    return '/' + p + '/' + f;\n  }, { unsafe: true });\n}\n","module.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (error) {\n    return true;\n  }\n};\n","var NATIVE_BIND = require('../internals/function-bind-native');\n\nvar FunctionPrototype = Function.prototype;\nvar bind = FunctionPrototype.bind;\nvar call = FunctionPrototype.call;\nvar uncurryThis = NATIVE_BIND && bind.bind(call, call);\n\nmodule.exports = NATIVE_BIND ? function (fn) {\n  return fn && uncurryThis(fn);\n} : function (fn) {\n  return fn && function () {\n    return call.apply(fn, arguments);\n  };\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar exec = require('../internals/regexp-exec');\n\n// `RegExp.prototype.exec` method\n// https://tc39.es/ecma262/#sec-regexp.prototype.exec\n$({ target: 'RegExp', proto: true, forced: /./.exec !== exec }, {\n  exec: exec\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar IS_PURE = require('../internals/is-pure');\nvar global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar call = require('../internals/function-call');\nvar NativePromise = require('../internals/native-promise-constructor');\nvar redefine = require('../internals/redefine');\nvar redefineAll = require('../internals/redefine-all');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar setSpecies = require('../internals/set-species');\nvar aCallable = require('../internals/a-callable');\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\nvar anInstance = require('../internals/an-instance');\nvar inspectSource = require('../internals/inspect-source');\nvar iterate = require('../internals/iterate');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\nvar speciesConstructor = require('../internals/species-constructor');\nvar task = require('../internals/task').set;\nvar microtask = require('../internals/microtask');\nvar promiseResolve = require('../internals/promise-resolve');\nvar hostReportErrors = require('../internals/host-report-errors');\nvar newPromiseCapabilityModule = require('../internals/new-promise-capability');\nvar perform = require('../internals/perform');\nvar Queue = require('../internals/queue');\nvar InternalStateModule = require('../internals/internal-state');\nvar isForced = require('../internals/is-forced');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_BROWSER = require('../internals/engine-is-browser');\nvar IS_NODE = require('../internals/engine-is-node');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar SPECIES = wellKnownSymbol('species');\nvar PROMISE = 'Promise';\n\nvar getInternalState = InternalStateModule.getterFor(PROMISE);\nvar setInternalState = InternalStateModule.set;\nvar getInternalPromiseState = InternalStateModule.getterFor(PROMISE);\nvar NativePromisePrototype = NativePromise && NativePromise.prototype;\nvar PromiseConstructor = NativePromise;\nvar PromisePrototype = NativePromisePrototype;\nvar TypeError = global.TypeError;\nvar document = global.document;\nvar process = global.process;\nvar newPromiseCapability = newPromiseCapabilityModule.f;\nvar newGenericPromiseCapability = newPromiseCapability;\n\nvar DISPATCH_EVENT = !!(document && document.createEvent && global.dispatchEvent);\nvar NATIVE_REJECTION_EVENT = isCallable(global.PromiseRejectionEvent);\nvar UNHANDLED_REJECTION = 'unhandledrejection';\nvar REJECTION_HANDLED = 'rejectionhandled';\nvar PENDING = 0;\nvar FULFILLED = 1;\nvar REJECTED = 2;\nvar HANDLED = 1;\nvar UNHANDLED = 2;\nvar SUBCLASSING = false;\n\nvar Internal, OwnPromiseCapability, PromiseWrapper, nativeThen;\n\nvar FORCED = isForced(PROMISE, function () {\n  var PROMISE_CONSTRUCTOR_SOURCE = inspectSource(PromiseConstructor);\n  var GLOBAL_CORE_JS_PROMISE = PROMISE_CONSTRUCTOR_SOURCE !== String(PromiseConstructor);\n  // V8 6.6 (Node 10 and Chrome 66) have a bug with resolving custom thenables\n  // https://bugs.chromium.org/p/chromium/issues/detail?id=830565\n  // We can't detect it synchronously, so just check versions\n  if (!GLOBAL_CORE_JS_PROMISE && V8_VERSION === 66) return true;\n  // We need Promise#finally in the pure version for preventing prototype pollution\n  if (IS_PURE && !PromisePrototype['finally']) return true;\n  // We can't use @@species feature detection in V8 since it causes\n  // deoptimization and performance degradation\n  // https://github.com/zloirock/core-js/issues/679\n  if (V8_VERSION >= 51 && /native code/.test(PROMISE_CONSTRUCTOR_SOURCE)) return false;\n  // Detect correctness of subclassing with @@species support\n  var promise = new PromiseConstructor(function (resolve) { resolve(1); });\n  var FakePromise = function (exec) {\n    exec(function () { /* empty */ }, function () { /* empty */ });\n  };\n  var constructor = promise.constructor = {};\n  constructor[SPECIES] = FakePromise;\n  SUBCLASSING = promise.then(function () { /* empty */ }) instanceof FakePromise;\n  if (!SUBCLASSING) return true;\n  // Unhandled rejections tracking support, NodeJS Promise without it fails @@species test\n  return !GLOBAL_CORE_JS_PROMISE && IS_BROWSER && !NATIVE_REJECTION_EVENT;\n});\n\nvar INCORRECT_ITERATION = FORCED || !checkCorrectnessOfIteration(function (iterable) {\n  PromiseConstructor.all(iterable)['catch'](function () { /* empty */ });\n});\n\n// helpers\nvar isThenable = function (it) {\n  var then;\n  return isObject(it) && isCallable(then = it.then) ? then : false;\n};\n\nvar callReaction = function (reaction, state) {\n  var value = state.value;\n  var ok = state.state == FULFILLED;\n  var handler = ok ? reaction.ok : reaction.fail;\n  var resolve = reaction.resolve;\n  var reject = reaction.reject;\n  var domain = reaction.domain;\n  var result, then, exited;\n  try {\n    if (handler) {\n      if (!ok) {\n        if (state.rejection === UNHANDLED) onHandleUnhandled(state);\n        state.rejection = HANDLED;\n      }\n      if (handler === true) result = value;\n      else {\n        if (domain) domain.enter();\n        result = handler(value); // can throw\n        if (domain) {\n          domain.exit();\n          exited = true;\n        }\n      }\n      if (result === reaction.promise) {\n        reject(TypeError('Promise-chain cycle'));\n      } else if (then = isThenable(result)) {\n        call(then, result, resolve, reject);\n      } else resolve(result);\n    } else reject(value);\n  } catch (error) {\n    if (domain && !exited) domain.exit();\n    reject(error);\n  }\n};\n\nvar notify = function (state, isReject) {\n  if (state.notified) return;\n  state.notified = true;\n  microtask(function () {\n    var reactions = state.reactions;\n    var reaction;\n    while (reaction = reactions.get()) {\n      callReaction(reaction, state);\n    }\n    state.notified = false;\n    if (isReject && !state.rejection) onUnhandled(state);\n  });\n};\n\nvar dispatchEvent = function (name, promise, reason) {\n  var event, handler;\n  if (DISPATCH_EVENT) {\n    event = document.createEvent('Event');\n    event.promise = promise;\n    event.reason = reason;\n    event.initEvent(name, false, true);\n    global.dispatchEvent(event);\n  } else event = { promise: promise, reason: reason };\n  if (!NATIVE_REJECTION_EVENT && (handler = global['on' + name])) handler(event);\n  else if (name === UNHANDLED_REJECTION) hostReportErrors('Unhandled promise rejection', reason);\n};\n\nvar onUnhandled = function (state) {\n  call(task, global, function () {\n    var promise = state.facade;\n    var value = state.value;\n    var IS_UNHANDLED = isUnhandled(state);\n    var result;\n    if (IS_UNHANDLED) {\n      result = perform(function () {\n        if (IS_NODE) {\n          process.emit('unhandledRejection', value, promise);\n        } else dispatchEvent(UNHANDLED_REJECTION, promise, value);\n      });\n      // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should\n      state.rejection = IS_NODE || isUnhandled(state) ? UNHANDLED : HANDLED;\n      if (result.error) throw result.value;\n    }\n  });\n};\n\nvar isUnhandled = function (state) {\n  return state.rejection !== HANDLED && !state.parent;\n};\n\nvar onHandleUnhandled = function (state) {\n  call(task, global, function () {\n    var promise = state.facade;\n    if (IS_NODE) {\n      process.emit('rejectionHandled', promise);\n    } else dispatchEvent(REJECTION_HANDLED, promise, state.value);\n  });\n};\n\nvar bind = function (fn, state, unwrap) {\n  return function (value) {\n    fn(state, value, unwrap);\n  };\n};\n\nvar internalReject = function (state, value, unwrap) {\n  if (state.done) return;\n  state.done = true;\n  if (unwrap) state = unwrap;\n  state.value = value;\n  state.state = REJECTED;\n  notify(state, true);\n};\n\nvar internalResolve = function (state, value, unwrap) {\n  if (state.done) return;\n  state.done = true;\n  if (unwrap) state = unwrap;\n  try {\n    if (state.facade === value) throw TypeError(\"Promise can't be resolved itself\");\n    var then = isThenable(value);\n    if (then) {\n      microtask(function () {\n        var wrapper = { done: false };\n        try {\n          call(then, value,\n            bind(internalResolve, wrapper, state),\n            bind(internalReject, wrapper, state)\n          );\n        } catch (error) {\n          internalReject(wrapper, error, state);\n        }\n      });\n    } else {\n      state.value = value;\n      state.state = FULFILLED;\n      notify(state, false);\n    }\n  } catch (error) {\n    internalReject({ done: false }, error, state);\n  }\n};\n\n// constructor polyfill\nif (FORCED) {\n  // 25.4.3.1 Promise(executor)\n  PromiseConstructor = function Promise(executor) {\n    anInstance(this, PromisePrototype);\n    aCallable(executor);\n    call(Internal, this);\n    var state = getInternalState(this);\n    try {\n      executor(bind(internalResolve, state), bind(internalReject, state));\n    } catch (error) {\n      internalReject(state, error);\n    }\n  };\n  PromisePrototype = PromiseConstructor.prototype;\n  // eslint-disable-next-line no-unused-vars -- required for `.length`\n  Internal = function Promise(executor) {\n    setInternalState(this, {\n      type: PROMISE,\n      done: false,\n      notified: false,\n      parent: false,\n      reactions: new Queue(),\n      rejection: false,\n      state: PENDING,\n      value: undefined\n    });\n  };\n  Internal.prototype = redefineAll(PromisePrototype, {\n    // `Promise.prototype.then` method\n    // https://tc39.es/ecma262/#sec-promise.prototype.then\n    // eslint-disable-next-line unicorn/no-thenable -- safe\n    then: function then(onFulfilled, onRejected) {\n      var state = getInternalPromiseState(this);\n      var reaction = newPromiseCapability(speciesConstructor(this, PromiseConstructor));\n      state.parent = true;\n      reaction.ok = isCallable(onFulfilled) ? onFulfilled : true;\n      reaction.fail = isCallable(onRejected) && onRejected;\n      reaction.domain = IS_NODE ? process.domain : undefined;\n      if (state.state == PENDING) state.reactions.add(reaction);\n      else microtask(function () {\n        callReaction(reaction, state);\n      });\n      return reaction.promise;\n    },\n    // `Promise.prototype.catch` method\n    // https://tc39.es/ecma262/#sec-promise.prototype.catch\n    'catch': function (onRejected) {\n      return this.then(undefined, onRejected);\n    }\n  });\n  OwnPromiseCapability = function () {\n    var promise = new Internal();\n    var state = getInternalState(promise);\n    this.promise = promise;\n    this.resolve = bind(internalResolve, state);\n    this.reject = bind(internalReject, state);\n  };\n  newPromiseCapabilityModule.f = newPromiseCapability = function (C) {\n    return C === PromiseConstructor || C === PromiseWrapper\n      ? new OwnPromiseCapability(C)\n      : newGenericPromiseCapability(C);\n  };\n\n  if (!IS_PURE && isCallable(NativePromise) && NativePromisePrototype !== Object.prototype) {\n    nativeThen = NativePromisePrototype.then;\n\n    if (!SUBCLASSING) {\n      // make `Promise#then` return a polyfilled `Promise` for native promise-based APIs\n      redefine(NativePromisePrototype, 'then', function then(onFulfilled, onRejected) {\n        var that = this;\n        return new PromiseConstructor(function (resolve, reject) {\n          call(nativeThen, that, resolve, reject);\n        }).then(onFulfilled, onRejected);\n      // https://github.com/zloirock/core-js/issues/640\n      }, { unsafe: true });\n\n      // makes sure that native promise-based APIs `Promise#catch` properly works with patched `Promise#then`\n      redefine(NativePromisePrototype, 'catch', PromisePrototype['catch'], { unsafe: true });\n    }\n\n    // make `.constructor === Promise` work for native promise-based APIs\n    try {\n      delete NativePromisePrototype.constructor;\n    } catch (error) { /* empty */ }\n\n    // make `instanceof Promise` work for native promise-based APIs\n    if (setPrototypeOf) {\n      setPrototypeOf(NativePromisePrototype, PromisePrototype);\n    }\n  }\n}\n\n$({ global: true, wrap: true, forced: FORCED }, {\n  Promise: PromiseConstructor\n});\n\nsetToStringTag(PromiseConstructor, PROMISE, false, true);\nsetSpecies(PROMISE);\n\nPromiseWrapper = getBuiltIn(PROMISE);\n\n// statics\n$({ target: PROMISE, stat: true, forced: FORCED }, {\n  // `Promise.reject` method\n  // https://tc39.es/ecma262/#sec-promise.reject\n  reject: function reject(r) {\n    var capability = newPromiseCapability(this);\n    call(capability.reject, undefined, r);\n    return capability.promise;\n  }\n});\n\n$({ target: PROMISE, stat: true, forced: IS_PURE || FORCED }, {\n  // `Promise.resolve` method\n  // https://tc39.es/ecma262/#sec-promise.resolve\n  resolve: function resolve(x) {\n    return promiseResolve(IS_PURE && this === PromiseWrapper ? PromiseConstructor : this, x);\n  }\n});\n\n$({ target: PROMISE, stat: true, forced: INCORRECT_ITERATION }, {\n  // `Promise.all` method\n  // https://tc39.es/ecma262/#sec-promise.all\n  all: function all(iterable) {\n    var C = this;\n    var capability = newPromiseCapability(C);\n    var resolve = capability.resolve;\n    var reject = capability.reject;\n    var result = perform(function () {\n      var $promiseResolve = aCallable(C.resolve);\n      var values = [];\n      var counter = 0;\n      var remaining = 1;\n      iterate(iterable, function (promise) {\n        var index = counter++;\n        var alreadyCalled = false;\n        remaining++;\n        call($promiseResolve, C, promise).then(function (value) {\n          if (alreadyCalled) return;\n          alreadyCalled = true;\n          values[index] = value;\n          --remaining || resolve(values);\n        }, reject);\n      });\n      --remaining || resolve(values);\n    });\n    if (result.error) reject(result.value);\n    return capability.promise;\n  },\n  // `Promise.race` method\n  // https://tc39.es/ecma262/#sec-promise.race\n  race: function race(iterable) {\n    var C = this;\n    var capability = newPromiseCapability(C);\n    var reject = capability.reject;\n    var result = perform(function () {\n      var $promiseResolve = aCallable(C.resolve);\n      iterate(iterable, function (promise) {\n        call($promiseResolve, C, promise).then(capability.resolve, reject);\n      });\n    });\n    if (result.error) reject(result.value);\n    return capability.promise;\n  }\n});\n","var DESCRIPTORS = require('../internals/descriptors');\nvar FUNCTION_NAME_EXISTS = require('../internals/function-name').EXISTS;\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar defineProperty = require('../internals/object-define-property').f;\n\nvar FunctionPrototype = Function.prototype;\nvar functionToString = uncurryThis(FunctionPrototype.toString);\nvar nameRE = /function\\b(?:\\s|\\/\\*[\\S\\s]*?\\*\\/|\\/\\/[^\\n\\r]*[\\n\\r]+)*([^\\s(/]*)/;\nvar regExpExec = uncurryThis(nameRE.exec);\nvar NAME = 'name';\n\n// Function instances `.name` property\n// https://tc39.es/ecma262/#sec-function-instances-name\nif (DESCRIPTORS && !FUNCTION_NAME_EXISTS) {\n  defineProperty(FunctionPrototype, NAME, {\n    configurable: true,\n    get: function () {\n      try {\n        return regExpExec(nameRE, functionToString(this))[1];\n      } catch (error) {\n        return '';\n      }\n    }\n  });\n}\n","'use strict';\nvar $ = require('../internals/export');\nvar call = require('../internals/function-call');\n\n// `URL.prototype.toJSON` method\n// https://url.spec.whatwg.org/#dom-url-tojson\n$({ target: 'URL', proto: true, enumerable: true }, {\n  toJSON: function toJSON() {\n    return call(URL.prototype.toString, this);\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar IndexedObject = require('../internals/indexed-object');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\n\nvar un$Join = uncurryThis([].join);\n\nvar ES3_STRINGS = IndexedObject != Object;\nvar STRICT_METHOD = arrayMethodIsStrict('join', ',');\n\n// `Array.prototype.join` method\n// https://tc39.es/ecma262/#sec-array.prototype.join\n$({ target: 'Array', proto: true, forced: ES3_STRINGS || !STRICT_METHOD }, {\n  join: function join(separator) {\n    return un$Join(toIndexedObject(this), separator === undefined ? ',' : separator);\n  }\n});\n","// `IsCallable` abstract operation\n// https://tc39.es/ecma262/#sec-iscallable\nmodule.exports = function (argument) {\n  return typeof argument == 'function';\n};\n","var global = require('../internals/global');\nvar shared = require('../internals/shared');\nvar hasOwn = require('../internals/has-own-property');\nvar uid = require('../internals/uid');\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar WellKnownSymbolsStore = shared('wks');\nvar Symbol = global.Symbol;\nvar symbolFor = Symbol && Symbol['for'];\nvar createWellKnownSymbol = USE_SYMBOL_AS_UID ? Symbol : Symbol && Symbol.withoutSetter || uid;\n\nmodule.exports = function (name) {\n  if (!hasOwn(WellKnownSymbolsStore, name) || !(NATIVE_SYMBOL || typeof WellKnownSymbolsStore[name] == 'string')) {\n    var description = 'Symbol.' + name;\n    if (NATIVE_SYMBOL && hasOwn(Symbol, name)) {\n      WellKnownSymbolsStore[name] = Symbol[name];\n    } else if (USE_SYMBOL_AS_UID && symbolFor) {\n      WellKnownSymbolsStore[name] = symbolFor(description);\n    } else {\n      WellKnownSymbolsStore[name] = createWellKnownSymbol(description);\n    }\n  } return WellKnownSymbolsStore[name];\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar isArray = require('../internals/is-array');\nvar isConstructor = require('../internals/is-constructor');\nvar isObject = require('../internals/is-object');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar createProperty = require('../internals/create-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\nvar un$Slice = require('../internals/array-slice');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('slice');\n\nvar SPECIES = wellKnownSymbol('species');\nvar Array = global.Array;\nvar max = Math.max;\n\n// `Array.prototype.slice` method\n// https://tc39.es/ecma262/#sec-array.prototype.slice\n// fallback for not array-like ES3 strings and DOM objects\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  slice: function slice(start, end) {\n    var O = toIndexedObject(this);\n    var length = lengthOfArrayLike(O);\n    var k = toAbsoluteIndex(start, length);\n    var fin = toAbsoluteIndex(end === undefined ? length : end, length);\n    // inline `ArraySpeciesCreate` for usage native `Array#slice` where it's possible\n    var Constructor, result, n;\n    if (isArray(O)) {\n      Constructor = O.constructor;\n      // cross-realm fallback\n      if (isConstructor(Constructor) && (Constructor === Array || isArray(Constructor.prototype))) {\n        Constructor = undefined;\n      } else if (isObject(Constructor)) {\n        Constructor = Constructor[SPECIES];\n        if (Constructor === null) Constructor = undefined;\n      }\n      if (Constructor === Array || Constructor === undefined) {\n        return un$Slice(O, k, fin);\n      }\n    }\n    result = new (Constructor === undefined ? Array : Constructor)(max(fin - k, 0));\n    for (n = 0; k < fin; k++, n++) if (k in O) createProperty(result, n, O[k]);\n    result.length = n;\n    return result;\n  }\n});\n","var fails = require('../internals/fails');\n\n// Detect IE8's incomplete defineProperty implementation\nmodule.exports = !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty({}, 1, { get: function () { return 7; } })[1] != 7;\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar fails = require('../internals/fails');\nvar isArray = require('../internals/is-array');\nvar isObject = require('../internals/is-object');\nvar toObject = require('../internals/to-object');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar createProperty = require('../internals/create-property');\nvar arraySpeciesCreate = require('../internals/array-species-create');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar IS_CONCAT_SPREADABLE = wellKnownSymbol('isConcatSpreadable');\nvar MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;\nvar MAXIMUM_ALLOWED_INDEX_EXCEEDED = 'Maximum allowed index exceeded';\nvar TypeError = global.TypeError;\n\n// We can't use this feature detection in V8 since it causes\n// deoptimization and serious performance degradation\n// https://github.com/zloirock/core-js/issues/679\nvar IS_CONCAT_SPREADABLE_SUPPORT = V8_VERSION >= 51 || !fails(function () {\n  var array = [];\n  array[IS_CONCAT_SPREADABLE] = false;\n  return array.concat()[0] !== array;\n});\n\nvar SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('concat');\n\nvar isConcatSpreadable = function (O) {\n  if (!isObject(O)) return false;\n  var spreadable = O[IS_CONCAT_SPREADABLE];\n  return spreadable !== undefined ? !!spreadable : isArray(O);\n};\n\nvar FORCED = !IS_CONCAT_SPREADABLE_SUPPORT || !SPECIES_SUPPORT;\n\n// `Array.prototype.concat` method\n// https://tc39.es/ecma262/#sec-array.prototype.concat\n// with adding support of @@isConcatSpreadable and @@species\n$({ target: 'Array', proto: true, forced: FORCED }, {\n  // eslint-disable-next-line no-unused-vars -- required for `.length`\n  concat: function concat(arg) {\n    var O = toObject(this);\n    var A = arraySpeciesCreate(O, 0);\n    var n = 0;\n    var i, k, length, len, E;\n    for (i = -1, length = arguments.length; i < length; i++) {\n      E = i === -1 ? O : arguments[i];\n      if (isConcatSpreadable(E)) {\n        len = lengthOfArrayLike(E);\n        if (n + len > MAX_SAFE_INTEGER) throw TypeError(MAXIMUM_ALLOWED_INDEX_EXCEEDED);\n        for (k = 0; k < len; k++, n++) if (k in E) createProperty(A, n, E[k]);\n      } else {\n        if (n >= MAX_SAFE_INTEGER) throw TypeError(MAXIMUM_ALLOWED_INDEX_EXCEEDED);\n        createProperty(A, n++, E);\n      }\n    }\n    A.length = n;\n    return A;\n  }\n});\n","var global = require('../internals/global');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\nvar V8_PROTOTYPE_DEFINE_BUG = require('../internals/v8-prototype-define-bug');\nvar anObject = require('../internals/an-object');\nvar toPropertyKey = require('../internals/to-property-key');\n\nvar TypeError = global.TypeError;\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar $defineProperty = Object.defineProperty;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar $getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\nvar ENUMERABLE = 'enumerable';\nvar CONFIGURABLE = 'configurable';\nvar WRITABLE = 'writable';\n\n// `Object.defineProperty` method\n// https://tc39.es/ecma262/#sec-object.defineproperty\nexports.f = DESCRIPTORS ? V8_PROTOTYPE_DEFINE_BUG ? function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPropertyKey(P);\n  anObject(Attributes);\n  if (typeof O === 'function' && P === 'prototype' && 'value' in Attributes && WRITABLE in Attributes && !Attributes[WRITABLE]) {\n    var current = $getOwnPropertyDescriptor(O, P);\n    if (current && current[WRITABLE]) {\n      O[P] = Attributes.value;\n      Attributes = {\n        configurable: CONFIGURABLE in Attributes ? Attributes[CONFIGURABLE] : current[CONFIGURABLE],\n        enumerable: ENUMERABLE in Attributes ? Attributes[ENUMERABLE] : current[ENUMERABLE],\n        writable: false\n      };\n    }\n  } return $defineProperty(O, P, Attributes);\n} : $defineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPropertyKey(P);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return $defineProperty(O, P, Attributes);\n  } catch (error) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","var global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar String = global.String;\nvar TypeError = global.TypeError;\n\n// `Assert: Type(argument) is Object`\nmodule.exports = function (argument) {\n  if (isObject(argument)) return argument;\n  throw TypeError(String(argument) + ' is not an object');\n};\n","var NATIVE_BIND = require('../internals/function-bind-native');\n\nvar call = Function.prototype.call;\n\nmodule.exports = NATIVE_BIND ? call.bind(call) : function () {\n  return call.apply(call, arguments);\n};\n","var isCallable = require('../internals/is-callable');\n\nmodule.exports = function (it) {\n  return typeof it == 'object' ? it !== null : isCallable(it);\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar $find = require('../internals/array-iteration').find;\nvar addToUnscopables = require('../internals/add-to-unscopables');\n\nvar FIND = 'find';\nvar SKIPS_HOLES = true;\n\n// Shouldn't skip holes\nif (FIND in []) Array(1)[FIND](function () { SKIPS_HOLES = false; });\n\n// `Array.prototype.find` method\n// https://tc39.es/ecma262/#sec-array.prototype.find\n$({ target: 'Array', proto: true, forced: SKIPS_HOLES }, {\n  find: function find(callbackfn /* , that = undefined */) {\n    return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables(FIND);\n","var arrayWithoutHoles = require(\"./arrayWithoutHoles.js\");\n\nvar iterableToArray = require(\"./iterableToArray.js\");\n\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray.js\");\n\nvar nonIterableSpread = require(\"./nonIterableSpread.js\");\n\nfunction _toConsumableArray(arr) {\n  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();\n}\n\nmodule.exports = _toConsumableArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var uncurryThis = require('../internals/function-uncurry-this');\nvar toObject = require('../internals/to-object');\n\nvar hasOwnProperty = uncurryThis({}.hasOwnProperty);\n\n// `HasOwnProperty` abstract operation\n// https://tc39.es/ecma262/#sec-hasownproperty\nmodule.exports = Object.hasOwn || function hasOwn(it, key) {\n  return hasOwnProperty(toObject(it), key);\n};\n","'use strict';\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar addToUnscopables = require('../internals/add-to-unscopables');\nvar Iterators = require('../internals/iterators');\nvar InternalStateModule = require('../internals/internal-state');\nvar defineProperty = require('../internals/object-define-property').f;\nvar defineIterator = require('../internals/define-iterator');\nvar IS_PURE = require('../internals/is-pure');\nvar DESCRIPTORS = require('../internals/descriptors');\n\nvar ARRAY_ITERATOR = 'Array Iterator';\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(ARRAY_ITERATOR);\n\n// `Array.prototype.entries` method\n// https://tc39.es/ecma262/#sec-array.prototype.entries\n// `Array.prototype.keys` method\n// https://tc39.es/ecma262/#sec-array.prototype.keys\n// `Array.prototype.values` method\n// https://tc39.es/ecma262/#sec-array.prototype.values\n// `Array.prototype[@@iterator]` method\n// https://tc39.es/ecma262/#sec-array.prototype-@@iterator\n// `CreateArrayIterator` internal method\n// https://tc39.es/ecma262/#sec-createarrayiterator\nmodule.exports = defineIterator(Array, 'Array', function (iterated, kind) {\n  setInternalState(this, {\n    type: ARRAY_ITERATOR,\n    target: toIndexedObject(iterated), // target\n    index: 0,                          // next index\n    kind: kind                         // kind\n  });\n// `%ArrayIteratorPrototype%.next` method\n// https://tc39.es/ecma262/#sec-%arrayiteratorprototype%.next\n}, function () {\n  var state = getInternalState(this);\n  var target = state.target;\n  var kind = state.kind;\n  var index = state.index++;\n  if (!target || index >= target.length) {\n    state.target = undefined;\n    return { value: undefined, done: true };\n  }\n  if (kind == 'keys') return { value: index, done: false };\n  if (kind == 'values') return { value: target[index], done: false };\n  return { value: [index, target[index]], done: false };\n}, 'values');\n\n// argumentsList[@@iterator] is %ArrayProto_values%\n// https://tc39.es/ecma262/#sec-createunmappedargumentsobject\n// https://tc39.es/ecma262/#sec-createmappedargumentsobject\nvar values = Iterators.Arguments = Iterators.Array;\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables('keys');\naddToUnscopables('values');\naddToUnscopables('entries');\n\n// V8 ~ Chrome 45- bug\nif (!IS_PURE && DESCRIPTORS && values.name !== 'values') try {\n  defineProperty(values, 'name', { value: 'values' });\n} catch (error) { /* empty */ }\n","var $ = require('../internals/export');\nvar toObject = require('../internals/to-object');\nvar nativeKeys = require('../internals/object-keys');\nvar fails = require('../internals/fails');\n\nvar FAILS_ON_PRIMITIVES = fails(function () { nativeKeys(1); });\n\n// `Object.keys` method\n// https://tc39.es/ecma262/#sec-object.keys\n$({ target: 'Object', stat: true, forced: FAILS_ON_PRIMITIVES }, {\n  keys: function keys(it) {\n    return nativeKeys(toObject(it));\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar toObject = require('../internals/to-object');\nvar arraySpeciesCreate = require('../internals/array-species-create');\nvar createProperty = require('../internals/create-property');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('splice');\n\nvar TypeError = global.TypeError;\nvar max = Math.max;\nvar min = Math.min;\nvar MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;\nvar MAXIMUM_ALLOWED_LENGTH_EXCEEDED = 'Maximum allowed length exceeded';\n\n// `Array.prototype.splice` method\n// https://tc39.es/ecma262/#sec-array.prototype.splice\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  splice: function splice(start, deleteCount /* , ...items */) {\n    var O = toObject(this);\n    var len = lengthOfArrayLike(O);\n    var actualStart = toAbsoluteIndex(start, len);\n    var argumentsLength = arguments.length;\n    var insertCount, actualDeleteCount, A, k, from, to;\n    if (argumentsLength === 0) {\n      insertCount = actualDeleteCount = 0;\n    } else if (argumentsLength === 1) {\n      insertCount = 0;\n      actualDeleteCount = len - actualStart;\n    } else {\n      insertCount = argumentsLength - 2;\n      actualDeleteCount = min(max(toIntegerOrInfinity(deleteCount), 0), len - actualStart);\n    }\n    if (len + insertCount - actualDeleteCount > MAX_SAFE_INTEGER) {\n      throw TypeError(MAXIMUM_ALLOWED_LENGTH_EXCEEDED);\n    }\n    A = arraySpeciesCreate(O, actualDeleteCount);\n    for (k = 0; k < actualDeleteCount; k++) {\n      from = actualStart + k;\n      if (from in O) createProperty(A, k, O[from]);\n    }\n    A.length = actualDeleteCount;\n    if (insertCount < actualDeleteCount) {\n      for (k = actualStart; k < len - actualDeleteCount; k++) {\n        from = k + actualDeleteCount;\n        to = k + insertCount;\n        if (from in O) O[to] = O[from];\n        else delete O[to];\n      }\n      for (k = len; k > len - actualDeleteCount + insertCount; k--) delete O[k - 1];\n    } else if (insertCount > actualDeleteCount) {\n      for (k = len - actualDeleteCount; k > actualStart; k--) {\n        from = k + actualDeleteCount - 1;\n        to = k + insertCount - 1;\n        if (from in O) O[to] = O[from];\n        else delete O[to];\n      }\n    }\n    for (k = 0; k < insertCount; k++) {\n      O[k + actualStart] = arguments[k + 2];\n    }\n    O.length = len - actualDeleteCount + insertCount;\n    return A;\n  }\n});\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isForced = require('../internals/is-forced');\nvar redefine = require('../internals/redefine');\nvar hasOwn = require('../internals/has-own-property');\nvar inheritIfRequired = require('../internals/inherit-if-required');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar isSymbol = require('../internals/is-symbol');\nvar toPrimitive = require('../internals/to-primitive');\nvar fails = require('../internals/fails');\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar defineProperty = require('../internals/object-define-property').f;\nvar thisNumberValue = require('../internals/this-number-value');\nvar trim = require('../internals/string-trim').trim;\n\nvar NUMBER = 'Number';\nvar NativeNumber = global[NUMBER];\nvar NumberPrototype = NativeNumber.prototype;\nvar TypeError = global.TypeError;\nvar arraySlice = uncurryThis(''.slice);\nvar charCodeAt = uncurryThis(''.charCodeAt);\n\n// `ToNumeric` abstract operation\n// https://tc39.es/ecma262/#sec-tonumeric\nvar toNumeric = function (value) {\n  var primValue = toPrimitive(value, 'number');\n  return typeof primValue == 'bigint' ? primValue : toNumber(primValue);\n};\n\n// `ToNumber` abstract operation\n// https://tc39.es/ecma262/#sec-tonumber\nvar toNumber = function (argument) {\n  var it = toPrimitive(argument, 'number');\n  var first, third, radix, maxCode, digits, length, index, code;\n  if (isSymbol(it)) throw TypeError('Cannot convert a Symbol value to a number');\n  if (typeof it == 'string' && it.length > 2) {\n    it = trim(it);\n    first = charCodeAt(it, 0);\n    if (first === 43 || first === 45) {\n      third = charCodeAt(it, 2);\n      if (third === 88 || third === 120) return NaN; // Number('+0x1') should be NaN, old V8 fix\n    } else if (first === 48) {\n      switch (charCodeAt(it, 1)) {\n        case 66: case 98: radix = 2; maxCode = 49; break; // fast equal of /^0b[01]+$/i\n        case 79: case 111: radix = 8; maxCode = 55; break; // fast equal of /^0o[0-7]+$/i\n        default: return +it;\n      }\n      digits = arraySlice(it, 2);\n      length = digits.length;\n      for (index = 0; index < length; index++) {\n        code = charCodeAt(digits, index);\n        // parseInt parses a string to a first unavailable symbol\n        // but ToNumber should return NaN if a string contains unavailable symbols\n        if (code < 48 || code > maxCode) return NaN;\n      } return parseInt(digits, radix);\n    }\n  } return +it;\n};\n\n// `Number` constructor\n// https://tc39.es/ecma262/#sec-number-constructor\nif (isForced(NUMBER, !NativeNumber(' 0o1') || !NativeNumber('0b1') || NativeNumber('+0x1'))) {\n  var NumberWrapper = function Number(value) {\n    var n = arguments.length < 1 ? 0 : NativeNumber(toNumeric(value));\n    var dummy = this;\n    // check on 1..constructor(foo) case\n    return isPrototypeOf(NumberPrototype, dummy) && fails(function () { thisNumberValue(dummy); })\n      ? inheritIfRequired(Object(n), dummy, NumberWrapper) : n;\n  };\n  for (var keys = DESCRIPTORS ? getOwnPropertyNames(NativeNumber) : (\n    // ES3:\n    'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +\n    // ES2015 (in case, if modules with ES2015 Number statics required before):\n    'EPSILON,MAX_SAFE_INTEGER,MIN_SAFE_INTEGER,isFinite,isInteger,isNaN,isSafeInteger,parseFloat,parseInt,' +\n    // ESNext\n    'fromString,range'\n  ).split(','), j = 0, key; keys.length > j; j++) {\n    if (hasOwn(NativeNumber, key = keys[j]) && !hasOwn(NumberWrapper, key)) {\n      defineProperty(NumberWrapper, key, getOwnPropertyDescriptor(NativeNumber, key));\n    }\n  }\n  NumberWrapper.prototype = NumberPrototype;\n  NumberPrototype.constructor = NumberWrapper;\n  redefine(global, NUMBER, NumberWrapper);\n}\n","var global = require('../internals/global');\nvar DOMIterables = require('../internals/dom-iterables');\nvar DOMTokenListPrototype = require('../internals/dom-token-list-prototype');\nvar ArrayIteratorMethods = require('../modules/es.array.iterator');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar ArrayValues = ArrayIteratorMethods.values;\n\nvar handlePrototype = function (CollectionPrototype, COLLECTION_NAME) {\n  if (CollectionPrototype) {\n    // some Chrome versions have non-configurable methods on DOMTokenList\n    if (CollectionPrototype[ITERATOR] !== ArrayValues) try {\n      createNonEnumerableProperty(CollectionPrototype, ITERATOR, ArrayValues);\n    } catch (error) {\n      CollectionPrototype[ITERATOR] = ArrayValues;\n    }\n    if (!CollectionPrototype[TO_STRING_TAG]) {\n      createNonEnumerableProperty(CollectionPrototype, TO_STRING_TAG, COLLECTION_NAME);\n    }\n    if (DOMIterables[COLLECTION_NAME]) for (var METHOD_NAME in ArrayIteratorMethods) {\n      // some Chrome versions have non-configurable methods on DOMTokenList\n      if (CollectionPrototype[METHOD_NAME] !== ArrayIteratorMethods[METHOD_NAME]) try {\n        createNonEnumerableProperty(CollectionPrototype, METHOD_NAME, ArrayIteratorMethods[METHOD_NAME]);\n      } catch (error) {\n        CollectionPrototype[METHOD_NAME] = ArrayIteratorMethods[METHOD_NAME];\n      }\n    }\n  }\n};\n\nfor (var COLLECTION_NAME in DOMIterables) {\n  handlePrototype(global[COLLECTION_NAME] && global[COLLECTION_NAME].prototype, COLLECTION_NAME);\n}\n\nhandlePrototype(DOMTokenListPrototype, 'DOMTokenList');\n","function _extends() {\n  module.exports = _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n  return _extends.apply(this, arguments);\n}\n\nmodule.exports = _extends, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","/**\n * @license Complex.js v2.1.0 12/05/2020\n *\n * Copyright (c) 2020, Robert Eisele (robert@xarg.org)\n * Dual licensed under the MIT or GPL Version 2 licenses.\n **/\n\n/**\n *\n * This class allows the manipulation of complex numbers.\n * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.\n *\n * Object form\n * { re: <real>, im: <imaginary> }\n * { arg: <angle>, abs: <radius> }\n * { phi: <angle>, r: <radius> }\n *\n * Array / Vector form\n * [ real, imaginary ]\n *\n * Double form\n * 99.3 - Single double value\n *\n * String form\n * '23.1337' - Simple real number\n * '15+3i' - a simple complex number\n * '3-i' - a simple complex number\n *\n * Example:\n *\n * var c = new Complex('99.3+8i');\n * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);\n *\n */\n\n(function(root) {\n\n  'use strict';\n\n  var cosh = function(x) {\n    return (Math.exp(x) + Math.exp(-x)) * 0.5;\n  };\n\n  var sinh = function(x) {\n    return (Math.exp(x) - Math.exp(-x)) * 0.5;\n  };\n\n  /**\n   * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).\n   *\n   * @param {number} x\n   * @returns {number} cos(x) - 1\n   */\n  var cosm1 = function(x) {\n\n    var b = Math.PI / 4;\n    if (-b > x || x > b) {\n      return Math.cos(x) - 1.0;\n    }\n\n    /* Calculate horner form of polynomial of taylor series in Q\n    var fac = 1, alt = 1, pol = {};\n    for (var i = 0; i <= 16; i++) {\n      fac*= i || 1;\n      if (i % 2 == 0) {\n        pol[i] = new Fraction(1, alt * fac);\n        alt = -alt;\n      }\n    }\n    console.log(new Polynomial(pol).toHorner()); // (((((((1/20922789888000x^2-1/87178291200)x^2+1/479001600)x^2-1/3628800)x^2+1/40320)x^2-1/720)x^2+1/24)x^2-1/2)x^2+1\n    */\n\n    var xx = x * x;\n    return xx * (\n      xx * (\n        xx * (\n          xx * (\n            xx * (\n              xx * (\n                xx * (\n                  xx / 20922789888000\n                  - 1 / 87178291200)\n                + 1 / 479001600)\n              - 1 / 3628800)\n            + 1 / 40320)\n          - 1 / 720)\n        + 1 / 24)\n      - 1 / 2);\n  };\n\n  var hypot = function(x, y) {\n\n    var a = Math.abs(x);\n    var b = Math.abs(y);\n\n    if (a < 3000 && b < 3000) {\n      return Math.sqrt(a * a + b * b);\n    }\n\n    if (a < b) {\n      a = b;\n      b = x / y;\n    } else {\n      b = y / x;\n    }\n    return a * Math.sqrt(1 + b * b);\n  };\n\n  var parser_exit = function() {\n    throw SyntaxError('Invalid Param');\n  };\n\n  /**\n   * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows\n   *\n   * @param {number} a\n   * @param {number} b\n   * @returns {number}\n   */\n  function logHypot(a, b) {\n\n    var _a = Math.abs(a);\n    var _b = Math.abs(b);\n\n    if (a === 0) {\n      return Math.log(_b);\n    }\n\n    if (b === 0) {\n      return Math.log(_a);\n    }\n\n    if (_a < 3000 && _b < 3000) {\n      return Math.log(a * a + b * b) * 0.5;\n    }\n\n    /* I got 4 ideas to compute this property without overflow:\n     *\n     * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate\n     *\n     * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)\n\n     Math.log(a * a + b * b) / 2\n\n     *\n     *\n     * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)\n\n     var fn = function(a, b) {\n     a = Math.abs(a);\n     b = Math.abs(b);\n     var t = Math.min(a, b);\n     a = Math.max(a, b);\n     t = t / a;\n\n     return Math.log(a) + Math.log(1 + t * t) / 2;\n     };\n\n     * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)\n\n     Math.log(a / Math.cos(Math.atan2(b, a)))\n\n     * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)\n\n     Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))\n\n     */\n\n     a = a / 2;\n     b = b / 2;\n\n    return 0.5 * Math.log(a * a + b * b) + Math.LN2;\n  }\n\n  var parse = function(a, b) {\n\n    var z = { 're': 0, 'im': 0 };\n\n    if (a === undefined || a === null) {\n      z['re'] =\n      z['im'] = 0;\n    } else if (b !== undefined) {\n      z['re'] = a;\n      z['im'] = b;\n    } else\n      switch (typeof a) {\n\n        case 'object':\n\n          if ('im' in a && 're' in a) {\n            z['re'] = a['re'];\n            z['im'] = a['im'];\n          } else if ('abs' in a && 'arg' in a) {\n            if (!Number.isFinite(a['abs']) && Number.isFinite(a['arg'])) {\n              return Complex['INFINITY'];\n            }\n            z['re'] = a['abs'] * Math.cos(a['arg']);\n            z['im'] = a['abs'] * Math.sin(a['arg']);\n          } else if ('r' in a && 'phi' in a) {\n            if (!Number.isFinite(a['r']) && Number.isFinite(a['phi'])) {\n              return Complex['INFINITY'];\n            }\n            z['re'] = a['r'] * Math.cos(a['phi']);\n            z['im'] = a['r'] * Math.sin(a['phi']);\n          } else if (a.length === 2) { // Quick array check\n            z['re'] = a[0];\n            z['im'] = a[1];\n          } else {\n            parser_exit();\n          }\n          break;\n\n        case 'string':\n\n          z['im'] = /* void */\n          z['re'] = 0;\n\n          var tokens = a.match(/\\d+\\.?\\d*e[+-]?\\d+|\\d+\\.?\\d*|\\.\\d+|./g);\n          var plus = 1;\n          var minus = 0;\n\n          if (tokens === null) {\n            parser_exit();\n          }\n\n          for (var i = 0; i < tokens.length; i++) {\n\n            var c = tokens[i];\n\n            if (c === ' ' || c === '\\t' || c === '\\n') {\n              /* void */\n            } else if (c === '+') {\n              plus++;\n            } else if (c === '-') {\n              minus++;\n            } else if (c === 'i' || c === 'I') {\n\n              if (plus + minus === 0) {\n                parser_exit();\n              }\n\n              if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {\n                z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);\n                i++;\n              } else {\n                z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');\n              }\n              plus = minus = 0;\n\n            } else {\n\n              if (plus + minus === 0 || isNaN(c)) {\n                parser_exit();\n              }\n\n              if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {\n                z['im'] += parseFloat((minus % 2 ? '-' : '') + c);\n                i++;\n              } else {\n                z['re'] += parseFloat((minus % 2 ? '-' : '') + c);\n              }\n              plus = minus = 0;\n            }\n          }\n\n          // Still something on the stack\n          if (plus + minus > 0) {\n            parser_exit();\n          }\n          break;\n\n        case 'number':\n          z['im'] = 0;\n          z['re'] = a;\n          break;\n\n        default:\n          parser_exit();\n      }\n\n    if (isNaN(z['re']) || isNaN(z['im'])) {\n      // If a calculation is NaN, we treat it as NaN and don't throw\n      //parser_exit();\n    }\n\n    return z;\n  };\n\n  /**\n   * @constructor\n   * @returns {Complex}\n   */\n  function Complex(a, b) {\n\n    if (!(this instanceof Complex)) {\n      return new Complex(a, b);\n    }\n\n    var z = parse(a, b);\n\n    this['re'] = z['re'];\n    this['im'] = z['im'];\n  }\n\n  Complex.prototype = {\n\n    're': 0,\n    'im': 0,\n\n    /**\n     * Calculates the sign of a complex number, which is a normalized complex\n     *\n     * @returns {Complex}\n     */\n    'sign': function() {\n\n      var abs = this['abs']();\n\n      return new Complex(\n        this['re'] / abs,\n        this['im'] / abs);\n    },\n\n    /**\n     * Adds two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'add': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // Infinity + Infinity = NaN\n      if (this['isInfinite']() && z['isInfinite']()) {\n        return Complex['NAN'];\n      }\n\n      // Infinity + z = Infinity { where z != Infinity }\n      if (this['isInfinite']() || z['isInfinite']()) {\n        return Complex['INFINITY'];\n      }\n\n      return new Complex(\n        this['re'] + z['re'],\n        this['im'] + z['im']);\n    },\n\n    /**\n     * Subtracts two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'sub': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // Infinity - Infinity = NaN\n      if (this['isInfinite']() && z['isInfinite']()) {\n        return Complex['NAN'];\n      }\n\n      // Infinity - z = Infinity { where z != Infinity }\n      if (this['isInfinite']() || z['isInfinite']()) {\n        return Complex['INFINITY'];\n      }\n\n      return new Complex(\n        this['re'] - z['re'],\n        this['im'] - z['im']);\n    },\n\n    /**\n     * Multiplies two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'mul': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // Infinity * 0 = NaN\n      if ((this['isInfinite']() && z['isZero']()) || (this['isZero']() && z['isInfinite']())) {\n        return Complex['NAN'];\n      }\n\n      // Infinity * z = Infinity { where z != 0 }\n      if (this['isInfinite']() || z['isInfinite']()) {\n        return Complex['INFINITY'];\n      }\n\n      // Short circuit for real values\n      if (z['im'] === 0 && this['im'] === 0) {\n        return new Complex(this['re'] * z['re'], 0);\n      }\n\n      return new Complex(\n        this['re'] * z['re'] - this['im'] * z['im'],\n        this['re'] * z['im'] + this['im'] * z['re']);\n    },\n\n    /**\n     * Divides two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'div': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // 0 / 0 = NaN and Infinity / Infinity = NaN\n      if ((this['isZero']() && z['isZero']()) || (this['isInfinite']() && z['isInfinite']())) {\n        return Complex['NAN'];\n      }\n\n      // Infinity / 0 = Infinity\n      if (this['isInfinite']() || z['isZero']()) {\n        return Complex['INFINITY'];\n      }\n\n      // 0 / Infinity = 0\n      if (this['isZero']() || z['isInfinite']()) {\n        return Complex['ZERO'];\n      }\n\n      a = this['re'];\n      b = this['im'];\n\n      var c = z['re'];\n      var d = z['im'];\n      var t, x;\n\n      if (0 === d) {\n        // Divisor is real\n        return new Complex(a / c, b / c);\n      }\n\n      if (Math.abs(c) < Math.abs(d)) {\n\n        x = c / d;\n        t = c * x + d;\n\n        return new Complex(\n          (a * x + b) / t,\n          (b * x - a) / t);\n\n      } else {\n\n        x = d / c;\n        t = d * x + c;\n\n        return new Complex(\n          (a + b * x) / t,\n          (b - a * x) / t);\n      }\n    },\n\n    /**\n     * Calculate the power of two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'pow': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      a = this['re'];\n      b = this['im'];\n\n      if (z['isZero']()) {\n        return Complex['ONE'];\n      }\n\n      // If the exponent is real\n      if (z['im'] === 0) {\n\n        if (b === 0 && a > 0) {\n\n          return new Complex(Math.pow(a, z['re']), 0);\n\n        } else if (a === 0) { // If base is fully imaginary\n\n          switch ((z['re'] % 4 + 4) % 4) {\n            case 0:\n              return new Complex(Math.pow(b, z['re']), 0);\n            case 1:\n              return new Complex(0, Math.pow(b, z['re']));\n            case 2:\n              return new Complex(-Math.pow(b, z['re']), 0);\n            case 3:\n              return new Complex(0, -Math.pow(b, z['re']));\n          }\n        }\n      }\n\n      /* I couldn't find a good formula, so here is a derivation and optimization\n       *\n       * z_1^z_2 = (a + bi)^(c + di)\n       *         = exp((c + di) * log(a + bi)\n       *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))\n       * =>...\n       * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n       * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n       *\n       * =>...\n       * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n       * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n       *\n       * =>\n       * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))\n       * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))\n       *\n       */\n\n      if (a === 0 && b === 0 && z['re'] > 0 && z['im'] >= 0) {\n        return Complex['ZERO'];\n      }\n\n      var arg = Math.atan2(b, a);\n      var loh = logHypot(a, b);\n\n      a = Math.exp(z['re'] * loh - z['im'] * arg);\n      b = z['im'] * loh + z['re'] * arg;\n      return new Complex(\n        a * Math.cos(b),\n        a * Math.sin(b));\n    },\n\n    /**\n     * Calculate the complex square root\n     *\n     * @returns {Complex}\n     */\n    'sqrt': function() {\n\n      var a = this['re'];\n      var b = this['im'];\n      var r = this['abs']();\n\n      var re, im;\n\n      if (a >= 0) {\n\n        if (b === 0) {\n          return new Complex(Math.sqrt(a), 0);\n        }\n\n        re = 0.5 * Math.sqrt(2.0 * (r + a));\n      } else {\n        re = Math.abs(b) / Math.sqrt(2 * (r - a));\n      }\n\n      if (a <= 0) {\n        im = 0.5 * Math.sqrt(2.0 * (r - a));\n      } else {\n        im = Math.abs(b) / Math.sqrt(2 * (r + a));\n      }\n\n      return new Complex(re, b < 0 ? -im : im);\n    },\n\n    /**\n     * Calculate the complex exponent\n     *\n     * @returns {Complex}\n     */\n    'exp': function() {\n\n      var tmp = Math.exp(this['re']);\n\n      if (this['im'] === 0) {\n        //return new Complex(tmp, 0);\n      }\n      return new Complex(\n        tmp * Math.cos(this['im']),\n        tmp * Math.sin(this['im']));\n    },\n\n    /**\n     * Calculate the complex exponent and subtracts one.\n     *\n     * This may be more accurate than `Complex(x).exp().sub(1)` if\n     * `x` is small.\n     *\n     * @returns {Complex}\n     */\n    'expm1': function() {\n\n      /**\n       * exp(a + i*b) - 1\n       = exp(a) * (cos(b) + j*sin(b)) - 1\n       = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)\n       */\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n        Math.expm1(a) * Math.cos(b) + cosm1(b),\n        Math.exp(a) * Math.sin(b));\n    },\n\n    /**\n     * Calculate the natural log\n     *\n     * @returns {Complex}\n     */\n    'log': function() {\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (b === 0 && a > 0) {\n        //return new Complex(Math.log(a), 0);\n      }\n\n      return new Complex(\n        logHypot(a, b),\n        Math.atan2(b, a));\n    },\n\n    /**\n     * Calculate the magnitude of the complex number\n     *\n     * @returns {number}\n     */\n    'abs': function() {\n\n      return hypot(this['re'], this['im']);\n    },\n\n    /**\n     * Calculate the angle of the complex number\n     *\n     * @returns {number}\n     */\n    'arg': function() {\n\n      return Math.atan2(this['im'], this['re']);\n    },\n\n    /**\n     * Calculate the sine of the complex number\n     *\n     * @returns {Complex}\n     */\n    'sin': function() {\n\n      // sin(z) = ( e^iz - e^-iz ) / 2i \n      //        = sin(a)cosh(b) + i cos(a)sinh(b)\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n        Math.sin(a) * cosh(b),\n        Math.cos(a) * sinh(b));\n    },\n\n    /**\n     * Calculate the cosine\n     *\n     * @returns {Complex}\n     */\n    'cos': function() {\n\n      // cos(z) = ( e^iz + e^-iz ) / 2 \n      //        = cos(a)cosh(b) - i sin(a)sinh(b)\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n        Math.cos(a) * cosh(b),\n        -Math.sin(a) * sinh(b));\n    },\n\n    /**\n     * Calculate the tangent\n     *\n     * @returns {Complex}\n     */\n    'tan': function() {\n\n      // tan(z) = sin(z) / cos(z) \n      //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )\n      //        = ( e^2iz - 1 ) / i( e^2iz + 1 )\n      //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = Math.cos(a) + cosh(b);\n\n      return new Complex(\n        Math.sin(a) / d,\n        sinh(b) / d);\n    },\n\n    /**\n     * Calculate the cotangent\n     *\n     * @returns {Complex}\n     */\n    'cot': function() {\n\n      // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = Math.cos(a) - cosh(b);\n\n      return new Complex(\n        -Math.sin(a) / d,\n        sinh(b) / d);\n    },\n\n    /**\n     * Calculate the secant\n     *\n     * @returns {Complex}\n     */\n    'sec': function() {\n\n      // sec(c) = 2 / (e^(ci) + e^(-ci))\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);\n\n      return new Complex(\n        Math.cos(a) * cosh(b) / d,\n        Math.sin(a) * sinh(b) / d);\n    },\n\n    /**\n     * Calculate the cosecans\n     *\n     * @returns {Complex}\n     */\n    'csc': function() {\n\n      // csc(c) = 2i / (e^(ci) - e^(-ci))\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);\n\n      return new Complex(\n        Math.sin(a) * cosh(b) / d,\n        -Math.cos(a) * sinh(b) / d);\n    },\n\n    /**\n     * Calculate the complex arcus sinus\n     *\n     * @returns {Complex}\n     */\n    'asin': function() {\n\n      // asin(c) = -i * log(ci + sqrt(1 - c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var t1 = new Complex(\n        b * b - a * a + 1,\n        -2 * a * b)['sqrt']();\n\n      var t2 = new Complex(\n        t1['re'] - b,\n        t1['im'] + a)['log']();\n\n      return new Complex(t2['im'], -t2['re']);\n    },\n\n    /**\n     * Calculate the complex arcus cosinus\n     *\n     * @returns {Complex}\n     */\n    'acos': function() {\n\n      // acos(c) = i * log(c - i * sqrt(1 - c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var t1 = new Complex(\n        b * b - a * a + 1,\n        -2 * a * b)['sqrt']();\n\n      var t2 = new Complex(\n        t1['re'] - b,\n        t1['im'] + a)['log']();\n\n      return new Complex(Math.PI / 2 - t2['im'], t2['re']);\n    },\n\n    /**\n     * Calculate the complex arcus tangent\n     *\n     * @returns {Complex}\n     */\n    'atan': function() {\n\n      // atan(c) = i / 2 log((i + x) / (i - x))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0) {\n\n        if (b === 1) {\n          return new Complex(0, Infinity);\n        }\n\n        if (b === -1) {\n          return new Complex(0, -Infinity);\n        }\n      }\n\n      var d = a * a + (1.0 - b) * (1.0 - b);\n\n      var t1 = new Complex(\n        (1 - b * b - a * a) / d,\n        -2 * a / d).log();\n\n      return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);\n    },\n\n    /**\n     * Calculate the complex arcus cotangent\n     *\n     * @returns {Complex}\n     */\n    'acot': function() {\n\n      // acot(c) = i / 2 log((c - i) / (c + i))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (b === 0) {\n        return new Complex(Math.atan2(1, a), 0);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n        ? new Complex(\n          a / d,\n          -b / d).atan()\n        : new Complex(\n          (a !== 0) ? a / 0 : 0,\n          (b !== 0) ? -b / 0 : 0).atan();\n    },\n\n    /**\n     * Calculate the complex arcus secant\n     *\n     * @returns {Complex}\n     */\n    'asec': function() {\n\n      // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0 && b === 0) {\n        return new Complex(0, Infinity);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n        ? new Complex(\n          a / d,\n          -b / d).acos()\n        : new Complex(\n          (a !== 0) ? a / 0 : 0,\n          (b !== 0) ? -b / 0 : 0).acos();\n    },\n\n    /**\n     * Calculate the complex arcus cosecans\n     *\n     * @returns {Complex}\n     */\n    'acsc': function() {\n\n      // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0 && b === 0) {\n        return new Complex(Math.PI / 2, Infinity);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n        ? new Complex(\n          a / d,\n          -b / d).asin()\n        : new Complex(\n          (a !== 0) ? a / 0 : 0,\n          (b !== 0) ? -b / 0 : 0).asin();\n    },\n\n    /**\n     * Calculate the complex sinh\n     *\n     * @returns {Complex}\n     */\n    'sinh': function() {\n\n      // sinh(c) = (e^c - e^-c) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n        sinh(a) * Math.cos(b),\n        cosh(a) * Math.sin(b));\n    },\n\n    /**\n     * Calculate the complex cosh\n     *\n     * @returns {Complex}\n     */\n    'cosh': function() {\n\n      // cosh(c) = (e^c + e^-c) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n        cosh(a) * Math.cos(b),\n        sinh(a) * Math.sin(b));\n    },\n\n    /**\n     * Calculate the complex tanh\n     *\n     * @returns {Complex}\n     */\n    'tanh': function() {\n\n      // tanh(c) = (e^c - e^-c) / (e^c + e^-c)\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = cosh(a) + Math.cos(b);\n\n      return new Complex(\n        sinh(a) / d,\n        Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex coth\n     *\n     * @returns {Complex}\n     */\n    'coth': function() {\n\n      // coth(c) = (e^c + e^-c) / (e^c - e^-c)\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = cosh(a) - Math.cos(b);\n\n      return new Complex(\n        sinh(a) / d,\n        -Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex coth\n     *\n     * @returns {Complex}\n     */\n    'csch': function() {\n\n      // csch(c) = 2 / (e^c - e^-c)\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = Math.cos(2 * b) - cosh(2 * a);\n\n      return new Complex(\n        -2 * sinh(a) * Math.cos(b) / d,\n        2 * cosh(a) * Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex sech\n     *\n     * @returns {Complex}\n     */\n    'sech': function() {\n\n      // sech(c) = 2 / (e^c + e^-c)\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = Math.cos(2 * b) + cosh(2 * a);\n\n      return new Complex(\n        2 * cosh(a) * Math.cos(b) / d,\n        -2 * sinh(a) * Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex asinh\n     *\n     * @returns {Complex}\n     */\n    'asinh': function() {\n\n      // asinh(c) = log(c + sqrt(c^2 + 1))\n\n      var tmp = this['im'];\n      this['im'] = -this['re'];\n      this['re'] = tmp;\n      var res = this['asin']();\n\n      this['re'] = -this['im'];\n      this['im'] = tmp;\n      tmp = res['re'];\n\n      res['re'] = -res['im'];\n      res['im'] = tmp;\n      return res;\n    },\n\n    /**\n     * Calculate the complex acosh\n     *\n     * @returns {Complex}\n     */\n    'acosh': function() {\n\n      // acosh(c) = log(c + sqrt(c^2 - 1))\n\n      var res = this['acos']();\n      if (res['im'] <= 0) {\n        var tmp = res['re'];\n        res['re'] = -res['im'];\n        res['im'] = tmp;\n      } else {\n        var tmp = res['im'];\n        res['im'] = -res['re'];\n        res['re'] = tmp;\n      }\n      return res;\n    },\n\n    /**\n     * Calculate the complex atanh\n     *\n     * @returns {Complex}\n     */\n    'atanh': function() {\n\n      // atanh(c) = log((1+c) / (1-c)) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var noIM = a > 1 && b === 0;\n      var oneMinus = 1 - a;\n      var onePlus = 1 + a;\n      var d = oneMinus * oneMinus + b * b;\n\n      var x = (d !== 0)\n        ? new Complex(\n          (onePlus * oneMinus - b * b) / d,\n          (b * oneMinus + onePlus * b) / d)\n        : new Complex(\n          (a !== -1) ? (a / 0) : 0,\n          (b !== 0) ? (b / 0) : 0);\n\n      var temp = x['re'];\n      x['re'] = logHypot(x['re'], x['im']) / 2;\n      x['im'] = Math.atan2(x['im'], temp) / 2;\n      if (noIM) {\n        x['im'] = -x['im'];\n      }\n      return x;\n    },\n\n    /**\n     * Calculate the complex acoth\n     *\n     * @returns {Complex}\n     */\n    'acoth': function() {\n\n      // acoth(c) = log((c+1) / (c-1)) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0 && b === 0) {\n        return new Complex(0, Math.PI / 2);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n        ? new Complex(\n          a / d,\n          -b / d).atanh()\n        : new Complex(\n          (a !== 0) ? a / 0 : 0,\n          (b !== 0) ? -b / 0 : 0).atanh();\n    },\n\n    /**\n     * Calculate the complex acsch\n     *\n     * @returns {Complex}\n     */\n    'acsch': function() {\n\n      // acsch(c) = log((1+sqrt(1+c^2))/c)\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (b === 0) {\n\n        return new Complex(\n          (a !== 0)\n            ? Math.log(a + Math.sqrt(a * a + 1))\n            : Infinity, 0);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n        ? new Complex(\n          a / d,\n          -b / d).asinh()\n        : new Complex(\n          (a !== 0) ? a / 0 : 0,\n          (b !== 0) ? -b / 0 : 0).asinh();\n    },\n\n    /**\n     * Calculate the complex asech\n     *\n     * @returns {Complex}\n     */\n    'asech': function() {\n\n      // asech(c) = log((1+sqrt(1-c^2))/c)\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (this['isZero']()) {\n        return Complex['INFINITY'];\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n        ? new Complex(\n          a / d,\n          -b / d).acosh()\n        : new Complex(\n          (a !== 0) ? a / 0 : 0,\n          (b !== 0) ? -b / 0 : 0).acosh();\n    },\n\n    /**\n     * Calculate the complex inverse 1/z\n     *\n     * @returns {Complex}\n     */\n    'inverse': function() {\n\n      // 1 / 0 = Infinity and 1 / Infinity = 0\n      if (this['isZero']()) {\n        return Complex['INFINITY'];\n      }\n\n      if (this['isInfinite']()) {\n        return Complex['ZERO'];\n      }\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var d = a * a + b * b;\n\n      return new Complex(a / d, -b / d);\n    },\n\n    /**\n     * Returns the complex conjugate\n     *\n     * @returns {Complex}\n     */\n    'conjugate': function() {\n\n      return new Complex(this['re'], -this['im']);\n    },\n\n    /**\n     * Gets the negated complex number\n     *\n     * @returns {Complex}\n     */\n    'neg': function() {\n\n      return new Complex(-this['re'], -this['im']);\n    },\n\n    /**\n     * Ceils the actual complex number\n     *\n     * @returns {Complex}\n     */\n    'ceil': function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      return new Complex(\n        Math.ceil(this['re'] * places) / places,\n        Math.ceil(this['im'] * places) / places);\n    },\n\n    /**\n     * Floors the actual complex number\n     *\n     * @returns {Complex}\n     */\n    'floor': function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      return new Complex(\n        Math.floor(this['re'] * places) / places,\n        Math.floor(this['im'] * places) / places);\n    },\n\n    /**\n     * Ceils the actual complex number\n     *\n     * @returns {Complex}\n     */\n    'round': function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      return new Complex(\n        Math.round(this['re'] * places) / places,\n        Math.round(this['im'] * places) / places);\n    },\n\n    /**\n     * Compares two complex numbers\n     *\n     * **Note:** new Complex(Infinity).equals(Infinity) === false\n     *\n     * @returns {boolean}\n     */\n    'equals': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&\n        Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];\n    },\n\n    /**\n     * Clones the actual object\n     *\n     * @returns {Complex}\n     */\n    'clone': function() {\n\n      return new Complex(this['re'], this['im']);\n    },\n\n    /**\n     * Gets a string of the actual complex number\n     *\n     * @returns {string}\n     */\n    'toString': function() {\n\n      var a = this['re'];\n      var b = this['im'];\n      var ret = \"\";\n\n      if (this['isNaN']()) {\n        return 'NaN';\n      }\n\n      if (this['isInfinite']()) {\n        return 'Infinity';\n      }\n\n      if (Math.abs(a) < Complex['EPSILON']) {\n        a = 0;\n      }\n\n      if (Math.abs(b) < Complex['EPSILON']) {\n        b = 0;\n      }\n\n      // If is real number\n      if (b === 0) {\n        return ret + a;\n      }\n\n      if (a !== 0) {\n        ret += a;\n        ret += \" \";\n        if (b < 0) {\n          b = -b;\n          ret += \"-\";\n        } else {\n          ret += \"+\";\n        }\n        ret += \" \";\n      } else if (b < 0) {\n        b = -b;\n        ret += \"-\";\n      }\n\n      if (1 !== b) { // b is the absolute imaginary part\n        ret += b;\n      }\n      return ret + \"i\";\n    },\n\n    /**\n     * Returns the actual number as a vector\n     *\n     * @returns {Array}\n     */\n    'toVector': function() {\n\n      return [this['re'], this['im']];\n    },\n\n    /**\n     * Returns the actual real value of the current object\n     *\n     * @returns {number|null}\n     */\n    'valueOf': function() {\n\n      if (this['im'] === 0) {\n        return this['re'];\n      }\n      return null;\n    },\n\n    /**\n     * Determines whether a complex number is not on the Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isNaN': function() {\n      return isNaN(this['re']) || isNaN(this['im']);\n    },\n\n    /**\n     * Determines whether or not a complex number is at the zero pole of the\n     * Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isZero': function() {\n      return this['im'] === 0 && this['re'] === 0;\n    },\n\n    /**\n     * Determines whether a complex number is not at the infinity pole of the\n     * Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isFinite': function() {\n      return isFinite(this['re']) && isFinite(this['im']);\n    },\n\n    /**\n     * Determines whether or not a complex number is at the infinity pole of the\n     * Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isInfinite': function() {\n      return !(this['isNaN']() || this['isFinite']());\n    }\n  };\n\n  Complex['ZERO'] = new Complex(0, 0);\n  Complex['ONE'] = new Complex(1, 0);\n  Complex['I'] = new Complex(0, 1);\n  Complex['PI'] = new Complex(Math.PI, 0);\n  Complex['E'] = new Complex(Math.E, 0);\n  Complex['INFINITY'] = new Complex(Infinity, Infinity);\n  Complex['NAN'] = new Complex(NaN, NaN);\n  Complex['EPSILON'] = 1e-15;\n\n  if (typeof define === 'function' && define['amd']) {\n    define([], function() {\n      return Complex;\n    });\n  } else if (typeof exports === 'object') {\n    Object.defineProperty(Complex, \"__esModule\", { 'value': true });\n    Complex['default'] = Complex;\n    Complex['Complex'] = Complex;\n    module['exports'] = Complex;\n  } else {\n    root['Complex'] = Complex;\n  }\n\n})(this);\n","var global = require('../internals/global');\nvar classof = require('../internals/classof');\n\nvar String = global.String;\n\nmodule.exports = function (argument) {\n  if (classof(argument) === 'Symbol') throw TypeError('Cannot convert a Symbol value to a string');\n  return String(argument);\n};\n","var global = require('../internals/global');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nvar Object = global.Object;\n\n// `ToObject` abstract operation\n// https://tc39.es/ecma262/#sec-toobject\nmodule.exports = function (argument) {\n  return Object(requireObjectCoercible(argument));\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\nvar hasOwn = require('../internals/has-own-property');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar setGlobal = require('../internals/set-global');\nvar inspectSource = require('../internals/inspect-source');\nvar InternalStateModule = require('../internals/internal-state');\nvar CONFIGURABLE_FUNCTION_NAME = require('../internals/function-name').CONFIGURABLE;\n\nvar getInternalState = InternalStateModule.get;\nvar enforceInternalState = InternalStateModule.enforce;\nvar TEMPLATE = String(String).split('String');\n\n(module.exports = function (O, key, value, options) {\n  var unsafe = options ? !!options.unsafe : false;\n  var simple = options ? !!options.enumerable : false;\n  var noTargetGet = options ? !!options.noTargetGet : false;\n  var name = options && options.name !== undefined ? options.name : key;\n  var state;\n  if (isCallable(value)) {\n    if (String(name).slice(0, 7) === 'Symbol(') {\n      name = '[' + String(name).replace(/^Symbol\\(([^)]*)\\)/, '$1') + ']';\n    }\n    if (!hasOwn(value, 'name') || (CONFIGURABLE_FUNCTION_NAME && value.name !== name)) {\n      createNonEnumerableProperty(value, 'name', name);\n    }\n    state = enforceInternalState(value);\n    if (!state.source) {\n      state.source = TEMPLATE.join(typeof name == 'string' ? name : '');\n    }\n  }\n  if (O === global) {\n    if (simple) O[key] = value;\n    else setGlobal(key, value);\n    return;\n  } else if (!unsafe) {\n    delete O[key];\n  } else if (!noTargetGet && O[key]) {\n    simple = true;\n  }\n  if (simple) O[key] = value;\n  else createNonEnumerableProperty(O, key, value);\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n})(Function.prototype, 'toString', function toString() {\n  return isCallable(this) && getInternalState(this).source || inspectSource(this);\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar $filter = require('../internals/array-iteration').filter;\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('filter');\n\n// `Array.prototype.filter` method\n// https://tc39.es/ecma262/#sec-array.prototype.filter\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  filter: function filter(callbackfn /* , thisArg */) {\n    return $filter(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar apply = require('../internals/function-apply');\nvar call = require('../internals/function-call');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar IS_PURE = require('../internals/is-pure');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\nvar fails = require('../internals/fails');\nvar hasOwn = require('../internals/has-own-property');\nvar isArray = require('../internals/is-array');\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar isSymbol = require('../internals/is-symbol');\nvar anObject = require('../internals/an-object');\nvar toObject = require('../internals/to-object');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPropertyKey = require('../internals/to-property-key');\nvar $toString = require('../internals/to-string');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar nativeObjectCreate = require('../internals/object-create');\nvar objectKeys = require('../internals/object-keys');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertyNamesExternal = require('../internals/object-get-own-property-names-external');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\nvar definePropertiesModule = require('../internals/object-define-properties');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar arraySlice = require('../internals/array-slice');\nvar redefine = require('../internals/redefine');\nvar shared = require('../internals/shared');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar uid = require('../internals/uid');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar wrappedWellKnownSymbolModule = require('../internals/well-known-symbol-wrapped');\nvar defineWellKnownSymbol = require('../internals/define-well-known-symbol');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar InternalStateModule = require('../internals/internal-state');\nvar $forEach = require('../internals/array-iteration').forEach;\n\nvar HIDDEN = sharedKey('hidden');\nvar SYMBOL = 'Symbol';\nvar PROTOTYPE = 'prototype';\nvar TO_PRIMITIVE = wellKnownSymbol('toPrimitive');\n\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(SYMBOL);\n\nvar ObjectPrototype = Object[PROTOTYPE];\nvar $Symbol = global.Symbol;\nvar SymbolPrototype = $Symbol && $Symbol[PROTOTYPE];\nvar TypeError = global.TypeError;\nvar QObject = global.QObject;\nvar $stringify = getBuiltIn('JSON', 'stringify');\nvar nativeGetOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\nvar nativeDefineProperty = definePropertyModule.f;\nvar nativeGetOwnPropertyNames = getOwnPropertyNamesExternal.f;\nvar nativePropertyIsEnumerable = propertyIsEnumerableModule.f;\nvar push = uncurryThis([].push);\n\nvar AllSymbols = shared('symbols');\nvar ObjectPrototypeSymbols = shared('op-symbols');\nvar StringToSymbolRegistry = shared('string-to-symbol-registry');\nvar SymbolToStringRegistry = shared('symbol-to-string-registry');\nvar WellKnownSymbolsStore = shared('wks');\n\n// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173\nvar USE_SETTER = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;\n\n// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687\nvar setSymbolDescriptor = DESCRIPTORS && fails(function () {\n  return nativeObjectCreate(nativeDefineProperty({}, 'a', {\n    get: function () { return nativeDefineProperty(this, 'a', { value: 7 }).a; }\n  })).a != 7;\n}) ? function (O, P, Attributes) {\n  var ObjectPrototypeDescriptor = nativeGetOwnPropertyDescriptor(ObjectPrototype, P);\n  if (ObjectPrototypeDescriptor) delete ObjectPrototype[P];\n  nativeDefineProperty(O, P, Attributes);\n  if (ObjectPrototypeDescriptor && O !== ObjectPrototype) {\n    nativeDefineProperty(ObjectPrototype, P, ObjectPrototypeDescriptor);\n  }\n} : nativeDefineProperty;\n\nvar wrap = function (tag, description) {\n  var symbol = AllSymbols[tag] = nativeObjectCreate(SymbolPrototype);\n  setInternalState(symbol, {\n    type: SYMBOL,\n    tag: tag,\n    description: description\n  });\n  if (!DESCRIPTORS) symbol.description = description;\n  return symbol;\n};\n\nvar $defineProperty = function defineProperty(O, P, Attributes) {\n  if (O === ObjectPrototype) $defineProperty(ObjectPrototypeSymbols, P, Attributes);\n  anObject(O);\n  var key = toPropertyKey(P);\n  anObject(Attributes);\n  if (hasOwn(AllSymbols, key)) {\n    if (!Attributes.enumerable) {\n      if (!hasOwn(O, HIDDEN)) nativeDefineProperty(O, HIDDEN, createPropertyDescriptor(1, {}));\n      O[HIDDEN][key] = true;\n    } else {\n      if (hasOwn(O, HIDDEN) && O[HIDDEN][key]) O[HIDDEN][key] = false;\n      Attributes = nativeObjectCreate(Attributes, { enumerable: createPropertyDescriptor(0, false) });\n    } return setSymbolDescriptor(O, key, Attributes);\n  } return nativeDefineProperty(O, key, Attributes);\n};\n\nvar $defineProperties = function defineProperties(O, Properties) {\n  anObject(O);\n  var properties = toIndexedObject(Properties);\n  var keys = objectKeys(properties).concat($getOwnPropertySymbols(properties));\n  $forEach(keys, function (key) {\n    if (!DESCRIPTORS || call($propertyIsEnumerable, properties, key)) $defineProperty(O, key, properties[key]);\n  });\n  return O;\n};\n\nvar $create = function create(O, Properties) {\n  return Properties === undefined ? nativeObjectCreate(O) : $defineProperties(nativeObjectCreate(O), Properties);\n};\n\nvar $propertyIsEnumerable = function propertyIsEnumerable(V) {\n  var P = toPropertyKey(V);\n  var enumerable = call(nativePropertyIsEnumerable, this, P);\n  if (this === ObjectPrototype && hasOwn(AllSymbols, P) && !hasOwn(ObjectPrototypeSymbols, P)) return false;\n  return enumerable || !hasOwn(this, P) || !hasOwn(AllSymbols, P) || hasOwn(this, HIDDEN) && this[HIDDEN][P]\n    ? enumerable : true;\n};\n\nvar $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(O, P) {\n  var it = toIndexedObject(O);\n  var key = toPropertyKey(P);\n  if (it === ObjectPrototype && hasOwn(AllSymbols, key) && !hasOwn(ObjectPrototypeSymbols, key)) return;\n  var descriptor = nativeGetOwnPropertyDescriptor(it, key);\n  if (descriptor && hasOwn(AllSymbols, key) && !(hasOwn(it, HIDDEN) && it[HIDDEN][key])) {\n    descriptor.enumerable = true;\n  }\n  return descriptor;\n};\n\nvar $getOwnPropertyNames = function getOwnPropertyNames(O) {\n  var names = nativeGetOwnPropertyNames(toIndexedObject(O));\n  var result = [];\n  $forEach(names, function (key) {\n    if (!hasOwn(AllSymbols, key) && !hasOwn(hiddenKeys, key)) push(result, key);\n  });\n  return result;\n};\n\nvar $getOwnPropertySymbols = function getOwnPropertySymbols(O) {\n  var IS_OBJECT_PROTOTYPE = O === ObjectPrototype;\n  var names = nativeGetOwnPropertyNames(IS_OBJECT_PROTOTYPE ? ObjectPrototypeSymbols : toIndexedObject(O));\n  var result = [];\n  $forEach(names, function (key) {\n    if (hasOwn(AllSymbols, key) && (!IS_OBJECT_PROTOTYPE || hasOwn(ObjectPrototype, key))) {\n      push(result, AllSymbols[key]);\n    }\n  });\n  return result;\n};\n\n// `Symbol` constructor\n// https://tc39.es/ecma262/#sec-symbol-constructor\nif (!NATIVE_SYMBOL) {\n  $Symbol = function Symbol() {\n    if (isPrototypeOf(SymbolPrototype, this)) throw TypeError('Symbol is not a constructor');\n    var description = !arguments.length || arguments[0] === undefined ? undefined : $toString(arguments[0]);\n    var tag = uid(description);\n    var setter = function (value) {\n      if (this === ObjectPrototype) call(setter, ObjectPrototypeSymbols, value);\n      if (hasOwn(this, HIDDEN) && hasOwn(this[HIDDEN], tag)) this[HIDDEN][tag] = false;\n      setSymbolDescriptor(this, tag, createPropertyDescriptor(1, value));\n    };\n    if (DESCRIPTORS && USE_SETTER) setSymbolDescriptor(ObjectPrototype, tag, { configurable: true, set: setter });\n    return wrap(tag, description);\n  };\n\n  SymbolPrototype = $Symbol[PROTOTYPE];\n\n  redefine(SymbolPrototype, 'toString', function toString() {\n    return getInternalState(this).tag;\n  });\n\n  redefine($Symbol, 'withoutSetter', function (description) {\n    return wrap(uid(description), description);\n  });\n\n  propertyIsEnumerableModule.f = $propertyIsEnumerable;\n  definePropertyModule.f = $defineProperty;\n  definePropertiesModule.f = $defineProperties;\n  getOwnPropertyDescriptorModule.f = $getOwnPropertyDescriptor;\n  getOwnPropertyNamesModule.f = getOwnPropertyNamesExternal.f = $getOwnPropertyNames;\n  getOwnPropertySymbolsModule.f = $getOwnPropertySymbols;\n\n  wrappedWellKnownSymbolModule.f = function (name) {\n    return wrap(wellKnownSymbol(name), name);\n  };\n\n  if (DESCRIPTORS) {\n    // https://github.com/tc39/proposal-Symbol-description\n    nativeDefineProperty(SymbolPrototype, 'description', {\n      configurable: true,\n      get: function description() {\n        return getInternalState(this).description;\n      }\n    });\n    if (!IS_PURE) {\n      redefine(ObjectPrototype, 'propertyIsEnumerable', $propertyIsEnumerable, { unsafe: true });\n    }\n  }\n}\n\n$({ global: true, wrap: true, forced: !NATIVE_SYMBOL, sham: !NATIVE_SYMBOL }, {\n  Symbol: $Symbol\n});\n\n$forEach(objectKeys(WellKnownSymbolsStore), function (name) {\n  defineWellKnownSymbol(name);\n});\n\n$({ target: SYMBOL, stat: true, forced: !NATIVE_SYMBOL }, {\n  // `Symbol.for` method\n  // https://tc39.es/ecma262/#sec-symbol.for\n  'for': function (key) {\n    var string = $toString(key);\n    if (hasOwn(StringToSymbolRegistry, string)) return StringToSymbolRegistry[string];\n    var symbol = $Symbol(string);\n    StringToSymbolRegistry[string] = symbol;\n    SymbolToStringRegistry[symbol] = string;\n    return symbol;\n  },\n  // `Symbol.keyFor` method\n  // https://tc39.es/ecma262/#sec-symbol.keyfor\n  keyFor: function keyFor(sym) {\n    if (!isSymbol(sym)) throw TypeError(sym + ' is not a symbol');\n    if (hasOwn(SymbolToStringRegistry, sym)) return SymbolToStringRegistry[sym];\n  },\n  useSetter: function () { USE_SETTER = true; },\n  useSimple: function () { USE_SETTER = false; }\n});\n\n$({ target: 'Object', stat: true, forced: !NATIVE_SYMBOL, sham: !DESCRIPTORS }, {\n  // `Object.create` method\n  // https://tc39.es/ecma262/#sec-object.create\n  create: $create,\n  // `Object.defineProperty` method\n  // https://tc39.es/ecma262/#sec-object.defineproperty\n  defineProperty: $defineProperty,\n  // `Object.defineProperties` method\n  // https://tc39.es/ecma262/#sec-object.defineproperties\n  defineProperties: $defineProperties,\n  // `Object.getOwnPropertyDescriptor` method\n  // https://tc39.es/ecma262/#sec-object.getownpropertydescriptors\n  getOwnPropertyDescriptor: $getOwnPropertyDescriptor\n});\n\n$({ target: 'Object', stat: true, forced: !NATIVE_SYMBOL }, {\n  // `Object.getOwnPropertyNames` method\n  // https://tc39.es/ecma262/#sec-object.getownpropertynames\n  getOwnPropertyNames: $getOwnPropertyNames,\n  // `Object.getOwnPropertySymbols` method\n  // https://tc39.es/ecma262/#sec-object.getownpropertysymbols\n  getOwnPropertySymbols: $getOwnPropertySymbols\n});\n\n// Chrome 38 and 39 `Object.getOwnPropertySymbols` fails on primitives\n// https://bugs.chromium.org/p/v8/issues/detail?id=3443\n$({ target: 'Object', stat: true, forced: fails(function () { getOwnPropertySymbolsModule.f(1); }) }, {\n  getOwnPropertySymbols: function getOwnPropertySymbols(it) {\n    return getOwnPropertySymbolsModule.f(toObject(it));\n  }\n});\n\n// `JSON.stringify` method behavior with symbols\n// https://tc39.es/ecma262/#sec-json.stringify\nif ($stringify) {\n  var FORCED_JSON_STRINGIFY = !NATIVE_SYMBOL || fails(function () {\n    var symbol = $Symbol();\n    // MS Edge converts symbol values to JSON as {}\n    return $stringify([symbol]) != '[null]'\n      // WebKit converts symbol values to JSON as null\n      || $stringify({ a: symbol }) != '{}'\n      // V8 throws on boxed symbols\n      || $stringify(Object(symbol)) != '{}';\n  });\n\n  $({ target: 'JSON', stat: true, forced: FORCED_JSON_STRINGIFY }, {\n    // eslint-disable-next-line no-unused-vars -- required for `.length`\n    stringify: function stringify(it, replacer, space) {\n      var args = arraySlice(arguments);\n      var $replacer = replacer;\n      if (!isObject(replacer) && it === undefined || isSymbol(it)) return; // IE8 returns string on undefined\n      if (!isArray(replacer)) replacer = function (key, value) {\n        if (isCallable($replacer)) value = call($replacer, this, key, value);\n        if (!isSymbol(value)) return value;\n      };\n      args[1] = replacer;\n      return apply($stringify, null, args);\n    }\n  });\n}\n\n// `Symbol.prototype[@@toPrimitive]` method\n// https://tc39.es/ecma262/#sec-symbol.prototype-@@toprimitive\nif (!SymbolPrototype[TO_PRIMITIVE]) {\n  var valueOf = SymbolPrototype.valueOf;\n  // eslint-disable-next-line no-unused-vars -- required for .length\n  redefine(SymbolPrototype, TO_PRIMITIVE, function (hint) {\n    // TODO: improve hint logic\n    return call(valueOf, this);\n  });\n}\n// `Symbol.prototype[@@toStringTag]` property\n// https://tc39.es/ecma262/#sec-symbol.prototype-@@tostringtag\nsetToStringTag($Symbol, SYMBOL);\n\nhiddenKeys[HIDDEN] = true;\n","module.exports = function() {\n\tthrow new Error(\"define cannot be used indirect\");\n};\n","// toObject with fallback for non-array-like ES3 strings\nvar IndexedObject = require('../internals/indexed-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nmodule.exports = function (it) {\n  return IndexedObject(requireObjectCoercible(it));\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar aCallable = require('../internals/a-callable');\nvar toObject = require('../internals/to-object');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar toString = require('../internals/to-string');\nvar fails = require('../internals/fails');\nvar internalSort = require('../internals/array-sort');\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\nvar FF = require('../internals/engine-ff-version');\nvar IE_OR_EDGE = require('../internals/engine-is-ie-or-edge');\nvar V8 = require('../internals/engine-v8-version');\nvar WEBKIT = require('../internals/engine-webkit-version');\n\nvar test = [];\nvar un$Sort = uncurryThis(test.sort);\nvar push = uncurryThis(test.push);\n\n// IE8-\nvar FAILS_ON_UNDEFINED = fails(function () {\n  test.sort(undefined);\n});\n// V8 bug\nvar FAILS_ON_NULL = fails(function () {\n  test.sort(null);\n});\n// Old WebKit\nvar STRICT_METHOD = arrayMethodIsStrict('sort');\n\nvar STABLE_SORT = !fails(function () {\n  // feature detection can be too slow, so check engines versions\n  if (V8) return V8 < 70;\n  if (FF && FF > 3) return;\n  if (IE_OR_EDGE) return true;\n  if (WEBKIT) return WEBKIT < 603;\n\n  var result = '';\n  var code, chr, value, index;\n\n  // generate an array with more 512 elements (Chakra and old V8 fails only in this case)\n  for (code = 65; code < 76; code++) {\n    chr = String.fromCharCode(code);\n\n    switch (code) {\n      case 66: case 69: case 70: case 72: value = 3; break;\n      case 68: case 71: value = 4; break;\n      default: value = 2;\n    }\n\n    for (index = 0; index < 47; index++) {\n      test.push({ k: chr + index, v: value });\n    }\n  }\n\n  test.sort(function (a, b) { return b.v - a.v; });\n\n  for (index = 0; index < test.length; index++) {\n    chr = test[index].k.charAt(0);\n    if (result.charAt(result.length - 1) !== chr) result += chr;\n  }\n\n  return result !== 'DGBEFHACIJK';\n});\n\nvar FORCED = FAILS_ON_UNDEFINED || !FAILS_ON_NULL || !STRICT_METHOD || !STABLE_SORT;\n\nvar getSortCompare = function (comparefn) {\n  return function (x, y) {\n    if (y === undefined) return -1;\n    if (x === undefined) return 1;\n    if (comparefn !== undefined) return +comparefn(x, y) || 0;\n    return toString(x) > toString(y) ? 1 : -1;\n  };\n};\n\n// `Array.prototype.sort` method\n// https://tc39.es/ecma262/#sec-array.prototype.sort\n$({ target: 'Array', proto: true, forced: FORCED }, {\n  sort: function sort(comparefn) {\n    if (comparefn !== undefined) aCallable(comparefn);\n\n    var array = toObject(this);\n\n    if (STABLE_SORT) return comparefn === undefined ? un$Sort(array) : un$Sort(array, comparefn);\n\n    var items = [];\n    var arrayLength = lengthOfArrayLike(array);\n    var itemsLength, index;\n\n    for (index = 0; index < arrayLength; index++) {\n      if (index in array) push(items, array[index]);\n    }\n\n    internalSort(items, getSortCompare(comparefn));\n\n    itemsLength = items.length;\n    index = 0;\n\n    while (index < itemsLength) array[index] = items[index++];\n    while (index < arrayLength) delete array[index++];\n\n    return array;\n  }\n});\n","'use strict';\nvar charAt = require('../internals/string-multibyte').charAt;\nvar toString = require('../internals/to-string');\nvar InternalStateModule = require('../internals/internal-state');\nvar defineIterator = require('../internals/define-iterator');\n\nvar STRING_ITERATOR = 'String Iterator';\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(STRING_ITERATOR);\n\n// `String.prototype[@@iterator]` method\n// https://tc39.es/ecma262/#sec-string.prototype-@@iterator\ndefineIterator(String, 'String', function (iterated) {\n  setInternalState(this, {\n    type: STRING_ITERATOR,\n    string: toString(iterated),\n    index: 0\n  });\n// `%StringIteratorPrototype%.next` method\n// https://tc39.es/ecma262/#sec-%stringiteratorprototype%.next\n}, function next() {\n  var state = getInternalState(this);\n  var string = state.string;\n  var index = state.index;\n  var point;\n  if (index >= string.length) return { value: undefined, done: true };\n  point = charAt(string, index);\n  state.index += point.length;\n  return { value: point, done: false };\n});\n","var uncurryThis = require('../internals/function-uncurry-this');\n\nvar toString = uncurryThis({}.toString);\nvar stringSlice = uncurryThis(''.slice);\n\nmodule.exports = function (it) {\n  return stringSlice(toString(it), 8, -1);\n};\n","var NATIVE_WEAK_MAP = require('../internals/native-weak-map');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isObject = require('../internals/is-object');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar hasOwn = require('../internals/has-own-property');\nvar shared = require('../internals/shared-store');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar OBJECT_ALREADY_INITIALIZED = 'Object already initialized';\nvar TypeError = global.TypeError;\nvar WeakMap = global.WeakMap;\nvar set, get, has;\n\nvar enforce = function (it) {\n  return has(it) ? get(it) : set(it, {});\n};\n\nvar getterFor = function (TYPE) {\n  return function (it) {\n    var state;\n    if (!isObject(it) || (state = get(it)).type !== TYPE) {\n      throw TypeError('Incompatible receiver, ' + TYPE + ' required');\n    } return state;\n  };\n};\n\nif (NATIVE_WEAK_MAP || shared.state) {\n  var store = shared.state || (shared.state = new WeakMap());\n  var wmget = uncurryThis(store.get);\n  var wmhas = uncurryThis(store.has);\n  var wmset = uncurryThis(store.set);\n  set = function (it, metadata) {\n    if (wmhas(store, it)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    wmset(store, it, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return wmget(store, it) || {};\n  };\n  has = function (it) {\n    return wmhas(store, it);\n  };\n} else {\n  var STATE = sharedKey('state');\n  hiddenKeys[STATE] = true;\n  set = function (it, metadata) {\n    if (hasOwn(it, STATE)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    createNonEnumerableProperty(it, STATE, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return hasOwn(it, STATE) ? it[STATE] : {};\n  };\n  has = function (it) {\n    return hasOwn(it, STATE);\n  };\n}\n\nmodule.exports = {\n  set: set,\n  get: get,\n  has: has,\n  enforce: enforce,\n  getterFor: getterFor\n};\n","var toLength = require('../internals/to-length');\n\n// `LengthOfArrayLike` abstract operation\n// https://tc39.es/ecma262/#sec-lengthofarraylike\nmodule.exports = function (obj) {\n  return toLength(obj.length);\n};\n","var $ = require('../internals/export');\nvar global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar apply = require('../internals/function-apply');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar fails = require('../internals/fails');\n\nvar Array = global.Array;\nvar $stringify = getBuiltIn('JSON', 'stringify');\nvar exec = uncurryThis(/./.exec);\nvar charAt = uncurryThis(''.charAt);\nvar charCodeAt = uncurryThis(''.charCodeAt);\nvar replace = uncurryThis(''.replace);\nvar numberToString = uncurryThis(1.0.toString);\n\nvar tester = /[\\uD800-\\uDFFF]/g;\nvar low = /^[\\uD800-\\uDBFF]$/;\nvar hi = /^[\\uDC00-\\uDFFF]$/;\n\nvar fix = function (match, offset, string) {\n  var prev = charAt(string, offset - 1);\n  var next = charAt(string, offset + 1);\n  if ((exec(low, match) && !exec(hi, next)) || (exec(hi, match) && !exec(low, prev))) {\n    return '\\\\u' + numberToString(charCodeAt(match, 0), 16);\n  } return match;\n};\n\nvar FORCED = fails(function () {\n  return $stringify('\\uDF06\\uD834') !== '\"\\\\udf06\\\\ud834\"'\n    || $stringify('\\uDEAD') !== '\"\\\\udead\"';\n});\n\nif ($stringify) {\n  // `JSON.stringify` method\n  // https://tc39.es/ecma262/#sec-json.stringify\n  // https://github.com/tc39/proposal-well-formed-stringify\n  $({ target: 'JSON', stat: true, forced: FORCED }, {\n    // eslint-disable-next-line no-unused-vars -- required for `.length`\n    stringify: function stringify(it, replacer, space) {\n      for (var i = 0, l = arguments.length, args = Array(l); i < l; i++) args[i] = arguments[i];\n      var result = apply($stringify, null, args);\n      return typeof result == 'string' ? replace(result, tester, fix) : result;\n    }\n  });\n}\n","'use strict';\n// TODO: Remove from `core-js@4` since it's moved to entry points\nrequire('../modules/es.regexp.exec');\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar call = require('../internals/function-call');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\n\nvar DELEGATES_TO_EXEC = function () {\n  var execCalled = false;\n  var re = /[ac]/;\n  re.exec = function () {\n    execCalled = true;\n    return /./.exec.apply(this, arguments);\n  };\n  return re.test('abc') === true && execCalled;\n}();\n\nvar Error = global.Error;\nvar un$Test = uncurryThis(/./.test);\n\n// `RegExp.prototype.test` method\n// https://tc39.es/ecma262/#sec-regexp.prototype.test\n$({ target: 'RegExp', proto: true, forced: !DELEGATES_TO_EXEC }, {\n  test: function (str) {\n    var exec = this.exec;\n    if (!isCallable(exec)) return un$Test(this, str);\n    var result = call(exec, this, str);\n    if (result !== null && !isObject(result)) {\n      throw new Error('RegExp exec method returned something other than an Object or null');\n    }\n    return !!result;\n  }\n});\n","var global = require('../internals/global');\n\nvar TypeError = global.TypeError;\n\n// `RequireObjectCoercible` abstract operation\n// https://tc39.es/ecma262/#sec-requireobjectcoercible\nmodule.exports = function (it) {\n  if (it == undefined) throw TypeError(\"Can't call method on \" + it);\n  return it;\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\n\nvar aFunction = function (argument) {\n  return isCallable(argument) ? argument : undefined;\n};\n\nmodule.exports = function (namespace, method) {\n  return arguments.length < 2 ? aFunction(global[namespace]) : global[namespace] && global[namespace][method];\n};\n","'use strict';\nvar apply = require('../internals/function-apply');\nvar call = require('../internals/function-call');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar fixRegExpWellKnownSymbolLogic = require('../internals/fix-regexp-well-known-symbol-logic');\nvar isRegExp = require('../internals/is-regexp');\nvar anObject = require('../internals/an-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar speciesConstructor = require('../internals/species-constructor');\nvar advanceStringIndex = require('../internals/advance-string-index');\nvar toLength = require('../internals/to-length');\nvar toString = require('../internals/to-string');\nvar getMethod = require('../internals/get-method');\nvar arraySlice = require('../internals/array-slice-simple');\nvar callRegExpExec = require('../internals/regexp-exec-abstract');\nvar regexpExec = require('../internals/regexp-exec');\nvar stickyHelpers = require('../internals/regexp-sticky-helpers');\nvar fails = require('../internals/fails');\n\nvar UNSUPPORTED_Y = stickyHelpers.UNSUPPORTED_Y;\nvar MAX_UINT32 = 0xFFFFFFFF;\nvar min = Math.min;\nvar $push = [].push;\nvar exec = uncurryThis(/./.exec);\nvar push = uncurryThis($push);\nvar stringSlice = uncurryThis(''.slice);\n\n// Chrome 51 has a buggy \"split\" implementation when RegExp#exec !== nativeExec\n// Weex JS has frozen built-in prototypes, so use try / catch wrapper\nvar SPLIT_WORKS_WITH_OVERWRITTEN_EXEC = !fails(function () {\n  // eslint-disable-next-line regexp/no-empty-group -- required for testing\n  var re = /(?:)/;\n  var originalExec = re.exec;\n  re.exec = function () { return originalExec.apply(this, arguments); };\n  var result = 'ab'.split(re);\n  return result.length !== 2 || result[0] !== 'a' || result[1] !== 'b';\n});\n\n// @@split logic\nfixRegExpWellKnownSymbolLogic('split', function (SPLIT, nativeSplit, maybeCallNative) {\n  var internalSplit;\n  if (\n    'abbc'.split(/(b)*/)[1] == 'c' ||\n    // eslint-disable-next-line regexp/no-empty-group -- required for testing\n    'test'.split(/(?:)/, -1).length != 4 ||\n    'ab'.split(/(?:ab)*/).length != 2 ||\n    '.'.split(/(.?)(.?)/).length != 4 ||\n    // eslint-disable-next-line regexp/no-empty-capturing-group, regexp/no-empty-group -- required for testing\n    '.'.split(/()()/).length > 1 ||\n    ''.split(/.?/).length\n  ) {\n    // based on es5-shim implementation, need to rework it\n    internalSplit = function (separator, limit) {\n      var string = toString(requireObjectCoercible(this));\n      var lim = limit === undefined ? MAX_UINT32 : limit >>> 0;\n      if (lim === 0) return [];\n      if (separator === undefined) return [string];\n      // If `separator` is not a regex, use native split\n      if (!isRegExp(separator)) {\n        return call(nativeSplit, string, separator, lim);\n      }\n      var output = [];\n      var flags = (separator.ignoreCase ? 'i' : '') +\n                  (separator.multiline ? 'm' : '') +\n                  (separator.unicode ? 'u' : '') +\n                  (separator.sticky ? 'y' : '');\n      var lastLastIndex = 0;\n      // Make `global` and avoid `lastIndex` issues by working with a copy\n      var separatorCopy = new RegExp(separator.source, flags + 'g');\n      var match, lastIndex, lastLength;\n      while (match = call(regexpExec, separatorCopy, string)) {\n        lastIndex = separatorCopy.lastIndex;\n        if (lastIndex > lastLastIndex) {\n          push(output, stringSlice(string, lastLastIndex, match.index));\n          if (match.length > 1 && match.index < string.length) apply($push, output, arraySlice(match, 1));\n          lastLength = match[0].length;\n          lastLastIndex = lastIndex;\n          if (output.length >= lim) break;\n        }\n        if (separatorCopy.lastIndex === match.index) separatorCopy.lastIndex++; // Avoid an infinite loop\n      }\n      if (lastLastIndex === string.length) {\n        if (lastLength || !exec(separatorCopy, '')) push(output, '');\n      } else push(output, stringSlice(string, lastLastIndex));\n      return output.length > lim ? arraySlice(output, 0, lim) : output;\n    };\n  // Chakra, V8\n  } else if ('0'.split(undefined, 0).length) {\n    internalSplit = function (separator, limit) {\n      return separator === undefined && limit === 0 ? [] : call(nativeSplit, this, separator, limit);\n    };\n  } else internalSplit = nativeSplit;\n\n  return [\n    // `String.prototype.split` method\n    // https://tc39.es/ecma262/#sec-string.prototype.split\n    function split(separator, limit) {\n      var O = requireObjectCoercible(this);\n      var splitter = separator == undefined ? undefined : getMethod(separator, SPLIT);\n      return splitter\n        ? call(splitter, separator, O, limit)\n        : call(internalSplit, toString(O), separator, limit);\n    },\n    // `RegExp.prototype[@@split]` method\n    // https://tc39.es/ecma262/#sec-regexp.prototype-@@split\n    //\n    // NOTE: This cannot be properly polyfilled in engines that don't support\n    // the 'y' flag.\n    function (string, limit) {\n      var rx = anObject(this);\n      var S = toString(string);\n      var res = maybeCallNative(internalSplit, rx, S, limit, internalSplit !== nativeSplit);\n\n      if (res.done) return res.value;\n\n      var C = speciesConstructor(rx, RegExp);\n\n      var unicodeMatching = rx.unicode;\n      var flags = (rx.ignoreCase ? 'i' : '') +\n                  (rx.multiline ? 'm' : '') +\n                  (rx.unicode ? 'u' : '') +\n                  (UNSUPPORTED_Y ? 'g' : 'y');\n\n      // ^(? + rx + ) is needed, in combination with some S slicing, to\n      // simulate the 'y' flag.\n      var splitter = new C(UNSUPPORTED_Y ? '^(?:' + rx.source + ')' : rx, flags);\n      var lim = limit === undefined ? MAX_UINT32 : limit >>> 0;\n      if (lim === 0) return [];\n      if (S.length === 0) return callRegExpExec(splitter, S) === null ? [S] : [];\n      var p = 0;\n      var q = 0;\n      var A = [];\n      while (q < S.length) {\n        splitter.lastIndex = UNSUPPORTED_Y ? 0 : q;\n        var z = callRegExpExec(splitter, UNSUPPORTED_Y ? stringSlice(S, q) : S);\n        var e;\n        if (\n          z === null ||\n          (e = min(toLength(splitter.lastIndex + (UNSUPPORTED_Y ? q : 0)), S.length)) === p\n        ) {\n          q = advanceStringIndex(S, q, unicodeMatching);\n        } else {\n          push(A, stringSlice(S, p, q));\n          if (A.length === lim) return A;\n          for (var i = 1; i <= z.length - 1; i++) {\n            push(A, z[i]);\n            if (A.length === lim) return A;\n          }\n          q = p = e;\n        }\n      }\n      push(A, stringSlice(S, p));\n      return A;\n    }\n  ];\n}, !SPLIT_WORKS_WITH_OVERWRITTEN_EXEC, UNSUPPORTED_Y);\n","// `Symbol.prototype.description` getter\n// https://tc39.es/ecma262/#sec-symbol.prototype.description\n'use strict';\nvar $ = require('../internals/export');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar hasOwn = require('../internals/has-own-property');\nvar isCallable = require('../internals/is-callable');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar toString = require('../internals/to-string');\nvar defineProperty = require('../internals/object-define-property').f;\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\n\nvar NativeSymbol = global.Symbol;\nvar SymbolPrototype = NativeSymbol && NativeSymbol.prototype;\n\nif (DESCRIPTORS && isCallable(NativeSymbol) && (!('description' in SymbolPrototype) ||\n  // Safari 12 bug\n  NativeSymbol().description !== undefined\n)) {\n  var EmptyStringDescriptionStore = {};\n  // wrap Symbol constructor for correct work with undefined description\n  var SymbolWrapper = function Symbol() {\n    var description = arguments.length < 1 || arguments[0] === undefined ? undefined : toString(arguments[0]);\n    var result = isPrototypeOf(SymbolPrototype, this)\n      ? new NativeSymbol(description)\n      // in Edge 13, String(Symbol(undefined)) === 'Symbol(undefined)'\n      : description === undefined ? NativeSymbol() : NativeSymbol(description);\n    if (description === '') EmptyStringDescriptionStore[result] = true;\n    return result;\n  };\n\n  copyConstructorProperties(SymbolWrapper, NativeSymbol);\n  SymbolWrapper.prototype = SymbolPrototype;\n  SymbolPrototype.constructor = SymbolWrapper;\n\n  var NATIVE_SYMBOL = String(NativeSymbol('test')) == 'Symbol(test)';\n  var symbolToString = uncurryThis(SymbolPrototype.toString);\n  var symbolValueOf = uncurryThis(SymbolPrototype.valueOf);\n  var regexp = /^Symbol\\((.*)\\)[^)]+$/;\n  var replace = uncurryThis(''.replace);\n  var stringSlice = uncurryThis(''.slice);\n\n  defineProperty(SymbolPrototype, 'description', {\n    configurable: true,\n    get: function description() {\n      var symbol = symbolValueOf(this);\n      var string = symbolToString(symbol);\n      if (hasOwn(EmptyStringDescriptionStore, symbol)) return '';\n      var desc = NATIVE_SYMBOL ? stringSlice(string, 7, -1) : replace(string, regexp, '$1');\n      return desc === '' ? undefined : desc;\n    }\n  });\n\n  $({ global: true, forced: true }, {\n    Symbol: SymbolWrapper\n  });\n}\n","var uncurryThis = require('../internals/function-uncurry-this');\n\nmodule.exports = uncurryThis({}.isPrototypeOf);\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = DESCRIPTORS ? function (object, key, value) {\n  return definePropertyModule.f(object, key, createPropertyDescriptor(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","var defineWellKnownSymbol = require('../internals/define-well-known-symbol');\n\n// `Symbol.iterator` well-known symbol\n// https://tc39.es/ecma262/#sec-symbol.iterator\ndefineWellKnownSymbol('iterator');\n","function _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nmodule.exports = _defineProperty, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var arrayWithHoles = require(\"./arrayWithHoles.js\");\n\nvar iterableToArrayLimit = require(\"./iterableToArrayLimit.js\");\n\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray.js\");\n\nvar nonIterableRest = require(\"./nonIterableRest.js\");\n\nfunction _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}\n\nmodule.exports = _slicedToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","module.exports = require(\"regenerator-runtime\");\n","var DESCRIPTORS = require('../internals/descriptors');\nvar call = require('../internals/function-call');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPropertyKey = require('../internals/to-property-key');\nvar hasOwn = require('../internals/has-own-property');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\n\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar $getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.es/ecma262/#sec-object.getownpropertydescriptor\nexports.f = DESCRIPTORS ? $getOwnPropertyDescriptor : function getOwnPropertyDescriptor(O, P) {\n  O = toIndexedObject(O);\n  P = toPropertyKey(P);\n  if (IE8_DOM_DEFINE) try {\n    return $getOwnPropertyDescriptor(O, P);\n  } catch (error) { /* empty */ }\n  if (hasOwn(O, P)) return createPropertyDescriptor(!call(propertyIsEnumerableModule.f, O, P), O[P]);\n};\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('navigator', 'userAgent') || '';\n","var ceil = Math.ceil;\nvar floor = Math.floor;\n\n// `ToIntegerOrInfinity` abstract operation\n// https://tc39.es/ecma262/#sec-tointegerorinfinity\nmodule.exports = function (argument) {\n  var number = +argument;\n  // eslint-disable-next-line no-self-compare -- safe\n  return number !== number || number === 0 ? 0 : (number > 0 ? floor : ceil)(number);\n};\n","var $ = require('../internals/export');\nvar from = require('../internals/array-from');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\n\nvar INCORRECT_ITERATION = !checkCorrectnessOfIteration(function (iterable) {\n  // eslint-disable-next-line es/no-array-from -- required for testing\n  Array.from(iterable);\n});\n\n// `Array.from` method\n// https://tc39.es/ecma262/#sec-array.from\n$({ target: 'Array', stat: true, forced: INCORRECT_ITERATION }, {\n  from: from\n});\n",";(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js v10.3.1\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js\r\n   *  Copyright (c) 2021 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The maximum exponent magnitude.\r\n    // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\n  var EXP_LIMIT = 9e15,                      // 0 to 9e15\r\n\r\n    // The limit on the value of `precision`, and on the value of the first argument to\r\n    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n    MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n    // Base conversion alphabet.\r\n    NUMERALS = '0123456789abcdef',\r\n\r\n    // The natural logarithm of 10 (1025 digits).\r\n    LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n    // Pi (1025 digits).\r\n    PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    DEFAULTS = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n      // The maximum number of significant digits of the result of a calculation or base conversion.\r\n      // E.g. `Decimal.config({ precision: 20 });`\r\n      precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n      // The rounding mode used when rounding to `precision`.\r\n      //\r\n      // ROUND_UP         0 Away from zero.\r\n      // ROUND_DOWN       1 Towards zero.\r\n      // ROUND_CEIL       2 Towards +Infinity.\r\n      // ROUND_FLOOR      3 Towards -Infinity.\r\n      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      //\r\n      // E.g.\r\n      // `Decimal.rounding = 4;`\r\n      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n      rounding: 4,                           // 0 to 8\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP         0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).\r\n      // FLOOR      3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN  6 The IEEE 754 remainder function.\r\n      // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n      //\r\n      // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n      // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n      // be used, but they may not give useful results.\r\n      modulo: 1,                             // 0 to 9\r\n\r\n      // The exponent value at and beneath which `toString` returns exponential notation.\r\n      // JavaScript numbers: -7\r\n      toExpNeg: -7,                          // 0 to -EXP_LIMIT\r\n\r\n      // The exponent value at and above which `toString` returns exponential notation.\r\n      // JavaScript numbers: 21\r\n      toExpPos:  21,                         // 0 to EXP_LIMIT\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // JavaScript numbers: -324  (5e-324)\r\n      minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // JavaScript numbers: 308  (1.7976931348623157e+308)\r\n      maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      crypto: false                          // true/false\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    Decimal, inexact, noConflict, quadrant,\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n    cryptoUnavailable = decimalError + 'crypto unavailable',\r\n    tag = '[object Decimal]',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n    isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n    isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n    LN10_PRECISION = LN10.length - 1,\r\n    PI_PRECISION = PI.length - 1,\r\n\r\n    // Decimal.prototype object\r\n    P = { toStringTag: tag };\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue             abs\r\n   *  ceil\r\n   *  clampedTo                 clamp\r\n   *  comparedTo                cmp\r\n   *  cosine                    cos\r\n   *  cubeRoot                  cbrt\r\n   *  decimalPlaces             dp\r\n   *  dividedBy                 div\r\n   *  dividedToIntegerBy        divToInt\r\n   *  equals                    eq\r\n   *  floor\r\n   *  greaterThan               gt\r\n   *  greaterThanOrEqualTo      gte\r\n   *  hyperbolicCosine          cosh\r\n   *  hyperbolicSine            sinh\r\n   *  hyperbolicTangent         tanh\r\n   *  inverseCosine             acos\r\n   *  inverseHyperbolicCosine   acosh\r\n   *  inverseHyperbolicSine     asinh\r\n   *  inverseHyperbolicTangent  atanh\r\n   *  inverseSine               asin\r\n   *  inverseTangent            atan\r\n   *  isFinite\r\n   *  isInteger                 isInt\r\n   *  isNaN\r\n   *  isNegative                isNeg\r\n   *  isPositive                isPos\r\n   *  isZero\r\n   *  lessThan                  lt\r\n   *  lessThanOrEqualTo         lte\r\n   *  logarithm                 log\r\n   *  [maximum]                 [max]\r\n   *  [minimum]                 [min]\r\n   *  minus                     sub\r\n   *  modulo                    mod\r\n   *  naturalExponential        exp\r\n   *  naturalLogarithm          ln\r\n   *  negated                   neg\r\n   *  plus                      add\r\n   *  precision                 sd\r\n   *  round\r\n   *  sine                      sin\r\n   *  squareRoot                sqrt\r\n   *  tangent                   tan\r\n   *  times                     mul\r\n   *  toBinary\r\n   *  toDecimalPlaces           toDP\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toFraction\r\n   *  toHexadecimal             toHex\r\n   *  toNearest\r\n   *  toNumber\r\n   *  toOctal\r\n   *  toPower                   pow\r\n   *  toPrecision\r\n   *  toSignificantDigits       toSD\r\n   *  toString\r\n   *  truncated                 trunc\r\n   *  valueOf                   toJSON\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of this Decimal.\r\n   *\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    if (x.s < 0) x.s = 1;\r\n    return finalise(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n   * direction of positive Infinity.\r\n   *\r\n   */\r\n  P.ceil = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n   * delineated by `min` and `max`.\r\n   *\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  P.clampedTo = P.clamp = function (min, max) {\r\n    var k,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n    min = new Ctor(min);\r\n    max = new Ctor(max);\r\n    if (!min.s || !max.s) return new Ctor(NaN);\r\n    if (min.gt(max)) throw Error(invalidArgument + max);\r\n    k = x.cmp(min);\r\n    return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value,\r\n   *   NaN  if the value of either Decimal is NaN.\r\n   *\r\n   */\r\n  P.comparedTo = P.cmp = function (y) {\r\n    var i, j, xdL, ydL,\r\n      x = this,\r\n      xd = x.d,\r\n      yd = (y = new x.constructor(y)).d,\r\n      xs = x.s,\r\n      ys = y.s;\r\n\r\n    // Either NaN or ±Infinity?\r\n    if (!xd || !yd) {\r\n      return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Either zero?\r\n    if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n    // Signs differ?\r\n    if (xs !== ys) return xs;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n      if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * cos(0)         = 1\r\n   * cos(-0)        = 1\r\n   * cos(Infinity)  = NaN\r\n   * cos(-Infinity) = NaN\r\n   * cos(NaN)       = NaN\r\n   *\r\n   */\r\n  P.cosine = P.cos = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.d) return new Ctor(NaN);\r\n\r\n    // cos(0) = cos(-0) = 1\r\n    if (!x.d[0]) return new Ctor(1);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *\r\n   * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   *  cbrt(0)  =  0\r\n   *  cbrt(-0) = -0\r\n   *  cbrt(1)  =  1\r\n   *  cbrt(-1) = -1\r\n   *  cbrt(N)  =  N\r\n   *  cbrt(-I) = -I\r\n   *  cbrt(I)  =  I\r\n   *\r\n   * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n   *\r\n   */\r\n  P.cubeRoot = P.cbrt = function () {\r\n    var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n     // Math.cbrt underflow/overflow?\r\n     // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n    if (!s || Math.abs(s) == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      e = x.e;\r\n\r\n      // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n      if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n      s = mathpow(n, 1 / 3);\r\n\r\n      // Rarely, e may be one less than the result exponent value.\r\n      e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n      r.s = x.s;\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Halley's method.\r\n    // TODO? Compare Newton's method.\r\n    for (;;) {\r\n      t = r;\r\n      t3 = t.times(t).times(t);\r\n      t3plusx = t3.plus(x);\r\n      r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n        // , i.e. approaching a rounding boundary, continue the iteration.\r\n        if (n == '9999' || !rep && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of decimal places of the value of this Decimal.\r\n   *\r\n   */\r\n  P.decimalPlaces = P.dp = function () {\r\n    var w,\r\n      d = this.d,\r\n      n = NaN;\r\n\r\n    if (d) {\r\n      w = d.length - 1;\r\n      n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      w = d[w];\r\n      if (w) for (; w % 10 == 0; w /= 10) n--;\r\n      if (n < 0) n = 0;\r\n    }\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n / 0 = I\r\n   *  n / N = N\r\n   *  n / I = 0\r\n   *  0 / n = 0\r\n   *  0 / 0 = N\r\n   *  0 / N = N\r\n   *  0 / I = 0\r\n   *  N / n = N\r\n   *  N / 0 = N\r\n   *  N / N = N\r\n   *  N / I = N\r\n   *  I / n = I\r\n   *  I / 0 = I\r\n   *  I / N = N\r\n   *  I / I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.dividedBy = P.div = function (y) {\r\n    return divide(this, new this.constructor(y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n   * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.divToInt = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.equals = P.eq = function (y) {\r\n    return this.cmp(y) === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n   * direction of negative Infinity.\r\n   *\r\n   */\r\n  P.floor = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 3);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n   * false.\r\n   *\r\n   */\r\n  P.greaterThan = P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  P.greaterThanOrEqualTo = P.gte = function (y) {\r\n    var k = this.cmp(y);\r\n    return k == 1 || k === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [1, Infinity]\r\n   *\r\n   * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n   *\r\n   * cosh(0)         = 1\r\n   * cosh(-0)        = 1\r\n   * cosh(Infinity)  = Infinity\r\n   * cosh(-Infinity) = Infinity\r\n   * cosh(NaN)       = NaN\r\n   *\r\n   *  x        time taken (ms)   result\r\n   * 1000      9                 9.8503555700852349694e+433\r\n   * 10000     25                4.4034091128314607936e+4342\r\n   * 100000    171               1.4033316802130615897e+43429\r\n   * 1000000   3817              1.5166076984010437725e+434294\r\n   * 10000000  abandoned after 2 minute wait\r\n   *\r\n   * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicCosine = P.cosh = function () {\r\n    var k, n, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      one = new Ctor(1);\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n    if (x.isZero()) return one;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n    // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    // TODO? Estimation reused from cosine() and may not be optimal here.\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      n = (1 / tinyPow(4, k)).toString();\r\n    } else {\r\n      k = 16;\r\n      n = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n    // Reverse argument reduction\r\n    var cosh2_x,\r\n      i = k,\r\n      d8 = new Ctor(8);\r\n    for (; i--;) {\r\n      cosh2_x = x.times(x);\r\n      x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n    }\r\n\r\n    return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n   *\r\n   * sinh(0)         = 0\r\n   * sinh(-0)        = -0\r\n   * sinh(Infinity)  = Infinity\r\n   * sinh(-Infinity) = -Infinity\r\n   * sinh(NaN)       = NaN\r\n   *\r\n   * x        time taken (ms)\r\n   * 10       2 ms\r\n   * 100      5 ms\r\n   * 1000     14 ms\r\n   * 10000    82 ms\r\n   * 100000   886 ms            1.4033316802130615897e+43429\r\n   * 200000   2613 ms\r\n   * 300000   5407 ms\r\n   * 400000   8824 ms\r\n   * 500000   13026 ms          8.7080643612718084129e+217146\r\n   * 1000000  48543 ms\r\n   *\r\n   * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicSine = P.sinh = function () {\r\n    var k, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    if (len < 3) {\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n    } else {\r\n\r\n      // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n      // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n      // 3 multiplications and 1 addition\r\n\r\n      // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n      // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n      // 4 multiplications and 2 additions\r\n\r\n      // Estimate the optimum number of times to use the argument reduction.\r\n      k = 1.4 * Math.sqrt(len);\r\n      k = k > 16 ? 16 : k | 0;\r\n\r\n      x = x.times(1 / tinyPow(5, k));\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n      // Reverse argument reduction\r\n      var sinh2_x,\r\n        d5 = new Ctor(5),\r\n        d16 = new Ctor(16),\r\n        d20 = new Ctor(20);\r\n      for (; k--;) {\r\n        sinh2_x = x.times(x);\r\n        x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n      }\r\n    }\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * tanh(x) = sinh(x) / cosh(x)\r\n   *\r\n   * tanh(0)         = 0\r\n   * tanh(-0)        = -0\r\n   * tanh(Infinity)  = 1\r\n   * tanh(-Infinity) = -1\r\n   * tanh(NaN)       = NaN\r\n   *\r\n   */\r\n  P.hyperbolicTangent = P.tanh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 7;\r\n    Ctor.rounding = 1;\r\n\r\n    return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n   * this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [0, pi]\r\n   *\r\n   * acos(x) = pi/2 - asin(x)\r\n   *\r\n   * acos(0)       = pi/2\r\n   * acos(-0)      = pi/2\r\n   * acos(1)       = 0\r\n   * acos(-1)      = pi\r\n   * acos(1/2)     = pi/3\r\n   * acos(-1/2)    = 2*pi/3\r\n   * acos(|x| > 1) = NaN\r\n   * acos(NaN)     = NaN\r\n   *\r\n   */\r\n  P.inverseCosine = P.acos = function () {\r\n    var halfPi,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      k = x.abs().cmp(1),\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n      return k === 0\r\n        // |x| is 1\r\n        ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n        // |x| > 1 or x is NaN\r\n        : new Ctor(NaN);\r\n    }\r\n\r\n    if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.asin();\r\n    halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return halfPi.minus(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [1, Infinity]\r\n   * Range: [0, Infinity]\r\n   *\r\n   * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n   *\r\n   * acosh(x < 1)     = NaN\r\n   * acosh(NaN)       = NaN\r\n   * acosh(Infinity)  = Infinity\r\n   * acosh(-Infinity) = NaN\r\n   * acosh(0)         = NaN\r\n   * acosh(-0)        = NaN\r\n   * acosh(1)         = 0\r\n   * acosh(-1)        = NaN\r\n   *\r\n   */\r\n  P.inverseHyperbolicCosine = P.acosh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n    if (!x.isFinite()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n   *\r\n   * asinh(NaN)       = NaN\r\n   * asinh(Infinity)  = Infinity\r\n   * asinh(-Infinity) = -Infinity\r\n   * asinh(0)         = 0\r\n   * asinh(-0)        = -0\r\n   *\r\n   */\r\n  P.inverseHyperbolicSine = P.asinh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n   *\r\n   * atanh(|x| > 1)   = NaN\r\n   * atanh(NaN)       = NaN\r\n   * atanh(Infinity)  = NaN\r\n   * atanh(-Infinity) = NaN\r\n   * atanh(0)         = 0\r\n   * atanh(-0)        = -0\r\n   * atanh(1)         = Infinity\r\n   * atanh(-1)        = -Infinity\r\n   *\r\n   */\r\n  P.inverseHyperbolicTangent = P.atanh = function () {\r\n    var pr, rm, wpr, xsd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    xsd = x.sd();\r\n\r\n    if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n    Ctor.precision = wpr = xsd - x.e;\r\n\r\n    x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n    Ctor.precision = pr + 4;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.ln();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(0.5);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n   *\r\n   * asin(0)       = 0\r\n   * asin(-0)      = -0\r\n   * asin(1/2)     = pi/6\r\n   * asin(-1/2)    = -pi/6\r\n   * asin(1)       = pi/2\r\n   * asin(-1)      = -pi/2\r\n   * asin(|x| > 1) = NaN\r\n   * asin(NaN)     = NaN\r\n   *\r\n   * TODO? Compare performance of Taylor series.\r\n   *\r\n   */\r\n  P.inverseSine = P.asin = function () {\r\n    var halfPi, k,\r\n      pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    k = x.abs().cmp(1);\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n\r\n      // |x| is 1\r\n      if (k === 0) {\r\n        halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        halfPi.s = x.s;\r\n        return halfPi;\r\n      }\r\n\r\n      // |x| > 1 or x is NaN\r\n      return new Ctor(NaN);\r\n    }\r\n\r\n    // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n   *\r\n   * atan(0)         = 0\r\n   * atan(-0)        = -0\r\n   * atan(1)         = pi/4\r\n   * atan(-1)        = -pi/4\r\n   * atan(Infinity)  = pi/2\r\n   * atan(-Infinity) = -pi/2\r\n   * atan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.inverseTangent = P.atan = function () {\r\n    var i, j, k, n, px, t, r, wpr, x2,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (!x.isFinite()) {\r\n      if (!x.s) return new Ctor(NaN);\r\n      if (pr + 4 <= PI_PRECISION) {\r\n        r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        r.s = x.s;\r\n        return r;\r\n      }\r\n    } else if (x.isZero()) {\r\n      return new Ctor(x);\r\n    } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n      r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n      r.s = x.s;\r\n      return r;\r\n    }\r\n\r\n    Ctor.precision = wpr = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n    // Argument reduction\r\n    // Ensure |x| < 0.42\r\n    // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n    k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n    for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n    external = false;\r\n\r\n    j = Math.ceil(wpr / LOG_BASE);\r\n    n = 1;\r\n    x2 = x.times(x);\r\n    r = new Ctor(x);\r\n    px = x;\r\n\r\n    // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n    for (; i !== -1;) {\r\n      px = px.times(x2);\r\n      t = r.minus(px.div(n += 2));\r\n\r\n      px = px.times(x2);\r\n      r = t.plus(px.div(n += 2));\r\n\r\n      if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n    }\r\n\r\n    if (k) r = r.times(2 << (k - 1));\r\n\r\n    external = true;\r\n\r\n    return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n   *\r\n   */\r\n  P.isFinite = function () {\r\n    return !!this.d;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is an integer, otherwise return false.\r\n   *\r\n   */\r\n  P.isInteger = P.isInt = function () {\r\n    return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is NaN, otherwise return false.\r\n   *\r\n   */\r\n  P.isNaN = function () {\r\n    return !this.s;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is negative, otherwise return false.\r\n   *\r\n   */\r\n  P.isNegative = P.isNeg = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is positive, otherwise return false.\r\n   *\r\n   */\r\n  P.isPositive = P.isPos = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return !!this.d && this.d[0] === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThan = P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThanOrEqualTo = P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * If no base is specified, return log[10](arg).\r\n   *\r\n   * log[base](arg) = ln(arg) / ln(base)\r\n   *\r\n   * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n   * otherwise:\r\n   *\r\n   * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n   * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n   * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n   *\r\n   * log[-b](a)       = NaN\r\n   * log[0](a)        = NaN\r\n   * log[1](a)        = NaN\r\n   * log[NaN](a)      = NaN\r\n   * log[Infinity](a) = NaN\r\n   * log[b](0)        = -Infinity\r\n   * log[b](-0)       = -Infinity\r\n   * log[b](-a)       = NaN\r\n   * log[b](1)        = 0\r\n   * log[b](Infinity) = Infinity\r\n   * log[b](NaN)      = NaN\r\n   *\r\n   * [base] {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  P.logarithm = P.log = function (base) {\r\n    var isBase10, d, denominator, k, inf, num, sd, r,\r\n      arg = this,\r\n      Ctor = arg.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding,\r\n      guard = 5;\r\n\r\n    // Default base is 10.\r\n    if (base == null) {\r\n      base = new Ctor(10);\r\n      isBase10 = true;\r\n    } else {\r\n      base = new Ctor(base);\r\n      d = base.d;\r\n\r\n      // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n      if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n      isBase10 = base.eq(10);\r\n    }\r\n\r\n    d = arg.d;\r\n\r\n    // Is arg negative, non-finite, 0 or 1?\r\n    if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n      return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n    }\r\n\r\n    // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n    // integer power of 10.\r\n    if (isBase10) {\r\n      if (d.length > 1) {\r\n        inf = true;\r\n      } else {\r\n        for (k = d[0]; k % 10 === 0;) k /= 10;\r\n        inf = k !== 1;\r\n      }\r\n    }\r\n\r\n    external = false;\r\n    sd = pr + guard;\r\n    num = naturalLogarithm(arg, sd);\r\n    denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n    // The result will have 5 rounding digits.\r\n    r = divide(num, denominator, sd, 1);\r\n\r\n    // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n    // calculate 10 further digits.\r\n    //\r\n    // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n    // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n    // further digits, the last 14 are nines, round up and assume the result is exact.\r\n    // Also assume the result is exact if the last 14 are zero.\r\n    //\r\n    // Example of a result that will be incorrectly rounded:\r\n    // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n    // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n    // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n    // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n    // place is still 2.6.\r\n    if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n      do {\r\n        sd += 10;\r\n        num = naturalLogarithm(arg, sd);\r\n        denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n        r = divide(num, denominator, sd, 1);\r\n\r\n        if (!inf) {\r\n\r\n          // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n          if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n            r = finalise(r, pr + 1, 0);\r\n          }\r\n\r\n          break;\r\n        }\r\n      } while (checkRoundingDigits(r.d, k += 10, rm));\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, pr, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.max = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'lt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.min = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'gt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   *  n - 0 = n\r\n   *  n - N = N\r\n   *  n - I = -I\r\n   *  0 - n = -n\r\n   *  0 - 0 = 0\r\n   *  0 - N = N\r\n   *  0 - I = -I\r\n   *  N - n = N\r\n   *  N - 0 = N\r\n   *  N - N = N\r\n   *  N - I = N\r\n   *  I - n = I\r\n   *  I - 0 = I\r\n   *  I - N = N\r\n   *  I - I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return y negated if x is finite and y is ±Infinity.\r\n      else if (x.d) y.s = -y.s;\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with different signs.\r\n      // Return NaN if both are ±Infinity with the same sign.\r\n      else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n    // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.plus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return y negated if x is zero and y is non-zero.\r\n      if (yd[0]) y.s = -y.s;\r\n\r\n      // Return x if y is zero and x is non-zero.\r\n      else if (xd[0]) y = new Ctor(x);\r\n\r\n      // Return zero if both are zero.\r\n      // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n      else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    e = mathfloor(y.e / LOG_BASE);\r\n    xe = mathfloor(x.e / LOG_BASE);\r\n\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (k) {\r\n      xLTy = k < 0;\r\n\r\n      if (xLTy) {\r\n        d = xd;\r\n        k = -k;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = xe;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Numbers with massively different exponents would result in a very high number of\r\n      // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n      // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n      if (k > i) {\r\n        k = i;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      d.reverse();\r\n      for (i = k; i--;) d.push(0);\r\n      d.reverse();\r\n\r\n    // Base 1e7 exponents equal.\r\n    } else {\r\n\r\n      // Check digits to determine which is the bigger number.\r\n\r\n      i = xd.length;\r\n      len = yd.length;\r\n      xLTy = i < len;\r\n      if (xLTy) len = i;\r\n\r\n      for (i = 0; i < len; i++) {\r\n        if (xd[i] != yd[i]) {\r\n          xLTy = xd[i] < yd[i];\r\n          break;\r\n        }\r\n      }\r\n\r\n      k = 0;\r\n    }\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      xd = yd;\r\n      yd = d;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    len = xd.length;\r\n\r\n    // Append zeros to `xd` if shorter.\r\n    // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n    // Subtract yd from xd.\r\n    for (i = yd.length; i > k;) {\r\n\r\n      if (xd[--i] < yd[i]) {\r\n        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n        --xd[j];\r\n        xd[i] += BASE;\r\n      }\r\n\r\n      xd[i] -= yd[i];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] === 0;) xd.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n    // Zero?\r\n    if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n    y.d = xd;\r\n    y.e = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   *   n % 0 =  N\r\n   *   n % N =  N\r\n   *   n % I =  n\r\n   *   0 % n =  0\r\n   *  -0 % n = -0\r\n   *   0 % 0 =  N\r\n   *   0 % N =  N\r\n   *   0 % I =  0\r\n   *   N % n =  N\r\n   *   N % 0 =  N\r\n   *   N % N =  N\r\n   *   N % I =  N\r\n   *   I % n =  N\r\n   *   I % 0 =  N\r\n   *   I % N =  N\r\n   *   I % I =  N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * The result depends on the modulo mode.\r\n   *\r\n   */\r\n  P.modulo = P.mod = function (y) {\r\n    var q,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n    if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n    // Return x if y is ±Infinity or x is ±0.\r\n    if (!y.d || x.d && !x.d[0]) {\r\n      return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n    }\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n\r\n    if (Ctor.modulo == 9) {\r\n\r\n      // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n      // result = x - q * y    where  0 <= result < abs(y)\r\n      q = divide(x, y.abs(), 0, 3, 1);\r\n      q.s *= y.s;\r\n    } else {\r\n      q = divide(x, y, 0, Ctor.modulo, 1);\r\n    }\r\n\r\n    q = q.times(y);\r\n\r\n    external = true;\r\n\r\n    return x.minus(q);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n   * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return naturalExponential(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return naturalLogarithm(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n   * -1.\r\n   *\r\n   */\r\n  P.negated = P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s;\r\n    return finalise(x);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n + 0 = n\r\n   *  n + N = N\r\n   *  n + I = I\r\n   *  0 + n = n\r\n   *  0 + 0 = 0\r\n   *  0 + N = N\r\n   *  0 + I = I\r\n   *  N + n = N\r\n   *  N + 0 = N\r\n   *  N + N = N\r\n   *  N + I = N\r\n   *  I + n = I\r\n   *  I + 0 = I\r\n   *  I + N = N\r\n   *  I + I = I\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with the same sign.\r\n      // Return NaN if both are ±Infinity with different signs.\r\n      // Return y if x is finite and y is ±Infinity.\r\n      else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n     // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.minus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!yd[0]) y = new Ctor(x);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    k = mathfloor(x.e / LOG_BASE);\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\r\n    xd = xd.slice();\r\n    i = k - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (i) {\r\n\r\n      if (i < 0) {\r\n        d = xd;\r\n        i = -i;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = k;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n      k = Math.ceil(pr / LOG_BASE);\r\n      len = k > len ? k + 1 : len + 1;\r\n\r\n      if (i > len) {\r\n        i = len;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n      d.reverse();\r\n      for (; i--;) d.push(0);\r\n      d.reverse();\r\n    }\r\n\r\n    len = xd.length;\r\n    i = yd.length;\r\n\r\n    // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n    if (len - i < 0) {\r\n      i = len;\r\n      d = yd;\r\n      yd = xd;\r\n      xd = d;\r\n    }\r\n\r\n    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n    for (carry = 0; i;) {\r\n      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n      xd[i] %= BASE;\r\n    }\r\n\r\n    if (carry) {\r\n      xd.unshift(carry);\r\n      ++e;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n    y.d = xd;\r\n    y.e = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of significant digits of the value of this Decimal.\r\n   *\r\n   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n   *\r\n   */\r\n  P.precision = P.sd = function (z) {\r\n    var k,\r\n      x = this;\r\n\r\n    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n    if (x.d) {\r\n      k = getPrecision(x.d);\r\n      if (z && x.e + 1 > k) k = x.e + 1;\r\n    } else {\r\n      k = NaN;\r\n    }\r\n\r\n    return k;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n   * rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.round = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   *\r\n   * sin(0)         = 0\r\n   * sin(-0)        = -0\r\n   * sin(Infinity)  = NaN\r\n   * sin(-Infinity) = NaN\r\n   * sin(NaN)       = NaN\r\n   *\r\n   */\r\n  P.sine = P.sin = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   *  sqrt(-n) =  N\r\n   *  sqrt(N)  =  N\r\n   *  sqrt(-I) =  N\r\n   *  sqrt(I)  =  I\r\n   *  sqrt(0)  =  0\r\n   *  sqrt(-0) = -0\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var m, n, sd, r, rep, t,\r\n      x = this,\r\n      d = x.d,\r\n      e = x.e,\r\n      s = x.s,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative/NaN/Infinity/zero?\r\n    if (s !== 1 || !d || !d[0]) {\r\n      return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n    }\r\n\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+x);\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = digitsToString(d);\r\n\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(n);\r\n      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n        // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n        if (n == '9999' || !rep && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * tan(0)         = 0\r\n   * tan(-0)        = -0\r\n   * tan(Infinity)  = NaN\r\n   * tan(-Infinity) = NaN\r\n   * tan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.tangent = P.tan = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.sin();\r\n    x.s = 1;\r\n    x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n * 0 = 0\r\n   *  n * N = N\r\n   *  n * I = I\r\n   *  0 * n = 0\r\n   *  0 * 0 = 0\r\n   *  0 * N = N\r\n   *  0 * I = N\r\n   *  N * n = N\r\n   *  N * 0 = N\r\n   *  N * N = N\r\n   *  N * I = N\r\n   *  I * n = I\r\n   *  I * 0 = N\r\n   *  I * N = N\r\n   *  I * I = I\r\n   *\r\n   * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var carry, e, i, k, r, rL, t, xdL, ydL,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      xd = x.d,\r\n      yd = (y = new Ctor(y)).d;\r\n\r\n    y.s *= x.s;\r\n\r\n     // If either is NaN, ±Infinity or ±0...\r\n    if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n      return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n        // Return NaN if either is NaN.\r\n        // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n        ? NaN\r\n\r\n        // Return ±Infinity if either is ±Infinity.\r\n        // Return ±0 if either is ±0.\r\n        : !xd || !yd ? y.s / 0 : y.s * 0);\r\n    }\r\n\r\n    e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Ensure xd points to the longer array.\r\n    if (xdL < ydL) {\r\n      r = xd;\r\n      xd = yd;\r\n      yd = r;\r\n      rL = xdL;\r\n      xdL = ydL;\r\n      ydL = rL;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    r = [];\r\n    rL = xdL + ydL;\r\n    for (i = rL; i--;) r.push(0);\r\n\r\n    // Multiply!\r\n    for (i = ydL; --i >= 0;) {\r\n      carry = 0;\r\n      for (k = xdL + i; k > i;) {\r\n        t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n        r[k--] = t % BASE | 0;\r\n        carry = t / BASE | 0;\r\n      }\r\n\r\n      r[k] = (r[k] + carry) % BASE | 0;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; !r[--rL];) r.pop();\r\n\r\n    if (carry) ++e;\r\n    else r.shift();\r\n\r\n    y.d = r;\r\n    y.e = getBase10Exponent(r, e);\r\n\r\n    return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toBinary = function (sd, rm) {\r\n    return toStringBinary(this, 2, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n   *\r\n   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n    if (dp === void 0) return x;\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    return finalise(x, dp + x.e + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in exponential notation rounded to\r\n   * `dp` fixed decimal places using rounding mode `rounding`.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = finiteToString(x, true);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = finalise(new Ctor(x), dp + 1, rm);\r\n      str = finiteToString(x, true, dp + 1);\r\n    }\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n   * omitted.\r\n   *\r\n   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   * (-0).toFixed(3) is '0.000'.\r\n   * (-0.5).toFixed(0) is '-0'.\r\n   *\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var str, y,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = finiteToString(x);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n      str = finiteToString(y, false, dp + y.e + 1);\r\n    }\r\n\r\n    // To determine whether to add the minus sign look at the value before it was rounded,\r\n    // i.e. look at `x` rather than `y`.\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return an array representing the value of this Decimal as a simple fraction with an integer\r\n   * numerator and an integer denominator.\r\n   *\r\n   * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n   * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n   * value necessary to represent the number exactly.\r\n   *\r\n   * [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n   *\r\n   */\r\n  P.toFraction = function (maxD) {\r\n    var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n      x = this,\r\n      xd = x.d,\r\n      Ctor = x.constructor;\r\n\r\n    if (!xd) return new Ctor(x);\r\n\r\n    n1 = d0 = new Ctor(1);\r\n    d1 = n0 = new Ctor(0);\r\n\r\n    d = new Ctor(d1);\r\n    e = d.e = getPrecision(xd) - x.e - 1;\r\n    k = e % LOG_BASE;\r\n    d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n    if (maxD == null) {\r\n\r\n      // d is 10**e, the minimum max-denominator needed.\r\n      maxD = e > 0 ? d : n1;\r\n    } else {\r\n      n = new Ctor(maxD);\r\n      if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n      maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n    }\r\n\r\n    external = false;\r\n    n = new Ctor(digitsToString(xd));\r\n    pr = Ctor.precision;\r\n    Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n    for (;;)  {\r\n      q = divide(n, d, 0, 1, 1);\r\n      d2 = d0.plus(q.times(d1));\r\n      if (d2.cmp(maxD) == 1) break;\r\n      d0 = d1;\r\n      d1 = d2;\r\n      d2 = n1;\r\n      n1 = n0.plus(q.times(d2));\r\n      n0 = d2;\r\n      d2 = d;\r\n      d = n.minus(q.times(d2));\r\n      n = d2;\r\n    }\r\n\r\n    d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n    n0 = n0.plus(d2.times(n1));\r\n    d0 = d0.plus(d2.times(d1));\r\n    n0.s = n1.s = x.s;\r\n\r\n    // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n    r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n        ? [n1, d1] : [n0, d0];\r\n\r\n    Ctor.precision = pr;\r\n    external = true;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toHexadecimal = P.toHex = function (sd, rm) {\r\n    return toStringBinary(this, 16, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n   * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n   *\r\n   * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n   * or `y` is NaN, in which case the return value will be also be NaN.\r\n   *\r\n   * The return value is not affected by the value of `precision`.\r\n   *\r\n   * y {number|string|Decimal} The magnitude to round to a multiple of.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * 'toNearest() rounding mode not an integer: {rm}'\r\n   * 'toNearest() rounding mode out of range: {rm}'\r\n   *\r\n   */\r\n  P.toNearest = function (y, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (y == null) {\r\n\r\n      // If x is not finite, return x.\r\n      if (!x.d) return x;\r\n\r\n      y = new Ctor(1);\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      y = new Ctor(y);\r\n      if (rm === void 0) {\r\n        rm = Ctor.rounding;\r\n      } else {\r\n        checkInt32(rm, 0, 8);\r\n      }\r\n\r\n      // If x is not finite, return x if y is not NaN, else NaN.\r\n      if (!x.d) return y.s ? x : y;\r\n\r\n      // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n      if (!y.d) {\r\n        if (y.s) y.s = x.s;\r\n        return y;\r\n      }\r\n    }\r\n\r\n    // If y is not zero, calculate the nearest multiple of y to x.\r\n    if (y.d[0]) {\r\n      external = false;\r\n      x = divide(x, y, 0, rm, 1).times(y);\r\n      external = true;\r\n      finalise(x);\r\n\r\n    // If y is zero, return zero with the sign of x.\r\n    } else {\r\n      y.s = x.s;\r\n      x = y;\r\n    }\r\n\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   * Zero keeps its sign.\r\n   *\r\n   */\r\n  P.toNumber = function () {\r\n    return +this;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toOctal = function (sd, rm) {\r\n    return toStringBinary(this, 8, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n   * to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * ECMAScript compliant.\r\n   *\r\n   *   pow(x, NaN)                           = NaN\r\n   *   pow(x, ±0)                            = 1\r\n\r\n   *   pow(NaN, non-zero)                    = NaN\r\n   *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n   *   pow(abs(x) > 1, -Infinity)            = +0\r\n   *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n   *   pow(abs(x) < 1, +Infinity)            = +0\r\n   *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n   *   pow(+Infinity, y > 0)                 = +Infinity\r\n   *   pow(+Infinity, y < 0)                 = +0\r\n   *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n   *   pow(-Infinity, even integer > 0)      = +Infinity\r\n   *   pow(-Infinity, odd integer < 0)       = -0\r\n   *   pow(-Infinity, even integer < 0)      = +0\r\n   *   pow(+0, y > 0)                        = +0\r\n   *   pow(+0, y < 0)                        = +Infinity\r\n   *   pow(-0, odd integer > 0)              = -0\r\n   *   pow(-0, even integer > 0)             = +0\r\n   *   pow(-0, odd integer < 0)              = -Infinity\r\n   *   pow(-0, even integer < 0)             = +Infinity\r\n   *   pow(finite x < 0, finite non-integer) = NaN\r\n   *\r\n   * For non-integer or very large exponents pow(x, y) is calculated using\r\n   *\r\n   *   x^y = exp(y*ln(x))\r\n   *\r\n   * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n   * probability of an incorrectly rounded result\r\n   * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n   * i.e. 1 in 250,000,000,000,000\r\n   *\r\n   * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n   *\r\n   * y {number|string|Decimal} The power to which to raise this Decimal.\r\n   *\r\n   */\r\n  P.toPower = P.pow = function (y) {\r\n    var e, k, pr, r, rm, s,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // Either ±Infinity, NaN or ±0?\r\n    if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (x.eq(1)) return x;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n    // y exponent\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = intPow(Ctor, x, k, pr);\r\n      return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n    }\r\n\r\n    s = x.s;\r\n\r\n    // if x is negative\r\n    if (s < 0) {\r\n\r\n      // if y is not an integer\r\n      if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n      // Result is positive if x is negative and the last digit of integer y is even.\r\n      if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n      // if x.eq(-1)\r\n      if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n        x.s = s;\r\n        return x;\r\n      }\r\n    }\r\n\r\n    // Estimate result exponent.\r\n    // x^y = 10^e,  where e = y * log10(x)\r\n    // log10(x) = log10(x_significand) + x_exponent\r\n    // log10(x_significand) = ln(x_significand) / ln(10)\r\n    k = mathpow(+x, yn);\r\n    e = k == 0 || !isFinite(k)\r\n      ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n      : new Ctor(k + '').e;\r\n\r\n    // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n    // Overflow/underflow?\r\n    if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n    external = false;\r\n    Ctor.rounding = x.s = 1;\r\n\r\n    // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n    // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n    // new Decimal(2.32456).pow('2087987436534566.46411')\r\n    // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n    k = Math.min(12, (e + '').length);\r\n\r\n    // r = x^y = exp(y*ln(x))\r\n    r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n    // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n    if (r.d) {\r\n\r\n      // Truncate to the required precision plus five rounding digits.\r\n      r = finalise(r, pr + 5, 1);\r\n\r\n      // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n      // the result.\r\n      if (checkRoundingDigits(r.d, pr, rm)) {\r\n        e = pr + 10;\r\n\r\n        // Truncate to the increased precision plus five rounding digits.\r\n        r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n        // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n        if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n          r = finalise(r, pr + 1, 0);\r\n        }\r\n      }\r\n    }\r\n\r\n    r.s = s;\r\n    external = true;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(r, pr, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = finalise(new Ctor(x), sd, rm);\r\n      str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n    }\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n   * omitted.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * 'toSD() digits out of range: {sd}'\r\n   * 'toSD() digits not an integer: {sd}'\r\n   * 'toSD() rounding mode not an integer: {rm}'\r\n   * 'toSD() rounding mode out of range: {rm}'\r\n   *\r\n   */\r\n  P.toSignificantDigits = P.toSD = function (sd, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    return finalise(new Ctor(x), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   *\r\n   * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n   *\r\n   */\r\n  P.toString = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n   *\r\n   */\r\n  P.truncated = P.trunc = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   * Unlike `toString`, negative zero will include the minus sign.\r\n   *\r\n   */\r\n  P.valueOf = P.toJSON = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n    return x.isNeg() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n  /*\r\n   *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n   *                           finiteToString, naturalExponential, naturalLogarithm\r\n   *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n   *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n   *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n   *  convertBase              toStringBinary, parseOther\r\n   *  cos                      P.cos\r\n   *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n   *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n   *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n   *                           taylorSeries, atan2, parseOther\r\n   *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n   *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n   *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n   *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n   *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n   *                           P.truncated, divide, getLn10, getPi, naturalExponential,\r\n   *                           naturalLogarithm, ceil, floor, round, trunc\r\n   *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n   *                           toStringBinary\r\n   *  getBase10Exponent        P.minus, P.plus, P.times, parseOther\r\n   *  getLn10                  P.logarithm, naturalLogarithm\r\n   *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n   *  getPrecision             P.precision, P.toFraction\r\n   *  getZeroString            digitsToString, finiteToString\r\n   *  intPow                   P.toPower, parseOther\r\n   *  isOdd                    toLessThanHalfPi\r\n   *  maxOrMin                 max, min\r\n   *  naturalExponential       P.naturalExponential, P.toPower\r\n   *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n   *                           P.toPower, naturalExponential\r\n   *  nonFiniteToString        finiteToString, toStringBinary\r\n   *  parseDecimal             Decimal\r\n   *  parseOther               Decimal\r\n   *  sin                      P.sin\r\n   *  taylorSeries             P.cosh, P.sinh, cos, sin\r\n   *  toLessThanHalfPi         P.cos, P.sin\r\n   *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal\r\n   *  truncate                 intPow\r\n   *\r\n   *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n   *                           naturalLogarithm, config, parseOther, random, Decimal\r\n   */\r\n\r\n\r\n  function digitsToString(d) {\r\n    var i, k, ws,\r\n      indexOfLastWord = d.length - 1,\r\n      str = '',\r\n      w = d[0];\r\n\r\n    if (indexOfLastWord > 0) {\r\n      str += w;\r\n      for (i = 1; i < indexOfLastWord; i++) {\r\n        ws = d[i] + '';\r\n        k = LOG_BASE - ws.length;\r\n        if (k) str += getZeroString(k);\r\n        str += ws;\r\n      }\r\n\r\n      w = d[i];\r\n      ws = w + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n    } else if (w === 0) {\r\n      return '0';\r\n    }\r\n\r\n    // Remove trailing zeros of last w.\r\n    for (; w % 10 === 0;) w /= 10;\r\n\r\n    return str + w;\r\n  }\r\n\r\n\r\n  function checkInt32(i, min, max) {\r\n    if (i !== ~~i || i < min || i > max) {\r\n      throw Error(invalidArgument + i);\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n   * `repeating == null` if caller is `log` or `pow`,\r\n   * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n   */\r\n  function checkRoundingDigits(d, i, rm, repeating) {\r\n    var di, k, r, rd;\r\n\r\n    // Get the length of the first word of the array d.\r\n    for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n    // Is the rounding digit in the first word of d?\r\n    if (--i < 0) {\r\n      i += LOG_BASE;\r\n      di = 0;\r\n    } else {\r\n      di = Math.ceil((i + 1) / LOG_BASE);\r\n      i %= LOG_BASE;\r\n    }\r\n\r\n    // i is the index (0 - 6) of the rounding digit.\r\n    // E.g. if within the word 3487563 the first rounding digit is 5,\r\n    // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n    k = mathpow(10, LOG_BASE - i);\r\n    rd = d[di] % k | 0;\r\n\r\n    if (repeating == null) {\r\n      if (i < 3) {\r\n        if (i == 0) rd = rd / 100 | 0;\r\n        else if (i == 1) rd = rd / 10 | 0;\r\n        r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n      } else {\r\n        r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n            (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n      }\r\n    } else {\r\n      if (i < 4) {\r\n        if (i == 0) rd = rd / 1000 | 0;\r\n        else if (i == 1) rd = rd / 100 | 0;\r\n        else if (i == 2) rd = rd / 10 | 0;\r\n        r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n      } else {\r\n        r = ((repeating || rm < 4) && rd + 1 == k ||\r\n        (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n      }\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  // Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n  // Eg. convertBase('255', 10, 16) returns [15, 15].\r\n  // Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\n  function convertBase(str, baseIn, baseOut) {\r\n    var j,\r\n      arr = [0],\r\n      arrL,\r\n      i = 0,\r\n      strL = str.length;\r\n\r\n    for (; i < strL;) {\r\n      for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n      arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n      for (j = 0; j < arr.length; j++) {\r\n        if (arr[j] > baseOut - 1) {\r\n          if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n          arr[j + 1] += arr[j] / baseOut | 0;\r\n          arr[j] %= baseOut;\r\n        }\r\n      }\r\n    }\r\n\r\n    return arr.reverse();\r\n  }\r\n\r\n\r\n  /*\r\n   * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function cosine(Ctor, x) {\r\n    var k, len, y;\r\n\r\n    if (x.isZero()) return x;\r\n\r\n    // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n    // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    len = x.d.length;\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      y = (1 / tinyPow(4, k)).toString();\r\n    } else {\r\n      k = 16;\r\n      y = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    Ctor.precision += k;\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n    // Reverse argument reduction\r\n    for (var i = k; i--;) {\r\n      var cos2x = x.times(x);\r\n      x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n    }\r\n\r\n    Ctor.precision -= k;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Perform division in the specified base.\r\n   */\r\n  var divide = (function () {\r\n\r\n    // Assumes non-zero x and k, and hence non-zero result.\r\n    function multiplyInteger(x, k, base) {\r\n      var temp,\r\n        carry = 0,\r\n        i = x.length;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        temp = x[i] * k + carry;\r\n        x[i] = temp % base | 0;\r\n        carry = temp / base | 0;\r\n      }\r\n\r\n      if (carry) x.unshift(carry);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, r;\r\n\r\n      if (aL != bL) {\r\n        r = aL > bL ? 1 : -1;\r\n      } else {\r\n        for (i = r = 0; i < aL; i++) {\r\n          if (a[i] != b[i]) {\r\n            r = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return r;\r\n    }\r\n\r\n    function subtract(a, b, aL, base) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * base + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1;) a.shift();\r\n    }\r\n\r\n    return function (x, y, pr, rm, dp, base) {\r\n      var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n        yL, yz,\r\n        Ctor = x.constructor,\r\n        sign = x.s == y.s ? 1 : -1,\r\n        xd = x.d,\r\n        yd = y.d;\r\n\r\n      // Either NaN, Infinity or 0?\r\n      if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n        return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n          !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n          xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n      }\r\n\r\n      if (base) {\r\n        logBase = 1;\r\n        e = x.e - y.e;\r\n      } else {\r\n        base = BASE;\r\n        logBase = LOG_BASE;\r\n        e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n      }\r\n\r\n      yL = yd.length;\r\n      xL = xd.length;\r\n      q = new Ctor(sign);\r\n      qd = q.d = [];\r\n\r\n      // Result exponent may be one less than e.\r\n      // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n      for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n      if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n        rm = Ctor.rounding;\r\n      } else if (dp) {\r\n        sd = pr + (x.e - y.e) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) {\r\n        qd.push(1);\r\n        more = true;\r\n      } else {\r\n\r\n        // Convert precision in number of base 10 digits to base 1e7 digits.\r\n        sd = sd / logBase + 2 | 0;\r\n        i = 0;\r\n\r\n        // divisor < 1e7\r\n        if (yL == 1) {\r\n          k = 0;\r\n          yd = yd[0];\r\n          sd++;\r\n\r\n          // k is the carry.\r\n          for (; (i < xL || k) && sd--; i++) {\r\n            t = k * base + (xd[i] || 0);\r\n            qd[i] = t / yd | 0;\r\n            k = t % yd | 0;\r\n          }\r\n\r\n          more = k || i < xL;\r\n\r\n        // divisor >= 1e7\r\n        } else {\r\n\r\n          // Normalise xd and yd so highest order digit of yd is >= base/2\r\n          k = base / (yd[0] + 1) | 0;\r\n\r\n          if (k > 1) {\r\n            yd = multiplyInteger(yd, k, base);\r\n            xd = multiplyInteger(xd, k, base);\r\n            yL = yd.length;\r\n            xL = xd.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xd.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL;) rem[remL++] = 0;\r\n\r\n          yz = yd.slice();\r\n          yz.unshift(0);\r\n          yd0 = yd[0];\r\n\r\n          if (yd[1] >= base / 2) ++yd0;\r\n\r\n          do {\r\n            k = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yd, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, k.\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // k will be how many times the divisor goes into the current remainder.\r\n              k = rem0 / yd0 | 0;\r\n\r\n              //  Algorithm:\r\n              //  1. product = divisor * trial digit (k)\r\n              //  2. if product > remainder: product -= divisor, k--\r\n              //  3. remainder -= product\r\n              //  4. if product was < remainder at 2:\r\n              //    5. compare new remainder and divisor\r\n              //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n              if (k > 1) {\r\n                if (k >= base) k = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiplyInteger(yd, k, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                cmp = compare(prod, rem, prodL, remL);\r\n\r\n                // product > remainder.\r\n                if (cmp == 1) {\r\n                  k--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n                }\r\n              } else {\r\n\r\n                // cmp is -1.\r\n                // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n                // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n                if (k == 0) cmp = k = 1;\r\n                prod = yd.slice();\r\n              }\r\n\r\n              prodL = prod.length;\r\n              if (prodL < remL) prod.unshift(0);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n\r\n              // If product was < previous remainder.\r\n              if (cmp == -1) {\r\n                remL = rem.length;\r\n\r\n                // Compare divisor and new remainder.\r\n                cmp = compare(yd, rem, yL, remL);\r\n\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                if (cmp < 1) {\r\n                  k++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yd, remL, base);\r\n                }\r\n              }\r\n\r\n              remL = rem.length;\r\n            } else if (cmp === 0) {\r\n              k++;\r\n              rem = [0];\r\n            }    // if cmp === 1, k will be 0\r\n\r\n            // Add the next digit, k, to the result array.\r\n            qd[i++] = k;\r\n\r\n            // Update the remainder.\r\n            if (cmp && rem[0]) {\r\n              rem[remL++] = xd[xi] || 0;\r\n            } else {\r\n              rem = [xd[xi]];\r\n              remL = 1;\r\n            }\r\n\r\n          } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n          more = rem[0] !== void 0;\r\n        }\r\n\r\n        // Leading zero?\r\n        if (!qd[0]) qd.shift();\r\n      }\r\n\r\n      // logBase is 1 when divide is being used for base conversion.\r\n      if (logBase == 1) {\r\n        q.e = e;\r\n        inexact = more;\r\n      } else {\r\n\r\n        // To calculate q.e, first get the number of digits of qd[0].\r\n        for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n        q.e = i + e * logBase - 1;\r\n\r\n        finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n      }\r\n\r\n      return q;\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n   * Check for over/under-flow.\r\n   */\r\n   function finalise(x, sd, rm, isTruncated) {\r\n    var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n      Ctor = x.constructor;\r\n\r\n    // Don't round if sd is null or undefined.\r\n    out: if (sd != null) {\r\n      xd = x.d;\r\n\r\n      // Infinity/NaN.\r\n      if (!xd) return x;\r\n\r\n      // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      // w: the word of xd containing rd, a base 1e7 number.\r\n      // xdi: the index of w within xd.\r\n      // digits: the number of digits of w.\r\n      // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n      // they had leading zeros)\r\n      // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n      // Get the length of the first word of the digits array xd.\r\n      for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n      i = sd - digits;\r\n\r\n      // Is the rounding digit in the first word of xd?\r\n      if (i < 0) {\r\n        i += LOG_BASE;\r\n        j = sd;\r\n        w = xd[xdi = 0];\r\n\r\n        // Get the rounding digit at index j of w.\r\n        rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      } else {\r\n        xdi = Math.ceil((i + 1) / LOG_BASE);\r\n        k = xd.length;\r\n        if (xdi >= k) {\r\n          if (isTruncated) {\r\n\r\n            // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n            for (; k++ <= xdi;) xd.push(0);\r\n            w = rd = 0;\r\n            digits = 1;\r\n            i %= LOG_BASE;\r\n            j = i - LOG_BASE + 1;\r\n          } else {\r\n            break out;\r\n          }\r\n        } else {\r\n          w = k = xd[xdi];\r\n\r\n          // Get the number of digits of w.\r\n          for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n          // Get the index of rd within w.\r\n          i %= LOG_BASE;\r\n\r\n          // Get the index of rd within w, adjusted for leading zeros.\r\n          // The number of leading zeros of w is given by LOG_BASE - digits.\r\n          j = i - LOG_BASE + digits;\r\n\r\n          // Get the rounding digit at index j of w.\r\n          rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n        }\r\n      }\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      isTruncated = isTruncated || sd < 0 ||\r\n        xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n      // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n      // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n      // will give 714.\r\n\r\n      roundUp = rm < 4\r\n        ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n\r\n      if (sd < 1 || !xd[0]) {\r\n        xd.length = 0;\r\n        if (roundUp) {\r\n\r\n          // Convert sd to decimal places.\r\n          sd -= x.e + 1;\r\n\r\n          // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n          xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n          x.e = -sd || 0;\r\n        } else {\r\n\r\n          // Zero.\r\n          xd[0] = x.e = 0;\r\n        }\r\n\r\n        return x;\r\n      }\r\n\r\n      // Remove excess digits.\r\n      if (i == 0) {\r\n        xd.length = xdi;\r\n        k = 1;\r\n        xdi--;\r\n      } else {\r\n        xd.length = xdi + 1;\r\n        k = mathpow(10, LOG_BASE - i);\r\n\r\n        // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n        // j > 0 means i > number of leading zeros of w.\r\n        xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n      }\r\n\r\n      if (roundUp) {\r\n        for (;;) {\r\n\r\n          // Is the digit to be rounded up in the first word of xd?\r\n          if (xdi == 0) {\r\n\r\n            // i will be the length of xd[0] before k is added.\r\n            for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n            j = xd[0] += k;\r\n            for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n            // if i != k the length has increased.\r\n            if (i != k) {\r\n              x.e++;\r\n              if (xd[0] == BASE) xd[0] = 1;\r\n            }\r\n\r\n            break;\r\n          } else {\r\n            xd[xdi] += k;\r\n            if (xd[xdi] != BASE) break;\r\n            xd[xdi--] = 0;\r\n            k = 1;\r\n          }\r\n        }\r\n      }\r\n\r\n      // Remove trailing zeros.\r\n      for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n    }\r\n\r\n    if (external) {\r\n\r\n      // Overflow?\r\n      if (x.e > Ctor.maxE) {\r\n\r\n        // Infinity.\r\n        x.d = null;\r\n        x.e = NaN;\r\n\r\n      // Underflow?\r\n      } else if (x.e < Ctor.minE) {\r\n\r\n        // Zero.\r\n        x.e = 0;\r\n        x.d = [0];\r\n        // Ctor.underflow = true;\r\n      } // else Ctor.underflow = false;\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function finiteToString(x, isExp, sd) {\r\n    if (!x.isFinite()) return nonFiniteToString(x);\r\n    var k,\r\n      e = x.e,\r\n      str = digitsToString(x.d),\r\n      len = str.length;\r\n\r\n    if (isExp) {\r\n      if (sd && (k = sd - len) > 0) {\r\n        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n      } else if (len > 1) {\r\n        str = str.charAt(0) + '.' + str.slice(1);\r\n      }\r\n\r\n      str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n    } else if (e < 0) {\r\n      str = '0.' + getZeroString(-e - 1) + str;\r\n      if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n    } else if (e >= len) {\r\n      str += getZeroString(e + 1 - len);\r\n      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n    } else {\r\n      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n      if (sd && (k = sd - len) > 0) {\r\n        if (e + 1 === len) str += '.';\r\n        str += getZeroString(k);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(digits, e) {\r\n    var w = digits[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n    if (sd > LN10_PRECISION) {\r\n\r\n      // Reset global state in case the exception is caught.\r\n      external = true;\r\n      if (pr) Ctor.precision = pr;\r\n      throw Error(precisionLimitExceeded);\r\n    }\r\n    return finalise(new Ctor(LN10), sd, 1, true);\r\n  }\r\n\r\n\r\n  function getPi(Ctor, sd, rm) {\r\n    if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n    return finalise(new Ctor(PI), sd, rm, true);\r\n  }\r\n\r\n\r\n  function getPrecision(digits) {\r\n    var w = digits.length - 1,\r\n      len = w * LOG_BASE + 1;\r\n\r\n    w = digits[w];\r\n\r\n    // If non-zero...\r\n    if (w) {\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      for (; w % 10 == 0; w /= 10) len--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = digits[0]; w >= 10; w /= 10) len++;\r\n    }\r\n\r\n    return len;\r\n  }\r\n\r\n\r\n  function getZeroString(k) {\r\n    var zs = '';\r\n    for (; k--;) zs += '0';\r\n    return zs;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n   * integer of type number.\r\n   *\r\n   * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n   *\r\n   */\r\n  function intPow(Ctor, x, n, pr) {\r\n    var isTruncated,\r\n      r = new Ctor(1),\r\n\r\n      // Max n of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n    external = false;\r\n\r\n    for (;;) {\r\n      if (n % 2) {\r\n        r = r.times(x);\r\n        if (truncate(r.d, k)) isTruncated = true;\r\n      }\r\n\r\n      n = mathfloor(n / 2);\r\n      if (n === 0) {\r\n\r\n        // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n        n = r.d.length - 1;\r\n        if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n        break;\r\n      }\r\n\r\n      x = x.times(x);\r\n      truncate(x.d, k);\r\n    }\r\n\r\n    external = true;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  function isOdd(n) {\r\n    return n.d[n.d.length - 1] & 1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.\r\n   */\r\n  function maxOrMin(Ctor, args, ltgt) {\r\n    var y,\r\n      x = new Ctor(args[0]),\r\n      i = 0;\r\n\r\n    for (; ++i < args.length;) {\r\n      y = new Ctor(args[i]);\r\n      if (!y.s) {\r\n        x = y;\r\n        break;\r\n      } else if (x[ltgt](y)) {\r\n        x = y;\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n   * digits.\r\n   *\r\n   * Taylor/Maclaurin series.\r\n   *\r\n   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n   *\r\n   * Argument reduction:\r\n   *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n   *   exp(x) = exp(x / 2^k)^(2^k)\r\n   *\r\n   * Previously, the argument was initially reduced by\r\n   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n   * found to be slower than just dividing repeatedly by 32 as above.\r\n   *\r\n   * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n   * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(Infinity)  = Infinity\r\n   *  exp(-Infinity) = 0\r\n   *  exp(NaN)       = NaN\r\n   *  exp(±0)        = 1\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   *  The result will always be correctly rounded.\r\n   *\r\n   */\r\n  function naturalExponential(x, sd) {\r\n    var denominator, guard, j, pow, sum, t, wpr,\r\n      rep = 0,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // 0/NaN/Infinity?\r\n    if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n      return new Ctor(x.d\r\n        ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n        : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n    }\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    t = new Ctor(0.03125);\r\n\r\n    // while abs(x) >= 0.1\r\n    while (x.e > -2) {\r\n\r\n      // x = x / 2^5\r\n      x = x.times(t);\r\n      k += 5;\r\n    }\r\n\r\n    // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n    // necessary to ensure the first 4 rounding digits are correct.\r\n    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n    wpr += guard;\r\n    denominator = pow = sum = new Ctor(1);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = finalise(pow.times(x), wpr, 1);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        j = k;\r\n        while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n        // Check to see if the first 4 rounding digits are [49]999.\r\n        // If so, repeat the summation with a higher precision, otherwise\r\n        // e.g. with precision: 18, rounding: 1\r\n        // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n\r\n          if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += 10;\r\n            denominator = pow = t = new Ctor(1);\r\n            i = 0;\r\n            rep++;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(-n)        = NaN\r\n   *  ln(0)         = -Infinity\r\n   *  ln(-0)        = -Infinity\r\n   *  ln(1)         = 0\r\n   *  ln(Infinity)  = Infinity\r\n   *  ln(-Infinity) = NaN\r\n   *  ln(NaN)       = NaN\r\n   *\r\n   *  ln(n) (n != 1) is non-terminating.\r\n   *\r\n   */\r\n  function naturalLogarithm(y, sd) {\r\n    var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n      n = 1,\r\n      guard = 10,\r\n      x = y,\r\n      xd = x.d,\r\n      Ctor = x.constructor,\r\n      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // Is x negative or Infinity, NaN, 0 or 1?\r\n    if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n      return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n    }\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    Ctor.precision = wpr += guard;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n\r\n    if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n      // Argument reduction.\r\n      // The series converges faster the closer the argument is to 1, so using\r\n      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n      // later be divided by this number, then separate out the power of 10 using\r\n      // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n      // max n is 6 (gives 0.7 - 1.3)\r\n      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n        x = x.times(y);\r\n        c = digitsToString(x.d);\r\n        c0 = c.charAt(0);\r\n        n++;\r\n      }\r\n\r\n      e = x.e;\r\n\r\n      if (c0 > 1) {\r\n        x = new Ctor('0.' + c);\r\n        e++;\r\n      } else {\r\n        x = new Ctor(c0 + '.' + c.slice(1));\r\n      }\r\n    } else {\r\n\r\n      // The argument reduction method above may result in overflow if the argument y is a massive\r\n      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n      // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n      t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n      x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n      Ctor.precision = pr;\r\n\r\n      return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n    }\r\n\r\n    // x1 is x reduced to a value near 1.\r\n    x1 = x;\r\n\r\n    // Taylor series.\r\n    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n    // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n    sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n    x2 = finalise(x.times(x), wpr, 1);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = finalise(numerator.times(x2), wpr, 1);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        sum = sum.times(2);\r\n\r\n        // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n        // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n        // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n        // been repeated previously) and the first 4 rounding digits 9999?\r\n        // If so, restart the summation with a higher precision, otherwise\r\n        // e.g. with precision: 12, rounding: 1\r\n        // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n          if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += guard;\r\n            t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n            x2 = finalise(x.times(x), wpr, 1);\r\n            denominator = rep = 1;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  // ±Infinity, NaN.\r\n  function nonFiniteToString(x) {\r\n    // Unsigned.\r\n    return String(x.s * x.s / 0);\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from string `str`.\r\n   */\r\n  function parseDecimal(x, str) {\r\n    var e, i, len;\r\n\r\n    // Decimal point?\r\n    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = str.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +str.slice(i + 1);\r\n      str = str.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(len - 1) === 48; --len);\r\n    str = str.slice(i, len);\r\n\r\n    if (str) {\r\n      len -= i;\r\n      x.e = e = e - i - 1;\r\n      x.d = [];\r\n\r\n      // Transform base\r\n\r\n      // e is the base 10 exponent.\r\n      // i is where to slice str to get the first word of the digits array.\r\n      i = (e + 1) % LOG_BASE;\r\n      if (e < 0) i += LOG_BASE;\r\n\r\n      if (i < len) {\r\n        if (i) x.d.push(+str.slice(0, i));\r\n        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n        str = str.slice(i);\r\n        i = LOG_BASE - str.length;\r\n      } else {\r\n        i -= len;\r\n      }\r\n\r\n      for (; i--;) str += '0';\r\n      x.d.push(+str);\r\n\r\n      if (external) {\r\n\r\n        // Overflow?\r\n        if (x.e > x.constructor.maxE) {\r\n\r\n          // Infinity.\r\n          x.d = null;\r\n          x.e = NaN;\r\n\r\n        // Underflow?\r\n        } else if (x.e < x.constructor.minE) {\r\n\r\n          // Zero.\r\n          x.e = 0;\r\n          x.d = [0];\r\n          // x.constructor.underflow = true;\r\n        } // else x.constructor.underflow = false;\r\n      }\r\n    } else {\r\n\r\n      // Zero.\r\n      x.e = 0;\r\n      x.d = [0];\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n   */\r\n  function parseOther(x, str) {\r\n    var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n    if (str.indexOf('_') > -1) {\r\n      str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n      if (isDecimal.test(str)) return parseDecimal(x, str);\r\n    } else if (str === 'Infinity' || str === 'NaN') {\r\n      if (!+str) x.s = NaN;\r\n      x.e = NaN;\r\n      x.d = null;\r\n      return x;\r\n    }\r\n\r\n    if (isHex.test(str))  {\r\n      base = 16;\r\n      str = str.toLowerCase();\r\n    } else if (isBinary.test(str))  {\r\n      base = 2;\r\n    } else if (isOctal.test(str))  {\r\n      base = 8;\r\n    } else {\r\n      throw Error(invalidArgument + str);\r\n    }\r\n\r\n    // Is there a binary exponent part?\r\n    i = str.search(/p/i);\r\n\r\n    if (i > 0) {\r\n      p = +str.slice(i + 1);\r\n      str = str.substring(2, i);\r\n    } else {\r\n      str = str.slice(2);\r\n    }\r\n\r\n    // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n    // fraction part will be restored.\r\n    i = str.indexOf('.');\r\n    isFloat = i >= 0;\r\n    Ctor = x.constructor;\r\n\r\n    if (isFloat) {\r\n      str = str.replace('.', '');\r\n      len = str.length;\r\n      i = len - i;\r\n\r\n      // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n      divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n    }\r\n\r\n    xd = convertBase(str, base, BASE);\r\n    xe = xd.length - 1;\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xe; xd[i] === 0; --i) xd.pop();\r\n    if (i < 0) return new Ctor(x.s * 0);\r\n    x.e = getBase10Exponent(xd, xe);\r\n    x.d = xd;\r\n    external = false;\r\n\r\n    // At what precision to perform the division to ensure exact conversion?\r\n    // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n    // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n    // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n    // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n    // Therefore using 4 * the number of digits of str will always be enough.\r\n    if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n    // Multiply by the binary exponent part if present.\r\n    if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n    external = true;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function sine(Ctor, x) {\r\n    var k,\r\n      len = x.d.length;\r\n\r\n    if (len < 3) {\r\n      return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n    }\r\n\r\n    // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n    // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n    // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    k = 1.4 * Math.sqrt(len);\r\n    k = k > 16 ? 16 : k | 0;\r\n\r\n    x = x.times(1 / tinyPow(5, k));\r\n    x = taylorSeries(Ctor, 2, x, x);\r\n\r\n    // Reverse argument reduction\r\n    var sin2_x,\r\n      d5 = new Ctor(5),\r\n      d16 = new Ctor(16),\r\n      d20 = new Ctor(20);\r\n    for (; k--;) {\r\n      sin2_x = x.times(x);\r\n      x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  // Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\n  function taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n    var j, t, u, x2,\r\n      i = 1,\r\n      pr = Ctor.precision,\r\n      k = Math.ceil(pr / LOG_BASE);\r\n\r\n    external = false;\r\n    x2 = x.times(x);\r\n    u = new Ctor(y);\r\n\r\n    for (;;) {\r\n      t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n      y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      t = u.plus(y);\r\n\r\n      if (t.d[k] !== void 0) {\r\n        for (j = k; t.d[j] === u.d[j] && j--;);\r\n        if (j == -1) break;\r\n      }\r\n\r\n      j = u;\r\n      u = y;\r\n      y = t;\r\n      t = j;\r\n      i++;\r\n    }\r\n\r\n    external = true;\r\n    t.d.length = k + 1;\r\n\r\n    return t;\r\n  }\r\n\r\n\r\n  // Exponent e must be positive and non-zero.\r\n  function tinyPow(b, e) {\r\n    var n = b;\r\n    while (--e) n *= b;\r\n    return n;\r\n  }\r\n\r\n\r\n  // Return the absolute value of `x` reduced to less than or equal to half pi.\r\n  function toLessThanHalfPi(Ctor, x) {\r\n    var t,\r\n      isNeg = x.s < 0,\r\n      pi = getPi(Ctor, Ctor.precision, 1),\r\n      halfPi = pi.times(0.5);\r\n\r\n    x = x.abs();\r\n\r\n    if (x.lte(halfPi)) {\r\n      quadrant = isNeg ? 4 : 1;\r\n      return x;\r\n    }\r\n\r\n    t = x.divToInt(pi);\r\n\r\n    if (t.isZero()) {\r\n      quadrant = isNeg ? 3 : 2;\r\n    } else {\r\n      x = x.minus(t.times(pi));\r\n\r\n      // 0 <= x < pi\r\n      if (x.lte(halfPi)) {\r\n        quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n        return x;\r\n      }\r\n\r\n      quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n    }\r\n\r\n    return x.minus(pi).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return the value of Decimal `x` as a string in base `baseOut`.\r\n   *\r\n   * If the optional `sd` argument is present include a binary exponent suffix.\r\n   */\r\n  function toStringBinary(x, baseOut, sd, rm) {\r\n    var base, e, i, k, len, roundUp, str, xd, y,\r\n      Ctor = x.constructor,\r\n      isExp = sd !== void 0;\r\n\r\n    if (isExp) {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    } else {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    }\r\n\r\n    if (!x.isFinite()) {\r\n      str = nonFiniteToString(x);\r\n    } else {\r\n      str = finiteToString(x);\r\n      i = str.indexOf('.');\r\n\r\n      // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n      // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n      // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n      // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n      if (isExp) {\r\n        base = 2;\r\n        if (baseOut == 16) {\r\n          sd = sd * 4 - 3;\r\n        } else if (baseOut == 8) {\r\n          sd = sd * 3 - 2;\r\n        }\r\n      } else {\r\n        base = baseOut;\r\n      }\r\n\r\n      // Convert the number as an integer then divide the result by its base raised to a power such\r\n      // that the fraction part will be restored.\r\n\r\n      // Non-integer.\r\n      if (i >= 0) {\r\n        str = str.replace('.', '');\r\n        y = new Ctor(1);\r\n        y.e = str.length - i;\r\n        y.d = convertBase(finiteToString(y), 10, base);\r\n        y.e = y.d.length;\r\n      }\r\n\r\n      xd = convertBase(str, 10, base);\r\n      e = len = xd.length;\r\n\r\n      // Remove trailing zeros.\r\n      for (; xd[--len] == 0;) xd.pop();\r\n\r\n      if (!xd[0]) {\r\n        str = isExp ? '0p+0' : '0';\r\n      } else {\r\n        if (i < 0) {\r\n          e--;\r\n        } else {\r\n          x = new Ctor(x);\r\n          x.d = xd;\r\n          x.e = e;\r\n          x = divide(x, y, sd, rm, 0, base);\r\n          xd = x.d;\r\n          e = x.e;\r\n          roundUp = inexact;\r\n        }\r\n\r\n        // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        i = xd[sd];\r\n        k = base / 2;\r\n        roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n        roundUp = rm < 4\r\n          ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n          : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n            rm === (x.s < 0 ? 8 : 7));\r\n\r\n        xd.length = sd;\r\n\r\n        if (roundUp) {\r\n\r\n          // Rounding up may mean the previous digit has to be rounded up and so on.\r\n          for (; ++xd[--sd] > base - 1;) {\r\n            xd[sd] = 0;\r\n            if (!sd) {\r\n              ++e;\r\n              xd.unshift(1);\r\n            }\r\n          }\r\n        }\r\n\r\n        // Determine trailing zeros.\r\n        for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n        // E.g. [4, 11, 15] becomes 4bf.\r\n        for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n        // Add binary exponent suffix?\r\n        if (isExp) {\r\n          if (len > 1) {\r\n            if (baseOut == 16 || baseOut == 8) {\r\n              i = baseOut == 16 ? 4 : 3;\r\n              for (--len; len % i; len++) str += '0';\r\n              xd = convertBase(str, base, baseOut);\r\n              for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n              // xd[0] will always be be 1\r\n              for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n            } else {\r\n              str = str.charAt(0) + '.' + str.slice(1);\r\n            }\r\n          }\r\n\r\n          str =  str + (e < 0 ? 'p' : 'p+') + e;\r\n        } else if (e < 0) {\r\n          for (; ++e;) str = '0' + str;\r\n          str = '0.' + str;\r\n        } else {\r\n          if (++e > len) for (e -= len; e-- ;) str += '0';\r\n          else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n        }\r\n      }\r\n\r\n      str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n    }\r\n\r\n    return x.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Does not strip trailing zeros.\r\n  function truncate(arr, len) {\r\n    if (arr.length > len) {\r\n      arr.length = len;\r\n      return true;\r\n    }\r\n  }\r\n\r\n\r\n  // Decimal methods\r\n\r\n\r\n  /*\r\n   *  abs\r\n   *  acos\r\n   *  acosh\r\n   *  add\r\n   *  asin\r\n   *  asinh\r\n   *  atan\r\n   *  atanh\r\n   *  atan2\r\n   *  cbrt\r\n   *  ceil\r\n   *  clamp\r\n   *  clone\r\n   *  config\r\n   *  cos\r\n   *  cosh\r\n   *  div\r\n   *  exp\r\n   *  floor\r\n   *  hypot\r\n   *  ln\r\n   *  log\r\n   *  log2\r\n   *  log10\r\n   *  max\r\n   *  min\r\n   *  mod\r\n   *  mul\r\n   *  pow\r\n   *  random\r\n   *  round\r\n   *  set\r\n   *  sign\r\n   *  sin\r\n   *  sinh\r\n   *  sqrt\r\n   *  sub\r\n   *  sum\r\n   *  tan\r\n   *  tanh\r\n   *  trunc\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function abs(x) {\r\n    return new this(x).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function acos(x) {\r\n    return new this(x).acos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function acosh(x) {\r\n    return new this(x).acosh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function add(x, y) {\r\n    return new this(x).plus(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function asin(x) {\r\n    return new this(x).asin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function asinh(x) {\r\n    return new this(x).asinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function atan(x) {\r\n    return new this(x).atan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function atanh(x) {\r\n    return new this(x).atanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n   * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi, pi]\r\n   *\r\n   * y {number|string|Decimal} The y-coordinate.\r\n   * x {number|string|Decimal} The x-coordinate.\r\n   *\r\n   * atan2(±0, -0)               = ±pi\r\n   * atan2(±0, +0)               = ±0\r\n   * atan2(±0, -x)               = ±pi for x > 0\r\n   * atan2(±0, x)                = ±0 for x > 0\r\n   * atan2(-y, ±0)               = -pi/2 for y > 0\r\n   * atan2(y, ±0)                = pi/2 for y > 0\r\n   * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n   * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n   * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n   * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n   * atan2(±Infinity, +Infinity) = ±pi/4\r\n   * atan2(NaN, x) = NaN\r\n   * atan2(y, NaN) = NaN\r\n   *\r\n   */\r\n  function atan2(y, x) {\r\n    y = new this(y);\r\n    x = new this(x);\r\n    var r,\r\n      pr = this.precision,\r\n      rm = this.rounding,\r\n      wpr = pr + 4;\r\n\r\n    // Either NaN\r\n    if (!y.s || !x.s) {\r\n      r = new this(NaN);\r\n\r\n    // Both ±Infinity\r\n    } else if (!y.d && !x.d) {\r\n      r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n      r.s = y.s;\r\n\r\n    // x is ±Infinity or y is ±0\r\n    } else if (!x.d || y.isZero()) {\r\n      r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n      r.s = y.s;\r\n\r\n    // y is ±Infinity or x is ±0\r\n    } else if (!y.d || x.isZero()) {\r\n      r = getPi(this, wpr, 1).times(0.5);\r\n      r.s = y.s;\r\n\r\n    // Both non-zero and finite\r\n    } else if (x.s < 0) {\r\n      this.precision = wpr;\r\n      this.rounding = 1;\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n      x = getPi(this, wpr, 1);\r\n      this.precision = pr;\r\n      this.rounding = rm;\r\n      r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n    } else {\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function cbrt(x) {\r\n    return new this(x).cbrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ceil(x) {\r\n    return finalise(x = new this(x), x.e + 1, 2);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  function clamp(x, min, max) {\r\n    return new this(x).clamp(min, max);\r\n  }\r\n\r\n\r\n  /*\r\n   * Configure global settings for a Decimal constructor.\r\n   *\r\n   * `obj` is an object with one or more of the following properties,\r\n   *\r\n   *   precision  {number}\r\n   *   rounding   {number}\r\n   *   toExpNeg   {number}\r\n   *   toExpPos   {number}\r\n   *   maxE       {number}\r\n   *   minE       {number}\r\n   *   modulo     {number}\r\n   *   crypto     {boolean|number}\r\n   *   defaults   {true}\r\n   *\r\n   * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n   *\r\n   */\r\n  function config(obj) {\r\n    if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n    var i, p, v,\r\n      useDefaults = obj.defaults === true,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -EXP_LIMIT, 0,\r\n        'toExpPos', 0, EXP_LIMIT,\r\n        'maxE', 0, EXP_LIMIT,\r\n        'minE', -EXP_LIMIT, 0,\r\n        'modulo', 0, 9\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n      if ((v = obj[p]) !== void 0) {\r\n        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n    if ((v = obj[p]) !== void 0) {\r\n      if (v === true || v === false || v === 0 || v === 1) {\r\n        if (v) {\r\n          if (typeof crypto != 'undefined' && crypto &&\r\n            (crypto.getRandomValues || crypto.randomBytes)) {\r\n            this[p] = true;\r\n          } else {\r\n            throw Error(cryptoUnavailable);\r\n          }\r\n        } else {\r\n          this[p] = false;\r\n        }\r\n      } else {\r\n        throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cos(x) {\r\n    return new this(x).cos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cosh(x) {\r\n    return new this(x).cosh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n   * constructor.\r\n   *\r\n   */\r\n  function clone(obj) {\r\n    var i, p, ps;\r\n\r\n    /*\r\n     * The Decimal constructor and exported function.\r\n     * Return a new Decimal instance.\r\n     *\r\n     * v {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(v) {\r\n      var e, i, t,\r\n        x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n      // which points to Object.\r\n      x.constructor = Decimal;\r\n\r\n      // Duplicate.\r\n      if (isDecimalInstance(v)) {\r\n        x.s = v.s;\r\n\r\n        if (external) {\r\n          if (!v.d || v.e > Decimal.maxE) {\r\n\r\n            // Infinity.\r\n            x.e = NaN;\r\n            x.d = null;\r\n          } else if (v.e < Decimal.minE) {\r\n\r\n            // Zero.\r\n            x.e = 0;\r\n            x.d = [0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.d = v.d.slice();\r\n          }\r\n        } else {\r\n          x.e = v.e;\r\n          x.d = v.d ? v.d.slice() : v.d;\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      t = typeof v;\r\n\r\n      if (t === 'number') {\r\n        if (v === 0) {\r\n          x.s = 1 / v < 0 ? -1 : 1;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        if (v < 0) {\r\n          v = -v;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 1;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (v === ~~v && v < 1e7) {\r\n          for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n          if (external) {\r\n            if (e > Decimal.maxE) {\r\n              x.e = NaN;\r\n              x.d = null;\r\n            } else if (e < Decimal.minE) {\r\n              x.e = 0;\r\n              x.d = [0];\r\n            } else {\r\n              x.e = e;\r\n              x.d = [v];\r\n            }\r\n          } else {\r\n            x.e = e;\r\n            x.d = [v];\r\n          }\r\n\r\n          return;\r\n\r\n        // Infinity, NaN.\r\n        } else if (v * 0 !== 0) {\r\n          if (!v) x.s = NaN;\r\n          x.e = NaN;\r\n          x.d = null;\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, v.toString());\r\n\r\n      } else if (t !== 'string') {\r\n        throw Error(invalidArgument + v);\r\n      }\r\n\r\n      // Minus sign?\r\n      if ((i = v.charCodeAt(0)) === 45) {\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        // Plus sign?\r\n        if (i === 43) v = v.slice(1);\r\n        x.s = 1;\r\n      }\r\n\r\n      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n    }\r\n\r\n    Decimal.prototype = P;\r\n\r\n    Decimal.ROUND_UP = 0;\r\n    Decimal.ROUND_DOWN = 1;\r\n    Decimal.ROUND_CEIL = 2;\r\n    Decimal.ROUND_FLOOR = 3;\r\n    Decimal.ROUND_HALF_UP = 4;\r\n    Decimal.ROUND_HALF_DOWN = 5;\r\n    Decimal.ROUND_HALF_EVEN = 6;\r\n    Decimal.ROUND_HALF_CEIL = 7;\r\n    Decimal.ROUND_HALF_FLOOR = 8;\r\n    Decimal.EUCLID = 9;\r\n\r\n    Decimal.config = Decimal.set = config;\r\n    Decimal.clone = clone;\r\n    Decimal.isDecimal = isDecimalInstance;\r\n\r\n    Decimal.abs = abs;\r\n    Decimal.acos = acos;\r\n    Decimal.acosh = acosh;        // ES6\r\n    Decimal.add = add;\r\n    Decimal.asin = asin;\r\n    Decimal.asinh = asinh;        // ES6\r\n    Decimal.atan = atan;\r\n    Decimal.atanh = atanh;        // ES6\r\n    Decimal.atan2 = atan2;\r\n    Decimal.cbrt = cbrt;          // ES6\r\n    Decimal.ceil = ceil;\r\n    Decimal.clamp = clamp;\r\n    Decimal.cos = cos;\r\n    Decimal.cosh = cosh;          // ES6\r\n    Decimal.div = div;\r\n    Decimal.exp = exp;\r\n    Decimal.floor = floor;\r\n    Decimal.hypot = hypot;        // ES6\r\n    Decimal.ln = ln;\r\n    Decimal.log = log;\r\n    Decimal.log10 = log10;        // ES6\r\n    Decimal.log2 = log2;          // ES6\r\n    Decimal.max = max;\r\n    Decimal.min = min;\r\n    Decimal.mod = mod;\r\n    Decimal.mul = mul;\r\n    Decimal.pow = pow;\r\n    Decimal.random = random;\r\n    Decimal.round = round;\r\n    Decimal.sign = sign;          // ES6\r\n    Decimal.sin = sin;\r\n    Decimal.sinh = sinh;          // ES6\r\n    Decimal.sqrt = sqrt;\r\n    Decimal.sub = sub;\r\n    Decimal.sum = sum;\r\n    Decimal.tan = tan;\r\n    Decimal.tanh = tanh;          // ES6\r\n    Decimal.trunc = trunc;        // ES6\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      if (obj.defaults !== true) {\r\n        ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n        for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n      }\r\n    }\r\n\r\n    Decimal.config(obj);\r\n\r\n    return Decimal;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function div(x, y) {\r\n    return new this(x).div(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The power to which to raise the base of the natural log.\r\n   *\r\n   */\r\n  function exp(x) {\r\n    return new this(x).exp();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function floor(x) {\r\n    return finalise(x = new this(x), x.e + 1, 3);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function hypot() {\r\n    var i, n,\r\n      t = new this(0);\r\n\r\n    external = false;\r\n\r\n    for (i = 0; i < arguments.length;) {\r\n      n = new this(arguments[i++]);\r\n      if (!n.d) {\r\n        if (n.s) {\r\n          external = true;\r\n          return new this(1 / 0);\r\n        }\r\n        t = n;\r\n      } else if (t.d) {\r\n        t = t.plus(n.times(n));\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return t.sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  function isDecimalInstance(obj) {\r\n    return obj instanceof Decimal || obj && obj.toStringTag === tag || false;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ln(x) {\r\n    return new this(x).ln();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n   * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * log[y](x)\r\n   *\r\n   * x {number|string|Decimal} The argument of the logarithm.\r\n   * y {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  function log(x, y) {\r\n    return new this(x).log(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log2(x) {\r\n    return new this(x).log(2);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log10(x) {\r\n    return new this(x).log(10);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function max() {\r\n    return maxOrMin(this, arguments, 'lt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function min() {\r\n    return maxOrMin(this, arguments, 'gt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mod(x, y) {\r\n    return new this(x).mod(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mul(x, y) {\r\n    return new this(x).mul(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The base.\r\n   * y {number|string|Decimal} The exponent.\r\n   *\r\n   */\r\n  function pow(x, y) {\r\n    return new this(x).pow(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n   * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n   * are produced).\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n   *\r\n   */\r\n  function random(sd) {\r\n    var d, e, k, n,\r\n      i = 0,\r\n      r = new this(1),\r\n      rd = [];\r\n\r\n    if (sd === void 0) sd = this.precision;\r\n    else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    k = Math.ceil(sd / LOG_BASE);\r\n\r\n    if (!this.crypto) {\r\n      for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n    // Browsers supporting crypto.getRandomValues.\r\n    } else if (crypto.getRandomValues) {\r\n      d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n      for (; i < k;) {\r\n        n = d[i];\r\n\r\n        // 0 <= n < 4294967296\r\n        // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n        if (n >= 4.29e9) {\r\n          d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n        } else {\r\n\r\n          // 0 <= n <= 4289999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd[i++] = n % 1e7;\r\n        }\r\n      }\r\n\r\n    // Node.js supporting crypto.randomBytes.\r\n    } else if (crypto.randomBytes) {\r\n\r\n      // buffer\r\n      d = crypto.randomBytes(k *= 4);\r\n\r\n      for (; i < k;) {\r\n\r\n        // 0 <= n < 2147483648\r\n        n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n        // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n        if (n >= 2.14e9) {\r\n          crypto.randomBytes(4).copy(d, i);\r\n        } else {\r\n\r\n          // 0 <= n <= 2139999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd.push(n % 1e7);\r\n          i += 4;\r\n        }\r\n      }\r\n\r\n      i = k / 4;\r\n    } else {\r\n      throw Error(cryptoUnavailable);\r\n    }\r\n\r\n    k = rd[--i];\r\n    sd %= LOG_BASE;\r\n\r\n    // Convert trailing digits to zeros according to sd.\r\n    if (k && sd) {\r\n      n = mathpow(10, LOG_BASE - sd);\r\n      rd[i] = (k / n | 0) * n;\r\n    }\r\n\r\n    // Remove trailing words which are zero.\r\n    for (; rd[i] === 0; i--) rd.pop();\r\n\r\n    // Zero?\r\n    if (i < 0) {\r\n      e = 0;\r\n      rd = [0];\r\n    } else {\r\n      e = -1;\r\n\r\n      // Remove leading words which are zero and adjust exponent accordingly.\r\n      for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n      // Count the digits of the first word of rd to determine leading zeros.\r\n      for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n      // Adjust the exponent for leading zeros of the first word of rd.\r\n      if (k < LOG_BASE) e -= LOG_BASE - k;\r\n    }\r\n\r\n    r.e = e;\r\n    r.d = rd;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n   *\r\n   * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function round(x) {\r\n    return finalise(x = new this(x), x.e + 1, this.rounding);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if x > 0,\r\n   *  -1    if x < 0,\r\n   *   0    if x is 0,\r\n   *  -0    if x is -0,\r\n   *   NaN  otherwise\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function sign(x) {\r\n    x = new this(x);\r\n    return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sin(x) {\r\n    return new this(x).sin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sinh(x) {\r\n    return new this(x).sinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function sqrt(x) {\r\n    return new this(x).sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function sub(x, y) {\r\n    return new this(x).sub(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * Only the result is rounded, not the intermediate calculations.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function sum() {\r\n    var i = 0,\r\n      args = arguments,\r\n      x = new this(args[i]);\r\n\r\n    external = false;\r\n    for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n    external = true;\r\n\r\n    return finalise(x, this.precision, this.rounding);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tan(x) {\r\n    return new this(x).tan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tanh(x) {\r\n    return new this(x).tanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` truncated to an integer.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function trunc(x) {\r\n    return finalise(x = new this(x), x.e + 1, 1);\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(DEFAULTS);\r\n  Decimal.prototype.constructor = Decimal;\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Create the internal constants from their string values.\r\n  LN10 = new Decimal(LN10);\r\n  PI = new Decimal(PI);\r\n\r\n\r\n  // Export.\r\n\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () {\r\n      return Decimal;\r\n    });\r\n\r\n  // Node and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    if (typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol') {\r\n      P[Symbol['for']('nodejs.util.inspect.custom')] = P.toString;\r\n      P[Symbol.toStringTag] = 'Decimal';\r\n    }\r\n\r\n    module.exports = Decimal;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalScope) {\r\n      globalScope = typeof self != 'undefined' && self && self.self == self ? self : window;\r\n    }\r\n\r\n    noConflict = globalScope.Decimal;\r\n    Decimal.noConflict = function () {\r\n      globalScope.Decimal = noConflict;\r\n      return Decimal;\r\n    };\r\n\r\n    globalScope.Decimal = Decimal;\r\n  }\r\n})(this);\r\n","/**\n * @license Fraction.js v4.2.0 05/03/2022\n * https://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2021, Robert Eisele (robert@xarg.org)\n * Dual licensed under the MIT or GPL Version 2 licenses.\n **/\n\n\n/**\n *\n * This class offers the possibility to calculate fractions.\n * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.\n *\n * Array/Object form\n * [ 0 => <nominator>, 1 => <denominator> ]\n * [ n => <nominator>, d => <denominator> ]\n *\n * Integer form\n * - Single integer value\n *\n * Double form\n * - Single double value\n *\n * String form\n * 123.456 - a simple double\n * 123/456 - a string fraction\n * 123.'456' - a double with repeating decimal places\n * 123.(456) - synonym\n * 123.45'6' - a double with repeating last place\n * 123.45(6) - synonym\n *\n * Example:\n *\n * var f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n(function(root) {\n\n  \"use strict\";\n\n  // Maximum search depth for cyclic rational numbers. 2000 should be more than enough.\n  // Example: 1/7 = 0.(142857) has 6 repeating decimal places.\n  // If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits\n  var MAX_CYCLE_LEN = 2000;\n\n  // Parsed data to avoid calling \"new\" all the time\n  var P = {\n    \"s\": 1,\n    \"n\": 0,\n    \"d\": 1\n  };\n\n  function assign(n, s) {\n\n    if (isNaN(n = parseInt(n, 10))) {\n      throw Fraction['InvalidParameter'];\n    }\n    return n * s;\n  }\n\n  // Creates a new Fraction internally without the need of the bulky constructor\n  function newFraction(n, d) {\n\n    if (d === 0) {\n      throw Fraction['DivisionByZero'];\n    }\n\n    var f = Object.create(Fraction.prototype);\n    f[\"s\"] = n < 0 ? -1 : 1;\n\n    n = n < 0 ? -n : n;\n\n    var a = gcd(n, d);\n\n    f[\"n\"] = n / a;\n    f[\"d\"] = d / a;\n    return f;\n  }\n\n  function factorize(num) {\n\n    var factors = {};\n\n    var n = num;\n    var i = 2;\n    var s = 4;\n\n    while (s <= n) {\n\n      while (n % i === 0) {\n        n/= i;\n        factors[i] = (factors[i] || 0) + 1;\n      }\n      s+= 1 + 2 * i++;\n    }\n\n    if (n !== num) {\n      if (n > 1)\n        factors[n] = (factors[n] || 0) + 1;\n    } else {\n      factors[num] = (factors[num] || 0) + 1;\n    }\n    return factors;\n  }\n\n  var parse = function(p1, p2) {\n\n    var n = 0, d = 1, s = 1;\n    var v = 0, w = 0, x = 0, y = 1, z = 1;\n\n    var A = 0, B = 1;\n    var C = 1, D = 1;\n\n    var N = 10000000;\n    var M;\n\n    if (p1 === undefined || p1 === null) {\n      /* void */\n    } else if (p2 !== undefined) {\n      n = p1;\n      d = p2;\n      s = n * d;\n\n      if (n % 1 !== 0 || d % 1 !== 0) {\n        throw Fraction['NonIntegerParameter'];\n      }\n\n    } else\n      switch (typeof p1) {\n\n        case \"object\":\n          {\n            if (\"d\" in p1 && \"n\" in p1) {\n              n = p1[\"n\"];\n              d = p1[\"d\"];\n              if (\"s\" in p1)\n                n*= p1[\"s\"];\n            } else if (0 in p1) {\n              n = p1[0];\n              if (1 in p1)\n                d = p1[1];\n            } else {\n              throw Fraction['InvalidParameter'];\n            }\n            s = n * d;\n            break;\n          }\n        case \"number\":\n          {\n            if (p1 < 0) {\n              s = p1;\n              p1 = -p1;\n            }\n\n            if (p1 % 1 === 0) {\n              n = p1;\n            } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow\n\n              if (p1 >= 1) {\n                z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));\n                p1/= z;\n              }\n\n              // Using Farey Sequences\n              // http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/\n\n              while (B <= N && D <= N) {\n                M = (A + C) / (B + D);\n\n                if (p1 === M) {\n                  if (B + D <= N) {\n                    n = A + C;\n                    d = B + D;\n                  } else if (D > B) {\n                    n = C;\n                    d = D;\n                  } else {\n                    n = A;\n                    d = B;\n                  }\n                  break;\n\n                } else {\n\n                  if (p1 > M) {\n                    A+= C;\n                    B+= D;\n                  } else {\n                    C+= A;\n                    D+= B;\n                  }\n\n                  if (B > N) {\n                    n = C;\n                    d = D;\n                  } else {\n                    n = A;\n                    d = B;\n                  }\n                }\n              }\n              n*= z;\n            } else if (isNaN(p1) || isNaN(p2)) {\n              d = n = NaN;\n            }\n            break;\n          }\n        case \"string\":\n          {\n            B = p1.match(/\\d+|./g);\n\n            if (B === null)\n              throw Fraction['InvalidParameter'];\n\n            if (B[A] === '-') {// Check for minus sign at the beginning\n              s = -1;\n              A++;\n            } else if (B[A] === '+') {// Check for plus sign at the beginning\n              A++;\n            }\n\n            if (B.length === A + 1) { // Check if it's just a simple number \"1234\"\n              w = assign(B[A++], s);\n            } else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number\n\n              if (B[A] !== '.') { // Handle 0.5 and .5\n                v = assign(B[A++], s);\n              }\n              A++;\n\n              // Check for decimal places\n              if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === \"'\" && B[A + 3] === \"'\") {\n                w = assign(B[A], s);\n                y = Math.pow(10, B[A].length);\n                A++;\n              }\n\n              // Check for repeating places\n              if (B[A] === '(' && B[A + 2] === ')' || B[A] === \"'\" && B[A + 2] === \"'\") {\n                x = assign(B[A + 1], s);\n                z = Math.pow(10, B[A + 1].length) - 1;\n                A+= 3;\n              }\n\n            } else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n              w = assign(B[A], s);\n              y = assign(B[A + 2], 1);\n              A+= 3;\n            } else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n              v = assign(B[A], s);\n              w = assign(B[A + 2], s);\n              y = assign(B[A + 4], 1);\n              A+= 5;\n            }\n\n            if (B.length <= A) { // Check for more tokens on the stack\n              d = y * z;\n              s = /* void */\n              n = x + d * v + z * w;\n              break;\n            }\n\n            /* Fall through on error */\n          }\n        default:\n          throw Fraction['InvalidParameter'];\n      }\n\n    if (d === 0) {\n      throw Fraction['DivisionByZero'];\n    }\n\n    P[\"s\"] = s < 0 ? -1 : 1;\n    P[\"n\"] = Math.abs(n);\n    P[\"d\"] = Math.abs(d);\n  };\n\n  function modpow(b, e, m) {\n\n    var r = 1;\n    for (; e > 0; b = (b * b) % m, e >>= 1) {\n\n      if (e & 1) {\n        r = (r * b) % m;\n      }\n    }\n    return r;\n  }\n\n\n  function cycleLen(n, d) {\n\n    for (; d % 2 === 0;\n      d/= 2) {\n    }\n\n    for (; d % 5 === 0;\n      d/= 5) {\n    }\n\n    if (d === 1) // Catch non-cyclic numbers\n      return 0;\n\n    // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:\n    // 10^(d-1) % d == 1\n    // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,\n    // as we want to translate the numbers to strings.\n\n    var rem = 10 % d;\n    var t = 1;\n\n    for (; rem !== 1; t++) {\n      rem = rem * 10 % d;\n\n      if (t > MAX_CYCLE_LEN)\n        return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`\n    }\n    return t;\n  }\n\n\n  function cycleStart(n, d, len) {\n\n    var rem1 = 1;\n    var rem2 = modpow(10, len, d);\n\n    for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)\n      // Solve 10^s == 10^(s+t) (mod d)\n\n      if (rem1 === rem2)\n        return t;\n\n      rem1 = rem1 * 10 % d;\n      rem2 = rem2 * 10 % d;\n    }\n    return 0;\n  }\n\n  function gcd(a, b) {\n\n    if (!a)\n      return b;\n    if (!b)\n      return a;\n\n    while (1) {\n      a%= b;\n      if (!a)\n        return b;\n      b%= a;\n      if (!b)\n        return a;\n    }\n  };\n\n  /**\n   * Module constructor\n   *\n   * @constructor\n   * @param {number|Fraction=} a\n   * @param {number=} b\n   */\n  function Fraction(a, b) {\n\n    parse(a, b);\n\n    if (this instanceof Fraction) {\n      a = gcd(P[\"d\"], P[\"n\"]); // Abuse variable a\n      this[\"s\"] = P[\"s\"];\n      this[\"n\"] = P[\"n\"] / a;\n      this[\"d\"] = P[\"d\"] / a;\n    } else {\n      return newFraction(P['s'] * P['n'], P['d']);\n    }\n  }\n\n  Fraction['DivisionByZero'] = new Error(\"Division by Zero\");\n  Fraction['InvalidParameter'] = new Error(\"Invalid argument\");\n  Fraction['NonIntegerParameter'] = new Error(\"Parameters must be integer\");\n\n  Fraction.prototype = {\n\n    \"s\": 1,\n    \"n\": 0,\n    \"d\": 1,\n\n    /**\n     * Calculates the absolute value\n     *\n     * Ex: new Fraction(-4).abs() => 4\n     **/\n    \"abs\": function() {\n\n      return newFraction(this[\"n\"], this[\"d\"]);\n    },\n\n    /**\n     * Inverts the sign of the current fraction\n     *\n     * Ex: new Fraction(-4).neg() => 4\n     **/\n    \"neg\": function() {\n\n      return newFraction(-this[\"s\"] * this[\"n\"], this[\"d\"]);\n    },\n\n    /**\n     * Adds two rational numbers\n     *\n     * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => 467 / 30\n     **/\n    \"add\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * this[\"n\"] * P[\"d\"] + P[\"s\"] * this[\"d\"] * P[\"n\"],\n        this[\"d\"] * P[\"d\"]\n      );\n    },\n\n    /**\n     * Subtracts two rational numbers\n     *\n     * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => -427 / 30\n     **/\n    \"sub\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * this[\"d\"] * P[\"n\"],\n        this[\"d\"] * P[\"d\"]\n      );\n    },\n\n    /**\n     * Multiplies two rational numbers\n     *\n     * Ex: new Fraction(\"-17.(345)\").mul(3) => 5776 / 111\n     **/\n    \"mul\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"n\"],\n        this[\"d\"] * P[\"d\"]\n      );\n    },\n\n    /**\n     * Divides two rational numbers\n     *\n     * Ex: new Fraction(\"-17.(345)\").inverse().div(3)\n     **/\n    \"div\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"d\"],\n        this[\"d\"] * P[\"n\"]\n      );\n    },\n\n    /**\n     * Clones the actual object\n     *\n     * Ex: new Fraction(\"-17.(345)\").clone()\n     **/\n    \"clone\": function() {\n      return newFraction(this['s'] * this['n'], this['d']);\n    },\n\n    /**\n     * Calculates the modulo of two rational numbers - a more precise fmod\n     *\n     * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)\n     **/\n    \"mod\": function(a, b) {\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return new Fraction(NaN);\n      }\n\n      if (a === undefined) {\n        return newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n      }\n\n      parse(a, b);\n      if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n        throw Fraction['DivisionByZero'];\n      }\n\n      /*\n       * First silly attempt, kinda slow\n       *\n       return that[\"sub\"]({\n       \"n\": num[\"n\"] * Math.floor((this.n / this.d) / (num.n / num.d)),\n       \"d\": num[\"d\"],\n       \"s\": this[\"s\"]\n       });*/\n\n      /*\n       * New attempt: a1 / b1 = a2 / b2 * q + r\n       * => b2 * a1 = a2 * b1 * q + b1 * b2 * r\n       * => (b2 * a1 % a2 * b1) / (b1 * b2)\n       */\n      return newFraction(\n        this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n        P[\"d\"] * this[\"d\"]\n      );\n    },\n\n    /**\n     * Calculates the fractional gcd of two rational numbers\n     *\n     * Ex: new Fraction(5,8).gcd(3,7) => 1/56\n     */\n    \"gcd\": function(a, b) {\n\n      parse(a, b);\n\n      // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)\n\n      return newFraction(gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]), P[\"d\"] * this[\"d\"]);\n    },\n\n    /**\n     * Calculates the fractional lcm of two rational numbers\n     *\n     * Ex: new Fraction(5,8).lcm(3,7) => 15\n     */\n    \"lcm\": function(a, b) {\n\n      parse(a, b);\n\n      // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n      if (P[\"n\"] === 0 && this[\"n\"] === 0) {\n        return newFraction(0, 1);\n      }\n      return newFraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]));\n    },\n\n    /**\n     * Calculates the ceil of a rational number\n     *\n     * Ex: new Fraction('4.(3)').ceil() => (5 / 1)\n     **/\n    \"ceil\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return newFraction(Math.ceil(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Calculates the floor of a rational number\n     *\n     * Ex: new Fraction('4.(3)').floor() => (4 / 1)\n     **/\n    \"floor\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return newFraction(Math.floor(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Rounds a rational numbers\n     *\n     * Ex: new Fraction('4.(3)').round() => (4 / 1)\n     **/\n    \"round\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return newFraction(Math.round(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Gets the inverse of the fraction, means numerator and denominator are exchanged\n     *\n     * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n     **/\n    \"inverse\": function() {\n\n      return newFraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n    },\n\n    /**\n     * Calculates the fraction to some rational exponent, if possible\n     *\n     * Ex: new Fraction(-1,2).pow(-3) => -8\n     */\n    \"pow\": function(a, b) {\n\n      parse(a, b);\n\n      // Trivial case when exp is an integer\n\n      if (P['d'] === 1) {\n\n        if (P['s'] < 0) {\n          return newFraction(Math.pow(this['s'] * this[\"d\"], P['n']), Math.pow(this[\"n\"], P['n']));\n        } else {\n          return newFraction(Math.pow(this['s'] * this[\"n\"], P['n']), Math.pow(this[\"d\"], P['n']));\n        }\n      }\n\n      // Negative roots become complex\n      //     (-a/b)^(c/d) = x\n      // <=> (-1)^(c/d) * (a/b)^(c/d) = x\n      // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x         # rotate 1 by 180°\n      // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula in Q ( https://proofwiki.org/wiki/De_Moivre%27s_Formula/Rational_Index )\n      // From which follows that only for c=0 the root is non-complex. c/d is a reduced fraction, so that sin(c/dpi)=0 occurs for d=1, which is handled by our trivial case.\n      if (this['s'] < 0) return null;\n\n      // Now prime factor n and d\n      var N = factorize(this['n']);\n      var D = factorize(this['d']);\n\n      // Exponentiate and take root for n and d individually\n      var n = 1;\n      var d = 1;\n      for (var k in N) {\n        if (k === '1') continue;\n        if (k === '0') {\n          n = 0;\n          break;\n        }\n        N[k]*= P['n'];\n\n        if (N[k] % P['d'] === 0) {\n          N[k]/= P['d'];\n        } else return null;\n        n*= Math.pow(k, N[k]);\n      }\n\n      for (var k in D) {\n        if (k === '1') continue;\n        D[k]*= P['n'];\n\n        if (D[k] % P['d'] === 0) {\n          D[k]/= P['d'];\n        } else return null;\n        d*= Math.pow(k, D[k]);\n      }\n\n      if (P['s'] < 0) {\n        return newFraction(d, n);\n      }\n      return newFraction(n, d);\n    },\n\n    /**\n     * Check if two rational numbers are the same\n     *\n     * Ex: new Fraction(19.6).equals([98, 5]);\n     **/\n    \"equals\": function(a, b) {\n\n      parse(a, b);\n      return this[\"s\"] * this[\"n\"] * P[\"d\"] === P[\"s\"] * P[\"n\"] * this[\"d\"]; // Same as compare() === 0\n    },\n\n    /**\n     * Check if two rational numbers are the same\n     *\n     * Ex: new Fraction(19.6).equals([98, 5]);\n     **/\n    \"compare\": function(a, b) {\n\n      parse(a, b);\n      var t = (this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"]);\n      return (0 < t) - (t < 0);\n    },\n\n    \"simplify\": function(eps) {\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return this;\n      }\n\n      eps = eps || 0.001;\n\n      var thisABS = this['abs']();\n      var cont = thisABS['toContinued']();\n\n      for (var i = 1; i < cont.length; i++) {\n\n        var s = newFraction(cont[i - 1], 1);\n        for (var k = i - 2; k >= 0; k--) {\n          s = s['inverse']()['add'](cont[k]);\n        }\n\n        if (s['sub'](thisABS)['abs']().valueOf() < eps) {\n          return s['mul'](this['s']);\n        }\n      }\n      return this;\n    },\n\n    /**\n     * Check if two rational numbers are divisible\n     *\n     * Ex: new Fraction(19.6).divisible(1.5);\n     */\n    \"divisible\": function(a, b) {\n\n      parse(a, b);\n      return !(!(P[\"n\"] * this[\"d\"]) || ((this[\"n\"] * P[\"d\"]) % (P[\"n\"] * this[\"d\"])));\n    },\n\n    /**\n     * Returns a decimal representation of the fraction\n     *\n     * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n     **/\n    'valueOf': function() {\n\n      return this[\"s\"] * this[\"n\"] / this[\"d\"];\n    },\n\n    /**\n     * Returns a string-fraction representation of a Fraction object\n     *\n     * Ex: new Fraction(\"1.'3'\").toFraction(true) => \"4 1/3\"\n     **/\n    'toFraction': function(excludeWhole) {\n\n      var whole, str = \"\";\n      var n = this[\"n\"];\n      var d = this[\"d\"];\n      if (this[\"s\"] < 0) {\n        str+= '-';\n      }\n\n      if (d === 1) {\n        str+= n;\n      } else {\n\n        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n          str+= whole;\n          str+= \" \";\n          n%= d;\n        }\n\n        str+= n;\n        str+= '/';\n        str+= d;\n      }\n      return str;\n    },\n\n    /**\n     * Returns a latex representation of a Fraction object\n     *\n     * Ex: new Fraction(\"1.'3'\").toLatex() => \"\\frac{4}{3}\"\n     **/\n    'toLatex': function(excludeWhole) {\n\n      var whole, str = \"\";\n      var n = this[\"n\"];\n      var d = this[\"d\"];\n      if (this[\"s\"] < 0) {\n        str+= '-';\n      }\n\n      if (d === 1) {\n        str+= n;\n      } else {\n\n        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n          str+= whole;\n          n%= d;\n        }\n\n        str+= \"\\\\frac{\";\n        str+= n;\n        str+= '}{';\n        str+= d;\n        str+= '}';\n      }\n      return str;\n    },\n\n    /**\n     * Returns an array of continued fraction elements\n     *\n     * Ex: new Fraction(\"7/8\").toContinued() => [0,1,7]\n     */\n    'toContinued': function() {\n\n      var t;\n      var a = this['n'];\n      var b = this['d'];\n      var res = [];\n\n      if (isNaN(a) || isNaN(b)) {\n        return res;\n      }\n\n      do {\n        res.push(Math.floor(a / b));\n        t = a % b;\n        a = b;\n        b = t;\n      } while (a !== 1);\n\n      return res;\n    },\n\n    /**\n     * Creates a string representation of a fraction with all digits\n     *\n     * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n     **/\n    'toString': function(dec) {\n\n      var N = this[\"n\"];\n      var D = this[\"d\"];\n\n      if (isNaN(N) || isNaN(D)) {\n        return \"NaN\";\n      }\n\n      dec = dec || 15; // 15 = decimal places when no repetation\n\n      var cycLen = cycleLen(N, D); // Cycle length\n      var cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n      var str = this['s'] < 0 ? \"-\" : \"\";\n\n      str+= N / D | 0;\n\n      N%= D;\n      N*= 10;\n\n      if (N)\n        str+= \".\";\n\n      if (cycLen) {\n\n        for (var i = cycOff; i--;) {\n          str+= N / D | 0;\n          N%= D;\n          N*= 10;\n        }\n        str+= \"(\";\n        for (var i = cycLen; i--;) {\n          str+= N / D | 0;\n          N%= D;\n          N*= 10;\n        }\n        str+= \")\";\n      } else {\n        for (var i = dec; N && i--;) {\n          str+= N / D | 0;\n          N%= D;\n          N*= 10;\n        }\n      }\n      return str;\n    }\n  };\n\n  if (typeof define === \"function\" && define[\"amd\"]) {\n    define([], function() {\n      return Fraction;\n    });\n  } else if (typeof exports === \"object\") {\n    Object.defineProperty(Fraction, \"__esModule\", { 'value': true });\n    Fraction['default'] = Fraction;\n    Fraction['Fraction'] = Fraction;\n    module['exports'] = Fraction;\n  } else {\n    root['Fraction'] = Fraction;\n  }\n\n})(this);\n","/*\r\n * Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license\r\n * Author: Jim Palmer (based on chunking idea from Dave Koelle)\r\n */\r\n/*jshint unused:false */\r\nmodule.exports = function naturalSort (a, b) {\r\n\t\"use strict\";\r\n\tvar re = /(^([+\\-]?(?:0|[1-9]\\d*)(?:\\.\\d*)?(?:[eE][+\\-]?\\d+)?)?$|^0x[0-9a-f]+$|\\d+)/gi,\r\n\t\tsre = /(^[ ]*|[ ]*$)/g,\r\n\t\tdre = /(^([\\w ]+,?[\\w ]+)?[\\w ]+,?[\\w ]+\\d+:\\d+(:\\d+)?[\\w ]?|^\\d{1,4}[\\/\\-]\\d{1,4}[\\/\\-]\\d{1,4}|^\\w+, \\w+ \\d+, \\d{4})/,\r\n\t\thre = /^0x[0-9a-f]+$/i,\r\n\t\tore = /^0/,\r\n\t\ti = function(s) { return naturalSort.insensitive && ('' + s).toLowerCase() || '' + s; },\r\n\t\t// convert all to strings strip whitespace\r\n\t\tx = i(a).replace(sre, '') || '',\r\n\t\ty = i(b).replace(sre, '') || '',\r\n\t\t// chunk/tokenize\r\n\t\txN = x.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\tyN = y.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\t// numeric, hex or date detection\r\n\t\txD = parseInt(x.match(hre), 16) || (xN.length !== 1 && x.match(dre) && Date.parse(x)),\r\n\t\tyD = parseInt(y.match(hre), 16) || xD && y.match(dre) && Date.parse(y) || null,\r\n\t\toFxNcL, oFyNcL;\r\n\t// first try and sort Hex codes or Dates\r\n\tif (yD) {\r\n\t\tif ( xD < yD ) { return -1; }\r\n\t\telse if ( xD > yD ) { return 1; }\r\n\t}\r\n\t// natural sorting through split numeric strings and default strings\r\n\tfor(var cLoc=0, numS=Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {\r\n\t\t// find floats not starting with '0', string or 0 if not defined (Clint Priest)\r\n\t\toFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;\r\n\t\toFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;\r\n\t\t// handle numeric vs string comparison - number < string - (Kyle Adams)\r\n\t\tif (isNaN(oFxNcL) !== isNaN(oFyNcL)) { return (isNaN(oFxNcL)) ? 1 : -1; }\r\n\t\t// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'\r\n\t\telse if (typeof oFxNcL !== typeof oFyNcL) {\r\n\t\t\toFxNcL += '';\r\n\t\t\toFyNcL += '';\r\n\t\t}\r\n\t\tif (oFxNcL < oFyNcL) { return -1; }\r\n\t\tif (oFxNcL > oFyNcL) { return 1; }\r\n\t}\r\n\treturn 0;\r\n};\r\n","var aCallable = require('../internals/a-callable');\n\n// `GetMethod` abstract operation\n// https://tc39.es/ecma262/#sec-getmethod\nmodule.exports = function (V, P) {\n  var func = V[P];\n  return func == null ? undefined : aCallable(func);\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\nvar tryToString = require('../internals/try-to-string');\n\nvar TypeError = global.TypeError;\n\n// `Assert: IsCallable(argument) is true`\nmodule.exports = function (argument) {\n  if (isCallable(argument)) return argument;\n  throw TypeError(tryToString(argument) + ' is not a function');\n};\n","module.exports = false;\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\nvar hiddenKeys = enumBugKeys.concat('length', 'prototype');\n\n// `Object.getOwnPropertyNames` method\n// https://tc39.es/ecma262/#sec-object.getownpropertynames\n// eslint-disable-next-line es/no-object-getownpropertynames -- safe\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return internalObjectKeys(O, hiddenKeys);\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar aCallable = require('../internals/a-callable');\nvar NATIVE_BIND = require('../internals/function-bind-native');\n\nvar bind = uncurryThis(uncurryThis.bind);\n\n// optional / simple context binding\nmodule.exports = function (fn, that) {\n  aCallable(fn);\n  return that === undefined ? fn : NATIVE_BIND ? bind(fn, that) : function (/* ...args */) {\n    return fn.apply(that, arguments);\n  };\n};\n","/* global ActiveXObject -- old IE, WSH */\nvar anObject = require('../internals/an-object');\nvar definePropertiesModule = require('../internals/object-define-properties');\nvar enumBugKeys = require('../internals/enum-bug-keys');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar html = require('../internals/html');\nvar documentCreateElement = require('../internals/document-create-element');\nvar sharedKey = require('../internals/shared-key');\n\nvar GT = '>';\nvar LT = '<';\nvar PROTOTYPE = 'prototype';\nvar SCRIPT = 'script';\nvar IE_PROTO = sharedKey('IE_PROTO');\n\nvar EmptyConstructor = function () { /* empty */ };\n\nvar scriptTag = function (content) {\n  return LT + SCRIPT + GT + content + LT + '/' + SCRIPT + GT;\n};\n\n// Create object with fake `null` prototype: use ActiveX Object with cleared prototype\nvar NullProtoObjectViaActiveX = function (activeXDocument) {\n  activeXDocument.write(scriptTag(''));\n  activeXDocument.close();\n  var temp = activeXDocument.parentWindow.Object;\n  activeXDocument = null; // avoid memory leak\n  return temp;\n};\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar NullProtoObjectViaIFrame = function () {\n  // Thrash, waste and sodomy: IE GC bug\n  var iframe = documentCreateElement('iframe');\n  var JS = 'java' + SCRIPT + ':';\n  var iframeDocument;\n  iframe.style.display = 'none';\n  html.appendChild(iframe);\n  // https://github.com/zloirock/core-js/issues/475\n  iframe.src = String(JS);\n  iframeDocument = iframe.contentWindow.document;\n  iframeDocument.open();\n  iframeDocument.write(scriptTag('document.F=Object'));\n  iframeDocument.close();\n  return iframeDocument.F;\n};\n\n// Check for document.domain and active x support\n// No need to use active x approach when document.domain is not set\n// see https://github.com/es-shims/es5-shim/issues/150\n// variation of https://github.com/kitcambridge/es5-shim/commit/4f738ac066346\n// avoid IE GC bug\nvar activeXDocument;\nvar NullProtoObject = function () {\n  try {\n    activeXDocument = new ActiveXObject('htmlfile');\n  } catch (error) { /* ignore */ }\n  NullProtoObject = typeof document != 'undefined'\n    ? document.domain && activeXDocument\n      ? NullProtoObjectViaActiveX(activeXDocument) // old IE\n      : NullProtoObjectViaIFrame()\n    : NullProtoObjectViaActiveX(activeXDocument); // WSH\n  var length = enumBugKeys.length;\n  while (length--) delete NullProtoObject[PROTOTYPE][enumBugKeys[length]];\n  return NullProtoObject();\n};\n\nhiddenKeys[IE_PROTO] = true;\n\n// `Object.create` method\n// https://tc39.es/ecma262/#sec-object.create\nmodule.exports = Object.create || function create(O, Properties) {\n  var result;\n  if (O !== null) {\n    EmptyConstructor[PROTOTYPE] = anObject(O);\n    result = new EmptyConstructor();\n    EmptyConstructor[PROTOTYPE] = null;\n    // add \"__proto__\" for Object.getPrototypeOf polyfill\n    result[IE_PROTO] = O;\n  } else result = NullProtoObject();\n  return Properties === undefined ? result : definePropertiesModule.f(result, Properties);\n};\n","'use strict';\nvar toPropertyKey = require('../internals/to-property-key');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = function (object, key, value) {\n  var propertyKey = toPropertyKey(key);\n  if (propertyKey in object) definePropertyModule.f(object, propertyKey, createPropertyDescriptor(0, value));\n  else object[propertyKey] = value;\n};\n","'use strict';\nvar apply = require('../internals/function-apply');\nvar call = require('../internals/function-call');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar fixRegExpWellKnownSymbolLogic = require('../internals/fix-regexp-well-known-symbol-logic');\nvar fails = require('../internals/fails');\nvar anObject = require('../internals/an-object');\nvar isCallable = require('../internals/is-callable');\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\nvar toLength = require('../internals/to-length');\nvar toString = require('../internals/to-string');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar advanceStringIndex = require('../internals/advance-string-index');\nvar getMethod = require('../internals/get-method');\nvar getSubstitution = require('../internals/get-substitution');\nvar regExpExec = require('../internals/regexp-exec-abstract');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar REPLACE = wellKnownSymbol('replace');\nvar max = Math.max;\nvar min = Math.min;\nvar concat = uncurryThis([].concat);\nvar push = uncurryThis([].push);\nvar stringIndexOf = uncurryThis(''.indexOf);\nvar stringSlice = uncurryThis(''.slice);\n\nvar maybeToString = function (it) {\n  return it === undefined ? it : String(it);\n};\n\n// IE <= 11 replaces $0 with the whole match, as if it was $&\n// https://stackoverflow.com/questions/6024666/getting-ie-to-replace-a-regex-with-the-literal-string-0\nvar REPLACE_KEEPS_$0 = (function () {\n  // eslint-disable-next-line regexp/prefer-escape-replacement-dollar-char -- required for testing\n  return 'a'.replace(/./, '$0') === '$0';\n})();\n\n// Safari <= 13.0.3(?) substitutes nth capture where n>m with an empty string\nvar REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE = (function () {\n  if (/./[REPLACE]) {\n    return /./[REPLACE]('a', '$0') === '';\n  }\n  return false;\n})();\n\nvar REPLACE_SUPPORTS_NAMED_GROUPS = !fails(function () {\n  var re = /./;\n  re.exec = function () {\n    var result = [];\n    result.groups = { a: '7' };\n    return result;\n  };\n  // eslint-disable-next-line regexp/no-useless-dollar-replacements -- false positive\n  return ''.replace(re, '$<a>') !== '7';\n});\n\n// @@replace logic\nfixRegExpWellKnownSymbolLogic('replace', function (_, nativeReplace, maybeCallNative) {\n  var UNSAFE_SUBSTITUTE = REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE ? '$' : '$0';\n\n  return [\n    // `String.prototype.replace` method\n    // https://tc39.es/ecma262/#sec-string.prototype.replace\n    function replace(searchValue, replaceValue) {\n      var O = requireObjectCoercible(this);\n      var replacer = searchValue == undefined ? undefined : getMethod(searchValue, REPLACE);\n      return replacer\n        ? call(replacer, searchValue, O, replaceValue)\n        : call(nativeReplace, toString(O), searchValue, replaceValue);\n    },\n    // `RegExp.prototype[@@replace]` method\n    // https://tc39.es/ecma262/#sec-regexp.prototype-@@replace\n    function (string, replaceValue) {\n      var rx = anObject(this);\n      var S = toString(string);\n\n      if (\n        typeof replaceValue == 'string' &&\n        stringIndexOf(replaceValue, UNSAFE_SUBSTITUTE) === -1 &&\n        stringIndexOf(replaceValue, '$<') === -1\n      ) {\n        var res = maybeCallNative(nativeReplace, rx, S, replaceValue);\n        if (res.done) return res.value;\n      }\n\n      var functionalReplace = isCallable(replaceValue);\n      if (!functionalReplace) replaceValue = toString(replaceValue);\n\n      var global = rx.global;\n      if (global) {\n        var fullUnicode = rx.unicode;\n        rx.lastIndex = 0;\n      }\n      var results = [];\n      while (true) {\n        var result = regExpExec(rx, S);\n        if (result === null) break;\n\n        push(results, result);\n        if (!global) break;\n\n        var matchStr = toString(result[0]);\n        if (matchStr === '') rx.lastIndex = advanceStringIndex(S, toLength(rx.lastIndex), fullUnicode);\n      }\n\n      var accumulatedResult = '';\n      var nextSourcePosition = 0;\n      for (var i = 0; i < results.length; i++) {\n        result = results[i];\n\n        var matched = toString(result[0]);\n        var position = max(min(toIntegerOrInfinity(result.index), S.length), 0);\n        var captures = [];\n        // NOTE: This is equivalent to\n        //   captures = result.slice(1).map(maybeToString)\n        // but for some reason `nativeSlice.call(result, 1, result.length)` (called in\n        // the slice polyfill when slicing native arrays) \"doesn't work\" in safari 9 and\n        // causes a crash (https://pastebin.com/N21QzeQA) when trying to debug it.\n        for (var j = 1; j < result.length; j++) push(captures, maybeToString(result[j]));\n        var namedCaptures = result.groups;\n        if (functionalReplace) {\n          var replacerArgs = concat([matched], captures, position, S);\n          if (namedCaptures !== undefined) push(replacerArgs, namedCaptures);\n          var replacement = toString(apply(replaceValue, undefined, replacerArgs));\n        } else {\n          replacement = getSubstitution(matched, S, position, captures, namedCaptures, replaceValue);\n        }\n        if (position >= nextSourcePosition) {\n          accumulatedResult += stringSlice(S, nextSourcePosition, position) + replacement;\n          nextSourcePosition = position + matched.length;\n        }\n      }\n      return accumulatedResult + stringSlice(S, nextSourcePosition);\n    }\n  ];\n}, !REPLACE_SUPPORTS_NAMED_GROUPS || !REPLACE_KEEPS_$0 || REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE);\n","module.exports = function(module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","/* globals __webpack_amd_options__ */\nmodule.exports = __webpack_amd_options__;\n","module.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","var global = require('../internals/global');\nvar userAgent = require('../internals/engine-user-agent');\n\nvar process = global.process;\nvar Deno = global.Deno;\nvar versions = process && process.versions || Deno && Deno.version;\nvar v8 = versions && versions.v8;\nvar match, version;\n\nif (v8) {\n  match = v8.split('.');\n  // in old Chrome, versions of V8 isn't V8 = Chrome / 10\n  // but their correct versions are not interesting for us\n  version = match[0] > 0 && match[0] < 4 ? 1 : +(match[0] + match[1]);\n}\n\n// BrowserFS NodeJS `process` polyfill incorrectly set `.v8` to `0.0`\n// so check `userAgent` even if `.v8` exists, but 0\nif (!version && userAgent) {\n  match = userAgent.match(/Edge\\/(\\d+)/);\n  if (!match || match[1] >= 74) {\n    match = userAgent.match(/Chrome\\/(\\d+)/);\n    if (match) version = +match[1];\n  }\n}\n\nmodule.exports = version;\n","module.exports = {};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar hasOwn = require('../internals/has-own-property');\n\nvar FunctionPrototype = Function.prototype;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getDescriptor = DESCRIPTORS && Object.getOwnPropertyDescriptor;\n\nvar EXISTS = hasOwn(FunctionPrototype, 'name');\n// additional protection from minified / mangled / dropped function names\nvar PROPER = EXISTS && (function something() { /* empty */ }).name === 'something';\nvar CONFIGURABLE = EXISTS && (!DESCRIPTORS || (DESCRIPTORS && getDescriptor(FunctionPrototype, 'name').configurable));\n\nmodule.exports = {\n  EXISTS: EXISTS,\n  PROPER: PROPER,\n  CONFIGURABLE: CONFIGURABLE\n};\n","var toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\n\nvar max = Math.max;\nvar min = Math.min;\n\n// Helper for a popular repeating case of the spec:\n// Let integer be ? ToInteger(index).\n// If integer < 0, let result be max((length + integer), 0); else let result be min(integer, length).\nmodule.exports = function (index, length) {\n  var integer = toIntegerOrInfinity(index);\n  return integer < 0 ? max(integer + length, 0) : min(integer, length);\n};\n","var fails = require('../internals/fails');\nvar isCallable = require('../internals/is-callable');\n\nvar replacement = /#|\\.prototype\\./;\n\nvar isForced = function (feature, detection) {\n  var value = data[normalize(feature)];\n  return value == POLYFILL ? true\n    : value == NATIVE ? false\n    : isCallable(detection) ? fails(detection)\n    : !!detection;\n};\n\nvar normalize = isForced.normalize = function (string) {\n  return String(string).replace(replacement, '.').toLowerCase();\n};\n\nvar data = isForced.data = {};\nvar NATIVE = isForced.NATIVE = 'N';\nvar POLYFILL = isForced.POLYFILL = 'P';\n\nmodule.exports = isForced;\n","var bind = require('../internals/function-bind-context');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar IndexedObject = require('../internals/indexed-object');\nvar toObject = require('../internals/to-object');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar arraySpeciesCreate = require('../internals/array-species-create');\n\nvar push = uncurryThis([].push);\n\n// `Array.prototype.{ forEach, map, filter, some, every, find, findIndex, filterReject }` methods implementation\nvar createMethod = function (TYPE) {\n  var IS_MAP = TYPE == 1;\n  var IS_FILTER = TYPE == 2;\n  var IS_SOME = TYPE == 3;\n  var IS_EVERY = TYPE == 4;\n  var IS_FIND_INDEX = TYPE == 6;\n  var IS_FILTER_REJECT = TYPE == 7;\n  var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;\n  return function ($this, callbackfn, that, specificCreate) {\n    var O = toObject($this);\n    var self = IndexedObject(O);\n    var boundFunction = bind(callbackfn, that);\n    var length = lengthOfArrayLike(self);\n    var index = 0;\n    var create = specificCreate || arraySpeciesCreate;\n    var target = IS_MAP ? create($this, length) : IS_FILTER || IS_FILTER_REJECT ? create($this, 0) : undefined;\n    var value, result;\n    for (;length > index; index++) if (NO_HOLES || index in self) {\n      value = self[index];\n      result = boundFunction(value, index, O);\n      if (TYPE) {\n        if (IS_MAP) target[index] = result; // map\n        else if (result) switch (TYPE) {\n          case 3: return true;              // some\n          case 5: return value;             // find\n          case 6: return index;             // findIndex\n          case 2: push(target, value);      // filter\n        } else switch (TYPE) {\n          case 4: return false;             // every\n          case 7: push(target, value);      // filterReject\n        }\n      }\n    }\n    return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : target;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.forEach` method\n  // https://tc39.es/ecma262/#sec-array.prototype.foreach\n  forEach: createMethod(0),\n  // `Array.prototype.map` method\n  // https://tc39.es/ecma262/#sec-array.prototype.map\n  map: createMethod(1),\n  // `Array.prototype.filter` method\n  // https://tc39.es/ecma262/#sec-array.prototype.filter\n  filter: createMethod(2),\n  // `Array.prototype.some` method\n  // https://tc39.es/ecma262/#sec-array.prototype.some\n  some: createMethod(3),\n  // `Array.prototype.every` method\n  // https://tc39.es/ecma262/#sec-array.prototype.every\n  every: createMethod(4),\n  // `Array.prototype.find` method\n  // https://tc39.es/ecma262/#sec-array.prototype.find\n  find: createMethod(5),\n  // `Array.prototype.findIndex` method\n  // https://tc39.es/ecma262/#sec-array.prototype.findIndex\n  findIndex: createMethod(6),\n  // `Array.prototype.filterReject` method\n  // https://github.com/tc39/proposal-array-filtering\n  filterReject: createMethod(7)\n};\n","var fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar SPECIES = wellKnownSymbol('species');\n\nmodule.exports = function (METHOD_NAME) {\n  // We can't use this feature detection in V8 since it causes\n  // deoptimization and serious performance degradation\n  // https://github.com/zloirock/core-js/issues/677\n  return V8_VERSION >= 51 || !fails(function () {\n    var array = [];\n    var constructor = array.constructor = {};\n    constructor[SPECIES] = function () {\n      return { foo: 1 };\n    };\n    return array[METHOD_NAME](Boolean).foo !== 1;\n  });\n};\n","var NATIVE_BIND = require('../internals/function-bind-native');\n\nvar FunctionPrototype = Function.prototype;\nvar apply = FunctionPrototype.apply;\nvar call = FunctionPrototype.call;\n\n// eslint-disable-next-line es/no-reflect -- safe\nmodule.exports = typeof Reflect == 'object' && Reflect.apply || (NATIVE_BIND ? call.bind(apply) : function () {\n  return call.apply(apply, arguments);\n});\n","module.exports = {};\n","var defineProperty = require('../internals/object-define-property').f;\nvar hasOwn = require('../internals/has-own-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\n\nmodule.exports = function (target, TAG, STATIC) {\n  if (target && !STATIC) target = target.prototype;\n  if (target && !hasOwn(target, TO_STRING_TAG)) {\n    defineProperty(target, TO_STRING_TAG, { configurable: true, value: TAG });\n  }\n};\n","var fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  var test = (function () { /* empty */ }).bind();\n  // eslint-disable-next-line no-prototype-builtins -- safe\n  return typeof test != 'function' || test.hasOwnProperty('prototype');\n});\n","var toPrimitive = require('../internals/to-primitive');\nvar isSymbol = require('../internals/is-symbol');\n\n// `ToPropertyKey` abstract operation\n// https://tc39.es/ecma262/#sec-topropertykey\nmodule.exports = function (argument) {\n  var key = toPrimitive(argument, 'string');\n  return isSymbol(key) ? key : key + '';\n};\n","var global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar isCallable = require('../internals/is-callable');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar Object = global.Object;\n\nmodule.exports = USE_SYMBOL_AS_UID ? function (it) {\n  return typeof it == 'symbol';\n} : function (it) {\n  var $Symbol = getBuiltIn('Symbol');\n  return isCallable($Symbol) && isPrototypeOf($Symbol.prototype, Object(it));\n};\n","var global = require('../internals/global');\n\nvar String = global.String;\n\nmodule.exports = function (argument) {\n  try {\n    return String(argument);\n  } catch (error) {\n    return 'Object';\n  }\n};\n","var IS_PURE = require('../internals/is-pure');\nvar store = require('../internals/shared-store');\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: '3.21.1',\n  mode: IS_PURE ? 'pure' : 'global',\n  copyright: '© 2014-2022 Denis Pushkarev (zloirock.ru)',\n  license: 'https://github.com/zloirock/core-js/blob/v3.21.1/LICENSE',\n  source: 'https://github.com/zloirock/core-js'\n});\n","var uncurryThis = require('../internals/function-uncurry-this');\n\nvar id = 0;\nvar postfix = Math.random();\nvar toString = uncurryThis(1.0.toString);\n\nmodule.exports = function (key) {\n  return 'Symbol(' + (key === undefined ? '' : key) + ')_' + toString(++id + postfix, 36);\n};\n","var global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar document = global.document;\n// typeof document.createElement is 'object' in old IE\nvar EXISTS = isObject(document) && isObject(document.createElement);\n\nmodule.exports = function (it) {\n  return EXISTS ? document.createElement(it) : {};\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar isCallable = require('../internals/is-callable');\nvar store = require('../internals/shared-store');\n\nvar functionToString = uncurryThis(Function.toString);\n\n// this helper broken in `core-js@3.4.1-3.4.4`, so we can't use `shared` helper\nif (!isCallable(store.inspectSource)) {\n  store.inspectSource = function (it) {\n    return functionToString(it);\n  };\n}\n\nmodule.exports = store.inspectSource;\n","var shared = require('../internals/shared');\nvar uid = require('../internals/uid');\n\nvar keys = shared('keys');\n\nmodule.exports = function (key) {\n  return keys[key] || (keys[key] = uid(key));\n};\n","var toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\n\nvar min = Math.min;\n\n// `ToLength` abstract operation\n// https://tc39.es/ecma262/#sec-tolength\nmodule.exports = function (argument) {\n  return argument > 0 ? min(toIntegerOrInfinity(argument), 0x1FFFFFFFFFFFFF) : 0; // 2 ** 53 - 1 == 9007199254740991\n};\n","var global = require('../internals/global');\nvar TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar isCallable = require('../internals/is-callable');\nvar classofRaw = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar Object = global.Object;\n\n// ES3 wrong here\nvar CORRECT_ARGUMENTS = classofRaw(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n  try {\n    return it[key];\n  } catch (error) { /* empty */ }\n};\n\n// getting tag from ES6+ `Object.prototype.toString`\nmodule.exports = TO_STRING_TAG_SUPPORT ? classofRaw : function (it) {\n  var O, tag, result;\n  return it === undefined ? 'Undefined' : it === null ? 'Null'\n    // @@toStringTag case\n    : typeof (tag = tryGet(O = Object(it), TO_STRING_TAG)) == 'string' ? tag\n    // builtinTag case\n    : CORRECT_ARGUMENTS ? classofRaw(O)\n    // ES3 arguments fallback\n    : (result = classofRaw(O)) == 'Object' && isCallable(O.callee) ? 'Arguments' : result;\n};\n","var classof = require('../internals/classof-raw');\n\n// `IsArray` abstract operation\n// https://tc39.es/ecma262/#sec-isarray\n// eslint-disable-next-line es/no-array-isarray -- safe\nmodule.exports = Array.isArray || function isArray(argument) {\n  return classof(argument) == 'Array';\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar fails = require('../internals/fails');\nvar isCallable = require('../internals/is-callable');\nvar classof = require('../internals/classof');\nvar getBuiltIn = require('../internals/get-built-in');\nvar inspectSource = require('../internals/inspect-source');\n\nvar noop = function () { /* empty */ };\nvar empty = [];\nvar construct = getBuiltIn('Reflect', 'construct');\nvar constructorRegExp = /^\\s*(?:class|function)\\b/;\nvar exec = uncurryThis(constructorRegExp.exec);\nvar INCORRECT_TO_STRING = !constructorRegExp.exec(noop);\n\nvar isConstructorModern = function isConstructor(argument) {\n  if (!isCallable(argument)) return false;\n  try {\n    construct(noop, empty, argument);\n    return true;\n  } catch (error) {\n    return false;\n  }\n};\n\nvar isConstructorLegacy = function isConstructor(argument) {\n  if (!isCallable(argument)) return false;\n  switch (classof(argument)) {\n    case 'AsyncFunction':\n    case 'GeneratorFunction':\n    case 'AsyncGeneratorFunction': return false;\n  }\n  try {\n    // we can't check .prototype since constructors produced by .bind haven't it\n    // `Function#toString` throws on some built-it function in some legacy engines\n    // (for example, `DOMQuad` and similar in FF41-)\n    return INCORRECT_TO_STRING || !!exec(constructorRegExp, inspectSource(argument));\n  } catch (error) {\n    return true;\n  }\n};\n\nisConstructorLegacy.sham = true;\n\n// `IsConstructor` abstract operation\n// https://tc39.es/ecma262/#sec-isconstructor\nmodule.exports = !construct || fails(function () {\n  var called;\n  return isConstructorModern(isConstructorModern.call)\n    || !isConstructorModern(Object)\n    || !isConstructorModern(function () { called = true; })\n    || called;\n}) ? isConstructorLegacy : isConstructorModern;\n","var fails = require('../internals/fails');\nvar global = require('../internals/global');\n\n// babel-minify and Closure Compiler transpiles RegExp('a', 'y') -> /a/y and it causes SyntaxError\nvar $RegExp = global.RegExp;\n\nvar UNSUPPORTED_Y = fails(function () {\n  var re = $RegExp('a', 'y');\n  re.lastIndex = 2;\n  return re.exec('abcd') != null;\n});\n\n// UC Browser bug\n// https://github.com/zloirock/core-js/issues/1008\nvar MISSED_STICKY = UNSUPPORTED_Y || fails(function () {\n  return !$RegExp('a', 'y').sticky;\n});\n\nvar BROKEN_CARET = UNSUPPORTED_Y || fails(function () {\n  // https://bugzilla.mozilla.org/show_bug.cgi?id=773687\n  var re = $RegExp('^r', 'gy');\n  re.lastIndex = 2;\n  return re.exec('str') != null;\n});\n\nmodule.exports = {\n  BROKEN_CARET: BROKEN_CARET,\n  MISSED_STICKY: MISSED_STICKY,\n  UNSUPPORTED_Y: UNSUPPORTED_Y\n};\n","'use strict';\n/* eslint-disable regexp/no-empty-capturing-group, regexp/no-empty-group, regexp/no-lazy-ends -- testing */\n/* eslint-disable regexp/no-useless-quantifier -- testing */\nvar call = require('../internals/function-call');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar toString = require('../internals/to-string');\nvar regexpFlags = require('../internals/regexp-flags');\nvar stickyHelpers = require('../internals/regexp-sticky-helpers');\nvar shared = require('../internals/shared');\nvar create = require('../internals/object-create');\nvar getInternalState = require('../internals/internal-state').get;\nvar UNSUPPORTED_DOT_ALL = require('../internals/regexp-unsupported-dot-all');\nvar UNSUPPORTED_NCG = require('../internals/regexp-unsupported-ncg');\n\nvar nativeReplace = shared('native-string-replace', String.prototype.replace);\nvar nativeExec = RegExp.prototype.exec;\nvar patchedExec = nativeExec;\nvar charAt = uncurryThis(''.charAt);\nvar indexOf = uncurryThis(''.indexOf);\nvar replace = uncurryThis(''.replace);\nvar stringSlice = uncurryThis(''.slice);\n\nvar UPDATES_LAST_INDEX_WRONG = (function () {\n  var re1 = /a/;\n  var re2 = /b*/g;\n  call(nativeExec, re1, 'a');\n  call(nativeExec, re2, 'a');\n  return re1.lastIndex !== 0 || re2.lastIndex !== 0;\n})();\n\nvar UNSUPPORTED_Y = stickyHelpers.BROKEN_CARET;\n\n// nonparticipating capturing group, copied from es5-shim's String#split patch.\nvar NPCG_INCLUDED = /()??/.exec('')[1] !== undefined;\n\nvar PATCH = UPDATES_LAST_INDEX_WRONG || NPCG_INCLUDED || UNSUPPORTED_Y || UNSUPPORTED_DOT_ALL || UNSUPPORTED_NCG;\n\nif (PATCH) {\n  patchedExec = function exec(string) {\n    var re = this;\n    var state = getInternalState(re);\n    var str = toString(string);\n    var raw = state.raw;\n    var result, reCopy, lastIndex, match, i, object, group;\n\n    if (raw) {\n      raw.lastIndex = re.lastIndex;\n      result = call(patchedExec, raw, str);\n      re.lastIndex = raw.lastIndex;\n      return result;\n    }\n\n    var groups = state.groups;\n    var sticky = UNSUPPORTED_Y && re.sticky;\n    var flags = call(regexpFlags, re);\n    var source = re.source;\n    var charsAdded = 0;\n    var strCopy = str;\n\n    if (sticky) {\n      flags = replace(flags, 'y', '');\n      if (indexOf(flags, 'g') === -1) {\n        flags += 'g';\n      }\n\n      strCopy = stringSlice(str, re.lastIndex);\n      // Support anchored sticky behavior.\n      if (re.lastIndex > 0 && (!re.multiline || re.multiline && charAt(str, re.lastIndex - 1) !== '\\n')) {\n        source = '(?: ' + source + ')';\n        strCopy = ' ' + strCopy;\n        charsAdded++;\n      }\n      // ^(? + rx + ) is needed, in combination with some str slicing, to\n      // simulate the 'y' flag.\n      reCopy = new RegExp('^(?:' + source + ')', flags);\n    }\n\n    if (NPCG_INCLUDED) {\n      reCopy = new RegExp('^' + source + '$(?!\\\\s)', flags);\n    }\n    if (UPDATES_LAST_INDEX_WRONG) lastIndex = re.lastIndex;\n\n    match = call(nativeExec, sticky ? reCopy : re, strCopy);\n\n    if (sticky) {\n      if (match) {\n        match.input = stringSlice(match.input, charsAdded);\n        match[0] = stringSlice(match[0], charsAdded);\n        match.index = re.lastIndex;\n        re.lastIndex += match[0].length;\n      } else re.lastIndex = 0;\n    } else if (UPDATES_LAST_INDEX_WRONG && match) {\n      re.lastIndex = re.global ? match.index + match[0].length : lastIndex;\n    }\n    if (NPCG_INCLUDED && match && match.length > 1) {\n      // Fix browsers whose `exec` methods don't consistently return `undefined`\n      // for NPCG, like IE8. NOTE: This doesn' work for /(.?)?/\n      call(nativeReplace, match[0], reCopy, function () {\n        for (i = 1; i < arguments.length - 2; i++) {\n          if (arguments[i] === undefined) match[i] = undefined;\n        }\n      });\n    }\n\n    if (match && groups) {\n      match.groups = object = create(null);\n      for (i = 0; i < groups.length; i++) {\n        group = groups[i];\n        object[group[0]] = match[group[1]];\n      }\n    }\n\n    return match;\n  };\n}\n\nmodule.exports = patchedExec;\n","// eslint-disable-next-line es/no-math-expm1 -- safe\nvar $expm1 = Math.expm1;\nvar exp = Math.exp;\n\n// `Math.expm1` method implementation\n// https://tc39.es/ecma262/#sec-math.expm1\nmodule.exports = (!$expm1\n  // Old FF bug\n  || $expm1(10) > 22025.465794806719 || $expm1(10) < 22025.4657948067165168\n  // Tor Browser bug\n  || $expm1(-2e-17) != -2e-17\n) ? function expm1(x) {\n  return (x = +x) == 0 ? x : x > -1e-6 && x < 1e-6 ? x + x * x / 2 : exp(x) - 1;\n} : $expm1;\n","'use strict';\nvar call = require('../internals/function-call');\nvar fixRegExpWellKnownSymbolLogic = require('../internals/fix-regexp-well-known-symbol-logic');\nvar anObject = require('../internals/an-object');\nvar toLength = require('../internals/to-length');\nvar toString = require('../internals/to-string');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar getMethod = require('../internals/get-method');\nvar advanceStringIndex = require('../internals/advance-string-index');\nvar regExpExec = require('../internals/regexp-exec-abstract');\n\n// @@match logic\nfixRegExpWellKnownSymbolLogic('match', function (MATCH, nativeMatch, maybeCallNative) {\n  return [\n    // `String.prototype.match` method\n    // https://tc39.es/ecma262/#sec-string.prototype.match\n    function match(regexp) {\n      var O = requireObjectCoercible(this);\n      var matcher = regexp == undefined ? undefined : getMethod(regexp, MATCH);\n      return matcher ? call(matcher, regexp, O) : new RegExp(regexp)[MATCH](toString(O));\n    },\n    // `RegExp.prototype[@@match]` method\n    // https://tc39.es/ecma262/#sec-regexp.prototype-@@match\n    function (string) {\n      var rx = anObject(this);\n      var S = toString(string);\n      var res = maybeCallNative(nativeMatch, rx, S);\n\n      if (res.done) return res.value;\n\n      if (!rx.global) return regExpExec(rx, S);\n\n      var fullUnicode = rx.unicode;\n      rx.lastIndex = 0;\n      var A = [];\n      var n = 0;\n      var result;\n      while ((result = regExpExec(rx, S)) !== null) {\n        var matchStr = toString(result[0]);\n        A[n] = matchStr;\n        if (matchStr === '') rx.lastIndex = advanceStringIndex(S, toLength(rx.lastIndex), fullUnicode);\n        n++;\n      }\n      return n === 0 ? null : A;\n    }\n  ];\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar createHTML = require('../internals/create-html');\nvar forcedStringHTMLMethod = require('../internals/string-html-forced');\n\n// `String.prototype.sub` method\n// https://tc39.es/ecma262/#sec-string.prototype.sub\n$({ target: 'String', proto: true, forced: forcedStringHTMLMethod('sub') }, {\n  sub: function sub() {\n    return createHTML(this, 'sub', '', '');\n  }\n});\n","var global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar fails = require('../internals/fails');\nvar classof = require('../internals/classof-raw');\n\nvar Object = global.Object;\nvar split = uncurryThis(''.split);\n\n// fallback for non-array-like ES3 and non-enumerable old V8 strings\nmodule.exports = fails(function () {\n  // throws an error in rhino, see https://github.com/mozilla/rhino/issues/346\n  // eslint-disable-next-line no-prototype-builtins -- safe\n  return !Object('z').propertyIsEnumerable(0);\n}) ? function (it) {\n  return classof(it) == 'String' ? split(it, '') : Object(it);\n} : Object;\n","/* eslint-disable es/no-symbol -- required for testing */\nvar V8_VERSION = require('../internals/engine-v8-version');\nvar fails = require('../internals/fails');\n\n// eslint-disable-next-line es/no-object-getownpropertysymbols -- required for testing\nmodule.exports = !!Object.getOwnPropertySymbols && !fails(function () {\n  var symbol = Symbol();\n  // Chrome 38 Symbol has incorrect toString conversion\n  // `get-own-property-symbols` polyfill symbols converted to object are not Symbol instances\n  return !String(symbol) || !(Object(symbol) instanceof Symbol) ||\n    // Chrome 38-40 symbols are not inherited from DOM collections prototypes to instances\n    !Symbol.sham && V8_VERSION && V8_VERSION < 41;\n});\n","var global = require('../internals/global');\nvar setGlobal = require('../internals/set-global');\n\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || setGlobal(SHARED, {});\n\nmodule.exports = store;\n","var global = require('../internals/global');\n\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar defineProperty = Object.defineProperty;\n\nmodule.exports = function (key, value) {\n  try {\n    defineProperty(global, key, { value: value, configurable: true, writable: true });\n  } catch (error) {\n    global[key] = value;\n  } return value;\n};\n","// IE8- don't enum bug keys\nmodule.exports = [\n  'constructor',\n  'hasOwnProperty',\n  'isPrototypeOf',\n  'propertyIsEnumerable',\n  'toLocaleString',\n  'toString',\n  'valueOf'\n];\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\n// `Object.keys` method\n// https://tc39.es/ecma262/#sec-object.keys\n// eslint-disable-next-line es/no-object-keys -- safe\nmodule.exports = Object.keys || function keys(O) {\n  return internalObjectKeys(O, enumBugKeys);\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar test = {};\n\ntest[TO_STRING_TAG] = 'z';\n\nmodule.exports = String(test) === '[object z]';\n","var arraySpeciesConstructor = require('../internals/array-species-constructor');\n\n// `ArraySpeciesCreate` abstract operation\n// https://tc39.es/ecma262/#sec-arrayspeciescreate\nmodule.exports = function (originalArray, length) {\n  return new (arraySpeciesConstructor(originalArray))(length === 0 ? 0 : length);\n};\n","'use strict';\nvar fails = require('../internals/fails');\n\nmodule.exports = function (METHOD_NAME, argument) {\n  var method = [][METHOD_NAME];\n  return !!method && fails(function () {\n    // eslint-disable-next-line no-useless-call -- required for testing\n    method.call(null, argument || function () { return 1; }, 1);\n  });\n};\n","var global = require('../internals/global');\nvar hasOwn = require('../internals/has-own-property');\nvar isCallable = require('../internals/is-callable');\nvar toObject = require('../internals/to-object');\nvar sharedKey = require('../internals/shared-key');\nvar CORRECT_PROTOTYPE_GETTER = require('../internals/correct-prototype-getter');\n\nvar IE_PROTO = sharedKey('IE_PROTO');\nvar Object = global.Object;\nvar ObjectPrototype = Object.prototype;\n\n// `Object.getPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.getprototypeof\nmodule.exports = CORRECT_PROTOTYPE_GETTER ? Object.getPrototypeOf : function (O) {\n  var object = toObject(O);\n  if (hasOwn(object, IE_PROTO)) return object[IE_PROTO];\n  var constructor = object.constructor;\n  if (isCallable(constructor) && object instanceof constructor) {\n    return constructor.prototype;\n  } return object instanceof Object ? ObjectPrototype : null;\n};\n","var isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\n\n// makes subclassing work correct for wrapped built-ins\nmodule.exports = function ($this, dummy, Wrapper) {\n  var NewTarget, NewTargetPrototype;\n  if (\n    // it can work only with native `setPrototypeOf`\n    setPrototypeOf &&\n    // we haven't completely correct pre-ES6 way for getting `new.target`, so use this\n    isCallable(NewTarget = dummy.constructor) &&\n    NewTarget !== Wrapper &&\n    isObject(NewTargetPrototype = NewTarget.prototype) &&\n    NewTargetPrototype !== Wrapper.prototype\n  ) setPrototypeOf($this, NewTargetPrototype);\n  return $this;\n};\n","/* eslint-disable no-proto -- safe */\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar anObject = require('../internals/an-object');\nvar aPossiblePrototype = require('../internals/a-possible-prototype');\n\n// `Object.setPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.setprototypeof\n// Works with __proto__ only. Old v8 can't work with null proto objects.\n// eslint-disable-next-line es/no-object-setprototypeof -- safe\nmodule.exports = Object.setPrototypeOf || ('__proto__' in {} ? function () {\n  var CORRECT_SETTER = false;\n  var test = {};\n  var setter;\n  try {\n    // eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\n    setter = uncurryThis(Object.getOwnPropertyDescriptor(Object.prototype, '__proto__').set);\n    setter(test, []);\n    CORRECT_SETTER = test instanceof Array;\n  } catch (error) { /* empty */ }\n  return function setPrototypeOf(O, proto) {\n    anObject(O);\n    aPossiblePrototype(proto);\n    if (CORRECT_SETTER) setter(O, proto);\n    else O.__proto__ = proto;\n    return O;\n  };\n}() : undefined);\n","'use strict';\nvar anObject = require('../internals/an-object');\n\n// `RegExp.prototype.flags` getter implementation\n// https://tc39.es/ecma262/#sec-get-regexp.prototype.flags\nmodule.exports = function () {\n  var that = anObject(this);\n  var result = '';\n  if (that.global) result += 'g';\n  if (that.ignoreCase) result += 'i';\n  if (that.multiline) result += 'm';\n  if (that.dotAll) result += 's';\n  if (that.unicode) result += 'u';\n  if (that.sticky) result += 'y';\n  return result;\n};\n","'use strict';\nvar getBuiltIn = require('../internals/get-built-in');\nvar definePropertyModule = require('../internals/object-define-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar DESCRIPTORS = require('../internals/descriptors');\n\nvar SPECIES = wellKnownSymbol('species');\n\nmodule.exports = function (CONSTRUCTOR_NAME) {\n  var Constructor = getBuiltIn(CONSTRUCTOR_NAME);\n  var defineProperty = definePropertyModule.f;\n\n  if (DESCRIPTORS && Constructor && !Constructor[SPECIES]) {\n    defineProperty(Constructor, SPECIES, {\n      configurable: true,\n      get: function () { return this; }\n    });\n  }\n};\n","var fails = require('../internals/fails');\nvar global = require('../internals/global');\n\n// babel-minify and Closure Compiler transpiles RegExp('.', 's') -> /./s and it causes SyntaxError\nvar $RegExp = global.RegExp;\n\nmodule.exports = fails(function () {\n  var re = $RegExp('.', 's');\n  return !(re.dotAll && re.exec('\\n') && re.flags === 's');\n});\n","'use strict';\n// TODO: Remove from `core-js@4` since it's moved to entry points\nrequire('../modules/es.regexp.exec');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar redefine = require('../internals/redefine');\nvar regexpExec = require('../internals/regexp-exec');\nvar fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nvar SPECIES = wellKnownSymbol('species');\nvar RegExpPrototype = RegExp.prototype;\n\nmodule.exports = function (KEY, exec, FORCED, SHAM) {\n  var SYMBOL = wellKnownSymbol(KEY);\n\n  var DELEGATES_TO_SYMBOL = !fails(function () {\n    // String methods call symbol-named RegEp methods\n    var O = {};\n    O[SYMBOL] = function () { return 7; };\n    return ''[KEY](O) != 7;\n  });\n\n  var DELEGATES_TO_EXEC = DELEGATES_TO_SYMBOL && !fails(function () {\n    // Symbol-named RegExp methods call .exec\n    var execCalled = false;\n    var re = /a/;\n\n    if (KEY === 'split') {\n      // We can't use real regex here since it causes deoptimization\n      // and serious performance degradation in V8\n      // https://github.com/zloirock/core-js/issues/306\n      re = {};\n      // RegExp[@@split] doesn't call the regex's exec method, but first creates\n      // a new one. We need to return the patched regex when creating the new one.\n      re.constructor = {};\n      re.constructor[SPECIES] = function () { return re; };\n      re.flags = '';\n      re[SYMBOL] = /./[SYMBOL];\n    }\n\n    re.exec = function () { execCalled = true; return null; };\n\n    re[SYMBOL]('');\n    return !execCalled;\n  });\n\n  if (\n    !DELEGATES_TO_SYMBOL ||\n    !DELEGATES_TO_EXEC ||\n    FORCED\n  ) {\n    var uncurriedNativeRegExpMethod = uncurryThis(/./[SYMBOL]);\n    var methods = exec(SYMBOL, ''[KEY], function (nativeMethod, regexp, str, arg2, forceStringMethod) {\n      var uncurriedNativeMethod = uncurryThis(nativeMethod);\n      var $exec = regexp.exec;\n      if ($exec === regexpExec || $exec === RegExpPrototype.exec) {\n        if (DELEGATES_TO_SYMBOL && !forceStringMethod) {\n          // The native String method already delegates to @@method (this\n          // polyfilled function), leasing to infinite recursion.\n          // We avoid it by directly calling the native @@method method.\n          return { done: true, value: uncurriedNativeRegExpMethod(regexp, str, arg2) };\n        }\n        return { done: true, value: uncurriedNativeMethod(str, regexp, arg2) };\n      }\n      return { done: false };\n    });\n\n    redefine(String.prototype, KEY, methods[0]);\n    redefine(RegExpPrototype, SYMBOL, methods[1]);\n  }\n\n  if (SHAM) createNonEnumerableProperty(RegExpPrototype[SYMBOL], 'sham', true);\n};\n","'use strict';\nvar charAt = require('../internals/string-multibyte').charAt;\n\n// `AdvanceStringIndex` abstract operation\n// https://tc39.es/ecma262/#sec-advancestringindex\nmodule.exports = function (S, index, unicode) {\n  return index + (unicode ? charAt(S, index).length : 1);\n};\n","var global = require('../internals/global');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar createProperty = require('../internals/create-property');\n\nvar Array = global.Array;\nvar max = Math.max;\n\nmodule.exports = function (O, start, end) {\n  var length = lengthOfArrayLike(O);\n  var k = toAbsoluteIndex(start, length);\n  var fin = toAbsoluteIndex(end === undefined ? length : end, length);\n  var result = Array(max(fin - k, 0));\n  for (var n = 0; k < fin; k++, n++) createProperty(result, n, O[k]);\n  result.length = n;\n  return result;\n};\n","var global = require('../internals/global');\nvar call = require('../internals/function-call');\nvar anObject = require('../internals/an-object');\nvar isCallable = require('../internals/is-callable');\nvar classof = require('../internals/classof-raw');\nvar regexpExec = require('../internals/regexp-exec');\n\nvar TypeError = global.TypeError;\n\n// `RegExpExec` abstract operation\n// https://tc39.es/ecma262/#sec-regexpexec\nmodule.exports = function (R, S) {\n  var exec = R.exec;\n  if (isCallable(exec)) {\n    var result = call(exec, R, S);\n    if (result !== null) anObject(result);\n    return result;\n  }\n  if (classof(R) === 'RegExp') return call(regexpExec, R, S);\n  throw TypeError('RegExp#exec called on incompatible receiver');\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\n\nmodule.exports = uncurryThis([].slice);\n","var wellKnownSymbol = require('../internals/well-known-symbol');\nvar create = require('../internals/object-create');\nvar definePropertyModule = require('../internals/object-define-property');\n\nvar UNSCOPABLES = wellKnownSymbol('unscopables');\nvar ArrayPrototype = Array.prototype;\n\n// Array.prototype[@@unscopables]\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\nif (ArrayPrototype[UNSCOPABLES] == undefined) {\n  definePropertyModule.f(ArrayPrototype, UNSCOPABLES, {\n    configurable: true,\n    value: create(null)\n  });\n}\n\n// add a key to Array.prototype[@@unscopables]\nmodule.exports = function (key) {\n  ArrayPrototype[UNSCOPABLES][key] = true;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar call = require('../internals/function-call');\nvar IS_PURE = require('../internals/is-pure');\nvar FunctionName = require('../internals/function-name');\nvar isCallable = require('../internals/is-callable');\nvar createIteratorConstructor = require('../internals/create-iterator-constructor');\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar Iterators = require('../internals/iterators');\nvar IteratorsCore = require('../internals/iterators-core');\n\nvar PROPER_FUNCTION_NAME = FunctionName.PROPER;\nvar CONFIGURABLE_FUNCTION_NAME = FunctionName.CONFIGURABLE;\nvar IteratorPrototype = IteratorsCore.IteratorPrototype;\nvar BUGGY_SAFARI_ITERATORS = IteratorsCore.BUGGY_SAFARI_ITERATORS;\nvar ITERATOR = wellKnownSymbol('iterator');\nvar KEYS = 'keys';\nvar VALUES = 'values';\nvar ENTRIES = 'entries';\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (Iterable, NAME, IteratorConstructor, next, DEFAULT, IS_SET, FORCED) {\n  createIteratorConstructor(IteratorConstructor, NAME, next);\n\n  var getIterationMethod = function (KIND) {\n    if (KIND === DEFAULT && defaultIterator) return defaultIterator;\n    if (!BUGGY_SAFARI_ITERATORS && KIND in IterablePrototype) return IterablePrototype[KIND];\n    switch (KIND) {\n      case KEYS: return function keys() { return new IteratorConstructor(this, KIND); };\n      case VALUES: return function values() { return new IteratorConstructor(this, KIND); };\n      case ENTRIES: return function entries() { return new IteratorConstructor(this, KIND); };\n    } return function () { return new IteratorConstructor(this); };\n  };\n\n  var TO_STRING_TAG = NAME + ' Iterator';\n  var INCORRECT_VALUES_NAME = false;\n  var IterablePrototype = Iterable.prototype;\n  var nativeIterator = IterablePrototype[ITERATOR]\n    || IterablePrototype['@@iterator']\n    || DEFAULT && IterablePrototype[DEFAULT];\n  var defaultIterator = !BUGGY_SAFARI_ITERATORS && nativeIterator || getIterationMethod(DEFAULT);\n  var anyNativeIterator = NAME == 'Array' ? IterablePrototype.entries || nativeIterator : nativeIterator;\n  var CurrentIteratorPrototype, methods, KEY;\n\n  // fix native\n  if (anyNativeIterator) {\n    CurrentIteratorPrototype = getPrototypeOf(anyNativeIterator.call(new Iterable()));\n    if (CurrentIteratorPrototype !== Object.prototype && CurrentIteratorPrototype.next) {\n      if (!IS_PURE && getPrototypeOf(CurrentIteratorPrototype) !== IteratorPrototype) {\n        if (setPrototypeOf) {\n          setPrototypeOf(CurrentIteratorPrototype, IteratorPrototype);\n        } else if (!isCallable(CurrentIteratorPrototype[ITERATOR])) {\n          redefine(CurrentIteratorPrototype, ITERATOR, returnThis);\n        }\n      }\n      // Set @@toStringTag to native iterators\n      setToStringTag(CurrentIteratorPrototype, TO_STRING_TAG, true, true);\n      if (IS_PURE) Iterators[TO_STRING_TAG] = returnThis;\n    }\n  }\n\n  // fix Array.prototype.{ values, @@iterator }.name in V8 / FF\n  if (PROPER_FUNCTION_NAME && DEFAULT == VALUES && nativeIterator && nativeIterator.name !== VALUES) {\n    if (!IS_PURE && CONFIGURABLE_FUNCTION_NAME) {\n      createNonEnumerableProperty(IterablePrototype, 'name', VALUES);\n    } else {\n      INCORRECT_VALUES_NAME = true;\n      defaultIterator = function values() { return call(nativeIterator, this); };\n    }\n  }\n\n  // export additional methods\n  if (DEFAULT) {\n    methods = {\n      values: getIterationMethod(VALUES),\n      keys: IS_SET ? defaultIterator : getIterationMethod(KEYS),\n      entries: getIterationMethod(ENTRIES)\n    };\n    if (FORCED) for (KEY in methods) {\n      if (BUGGY_SAFARI_ITERATORS || INCORRECT_VALUES_NAME || !(KEY in IterablePrototype)) {\n        redefine(IterablePrototype, KEY, methods[KEY]);\n      }\n    } else $({ target: NAME, proto: true, forced: BUGGY_SAFARI_ITERATORS || INCORRECT_VALUES_NAME }, methods);\n  }\n\n  // define iterator\n  if ((!IS_PURE || FORCED) && IterablePrototype[ITERATOR] !== defaultIterator) {\n    redefine(IterablePrototype, ITERATOR, defaultIterator, { name: DEFAULT });\n  }\n  Iterators[NAME] = defaultIterator;\n\n  return methods;\n};\n","var global = require('../internals/global');\nvar bind = require('../internals/function-bind-context');\nvar call = require('../internals/function-call');\nvar anObject = require('../internals/an-object');\nvar tryToString = require('../internals/try-to-string');\nvar isArrayIteratorMethod = require('../internals/is-array-iterator-method');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar getIterator = require('../internals/get-iterator');\nvar getIteratorMethod = require('../internals/get-iterator-method');\nvar iteratorClose = require('../internals/iterator-close');\n\nvar TypeError = global.TypeError;\n\nvar Result = function (stopped, result) {\n  this.stopped = stopped;\n  this.result = result;\n};\n\nvar ResultPrototype = Result.prototype;\n\nmodule.exports = function (iterable, unboundFunction, options) {\n  var that = options && options.that;\n  var AS_ENTRIES = !!(options && options.AS_ENTRIES);\n  var IS_ITERATOR = !!(options && options.IS_ITERATOR);\n  var INTERRUPTED = !!(options && options.INTERRUPTED);\n  var fn = bind(unboundFunction, that);\n  var iterator, iterFn, index, length, result, next, step;\n\n  var stop = function (condition) {\n    if (iterator) iteratorClose(iterator, 'normal', condition);\n    return new Result(true, condition);\n  };\n\n  var callFn = function (value) {\n    if (AS_ENTRIES) {\n      anObject(value);\n      return INTERRUPTED ? fn(value[0], value[1], stop) : fn(value[0], value[1]);\n    } return INTERRUPTED ? fn(value, stop) : fn(value);\n  };\n\n  if (IS_ITERATOR) {\n    iterator = iterable;\n  } else {\n    iterFn = getIteratorMethod(iterable);\n    if (!iterFn) throw TypeError(tryToString(iterable) + ' is not iterable');\n    // optimisation for array iterators\n    if (isArrayIteratorMethod(iterFn)) {\n      for (index = 0, length = lengthOfArrayLike(iterable); length > index; index++) {\n        result = callFn(iterable[index]);\n        if (result && isPrototypeOf(ResultPrototype, result)) return result;\n      } return new Result(false);\n    }\n    iterator = getIterator(iterable, iterFn);\n  }\n\n  next = iterator.next;\n  while (!(step = call(next, iterator)).done) {\n    try {\n      result = callFn(step.value);\n    } catch (error) {\n      iteratorClose(iterator, 'throw', error);\n    }\n    if (typeof result == 'object' && result && isPrototypeOf(ResultPrototype, result)) return result;\n  } return new Result(false);\n};\n","var classof = require('../internals/classof');\nvar getMethod = require('../internals/get-method');\nvar Iterators = require('../internals/iterators');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\n\nmodule.exports = function (it) {\n  if (it != undefined) return getMethod(it, ITERATOR)\n    || getMethod(it, '@@iterator')\n    || Iterators[classof(it)];\n};\n","var global = require('../internals/global');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\n\nvar TypeError = global.TypeError;\n\nmodule.exports = function (it, Prototype) {\n  if (isPrototypeOf(Prototype, it)) return it;\n  throw TypeError('Incorrect invocation');\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar SAFE_CLOSING = false;\n\ntry {\n  var called = 0;\n  var iteratorWithReturn = {\n    next: function () {\n      return { done: !!called++ };\n    },\n    'return': function () {\n      SAFE_CLOSING = true;\n    }\n  };\n  iteratorWithReturn[ITERATOR] = function () {\n    return this;\n  };\n  // eslint-disable-next-line es/no-array-from, no-throw-literal -- required for testing\n  Array.from(iteratorWithReturn, function () { throw 2; });\n} catch (error) { /* empty */ }\n\nmodule.exports = function (exec, SKIP_CLOSING) {\n  if (!SKIP_CLOSING && !SAFE_CLOSING) return false;\n  var ITERATION_SUPPORT = false;\n  try {\n    var object = {};\n    object[ITERATOR] = function () {\n      return {\n        next: function () {\n          return { done: ITERATION_SUPPORT = true };\n        }\n      };\n    };\n    exec(object);\n  } catch (error) { /* empty */ }\n  return ITERATION_SUPPORT;\n};\n","var classof = require('../internals/classof-raw');\nvar global = require('../internals/global');\n\nmodule.exports = classof(global.process) == 'process';\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar nativeGetOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar DESCRIPTORS = require('../internals/descriptors');\n\nvar FAILS_ON_PRIMITIVES = fails(function () { nativeGetOwnPropertyDescriptor(1); });\nvar FORCED = !DESCRIPTORS || FAILS_ON_PRIMITIVES;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.es/ecma262/#sec-object.getownpropertydescriptor\n$({ target: 'Object', stat: true, forced: FORCED, sham: !DESCRIPTORS }, {\n  getOwnPropertyDescriptor: function getOwnPropertyDescriptor(it, key) {\n    return nativeGetOwnPropertyDescriptor(toIndexedObject(it), key);\n  }\n});\n","var $ = require('../internals/export');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar ownKeys = require('../internals/own-keys');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar createProperty = require('../internals/create-property');\n\n// `Object.getOwnPropertyDescriptors` method\n// https://tc39.es/ecma262/#sec-object.getownpropertydescriptors\n$({ target: 'Object', stat: true, sham: !DESCRIPTORS }, {\n  getOwnPropertyDescriptors: function getOwnPropertyDescriptors(object) {\n    var O = toIndexedObject(object);\n    var getOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\n    var keys = ownKeys(O);\n    var result = {};\n    var index = 0;\n    var key, descriptor;\n    while (keys.length > index) {\n      descriptor = getOwnPropertyDescriptor(O, key = keys[index++]);\n      if (descriptor !== undefined) createProperty(result, key, descriptor);\n    }\n    return result;\n  }\n});\n","/**\n * typed-function\n *\n * Type checking for JavaScript functions\n *\n * https://github.com/josdejong/typed-function\n */\n'use strict';\n\n(function (root, factory) {\n  if (typeof define === 'function' && define.amd) {\n    // AMD. Register as an anonymous module.\n    define([], factory);\n  } else if (typeof exports === 'object') {\n    // OldNode. Does not work with strict CommonJS, but\n    // only CommonJS-like environments that support module.exports,\n    // like OldNode.\n    module.exports = factory();\n  } else {\n    // Browser globals (root is window)\n    root.typed = factory();\n  }\n}(this, function () {\n\n  function ok () {\n    return true;\n  }\n\n  function notOk () {\n    return false;\n  }\n\n  function undef () {\n    return undefined;\n  }\n\n  /**\n   * @typedef {{\n   *   params: Param[],\n   *   fn: function\n   * }} Signature\n   *\n   * @typedef {{\n   *   types: Type[],\n   *   restParam: boolean\n   * }} Param\n   *\n   * @typedef {{\n   *   name: string,\n   *   typeIndex: number,\n   *   test: function,\n   *   conversion?: ConversionDef,\n   *   conversionIndex: number,\n   * }} Type\n   *\n   * @typedef {{\n   *   from: string,\n   *   to: string,\n   *   convert: function (*) : *\n   * }} ConversionDef\n   *\n   * @typedef {{\n   *   name: string,\n   *   test: function(*) : boolean\n   * }} TypeDef\n   */\n\n  // create a new instance of typed-function\n  function create () {\n    // data type tests\n    var _types = [\n      { name: 'number',    test: function (x) { return typeof x === 'number' } },\n      { name: 'string',    test: function (x) { return typeof x === 'string' } },\n      { name: 'boolean',   test: function (x) { return typeof x === 'boolean' } },\n      { name: 'Function',  test: function (x) { return typeof x === 'function'} },\n      { name: 'Array',     test: Array.isArray },\n      { name: 'Date',      test: function (x) { return x instanceof Date } },\n      { name: 'RegExp',    test: function (x) { return x instanceof RegExp } },\n      { name: 'Object',    test: function (x) {\n        return typeof x === 'object' && x !== null && x.constructor === Object\n      }},\n      { name: 'null',      test: function (x) { return x === null } },\n      { name: 'undefined', test: function (x) { return x === undefined } }\n    ];\n\n    var anyType = {\n      name: 'any',\n      test: ok\n    }\n\n    // types which need to be ignored\n    var _ignore = [];\n\n    // type conversions\n    var _conversions = [];\n\n    // This is a temporary object, will be replaced with a typed function at the end\n    var typed = {\n      types: _types,\n      conversions: _conversions,\n      ignore: _ignore\n    };\n\n    /**\n     * Find the test function for a type\n     * @param {String} typeName\n     * @return {TypeDef} Returns the type definition when found,\n     *                    Throws a TypeError otherwise\n     */\n    function findTypeByName (typeName) {\n      var entry = findInArray(typed.types, function (entry) {\n        return entry.name === typeName;\n      });\n\n      if (entry) {\n        return entry;\n      }\n\n      if (typeName === 'any') { // special baked-in case 'any'\n        return anyType;\n      }\n\n      var hint = findInArray(typed.types, function (entry) {\n        return entry.name.toLowerCase() === typeName.toLowerCase();\n      });\n\n      throw new TypeError('Unknown type \"' + typeName + '\"' +\n          (hint ? ('. Did you mean \"' + hint.name + '\"?') : ''));\n    }\n\n    /**\n     * Find the index of a type definition. Handles special case 'any'\n     * @param {TypeDef} type\n     * @return {number}\n     */\n    function findTypeIndex(type) {\n      if (type === anyType) {\n        return 999;\n      }\n\n      return typed.types.indexOf(type);\n    }\n\n    /**\n     * Find a type that matches a value.\n     * @param {*} value\n     * @return {string} Returns the name of the first type for which\n     *                  the type test matches the value.\n     */\n    function findTypeName(value) {\n      var entry = findInArray(typed.types, function (entry) {\n        return entry.test(value);\n      });\n\n      if (entry) {\n        return entry.name;\n      }\n\n      throw new TypeError('Value has unknown type. Value: ' + value);\n    }\n\n    /**\n     * Find a specific signature from a (composed) typed function, for example:\n     *\n     *   typed.find(fn, ['number', 'string'])\n     *   typed.find(fn, 'number, string')\n     *\n     * Function find only only works for exact matches.\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature   Signature to be found, can be\n     *                                        an array or a comma separated string.\n     * @return {Function}                     Returns the matching signature, or\n     *                                        throws an error when no signature\n     *                                        is found.\n     */\n    function find (fn, signature) {\n      if (!fn.signatures) {\n        throw new TypeError('Function is no typed-function');\n      }\n\n      // normalize input\n      var arr;\n      if (typeof signature === 'string') {\n        arr = signature.split(',');\n        for (var i = 0; i < arr.length; i++) {\n          arr[i] = arr[i].trim();\n        }\n      }\n      else if (Array.isArray(signature)) {\n        arr = signature;\n      }\n      else {\n        throw new TypeError('String array or a comma separated string expected');\n      }\n\n      var str = arr.join(',');\n\n      // find an exact match\n      var match = fn.signatures[str];\n      if (match) {\n        return match;\n      }\n\n      // TODO: extend find to match non-exact signatures\n\n      throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + arr.join(', ') + '))');\n    }\n\n    /**\n     * Convert a given value to another data type.\n     * @param {*} value\n     * @param {string} type\n     */\n    function convert (value, type) {\n      var from = findTypeName(value);\n\n      // check conversion is needed\n      if (type === from) {\n        return value;\n      }\n\n      for (var i = 0; i < typed.conversions.length; i++) {\n        var conversion = typed.conversions[i];\n        if (conversion.from === from && conversion.to === type) {\n          return conversion.convert(value);\n        }\n      }\n\n      throw new Error('Cannot convert from ' + from + ' to ' + type);\n    }\n    \n    /**\n     * Stringify parameters in a normalized way\n     * @param {Param[]} params\n     * @return {string}\n     */\n    function stringifyParams (params) {\n      return params\n          .map(function (param) {\n            var typeNames = param.types.map(getTypeName);\n\n            return (param.restParam ? '...' : '') + typeNames.join('|');\n          })\n          .join(',');\n    }\n\n    /**\n     * Parse a parameter, like \"...number | boolean\"\n     * @param {string} param\n     * @param {ConversionDef[]} conversions\n     * @return {Param} param\n     */\n    function parseParam (param, conversions) {\n      var restParam = param.indexOf('...') === 0;\n      var types = (!restParam)\n          ? param\n          : (param.length > 3)\n              ? param.slice(3)\n              : 'any';\n\n      var typeNames = types.split('|').map(trim)\n          .filter(notEmpty)\n          .filter(notIgnore);\n\n      var matchingConversions = filterConversions(conversions, typeNames);\n\n      var exactTypes = typeNames.map(function (typeName) {\n        var type = findTypeByName(typeName);\n\n        return {\n          name: typeName,\n          typeIndex: findTypeIndex(type),\n          test: type.test,\n          conversion: null,\n          conversionIndex: -1\n        };\n      });\n\n      var convertibleTypes = matchingConversions.map(function (conversion) {\n        var type = findTypeByName(conversion.from);\n\n        return {\n          name: conversion.from,\n          typeIndex: findTypeIndex(type),\n          test: type.test,\n          conversion: conversion,\n          conversionIndex: conversions.indexOf(conversion)\n        };\n      });\n\n      return {\n        types: exactTypes.concat(convertibleTypes),\n        restParam: restParam\n      };\n    }\n\n    /**\n     * Parse a signature with comma separated parameters,\n     * like \"number | boolean, ...string\"\n     * @param {string} signature\n     * @param {function} fn\n     * @param {ConversionDef[]} conversions\n     * @return {Signature | null} signature\n     */\n    function parseSignature (signature, fn, conversions) {\n      var params = [];\n\n      if (signature.trim() !== '') {\n        params = signature\n            .split(',')\n            .map(trim)\n            .map(function (param, index, array) {\n              var parsedParam = parseParam(param, conversions);\n\n              if (parsedParam.restParam && (index !== array.length - 1)) {\n                throw new SyntaxError('Unexpected rest parameter \"' + param + '\": ' +\n                    'only allowed for the last parameter');\n              }\n\n              return parsedParam;\n          });\n      }\n\n      if (params.some(isInvalidParam)) {\n        // invalid signature: at least one parameter has no types\n        // (they may have been filtered)\n        return null;\n      }\n\n      return {\n        params: params,\n        fn: fn\n      };\n    }\n\n    /**\n     * Test whether a set of params contains a restParam\n     * @param {Param[]} params\n     * @return {boolean} Returns true when the last parameter is a restParam\n     */\n    function hasRestParam(params) {\n      var param = last(params)\n      return param ? param.restParam : false;\n    }\n\n    /**\n     * Test whether a parameter contains conversions\n     * @param {Param} param\n     * @return {boolean} Returns true when at least one of the parameters\n     *                   contains a conversion.\n     */\n    function hasConversions(param) {\n      return param.types.some(function (type) {\n        return type.conversion != null;\n      });\n    }\n\n    /**\n     * Create a type test for a single parameter, which can have one or multiple\n     * types.\n     * @param {Param} param\n     * @return {function(x: *) : boolean} Returns a test function\n     */\n    function compileTest(param) {\n      if (!param || param.types.length === 0) {\n        // nothing to do\n        return ok;\n      }\n      else if (param.types.length === 1) {\n        return findTypeByName(param.types[0].name).test;\n      }\n      else if (param.types.length === 2) {\n        var test0 = findTypeByName(param.types[0].name).test;\n        var test1 = findTypeByName(param.types[1].name).test;\n        return function or(x) {\n          return test0(x) || test1(x);\n        }\n      }\n      else { // param.types.length > 2\n        var tests = param.types.map(function (type) {\n          return findTypeByName(type.name).test;\n        })\n        return function or(x) {\n          for (var i = 0; i < tests.length; i++) {\n            if (tests[i](x)) {\n              return true;\n            }\n          }\n          return false;\n        }\n      }\n    }\n\n    /**\n     * Create a test for all parameters of a signature\n     * @param {Param[]} params\n     * @return {function(args: Array<*>) : boolean}\n     */\n    function compileTests(params) {\n      var tests, test0, test1;\n\n      if (hasRestParam(params)) {\n        // variable arguments like '...number'\n        tests = initial(params).map(compileTest);\n        var varIndex = tests.length;\n        var lastTest = compileTest(last(params));\n        var testRestParam = function (args) {\n          for (var i = varIndex; i < args.length; i++) {\n            if (!lastTest(args[i])) {\n              return false;\n            }\n          }\n          return true;\n        }\n\n        return function testArgs(args) {\n          for (var i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false;\n            }\n          }\n          return testRestParam(args) && (args.length >= varIndex + 1);\n        };\n      }\n      else {\n        // no variable arguments\n        if (params.length === 0) {\n          return function testArgs(args) {\n            return args.length === 0;\n          };\n        }\n        else if (params.length === 1) {\n          test0 = compileTest(params[0]);\n          return function testArgs(args) {\n            return test0(args[0]) && args.length === 1;\n          };\n        }\n        else if (params.length === 2) {\n          test0 = compileTest(params[0]);\n          test1 = compileTest(params[1]);\n          return function testArgs(args) {\n            return test0(args[0]) && test1(args[1]) && args.length === 2;\n          };\n        }\n        else { // arguments.length > 2\n          tests = params.map(compileTest);\n          return function testArgs(args) {\n            for (var i = 0; i < tests.length; i++) {\n              if (!tests[i](args[i])) {\n                return false;\n              }\n            }\n            return args.length === tests.length;\n          };\n        }\n      }\n    }\n\n    /**\n     * Find the parameter at a specific index of a signature.\n     * Handles rest parameters.\n     * @param {Signature} signature\n     * @param {number} index\n     * @return {Param | null} Returns the matching parameter when found,\n     *                        null otherwise.\n     */\n    function getParamAtIndex(signature, index) {\n      return index < signature.params.length\n          ? signature.params[index]\n          : hasRestParam(signature.params)\n              ? last(signature.params)\n              : null\n    }\n\n    /**\n     * Get all type names of a parameter\n     * @param {Signature} signature\n     * @param {number} index\n     * @param {boolean} excludeConversions\n     * @return {string[]} Returns an array with type names\n     */\n    function getExpectedTypeNames (signature, index, excludeConversions) {\n      var param = getParamAtIndex(signature, index);\n      var types = param\n          ? excludeConversions\n                  ? param.types.filter(isExactType)\n                  : param.types\n          : [];\n\n      return types.map(getTypeName);\n    }\n\n    /**\n     * Returns the name of a type\n     * @param {Type} type\n     * @return {string} Returns the type name\n     */\n    function getTypeName(type) {\n      return type.name;\n    }\n\n    /**\n     * Test whether a type is an exact type or conversion\n     * @param {Type} type\n     * @return {boolean} Returns true when\n     */\n    function isExactType(type) {\n      return type.conversion === null || type.conversion === undefined;\n    }\n\n    /**\n     * Helper function for creating error messages: create an array with\n     * all available types on a specific argument index.\n     * @param {Signature[]} signatures\n     * @param {number} index\n     * @return {string[]} Returns an array with available types\n     */\n    function mergeExpectedParams(signatures, index) {\n      var typeNames = uniq(flatMap(signatures, function (signature) {\n        return getExpectedTypeNames(signature, index, false);\n      }));\n\n      return (typeNames.indexOf('any') !== -1) ? ['any'] : typeNames;\n    }\n\n    /**\n     * Create\n     * @param {string} name             The name of the function\n     * @param {array.<*>} args          The actual arguments passed to the function\n     * @param {Signature[]} signatures  A list with available signatures\n     * @return {TypeError} Returns a type error with additional data\n     *                     attached to it in the property `data`\n     */\n    function createError(name, args, signatures) {\n      var err, expected;\n      var _name = name || 'unnamed';\n\n      // test for wrong type at some index\n      var matchingSignatures = signatures;\n      var index;\n      for (index = 0; index < args.length; index++) {\n        var nextMatchingDefs = matchingSignatures.filter(function (signature) {\n          var test = compileTest(getParamAtIndex(signature, index));\n          return (index < signature.params.length || hasRestParam(signature.params)) &&\n              test(args[index]);\n        });\n\n        if (nextMatchingDefs.length === 0) {\n          // no matching signatures anymore, throw error \"wrong type\"\n          expected = mergeExpectedParams(matchingSignatures, index);\n          if (expected.length > 0) {\n            var actualType = findTypeName(args[index]);\n\n            err = new TypeError('Unexpected type of argument in function ' + _name +\n                ' (expected: ' + expected.join(' or ') +\n                ', actual: ' + actualType + ', index: ' + index + ')');\n            err.data = {\n              category: 'wrongType',\n              fn: _name,\n              index: index,\n              actual: actualType,\n              expected: expected\n            }\n            return err;\n          }\n        }\n        else {\n          matchingSignatures = nextMatchingDefs;\n        }\n      }\n\n      // test for too few arguments\n      var lengths = matchingSignatures.map(function (signature) {\n        return hasRestParam(signature.params) ? Infinity : signature.params.length;\n      });\n      if (args.length < Math.min.apply(null, lengths)) {\n        expected = mergeExpectedParams(matchingSignatures, index);\n        err = new TypeError('Too few arguments in function ' + _name +\n            ' (expected: ' + expected.join(' or ') +\n            ', index: ' + args.length + ')');\n        err.data = {\n          category: 'tooFewArgs',\n          fn: _name,\n          index: args.length,\n          expected: expected\n        }\n        return err;\n      }\n\n      // test for too many arguments\n      var maxLength = Math.max.apply(null, lengths);\n      if (args.length > maxLength) {\n        err = new TypeError('Too many arguments in function ' + _name +\n            ' (expected: ' + maxLength + ', actual: ' + args.length + ')');\n        err.data = {\n          category: 'tooManyArgs',\n          fn: _name,\n          index: args.length,\n          expectedLength: maxLength\n        }\n        return err;\n      }\n\n      err = new TypeError('Arguments of type \"' + args.join(', ') +\n          '\" do not match any of the defined signatures of function ' + _name + '.');\n      err.data = {\n        category: 'mismatch',\n        actual: args.map(findTypeName)\n      }\n      return err;\n    }\n\n    /**\n     * Find the lowest index of all exact types of a parameter (no conversions)\n     * @param {Param} param\n     * @return {number} Returns the index of the lowest type in typed.types\n     */\n    function getLowestTypeIndex (param) {\n      var min = 999;\n\n      for (var i = 0; i < param.types.length; i++) {\n        if (isExactType(param.types[i])) {\n          min = Math.min(min, param.types[i].typeIndex);\n        }\n      }\n\n      return min;\n    }\n\n    /**\n     * Find the lowest index of the conversion of all types of the parameter\n     * having a conversion\n     * @param {Param} param\n     * @return {number} Returns the lowest index of the conversions of this type\n     */\n    function getLowestConversionIndex (param) {\n      var min = 999;\n\n      for (var i = 0; i < param.types.length; i++) {\n        if (!isExactType(param.types[i])) {\n          min = Math.min(min, param.types[i].conversionIndex);\n        }\n      }\n\n      return min;\n    }\n\n    /**\n     * Compare two params\n     * @param {Param} param1\n     * @param {Param} param2\n     * @return {number} returns a negative number when param1 must get a lower\n     *                  index than param2, a positive number when the opposite,\n     *                  or zero when both are equal\n     */\n    function compareParams (param1, param2) {\n      var c;\n\n      // compare having a rest parameter or not\n      c = param1.restParam - param2.restParam;\n      if (c !== 0) {\n        return c;\n      }\n\n      // compare having conversions or not\n      c = hasConversions(param1) - hasConversions(param2);\n      if (c !== 0) {\n        return c;\n      }\n\n      // compare the index of the types\n      c = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n      if (c !== 0) {\n        return c;\n      }\n\n      // compare the index of any conversion\n      return getLowestConversionIndex(param1) - getLowestConversionIndex(param2);\n    }\n\n    /**\n     * Compare two signatures\n     * @param {Signature} signature1\n     * @param {Signature} signature2\n     * @return {number} returns a negative number when param1 must get a lower\n     *                  index than param2, a positive number when the opposite,\n     *                  or zero when both are equal\n     */\n    function compareSignatures (signature1, signature2) {\n      var len = Math.min(signature1.params.length, signature2.params.length);\n      var i;\n      var c;\n\n      // compare whether the params have conversions at all or not\n      c = signature1.params.some(hasConversions) - signature2.params.some(hasConversions)\n      if (c !== 0) {\n        return c;\n      }\n\n      // next compare whether the params have conversions one by one\n      for (i = 0; i < len; i++) {\n        c = hasConversions(signature1.params[i]) - hasConversions(signature2.params[i]);\n        if (c !== 0) {\n          return c;\n        }\n      }\n\n      // compare the types of the params one by one\n      for (i = 0; i < len; i++) {\n        c = compareParams(signature1.params[i], signature2.params[i]);\n        if (c !== 0) {\n          return c;\n        }\n      }\n\n      // compare the number of params\n      return signature1.params.length - signature2.params.length;\n    }\n\n    /**\n     * Get params containing all types that can be converted to the defined types.\n     *\n     * @param {ConversionDef[]} conversions\n     * @param {string[]} typeNames\n     * @return {ConversionDef[]} Returns the conversions that are available\n     *                        for every type (if any)\n     */\n    function filterConversions(conversions, typeNames) {\n      var matches = {};\n\n      conversions.forEach(function (conversion) {\n        if (typeNames.indexOf(conversion.from) === -1 &&\n            typeNames.indexOf(conversion.to) !== -1 &&\n            !matches[conversion.from]) {\n          matches[conversion.from] = conversion;\n        }\n      });\n\n      return Object.keys(matches).map(function (from) {\n        return matches[from];\n      });\n    }\n\n    /**\n     * Preprocess arguments before calling the original function:\n     * - if needed convert the parameters\n     * - in case of rest parameters, move the rest parameters into an Array\n     * @param {Param[]} params\n     * @param {function} fn\n     * @return {function} Returns a wrapped function\n     */\n    function compileArgsPreprocessing(params, fn) {\n      var fnConvert = fn;\n\n      // TODO: can we make this wrapper function smarter/simpler?\n\n      if (params.some(hasConversions)) {\n        var restParam = hasRestParam(params);\n        var compiledConversions = params.map(compileArgConversion)\n\n        fnConvert = function convertArgs() {\n          var args = [];\n          var last = restParam ? arguments.length - 1 : arguments.length;\n          for (var i = 0; i < last; i++) {\n            args[i] = compiledConversions[i](arguments[i]);\n          }\n          if (restParam) {\n            args[last] = arguments[last].map(compiledConversions[last]);\n          }\n\n          return fn.apply(this, args);\n        }\n      }\n\n      var fnPreprocess = fnConvert;\n      if (hasRestParam(params)) {\n        var offset = params.length - 1;\n\n        fnPreprocess = function preprocessRestParams () {\n          return fnConvert.apply(this,\n              slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n        }\n      }\n\n      return fnPreprocess;\n    }\n\n    /**\n     * Compile conversion for a parameter to the right type\n     * @param {Param} param\n     * @return {function} Returns the wrapped function that will convert arguments\n     *\n     */\n    function compileArgConversion(param) {\n      var test0, test1, conversion0, conversion1;\n      var tests = [];\n      var conversions = [];\n\n      param.types.forEach(function (type) {\n        if (type.conversion) {\n          tests.push(findTypeByName(type.conversion.from).test);\n          conversions.push(type.conversion.convert);\n        }\n      });\n\n      // create optimized conversion functions depending on the number of conversions\n      switch (conversions.length) {\n        case 0:\n          return function convertArg(arg) {\n            return arg;\n          }\n\n        case 1:\n          test0 = tests[0]\n          conversion0 = conversions[0];\n          return function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg)\n            }\n            return arg;\n          }\n\n        case 2:\n          test0 = tests[0]\n          test1 = tests[1]\n          conversion0 = conversions[0];\n          conversion1 = conversions[1];\n          return function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg)\n            }\n            if (test1(arg)) {\n              return conversion1(arg)\n            }\n            return arg;\n          }\n\n        default:\n          return function convertArg(arg) {\n            for (var i = 0; i < conversions.length; i++) {\n              if (tests[i](arg)) {\n                return conversions[i](arg);\n              }\n            }\n            return arg;\n          }\n      }\n    }\n\n    /**\n     * Convert an array with signatures into a map with signatures,\n     * where signatures with union types are split into separate signatures\n     *\n     * Throws an error when there are conflicting types\n     *\n     * @param {Signature[]} signatures\n     * @return {Object.<string, function>}  Returns a map with signatures\n     *                                      as key and the original function\n     *                                      of this signature as value.\n     */\n    function createSignaturesMap(signatures) {\n      var signaturesMap = {};\n      signatures.forEach(function (signature) {\n        if (!signature.params.some(hasConversions)) {\n          splitParams(signature.params, true).forEach(function (params) {\n            signaturesMap[stringifyParams(params)] = signature.fn;\n          });\n        }\n      });\n\n      return signaturesMap;\n    }\n\n    /**\n     * Split params with union types in to separate params.\n     *\n     * For example:\n     *\n     *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n     *     // returns:\n     *     // [\n     *     //   ['Array', 'string'],\n     *     //   ['Array', 'RegExp'],\n     *     //   ['Object', 'string'],\n     *     //   ['Object', 'RegExp']\n     *     // ]\n     *\n     * @param {Param[]} params\n     * @param {boolean} ignoreConversionTypes\n     * @return {Param[]}\n     */\n    function splitParams(params, ignoreConversionTypes) {\n      function _splitParams(params, index, types) {\n        if (index < params.length) {\n          var param = params[index]\n          var filteredTypes = ignoreConversionTypes\n              ? param.types.filter(isExactType)\n              : param.types;\n          var typeGroups\n\n          if (param.restParam) {\n            // split the types of a rest parameter in two:\n            // one with only exact types, and one with exact types and conversions\n            var exactTypes = filteredTypes.filter(isExactType)\n            typeGroups = exactTypes.length < filteredTypes.length\n                ? [exactTypes, filteredTypes]\n                : [filteredTypes]\n\n          }\n          else {\n            // split all the types of a regular parameter into one type per group\n            typeGroups = filteredTypes.map(function (type) {\n              return [type]\n            })\n          }\n\n          // recurse over the groups with types\n          return flatMap(typeGroups, function (typeGroup) {\n            return _splitParams(params, index + 1, types.concat([typeGroup]));\n          });\n\n        }\n        else {\n          // we've reached the end of the parameters. Now build a new Param\n          var splittedParams = types.map(function (type, typeIndex) {\n            return {\n              types: type,\n              restParam: (typeIndex === params.length - 1) && hasRestParam(params)\n            }\n          });\n\n          return [splittedParams];\n        }\n      }\n\n      return _splitParams(params, 0, []);\n    }\n\n    /**\n     * Test whether two signatures have a conflicting signature\n     * @param {Signature} signature1\n     * @param {Signature} signature2\n     * @return {boolean} Returns true when the signatures conflict, false otherwise.\n     */\n    function hasConflictingParams(signature1, signature2) {\n      var ii = Math.max(signature1.params.length, signature2.params.length);\n\n      for (var i = 0; i < ii; i++) {\n        var typesNames1 = getExpectedTypeNames(signature1, i, true);\n        var typesNames2 = getExpectedTypeNames(signature2, i, true);\n\n        if (!hasOverlap(typesNames1, typesNames2)) {\n          return false;\n        }\n      }\n\n      var len1 = signature1.params.length;\n      var len2 = signature2.params.length;\n      var restParam1 = hasRestParam(signature1.params);\n      var restParam2 = hasRestParam(signature2.params);\n\n      return restParam1\n          ? restParam2 ? (len1 === len2) : (len2 >= len1)\n          : restParam2 ? (len1 >= len2)  : (len1 === len2)\n    }\n\n    /**\n     * Create a typed function\n     * @param {String} name               The name for the typed function\n     * @param {Object.<string, function>} signaturesMap\n     *                                    An object with one or\n     *                                    multiple signatures as key, and the\n     *                                    function corresponding to the\n     *                                    signature as value.\n     * @return {function}  Returns the created typed function.\n     */\n    function createTypedFunction(name, signaturesMap) {\n      if (Object.keys(signaturesMap).length === 0) {\n        throw new SyntaxError('No signatures provided');\n      }\n\n      // parse the signatures, and check for conflicts\n      var parsedSignatures = [];\n      Object.keys(signaturesMap)\n          .map(function (signature) {\n            return parseSignature(signature, signaturesMap[signature], typed.conversions);\n          })\n          .filter(notNull)\n          .forEach(function (parsedSignature) {\n            // check whether this parameter conflicts with already parsed signatures\n            var conflictingSignature = findInArray(parsedSignatures, function (s) {\n              return hasConflictingParams(s, parsedSignature)\n            });\n            if (conflictingSignature) {\n              throw new TypeError('Conflicting signatures \"' +\n                  stringifyParams(conflictingSignature.params) + '\" and \"' +\n                  stringifyParams(parsedSignature.params) + '\".');\n            }\n\n            parsedSignatures.push(parsedSignature);\n          });\n\n      // split and filter the types of the signatures, and then order them\n      var signatures = flatMap(parsedSignatures, function (parsedSignature) {\n        var params = parsedSignature ? splitParams(parsedSignature.params, false) : []\n\n        return params.map(function (params) {\n          return {\n            params: params,\n            fn: parsedSignature.fn\n          };\n        });\n      }).filter(notNull);\n\n      signatures.sort(compareSignatures);\n\n      // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n      var ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n      var ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n      var ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n      var ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n      var ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n      var ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n      var allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n      // compile the tests\n      var tests = signatures.map(function (signature) {\n        return compileTests(signature.params);\n      });\n\n      var test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n      var test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n      var test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n      var test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n      var test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n      var test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n\n      var test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n      var test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n      var test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n      var test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n      var test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n      var test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n      // compile the functions\n      var fns = signatures.map(function(signature) {\n        return compileArgsPreprocessing(signature.params, signature.fn);\n      });\n\n      var fn0 = ok0 ? fns[0] : undef;\n      var fn1 = ok1 ? fns[1] : undef;\n      var fn2 = ok2 ? fns[2] : undef;\n      var fn3 = ok3 ? fns[3] : undef;\n      var fn4 = ok4 ? fns[4] : undef;\n      var fn5 = ok5 ? fns[5] : undef;\n\n      var len0 = ok0 ? signatures[0].params.length : -1;\n      var len1 = ok1 ? signatures[1].params.length : -1;\n      var len2 = ok2 ? signatures[2].params.length : -1;\n      var len3 = ok3 ? signatures[3].params.length : -1;\n      var len4 = ok4 ? signatures[4].params.length : -1;\n      var len5 = ok5 ? signatures[5].params.length : -1;\n\n      // simple and generic, but also slow\n      var iStart = allOk ? 6 : 0;\n      var iEnd = signatures.length;\n      var generic = function generic() {\n        'use strict';\n\n        for (var i = iStart; i < iEnd; i++) {\n          if (tests[i](arguments)) {\n            return fns[i].apply(this, arguments);\n          }\n        }\n\n        return typed.onMismatch(name, arguments, signatures);\n      }\n\n      // create the typed function\n      // fast, specialized version. Falls back to the slower, generic one if needed\n      var fn = function fn(arg0, arg1) {\n        'use strict';\n\n        if (arguments.length === len0 && test00(arg0) && test01(arg1)) { return fn0.apply(fn, arguments); }\n        if (arguments.length === len1 && test10(arg0) && test11(arg1)) { return fn1.apply(fn, arguments); }\n        if (arguments.length === len2 && test20(arg0) && test21(arg1)) { return fn2.apply(fn, arguments); }\n        if (arguments.length === len3 && test30(arg0) && test31(arg1)) { return fn3.apply(fn, arguments); }\n        if (arguments.length === len4 && test40(arg0) && test41(arg1)) { return fn4.apply(fn, arguments); }\n        if (arguments.length === len5 && test50(arg0) && test51(arg1)) { return fn5.apply(fn, arguments); }\n\n        return generic.apply(fn, arguments);\n      }\n\n      // attach name the typed function\n      try {\n        Object.defineProperty(fn, 'name', {value: name});\n      }\n      catch (err) {\n        // old browsers do not support Object.defineProperty and some don't support setting the name property\n        // the function name is not essential for the functioning, it's mostly useful for debugging,\n        // so it's fine to have unnamed functions.\n      }\n\n      // attach signatures to the function\n      fn.signatures = createSignaturesMap(signatures);\n\n      return fn;\n    }\n\n    /**\n     * Action to take on mismatch\n     * @param {string} name      Name of function that was attempted to be called\n     * @param {Array} args       Actual arguments to the call\n     * @param {Array} signatures Known signatures of the named typed-function\n     */\n    function _onMismatch(name, args, signatures) {\n      throw createError(name, args, signatures);\n    }\n\n    /**\n     * Test whether a type should be NOT be ignored\n     * @param {string} typeName\n     * @return {boolean}\n     */\n    function notIgnore(typeName) {\n      return typed.ignore.indexOf(typeName) === -1;\n    }\n\n    /**\n     * trim a string\n     * @param {string} str\n     * @return {string}\n     */\n    function trim(str) {\n      return str.trim();\n    }\n\n    /**\n     * Test whether a string is not empty\n     * @param {string} str\n     * @return {boolean}\n     */\n    function notEmpty(str) {\n      return !!str;\n    }\n\n    /**\n     * test whether a value is not strict equal to null\n     * @param {*} value\n     * @return {boolean}\n     */\n    function notNull(value) {\n      return value !== null;\n    }\n\n    /**\n     * Test whether a parameter has no types defined\n     * @param {Param} param\n     * @return {boolean}\n     */\n    function isInvalidParam (param) {\n      return param.types.length === 0;\n    }\n\n    /**\n     * Return all but the last items of an array\n     * @param {Array} arr\n     * @return {Array}\n     */\n    function initial(arr) {\n      return arr.slice(0, arr.length - 1);\n    }\n\n    /**\n     * return the last item of an array\n     * @param {Array} arr\n     * @return {*}\n     */\n    function last(arr) {\n      return arr[arr.length - 1];\n    }\n\n    /**\n     * Slice an array or function Arguments\n     * @param {Array | Arguments | IArguments} arr\n     * @param {number} start\n     * @param {number} [end]\n     * @return {Array}\n     */\n    function slice(arr, start, end) {\n      return Array.prototype.slice.call(arr, start, end);\n    }\n\n    /**\n     * Test whether an array contains some item\n     * @param {Array} array\n     * @param {*} item\n     * @return {boolean} Returns true if array contains item, false if not.\n     */\n    function contains(array, item) {\n      return array.indexOf(item) !== -1;\n    }\n\n    /**\n     * Test whether two arrays have overlapping items\n     * @param {Array} array1\n     * @param {Array} array2\n     * @return {boolean} Returns true when at least one item exists in both arrays\n     */\n    function hasOverlap(array1, array2) {\n      for (var i = 0; i < array1.length; i++) {\n        if (contains(array2, array1[i])) {\n          return true;\n        }\n      }\n\n      return false;\n    }\n\n    /**\n     * Return the first item from an array for which test(arr[i]) returns true\n     * @param {Array} arr\n     * @param {function} test\n     * @return {* | undefined} Returns the first matching item\n     *                         or undefined when there is no match\n     */\n    function findInArray(arr, test) {\n      for (var i = 0; i < arr.length; i++) {\n        if (test(arr[i])) {\n          return arr[i];\n        }\n      }\n      return undefined;\n    }\n\n    /**\n     * Filter unique items of an array with strings\n     * @param {string[]} arr\n     * @return {string[]}\n     */\n    function uniq(arr) {\n      var entries = {}\n      for (var i = 0; i < arr.length; i++) {\n        entries[arr[i]] = true;\n      }\n      return Object.keys(entries);\n    }\n\n    /**\n     * Flat map the result invoking a callback for every item in an array.\n     * https://gist.github.com/samgiles/762ee337dff48623e729\n     * @param {Array} arr\n     * @param {function} callback\n     * @return {Array}\n     */\n    function flatMap(arr, callback) {\n      return Array.prototype.concat.apply([], arr.map(callback));\n    }\n\n    /**\n     * Retrieve the function name from a set of typed functions,\n     * and check whether the name of all functions match (if given)\n     * @param {function[]} fns\n     */\n    function getName (fns) {\n      var name = '';\n\n      for (var i = 0; i < fns.length; i++) {\n        var fn = fns[i];\n\n        // check whether the names are the same when defined\n        if ((typeof fn.signatures === 'object' || typeof fn.signature === 'string') && fn.name !== '') {\n          if (name === '') {\n            name = fn.name;\n          }\n          else if (name !== fn.name) {\n            var err = new Error('Function names do not match (expected: ' + name + ', actual: ' + fn.name + ')');\n            err.data = {\n              actual: fn.name,\n              expected: name\n            };\n            throw err;\n          }\n        }\n      }\n\n      return name;\n    }\n\n    // extract and merge all signatures of a list with typed functions\n    function extractSignatures(fns) {\n      var err;\n      var signaturesMap = {};\n\n      function validateUnique(_signature, _fn) {\n        if (signaturesMap.hasOwnProperty(_signature) && _fn !== signaturesMap[_signature]) {\n          err = new Error('Signature \"' + _signature + '\" is defined twice');\n          err.data = {signature: _signature};\n          throw err;\n          // else: both signatures point to the same function, that's fine\n        }\n      }\n\n      for (var i = 0; i < fns.length; i++) {\n        var fn = fns[i];\n\n        // test whether this is a typed-function\n        if (typeof fn.signatures === 'object') {\n          // merge the signatures\n          for (var signature in fn.signatures) {\n            if (fn.signatures.hasOwnProperty(signature)) {\n              validateUnique(signature, fn.signatures[signature]);\n              signaturesMap[signature] = fn.signatures[signature];\n            }\n          }\n        }\n        else if (typeof fn.signature === 'string') {\n          validateUnique(fn.signature, fn);\n          signaturesMap[fn.signature] = fn;\n        }\n        else {\n          err = new TypeError('Function is no typed-function (index: ' + i + ')');\n          err.data = {index: i};\n          throw err;\n        }\n      }\n\n      return signaturesMap;\n    }\n\n    typed = createTypedFunction('typed', {\n      'string, Object': createTypedFunction,\n      'Object': function (signaturesMap) {\n        // find existing name\n        var fns = [];\n        for (var signature in signaturesMap) {\n          if (signaturesMap.hasOwnProperty(signature)) {\n            fns.push(signaturesMap[signature]);\n          }\n        }\n        var name = getName(fns);\n        return createTypedFunction(name, signaturesMap);\n      },\n      '...Function': function (fns) {\n        return createTypedFunction(getName(fns), extractSignatures(fns));\n      },\n      'string, ...Function': function (name, fns) {\n        return createTypedFunction(name, extractSignatures(fns));\n      }\n    });\n\n    typed.create = create;\n    typed.types = _types;\n    typed.conversions = _conversions;\n    typed.ignore = _ignore;\n    typed.onMismatch = _onMismatch;\n    typed.throwMismatchError = _onMismatch;\n    typed.createError = createError;\n    typed.convert = convert;\n    typed.find = find;\n\n    /**\n     * add a type\n     * @param {{name: string, test: function}} type\n     * @param {boolean} [beforeObjectTest=true]\n     *                          If true, the new test will be inserted before\n     *                          the test with name 'Object' (if any), since\n     *                          tests for Object match Array and classes too.\n     */\n    typed.addType = function (type, beforeObjectTest) {\n      if (!type || typeof type.name !== 'string' || typeof type.test !== 'function') {\n        throw new TypeError('Object with properties {name: string, test: function} expected');\n      }\n\n      if (beforeObjectTest !== false) {\n        for (var i = 0; i < typed.types.length; i++) {\n          if (typed.types[i].name === 'Object') {\n            typed.types.splice(i, 0, type);\n            return\n          }\n        }\n      }\n\n      typed.types.push(type);\n    };\n\n    // add a conversion\n    typed.addConversion = function (conversion) {\n      if (!conversion\n          || typeof conversion.from !== 'string'\n          || typeof conversion.to !== 'string'\n          || typeof conversion.convert !== 'function') {\n        throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n      }\n\n      typed.conversions.push(conversion);\n    };\n\n    return typed;\n  }\n\n  return create();\n}));\n","// A library of seedable RNGs implemented in Javascript.\n//\n// Usage:\n//\n// var seedrandom = require('seedrandom');\n// var random = seedrandom(1); // or any seed.\n// var x = random();       // 0 <= x < 1.  Every bit is random.\n// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.\n\n// alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.\n// Period: ~2^116\n// Reported to pass all BigCrush tests.\nvar alea = require('./lib/alea');\n\n// xor128, a pure xor-shift generator by George Marsaglia.\n// Period: 2^128-1.\n// Reported to fail: MatrixRank and LinearComp.\nvar xor128 = require('./lib/xor128');\n\n// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.\n// Period: 2^192-2^32\n// Reported to fail: CollisionOver, SimpPoker, and LinearComp.\nvar xorwow = require('./lib/xorwow');\n\n// xorshift7, by François Panneton and Pierre L'ecuyer, takes\n// a different approach: it adds robustness by allowing more shifts\n// than Marsaglia's original three.  It is a 7-shift generator\n// with 256 bits, that passes BigCrush with no systmatic failures.\n// Period 2^256-1.\n// No systematic BigCrush failures reported.\nvar xorshift7 = require('./lib/xorshift7');\n\n// xor4096, by Richard Brent, is a 4096-bit xor-shift with a\n// very long period that also adds a Weyl generator. It also passes\n// BigCrush with no systematic failures.  Its long period may\n// be useful if you have many generators and need to avoid\n// collisions.\n// Period: 2^4128-2^32.\n// No systematic BigCrush failures reported.\nvar xor4096 = require('./lib/xor4096');\n\n// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random\n// number generator derived from ChaCha, a modern stream cipher.\n// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n// Period: ~2^127\n// No systematic BigCrush failures reported.\nvar tychei = require('./lib/tychei');\n\n// The original ARC4-based prng included in this library.\n// Period: ~2^1600\nvar sr = require('./seedrandom');\n\nsr.alea = alea;\nsr.xor128 = xor128;\nsr.xorwow = xorwow;\nsr.xorshift7 = xorshift7;\nsr.xor4096 = xor4096;\nsr.tychei = tychei;\n\nmodule.exports = sr;\n","'use strict';\nvar $propertyIsEnumerable = {}.propertyIsEnumerable;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// Nashorn ~ JDK8 bug\nvar NASHORN_BUG = getOwnPropertyDescriptor && !$propertyIsEnumerable.call({ 1: 2 }, 1);\n\n// `Object.prototype.propertyIsEnumerable` method implementation\n// https://tc39.es/ecma262/#sec-object.prototype.propertyisenumerable\nexports.f = NASHORN_BUG ? function propertyIsEnumerable(V) {\n  var descriptor = getOwnPropertyDescriptor(this, V);\n  return !!descriptor && descriptor.enumerable;\n} : $propertyIsEnumerable;\n","var global = require('../internals/global');\nvar call = require('../internals/function-call');\nvar isObject = require('../internals/is-object');\nvar isSymbol = require('../internals/is-symbol');\nvar getMethod = require('../internals/get-method');\nvar ordinaryToPrimitive = require('../internals/ordinary-to-primitive');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TypeError = global.TypeError;\nvar TO_PRIMITIVE = wellKnownSymbol('toPrimitive');\n\n// `ToPrimitive` abstract operation\n// https://tc39.es/ecma262/#sec-toprimitive\nmodule.exports = function (input, pref) {\n  if (!isObject(input) || isSymbol(input)) return input;\n  var exoticToPrim = getMethod(input, TO_PRIMITIVE);\n  var result;\n  if (exoticToPrim) {\n    if (pref === undefined) pref = 'default';\n    result = call(exoticToPrim, input, pref);\n    if (!isObject(result) || isSymbol(result)) return result;\n    throw TypeError(\"Can't convert object to primitive value\");\n  }\n  if (pref === undefined) pref = 'number';\n  return ordinaryToPrimitive(input, pref);\n};\n","/* eslint-disable es/no-symbol -- required for testing */\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\n\nmodule.exports = NATIVE_SYMBOL\n  && !Symbol.sham\n  && typeof Symbol.iterator == 'symbol';\n","var DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar createElement = require('../internals/document-create-element');\n\n// Thanks to IE8 for its funny defineProperty\nmodule.exports = !DESCRIPTORS && !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty(createElement('div'), 'a', {\n    get: function () { return 7; }\n  }).a != 7;\n});\n","var DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\n\n// V8 ~ Chrome 36-\n// https://bugs.chromium.org/p/v8/issues/detail?id=3334\nmodule.exports = DESCRIPTORS && fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty(function () { /* empty */ }, 'prototype', {\n    value: 42,\n    writable: false\n  }).prototype != 42;\n});\n","var hasOwn = require('../internals/has-own-property');\nvar ownKeys = require('../internals/own-keys');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\n\nmodule.exports = function (target, source, exceptions) {\n  var keys = ownKeys(source);\n  var defineProperty = definePropertyModule.f;\n  var getOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    if (!hasOwn(target, key) && !(exceptions && hasOwn(exceptions, key))) {\n      defineProperty(target, key, getOwnPropertyDescriptor(source, key));\n    }\n  }\n};\n","var getBuiltIn = require('../internals/get-built-in');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar anObject = require('../internals/an-object');\n\nvar concat = uncurryThis([].concat);\n\n// all object keys, includes non-enumerable and symbols\nmodule.exports = getBuiltIn('Reflect', 'ownKeys') || function ownKeys(it) {\n  var keys = getOwnPropertyNamesModule.f(anObject(it));\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  return getOwnPropertySymbols ? concat(keys, getOwnPropertySymbols(it)) : keys;\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar hasOwn = require('../internals/has-own-property');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar indexOf = require('../internals/array-includes').indexOf;\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar push = uncurryThis([].push);\n\nmodule.exports = function (object, names) {\n  var O = toIndexedObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) !hasOwn(hiddenKeys, key) && hasOwn(O, key) && push(result, key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (hasOwn(O, key = names[i++])) {\n    ~indexOf(result, key) || push(result, key);\n  }\n  return result;\n};\n","// eslint-disable-next-line es/no-object-getownpropertysymbols -- safe\nexports.f = Object.getOwnPropertySymbols;\n","// iterable DOM collections\n// flag - `iterable` interface - 'entries', 'keys', 'values', 'forEach' methods\nmodule.exports = {\n  CSSRuleList: 0,\n  CSSStyleDeclaration: 0,\n  CSSValueList: 0,\n  ClientRectList: 0,\n  DOMRectList: 0,\n  DOMStringList: 0,\n  DOMTokenList: 1,\n  DataTransferItemList: 0,\n  FileList: 0,\n  HTMLAllCollection: 0,\n  HTMLCollection: 0,\n  HTMLFormElement: 0,\n  HTMLSelectElement: 0,\n  MediaList: 0,\n  MimeTypeArray: 0,\n  NamedNodeMap: 0,\n  NodeList: 1,\n  PaintRequestList: 0,\n  Plugin: 0,\n  PluginArray: 0,\n  SVGLengthList: 0,\n  SVGNumberList: 0,\n  SVGPathSegList: 0,\n  SVGPointList: 0,\n  SVGStringList: 0,\n  SVGTransformList: 0,\n  SourceBufferList: 0,\n  StyleSheetList: 0,\n  TextTrackCueList: 0,\n  TextTrackList: 0,\n  TouchList: 0\n};\n","// in old WebKit versions, `element.classList` is not an instance of global `DOMTokenList`\nvar documentCreateElement = require('../internals/document-create-element');\n\nvar classList = documentCreateElement('span').classList;\nvar DOMTokenListPrototype = classList && classList.constructor && classList.constructor.prototype;\n\nmodule.exports = DOMTokenListPrototype === Object.prototype ? undefined : DOMTokenListPrototype;\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar toObject = require('../internals/to-object');\nvar nativeGetPrototypeOf = require('../internals/object-get-prototype-of');\nvar CORRECT_PROTOTYPE_GETTER = require('../internals/correct-prototype-getter');\n\nvar FAILS_ON_PRIMITIVES = fails(function () { nativeGetPrototypeOf(1); });\n\n// `Object.getPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.getprototypeof\n$({ target: 'Object', stat: true, forced: FAILS_ON_PRIMITIVES, sham: !CORRECT_PROTOTYPE_GETTER }, {\n  getPrototypeOf: function getPrototypeOf(it) {\n    return nativeGetPrototypeOf(toObject(it));\n  }\n});\n\n","var fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  function F() { /* empty */ }\n  F.prototype.constructor = null;\n  // eslint-disable-next-line es/no-object-getprototypeof -- required for testing\n  return Object.getPrototypeOf(new F()) !== F.prototype;\n});\n","var DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isForced = require('../internals/is-forced');\nvar inheritIfRequired = require('../internals/inherit-if-required');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar defineProperty = require('../internals/object-define-property').f;\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar isRegExp = require('../internals/is-regexp');\nvar toString = require('../internals/to-string');\nvar regExpFlags = require('../internals/regexp-flags');\nvar stickyHelpers = require('../internals/regexp-sticky-helpers');\nvar redefine = require('../internals/redefine');\nvar fails = require('../internals/fails');\nvar hasOwn = require('../internals/has-own-property');\nvar enforceInternalState = require('../internals/internal-state').enforce;\nvar setSpecies = require('../internals/set-species');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar UNSUPPORTED_DOT_ALL = require('../internals/regexp-unsupported-dot-all');\nvar UNSUPPORTED_NCG = require('../internals/regexp-unsupported-ncg');\n\nvar MATCH = wellKnownSymbol('match');\nvar NativeRegExp = global.RegExp;\nvar RegExpPrototype = NativeRegExp.prototype;\nvar SyntaxError = global.SyntaxError;\nvar getFlags = uncurryThis(regExpFlags);\nvar exec = uncurryThis(RegExpPrototype.exec);\nvar charAt = uncurryThis(''.charAt);\nvar replace = uncurryThis(''.replace);\nvar stringIndexOf = uncurryThis(''.indexOf);\nvar stringSlice = uncurryThis(''.slice);\n// TODO: Use only propper RegExpIdentifierName\nvar IS_NCG = /^\\?<[^\\s\\d!#%&*+<=>@^][^\\s!#%&*+<=>@^]*>/;\nvar re1 = /a/g;\nvar re2 = /a/g;\n\n// \"new\" should create a new object, old webkit bug\nvar CORRECT_NEW = new NativeRegExp(re1) !== re1;\n\nvar MISSED_STICKY = stickyHelpers.MISSED_STICKY;\nvar UNSUPPORTED_Y = stickyHelpers.UNSUPPORTED_Y;\n\nvar BASE_FORCED = DESCRIPTORS &&\n  (!CORRECT_NEW || MISSED_STICKY || UNSUPPORTED_DOT_ALL || UNSUPPORTED_NCG || fails(function () {\n    re2[MATCH] = false;\n    // RegExp constructor can alter flags and IsRegExp works correct with @@match\n    return NativeRegExp(re1) != re1 || NativeRegExp(re2) == re2 || NativeRegExp(re1, 'i') != '/a/i';\n  }));\n\nvar handleDotAll = function (string) {\n  var length = string.length;\n  var index = 0;\n  var result = '';\n  var brackets = false;\n  var chr;\n  for (; index <= length; index++) {\n    chr = charAt(string, index);\n    if (chr === '\\\\') {\n      result += chr + charAt(string, ++index);\n      continue;\n    }\n    if (!brackets && chr === '.') {\n      result += '[\\\\s\\\\S]';\n    } else {\n      if (chr === '[') {\n        brackets = true;\n      } else if (chr === ']') {\n        brackets = false;\n      } result += chr;\n    }\n  } return result;\n};\n\nvar handleNCG = function (string) {\n  var length = string.length;\n  var index = 0;\n  var result = '';\n  var named = [];\n  var names = {};\n  var brackets = false;\n  var ncg = false;\n  var groupid = 0;\n  var groupname = '';\n  var chr;\n  for (; index <= length; index++) {\n    chr = charAt(string, index);\n    if (chr === '\\\\') {\n      chr = chr + charAt(string, ++index);\n    } else if (chr === ']') {\n      brackets = false;\n    } else if (!brackets) switch (true) {\n      case chr === '[':\n        brackets = true;\n        break;\n      case chr === '(':\n        if (exec(IS_NCG, stringSlice(string, index + 1))) {\n          index += 2;\n          ncg = true;\n        }\n        result += chr;\n        groupid++;\n        continue;\n      case chr === '>' && ncg:\n        if (groupname === '' || hasOwn(names, groupname)) {\n          throw new SyntaxError('Invalid capture group name');\n        }\n        names[groupname] = true;\n        named[named.length] = [groupname, groupid];\n        ncg = false;\n        groupname = '';\n        continue;\n    }\n    if (ncg) groupname += chr;\n    else result += chr;\n  } return [result, named];\n};\n\n// `RegExp` constructor\n// https://tc39.es/ecma262/#sec-regexp-constructor\nif (isForced('RegExp', BASE_FORCED)) {\n  var RegExpWrapper = function RegExp(pattern, flags) {\n    var thisIsRegExp = isPrototypeOf(RegExpPrototype, this);\n    var patternIsRegExp = isRegExp(pattern);\n    var flagsAreUndefined = flags === undefined;\n    var groups = [];\n    var rawPattern = pattern;\n    var rawFlags, dotAll, sticky, handled, result, state;\n\n    if (!thisIsRegExp && patternIsRegExp && flagsAreUndefined && pattern.constructor === RegExpWrapper) {\n      return pattern;\n    }\n\n    if (patternIsRegExp || isPrototypeOf(RegExpPrototype, pattern)) {\n      pattern = pattern.source;\n      if (flagsAreUndefined) flags = 'flags' in rawPattern ? rawPattern.flags : getFlags(rawPattern);\n    }\n\n    pattern = pattern === undefined ? '' : toString(pattern);\n    flags = flags === undefined ? '' : toString(flags);\n    rawPattern = pattern;\n\n    if (UNSUPPORTED_DOT_ALL && 'dotAll' in re1) {\n      dotAll = !!flags && stringIndexOf(flags, 's') > -1;\n      if (dotAll) flags = replace(flags, /s/g, '');\n    }\n\n    rawFlags = flags;\n\n    if (MISSED_STICKY && 'sticky' in re1) {\n      sticky = !!flags && stringIndexOf(flags, 'y') > -1;\n      if (sticky && UNSUPPORTED_Y) flags = replace(flags, /y/g, '');\n    }\n\n    if (UNSUPPORTED_NCG) {\n      handled = handleNCG(pattern);\n      pattern = handled[0];\n      groups = handled[1];\n    }\n\n    result = inheritIfRequired(NativeRegExp(pattern, flags), thisIsRegExp ? this : RegExpPrototype, RegExpWrapper);\n\n    if (dotAll || sticky || groups.length) {\n      state = enforceInternalState(result);\n      if (dotAll) {\n        state.dotAll = true;\n        state.raw = RegExpWrapper(handleDotAll(pattern), rawFlags);\n      }\n      if (sticky) state.sticky = true;\n      if (groups.length) state.groups = groups;\n    }\n\n    if (pattern !== rawPattern) try {\n      // fails in old engines, but we have no alternatives for unsupported regex syntax\n      createNonEnumerableProperty(result, 'source', rawPattern === '' ? '(?:)' : rawPattern);\n    } catch (error) { /* empty */ }\n\n    return result;\n  };\n\n  var proxy = function (key) {\n    key in RegExpWrapper || defineProperty(RegExpWrapper, key, {\n      configurable: true,\n      get: function () { return NativeRegExp[key]; },\n      set: function (it) { NativeRegExp[key] = it; }\n    });\n  };\n\n  for (var keys = getOwnPropertyNames(NativeRegExp), index = 0; keys.length > index;) {\n    proxy(keys[index++]);\n  }\n\n  RegExpPrototype.constructor = RegExpWrapper;\n  RegExpWrapper.prototype = RegExpPrototype;\n  redefine(global, 'RegExp', RegExpWrapper);\n}\n\n// https://tc39.es/ecma262/#sec-get-regexp-@@species\nsetSpecies('RegExp');\n","var isObject = require('../internals/is-object');\nvar classof = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar MATCH = wellKnownSymbol('match');\n\n// `IsRegExp` abstract operation\n// https://tc39.es/ecma262/#sec-isregexp\nmodule.exports = function (it) {\n  var isRegExp;\n  return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : classof(it) == 'RegExp');\n};\n","var fails = require('../internals/fails');\nvar global = require('../internals/global');\n\n// babel-minify and Closure Compiler transpiles RegExp('(?<a>b)', 'g') -> /(?<a>b)/g and it causes SyntaxError\nvar $RegExp = global.RegExp;\n\nmodule.exports = fails(function () {\n  var re = $RegExp('(?<a>b)', 'g');\n  return re.exec('b').groups.a !== 'b' ||\n    'b'.replace(re, '$<a>c') !== 'bc';\n});\n","var global = require('../internals/global');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar UNSUPPORTED_DOT_ALL = require('../internals/regexp-unsupported-dot-all');\nvar classof = require('../internals/classof-raw');\nvar defineProperty = require('../internals/object-define-property').f;\nvar getInternalState = require('../internals/internal-state').get;\n\nvar RegExpPrototype = RegExp.prototype;\nvar TypeError = global.TypeError;\n\n// `RegExp.prototype.dotAll` getter\n// https://tc39.es/ecma262/#sec-get-regexp.prototype.dotall\nif (DESCRIPTORS && UNSUPPORTED_DOT_ALL) {\n  defineProperty(RegExpPrototype, 'dotAll', {\n    configurable: true,\n    get: function () {\n      if (this === RegExpPrototype) return undefined;\n      // We can't use InternalStateModule.getterFor because\n      // we don't add metadata for regexps created by a literal.\n      if (classof(this) === 'RegExp') {\n        return !!getInternalState(this).dotAll;\n      }\n      throw TypeError('Incompatible receiver, RegExp required');\n    }\n  });\n}\n","var DESCRIPTORS = require('../internals/descriptors');\nvar V8_PROTOTYPE_DEFINE_BUG = require('../internals/v8-prototype-define-bug');\nvar definePropertyModule = require('../internals/object-define-property');\nvar anObject = require('../internals/an-object');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar objectKeys = require('../internals/object-keys');\n\n// `Object.defineProperties` method\n// https://tc39.es/ecma262/#sec-object.defineproperties\n// eslint-disable-next-line es/no-object-defineproperties -- safe\nexports.f = DESCRIPTORS && !V8_PROTOTYPE_DEFINE_BUG ? Object.defineProperties : function defineProperties(O, Properties) {\n  anObject(O);\n  var props = toIndexedObject(Properties);\n  var keys = objectKeys(Properties);\n  var length = keys.length;\n  var index = 0;\n  var key;\n  while (length > index) definePropertyModule.f(O, key = keys[index++], props[key]);\n  return O;\n};\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('document', 'documentElement');\n","var global = require('../internals/global');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar MISSED_STICKY = require('../internals/regexp-sticky-helpers').MISSED_STICKY;\nvar classof = require('../internals/classof-raw');\nvar defineProperty = require('../internals/object-define-property').f;\nvar getInternalState = require('../internals/internal-state').get;\n\nvar RegExpPrototype = RegExp.prototype;\nvar TypeError = global.TypeError;\n\n// `RegExp.prototype.sticky` getter\n// https://tc39.es/ecma262/#sec-get-regexp.prototype.sticky\nif (DESCRIPTORS && MISSED_STICKY) {\n  defineProperty(RegExpPrototype, 'sticky', {\n    configurable: true,\n    get: function () {\n      if (this === RegExpPrototype) return undefined;\n      // We can't use InternalStateModule.getterFor because\n      // we don't add metadata for regexps created by a literal.\n      if (classof(this) === 'RegExp') {\n        return !!getInternalState(this).sticky;\n      }\n      throw TypeError('Incompatible receiver, RegExp required');\n    }\n  });\n}\n","var anObject = require('../internals/an-object');\nvar aConstructor = require('../internals/a-constructor');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar SPECIES = wellKnownSymbol('species');\n\n// `SpeciesConstructor` abstract operation\n// https://tc39.es/ecma262/#sec-speciesconstructor\nmodule.exports = function (O, defaultConstructor) {\n  var C = anObject(O).constructor;\n  var S;\n  return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? defaultConstructor : aConstructor(S);\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\nvar toString = require('../internals/to-string');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nvar charAt = uncurryThis(''.charAt);\nvar charCodeAt = uncurryThis(''.charCodeAt);\nvar stringSlice = uncurryThis(''.slice);\n\nvar createMethod = function (CONVERT_TO_STRING) {\n  return function ($this, pos) {\n    var S = toString(requireObjectCoercible($this));\n    var position = toIntegerOrInfinity(pos);\n    var size = S.length;\n    var first, second;\n    if (position < 0 || position >= size) return CONVERT_TO_STRING ? '' : undefined;\n    first = charCodeAt(S, position);\n    return first < 0xD800 || first > 0xDBFF || position + 1 === size\n      || (second = charCodeAt(S, position + 1)) < 0xDC00 || second > 0xDFFF\n        ? CONVERT_TO_STRING\n          ? charAt(S, position)\n          : first\n        : CONVERT_TO_STRING\n          ? stringSlice(S, position, position + 2)\n          : (first - 0xD800 << 10) + (second - 0xDC00) + 0x10000;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.codePointAt` method\n  // https://tc39.es/ecma262/#sec-string.prototype.codepointat\n  codeAt: createMethod(false),\n  // `String.prototype.at` method\n  // https://github.com/mathiasbynens/String.prototype.at\n  charAt: createMethod(true)\n};\n","// `Math.sign` method implementation\n// https://tc39.es/ecma262/#sec-math.sign\n// eslint-disable-next-line es/no-math-sign -- safe\nmodule.exports = Math.sign || function sign(x) {\n  // eslint-disable-next-line no-self-compare -- NaN check\n  return (x = +x) == 0 || x != x ? x : x < 0 ? -1 : 1;\n};\n","var $ = require('../internals/export');\n\nvar log = Math.log;\nvar LN2 = Math.LN2;\n\n// `Math.log2` method\n// https://tc39.es/ecma262/#sec-math.log2\n$({ target: 'Math', stat: true }, {\n  log2: function log2(x) {\n    return log(x) / LN2;\n  }\n});\n","var log = Math.log;\n\n// `Math.log1p` method implementation\n// https://tc39.es/ecma262/#sec-math.log1p\n// eslint-disable-next-line es/no-math-log1p -- safe\nmodule.exports = Math.log1p || function log1p(x) {\n  return (x = +x) > -1e-8 && x < 1e-8 ? x - x * x / 2 : log(1 + x);\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\n\n// `thisNumberValue` abstract operation\n// https://tc39.es/ecma262/#sec-thisnumbervalue\nmodule.exports = uncurryThis(1.0.valueOf);\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar toString = require('../internals/to-string');\nvar whitespaces = require('../internals/whitespaces');\n\nvar replace = uncurryThis(''.replace);\nvar whitespace = '[' + whitespaces + ']';\nvar ltrim = RegExp('^' + whitespace + whitespace + '*');\nvar rtrim = RegExp(whitespace + whitespace + '*$');\n\n// `String.prototype.{ trim, trimStart, trimEnd, trimLeft, trimRight }` methods implementation\nvar createMethod = function (TYPE) {\n  return function ($this) {\n    var string = toString(requireObjectCoercible($this));\n    if (TYPE & 1) string = replace(string, ltrim, '');\n    if (TYPE & 2) string = replace(string, rtrim, '');\n    return string;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.{ trimLeft, trimStart }` methods\n  // https://tc39.es/ecma262/#sec-string.prototype.trimstart\n  start: createMethod(1),\n  // `String.prototype.{ trimRight, trimEnd }` methods\n  // https://tc39.es/ecma262/#sec-string.prototype.trimend\n  end: createMethod(2),\n  // `String.prototype.trim` method\n  // https://tc39.es/ecma262/#sec-string.prototype.trim\n  trim: createMethod(3)\n};\n","// a string of all valid unicode whitespaces\nmodule.exports = '\\u0009\\u000A\\u000B\\u000C\\u000D\\u0020\\u00A0\\u1680\\u2000\\u2001\\u2002' +\n  '\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028\\u2029\\uFEFF';\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\nvar thisNumberValue = require('../internals/this-number-value');\nvar $repeat = require('../internals/string-repeat');\nvar fails = require('../internals/fails');\n\nvar RangeError = global.RangeError;\nvar String = global.String;\nvar floor = Math.floor;\nvar repeat = uncurryThis($repeat);\nvar stringSlice = uncurryThis(''.slice);\nvar un$ToFixed = uncurryThis(1.0.toFixed);\n\nvar pow = function (x, n, acc) {\n  return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);\n};\n\nvar log = function (x) {\n  var n = 0;\n  var x2 = x;\n  while (x2 >= 4096) {\n    n += 12;\n    x2 /= 4096;\n  }\n  while (x2 >= 2) {\n    n += 1;\n    x2 /= 2;\n  } return n;\n};\n\nvar multiply = function (data, n, c) {\n  var index = -1;\n  var c2 = c;\n  while (++index < 6) {\n    c2 += n * data[index];\n    data[index] = c2 % 1e7;\n    c2 = floor(c2 / 1e7);\n  }\n};\n\nvar divide = function (data, n) {\n  var index = 6;\n  var c = 0;\n  while (--index >= 0) {\n    c += data[index];\n    data[index] = floor(c / n);\n    c = (c % n) * 1e7;\n  }\n};\n\nvar dataToString = function (data) {\n  var index = 6;\n  var s = '';\n  while (--index >= 0) {\n    if (s !== '' || index === 0 || data[index] !== 0) {\n      var t = String(data[index]);\n      s = s === '' ? t : s + repeat('0', 7 - t.length) + t;\n    }\n  } return s;\n};\n\nvar FORCED = fails(function () {\n  return un$ToFixed(0.00008, 3) !== '0.000' ||\n    un$ToFixed(0.9, 0) !== '1' ||\n    un$ToFixed(1.255, 2) !== '1.25' ||\n    un$ToFixed(1000000000000000128.0, 0) !== '1000000000000000128';\n}) || !fails(function () {\n  // V8 ~ Android 4.3-\n  un$ToFixed({});\n});\n\n// `Number.prototype.toFixed` method\n// https://tc39.es/ecma262/#sec-number.prototype.tofixed\n$({ target: 'Number', proto: true, forced: FORCED }, {\n  toFixed: function toFixed(fractionDigits) {\n    var number = thisNumberValue(this);\n    var fractDigits = toIntegerOrInfinity(fractionDigits);\n    var data = [0, 0, 0, 0, 0, 0];\n    var sign = '';\n    var result = '0';\n    var e, z, j, k;\n\n    // TODO: ES2018 increased the maximum number of fraction digits to 100, need to improve the implementation\n    if (fractDigits < 0 || fractDigits > 20) throw RangeError('Incorrect fraction digits');\n    // eslint-disable-next-line no-self-compare -- NaN check\n    if (number != number) return 'NaN';\n    if (number <= -1e21 || number >= 1e21) return String(number);\n    if (number < 0) {\n      sign = '-';\n      number = -number;\n    }\n    if (number > 1e-21) {\n      e = log(number * pow(2, 69, 1)) - 69;\n      z = e < 0 ? number * pow(2, -e, 1) : number / pow(2, e, 1);\n      z *= 0x10000000000000;\n      e = 52 - e;\n      if (e > 0) {\n        multiply(data, 0, z);\n        j = fractDigits;\n        while (j >= 7) {\n          multiply(data, 1e7, 0);\n          j -= 7;\n        }\n        multiply(data, pow(10, j, 1), 0);\n        j = e - 1;\n        while (j >= 23) {\n          divide(data, 1 << 23);\n          j -= 23;\n        }\n        divide(data, 1 << j);\n        multiply(data, 1, 1);\n        divide(data, 2);\n        result = dataToString(data);\n      } else {\n        multiply(data, 0, z);\n        multiply(data, 1 << -e, 0);\n        result = dataToString(data) + repeat('0', fractDigits);\n      }\n    }\n    if (fractDigits > 0) {\n      k = result.length;\n      result = sign + (k <= fractDigits\n        ? '0.' + repeat('0', fractDigits - k) + result\n        : stringSlice(result, 0, k - fractDigits) + '.' + stringSlice(result, k - fractDigits));\n    } else {\n      result = sign + result;\n    } return result;\n  }\n});\n","'use strict';\nvar global = require('../internals/global');\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\nvar toString = require('../internals/to-string');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nvar RangeError = global.RangeError;\n\n// `String.prototype.repeat` method implementation\n// https://tc39.es/ecma262/#sec-string.prototype.repeat\nmodule.exports = function repeat(count) {\n  var str = toString(requireObjectCoercible(this));\n  var result = '';\n  var n = toIntegerOrInfinity(count);\n  if (n < 0 || n == Infinity) throw RangeError('Wrong number of repetitions');\n  for (;n > 0; (n >>>= 1) && (str += str)) if (n & 1) result += str;\n  return result;\n};\n","'use strict';\nvar fails = require('../internals/fails');\nvar isCallable = require('../internals/is-callable');\nvar create = require('../internals/object-create');\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar redefine = require('../internals/redefine');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_PURE = require('../internals/is-pure');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar BUGGY_SAFARI_ITERATORS = false;\n\n// `%IteratorPrototype%` object\n// https://tc39.es/ecma262/#sec-%iteratorprototype%-object\nvar IteratorPrototype, PrototypeOfArrayIteratorPrototype, arrayIterator;\n\n/* eslint-disable es/no-array-prototype-keys -- safe */\nif ([].keys) {\n  arrayIterator = [].keys();\n  // Safari 8 has buggy iterators w/o `next`\n  if (!('next' in arrayIterator)) BUGGY_SAFARI_ITERATORS = true;\n  else {\n    PrototypeOfArrayIteratorPrototype = getPrototypeOf(getPrototypeOf(arrayIterator));\n    if (PrototypeOfArrayIteratorPrototype !== Object.prototype) IteratorPrototype = PrototypeOfArrayIteratorPrototype;\n  }\n}\n\nvar NEW_ITERATOR_PROTOTYPE = IteratorPrototype == undefined || fails(function () {\n  var test = {};\n  // FF44- legacy iterators case\n  return IteratorPrototype[ITERATOR].call(test) !== test;\n});\n\nif (NEW_ITERATOR_PROTOTYPE) IteratorPrototype = {};\nelse if (IS_PURE) IteratorPrototype = create(IteratorPrototype);\n\n// `%IteratorPrototype%[@@iterator]()` method\n// https://tc39.es/ecma262/#sec-%iteratorprototype%-@@iterator\nif (!isCallable(IteratorPrototype[ITERATOR])) {\n  redefine(IteratorPrototype, ITERATOR, function () {\n    return this;\n  });\n}\n\nmodule.exports = {\n  IteratorPrototype: IteratorPrototype,\n  BUGGY_SAFARI_ITERATORS: BUGGY_SAFARI_ITERATORS\n};\n","'use strict';\nvar collection = require('../internals/collection');\nvar collectionStrong = require('../internals/collection-strong');\n\n// `Map` constructor\n// https://tc39.es/ecma262/#sec-map-objects\ncollection('Map', function (init) {\n  return function Map() { return init(this, arguments.length ? arguments[0] : undefined); };\n}, collectionStrong);\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isForced = require('../internals/is-forced');\nvar redefine = require('../internals/redefine');\nvar InternalMetadataModule = require('../internals/internal-metadata');\nvar iterate = require('../internals/iterate');\nvar anInstance = require('../internals/an-instance');\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\nvar fails = require('../internals/fails');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar inheritIfRequired = require('../internals/inherit-if-required');\n\nmodule.exports = function (CONSTRUCTOR_NAME, wrapper, common) {\n  var IS_MAP = CONSTRUCTOR_NAME.indexOf('Map') !== -1;\n  var IS_WEAK = CONSTRUCTOR_NAME.indexOf('Weak') !== -1;\n  var ADDER = IS_MAP ? 'set' : 'add';\n  var NativeConstructor = global[CONSTRUCTOR_NAME];\n  var NativePrototype = NativeConstructor && NativeConstructor.prototype;\n  var Constructor = NativeConstructor;\n  var exported = {};\n\n  var fixMethod = function (KEY) {\n    var uncurriedNativeMethod = uncurryThis(NativePrototype[KEY]);\n    redefine(NativePrototype, KEY,\n      KEY == 'add' ? function add(value) {\n        uncurriedNativeMethod(this, value === 0 ? 0 : value);\n        return this;\n      } : KEY == 'delete' ? function (key) {\n        return IS_WEAK && !isObject(key) ? false : uncurriedNativeMethod(this, key === 0 ? 0 : key);\n      } : KEY == 'get' ? function get(key) {\n        return IS_WEAK && !isObject(key) ? undefined : uncurriedNativeMethod(this, key === 0 ? 0 : key);\n      } : KEY == 'has' ? function has(key) {\n        return IS_WEAK && !isObject(key) ? false : uncurriedNativeMethod(this, key === 0 ? 0 : key);\n      } : function set(key, value) {\n        uncurriedNativeMethod(this, key === 0 ? 0 : key, value);\n        return this;\n      }\n    );\n  };\n\n  var REPLACE = isForced(\n    CONSTRUCTOR_NAME,\n    !isCallable(NativeConstructor) || !(IS_WEAK || NativePrototype.forEach && !fails(function () {\n      new NativeConstructor().entries().next();\n    }))\n  );\n\n  if (REPLACE) {\n    // create collection constructor\n    Constructor = common.getConstructor(wrapper, CONSTRUCTOR_NAME, IS_MAP, ADDER);\n    InternalMetadataModule.enable();\n  } else if (isForced(CONSTRUCTOR_NAME, true)) {\n    var instance = new Constructor();\n    // early implementations not supports chaining\n    var HASNT_CHAINING = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance;\n    // V8 ~ Chromium 40- weak-collections throws on primitives, but should return false\n    var THROWS_ON_PRIMITIVES = fails(function () { instance.has(1); });\n    // most early implementations doesn't supports iterables, most modern - not close it correctly\n    // eslint-disable-next-line no-new -- required for testing\n    var ACCEPT_ITERABLES = checkCorrectnessOfIteration(function (iterable) { new NativeConstructor(iterable); });\n    // for early implementations -0 and +0 not the same\n    var BUGGY_ZERO = !IS_WEAK && fails(function () {\n      // V8 ~ Chromium 42- fails only with 5+ elements\n      var $instance = new NativeConstructor();\n      var index = 5;\n      while (index--) $instance[ADDER](index, index);\n      return !$instance.has(-0);\n    });\n\n    if (!ACCEPT_ITERABLES) {\n      Constructor = wrapper(function (dummy, iterable) {\n        anInstance(dummy, NativePrototype);\n        var that = inheritIfRequired(new NativeConstructor(), dummy, Constructor);\n        if (iterable != undefined) iterate(iterable, that[ADDER], { that: that, AS_ENTRIES: IS_MAP });\n        return that;\n      });\n      Constructor.prototype = NativePrototype;\n      NativePrototype.constructor = Constructor;\n    }\n\n    if (THROWS_ON_PRIMITIVES || BUGGY_ZERO) {\n      fixMethod('delete');\n      fixMethod('has');\n      IS_MAP && fixMethod('get');\n    }\n\n    if (BUGGY_ZERO || HASNT_CHAINING) fixMethod(ADDER);\n\n    // weak collections should not contains .clear method\n    if (IS_WEAK && NativePrototype.clear) delete NativePrototype.clear;\n  }\n\n  exported[CONSTRUCTOR_NAME] = Constructor;\n  $({ global: true, forced: Constructor != NativeConstructor }, exported);\n\n  setToStringTag(Constructor, CONSTRUCTOR_NAME);\n\n  if (!IS_WEAK) common.setStrong(Constructor, CONSTRUCTOR_NAME, IS_MAP);\n\n  return Constructor;\n};\n","var $ = require('../internals/export');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar isObject = require('../internals/is-object');\nvar hasOwn = require('../internals/has-own-property');\nvar defineProperty = require('../internals/object-define-property').f;\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertyNamesExternalModule = require('../internals/object-get-own-property-names-external');\nvar isExtensible = require('../internals/object-is-extensible');\nvar uid = require('../internals/uid');\nvar FREEZING = require('../internals/freezing');\n\nvar REQUIRED = false;\nvar METADATA = uid('meta');\nvar id = 0;\n\nvar setMetadata = function (it) {\n  defineProperty(it, METADATA, { value: {\n    objectID: 'O' + id++, // object ID\n    weakData: {}          // weak collections IDs\n  } });\n};\n\nvar fastKey = function (it, create) {\n  // return a primitive with prefix\n  if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n  if (!hasOwn(it, METADATA)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return 'F';\n    // not necessary to add metadata\n    if (!create) return 'E';\n    // add missing metadata\n    setMetadata(it);\n  // return object ID\n  } return it[METADATA].objectID;\n};\n\nvar getWeakData = function (it, create) {\n  if (!hasOwn(it, METADATA)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return true;\n    // not necessary to add metadata\n    if (!create) return false;\n    // add missing metadata\n    setMetadata(it);\n  // return the store of weak collections IDs\n  } return it[METADATA].weakData;\n};\n\n// add metadata on freeze-family methods calling\nvar onFreeze = function (it) {\n  if (FREEZING && REQUIRED && isExtensible(it) && !hasOwn(it, METADATA)) setMetadata(it);\n  return it;\n};\n\nvar enable = function () {\n  meta.enable = function () { /* empty */ };\n  REQUIRED = true;\n  var getOwnPropertyNames = getOwnPropertyNamesModule.f;\n  var splice = uncurryThis([].splice);\n  var test = {};\n  test[METADATA] = 1;\n\n  // prevent exposing of metadata key\n  if (getOwnPropertyNames(test).length) {\n    getOwnPropertyNamesModule.f = function (it) {\n      var result = getOwnPropertyNames(it);\n      for (var i = 0, length = result.length; i < length; i++) {\n        if (result[i] === METADATA) {\n          splice(result, i, 1);\n          break;\n        }\n      } return result;\n    };\n\n    $({ target: 'Object', stat: true, forced: true }, {\n      getOwnPropertyNames: getOwnPropertyNamesExternalModule.f\n    });\n  }\n};\n\nvar meta = module.exports = {\n  enable: enable,\n  fastKey: fastKey,\n  getWeakData: getWeakData,\n  onFreeze: onFreeze\n};\n\nhiddenKeys[METADATA] = true;\n","/* eslint-disable es/no-object-getownpropertynames -- safe */\nvar classof = require('../internals/classof-raw');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar $getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar arraySlice = require('../internals/array-slice-simple');\n\nvar windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames\n  ? Object.getOwnPropertyNames(window) : [];\n\nvar getWindowNames = function (it) {\n  try {\n    return $getOwnPropertyNames(it);\n  } catch (error) {\n    return arraySlice(windowNames);\n  }\n};\n\n// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window\nmodule.exports.f = function getOwnPropertyNames(it) {\n  return windowNames && classof(it) == 'Window'\n    ? getWindowNames(it)\n    : $getOwnPropertyNames(toIndexedObject(it));\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\nvar Iterators = require('../internals/iterators');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar ArrayPrototype = Array.prototype;\n\n// check on default Array iterator\nmodule.exports = function (it) {\n  return it !== undefined && (Iterators.Array === it || ArrayPrototype[ITERATOR] === it);\n};\n","var global = require('../internals/global');\nvar call = require('../internals/function-call');\nvar aCallable = require('../internals/a-callable');\nvar anObject = require('../internals/an-object');\nvar tryToString = require('../internals/try-to-string');\nvar getIteratorMethod = require('../internals/get-iterator-method');\n\nvar TypeError = global.TypeError;\n\nmodule.exports = function (argument, usingIterator) {\n  var iteratorMethod = arguments.length < 2 ? getIteratorMethod(argument) : usingIterator;\n  if (aCallable(iteratorMethod)) return anObject(call(iteratorMethod, argument));\n  throw TypeError(tryToString(argument) + ' is not iterable');\n};\n","var call = require('../internals/function-call');\nvar anObject = require('../internals/an-object');\nvar getMethod = require('../internals/get-method');\n\nmodule.exports = function (iterator, kind, value) {\n  var innerResult, innerError;\n  anObject(iterator);\n  try {\n    innerResult = getMethod(iterator, 'return');\n    if (!innerResult) {\n      if (kind === 'throw') throw value;\n      return value;\n    }\n    innerResult = call(innerResult, iterator);\n  } catch (error) {\n    innerError = true;\n    innerResult = error;\n  }\n  if (kind === 'throw') throw value;\n  if (innerError) throw innerResult;\n  anObject(innerResult);\n  return value;\n};\n","'use strict';\nvar defineProperty = require('../internals/object-define-property').f;\nvar create = require('../internals/object-create');\nvar redefineAll = require('../internals/redefine-all');\nvar bind = require('../internals/function-bind-context');\nvar anInstance = require('../internals/an-instance');\nvar iterate = require('../internals/iterate');\nvar defineIterator = require('../internals/define-iterator');\nvar setSpecies = require('../internals/set-species');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar fastKey = require('../internals/internal-metadata').fastKey;\nvar InternalStateModule = require('../internals/internal-state');\n\nvar setInternalState = InternalStateModule.set;\nvar internalStateGetterFor = InternalStateModule.getterFor;\n\nmodule.exports = {\n  getConstructor: function (wrapper, CONSTRUCTOR_NAME, IS_MAP, ADDER) {\n    var Constructor = wrapper(function (that, iterable) {\n      anInstance(that, Prototype);\n      setInternalState(that, {\n        type: CONSTRUCTOR_NAME,\n        index: create(null),\n        first: undefined,\n        last: undefined,\n        size: 0\n      });\n      if (!DESCRIPTORS) that.size = 0;\n      if (iterable != undefined) iterate(iterable, that[ADDER], { that: that, AS_ENTRIES: IS_MAP });\n    });\n\n    var Prototype = Constructor.prototype;\n\n    var getInternalState = internalStateGetterFor(CONSTRUCTOR_NAME);\n\n    var define = function (that, key, value) {\n      var state = getInternalState(that);\n      var entry = getEntry(that, key);\n      var previous, index;\n      // change existing entry\n      if (entry) {\n        entry.value = value;\n      // create new entry\n      } else {\n        state.last = entry = {\n          index: index = fastKey(key, true),\n          key: key,\n          value: value,\n          previous: previous = state.last,\n          next: undefined,\n          removed: false\n        };\n        if (!state.first) state.first = entry;\n        if (previous) previous.next = entry;\n        if (DESCRIPTORS) state.size++;\n        else that.size++;\n        // add to index\n        if (index !== 'F') state.index[index] = entry;\n      } return that;\n    };\n\n    var getEntry = function (that, key) {\n      var state = getInternalState(that);\n      // fast case\n      var index = fastKey(key);\n      var entry;\n      if (index !== 'F') return state.index[index];\n      // frozen object case\n      for (entry = state.first; entry; entry = entry.next) {\n        if (entry.key == key) return entry;\n      }\n    };\n\n    redefineAll(Prototype, {\n      // `{ Map, Set }.prototype.clear()` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.clear\n      // https://tc39.es/ecma262/#sec-set.prototype.clear\n      clear: function clear() {\n        var that = this;\n        var state = getInternalState(that);\n        var data = state.index;\n        var entry = state.first;\n        while (entry) {\n          entry.removed = true;\n          if (entry.previous) entry.previous = entry.previous.next = undefined;\n          delete data[entry.index];\n          entry = entry.next;\n        }\n        state.first = state.last = undefined;\n        if (DESCRIPTORS) state.size = 0;\n        else that.size = 0;\n      },\n      // `{ Map, Set }.prototype.delete(key)` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.delete\n      // https://tc39.es/ecma262/#sec-set.prototype.delete\n      'delete': function (key) {\n        var that = this;\n        var state = getInternalState(that);\n        var entry = getEntry(that, key);\n        if (entry) {\n          var next = entry.next;\n          var prev = entry.previous;\n          delete state.index[entry.index];\n          entry.removed = true;\n          if (prev) prev.next = next;\n          if (next) next.previous = prev;\n          if (state.first == entry) state.first = next;\n          if (state.last == entry) state.last = prev;\n          if (DESCRIPTORS) state.size--;\n          else that.size--;\n        } return !!entry;\n      },\n      // `{ Map, Set }.prototype.forEach(callbackfn, thisArg = undefined)` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.foreach\n      // https://tc39.es/ecma262/#sec-set.prototype.foreach\n      forEach: function forEach(callbackfn /* , that = undefined */) {\n        var state = getInternalState(this);\n        var boundFunction = bind(callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n        var entry;\n        while (entry = entry ? entry.next : state.first) {\n          boundFunction(entry.value, entry.key, this);\n          // revert to the last existing entry\n          while (entry && entry.removed) entry = entry.previous;\n        }\n      },\n      // `{ Map, Set}.prototype.has(key)` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.has\n      // https://tc39.es/ecma262/#sec-set.prototype.has\n      has: function has(key) {\n        return !!getEntry(this, key);\n      }\n    });\n\n    redefineAll(Prototype, IS_MAP ? {\n      // `Map.prototype.get(key)` method\n      // https://tc39.es/ecma262/#sec-map.prototype.get\n      get: function get(key) {\n        var entry = getEntry(this, key);\n        return entry && entry.value;\n      },\n      // `Map.prototype.set(key, value)` method\n      // https://tc39.es/ecma262/#sec-map.prototype.set\n      set: function set(key, value) {\n        return define(this, key === 0 ? 0 : key, value);\n      }\n    } : {\n      // `Set.prototype.add(value)` method\n      // https://tc39.es/ecma262/#sec-set.prototype.add\n      add: function add(value) {\n        return define(this, value = value === 0 ? 0 : value, value);\n      }\n    });\n    if (DESCRIPTORS) defineProperty(Prototype, 'size', {\n      get: function () {\n        return getInternalState(this).size;\n      }\n    });\n    return Constructor;\n  },\n  setStrong: function (Constructor, CONSTRUCTOR_NAME, IS_MAP) {\n    var ITERATOR_NAME = CONSTRUCTOR_NAME + ' Iterator';\n    var getInternalCollectionState = internalStateGetterFor(CONSTRUCTOR_NAME);\n    var getInternalIteratorState = internalStateGetterFor(ITERATOR_NAME);\n    // `{ Map, Set }.prototype.{ keys, values, entries, @@iterator }()` methods\n    // https://tc39.es/ecma262/#sec-map.prototype.entries\n    // https://tc39.es/ecma262/#sec-map.prototype.keys\n    // https://tc39.es/ecma262/#sec-map.prototype.values\n    // https://tc39.es/ecma262/#sec-map.prototype-@@iterator\n    // https://tc39.es/ecma262/#sec-set.prototype.entries\n    // https://tc39.es/ecma262/#sec-set.prototype.keys\n    // https://tc39.es/ecma262/#sec-set.prototype.values\n    // https://tc39.es/ecma262/#sec-set.prototype-@@iterator\n    defineIterator(Constructor, CONSTRUCTOR_NAME, function (iterated, kind) {\n      setInternalState(this, {\n        type: ITERATOR_NAME,\n        target: iterated,\n        state: getInternalCollectionState(iterated),\n        kind: kind,\n        last: undefined\n      });\n    }, function () {\n      var state = getInternalIteratorState(this);\n      var kind = state.kind;\n      var entry = state.last;\n      // revert to the last existing entry\n      while (entry && entry.removed) entry = entry.previous;\n      // get next entry\n      if (!state.target || !(state.last = entry = entry ? entry.next : state.state.first)) {\n        // or finish the iteration\n        state.target = undefined;\n        return { value: undefined, done: true };\n      }\n      // return step by kind\n      if (kind == 'keys') return { value: entry.key, done: false };\n      if (kind == 'values') return { value: entry.value, done: false };\n      return { value: [entry.key, entry.value], done: false };\n    }, IS_MAP ? 'entries' : 'values', !IS_MAP, true);\n\n    // `{ Map, Set }.prototype[@@species]` accessors\n    // https://tc39.es/ecma262/#sec-get-map-@@species\n    // https://tc39.es/ecma262/#sec-get-set-@@species\n    setSpecies(CONSTRUCTOR_NAME);\n  }\n};\n","var redefine = require('../internals/redefine');\n\nmodule.exports = function (target, src, options) {\n  for (var key in src) redefine(target, key, src[key], options);\n  return target;\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nexports.f = wellKnownSymbol;\n","var path = require('../internals/path');\nvar hasOwn = require('../internals/has-own-property');\nvar wrappedWellKnownSymbolModule = require('../internals/well-known-symbol-wrapped');\nvar defineProperty = require('../internals/object-define-property').f;\n\nmodule.exports = function (NAME) {\n  var Symbol = path.Symbol || (path.Symbol = {});\n  if (!hasOwn(Symbol, NAME)) defineProperty(Symbol, NAME, {\n    value: wrappedWellKnownSymbolModule.f(NAME)\n  });\n};\n","var global = require('../internals/global');\nvar apply = require('../internals/function-apply');\nvar bind = require('../internals/function-bind-context');\nvar isCallable = require('../internals/is-callable');\nvar hasOwn = require('../internals/has-own-property');\nvar fails = require('../internals/fails');\nvar html = require('../internals/html');\nvar arraySlice = require('../internals/array-slice');\nvar createElement = require('../internals/document-create-element');\nvar validateArgumentsLength = require('../internals/validate-arguments-length');\nvar IS_IOS = require('../internals/engine-is-ios');\nvar IS_NODE = require('../internals/engine-is-node');\n\nvar set = global.setImmediate;\nvar clear = global.clearImmediate;\nvar process = global.process;\nvar Dispatch = global.Dispatch;\nvar Function = global.Function;\nvar MessageChannel = global.MessageChannel;\nvar String = global.String;\nvar counter = 0;\nvar queue = {};\nvar ONREADYSTATECHANGE = 'onreadystatechange';\nvar location, defer, channel, port;\n\ntry {\n  // Deno throws a ReferenceError on `location` access without `--location` flag\n  location = global.location;\n} catch (error) { /* empty */ }\n\nvar run = function (id) {\n  if (hasOwn(queue, id)) {\n    var fn = queue[id];\n    delete queue[id];\n    fn();\n  }\n};\n\nvar runner = function (id) {\n  return function () {\n    run(id);\n  };\n};\n\nvar listener = function (event) {\n  run(event.data);\n};\n\nvar post = function (id) {\n  // old engines have not location.origin\n  global.postMessage(String(id), location.protocol + '//' + location.host);\n};\n\n// Node.js 0.9+ & IE10+ has setImmediate, otherwise:\nif (!set || !clear) {\n  set = function setImmediate(handler) {\n    validateArgumentsLength(arguments.length, 1);\n    var fn = isCallable(handler) ? handler : Function(handler);\n    var args = arraySlice(arguments, 1);\n    queue[++counter] = function () {\n      apply(fn, undefined, args);\n    };\n    defer(counter);\n    return counter;\n  };\n  clear = function clearImmediate(id) {\n    delete queue[id];\n  };\n  // Node.js 0.8-\n  if (IS_NODE) {\n    defer = function (id) {\n      process.nextTick(runner(id));\n    };\n  // Sphere (JS game engine) Dispatch API\n  } else if (Dispatch && Dispatch.now) {\n    defer = function (id) {\n      Dispatch.now(runner(id));\n    };\n  // Browsers with MessageChannel, includes WebWorkers\n  // except iOS - https://github.com/zloirock/core-js/issues/624\n  } else if (MessageChannel && !IS_IOS) {\n    channel = new MessageChannel();\n    port = channel.port2;\n    channel.port1.onmessage = listener;\n    defer = bind(port.postMessage, port);\n  // Browsers with postMessage, skip WebWorkers\n  // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'\n  } else if (\n    global.addEventListener &&\n    isCallable(global.postMessage) &&\n    !global.importScripts &&\n    location && location.protocol !== 'file:' &&\n    !fails(post)\n  ) {\n    defer = post;\n    global.addEventListener('message', listener, false);\n  // IE8-\n  } else if (ONREADYSTATECHANGE in createElement('script')) {\n    defer = function (id) {\n      html.appendChild(createElement('script'))[ONREADYSTATECHANGE] = function () {\n        html.removeChild(this);\n        run(id);\n      };\n    };\n  // Rest old browsers\n  } else {\n    defer = function (id) {\n      setTimeout(runner(id), 0);\n    };\n  }\n}\n\nmodule.exports = {\n  set: set,\n  clear: clear\n};\n","var userAgent = require('../internals/engine-user-agent');\n\nmodule.exports = /(?:ipad|iphone|ipod).*applewebkit/i.test(userAgent);\n","'use strict';\nvar aCallable = require('../internals/a-callable');\n\nvar PromiseCapability = function (C) {\n  var resolve, reject;\n  this.promise = new C(function ($$resolve, $$reject) {\n    if (resolve !== undefined || reject !== undefined) throw TypeError('Bad Promise constructor');\n    resolve = $$resolve;\n    reject = $$reject;\n  });\n  this.resolve = aCallable(resolve);\n  this.reject = aCallable(reject);\n};\n\n// `NewPromiseCapability` abstract operation\n// https://tc39.es/ecma262/#sec-newpromisecapability\nmodule.exports.f = function (C) {\n  return new PromiseCapability(C);\n};\n","var $ = require('../internals/export');\n\n// `Number.isNaN` method\n// https://tc39.es/ecma262/#sec-number.isnan\n$({ target: 'Number', stat: true }, {\n  isNaN: function isNaN(number) {\n    // eslint-disable-next-line no-self-compare -- NaN check\n    return number != number;\n  }\n});\n","var arrayLikeToArray = require(\"./arrayLikeToArray.js\");\n\nfunction _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}\n\nmodule.exports = _unsupportedIterableToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) {\n    arr2[i] = arr[i];\n  }\n\n  return arr2;\n}\n\nmodule.exports = _arrayLikeToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","'use strict';\nvar collection = require('../internals/collection');\nvar collectionStrong = require('../internals/collection-strong');\n\n// `Set` constructor\n// https://tc39.es/ecma262/#sec-set-objects\ncollection('Set', function (init) {\n  return function Set() { return init(this, arguments.length ? arguments[0] : undefined); };\n}, collectionStrong);\n","function E () {\n  // Keep this empty so it's easier to inherit from\n  // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n  on: function (name, callback, ctx) {\n    var e = this.e || (this.e = {});\n\n    (e[name] || (e[name] = [])).push({\n      fn: callback,\n      ctx: ctx\n    });\n\n    return this;\n  },\n\n  once: function (name, callback, ctx) {\n    var self = this;\n    function listener () {\n      self.off(name, listener);\n      callback.apply(ctx, arguments);\n    };\n\n    listener._ = callback\n    return this.on(name, listener, ctx);\n  },\n\n  emit: function (name) {\n    var data = [].slice.call(arguments, 1);\n    var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n    var i = 0;\n    var len = evtArr.length;\n\n    for (i; i < len; i++) {\n      evtArr[i].fn.apply(evtArr[i].ctx, data);\n    }\n\n    return this;\n  },\n\n  off: function (name, callback) {\n    var e = this.e || (this.e = {});\n    var evts = e[name];\n    var liveEvents = [];\n\n    if (evts && callback) {\n      for (var i = 0, len = evts.length; i < len; i++) {\n        if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n          liveEvents.push(evts[i]);\n      }\n    }\n\n    // Remove event from queue to prevent memory leak\n    // Suggested by https://github.com/lazd\n    // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n    (liveEvents.length)\n      ? e[name] = liveEvents\n      : delete e[name];\n\n    return this;\n  }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n","function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}\n\nmodule.exports = _classCallCheck, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  Object.defineProperty(Constructor, \"prototype\", {\n    writable: false\n  });\n  return Constructor;\n}\n\nmodule.exports = _createClass, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\n// Map the characters to escape to their escaped values. The list is derived\n// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar defaultEscapes = {\n  \"{\": \"\\\\{\",\n  \"}\": \"\\\\}\",\n  \"\\\\\": \"\\\\textbackslash{}\",\n  \"#\": \"\\\\#\",\n  $: \"\\\\$\",\n  \"%\": \"\\\\%\",\n  \"&\": \"\\\\&\",\n  \"^\": \"\\\\textasciicircum{}\",\n  _: \"\\\\_\",\n  \"~\": \"\\\\textasciitilde{}\"\n};\nvar formatEscapes = {\n  \"\\u2013\": \"\\\\--\",\n  \"\\u2014\": \"\\\\---\",\n  \" \": \"~\",\n  \"\\t\": \"\\\\qquad{}\",\n  \"\\r\\n\": \"\\\\newline{}\",\n  \"\\n\": \"\\\\newline{}\"\n};\n\nvar defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {\n  return _extends({}, defaultEscapes, formatEscapes);\n};\n\n/**\n * Escape a string to be used in LaTeX documents.\n * @param {string} str the string to be escaped.\n * @param {boolean} params.preserveFormatting whether formatting escapes should\n *  be performed (default: false).\n * @param {function} params.escapeMapFn the function to modify the escape maps.\n * @return {string} the escaped string, ready to be used in LaTeX.\n */\nmodule.exports = function (str) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n      _ref$preserveFormatti = _ref.preserveFormatting,\n      preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,\n      _ref$escapeMapFn = _ref.escapeMapFn,\n      escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;\n\n  var runningStr = String(str);\n  var result = \"\";\n\n  var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});\n  var escapeKeys = Object.keys(escapes); // as it is reused later on\n\n  // Algorithm: Go through the string character by character, if it matches\n  // with one of the special characters then we'll replace it with the escaped\n  // version.\n\n  var _loop = function _loop() {\n    var specialCharFound = false;\n    escapeKeys.forEach(function (key, index) {\n      if (specialCharFound) {\n        return;\n      }\n      if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {\n        result += escapes[escapeKeys[index]];\n        runningStr = runningStr.slice(key.length, runningStr.length);\n        specialCharFound = true;\n      }\n    });\n    if (!specialCharFound) {\n      result += runningStr.slice(0, 1);\n      runningStr = runningStr.slice(1, runningStr.length);\n    }\n  };\n\n  while (runningStr) {\n    _loop();\n  }\n  return result;\n};","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","var global = require('../internals/global');\nvar call = require('../internals/function-call');\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\n\nvar TypeError = global.TypeError;\n\n// `OrdinaryToPrimitive` abstract operation\n// https://tc39.es/ecma262/#sec-ordinarytoprimitive\nmodule.exports = function (input, pref) {\n  var fn, val;\n  if (pref === 'string' && isCallable(fn = input.toString) && !isObject(val = call(fn, input))) return val;\n  if (isCallable(fn = input.valueOf) && !isObject(val = call(fn, input))) return val;\n  if (pref !== 'string' && isCallable(fn = input.toString) && !isObject(val = call(fn, input))) return val;\n  throw TypeError(\"Can't convert object to primitive value\");\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\nvar inspectSource = require('../internals/inspect-source');\n\nvar WeakMap = global.WeakMap;\n\nmodule.exports = isCallable(WeakMap) && /native code/.test(inspectSource(WeakMap));\n","var toIndexedObject = require('../internals/to-indexed-object');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\n\n// `Array.prototype.{ indexOf, includes }` methods implementation\nvar createMethod = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIndexedObject($this);\n    var length = lengthOfArrayLike(O);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare -- NaN check\n    if (IS_INCLUDES && el != el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare -- NaN check\n      if (value != value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) {\n      if ((IS_INCLUDES || index in O) && O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.includes` method\n  // https://tc39.es/ecma262/#sec-array.prototype.includes\n  includes: createMethod(true),\n  // `Array.prototype.indexOf` method\n  // https://tc39.es/ecma262/#sec-array.prototype.indexof\n  indexOf: createMethod(false)\n};\n","'use strict';\nvar TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar classof = require('../internals/classof');\n\n// `Object.prototype.toString` method implementation\n// https://tc39.es/ecma262/#sec-object.prototype.tostring\nmodule.exports = TO_STRING_TAG_SUPPORT ? {}.toString : function toString() {\n  return '[object ' + classof(this) + ']';\n};\n","'use strict';\nvar $forEach = require('../internals/array-iteration').forEach;\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\n\nvar STRICT_METHOD = arrayMethodIsStrict('forEach');\n\n// `Array.prototype.forEach` method implementation\n// https://tc39.es/ecma262/#sec-array.prototype.foreach\nmodule.exports = !STRICT_METHOD ? function forEach(callbackfn /* , thisArg */) {\n  return $forEach(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n// eslint-disable-next-line es/no-array-prototype-foreach -- safe\n} : [].forEach;\n","var global = require('../internals/global');\nvar isArray = require('../internals/is-array');\nvar isConstructor = require('../internals/is-constructor');\nvar isObject = require('../internals/is-object');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar SPECIES = wellKnownSymbol('species');\nvar Array = global.Array;\n\n// a part of `ArraySpeciesCreate` abstract operation\n// https://tc39.es/ecma262/#sec-arrayspeciescreate\nmodule.exports = function (originalArray) {\n  var C;\n  if (isArray(originalArray)) {\n    C = originalArray.constructor;\n    // cross-realm fallback\n    if (isConstructor(C) && (C === Array || isArray(C.prototype))) C = undefined;\n    else if (isObject(C)) {\n      C = C[SPECIES];\n      if (C === null) C = undefined;\n    }\n  } return C === undefined ? Array : C;\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\n\nvar String = global.String;\nvar TypeError = global.TypeError;\n\nmodule.exports = function (argument) {\n  if (typeof argument == 'object' || isCallable(argument)) return argument;\n  throw TypeError(\"Can't set \" + String(argument) + ' as a prototype');\n};\n","var global = require('../internals/global');\nvar isConstructor = require('../internals/is-constructor');\nvar tryToString = require('../internals/try-to-string');\n\nvar TypeError = global.TypeError;\n\n// `Assert: IsConstructor(argument) is true`\nmodule.exports = function (argument) {\n  if (isConstructor(argument)) return argument;\n  throw TypeError(tryToString(argument) + ' is not a constructor');\n};\n","var arraySlice = require('../internals/array-slice-simple');\n\nvar floor = Math.floor;\n\nvar mergeSort = function (array, comparefn) {\n  var length = array.length;\n  var middle = floor(length / 2);\n  return length < 8 ? insertionSort(array, comparefn) : merge(\n    array,\n    mergeSort(arraySlice(array, 0, middle), comparefn),\n    mergeSort(arraySlice(array, middle), comparefn),\n    comparefn\n  );\n};\n\nvar insertionSort = function (array, comparefn) {\n  var length = array.length;\n  var i = 1;\n  var element, j;\n\n  while (i < length) {\n    j = i;\n    element = array[i];\n    while (j && comparefn(array[j - 1], element) > 0) {\n      array[j] = array[--j];\n    }\n    if (j !== i++) array[j] = element;\n  } return array;\n};\n\nvar merge = function (array, left, right, comparefn) {\n  var llength = left.length;\n  var rlength = right.length;\n  var lindex = 0;\n  var rindex = 0;\n\n  while (lindex < llength || rindex < rlength) {\n    array[lindex + rindex] = (lindex < llength && rindex < rlength)\n      ? comparefn(left[lindex], right[rindex]) <= 0 ? left[lindex++] : right[rindex++]\n      : lindex < llength ? left[lindex++] : right[rindex++];\n  } return array;\n};\n\nmodule.exports = mergeSort;\n","var userAgent = require('../internals/engine-user-agent');\n\nvar firefox = userAgent.match(/firefox\\/(\\d+)/i);\n\nmodule.exports = !!firefox && +firefox[1];\n","var UA = require('../internals/engine-user-agent');\n\nmodule.exports = /MSIE|Trident/.test(UA);\n","var userAgent = require('../internals/engine-user-agent');\n\nvar webkit = userAgent.match(/AppleWebKit\\/(\\d+)\\./);\n\nmodule.exports = !!webkit && +webkit[1];\n","var $ = require('../internals/export');\nvar sign = require('../internals/math-sign');\n\n// `Math.sign` method\n// https://tc39.es/ecma262/#sec-math.sign\n$({ target: 'Math', stat: true }, {\n  sign: sign\n});\n","var $ = require('../internals/export');\nvar log10 = require('../internals/math-log10');\n\n// `Math.log10` method\n// https://tc39.es/ecma262/#sec-math.log10\n$({ target: 'Math', stat: true }, {\n  log10: log10\n});\n","var log = Math.log;\nvar LOG10E = Math.LOG10E;\n\n// eslint-disable-next-line es/no-math-log10 -- safe\nmodule.exports = Math.log10 || function log10(x) {\n  return log(x) * LOG10E;\n};\n","var $ = require('../internals/export');\nvar log1p = require('../internals/math-log1p');\n\n// `Math.log1p` method\n// https://tc39.es/ecma262/#sec-math.log1p\n$({ target: 'Math', stat: true }, { log1p: log1p });\n","var $ = require('../internals/export');\nvar sign = require('../internals/math-sign');\n\nvar abs = Math.abs;\nvar pow = Math.pow;\n\n// `Math.cbrt` method\n// https://tc39.es/ecma262/#sec-math.cbrt\n$({ target: 'Math', stat: true }, {\n  cbrt: function cbrt(x) {\n    return sign(x = +x) * pow(abs(x), 1 / 3);\n  }\n});\n","var $ = require('../internals/export');\nvar expm1 = require('../internals/math-expm1');\n\n// `Math.expm1` method\n// https://tc39.es/ecma262/#sec-math.expm1\n// eslint-disable-next-line es/no-math-expm1 -- required for testing\n$({ target: 'Math', stat: true, forced: expm1 != Math.expm1 }, { expm1: expm1 });\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar toObject = require('../internals/to-object');\n\nvar floor = Math.floor;\nvar charAt = uncurryThis(''.charAt);\nvar replace = uncurryThis(''.replace);\nvar stringSlice = uncurryThis(''.slice);\nvar SUBSTITUTION_SYMBOLS = /\\$([$&'`]|\\d{1,2}|<[^>]*>)/g;\nvar SUBSTITUTION_SYMBOLS_NO_NAMED = /\\$([$&'`]|\\d{1,2})/g;\n\n// `GetSubstitution` abstract operation\n// https://tc39.es/ecma262/#sec-getsubstitution\nmodule.exports = function (matched, str, position, captures, namedCaptures, replacement) {\n  var tailPos = position + matched.length;\n  var m = captures.length;\n  var symbols = SUBSTITUTION_SYMBOLS_NO_NAMED;\n  if (namedCaptures !== undefined) {\n    namedCaptures = toObject(namedCaptures);\n    symbols = SUBSTITUTION_SYMBOLS;\n  }\n  return replace(replacement, symbols, function (match, ch) {\n    var capture;\n    switch (charAt(ch, 0)) {\n      case '$': return '$';\n      case '&': return matched;\n      case '`': return stringSlice(str, 0, position);\n      case \"'\": return stringSlice(str, tailPos);\n      case '<':\n        capture = namedCaptures[stringSlice(ch, 1, -1)];\n        break;\n      default: // \\d\\d?\n        var n = +ch;\n        if (n === 0) return match;\n        if (n > m) {\n          var f = floor(n / 10);\n          if (f === 0) return match;\n          if (f <= m) return captures[f - 1] === undefined ? charAt(ch, 1) : captures[f - 1] + charAt(ch, 1);\n          return match;\n        }\n        capture = captures[n - 1];\n    }\n    return capture === undefined ? '' : capture;\n  });\n};\n","var $ = require('../internals/export');\n\n// `Number.EPSILON` constant\n// https://tc39.es/ecma262/#sec-number.epsilon\n$({ target: 'Number', stat: true }, {\n  EPSILON: Math.pow(2, -52)\n});\n","var $ = require('../internals/export');\nvar log1p = require('../internals/math-log1p');\n\n// eslint-disable-next-line es/no-math-acosh -- required for testing\nvar $acosh = Math.acosh;\nvar log = Math.log;\nvar sqrt = Math.sqrt;\nvar LN2 = Math.LN2;\n\nvar FORCED = !$acosh\n  // V8 bug: https://code.google.com/p/v8/issues/detail?id=3509\n  || Math.floor($acosh(Number.MAX_VALUE)) != 710\n  // Tor Browser bug: Math.acosh(Infinity) -> NaN\n  || $acosh(Infinity) != Infinity;\n\n// `Math.acosh` method\n// https://tc39.es/ecma262/#sec-math.acosh\n$({ target: 'Math', stat: true, forced: FORCED }, {\n  acosh: function acosh(x) {\n    return (x = +x) < 1 ? NaN : x > 94906265.62425156\n      ? log(x) + LN2\n      : log1p(x - 1 + sqrt(x - 1) * sqrt(x + 1));\n  }\n});\n","var $ = require('../internals/export');\n\n// eslint-disable-next-line es/no-math-asinh -- required for testing\nvar $asinh = Math.asinh;\nvar log = Math.log;\nvar sqrt = Math.sqrt;\n\nfunction asinh(x) {\n  return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : log(x + sqrt(x * x + 1));\n}\n\n// `Math.asinh` method\n// https://tc39.es/ecma262/#sec-math.asinh\n// Tor Browser bug: Math.asinh(0) -> -0\n$({ target: 'Math', stat: true, forced: !($asinh && 1 / $asinh(0) > 0) }, {\n  asinh: asinh\n});\n","var $ = require('../internals/export');\n\n// eslint-disable-next-line es/no-math-atanh -- required for testing\nvar $atanh = Math.atanh;\nvar log = Math.log;\n\n// `Math.atanh` method\n// https://tc39.es/ecma262/#sec-math.atanh\n// Tor Browser bug: Math.atanh(-0) -> 0\n$({ target: 'Math', stat: true, forced: !($atanh && 1 / $atanh(-0) < 0) }, {\n  atanh: function atanh(x) {\n    return (x = +x) == 0 ? x : log((1 + x) / (1 - x)) / 2;\n  }\n});\n","var $ = require('../internals/export');\nvar expm1 = require('../internals/math-expm1');\n\n// eslint-disable-next-line es/no-math-cosh -- required for testing\nvar $cosh = Math.cosh;\nvar abs = Math.abs;\nvar E = Math.E;\n\n// `Math.cosh` method\n// https://tc39.es/ecma262/#sec-math.cosh\n$({ target: 'Math', stat: true, forced: !$cosh || $cosh(710) === Infinity }, {\n  cosh: function cosh(x) {\n    var t = expm1(abs(x) - 1) + 1;\n    return (t + 1 / (t * E * E)) * (E / 2);\n  }\n});\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar expm1 = require('../internals/math-expm1');\n\nvar abs = Math.abs;\nvar exp = Math.exp;\nvar E = Math.E;\n\nvar FORCED = fails(function () {\n  // eslint-disable-next-line es/no-math-sinh -- required for testing\n  return Math.sinh(-2e-17) != -2e-17;\n});\n\n// `Math.sinh` method\n// https://tc39.es/ecma262/#sec-math.sinh\n// V8 near Chromium 38 has a problem with very small numbers\n$({ target: 'Math', stat: true, forced: FORCED }, {\n  sinh: function sinh(x) {\n    return abs(x = +x) < 1 ? (expm1(x) - expm1(-x)) / 2 : (exp(x - 1) - exp(-x - 1)) * (E / 2);\n  }\n});\n","var $ = require('../internals/export');\nvar expm1 = require('../internals/math-expm1');\n\nvar exp = Math.exp;\n\n// `Math.tanh` method\n// https://tc39.es/ecma262/#sec-math.tanh\n$({ target: 'Math', stat: true }, {\n  tanh: function tanh(x) {\n    var a = expm1(x = +x);\n    var b = expm1(-x);\n    return a == Infinity ? 1 : b == Infinity ? -1 : (a - b) / (exp(x) + exp(-x));\n  }\n});\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar toString = require('../internals/to-string');\n\nvar quot = /\"/g;\nvar replace = uncurryThis(''.replace);\n\n// `CreateHTML` abstract operation\n// https://tc39.es/ecma262/#sec-createhtml\nmodule.exports = function (string, tag, attribute, value) {\n  var S = toString(requireObjectCoercible(string));\n  var p1 = '<' + tag;\n  if (attribute !== '') p1 += ' ' + attribute + '=\"' + replace(toString(value), quot, '&quot;') + '\"';\n  return p1 + '>' + S + '</' + tag + '>';\n};\n","var fails = require('../internals/fails');\n\n// check the existence of a method, lowercase\n// of a tag and escaping quotes in arguments\nmodule.exports = function (METHOD_NAME) {\n  return fails(function () {\n    var test = ''[METHOD_NAME]('\"');\n    return test !== test.toLowerCase() || test.split('\"').length > 3;\n  });\n};\n","'use strict';\nvar IteratorPrototype = require('../internals/iterators-core').IteratorPrototype;\nvar create = require('../internals/object-create');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar Iterators = require('../internals/iterators');\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (IteratorConstructor, NAME, next, ENUMERABLE_NEXT) {\n  var TO_STRING_TAG = NAME + ' Iterator';\n  IteratorConstructor.prototype = create(IteratorPrototype, { next: createPropertyDescriptor(+!ENUMERABLE_NEXT, next) });\n  setToStringTag(IteratorConstructor, TO_STRING_TAG, false, true);\n  Iterators[TO_STRING_TAG] = returnThis;\n  return IteratorConstructor;\n};\n","var fails = require('../internals/fails');\nvar isObject = require('../internals/is-object');\nvar classof = require('../internals/classof-raw');\nvar ARRAY_BUFFER_NON_EXTENSIBLE = require('../internals/array-buffer-non-extensible');\n\n// eslint-disable-next-line es/no-object-isextensible -- safe\nvar $isExtensible = Object.isExtensible;\nvar FAILS_ON_PRIMITIVES = fails(function () { $isExtensible(1); });\n\n// `Object.isExtensible` method\n// https://tc39.es/ecma262/#sec-object.isextensible\nmodule.exports = (FAILS_ON_PRIMITIVES || ARRAY_BUFFER_NON_EXTENSIBLE) ? function isExtensible(it) {\n  if (!isObject(it)) return false;\n  if (ARRAY_BUFFER_NON_EXTENSIBLE && classof(it) == 'ArrayBuffer') return false;\n  return $isExtensible ? $isExtensible(it) : true;\n} : $isExtensible;\n","// FF26- bug: ArrayBuffers are non-extensible, but Object.isExtensible does not report it\nvar fails = require('../internals/fails');\n\nmodule.exports = fails(function () {\n  if (typeof ArrayBuffer == 'function') {\n    var buffer = new ArrayBuffer(8);\n    // eslint-disable-next-line es/no-object-isextensible, es/no-object-defineproperty -- safe\n    if (Object.isExtensible(buffer)) Object.defineProperty(buffer, 'a', { value: 8 });\n  }\n});\n","var fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  // eslint-disable-next-line es/no-object-isextensible, es/no-object-preventextensions -- required for testing\n  return Object.isExtensible(Object.preventExtensions({}));\n});\n","'use strict';\nvar global = require('../internals/global');\nvar bind = require('../internals/function-bind-context');\nvar call = require('../internals/function-call');\nvar toObject = require('../internals/to-object');\nvar callWithSafeIterationClosing = require('../internals/call-with-safe-iteration-closing');\nvar isArrayIteratorMethod = require('../internals/is-array-iterator-method');\nvar isConstructor = require('../internals/is-constructor');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar createProperty = require('../internals/create-property');\nvar getIterator = require('../internals/get-iterator');\nvar getIteratorMethod = require('../internals/get-iterator-method');\n\nvar Array = global.Array;\n\n// `Array.from` method implementation\n// https://tc39.es/ecma262/#sec-array.from\nmodule.exports = function from(arrayLike /* , mapfn = undefined, thisArg = undefined */) {\n  var O = toObject(arrayLike);\n  var IS_CONSTRUCTOR = isConstructor(this);\n  var argumentsLength = arguments.length;\n  var mapfn = argumentsLength > 1 ? arguments[1] : undefined;\n  var mapping = mapfn !== undefined;\n  if (mapping) mapfn = bind(mapfn, argumentsLength > 2 ? arguments[2] : undefined);\n  var iteratorMethod = getIteratorMethod(O);\n  var index = 0;\n  var length, result, step, iterator, next, value;\n  // if the target is not iterable or it's an array with the default iterator - use a simple case\n  if (iteratorMethod && !(this == Array && isArrayIteratorMethod(iteratorMethod))) {\n    iterator = getIterator(O, iteratorMethod);\n    next = iterator.next;\n    result = IS_CONSTRUCTOR ? new this() : [];\n    for (;!(step = call(next, iterator)).done; index++) {\n      value = mapping ? callWithSafeIterationClosing(iterator, mapfn, [step.value, index], true) : step.value;\n      createProperty(result, index, value);\n    }\n  } else {\n    length = lengthOfArrayLike(O);\n    result = IS_CONSTRUCTOR ? new this(length) : Array(length);\n    for (;length > index; index++) {\n      value = mapping ? mapfn(O[index], index) : O[index];\n      createProperty(result, index, value);\n    }\n  }\n  result.length = index;\n  return result;\n};\n","var anObject = require('../internals/an-object');\nvar iteratorClose = require('../internals/iterator-close');\n\n// call something on iterator step with safe closing on error\nmodule.exports = function (iterator, fn, value, ENTRIES) {\n  try {\n    return ENTRIES ? fn(anObject(value)[0], value[1]) : fn(value);\n  } catch (error) {\n    iteratorClose(iterator, 'throw', error);\n  }\n};\n","var global = require('../internals/global');\n\nmodule.exports = global;\n","var global = require('../internals/global');\n\nmodule.exports = global.Promise;\n","var global = require('../internals/global');\n\nvar TypeError = global.TypeError;\n\nmodule.exports = function (passed, required) {\n  if (passed < required) throw TypeError('Not enough arguments');\n  return passed;\n};\n","var global = require('../internals/global');\nvar bind = require('../internals/function-bind-context');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar macrotask = require('../internals/task').set;\nvar IS_IOS = require('../internals/engine-is-ios');\nvar IS_IOS_PEBBLE = require('../internals/engine-is-ios-pebble');\nvar IS_WEBOS_WEBKIT = require('../internals/engine-is-webos-webkit');\nvar IS_NODE = require('../internals/engine-is-node');\n\nvar MutationObserver = global.MutationObserver || global.WebKitMutationObserver;\nvar document = global.document;\nvar process = global.process;\nvar Promise = global.Promise;\n// Node.js 11 shows ExperimentalWarning on getting `queueMicrotask`\nvar queueMicrotaskDescriptor = getOwnPropertyDescriptor(global, 'queueMicrotask');\nvar queueMicrotask = queueMicrotaskDescriptor && queueMicrotaskDescriptor.value;\n\nvar flush, head, last, notify, toggle, node, promise, then;\n\n// modern engines have queueMicrotask method\nif (!queueMicrotask) {\n  flush = function () {\n    var parent, fn;\n    if (IS_NODE && (parent = process.domain)) parent.exit();\n    while (head) {\n      fn = head.fn;\n      head = head.next;\n      try {\n        fn();\n      } catch (error) {\n        if (head) notify();\n        else last = undefined;\n        throw error;\n      }\n    } last = undefined;\n    if (parent) parent.enter();\n  };\n\n  // browsers with MutationObserver, except iOS - https://github.com/zloirock/core-js/issues/339\n  // also except WebOS Webkit https://github.com/zloirock/core-js/issues/898\n  if (!IS_IOS && !IS_NODE && !IS_WEBOS_WEBKIT && MutationObserver && document) {\n    toggle = true;\n    node = document.createTextNode('');\n    new MutationObserver(flush).observe(node, { characterData: true });\n    notify = function () {\n      node.data = toggle = !toggle;\n    };\n  // environments with maybe non-completely correct, but existent Promise\n  } else if (!IS_IOS_PEBBLE && Promise && Promise.resolve) {\n    // Promise.resolve without an argument throws an error in LG WebOS 2\n    promise = Promise.resolve(undefined);\n    // workaround of WebKit ~ iOS Safari 10.1 bug\n    promise.constructor = Promise;\n    then = bind(promise.then, promise);\n    notify = function () {\n      then(flush);\n    };\n  // Node.js without promises\n  } else if (IS_NODE) {\n    notify = function () {\n      process.nextTick(flush);\n    };\n  // for other environments - macrotask based on:\n  // - setImmediate\n  // - MessageChannel\n  // - window.postMessag\n  // - onreadystatechange\n  // - setTimeout\n  } else {\n    // strange IE + webpack dev server bug - use .bind(global)\n    macrotask = bind(macrotask, global);\n    notify = function () {\n      macrotask(flush);\n    };\n  }\n}\n\nmodule.exports = queueMicrotask || function (fn) {\n  var task = { fn: fn, next: undefined };\n  if (last) last.next = task;\n  if (!head) {\n    head = task;\n    notify();\n  } last = task;\n};\n","var userAgent = require('../internals/engine-user-agent');\nvar global = require('../internals/global');\n\nmodule.exports = /ipad|iphone|ipod/i.test(userAgent) && global.Pebble !== undefined;\n","var userAgent = require('../internals/engine-user-agent');\n\nmodule.exports = /web0s(?!.*chrome)/i.test(userAgent);\n","var anObject = require('../internals/an-object');\nvar isObject = require('../internals/is-object');\nvar newPromiseCapability = require('../internals/new-promise-capability');\n\nmodule.exports = function (C, x) {\n  anObject(C);\n  if (isObject(x) && x.constructor === C) return x;\n  var promiseCapability = newPromiseCapability.f(C);\n  var resolve = promiseCapability.resolve;\n  resolve(x);\n  return promiseCapability.promise;\n};\n","var global = require('../internals/global');\n\nmodule.exports = function (a, b) {\n  var console = global.console;\n  if (console && console.error) {\n    arguments.length == 1 ? console.error(a) : console.error(a, b);\n  }\n};\n","module.exports = function (exec) {\n  try {\n    return { error: false, value: exec() };\n  } catch (error) {\n    return { error: true, value: error };\n  }\n};\n","var Queue = function () {\n  this.head = null;\n  this.tail = null;\n};\n\nQueue.prototype = {\n  add: function (item) {\n    var entry = { item: item, next: null };\n    if (this.head) this.tail.next = entry;\n    else this.head = entry;\n    this.tail = entry;\n  },\n  get: function () {\n    var entry = this.head;\n    if (entry) {\n      this.head = entry.next;\n      if (this.tail === entry) this.tail = null;\n      return entry.item;\n    }\n  }\n};\n\nmodule.exports = Queue;\n","module.exports = typeof window == 'object';\n","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function define(obj, key, value) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n    return obj[key];\n  }\n  try {\n    // IE 8 has a broken Object.defineProperty that only works on DOM objects.\n    define({}, \"\");\n  } catch (err) {\n    define = function(obj, key, value) {\n      return obj[key] = value;\n    };\n  }\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  define(IteratorPrototype, iteratorSymbol, function () {\n    return this;\n  });\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = GeneratorFunctionPrototype;\n  define(Gp, \"constructor\", GeneratorFunctionPrototype);\n  define(GeneratorFunctionPrototype, \"constructor\", GeneratorFunction);\n  GeneratorFunction.displayName = define(\n    GeneratorFunctionPrototype,\n    toStringTagSymbol,\n    \"GeneratorFunction\"\n  );\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      define(prototype, method, function(arg) {\n        return this._invoke(method, arg);\n      });\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      define(genFun, toStringTagSymbol, \"GeneratorFunction\");\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  define(AsyncIterator.prototype, asyncIteratorSymbol, function () {\n    return this;\n  });\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  define(Gp, toStringTagSymbol, \"Generator\");\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  define(Gp, iteratorSymbol, function() {\n    return this;\n  });\n\n  define(Gp, \"toString\", function() {\n    return \"[object Generator]\";\n  });\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, in modern engines\n  // we can explicitly access globalThis. In older engines we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  if (typeof globalThis === \"object\") {\n    globalThis.regeneratorRuntime = runtime;\n  } else {\n    Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n  }\n}\n","'use strict';\nvar $ = require('../internals/export');\nvar $trim = require('../internals/string-trim').trim;\nvar forcedStringTrimMethod = require('../internals/string-trim-forced');\n\n// `String.prototype.trim` method\n// https://tc39.es/ecma262/#sec-string.prototype.trim\n$({ target: 'String', proto: true, forced: forcedStringTrimMethod('trim') }, {\n  trim: function trim() {\n    return $trim(this);\n  }\n});\n","var PROPER_FUNCTION_NAME = require('../internals/function-name').PROPER;\nvar fails = require('../internals/fails');\nvar whitespaces = require('../internals/whitespaces');\n\nvar non = '\\u200B\\u0085\\u180E';\n\n// check that a method works with the correct list\n// of whitespaces and has a correct name\nmodule.exports = function (METHOD_NAME) {\n  return fails(function () {\n    return !!whitespaces[METHOD_NAME]()\n      || non[METHOD_NAME]() !== non\n      || (PROPER_FUNCTION_NAME && whitespaces[METHOD_NAME].name !== METHOD_NAME);\n  });\n};\n","function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}\n\nmodule.exports = _arrayWithHoles, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _iterableToArrayLimit(arr, i) {\n  var _i = arr == null ? null : typeof Symbol !== \"undefined\" && arr[Symbol.iterator] || arr[\"@@iterator\"];\n\n  if (_i == null) return;\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n\n  var _s, _e;\n\n  try {\n    for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {\n      _arr.push(_s.value);\n\n      if (i && _arr.length === i) break;\n    }\n  } catch (err) {\n    _d = true;\n    _e = err;\n  } finally {\n    try {\n      if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n    } finally {\n      if (_d) throw _e;\n    }\n  }\n\n  return _arr;\n}\n\nmodule.exports = _iterableToArrayLimit, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nmodule.exports = _nonIterableRest, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var arrayLikeToArray = require(\"./arrayLikeToArray.js\");\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return arrayLikeToArray(arr);\n}\n\nmodule.exports = _arrayWithoutHoles, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter);\n}\n\nmodule.exports = _iterableToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nmodule.exports = _nonIterableSpread, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var $ = require('../internals/export');\nvar fill = require('../internals/array-fill');\nvar addToUnscopables = require('../internals/add-to-unscopables');\n\n// `Array.prototype.fill` method\n// https://tc39.es/ecma262/#sec-array.prototype.fill\n$({ target: 'Array', proto: true }, {\n  fill: fill\n});\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables('fill');\n","'use strict';\nvar toObject = require('../internals/to-object');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\n\n// `Array.prototype.fill` method implementation\n// https://tc39.es/ecma262/#sec-array.prototype.fill\nmodule.exports = function fill(value /* , start = 0, end = @length */) {\n  var O = toObject(this);\n  var length = lengthOfArrayLike(O);\n  var argumentsLength = arguments.length;\n  var index = toAbsoluteIndex(argumentsLength > 1 ? arguments[1] : undefined, length);\n  var end = argumentsLength > 2 ? arguments[2] : undefined;\n  var endPos = end === undefined ? length : toAbsoluteIndex(end, length);\n  while (endPos > index) O[index++] = value;\n  return O;\n};\n","// A port of an algorithm by Johannes Baagøe <baagoe@baagoe.com>, 2010\n// http://baagoe.com/en/RandomMusings/javascript/\n// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror\n// Original work is under MIT license -\n\n// Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\n(function(global, module, define) {\n\nfunction Alea(seed) {\n  var me = this, mash = Mash();\n\n  me.next = function() {\n    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32\n    me.s0 = me.s1;\n    me.s1 = me.s2;\n    return me.s2 = t - (me.c = t | 0);\n  };\n\n  // Apply the seeding algorithm from Baagoe.\n  me.c = 1;\n  me.s0 = mash(' ');\n  me.s1 = mash(' ');\n  me.s2 = mash(' ');\n  me.s0 -= mash(seed);\n  if (me.s0 < 0) { me.s0 += 1; }\n  me.s1 -= mash(seed);\n  if (me.s1 < 0) { me.s1 += 1; }\n  me.s2 -= mash(seed);\n  if (me.s2 < 0) { me.s2 += 1; }\n  mash = null;\n}\n\nfunction copy(f, t) {\n  t.c = f.c;\n  t.s0 = f.s0;\n  t.s1 = f.s1;\n  t.s2 = f.s2;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new Alea(seed),\n      state = opts && opts.state,\n      prng = xg.next;\n  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }\n  prng.double = function() {\n    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53\n  };\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nfunction Mash() {\n  var n = 0xefc8249d;\n\n  var mash = function(data) {\n    data = String(data);\n    for (var i = 0; i < data.length; i++) {\n      n += data.charCodeAt(i);\n      var h = 0.02519603282416938 * n;\n      n = h >>> 0;\n      h -= n;\n      h *= n;\n      n = h >>> 0;\n      h -= n;\n      n += h * 0x100000000; // 2^32\n    }\n    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32\n  };\n\n  return mash;\n}\n\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.alea = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xor128\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n\n  // Set up generator function.\n  me.next = function() {\n    var t = me.x ^ (me.x << 11);\n    me.x = me.y;\n    me.y = me.z;\n    me.z = me.w;\n    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);\n  };\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor128 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xorwow\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var t = (me.x ^ (me.x >>> 2));\n    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;\n    return (me.d = (me.d + 362437 | 0)) +\n       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;\n  };\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n  me.v = 0;\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    if (k == strseed.length) {\n      me.d = me.x << 10 ^ me.x >>> 4;\n    }\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  t.v = f.v;\n  t.d = f.d;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorwow = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xorshift7\" algorithm by\n// François Panneton and Pierre L'ecuyer:\n// \"On the Xorgshift Random Number Generators\"\n// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    // Update xor generator.\n    var X = me.x, i = me.i, t, v, w;\n    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);\n    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);\n    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);\n    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);\n    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);\n    X[i] = v;\n    me.i = (i + 1) & 7;\n    return v;\n  };\n\n  function init(me, seed) {\n    var j, w, X = [];\n\n    if (seed === (seed | 0)) {\n      // Seed state array using a 32-bit integer.\n      w = X[0] = seed;\n    } else {\n      // Seed state using a string.\n      seed = '' + seed;\n      for (j = 0; j < seed.length; ++j) {\n        X[j & 7] = (X[j & 7] << 15) ^\n            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);\n      }\n    }\n    // Enforce an array length of 8, not all zeroes.\n    while (X.length < 8) X.push(0);\n    for (j = 0; j < 8 && X[j] === 0; ++j);\n    if (j == 8) w = X[7] = -1; else w = X[j];\n\n    me.x = X;\n    me.i = 0;\n\n    // Discard an initial 256 values.\n    for (j = 256; j > 0; --j) {\n      me.next();\n    }\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.x = f.x.slice();\n  t.i = f.i;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.x) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorshift7 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n","// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.\n//\n// This fast non-cryptographic random number generator is designed for\n// use in Monte-Carlo algorithms. It combines a long-period xorshift\n// generator with a Weyl generator, and it passes all common batteries\n// of stasticial tests for randomness while consuming only a few nanoseconds\n// for each prng generated.  For background on the generator, see Brent's\n// paper: \"Some long-period random number generators using shifts and xors.\"\n// http://arxiv.org/pdf/1004.3115v1.pdf\n//\n// Usage:\n//\n// var xor4096 = require('xor4096');\n// random = xor4096(1);                        // Seed with int32 or string.\n// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.\n// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.\n//\n// For nonzero numeric keys, this impelementation provides a sequence\n// identical to that by Brent's xorgens 3 implementaion in C.  This\n// implementation also provides for initalizing the generator with\n// string seeds, or for saving and restoring the state of the generator.\n//\n// On Chrome, this prng benchmarks about 2.1 times slower than\n// Javascript's built-in Math.random().\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    var w = me.w,\n        X = me.X, i = me.i, t, v;\n    // Update Weyl generator.\n    me.w = w = (w + 0x61c88647) | 0;\n    // Update xor generator.\n    v = X[(i + 34) & 127];\n    t = X[i = ((i + 1) & 127)];\n    v ^= v << 13;\n    t ^= t << 17;\n    v ^= v >>> 15;\n    t ^= t >>> 12;\n    // Update Xor generator array state.\n    v = X[i] = v ^ t;\n    me.i = i;\n    // Result is the combination.\n    return (v + (w ^ (w >>> 16))) | 0;\n  };\n\n  function init(me, seed) {\n    var t, v, i, j, w, X = [], limit = 128;\n    if (seed === (seed | 0)) {\n      // Numeric seeds initialize v, which is used to generates X.\n      v = seed;\n      seed = null;\n    } else {\n      // String seeds are mixed into v and X one character at a time.\n      seed = seed + '\\0';\n      v = 0;\n      limit = Math.max(limit, seed.length);\n    }\n    // Initialize circular array and weyl value.\n    for (i = 0, j = -32; j < limit; ++j) {\n      // Put the unicode characters into the array, and shuffle them.\n      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);\n      // After 32 shuffles, take v as the starting w value.\n      if (j === 0) w = v;\n      v ^= v << 10;\n      v ^= v >>> 15;\n      v ^= v << 4;\n      v ^= v >>> 13;\n      if (j >= 0) {\n        w = (w + 0x61c88647) | 0;     // Weyl.\n        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.\n        i = (0 == t) ? i + 1 : 0;     // Count zeroes.\n      }\n    }\n    // We have detected all zeroes; make the key nonzero.\n    if (i >= 128) {\n      X[(seed && seed.length || 0) & 127] = -1;\n    }\n    // Run the generator 512 times to further mix the state before using it.\n    // Factoring this as a function slows the main generator, so it is just\n    // unrolled here.  The weyl generator is not advanced while warming up.\n    i = 127;\n    for (j = 4 * 128; j > 0; --j) {\n      v = X[(i + 34) & 127];\n      t = X[i = ((i + 1) & 127)];\n      v ^= v << 13;\n      t ^= t << 17;\n      v ^= v >>> 15;\n      t ^= t >>> 12;\n      X[i] = v ^ t;\n    }\n    // Storing state as object members is faster than using closure variables.\n    me.w = w;\n    me.X = X;\n    me.i = i;\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.i = f.i;\n  t.w = f.w;\n  t.X = f.X.slice();\n  return t;\n};\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.X) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor4096 = impl;\n}\n\n})(\n  this,                                     // window object or global\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n","// A Javascript implementaion of the \"Tyche-i\" prng algorithm by\n// Samuel Neves and Filipe Araujo.\n// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var b = me.b, c = me.c, d = me.d, a = me.a;\n    b = (b << 25) ^ (b >>> 7) ^ c;\n    c = (c - d) | 0;\n    d = (d << 24) ^ (d >>> 8) ^ a;\n    a = (a - b) | 0;\n    me.b = b = (b << 20) ^ (b >>> 12) ^ c;\n    me.c = c = (c - d) | 0;\n    me.d = (d << 16) ^ (c >>> 16) ^ a;\n    return me.a = (a - b) | 0;\n  };\n\n  /* The following is non-inverted tyche, which has better internal\n   * bit diffusion, but which is about 25% slower than tyche-i in JS.\n  me.next = function() {\n    var a = me.a, b = me.b, c = me.c, d = me.d;\n    a = (me.a + me.b | 0) >>> 0;\n    d = me.d ^ a; d = d << 16 ^ d >>> 16;\n    c = me.c + d | 0;\n    b = me.b ^ c; b = b << 12 ^ d >>> 20;\n    me.a = a = a + b | 0;\n    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;\n    me.c = c = c + d | 0;\n    b = b ^ c;\n    return me.b = (b << 7 ^ b >>> 25);\n  }\n  */\n\n  me.a = 0;\n  me.b = 0;\n  me.c = 2654435769 | 0;\n  me.d = 1367130551;\n\n  if (seed === Math.floor(seed)) {\n    // Integer seed.\n    me.a = (seed / 0x100000000) | 0;\n    me.b = seed | 0;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 20; k++) {\n    me.b ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.a = f.a;\n  t.b = f.b;\n  t.c = f.c;\n  t.d = f.d;\n  return t;\n};\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.tychei = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256,        // each RC4 output is 0 <= x < 256\n    chunks = 6,         // at least six RC4 outputs for each double\n    digits = 52,        // there are 52 significant digits in a double\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n    startdenom = math.pow(width, chunks),\n    significance = math.pow(2, digits),\n    overflow = significance * 2,\n    mask = width - 1,\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n  var key = [];\n  options = (options == true) ? { entropy: true } : (options || {});\n\n  // Flatten the seed string or build one from local entropy if needed.\n  var shortseed = mixkey(flatten(\n    options.entropy ? [seed, tostring(pool)] :\n    (seed == null) ? autoseed() : seed, 3), key);\n\n  // Use the seed to initialize an ARC4 generator.\n  var arc4 = new ARC4(key);\n\n  // This function returns a random double in [0, 1) that contains\n  // randomness in every bit of the mantissa of the IEEE 754 value.\n  var prng = function() {\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\n        x = 0;                          //   and no 'extra last byte'.\n    while (n < significance) {          // Fill up all significant digits by\n      n = (n + x) * width;              //   shifting numerator and\n      d *= width;                       //   denominator and generating a\n      x = arc4.g(1);                    //   new least-significant-byte.\n    }\n    while (n >= overflow) {             // To avoid rounding up, before adding\n      n /= 2;                           //   last byte, shift everything\n      d /= 2;                           //   right using integer math until\n      x >>>= 1;                         //   we have exactly the desired bits.\n    }\n    return (n + x) / d;                 // Form the number within [0, 1).\n  };\n\n  prng.int32 = function() { return arc4.g(4) | 0; }\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\n  prng.double = prng;\n\n  // Mix the randomness into accumulated entropy.\n  mixkey(tostring(arc4.S), pool);\n\n  // Calling convention: what to return as a function of prng, seed, is_math.\n  return (options.pass || callback ||\n      function(prng, seed, is_math_call, state) {\n        if (state) {\n          // Load the arc4 state from the given state if it has an S array.\n          if (state.S) { copy(state, arc4); }\n          // Only provide the .state method if requested via options.state.\n          prng.state = function() { return copy(arc4, {}); }\n        }\n\n        // If called as a method of Math (Math.seedrandom()), mutate\n        // Math.random because that is how seedrandom.js has worked since v1.0.\n        if (is_math_call) { math[rngname] = prng; return seed; }\n\n        // Otherwise, it is a newer calling convention, so return the\n        // prng directly.\n        else return prng;\n      })(\n  prng,\n  shortseed,\n  'global' in options ? options.global : (this == math),\n  options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation.  The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4.  Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n  var t, keylen = key.length,\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n  // The empty key [] is treated as [0].\n  if (!keylen) { key = [keylen++]; }\n\n  // Set up S using the standard key scheduling algorithm.\n  while (i < width) {\n    s[i] = i++;\n  }\n  for (i = 0; i < width; i++) {\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n    s[j] = t;\n  }\n\n  // The \"g\" method returns the next (count) outputs as one number.\n  (me.g = function(count) {\n    // Using instance members instead of closure state nearly doubles speed.\n    var t, r = 0,\n        i = me.i, j = me.j, s = me.S;\n    while (count--) {\n      t = s[i = mask & (i + 1)];\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n    }\n    me.i = i; me.j = j;\n    return r;\n    // For robust unpredictability, the function call below automatically\n    // discards an initial batch of values.  This is called RC4-drop[256].\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\n  })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n  t.i = f.i;\n  t.j = f.j;\n  t.S = f.S.slice();\n  return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n  var result = [], typ = (typeof obj), prop;\n  if (depth && typ == 'object') {\n    for (prop in obj) {\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n    }\n  }\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n  var stringseed = seed + '', smear, j = 0;\n  while (j < stringseed.length) {\n    key[mask & j] =\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n  }\n  return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n  try {\n    var out;\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\n      // The use of 'out' to remember randomBytes makes tight minified code.\n      out = out(width);\n    } else {\n      out = new Uint8Array(width);\n      (global.crypto || global.msCrypto).getRandomValues(out);\n    }\n    return tostring(out);\n  } catch (e) {\n    var browser = global.navigator,\n        plugins = browser && browser.plugins;\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\n  }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n  return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool.  Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n  module.exports = seedrandom;\n  // When in node.js, try using crypto package for autoseeding.\n  try {\n    nodecrypto = require('crypto');\n  } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n  define(function() { return seedrandom; });\n} else {\n  // When included as a plain script, set up Math.seedrandom global.\n  math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n  // global: `self` in browsers (including strict mode and web workers),\n  // otherwise `this` in Node and other environments\n  (typeof self !== 'undefined') ? self : this,\n  [],     // pool: entropy pool starts empty\n  Math    // math: package containing random, pow, and seedrandom\n);\n","var $ = require('../internals/export');\nvar repeat = require('../internals/string-repeat');\n\n// `String.prototype.repeat` method\n// https://tc39.es/ecma262/#sec-string.prototype.repeat\n$({ target: 'String', proto: true }, {\n  repeat: repeat\n});\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}\n\nexport function isBigNumber (x) {\n  if (\n    !x || typeof x !== 'object' ||\n    typeof x.constructor !== 'function'\n  ) {\n    return false\n  }\n\n  if (\n    x.isBigNumber === true &&\n    typeof x.constructor.prototype === 'object' &&\n    x.constructor.prototype.isBigNumber === true\n  ) {\n    return true\n  }\n\n  if (\n    typeof x.constructor.isDecimal === 'function' &&\n    x.constructor.isDecimal(x) === true\n  ) {\n    return true\n  }\n\n  return false\n}\n\nexport function isComplex (x) {\n  return (x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true) || false\n}\n\nexport function isFraction (x) {\n  return (x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true) || false\n}\n\nexport function isUnit (x) {\n  return (x && x.constructor.prototype.isUnit === true) || false\n}\n\nexport function isString (x) {\n  return typeof x === 'string'\n}\n\nexport const isArray = Array.isArray\n\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}\n\nexport function isDenseMatrix (x) {\n  return (x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true) || false\n}\n\nexport function isSparseMatrix (x) {\n  return (x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true) || false\n}\n\nexport function isRange (x) {\n  return (x && x.constructor.prototype.isRange === true) || false\n}\n\nexport function isIndex (x) {\n  return (x && x.constructor.prototype.isIndex === true) || false\n}\n\nexport function isBoolean (x) {\n  return typeof x === 'boolean'\n}\n\nexport function isResultSet (x) {\n  return (x && x.constructor.prototype.isResultSet === true) || false\n}\n\nexport function isHelp (x) {\n  return (x && x.constructor.prototype.isHelp === true) || false\n}\n\nexport function isFunction (x) {\n  return typeof x === 'function'\n}\n\nexport function isDate (x) {\n  return x instanceof Date\n}\n\nexport function isRegExp (x) {\n  return x instanceof RegExp\n}\n\nexport function isObject (x) {\n  return !!(x &&\n    typeof x === 'object' &&\n    x.constructor === Object &&\n    !isComplex(x) &&\n    !isFraction(x))\n}\n\nexport function isNull (x) {\n  return x === null\n}\n\nexport function isUndefined (x) {\n  return x === undefined\n}\n\nexport function isAccessorNode (x) {\n  return (x && x.isAccessorNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isArrayNode (x) {\n  return (x && x.isArrayNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isAssignmentNode (x) {\n  return (x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isBlockNode (x) {\n  return (x && x.isBlockNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isConditionalNode (x) {\n  return (x && x.isConditionalNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isConstantNode (x) {\n  return (x && x.isConstantNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isFunctionAssignmentNode (x) {\n  return (x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isFunctionNode (x) {\n  return (x && x.isFunctionNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isIndexNode (x) {\n  return (x && x.isIndexNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isNode (x) {\n  return (x && x.isNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isObjectNode (x) {\n  return (x && x.isObjectNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isOperatorNode (x) {\n  return (x && x.isOperatorNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isParenthesisNode (x) {\n  return (x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isRangeNode (x) {\n  return (x && x.isRangeNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isSymbolNode (x) {\n  return (x && x.isSymbolNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isChain (x) {\n  return (x && x.constructor.prototype.isChain === true) || false\n}\n\nexport function typeOf (x) {\n  const t = typeof x\n\n  if (t === 'object') {\n    // JavaScript types\n    if (x === null) return 'null'\n    if (Array.isArray(x)) return 'Array'\n    if (x instanceof Date) return 'Date'\n    if (x instanceof RegExp) return 'RegExp'\n\n    // math.js types\n    if (isBigNumber(x)) return 'BigNumber'\n    if (isComplex(x)) return 'Complex'\n    if (isFraction(x)) return 'Fraction'\n    if (isMatrix(x)) return 'Matrix'\n    if (isUnit(x)) return 'Unit'\n    if (isIndex(x)) return 'Index'\n    if (isRange(x)) return 'Range'\n    if (isResultSet(x)) return 'ResultSet'\n    if (isNode(x)) return x.type\n    if (isChain(x)) return 'Chain'\n    if (isHelp(x)) return 'Help'\n\n    return 'Object'\n  }\n\n  if (t === 'function') return 'Function'\n\n  return t // can be 'string', 'number', 'boolean', ...\n}\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\n  return isFinite(value)\n    ? (value === Math.round(value))\n    : false\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport const 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 const 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 const 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 const 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 const cbrt = /* #__PURE__ */ Math.cbrt || function cbrt (x) {\n  if (x === 0) {\n    return x\n  }\n\n  const negate = x < 0\n  let result\n  if (negate) {\n    x = -x\n  }\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\n  return negate ? -result : result\n}\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport const expm1 = /* #__PURE__ */ Math.expm1 || function expm1 (x) {\n  return (x >= 2e-4 || x <= -2e-4)\n    ? Math.exp(x) - 1\n    : 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  const prefixes = { 2: '0b', 8: '0o', 16: '0x' }\n  const prefix = prefixes[base]\n  let 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^${size - 1}, 2^${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${size}`\n  }\n  let sign = ''\n  if (n < 0) {\n    n = -n\n    sign = '-'\n  }\n  return `${sign}${prefix}${n.toString(base)}${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  let notation = 'auto'\n  let precision\n  let wordSize\n\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\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\n    case 'exponential':\n      return toExponential(value, precision)\n\n    case 'engineering':\n      return toEngineering(value, precision)\n\n    case 'bin':\n      return formatNumberToBase(value, 2, wordSize)\n\n    case 'oct':\n      return formatNumberToBase(value, 8, wordSize)\n\n    case 'hex':\n      return formatNumberToBase(value, 16, wordSize)\n\n    case 'auto':\n      // remove trailing zeros after the decimal point\n      return toPrecision(value, precision, options && options)\n        .replace(/((\\.\\d*?)(0+))($|e)/, function () {\n          const digits = arguments[2]\n          const e = arguments[4]\n          return (digits !== '.') ? digits + e : e\n        })\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' +\n        '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  const match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/)\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value)\n  }\n\n  const sign = match[1]\n  const digits = match[2]\n  let exponent = parseFloat(match[4] || '0')\n\n  const dot = digits.indexOf('.')\n  exponent += (dot !== -1) ? (dot - 1) : (digits.length - 1)\n\n  const coefficients = digits\n    .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    })\n    .replace(/0*$/, '') // remove trailing zeros\n    .split('')\n    .map(function (d) {\n      return parseInt(d)\n    })\n\n  if (coefficients.length === 0) {\n    coefficients.push(0)\n    exponent++\n  }\n\n  return {\n    sign: sign,\n    coefficients: coefficients,\n    exponent: 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\n  const split = splitNumber(value)\n  const rounded = roundDigits(split, precision)\n\n  const e = rounded.exponent\n  const c = rounded.coefficients\n\n  // find nearest lower multiple of 3 for exponent\n  const newExp = e % 3 === 0 ? e : (e < 0 ? (e - 3) - (e % 3) : e - (e % 3))\n\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    const missingZeros = Math.abs(e - newExp) - (c.length - 1)\n    for (let i = 0; i < missingZeros; i++) {\n      c.push(0)\n    }\n  }\n\n  // find difference in exponents\n  let expDiff = Math.abs(e - newExp)\n  let 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  const decimals = c.slice(decimalIdx).join('')\n  const decimalVal = ((isNumber(precision) && decimals.length) || decimals.match(/[1-9]/)) ? ('.' + decimals) : ''\n\n  const str = c.slice(0, decimalIdx).join('') +\n    decimalVal +\n    '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\n  const splitValue = splitNumber(value)\n  const rounded = (typeof precision === 'number')\n    ? roundDigits(splitValue, splitValue.exponent + 1 + precision)\n    : splitValue\n  let c = rounded.coefficients\n  let p = rounded.exponent + 1 // exponent may have changed\n\n  // append zeros if needed\n  const 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\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  const split = splitNumber(value)\n  const rounded = precision ? roundDigits(split, precision) : split\n  let c = rounded.coefficients\n  const 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  const first = c.shift()\n  return rounded.sign + first + (c.length > 0 ? ('.' + c.join('')) : '') +\n    '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  const lowerExp = (options && options.lowerExp !== undefined) ? options.lowerExp : -3\n  const upperExp = (options && options.upperExp !== undefined) ? options.upperExp : 5\n\n  const split = splitNumber(value)\n  const 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    let c = rounded.coefficients\n    const 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 +\n      (c.length < precision ? precision - c.length : 0)))\n\n    // prepend zeros\n    c = zeros(-e).concat(c)\n\n    const dot = e > 0 ? e : 0\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.')\n    }\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  const rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  }\n  const c = rounded.coefficients\n\n  // prepend zeros if needed\n  while (precision <= 0) {\n    c.unshift(0)\n    rounded.exponent++\n    precision++\n  }\n\n  if (c.length > precision) {\n    const removed = c.splice(precision, c.length - precision)\n\n    if (removed[0] >= 5) {\n      let 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\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  const arr = []\n  for (let 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\n    .toExponential()\n    .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 const 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\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    const 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 const acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x)\n}\n\nexport const 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 const 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 const 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 const 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 const tanh = Math.tanh || function (x) {\n  const e = Math.exp(2 * x)\n  return (e - 1) / (e + 1)\n}\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  const BigNumberCtor = n.constructor\n  const big2 = new BigNumberCtor(2)\n  let 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^${size - 1}, 2^${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${size}`\n  }\n  switch (base) {\n    case 2: return `${n.toBinary()}${suffix}`\n    case 8: return `${n.toOctal()}${suffix}`\n    case 16: return `${n.toHexadecimal()}${suffix}`\n    default: throw new Error(`Base ${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  let notation = 'auto'\n  let precision\n  let wordSize\n\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\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\n    case 'exponential':\n      return toExponential(value, precision)\n\n    case 'engineering':\n      return toEngineering(value, precision)\n\n    case 'bin':\n      return formatBigNumberToBase(value, 2, wordSize)\n\n    case 'oct':\n      return formatBigNumberToBase(value, 8, wordSize)\n\n    case 'hex':\n      return formatBigNumberToBase(value, 16, wordSize)\n\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      const lowerExp = (options && options.lowerExp !== undefined) ? options.lowerExp : -3\n      const 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      let str\n      const rounded = value.toSignificantDigits(precision)\n      const 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        const digits = arguments[2]\n        const e = arguments[4]\n        return (digits !== '.') ? digits + e : e\n      })\n    }\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' +\n          '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  const e = value.e\n  const 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  const valueWithoutExp = value.mul(Math.pow(10, -newExp))\n\n  let valueStr = valueWithoutExp.toPrecision(precision)\n  if (valueStr.indexOf('e') !== -1) {\n    valueStr = valueWithoutExp.toString()\n  }\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}\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  const start = text.length - search.length\n  const 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  const result = _format(value, options)\n  if (options && typeof options === 'object' && 'truncate' in options &&\n      result.length > options.truncate) {\n    return result.substring(0, options.truncate - 3) + '...'\n  }\n  return result\n}\n\nfunction _format (value, options) {\n  if (typeof value === 'number') {\n    return formatNumber(value, options)\n  }\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\n  if (Array.isArray(value)) {\n    return formatArray(value, options)\n  }\n\n  if (isString(value)) {\n    return '\"' + value + '\"'\n  }\n\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function'\n  }\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      const entries = Object.keys(value).map(key => {\n        return '\"' + key + '\": ' + format(value[key], options)\n      })\n\n      return '{' + entries.join(', ') + '}'\n    }\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  const text = String(value)\n  let escaped = ''\n  let i = 0\n  while (i < text.length) {\n    let c = text.charAt(i)\n\n    if (c === '\\\\') {\n      escaped += c\n      i++\n\n      c = text.charAt(i)\n      if (c === '' || '\"\\\\/bfnrtu'.indexOf(c) === -1) {\n        escaped += '\\\\' // no valid escape character -> escape it\n      }\n      escaped += c\n    } else if (c === '\"') {\n      escaped += '\\\\\"'\n    } else {\n      escaped += c\n    }\n    i++\n  }\n\n  return '\"' + escaped + '\"'\n}\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape (value) {\n  let text = String(value)\n  text = text.replace(/&/g, '&amp;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#39;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n\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    let str = '['\n    const len = array.length\n    for (let 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 &&\n      typeof value === 'object' &&\n      typeof value.s === 'number' &&\n      typeof value.n === 'number' &&\n      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 ' +\n      '(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 ' +\n      '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)')\n  }\n\n  return (x === y)\n    ? 0\n    : (x > y ? 1 : -1)\n}\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\n  this.actual = actual\n  this.expected = expected\n  this.relation = relation\n\n  this.message = 'Dimension mismatch (' +\n      (Array.isArray(actual) ? ('[' + actual.join(', ') + ']') : actual) +\n      ' ' + (this.relation || '!=') + ' ' +\n      (Array.isArray(expected) ? ('[' + expected.join(', ') + ']') : expected) +\n      ')'\n\n  this.stack = (new Error()).stack\n}\n\nDimensionError.prototype = new RangeError()\nDimensionError.prototype.constructor = RangeError\nDimensionError.prototype.name = 'DimensionError'\nDimensionError.prototype.isDimensionError = true\n","/**\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\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\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\n  this.stack = (new Error()).stack\n}\n\nIndexError.prototype = new RangeError()\nIndexError.prototype.constructor = RangeError\nIndexError.prototype.name = 'IndexError'\nIndexError.prototype.isIndexError = true\n","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  const s = []\n\n  while (Array.isArray(x)) {\n    s.push(x.length)\n    x = x[0]\n  }\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  let i\n  const len = array.length\n\n  if (len !== size[dim]) {\n    throw new DimensionError(len, size[dim])\n  }\n\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    const dimNext = dim + 1\n    for (i = 0; i < len; i++) {\n      const 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  const 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 ' +\n        '(size: ' + format(size) + ')')\n    }\n  })\n\n  // recursively resize the array\n  const _defaultValue = (defaultValue !== undefined) ? defaultValue : 0\n  _resize(array, size, 0, _defaultValue)\n\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  let i\n  let elem\n  const oldLen = array.length\n  const newLen = size[dim]\n  const minLen = Math.min(oldLen, newLen)\n\n  // apply new length\n  array.length = newLen\n\n  if (dim < size.length - 1) {\n    // non-last dimension\n    const 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  const flatArray = flatten(array)\n  const currentLength = flatArray.length\n\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected')\n  }\n\n  if (sizes.length === 0) {\n    throw new DimensionError(0, currentLength, '!=')\n  }\n\n  sizes = processSizesWildcard(sizes, currentLength)\n  const newLength = product(sizes)\n  if (currentLength !== newLength) {\n    throw new DimensionError(\n      newLength,\n      currentLength,\n      '!='\n    )\n  }\n\n  try {\n    return _reshape(flatArray, sizes)\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(\n        newLength,\n        currentLength,\n        '!='\n      )\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  const newLength = product(sizes)\n  const processedSizes = sizes.slice()\n  const WILDCARD = -1\n  const wildCardIndex = sizes.indexOf(WILDCARD)\n\n  const isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes')\n  }\n\n  const hasWildcard = wildCardIndex >= 0\n  const canReplaceWildcard = currentLength % newLength === 0\n\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  let tmpArray = array\n  let tmpArray2\n  // for each dimensions starting by the last one and ignoring the first one\n  for (let sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    const size = sizes[sizeIndex]\n    tmpArray2 = []\n\n    // aggregate the elements of the current tmpArray in elements of the requested size\n    const length = tmpArray.length / size\n    for (let 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\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  const 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  let 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\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  let i, ii\n\n  if (dim < dims) {\n    const 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\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  const s = size || arraySize(array)\n\n  // unsqueeze outer dimensions\n  if (outer) {\n    for (let 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\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  let i, ii\n\n  if (Array.isArray(array)) {\n    const 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 (let d = dim; d < dims; d++) {\n      array = [array]\n    }\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  const flat = []\n\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\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\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\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\n  if (a.length === 0) {\n    return a\n  }\n\n  const b = []\n  let count = 0\n  b[0] = { value: a[0], identifier: 0 }\n  for (let i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++\n    } else {\n      count = 0\n    }\n    b.push({ value: a[i], identifier: count })\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\n  if (a.length === 0) {\n    return a\n  }\n\n  const b = []\n  for (let 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  let type // to hold type info\n  let length = 0 // to hold length value to ensure it has consistent sizes\n\n  for (let i = 0; i < array.length; i++) {\n    const item = array[i]\n    const 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\n    const itemType = isArray\n      ? getArrayDataType(item, typeOf) // recurse into a nested array\n      : typeOf(item)\n\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\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}\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  const type = typeof x\n\n  // immutable primitive types\n  if (type === 'number' || type === 'string' || type === 'boolean' ||\n      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\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  const clone = {}\n\n  for (const key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key])\n    }\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 (const 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\n  for (const 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  let prop, i, len\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false\n    }\n\n    if (a.length !== b.length) {\n      return false\n    }\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\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  const flattenedObject = {}\n\n  _deepFlatten(nestedObject, flattenedObject)\n\n  return flattenedObject\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten (nestedObject, flattenedObject) {\n  for (const prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      const 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', { get: function () {} })\n      return true\n    }\n  } catch (e) {}\n\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  let _uninitialized = true\n  let _value\n\n  Object.defineProperty(object, prop, {\n    get: function () {\n      if (_uninitialized) {\n        _value = valueResolver()\n        _uninitialized = false\n      }\n      return _value\n    },\n\n    set: function (value) {\n      _value = value\n      _uninitialized = false\n    },\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\n  let obj = object\n\n  if (path) {\n    for (let i = 0; i < path.length; i++) {\n      const key = path[i]\n      if (!(key in obj)) {\n        obj[key] = {}\n      }\n      obj = obj[key]\n    }\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\n  let child = object\n\n  for (let i = 0; i < path.length; i++) {\n    const key = path[i]\n    child = child ? child[key] : undefined\n  }\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\n  let child = object\n  for (let i = 0; i < path.length - 1; i++) {\n    const key = path[i]\n    if (child[key] === undefined) {\n      child[key] = {}\n    }\n    child = child[key]\n  }\n\n  if (path.length > 0) {\n    const lastKey = path[path.length - 1]\n    child[lastKey] = value\n  }\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  const copy = {}\n\n  for (let i = 0; i < properties.length; i++) {\n    const key = properties[i]\n    const value = get(object, key)\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value)\n    }\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  const copy = {}\n\n  for (let i = 0; i < properties.length; i++) {\n    const key = properties[i]\n    const value = object[key]\n    if (value !== undefined) {\n      copy[key] = value\n    }\n  }\n\n  return copy\n}\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}\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    const deps = pickShallow(scope, dependencies.map(stripOptionalNotation))\n\n    assertDependencies(name, dependencies, scope)\n\n    return create(deps)\n  }\n\n  assertAndCreate.isFactory = true\n  assertAndCreate.fn = name\n  assertAndCreate.dependencies = dependencies.slice().sort()\n  if (meta) {\n    assertAndCreate.meta = meta\n  }\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  const factoriesByName = {}\n\n  factories.forEach(factory => {\n    factoriesByName[factory.fn] = factory\n  })\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\n      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n        return true\n      }\n    }\n\n    return false\n  }\n\n  const sorted = []\n\n  function addFactory (factory) {\n    let index = 0\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++\n    }\n\n    sorted.splice(index, 0, factory)\n  }\n\n  // sort regular factory functions\n  factories\n    .filter(isFactory)\n    .forEach(addFactory)\n\n  // sort legacy factory functions AFTER the regular factory functions\n  factories\n    .filter(factory => !isFactory(factory))\n    .forEach(addFactory)\n\n  return sorted\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create (factories, scope = {}) {\n  sortFactories(factories)\n    .forEach(factory => factory(scope))\n\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' &&\n    typeof obj.fn === 'string' &&\n    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  const allDefined = dependencies\n    .filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n    .every(dependency => scope[dependency] !== undefined)\n\n  if (!allDefined) {\n    const 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 \"${name}\", ` +\n      `some dependencies are missing: ${missingDependencies.map(d => `\"${d}\"`).join(', ')}.`)\n  }\n}\n\nexport function isOptionalDependency (dependency) {\n  return dependency && dependency[0] === '?'\n}\n\nexport function stripOptionalNotation (dependency) {\n  return dependency && dependency[0] === '?'\n    ? dependency.slice(1)\n    : dependency\n}\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\n  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property')\n  }\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\n  throw new Error('No access to property \"' + prop + '\"')\n}\n\nfunction getSafeProperties (object) {\n  return Object.keys(object).filter((prop) => hasOwnProperty(object, prop))\n}\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) &&\n      (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}\n\nfunction isPlainObject (object) {\n  return typeof object === 'object' && object && object.constructor === Object\n}\n\nconst safeNativeProperties = {\n  length: true,\n  name: true\n}\n\nconst safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n}\n\nexport { getSafeProperty }\nexport { setSafeProperty }\nexport { isSafeProperty }\nexport { hasSafeProperty }\nexport { getSafeProperties }\nexport { validateSafeMethod }\nexport { isSafeMethod }\nexport { isPlainObject }\n","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\n  keys () {\n    return Object.keys(this.wrappedObject)\n  }\n\n  get (key) {\n    return getSafeProperty(this.wrappedObject, key)\n  }\n\n  set (key, value) {\n    setSafeProperty(this.wrappedObject, key, value)\n    return this\n  }\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\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  const object = {}\n  for (const key of map.keys()) {\n    const 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 ||\n    object instanceof ObjectWrappingMap ||\n    (\n      typeof object.set === 'function' &&\n      typeof object.get === 'function' &&\n      typeof object.keys === 'function' &&\n      typeof object.has === 'function'\n    )\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, ...objects) {\n  for (const args of objects) {\n    if (!args) {\n      continue\n    }\n    if (isMap(args)) {\n      for (const key of args.keys()) {\n        map.set(key, args.get(key))\n      }\n    } else if (isObject(args)) {\n      for (const key of Object.keys(args)) {\n        map.set(key, args[key])\n      }\n    }\n  }\n  return map\n}\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 {\n  isAccessorNode,\n  isArray,\n  isArrayNode,\n  isAssignmentNode,\n  isBigNumber,\n  isBlockNode,\n  isBoolean,\n  isChain,\n  isComplex,\n  isConditionalNode,\n  isConstantNode,\n  isDate,\n  isDenseMatrix,\n  isFraction,\n  isFunction,\n  isFunctionAssignmentNode,\n  isFunctionNode,\n  isHelp,\n  isIndex,\n  isIndexNode,\n  isMatrix,\n  isNode,\n  isNull,\n  isNumber,\n  isObject,\n  isObjectNode,\n  isOperatorNode,\n  isParenthesisNode,\n  isRange,\n  isRangeNode,\n  isRegExp,\n  isResultSet,\n  isSparseMatrix,\n  isString,\n  isSymbolNode,\n  isUndefined,\n  isUnit\n} 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\nlet _createTyped = function () {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped = typedFunction.create\n  return typedFunction\n}\n\nconst dependencies = [\n  '?BigNumber',\n  '?Complex',\n  '?DenseMatrix',\n  '?Fraction'\n]\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 const createTyped = /* #__PURE__ */ factory('typed', dependencies, function createTyped ({ BigNumber, Complex, DenseMatrix, Fraction }) {\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  const typed = _createTyped()\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.types = [\n    { name: 'number', test: isNumber },\n    { name: 'Complex', test: isComplex },\n    { name: 'BigNumber', test: isBigNumber },\n    { name: 'Fraction', test: isFraction },\n    { name: 'Unit', test: isUnit },\n    { name: 'string', test: isString },\n    { name: 'Chain', test: isChain },\n    { name: 'Array', test: isArray },\n    { name: 'Matrix', test: isMatrix },\n    { name: 'DenseMatrix', test: isDenseMatrix },\n    { name: 'SparseMatrix', test: isSparseMatrix },\n    { name: 'Range', test: isRange },\n    { name: 'Index', test: isIndex },\n    { name: 'boolean', test: isBoolean },\n    { name: 'ResultSet', test: isResultSet },\n    { name: 'Help', test: isHelp },\n    { name: 'function', test: isFunction },\n    { name: 'Date', test: isDate },\n    { name: 'RegExp', test: isRegExp },\n    { name: 'null', test: isNull },\n    { name: 'undefined', test: isUndefined },\n\n    { name: 'AccessorNode', test: isAccessorNode },\n    { name: 'ArrayNode', test: isArrayNode },\n    { name: 'AssignmentNode', test: isAssignmentNode },\n    { name: 'BlockNode', test: isBlockNode },\n    { name: 'ConditionalNode', test: isConditionalNode },\n    { name: 'ConstantNode', test: isConstantNode },\n    { name: 'FunctionNode', test: isFunctionNode },\n    { name: 'FunctionAssignmentNode', test: isFunctionAssignmentNode },\n    { name: 'IndexNode', test: isIndexNode },\n    { name: 'Node', test: isNode },\n    { name: 'ObjectNode', test: isObjectNode },\n    { name: 'OperatorNode', test: isOperatorNode },\n    { name: 'ParenthesisNode', test: isParenthesisNode },\n    { name: 'RangeNode', test: isRangeNode },\n    { name: 'SymbolNode', test: isSymbolNode },\n\n    { name: 'Map', test: isMap },\n    { name: 'Object', test: isObject } // order 'Object' last, it matches on other classes too\n  ]\n\n  typed.conversions = [\n    {\n      from: 'number',\n      to: 'BigNumber',\n      convert: function (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 ' +\n            '(value: ' + x + '). ' +\n            '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 (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\n\n        return new Complex(x, 0)\n      }\n    }, {\n      from: 'number',\n      to: 'string',\n      convert: function (x) {\n        return x + ''\n      }\n    }, {\n      from: 'BigNumber',\n      to: 'Complex',\n      convert: function (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\n\n        return new Complex(x.toNumber(), 0)\n      }\n    }, {\n      from: 'Fraction',\n      to: 'BigNumber',\n      convert: function (x) {\n        throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' +\n          '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 (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\n\n        return new Complex(x.valueOf(), 0)\n      }\n    }, {\n      from: 'number',\n      to: 'Fraction',\n      convert: function (x) {\n        if (!Fraction) {\n          throwNoFraction(x)\n        }\n\n        const 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 ' +\n            '(value: ' + x + '). ' +\n            '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 (x) {\n        const 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 (x) {\n        if (!BigNumber) {\n          throwNoBignumber(x)\n        }\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 (x) {\n        if (!Fraction) {\n          throwNoFraction(x)\n        }\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 (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\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 (x) {\n        return +x\n      }\n    }, {\n      from: 'boolean',\n      to: 'BigNumber',\n      convert: function (x) {\n        if (!BigNumber) {\n          throwNoBignumber(x)\n        }\n\n        return new BigNumber(+x)\n      }\n    }, {\n      from: 'boolean',\n      to: 'Fraction',\n      convert: function (x) {\n        if (!Fraction) {\n          throwNoFraction(x)\n        }\n\n        return new Fraction(+x)\n      }\n    }, {\n      from: 'boolean',\n      to: 'string',\n      convert: function (x) {\n        return String(x)\n      }\n    }, {\n      from: 'Array',\n      to: 'Matrix',\n      convert: function (array) {\n        if (!DenseMatrix) {\n          throwNoMatrix()\n        }\n\n        return new DenseMatrix(array)\n      }\n    }, {\n      from: 'Matrix',\n      to: 'Array',\n      convert: function (matrix) {\n        return matrix.valueOf()\n      }\n    }\n  ]\n\n  return typed\n})\n\nfunction throwNoBignumber (x) {\n  throw new Error(`Cannot convert value ${x} into a BigNumber: no class 'BigNumber' provided`)\n}\n\nfunction throwNoComplex (x) {\n  throw new Error(`Cannot convert value ${x} into a Complex number: no class 'Complex' provided`)\n}\n\nfunction throwNoMatrix () {\n  throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided')\n}\n\nfunction throwNoFraction (x) {\n  throw new Error(`Cannot convert value ${x} into a Fraction, no class 'Fraction' provided.`)\n}\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'ResultSet'\nconst dependencies = []\n\nexport const createResultSet = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * A ResultSet contains a list or results\n   * @class ResultSet\n   * @param {Array} entries\n   * @constructor ResultSet\n   */\n  function ResultSet (entries) {\n    if (!(this instanceof ResultSet)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this.entries = entries || []\n  }\n\n  /**\n   * Attach type information\n   */\n  ResultSet.prototype.type = 'ResultSet'\n  ResultSet.prototype.isResultSet = true\n\n  /**\n   * Returns the array with results hold by this ResultSet\n   * @memberof ResultSet\n   * @returns {Array} entries\n   */\n  ResultSet.prototype.valueOf = function () {\n    return this.entries\n  }\n\n  /**\n   * Returns the stringified results of the ResultSet\n   * @memberof ResultSet\n   * @returns {string} string\n   */\n  ResultSet.prototype.toString = function () {\n    return '[' + this.entries.join(', ') + ']'\n  }\n\n  /**\n   * Get a JSON representation of the ResultSet\n   * @memberof ResultSet\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n   */\n  ResultSet.prototype.toJSON = function () {\n    return {\n      mathjs: 'ResultSet',\n      entries: this.entries\n    }\n  }\n\n  /**\n   * Instantiate a ResultSet from a JSON object\n   * @memberof ResultSet\n   * @param {Object} json  A JSON object structured as:\n   *                       `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n   * @return {ResultSet}\n   */\n  ResultSet.fromJSON = function (json) {\n    return new ResultSet(json.entries)\n  }\n\n  return ResultSet\n}, { isClass: true })\n","import Decimal from 'decimal.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'BigNumber'\nconst dependencies = ['?on', 'config']\n\nexport const createBigNumberClass = /* #__PURE__ */ factory(name, dependencies, ({ on, config }) => {\n  const BigNumber = Decimal.clone({ precision: config.precision, modulo: Decimal.EUCLID })\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\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({ precision: curr.precision })\n      }\n    })\n  }\n\n  return BigNumber\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'\n\nconst name = 'Complex'\nconst dependencies = []\n\nexport const createComplexClass = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\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    let str = ''\n    let im = this.im\n    let re = this.re\n    const strRe = format(this.re, options)\n    const strIm = format(this.im, options)\n\n    // round either re or im when smaller than the configured precision\n    const precision = isNumber(options) ? options : options ? options.precision : null\n    if (precision !== null) {\n      const 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\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        const 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        const r = arguments[0]\n        let 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\n          if (isNumber(phi)) {\n            return new Complex({ r: r, phi: 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\n      default:\n        throw new SyntaxError('Wrong number of arguments in function fromPolar')\n    }\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) { return 1 }\n    if (a.re < b.re) { return -1 }\n\n    if (a.im > b.im) { return 1 }\n    if (a.im < b.im) { return -1 }\n\n    return 0\n  }\n\n  return Complex\n}, { isClass: true })\n","import Fraction from 'fraction.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Fraction'\nconst dependencies = []\n\nexport const createFractionClass = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\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\n  return Fraction\n}, { isClass: true })\n","import { isBigNumber } from '../../utils/is.js'\nimport { format, sign } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Range'\nconst dependencies = []\n\nexport const createRangeClass = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Create a range. A range has a start, step, and end, and contains functions\n   * to iterate over the range.\n   *\n   * A range can be constructed as:\n   *\n   *     const range = new Range(start, end)\n   *     const range = new Range(start, end, step)\n   *\n   * To get the result of the range:\n   *     range.forEach(function (x) {\n   *         console.log(x)\n   *     })\n   *     range.map(function (x) {\n   *         return math.sin(x)\n   *     })\n   *     range.toArray()\n   *\n   * Example usage:\n   *\n   *     const c = new Range(2, 6)       // 2:1:5\n   *     c.toArray()                     // [2, 3, 4, 5]\n   *     const d = new Range(2, -3, -1)  // 2:-1:-2\n   *     d.toArray()                     // [2, 1, 0, -1, -2]\n   *\n   * @class Range\n   * @constructor Range\n   * @param {number} start  included lower bound\n   * @param {number} end    excluded upper bound\n   * @param {number} [step] step size, default value is 1\n   */\n  function Range (start, end, step) {\n    if (!(this instanceof Range)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    const hasStart = start !== null && start !== undefined\n    const hasEnd = end !== null && end !== undefined\n    const hasStep = step !== null && step !== undefined\n\n    if (hasStart) {\n      if (isBigNumber(start)) {\n        start = start.toNumber()\n      } else if (typeof start !== 'number') {\n        throw new TypeError('Parameter start must be a number')\n      }\n    }\n    if (hasEnd) {\n      if (isBigNumber(end)) {\n        end = end.toNumber()\n      } else if (typeof end !== 'number') {\n        throw new TypeError('Parameter end must be a number')\n      }\n    }\n    if (hasStep) {\n      if (isBigNumber(step)) {\n        step = step.toNumber()\n      } else if (typeof step !== 'number') {\n        throw new TypeError('Parameter step must be a number')\n      }\n    }\n\n    this.start = hasStart ? parseFloat(start) : 0\n    this.end = hasEnd ? parseFloat(end) : 0\n    this.step = hasStep ? parseFloat(step) : 1\n  }\n\n  /**\n   * Attach type information\n   */\n  Range.prototype.type = 'Range'\n  Range.prototype.isRange = true\n\n  /**\n   * Parse a string into a range,\n   * The string contains the start, optional step, and end, separated by a colon.\n   * If the string does not contain a valid range, null is returned.\n   * For example str='0:2:11'.\n   * @memberof Range\n   * @param {string} str\n   * @return {Range | null} range\n   */\n  Range.parse = function (str) {\n    if (typeof str !== 'string') {\n      return null\n    }\n\n    const args = str.split(':')\n    const nums = args.map(function (arg) {\n      return parseFloat(arg)\n    })\n\n    const invalid = nums.some(function (num) {\n      return isNaN(num)\n    })\n    if (invalid) {\n      return null\n    }\n\n    switch (nums.length) {\n      case 2:\n        return new Range(nums[0], nums[1])\n      case 3:\n        return new Range(nums[0], nums[2], nums[1])\n      default:\n        return null\n    }\n  }\n\n  /**\n   * Create a clone of the range\n   * @return {Range} clone\n   */\n  Range.prototype.clone = function () {\n    return new Range(this.start, this.end, this.step)\n  }\n\n  /**\n   * Retrieve the size of the range.\n   * Returns an array containing one number, the number of elements in the range.\n   * @memberof Range\n   * @returns {number[]} size\n   */\n  Range.prototype.size = function () {\n    let len = 0\n    const start = this.start\n    const step = this.step\n    const end = this.end\n    const diff = end - start\n\n    if (sign(step) === sign(diff)) {\n      len = Math.ceil((diff) / step)\n    } else if (diff === 0) {\n      len = 0\n    }\n\n    if (isNaN(len)) {\n      len = 0\n    }\n    return [len]\n  }\n\n  /**\n   * Calculate the minimum value in the range\n   * @memberof Range\n   * @return {number | undefined} min\n   */\n  Range.prototype.min = function () {\n    const size = this.size()[0]\n\n    if (size > 0) {\n      if (this.step > 0) {\n        // positive step\n        return this.start\n      } else {\n        // negative step\n        return this.start + (size - 1) * this.step\n      }\n    } else {\n      return undefined\n    }\n  }\n\n  /**\n   * Calculate the maximum value in the range\n   * @memberof Range\n   * @return {number | undefined} max\n   */\n  Range.prototype.max = function () {\n    const size = this.size()[0]\n\n    if (size > 0) {\n      if (this.step > 0) {\n        // positive step\n        return this.start + (size - 1) * this.step\n      } else {\n        // negative step\n        return this.start\n      }\n    } else {\n      return undefined\n    }\n  }\n\n  /**\n   * Execute a callback function for each value in the range.\n   * @memberof Range\n   * @param {function} callback   The callback method is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Range being traversed.\n   */\n  Range.prototype.forEach = function (callback) {\n    let x = this.start\n    const step = this.step\n    const end = this.end\n    let i = 0\n\n    if (step > 0) {\n      while (x < end) {\n        callback(x, [i], this)\n        x += step\n        i++\n      }\n    } else if (step < 0) {\n      while (x > end) {\n        callback(x, [i], this)\n        x += step\n        i++\n      }\n    }\n  }\n\n  /**\n   * Execute a callback function for each value in the Range, and return the\n   * results as an array\n   * @memberof Range\n   * @param {function} callback   The callback method is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @returns {Array} array\n   */\n  Range.prototype.map = function (callback) {\n    const array = []\n    this.forEach(function (value, index, obj) {\n      array[index[0]] = callback(value, index, obj)\n    })\n    return array\n  }\n\n  /**\n   * Create an Array with a copy of the Ranges data\n   * @memberof Range\n   * @returns {Array} array\n   */\n  Range.prototype.toArray = function () {\n    const array = []\n    this.forEach(function (value, index) {\n      array[index[0]] = value\n    })\n    return array\n  }\n\n  /**\n   * Get the primitive value of the Range, a one dimensional array\n   * @memberof Range\n   * @returns {Array} array\n   */\n  Range.prototype.valueOf = function () {\n    // TODO: implement a caching mechanism for range.valueOf()\n    return this.toArray()\n  }\n\n  /**\n   * Get a string representation of the range, with optional formatting options.\n   * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'\n   * @memberof Range\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  Range.prototype.format = function (options) {\n    let str = format(this.start, options)\n\n    if (this.step !== 1) {\n      str += ':' + format(this.step, options)\n    }\n    str += ':' + format(this.end, options)\n    return str\n  }\n\n  /**\n   * Get a string representation of the range.\n   * @memberof Range\n   * @returns {string}\n   */\n  Range.prototype.toString = function () {\n    return this.format()\n  }\n\n  /**\n   * Get a JSON representation of the range\n   * @memberof Range\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n   */\n  Range.prototype.toJSON = function () {\n    return {\n      mathjs: 'Range',\n      start: this.start,\n      end: this.end,\n      step: this.step\n    }\n  }\n\n  /**\n   * Instantiate a Range from a JSON object\n   * @memberof Range\n   * @param {Object} json A JSON object structured as:\n   *                      `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n   * @return {Range}\n   */\n  Range.fromJSON = function (json) {\n    return new Range(json.start, json.end, json.step)\n  }\n\n  return Range\n}, { isClass: true })\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'Matrix'\nconst dependencies = []\n\nexport const 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\n  return Matrix\n}, { isClass: true })\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'\n\nconst name = 'DenseMatrix'\nconst dependencies = [\n  'Matrix'\n]\n\nexport const createDenseMatrixClass = /* #__PURE__ */ factory(name, dependencies, ({ Matrix }) => {\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)) { throw new SyntaxError('Constructor must be called with the new operator') }\n    if (datatype && !isString(datatype)) { 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\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  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\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)) { throw new TypeError('Array expected') }\n    if (index.length !== this._size.length) { throw new DimensionError(index.length, this._size.length) }\n\n    // check index\n    for (let x = 0; x < index.length; x++) { validateIndex(index[x], this._size[x]) }\n\n    let data = this._data\n    for (let i = 0, ii = index.length; i < ii; i++) {\n      const indexI = index[i]\n      validateIndex(indexI, data.length)\n      data = data[indexI]\n    }\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)) { throw new TypeError('Array expected') }\n    if (index.length < this._size.length) { throw new DimensionError(index.length, this._size.length, '<') }\n\n    let i, ii, indexI\n\n    // enlarge matrix when needed\n    const size = index.map(function (i) {\n      return i + 1\n    })\n    _fit(this, size, defaultValue)\n\n    // traverse over the dimensions\n    let 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\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\n    const isScalar = index.isScalar()\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min())\n    } else {\n      // validate dimensions\n      const 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      const min = index.min()\n      const max = index.max()\n      for (let 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    const last = (dim === dims - 1)\n    const range = index.dimension(dim)\n\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        const 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    const iSize = index.size()\n    const isScalar = index.isScalar()\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    let sSize\n    if (isMatrix(submatrix)) {\n      sSize = submatrix.size()\n      submatrix = submatrix.valueOf()\n    } else {\n      sSize = arraySize(submatrix)\n    }\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\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\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        let i = 0\n        let 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      const size = index.max().map(function (i) {\n        return i + 1\n      })\n      _fit(matrix, size, defaultValue)\n\n      // insert the sub matrix\n      const dims = iSize.length\n      const dim = 0\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim)\n    }\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    const last = (dim === dims - 1)\n    const range = index.dimension(dim)\n\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    const sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1\n        ? value[0]\n        : value\n    })\n\n    // matrix to resize\n    const m = copy ? this.clone() : this\n    // resize matrix\n    return _resize(m, sizeArray, defaultValue)\n  }\n\n  function _resize (matrix, size, defaultValue) {\n    // check size\n    if (size.length === 0) {\n      // first value in matrix\n      let 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    const m = copy ? this.clone() : this\n\n    m._data = reshape(m._data, size)\n    const 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    const // copy the array\n      newSize = matrix._size.slice(0)\n\n    let 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 (let 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\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    const 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    const me = this\n    const recurse = function (value, index) {\n      if (isArray(value)) {\n        return value.map(function (child, i) {\n          return recurse(child, index.concat(i))\n        })\n      } else {\n        return callback(value, index, me)\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    const data = recurse(this._data, [])\n    const datatype = this._datatype !== undefined\n      ? getArrayDataType(data, typeOf)\n      : 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    const me = this\n    const recurse = function (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    const recurse = function * (value, index) {\n      if (isArray(value)) {\n        for (let i = 0; i < value.length; i++) {\n          yield * recurse(value[i], index.concat(i))\n        }\n      } else {\n        yield ({ value, index })\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    const result = []\n\n    const s = this.size()\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.')\n    }\n\n    const data = this._data\n    for (const row of data) {\n      result.push(new DenseMatrix([row], this._datatype))\n    }\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    const result = []\n\n    const s = this.size()\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.')\n    }\n\n    const data = this._data\n    for (let i = 0; i < s[1]; i++) {\n      const col = data.map(row => [row[i]])\n      result.push(new DenseMatrix(col, this._datatype))\n    }\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)) { k = k.toNumber() }\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    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows & columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n\n    // number diagonal values\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // x is a matrix get diagonal from matrix\n    const data = []\n\n    // loop rows\n    for (let 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: 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)) { throw new TypeError('Array expected, size parameter') }\n    if (size.length !== 2) { throw new Error('Only two dimensions matrix are supported') }\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)) { k = k.toNumber() }\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    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows and columns\n    const rows = size[0]\n    const columns = size[1]\n\n    // number of non-zero items\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // value extraction function\n    let _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 (i) {\n        // return value @ i\n        return value[i]\n      }\n    } else if (isMatrix(value)) {\n      // matrix size\n      const 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 (i) {\n        // return value @ i\n        return value.get([i])\n      }\n    } else {\n      // define function\n      _value = function () {\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))\n        ? _value(0).mul(0) // trick to create a BigNumber with value zero\n        : 0\n    }\n\n    // empty array\n    let 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 (let 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: 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    const 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 (let i = 0, ii = data.length; i < ii; i++) {\n      const 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\n    return data\n  }\n\n  return DenseMatrix\n}, { isClass: true })\n","import { clone as objectClone } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'clone'\nconst dependencies = ['typed']\n\nexport const createClone = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Clone an object. Will make a deep copy of the data.\n   *\n   * Syntax:\n   *\n   *     math.clone(x)\n   *\n   * Examples:\n   *\n   *    math.clone(3.5)                   // returns number 3.5\n   *    math.clone(math.complex('2-4i') // returns Complex 2 - 4i\n   *    math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg\n   *    math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]\n   *    math.clone(\"hello world\")         // returns string \"hello world\"\n   *\n   * @param {*} x   Object to be cloned\n   * @return {*} A clone of object x\n   */\n  return typed(name, {\n    any: objectClone\n  })\n})\n","/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nexport function _switch (mat) {\n  const I = mat.length\n  const J = mat[0].length\n  let i, j\n  const ret = []\n  for (j = 0; j < J; j++) {\n    const tmp = []\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j])\n    }\n    ret.push(tmp)\n  }\n  return ret\n}\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 (let 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\n  for (let i = 0, ii = array.length; i < ii; i++) {\n    const value = array[i]\n\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  const 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\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  let i, ret, val, tran\n\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  const avalues = a._values\n  const aindex = a._index\n  const aptr = a._ptr\n\n  // vars\n  let 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}\n","import { deepMap } from '../../utils/collection.js'\nimport { isInteger as isIntegerNumber } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'isInteger'\nconst dependencies = ['typed']\n\nexport const createIsInteger = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is an integer number.\n   * The function supports `number`, `BigNumber`, and `Fraction`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isInteger(x)\n   *\n   * Examples:\n   *\n   *    math.isInteger(2)                     // returns true\n   *    math.isInteger(0)                     // returns true\n   *    math.isInteger(0.5)                   // returns false\n   *    math.isInteger(math.bignumber(500))   // returns true\n   *    math.isInteger(math.fraction(4))      // returns true\n   *    math.isInteger('3')                   // returns true\n   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]\n   *    math.isInteger(math.complex('2-4i')   // throws an error\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isZero\n   *\n   * @param {number | BigNumber | Fraction | Array | Matrix} x   Value to be tested\n   * @return {boolean}  Returns true when `x` contains a numeric, integer value.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isIntegerNumber, // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n\n    BigNumber: function (x) {\n      return x.isInt()\n    },\n\n    Fraction: function (x) {\n      return x.d === 1 && isFinite(x.n)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { isInteger } from '../../utils/number.js'\n\nconst n1 = 'number'\n\nexport function isIntegerNumber (x) {\n  return isInteger(x)\n}\nisIntegerNumber.signature = n1\n\nexport function isNegativeNumber (x) {\n  return x < 0\n}\nisNegativeNumber.signature = n1\n\nexport function isPositiveNumber (x) {\n  return x > 0\n}\nisPositiveNumber.signature = n1\n\nexport function isZeroNumber (x) {\n  return x === 0\n}\nisZeroNumber.signature = n1\n\nexport function isNaNNumber (x) {\n  return Number.isNaN(x)\n}\nisNaNNumber.signature = n1\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { isNegativeNumber } from '../../plain/number/index.js'\n\nconst name = 'isNegative'\nconst dependencies = ['typed']\n\nexport const createIsNegative = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is negative: smaller than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNegative(x)\n   *\n   * Examples:\n   *\n   *    math.isNegative(3)                     // returns false\n   *    math.isNegative(-2)                    // returns true\n   *    math.isNegative(0)                     // returns false\n   *    math.isNegative(-0)                    // returns false\n   *    math.isNegative(math.bignumber(2))     // returns false\n   *    math.isNegative(math.fraction(-2, 5))  // returns true\n   *    math.isNegative('-2')                  // returns true\n   *    math.isNegative([2, 0, -3]')           // returns [false, false, true]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isZero, isInteger\n   *\n   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isNegativeNumber,\n\n    BigNumber: function (x) {\n      return x.isNeg() && !x.isZero() && !x.isNaN()\n    },\n\n    Fraction: function (x) {\n      return x.s < 0 // It's enough to decide on the sign\n    },\n\n    Unit: function (x) {\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'isNumeric'\nconst dependencies = ['typed']\n\nexport const createIsNumeric = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is an numeric value.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNumeric(x)\n   *\n   * Examples:\n   *\n   *    math.isNumeric(2)                     // returns true\n   *    math.isNumeric('2')                   // returns false\n   *    math.hasNumericValue('2')             // returns true\n   *    math.isNumeric(0)                     // returns true\n   *    math.isNumeric(math.bignumber(500))   // returns true\n   *    math.isNumeric(math.fraction(4))      // returns true\n   *    math.isNumeric(math.complex('2-4i')   // returns false\n   *    math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    isZero, isPositive, isNegative, isInteger, hasNumericValue\n   *\n   * @param {*} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,\n   *                    `Fraction`, or `boolean`. Returns false for other types.\n   *                    Throws an error in case of unknown types.\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction | boolean': function () {\n      return true\n    },\n\n    'Complex | Unit | string | null | undefined | Node': function () {\n      return false\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'hasNumericValue'\nconst dependencies = ['typed', 'isNumeric']\n\nexport const createHasNumericValue = /* #__PURE__ */ factory(name, dependencies, ({ typed, isNumeric }) => {\n  /**\n   * Test whether a value is an numeric value.\n   *\n   * In case of a string, true is returned if the string contains a numeric value.\n   *\n   * Syntax:\n   *\n   *     math.hasNumericValue(x)\n   *\n   * Examples:\n   *\n   *    math.hasNumericValue(2)                     // returns true\n   *    math.hasNumericValue('2')                   // returns true\n   *    math.isNumeric('2')                         // returns false\n   *    math.hasNumericValue(0)                     // returns true\n   *    math.hasNumericValue(math.bignumber(500))   // returns true\n   *    math.hasNumericValue(math.fraction(4))      // returns true\n   *    math.hasNumericValue(math.complex('2-4i')   // returns false\n   *    math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    isZero, isPositive, isNegative, isInteger, isNumeric\n   *\n   * @param {*} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,\n   *                    `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.\n   *                    Throws an error in case of unknown types.\n   */\n  return typed(name, {\n    string: function (x) {\n      return x.trim().length > 0 && !isNaN(Number(x))\n    },\n    any: function (x) {\n      return isNumeric(x)\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { isPositiveNumber } from '../../plain/number/index.js'\n\nconst name = 'isPositive'\nconst dependencies = ['typed']\n\nexport const createIsPositive = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is positive: larger than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPositive(x)\n   *\n   * Examples:\n   *\n   *    math.isPositive(3)                     // returns true\n   *    math.isPositive(-2)                    // returns false\n   *    math.isPositive(0)                     // returns false\n   *    math.isPositive(-0)                    // returns false\n   *    math.isPositive(0.5)                   // returns true\n   *    math.isPositive(math.bignumber(2))     // returns true\n   *    math.isPositive(math.fraction(-2, 5))  // returns false\n   *    math.isPositive(math.fraction(1,3))    // returns false\n   *    math.isPositive('2')                   // returns true\n   *    math.isPositive([2, 0, -3])            // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isPositiveNumber,\n\n    BigNumber: function (x) {\n      return !x.isNeg() && !x.isZero() && !x.isNaN()\n    },\n\n    Fraction: function (x) {\n      return x.s > 0 && x.n > 0\n    },\n\n    Unit: function (x) {\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { isZeroNumber } from '../../plain/number/index.js'\n\nconst name = 'isZero'\nconst dependencies = ['typed']\n\nexport const createIsZero = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is zero.\n   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,\n   * `Complex`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isZero(x)\n   *\n   * Examples:\n   *\n   *    math.isZero(0)                     // returns true\n   *    math.isZero(2)                     // returns false\n   *    math.isZero(0.5)                   // returns false\n   *    math.isZero(math.bignumber(0))     // returns true\n   *    math.isZero(math.fraction(0))      // returns true\n   *    math.isZero(math.fraction(1,3))    // returns false\n   *    math.isZero(math.complex('2 - 4i') // returns false\n   *    math.isZero(math.complex('0i')     // returns true\n   *    math.isZero('0')                   // returns true\n   *    math.isZero('2')                   // returns false\n   *    math.isZero([2, 0, -3]')           // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isZeroNumber,\n\n    BigNumber: function (x) {\n      return x.isZero()\n    },\n\n    Complex: function (x) {\n      return x.re === 0 && x.im === 0\n    },\n\n    Fraction: function (x) {\n      return x.d === 1 && x.n === 0\n    },\n\n    Unit: function (x) {\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { isNaNNumber } from '../../plain/number/index.js'\n\nconst name = 'isNaN'\nconst dependencies = ['typed']\n\nexport const createIsNaN = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is NaN (not a number).\n   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNaN(x)\n   *\n   * Examples:\n   *\n   *    math.isNaN(3)                     // returns false\n   *    math.isNaN(NaN)                   // returns true\n   *    math.isNaN(0)                     // returns false\n   *    math.isNaN(math.bignumber(NaN))   // returns true\n   *    math.isNaN(math.bignumber(0))     // returns false\n   *    math.isNaN(math.fraction(-2, 5))  // returns false\n   *    math.isNaN('-2')                  // returns false\n   *    math.isNaN([2, 0, -3, NaN]')      // returns [false, false, false, true]\n   *\n   * See also:\n   *\n   *    isNumeric, isNegative, isPositive, isZero, isInteger\n   *\n   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is NaN.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isNaNNumber,\n\n    BigNumber: function (x) {\n      return x.isNaN()\n    },\n\n    Fraction: function (x) {\n      return false\n    },\n\n    Complex: function (x) {\n      return x.isNaN()\n    },\n\n    Unit: function (x) {\n      return Number.isNaN(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, Number.isNaN)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { typeOf as _typeOf } from '../../utils/is.js'\n\nconst name = 'typeOf'\nconst dependencies = ['typed']\n\nexport const createTypeOf = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Determine the type of a variable.\n   *\n   * Function `typeOf` recognizes the following types of objects:\n   *\n   * Object                 | Returns       | Example\n   * ---------------------- | ------------- | ------------------------------------------\n   * null                   | `'null'`      | `math.typeOf(null)`\n   * number                 | `'number'`    | `math.typeOf(3.5)`\n   * boolean                | `'boolean'`   | `math.typeOf(true)`\n   * string                 | `'string'`    | `math.typeOf('hello world')`\n   * Array                  | `'Array'`     | `math.typeOf([1, 2, 3])`\n   * Date                   | `'Date'`      | `math.typeOf(new Date())`\n   * Function               | `'Function'`  | `math.typeOf(function () {})`\n   * Object                 | `'Object'`    | `math.typeOf({a: 2, b: 3})`\n   * RegExp                 | `'RegExp'`    | `math.typeOf(/a regexp/)`\n   * undefined              | `'undefined'` | `math.typeOf(undefined)`\n   * math.BigNumber         | `'BigNumber'` | `math.typeOf(math.bignumber('2.3e500'))`\n   * math.Chain             | `'Chain'`     | `math.typeOf(math.chain(2))`\n   * math.Complex           | `'Complex'`   | `math.typeOf(math.complex(2, 3))`\n   * math.Fraction          | `'Fraction'`  | `math.typeOf(math.fraction(1, 3))`\n   * math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`\n   * math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`\n   * math.Index             | `'Index'`     | `math.typeOf(math.index(1, 3))`\n   * math.Matrix            | `'Matrix'`    | `math.typeOf(math.matrix([[1,2], [3, 4]]))`\n   * math.Range             | `'Range'`     | `math.typeOf(math.range(0, 10))`\n   * math.ResultSet         | `'ResultSet'` | `math.typeOf(math.evaluate('a=2\\nb=3'))`\n   * math.Unit              | `'Unit'`      | `math.typeOf(math.unit('45 deg'))`\n   * math.AccessorNode            | `'AccessorNode'`            | `math.typeOf(math.parse('A[2]'))`\n   * math.ArrayNode               | `'ArrayNode'`               | `math.typeOf(math.parse('[1,2,3]'))`\n   * math.AssignmentNode          | `'AssignmentNode'`          | `math.typeOf(math.parse('x=2'))`\n   * math.BlockNode               | `'BlockNode'`               | `math.typeOf(math.parse('a=2; b=3'))`\n   * math.ConditionalNode         | `'ConditionalNode'`         | `math.typeOf(math.parse('x<0 ? -x : x'))`\n   * math.ConstantNode            | `'ConstantNode'`            | `math.typeOf(math.parse('2.3'))`\n   * math.FunctionAssignmentNode  | `'FunctionAssignmentNode'`  | `math.typeOf(math.parse('f(x)=x^2'))`\n   * math.FunctionNode            | `'FunctionNode'`            | `math.typeOf(math.parse('sqrt(4)'))`\n   * math.IndexNode               | `'IndexNode'`               | `math.typeOf(math.parse('A[2]').index)`\n   * math.ObjectNode              | `'ObjectNode'`              | `math.typeOf(math.parse('{a:2}'))`\n   * math.ParenthesisNode         | `'ParenthesisNode'`         | `math.typeOf(math.parse('(2+3)'))`\n   * math.RangeNode               | `'RangeNode'`               | `math.typeOf(math.parse('1:10'))`\n   * math.SymbolNode              | `'SymbolNode'`              | `math.typeOf(math.parse('x'))`\n   *\n   * Syntax:\n   *\n   *    math.typeOf(x)\n   *\n   * Examples:\n   *\n   *    math.typeOf(3.5)                     // returns 'number'\n   *    math.typeOf(math.complex('2-4i'))    // returns 'Complex'\n   *    math.typeOf(math.unit('45 deg'))     // returns 'Unit'\n   *    math.typeOf('hello world')           // returns 'string'\n   *\n   * @param {*} x     The variable for which to test the type.\n   * @return {string} Returns the name of the type. Primitive types are lower case,\n   *                  non-primitive types are upper-camel-case.\n   *                  For example 'number', 'string', 'Array', 'Date'.\n   */\n  return typed(name, {\n    any: _typeOf\n  })\n})\n","/**\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    const diff = x.minus(y).abs()\n    if (diff.isZero()) {\n      return true\n    } else {\n      // use relative error\n      const 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}\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'\n\nconst name = 'equalScalar'\nconst dependencies = ['typed', 'config']\n\nexport const createEqualScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed, config }) => {\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\n    'boolean, boolean': function (x, y) {\n      return x === y\n    },\n\n    'number, number': function (x, y) {\n      return nearlyEqual(x, y, config.epsilon)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.equals(y)\n    },\n\n    'Complex, Complex': function (x, y) {\n      return complexEquals(x, y, config.epsilon)\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base')\n      }\n      return this(x.value, y.value)\n    }\n  })\n})\n\nexport const createEqualScalarNumber = factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return nearlyEqual(x, y, config.epsilon)\n    }\n  })\n})\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}\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'\n\nconst name = 'SparseMatrix'\nconst dependencies = [\n  'typed',\n  'equalScalar',\n  'Matrix'\n]\n\nexport const createSparseMatrixClass = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar, Matrix }) => {\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)) { throw new SyntaxError('Constructor must be called with the new operator') }\n    if (datatype && !isString(datatype)) { 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\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\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    const rows = data.length\n    let columns = 0\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\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      let j = 0\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length)\n        // loop rows\n        for (let i = 0; i < rows; i++) {\n          // current row\n          const 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) { columns = row.length }\n            // check row has column\n            if (j < row.length) {\n              // value\n              const 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) { columns = 1 }\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      }\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\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  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    const rows = this._size[0]\n    const 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) { // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke subset on a Pattern only matrix') }\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\n      default:\n        throw new SyntaxError('Wrong number of arguments')\n    }\n  }\n\n  function _getsubset (matrix, idx) {\n    // check idx\n    if (!isIndex(idx)) {\n      throw new TypeError('Invalid index')\n    }\n\n    const isScalar = idx.isScalar()\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min())\n    }\n    // validate dimensions\n    const size = idx.size()\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length)\n    }\n\n    // vars\n    let i, ii, k, kk\n\n    // validate if any of the ranges in the index is out of range\n    const min = idx.min()\n    const 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    const mvalues = matrix._values\n    const mindex = matrix._index\n    const mptr = matrix._ptr\n\n    // rows & columns dimensions for result matrix\n    const rows = idx.dimension(0)\n    const columns = idx.dimension(1)\n\n    // workspace & permutation vector\n    const w = []\n    const 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    const values = mvalues ? [] : undefined\n    const index = []\n    const 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) { values.push(mvalues[k]) }\n        }\n      }\n    })\n    // update ptr\n    ptr.push(index.length)\n\n    // return matrix\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: size,\n      datatype: matrix._datatype\n    })\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    const iSize = index.size()\n    const isScalar = index.isScalar()\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    let 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        let i = 0\n        let 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        const 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        const firstDimensionRange = index.dimension(0)\n        const 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)) { throw new TypeError('Array expected') }\n    if (index.length !== this._size.length) { throw new DimensionError(index.length, this._size.length) }\n\n    // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke get on a Pattern only matrix') }\n\n    // row and column\n    const i = index[0]\n    const 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    const 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) { 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)) { throw new TypeError('Array expected') }\n    if (index.length !== this._size.length) { throw new DimensionError(index.length, this._size.length) }\n\n    // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke set on a Pattern only matrix') }\n\n    // row and column\n    const i = index[0]\n    const j = index[1]\n\n    // rows & columns\n    let rows = this._size[0]\n    let columns = this._size[1]\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\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    const 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      // insert value @ (i, j)\n      _insert(k, i, j, v, this._values, this._index, this._ptr)\n    }\n\n    return this\n  }\n\n  function _getValueIndex (i, top, bottom, index) {\n    // check row is on the bottom side\n    if (bottom - top === 0) { return bottom }\n    // loop rows [top, bottom[\n    for (let r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) { return r }\n    }\n    // we did not find row\n    return top\n  }\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 (let x = j + 1; x < ptr.length; x++) { 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 (let x = j + 1; x < ptr.length; x++) { ptr[x]++ }\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    const sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1\n        ? value[0]\n        : value\n    })\n\n    if (sizeArray.length !== 2) { throw new Error('Only two dimensions matrix are supported') }\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 ' +\n          '(size: ' + format(sizeArray) + ')')\n      }\n    })\n\n    // matrix to resize\n    const m = copy ? this.clone() : this\n    // resize matrix\n    return _resize(m, sizeArray[0], sizeArray[1], defaultValue)\n  }\n\n  function _resize (matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    let value = defaultValue || 0\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\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    const ins = !eq(value, zero)\n\n    // old columns and rows\n    const r = matrix._size[0]\n    let c = matrix._size[1]\n\n    let 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        let 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          let 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      let 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        const k0 = matrix._ptr[j]\n        const 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)) { throw new TypeError('Array expected') }\n    if (sizes.length !== 2) { throw new Error('Sparse matrices can only be reshaped in two dimensions') }\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 ' +\n          '(size: ' + format(sizes) + ')')\n      }\n    })\n\n    const currentLength = this._size[0] * this._size[1]\n    sizes = processSizesWildcard(sizes, currentLength)\n    const 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    const 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    const colIndex = []\n    for (let i = 0; i < m._ptr.length; i++) {\n      for (let j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i)\n      }\n    }\n\n    // Clone the values array\n    const values = m._values.slice()\n\n    // Clone the row index array\n    const rowIndex = m._index.slice()\n\n    // Transform the (row, column) indices\n    for (let i = 0; i < m._index.length; i++) {\n      const r1 = rowIndex[i]\n      const c1 = colIndex[i]\n      const 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 (let i = 0; i < m._ptr.length; i++) {\n      m._ptr[i] = 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 (let h = 0; h < values.length; h++) {\n      const i = rowIndex[h]\n      const j = colIndex[h]\n      const v = values[h]\n      const k = _getValueIndex(i, m._ptr[j], m._ptr[j + 1], m._index)\n      _insert(k, i, 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    const 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) { throw new Error('Cannot invoke map on a Pattern only matrix') }\n    // matrix instance\n    const me = this\n    // rows and columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n    // invoke callback\n    const invoke = function (v, i, j) {\n      // invoke callback\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    const values = []\n    const index = []\n    const ptr = []\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\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    const invoke = function (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 (let 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      const k0 = matrix._ptr[j]\n      const k1 = matrix._ptr[j + 1]\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (let k = k0; k < k1; k++) {\n          // row index\n          const 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        const values = {}\n        for (let k = k0; k < k1; k++) {\n          const i = matrix._index[k]\n          values[i] = 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 (let i = minRow; i <= maxRow; i++) {\n          const value = (i in values) ? values[i] : 0\n          invoke(value, i - 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: values,\n      index: index,\n      ptr: 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) { throw new Error('Cannot invoke forEach on a Pattern only matrix') }\n    // matrix instance\n    const me = this\n    // rows and columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (let k = k0; k < k1; k++) {\n          // row index\n          const 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        const values = {}\n        for (let k = k0; k < k1; k++) {\n          const i = this._index[k]\n          values[i] = this._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 (let i = 0; i < rows; i++) {\n          const value = (i in values) ? values[i] : 0\n          callback(value, [i, 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) { throw new Error('Cannot iterate a Pattern only matrix') }\n\n    const columns = this._size[1]\n\n    for (let j = 0; j < columns; j++) {\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n\n      for (let k = k0; k < k1; k++) {\n        // row index\n        const i = this._index[k]\n\n        yield ({ value: this._values[k], index: [i, j] })\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\n  function _toArray (values, index, ptr, size, copy) {\n    // rows and columns\n    const rows = size[0]\n    const columns = size[1]\n    // result\n    const a = []\n    // vars\n    let i, j\n    // initialize array\n    for (i = 0; i < rows; i++) {\n      a[i] = []\n      for (j = 0; j < columns; j++) { a[i][j] = 0 }\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      const k0 = ptr[j]\n      const k1 = ptr[j + 1]\n      // loop k within [k0, k1[\n      for (let 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    const rows = this._size[0]\n    const columns = this._size[1]\n    // density\n    const density = this.density()\n    // rows & columns\n    let str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n'\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n      // loop k within [k0, k1[\n      for (let k = k0; k < k1; k++) {\n        // row index\n        const 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)) { k = k.toNumber() }\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    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows & columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n\n    // number diagonal values\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // diagonal arrays\n    const values = []\n    const index = []\n    const ptr = []\n    // initial ptr value\n    ptr[0] = 0\n    // loop columns\n    for (let j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n      // loop x within [k0, k1[\n      for (let x = k0; x < k1; x++) {\n        // row index\n        const 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: values,\n      index: index,\n      ptr: 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)) { throw new TypeError('Array expected, size parameter') }\n    if (size.length !== 2) { throw new Error('Only two dimensions matrix are supported') }\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)) { k = k.toNumber() }\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    let eq = equalScalar\n    // zero value\n    let zero = 0\n\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    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows and columns\n    const rows = size[0]\n    const columns = size[1]\n\n    // number of non-zero items\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // value extraction function\n    let _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 (i) {\n        // return value @ i\n        return value[i]\n      }\n    } else if (isMatrix(value)) {\n      // matrix size\n      const 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 (i) {\n        // return value @ i\n        return value.get([i])\n      }\n    } else {\n      // define function\n      _value = function () {\n        // return value\n        return value\n      }\n    }\n\n    // create arrays\n    const values = []\n    const index = []\n    const ptr = []\n\n    // loop items\n    for (let j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length)\n      // diagonal index\n      const i = j - kSuper\n      // check we need to set diagonal value\n      if (i >= 0 && i < n) {\n        // get value @ i\n        const 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: values,\n      index: index,\n      ptr: 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    const k0 = ptr[j]\n    const k1 = ptr[j + 1]\n    // loop\n    for (let 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 (let j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = ptr[j]\n      const k1 = ptr[j + 1]\n      // find value index @ x\n      const kx = _getValueIndex(x, k0, k1, index)\n      // find value index @ x\n      const 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          const 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        const vx = values ? values[kx] : undefined\n        // insert value @ y\n        index.splice(ky, 0, y)\n        if (values) { values.splice(ky, 0, vx) }\n        // remove value @ x (adjust array index if needed)\n        index.splice(ky <= kx ? kx + 1 : kx, 1)\n        if (values) { values.splice(ky <= kx ? kx + 1 : kx, 1) }\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        const vy = values ? values[ky] : undefined\n        // insert value @ x\n        index.splice(kx, 0, x)\n        if (values) { values.splice(kx, 0, vy) }\n        // remove value @ y (adjust array index if needed)\n        index.splice(kx <= ky ? ky + 1 : ky, 1)\n        if (values) { values.splice(kx <= ky ? ky + 1 : ky, 1) }\n      }\n    }\n  }\n\n  return SparseMatrix\n}, { isClass: true })\n","import { factory } from '../utils/factory.js'\nimport { deepMap } from '../utils/collection.js'\n\nconst name = 'number'\nconst dependencies = ['typed']\n\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\nfunction getNonDecimalNumberParts (input) {\n  const nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/)\n  if (nonDecimalWithRadixMatch) {\n    const radix = ({ '0b': 2, '0o': 8, '0x': 16 })[nonDecimalWithRadixMatch[1]]\n    const integerPart = nonDecimalWithRadixMatch[2]\n    const fractionalPart = nonDecimalWithRadixMatch[3]\n    return { input, radix, integerPart, fractionalPart }\n  } else {\n    return null\n  }\n}\n\n/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\nfunction makeNumberFromNonDecimalParts (parts) {\n  const n = parseInt(parts.integerPart, parts.radix)\n  let f = 0\n  for (let i = 0; i < parts.fractionalPart.length; i++) {\n    const digitValue = parseInt(parts.fractionalPart[i], parts.radix)\n    f += digitValue / Math.pow(parts.radix, i + 1)\n  }\n  const result = n + f\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is no valid number')\n  }\n  return result\n}\n\nexport const createNumber = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a number or convert a string, boolean, or unit to a number.\n   * When value is a matrix, all elements will be converted to number.\n   *\n   * Syntax:\n   *\n   *    math.number(value)\n   *    math.number(unit, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.number(2)                         // returns number 2\n   *    math.number('7.2')                     // returns number 7.2\n   *    math.number(true)                      // returns number 1\n   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]\n   *    math.number(math.unit('52cm'), 'm')    // returns 0.52\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, string, unit\n   *\n   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted\n   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number\n   * @return {number | Array | Matrix} The created number\n   */\n  const number = typed('number', {\n    '': function () {\n      return 0\n    },\n\n    number: function (x) {\n      return x\n    },\n\n    string: function (x) {\n      if (x === 'NaN') return NaN\n      const nonDecimalNumberParts = getNonDecimalNumberParts(x)\n      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts)\n      }\n      let size = 0\n      const wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/)\n      if (wordSizeSuffixMatch) {\n        // x includes a size suffix like 0xffffi32, so we extract\n        // the suffix and remove it from x\n        size = Number(wordSizeSuffixMatch[2])\n        x = wordSizeSuffixMatch[1]\n      }\n      let num = Number(x)\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is no valid number')\n      }\n      if (wordSizeSuffixMatch) {\n        // x is a signed bin, oct, or hex literal\n        // num is the value of string x if x is interpreted as unsigned\n        if (num > 2 ** size - 1) {\n          // literal is too large for size suffix\n          throw new SyntaxError(`String \"${x}\" is out of range`)\n        }\n        // check if the bit at index size - 1 is set and if so do the twos complement\n        if (num >= 2 ** (size - 1)) {\n          num = num - 2 ** size\n        }\n      }\n      return num\n    },\n\n    BigNumber: function (x) {\n      return x.toNumber()\n    },\n\n    Fraction: function (x) {\n      return x.valueOf()\n    },\n\n    Unit: function (x) {\n      throw new Error('Second argument with valueless unit expected')\n    },\n\n    null: function (x) {\n      return 0\n    },\n\n    'Unit, string | Unit': function (unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n\n  // reviver function to parse a JSON object like:\n  //\n  //     {\"mathjs\":\"number\",\"value\":\"2.3\"}\n  //\n  // into a number 2.3\n  number.fromJSON = function (json) {\n    return parseFloat(json.value)\n  }\n\n  return number\n})\n","import { factory } from '../utils/factory.js'\nimport { deepMap } from '../utils/collection.js'\nimport { format } from '../utils/number.js'\n\nconst name = 'string'\nconst dependencies = ['typed']\n\nexport const createString = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a string or convert any object into a string.\n   * Elements of Arrays and Matrices are processed element wise.\n   *\n   * Syntax:\n   *\n   *    math.string(value)\n   *\n   * Examples:\n   *\n   *    math.string(4.2)               // returns string '4.2'\n   *    math.string(math.complex(3, 2) // returns string '3 + 2i'\n   *\n   *    const u = math.unit(5, 'km')\n   *    math.string(u.to('m'))         // returns string '5000 m'\n   *\n   *    math.string([true, false])     // returns ['true', 'false']\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, number, unit\n   *\n   * @param {* | Array | Matrix | null} [value]  A value to convert to a string\n   * @return {string | Array | Matrix} The created string\n   */\n  return typed(name, {\n    '': function () {\n      return ''\n    },\n\n    number: format,\n\n    null: function (x) {\n      return 'null'\n    },\n\n    boolean: function (x) {\n      return x + ''\n    },\n\n    string: function (x) {\n      return x\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    },\n\n    any: function (x) {\n      return String(x)\n    }\n  })\n})\n","import { factory } from '../utils/factory.js'\nimport { deepMap } from '../utils/collection.js'\n\nconst name = 'boolean'\nconst dependencies = ['typed']\n\nexport const createBoolean = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a boolean or convert a string or number to a boolean.\n   * In case of a number, `true` is returned for non-zero numbers, and `false` in\n   * case of zero.\n   * Strings can be `'true'` or `'false'`, or can contain a number.\n   * When value is a matrix, all elements will be converted to boolean.\n   *\n   * Syntax:\n   *\n   *    math.boolean(x)\n   *\n   * Examples:\n   *\n   *    math.boolean(0)     // returns false\n   *    math.boolean(1)     // returns true\n   *    math.boolean(-3)     // returns true\n   *    math.boolean('true')     // returns true\n   *    math.boolean('false')     // returns false\n   *    math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]\n   *\n   * See also:\n   *\n   *    bignumber, complex, index, matrix, string, unit\n   *\n   * @param {string | number | boolean | Array | Matrix | null} value  A value of any type\n   * @return {boolean | Array | Matrix} The boolean value\n   */\n  return typed(name, {\n    '': function () {\n      return false\n    },\n\n    boolean: function (x) {\n      return x\n    },\n\n    number: function (x) {\n      return !!x\n    },\n\n    null: function (x) {\n      return false\n    },\n\n    BigNumber: function (x) {\n      return !x.isZero()\n    },\n\n    string: function (x) {\n      // try case insensitive\n      const lcase = x.toLowerCase()\n      if (lcase === 'true') {\n        return true\n      } else if (lcase === 'false') {\n        return false\n      }\n\n      // test whether value is a valid number\n      const num = Number(x)\n      if (x !== '' && !isNaN(num)) {\n        return !!num\n      }\n\n      throw new Error('Cannot convert \"' + x + '\" to a boolean')\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'bignumber'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createBignumber = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Create a BigNumber, which can store numbers with arbitrary precision.\n   * When a matrix is provided, all elements will be converted to BigNumber.\n   *\n   * Syntax:\n   *\n   *    math.bignumber(x)\n   *\n   * Examples:\n   *\n   *    0.1 + 0.2                                  // returns number 0.30000000000000004\n   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3\n   *\n   *\n   *    7.2e500                                    // returns number Infinity\n   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500\n   *\n   * See also:\n   *\n   *    boolean, complex, index, matrix, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix | boolean | null} [value]  Value for the big number,\n   *                                                    0 by default.\n   * @returns {BigNumber} The created bignumber\n   */\n  return typed('bignumber', {\n    '': function () {\n      return new BigNumber(0)\n    },\n\n    number: function (x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new BigNumber(x + '')\n    },\n\n    string: function (x) {\n      const wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/)\n      if (wordSizeSuffixMatch) {\n        // x has a word size suffix\n        const size = wordSizeSuffixMatch[2]\n        const n = BigNumber(wordSizeSuffixMatch[1])\n        const twoPowSize = new BigNumber(2).pow(Number(size))\n        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(`String \"${x}\" is out of range`)\n        }\n        const twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1)\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize)\n        } else {\n          return n\n        }\n      }\n      return new BigNumber(x)\n    },\n\n    BigNumber: function (x) {\n      // we assume a BigNumber is immutable\n      return x\n    },\n\n    Fraction: function (x) {\n      return new BigNumber(x.n).div(x.d).times(x.s)\n    },\n\n    null: function (x) {\n      return new BigNumber(0)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'complex'\nconst dependencies = ['typed', 'Complex']\n\nexport const createComplex = /* #__PURE__ */ factory(name, dependencies, ({ typed, Complex }) => {\n  /**\n   * Create a complex value or convert a value to a complex value.\n   *\n   * Syntax:\n   *\n   *     math.complex()                           // creates a complex value with zero\n   *                                              // as real and imaginary part.\n   *     math.complex(re : number, im : string)   // creates a complex value with provided\n   *                                              // values for real and imaginary part.\n   *     math.complex(re : number)                // creates a complex value with provided\n   *                                              // real value and zero imaginary part.\n   *     math.complex(complex : Complex)          // clones the provided complex value.\n   *     math.complex(arg : string)               // parses a string into a complex value.\n   *     math.complex(array : Array)              // converts the elements of the array\n   *                                              // or matrix element wise into a\n   *                                              // complex value.\n   *     math.complex({re: number, im: number})   // creates a complex value with provided\n   *                                              // values for real an imaginary part.\n   *     math.complex({r: number, phi: number})   // creates a complex value with provided\n   *                                              // polar coordinates\n   *\n   * Examples:\n   *\n   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i\n   *    a.re = 5                          // a = Complex 5 - 4i\n   *    const i = a.im                    // Number -4\n   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i\n   *    const c = math.complex()          // Complex 0 + 0i\n   *    const d = math.add(a, b)          // Complex 5 + 2i\n   *\n   * See also:\n   *\n   *    bignumber, boolean, index, matrix, number, string, unit\n   *\n   * @param {* | Array | Matrix} [args]\n   *            Arguments specifying the real and imaginary part of the complex number\n   * @return {Complex | Array | Matrix} Returns a complex value\n   */\n  return typed('complex', {\n    '': function () {\n      return Complex.ZERO\n    },\n\n    number: function (x) {\n      return new Complex(x, 0)\n    },\n\n    'number, number': function (re, im) {\n      return new Complex(re, im)\n    },\n\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function (re, im) {\n      return new Complex(re.toNumber(), im.toNumber())\n    },\n\n    Fraction: function (x) {\n      return new Complex(x.valueOf(), 0)\n    },\n\n    Complex: function (x) {\n      return x.clone()\n    },\n\n    string: function (x) {\n      return Complex(x) // for example '2 + 3i'\n    },\n\n    null: function (x) {\n      return Complex(0)\n    },\n\n    Object: function (x) {\n      if ('re' in x && 'im' in x) {\n        return new Complex(x.re, x.im)\n      }\n\n      if (('r' in x && 'phi' in x) || ('abs' in x && 'arg' in x)) {\n        return new Complex(x)\n      }\n\n      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)')\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'fraction'\nconst dependencies = ['typed', 'Fraction']\n\nexport const createFraction = /* #__PURE__ */ factory(name, dependencies, ({ typed, Fraction }) => {\n  /**\n   * Create a fraction or convert a value to a fraction.\n   *\n   * With one numeric argument, produces the closest rational approximation to the\n   * input.\n   * With two arguments, the first is the numerator and the second is the denominator,\n   * and creates the corresponding fraction. Both numerator and denominator must be\n   * integers.\n   * With one object argument, looks for the integer numerator as the value of property\n   * 'n' and the integer denominator as the value of property 'd'.\n   * With a matrix argument, creates a matrix of the same shape with entries\n   * converted into fractions.\n   *\n   * Syntax:\n   *     math.fraction(value)\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)\n   *\n   * Examples:\n   *\n   *     math.fraction(6.283)             // returns Fraction 6283/1000\n   *     math.fraction(1, 3)              // returns Fraction 1/3\n   *     math.fraction('2/3')             // returns Fraction 2/3\n   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3\n   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]\n   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]\n   *            Arguments specifying the value, or numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  return typed('fraction', {\n    number: function (x) {\n      if (!isFinite(x) || isNaN(x)) {\n        throw new Error(x + ' cannot be represented as a fraction')\n      }\n\n      return new Fraction(x)\n    },\n\n    string: function (x) {\n      return new Fraction(x)\n    },\n\n    'number, number': function (numerator, denominator) {\n      return new Fraction(numerator, denominator)\n    },\n\n    null: function (x) {\n      return new Fraction(0)\n    },\n\n    BigNumber: function (x) {\n      return new Fraction(x.toString())\n    },\n\n    Fraction: function (x) {\n      return x // fractions are immutable\n    },\n\n    Object: function (x) {\n      return new Fraction(x)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'matrix'\nconst dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix']\n\nexport const createMatrix = /* #__PURE__ */ factory(name, dependencies, ({ typed, Matrix, DenseMatrix, SparseMatrix }) => {\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\n    string: function (format) {\n      return _create([], format)\n    },\n\n    'string, string': function (format, datatype) {\n      return _create([], format, datatype)\n    },\n\n    Array: function (data) {\n      return _create(data)\n    },\n\n    Matrix: function (data) {\n      return _create(data, data.storage())\n    },\n\n    'Array | Matrix, string': _create,\n\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\n    if (format === 'sparse') {\n      return new SparseMatrix(data, datatype)\n    }\n\n    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.')\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'matrixFromFunction'\nconst dependencies = ['typed', 'matrix', 'isZero']\n\nexport const createMatrixFromFunction = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, isZero }) => {\n  /**\n   * Create a matrix by evaluating a generating function at each index.\n   * The simplest overload returns a multi-dimensional array as long as `size` is an array.\n   * Passing `size` as a Matrix or specifying a `format` will result in returning a Matrix.\n   *\n   * Syntax:\n   *\n   *    math.matrixFromFunction(size, fn)\n   *    math.matrixFromFunction(size, fn, format)\n   *    math.matrixFromFunction(size, fn, format, datatype)\n   *    math.matrixFromFunction(size, format, fn)\n   *    math.matrixFromFunction(size, format, datatype, fn)\n   *\n   * Examples:\n   *\n   *    math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix\n   *    math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix\n   *    math.matrixFromFunction([5], i => math.random()) // a random vector\n   *\n   * See also:\n   *\n   *    matrix, zeros\n   *\n   * @param {Array | Matrix} size   The size of the matrix to be created\n   * @param {function} fn           Callback function invoked for every entry in the matrix\n   * @param {string} [format]       The Matrix storage format, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]     Type of the values\n   * @return {Array | Matrix} Returns the created matrix\n   */\n  return typed(name, {\n    'Array | Matrix, function, string, string': function (size, fn, format, datatype) {\n      return _create(size, fn, format, datatype)\n    },\n    'Array | Matrix, function, string': function (size, fn, format) {\n      return _create(size, fn, format)\n    },\n    'Matrix, function': function (size, fn) {\n      return _create(size, fn, 'dense')\n    },\n    'Array, function': function (size, fn) {\n      return _create(size, fn, 'dense').toArray()\n    },\n    'Array | Matrix, string, function': function (size, format, fn) {\n      return _create(size, fn, format)\n    },\n    'Array | Matrix, string, string, function': function (size, format, datatype, fn) {\n      return _create(size, fn, format, datatype)\n    }\n  })\n\n  function _create (size, fn, format, datatype) {\n    let m\n    if (datatype !== undefined) {\n      m = matrix(format, datatype)\n    } else {\n      m = matrix(format)\n    }\n\n    m.resize(size)\n    m.forEach(function (_, index) {\n      const val = fn(index)\n      if (isZero(val)) return\n      m.set(index, val)\n    })\n\n    return m\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'matrixFromRows'\nconst dependencies = ['typed', 'matrix', 'flatten', 'size']\n\nexport const createMatrixFromRows = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, flatten, size }) => {\n  /**\n   * Create a dense matrix from vectors as individual rows.\n   * If you pass column vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromRows(...arr)\n   *    math.matrixFromRows(row1, row2)\n   *    math.matrixFromRows(row1, row2, row3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromRows([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromRows(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromColumns, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} rows  Multiple rows\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function (arr) {\n      return _createArray(arr)\n    },\n    '...Matrix': function (arr) {\n      return matrix(_createArray(arr.map(m => m.toArray())))\n    }\n\n    // TODO implement this properly for SparseMatrix\n  })\n\n  function _createArray (arr) {\n    if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.')\n    const N = checkVectorTypeAndReturnLength(arr[0])\n\n    const result = []\n    for (const row of arr) {\n      const rowLength = checkVectorTypeAndReturnLength(row)\n\n      if (rowLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0))\n      }\n\n      result.push(flatten(row))\n    }\n\n    return result\n  }\n\n  function checkVectorTypeAndReturnLength (vec) {\n    const s = size(vec)\n\n    if (s.length === 1) { // 1D vector\n      return s[0]\n    } else if (s.length === 2) { // 2D vector\n      if (s[0] === 1) { // row vector\n        return s[1]\n      } else if (s[1] === 1) { // col vector\n        return s[0]\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.')\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.')\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'matrixFromColumns'\nconst dependencies = ['typed', 'matrix', 'flatten', 'size']\n\nexport const createMatrixFromColumns = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, flatten, size }) => {\n  /**\n   * Create a dense matrix from vectors as individual columns.\n   * If you pass row vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromColumns(...arr)\n   *    math.matrixFromColumns(col1, col2)\n   *    math.matrixFromColumns(col1, col2, col3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromColumns(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromRows, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} cols Multiple columns\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function (arr) {\n      return _createArray(arr)\n    },\n    '...Matrix': function (arr) {\n      return matrix(_createArray(arr.map(m => m.toArray())))\n    }\n\n    // TODO implement this properly for SparseMatrix\n  })\n\n  function _createArray (arr) {\n    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.')\n    const N = checkVectorTypeAndReturnLength(arr[0])\n\n    // create an array with empty rows\n    const result = []\n    for (let i = 0; i < N; i++) {\n      result[i] = []\n    }\n\n    // loop columns\n    for (const col of arr) {\n      const colLength = checkVectorTypeAndReturnLength(col)\n\n      if (colLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0))\n      }\n\n      const f = flatten(col)\n\n      // push a value to each row\n      for (let i = 0; i < N; i++) {\n        result[i].push(f[i])\n      }\n    }\n\n    return result\n  }\n\n  function checkVectorTypeAndReturnLength (vec) {\n    const s = size(vec)\n\n    if (s.length === 1) { // 1D vector\n      return s[0]\n    } else if (s.length === 2) { // 2D vector\n      if (s[0] === 1) { // row vector\n        return s[1]\n      } else if (s[1] === 1) { // col vector\n        return s[0]\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.')\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.')\n    }\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'splitUnit'\nconst dependencies = ['typed']\n\nexport const createSplitUnit = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Split a unit in an array of units whose sum is equal to the original unit.\n   *\n   * Syntax:\n   *\n   *     splitUnit(unit: Unit, parts: Array.<Unit>)\n   *\n   * Example:\n   *\n   *     math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])\n   *     // [ 3 feet, 3.3700787401575 inch ]\n   *\n   * See also:\n   *\n   *     unit\n   *\n   * @param {Array} [parts] An array of strings or valueless units.\n   * @return {Array} An array of units.\n   */\n  return typed(name, {\n    'Unit, Array': function (unit, parts) {\n      return unit.splitUnit(parts)\n    }\n  })\n})\n","import { isInteger, log2, log10, cbrt, expm1, sign, toFixed, log1p } from '../../utils/number.js'\n\nconst n1 = 'number'\nconst n2 = 'number, number'\n\nexport function absNumber (a) {\n  return Math.abs(a)\n}\nabsNumber.signature = n1\n\nexport function addNumber (a, b) {\n  return a + b\n}\naddNumber.signature = n2\n\nexport function subtractNumber (a, b) {\n  return a - b\n}\nsubtractNumber.signature = n2\n\nexport function multiplyNumber (a, b) {\n  return a * b\n}\nmultiplyNumber.signature = n2\n\nexport function divideNumber (a, b) {\n  return a / b\n}\ndivideNumber.signature = n2\n\nexport function unaryMinusNumber (x) {\n  return -x\n}\nunaryMinusNumber.signature = n1\n\nexport function unaryPlusNumber (x) {\n  return x\n}\nunaryPlusNumber.signature = n1\n\nexport function cbrtNumber (x) {\n  return cbrt(x)\n}\ncbrtNumber.signature = n1\n\nexport function ceilNumber (x) {\n  return Math.ceil(x)\n}\nceilNumber.signature = n1\n\nexport function cubeNumber (x) {\n  return x * x * x\n}\ncubeNumber.signature = n1\n\nexport function expNumber (x) {\n  return Math.exp(x)\n}\nexpNumber.signature = n1\n\nexport function expm1Number (x) {\n  return expm1(x)\n}\nexpm1Number.signature = n1\n\nexport function fixNumber (x) {\n  return (x > 0) ? Math.floor(x) : Math.ceil(x)\n}\nfixNumber.signature = n1\n\nexport function floorNumber (x) {\n  return Math.floor(x)\n}\nfloorNumber.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  let 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\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  let t\n  const 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) { return Math.log(x) / Math.log(y) }\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 { // 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} root\n * @private\n */\nexport function nthRootNumber (a, root) {\n  const inv = root < 0\n  if (inv) {\n    root = -root\n  }\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\n  let 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\n  if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n\n  return inv ? 1 / x : x\n  */\n}\nnthRootNumber.signature = n2\n\nexport function signNumber (x) {\n  return sign(x)\n}\nsignNumber.signature = n1\n\nexport function sqrtNumber (x) {\n  return Math.sqrt(x)\n}\nsqrtNumber.signature = n1\n\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  let t // used to swap two variables\n  let q // quotient\n  let r // remainder\n  let x = 0\n  let lastx = 1\n  let y = 1\n  let lasty = 0\n\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function xgcd must be integer numbers')\n  }\n\n  while (b) {\n    q = Math.floor(a / b)\n    r = a - q * b\n\n    t = x\n    x = lastx - q * x\n    lastx = t\n\n    t = y\n    y = lasty - q * y\n    lasty = t\n\n    a = b\n    b = r\n  }\n\n  let 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) ||\n    (x * x > 1 && y === -Infinity)) {\n    return 0\n  }\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, decimals = 0) {\n  return parseFloat(toFixed(value, decimals))\n}\nroundNumber.signature = n2\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","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { unaryMinusNumber } from '../../plain/number/index.js'\n\nconst name = 'unaryMinus'\nconst dependencies = ['typed']\n\nexport const createUnaryMinus = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Inverse the sign of a value, apply a unary minus operation.\n   *\n   * For matrices, the function is evaluated element wise. Boolean values and\n   * strings will be converted to a number. For complex numbers, both real and\n   * complex value are inverted.\n   *\n   * Syntax:\n   *\n   *    math.unaryMinus(x)\n   *\n   * Examples:\n   *\n   *    math.unaryMinus(3.5)      // returns -3.5\n   *    math.unaryMinus(-4.2)     // returns 4.2\n   *\n   * See also:\n   *\n   *    add, subtract, unaryPlus\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.\n   */\n  return typed(name, {\n    number: unaryMinusNumber,\n\n    Complex: function (x) {\n      return x.neg()\n    },\n\n    BigNumber: function (x) {\n      return x.neg()\n    },\n\n    Fraction: function (x) {\n      return x.neg()\n    },\n\n    Unit: function (x) {\n      const res = x.clone()\n      res.value = this(x.value)\n      return res\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since unaryMinus(0) = 0\n      return deepMap(x, this, true)\n    }\n\n    // TODO: add support for string\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { unaryPlusNumber } from '../../plain/number/index.js'\n\nconst name = 'unaryPlus'\nconst dependencies = ['typed', 'config', 'BigNumber']\n\nexport const createUnaryPlus = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, BigNumber }) => {\n  /**\n   * Unary plus operation.\n   * Boolean values and strings will be converted to a number, numeric values will be returned as is.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.unaryPlus(x)\n   *\n   * Examples:\n   *\n   *    math.unaryPlus(3.5)      // returns 3.5\n   *    math.unaryPlus(1)     // returns 1\n   *\n   * See also:\n   *\n   *    unaryMinus, add, subtract\n   *\n   * @param  {number | BigNumber | Fraction | string | Complex | Unit | Array | Matrix} x\n   *            Input value\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n   *            Returns the input value when numeric, converts to a number when input is non-numeric.\n   */\n  return typed(name, {\n    number: unaryPlusNumber,\n\n    Complex: function (x) {\n      return x // complex numbers are immutable\n    },\n\n    BigNumber: function (x) {\n      return x // bignumbers are immutable\n    },\n\n    Fraction: function (x) {\n      return x // fractions are immutable\n    },\n\n    Unit: function (x) {\n      return x.clone()\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since unaryPlus(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    'boolean | string': function (x) {\n      // convert to a number or bignumber\n      return (config.number === 'BigNumber') ? new BigNumber(+x) : +x\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { absNumber } from '../../plain/number/index.js'\n\nconst name = 'abs'\nconst dependencies = ['typed']\n\nexport const createAbs = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the absolute value of a number. For matrices, the function is\n   * evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.abs(x)\n   *\n   * Examples:\n   *\n   *    math.abs(3.5)                // returns number 3.5\n   *    math.abs(-4.2)               // returns number 4.2\n   *\n   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]\n   *\n   * See also:\n   *\n   *    sign\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n   *            A number or matrix for which to get the absolute value\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}\n   *            Absolute value of `x`\n   */\n  return typed(name, {\n    number: absNumber,\n\n    Complex: function (x) {\n      return x.abs()\n    },\n\n    BigNumber: function (x) {\n      return x.abs()\n    },\n\n    Fraction: function (x) {\n      return x.abs()\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since abs(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    Unit: function (x) {\n      return x.abs()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { arraySize } from '../../utils/array.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { IndexError } from '../../error/IndexError.js'\n\nconst name = 'apply'\nconst dependencies = ['typed', 'isInteger']\n\nexport const createApply = /* #__PURE__ */ factory(name, dependencies, ({ typed, isInteger }) => {\n  /**\n   * Apply a function that maps an array to a scalar\n   * along a given axis of a matrix or array.\n   * Returns a new matrix or array with one less dimension than the input.\n   *\n   * Syntax:\n   *\n   *     math.apply(A, dim, callback)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [3, 4]]\n   *    const sum = math.sum\n   *\n   *    math.apply(A, 0, sum)             // returns [4, 6]\n   *    math.apply(A, 1, sum)             // returns [3, 7]\n   *\n   * See also:\n   *\n   *    map, filter, forEach\n   *\n   * @param {Array | Matrix} array   The input Matrix\n   * @param {number} dim             The dimension along which the callback is applied\n   * @param {Function} callback      The callback function that is applied. This Function\n   *                                 should take an array or 1-d matrix as an input and\n   *                                 return a number.\n   * @return {Array | Matrix} res    The residual matrix with the function applied over some dimension.\n   */\n  return typed(name, {\n    'Array | Matrix, number | BigNumber, function': function (mat, dim, callback) {\n      if (!isInteger(dim)) {\n        throw new TypeError('Integer number expected for dimension')\n      }\n\n      const size = Array.isArray(mat) ? arraySize(mat) : mat.size()\n      if (dim < 0 || (dim >= size.length)) {\n        throw new IndexError(dim, size.length)\n      }\n\n      if (isMatrix(mat)) {\n        return mat.create(_apply(mat.valueOf(), dim, callback))\n      } else {\n        return _apply(mat, dim, callback)\n      }\n    }\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 _apply (mat, dim, callback) {\n  let i, ret, tran\n\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      return callback(mat)\n    } else {\n      tran = _switch(mat)\n      ret = []\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _apply(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] = _apply(mat[i], dim - 1, callback)\n    }\n    return ret\n  }\n}\n\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nfunction _switch (mat) {\n  const I = mat.length\n  const J = mat[0].length\n  let i, j\n  const ret = []\n  for (j = 0; j < J; j++) {\n    const tmp = []\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j])\n    }\n    ret.push(tmp)\n  }\n  return ret\n}\n","import { factory } from '../../utils/factory.js'\nimport { addNumber } from '../../plain/number/index.js'\n\nconst name = 'addScalar'\nconst dependencies = ['typed']\n\nexport const createAddScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\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\n    'number, number': addNumber,\n\n    'Complex, Complex': function (x, y) {\n      return x.add(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.plus(y)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.add(y)\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value')\n      if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value')\n      if (!x.equalBase(y)) throw new Error('Units do not match')\n\n      const res = x.clone()\n      res.value = this(res.value, y.value)\n      res.fixPrefix = false\n      return res\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { isBigNumber, isComplex, isFraction } from '../../utils/is.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { cbrtNumber } from '../../plain/number/index.js'\n\nconst name = 'cbrt'\nconst dependencies = [\n  'config',\n  'typed',\n  'isNegative',\n  'unaryMinus',\n  'matrix',\n  'Complex',\n  'BigNumber',\n  'Fraction'\n]\n\nexport const createCbrt = /* #__PURE__ */ factory(name, dependencies, ({ config, typed, isNegative, unaryMinus, matrix, Complex, BigNumber, Fraction }) => {\n  /**\n   * Calculate the cubic root of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cbrt(x)\n   *    math.cbrt(x, allRoots)\n   *\n   * Examples:\n   *\n   *    math.cbrt(27)                  // returns 3\n   *    math.cube(3)                   // returns 27\n   *    math.cbrt(-64)                 // returns -4\n   *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m\n   *    math.cbrt([27, 64, 125])       // returns [3, 4, 5]\n   *\n   *    const x = math.complex('8i')\n   *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i\n   *    math.cbrt(x, true)             // returns Matrix [\n   *                                    //    1.7320508075689 + i\n   *                                    //   -1.7320508075689 + i\n   *                                    //   -2i\n   *                                    // ]\n   *\n   * See also:\n   *\n   *    square, sqrt, cube\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x\n   *            Value for which to calculate the cubic root.\n   * @param {boolean} [allRoots]  Optional, false by default. Only applicable\n   *            when `x` is a number or complex number. If true, all complex\n   *            roots are returned, if false (default) the principal root is\n   *            returned.\n   * @return {number | BigNumber | Complex | Unit | Array | Matrix}\n   *            Returns the cubic root of `x`\n   */\n  return typed(name, {\n    number: cbrtNumber,\n    // note: signature 'number, boolean' is also supported,\n    //       created by typed as it knows how to convert number to Complex\n\n    Complex: _cbrtComplex,\n\n    'Complex, boolean': _cbrtComplex,\n\n    BigNumber: function (x) {\n      return x.cbrt()\n    },\n\n    Unit: _cbrtUnit,\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since cbrt(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n\n  /**\n   * Calculate the cubic root for a complex number\n   * @param {Complex} x\n   * @param {boolean} [allRoots]   If true, the function will return an array\n   *                               with all three roots. If false or undefined,\n   *                               the principal root is returned.\n   * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x\n   * @private\n   */\n  function _cbrtComplex (x, allRoots) {\n    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers\n\n    const arg3 = x.arg() / 3\n    const abs = x.abs()\n\n    // principal root:\n    const principal = new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp())\n\n    if (allRoots) {\n      const all = [\n        principal,\n        new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()),\n        new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())\n      ]\n\n      return (config.matrix === 'Array') ? all : matrix(all)\n    } else {\n      return principal\n    }\n  }\n\n  /**\n   * Calculate the cubic root for a Unit\n   * @param {Unit} x\n   * @return {Unit} Returns the cubic root of x\n   * @private\n   */\n  function _cbrtUnit (x) {\n    if (x.value && isComplex(x.value)) {\n      let result = x.clone()\n      result.value = 1.0\n      result = result.pow(1.0 / 3) // Compute the units\n      result.value = _cbrtComplex(x.value) // Compute the value\n      return result\n    } else {\n      const negate = isNegative(x.value)\n      if (negate) {\n        x.value = unaryMinus(x.value)\n      }\n\n      // TODO: create a helper function for this\n      let third\n      if (isBigNumber(x.value)) {\n        third = new BigNumber(1).div(3)\n      } else if (isFraction(x.value)) {\n        third = new Fraction(1, 3)\n      } else {\n        third = 1 / 3\n      }\n\n      const result = x.pow(third)\n\n      if (negate) {\n        result.value = unaryMinus(result.value)\n      }\n\n      return result\n    }\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'algorithm11'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createAlgorithm11 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\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 algorithm11 (s, b, callback, inverse) {\n    // sparse matrix arrays\n    const avalues = s._values\n    const aindex = s._index\n    const aptr = s._ptr\n    const asize = s._size\n    const adt = s._datatype\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let 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    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length\n      // values in j\n      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const i = aindex[k]\n        // invoke callback\n        const 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})\n","import { factory } from '../../../utils/factory.js'\nimport { clone } from '../../../utils/object.js'\n\nconst name = 'algorithm14'\nconst dependencies = ['typed']\n\nexport const createAlgorithm14 = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\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 algorithm14 (a, b, callback, inverse) {\n    // a arrays\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n\n    // datatype\n    let dt\n    // callback signature to use\n    let 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    const 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    const cv = []\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (let 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 (let 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})\n","import Decimal from 'decimal.js'\nimport { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { ceilNumber } from '../../plain/number/index.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'ceil'\nconst dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar']\n\nexport const createCeil = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, round, matrix, equalScalar }) => {\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Round a value towards plus infinity\n   * If `x` is complex, both real and imaginary part are rounded towards plus infinity.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.ceil(x)\n   *    math.ceil(x, n)\n   *\n   * Examples:\n   *\n   *    math.ceil(3.2)               // returns number 4\n   *    math.ceil(3.8)               // returns number 4\n   *    math.ceil(-4.2)              // returns number -4\n   *    math.ceil(-4.7)              // returns number -4\n   *\n   *    math.ceil(3.212, 2)          // returns number 3.22\n   *    math.ceil(3.288, 2)          // returns number 3.29\n   *    math.ceil(-4.212, 2)         // returns number -4.21\n   *    math.ceil(-4.782, 2)         // returns number -4.78\n   *\n   *    const c = math.complex(3.24, -2.71)\n   *    math.ceil(c)                 // returns Complex 4 - 2i\n   *    math.ceil(c, 1)              // returns Complex 3.3 - 2.7i\n   *\n   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]\n   *    math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]\n   *\n   * See also:\n   *\n   *    floor, fix, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n   */\n  return typed('ceil', {\n    number: function (x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x)\n      } else {\n        return ceilNumber(x)\n      }\n    },\n\n    'number, number': function (x, n) {\n      if (nearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n)\n      } else {\n        let [number, exponent] = `${x}e`.split('e')\n        const result = Math.ceil(Number(`${number}e${Number(exponent) + n}`));\n        [number, exponent] = `${result}e`.split('e')\n        return Number(`${number}e${Number(exponent) - n}`)\n      }\n    },\n\n    Complex: function (x) {\n      return x.ceil()\n    },\n\n    'Complex, number': function (x, n) {\n      return x.ceil(n)\n    },\n\n    BigNumber: function (x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x)\n      } else {\n        return x.ceil()\n      }\n    },\n\n    'BigNumber, BigNumber': function (x, n) {\n      if (bigNearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n)\n      } else {\n        return x.toDecimalPlaces(n.toNumber(), Decimal.ROUND_CEIL)\n      }\n    },\n\n    Fraction: function (x) {\n      return x.ceil()\n    },\n\n    'Fraction, number': function (x, n) {\n      return x.ceil(n)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    'Array | Matrix, number': function (x, n) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => this(i, n), true)\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | Complex | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { cubeNumber } from '../../plain/number/index.js'\n\nconst name = 'cube'\nconst dependencies = ['typed']\n\nexport const createCube = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the cube of a value, `x * x * x`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cube(x)\n   *\n   * Examples:\n   *\n   *    math.cube(2)            // returns number 8\n   *    math.pow(2, 3)          // returns number 8\n   *    math.cube(4)            // returns number 64\n   *    4 * 4 * 4               // returns number 64\n   *\n   *    math.cube([1, 2, 3, 4]) // returns Array [1, 8, 27, 64]\n   *\n   * See also:\n   *\n   *    multiply, square, pow, cbrt\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x  Number for which to calculate the cube\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} Cube of x\n   */\n  return typed(name, {\n    number: cubeNumber,\n\n    Complex: function (x) {\n      return x.mul(x).mul(x) // Is faster than pow(x, 3)\n    },\n\n    BigNumber: function (x) {\n      return x.times(x).times(x)\n    },\n\n    Fraction: function (x) {\n      return x.pow(3) // Is faster than mul()mul()mul()\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since cube(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    Unit: function (x) {\n      return x.pow(3)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { expNumber } from '../../plain/number/index.js'\n\nconst name = 'exp'\nconst dependencies = ['typed']\n\nexport const createExp = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the exponent of a value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.exp(x)\n   *\n   * Examples:\n   *\n   *    math.exp(2)                  // returns number 7.3890560989306495\n   *    math.pow(math.e, 2)          // returns number 7.3890560989306495\n   *    math.log(math.exp(2))        // returns number 2\n   *\n   *    math.exp([1, 2, 3])\n   *    // returns Array [\n   *    //   2.718281828459045,\n   *    //   7.3890560989306495,\n   *    //   20.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    expm1, log, pow\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to exponentiate\n   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`\n   */\n  return typed(name, {\n    number: expNumber,\n\n    Complex: function (x) {\n      return x.exp()\n    },\n\n    BigNumber: function (x) {\n      return x.exp()\n    },\n\n    'Array | Matrix': function (x) {\n      // TODO: exp(sparse) should return a dense matrix since exp(0)==1\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { expm1Number } from '../../plain/number/index.js'\n\nconst name = 'expm1'\nconst dependencies = ['typed', 'Complex']\n\nexport const createExpm1 = /* #__PURE__ */ factory(name, dependencies, ({ typed, Complex }) => {\n  /**\n   * Calculate the value of subtracting 1 from the exponential value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.expm1(x)\n   *\n   * Examples:\n   *\n   *    math.expm1(2)                      // returns number 6.38905609893065\n   *    math.pow(math.e, 2) - 1            // returns number 6.3890560989306495\n   *    math.log(math.expm1(2) + 1)        // returns number 2\n   *\n   *    math.expm1([1, 2, 3])\n   *    // returns Array [\n   *    //   1.718281828459045,\n   *    //   6.3890560989306495,\n   *    //   19.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    exp, log, pow\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to apply expm1\n   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`\n   */\n  return typed(name, {\n    number: expm1Number,\n\n    Complex: function (x) {\n      const r = Math.exp(x.re)\n      return new Complex(\n        r * Math.cos(x.im) - 1,\n        r * Math.sin(x.im)\n      )\n    },\n\n    BigNumber: function (x) {\n      return x.exp().minus(1)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'fix'\nconst dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor']\n\nexport const createFix = /* #__PURE__ */ factory(name, dependencies, ({ typed, Complex, matrix, ceil, floor }) => {\n  const algorithm14 = createAlgorithm14({ typed })\n  /**\n   * Round a value towards zero.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.fix(x)\n   *\n   * Examples:\n   *\n   *    math.fix(3.2)                // returns number 3\n   *    math.fix(3.8)                // returns number 3\n   *    math.fix(-4.2)               // returns number -4\n   *    math.fix(-4.7)               // returns number -4\n   *\n   *    math.fix(3.12, 1)                // returns number 3.1\n   *    math.fix(3.18, 1)                // returns number 3.1\n   *    math.fix(-4.12, 1)               // returns number -4.1\n   *    math.fix(-4.17, 1)               // returns number -4.1\n   *\n   *    const c = math.complex(3.22, -2.78)\n   *    math.fix(c)                  // returns Complex 3 - 2i\n   *    math.fix(c, 1)               // returns Complex 3.2 - 2.7i\n   *\n   *    math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]\n   *    math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]\n   *\n   * See also:\n   *\n   *    ceil, floor, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x    Number to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                             Number of decimals\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix}     Rounded value\n   */\n  return typed('fix', {\n    number: function (x) {\n      return (x > 0) ? floor(x) : ceil(x)\n    },\n\n    'number, number | BigNumber': function (x, n) {\n      return (x > 0) ? floor(x, n) : ceil(x, n)\n    },\n\n    Complex: function (x) {\n      return new Complex(\n        (x.re > 0) ? Math.floor(x.re) : Math.ceil(x.re),\n        (x.im > 0) ? Math.floor(x.im) : Math.ceil(x.im)\n      )\n    },\n\n    'Complex, number | BigNumber': function (x, n) {\n      return new Complex(\n        (x.re > 0) ? floor(x.re, n) : ceil(x.re, n),\n        (x.im > 0) ? floor(x.im, n) : ceil(x.im, n)\n      )\n    },\n\n    BigNumber: function (x) {\n      return x.isNegative() ? ceil(x) : floor(x)\n    },\n\n    'BigNumber, number | BigNumber': function (x, n) {\n      return x.isNegative() ? ceil(x, n) : floor(x, n)\n    },\n\n    Fraction: function (x) {\n      return x.s < 0 ? x.ceil() : x.floor()\n    },\n\n    'Fraction, number | BigNumber': function (x, n) {\n      return x.s < 0 ? x.ceil(n) : x.floor(n)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    'Array | Matrix, number | BigNumber': function (x, n) {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, i => this(i, n), true)\n    },\n\n    'number | Complex | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import Decimal from 'decimal.js'\nimport { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'floor'\nconst dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar']\n\nexport const createFloor = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, round, matrix, equalScalar }) => {\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Round a value towards minus infinity.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.floor(x)\n   *    math.floor(x, n)\n   *\n   * Examples:\n   *\n   *    math.floor(3.2)              // returns number 3\n   *    math.floor(3.8)              // returns number 3\n   *    math.floor(-4.2)             // returns number -5\n   *    math.floor(-4.7)             // returns number -5\n   *\n   *    math.floor(3.212, 2)          // returns number 3.21\n   *    math.floor(3.288, 2)          // returns number 3.28\n   *    math.floor(-4.212, 2)         // returns number -4.22\n   *    math.floor(-4.782, 2)         // returns number -4.79\n   *\n   *    const c = math.complex(3.24, -2.71)\n   *    math.floor(c)                 // returns Complex 3 - 3i\n   *    math.floor(c, 1)              // returns Complex 3.2 - 2.8i\n   *\n   *    math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]\n   *    math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]\n   *\n   * See also:\n   *\n   *    ceil, fix, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n   */\n  return typed('floor', {\n    number: function (x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x)\n      } else {\n        return Math.floor(x)\n      }\n    },\n\n    'number, number': function (x, n) {\n      if (nearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n)\n      } else {\n        let [number, exponent] = `${x}e`.split('e')\n        const result = Math.floor(Number(`${number}e${Number(exponent) + n}`));\n        [number, exponent] = `${result}e`.split('e')\n        return Number(`${number}e${Number(exponent) - n}`)\n      }\n    },\n\n    Complex: function (x) {\n      return x.floor()\n    },\n\n    'Complex, number': function (x, n) {\n      return x.floor(n)\n    },\n\n    BigNumber: function (x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x)\n      } else {\n        return x.floor()\n      }\n    },\n\n    'BigNumber, BigNumber': function (x, n) {\n      if (bigNearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n)\n      } else {\n        return x.toDecimalPlaces(n.toNumber(), Decimal.ROUND_FLOOR)\n      }\n    },\n\n    Fraction: function (x) {\n      return x.floor()\n    },\n\n    'Fraction, number': function (x, n) {\n      return x.floor(n)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    'Array | Matrix, number': function (x, n) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => this(i, n), true)\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | Complex | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm01'\nconst dependencies = ['typed']\n\nexport const createAlgorithm01 = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  Dij          ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function algorithm1 (denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    const adata = denseMatrix._data\n    const asize = denseMatrix._size\n    const adt = denseMatrix._datatype\n    // sparse matrix arrays\n    const bvalues = sparseMatrix._values\n    const bindex = sparseMatrix._index\n    const bptr = sparseMatrix._ptr\n    const bsize = sparseMatrix._size\n    const bdt = sparseMatrix._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) { throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // process data types\n    const dt = typeof adt === 'string' && adt === bdt ? adt : undefined\n    // callback function\n    const cf = dt ? typed.find(callback, [dt, dt]) : callback\n\n    // vars\n    let i, j\n\n    // result (DenseMatrix)\n    const cdata = []\n    // initialize c\n    for (i = 0; i < rows; i++) { cdata[i] = [] }\n\n    // workspace\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns in b\n    for (j = 0; j < columns; j++) {\n      // column mark\n      const mark = j + 1\n      // values in column j\n      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k])\n        // mark i as updated\n        w[i] = mark\n      }\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // check row is in workspace\n        if (w[i] === mark) {\n          // c[i][j] was already calculated\n          cdata[i][j] = x[i]\n        } else {\n          // item does not exist in S\n          cdata[i][j] = adata[i][j]\n        }\n      }\n    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm04'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createAlgorithm04 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0\n   *          └  B(i,j)       ; B(i,j) !== 0\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function algorithm04 (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\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      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspace\n    const xa = avalues && bvalues ? [] : undefined\n    const xb = avalues && bvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const wa = []\n    const wb = []\n\n    // vars\n    let i, j, k, k0, k1\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // update c\n        cindex.push(i)\n        // update workspace\n        wa[i] = mark\n        // check we need to process values\n        if (xa) { xa[i] = avalues[k] }\n      }\n      // loop B(:,j)\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // check row exists in A\n        if (wa[i] === mark) {\n          // update record in xa @ i\n          if (xa) {\n            // invoke callback\n            const v = cf(xa[i], bvalues[k])\n            // check for zero\n            if (!eq(v, zero)) {\n              // update workspace\n              xa[i] = v\n            } else {\n              // remove mark (index will be removed later)\n              wa[i] = null\n            }\n          }\n        } else {\n          // update c\n          cindex.push(i)\n          // update workspace\n          wb[i] = mark\n          // check we need to process values\n          if (xb) { xb[i] = bvalues[k] }\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j]\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]\n          // check workspace has value @ i\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i]\n            // increment pointer\n            k++\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i]\n            // increment pointer\n            k++\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1)\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'algorithm10'\nconst dependencies = ['typed', 'DenseMatrix']\n\nexport const createAlgorithm10 = /* #__PURE__ */ factory(name, dependencies, ({ typed, DenseMatrix }) => {\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   *          └  b          ; 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}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function algorithm10 (s, b, callback, inverse) {\n    // sparse matrix arrays\n    const avalues = s._values\n    const aindex = s._index\n    const aptr = s._ptr\n    const asize = s._size\n    const adt = s._datatype\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // callback signature to use\n    let 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    // result arrays\n    const cdata = []\n\n    // workspaces\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // columns mark\n      const mark = j + 1\n      // values in j\n      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const r = aindex[k]\n        // update workspace\n        x[r] = avalues[k]\n        w[r] = mark\n      }\n      // loop rows\n      for (let i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = []\n        }\n        // check sparse matrix has a value @ i,j\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b)\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = b\n        }\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm13'\nconst dependencies = ['typed']\n\nexport const createAlgorithm13 = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, Bij..z)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Matrix}   b                 The DenseMatrix instance (B)\n   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658\n   */\n  return function algorithm13 (a, b, callback) {\n    // a arrays\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n    // b arrays\n    const bdata = b._data\n    const bsize = b._size\n    const bdt = b._datatype\n    // c arrays\n    const csize = []\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // validate each one of the dimension sizes\n    for (let s = 0; s < asize.length; s++) {\n      // must match\n      if (asize[s] !== bsize[s]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n      // update dimension in c\n      csize[s] = asize[s]\n    }\n\n    // datatype\n    let dt\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // populate cdata, iterate through dimensions\n    const cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    })\n  }\n\n  // recursive function\n  function _iterate (f, level, s, n, av, bv) {\n    // initialize array for this level\n    const cv = []\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (let i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = f(av[i], bv[i])\n      }\n    } else {\n      // iterate current level\n      for (let j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j])\n      }\n    }\n    return cv\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js'\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { gcdNumber } from '../../plain/number/index.js'\n\nconst name = 'gcd'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'BigNumber',\n  'DenseMatrix'\n]\n\nexport const createGcd = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, BigNumber, DenseMatrix }) => {\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm04 = createAlgorithm04({ typed, equalScalar })\n  const algorithm10 = createAlgorithm10({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Calculate the greatest common divisor for two or more values or arrays.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.gcd(a, b)\n   *    math.gcd(a, b, c, ...)\n   *\n   * Examples:\n   *\n   *    math.gcd(8, 12)              // returns 4\n   *    math.gcd(-4, 6)              // returns 2\n   *    math.gcd(25, 15, -10)        // returns 5\n   *\n   *    math.gcd([8, -4], [12, 6])   // returns [4, 2]\n   *\n   * See also:\n   *\n   *    lcm, xgcd\n   *\n   * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers\n   * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor\n   */\n  return typed(name, {\n\n    'number, number': gcdNumber,\n\n    'BigNumber, BigNumber': _gcdBigNumber,\n\n    'Fraction, Fraction': function (x, y) {\n      return x.gcd(y)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm04(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm01(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm01(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      return algorithm10(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | BigNumber, SparseMatrix': function (x, y) {\n      return algorithm10(y, x, this, true)\n    },\n\n    'number | BigNumber, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'number | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    },\n\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function (a, b, args) {\n      let res = this(a, b)\n      for (let i = 0; i < args.length; i++) {\n        res = this(res, args[i])\n      }\n      return res\n    }\n  })\n\n  /**\n   * Calculate gcd for BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @returns {BigNumber} Returns greatest common denominator of a and b\n   * @private\n   */\n  function _gcdBigNumber (a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function gcd must be integer numbers')\n    }\n\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    const zero = new BigNumber(0)\n    while (!b.isZero()) {\n      const r = a.mod(b)\n      a = b\n      b = r\n    }\n    return a.lt(zero) ? a.neg() : a\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm02'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createAlgorithm02 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function algorithm02 (denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    const adata = denseMatrix._data\n    const asize = denseMatrix._size\n    const adt = denseMatrix._datatype\n    // sparse matrix arrays\n    const bvalues = sparseMatrix._values\n    const bindex = sparseMatrix._index\n    const bptr = sparseMatrix._ptr\n    const bsize = sparseMatrix._size\n    const bdt = sparseMatrix._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) { throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\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      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result (SparseMatrix)\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // loop columns in b\n    for (let j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // values in column j\n      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const i = bindex[k]\n        // update C(i,j)\n        const cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k])\n        // check for nonzero\n        if (!eq(cij, zero)) {\n          // push i & v\n          cindex.push(i)\n          cvalues.push(cij)\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return sparseMatrix.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\nimport { scatter } from '../../../utils/collection.js'\n\nconst name = 'algorithm06'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createAlgorithm06 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function algorithm06 (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const asize = a._size\n    const adt = a._datatype\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bsize = b._size\n    const bdt = b._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\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      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspaces\n    const x = cvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const w = []\n    // marks indicating value in a given row has been updated\n    const u = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // scatter the values of A(:,j) into workspace\n      scatter(a, j, w, x, u, mark, cindex, cf)\n      // scatter the values of B(:,j) into workspace\n      scatter(b, j, w, x, u, mark, cindex, cf)\n      // check we need to process values (non pattern matrix)\n      if (x) {\n        // initialize first index in j\n        let k = cptr[j]\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          const i = cindex[k]\n          // check function was invoked on current row (Aij !=0 && Bij != 0)\n          if (u[i] === mark) {\n            // value @ i\n            const v = x[i]\n            // check for zero value\n            if (!eq(v, zero)) {\n              // push value\n              cvalues.push(v)\n              // increment pointer\n              k++\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1)\n            }\n          } else {\n            // remove value @ i, do not increment pointer\n            cindex.splice(k, 1)\n          }\n        }\n      } else {\n        // initialize first index in j\n        let p = cptr[j]\n        // loop index in j\n        while (p < cindex.length) {\n          // row\n          const r = cindex[p]\n          // check function was invoked on current row (Aij !=0 && Bij != 0)\n          if (u[r] !== mark) {\n            // remove value @ i, do not increment pointer\n            cindex.splice(p, 1)\n          } else {\n            // increment pointer\n            p++\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { lcmNumber } from '../../plain/number/index.js'\n\nconst name = 'lcm'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar'\n]\n\nexport const createLcm = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar }) => {\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm06 = createAlgorithm06({ typed, equalScalar })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Calculate the least common multiple for two or more values or arrays.\n   *\n   * lcm is defined as:\n   *\n   *     lcm(a, b) = abs(a * b) / gcd(a, b)\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.lcm(a, b)\n   *    math.lcm(a, b, c, ...)\n   *\n   * Examples:\n   *\n   *    math.lcm(4, 6)               // returns 12\n   *    math.lcm(6, 21)              // returns 42\n   *    math.lcm(6, 21, 5)           // returns 210\n   *\n   *    math.lcm([4, 6], [6, 21])    // returns [12, 42]\n   *\n   * See also:\n   *\n   *    gcd, xgcd\n   *\n   * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers\n   * @return {number | BigNumber | Array | Matrix}                           The least common multiple\n   */\n  return typed(name, {\n    'number, number': lcmNumber,\n\n    'BigNumber, BigNumber': _lcmBigNumber,\n\n    'Fraction, Fraction': function (x, y) {\n      return x.lcm(y)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm06(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm02(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | BigNumber, SparseMatrix': function (x, y) {\n      return algorithm11(y, x, this, true)\n    },\n\n    'number | BigNumber, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'number | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    },\n\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function (a, b, args) {\n      let res = this(a, b)\n      for (let i = 0; i < args.length; i++) {\n        res = this(res, args[i])\n      }\n      return res\n    }\n  })\n\n  /**\n   * Calculate lcm for two BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @returns {BigNumber} Returns the least common multiple of a and b\n   * @private\n   */\n  function _lcmBigNumber (a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function lcm must be integer numbers')\n    }\n\n    if (a.isZero()) {\n      return a\n    }\n    if (b.isZero()) {\n      return b\n    }\n\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    // evaluate lcm here inline to reduce overhead\n    const prod = a.times(b)\n    while (!b.isZero()) {\n      const t = b\n      b = a.mod(t)\n      a = t\n    }\n    return prod.div(a).abs()\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { log10Number } from '../../plain/number/index.js'\n\nconst name = 'log10'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createLog10 = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log10(x)\n   *\n   * Examples:\n   *\n   *    math.log10(0.00001)            // returns -5\n   *    math.log10(10000)              // returns 4\n   *    math.log(10000) / math.log(10) // returns 4\n   *    math.pow(10, 4)                // returns 10000\n   *\n   * See also:\n   *\n   *    exp, log, log1p, log2\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the 10-base logarithm of `x`\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= 0 || config.predictable) {\n        return log10Number(x)\n      } else {\n        // negative value -> complex value computation\n        return new Complex(x, 0).log().div(Math.LN10)\n      }\n    },\n\n    Complex: function (x) {\n      return new Complex(x).log().div(Math.LN10)\n    },\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.log()\n      } else {\n        // downgrade to number, return Complex valued result\n        return new Complex(x.toNumber(), 0).log().div(Math.LN10)\n      }\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { log2Number } from '../../plain/number/index.js'\n\nconst name = 'log2'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createLog2 = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log2(x)\n   *\n   * Examples:\n   *\n   *    math.log2(0.03125)           // returns -5\n   *    math.log2(16)                // returns 4\n   *    math.log2(16) / math.log2(2) // returns 4\n   *    math.pow(2, 4)               // returns 16\n   *\n   * See also:\n   *\n   *    exp, log, log1p, log10\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the 2-base logarithm of `x`\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= 0 || config.predictable) {\n        return log2Number(x)\n      } else {\n        // negative value -> complex value computation\n        return _log2Complex(new Complex(x, 0))\n      }\n    },\n\n    Complex: _log2Complex,\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.log(2)\n      } else {\n        // downgrade to number, return Complex valued result\n        return _log2Complex(new Complex(x.toNumber(), 0))\n      }\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n\n  /**\n   * Calculate log2 for a complex value\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n  function _log2Complex (x) {\n    const newX = Math.sqrt(x.re * x.re + x.im * x.im)\n    return new Complex(\n      (Math.log2) ? Math.log2(newX) : Math.log(newX) / Math.LN2,\n      Math.atan2(x.im, x.re) / Math.LN2\n    )\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm03'\nconst dependencies = ['typed']\n\nexport const createAlgorithm03 = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked M*N times.\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(Dij, 0)    ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function algorithm03 (denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    const adata = denseMatrix._data\n    const asize = denseMatrix._size\n    const adt = denseMatrix._datatype\n    // sparse matrix arrays\n    const bvalues = sparseMatrix._values\n    const bindex = sparseMatrix._index\n    const bptr = sparseMatrix._ptr\n    const bsize = sparseMatrix._size\n    const bdt = sparseMatrix._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) { throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result (DenseMatrix)\n    const cdata = []\n\n    // initialize dense matrix\n    for (let z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = []\n    }\n\n    // workspace\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns in b\n    for (let j = 0; j < columns; j++) {\n      // column mark\n      const mark = j + 1\n      // values in column j\n      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const i = bindex[k]\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k])\n        w[i] = mark\n      }\n      // process workspace\n      for (let y = 0; y < rows; y++) {\n        // check we have a calculated value for current row\n        if (w[y] === mark) {\n          // use calculated value\n          cdata[y][j] = x[y]\n        } else {\n          // calculate value\n          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero)\n        }\n      }\n    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm05'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createAlgorithm05 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function algorithm05 (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\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      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspaces\n    const xa = cvalues ? [] : undefined\n    const xb = cvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const wa = []\n    const wb = []\n\n    // vars\n    let i, j, k, k1\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // loop values A(:,j)\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // push index\n        cindex.push(i)\n        // update workspace\n        wa[i] = mark\n        // check we need to process values\n        if (xa) { xa[i] = avalues[k] }\n      }\n      // loop values B(:,j)\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // check row existed in A\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i)\n        }\n        // update workspace\n        wb[i] = mark\n        // check we need to process values\n        if (xb) { xb[i] = bvalues[k] }\n      }\n      // check we need to process values (non pattern matrix)\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j]\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]\n          // marks\n          const wai = wa[i]\n          const wbi = wb[i]\n          // check Aij or Bij are nonzero\n          if (wai === mark || wbi === mark) {\n            // matrix values @ i,j\n            const va = wai === mark ? xa[i] : zero\n            const vb = wbi === mark ? xb[i] : zero\n            // Cij\n            const vc = cf(va, vb)\n            // check for zero\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc)\n              // increment pointer\n              k++\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1)\n            }\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'algorithm12'\nconst dependencies = ['typed', 'DenseMatrix']\n\nexport const createAlgorithm12 = /* #__PURE__ */ factory(name, dependencies, ({ typed, DenseMatrix }) => {\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked MxN times.\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(0, b)    ; 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}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function algorithm12 (s, b, callback, inverse) {\n    // sparse matrix arrays\n    const avalues = s._values\n    const aindex = s._index\n    const aptr = s._ptr\n    const asize = s._size\n    const adt = s._datatype\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // callback signature to use\n    let 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    // result arrays\n    const cdata = []\n\n    // workspaces\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // columns mark\n      const mark = j + 1\n      // values in j\n      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const r = aindex[k]\n        // update workspace\n        x[r] = avalues[k]\n        w[r] = mark\n      }\n      // loop rows\n      for (let i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = []\n        }\n        // check sparse matrix has a value @ i,j\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b)\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b)\n        }\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { modNumber } from '../../plain/number/index.js'\n\nconst name = 'mod'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createMod = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix }) => {\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm05 = createAlgorithm05({ typed, equalScalar })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Calculates the modulus, the remainder of an integer division.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * The modulus is defined as:\n   *\n   *     x - y * floor(x / y)\n   *\n   * See https://en.wikipedia.org/wiki/Modulo_operation.\n   *\n   * Syntax:\n   *\n   *    math.mod(x, y)\n   *\n   * Examples:\n   *\n   *    math.mod(8, 3)                // returns 2\n   *    math.mod(11, 2)               // returns 1\n   *\n   *    function isOdd(x) {\n   *      return math.mod(x, 2) != 0\n   *    }\n   *\n   *    isOdd(2)                      // returns false\n   *    isOdd(3)                      // returns true\n   *\n   * See also:\n   *\n   *    divide\n   *\n   * @param  {number | BigNumber | Fraction | Array | Matrix} x Dividend\n   * @param  {number | BigNumber | Fraction | Array | Matrix} y Divisor\n   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.\n   */\n  return typed(name, {\n\n    'number, number': modNumber,\n\n    'BigNumber, BigNumber': function (x, y) {\n      if (y.isNeg()) {\n        throw new Error('Cannot calculate mod for a negative divisor')\n      }\n      return y.isZero() ? x : x.mod(y)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      if (y.compare(0) < 0) {\n        throw new Error('Cannot calculate mod for a negative divisor')\n      }\n      // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend\n      return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm05(x, y, this, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { multiplyNumber } from '../../plain/number/index.js'\n\nconst name = 'multiplyScalar'\nconst dependencies = ['typed']\n\nexport const createMultiplyScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\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\n    'number, number': multiplyNumber,\n\n    'Complex, Complex': function (x, y) {\n      return x.mul(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.times(y)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.mul(y)\n    },\n\n    'number | Fraction | BigNumber | Complex, Unit': function (x, y) {\n      const res = y.clone()\n      res.value = (res.value === null) ? res._normalize(x) : this(res.value, x)\n      return res\n    },\n\n    'Unit, number | Fraction | BigNumber | Complex': function (x, y) {\n      const res = x.clone()\n      res.value = (res.value === null) ? res._normalize(y) : this(res.value, y)\n      return res\n    },\n\n    'Unit, Unit': function (x, y) {\n      return x.multiply(y)\n    }\n\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { extend } from '../../utils/object.js'\nimport { arraySize } from '../../utils/array.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'multiply'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'addScalar',\n  'multiplyScalar',\n  'equalScalar',\n  'dot'\n]\n\nexport const createMultiply = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, addScalar, multiplyScalar, equalScalar, dot }) => {\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm14 = createAlgorithm14({ 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) { throw new Error('Cannot multiply two empty vectors') }\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    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n    // b dense\n    const bdata = b._data\n    const bsize = b._size\n    const bdt = b._datatype\n    // rows & columns\n    const alength = asize[0]\n    const bcolumns = bsize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let 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    const c = []\n\n    // loop matrix columns\n    for (let j = 0; j < bcolumns; j++) {\n      // sum (do not initialize it with zero)\n      let sum = mf(adata[0], bdata[0][j])\n      // loop vector\n      for (let 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  const _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  const _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    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n    // b dense\n    const bdata = b._data\n    const bdt = b._datatype\n    // rows & columns\n    const arows = asize[0]\n    const acolumns = asize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let 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    const c = []\n\n    // loop matrix a rows\n    for (let i = 0; i < arows; i++) {\n      // current row\n      const row = adata[i]\n      // sum (do not initialize it with zero)\n      let sum = mf(row[0], bdata[0])\n      // loop matrix a columns\n      for (let 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    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n    // b dense\n    const bdata = b._data\n    const bsize = b._size\n    const bdt = b._datatype\n    // rows & columns\n    const arows = asize[0]\n    const acolumns = asize[1]\n    const bcolumns = bsize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let 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    const c = []\n\n    // loop matrix a rows\n    for (let i = 0; i < arows; i++) {\n      // current row\n      const row = adata[i]\n      // initialize row array\n      c[i] = []\n      // loop matrix b columns\n      for (let j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        let sum = mf(row[0], bdata[0][j])\n        // loop matrix a columns\n        for (let 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    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n    // b sparse\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype\n    // validate b matrix\n    if (!bvalues) { throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix') }\n    // rows & columns\n    const arows = asize[0]\n    const bcolumns = bsize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n    // equalScalar signature to use\n    let eq = equalScalar\n    // zero value\n    let 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    const cvalues = []\n    const cindex = []\n    const cptr = []\n    // c matrix\n    const 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 (let jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length\n      // indeces in column jb\n      const kb0 = bptr[jb]\n      const kb1 = bptr[jb + 1]\n      // do not process column jb if no data exists\n      if (kb1 > kb0) {\n        // last row mark processed\n        let last = 0\n        // loop a rows\n        for (let i = 0; i < arows; i++) {\n          // column mark\n          const mark = i + 1\n          // C[i, jb]\n          let cij\n          // values in b column j\n          for (let kb = kb0; kb < kb1; kb++) {\n            // row\n            const 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    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const adt = a._datatype\n    // validate a matrix\n    if (!avalues) { throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix') }\n    // b dense\n    const bdata = b._data\n    const bdt = b._datatype\n    // rows & columns\n    const arows = a._size[0]\n    const brows = b._size[0]\n    // result\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n    // equalScalar signature to use\n    let eq = equalScalar\n    // zero value\n    let 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    const x = []\n    // vector with marks indicating a value x[i] exists in a given column\n    const w = []\n\n    // update ptr\n    cptr[0] = 0\n    // rows in b\n    for (let ib = 0; ib < brows; ib++) {\n      // b[ib]\n      const vbi = bdata[ib]\n      // check b[ib] != 0, avoid loops\n      if (!eq(vbi, zero)) {\n        // A values & index in ib column\n        for (let ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n          // a row\n          const 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 (let p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      const 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    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const adt = a._datatype\n    // validate a matrix\n    if (!avalues) { throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix') }\n    // b dense\n    const bdata = b._data\n    const bdt = b._datatype\n    // rows & columns\n    const arows = a._size[0]\n    const brows = b._size[0]\n    const bcolumns = b._size[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n    // equalScalar signature to use\n    let eq = equalScalar\n    // zero value\n    let 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    const cvalues = []\n    const cindex = []\n    const cptr = []\n    // c matrix\n    const c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    })\n\n    // workspace\n    const x = []\n    // vector with marks indicating a value x[i] exists in a given column\n    const w = []\n\n    // loop b columns\n    for (let jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length\n      // mark in workspace for current column\n      const mark = jb + 1\n      // rows in jb\n      for (let ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        const 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 (let ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // a row\n            const 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 (let p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n        // row\n        const 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    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const adt = a._datatype\n    // b sparse\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bdt = b._datatype\n\n    // rows & columns\n    const arows = a._size[0]\n    const bcolumns = b._size[1]\n    // flag indicating both matrices (a & b) contain data\n    const values = avalues && bvalues\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let 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    const cvalues = values ? [] : undefined\n    const cindex = []\n    const cptr = []\n    // c matrix\n    const c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    })\n\n    // workspace\n    const x = values ? [] : undefined\n    // vector with marks indicating a value x[i] exists in a given column\n    const w = []\n    // variables\n    let ka, ka0, ka1, kb, kb0, kb1, ia, ib\n    // loop b columns\n    for (let jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length\n      // mark in workspace for current column\n      const 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 (let p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n          // row\n          const 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, extend({\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n\n    'Array, Array': function (x, y) {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y))\n\n      // use dense matrix implementation\n      const m = this(matrix(x), matrix(y))\n      // return array or scalar\n      return isMatrix(m) ? m.valueOf() : m\n    },\n\n    'Matrix, Matrix': function (x, y) {\n      // dimensions\n      const xsize = x.size()\n      const 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\n    'Matrix, Array': function (x, y) {\n      // use Matrix * Matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use Matrix * Matrix implementation\n      return this(matrix(x, y.storage()), y)\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm11(x, y, multiplyScalar, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, multiplyScalar, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm11(y, x, multiplyScalar, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, multiplyScalar, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf()\n    },\n\n    'any, any': multiplyScalar,\n\n    'any, any, ...any': function (x, y, rest) {\n      let result = this(x, y)\n\n      for (let i = 0; i < rest.length; i++) {\n        result = this(result, rest[i])\n      }\n\n      return result\n    }\n  }, multiplyScalar.signatures))\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { nthRootNumber } from '../../plain/number/index.js'\n\nconst name = 'nthRoot'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'BigNumber'\n]\n\nexport const createNthRoot = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, BigNumber }) => {\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm06 = createAlgorithm06({ typed, equalScalar })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Calculate the nth root of a value.\n   * The principal nth root of a positive real number A, is the positive real\n   * solution of the equation\n   *\n   *     x^root = A\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *     math.nthRoot(a)\n   *     math.nthRoot(a, root)\n   *\n   * Examples:\n   *\n   *     math.nthRoot(9, 2)    // returns 3, as 3^2 == 9\n   *     math.sqrt(9)          // returns 3, as 3^2 == 9\n   *     math.nthRoot(64, 3)   // returns 4, as 4^3 == 64\n   *\n   * See also:\n   *\n   *     sqrt, pow\n   *\n   * @param {number | BigNumber | Array | Matrix | Complex} a\n   *              Value for which to calculate the nth root\n   * @param {number | BigNumber} [root=2]    The root.\n   * @return {number | Complex | Array | Matrix} Returns the nth root of `a`\n   */\n  const complexErr = ('' +\n    'Complex number not supported in function nthRoot. ' +\n    'Use nthRoots instead.'\n  )\n  return typed(name, {\n\n    number: function (x) {\n      return nthRootNumber(x, 2)\n    },\n\n    'number, number': nthRootNumber,\n\n    BigNumber: function (x) {\n      return _bigNthRoot(x, new BigNumber(2))\n    },\n    Complex: function (x) {\n      throw new Error(complexErr)\n    },\n    'Complex, number': function (x, y) {\n      throw new Error(complexErr)\n    },\n    'BigNumber, BigNumber': _bigNthRoot,\n\n    'Array | Matrix': function (x) {\n      return this(x, 2)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      // density must be one (no zeros in matrix)\n      if (y.density() === 1) {\n        // sparse + sparse\n        return algorithm06(x, y, this)\n      } else {\n        // throw exception\n        throw new Error('Root must be non-zero')\n      }\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      // density must be one (no zeros in matrix)\n      if (y.density() === 1) {\n        // dense + sparse\n        return algorithm01(x, y, this, false)\n      } else {\n        // throw exception\n        throw new Error('Root must be non-zero')\n      }\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | BigNumber, SparseMatrix': function (x, y) {\n      // density must be one (no zeros in matrix)\n      if (y.density() === 1) {\n        // sparse - scalar\n        return algorithm11(y, x, this, true)\n      } else {\n        // throw exception\n        throw new Error('Root must be non-zero')\n      }\n    },\n\n    'number | BigNumber, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf()\n    },\n\n    'number | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf()\n    }\n  })\n\n  /**\n   * Calculate the nth root of a for BigNumbers, solve x^root == a\n   * https://rosettacode.org/wiki/Nth_root#JavaScript\n   * @param {BigNumber} a\n   * @param {BigNumber} root\n   * @private\n   */\n  function _bigNthRoot (a, root) {\n    const precision = BigNumber.precision\n    const Big = BigNumber.clone({ precision: precision + 2 })\n    const zero = new BigNumber(0)\n\n    const one = new Big(1)\n    const inv = root.isNegative()\n    if (inv) {\n      root = root.neg()\n    }\n\n    if (root.isZero()) {\n      throw new Error('Root must be non-zero')\n    }\n    if (a.isNegative() && !root.abs().mod(2).equals(1)) {\n      throw new Error('Root must be odd when a is negative.')\n    }\n\n    // edge cases zero and infinity\n    if (a.isZero()) {\n      return inv ? new Big(Infinity) : 0\n    }\n    if (!a.isFinite()) {\n      return inv ? zero : a\n    }\n\n    let x = a.abs().pow(one.div(root))\n    // If a < 0, we require that root is an odd integer,\n    // so (-1) ^ (1/root) = -1\n    x = a.isNeg() ? x.neg() : x\n    return new BigNumber((inv ? one.div(x) : x).toPrecision(precision))\n  }\n})\n\nexport const createNthRootNumber = /* #__PURE__ */ factory(name, ['typed'], ({ typed }) => {\n  return typed(name, {\n    number: nthRootNumber,\n    'number, number': nthRootNumber\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { signNumber } from '../../plain/number/index.js'\n\nconst name = 'sign'\nconst dependencies = ['typed', 'BigNumber', 'Fraction', 'complex']\n\nexport const createSign = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber, complex, Fraction }) => {\n  /**\n   * Compute the sign of a value. The sign of a value x is:\n   *\n   * -  1 when x > 0\n   * - -1 when x < 0\n   * -  0 when x == 0\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sign(x)\n   *\n   * Examples:\n   *\n   *    math.sign(3.5)               // returns 1\n   *    math.sign(-4.2)              // returns -1\n   *    math.sign(0)                 // returns 0\n   *\n   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]\n   *\n   * See also:\n   *\n   *    abs\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n   *            The number for which to determine the sign\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}e\n   *            The sign of `x`\n   */\n  return typed(name, {\n    number: signNumber,\n\n    Complex: function (x) {\n      return x.im === 0 ? complex(signNumber(x.re)) : x.sign()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(x.cmp(0))\n    },\n\n    Fraction: function (x) {\n      return new Fraction(x.s, 1)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since sign(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    Unit: function (x) {\n      if (!x._isDerived() && x.units[0].unit.offset !== 0) {\n        throw new TypeError('sign is ambiguous for units with offset')\n      }\n      return this(x.value)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'sqrt'\nconst dependencies = ['config', 'typed', 'Complex']\n\nexport const createSqrt = /* #__PURE__ */ factory(name, dependencies, ({ config, typed, Complex }) => {\n  /**\n   * Calculate the square root of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sqrt(x)\n   *\n   * Examples:\n   *\n   *    math.sqrt(25)                // returns 5\n   *    math.square(5)               // returns 25\n   *    math.sqrt(-4)                // returns Complex 2i\n   *\n   * See also:\n   *\n   *    square, multiply, cube, cbrt, sqrtm\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x\n   *            Value for which to calculate the square root.\n   * @return {number | BigNumber | Complex | Array | Matrix | Unit}\n   *            Returns the square root of `x`\n   */\n  return typed('sqrt', {\n    number: _sqrtNumber,\n\n    Complex: function (x) {\n      return x.sqrt()\n    },\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.sqrt()\n      } else {\n        // negative value -> downgrade to number to do complex value computation\n        return _sqrtNumber(x.toNumber())\n      }\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since sqrt(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    Unit: function (x) {\n      // Someday will work for complex units when they are implemented\n      return x.pow(0.5)\n    }\n\n  })\n\n  /**\n   * Calculate sqrt for a number\n   * @param {number} x\n   * @returns {number | Complex} Returns the square root of x\n   * @private\n   */\n  function _sqrtNumber (x) {\n    if (isNaN(x)) {\n      return NaN\n    } else if (x >= 0 || config.predictable) {\n      return Math.sqrt(x)\n    } else {\n      return new Complex(x, 0).sqrt()\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { squareNumber } from '../../plain/number/index.js'\n\nconst name = 'square'\nconst dependencies = ['typed']\n\nexport const createSquare = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the square of a value, `x * x`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.square(x)\n   *\n   * Examples:\n   *\n   *    math.square(2)           // returns number 4\n   *    math.square(3)           // returns number 9\n   *    math.pow(3, 2)           // returns number 9\n   *    math.multiply(3, 3)      // returns number 9\n   *\n   *    math.square([1, 2, 3, 4])  // returns Array [1, 4, 9, 16]\n   *\n   * See also:\n   *\n   *    multiply, cube, sqrt, pow\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n   *            Number for which to calculate the square\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}\n   *            Squared value\n   */\n  return typed(name, {\n    number: squareNumber,\n\n    Complex: function (x) {\n      return x.mul(x)\n    },\n\n    BigNumber: function (x) {\n      return x.times(x)\n    },\n\n    Fraction: function (x) {\n      return x.mul(x)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since square(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    Unit: function (x) {\n      return x.pow(2)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js'\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'subtract'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'addScalar',\n  'unaryMinus',\n  'DenseMatrix'\n]\n\nexport const createSubtract = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, addScalar, unaryMinus, DenseMatrix }) => {\n  // TODO: split function subtract in two: subtract and subtractScalar\n\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm05 = createAlgorithm05({ typed, equalScalar })\n  const algorithm10 = createAlgorithm10({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Subtract two values, `x - y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.subtract(x, y)\n   *\n   * Examples:\n   *\n   *    math.subtract(5.3, 2)        // returns number 3.3\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.subtract(a, b)          // returns Complex -2 + 2i\n   *\n   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]\n   *\n   *    const c = math.unit('2.1 km')\n   *    const d = math.unit('500m')\n   *    math.subtract(c, d)          // returns Unit 1.6 km\n   *\n   * See also:\n   *\n   *    add\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x\n   *            Initial value\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y\n   *            Value to subtract from `x`\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n   *            Subtraction of `x` and `y`\n   */\n  return typed(name, {\n\n    'number, number': function (x, y) {\n      return x - y\n    },\n\n    'Complex, Complex': function (x, y) {\n      return x.sub(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.minus(y)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.sub(y)\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (x.value === null) {\n        throw new Error('Parameter x contains a unit with undefined value')\n      }\n\n      if (y.value === null) {\n        throw new Error('Parameter y contains a unit with undefined value')\n      }\n\n      if (!x.equalBase(y)) {\n        throw new Error('Units do not match')\n      }\n\n      const res = x.clone()\n      res.value = this(res.value, y.value)\n      res.fixPrefix = false\n\n      return res\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      checkEqualDimensions(x, y)\n      return algorithm05(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      checkEqualDimensions(x, y)\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      checkEqualDimensions(x, y)\n      return algorithm01(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      checkEqualDimensions(x, y)\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm10(x, unaryMinus(y), addScalar)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm10(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n\n/**\n * Check whether matrix x and y have the same number of dimensions.\n * Throws a DimensionError when dimensions are not equal\n * @param {Matrix} x\n * @param {Matrix} y\n */\nfunction checkEqualDimensions (x, y) {\n  const xsize = x.size()\n  const ysize = y.size()\n\n  if (xsize.length !== ysize.length) {\n    throw new DimensionError(xsize.length, ysize.length)\n  }\n}\n","import { factory } from '../../utils/factory.js'\nimport { xgcdNumber } from '../../plain/number/index.js'\n\nconst name = 'xgcd'\nconst dependencies = ['typed', 'config', 'matrix', 'BigNumber']\n\nexport const createXgcd = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber }) => {\n  /**\n   * Calculate the extended greatest common divisor for two values.\n   * See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.\n   *\n   * Syntax:\n   *\n   *    math.xgcd(a, b)\n   *\n   * Examples:\n   *\n   *    math.xgcd(8, 12)             // returns [4, -1, 1]\n   *    math.gcd(8, 12)              // returns 4\n   *    math.xgcd(36163, 21199)      // returns [1247, -7, 12]\n   *\n   * See also:\n   *\n   *    gcd, lcm\n   *\n   * @param {number | BigNumber} a  An integer number\n   * @param {number | BigNumber} b  An integer number\n   * @return {Array}              Returns an array containing 3 integers `[div, m, n]`\n   *                              where `div = gcd(a, b)` and `a*m + b*n = div`\n   */\n  return typed(name, {\n    'number, number': function (a, b) {\n      const res = xgcdNumber(a, b)\n\n      return (config.matrix === 'Array')\n        ? res\n        : matrix(res)\n    },\n    'BigNumber, BigNumber': _xgcdBigNumber\n    // TODO: implement support for Fraction\n  })\n\n  /**\n   * Calculate xgcd for two BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @return {BigNumber[]} result\n   * @private\n   */\n  function _xgcdBigNumber (a, b) {\n    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n    let // used to swap two variables\n      t\n\n    let // quotient\n      q\n\n    let // remainder\n      r\n\n    const zero = new BigNumber(0)\n    const one = new BigNumber(1)\n    let x = zero\n    let lastx = one\n    let y = one\n    let lasty = zero\n\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function xgcd must be integer numbers')\n    }\n\n    while (!b.isZero()) {\n      q = a.div(b).floor()\n      r = a.mod(b)\n\n      t = x\n      x = lastx.minus(q.times(x))\n      lastx = t\n\n      t = y\n      y = lasty.minus(q.times(y))\n      lasty = t\n\n      a = b\n      b = r\n    }\n\n    let res\n    if (a.lt(zero)) {\n      res = [a.neg(), lastx.neg(), lasty.neg()]\n    } else {\n      res = [a, !a.isZero() ? lastx : 0, lasty]\n    }\n    return (config.matrix === 'Array') ? res : matrix(res)\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'invmod'\nconst dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger']\n\nexport const createInvmod = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, BigNumber, xgcd, equal, smaller, mod, add, isInteger }) => {\n  /**\n   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`\n   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.\n   *\n   * Syntax:\n   *\n   *    math.invmod(a, b)\n   *\n   * Examples:\n   *\n   *    math.invmod(8, 12)             // returns NaN\n   *    math.invmod(7, 13)             // return 2\n   *    math.invmod(15151, 15122)      // returns 10429\n   *\n   * See also:\n   *\n   *    gcd, xgcd\n   *\n   * @param {number | BigNumber} a  An integer number\n   * @param {number | BigNumber} b  An integer number\n   * @return {number | BigNumber }  Returns an integer number\n   *                              where `invmod(a,b)*a ≣ 1 (mod b)`\n   */\n  return typed(name, {\n    'number, number': invmod,\n    'BigNumber, BigNumber': invmod\n  })\n\n  function invmod (a, b) {\n    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers')\n    a = mod(a, b)\n    if (equal(b, 0)) throw new Error('Divisor must be non zero')\n    let res = xgcd(a, b)\n    res = res.valueOf()\n    let [gcd, inv] = res\n    if (!equal(gcd, BigNumber(1))) return NaN\n    inv = mod(inv, b)\n    if (smaller(inv, BigNumber(0))) inv = add(inv, b)\n    return inv\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm09'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createAlgorithm09 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).\n   * Callback function invoked NZA times, number of nonzero elements in A.\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function algorithm09 (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\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      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspaces\n    const x = cvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // vars\n    let i, j, k, k0, k1\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // column mark\n      const mark = j + 1\n      // check we need to process values\n      if (x) {\n        // loop B(:,j)\n        for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n          // row\n          i = bindex[k]\n          // update workspace\n          w[i] = mark\n          x[i] = bvalues[k]\n        }\n      }\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // check we need to process values\n        if (x) {\n          // b value @ i,j\n          const vb = w[i] === mark ? x[i] : zero\n          // invoke f\n          const vc = cf(avalues[k], vb)\n          // check zero value\n          if (!eq(vc, zero)) {\n            // push index\n            cindex.push(i)\n            // push value\n            cvalues.push(vc)\n          }\n        } else {\n          // push index\n          cindex.push(i)\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm09 } from '../../type/matrix/utils/algorithm09.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'dotMultiply'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'multiplyScalar'\n]\n\nexport const createDotMultiply = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, multiplyScalar }) => {\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm09 = createAlgorithm09({ typed, equalScalar })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Multiply two matrices element wise. The function accepts both matrices and\n   * scalar values.\n   *\n   * Syntax:\n   *\n   *    math.dotMultiply(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotMultiply(2, 4) // returns 8\n   *\n   *    a = [[9, 5], [6, 1]]\n   *    b = [[3, 2], [5, 2]]\n   *\n   *    math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]\n   *    math.multiply(a, b)    // returns [[52, 28], [23, 14]]\n   *\n   * See also:\n   *\n   *    multiply, divide, dotDivide\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Multiplication of `x` and `y`\n   */\n  return typed(name, {\n\n    'any, any': multiplyScalar,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm09(x, y, multiplyScalar, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, multiplyScalar, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm02(x, y, multiplyScalar, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, multiplyScalar)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm11(x, y, multiplyScalar, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, multiplyScalar, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm11(y, x, multiplyScalar, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, multiplyScalar, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf()\n    }\n  })\n})\n","/**\n * Bitwise and for Bignumbers\n *\n * Special Cases:\n *   N &  n =  N\n *   n &  0 =  0\n *   n & -1 =  n\n *   n &  n =  n\n *   I &  I =  I\n *  -I & -I = -I\n *   I & -I =  0\n *   I &  n =  n\n *   I & -n =  I\n *  -I &  n =  0\n *  -I & -n = -I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` & `y`, is fully precise\n * @private\n */\nexport function bitAndBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function bitAnd')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN)\n  }\n\n  if (x.isZero() || y.eq(-1) || x.eq(y)) {\n    return x\n  }\n  if (y.isZero() || x.eq(-1)) {\n    return y\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      if (x.isNegative() === y.isNegative()) {\n        return x\n      }\n      return new BigNumber(0)\n    }\n    if (!x.isFinite()) {\n      if (y.isNegative()) {\n        return x\n      }\n      if (x.isNegative()) {\n        return new BigNumber(0)\n      }\n      return y\n    }\n    if (!y.isFinite()) {\n      if (x.isNegative()) {\n        return y\n      }\n      if (y.isNegative()) {\n        return new BigNumber(0)\n      }\n      return x\n    }\n  }\n  return bitwise(x, y, function (a, b) { return a & b })\n}\n\n/**\n * Bitwise not\n * @param {BigNumber} x\n * @return {BigNumber} Result of ~`x`, fully precise\n *\n */\nexport function bitNotBigNumber (x) {\n  if (x.isFinite() && !x.isInteger()) {\n    throw new Error('Integer expected in function bitNot')\n  }\n\n  const BigNumber = x.constructor\n  const prevPrec = BigNumber.precision\n  BigNumber.config({ precision: 1E9 })\n\n  const result = x.plus(new BigNumber(1))\n  result.s = -result.s || null\n\n  BigNumber.config({ precision: prevPrec })\n  return result\n}\n\n/**\n * Bitwise OR for BigNumbers\n *\n * Special Cases:\n *   N |  n =  N\n *   n |  0 =  n\n *   n | -1 = -1\n *   n |  n =  n\n *   I |  I =  I\n *  -I | -I = -I\n *   I | -n = -1\n *   I | -I = -1\n *   I |  n =  I\n *  -I |  n = -I\n *  -I | -n = -n\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` | `y`, fully precise\n */\nexport function bitOrBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function bitOr')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN)\n  }\n\n  const negOne = new BigNumber(-1)\n  if (x.isZero() || y.eq(negOne) || x.eq(y)) {\n    return y\n  }\n  if (y.isZero() || x.eq(negOne)) {\n    return x\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if ((!x.isFinite() && !x.isNegative() && y.isNegative()) ||\n      (x.isNegative() && !y.isNegative() && !y.isFinite())) {\n      return negOne\n    }\n    if (x.isNegative() && y.isNegative()) {\n      return x.isFinite() ? x : y\n    }\n    return x.isFinite() ? y : x\n  }\n\n  return bitwise(x, y, function (a, b) { return a | b })\n}\n\n/**\n * Applies bitwise function to numbers\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @param {function (a, b)} func\n * @return {BigNumber}\n */\nexport function bitwise (x, y, func) {\n  const BigNumber = x.constructor\n\n  let xBits, yBits\n  const xSign = +(x.s < 0)\n  const ySign = +(y.s < 0)\n  if (xSign) {\n    xBits = decCoefficientToBinaryString(bitNotBigNumber(x))\n    for (let i = 0; i < xBits.length; ++i) {\n      xBits[i] ^= 1\n    }\n  } else {\n    xBits = decCoefficientToBinaryString(x)\n  }\n  if (ySign) {\n    yBits = decCoefficientToBinaryString(bitNotBigNumber(y))\n    for (let i = 0; i < yBits.length; ++i) {\n      yBits[i] ^= 1\n    }\n  } else {\n    yBits = decCoefficientToBinaryString(y)\n  }\n\n  let minBits, maxBits, minSign\n  if (xBits.length <= yBits.length) {\n    minBits = xBits\n    maxBits = yBits\n    minSign = xSign\n  } else {\n    minBits = yBits\n    maxBits = xBits\n    minSign = ySign\n  }\n\n  let shortLen = minBits.length\n  let longLen = maxBits.length\n  const expFuncVal = func(xSign, ySign) ^ 1\n  let outVal = new BigNumber(expFuncVal ^ 1)\n  let twoPower = new BigNumber(1)\n  const two = new BigNumber(2)\n\n  const prevPrec = BigNumber.precision\n  BigNumber.config({ precision: 1E9 })\n\n  while (shortLen > 0) {\n    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower)\n    }\n    twoPower = twoPower.times(two)\n  }\n  while (longLen > 0) {\n    if (func(minSign, maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower)\n    }\n    twoPower = twoPower.times(two)\n  }\n\n  BigNumber.config({ precision: prevPrec })\n\n  if (expFuncVal === 0) {\n    outVal.s = -outVal.s\n  }\n  return outVal\n}\n\n/* Extracted from decimal.js, and edited to specialize. */\nfunction decCoefficientToBinaryString (x) {\n  // Convert to string\n  const a = x.d // array with digits\n  let r = a[0] + ''\n\n  for (let i = 1; i < a.length; ++i) {\n    let s = a[i] + ''\n    for (let z = 7 - s.length; z--;) {\n      s = '0' + s\n    }\n\n    r += s\n  }\n\n  let j = r.length\n  while (r.charAt(j) === '0') {\n    j--\n  }\n\n  let xe = x.e\n  let str = r.slice(0, j + 1 || 1)\n  const strL = str.length\n  if (xe > 0) {\n    if (++xe > strL) {\n      // Append zeros.\n      xe -= strL\n      while (xe--) {\n        str += '0'\n      }\n    } else if (xe < strL) {\n      str = str.slice(0, xe) + '.' + str.slice(xe)\n    }\n  }\n\n  // Convert from base 10 (decimal) to base 2\n  const arr = [0]\n  for (let i = 0; i < str.length;) {\n    let arrL = arr.length\n    while (arrL--) {\n      arr[arrL] *= 10\n    }\n\n    arr[0] += parseInt(str.charAt(i++)) // convert to int\n    for (let j = 0; j < arr.length; ++j) {\n      if (arr[j] > 1) {\n        if (arr[j + 1] === null || arr[j + 1] === undefined) {\n          arr[j + 1] = 0\n        }\n\n        arr[j + 1] += arr[j] >> 1\n        arr[j] &= 1\n      }\n    }\n  }\n\n  return arr.reverse()\n}\n\n/**\n * Bitwise XOR for BigNumbers\n *\n * Special Cases:\n *   N ^  n =  N\n *   n ^  0 =  n\n *   n ^  n =  0\n *   n ^ -1 = ~n\n *   I ^  n =  I\n *   I ^ -n = -I\n *   I ^ -I = -1\n *  -I ^  n = -I\n *  -I ^ -n =  I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` ^ `y`, fully precise\n *\n */\nexport function bitXor (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function bitXor')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN)\n  }\n  if (x.isZero()) {\n    return y\n  }\n  if (y.isZero()) {\n    return x\n  }\n\n  if (x.eq(y)) {\n    return new BigNumber(0)\n  }\n\n  const negOne = new BigNumber(-1)\n  if (x.eq(negOne)) {\n    return bitNotBigNumber(y)\n  }\n  if (y.eq(negOne)) {\n    return bitNotBigNumber(x)\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      return negOne\n    }\n    return new BigNumber(x.isNegative() === y.isNegative()\n      ? Infinity\n      : -Infinity)\n  }\n  return bitwise(x, y, function (a, b) { return a ^ b })\n}\n\n/**\n * Bitwise left shift\n *\n * Special Cases:\n *  n << -n = N\n *  n <<  N = N\n *  N <<  n = N\n *  n <<  0 = n\n *  0 <<  n = 0\n *  I <<  I = N\n *  I <<  n = I\n *  n <<  I = I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` << `y`\n *\n */\nexport function leftShiftBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function leftShift')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) {\n    return new BigNumber(NaN)\n  }\n  if (x.isZero() || y.isZero()) {\n    return x\n  }\n  if (!x.isFinite() && !y.isFinite()) {\n    return new BigNumber(NaN)\n  }\n\n  // Math.pow(2, y) is fully precise for y < 55, and fast\n  if (y.lt(55)) {\n    return x.times(Math.pow(2, y.toNumber()) + '')\n  }\n  return x.times(new BigNumber(2).pow(y))\n}\n\n/*\n * Special Cases:\n *   n >> -n =  N\n *   n >>  N =  N\n *   N >>  n =  N\n *   I >>  I =  N\n *   n >>  0 =  n\n *   I >>  n =  I\n *  -I >>  n = -I\n *  -I >>  I = -I\n *   n >>  I =  I\n *  -n >>  I = -1\n *   0 >>  n =  0\n *\n * @param {BigNumber} value\n * @param {BigNumber} value\n * @return {BigNumber} Result of `x` >> `y`\n *\n */\nexport function rightArithShiftBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function rightArithShift')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) {\n    return new BigNumber(NaN)\n  }\n  if (x.isZero() || y.isZero()) {\n    return x\n  }\n  if (!y.isFinite()) {\n    if (x.isNegative()) {\n      return new BigNumber(-1)\n    }\n    if (!x.isFinite()) {\n      return new BigNumber(NaN)\n    }\n    return new BigNumber(0)\n  }\n\n  // Math.pow(2, y) is fully precise for y < 55, and fast\n  if (y.lt(55)) {\n    return x.div(Math.pow(2, y.toNumber()) + '').floor()\n  }\n  return x.div(new BigNumber(2).pow(y)).floor()\n}\n","import { isInteger } from '../../utils/number.js'\n\nconst n1 = 'number'\nconst n2 = 'number, number'\n\nexport function bitAndNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitAnd')\n  }\n\n  return x & y\n}\nbitAndNumber.signature = n2\n\nexport function bitNotNumber (x) {\n  if (!isInteger(x)) {\n    throw new Error('Integer expected in function bitNot')\n  }\n\n  return ~x\n}\nbitNotNumber.signature = n1\n\nexport function bitOrNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitOr')\n  }\n\n  return x | y\n}\nbitOrNumber.signature = n2\n\nexport function bitXorNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitXor')\n  }\n\n  return x ^ y\n}\nbitXorNumber.signature = n2\n\nexport function leftShiftNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function leftShift')\n  }\n\n  return x << y\n}\nleftShiftNumber.signature = n2\n\nexport function rightArithShiftNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function rightArithShift')\n  }\n\n  return x >> y\n}\nrightArithShiftNumber.signature = n2\n\nexport function rightLogShiftNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function rightLogShift')\n  }\n\n  return x >>> y\n}\nrightLogShiftNumber.signature = n2\n","import { bitAndBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js'\nimport { factory } from '../../utils/factory.js'\nimport { bitAndNumber } from '../../plain/number/index.js'\n\nconst name = 'bitAnd'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar'\n]\n\nexport const createBitAnd = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar }) => {\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm06 = createAlgorithm06({ typed, equalScalar })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Bitwise AND two values, `x & y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.bitAnd(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitAnd(53, 131)               // returns number 1\n   *\n   *    math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]\n   *\n   * See also:\n   *\n   *    bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x First value to and\n   * @param  {number | BigNumber | Array | Matrix} y Second value to and\n   * @return {number | BigNumber | Array | Matrix} AND of `x` and `y`\n   */\n  return typed(name, {\n\n    'number, number': bitAndNumber,\n\n    'BigNumber, BigNumber': bitAndBigNumber,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm06(x, y, this, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm02(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm11(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { bitNotBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { bitNotNumber } from '../../plain/number/index.js'\n\nconst name = 'bitNot'\nconst dependencies = ['typed']\n\nexport const createBitNot = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Bitwise NOT value, `~x`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.bitNot(x)\n   *\n   * Examples:\n   *\n   *    math.bitNot(1)               // returns number -2\n   *\n   *    math.bitNot([2, -3, 4])      // returns Array [-3, 2, 5]\n   *\n   * See also:\n   *\n   *    bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x Value to not\n   * @return {number | BigNumber | Array | Matrix} NOT of `x`\n   */\n  return typed(name, {\n    number: bitNotNumber,\n\n    BigNumber: bitNotBigNumber,\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { bitOrBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { factory } from '../../utils/factory.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js'\nimport { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { bitOrNumber } from '../../plain/number/index.js'\n\nconst name = 'bitOr'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createBitOr = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix }) => {\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm04 = createAlgorithm04({ typed, equalScalar })\n  const algorithm10 = createAlgorithm10({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Bitwise OR two values, `x | y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the lowest print base.\n   *\n   * Syntax:\n   *\n   *    math.bitOr(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitOr(1, 2)               // returns number 3\n   *\n   *    math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x First value to or\n   * @param  {number | BigNumber | Array | Matrix} y Second value to or\n   * @return {number | BigNumber | Array | Matrix} OR of `x` and `y`\n   */\n  return typed(name, {\n\n    'number, number': bitOrNumber,\n\n    'BigNumber, BigNumber': bitOrBigNumber,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm04(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm01(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm01(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm10(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm10(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm07'\nconst dependencies = ['typed', 'DenseMatrix']\n\nexport const createAlgorithm07 = /* #__PURE__ */ factory(name, dependencies, ({ typed, DenseMatrix }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j) = f(Aij, Bij)\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function algorithm07 (a, b, callback) {\n    // sparse matrix arrays\n    const asize = a._size\n    const adt = a._datatype\n    // sparse matrix arrays\n    const bsize = b._size\n    const bdt = b._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // vars\n    let i, j\n\n    // result arrays\n    const cdata = []\n    // initialize c\n    for (i = 0; i < rows; i++) { cdata[i] = [] }\n\n    // workspaces\n    const xa = []\n    const xb = []\n    // marks indicating we have a value in x for a given column\n    const wa = []\n    const wb = []\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // columns mark\n      const mark = j + 1\n      // scatter the values of A(:,j) into workspace\n      _scatter(a, j, wa, xa, mark)\n      // scatter the values of B(:,j) into workspace\n      _scatter(b, j, wb, xb, mark)\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // matrix values @ i,j\n        const va = wa[i] === mark ? xa[i] : zero\n        const vb = wb[i] === mark ? xb[i] : zero\n        // invoke callback\n        cdata[i][j] = cf(va, vb)\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n\n  function _scatter (m, j, w, x, mark) {\n    // a arrays\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    // loop values in column j\n    for (let k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      const i = index[k]\n      // update workspace\n      w[i] = mark\n      x[i] = values[k]\n    }\n  }\n})\n","import { bitXor as bigBitXor } from '../../utils/bignumber/bitwise.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { factory } from '../../utils/factory.js'\nimport { bitXorNumber } from '../../plain/number/index.js'\n\nconst name = 'bitXor'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'DenseMatrix'\n]\n\nexport const createBitXor = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Bitwise XOR two values, `x ^ y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.bitXor(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitXor(1, 2)               // returns number 3\n   *\n   *    math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x First value to xor\n   * @param  {number | BigNumber | Array | Matrix} y Second value to xor\n   * @return {number | BigNumber | Array | Matrix} XOR of `x` and `y`\n   */\n  return typed(name, {\n\n    'number, number': bitXorNumber,\n\n    'BigNumber, BigNumber': bigBitXor,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'arg'\nconst dependencies = ['typed']\n\nexport const createArg = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the argument of a complex value.\n   * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.arg(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 2)\n   *    math.arg(a) / math.pi          // returns number 0.25\n   *\n   *    const b = math.complex('2 + 3i')\n   *    math.arg(b)                    // returns number 0.982793723247329\n   *    math.atan2(3, 2)               // returns number 0.982793723247329\n   *\n   * See also:\n   *\n   *    re, im, conj, abs\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The argument of x\n   */\n  return typed(name, {\n    number: function (x) {\n      return Math.atan2(0, x)\n    },\n\n    BigNumber: function (x) {\n      return x.constructor.atan2(0, x)\n    },\n\n    Complex: function (x) {\n      return x.arg()\n    },\n\n    // TODO: implement BigNumber support for function arg\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'conj'\nconst dependencies = ['typed']\n\nexport const createConj = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\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: function (x) {\n      return x\n    },\n\n    BigNumber: function (x) {\n      return x\n    },\n\n    Complex: function (x) {\n      return x.conjugate()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'im'\nconst dependencies = ['typed']\n\nexport const createIm = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Get the imaginary part of a complex number.\n   * For a complex number `a + bi`, the function returns `b`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.im(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number -5.2\n   *    math.re(math.complex(2.4))     // returns number 0\n   *\n   * See also:\n   *\n   *    re, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The imaginary part of x\n   */\n  return typed(name, {\n    number: function (x) {\n      return 0\n    },\n\n    BigNumber: function (x) {\n      return x.mul(0)\n    },\n\n    Fraction: function (x) {\n      return x.mul(0)\n    },\n\n    Complex: function (x) {\n      return x.im\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 're'\nconst dependencies = ['typed']\n\nexport const createRe = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Get the real part of a complex number.\n   * For a complex number `a + bi`, the function returns `a`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.re(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number 0\n   *    math.re(math.complex(2.4))     // returns number 2.4\n   *\n   * See also:\n   *\n   *    im, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The real part of x\n   */\n  return typed(name, {\n    number: function (x) {\n      return x\n    },\n\n    BigNumber: function (x) {\n      return x\n    },\n\n    Fraction: function (x) {\n      return x\n    },\n\n    Complex: function (x) {\n      return x.re\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","const n1 = 'number'\nconst n2 = 'number, number'\n\nexport function notNumber (x) {\n  return !x\n}\nnotNumber.signature = n1\n\nexport function orNumber (x, y) {\n  return !!(x || y)\n}\norNumber.signature = n2\n\nexport function xorNumber (x, y) {\n  return !!x !== !!y\n}\nxorNumber.signature = n2\n\nexport function andNumber (x, y) {\n  return !!(x && y)\n}\nandNumber.signature = n2\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { notNumber } from '../../plain/number/index.js'\n\nconst name = 'not'\nconst dependencies = ['typed']\n\nexport const createNot = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Logical `not`. Flips boolean value of a given parameter.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.not(x)\n   *\n   * Examples:\n   *\n   *    math.not(2)      // returns false\n   *    math.not(0)      // returns true\n   *    math.not(true)   // returns false\n   *\n   *    a = [2, -7, 0]\n   *    math.not(a)      // returns [false, false, true]\n   *\n   * See also:\n   *\n   *    and, or, xor\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when input is a zero or empty value.\n   */\n  return typed(name, {\n    number: notNumber,\n\n    Complex: function (x) {\n      return x.re === 0 && x.im === 0\n    },\n\n    BigNumber: function (x) {\n      return x.isZero() || x.isNaN()\n    },\n\n    Unit: function (x) {\n      return x.value !== null ? this(x.value) : true\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js'\nimport { factory } from '../../utils/factory.js'\nimport { orNumber } from '../../plain/number/index.js'\n\nconst name = 'or'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createOr = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm05 = createAlgorithm05({ typed, equalScalar })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.or(x, y)\n   *\n   * Examples:\n   *\n   *    math.or(2, 4)   // returns true\n   *\n   *    a = [2, 5, 0]\n   *    b = [0, 22, 0]\n   *    c = 0\n   *\n   *    math.or(a, b)   // returns [true, true, false]\n   *    math.or(b, c)   // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    and, not, xor\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when one of the inputs is defined with a nonzero/nonempty value.\n   */\n  return typed(name, {\n\n    'number, number': orNumber,\n\n    'Complex, Complex': function (x, y) {\n      return (x.re !== 0 || x.im !== 0) || (y.re !== 0 || y.im !== 0)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return (!x.isZero() && !x.isNaN()) || (!y.isZero() && !y.isNaN())\n    },\n\n    'Unit, Unit': function (x, y) {\n      return this(x.value || 0, y.value || 0)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm05(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { factory } from '../../utils/factory.js'\nimport { xorNumber } from '../../plain/number/index.js'\n\nconst name = 'xor'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'DenseMatrix'\n]\n\nexport const createXor = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.xor(x, y)\n   *\n   * Examples:\n   *\n   *    math.xor(2, 4)   // returns false\n   *\n   *    a = [2, 0, 0]\n   *    b = [2, 7, 0]\n   *    c = 0\n   *\n   *    math.xor(a, b)   // returns [false, true, false]\n   *    math.xor(a, c)   // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    and, not, or\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when one and only one input is defined with a nonzero/nonempty value.\n   */\n  return typed(name, {\n\n    'number, number': xorNumber,\n\n    'Complex, Complex': function (x, y) {\n      return ((x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0))\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return ((!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN()))\n    },\n\n    'Unit, Unit': function (x, y) {\n      return this(x.value || 0, y.value || 0)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { arraySize } from '../../utils/array.js'\nimport { IndexError } from '../../error/IndexError.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'concat'\nconst dependencies = ['typed', 'matrix', 'isInteger']\n\nexport const createConcat = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, isInteger }) => {\n  /**\n   * Concatenate two or more matrices.\n   *\n   * Syntax:\n   *\n   *     math.concat(A, B, C, ...)\n   *     math.concat(A, B, C, ..., dim)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *   By default the last dimension of the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [5, 6]]\n   *    const B = [[3, 4], [7, 8]]\n   *\n   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]\n   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]\n   *    math.concat('hello', ' ', 'world') // returns 'hello world'\n   *\n   * See also:\n   *\n   *    size, squeeze, subset, transpose\n   *\n   * @param {... Array | Matrix} args     Two or more matrices\n   * @return {Array | Matrix} Concatenated matrix\n   */\n  return typed(name, {\n    // TODO: change signature to '...Array | Matrix, dim?' when supported\n    '...Array | Matrix | number | BigNumber': function (args) {\n      let i\n      const len = args.length\n      let dim = -1 // zero-based dimension\n      let prevDim\n      let asMatrix = false\n      const matrices = [] // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        const arg = args[i]\n\n        // test whether we need to return a Matrix (if not we return an Array)\n        if (isMatrix(arg)) {\n          asMatrix = true\n        }\n\n        if (isNumber(arg) || isBigNumber(arg)) {\n          if (i !== len - 1) {\n            throw new Error('Dimension must be specified as last argument')\n          }\n\n          // last argument contains the dimension on which to concatenate\n          prevDim = dim\n          dim = arg.valueOf() // change BigNumber to number\n\n          if (!isInteger(dim)) {\n            throw new TypeError('Integer number expected for dimension')\n          }\n\n          if (dim < 0 || (i > 0 && dim > prevDim)) {\n            // TODO: would be more clear when throwing a DimensionError here\n            throw new IndexError(dim, prevDim + 1)\n          }\n        } else {\n          // this is a matrix or array\n          const m = clone(arg).valueOf()\n          const size = arraySize(m)\n          matrices[i] = m\n          prevDim = dim\n          dim = size.length - 1\n\n          // verify whether each of the matrices has the same number of dimensions\n          if (i > 0 && dim !== prevDim) {\n            throw new DimensionError(prevDim + 1, dim + 1)\n          }\n        }\n      }\n\n      if (matrices.length === 0) {\n        throw new SyntaxError('At least one matrix expected')\n      }\n\n      let res = matrices.shift()\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim, 0)\n      }\n\n      return asMatrix ? matrix(res) : res\n    },\n\n    '...string': function (args) {\n      return args.join('')\n    }\n  })\n})\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices is not cloned.\n * @param {Array} a             Multi dimensional array\n * @param {Array} b             Multi dimensional array\n * @param {number} concatDim    The dimension on which to concatenate (zero-based)\n * @param {number} dim          The current dim (zero-based)\n * @return {Array} c            The concatenated matrix\n * @private\n */\nfunction _concat (a, b, concatDim, dim) {\n  if (dim < concatDim) {\n    // recurse into next dimension\n    if (a.length !== b.length) {\n      throw new DimensionError(a.length, b.length)\n    }\n\n    const c = []\n    for (let i = 0; i < a.length; i++) {\n      c[i] = _concat(a[i], b[i], concatDim, dim + 1)\n    }\n    return c\n  } else {\n    // concatenate this dimension\n    return a.concat(b)\n  }\n}\n","import { factory } from '../../utils/factory.js'\nimport { clone } from '../../utils/object.js'\nimport { validateIndex } from '../../utils/array.js'\n\nconst name = 'column'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\nexport const createColumn = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  /**\n   * Return a column from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.column(value, index)\n   *\n   * Example:\n   *\n   *     // get a column\n   *     const d = [[1, 2], [3, 4]]\n   *     math.column(d, 1) // returns [[2], [4]]\n   *\n   * See also:\n   *\n   *     row\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} column           The index of the column\n   * @return {Array | Matrix}         The retrieved column\n   */\n  return typed(name, {\n    'Matrix, number': _column,\n\n    'Array, number': function (value, column) {\n      return _column(matrix(clone(value)), column).valueOf()\n    }\n  })\n\n  /**\n   * Retrieve a column of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} column  The index of the column\n   * @return {Matrix}        The retrieved column\n   */\n  function _column (value, column) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported')\n    }\n\n    validateIndex(column, value.size()[1])\n\n    const rowRange = range(0, value.size()[0])\n    const index = new Index(rowRange, column)\n    return value.subset(index)\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'count'\nconst dependencies = ['typed', 'size', 'prod']\n\nexport const createCount = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, prod }) => {\n  /**\n   * Count the number of elements of a matrix, array or string.\n   *\n   * Syntax:\n   *\n   *     math.count(x)\n   *\n   * Examples:\n   *\n   *     math.count('hello world')        // returns 11\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.count(A)                    // returns 6\n   *     math.count(math.range(1,6))      // returns 5\n   *\n   * See also:\n   *\n   *     size\n   *\n   * @param {string | Array | Matrix} x  A matrix or string\n   * @return {number} An integer with the elements in `x`.\n   */\n  return typed(name, {\n    string: function (x) {\n      return x.length\n    },\n\n    'Matrix | Array': function (x) {\n      return prod(size(x))\n    }\n  })\n})\n","import { arraySize, squeeze } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'cross'\nconst dependencies = ['typed', 'matrix', 'subtract', 'multiply']\n\nexport const createCross = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtract, multiply }) => {\n  /**\n   * Calculate the cross product for two vectors in three dimensional space.\n   * The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined\n   * as:\n   *\n   *    cross(A, B) = [\n   *      a2 * b3 - a3 * b2,\n   *      a3 * b1 - a1 * b3,\n   *      a1 * b2 - a2 * b1\n   *    ]\n   *\n   * If one of the input vectors has a dimension greater than 1, the output\n   * vector will be a 1x3 (2-dimensional) matrix.\n   *\n   * Syntax:\n   *\n   *    math.cross(x, y)\n   *\n   * Examples:\n   *\n   *    math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]\n   *    math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]\n   *    math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]\n   *    math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]\n   *\n   * See also:\n   *\n   *    dot, multiply\n   *\n   * @param  {Array | Matrix} x   First vector\n   * @param  {Array | Matrix} y   Second vector\n   * @return {Array | Matrix}     Returns the cross product of `x` and `y`\n   */\n  return typed(name, {\n    'Matrix, Matrix': function (x, y) {\n      return matrix(_cross(x.toArray(), y.toArray()))\n    },\n\n    'Matrix, Array': function (x, y) {\n      return matrix(_cross(x.toArray(), y))\n    },\n\n    'Array, Matrix': function (x, y) {\n      return matrix(_cross(x, y.toArray()))\n    },\n\n    'Array, Array': _cross\n  })\n\n  /**\n   * Calculate the cross product for two arrays\n   * @param {Array} x  First vector\n   * @param {Array} y  Second vector\n   * @returns {Array} Returns the cross product of x and y\n   * @private\n   */\n  function _cross (x, y) {\n    const highestDimension = Math.max(arraySize(x).length, arraySize(y).length)\n\n    x = squeeze(x)\n    y = squeeze(y)\n\n    const xSize = arraySize(x)\n    const ySize = arraySize(y)\n\n    if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {\n      throw new RangeError('Vectors with length 3 expected ' +\n      '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])')\n    }\n\n    const product = [\n      subtract(multiply(x[1], y[2]), multiply(x[2], y[1])),\n      subtract(multiply(x[2], y[0]), multiply(x[0], y[2])),\n      subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))\n    ]\n\n    if (highestDimension > 1) {\n      return [product]\n    } else {\n      return product\n    }\n  }\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { arraySize } from '../../utils/array.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'diag'\nconst dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix']\n\nexport const createDiag = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, DenseMatrix, SparseMatrix }) => {\n  /**\n   * Create a diagonal matrix or retrieve the diagonal of a matrix\n   *\n   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.\n   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.\n   * When k is positive, the values are placed on the super diagonal.\n   * When k is negative, the values are placed on the sub diagonal.\n   *\n   * Syntax:\n   *\n   *     math.diag(X)\n   *     math.diag(X, format)\n   *     math.diag(X, k)\n   *     math.diag(X, k, format)\n   *\n   * Examples:\n   *\n   *     // create a diagonal matrix\n   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]\n   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *\n   *    // retrieve the diagonal from a matrix\n   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\n   *    math.diag(a)   // returns [1, 5, 9]\n   *\n   * See also:\n   *\n   *     ones, zeros, identity\n   *\n   * @param {Matrix | Array} x          A two dimensional matrix or a vector\n   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled\n   *                                    in or retrieved.\n   * @param {string} [format='dense']   The matrix storage format.\n   *\n   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.\n   */\n  return typed(name, {\n    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments\n\n    Array: function (x) {\n      return _diag(x, 0, arraySize(x), null)\n    },\n\n    'Array, number': function (x, k) {\n      return _diag(x, k, arraySize(x), null)\n    },\n\n    'Array, BigNumber': function (x, k) {\n      return _diag(x, k.toNumber(), arraySize(x), null)\n    },\n\n    'Array, string': function (x, format) {\n      return _diag(x, 0, arraySize(x), format)\n    },\n\n    'Array, number, string': function (x, k, format) {\n      return _diag(x, k, arraySize(x), format)\n    },\n\n    'Array, BigNumber, string': function (x, k, format) {\n      return _diag(x, k.toNumber(), arraySize(x), format)\n    },\n\n    Matrix: function (x) {\n      return _diag(x, 0, x.size(), x.storage())\n    },\n\n    'Matrix, number': function (x, k) {\n      return _diag(x, k, x.size(), x.storage())\n    },\n\n    'Matrix, BigNumber': function (x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage())\n    },\n\n    'Matrix, string': function (x, format) {\n      return _diag(x, 0, x.size(), format)\n    },\n\n    'Matrix, number, string': function (x, k, format) {\n      return _diag(x, k, x.size(), format)\n    },\n\n    'Matrix, BigNumber, string': function (x, k, format) {\n      return _diag(x, k.toNumber(), x.size(), format)\n    }\n  })\n\n  /**\n   * Creeate diagonal matrix from a vector or vice versa\n   * @param {Array | Matrix} x\n   * @param {number} k\n   * @param {string} format Storage format for matrix. If null,\n   *                          an Array is returned\n   * @returns {Array | Matrix}\n   * @private\n   */\n  function _diag (x, k, size, format) {\n    if (!isInteger(k)) {\n      throw new TypeError('Second parameter in function diag must be an integer')\n    }\n\n    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // check dimensions\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper)\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper)\n    }\n    throw new RangeError('Matrix for function diag must be 2 dimensional')\n  }\n\n  function _createDiagonalMatrix (x, k, format, l, kSub, kSuper) {\n    // matrix size\n    const ms = [l + kSub, l + kSuper]\n\n    if (format && format !== 'sparse' && format !== 'dense') {\n      throw new TypeError(`Unknown matrix type ${format}\"`)\n    }\n\n    // create diagonal matrix\n    const m = format === 'sparse'\n      ? SparseMatrix.diagonal(ms, x, k)\n      : DenseMatrix.diagonal(ms, x, k)\n    // check we need to return a matrix\n    return format !== null ? m : m.valueOf()\n  }\n\n  function _getDiagonal (x, k, format, s, kSub, kSuper) {\n    // check x is a Matrix\n    if (isMatrix(x)) {\n      // get diagonal matrix\n      const dm = x.diagonal(k)\n      // check we need to return a matrix\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) { return matrix(dm, format) }\n        return dm\n      }\n      return dm.valueOf()\n    }\n    // vector size\n    const n = Math.min(s[0] - kSub, s[1] - kSuper)\n    // diagonal values\n    const vector = []\n    // loop diagonal\n    for (let i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper]\n    }\n    // check we need to return a matrix\n    return format !== null ? matrix(vector) : vector\n  }\n})\n","// (c) 2018, Mariusz Nowak\n// SPDX-License-Identifier: ISC\n// Derived from https://github.com/medikoo/lru-queue\nexport function lruQueue (limit) {\n  let size = 0\n  let base = 1\n  let queue = Object.create(null)\n  let map = Object.create(null)\n  let index = 0\n  const del = function (id) {\n    const oldIndex = map[id]\n    if (!oldIndex) return\n    delete queue[oldIndex]\n    delete map[id]\n    --size\n    if (base !== oldIndex) return\n    if (!size) {\n      index = 0\n      base = 1\n      return\n    }\n    while (!hasOwnProperty.call(queue, ++base)) continue\n  }\n  limit = Math.abs(limit)\n  return {\n    hit: function (id) {\n      const oldIndex = map[id]; const nuIndex = ++index\n      queue[nuIndex] = id\n      map[id] = nuIndex\n      if (!oldIndex) {\n        ++size\n        if (size <= limit) return undefined\n        id = queue[base]\n        del(id)\n        return id\n      }\n      delete queue[oldIndex]\n      if (base !== oldIndex) return undefined\n      while (!hasOwnProperty.call(queue, ++base)) continue\n      return undefined\n    },\n    delete: del,\n    clear: function () {\n      size = index = 0\n      base = 1\n      queue = Object.create(null)\n      map = Object.create(null)\n    }\n  }\n};\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, { hasher, limit } = {}) {\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit\n  hasher = hasher == null ? JSON.stringify : hasher\n\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    const args = []\n    for (let i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i]\n    }\n    const hash = hasher(args)\n\n    if (memoize.cache.values.has(hash)) {\n      memoize.cache.lru.hit(hash)\n      return memoize.cache.values.get(hash)\n    }\n\n    const newVal = fn.apply(fn, args)\n    memoize.cache.values.set(hash, newVal)\n    memoize.cache.values.delete(memoize.cache.lru.hit(hash))\n\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  const memoize = function memoize () {\n    const args = []\n    for (let i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i]\n    }\n\n    for (let c = 0; c < memoize.cache.length; c++) {\n      const cached = memoize.cache[c]\n\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\n    const res = fn.apply(fn, args)\n    memoize.cache.unshift({ args, res })\n\n    return res\n  }\n\n  memoize.cache = []\n\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 || {})\n    .reduce(function (args, signature) {\n      const count = (signature.match(/,/g) || []).length + 1\n      return Math.max(args, count)\n    }, -1)\n}\n","import { filter, filterRegExp } from '../../utils/array.js'\nimport { maxArgumentCount } from '../../utils/function.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'filter'\nconst dependencies = ['typed']\n\nexport const createFilter = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Filter the items in an array or one dimensional matrix.\n   *\n   * Syntax:\n   *\n   *    math.filter(x, test)\n   *\n   * Examples:\n   *\n   *    function isPositive (x) {\n   *      return x > 0\n   *    }\n   *    math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]\n   *\n   *    math.filter([\"23\", \"foo\", \"100\", \"55\", \"bar\"], /[0-9]+/) // returns [\"23\", \"100\", \"55\"]\n   *\n   * See also:\n   *\n   *    forEach, map, sort\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to filter\n   * @param {Function | RegExp} test\n   *        A function or regular expression to test items.\n   *        All entries for which `test` returns true are returned.\n   *        When `test` is a function, it is invoked with three parameters:\n   *        the value of the element, the index of the element, and the\n   *        matrix/array being traversed. The function must return a boolean.\n   * @return {Matrix | Array} Returns the filtered matrix.\n   */\n  return typed('filter', {\n    'Array, function': _filterCallback,\n\n    'Matrix, function': function (x, test) {\n      return x.create(_filterCallback(x.toArray(), test))\n    },\n\n    'Array, RegExp': filterRegExp,\n\n    'Matrix, RegExp': function (x, test) {\n      return x.create(filterRegExp(x.toArray(), test))\n    }\n  })\n})\n\n/**\n * Filter values in a callback given a callback function\n * @param {Array} x\n * @param {Function} callback\n * @return {Array} Returns the filtered array\n * @private\n */\nfunction _filterCallback (x, callback) {\n  // figure out what number of arguments the callback function expects\n  const args = maxArgumentCount(callback)\n\n  return filter(x, function (value, index, array) {\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 { // 3 or -1\n      return callback(value, [index], array)\n    }\n  })\n}\n","import { clone } from '../../utils/object.js'\nimport { flatten as flattenArray } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'flatten'\nconst dependencies = ['typed', 'matrix']\n\nexport const createFlatten = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  /**\n   * Flatten a multi dimensional matrix into a single dimensional matrix.\n   * It is guaranteed to always return a clone of the argument.\n   *\n   * Syntax:\n   *\n   *    math.flatten(x)\n   *\n   * Examples:\n   *\n   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]\n   *\n   * See also:\n   *\n   *    concat, resize, size, squeeze\n   *\n   * @param {Matrix | Array} x   Matrix to be flattened\n   * @return {Matrix | Array} Returns the flattened matrix\n   */\n  return typed(name, {\n    Array: function (x) {\n      return flattenArray(clone(x))\n    },\n\n    Matrix: function (x) {\n      const flat = flattenArray(clone(x.toArray()))\n      // TODO: return the same matrix type as x\n      return matrix(flat)\n    }\n  })\n})\n","import { maxArgumentCount } from '../../utils/function.js'\nimport { forEach as forEachArray } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'forEach'\nconst dependencies = ['typed']\n\nexport const createForEach = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterate over all elements of a matrix/array, and executes the given callback function.\n   *\n   * Syntax:\n   *\n   *    math.forEach(x, callback)\n   *\n   * Examples:\n   *\n   *    math.forEach([1, 2, 3], function(value) {\n   *      console.log(value)\n   *    })\n   *    // outputs 1, 2, 3\n   *\n   * See also:\n   *\n   *    filter, map, sort\n   *\n   * @param {Matrix | Array} x    The matrix to iterate on.\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/array being traversed.\n   */\n  return typed(name, {\n    'Array, function': _forEach,\n\n    'Matrix, function': function (x, callback) {\n      return x.forEach(callback)\n    }\n  })\n})\n\n/**\n * forEach for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @private\n */\nfunction _forEach (array, callback) {\n  // figure out what number of arguments the callback function expects\n  const args = maxArgumentCount(callback)\n\n  const recurse = function (value, index) {\n    if (Array.isArray(value)) {\n      forEachArray(value, function (child, i) {\n        // we create a copy of the index array and append the new index value\n        recurse(child, index.concat(i))\n      })\n    } else {\n      // invoke the callback function with the right number of arguments\n      if (args === 1) {\n        callback(value)\n      } else if (args === 2) {\n        callback(value, index)\n      } else { // 3 or -1\n        callback(value, index, array)\n      }\n    }\n  }\n  recurse(array, [])\n}\n","import { factory } from '../../utils/factory.js'\nimport { getArrayDataType } from '../../utils/array.js'\nimport { typeOf } from '../../utils/is.js'\n\nconst name = 'getMatrixDataType'\nconst dependencies = ['typed']\n\nexport const createGetMatrixDataType = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Find the data type of all elements in a matrix or array,\n   * for example 'number' if all items are a number and 'Complex' if all values\n   * are complex numbers.\n   * If a matrix contains more than one data type, it will return 'mixed'.\n   *\n   * Syntax:\n   *\n   *    math.getMatrixDataType(x)\n   *\n   * Examples:\n   *\n   *    const x = [ [1, 2, 3], [4, 5, 6] ]\n   *    const mixedX = [ [1, true], [2, 3] ]\n   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3] ]\n   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]\n   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]\n   *    const sparse = math.sparse(x)\n   *    const dense = math.matrix(x)\n   *    math.getMatrixDataType(x)   // returns 'number'\n   *    math.getMatrixDataType(sparse)   // returns 'number'\n   *    math.getMatrixDataType(dense)   // returns 'number'\n   *    math.getMatrixDataType(mixedX) // returns 'mixed'\n   *    math.getMatrixDataType(fractionX) // returns 'Fraction'\n   *    math.getMatrixDataType(unitX) // returns 'Unit'\n   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'\n   *\n   * See also:\n   *  SparseMatrix, DenseMatrix\n   *\n   * @param {...Matrix | Array} x   The Matrix with values.\n   *\n   * @return {string} A string representation of the matrix type\n   */\n  return typed(name, {\n    Array: function (x) {\n      return getArrayDataType(x, typeOf)\n    },\n    Matrix: function (x) {\n      return x.getDataType()\n    }\n  })\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { resize } from '../../utils/array.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'identity'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'BigNumber',\n  'DenseMatrix',\n  'SparseMatrix'\n]\n\nexport const createIdentity = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber, DenseMatrix, SparseMatrix }) => {\n  /**\n   * Create a 2-dimensional identity matrix with size m x n or n x n.\n   * The matrix has ones on the diagonal and zeros elsewhere.\n   *\n   * Syntax:\n   *\n   *    math.identity(n)\n   *    math.identity(n, format)\n   *    math.identity(m, n)\n   *    math.identity(m, n, format)\n   *    math.identity([m, n])\n   *    math.identity([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]\n   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]\n   *\n   * See also:\n   *\n   *    diag, ones, zeros, size, range\n   *\n   * @param {...number | Matrix | Array} size   The size for the matrix\n   * @param {string} [format]                   The Matrix storage format\n   *\n   * @return {Matrix | Array | number} A matrix with ones on the diagonal.\n   */\n  return typed(name, {\n    '': function () {\n      return (config.matrix === 'Matrix') ? matrix([]) : []\n    },\n\n    string: function (format) {\n      return matrix(format)\n    },\n\n    'number | BigNumber': function (rows) {\n      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined)\n    },\n\n    'number | BigNumber, string': function (rows, format) {\n      return _identity(rows, rows, format)\n    },\n\n    'number | BigNumber, number | BigNumber': function (rows, cols) {\n      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined)\n    },\n\n    'number | BigNumber, number | BigNumber, string': function (rows, cols, format) {\n      return _identity(rows, cols, format)\n    },\n\n    Array: function (size) {\n      return _identityVector(size)\n    },\n\n    'Array, string': function (size, format) {\n      return _identityVector(size, format)\n    },\n\n    Matrix: function (size) {\n      return _identityVector(size.valueOf(), size.storage())\n    },\n\n    'Matrix, string': function (size, format) {\n      return _identityVector(size.valueOf(), format)\n    }\n  })\n\n  function _identityVector (size, format) {\n    switch (size.length) {\n      case 0: return format ? matrix(format) : []\n      case 1: return _identity(size[0], size[0], format)\n      case 2: return _identity(size[0], size[1], format)\n      default: throw new Error('Vector containing two values expected')\n    }\n  }\n\n  /**\n   * Create an identity matrix\n   * @param {number | BigNumber} rows\n   * @param {number | BigNumber} cols\n   * @param {string} [format]\n   * @returns {Matrix}\n   * @private\n   */\n  function _identity (rows, cols, format) {\n    // BigNumber constructor with the right precision\n    const Big = (isBigNumber(rows) || isBigNumber(cols))\n      ? BigNumber\n      : null\n\n    if (isBigNumber(rows)) rows = rows.toNumber()\n    if (isBigNumber(cols)) cols = cols.toNumber()\n\n    if (!isInteger(rows) || rows < 1) {\n      throw new Error('Parameters in function identity must be positive integers')\n    }\n    if (!isInteger(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers')\n    }\n\n    const one = Big ? new BigNumber(1) : 1\n    const defaultValue = Big ? new Big(0) : 0\n    const size = [rows, cols]\n\n    // check we need to return a matrix\n    if (format) {\n      // create diagonal matrix (use optimized implementation for storage format)\n      if (format === 'sparse') {\n        return SparseMatrix.diagonal(size, one, 0, defaultValue)\n      }\n      if (format === 'dense') {\n        return DenseMatrix.diagonal(size, one, 0, defaultValue)\n      }\n      throw new TypeError(`Unknown matrix type \"${format}\"`)\n    }\n\n    // create and resize array\n    const res = resize([], size, defaultValue)\n    // fill in ones on the diagonal\n    const minimum = rows < cols ? rows : cols\n    // fill diagonal\n    for (let d = 0; d < minimum; d++) {\n      res[d][d] = one\n    }\n    return res\n  }\n})\n","import { arraySize as size } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'kron'\nconst dependencies = ['typed', 'matrix', 'multiplyScalar']\n\nexport const createKron = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, multiplyScalar }) => {\n  /**\n     * Calculates the kronecker product of 2 matrices or vectors.\n     *\n     * NOTE: If a one dimensional vector / matrix is given, it will be\n     * wrapped so its two dimensions.\n     * See the examples.\n     *\n     * Syntax:\n     *\n     *    math.kron(x, y)\n     *\n     * Examples:\n     *\n     *    math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])\n     *    // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]\n     *\n     *    math.kron([1,1], [2,3,4])\n     *    // returns [ [ 2, 3, 4, 2, 3, 4 ] ]\n     *\n     * See also:\n     *\n     *    multiply, dot, cross\n     *\n     * @param  {Array | Matrix} x     First vector\n     * @param  {Array | Matrix} y     Second vector\n     * @return {Array | Matrix}       Returns the kronecker product of `x` and `y`\n     */\n  return typed(name, {\n    'Matrix, Matrix': function (x, y) {\n      return matrix(_kron(x.toArray(), y.toArray()))\n    },\n\n    'Matrix, Array': function (x, y) {\n      return matrix(_kron(x.toArray(), y))\n    },\n\n    'Array, Matrix': function (x, y) {\n      return matrix(_kron(x, y.toArray()))\n    },\n\n    'Array, Array': _kron\n  })\n\n  /**\n     * Calculate the kronecker product of two matrices / vectors\n     * @param {Array} a  First vector\n     * @param {Array} b  Second vector\n     * @returns {Array} Returns the kronecker product of x and y\n     * @private\n     */\n  function _kron (a, b) {\n    // Deal with the dimensions of the matricies.\n    if (size(a).length === 1) {\n      // Wrap it in a 2D Matrix\n      a = [a]\n    }\n    if (size(b).length === 1) {\n      // Wrap it in a 2D Matrix\n      b = [b]\n    }\n    if (size(a).length > 2 || size(b).length > 2) {\n      throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' +\n            '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')')\n    }\n    const t = []\n    let r = []\n\n    return a.map(function (a) {\n      return b.map(function (b) {\n        r = []\n        t.push(r)\n        return a.map(function (y) {\n          return b.map(function (x) {\n            return r.push(multiplyScalar(y, x))\n          })\n        })\n      })\n    }) && t\n  }\n})\n","import { maxArgumentCount } from '../../utils/function.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'map'\nconst dependencies = ['typed']\n\nexport const createMap = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a new matrix or array with the results of a callback function executed on\n   * each entry of a given matrix/array.\n   *\n   * For each entry of the input, the callback is invoked with three arguments:\n   * the value of the entry, the index at which that entry occurs, and the full\n   * matrix/array being traversed. Note that because the matrix/array might be\n   * multidimensional, the \"index\" argument is always an array of numbers giving\n   * the index in each dimension. This is true even for vectors: the \"index\"\n   * argument is an array of length 1, rather than simply a number.\n   *\n   * Syntax:\n   *\n   *    math.map(x, callback)\n   *\n   * Examples:\n   *\n   *    math.map([1, 2, 3], function(value) {\n   *      return value * value\n   *    })  // returns [1, 4, 9]\n   *\n   *    // The calling convention for the callback can cause subtleties:\n   *    math.map([1, 2, 3], math.format)\n   *    // throws TypeError: map attempted to call 'format(1,[0])' but argument 2 of type Array does not match expected type number or function or Object or string or boolean\n   *    // [This happens because `format` _can_ take a second argument,\n   *    // but its semantics don't match that of the 2nd argument `map` provides]\n   *\n   *    // To avoid this error, use a function that takes exactly the\n   *    // desired arguments:\n   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']\n   *\n   * See also:\n   *\n   *    filter, forEach, sort\n   *\n   * @param {Matrix | Array} x    The input to iterate on.\n   * @param {Function} callback\n   *     The function to call (as described above) on each entry of the input\n   * @return {Matrix | array}\n   *     Transformed map of x; always has the same type and shape as x\n   */\n  return typed(name, {\n    'Array, function': _map,\n\n    'Matrix, function': function (x, callback) {\n      return x.map(callback)\n    }\n  })\n})\n\n/**\n * Map for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @return {Array}\n * @private\n */\nfunction _map (array, callback) {\n  // figure out what number of arguments the callback function expects\n  const args = maxArgumentCount(callback)\n\n  const recurse = function (value, index) {\n    if (Array.isArray(value)) {\n      return value.map(function (child, i) {\n        // we create a copy of the index array and append the new index value\n        return recurse(child, index.concat(i))\n      })\n    } else {\n      try {\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 { // 3 or -1\n          return callback(value, index, array)\n        }\n      } catch (err) {\n        // But maybe the arguments still weren't right\n        if (err instanceof TypeError &&\n            'data' in err &&\n            err.data.category === 'wrongType') {\n          let newmsg = `map attempted to call '${err.data.fn}(${value}`\n          const indexString = JSON.stringify(index)\n          if (args === 2) {\n            newmsg += ',' + indexString\n          } else if (args !== 1) {\n            newmsg += `,${indexString},${array}`\n          }\n          newmsg += `)' but argument ${err.data.index + 1} of type `\n          newmsg += `${err.data.actual} does not match expected type `\n          newmsg += err.data.expected.join(' or ')\n          throw new TypeError(newmsg)\n        }\n        throw err\n      }\n    }\n  }\n\n  return recurse(array, [])\n}\n","import { factory } from '../../utils/factory.js'\nimport { isInteger } from '../../utils/number.js'\nimport { isMatrix } from '../../utils/is.js'\n\nconst name = 'diff'\nconst dependencies = ['typed', 'matrix', 'subtract', 'number']\n\nexport const createDiff = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtract, number }) => {\n  /**\n   * Create a new matrix or array of the difference between elements of the given array\n   * The optional dim parameter lets you specify the dimension to evaluate the difference of\n   * If no dimension parameter is passed it is assumed as dimension 0\n   *\n   * Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber\n   * Arrays must be 'rectangular' meaning arrays like [1, 2]\n   * If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays\n   *\n   * Syntax:\n   *\n   *     math.diff(arr)\n   *     math.diff(arr, dim)\n   *\n   * Examples:\n   *\n   *     const arr = [1, 2, 4, 7, 0]\n   *     math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)\n   *     math.diff(math.matrix(arr)) // returns math.matrix([1, 2, 3, -7])\n   *\n   *     const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]\n   *     math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]\n   *     math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]\n   *     math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]\n   *     math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]\n   *\n   *     math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3\n   *     math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed\n   *\n   *     // These will all produce the same result\n   *     math.diff([[1, 2], [3, 4]])\n   *     math.diff([math.matrix([1, 2]), math.matrix([3, 4])])\n   *     math.diff([[1, 2], math.matrix([3, 4])])\n   *     math.diff([math.matrix([1, 2]), [3, 4]])\n   *     // They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix\n   *\n   * See Also:\n   *\n   *      sum\n   *      subtract\n   *      partitionSelect\n   *\n   * @param {Array | Matrix} arr    An array or matrix\n   * @param {number} dim            Dimension\n   * @return {Array | Matrix}       Difference between array elements in given dimension\n   */\n  return typed(name, {\n    'Array | Matrix': function (arr) { // No dimension specified => assume dimension 0\n      if (isMatrix(arr)) {\n        return matrix(_diff(arr.toArray()))\n      } else {\n        return _diff(arr)\n      }\n    },\n    'Array | Matrix, number': function (arr, dim) {\n      if (!isInteger(dim)) throw new RangeError('Dimension must be a whole number')\n      if (isMatrix(arr)) {\n        return matrix(_recursive(arr.toArray(), dim))\n      } else {\n        return _recursive(arr, dim)\n      }\n    },\n    'Array | Matrix, BigNumber': function (arr, dim) {\n      return this(arr, number(dim))\n    }\n  })\n\n  /**\n   * Recursively find the correct dimension in the array/matrix\n   * Then Apply _diff to that dimension\n   *\n   * @param {Array} arr      The array\n   * @param {number} dim     Dimension\n   * @return {Array}         resulting array\n   */\n  function _recursive (arr, dim) {\n    if (isMatrix(arr)) {\n      arr = arr.toArray() // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly\n    }\n    if (!Array.isArray(arr)) {\n      throw RangeError('Array/Matrix does not have that many dimensions')\n    }\n    if (dim > 0) {\n      const result = []\n      arr.forEach(element => {\n        result.push(_recursive(element, dim - 1))\n      })\n      return result\n    } else if (dim === 0) {\n      return _diff(arr)\n    } else {\n      throw RangeError('Cannot have negative dimension')\n    }\n  }\n\n  /**\n   * Difference between elements in the array\n   *\n   * @param {Array} arr      An array\n   * @return {Array}         resulting array\n   */\n  function _diff (arr) {\n    const result = []\n    const size = arr.length\n    if (size < 2) {\n      return arr\n    }\n    for (let i = 1; i < size; i++) {\n      result.push(_ElementDiff(arr[i - 1], arr[i]))\n    }\n    return result\n  }\n\n  /**\n   * Difference between 2 objects\n   *\n   * @param {Object} obj1    First object\n   * @param {Object} obj2    Second object\n   * @return {Array}         resulting array\n   */\n  function _ElementDiff (obj1, obj2) {\n    // Convert matrices to arrays\n    if (isMatrix(obj1)) obj1 = obj1.toArray()\n    if (isMatrix(obj2)) obj2 = obj2.toArray()\n\n    const obj1IsArray = Array.isArray(obj1)\n    const obj2IsArray = Array.isArray(obj2)\n    if (obj1IsArray && obj2IsArray) {\n      return _ArrayDiff(obj1, obj2)\n    }\n    if (!obj1IsArray && !obj2IsArray) {\n      return subtract(obj2, obj1) // Difference is (second - first) NOT (first - second)\n    }\n    throw TypeError('Cannot calculate difference between 1 array and 1 non-array')\n  }\n\n  /**\n   * Difference of elements in 2 arrays\n   *\n   * @param {Array} arr1     Array 1\n   * @param {Array} arr2     Array 2\n   * @return {Array}         resulting array\n   */\n  function _ArrayDiff (arr1, arr2) {\n    if (arr1.length !== arr2.length) {\n      throw RangeError('Not all sub-arrays have the same length')\n    }\n    const result = []\n    const size = arr1.length\n    for (let i = 0; i < size; i++) {\n      result.push(_ElementDiff(arr1[i], arr2[i]))\n    }\n    return result\n  }\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { resize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ones'\nconst dependencies = ['typed', 'config', 'matrix', 'BigNumber']\n\nexport const createOnes = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber }) => {\n  /**\n   * Create a matrix filled with ones. The created matrix can have one or\n   * multiple dimensions.\n   *\n   * Syntax:\n   *\n   *    math.ones(m)\n   *    math.ones(m, format)\n   *    math.ones(m, n)\n   *    math.ones(m, n, format)\n   *    math.ones([m, n])\n   *    math.ones([m, n], format)\n   *    math.ones([m, n, p, ...])\n   *    math.ones([m, n, p, ...], format)\n   *\n   * Examples:\n   *\n   *    math.ones(3)                   // returns [1, 1, 1]\n   *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]\n   *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]\n   *\n   * See also:\n   *\n   *    zeros, identity, size, range\n   *\n   * @param {...number | Array} size    The size of each dimension of the matrix\n   * @param {string} [format]           The Matrix storage format\n   *\n   * @return {Array | Matrix | number}  A matrix filled with ones\n   */\n  return typed('ones', {\n    '': function () {\n      return (config.matrix === 'Array')\n        ? _ones([])\n        : _ones([], 'default')\n    },\n\n    // math.ones(m, n, p, ..., format)\n    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n    '...number | BigNumber | string': function (size) {\n      const last = size[size.length - 1]\n      if (typeof last === 'string') {\n        const format = size.pop()\n        return _ones(size, format)\n      } else if (config.matrix === 'Array') {\n        return _ones(size)\n      } else {\n        return _ones(size, 'default')\n      }\n    },\n\n    Array: _ones,\n\n    Matrix: function (size) {\n      const format = size.storage()\n      return _ones(size.valueOf(), format)\n    },\n\n    'Array | Matrix, string': function (size, format) {\n      return _ones(size.valueOf(), format)\n    }\n  })\n\n  /**\n   * Create an Array or Matrix with ones\n   * @param {Array} size\n   * @param {string} [format='default']\n   * @return {Array | Matrix}\n   * @private\n   */\n  function _ones (size, format) {\n    const hasBigNumbers = _normalize(size)\n    const defaultValue = hasBigNumbers ? new BigNumber(1) : 1\n    _validate(size)\n\n    if (format) {\n      // return a matrix\n      const m = matrix(format)\n      if (size.length > 0) {\n        return m.resize(size, defaultValue)\n      }\n      return m\n    } else {\n      // return an Array\n      const arr = []\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue)\n      }\n      return arr\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\n  function _normalize (size) {\n    let hasBigNumbers = false\n    size.forEach(function (value, index, arr) {\n      if (isBigNumber(value)) {\n        hasBigNumbers = true\n        arr[index] = value.toNumber()\n      }\n    })\n    return hasBigNumbers\n  }\n\n  // validate arguments\n  function _validate (size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function ones must be positive integers')\n      }\n    })\n  }\n})\n","\nexport function noBignumber () {\n  throw new Error('No \"bignumber\" implementation available')\n}\n\nexport function noFraction () {\n  throw new Error('No \"fraction\" implementation available')\n}\n\nexport function noMatrix () {\n  throw new Error('No \"matrix\" implementation available')\n}\n\nexport function noIndex () {\n  throw new Error('No \"index\" implementation available')\n}\n\nexport function noSubset () {\n  throw new Error('No \"matrix\" implementation available')\n}\n","import { factory } from '../../utils/factory.js'\nimport { noBignumber, noMatrix } from '../../utils/noop.js'\n\nconst name = 'range'\nconst dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq']\n\nexport const createRange = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, bignumber, smaller, smallerEq, larger, largerEq }) => {\n  /**\n   * Create an array from a range.\n   * By default, the range end is excluded. This can be customized by providing\n   * an extra parameter `includeEnd`.\n   *\n   * Syntax:\n   *\n   *     math.range(str [, includeEnd])               // Create a range from a string,\n   *                                                  // where the string contains the\n   *                                                  // start, optional step, and end,\n   *                                                  // separated by a colon.\n   *     math.range(start, end [, includeEnd])        // Create a range with start and\n   *                                                  // end and a step size of 1.\n   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,\n   *                                                  // and end.\n   *\n   * Where:\n   *\n   * - `str: string`\n   *   A string 'start:end' or 'start:step:end'\n   * - `start: {number | BigNumber}`\n   *   Start of the range\n   * - `end: number | BigNumber`\n   *   End of the range, excluded by default, included when parameter includeEnd=true\n   * - `step: number | BigNumber`\n   *   Step size. Default value is 1.\n   * - `includeEnd: boolean`\n   *   Option to specify whether to include the end or not. False by default.\n   *\n   * Examples:\n   *\n   *     math.range(2, 6)        // [2, 3, 4, 5]\n   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]\n   *     math.range('2:1:6')     // [2, 3, 4, 5]\n   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]\n   *\n   * See also:\n   *\n   *     ones, zeros, size, subset\n   *\n   * @param {*} args   Parameters describing the ranges `start`, `end`, and optional `step`.\n   * @return {Array | Matrix} range\n   */\n  return typed(name, {\n    // TODO: simplify signatures when typed-function supports default values and optional arguments\n\n    // TODO: a number or boolean should not be converted to string here\n    string: _strRange,\n    'string, boolean': _strRange,\n\n    'number, number': function (start, end) {\n      return _out(_rangeEx(start, end, 1))\n    },\n    'number, number, number': function (start, end, step) {\n      return _out(_rangeEx(start, end, step))\n    },\n    'number, number, boolean': function (start, end, includeEnd) {\n      return includeEnd\n        ? _out(_rangeInc(start, end, 1))\n        : _out(_rangeEx(start, end, 1))\n    },\n    'number, number, number, boolean': function (start, end, step, includeEnd) {\n      return includeEnd\n        ? _out(_rangeInc(start, end, step))\n        : _out(_rangeEx(start, end, step))\n    },\n\n    'BigNumber, BigNumber': function (start, end) {\n      const BigNumber = start.constructor\n\n      return _out(_bigRangeEx(start, end, new BigNumber(1)))\n    },\n    'BigNumber, BigNumber, BigNumber': function (start, end, step) {\n      return _out(_bigRangeEx(start, end, step))\n    },\n    'BigNumber, BigNumber, boolean': function (start, end, includeEnd) {\n      const BigNumber = start.constructor\n\n      return includeEnd\n        ? _out(_bigRangeInc(start, end, new BigNumber(1)))\n        : _out(_bigRangeEx(start, end, new BigNumber(1)))\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function (start, end, step, includeEnd) {\n      return includeEnd\n        ? _out(_bigRangeInc(start, end, step))\n        : _out(_bigRangeEx(start, end, step))\n    }\n\n  })\n\n  function _out (arr) {\n    if (config.matrix === 'Matrix') {\n      return matrix ? matrix(arr) : noMatrix()\n    }\n\n    return arr\n  }\n\n  function _strRange (str, includeEnd) {\n    const r = _parse(str)\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range')\n    }\n\n    let fn\n    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        noBignumber()\n      }\n\n      fn = includeEnd ? _bigRangeInc : _bigRangeEx\n      return _out(fn(\n        bignumber(r.start),\n        bignumber(r.end),\n        bignumber(r.step)))\n    } else {\n      fn = includeEnd ? _rangeInc : _rangeEx\n      return _out(fn(r.start, r.end, r.step))\n    }\n  }\n\n  /**\n   * Create a range with numbers. End is excluded\n   * @param {number} start\n   * @param {number} end\n   * @param {number} step\n   * @returns {Array} range\n   * @private\n   */\n  function _rangeEx (start, end, step) {\n    const array = []\n    let x = start\n    if (step > 0) {\n      while (smaller(x, end)) {\n        array.push(x)\n        x += step\n      }\n    } else if (step < 0) {\n      while (larger(x, end)) {\n        array.push(x)\n        x += step\n      }\n    }\n\n    return array\n  }\n\n  /**\n   * Create a range with numbers. End is included\n   * @param {number} start\n   * @param {number} end\n   * @param {number} step\n   * @returns {Array} range\n   * @private\n   */\n  function _rangeInc (start, end, step) {\n    const array = []\n    let x = start\n    if (step > 0) {\n      while (smallerEq(x, end)) {\n        array.push(x)\n        x += step\n      }\n    } else if (step < 0) {\n      while (largerEq(x, end)) {\n        array.push(x)\n        x += step\n      }\n    }\n\n    return array\n  }\n\n  /**\n   * Create a range with big numbers. End is excluded\n   * @param {BigNumber} start\n   * @param {BigNumber} end\n   * @param {BigNumber} step\n   * @returns {Array} range\n   * @private\n   */\n  function _bigRangeEx (start, end, step) {\n    const zero = bignumber(0)\n    const array = []\n    let x = start\n    if (step.gt(zero)) {\n      while (smaller(x, end)) {\n        array.push(x)\n        x = x.plus(step)\n      }\n    } else if (step.lt(zero)) {\n      while (larger(x, end)) {\n        array.push(x)\n        x = x.plus(step)\n      }\n    }\n\n    return array\n  }\n\n  /**\n   * Create a range with big numbers. End is included\n   * @param {BigNumber} start\n   * @param {BigNumber} end\n   * @param {BigNumber} step\n   * @returns {Array} range\n   * @private\n   */\n  function _bigRangeInc (start, end, step) {\n    const zero = bignumber(0)\n    const array = []\n    let x = start\n    if (step.gt(zero)) {\n      while (smallerEq(x, end)) {\n        array.push(x)\n        x = x.plus(step)\n      }\n    } else if (step.lt(zero)) {\n      while (largerEq(x, end)) {\n        array.push(x)\n        x = x.plus(step)\n      }\n    }\n\n    return array\n  }\n\n  /**\n   * Parse a string into a range,\n   * The string contains the start, optional step, and end, separated by a colon.\n   * If the string does not contain a valid range, null is returned.\n   * For example str='0:2:11'.\n   * @param {string} str\n   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step\n   * @private\n   */\n  function _parse (str) {\n    const args = str.split(':')\n\n    // number\n    const nums = args.map(function (arg) {\n      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string\n      return Number(arg)\n    })\n\n    const invalid = nums.some(function (num) {\n      return isNaN(num)\n    })\n    if (invalid) {\n      return null\n    }\n\n    switch (nums.length) {\n      case 2:\n        return {\n          start: nums[0],\n          end: nums[1],\n          step: 1\n        }\n\n      case 3:\n        return {\n          start: nums[0],\n          end: nums[2],\n          step: nums[1]\n        }\n\n      default:\n        return null\n    }\n  }\n})\n","import { reshape as arrayReshape } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'reshape'\nconst dependencies = ['typed', 'isInteger', 'matrix']\n\nexport const createReshape = /* #__PURE__ */ factory(name, dependencies, ({ typed, isInteger }) => {\n  /**\n   * Reshape a multi dimensional array to fit the specified dimensions\n   *\n   * Syntax:\n   *\n   *     math.reshape(x, sizes)\n   *\n   * Examples:\n   *\n   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])\n   *     // returns Array  [[1, 2, 3], [4, 5, 6]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [1, 4])\n   *     // returns Array  [[1, 2, 3, 4]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [4])\n   *     // returns Array [1, 2, 3, 4]\n   *\n   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])\n   *     math.reshape(x, [2, 2, 2])\n   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]\n   *\n   *    math.reshape([1, 2, 3, 4], [-1, 2])\n   *    // returns Matrix [[1, 2], [3, 4]]\n   *\n   * See also:\n   *\n   *     size, squeeze, resize\n   *\n   * @param {Array | Matrix | *} x  Matrix to be reshaped\n   * @param {number[]} sizes        One dimensional array with integral sizes for\n   *                                each dimension. One -1 is allowed as wildcard,\n   *                                which calculates this dimension automatically.\n   *\n   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`\n   *\n   * @throws {TypeError}            If `sizes` does not contain solely integers\n   * @throws {DimensionError}       If the product of the new dimension sizes does\n   *                                not equal that of the old ones\n   */\n  return typed(name, {\n\n    'Matrix, Array': function (x, sizes) {\n      return x.reshape(sizes)\n    },\n\n    'Array, Array': function (x, sizes) {\n      sizes.forEach(function (size) {\n        if (!isInteger(size)) {\n          throw new TypeError('Invalid size for dimension: ' + size)\n        }\n      })\n      return arrayReshape(x, sizes)\n    }\n\n  })\n})\n","/**\n * Create a syntax error with the message:\n *     'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'\n * @param {string} fn     Function name\n * @param {number} count  Actual argument count\n * @param {number} min    Minimum required argument count\n * @param {number} [max]  Maximum required argument count\n * @extends Error\n */\nexport function ArgumentsError (fn, count, min, max) {\n  if (!(this instanceof ArgumentsError)) {\n    throw new SyntaxError('Constructor must be called with the new operator')\n  }\n\n  this.fn = fn\n  this.count = count\n  this.min = min\n  this.max = max\n\n  this.message = 'Wrong number of arguments in function ' + fn +\n      ' (' + count + ' provided, ' +\n      min + ((max !== undefined && max !== null) ? ('-' + max) : '') + ' expected)'\n\n  this.stack = (new Error()).stack\n}\n\nArgumentsError.prototype = new Error()\nArgumentsError.prototype.constructor = Error\nArgumentsError.prototype.name = 'ArgumentsError'\nArgumentsError.prototype.isArgumentsError = true\n","import { isBigNumber, isMatrix } from '../../utils/is.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { ArgumentsError } from '../../error/ArgumentsError.js'\nimport { isInteger } from '../../utils/number.js'\nimport { format } from '../../utils/string.js'\nimport { clone } from '../../utils/object.js'\nimport { resize as arrayResize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'resize'\nconst dependencies = ['config', 'matrix']\n\nexport const createResize = /* #__PURE__ */ factory(name, dependencies, ({ config, matrix }) => {\n  /**\n   * Resize a matrix\n   *\n   * Syntax:\n   *\n   *     math.resize(x, size)\n   *     math.resize(x, size, defaultValue)\n   *\n   * Examples:\n   *\n   *     math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]\n   *     math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]\n   *     math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]\n   *     math.resize(\"hello\", [8], \"!\")    // returns string 'hello!!!'\n   *\n   * See also:\n   *\n   *     size, squeeze, subset, reshape\n   *\n   * @param {Array | Matrix | *} x             Matrix to be resized\n   * @param {Array | Matrix} size              One dimensional array with numbers\n   * @param {number | string} [defaultValue=0] Zero by default, except in\n   *                                           case of a string, in that case\n   *                                           defaultValue = ' '\n   * @return {* | Array | Matrix} A resized clone of matrix `x`\n   */\n  // TODO: rework resize to a typed-function\n  return function resize (x, size, defaultValue) {\n    if (arguments.length !== 2 && arguments.length !== 3) {\n      throw new ArgumentsError('resize', arguments.length, 2, 3)\n    }\n\n    if (isMatrix(size)) {\n      size = size.valueOf() // get Array\n    }\n\n    if (isBigNumber(size[0])) {\n      // convert bignumbers to numbers\n      size = size.map(function (value) {\n        return !isBigNumber(value) ? value : value.toNumber()\n      })\n    }\n\n    // check x is a Matrix\n    if (isMatrix(x)) {\n      // use optimized matrix implementation, return copy\n      return x.resize(size, defaultValue, true)\n    }\n\n    if (typeof x === 'string') {\n      // resize string\n      return _resizeString(x, size, defaultValue)\n    }\n\n    // check result should be a matrix\n    const asMatrix = Array.isArray(x) ? false : (config.matrix !== 'Array')\n\n    if (size.length === 0) {\n      // output a scalar\n      while (Array.isArray(x)) {\n        x = x[0]\n      }\n\n      return clone(x)\n    } else {\n      // output an array/matrix\n      if (!Array.isArray(x)) {\n        x = [x]\n      }\n      x = clone(x)\n\n      const res = arrayResize(x, size, defaultValue)\n      return asMatrix ? matrix(res) : res\n    }\n  }\n\n  /**\n   * Resize a string\n   * @param {string} str\n   * @param {number[]} size\n   * @param {string} [defaultChar=' ']\n   * @private\n   */\n  function _resizeString (str, size, defaultChar) {\n    if (defaultChar !== undefined) {\n      if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {\n        throw new TypeError('Single character expected as defaultValue')\n      }\n    } else {\n      defaultChar = ' '\n    }\n\n    if (size.length !== 1) {\n      throw new DimensionError(size.length, 1)\n    }\n    const len = size[0]\n    if (typeof len !== 'number' || !isInteger(len)) {\n      throw new TypeError('Invalid size, must contain positive integers ' +\n          '(size: ' + format(size) + ')')\n    }\n\n    if (str.length > len) {\n      return str.substring(0, len)\n    } else if (str.length < len) {\n      let res = str\n      for (let i = 0, ii = len - str.length; i < ii; i++) {\n        res += defaultChar\n      }\n      return res\n    } else {\n      return str\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { arraySize } from '../../utils/array.js'\n\nconst name = 'rotate'\nconst dependencies = [\n  'typed',\n  'multiply',\n  'rotationMatrix'\n]\n\nexport const createRotate = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed, multiply, rotationMatrix\n  }) => {\n  /**\n     * Rotate a vector of size 1x2 counter-clockwise by a given angle\n     * Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis\n     *\n     * Syntax:\n     *\n     *    math.rotate(w, theta)\n     *    math.rotate(w, theta, v)\n     *\n     * Examples:\n     *\n     *    math.rotate([11, 12], math.pi / 2)                           // returns matrix([-12, 11])\n     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns matrix([-12, 11])\n     *\n     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns matrix([0, 1, 0])\n     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns matrix([0, 1, 0])\n     *\n     *    math.rotate([1, 0], math.complex(1 + i))                     // returns matrix([cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)])\n     *\n     * See also:\n     *\n     *    matrix, rotationMatrix\n     *\n     * @param {Array | Matrix} w                             Vector to rotate\n     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle\n     * @param {Array | Matrix} [v]                           Rotation axis\n     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w\n     */\n  return typed(name, {\n    'Array , number | BigNumber | Complex | Unit': function (w, theta) {\n      _validateSize(w, 2)\n      const matrixRes = multiply(rotationMatrix(theta), w)\n      return matrixRes.toArray()\n    },\n\n    'Matrix , number | BigNumber | Complex | Unit': function (w, theta) {\n      _validateSize(w, 2)\n      return multiply(rotationMatrix(theta), w)\n    },\n\n    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function (w, theta, v) {\n      _validateSize(w, 3)\n      const matrixRes = multiply(rotationMatrix(theta, v), w)\n      return matrixRes\n    },\n\n    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function (w, theta, v) {\n      _validateSize(w, 3)\n      return multiply(rotationMatrix(theta, v), w)\n    }\n  })\n\n  function _validateSize (v, expectedSize) {\n    const actualSize = Array.isArray(v) ? arraySize(v) : v.size()\n    if (actualSize.length > 2) {\n      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`)\n    }\n    if (actualSize.length === 2 && actualSize[1] !== 1) {\n      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`)\n    }\n    if (actualSize[0] !== expectedSize) {\n      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`)\n    }\n  }\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'rotationMatrix'\nconst dependencies = [\n  'typed',\n  'config',\n  'multiplyScalar',\n  'addScalar',\n  'unaryMinus',\n  'norm',\n  'matrix',\n  'BigNumber',\n  'DenseMatrix',\n  'SparseMatrix',\n  'cos',\n  'sin'\n]\n\nexport const createRotationMatrix = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed, config, multiplyScalar,\n    addScalar, unaryMinus, norm, BigNumber,\n    matrix, DenseMatrix, SparseMatrix, cos, sin\n  }) => {\n  /**\n   * Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).\n   * Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).\n   *\n   * Syntax:\n   *\n   *    math.rotationMatrix(theta)\n   *    math.rotationMatrix(theta, format)\n   *    math.rotationMatrix(theta, [v])\n   *    math.rotationMatrix(theta, [v], format)\n   *\n   * Examples:\n   *\n   *    math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]\n   *    math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]\n   *    math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]\n   *    math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]\n   *\n   *    math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]\n   *    math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])\n   *\n   *\n   * See also:\n   *\n   *    matrix, cos, sin\n   *\n   *\n   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle\n   * @param {Array | Matrix} [v]                           Rotation axis\n   * @param {string} [format]                              Result Matrix storage format\n   * @return {Array | Matrix}                              Rotation matrix\n   */\n\n  return typed(name, {\n    '': function () {\n      return (config.matrix === 'Matrix') ? matrix([]) : []\n    },\n\n    string: function (format) {\n      return matrix(format)\n    },\n\n    'number | BigNumber | Complex | Unit': function (theta) {\n      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined)\n    },\n\n    'number | BigNumber | Complex | Unit, string': function (theta, format) {\n      return _rotationMatrix2x2(theta, format)\n    },\n\n    'number | BigNumber | Complex | Unit, Array': function (theta, v) {\n      const matrixV = matrix(v)\n      _validateVector(matrixV)\n      return _rotationMatrix3x3(theta, matrixV, undefined)\n    },\n\n    'number | BigNumber | Complex | Unit, Matrix': function (theta, v) {\n      _validateVector(v)\n      const storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined)\n      return _rotationMatrix3x3(theta, v, storageType)\n    },\n\n    'number | BigNumber | Complex | Unit, Array, string': function (theta, v, format) {\n      const matrixV = matrix(v)\n      _validateVector(matrixV)\n      return _rotationMatrix3x3(theta, matrixV, format)\n    },\n\n    'number | BigNumber | Complex | Unit, Matrix, string': function (theta, v, format) {\n      _validateVector(v)\n      return _rotationMatrix3x3(theta, v, format)\n    }\n\n  })\n\n  /**\n   * Returns 2x2 matrix of 2D rotation of angle theta\n   *\n   * @param {number | BigNumber | Complex | Unit} theta  The rotation angle\n   * @param {string} format                              The result Matrix storage format\n   * @returns {Matrix}\n   * @private\n   */\n  function _rotationMatrix2x2 (theta, format) {\n    const Big = isBigNumber(theta)\n\n    const minusOne = Big ? new BigNumber(-1) : -1\n    const cosTheta = cos(theta)\n    const sinTheta = sin(theta)\n    const data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]]\n\n    return _convertToFormat(data, format)\n  }\n\n  function _validateVector (v) {\n    const size = v.size()\n    if (size.length < 1 || size[0] !== 3) {\n      throw new RangeError('Vector must be of dimensions 1x3')\n    }\n  }\n\n  function _mul (array) {\n    return array.reduce((p, curr) => multiplyScalar(p, curr))\n  }\n\n  function _convertToFormat (data, format) {\n    if (format) {\n      if (format === 'sparse') {\n        return new SparseMatrix(data)\n      }\n      if (format === 'dense') {\n        return new DenseMatrix(data)\n      }\n      throw new TypeError(`Unknown matrix type \"${format}\"`)\n    }\n    return data\n  }\n\n  /**\n   * Returns a 3x3 matrix of rotation of angle theta around vector v\n   *\n   * @param {number | BigNumber | Complex | Unit} theta The rotation angle\n   * @param {Matrix} v                                  The rotation axis vector\n   * @param {string} format                             The storage format of the resulting matrix\n   * @returns {Matrix}\n   * @private\n   */\n  function _rotationMatrix3x3 (theta, v, format) {\n    const normV = norm(v)\n    if (normV === 0) {\n      throw new RangeError('Rotation around zero vector')\n    }\n\n    const Big = isBigNumber(theta) ? BigNumber : null\n\n    const one = Big ? new Big(1) : 1\n    const minusOne = Big ? new Big(-1) : -1\n    const vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV\n    const vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV\n    const vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV\n    const c = cos(theta)\n    const oneMinusC = addScalar(one, unaryMinus(c))\n    const s = sin(theta)\n\n    const r11 = addScalar(c, _mul([vx, vx, oneMinusC]))\n    const r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]))\n    const r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]))\n\n    const r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]))\n    const r22 = addScalar(c, _mul([vy, vy, oneMinusC]))\n    const r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]))\n\n    const r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]))\n    const r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]))\n    const r33 = addScalar(c, _mul([vz, vz, oneMinusC]))\n\n    const data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]]\n\n    return _convertToFormat(data, format)\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { clone } from '../../utils/object.js'\nimport { validateIndex } from '../../utils/array.js'\n\nconst name = 'row'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\nexport const createRow = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  /**\n   * Return a row from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.row(value, index)\n   *\n   * Example:\n   *\n   *     // get a row\n   *     const d = [[1, 2], [3, 4]]\n   *     math.row(d, 1) // returns [[3, 4]]\n   *\n   * See also:\n   *\n   *     column\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} row              The index of the row\n   * @return {Array | Matrix}         The retrieved row\n   */\n  return typed(name, {\n    'Matrix, number': _row,\n\n    'Array, number': function (value, row) {\n      return _row(matrix(clone(value)), row).valueOf()\n    }\n  })\n\n  /**\n   * Retrieve a row of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} row     The index of the row\n   * @return {Matrix}        The retrieved row\n   */\n  function _row (value, row) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported')\n    }\n\n    validateIndex(row, value.size()[0])\n\n    const columnRange = range(0, value.size()[1])\n    const index = new Index(row, columnRange)\n    return value.subset(index)\n  }\n})\n","import { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { noMatrix } from '../../utils/noop.js'\n\nconst name = 'size'\nconst dependencies = ['typed', 'config', '?matrix']\n\nexport const createSize = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix }) => {\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 (x) {\n      return x.create(x.size())\n    },\n\n    Array: arraySize,\n\n    string: function (x) {\n      return (config.matrix === 'Array') ? [x.length] : matrix([x.length])\n    },\n\n    'number | Complex | BigNumber | Unit | boolean | null': function (x) {\n      // scalar\n      return (config.matrix === 'Array')\n        ? []\n        : matrix ? matrix([]) : noMatrix()\n    }\n  })\n})\n","import { clone } from '../../utils/object.js'\nimport { squeeze as arraySqueeze } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'squeeze'\nconst dependencies = ['typed', 'matrix']\n\nexport const createSqueeze = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  /**\n   * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.\n   *\n   * Syntax:\n   *\n   *     math.squeeze(x)\n   *\n   * Examples:\n   *\n   *     math.squeeze([3])           // returns 3\n   *     math.squeeze([[3]])         // returns 3\n   *\n   *     const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)\n   *     math.squeeze(A)             // returns [0, 0, 0] (size 3)\n   *\n   *     const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)\n   *     math.squeeze(B)             // returns [0, 0, 0] (size 3)\n   *\n   *     // only inner and outer dimensions are removed\n   *     const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)\n   *     math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)\n   *\n   * See also:\n   *\n   *     subset\n   *\n   * @param {Matrix | Array} x      Matrix to be squeezed\n   * @return {Matrix | Array} Squeezed matrix\n   */\n  return typed(name, {\n    Array: function (x) {\n      return arraySqueeze(clone(x))\n    },\n\n    Matrix: function (x) {\n      const res = arraySqueeze(x.toArray())\n      // FIXME: return the same type of matrix as the input\n      return Array.isArray(res) ? matrix(res) : res\n    },\n\n    any: function (x) {\n      // scalar\n      return clone(x)\n    }\n  })\n})\n","import { isIndex } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { validateIndex } from '../../utils/array.js'\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'subset'\nconst dependencies = ['typed', 'matrix']\n\nexport const createSubset = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  /**\n   * Get or set a subset of a matrix or string.\n   *\n   * Syntax:\n   *     math.subset(value, index)                                // retrieve a subset\n   *     math.subset(value, index, replacement [, defaultValue])  // replace a subset\n   *\n   * Examples:\n   *\n   *     // get a subset\n   *     const d = [[1, 2], [3, 4]]\n   *     math.subset(d, math.index(1, 0))        // returns 3\n   *     math.subset(d, math.index([0, 1], 1))   // returns [[2], [4]]\n   *\n   *     // replace a subset\n   *     const e = []\n   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 6]] and e = [[5, 0, 6]]\n   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 6], [0, 7]]\n   *\n   *     // get submatrix using ranges\n   *     const M = [\n   *       [1,2,3],\n   *       [4,5,6],\n   *       [7,8,9]\n   *     ]\n   *     math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1,2,3],[4,5,6]]\n   *\n   * See also:\n   *\n   *     size, resize, squeeze, index\n   *\n   * @param {Array | Matrix | string} matrix  An array, matrix, or string\n   * @param {Index} index\n   *    For each dimension of the target, specifies an index or a list of\n   *    indices to fetch or set. `subset` uses the cartesian product of\n   *    the indices specified in each dimension.\n   * @param {*} [replacement]                 An array, matrix, or scalar.\n   *                                          If provided, the subset is replaced with replacement.\n   *                                          If not provided, the subset is returned\n   * @param {*} [defaultValue=undefined]      Default value, filled in on new entries when\n   *                                          the matrix is resized. If not provided,\n   *                                          math.matrix elements will be left undefined.\n   * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.\n   */\n  return typed(name, {\n    // get subset\n    'Array, Index': function (value, index) {\n      const m = matrix(value)\n      const subset = m.subset(index) // returns a Matrix\n      return index.isScalar()\n        ? subset\n        : subset.valueOf() // return an Array (like the input)\n    },\n\n    'Matrix, Index': function (value, index) {\n      return value.subset(index)\n    },\n\n    'Object, Index': _getObjectProperty,\n\n    'string, Index': _getSubstring,\n\n    // set subset\n    'Array, Index, any': function (value, index, replacement) {\n      return matrix(clone(value))\n        .subset(index, replacement, undefined)\n        .valueOf()\n    },\n\n    'Array, Index, any, any': function (value, index, replacement, defaultValue) {\n      return matrix(clone(value))\n        .subset(index, replacement, defaultValue)\n        .valueOf()\n    },\n\n    'Matrix, Index, any': function (value, index, replacement) {\n      return value.clone().subset(index, replacement)\n    },\n\n    'Matrix, Index, any, any': function (value, index, replacement, defaultValue) {\n      return value.clone().subset(index, replacement, defaultValue)\n    },\n\n    'string, Index, string': _setSubstring,\n    'string, Index, string, string': _setSubstring,\n    'Object, Index, any': _setObjectProperty\n  })\n})\n\n/**\n * Retrieve a subset of a string\n * @param {string} str            string from which to get a substring\n * @param {Index} index           An index or list of indices (character positions)\n * @returns {string} substring\n * @private\n */\nfunction _getSubstring (str, index) {\n  if (!isIndex(index)) {\n    // TODO: better error message\n    throw new TypeError('Index expected')\n  }\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1)\n  }\n\n  // validate whether the range is out of range\n  const strLen = str.length\n  validateIndex(index.min()[0], strLen)\n  validateIndex(index.max()[0], strLen)\n\n  const range = index.dimension(0)\n\n  let substr = ''\n  range.forEach(function (v) {\n    substr += str.charAt(v)\n  })\n\n  return substr\n}\n\n/**\n * Replace a substring in a string\n * @param {string} str            string to be replaced\n * @param {Index} index           An index or list of indices (character positions)\n * @param {string} replacement    Replacement string\n * @param {string} [defaultValue] Default value to be uses when resizing\n *                                the string. is ' ' by default\n * @returns {string} result\n * @private\n */\nfunction _setSubstring (str, index, replacement, defaultValue) {\n  if (!index || index.isIndex !== true) {\n    // TODO: better error message\n    throw new TypeError('Index expected')\n  }\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1)\n  }\n  if (defaultValue !== undefined) {\n    if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {\n      throw new TypeError('Single character expected as defaultValue')\n    }\n  } else {\n    defaultValue = ' '\n  }\n\n  const range = index.dimension(0)\n  const len = range.size()[0]\n\n  if (len !== replacement.length) {\n    throw new DimensionError(range.size()[0], replacement.length)\n  }\n\n  // validate whether the range is out of range\n  const strLen = str.length\n  validateIndex(index.min()[0])\n  validateIndex(index.max()[0])\n\n  // copy the string into an array with characters\n  const chars = []\n  for (let i = 0; i < strLen; i++) {\n    chars[i] = str.charAt(i)\n  }\n\n  range.forEach(function (v, i) {\n    chars[v] = replacement.charAt(i[0])\n  })\n\n  // initialize undefined characters with a space\n  if (chars.length > strLen) {\n    for (let i = strLen - 1, len = chars.length; i < len; i++) {\n      if (!chars[i]) {\n        chars[i] = defaultValue\n      }\n    }\n  }\n\n  return chars.join('')\n}\n\n/**\n * Retrieve a property from an object\n * @param {Object} object\n * @param {Index} index\n * @return {*} Returns the value of the property\n * @private\n */\nfunction _getObjectProperty (object, index) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1)\n  }\n\n  const key = index.dimension(0)\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property')\n  }\n\n  return getSafeProperty(object, key)\n}\n\n/**\n * Set a property on an object\n * @param {Object} object\n * @param {Index} index\n * @param {*} replacement\n * @return {*} Returns the updated object\n * @private\n */\nfunction _setObjectProperty (object, index, replacement) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1)\n  }\n\n  const key = index.dimension(0)\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property')\n  }\n\n  // clone the object, and apply the property to the clone\n  const updated = clone(object)\n  setSafeProperty(updated, key, replacement)\n\n  return updated\n}\n","import { clone } from '../../utils/object.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'transpose'\nconst dependencies = ['typed', 'matrix']\n\nexport const createTranspose = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  /**\n   * Transpose a matrix. All values of the matrix are reflected over its\n   * main diagonal. Only applicable to two dimensional matrices containing\n   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional\n   * vectors and scalars return the input unchanged.\n   *\n   * Syntax:\n   *\n   *     math.transpose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]\n   *\n   * See also:\n   *\n   *     diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be transposed\n   * @return {Array | Matrix}   The transposed matrix\n   */\n  return typed('transpose', {\n\n    Array: function (x) {\n      // use dense matrix implementation\n      return this(matrix(x)).valueOf()\n    },\n\n    Matrix: function (x) {\n      // matrix size\n      const size = x.size()\n\n      // result\n      let c\n\n      // process dimensions\n      switch (size.length) {\n        case 1:\n          // vector\n          c = x.clone()\n          break\n\n        case 2:\n          {\n            // rows and columns\n            const rows = size[0]\n            const columns = size[1]\n\n            // check columns\n            if (columns === 0) {\n              // throw exception\n              throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')')\n            }\n\n            // process storage format\n            switch (x.storage()) {\n              case 'dense':\n                c = _denseTranspose(x, rows, columns)\n                break\n              case 'sparse':\n                c = _sparseTranspose(x, rows, columns)\n                break\n            }\n          }\n          break\n\n        default:\n          // multi dimensional\n          throw new RangeError('Matrix must be a vector or two dimensional (size: ' + format(this._size) + ')')\n      }\n      return c\n    },\n\n    // scalars\n    any: function (x) {\n      return clone(x)\n    }\n  })\n\n  function _denseTranspose (m, rows, columns) {\n    // matrix array\n    const data = m._data\n    // transposed matrix data\n    const transposed = []\n    let transposedRow\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // initialize row\n      transposedRow = transposed[j] = []\n      // loop rows\n      for (let i = 0; i < rows; i++) {\n        // set data\n        transposedRow[i] = clone(data[i][j])\n      }\n    }\n    // return matrix\n    return m.createDenseMatrix({\n      data: transposed,\n      size: [columns, rows],\n      datatype: m._datatype\n    })\n  }\n\n  function _sparseTranspose (m, rows, columns) {\n    // matrix arrays\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    // result matrices\n    const cvalues = values ? [] : undefined\n    const cindex = []\n    const cptr = []\n    // row counts\n    const w = []\n    for (let x = 0; x < rows; x++) { w[x] = 0 }\n    // vars\n    let p, l, j\n    // loop values in matrix\n    for (p = 0, l = index.length; p < l; p++) {\n      // number of values in row\n      w[index[p]]++\n    }\n    // cumulative sum\n    let sum = 0\n    // initialize cptr with the cummulative sum of row counts\n    for (let i = 0; i < rows; i++) {\n      // update cptr\n      cptr.push(sum)\n      // update sum\n      sum += w[i]\n      // update w\n      w[i] = cptr[i]\n    }\n    // update cptr\n    cptr.push(sum)\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // values & index in column\n      for (let k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {\n        // C values & index\n        const q = w[index[k]]++\n        // C[j, i] = A[i, j]\n        cindex[q] = j\n        // check we need to process values (pattern matrix)\n        if (values) { cvalues[q] = clone(values[k]) }\n      }\n    }\n    // return matrix\n    return m.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [columns, rows],\n      datatype: m._datatype\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'ctranspose'\nconst dependencies = ['typed', 'transpose', 'conj']\n\nexport const createCtranspose = /* #__PURE__ */ factory(name, dependencies, ({ typed, transpose, conj }) => {\n  /**\n   * Transpose and complex conjugate a matrix. All values of the matrix are\n   * reflected over its main diagonal and then the complex conjugate is\n   * taken. This is equivalent to complex conjugation for scalars and\n   * vectors.\n   *\n   * Syntax:\n   *\n   *     math.ctranspose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]\n   *     math.ctranspose(A)               // returns [[1, 4], [2, 5], [3, {re:6,im:7}]]\n   *\n   * See also:\n   *\n   *     transpose, diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be ctransposed\n   * @return {Array | Matrix}   The ctransposed matrix\n   */\n  return typed(name, {\n    any: function (x) {\n      return conj(transpose(x))\n    }\n  })\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { resize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'zeros'\nconst dependencies = ['typed', 'config', 'matrix', 'BigNumber']\n\nexport const createZeros = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber }) => {\n  /**\n   * Create a matrix filled with zeros. The created matrix can have one or\n   * multiple dimensions.\n   *\n   * Syntax:\n   *\n   *    math.zeros(m)\n   *    math.zeros(m, format)\n   *    math.zeros(m, n)\n   *    math.zeros(m, n, format)\n   *    math.zeros([m, n])\n   *    math.zeros([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.zeros(3)                  // returns [0, 0, 0]\n   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]\n   *    math.zeros(3, 'dense')         // returns [0, 0, 0]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]\n   *\n   * See also:\n   *\n   *    ones, identity, size, range\n   *\n   * @param {...number | Array} size    The size of each dimension of the matrix\n   * @param {string} [format]           The Matrix storage format\n   *\n   * @return {Array | Matrix}           A matrix filled with zeros\n   */\n  return typed(name, {\n    '': function () {\n      return (config.matrix === 'Array')\n        ? _zeros([])\n        : _zeros([], 'default')\n    },\n\n    // math.zeros(m, n, p, ..., format)\n    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n    '...number | BigNumber | string': function (size) {\n      const last = size[size.length - 1]\n      if (typeof last === 'string') {\n        const format = size.pop()\n        return _zeros(size, format)\n      } else if (config.matrix === 'Array') {\n        return _zeros(size)\n      } else {\n        return _zeros(size, 'default')\n      }\n    },\n\n    Array: _zeros,\n\n    Matrix: function (size) {\n      const format = size.storage()\n      return _zeros(size.valueOf(), format)\n    },\n\n    'Array | Matrix, string': function (size, format) {\n      return _zeros(size.valueOf(), format)\n    }\n  })\n\n  /**\n   * Create an Array or Matrix with zeros\n   * @param {Array} size\n   * @param {string} [format='default']\n   * @return {Array | Matrix}\n   * @private\n   */\n  function _zeros (size, format) {\n    const hasBigNumbers = _normalize(size)\n    const defaultValue = hasBigNumbers ? new BigNumber(0) : 0\n    _validate(size)\n\n    if (format) {\n      // return a matrix\n      const m = matrix(format)\n      if (size.length > 0) {\n        return m.resize(size, defaultValue)\n      }\n      return m\n    } else {\n      // return an Array\n      const arr = []\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue)\n      }\n      return arr\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\n  function _normalize (size) {\n    let hasBigNumbers = false\n    size.forEach(function (value, index, arr) {\n      if (isBigNumber(value)) {\n        hasBigNumbers = true\n        arr[index] = value.toNumber()\n      }\n    })\n    return hasBigNumbers\n  }\n\n  // validate arguments\n  function _validate (size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function zeros must be positive integers')\n      }\n    })\n  }\n})\n\n// TODO: zeros contains almost the same code as ones. Reuse this?\n","/* eslint-disable no-loss-of-precision */\n\nimport { deepMap } from '../../utils/collection.js'\nimport { sign } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'erf'\nconst dependencies = [\n  'typed'\n]\n\nexport const createErf = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the erf function of a value using a rational Chebyshev\n   * approximations for different intervals of x.\n   *\n   * This is a translation of W. J. Cody's Fortran implementation from 1987\n   * ( https://www.netlib.org/specfun/erf ). See the AMS publication\n   * \"Rational Chebyshev Approximations for the Error Function\" by W. J. Cody\n   * for an explanation of this process.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.erf(x)\n   *\n   * Examples:\n   *\n   *    math.erf(0.2)    // returns 0.22270258921047847\n   *    math.erf(-0.5)   // returns -0.5204998778130465\n   *    math.erf(4)      // returns 0.9999999845827421\n   *\n   * @param {number | Array | Matrix} x   A real number\n   * @return {number | Array | Matrix}    The erf of `x`\n   */\n  return typed('name', {\n    number: function (x) {\n      const y = Math.abs(x)\n\n      if (y >= MAX_NUM) {\n        return sign(x)\n      }\n      if (y <= THRESH) {\n        return sign(x) * erf1(y)\n      }\n      if (y <= 4.0) {\n        return sign(x) * (1 - erfc2(y))\n      }\n      return sign(x) * (1 - erfc3(y))\n    },\n\n    'Array | Matrix': function (n) {\n      return deepMap(n, this)\n    }\n\n    // TODO: For complex numbers, use the approximation for the Faddeeva function\n    //  from \"More Efficient Computation of the Complex Error Function\" (AMS)\n\n  })\n\n  /**\n   * Approximates the error function erf() for x <= 0.46875 using this function:\n   *               n\n   * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))\n   *              j=0\n   */\n  function erf1 (y) {\n    const ysq = y * y\n    let xnum = P[0][4] * ysq\n    let xden = ysq\n    let i\n\n    for (i = 0; i < 3; i += 1) {\n      xnum = (xnum + P[0][i]) * ysq\n      xden = (xden + Q[0][i]) * ysq\n    }\n    return y * (xnum + P[0][3]) / (xden + Q[0][3])\n  }\n\n  /**\n   * Approximates the complement of the error function erfc() for\n   * 0.46875 <= x <= 4.0 using this function:\n   *                       n\n   * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)\n   *                      j=0\n   */\n  function erfc2 (y) {\n    let xnum = P[1][8] * y\n    let xden = y\n    let i\n\n    for (i = 0; i < 7; i += 1) {\n      xnum = (xnum + P[1][i]) * y\n      xden = (xden + Q[1][i]) * y\n    }\n    const result = (xnum + P[1][7]) / (xden + Q[1][7])\n    const ysq = parseInt(y * 16) / 16\n    const del = (y - ysq) * (y + ysq)\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result\n  }\n\n  /**\n   * Approximates the complement of the error function erfc() for x > 4.0 using\n   * this function:\n   *\n   * erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +\n   *               n\n   *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]\n   *              j=0\n   */\n  function erfc3 (y) {\n    let ysq = 1 / (y * y)\n    let xnum = P[2][5] * ysq\n    let xden = ysq\n    let i\n\n    for (i = 0; i < 4; i += 1) {\n      xnum = (xnum + P[2][i]) * ysq\n      xden = (xden + Q[2][i]) * ysq\n    }\n    let result = ysq * (xnum + P[2][4]) / (xden + Q[2][4])\n    result = (SQRPI - result) / y\n    ysq = parseInt(y * 16) / 16\n    const del = (y - ysq) * (y + ysq)\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result\n  }\n})\n\n/**\n * Upper bound for the first approximation interval, 0 <= x <= THRESH\n * @constant\n */\nconst THRESH = 0.46875\n\n/**\n * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)\n * @constant\n */\nconst SQRPI = 5.6418958354775628695e-1\n\n/**\n * Coefficients for each term of the numerator sum (p_j) for each approximation\n * interval (see W. J. Cody's paper for more details)\n * @constant\n */\nconst P = [[\n  3.16112374387056560e00, 1.13864154151050156e02,\n  3.77485237685302021e02, 3.20937758913846947e03,\n  1.85777706184603153e-1\n], [\n  5.64188496988670089e-1, 8.88314979438837594e00,\n  6.61191906371416295e01, 2.98635138197400131e02,\n  8.81952221241769090e02, 1.71204761263407058e03,\n  2.05107837782607147e03, 1.23033935479799725e03,\n  2.15311535474403846e-8\n], [\n  3.05326634961232344e-1, 3.60344899949804439e-1,\n  1.25781726111229246e-1, 1.60837851487422766e-2,\n  6.58749161529837803e-4, 1.63153871373020978e-2\n]]\n\n/**\n * Coefficients for each term of the denominator sum (q_j) for each approximation\n * interval (see W. J. Cody's paper for more details)\n * @constant\n */\nconst Q = [[\n  2.36012909523441209e01, 2.44024637934444173e02,\n  1.28261652607737228e03, 2.84423683343917062e03\n], [\n  1.57449261107098347e01, 1.17693950891312499e02,\n  5.37181101862009858e02, 1.62138957456669019e03,\n  3.29079923573345963e03, 4.36261909014324716e03,\n  3.43936767414372164e03, 1.23033935480374942e03\n], [\n  2.56852019228982242e00, 1.87295284992346047e00,\n  5.27905102951428412e-1, 6.05183413124413191e-2,\n  2.33520497626869185e-3\n]]\n\n/**\n * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is\n * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will\n * return 1\n */\nconst MAX_NUM = Math.pow(2, 53)\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'mode'\nconst dependencies = ['typed', 'isNaN', 'isNumeric']\n\nexport const createMode = /* #__PURE__ */ factory(name, dependencies, ({ typed, isNaN, isNumeric }) => {\n  /**\n  * Computes the mode of a set of numbers or a list with values(numbers or characters).\n  * If there are more than one modes, it returns a list of those values.\n  *\n  * Syntax:\n  *\n  *     math.mode(a, b, c, ...)\n  *     math.mode(A)\n  *\n  * Examples:\n  *\n  *     math.mode(2, 1, 4, 3, 1)                            // returns [1]\n  *     math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]\n  *     math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]\n  *     math.mode('a','a','b','c')                           // returns [\"a\"]\n  *     math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, \"abc\"]\n  *\n  * See also:\n  *\n  *     median,\n  *     mean\n  *\n  * @param {... *} args  A single matrix\n  * @return {*} The mode of all values\n  */\n  return typed(name, {\n    'Array | Matrix': _mode,\n\n    '...': function (args) {\n      return _mode(args)\n    }\n  })\n\n  /**\n   * Calculates the mode in an 1-dimensional array\n   * @param {Array} values\n   * @return {Array} mode\n   * @private\n   */\n  function _mode (values) {\n    values = flatten(values.valueOf())\n    const num = values.length\n    if (num === 0) {\n      throw new Error('Cannot calculate mode of an empty array')\n    }\n\n    const count = {}\n    let mode = []\n    let max = 0\n    for (let i = 0; i < values.length; i++) {\n      const value = values[i]\n\n      if (isNumeric(value) && isNaN(value)) {\n        throw new Error('Cannot calculate mode of an array containing NaN values')\n      }\n\n      if (!(value in count)) {\n        count[value] = 0\n      }\n\n      count[value]++\n\n      if (count[value] === max) {\n        mode.push(value)\n      } else if (count[value] > max) {\n        max = count[value]\n        mode = [value]\n      }\n    }\n    return mode\n  }\n})\n","import { typeOf } from '../../../utils/is.js'\n\n/**\n * Improve error messages for statistics functions. Errors are typically\n * thrown in an internally used function like larger, causing the error\n * not to mention the function (like max) which is actually used by the user.\n *\n * @param {Error} err\n * @param {String} fnName\n * @param {*} [value]\n * @return {Error}\n */\nexport function improveErrorMessage (err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  let details\n\n  if (String(err).indexOf('Unexpected type') !== -1) {\n    details = arguments.length > 2\n      ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')'\n      : ' (type: ' + err.data.actual + ')'\n\n    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details)\n  }\n\n  if (String(err).indexOf('complex numbers') !== -1) {\n    details = arguments.length > 2\n      ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')'\n      : ''\n\n    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details)\n  }\n\n  return err\n}\n","import { deepForEach } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'prod'\nconst dependencies = ['typed', 'config', 'multiplyScalar', 'numeric']\n\nexport const createProd = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, multiplyScalar, numeric }) => {\n  /**\n   * Compute the product of a matrix or a list with values.\n   * In case of a (multi dimensional) array or matrix, the sum of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.prod(a, b, c, ...)\n   *     math.prod(A)\n   *\n   * Examples:\n   *\n   *     math.multiply(2, 3)           // returns 6\n   *     math.prod(2, 3)               // returns 6\n   *     math.prod(2, 3, 4)            // returns 24\n   *     math.prod([2, 3, 4])          // returns 24\n   *     math.prod([[2, 5], [4, 3]])   // returns 120\n   *\n   * See also:\n   *\n   *    mean, median, min, max, sum, std, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The product of all values\n   */\n  return typed(name, {\n    // prod([a, b, c, d, ...])\n    'Array | Matrix': _prod,\n\n    // prod([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      // TODO: implement prod(A, dim)\n      throw new Error('prod(A, dim) is not yet supported')\n      // return reduce(arguments[0], arguments[1], math.prod)\n    },\n\n    // prod(a, b, c, d, ...)\n    '...': function (args) {\n      return _prod(args)\n    }\n  })\n\n  /**\n   * Recursively calculate the product of an n-dimensional array\n   * @param {Array} array\n   * @return {number} prod\n   * @private\n   */\n  function _prod (array) {\n    let prod\n\n    deepForEach(array, function (value) {\n      try {\n        prod = (prod === undefined) ? value : multiplyScalar(prod, value)\n      } catch (err) {\n        throw improveErrorMessage(err, 'prod', value)\n      }\n    })\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof prod === 'string') {\n      prod = numeric(prod, config.number)\n    }\n\n    if (prod === undefined) {\n      throw new Error('Cannot calculate prod of an empty array')\n    }\n\n    return prod\n  }\n})\n","import { format as formatString } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'format'\nconst dependencies = ['typed']\n\nexport const createFormat = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Format a value of any type into a string.\n   *\n   * Syntax:\n   *\n   *    math.format(value)\n   *    math.format(value, options)\n   *    math.format(value, precision)\n   *    math.format(value, callback)\n   *\n   * Where:\n   *\n   *  - `value: *`\n   *    The value to be formatted\n   *  - `options: Object`\n   *    An object with formatting options. Available options:\n   *    - `notation: string`\n   *      Number notation. Choose from:\n   *      - 'fixed'\n   *        Always use regular number notation.\n   *        For example '123.40' and '14000000'\n   *      - 'exponential'\n   *        Always use exponential notation.\n   *        For example '1.234e+2' and '1.4e+7'\n   *      - 'engineering'\n   *        Always use engineering notation: always have exponential notation,\n   *        and select the exponent to be a multiple of 3.\n   *        For example '123.4e+0' and '14.0e+6'\n   *      - 'auto' (default)\n   *        Regular number notation for numbers having an absolute value between\n   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.\n   *        Lower bound is included, upper bound is excluded.\n   *        For example '123.4' and '1.4e7'.\n   *      - 'bin', 'oct, or 'hex'\n   *        Format the number using binary, octal, or hexadecimal notation.\n   *        For example '0b1101' and '0x10fe'.\n   *    - `wordSize: number`\n   *      The word size in bits to use for formatting in binary, octal, or\n   *      hexadecimal notation. To be used only with 'bin', 'oct', or 'hex'\n   *      values for 'notation' option. When this option is defined the value\n   *      is formatted as a signed twos complement integer of the given word\n   *      size and the size suffix is appended to the output.\n   *      For example format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n   *      Default value is undefined.\n   *    - `precision: number`\n   *      Limit the number of digits of the formatted value.\n   *      For regular numbers, must be a number between 0 and 16.\n   *      For bignumbers, the maximum depends on the configured precision,\n   *      see function `config()`.\n   *      In case of notations 'exponential', 'engineering', and 'auto', `precision`\n   *      defines the total number of significant digits returned.\n   *      In case of notation 'fixed', `precision` defines the number of\n   *      significant digits after the decimal point.\n   *      `precision` is undefined by default.\n   *    - `lowerExp: number`\n   *      Exponent determining the lower boundary for formatting a value with\n   *      an exponent when `notation='auto`. Default value is `-3`.\n   *    - `upperExp: number`\n   *      Exponent determining the upper boundary for formatting a value with\n   *      an exponent when `notation='auto`. Default value is `5`.\n   *    - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.\n   *      For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is\n   *      configured, and will output `0.(3)` when 'decimal' is configured.\n   *    - `truncate: number`. Specifies the maximum allowed length of the\n   *      returned string. If it would have been longer, the excess characters\n   *      are deleted and replaced with `'...'`.\n   * - `callback: function`\n   *   A custom formatting function, invoked for all numeric elements in `value`,\n   *   for example all elements of a matrix, or the real and imaginary\n   *   parts of a complex number. This callback can be used to override the\n   *   built-in numeric notation with any type of formatting. Function `callback`\n   *   is called with `value` as parameter and must return a string.\n   *\n   * When `value` is an Object:\n   *\n   * - When the object contains a property `format` being a function, this function\n   *   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   * 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   * Examples:\n   *\n   *    math.format(6.4)                                        // returns '6.4'\n   *    math.format(1240000)                                    // returns '1.24e6'\n   *    math.format(1/3)                                        // returns '0.3333333333333333'\n   *    math.format(1/3, 3)                                     // returns '0.333'\n   *    math.format(21385, 2)                                   // returns '21000'\n   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'\n   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'\n   *    math.format(12400,{notation: 'engineering'})            // returns '12.400e+3'\n   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'\n   *\n   *    function formatCurrency(value) {\n   *      // return currency notation with two digits:\n   *      return '$' + value.toFixed(2)\n   *\n   *      // you could also use math.format inside the callback:\n   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})\n   *    }\n   *    math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'\n   *\n   * See also:\n   *\n   *    print\n   *\n   * @param {*} value                               Value to be stringified\n   * @param {Object | Function | number} [options]  Formatting options\n   * @return {string} The formatted value\n   */\n  return typed(name, {\n    any: formatString,\n    'any, Object | function | number': formatString\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'bin'\nconst dependencies = ['typed', 'format']\n\n/**\n * Format a number as binary.\n *\n * Syntax:\n *\n *    math.bin(value)\n *\n * Examples:\n *\n *    //the following outputs \"0b10\"\n *    math.bin(2)\n *\n * See also:\n *\n *    oct\n *    hex\n *\n * @param {number} value    Value to be stringified\n * @param {number} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nexport const createBin = factory(name, dependencies, ({ typed, format }) => {\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      return format(n, { notation: 'bin' })\n    },\n    'number | BigNumber, number': function (n, wordSize) {\n      return format(n, { notation: 'bin', wordSize: wordSize })\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'oct'\nconst dependencies = ['typed', 'format']\n\n/**\n * Format a number as octal.\n *\n * Syntax:\n *\n *    math.oct(value)\n *\n * Examples:\n *\n *    //the following outputs \"0o70\"\n *    math.oct(56)\n *\n * See also:\n *\n *    bin\n *    hex\n *\n * @param {number} value    Value to be stringified\n * @param {number} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\n\nexport const createOct = factory(name, dependencies, ({ typed, format }) => {\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      return format(n, { notation: 'oct' })\n    },\n    'number | BigNumber, number': function (n, wordSize) {\n      return format(n, { notation: 'oct', wordSize: wordSize })\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'hex'\nconst dependencies = ['typed', 'format']\n\n/**\n * Format a number as hexadecimal.\n *\n * Syntax:\n *\n *    math.hex(value)\n *\n * Examples:\n *\n *    //the following outputs \"0xF0\"\n *    math.hex(240)\n *\n * See also:\n *\n *    oct\n *    bin\n *\n * @param {number} value    Value to be stringified\n * @param {number} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nexport const createHex = factory(name, dependencies, ({ typed, format }) => {\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      return format(n, { notation: 'hex' })\n    },\n    'number | BigNumber, number': function (n, wordSize) {\n      return format(n, { notation: 'hex', wordSize: wordSize })\n    }\n  })\n})\n","import { format } from '../../utils/string.js'\nimport { isString } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'print'\nconst dependencies = ['typed']\n\nexport const createPrint = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Interpolate values into a string template.\n   *\n   * Syntax:\n   *\n   *     math.print(template, values)\n   *     math.print(template, values, precision)\n   *     math.print(template, values, options)\n   *\n   * Example usage:\n   *\n   *     // the following outputs: 'Lucy is 5 years old'\n   *     math.print('Lucy is $age years old', {age: 5})\n   *\n   *     // the following outputs: 'The value of pi is 3.141592654'\n   *     math.print('The value of pi is $pi', {pi: math.pi}, 10)\n   *\n   *     // the following outputs: 'hello Mary! The date is 2013-03-23'\n   *     math.print('Hello $user.name! The date is $date', {\n   *       user: {\n   *         name: 'Mary',\n   *       },\n   *       date: new Date(2013, 2, 23).toISOString().substring(0, 10)\n   *     })\n   *\n   *     // the following outputs: 'My favorite fruits are apples and bananas !'\n   *     math.print('My favorite fruits are $0 and $1 !', [\n   *       'apples',\n   *       'bananas'\n   *     ])\n   *\n   * See also:\n   *\n   *     format\n   *\n   * @param {string} template           A string containing variable placeholders.\n   * @param {Object | Array | Matrix}   values An object or array containing variables\n   *                                    which will be filled in in the template.\n   * @param {number | Object} [options] Formatting options,\n   *                                    or the number of digits to format numbers.\n   *                                    See function math.format for a description\n   *                                    of all options.\n   * @return {string} Interpolated string\n   */\n  return typed(name, {\n    // note: Matrix will be converted automatically to an Array\n    'string, Object | Array': _print,\n    'string, Object | Array, number | Object': _print\n  })\n})\n\n/**\n * Interpolate values into a string template.\n * @param {string} template\n * @param {Object} values\n * @param {number | Object} [options]\n * @returns {string} Interpolated string\n * @private\n */\nfunction _print (template, values, options) {\n  return template.replace(/\\$([\\w.]+)/g, function (original, key) {\n    const keys = key.split('.')\n    let value = values[keys.shift()]\n    while (keys.length && value !== undefined) {\n      const k = keys.shift()\n      value = k ? value[k] : value + '.'\n    }\n\n    if (value !== undefined) {\n      if (!isString(value)) {\n        return format(value, options)\n      } else {\n        return value\n      }\n    }\n\n    return original\n  }\n  )\n}\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'to'\nconst dependencies = [\n  'typed',\n  'matrix'\n]\n\nexport const createTo = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Change the unit of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.to(x, unit)\n   *\n   * Examples:\n   *\n   *    math.to(math.unit('2 inch'), 'cm')                   // returns Unit 5.08 cm\n   *    math.to(math.unit('2 inch'), math.unit(null, 'cm'))  // returns Unit 5.08 cm\n   *    math.to(math.unit(16, 'bytes'), 'bits')              // returns Unit 128 bits\n   *\n   * See also:\n   *\n   *    unit\n   *\n   * @param {Unit | Array | Matrix} x     The unit to be converted.\n   * @param {Unit | Array | Matrix} unit  New unit. Can be a string like \"cm\"\n   *                                      or a unit without value.\n   * @return {Unit | Array | Matrix} value with changed, fixed unit.\n   */\n  return typed(name, {\n    'Unit, Unit | string': function (x, unit) {\n      return x.to(unit)\n    },\n\n    'Matrix, Matrix': function (x, y) {\n      // SparseMatrix does not support Units\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'Matrix, any': function (x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, Matrix': function (x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'isPrime'\nconst dependencies = ['typed']\n\nexport const createIsPrime = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is prime: has no divisors other than itself and one.\n   * The function supports type `number`, `bignumber`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPrime(x)\n   *\n   * Examples:\n   *\n   *    math.isPrime(3)                     // returns true\n   *    math.isPrime(-2)                    // returns false\n   *    math.isPrime(0)                     // returns false\n   *    math.isPrime(-0)                    // returns false\n   *    math.isPrime(0.5)                   // returns false\n   *    math.isPrime('2')                   // returns true\n   *    math.isPrime([2, 17, 100])           // returns [true, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x * 0 !== 0) {\n        return false\n      }\n      if (x <= 3) {\n        return x > 1\n      }\n      if (x % 2 === 0 || x % 3 === 0) {\n        return false\n      }\n      for (let i = 5; i * i <= x; i += 6) {\n        if (x % i === 0 || x % (i + 2) === 0) {\n          return false\n        }\n      }\n      return true\n    },\n\n    BigNumber: function (n) {\n      if (n.toNumber() * 0 !== 0) {\n        return false\n      }\n      if (n.lte(3)) return n.gt(1)\n      if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false\n      if (n.lt(Math.pow(2, 32))) {\n        const x = n.toNumber()\n        for (let i = 5; i * i <= x; i += 6) {\n          if (x % i === 0 || x % (i + 2) === 0) {\n            return false\n          }\n        }\n        return true\n      }\n\n      function modPow (base, exponent, modulus) {\n        // exponent can be huge, use non-recursive variant\n        let accumulator = 1\n        while (!exponent.eq(0)) {\n          if (exponent.mod(2).eq(0)) {\n            exponent = exponent.div(2)\n            base = base.mul(base).mod(modulus)\n          } else {\n            exponent = exponent.sub(1)\n            accumulator = base.mul(accumulator).mod(modulus)\n          }\n        }\n        return accumulator\n      }\n\n      // https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Deterministic_variants\n      const Decimal = n.constructor.clone({ precision: n.toFixed(0).length * 2 })\n      n = new Decimal(n)\n      let r = 0\n      let d = n.sub(1)\n      while (d.mod(2).eq(0)) {\n        d = d.div(2)\n        r += 1\n      }\n      let bases = null\n      // https://en.wikipedia.org/wiki/Miller–Rabin_primality_test#Testing_against_small_sets_of_bases\n      if (n.lt('3317044064679887385961981')) {\n        bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(x => x < n)\n      } else {\n        const max = Math.min(n.toNumber() - 2, Math.floor(2 * Math.pow(n.toFixed(0).length * Math.log(10), 2)))\n        bases = []\n        for (let i = 2; i <= max; i += 1) {\n          bases.push(max)\n        }\n      }\n      for (let i = 0; i < bases.length; i += 1) {\n        const a = bases[i]\n        const adn = modPow(n.sub(n).add(a), d, n)\n        if (!adn.eq(1)) {\n          for (let i = 0, x = adn; !x.eq(n.sub(1)); i += 1, x = x.mul(x).mod(n)) {\n            if (i === r - 1) {\n              return false\n            }\n          }\n        }\n      }\n      return true\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { noBignumber, noFraction } from '../../utils/noop.js'\n\nconst name = 'numeric'\nconst dependencies = ['number', '?bignumber', '?fraction']\n\nexport const createNumeric = /* #__PURE__ */ factory(name, dependencies, ({ number, bignumber, fraction }) => {\n  const validInputTypes = {\n    string: true,\n    number: true,\n    BigNumber: true,\n    Fraction: true\n  }\n\n  // Load the conversion functions for each output type\n  const validOutputTypes = {\n    number: (x) => number(x),\n    BigNumber: bignumber\n      ? (x) => bignumber(x)\n      : noBignumber,\n    Fraction: fraction\n      ? (x) => fraction(x)\n      : noFraction\n  }\n\n  /**\n   * Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.\n   *\n   * Syntax:\n   *\n   *    math.numeric(x)\n   *\n   * Examples:\n   *\n   *    math.numeric('4')                           // returns number 4\n   *    math.numeric('4', 'number')                 // returns number 4\n   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4\n   *    math.numeric('4', 'Fraction')               // returns Fraction 4\n   *    math.numeric(4, 'Fraction')                 // returns Fraction 4\n   *    math.numeric(math.fraction(2, 5), 'number') // returns number 0.4\n   *\n   * See also:\n   *\n   *    number, fraction, bignumber, string, format\n   *\n   * @param {string | number | BigNumber | Fraction } value\n   *              A numeric value or a string containing a numeric value\n   * @param {string} outputType\n   *              Desired numeric output type.\n   *              Available values: 'number', 'BigNumber', or 'Fraction'\n   * @return {number | BigNumber | Fraction}\n   *              Returns an instance of the numeric in the requested type\n   */\n  return function numeric (value, outputType) {\n    const inputType = typeOf(value)\n\n    if (!(inputType in validInputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '))\n    }\n    if (!(outputType in validOutputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '))\n    }\n\n    if (outputType === inputType) {\n      return value\n    } else {\n      return validOutputTypes[outputType](value)\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { typeOf } from '../../utils/is.js'\n\nconst name = 'divideScalar'\nconst dependencies = ['typed', 'numeric']\n\nexport const createDivideScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed, numeric }) => {\n  /**\n   * Divide two scalar values, `x / y`.\n   * This function is meant for internal use: it is used by the public functions\n   * `divide` and `inv`.\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   Numerator\n   * @param  {number | BigNumber | Fraction | Complex} y          Denominator\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Quotient, `x / y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x / y\n    },\n\n    'Complex, Complex': function (x, y) {\n      return x.div(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.div(y)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.div(y)\n    },\n\n    'Unit, number | Fraction | BigNumber': function (x, y) {\n      const res = x.clone()\n      // TODO: move the divide function to Unit.js, it uses internals of Unit\n      const one = numeric(1, typeOf(y))\n      res.value = this(((res.value === null) ? res._normalize(one) : res.value), y)\n      return res\n    },\n\n    'number | Fraction | BigNumber, Unit': function (x, y) {\n      let res = y.clone()\n      res = res.pow(-1)\n      // TODO: move the divide function to Unit.js, it uses internals of Unit\n      const one = numeric(1, typeOf(x))\n      res.value = this(x, ((y.value === null) ? y._normalize(one) : y.value))\n      return res\n    },\n\n    'Unit, Unit': function (x, y) {\n      return x.divide(y)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { isInteger } from '../../utils/number.js'\nimport { arraySize as size } from '../../utils/array.js'\nimport { powNumber } from '../../plain/number/index.js'\n\nconst name = 'pow'\nconst dependencies = [\n  'typed',\n  'config',\n  'identity',\n  'multiply',\n  'matrix',\n  'fraction',\n  'number',\n  'Complex'\n]\n\nexport const createPow = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, identity, multiply, matrix, number, fraction, Complex }) => {\n  /**\n   * Calculates the power of x to y, `x ^ y`.\n   * Matrix exponentiation is supported for square matrices `x`, and positive\n   * integer exponents `y`.\n   *\n   * For cubic roots of negative numbers, the function returns the principal\n   * root by default. In order to let the function return the real root,\n   * math.js can be configured with `math.config({predictable: true})`.\n   * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.\n   *\n   * Syntax:\n   *\n   *    math.pow(x, y)\n   *\n   * Examples:\n   *\n   *    math.pow(2, 3)               // returns number 8\n   *\n   *    const a = math.complex(2, 3)\n   *    math.pow(a, 2)                // returns Complex -5 + 12i\n   *\n   *    const b = [[1, 2], [4, 3]]\n   *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]\n   *\n   * See also:\n   *\n   *    multiply, sqrt, cbrt, nthRoot\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base\n   * @param  {number | BigNumber | Complex} y                          The exponent\n   * @return {number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y`\n   */\n  return typed(name, {\n    'number, number': _pow,\n\n    'Complex, Complex': function (x, y) {\n      return x.pow(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      if (y.isInteger() || x >= 0 || config.predictable) {\n        return x.pow(y)\n      } else {\n        return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0)\n      }\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      const result = x.pow(y)\n\n      if (result != null) {\n        return result\n      }\n\n      if (config.predictable) {\n        throw new Error('Result of pow is non-rational and cannot be expressed as a fraction')\n      } else {\n        return _pow(x.valueOf(), y.valueOf())\n      }\n    },\n\n    'Array, number': _powArray,\n\n    'Array, BigNumber': function (x, y) {\n      return _powArray(x, y.toNumber())\n    },\n\n    'Matrix, number': _powMatrix,\n\n    'Matrix, BigNumber': function (x, y) {\n      return _powMatrix(x, y.toNumber())\n    },\n\n    'Unit, number | BigNumber': function (x, y) {\n      return x.pow(y)\n    }\n\n  })\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 | Complex} res\n   * @private\n   */\n  function _pow (x, y) {\n    // Alternatively could define a 'realmode' config option or something, but\n    // 'predictable' will work for now\n    if (config.predictable && !isInteger(y) && x < 0) {\n      // Check to see if y can be represented as a fraction\n      try {\n        const yFrac = fraction(y)\n        const yNum = number(yFrac)\n        if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {\n          if (yFrac.d % 2 === 1) {\n            return (yFrac.n % 2 === 0 ? 1 : -1) * Math.pow(-x, y)\n          }\n        }\n      } catch (ex) {\n        // fraction() throws an error if y is Infinity, etc.\n      }\n\n      // Unable to express y as a fraction, so continue on\n    }\n\n    // **for predictable mode** x^Infinity === NaN if x < -1\n    // N.B. this behavour is different from `Math.pow` which gives\n    // (-2)^Infinity === Infinity\n    if (config.predictable &&\n        ((x < -1 && y === Infinity) ||\n         (x > -1 && x < 0 && y === -Infinity))) {\n      return NaN\n    }\n\n    if (isInteger(y) || x >= 0 || config.predictable) {\n      return powNumber(x, y)\n    } else {\n      // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow\n\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) ||\n        (x * x > 1 && y === -Infinity)) {\n        return 0\n      }\n\n      return new Complex(x, 0).pow(y, 0)\n    }\n  }\n\n  /**\n   * Calculate the power of a 2d array\n   * @param {Array} x     must be a 2 dimensional, square matrix\n   * @param {number} y    a positive, integer value\n   * @returns {Array}\n   * @private\n   */\n  function _powArray (x, y) {\n    if (!isInteger(y) || y < 0) {\n      throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')')\n    }\n    // verify that A is a 2 dimensional square matrix\n    const s = size(x)\n    if (s.length !== 2) {\n      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)')\n    }\n    if (s[0] !== s[1]) {\n      throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')')\n    }\n\n    let res = identity(s[0]).valueOf()\n    let px = x\n    while (y >= 1) {\n      if ((y & 1) === 1) {\n        res = multiply(px, res)\n      }\n      y >>= 1\n      px = multiply(px, px)\n    }\n    return res\n  }\n\n  /**\n   * Calculate the power of a 2d matrix\n   * @param {Matrix} x     must be a 2 dimensional, square matrix\n   * @param {number} y    a positive, integer value\n   * @returns {Matrix}\n   * @private\n   */\n  function _powMatrix (x, y) {\n    return matrix(_powArray(x.valueOf(), y))\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { isInteger } from '../../utils/number.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { roundNumber } from '../../plain/number/index.js'\n\nconst NO_INT = 'Number of decimals in function round must be an integer'\n\nconst name = 'round'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'BigNumber',\n  'DenseMatrix'\n]\n\nexport const createRound = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, BigNumber, DenseMatrix }) => {\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Round a value towards the nearest integer.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.round(x)\n   *    math.round(x, n)\n   *\n   * Examples:\n   *\n   *    math.round(3.22)             // returns number 3\n   *    math.round(3.82)             // returns number 4\n   *    math.round(-4.2)             // returns number -4\n   *    math.round(-4.7)             // returns number -5\n   *    math.round(3.22, 1)          // returns number 3.2\n   *    math.round(3.88, 1)          // returns number 3.9\n   *    math.round(-4.21, 1)         // returns number -4.2\n   *    math.round(-4.71, 1)         // returns number -4.7\n   *    math.round(math.pi, 3)       // returns number 3.142\n   *    math.round(123.45678, 2)     // returns number 123.46\n   *\n   *    const c = math.complex(3.2, -2.7)\n   *    math.round(c)                // returns Complex 3 - 3i\n   *\n   *    math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]\n   *\n   * See also:\n   *\n   *    ceil, fix, floor\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n   */\n  return typed(name, {\n    ...roundNumberSignatures,\n\n    Complex: function (x) {\n      return x.round()\n    },\n\n    'Complex, number': function (x, n) {\n      if (n % 1) { throw new TypeError(NO_INT) }\n\n      return x.round(n)\n    },\n\n    'Complex, BigNumber': function (x, n) {\n      if (!n.isInteger()) { throw new TypeError(NO_INT) }\n\n      const _n = n.toNumber()\n      return x.round(_n)\n    },\n\n    'number, BigNumber': function (x, n) {\n      if (!n.isInteger()) { throw new TypeError(NO_INT) }\n\n      return new BigNumber(x).toDecimalPlaces(n.toNumber())\n    },\n\n    BigNumber: function (x) {\n      return x.toDecimalPlaces(0)\n    },\n\n    'BigNumber, BigNumber': function (x, n) {\n      if (!n.isInteger()) { throw new TypeError(NO_INT) }\n\n      return x.toDecimalPlaces(n.toNumber())\n    },\n\n    Fraction: function (x) {\n      return x.round()\n    },\n\n    'Fraction, number': function (x, n) {\n      if (n % 1) { throw new TypeError(NO_INT) }\n      return x.round(n)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, this, true)\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | Complex | BigNumber, SparseMatrix': function (x, y) {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm12(y, x, this, true)\n    },\n\n    'number | Complex | BigNumber, DenseMatrix': function (x, y) {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'number | Complex | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n\nconst roundNumberSignatures = {\n  number: roundNumber,\n\n  'number, number': function (x, n) {\n    if (!isInteger(n)) { throw new TypeError(NO_INT) }\n    if (n < 0 || n > 15) { throw new Error('Number of decimals in function round must be in the range of 0-15') }\n\n    return roundNumber(x, n)\n  }\n}\n\nexport const createRoundNumber = /* #__PURE__ */ factory(name, ['typed'], ({ typed }) => {\n  return typed(name, roundNumberSignatures)\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { logNumber } from '../../plain/number/index.js'\n\nconst name = 'log'\nconst dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n\nexport const createLog = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n  /**\n   * Calculate the logarithm of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log(x)\n   *    math.log(x, base)\n   *\n   * Examples:\n   *\n   *    math.log(3.5)                  // returns 1.252762968495368\n   *    math.exp(math.log(2.4))        // returns 2.4\n   *\n   *    math.pow(10, 4)                // returns 10000\n   *    math.log(10000, 10)            // returns 4\n   *    math.log(10000) / math.log(10) // returns 4\n   *\n   *    math.log(1024, 2)              // returns 10\n   *    math.pow(2, 10)                // returns 1024\n   *\n   * See also:\n   *\n   *    exp, log2, log10, log1p\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @param {number | BigNumber | Complex} [base=e]\n   *            Optional base for the logarithm. If not provided, the natural\n   *            logarithm of `x` is calculated.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the logarithm of `x`\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= 0 || config.predictable) {\n        return logNumber(x)\n      } else {\n        // negative value -> complex value computation\n        return new Complex(x, 0).log()\n      }\n    },\n\n    Complex: function (x) {\n      return x.log()\n    },\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.ln()\n      } else {\n        // downgrade to number, return Complex valued result\n        return new Complex(x.toNumber(), 0).log()\n      }\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    },\n\n    'any, any': function (x, base) {\n      // calculate logarithm for a specified base, log(x, base)\n      return divideScalar(this(x), this(base))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { log1p as _log1p } from '../../utils/number.js'\n\nconst name = 'log1p'\nconst dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex']\n\nexport const createLog1p = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, divideScalar, log, Complex }) => {\n  /**\n   * Calculate the logarithm of a `value+1`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log1p(x)\n   *    math.log1p(x, base)\n   *\n   * Examples:\n   *\n   *    math.log1p(2.5)                 // returns 1.252762968495368\n   *    math.exp(math.log1p(1.4))       // returns 2.4\n   *\n   *    math.pow(10, 4)                 // returns 10000\n   *    math.log1p(9999, 10)            // returns 4\n   *    math.log1p(9999) / math.log(10) // returns 4\n   *\n   * See also:\n   *\n   *    exp, log, log2, log10\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm of `x+1`.\n   * @param {number | BigNumber | Complex} [base=e]\n   *            Optional base for the logarithm. If not provided, the natural\n   *            logarithm of `x+1` is calculated.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the logarithm of `x+1`\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= -1 || config.predictable) {\n        return _log1p(x)\n      } else {\n        // negative value -> complex value computation\n        return _log1pComplex(new Complex(x, 0))\n      }\n    },\n\n    Complex: _log1pComplex,\n\n    BigNumber: function (x) {\n      const y = x.plus(1)\n      if (!y.isNegative() || config.predictable) {\n        return y.ln()\n      } else {\n        // downgrade to number, return Complex valued result\n        return _log1pComplex(new Complex(x.toNumber(), 0))\n      }\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    },\n\n    'any, any': function (x, base) {\n      // calculate logarithm for a specified base, log1p(x, base)\n      return divideScalar(this(x), log(base))\n    }\n  })\n\n  /**\n   * Calculate the natural logarithm of a complex number + 1\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n  function _log1pComplex (x) {\n    const xRe1p = x.re + 1\n    return new Complex(\n      Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)),\n      Math.atan2(x.im, xRe1p)\n    )\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'nthRoots'\nconst dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n\nexport const createNthRoots = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n  /**\n   * Each function here returns a real multiple of i as a Complex value.\n   * @param  {number} val\n   * @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3\n   */\n  // This is used to fix float artifacts for zero-valued components.\n  const _calculateExactResult = [\n    function realPos (val) { return new Complex(val, 0) },\n    function imagPos (val) { return new Complex(0, val) },\n    function realNeg (val) { return new Complex(-val, 0) },\n    function imagNeg (val) { return new Complex(0, -val) }\n  ]\n\n  /**\n   * Calculate the nth root of a Complex Number a using De Movire's Theorem.\n   * @param  {Complex} a\n   * @param  {number} root\n   * @return {Array} array of n Complex Roots\n   */\n  function _nthComplexRoots (a, root) {\n    if (root < 0) throw new Error('Root must be greater than zero')\n    if (root === 0) throw new Error('Root must be non-zero')\n    if (root % 1 !== 0) throw new Error('Root must be an integer')\n    if (a === 0 || a.abs() === 0) return [new Complex(0, 0)]\n    const aIsNumeric = typeof (a) === 'number'\n    let offset\n    // determine the offset (argument of a)/(pi/2)\n    if (aIsNumeric || a.re === 0 || a.im === 0) {\n      if (aIsNumeric) {\n        offset = 2 * (+(a < 0)) // numeric value on the real axis\n      } else if (a.im === 0) {\n        offset = 2 * (+(a.re < 0)) // complex value on the real axis\n      } else {\n        offset = 2 * (+(a.im < 0)) + 1 // complex value on the imaginary axis\n      }\n    }\n    const arg = a.arg()\n    const abs = a.abs()\n    const roots = []\n    const r = Math.pow(abs, 1 / root)\n    for (let k = 0; k < root; k++) {\n      const halfPiFactor = (offset + 4 * k) / root\n      /**\n       * If (offset + 4*k)/root is an integral multiple of pi/2\n       * then we can produce a more exact result.\n       */\n      if (halfPiFactor === Math.round(halfPiFactor)) {\n        roots.push(_calculateExactResult[halfPiFactor % 4](r))\n        continue\n      }\n      roots.push(new Complex({ r: r, phi: (arg + 2 * Math.PI * k) / root }))\n    }\n    return roots\n  }\n\n  /**\n   * Calculate the nth roots of a value.\n   * An nth root of a positive real number A,\n   * is a positive real solution of the equation \"x^root = A\".\n   * This function returns an array of complex values.\n   *\n   * Syntax:\n   *\n   *    math.nthRoots(x)\n   *    math.nthRoots(x, root)\n   *\n   * Examples:\n   *\n   *    math.nthRoots(1)\n   *    // returns [\n   *    //   {re: 1, im: 0},\n   *    //   {re: -1, im: 0}\n   *    // ]\n   *    nthRoots(1, 3)\n   *    // returns [\n   *    //   { re: 1, im: 0 },\n   *    //   { re: -0.4999999999999998, im: 0.8660254037844387 },\n   *    //   { re: -0.5000000000000004, im: -0.8660254037844385 }\n   *    ]\n   *\n   * See also:\n   *\n   *    nthRoot, pow, sqrt\n   *\n   * @param {number | BigNumber | Fraction | Complex} x Number to be rounded\n   * @return {number | BigNumber | Fraction | Complex}            Rounded value\n   */\n  return typed(name, {\n    Complex: function (x) {\n      return _nthComplexRoots(x, 2)\n    },\n    'Complex, number': _nthComplexRoots\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'dotPow'\nconst dependencies = [\n  'typed',\n  'equalScalar',\n  'matrix',\n  'pow',\n  'DenseMatrix'\n]\n\nexport const createDotPow = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar, matrix, pow, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Calculates the power of x to y element wise.\n   *\n   * Syntax:\n   *\n   *    math.dotPow(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotPow(2, 3)            // returns number 8\n   *\n   *    const a = [[1, 2], [4, 3]]\n   *    math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]\n   *    math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]\n   *\n   * See also:\n   *\n   *    pow, sqrt, multiply\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y  The exponent\n   * @return {number | BigNumber | Complex | Unit | Array | Matrix}                     The value of `x` to the power `y`\n   */\n  return typed(name, {\n\n    'any, any': pow,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, pow, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, pow, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, pow, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, pow)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'dotDivide'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'divideScalar',\n  'DenseMatrix'\n]\n\nexport const createDotDivide = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, divideScalar, DenseMatrix }) => {\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Divide two matrices element wise. The function accepts both matrices and\n   * scalar values.\n   *\n   * Syntax:\n   *\n   *    math.dotDivide(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotDivide(2, 4)   // returns 0.5\n   *\n   *    a = [[9, 5], [6, 1]]\n   *    b = [[3, 2], [5, 2]]\n   *\n   *    math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]\n   *    math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]\n   *\n   * See also:\n   *\n   *    divide, multiply, dotMultiply\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Quotient, `x ./ y`\n   */\n  return typed(name, {\n\n    'any, any': divideScalar,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, divideScalar, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, divideScalar, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, divideScalar, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, divideScalar)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm11(x, y, divideScalar, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, divideScalar, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, divideScalar, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, divideScalar, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, divideScalar, true).valueOf()\n    }\n  })\n})\n","import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js'\nimport { arraySize } from '../../../../utils/array.js'\nimport { format } from '../../../../utils/string.js'\n\nexport function createSolveValidation ({ DenseMatrix }) {\n  /**\n   * Validates matrix and column vector b for backward/forward substitution algorithms.\n   *\n   * @param {Matrix} m            An N x N matrix\n   * @param {Array | Matrix} b    A column vector\n   * @param {Boolean} copy        Return a copy of vector b\n   *\n   * @return {DenseMatrix}        Dense column vector b\n   */\n  return function solveValidation (m, b, copy) {\n    const mSize = m.size()\n\n    if (mSize.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')')\n    }\n\n    const rows = mSize[0]\n    const columns = mSize[1]\n\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')')\n    }\n\n    let data = []\n\n    if (isMatrix(b)) {\n      const bSize = b.size()\n      const bdata = b._data\n\n      // 1-dim vector\n      if (bSize.length === 1) {\n        if (bSize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        for (let i = 0; i < rows; i++) {\n          data[i] = [bdata[i]]\n        }\n\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1],\n          datatype: b._datatype\n        })\n      }\n\n      // 2-dim column\n      if (bSize.length === 2) {\n        if (bSize[0] !== rows || bSize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        if (isDenseMatrix(b)) {\n          if (copy) {\n            data = []\n\n            for (let i = 0; i < rows; i++) {\n              data[i] = [bdata[i][0]]\n            }\n\n            return new DenseMatrix({\n              data: data,\n              size: [rows, 1],\n              datatype: b._datatype\n            })\n          }\n\n          return b\n        }\n\n        if (isSparseMatrix(b)) {\n          for (let i = 0; i < rows; i++) { data[i] = [0] }\n\n          const values = b._values\n          const index = b._index\n          const ptr = b._ptr\n\n          for (let k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n            const i = index[k]\n            data[i][0] = values[k]\n          }\n\n          return new DenseMatrix({\n            data: data,\n            size: [rows, 1],\n            datatype: b._datatype\n          })\n        }\n      }\n\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.')\n    }\n\n    if (isArray(b)) {\n      const bsize = arraySize(b)\n\n      if (bsize.length === 1) {\n        if (bsize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        for (let i = 0; i < rows; i++) {\n          data[i] = [b[i]]\n        }\n\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1]\n        })\n      }\n\n      if (bsize.length === 2) {\n        if (bsize[0] !== rows || bsize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        for (let i = 0; i < rows; i++) {\n          data[i] = [b[i][0]]\n        }\n\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1]\n        })\n      }\n\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.')\n    }\n  }\n}\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'lsolve'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtract',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createLsolve = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtract, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.\n   *\n   * `L * x = b`\n   *\n   * Syntax:\n   *\n   *    math.lsolve(L, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = lsolve(a, b)  // [[-5.5], [20]]\n   *\n   * See also:\n   *\n   *    lsolveAll, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} L       A N x N matrix or array (L)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseForwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseForwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const r = _denseForwardSubstitution(m, b)\n      return r.valueOf()\n    }\n  })\n\n  function _denseForwardSubstitution (m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true)\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // result\n    const x = []\n\n    const mdata = m._data\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      const bj = bdata[j][0] || 0\n      let xj\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        const vjj = mdata[j][j]\n\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        xj = divideScalar(bj, vjj)\n\n        // loop rows\n        for (let i = j + 1; i < rows; i++) {\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))]\n        }\n      } else {\n        // degenerate row, we can choose any value\n        xj = 0\n      }\n\n      x[j] = [xj]\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n\n  function _sparseForwardSubstitution (m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true)\n\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // result\n    const x = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      const bj = bdata[j][0] || 0\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        let vjj = 0\n        // matrix values & indices (column j)\n        const jValues = []\n        const jIndices = []\n\n        // first and last index in the column\n        const firstIndex = ptr[j]\n        const lastIndex = ptr[j + 1]\n\n        // values in column, find value at [j, j]\n        for (let k = firstIndex; k < lastIndex; k++) {\n          const i = index[k]\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k]\n          } else if (i > j) {\n            // store lower triangular\n            jValues.push(values[k])\n            jIndices.push(i)\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        const xj = divideScalar(bj, vjj)\n\n        for (let k = 0, l = jIndices.length; k < l; k++) {\n          const i = jIndices[k]\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, jValues[k]))]\n        }\n\n        x[j] = [xj]\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0]\n      }\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'usolve'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtract',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createUsolve = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtract, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolve(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolve(a, b)  // [[8], [9]]\n   *\n   * See also:\n   *\n   *    usolveAll, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseBackwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseBackwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const r = _denseBackwardSubstitution(m, b)\n      return r.valueOf()\n    }\n  })\n\n  function _denseBackwardSubstitution (m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true)\n\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // result\n    const x = []\n\n    const mdata = m._data\n    // loop columns backwards\n    for (let j = columns - 1; j >= 0; j--) {\n      // b[j]\n      const bj = bdata[j][0] || 0\n      // x[j]\n      let xj\n\n      if (!equalScalar(bj, 0)) {\n        // value at [j, j]\n        const vjj = mdata[j][j]\n\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        xj = divideScalar(bj, vjj)\n\n        // loop rows\n        for (let i = j - 1; i >= 0; i--) {\n          // update copy of b\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))]\n        }\n      } else {\n        // zero value at j\n        xj = 0\n      }\n      // update x\n      x[j] = [xj]\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n\n  function _sparseBackwardSubstitution (m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true)\n\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // result\n    const x = []\n\n    // loop columns backwards\n    for (let j = columns - 1; j >= 0; j--) {\n      const bj = bdata[j][0] || 0\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        let vjj = 0\n\n        // upper triangular matrix values & index (column j)\n        const jValues = []\n        const jIndices = []\n\n        // first & last indeces in column\n        const firstIndex = ptr[j]\n        const lastIndex = ptr[j + 1]\n\n        // values in column, find value at [j, j], loop backwards\n        for (let k = lastIndex - 1; k >= firstIndex; k--) {\n          const i = index[k]\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k]\n          } else if (i < j) {\n            // store upper triangular\n            jValues.push(values[k])\n            jIndices.push(i)\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        const xj = divideScalar(bj, vjj)\n\n        for (let k = 0, lastIndex = jIndices.length; k < lastIndex; k++) {\n          const i = jIndices[k]\n          bdata[i] = [subtract(bdata[i][0], multiplyScalar(xj, jValues[k]))]\n        }\n\n        x[j] = [xj]\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0]\n      }\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'lsolveAll'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtract',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createLsolveAll = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtract, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.\n   *\n   * `L * x = b`\n   *\n   * Syntax:\n   *\n   *    math.lsolveAll(L, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]\n   *\n   * See also:\n   *\n   *    lsolve, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} L       A N x N matrix or array (L)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseForwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseForwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const R = _denseForwardSubstitution(m, b)\n      return R.map(r => r.valueOf())\n    }\n  })\n\n  function _denseForwardSubstitution (m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const M = m._data\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // loop columns\n    for (let i = 0; i < columns; i++) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i])\n\n          for (let j = i + 1; j < columns; j++) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          for (let j = i + 1; j < columns; j++) {\n            bNew[j] = subtract(bNew[j], M[j][i])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n\n  function _sparseForwardSubstitution (m, b_) {\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // loop columns\n    for (let i = 0; i < columns; i++) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        // values & indices (column i)\n        const iValues = []\n        const iIndices = []\n\n        // first & last indeces in column\n        const firstIndex = ptr[i]\n        const lastIndex = ptr[i + 1]\n\n        // find the value at [i, i]\n        let Mii = 0\n        for (let j = firstIndex; j < lastIndex; j++) {\n          const J = index[j]\n          // check row\n          if (J === i) {\n            Mii = values[j]\n          } else if (J > i) {\n            // store lower triangular\n            iValues.push(values[j])\n            iIndices.push(J)\n          }\n        }\n\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii)\n\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            b[J] = subtract(b[J], multiplyScalar(b[i], iValues[j]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            bNew[J] = subtract(bNew[J], iValues[j])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'usolveAll'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtract',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createUsolveAll = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtract, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolveAll(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]\n   *\n   * See also:\n   *\n   *    usolve, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseBackwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseBackwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const R = _denseBackwardSubstitution(m, b)\n      return R.map(r => r.valueOf())\n    }\n  })\n\n  function _denseBackwardSubstitution (m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const M = m._data\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // loop columns backwards\n    for (let i = columns - 1; i >= 0; i--) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i])\n\n          for (let j = i - 1; j >= 0; j--) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          for (let j = i - 1; j >= 0; j--) {\n            bNew[j] = subtract(bNew[j], M[j][i])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n\n  function _sparseBackwardSubstitution (m, b_) {\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // loop columns backwards\n    for (let i = columns - 1; i >= 0; i--) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        // values & indices (column i)\n        const iValues = []\n        const iIndices = []\n\n        // first & last indeces in column\n        const firstIndex = ptr[i]\n        const lastIndex = ptr[i + 1]\n\n        // find the value at [i, i]\n        let Mii = 0\n        for (let j = lastIndex - 1; j >= firstIndex; j--) {\n          const J = index[j]\n          // check row\n          if (J === i) {\n            Mii = values[j]\n          } else if (J < i) {\n            // store upper triangular\n            iValues.push(values[j])\n            iIndices.push(J)\n          }\n        }\n\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii)\n\n          // loop upper triangular\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            b[J] = subtract(b[J], multiplyScalar(b[i], iValues[j]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          // loop upper triangular\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            bNew[J] = subtract(bNew[J], iValues[j])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'algorithm08'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createAlgorithm08 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function algorithm08 (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues || !bvalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrices') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\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      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // workspace\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // vars\n    let k, k0, k1, i\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // loop values in a\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // mark workspace\n        w[i] = mark\n        // set value\n        x[i] = avalues[k]\n        // add index\n        cindex.push(i)\n      }\n      // loop values in b\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // check value exists in workspace\n        if (w[i] === mark) {\n          // evaluate callback\n          x[i] = cf(x[i], bvalues[k])\n        }\n      }\n      // initialize first index in j\n      k = cptr[j]\n      // loop index in j\n      while (k < cindex.length) {\n        // row\n        i = cindex[k]\n        // value @ i\n        const v = x[i]\n        // check for zero value\n        if (!eq(v, zero)) {\n          // push value\n          cvalues.push(v)\n          // increment pointer\n          k++\n        } else {\n          // remove value @ i, do not increment pointer\n          cindex.splice(k, 1)\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js'\nimport { createAlgorithm08 } from '../../type/matrix/utils/algorithm08.js'\nimport { factory } from '../../utils/factory.js'\nimport { leftShiftNumber } from '../../plain/number/index.js'\nimport { leftShiftBigNumber } from '../../utils/bignumber/bitwise.js'\n\nconst name = 'leftShift'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'DenseMatrix'\n]\n\nexport const createLeftShift = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, DenseMatrix }) => {\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm08 = createAlgorithm08({ typed, equalScalar })\n  const algorithm10 = createAlgorithm10({ typed, DenseMatrix })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Bitwise left logical shift of a value x by y number of bits, `x << y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.leftShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.leftShift(1, 2)               // returns number 4\n   *\n   *    math.leftShift([1, 2, 3], 4)       // returns Array [16, 32, 64]\n   *\n   * See also:\n   *\n   *    leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber} y Amount of shifts\n   * @return {number | BigNumber | Array | Matrix} `x` shifted left `y` times\n   */\n  return typed(name, {\n\n    'number, number': leftShiftNumber,\n\n    'BigNumber, BigNumber': leftShiftBigNumber,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm08(x, y, this, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm01(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone()\n      }\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone()\n      }\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | BigNumber, SparseMatrix': function (x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm10(y, x, this, true)\n    },\n\n    'number | BigNumber, DenseMatrix': function (x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf()\n    },\n\n    'number | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf()\n    }\n  })\n})\n","import { rightArithShiftBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js'\nimport { createAlgorithm08 } from '../../type/matrix/utils/algorithm08.js'\nimport { factory } from '../../utils/factory.js'\nimport { rightArithShiftNumber } from '../../plain/number/index.js'\n\nconst name = 'rightArithShift'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'DenseMatrix'\n]\n\nexport const createRightArithShift = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, DenseMatrix }) => {\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm08 = createAlgorithm08({ typed, equalScalar })\n  const algorithm10 = createAlgorithm10({ typed, DenseMatrix })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.rightArithShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.rightArithShift(4, 2)               // returns number 1\n   *\n   *    math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 3]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber} y Amount of shifts\n   * @return {number | BigNumber | Array | Matrix} `x` sign-filled shifted right `y` times\n   */\n  return typed(name, {\n\n    'number, number': rightArithShiftNumber,\n\n    'BigNumber, BigNumber': rightArithShiftBigNumber,\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm08(x, y, this, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm01(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone()\n      }\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone()\n      }\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | BigNumber, SparseMatrix': function (x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm10(y, x, this, true)\n    },\n\n    'number | BigNumber, DenseMatrix': function (x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf()\n    },\n\n    'number | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf()\n    }\n  })\n})\n","import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js'\nimport { createAlgorithm08 } from '../../type/matrix/utils/algorithm08.js'\nimport { factory } from '../../utils/factory.js'\nimport { rightLogShiftNumber } from '../../plain/number/index.js'\n\nconst name = 'rightLogShift'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'DenseMatrix'\n]\n\nexport const createRightLogShift = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, DenseMatrix }) => {\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm08 = createAlgorithm08({ typed, equalScalar })\n  const algorithm10 = createAlgorithm10({ typed, DenseMatrix })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Bitwise right logical shift of value x by y number of bits, `x >>> y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.rightLogShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.rightLogShift(4, 2)               // returns number 1\n   *\n   *    math.rightLogShift([16, -32, 64], 4)   // returns Array [1, 2, 3]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift\n   *\n   * @param  {number | Array | Matrix} x Value to be shifted\n   * @param  {number} y Amount of shifts\n   * @return {number | Array | Matrix} `x` zero-filled shifted right `y` times\n   */\n\n  return typed(name, {\n\n    'number, number': rightLogShiftNumber,\n\n    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm08(x, y, this, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm01(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone()\n      }\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone()\n      }\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | BigNumber, SparseMatrix': function (x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm10(y, x, this, true)\n    },\n\n    'number | BigNumber, DenseMatrix': function (x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage())\n      }\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf()\n    },\n\n    'number | BigNumber, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf()\n    }\n  })\n})\n","import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js'\nimport { factory } from '../../utils/factory.js'\nimport { andNumber } from '../../plain/number/index.js'\n\nconst name = 'and'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'not'\n]\n\nexport const createAnd = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, not }) => {\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm06 = createAlgorithm06({ typed, equalScalar })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.and(x, y)\n   *\n   * Examples:\n   *\n   *    math.and(2, 4)   // returns true\n   *\n   *    a = [2, 0, 0]\n   *    b = [3, 7, 0]\n   *    c = 0\n   *\n   *    math.and(a, b)   // returns [true, false, false]\n   *    math.and(a, c)   // returns [false, false, false]\n   *\n   * See also:\n   *\n   *    not, or, xor\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when both inputs are defined with a nonzero/nonempty value.\n   */\n  return typed(name, {\n\n    'number, number': andNumber,\n\n    'Complex, Complex': function (x, y) {\n      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN()\n    },\n\n    'Unit, Unit': function (x, y) {\n      return this(x.value || 0, y.value || 0)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm06(x, y, this, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm02(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage())\n      }\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage())\n      }\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage())\n      }\n      return algorithm11(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage())\n      }\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf()\n    }\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 { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js'\n\nconst name = 'compare'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'equalScalar',\n  'BigNumber',\n  'Fraction',\n  'DenseMatrix'\n]\n\nexport const createCompare = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, equalScalar, matrix, BigNumber, Fraction, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm05 = createAlgorithm05({ typed, equalScalar })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.\n   *\n   * x and y are considered equal when the relative difference between x and y\n   * is smaller than the configured epsilon. The function cannot be used to\n   * compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.compare(x, y)\n   *\n   * Examples:\n   *\n   *    math.compare(6, 1)           // returns 1\n   *    math.compare(2, 3)           // returns -1\n   *    math.compare(7, 7)           // returns 0\n   *    math.compare('10', '2')      // returns 1\n   *    math.compare('1000', '1e3')  // returns 0\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('40 mm')\n   *    math.compare(a, b)           // returns 1\n   *\n   *    math.compare(2, [1, 2, 3])   // returns [1, 0, -1]\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText\n   *\n   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} y Second value to compare\n   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the result of the comparison:\n   *                                                          1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n  return typed(name, {\n\n    'boolean, boolean': function (x, y) {\n      return x === y ? 0 : (x > y ? 1 : -1)\n    },\n\n    'number, number': function (x, y) {\n      return nearlyEqual(x, y, config.epsilon)\n        ? 0\n        : (x > y ? 1 : -1)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return bigNearlyEqual(x, y, config.epsilon)\n        ? new BigNumber(0)\n        : new BigNumber(x.cmp(y))\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return new Fraction(x.compare(y))\n    },\n\n    'Complex, Complex': function () {\n      throw new TypeError('No ordering relation is defined for complex numbers')\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base')\n      }\n      return this(x.value, y.value)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm05(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n\nexport const createCompareNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return nearlyEqual(x, y, config.epsilon)\n        ? 0\n        : (x > y ? 1 : -1)\n    }\n  })\n})\n","import naturalSort from 'javascript-natural-sort'\nimport { isDenseMatrix, isSparseMatrix, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'compareNatural'\nconst dependencies = [\n  'typed',\n  'compare'\n]\n\nexport const createCompareNatural = /* #__PURE__ */ factory(name, dependencies, ({ typed, compare }) => {\n  const compareBooleans = compare.signatures['boolean,boolean']\n\n  /**\n   * Compare two values of any type in a deterministic, natural way.\n   *\n   * For numeric values, the function works the same as `math.compare`.\n   * For types of values that can't be compared mathematically,\n   * the function compares in a natural way.\n   *\n   * For numeric values, x and y are considered equal when the relative\n   * difference between x and y is smaller than the configured epsilon.\n   * The function cannot be used to compare values smaller than\n   * approximately 2.22e-16.\n   *\n   * For Complex numbers, first the real parts are compared. If equal,\n   * the imaginary parts are compared.\n   *\n   * Strings are compared with a natural sorting algorithm, which\n   * orders strings in a \"logic\" way following some heuristics.\n   * This differs from the function `compare`, which converts the string\n   * into a numeric value and compares that. The function `compareText`\n   * on the other hand compares text lexically.\n   *\n   * Arrays and Matrices are compared value by value until there is an\n   * unequal pair of values encountered. Objects are compared by sorted\n   * keys until the keys or their values are unequal.\n   *\n   * Syntax:\n   *\n   *    math.compareNatural(x, y)\n   *\n   * Examples:\n   *\n   *    math.compareNatural(6, 1)              // returns 1\n   *    math.compareNatural(2, 3)              // returns -1\n   *    math.compareNatural(7, 7)              // returns 0\n   *\n   *    math.compareNatural('10', '2')         // returns 1\n   *    math.compareText('10', '2')            // returns -1\n   *    math.compare('10', '2')                // returns 1\n   *\n   *    math.compareNatural('Answer: 10', 'Answer: 2') // returns 1\n   *    math.compareText('Answer: 10', 'Answer: 2')    // returns -1\n   *    math.compare('Answer: 10', 'Answer: 2')\n   *        // Error: Cannot convert \"Answer: 10\" to a number\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('40 mm')\n   *    math.compareNatural(a, b)              // returns 1\n   *\n   *    const c = math.complex('2 + 3i')\n   *    const d = math.complex('2 + 4i')\n   *    math.compareNatural(c, d)              // returns -1\n   *\n   *    math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1\n   *    math.compareNatural([1, 2, 3], [1, 2])    // returns 1\n   *    math.compareNatural([1, 5], [1, 2, 3])    // returns 1\n   *    math.compareNatural([1, 2], [1, 2])       // returns 0\n   *\n   *    math.compareNatural({a: 2}, {a: 4})       // returns -1\n   *\n   * See also:\n   *\n   *    compare, compareText\n   *\n   * @param  {*} x First value to compare\n   * @param  {*} y Second value to compare\n   * @return {number} Returns the result of the comparison:\n   *                  1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n  return typed(name, {\n    'any, any': function (x, y) {\n      const typeX = typeOf(x)\n      const typeY = typeOf(y)\n      let c\n\n      // numeric types\n      if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') &&\n          (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {\n        c = compare(x, y)\n        if (c.toString() !== '0') {\n          // c can be number, BigNumber, or Fraction\n          return c > 0 ? 1 : -1 // return a number\n        } else {\n          return naturalSort(typeX, typeY)\n        }\n      }\n\n      // matrix types\n      if (typeX === 'Array' || typeX === 'Matrix' ||\n          typeY === 'Array' || typeY === 'Matrix') {\n        c = compareMatricesAndArrays(this, x, y)\n        if (c !== 0) {\n          return c\n        } else {\n          return naturalSort(typeX, typeY)\n        }\n      }\n\n      // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'\n      if (typeX !== typeY) {\n        return naturalSort(typeX, typeY)\n      }\n\n      if (typeX === 'Complex') {\n        return compareComplexNumbers(x, y)\n      }\n\n      if (typeX === 'Unit') {\n        if (x.equalBase(y)) {\n          return this(x.value, y.value)\n        }\n\n        // compare by units\n        return compareArrays(this, x.formatUnits(), y.formatUnits())\n      }\n\n      if (typeX === 'boolean') {\n        return compareBooleans(x, y)\n      }\n\n      if (typeX === 'string') {\n        return naturalSort(x, y)\n      }\n\n      if (typeX === 'Object') {\n        return compareObjects(this, x, y)\n      }\n\n      if (typeX === 'null') {\n        return 0\n      }\n\n      if (typeX === 'undefined') {\n        return 0\n      }\n\n      // this should not occur...\n      throw new TypeError('Unsupported type of value \"' + typeX + '\"')\n    }\n  })\n\n  /**\n   * Compare mixed matrix/array types, by converting to same-shaped array.\n   * This comparator is non-deterministic regarding input types.\n   * @param {Array | SparseMatrix | DenseMatrix | *} x\n   * @param {Array | SparseMatrix | DenseMatrix | *} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  function compareMatricesAndArrays (compareNatural, x, y) {\n    if (isSparseMatrix(x) && isSparseMatrix(y)) {\n      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values)\n    }\n    if (isSparseMatrix(x)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x.toArray(), y)\n    }\n    if (isSparseMatrix(y)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x, y.toArray())\n    }\n\n    // convert DenseArray into Array\n    if (isDenseMatrix(x)) {\n      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y)\n    }\n    if (isDenseMatrix(y)) {\n      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data)\n    }\n\n    // convert scalars to array\n    if (!Array.isArray(x)) {\n      return compareMatricesAndArrays(compareNatural, [x], y)\n    }\n    if (!Array.isArray(y)) {\n      return compareMatricesAndArrays(compareNatural, x, [y])\n    }\n\n    return compareArrays(compareNatural, x, y)\n  }\n\n  /**\n   * Compare two Arrays\n   *\n   * - First, compares value by value\n   * - Next, if all corresponding values are equal,\n   *   look at the length: longest array will be considered largest\n   *\n   * @param {Array} x\n   * @param {Array} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  function compareArrays (compareNatural, x, y) {\n    // compare each value\n    for (let i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {\n      const v = compareNatural(x[i], y[i])\n      if (v !== 0) {\n        return v\n      }\n    }\n\n    // compare the size of the arrays\n    if (x.length > y.length) { return 1 }\n    if (x.length < y.length) { return -1 }\n\n    // both Arrays have equal size and content\n    return 0\n  }\n\n  /**\n   * Compare two objects\n   *\n   * - First, compare sorted property names\n   * - Next, compare the property values\n   *\n   * @param {Object} x\n   * @param {Object} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  function compareObjects (compareNatural, x, y) {\n    const keysX = Object.keys(x)\n    const keysY = Object.keys(y)\n\n    // compare keys\n    keysX.sort(naturalSort)\n    keysY.sort(naturalSort)\n    const c = compareArrays(compareNatural, keysX, keysY)\n    if (c !== 0) {\n      return c\n    }\n\n    // compare values\n    for (let i = 0; i < keysX.length; i++) {\n      const v = compareNatural(x[keysX[i]], y[keysY[i]])\n      if (v !== 0) {\n        return v\n      }\n    }\n\n    return 0\n  }\n})\n\n/**\n * Compare two complex numbers, `x` and `y`:\n *\n * - First, compare the real values of `x` and `y`\n * - If equal, compare the imaginary values of `x` and `y`\n *\n * @params {Complex} x\n * @params {Complex} y\n * @returns {number} Returns the comparison result: -1, 0, or 1\n */\nfunction compareComplexNumbers (x, y) {\n  if (x.re > y.re) { return 1 }\n  if (x.re < y.re) { return -1 }\n\n  if (x.im > y.im) { return 1 }\n  if (x.im < y.im) { return -1 }\n\n  return 0\n}\n","import { compareText as _compareText } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\n\nconst name = 'compareText'\nconst dependencies = [\n  'typed',\n  'matrix'\n]\n\nexport const createCompareText = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Compare two strings lexically. Comparison is case sensitive.\n   * Returns 1 when x > y, -1 when x < y, and 0 when x == y.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.compareText(x, y)\n   *\n   * Examples:\n   *\n   *    math.compareText('B', 'A')     // returns 1\n   *    math.compareText('2', '10')    // returns 1\n   *    math.compare('2', '10')        // returns -1\n   *    math.compareNatural('2', '10') // returns -1\n   *\n   *    math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]\n   *\n   * See also:\n   *\n   *    equal, equalText, compare, compareNatural\n   *\n   * @param  {string | Array | DenseMatrix} x First string to compare\n   * @param  {string | Array | DenseMatrix} y Second string to compare\n   * @return {number | Array | DenseMatrix} Returns the result of the comparison:\n   *                                        1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n  return typed(name, {\n\n    'any, any': _compareText,\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, _compareText)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, _compareText, false)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, _compareText, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _compareText, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, _compareText, true).valueOf()\n    }\n  })\n})\n\nexport const createCompareTextNumber = /* #__PURE__ */ factory(name, ['typed'], ({ typed }) => {\n  return typed(name, {\n    'any, any': _compareText\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'equal'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createEqual = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Test whether two values are equal.\n   *\n   * The function tests whether the relative difference between x and y is\n   * smaller than the configured epsilon. The function cannot be used to\n   * compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.\n   *\n   * Values `null` and `undefined` are compared strictly, thus `null` is only\n   * equal to `null` and nothing else, and `undefined` is only equal to\n   * `undefined` and nothing else. Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.equal(x, y)\n   *\n   * Examples:\n   *\n   *    math.equal(2 + 2, 3)         // returns false\n   *    math.equal(2 + 2, 4)         // returns true\n   *\n   *    const a = math.unit('50 cm')\n   *    const b = math.unit('5 m')\n   *    math.equal(a, b)             // returns true\n   *\n   *    const c = [2, 5, 1]\n   *    const d = [2, 7, 1]\n   *\n   *    math.equal(c, d)             // returns [true, false, true]\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.equal(\"1000\", \"1e3\")    // returns true\n   *    math.equal(0, null)          // returns false\n   *\n   * See also:\n   *\n   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText\n   *\n   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false\n   */\n  return typed(name, {\n\n    'any, any': function (x, y) {\n      // strict equality for null and undefined?\n      if (x === null) { return y === null }\n      if (y === null) { return x === null }\n      if (x === undefined) { return y === undefined }\n      if (y === undefined) { return x === undefined }\n\n      return equalScalar(x, y)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, equalScalar)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, equalScalar, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, equalScalar, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, equalScalar)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, equalScalar, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, equalScalar, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, equalScalar, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, equalScalar, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, equalScalar, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, equalScalar, true).valueOf()\n    }\n  })\n})\n\nexport const createEqualNumber = factory(name, ['typed', 'equalScalar'], ({ typed, equalScalar }) => {\n  return typed(name, {\n    'any, any': function (x, y) {\n      // strict equality for null and undefined?\n      if (x === null) { return y === null }\n      if (y === null) { return x === null }\n      if (x === undefined) { return y === undefined }\n      if (y === undefined) { return x === undefined }\n\n      return equalScalar(x, y)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'equalText'\nconst dependencies = [\n  'typed',\n  'compareText',\n  'isZero'\n]\n\nexport const createEqualText = /* #__PURE__ */ factory(name, dependencies, ({ typed, compareText, isZero }) => {\n  /**\n   * Check equality of two strings. Comparison is case sensitive.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.equalText(x, y)\n   *\n   * Examples:\n   *\n   *    math.equalText('Hello', 'Hello')     // returns true\n   *    math.equalText('a', 'A')             // returns false\n   *    math.equal('2e3', '2000')            // returns true\n   *    math.equalText('2e3', '2000')        // returns false\n   *\n   *    math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    equal, compareText, compare, compareNatural\n   *\n   * @param  {string | Array | DenseMatrix} x First string to compare\n   * @param  {string | Array | DenseMatrix} y Second string to compare\n   * @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.\n   */\n  return typed(name, {\n    'any, any': function (x, y) {\n      return isZero(compareText(x, y))\n    }\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 { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\n\nconst name = 'smaller'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'DenseMatrix'\n]\n\nexport const createSmaller = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Test whether value x is smaller than y.\n   *\n   * The function returns true when x is smaller than y and the relative\n   * difference between x and y is smaller than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smaller(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(2, 3)            // returns true\n   *    math.smaller(5, 2 * 2)        // returns false\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.smaller(a, b)            // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smallerEq, smaller, smallerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n  return typed(name, {\n\n    'boolean, boolean': function (x, y) {\n      return x < y\n    },\n\n    'number, number': function (x, y) {\n      return x < y && !nearlyEqual(x, y, config.epsilon)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.lt(y) && !bigNearlyEqual(x, y, config.epsilon)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.compare(y) === -1\n    },\n\n    'Complex, Complex': function (x, y) {\n      throw new TypeError('No ordering relation is defined for complex numbers')\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base')\n      }\n      return this(x.value, y.value)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n\nexport const createSmallerNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x < y && !nearlyEqual(x, y, config.epsilon)\n    }\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 { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\n\nconst name = 'smallerEq'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'DenseMatrix'\n]\n\nexport const createSmallerEq = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Test whether value x is smaller or equal to y.\n   *\n   * The function returns true when x is smaller than y or the relative\n   * difference between x and y is smaller than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smallerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(1 + 2, 3)        // returns false\n   *    math.smallerEq(1 + 2, 3)      // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, larger, largerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n  return typed(name, {\n\n    'boolean, boolean': function (x, y) {\n      return x <= y\n    },\n\n    'number, number': function (x, y) {\n      return x <= y || nearlyEqual(x, y, config.epsilon)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.lte(y) || bigNearlyEqual(x, y, config.epsilon)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.compare(y) !== 1\n    },\n\n    'Complex, Complex': function () {\n      throw new TypeError('No ordering relation is defined for complex numbers')\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base')\n      }\n      return this(x.value, y.value)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n\nexport const createSmallerEqNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x <= y || nearlyEqual(x, y, config.epsilon)\n    }\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 { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\n\nconst name = 'larger'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'DenseMatrix'\n]\n\nexport const createLarger = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Test whether value x is larger than y.\n   *\n   * The function returns true when x is larger than y and the relative\n   * difference between x and y is larger than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.larger(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 3)             // returns false\n   *    math.larger(5, 2 + 2)         // returns true\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.larger(a, b)             // returns false\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, largerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false\n   */\n  return typed(name, {\n\n    'boolean, boolean': function (x, y) {\n      return x > y\n    },\n\n    'number, number': function (x, y) {\n      return x > y && !nearlyEqual(x, y, config.epsilon)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.gt(y) && !bigNearlyEqual(x, y, config.epsilon)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.compare(y) === 1\n    },\n\n    'Complex, Complex': function () {\n      throw new TypeError('No ordering relation is defined for complex numbers')\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base')\n      }\n      return this(x.value, y.value)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n\nexport const createLargerNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x > y && !nearlyEqual(x, y, config.epsilon)\n    }\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 { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\n\nconst name = 'largerEq'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'DenseMatrix'\n]\n\nexport const createLargerEq = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Test whether value x is larger or equal to y.\n   *\n   * The function returns true when x is larger than y or the relative\n   * difference between x and y is smaller than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.largerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 1 + 1)         // returns false\n   *    math.largerEq(2, 1 + 1)       // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false\n   */\n  return typed(name, {\n\n    'boolean, boolean': function (x, y) {\n      return x >= y\n    },\n\n    'number, number': function (x, y) {\n      return x >= y || nearlyEqual(x, y, config.epsilon)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.gte(y) || bigNearlyEqual(x, y, config.epsilon)\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.compare(y) !== -1\n    },\n\n    'Complex, Complex': function () {\n      throw new TypeError('No ordering relation is defined for complex numbers')\n    },\n\n    'Unit, Unit': function (x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base')\n      }\n      return this(x.value, y.value)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, this)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, this, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, this, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n\nexport const createLargerEqNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x >= y || nearlyEqual(x, y, config.epsilon)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'deepEqual'\nconst dependencies = [\n  'typed',\n  'equal'\n]\n\nexport const createDeepEqual = /* #__PURE__ */ factory(name, dependencies, ({ typed, equal }) => {\n  /**\n   * Test element wise whether two matrices are equal.\n   * The function accepts both matrices and scalar values.\n   *\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.deepEqual(x, y)\n   *\n   * Examples:\n   *\n   *    math.deepEqual(2, 4)   // returns false\n   *\n   *    a = [2, 5, 1]\n   *    b = [2, 7, 1]\n   *\n   *    math.deepEqual(a, b)   // returns false\n   *    math.equal(a, b)       // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    equal, unequal\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n   *            Returns true when the input matrices have the same size and each of their elements is equal.\n   */\n  return typed(name, {\n    'any, any': function (x, y) {\n      return _deepEqual(x.valueOf(), y.valueOf())\n    }\n  })\n\n  /**\n   * Test whether two arrays have the same size and all elements are equal\n   * @param {Array | *} x\n   * @param {Array | *} y\n   * @return {boolean} Returns true if both arrays are deep equal\n   */\n  function _deepEqual (x, y) {\n    if (Array.isArray(x)) {\n      if (Array.isArray(y)) {\n        const len = x.length\n        if (len !== y.length) {\n          return false\n        }\n\n        for (let i = 0; i < len; i++) {\n          if (!_deepEqual(x[i], y[i])) {\n            return false\n          }\n        }\n\n        return true\n      } else {\n        return false\n      }\n    } else {\n      if (Array.isArray(y)) {\n        return false\n      } else {\n        return equal(x, y)\n      }\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\n\nconst name = 'unequal'\nconst dependencies = [\n  'typed',\n  'config',\n  'equalScalar',\n  'matrix',\n  'DenseMatrix'\n]\n\nexport const createUnequal = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, equalScalar, matrix, DenseMatrix }) => {\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm07 = createAlgorithm07({ typed, DenseMatrix })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Test whether two values are unequal.\n   *\n   * The function tests whether the relative difference between x and y is\n   * larger than the configured epsilon. The function cannot be used to compare\n   * values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.\n   * Strings are compared by their numerical value.\n   *\n   * Values `null` and `undefined` are compared strictly, thus `null` is unequal\n   * with everything except `null`, and `undefined` is unequal with everything\n   * except `undefined`.\n   *\n   * Syntax:\n   *\n   *    math.unequal(x, y)\n   *\n   * Examples:\n   *\n   *    math.unequal(2 + 2, 3)       // returns true\n   *    math.unequal(2 + 2, 4)       // returns false\n   *\n   *    const a = math.unit('50 cm')\n   *    const b = math.unit('5 m')\n   *    math.unequal(a, b)           // returns false\n   *\n   *    const c = [2, 5, 1]\n   *    const d = [2, 7, 1]\n   *\n   *    math.unequal(c, d)           // returns [false, true, false]\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.unequal(0, null)        // returns true\n   * See also:\n   *\n   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false\n   */\n  return typed('unequal', {\n\n    'any, any': function (x, y) {\n      // strict equality for null and undefined?\n      if (x === null) { return y !== null }\n      if (y === null) { return x !== null }\n      if (x === undefined) { return y !== undefined }\n      if (y === undefined) { return x !== undefined }\n\n      return _unequal(x, y)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm07(x, y, _unequal)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm03(y, x, _unequal, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, _unequal, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, _unequal)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm12(x, y, _unequal, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, _unequal, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm12(y, x, _unequal, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, _unequal, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _unequal, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, _unequal, true).valueOf()\n    }\n  })\n\n  function _unequal (x, y) {\n    return !equalScalar(x, y)\n  }\n})\n\nexport const createUnequalNumber = factory(name, ['typed', 'equalScalar'], ({ typed, equalScalar }) => {\n  return typed(name, {\n    'any, any': function (x, y) {\n      // strict equality for null and undefined?\n      if (x === null) { return y !== null }\n      if (y === null) { return x !== null }\n      if (x === undefined) { return y !== undefined }\n      if (y === undefined) { return x !== undefined }\n\n      return !equalScalar(x, y)\n    }\n  })\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'partitionSelect'\nconst dependencies = ['typed', 'isNumeric', 'isNaN', 'compare']\n\nexport const createPartitionSelect = /* #__PURE__ */ factory(name, dependencies, ({ typed, isNumeric, isNaN, compare }) => {\n  const asc = compare\n  const desc = (a, b) => -compare(a, b)\n\n  /**\n   * Partition-based selection of an array or 1D matrix.\n   * Will find the kth smallest value, and mutates the input array.\n   * Uses Quickselect.\n   *\n   * Syntax:\n   *\n   *    math.partitionSelect(x, k)\n   *    math.partitionSelect(x, k, compare)\n   *\n   * Examples:\n   *\n   *    math.partitionSelect([5, 10, 1], 2)           // returns 10\n   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1) // returns 'B'\n   *\n   *    function sortByLength (a, b) {\n   *      return a.length - b.length\n   *    }\n   *    math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'\n   *\n   * See also:\n   *\n   *    sort\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to sort\n   * @param {Number} k            The kth smallest value to be retrieved zero-based index\n   * @param {Function | 'asc' | 'desc'} [compare='asc']\n   *        An optional comparator function. The function is called as\n   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,\n   *        and 0 when a == b.\n   * @return {*} Returns the kth lowest value.\n   */\n  return typed(name, {\n    'Array | Matrix, number': function (x, k) {\n      return _partitionSelect(x, k, asc)\n    },\n\n    'Array | Matrix, number, string': function (x, k, compare) {\n      if (compare === 'asc') {\n        return _partitionSelect(x, k, asc)\n      } else if (compare === 'desc') {\n        return _partitionSelect(x, k, desc)\n      } else {\n        throw new Error('Compare string must be \"asc\" or \"desc\"')\n      }\n    },\n\n    'Array | Matrix, number, function': _partitionSelect\n  })\n\n  function _partitionSelect (x, k, compare) {\n    if (!isInteger(k) || k < 0) {\n      throw new Error('k must be a non-negative integer')\n    }\n\n    if (isMatrix(x)) {\n      const size = x.size()\n      if (size.length > 1) {\n        throw new Error('Only one dimensional matrices supported')\n      }\n      return quickSelect(x.valueOf(), k, compare)\n    }\n\n    if (Array.isArray(x)) {\n      return quickSelect(x, k, compare)\n    }\n  }\n\n  /**\n   * Quickselect algorithm.\n   * Code adapted from:\n   * https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html\n   *\n   * @param {Array} arr\n   * @param {Number} k\n   * @param {Function} compare\n   * @private\n   */\n  function quickSelect (arr, k, compare) {\n    if (k >= arr.length) {\n      throw new Error('k out of bounds')\n    }\n\n    // check for NaN values since these can cause an infinite while loop\n    for (let i = 0; i < arr.length; i++) {\n      if (isNumeric(arr[i]) && isNaN(arr[i])) {\n        return arr[i] // return NaN\n      }\n    }\n\n    let from = 0\n    let to = arr.length - 1\n\n    // if from == to we reached the kth element\n    while (from < to) {\n      let r = from\n      let w = to\n      const pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]\n\n      // stop if the reader and writer meets\n      while (r < w) {\n        // arr[r] >= pivot\n        if (compare(arr[r], pivot) >= 0) { // put the large values at the end\n          const tmp = arr[w]\n          arr[w] = arr[r]\n          arr[r] = tmp\n          --w\n        } else { // the value is smaller than the pivot, skip\n          ++r\n        }\n      }\n\n      // if we stepped up (r++) we need to step one down (arr[r] > pivot)\n      if (compare(arr[r], pivot) > 0) {\n        --r\n      }\n\n      // the r pointer is on the end of the first k elements\n      if (k <= r) {\n        to = r\n      } else {\n        from = r + 1\n      }\n    }\n\n    return arr[k]\n  }\n})\n","import { arraySize as size } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'sort'\nconst dependencies = ['typed', 'matrix', 'compare', 'compareNatural']\n\nexport const createSort = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, compare, compareNatural }) => {\n  const compareAsc = compare\n  const compareDesc = (a, b) => -compare(a, b)\n\n  /**\n   * Sort the items in a matrix.\n   *\n   * Syntax:\n   *\n   *    math.sort(x)\n   *    math.sort(x, compare)\n   *\n   * Examples:\n   *\n   *    math.sort([5, 10, 1]) // returns [1, 5, 10]\n   *    math.sort(['C', 'B', 'A', 'D'], math.compareNatural)\n   *    // returns ['A', 'B', 'C', 'D']\n   *\n   *    function sortByLength (a, b) {\n   *      return a.length - b.length\n   *    }\n   *    math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)\n   *    // returns ['Tom', 'Sara', 'Langdon']\n   *\n   * See also:\n   *\n   *    filter, forEach, map, compare, compareNatural\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to sort\n   * @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']\n   *        An optional _comparator function or name. The function is called as\n   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,\n   *        and 0 when a == b.\n   * @return {Matrix | Array} Returns the sorted matrix.\n   */\n  return typed(name, {\n    Array: function (x) {\n      _arrayIsVector(x)\n      return x.sort(compareAsc)\n    },\n\n    Matrix: function (x) {\n      _matrixIsVector(x)\n      return matrix(x.toArray().sort(compareAsc), x.storage())\n    },\n\n    'Array, function': function (x, _comparator) {\n      _arrayIsVector(x)\n      return x.sort(_comparator)\n    },\n\n    'Matrix, function': function (x, _comparator) {\n      _matrixIsVector(x)\n      return matrix(x.toArray().sort(_comparator), x.storage())\n    },\n\n    'Array, string': function (x, order) {\n      _arrayIsVector(x)\n      return x.sort(_comparator(order))\n    },\n\n    'Matrix, string': function (x, order) {\n      _matrixIsVector(x)\n      return matrix(x.toArray().sort(_comparator(order)), x.storage())\n    }\n  })\n\n  /**\n   * Get the comparator for given order ('asc', 'desc', 'natural')\n   * @param {'asc' | 'desc' | 'natural'} order\n   * @return {Function} Returns a _comparator function\n   */\n  function _comparator (order) {\n    if (order === 'asc') {\n      return compareAsc\n    } else if (order === 'desc') {\n      return compareDesc\n    } else if (order === 'natural') {\n      return compareNatural\n    } else {\n      throw new Error('String \"asc\", \"desc\", or \"natural\" expected')\n    }\n  }\n\n  /**\n   * Validate whether an array is one dimensional\n   * Throws an error when this is not the case\n   * @param {Array} array\n   * @private\n   */\n  function _arrayIsVector (array) {\n    if (size(array).length !== 1) {\n      throw new Error('One dimensional array expected')\n    }\n  }\n\n  /**\n   * Validate whether a matrix is one dimensional\n   * Throws an error when this is not the case\n   * @param {Matrix} matrix\n   * @private\n   */\n  function _matrixIsVector (matrix) {\n    if (matrix.size().length !== 1) {\n      throw new Error('One dimensional matrix expected')\n    }\n  }\n})\n","import { deepForEach, reduce, containsCollections } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'max'\nconst dependencies = ['typed', 'config', 'numeric', 'larger']\n\nexport const createMax = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, larger }) => {\n  /**\n   * Compute the maximum value of a matrix or a  list with values.\n   * In case of a multi dimensional array, the maximum of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.max(a, b, c, ...)\n   *     math.max(A)\n   *     math.max(A, dim)\n   *\n   * Examples:\n   *\n   *     math.max(2, 1, 4, 3)                  // returns 4\n   *     math.max([2, 1, 4, 3])                // returns 4\n   *\n   *     // maximum over a specified dimension (zero-based)\n   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]\n   *     math.max([[2, 5], [4, 3]], [1, 7], 1) // returns [5, 4, 7]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, min, prod, std, sum, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The maximum value\n   */\n  return typed(name, {\n    // max([a, b, c, d, ...])\n    'Array | Matrix': _max,\n\n    // max([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      return reduce(array, dim.valueOf(), _largest)\n    },\n\n    // max(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function max')\n      }\n\n      return _max(args)\n    }\n  })\n\n  /**\n   * Return the largest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is largest, or y when y is largest\n   * @private\n   */\n  function _largest (x, y) {\n    try {\n      return larger(x, y) ? x : y\n    } catch (err) {\n      throw improveErrorMessage(err, 'max', y)\n    }\n  }\n\n  /**\n   * Recursively calculate the maximum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} max\n   * @private\n   */\n  function _max (array) {\n    let res\n\n    deepForEach(array, function (value) {\n      try {\n        if (isNaN(value) && typeof value === 'number') {\n          res = NaN\n        } else if (res === undefined || larger(value, res)) {\n          res = value\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'max', value)\n      }\n    })\n\n    if (res === undefined) {\n      throw new Error('Cannot calculate max of an empty array')\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof res === 'string') {\n      res = numeric(res, config.number)\n    }\n\n    return res\n  }\n})\n","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'min'\nconst dependencies = ['typed', 'config', 'numeric', 'smaller']\n\nexport const createMin = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, smaller }) => {\n  /**\n   * Compute the minimum value of a matrix or a  list of values.\n   * In case of a multi dimensional array, the minimum of the flattened array\n   * will be calculated. When `dim` is provided, the minimum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.min(a, b, c, ...)\n   *     math.min(A)\n   *     math.min(A, dim)\n   *\n   * Examples:\n   *\n   *     math.min(2, 1, 4, 3)                  // returns 1\n   *     math.min([2, 1, 4, 3])                // returns 1\n   *\n   *     // minimum over a specified dimension (zero-based)\n   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]\n   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, max, prod, std, sum, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The minimum value\n   */\n  return typed(name, {\n    // min([a, b, c, d, ...])\n    'Array | Matrix': _min,\n\n    // min([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      return reduce(array, dim.valueOf(), _smallest)\n    },\n\n    // min(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function min')\n      }\n\n      return _min(args)\n    }\n  })\n\n  /**\n   * Return the smallest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is smallest, or y when y is smallest\n   * @private\n   */\n  function _smallest (x, y) {\n    try {\n      return smaller(x, y) ? x : y\n    } catch (err) {\n      throw improveErrorMessage(err, 'min', y)\n    }\n  }\n\n  /**\n   * Recursively calculate the minimum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} min\n   * @private\n   */\n  function _min (array) {\n    let min\n\n    deepForEach(array, function (value) {\n      try {\n        if (isNaN(value) && typeof value === 'number') {\n          min = NaN\n        } else if (min === undefined || smaller(value, min)) {\n          min = value\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'min', value)\n      }\n    })\n\n    if (min === undefined) {\n      throw new Error('Cannot calculate min of an empty array')\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof min === 'string') {\n      min = numeric(min, config.number)\n    }\n\n    return min\n  }\n})\n","import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ImmutableDenseMatrix'\nconst dependencies = [\n  'smaller',\n  'DenseMatrix'\n]\n\nexport const createImmutableDenseMatrixClass = /* #__PURE__ */ factory(name, dependencies, ({ smaller, DenseMatrix }) => {\n  function ImmutableDenseMatrix (data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) { throw new SyntaxError('Constructor must be called with the new operator') }\n    if (datatype && !isString(datatype)) { throw new Error('Invalid datatype: ' + datatype) }\n\n    if (isMatrix(data) || isArray(data)) {\n      // use DenseMatrix implementation\n      const matrix = new DenseMatrix(data, datatype)\n      // internal structures\n      this._data = matrix._data\n      this._size = matrix._size\n      this._datatype = matrix._datatype\n      this._min = null\n      this._max = null\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      this._datatype = data.datatype\n      this._min = typeof data.min !== 'undefined' ? data.min : null\n      this._max = typeof data.max !== 'undefined' ? data.max : null\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      this._min = null\n      this._max = null\n    }\n  }\n\n  ImmutableDenseMatrix.prototype = new DenseMatrix()\n\n  /**\n   * Attach type information\n   */\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix'\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true\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 | ImmutableDenseMatrix | *} [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  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n      {\n        // use base implementation\n        const m = DenseMatrix.prototype.subset.call(this, index)\n        // check result is a matrix\n        if (isMatrix(m)) {\n          // return immutable matrix\n          return new ImmutableDenseMatrix({\n            data: m._data,\n            size: m._size,\n            datatype: m._datatype\n          })\n        }\n        return m\n      }\n      // intentional fall through\n      case 2:\n      case 3:\n        throw new Error('Cannot invoke set subset on an Immutable Matrix instance')\n\n      default:\n        throw new SyntaxError('Wrong number of arguments')\n    }\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 {ImmutableDenseMatrix} self\n   */\n  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance')\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  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance')\n  }\n\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance')\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n  ImmutableDenseMatrix.prototype.clone = function () {\n    return new ImmutableDenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    })\n  }\n\n  /**\n   * Get a JSON representation of the matrix\n   * @returns {Object}\n   */\n  ImmutableDenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'ImmutableDenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    }\n  }\n\n  /**\n   * Generate a matrix from a JSON object\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ImmutableDenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {ImmutableDenseMatrix}\n   */\n  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json)\n  }\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\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  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance')\n  }\n\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      let m = null\n      // compute min\n      this.forEach(function (v) {\n        if (m === null || smaller(v, m)) { m = v }\n      })\n      this._min = m !== null ? m : undefined\n    }\n    return this._min\n  }\n\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      let m = null\n      // compute max\n      this.forEach(function (v) {\n        if (m === null || smaller(m, v)) { m = v }\n      })\n      this._max = m !== null ? m : undefined\n    }\n    return this._max\n  }\n\n  return ImmutableDenseMatrix\n}, { isClass: true })\n","import { isMatrix, isRange } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Index'\nconst dependencies = ['ImmutableDenseMatrix']\n\nexport const createIndexClass = /* #__PURE__ */ factory(name, dependencies, ({ ImmutableDenseMatrix }) => {\n  /**\n   * Create an index. An Index can store ranges and sets for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Usage:\n   *     const index = new Index(range1, range2, matrix1, array1, ...)\n   *\n   * Where each parameter can be any of:\n   *     A number\n   *     A string (containing a name of an object property)\n   *     An instance of Range\n   *     An Array with the Set values\n   *     A Matrix with the Set values\n   *\n   * The parameters start, end, and step must be integer numbers.\n   *\n   * @class Index\n   * @Constructor Index\n   * @param {...*} ranges\n   */\n  function Index (ranges) {\n    if (!(this instanceof Index)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this._dimensions = []\n    this._isScalar = true\n\n    for (let i = 0, ii = arguments.length; i < ii; i++) {\n      const arg = arguments[i]\n\n      if (isRange(arg)) {\n        this._dimensions.push(arg)\n        this._isScalar = false\n      } else if (Array.isArray(arg) || isMatrix(arg)) {\n        // create matrix\n        const m = _createImmutableMatrix(arg.valueOf())\n        this._dimensions.push(m)\n        // size\n        const size = m.size()\n        // scalar\n        if (size.length !== 1 || size[0] !== 1) {\n          this._isScalar = false\n        }\n      } else if (typeof arg === 'number') {\n        this._dimensions.push(_createImmutableMatrix([arg]))\n      } else if (typeof arg === 'string') {\n        // object property (arguments.count should be 1)\n        this._dimensions.push(arg)\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range')\n      }\n      // TODO: implement support for wildcard '*'\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Index.prototype.type = 'Index'\n  Index.prototype.isIndex = true\n\n  function _createImmutableMatrix (arg) {\n    // loop array elements\n    for (let i = 0, l = arg.length; i < l; i++) {\n      if (typeof arg[i] !== 'number' || !isInteger(arg[i])) {\n        throw new TypeError('Index parameters must be positive integer numbers')\n      }\n    }\n    // create matrix\n    return new ImmutableDenseMatrix(arg)\n  }\n\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n  Index.prototype.clone = function () {\n    const index = new Index()\n    index._dimensions = clone(this._dimensions)\n    index._isScalar = this._isScalar\n    return index\n  }\n\n  /**\n   * Create an index from an array with ranges/numbers\n   * @memberof Index\n   * @param {Array.<Array | number>} ranges\n   * @return {Index} index\n   * @private\n   */\n  Index.create = function (ranges) {\n    const index = new Index()\n    Index.apply(index, ranges)\n    return index\n  }\n\n  /**\n   * Retrieve the size of the index, the number of elements for each dimension.\n   * @memberof Index\n   * @returns {number[]} size\n   */\n  Index.prototype.size = function () {\n    const size = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const d = this._dimensions[i]\n      size[i] = (typeof d === 'string') ? 1 : d.size()[0]\n    }\n\n    return size\n  }\n\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n  Index.prototype.max = function () {\n    const values = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const range = this._dimensions[i]\n      values[i] = (typeof range === 'string') ? range : range.max()\n    }\n\n    return values\n  }\n\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n  Index.prototype.min = function () {\n    const values = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const range = this._dimensions[i]\n      values[i] = (typeof range === 'string') ? range : range.min()\n    }\n\n    return values\n  }\n\n  /**\n   * Loop over each of the ranges of the index\n   * @memberof Index\n   * @param {Function} callback   Called for each range with a Range as first\n   *                              argument, the dimension as second, and the\n   *                              index object as third.\n   */\n  Index.prototype.forEach = function (callback) {\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      callback(this._dimensions[i], i, this)\n    }\n  }\n\n  /**\n   * Retrieve the dimension for the given index\n   * @memberof Index\n   * @param {Number} dim                  Number of the dimension\n   * @returns {Range | null} range\n   */\n  Index.prototype.dimension = function (dim) {\n    return this._dimensions[dim] || null\n  }\n\n  /**\n   * Test whether this index contains an object property\n   * @returns {boolean} Returns true if the index is an object property\n   */\n  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string'\n  }\n\n  /**\n   * Returns the object property name when the Index holds a single object property,\n   * else returns null\n   * @returns {string | null}\n   */\n  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null\n  }\n\n  /**\n   * Test whether this index contains only a single value.\n   *\n   * This is the case when the index is created with only scalar values as ranges,\n   * not for ranges resolving into a single value.\n   * @memberof Index\n   * @return {boolean} isScalar\n   */\n  Index.prototype.isScalar = function () {\n    return this._isScalar\n  }\n\n  /**\n   * Expand the Index into an array.\n   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.toArray = function () {\n    const array = []\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const dimension = this._dimensions[i]\n      array.push((typeof dimension === 'string') ? dimension : dimension.toArray())\n    }\n    return array\n  }\n\n  /**\n   * Get the primitive value of the Index, a two dimensional array.\n   * Equivalent to Index.toArray().\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.valueOf = Index.prototype.toArray\n\n  /**\n   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'\n   * @memberof Index\n   * @returns {String} str\n   */\n  Index.prototype.toString = function () {\n    const strings = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const dimension = this._dimensions[i]\n      if (typeof dimension === 'string') {\n        strings.push(JSON.stringify(dimension))\n      } else {\n        strings.push(dimension.toString())\n      }\n    }\n\n    return '[' + strings.join(', ') + ']'\n  }\n\n  /**\n   * Get a JSON representation of the Index\n   * @memberof Index\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Index\", \"ranges\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   */\n  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\n    }\n  }\n\n  /**\n   * Instantiate an Index from a JSON object\n   * @memberof Index\n   * @param {Object} json A JSON object structured as:\n   *                     `{\"mathjs\": \"Index\", \"dimensions\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   * @return {Index}\n   */\n  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions)\n  }\n\n  return Index\n}, { isClass: true })\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'FibonacciHeap'\nconst dependencies = ['smaller', 'larger']\n\nexport const createFibonacciHeapClass = /* #__PURE__ */ factory(name, dependencies, ({ smaller, larger }) => {\n  const oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0)\n\n  /**\n   * Fibonacci Heap implementation, used interally for Matrix math.\n   * @class FibonacciHeap\n   * @constructor FibonacciHeap\n   */\n  function FibonacciHeap () {\n    if (!(this instanceof FibonacciHeap)) { throw new SyntaxError('Constructor must be called with the new operator') }\n\n    // initialize fields\n    this._minimum = null\n    this._size = 0\n  }\n\n  /**\n   * Attach type information\n   */\n  FibonacciHeap.prototype.type = 'FibonacciHeap'\n  FibonacciHeap.prototype.isFibonacciHeap = true\n\n  /**\n   * Inserts a new data element into the heap. No heap consolidation is\n   * performed at this time, the new node is simply inserted into the root\n   * list of this heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.insert = function (key, value) {\n    // create node\n    const node = {\n      key: key,\n      value: value,\n      degree: 0\n    }\n    // check we have a node in the minimum\n    if (this._minimum) {\n      // minimum node\n      const minimum = this._minimum\n      // update left & right of node\n      node.left = minimum\n      node.right = minimum.right\n      minimum.right = node\n      node.right.left = node\n      // update minimum node in heap if needed\n      if (smaller(key, minimum.key)) {\n        // node has a smaller key, use it as minimum\n        this._minimum = node\n      }\n    } else {\n      // set left & right\n      node.left = node\n      node.right = node\n      // this is the first node\n      this._minimum = node\n    }\n    // increment number of nodes in heap\n    this._size++\n    // return node\n    return node\n  }\n\n  /**\n   * Returns the number of nodes in heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.size = function () {\n    return this._size\n  }\n\n  /**\n   * Removes all elements from this heap.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.clear = function () {\n    this._minimum = null\n    this._size = 0\n  }\n\n  /**\n   * Returns true if the heap is empty, otherwise false.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.isEmpty = function () {\n    return this._size === 0\n  }\n\n  /**\n   * Extracts the node with minimum key from heap. Amortized running\n   * time: O(log n).\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.extractMinimum = function () {\n    // node to remove\n    const node = this._minimum\n    // check we have a minimum\n    if (node === null) { return node }\n    // current minimum\n    let minimum = this._minimum\n    // get number of children\n    let numberOfChildren = node.degree\n    // pointer to the first child\n    let x = node.child\n    // for each child of node do...\n    while (numberOfChildren > 0) {\n      // store node in right side\n      const tempRight = x.right\n      // remove x from child list\n      x.left.right = x.right\n      x.right.left = x.left\n      // add x to root list of heap\n      x.left = minimum\n      x.right = minimum.right\n      minimum.right = x\n      x.right.left = x\n      // set Parent[x] to null\n      x.parent = null\n      x = tempRight\n      numberOfChildren--\n    }\n    // remove node from root list of heap\n    node.left.right = node.right\n    node.right.left = node.left\n    // update minimum\n    if (node === node.right) {\n      // empty\n      minimum = null\n    } else {\n      // update minimum\n      minimum = node.right\n      // we need to update the pointer to the root with minimum key\n      minimum = _findMinimumNode(minimum, this._size)\n    }\n    // decrement size of heap\n    this._size--\n    // update minimum\n    this._minimum = minimum\n    // return node\n    return node\n  }\n\n  /**\n   * Removes a node from the heap given the reference to the node. The trees\n   * in the heap will be consolidated, if necessary. This operation may fail\n   * to remove the correct element if there are nodes with key value -Infinity.\n   * Running time: O(log n) amortized.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.remove = function (node) {\n    // decrease key value\n    this._minimum = _decreaseKey(this._minimum, node, -1)\n    // remove the smallest\n    this.extractMinimum()\n  }\n\n  /**\n   * Decreases the key value for a heap node, given the new value to take on.\n   * The structure of the heap may be changed and will not be consolidated.\n   * Running time: O(1) amortized.\n   * @memberof FibonacciHeap\n   */\n  function _decreaseKey (minimum, node, key) {\n    // set node key\n    node.key = key\n    // get parent node\n    const parent = node.parent\n    if (parent && smaller(node.key, parent.key)) {\n      // remove node from parent\n      _cut(minimum, node, parent)\n      // remove all nodes from parent to the root parent\n      _cascadingCut(minimum, parent)\n    }\n    // update minimum node if needed\n    if (smaller(node.key, minimum.key)) { minimum = node }\n    // return minimum\n    return minimum\n  }\n\n  /**\n   * The reverse of the link operation: removes node from the child list of parent.\n   * This method assumes that min is non-null. Running time: O(1).\n   * @memberof FibonacciHeap\n   */\n  function _cut (minimum, node, parent) {\n    // remove node from parent children and decrement Degree[parent]\n    node.left.right = node.right\n    node.right.left = node.left\n    parent.degree--\n    // reset y.child if necessary\n    if (parent.child === node) { parent.child = node.right }\n    // remove child if degree is 0\n    if (parent.degree === 0) { parent.child = null }\n    // add node to root list of heap\n    node.left = minimum\n    node.right = minimum.right\n    minimum.right = node\n    node.right.left = node\n    // set parent[node] to null\n    node.parent = null\n    // set mark[node] to false\n    node.mark = false\n  }\n\n  /**\n   * Performs a cascading cut operation. This cuts node from its parent and then\n   * does the same for its parent, and so on up the tree.\n   * Running time: O(log n); O(1) excluding the recursion.\n   * @memberof FibonacciHeap\n   */\n  function _cascadingCut (minimum, node) {\n    // store parent node\n    const parent = node.parent\n    // if there's a parent...\n    if (!parent) { return }\n    // if node is unmarked, set it marked\n    if (!node.mark) {\n      node.mark = true\n    } else {\n      // it's marked, cut it from parent\n      _cut(minimum, node, parent)\n      // cut its parent as well\n      _cascadingCut(parent)\n    }\n  }\n\n  /**\n   * Make the first node a child of the second one. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n  const _linkNodes = function (node, parent) {\n    // remove node from root list of heap\n    node.left.right = node.right\n    node.right.left = node.left\n    // make node a Child of parent\n    node.parent = parent\n    if (!parent.child) {\n      parent.child = node\n      node.right = node\n      node.left = node\n    } else {\n      node.left = parent.child\n      node.right = parent.child.right\n      parent.child.right = node\n      node.right.left = node\n    }\n    // increase degree[parent]\n    parent.degree++\n    // set mark[node] false\n    node.mark = false\n  }\n\n  function _findMinimumNode (minimum, size) {\n    // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree\n    const arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1\n    // create list with initial capacity\n    const array = new Array(arraySize)\n    // find the number of root nodes.\n    let numRoots = 0\n    let x = minimum\n    if (x) {\n      numRoots++\n      x = x.right\n      while (x !== minimum) {\n        numRoots++\n        x = x.right\n      }\n    }\n    // vars\n    let y\n    // For each node in root list do...\n    while (numRoots > 0) {\n      // access this node's degree..\n      let d = x.degree\n      // get next node\n      const next = x.right\n      // check if there is a node already in array with the same degree\n      while (true) {\n        // get node with the same degree is any\n        y = array[d]\n        if (!y) { break }\n        // make one node with the same degree a child of the other, do this based on the key value.\n        if (larger(x.key, y.key)) {\n          const temp = y\n          y = x\n          x = temp\n        }\n        // make y a child of x\n        _linkNodes(y, x)\n        // we have handled this degree, go to next one.\n        array[d] = null\n        d++\n      }\n      // save this node for later when we might encounter another of the same degree.\n      array[d] = x\n      // move forward through list.\n      x = next\n      numRoots--\n    }\n    // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].\n    minimum = null\n    // loop nodes in array\n    for (let i = 0; i < arraySize; i++) {\n      // get current node\n      y = array[i]\n      if (!y) { continue }\n      // check if we have a linked list\n      if (minimum) {\n        // First remove node from root list.\n        y.left.right = y.right\n        y.right.left = y.left\n        // now add to root list, again.\n        y.left = minimum\n        y.right = minimum.right\n        minimum.right = y\n        y.right.left = y\n        // check if this is a new min.\n        if (smaller(y.key, minimum.key)) { minimum = y }\n      } else { minimum = y }\n    }\n    return minimum\n  }\n\n  return FibonacciHeap\n}, { isClass: true })\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'Spa'\nconst dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap']\n\nexport const createSpaClass = /* #__PURE__ */ factory(name, dependencies, ({ addScalar, equalScalar, FibonacciHeap }) => {\n  /**\n   * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array\n   * of the vector elements and an ordered list of non-zero elements.\n   */\n  function Spa () {\n    if (!(this instanceof Spa)) { throw new SyntaxError('Constructor must be called with the new operator') }\n\n    // allocate vector, TODO use typed arrays\n    this._values = []\n    this._heap = new FibonacciHeap()\n  }\n\n  /**\n   * Attach type information\n   */\n  Spa.prototype.type = 'Spa'\n  Spa.prototype.isSpa = true\n\n  /**\n   * Set the value for index i.\n   *\n   * @param {number} i                       The index\n   * @param {number | BigNumber | Complex}   The value at index i\n   */\n  Spa.prototype.set = function (i, v) {\n    // check we have a value @ i\n    if (!this._values[i]) {\n      // insert in heap\n      const node = this._heap.insert(i, v)\n      // set the value @ i\n      this._values[i] = node\n    } else {\n      // update the value @ i\n      this._values[i].value = v\n    }\n  }\n\n  Spa.prototype.get = function (i) {\n    const node = this._values[i]\n    if (node) { return node.value }\n    return 0\n  }\n\n  Spa.prototype.accumulate = function (i, v) {\n    // node @ i\n    let node = this._values[i]\n    if (!node) {\n      // insert in heap\n      node = this._heap.insert(i, v)\n      // initialize value\n      this._values[i] = node\n    } else {\n      // accumulate value\n      node.value = addScalar(node.value, v)\n    }\n  }\n\n  Spa.prototype.forEach = function (from, to, callback) {\n    // references\n    const heap = this._heap\n    const values = this._values\n    // nodes\n    const nodes = []\n    // node with minimum key, save it\n    let node = heap.extractMinimum()\n    if (node) { nodes.push(node) }\n    // extract nodes from heap (ordered)\n    while (node && node.key <= to) {\n      // check it is in range\n      if (node.key >= from) {\n        // check value is not zero\n        if (!equalScalar(node.value, 0)) {\n          // invoke callback\n          callback(node.key, node.value, this)\n        }\n      }\n      // extract next node, save it\n      node = heap.extractMinimum()\n      if (node) { nodes.push(node) }\n    }\n    // reinsert all nodes in heap\n    for (let i = 0; i < nodes.length; i++) {\n      // current node\n      const n = nodes[i]\n      // insert node in heap\n      node = heap.insert(n.key, n.value)\n      // update values\n      values[node.key] = node\n    }\n  }\n\n  Spa.prototype.swap = function (i, j) {\n    // node @ i and j\n    let nodei = this._values[i]\n    let nodej = this._values[j]\n    // check we need to insert indeces\n    if (!nodei && nodej) {\n      // insert in heap\n      nodei = this._heap.insert(i, nodej.value)\n      // remove from heap\n      this._heap.remove(nodej)\n      // set values\n      this._values[i] = nodei\n      this._values[j] = undefined\n    } else if (nodei && !nodej) {\n      // insert in heap\n      nodej = this._heap.insert(j, nodei.value)\n      // remove from heap\n      this._heap.remove(nodei)\n      // set values\n      this._values[j] = nodej\n      this._values[i] = undefined\n    } else if (nodei && nodej) {\n      // swap values\n      const v = nodei.value\n      nodei.value = nodej.value\n      nodej.value = v\n    }\n  }\n\n  return Spa\n}, { isClass: true })\n","import { memoize } from '../function.js'\n\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns e\n */\nexport const createBigNumberE = memoize(function (BigNumber) {\n  return new BigNumber(1).exp()\n}, { hasher })\n\n/**\n * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns phi\n */\nexport const createBigNumberPhi = memoize(function (BigNumber) {\n  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2)\n}, { hasher })\n\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\nexport const createBigNumberPi = memoize(function (BigNumber) {\n  return BigNumber.acos(-1)\n}, { hasher })\n\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\nexport const createBigNumberTau = memoize(function (BigNumber) {\n  return createBigNumberPi(BigNumber).times(2)\n}, { hasher })\n\n/**\n * Create a hash for a BigNumber constructor function. The created has is\n * the configured precision\n * @param {Array} args         Supposed to contain a single entry with\n *                             a BigNumber constructor\n * @return {number} precision\n * @private\n */\nfunction hasher (args) {\n  return args[0].precision\n}\n","import { isComplex, isUnit, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { memoize } from '../../utils/function.js'\nimport { endsWith } from '../../utils/string.js'\nimport { clone, hasOwnProperty } from '../../utils/object.js'\nimport { createBigNumberPi as createPi } from '../../utils/bignumber/constants.js'\n\nconst name = 'Unit'\nconst dependencies = [\n  '?on',\n  'config',\n  'addScalar',\n  'subtract',\n  'multiplyScalar',\n  'divideScalar',\n  'pow',\n  'abs',\n  'fix',\n  'round',\n  'equal',\n  'isNumeric',\n  'format',\n  'number',\n  'Complex',\n  'BigNumber',\n  'Fraction'\n]\n\nexport const createUnitClass = /* #__PURE__ */ factory(name, dependencies, ({\n  on,\n  config,\n  addScalar,\n  subtract,\n  multiplyScalar,\n  divideScalar,\n  pow,\n  abs,\n  fix,\n  round,\n  equal,\n  isNumeric,\n  format,\n  number,\n  Complex,\n  BigNumber,\n  Fraction\n}) => {\n  const toNumber = number\n  /**\n   * A unit can be constructed in the following ways:\n   *\n   *     const a = new Unit(value, name)\n   *     const b = new Unit(null, name)\n   *     const c = Unit.parse(str)\n   *\n   * Example usage:\n   *\n   *     const a = new Unit(5, 'cm')               // 50 mm\n   *     const b = Unit.parse('23 kg')             // 23 kg\n   *     const c = math.in(a, new Unit(null, 'm')  // 0.05 m\n   *     const d = new Unit(9.81, \"m/s^2\")         // 9.81 m/s^2\n   *\n   * @class Unit\n   * @constructor Unit\n   * @param {number | BigNumber | Fraction | Complex | boolean} [value]  A value like 5.2\n   * @param {string} [name]   A unit name like \"cm\" or \"inch\", or a derived unit of the form: \"u1[^ex1] [u2[^ex2] ...] [/ u3[^ex3] [u4[^ex4]]]\", such as \"kg m^2/s^2\", where each unit appearing after the forward slash is taken to be in the denominator. \"kg m^2 s^-2\" is a synonym and is also acceptable. Any of the units can include a prefix.\n   */\n  function Unit (value, name) {\n    if (!(this instanceof Unit)) {\n      throw new Error('Constructor must be called with the new operator')\n    }\n\n    if (!(value === null || value === undefined || isNumeric(value) || isComplex(value))) {\n      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined')\n    }\n    if (name !== undefined && (typeof name !== 'string' || name === '')) {\n      throw new TypeError('Second parameter in Unit constructor must be a string')\n    }\n\n    if (name !== undefined) {\n      const u = Unit.parse(name)\n      this.units = u.units\n      this.dimensions = u.dimensions\n    } else {\n      this.units = [\n        {\n          unit: UNIT_NONE,\n          prefix: PREFIXES.NONE, // link to a list with supported prefixes\n          power: 0\n        }\n      ]\n      this.dimensions = []\n      for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n        this.dimensions[i] = 0\n      }\n    }\n\n    this.value = (value !== undefined && value !== null) ? this._normalize(value) : null\n\n    this.fixPrefix = false // if true, function format will not search for the\n    // best prefix but leave it as initially provided.\n    // fixPrefix is set true by the method Unit.to\n\n    // The justification behind this is that if the constructor is explicitly called,\n    // the caller wishes the units to be returned exactly as he supplied.\n    this.skipAutomaticSimplification = true\n  }\n\n  /**\n   * Attach type information\n   */\n  Unit.prototype.type = 'Unit'\n  Unit.prototype.isUnit = true\n\n  // private variables and functions for the Unit parser\n  let text, index, c\n\n  function skipWhitespace () {\n    while (c === ' ' || c === '\\t') {\n      next()\n    }\n  }\n\n  function isDigitDot (c) {\n    return ((c >= '0' && c <= '9') || c === '.')\n  }\n\n  function isDigit (c) {\n    return ((c >= '0' && c <= '9'))\n  }\n\n  function next () {\n    index++\n    c = text.charAt(index)\n  }\n\n  function revert (oldIndex) {\n    index = oldIndex\n    c = text.charAt(index)\n  }\n\n  function parseNumber () {\n    let number = ''\n    const oldIndex = index\n\n    if (c === '+') {\n      next()\n    } else if (c === '-') {\n      number += c\n      next()\n    }\n\n    if (!isDigitDot(c)) {\n      // a + or - must be followed by a digit\n      revert(oldIndex)\n      return null\n    }\n\n    // get number, can have a single dot\n    if (c === '.') {\n      number += c\n      next()\n      if (!isDigit(c)) {\n        // this is no legal number, it is just a dot\n        revert(oldIndex)\n        return null\n      }\n    } else {\n      while (isDigit(c)) {\n        number += c\n        next()\n      }\n      if (c === '.') {\n        number += c\n        next()\n      }\n    }\n    while (isDigit(c)) {\n      number += c\n      next()\n    }\n\n    // check for exponential notation like \"2.3e-4\" or \"1.23e50\"\n    if (c === 'E' || c === 'e') {\n      // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as \"4exabytes\"\n\n      let tentativeNumber = ''\n      const tentativeIndex = index\n\n      tentativeNumber += c\n      next()\n\n      if (c === '+' || c === '-') {\n        tentativeNumber += c\n        next()\n      }\n\n      // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)\n      if (!isDigit(c)) {\n        // The e or E must belong to something else, so return the number without the e or E.\n        revert(tentativeIndex)\n        return number\n      }\n\n      // We can now safely say that this is scientific notation.\n      number = number + tentativeNumber\n      while (isDigit(c)) {\n        number += c\n        next()\n      }\n    }\n\n    return number\n  }\n\n  function parseUnit () {\n    let unitName = ''\n\n    // Alphanumeric characters only; matches [a-zA-Z0-9]\n    while (isDigit(c) || Unit.isValidAlpha(c)) {\n      unitName += c\n      next()\n    }\n\n    // Must begin with [a-zA-Z]\n    const firstC = unitName.charAt(0)\n    if (Unit.isValidAlpha(firstC)) {\n      return unitName\n    } else {\n      return null\n    }\n  }\n\n  function parseCharacter (toFind) {\n    if (c === toFind) {\n      next()\n      return toFind\n    } else {\n      return null\n    }\n  }\n\n  /**\n   * Parse a string into a unit. The value of the unit is parsed as number,\n   * BigNumber, or Fraction depending on the math.js config setting `number`.\n   *\n   * Throws an exception if the provided string does not contain a valid unit or\n   * cannot be parsed.\n   * @memberof Unit\n   * @param {string} str        A string like \"5.2 inch\", \"4e2 cm/s^2\"\n   * @return {Unit} unit\n   */\n  Unit.parse = function (str, options) {\n    options = options || {}\n    text = str\n    index = -1\n    c = ''\n\n    if (typeof text !== 'string') {\n      throw new TypeError('Invalid argument in Unit.parse, string expected')\n    }\n\n    const unit = new Unit()\n    unit.units = []\n\n    let powerMultiplierCurrent = 1\n    let expectingUnit = false\n\n    // A unit should follow this pattern:\n    // [number] ...[ [*/] unit[^number] ]\n    // unit[^number] ... [ [*/] unit[^number] ]\n\n    // Rules:\n    // number is any floating point number.\n    // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!\n    // The string may optionally begin with a number.\n    // Each unit may optionally be followed by ^number.\n    // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:\n    //   2m^2kg/s^2\n    // it is not good form. If a unit starts with e, then it could be confused as a floating point number:\n    //   4erg\n\n    next()\n    skipWhitespace()\n\n    // Optional number at the start of the string\n    const valueStr = parseNumber()\n    let value = null\n    if (valueStr) {\n      if (config.number === 'BigNumber') {\n        value = new BigNumber(valueStr)\n      } else if (config.number === 'Fraction') {\n        try {\n          // not all numbers can be turned in Fractions, for example very small numbers not\n          value = new Fraction(valueStr)\n        } catch (err) {\n          value = parseFloat(valueStr)\n        }\n      } else { // number\n        value = parseFloat(valueStr)\n      }\n\n      skipWhitespace() // Whitespace is not required here\n\n      // handle multiplication or division right after the value, like '1/s'\n      if (parseCharacter('*')) {\n        powerMultiplierCurrent = 1\n        expectingUnit = true\n      } else if (parseCharacter('/')) {\n        powerMultiplierCurrent = -1\n        expectingUnit = true\n      }\n    }\n\n    // Stack to keep track of powerMultipliers applied to each parentheses group\n    const powerMultiplierStack = []\n\n    // Running product of all elements in powerMultiplierStack\n    let powerMultiplierStackProduct = 1\n\n    while (true) {\n      skipWhitespace()\n\n      // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack\n      // A '(' will always appear directly before a unit.\n      while (c === '(') {\n        powerMultiplierStack.push(powerMultiplierCurrent)\n        powerMultiplierStackProduct *= powerMultiplierCurrent\n        powerMultiplierCurrent = 1\n        next()\n        skipWhitespace()\n      }\n\n      // Is there something here?\n      let uStr\n      if (c) {\n        const oldC = c\n        uStr = parseUnit()\n        if (uStr === null) {\n          throw new SyntaxError('Unexpected \"' + oldC + '\" in \"' + text + '\" at index ' + index.toString())\n        }\n      } else {\n        // End of input.\n        break\n      }\n\n      // Verify the unit exists and get the prefix (if any)\n      const res = _findUnit(uStr)\n      if (res === null) {\n        // Unit not found.\n        throw new SyntaxError('Unit \"' + uStr + '\" not found.')\n      }\n\n      let power = powerMultiplierCurrent * powerMultiplierStackProduct\n      // Is there a \"^ number\"?\n      skipWhitespace()\n      if (parseCharacter('^')) {\n        skipWhitespace()\n        const p = parseNumber()\n        if (p === null) {\n          // No valid number found for the power!\n          throw new SyntaxError('In \"' + str + '\", \"^\" must be followed by a floating-point number')\n        }\n        power *= p\n      }\n\n      // Add the unit to the list\n      unit.units.push({\n        unit: res.unit,\n        prefix: res.prefix,\n        power: power\n      })\n      for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power\n      }\n\n      // Check for and consume closing parentheses, popping from the stack.\n      // A ')' will always follow a unit.\n      skipWhitespace()\n      while (c === ')') {\n        if (powerMultiplierStack.length === 0) {\n          throw new SyntaxError('Unmatched \")\" in \"' + text + '\" at index ' + index.toString())\n        }\n        powerMultiplierStackProduct /= powerMultiplierStack.pop()\n        next()\n        skipWhitespace()\n      }\n\n      // \"*\" and \"/\" should mean we are expecting something to come next.\n      // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.\n      expectingUnit = false\n\n      if (parseCharacter('*')) {\n        // explicit multiplication\n        powerMultiplierCurrent = 1\n        expectingUnit = true\n      } else if (parseCharacter('/')) {\n        // division\n        powerMultiplierCurrent = -1\n        expectingUnit = true\n      } else {\n        // implicit multiplication\n        powerMultiplierCurrent = 1\n      }\n\n      // Replace the unit into the auto unit system\n      if (res.unit.base) {\n        const baseDim = res.unit.base.key\n        UNIT_SYSTEMS.auto[baseDim] = {\n          unit: res.unit,\n          prefix: res.prefix\n        }\n      }\n    }\n\n    // Has the string been entirely consumed?\n    skipWhitespace()\n    if (c) {\n      throw new SyntaxError('Could not parse: \"' + str + '\"')\n    }\n\n    // Is there a trailing slash?\n    if (expectingUnit) {\n      throw new SyntaxError('Trailing characters: \"' + str + '\"')\n    }\n\n    // Is the parentheses stack empty?\n    if (powerMultiplierStack.length !== 0) {\n      throw new SyntaxError('Unmatched \"(\" in \"' + text + '\"')\n    }\n\n    // Are there any units at all?\n    if (unit.units.length === 0 && !options.allowNoUnits) {\n      throw new SyntaxError('\"' + str + '\" contains no units')\n    }\n\n    unit.value = (value !== undefined) ? unit._normalize(value) : null\n    return unit\n  }\n\n  /**\n   * create a copy of this unit\n   * @memberof Unit\n   * @return {Unit} Returns a cloned version of the unit\n   */\n  Unit.prototype.clone = function () {\n    const unit = new Unit()\n\n    unit.fixPrefix = this.fixPrefix\n    unit.skipAutomaticSimplification = this.skipAutomaticSimplification\n\n    unit.value = clone(this.value)\n    unit.dimensions = this.dimensions.slice(0)\n    unit.units = []\n    for (let i = 0; i < this.units.length; i++) {\n      unit.units[i] = { }\n      for (const p in this.units[i]) {\n        if (hasOwnProperty(this.units[i], p)) {\n          unit.units[i][p] = this.units[i][p]\n        }\n      }\n    }\n\n    return unit\n  }\n\n  /**\n   * Return whether the unit is derived (such as m/s, or cm^2, but not N)\n   * @memberof Unit\n   * @return {boolean} True if the unit is derived\n   */\n  Unit.prototype._isDerived = function () {\n    if (this.units.length === 0) {\n      return false\n    }\n    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15\n  }\n\n  /**\n   * Normalize a value, based on its currently set unit(s)\n   * @memberof Unit\n   * @param {number | BigNumber | Fraction | boolean} value\n   * @return {number | BigNumber | Fraction | boolean} normalized value\n   * @private\n   */\n  Unit.prototype._normalize = function (value) {\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value\n    }\n    let res = value\n    const convert = Unit._getNumberConverter(typeOf(value)) // convert to Fraction or BigNumber if needed\n\n    for (let i = 0; i < this.units.length; i++) {\n      const unitValue = convert(this.units[i].unit.value)\n      const unitPrefixValue = convert(this.units[i].prefix.value)\n      const unitPower = convert(this.units[i].power)\n      res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower))\n    }\n\n    return res\n  }\n\n  /**\n   * Denormalize a value, based on its currently set unit(s)\n   * @memberof Unit\n   * @param {number} value\n   * @param {number} [prefixValue]    Optional prefix value to be used (ignored if this is a derived unit)\n   * @return {number} denormalized value\n   * @private\n   */\n  Unit.prototype._denormalize = function (value, prefixValue) {\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value\n    }\n    let res = value\n    const convert = Unit._getNumberConverter(typeOf(value)) // convert to Fraction or BigNumber if needed\n\n    for (let i = 0; i < this.units.length; i++) {\n      const unitValue = convert(this.units[i].unit.value)\n      const unitPrefixValue = convert(this.units[i].prefix.value)\n      const unitPower = convert(this.units[i].power)\n      res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower))\n    }\n\n    return res\n  }\n\n  /**\n   * Find a unit from a string\n   * @memberof Unit\n   * @param {string} str              A string like 'cm' or 'inch'\n   * @returns {Object | null} result  When found, an object with fields unit and\n   *                                  prefix is returned. Else, null is returned.\n   * @private\n   */\n  const _findUnit = memoize((str) => {\n    // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.\n    if (hasOwnProperty(UNITS, str)) {\n      const unit = UNITS[str]\n      const prefix = unit.prefixes['']\n      return {\n        unit,\n        prefix\n      }\n    }\n\n    for (const name in UNITS) {\n      if (hasOwnProperty(UNITS, name)) {\n        if (endsWith(str, name)) {\n          const unit = UNITS[name]\n          const prefixLen = (str.length - name.length)\n          const prefixName = str.substring(0, prefixLen)\n          const prefix = hasOwnProperty(unit.prefixes, prefixName)\n            ? unit.prefixes[prefixName]\n            : undefined\n          if (prefix !== undefined) {\n            // store unit, prefix, and value\n            return {\n              unit,\n              prefix\n            }\n          }\n        }\n      }\n    }\n\n    return null\n  }, { hasher: (args) => args[0], limit: 100 })\n\n  /**\n   * Test if the given expression is a unit.\n   * The unit can have a prefix but cannot have a value.\n   * @memberof Unit\n   * @param {string} name   A string to be tested whether it is a value less unit.\n   *                        The unit can have prefix, like \"cm\"\n   * @return {boolean}      true if the given string is a unit\n   */\n  Unit.isValuelessUnit = function (name) {\n    return (_findUnit(name) !== null)\n  }\n\n  /**\n   * check if this unit has given base unit\n   * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.\n   * @memberof Unit\n   * @param {BASE_UNITS | string | undefined} base\n   */\n  Unit.prototype.hasBase = function (base) {\n    if (typeof (base) === 'string') {\n      base = BASE_UNITS[base]\n    }\n\n    if (!base) { return false }\n\n    // All dimensions must be the same\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {\n        return false\n      }\n    }\n    return true\n  }\n\n  /**\n   * Check if this unit has a base or bases equal to another base or bases\n   * For derived units, the exponent on each base also must match\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {boolean} true if equal base\n   */\n  Unit.prototype.equalBase = function (other) {\n    // All dimensions must be the same\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {\n        return false\n      }\n    }\n    return true\n  }\n\n  /**\n   * Check if this unit equals another unit\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {boolean} true if both units are equal\n   */\n  Unit.prototype.equals = function (other) {\n    return (this.equalBase(other) && equal(this.value, other.value))\n  }\n\n  /**\n   * Multiply this unit with another one\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {Unit} product of this unit and the other unit\n   */\n  Unit.prototype.multiply = function (other) {\n    const res = this.clone()\n\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0)\n    }\n\n    // Append other's units list onto res\n    for (let i = 0; i < other.units.length; i++) {\n      // Make a shallow copy of every unit\n      const inverted = {\n        ...other.units[i]\n      }\n      res.units.push(inverted)\n    }\n\n    // If at least one operand has a value, then the result should also have a value\n    if (this.value !== null || other.value !== null) {\n      const valThis = this.value === null ? this._normalize(1) : this.value\n      const valOther = other.value === null ? other._normalize(1) : other.value\n      res.value = multiplyScalar(valThis, valOther)\n    } else {\n      res.value = null\n    }\n\n    res.skipAutomaticSimplification = false\n\n    return getNumericIfUnitless(res)\n  }\n\n  /**\n   * Divide this unit by another one\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {Unit} result of dividing this unit by the other unit\n   */\n  Unit.prototype.divide = function (other) {\n    const res = this.clone()\n\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0)\n    }\n\n    // Invert and append other's units list onto res\n    for (let i = 0; i < other.units.length; i++) {\n      // Make a shallow copy of every unit\n      const inverted = {\n        ...other.units[i],\n        power: -other.units[i].power\n      }\n      res.units.push(inverted)\n    }\n\n    // If at least one operand has a value, the result should have a value\n    if (this.value !== null || other.value !== null) {\n      const valThis = this.value === null ? this._normalize(1) : this.value\n      const valOther = other.value === null ? other._normalize(1) : other.value\n      res.value = divideScalar(valThis, valOther)\n    } else {\n      res.value = null\n    }\n\n    res.skipAutomaticSimplification = false\n\n    return getNumericIfUnitless(res)\n  }\n\n  /**\n   * Calculate the power of a unit\n   * @memberof Unit\n   * @param {number | Fraction | BigNumber} p\n   * @returns {Unit}      The result: this^p\n   */\n  Unit.prototype.pow = function (p) {\n    const res = this.clone()\n\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) * p\n    }\n\n    // Adjust the power of each unit in the list\n    for (let i = 0; i < res.units.length; i++) {\n      res.units[i].power *= p\n    }\n\n    if (res.value !== null) {\n      res.value = pow(res.value, p)\n\n      // only allow numeric output, we don't want to return a Complex number\n      // if (!isNumeric(res.value)) {\n      //  res.value = NaN\n      // }\n      // Update: Complex supported now\n    } else {\n      res.value = null\n    }\n\n    res.skipAutomaticSimplification = false\n\n    return getNumericIfUnitless(res)\n  }\n\n  /**\n   * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise\n   * @param {Unit} unit\n   * @returns {number | Fraction | BigNumber | Unit}  The numeric value of the unit if conditions are met, or the original unit otherwise\n   */\n  function getNumericIfUnitless (unit) {\n    if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {\n      return unit.value\n    } else {\n      return unit\n    }\n  }\n\n  /**\n   * Calculate the absolute value of a unit\n   * @memberof Unit\n   * @param {number | Fraction | BigNumber} x\n   * @returns {Unit}      The result: |x|, absolute value of x\n   */\n  Unit.prototype.abs = function () {\n    const ret = this.clone()\n    if (ret.value !== null) {\n      if (ret._isDerived() || ret.units[0].unit.offset === 0) {\n        ret.value = abs(ret.value)\n      } else {\n        // To give the correct, but unexpected, results for units with an offset.\n        // For example, abs(-283.15 degC) = -263.15 degC !!!\n        // We must take the offset into consideration here\n        const convert = Unit._getNumberConverter(typeOf(ret.value)) // convert to Fraction or BigNumber if needed\n        const unitValue = convert(ret.units[0].unit.value)\n        const nominalOffset = convert(ret.units[0].unit.offset)\n        const unitOffset = multiplyScalar(unitValue, nominalOffset)\n        ret.value = subtract(abs(addScalar(ret.value, unitOffset)), unitOffset)\n      }\n    }\n\n    for (const i in ret.units) {\n      if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {\n        ret.units[i].unit = UNITS.W\n      }\n    }\n\n    return ret\n  }\n\n  /**\n   * Convert the unit to a specific unit name.\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like \"cm\"\n   * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.\n   */\n  Unit.prototype.to = function (valuelessUnit) {\n    const value = this.value === null ? this._normalize(1) : this.value\n    let other\n    if (typeof valuelessUnit === 'string') {\n      other = Unit.parse(valuelessUnit)\n    } else if (isUnit(valuelessUnit)) {\n      other = valuelessUnit.clone()\n    } else {\n      throw new Error('String or Unit expected as parameter')\n    }\n\n    if (!this.equalBase(other)) {\n      throw new Error(`Units do not match ('${other.toString()}' != '${this.toString()}')`)\n    }\n    if (other.value !== null) {\n      throw new Error('Cannot convert to a unit with a value')\n    }\n\n    if (this.value === null || this._isDerived() ||\n        this.units[0].unit.offset === other.units[0].unit.offset) {\n      other.value = clone(value)\n    } else {\n      /* Need to adjust value by difference in offset to convert */\n      const convert = Unit._getNumberConverter(typeOf(value)) // convert to Fraction or BigNumber if needed\n\n      const thisUnitValue = convert(this.units[0].unit.value)\n      const thisNominalOffset = convert(this.units[0].unit.offset)\n      const thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset)\n\n      const otherUnitValue = convert(other.units[0].unit.value)\n      const otherNominalOffset = convert(other.units[0].unit.offset)\n      const otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset)\n\n      other.value = subtract(addScalar(value, thisUnitOffset), otherUnitOffset)\n    }\n    other.fixPrefix = true\n    other.skipAutomaticSimplification = true\n    return other\n  }\n\n  /**\n   * Return the value of the unit when represented with given valueless unit\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'\n   * @return {number} Returns the unit value as number.\n   */\n  // TODO: deprecate Unit.toNumber? It's always better to use toNumeric\n  Unit.prototype.toNumber = function (valuelessUnit) {\n    return toNumber(this.toNumeric(valuelessUnit))\n  }\n\n  /**\n   * Return the value of the unit in the original numeric type\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'\n   * @return {number | BigNumber | Fraction} Returns the unit value\n   */\n  Unit.prototype.toNumeric = function (valuelessUnit) {\n    let other\n    if (valuelessUnit) {\n      // Allow getting the numeric value without converting to a different unit\n      other = this.to(valuelessUnit)\n    } else {\n      other = this.clone()\n    }\n\n    if (other._isDerived() || other.units.length === 0) {\n      return other._denormalize(other.value)\n    } else {\n      return other._denormalize(other.value, other.units[0].prefix.value)\n    }\n  }\n\n  /**\n   * Get a string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.toString = function () {\n    return this.format()\n  }\n\n  /**\n   * Get a JSON representation of the unit\n   * @memberof Unit\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n   */\n  Unit.prototype.toJSON = function () {\n    return {\n      mathjs: 'Unit',\n      value: this._denormalize(this.value),\n      unit: this.formatUnits(),\n      fixPrefix: this.fixPrefix\n    }\n  }\n\n  /**\n   * Instantiate a Unit from a JSON object\n   * @memberof Unit\n   * @param {Object} json  A JSON object structured as:\n   *                       `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n   * @return {Unit}\n   */\n  Unit.fromJSON = function (json) {\n    const unit = new Unit(json.value, json.unit)\n    unit.fixPrefix = json.fixPrefix || false\n    return unit\n  }\n\n  /**\n   * Returns the string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.valueOf = Unit.prototype.toString\n\n  /**\n   * Simplify this Unit's unit list and return a new Unit with the simplified list.\n   * The returned Unit will contain a list of the \"best\" units for formatting.\n   */\n  Unit.prototype.simplify = function () {\n    const ret = this.clone()\n\n    const proposedUnitList = []\n\n    // Search for a matching base\n    let matchingBase\n    for (const key in currentUnitSystem) {\n      if (hasOwnProperty(currentUnitSystem, key)) {\n        if (ret.hasBase(BASE_UNITS[key])) {\n          matchingBase = key\n          break\n        }\n      }\n    }\n\n    if (matchingBase === 'NONE') {\n      ret.units = []\n    } else {\n      let matchingUnit\n      if (matchingBase) {\n        // Does the unit system have a matching unit?\n        if (hasOwnProperty(currentUnitSystem, matchingBase)) {\n          matchingUnit = currentUnitSystem[matchingBase]\n        }\n      }\n      if (matchingUnit) {\n        ret.units = [{\n          unit: matchingUnit.unit,\n          prefix: matchingUnit.prefix,\n          power: 1.0\n        }]\n      } else {\n        // Multiple units or units with powers are formatted like this:\n        // 5 (kg m^2) / (s^3 mol)\n        // Build an representation from the base units of the current unit system\n        let missingBaseDim = false\n        for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n          const baseDim = BASE_DIMENSIONS[i]\n          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n            if (hasOwnProperty(currentUnitSystem, baseDim)) {\n              proposedUnitList.push({\n                unit: currentUnitSystem[baseDim].unit,\n                prefix: currentUnitSystem[baseDim].prefix,\n                power: ret.dimensions[i] || 0\n              })\n            } else {\n              missingBaseDim = true\n            }\n          }\n        }\n\n        // Is the proposed unit list \"simpler\" than the existing one?\n        if (proposedUnitList.length < ret.units.length && !missingBaseDim) {\n          // Replace this unit list with the proposed list\n          ret.units = proposedUnitList\n        }\n      }\n    }\n\n    return ret\n  }\n\n  /**\n   * Returns a new Unit in the SI system with the same value as this one\n   */\n  Unit.prototype.toSI = function () {\n    const ret = this.clone()\n\n    const proposedUnitList = []\n\n    // Multiple units or units with powers are formatted like this:\n    // 5 (kg m^2) / (s^3 mol)\n    // Build an representation from the base units of the SI unit system\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      const baseDim = BASE_DIMENSIONS[i]\n      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n        if (hasOwnProperty(UNIT_SYSTEMS.si, baseDim)) {\n          proposedUnitList.push({\n            unit: UNIT_SYSTEMS.si[baseDim].unit,\n            prefix: UNIT_SYSTEMS.si[baseDim].prefix,\n            power: ret.dimensions[i] || 0\n          })\n        } else {\n          throw new Error('Cannot express custom unit ' + baseDim + ' in SI units')\n        }\n      }\n    }\n\n    // Replace this unit list with the proposed list\n    ret.units = proposedUnitList\n\n    ret.fixPrefix = true\n    ret.skipAutomaticSimplification = true\n\n    return ret\n  }\n\n  /**\n   * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.formatUnits = function () {\n    let strNum = ''\n    let strDen = ''\n    let nNum = 0\n    let nDen = 0\n\n    for (let i = 0; i < this.units.length; i++) {\n      if (this.units[i].power > 0) {\n        nNum++\n        strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name\n        if (Math.abs(this.units[i].power - 1.0) > 1e-15) {\n          strNum += '^' + this.units[i].power\n        }\n      } else if (this.units[i].power < 0) {\n        nDen++\n      }\n    }\n\n    if (nDen > 0) {\n      for (let i = 0; i < this.units.length; i++) {\n        if (this.units[i].power < 0) {\n          if (nNum > 0) {\n            strDen += ' ' + this.units[i].prefix.name + this.units[i].unit.name\n            if (Math.abs(this.units[i].power + 1.0) > 1e-15) {\n              strDen += '^' + (-this.units[i].power)\n            }\n          } else {\n            strDen += ' ' + this.units[i].prefix.name + this.units[i].unit.name\n            strDen += '^' + (this.units[i].power)\n          }\n        }\n      }\n    }\n    // Remove leading \" \"\n    strNum = strNum.substr(1)\n    strDen = strDen.substr(1)\n\n    // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting\n    if (nNum > 1 && nDen > 0) {\n      strNum = '(' + strNum + ')'\n    }\n    if (nDen > 1 && nNum > 0) {\n      strDen = '(' + strDen + ')'\n    }\n\n    let str = strNum\n    if (nNum > 0 && nDen > 0) {\n      str += ' / '\n    }\n    str += strDen\n\n    return str\n  }\n\n  /**\n   * Get a string representation of the Unit, with optional formatting options.\n   * @memberof Unit\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}\n   */\n  Unit.prototype.format = function (options) {\n    // Simplfy the unit list, unless it is valueless or was created directly in the\n    // constructor or as the result of to or toSI\n    const simp = this.skipAutomaticSimplification || this.value === null\n      ? this.clone()\n      : this.simplify()\n\n    // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.\n    let isImaginary = false\n    if (typeof (simp.value) !== 'undefined' && simp.value !== null && isComplex(simp.value)) {\n      // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute\n      isImaginary = Math.abs(simp.value.re) < 1e-14\n    }\n\n    for (const i in simp.units) {\n      if (hasOwnProperty(simp.units, i)) {\n        if (simp.units[i].unit) {\n          if (simp.units[i].unit.name === 'VA' && isImaginary) {\n            simp.units[i].unit = UNITS.VAR\n          } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {\n            simp.units[i].unit = UNITS.VA\n          }\n        }\n      }\n    }\n\n    // Now apply the best prefix\n    // Units must have only one unit and not have the fixPrefix flag set\n    if (simp.units.length === 1 && !simp.fixPrefix) {\n      // Units must have integer powers, otherwise the prefix will change the\n      // outputted value by not-an-integer-power-of-ten\n      if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {\n        // Apply the best prefix\n        simp.units[0].prefix = simp._bestPrefix()\n      }\n    }\n\n    const value = simp._denormalize(simp.value)\n    let str = (simp.value !== null) ? format(value, options || {}) : ''\n    const unitStr = simp.formatUnits()\n    if (simp.value && isComplex(simp.value)) {\n      str = '(' + str + ')' // Surround complex values with ( ) to enable better parsing\n    }\n    if (unitStr.length > 0 && str.length > 0) {\n      str += ' '\n    }\n    str += unitStr\n\n    return str\n  }\n\n  /**\n   * Calculate the best prefix using current value.\n   * @memberof Unit\n   * @returns {Object} prefix\n   * @private\n   */\n  Unit.prototype._bestPrefix = function () {\n    if (this.units.length !== 1) {\n      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!')\n    }\n    if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {\n      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!')\n    }\n\n    // find the best prefix value (resulting in the value of which\n    // the absolute value of the log10 is closest to zero,\n    // though with a little offset of 1.2 for nicer values: you get a\n    // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...\n\n    // Note: the units value can be any numeric type, but to find the best\n    // prefix it's enough to work with limited precision of a regular number\n    // Update: using mathjs abs since we also allow complex numbers\n    const absValue = this.value !== null ? abs(this.value) : 0\n    const absUnitValue = abs(this.units[0].unit.value)\n    let bestPrefix = this.units[0].prefix\n    if (absValue === 0) {\n      return bestPrefix\n    }\n    const power = this.units[0].power\n    let bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - 1.2\n    if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix // Allow the original prefix\n    bestDiff = Math.abs(bestDiff)\n    const prefixes = this.units[0].unit.prefixes\n    for (const p in prefixes) {\n      if (hasOwnProperty(prefixes, p)) {\n        const prefix = prefixes[p]\n        if (prefix.scientific) {\n          const diff = Math.abs(\n            Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2)\n\n          if (diff < bestDiff ||\n            (diff === bestDiff && prefix.name.length < bestPrefix.name.length)) {\n            // choose the prefix with the smallest diff, or if equal, choose the one\n            // with the shortest name (can happen with SHORTLONG for example)\n            bestPrefix = prefix\n            bestDiff = diff\n          }\n        }\n      }\n    }\n\n    return bestPrefix\n  }\n\n  /**\n   * Returns an array of units whose sum is equal to this unit\n   * @memberof Unit\n   * @param {Array} [parts] An array of strings or valueless units.\n   *\n   *   Example:\n   *\n   *   const u = new Unit(1, 'm')\n   *   u.splitUnit(['feet', 'inch'])\n   *     [ 3 feet, 3.3700787401575 inch ]\n   *\n   * @return {Array} An array of units.\n   */\n  Unit.prototype.splitUnit = function (parts) {\n    let x = this.clone()\n    const ret = []\n    for (let i = 0; i < parts.length; i++) {\n      // Convert x to the requested unit\n      x = x.to(parts[i])\n      if (i === parts.length - 1) break\n\n      // Get the numeric value of this unit\n      const xNumeric = x.toNumeric()\n\n      // Check to see if xNumeric is nearly equal to an integer,\n      // since fix can incorrectly round down if there is round-off error\n      const xRounded = round(xNumeric)\n      let xFixed\n      const isNearlyEqual = equal(xRounded, xNumeric)\n      if (isNearlyEqual) {\n        xFixed = xRounded\n      } else {\n        xFixed = fix(x.toNumeric())\n      }\n\n      const y = new Unit(xFixed, parts[i].toString())\n      ret.push(y)\n      x = subtract(x, y)\n    }\n\n    // This little bit fixes a bug where the remainder should be 0 but is a little bit off.\n    // But instead of comparing x, the remainder, with zero--we will compare the sum of\n    // all the parts so far with the original value. If they are nearly equal,\n    // we set the remainder to 0.\n    let testSum = 0\n    for (let i = 0; i < ret.length; i++) {\n      testSum = addScalar(testSum, ret[i].value)\n    }\n    if (equal(testSum, this.value)) {\n      x.value = 0\n    }\n\n    ret.push(x)\n\n    return ret\n  }\n\n  const PREFIXES = {\n    NONE: {\n      '': { name: '', value: 1, scientific: true }\n    },\n    SHORT: {\n      '': { name: '', value: 1, scientific: true },\n\n      da: { name: 'da', value: 1e1, scientific: false },\n      h: { name: 'h', value: 1e2, scientific: false },\n      k: { name: 'k', value: 1e3, scientific: true },\n      M: { name: 'M', value: 1e6, scientific: true },\n      G: { name: 'G', value: 1e9, scientific: true },\n      T: { name: 'T', value: 1e12, scientific: true },\n      P: { name: 'P', value: 1e15, scientific: true },\n      E: { name: 'E', value: 1e18, scientific: true },\n      Z: { name: 'Z', value: 1e21, scientific: true },\n      Y: { name: 'Y', value: 1e24, scientific: true },\n\n      d: { name: 'd', value: 1e-1, scientific: false },\n      c: { name: 'c', value: 1e-2, scientific: false },\n      m: { name: 'm', value: 1e-3, scientific: true },\n      u: { name: 'u', value: 1e-6, scientific: true },\n      n: { name: 'n', value: 1e-9, scientific: true },\n      p: { name: 'p', value: 1e-12, scientific: true },\n      f: { name: 'f', value: 1e-15, scientific: true },\n      a: { name: 'a', value: 1e-18, scientific: true },\n      z: { name: 'z', value: 1e-21, scientific: true },\n      y: { name: 'y', value: 1e-24, scientific: true }\n    },\n    LONG: {\n      '': { name: '', value: 1, scientific: true },\n\n      deca: { name: 'deca', value: 1e1, scientific: false },\n      hecto: { name: 'hecto', value: 1e2, scientific: false },\n      kilo: { name: 'kilo', value: 1e3, scientific: true },\n      mega: { name: 'mega', value: 1e6, scientific: true },\n      giga: { name: 'giga', value: 1e9, scientific: true },\n      tera: { name: 'tera', value: 1e12, scientific: true },\n      peta: { name: 'peta', value: 1e15, scientific: true },\n      exa: { name: 'exa', value: 1e18, scientific: true },\n      zetta: { name: 'zetta', value: 1e21, scientific: true },\n      yotta: { name: 'yotta', value: 1e24, scientific: true },\n\n      deci: { name: 'deci', value: 1e-1, scientific: false },\n      centi: { name: 'centi', value: 1e-2, scientific: false },\n      milli: { name: 'milli', value: 1e-3, scientific: true },\n      micro: { name: 'micro', value: 1e-6, scientific: true },\n      nano: { name: 'nano', value: 1e-9, scientific: true },\n      pico: { name: 'pico', value: 1e-12, scientific: true },\n      femto: { name: 'femto', value: 1e-15, scientific: true },\n      atto: { name: 'atto', value: 1e-18, scientific: true },\n      zepto: { name: 'zepto', value: 1e-21, scientific: true },\n      yocto: { name: 'yocto', value: 1e-24, scientific: true }\n    },\n    SQUARED: {\n      '': { name: '', value: 1, scientific: true },\n\n      da: { name: 'da', value: 1e2, scientific: false },\n      h: { name: 'h', value: 1e4, scientific: false },\n      k: { name: 'k', value: 1e6, scientific: true },\n      M: { name: 'M', value: 1e12, scientific: true },\n      G: { name: 'G', value: 1e18, scientific: true },\n      T: { name: 'T', value: 1e24, scientific: true },\n      P: { name: 'P', value: 1e30, scientific: true },\n      E: { name: 'E', value: 1e36, scientific: true },\n      Z: { name: 'Z', value: 1e42, scientific: true },\n      Y: { name: 'Y', value: 1e48, scientific: true },\n\n      d: { name: 'd', value: 1e-2, scientific: false },\n      c: { name: 'c', value: 1e-4, scientific: false },\n      m: { name: 'm', value: 1e-6, scientific: true },\n      u: { name: 'u', value: 1e-12, scientific: true },\n      n: { name: 'n', value: 1e-18, scientific: true },\n      p: { name: 'p', value: 1e-24, scientific: true },\n      f: { name: 'f', value: 1e-30, scientific: true },\n      a: { name: 'a', value: 1e-36, scientific: true },\n      z: { name: 'z', value: 1e-42, scientific: true },\n      y: { name: 'y', value: 1e-48, scientific: true }\n    },\n    CUBIC: {\n      '': { name: '', value: 1, scientific: true },\n\n      da: { name: 'da', value: 1e3, scientific: false },\n      h: { name: 'h', value: 1e6, scientific: false },\n      k: { name: 'k', value: 1e9, scientific: true },\n      M: { name: 'M', value: 1e18, scientific: true },\n      G: { name: 'G', value: 1e27, scientific: true },\n      T: { name: 'T', value: 1e36, scientific: true },\n      P: { name: 'P', value: 1e45, scientific: true },\n      E: { name: 'E', value: 1e54, scientific: true },\n      Z: { name: 'Z', value: 1e63, scientific: true },\n      Y: { name: 'Y', value: 1e72, scientific: true },\n\n      d: { name: 'd', value: 1e-3, scientific: false },\n      c: { name: 'c', value: 1e-6, scientific: false },\n      m: { name: 'm', value: 1e-9, scientific: true },\n      u: { name: 'u', value: 1e-18, scientific: true },\n      n: { name: 'n', value: 1e-27, scientific: true },\n      p: { name: 'p', value: 1e-36, scientific: true },\n      f: { name: 'f', value: 1e-45, scientific: true },\n      a: { name: 'a', value: 1e-54, scientific: true },\n      z: { name: 'z', value: 1e-63, scientific: true },\n      y: { name: 'y', value: 1e-72, scientific: true }\n    },\n    BINARY_SHORT_SI: {\n      '': { name: '', value: 1, scientific: true },\n      k: { name: 'k', value: 1e3, scientific: true },\n      M: { name: 'M', value: 1e6, scientific: true },\n      G: { name: 'G', value: 1e9, scientific: true },\n      T: { name: 'T', value: 1e12, scientific: true },\n      P: { name: 'P', value: 1e15, scientific: true },\n      E: { name: 'E', value: 1e18, scientific: true },\n      Z: { name: 'Z', value: 1e21, scientific: true },\n      Y: { name: 'Y', value: 1e24, scientific: true }\n    },\n    BINARY_SHORT_IEC: {\n      '': { name: '', value: 1, scientific: true },\n      Ki: { name: 'Ki', value: 1024, scientific: true },\n      Mi: { name: 'Mi', value: Math.pow(1024, 2), scientific: true },\n      Gi: { name: 'Gi', value: Math.pow(1024, 3), scientific: true },\n      Ti: { name: 'Ti', value: Math.pow(1024, 4), scientific: true },\n      Pi: { name: 'Pi', value: Math.pow(1024, 5), scientific: true },\n      Ei: { name: 'Ei', value: Math.pow(1024, 6), scientific: true },\n      Zi: { name: 'Zi', value: Math.pow(1024, 7), scientific: true },\n      Yi: { name: 'Yi', value: Math.pow(1024, 8), scientific: true }\n    },\n    BINARY_LONG_SI: {\n      '': { name: '', value: 1, scientific: true },\n      kilo: { name: 'kilo', value: 1e3, scientific: true },\n      mega: { name: 'mega', value: 1e6, scientific: true },\n      giga: { name: 'giga', value: 1e9, scientific: true },\n      tera: { name: 'tera', value: 1e12, scientific: true },\n      peta: { name: 'peta', value: 1e15, scientific: true },\n      exa: { name: 'exa', value: 1e18, scientific: true },\n      zetta: { name: 'zetta', value: 1e21, scientific: true },\n      yotta: { name: 'yotta', value: 1e24, scientific: true }\n    },\n    BINARY_LONG_IEC: {\n      '': { name: '', value: 1, scientific: true },\n      kibi: { name: 'kibi', value: 1024, scientific: true },\n      mebi: { name: 'mebi', value: Math.pow(1024, 2), scientific: true },\n      gibi: { name: 'gibi', value: Math.pow(1024, 3), scientific: true },\n      tebi: { name: 'tebi', value: Math.pow(1024, 4), scientific: true },\n      pebi: { name: 'pebi', value: Math.pow(1024, 5), scientific: true },\n      exi: { name: 'exi', value: Math.pow(1024, 6), scientific: true },\n      zebi: { name: 'zebi', value: Math.pow(1024, 7), scientific: true },\n      yobi: { name: 'yobi', value: Math.pow(1024, 8), scientific: true }\n    },\n    BTU: {\n      '': { name: '', value: 1, scientific: true },\n      MM: { name: 'MM', value: 1e6, scientific: true }\n    }\n  }\n\n  PREFIXES.SHORTLONG = Object.assign({}, PREFIXES.SHORT, PREFIXES.LONG)\n  PREFIXES.BINARY_SHORT = Object.assign({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC)\n  PREFIXES.BINARY_LONG = Object.assign({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC)\n\n  /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:\n   * Index  Dimension\n   * -----  ---------\n   *   0    Length\n   *   1    Mass\n   *   2    Time\n   *   3    Current\n   *   4    Temperature\n   *   5    Luminous intensity\n   *   6    Amount of substance\n   *   7    Angle\n   *   8    Bit (digital)\n   * For example, the unit \"298.15 K\" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit \"1 cal / (gm °C)\" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].\n   *\n   */\n\n  const BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT']\n\n  const BASE_UNITS = {\n    NONE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]\n    },\n    MASS: {\n      dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]\n    },\n    LENGTH: {\n      dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]\n    },\n    TIME: {\n      dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]\n    },\n    CURRENT: {\n      dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]\n    },\n    TEMPERATURE: {\n      dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]\n    },\n    LUMINOUS_INTENSITY: {\n      dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]\n    },\n    AMOUNT_OF_SUBSTANCE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]\n    },\n\n    FORCE: {\n      dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]\n    },\n    SURFACE: {\n      dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]\n    },\n    VOLUME: {\n      dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]\n    },\n    ENERGY: {\n      dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]\n    },\n    POWER: {\n      dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]\n    },\n    PRESSURE: {\n      dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]\n    },\n\n    ELECTRIC_CHARGE: {\n      dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_CAPACITANCE: {\n      dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_POTENTIAL: {\n      dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_RESISTANCE: {\n      dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_INDUCTANCE: {\n      dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_CONDUCTANCE: {\n      dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]\n    },\n    MAGNETIC_FLUX: {\n      dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]\n    },\n    MAGNETIC_FLUX_DENSITY: {\n      dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]\n    },\n\n    FREQUENCY: {\n      dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]\n    },\n    ANGLE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]\n    },\n    BIT: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]\n    }\n  }\n\n  for (const key in BASE_UNITS) {\n    if (hasOwnProperty(BASE_UNITS, key)) {\n      BASE_UNITS[key].key = key\n    }\n  }\n\n  const BASE_UNIT_NONE = {}\n\n  const UNIT_NONE = { name: '', base: BASE_UNIT_NONE, value: 1, offset: 0, dimensions: BASE_DIMENSIONS.map(x => 0) }\n\n  const UNITS = {\n    // length\n    meter: {\n      name: 'meter',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    inch: {\n      name: 'inch',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0254,\n      offset: 0\n    },\n    foot: {\n      name: 'foot',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.3048,\n      offset: 0\n    },\n    yard: {\n      name: 'yard',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.9144,\n      offset: 0\n    },\n    mile: {\n      name: 'mile',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1609.344,\n      offset: 0\n    },\n    link: {\n      name: 'link',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.201168,\n      offset: 0\n    },\n    rod: {\n      name: 'rod',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 5.0292,\n      offset: 0\n    },\n    chain: {\n      name: 'chain',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 20.1168,\n      offset: 0\n    },\n    angstrom: {\n      name: 'angstrom',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1e-10,\n      offset: 0\n    },\n\n    m: {\n      name: 'm',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    in: {\n      name: 'in',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0254,\n      offset: 0\n    },\n    ft: {\n      name: 'ft',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.3048,\n      offset: 0\n    },\n    yd: {\n      name: 'yd',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.9144,\n      offset: 0\n    },\n    mi: {\n      name: 'mi',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1609.344,\n      offset: 0\n    },\n    li: {\n      name: 'li',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.201168,\n      offset: 0\n    },\n    rd: {\n      name: 'rd',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 5.029210,\n      offset: 0\n    },\n    ch: {\n      name: 'ch',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 20.1168,\n      offset: 0\n    },\n    mil: {\n      name: 'mil',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000254,\n      offset: 0\n    }, // 1/1000 inch\n\n    // Surface\n    m2: {\n      name: 'm2',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.SQUARED,\n      value: 1,\n      offset: 0\n    },\n    sqin: {\n      name: 'sqin',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.00064516,\n      offset: 0\n    }, // 645.16 mm2\n    sqft: {\n      name: 'sqft',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.09290304,\n      offset: 0\n    }, // 0.09290304 m2\n    sqyd: {\n      name: 'sqyd',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.83612736,\n      offset: 0\n    }, // 0.83612736 m2\n    sqmi: {\n      name: 'sqmi',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 2589988.110336,\n      offset: 0\n    }, // 2.589988110336 km2\n    sqrd: {\n      name: 'sqrd',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 25.29295,\n      offset: 0\n    }, // 25.29295 m2\n    sqch: {\n      name: 'sqch',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 404.6873,\n      offset: 0\n    }, // 404.6873 m2\n    sqmil: {\n      name: 'sqmil',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 6.4516e-10,\n      offset: 0\n    }, // 6.4516 * 10^-10 m2\n    acre: {\n      name: 'acre',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 4046.86,\n      offset: 0\n    }, // 4046.86 m2\n    hectare: {\n      name: 'hectare',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 10000,\n      offset: 0\n    }, // 10000 m2\n\n    // Volume\n    m3: {\n      name: 'm3',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.CUBIC,\n      value: 1,\n      offset: 0\n    },\n    L: {\n      name: 'L',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    }, // litre\n    l: {\n      name: 'l',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    }, // litre\n    litre: {\n      name: 'litre',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.LONG,\n      value: 0.001,\n      offset: 0\n    },\n    cuin: {\n      name: 'cuin',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 1.6387064e-5,\n      offset: 0\n    }, // 1.6387064e-5 m3\n    cuft: {\n      name: 'cuft',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.028316846592,\n      offset: 0\n    }, // 28.316 846 592 L\n    cuyd: {\n      name: 'cuyd',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.764554857984,\n      offset: 0\n    }, // 764.554 857 984 L\n    teaspoon: {\n      name: 'teaspoon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000005,\n      offset: 0\n    }, // 5 mL\n    tablespoon: {\n      name: 'tablespoon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000015,\n      offset: 0\n    }, // 15 mL\n    // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL  // not possible, we have already another cup\n    drop: {\n      name: 'drop',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 5e-8,\n      offset: 0\n    }, // 0.05 mL = 5e-8 m3\n    gtt: {\n      name: 'gtt',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 5e-8,\n      offset: 0\n    }, // 0.05 mL = 5e-8 m3\n\n    // Liquid volume\n    minim: {\n      name: 'minim',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00000006161152,\n      offset: 0\n    }, // 0.06161152 mL\n    fluiddram: {\n      name: 'fluiddram',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000036966911,\n      offset: 0\n    }, // 3.696691 mL\n    fluidounce: {\n      name: 'fluidounce',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00002957353,\n      offset: 0\n    }, // 29.57353 mL\n    gill: {\n      name: 'gill',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0001182941,\n      offset: 0\n    }, // 118.2941 mL\n    cc: {\n      name: 'cc',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 1e-6,\n      offset: 0\n    }, // 1e-6 L\n    cup: {\n      name: 'cup',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0002365882,\n      offset: 0\n    }, // 236.5882 mL\n    pint: {\n      name: 'pint',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0004731765,\n      offset: 0\n    }, // 473.1765 mL\n    quart: {\n      name: 'quart',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0009463529,\n      offset: 0\n    }, // 946.3529 mL\n    gallon: {\n      name: 'gallon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.003785412,\n      offset: 0\n    }, // 3.785412 L\n    beerbarrel: {\n      name: 'beerbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1173478,\n      offset: 0\n    }, // 117.3478 L\n    oilbarrel: {\n      name: 'oilbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1589873,\n      offset: 0\n    }, // 158.9873 L\n    hogshead: {\n      name: 'hogshead',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.2384810,\n      offset: 0\n    }, // 238.4810 L\n\n    // {name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute\n    fldr: {\n      name: 'fldr',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000036966911,\n      offset: 0\n    }, // 3.696691 mL\n    floz: {\n      name: 'floz',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00002957353,\n      offset: 0\n    }, // 29.57353 mL\n    gi: {\n      name: 'gi',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0001182941,\n      offset: 0\n    }, // 118.2941 mL\n    cp: {\n      name: 'cp',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0002365882,\n      offset: 0\n    }, // 236.5882 mL\n    pt: {\n      name: 'pt',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0004731765,\n      offset: 0\n    }, // 473.1765 mL\n    qt: {\n      name: 'qt',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0009463529,\n      offset: 0\n    }, // 946.3529 mL\n    gal: {\n      name: 'gal',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.003785412,\n      offset: 0\n    }, // 3.785412 L\n    bbl: {\n      name: 'bbl',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1173478,\n      offset: 0\n    }, // 117.3478 L\n    obl: {\n      name: 'obl',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1589873,\n      offset: 0\n    }, // 158.9873 L\n    // {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh?\n\n    // Mass\n    g: {\n      name: 'g',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    },\n    gram: {\n      name: 'gram',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.LONG,\n      value: 0.001,\n      offset: 0\n    },\n\n    ton: {\n      name: 'ton',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 907.18474,\n      offset: 0\n    },\n    t: {\n      name: 't',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 1000,\n      offset: 0\n    },\n    tonne: {\n      name: 'tonne',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.LONG,\n      value: 1000,\n      offset: 0\n    },\n\n    grain: {\n      name: 'grain',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 64.79891e-6,\n      offset: 0\n    },\n    dram: {\n      name: 'dram',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 1.7718451953125e-3,\n      offset: 0\n    },\n    ounce: {\n      name: 'ounce',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 28.349523125e-3,\n      offset: 0\n    },\n    poundmass: {\n      name: 'poundmass',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 453.59237e-3,\n      offset: 0\n    },\n    hundredweight: {\n      name: 'hundredweight',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 45.359237,\n      offset: 0\n    },\n    stick: {\n      name: 'stick',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 115e-3,\n      offset: 0\n    },\n    stone: {\n      name: 'stone',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 6.35029318,\n      offset: 0\n    },\n\n    gr: {\n      name: 'gr',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 64.79891e-6,\n      offset: 0\n    },\n    dr: {\n      name: 'dr',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 1.7718451953125e-3,\n      offset: 0\n    },\n    oz: {\n      name: 'oz',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 28.349523125e-3,\n      offset: 0\n    },\n    lbm: {\n      name: 'lbm',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 453.59237e-3,\n      offset: 0\n    },\n    cwt: {\n      name: 'cwt',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 45.359237,\n      offset: 0\n    },\n\n    // Time\n    s: {\n      name: 's',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    min: {\n      name: 'min',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 60,\n      offset: 0\n    },\n    h: {\n      name: 'h',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3600,\n      offset: 0\n    },\n    second: {\n      name: 'second',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    sec: {\n      name: 'sec',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    minute: {\n      name: 'minute',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 60,\n      offset: 0\n    },\n    hour: {\n      name: 'hour',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3600,\n      offset: 0\n    },\n    day: {\n      name: 'day',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 86400,\n      offset: 0\n    },\n    week: {\n      name: 'week',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 7 * 86400,\n      offset: 0\n    },\n    month: {\n      name: 'month',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 2629800, // 1/12th of Julian year\n      offset: 0\n    },\n    year: {\n      name: 'year',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600, // Julian year\n      offset: 0\n    },\n    decade: {\n      name: 'decade',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 315576000, // Julian decade\n      offset: 0\n    },\n    century: {\n      name: 'century',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3155760000, // Julian century\n      offset: 0\n    },\n    millennium: {\n      name: 'millennium',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600000, // Julian millennium\n      offset: 0\n    },\n\n    // Frequency\n    hertz: {\n      name: 'Hertz',\n      base: BASE_UNITS.FREQUENCY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0,\n      reciprocal: true\n    },\n    Hz: {\n      name: 'Hz',\n      base: BASE_UNITS.FREQUENCY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0,\n      reciprocal: true\n    },\n\n    // Angle\n    rad: {\n      name: 'rad',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    radian: {\n      name: 'radian',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888\n    deg: {\n      name: 'deg',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    degree: {\n      name: 'degree',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // grad = rad / (2*pi) * 400  = rad / 0.015707963267948966192313216916399\n    grad: {\n      name: 'grad',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    gradian: {\n      name: 'gradian',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793\n    cycle: {\n      name: 'cycle',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795\n    arcsec: {\n      name: 'arcsec',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477\n    arcmin: {\n      name: 'arcmin',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n\n    // Electric current\n    A: {\n      name: 'A',\n      base: BASE_UNITS.CURRENT,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    ampere: {\n      name: 'ampere',\n      base: BASE_UNITS.CURRENT,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n\n    // Temperature\n    // K(C) = °C + 273.15\n    // K(F) = (°F + 459.67) / 1.8\n    // K(R) = °R / 1.8\n    K: {\n      name: 'K',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 0\n    },\n    degC: {\n      name: 'degC',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 273.15\n    },\n    degF: {\n      name: 'degF',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 459.67\n    },\n    degR: {\n      name: 'degR',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 0\n    },\n    kelvin: {\n      name: 'kelvin',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 0\n    },\n    celsius: {\n      name: 'celsius',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 273.15\n    },\n    fahrenheit: {\n      name: 'fahrenheit',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 459.67\n    },\n    rankine: {\n      name: 'rankine',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 0\n    },\n\n    // amount of substance\n    mol: {\n      name: 'mol',\n      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    mole: {\n      name: 'mole',\n      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n\n    // luminous intensity\n    cd: {\n      name: 'cd',\n      base: BASE_UNITS.LUMINOUS_INTENSITY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    candela: {\n      name: 'candela',\n      base: BASE_UNITS.LUMINOUS_INTENSITY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    // TODO: units STERADIAN\n    // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n    // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n\n    // Force\n    N: {\n      name: 'N',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    newton: {\n      name: 'newton',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    dyn: {\n      name: 'dyn',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.SHORT,\n      value: 0.00001,\n      offset: 0\n    },\n    dyne: {\n      name: 'dyne',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 0.00001,\n      offset: 0\n    },\n    lbf: {\n      name: 'lbf',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 4.4482216152605,\n      offset: 0\n    },\n    poundforce: {\n      name: 'poundforce',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 4.4482216152605,\n      offset: 0\n    },\n    kip: {\n      name: 'kip',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 4448.2216,\n      offset: 0\n    },\n    kilogramforce: {\n      name: 'kilogramforce',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 9.80665,\n      offset: 0\n    },\n\n    // Energy\n    J: {\n      name: 'J',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    joule: {\n      name: 'joule',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    erg: {\n      name: 'erg',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.NONE,\n      value: 1e-7,\n      offset: 0\n    },\n    Wh: {\n      name: 'Wh',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 3600,\n      offset: 0\n    },\n    BTU: {\n      name: 'BTU',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.BTU,\n      value: 1055.05585262,\n      offset: 0\n    },\n    eV: {\n      name: 'eV',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1.602176565e-19,\n      offset: 0\n    },\n    electronvolt: {\n      name: 'electronvolt',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.LONG,\n      value: 1.602176565e-19,\n      offset: 0\n    },\n\n    // Power\n    W: {\n      name: 'W',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    watt: {\n      name: 'watt',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    hp: {\n      name: 'hp',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.NONE,\n      value: 745.6998715386,\n      offset: 0\n    },\n\n    // Electrical power units\n    VAR: {\n      name: 'VAR',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: Complex.I,\n      offset: 0\n    },\n\n    VA: {\n      name: 'VA',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n\n    // Pressure\n    Pa: {\n      name: 'Pa',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    psi: {\n      name: 'psi',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 6894.75729276459,\n      offset: 0\n    },\n    atm: {\n      name: 'atm',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 101325,\n      offset: 0\n    },\n    bar: {\n      name: 'bar',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.SHORTLONG,\n      value: 100000,\n      offset: 0\n    },\n    torr: {\n      name: 'torr',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 133.322,\n      offset: 0\n    },\n    mmHg: {\n      name: 'mmHg',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 133.322,\n      offset: 0\n    },\n    mmH2O: {\n      name: 'mmH2O',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 9.80665,\n      offset: 0\n    },\n    cmH2O: {\n      name: 'cmH2O',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 98.0665,\n      offset: 0\n    },\n\n    // Electric charge\n    coulomb: {\n      name: 'coulomb',\n      base: BASE_UNITS.ELECTRIC_CHARGE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    C: {\n      name: 'C',\n      base: BASE_UNITS.ELECTRIC_CHARGE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric capacitance\n    farad: {\n      name: 'farad',\n      base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    F: {\n      name: 'F',\n      base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric potential\n    volt: {\n      name: 'volt',\n      base: BASE_UNITS.ELECTRIC_POTENTIAL,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    V: {\n      name: 'V',\n      base: BASE_UNITS.ELECTRIC_POTENTIAL,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric resistance\n    ohm: {\n      name: 'ohm',\n      base: BASE_UNITS.ELECTRIC_RESISTANCE,\n      prefixes: PREFIXES.SHORTLONG, // Both Mohm and megaohm are acceptable\n      value: 1,\n      offset: 0\n    },\n    /*\n     * Unicode breaks in browsers if charset is not specified\n    Ω: {\n      name: 'Ω',\n      base: BASE_UNITS.ELECTRIC_RESISTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    */\n    // Electric inductance\n    henry: {\n      name: 'henry',\n      base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    H: {\n      name: 'H',\n      base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric conductance\n    siemens: {\n      name: 'siemens',\n      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    S: {\n      name: 'S',\n      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Magnetic flux\n    weber: {\n      name: 'weber',\n      base: BASE_UNITS.MAGNETIC_FLUX,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    Wb: {\n      name: 'Wb',\n      base: BASE_UNITS.MAGNETIC_FLUX,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Magnetic flux density\n    tesla: {\n      name: 'tesla',\n      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    T: {\n      name: 'T',\n      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n\n    // Binary\n    b: {\n      name: 'b',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_SHORT,\n      value: 1,\n      offset: 0\n    },\n    bits: {\n      name: 'bits',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_LONG,\n      value: 1,\n      offset: 0\n    },\n    B: {\n      name: 'B',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_SHORT,\n      value: 8,\n      offset: 0\n    },\n    bytes: {\n      name: 'bytes',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_LONG,\n      value: 8,\n      offset: 0\n    }\n  }\n\n  // aliases (formerly plurals)\n  const ALIASES = {\n    meters: 'meter',\n    inches: 'inch',\n    feet: 'foot',\n    yards: 'yard',\n    miles: 'mile',\n    links: 'link',\n    rods: 'rod',\n    chains: 'chain',\n    angstroms: 'angstrom',\n\n    lt: 'l',\n    litres: 'litre',\n    liter: 'litre',\n    liters: 'litre',\n    teaspoons: 'teaspoon',\n    tablespoons: 'tablespoon',\n    minims: 'minim',\n    fluiddrams: 'fluiddram',\n    fluidounces: 'fluidounce',\n    gills: 'gill',\n    cups: 'cup',\n    pints: 'pint',\n    quarts: 'quart',\n    gallons: 'gallon',\n    beerbarrels: 'beerbarrel',\n    oilbarrels: 'oilbarrel',\n    hogsheads: 'hogshead',\n    gtts: 'gtt',\n\n    grams: 'gram',\n    tons: 'ton',\n    tonnes: 'tonne',\n    grains: 'grain',\n    drams: 'dram',\n    ounces: 'ounce',\n    poundmasses: 'poundmass',\n    hundredweights: 'hundredweight',\n    sticks: 'stick',\n    lb: 'lbm',\n    lbs: 'lbm',\n\n    kips: 'kip',\n    kgf: 'kilogramforce',\n\n    acres: 'acre',\n    hectares: 'hectare',\n    sqfeet: 'sqft',\n    sqyard: 'sqyd',\n    sqmile: 'sqmi',\n    sqmiles: 'sqmi',\n\n    mmhg: 'mmHg',\n    mmh2o: 'mmH2O',\n    cmh2o: 'cmH2O',\n\n    seconds: 'second',\n    secs: 'second',\n    minutes: 'minute',\n    mins: 'minute',\n    hours: 'hour',\n    hr: 'hour',\n    hrs: 'hour',\n    days: 'day',\n    weeks: 'week',\n    months: 'month',\n    years: 'year',\n    decades: 'decade',\n    centuries: 'century',\n    millennia: 'millennium',\n\n    hertz: 'hertz',\n\n    radians: 'radian',\n    degrees: 'degree',\n    gradians: 'gradian',\n    cycles: 'cycle',\n    arcsecond: 'arcsec',\n    arcseconds: 'arcsec',\n    arcminute: 'arcmin',\n    arcminutes: 'arcmin',\n\n    BTUs: 'BTU',\n    watts: 'watt',\n    joules: 'joule',\n\n    amperes: 'ampere',\n    coulombs: 'coulomb',\n    volts: 'volt',\n    ohms: 'ohm',\n    farads: 'farad',\n    webers: 'weber',\n    teslas: 'tesla',\n    electronvolts: 'electronvolt',\n    moles: 'mole',\n\n    bit: 'bits',\n    byte: 'bytes'\n  }\n\n  /**\n   * Calculate the values for the angle units.\n   * Value is calculated as number or BigNumber depending on the configuration\n   * @param {{number: 'number' | 'BigNumber'}} config\n   */\n  function calculateAngleValues (config) {\n    if (config.number === 'BigNumber') {\n      const pi = createPi(BigNumber)\n      UNITS.rad.value = new BigNumber(1)\n      UNITS.deg.value = pi.div(180) // 2 * pi / 360\n      UNITS.grad.value = pi.div(200) // 2 * pi / 400\n      UNITS.cycle.value = pi.times(2) // 2 * pi\n      UNITS.arcsec.value = pi.div(648000) // 2 * pi / 360 / 3600\n      UNITS.arcmin.value = pi.div(10800) // 2 * pi / 360 / 60\n    } else { // number\n      UNITS.rad.value = 1\n      UNITS.deg.value = Math.PI / 180 // 2 * pi / 360\n      UNITS.grad.value = Math.PI / 200 // 2 * pi / 400\n      UNITS.cycle.value = Math.PI * 2 // 2 * pi\n      UNITS.arcsec.value = Math.PI / 648000 // 2 * pi / 360 / 3600\n      UNITS.arcmin.value = Math.PI / 10800 // 2 * pi / 360 / 60\n    }\n\n    // copy to the full names of the angles\n    UNITS.radian.value = UNITS.rad.value\n    UNITS.degree.value = UNITS.deg.value\n    UNITS.gradian.value = UNITS.grad.value\n  }\n\n  // apply the angle values now\n  calculateAngleValues(config)\n\n  if (on) {\n    // recalculate the values on change of configuration\n    on('config', function (curr, prev) {\n      if (curr.number !== prev.number) {\n        calculateAngleValues(curr)\n      }\n    })\n  }\n\n  /**\n   * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.\n   * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).\n   * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.\n   */\n  const UNIT_SYSTEMS = {\n    si: {\n      // Base units\n      NONE: { unit: UNIT_NONE, prefix: PREFIXES.NONE[''] },\n      LENGTH: { unit: UNITS.m, prefix: PREFIXES.SHORT[''] },\n      MASS: { unit: UNITS.g, prefix: PREFIXES.SHORT.k },\n      TIME: { unit: UNITS.s, prefix: PREFIXES.SHORT[''] },\n      CURRENT: { unit: UNITS.A, prefix: PREFIXES.SHORT[''] },\n      TEMPERATURE: { unit: UNITS.K, prefix: PREFIXES.SHORT[''] },\n      LUMINOUS_INTENSITY: { unit: UNITS.cd, prefix: PREFIXES.SHORT[''] },\n      AMOUNT_OF_SUBSTANCE: { unit: UNITS.mol, prefix: PREFIXES.SHORT[''] },\n      ANGLE: { unit: UNITS.rad, prefix: PREFIXES.SHORT[''] },\n      BIT: { unit: UNITS.bits, prefix: PREFIXES.SHORT[''] },\n\n      // Derived units\n      FORCE: { unit: UNITS.N, prefix: PREFIXES.SHORT[''] },\n      ENERGY: { unit: UNITS.J, prefix: PREFIXES.SHORT[''] },\n      POWER: { unit: UNITS.W, prefix: PREFIXES.SHORT[''] },\n      PRESSURE: { unit: UNITS.Pa, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_CHARGE: { unit: UNITS.C, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_CAPACITANCE: { unit: UNITS.F, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_POTENTIAL: { unit: UNITS.V, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_RESISTANCE: { unit: UNITS.ohm, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_INDUCTANCE: { unit: UNITS.H, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_CONDUCTANCE: { unit: UNITS.S, prefix: PREFIXES.SHORT[''] },\n      MAGNETIC_FLUX: { unit: UNITS.Wb, prefix: PREFIXES.SHORT[''] },\n      MAGNETIC_FLUX_DENSITY: { unit: UNITS.T, prefix: PREFIXES.SHORT[''] },\n      FREQUENCY: { unit: UNITS.Hz, prefix: PREFIXES.SHORT[''] }\n    }\n  }\n\n  // Clone to create the other unit systems\n  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si))\n  UNIT_SYSTEMS.cgs.LENGTH = { unit: UNITS.m, prefix: PREFIXES.SHORT.c }\n  UNIT_SYSTEMS.cgs.MASS = { unit: UNITS.g, prefix: PREFIXES.SHORT[''] }\n  UNIT_SYSTEMS.cgs.FORCE = { unit: UNITS.dyn, prefix: PREFIXES.SHORT[''] }\n  UNIT_SYSTEMS.cgs.ENERGY = { unit: UNITS.erg, prefix: PREFIXES.NONE[''] }\n  // there are wholly 4 unique cgs systems for electricity and magnetism,\n  // so let's not worry about it unless somebody complains\n\n  UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si))\n  UNIT_SYSTEMS.us.LENGTH = { unit: UNITS.ft, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.MASS = { unit: UNITS.lbm, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.TEMPERATURE = { unit: UNITS.degF, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.FORCE = { unit: UNITS.lbf, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.ENERGY = { unit: UNITS.BTU, prefix: PREFIXES.BTU[''] }\n  UNIT_SYSTEMS.us.POWER = { unit: UNITS.hp, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.PRESSURE = { unit: UNITS.psi, prefix: PREFIXES.NONE[''] }\n\n  // Add additional unit systems here.\n\n  // Choose a unit system to seed the auto unit system.\n  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si))\n\n  // Set the current unit system\n  let currentUnitSystem = UNIT_SYSTEMS.auto\n\n  /**\n   * Set a unit system for formatting derived units.\n   * @param {string} [name] The name of the unit system.\n   */\n  Unit.setUnitSystem = function (name) {\n    if (hasOwnProperty(UNIT_SYSTEMS, name)) {\n      currentUnitSystem = UNIT_SYSTEMS[name]\n    } else {\n      throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '))\n    }\n  }\n\n  /**\n   * Return the current unit system.\n   * @return {string} The current unit system.\n   */\n  Unit.getUnitSystem = function () {\n    for (const key in UNIT_SYSTEMS) {\n      if (hasOwnProperty(UNIT_SYSTEMS, key)) {\n        if (UNIT_SYSTEMS[key] === currentUnitSystem) {\n          return key\n        }\n      }\n    }\n  }\n\n  /**\n   * Converters to convert from number to an other numeric type like BigNumber\n   * or Fraction\n   */\n  Unit.typeConverters = {\n    BigNumber: function (x) {\n      return new BigNumber(x + '') // stringify to prevent constructor error\n    },\n\n    Fraction: function (x) {\n      return new Fraction(x)\n    },\n\n    Complex: function (x) {\n      return x\n    },\n\n    number: function (x) {\n      return x\n    }\n  }\n\n  /**\n   * Retrieve the right convertor function corresponding with the type\n   * of provided exampleValue.\n   *\n   * @param {string} type   A string 'number', 'BigNumber', or 'Fraction'\n   *                        In case of an unknown type,\n   * @return {Function}\n   */\n  Unit._getNumberConverter = function (type) {\n    if (!Unit.typeConverters[type]) {\n      throw new TypeError('Unsupported type \"' + type + '\"')\n    }\n\n    return Unit.typeConverters[type]\n  }\n\n  // Add dimensions to each built-in unit\n  for (const key in UNITS) {\n    if (hasOwnProperty(UNITS, key)) {\n      const unit = UNITS[key]\n      unit.dimensions = unit.base.dimensions\n    }\n  }\n\n  // Create aliases\n  for (const name in ALIASES) {\n    if (hasOwnProperty(ALIASES, name)) {\n      const unit = UNITS[ALIASES[name]]\n      const alias = {}\n      for (const key in unit) {\n        if (hasOwnProperty(unit, key)) {\n          alias[key] = unit[key]\n        }\n      }\n      alias.name = name\n      UNITS[name] = alias\n    }\n  }\n\n  /**\n   * Checks if a character is a valid latin letter (upper or lower case).\n   * Note that this function can be overridden, for example to allow support of other alphabets.\n   * @param {string} c Tested character\n   */\n  Unit.isValidAlpha = function isValidAlpha (c) {\n    return /^[a-zA-Z]$/.test(c)\n  }\n\n  function assertUnitNameIsValid (name) {\n    for (let i = 0; i < name.length; i++) {\n      c = name.charAt(i)\n\n      if (i === 0 && !Unit.isValidAlpha(c)) { throw new Error('Invalid unit name (must begin with alpha character): \"' + name + '\"') }\n\n      if (i > 0 && !(Unit.isValidAlpha(c) ||\n        isDigit(c))) { throw new Error('Invalid unit name (only alphanumeric characters are allowed): \"' + name + '\"') }\n    }\n  }\n\n  /**\n   * Wrapper around createUnitSingle.\n   * Example:\n   *  createUnit({\n   *    foo: { },\n   *    bar: {\n   *      definition: 'kg/foo',\n   *      aliases: ['ba', 'barr', 'bars'],\n   *      offset: 200\n   *    },\n   *    baz: '4 bar'\n   *  },\n   *  {\n   *    override: true\n   *  })\n   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.\n   * @param {object} options\n   */\n  Unit.createUnit = function (obj, options) {\n    if (typeof (obj) !== 'object') {\n      throw new TypeError(\"createUnit expects first parameter to be of type 'Object'\")\n    }\n\n    // Remove all units and aliases we are overriding\n    if (options && options.override) {\n      for (const key in obj) {\n        if (hasOwnProperty(obj, key)) {\n          Unit.deleteUnit(key)\n        }\n        if (obj[key].aliases) {\n          for (let i = 0; i < obj[key].aliases.length; i++) {\n            Unit.deleteUnit(obj[key].aliases[i])\n          }\n        }\n      }\n    }\n\n    // TODO: traverse multiple times until all units have been added\n    let lastUnit\n    for (const key in obj) {\n      if (hasOwnProperty(obj, key)) {\n        lastUnit = Unit.createUnitSingle(key, obj[key])\n      }\n    }\n    return lastUnit\n  }\n\n  /**\n   * Create a user-defined unit and register it with the Unit type.\n   * Example:\n   *  createUnitSingle('knot', '0.514444444 m/s')\n   *  createUnitSingle('acre', new Unit(43560, 'ft^2'))\n   *\n   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'\n   * @param {string, Unit, Object} definition      Definition of the unit in terms\n   * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,\n   * or an Object. If an Object, may have the following properties:\n   *   - definition {string|Unit} The definition of this unit.\n   *   - prefixes {string} \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\".\n   *     The default is \"none\".\n   *   - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']\n   *   - offset {Numeric} An offset to apply when converting from the unit. For\n   *     example, the offset for celsius is 273.15 and the offset for farhenheit\n   *     is 459.67. Default is 0.\n   *   - baseName {string} If the unit's dimension does not match that of any other\n   *     base unit, the name of the newly create base unit. Otherwise, this property\n   *     has no effect.\n   *\n   * @param {Object} options   (optional) An object containing any of the following\n   * properties:\n   *   - override {boolean} Whether this unit should be allowed to override existing\n   *     units.\n   *\n   * @return {Unit}\n   */\n  Unit.createUnitSingle = function (name, obj, options) {\n    if (typeof (obj) === 'undefined' || obj === null) {\n      obj = {}\n    }\n\n    if (typeof (name) !== 'string') {\n      throw new TypeError(\"createUnitSingle expects first parameter to be of type 'string'\")\n    }\n\n    // Check collisions with existing units\n    if (hasOwnProperty(UNITS, name)) {\n      throw new Error('Cannot create unit \"' + name + '\": a unit with that name already exists')\n    }\n\n    // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.\n\n    assertUnitNameIsValid(name)\n\n    let defUnit = null // The Unit from which the new unit will be created.\n    let aliases = []\n    let offset = 0\n    let definition\n    let prefixes\n    let baseName\n    if (obj && obj.type === 'Unit') {\n      defUnit = obj.clone()\n    } else if (typeof (obj) === 'string') {\n      if (obj !== '') {\n        definition = obj\n      }\n    } else if (typeof (obj) === 'object') {\n      definition = obj.definition\n      prefixes = obj.prefixes\n      offset = obj.offset\n      baseName = obj.baseName\n      if (obj.aliases) {\n        aliases = obj.aliases.valueOf() // aliases could be a Matrix, so convert to Array\n      }\n    } else {\n      throw new TypeError('Cannot create unit \"' + name + '\" from \"' + obj.toString() + '\": expecting \"string\" or \"Unit\" or \"Object\"')\n    }\n\n    if (aliases) {\n      for (let i = 0; i < aliases.length; i++) {\n        if (hasOwnProperty(UNITS, aliases[i])) {\n          throw new Error('Cannot create alias \"' + aliases[i] + '\": a unit with that name already exists')\n        }\n      }\n    }\n\n    if (definition && typeof (definition) === 'string' && !defUnit) {\n      try {\n        defUnit = Unit.parse(definition, { allowNoUnits: true })\n      } catch (ex) {\n        ex.message = 'Could not create unit \"' + name + '\" from \"' + definition + '\": ' + ex.message\n        throw (ex)\n      }\n    } else if (definition && definition.type === 'Unit') {\n      defUnit = definition.clone()\n    }\n\n    aliases = aliases || []\n    offset = offset || 0\n    if (prefixes && prefixes.toUpperCase) { prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE } else { prefixes = PREFIXES.NONE }\n\n    // If defUnit is null, it is because the user did not\n    // specify a defintion. So create a new base dimension.\n    let newUnit = {}\n    if (!defUnit) {\n      // Add a new base dimension\n      baseName = baseName || name + '_STUFF' // foo --> foo_STUFF, or the essence of foo\n      if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {\n        throw new Error('Cannot create new base unit \"' + name + '\": a base unit with that name already exists (and cannot be overridden)')\n      }\n      BASE_DIMENSIONS.push(baseName)\n\n      // Push 0 onto existing base units\n      for (const b in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, b)) {\n          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0\n        }\n      }\n\n      // Add the new base unit\n      const newBaseUnit = { dimensions: [] }\n      for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n        newBaseUnit.dimensions[i] = 0\n      }\n      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1\n      newBaseUnit.key = baseName\n      BASE_UNITS[baseName] = newBaseUnit\n\n      newUnit = {\n        name: name,\n        value: 1,\n        dimensions: BASE_UNITS[baseName].dimensions.slice(0),\n        prefixes: prefixes,\n        offset: offset,\n        base: BASE_UNITS[baseName]\n      }\n\n      currentUnitSystem[baseName] = {\n        unit: newUnit,\n        prefix: PREFIXES.NONE['']\n      }\n    } else {\n      newUnit = {\n        name: name,\n        value: defUnit.value,\n        dimensions: defUnit.dimensions.slice(0),\n        prefixes: prefixes,\n        offset: offset\n      }\n\n      // Create a new base if no matching base exists\n      let anyMatch = false\n      for (const i in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, i)) {\n          let match = true\n          for (let j = 0; j < BASE_DIMENSIONS.length; j++) {\n            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[i].dimensions[j] || 0)) > 1e-12) {\n              match = false\n              break\n            }\n          }\n          if (match) {\n            anyMatch = true\n            newUnit.base = BASE_UNITS[i]\n            break\n          }\n        }\n      }\n      if (!anyMatch) {\n        baseName = baseName || name + '_STUFF' // foo --> foo_STUFF, or the essence of foo\n        // Add the new base unit\n        const newBaseUnit = { dimensions: defUnit.dimensions.slice(0) }\n        newBaseUnit.key = baseName\n        BASE_UNITS[baseName] = newBaseUnit\n\n        currentUnitSystem[baseName] = {\n          unit: newUnit,\n          prefix: PREFIXES.NONE['']\n        }\n\n        newUnit.base = BASE_UNITS[baseName]\n      }\n    }\n\n    Unit.UNITS[name] = newUnit\n\n    for (let i = 0; i < aliases.length; i++) {\n      const aliasName = aliases[i]\n      const alias = {}\n      for (const key in newUnit) {\n        if (hasOwnProperty(newUnit, key)) {\n          alias[key] = newUnit[key]\n        }\n      }\n      alias.name = aliasName\n      Unit.UNITS[aliasName] = alias\n    }\n    // delete the memoization cache, since adding a new unit to the array\n    // invalidates all old results\n    delete _findUnit.cache\n\n    return new Unit(null, name)\n  }\n\n  Unit.deleteUnit = function (name) {\n    delete Unit.UNITS[name]\n  }\n\n  // expose arrays with prefixes, dimensions, units, systems\n  Unit.PREFIXES = PREFIXES\n  Unit.BASE_DIMENSIONS = BASE_DIMENSIONS\n  Unit.BASE_UNITS = BASE_UNITS\n  Unit.UNIT_SYSTEMS = UNIT_SYSTEMS\n  Unit.UNITS = UNITS\n\n  return Unit\n}, { isClass: true })\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'unit'\nconst dependencies = ['typed', 'Unit']\n\n// This function is named createUnitFunction to prevent a naming conflict with createUnit\nexport const createUnitFunction = /* #__PURE__ */ factory(name, dependencies, ({ typed, Unit }) => {\n  /**\n   * Create a unit. Depending on the passed arguments, the function\n   * will create and return a new math.Unit object.\n   * When a matrix is provided, all elements will be converted to units.\n   *\n   * Syntax:\n   *\n   *     math.unit(unit : string)\n   *     math.unit(value : number, unit : string)\n   *\n   * Examples:\n   *\n   *    const a = math.unit(5, 'cm')    // returns Unit 50 mm\n   *    const b = math.unit('23 kg')    // returns Unit 23 kg\n   *    a.to('m')                       // returns Unit 0.05 m\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, number, string, createUnit\n   *\n   * @param {* | Array | Matrix} args   A number and unit.\n   * @return {Unit | Array | Matrix}    The created unit\n   */\n\n  return typed(name, {\n    Unit: function (x) {\n      return x.clone()\n    },\n\n    string: function (x) {\n      if (Unit.isValuelessUnit(x)) {\n        return new Unit(null, x) // a pure unit\n      }\n\n      return Unit.parse(x, { allowNoUnits: true }) // a unit with value, like '5cm'\n    },\n\n    'number | BigNumber | Fraction | Complex, string': function (value, unit) {\n      return new Unit(value, unit)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'sparse'\nconst dependencies = ['typed', 'SparseMatrix']\n\nexport const createSparse = /* #__PURE__ */ factory(name, dependencies, ({ typed, SparseMatrix }) => {\n  /**\n   * Create a Sparse 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   *\n   * Syntax:\n   *\n   *    math.sparse()               // creates an empty sparse matrix.\n   *    math.sparse(data)           // creates a sparse matrix with initial data.\n   *    math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.\n   *\n   * Examples:\n   *\n   *    let m = math.sparse([[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, matrix\n   *\n   * @param {Array | Matrix} [data]    A two dimensional array\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function () {\n      return new SparseMatrix([])\n    },\n\n    string: function (datatype) {\n      return new SparseMatrix([], datatype)\n    },\n\n    'Array | Matrix': function (data) {\n      return new SparseMatrix(data)\n    },\n\n    'Array | Matrix, string': function (data, datatype) {\n      return new SparseMatrix(data, datatype)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'createUnit'\nconst dependencies = ['typed', 'Unit']\n\nexport const createCreateUnit = /* #__PURE__ */ factory(name, dependencies, ({ typed, Unit }) => {\n  /**\n   * Create a user-defined unit and register it with the Unit type.\n   *\n   * Syntax:\n   *\n   *     math.createUnit({\n   *       baseUnit1: {\n   *         aliases: [string, ...]\n   *         prefixes: object\n   *       },\n   *       unit2: {\n   *         definition: string,\n   *         aliases: [string, ...]\n   *         prefixes: object,\n   *         offset: number\n   *       },\n   *       unit3: string    // Shortcut\n   *     })\n   *\n   *     // Another shortcut:\n   *     math.createUnit(string, unit : string, [object])\n   *\n   * Examples:\n   *\n   *     math.createUnit('foo')\n   *     math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})\n   *     math.createUnit('mph', '1 mile/hour')\n   *\n   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'\n   * @param {string, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.\n   * @param {Object} options   (optional) An object containing any of the following properties:\n   *     - `prefixes {string}` \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\". The default is \"none\".\n   *     - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']\n   *     - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.\n   *\n   * See also:\n   *\n   *     unit\n   *\n   * @return {Unit} The new unit\n   */\n  return typed(name, {\n\n    // General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.\n    'Object, Object': function (obj, options) {\n      return Unit.createUnit(obj, options)\n    },\n\n    // Same as above but without the options.\n    Object: function (obj) {\n      return Unit.createUnit(obj, {})\n    },\n\n    // Shortcut method for creating one unit.\n    'string, Unit | string | Object, Object': function (name, def, options) {\n      const obj = {}\n      obj[name] = def\n      return Unit.createUnit(obj, options)\n    },\n\n    // Same as above but without the options.\n    'string, Unit | string | Object': function (name, def) {\n      const obj = {}\n      obj[name] = def\n      return Unit.createUnit(obj, {})\n    },\n\n    // Without a definition, creates a base unit.\n    string: function (name) {\n      const obj = {}\n      obj[name] = {}\n      return Unit.createUnit(obj, {})\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'acos'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAcos = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the inverse cosine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acos(x)\n   *\n   * Examples:\n   *\n   *    math.acos(0.5)           // returns number 1.0471975511965979\n   *    math.acos(math.cos(1.5)) // returns number 1.5\n   *\n   *    math.acos(2)             // returns Complex 0 + 1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    cos, atan, asin\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} The arc cosine of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x >= -1 && x <= 1) || config.predictable) {\n        return Math.acos(x)\n      } else {\n        return new Complex(x, 0).acos()\n      }\n    },\n\n    Complex: function (x) {\n      return x.acos()\n    },\n\n    BigNumber: function (x) {\n      return x.acos()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { acosh, asinh, atanh, cosh, sign, sinh, tanh } from '../../utils/number.js'\n\nconst n1 = 'number'\nconst n2 = 'number, number'\n\nexport function acosNumber (x) {\n  return Math.acos(x)\n}\nacosNumber.signature = n1\n\nexport function acoshNumber (x) {\n  return acosh(x)\n}\nacoshNumber.signature = n1\n\nexport function acotNumber (x) {\n  return Math.atan(1 / x)\n}\nacotNumber.signature = n1\n\nexport function acothNumber (x) {\n  return isFinite(x)\n    ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2\n    : 0\n}\nacothNumber.signature = n1\n\nexport function acscNumber (x) {\n  return Math.asin(1 / x)\n}\nacscNumber.signature = n1\n\nexport function acschNumber (x) {\n  const xInv = 1 / x\n  return Math.log(xInv + Math.sqrt(xInv * xInv + 1))\n}\nacschNumber.signature = n1\n\nexport function asecNumber (x) {\n  return Math.acos(1 / x)\n}\nasecNumber.signature = n1\n\nexport function asechNumber (x) {\n  const xInv = 1 / x\n  const ret = Math.sqrt(xInv * xInv - 1)\n  return Math.log(ret + xInv)\n}\nasechNumber.signature = n1\n\nexport function asinNumber (x) {\n  return Math.asin(x)\n}\nasinNumber.signature = n1\n\nexport function asinhNumber (x) {\n  return asinh(x)\n}\nasinhNumber.signature = n1\n\nexport function atanNumber (x) {\n  return Math.atan(x)\n}\natanNumber.signature = n1\n\nexport function atan2Number (y, x) {\n  return Math.atan2(y, x)\n}\natan2Number.signature = n2\n\nexport function atanhNumber (x) {\n  return atanh(x)\n}\natanhNumber.signature = n1\n\nexport function cosNumber (x) {\n  return Math.cos(x)\n}\ncosNumber.signature = n1\n\nexport function coshNumber (x) {\n  return cosh(x)\n}\ncoshNumber.signature = n1\n\nexport function cotNumber (x) {\n  return 1 / Math.tan(x)\n}\ncotNumber.signature = n1\n\nexport function cothNumber (x) {\n  const e = Math.exp(2 * x)\n  return (e + 1) / (e - 1)\n}\ncothNumber.signature = n1\n\nexport function cscNumber (x) {\n  return 1 / Math.sin(x)\n}\ncscNumber.signature = n1\n\nexport function cschNumber (x) {\n  // consider values close to zero (+/-)\n  if (x === 0) {\n    return Number.POSITIVE_INFINITY\n  } else {\n    return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * sign(x)\n  }\n}\ncschNumber.signature = n1\n\nexport function secNumber (x) {\n  return 1 / Math.cos(x)\n}\nsecNumber.signature = n1\n\nexport function sechNumber (x) {\n  return 2 / (Math.exp(x) + Math.exp(-x))\n}\nsechNumber.signature = n1\n\nexport function sinNumber (x) {\n  return Math.sin(x)\n}\nsinNumber.signature = n1\n\nexport function sinhNumber (x) {\n  return sinh(x)\n}\nsinhNumber.signature = n1\n\nexport function tanNumber (x) {\n  return Math.tan(x)\n}\ntanNumber.signature = n1\n\nexport function tanhNumber (x) {\n  return tanh(x)\n}\ntanhNumber.signature = n1\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { acoshNumber } from '../../plain/number/index.js'\n\nconst name = 'acosh'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAcosh = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the hyperbolic arccos of a value,\n   * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acosh(x)\n   *\n   * Examples:\n   *\n   *    math.acosh(1.5)       // returns 0.9624236501192069\n   *\n   * See also:\n   *\n   *    cosh, asinh, atanh\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arccosine of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= 1 || config.predictable) {\n        return acoshNumber(x)\n      }\n      if (x <= -1) {\n        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI)\n      }\n      return new Complex(x, 0).acosh()\n    },\n\n    Complex: function (x) {\n      return x.acosh()\n    },\n\n    BigNumber: function (x) {\n      return x.acosh()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { acotNumber } from '../../plain/number/index.js'\n\nconst name = 'acot'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createAcot = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acot(x)\n   *\n   * Examples:\n   *\n   *    math.acot(0.5)           // returns number 0.4636476090008061\n   *    math.acot(math.cot(1.5)) // returns number 1.5\n   *\n   *    math.acot(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    cot, atan\n   *\n   * @param {number | Complex | Array | Matrix} x   Function input\n   * @return {number | Complex | Array | Matrix} The arc cotangent of x\n   */\n  return typed(name, {\n    number: acotNumber,\n\n    Complex: function (x) {\n      return x.acot()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).atan()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { acothNumber } from '../../plain/number/index.js'\n\nconst name = 'acoth'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAcoth = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic arccotangent of a value,\n   * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acoth(x)\n   *\n   * Examples:\n   *\n   *    math.acoth(0.5)       // returns 0.8047189562170503\n   *\n   * See also:\n   *\n   *    acsch, asech\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arccotangent of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= 1 || x <= -1 || config.predictable) {\n        return acothNumber(x)\n      }\n      return new Complex(x, 0).acoth()\n    },\n\n    Complex: function (x) {\n      return x.acoth()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).atanh()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { acscNumber } from '../../plain/number/index.js'\n\nconst name = 'acsc'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAcsc = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acsc(x)\n   *\n   * Examples:\n   *\n   *    math.acsc(0.5)           // returns number 0.5235987755982989\n   *    math.acsc(math.csc(1.5)) // returns number ~1.5\n   *\n   *    math.acsc(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    csc, asin, asec\n   *\n   * @param {number | Complex | Array | Matrix} x   Function input\n   * @return {number | Complex | Array | Matrix} The arc cosecant of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return acscNumber(x)\n      }\n      return new Complex(x, 0).acsc()\n    },\n\n    Complex: function (x) {\n      return x.acsc()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).asin()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { acschNumber } from '../../plain/number/index.js'\n\nconst name = 'acsch'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createAcsch = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic arccosecant of a value,\n   * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acsch(x)\n   *\n   * Examples:\n   *\n   *    math.acsch(0.5)       // returns 1.4436354751788103\n   *\n   * See also:\n   *\n   *    asech, acoth\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arccosecant of x\n   */\n  return typed(name, {\n    number: acschNumber,\n\n    Complex: function (x) {\n      return x.acsch()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).asinh()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { asecNumber } from '../../plain/number/index.js'\n\nconst name = 'asec'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAsec = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asec(x)\n   *\n   * Examples:\n   *\n   *    math.asec(0.5)           // returns 1.0471975511965979\n   *    math.asec(math.sec(1.5)) // returns 1.5\n   *\n   *    math.asec(2)             // returns 0 + 1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    acos, acot, acsc\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} The arc secant of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return asecNumber(x)\n      }\n      return new Complex(x, 0).asec()\n    },\n\n    Complex: function (x) {\n      return x.asec()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).acos()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { asechNumber } from '../../plain/number/index.js'\n\nconst name = 'asech'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAsech = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic arcsecant of a value,\n   * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asech(x)\n   *\n   * Examples:\n   *\n   *    math.asech(0.5)       // returns 1.3169578969248166\n   *\n   * See also:\n   *\n   *    acsch, acoth\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arcsecant of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x <= 1 && x >= -1) || config.predictable) {\n        const xInv = 1 / x\n        if (xInv > 0 || config.predictable) {\n          return asechNumber(x)\n        }\n\n        const ret = Math.sqrt(xInv * xInv - 1)\n        return new Complex(Math.log(ret - xInv), Math.PI)\n      }\n\n      return new Complex(x, 0).asech()\n    },\n\n    Complex: function (x) {\n      return x.asech()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).acosh()\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'asin'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAsin = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the inverse sine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asin(x)\n   *\n   * Examples:\n   *\n   *    math.asin(0.5)           // returns number 0.5235987755982989\n   *    math.asin(math.sin(1.5)) // returns number ~1.5\n   *\n   *    math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    sin, atan, acos\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} The arc sine of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x >= -1 && x <= 1) || config.predictable) {\n        return Math.asin(x)\n      } else {\n        return new Complex(x, 0).asin()\n      }\n    },\n\n    Complex: function (x) {\n      return x.asin()\n    },\n\n    BigNumber: function (x) {\n      return x.asin()\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since asin(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { asinhNumber } from '../../plain/number/index.js'\n\nconst name = 'asinh'\nconst dependencies = ['typed']\n\nexport const createAsinh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic arcsine of a value,\n   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asinh(x)\n   *\n   * Examples:\n   *\n   *    math.asinh(0.5)       // returns 0.48121182505960347\n   *\n   * See also:\n   *\n   *    acosh, atanh\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arcsine of x\n   */\n  return typed('asinh', {\n    number: asinhNumber,\n\n    Complex: function (x) {\n      return x.asinh()\n    },\n\n    BigNumber: function (x) {\n      return x.asinh()\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since asinh(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'atan'\nconst dependencies = ['typed']\n\nexport const createAtan = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the inverse tangent of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.atan(x)\n   *\n   * Examples:\n   *\n   *    math.atan(0.5)           // returns number 0.4636476090008061\n   *    math.atan(math.tan(1.5)) // returns number 1.5\n   *\n   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    tan, asin, acos\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} The arc tangent of x\n   */\n  return typed('atan', {\n    number: function (x) {\n      return Math.atan(x)\n    },\n\n    Complex: function (x) {\n      return x.atan()\n    },\n\n    BigNumber: function (x) {\n      return x.atan()\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since atan(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js'\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js'\nimport { createAlgorithm09 } from '../../type/matrix/utils/algorithm09.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'atan2'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'BigNumber',\n  'DenseMatrix'\n]\n\nexport const createAtan2 = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, BigNumber, DenseMatrix }) => {\n  const algorithm02 = createAlgorithm02({ typed, equalScalar })\n  const algorithm03 = createAlgorithm03({ typed })\n  const algorithm09 = createAlgorithm09({ typed, equalScalar })\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm12 = createAlgorithm12({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Calculate the inverse tangent function with two arguments, y/x.\n   * By providing two arguments, the right quadrant of the computed angle can be\n   * determined.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.atan2(y, x)\n   *\n   * Examples:\n   *\n   *    math.atan2(2, 2) / math.pi       // returns number 0.25\n   *\n   *    const angle = math.unit(60, 'deg') // returns Unit 60 deg\n   *    const x = math.cos(angle)\n   *    const y = math.sin(angle)\n   *\n   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    tan, atan, sin, cos\n   *\n   * @param {number | Array | Matrix} y  Second dimension\n   * @param {number | Array | Matrix} x  First dimension\n   * @return {number | Array | Matrix} Four-quadrant inverse tangent\n   */\n  return typed(name, {\n\n    'number, number': Math.atan2,\n\n    // Complex numbers doesn't seem to have a reasonable implementation of\n    // atan2(). Even Matlab removed the support, after they only calculated\n    // the atan only on base of the real part of the numbers and ignored the imaginary.\n\n    'BigNumber, BigNumber': function (y, x) {\n      return BigNumber.atan2(y, x)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm09(x, y, this, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      // mind the order of y and x!\n      return algorithm02(y, x, this, true)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm03(x, y, this, false)\n    },\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, this)\n    },\n\n    'Array, Array': function (x, y) {\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      return this(x, matrix(y))\n    },\n\n    'SparseMatrix, number | BigNumber': function (x, y) {\n      return algorithm11(x, y, this, false)\n    },\n\n    'DenseMatrix, number | BigNumber': function (x, y) {\n      return algorithm14(x, y, this, false)\n    },\n\n    'number | BigNumber, SparseMatrix': function (x, y) {\n      // mind the order of y and x\n      return algorithm12(y, x, this, true)\n    },\n\n    'number | BigNumber, DenseMatrix': function (x, y) {\n      // mind the order of y and x\n      return algorithm14(y, x, this, true)\n    },\n\n    'Array, number | BigNumber': function (x, y) {\n      return algorithm14(matrix(x), y, this, false).valueOf()\n    },\n\n    'number | BigNumber, Array': function (x, y) {\n      return algorithm14(matrix(y), x, this, true).valueOf()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { atanhNumber } from '../../plain/number/index.js'\n\nconst name = 'atanh'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAtanh = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the hyperbolic arctangent of a value,\n   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.atanh(x)\n   *\n   * Examples:\n   *\n   *    math.atanh(0.5)       // returns 0.5493061443340549\n   *\n   * See also:\n   *\n   *    acosh, asinh\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arctangent of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x <= 1 && x >= -1) || config.predictable) {\n        return atanhNumber(x)\n      }\n      return new Complex(x, 0).atanh()\n    },\n\n    Complex: function (x) {\n      return x.atanh()\n    },\n\n    BigNumber: function (x) {\n      return x.atanh()\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since atanh(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'cos'\nconst dependencies = ['typed']\n\nexport const createCos = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the cosine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cos(x)\n   *\n   * Examples:\n   *\n   *    math.cos(2)                      // returns number -0.4161468365471422\n   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475\n   *    math.cos(math.unit(180, 'deg'))  // returns number -1\n   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Cosine of x\n   */\n  return typed(name, {\n    number: Math.cos,\n\n    Complex: function (x) {\n      return x.cos()\n    },\n\n    BigNumber: function (x) {\n      return x.cos()\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cos is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { cosh as coshNumber } from '../../utils/number.js'\n\nconst name = 'cosh'\nconst dependencies = ['typed']\n\nexport const createCosh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic cosine of a value,\n   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cosh(x)\n   *\n   * Examples:\n   *\n   *    math.cosh(0.5)       // returns number 1.1276259652063807\n   *\n   * See also:\n   *\n   *    sinh, tanh\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic cosine of x\n   */\n  return typed(name, {\n    number: coshNumber,\n\n    Complex: function (x) {\n      return x.cosh()\n    },\n\n    BigNumber: function (x) {\n      return x.cosh()\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cosh is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { cotNumber } from '../../plain/number/index.js'\n\nconst name = 'cot'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCot = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cot(x)\n   *\n   * Examples:\n   *\n   *    math.cot(2)      // returns number -0.45765755436028577\n   *    1 / math.tan(2)  // returns number -0.45765755436028577\n   *\n   * See also:\n   *\n   *    tan, sec, csc\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Cotangent of x\n   */\n  return typed(name, {\n    number: cotNumber,\n\n    Complex: function (x) {\n      return x.cot()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x.tan())\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cot is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { cothNumber } from '../../plain/number/index.js'\n\nconst name = 'coth'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCoth = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic cotangent of a value,\n   * defined as `coth(x) = 1 / tanh(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.coth(x)\n   *\n   * Examples:\n   *\n   *    // coth(x) = 1 / tanh(x)\n   *    math.coth(2)         // returns 1.0373147207275482\n   *    1 / math.tanh(2)     // returns 1.0373147207275482\n   *\n   * See also:\n   *\n   *    sinh, tanh, cosh\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic cotangent of x\n   */\n  return typed(name, {\n    number: cothNumber,\n\n    Complex: function (x) {\n      return x.coth()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x.tanh())\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function coth is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { cscNumber } from '../../plain/number/index.js'\n\nconst name = 'csc'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCsc = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.csc(x)\n   *\n   * Examples:\n   *\n   *    math.csc(2)      // returns number 1.099750170294617\n   *    1 / math.sin(2)  // returns number 1.099750170294617\n   *\n   * See also:\n   *\n   *    sin, sec, cot\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Cosecant of x\n   */\n  return typed(name, {\n    number: cscNumber,\n\n    Complex: function (x) {\n      return x.csc()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x.sin())\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csc is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { cschNumber } from '../../plain/number/index.js'\n\nconst name = 'csch'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCsch = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic cosecant of a value,\n   * defined as `csch(x) = 1 / sinh(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.csch(x)\n   *\n   * Examples:\n   *\n   *    // csch(x) = 1/ sinh(x)\n   *    math.csch(0.5)       // returns 1.9190347513349437\n   *    1 / math.sinh(0.5)   // returns 1.9190347513349437\n   *\n   * See also:\n   *\n   *    sinh, sech, coth\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic cosecant of x\n   */\n  return typed(name, {\n    number: cschNumber,\n\n    Complex: function (x) {\n      return x.csch()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x.sinh())\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csch is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { secNumber } from '../../plain/number/index.js'\n\nconst name = 'sec'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createSec = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sec(x)\n   *\n   * Examples:\n   *\n   *    math.sec(2)      // returns number -2.4029979617223822\n   *    1 / math.cos(2)  // returns number -2.4029979617223822\n   *\n   * See also:\n   *\n   *    cos, csc, cot\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Secant of x\n   */\n  return typed(name, {\n    number: secNumber,\n\n    Complex: function (x) {\n      return x.sec()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x.cos())\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sec is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { sechNumber } from '../../plain/number/index.js'\n\nconst name = 'sech'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createSech = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic secant of a value,\n   * defined as `sech(x) = 1 / cosh(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sech(x)\n   *\n   * Examples:\n   *\n   *    // sech(x) = 1/ cosh(x)\n   *    math.sech(0.5)       // returns 0.886818883970074\n   *    1 / math.cosh(0.5)   // returns 0.886818883970074\n   *\n   * See also:\n   *\n   *    cosh, csch, coth\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic secant of x\n   */\n  return typed(name, {\n    number: sechNumber,\n\n    Complex: function (x) {\n      return x.sech()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x.cosh())\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sech is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      return deepMap(x, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'sin'\nconst dependencies = ['typed']\n\nexport const createSin = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the sine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sin(x)\n   *\n   * Examples:\n   *\n   *    math.sin(2)                      // returns number 0.9092974268256813\n   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475\n   *    math.sin(math.unit(90, 'deg'))   // returns number 1\n   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Sine of x\n   */\n  return typed(name, {\n    number: Math.sin,\n\n    Complex: function (x) {\n      return x.sin()\n    },\n\n    BigNumber: function (x) {\n      return x.sin()\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sin is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since sin(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { sinhNumber } from '../../plain/number/index.js'\n\nconst name = 'sinh'\nconst dependencies = ['typed']\n\nexport const createSinh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic sine of a value,\n   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sinh(x)\n   *\n   * Examples:\n   *\n   *    math.sinh(0.5)       // returns number 0.5210953054937474\n   *\n   * See also:\n   *\n   *    cosh, tanh\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic sine of x\n   */\n  return typed(name, {\n    number: sinhNumber,\n\n    Complex: function (x) {\n      return x.sinh()\n    },\n\n    BigNumber: function (x) {\n      return x.sinh()\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sinh is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since sinh(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'tan'\nconst dependencies = ['typed']\n\nexport const createTan = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.tan(x)\n   *\n   * Examples:\n   *\n   *    math.tan(0.5)                    // returns number 0.5463024898437905\n   *    math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905\n   *    math.tan(math.pi / 4)            // returns number 1\n   *    math.tan(math.unit(45, 'deg'))   // returns number 1\n   *\n   * See also:\n   *\n   *    atan, sin, cos\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Tangent of x\n   */\n  return typed(name, {\n    number: Math.tan,\n\n    Complex: function (x) {\n      return x.tan()\n    },\n\n    BigNumber: function (x) {\n      return x.tan()\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tan is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since tan(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { tanh as _tanh } from '../../utils/number.js'\n\nconst name = 'tanh'\nconst dependencies = ['typed']\n\nexport const createTanh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic tangent of a value,\n   * defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.tanh(x)\n   *\n   * Examples:\n   *\n   *    // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)\n   *    math.tanh(0.5)                   // returns 0.46211715726000974\n   *    math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974\n   *    1 / math.coth(0.5)               // returns 0.46211715726000974\n   *\n   * See also:\n   *\n   *    sinh, cosh, coth\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic tangent of x\n   */\n  return typed('tanh', {\n    number: _tanh,\n\n    Complex: function (x) {\n      return x.tanh()\n    },\n\n    BigNumber: function (x) {\n      return x.tanh()\n    },\n\n    Unit: function (x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tanh is no angle')\n      }\n      return this(x.value)\n    },\n\n    'Array | Matrix': function (x) {\n      // deep map collection, skip zeros since tanh(0) = 0\n      return deepMap(x, this, true)\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setCartesian'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetCartesian = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Create the cartesian product of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays\n   * and the values will be sorted in ascending order before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setCartesian(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]\n   *    math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference, setPowerset\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The cartesian product of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      let result = []\n\n      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) { // if any of them is empty, return empty\n        const b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural)\n        const b2 = flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural)\n        result = []\n        for (let i = 0; i < b1.length; i++) {\n          for (let j = 0; j < b2.length; j++) {\n            result.push([b1[i], b2[j]])\n          }\n        }\n      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return result\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(result)\n    }\n  })\n})\n","import { flatten, generalize, identify } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setDifference'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetDifference = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setDifference(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]\n   *    math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setSymDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The difference of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      let result\n      if (subset(size(a1), new Index(0)) === 0) { // empty-anything=empty\n        result = []\n      } else if (subset(size(a2), new Index(0)) === 0) { // anything-empty=anything\n        return flatten(a1.toArray())\n      } else {\n        const b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural))\n        const b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural))\n        result = []\n        let inb2\n        for (let i = 0; i < b1.length; i++) {\n          inb2 = false\n          for (let j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) { // the identifier is always a decimal int\n              inb2 = true\n              break\n            }\n          }\n          if (!inb2) {\n            result.push(b1[i])\n          }\n        }\n      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result)\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(generalize(result))\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setDistinct'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetDistinct = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Collect the distinct elements of a multiset.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setDistinct(set)\n   *\n   * Examples:\n   *\n   *    math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]\n   *\n   * See also:\n   *\n   *    setMultiplicity\n   *\n   * @param {Array | Matrix}    a  A multiset\n   * @return {Array | Matrix}    A set containing the distinc elements of the multiset\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      let result\n      if (subset(size(a), new Index(0)) === 0) { // if empty, return empty\n        result = []\n      } else {\n        const b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural)\n        result = []\n        result.push(b[0])\n        for (let i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            result.push(b[i])\n          }\n        }\n      }\n      // return an array, if the input was an array\n      if (Array.isArray(a)) {\n        return result\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(result)\n    }\n  })\n})\n","import { flatten, generalize, identify } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setIntersect'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetIntersect = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Create the intersection of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setIntersect(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]\n   *    math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]\n   *\n   * See also:\n   *\n   *    setUnion, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The intersection of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      let result\n      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) { // of any of them is empty, return empty\n        result = []\n      } else {\n        const b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural))\n        const b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural))\n        result = []\n        for (let i = 0; i < b1.length; i++) {\n          for (let j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) { // the identifier is always a decimal int\n              result.push(b1[i])\n              break\n            }\n          }\n        }\n      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result)\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(generalize(result))\n    }\n  })\n})\n","import { flatten, identify } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setIsSubset'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index']\n\nexport const createSetIsSubset = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index }) => {\n  /**\n   * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setIsSubset(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false\n   *    math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {boolean}            true | false\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) { // empty is a subset of anything\n        return true\n      } else if (subset(size(a2), new Index(0)) === 0) { // anything is not a subset of empty\n        return false\n      }\n      const b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural))\n      const b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural))\n      let inb2\n      for (let i = 0; i < b1.length; i++) {\n        inb2 = false\n        for (let j = 0; j < b2.length; j++) {\n          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) { // the identifier is always a decimal int\n            inb2 = true\n            break\n          }\n        }\n        if (inb2 === false) {\n          return false\n        }\n      }\n      return true\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setMultiplicity'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index']\n\nexport const createSetMultiplicity = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index }) => {\n  /**\n   * Count the multiplicity of an element in a multiset.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setMultiplicity(element, set)\n   *\n   * Examples:\n   *\n   *    math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1\n   *    math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2\n   *\n   * See also:\n   *\n   *    setDistinct, setSize\n   *\n   * @param {number | BigNumber | Fraction | Complex} e  An element in the multiset\n   * @param {Array | Matrix}     a  A multiset\n   * @return {number}            The number of how many times the multiset contains the element\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction | Complex, Array | Matrix': function (e, a) {\n      if (subset(size(a), new Index(0)) === 0) { // if empty, return 0\n        return 0\n      }\n      const b = flatten(Array.isArray(a) ? a : a.toArray())\n      let count = 0\n      for (let i = 0; i < b.length; i++) {\n        if (compareNatural(b[i], e) === 0) {\n          count++\n        }\n      }\n      return count\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setPowerset'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index']\n\nexport const createSetPowerset = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index }) => {\n  /**\n   * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setPowerset(set)\n   *\n   * Examples:\n   *\n   *    math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]\n   *\n   * See also:\n   *\n   *    setCartesian\n   *\n   * @param {Array | Matrix}    a  A (multi)set\n   * @return {Array}    The powerset of the (multi)set\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      if (subset(size(a), new Index(0)) === 0) { // if empty, return empty\n        return []\n      }\n      const b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural)\n      const result = []\n      let number = 0\n      while (number.toString(2).length <= b.length) {\n        result.push(_subset(b, number.toString(2).split('').reverse()))\n        number++\n      }\n      // can not return a matrix, because of the different size of the subarrays\n      return _sort(result)\n    }\n  })\n\n  // create subset\n  function _subset (array, bitarray) {\n    const result = []\n    for (let i = 0; i < bitarray.length; i++) {\n      if (bitarray[i] === '1') {\n        result.push(array[i])\n      }\n    }\n    return result\n  }\n\n  // sort subsests by length\n  function _sort (array) {\n    let temp = []\n    for (let i = array.length - 1; i > 0; i--) {\n      for (let j = 0; j < i; j++) {\n        if (array[j].length > array[j + 1].length) {\n          temp = array[j]\n          array[j] = array[j + 1]\n          array[j + 1] = temp\n        }\n      }\n    }\n    return array\n  }\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setSize'\nconst dependencies = ['typed', 'compareNatural']\n\nexport const createSetSize = /* #__PURE__ */ factory(name, dependencies, ({ typed, compareNatural }) => {\n  /**\n   * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setSize(set)\n   *    math.setSize(set, unique)\n   *\n   * Examples:\n   *\n   *    math.setSize([1, 2, 2, 4])          // returns 4\n   *    math.setSize([1, 2, 2, 4], true)    // returns 3\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a  A multiset\n   * @return {number}            The number of elements of the (multi)set\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length\n    },\n    'Array | Matrix, boolean': function (a, unique) {\n      if (unique === false || a.length === 0) {\n        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length\n      } else {\n        const b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural)\n        let count = 1\n        for (let i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            count++\n          }\n        }\n        return count\n      }\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setSymDifference'\nconst dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index']\n\nexport const createSetSymDifference = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, concat, subset, setDifference, Index }) => {\n  /**\n   * Create the symmetric difference of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setSymDifference(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]\n   *    math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The symmetric difference of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) { // if any of them is empty, return the other one\n        return flatten(a2)\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return flatten(a1)\n      }\n      const b1 = flatten(a1)\n      const b2 = flatten(a2)\n      return concat(setDifference(b1, b2), setDifference(b2, b1))\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setUnion'\nconst dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index']\n\nexport const createSetUnion = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, concat, subset, setIntersect, setSymDifference, Index }) => {\n  /**\n   * Create the union of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setUnion(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]\n   *    math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]\n   *\n   * See also:\n   *\n   *    setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The union of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) { // if any of them is empty, return the other one\n        return flatten(a2)\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return flatten(a1)\n      }\n      const b1 = flatten(a1)\n      const b2 = flatten(a2)\n      return concat(setSymDifference(b1, b2), setIntersect(b1, b2))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { extend } from '../../utils/object.js'\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js'\nimport { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js'\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js'\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'add'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'addScalar',\n  'equalScalar',\n  'DenseMatrix',\n  'SparseMatrix'\n]\n\nexport const createAdd = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, addScalar, equalScalar, DenseMatrix, SparseMatrix }) => {\n  const algorithm01 = createAlgorithm01({ typed })\n  const algorithm04 = createAlgorithm04({ typed, equalScalar })\n  const algorithm10 = createAlgorithm10({ typed, DenseMatrix })\n  const algorithm13 = createAlgorithm13({ typed })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Add two or more values, `x + y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.add(x, y)\n   *    math.add(x, y, z, ...)\n   *\n   * Examples:\n   *\n   *    math.add(2, 3)               // returns number 5\n   *    math.add(2, 3, 4)            // returns number 9\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(-4, 1)\n   *    math.add(a, b)               // returns Complex -2 + 4i\n   *\n   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]\n   *\n   *    const c = math.unit('5 cm')\n   *    const d = math.unit('2.1 mm')\n   *    math.add(c, d)               // returns Unit 52.1 mm\n   *\n   *    math.add(\"2.3\", \"4\")         // returns number 6.3\n   *\n   * See also:\n   *\n   *    subtract, sum\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`\n   */\n  return typed(name, extend({\n    // we extend the signatures of addScalar with signatures dealing with matrices\n\n    'DenseMatrix, DenseMatrix': function (x, y) {\n      return algorithm13(x, y, addScalar)\n    },\n\n    'DenseMatrix, SparseMatrix': function (x, y) {\n      return algorithm01(x, y, addScalar, false)\n    },\n\n    'SparseMatrix, DenseMatrix': function (x, y) {\n      return algorithm01(y, x, addScalar, true)\n    },\n\n    'SparseMatrix, SparseMatrix': function (x, y) {\n      return algorithm04(x, y, addScalar)\n    },\n\n    'Array, Array': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf()\n    },\n\n    'Array, Matrix': function (x, y) {\n      // use matrix implementation\n      return this(matrix(x), y)\n    },\n\n    'Matrix, Array': function (x, y) {\n      // use matrix implementation\n      return this(x, matrix(y))\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, addScalar, false)\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm10(x, y, addScalar, false)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return algorithm14(y, x, addScalar, true)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return algorithm10(y, x, addScalar, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, addScalar, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, addScalar, true).valueOf()\n    },\n\n    'any, any': addScalar,\n\n    'any, any, ...any': function (x, y, rest) {\n      let result = this(x, y)\n\n      for (let i = 0; i < rest.length; i++) {\n        result = this(result, rest[i])\n      }\n\n      return result\n    }\n  }, addScalar.signatures))\n})\n","import { factory } from '../../utils/factory.js'\nimport { flatten } from '../../utils/array.js'\n\nconst name = 'hypot'\nconst dependencies = [\n  'typed',\n  'abs',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'sqrt',\n  'smaller',\n  'isPositive'\n]\n\nexport const createHypot = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, addScalar, divideScalar, multiplyScalar, sqrt, smaller, isPositive }) => {\n  /**\n   * Calculate the hypotenusa of a list with values. The hypotenusa is defined as:\n   *\n   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)\n   *\n   * For matrix input, the hypotenusa is calculated for all values in the matrix.\n   *\n   * Syntax:\n   *\n   *     math.hypot(a, b, ...)\n   *     math.hypot([a, b, c, ...])\n   *\n   * Examples:\n   *\n   *     math.hypot(3, 4)      // 5\n   *     math.hypot(3, 4, 5)   // 7.0710678118654755\n   *     math.hypot([3, 4, 5]) // 7.0710678118654755\n   *     math.hypot(-2)        // 2\n   *\n   * See also:\n   *\n   *     abs, norm\n   *\n   * @param {... number | BigNumber | Array | Matrix} args    A list with numeric values or an Array or Matrix.\n   *                                                          Matrix and Array input is flattened and returns a\n   *                                                          single number for the whole matrix.\n   * @return {number | BigNumber} Returns the hypothenusa of the input values.\n   */\n  return typed(name, {\n    '... number | BigNumber': _hypot,\n\n    Array: function (x) {\n      return this.apply(this, flatten(x))\n    },\n\n    Matrix: function (x) {\n      return this.apply(this, flatten(x.toArray()))\n    }\n  })\n\n  /**\n   * Calculate the hypotenusa for an Array with values\n   * @param {Array.<number | BigNumber>} args\n   * @return {number | BigNumber} Returns the result\n   * @private\n   */\n  function _hypot (args) {\n    // code based on `hypot` from es6-shim:\n    // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633\n    let result = 0\n    let largest = 0\n\n    for (let i = 0; i < args.length; i++) {\n      const value = abs(args[i])\n      if (smaller(largest, value)) {\n        result = multiplyScalar(result,\n          multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)))\n        result = addScalar(result, 1)\n        largest = value\n      } else {\n        result = addScalar(result, isPositive(value)\n          ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest))\n          : value)\n      }\n    }\n\n    return multiplyScalar(largest, sqrt(result))\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'norm'\nconst dependencies = [\n  'typed',\n  'abs',\n  'add',\n  'pow',\n  'conj',\n  'sqrt',\n  'multiply',\n  'equalScalar',\n  'larger',\n  'smaller',\n  'matrix',\n  'ctranspose',\n  'eigs'\n]\n\nexport const createNorm = /* #__PURE__ */ factory(\n  name,\n  dependencies,\n  ({\n    typed,\n    abs,\n    add,\n    pow,\n    conj,\n    sqrt,\n    multiply,\n    equalScalar,\n    larger,\n    smaller,\n    matrix,\n    ctranspose,\n    eigs\n  }) => {\n    /**\n     * Calculate the norm of a number, vector or matrix.\n     *\n     * The second parameter p is optional. If not provided, it defaults to 2.\n     *\n     * Syntax:\n     *\n     *    math.norm(x)\n     *    math.norm(x, p)\n     *\n     * Examples:\n     *\n     *    math.abs(-3.5)                         // returns 3.5\n     *    math.norm(-3.5)                        // returns 3.5\n     *\n     *    math.norm(math.complex(3, -4))         // returns 5\n     *\n     *    math.norm([1, 2, -3], Infinity)        // returns 3\n     *    math.norm([1, 2, -3], -Infinity)       // returns 1\n     *\n     *    math.norm([3, 4], 2)                   // returns 5\n     *\n     *    math.norm([[1, 2], [3, 4]], 1)          // returns 6\n     *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7\n     *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661\n     *\n     * See also:\n     *\n     *    abs, hypot\n     *\n     * @param  {number | BigNumber | Complex | Array | Matrix} x\n     *            Value for which to calculate the norm\n     * @param  {number | BigNumber | string} [p=2]\n     *            Vector space.\n     *            Supported numbers include Infinity and -Infinity.\n     *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)\n     * @return {number | BigNumber} the p-norm\n     */\n    return typed(name, {\n      number: Math.abs,\n\n      Complex: function (x) {\n        return x.abs()\n      },\n\n      BigNumber: function (x) {\n        // norm(x) = abs(x)\n        return x.abs()\n      },\n\n      boolean: function (x) {\n        // norm(x) = abs(x)\n        return Math.abs(x)\n      },\n\n      Array: function (x) {\n        return _norm(matrix(x), 2)\n      },\n\n      Matrix: function (x) {\n        return _norm(x, 2)\n      },\n\n      'number | Complex | BigNumber | boolean, number | BigNumber | string': function (\n        x\n      ) {\n        // ignore second parameter, TODO: remove the option of second parameter for these types\n        return this(x)\n      },\n\n      'Array, number | BigNumber | string': function (x, p) {\n        return _norm(matrix(x), p)\n      },\n\n      'Matrix, number | BigNumber | string': function (x, p) {\n        return _norm(x, p)\n      }\n    })\n\n    /**\n     * Calculate the plus infinity norm for a vector\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _vectorNormPlusInfinity (x) {\n      // norm(x, Infinity) = max(abs(x))\n      let pinf = 0\n      // skip zeros since abs(0) === 0\n      x.forEach(function (value) {\n        const v = abs(value)\n        if (larger(v, pinf)) {\n          pinf = v\n        }\n      }, true)\n      return pinf\n    }\n\n    /**\n     * Calculate the minus infinity norm for a vector\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _vectorNormMinusInfinity (x) {\n      // norm(x, -Infinity) = min(abs(x))\n      let ninf\n      // skip zeros since abs(0) === 0\n      x.forEach(function (value) {\n        const v = abs(value)\n        if (!ninf || smaller(v, ninf)) {\n          ninf = v\n        }\n      }, true)\n      return ninf || 0\n    }\n\n    /**\n     * Calculate the norm for a vector\n     * @param {Matrix} x\n     * @param {number | string} p\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _vectorNorm (x, p) {\n      // check p\n      if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n        return _vectorNormPlusInfinity(x)\n      }\n      if (p === Number.NEGATIVE_INFINITY || p === '-inf') {\n        return _vectorNormMinusInfinity(x)\n      }\n      if (p === 'fro') {\n        return _norm(x, 2)\n      }\n      if (typeof p === 'number' && !isNaN(p)) {\n        // check p != 0\n        if (!equalScalar(p, 0)) {\n          // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p\n          let n = 0\n          // skip zeros since abs(0) === 0\n          x.forEach(function (value) {\n            n = add(pow(abs(value), p), n)\n          }, true)\n          return pow(n, 1 / p)\n        }\n        return Number.POSITIVE_INFINITY\n      }\n      // invalid parameter value\n      throw new Error('Unsupported parameter value')\n    }\n\n    /**\n     * Calculate the Frobenius norm for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormFrobenius (x) {\n      // norm(x) = sqrt(sum(diag(x'x)))\n      let fro = 0\n      x.forEach(function (value, index) {\n        fro = add(fro, multiply(value, conj(value)))\n      })\n      return abs(sqrt(fro))\n    }\n\n    /**\n     * Calculate the norm L1 for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormOne (x) {\n      // norm(x) = the largest column sum\n      const c = []\n      // result\n      let maxc = 0\n      // skip zeros since abs(0) == 0\n      x.forEach(function (value, index) {\n        const j = index[1]\n        const cj = add(c[j] || 0, abs(value))\n        if (larger(cj, maxc)) {\n          maxc = cj\n        }\n        c[j] = cj\n      }, true)\n      return maxc\n    }\n\n    /**\n     * Calculate the norm L2 for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormTwo (x) {\n      // norm(x) = sqrt( max eigenvalue of A*.A)\n      const sizeX = x.size()\n      if (sizeX[0] !== sizeX[1]) {\n        throw new RangeError('Invalid matrix dimensions')\n      }\n      const tx = ctranspose(x)\n      const squaredX = multiply(tx, x)\n      const eigenVals = eigs(squaredX).values.toArray()\n      const rho = eigenVals[eigenVals.length - 1]\n      return abs(sqrt(rho))\n    }\n\n    /**\n     * Calculate the infinity norm for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormInfinity (x) {\n      // norm(x) = the largest row sum\n      const r = []\n      // result\n      let maxr = 0\n      // skip zeros since abs(0) == 0\n      x.forEach(function (value, index) {\n        const i = index[0]\n        const ri = add(r[i] || 0, abs(value))\n        if (larger(ri, maxr)) {\n          maxr = ri\n        }\n        r[i] = ri\n      }, true)\n      return maxr\n    }\n\n    /**\n     * Calculate the norm for a 2D Matrix (M*N)\n     * @param {Matrix} x\n     * @param {number | string} p\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNorm (x, p) {\n      // check p\n      if (p === 1) {\n        return _matrixNormOne(x)\n      }\n      if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n        return _matrixNormInfinity(x)\n      }\n      if (p === 'fro') {\n        return _matrixNormFrobenius(x)\n      }\n      if (p === 2) {\n        return _matrixNormTwo(x)\n      } // invalid parameter value\n\n      throw new Error('Unsupported parameter value ' + p)\n    }\n\n    /**\n     * Calculate the norm for an array\n     * @param {Matrix} x\n     * @param {number | string} p\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _norm (x, p) {\n      // size\n      const sizeX = x.size()\n\n      // check if it is a vector\n      if (sizeX.length === 1) {\n        return _vectorNorm(x, p)\n      }\n      // MxN matrix\n      if (sizeX.length === 2) {\n        if (sizeX[0] && sizeX[1]) {\n          return _matrixNorm(x, p)\n        } else {\n          throw new RangeError('Invalid matrix dimensions')\n        }\n      }\n    }\n  }\n)\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\n\nconst name = 'dot'\nconst dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size']\n\nexport const createDot = /* #__PURE__ */ factory(name, dependencies, ({ typed, addScalar, multiplyScalar, conj, size }) => {\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\n  function _validateDim (x, y) {\n    const xSize = _size(x)\n    const ySize = _size(y)\n    let xLen, yLen\n\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\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\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\n    return xLen\n  }\n\n  function _denseDot (a, b) {\n    const N = _validateDim(a, b)\n\n    const adata = isMatrix(a) ? a._data : a\n    const adt = isMatrix(a) ? a._datatype : undefined\n\n    const bdata = isMatrix(b) ? b._data : b\n    const bdt = isMatrix(b) ? b._datatype : undefined\n\n    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n    const aIsColumn = _size(a).length === 2\n    const bIsColumn = _size(b).length === 2\n\n    let add = addScalar\n    let mul = multiplyScalar\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      const 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      let c = mul(conj(adata[0]), bdata[0])\n      for (let 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      let c = mul(conj(adata[0]), bdata[0][0])\n      for (let 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      let c = mul(conj(adata[0][0]), bdata[0])\n      for (let i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i][0]), bdata[i]))\n      }\n      return c\n    }\n\n    // both vectors are column\n    if (aIsColumn && bIsColumn) {\n      let c = mul(conj(adata[0][0]), bdata[0][0])\n      for (let i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i][0]), bdata[i][0]))\n      }\n      return c\n    }\n  }\n\n  function _sparseDot (x, y) {\n    _validateDim(x, y)\n\n    const xindex = x._index\n    const xvalues = x._values\n\n    const yindex = y._index\n    const yvalues = y._values\n\n    // TODO optimize add & mul using datatype\n    let c = 0\n    const add = addScalar\n    const mul = multiplyScalar\n\n    let i = 0\n    let j = 0\n    while (i < xindex.length && j < yindex.length) {\n      const I = xindex[i]\n      const J = yindex[j]\n\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\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","import { clone } from '../../utils/object.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'trace'\nconst dependencies = ['typed', 'matrix', 'add']\n\nexport const createTrace = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, add }) => {\n  /**\n   * Calculate the trace of a matrix: the sum of the elements on the main\n   * diagonal of a square matrix.\n   *\n   * Syntax:\n   *\n   *    math.trace(x)\n   *\n   * Examples:\n   *\n   *    math.trace([[1, 2], [3, 4]]) // returns 5\n   *\n   *    const A = [\n   *      [1, 2, 3],\n   *      [-1, 2, 3],\n   *      [2, 0, 3]\n   *    ]\n   *    math.trace(A) // returns 6\n   *\n   * See also:\n   *\n   *    diag\n   *\n   * @param {Array | Matrix} x  A matrix\n   *\n   * @return {number} The trace of `x`\n   */\n  return typed('trace', {\n    Array: function _arrayTrace (x) {\n      // use dense matrix implementation\n      return _denseTrace(matrix(x))\n    },\n\n    SparseMatrix: _sparseTrace,\n\n    DenseMatrix: _denseTrace,\n\n    any: clone\n  })\n\n  function _denseTrace (m) {\n    // matrix size & data\n    const size = m._size\n    const data = m._data\n\n    // process dimensions\n    switch (size.length) {\n      case 1:\n        // vector\n        if (size[0] === 1) {\n          // return data[0]\n          return clone(data[0])\n        }\n        throw new RangeError('Matrix must be square (size: ' + format(size) + ')')\n      case 2:\n      {\n        // two dimensional\n        const rows = size[0]\n        const cols = size[1]\n        if (rows === cols) {\n          // calulate sum\n          let sum = 0\n          // loop diagonal\n          for (let i = 0; i < rows; i++) { sum = add(sum, data[i][i]) }\n          // return trace\n          return sum\n        } else {\n          throw new RangeError('Matrix must be square (size: ' + format(size) + ')')\n        }\n      }\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be two dimensional (size: ' + format(size) + ')')\n    }\n  }\n\n  function _sparseTrace (m) {\n    // matrix arrays\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    const size = m._size\n    // check dimensions\n    const rows = size[0]\n    const columns = size[1]\n    // matrix must be square\n    if (rows === columns) {\n      // calulate sum\n      let sum = 0\n      // check we have data (avoid looping columns)\n      if (values.length > 0) {\n        // loop columns\n        for (let j = 0; j < columns; j++) {\n          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n          const k0 = ptr[j]\n          const k1 = ptr[j + 1]\n          // loop k within [k0, k1[\n          for (let k = k0; k < k1; k++) {\n            // row index\n            const i = index[k]\n            // check row\n            if (i === j) {\n              // accumulate value\n              sum = add(sum, values[k])\n              // exit loop\n              break\n            }\n            if (i > j) {\n              // exit loop, no value on the diagonal for column j\n              break\n            }\n          }\n        }\n      }\n      // return trace\n      return sum\n    }\n    throw new RangeError('Matrix must be square (size: ' + format(size) + ')')\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { isBigNumber, isMatrix } from '../../../utils/is.js'\n\nconst name = 'index'\nconst dependencies = ['typed', 'Index']\n\nexport const createIndex = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index }) => {\n  /**\n   * Create an index. An Index can store ranges having start, step, and end\n   * for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Syntax:\n   *\n   *     math.index(range1, range2, ...)\n   *\n   * Where each range can be any of:\n   *\n   * - A number\n   * - A string for getting/setting an object property\n   * - An instance of `Range`\n   * - A one-dimensional Array or a Matrix with numbers\n   *\n   * Indexes must be zero-based, integer numbers.\n   *\n   * Examples:\n   *\n   *    const b = [1, 2, 3, 4, 5]\n   *    math.subset(b, math.index([1, 2, 3]))     // returns [2, 3, 4]\n   *\n   *    const a = math.matrix([[1, 2], [3, 4]])\n   *    a.subset(math.index(0, 1))             // returns 2\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, matrix, number, string, unit\n   *\n   * @param {...*} ranges   Zero or more ranges or numbers.\n   * @return {Index}        Returns the created index\n   */\n  return typed(name, {\n    '...number | string | BigNumber | Range | Array | Matrix': function (args) {\n      const ranges = args.map(function (arg) {\n        if (isBigNumber(arg)) {\n          return arg.toNumber() // convert BigNumber to Number\n        } else if (Array.isArray(arg) || isMatrix(arg)) {\n          return arg.map(function (elem) {\n            // convert BigNumber to Number\n            return isBigNumber(elem) ? elem.toNumber() : elem\n          })\n        } else {\n          return arg\n        }\n      })\n\n      const res = new Index()\n      Index.apply(res, ranges)\n      return res\n    }\n  })\n})\n","// Reserved keywords not allowed to use in the parser\nexport const keywords = new Set([\n  'end'\n])\n","import { isNode } from '../../utils/is.js'\n\nimport { keywords } from '../keywords.js'\nimport { deepStrictEqual } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMap } from '../../utils/map.js'\n\nconst name = 'Node'\nconst dependencies = ['mathWithTransform']\n\nexport const createNode = /* #__PURE__ */ factory(name, dependencies, ({ mathWithTransform }) => {\n  /**\n   * Node\n   */\n  function Node () {\n    if (!(this instanceof Node)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n  }\n\n  /**\n   * Evaluate the node\n   * @param {Object} [scope]  Scope to read/write variables\n   * @return {*}              Returns the result\n   */\n  Node.prototype.evaluate = function (scope) {\n    return this.compile().evaluate(scope)\n  }\n\n  Node.prototype.type = 'Node'\n\n  Node.prototype.isNode = true\n\n  Node.prototype.comment = ''\n\n  /**\n   * Compile the node into an optimized, evauatable JavaScript function\n   * @return {{evaluate: function([Object])}} object\n   *                Returns an object with a function 'evaluate',\n   *                which can be invoked as expr.evaluate([scope: Object]),\n   *                where scope is an optional object with\n   *                variables.\n   */\n  Node.prototype.compile = function () {\n    const expr = this._compile(mathWithTransform, {})\n    const args = {}\n    const context = null\n\n    function evaluate (scope) {\n      const s = createMap(scope)\n      _validateScope(s)\n      return expr(s, args, context)\n    }\n\n    return {\n      evaluate\n    }\n  }\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  Node.prototype._compile = function (math, argNames) {\n    throw new Error('Method _compile should be implemented by type ' + this.type)\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  Node.prototype.forEach = function (callback) {\n    // must be implemented by each of the Node implementations\n    throw new Error('Cannot run forEach on a Node interface')\n  }\n\n  /**\n   * Create a new Node having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {OperatorNode} Returns a transformed copy of the node\n   */\n  Node.prototype.map = function (callback) {\n    // must be implemented by each of the Node implementations\n    throw new Error('Cannot run map on a Node interface')\n  }\n\n  /**\n   * Validate whether an object is a Node, for use with map\n   * @param {Node} node\n   * @returns {Node} Returns the input if it's a node, else throws an Error\n   * @protected\n   */\n  Node.prototype._ifNode = function (node) {\n    if (!isNode(node)) {\n      throw new TypeError('Callback function must return a Node')\n    }\n\n    return node\n  }\n\n  /**\n   * Recursively traverse all nodes in a node tree. Executes given callback for\n   * this node and each of its child nodes.\n   * @param {function(node: Node, path: string, parent: Node)} callback\n   *          A callback called for every node in the node tree.\n   */\n  Node.prototype.traverse = function (callback) {\n    // execute callback for itself\n    // eslint-disable-next-line\n    callback(this, null, null)\n\n    // recursively traverse over all childs of a node\n    function _traverse (node, callback) {\n      node.forEach(function (child, path, parent) {\n        callback(child, path, parent)\n        _traverse(child, callback)\n      })\n    }\n\n    _traverse(this, callback)\n  }\n\n  /**\n   * Recursively transform a node tree via a transform function.\n   *\n   * For example, to replace all nodes of type SymbolNode having name 'x' with a\n   * ConstantNode with value 2:\n   *\n   *     const res = Node.transform(function (node, path, parent) {\n   *       if (node && node.isSymbolNode) && (node.name === 'x')) {\n   *         return new ConstantNode(2)\n   *       }\n   *       else {\n   *         return node\n   *       }\n   *     })\n   *\n   * @param {function(node: Node, path: string, parent: Node) : Node} callback\n   *          A mapping function accepting a node, and returning\n   *          a replacement for the node or the original node.\n   *          Signature: callback(node: Node, index: string, parent: Node) : Node\n   * @return {Node} Returns the original node or its replacement\n   */\n  Node.prototype.transform = function (callback) {\n    function _transform (child, path, parent) {\n      const replacement = callback(child, path, parent)\n\n      if (replacement !== child) {\n        // stop iterating when the node is replaced\n        return replacement\n      }\n\n      return child.map(_transform)\n    }\n\n    return _transform(this, null, null)\n  }\n\n  /**\n   * Find any node in the node tree matching given filter function. For example, to\n   * find all nodes of type SymbolNode having name 'x':\n   *\n   *     const results = Node.filter(function (node) {\n   *       return (node && node.isSymbolNode) && (node.name === 'x')\n   *     })\n   *\n   * @param {function(node: Node, path: string, parent: Node) : Node} callback\n   *            A test function returning true when a node matches, and false\n   *            otherwise. Function signature:\n   *            callback(node: Node, index: string, parent: Node) : boolean\n   * @return {Node[]} nodes       An array with nodes matching given filter criteria\n   */\n  Node.prototype.filter = function (callback) {\n    const nodes = []\n\n    this.traverse(function (node, path, parent) {\n      if (callback(node, path, parent)) {\n        nodes.push(node)\n      }\n    })\n\n    return nodes\n  }\n\n  /**\n   * Create a shallow clone of this node\n   * @return {Node}\n   */\n  Node.prototype.clone = function () {\n    // must be implemented by each of the Node implementations\n    throw new Error('Cannot clone a Node interface')\n  }\n\n  /**\n   * Create a deep clone of this node\n   * @return {Node}\n   */\n  Node.prototype.cloneDeep = function () {\n    return this.map(function (node) {\n      return node.cloneDeep()\n    })\n  }\n\n  /**\n   * Deep compare this node with another node.\n   * @param {Node} other\n   * @return {boolean} Returns true when both nodes are of the same type and\n   *                   contain the same values (as do their childs)\n   */\n  Node.prototype.equals = function (other) {\n    return other\n      ? deepStrictEqual(this, other)\n      : false\n  }\n\n  /**\n   * Get string representation. (wrapper function)\n   *\n   * This function can get an object of the following form:\n   * {\n   *    handler: //This can be a callback function of the form\n   *             // \"function callback(node, options)\"or\n   *             // a map that maps function names (used in FunctionNodes)\n   *             // to callbacks\n   *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n   * }\n   *\n   * @param {Object} [options]\n   * @return {string}\n   */\n  Node.prototype.toString = function (options) {\n    const customString = this._getCustomString(options)\n\n    if (typeof customString !== 'undefined') {\n      return customString\n    }\n\n    return this._toString(options)\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * Both .toJSON() and the static .fromJSON(json) should be implemented by all\n   * implementations of Node\n   * @returns {Object}\n   */\n  Node.prototype.toJSON = function () {\n    throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type)\n  }\n\n  /**\n   * Get HTML representation. (wrapper function)\n   *\n   * This function can get an object of the following form:\n   * {\n   *    handler: //This can be a callback function of the form\n   *             // \"function callback(node, options)\" or\n   *             // a map that maps function names (used in FunctionNodes)\n   *             // to callbacks\n   *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n   * }\n   *\n   * @param {Object} [options]\n   * @return {string}\n   */\n  Node.prototype.toHTML = function (options) {\n    const customString = this._getCustomString(options)\n\n    if (typeof customString !== 'undefined') {\n      return customString\n    }\n\n    return this.toHTML(options)\n  }\n\n  /**\n   * Internal function to generate the string output.\n   * This has to be implemented by every Node\n   *\n   * @throws {Error}\n   */\n  Node.prototype._toString = function () {\n    // must be implemented by each of the Node implementations\n    throw new Error('_toString not implemented for ' + this.type)\n  }\n\n  /**\n   * Get LaTeX representation. (wrapper function)\n   *\n   * This function can get an object of the following form:\n   * {\n   *    handler: //This can be a callback function of the form\n   *             // \"function callback(node, options)\"or\n   *             // a map that maps function names (used in FunctionNodes)\n   *             // to callbacks\n   *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n   * }\n   *\n   * @param {Object} [options]\n   * @return {string}\n   */\n  Node.prototype.toTex = function (options) {\n    const customString = this._getCustomString(options)\n\n    if (typeof customString !== 'undefined') {\n      return customString\n    }\n\n    return this._toTex(options)\n  }\n\n  /**\n   * Internal function to generate the LaTeX output.\n   * This has to be implemented by every Node\n   *\n   * @param {Object} [options]\n   * @throws {Error}\n   */\n  Node.prototype._toTex = function (options) {\n    // must be implemented by each of the Node implementations\n    throw new Error('_toTex not implemented for ' + this.type)\n  }\n\n  /**\n   * Helper used by `to...` functions.\n   */\n  Node.prototype._getCustomString = function (options) {\n    if (options && typeof options === 'object') {\n      switch (typeof options.handler) {\n        case 'object':\n        case 'undefined':\n          return\n        case 'function':\n          return options.handler(this, options)\n        default:\n          throw new TypeError('Object or function expected as callback')\n      }\n    }\n  }\n\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n  Node.prototype.getIdentifier = function () {\n    return this.type\n  }\n\n  /**\n   * Get the content of the current Node.\n   * @return {Node} node\n   **/\n  Node.prototype.getContent = function () {\n    return this\n  }\n\n  /**\n   * Validate the symbol names of a scope.\n   * Throws an error when the scope contains an illegal symbol.\n   * @param {Object} scope\n   */\n  function _validateScope (scope) {\n    for (const symbol of [...keywords]) {\n      if (scope.has(symbol)) {\n        throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword')\n      }\n    }\n  }\n\n  return Node\n}, { isClass: true, isNode: true })\n","import { IndexError } from '../../../error/IndexError.js'\n\n/**\n * Transform zero-based indices to one-based indices in errors\n * @param {Error} err\n * @returns {Error | IndexError} Returns the transformed error\n */\nexport function errorTransform (err) {\n  if (err && err.isIndexError) {\n    return new IndexError(\n      err.index + 1,\n      err.min + 1,\n      err.max !== undefined ? err.max + 1 : undefined)\n  }\n\n  return err\n}\n","import { errorTransform } from '../../transform/utils/errorTransform.js'\nimport { getSafeProperty } from '../../../utils/customs.js'\n\nexport function accessFactory ({ subset }) {\n  /**\n   * Retrieve part of an object:\n   *\n   * - Retrieve a property from an object\n   * - Retrieve a part of a string\n   * - Retrieve a matrix subset\n   *\n   * @param {Object | Array | Matrix | string} object\n   * @param {Index} index\n   * @return {Object | Array | Matrix | string} Returns the subset\n   */\n  return function access (object, index) {\n    try {\n      if (Array.isArray(object)) {\n        return subset(object, index)\n      } else if (object && typeof object.subset === 'function') { // Matrix\n        return object.subset(index)\n      } else if (typeof object === 'string') {\n        // TODO: move getStringSubset into a separate util file, use that\n        return subset(object, index)\n      } else if (typeof object === 'object') {\n        if (!index.isObjectProperty()) {\n          throw new TypeError('Cannot apply a numeric index as object property')\n        }\n\n        return getSafeProperty(object, index.getObjectProperty())\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object')\n      }\n    } catch (err) {\n      throw errorTransform(err)\n    }\n  }\n}\n","import {\n  isAccessorNode,\n  isArrayNode,\n  isConstantNode,\n  isFunctionNode,\n  isIndexNode,\n  isNode,\n  isObjectNode,\n  isParenthesisNode,\n  isSymbolNode\n} from '../../utils/is.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { accessFactory } from './utils/access.js'\n\nconst name = 'AccessorNode'\nconst dependencies = [\n  'subset',\n  'Node'\n]\n\nexport const createAccessorNode = /* #__PURE__ */ factory(name, dependencies, ({ subset, Node }) => {\n  const access = accessFactory({ subset })\n\n  /**\n   * @constructor AccessorNode\n   * @extends {Node}\n   * Access an object property or get a matrix subset\n   *\n   * @param {Node} object                 The object from which to retrieve\n   *                                      a property or subset.\n   * @param {IndexNode} index             IndexNode containing ranges\n   */\n  function AccessorNode (object, index) {\n    if (!(this instanceof AccessorNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    if (!isNode(object)) {\n      throw new TypeError('Node expected for parameter \"object\"')\n    }\n    if (!isIndexNode(index)) {\n      throw new TypeError('IndexNode expected for parameter \"index\"')\n    }\n\n    this.object = object || null\n    this.index = index\n\n    // readonly property name\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return (this.index.isObjectProperty())\n            ? this.index.getObjectProperty()\n            : ''\n        } else {\n          return this.object.name || ''\n        }\n      }.bind(this),\n      set: function () {\n        throw new Error('Cannot assign a new name, name is read-only')\n      }\n    })\n  }\n\n  AccessorNode.prototype = new Node()\n\n  AccessorNode.prototype.type = 'AccessorNode'\n\n  AccessorNode.prototype.isAccessorNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  AccessorNode.prototype._compile = function (math, argNames) {\n    const evalObject = this.object._compile(math, argNames)\n    const evalIndex = this.index._compile(math, argNames)\n\n    if (this.index.isObjectProperty()) {\n      const prop = this.index.getObjectProperty()\n      return function evalAccessorNode (scope, args, context) {\n        // get a property from an object evaluated using the scope.\n        return getSafeProperty(evalObject(scope, args, context), prop)\n      }\n    } else {\n      return function evalAccessorNode (scope, args, context) {\n        const object = evalObject(scope, args, context)\n        const index = evalIndex(scope, args, object) // we pass object here instead of context\n        return access(object, index)\n      }\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  AccessorNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this)\n    callback(this.index, 'index', this)\n  }\n\n  /**\n   * Create a new AccessorNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {AccessorNode} Returns a transformed copy of the node\n   */\n  AccessorNode.prototype.map = function (callback) {\n    return new AccessorNode(\n      this._ifNode(callback(this.object, 'object', this)),\n      this._ifNode(callback(this.index, 'index', this))\n    )\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AccessorNode}\n   */\n  AccessorNode.prototype.clone = function () {\n    return new AccessorNode(this.object, this.index)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n  AccessorNode.prototype._toString = function (options) {\n    let object = this.object.toString(options)\n    if (needParenthesis(this.object)) {\n      object = '(' + object + ')'\n    }\n\n    return object + this.index.toString(options)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n  AccessorNode.prototype.toHTML = function (options) {\n    let object = this.object.toHTML(options)\n    if (needParenthesis(this.object)) {\n      object = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + object + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n\n    return object + this.index.toHTML(options)\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n  AccessorNode.prototype._toTex = function (options) {\n    let object = this.object.toTex(options)\n    if (needParenthesis(this.object)) {\n      object = '\\\\left(\\' + object + \\'\\\\right)'\n    }\n\n    return object + this.index.toTex(options)\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  AccessorNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'AccessorNode',\n      object: this.object,\n      index: this.index\n    }\n  }\n\n  /**\n   * Instantiate an AccessorNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"AccessorNode\", object: ..., index: ...}`,\n   *                       where mathjs is optional\n   * @returns {AccessorNode}\n   */\n  AccessorNode.fromJSON = function (json) {\n    return new AccessorNode(json.object, json.index)\n  }\n\n  /**\n   * Are parenthesis needed?\n   * @private\n   */\n  function needParenthesis (node) {\n    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n    return !(\n      isAccessorNode(node) ||\n        isArrayNode(node) ||\n        isConstantNode(node) ||\n        isFunctionNode(node) ||\n        isObjectNode(node) ||\n        isParenthesisNode(node) ||\n        isSymbolNode(node))\n  }\n\n  return AccessorNode\n}, { isClass: true, isNode: true })\n","import { isArrayNode, isNode } from '../../utils/is.js'\nimport { map } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ArrayNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createArrayNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * @constructor ArrayNode\n   * @extends {Node}\n   * Holds an 1-dimensional array with items\n   * @param {Node[]} [items]   1 dimensional array with items\n   */\n  function ArrayNode (items) {\n    if (!(this instanceof ArrayNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this.items = items || []\n\n    // validate input\n    if (!Array.isArray(this.items) || !this.items.every(isNode)) {\n      throw new TypeError('Array containing Nodes expected')\n    }\n  }\n\n  ArrayNode.prototype = new Node()\n\n  ArrayNode.prototype.type = 'ArrayNode'\n\n  ArrayNode.prototype.isArrayNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  ArrayNode.prototype._compile = function (math, argNames) {\n    const evalItems = map(this.items, function (item) {\n      return item._compile(math, argNames)\n    })\n\n    const asMatrix = (math.config.matrix !== 'Array')\n    if (asMatrix) {\n      const matrix = math.matrix\n      return function evalArrayNode (scope, args, context) {\n        return matrix(map(evalItems, function (evalItem) {\n          return evalItem(scope, args, context)\n        }))\n      }\n    } else {\n      return function evalArrayNode (scope, args, context) {\n        return map(evalItems, function (evalItem) {\n          return evalItem(scope, args, context)\n        })\n      }\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  ArrayNode.prototype.forEach = function (callback) {\n    for (let i = 0; i < this.items.length; i++) {\n      const node = this.items[i]\n      callback(node, 'items[' + i + ']', this)\n    }\n  }\n\n  /**\n   * Create a new ArrayNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {ArrayNode} Returns a transformed copy of the node\n   */\n  ArrayNode.prototype.map = function (callback) {\n    const items = []\n    for (let i = 0; i < this.items.length; i++) {\n      items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this))\n    }\n    return new ArrayNode(items)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ArrayNode}\n   */\n  ArrayNode.prototype.clone = function () {\n    return new ArrayNode(this.items.slice(0))\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  ArrayNode.prototype._toString = function (options) {\n    const items = this.items.map(function (node) {\n      return node.toString(options)\n    })\n    return '[' + items.join(', ') + ']'\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  ArrayNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ArrayNode',\n      items: this.items\n    }\n  }\n\n  /**\n   * Instantiate an ArrayNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ArrayNode\", items: [...]}`,\n   *                       where mathjs is optional\n   * @returns {ArrayNode}\n   */\n  ArrayNode.fromJSON = function (json) {\n    return new ArrayNode(json.items)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  ArrayNode.prototype.toHTML = function (options) {\n    const items = this.items.map(function (node) {\n      return node.toHTML(options)\n    })\n    return '<span class=\"math-parenthesis math-square-parenthesis\">[</span>' + items.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-square-parenthesis\">]</span>'\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ArrayNode.prototype._toTex = function (options) {\n    function itemsToTex (items, nested) {\n      const mixedItems = items.some(isArrayNode) && !items.every(isArrayNode)\n      const itemsFormRow = nested || mixedItems\n      const itemSep = itemsFormRow ? '&' : '\\\\\\\\'\n      const itemsTex = items\n        .map(function (node) {\n          if (node.items) {\n            return itemsToTex(node.items, !nested)\n          } else {\n            return node.toTex(options)\n          }\n        })\n        .join(itemSep)\n      return mixedItems || !itemsFormRow || (itemsFormRow && !nested)\n        ? '\\\\begin{bmatrix}' + itemsTex + '\\\\end{bmatrix}'\n        : itemsTex\n    }\n    return itemsToTex(this.items, false)\n  }\n\n  return ArrayNode\n}, { isClass: true, isNode: true })\n","// list of identifiers of nodes in order of their precedence\n// also contains information about left/right associativity\n// and which other operator the operator is associative with\n// Example:\n// addition is associative with addition and subtraction, because:\n// (a+b)+c=a+(b+c)\n// (a+b)-c=a+(b-c)\n//\n// postfix operators are left associative, prefix operators\n// are right associative\n//\n// It's also possible to set the following properties:\n// latexParens: if set to false, this node doesn't need to be enclosed\n//              in parentheses when using LaTeX\n// latexLeftParens: if set to false, this !OperatorNode's!\n//                  left argument doesn't need to be enclosed\n//                  in parentheses\n// latexRightParens: the same for the right argument\nimport { hasOwnProperty } from '../utils/object.js'\n\nexport const properties = [\n  { // assignment\n    AssignmentNode: {},\n    FunctionAssignmentNode: {}\n  },\n  { // conditional expression\n    ConditionalNode: {\n      latexLeftParens: false,\n      latexRightParens: false,\n      latexParens: false\n      // conditionals don't need parentheses in LaTeX because\n      // they are 2 dimensional\n    }\n  },\n  { // logical or\n    'OperatorNode:or': {\n      associativity: 'left',\n      associativeWith: []\n    }\n\n  },\n  { // logical xor\n    'OperatorNode:xor': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // logical and\n    'OperatorNode:and': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitwise or\n    'OperatorNode:bitOr': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitwise xor\n    'OperatorNode:bitXor': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitwise and\n    'OperatorNode:bitAnd': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // relational operators\n    'OperatorNode:equal': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:unequal': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:smaller': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:larger': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:smallerEq': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:largerEq': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    RelationalNode: {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitshift operators\n    'OperatorNode:leftShift': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:rightArithShift': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:rightLogShift': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // unit conversion\n    'OperatorNode:to': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // range\n    RangeNode: {}\n  },\n  { // addition, subtraction\n    'OperatorNode:add': {\n      associativity: 'left',\n      associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']\n    },\n    'OperatorNode:subtract': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // multiply, divide, modulus\n    'OperatorNode:multiply': {\n      associativity: 'left',\n      associativeWith: [\n        'OperatorNode:multiply',\n        'OperatorNode:divide',\n        'Operator:dotMultiply',\n        'Operator:dotDivide'\n      ]\n    },\n    'OperatorNode:divide': {\n      associativity: 'left',\n      associativeWith: [],\n      latexLeftParens: false,\n      latexRightParens: false,\n      latexParens: false\n      // fractions don't require parentheses because\n      // they're 2 dimensional, so parens aren't needed\n      // in LaTeX\n    },\n    'OperatorNode:dotMultiply': {\n      associativity: 'left',\n      associativeWith: [\n        'OperatorNode:multiply',\n        'OperatorNode:divide',\n        'OperatorNode:dotMultiply',\n        'OperatorNode:doDivide'\n      ]\n    },\n    'OperatorNode:dotDivide': {\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:mod': {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // unary prefix operators\n    'OperatorNode:unaryPlus': {\n      associativity: 'right'\n    },\n    'OperatorNode:unaryMinus': {\n      associativity: 'right'\n    },\n    'OperatorNode:bitNot': {\n      associativity: 'right'\n    },\n    'OperatorNode:not': {\n      associativity: 'right'\n    }\n  },\n  { // exponentiation\n    'OperatorNode:pow': {\n      associativity: 'right',\n      associativeWith: [],\n      latexRightParens: false\n      // the exponent doesn't need parentheses in\n      // LaTeX because it's 2 dimensional\n      // (it's on top)\n    },\n    'OperatorNode:dotPow': {\n      associativity: 'right',\n      associativeWith: []\n    }\n  },\n  { // factorial\n    'OperatorNode:factorial': {\n      associativity: 'left'\n    }\n  },\n  { // matrix transpose\n    'OperatorNode:transpose': {\n      associativity: 'left'\n    }\n  }\n]\n\n/**\n * Get the precedence of a Node.\n * Higher number for higher precedence, starting with 0.\n * Returns null if the precedence is undefined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {number | null}\n */\nexport function getPrecedence (_node, parenthesis) {\n  let node = _node\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent()\n  }\n  const identifier = node.getIdentifier()\n  for (let i = 0; i < properties.length; i++) {\n    if (identifier in properties[i]) {\n      return i\n    }\n  }\n  return null\n}\n\n/**\n * Get the associativity of an operator (left or right).\n * Returns a string containing 'left' or 'right' or null if\n * the associativity is not defined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {string|null}\n * @throws {Error}\n */\nexport function getAssociativity (_node, parenthesis) {\n  let node = _node\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent()\n  }\n  const identifier = node.getIdentifier()\n  const index = getPrecedence(node, parenthesis)\n  if (index === null) {\n    // node isn't in the list\n    return null\n  }\n  const property = properties[index][identifier]\n\n  if (hasOwnProperty(property, 'associativity')) {\n    if (property.associativity === 'left') {\n      return 'left'\n    }\n    if (property.associativity === 'right') {\n      return 'right'\n    }\n    // associativity is invalid\n    throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' +\n                property.associativity + '\\'.')\n  }\n\n  // associativity is undefined\n  return null\n}\n\n/**\n * Check if an operator is associative with another operator.\n * Returns either true or false or null if not defined.\n *\n * @param {Node} nodeA\n * @param {Node} nodeB\n * @param {string} parenthesis\n * @return {boolean | null}\n */\nexport function isAssociativeWith (nodeA, nodeB, parenthesis) {\n  // ParenthesisNodes are only ignored when not in 'keep' mode\n  const a = (parenthesis !== 'keep') ? nodeA.getContent() : nodeA\n  const b = (parenthesis !== 'keep') ? nodeA.getContent() : nodeB\n  const identifierA = a.getIdentifier()\n  const identifierB = b.getIdentifier()\n  const index = getPrecedence(a, parenthesis)\n  if (index === null) {\n    // node isn't in the list\n    return null\n  }\n  const property = properties[index][identifierA]\n\n  if (hasOwnProperty(property, 'associativeWith') &&\n      (property.associativeWith instanceof Array)) {\n    for (let i = 0; i < property.associativeWith.length; i++) {\n      if (property.associativeWith[i] === identifierB) {\n        return true\n      }\n    }\n    return false\n  }\n\n  // associativeWith is not defined\n  return null\n}\n","import { isAccessorNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js'\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { accessFactory } from './utils/access.js'\nimport { assignFactory } from './utils/assign.js'\nimport { getPrecedence } from '../operators.js'\n\nconst name = 'AssignmentNode'\nconst dependencies = [\n  'subset',\n  '?matrix', // FIXME: should not be needed at all, should be handled by subset\n  'Node'\n]\n\nexport const createAssignmentNode = /* #__PURE__ */ factory(name, dependencies, ({ subset, matrix, Node }) => {\n  const access = accessFactory({ subset })\n  const assign = assignFactory({ subset, matrix })\n\n  /**\n   * @constructor AssignmentNode\n   * @extends {Node}\n   *\n   * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or\n   * replace a subset of a matrix like `A[2,2]=42`.\n   *\n   * Syntax:\n   *\n   *     new AssignmentNode(symbol, value)\n   *     new AssignmentNode(object, index, value)\n   *\n   * Usage:\n   *\n   *    new AssignmentNode(new SymbolNode('a'), new ConstantNode(2))                       // a=2\n   *    new AssignmentNode(new SymbolNode('a'), new IndexNode('b'), new ConstantNode(2))   // a.b=2\n   *    new AssignmentNode(new SymbolNode('a'), new IndexNode(1, 2), new ConstantNode(3))  // a[1,2]=3\n   *\n   * @param {SymbolNode | AccessorNode} object  Object on which to assign a value\n   * @param {IndexNode} [index=null]            Index, property name or matrix\n   *                                            index. Optional. If not provided\n   *                                            and `object` is a SymbolNode,\n   *                                            the property is assigned to the\n   *                                            global scope.\n   * @param {Node} value                        The value to be assigned\n   */\n  function AssignmentNode (object, index, value) {\n    if (!(this instanceof AssignmentNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this.object = object\n    this.index = value ? index : null\n    this.value = value || index\n\n    // validate input\n    if (!isSymbolNode(object) && !isAccessorNode(object)) {\n      throw new TypeError('SymbolNode or AccessorNode expected as \"object\"')\n    }\n    if (isSymbolNode(object) && object.name === 'end') {\n      throw new Error('Cannot assign to symbol \"end\"')\n    }\n    if (this.index && !isIndexNode(this.index)) { // index is optional\n      throw new TypeError('IndexNode expected as \"index\"')\n    }\n    if (!isNode(this.value)) {\n      throw new TypeError('Node expected as \"value\"')\n    }\n\n    // readonly property name\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return (this.index.isObjectProperty())\n            ? this.index.getObjectProperty()\n            : ''\n        } else {\n          return this.object.name || ''\n        }\n      }.bind(this),\n      set: function () {\n        throw new Error('Cannot assign a new name, name is read-only')\n      }\n    })\n  }\n\n  AssignmentNode.prototype = new Node()\n\n  AssignmentNode.prototype.type = 'AssignmentNode'\n\n  AssignmentNode.prototype.isAssignmentNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  AssignmentNode.prototype._compile = function (math, argNames) {\n    const evalObject = this.object._compile(math, argNames)\n    const evalIndex = this.index ? this.index._compile(math, argNames) : null\n    const evalValue = this.value._compile(math, argNames)\n    const name = this.object.name\n\n    if (!this.index) {\n      // apply a variable to the scope, for example `a=2`\n      if (!isSymbolNode(this.object)) {\n        throw new TypeError('SymbolNode expected as object')\n      }\n\n      return function evalAssignmentNode (scope, args, context) {\n        const value = evalValue(scope, args, context)\n        scope.set(name, value)\n        return value\n      }\n    } else if (this.index.isObjectProperty()) {\n      // apply an object property for example `a.b=2`\n      const prop = this.index.getObjectProperty()\n\n      return function evalAssignmentNode (scope, args, context) {\n        const object = evalObject(scope, args, context)\n        const value = evalValue(scope, args, context)\n        setSafeProperty(object, prop, value)\n        return value\n      }\n    } else if (isSymbolNode(this.object)) {\n      // update a matrix subset, for example `a[2]=3`\n      return function evalAssignmentNode (scope, args, context) {\n        const childObject = evalObject(scope, args, context)\n        const value = evalValue(scope, args, context)\n        const index = evalIndex(scope, args, childObject) // Important:  we pass childObject instead of context\n        scope.set(name, assign(childObject, index, value))\n        return value\n      }\n    } else { // isAccessorNode(node.object) === true\n      // update a matrix subset, for example `a.b[2]=3`\n\n      // we will not use the compile function of the AccessorNode, but compile it\n      // ourselves here as we need the parent object of the AccessorNode:\n      // wee need to apply the updated object to parent object\n      const evalParentObject = this.object.object._compile(math, argNames)\n\n      if (this.object.index.isObjectProperty()) {\n        const parentProp = this.object.index.getObjectProperty()\n\n        return function evalAssignmentNode (scope, args, context) {\n          const parent = evalParentObject(scope, args, context)\n          const childObject = getSafeProperty(parent, parentProp)\n          const index = evalIndex(scope, args, childObject) // Important: we pass childObject instead of context\n          const value = evalValue(scope, args, context)\n          setSafeProperty(parent, parentProp, assign(childObject, index, value))\n          return value\n        }\n      } else {\n        // if some parameters use the 'end' parameter, we need to calculate the size\n        const evalParentIndex = this.object.index._compile(math, argNames)\n\n        return function evalAssignmentNode (scope, args, context) {\n          const parent = evalParentObject(scope, args, context)\n          const parentIndex = evalParentIndex(scope, args, parent) // Important: we pass parent instead of context\n          const childObject = access(parent, parentIndex)\n          const index = evalIndex(scope, args, childObject) // Important:  we pass childObject instead of context\n          const value = evalValue(scope, args, context)\n\n          assign(parent, parentIndex, assign(childObject, index, value))\n\n          return value\n        }\n      }\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  AssignmentNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this)\n    if (this.index) {\n      callback(this.index, 'index', this)\n    }\n    callback(this.value, 'value', this)\n  }\n\n  /**\n   * Create a new AssignmentNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {AssignmentNode} Returns a transformed copy of the node\n   */\n  AssignmentNode.prototype.map = function (callback) {\n    const object = this._ifNode(callback(this.object, 'object', this))\n    const index = this.index\n      ? this._ifNode(callback(this.index, 'index', this))\n      : null\n    const value = this._ifNode(callback(this.value, 'value', this))\n\n    return new AssignmentNode(object, index, value)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AssignmentNode}\n   */\n  AssignmentNode.prototype.clone = function () {\n    return new AssignmentNode(this.object, this.index, this.value)\n  }\n\n  /*\n   * Is parenthesis needed?\n   * @param {node} node\n   * @param {string} [parenthesis='keep']\n   * @private\n   */\n  function needParenthesis (node, parenthesis) {\n    if (!parenthesis) {\n      parenthesis = 'keep'\n    }\n\n    const precedence = getPrecedence(node, parenthesis)\n    const exprPrecedence = getPrecedence(node.value, parenthesis)\n    return (parenthesis === 'all') ||\n      ((exprPrecedence !== null) && (exprPrecedence <= precedence))\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n  AssignmentNode.prototype._toString = function (options) {\n    const object = this.object.toString(options)\n    const index = this.index ? this.index.toString(options) : ''\n    let value = this.value.toString(options)\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = '(' + value + ')'\n    }\n\n    return object + index + ' = ' + value\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  AssignmentNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'AssignmentNode',\n      object: this.object,\n      index: this.index,\n      value: this.value\n    }\n  }\n\n  /**\n   * Instantiate an AssignmentNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"AssignmentNode\", object: ..., index: ..., value: ...}`,\n   *                       where mathjs is optional\n   * @returns {AssignmentNode}\n   */\n  AssignmentNode.fromJSON = function (json) {\n    return new AssignmentNode(json.object, json.index, json.value)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n  AssignmentNode.prototype.toHTML = function (options) {\n    const object = this.object.toHTML(options)\n    const index = this.index ? this.index.toHTML(options) : ''\n    let value = this.value.toHTML(options)\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = '<span class=\"math-paranthesis math-round-parenthesis\">(</span>' + value + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>'\n    }\n\n    return object + index + '<span class=\"math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator\">=</span>' + value\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n  AssignmentNode.prototype._toTex = function (options) {\n    const object = this.object.toTex(options)\n    const index = this.index ? this.index.toTex(options) : ''\n    let value = this.value.toTex(options)\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = `\\\\left(${value}\\\\right)`\n    }\n\n    return object + index + ':=' + value\n  }\n\n  return AssignmentNode\n}, { isClass: true, isNode: true })\n","import { errorTransform } from '../../transform/utils/errorTransform.js'\nimport { setSafeProperty } from '../../../utils/customs.js'\n\nexport function assignFactory ({ subset, matrix }) {\n  /**\n   * Replace part of an object:\n   *\n   * - Assign a property to an object\n   * - Replace a part of a string\n   * - Replace a matrix subset\n   *\n   * @param {Object | Array | Matrix | string} object\n   * @param {Index} index\n   * @param {*} value\n   * @return {Object | Array | Matrix | string} Returns the original object\n   *                                            except in case of a string\n   */\n  // TODO: change assign to return the value instead of the object\n  return function assign (object, index, value) {\n    try {\n      if (Array.isArray(object)) {\n        // we use matrix.subset here instead of the function subset because we must not clone the contents\n        return matrix(object).subset(index, value).valueOf()\n      } else if (object && typeof object.subset === 'function') { // Matrix\n        return object.subset(index, value)\n      } else if (typeof object === 'string') {\n        // TODO: move setStringSubset into a separate util file, use that\n        return subset(object, index, value)\n      } else if (typeof object === 'object') {\n        if (!index.isObjectProperty()) {\n          throw TypeError('Cannot apply a numeric index as object property')\n        }\n        setSafeProperty(object, index.getObjectProperty(), value)\n        return object\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object')\n      }\n    } catch (err) {\n      throw errorTransform(err)\n    }\n  }\n}\n","import { isNode } from '../../utils/is.js'\nimport { forEach, map } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'BlockNode'\nconst dependencies = [\n  'ResultSet',\n  'Node'\n]\n\nexport const createBlockNode = /* #__PURE__ */ factory(name, dependencies, ({ ResultSet, Node }) => {\n  /**\n   * @constructor BlockNode\n   * @extends {Node}\n   * Holds a set with blocks\n   * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks\n   *            An array with blocks, where a block is constructed as an Object\n   *            with properties block, which is a Node, and visible, which is\n   *            a boolean. The property visible is optional and is true by default\n   */\n  function BlockNode (blocks) {\n    if (!(this instanceof BlockNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    // validate input, copy blocks\n    if (!Array.isArray(blocks)) throw new Error('Array expected')\n    this.blocks = blocks.map(function (block) {\n      const node = block && block.node\n      const visible = block && block.visible !== undefined ? block.visible : true\n\n      if (!isNode(node)) throw new TypeError('Property \"node\" must be a Node')\n      if (typeof visible !== 'boolean') throw new TypeError('Property \"visible\" must be a boolean')\n\n      return {\n        node: node,\n        visible: visible\n      }\n    })\n  }\n\n  BlockNode.prototype = new Node()\n\n  BlockNode.prototype.type = 'BlockNode'\n\n  BlockNode.prototype.isBlockNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  BlockNode.prototype._compile = function (math, argNames) {\n    const evalBlocks = map(this.blocks, function (block) {\n      return {\n        evaluate: block.node._compile(math, argNames),\n        visible: block.visible\n      }\n    })\n\n    return function evalBlockNodes (scope, args, context) {\n      const results = []\n\n      forEach(evalBlocks, function evalBlockNode (block) {\n        const result = block.evaluate(scope, args, context)\n        if (block.visible) {\n          results.push(result)\n        }\n      })\n\n      return new ResultSet(results)\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child blocks of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  BlockNode.prototype.forEach = function (callback) {\n    for (let i = 0; i < this.blocks.length; i++) {\n      callback(this.blocks[i].node, 'blocks[' + i + '].node', this)\n    }\n  }\n\n  /**\n   * Create a new BlockNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {BlockNode} Returns a transformed copy of the node\n   */\n  BlockNode.prototype.map = function (callback) {\n    const blocks = []\n    for (let i = 0; i < this.blocks.length; i++) {\n      const block = this.blocks[i]\n      const node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this))\n      blocks[i] = {\n        node: node,\n        visible: block.visible\n      }\n    }\n    return new BlockNode(blocks)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {BlockNode}\n   */\n  BlockNode.prototype.clone = function () {\n    const blocks = this.blocks.map(function (block) {\n      return {\n        node: block.node,\n        visible: block.visible\n      }\n    })\n\n    return new BlockNode(blocks)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  BlockNode.prototype._toString = function (options) {\n    return this.blocks.map(function (param) {\n      return param.node.toString(options) + (param.visible ? '' : ';')\n    }).join('\\n')\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  BlockNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'BlockNode',\n      blocks: this.blocks\n    }\n  }\n\n  /**\n   * Instantiate an BlockNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"BlockNode\", blocks: [{node: ..., visible: false}, ...]}`,\n   *                       where mathjs is optional\n   * @returns {BlockNode}\n   */\n  BlockNode.fromJSON = function (json) {\n    return new BlockNode(json.blocks)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  BlockNode.prototype.toHTML = function (options) {\n    return this.blocks.map(function (param) {\n      return param.node.toHTML(options) + (param.visible ? '' : '<span class=\"math-separator\">;</span>')\n    }).join('<span class=\"math-separator\"><br /></span>')\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  BlockNode.prototype._toTex = function (options) {\n    return this.blocks.map(function (param) {\n      return param.node.toTex(options) + (param.visible ? '' : ';')\n    }).join('\\\\;\\\\;\\n')\n  }\n\n  return BlockNode\n}, { isClass: true, isNode: true })\n","import { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { getPrecedence } from '../operators.js'\n\nconst name = 'ConditionalNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createConditionalNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'\n   *\n   * @param {Node} condition   Condition, must result in a boolean\n   * @param {Node} trueExpr    Expression evaluated when condition is true\n   * @param {Node} falseExpr   Expression evaluated when condition is true\n   *\n   * @constructor ConditionalNode\n   * @extends {Node}\n   */\n  function ConditionalNode (condition, trueExpr, falseExpr) {\n    if (!(this instanceof ConditionalNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n    if (!isNode(condition)) throw new TypeError('Parameter condition must be a Node')\n    if (!isNode(trueExpr)) throw new TypeError('Parameter trueExpr must be a Node')\n    if (!isNode(falseExpr)) throw new TypeError('Parameter falseExpr must be a Node')\n\n    this.condition = condition\n    this.trueExpr = trueExpr\n    this.falseExpr = falseExpr\n  }\n\n  ConditionalNode.prototype = new Node()\n\n  ConditionalNode.prototype.type = 'ConditionalNode'\n\n  ConditionalNode.prototype.isConditionalNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  ConditionalNode.prototype._compile = function (math, argNames) {\n    const evalCondition = this.condition._compile(math, argNames)\n    const evalTrueExpr = this.trueExpr._compile(math, argNames)\n    const evalFalseExpr = this.falseExpr._compile(math, argNames)\n\n    return function evalConditionalNode (scope, args, context) {\n      return testCondition(evalCondition(scope, args, context))\n        ? evalTrueExpr(scope, args, context)\n        : evalFalseExpr(scope, args, context)\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  ConditionalNode.prototype.forEach = function (callback) {\n    callback(this.condition, 'condition', this)\n    callback(this.trueExpr, 'trueExpr', this)\n    callback(this.falseExpr, 'falseExpr', this)\n  }\n\n  /**\n   * Create a new ConditionalNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {ConditionalNode} Returns a transformed copy of the node\n   */\n  ConditionalNode.prototype.map = function (callback) {\n    return new ConditionalNode(\n      this._ifNode(callback(this.condition, 'condition', this)),\n      this._ifNode(callback(this.trueExpr, 'trueExpr', this)),\n      this._ifNode(callback(this.falseExpr, 'falseExpr', this))\n    )\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConditionalNode}\n   */\n  ConditionalNode.prototype.clone = function () {\n    return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ConditionalNode.prototype._toString = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const precedence = getPrecedence(this, parenthesis)\n\n    // Enclose Arguments in parentheses if they are an OperatorNode\n    // or have lower or equal precedence\n    // NOTE: enclosing all OperatorNodes in parentheses is a decision\n    // purely based on aesthetics and readability\n    let condition = this.condition.toString(options)\n    const conditionPrecedence = getPrecedence(this.condition, parenthesis)\n    if ((parenthesis === 'all') ||\n        (this.condition.type === 'OperatorNode') ||\n        ((conditionPrecedence !== null) && (conditionPrecedence <= precedence))) {\n      condition = '(' + condition + ')'\n    }\n\n    let trueExpr = this.trueExpr.toString(options)\n    const truePrecedence = getPrecedence(this.trueExpr, parenthesis)\n    if ((parenthesis === 'all') ||\n        (this.trueExpr.type === 'OperatorNode') ||\n        ((truePrecedence !== null) && (truePrecedence <= precedence))) {\n      trueExpr = '(' + trueExpr + ')'\n    }\n\n    let falseExpr = this.falseExpr.toString(options)\n    const falsePrecedence = getPrecedence(this.falseExpr, parenthesis)\n    if ((parenthesis === 'all') ||\n        (this.falseExpr.type === 'OperatorNode') ||\n        ((falsePrecedence !== null) && (falsePrecedence <= precedence))) {\n      falseExpr = '(' + falseExpr + ')'\n    }\n    return condition + ' ? ' + trueExpr + ' : ' + falseExpr\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  ConditionalNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ConditionalNode',\n      condition: this.condition,\n      trueExpr: this.trueExpr,\n      falseExpr: this.falseExpr\n    }\n  }\n\n  /**\n   * Instantiate an ConditionalNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ConditionalNode\", \"condition\": ..., \"trueExpr\": ..., \"falseExpr\": ...}`,\n   *                       where mathjs is optional\n   * @returns {ConditionalNode}\n   */\n  ConditionalNode.fromJSON = function (json) {\n    return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ConditionalNode.prototype.toHTML = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const precedence = getPrecedence(this, parenthesis)\n\n    // Enclose Arguments in parentheses if they are an OperatorNode\n    // or have lower or equal precedence\n    // NOTE: enclosing all OperatorNodes in parentheses is a decision\n    // purely based on aesthetics and readability\n    let condition = this.condition.toHTML(options)\n    const conditionPrecedence = getPrecedence(this.condition, parenthesis)\n    if ((parenthesis === 'all') ||\n        (this.condition.type === 'OperatorNode') ||\n        ((conditionPrecedence !== null) && (conditionPrecedence <= precedence))) {\n      condition = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + condition + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n\n    let trueExpr = this.trueExpr.toHTML(options)\n    const truePrecedence = getPrecedence(this.trueExpr, parenthesis)\n    if ((parenthesis === 'all') ||\n        (this.trueExpr.type === 'OperatorNode') ||\n        ((truePrecedence !== null) && (truePrecedence <= precedence))) {\n      trueExpr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + trueExpr + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n\n    let falseExpr = this.falseExpr.toHTML(options)\n    const falsePrecedence = getPrecedence(this.falseExpr, parenthesis)\n    if ((parenthesis === 'all') ||\n        (this.falseExpr.type === 'OperatorNode') ||\n        ((falsePrecedence !== null) && (falsePrecedence <= precedence))) {\n      falseExpr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + falseExpr + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n    return condition + '<span class=\"math-operator math-conditional-operator\">?</span>' + trueExpr + '<span class=\"math-operator math-conditional-operator\">:</span>' + falseExpr\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ConditionalNode.prototype._toTex = function (options) {\n    return '\\\\begin{cases} {' +\n        this.trueExpr.toTex(options) + '}, &\\\\quad{\\\\text{if }\\\\;' +\n        this.condition.toTex(options) +\n        '}\\\\\\\\{' + this.falseExpr.toTex(options) +\n        '}, &\\\\quad{\\\\text{otherwise}}\\\\end{cases}'\n  }\n\n  /**\n   * Test whether a condition is met\n   * @param {*} condition\n   * @returns {boolean} true if condition is true or non-zero, else false\n   */\n  function testCondition (condition) {\n    if (typeof condition === 'number' ||\n        typeof condition === 'boolean' ||\n        typeof condition === 'string') {\n      return !!condition\n    }\n\n    if (condition) {\n      if (isBigNumber(condition)) {\n        return !condition.isZero()\n      }\n\n      if (isComplex(condition)) {\n        return !!((condition.re || condition.im))\n      }\n\n      if (isUnit(condition)) {\n        return !!condition.value\n      }\n    }\n\n    if (condition === null || condition === undefined) {\n      return false\n    }\n\n    throw new TypeError('Unsupported type of condition \"' + typeOf(condition) + '\"')\n  }\n\n  return ConditionalNode\n}, { isClass: true, isNode: true })\n","/* eslint no-template-curly-in-string: \"off\" */\n\nimport escapeLatexLib from 'escape-latex'\nimport { hasOwnProperty } from './object.js'\n\nexport const latexSymbols = {\n  // GREEK LETTERS\n  Alpha: 'A',\n  alpha: '\\\\alpha',\n  Beta: 'B',\n  beta: '\\\\beta',\n  Gamma: '\\\\Gamma',\n  gamma: '\\\\gamma',\n  Delta: '\\\\Delta',\n  delta: '\\\\delta',\n  Epsilon: 'E',\n  epsilon: '\\\\epsilon',\n  varepsilon: '\\\\varepsilon',\n  Zeta: 'Z',\n  zeta: '\\\\zeta',\n  Eta: 'H',\n  eta: '\\\\eta',\n  Theta: '\\\\Theta',\n  theta: '\\\\theta',\n  vartheta: '\\\\vartheta',\n  Iota: 'I',\n  iota: '\\\\iota',\n  Kappa: 'K',\n  kappa: '\\\\kappa',\n  varkappa: '\\\\varkappa',\n  Lambda: '\\\\Lambda',\n  lambda: '\\\\lambda',\n  Mu: 'M',\n  mu: '\\\\mu',\n  Nu: 'N',\n  nu: '\\\\nu',\n  Xi: '\\\\Xi',\n  xi: '\\\\xi',\n  Omicron: 'O',\n  omicron: 'o',\n  Pi: '\\\\Pi',\n  pi: '\\\\pi',\n  varpi: '\\\\varpi',\n  Rho: 'P',\n  rho: '\\\\rho',\n  varrho: '\\\\varrho',\n  Sigma: '\\\\Sigma',\n  sigma: '\\\\sigma',\n  varsigma: '\\\\varsigma',\n  Tau: 'T',\n  tau: '\\\\tau',\n  Upsilon: '\\\\Upsilon',\n  upsilon: '\\\\upsilon',\n  Phi: '\\\\Phi',\n  phi: '\\\\phi',\n  varphi: '\\\\varphi',\n  Chi: 'X',\n  chi: '\\\\chi',\n  Psi: '\\\\Psi',\n  psi: '\\\\psi',\n  Omega: '\\\\Omega',\n  omega: '\\\\omega',\n  // logic\n  true: '\\\\mathrm{True}',\n  false: '\\\\mathrm{False}',\n  // other\n  i: 'i', // TODO use \\i ??\n  inf: '\\\\infty',\n  Inf: '\\\\infty',\n  infinity: '\\\\infty',\n  Infinity: '\\\\infty',\n  oo: '\\\\infty',\n  lim: '\\\\lim',\n  undefined: '\\\\mathbf{?}'\n}\n\nexport const latexOperators = {\n  transpose: '^\\\\top',\n  ctranspose: '^H',\n  factorial: '!',\n  pow: '^',\n  dotPow: '.^\\\\wedge', // TODO find ideal solution\n  unaryPlus: '+',\n  unaryMinus: '-',\n  bitNot: '\\\\~', // TODO find ideal solution\n  not: '\\\\neg',\n  multiply: '\\\\cdot',\n  divide: '\\\\frac', // TODO how to handle that properly?\n  dotMultiply: '.\\\\cdot', // TODO find ideal solution\n  dotDivide: '.:', // TODO find ideal solution\n  mod: '\\\\mod',\n  add: '+',\n  subtract: '-',\n  to: '\\\\rightarrow',\n  leftShift: '<<',\n  rightArithShift: '>>',\n  rightLogShift: '>>>',\n  equal: '=',\n  unequal: '\\\\neq',\n  smaller: '<',\n  larger: '>',\n  smallerEq: '\\\\leq',\n  largerEq: '\\\\geq',\n  bitAnd: '\\\\&',\n  bitXor: '\\\\underline{|}',\n  bitOr: '|',\n  and: '\\\\wedge',\n  xor: '\\\\veebar',\n  or: '\\\\vee'\n}\n\nexport const latexFunctions = {\n  // arithmetic\n  abs: { 1: '\\\\left|${args[0]}\\\\right|' },\n  add: { 2: `\\\\left(\\${args[0]}${latexOperators.add}\\${args[1]}\\\\right)` },\n  cbrt: { 1: '\\\\sqrt[3]{${args[0]}}' },\n  ceil: { 1: '\\\\left\\\\lceil${args[0]}\\\\right\\\\rceil' },\n  cube: { 1: '\\\\left(${args[0]}\\\\right)^3' },\n  divide: { 2: '\\\\frac{${args[0]}}{${args[1]}}' },\n  dotDivide: { 2: `\\\\left(\\${args[0]}${latexOperators.dotDivide}\\${args[1]}\\\\right)` },\n  dotMultiply: { 2: `\\\\left(\\${args[0]}${latexOperators.dotMultiply}\\${args[1]}\\\\right)` },\n  dotPow: { 2: `\\\\left(\\${args[0]}${latexOperators.dotPow}\\${args[1]}\\\\right)` },\n  exp: { 1: '\\\\exp\\\\left(${args[0]}\\\\right)' },\n  expm1: `\\\\left(e${latexOperators.pow}{\\${args[0]}}-1\\\\right)`,\n  fix: { 1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)' },\n  floor: { 1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rfloor' },\n  gcd: '\\\\gcd\\\\left(${args}\\\\right)',\n  hypot: '\\\\hypot\\\\left(${args}\\\\right)',\n  log: {\n    1: '\\\\ln\\\\left(${args[0]}\\\\right)',\n    2: '\\\\log_{${args[1]}}\\\\left(${args[0]}\\\\right)'\n  },\n  log10: { 1: '\\\\log_{10}\\\\left(${args[0]}\\\\right)' },\n  log1p: {\n    1: '\\\\ln\\\\left(${args[0]}+1\\\\right)',\n    2: '\\\\log_{${args[1]}}\\\\left(${args[0]}+1\\\\right)'\n  },\n  log2: '\\\\log_{2}\\\\left(${args[0]}\\\\right)',\n  mod: { 2: `\\\\left(\\${args[0]}${latexOperators.mod}\\${args[1]}\\\\right)` },\n  multiply: { 2: `\\\\left(\\${args[0]}${latexOperators.multiply}\\${args[1]}\\\\right)` },\n  norm: {\n    1: '\\\\left\\\\|${args[0]}\\\\right\\\\|',\n    2: undefined // use default template\n  },\n  nthRoot: { 2: '\\\\sqrt[${args[1]}]{${args[0]}}' },\n  nthRoots: { 2: '\\\\{y : $y^{args[1]} = {${args[0]}}\\\\}' },\n  pow: { 2: `\\\\left(\\${args[0]}\\\\right)${latexOperators.pow}{\\${args[1]}}` },\n  round: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rceil',\n    2: undefined // use default template\n  },\n  sign: { 1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)' },\n  sqrt: { 1: '\\\\sqrt{${args[0]}}' },\n  square: { 1: '\\\\left(${args[0]}\\\\right)^2' },\n  subtract: { 2: `\\\\left(\\${args[0]}${latexOperators.subtract}\\${args[1]}\\\\right)` },\n  unaryMinus: { 1: `${latexOperators.unaryMinus}\\\\left(\\${args[0]}\\\\right)` },\n  unaryPlus: { 1: `${latexOperators.unaryPlus}\\\\left(\\${args[0]}\\\\right)` },\n\n  // bitwise\n  bitAnd: { 2: `\\\\left(\\${args[0]}${latexOperators.bitAnd}\\${args[1]}\\\\right)` },\n  bitNot: { 1: latexOperators.bitNot + '\\\\left(${args[0]}\\\\right)' },\n  bitOr: { 2: `\\\\left(\\${args[0]}${latexOperators.bitOr}\\${args[1]}\\\\right)` },\n  bitXor: { 2: `\\\\left(\\${args[0]}${latexOperators.bitXor}\\${args[1]}\\\\right)` },\n  leftShift: { 2: `\\\\left(\\${args[0]}${latexOperators.leftShift}\\${args[1]}\\\\right)` },\n  rightArithShift: { 2: `\\\\left(\\${args[0]}${latexOperators.rightArithShift}\\${args[1]}\\\\right)` },\n  rightLogShift: { 2: `\\\\left(\\${args[0]}${latexOperators.rightLogShift}\\${args[1]}\\\\right)` },\n\n  // combinatorics\n  bellNumbers: { 1: '\\\\mathrm{B}_{${args[0]}}' },\n  catalan: { 1: '\\\\mathrm{C}_{${args[0]}}' },\n  stirlingS2: { 2: '\\\\mathrm{S}\\\\left(${args}\\\\right)' },\n\n  // complex\n  arg: { 1: '\\\\arg\\\\left(${args[0]}\\\\right)' },\n  conj: { 1: '\\\\left(${args[0]}\\\\right)^*' },\n  im: { 1: '\\\\Im\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace' },\n  re: { 1: '\\\\Re\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace' },\n\n  // logical\n  and: { 2: `\\\\left(\\${args[0]}${latexOperators.and}\\${args[1]}\\\\right)` },\n  not: { 1: latexOperators.not + '\\\\left(${args[0]}\\\\right)' },\n  or: { 2: `\\\\left(\\${args[0]}${latexOperators.or}\\${args[1]}\\\\right)` },\n  xor: { 2: `\\\\left(\\${args[0]}${latexOperators.xor}\\${args[1]}\\\\right)` },\n\n  // matrix\n  cross: { 2: '\\\\left(${args[0]}\\\\right)\\\\times\\\\left(${args[1]}\\\\right)' },\n  ctranspose: { 1: `\\\\left(\\${args[0]}\\\\right)${latexOperators.ctranspose}` },\n  det: { 1: '\\\\det\\\\left(${args[0]}\\\\right)' },\n  dot: { 2: '\\\\left(${args[0]}\\\\cdot${args[1]}\\\\right)' },\n  expm: { 1: '\\\\exp\\\\left(${args[0]}\\\\right)' },\n  inv: { 1: '\\\\left(${args[0]}\\\\right)^{-1}' },\n  sqrtm: { 1: `{\\${args[0]}}${latexOperators.pow}{\\\\frac{1}{2}}` },\n  trace: { 1: '\\\\mathrm{tr}\\\\left(${args[0]}\\\\right)' },\n  transpose: { 1: `\\\\left(\\${args[0]}\\\\right)${latexOperators.transpose}` },\n\n  // probability\n  combinations: { 2: '\\\\binom{${args[0]}}{${args[1]}}' },\n  combinationsWithRep: { 2: '\\\\left(\\\\!\\\\!{\\\\binom{${args[0]}}{${args[1]}}}\\\\!\\\\!\\\\right)' },\n  factorial: { 1: `\\\\left(\\${args[0]}\\\\right)${latexOperators.factorial}` },\n  gamma: { 1: '\\\\Gamma\\\\left(${args[0]}\\\\right)' },\n\n  // relational\n  equal: { 2: `\\\\left(\\${args[0]}${latexOperators.equal}\\${args[1]}\\\\right)` },\n  larger: { 2: `\\\\left(\\${args[0]}${latexOperators.larger}\\${args[1]}\\\\right)` },\n  largerEq: { 2: `\\\\left(\\${args[0]}${latexOperators.largerEq}\\${args[1]}\\\\right)` },\n  smaller: { 2: `\\\\left(\\${args[0]}${latexOperators.smaller}\\${args[1]}\\\\right)` },\n  smallerEq: { 2: `\\\\left(\\${args[0]}${latexOperators.smallerEq}\\${args[1]}\\\\right)` },\n  unequal: { 2: `\\\\left(\\${args[0]}${latexOperators.unequal}\\${args[1]}\\\\right)` },\n\n  // special\n  erf: { 1: 'erf\\\\left(${args[0]}\\\\right)' },\n\n  // statistics\n  max: '\\\\max\\\\left(${args}\\\\right)',\n  min: '\\\\min\\\\left(${args}\\\\right)',\n  variance: '\\\\mathrm{Var}\\\\left(${args}\\\\right)',\n\n  // trigonometry\n  acos: { 1: '\\\\cos^{-1}\\\\left(${args[0]}\\\\right)' },\n  acosh: { 1: '\\\\cosh^{-1}\\\\left(${args[0]}\\\\right)' },\n  acot: { 1: '\\\\cot^{-1}\\\\left(${args[0]}\\\\right)' },\n  acoth: { 1: '\\\\coth^{-1}\\\\left(${args[0]}\\\\right)' },\n  acsc: { 1: '\\\\csc^{-1}\\\\left(${args[0]}\\\\right)' },\n  acsch: { 1: '\\\\mathrm{csch}^{-1}\\\\left(${args[0]}\\\\right)' },\n  asec: { 1: '\\\\sec^{-1}\\\\left(${args[0]}\\\\right)' },\n  asech: { 1: '\\\\mathrm{sech}^{-1}\\\\left(${args[0]}\\\\right)' },\n  asin: { 1: '\\\\sin^{-1}\\\\left(${args[0]}\\\\right)' },\n  asinh: { 1: '\\\\sinh^{-1}\\\\left(${args[0]}\\\\right)' },\n  atan: { 1: '\\\\tan^{-1}\\\\left(${args[0]}\\\\right)' },\n  atan2: { 2: '\\\\mathrm{atan2}\\\\left(${args}\\\\right)' },\n  atanh: { 1: '\\\\tanh^{-1}\\\\left(${args[0]}\\\\right)' },\n  cos: { 1: '\\\\cos\\\\left(${args[0]}\\\\right)' },\n  cosh: { 1: '\\\\cosh\\\\left(${args[0]}\\\\right)' },\n  cot: { 1: '\\\\cot\\\\left(${args[0]}\\\\right)' },\n  coth: { 1: '\\\\coth\\\\left(${args[0]}\\\\right)' },\n  csc: { 1: '\\\\csc\\\\left(${args[0]}\\\\right)' },\n  csch: { 1: '\\\\mathrm{csch}\\\\left(${args[0]}\\\\right)' },\n  sec: { 1: '\\\\sec\\\\left(${args[0]}\\\\right)' },\n  sech: { 1: '\\\\mathrm{sech}\\\\left(${args[0]}\\\\right)' },\n  sin: { 1: '\\\\sin\\\\left(${args[0]}\\\\right)' },\n  sinh: { 1: '\\\\sinh\\\\left(${args[0]}\\\\right)' },\n  tan: { 1: '\\\\tan\\\\left(${args[0]}\\\\right)' },\n  tanh: { 1: '\\\\tanh\\\\left(${args[0]}\\\\right)' },\n\n  // unit\n  to: { 2: `\\\\left(\\${args[0]}${latexOperators.to}\\${args[1]}\\\\right)` },\n\n  // utils\n  numeric: function (node, options) {\n    // Not sure if this is strictly right but should work correctly for the vast majority of use cases.\n    return node.args[0].toTex()\n  },\n\n  // type\n  number: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n  },\n  string: {\n    0: '\\\\mathtt{\"\"}',\n    1: '\\\\mathrm{string}\\\\left(${args[0]}\\\\right)'\n  },\n  bignumber: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)'\n  },\n  complex: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: `\\\\left(\\\\left(\\${args[0]}\\\\right)+${latexSymbols.i}\\\\cdot\\\\left(\\${args[1]}\\\\right)\\\\right)`\n  },\n  matrix: {\n    0: '\\\\begin{bmatrix}\\\\end{bmatrix}',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(${args[0]}\\\\right)'\n  },\n  sparse: {\n    0: '\\\\begin{bsparse}\\\\end{bsparse}',\n    1: '\\\\left(${args[0]}\\\\right)'\n  },\n  unit: {\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n  }\n\n}\n\nexport const defaultTemplate = '\\\\mathrm{${name}}\\\\left(${args}\\\\right)'\n\nconst latexUnits = {\n  deg: '^\\\\circ'\n}\n\nexport function escapeLatex (string) {\n  return escapeLatexLib(string, { preserveFormatting: true })\n}\n\n// @param {string} name\n// @param {boolean} isUnit\nexport function toSymbol (name, isUnit) {\n  isUnit = typeof isUnit === 'undefined' ? false : isUnit\n  if (isUnit) {\n    if (hasOwnProperty(latexUnits, name)) {\n      return latexUnits[name]\n    }\n\n    return '\\\\mathrm{' + escapeLatex(name) + '}'\n  }\n\n  if (hasOwnProperty(latexSymbols, name)) {\n    return latexSymbols[name]\n  }\n\n  return escapeLatex(name)\n}\n","import { format } from '../../utils/string.js'\nimport { typeOf } from '../../utils/is.js'\nimport { escapeLatex } from '../../utils/latex.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ConstantNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createConstantNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * A ConstantNode holds a constant value like a number or string.\n   *\n   * Usage:\n   *\n   *     new ConstantNode(2.3)\n   *     new ConstantNode('hello')\n   *\n   * @param {*} value    Value can be any type (number, BigNumber, string, ...)\n   * @constructor ConstantNode\n   * @extends {Node}\n   */\n  function ConstantNode (value) {\n    if (!(this instanceof ConstantNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this.value = value\n  }\n\n  ConstantNode.prototype = new Node()\n\n  ConstantNode.prototype.type = 'ConstantNode'\n\n  ConstantNode.prototype.isConstantNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  ConstantNode.prototype._compile = function (math, argNames) {\n    const value = this.value\n\n    return function evalConstantNode () {\n      return value\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  ConstantNode.prototype.forEach = function (callback) {\n    // nothing to do, we don't have childs\n  }\n\n  /**\n   * Create a new ConstantNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node) : Node} callback\n   * @returns {ConstantNode} Returns a clone of the node\n   */\n  ConstantNode.prototype.map = function (callback) {\n    return this.clone()\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConstantNode}\n   */\n  ConstantNode.prototype.clone = function () {\n    return new ConstantNode(this.value)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ConstantNode.prototype._toString = function (options) {\n    return format(this.value, options)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ConstantNode.prototype.toHTML = function (options) {\n    const value = this._toString(options)\n\n    switch (typeOf(this.value)) {\n      case 'number':\n      case 'BigNumber':\n      case 'Fraction':\n        return '<span class=\"math-number\">' + value + '</span>'\n      case 'string':\n        return '<span class=\"math-string\">' + value + '</span>'\n      case 'boolean':\n        return '<span class=\"math-boolean\">' + value + '</span>'\n      case 'null':\n        return '<span class=\"math-null-symbol\">' + value + '</span>'\n      case 'undefined':\n        return '<span class=\"math-undefined\">' + value + '</span>'\n\n      default:\n        return '<span class=\"math-symbol\">' + value + '</span>'\n    }\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  ConstantNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ConstantNode',\n      value: this.value\n    }\n  }\n\n  /**\n   * Instantiate a ConstantNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SymbolNode\", value: 2.3}`,\n   *                       where mathjs is optional\n   * @returns {ConstantNode}\n   */\n  ConstantNode.fromJSON = function (json) {\n    return new ConstantNode(json.value)\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ConstantNode.prototype._toTex = function (options) {\n    const value = this._toString(options)\n\n    switch (typeOf(this.value)) {\n      case 'string':\n        return '\\\\mathtt{' + escapeLatex(value) + '}'\n\n      case 'number':\n      case 'BigNumber':\n        {\n          if (!isFinite(this.value)) {\n            return (this.value.valueOf() < 0)\n              ? '-\\\\infty'\n              : '\\\\infty'\n          }\n\n          const index = value.toLowerCase().indexOf('e')\n          if (index !== -1) {\n            return value.substring(0, index) + '\\\\cdot10^{' +\n                value.substring(index + 1) + '}'\n          }\n        }\n        return value\n      case 'Fraction':\n        return this.value.toLatex()\n\n      default:\n        return value\n    }\n  }\n\n  return ConstantNode\n}, { isClass: true, isNode: true })\n","import { isNode } from '../../utils/is.js'\n\nimport { keywords } from '../keywords.js'\nimport { escape } from '../../utils/string.js'\nimport { forEach, join } from '../../utils/array.js'\nimport { toSymbol } from '../../utils/latex.js'\nimport { getPrecedence } from '../operators.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'FunctionAssignmentNode'\nconst dependencies = [\n  'typed',\n  'Node'\n]\n\nexport const createFunctionAssignmentNode = /* #__PURE__ */ factory(name, dependencies, ({ typed, Node }) => {\n  /**\n   * @constructor FunctionAssignmentNode\n   * @extends {Node}\n   * Function assignment\n   *\n   * @param {string} name           Function name\n   * @param {string[] | Array.<{name: string, type: string}>} params\n   *                                Array with function parameter names, or an\n   *                                array with objects containing the name\n   *                                and type of the parameter\n   * @param {Node} expr             The function expression\n   */\n  function FunctionAssignmentNode (name, params, expr) {\n    if (!(this instanceof FunctionAssignmentNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    // validate input\n    if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"')\n    if (!Array.isArray(params)) throw new TypeError('Array containing strings or objects expected for parameter \"params\"')\n    if (!isNode(expr)) throw new TypeError('Node expected for parameter \"expr\"')\n    if (keywords.has(name)) throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword')\n\n    this.name = name\n    this.params = params.map(function (param) {\n      return (param && param.name) || param\n    })\n    this.types = params.map(function (param) {\n      return (param && param.type) || 'any'\n    })\n    this.expr = expr\n  }\n\n  FunctionAssignmentNode.prototype = new Node()\n\n  FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode'\n\n  FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  FunctionAssignmentNode.prototype._compile = function (math, argNames) {\n    const childArgNames = Object.create(argNames)\n    forEach(this.params, function (param) {\n      childArgNames[param] = true\n    })\n\n    // compile the function expression with the child args\n    const evalExpr = this.expr._compile(math, childArgNames)\n    const name = this.name\n    const params = this.params\n    const signature = join(this.types, ',')\n    const syntax = name + '(' + join(this.params, ', ') + ')'\n\n    return function evalFunctionAssignmentNode (scope, args, context) {\n      const signatures = {}\n      signatures[signature] = function () {\n        const childArgs = Object.create(args)\n\n        for (let i = 0; i < params.length; i++) {\n          childArgs[params[i]] = arguments[i]\n        }\n\n        return evalExpr(scope, childArgs, context)\n      }\n      const fn = typed(name, signatures)\n      fn.syntax = syntax\n\n      scope.set(name, fn)\n\n      return fn\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  FunctionAssignmentNode.prototype.forEach = function (callback) {\n    callback(this.expr, 'expr', this)\n  }\n\n  /**\n   * Create a new FunctionAssignmentNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {FunctionAssignmentNode} Returns a transformed copy of the node\n   */\n  FunctionAssignmentNode.prototype.map = function (callback) {\n    const expr = this._ifNode(callback(this.expr, 'expr', this))\n\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), expr)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionAssignmentNode}\n   */\n  FunctionAssignmentNode.prototype.clone = function () {\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr)\n  }\n\n  /**\n   * Is parenthesis needed?\n   * @param {Node} node\n   * @param {Object} parenthesis\n   * @private\n   */\n  function needParenthesis (node, parenthesis) {\n    const precedence = getPrecedence(node, parenthesis)\n    const exprPrecedence = getPrecedence(node.expr, parenthesis)\n\n    return (parenthesis === 'all') ||\n      ((exprPrecedence !== null) && (exprPrecedence <= precedence))\n  }\n\n  /**\n   * get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  FunctionAssignmentNode.prototype._toString = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    let expr = this.expr.toString(options)\n    if (needParenthesis(this, parenthesis)) {\n      expr = '(' + expr + ')'\n    }\n    return this.name + '(' + this.params.join(', ') + ') = ' + expr\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  FunctionAssignmentNode.prototype.toJSON = function () {\n    const types = this.types\n\n    return {\n      mathjs: 'FunctionAssignmentNode',\n      name: this.name,\n      params: this.params.map(function (param, index) {\n        return {\n          name: param,\n          type: types[index]\n        }\n      }),\n      expr: this.expr\n    }\n  }\n\n  /**\n   * Instantiate an FunctionAssignmentNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"FunctionAssignmentNode\", name: ..., params: ..., expr: ...}`,\n   *                       where mathjs is optional\n   * @returns {FunctionAssignmentNode}\n   */\n  FunctionAssignmentNode.fromJSON = function (json) {\n    return new FunctionAssignmentNode(json.name, json.params, json.expr)\n  }\n\n  /**\n   * get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  FunctionAssignmentNode.prototype.toHTML = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const params = []\n    for (let i = 0; i < this.params.length; i++) {\n      params.push('<span class=\"math-symbol math-parameter\">' + escape(this.params[i]) + '</span>')\n    }\n    let expr = this.expr.toHTML(options)\n    if (needParenthesis(this, parenthesis)) {\n      expr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + expr + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n    return '<span class=\"math-function\">' + escape(this.name) + '</span>' + '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + params.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-round-parenthesis\">)</span><span class=\"math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator\">=</span>' + expr\n  }\n\n  /**\n   * get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  FunctionAssignmentNode.prototype._toTex = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    let expr = this.expr.toTex(options)\n    if (needParenthesis(this, parenthesis)) {\n      expr = `\\\\left(${expr}\\\\right)`\n    }\n\n    return '\\\\mathrm{' + this.name +\n        '}\\\\left(' + this.params.map(toSymbol).join(',') + '\\\\right):=' + expr\n  }\n\n  return FunctionAssignmentNode\n}, { isClass: true, isNode: true })\n","import { isBigNumber, isConstantNode, isNode, isRangeNode, isSymbolNode } from '../../utils/is.js'\nimport { map } from '../../utils/array.js'\nimport { escape } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\nimport { getSafeProperty } from '../../utils/customs.js'\n\nconst name = 'IndexNode'\nconst dependencies = [\n  'Range',\n  'Node',\n  'size'\n]\n\nexport const createIndexNode = /* #__PURE__ */ factory(name, dependencies, ({ Range, Node, size }) => {\n  /**\n   * @constructor IndexNode\n   * @extends Node\n   *\n   * Describes a subset of a matrix or an object property.\n   * Cannot be used on its own, needs to be used within an AccessorNode or\n   * AssignmentNode.\n   *\n   * @param {Node[]} dimensions\n   * @param {boolean} [dotNotation=false]  Optional property describing whether\n   *                                       this index was written using dot\n   *                                       notation like `a.b`, or using bracket\n   *                                       notation like `a[\"b\"]` (default).\n   *                                       Used to stringify an IndexNode.\n   */\n  function IndexNode (dimensions, dotNotation) {\n    if (!(this instanceof IndexNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this.dimensions = dimensions\n    this.dotNotation = dotNotation || false\n\n    // validate input\n    if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"')\n    }\n    if (this.dotNotation && !this.isObjectProperty()) {\n      throw new Error('dotNotation only applicable for object properties')\n    }\n  }\n\n  IndexNode.prototype = new Node()\n\n  IndexNode.prototype.type = 'IndexNode'\n\n  IndexNode.prototype.isIndexNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  IndexNode.prototype._compile = function (math, argNames) {\n    // TODO: implement support for bignumber (currently bignumbers are silently\n    //       reduced to numbers when changing the value to zero-based)\n\n    // TODO: Optimization: when the range values are ConstantNodes,\n    //       we can beforehand resolve the zero-based value\n\n    // optimization for a simple object property\n    const evalDimensions = map(this.dimensions, function (range, i) {\n      if (isRangeNode(range)) {\n        if (range.needsEnd()) {\n          // create a range containing end (like '4:end')\n          const childArgNames = Object.create(argNames)\n          childArgNames.end = true\n\n          const evalStart = range.start._compile(math, childArgNames)\n          const evalEnd = range.end._compile(math, childArgNames)\n          const evalStep = range.step\n            ? range.step._compile(math, childArgNames)\n            : function () { return 1 }\n\n          return function evalDimension (scope, args, context) {\n            const s = size(context).valueOf()\n            const childArgs = Object.create(args)\n            childArgs.end = s[i]\n\n            return createRange(\n              evalStart(scope, childArgs, context),\n              evalEnd(scope, childArgs, context),\n              evalStep(scope, childArgs, context)\n            )\n          }\n        } else {\n          // create range\n          const evalStart = range.start._compile(math, argNames)\n          const evalEnd = range.end._compile(math, argNames)\n          const evalStep = range.step\n            ? range.step._compile(math, argNames)\n            : function () { return 1 }\n\n          return function evalDimension (scope, args, context) {\n            return createRange(\n              evalStart(scope, args, context),\n              evalEnd(scope, args, context),\n              evalStep(scope, args, context)\n            )\n          }\n        }\n      } else if (isSymbolNode(range) && range.name === 'end') {\n        // SymbolNode 'end'\n        const childArgNames = Object.create(argNames)\n        childArgNames.end = true\n\n        const evalRange = range._compile(math, childArgNames)\n\n        return function evalDimension (scope, args, context) {\n          const s = size(context).valueOf()\n          const childArgs = Object.create(args)\n          childArgs.end = s[i]\n\n          return evalRange(scope, childArgs, context)\n        }\n      } else {\n        // ConstantNode\n        const evalRange = range._compile(math, argNames)\n        return function evalDimension (scope, args, context) {\n          return evalRange(scope, args, context)\n        }\n      }\n    })\n\n    const index = getSafeProperty(math, 'index')\n\n    return function evalIndexNode (scope, args, context) {\n      const dimensions = map(evalDimensions, function (evalDimension) {\n        return evalDimension(scope, args, context)\n      })\n\n      return index(...dimensions)\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  IndexNode.prototype.forEach = function (callback) {\n    for (let i = 0; i < this.dimensions.length; i++) {\n      callback(this.dimensions[i], 'dimensions[' + i + ']', this)\n    }\n  }\n\n  /**\n   * Create a new IndexNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {IndexNode} Returns a transformed copy of the node\n   */\n  IndexNode.prototype.map = function (callback) {\n    const dimensions = []\n    for (let i = 0; i < this.dimensions.length; i++) {\n      dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this))\n    }\n\n    return new IndexNode(dimensions, this.dotNotation)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {IndexNode}\n   */\n  IndexNode.prototype.clone = function () {\n    return new IndexNode(this.dimensions.slice(0), this.dotNotation)\n  }\n\n  /**\n   * Test whether this IndexNode contains a single property name\n   * @return {boolean}\n   */\n  IndexNode.prototype.isObjectProperty = function () {\n    return this.dimensions.length === 1 &&\n        isConstantNode(this.dimensions[0]) &&\n        typeof this.dimensions[0].value === 'string'\n  }\n\n  /**\n   * Returns the property name if IndexNode contains a property.\n   * If not, returns null.\n   * @return {string | null}\n   */\n  IndexNode.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this.dimensions[0].value : null\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  IndexNode.prototype._toString = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    return this.dotNotation\n      ? ('.' + this.getObjectProperty())\n      : ('[' + this.dimensions.join(', ') + ']')\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  IndexNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'IndexNode',\n      dimensions: this.dimensions,\n      dotNotation: this.dotNotation\n    }\n  }\n\n  /**\n   * Instantiate an IndexNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"IndexNode\", dimensions: [...], dotNotation: false}`,\n   *                       where mathjs is optional\n   * @returns {IndexNode}\n   */\n  IndexNode.fromJSON = function (json) {\n    return new IndexNode(json.dimensions, json.dotNotation)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  IndexNode.prototype.toHTML = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    const dimensions = []\n    for (let i = 0; i < this.dimensions.length; i++) {\n      dimensions[i] = this.dimensions[i].toHTML()\n    }\n    if (this.dotNotation) {\n      return '<span class=\"math-operator math-accessor-operator\">.</span>' + '<span class=\"math-symbol math-property\">' + escape(this.getObjectProperty()) + '</span>'\n    } else {\n      return '<span class=\"math-parenthesis math-square-parenthesis\">[</span>' + dimensions.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-square-parenthesis\">]</span>'\n    }\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  IndexNode.prototype._toTex = function (options) {\n    const dimensions = this.dimensions.map(function (range) {\n      return range.toTex(options)\n    })\n\n    return this.dotNotation\n      ? ('.' + this.getObjectProperty() + '')\n      : ('_{' + dimensions.join(',') + '}')\n  }\n\n  // helper function to create a Range from start, step and end\n  function createRange (start, end, step) {\n    return new Range(\n      isBigNumber(start) ? start.toNumber() : start,\n      isBigNumber(end) ? end.toNumber() : end,\n      isBigNumber(step) ? step.toNumber() : step\n    )\n  }\n\n  return IndexNode\n}, { isClass: true, isNode: true })\n","import { isNode } from '../../utils/is.js'\nimport { escape, stringify } from '../../utils/string.js'\nimport { isSafeProperty } from '../../utils/customs.js'\nimport { hasOwnProperty } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ObjectNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createObjectNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * @constructor ObjectNode\n   * @extends {Node}\n   * Holds an object with keys/values\n   * @param {Object.<string, Node>} [properties]   object with key/value pairs\n   */\n  function ObjectNode (properties) {\n    if (!(this instanceof ObjectNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this.properties = properties || {}\n\n    // validate input\n    if (properties) {\n      if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {\n        return isNode(properties[key])\n      })) {\n        throw new TypeError('Object containing Nodes expected')\n      }\n    }\n  }\n\n  ObjectNode.prototype = new Node()\n\n  ObjectNode.prototype.type = 'ObjectNode'\n\n  ObjectNode.prototype.isObjectNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  ObjectNode.prototype._compile = function (math, argNames) {\n    const evalEntries = {}\n\n    for (const key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        // we stringify/parse the key here to resolve unicode characters,\n        // so you cannot create a key like {\"co\\\\u006Estructor\": null}\n        const stringifiedKey = stringify(key)\n        const parsedKey = JSON.parse(stringifiedKey)\n        if (!isSafeProperty(this.properties, parsedKey)) {\n          throw new Error('No access to property \"' + parsedKey + '\"')\n        }\n\n        evalEntries[parsedKey] = this.properties[key]._compile(math, argNames)\n      }\n    }\n\n    return function evalObjectNode (scope, args, context) {\n      const obj = {}\n\n      for (const key in evalEntries) {\n        if (hasOwnProperty(evalEntries, key)) {\n          obj[key] = evalEntries[key](scope, args, context)\n        }\n      }\n\n      return obj\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  ObjectNode.prototype.forEach = function (callback) {\n    for (const key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        callback(this.properties[key], 'properties[' + stringify(key) + ']', this)\n      }\n    }\n  }\n\n  /**\n   * Create a new ObjectNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {ObjectNode} Returns a transformed copy of the node\n   */\n  ObjectNode.prototype.map = function (callback) {\n    const properties = {}\n    for (const key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        properties[key] = this._ifNode(callback(this.properties[key],\n          'properties[' + stringify(key) + ']', this))\n      }\n    }\n    return new ObjectNode(properties)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ObjectNode}\n   */\n  ObjectNode.prototype.clone = function () {\n    const properties = {}\n    for (const key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        properties[key] = this.properties[key]\n      }\n    }\n    return new ObjectNode(properties)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  ObjectNode.prototype._toString = function (options) {\n    const entries = []\n    for (const key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        entries.push(stringify(key) + ': ' + this.properties[key].toString(options))\n      }\n    }\n    return '{' + entries.join(', ') + '}'\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  ObjectNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ObjectNode',\n      properties: this.properties\n    }\n  }\n\n  /**\n   * Instantiate an OperatorNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ObjectNode\", \"properties\": {...}}`,\n   *                       where mathjs is optional\n   * @returns {ObjectNode}\n   */\n  ObjectNode.fromJSON = function (json) {\n    return new ObjectNode(json.properties)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  ObjectNode.prototype.toHTML = function (options) {\n    const entries = []\n    for (const key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        entries.push('<span class=\"math-symbol math-property\">' + escape(key) + '</span>' + '<span class=\"math-operator math-assignment-operator math-property-assignment-operator math-binary-operator\">:</span>' + this.properties[key].toHTML(options))\n      }\n    }\n    return '<span class=\"math-parenthesis math-curly-parenthesis\">{</span>' + entries.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-curly-parenthesis\">}</span>'\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  ObjectNode.prototype._toTex = function (options) {\n    const entries = []\n    for (const key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        entries.push('\\\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\\\\\')\n      }\n    }\n    return `\\\\left\\\\{\\\\begin{array}{ll}${entries.join('\\n')}\\\\end{array}\\\\right\\\\}`\n  }\n\n  return ObjectNode\n}, { isClass: true, isNode: true })\n","import { isNode } from '../../utils/is.js'\nimport { map } from '../../utils/array.js'\nimport { escape } from '../../utils/string.js'\nimport { getSafeProperty, isSafeMethod } from '../../utils/customs.js'\nimport { getAssociativity, getPrecedence, isAssociativeWith, properties } from '../operators.js'\nimport { latexOperators } from '../../utils/latex.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'OperatorNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createOperatorNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * @constructor OperatorNode\n   * @extends {Node}\n   * An operator with two arguments, like 2+3\n   *\n   * @param {string} op           Operator name, for example '+'\n   * @param {string} fn           Function name, for example 'add'\n   * @param {Node[]} args         Operator arguments\n   * @param {boolean} [implicit]  Is this an implicit multiplication?\n   * @param {boolean} [isPercentage] Is this an percentage Operation?\n   */\n  function OperatorNode (op, fn, args, implicit, isPercentage) {\n    if (!(this instanceof OperatorNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    // validate input\n    if (typeof op !== 'string') {\n      throw new TypeError('string expected for parameter \"op\"')\n    }\n    if (typeof fn !== 'string') {\n      throw new TypeError('string expected for parameter \"fn\"')\n    }\n    if (!Array.isArray(args) || !args.every(isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"args\"')\n    }\n\n    this.implicit = (implicit === true)\n    this.isPercentage = (isPercentage === true)\n    this.op = op\n    this.fn = fn\n    this.args = args || []\n  }\n\n  OperatorNode.prototype = new Node()\n\n  OperatorNode.prototype.type = 'OperatorNode'\n\n  OperatorNode.prototype.isOperatorNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  OperatorNode.prototype._compile = function (math, argNames) {\n    // validate fn\n    if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {\n      if (!math[this.fn]) {\n        throw new Error('Function ' + this.fn + ' missing in provided namespace \"math\"')\n      } else {\n        throw new Error('No access to function \"' + this.fn + '\"')\n      }\n    }\n\n    const fn = getSafeProperty(math, this.fn)\n    const evalArgs = map(this.args, function (arg) {\n      return arg._compile(math, argNames)\n    })\n\n    if (evalArgs.length === 1) {\n      const evalArg0 = evalArgs[0]\n      return function evalOperatorNode (scope, args, context) {\n        return fn(evalArg0(scope, args, context))\n      }\n    } else if (evalArgs.length === 2) {\n      const evalArg0 = evalArgs[0]\n      const evalArg1 = evalArgs[1]\n      return function evalOperatorNode (scope, args, context) {\n        return fn(evalArg0(scope, args, context), evalArg1(scope, args, context))\n      }\n    } else {\n      return function evalOperatorNode (scope, args, context) {\n        return fn.apply(null, map(evalArgs, function (evalArg) {\n          return evalArg(scope, args, context)\n        }))\n      }\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  OperatorNode.prototype.forEach = function (callback) {\n    for (let i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this)\n    }\n  }\n\n  /**\n   * Create a new OperatorNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {OperatorNode} Returns a transformed copy of the node\n   */\n  OperatorNode.prototype.map = function (callback) {\n    const args = []\n    for (let i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this))\n    }\n    return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {OperatorNode}\n   */\n  OperatorNode.prototype.clone = function () {\n    return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage)\n  }\n\n  /**\n   * Check whether this is an unary OperatorNode:\n   * has exactly one argument, like `-a`.\n   * @return {boolean} Returns true when an unary operator node, false otherwise.\n   */\n  OperatorNode.prototype.isUnary = function () {\n    return this.args.length === 1\n  }\n\n  /**\n   * Check whether this is a binary OperatorNode:\n   * has exactly two arguments, like `a + b`.\n   * @return {boolean} Returns true when a binary operator node, false otherwise.\n   */\n  OperatorNode.prototype.isBinary = function () {\n    return this.args.length === 2\n  }\n\n  /**\n   * Calculate which parentheses are necessary. Gets an OperatorNode\n   * (which is the root of the tree) and an Array of Nodes\n   * (this.args) and returns an array where 'true' means that an argument\n   * has to be enclosed in parentheses whereas 'false' means the opposite.\n   *\n   * @param {OperatorNode} root\n   * @param {string} parenthesis\n   * @param {Node[]} args\n   * @param {boolean} latex\n   * @return {boolean[]}\n   * @private\n   */\n  function calculateNecessaryParentheses (root, parenthesis, implicit, args, latex) {\n    // precedence of the root OperatorNode\n    const precedence = getPrecedence(root, parenthesis)\n    const associativity = getAssociativity(root, parenthesis)\n\n    if ((parenthesis === 'all') || ((args.length > 2) && (root.getIdentifier() !== 'OperatorNode:add') && (root.getIdentifier() !== 'OperatorNode:multiply'))) {\n      return args.map(function (arg) {\n        switch (arg.getContent().type) { // Nodes that don't need extra parentheses\n          case 'ArrayNode':\n          case 'ConstantNode':\n          case 'SymbolNode':\n          case 'ParenthesisNode':\n            return false\n          default:\n            return true\n        }\n      })\n    }\n\n    let result\n    switch (args.length) {\n      case 0:\n        result = []\n        break\n\n      case 1: // unary operators\n        {\n          // precedence of the operand\n          const operandPrecedence = getPrecedence(args[0], parenthesis)\n\n          // handle special cases for LaTeX, where some of the parentheses aren't needed\n          if (latex && (operandPrecedence !== null)) {\n            let operandIdentifier\n            let rootIdentifier\n            if (parenthesis === 'keep') {\n              operandIdentifier = args[0].getIdentifier()\n              rootIdentifier = root.getIdentifier()\n            } else {\n              // Ignore Parenthesis Nodes when not in 'keep' mode\n              operandIdentifier = args[0].getContent().getIdentifier()\n              rootIdentifier = root.getContent().getIdentifier()\n            }\n            if (properties[precedence][rootIdentifier].latexLeftParens === false) {\n              result = [false]\n              break\n            }\n\n            if (properties[operandPrecedence][operandIdentifier].latexParens === false) {\n              result = [false]\n              break\n            }\n          }\n\n          if (operandPrecedence === null) {\n            // if the operand has no defined precedence, no parens are needed\n            result = [false]\n            break\n          }\n\n          if (operandPrecedence <= precedence) {\n            // if the operands precedence is lower, parens are needed\n            result = [true]\n            break\n          }\n\n          // otherwise, no parens needed\n          result = [false]\n        }\n        break\n      case 2: // binary operators\n        {\n          let lhsParens // left hand side needs parenthesis?\n          // precedence of the left hand side\n          const lhsPrecedence = getPrecedence(args[0], parenthesis)\n          // is the root node associative with the left hand side\n          const assocWithLhs = isAssociativeWith(root, args[0], parenthesis)\n\n          if (lhsPrecedence === null) {\n            // if the left hand side has no defined precedence, no parens are needed\n            // FunctionNode for example\n            lhsParens = false\n          } else if ((lhsPrecedence === precedence) && (associativity === 'right') && !assocWithLhs) {\n            // In case of equal precedence, if the root node is left associative\n            // parens are **never** necessary for the left hand side.\n            // If it is right associative however, parens are necessary\n            // if the root node isn't associative with the left hand side\n            lhsParens = true\n          } else if (lhsPrecedence < precedence) {\n            lhsParens = true\n          } else {\n            lhsParens = false\n          }\n\n          let rhsParens // right hand side needs parenthesis?\n          // precedence of the right hand side\n          const rhsPrecedence = getPrecedence(args[1], parenthesis)\n          // is the root node associative with the right hand side?\n          const assocWithRhs = isAssociativeWith(root, args[1], parenthesis)\n\n          if (rhsPrecedence === null) {\n            // if the right hand side has no defined precedence, no parens are needed\n            // FunctionNode for example\n            rhsParens = false\n          } else if ((rhsPrecedence === precedence) && (associativity === 'left') && !assocWithRhs) {\n            // In case of equal precedence, if the root node is right associative\n            // parens are **never** necessary for the right hand side.\n            // If it is left associative however, parens are necessary\n            // if the root node isn't associative with the right hand side\n            rhsParens = true\n          } else if (rhsPrecedence < precedence) {\n            rhsParens = true\n          } else {\n            rhsParens = false\n          }\n\n          // handle special cases for LaTeX, where some of the parentheses aren't needed\n          if (latex) {\n            let rootIdentifier\n            let lhsIdentifier\n            let rhsIdentifier\n            if (parenthesis === 'keep') {\n              rootIdentifier = root.getIdentifier()\n              lhsIdentifier = root.args[0].getIdentifier()\n              rhsIdentifier = root.args[1].getIdentifier()\n            } else {\n              // Ignore ParenthesisNodes when not in 'keep' mode\n              rootIdentifier = root.getContent().getIdentifier()\n              lhsIdentifier = root.args[0].getContent().getIdentifier()\n              rhsIdentifier = root.args[1].getContent().getIdentifier()\n            }\n\n            if (lhsPrecedence !== null) {\n              if (properties[precedence][rootIdentifier].latexLeftParens === false) {\n                lhsParens = false\n              }\n\n              if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n                lhsParens = false\n              }\n            }\n\n            if (rhsPrecedence !== null) {\n              if (properties[precedence][rootIdentifier].latexRightParens === false) {\n                rhsParens = false\n              }\n\n              if (properties[rhsPrecedence][rhsIdentifier].latexParens === false) {\n                rhsParens = false\n              }\n            }\n          }\n\n          result = [lhsParens, rhsParens]\n        }\n        break\n\n      default:\n        if ((root.getIdentifier() === 'OperatorNode:add') || (root.getIdentifier() === 'OperatorNode:multiply')) {\n          result = args.map(function (arg) {\n            const argPrecedence = getPrecedence(arg, parenthesis)\n            const assocWithArg = isAssociativeWith(root, arg, parenthesis)\n            const argAssociativity = getAssociativity(arg, parenthesis)\n            if (argPrecedence === null) {\n              // if the argument has no defined precedence, no parens are needed\n              return false\n            } else if ((precedence === argPrecedence) && (associativity === argAssociativity) && !assocWithArg) {\n              return true\n            } else if (argPrecedence < precedence) {\n              return true\n            }\n\n            return false\n          })\n        }\n        break\n    }\n\n    // handles an edge case of 'auto' parentheses with implicit multiplication of ConstantNode\n    // In that case print parentheses for ParenthesisNodes even though they normally wouldn't be\n    // printed.\n    if ((args.length >= 2) && (root.getIdentifier() === 'OperatorNode:multiply') && root.implicit && (parenthesis === 'auto') && (implicit === 'hide')) {\n      result = args.map(function (arg, index) {\n        const isParenthesisNode = (arg.getIdentifier() === 'ParenthesisNode')\n        if (result[index] || isParenthesisNode) { // put in parenthesis?\n          return true\n        }\n\n        return false\n      })\n    }\n\n    return result\n  }\n\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n  OperatorNode.prototype._toString = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const implicit = (options && options.implicit) ? options.implicit : 'hide'\n    const args = this.args\n    const parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false)\n\n    if (args.length === 1) { // unary operators\n      const assoc = getAssociativity(this, parenthesis)\n\n      let operand = args[0].toString(options)\n      if (parens[0]) {\n        operand = '(' + operand + ')'\n      }\n\n      // for example for \"not\", we want a space between operand and argument\n      const opIsNamed = /[a-zA-Z]+/.test(this.op)\n\n      if (assoc === 'right') { // prefix operator\n        return this.op + (opIsNamed ? ' ' : '') + operand\n      } else if (assoc === 'left') { // postfix\n        return operand + (opIsNamed ? ' ' : '') + this.op\n      }\n\n      // fall back to postfix\n      return operand + this.op\n    } else if (args.length === 2) {\n      let lhs = args[0].toString(options) // left hand side\n      let rhs = args[1].toString(options) // right hand side\n      if (parens[0]) { // left hand side in parenthesis?\n        lhs = '(' + lhs + ')'\n      }\n      if (parens[1]) { // right hand side in parenthesis?\n        rhs = '(' + rhs + ')'\n      }\n\n      if (this.implicit && (this.getIdentifier() === 'OperatorNode:multiply') && (implicit === 'hide')) {\n        return lhs + ' ' + rhs\n      }\n\n      return lhs + ' ' + this.op + ' ' + rhs\n    } else if ((args.length > 2) && ((this.getIdentifier() === 'OperatorNode:add') || (this.getIdentifier() === 'OperatorNode:multiply'))) {\n      const stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toString(options)\n        if (parens[index]) { // put in parenthesis?\n          arg = '(' + arg + ')'\n        }\n\n        return arg\n      })\n\n      if (this.implicit && (this.getIdentifier() === 'OperatorNode:multiply') && (implicit === 'hide')) {\n        return stringifiedArgs.join(' ')\n      }\n\n      return stringifiedArgs.join(' ' + this.op + ' ')\n    } else {\n      // fallback to formatting as a function call\n      return this.fn + '(' + this.args.join(', ') + ')'\n    }\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  OperatorNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'OperatorNode',\n      op: this.op,\n      fn: this.fn,\n      args: this.args,\n      implicit: this.implicit,\n      isPercentage: this.isPercentage\n    }\n  }\n\n  /**\n   * Instantiate an OperatorNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"OperatorNode\", \"op\": \"+\", \"fn\": \"add\", \"args\": [...], \"implicit\": false, \"isPercentage\":false}`,\n   *                       where mathjs is optional\n   * @returns {OperatorNode}\n   */\n  OperatorNode.fromJSON = function (json) {\n    return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage)\n  }\n\n  /**\n   * Get HTML representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n  OperatorNode.prototype.toHTML = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const implicit = (options && options.implicit) ? options.implicit : 'hide'\n    const args = this.args\n    const parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false)\n\n    if (args.length === 1) { // unary operators\n      const assoc = getAssociativity(this, parenthesis)\n\n      let operand = args[0].toHTML(options)\n      if (parens[0]) {\n        operand = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + operand + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n\n      if (assoc === 'right') { // prefix operator\n        return '<span class=\"math-operator math-unary-operator math-lefthand-unary-operator\">' + escape(this.op) + '</span>' + operand\n      } else { // postfix when assoc === 'left' or undefined\n        return operand + '<span class=\"math-operator math-unary-operator math-righthand-unary-operator\">' + escape(this.op) + '</span>'\n      }\n    } else if (args.length === 2) { // binary operatoes\n      let lhs = args[0].toHTML(options) // left hand side\n      let rhs = args[1].toHTML(options) // right hand side\n      if (parens[0]) { // left hand side in parenthesis?\n        lhs = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + lhs + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n      if (parens[1]) { // right hand side in parenthesis?\n        rhs = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + rhs + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n\n      if (this.implicit && (this.getIdentifier() === 'OperatorNode:multiply') && (implicit === 'hide')) {\n        return lhs + '<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>' + rhs\n      }\n\n      return lhs + '<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">' + escape(this.op) + '</span>' + rhs\n    } else {\n      const stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toHTML(options)\n        if (parens[index]) { // put in parenthesis?\n          arg = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + arg + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n        }\n\n        return arg\n      })\n\n      if ((args.length > 2) && ((this.getIdentifier() === 'OperatorNode:add') || (this.getIdentifier() === 'OperatorNode:multiply'))) {\n        if (this.implicit && (this.getIdentifier() === 'OperatorNode:multiply') && (implicit === 'hide')) {\n          return stringifiedArgs.join('<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>')\n        }\n\n        return stringifiedArgs.join('<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">' + escape(this.op) + '</span>')\n      } else {\n        // fallback to formatting as a function call\n        return '<span class=\"math-function\">' + escape(this.fn) + '</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>' + stringifiedArgs.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>'\n      }\n    }\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  OperatorNode.prototype._toTex = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const implicit = (options && options.implicit) ? options.implicit : 'hide'\n    const args = this.args\n    const parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true)\n    let op = latexOperators[this.fn]\n    op = typeof op === 'undefined' ? this.op : op // fall back to using this.op\n\n    if (args.length === 1) { // unary operators\n      const assoc = getAssociativity(this, parenthesis)\n\n      let operand = args[0].toTex(options)\n      if (parens[0]) {\n        operand = `\\\\left(${operand}\\\\right)`\n      }\n\n      if (assoc === 'right') { // prefix operator\n        return op + operand\n      } else if (assoc === 'left') { // postfix operator\n        return operand + op\n      }\n\n      // fall back to postfix\n      return operand + op\n    } else if (args.length === 2) { // binary operators\n      const lhs = args[0] // left hand side\n      let lhsTex = lhs.toTex(options)\n      if (parens[0]) {\n        lhsTex = `\\\\left(${lhsTex}\\\\right)`\n      }\n\n      const rhs = args[1] // right hand side\n      let rhsTex = rhs.toTex(options)\n      if (parens[1]) {\n        rhsTex = `\\\\left(${rhsTex}\\\\right)`\n      }\n\n      // handle some exceptions (due to the way LaTeX works)\n      let lhsIdentifier\n      if (parenthesis === 'keep') {\n        lhsIdentifier = lhs.getIdentifier()\n      } else {\n        // Ignore ParenthesisNodes if in 'keep' mode\n        lhsIdentifier = lhs.getContent().getIdentifier()\n      }\n      switch (this.getIdentifier()) {\n        case 'OperatorNode:divide':\n          // op contains '\\\\frac' at this point\n          return op + '{' + lhsTex + '}' + '{' + rhsTex + '}'\n        case 'OperatorNode:pow':\n          lhsTex = '{' + lhsTex + '}'\n          rhsTex = '{' + rhsTex + '}'\n          switch (lhsIdentifier) {\n            case 'ConditionalNode': //\n            case 'OperatorNode:divide':\n              lhsTex = `\\\\left(${lhsTex}\\\\right)`\n          }\n          break\n        case 'OperatorNode:multiply':\n          if (this.implicit && (implicit === 'hide')) {\n            return lhsTex + '~' + rhsTex\n          }\n      }\n      return lhsTex + op + rhsTex\n    } else if ((args.length > 2) && ((this.getIdentifier() === 'OperatorNode:add') || (this.getIdentifier() === 'OperatorNode:multiply'))) {\n      const texifiedArgs = args.map(function (arg, index) {\n        arg = arg.toTex(options)\n        if (parens[index]) {\n          arg = `\\\\left(${arg}\\\\right)`\n        }\n        return arg\n      })\n\n      if ((this.getIdentifier() === 'OperatorNode:multiply') && this.implicit) {\n        return texifiedArgs.join('~')\n      }\n\n      return texifiedArgs.join(op)\n    } else {\n      // fall back to formatting as a function call\n      // as this is a fallback, it doesn't use\n      // fancy function names\n      return '\\\\mathrm{' + this.fn + '}\\\\left(' +\n          args.map(function (arg) {\n            return arg.toTex(options)\n          }).join(',') + '\\\\right)'\n    }\n  }\n\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n  OperatorNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.fn\n  }\n\n  return OperatorNode\n}, { isClass: true, isNode: true })\n","import { isNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ParenthesisNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createParenthesisNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * @constructor ParenthesisNode\n   * @extends {Node}\n   * A parenthesis node describes manual parenthesis from the user input\n   * @param {Node} content\n   * @extends {Node}\n   */\n  function ParenthesisNode (content) {\n    if (!(this instanceof ParenthesisNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    // validate input\n    if (!isNode(content)) {\n      throw new TypeError('Node expected for parameter \"content\"')\n    }\n\n    this.content = content\n  }\n\n  ParenthesisNode.prototype = new Node()\n\n  ParenthesisNode.prototype.type = 'ParenthesisNode'\n\n  ParenthesisNode.prototype.isParenthesisNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  ParenthesisNode.prototype._compile = function (math, argNames) {\n    return this.content._compile(math, argNames)\n  }\n\n  /**\n   * Get the content of the current Node.\n   * @return {Node} content\n   * @override\n   **/\n  ParenthesisNode.prototype.getContent = function () {\n    return this.content.getContent()\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  ParenthesisNode.prototype.forEach = function (callback) {\n    callback(this.content, 'content', this)\n  }\n\n  /**\n   * Create a new ParenthesisNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node) : Node} callback\n   * @returns {ParenthesisNode} Returns a clone of the node\n   */\n  ParenthesisNode.prototype.map = function (callback) {\n    const content = callback(this.content, 'content', this)\n    return new ParenthesisNode(content)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ParenthesisNode}\n   */\n  ParenthesisNode.prototype.clone = function () {\n    return new ParenthesisNode(this.content)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  ParenthesisNode.prototype._toString = function (options) {\n    if ((!options) || (options && !options.parenthesis) || (options && options.parenthesis === 'keep')) {\n      return '(' + this.content.toString(options) + ')'\n    }\n    return this.content.toString(options)\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  ParenthesisNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ParenthesisNode',\n      content: this.content\n    }\n  }\n\n  /**\n   * Instantiate an ParenthesisNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ParenthesisNode\", \"content\": ...}`,\n   *                       where mathjs is optional\n   * @returns {ParenthesisNode}\n   */\n  ParenthesisNode.fromJSON = function (json) {\n    return new ParenthesisNode(json.content)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  ParenthesisNode.prototype.toHTML = function (options) {\n    if ((!options) || (options && !options.parenthesis) || (options && options.parenthesis === 'keep')) {\n      return '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + this.content.toHTML(options) + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n    return this.content.toHTML(options)\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  ParenthesisNode.prototype._toTex = function (options) {\n    if ((!options) || (options && !options.parenthesis) || (options && options.parenthesis === 'keep')) {\n      return `\\\\left(${this.content.toTex(options)}\\\\right)`\n    }\n    return this.content.toTex(options)\n  }\n\n  return ParenthesisNode\n}, { isClass: true, isNode: true })\n","import { isNode, isSymbolNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { getPrecedence } from '../operators.js'\n\nconst name = 'RangeNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createRangeNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * @constructor RangeNode\n   * @extends {Node}\n   * create a range\n   * @param {Node} start  included lower-bound\n   * @param {Node} end    included upper-bound\n   * @param {Node} [step] optional step\n   */\n  function RangeNode (start, end, step) {\n    if (!(this instanceof RangeNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    // validate inputs\n    if (!isNode(start)) throw new TypeError('Node expected')\n    if (!isNode(end)) throw new TypeError('Node expected')\n    if (step && !isNode(step)) throw new TypeError('Node expected')\n    if (arguments.length > 3) throw new Error('Too many arguments')\n\n    this.start = start // included lower-bound\n    this.end = end // included upper-bound\n    this.step = step || null // optional step\n  }\n\n  RangeNode.prototype = new Node()\n\n  RangeNode.prototype.type = 'RangeNode'\n\n  RangeNode.prototype.isRangeNode = true\n\n  /**\n   * Check whether the RangeNode needs the `end` symbol to be defined.\n   * This end is the size of the Matrix in current dimension.\n   * @return {boolean}\n   */\n  RangeNode.prototype.needsEnd = function () {\n    // find all `end` symbols in this RangeNode\n    const endSymbols = this.filter(function (node) {\n      return isSymbolNode(node) && (node.name === 'end')\n    })\n\n    return endSymbols.length > 0\n  }\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  RangeNode.prototype._compile = function (math, argNames) {\n    const range = math.range\n    const evalStart = this.start._compile(math, argNames)\n    const evalEnd = this.end._compile(math, argNames)\n\n    if (this.step) {\n      const evalStep = this.step._compile(math, argNames)\n\n      return function evalRangeNode (scope, args, context) {\n        return range(\n          evalStart(scope, args, context),\n          evalEnd(scope, args, context),\n          evalStep(scope, args, context)\n        )\n      }\n    } else {\n      return function evalRangeNode (scope, args, context) {\n        return range(\n          evalStart(scope, args, context),\n          evalEnd(scope, args, context)\n        )\n      }\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  RangeNode.prototype.forEach = function (callback) {\n    callback(this.start, 'start', this)\n    callback(this.end, 'end', this)\n    if (this.step) {\n      callback(this.step, 'step', this)\n    }\n  }\n\n  /**\n   * Create a new RangeNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {RangeNode} Returns a transformed copy of the node\n   */\n  RangeNode.prototype.map = function (callback) {\n    return new RangeNode(\n      this._ifNode(callback(this.start, 'start', this)),\n      this._ifNode(callback(this.end, 'end', this)),\n      this.step && this._ifNode(callback(this.step, 'step', this))\n    )\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {RangeNode}\n   */\n  RangeNode.prototype.clone = function () {\n    return new RangeNode(this.start, this.end, this.step && this.step)\n  }\n\n  /**\n   * Calculate the necessary parentheses\n   * @param {Node} node\n   * @param {string} parenthesis\n   * @return {Object} parentheses\n   * @private\n   */\n  function calculateNecessaryParentheses (node, parenthesis) {\n    const precedence = getPrecedence(node, parenthesis)\n    const parens = {}\n\n    const startPrecedence = getPrecedence(node.start, parenthesis)\n    parens.start = ((startPrecedence !== null) && (startPrecedence <= precedence)) ||\n      (parenthesis === 'all')\n\n    if (node.step) {\n      const stepPrecedence = getPrecedence(node.step, parenthesis)\n      parens.step = ((stepPrecedence !== null) && (stepPrecedence <= precedence)) ||\n        (parenthesis === 'all')\n    }\n\n    const endPrecedence = getPrecedence(node.end, parenthesis)\n    parens.end = ((endPrecedence !== null) && (endPrecedence <= precedence)) ||\n      (parenthesis === 'all')\n\n    return parens\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  RangeNode.prototype._toString = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const parens = calculateNecessaryParentheses(this, parenthesis)\n\n    // format string as start:step:stop\n    let str\n\n    let start = this.start.toString(options)\n    if (parens.start) {\n      start = '(' + start + ')'\n    }\n    str = start\n\n    if (this.step) {\n      let step = this.step.toString(options)\n      if (parens.step) {\n        step = '(' + step + ')'\n      }\n      str += ':' + step\n    }\n\n    let end = this.end.toString(options)\n    if (parens.end) {\n      end = '(' + end + ')'\n    }\n    str += ':' + end\n\n    return str\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  RangeNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'RangeNode',\n      start: this.start,\n      end: this.end,\n      step: this.step\n    }\n  }\n\n  /**\n   * Instantiate an RangeNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"RangeNode\", \"start\": ..., \"end\": ..., \"step\": ...}`,\n   *                       where mathjs is optional\n   * @returns {RangeNode}\n   */\n  RangeNode.fromJSON = function (json) {\n    return new RangeNode(json.start, json.end, json.step)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  RangeNode.prototype.toHTML = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const parens = calculateNecessaryParentheses(this, parenthesis)\n\n    // format string as start:step:stop\n    let str\n\n    let start = this.start.toHTML(options)\n    if (parens.start) {\n      start = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + start + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n    str = start\n\n    if (this.step) {\n      let step = this.step.toHTML(options)\n      if (parens.step) {\n        step = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + step + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n      str += '<span class=\"math-operator math-range-operator\">:</span>' + step\n    }\n\n    let end = this.end.toHTML(options)\n    if (parens.end) {\n      end = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + end + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n    }\n    str += '<span class=\"math-operator math-range-operator\">:</span>' + end\n\n    return str\n  }\n\n  /**\n   * Get LaTeX representation\n   * @params {Object} options\n   * @return {string} str\n   */\n  RangeNode.prototype._toTex = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const parens = calculateNecessaryParentheses(this, parenthesis)\n\n    let str = this.start.toTex(options)\n    if (parens.start) {\n      str = `\\\\left(${str}\\\\right)`\n    }\n\n    if (this.step) {\n      let step = this.step.toTex(options)\n      if (parens.step) {\n        step = `\\\\left(${step}\\\\right)`\n      }\n      str += ':' + step\n    }\n\n    let end = this.end.toTex(options)\n    if (parens.end) {\n      end = `\\\\left(${end}\\\\right)`\n    }\n    str += ':' + end\n\n    return str\n  }\n\n  return RangeNode\n}, { isClass: true, isNode: true })\n","import { getPrecedence } from '../operators.js'\nimport { escape } from '../../utils/string.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { latexOperators } from '../../utils/latex.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'RelationalNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createRelationalNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * A node representing a chained conditional expression, such as 'x > y > z'\n   *\n   * @param {String[]} conditionals   An array of conditional operators used to compare the parameters\n   * @param {Node[]} params   The parameters that will be compared\n   *\n   * @constructor RelationalNode\n   * @extends {Node}\n   */\n  function RelationalNode (conditionals, params) {\n    if (!(this instanceof RelationalNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n    if (!Array.isArray(conditionals)) throw new TypeError('Parameter conditionals must be an array')\n    if (!Array.isArray(params)) throw new TypeError('Parameter params must be an array')\n    if (conditionals.length !== params.length - 1) throw new TypeError('Parameter params must contain exactly one more element than parameter conditionals')\n\n    this.conditionals = conditionals\n    this.params = params\n  }\n\n  RelationalNode.prototype = new Node()\n\n  RelationalNode.prototype.type = 'RelationalNode'\n\n  RelationalNode.prototype.isRelationalNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  RelationalNode.prototype._compile = function (math, argNames) {\n    const self = this\n\n    const compiled = this.params.map(p => p._compile(math, argNames))\n\n    return function evalRelationalNode (scope, args, context) {\n      let evalLhs\n      let evalRhs = compiled[0](scope, args, context)\n\n      for (let i = 0; i < self.conditionals.length; i++) {\n        evalLhs = evalRhs\n        evalRhs = compiled[i + 1](scope, args, context)\n        const condFn = getSafeProperty(math, self.conditionals[i])\n        if (!condFn(evalLhs, evalRhs)) {\n          return false\n        }\n      }\n      return true\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  RelationalNode.prototype.forEach = function (callback) {\n    this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this)\n  }\n\n  /**\n   * Create a new RelationalNode having its childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {RelationalNode} Returns a transformed copy of the node\n   */\n  RelationalNode.prototype.map = function (callback) {\n    return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this))\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {RelationalNode}\n   */\n  RelationalNode.prototype.clone = function () {\n    return new RelationalNode(this.conditionals, this.params)\n  }\n\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n  RelationalNode.prototype._toString = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const precedence = getPrecedence(this, parenthesis)\n\n    const paramStrings = this.params.map(function (p, index) {\n      const paramPrecedence = getPrecedence(p, parenthesis)\n      return (parenthesis === 'all' || (paramPrecedence !== null && paramPrecedence <= precedence))\n        ? '(' + p.toString(options) + ')'\n        : p.toString(options)\n    })\n\n    const operatorMap = {\n      equal: '==',\n      unequal: '!=',\n      smaller: '<',\n      larger: '>',\n      smallerEq: '<=',\n      largerEq: '>='\n    }\n\n    let ret = paramStrings[0]\n    for (let i = 0; i < this.conditionals.length; i++) {\n      ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1]\n    }\n\n    return ret\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  RelationalNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'RelationalNode',\n      conditionals: this.conditionals,\n      params: this.params\n    }\n  }\n\n  /**\n   * Instantiate a RelationalNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"RelationalNode\", \"condition\": ..., \"trueExpr\": ..., \"falseExpr\": ...}`,\n   *                       where mathjs is optional\n   * @returns {RelationalNode}\n   */\n  RelationalNode.fromJSON = function (json) {\n    return new RelationalNode(json.conditionals, json.params)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  RelationalNode.prototype.toHTML = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const precedence = getPrecedence(this, parenthesis)\n\n    const paramStrings = this.params.map(function (p, index) {\n      const paramPrecedence = getPrecedence(p, parenthesis)\n      return (parenthesis === 'all' || (paramPrecedence !== null && paramPrecedence <= precedence))\n        ? '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + p.toHTML(options) + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n        : p.toHTML(options)\n    })\n\n    const operatorMap = {\n      equal: '==',\n      unequal: '!=',\n      smaller: '<',\n      larger: '>',\n      smallerEq: '<=',\n      largerEq: '>='\n    }\n\n    let ret = paramStrings[0]\n    for (let i = 0; i < this.conditionals.length; i++) {\n      ret += '<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">' + escape(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1]\n    }\n\n    return ret\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  RelationalNode.prototype._toTex = function (options) {\n    const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n    const precedence = getPrecedence(this, parenthesis)\n\n    const paramStrings = this.params.map(function (p, index) {\n      const paramPrecedence = getPrecedence(p, parenthesis)\n      return (parenthesis === 'all' || (paramPrecedence !== null && paramPrecedence <= precedence))\n        ? '\\\\left(' + p.toTex(options) + '\\right)'\n        : p.toTex(options)\n    })\n\n    let ret = paramStrings[0]\n    for (let i = 0; i < this.conditionals.length; i++) {\n      ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1]\n    }\n\n    return ret\n  }\n\n  return RelationalNode\n}, { isClass: true, isNode: true })\n","import { escape } from '../../utils/string.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { toSymbol } from '../../utils/latex.js'\n\nconst name = 'SymbolNode'\nconst dependencies = [\n  'math',\n  '?Unit',\n  'Node'\n]\n\nexport const createSymbolNode = /* #__PURE__ */ factory(name, dependencies, ({ math, Unit, Node }) => {\n  /**\n   * Check whether some name is a valueless unit like \"inch\".\n   * @param {string} name\n   * @return {boolean}\n   */\n  function isValuelessUnit (name) {\n    return Unit ? Unit.isValuelessUnit(name) : false\n  }\n\n  /**\n   * @constructor SymbolNode\n   * @extends {Node}\n   * A symbol node can hold and resolve a symbol\n   * @param {string} name\n   * @extends {Node}\n   */\n  function SymbolNode (name) {\n    if (!(this instanceof SymbolNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    // validate input\n    if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"')\n\n    this.name = name\n  }\n\n  SymbolNode.prototype = new Node()\n\n  SymbolNode.prototype.type = 'SymbolNode'\n\n  SymbolNode.prototype.isSymbolNode = true\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  SymbolNode.prototype._compile = function (math, argNames) {\n    const name = this.name\n\n    if (argNames[name] === true) {\n      // this is a FunctionAssignment argument\n      // (like an x when inside the expression of a function assignment `f(x) = ...`)\n      return function (scope, args, context) {\n        return args[name]\n      }\n    } else if (name in math) {\n      return function (scope, args, context) {\n        return scope.has(name)\n          ? scope.get(name)\n          : getSafeProperty(math, name)\n      }\n    } else {\n      const isUnit = isValuelessUnit(name)\n\n      return function (scope, args, context) {\n        return scope.has(name)\n          ? scope.get(name)\n          : isUnit\n            ? new Unit(null, name)\n            : SymbolNode.onUndefinedSymbol(name)\n      }\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  SymbolNode.prototype.forEach = function (callback) {\n    // nothing to do, we don't have childs\n  }\n\n  /**\n   * Create a new SymbolNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node) : Node} callback\n   * @returns {SymbolNode} Returns a clone of the node\n   */\n  SymbolNode.prototype.map = function (callback) {\n    return this.clone()\n  }\n\n  /**\n   * Throws an error 'Undefined symbol {name}'\n   * @param {string} name\n   */\n  SymbolNode.onUndefinedSymbol = function (name) {\n    throw new Error('Undefined symbol ' + name)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {SymbolNode}\n   */\n  SymbolNode.prototype.clone = function () {\n    return new SymbolNode(this.name)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  SymbolNode.prototype._toString = function (options) {\n    return this.name\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  SymbolNode.prototype.toHTML = function (options) {\n    const name = escape(this.name)\n\n    if (name === 'true' || name === 'false') {\n      return '<span class=\"math-symbol math-boolean\">' + name + '</span>'\n    } else if (name === 'i') {\n      return '<span class=\"math-symbol math-imaginary-symbol\">' + name + '</span>'\n    } else if (name === 'Infinity') {\n      return '<span class=\"math-symbol math-infinity-symbol\">' + name + '</span>'\n    } else if (name === 'NaN') {\n      return '<span class=\"math-symbol math-nan-symbol\">' + name + '</span>'\n    } else if (name === 'null') {\n      return '<span class=\"math-symbol math-null-symbol\">' + name + '</span>'\n    } else if (name === 'undefined') {\n      return '<span class=\"math-symbol math-undefined-symbol\">' + name + '</span>'\n    }\n\n    return '<span class=\"math-symbol\">' + name + '</span>'\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  SymbolNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'SymbolNode',\n      name: this.name\n    }\n  }\n\n  /**\n   * Instantiate a SymbolNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SymbolNode\", name: \"x\"}`,\n   *                       where mathjs is optional\n   * @returns {SymbolNode}\n   */\n  SymbolNode.fromJSON = function (json) {\n    return new SymbolNode(json.name)\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  SymbolNode.prototype._toTex = function (options) {\n    let isUnit = false\n    if ((typeof math[this.name] === 'undefined') && isValuelessUnit(this.name)) {\n      isUnit = true\n    }\n    const symbol = toSymbol(this.name, isUnit)\n    if (symbol[0] === '\\\\') {\n      // no space needed if the symbol starts with '\\'\n      return symbol\n    }\n    // the space prevents symbols from breaking stuff like '\\cdot' if it's written right before the symbol\n    return ' ' + symbol\n  }\n\n  return SymbolNode\n}, { isClass: true, isNode: true })\n","import { createEmptyMap, assign } from './map.js'\n\n/**\n * Create a new scope which can access the parent scope,\n * but does not affect it when written. This is suitable for variable definitions\n * within a block node, or function definition.\n *\n * If parent scope has a createSubScope method, it delegates to that. Otherwise,\n * creates an empty map, and copies the parent scope to it, adding in\n * the remaining `args`.\n *\n * @param {Map} parentScope\n * @param  {...any} args\n * @returns {Map}\n */\nexport function createSubScope (parentScope, ...args) {\n  if (typeof parentScope.createSubScope === 'function') {\n    return assign(parentScope.createSubScope(), ...args)\n  }\n\n  return assign(createEmptyMap(), parentScope, ...args)\n}\n","import { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js'\nimport { escape, format } from '../../utils/string.js'\nimport { hasOwnProperty } from '../../utils/object.js'\nimport { getSafeProperty, validateSafeMethod } from '../../utils/customs.js'\nimport { createSubScope } from '../../utils/scope.js'\nimport { factory } from '../../utils/factory.js'\nimport { defaultTemplate, latexFunctions } from '../../utils/latex.js'\n\nconst name = 'FunctionNode'\nconst dependencies = [\n  'math',\n  'Node',\n  'SymbolNode'\n]\n\nexport const createFunctionNode = /* #__PURE__ */ factory(name, dependencies, ({ math, Node, SymbolNode }) => {\n  /**\n   * @constructor FunctionNode\n   * @extends {./Node}\n   * invoke a list with arguments on a node\n   * @param {./Node | string} fn Node resolving with a function on which to invoke\n   *                             the arguments, typically a SymboNode or AccessorNode\n   * @param {./Node[]} args\n   */\n  function FunctionNode (fn, args) {\n    if (!(this instanceof FunctionNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    if (typeof fn === 'string') {\n      fn = new SymbolNode(fn)\n    }\n\n    // validate input\n    if (!isNode(fn)) throw new TypeError('Node expected as parameter \"fn\"')\n    if (!Array.isArray(args) || !args.every(isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"args\"')\n    }\n\n    this.fn = fn\n    this.args = args || []\n\n    // readonly property name\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        return this.fn.name || ''\n      }.bind(this),\n      set: function () {\n        throw new Error('Cannot assign a new name, name is read-only')\n      }\n    })\n  }\n\n  FunctionNode.prototype = new Node()\n\n  FunctionNode.prototype.type = 'FunctionNode'\n\n  FunctionNode.prototype.isFunctionNode = true\n\n  /* format to fixed length */\n  const strin = entity => format(entity, { truncate: 78 })\n\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n  FunctionNode.prototype._compile = function (math, argNames) {\n    if (!(this instanceof FunctionNode)) {\n      throw new TypeError('No valid FunctionNode')\n    }\n\n    // compile arguments\n    const evalArgs = this.args.map((arg) => arg._compile(math, argNames))\n\n    if (isSymbolNode(this.fn)) {\n      const name = this.fn.name\n      if (!argNames[name]) {\n        // we can statically determine whether the function has an rawArgs property\n        const fn = name in math ? getSafeProperty(math, name) : undefined\n        const isRaw = typeof fn === 'function' && fn.rawArgs === true\n\n        const resolveFn = (scope) => {\n          let value\n          if (scope.has(name)) {\n            value = scope.get(name)\n          } else if (name in math) {\n            value = getSafeProperty(math, name)\n          } else {\n            return FunctionNode.onUndefinedFunction(name)\n          }\n          if (typeof value === 'function') {\n            return value\n          }\n          throw new TypeError(\n            `'${name}' is not a function; its value is:\\n  ${strin(value)}`\n          )\n        }\n\n        if (isRaw) {\n          // pass unevaluated parameters (nodes) to the function\n          // \"raw\" evaluation\n          const rawArgs = this.args\n          return function evalFunctionNode (scope, args, context) {\n            const fn = resolveFn(scope)\n            return fn(rawArgs, math, createSubScope(scope, args), scope)\n          }\n        } else {\n          // \"regular\" evaluation\n          switch (evalArgs.length) {\n            case 0: return function evalFunctionNode (scope, args, context) {\n              const fn = resolveFn(scope)\n              return fn()\n            }\n            case 1: return function evalFunctionNode (scope, args, context) {\n              const fn = resolveFn(scope)\n              const evalArg0 = evalArgs[0]\n              return fn(\n                evalArg0(scope, args, context)\n              )\n            }\n            case 2: return function evalFunctionNode (scope, args, context) {\n              const fn = resolveFn(scope)\n              const evalArg0 = evalArgs[0]\n              const evalArg1 = evalArgs[1]\n              return fn(\n                evalArg0(scope, args, context),\n                evalArg1(scope, args, context)\n              )\n            }\n            default: return function evalFunctionNode (scope, args, context) {\n              const fn = resolveFn(scope)\n              const values = evalArgs.map((evalArg) => evalArg(scope, args, context))\n              return fn(...values)\n            }\n          }\n        }\n      } else { // the function symbol is an argName\n        const rawArgs = this.args\n        return function evalFunctionNode (scope, args, context) {\n          const fn = args[name]\n          if (typeof fn !== 'function') {\n            throw new TypeError(\n              `Argument '${name}' was not a function; received: ${strin(fn)}`\n            )\n          }\n          if (fn.rawArgs) {\n            return fn(rawArgs, math, createSubScope(scope, args), scope) // \"raw\" evaluation\n          } else {\n            const values = evalArgs.map((evalArg) => evalArg(scope, args, context))\n            return fn.apply(fn, values)\n          }\n        }\n      }\n    } else if (\n      isAccessorNode(this.fn) &&\n      isIndexNode(this.fn.index) &&\n      this.fn.index.isObjectProperty()\n    ) {\n      // execute the function with the right context: the object of the AccessorNode\n\n      const evalObject = this.fn.object._compile(math, argNames)\n      const prop = this.fn.index.getObjectProperty()\n      const rawArgs = this.args\n\n      return function evalFunctionNode (scope, args, context) {\n        const object = evalObject(scope, args, context)\n        validateSafeMethod(object, prop)\n        const isRaw = object[prop] && object[prop].rawArgs\n\n        if (isRaw) {\n          return object[prop](rawArgs, math, createSubScope(scope, args), scope) // \"raw\" evaluation\n        } else {\n          // \"regular\" evaluation\n          const values = evalArgs.map((evalArg) => evalArg(scope, args, context))\n          return object[prop].apply(object, values)\n        }\n      }\n    } else {\n      // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()\n      // we have to dynamically determine whether the function has a rawArgs property\n      const fnExpr = this.fn.toString()\n      const evalFn = this.fn._compile(math, argNames)\n      const rawArgs = this.args\n\n      return function evalFunctionNode (scope, args, context) {\n        const fn = evalFn(scope, args, context)\n        if (typeof fn !== 'function') {\n          throw new TypeError(\n            `Expression '${fnExpr}' did not evaluate to a function; value is:` +\n            `\\n  ${strin(fn)}`\n          )\n        }\n        if (fn.rawArgs) {\n          return fn(rawArgs, math, createSubScope(scope, args), scope) // \"raw\" evaluation\n        } else {\n          // \"regular\" evaluation\n          const values = evalArgs.map((evalArg) => evalArg(scope, args, context))\n          return fn.apply(fn, values)\n        }\n      }\n    }\n  }\n\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n  FunctionNode.prototype.forEach = function (callback) {\n    callback(this.fn, 'fn', this)\n\n    for (let i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this)\n    }\n  }\n\n  /**\n   * Create a new FunctionNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {FunctionNode} Returns a transformed copy of the node\n   */\n  FunctionNode.prototype.map = function (callback) {\n    const fn = this._ifNode(callback(this.fn, 'fn', this))\n    const args = []\n    for (let i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this))\n    }\n    return new FunctionNode(fn, args)\n  }\n\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionNode}\n   */\n  FunctionNode.prototype.clone = function () {\n    return new FunctionNode(this.fn, this.args.slice(0))\n  }\n\n  /**\n   * Throws an error 'Undefined function {name}'\n   * @param {string} name\n   */\n  FunctionNode.onUndefinedFunction = function (name) {\n    throw new Error('Undefined function ' + name)\n  }\n\n  // backup Node's toString function\n  // @private\n  const nodeToString = FunctionNode.prototype.toString\n\n  /**\n   * Get string representation. (wrapper function)\n   * This overrides parts of Node's toString function.\n   * If callback is an object containing callbacks, it\n   * calls the correct callback for the current node,\n   * otherwise it falls back to calling Node's toString\n   * function.\n   *\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n  FunctionNode.prototype.toString = function (options) {\n    let customString\n    const name = this.fn.toString(options)\n    if (options && (typeof options.handler === 'object') && hasOwnProperty(options.handler, name)) {\n      // callback is a map of callback functions\n      customString = options.handler[name](this, options)\n    }\n\n    if (typeof customString !== 'undefined') {\n      return customString\n    }\n\n    // fall back to Node's toString\n    return nodeToString.call(this, options)\n  }\n\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  FunctionNode.prototype._toString = function (options) {\n    const args = this.args.map(function (arg) {\n      return arg.toString(options)\n    })\n\n    const fn = isFunctionAssignmentNode(this.fn)\n      ? ('(' + this.fn.toString(options) + ')')\n      : this.fn.toString(options)\n\n    // format the arguments like \"add(2, 4.2)\"\n    return fn + '(' + args.join(', ') + ')'\n  }\n\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n  FunctionNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'FunctionNode',\n      fn: this.fn,\n      args: this.args\n    }\n  }\n\n  /**\n   * Instantiate an AssignmentNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"FunctionNode\", fn: ..., args: ...}`,\n   *                       where mathjs is optional\n   * @returns {FunctionNode}\n   */\n  FunctionNode.fromJSON = function (json) {\n    return new FunctionNode(json.fn, json.args)\n  }\n\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  FunctionNode.prototype.toHTML = function (options) {\n    const args = this.args.map(function (arg) {\n      return arg.toHTML(options)\n    })\n\n    // format the arguments like \"add(2, 4.2)\"\n    return '<span class=\"math-function\">' + escape(this.fn) + '</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>' + args.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>'\n  }\n\n  /*\n   * Expand a LaTeX template\n   *\n   * @param {string} template\n   * @param {Node} node\n   * @param {Object} options\n   * @private\n   **/\n  function expandTemplate (template, node, options) {\n    let latex = ''\n\n    // Match everything of the form ${identifier} or ${identifier[2]} or $$\n    // while submatching identifier and 2 (in the second case)\n    const regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi\n\n    let inputPos = 0 // position in the input string\n    let match\n    while ((match = regex.exec(template)) !== null) { // go through all matches\n      // add everything in front of the match to the LaTeX string\n      latex += template.substring(inputPos, match.index)\n      inputPos = match.index\n\n      if (match[0] === '$$') { // escaped dollar sign\n        latex += '$'\n        inputPos++\n      } else { // template parameter\n        inputPos += match[0].length\n        const property = node[match[1]]\n        if (!property) {\n          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.')\n        }\n        if (match[2] === undefined) { // no square brackets\n          switch (typeof property) {\n            case 'string':\n              latex += property\n              break\n            case 'object':\n              if (isNode(property)) {\n                latex += property.toTex(options)\n              } else if (Array.isArray(property)) {\n                // make array of Nodes into comma separated list\n                latex += property.map(function (arg, index) {\n                  if (isNode(arg)) {\n                    return arg.toTex(options)\n                  }\n                  throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.')\n                }).join(',')\n              } else {\n                throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes')\n              }\n              break\n            default:\n              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes')\n          }\n        } else { // with square brackets\n          if (isNode(property[match[2]] && property[match[2]])) {\n            latex += property[match[2]].toTex(options)\n          } else {\n            throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.')\n          }\n        }\n      }\n    }\n    latex += template.slice(inputPos) // append rest of the template\n\n    return latex\n  }\n\n  // backup Node's toTex function\n  // @private\n  const nodeToTex = FunctionNode.prototype.toTex\n\n  /**\n   * Get LaTeX representation. (wrapper function)\n   * This overrides parts of Node's toTex function.\n   * If callback is an object containing callbacks, it\n   * calls the correct callback for the current node,\n   * otherwise it falls back to calling Node's toTex\n   * function.\n   *\n   * @param {Object} options\n   * @return {string}\n   */\n  FunctionNode.prototype.toTex = function (options) {\n    let customTex\n    if (options && (typeof options.handler === 'object') && hasOwnProperty(options.handler, this.name)) {\n      // callback is a map of callback functions\n      customTex = options.handler[this.name](this, options)\n    }\n\n    if (typeof customTex !== 'undefined') {\n      return customTex\n    }\n\n    // fall back to Node's toTex\n    return nodeToTex.call(this, options)\n  }\n\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n  FunctionNode.prototype._toTex = function (options) {\n    const args = this.args.map(function (arg) { // get LaTeX of the arguments\n      return arg.toTex(options)\n    })\n\n    let latexConverter\n\n    if (latexFunctions[this.name]) {\n      latexConverter = latexFunctions[this.name]\n    }\n\n    // toTex property on the function itself\n    if (math[this.name] &&\n      ((typeof math[this.name].toTex === 'function') ||\n        (typeof math[this.name].toTex === 'object') ||\n        (typeof math[this.name].toTex === 'string'))\n    ) {\n      // .toTex is a callback function\n      latexConverter = math[this.name].toTex\n    }\n\n    let customToTex\n    switch (typeof latexConverter) {\n      case 'function': // a callback function\n        customToTex = latexConverter(this, options)\n        break\n      case 'string': // a template string\n        customToTex = expandTemplate(latexConverter, this, options)\n        break\n      case 'object': // an object with different \"converters\" for different numbers of arguments\n        switch (typeof latexConverter[args.length]) {\n          case 'function':\n            customToTex = latexConverter[args.length](this, options)\n            break\n          case 'string':\n            customToTex = expandTemplate(latexConverter[args.length], this, options)\n            break\n        }\n    }\n\n    if (typeof customToTex !== 'undefined') {\n      return customToTex\n    }\n\n    return expandTemplate(defaultTemplate, this, options)\n  }\n\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n  FunctionNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.name\n  }\n\n  return FunctionNode\n}, { isClass: true, isNode: true })\n","import { factory } from '../utils/factory.js'\nimport { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode } from '../utils/is.js'\nimport { deepMap } from '../utils/collection.js'\nimport { hasOwnProperty } from '../utils/object.js'\n\nconst name = 'parse'\nconst dependencies = [\n  'typed',\n  'numeric',\n  'config',\n  'AccessorNode',\n  'ArrayNode',\n  'AssignmentNode',\n  'BlockNode',\n  'ConditionalNode',\n  'ConstantNode',\n  'FunctionAssignmentNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'RangeNode',\n  'RelationalNode',\n  'SymbolNode'\n]\n\nexport const createParse = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  numeric,\n  config,\n  AccessorNode,\n  ArrayNode,\n  AssignmentNode,\n  BlockNode,\n  ConditionalNode,\n  ConstantNode,\n  FunctionAssignmentNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  RangeNode,\n  RelationalNode,\n  SymbolNode\n}) => {\n  /**\n   * Parse an expression. Returns a node tree, which can be evaluated by\n   * invoking node.evaluate().\n   *\n   * Note the evaluating arbitrary expressions may involve security risks,\n   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n   *\n   * Syntax:\n   *\n   *     math.parse(expr)\n   *     math.parse(expr, options)\n   *     math.parse([expr1, expr2, expr3, ...])\n   *     math.parse([expr1, expr2, expr3, ...], options)\n   *\n   * Example:\n   *\n   *     const node1 = math.parse('sqrt(3^2 + 4^2)')\n   *     node1.compile().evaluate() // 5\n   *\n   *     let scope = {a:3, b:4}\n   *     const node2 = math.parse('a * b') // 12\n   *     const code2 = node2.compile()\n   *     code2.evaluate(scope) // 12\n   *     scope.a = 5\n   *     code2.evaluate(scope) // 20\n   *\n   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].compile().evaluate() // 12\n   *\n   * See also:\n   *\n   *     evaluate, compile\n   *\n   * @param {string | string[] | Matrix} expr          Expression to be parsed\n   * @param {{nodes: Object<string, Node>}} [options]  Available options:\n   *                                                   - `nodes` a set of custom nodes\n   * @return {Node | Node[]} node\n   * @throws {Error}\n   */\n  const parse = typed(name, {\n    string: function (expression) {\n      return parseStart(expression, {})\n    },\n    'Array | Matrix': function (expressions) {\n      return parseMultiple(expressions, {})\n    },\n    'string, Object': function (expression, options) {\n      const extraNodes = options.nodes !== undefined ? options.nodes : {}\n\n      return parseStart(expression, extraNodes)\n    },\n    'Array | Matrix, Object': parseMultiple\n  })\n\n  function parseMultiple (expressions, options = {}) {\n    const extraNodes = options.nodes !== undefined ? options.nodes : {}\n\n    // parse an array or matrix with expressions\n    return deepMap(expressions, function (elem) {\n      if (typeof elem !== 'string') throw new TypeError('String expected')\n\n      return parseStart(elem, extraNodes)\n    })\n  }\n\n  // token types enumeration\n  const TOKENTYPE = {\n    NULL: 0,\n    DELIMITER: 1,\n    NUMBER: 2,\n    SYMBOL: 3,\n    UNKNOWN: 4\n  }\n\n  // map with all delimiters\n  const DELIMITERS = {\n    ',': true,\n    '(': true,\n    ')': true,\n    '[': true,\n    ']': true,\n    '{': true,\n    '}': true,\n    '\"': true,\n    '\\'': true,\n    ';': true,\n\n    '+': true,\n    '-': true,\n    '*': true,\n    '.*': true,\n    '/': true,\n    './': true,\n    '%': true,\n    '^': true,\n    '.^': true,\n    '~': true,\n    '!': true,\n    '&': true,\n    '|': true,\n    '^|': true,\n    '=': true,\n    ':': true,\n    '?': true,\n\n    '==': true,\n    '!=': true,\n    '<': true,\n    '>': true,\n    '<=': true,\n    '>=': true,\n\n    '<<': true,\n    '>>': true,\n    '>>>': true\n  }\n\n  // map with all named delimiters\n  const NAMED_DELIMITERS = {\n    mod: true,\n    to: true,\n    in: true,\n    and: true,\n    xor: true,\n    or: true,\n    not: true\n  }\n\n  const CONSTANTS = {\n    true: true,\n    false: false,\n    null: null,\n    undefined: undefined\n  }\n\n  const NUMERIC_CONSTANTS = [\n    'NaN',\n    'Infinity'\n  ]\n\n  function initialState () {\n    return {\n      extraNodes: {}, // current extra nodes, must be careful not to mutate\n      expression: '', // current expression\n      comment: '', // last parsed comment\n      index: 0, // current index in expr\n      token: '', // current token\n      tokenType: TOKENTYPE.NULL, // type of the token\n      nestingLevel: 0, // level of nesting inside parameters, used to ignore newline characters\n      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here\n    }\n  }\n\n  /**\n   * View upto `length` characters of the expression starting at the current character.\n   *\n   * @param {Object} state\n   * @param {number} [length=1] Number of characters to view\n   * @returns {string}\n   * @private\n   */\n  function currentString (state, length) {\n    return state.expression.substr(state.index, length)\n  }\n\n  /**\n   * View the current character. Returns '' if end of expression is reached.\n   *\n   * @param {Object} state\n   * @returns {string}\n   * @private\n   */\n  function currentCharacter (state) {\n    return currentString(state, 1)\n  }\n\n  /**\n   * Get the next character from the expression.\n   * The character is stored into the char c. If the end of the expression is\n   * reached, the function puts an empty string in c.\n   * @private\n   */\n  function next (state) {\n    state.index++\n  }\n\n  /**\n   * Preview the previous character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n  function prevCharacter (state) {\n    return state.expression.charAt(state.index - 1)\n  }\n\n  /**\n   * Preview the next character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n  function nextCharacter (state) {\n    return state.expression.charAt(state.index + 1)\n  }\n\n  /**\n   * Get next token in the current string expr.\n   * The token and token type are available as token and tokenType\n   * @private\n   */\n  function getToken (state) {\n    state.tokenType = TOKENTYPE.NULL\n    state.token = ''\n    state.comment = ''\n\n    // skip over ignored characters:\n    while (true) {\n      // comments:\n      if (currentCharacter(state) === '#') {\n        while (currentCharacter(state) !== '\\n' &&\n               currentCharacter(state) !== '') {\n          state.comment += currentCharacter(state)\n          next(state)\n        }\n      }\n      // whitespace: space, tab, and newline when inside parameters\n      if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n        next(state)\n      } else {\n        break\n      }\n    }\n\n    // check for end of expression\n    if (currentCharacter(state) === '') {\n      // token is still empty\n      state.tokenType = TOKENTYPE.DELIMITER\n      return\n    }\n\n    // check for new line character\n    if (currentCharacter(state) === '\\n' && !state.nestingLevel) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = currentCharacter(state)\n      next(state)\n      return\n    }\n\n    const c1 = currentCharacter(state)\n    const c2 = currentString(state, 2)\n    const c3 = currentString(state, 3)\n    if (c3.length === 3 && DELIMITERS[c3]) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = c3\n      next(state)\n      next(state)\n      next(state)\n      return\n    }\n\n    // check for delimiters consisting of 2 characters\n    if (c2.length === 2 && DELIMITERS[c2]) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = c2\n      next(state)\n      next(state)\n      return\n    }\n\n    // check for delimiters consisting of 1 character\n    if (DELIMITERS[c1]) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = c1\n      next(state)\n      return\n    }\n\n    // check for a number\n    if (parse.isDigitDot(c1)) {\n      state.tokenType = TOKENTYPE.NUMBER\n\n      // check for binary, octal, or hex\n      const c2 = currentString(state, 2)\n      if (c2 === '0b' || c2 === '0o' || c2 === '0x') {\n        state.token += currentCharacter(state)\n        next(state)\n        state.token += currentCharacter(state)\n        next(state)\n        while (parse.isHexDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state)\n          next(state)\n        }\n        if (currentCharacter(state) === '.') {\n          // this number has a radix point\n          state.token += '.'\n          next(state)\n          // get the digits after the radix\n          while (parse.isHexDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n        } else if (currentCharacter(state) === 'i') {\n          // this number has a word size suffix\n          state.token += 'i'\n          next(state)\n          // get the word size\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n        }\n        return\n      }\n\n      // get number, can have a single dot\n      if (currentCharacter(state) === '.') {\n        state.token += currentCharacter(state)\n        next(state)\n\n        if (!parse.isDigit(currentCharacter(state))) {\n          // this is no number, it is just a dot (can be dot notation)\n          state.tokenType = TOKENTYPE.DELIMITER\n          return\n        }\n      } else {\n        while (parse.isDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state)\n          next(state)\n        }\n        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n          state.token += currentCharacter(state)\n          next(state)\n        }\n      }\n\n      while (parse.isDigit(currentCharacter(state))) {\n        state.token += currentCharacter(state)\n        next(state)\n      }\n      // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n      if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {\n        if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {\n          state.token += currentCharacter(state)\n          next(state)\n\n          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n          // Scientific notation MUST be followed by an exponent\n          if (!parse.isDigit(currentCharacter(state))) {\n            throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"')\n          }\n\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n\n          if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n            throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"')\n          }\n        } else if (nextCharacter(state) === '.') {\n          next(state)\n          throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"')\n        }\n      }\n\n      return\n    }\n\n    // check for variables, functions, named operators\n    if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {\n      while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n        state.token += currentCharacter(state)\n        next(state)\n      }\n\n      if (hasOwnProperty(NAMED_DELIMITERS, state.token)) {\n        state.tokenType = TOKENTYPE.DELIMITER\n      } else {\n        state.tokenType = TOKENTYPE.SYMBOL\n      }\n\n      return\n    }\n\n    // something unknown is found, wrong characters -> a syntax error\n    state.tokenType = TOKENTYPE.UNKNOWN\n    while (currentCharacter(state) !== '') {\n      state.token += currentCharacter(state)\n      next(state)\n    }\n    throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"')\n  }\n\n  /**\n   * Get next token and skip newline tokens\n   */\n  function getTokenSkipNewline (state) {\n    do {\n      getToken(state)\n    }\n    while (state.token === '\\n') // eslint-disable-line no-unmodified-loop-condition\n  }\n\n  /**\n   * Open parameters.\n   * New line characters will be ignored until closeParams(state) is called\n   */\n  function openParams (state) {\n    state.nestingLevel++\n  }\n\n  /**\n   * Close parameters.\n   * New line characters will no longer be ignored\n   */\n  function closeParams (state) {\n    state.nestingLevel--\n  }\n\n  /**\n   * Checks whether the current character `c` is a valid alpha character:\n   *\n   * - A latin letter (upper or lower case) Ascii: a-z, A-Z\n   * - An underscore                        Ascii: _\n   * - A dollar sign                        Ascii: $\n   * - A latin letter with accents          Unicode: \\u00C0 - \\u02AF\n   * - A greek letter                       Unicode: \\u0370 - \\u03FF\n   * - A mathematical alphanumeric symbol   Unicode: \\u{1D400} - \\u{1D7FF} excluding invalid code points\n   *\n   * The previous and next characters are needed to determine whether\n   * this character is part of a unicode surrogate pair.\n   *\n   * @param {string} c      Current character in the expression\n   * @param {string} cPrev  Previous character\n   * @param {string} cNext  Next character\n   * @return {boolean}\n   */\n  parse.isAlpha = function isAlpha (c, cPrev, cNext) {\n    return parse.isValidLatinOrGreek(c) ||\n        parse.isValidMathSymbol(c, cNext) ||\n        parse.isValidMathSymbol(cPrev, c)\n  }\n\n  /**\n   * Test whether a character is a valid latin, greek, or letter-like character\n   * @param {string} c\n   * @return {boolean}\n   */\n  parse.isValidLatinOrGreek = function isValidLatinOrGreek (c) {\n    return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c)\n  }\n\n  /**\n   * Test whether two given 16 bit characters form a surrogate pair of a\n   * unicode math symbol.\n   *\n   * https://unicode-table.com/en/\n   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode\n   *\n   * Note: In ES6 will be unicode aware:\n   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes\n   * https://mathiasbynens.be/notes/es6-unicode-regex\n   *\n   * @param {string} high\n   * @param {string} low\n   * @return {boolean}\n   */\n  parse.isValidMathSymbol = function isValidMathSymbol (high, low) {\n    return /^[\\uD835]$/.test(high) &&\n        /^[\\uDC00-\\uDFFF]$/.test(low) &&\n        /^[^\\uDC55\\uDC9D\\uDCA0\\uDCA1\\uDCA3\\uDCA4\\uDCA7\\uDCA8\\uDCAD\\uDCBA\\uDCBC\\uDCC4\\uDD06\\uDD0B\\uDD0C\\uDD15\\uDD1D\\uDD3A\\uDD3F\\uDD45\\uDD47-\\uDD49\\uDD51\\uDEA6\\uDEA7\\uDFCC\\uDFCD]$/.test(low)\n  }\n\n  /**\n   * Check whether given character c is a white space character: space, tab, or enter\n   * @param {string} c\n   * @param {number} nestingLevel\n   * @return {boolean}\n   */\n  parse.isWhitespace = function isWhitespace (c, nestingLevel) {\n    // TODO: also take '\\r' carriage return as newline? Or does that give problems on mac?\n    return c === ' ' || c === '\\t' || (c === '\\n' && nestingLevel > 0)\n  }\n\n  /**\n   * Test whether the character c is a decimal mark (dot).\n   * This is the case when it's not the start of a delimiter '.*', './', or '.^'\n   * @param {string} c\n   * @param {string} cNext\n   * @return {boolean}\n   */\n  parse.isDecimalMark = function isDecimalMark (c, cNext) {\n    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^'\n  }\n\n  /**\n   * checks if the given char c is a digit or dot\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n  parse.isDigitDot = function isDigitDot (c) {\n    return ((c >= '0' && c <= '9') || c === '.')\n  }\n\n  /**\n   * checks if the given char c is a digit\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n  parse.isDigit = function isDigit (c) {\n    return (c >= '0' && c <= '9')\n  }\n\n  /**\n   * checks if the given char c is a hex digit\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n  parse.isHexDigit = function isHexDigit (c) {\n    return ((c >= '0' && c <= '9') ||\n            (c >= 'a' && c <= 'f') ||\n            (c >= 'A' && c <= 'F'))\n  }\n\n  /**\n   * Start of the parse levels below, in order of precedence\n   * @return {Node} node\n   * @private\n   */\n  function parseStart (expression, extraNodes) {\n    const state = initialState()\n    Object.assign(state, { expression, extraNodes })\n    getToken(state)\n\n    const node = parseBlock(state)\n\n    // check for garbage at the end of the expression\n    // an expression ends with a empty character '' and tokenType DELIMITER\n    if (state.token !== '') {\n      if (state.tokenType === TOKENTYPE.DELIMITER) {\n        // user entered a not existing operator like \"//\"\n\n        // TODO: give hints for aliases, for example with \"<>\" give as hint \" did you mean !== ?\"\n        throw createError(state, 'Unexpected operator ' + state.token)\n      } else {\n        throw createSyntaxError(state, 'Unexpected part \"' + state.token + '\"')\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a block with expressions. Expressions can be separated by a newline\n   * character '\\n', or by a semicolon ';'. In case of a semicolon, no output\n   * of the preceding line is returned.\n   * @return {Node} node\n   * @private\n   */\n  function parseBlock (state) {\n    let node\n    const blocks = []\n    let visible\n\n    if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n      node = parseAssignment(state)\n      node.comment = state.comment\n    }\n\n    // TODO: simplify this loop\n    while (state.token === '\\n' || state.token === ';') { // eslint-disable-line no-unmodified-loop-condition\n      if (blocks.length === 0 && node) {\n        visible = (state.token !== ';')\n        blocks.push({\n          node: node,\n          visible: visible\n        })\n      }\n\n      getToken(state)\n      if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n        node = parseAssignment(state)\n        node.comment = state.comment\n\n        visible = (state.token !== ';')\n        blocks.push({\n          node: node,\n          visible: visible\n        })\n      }\n    }\n\n    if (blocks.length > 0) {\n      return new BlockNode(blocks)\n    } else {\n      if (!node) {\n        node = new ConstantNode(undefined)\n        node.comment = state.comment\n      }\n\n      return node\n    }\n  }\n\n  /**\n   * Assignment of a function or variable,\n   * - can be a variable like 'a=2.3'\n   * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'\n   * - defining a function like 'f(x) = x^2'\n   * @return {Node} node\n   * @private\n   */\n  function parseAssignment (state) {\n    let name, args, value, valid\n\n    const node = parseConditional(state)\n\n    if (state.token === '=') {\n      if (isSymbolNode(node)) {\n        // parse a variable assignment like 'a = 2/3'\n        name = node.name\n        getTokenSkipNewline(state)\n        value = parseAssignment(state)\n        return new AssignmentNode(new SymbolNode(name), value)\n      } else if (isAccessorNode(node)) {\n        // parse a matrix subset assignment like 'A[1,2] = 4'\n        getTokenSkipNewline(state)\n        value = parseAssignment(state)\n        return new AssignmentNode(node.object, node.index, value)\n      } else if (isFunctionNode(node) && isSymbolNode(node.fn)) {\n        // parse function assignment like 'f(x) = x^2'\n        valid = true\n        args = []\n\n        name = node.name\n        node.args.forEach(function (arg, index) {\n          if (isSymbolNode(arg)) {\n            args[index] = arg.name\n          } else {\n            valid = false\n          }\n        })\n\n        if (valid) {\n          getTokenSkipNewline(state)\n          value = parseAssignment(state)\n          return new FunctionAssignmentNode(name, args, value)\n        }\n      }\n\n      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =')\n    }\n\n    return node\n  }\n\n  /**\n   * conditional operation\n   *\n   *     condition ? truePart : falsePart\n   *\n   * Note: conditional operator is right-associative\n   *\n   * @return {Node} node\n   * @private\n   */\n  function parseConditional (state) {\n    let node = parseLogicalOr(state)\n\n    while (state.token === '?') { // eslint-disable-line no-unmodified-loop-condition\n      // set a conditional level, the range operator will be ignored as long\n      // as conditionalLevel === state.nestingLevel.\n      const prev = state.conditionalLevel\n      state.conditionalLevel = state.nestingLevel\n      getTokenSkipNewline(state)\n\n      const condition = node\n      const trueExpr = parseAssignment(state)\n\n      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected')\n\n      state.conditionalLevel = null\n      getTokenSkipNewline(state)\n\n      const falseExpr = parseAssignment(state) // Note: check for conditional operator again, right associativity\n\n      node = new ConditionalNode(condition, trueExpr, falseExpr)\n\n      // restore the previous conditional level\n      state.conditionalLevel = prev\n    }\n\n    return node\n  }\n\n  /**\n   * logical or, 'x or y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalOr (state) {\n    let node = parseLogicalXor(state)\n\n    while (state.token === 'or') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * logical exclusive or, 'x xor y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalXor (state) {\n    let node = parseLogicalAnd(state)\n\n    while (state.token === 'xor') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * logical and, 'x and y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalAnd (state) {\n    let node = parseBitwiseOr(state)\n\n    while (state.token === 'and') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * bitwise or, 'x | y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseOr (state) {\n    let node = parseBitwiseXor(state)\n\n    while (state.token === '|') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * bitwise exclusive or (xor), 'x ^| y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseXor (state) {\n    let node = parseBitwiseAnd(state)\n\n    while (state.token === '^|') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * bitwise and, 'x & y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseAnd (state) {\n    let node = parseRelational(state)\n\n    while (state.token === '&') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a chained conditional, like 'a > b >= c'\n   * @return {Node} node\n   */\n  function parseRelational (state) {\n    const params = [parseShift(state)]\n    const conditionals = []\n\n    const operators = {\n      '==': 'equal',\n      '!=': 'unequal',\n      '<': 'smaller',\n      '>': 'larger',\n      '<=': 'smallerEq',\n      '>=': 'largerEq'\n    }\n\n    while (hasOwnProperty(operators, state.token)) { // eslint-disable-line no-unmodified-loop-condition\n      const cond = { name: state.token, fn: operators[state.token] }\n      conditionals.push(cond)\n      getTokenSkipNewline(state)\n      params.push(parseShift(state))\n    }\n\n    if (params.length === 1) {\n      return params[0]\n    } else if (params.length === 2) {\n      return new OperatorNode(conditionals[0].name, conditionals[0].fn, params)\n    } else {\n      return new RelationalNode(conditionals.map(c => c.fn), params)\n    }\n  }\n\n  /**\n   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n   * @return {Node} node\n   * @private\n   */\n  function parseShift (state) {\n    let node, name, fn, params\n\n    node = parseConversion(state)\n\n    const operators = {\n      '<<': 'leftShift',\n      '>>': 'rightArithShift',\n      '>>>': 'rightLogShift'\n    }\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getTokenSkipNewline(state)\n      params = [node, parseConversion(state)]\n      node = new OperatorNode(name, fn, params)\n    }\n\n    return node\n  }\n\n  /**\n   * conversion operators 'to' and 'in'\n   * @return {Node} node\n   * @private\n   */\n  function parseConversion (state) {\n    let node, name, fn, params\n\n    node = parseRange(state)\n\n    const operators = {\n      to: 'to',\n      in: 'to' // alias of 'to'\n    }\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getTokenSkipNewline(state)\n\n      if (name === 'in' && state.token === '') {\n        // end of expression -> this is the unit 'in' ('inch')\n        node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true)\n      } else {\n        // operator 'a to b' or 'a in b'\n        params = [node, parseRange(state)]\n        node = new OperatorNode(name, fn, params)\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n   * @return {Node} node\n   * @private\n   */\n  function parseRange (state) {\n    let node\n    const params = []\n\n    if (state.token === ':') {\n      // implicit start=1 (one-based)\n      node = new ConstantNode(1)\n    } else {\n      // explicit start\n      node = parseAddSubtract(state)\n    }\n\n    if (state.token === ':' && (state.conditionalLevel !== state.nestingLevel)) {\n      // we ignore the range operator when a conditional operator is being processed on the same level\n      params.push(node)\n\n      // parse step and end\n      while (state.token === ':' && params.length < 3) { // eslint-disable-line no-unmodified-loop-condition\n        getTokenSkipNewline(state)\n\n        if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {\n          // implicit end\n          params.push(new SymbolNode('end'))\n        } else {\n          // explicit end\n          params.push(parseAddSubtract(state))\n        }\n      }\n\n      if (params.length === 3) {\n        // params = [start, step, end]\n        node = new RangeNode(params[0], params[2], params[1]) // start, end, step\n      } else { // length === 2\n        // params = [start, end]\n        node = new RangeNode(params[0], params[1]) // start, end\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * add or subtract\n   * @return {Node} node\n   * @private\n   */\n  function parseAddSubtract (state) {\n    let node, name, fn, params\n\n    node = parseMultiplyDivide(state)\n\n    const operators = {\n      '+': 'add',\n      '-': 'subtract'\n    }\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getTokenSkipNewline(state)\n      const rightNode = parseMultiplyDivide(state)\n      if (rightNode.isPercentage) {\n        params = [node, new OperatorNode('*', 'multiply', [node, rightNode])]\n      } else {\n        params = [node, rightNode]\n      }\n      node = new OperatorNode(name, fn, params)\n    }\n\n    return node\n  }\n\n  /**\n   * multiply, divide, modulus\n   * @return {Node} node\n   * @private\n   */\n  function parseMultiplyDivide (state) {\n    let node, last, name, fn\n\n    node = parseImplicitMultiplication(state)\n    last = node\n\n    const operators = {\n      '*': 'multiply',\n      '.*': 'dotMultiply',\n      '/': 'divide',\n      './': 'dotDivide'\n    }\n\n    while (true) {\n      if (hasOwnProperty(operators, state.token)) {\n        // explicit operators\n        name = state.token\n        fn = operators[name]\n\n        getTokenSkipNewline(state)\n\n        last = parseImplicitMultiplication(state)\n        node = new OperatorNode(name, fn, [node, last])\n      } else {\n        break\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * implicit multiplication\n   * @return {Node} node\n   * @private\n   */\n  function parseImplicitMultiplication (state) {\n    let node, last\n\n    node = parseRule2(state)\n    last = node\n\n    while (true) {\n      if ((state.tokenType === TOKENTYPE.SYMBOL) ||\n          (state.token === 'in' && isConstantNode(node)) ||\n          (state.tokenType === TOKENTYPE.NUMBER &&\n              !isConstantNode(last) &&\n              (!isOperatorNode(last) || last.op === '!')) ||\n          (state.token === '(')) {\n        // parse implicit multiplication\n        //\n        // symbol:      implicit multiplication like '2a', '(2+3)a', 'a b'\n        // number:      implicit multiplication like '(2+3)2'\n        // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'\n        last = parseRule2(state)\n        node = new OperatorNode('*', 'multiply', [node, last], true /* implicit */)\n      } else {\n        break\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Infamous \"rule 2\" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370\n   * Explicit division gets higher precedence than implicit multiplication\n   * when the division matches this pattern: [number] / [number] [symbol]\n   * @return {Node} node\n   * @private\n   */\n  function parseRule2 (state) {\n    let node = parsePercentage(state)\n    let last = node\n    const tokenStates = []\n\n    while (true) {\n      // Match the \"number /\" part of the pattern \"number / number symbol\"\n      if (state.token === '/' && isConstantNode(last)) {\n        // Look ahead to see if the next token is a number\n        tokenStates.push(Object.assign({}, state))\n        getTokenSkipNewline(state)\n\n        // Match the \"number / number\" part of the pattern\n        if (state.tokenType === TOKENTYPE.NUMBER) {\n          // Look ahead again\n          tokenStates.push(Object.assign({}, state))\n          getTokenSkipNewline(state)\n\n          // Match the \"symbol\" part of the pattern, or a left parenthesis\n          if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(') {\n            // We've matched the pattern \"number / number symbol\".\n            // Rewind once and build the \"number / number\" node; the symbol will be consumed later\n            Object.assign(state, tokenStates.pop())\n            tokenStates.pop()\n            last = parsePercentage(state)\n            node = new OperatorNode('/', 'divide', [node, last])\n          } else {\n            // Not a match, so rewind\n            tokenStates.pop()\n            Object.assign(state, tokenStates.pop())\n            break\n          }\n        } else {\n          // Not a match, so rewind\n          Object.assign(state, tokenStates.pop())\n          break\n        }\n      } else {\n        break\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * percentage or mod\n   * @return {Node} node\n   * @private\n   */\n  function parsePercentage (state) {\n    let node, name, fn, params\n\n    node = parseUnary(state)\n\n    const operators = {\n      '%': 'mod',\n      mod: 'mod'\n    }\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getTokenSkipNewline(state)\n\n      if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {\n        // If the expression contains only %, then treat that as /100\n        node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true)\n      } else {\n        params = [node, parseUnary(state)]\n        node = new OperatorNode(name, fn, params)\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Unary plus and minus, and logical and bitwise not\n   * @return {Node} node\n   * @private\n   */\n  function parseUnary (state) {\n    let name, params, fn\n    const operators = {\n      '-': 'unaryMinus',\n      '+': 'unaryPlus',\n      '~': 'bitNot',\n      not: 'not'\n    }\n\n    if (hasOwnProperty(operators, state.token)) {\n      fn = operators[state.token]\n      name = state.token\n\n      getTokenSkipNewline(state)\n      params = [parseUnary(state)]\n\n      return new OperatorNode(name, fn, params)\n    }\n\n    return parsePow(state)\n  }\n\n  /**\n   * power\n   * Note: power operator is right associative\n   * @return {Node} node\n   * @private\n   */\n  function parsePow (state) {\n    let node, name, fn, params\n\n    node = parseLeftHandOperators(state)\n\n    if (state.token === '^' || state.token === '.^') {\n      name = state.token\n      fn = (name === '^') ? 'pow' : 'dotPow'\n\n      getTokenSkipNewline(state)\n      params = [node, parseUnary(state)] // Go back to unary, we can have '2^-3'\n      node = new OperatorNode(name, fn, params)\n    }\n\n    return node\n  }\n\n  /**\n   * Left hand operators: factorial x!, ctranspose x'\n   * @return {Node} node\n   * @private\n   */\n  function parseLeftHandOperators (state) {\n    let node, name, fn, params\n\n    node = parseCustomNodes(state)\n\n    const operators = {\n      '!': 'factorial',\n      '\\'': 'ctranspose'\n    }\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getToken(state)\n      params = [node]\n\n      node = new OperatorNode(name, fn, params)\n      node = parseAccessors(state, node)\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a custom node handler. A node handler can be used to process\n   * nodes in a custom way, for example for handling a plot.\n   *\n   * A handler must be passed as second argument of the parse function.\n   * - must extend math.Node\n   * - must contain a function _compile(defs: Object) : string\n   * - must contain a function find(filter: Object) : Node[]\n   * - must contain a function toString() : string\n   * - the constructor is called with a single argument containing all parameters\n   *\n   * For example:\n   *\n   *     nodes = {\n   *       'plot': PlotHandler\n   *     }\n   *\n   * The constructor of the handler is called as:\n   *\n   *     node = new PlotHandler(params)\n   *\n   * The handler will be invoked when evaluating an expression like:\n   *\n   *     node = math.parse('plot(sin(x), x)', nodes)\n   *\n   * @return {Node} node\n   * @private\n   */\n  function parseCustomNodes (state) {\n    let params = []\n\n    if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {\n      const CustomNode = state.extraNodes[state.token]\n\n      getToken(state)\n\n      // parse parameters\n      if (state.token === '(') {\n        params = []\n\n        openParams(state)\n        getToken(state)\n\n        if (state.token !== ')') {\n          params.push(parseAssignment(state))\n\n          // parse a list with parameters\n          while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n            getToken(state)\n            params.push(parseAssignment(state))\n          }\n        }\n\n        if (state.token !== ')') {\n          throw createSyntaxError(state, 'Parenthesis ) expected')\n        }\n        closeParams(state)\n        getToken(state)\n      }\n\n      // create a new custom node\n      // noinspection JSValidateTypes\n      return new CustomNode(params)\n    }\n\n    return parseSymbol(state)\n  }\n\n  /**\n   * parse symbols: functions, variables, constants, units\n   * @return {Node} node\n   * @private\n   */\n  function parseSymbol (state) {\n    let node, name\n\n    if (state.tokenType === TOKENTYPE.SYMBOL ||\n        (state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS)) {\n      name = state.token\n\n      getToken(state)\n\n      if (hasOwnProperty(CONSTANTS, name)) { // true, false, null, ...\n        node = new ConstantNode(CONSTANTS[name])\n      } else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) { // NaN, Infinity\n        node = new ConstantNode(numeric(name, 'number'))\n      } else {\n        node = new SymbolNode(name)\n      }\n\n      // parse function parameters and matrix index\n      node = parseAccessors(state, node)\n      return node\n    }\n\n    return parseDoubleQuotesString(state)\n  }\n\n  /**\n   * parse accessors:\n   * - function invocation in round brackets (...), for example sqrt(2)\n   * - index enclosed in square brackets [...], for example A[2,3]\n   * - dot notation for properties, like foo.bar\n   * @param {Object} state\n   * @param {Node} node    Node on which to apply the parameters. If there\n   *                       are no parameters in the expression, the node\n   *                       itself is returned\n   * @param {string[]} [types]  Filter the types of notations\n   *                            can be ['(', '[', '.']\n   * @return {Node} node\n   * @private\n   */\n  function parseAccessors (state, node, types) {\n    let params\n\n    while ((state.token === '(' || state.token === '[' || state.token === '.') &&\n        (!types || types.indexOf(state.token) !== -1)) { // eslint-disable-line no-unmodified-loop-condition\n      params = []\n\n      if (state.token === '(') {\n        if (isSymbolNode(node) || isAccessorNode(node)) {\n          // function invocation like fn(2, 3) or obj.fn(2, 3)\n          openParams(state)\n          getToken(state)\n\n          if (state.token !== ')') {\n            params.push(parseAssignment(state))\n\n            // parse a list with parameters\n            while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n              getToken(state)\n              params.push(parseAssignment(state))\n            }\n          }\n\n          if (state.token !== ')') {\n            throw createSyntaxError(state, 'Parenthesis ) expected')\n          }\n          closeParams(state)\n          getToken(state)\n\n          node = new FunctionNode(node, params)\n        } else {\n          // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)\n          // don't parse it here but let it be handled by parseImplicitMultiplication\n          // with correct precedence\n          return node\n        }\n      } else if (state.token === '[') {\n        // index notation like variable[2, 3]\n        openParams(state)\n        getToken(state)\n\n        if (state.token !== ']') {\n          params.push(parseAssignment(state))\n\n          // parse a list with parameters\n          while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n            getToken(state)\n            params.push(parseAssignment(state))\n          }\n        }\n\n        if (state.token !== ']') {\n          throw createSyntaxError(state, 'Parenthesis ] expected')\n        }\n        closeParams(state)\n        getToken(state)\n\n        node = new AccessorNode(node, new IndexNode(params))\n      } else {\n        // dot notation like variable.prop\n        getToken(state)\n\n        if (state.tokenType !== TOKENTYPE.SYMBOL) {\n          throw createSyntaxError(state, 'Property name expected after dot')\n        }\n        params.push(new ConstantNode(state.token))\n        getToken(state)\n\n        const dotNotation = true\n        node = new AccessorNode(node, new IndexNode(params, dotNotation))\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a double quotes string.\n   * @return {Node} node\n   * @private\n   */\n  function parseDoubleQuotesString (state) {\n    let node, str\n\n    if (state.token === '\"') {\n      str = parseDoubleQuotesStringToken(state)\n\n      // create constant\n      node = new ConstantNode(str)\n\n      // parse index parameters\n      node = parseAccessors(state, node)\n\n      return node\n    }\n\n    return parseSingleQuotesString(state)\n  }\n\n  /**\n   * Parse a string surrounded by double quotes \"...\"\n   * @return {string}\n   */\n  function parseDoubleQuotesStringToken (state) {\n    let str = ''\n\n    while (currentCharacter(state) !== '' && currentCharacter(state) !== '\"') {\n      if (currentCharacter(state) === '\\\\') {\n        // escape character, immediately process the next\n        // character to prevent stopping at a next '\\\"'\n        str += currentCharacter(state)\n        next(state)\n      }\n\n      str += currentCharacter(state)\n      next(state)\n    }\n\n    getToken(state)\n    if (state.token !== '\"') {\n      throw createSyntaxError(state, 'End of string \" expected')\n    }\n    getToken(state)\n\n    return JSON.parse('\"' + str + '\"') // unescape escaped characters\n  }\n\n  /**\n   * Parse a single quotes string.\n   * @return {Node} node\n   * @private\n   */\n  function parseSingleQuotesString (state) {\n    let node, str\n\n    if (state.token === '\\'') {\n      str = parseSingleQuotesStringToken(state)\n\n      // create constant\n      node = new ConstantNode(str)\n\n      // parse index parameters\n      node = parseAccessors(state, node)\n\n      return node\n    }\n\n    return parseMatrix(state)\n  }\n\n  /**\n   * Parse a string surrounded by single quotes '...'\n   * @return {string}\n   */\n  function parseSingleQuotesStringToken (state) {\n    let str = ''\n\n    while (currentCharacter(state) !== '' && currentCharacter(state) !== '\\'') {\n      if (currentCharacter(state) === '\\\\') {\n        // escape character, immediately process the next\n        // character to prevent stopping at a next '\\''\n        str += currentCharacter(state)\n        next(state)\n      }\n\n      str += currentCharacter(state)\n      next(state)\n    }\n\n    getToken(state)\n    if (state.token !== '\\'') {\n      throw createSyntaxError(state, 'End of string \\' expected')\n    }\n    getToken(state)\n\n    return JSON.parse('\"' + str + '\"') // unescape escaped characters\n  }\n\n  /**\n   * parse the matrix\n   * @return {Node} node\n   * @private\n   */\n  function parseMatrix (state) {\n    let array, params, rows, cols\n\n    if (state.token === '[') {\n      // matrix [...]\n      openParams(state)\n      getToken(state)\n\n      if (state.token !== ']') {\n        // this is a non-empty matrix\n        const row = parseRow(state)\n\n        if (state.token === ';') {\n          // 2 dimensional array\n          rows = 1\n          params = [row]\n\n          // the rows of the matrix are separated by dot-comma's\n          while (state.token === ';') { // eslint-disable-line no-unmodified-loop-condition\n            getToken(state)\n\n            params[rows] = parseRow(state)\n            rows++\n          }\n\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected')\n          }\n          closeParams(state)\n          getToken(state)\n\n          // check if the number of columns matches in all rows\n          cols = params[0].items.length\n          for (let r = 1; r < rows; r++) {\n            if (params[r].items.length !== cols) {\n              throw createError(state, 'Column dimensions mismatch ' +\n                  '(' + params[r].items.length + ' !== ' + cols + ')')\n            }\n          }\n\n          array = new ArrayNode(params)\n        } else {\n          // 1 dimensional vector\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected')\n          }\n          closeParams(state)\n          getToken(state)\n\n          array = row\n        }\n      } else {\n        // this is an empty matrix \"[ ]\"\n        closeParams(state)\n        getToken(state)\n        array = new ArrayNode([])\n      }\n\n      return parseAccessors(state, array)\n    }\n\n    return parseObject(state)\n  }\n\n  /**\n   * Parse a single comma-separated row from a matrix, like 'a, b, c'\n   * @return {ArrayNode} node\n   */\n  function parseRow (state) {\n    const params = [parseAssignment(state)]\n    let len = 1\n\n    while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n      getToken(state)\n\n      // parse expression\n      params[len] = parseAssignment(state)\n      len++\n    }\n\n    return new ArrayNode(params)\n  }\n\n  /**\n   * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n   * @return {Node} node\n   * @private\n   */\n  function parseObject (state) {\n    if (state.token === '{') {\n      openParams(state)\n      let key\n\n      const properties = {}\n      do {\n        getToken(state)\n\n        if (state.token !== '}') {\n          // parse key\n          if (state.token === '\"') {\n            key = parseDoubleQuotesStringToken(state)\n          } else if (state.token === '\\'') {\n            key = parseSingleQuotesStringToken(state)\n          } else if (state.tokenType === TOKENTYPE.SYMBOL || (state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS)) {\n            key = state.token\n            getToken(state)\n          } else {\n            throw createSyntaxError(state, 'Symbol or string expected as object key')\n          }\n\n          // parse key/value separator\n          if (state.token !== ':') {\n            throw createSyntaxError(state, 'Colon : expected after object key')\n          }\n          getToken(state)\n\n          // parse key\n          properties[key] = parseAssignment(state)\n        }\n      }\n      while (state.token === ',') // eslint-disable-line no-unmodified-loop-condition\n\n      if (state.token !== '}') {\n        throw createSyntaxError(state, 'Comma , or bracket } expected after object value')\n      }\n      closeParams(state)\n      getToken(state)\n\n      let node = new ObjectNode(properties)\n\n      // parse index parameters\n      node = parseAccessors(state, node)\n\n      return node\n    }\n\n    return parseNumber(state)\n  }\n\n  /**\n   * parse a number\n   * @return {Node} node\n   * @private\n   */\n  function parseNumber (state) {\n    let numberStr\n\n    if (state.tokenType === TOKENTYPE.NUMBER) {\n      // this is a number\n      numberStr = state.token\n      getToken(state)\n\n      return new ConstantNode(numeric(numberStr, config.number))\n    }\n\n    return parseParentheses(state)\n  }\n\n  /**\n   * parentheses\n   * @return {Node} node\n   * @private\n   */\n  function parseParentheses (state) {\n    let node\n\n    // check if it is a parenthesized expression\n    if (state.token === '(') {\n      // parentheses (...)\n      openParams(state)\n      getToken(state)\n\n      node = parseAssignment(state) // start again\n\n      if (state.token !== ')') {\n        throw createSyntaxError(state, 'Parenthesis ) expected')\n      }\n      closeParams(state)\n      getToken(state)\n\n      node = new ParenthesisNode(node)\n      node = parseAccessors(state, node)\n      return node\n    }\n\n    return parseEnd(state)\n  }\n\n  /**\n   * Evaluated when the expression is not yet ended but expected to end\n   * @return {Node} res\n   * @private\n   */\n  function parseEnd (state) {\n    if (state.token === '') {\n      // syntax error or unexpected end of expression\n      throw createSyntaxError(state, 'Unexpected end of expression')\n    } else {\n      throw createSyntaxError(state, 'Value expected')\n    }\n  }\n\n  /**\n   * Shortcut for getting the current row value (one based)\n   * Returns the line of the currently handled expression\n   * @private\n   */\n  /* TODO: implement keeping track on the row number\n  function row () {\n    return null\n  }\n  */\n\n  /**\n   * Shortcut for getting the current col value (one based)\n   * Returns the column (position) where the last state.token starts\n   * @private\n   */\n  function col (state) {\n    return state.index - state.token.length + 1\n  }\n\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {SyntaxError} instantiated error\n   * @private\n   */\n  function createSyntaxError (state, message) {\n    const c = col(state)\n    const error = new SyntaxError(message + ' (char ' + c + ')')\n    error.char = c\n\n    return error\n  }\n\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {Error} instantiated error\n   * @private\n   */\n  function createError (state, message) {\n    const c = col(state)\n    const error = new SyntaxError(message + ' (char ' + c + ')')\n    error.char = c\n\n    return error\n  }\n\n  return parse\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'compile'\nconst dependencies = ['typed', 'parse']\n\nexport const createCompile = /* #__PURE__ */ factory(name, dependencies, ({ typed, parse }) => {\n  /**\n   * Parse and compile an expression.\n   * Returns a an object with a function `evaluate([scope])` to evaluate the\n   * compiled expression.\n   *\n   * Syntax:\n   *\n   *     math.compile(expr)                       // returns one node\n   *     math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes\n   *\n   * Examples:\n   *\n   *     const code1 = math.compile('sqrt(3^2 + 4^2)')\n   *     code1.evaluate() // 5\n   *\n   *     let scope = {a: 3, b: 4}\n   *     const code2 = math.compile('a * b') // 12\n   *     code2.evaluate(scope) // 12\n   *     scope.a = 5\n   *     code2.evaluate(scope) // 20\n   *\n   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].evaluate() // 12\n   *\n   * See also:\n   *\n   *    parse, evaluate\n   *\n   * @param {string | string[] | Array | Matrix} expr\n   *            The expression to be compiled\n   * @return {{evaluate: Function} | Array.<{evaluate: Function}>} code\n   *            An object with the compiled expression\n   * @throws {Error}\n   */\n  return typed(name, {\n    string: function (expr) {\n      return parse(expr).compile()\n    },\n\n    'Array | Matrix': function (expr) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile()\n      })\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { createEmptyMap } from '../../utils/map.js'\n\nconst name = 'evaluate'\nconst dependencies = ['typed', 'parse']\n\nexport const createEvaluate = /* #__PURE__ */ factory(name, dependencies, ({ typed, parse }) => {\n  /**\n   * Evaluate an expression.\n   *\n   * Note the evaluating arbitrary expressions may involve security risks,\n   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n   *\n   * Syntax:\n   *\n   *     math.evaluate(expr)\n   *     math.evaluate(expr, scope)\n   *     math.evaluate([expr1, expr2, expr3, ...])\n   *     math.evaluate([expr1, expr2, expr3, ...], scope)\n   *\n   * Example:\n   *\n   *     math.evaluate('(2+3)/4')                // 1.25\n   *     math.evaluate('sqrt(3^2 + 4^2)')        // 5\n   *     math.evaluate('sqrt(-4)')               // 2i\n   *     math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]\n   *\n   *     let scope = {a:3, b:4}\n   *     math.evaluate('a * b', scope)           // 12\n   *\n   * See also:\n   *\n   *    parse, compile\n   *\n   * @param {string | string[] | Matrix} expr   The expression to be evaluated\n   * @param {Object} [scope]                    Scope to read/write variables\n   * @return {*} The result of the expression\n   * @throws {Error}\n   */\n  return typed(name, {\n    string: function (expr) {\n      const scope = createEmptyMap()\n      return parse(expr).compile().evaluate(scope)\n    },\n\n    'string, Map | Object': function (expr, scope) {\n      return parse(expr).compile().evaluate(scope)\n    },\n\n    'Array | Matrix': function (expr) {\n      const scope = createEmptyMap()\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope)\n      })\n    },\n\n    'Array | Matrix, Map | Object': function (expr, scope) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope)\n      })\n    }\n  })\n})\n","import { factory } from '../utils/factory.js'\nimport { createEmptyMap, toObject } from '../utils/map.js'\n\nconst name = 'Parser'\nconst dependencies = ['evaluate']\n\nexport const createParserClass = /* #__PURE__ */ factory(name, dependencies, ({ evaluate }) => {\n  /**\n   * @constructor Parser\n   * Parser contains methods to evaluate or parse expressions, and has a number\n   * of convenience methods to get, set, and remove variables from memory. Parser\n   * keeps a scope containing variables in memory, which is used for all\n   * evaluations.\n   *\n   * Methods:\n   *    const result = parser.evaluate(expr)  // evaluate an expression\n   *    const value = parser.get(name)        // retrieve a variable from the parser\n   *    const values = parser.getAll()        // retrieve all defined variables\n   *    parser.set(name, value)               // set a variable in the parser\n   *    parser.remove(name)                   // clear a variable from the\n   *                                          // parsers scope\n   *    parser.clear()                        // clear the parsers scope\n   *\n   * Example usage:\n   *    const parser = new Parser()\n   *    // Note: there is a convenience method which can be used instead:\n   *    // const parser = new math.parser()\n   *\n   *    // evaluate expressions\n   *    parser.evaluate('sqrt(3^2 + 4^2)')        // 5\n   *    parser.evaluate('sqrt(-4)')               // 2i\n   *    parser.evaluate('2 inch in cm')           // 5.08 cm\n   *    parser.evaluate('cos(45 deg)')            // 0.7071067811865476\n   *\n   *    // define variables and functions\n   *    parser.evaluate('x = 7 / 2')              // 3.5\n   *    parser.evaluate('x + 3')                  // 6.5\n   *    parser.evaluate('f(x, y) = x^y')          // f(x, y)\n   *    parser.evaluate('f(2, 3)')                // 8\n   *\n   *    // get and set variables and functions\n   *    const x = parser.get('x')                 // 7\n   *    const f = parser.get('f')                 // function\n   *    const g = f(3, 2)                         // 9\n   *    parser.set('h', 500)\n   *    const i = parser.evaluate('h / 2')        // 250\n   *    parser.set('hello', function (name) {\n   *        return 'hello, ' + name + '!'\n   *    })\n   *    parser.evaluate('hello(\"user\")')          // \"hello, user!\"\n   *\n   *    // clear defined functions and variables\n   *    parser.clear()\n   *\n   */\n  function Parser () {\n    if (!(this instanceof Parser)) {\n      throw new SyntaxError(\n        'Constructor must be called with the new operator')\n    }\n\n    Object.defineProperty(this, 'scope', {\n      value: createEmptyMap(),\n      writable: false\n    })\n  }\n\n  /**\n   * Attach type information\n   */\n  Parser.prototype.type = 'Parser'\n  Parser.prototype.isParser = true\n\n  /**\n   * Parse and evaluate the given expression\n   * @param {string | string[]} expr   A string containing an expression,\n   *                                   for example \"2+3\", or a list with expressions\n   * @return {*} result     The result, or undefined when the expression was empty\n   * @throws {Error}\n   */\n  Parser.prototype.evaluate = function (expr) {\n    // TODO: validate arguments\n    return evaluate(expr, this.scope)\n  }\n\n  /**\n   * Get a variable (a function or variable) by name from the parsers scope.\n   * Returns undefined when not found\n   * @param {string} name\n   * @return {* | undefined} value\n   */\n  Parser.prototype.get = function (name) {\n    // TODO: validate arguments\n    if (this.scope.has(name)) {\n      return this.scope.get(name)\n    }\n  }\n\n  /**\n   * Get a map with all defined variables\n   * @return {Object} values\n   */\n  Parser.prototype.getAll = function () {\n    return toObject(this.scope)\n  }\n\n  /**\n   * Get a map with all defined variables\n   * @return {Map} values\n   */\n  Parser.prototype.getAllAsMap = function () {\n    return this.scope\n  }\n\n  /**\n   * Set a symbol (a function or variable) by name from the parsers scope.\n   * @param {string} name\n   * @param {* | undefined} value\n   */\n  Parser.prototype.set = function (name, value) {\n    this.scope.set(name, value)\n    return value\n  }\n\n  /**\n   * Remove a variable from the parsers scope\n   * @param {string} name\n   */\n  Parser.prototype.remove = function (name) {\n    this.scope.delete(name)\n  }\n\n  /**\n   * Clear the scope with variables and functions\n   */\n  Parser.prototype.clear = function () {\n    this.scope.clear()\n  }\n\n  return Parser\n}, { isClass: true })\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'parser'\nconst dependencies = ['typed', 'Parser']\n\nexport const createParser = /* #__PURE__ */ factory(name, dependencies, ({ typed, Parser }) => {\n  /**\n   * Create a parser. The function creates a new `math.Parser` object.\n   *\n   * Syntax:\n   *\n   *    math.parser()\n   *\n   * Examples:\n   *\n   *     const parser = new math.parser()\n   *\n   *     // evaluate expressions\n   *     const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5\n   *     const b = parser.evaluate('sqrt(-4)')        // 2i\n   *     const c = parser.evaluate('2 inch in cm')    // 5.08 cm\n   *     const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476\n   *\n   *     // define variables and functions\n   *     parser.evaluate('x = 7 / 2')             // 3.5\n   *     parser.evaluate('x + 3')                 // 6.5\n   *     parser.evaluate('f(x, y) = x^y')         // f(x, y)\n   *     parser.evaluate('f(2, 3)')               // 8\n   *\n   *     // get and set variables and functions\n   *     const x = parser.get('x')                // 7\n   *     const f = parser.get('f')                // function\n   *     const g = f(3, 2)                        // 9\n   *     parser.set('h', 500)\n   *     const i = parser.evaluate('h / 2')       // 250\n   *     parser.set('hello', function (name) {\n   *       return 'hello, ' + name + '!'\n   *     })\n   *     parser.evaluate('hello(\"user\")')         // \"hello, user!\"\n   *\n   *     // clear defined functions and variables\n   *     parser.clear()\n   *\n   * See also:\n   *\n   *    evaluate, compile, parse\n   *\n   * @return {Parser} Parser\n   */\n  return typed(name, {\n    '': function () {\n      return new Parser()\n    }\n  })\n})\n","import { clone } from '../../../utils/object.js'\nimport { factory } from '../../../utils/factory.js'\n\nconst name = 'lup'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'abs',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'subtract',\n  'larger',\n  'equalScalar',\n  'unaryMinus',\n  'DenseMatrix',\n  'SparseMatrix',\n  'Spa'\n]\n\nexport const createLup = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    matrix,\n    abs,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    larger,\n    equalScalar,\n    unaryMinus,\n    DenseMatrix,\n    SparseMatrix,\n    Spa\n  }\n) => {\n  /**\n   * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a\n   * row permutation vector `p` where `A[p,:] = L * U`\n   *\n   * Syntax:\n   *\n   *    math.lup(A)\n   *\n   * Example:\n   *\n   *    const m = [[2, 1], [1, 4]]\n   *    const r = math.lup(m)\n   *    // r = {\n   *    //   L: [[1, 0], [0.5, 1]],\n   *    //   U: [[2, 1], [0, 3.5]],\n   *    //   P: [0, 1]\n   *    // }\n   *\n   * See also:\n   *\n   *    slu, lsolve, lusolve, usolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array for which to get the LUP decomposition.\n   *\n   * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.\n   */\n  return typed(name, {\n\n    DenseMatrix: function (m) {\n      return _denseLUP(m)\n    },\n\n    SparseMatrix: function (m) {\n      return _sparseLUP(m)\n    },\n\n    Array: function (a) {\n      // create dense matrix from array\n      const m = matrix(a)\n      // lup, use matrix implementation\n      const r = _denseLUP(m)\n      // result\n      return {\n        L: r.L.valueOf(),\n        U: r.U.valueOf(),\n        p: r.p\n      }\n    }\n  })\n\n  function _denseLUP (m) {\n    // rows & columns\n    const rows = m._size[0]\n    const columns = m._size[1]\n    // minimum rows and columns\n    let n = Math.min(rows, columns)\n    // matrix array, clone original data\n    const data = clone(m._data)\n    // l matrix arrays\n    const ldata = []\n    const lsize = [rows, n]\n    // u matrix arrays\n    const udata = []\n    const usize = [n, columns]\n    // vars\n    let i, j, k\n    // permutation vector\n    const p = []\n    for (i = 0; i < rows; i++) { p[i] = i }\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // skip first column in upper triangular matrix\n      if (j > 0) {\n        // loop rows\n        for (i = 0; i < rows; i++) {\n          // min i,j\n          const min = Math.min(i, j)\n          // v[i, j]\n          let s = 0\n          // loop up to min\n          for (k = 0; k < min; k++) {\n            // s = l[i, k] - data[k, j]\n            s = addScalar(s, multiplyScalar(data[i][k], data[k][j]))\n          }\n          data[i][j] = subtract(data[i][j], s)\n        }\n      }\n      // row with larger value in cvector, row >= j\n      let pi = j\n      let pabsv = 0\n      let vjj = 0\n      // loop rows\n      for (i = j; i < rows; i++) {\n        // data @ i, j\n        const v = data[i][j]\n        // absolute value\n        const absv = abs(v)\n        // value is greater than pivote value\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = i\n          // update max value\n          pabsv = absv\n          // value @ [j, j]\n          vjj = v\n        }\n      }\n      // swap rows (j <-> pi)\n      if (j !== pi) {\n        // swap values j <-> pi in p\n        p[j] = [p[pi], p[pi] = p[j]][0]\n        // swap j <-> pi in data\n        DenseMatrix._swapRows(j, pi, data)\n      }\n      // check column is in lower triangular matrix\n      if (j < rows) {\n        // loop rows (lower triangular matrix)\n        for (i = j + 1; i < rows; i++) {\n          // value @ i, j\n          const vij = data[i][j]\n          if (!equalScalar(vij, 0)) {\n            // update data\n            data[i][j] = divideScalar(data[i][j], vjj)\n          }\n        }\n      }\n    }\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // initialize row in arrays\n        if (j === 0) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i] = []\n          }\n          // L\n          ldata[i] = []\n        }\n        // check we are in the upper triangular matrix\n        if (i < j) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i][j] = data[i][j]\n          }\n          // check column exists in lower triangular matrix\n          if (j < rows) {\n            // L\n            ldata[i][j] = 0\n          }\n          continue\n        }\n        // diagonal value\n        if (i === j) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i][j] = data[i][j]\n          }\n          // check column exists in lower triangular matrix\n          if (j < rows) {\n            // L\n            ldata[i][j] = 1\n          }\n          continue\n        }\n        // check row exists in upper triangular matrix\n        if (i < columns) {\n          // U\n          udata[i][j] = 0\n        }\n        // check column exists in lower triangular matrix\n        if (j < rows) {\n          // L\n          ldata[i][j] = data[i][j]\n        }\n      }\n    }\n    // l matrix\n    const l = new DenseMatrix({\n      data: ldata,\n      size: lsize\n    })\n    // u matrix\n    const u = new DenseMatrix({\n      data: udata,\n      size: usize\n    })\n    // p vector\n    const pv = []\n    for (i = 0, n = p.length; i < n; i++) { pv[p[i]] = i }\n    // return matrices\n    return {\n      L: l,\n      U: u,\n      p: pv,\n      toString: function () {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p\n      }\n    }\n  }\n\n  function _sparseLUP (m) {\n    // rows & columns\n    const rows = m._size[0]\n    const columns = m._size[1]\n    // minimum rows and columns\n    const n = Math.min(rows, columns)\n    // matrix arrays (will not be modified, thanks to permutation vector)\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    // l matrix arrays\n    const lvalues = []\n    const lindex = []\n    const lptr = []\n    const lsize = [rows, n]\n    // u matrix arrays\n    const uvalues = []\n    const uindex = []\n    const uptr = []\n    const usize = [n, columns]\n    // vars\n    let i, j, k\n    // permutation vectors, (current index -> original index) and (original index -> current index)\n    const pvCo = []\n    const pvOc = []\n    for (i = 0; i < rows; i++) {\n      pvCo[i] = i\n      pvOc[i] = i\n    }\n    // swap indices in permutation vectors (condition x < y)!\n    const swapIndeces = function (x, y) {\n      // find pv indeces getting data from x and y\n      const kx = pvOc[x]\n      const ky = pvOc[y]\n      // update permutation vector current -> original\n      pvCo[kx] = y\n      pvCo[ky] = x\n      // update permutation vector original -> current\n      pvOc[x] = ky\n      pvOc[y] = kx\n    }\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // sparse accumulator\n      const spa = new Spa()\n      // check lower triangular matrix has a value @ column j\n      if (j < rows) {\n        // update ptr\n        lptr.push(lvalues.length)\n        // first value in j column for lower triangular matrix\n        lvalues.push(1)\n        lindex.push(j)\n      }\n      // update ptr\n      uptr.push(uvalues.length)\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = ptr[j]\n      const k1 = ptr[j + 1]\n      // copy column j into sparse accumulator\n      for (k = k0; k < k1; k++) {\n        // row\n        i = index[k]\n        // copy column values into sparse accumulator (use permutation vector)\n        spa.set(pvCo[i], values[k])\n      }\n      // skip first column in upper triangular matrix\n      if (j > 0) {\n        // loop rows in column j (above diagonal)\n        spa.forEach(0, j - 1, function (k, vkj) {\n          // loop rows in column k (L)\n          SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {\n            // check row is below k\n            if (i > k) {\n              // update spa value\n              spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)))\n            }\n          })\n        })\n      }\n      // row with larger value in spa, row >= j\n      let pi = j\n      let vjj = spa.get(j)\n      let pabsv = abs(vjj)\n      // loop values in spa (order by row, below diagonal)\n      spa.forEach(j + 1, rows - 1, function (x, v) {\n        // absolute value\n        const absv = abs(v)\n        // value is greater than pivote value\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = x\n          // update max value\n          pabsv = absv\n          // value @ [j, j]\n          vjj = v\n        }\n      })\n      // swap rows (j <-> pi)\n      if (j !== pi) {\n        // swap values j <-> pi in L\n        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr)\n        // swap values j <-> pi in U\n        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr)\n        // swap values in spa\n        spa.swap(j, pi)\n        // update permutation vector (swap values @ j, pi)\n        swapIndeces(j, pi)\n      }\n      // loop values in spa (order by row)\n      spa.forEach(0, rows - 1, function (x, v) {\n        // check we are above diagonal\n        if (x <= j) {\n          // update upper triangular matrix\n          uvalues.push(v)\n          uindex.push(x)\n        } else {\n          // update value\n          v = divideScalar(v, vjj)\n          // check value is non zero\n          if (!equalScalar(v, 0)) {\n            // update lower triangular matrix\n            lvalues.push(v)\n            lindex.push(x)\n          }\n        }\n      })\n    }\n    // update ptrs\n    uptr.push(uvalues.length)\n    lptr.push(lvalues.length)\n\n    // return matrices\n    return {\n      L: new SparseMatrix({\n        values: lvalues,\n        index: lindex,\n        ptr: lptr,\n        size: lsize\n      }),\n      U: new SparseMatrix({\n        values: uvalues,\n        index: uindex,\n        ptr: uptr,\n        size: usize\n      }),\n      p: pvCo,\n      toString: function () {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p\n      }\n    }\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'qr'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'zeros',\n  'identity',\n  'isZero',\n  'equal',\n  'sign',\n  'sqrt',\n  'conj',\n  'unaryMinus',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'subtract',\n  'complex'\n]\n\nexport const createQr = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    matrix,\n    zeros,\n    identity,\n    isZero,\n    equal,\n    sign,\n    sqrt,\n    conj,\n    unaryMinus,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    complex\n  }\n) => {\n  /**\n   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in\n   * two matrices (`Q`, `R`) where `Q` is an\n   * orthogonal matrix and `R` is an upper triangular matrix.\n   *\n   * Syntax:\n   *\n   *    math.qr(A)\n   *\n   * Example:\n   *\n   *    const m = [\n   *      [1, -1,  4],\n   *      [1,  4, -2],\n   *      [1,  4,  2],\n   *      [1,  -1, 0]\n   *    ]\n   *    const result = math.qr(m)\n   *    // r = {\n   *    //   Q: [\n   *    //     [0.5, -0.5,   0.5],\n   *    //     [0.5,  0.5,  -0.5],\n   *    //     [0.5,  0.5,   0.5],\n   *    //     [0.5, -0.5,  -0.5],\n   *    //   ],\n   *    //   R: [\n   *    //     [2, 3,  2],\n   *    //     [0, 5, -2],\n   *    //     [0, 0,  4],\n   *    //     [0, 0,  0]\n   *    //   ]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lusolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array\n   * for which to get the QR decomposition.\n   *\n   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal\n   * matrix and R: the upper triangular matrix\n   */\n  return Object.assign(typed(name, {\n\n    DenseMatrix: function (m) {\n      return _denseQR(m)\n    },\n\n    SparseMatrix: function (m) {\n      return _sparseQR(m)\n    },\n\n    Array: function (a) {\n      // create dense matrix from array\n      const m = matrix(a)\n      // lup, use matrix implementation\n      const r = _denseQR(m)\n      // result\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      }\n    }\n  }), { _denseQRimpl })\n\n  function _denseQRimpl (m) {\n    // rows & columns (m x n)\n    const rows = m._size[0] // m\n    const cols = m._size[1] // n\n\n    const Q = identity([rows], 'dense')\n    const Qdata = Q._data\n\n    const R = m.clone()\n    const Rdata = R._data\n\n    // vars\n    let i, j, k\n\n    const w = zeros([rows], '')\n\n    for (k = 0; k < Math.min(cols, rows); ++k) {\n      /*\n       * **k-th Household matrix**\n       *\n       * The matrix I - 2*v*transpose(v)\n       * x     = first column of A\n       * x1    = first element of x\n       * alpha = x1 / |x1| * |x|\n       * e1    = tranpose([1, 0, 0, ...])\n       * u     = x - alpha * e1\n       * v     = u / |u|\n       *\n       * Household matrix = I - 2 * v * tranpose(v)\n       *\n       *  * Initially Q = I and R = A.\n       *  * Household matrix is a reflection in a plane normal to v which\n       *    will zero out all but the top right element in R.\n       *  * Appplying reflection to both Q and R will not change product.\n       *  * Repeat this process on the (1,1) minor to get R as an upper\n       *    triangular matrix.\n       *  * Reflections leave the magnitude of the columns of Q unchanged\n       *    so Q remains othoganal.\n       *\n       */\n\n      const pivot = Rdata[k][k]\n      const sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot))\n      const conjSgn = conj(sgn)\n\n      let alphaSquared = 0\n\n      for (i = k; i < rows; i++) {\n        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])))\n      }\n\n      const alpha = multiplyScalar(sgn, sqrt(alphaSquared))\n\n      if (!isZero(alpha)) {\n        // first element in vector u\n        const u1 = subtract(pivot, alpha)\n\n        // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n        w[k] = 1\n\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1)\n        }\n\n        // tau = - conj(u1 / alpha)\n        const tau = unaryMinus(conj(divideScalar(u1, alpha)))\n\n        let s\n\n        /*\n         * tau and w have been choosen so that\n         *\n         * 2 * v * tranpose(v) = tau * w * tranpose(w)\n         */\n\n        /*\n         * -- calculate R = R - tau * w * tranpose(w) * R --\n         * Only do calculation with rows k to (rows-1)\n         * Additionally columns 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (j = k; j < cols; j++) {\n          s = 0.0\n\n          // calculate jth element of [tranpose(w) * R]\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]))\n          }\n\n          // calculate the jth element of [tau * transpose(w) * R]\n          s = multiplyScalar(s, tau)\n\n          for (i = k; i < rows; i++) {\n            Rdata[i][j] = multiplyScalar(\n              subtract(Rdata[i][j], multiplyScalar(w[i], s)),\n              conjSgn\n            )\n          }\n        }\n        /*\n         * -- calculate Q = Q - tau * Q * w * transpose(w) --\n         * Q is a square matrix (rows x rows)\n         * Only do calculation with columns k to (rows-1)\n         * Additionally rows 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (i = 0; i < rows; i++) {\n          s = 0.0\n\n          // calculate ith element of [Q * w]\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]))\n          }\n\n          // calculate the ith element of [tau * Q * w]\n          s = multiplyScalar(s, tau)\n\n          for (j = k; j < rows; ++j) {\n            Qdata[i][j] = divideScalar(\n              subtract(Qdata[i][j], multiplyScalar(s, conj(w[j]))),\n              conjSgn\n            )\n          }\n        }\n      }\n    }\n\n    // return matrices\n    return {\n      Q: Q,\n      R: R,\n      toString: function () {\n        return 'Q: ' + this.Q.toString() + '\\nR: ' + this.R.toString()\n      }\n    }\n  }\n\n  function _denseQR (m) {\n    const ret = _denseQRimpl(m)\n    const Rdata = ret.R._data\n    if (m._data.length > 0) {\n      const zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0\n\n      for (let i = 0; i < Rdata.length; ++i) {\n        for (let j = 0; j < i && j < (Rdata[0] || []).length; ++j) {\n          Rdata[i][j] = zero\n        }\n      }\n    }\n\n    return ret\n  }\n\n  function _sparseQR (m) {\n    throw new Error('qr not implemented for sparse matrices yet')\n  }\n})\n","/**\n * Depth-first search and postorder of a tree rooted at node j\n *\n * @param {Number}  j               The tree node\n * @param {Number}  k\n * @param {Array}   w               The workspace array\n * @param {Number}  head            The index offset within the workspace for the head array\n * @param {Number}  next            The index offset within the workspace for the next array\n * @param {Array}   post            The post ordering array\n * @param {Number}  stack           The index offset within the workspace for the stack array\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csTdfs (j, k, w, head, next, post, stack) {\n  // variables\n  let top = 0\n  // place j on the stack\n  w[stack] = j\n  // while (stack is not empty)\n  while (top >= 0) {\n    // p = top of stack\n    const p = w[stack + top]\n    // i = youngest child of p\n    const i = w[head + p]\n    if (i === -1) {\n      // p has no unordered children left\n      top--\n      // node p is the kth postordered node\n      post[k++] = p\n    } else {\n      // remove i from children of p\n      w[head + p] = w[next + i]\n      // increment top\n      ++top\n      // start dfs on child node i\n      w[stack + top] = i\n    }\n  }\n  return k\n}\n","/**\n * This function \"flips\" its input about the integer -1.\n *\n * @param {Number}  i               The value to flip\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csFlip (i) {\n  // flip the value\n  return -i - 2\n}\n","import { factory } from '../../../utils/factory.js'\nimport { csFkeep } from './csFkeep.js'\nimport { csFlip } from './csFlip.js'\nimport { csTdfs } from './csTdfs.js'\n\nconst name = 'csAmd'\nconst dependencies = [\n  'add',\n  'multiply',\n  'transpose'\n]\n\nexport const createCsAmd = /* #__PURE__ */ factory(name, dependencies, ({ add, multiply, transpose }) => {\n  /**\n   * Approximate minimum degree ordering. The minimum degree algorithm is a widely used\n   * heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization\n   * than A. It is a gready method that selects the sparsest pivot row and column during the course\n   * of a right looking sparse Cholesky factorization.\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   *\n   * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR\n   * @param {Matrix} m        Sparse Matrix\n   */\n  return function csAmd (order, a) {\n    // check input parameters\n    if (!a || order <= 0 || order > 3) { return null }\n    // a matrix arrays\n    const asize = a._size\n    // rows and columns\n    const m = asize[0]\n    const n = asize[1]\n    // initialize vars\n    let lemax = 0\n    // dense threshold\n    let dense = Math.max(16, 10 * Math.sqrt(n))\n    dense = Math.min(n - 2, dense)\n    // create target matrix C\n    const cm = _createTargetMatrix(order, a, m, n, dense)\n    // drop diagonal entries\n    csFkeep(cm, _diag, null)\n    // C matrix arrays\n    const cindex = cm._index\n    const cptr = cm._ptr\n\n    // number of nonzero elements in C\n    let cnz = cptr[n]\n\n    // allocate result (n+1)\n    const P = []\n\n    // create workspace (8 * (n + 1))\n    const W = []\n    const len = 0 // first n + 1 entries\n    const nv = n + 1 // next n + 1 entries\n    const next = 2 * (n + 1) // next n + 1 entries\n    const head = 3 * (n + 1) // next n + 1 entries\n    const elen = 4 * (n + 1) // next n + 1 entries\n    const degree = 5 * (n + 1) // next n + 1 entries\n    const w = 6 * (n + 1) // next n + 1 entries\n    const hhead = 7 * (n + 1) // last n + 1 entries\n\n    // use P as workspace for last\n    const last = P\n\n    // initialize quotient graph\n    let mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree)\n\n    // initialize degree lists\n    let nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next)\n\n    // minimum degree node\n    let mindeg = 0\n\n    // vars\n    let i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d\n\n    // while (selecting pivots) do\n    while (nel < n) {\n      // select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first\n      // finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow\n      // many nodes have been eliminated.\n      for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++);\n      if (W[next + k] !== -1) { last[W[next + k]] = -1 }\n      // remove k from degree list\n      W[head + mindeg] = W[next + k]\n      // elenk = |Ek|\n      const elenk = W[elen + k]\n      // # of nodes k represents\n      let nvk = W[nv + k]\n      // W[nv + k] nodes of A eliminated\n      nel += nvk\n\n      // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is\n      // negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the\n      // degree lists. All elements e in Ek are absorved into element k.\n      let dk = 0\n      // flag k as in Lk\n      W[nv + k] = -nvk\n      let p = cptr[k]\n      // do in place if W[elen + k] === 0\n      const pk1 = (elenk === 0) ? p : cnz\n      let pk2 = pk1\n      for (k1 = 1; k1 <= elenk + 1; k1++) {\n        if (k1 > elenk) {\n          // search the nodes in k\n          e = k\n          // list of nodes starts at cindex[pj]\n          pj = p\n          // length of list of nodes in k\n          ln = W[len + k] - elenk\n        } else {\n          // search the nodes in e\n          e = cindex[p++]\n          pj = cptr[e]\n          // length of list of nodes in e\n          ln = W[len + e]\n        }\n        for (k2 = 1; k2 <= ln; k2++) {\n          i = cindex[pj++]\n          // check  node i dead, or seen\n          if ((nvi = W[nv + i]) <= 0) { continue }\n          // W[degree + Lk] += size of node i\n          dk += nvi\n          // negate W[nv + i] to denote i in Lk\n          W[nv + i] = -nvi\n          // place i in Lk\n          cindex[pk2++] = i\n          if (W[next + i] !== -1) { last[W[next + i]] = last[i] }\n          // check we need to remove i from degree list\n          if (last[i] !== -1) { W[next + last[i]] = W[next + i] } else { W[head + W[degree + i]] = W[next + i] }\n        }\n        if (e !== k) {\n          // absorb e into k\n          cptr[e] = csFlip(k)\n          // e is now a dead element\n          W[w + e] = 0\n        }\n      }\n      // cindex[cnz...nzmax] is free\n      if (elenk !== 0) { cnz = pk2 }\n      // external degree of k - |Lk\\i|\n      W[degree + k] = dk\n      // element k is in cindex[pk1..pk2-1]\n      cptr[k] = pk1\n      W[len + k] = pk2 - pk1\n      // k is now an element\n      W[elen + k] = -2\n\n      // Find set differences. The scan1 function now computes the set differences |Le \\ Lk| for all elements e. At the start of the\n      // scan, no entry in the w array is greater than or equal to mark.\n\n      // clear w if necessary\n      mark = _wclear(mark, lemax, W, w, n)\n      // scan 1: find |Le\\Lk|\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]\n        // check if W[elen + i] empty, skip it\n        if ((eln = W[elen + i]) <= 0) { continue }\n        // W[nv + i] was negated\n        nvi = -W[nv + i]\n        const wnvi = mark - nvi\n        // scan Ei\n        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {\n          e = cindex[p]\n          if (W[w + e] >= mark) {\n            // decrement |Le\\Lk|\n            W[w + e] -= nvi\n          } else if (W[w + e] !== 0) {\n            // ensure e is a live element, 1st time e seen in scan 1\n            W[w + e] = W[degree + e] + wnvi\n          }\n        }\n      }\n\n      // degree update\n      // The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash\n      // function h(i) for all nodes in Lk.\n\n      // scan2: degree update\n      for (pk = pk1; pk < pk2; pk++) {\n        // consider node i in Lk\n        i = cindex[pk]\n        p1 = cptr[i]\n        p2 = p1 + W[elen + i] - 1\n        pn = p1\n        // scan Ei\n        for (h = 0, d = 0, p = p1; p <= p2; p++) {\n          e = cindex[p]\n          // check e is an unabsorbed element\n          if (W[w + e] !== 0) {\n            // dext = |Le\\Lk|\n            const dext = W[w + e] - mark\n            if (dext > 0) {\n              // sum up the set differences\n              d += dext\n              // keep e in Ei\n              cindex[pn++] = e\n              // compute the hash of node i\n              h += e\n            } else {\n              // aggressive absorb. e->k\n              cptr[e] = csFlip(k)\n              // e is a dead element\n              W[w + e] = 0\n            }\n          }\n        }\n        // W[elen + i] = |Ei|\n        W[elen + i] = pn - p1 + 1\n        const p3 = pn\n        const p4 = p1 + W[len + i]\n        // prune edges in Ai\n        for (p = p2 + 1; p < p4; p++) {\n          j = cindex[p]\n          // check node j dead or in Lk\n          const nvj = W[nv + j]\n          if (nvj <= 0) { continue }\n          // degree(i) += |j|\n          d += nvj\n          // place j in node list of i\n          cindex[pn++] = j\n          // compute hash for node i\n          h += j\n        }\n        // check for mass elimination\n        if (d === 0) {\n          // absorb i into k\n          cptr[i] = csFlip(k)\n          nvi = -W[nv + i]\n          // |Lk| -= |i|\n          dk -= nvi\n          // |k| += W[nv + i]\n          nvk += nvi\n          nel += nvi\n          W[nv + i] = 0\n          // node i is dead\n          W[elen + i] = -1\n        } else {\n          // update degree(i)\n          W[degree + i] = Math.min(W[degree + i], d)\n          // move first node to end\n          cindex[pn] = cindex[p3]\n          // move 1st el. to end of Ei\n          cindex[p3] = cindex[p1]\n          // add k as 1st element in of Ei\n          cindex[p1] = k\n          // new len of adj. list of node i\n          W[len + i] = pn - p1 + 1\n          // finalize hash of i\n          h = (h < 0 ? -h : h) % n\n          // place i in hash bucket\n          W[next + i] = W[hhead + h]\n          W[hhead + h] = i\n          // save hash of i in last[i]\n          last[i] = h\n        }\n      }\n      // finalize |Lk|\n      W[degree + k] = dk\n      lemax = Math.max(lemax, dk)\n      // clear w\n      mark = _wclear(mark + lemax, lemax, W, w, n)\n\n      // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.\n      // If two nodes have identical adjacency lists, their hash functions wil be identical.\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]\n        // check i is dead, skip it\n        if (W[nv + i] >= 0) { continue }\n        // scan hash bucket of node i\n        h = last[i]\n        i = W[hhead + h]\n        // hash bucket will be empty\n        W[hhead + h] = -1\n        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {\n          ln = W[len + i]\n          eln = W[elen + i]\n          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) { W[w + cindex[p]] = mark }\n          let jlast = i\n          // compare i with all j\n          for (j = W[next + i]; j !== -1;) {\n            let ok = W[len + j] === ln && W[elen + j] === eln\n            for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {\n              // compare i and j\n              if (W[w + cindex[p]] !== mark) { ok = 0 }\n            }\n            // check i and j are identical\n            if (ok) {\n              // absorb j into i\n              cptr[j] = csFlip(i)\n              W[nv + i] += W[nv + j]\n              W[nv + j] = 0\n              // node j is dead\n              W[elen + j] = -1\n              // delete j from hash bucket\n              j = W[next + j]\n              W[next + jlast] = j\n            } else {\n              // j and i are different\n              jlast = j\n              j = W[next + j]\n            }\n          }\n        }\n      }\n\n      // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.\n      // Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.\n      for (p = pk1, pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]\n        // check  i is dead, skip it\n        if ((nvi = -W[nv + i]) <= 0) { continue }\n        // restore W[nv + i]\n        W[nv + i] = nvi\n        // compute external degree(i)\n        d = W[degree + i] + dk - nvi\n        d = Math.min(d, n - nel - nvi)\n        if (W[head + d] !== -1) { last[W[head + d]] = i }\n        // put i back in degree list\n        W[next + i] = W[head + d]\n        last[i] = -1\n        W[head + d] = i\n        // find new minimum degree\n        mindeg = Math.min(mindeg, d)\n        W[degree + i] = d\n        // place i in Lk\n        cindex[p++] = i\n      }\n      // # nodes absorbed into k\n      W[nv + k] = nvk\n      // length of adj list of element k\n      if ((W[len + k] = p - pk1) === 0) {\n        // k is a root of the tree\n        cptr[k] = -1\n        // k is now a dead element\n        W[w + k] = 0\n      }\n      if (elenk !== 0) {\n        // free unused space in Lk\n        cnz = p\n      }\n    }\n\n    // Postordering. The elimination is complete, but no permutation has been computed. All that is left\n    // of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if\n    // nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation\n    // is computed. The tree is restored by unflipping all of ptr.\n\n    // fix assembly tree\n    for (i = 0; i < n; i++) { cptr[i] = csFlip(cptr[i]) }\n    for (j = 0; j <= n; j++) { W[head + j] = -1 }\n    // place unordered nodes in lists\n    for (j = n; j >= 0; j--) {\n      // skip if j is an element\n      if (W[nv + j] > 0) { continue }\n      // place j in list of its parent\n      W[next + j] = W[head + cptr[j]]\n      W[head + cptr[j]] = j\n    }\n    // place elements in lists\n    for (e = n; e >= 0; e--) {\n      // skip unless e is an element\n      if (W[nv + e] <= 0) { continue }\n      if (cptr[e] !== -1) {\n        // place e in list of its parent\n        W[next + e] = W[head + cptr[e]]\n        W[head + cptr[e]] = e\n      }\n    }\n    // postorder the assembly tree\n    for (k = 0, i = 0; i <= n; i++) {\n      if (cptr[i] === -1) { k = csTdfs(i, k, W, head, next, P, w) }\n    }\n    // remove last item in array\n    P.splice(P.length - 1, 1)\n    // return P\n    return P\n  }\n\n  /**\n   * Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation\n   * vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.\n   *\n   * Order: 0\n   *   A natural ordering P=null matrix is returned.\n   *\n   * Order: 1\n   *   Matrix must be square. This is appropriate for a Cholesky or LU factorization.\n   *   P = M + M'\n   *\n   * Order: 2\n   *   Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.\n   *   P = M' * M\n   *\n   * Order: 3\n   *   This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.\n   *   P = M' * M\n   */\n  function _createTargetMatrix (order, a, m, n, dense) {\n    // compute A'\n    const at = transpose(a)\n\n    // check order = 1, matrix must be square\n    if (order === 1 && n === m) {\n      // C = A + A'\n      return add(a, at)\n    }\n\n    // check order = 2, drop dense columns from M'\n    if (order === 2) {\n      // transpose arrays\n      const tindex = at._index\n      const tptr = at._ptr\n      // new column index\n      let p2 = 0\n      // loop A' columns (rows)\n      for (let j = 0; j < m; j++) {\n        // column j of AT starts here\n        let p = tptr[j]\n        // new column j starts here\n        tptr[j] = p2\n        // skip dense col j\n        if (tptr[j + 1] - p > dense) { continue }\n        // map rows in column j of A\n        for (const p1 = tptr[j + 1]; p < p1; p++) { tindex[p2++] = tindex[p] }\n      }\n      // finalize AT\n      tptr[m] = p2\n      // recreate A from new transpose matrix\n      a = transpose(at)\n      // use A' * A\n      return multiply(at, a)\n    }\n\n    // use A' * A, square or rectangular matrix\n    return multiply(at, a)\n  }\n\n  /**\n   * Initialize quotient graph. There are four kind of nodes and elements that must be represented:\n   *\n   *  - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.\n   *  - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).\n   *  - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.\n   *  - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).\n   */\n  function _initializeQuotientGraph (n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {\n    // Initialize quotient graph\n    for (let k = 0; k < n; k++) { W[len + k] = cptr[k + 1] - cptr[k] }\n    W[len + n] = 0\n    // initialize workspace\n    for (let i = 0; i <= n; i++) {\n      // degree list i is empty\n      W[head + i] = -1\n      last[i] = -1\n      W[next + i] = -1\n      // hash list i is empty\n      W[hhead + i] = -1\n      // node i is just one node\n      W[nv + i] = 1\n      // node i is alive\n      W[w + i] = 1\n      // Ek of node i is empty\n      W[elen + i] = 0\n      // degree of node i\n      W[degree + i] = W[len + i]\n    }\n    // clear w\n    const mark = _wclear(0, 0, W, w, n)\n    // n is a dead element\n    W[elen + n] = -2\n    // n is a root of assembly tree\n    cptr[n] = -1\n    // n is a dead element\n    W[w + n] = 0\n    // return mark\n    return mark\n  }\n\n  /**\n   * Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with\n   * degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the\n   * output permutation p.\n   */\n  function _initializeDegreeLists (n, cptr, W, degree, elen, w, dense, nv, head, last, next) {\n    // result\n    let nel = 0\n    // loop columns\n    for (let i = 0; i < n; i++) {\n      // degree @ i\n      const d = W[degree + i]\n      // check node i is empty\n      if (d === 0) {\n        // element i is dead\n        W[elen + i] = -2\n        nel++\n        // i is a root of assembly tree\n        cptr[i] = -1\n        W[w + i] = 0\n      } else if (d > dense) {\n        // absorb i into element n\n        W[nv + i] = 0\n        // node i is dead\n        W[elen + i] = -1\n        nel++\n        cptr[i] = csFlip(n)\n        W[nv + n]++\n      } else {\n        const h = W[head + d]\n        if (h !== -1) { last[h] = i }\n        // put node i in degree list d\n        W[next + i] = W[head + d]\n        W[head + d] = i\n      }\n    }\n    return nel\n  }\n\n  function _wclear (mark, lemax, W, w, n) {\n    if (mark < 2 || (mark + lemax < 0)) {\n      for (let k = 0; k < n; k++) {\n        if (W[w + k] !== 0) { W[w + k] = 1 }\n      }\n      mark = 2\n    }\n    // at this point, W [0..n-1] < mark holds\n    return mark\n  }\n\n  function _diag (i, j) {\n    return i !== j\n  }\n})\n","/**\n * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise\n *\n * @param {Matrix}   a              The sparse matrix\n * @param {function} callback       The callback function, function will be invoked with the following args:\n *                                    - The entry row\n *                                    - The entry column\n *                                    - The entry value\n *                                    - The state parameter\n * @param {any}      other          The state\n *\n * @return                          The number of nonzero elements in the matrix\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csFkeep (a, callback, other) {\n  // a arrays\n  const avalues = a._values\n  const aindex = a._index\n  const aptr = a._ptr\n  const asize = a._size\n  // columns\n  const n = asize[1]\n  // nonzero items\n  let nz = 0\n  // loop columns\n  for (let j = 0; j < n; j++) {\n    // get current location of col j\n    let p = aptr[j]\n    // record new location of col j\n    aptr[j] = nz\n    for (; p < aptr[j + 1]; p++) {\n      // check we need to keep this item\n      if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {\n        // keep A(i,j)\n        aindex[nz] = aindex[p]\n        // check we need to process values (pattern only)\n        if (avalues) { avalues[nz] = avalues[p] }\n        // increment nonzero items\n        nz++\n      }\n    }\n  }\n  // finalize A\n  aptr[n] = nz\n  // trim arrays\n  aindex.splice(nz, aindex.length - nz)\n  // check we need to process values (pattern only)\n  if (avalues) { avalues.splice(nz, avalues.length - nz) }\n  // return number of nonzero items\n  return nz\n}\n","/**\n * This function determines if j is a leaf of the ith row subtree.\n * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)\n *\n * @param {Number}  i               The ith row subtree\n * @param {Number}  j               The node to test\n * @param {Array}   w               The workspace array\n * @param {Number}  first           The index offset within the workspace for the first array\n * @param {Number}  maxfirst        The index offset within the workspace for the maxfirst array\n * @param {Number}  prevleaf        The index offset within the workspace for the prevleaf array\n * @param {Number}  ancestor        The index offset within the workspace for the ancestor array\n *\n * @return {Object}\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csLeaf (i, j, w, first, maxfirst, prevleaf, ancestor) {\n  let s, sparent\n\n  // our result\n  let jleaf = 0\n  let q\n\n  // check j is a leaf\n  if (i <= j || w[first + j] <= w[maxfirst + i]) { return (-1) }\n  // update max first[j] seen so far\n  w[maxfirst + i] = w[first + j]\n  // jprev = previous leaf of ith subtree\n  const jprev = w[prevleaf + i]\n  w[prevleaf + i] = j\n\n  // check j is first or subsequent leaf\n  if (jprev === -1) {\n    // 1st leaf, q = root of ith subtree\n    jleaf = 1\n    q = i\n  } else {\n    // update jleaf\n    jleaf = 2\n    // q = least common ancester (jprev,j)\n    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]);\n    for (s = jprev; s !== q; s = sparent) {\n      // path compression\n      sparent = w[ancestor + s]\n      w[ancestor + s] = q\n    }\n  }\n  return {\n    jleaf: jleaf,\n    q: q\n  }\n}\n","import { factory } from '../../../utils/factory.js'\nimport { csLeaf } from './csLeaf.js'\n\nconst name = 'csCounts'\nconst dependencies = [\n  'transpose'\n]\n\nexport const createCsCounts = /* #__PURE__ */ factory(name, dependencies, ({ transpose }) => {\n  /**\n   * Computes the column counts using the upper triangular part of A.\n   * It transposes A internally, none of the input parameters are modified.\n   *\n   * @param {Matrix} a           The sparse matrix A\n   *\n   * @param {Matrix} ata         Count the columns of A'A instead\n   *\n   * @return                     An array of size n of the column counts or null on error\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  return function (a, parent, post, ata) {\n    // check inputs\n    if (!a || !parent || !post) { return null }\n    // a matrix arrays\n    const asize = a._size\n    // rows and columns\n    const m = asize[0]\n    const n = asize[1]\n    // variables\n    let i, j, k, J, p, p0, p1\n\n    // workspace size\n    const s = 4 * n + (ata ? (n + m + 1) : 0)\n    // allocate workspace\n    const w = [] // (s)\n    const ancestor = 0 // first n entries\n    const maxfirst = n // next n entries\n    const prevleaf = 2 * n // next n entries\n    const first = 3 * n // next n entries\n    const head = 4 * n // next n + 1 entries (used when ata is true)\n    const next = 5 * n + 1 // last entries in workspace\n    // clear workspace w[0..s-1]\n    for (k = 0; k < s; k++) { w[k] = -1 }\n\n    // allocate result\n    const colcount = [] // (n)\n\n    // AT = A'\n    const at = transpose(a)\n    // at arrays\n    const tindex = at._index\n    const tptr = at._ptr\n\n    // find w[first + j]\n    for (k = 0; k < n; k++) {\n      j = post[k]\n      // colcount[j]=1 if j is a leaf\n      colcount[j] = (w[first + j] === -1) ? 1 : 0\n      for (; j !== -1 && w[first + j] === -1; j = parent[j]) { w[first + j] = k }\n    }\n\n    // initialize ata if needed\n    if (ata) {\n      // invert post\n      for (k = 0; k < n; k++) { w[post[k]] = k }\n      // loop rows (columns in AT)\n      for (i = 0; i < m; i++) {\n        // values in column i of AT\n        for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) { k = Math.min(k, w[tindex[p]]) }\n        // place row i in linked list k\n        w[next + i] = w[head + k]\n        w[head + k] = i\n      }\n    }\n\n    // each node in its own set\n    for (i = 0; i < n; i++) { w[ancestor + i] = i }\n\n    for (k = 0; k < n; k++) {\n      // j is the kth node in postordered etree\n      j = post[k]\n      // check j is not a root\n      if (parent[j] !== -1) { colcount[parent[j]]-- }\n\n      // J=j for LL'=A case\n      for (J = (ata ? w[head + k] : j); J !== -1; J = (ata ? w[next + J] : -1)) {\n        for (p = tptr[J]; p < tptr[J + 1]; p++) {\n          i = tindex[p]\n          const r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor)\n          // check A(i,j) is in skeleton\n          if (r.jleaf >= 1) { colcount[j]++ }\n          // check account for overlap in q\n          if (r.jleaf === 2) { colcount[r.q]-- }\n        }\n      }\n      if (parent[j] !== -1) { w[ancestor + j] = parent[j] }\n    }\n    // sum up colcount's of each child\n    for (j = 0; j < n; j++) {\n      if (parent[j] !== -1) { colcount[parent[j]] += colcount[j] }\n    }\n    return colcount\n  }\n})\n","import { csPermute } from './csPermute.js'\nimport { csPost } from './csPost.js'\nimport { csEtree } from './csEtree.js'\nimport { createCsAmd } from './csAmd.js'\nimport { createCsCounts } from './csCounts.js'\nimport { factory } from '../../../utils/factory.js'\n\nconst name = 'csSqr'\nconst dependencies = [\n  'add',\n  'multiply',\n  'transpose'\n]\n\nexport const createCsSqr = /* #__PURE__ */ factory(name, dependencies, ({ add, multiply, transpose }) => {\n  const csAmd = createCsAmd({ add, multiply, transpose })\n  const csCounts = createCsCounts({ transpose })\n\n  /**\n   * Symbolic ordering and analysis for QR and LU decompositions.\n   *\n   * @param {Number}  order           The ordering strategy (see csAmd for more details)\n   * @param {Matrix}  a               The A matrix\n   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or\n   *                                  symbolic ordering and analysis for LU decomposition (false)\n   *\n   * @return {Object}                 The Symbolic ordering and analysis for matrix A\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  return function csSqr (order, a, qr) {\n    // a arrays\n    const aptr = a._ptr\n    const asize = a._size\n    // columns\n    const n = asize[1]\n    // vars\n    let k\n    // symbolic analysis result\n    const s = {}\n    // fill-reducing ordering\n    s.q = csAmd(order, a)\n    // validate results\n    if (order && !s.q) { return null }\n    // QR symbolic analysis\n    if (qr) {\n      // apply permutations if needed\n      const c = order ? csPermute(a, null, s.q, 0) : a\n      // etree of C'*C, where C=A(:,q)\n      s.parent = csEtree(c, 1)\n      // post order elimination tree\n      const post = csPost(s.parent, n)\n      // col counts chol(C'*C)\n      s.cp = csCounts(c, s.parent, post, 1)\n      // check we have everything needed to calculate number of nonzero elements\n      if (c && s.parent && s.cp && _vcount(c, s)) {\n        // calculate number of nonzero elements\n        for (s.unz = 0, k = 0; k < n; k++) { s.unz += s.cp[k] }\n      }\n    } else {\n      // for LU factorization only, guess nnz(L) and nnz(U)\n      s.unz = 4 * (aptr[n]) + n\n      s.lnz = s.unz\n    }\n    // return result S\n    return s\n  }\n\n  /**\n   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent\n   */\n  function _vcount (a, s) {\n    // a arrays\n    const aptr = a._ptr\n    const aindex = a._index\n    const asize = a._size\n    // rows & columns\n    const m = asize[0]\n    const n = asize[1]\n    // initialize s arrays\n    s.pinv = [] // (m + n)\n    s.leftmost = [] // (m)\n    // vars\n    const parent = s.parent\n    const pinv = s.pinv\n    const leftmost = s.leftmost\n    // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n    const w = [] // (m + 3 * n)\n    const next = 0\n    const head = m\n    const tail = m + n\n    const nque = m + 2 * n\n    // vars\n    let i, k, p, p0, p1\n    // initialize w\n    for (k = 0; k < n; k++) {\n      // queue k is empty\n      w[head + k] = -1\n      w[tail + k] = -1\n      w[nque + k] = 0\n    }\n    // initialize row arrays\n    for (i = 0; i < m; i++) { leftmost[i] = -1 }\n    // loop columns backwards\n    for (k = n - 1; k >= 0; k--) {\n      // values & index for column k\n      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n        // leftmost[i] = min(find(A(i,:)))\n        leftmost[aindex[p]] = k\n      }\n    }\n    // scan rows in reverse order\n    for (i = m - 1; i >= 0; i--) {\n      // row i is not yet ordered\n      pinv[i] = -1\n      k = leftmost[i]\n      // check row i is empty\n      if (k === -1) { continue }\n      // first row in queue k\n      if (w[nque + k]++ === 0) { w[tail + k] = i }\n      // put i at head of queue k\n      w[next + i] = w[head + k]\n      w[head + k] = i\n    }\n    s.lnz = 0\n    s.m2 = m\n    // find row permutation and nnz(V)\n    for (k = 0; k < n; k++) {\n      // remove row i from queue k\n      i = w[head + k]\n      // count V(k,k) as nonzero\n      s.lnz++\n      // add a fictitious row\n      if (i < 0) { i = s.m2++ }\n      // associate row i with V(:,k)\n      pinv[i] = k\n      // skip if V(k+1:m,k) is empty\n      if (--nque[k] <= 0) { continue }\n      // nque[k] is nnz (V(k+1:m,k))\n      s.lnz += w[nque + k]\n      // move all rows to parent of k\n      const pa = parent[k]\n      if (pa !== -1) {\n        if (w[nque + pa] === 0) { w[tail + pa] = w[tail + k] }\n        w[next + w[tail + k]] = w[head + pa]\n        w[head + pa] = w[next + i]\n        w[nque + pa] += w[nque + k]\n      }\n    }\n    for (i = 0; i < m; i++) {\n      if (pinv[i] < 0) { pinv[i] = k++ }\n    }\n    return true\n  }\n})\n","/**\n * Permutes a sparse matrix C = P * A * Q\n *\n * @param {SparseMatrix}  a         The Matrix A\n * @param {Array}   pinv            The row permutation vector\n * @param {Array}   q               The column permutation vector\n * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise\n *\n * @return {Matrix}                 C = P * A * Q, null on error\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csPermute (a, pinv, q, values) {\n  // a arrays\n  const avalues = a._values\n  const aindex = a._index\n  const aptr = a._ptr\n  const asize = a._size\n  const adt = a._datatype\n  // rows & columns\n  const m = asize[0]\n  const n = asize[1]\n  // c arrays\n  const cvalues = values && a._values ? [] : null\n  const cindex = [] // (aptr[n])\n  const cptr = [] // (n + 1)\n  // initialize vars\n  let nz = 0\n  // loop columns\n  for (let k = 0; k < n; k++) {\n    // column k of C is column q[k] of A\n    cptr[k] = nz\n    // apply column permutation\n    const j = q ? (q[k]) : k\n    // loop values in column j of A\n    for (let t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {\n      // row i of A is row pinv[i] of C\n      const r = pinv ? pinv[aindex[t]] : aindex[t]\n      // index\n      cindex[nz] = r\n      // check we need to populate values\n      if (cvalues) { cvalues[nz] = avalues[t] }\n      // increment number of nonzero elements\n      nz++\n    }\n  }\n  // finalize the last column of C\n  cptr[n] = nz\n  // return C matrix\n  return a.createSparseMatrix({\n    values: cvalues,\n    index: cindex,\n    ptr: cptr,\n    size: [m, n],\n    datatype: adt\n  })\n}\n","/**\n * Computes the elimination tree of Matrix A (using triu(A)) or the\n * elimination tree of A'A without forming A'A.\n *\n * @param {Matrix}  a               The A Matrix\n * @param {boolean} ata             A value of true the function computes the etree of A'A\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csEtree (a, ata) {\n  // check inputs\n  if (!a) { return null }\n  // a arrays\n  const aindex = a._index\n  const aptr = a._ptr\n  const asize = a._size\n  // rows & columns\n  const m = asize[0]\n  const n = asize[1]\n\n  // allocate result\n  const parent = [] // (n)\n\n  // allocate workspace\n  const w = [] // (n + (ata ? m : 0))\n  const ancestor = 0 // first n entries in w\n  const prev = n // last m entries (ata = true)\n\n  let i, inext\n\n  // check we are calculating A'A\n  if (ata) {\n    // initialize workspace\n    for (i = 0; i < m; i++) { w[prev + i] = -1 }\n  }\n  // loop columns\n  for (let k = 0; k < n; k++) {\n    // node k has no parent yet\n    parent[k] = -1\n    // nor does k have an ancestor\n    w[ancestor + k] = -1\n    // values in column k\n    for (let p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n      // row\n      const r = aindex[p]\n      // node\n      i = ata ? (w[prev + r]) : r\n      // traverse from i to k\n      for (; i !== -1 && i < k; i = inext) {\n        // inext = ancestor of i\n        inext = w[ancestor + i]\n        // path compression\n        w[ancestor + i] = k\n        // check no anc., parent is k\n        if (inext === -1) { parent[i] = k }\n      }\n      if (ata) { w[prev + r] = k }\n    }\n  }\n  return parent\n}\n","import { csTdfs } from './csTdfs.js'\n\n/**\n * Post order a tree of forest\n *\n * @param {Array}   parent          The tree or forest\n * @param {Number}  n               Number of columns\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csPost (parent, n) {\n  // check inputs\n  if (!parent) { return null }\n  // vars\n  let k = 0\n  let j\n  // allocate result\n  const post = [] // (n)\n  // workspace, head: first n entries, next: next n entries, stack: last n entries\n  const w = [] // (3 * n)\n  const head = 0\n  const next = n\n  const stack = 2 * n\n  // initialize workspace\n  for (j = 0; j < n; j++) {\n    // empty linked lists\n    w[head + j] = -1\n  }\n  // traverse nodes in reverse order\n  for (j = n - 1; j >= 0; j--) {\n    // check j is a root\n    if (parent[j] === -1) { continue }\n    // add j to list of its parent\n    w[next + j] = w[head + parent[j]]\n    w[head + parent[j]] = j\n  }\n  // loop nodes\n  for (j = 0; j < n; j++) {\n    // skip j if it is not a root\n    if (parent[j] !== -1) { continue }\n    // depth-first search\n    k = csTdfs(j, k, w, head, next, post, stack)\n  }\n  return post\n}\n","/**\n * Checks if the node at w[j] is marked\n *\n * @param {Array}   w               The array\n * @param {Number}  j               The array index\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csMarked (w, j) {\n  // check node is marked\n  return w[j] < 0\n}\n","import { csFlip } from './csFlip.js'\n\n/**\n * Marks the node at w[j]\n *\n * @param {Array}   w               The array\n * @param {Number}  j               The array index\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csMark (w, j) {\n  // mark w[j]\n  w[j] = csFlip(w[j])\n}\n","import { csFlip } from './csFlip.js'\n\n/**\n * Flips the value if it is negative of returns the same value otherwise.\n *\n * @param {Number}  i               The value to flip\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csUnflip (i) {\n  // flip the value if it is negative\n  return i < 0 ? csFlip(i) : i\n}\n","import { csMarked } from './csMarked.js'\nimport { csMark } from './csMark.js'\nimport { csUnflip } from './csUnflip.js'\n\n/**\n * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting\n * at nodes in B (see csReach()).\n *\n * @param {Number}  j               The starting node for the DFS algorithm\n * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored\n * @param {Number}  top             Start index in stack xi[top..n-1]\n * @param {Number}  k               The kth column in B\n * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b\n *\n * @return {Number}                 New value of top\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csDfs (j, g, top, xi, pinv) {\n  // g arrays\n  const index = g._index\n  const ptr = g._ptr\n  const size = g._size\n  // columns\n  const n = size[1]\n  // vars\n  let i, p, p2\n  // initialize head\n  let head = 0\n  // initialize the recursion stack\n  xi[0] = j\n  // loop\n  while (head >= 0) {\n    // get j from the top of the recursion stack\n    j = xi[head]\n    // apply permutation vector\n    const jnew = pinv ? pinv[j] : j\n    // check node j is marked\n    if (!csMarked(ptr, j)) {\n      // mark node j as visited\n      csMark(ptr, j)\n      // update stack (last n entries in xi)\n      xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew])\n    }\n    // node j done if no unvisited neighbors\n    let done = 1\n    // examine all neighbors of j, stack (last n entries in xi)\n    for (p = xi[n + head], p2 = jnew < 0 ? 0 : csUnflip(ptr[jnew + 1]); p < p2; p++) {\n      // consider neighbor node i\n      i = index[p]\n      // check we have visited node i, skip it\n      if (csMarked(ptr, i)) { continue }\n      // pause depth-first search of node j, update stack (last n entries in xi)\n      xi[n + head] = p\n      // start dfs at node i\n      xi[++head] = i\n      // node j is not done\n      done = 0\n      // break, to start dfs(i)\n      break\n    }\n    // check depth-first search at node j is done\n    if (done) {\n      // remove j from the recursion stack\n      head--\n      // and place in the output stack\n      xi[--top] = j\n    }\n  }\n  return top\n}\n","import { csReach } from './csReach.js'\nimport { factory } from '../../../utils/factory.js'\n\nconst name = 'csSpsolve'\nconst dependencies = [\n  'divideScalar',\n  'multiply',\n  'subtract'\n]\n\nexport const createCsSpsolve = /* #__PURE__ */ factory(name, dependencies, ({ divideScalar, multiply, subtract }) => {\n  /**\n   * The function csSpsolve() computes the solution to G * x = bk, where bk is the\n   * kth column of B. When lo is true, the function assumes G = L is lower triangular with the\n   * diagonal entry as the first entry in each column. When lo is true, the function assumes G = U\n   * is upper triangular with the diagonal entry as the last entry in each column.\n   *\n   * @param {Matrix}  g               The G matrix\n   * @param {Matrix}  b               The B matrix\n   * @param {Number}  k               The kth column in B\n   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n   *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n   * @param {Array}   x               The soluton to the linear system G * x = b\n   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b\n   * @param {boolean} lo              The lower (true) upper triangular (false) flag\n   *\n   * @return {Number}                 The index for the nonzero pattern\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  return function csSpsolve (g, b, k, xi, x, pinv, lo) {\n    // g arrays\n    const gvalues = g._values\n    const gindex = g._index\n    const gptr = g._ptr\n    const gsize = g._size\n    // columns\n    const n = gsize[1]\n    // b arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    // vars\n    let p, p0, p1, q\n    // xi[top..n-1] = csReach(B(:,k))\n    const top = csReach(g, b, k, xi, pinv)\n    // clear x\n    for (p = top; p < n; p++) { x[xi[p]] = 0 }\n    // scatter b\n    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) { x[bindex[p]] = bvalues[p] }\n    // loop columns\n    for (let px = top; px < n; px++) {\n      // x array index for px\n      const j = xi[px]\n      // apply permutation vector (U x = b), j maps to column J of G\n      const J = pinv ? pinv[j] : j\n      // check column J is empty\n      if (J < 0) { continue }\n      // column value indeces in G, p0 <= p < p1\n      p0 = gptr[J]\n      p1 = gptr[J + 1]\n      // x(j) /= G(j,j)\n      x[j] = divideScalar(x[j], gvalues[lo ? p0 : (p1 - 1)])\n      // first entry L(j,j)\n      p = lo ? (p0 + 1) : p0\n      q = lo ? (p1) : (p1 - 1)\n      // loop\n      for (; p < q; p++) {\n        // row\n        const i = gindex[p]\n        // x(i) -= G(i,j) * x(j)\n        x[i] = subtract(x[i], multiply(gvalues[p], x[j]))\n      }\n    }\n    // return top of stack\n    return top\n  }\n})\n","import { csMarked } from './csMarked.js'\nimport { csMark } from './csMark.js'\nimport { csDfs } from './csDfs.js'\n\n/**\n * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1\n * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The\n * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).\n *\n * @param {Matrix}  g               The G matrix\n * @param {Matrix}  b               The B matrix\n * @param {Number}  k               The kth column in B\n * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n * @param {Array}   pinv            The inverse row permutation vector\n *\n * @return {Number}                 The index for the nonzero pattern\n *\n * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n */\nexport function csReach (g, b, k, xi, pinv) {\n  // g arrays\n  const gptr = g._ptr\n  const gsize = g._size\n  // b arrays\n  const bindex = b._index\n  const bptr = b._ptr\n  // columns\n  const n = gsize[1]\n  // vars\n  let p, p0, p1\n  // initialize top\n  let top = n\n  // loop column indeces in B\n  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n    // node i\n    const i = bindex[p]\n    // check node i is marked\n    if (!csMarked(gptr, i)) {\n      // start a dfs at unmarked node i\n      top = csDfs(i, g, top, xi, pinv)\n    }\n  }\n  // loop columns from top -> n - 1\n  for (p = top; p < n; p++) {\n    // restore G\n    csMark(gptr, xi[p])\n  }\n  return top\n}\n","import { factory } from '../../../utils/factory.js'\nimport { createCsSpsolve } from './csSpsolve.js'\n\nconst name = 'csLu'\nconst dependencies = [\n  'abs',\n  'divideScalar',\n  'multiply',\n  'subtract',\n  'larger',\n  'largerEq',\n  'SparseMatrix'\n]\n\nexport const createCsLu = /* #__PURE__ */ factory(name, dependencies, ({ abs, divideScalar, multiply, subtract, larger, largerEq, SparseMatrix }) => {\n  const csSpsolve = createCsSpsolve({ divideScalar, multiply, subtract })\n\n  /**\n   * Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization\n   * algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L\n   * and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so\n   * L * U = A(p, q), where p is the inverse of pinv.\n   *\n   * @param {Matrix}  m               The A Matrix to factorize\n   * @param {Object}  s               The symbolic analysis from csSqr(). Provides the fill-reducing\n   *                                  column ordering q\n   * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)\n   *\n   * @return {Number}                 The numeric LU factorization of A or null\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  return function csLu (m, s, tol) {\n    // validate input\n    if (!m) { return null }\n    // m arrays\n    const size = m._size\n    // columns\n    const n = size[1]\n    // symbolic analysis result\n    let q\n    let lnz = 100\n    let unz = 100\n    // update symbolic analysis parameters\n    if (s) {\n      q = s.q\n      lnz = s.lnz || lnz\n      unz = s.unz || unz\n    }\n    // L arrays\n    const lvalues = [] // (lnz)\n    const lindex = [] // (lnz)\n    const lptr = [] // (n + 1)\n    // L\n    const L = new SparseMatrix({\n      values: lvalues,\n      index: lindex,\n      ptr: lptr,\n      size: [n, n]\n    })\n    // U arrays\n    const uvalues = [] // (unz)\n    const uindex = [] // (unz)\n    const uptr = [] // (n + 1)\n    // U\n    const U = new SparseMatrix({\n      values: uvalues,\n      index: uindex,\n      ptr: uptr,\n      size: [n, n]\n    })\n    // inverse of permutation vector\n    const pinv = [] // (n)\n    // vars\n    let i, p\n    // allocate arrays\n    const x = [] // (n)\n    const xi = [] // (2 * n)\n    // initialize variables\n    for (i = 0; i < n; i++) {\n      // clear workspace\n      x[i] = 0\n      // no rows pivotal yet\n      pinv[i] = -1\n      // no cols of L yet\n      lptr[i + 1] = 0\n    }\n    // reset number of nonzero elements in L and U\n    lnz = 0\n    unz = 0\n    // compute L(:,k) and U(:,k)\n    for (let k = 0; k < n; k++) {\n      // update ptr\n      lptr[k] = lnz\n      uptr[k] = unz\n      // apply column permutations if needed\n      const col = q ? q[k] : k\n      // solve triangular system, x = L\\A(:,col)\n      const top = csSpsolve(L, m, col, xi, x, pinv, 1)\n      // find pivot\n      let ipiv = -1\n      let a = -1\n      // loop xi[] from top -> n\n      for (p = top; p < n; p++) {\n        // x[i] is nonzero\n        i = xi[p]\n        // check row i is not yet pivotal\n        if (pinv[i] < 0) {\n          // absolute value of x[i]\n          const xabs = abs(x[i])\n          // check absoulte value is greater than pivot value\n          if (larger(xabs, a)) {\n            // largest pivot candidate so far\n            a = xabs\n            ipiv = i\n          }\n        } else {\n          // x(i) is the entry U(pinv[i],k)\n          uindex[unz] = pinv[i]\n          uvalues[unz++] = x[i]\n        }\n      }\n      // validate we found a valid pivot\n      if (ipiv === -1 || a <= 0) { return null }\n      // update actual pivot column, give preference to diagonal value\n      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) { ipiv = col }\n      // the chosen pivot\n      const pivot = x[ipiv]\n      // last entry in U(:,k) is U(k,k)\n      uindex[unz] = k\n      uvalues[unz++] = pivot\n      // ipiv is the kth pivot row\n      pinv[ipiv] = k\n      // first entry in L(:,k) is L(k,k) = 1\n      lindex[lnz] = ipiv\n      lvalues[lnz++] = 1\n      // L(k+1:n,k) = x / pivot\n      for (p = top; p < n; p++) {\n        // row\n        i = xi[p]\n        // check x(i) is an entry in L(:,k)\n        if (pinv[i] < 0) {\n          // save unpermuted row in L\n          lindex[lnz] = i\n          // scale pivot column\n          lvalues[lnz++] = divideScalar(x[i], pivot)\n        }\n        // x[0..n-1] = 0 for next k\n        x[i] = 0\n      }\n    }\n    // update ptr\n    lptr[n] = lnz\n    uptr[n] = unz\n    // fix row indices of L for final pinv\n    for (p = 0; p < lnz; p++) { lindex[p] = pinv[lindex[p]] }\n    // trim arrays\n    lvalues.splice(lnz, lvalues.length - lnz)\n    lindex.splice(lnz, lindex.length - lnz)\n    uvalues.splice(unz, uvalues.length - unz)\n    uindex.splice(unz, uindex.length - unz)\n    // return LU factor\n    return {\n      L: L,\n      U: U,\n      pinv: pinv\n    }\n  }\n})\n","import { isInteger } from '../../../utils/number.js'\nimport { factory } from '../../../utils/factory.js'\nimport { createCsSqr } from '../sparse/csSqr.js'\nimport { createCsLu } from '../sparse/csLu.js'\n\nconst name = 'slu'\nconst dependencies = [\n  'typed',\n  'abs',\n  'add',\n  'multiply',\n  'transpose',\n  'divideScalar',\n  'subtract',\n  'larger',\n  'largerEq',\n  'SparseMatrix'\n]\n\nexport const createSlu = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, add, multiply, transpose, divideScalar, subtract, larger, largerEq, SparseMatrix }) => {\n  const csSqr = createCsSqr({ add, multiply, transpose })\n  const csLu = createCsLu({ abs, divideScalar, multiply, subtract, larger, largerEq, SparseMatrix })\n\n  /**\n   * Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where\n   *\n   * `P * A * Q = L * U`\n   *\n   * Syntax:\n   *\n   *    math.slu(A, order, threshold)\n   *\n   * Examples:\n   *\n   *    const A = math.sparse([[4,3], [6, 3]])\n   *    math.slu(A, 1, 0.001)\n   *    // returns:\n   *    // {\n   *    //   L: [[1, 0], [1.5, 1]]\n   *    //   U: [[4, 3], [0, -1.5]]\n   *    //   p: [0, 1]\n   *    //   q: [0, 1]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lsolve, usolve, lusolve\n   *\n   * @param {SparseMatrix} A              A two dimensional sparse matrix for which to get the LU decomposition.\n   * @param {Number}       order          The Symbolic Ordering and Analysis order:\n   *                                       0 - Natural ordering, no permutation vector q is returned\n   *                                       1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'\n   *                                       2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.\n   *                                           This is appropriatefor LU factorization of unsymmetric matrices.\n   *                                       3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.\n   *                                           A dense row is a row with more than 10*sqr(columns) entries.\n   * @param {Number}       threshold       Partial pivoting threshold (1 for partial pivoting)\n   *\n   * @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.\n   */\n  return typed(name, {\n\n    'SparseMatrix, number, number': function (a, order, threshold) {\n      // verify order\n      if (!isInteger(order) || order < 0 || order > 3) { throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]') }\n      // verify threshold\n      if (threshold < 0 || threshold > 1) { throw new Error('Partial pivoting threshold must be a number from 0 to 1') }\n\n      // perform symbolic ordering and analysis\n      const s = csSqr(order, a, false)\n\n      // perform lu decomposition\n      const f = csLu(a, s, threshold)\n\n      // return decomposition\n      return {\n        L: f.L,\n        U: f.U,\n        p: f.pinv,\n        q: s.q,\n        toString: function () {\n          return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\np: ' + this.p.toString() + (this.q ? '\\nq: ' + this.q.toString() : '') + '\\n'\n        }\n      }\n    }\n  })\n})\n","/**\n * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.\n *\n * @param {Array} p           The permutation vector of length n. null value denotes identity\n * @param {Array} b           The input vector\n *\n * @return {Array}            The output vector x = P'b\n */\nexport function csIpvec (p, b) {\n  // vars\n  let k\n  const n = b.length\n  const x = []\n  // check permutation vector was provided, p = null denotes identity\n  if (p) {\n    // loop vector\n    for (k = 0; k < n; k++) {\n      // apply permutation\n      x[p[k]] = b[k]\n    }\n  } else {\n    // loop vector\n    for (k = 0; k < n; k++) {\n      // x[i] = b[i]\n      x[k] = b[k]\n    }\n  }\n  return x\n}\n","import { isArray, isMatrix } from '../../../utils/is.js'\nimport { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\nimport { csIpvec } from '../sparse/csIpvec.js'\n\nconst name = 'lusolve'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'lup',\n  'slu',\n  'usolve',\n  'lsolve',\n  'DenseMatrix'\n]\n\nexport const createLusolve = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, lup, slu, usolve, lsolve, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.\n   *\n   * Syntax:\n   *\n   *    math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b\n   *    math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)\n   *\n   * Examples:\n   *\n   *    const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]\n   *\n   *    const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]\n   *\n   *    const f = math.lup(m)\n   *    const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]\n   *    const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = math.lusolve(a, b)  // [[2], [5]]\n   *\n   * See also:\n   *\n   *    lup, slu, lsolve, usolve\n   *\n   * @param {Matrix | Array | Object} A      Invertible Matrix or the Matrix LU decomposition\n   * @param {Matrix | Array} b               Column Vector\n   * @param {number} [order]                 The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix\n   * @param {Number} [threshold]             Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.\n   *\n   * @return {DenseMatrix | Array}           Column vector with the solution to the linear system A * x = b\n   */\n  return typed(name, {\n\n    'Array, Array | Matrix': function (a, b) {\n      a = matrix(a)\n      const d = lup(a)\n      const x = _lusolve(d.L, d.U, d.p, null, b)\n      return x.valueOf()\n    },\n\n    'DenseMatrix, Array | Matrix': function (a, b) {\n      const d = lup(a)\n      return _lusolve(d.L, d.U, d.p, null, b)\n    },\n\n    'SparseMatrix, Array | Matrix': function (a, b) {\n      const d = lup(a)\n      return _lusolve(d.L, d.U, d.p, null, b)\n    },\n\n    'SparseMatrix, Array | Matrix, number, number': function (a, b, order, threshold) {\n      const d = slu(a, order, threshold)\n      return _lusolve(d.L, d.U, d.p, d.q, b)\n    },\n\n    'Object, Array | Matrix': function (d, b) {\n      return _lusolve(d.L, d.U, d.p, d.q, b)\n    }\n  })\n\n  function _toMatrix (a) {\n    if (isMatrix(a)) { return a }\n    if (isArray(a)) { return matrix(a) }\n    throw new TypeError('Invalid Matrix LU decomposition')\n  }\n\n  function _lusolve (l, u, p, q, b) {\n    // verify decomposition\n    l = _toMatrix(l)\n    u = _toMatrix(u)\n\n    // apply row permutations if needed (b is a DenseMatrix)\n    if (p) {\n      b = solveValidation(l, b, true)\n      b._data = csIpvec(p, b._data)\n    }\n\n    // use forward substitution to resolve L * y = b\n    const y = lsolve(l, b)\n    // use backward substitution to resolve U * x = y\n    const x = usolve(u, y)\n\n    // apply column permutations if needed (x is a DenseMatrix)\n    if (q) { x._data = csIpvec(q, x._data) }\n\n    return x\n  }\n})\n","import { isHelp } from '../utils/is.js'\nimport { clone } from '../utils/object.js'\nimport { format } from '../utils/string.js'\nimport { factory } from '../utils/factory.js'\n\nconst name = 'Help'\nconst dependencies = ['parse']\n\nexport const createHelpClass = /* #__PURE__ */ factory(name, dependencies, ({ parse }) => {\n  /**\n   * Documentation object\n   * @param {Object} doc  Object containing properties:\n   *                      {string} name\n   *                      {string} category\n   *                      {string} description\n   *                      {string[]} syntax\n   *                      {string[]} examples\n   *                      {string[]} seealso\n   * @constructor\n   */\n  function Help (doc) {\n    if (!(this instanceof Help)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    if (!doc) throw new Error('Argument \"doc\" missing')\n\n    this.doc = doc\n  }\n\n  /**\n   * Attach type information\n   */\n  Help.prototype.type = 'Help'\n  Help.prototype.isHelp = true\n\n  /**\n   * Generate a string representation of the Help object\n   * @return {string} Returns a string\n   * @private\n   */\n  Help.prototype.toString = function () {\n    const doc = this.doc || {}\n    let desc = '\\n'\n\n    if (doc.name) {\n      desc += 'Name: ' + doc.name + '\\n\\n'\n    }\n    if (doc.category) {\n      desc += 'Category: ' + doc.category + '\\n\\n'\n    }\n    if (doc.description) {\n      desc += 'Description:\\n    ' + doc.description + '\\n\\n'\n    }\n    if (doc.syntax) {\n      desc += 'Syntax:\\n    ' + doc.syntax.join('\\n    ') + '\\n\\n'\n    }\n    if (doc.examples) {\n      desc += 'Examples:\\n'\n\n      const scope = {}\n      for (let i = 0; i < doc.examples.length; i++) {\n        const expr = doc.examples[i]\n        desc += '    ' + expr + '\\n'\n\n        let res\n        try {\n          // note: res can be undefined when `expr` is an empty string\n          res = parse(expr).compile().evaluate(scope)\n        } catch (e) {\n          res = e\n        }\n        if (res !== undefined && !isHelp(res)) {\n          desc += '        ' + format(res, { precision: 14 }) + '\\n'\n        }\n      }\n      desc += '\\n'\n    }\n    if (doc.mayThrow && doc.mayThrow.length) {\n      desc += 'Throws: ' + doc.mayThrow.join(', ') + '\\n\\n'\n    }\n    if (doc.seealso && doc.seealso.length) {\n      desc += 'See also: ' + doc.seealso.join(', ') + '\\n'\n    }\n\n    return desc\n  }\n\n  /**\n   * Export the help object to JSON\n   */\n  Help.prototype.toJSON = function () {\n    const obj = clone(this.doc)\n    obj.mathjs = 'Help'\n    return obj\n  }\n\n  /**\n   * Instantiate a Help object from a JSON object\n   * @param {Object} json\n   * @returns {Help} Returns a new Help object\n   */\n  Help.fromJSON = function (json) {\n    const doc = {}\n\n    Object.keys(json)\n      .filter(prop => prop !== 'mathjs')\n      .forEach(prop => {\n        doc[prop] = json[prop]\n      })\n\n    return new Help(doc)\n  }\n\n  /**\n   * Returns a string representation of the Help object\n   */\n  Help.prototype.valueOf = Help.prototype.toString\n\n  return Help\n}, { isClass: true })\n","import { isChain } from '../../utils/is.js'\nimport { format } from '../../utils/string.js'\nimport { hasOwnProperty, lazy } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Chain'\nconst dependencies = ['?on', 'math']\n\nexport const createChainClass = /* #__PURE__ */ factory(name, dependencies, ({ on, math }) => {\n  /**\n   * @constructor Chain\n   * Wrap any value in a chain, allowing to perform chained operations on\n   * the value.\n   *\n   * All methods available in the math.js library can be called upon the chain,\n   * and then will be evaluated with the value itself as first argument.\n   * The chain can be closed by executing chain.done(), which will return\n   * the final value.\n   *\n   * The Chain has a number of special functions:\n   * - done()             Finalize the chained operation and return the\n   *                      chain's value.\n   * - valueOf()          The same as done()\n   * - toString()         Returns a string representation of the chain's value.\n   *\n   * @param {*} [value]\n   */\n  function Chain (value) {\n    if (!(this instanceof Chain)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    if (isChain(value)) {\n      this.value = value.value\n    } else {\n      this.value = value\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Chain.prototype.type = 'Chain'\n  Chain.prototype.isChain = true\n\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method valueOf()\n   * @returns {*} value\n   */\n  Chain.prototype.done = function () {\n    return this.value\n  }\n\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method done()\n   * @returns {*} value\n   */\n  Chain.prototype.valueOf = function () {\n    return this.value\n  }\n\n  /**\n   * Get a string representation of the value in the chain\n   * @returns {string}\n   */\n  Chain.prototype.toString = function () {\n    return format(this.value)\n  }\n\n  /**\n   * Get a JSON representation of the chain\n   * @returns {Object}\n   */\n  Chain.prototype.toJSON = function () {\n    return {\n      mathjs: 'Chain',\n      value: this.value\n    }\n  }\n\n  /**\n   * Instantiate a Chain from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"Chain\", value: ...}`,\n   *                       where mathjs is optional\n   * @returns {Chain}\n   */\n  Chain.fromJSON = function (json) {\n    return new Chain(json.value)\n  }\n\n  /**\n   * Create a proxy method for the chain\n   * @param {string} name\n   * @param {Function} fn      The function to be proxied\n   *                           If fn is no function, it is silently ignored.\n   * @private\n   */\n  function createProxy (name, fn) {\n    if (typeof fn === 'function') {\n      Chain.prototype[name] = chainify(fn)\n    }\n  }\n\n  /**\n   * Create a proxy method for the chain\n   * @param {string} name\n   * @param {function} resolver   The function resolving with the\n   *                              function to be proxied\n   * @private\n   */\n  function createLazyProxy (name, resolver) {\n    lazy(Chain.prototype, name, function outerResolver () {\n      const fn = resolver()\n      if (typeof fn === 'function') {\n        return chainify(fn)\n      }\n\n      return undefined // if not a function, ignore\n    })\n  }\n\n  /**\n   * Make a function chainable\n   * @param {function} fn\n   * @return {Function} chain function\n   * @private\n   */\n  function chainify (fn) {\n    return function () {\n      const args = [this.value] // `this` will be the context of a Chain instance\n      for (let i = 0; i < arguments.length; i++) {\n        args[i + 1] = arguments[i]\n      }\n\n      return new Chain(fn.apply(fn, args))\n    }\n  }\n\n  /**\n   * Create a proxy for a single method, or an object with multiple methods.\n   * Example usage:\n   *\n   *   Chain.createProxy('add', function add (x, y) {...})\n   *   Chain.createProxy({\n   *     add:      function add (x, y) {...},\n   *     subtract: function subtract (x, y) {...}\n   *   }\n   *\n   * @param {string | Object} arg0   A name (string), or an object with\n   *                                 functions\n   * @param {*} [arg1]               A function, when arg0 is a name\n   */\n  Chain.createProxy = function (arg0, arg1) {\n    if (typeof arg0 === 'string') {\n      // createProxy(name, value)\n      createProxy(arg0, arg1)\n    } else {\n      // createProxy(values)\n      for (const name in arg0) {\n        if (hasOwnProperty(arg0, name) && excludedNames[name] === undefined) {\n          createLazyProxy(name, () => arg0[name])\n        }\n      }\n    }\n  }\n\n  const excludedNames = {\n    expression: true,\n    docs: true,\n    type: true,\n    classes: true,\n    json: true,\n    error: true,\n    isChain: true // conflicts with the property isChain of a Chain instance\n  }\n\n  // create proxy for everything that is in math.js\n  Chain.createProxy(math)\n\n  // register on the import event, automatically add a proxy for every imported function.\n  if (on) {\n    on('import', function (name, resolver, path) {\n      if (!path) {\n        // an imported function (not a data type or something special)\n        createLazyProxy(name, resolver)\n      }\n    })\n  }\n\n  return Chain\n}, { isClass: true })\n","export const eDocs = {\n  name: 'e',\n  category: 'Constants',\n  syntax: [\n    'e'\n  ],\n  description: 'Euler\\'s number, the base of the natural logarithm. Approximately equal to 2.71828',\n  examples: [\n    'e',\n    'e ^ 2',\n    'exp(2)',\n    'log(e)'\n  ],\n  seealso: ['exp']\n}\n","export const piDocs = {\n  name: 'pi',\n  category: 'Constants',\n  syntax: [\n    'pi'\n  ],\n  description: 'The number pi is a mathematical constant that is the ratio of a circle\\'s circumference to its diameter, and is approximately equal to 3.14159',\n  examples: [\n    'pi',\n    'sin(pi/2)'\n  ],\n  seealso: ['tau']\n}\n","import { eDocs } from './constants/e.js'\nimport { falseDocs } from './constants/false.js'\nimport { iDocs } from './constants/i.js'\nimport { InfinityDocs } from './constants/Infinity.js'\nimport { LN10Docs } from './constants/LN10.js'\nimport { LN2Docs } from './constants/LN2.js'\nimport { LOG10EDocs } from './constants/LOG10E.js'\nimport { LOG2EDocs } from './constants/LOG2E.js'\nimport { NaNDocs } from './constants/NaN.js'\nimport { nullDocs } from './constants/null.js'\nimport { phiDocs } from './constants/phi.js'\nimport { piDocs } from './constants/pi.js'\nimport { SQRT12Docs } from './constants/SQRT1_2.js'\nimport { SQRT2Docs } from './constants/SQRT2.js'\nimport { tauDocs } from './constants/tau.js'\nimport { trueDocs } from './constants/true.js'\nimport { versionDocs } from './constants/version.js'\nimport { bignumberDocs } from './construction/bignumber.js'\nimport { booleanDocs } from './construction/boolean.js'\nimport { complexDocs } from './construction/complex.js'\nimport { createUnitDocs } from './construction/createUnit.js'\nimport { fractionDocs } from './construction/fraction.js'\nimport { indexDocs } from './construction/index.js'\nimport { matrixDocs } from './construction/matrix.js'\nimport { numberDocs } from './construction/number.js'\nimport { sparseDocs } from './construction/sparse.js'\nimport { splitUnitDocs } from './construction/splitUnit.js'\nimport { stringDocs } from './construction/string.js'\nimport { unitDocs } from './construction/unit.js'\nimport { configDocs } from './core/config.js'\nimport { importDocs } from './core/import.js'\nimport { typedDocs } from './core/typed.js'\nimport { derivativeDocs } from './function/algebra/derivative.js'\nimport { leafCountDocs } from './function/algebra/leafCount.js'\nimport { lsolveDocs } from './function/algebra/lsolve.js'\nimport { lsolveAllDocs } from './function/algebra/lsolveAll.js'\nimport { lupDocs } from './function/algebra/lup.js'\nimport { lusolveDocs } from './function/algebra/lusolve.js'\nimport { qrDocs } from './function/algebra/qr.js'\nimport { rationalizeDocs } from './function/algebra/rationalize.js'\nimport { resolveDocs } from './function/algebra/resolve.js'\nimport { simplifyDocs } from './function/algebra/simplify.js'\nimport { simplifyCoreDocs } from './function/algebra/simplifyCore.js'\nimport { sluDocs } from './function/algebra/slu.js'\nimport { symbolicEqualDocs } from './function/algebra/symbolicEqual.js'\nimport { usolveDocs } from './function/algebra/usolve.js'\nimport { usolveAllDocs } from './function/algebra/usolveAll.js'\nimport { absDocs } from './function/arithmetic/abs.js'\nimport { addDocs } from './function/arithmetic/add.js'\nimport { cbrtDocs } from './function/arithmetic/cbrt.js'\nimport { ceilDocs } from './function/arithmetic/ceil.js'\nimport { cubeDocs } from './function/arithmetic/cube.js'\nimport { divideDocs } from './function/arithmetic/divide.js'\nimport { dotDivideDocs } from './function/arithmetic/dotDivide.js'\nimport { dotMultiplyDocs } from './function/arithmetic/dotMultiply.js'\nimport { dotPowDocs } from './function/arithmetic/dotPow.js'\nimport { expDocs } from './function/arithmetic/exp.js'\nimport { expmDocs } from './function/arithmetic/expm.js'\nimport { expm1Docs } from './function/arithmetic/expm1.js'\nimport { fixDocs } from './function/arithmetic/fix.js'\nimport { floorDocs } from './function/arithmetic/floor.js'\nimport { gcdDocs } from './function/arithmetic/gcd.js'\nimport { hypotDocs } from './function/arithmetic/hypot.js'\nimport { invmodDocs } from './function/arithmetic/invmod.js'\nimport { lcmDocs } from './function/arithmetic/lcm.js'\nimport { logDocs } from './function/arithmetic/log.js'\nimport { log10Docs } from './function/arithmetic/log10.js'\nimport { log1pDocs } from './function/arithmetic/log1p.js'\nimport { log2Docs } from './function/arithmetic/log2.js'\nimport { modDocs } from './function/arithmetic/mod.js'\nimport { multiplyDocs } from './function/arithmetic/multiply.js'\nimport { normDocs } from './function/arithmetic/norm.js'\nimport { nthRootDocs } from './function/arithmetic/nthRoot.js'\nimport { nthRootsDocs } from './function/arithmetic/nthRoots.js'\nimport { powDocs } from './function/arithmetic/pow.js'\nimport { roundDocs } from './function/arithmetic/round.js'\nimport { signDocs } from './function/arithmetic/sign.js'\nimport { sqrtDocs } from './function/arithmetic/sqrt.js'\nimport { sqrtmDocs } from './function/arithmetic/sqrtm.js'\nimport { squareDocs } from './function/arithmetic/square.js'\nimport { subtractDocs } from './function/arithmetic/subtract.js'\nimport { unaryMinusDocs } from './function/arithmetic/unaryMinus.js'\nimport { unaryPlusDocs } from './function/arithmetic/unaryPlus.js'\nimport { xgcdDocs } from './function/arithmetic/xgcd.js'\nimport { bitAndDocs } from './function/bitwise/bitAnd.js'\nimport { bitNotDocs } from './function/bitwise/bitNot.js'\nimport { bitOrDocs } from './function/bitwise/bitOr.js'\nimport { bitXorDocs } from './function/bitwise/bitXor.js'\nimport { leftShiftDocs } from './function/bitwise/leftShift.js'\nimport { rightArithShiftDocs } from './function/bitwise/rightArithShift.js'\nimport { rightLogShiftDocs } from './function/bitwise/rightLogShift.js'\nimport { bellNumbersDocs } from './function/combinatorics/bellNumbers.js'\nimport { catalanDocs } from './function/combinatorics/catalan.js'\nimport { compositionDocs } from './function/combinatorics/composition.js'\nimport { stirlingS2Docs } from './function/combinatorics/stirlingS2.js'\nimport { argDocs } from './function/complex/arg.js'\nimport { conjDocs } from './function/complex/conj.js'\nimport { imDocs } from './function/complex/im.js'\nimport { reDocs } from './function/complex/re.js'\nimport { evaluateDocs } from './function/expression/evaluate.js'\nimport { helpDocs } from './function/expression/help.js'\nimport { distanceDocs } from './function/geometry/distance.js'\nimport { intersectDocs } from './function/geometry/intersect.js'\nimport { andDocs } from './function/logical/and.js'\nimport { notDocs } from './function/logical/not.js'\nimport { orDocs } from './function/logical/or.js'\nimport { xorDocs } from './function/logical/xor.js'\nimport { columnDocs } from './function/matrix/column.js'\nimport { concatDocs } from './function/matrix/concat.js'\nimport { countDocs } from './function/matrix/count.js'\nimport { crossDocs } from './function/matrix/cross.js'\nimport { ctransposeDocs } from './function/matrix/ctranspose.js'\nimport { detDocs } from './function/matrix/det.js'\nimport { diagDocs } from './function/matrix/diag.js'\nimport { diffDocs } from './function/matrix/diff.js'\nimport { dotDocs } from './function/matrix/dot.js'\nimport { eigsDocs } from './function/matrix/eigs.js'\nimport { filterDocs } from './function/matrix/filter.js'\nimport { flattenDocs } from './function/matrix/flatten.js'\nimport { forEachDocs } from './function/matrix/forEach.js'\nimport { getMatrixDataTypeDocs } from './function/matrix/getMatrixDataType.js'\nimport { identityDocs } from './function/matrix/identity.js'\nimport { invDocs } from './function/matrix/inv.js'\nimport { kronDocs } from './function/matrix/kron.js'\nimport { mapDocs } from './function/matrix/map.js'\nimport { matrixFromColumnsDocs } from './function/matrix/matrixFromColumns.js'\nimport { matrixFromFunctionDocs } from './function/matrix/matrixFromFunction.js'\nimport { matrixFromRowsDocs } from './function/matrix/matrixFromRows.js'\nimport { onesDocs } from './function/matrix/ones.js'\nimport { partitionSelectDocs } from './function/matrix/partitionSelect.js'\nimport { rangeDocs } from './function/matrix/range.js'\nimport { reshapeDocs } from './function/matrix/reshape.js'\nimport { resizeDocs } from './function/matrix/resize.js'\nimport { rotateDocs } from './function/matrix/rotate.js'\nimport { rotationMatrixDocs } from './function/matrix/rotationMatrix.js'\nimport { rowDocs } from './function/matrix/row.js'\nimport { sizeDocs } from './function/matrix/size.js'\nimport { sortDocs } from './function/matrix/sort.js'\nimport { squeezeDocs } from './function/matrix/squeeze.js'\nimport { subsetDocs } from './function/matrix/subset.js'\nimport { traceDocs } from './function/matrix/trace.js'\nimport { transposeDocs } from './function/matrix/transpose.js'\nimport { zerosDocs } from './function/matrix/zeros.js'\nimport { combinationsDocs } from './function/probability/combinations.js'\nimport { combinationsWithRepDocs } from './function/probability/combinationsWithRep.js'\nimport { factorialDocs } from './function/probability/factorial.js'\nimport { gammaDocs } from './function/probability/gamma.js'\nimport { kldivergenceDocs } from './function/probability/kldivergence.js'\nimport { multinomialDocs } from './function/probability/multinomial.js'\nimport { permutationsDocs } from './function/probability/permutations.js'\nimport { pickRandomDocs } from './function/probability/pickRandom.js'\nimport { randomDocs } from './function/probability/random.js'\nimport { randomIntDocs } from './function/probability/randomInt.js'\nimport { compareDocs } from './function/relational/compare.js'\nimport { compareNaturalDocs } from './function/relational/compareNatural.js'\nimport { compareTextDocs } from './function/relational/compareText.js'\nimport { deepEqualDocs } from './function/relational/deepEqual.js'\nimport { equalDocs } from './function/relational/equal.js'\nimport { equalTextDocs } from './function/relational/equalText.js'\nimport { largerDocs } from './function/relational/larger.js'\nimport { largerEqDocs } from './function/relational/largerEq.js'\nimport { smallerDocs } from './function/relational/smaller.js'\nimport { smallerEqDocs } from './function/relational/smallerEq.js'\nimport { unequalDocs } from './function/relational/unequal.js'\nimport { setCartesianDocs } from './function/set/setCartesian.js'\nimport { setDifferenceDocs } from './function/set/setDifference.js'\nimport { setDistinctDocs } from './function/set/setDistinct.js'\nimport { setIntersectDocs } from './function/set/setIntersect.js'\nimport { setIsSubsetDocs } from './function/set/setIsSubset.js'\nimport { setMultiplicityDocs } from './function/set/setMultiplicity.js'\nimport { setPowersetDocs } from './function/set/setPowerset.js'\nimport { setSizeDocs } from './function/set/setSize.js'\nimport { setSymDifferenceDocs } from './function/set/setSymDifference.js'\nimport { setUnionDocs } from './function/set/setUnion.js'\nimport { erfDocs } from './function/special/erf.js'\nimport { madDocs } from './function/statistics/mad.js'\nimport { maxDocs } from './function/statistics/max.js'\nimport { meanDocs } from './function/statistics/mean.js'\nimport { medianDocs } from './function/statistics/median.js'\nimport { minDocs } from './function/statistics/min.js'\nimport { modeDocs } from './function/statistics/mode.js'\nimport { prodDocs } from './function/statistics/prod.js'\nimport { quantileSeqDocs } from './function/statistics/quantileSeq.js'\nimport { stdDocs } from './function/statistics/std.js'\nimport { cumSumDocs } from './function/statistics/cumsum.js'\nimport { sumDocs } from './function/statistics/sum.js'\nimport { varianceDocs } from './function/statistics/variance.js'\nimport { acosDocs } from './function/trigonometry/acos.js'\nimport { acoshDocs } from './function/trigonometry/acosh.js'\nimport { acotDocs } from './function/trigonometry/acot.js'\nimport { acothDocs } from './function/trigonometry/acoth.js'\nimport { acscDocs } from './function/trigonometry/acsc.js'\nimport { acschDocs } from './function/trigonometry/acsch.js'\nimport { asecDocs } from './function/trigonometry/asec.js'\nimport { asechDocs } from './function/trigonometry/asech.js'\nimport { asinDocs } from './function/trigonometry/asin.js'\nimport { asinhDocs } from './function/trigonometry/asinh.js'\nimport { atanDocs } from './function/trigonometry/atan.js'\nimport { atan2Docs } from './function/trigonometry/atan2.js'\nimport { atanhDocs } from './function/trigonometry/atanh.js'\nimport { cosDocs } from './function/trigonometry/cos.js'\nimport { coshDocs } from './function/trigonometry/cosh.js'\nimport { cotDocs } from './function/trigonometry/cot.js'\nimport { cothDocs } from './function/trigonometry/coth.js'\nimport { cscDocs } from './function/trigonometry/csc.js'\nimport { cschDocs } from './function/trigonometry/csch.js'\nimport { secDocs } from './function/trigonometry/sec.js'\nimport { sechDocs } from './function/trigonometry/sech.js'\nimport { sinDocs } from './function/trigonometry/sin.js'\nimport { sinhDocs } from './function/trigonometry/sinh.js'\nimport { tanDocs } from './function/trigonometry/tan.js'\nimport { tanhDocs } from './function/trigonometry/tanh.js'\nimport { toDocs } from './function/units/to.js'\nimport { binDocs } from './function/utils/bin.js'\nimport { cloneDocs } from './function/utils/clone.js'\nimport { formatDocs } from './function/utils/format.js'\nimport { hasNumericValueDocs } from './function/utils/hasNumericValue.js'\nimport { hexDocs } from './function/utils/hex.js'\nimport { isIntegerDocs } from './function/utils/isInteger.js'\nimport { isNaNDocs } from './function/utils/isNaN.js'\nimport { isNegativeDocs } from './function/utils/isNegative.js'\nimport { isNumericDocs } from './function/utils/isNumeric.js'\nimport { isPositiveDocs } from './function/utils/isPositive.js'\nimport { isPrimeDocs } from './function/utils/isPrime.js'\nimport { isZeroDocs } from './function/utils/isZero.js'\nimport { numericDocs } from './function/utils/numeric.js'\nimport { octDocs } from './function/utils/oct.js'\nimport { printDocs } from './function/utils/print.js'\nimport { typeOfDocs } from './function/utils/typeOf.js'\n\nexport const embeddedDocs = {\n\n  // construction functions\n  bignumber: bignumberDocs,\n  boolean: booleanDocs,\n  complex: complexDocs,\n  createUnit: createUnitDocs,\n  fraction: fractionDocs,\n  index: indexDocs,\n  matrix: matrixDocs,\n  number: numberDocs,\n  sparse: sparseDocs,\n  splitUnit: splitUnitDocs,\n  string: stringDocs,\n  unit: unitDocs,\n\n  // constants\n  e: eDocs,\n  E: eDocs,\n  false: falseDocs,\n  i: iDocs,\n  Infinity: InfinityDocs,\n  LN2: LN2Docs,\n  LN10: LN10Docs,\n  LOG2E: LOG2EDocs,\n  LOG10E: LOG10EDocs,\n  NaN: NaNDocs,\n  null: nullDocs,\n  pi: piDocs,\n  PI: piDocs,\n  phi: phiDocs,\n  SQRT1_2: SQRT12Docs,\n  SQRT2: SQRT2Docs,\n  tau: tauDocs,\n  true: trueDocs,\n  version: versionDocs,\n\n  // physical constants\n  // TODO: more detailed docs for physical constants\n  speedOfLight: { description: 'Speed of light in vacuum', examples: ['speedOfLight'] },\n  gravitationConstant: { description: 'Newtonian constant of gravitation', examples: ['gravitationConstant'] },\n  planckConstant: { description: 'Planck constant', examples: ['planckConstant'] },\n  reducedPlanckConstant: { description: 'Reduced Planck constant', examples: ['reducedPlanckConstant'] },\n\n  magneticConstant: { description: 'Magnetic constant (vacuum permeability)', examples: ['magneticConstant'] },\n  electricConstant: { description: 'Electric constant (vacuum permeability)', examples: ['electricConstant'] },\n  vacuumImpedance: { description: 'Characteristic impedance of vacuum', examples: ['vacuumImpedance'] },\n  coulomb: { description: 'Coulomb\\'s constant', examples: ['coulomb'] },\n  elementaryCharge: { description: 'Elementary charge', examples: ['elementaryCharge'] },\n  bohrMagneton: { description: 'Borh magneton', examples: ['bohrMagneton'] },\n  conductanceQuantum: { description: 'Conductance quantum', examples: ['conductanceQuantum'] },\n  inverseConductanceQuantum: { description: 'Inverse conductance quantum', examples: ['inverseConductanceQuantum'] },\n  // josephson: {description: 'Josephson constant', examples: ['josephson']},\n  magneticFluxQuantum: { description: 'Magnetic flux quantum', examples: ['magneticFluxQuantum'] },\n  nuclearMagneton: { description: 'Nuclear magneton', examples: ['nuclearMagneton'] },\n  klitzing: { description: 'Von Klitzing constant', examples: ['klitzing'] },\n\n  bohrRadius: { description: 'Borh radius', examples: ['bohrRadius'] },\n  classicalElectronRadius: { description: 'Classical electron radius', examples: ['classicalElectronRadius'] },\n  electronMass: { description: 'Electron mass', examples: ['electronMass'] },\n  fermiCoupling: { description: 'Fermi coupling constant', examples: ['fermiCoupling'] },\n  fineStructure: { description: 'Fine-structure constant', examples: ['fineStructure'] },\n  hartreeEnergy: { description: 'Hartree energy', examples: ['hartreeEnergy'] },\n  protonMass: { description: 'Proton mass', examples: ['protonMass'] },\n  deuteronMass: { description: 'Deuteron Mass', examples: ['deuteronMass'] },\n  neutronMass: { description: 'Neutron mass', examples: ['neutronMass'] },\n  quantumOfCirculation: { description: 'Quantum of circulation', examples: ['quantumOfCirculation'] },\n  rydberg: { description: 'Rydberg constant', examples: ['rydberg'] },\n  thomsonCrossSection: { description: 'Thomson cross section', examples: ['thomsonCrossSection'] },\n  weakMixingAngle: { description: 'Weak mixing angle', examples: ['weakMixingAngle'] },\n  efimovFactor: { description: 'Efimov factor', examples: ['efimovFactor'] },\n\n  atomicMass: { description: 'Atomic mass constant', examples: ['atomicMass'] },\n  avogadro: { description: 'Avogadro\\'s number', examples: ['avogadro'] },\n  boltzmann: { description: 'Boltzmann constant', examples: ['boltzmann'] },\n  faraday: { description: 'Faraday constant', examples: ['faraday'] },\n  firstRadiation: { description: 'First radiation constant', examples: ['firstRadiation'] },\n  loschmidt: { description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa', examples: ['loschmidt'] },\n  gasConstant: { description: 'Gas constant', examples: ['gasConstant'] },\n  molarPlanckConstant: { description: 'Molar Planck constant', examples: ['molarPlanckConstant'] },\n  molarVolume: { description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa', examples: ['molarVolume'] },\n  sackurTetrode: { description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa', examples: ['sackurTetrode'] },\n  secondRadiation: { description: 'Second radiation constant', examples: ['secondRadiation'] },\n  stefanBoltzmann: { description: 'Stefan-Boltzmann constant', examples: ['stefanBoltzmann'] },\n  wienDisplacement: { description: 'Wien displacement law constant', examples: ['wienDisplacement'] },\n  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},\n\n  molarMass: { description: 'Molar mass constant', examples: ['molarMass'] },\n  molarMassC12: { description: 'Molar mass constant of carbon-12', examples: ['molarMassC12'] },\n  gravity: { description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)', examples: ['gravity'] },\n\n  planckLength: { description: 'Planck length', examples: ['planckLength'] },\n  planckMass: { description: 'Planck mass', examples: ['planckMass'] },\n  planckTime: { description: 'Planck time', examples: ['planckTime'] },\n  planckCharge: { description: 'Planck charge', examples: ['planckCharge'] },\n  planckTemperature: { description: 'Planck temperature', examples: ['planckTemperature'] },\n\n  // functions - algebra\n  derivative: derivativeDocs,\n  lsolve: lsolveDocs,\n  lsolveAll: lsolveAllDocs,\n  lup: lupDocs,\n  lusolve: lusolveDocs,\n  leafCount: leafCountDocs,\n  resolve: resolveDocs,\n  simplify: simplifyDocs,\n  simplifyCore: simplifyCoreDocs,\n  symbolicEqual: symbolicEqualDocs,\n  rationalize: rationalizeDocs,\n  slu: sluDocs,\n  usolve: usolveDocs,\n  usolveAll: usolveAllDocs,\n  qr: qrDocs,\n\n  // functions - arithmetic\n  abs: absDocs,\n  add: addDocs,\n  cbrt: cbrtDocs,\n  ceil: ceilDocs,\n  cube: cubeDocs,\n  divide: divideDocs,\n  dotDivide: dotDivideDocs,\n  dotMultiply: dotMultiplyDocs,\n  dotPow: dotPowDocs,\n  exp: expDocs,\n  expm: expmDocs,\n  expm1: expm1Docs,\n  fix: fixDocs,\n  floor: floorDocs,\n  gcd: gcdDocs,\n  hypot: hypotDocs,\n  lcm: lcmDocs,\n  log: logDocs,\n  log2: log2Docs,\n  log1p: log1pDocs,\n  log10: log10Docs,\n  mod: modDocs,\n  multiply: multiplyDocs,\n  norm: normDocs,\n  nthRoot: nthRootDocs,\n  nthRoots: nthRootsDocs,\n  pow: powDocs,\n  round: roundDocs,\n  sign: signDocs,\n  sqrt: sqrtDocs,\n  sqrtm: sqrtmDocs,\n  square: squareDocs,\n  subtract: subtractDocs,\n  unaryMinus: unaryMinusDocs,\n  unaryPlus: unaryPlusDocs,\n  xgcd: xgcdDocs,\n  invmod: invmodDocs,\n\n  // functions - bitwise\n  bitAnd: bitAndDocs,\n  bitNot: bitNotDocs,\n  bitOr: bitOrDocs,\n  bitXor: bitXorDocs,\n  leftShift: leftShiftDocs,\n  rightArithShift: rightArithShiftDocs,\n  rightLogShift: rightLogShiftDocs,\n\n  // functions - combinatorics\n  bellNumbers: bellNumbersDocs,\n  catalan: catalanDocs,\n  composition: compositionDocs,\n  stirlingS2: stirlingS2Docs,\n\n  // functions - core\n  config: configDocs,\n  import: importDocs,\n  typed: typedDocs,\n\n  // functions - complex\n  arg: argDocs,\n  conj: conjDocs,\n  re: reDocs,\n  im: imDocs,\n\n  // functions - expression\n  evaluate: evaluateDocs,\n  help: helpDocs,\n\n  // functions - geometry\n  distance: distanceDocs,\n  intersect: intersectDocs,\n\n  // functions - logical\n  and: andDocs,\n  not: notDocs,\n  or: orDocs,\n  xor: xorDocs,\n\n  // functions - matrix\n  concat: concatDocs,\n  count: countDocs,\n  cross: crossDocs,\n  column: columnDocs,\n  ctranspose: ctransposeDocs,\n  det: detDocs,\n  diag: diagDocs,\n  diff: diffDocs,\n  dot: dotDocs,\n  getMatrixDataType: getMatrixDataTypeDocs,\n  identity: identityDocs,\n  filter: filterDocs,\n  flatten: flattenDocs,\n  forEach: forEachDocs,\n  inv: invDocs,\n  eigs: eigsDocs,\n  kron: kronDocs,\n  matrixFromFunction: matrixFromFunctionDocs,\n  matrixFromRows: matrixFromRowsDocs,\n  matrixFromColumns: matrixFromColumnsDocs,\n  map: mapDocs,\n  ones: onesDocs,\n  partitionSelect: partitionSelectDocs,\n  range: rangeDocs,\n  resize: resizeDocs,\n  reshape: reshapeDocs,\n  rotate: rotateDocs,\n  rotationMatrix: rotationMatrixDocs,\n  row: rowDocs,\n  size: sizeDocs,\n  sort: sortDocs,\n  squeeze: squeezeDocs,\n  subset: subsetDocs,\n  trace: traceDocs,\n  transpose: transposeDocs,\n  zeros: zerosDocs,\n\n  // functions - probability\n  combinations: combinationsDocs,\n  combinationsWithRep: combinationsWithRepDocs,\n  // distribution: distributionDocs,\n  factorial: factorialDocs,\n  gamma: gammaDocs,\n  kldivergence: kldivergenceDocs,\n  multinomial: multinomialDocs,\n  permutations: permutationsDocs,\n  pickRandom: pickRandomDocs,\n  random: randomDocs,\n  randomInt: randomIntDocs,\n\n  // functions - relational\n  compare: compareDocs,\n  compareNatural: compareNaturalDocs,\n  compareText: compareTextDocs,\n  deepEqual: deepEqualDocs,\n  equal: equalDocs,\n  equalText: equalTextDocs,\n  larger: largerDocs,\n  largerEq: largerEqDocs,\n  smaller: smallerDocs,\n  smallerEq: smallerEqDocs,\n  unequal: unequalDocs,\n\n  // functions - set\n  setCartesian: setCartesianDocs,\n  setDifference: setDifferenceDocs,\n  setDistinct: setDistinctDocs,\n  setIntersect: setIntersectDocs,\n  setIsSubset: setIsSubsetDocs,\n  setMultiplicity: setMultiplicityDocs,\n  setPowerset: setPowersetDocs,\n  setSize: setSizeDocs,\n  setSymDifference: setSymDifferenceDocs,\n  setUnion: setUnionDocs,\n\n  // functions - special\n  erf: erfDocs,\n\n  // functions - statistics\n  cumsum: cumSumDocs,\n  mad: madDocs,\n  max: maxDocs,\n  mean: meanDocs,\n  median: medianDocs,\n  min: minDocs,\n  mode: modeDocs,\n  prod: prodDocs,\n  quantileSeq: quantileSeqDocs,\n  std: stdDocs,\n  sum: sumDocs,\n  variance: varianceDocs,\n\n  // functions - trigonometry\n  acos: acosDocs,\n  acosh: acoshDocs,\n  acot: acotDocs,\n  acoth: acothDocs,\n  acsc: acscDocs,\n  acsch: acschDocs,\n  asec: asecDocs,\n  asech: asechDocs,\n  asin: asinDocs,\n  asinh: asinhDocs,\n  atan: atanDocs,\n  atanh: atanhDocs,\n  atan2: atan2Docs,\n  cos: cosDocs,\n  cosh: coshDocs,\n  cot: cotDocs,\n  coth: cothDocs,\n  csc: cscDocs,\n  csch: cschDocs,\n  sec: secDocs,\n  sech: sechDocs,\n  sin: sinDocs,\n  sinh: sinhDocs,\n  tan: tanDocs,\n  tanh: tanhDocs,\n\n  // functions - units\n  to: toDocs,\n\n  // functions - utils\n  clone: cloneDocs,\n  format: formatDocs,\n  bin: binDocs,\n  oct: octDocs,\n  hex: hexDocs,\n  isNaN: isNaNDocs,\n  isInteger: isIntegerDocs,\n  isNegative: isNegativeDocs,\n  isNumeric: isNumericDocs,\n  hasNumericValue: hasNumericValueDocs,\n  isPositive: isPositiveDocs,\n  isPrime: isPrimeDocs,\n  isZero: isZeroDocs,\n  print: printDocs,\n  typeOf: typeOfDocs,\n  numeric: numericDocs\n}\n","export const bignumberDocs = {\n  name: 'bignumber',\n  category: 'Construction',\n  syntax: [\n    'bignumber(x)'\n  ],\n  description:\n      'Create a big number from a number or string.',\n  examples: [\n    '0.1 + 0.2',\n    'bignumber(0.1) + bignumber(0.2)',\n    'bignumber(\"7.2\")',\n    'bignumber(\"7.2e500\")',\n    'bignumber([0.1, 0.2, 0.3])'\n  ],\n  seealso: [\n    'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit'\n  ]\n}\n","export const booleanDocs = {\n  name: 'boolean',\n  category: 'Construction',\n  syntax: [\n    'x',\n    'boolean(x)'\n  ],\n  description:\n      'Convert a string or number into a boolean.',\n  examples: [\n    'boolean(0)',\n    'boolean(1)',\n    'boolean(3)',\n    'boolean(\"true\")',\n    'boolean(\"false\")',\n    'boolean([1, 0, 1, 1])'\n  ],\n  seealso: [\n    'bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit'\n  ]\n}\n","export const complexDocs = {\n  name: 'complex',\n  category: 'Construction',\n  syntax: [\n    'complex()',\n    'complex(re, im)',\n    'complex(string)'\n  ],\n  description:\n      'Create a complex number.',\n  examples: [\n    'complex()',\n    'complex(2, 3)',\n    'complex(\"7 - 2i\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit'\n  ]\n}\n","export const createUnitDocs = {\n  name: 'createUnit',\n  category: 'Construction',\n  syntax: [\n    'createUnit(definitions)',\n    'createUnit(name, definition)'\n  ],\n  description:\n      'Create a user-defined unit and register it with the Unit type.',\n  examples: [\n    'createUnit(\"foo\")',\n    'createUnit(\"knot\", {definition: \"0.514444444 m/s\", aliases: [\"knots\", \"kt\", \"kts\"]})',\n    'createUnit(\"mph\", \"1 mile/hour\")'\n  ],\n  seealso: [\n    'unit', 'splitUnit'\n  ]\n}\n","export const fractionDocs = {\n  name: 'fraction',\n  category: 'Construction',\n  syntax: [\n    'fraction(num)',\n    'fraction(matrix)',\n    'fraction(num,den)',\n    'fraction({n: num, d: den})'\n  ],\n  description:\n    'Create a fraction from a number or from integer numerator and denominator.',\n  examples: [\n    'fraction(0.125)',\n    'fraction(1, 3) + fraction(2, 5)',\n    'fraction({n: 333, d: 53})',\n    'fraction([sqrt(9), sqrt(10), sqrt(11)])'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit'\n  ]\n}\n","export const indexDocs = {\n  name: 'index',\n  category: 'Construction',\n  syntax: [\n    '[start]',\n    '[start:end]',\n    '[start:step:end]',\n    '[start1, start 2, ...]',\n    '[start1:end1, start2:end2, ...]',\n    '[start1:step1:end1, start2:step2:end2, ...]'\n  ],\n  description:\n      'Create an index to get or replace a subset of a matrix',\n  examples: [\n    '[]',\n    '[1, 2, 3]',\n    'A = [1, 2, 3; 4, 5, 6]',\n    'A[1, :]',\n    'A[1, 2] = 50',\n    'A[0:2, 0:2] = ones(2, 2)'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit'\n  ]\n}\n","export const matrixDocs = {\n  name: 'matrix',\n  category: 'Construction',\n  syntax: [\n    '[]',\n    '[a1, b1, ...; a2, b2, ...]',\n    'matrix()',\n    'matrix(\"dense\")',\n    'matrix([...])'\n  ],\n  description:\n      'Create a matrix.',\n  examples: [\n    '[]',\n    '[1, 2, 3]',\n    '[1, 2, 3; 4, 5, 6]',\n    'matrix()',\n    'matrix([3, 4])',\n    'matrix([3, 4; 5, 6], \"sparse\")',\n    'matrix([3, 4; 5, 6], \"sparse\", \"number\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse'\n  ]\n}\n","export const numberDocs = {\n  name: 'number',\n  category: 'Construction',\n  syntax: [\n    'x',\n    'number(x)',\n    'number(unit, valuelessUnit)'\n  ],\n  description:\n      'Create a number or convert a string or boolean into a number.',\n  examples: [\n    '2',\n    '2e3',\n    '4.05',\n    'number(2)',\n    'number(\"7.2\")',\n    'number(true)',\n    'number([true, false, true, true])',\n    'number(unit(\"52cm\"), \"m\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit'\n  ]\n}\n","export const sparseDocs = {\n  name: 'sparse',\n  category: 'Construction',\n  syntax: [\n    'sparse()',\n    'sparse([a1, b1, ...; a1, b2, ...])',\n    'sparse([a1, b1, ...; a1, b2, ...], \"number\")'\n  ],\n  description:\n  'Create a sparse matrix.',\n  examples: [\n    'sparse()',\n    'sparse([3, 4; 5, 6])',\n    'sparse([3, 0; 5, 0], \"number\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix'\n  ]\n}\n","export const splitUnitDocs = {\n  name: 'splitUnit',\n  category: 'Construction',\n  syntax: [\n    'splitUnit(unit: Unit, parts: Unit[])'\n  ],\n  description:\n      'Split a unit in an array of units whose sum is equal to the original unit.',\n  examples: [\n    'splitUnit(1 m, [\"feet\", \"inch\"])'\n  ],\n  seealso: [\n    'unit', 'createUnit'\n  ]\n}\n","export const stringDocs = {\n  name: 'string',\n  category: 'Construction',\n  syntax: [\n    '\"text\"',\n    'string(x)'\n  ],\n  description:\n      'Create a string or convert a value to a string',\n  examples: [\n    '\"Hello World!\"',\n    'string(4.2)',\n    'string(3 + 2i)'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit'\n  ]\n}\n","export const unitDocs = {\n  name: 'unit',\n  category: 'Construction',\n  syntax: [\n    'value unit',\n    'unit(value, unit)',\n    'unit(string)'\n  ],\n  description:\n      'Create a unit.',\n  examples: [\n    '5.5 mm',\n    '3 inch',\n    'unit(7.1, \"kilogram\")',\n    'unit(\"23 deg\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string'\n  ]\n}\n","export const falseDocs = {\n  name: 'false',\n  category: 'Constants',\n  syntax: [\n    'false'\n  ],\n  description: 'Boolean value false',\n  examples: [\n    'false'\n  ],\n  seealso: ['true']\n}\n","export const iDocs = {\n  name: 'i',\n  category: 'Constants',\n  syntax: [\n    'i'\n  ],\n  description: 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',\n  examples: [\n    'i',\n    'i * i',\n    'sqrt(-1)'\n  ],\n  seealso: []\n}\n","export const InfinityDocs = {\n  name: 'Infinity',\n  category: 'Constants',\n  syntax: [\n    'Infinity'\n  ],\n  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',\n  examples: [\n    'Infinity',\n    '1 / 0'\n  ],\n  seealso: []\n}\n","export const LN2Docs = {\n  name: 'LN2',\n  category: 'Constants',\n  syntax: [\n    'LN2'\n  ],\n  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',\n  examples: [\n    'LN2',\n    'log(2)'\n  ],\n  seealso: []\n}\n","export const LN10Docs = {\n  name: 'LN10',\n  category: 'Constants',\n  syntax: [\n    'LN10'\n  ],\n  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',\n  examples: [\n    'LN10',\n    'log(10)'\n  ],\n  seealso: []\n}\n","export const LOG2EDocs = {\n  name: 'LOG2E',\n  category: 'Constants',\n  syntax: [\n    'LOG2E'\n  ],\n  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',\n  examples: [\n    'LOG2E',\n    'log(e, 2)'\n  ],\n  seealso: []\n}\n","export const LOG10EDocs = {\n  name: 'LOG10E',\n  category: 'Constants',\n  syntax: [\n    'LOG10E'\n  ],\n  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',\n  examples: [\n    'LOG10E',\n    'log(e, 10)'\n  ],\n  seealso: []\n}\n","export const NaNDocs = {\n  name: 'NaN',\n  category: 'Constants',\n  syntax: [\n    'NaN'\n  ],\n  description: 'Not a number',\n  examples: [\n    'NaN',\n    '0 / 0'\n  ],\n  seealso: []\n}\n","export const nullDocs = {\n  name: 'null',\n  category: 'Constants',\n  syntax: [\n    'null'\n  ],\n  description: 'Value null',\n  examples: [\n    'null'\n  ],\n  seealso: ['true', 'false']\n}\n","export const phiDocs = {\n  name: 'phi',\n  category: 'Constants',\n  syntax: [\n    'phi'\n  ],\n  description: 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',\n  examples: [\n    'phi'\n  ],\n  seealso: []\n}\n","export const SQRT12Docs = {\n  name: 'SQRT1_2',\n  category: 'Constants',\n  syntax: [\n    'SQRT1_2'\n  ],\n  description: 'Returns the square root of 1/2, approximately equal to 0.707',\n  examples: [\n    'SQRT1_2',\n    'sqrt(1/2)'\n  ],\n  seealso: []\n}\n","export const SQRT2Docs = {\n  name: 'SQRT2',\n  category: 'Constants',\n  syntax: [\n    'SQRT2'\n  ],\n  description: 'Returns the square root of 2, approximately equal to 1.414',\n  examples: [\n    'SQRT2',\n    'sqrt(2)'\n  ],\n  seealso: []\n}\n","export const tauDocs = {\n  name: 'tau',\n  category: 'Constants',\n  syntax: [\n    'tau'\n  ],\n  description: 'Tau is the ratio constant of a circle\\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',\n  examples: [\n    'tau',\n    '2 * pi'\n  ],\n  seealso: ['pi']\n}\n","export const trueDocs = {\n  name: 'true',\n  category: 'Constants',\n  syntax: [\n    'true'\n  ],\n  description: 'Boolean value true',\n  examples: [\n    'true'\n  ],\n  seealso: ['false']\n}\n","export const versionDocs = {\n  name: 'version',\n  category: 'Constants',\n  syntax: [\n    'version'\n  ],\n  description: 'A string with the version number of math.js',\n  examples: [\n    'version'\n  ],\n  seealso: []\n}\n","export const derivativeDocs = {\n  name: 'derivative',\n  category: 'Algebra',\n  syntax: [\n    'derivative(expr, variable)',\n    'derivative(expr, variable, {simplify: boolean})'\n  ],\n  description: 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',\n  examples: [\n    'derivative(\"2x^3\", \"x\")',\n    'derivative(\"2x^3\", \"x\", {simplify: false})',\n    'derivative(\"2x^2 + 3x + 4\", \"x\")',\n    'derivative(\"sin(2x)\", \"x\")',\n    'f = parse(\"x^2 + x\")',\n    'x = parse(\"x\")',\n    'df = derivative(f, x)',\n    'df.evaluate({x: 3})'\n  ],\n  seealso: [\n    'simplify', 'parse', 'evaluate'\n  ]\n}\n","export const lsolveDocs = {\n  name: 'lsolve',\n  category: 'Algebra',\n  syntax: [\n    'x=lsolve(L, b)'\n  ],\n  description:\n  'Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',\n  examples: [\n    'a = [-2, 3; 2, 1]',\n    'b = [11, 9]',\n    'x = lsolve(a, b)'\n  ],\n  seealso: [\n    'lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse'\n  ]\n}\n","export const lsolveAllDocs = {\n  name: 'lsolveAll',\n  category: 'Algebra',\n  syntax: [\n    'x=lsolveAll(L, b)'\n  ],\n  description:\n  'Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',\n  examples: [\n    'a = [-2, 3; 2, 1]',\n    'b = [11, 9]',\n    'x = lsolve(a, b)'\n  ],\n  seealso: [\n    'lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse'\n  ]\n}\n","export const lupDocs = {\n  name: 'lup',\n  category: 'Algebra',\n  syntax: [\n    'lup(m)'\n  ],\n  description:\n  'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',\n  examples: [\n    'lup([[2, 1], [1, 4]])',\n    'lup(matrix([[2, 1], [1, 4]]))',\n    'lup(sparse([[2, 1], [1, 4]]))'\n  ],\n  seealso: [\n    'lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr'\n  ]\n}\n","export const lusolveDocs = {\n  name: 'lusolve',\n  category: 'Algebra',\n  syntax: [\n    'x=lusolve(A, b)',\n    'x=lusolve(lu, b)'\n  ],\n  description: 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',\n  examples: [\n    'a = [-2, 3; 2, 1]',\n    'b = [11, 9]',\n    'x = lusolve(a, b)'\n  ],\n  seealso: [\n    'lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse'\n  ]\n}\n","export const leafCountDocs = {\n  name: 'leafCount',\n  category: 'Algebra',\n  syntax: ['leafCount(expr)'],\n  description: 'Computes the number of leaves in the parse tree of the given expression',\n  examples: [\n    'leafCount(\"e^(i*pi)-1\")',\n    'leafCount(parse(\"{a: 22/7, b: 10^(1/2)}\"))'\n  ],\n  seealso: ['simplify']\n}\n","export const resolveDocs = {\n  name: 'resolve',\n  category: 'Algebra',\n  syntax: [\n    'resolve(node, scope)'\n  ],\n  description: 'Recursively substitute variables in an expression tree.',\n  examples: [\n    'resolve(parse(\"1 + x\"), { x: 7 })',\n    'resolve(parse(\"size(text)\"), { text: \"Hello World\" })',\n    'resolve(parse(\"x + y\"), { x: parse(\"3z\") })',\n    'resolve(parse(\"3x\"), { x: parse(\"y+z\"), z: parse(\"w^y\") })'\n  ],\n  seealso: [\n    'simplify', 'evaluate'\n  ],\n  mayThrow: [\n    'ReferenceError'\n  ]\n}\n","export const simplifyDocs = {\n  name: 'simplify',\n  category: 'Algebra',\n  syntax: [\n    'simplify(expr)',\n    'simplify(expr, rules)'\n  ],\n  description: 'Simplify an expression tree.',\n  examples: [\n    'simplify(\"3 + 2 / 4\")',\n    'simplify(\"2x + x\")',\n    'f = parse(\"x * (x + 2 + x)\")',\n    'simplified = simplify(f)',\n    'simplified.evaluate({x: 2})'\n  ],\n  seealso: [\n    'simplifyCore', 'derivative', 'evaluate', 'parse', 'rationalize', 'resolve'\n  ]\n}\n","export const simplifyCoreDocs = {\n  name: 'simplifyCore',\n  category: 'Algebra',\n  syntax: [\n    'simplifyCore(node)'\n  ],\n  description: 'Perform simple one-pass simplifications on an expression tree.',\n  examples: [\n    'simplifyCore(parse(\"0*x\"))',\n    'simplifyCore(parse(\"(x+0)*2\"))'\n  ],\n  seealso: [\n    'simplify', 'evaluate'\n  ]\n}\n","export const symbolicEqualDocs = {\n  name: 'symbolicEqual',\n  category: 'Algebra',\n  syntax: [\n    'symbolicEqual(expr1, expr2)',\n    'symbolicEqual(expr1, expr2, options)'\n  ],\n  description: 'Returns true if the difference of the expressions simplifies to 0',\n  examples: [\n    'symbolicEqual(\"x*y\",\"y*x\")',\n    'symbolicEqual(\"abs(x^2)\", \"x^2\")',\n    'symbolicEqual(\"abs(x)\", \"x\", {context: {abs: {trivial: true}}})'\n  ],\n  seealso: ['simplify', 'evaluate']\n}\n","export const rationalizeDocs = {\n  name: 'rationalize',\n  category: 'Algebra',\n  syntax: [\n    'rationalize(expr)',\n    'rationalize(expr, scope)',\n    'rationalize(expr, scope, detailed)'\n  ],\n  description: 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',\n  examples: [\n    'rationalize(\"2x/y - y/(x+1)\")',\n    'rationalize(\"2x/y - y/(x+1)\", true)'\n  ],\n  seealso: [\n    'simplify'\n  ]\n}\n","export const sluDocs = {\n  name: 'slu',\n  category: 'Algebra',\n  syntax: [\n    'slu(A, order, threshold)'\n  ],\n  description: 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',\n  examples: [\n    'slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'\n  ],\n  seealso: [\n    'lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr'\n  ]\n}\n","export const usolveDocs = {\n  name: 'usolve',\n  category: 'Algebra',\n  syntax: [\n    'x=usolve(U, b)'\n  ],\n  description:\n  'Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',\n  examples: [\n    'x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'\n  ],\n  seealso: [\n    'usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse'\n  ]\n}\n","export const usolveAllDocs = {\n  name: 'usolveAll',\n  category: 'Algebra',\n  syntax: [\n    'x=usolve(U, b)'\n  ],\n  description:\n  'Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',\n  examples: [\n    'x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'\n  ],\n  seealso: [\n    'usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse'\n  ]\n}\n","export const qrDocs = {\n  name: 'qr',\n  category: 'Algebra',\n  syntax: [\n    'qr(A)'\n  ],\n  description:\n  'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',\n  examples: [\n    'qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'\n  ],\n  seealso: [\n    'lup', 'slu', 'matrix'\n  ]\n}\n","export const absDocs = {\n  name: 'abs',\n  category: 'Arithmetic',\n  syntax: [\n    'abs(x)'\n  ],\n  description: 'Compute the absolute value.',\n  examples: [\n    'abs(3.5)',\n    'abs(-4.2)'\n  ],\n  seealso: ['sign']\n}\n","export const addDocs = {\n  name: 'add',\n  category: 'Operators',\n  syntax: [\n    'x + y',\n    'add(x, y)'\n  ],\n  description: 'Add two values.',\n  examples: [\n    'a = 2.1 + 3.6',\n    'a - 3.6',\n    '3 + 2i',\n    '3 cm + 2 inch',\n    '\"2.3\" + \"4\"'\n  ],\n  seealso: [\n    'subtract'\n  ]\n}\n","export const cbrtDocs = {\n  name: 'cbrt',\n  category: 'Arithmetic',\n  syntax: [\n    'cbrt(x)',\n    'cbrt(x, allRoots)'\n  ],\n  description:\n      'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',\n  examples: [\n    'cbrt(64)',\n    'cube(4)',\n    'cbrt(-8)',\n    'cbrt(2 + 3i)',\n    'cbrt(8i)',\n    'cbrt(8i, true)',\n    'cbrt(27 m^3)'\n  ],\n  seealso: [\n    'square',\n    'sqrt',\n    'cube',\n    'multiply'\n  ]\n}\n","export const ceilDocs = {\n  name: 'ceil',\n  category: 'Arithmetic',\n  syntax: [\n    'ceil(x)'\n  ],\n  description:\n      'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',\n  examples: [\n    'ceil(3.2)',\n    'ceil(3.8)',\n    'ceil(-4.2)'\n  ],\n  seealso: ['floor', 'fix', 'round']\n}\n","export const cubeDocs = {\n  name: 'cube',\n  category: 'Arithmetic',\n  syntax: [\n    'cube(x)'\n  ],\n  description: 'Compute the cube of a value. The cube of x is x * x * x.',\n  examples: [\n    'cube(2)',\n    '2^3',\n    '2 * 2 * 2'\n  ],\n  seealso: [\n    'multiply',\n    'square',\n    'pow'\n  ]\n}\n","export const divideDocs = {\n  name: 'divide',\n  category: 'Operators',\n  syntax: [\n    'x / y',\n    'divide(x, y)'\n  ],\n  description: 'Divide two values.',\n  examples: [\n    'a = 2 / 3',\n    'a * 3',\n    '4.5 / 2',\n    '3 + 4 / 2',\n    '(3 + 4) / 2',\n    '18 km / 4.5'\n  ],\n  seealso: [\n    'multiply'\n  ]\n}\n","export const dotDivideDocs = {\n  name: 'dotDivide',\n  category: 'Operators',\n  syntax: [\n    'x ./ y',\n    'dotDivide(x, y)'\n  ],\n  description: 'Divide two values element wise.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'b = [2, 1, 1; 3, 2, 5]',\n    'a ./ b'\n  ],\n  seealso: [\n    'multiply',\n    'dotMultiply',\n    'divide'\n  ]\n}\n","export const dotMultiplyDocs = {\n  name: 'dotMultiply',\n  category: 'Operators',\n  syntax: [\n    'x .* y',\n    'dotMultiply(x, y)'\n  ],\n  description: 'Multiply two values element wise.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'b = [2, 1, 1; 3, 2, 5]',\n    'a .* b'\n  ],\n  seealso: [\n    'multiply',\n    'divide',\n    'dotDivide'\n  ]\n}\n","export const dotPowDocs = {\n  name: 'dotPow',\n  category: 'Operators',\n  syntax: [\n    'x .^ y',\n    'dotPow(x, y)'\n  ],\n  description:\n      'Calculates the power of x to y element wise.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'a .^ 2'\n  ],\n  seealso: [\n    'pow'\n  ]\n}\n","export const expDocs = {\n  name: 'exp',\n  category: 'Arithmetic',\n  syntax: [\n    'exp(x)'\n  ],\n  description: 'Calculate the exponent of a value.',\n  examples: [\n    'exp(1.3)',\n    'e ^ 1.3',\n    'log(exp(1.3))',\n    'x = 2.4',\n    '(exp(i*x) == cos(x) + i*sin(x))   # Euler\\'s formula'\n  ],\n  seealso: [\n    'expm',\n    'expm1',\n    'pow',\n    'log'\n  ]\n}\n","export const expmDocs = {\n  name: 'expm',\n  category: 'Arithmetic',\n  syntax: [\n    'exp(x)'\n  ],\n  description: 'Compute the matrix exponential, expm(A) = e^A. ' +\n    'The matrix must be square. ' +\n    'Not to be confused with exp(a), which performs element-wise exponentiation.',\n  examples: [\n    'expm([[0,2],[0,0]])'\n  ],\n  seealso: [\n    'exp'\n  ]\n}\n","export const expm1Docs = {\n  name: 'expm1',\n  category: 'Arithmetic',\n  syntax: [\n    'expm1(x)'\n  ],\n  description: 'Calculate the value of subtracting 1 from the exponential value.',\n  examples: [\n    'expm1(2)',\n    'pow(e, 2) - 1',\n    'log(expm1(2) + 1)'\n  ],\n  seealso: [\n    'exp',\n    'pow',\n    'log'\n  ]\n}\n","export const fixDocs = {\n  name: 'fix',\n  category: 'Arithmetic',\n  syntax: [\n    'fix(x)'\n  ],\n  description:\n      'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',\n  examples: [\n    'fix(3.2)',\n    'fix(3.8)',\n    'fix(-4.2)',\n    'fix(-4.8)'\n  ],\n  seealso: ['ceil', 'floor', 'round']\n}\n","export const floorDocs = {\n  name: 'floor',\n  category: 'Arithmetic',\n  syntax: [\n    'floor(x)'\n  ],\n  description:\n      'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',\n  examples: [\n    'floor(3.2)',\n    'floor(3.8)',\n    'floor(-4.2)'\n  ],\n  seealso: ['ceil', 'fix', 'round']\n}\n","export const gcdDocs = {\n  name: 'gcd',\n  category: 'Arithmetic',\n  syntax: [\n    'gcd(a, b)',\n    'gcd(a, b, c, ...)'\n  ],\n  description: 'Compute the greatest common divisor.',\n  examples: [\n    'gcd(8, 12)',\n    'gcd(-4, 6)',\n    'gcd(25, 15, -10)'\n  ],\n  seealso: ['lcm', 'xgcd']\n}\n","export const hypotDocs = {\n  name: 'hypot',\n  category: 'Arithmetic',\n  syntax: [\n    'hypot(a, b, c, ...)',\n    'hypot([a, b, c, ...])'\n  ],\n  description: 'Calculate the hypotenusa of a list with values. ',\n  examples: [\n    'hypot(3, 4)',\n    'sqrt(3^2 + 4^2)',\n    'hypot(-2)',\n    'hypot([3, 4, 5])'\n  ],\n  seealso: ['abs', 'norm']\n}\n","export const lcmDocs = {\n  name: 'lcm',\n  category: 'Arithmetic',\n  syntax: [\n    'lcm(x, y)'\n  ],\n  description: 'Compute the least common multiple.',\n  examples: [\n    'lcm(4, 6)',\n    'lcm(6, 21)',\n    'lcm(6, 21, 5)'\n  ],\n  seealso: ['gcd']\n}\n","export const logDocs = {\n  name: 'log',\n  category: 'Arithmetic',\n  syntax: [\n    'log(x)',\n    'log(x, base)'\n  ],\n  description: 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',\n  examples: [\n    'log(3.5)',\n    'a = log(2.4)',\n    'exp(a)',\n    '10 ^ 4',\n    'log(10000, 10)',\n    'log(10000) / log(10)',\n    'b = log(1024, 2)',\n    '2 ^ b'\n  ],\n  seealso: [\n    'exp',\n    'log1p',\n    'log2',\n    'log10'\n  ]\n}\n","export const log2Docs = {\n  name: 'log2',\n  category: 'Arithmetic',\n  syntax: [\n    'log2(x)'\n  ],\n  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',\n  examples: [\n    'log2(0.03125)',\n    'log2(16)',\n    'log2(16) / log2(2)',\n    'pow(2, 4)'\n  ],\n  seealso: [\n    'exp',\n    'log1p',\n    'log',\n    'log10'\n  ]\n}\n","export const log1pDocs = {\n  name: 'log1p',\n  category: 'Arithmetic',\n  syntax: [\n    'log1p(x)',\n    'log1p(x, base)'\n  ],\n  description: 'Calculate the logarithm of a `value+1`',\n  examples: [\n    'log1p(2.5)',\n    'exp(log1p(1.4))',\n    'pow(10, 4)',\n    'log1p(9999, 10)',\n    'log1p(9999) / log(10)'\n  ],\n  seealso: [\n    'exp',\n    'log',\n    'log2',\n    'log10'\n  ]\n}\n","export const log10Docs = {\n  name: 'log10',\n  category: 'Arithmetic',\n  syntax: [\n    'log10(x)'\n  ],\n  description: 'Compute the 10-base logarithm of a value.',\n  examples: [\n    'log10(0.00001)',\n    'log10(10000)',\n    '10 ^ 4',\n    'log(10000) / log(10)',\n    'log(10000, 10)'\n  ],\n  seealso: [\n    'exp',\n    'log'\n  ]\n}\n","export const modDocs = {\n  name: 'mod',\n  category: 'Operators',\n  syntax: [\n    'x % y',\n    'x mod y',\n    'mod(x, y)'\n  ],\n  description:\n      'Calculates the modulus, the remainder of an integer division.',\n  examples: [\n    '7 % 3',\n    '11 % 2',\n    '10 mod 4',\n    'isOdd(x) = x % 2',\n    'isOdd(2)',\n    'isOdd(3)'\n  ],\n  seealso: ['divide']\n}\n","export const multiplyDocs = {\n  name: 'multiply',\n  category: 'Operators',\n  syntax: [\n    'x * y',\n    'multiply(x, y)'\n  ],\n  description: 'multiply two values.',\n  examples: [\n    'a = 2.1 * 3.4',\n    'a / 3.4',\n    '2 * 3 + 4',\n    '2 * (3 + 4)',\n    '3 * 2.1 km'\n  ],\n  seealso: [\n    'divide'\n  ]\n}\n","export const normDocs = {\n  name: 'norm',\n  category: 'Arithmetic',\n  syntax: [\n    'norm(x)',\n    'norm(x, p)'\n  ],\n  description: 'Calculate the norm of a number, vector or matrix.',\n  examples: [\n    'abs(-3.5)',\n    'norm(-3.5)',\n    'norm(3 - 4i)',\n    'norm([1, 2, -3], Infinity)',\n    'norm([1, 2, -3], -Infinity)',\n    'norm([3, 4], 2)',\n    'norm([[1, 2], [3, 4]], 1)',\n    'norm([[1, 2], [3, 4]], \"inf\")',\n    'norm([[1, 2], [3, 4]], \"fro\")'\n  ]\n}\n","export const nthRootDocs = {\n  name: 'nthRoot',\n  category: 'Arithmetic',\n  syntax: [\n    'nthRoot(a)',\n    'nthRoot(a, root)'\n  ],\n  description: 'Calculate the nth root of a value. ' +\n      'The principal nth root of a positive real number A, ' +\n      'is the positive real solution of the equation \"x^root = A\".',\n  examples: [\n    '4 ^ 3',\n    'nthRoot(64, 3)',\n    'nthRoot(9, 2)',\n    'sqrt(9)'\n  ],\n  seealso: [\n    'nthRoots',\n    'pow',\n    'sqrt'\n  ]\n}\n","export const nthRootsDocs = {\n  name: 'nthRoots',\n  category: 'Arithmetic',\n  syntax: [\n    'nthRoots(A)',\n    'nthRoots(A, root)'\n  ],\n  description: ('' +\n      'Calculate the nth roots of a value. ' +\n      'An nth root of a positive real number A, ' +\n      'is a positive real solution of the equation \"x^root = A\". ' +\n      'This function returns an array of complex values.'\n  ),\n  examples: [\n    'nthRoots(1)',\n    'nthRoots(1, 3)'\n  ],\n  seealso: [\n    'sqrt',\n    'pow',\n    'nthRoot'\n  ]\n}\n","export const powDocs = {\n  name: 'pow',\n  category: 'Operators',\n  syntax: [\n    'x ^ y',\n    'pow(x, y)'\n  ],\n  description:\n      'Calculates the power of x to y, x^y.',\n  examples: [\n    '2^3',\n    '2*2*2',\n    '1 + e ^ (pi * i)'\n  ],\n  seealso: [\n    'multiply',\n    'nthRoot',\n    'nthRoots',\n    'sqrt'\n  ]\n}\n","export const roundDocs = {\n  name: 'round',\n  category: 'Arithmetic',\n  syntax: [\n    'round(x)',\n    'round(x, n)'\n  ],\n  description:\n      'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',\n  examples: [\n    'round(3.2)',\n    'round(3.8)',\n    'round(-4.2)',\n    'round(-4.8)',\n    'round(pi, 3)',\n    'round(123.45678, 2)'\n  ],\n  seealso: ['ceil', 'floor', 'fix']\n}\n","export const signDocs = {\n  name: 'sign',\n  category: 'Arithmetic',\n  syntax: [\n    'sign(x)'\n  ],\n  description:\n      'Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.',\n  examples: [\n    'sign(3.5)',\n    'sign(-4.2)',\n    'sign(0)'\n  ],\n  seealso: [\n    'abs'\n  ]\n}\n","export const sqrtDocs = {\n  name: 'sqrt',\n  category: 'Arithmetic',\n  syntax: [\n    'sqrt(x)'\n  ],\n  description:\n      'Compute the square root value. If x = y * y, then y is the square root of x.',\n  examples: [\n    'sqrt(25)',\n    '5 * 5',\n    'sqrt(-1)'\n  ],\n  seealso: [\n    'square',\n    'sqrtm',\n    'multiply',\n    'nthRoot',\n    'nthRoots',\n    'pow'\n  ]\n}\n","export const sqrtmDocs = {\n  name: 'sqrtm',\n  category: 'Arithmetic',\n  syntax: [\n    'sqrtm(x)'\n  ],\n  description:\n      'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',\n  examples: [\n    'sqrtm([[1, 2], [3, 4]])'\n  ],\n  seealso: [\n    'sqrt',\n    'abs',\n    'square',\n    'multiply'\n  ]\n}\n","export const squareDocs = {\n  name: 'square',\n  category: 'Arithmetic',\n  syntax: [\n    'square(x)'\n  ],\n  description:\n      'Compute the square of a value. The square of x is x * x.',\n  examples: [\n    'square(3)',\n    'sqrt(9)',\n    '3^2',\n    '3 * 3'\n  ],\n  seealso: [\n    'multiply',\n    'pow',\n    'sqrt',\n    'cube'\n  ]\n}\n","export const subtractDocs = {\n  name: 'subtract',\n  category: 'Operators',\n  syntax: [\n    'x - y',\n    'subtract(x, y)'\n  ],\n  description: 'subtract two values.',\n  examples: [\n    'a = 5.3 - 2',\n    'a + 2',\n    '2/3 - 1/6',\n    '2 * 3 - 3',\n    '2.1 km - 500m'\n  ],\n  seealso: [\n    'add'\n  ]\n}\n","export const unaryMinusDocs = {\n  name: 'unaryMinus',\n  category: 'Operators',\n  syntax: [\n    '-x',\n    'unaryMinus(x)'\n  ],\n  description:\n      'Inverse the sign of a value. Converts booleans and strings to numbers.',\n  examples: [\n    '-4.5',\n    '-(-5.6)',\n    '-\"22\"'\n  ],\n  seealso: [\n    'add', 'subtract', 'unaryPlus'\n  ]\n}\n","export const unaryPlusDocs = {\n  name: 'unaryPlus',\n  category: 'Operators',\n  syntax: [\n    '+x',\n    'unaryPlus(x)'\n  ],\n  description:\n      'Converts booleans and strings to numbers.',\n  examples: [\n    '+true',\n    '+\"2\"'\n  ],\n  seealso: [\n    'add', 'subtract', 'unaryMinus'\n  ]\n}\n","export const xgcdDocs = {\n  name: 'xgcd',\n  category: 'Arithmetic',\n  syntax: [\n    'xgcd(a, b)'\n  ],\n  description: 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',\n  examples: [\n    'xgcd(8, 12)',\n    'gcd(8, 12)',\n    'xgcd(36163, 21199)'\n  ],\n  seealso: ['gcd', 'lcm']\n}\n","export const invmodDocs = {\n  name: 'invmod',\n  category: 'Arithmetic',\n  syntax: [\n    'invmod(a, b)'\n  ],\n  description: 'Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)',\n  examples: [\n    'invmod(8, 12)=NaN',\n    'invmod(7, 13)=2',\n    'math.invmod(15151, 15122)=10429'\n  ],\n  seealso: ['gcd', 'xgcd']\n}\n","export const bitAndDocs = {\n  name: 'bitAnd',\n  category: 'Bitwise',\n  syntax: [\n    'x & y',\n    'bitAnd(x, y)'\n  ],\n  description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',\n  examples: [\n    '5 & 3',\n    'bitAnd(53, 131)',\n    '[1, 12, 31] & 42'\n  ],\n  seealso: [\n    'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const bitNotDocs = {\n  name: 'bitNot',\n  category: 'Bitwise',\n  syntax: [\n    '~x',\n    'bitNot(x)'\n  ],\n  description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',\n  examples: [\n    '~1',\n    '~2',\n    'bitNot([2, -3, 4])'\n  ],\n  seealso: [\n    'bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const bitOrDocs = {\n  name: 'bitOr',\n  category: 'Bitwise',\n  syntax: [\n    'x | y',\n    'bitOr(x, y)'\n  ],\n  description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',\n  examples: [\n    '5 | 3',\n    'bitOr([1, 2, 3], 4)'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const bitXorDocs = {\n  name: 'bitXor',\n  category: 'Bitwise',\n  syntax: [\n    'bitXor(x, y)'\n  ],\n  description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',\n  examples: [\n    'bitOr(1, 2)',\n    'bitXor([2, 3, 4], 4)'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const leftShiftDocs = {\n  name: 'leftShift',\n  category: 'Bitwise',\n  syntax: [\n    'x << y',\n    'leftShift(x, y)'\n  ],\n  description: 'Bitwise left logical shift of a value x by y number of bits.',\n  examples: [\n    '4 << 1',\n    '8 >> 1'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const rightArithShiftDocs = {\n  name: 'rightArithShift',\n  category: 'Bitwise',\n  syntax: [\n    'x >> y',\n    'rightArithShift(x, y)'\n  ],\n  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',\n  examples: [\n    '8 >> 1',\n    '4 << 1',\n    '-12 >> 2'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift'\n  ]\n}\n","export const rightLogShiftDocs = {\n  name: 'rightLogShift',\n  category: 'Bitwise',\n  syntax: [\n    'x >>> y',\n    'rightLogShift(x, y)'\n  ],\n  description: 'Bitwise right logical shift of a value x by y number of bits.',\n  examples: [\n    '8 >>> 1',\n    '4 << 1',\n    '-12 >>> 2'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift'\n  ]\n}\n","export const bellNumbersDocs = {\n  name: 'bellNumbers',\n  category: 'Combinatorics',\n  syntax: [\n    'bellNumbers(n)'\n  ],\n  description: 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',\n  examples: [\n    'bellNumbers(3)',\n    'bellNumbers(8)'\n  ],\n  seealso: ['stirlingS2']\n}\n","export const catalanDocs = {\n  name: 'catalan',\n  category: 'Combinatorics',\n  syntax: [\n    'catalan(n)'\n  ],\n  description: 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',\n  examples: [\n    'catalan(3)',\n    'catalan(8)'\n  ],\n  seealso: ['bellNumbers']\n}\n","export const compositionDocs = {\n  name: 'composition',\n  category: 'Combinatorics',\n  syntax: [\n    'composition(n, k)'\n  ],\n  description: 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',\n  examples: [\n    'composition(5, 3)'\n  ],\n  seealso: ['combinations']\n}\n","export const stirlingS2Docs = {\n  name: 'stirlingS2',\n  category: 'Combinatorics',\n  syntax: [\n    'stirlingS2(n, k)'\n  ],\n  description: 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',\n  examples: [\n    'stirlingS2(5, 3)'\n  ],\n  seealso: ['bellNumbers']\n}\n","export const configDocs = {\n  name: 'config',\n  category: 'Core',\n  syntax: [\n    'config()',\n    'config(options)'\n  ],\n  description: 'Get configuration or change configuration.',\n  examples: [\n    'config()',\n    '1/3 + 1/4',\n    'config({number: \"Fraction\"})',\n    '1/3 + 1/4'\n  ],\n  seealso: []\n}\n","export const importDocs = {\n  name: 'import',\n  category: 'Core',\n  syntax: [\n    'import(functions)',\n    'import(functions, options)'\n  ],\n  description: 'Import functions or constants from an object.',\n  examples: [\n    'import({myFn: f(x)=x^2, myConstant: 32 })',\n    'myFn(2)',\n    'myConstant'\n  ],\n  seealso: []\n}\n","export const typedDocs = {\n  name: 'typed',\n  category: 'Core',\n  syntax: [\n    'typed(signatures)',\n    'typed(name, signatures)'\n  ],\n  description: 'Create a typed function.',\n  examples: [\n    'double = typed({ \"number\": f(x)=x+x })',\n    'double(2)',\n    'double(\"hello\")'\n  ],\n  seealso: []\n}\n","export const argDocs = {\n  name: 'arg',\n  category: 'Complex',\n  syntax: [\n    'arg(x)'\n  ],\n  description:\n      'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',\n  examples: [\n    'arg(2 + 2i)',\n    'atan2(3, 2)',\n    'arg(2 + 3i)'\n  ],\n  seealso: [\n    're',\n    'im',\n    'conj',\n    'abs'\n  ]\n}\n","export const conjDocs = {\n  name: 'conj',\n  category: 'Complex',\n  syntax: [\n    'conj(x)'\n  ],\n  description:\n      'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',\n  examples: [\n    'conj(2 + 3i)',\n    'conj(2 - 3i)',\n    'conj(-5.2i)'\n  ],\n  seealso: [\n    're',\n    'im',\n    'abs',\n    'arg'\n  ]\n}\n","export const reDocs = {\n  name: 're',\n  category: 'Complex',\n  syntax: [\n    're(x)'\n  ],\n  description: 'Get the real part of a complex number.',\n  examples: [\n    're(2 + 3i)',\n    'im(2 + 3i)',\n    're(-5.2i)',\n    're(2.4)'\n  ],\n  seealso: [\n    'im',\n    'conj',\n    'abs',\n    'arg'\n  ]\n}\n","export const imDocs = {\n  name: 'im',\n  category: 'Complex',\n  syntax: [\n    'im(x)'\n  ],\n  description: 'Get the imaginary part of a complex number.',\n  examples: [\n    'im(2 + 3i)',\n    're(2 + 3i)',\n    'im(-5.2i)',\n    'im(2.4)'\n  ],\n  seealso: [\n    're',\n    'conj',\n    'abs',\n    'arg'\n  ]\n}\n","export const evaluateDocs = {\n  name: 'evaluate',\n  category: 'Expression',\n  syntax: [\n    'evaluate(expression)',\n    'evaluate([expr1, expr2, expr3, ...])'\n  ],\n  description: 'Evaluate an expression or an array with expressions.',\n  examples: [\n    'evaluate(\"2 + 3\")',\n    'evaluate(\"sqrt(\" + 4 + \")\")'\n  ],\n  seealso: []\n}\n","export const helpDocs = {\n  name: 'help',\n  category: 'Expression',\n  syntax: [\n    'help(object)',\n    'help(string)'\n  ],\n  description: 'Display documentation on a function or data type.',\n  examples: [\n    'help(sqrt)',\n    'help(\"complex\")'\n  ],\n  seealso: []\n}\n","export const distanceDocs = {\n  name: 'distance',\n  category: 'Geometry',\n  syntax: [\n    'distance([x1, y1], [x2, y2])',\n    'distance([[x1, y1], [x2, y2]])'\n  ],\n  description: 'Calculates the Euclidean distance between two points.',\n  examples: [\n    'distance([0,0], [4,4])',\n    'distance([[0,0], [4,4]])'\n  ],\n  seealso: []\n}\n","export const intersectDocs = {\n  name: 'intersect',\n  category: 'Geometry',\n  syntax: [\n    'intersect(expr1, expr2, expr3, expr4)',\n    'intersect(expr1, expr2, expr3)'\n  ],\n  description: 'Computes the intersection point of lines and/or planes.',\n  examples: [\n    'intersect([0, 0], [10, 10], [10, 0], [0, 10])',\n    'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'\n  ],\n  seealso: []\n}\n","export const andDocs = {\n  name: 'and',\n  category: 'Logical',\n  syntax: [\n    'x and y',\n    'and(x, y)'\n  ],\n  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',\n  examples: [\n    'true and false',\n    'true and true',\n    '2 and 4'\n  ],\n  seealso: [\n    'not', 'or', 'xor'\n  ]\n}\n","export const notDocs = {\n  name: 'not',\n  category: 'Logical',\n  syntax: [\n    'not x',\n    'not(x)'\n  ],\n  description: 'Logical not. Flips the boolean value of given argument.',\n  examples: [\n    'not true',\n    'not false',\n    'not 2',\n    'not 0'\n  ],\n  seealso: [\n    'and', 'or', 'xor'\n  ]\n}\n","export const orDocs = {\n  name: 'or',\n  category: 'Logical',\n  syntax: [\n    'x or y',\n    'or(x, y)'\n  ],\n  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',\n  examples: [\n    'true or false',\n    'false or false',\n    '0 or 4'\n  ],\n  seealso: [\n    'not', 'and', 'xor'\n  ]\n}\n","export const xorDocs = {\n  name: 'xor',\n  category: 'Logical',\n  syntax: [\n    'x xor y',\n    'xor(x, y)'\n  ],\n  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',\n  examples: [\n    'true xor false',\n    'false xor false',\n    'true xor true',\n    '0 xor 4'\n  ],\n  seealso: [\n    'not', 'and', 'or'\n  ]\n}\n","export const concatDocs = {\n  name: 'concat',\n  category: 'Matrix',\n  syntax: [\n    'concat(A, B, C, ...)',\n    'concat(A, B, C, ..., dim)'\n  ],\n  description: 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',\n  examples: [\n    'A = [1, 2; 5, 6]',\n    'B = [3, 4; 7, 8]',\n    'concat(A, B)',\n    'concat(A, B, 1)',\n    'concat(A, B, 2)'\n  ],\n  seealso: [\n    'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const countDocs = {\n  name: 'count',\n  category: 'Matrix',\n  syntax: [\n    'count(x)'\n  ],\n  description: 'Count the number of elements of a matrix, array or string.',\n  examples: [\n    'a = [1, 2; 3, 4; 5, 6]',\n    'count(a)',\n    'size(a)',\n    'count(\"hello world\")'\n  ],\n  seealso: [\n    'size'\n  ]\n}\n","export const crossDocs = {\n  name: 'cross',\n  category: 'Matrix',\n  syntax: [\n    'cross(A, B)'\n  ],\n  description: 'Calculate the cross product for two vectors in three dimensional space.',\n  examples: [\n    'cross([1, 1, 0],  [0, 1, 1])',\n    'cross([3, -3, 1], [4, 9, 2])',\n    'cross([2, 3, 4],  [5, 6, 7])'\n  ],\n  seealso: [\n    'multiply',\n    'dot'\n  ]\n}\n","export const columnDocs = {\n  name: 'column',\n  category: 'Matrix',\n  syntax: [\n    'column(x, index)'\n  ],\n  description: 'Return a column from a matrix or array.',\n  examples: [\n    'A = [[1, 2], [3, 4]]',\n    'column(A, 1)',\n    'column(A, 2)'\n  ],\n  seealso: ['row', 'matrixFromColumns']\n}\n","export const ctransposeDocs = {\n  name: 'ctranspose',\n  category: 'Matrix',\n  syntax: [\n    'x\\'',\n    'ctranspose(x)'\n  ],\n  description: 'Complex Conjugate and Transpose a matrix',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'a\\'',\n    'ctranspose(a)'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros'\n  ]\n}\n","export const detDocs = {\n  name: 'det',\n  category: 'Matrix',\n  syntax: [\n    'det(x)'\n  ],\n  description: 'Calculate the determinant of a matrix',\n  examples: [\n    'det([1, 2; 3, 4])',\n    'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'\n  ],\n  seealso: [\n    'concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const diagDocs = {\n  name: 'diag',\n  category: 'Matrix',\n  syntax: [\n    'diag(x)',\n    'diag(x, k)'\n  ],\n  description: 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',\n  examples: [\n    'diag(1:3)',\n    'diag(1:3, 1)',\n    'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]',\n    'diag(a)'\n  ],\n  seealso: [\n    'concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const diffDocs = {\n  name: 'diff',\n  category: 'Matrix',\n  syntax: [\n    'diff(arr)',\n    'diff(arr, dim)'\n  ],\n  description: [\n    'Create a new matrix or array with the difference of the passed matrix or array.',\n    'Dim parameter is optional and used to indicant the dimension of the array/matrix to apply the difference',\n    'If no dimension parameter is passed it is assumed as dimension 0',\n    'Dimension is zero-based in javascript and one-based in the parser',\n    'Arrays must be \\'rectangular\\' meaning arrays like [1, 2]',\n    'If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays'\n  ],\n  examples: [\n    'diff([1, 2, 4, 7, 0])',\n    'diff([1, 2, 4, 7, 0], 0)',\n    'diff(matrix([1, 2, 4, 7, 0]))',\n    'diff([[1, 2], [3, 4]])',\n    'diff([[1, 2], [3, 4]], 0)',\n    'diff([[1, 2], [3, 4]], 1)',\n    'diff([[1, 2], [3, 4]], bignumber(1))',\n    'diff(matrix([[1, 2], [3, 4]]), 1)',\n    'diff([[1, 2], matrix([3, 4])], 1)'\n\n  ],\n  seealso: ['subtract', 'partitionSelect']\n}\n","export const dotDocs = {\n  name: 'dot',\n  category: 'Matrix',\n  syntax: [\n    'dot(A, B)',\n    'A * B'\n  ],\n  description: 'Calculate the dot product of two vectors. ' +\n      'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' +\n      'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',\n  examples: [\n    'dot([2, 4, 1], [2, 2, 3])',\n    '[2, 4, 1] * [2, 2, 3]'\n  ],\n  seealso: [\n    'multiply',\n    'cross'\n  ]\n}\n","export const getMatrixDataTypeDocs = {\n  name: 'getMatrixDataType',\n  category: 'Matrix',\n  syntax: [\n    'getMatrixDataType(x)'\n  ],\n  description: 'Find the data type of all elements in a matrix or array, ' +\n  'for example \"number\" if all items are a number ' +\n  'and \"Complex\" if all values are complex numbers. ' +\n  'If a matrix contains more than one data type, it will return \"mixed\".',\n  examples: [\n    'getMatrixDataType([1, 2, 3])',\n    'getMatrixDataType([[5 cm], [2 inch]])',\n    'getMatrixDataType([1, \"text\"])',\n    'getMatrixDataType([1, bignumber(4)])'\n  ],\n  seealso: ['matrix', 'sparse', 'typeOf']\n}\n","export const identityDocs = {\n  name: 'identity',\n  category: 'Matrix',\n  syntax: [\n    'identity(n)',\n    'identity(m, n)',\n    'identity([m, n])'\n  ],\n  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',\n  examples: [\n    'identity(3)',\n    'identity(3, 5)',\n    'a = [1, 2, 3; 4, 5, 6]',\n    'identity(size(a))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const filterDocs = {\n  name: 'filter',\n  category: 'Matrix',\n  syntax: [\n    'filter(x, test)'\n  ],\n  description: 'Filter items in a matrix.',\n  examples: [\n    'isPositive(x) = x > 0',\n    'filter([6, -2, -1, 4, 3], isPositive)',\n    'filter([6, -2, 0, 1, 0], x != 0)'\n  ],\n  seealso: ['sort', 'map', 'forEach']\n}\n","export const flattenDocs = {\n  name: 'flatten',\n  category: 'Matrix',\n  syntax: [\n    'flatten(x)'\n  ],\n  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'size(a)',\n    'b = flatten(a)',\n    'size(b)'\n  ],\n  seealso: [\n    'concat', 'resize', 'size', 'squeeze'\n  ]\n}\n","export const forEachDocs = {\n  name: 'forEach',\n  category: 'Matrix',\n  syntax: [\n    'forEach(x, callback)'\n  ],\n  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',\n  examples: [\n    'numberOfPets = {}',\n    'addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;',\n    'forEach([\"Dog\",\"Cat\",\"Cat\"], addPet)',\n    'numberOfPets'\n  ],\n  seealso: ['map', 'sort', 'filter']\n}\n","export const invDocs = {\n  name: 'inv',\n  category: 'Matrix',\n  syntax: [\n    'inv(x)'\n  ],\n  description: 'Calculate the inverse of a matrix',\n  examples: [\n    'inv([1, 2; 3, 4])',\n    'inv(4)',\n    '1 / 4'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const eigsDocs = {\n  name: 'eigs',\n  category: 'Matrix',\n  syntax: [\n    'eigs(x)'\n  ],\n  description: 'Calculate the eigenvalues and eigenvectors of a real symmetric matrix',\n  examples: [\n    'eigs([[5, 2.3], [2.3, 1]])'\n  ],\n  seealso: [\n    'inv'\n  ]\n}\n","export const kronDocs = {\n  name: 'kron',\n  category: 'Matrix',\n  syntax: [\n    'kron(x, y)'\n  ],\n  description: 'Calculates the kronecker product of 2 matrices or vectors.',\n  examples: [\n    'kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])',\n    'kron([1,1], [2,3,4])'\n  ],\n  seealso: [\n    'multiply', 'dot', 'cross'\n  ]\n}\n","export const matrixFromFunctionDocs = {\n  name: 'matrixFromFunction',\n  category: 'Matrix',\n  syntax: [\n    'math.matrixFromFunction(size, fn)',\n    'math.matrixFromFunction(size, fn, format)',\n    'math.matrixFromFunction(size, fn, format, datatype)',\n    'math.matrixFromFunction(size, format, fn)',\n    'math.matrixFromFunction(size, format, datatype, fn)'\n  ],\n  description: 'Create a matrix by evaluating a generating function at each index.',\n  examples: [\n    'f(I) = I[1] - I[2]',\n    'matrixFromFunction([3,3], f)',\n    'g(I) = I[1] - I[2] == 1 ? 4 : 0',\n    'matrixFromFunction([100, 100], \"sparse\", g)',\n    'matrixFromFunction([5], random)'\n  ],\n  seealso: [\n    'matrix', 'matrixFromRows', 'matrixFromColumns', 'zeros'\n  ]\n}\n","export const matrixFromRowsDocs = {\n  name: 'matrixFromRows',\n  category: 'Matrix',\n  syntax: [\n    'math.matrixFromRows(...arr)',\n    'math.matrixFromRows(row1, row2)',\n    'math.matrixFromRows(row1, row2, row3)'\n  ],\n  description: 'Create a dense matrix from vectors as individual rows.',\n  examples: [\n    'matrixFromRows([1, 2, 3], [[4],[5],[6]])'\n  ],\n  seealso: [\n    'matrix', 'matrixFromColumns', 'matrixFromFunction', 'zeros'\n  ]\n}\n","export const matrixFromColumnsDocs = {\n  name: 'matrixFromColumns',\n  category: 'Matrix',\n  syntax: [\n    'math.matrixFromColumns(...arr)',\n    'math.matrixFromColumns(row1, row2)',\n    'math.matrixFromColumns(row1, row2, row3)'\n  ],\n  description: 'Create a dense matrix from vectors as individual columns.',\n  examples: [\n    'matrixFromColumns([1, 2, 3], [[4],[5],[6]])'\n  ],\n  seealso: [\n    'matrix', 'matrixFromRows', 'matrixFromFunction', 'zeros'\n  ]\n}\n","export const mapDocs = {\n  name: 'map',\n  category: 'Matrix',\n  syntax: [\n    'map(x, callback)'\n  ],\n  description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.',\n  examples: [\n    'map([1, 2, 3], square)'\n  ],\n  seealso: ['filter', 'forEach']\n}\n","export const onesDocs = {\n  name: 'ones',\n  category: 'Matrix',\n  syntax: [\n    'ones(m)',\n    'ones(m, n)',\n    'ones(m, n, p, ...)',\n    'ones([m])',\n    'ones([m, n])',\n    'ones([m, n, p, ...])'\n  ],\n  description: 'Create a matrix containing ones.',\n  examples: [\n    'ones(3)',\n    'ones(3, 5)',\n    'ones([2,3]) * 4.5',\n    'a = [1, 2, 3; 4, 5, 6]',\n    'ones(size(a))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const partitionSelectDocs = {\n  name: 'partitionSelect',\n  category: 'Matrix',\n  syntax: [\n    'partitionSelect(x, k)',\n    'partitionSelect(x, k, compare)'\n  ],\n  description: 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',\n  examples: [\n    'partitionSelect([5, 10, 1], 2)',\n    'partitionSelect([\"C\", \"B\", \"A\", \"D\"], 1)'\n  ],\n  seealso: ['sort']\n}\n","export const rangeDocs = {\n  name: 'range',\n  category: 'Type',\n  syntax: [\n    'start:end',\n    'start:step:end',\n    'range(start, end)',\n    'range(start, end, step)',\n    'range(string)'\n  ],\n  description:\n      'Create a range. Lower bound of the range is included, upper bound is excluded.',\n  examples: [\n    '1:5',\n    '3:-1:-3',\n    'range(3, 7)',\n    'range(0, 12, 2)',\n    'range(\"4:10\")',\n    'a = [1, 2, 3, 4; 5, 6, 7, 8]',\n    'a[1:2, 1:2]'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const resizeDocs = {\n  name: 'resize',\n  category: 'Matrix',\n  syntax: [\n    'resize(x, size)',\n    'resize(x, size, defaultValue)'\n  ],\n  description: 'Resize a matrix.',\n  examples: [\n    'resize([1,2,3,4,5], [3])',\n    'resize([1,2,3], [5])',\n    'resize([1,2,3], [5], -1)',\n    'resize(2, [2, 3])',\n    'resize(\"hello\", [8], \"!\")'\n  ],\n  seealso: [\n    'size', 'subset', 'squeeze', 'reshape'\n  ]\n}\n","export const reshapeDocs = {\n  name: 'reshape',\n  category: 'Matrix',\n  syntax: [\n    'reshape(x, sizes)'\n  ],\n  description: 'Reshape a multi dimensional array to fit the specified dimensions.',\n  examples: [\n    'reshape([1, 2, 3, 4, 5, 6], [2, 3])',\n    'reshape([[1, 2], [3, 4]], [1, 4])',\n    'reshape([[1, 2], [3, 4]], [4])'\n  ],\n  seealso: [\n    'size', 'squeeze', 'resize'\n  ]\n}\n","export const rotateDocs = {\n  name: 'rotate',\n  category: 'Matrix',\n  syntax: [\n    'rotate(w, theta)',\n    'rotate(w, theta, v)'\n  ],\n  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' +\n    'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',\n  examples: [\n    'rotate([1, 0], math.pi / 2)',\n    'rotate(matrix([1, 0]), unit(\"35deg\"))',\n    'rotate([1, 0, 0], unit(\"90deg\"), [0, 0, 1])',\n    'rotate(matrix([1, 0, 0]), unit(\"90deg\"), matrix([0, 0, 1]))'\n  ],\n  seealso: [\n    'matrix', 'rotationMatrix'\n  ]\n}\n","export const rotationMatrixDocs = {\n  name: 'rotationMatrix',\n  category: 'Matrix',\n  syntax: [\n    'rotationMatrix(theta)',\n    'rotationMatrix(theta, v)',\n    'rotationMatrix(theta, v, format)'\n  ],\n  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' +\n    'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',\n  examples: [\n    'rotationMatrix(pi / 2)',\n    'rotationMatrix(unit(\"45deg\"), [0, 0, 1])',\n    'rotationMatrix(1, matrix([0, 0, 1]), \"sparse\")'\n  ],\n  seealso: [\n    'cos', 'sin'\n  ]\n}\n","export const rowDocs = {\n  name: 'row',\n  category: 'Matrix',\n  syntax: [\n    'row(x, index)'\n  ],\n  description: 'Return a row from a matrix or array.',\n  examples: [\n    'A = [[1, 2], [3, 4]]',\n    'row(A, 1)',\n    'row(A, 2)'\n  ],\n  seealso: ['column', 'matrixFromRows']\n}\n","export const sizeDocs = {\n  name: 'size',\n  category: 'Matrix',\n  syntax: [\n    'size(x)'\n  ],\n  description: 'Calculate the size of a matrix.',\n  examples: [\n    'size(2.3)',\n    'size(\"hello world\")',\n    'a = [1, 2; 3, 4; 5, 6]',\n    'size(a)',\n    'size(1:6)'\n  ],\n  seealso: [\n    'concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const sortDocs = {\n  name: 'sort',\n  category: 'Matrix',\n  syntax: [\n    'sort(x)',\n    'sort(x, compare)'\n  ],\n  description: 'Sort the items in a matrix. Compare can be a string \"asc\", \"desc\", \"natural\", or a custom sort function.',\n  examples: [\n    'sort([5, 10, 1])',\n    'sort([\"C\", \"B\", \"A\", \"D\"])',\n    'sortByLength(a, b) = size(a)[1] - size(b)[1]',\n    'sort([\"Langdon\", \"Tom\", \"Sara\"], sortByLength)',\n    'sort([\"10\", \"1\", \"2\"], \"natural\")'\n  ],\n  seealso: ['map', 'filter', 'forEach']\n}\n","export const squeezeDocs = {\n  name: 'squeeze',\n  category: 'Matrix',\n  syntax: [\n    'squeeze(x)'\n  ],\n  description: 'Remove inner and outer singleton dimensions from a matrix.',\n  examples: [\n    'a = zeros(3,2,1)',\n    'size(squeeze(a))',\n    'b = zeros(1,1,3)',\n    'size(squeeze(b))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const subsetDocs = {\n  name: 'subset',\n  category: 'Matrix',\n  syntax: [\n    'value(index)',\n    'value(index) = replacement',\n    'subset(value, [index])',\n    'subset(value, [index], replacement)'\n  ],\n  description: 'Get or set a subset of the entries of a matrix or ' +\n      'characters of a string. ' +\n      'Indexes are one-based. There should be one index specification for ' +\n      'each dimension of the target. Each specification can be a single ' +\n      'index, a list of indices, or a range in colon notation `l:u`. ' +\n      'In a range, both the lower bound l and upper bound u are included; ' +\n      'and if a bound is omitted it defaults to the most extreme valid value. ' +\n      'The cartesian product of the indices specified in each dimension ' +\n      'determines the target of the operation.',\n  examples: [\n    'd = [1, 2; 3, 4]',\n    'e = []',\n    'e[1, 1:2] = [5, 6]',\n    'e[2, :] = [7, 8]',\n    'f = d * e',\n    'f[2, 1]',\n    'f[:, 1]',\n    'f[[1,2], [1,3]] = [9, 10; 11, 12]',\n    'f'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const traceDocs = {\n  name: 'trace',\n  category: 'Matrix',\n  syntax: [\n    'trace(A)'\n  ],\n  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',\n  examples: [\n    'A = [1, 2, 3; -1, 2, 3; 2, 0, 3]',\n    'trace(A)'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros'\n  ]\n}\n","export const transposeDocs = {\n  name: 'transpose',\n  category: 'Matrix',\n  syntax: [\n    'x\\'',\n    'transpose(x)'\n  ],\n  description: 'Transpose a matrix',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'a\\'',\n    'transpose(a)'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros'\n  ]\n}\n","export const zerosDocs = {\n  name: 'zeros',\n  category: 'Matrix',\n  syntax: [\n    'zeros(m)',\n    'zeros(m, n)',\n    'zeros(m, n, p, ...)',\n    'zeros([m])',\n    'zeros([m, n])',\n    'zeros([m, n, p, ...])'\n  ],\n  description: 'Create a matrix containing zeros.',\n  examples: [\n    'zeros(3)',\n    'zeros(3, 5)',\n    'a = [1, 2, 3; 4, 5, 6]',\n    'zeros(size(a))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose'\n  ]\n}\n","export const combinationsDocs = {\n  name: 'combinations',\n  category: 'Probability',\n  syntax: [\n    'combinations(n, k)'\n  ],\n  description: 'Compute the number of combinations of n items taken k at a time',\n  examples: [\n    'combinations(7, 5)'\n  ],\n  seealso: ['combinationsWithRep', 'permutations', 'factorial']\n}\n","export const combinationsWithRepDocs = {\n  name: 'combinationsWithRep',\n  category: 'Probability',\n  syntax: [\n    'combinationsWithRep(n, k)'\n  ],\n  description: 'Compute the number of combinations of n items taken k at a time with replacements.',\n  examples: [\n    'combinationsWithRep(7, 5)'\n  ],\n  seealso: ['combinations', 'permutations', 'factorial']\n}\n","export const factorialDocs = {\n  name: 'factorial',\n  category: 'Probability',\n  syntax: [\n    'n!',\n    'factorial(n)'\n  ],\n  description: 'Compute the factorial of a value',\n  examples: [\n    '5!',\n    '5 * 4 * 3 * 2 * 1',\n    '3!'\n  ],\n  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']\n}\n","export const gammaDocs = {\n  name: 'gamma',\n  category: 'Probability',\n  syntax: [\n    'gamma(n)'\n  ],\n  description: 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',\n  examples: [\n    'gamma(4)',\n    '3!',\n    'gamma(1/2)',\n    'sqrt(pi)'\n  ],\n  seealso: ['factorial']\n}\n","export const kldivergenceDocs = {\n  name: 'kldivergence',\n  category: 'Probability',\n  syntax: [\n    'kldivergence(x, y)'\n  ],\n  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',\n  examples: [\n    'kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'\n  ],\n  seealso: []\n}\n","export const multinomialDocs = {\n  name: 'multinomial',\n  category: 'Probability',\n  syntax: [\n    'multinomial(A)'\n  ],\n  description: 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',\n  examples: [\n    'multinomial([1, 2, 1])'\n  ],\n  seealso: ['combinations', 'factorial']\n}\n","export const permutationsDocs = {\n  name: 'permutations',\n  category: 'Probability',\n  syntax: [\n    'permutations(n)',\n    'permutations(n, k)'\n  ],\n  description: 'Compute the number of permutations of n items taken k at a time',\n  examples: [\n    'permutations(5)',\n    'permutations(5, 3)'\n  ],\n  seealso: ['combinations', 'combinationsWithRep', 'factorial']\n}\n","export const pickRandomDocs = {\n  name: 'pickRandom',\n  category: 'Probability',\n  syntax: [\n    'pickRandom(array)',\n    'pickRandom(array, number)',\n    'pickRandom(array, weights)',\n    'pickRandom(array, number, weights)',\n    'pickRandom(array, weights, number)'\n  ],\n  description:\n      'Pick a random entry from a given array.',\n  examples: [\n    'pickRandom(0:10)',\n    'pickRandom([1, 3, 1, 6])',\n    'pickRandom([1, 3, 1, 6], 2)',\n    'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])',\n    'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])',\n    'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'\n  ],\n  seealso: ['random', 'randomInt']\n}\n","export const randomDocs = {\n  name: 'random',\n  category: 'Probability',\n  syntax: [\n    'random()',\n    'random(max)',\n    'random(min, max)',\n    'random(size)',\n    'random(size, max)',\n    'random(size, min, max)'\n  ],\n  description:\n      'Return a random number.',\n  examples: [\n    'random()',\n    'random(10, 20)',\n    'random([2, 3])'\n  ],\n  seealso: ['pickRandom', 'randomInt']\n}\n","export const randomIntDocs = {\n  name: 'randomInt',\n  category: 'Probability',\n  syntax: [\n    'randomInt(max)',\n    'randomInt(min, max)',\n    'randomInt(size)',\n    'randomInt(size, max)',\n    'randomInt(size, min, max)'\n  ],\n  description:\n      'Return a random integer number',\n  examples: [\n    'randomInt(10, 20)',\n    'randomInt([2, 3], 10)'\n  ],\n  seealso: ['pickRandom', 'random']\n}\n","export const compareDocs = {\n  name: 'compare',\n  category: 'Relational',\n  syntax: [\n    'compare(x, y)'\n  ],\n  description:\n      'Compare two values. ' +\n      'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: [\n    'compare(2, 3)',\n    'compare(3, 2)',\n    'compare(2, 2)',\n    'compare(5cm, 40mm)',\n    'compare(2, [1, 2, 3])'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText'\n  ]\n}\n","export const compareNaturalDocs = {\n  name: 'compareNatural',\n  category: 'Relational',\n  syntax: [\n    'compareNatural(x, y)'\n  ],\n  description:\n      'Compare two values of any type in a deterministic, natural way. ' +\n      'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: [\n    'compareNatural(2, 3)',\n    'compareNatural(3, 2)',\n    'compareNatural(2, 2)',\n    'compareNatural(5cm, 40mm)',\n    'compareNatural(\"2\", \"10\")',\n    'compareNatural(2 + 3i, 2 + 4i)',\n    'compareNatural([1, 2, 4], [1, 2, 3])',\n    'compareNatural([1, 5], [1, 2, 3])',\n    'compareNatural([1, 2], [1, 2])',\n    'compareNatural({a: 2}, {a: 4})'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText'\n  ]\n}\n","export const compareTextDocs = {\n  name: 'compareText',\n  category: 'Relational',\n  syntax: [\n    'compareText(x, y)'\n  ],\n  description:\n      'Compare two strings lexically. Comparison is case sensitive. ' +\n      'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: [\n    'compareText(\"B\", \"A\")',\n    'compareText(\"A\", \"B\")',\n    'compareText(\"A\", \"A\")',\n    'compareText(\"2\", \"10\")',\n    'compare(\"2\", \"10\")',\n    'compare(2, 10)',\n    'compareNatural(\"2\", \"10\")',\n    'compareText(\"B\", [\"A\", \"B\", \"C\"])'\n  ],\n  seealso: [\n    'compare', 'compareNatural'\n  ]\n}\n","export const deepEqualDocs = {\n  name: 'deepEqual',\n  category: 'Relational',\n  syntax: [\n    'deepEqual(x, y)'\n  ],\n  description:\n      'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',\n  examples: [\n    'deepEqual([1,3,4], [1,3,4])',\n    'deepEqual([1,3,4], [1,3])'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare'\n  ]\n}\n","export const equalDocs = {\n  name: 'equal',\n  category: 'Relational',\n  syntax: [\n    'x == y',\n    'equal(x, y)'\n  ],\n  description:\n      'Check equality of two values. Returns true if the values are equal, and false if not.',\n  examples: [\n    '2+2 == 3',\n    '2+2 == 4',\n    'a = 3.2',\n    'b = 6-2.8',\n    'a == b',\n    '50cm == 0.5m'\n  ],\n  seealso: [\n    'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText'\n  ]\n}\n","export const equalTextDocs = {\n  name: 'equalText',\n  category: 'Relational',\n  syntax: [\n    'equalText(x, y)'\n  ],\n  description:\n      'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',\n  examples: [\n    'equalText(\"Hello\", \"Hello\")',\n    'equalText(\"a\", \"A\")',\n    'equal(\"2e3\", \"2000\")',\n    'equalText(\"2e3\", \"2000\")',\n    'equalText(\"B\", [\"A\", \"B\", \"C\"])'\n  ],\n  seealso: [\n    'compare', 'compareNatural', 'compareText', 'equal'\n  ]\n}\n","export const largerDocs = {\n  name: 'larger',\n  category: 'Relational',\n  syntax: [\n    'x > y',\n    'larger(x, y)'\n  ],\n  description:\n      'Check if value x is larger than y. Returns true if x is larger than y, and false if not.',\n  examples: [\n    '2 > 3',\n    '5 > 2*2',\n    'a = 3.3',\n    'b = 6-2.8',\n    '(a > b)',\n    '(b < a)',\n    '5 cm > 2 inch'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare'\n  ]\n}\n","export const largerEqDocs = {\n  name: 'largerEq',\n  category: 'Relational',\n  syntax: [\n    'x >= y',\n    'largerEq(x, y)'\n  ],\n  description:\n      'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',\n  examples: [\n    '2 >= 1+1',\n    '2 > 1+1',\n    'a = 3.2',\n    'b = 6-2.8',\n    '(a >= b)'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smallerEq', 'smaller', 'compare'\n  ]\n}\n","export const smallerDocs = {\n  name: 'smaller',\n  category: 'Relational',\n  syntax: [\n    'x < y',\n    'smaller(x, y)'\n  ],\n  description:\n      'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.',\n  examples: [\n    '2 < 3',\n    '5 < 2*2',\n    'a = 3.3',\n    'b = 6-2.8',\n    '(a < b)',\n    '5 cm < 2 inch'\n  ],\n  seealso: [\n    'equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare'\n  ]\n}\n","export const smallerEqDocs = {\n  name: 'smallerEq',\n  category: 'Relational',\n  syntax: [\n    'x <= y',\n    'smallerEq(x, y)'\n  ],\n  description:\n      'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',\n  examples: [\n    '2 <= 1+1',\n    '2 < 1+1',\n    'a = 3.2',\n    'b = 6-2.8',\n    '(a <= b)'\n  ],\n  seealso: [\n    'equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare'\n  ]\n}\n","export const unequalDocs = {\n  name: 'unequal',\n  category: 'Relational',\n  syntax: [\n    'x != y',\n    'unequal(x, y)'\n  ],\n  description:\n      'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',\n  examples: [\n    '2+2 != 3',\n    '2+2 != 4',\n    'a = 3.2',\n    'b = 6-2.8',\n    'a != b',\n    '50cm != 0.5m',\n    '5 cm != 2 inch'\n  ],\n  seealso: [\n    'equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual'\n  ]\n}\n","export const setCartesianDocs = {\n  name: 'setCartesian',\n  category: 'Set',\n  syntax: [\n    'setCartesian(set1, set2)'\n  ],\n  description:\n      'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.',\n  examples: [\n    'setCartesian([1, 2], [3, 4])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference', 'setPowerset'\n  ]\n}\n","export const setDifferenceDocs = {\n  name: 'setDifference',\n  category: 'Set',\n  syntax: [\n    'setDifference(set1, set2)'\n  ],\n  description:\n      'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setDifference([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setSymDifference'\n  ]\n}\n","export const setDistinctDocs = {\n  name: 'setDistinct',\n  category: 'Set',\n  syntax: [\n    'setDistinct(set)'\n  ],\n  description:\n      'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setDistinct([1, 1, 1, 2, 2, 3])'\n  ],\n  seealso: [\n    'setMultiplicity'\n  ]\n}\n","export const setIntersectDocs = {\n  name: 'setIntersect',\n  category: 'Set',\n  syntax: [\n    'setIntersect(set1, set2)'\n  ],\n  description:\n      'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setIntersect([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setUnion', 'setDifference'\n  ]\n}\n","export const setIsSubsetDocs = {\n  name: 'setIsSubset',\n  category: 'Set',\n  syntax: [\n    'setIsSubset(set1, set2)'\n  ],\n  description:\n      'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setIsSubset([1, 2], [3, 4, 5, 6])',\n    'setIsSubset([3, 4], [3, 4, 5, 6])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference'\n  ]\n}\n","export const setMultiplicityDocs = {\n  name: 'setMultiplicity',\n  category: 'Set',\n  syntax: [\n    'setMultiplicity(element, set)'\n  ],\n  description:\n      'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setMultiplicity(1, [1, 2, 2, 4])',\n    'setMultiplicity(2, [1, 2, 2, 4])'\n  ],\n  seealso: [\n    'setDistinct', 'setSize'\n  ]\n}\n","export const setPowersetDocs = {\n  name: 'setPowerset',\n  category: 'Set',\n  syntax: [\n    'setPowerset(set)'\n  ],\n  description:\n      'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setPowerset([1, 2, 3])'\n  ],\n  seealso: [\n    'setCartesian'\n  ]\n}\n","export const setSizeDocs = {\n  name: 'setSize',\n  category: 'Set',\n  syntax: [\n    'setSize(set)',\n    'setSize(set, unique)'\n  ],\n  description:\n      'Count the number of elements of a (multi)set. When the second parameter \"unique\" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setSize([1, 2, 2, 4])',\n    'setSize([1, 2, 2, 4], true)'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference'\n  ]\n}\n","export const setSymDifferenceDocs = {\n  name: 'setSymDifference',\n  category: 'Set',\n  syntax: [\n    'setSymDifference(set1, set2)'\n  ],\n  description:\n      'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference'\n  ]\n}\n","export const setUnionDocs = {\n  name: 'setUnion',\n  category: 'Set',\n  syntax: [\n    'setUnion(set1, set2)'\n  ],\n  description:\n      'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setUnion([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setIntersect', 'setDifference'\n  ]\n}\n","export const erfDocs = {\n  name: 'erf',\n  category: 'Special',\n  syntax: [\n    'erf(x)'\n  ],\n  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',\n  examples: [\n    'erf(0.2)',\n    'erf(-0.5)',\n    'erf(4)'\n  ],\n  seealso: []\n}\n","export const cumSumDocs = {\n  name: 'cumsum',\n  category: 'Statistics',\n  syntax: [\n    'cumsum(a, b, c, ...)',\n    'cumsum(A)'\n  ],\n  description: 'Compute the cumulative sum of all values.',\n  examples: [\n    'cumsum(2, 3, 4, 1)',\n    'cumsum([2, 3, 4, 1])',\n    'cumsum([1, 2; 3, 4])',\n    'cumsum([1, 2; 3, 4], 1)',\n    'cumsum([1, 2; 3, 4], 2)'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const madDocs = {\n  name: 'mad',\n  category: 'Statistics',\n  syntax: [\n    'mad(a, b, c, ...)',\n    'mad(A)'\n  ],\n  description: 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',\n  examples: [\n    'mad(10, 20, 30)',\n    'mad([1, 2, 3])'\n  ],\n  seealso: [\n    'mean',\n    'median',\n    'std',\n    'abs'\n  ]\n}\n","export const maxDocs = {\n  name: 'max',\n  category: 'Statistics',\n  syntax: [\n    'max(a, b, c, ...)',\n    'max(A)',\n    'max(A, dim)'\n  ],\n  description: 'Compute the maximum value of a list of values.',\n  examples: [\n    'max(2, 3, 4, 1)',\n    'max([2, 3, 4, 1])',\n    'max([2, 5; 4, 3])',\n    'max([2, 5; 4, 3], 1)',\n    'max([2, 5; 4, 3], 2)',\n    'max(2.7, 7.1, -4.5, 2.0, 4.1)',\n    'min(2.7, 7.1, -4.5, 2.0, 4.1)'\n  ],\n  seealso: [\n    'mean',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const meanDocs = {\n  name: 'mean',\n  category: 'Statistics',\n  syntax: [\n    'mean(a, b, c, ...)',\n    'mean(A)',\n    'mean(A, dim)'\n  ],\n  description: 'Compute the arithmetic mean of a list of values.',\n  examples: [\n    'mean(2, 3, 4, 1)',\n    'mean([2, 3, 4, 1])',\n    'mean([2, 5; 4, 3])',\n    'mean([2, 5; 4, 3], 1)',\n    'mean([2, 5; 4, 3], 2)',\n    'mean([1.0, 2.7, 3.2, 4.0])'\n  ],\n  seealso: [\n    'max',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const medianDocs = {\n  name: 'median',\n  category: 'Statistics',\n  syntax: [\n    'median(a, b, c, ...)',\n    'median(A)'\n  ],\n  description: 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',\n  examples: [\n    'median(5, 2, 7)',\n    'median([3, -1, 5, 7])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance',\n    'quantileSeq'\n  ]\n}\n","export const minDocs = {\n  name: 'min',\n  category: 'Statistics',\n  syntax: [\n    'min(a, b, c, ...)',\n    'min(A)',\n    'min(A, dim)'\n  ],\n  description: 'Compute the minimum value of a list of values.',\n  examples: [\n    'min(2, 3, 4, 1)',\n    'min([2, 3, 4, 1])',\n    'min([2, 5; 4, 3])',\n    'min([2, 5; 4, 3], 1)',\n    'min([2, 5; 4, 3], 2)',\n    'min(2.7, 7.1, -4.5, 2.0, 4.1)',\n    'max(2.7, 7.1, -4.5, 2.0, 4.1)'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'median',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const modeDocs = {\n  name: 'mode',\n  category: 'Statistics',\n  syntax: [\n    'mode(a, b, c, ...)',\n    'mode(A)',\n    'mode(A, a, b, B, c, ...)'\n  ],\n  description: 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',\n  examples: [\n    'mode(2, 1, 4, 3, 1)',\n    'mode([1, 2.7, 3.2, 4, 2.7])',\n    'mode(1, 4, 6, 1, 6)'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const prodDocs = {\n  name: 'prod',\n  category: 'Statistics',\n  syntax: [\n    'prod(a, b, c, ...)',\n    'prod(A)'\n  ],\n  description: 'Compute the product of all values.',\n  examples: [\n    'prod(2, 3, 4)',\n    'prod([2, 3, 4])',\n    'prod([2, 5; 4, 3])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'min',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const quantileSeqDocs = {\n  name: 'quantileSeq',\n  category: 'Statistics',\n  syntax: [\n    'quantileSeq(A, prob[, sorted])',\n    'quantileSeq(A, [prob1, prob2, ...][, sorted])',\n    'quantileSeq(A, N[, sorted])'\n  ],\n  description: 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probablity are: Number, BigNumber. \\n\\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',\n  examples: [\n    'quantileSeq([3, -1, 5, 7], 0.5)',\n    'quantileSeq([3, -1, 5, 7], [1/3, 2/3])',\n    'quantileSeq([3, -1, 5, 7], 2)',\n    'quantileSeq([-1, 3, 5, 7], 0.5, true)'\n  ],\n  seealso: [\n    'mean',\n    'median',\n    'min',\n    'max',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const stdDocs = {\n  name: 'std',\n  category: 'Statistics',\n  syntax: [\n    'std(a, b, c, ...)',\n    'std(A)',\n    'std(A, normalization)'\n  ],\n  description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  examples: [\n    'std(2, 4, 6)',\n    'std([2, 4, 6, 8])',\n    'std([2, 4, 6, 8], \"uncorrected\")',\n    'std([2, 4, 6, 8], \"biased\")',\n    'std([1, 2, 3; 4, 5, 6])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'prod',\n    'sum',\n    'variance'\n  ]\n}\n","export const sumDocs = {\n  name: 'sum',\n  category: 'Statistics',\n  syntax: [\n    'sum(a, b, c, ...)',\n    'sum(A)'\n  ],\n  description: 'Compute the sum of all values.',\n  examples: [\n    'sum(2, 3, 4, 1)',\n    'sum([2, 3, 4, 1])',\n    'sum([2, 5; 4, 3])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const varianceDocs = {\n  name: 'variance',\n  category: 'Statistics',\n  syntax: [\n    'variance(a, b, c, ...)',\n    'variance(A)',\n    'variance(A, normalization)'\n  ],\n  description: 'Compute the variance of all values. Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  examples: [\n    'variance(2, 4, 6)',\n    'variance([2, 4, 6, 8])',\n    'variance([2, 4, 6, 8], \"uncorrected\")',\n    'variance([2, 4, 6, 8], \"biased\")',\n    'variance([1, 2, 3; 4, 5, 6])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum'\n  ]\n}\n","export const acosDocs = {\n  name: 'acos',\n  category: 'Trigonometry',\n  syntax: [\n    'acos(x)'\n  ],\n  description: 'Compute the inverse cosine of a value in radians.',\n  examples: [\n    'acos(0.5)',\n    'acos(cos(2.3))'\n  ],\n  seealso: [\n    'cos',\n    'atan',\n    'asin'\n  ]\n}\n","export const acoshDocs = {\n  name: 'acosh',\n  category: 'Trigonometry',\n  syntax: [\n    'acosh(x)'\n  ],\n  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',\n  examples: [\n    'acosh(1.5)'\n  ],\n  seealso: [\n    'cosh',\n    'asinh',\n    'atanh'\n  ]\n}\n","export const acotDocs = {\n  name: 'acot',\n  category: 'Trigonometry',\n  syntax: [\n    'acot(x)'\n  ],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: [\n    'acot(0.5)',\n    'acot(cot(0.5))',\n    'acot(2)'\n  ],\n  seealso: [\n    'cot',\n    'atan'\n  ]\n}\n","export const acothDocs = {\n  name: 'acoth',\n  category: 'Trigonometry',\n  syntax: [\n    'acoth(x)'\n  ],\n  description: 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',\n  examples: [\n    'acoth(2)',\n    'acoth(0.5)'\n  ],\n  seealso: [\n    'acsch',\n    'asech'\n  ]\n}\n","export const acscDocs = {\n  name: 'acsc',\n  category: 'Trigonometry',\n  syntax: [\n    'acsc(x)'\n  ],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: [\n    'acsc(2)',\n    'acsc(csc(0.5))',\n    'acsc(0.5)'\n  ],\n  seealso: [\n    'csc',\n    'asin',\n    'asec'\n  ]\n}\n","export const acschDocs = {\n  name: 'acsch',\n  category: 'Trigonometry',\n  syntax: [\n    'acsch(x)'\n  ],\n  description: 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',\n  examples: [\n    'acsch(0.5)'\n  ],\n  seealso: [\n    'asech',\n    'acoth'\n  ]\n}\n","export const asecDocs = {\n  name: 'asec',\n  category: 'Trigonometry',\n  syntax: [\n    'asec(x)'\n  ],\n  description: 'Calculate the inverse secant of a value.',\n  examples: [\n    'asec(0.5)',\n    'asec(sec(0.5))',\n    'asec(2)'\n  ],\n  seealso: [\n    'acos',\n    'acot',\n    'acsc'\n  ]\n}\n","export const asechDocs = {\n  name: 'asech',\n  category: 'Trigonometry',\n  syntax: [\n    'asech(x)'\n  ],\n  description: 'Calculate the inverse secant of a value.',\n  examples: [\n    'asech(0.5)'\n  ],\n  seealso: [\n    'acsch',\n    'acoth'\n  ]\n}\n","export const asinDocs = {\n  name: 'asin',\n  category: 'Trigonometry',\n  syntax: [\n    'asin(x)'\n  ],\n  description: 'Compute the inverse sine of a value in radians.',\n  examples: [\n    'asin(0.5)',\n    'asin(sin(0.5))'\n  ],\n  seealso: [\n    'sin',\n    'acos',\n    'atan'\n  ]\n}\n","export const asinhDocs = {\n  name: 'asinh',\n  category: 'Trigonometry',\n  syntax: [\n    'asinh(x)'\n  ],\n  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',\n  examples: [\n    'asinh(0.5)'\n  ],\n  seealso: [\n    'acosh',\n    'atanh'\n  ]\n}\n","export const atanDocs = {\n  name: 'atan',\n  category: 'Trigonometry',\n  syntax: [\n    'atan(x)'\n  ],\n  description: 'Compute the inverse tangent of a value in radians.',\n  examples: [\n    'atan(0.5)',\n    'atan(tan(0.5))'\n  ],\n  seealso: [\n    'tan',\n    'acos',\n    'asin'\n  ]\n}\n","export const atanhDocs = {\n  name: 'atanh',\n  category: 'Trigonometry',\n  syntax: [\n    'atanh(x)'\n  ],\n  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',\n  examples: [\n    'atanh(0.5)'\n  ],\n  seealso: [\n    'acosh',\n    'asinh'\n  ]\n}\n","export const atan2Docs = {\n  name: 'atan2',\n  category: 'Trigonometry',\n  syntax: [\n    'atan2(y, x)'\n  ],\n  description:\n      'Computes the principal value of the arc tangent of y/x in radians.',\n  examples: [\n    'atan2(2, 2) / pi',\n    'angle = 60 deg in rad',\n    'x = cos(angle)',\n    'y = sin(angle)',\n    'atan2(y, x)'\n  ],\n  seealso: [\n    'sin',\n    'cos',\n    'tan'\n  ]\n}\n","export const cosDocs = {\n  name: 'cos',\n  category: 'Trigonometry',\n  syntax: [\n    'cos(x)'\n  ],\n  description: 'Compute the cosine of x in radians.',\n  examples: [\n    'cos(2)',\n    'cos(pi / 4) ^ 2',\n    'cos(180 deg)',\n    'cos(60 deg)',\n    'sin(0.2)^2 + cos(0.2)^2'\n  ],\n  seealso: [\n    'acos',\n    'sin',\n    'tan'\n  ]\n}\n","export const coshDocs = {\n  name: 'cosh',\n  category: 'Trigonometry',\n  syntax: [\n    'cosh(x)'\n  ],\n  description: 'Compute the hyperbolic cosine of x in radians.',\n  examples: [\n    'cosh(0.5)'\n  ],\n  seealso: [\n    'sinh',\n    'tanh',\n    'coth'\n  ]\n}\n","export const cotDocs = {\n  name: 'cot',\n  category: 'Trigonometry',\n  syntax: [\n    'cot(x)'\n  ],\n  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',\n  examples: [\n    'cot(2)',\n    '1 / tan(2)'\n  ],\n  seealso: [\n    'sec',\n    'csc',\n    'tan'\n  ]\n}\n","export const cothDocs = {\n  name: 'coth',\n  category: 'Trigonometry',\n  syntax: [\n    'coth(x)'\n  ],\n  description: 'Compute the hyperbolic cotangent of x in radians.',\n  examples: [\n    'coth(2)',\n    '1 / tanh(2)'\n  ],\n  seealso: [\n    'sech',\n    'csch',\n    'tanh'\n  ]\n}\n","export const cscDocs = {\n  name: 'csc',\n  category: 'Trigonometry',\n  syntax: [\n    'csc(x)'\n  ],\n  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',\n  examples: [\n    'csc(2)',\n    '1 / sin(2)'\n  ],\n  seealso: [\n    'sec',\n    'cot',\n    'sin'\n  ]\n}\n","export const cschDocs = {\n  name: 'csch',\n  category: 'Trigonometry',\n  syntax: [\n    'csch(x)'\n  ],\n  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',\n  examples: [\n    'csch(2)',\n    '1 / sinh(2)'\n  ],\n  seealso: [\n    'sech',\n    'coth',\n    'sinh'\n  ]\n}\n","export const secDocs = {\n  name: 'sec',\n  category: 'Trigonometry',\n  syntax: [\n    'sec(x)'\n  ],\n  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',\n  examples: [\n    'sec(2)',\n    '1 / cos(2)'\n  ],\n  seealso: [\n    'cot',\n    'csc',\n    'cos'\n  ]\n}\n","export const sechDocs = {\n  name: 'sech',\n  category: 'Trigonometry',\n  syntax: [\n    'sech(x)'\n  ],\n  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',\n  examples: [\n    'sech(2)',\n    '1 / cosh(2)'\n  ],\n  seealso: [\n    'coth',\n    'csch',\n    'cosh'\n  ]\n}\n","export const sinDocs = {\n  name: 'sin',\n  category: 'Trigonometry',\n  syntax: [\n    'sin(x)'\n  ],\n  description: 'Compute the sine of x in radians.',\n  examples: [\n    'sin(2)',\n    'sin(pi / 4) ^ 2',\n    'sin(90 deg)',\n    'sin(30 deg)',\n    'sin(0.2)^2 + cos(0.2)^2'\n  ],\n  seealso: [\n    'asin',\n    'cos',\n    'tan'\n  ]\n}\n","export const sinhDocs = {\n  name: 'sinh',\n  category: 'Trigonometry',\n  syntax: [\n    'sinh(x)'\n  ],\n  description: 'Compute the hyperbolic sine of x in radians.',\n  examples: [\n    'sinh(0.5)'\n  ],\n  seealso: [\n    'cosh',\n    'tanh'\n  ]\n}\n","export const tanDocs = {\n  name: 'tan',\n  category: 'Trigonometry',\n  syntax: [\n    'tan(x)'\n  ],\n  description: 'Compute the tangent of x in radians.',\n  examples: [\n    'tan(0.5)',\n    'sin(0.5) / cos(0.5)',\n    'tan(pi / 4)',\n    'tan(45 deg)'\n  ],\n  seealso: [\n    'atan',\n    'sin',\n    'cos'\n  ]\n}\n","export const tanhDocs = {\n  name: 'tanh',\n  category: 'Trigonometry',\n  syntax: [\n    'tanh(x)'\n  ],\n  description: 'Compute the hyperbolic tangent of x in radians.',\n  examples: [\n    'tanh(0.5)',\n    'sinh(0.5) / cosh(0.5)'\n  ],\n  seealso: [\n    'sinh',\n    'cosh'\n  ]\n}\n","export const toDocs = {\n  name: 'to',\n  category: 'Units',\n  syntax: [\n    'x to unit',\n    'to(x, unit)'\n  ],\n  description: 'Change the unit of a value.',\n  examples: [\n    '5 inch to cm',\n    '3.2kg to g',\n    '16 bytes in bits'\n  ],\n  seealso: []\n}\n","export const cloneDocs = {\n  name: 'clone',\n  category: 'Utils',\n  syntax: [\n    'clone(x)'\n  ],\n  description: 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices',\n  examples: [\n    'clone(3.5)',\n    'clone(2 - 4i)',\n    'clone(45 deg)',\n    'clone([1, 2; 3, 4])',\n    'clone(\"hello world\")'\n  ],\n  seealso: []\n}\n","export const formatDocs = {\n  name: 'format',\n  category: 'Utils',\n  syntax: [\n    'format(value)',\n    'format(value, precision)'\n  ],\n  description: 'Format a value of any type as string.',\n  examples: [\n    'format(2.3)',\n    'format(3 - 4i)',\n    'format([])',\n    'format(pi, 3)'\n  ],\n  seealso: ['print']\n}\n","export const binDocs = {\n  name: 'bin',\n  category: 'Utils',\n  syntax: [\n    'bin(value)'\n  ],\n  description: 'Format a number as binary',\n  examples: [\n    'bin(2)'\n  ],\n  seealso: ['oct', 'hex']\n}\n","export const octDocs = {\n  name: 'oct',\n  category: 'Utils',\n  syntax: [\n    'oct(value)'\n  ],\n  description: 'Format a number as octal',\n  examples: [\n    'oct(56)'\n  ],\n  seealso: ['bin', 'hex']\n}\n","export const hexDocs = {\n  name: 'hex',\n  category: 'Utils',\n  syntax: [\n    'hex(value)'\n  ],\n  description: 'Format a number as hexadecimal',\n  examples: [\n    'hex(240)'\n  ],\n  seealso: ['bin', 'oct']\n}\n","export const isNaNDocs = {\n  name: 'isNaN',\n  category: 'Utils',\n  syntax: [\n    'isNaN(x)'\n  ],\n  description: 'Test whether a value is NaN (not a number)',\n  examples: [\n    'isNaN(2)',\n    'isNaN(0 / 0)',\n    'isNaN(NaN)',\n    'isNaN(Infinity)'\n  ],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n}\n","export const isIntegerDocs = {\n  name: 'isInteger',\n  category: 'Utils',\n  syntax: [\n    'isInteger(x)'\n  ],\n  description: 'Test whether a value is an integer number.',\n  examples: [\n    'isInteger(2)',\n    'isInteger(3.5)',\n    'isInteger([3, 0.5, -2])'\n  ],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n}\n","export const isNegativeDocs = {\n  name: 'isNegative',\n  category: 'Utils',\n  syntax: [\n    'isNegative(x)'\n  ],\n  description: 'Test whether a value is negative: smaller than zero.',\n  examples: [\n    'isNegative(2)',\n    'isNegative(0)',\n    'isNegative(-4)',\n    'isNegative([3, 0.5, -2])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']\n}\n","export const isNumericDocs = {\n  name: 'isNumeric',\n  category: 'Utils',\n  syntax: [\n    'isNumeric(x)'\n  ],\n  description: 'Test whether a value is a numeric value. ' +\n    'Returns true when the input is a number, BigNumber, Fraction, or boolean.',\n  examples: [\n    'isNumeric(2)',\n    'isNumeric(\"2\")',\n    'hasNumericValue(\"2\")',\n    'isNumeric(0)',\n    'isNumeric(bignumber(500))',\n    'isNumeric(fraction(0.125))',\n    'isNumeric(2 + 3i)',\n    'isNumeric([2.3, \"foo\", false])'\n  ],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']\n}\n","export const hasNumericValueDocs = {\n  name: 'hasNumericValue',\n  category: 'Utils',\n  syntax: [\n    'hasNumericValue(x)'\n  ],\n  description: 'Test whether a value is an numeric value. ' +\n    'In case of a string, true is returned if the string contains a numeric value.',\n  examples: [\n    'hasNumericValue(2)',\n    'hasNumericValue(\"2\")',\n    'isNumeric(\"2\")',\n    'hasNumericValue(0)',\n    'hasNumericValue(bignumber(500))',\n    'hasNumericValue(fraction(0.125))',\n    'hasNumericValue(2 + 3i)',\n    'hasNumericValue([2.3, \"foo\", false])'\n  ],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']\n}\n","export const isPositiveDocs = {\n  name: 'isPositive',\n  category: 'Utils',\n  syntax: [\n    'isPositive(x)'\n  ],\n  description: 'Test whether a value is positive: larger than zero.',\n  examples: [\n    'isPositive(2)',\n    'isPositive(0)',\n    'isPositive(-4)',\n    'isPositive([3, 0.5, -2])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n}\n","export const isPrimeDocs = {\n  name: 'isPrime',\n  category: 'Utils',\n  syntax: [\n    'isPrime(x)'\n  ],\n  description: 'Test whether a value is prime: has no divisors other than itself and one.',\n  examples: [\n    'isPrime(3)',\n    'isPrime(-2)',\n    'isPrime([2, 17, 100])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n}\n","export const isZeroDocs = {\n  name: 'isZero',\n  category: 'Utils',\n  syntax: [\n    'isZero(x)'\n  ],\n  description: 'Test whether a value is zero.',\n  examples: [\n    'isZero(2)',\n    'isZero(0)',\n    'isZero(-4)',\n    'isZero([3, 0, -2, 0])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']\n}\n","export const printDocs = {\n  name: 'print',\n  category: 'Utils',\n  syntax: [\n    'print(template, values)',\n    'print(template, values, precision)'\n  ],\n  description: 'Interpolate values into a string template.',\n  examples: [\n    'print(\"Lucy is $age years old\", {age: 5})',\n    'print(\"The value of pi is $pi\", {pi: pi}, 3)',\n    'print(\"Hello, $user.name!\", {user: {name: \"John\"}})',\n    'print(\"Values: $0, $1, $2\", [6, 9, 4])'\n  ],\n  seealso: ['format']\n}\n","export const typeOfDocs = {\n  name: 'typeOf',\n  category: 'Utils',\n  syntax: [\n    'typeOf(x)'\n  ],\n  description: 'Get the type of a variable.',\n  examples: [\n    'typeOf(3.5)',\n    'typeOf(2 - 4i)',\n    'typeOf(45 deg)',\n    'typeOf(\"hello world\")'\n  ],\n  seealso: ['getMatrixDataType']\n}\n","export const numericDocs = {\n  name: 'numeric',\n  category: 'Utils',\n  syntax: [\n    'numeric(x)'\n  ],\n  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.',\n  examples: [\n    'numeric(\"4\")',\n    'numeric(\"4\", \"number\")',\n    'numeric(\"4\", \"BigNumber\")',\n    'numeric(\"4\", \"Fraction)',\n    'numeric(4, \"Fraction\")',\n    'numeric(fraction(2, 5), \"number)'\n  ],\n  seealso: ['number', 'fraction', 'bignumber', 'string', 'format']\n}\n","import { factory } from '../../utils/factory.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { embeddedDocs } from '../embeddedDocs/embeddedDocs.js'\nimport { hasOwnProperty } from '../../utils/object.js'\n\nconst name = 'help'\nconst dependencies = ['typed', 'mathWithTransform', 'Help']\n\nexport const createHelp = /* #__PURE__ */ factory(name, dependencies, ({ typed, mathWithTransform, Help }) => {\n  /**\n   * Retrieve help on a function or data type.\n   * Help files are retrieved from the embedded documentation in math.docs.\n   *\n   * Syntax:\n   *\n   *    math.help(search)\n   *\n   * Examples:\n   *\n   *    console.log(math.help('sin').toString())\n   *    console.log(math.help(math.add).toString())\n   *    console.log(math.help(math.add).toJSON())\n   *\n   * @param {Function | string | Object} search   A function or function name\n   *                                              for which to get help\n   * @return {Help} A help object\n   */\n  return typed(name, {\n    any: function (search) {\n      let prop\n      let searchName = search\n\n      if (typeof search !== 'string') {\n        for (prop in mathWithTransform) {\n          // search in functions and constants\n          if (hasOwnProperty(mathWithTransform, prop) && (search === mathWithTransform[prop])) {\n            searchName = prop\n            break\n          }\n        }\n\n        /* TODO: implement help for data types\n         if (!text) {\n         // search data type\n         for (prop in math.type) {\n         if (hasOwnProperty(math, prop)) {\n         if (search === math.type[prop]) {\n         text = prop\n         break\n         }\n         }\n         }\n         }\n         */\n      }\n\n      const doc = getSafeProperty(embeddedDocs, searchName)\n      if (!doc) {\n        const searchText = typeof searchName === 'function' ? searchName.name : searchName\n        throw new Error('No documentation found on \"' + searchText + '\"')\n      }\n      return new Help(doc)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'chain'\nconst dependencies = ['typed', 'Chain']\n\nexport const createChain = /* #__PURE__ */ factory(name, dependencies, ({ typed, Chain }) => {\n  /**\n   * Wrap any value in a chain, allowing to perform chained operations on\n   * the value.\n   *\n   * All methods available in the math.js library can be called upon the chain,\n   * and then will be evaluated with the value itself as first argument.\n   * The chain can be closed by executing `chain.done()`, which returns\n   * the final value.\n   *\n   * The chain has a number of special functions:\n   *\n   * - `done()`     Finalize the chain and return the chain's value.\n   * - `valueOf()`  The same as `done()`\n   * - `toString()` Executes `math.format()` onto the chain's value, returning\n   *                a string representation of the value.\n   *\n   * Syntax:\n   *\n   *    math.chain(value)\n   *\n   * Examples:\n   *\n   *     math.chain(3)\n   *         .add(4)\n   *         .subtract(2)\n   *         .done()     // 5\n   *\n   *     math.chain( [[1, 2], [3, 4]] )\n   *         .subset(math.index(0, 0), 8)\n   *         .multiply(3)\n   *         .done()     // [[24, 6], [9, 12]]\n   *\n   * @param {*} [value]   A value of any type on which to start a chained operation.\n   * @return {math.Chain} The created chain\n   */\n  return typed(name, {\n    '': function () {\n      return new Chain()\n    },\n\n    any: function (value) {\n      return new Chain(value)\n    }\n  })\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'det'\nconst dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup']\n\nexport const createDet = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtract, multiply, unaryMinus, lup }) => {\n  /**\n   * Calculate the determinant of a matrix.\n   *\n   * Syntax:\n   *\n   *    math.det(x)\n   *\n   * Examples:\n   *\n   *    math.det([[1, 2], [3, 4]]) // returns -2\n   *\n   *    const A = [\n   *      [-2, 2, 3],\n   *      [-1, 1, 3],\n   *      [2, 0, -1]\n   *    ]\n   *    math.det(A) // returns 6\n   *\n   * See also:\n   *\n   *    inv\n   *\n   * @param {Array | Matrix} x  A matrix\n   * @return {number} The determinant of `x`\n   */\n  return typed(name, {\n    any: function (x) {\n      return clone(x)\n    },\n\n    'Array | Matrix': function det (x) {\n      let size\n      if (isMatrix(x)) {\n        size = x.size()\n      } else if (Array.isArray(x)) {\n        x = matrix(x)\n        size = x.size()\n      } else {\n        // a scalar\n        size = []\n      }\n\n      switch (size.length) {\n        case 0:\n          // scalar\n          return clone(x)\n\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            return clone(x.valueOf()[0])\n          } else {\n            throw new RangeError('Matrix must be square ' +\n            '(size: ' + format(size) + ')')\n          }\n\n        case 2:\n        {\n          // two dimensional array\n          const rows = size[0]\n          const cols = size[1]\n          if (rows === cols) {\n            return _det(x.clone().valueOf(), rows, cols)\n          } else {\n            throw new RangeError('Matrix must be square ' +\n              '(size: ' + format(size) + ')')\n          }\n        }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' +\n          '(size: ' + format(size) + ')')\n      }\n    }\n  })\n\n  /**\n   * Calculate the determinant of a matrix\n   * @param {Array[]} matrix  A square, two dimensional matrix\n   * @param {number} rows     Number of rows of the matrix (zero-based)\n   * @param {number} cols     Number of columns of the matrix (zero-based)\n   * @returns {number} det\n   * @private\n   */\n  function _det (matrix, rows, cols) {\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      return clone(matrix[0][0])\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12\n      return subtract(\n        multiply(matrix[0][0], matrix[1][1]),\n        multiply(matrix[1][0], matrix[0][1])\n      )\n    } else {\n      // Compute the LU decomposition\n      const decomp = lup(matrix)\n\n      // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)\n      let det = decomp.U[0][0]\n      for (let i = 1; i < rows; i++) {\n        det = multiply(det, decomp.U[i][i])\n      }\n\n      // The determinant will be multiplied by 1 or -1 depending on the parity of the permutation matrix.\n      // This can be determined by counting the cycles. This is roughly a linear time algorithm.\n      let evenCycles = 0\n      let i = 0\n      const visited = []\n      while (true) {\n        while (visited[i]) {\n          i++\n        }\n        if (i >= rows) break\n        let j = i\n        let cycleLen = 0\n        while (!visited[decomp.p[j]]) {\n          visited[decomp.p[j]] = true\n          j = decomp.p[j]\n          cycleLen++\n        }\n        if (cycleLen % 2 === 0) {\n          evenCycles++\n        }\n      }\n\n      return evenCycles % 2 === 0 ? det : unaryMinus(det)\n    }\n  }\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { format } from '../../utils/string.js'\n\nconst name = 'inv'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'addScalar',\n  'multiply',\n  'unaryMinus',\n  'det',\n  'identity',\n  'abs'\n]\n\nexport const createInv = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, addScalar, multiply, unaryMinus, det, identity, abs }) => {\n  /**\n   * Calculate the inverse of a square matrix.\n   *\n   * Syntax:\n   *\n   *     math.inv(x)\n   *\n   * Examples:\n   *\n   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]\n   *     math.inv(4)                 // returns 0.25\n   *     1 / 4                       // returns 0.25\n   *\n   * See also:\n   *\n   *     det, transpose\n   *\n   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed\n   * @return {number | Complex | Array | Matrix} The inverse of `x`.\n   */\n  return typed(name, {\n    'Array | Matrix': function (x) {\n      const size = isMatrix(x) ? x.size() : arraySize(x)\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if (isMatrix(x)) {\n              return matrix([\n                divideScalar(1, x.valueOf()[0])\n              ])\n            } else {\n              return [\n                divideScalar(1, x[0])\n              ]\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' +\n            '(size: ' + format(size) + ')')\n          }\n\n        case 2:\n        // two dimensional array\n        {\n          const rows = size[0]\n          const cols = size[1]\n          if (rows === cols) {\n            if (isMatrix(x)) {\n              return matrix(\n                _inv(x.valueOf(), rows, cols),\n                x.storage()\n              )\n            } else {\n              // return an Array\n              return _inv(x, rows, cols)\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' +\n              '(size: ' + format(size) + ')')\n          }\n        }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' +\n          '(size: ' + format(size) + ')')\n      }\n    },\n\n    any: function (x) {\n      // scalar\n      return divideScalar(1, x) // FIXME: create a BigNumber one when configured for bignumbers\n    }\n  })\n\n  /**\n   * Calculate the inverse of a square matrix\n   * @param {Array[]} mat     A square matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns, must equal rows\n   * @return {Array[]} inv    Inverse matrix\n   * @private\n   */\n  function _inv (mat, rows, cols) {\n    let r, s, f, value, temp\n\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0]\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero')\n      }\n      return [[\n        divideScalar(1, value)\n      ]]\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      const d = det(mat)\n      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero')\n      }\n      return [\n        [\n          divideScalar(mat[1][1], d),\n          divideScalar(unaryMinus(mat[0][1]), d)\n        ],\n        [\n          divideScalar(unaryMinus(mat[1][0]), d),\n          divideScalar(mat[0][0], d)\n        ]\n      ]\n    } else {\n      // this is a matrix of 3 x 3 or larger\n      // calculate inverse using gauss-jordan elimination\n      //      https://en.wikipedia.org/wiki/Gaussian_elimination\n      //      http://mathworld.wolfram.com/MatrixInverse.html\n      //      http://math.uww.edu/~mcfarlat/inverse.htm\n\n      // make a copy of the matrix (only the arrays, not of the elements)\n      const A = mat.concat()\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat()\n      }\n\n      // create an identity matrix which in the end will contain the\n      // matrix inverse\n      const B = identity(rows).valueOf()\n\n      // loop over all columns, and perform row reductions\n      for (let c = 0; c < cols; c++) {\n        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]\n        let ABig = abs(A[c][c])\n        let rBig = c\n        r = c + 1\n        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c])\n            rBig = r\n          }\n          r++\n        }\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero')\n        }\n        r = rBig\n        if (r !== c) {\n          temp = A[c]; A[c] = A[r]; A[r] = temp\n          temp = B[c]; B[c] = B[r]; B[r] = temp\n        }\n\n        // eliminate non-zero values on the other rows at column c\n        const Ac = A[c]\n        const Bc = B[c]\n        for (r = 0; r < rows; r++) {\n          const Ar = A[r]\n          const Br = B[r]\n          if (r !== c) {\n            // eliminate value at column c and row r\n            if (Ar[c] !== 0) {\n              f = divideScalar(unaryMinus(Ar[c]), Ac[c])\n\n              // add (f * row c) to row r to eliminate the value\n              // at column c\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]))\n              }\n              for (s = 0; s < cols; s++) {\n                Br[s] = addScalar(Br[s], multiply(f, Bc[s]))\n              }\n            }\n          } else {\n            // normalize value at Acc to 1,\n            // divide each value on row r with the value at Acc\n            f = Ac[c]\n            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f)\n            }\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f)\n            }\n          }\n        }\n      }\n      return B\n    }\n  }\n})\n","import { clone } from '../../../utils/object.js'\n\nexport function createComplexEigs ({ addScalar, subtract, flatten, multiply, multiplyScalar, divideScalar, sqrt, abs, bignumber, diag, inv, qr, usolve, usolveAll, equal, complex, larger, smaller, matrixFromColumns, dot }) {\n  /**\n   * @param {number[][]} arr the matrix to find eigenvalues of\n   * @param {number} N size of the matrix\n   * @param {number|BigNumber} prec precision, anything lower will be considered zero\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors should we find eigenvectors?\n   *\n   * @returns {{ values: number[], vectors: number[][] }}\n   */\n  function complexEigs (arr, N, prec, type, findVectors) {\n    if (findVectors === undefined) {\n      findVectors = true\n    }\n\n    // TODO check if any row/col are zero except the diagonal\n\n    // make sure corresponding rows and columns have similar magnitude\n    // important because of numerical stability\n    // MODIFIES arr by side effect!\n    const R = balance(arr, N, prec, type, findVectors)\n\n    // R is the row transformation matrix\n    // arr = A' = R A R⁻¹, A is the original matrix\n    // (if findVectors is false, R is undefined)\n    // (And so to return to original matrix: A = R⁻¹ arr R)\n\n    // TODO if magnitudes of elements vary over many orders,\n    // move greatest elements to the top left corner\n\n    // using similarity transformations, reduce the matrix\n    // to Hessenberg form (upper triangular plus one subdiagonal row)\n    // updates the transformation matrix R with new row operationsq\n    // MODIFIES arr by side effect!\n    reduceToHessenberg(arr, N, prec, type, findVectors, R)\n    // still true that original A = R⁻¹ arr R)\n\n    // find eigenvalues\n    const { values, C } = iterateUntilTriangular(arr, N, prec, type, findVectors)\n\n    // values is the list of eigenvalues, C is the column\n    // transformation matrix that transforms arr, the hessenberg\n    // matrix, to upper triangular\n    // (So U = C⁻¹ arr C and the relationship between current arr\n    // and original A is unchanged.)\n\n    let vectors\n\n    if (findVectors) {\n      vectors = findEigenvectors(arr, N, C, R, values, prec, type)\n      vectors = matrixFromColumns(...vectors)\n    }\n\n    return { values, vectors }\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]}\n   */\n  function balance (arr, N, prec, type, findVectors) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const realzero = big ? bignumber(0) : 0\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n    const realone = big ? bignumber(1) : 1\n\n    // base of the floating-point arithmetic\n    const radix = big ? bignumber(10) : 2\n    const radixSq = multiplyScalar(radix, radix)\n\n    // the diagonal transformation matrix R\n    let Rdiag\n    if (findVectors) {\n      Rdiag = Array(N).fill(one)\n    }\n\n    // this isn't the only time we loop thru the matrix...\n    let last = false\n\n    while (!last) {\n      // ...haha I'm joking! unless...\n      last = true\n\n      for (let i = 0; i < N; i++) {\n        // compute the taxicab norm of i-th column and row\n        // TODO optimize for complex numbers\n        let colNorm = realzero\n        let rowNorm = realzero\n\n        for (let j = 0; j < N; j++) {\n          if (i === j) continue\n          const c = abs(arr[i][j]) // should be real\n          colNorm = addScalar(colNorm, c)\n          rowNorm = addScalar(rowNorm, c)\n        }\n\n        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {\n          // find integer power closest to balancing the matrix\n          // (we want to scale only by integer powers of radix,\n          // so that we don't lose any precision due to round-off)\n\n          let f = realone\n          let c = colNorm\n\n          const rowDivRadix = divideScalar(rowNorm, radix)\n          const rowMulRadix = multiplyScalar(rowNorm, radix)\n\n          while (smaller(c, rowDivRadix)) {\n            c = multiplyScalar(c, radixSq)\n            f = multiplyScalar(f, radix)\n          }\n          while (larger(c, rowMulRadix)) {\n            c = divideScalar(c, radixSq)\n            f = divideScalar(f, radix)\n          }\n\n          // check whether balancing is needed\n          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)\n          const condition = smaller(divideScalar(addScalar(c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95))\n\n          // apply balancing similarity transformation\n          if (condition) {\n            // we should loop once again to check whether\n            // another rebalancing is needed\n            last = false\n\n            const g = divideScalar(1, f)\n\n            for (let j = 0; j < N; j++) {\n              if (i === j) {\n                continue\n              }\n              arr[i][j] = multiplyScalar(arr[i][j], f)\n              arr[j][i] = multiplyScalar(arr[j][i], g)\n            }\n\n            // keep track of transformations\n            if (findVectors) {\n              Rdiag[i] = multiplyScalar(Rdiag[i], f)\n            }\n          }\n        }\n      }\n    }\n\n    // return the diagonal row transformation matrix\n    return diag(Rdiag)\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors\n   * @param {number[][]} R the row transformation matrix that will be modified\n   */\n  function reduceToHessenberg (arr, N, prec, type, findVectors, R) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const zero = big ? bignumber(0) : cplx ? complex(0) : 0\n\n    if (big) { prec = bignumber(prec) }\n\n    for (let i = 0; i < N - 2; i++) {\n      // Find the largest subdiag element in the i-th col\n\n      let maxIndex = 0\n      let max = zero\n\n      for (let j = i + 1; j < N; j++) {\n        const el = arr[j][i]\n        if (smaller(abs(max), abs(el))) {\n          max = el\n          maxIndex = j\n        }\n      }\n\n      // This col is pivoted, no need to do anything\n      if (smaller(abs(max), prec)) {\n        continue\n      }\n\n      if (maxIndex !== i + 1) {\n        // Interchange maxIndex-th and (i+1)-th row\n        const tmp1 = arr[maxIndex]\n        arr[maxIndex] = arr[i + 1]\n        arr[i + 1] = tmp1\n\n        // Interchange maxIndex-th and (i+1)-th column\n        for (let j = 0; j < N; j++) {\n          const tmp2 = arr[j][maxIndex]\n          arr[j][maxIndex] = arr[j][i + 1]\n          arr[j][i + 1] = tmp2\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          const tmp3 = R[maxIndex]\n          R[maxIndex] = R[i + 1]\n          R[i + 1] = tmp3\n        }\n      }\n\n      // Reduce following rows and columns\n      for (let j = i + 2; j < N; j++) {\n        const n = divideScalar(arr[j][i], max)\n\n        if (n === 0) {\n          continue\n        }\n\n        // from j-th row subtract n-times (i+1)th row\n        for (let k = 0; k < N; k++) {\n          arr[j][k] = subtract(arr[j][k], multiplyScalar(n, arr[i + 1][k]))\n        }\n\n        // to (i+1)th column add n-times j-th column\n        for (let k = 0; k < N; k++) {\n          arr[k][i + 1] = addScalar(arr[k][i + 1], multiplyScalar(n, arr[k][j]))\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          for (let k = 0; k < N; k++) {\n            R[j][k] = subtract(R[j][k], multiplyScalar(n, R[i + 1][k]))\n          }\n        }\n      }\n    }\n\n    return R\n  }\n\n  /**\n   * @returns {{values: values, C: Matrix}}\n   * @see Press, Wiliams: Numerical recipes in Fortran 77\n   * @see https://en.wikipedia.org/wiki/QR_algorithm\n   */\n  function iterateUntilTriangular (A, N, prec, type, findVectors) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    if (big) { prec = bignumber(prec) }\n\n    // The Francis Algorithm\n    // The core idea of this algorithm is that doing successive\n    // A' = Q⁺AQ transformations will eventually converge to block-\n    // upper-triangular with diagonal blocks either 1x1 or 2x2.\n    // The Q here is the one from the QR decomposition, A = QR.\n    // Since the eigenvalues of a block-upper-triangular matrix are\n    // the eigenvalues of its diagonal blocks and we know how to find\n    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.\n\n    let arr = clone(A)\n\n    // the list of converged eigenvalues\n    const lambdas = []\n\n    // size of arr, which will get smaller as eigenvalues converge\n    let n = N\n\n    // the diagonal of the block-diagonal matrix that turns\n    // converged 2x2 matrices into upper triangular matrices\n    const Sdiag = []\n\n    // N×N matrix describing the overall transformation done during the QR algorithm\n    let Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined\n\n    // n×n matrix describing the QR transformations done since last convergence\n    let Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined\n\n    // last eigenvalue converged before this many steps\n    let lastConvergenceBefore = 0\n\n    while (lastConvergenceBefore <= 100) {\n      lastConvergenceBefore += 1\n\n      // TODO if the convergence is slow, do something clever\n\n      // Perform the factorization\n\n      const k = 0 // TODO set close to an eigenvalue\n\n      for (let i = 0; i < n; i++) {\n        arr[i][i] = subtract(arr[i][i], k)\n      }\n\n      // TODO do an implicit QR transformation\n      const { Q, R } = qr(arr)\n      arr = multiply(R, Q)\n\n      for (let i = 0; i < n; i++) {\n        arr[i][i] = addScalar(arr[i][i], k)\n      }\n\n      // keep track of transformations\n      if (findVectors) {\n        Qpartial = multiply(Qpartial, Q)\n      }\n\n      // The rightmost diagonal element converged to an eigenvalue\n      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {\n        lastConvergenceBefore = 0\n        lambdas.push(arr[n - 1][n - 1])\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift([[1]])\n          inflateMatrix(Qpartial, N)\n          Qtotal = multiply(Qtotal, Qpartial)\n\n          if (n > 1) {\n            Qpartial = diag(Array(n - 1).fill(one))\n          }\n        }\n\n        // reduce the matrix size\n        n -= 1\n        arr.pop()\n        for (let i = 0; i < n; i++) {\n          arr[i].pop()\n        }\n\n      // The rightmost diagonal 2x2 block converged\n      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {\n        lastConvergenceBefore = 0\n        const ll = eigenvalues2x2(\n          arr[n - 2][n - 2], arr[n - 2][n - 1],\n          arr[n - 1][n - 2], arr[n - 1][n - 1]\n        )\n        lambdas.push(...ll)\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift(jordanBase2x2(\n            arr[n - 2][n - 2], arr[n - 2][n - 1],\n            arr[n - 1][n - 2], arr[n - 1][n - 1],\n            ll[0], ll[1], prec, type\n          ))\n          inflateMatrix(Qpartial, N)\n          Qtotal = multiply(Qtotal, Qpartial)\n\n          if (n > 2) {\n            Qpartial = diag(Array(n - 2).fill(one))\n          }\n        }\n\n        // reduce the matrix size\n        n -= 2\n        arr.pop()\n        arr.pop()\n        for (let i = 0; i < n; i++) {\n          arr[i].pop()\n          arr[i].pop()\n        }\n      }\n\n      if (n === 0) {\n        break\n      }\n    }\n\n    // standard sorting\n    lambdas.sort((a, b) => +subtract(abs(a), abs(b)))\n\n    // the algorithm didn't converge\n    if (lastConvergenceBefore > 100) {\n      const err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '))\n      err.values = lambdas\n      err.vectors = []\n      throw err\n    }\n\n    // combine the overall QR transformation Qtotal with the subsequent\n    // transformation S that turns the diagonal 2x2 blocks to upper triangular\n    const C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined\n\n    return { values: lambdas, C }\n  }\n\n  /**\n   * @param {Matrix} A hessenberg-form matrix\n   * @param {number} N size of A\n   * @param {Matrix} C column transformation matrix that turns A into upper triangular\n   * @param {Matrix} R similarity that turns original matrix into A\n   * @param {number[]} values array of eigenvalues of A\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]} eigenvalues\n   */\n  function findEigenvectors (A, N, C, R, values, prec, type) {\n    const Cinv = inv(C)\n    const U = multiply(Cinv, A, C)\n\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const zero = big ? bignumber(0) : cplx ? complex(0) : 0\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    // turn values into a kind of \"multiset\"\n    // this way it is easier to find eigenvectors\n    const uniqueValues = []\n    const multiplicities = []\n\n    for (const λ of values) {\n      const i = indexOf(uniqueValues, λ, equal)\n\n      if (i === -1) {\n        uniqueValues.push(λ)\n        multiplicities.push(1)\n      } else {\n        multiplicities[i] += 1\n      }\n    }\n\n    // find eigenvectors by solving U − λE = 0\n    // TODO replace with an iterative eigenvector algorithm\n    // (this one might fail for imprecise eigenvalues)\n\n    const vectors = []\n    const len = uniqueValues.length\n    const b = Array(N).fill(zero)\n    const E = diag(Array(N).fill(one))\n\n    // eigenvalues for which usolve failed (due to numerical error)\n    const failedLambdas = []\n\n    for (let i = 0; i < len; i++) {\n      const λ = uniqueValues[i]\n      const S = subtract(U, multiply(λ, E)) // the characteristic matrix\n\n      let solutions = usolveAll(S, b)\n      solutions.shift() // ignore the null vector\n\n      // looks like we missed something, try inverse iteration\n      while (solutions.length < multiplicities[i]) {\n        const approxVec = inverseIterate(S, N, solutions, prec, type)\n\n        if (approxVec == null) {\n          // no more vectors were found\n          failedLambdas.push(λ)\n          break\n        }\n\n        solutions.push(approxVec)\n      }\n\n      // Transform back into original array coordinates\n      const correction = multiply(inv(R), C)\n      solutions = solutions.map(v => multiply(correction, v))\n\n      vectors.push(...solutions.map(v => flatten(v)))\n    }\n\n    if (failedLambdas.length !== 0) {\n      const err = new Error('Failed to find eigenvectors for the following eigenvalues: ' + failedLambdas.join(', '))\n      err.values = values\n      err.vectors = vectors\n      throw err\n    }\n\n    return vectors\n  }\n\n  /**\n   * Compute the eigenvalues of an 2x2 matrix\n   * @return {[number,number]}\n   */\n  function eigenvalues2x2 (a, b, c, d) {\n    // λ± = ½ trA ± ½ √( tr²A - 4 detA )\n    const trA = addScalar(a, d)\n    const detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c))\n    const x = multiplyScalar(trA, 0.5)\n    const y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5)\n\n    return [addScalar(x, y), subtract(x, y)]\n  }\n\n  /**\n   * For an 2x2 matrix compute the transformation matrix S,\n   * so that SAS⁻¹ is an upper triangular matrix\n   * @return {[[number,number],[number,number]]}\n   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf\n   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html\n   */\n  function jordanBase2x2 (a, b, c, d, l1, l2, prec, type) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const zero = big ? bignumber(0) : cplx ? complex(0) : 0\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    // matrix is already upper triangular\n    // return an identity matrix\n    if (smaller(abs(c), prec)) {\n      return [[one, zero], [zero, one]]\n    }\n\n    // matrix is diagonalizable\n    // return its eigenvectors as columns\n    if (larger(abs(subtract(l1, l2)), prec)) {\n      return [[subtract(l1, d), subtract(l2, d)], [c, c]]\n    }\n\n    // matrix is not diagonalizable\n    // compute off-diagonal elements of N = A - λI\n    // N₁₂ = 0 ⇒ S = ( N⃗₁, I⃗₁ )\n    // N₁₂ ≠ 0 ⇒ S = ( N⃗₂, I⃗₂ )\n\n    const na = subtract(a, l1)\n    const nb = subtract(b, l1)\n    const nc = subtract(c, l1)\n    const nd = subtract(d, l1)\n\n    if (smaller(abs(nb), prec)) {\n      return [[na, one], [nc, zero]]\n    } else {\n      return [[nb, zero], [nd, one]]\n    }\n  }\n\n  /**\n   * Enlarge the matrix from n×n to N×N, setting the new\n   * elements to 1 on diagonal and 0 elsewhere\n   */\n  function inflateMatrix (arr, N) {\n    // add columns\n    for (let i = 0; i < arr.length; i++) {\n      arr[i].push(...Array(N - arr[i].length).fill(0))\n    }\n\n    // add rows\n    for (let i = arr.length; i < N; i++) {\n      arr.push(Array(N).fill(0))\n      arr[i][i] = 1\n    }\n\n    return arr\n  }\n\n  /**\n   * Create a block-diagonal matrix with the given square matrices on the diagonal\n   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal\n   * @param {number} N the size of the resulting matrix\n   */\n  function blockDiag (arr, N) {\n    const M = []\n    for (let i = 0; i < N; i++) {\n      M[i] = Array(N).fill(0)\n    }\n\n    let I = 0\n    for (const sub of arr) {\n      const n = sub.length\n\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) {\n          M[I + i][I + j] = sub[i][j]\n        }\n      }\n\n      I += n\n    }\n\n    return M\n  }\n\n  /**\n   * Finds the index of an element in an array using a custom equality function\n   * @template T\n   * @param {Array<T>} arr array in which to search\n   * @param {T} el the element to find\n   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`\n   * @returns {number} the index of `el`, or -1 when it's not in `arr`\n   */\n  function indexOf (arr, el, fn) {\n    for (let i = 0; i < arr.length; i++) {\n      if (fn(arr[i], el)) {\n        return i\n      }\n    }\n    return -1\n  }\n\n  /**\n   * Provided a near-singular upper-triangular matrix A and a list of vectors,\n   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal\n   * to each vector in the list\n   * @template T\n   * @param {T[][]} A near-singular square matrix\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {number} prec epsilon\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @return {T[] | null} eigenvector\n   *\n   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration\n   */\n  function inverseIterate (A, N, orthog, prec, type) {\n    const largeNum = type === 'BigNumber' ? bignumber(1000) : 1000\n\n    let b // the vector\n\n    // you better choose a random vector before I count to five\n    let i = 0\n    while (true) {\n      b = randomOrthogonalVector(N, orthog, type)\n      b = usolve(A, b)\n\n      if (larger(norm(b), largeNum)) { break }\n      if (++i >= 5) { return null }\n    }\n\n    // you better converge before I count to ten\n    i = 0\n    while (true) {\n      const c = usolve(A, b)\n\n      if (smaller(norm(orthogonalComplement(b, [c])), prec)) { break }\n      if (++i >= 10) { return null }\n\n      b = normalize(c)\n    }\n\n    return b\n  }\n\n  /**\n   * Generates a random unit vector of dimension N, orthogonal to each vector in the list\n   * @template T\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} random vector\n   */\n  function randomOrthogonalVector (N, orthog, type) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    // generate random vector with the correct type\n    let v = Array(N).fill(0).map(_ => 2 * Math.random() - 1)\n    if (big) { v = v.map(n => bignumber(n)) }\n    if (cplx) { v = v.map(n => complex(n)) }\n\n    // project to orthogonal complement\n    v = orthogonalComplement(v, orthog)\n\n    // normalize\n    return normalize(v, type)\n  }\n\n  /**\n   * Project vector v to the orthogonal complement of an array of vectors\n   */\n  function orthogonalComplement (v, orthog) {\n    for (const w of orthog) {\n      // v := v − (w, v)/∥w∥² w\n      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w))\n    }\n\n    return v\n  }\n\n  /**\n   * Calculate the norm of a vector.\n   * We can't use math.norm because factory can't handle circular dependency.\n   * Seriously, I'm really fed up with factory.\n   */\n  function norm (v) {\n    return abs(sqrt(dot(v, v)))\n  }\n\n  /**\n   * Normalize a vector\n   * @template T\n   * @param {T[]} v\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} normalized vec\n   */\n  function normalize (v, type) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    return multiply(divideScalar(one, norm(v)), v)\n  }\n\n  return complexEigs\n}\n","import { factory } from '../../utils/factory.js'\nimport { format } from '../../utils/string.js'\nimport { createComplexEigs } from './eigs/complexEigs.js'\nimport { createRealSymmetric } from './eigs/realSymetric.js'\nimport { typeOf, isNumber, isBigNumber, isComplex, isFraction } from '../../utils/is.js'\n\nconst name = 'eigs'\n\n// The absolute state of math.js's dependency system:\nconst dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot']\nexport const createEigs = /* #__PURE__ */ factory(name, dependencies, ({ config, typed, matrix, addScalar, subtract, equal, abs, atan, cos, sin, multiplyScalar, divideScalar, inv, bignumber, multiply, add, larger, column, flatten, number, complex, sqrt, diag, qr, usolve, usolveAll, im, re, smaller, matrixFromColumns, dot }) => {\n  const doRealSymetric = createRealSymmetric({ config, addScalar, subtract, column, flatten, equal, abs, atan, cos, sin, multiplyScalar, inv, bignumber, complex, multiply, add })\n  const doComplexEigs = createComplexEigs({ config, addScalar, subtract, multiply, multiplyScalar, flatten, divideScalar, sqrt, abs, bignumber, diag, qr, inv, usolve, usolveAll, equal, complex, larger, smaller, matrixFromColumns, dot })\n\n  /**\n   * Compute eigenvalues and eigenvectors of a matrix. The eigenvalues are sorted by their absolute value, ascending.\n   * An eigenvalue with multiplicity k will be listed k times. The eigenvectors are returned as columns of a matrix –\n   * the eigenvector that belongs to the j-th eigenvalue in the list (eg. `values[j]`) is the j-th column (eg. `column(vectors, j)`).\n   * If the algorithm fails to converge, it will throw an error – in that case, however, you may still find useful information\n   * in `err.values` and `err.vectors`.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x, [prec])\n   *\n   * Examples:\n   *\n   *     const { eigs, multiply, column, transpose } = math\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], vectors: [v1,v2.... corresponding vectors as columns]}\n   *     const E = ans.values\n   *     const U = ans.vectors\n   *     multiply(H, column(U, 0)) // returns multiply(E[0], column(U, 0))\n   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H\n   *     E[0] == UTxHxU[0][0]  // returns true\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   *\n   * @param {number | BigNumber} [prec] Precision, default value: 1e-15\n   * @return {{values: Array|Matrix, vectors: Array|Matrix}} Object containing an array of eigenvalues and a matrix with eigenvectors as columns.\n   *\n   */\n  return typed('eigs', {\n\n    Array: function (x) {\n      const mat = matrix(x)\n      return computeValuesAndVectors(mat)\n    },\n\n    'Array, number|BigNumber': function (x, prec) {\n      const mat = matrix(x)\n      return computeValuesAndVectors(mat, prec)\n    },\n\n    Matrix: function (mat) {\n      const { values, vectors } = computeValuesAndVectors(mat)\n      return {\n        values: matrix(values),\n        vectors: matrix(vectors)\n      }\n    },\n\n    'Matrix, number|BigNumber': function (mat, prec) {\n      const { values, vectors } = computeValuesAndVectors(mat, prec)\n      return {\n        values: matrix(values),\n        vectors: matrix(vectors)\n      }\n    }\n  })\n\n  function computeValuesAndVectors (mat, prec) {\n    if (prec === undefined) {\n      prec = config.epsilon\n    }\n\n    const size = mat.size()\n\n    if (size.length !== 2 || size[0] !== size[1]) {\n      throw new RangeError('Matrix must be square (size: ' + format(size) + ')')\n    }\n\n    const arr = mat.toArray()\n    const N = size[0]\n\n    if (isReal(arr, N, prec)) {\n      coerceReal(arr, N)\n\n      if (isSymmetric(arr, N, prec)) {\n        const type = coerceTypes(mat, arr, N)\n        return doRealSymetric(arr, N, prec, type)\n      }\n    }\n\n    const type = coerceTypes(mat, arr, N)\n    return doComplexEigs(arr, N, prec, type)\n  }\n\n  /** @return {boolean} */\n  function isSymmetric (arr, N, prec) {\n    for (let i = 0; i < N; i++) {\n      for (let j = i; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {\n          return false\n        }\n      }\n    }\n\n    return true\n  }\n\n  /** @return {boolean} */\n  function isReal (arr, N, prec) {\n    for (let i = 0; i < N; i++) {\n      for (let j = 0; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {\n          return false\n        }\n      }\n    }\n\n    return true\n  }\n\n  function coerceReal (arr, N) {\n    for (let i = 0; i < N; i++) {\n      for (let j = 0; j < N; j++) {\n        arr[i][j] = re(arr[i][j])\n      }\n    }\n  }\n\n  /** @return {'number' | 'BigNumber' | 'Complex'} */\n  function coerceTypes (mat, arr, N) {\n    /** @type {string} */\n    const type = mat.datatype()\n\n    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {\n      return type\n    }\n\n    let hasNumber = false\n    let hasBig = false\n    let hasComplex = false\n\n    for (let i = 0; i < N; i++) {\n      for (let j = 0; j < N; j++) {\n        const el = arr[i][j]\n\n        if (isNumber(el) || isFraction(el)) {\n          hasNumber = true\n        } else if (isBigNumber(el)) {\n          hasBig = true\n        } else if (isComplex(el)) {\n          hasComplex = true\n        } else {\n          throw TypeError('Unsupported type in Matrix: ' + typeOf(el))\n        }\n      }\n    }\n\n    if (hasBig && hasComplex) {\n      console.warn('Complex BigNumbers not supported, this operation will lose precission.')\n    }\n\n    if (hasComplex) {\n      for (let i = 0; i < N; i++) {\n        for (let j = 0; j < N; j++) {\n          arr[i][j] = complex(arr[i][j])\n        }\n      }\n\n      return 'Complex'\n    }\n\n    if (hasBig) {\n      for (let i = 0; i < N; i++) {\n        for (let j = 0; j < N; j++) {\n          arr[i][j] = bignumber(arr[i][j])\n        }\n      }\n\n      return 'BigNumber'\n    }\n\n    if (hasNumber) {\n      for (let i = 0; i < N; i++) {\n        for (let j = 0; j < N; j++) {\n          arr[i][j] = number(arr[i][j])\n        }\n      }\n\n      return 'number'\n    } else {\n      throw TypeError('Matrix contains unsupported types only.')\n    }\n  }\n})\n","import { clone } from '../../../utils/object.js'\n\nexport function createRealSymmetric ({ config, addScalar, subtract, abs, atan, cos, sin, multiplyScalar, inv, bignumber, multiply, add }) {\n  /**\n   * @param {number[] | BigNumber[]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number' | 'BigNumber'} type\n   */\n  function main (arr, N, prec = config.epsilon, type) {\n    if (type === 'number') {\n      return diag(arr, prec)\n    }\n\n    if (type === 'BigNumber') {\n      return diagBig(arr, prec)\n    }\n\n    throw TypeError('Unsupported data type: ' + type)\n  }\n\n  // diagonalization implementation for number (efficient)\n  function diag (x, precision) {\n    const N = x.length\n    const e0 = Math.abs(precision / N)\n    let psi\n    let Sij = new Array(N)\n    // Sij is Identity Matrix\n    for (let i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0)\n      Sij[i][i] = 1.0\n    }\n    // initial error\n    let Vab = getAij(x)\n    while (Math.abs(Vab[1]) >= Math.abs(e0)) {\n      const i = Vab[0][0]\n      const j = Vab[0][1]\n      psi = getTheta(x[i][i], x[j][j], x[i][j])\n      x = x1(x, psi, i, j)\n      Sij = Sij1(Sij, psi, i, j)\n      Vab = getAij(x)\n    }\n    const Ei = createArray(N, 0) // eigenvalues\n    for (let i = 0; i < N; i++) {\n      Ei[i] = x[i][i]\n    }\n    return sorting(clone(Ei), clone(Sij))\n  }\n\n  // diagonalization implementation for bigNumber\n  function diagBig (x, precision) {\n    const N = x.length\n    const e0 = abs(precision / N)\n    let psi\n    let Sij = new Array(N)\n    // Sij is Identity Matrix\n    for (let i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0)\n      Sij[i][i] = 1.0\n    }\n    // initial error\n    let Vab = getAijBig(x)\n    while (abs(Vab[1]) >= abs(e0)) {\n      const i = Vab[0][0]\n      const j = Vab[0][1]\n      psi = getThetaBig(x[i][i], x[j][j], x[i][j])\n      x = x1Big(x, psi, i, j)\n      Sij = Sij1Big(Sij, psi, i, j)\n      Vab = getAijBig(x)\n    }\n    const Ei = createArray(N, 0) // eigenvalues\n    for (let i = 0; i < N; i++) {\n      Ei[i] = x[i][i]\n    }\n    // return [clone(Ei), clone(Sij)]\n    return sorting(clone(Ei), clone(Sij))\n  }\n\n  // get angle\n  function getTheta (aii, ajj, aij) {\n    const denom = (ajj - aii)\n    if (Math.abs(denom) <= config.epsilon) {\n      return Math.PI / 4.0\n    } else {\n      return 0.5 * Math.atan(2.0 * aij / (ajj - aii))\n    }\n  }\n\n  // get angle\n  function getThetaBig (aii, ajj, aij) {\n    const denom = subtract(ajj, aii)\n    if (abs(denom) <= config.epsilon) {\n      return bignumber(-1).acos().div(4)\n    } else {\n      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))))\n    }\n  }\n\n  // update eigvec\n  function Sij1 (Sij, theta, i, j) {\n    const N = Sij.length\n    const c = Math.cos(theta)\n    const s = Math.sin(theta)\n    const Ski = createArray(N, 0)\n    const Skj = createArray(N, 0)\n    for (let k = 0; k < N; k++) {\n      Ski[k] = c * Sij[k][i] - s * Sij[k][j]\n      Skj[k] = s * Sij[k][i] + c * Sij[k][j]\n    }\n    for (let k = 0; k < N; k++) {\n      Sij[k][i] = Ski[k]\n      Sij[k][j] = Skj[k]\n    }\n    return Sij\n  }\n  // update eigvec for overlap\n  function Sij1Big (Sij, theta, i, j) {\n    const N = Sij.length\n    const c = cos(theta)\n    const s = sin(theta)\n    const Ski = createArray(N, bignumber(0))\n    const Skj = createArray(N, bignumber(0))\n    for (let k = 0; k < N; k++) {\n      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]))\n      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]))\n    }\n    for (let k = 0; k < N; k++) {\n      Sij[k][i] = Ski[k]\n      Sij[k][j] = Skj[k]\n    }\n    return Sij\n  }\n\n  // update matrix\n  function x1Big (Hij, theta, i, j) {\n    const N = Hij.length\n    const c = bignumber(cos(theta))\n    const s = bignumber(sin(theta))\n    const c2 = multiplyScalar(c, c)\n    const s2 = multiplyScalar(s, s)\n    const Aki = createArray(N, bignumber(0))\n    const Akj = createArray(N, bignumber(0))\n    // 2cs Hij\n    const csHij = multiply(bignumber(2), c, s, Hij[i][j])\n    //  Aii\n    const Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]))\n    const Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j]))\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]))\n      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]))\n    }\n    // Modify Hij\n    Hij[i][i] = Aii\n    Hij[j][j] = Ajj\n    Hij[i][j] = bignumber(0)\n    Hij[j][i] = bignumber(0)\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      if (k !== i && k !== j) {\n        Hij[i][k] = Aki[k]\n        Hij[k][i] = Aki[k]\n        Hij[j][k] = Akj[k]\n        Hij[k][j] = Akj[k]\n      }\n    }\n    return Hij\n  }\n\n  // update matrix\n  function x1 (Hij, theta, i, j) {\n    const N = Hij.length\n    const c = Math.cos(theta)\n    const s = Math.sin(theta)\n    const c2 = c * c\n    const s2 = s * s\n    const Aki = createArray(N, 0)\n    const Akj = createArray(N, 0)\n    //  Aii\n    const Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j]\n    const Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j]\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      Aki[k] = c * Hij[i][k] - s * Hij[j][k]\n      Akj[k] = s * Hij[i][k] + c * Hij[j][k]\n    }\n    // Modify Hij\n    Hij[i][i] = Aii\n    Hij[j][j] = Ajj\n    Hij[i][j] = 0\n    Hij[j][i] = 0\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      if (k !== i && k !== j) {\n        Hij[i][k] = Aki[k]\n        Hij[k][i] = Aki[k]\n        Hij[j][k] = Akj[k]\n        Hij[k][j] = Akj[k]\n      }\n    }\n    return Hij\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAij (Mij) {\n    const N = Mij.length\n    let maxMij = 0\n    let maxIJ = [0, 1]\n    for (let i = 0; i < N; i++) {\n      for (let j = i + 1; j < N; j++) {\n        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {\n          maxMij = Math.abs(Mij[i][j])\n          maxIJ = [i, j]\n        }\n      }\n    }\n    return [maxIJ, maxMij]\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAijBig (Mij) {\n    const N = Mij.length\n    let maxMij = 0\n    let maxIJ = [0, 1]\n    for (let i = 0; i < N; i++) {\n      for (let j = i + 1; j < N; j++) {\n        if (abs(maxMij) < abs(Mij[i][j])) {\n          maxMij = abs(Mij[i][j])\n          maxIJ = [i, j]\n        }\n      }\n    }\n    return [maxIJ, maxMij]\n  }\n\n  // sort results\n  function sorting (E, S) {\n    const N = E.length\n    const values = Array(N)\n    const vectors = Array(N)\n\n    for (let k = 0; k < N; k++) {\n      vectors[k] = Array(N)\n    }\n    for (let i = 0; i < N; i++) {\n      let minID = 0\n      let minE = E[0]\n      for (let j = 0; j < E.length; j++) {\n        if (abs(E[j]) < abs(minE)) {\n          minID = j\n          minE = E[minID]\n        }\n      }\n      values[i] = E.splice(minID, 1)[0]\n      for (let k = 0; k < N; k++) {\n        vectors[k][i] = S[k][minID]\n        S[k].splice(minID, 1)\n      }\n    }\n\n    return { values, vectors }\n  }\n\n  /**\n   * Create an array of a certain size and fill all items with an initial value\n   * @param {number} size\n   * @param {number} value\n   * @return {number[]}\n   */\n  function createArray (size, value) {\n    // TODO: as soon as all browsers support Array.fill, use that instead (IE doesn't support it)\n    const array = new Array(size)\n\n    for (let i = 0; i < size; i++) {\n      array[i] = value\n    }\n\n    return array\n  }\n\n  return main\n}\n","import { isSparseMatrix } from '../../utils/is.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'expm'\nconst dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply']\n\nexport const createExpm = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, add, identity, inv, multiply }) => {\n  /**\n   * Compute the matrix exponential, expm(A) = e^A. The matrix must be square.\n   * Not to be confused with exp(a), which performs element-wise\n   * exponentiation.\n   *\n   * The exponential is calculated using the Padé approximant with scaling and\n   * squaring; see \"Nineteen Dubious Ways to Compute the Exponential of a\n   * Matrix,\" by Moler and Van Loan.\n   *\n   * Syntax:\n   *\n   *     math.expm(x)\n   *\n   * Examples:\n   *\n   *     const A = [[0,2],[0,0]]\n   *     math.expm(A)        // returns [[1,2],[0,1]]\n   *\n   * See also:\n   *\n   *     exp\n   *\n   * @param {Matrix} x  A square Matrix\n   * @return {Matrix}   The exponential of x\n   */\n  return typed(name, {\n\n    Matrix: function (A) {\n      // Check matrix size\n      const size = A.size()\n\n      if (size.length !== 2 || size[0] !== size[1]) {\n        throw new RangeError('Matrix must be square ' +\n          '(size: ' + format(size) + ')')\n      }\n\n      const n = size[0]\n\n      // Desired accuracy of the approximant (The actual accuracy\n      // will be affected by round-off error)\n      const eps = 1e-15\n\n      // The Padé approximant is not so accurate when the values of A\n      // are \"large\", so scale A by powers of two. Then compute the\n      // exponential, and square the result repeatedly according to\n      // the identity e^A = (e^(A/m))^m\n\n      // Compute infinity-norm of A, ||A||, to see how \"big\" it is\n      const infNorm = infinityNorm(A)\n\n      // Find the optimal scaling factor and number of terms in the\n      // Padé approximant to reach the desired accuracy\n      const params = findParams(infNorm, eps)\n      const q = params.q\n      const j = params.j\n\n      // The Pade approximation to e^A is:\n      // Rqq(A) = Dqq(A) ^ -1 * Nqq(A)\n      // where\n      // Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i\n      // Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i\n\n      // Scale A by 1 / 2^j\n      const Apos = multiply(A, Math.pow(2, -j))\n\n      // The i=0 term is just the identity matrix\n      let N = identity(n)\n      let D = identity(n)\n\n      // Initialization (i=0)\n      let factor = 1\n\n      // Initialization (i=1)\n      let AposToI = Apos // Cloning not necessary\n      let alternate = -1\n\n      for (let i = 1; i <= q; i++) {\n        if (i > 1) {\n          AposToI = multiply(AposToI, Apos)\n          alternate = -alternate\n        }\n        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i)\n\n        N = add(N, multiply(factor, AposToI))\n        D = add(D, multiply(factor * alternate, AposToI))\n      }\n\n      let R = multiply(inv(D), N)\n\n      // Square j times\n      for (let i = 0; i < j; i++) {\n        R = multiply(R, R)\n      }\n\n      return isSparseMatrix(A)\n        ? A.createSparseMatrix(R)\n        : R\n    }\n\n  })\n\n  function infinityNorm (A) {\n    const n = A.size()[0]\n    let infNorm = 0\n    for (let i = 0; i < n; i++) {\n      let rowSum = 0\n      for (let j = 0; j < n; j++) {\n        rowSum += abs(A.get([i, j]))\n      }\n      infNorm = Math.max(rowSum, infNorm)\n    }\n    return infNorm\n  }\n\n  /**\n   * Find the best parameters for the Pade approximant given\n   * the matrix norm and desired accuracy. Returns the first acceptable\n   * combination in order of increasing computational load.\n   */\n  function findParams (infNorm, eps) {\n    const maxSearchSize = 30\n    for (let k = 0; k < maxSearchSize; k++) {\n      for (let q = 0; q <= k; q++) {\n        const j = k - q\n        if (errorEstimate(infNorm, q, j) < eps) {\n          return { q: q, j: j }\n        }\n      }\n    }\n    throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)')\n  }\n\n  /**\n   * Returns the estimated error of the Pade approximant for the given\n   * parameters.\n   */\n  function errorEstimate (infNorm, q, j) {\n    let qfac = 1\n    for (let i = 2; i <= q; i++) {\n      qfac *= i\n    }\n    let twoqfac = qfac\n    for (let i = q + 1; i <= 2 * q; i++) {\n      twoqfac *= i\n    }\n    const twoqp1fac = twoqfac * (2 * q + 1)\n\n    return 8.0 *\n      Math.pow(infNorm / Math.pow(2, j), 2 * q) *\n      qfac * qfac / (twoqfac * twoqp1fac)\n  }\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { format } from '../../utils/string.js'\nimport { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'sqrtm'\nconst dependencies = ['typed', 'abs', 'add', 'multiply', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity']\n\nexport const createSqrtm = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, add, multiply, sqrt, subtract, inv, size, max, identity }) => {\n  const _maxIterations = 1e3\n  const _tolerance = 1e-6\n\n  /**\n   * Calculate the principal square root matrix using the Denman–Beavers iterative method\n   *\n   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration\n   *\n   * @param  {Array | Matrix} A   The square matrix `A`\n   * @return {Array | Matrix}     The principal square root of matrix `A`\n   * @private\n   */\n  function _denmanBeavers (A) {\n    let error\n    let iterations = 0\n\n    let Y = A\n    let Z = identity(size(A))\n\n    do {\n      const Yk = Y\n      Y = multiply(0.5, add(Yk, inv(Z)))\n      Z = multiply(0.5, add(Z, inv(Yk)))\n\n      error = max(abs(subtract(Y, Yk)))\n\n      if (error > _tolerance && ++iterations > _maxIterations) {\n        throw new Error('computing square root of matrix: iterative method could not converge')\n      }\n    } while (error > _tolerance)\n\n    return Y\n  }\n\n  /**\n   * Calculate the principal square root of a square matrix.\n   * The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.\n   *\n   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix\n   *\n   * Syntax:\n   *\n   *     X = math.sqrtm(A)\n   *\n   * Examples:\n   *\n   *     math.sqrtm([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]\n   *\n   * See also:\n   *\n   *     sqrt, pow\n   *\n   * @param  {Array | Matrix} A   The square matrix `A`\n   * @return {Array | Matrix}     The principal square root of matrix `A`\n   */\n  return typed(name, {\n    'Array | Matrix': function (A) {\n      const size = isMatrix(A) ? A.size() : arraySize(A)\n      switch (size.length) {\n        case 1:\n          // Single element Array | Matrix\n          if (size[0] === 1) {\n            return sqrt(A)\n          } else {\n            throw new RangeError('Matrix must be square ' +\n            '(size: ' + format(size) + ')')\n          }\n\n        case 2:\n        {\n          // Two-dimensional Array | Matrix\n          const rows = size[0]\n          const cols = size[1]\n          if (rows === cols) {\n            return _denmanBeavers(A)\n          } else {\n            throw new RangeError('Matrix must be square ' +\n              '(size: ' + format(size) + ')')\n          }\n        }\n        default:\n          // Multi dimensional array\n          throw new RangeError('Matrix must be at most two dimensional ' +\n          '(size: ' + format(size) + ')')\n      }\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { extend } from '../../utils/object.js'\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js'\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js'\n\nconst name = 'divide'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'multiply',\n  'equalScalar',\n  'divideScalar',\n  'inv'\n]\n\nexport const createDivide = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, multiply, equalScalar, divideScalar, inv }) => {\n  const algorithm11 = createAlgorithm11({ typed, equalScalar })\n  const algorithm14 = createAlgorithm14({ typed })\n\n  /**\n   * Divide two values, `x / y`.\n   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.\n   *\n   * Syntax:\n   *\n   *    math.divide(x, y)\n   *\n   * Examples:\n   *\n   *    math.divide(2, 3)            // returns number 0.6666666666666666\n   *\n   *    const a = math.complex(5, 14)\n   *    const b = math.complex(4, 1)\n   *    math.divide(a, b)            // returns Complex 2 + 3i\n   *\n   *    const c = [[7, -6], [13, -4]]\n   *    const d = [[1, 2], [4, 3]]\n   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]\n   *\n   *    const e = math.unit('18 km')\n   *    math.divide(e, 4.5)          // returns Unit 4 km\n   *\n   * See also:\n   *\n   *    multiply\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x   Numerator\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} y          Denominator\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`\n   */\n  return typed('divide', extend({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n\n    'Array | Matrix, Array | Matrix': function (x, y) {\n      // TODO: implement matrix right division using pseudo inverse\n      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html\n      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html\n      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour\n      return multiply(x, inv(y))\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return algorithm14(x, y, divideScalar, false)\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return algorithm11(x, y, divideScalar, false)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf()\n    },\n\n    'any, Array | Matrix': function (x, y) {\n      return multiply(x, inv(y))\n    }\n  }, divideScalar.signatures))\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'distance'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'subtract',\n  'divideScalar',\n  'multiplyScalar',\n  'unaryMinus',\n  'sqrt',\n  'abs'\n]\n\nexport const createDistance = /* #__PURE__ */ factory(name, dependencies, ({ typed, addScalar, subtract, multiplyScalar, divideScalar, unaryMinus, sqrt, abs }) => {\n  /**\n    * Calculates:\n    *    The eucledian distance between two points in N-dimensional spaces.\n    *    Distance between point and a line in 2 and 3 dimensional spaces.\n    *    Pairwise distance between a set of 2D or 3D points\n    * NOTE:\n    *    When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c\n    *    For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)\n    *\n    * Syntax:\n    *    math.distance([x1, y1], [x2, y2])\n    *-   math.distance({pointOneX: 4, pointOneY: 5}, {pointTwoX: 2, pointTwoY: 7})\n    *    math.distance([x1, y1, z1], [x2, y2, z2])\n    *    math.distance({pointOneX: 4, pointOneY: 5, pointOneZ: 8}, {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})\n    *    math.distance([x1, y1, ... , N1], [x2, y2, ... , N2])\n    *    math.distance([[A], [B], [C]...])\n    *    math.distance([x1, y1], [LinePtX1, LinePtY1], [LinePtX2, LinePtY2])\n    *    math.distance({pointX: 1, pointY: 4}, {lineOnePtX: 6, lineOnePtY: 3}, {lineTwoPtX: 2, lineTwoPtY: 8})\n    *    math.distance([x1, y1, z1], [LinePtX1, LinePtY1, LinePtZ1], [LinePtX2, LinePtY2, LinePtZ2])\n    *    math.distance({pointX: 1, pointY: 4, pointZ: 7}, {lineOnePtX: 6, lineOnePtY: 3, lineOnePtZ: 4}, {lineTwoPtX: 2, lineTwoPtY: 8, lineTwoPtZ: 5})\n    *    math.distance([x1, y1], [xCoeffLine, yCoeffLine, constant])\n    *    math.distance({pointX: 10, pointY: 10}, {xCoeffLine: 8, yCoeffLine: 1, constant: 3})\n    *    math.distance([x1, y1, z1], [x0, y0, z0, a-tCoeff, b-tCoeff, c-tCoeff]) point and parametric equation of 3D line\n    *    math.distance([x, y, z], [x0, y0, z0, a, b, c])\n    *    math.distance({pointX: 2, pointY: 5, pointZ: 9}, {x0: 4, y0: 6, z0: 3, a: 4, b: 2, c: 0})\n    *\n    * Examples:\n    *    math.distance([0,0], [4,4])                     // Returns 5.6569\n    *    math.distance(\n    *     {pointOneX: 0, pointOneY: 0},\n    *     {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951\n    *    math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.74166\n    *    math.distance(\n    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},\n    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3\n    *    math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2\n    *    math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]\n    *    math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]\n    *    math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387\n    *    math.distance([10, 10], [2, 3], [-8, 0])        // Returns 8.759953130362847\n    *    math.distance(\n    *     {pointX: 1, pointY: 4},\n    *     {lineOnePtX: 6, lineOnePtY: 3},\n    *     {lineTwoPtX: 2, lineTwoPtY: 8})                // Returns 2.720549372624744\n    *    math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857\n    *    math.distance(\n    *     {pointX: 2, pointY: 3, pointZ: 1},\n    *     {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1}        // Returns 2.3204774044612857\n    *\n    * @param {Array | Matrix | Object} x    Co-ordinates of first point\n    * @param {Array | Matrix | Object} y    Co-ordinates of second point\n    * @return {Number | BigNumber} Returns the distance from two/three points\n  */\n  return typed(name, {\n    'Array, Array, Array': function (x, y, z) {\n      // Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)\n      if (x.length === 2 && y.length === 2 && z.length === 2) {\n        if (!_2d(x)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument') }\n        if (!_2d(y)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument') }\n        if (!_2d(z)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument') }\n        const m = divideScalar(subtract(z[1], z[0]), subtract(y[1], y[0]))\n        const xCoeff = multiplyScalar(multiplyScalar(m, m), y[0])\n        const yCoeff = unaryMinus(multiplyScalar(m, y[0]))\n        const constant = x[1]\n\n        return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant)\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    'Object, Object, Object': function (x, y, z) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {\n        if (!_2d(x)) { throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers') }\n        if (!_2d(y)) { throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers') }\n        if (!_2d(z)) { throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers') }\n        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y &&\n          'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {\n          const m = divideScalar(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX))\n          const xCoeff = multiplyScalar(multiplyScalar(m, m), y.lineOnePtX)\n          const yCoeff = unaryMinus(multiplyScalar(m, y.lineOnePtX))\n          const constant = x.pointX\n\n          return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant)\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    'Array, Array': function (x, y) {\n      // Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])\n      if (x.length === 2 && y.length === 3) {\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument')\n        }\n        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument')\n        }\n\n        return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2])\n      } else if (x.length === 3 && y.length === 6) {\n        // Point to Line 3D\n        if (!_3d(x)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument')\n        }\n        if (!_parametricLine(y)) {\n          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument')\n        }\n\n        return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5])\n      } else if (x.length === y.length && x.length > 0) {\n        // Point to Point N-dimensions\n        if (!_containsOnlyNumbers(x)) {\n          throw new TypeError('All values of an array should be numbers or BigNumbers')\n        }\n        if (!_containsOnlyNumbers(y)) {\n          throw new TypeError('All values of an array should be numbers or BigNumbers')\n        }\n\n        return _euclideanDistance(x, y)\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    'Object, Object': function (x, y) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers')\n        }\n        if (!_3d(y)) {\n          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers')\n        }\n        if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {\n          return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant)\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {\n        // Point to Line 3D\n        if (!_3d(x)) {\n          throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers')\n        }\n        if (!_parametricLine(y)) {\n          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers')\n        }\n        if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {\n          return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c)\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {\n        // Point to Point 2D\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers')\n        }\n        if (!_2d(y)) {\n          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers')\n        }\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {\n          return _euclideanDistance([x.pointOneX, x.pointOneY], [y.pointTwoX, y.pointTwoY])\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {\n        // Point to Point 3D\n        if (!_3d(x)) {\n          throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers')\n        }\n        if (!_3d(y)) {\n          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers')\n        }\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x &&\n          'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y\n        ) {\n          return _euclideanDistance([x.pointOneX, x.pointOneY, x.pointOneZ], [y.pointTwoX, y.pointTwoY, y.pointTwoZ])\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    Array: function (arr) {\n      if (!_pairwise(arr)) { throw new TypeError('Incorrect array format entered for pairwise distance calculation') }\n\n      return _distancePairwise(arr)\n    }\n  })\n\n  function _isNumber (a) {\n    // distance supports numbers and bignumbers\n    return (typeof a === 'number' || isBigNumber(a))\n  }\n\n  function _2d (a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (a.constructor !== Array) {\n      a = _objectToArray(a)\n    }\n    return _isNumber(a[0]) && _isNumber(a[1])\n  }\n\n  function _3d (a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (a.constructor !== Array) {\n      a = _objectToArray(a)\n    }\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2])\n  }\n\n  function _containsOnlyNumbers (a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (!Array.isArray(a)) {\n      a = _objectToArray(a)\n    }\n    return a.every(_isNumber)\n  }\n\n  function _parametricLine (a) {\n    if (a.constructor !== Array) {\n      a = _objectToArray(a)\n    }\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) &&\n      _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5])\n  }\n\n  function _objectToArray (o) {\n    const keys = Object.keys(o)\n    const a = []\n    for (let i = 0; i < keys.length; i++) {\n      a.push(o[keys[i]])\n    }\n    return a\n  }\n\n  function _pairwise (a) {\n    // checks for valid arguments passed to _distancePairwise(Array)\n    if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {\n      if (a.some(aI => aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]))) {\n        return false\n      }\n    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {\n      if (a.some(aI => aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]))) {\n        return false\n      }\n    } else {\n      return false\n    }\n    return true\n  }\n\n  function _distancePointLine2D (x, y, a, b, c) {\n    const num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c))\n    const den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)))\n    return divideScalar(num, den)\n  }\n\n  function _distancePointLine3D (x, y, z, x0, y0, z0, a, b, c) {\n    let num = [subtract(multiplyScalar(subtract(y0, y), c), multiplyScalar(subtract(z0, z), b)),\n      subtract(multiplyScalar(subtract(z0, z), a), multiplyScalar(subtract(x0, x), c)),\n      subtract(multiplyScalar(subtract(x0, x), b), multiplyScalar(subtract(y0, y), a))]\n    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])))\n    const den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)))\n    return divideScalar(num, den)\n  }\n\n  function _euclideanDistance (x, y) {\n    const vectorSize = x.length\n    let result = 0\n    let diff = 0\n    for (let i = 0; i < vectorSize; i++) {\n      diff = subtract(x[i], y[i])\n      result = addScalar(multiplyScalar(diff, diff), result)\n    }\n    return sqrt(result)\n  }\n\n  function _distancePairwise (a) {\n    const result = []\n    let pointA = []\n    let pointB = []\n    for (let i = 0; i < a.length - 1; i++) {\n      for (let j = i + 1; j < a.length; j++) {\n        if (a[0].length === 2) {\n          pointA = [a[i][0], a[i][1]]\n          pointB = [a[j][0], a[j][1]]\n        } else if (a[0].length === 3) {\n          pointA = [a[i][0], a[i][1], a[i][2]]\n          pointB = [a[j][0], a[j][1], a[j][2]]\n        }\n        result.push(_euclideanDistance(pointA, pointB))\n      }\n    }\n    return result\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'intersect'\nconst dependencies = [\n  'typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'\n]\n\nexport const createIntersect = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, abs, add, addScalar, matrix, multiply, multiplyScalar, divideScalar, subtract, smaller, equalScalar, flatten, isZero, isNumeric }) => {\n  /**\n   * Calculates the point of intersection of two lines in two or three dimensions\n   * and of a line and a plane in three dimensions. The inputs are in the form of\n   * arrays or 1 dimensional matrices. The line intersection functions return null\n   * if the lines do not meet.\n   *\n   * Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.\n   *\n   * Syntax:\n   *\n   *    math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)\n   *    math.intersect(endPoint1, endPoint2, planeCoefficients)\n   *\n   * Examples:\n   *\n   *    math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]\n   *    math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]\n   *    math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]\n   *\n   * @param  {Array | Matrix} w   Co-ordinates of first end-point of first line\n   * @param  {Array | Matrix} x   Co-ordinates of second end-point of first line\n   * @param  {Array | Matrix} y   Co-ordinates of first end-point of second line\n   *                              OR Co-efficients of the plane's equation\n   * @param  {Array | Matrix} z   Co-ordinates of second end-point of second line\n   *                              OR undefined if the calculation is for line and plane\n   * @return {Array}              Returns the point of intersection of lines/lines-planes\n   */\n  return typed('intersect', {\n    'Array, Array, Array': _AAA,\n\n    'Array, Array, Array, Array': _AAAA,\n\n    'Matrix, Matrix, Matrix': function (x, y, plane) {\n      const arr = _AAA(x.valueOf(), y.valueOf(), plane.valueOf())\n      return arr === null ? null : matrix(arr)\n    },\n\n    'Matrix, Matrix, Matrix, Matrix': function (w, x, y, z) {\n      // TODO: output matrix type should match input matrix type\n      const arr = _AAAA(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf())\n      return arr === null ? null : matrix(arr)\n    }\n  })\n\n  function _AAA (x, y, plane) {\n    x = _coerceArr(x)\n    y = _coerceArr(y)\n    plane = _coerceArr(plane)\n\n    if (!_3d(x)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument') }\n    if (!_3d(y)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument') }\n    if (!_4d(plane)) { throw new TypeError('Array with 4 numbers expected as third argument') }\n\n    return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3])\n  }\n\n  function _AAAA (w, x, y, z) {\n    w = _coerceArr(w)\n    x = _coerceArr(x)\n    y = _coerceArr(y)\n    z = _coerceArr(z)\n\n    if (w.length === 2) {\n      if (!_2d(w)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument') }\n      if (!_2d(x)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument') }\n      if (!_2d(y)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument') }\n      if (!_2d(z)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument') }\n\n      return _intersect2d(w, x, y, z)\n    } else if (w.length === 3) {\n      if (!_3d(w)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument') }\n      if (!_3d(x)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument') }\n      if (!_3d(y)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument') }\n      if (!_3d(z)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument') }\n\n      return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2])\n    } else {\n      throw new TypeError('Arrays with two or thee dimensional points expected')\n    }\n  }\n\n  /** Coerce row and column 2-dim arrays to 1-dim array */\n  function _coerceArr (arr) {\n    // row matrix\n    if (arr.length === 1) return arr[0]\n\n    // column matrix\n    if (arr.length > 1 && Array.isArray(arr[0])) {\n      if (arr.every(el => Array.isArray(el) && el.length === 1)) return flatten(arr)\n    }\n\n    return arr\n  }\n\n  function _2d (x) {\n    return x.length === 2 && isNumeric(x[0]) && isNumeric(x[1])\n  }\n\n  function _3d (x) {\n    return x.length === 3 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2])\n  }\n\n  function _4d (x) {\n    return x.length === 4 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]) && isNumeric(x[3])\n  }\n\n  function _intersect2d (p1a, p1b, p2a, p2b) {\n    const o1 = p1a\n    const o2 = p2a\n    const d1 = subtract(o1, p1b)\n    const d2 = subtract(o2, p2b)\n    const det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]))\n    if (isZero(det)) return null\n    if (smaller(abs(det), config.epsilon)) {\n      return null\n    }\n    const d20o11 = multiplyScalar(d2[0], o1[1])\n    const d21o10 = multiplyScalar(d2[1], o1[0])\n    const d20o21 = multiplyScalar(d2[0], o2[1])\n    const d21o20 = multiplyScalar(d2[1], o2[0])\n    const t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det)\n    return add(multiply(d1, t), o1)\n  }\n\n  function _intersect3dHelper (a, b, c, d, e, f, g, h, i, j, k, l) {\n    // (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)\n    const add1 = multiplyScalar(subtract(a, b), subtract(c, d))\n    const add2 = multiplyScalar(subtract(e, f), subtract(g, h))\n    const add3 = multiplyScalar(subtract(i, j), subtract(k, l))\n    return addScalar(addScalar(add1, add2), add3)\n  }\n\n  function _intersect3d (x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {\n    const d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3)\n    const d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1)\n    const d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1)\n    const d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3)\n    const d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1)\n    const numerator = subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343))\n    const denominator = subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321))\n    if (isZero(denominator)) return null\n    const ta = divideScalar(numerator, denominator)\n    const tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343)\n\n    const pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)))\n    const pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)))\n    const paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)))\n    const pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)))\n    const pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)))\n    const pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)))\n    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {\n      return [pax, pay, paz]\n    } else {\n      return null\n    }\n  }\n\n  function _intersectLinePlane (x1, y1, z1, x2, y2, z2, x, y, z, c) {\n    const x1x = multiplyScalar(x1, x)\n    const x2x = multiplyScalar(x2, x)\n    const y1y = multiplyScalar(y1, y)\n    const y2y = multiplyScalar(y2, y)\n    const z1z = multiplyScalar(z1, z)\n    const z2z = multiplyScalar(z2, z)\n\n    const numerator = subtract(subtract(subtract(c, x1x), y1y), z1z)\n    const denominator = subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z)\n\n    const t = divideScalar(numerator, denominator)\n\n    const px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)))\n    const py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)))\n    const pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)))\n    return [px, py, pz]\n    // TODO: Add cases when line is parallel to the plane:\n    //       (a) no intersection,\n    //       (b) line contained in plane\n  }\n})\n","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'sum'\nconst dependencies = ['typed', 'config', 'add', 'numeric']\n\nexport const createSum = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, add, numeric }) => {\n  /**\n   * Compute the sum of a matrix or a list with values.\n   * In case of a (multi dimensional) array or matrix, the sum of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.sum(a, b, c, ...)\n   *     math.sum(A)\n   *\n   * Examples:\n   *\n   *     math.sum(2, 1, 4, 3)               // returns 10\n   *     math.sum([2, 1, 4, 3])             // returns 10\n   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22\n   *\n   * See also:\n   *\n   *    mean, median, min, max, prod, std, variance, cumsum\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The sum of all values\n   */\n  return typed(name, {\n    // sum([a, b, c, d, ...])\n    'Array | Matrix': _sum,\n\n    // sum([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nsumDim,\n\n    // sum(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function sum')\n      }\n\n      return _sum(args)\n    }\n  })\n\n  /**\n   * Recursively calculate the sum of an n-dimensional array\n   * @param {Array | Matrix} array\n   * @return {number} sum\n   * @private\n   */\n  function _sum (array) {\n    let sum\n\n    deepForEach(array, function (value) {\n      try {\n        sum = (sum === undefined) ? value : add(sum, value)\n      } catch (err) {\n        throw improveErrorMessage(err, 'sum', value)\n      }\n    })\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (sum === undefined) {\n      sum = numeric(0, config.number)\n    }\n    if (typeof sum === 'string') {\n      sum = numeric(sum, config.number)\n    }\n\n    return sum\n  }\n\n  function _nsumDim (array, dim) {\n    try {\n      const sum = reduce(array, dim, add)\n      return sum\n    } catch (err) {\n      throw improveErrorMessage(err, 'sum')\n    }\n  }\n})\n","import { containsCollections } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { _switch } from '../../utils/switch.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\nimport { arraySize } from '../../utils/array.js'\nimport { IndexError } from '../../error/IndexError.js'\n\nconst name = 'cumsum'\nconst dependencies = ['typed', 'add', 'unaryPlus']\n\nexport const createCumSum = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, unaryPlus }) => {\n  /**\n   * Compute the cumulative sum of a matrix or a list with values.\n   * In case of a (multi dimensional) array or matrix, the cumulative sums\n   * along a specified dimension (defaulting to the first) will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.cumsum(a, b, c, ...)\n   *     math.cumsum(A)\n   *\n   * Examples:\n   *\n   *     math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]\n   *     math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]\n   *     math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]\n   *     math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]\n   *     math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]\n   *     math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]\n   *\n   * See also:\n   *\n   *    mean, median, min, max, prod, std, variance, sum\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The cumulative sum of all values\n   */\n  return typed(name, {\n    // sum([a, b, c, d, ...])\n    Array: _cumsum,\n    Matrix: function (matrix) {\n      return matrix.create(_cumsum(matrix.valueOf()))\n    },\n\n    // sum([a, b, c, d, ...], dim)\n    'Array, number | BigNumber': _ncumSumDim,\n    'Matrix, number | BigNumber': function (matrix, dim) {\n      return matrix.create(_ncumSumDim(matrix.valueOf(), dim))\n    },\n\n    // cumsum(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('All values expected to be scalar in function cumsum')\n      }\n\n      return _cumsum(args)\n    }\n  })\n\n  /**\n     * Recursively calculate the cumulative sum of an n-dimensional array\n     * @param {Array} array\n     * @return {number} cumsum\n     * @private\n     */\n  function _cumsum (array) {\n    try {\n      return _cumsummap(array)\n    } catch (err) {\n      throw improveErrorMessage(err, name)\n    }\n  }\n\n  function _cumsummap (array) {\n    if (array.length === 0) {\n      return []\n    }\n\n    const sums = [unaryPlus(array[0])] // unaryPlus converts to number if need be\n    for (let i = 1; i < array.length; ++i) {\n      // Must use add below and not addScalar for the case of summing a\n      // 2+-dimensional array along the 0th dimension (the row vectors,\n      // or higher-d analogues, are literally added to each other).\n      sums.push(add(sums[i - 1], array[i]))\n    }\n    return sums\n  }\n\n  function _ncumSumDim (array, dim) {\n    const size = arraySize(array)\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\n    try {\n      return _cumsumDimensional(array, dim)\n    } catch (err) {\n      throw improveErrorMessage(err, name)\n    }\n  }\n\n  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */\n  function _cumsumDimensional (mat, dim) {\n    let i, ret, tran\n\n    if (dim <= 0) {\n      const initialValue = mat[0][0]\n      if (!Array.isArray(initialValue)) {\n        return _cumsummap(mat)\n      } else {\n        tran = _switch(mat)\n        ret = []\n        for (i = 0; i < tran.length; i++) {\n          ret[i] = _cumsumDimensional(tran[i], dim - 1)\n        }\n        return ret\n      }\n    } else {\n      ret = []\n      for (i = 0; i < mat.length; i++) {\n        ret[i] = _cumsumDimensional(mat[i], dim - 1)\n      }\n      return ret\n    }\n  }\n})\n","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js'\nimport { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'mean'\nconst dependencies = ['typed', 'add', 'divide']\n\nexport const createMean = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide }) => {\n  /**\n   * Compute the mean value of matrix or a list with values.\n   * In case of a multi dimensional array, the mean of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.mean(a, b, c, ...)\n   *     math.mean(A)\n   *     math.mean(A, dim)\n   *\n   * Examples:\n   *\n   *     math.mean(2, 1, 4, 3)                     // returns 2.5\n   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725\n   *\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]\n   *\n   * See also:\n   *\n   *     median, min, max, sum, prod, std, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The mean of all values\n   */\n  return typed(name, {\n    // mean([a, b, c, d, ...])\n    'Array | Matrix': _mean,\n\n    // mean([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nmeanDim,\n\n    // mean(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function mean')\n      }\n\n      return _mean(args)\n    }\n  })\n\n  /**\n   * Calculate the mean value in an n-dimensional array, returning a\n   * n-1 dimensional array\n   * @param {Array} array\n   * @param {number} dim\n   * @return {number} mean\n   * @private\n   */\n  function _nmeanDim (array, dim) {\n    try {\n      const sum = reduce(array, dim, add)\n      const s = Array.isArray(array) ? arraySize(array) : array.size()\n      return divide(sum, s[dim])\n    } catch (err) {\n      throw improveErrorMessage(err, 'mean')\n    }\n  }\n\n  /**\n   * Recursively calculate the mean value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} mean\n   * @private\n   */\n  function _mean (array) {\n    let sum\n    let num = 0\n\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value)\n        num++\n      } catch (err) {\n        throw improveErrorMessage(err, 'mean', value)\n      }\n    })\n\n    if (num === 0) {\n      throw new Error('Cannot calculate the mean of an empty array')\n    }\n    return divide(sum, num)\n  }\n})\n","import { containsCollections } from '../../utils/collection.js'\nimport { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'median'\nconst dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect']\n\nexport const createMedian = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide, compare, partitionSelect }) => {\n  /**\n   * Recursively calculate the median of an n-dimensional array\n   * @param {Array} array\n   * @return {Number} median\n   * @private\n   */\n  function _median (array) {\n    try {\n      array = flatten(array.valueOf())\n\n      const num = array.length\n      if (num === 0) {\n        throw new Error('Cannot calculate median of an empty array')\n      }\n\n      if (num % 2 === 0) {\n        // even: return the average of the two middle values\n        const mid = num / 2 - 1\n        const right = partitionSelect(array, mid + 1)\n\n        // array now partitioned at mid + 1, take max of left part\n        let left = array[mid]\n        for (let i = 0; i < mid; ++i) {\n          if (compare(array[i], left) > 0) {\n            left = array[i]\n          }\n        }\n\n        return middle2(left, right)\n      } else {\n        // odd: return the middle value\n        const m = partitionSelect(array, (num - 1) / 2)\n\n        return middle(m)\n      }\n    } catch (err) {\n      throw improveErrorMessage(err, 'median')\n    }\n  }\n\n  // helper function to type check the middle value of the array\n  const middle = typed({\n    'number | BigNumber | Complex | Unit': function (value) {\n      return value\n    }\n  })\n\n  // helper function to type check the two middle value of the array\n  const middle2 = typed({\n    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function (left, right) {\n      return divide(add(left, right), 2)\n    }\n  })\n\n  /**\n   * Compute the median of a matrix or a list with values. The values are\n   * sorted and the middle value is returned. In case of an even number of\n   * values, the average of the two middle values is returned.\n   * Supported types of values are: Number, BigNumber, Unit\n   *\n   * In case of a (multi dimensional) array or matrix, the median of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.median(a, b, c, ...)\n   *     math.median(A)\n   *\n   * Examples:\n   *\n   *     math.median(5, 2, 7)        // returns 5\n   *     math.median([3, -1, 5, 7])  // returns 4\n   *\n   * See also:\n   *\n   *     mean, min, max, sum, prod, std, variance, quantileSeq\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The median\n   */\n  return typed(name, {\n    // median([a, b, c, d, ...])\n    'Array | Matrix': _median,\n\n    // median([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      // TODO: implement median(A, dim)\n      throw new Error('median(A, dim) is not yet supported')\n      // return reduce(arguments[0], arguments[1], ...)\n    },\n\n    // median(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function median')\n      }\n\n      return _median(args)\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'mad'\nconst dependencies = ['typed', 'abs', 'map', 'median', 'subtract']\n\nexport const createMad = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, map, median, subtract }) => {\n  /**\n   * Compute the median absolute deviation of a matrix or a list with values.\n   * The median absolute deviation is defined as the median of the absolute\n   * deviations from the median.\n   *\n   * Syntax:\n   *\n   *     math.mad(a, b, c, ...)\n   *     math.mad(A)\n   *\n   * Examples:\n   *\n   *     math.mad(10, 20, 30)             // returns 10\n   *     math.mad([1, 2, 3])              // returns 1\n   *     math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5\n   *\n   * See also:\n   *\n   *     median, mean, std, abs\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or multiple scalar values.\n   * @return {*} The median absolute deviation.\n   */\n  return typed(name, {\n    // mad([a, b, c, d, ...])\n    'Array | Matrix': _mad,\n\n    // mad(a, b, c, d, ...)\n    '...': function (args) {\n      return _mad(args)\n    }\n  })\n\n  function _mad (array) {\n    array = flatten(array.valueOf())\n\n    if (array.length === 0) {\n      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array')\n    }\n\n    try {\n      const med = median(array)\n      return median(map(array, function (value) {\n        return abs(subtract(value, med))\n      }))\n    } catch (err) {\n      if (err instanceof TypeError && err.message.indexOf('median') !== -1) {\n        throw new TypeError(err.message.replace('median', 'mad'))\n      } else {\n        throw improveErrorMessage(err, 'mad')\n      }\n    }\n  }\n})\n","import { deepForEach } from '../../utils/collection.js'\nimport { isBigNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst DEFAULT_NORMALIZATION = 'unbiased'\n\nconst name = 'variance'\nconst dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN']\n\nexport const createVariance = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, subtract, multiply, divide, apply, isNaN }) => {\n  /**\n   * Compute the variance of a matrix or a  list with values.\n   * In case of a (multi dimensional) array or matrix, the variance over all\n   * elements will be calculated.\n   *\n   * Additionally, it is possible to compute the variance along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Note that older browser may not like the variable name `var`. In that\n   * case, the function can be called as `math['var'](...)` instead of\n   * `math.var(...)`.\n   *\n   * Syntax:\n   *\n   *     math.variance(a, b, c, ...)\n   *     math.variance(A)\n   *     math.variance(A, normalization)\n   *     math.variance(A, dimension)\n   *     math.variance(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.variance(2, 4, 6)                     // returns 4\n   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667\n   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5\n   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4\n   *\n   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, std, sum\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the variance for a matrix\n   * @return {*} The variance\n   */\n  return typed(name, {\n    // variance([a, b, c, d, ...])\n    'Array | Matrix': function (array) {\n      return _var(array, DEFAULT_NORMALIZATION)\n    },\n\n    // variance([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _var,\n\n    // variance([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      return _varDim(array, dim, DEFAULT_NORMALIZATION)\n    },\n\n    // variance([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _varDim,\n\n    // variance(a, b, c, d, ...)\n    '...': function (args) {\n      return _var(args, DEFAULT_NORMALIZATION)\n    }\n  })\n\n  /**\n   * Recursively calculate the variance of an n-dimensional array\n   * @param {Array} array\n   * @param {string} normalization\n   *                        Determines how to normalize the variance:\n   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)\n   *                        - 'uncorrected' The sum of squared errors is divided by n\n   *                        - 'biased'      The sum of squared errors is divided by (n + 1)\n   * @return {number | BigNumber} variance\n   * @private\n   */\n  function _var (array, normalization) {\n    let sum\n    let num = 0\n\n    if (array.length === 0) {\n      throw new SyntaxError('Function variance requires one or more parameters (0 provided)')\n    }\n\n    // calculate the mean and number of elements\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value)\n        num++\n      } catch (err) {\n        throw improveErrorMessage(err, 'variance', value)\n      }\n    })\n    if (num === 0) throw new Error('Cannot calculate variance of an empty array')\n\n    const mean = divide(sum, num)\n\n    // calculate the variance\n    sum = undefined\n    deepForEach(array, function (value) {\n      const diff = subtract(value, mean)\n      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff))\n    })\n\n    if (isNaN(sum)) {\n      return sum\n    }\n\n    switch (normalization) {\n      case 'uncorrected':\n        return divide(sum, num)\n\n      case 'biased':\n        return divide(sum, num + 1)\n\n      case 'unbiased':\n      {\n        const zero = isBigNumber(sum) ? sum.mul(0) : 0\n        return (num === 1) ? zero : divide(sum, num - 1)\n      }\n\n      default:\n        throw new Error('Unknown normalization \"' + normalization + '\". ' +\n        'Choose \"unbiased\" (default), \"uncorrected\", or \"biased\".')\n    }\n  }\n\n  function _varDim (array, dim, normalization) {\n    try {\n      if (array.length === 0) {\n        throw new SyntaxError('Function variance requires one or more parameters (0 provided)')\n      }\n      return apply(array, dim, (x) => _var(x, normalization))\n    } catch (err) {\n      throw improveErrorMessage(err, 'variance')\n    }\n  }\n})\n","import { isBigNumber, isCollection, isNumber } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'quantileSeq'\nconst dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare']\n\nexport const createQuantileSeq = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, multiply, partitionSelect, compare }) => {\n  /**\n   * Compute the prob order quantile of a matrix or a list with values.\n   * The sequence is sorted and the middle value is returned.\n   * Supported types of sequence values are: Number, BigNumber, Unit\n   * Supported types of probability are: Number, BigNumber\n   *\n   * In case of a (multi dimensional) array or matrix, the prob order quantile\n   * of all elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.quantileSeq(A, prob[, sorted])\n   *     math.quantileSeq(A, [prob1, prob2, ...][, sorted])\n   *     math.quantileSeq(A, N[, sorted])\n   *\n   * Examples:\n   *\n   *     math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4\n   *     math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]\n   *     math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]\n   *     math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4\n   *\n   * See also:\n   *\n   *     median, mean, min, max, sum, prod, std, variance\n   *\n   * @param {Array, Matrix} data                A single matrix or Array\n   * @param {Number, BigNumber, Array} probOrN  prob is the order of the quantile, while N is\n   *                                            the amount of evenly distributed steps of\n   *                                            probabilities; only one of these options can\n   *                                            be provided\n   * @param {Boolean} sorted=false              is data sorted in ascending order\n   * @return {Number, BigNumber, Unit, Array}   Quantile(s)\n   */\n  function quantileSeq (data, probOrN, sorted) {\n    let probArr, dataArr, one\n\n    if (arguments.length < 2 || arguments.length > 3) {\n      throw new SyntaxError('Function quantileSeq requires two or three parameters')\n    }\n\n    if (isCollection(data)) {\n      sorted = sorted || false\n      if (typeof sorted === 'boolean') {\n        dataArr = data.valueOf()\n        if (isNumber(probOrN)) {\n          if (probOrN < 0) {\n            throw new Error('N/prob must be non-negative')\n          }\n\n          if (probOrN <= 1) {\n            // quantileSeq([a, b, c, d, ...], prob[,sorted])\n            return _quantileSeq(dataArr, probOrN, sorted)\n          }\n\n          if (probOrN > 1) {\n            // quantileSeq([a, b, c, d, ...], N[,sorted])\n            if (!isInteger(probOrN)) {\n              throw new Error('N must be a positive integer')\n            }\n\n            const nPlusOne = probOrN + 1\n            probArr = new Array(probOrN)\n            for (let i = 0; i < probOrN;) {\n              probArr[i] = _quantileSeq(dataArr, (++i) / nPlusOne, sorted)\n            }\n            return probArr\n          }\n        }\n\n        if (isBigNumber(probOrN)) {\n          const BigNumber = probOrN.constructor\n\n          if (probOrN.isNegative()) {\n            throw new Error('N/prob must be non-negative')\n          }\n\n          one = new BigNumber(1)\n\n          if (probOrN.lte(one)) {\n            // quantileSeq([a, b, c, d, ...], prob[,sorted])\n            return new BigNumber(_quantileSeq(dataArr, probOrN, sorted))\n          }\n\n          if (probOrN.gt(one)) {\n            // quantileSeq([a, b, c, d, ...], N[,sorted])\n            if (!probOrN.isInteger()) {\n              throw new Error('N must be a positive integer')\n            }\n\n            // largest possible Array length is 2^32-1\n            // 2^32 < 10^15, thus safe conversion guaranteed\n            const intN = probOrN.toNumber()\n            if (intN > 4294967295) {\n              throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array')\n            }\n\n            const nPlusOne = new BigNumber(intN + 1)\n            probArr = new Array(intN)\n            for (let i = 0; i < intN;) {\n              probArr[i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++i).div(nPlusOne), sorted))\n            }\n            return probArr\n          }\n        }\n\n        if (Array.isArray(probOrN)) {\n          // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])\n          probArr = new Array(probOrN.length)\n          for (let i = 0; i < probArr.length; ++i) {\n            const currProb = probOrN[i]\n            if (isNumber(currProb)) {\n              if (currProb < 0 || currProb > 1) {\n                throw new Error('Probability must be between 0 and 1, inclusive')\n              }\n            } else if (isBigNumber(currProb)) {\n              one = new currProb.constructor(1)\n              if (currProb.isNegative() || currProb.gt(one)) {\n                throw new Error('Probability must be between 0 and 1, inclusive')\n              }\n            } else {\n              throw new TypeError('Unexpected type of argument in function quantileSeq') // FIXME: becomes redundant when converted to typed-function\n            }\n\n            probArr[i] = _quantileSeq(dataArr, currProb, sorted)\n          }\n          return probArr\n        }\n\n        throw new TypeError('Unexpected type of argument in function quantileSeq') // FIXME: becomes redundant when converted to typed-function\n      }\n\n      throw new TypeError('Unexpected type of argument in function quantileSeq') // FIXME: becomes redundant when converted to typed-function\n    }\n\n    throw new TypeError('Unexpected type of argument in function quantileSeq') // FIXME: becomes redundant when converted to typed-function\n  }\n\n  /**\n   * Calculate the prob order quantile of an n-dimensional array.\n   *\n   * @param {Array} array\n   * @param {Number, BigNumber} prob\n   * @param {Boolean} sorted\n   * @return {Number, BigNumber, Unit} prob order quantile\n   * @private\n   */\n  function _quantileSeq (array, prob, sorted) {\n    const flat = flatten(array)\n    const len = flat.length\n    if (len === 0) {\n      throw new Error('Cannot calculate quantile of an empty sequence')\n    }\n\n    if (isNumber(prob)) {\n      const index = prob * (len - 1)\n      const fracPart = index % 1\n      if (fracPart === 0) {\n        const value = sorted ? flat[index] : partitionSelect(flat, index)\n\n        validate(value)\n\n        return value\n      }\n\n      const integerPart = Math.floor(index)\n\n      let left\n      let right\n      if (sorted) {\n        left = flat[integerPart]\n        right = flat[integerPart + 1]\n      } else {\n        right = partitionSelect(flat, integerPart + 1)\n\n        // max of partition is kth largest\n        left = flat[integerPart]\n        for (let i = 0; i < integerPart; ++i) {\n          if (compare(flat[i], left) > 0) {\n            left = flat[i]\n          }\n        }\n      }\n\n      validate(left)\n      validate(right)\n\n      // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n      return add(multiply(left, 1 - fracPart), multiply(right, fracPart))\n    }\n\n    // If prob is a BigNumber\n    let index = prob.times(len - 1)\n    if (index.isInteger()) {\n      index = index.toNumber()\n      const value = sorted ? flat[index] : partitionSelect(flat, index)\n\n      validate(value)\n\n      return value\n    }\n\n    const integerPart = index.floor()\n    const fracPart = index.minus(integerPart)\n    const integerPartNumber = integerPart.toNumber()\n\n    let left\n    let right\n    if (sorted) {\n      left = flat[integerPartNumber]\n      right = flat[integerPartNumber + 1]\n    } else {\n      right = partitionSelect(flat, integerPartNumber + 1)\n\n      // max of partition is kth largest\n      left = flat[integerPartNumber]\n      for (let i = 0; i < integerPartNumber; ++i) {\n        if (compare(flat[i], left) > 0) {\n          left = flat[i]\n        }\n      }\n    }\n\n    validate(left)\n    validate(right)\n\n    // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n    const one = new fracPart.constructor(1)\n    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart))\n  }\n\n  /**\n   * Check if array value types are valid, throw error otherwise.\n   * @param {number | BigNumber | Unit} x\n   * @param {number | BigNumber | Unit} x\n   * @private\n   */\n  const validate = typed({\n    'number | BigNumber | Unit': function (x) {\n      return x\n    }\n  })\n\n  return quantileSeq\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'std'\nconst dependencies = ['typed', 'sqrt', 'variance']\n\nexport const createStd = /* #__PURE__ */ factory(name, dependencies, ({ typed, sqrt, variance }) => {\n  /**\n   * Compute the standard deviation of a matrix or a  list with values.\n   * The standard deviations is defined as the square root of the variance:\n   * `std(A) = sqrt(variance(A))`.\n   * In case of a (multi dimensional) array or matrix, the standard deviation\n   * over all elements will be calculated by default, unless an axis is specified\n   * in which case the standard deviation will be computed along that axis.\n   *\n   * Additionally, it is possible to compute the standard deviation along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Syntax:\n   *\n   *     math.std(a, b, c, ...)\n   *     math.std(A)\n   *     math.std(A, normalization)\n   *     math.std(A, dimension)\n   *     math.std(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.std(2, 4, 6)                     // returns 2\n   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611\n   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979\n   *     math.std([2, 4, 6, 8], 'biased')      // returns 2\n   *\n   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707\n   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, sum, variance\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the standard deviation for a matrix\n   * @return {*} The standard deviation\n   */\n  return typed(name, {\n    // std([a, b, c, d, ...])\n    'Array | Matrix': _std,\n\n    // std([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _std,\n\n    // std([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': _std,\n\n    // std([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _std,\n\n    // std(a, b, c, d, ...)\n    '...': function (args) {\n      return _std(args)\n    }\n  })\n\n  function _std (array, normalization) {\n    if (array.length === 0) {\n      throw new SyntaxError('Function std requires one or more parameters (0 provided)')\n    }\n\n    try {\n      return sqrt(variance.apply(null, arguments))\n    } catch (err) {\n      if (err instanceof TypeError && err.message.indexOf(' variance') !== -1) {\n        throw new TypeError(err.message.replace(' variance', ' std'))\n      } else {\n        throw err\n      }\n    }\n  }\n})\n","/** @param {number} i\n *  @param {number} n\n *  @returns {number} product of i to n\n */\nexport function product (i, n) {\n  if (n < i) {\n    return 1\n  }\n\n  if (n === i) {\n    return n\n  }\n\n  const half = (n + i) >> 1 // divide (n + i) by 2 and truncate to integer\n  return product(i, half) * product(half + 1, n)\n}\n","import { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\n\nexport function combinationsNumber (n, k) {\n  if (!isInteger(n) || n < 0) {\n    throw new TypeError('Positive integer value expected in function combinations')\n  }\n  if (!isInteger(k) || k < 0) {\n    throw new TypeError('Positive integer value expected in function combinations')\n  }\n  if (k > n) {\n    throw new TypeError('k must be less than or equal to n')\n  }\n\n  const nMinusk = n - k\n\n  let answer = 1\n  const firstnumerator = (k < nMinusk) ? nMinusk + 1 : k + 1\n  let nextdivisor = 2\n  const lastdivisor = (k < nMinusk) ? k : nMinusk\n  // balance multiplications and divisions to try to keep intermediate values\n  // in exact-integer range as long as possible\n  for (let nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {\n    answer *= nextnumerator\n    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {\n      answer /= nextdivisor\n      ++nextdivisor\n    }\n  }\n  // for big n, k, floating point may have caused weirdness in remainder\n  if (nextdivisor <= lastdivisor) {\n    answer /= product(nextdivisor, lastdivisor)\n  }\n  return answer\n}\ncombinationsNumber.signature = 'number, number'\n","import { factory } from '../../utils/factory.js'\nimport { combinationsNumber } from '../../plain/number/combinations.js'\n\nconst name = 'combinations'\nconst dependencies = ['typed']\n\nexport const createCombinations = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the number of ways of picking `k` unordered outcomes from `n`\n   * possibilities.\n   *\n   * Combinations only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *     math.combinations(n, k)\n   *\n   * Examples:\n   *\n   *    math.combinations(7, 5) // returns 21\n   *\n   * See also:\n   *\n   *    combinationsWithRep, permutations, factorial\n   *\n   * @param {number | BigNumber} n    Total number of objects in the set\n   * @param {number | BigNumber} k    Number of objects in the subset\n   * @return {number | BigNumber}     Number of possible combinations.\n   */\n  return typed(name, {\n    'number, number': combinationsNumber,\n\n    'BigNumber, BigNumber': function (n, k) {\n      const BigNumber = n.constructor\n      let result, i\n      const nMinusk = n.minus(k)\n      const one = new BigNumber(1)\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinations')\n      }\n      if (k.gt(n)) {\n        throw new TypeError('k must be less than n in function combinations')\n      }\n\n      result = one\n      if (k.lt(nMinusk)) {\n        for (i = one; i.lte(nMinusk); i = i.plus(one)) {\n          result = result.times(k.plus(i)).dividedBy(i)\n        }\n      } else {\n        for (i = one; i.lte(k); i = i.plus(one)) {\n          result = result.times(nMinusk.plus(i)).dividedBy(i)\n        }\n      }\n\n      return result\n    }\n\n    // TODO: implement support for collection in combinations\n  })\n})\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nfunction isPositiveInteger (n) {\n  return n.isInteger() && n.gte(0)\n}\n","import { factory } from '../../utils/factory.js'\nimport { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\n\nconst name = 'combinationsWithRep'\nconst dependencies = ['typed']\n\nexport const createCombinationsWithRep = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the number of ways of picking `k` unordered outcomes from `n`\n   * possibilities, allowing individual outcomes to be repeated more than once.\n   *\n   * CombinationsWithRep only takes integer arguments.\n   * The following condition must be enforced: k <= n + k -1.\n   *\n   * Syntax:\n   *\n   *     math.combinationsWithRep(n, k)\n   *\n   * Examples:\n   *\n   *    math.combinationsWithRep(7, 5) // returns 462\n   *\n   * See also:\n   *\n   *    combinations, permutations, factorial\n   *\n   * @param {number | BigNumber} n    Total number of objects in the set\n   * @param {number | BigNumber} k    Number of objects in the subset\n   * @return {number | BigNumber}     Number of possible combinations with replacement.\n   */\n  return typed(name, {\n    'number, number': function (n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep')\n      }\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep')\n      }\n      if (n < 1) {\n        throw new TypeError('k must be less than or equal to n + k - 1')\n      }\n\n      if (k < n - 1) {\n        const prodrange = product(n, n + k - 1)\n        return prodrange / product(1, k)\n      }\n      const prodrange = product(k + 1, n + k - 1)\n      return prodrange / product(1, n - 1)\n    },\n\n    'BigNumber, BigNumber': function (n, k) {\n      const BigNumber = n.constructor\n      let result, i\n      const one = new BigNumber(1)\n      const nMinusOne = n.minus(one)\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep')\n      }\n      if (n.lt(one)) {\n        throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep')\n      }\n\n      result = one\n      if (k.lt(nMinusOne)) {\n        for (i = one; i.lte(nMinusOne); i = i.plus(one)) {\n          result = result.times(k.plus(i)).dividedBy(i)\n        }\n      } else {\n        for (i = one; i.lte(k); i = i.plus(one)) {\n          result = result.times(nMinusOne.plus(i)).dividedBy(i)\n        }\n      }\n\n      return result\n    }\n  })\n})\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nfunction isPositiveInteger (n) {\n  return n.isInteger() && n.gte(0)\n}\n","/* eslint-disable no-loss-of-precision */\n\nimport { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\n\nexport function gammaNumber (n) {\n  let x\n\n  if (isInteger(n)) {\n    if (n <= 0) {\n      return isFinite(n) ? Infinity : NaN\n    }\n\n    if (n > 171) {\n      return Infinity // Will overflow\n    }\n\n    return product(1, n - 1)\n  }\n\n  if (n < 0.5) {\n    return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n))\n  }\n\n  if (n >= 171.35) {\n    return Infinity // will overflow\n  }\n\n  if (n > 85.0) { // Extended Stirling Approx\n    const twoN = n * n\n    const threeN = twoN * n\n    const fourN = threeN * n\n    const fiveN = fourN * n\n    return Math.sqrt(2 * Math.PI / n) * Math.pow((n / Math.E), n) *\n      (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) -\n        571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) +\n        5246819 / (75246796800 * fiveN * n))\n  }\n\n  --n\n  x = gammaP[0]\n  for (let i = 1; i < gammaP.length; ++i) {\n    x += gammaP[i] / (n + i)\n  }\n\n  const t = n + gammaG + 0.5\n  return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x\n}\ngammaNumber.signature = 'number'\n\n// TODO: comment on the variables g and p\n\nexport const gammaG = 4.7421875\n\nexport const gammaP = [\n  0.99999999999999709182,\n  57.156235665862923517,\n  -59.597960355475491248,\n  14.136097974741747174,\n  -0.49191381609762019978,\n  0.33994649984811888699e-4,\n  0.46523628927048575665e-4,\n  -0.98374475304879564677e-4,\n  0.15808870322491248884e-3,\n  -0.21026444172410488319e-3,\n  0.21743961811521264320e-3,\n  -0.16431810653676389022e-3,\n  0.84418223983852743293e-4,\n  -0.26190838401581408670e-4,\n  0.36899182659531622704e-5\n]\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js'\n\nconst name = 'gamma'\nconst dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex']\n\nexport const createGamma = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, multiplyScalar, pow, BigNumber, Complex }) => {\n  /**\n   * Compute the gamma function of a value using Lanczos approximation for\n   * small values, and an extended Stirling approximation for large values.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.gamma(n)\n   *\n   * Examples:\n   *\n   *    math.gamma(5)       // returns 24\n   *    math.gamma(-0.5)    // returns -3.5449077018110335\n   *    math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i\n   *\n   * See also:\n   *\n   *    combinations, factorial, permutations\n   *\n   * @param {number | Array | Matrix} n   A real or complex number\n   * @return {number | Array | Matrix}    The gamma of `n`\n   */\n\n  return typed(name, {\n\n    number: gammaNumber,\n\n    Complex: function (n) {\n      if (n.im === 0) {\n        return this(n.re)\n      }\n\n      // Lanczos approximation doesn't work well with real part lower than 0.5\n      // So reflection formula is required\n      if (n.re < 0.5) { // Euler's reflection formula\n        // gamma(1-z) * gamma(z) = PI / sin(PI * z)\n        // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]\n        // thanks to imperfect sin implementation sin(PI * n) != 0\n        // we can safely use it anyway\n        const t = new Complex(1 - n.re, -n.im)\n        const r = new Complex(Math.PI * n.re, Math.PI * n.im)\n\n        return new Complex(Math.PI).div(r.sin()).div(this(t))\n      }\n\n      // Lanczos approximation\n      // z -= 1\n      n = new Complex(n.re - 1, n.im)\n\n      // x = gammaPval[0]\n      let x = new Complex(gammaP[0], 0)\n      // for (i, gammaPval) in enumerate(gammaP):\n      for (let i = 1; i < gammaP.length; ++i) {\n        // x += gammaPval / (z + i)\n        const gammaPval = new Complex(gammaP[i], 0)\n        x = x.add(gammaPval.div(n.add(i)))\n      }\n      // t = z + gammaG + 0.5\n      const t = new Complex(n.re + gammaG + 0.5, n.im)\n\n      // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x\n      const twoPiSqrt = Math.sqrt(2 * Math.PI)\n      const tpow = t.pow(n.add(0.5))\n      const expt = t.neg().exp()\n\n      // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]\n      return x.mul(twoPiSqrt).mul(tpow).mul(expt)\n    },\n\n    BigNumber: function (n) {\n      if (n.isInteger()) {\n        return (n.isNegative() || n.isZero())\n          ? new BigNumber(Infinity)\n          : bigFactorial(n.minus(1))\n      }\n\n      if (!n.isFinite()) {\n        return new BigNumber(n.isNegative() ? NaN : Infinity)\n      }\n\n      throw new Error('Integer BigNumber expected')\n    },\n\n    'Array | Matrix': function (n) {\n      return deepMap(n, this)\n    }\n  })\n\n  /**\n   * Calculate factorial for a BigNumber\n   * @param {BigNumber} n\n   * @returns {BigNumber} Returns the factorial of n\n   */\n  function bigFactorial (n) {\n    if (n < 8) {\n      return new BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n])\n    }\n\n    const precision = config.precision + (Math.log(n.toNumber()) | 0)\n    const Big = BigNumber.clone({ precision: precision })\n\n    if (n % 2 === 1) {\n      return n.times(bigFactorial(new BigNumber(n - 1)))\n    }\n\n    let p = n\n    let prod = new Big(n)\n    let sum = n.toNumber()\n\n    while (p > 2) {\n      p -= 2\n      sum += p\n      prod = prod.times(sum)\n    }\n\n    return new BigNumber(prod.toPrecision(BigNumber.precision))\n  }\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'factorial'\nconst dependencies = ['typed', 'gamma']\n\nexport const createFactorial = /* #__PURE__ */ factory(name, dependencies, ({ typed, gamma }) => {\n  /**\n   * Compute the factorial of a value\n   *\n   * Factorial only supports an integer value as argument.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.factorial(n)\n   *\n   * Examples:\n   *\n   *    math.factorial(5)    // returns 120\n   *    math.factorial(3)    // returns 6\n   *\n   * See also:\n   *\n   *    combinations, combinationsWithRep, gamma, permutations\n   *\n   * @param {number | BigNumber | Array | Matrix} n   An integer number\n   * @return {number | BigNumber | Array | Matrix}    The factorial of `n`\n   */\n  return typed(name, {\n    number: function (n) {\n      if (n < 0) {\n        throw new Error('Value must be non-negative')\n      }\n\n      return gamma(n + 1)\n    },\n\n    BigNumber: function (n) {\n      if (n.isNegative()) {\n        throw new Error('Value must be non-negative')\n      }\n\n      return gamma(n.plus(1))\n    },\n\n    'Array | Matrix': function (n) {\n      return deepMap(n, this)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'kldivergence'\nconst dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric']\n\nexport const createKldivergence = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divide, sum, multiply, dotDivide, log, isNumeric }) => {\n  /**\n     * Calculate the Kullback-Leibler (KL) divergence  between two distributions\n     *\n     * Syntax:\n     *\n     *     math.kldivergence(x, y)\n     *\n     * Examples:\n     *\n     *     math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153\n     *\n     *\n     * @param  {Array | Matrix} q    First vector\n     * @param  {Array | Matrix} p    Second vector\n     * @return {number}              Returns distance between q and p\n     */\n  return typed(name, {\n    'Array, Array': function (q, p) {\n      return _kldiv(matrix(q), matrix(p))\n    },\n\n    'Matrix, Array': function (q, p) {\n      return _kldiv(q, matrix(p))\n    },\n\n    'Array, Matrix': function (q, p) {\n      return _kldiv(matrix(q), p)\n    },\n\n    'Matrix, Matrix': function (q, p) {\n      return _kldiv(q, p)\n    }\n\n  })\n\n  function _kldiv (q, p) {\n    const plength = p.size().length\n    const qlength = q.size().length\n    if (plength > 1) {\n      throw new Error('first object must be one dimensional')\n    }\n\n    if (qlength > 1) {\n      throw new Error('second object must be one dimensional')\n    }\n\n    if (plength !== qlength) {\n      throw new Error('Length of two vectors must be equal')\n    }\n\n    // Before calculation, apply normalization\n    const sumq = sum(q)\n    if (sumq === 0) {\n      throw new Error('Sum of elements in first object must be non zero')\n    }\n\n    const sump = sum(p)\n    if (sump === 0) {\n      throw new Error('Sum of elements in second object must be non zero')\n    }\n    const qnorm = divide(q, sum(q))\n    const pnorm = divide(p, sum(p))\n\n    const result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))))\n    if (isNumeric(result)) {\n      return result\n    } else {\n      return Number.NaN\n    }\n  }\n})\n","import { deepForEach } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'multinomial'\nconst dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive']\n\nexport const createMultinomial = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide, multiply, factorial, isInteger, isPositive }) => {\n  /**\n   * Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.\n   *\n   * multinomial takes one array of integers as an argument.\n   * The following condition must be enforced: every ai <= 0\n   *\n   * Syntax:\n   *\n   *     math.multinomial(a) // a is an array type\n   *\n   * Examples:\n   *\n   *    math.multinomial([1,2,1]) // returns 12\n   *\n   * See also:\n   *\n   *    combinations, factorial\n   *\n   * @param {number[] | BigNumber[]} a    Integer numbers of objects in the subset\n   * @return {Number | BigNumber}         Multinomial coefficient.\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      let sum = 0\n      let denom = 1\n\n      deepForEach(a, function (ai) {\n        if (!isInteger(ai) || !isPositive(ai)) {\n          throw new TypeError('Positive integer value expected in function multinomial')\n        }\n        sum = add(sum, ai)\n        denom = multiply(denom, factorial(ai))\n      })\n\n      return divide(factorial(sum), denom)\n    }\n  })\n})\n","import { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'permutations'\nconst dependencies = ['typed', 'factorial']\n\nexport const createPermutations = /* #__PURE__ */ factory(name, dependencies, ({ typed, factorial }) => {\n  /**\n   * Compute the number of ways of obtaining an ordered subset of `k` elements\n   * from a set of `n` elements.\n   *\n   * Permutations only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *     math.permutations(n)\n   *     math.permutations(n, k)\n   *\n   * Examples:\n   *\n   *    math.permutations(5)     // 120\n   *    math.permutations(5, 3)  // 60\n   *\n   * See also:\n   *\n   *    combinations, combinationsWithRep, factorial\n   *\n   * @param {number | BigNumber} n   The number of objects in total\n   * @param {number | BigNumber} [k] The number of objects in the subset\n   * @return {number | BigNumber}    The number of permutations\n   */\n  return typed(name, {\n    'number | BigNumber': factorial,\n    'number, number': function (n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function permutations')\n      }\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function permutations')\n      }\n      if (k > n) {\n        throw new TypeError('second argument k must be less than or equal to first argument n')\n      }\n      // Permute n objects, k at a time\n      return product((n - k) + 1, n)\n    },\n\n    'BigNumber, BigNumber': function (n, k) {\n      let result, i\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function permutations')\n      }\n      if (k.gt(n)) {\n        throw new TypeError('second argument k must be less than or equal to first argument n')\n      }\n\n      const one = n.mul(0).add(1)\n      result = one\n      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {\n        result = result.times(i)\n      }\n\n      return result\n    }\n\n    // TODO: implement support for collection in permutations\n  })\n})\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nfunction isPositiveInteger (n) {\n  return n.isInteger() && n.gte(0)\n}\n","import seedrandom from 'seedrandom'\n\nconst singletonRandom = /* #__PURE__ */ seedrandom(Date.now())\n\nexport function createRng (randomSeed) {\n  let random\n\n  // create a new random generator with given seed\n  function setSeed (seed) {\n    random = seed === null ? singletonRandom : seedrandom(String(seed))\n  }\n\n  // initialize a seeded pseudo random number generator with config's random seed\n  setSeed(randomSeed)\n\n  // wrapper function so the rng can be updated via generator\n  function rng () {\n    return random()\n  }\n\n  return rng\n}\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { isMatrix, isNumber } from '../../utils/is.js'\nimport { createRng } from './util/seededRNG.js'\n\nconst name = 'pickRandom'\nconst dependencies = ['typed', 'config', '?on']\n\nexport const createPickRandom = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, on }) => {\n  // seeded pseudo random number generator\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  /**\n   * Random pick one or more values from a one dimensional array.\n   * Array elements are picked using a random function with uniform or weighted distribution.\n   *\n   * Syntax:\n   *\n   *     math.pickRandom(array)\n   *     math.pickRandom(array, number)\n   *     math.pickRandom(array, weights)\n   *     math.pickRandom(array, number, weights)\n   *     math.pickRandom(array, weights, number)\n   *     math.pickRandom(array, { weights, number, elementWise })\n   *\n   * Examples:\n   *\n   *     math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], { number: 2 })   // returns an array of two of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution\n   *     math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution\n   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution\n   *\n   *     math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })\n   *         // returns one of the items in the array\n   *\n   * See also:\n   *\n   *     random, randomInt\n   *\n   * @param {Array | Matrix} array     A one dimensional array\n   * @param {Int} number               An int or float\n   * @param {Array | Matrix} weights   An array of ints or floats\n   * @return {number | Array}          Returns a single random value from array when number is 1 or undefined.\n   *                                   Returns an array with the configured number of elements when number is > 1.\n   */\n  return typed(name, {\n    'Array | Matrix': function (possibles) {\n      return _pickRandom(possibles, {})\n    },\n\n    'Array | Matrix, Object': function (possibles, options) {\n      return _pickRandom(possibles, options)\n    },\n\n    'Array | Matrix, number': function (possibles, number) {\n      return _pickRandom(possibles, { number })\n    },\n\n    'Array | Matrix, Array | Matrix': function (possibles, weights) {\n      return _pickRandom(possibles, { weights })\n    },\n\n    'Array | Matrix, Array | Matrix, number': function (possibles, weights, number) {\n      return _pickRandom(possibles, { number, weights })\n    },\n\n    'Array | Matrix, number, Array | Matrix': function (possibles, number, weights) {\n      return _pickRandom(possibles, { number, weights })\n    }\n  })\n\n  /**\n   * @param {Array | Matrix} possibles\n   * @param {{\n   *   number?: number,\n   *   weights?: Array | Matrix,\n   *   elementWise: boolean\n   * }} options\n   * @returns {number | Array}\n   * @private\n   */\n  function _pickRandom (possibles, { number, weights, elementWise = true }) {\n    const single = (typeof number === 'undefined')\n    if (single) {\n      number = 1\n    }\n\n    const createMatrix = isMatrix(possibles)\n      ? possibles.create\n      : isMatrix(weights)\n        ? weights.create\n        : null\n\n    possibles = possibles.valueOf() // get Array\n    if (weights) {\n      weights = weights.valueOf() // get Array\n    }\n\n    if (elementWise === true) {\n      possibles = flatten(possibles)\n      weights = flatten(weights)\n    }\n\n    let totalWeights = 0\n\n    if (typeof weights !== 'undefined') {\n      if (weights.length !== possibles.length) {\n        throw new Error('Weights must have the same length as possibles')\n      }\n\n      for (let i = 0, len = weights.length; i < len; i++) {\n        if (!isNumber(weights[i]) || weights[i] < 0) {\n          throw new Error('Weights must be an array of positive numbers')\n        }\n\n        totalWeights += weights[i]\n      }\n    }\n\n    const length = possibles.length\n\n    const result = []\n    let pick\n\n    while (result.length < number) {\n      if (typeof weights === 'undefined') {\n        pick = possibles[Math.floor(rng() * length)]\n      } else {\n        let randKey = rng() * totalWeights\n\n        for (let i = 0, len = possibles.length; i < len; i++) {\n          randKey -= weights[i]\n\n          if (randKey < 0) {\n            pick = possibles[i]\n            break\n          }\n        }\n      }\n\n      result.push(pick)\n    }\n\n    return single\n      ? result[0]\n      : createMatrix\n        ? createMatrix(result)\n        : result\n  }\n})\n","/**\n * This is a util function for generating a random matrix recursively.\n * @param {number[]} size\n * @param {function} random\n * @returns {Array}\n */\nexport function randomMatrix (size, random) {\n  const data = []\n  size = size.slice(0)\n\n  if (size.length > 1) {\n    for (let i = 0, length = size.shift(); i < length; i++) {\n      data.push(randomMatrix(size, random))\n    }\n  } else {\n    for (let i = 0, length = size.shift(); i < length; i++) {\n      data.push(random())\n    }\n  }\n\n  return data\n}\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { createRng } from './util/seededRNG.js'\nimport { randomMatrix } from './util/randomMatrix.js'\n\nconst name = 'random'\nconst dependencies = ['typed', 'config', '?on']\n\nexport const createRandom = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, on }) => {\n  // seeded pseudo random number generator\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  /**\n   * Return a random number larger or equal to `min` and smaller than `max`\n   * using a uniform distribution.\n   *\n   * Syntax:\n   *\n   *     math.random()                // generate a random number between 0 and 1\n   *     math.random(max)             // generate a random number between 0 and max\n   *     math.random(min, max)        // generate a random number between min and max\n   *     math.random(size)            // generate a matrix with random numbers between 0 and 1\n   *     math.random(size, max)       // generate a matrix with random numbers between 0 and max\n   *     math.random(size, min, max)  // generate a matrix with random numbers between min and max\n   *\n   * Examples:\n   *\n   *     math.random()       // returns a random number between 0 and 1\n   *     math.random(100)    // returns a random number between 0 and 100\n   *     math.random(30, 40) // returns a random number between 30 and 40\n   *     math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1\n   *\n   * See also:\n   *\n   *     randomInt, pickRandom\n   *\n   * @param {Array | Matrix} [size] If provided, an array or matrix with given\n   *                                size and filled with random values is returned\n   * @param {number} [min]  Minimum boundary for the random value, included\n   * @param {number} [max]  Maximum boundary for the random value, excluded\n   * @return {number | Array | Matrix} A random number\n   */\n  return typed(name, {\n    '': () => _random(0, 1),\n    number: (max) => _random(0, max),\n    'number, number': (min, max) => _random(min, max),\n    'Array | Matrix': (size) => _randomMatrix(size, 0, 1),\n    'Array | Matrix, number': (size, max) => _randomMatrix(size, 0, max),\n    'Array | Matrix, number, number': (size, min, max) => _randomMatrix(size, min, max)\n  })\n\n  function _randomMatrix (size, min, max) {\n    const res = randomMatrix(size.valueOf(), () => _random(min, max))\n    return isMatrix(size) ? size.create(res) : res\n  }\n\n  function _random (min, max) {\n    return min + rng() * (max - min)\n  }\n})\n\n// number only implementation of random, no matrix support\n// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?\nexport const createRandomNumber = /* #__PURE__ */ factory(name, ['typed', 'config', '?on'], ({ typed, config, on, matrix }) => {\n  // seeded pseudo random number generator1\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  return typed(name, {\n    '': () => _random(0, 1),\n    number: (max) => _random(0, max),\n    'number, number': (min, max) => _random(min, max)\n  })\n\n  function _random (min, max) {\n    return min + rng() * (max - min)\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { randomMatrix } from './util/randomMatrix.js'\nimport { createRng } from './util/seededRNG.js'\nimport { isMatrix } from '../../utils/is.js'\n\nconst name = 'randomInt'\nconst dependencies = ['typed', 'config', '?on']\n\nexport const createRandomInt = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, on }) => {\n  // seeded pseudo random number generator\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  /**\n   * Return a random integer number larger or equal to `min` and smaller than `max`\n   * using a uniform distribution.\n   *\n   * Syntax:\n   *\n   *     math.randomInt()                // generate a random integer between 0 and 1\n   *     math.randomInt(max)             // generate a random integer between 0 and max\n   *     math.randomInt(min, max)        // generate a random integer between min and max\n   *     math.randomInt(size)            // generate a matrix with random integer between 0 and 1\n   *     math.randomInt(size, max)       // generate a matrix with random integer between 0 and max\n   *     math.randomInt(size, min, max)  // generate a matrix with random integer between min and max\n   *\n   * Examples:\n   *\n   *     math.randomInt(100)    // returns a random integer between 0 and 100\n   *     math.randomInt(30, 40) // returns a random integer between 30 and 40\n   *     math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1\n   *\n   * See also:\n   *\n   *     random, pickRandom\n   *\n   * @param {Array | Matrix} [size] If provided, an array or matrix with given\n   *                                size and filled with random values is returned\n   * @param {number} [min]  Minimum boundary for the random value, included\n   * @param {number} [max]  Maximum boundary for the random value, excluded\n   * @return {number | Array | Matrix} A random integer value\n   */\n  return typed(name, {\n    '': () => _randomInt(0, 1),\n    number: (max) => _randomInt(0, max),\n    'number, number': (min, max) => _randomInt(min, max),\n    'Array | Matrix': (size) => _randomIntMatrix(size, 0, 1),\n    'Array | Matrix, number': (size, max) => _randomIntMatrix(size, 0, max),\n    'Array | Matrix, number, number': (size, min, max) => _randomIntMatrix(size, min, max)\n  })\n\n  function _randomIntMatrix (size, min, max) {\n    const res = randomMatrix(size.valueOf(), () => _randomInt(min, max))\n    return isMatrix(size) ? size.create(res) : res\n  }\n\n  function _randomInt (min, max) {\n    return Math.floor(min + rng() * (max - min))\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { isNumber } from '../../utils/is.js'\n\nconst name = 'stirlingS2'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'subtract',\n  'multiplyScalar',\n  'divideScalar',\n  'pow',\n  'factorial',\n  'combinations',\n  'isNegative',\n  'isInteger',\n  'number',\n  '?bignumber',\n  'larger'\n]\n\nexport const createStirlingS2 = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    addScalar,\n    subtract,\n    multiplyScalar,\n    divideScalar,\n    pow,\n    factorial,\n    combinations,\n    isNegative,\n    isInteger,\n    number,\n    bignumber,\n    larger\n  }\n) => {\n  const smallCache = []\n  const bigCache = []\n  /**\n   * The Stirling numbers of the second kind, counts the number of ways to partition\n   * a set of n labelled objects into k nonempty unlabelled subsets.\n   * stirlingS2 only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   *  If n = k or k = 1 <= n, then s(n,k) = 1\n   *  If k = 0 < n, then s(n,k) = 0\n   *\n   * Note that if either n or k is supplied as a BigNumber, the result will be\n   * as well.\n   *\n   * Syntax:\n   *\n   *   math.stirlingS2(n, k)\n   *\n   * Examples:\n   *\n   *    math.stirlingS2(5, 3) //returns 25\n   *\n   * See also:\n   *\n   *    bellNumbers\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @param {Number | BigNumber} k    Number of objects in the subset\n   * @return {Number | BigNumber}     S(n,k)\n   */\n  return typed(name, {\n    'number | BigNumber, number | BigNumber': function (n, k) {\n      if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {\n        throw new TypeError('Non-negative integer value expected in function stirlingS2')\n      } else if (larger(k, n)) {\n        throw new TypeError('k must be less than or equal to n in function stirlingS2')\n      }\n\n      const big = !(isNumber(n) && isNumber(k))\n      const cache = big ? bigCache : smallCache\n      const make = big ? bignumber : number\n      const nn = number(n)\n      const nk = number(k)\n      /* See if we already have the value: */\n      if (cache[nn] && cache[nn].length > nk) {\n        return cache[nn][nk]\n      }\n      /* Fill the cache */\n      for (let m = 0; m <= nn; ++m) {\n        if (!cache[m]) {\n          cache[m] = [m === 0 ? make(1) : make(0)]\n        }\n        if (m === 0) continue\n        const row = cache[m]\n        const prev = cache[m - 1]\n        for (let i = row.length; i <= m && i <= nk; ++i) {\n          if (i === m) {\n            row[i] = 1\n          } else {\n            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1])\n          }\n        }\n      }\n      return cache[nn][nk]\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'bellNumbers'\nconst dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2']\n\nexport const createBellNumbers = /* #__PURE__ */ factory(name, dependencies, ({ typed, addScalar, isNegative, isInteger, stirlingS2 }) => {\n  /**\n   * The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.\n   * bellNumbers only takes integer arguments.\n   * The following condition must be enforced: n >= 0\n   *\n   * Syntax:\n   *\n   *   math.bellNumbers(n)\n   *\n   * Examples:\n   *\n   *    math.bellNumbers(3) // returns 5\n   *    math.bellNumbers(8) // returns 4140\n   *\n   * See also:\n   *\n   *    stirlingS2\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @return {Number | BigNumber}     B(n)\n   */\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function bellNumbers')\n      }\n\n      // Sum (k=0, n) S(n,k).\n      let result = 0\n      for (let i = 0; i <= n; i++) {\n        result = addScalar(result, stirlingS2(n, i))\n      }\n\n      return result\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'catalan'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'combinations',\n  'isNegative',\n  'isInteger'\n]\n\nexport const createCatalan = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    combinations,\n    isNegative,\n    isInteger\n  }\n) => {\n  /**\n   * The Catalan Numbers enumerate combinatorial structures of many different types.\n   * catalan only takes integer arguments.\n   * The following condition must be enforced: n >= 0\n   *\n   * Syntax:\n   *\n   *   math.catalan(n)\n   *\n   * Examples:\n   *\n   *    math.catalan(3) // returns 5\n   *    math.catalan(8) // returns 1430\n   *\n   * See also:\n   *\n   *    bellNumbers\n   *\n   * @param {Number | BigNumber} n    nth Catalan number\n   * @return {Number | BigNumber}     Cn(n)\n   */\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function catalan')\n      }\n\n      return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'composition'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'combinations',\n  'isNegative',\n  'isPositive',\n  'isInteger',\n  'larger'\n]\n\nexport const createComposition = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    addScalar,\n    combinations,\n    isPositive,\n    isNegative,\n    isInteger,\n    larger\n  }\n) => {\n  /**\n   * The composition counts of n into k parts.\n   *\n   * composition only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *   math.composition(n, k)\n   *\n   * Examples:\n   *\n   *    math.composition(5, 3) // returns 6\n   *\n   * See also:\n   *\n   *    combinations\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @param {Number | BigNumber} k    Number of objects in the subset\n   * @return {Number | BigNumber}     Returns the composition counts of n into k parts.\n   */\n  return typed(name, {\n    'number | BigNumber, number | BigNumber': function (n, k) {\n      if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {\n        throw new TypeError('Positive integer value expected in function composition')\n      } else if (larger(k, n)) {\n        throw new TypeError('k must be less than or equal to n in function composition')\n      }\n\n      return combinations(addScalar(n, -1), addScalar(k, -1))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'leafCount'\nconst dependencies = [\n  'parse',\n  'typed'\n]\n\nexport const createLeafCount = /* #__PURE__ */ factory(name, dependencies, ({\n  parse,\n  typed\n}) => {\n  // This does the real work, but we don't have to recurse through\n  // a typed call if we separate it out\n  function countLeaves (node) {\n    let count = 0\n    node.forEach(n => { count += countLeaves(n) })\n    return count || 1\n  }\n\n  /**\n   * Gives the number of \"leaf nodes\" in the parse tree of the given expression\n   * A leaf node is one that has no subexpressions, essentially either a\n   * symbol or a constant. Note that `5!` has just one leaf, the '5'; the\n   * unary factorial operator does not add a leaf. On the other hand,\n   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.\n   *\n   * The `simplify()` function should generally not increase the `leafCount()`\n   * of an expression, although currently there is no guarantee that it never\n   * does so. In many cases, `simplify()` reduces the leaf count.\n   *\n   * Syntax:\n   *\n   *     leafCount(expr)\n   *\n   * Examples:\n   *\n   *     math.leafCount('x') // 1\n   *     math.leafCount(math.parse('a*d-b*c')) // 4\n   *     math.leafCount('[a,b;c,d][0,1]') // 6\n   *\n   * See also:\n   *\n   *     simplify\n   *\n   * @param {Node|string} expr    The expression to count the leaves of\n   *\n   * @return {number}  The number of leaves of `expr`\n   *\n   */\n  return typed(name, {\n    string: function (expr) {\n      return this(parse(expr))\n    },\n    Node: function (expr) {\n      return countLeaves(expr)\n    }\n  })\n})\n","import { isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js'\nimport { factory } from '../../../utils/factory.js'\nimport { hasOwnProperty } from '../../../utils/object.js'\n\nconst name = 'simplifyUtil'\nconst dependencies = [\n  'FunctionNode',\n  'OperatorNode',\n  'SymbolNode'\n]\n\nexport const createUtil = /* #__PURE__ */ factory(name, dependencies, ({ FunctionNode, OperatorNode, SymbolNode }) => {\n  // TODO commutative/associative properties rely on the arguments\n  // e.g. multiply is not commutative for matrices\n  // The properties should be calculated from an argument to simplify, or possibly something in math.config\n  // the other option is for typed() to specify a return type so that we can evaluate the type of arguments\n\n  /* So that properties of an operator fit on one line: */\n  const T = true\n  const F = false\n\n  const defaultName = 'defaultF'\n  const defaultContext = {\n    /*      */ add: { trivial: T, total: T, commutative: T, associative: T },\n    /**/ unaryPlus: { trivial: T, total: T, commutative: T, associative: T },\n    /* */ subtract: { trivial: F, total: T, commutative: F, associative: F },\n    /* */ multiply: { trivial: T, total: T, commutative: T, associative: T },\n    /*   */ divide: { trivial: F, total: T, commutative: F, associative: F },\n    /*    */ paren: { trivial: T, total: T, commutative: T, associative: F },\n    /* */ defaultF: { trivial: F, total: T, commutative: F, associative: F }\n  }\n  const realContext = { divide: { total: F }, log: { total: F } }\n  const positiveContext = {\n    subtract: { total: F },\n    abs: { trivial: T },\n    log: { total: T }\n  }\n\n  function hasProperty (nodeOrName, property, context = defaultContext) {\n    let name = defaultName\n    if (typeof nodeOrName === 'string') {\n      name = nodeOrName\n    } else if (isOperatorNode(nodeOrName)) {\n      name = nodeOrName.fn.toString()\n    } else if (isFunctionNode(nodeOrName)) {\n      name = nodeOrName.name\n    } else if (isParenthesisNode(nodeOrName)) {\n      name = 'paren'\n    }\n    if (hasOwnProperty(context, name)) {\n      const properties = context[name]\n      if (hasOwnProperty(properties, property)) {\n        return properties[property]\n      }\n      if (hasOwnProperty(defaultContext, name)) {\n        return defaultContext[name][property]\n      }\n    }\n    if (hasOwnProperty(context, defaultName)) {\n      const properties = context[defaultName]\n      if (hasOwnProperty(properties, property)) {\n        return properties[property]\n      }\n      return defaultContext[defaultName][property]\n    }\n    /* name not found in context and context has no global default */\n    /* So use default context. */\n    if (hasOwnProperty(defaultContext, name)) {\n      const properties = defaultContext[name]\n      if (hasOwnProperty(properties, property)) {\n        return properties[property]\n      }\n    }\n    return defaultContext[defaultName][property]\n  }\n\n  function isCommutative (node, context = defaultContext) {\n    return hasProperty(node, 'commutative', context)\n  }\n\n  function isAssociative (node, context = defaultContext) {\n    return hasProperty(node, 'associative', context)\n  }\n\n  /**\n   * Merge the given contexts, with primary overriding secondary\n   * wherever they might conflict\n   */\n  function mergeContext (primary, secondary) {\n    const merged = { ...primary }\n    for (const prop in secondary) {\n      if (hasOwnProperty(primary, prop)) {\n        merged[prop] = { ...secondary[prop], ...primary[prop] }\n      } else {\n        merged[prop] = secondary[prop]\n      }\n    }\n    return merged\n  }\n\n  /**\n   * Flatten all associative operators in an expression tree.\n   * Assumes parentheses have already been removed.\n   */\n  function flatten (node, context) {\n    if (!node.args || node.args.length === 0) {\n      return node\n    }\n    node.args = allChildren(node, context)\n    for (let i = 0; i < node.args.length; i++) {\n      flatten(node.args[i], context)\n    }\n  }\n\n  /**\n   * Get the children of a node as if it has been flattened.\n   * TODO implement for FunctionNodes\n   */\n  function allChildren (node, context) {\n    let op\n    const children = []\n    const findChildren = function (node) {\n      for (let i = 0; i < node.args.length; i++) {\n        const child = node.args[i]\n        if (isOperatorNode(child) && op === child.op) {\n          findChildren(child)\n        } else {\n          children.push(child)\n        }\n      }\n    }\n\n    if (isAssociative(node, context)) {\n      op = node.op\n      findChildren(node)\n      return children\n    } else {\n      return node.args\n    }\n  }\n\n  /**\n   *  Unflatten all flattened operators to a right-heavy binary tree.\n   */\n  function unflattenr (node, context) {\n    if (!node.args || node.args.length === 0) {\n      return\n    }\n    const makeNode = createMakeNodeFunction(node)\n    const l = node.args.length\n    for (let i = 0; i < l; i++) {\n      unflattenr(node.args[i], context)\n    }\n    if (l > 2 && isAssociative(node, context)) {\n      let curnode = node.args.pop()\n      while (node.args.length > 0) {\n        curnode = makeNode([node.args.pop(), curnode])\n      }\n      node.args = curnode.args\n    }\n  }\n\n  /**\n   *  Unflatten all flattened operators to a left-heavy binary tree.\n   */\n  function unflattenl (node, context) {\n    if (!node.args || node.args.length === 0) {\n      return\n    }\n    const makeNode = createMakeNodeFunction(node)\n    const l = node.args.length\n    for (let i = 0; i < l; i++) {\n      unflattenl(node.args[i], context)\n    }\n    if (l > 2 && isAssociative(node, context)) {\n      let curnode = node.args.shift()\n      while (node.args.length > 0) {\n        curnode = makeNode([curnode, node.args.shift()])\n      }\n      node.args = curnode.args\n    }\n  }\n\n  function createMakeNodeFunction (node) {\n    if (isOperatorNode(node)) {\n      return function (args) {\n        try {\n          return new OperatorNode(node.op, node.fn, args, node.implicit)\n        } catch (err) {\n          console.error(err)\n          return []\n        }\n      }\n    } else {\n      return function (args) {\n        return new FunctionNode(new SymbolNode(node.name), args)\n      }\n    }\n  }\n\n  return {\n    createMakeNodeFunction,\n    hasProperty,\n    isCommutative,\n    isAssociative,\n    mergeContext,\n    flatten,\n    allChildren,\n    unflattenr,\n    unflattenl,\n    defaultContext,\n    realContext,\n    positiveContext\n  }\n})\n","// TODO this could be improved by simplifying seperated constants under associative and commutative operators\nimport { isFraction, isMatrix, isNode, isArrayNode, isConstantNode, isIndexNode, isObjectNode, isOperatorNode } from '../../../utils/is.js'\nimport { factory } from '../../../utils/factory.js'\nimport { createUtil } from './util.js'\nimport { noBignumber, noFraction } from '../../../utils/noop.js'\n\nconst name = 'simplifyConstant'\nconst dependencies = [\n  'typed',\n  'config',\n  'mathWithTransform',\n  'matrix',\n  '?fraction',\n  '?bignumber',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'SymbolNode'\n]\n\nexport const createSimplifyConstant = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  config,\n  mathWithTransform,\n  matrix,\n  fraction,\n  bignumber,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  SymbolNode\n}) => {\n  const { isCommutative, isAssociative, allChildren, createMakeNodeFunction } =\n    createUtil({ FunctionNode, OperatorNode, SymbolNode })\n\n  function simplifyConstant (expr, options) {\n    return _ensureNode(foldFraction(expr, options))\n  }\n\n  function _removeFractions (thing) {\n    if (isFraction(thing)) {\n      return thing.valueOf()\n    }\n    if (thing instanceof Array) {\n      return thing.map(_removeFractions)\n    }\n    if (isMatrix(thing)) {\n      return matrix(_removeFractions(thing.valueOf()))\n    }\n    return thing\n  }\n\n  function _eval (fnname, args, options) {\n    try {\n      return mathWithTransform[fnname].apply(null, args)\n    } catch (ignore) {\n      // sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions\n      args = args.map(_removeFractions)\n      return _toNumber(mathWithTransform[fnname].apply(null, args), options)\n    }\n  }\n\n  const _toNode = typed({\n    Fraction: _fractionToNode,\n    number: function (n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n))\n      }\n      return new ConstantNode(n)\n    },\n    BigNumber: function (n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n))\n      }\n      return new ConstantNode(n) // old parameters: (n.toString(), 'number')\n    },\n    Complex: function (s) {\n      throw new Error('Cannot convert Complex number to Node')\n    },\n    string: function (s) {\n      return new ConstantNode(s)\n    },\n    Matrix: function (m) {\n      return new ArrayNode(m.valueOf().map(e => _toNode(e)))\n    }\n  })\n\n  function _ensureNode (thing) {\n    if (isNode(thing)) {\n      return thing\n    }\n    return _toNode(thing)\n  }\n\n  // convert a number to a fraction only if it can be expressed exactly,\n  // and when both numerator and denominator are small enough\n  function _exactFraction (n, options) {\n    const exactFractions = (options && options.exactFractions !== false)\n    if (exactFractions && isFinite(n) && fraction) {\n      const f = fraction(n)\n      const fractionsLimit = (options && typeof options.fractionsLimit === 'number')\n        ? options.fractionsLimit\n        : Infinity // no limit by default\n\n      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {\n        return f\n      }\n    }\n    return n\n  }\n\n  // Convert numbers to a preferred number type in preference order: Fraction, number, Complex\n  // BigNumbers are left alone\n  const _toNumber = typed({\n    'string, Object': function (s, options) {\n      if (config.number === 'BigNumber') {\n        if (bignumber === undefined) {\n          noBignumber()\n        }\n        return bignumber(s)\n      } else if (config.number === 'Fraction') {\n        if (fraction === undefined) {\n          noFraction()\n        }\n        return fraction(s)\n      } else {\n        const n = parseFloat(s)\n        return _exactFraction(n, options)\n      }\n    },\n\n    'Fraction, Object': function (s, options) { return s }, // we don't need options here\n\n    'BigNumber, Object': function (s, options) { return s }, // we don't need options here\n\n    'number, Object': function (s, options) {\n      return _exactFraction(s, options)\n    },\n\n    'Complex, Object': function (s, options) {\n      if (s.im !== 0) {\n        return s\n      }\n      return _exactFraction(s.re, options)\n    },\n\n    'Matrix, Object': function (s, options) {\n      return matrix(_exactFraction(s.valueOf()))\n    },\n\n    'Array, Object': function (s, options) {\n      return s.map(_exactFraction)\n    }\n  })\n\n  function unaryMinusNode (n) {\n    return new OperatorNode('-', 'unaryMinus', [n])\n  }\n\n  function _fractionToNode (f) {\n    let n\n    const vn = f.s * f.n\n    if (vn < 0) {\n      n = new OperatorNode('-', 'unaryMinus', [new ConstantNode(-vn)])\n    } else {\n      n = new ConstantNode(vn)\n    }\n\n    if (f.d === 1) {\n      return n\n    }\n    return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)])\n  }\n\n  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */\n  function _foldAccessor (obj, index, options) {\n    if (!isIndexNode(index)) { // don't know what to do with that...\n      return new AccessorNode(_ensureNode(obj), _ensureNode(index))\n    }\n    if (isArrayNode(obj) || isMatrix(obj)) {\n      const remainingDims = Array.from(index.dimensions)\n      /* We will resolve constant indices one at a time, looking\n       * just in the first or second dimensions because (a) arrays\n       * of more than two dimensions are likely rare, and (b) pulling\n       * out the third or higher dimension would be pretty intricate.\n       * The price is that we miss simplifying [..3d array][x,y,1]\n       */\n      while (remainingDims.length > 0) {\n        if (isConstantNode(remainingDims[0]) &&\n            typeof remainingDims[0].value !== 'string') {\n          const first = _toNumber(remainingDims.shift().value, options)\n          if (isArrayNode(obj)) {\n            obj = obj.items[first - 1]\n          } else { // matrix\n            obj = obj.valueOf()[first - 1]\n            if (obj instanceof Array) {\n              obj = matrix(obj)\n            }\n          }\n        } else if (remainingDims.length > 1 &&\n                   isConstantNode(remainingDims[1]) &&\n                   typeof remainingDims[1].value !== 'string') {\n          const second = _toNumber(remainingDims[1].value, options)\n          const tryItems = []\n          const fromItems = isArrayNode(obj) ? obj.items : obj.valueOf()\n          for (const item of fromItems) {\n            if (isArrayNode(item)) {\n              tryItems.push(item.items[second - 1])\n            } else if (isMatrix(obj)) {\n              tryItems.push(item[second - 1])\n            } else {\n              break\n            }\n          }\n          if (tryItems.length === fromItems.length) {\n            if (isArrayNode(obj)) {\n              obj = new ArrayNode(tryItems)\n            } else { // matrix\n              obj = matrix(tryItems)\n            }\n            remainingDims.splice(1, 1)\n          } else { // extracting slice along 2nd dimension failed, give up\n            break\n          }\n        } else { // neither 1st or 2nd dimension is constant, give up\n          break\n        }\n      }\n      if (remainingDims.length === index.dimensions.length) {\n        /* No successful constant indexing */\n        return new AccessorNode(_ensureNode(obj), index)\n      }\n      if (remainingDims.length > 0) {\n        /* Indexed some but not all dimensions */\n        index = new IndexNode(remainingDims)\n        return new AccessorNode(_ensureNode(obj), index)\n      }\n      /* All dimensions were constant, access completely resolved */\n      return obj\n    }\n    if (isObjectNode(obj) &&\n        index.dimensions.length === 1 &&\n        isConstantNode(index.dimensions[0])) {\n      const key = index.dimensions[0].value\n      if (key in obj.properties) {\n        return obj.properties[key]\n      }\n      return new ConstantNode() // undefined\n    }\n    /* Don't know how to index this sort of obj, at least not with this index */\n    return new AccessorNode(_ensureNode(obj), index)\n  }\n\n  /*\n   * Create a binary tree from a list of Fractions and Nodes.\n   * Tries to fold Fractions by evaluating them until the first Node in the list is hit, so\n   * `args` should be sorted to have the Fractions at the start (if the operator is commutative).\n   * @param args - list of Fractions and Nodes\n   * @param fn - evaluator for the binary operation evaluator that accepts two Fractions\n   * @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes\n   * if args.length is 1, returns args[0]\n   * @return - Either a Node representing a binary expression or Fraction\n   */\n  function foldOp (fn, args, makeNode, options) {\n    return args.reduce(function (a, b) {\n      if (!isNode(a) && !isNode(b)) {\n        try {\n          return _eval(fn, [a, b], options)\n        } catch (ignoreandcontinue) {}\n        a = _toNode(a)\n        b = _toNode(b)\n      } else if (!isNode(a)) {\n        a = _toNode(a)\n      } else if (!isNode(b)) {\n        b = _toNode(b)\n      }\n\n      return makeNode([a, b])\n    })\n  }\n\n  // destroys the original node and returns a folded one\n  function foldFraction (node, options) {\n    switch (node.type) {\n      case 'SymbolNode':\n        return node\n      case 'ConstantNode':\n        switch (typeof node.value) {\n          case 'number': return _toNumber(node.value, options)\n          case 'string': return node.value\n          default:\n            if (!isNaN(node.value)) return _toNumber(node.value, options)\n        }\n        return node\n      case 'FunctionNode':\n        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {\n          return node\n        }\n        {\n          // Process operators as OperatorNode\n          const operatorFunctions = ['add', 'multiply']\n          if (operatorFunctions.indexOf(node.name) === -1) {\n            const args = node.args.map(arg => foldFraction(arg, options))\n\n            // If all args are numbers\n            if (!args.some(isNode)) {\n              try {\n                return _eval(node.name, args, options)\n              } catch (ignoreandcontinue) { }\n            }\n\n            // Size of a matrix does not depend on entries\n            if (node.name === 'size' &&\n                args.length === 1 &&\n                isArrayNode(args[0])) {\n              const sz = []\n              let section = args[0]\n              while (isArrayNode(section)) {\n                sz.push(section.items.length)\n                section = section.items[0]\n              }\n              return matrix(sz)\n            }\n\n            // Convert all args to nodes and construct a symbolic function call\n            return new FunctionNode(node.name, args.map(_ensureNode))\n          } else {\n            // treat as operator\n          }\n        }\n        /* falls through */\n      case 'OperatorNode':\n      {\n        const fn = node.fn.toString()\n        let args\n        let res\n        const makeNode = createMakeNodeFunction(node)\n        if (isOperatorNode(node) && node.isUnary()) {\n          args = [foldFraction(node.args[0], options)]\n          if (!isNode(args[0])) {\n            res = _eval(fn, args, options)\n          } else {\n            res = makeNode(args)\n          }\n        } else if (isAssociative(node, options.context)) {\n          args = allChildren(node, options.context)\n          args = args.map(arg => foldFraction(arg, options))\n\n          if (isCommutative(fn, options.context)) {\n            // commutative binary operator\n            const consts = []\n            const vars = []\n\n            for (let i = 0; i < args.length; i++) {\n              if (!isNode(args[i])) {\n                consts.push(args[i])\n              } else {\n                vars.push(args[i])\n              }\n            }\n\n            if (consts.length > 1) {\n              res = foldOp(fn, consts, makeNode, options)\n              vars.unshift(res)\n              res = foldOp(fn, vars, makeNode, options)\n            } else {\n              // we won't change the children order since it's not neccessary\n              res = foldOp(fn, args, makeNode, options)\n            }\n          } else {\n            // non-commutative binary operator\n            res = foldOp(fn, args, makeNode, options)\n          }\n        } else {\n          // non-associative binary operator\n          args = node.args.map(arg => foldFraction(arg, options))\n          res = foldOp(fn, args, makeNode, options)\n        }\n        return res\n      }\n      case 'ParenthesisNode':\n        // remove the uneccessary parenthesis\n        return foldFraction(node.content, options)\n      case 'AccessorNode':\n        return _foldAccessor(\n          foldFraction(node.object, options),\n          foldFraction(node.index, options),\n          options)\n      case 'ArrayNode': {\n        const foldItems = node.items.map(item => foldFraction(item, options))\n        if (foldItems.some(isNode)) {\n          return new ArrayNode(foldItems.map(_ensureNode))\n        }\n        /* All literals -- return a Matrix so we can operate on it */\n        return matrix(foldItems)\n      }\n      case 'IndexNode': {\n        return new IndexNode(\n          node.dimensions.map(n => simplifyConstant(n, options)))\n      }\n      case 'ObjectNode': {\n        const foldProps = {}\n        for (const prop in node.properties) {\n          foldProps[prop] = simplifyConstant(node.properties[prop], options)\n        }\n        return new ObjectNode(foldProps)\n      }\n      case 'AssignmentNode':\n        /* falls through */\n      case 'BlockNode':\n        /* falls through */\n      case 'FunctionAssignmentNode':\n        /* falls through */\n      case 'RangeNode':\n        /* falls through */\n      case 'ConditionalNode':\n        /* falls through */\n      default:\n        throw new Error(`Unimplemented node type in simplifyConstant: ${node.type}`)\n    }\n  }\n\n  return simplifyConstant\n})\n","import { isConstantNode, isParenthesisNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { createUtil } from './simplify/util.js'\nimport { createSimplifyConstant } from './simplify/simplifyConstant.js'\nimport { hasOwnProperty } from '../../utils/object.js'\nimport { createEmptyMap, createMap } from '../../utils/map.js'\n\nconst name = 'simplify'\nconst dependencies = [\n  'config',\n  'typed',\n  'parse',\n  'add',\n  'subtract',\n  'multiply',\n  'divide',\n  'pow',\n  'isZero',\n  'equal',\n  'resolve',\n  'simplifyCore',\n  '?fraction',\n  '?bignumber',\n  'mathWithTransform',\n  'matrix',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'SymbolNode'\n]\n\nexport const createSimplify = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    config,\n    typed,\n    parse,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    isZero,\n    equal,\n    resolve,\n    simplifyCore,\n    fraction,\n    bignumber,\n    mathWithTransform,\n    matrix,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    ParenthesisNode,\n    SymbolNode\n  }\n) => {\n  const simplifyConstant = createSimplifyConstant({\n    typed,\n    config,\n    mathWithTransform,\n    matrix,\n    fraction,\n    bignumber,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    SymbolNode\n  })\n\n  const { hasProperty, isCommutative, isAssociative, mergeContext, flatten, unflattenr, unflattenl, createMakeNodeFunction, defaultContext, realContext, positiveContext } =\n    createUtil({ FunctionNode, OperatorNode, SymbolNode })\n\n  /**\n   * Simplify an expression tree.\n   *\n   * A list of rules are applied to an expression, repeating over the list until\n   * no further changes are made.\n   * It's possible to pass a custom set of rules to the function as second\n   * argument. A rule can be specified as an object, string, or function:\n   *\n   *     const rules = [\n   *       { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },\n   *       'n1*n3 + n2*n3 -> (n1+n2)*n3',\n   *       function (node) {\n   *         // ... return a new node or return the node unchanged\n   *         return node\n   *       }\n   *     ]\n   *\n   * String and object rules consist of a left and right pattern. The left is\n   * used to match against the expression and the right determines what matches\n   * are replaced with. The main difference between a pattern and a normal\n   * expression is that variables starting with the following characters are\n   * interpreted as wildcards:\n   *\n   * - 'n' - matches any Node\n   * - 'c' - matches any ConstantNode\n   * - 'v' - matches any Node that is not a ConstantNode\n   *\n   * The default list of rules is exposed on the function as `simplify.rules`\n   * and can be used as a basis to built a set of custom rules.\n   *\n   * To specify a rule as a string, separate the left and right pattern by '->'\n   * When specifying a rule as an object, the following keys are meaningful:\n   * - l - the left pattern\n   * - r - the right pattern\n   * - s - in lieu of l and r, the string form that is broken at -> to give them\n   * - repeat - whether to repeat this rule until the expression stabilizes\n   * - assuming - gives a context object, as in the 'context' option to\n   *     simplify. Every property in the context object must match the current\n   *     context in order, or else the rule will not be applied.\n   * - imposeContext - gives a context object, as in the 'context' option to\n   *     simplify. Any settings specified will override the incoming context\n   *     for all matches of this rule.\n   *\n   * For more details on the theory, see:\n   *\n   * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)\n   * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)\n   *\n   *  An optional `options` argument can be passed as last argument of `simplify`.\n   *  Currently available options (defaults in parentheses):\n   *  - `consoleDebug` (false): whether to write the expression being simplified\n   *    and any changes to it, along with the rule responsible, to console\n   *  - `context` (simplify.defaultContext): an object giving properties of\n   *    each operator, which determine what simplifications are allowed. The\n   *    currently meaningful properties are commutative, associative,\n   *    total (whether the operation is defined for all arguments), and\n   *    trivial (whether the operation applied to a single argument leaves\n   *    that argument unchanged). The default context is very permissive and\n   *    allows almost all simplifications. Only properties differing from\n   *    the default need to be specified; the default context is used as a\n   *    fallback. Additional contexts `simplify.realContext` and\n   *    `simplify.positiveContext` are supplied to cause simplify to perform\n   *    just simplifications guaranteed to preserve all values of the expression\n   *    assuming all variables and subexpressions are real numbers or\n   *    positive real numbers, respectively. (Note that these are in some cases\n   *    more restrictive than the default context; for example, the default\n   *    context will allow `x/x` to simplify to 1, whereas\n   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)\n   *  - `exactFractions` (true): whether to try to convert all constants to\n   *    exact rational numbers.\n   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will\n   *    be expressed as fractions only when both numerator and denominator\n   *    are smaller than `fractionsLimit`.\n   *\n   * Syntax:\n   *\n   *     simplify(expr)\n   *     simplify(expr, rules)\n   *     simplify(expr, rules)\n   *     simplify(expr, rules, scope)\n   *     simplify(expr, rules, scope, options)\n   *     simplify(expr, scope)\n   *     simplify(expr, scope, options)\n   *\n   * Examples:\n   *\n   *     math.simplify('2 * 1 * x ^ (2 - 1)')      // Node \"2 * x\"\n   *     math.simplify('2 * 3 * x', {x: 4})        // Node \"24\"\n   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')\n   *     math.simplify(f)                          // Node \"2 * x\"\n   *     math.simplify('0.4 * x', {}, {exactFractions: true})  // Node \"x * 2 / 5\"\n   *     math.simplify('0.4 * x', {}, {exactFractions: false}) // Node \"0.4 * x\"\n   *\n   * See also:\n   *\n   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve\n   *\n   * @param {Node | string} expr\n   *            The expression to be simplified\n   * @param {Array<{l:string, r: string} | string | function>} [rules]\n   *            Optional list with custom rules\n   * @return {Node} Returns the simplified form of `expr`\n   */\n  const simplify = typed('simplify', {\n    string: function (expr) {\n      return this(parse(expr), this.rules, createEmptyMap(), {})\n    },\n\n    'string, Map | Object': function (expr, scope) {\n      return this(parse(expr), this.rules, scope, {})\n    },\n\n    'string, Map | Object, Object': function (expr, scope, options) {\n      return this(parse(expr), this.rules, scope, options)\n    },\n\n    'string, Array': function (expr, rules) {\n      return this(parse(expr), rules, createEmptyMap(), {})\n    },\n\n    'string, Array, Map | Object': function (expr, rules, scope) {\n      return this(parse(expr), rules, scope, {})\n    },\n\n    'string, Array, Map | Object, Object': function (expr, rules, scope, options) {\n      return this(parse(expr), rules, scope, options)\n    },\n\n    'Node, Map | Object': function (expr, scope) {\n      return this(expr, this.rules, scope, {})\n    },\n\n    'Node, Map | Object, Object': function (expr, scope, options) {\n      return this(expr, this.rules, scope, options)\n    },\n\n    Node: function (expr) {\n      return this(expr, this.rules, createEmptyMap(), {})\n    },\n\n    'Node, Array': function (expr, rules) {\n      return this(expr, rules, createEmptyMap(), {})\n    },\n\n    'Node, Array, Map | Object': function (expr, rules, scope) {\n      return this(expr, rules, scope, {})\n    },\n\n    'Node, Array, Object, Object': function (expr, rules, scope, options) {\n      return this(expr, rules, createMap(scope), options)\n    },\n\n    'Node, Array, Map, Object': function (expr, rules, scope, options) {\n      const debug = options.consoleDebug\n      rules = _buildRules(rules, options.context)\n      let res = resolve(expr, scope)\n      res = removeParens(res)\n      const visited = {}\n      let str = res.toString({ parenthesis: 'all' })\n      while (!visited[str]) {\n        visited[str] = true\n        _lastsym = 0 // counter for placeholder symbols\n        let laststr = str\n        if (debug) console.log('Working on: ', str)\n        for (let i = 0; i < rules.length; i++) {\n          let rulestr = ''\n          if (typeof rules[i] === 'function') {\n            res = rules[i](res, options)\n            if (debug) rulestr = rules[i].name\n          } else {\n            flatten(res, options.context)\n            res = applyRule(res, rules[i], options.context)\n            if (debug) {\n              rulestr = `${rules[i].l.toString()} -> ${rules[i].r.toString()}`\n            }\n          }\n          if (debug) {\n            const newstr = res.toString({ parenthesis: 'all' })\n            if (newstr !== laststr) {\n              console.log('Applying', rulestr, 'produced', newstr)\n              laststr = newstr\n            }\n          }\n          /* Use left-heavy binary tree internally,\n           * since custom rule functions may expect it\n           */\n          unflattenl(res, options.context)\n        }\n        str = res.toString({ parenthesis: 'all' })\n      }\n      return res\n    }\n  })\n  simplify.defaultContext = defaultContext\n  simplify.realContext = realContext\n  simplify.positiveContext = positiveContext\n\n  function removeParens (node) {\n    return node.transform(function (node, path, parent) {\n      return isParenthesisNode(node)\n        ? removeParens(node.content)\n        : node\n    })\n  }\n\n  // All constants that are allowed in rules\n  const SUPPORTED_CONSTANTS = {\n    true: true,\n    false: true,\n    e: true,\n    i: true,\n    Infinity: true,\n    LN2: true,\n    LN10: true,\n    LOG2E: true,\n    LOG10E: true,\n    NaN: true,\n    phi: true,\n    pi: true,\n    SQRT1_2: true,\n    SQRT2: true,\n    tau: true\n    // null: false,\n    // undefined: false,\n    // version: false,\n  }\n\n  // Array of strings, used to build the ruleSet.\n  // Each l (left side) and r (right side) are parsed by\n  // the expression parser into a node tree.\n  // Left hand sides are matched to subtrees within the\n  // expression to be parsed and replaced with the right\n  // hand side.\n  // TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])\n  // To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.\n  // It is possible to get into an infinite loop with conflicting rules\n  simplify.rules = [\n    simplifyCore,\n    // { l: 'n+0', r: 'n' },     // simplifyCore\n    // { l: 'n^0', r: '1' },     // simplifyCore\n    // { l: '0*n', r: '0' },     // simplifyCore\n    // { l: 'n/n', r: '1'},      // simplifyCore\n    // { l: 'n^1', r: 'n' },     // simplifyCore\n    // { l: '+n1', r:'n1' },     // simplifyCore\n    // { l: 'n--n1', r:'n+n1' }, // simplifyCore\n    { l: 'log(e)', r: '1' },\n\n    // temporary rules\n    // Note initially we tend constants to the right because like-term\n    // collection prefers the left, and we would rather collect nonconstants\n    {\n      s: 'n-n1 -> n+-n1', // temporarily replace 'subtract' so we can further flatten the 'add' operator\n      assuming: { subtract: { total: true } }\n    },\n    {\n      s: 'n-n -> 0', // partial alternative when we can't always subtract\n      assuming: { subtract: { total: false } }\n    },\n    {\n      s: '-(c*v) -> v * (-c)', // make non-constant terms positive\n      assuming: { multiply: { commutative: true }, subtract: { total: true } }\n    },\n    {\n      s: '-(c*v) -> (-c) * v', // non-commutative version, part 1\n      assuming: { multiply: { commutative: false }, subtract: { total: true } }\n    },\n    {\n      s: '-(v*c) -> v * (-c)', // non-commutative version, part 2\n      assuming: { multiply: { commutative: false }, subtract: { total: true } }\n    },\n    { l: '-(n1/n2)', r: '-n1/n2' },\n    { l: '-v', r: 'v * (-1)' }, // finish making non-constant terms positive\n    { l: '(n1 + n2)*(-1)', r: 'n1*(-1) + n2*(-1)', repeat: true }, // expand negations to achieve as much sign cancellation as possible\n    { l: 'n/n1^n2', r: 'n*n1^-n2' }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator\n    { l: 'n/n1', r: 'n*n1^-1' },\n    {\n      s: '(n1*n2)^n3 -> n1^n3 * n2^n3',\n      assuming: { multiply: { commutative: true } }\n    },\n    {\n      s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',\n      assuming: { multiply: { commutative: false } }\n    },\n\n    // expand nested exponentiation\n    {\n      s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',\n      assuming: { divide: { total: true } } // 1/(1/n) = n needs 1/n to exist\n    },\n\n    // collect like factors; into a sum, only do this for nonconstants\n    { l: ' v   * ( v   * n1 + n2)', r: 'v^2       * n1 +  v   * n2' },\n    {\n      s: ' v   * (v^n4 * n1 + n2)   ->  v^(1+n4)  * n1 +  v   * n2',\n      assuming: { divide: { total: true } } // v*1/v = v^(1+-1) needs 1/v\n    },\n    {\n      s: 'v^n3 * ( v   * n1 + n2)   ->  v^(n3+1)  * n1 + v^n3 * n2',\n      assuming: { divide: { total: true } }\n    },\n    {\n      s: 'v^n3 * (v^n4 * n1 + n2)   ->  v^(n3+n4) * n1 + v^n3 * n2',\n      assuming: { divide: { total: true } }\n    },\n    { l: 'n*n', r: 'n^2' },\n    {\n      s: 'n * n^n1 -> n^(n1+1)',\n      assuming: { divide: { total: true } } // n*1/n = n^(-1+1) needs 1/n\n    },\n    {\n      s: 'n^n1 * n^n2 -> n^(n1+n2)',\n      assuming: { divide: { total: true } } // ditto for n^2*1/n^2\n    },\n\n    // Unfortunately, to deal with more complicated cancellations, it\n    // becomes necessary to simplify constants twice per pass. It's not\n    // terribly expensive compared to matching rules, so this should not\n    // pose a performance problem.\n    simplifyConstant, // First: before collecting like terms\n\n    // collect like terms\n    {\n      s: 'n+n -> 2*n',\n      assuming: { add: { total: true } } // 2 = 1 + 1 needs to exist\n    },\n    { l: 'n+-n', r: '0' },\n    { l: 'v*n + v', r: 'v*(n+1)' }, // NOTE: leftmost position is special:\n    { l: 'n3*n1 + n3*n2', r: 'n3*(n1+n2)' }, // All sub-monomials tried there.\n    { l: 'n3^(-n4)*n1 +   n3  * n2', r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)' },\n    { l: 'n3^(-n4)*n1 + n3^n5 * n2', r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)' },\n    {\n      s: 'n*v + v -> (n+1)*v', // noncommutative additional cases\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',\n      assuming: { multiply: { commutative: false } }\n    },\n    { l: 'n*c + c', r: '(n+1)*c' },\n    {\n      s: 'c*n + c -> c*(n+1)',\n      assuming: { multiply: { commutative: false } }\n    },\n\n    simplifyConstant, // Second: before returning expressions to \"standard form\"\n\n    // make factors positive (and undo 'make non-constant terms positive')\n    {\n      s: '(-n)*n1 -> -(n*n1)',\n      assuming: { subtract: { total: true } }\n    },\n    {\n      s: 'n1*(-n) -> -(n1*n)', // in case * non-commutative\n      assuming: { subtract: { total: true }, multiply: { commutative: false } }\n    },\n\n    // final ordering of constants\n    {\n      s: 'c+v -> v+c',\n      assuming: { add: { commutative: true } },\n      imposeContext: { add: { commutative: false } }\n    },\n    {\n      s: 'v*c -> c*v',\n      assuming: { multiply: { commutative: true } },\n      imposeContext: { multiply: { commutative: false } }\n    },\n\n    // undo temporary rules\n    // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant\n    { l: 'n+-n1', r: 'n-n1' }, // undo replace 'subtract'\n    {\n      s: 'n*(n1^-1) -> n/n1', // undo replace 'divide'; for * commutative\n      assuming: { multiply: { commutative: true } } // o.w. / not conventional\n    },\n    {\n      s: 'n*n1^-n2 -> n/n1^n2',\n      assuming: { multiply: { commutative: true } } // o.w. / not conventional\n    },\n    {\n      s: 'n^-1 -> 1/n',\n      assuming: { multiply: { commutative: true } } // o.w. / not conventional\n    },\n    { l: 'n^1', r: 'n' }, // can be produced by power cancellation\n    {\n      s: 'n*(n1/n2) -> (n*n1)/n2', // '*' before '/'\n      assuming: { multiply: { associative: true } }\n    },\n    {\n      s: 'n-(n1+n2) -> n-n1-n2', // '-' before '+'\n      assuming: { addition: { associative: true, commutative: true } }\n    },\n    // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },\n    // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },\n\n    // simplifyConstant can leave an extra factor of 1, which can always\n    // be eliminated, since the identity always commutes\n    { l: '1*n', r: 'n', imposeContext: { multiply: { commutative: true } } },\n\n    {\n      s: 'n1/(n2/n3) -> (n1*n3)/n2',\n      assuming: { multiply: { associative: true } }\n    },\n\n    { l: 'n1/(-n2)', r: '-n1/n2' }\n\n  ]\n\n  /**\n   * Takes any rule object as allowed by the specification in simplify\n   * and puts it in a standard form used by applyRule\n   */\n  function _canonicalizeRule (ruleObject, context) {\n    const newRule = {}\n    if (ruleObject.s) {\n      const lr = ruleObject.s.split('->')\n      if (lr.length === 2) {\n        newRule.l = lr[0]\n        newRule.r = lr[1]\n      } else {\n        throw SyntaxError('Could not parse rule: ' + ruleObject.s)\n      }\n    } else {\n      newRule.l = ruleObject.l\n      newRule.r = ruleObject.r\n    }\n    newRule.l = removeParens(parse(newRule.l))\n    newRule.r = removeParens(parse(newRule.r))\n    for (const prop of ['imposeContext', 'repeat', 'assuming']) {\n      if (prop in ruleObject) {\n        newRule[prop] = ruleObject[prop]\n      }\n    }\n    if (ruleObject.evaluate) {\n      newRule.evaluate = parse(ruleObject.evaluate)\n    }\n\n    if (isAssociative(newRule.l, context)) {\n      const makeNode = createMakeNodeFunction(newRule.l)\n      const expandsym = _getExpandPlaceholderSymbol()\n      newRule.expanded = {}\n      newRule.expanded.l = makeNode([newRule.l.clone(), expandsym])\n      // Push the expandsym into the deepest possible branch.\n      // This helps to match the newRule against nodes returned from getSplits() later on.\n      flatten(newRule.expanded.l, context)\n      unflattenr(newRule.expanded.l, context)\n      newRule.expanded.r = makeNode([newRule.r, expandsym])\n    }\n\n    return newRule\n  }\n\n  /**\n   * Parse the string array of rules into nodes\n   *\n   * Example syntax for rules:\n   *\n   * Position constants to the left in a product:\n   * { l: 'n1 * c1', r: 'c1 * n1' }\n   * n1 is any Node, and c1 is a ConstantNode.\n   *\n   * Apply difference of squares formula:\n   * { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }\n   * n1, n2 mean any Node.\n   *\n   * Short hand notation:\n   * 'n1 * c1 -> c1 * n1'\n   */\n  function _buildRules (rules, context) {\n    // Array of rules to be used to simplify expressions\n    const ruleSet = []\n    for (let i = 0; i < rules.length; i++) {\n      let rule = rules[i]\n      let newRule\n      const ruleType = typeof rule\n      switch (ruleType) {\n        case 'string':\n          rule = { s: rule }\n        /* falls through */\n        case 'object':\n          newRule = _canonicalizeRule(rule, context)\n          break\n        case 'function':\n          newRule = rule\n          break\n        default:\n          throw TypeError('Unsupported type of rule: ' + ruleType)\n      }\n      // console.log('Adding rule: ' + rules[i])\n      // console.log(newRule)\n      ruleSet.push(newRule)\n    }\n    return ruleSet\n  }\n\n  let _lastsym = 0\n  function _getExpandPlaceholderSymbol () {\n    return new SymbolNode('_p' + _lastsym++)\n  }\n\n  function mapRule (nodes, rule, context) {\n    let resNodes = nodes\n    if (nodes) {\n      for (let i = 0; i < nodes.length; ++i) {\n        const newNode = applyRule(nodes[i], rule, context)\n        if (newNode !== nodes[i]) {\n          if (resNodes === nodes) {\n            resNodes = nodes.slice()\n          }\n          resNodes[i] = newNode\n        }\n      }\n    }\n    return resNodes\n  }\n\n  /**\n   * Returns a simplfied form of node, or the original node if no simplification was possible.\n   *\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {Object | Function} rule\n   * @param  {Object} context -- information about assumed properties of operators\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.\n   */\n  function applyRule (node, rule, context) {\n    //    console.log('Entering applyRule(\"', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '\",', node.toString({parenthesis:'all'}),')')\n\n    // check that the assumptions for this rule are satisfied by the current\n    // context:\n    if (rule.assuming) {\n      for (const symbol in rule.assuming) {\n        for (const property in rule.assuming[symbol]) {\n          if (hasProperty(symbol, property, context) !==\n              rule.assuming[symbol][property]) {\n            return node\n          }\n        }\n      }\n    }\n\n    const mergedContext = mergeContext(rule.imposeContext, context)\n\n    // Do not clone node unless we find a match\n    let res = node\n\n    // First replace our child nodes with their simplified versions\n    // If a child could not be simplified, applying the rule to it\n    // will have no effect since the node is returned unchanged\n    if (res instanceof OperatorNode || res instanceof FunctionNode) {\n      const newArgs = mapRule(res.args, rule, context)\n      if (newArgs !== res.args) {\n        res = res.clone()\n        res.args = newArgs\n      }\n    } else if (res instanceof ParenthesisNode) {\n      if (res.content) {\n        const newContent = applyRule(res.content, rule, context)\n        if (newContent !== res.content) {\n          res = new ParenthesisNode(newContent)\n        }\n      }\n    } else if (res instanceof ArrayNode) {\n      const newItems = mapRule(res.items, rule, context)\n      if (newItems !== res.items) {\n        res = new ArrayNode(newItems)\n      }\n    } else if (res instanceof AccessorNode) {\n      let newObj = res.object\n      if (res.object) {\n        newObj = applyRule(res.object, rule, context)\n      }\n      let newIndex = res.index\n      if (res.index) {\n        newIndex = applyRule(res.index, rule, context)\n      }\n      if (newObj !== res.object || newIndex !== res.index) {\n        res = new AccessorNode(newObj, newIndex)\n      }\n    } else if (res instanceof IndexNode) {\n      const newDims = mapRule(res.dimensions, rule, context)\n      if (newDims !== res.dimensions) {\n        res = new IndexNode(newDims)\n      }\n    } else if (res instanceof ObjectNode) {\n      let changed = false\n      const newProps = {}\n      for (const prop in res.properties) {\n        newProps[prop] = applyRule(res.properties[prop], rule, context)\n        if (newProps[prop] !== res.properties[prop]) {\n          changed = true\n        }\n      }\n      if (changed) {\n        res = new ObjectNode(newProps)\n      }\n    }\n\n    // Try to match a rule against this node\n    let repl = rule.r\n    let matches = _ruleMatch(rule.l, res, mergedContext)[0]\n\n    // If the rule is associative operator, we can try matching it while allowing additional terms.\n    // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.\n    if (!matches && rule.expanded) {\n      repl = rule.expanded.r\n      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0]\n    }\n\n    if (matches) {\n      // const before = res.toString({parenthesis: 'all'})\n\n      // Create a new node by cloning the rhs of the matched rule\n      // we keep any implicit multiplication state if relevant\n      const implicit = res.implicit\n      res = repl.clone()\n      if (implicit && 'implicit' in repl) {\n        res.implicit = true\n      }\n\n      // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes\n      res = res.transform(function (node) {\n        if (node.isSymbolNode && hasOwnProperty(matches.placeholders, node.name)) {\n          return matches.placeholders[node.name].clone()\n        } else {\n          return node\n        }\n      })\n\n      // const after = res.toString({parenthesis: 'all'})\n      // console.log('Simplified ' + before + ' to ' + after)\n    }\n\n    if (rule.repeat && res !== node) {\n      res = applyRule(res, rule, context)\n    }\n\n    return res\n  }\n\n  /**\n   * Get (binary) combinations of a flattened binary node\n   * e.g. +(node1, node2, node3) -> [\n   *        +(node1,  +(node2, node3)),\n   *        +(node2,  +(node1, node3)),\n   *        +(node3,  +(node1, node2))]\n   *\n   */\n  function getSplits (node, context) {\n    const res = []\n    let right, rightArgs\n    const makeNode = createMakeNodeFunction(node)\n    if (isCommutative(node, context)) {\n      for (let i = 0; i < node.args.length; i++) {\n        rightArgs = node.args.slice(0)\n        rightArgs.splice(i, 1)\n        right = (rightArgs.length === 1) ? rightArgs[0] : makeNode(rightArgs)\n        res.push(makeNode([node.args[i], right]))\n      }\n    } else {\n      // Keep order, but try all parenthesizations\n      for (let i = 1; i < node.args.length; i++) {\n        let left = node.args[0]\n        if (i > 1) {\n          left = makeNode(node.args.slice(0, i))\n        }\n        rightArgs = node.args.slice(i)\n        right = (rightArgs.length === 1) ? rightArgs[0] : makeNode(rightArgs)\n        res.push(makeNode([left, right]))\n      }\n    }\n    return res\n  }\n\n  /**\n   * Returns the set union of two match-placeholders or null if there is a conflict.\n   */\n  function mergeMatch (match1, match2) {\n    const res = { placeholders: {} }\n\n    // Some matches may not have placeholders; this is OK\n    if (!match1.placeholders && !match2.placeholders) {\n      return res\n    } else if (!match1.placeholders) {\n      return match2\n    } else if (!match2.placeholders) {\n      return match1\n    }\n\n    // Placeholders with the same key must match exactly\n    for (const key in match1.placeholders) {\n      if (hasOwnProperty(match1.placeholders, key)) {\n        res.placeholders[key] = match1.placeholders[key]\n\n        if (hasOwnProperty(match2.placeholders, key)) {\n          if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {\n            return null\n          }\n        }\n      }\n    }\n\n    for (const key in match2.placeholders) {\n      if (hasOwnProperty(match2.placeholders, key)) {\n        res.placeholders[key] = match2.placeholders[key]\n      }\n    }\n\n    return res\n  }\n\n  /**\n   * Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.\n   * Each list represents matches found in one child of a node.\n   */\n  function combineChildMatches (list1, list2) {\n    const res = []\n\n    if (list1.length === 0 || list2.length === 0) {\n      return res\n    }\n\n    let merged\n    for (let i1 = 0; i1 < list1.length; i1++) {\n      for (let i2 = 0; i2 < list2.length; i2++) {\n        merged = mergeMatch(list1[i1], list2[i2])\n        if (merged) {\n          res.push(merged)\n        }\n      }\n    }\n    return res\n  }\n\n  /**\n   * Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.\n   * Each list represents matches found in one child of a node.\n   * Returns a list of unique matches.\n   */\n  function mergeChildMatches (childMatches) {\n    if (childMatches.length === 0) {\n      return childMatches\n    }\n\n    const sets = childMatches.reduce(combineChildMatches)\n    const uniqueSets = []\n    const unique = {}\n    for (let i = 0; i < sets.length; i++) {\n      const s = JSON.stringify(sets[i])\n      if (!unique[s]) {\n        unique[s] = true\n        uniqueSets.push(sets[i])\n      }\n    }\n    return uniqueSets\n  }\n\n  /**\n   * Determines whether node matches rule.\n   *\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param {Object} context -- provides assumed properties of operators\n   * @param {Boolean} isSplit -- whether we are in process of splitting an\n   *                    n-ary operator node into possible binary combinations.\n   *                    Defaults to false.\n   * @return {Object} Information about the match, if it exists.\n   */\n  function _ruleMatch (rule, node, context, isSplit) {\n    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')\n    //    console.log('rule = ' + rule)\n    //    console.log('node = ' + node)\n\n    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')\n    let res = [{ placeholders: {} }]\n\n    if ((rule instanceof OperatorNode && node instanceof OperatorNode) ||\n      (rule instanceof FunctionNode && node instanceof FunctionNode)) {\n      // If the rule is an OperatorNode or a FunctionNode, then node must match exactly\n      if (rule instanceof OperatorNode) {\n        if (rule.op !== node.op || rule.fn !== node.fn) {\n          return []\n        }\n      } else if (rule instanceof FunctionNode) {\n        if (rule.name !== node.name) {\n          return []\n        }\n      }\n\n      // rule and node match. Search the children of rule and node.\n      if ((node.args.length === 1 && rule.args.length === 1) ||\n          (!isAssociative(node, context) &&\n           node.args.length === rule.args.length) ||\n          isSplit) {\n        // Expect non-associative operators to match exactly,\n        // except in any order if operator is commutative\n        let childMatches = []\n        for (let i = 0; i < rule.args.length; i++) {\n          const childMatch = _ruleMatch(rule.args[i], node.args[i], context)\n          if (childMatch.length === 0) {\n            // Child did not match, so stop searching immediately\n            break\n          }\n          // The child matched, so add the information returned from the child to our result\n          childMatches.push(childMatch)\n        }\n        if (childMatches.length !== rule.args.length) {\n          if (!isCommutative(node, context) || // exact match in order needed\n              rule.args.length === 1) { // nothing to commute\n            return []\n          }\n          if (rule.args.length > 2) {\n            /* Need to generate all permutations and try them.\n             * It's a bit complicated, and unlikely to come up since there\n             * are very few ternary or higher operators. So punt for now.\n             */\n            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented')\n          }\n          /* Exactly two arguments, try them reversed */\n          const leftMatch = _ruleMatch(rule.args[0], node.args[1], context)\n          if (leftMatch.length === 0) {\n            return []\n          }\n          const rightMatch = _ruleMatch(rule.args[1], node.args[0], context)\n          if (rightMatch.length === 0) {\n            return []\n          }\n          childMatches = [leftMatch, rightMatch]\n        }\n        res = mergeChildMatches(childMatches)\n      } else if (node.args.length >= 2 && rule.args.length === 2) { // node is flattened, rule is not\n        // Associative operators/functions can be split in different ways so we check if the rule matches each\n        // them and return their union.\n        const splits = getSplits(node, context)\n        let splitMatches = []\n        for (let i = 0; i < splits.length; i++) {\n          const matchSet = _ruleMatch(rule, splits[i], context, true) // recursing at the same tree depth here\n          splitMatches = splitMatches.concat(matchSet)\n        }\n        return splitMatches\n      } else if (rule.args.length > 2) {\n        throw Error('Unexpected non-binary associative function: ' + rule.toString())\n      } else {\n        // Incorrect number of arguments in rule and node, so no match\n        return []\n      }\n    } else if (rule instanceof SymbolNode) {\n      // If the rule is a SymbolNode, then it carries a special meaning\n      // according to the first character of the symbol node name.\n      // c.* matches a ConstantNode\n      // n.* matches any node\n      if (rule.name.length === 0) {\n        throw new Error('Symbol in rule has 0 length...!?')\n      }\n      if (SUPPORTED_CONSTANTS[rule.name]) {\n        // built-in constant must match exactly\n        if (rule.name !== node.name) {\n          return []\n        }\n      } else if (rule.name[0] === 'n' || rule.name.substring(0, 2) === '_p') {\n        // rule matches _anything_, so assign this node to the rule.name placeholder\n        // Assign node to the rule.name placeholder.\n        // Our parent will check for matches among placeholders.\n        res[0].placeholders[rule.name] = node\n      } else if (rule.name[0] === 'v') {\n        // rule matches any variable thing (not a ConstantNode)\n        if (!isConstantNode(node)) {\n          res[0].placeholders[rule.name] = node\n        } else {\n          // Mis-match: rule was expecting something other than a ConstantNode\n          return []\n        }\n      } else if (rule.name[0] === 'c') {\n        // rule matches any ConstantNode\n        if (node instanceof ConstantNode) {\n          res[0].placeholders[rule.name] = node\n        } else {\n          // Mis-match: rule was expecting a ConstantNode\n          return []\n        }\n      } else {\n        throw new Error('Invalid symbol in rule: ' + rule.name)\n      }\n    } else if (rule instanceof ConstantNode) {\n      // Literal constant must match exactly\n      if (!equal(rule.value, node.value)) {\n        return []\n      }\n    } else {\n      // Some other node was encountered which we aren't prepared for, so no match\n      return []\n    }\n\n    // It's a match!\n\n    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')\n    return res\n  }\n\n  /**\n   * Determines whether p and q (and all their children nodes) are identical.\n   *\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q\n   * @return {Object} Information about the match, if it exists.\n   */\n  function _exactMatch (p, q) {\n    if (p instanceof ConstantNode && q instanceof ConstantNode) {\n      if (!equal(p.value, q.value)) {\n        return false\n      }\n    } else if (p instanceof SymbolNode && q instanceof SymbolNode) {\n      if (p.name !== q.name) {\n        return false\n      }\n    } else if ((p instanceof OperatorNode && q instanceof OperatorNode) ||\n        (p instanceof FunctionNode && q instanceof FunctionNode)) {\n      if (p instanceof OperatorNode) {\n        if (p.op !== q.op || p.fn !== q.fn) {\n          return false\n        }\n      } else if (p instanceof FunctionNode) {\n        if (p.name !== q.name) {\n          return false\n        }\n      }\n\n      if (p.args.length !== q.args.length) {\n        return false\n      }\n\n      for (let i = 0; i < p.args.length; i++) {\n        if (!_exactMatch(p.args[i], q.args[i])) {\n          return false\n        }\n      }\n    } else {\n      return false\n    }\n\n    return true\n  }\n\n  return simplify\n})\n","import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js'\nimport { createUtil } from './simplify/util.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'simplifyCore'\nconst dependencies = [\n  'equal',\n  'isZero',\n  'add',\n  'subtract',\n  'multiply',\n  'divide',\n  'pow',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'SymbolNode'\n]\n\nexport const createSimplifyCore = /* #__PURE__ */ factory(name, dependencies, ({\n  equal,\n  isZero,\n  add,\n  subtract,\n  multiply,\n  divide,\n  pow,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode\n}) => {\n  const node0 = new ConstantNode(0)\n  const node1 = new ConstantNode(1)\n\n  const { hasProperty, isCommutative } =\n    createUtil({ FunctionNode, OperatorNode, SymbolNode })\n  /**\n   * simplifyCore() performs single pass simplification suitable for\n   * applications requiring ultimate performance. In contrast, simplify()\n   * extends simplifyCore() with additional passes to provide deeper\n   * simplification.\n   *\n   * Syntax:\n   *\n   *     simplifyCore(expr)\n   *\n   * Examples:\n   *\n   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')\n   *     math.simpifyCore(f)                          // Node {2 * x}\n   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplifyCore]) // Node {2 * x}\n   *\n   * See also:\n   *\n   *     simplify, resolve, derivative\n   *\n   * @param {Node} node\n   *     The expression to be simplified\n   * @param {Object} options\n   *     Simplification options, as per simplify()\n   * @return {Node} Returns expression with basic simplifications applied\n   */\n  function simplifyCore (node, options) {\n    const context = options ? options.context : undefined\n    if (hasProperty(node, 'trivial', context)) {\n      // This node does nothing if it has only one argument, so if so,\n      // return that argument simplified\n      if (isFunctionNode(node) && node.args.length === 1) {\n        return simplifyCore(node.args[0], options)\n      }\n      // For other node types, we try the generic methods\n      let simpChild = false\n      let childCount = 0\n      node.forEach(c => {\n        ++childCount\n        if (childCount === 1) {\n          simpChild = simplifyCore(c, options)\n        }\n      })\n      if (childCount === 1) {\n        return simpChild\n      }\n    }\n    if (isOperatorNode(node) && node.isUnary()) {\n      const a0 = simplifyCore(node.args[0], options)\n\n      if (node.op === '-') { // unary minus\n        if (isOperatorNode(a0)) {\n          if (a0.isUnary() && a0.op === '-') {\n            return a0.args[0]\n          } else if (a0.isBinary() && a0.fn === 'subtract') {\n            return new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]])\n          }\n        }\n        return new OperatorNode(node.op, node.fn, [a0])\n      }\n    } else if (isOperatorNode(node) && node.isBinary()) {\n      const a0 = simplifyCore(node.args[0], options)\n      const a1 = simplifyCore(node.args[1], options)\n\n      if (node.op === '+') {\n        if (isConstantNode(a0)) {\n          if (isZero(a0.value)) {\n            return a1\n          } else if (isConstantNode(a1)) {\n            return new ConstantNode(add(a0.value, a1.value))\n          }\n        }\n        if (isConstantNode(a1) && isZero(a1.value)) {\n          return a0\n        }\n        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n          return new OperatorNode('-', 'subtract', [a0, a1.args[0]])\n        }\n        return new OperatorNode(node.op, node.fn, a1 ? [a0, a1] : [a0])\n      } else if (node.op === '-') {\n        if (isConstantNode(a0) && a1) {\n          if (isConstantNode(a1)) {\n            return new ConstantNode(subtract(a0.value, a1.value))\n          } else if (isZero(a0.value)) {\n            return new OperatorNode('-', 'unaryMinus', [a1])\n          }\n        }\n        // if (node.fn === \"subtract\" && node.args.length === 2) {\n        if (node.fn === 'subtract') {\n          if (isConstantNode(a1) && isZero(a1.value)) {\n            return a0\n          }\n          if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n            return simplifyCore(\n              new OperatorNode('+', 'add', [a0, a1.args[0]]), options)\n          }\n          return new OperatorNode(node.op, node.fn, [a0, a1])\n        }\n      } else if (node.op === '*') {\n        if (isConstantNode(a0)) {\n          if (isZero(a0.value)) {\n            return node0\n          } else if (equal(a0.value, 1)) {\n            return a1\n          } else if (isConstantNode(a1)) {\n            return new ConstantNode(multiply(a0.value, a1.value))\n          }\n        }\n        if (isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node0\n          } else if (equal(a1.value, 1)) {\n            return a0\n          } else if (isOperatorNode(a0) && a0.isBinary() &&\n                     a0.op === node.op && isCommutative(node, context)) {\n            const a00 = a0.args[0]\n            if (isConstantNode(a00)) {\n              const a00a1 = new ConstantNode(multiply(a00.value, a1.value))\n              return new OperatorNode(node.op, node.fn, [a00a1, a0.args[1]], node.implicit) // constants on left\n            }\n          }\n          if (isCommutative(node, context)) {\n            return new OperatorNode(node.op, node.fn, [a1, a0], node.implicit) // constants on left\n          } else {\n            return new OperatorNode(node.op, node.fn, [a0, a1], node.implicit)\n          }\n        }\n        return new OperatorNode(node.op, node.fn, [a0, a1], node.implicit)\n      } else if (node.op === '/') {\n        if (isConstantNode(a0)) {\n          if (isZero(a0.value)) {\n            return node0\n          } else if (isConstantNode(a1) &&\n                      (equal(a1.value, 1) || equal(a1.value, 2) || equal(a1.value, 4))) {\n            return new ConstantNode(divide(a0.value, a1.value))\n          }\n        }\n        return new OperatorNode(node.op, node.fn, [a0, a1])\n      } else if (node.op === '^') {\n        if (isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node1\n          } else if (equal(a1.value, 1)) {\n            return a0\n          } else {\n            if (isConstantNode(a0)) {\n              // fold constant\n              return new ConstantNode(pow(a0.value, a1.value))\n            } else if (isOperatorNode(a0) && a0.isBinary() && a0.op === '^') {\n              const a01 = a0.args[1]\n              if (isConstantNode(a01)) {\n                return new OperatorNode(node.op, node.fn, [\n                  a0.args[0],\n                  new ConstantNode(multiply(a01.value, a1.value))\n                ])\n              }\n            }\n          }\n        }\n      }\n      return new OperatorNode(node.op, node.fn, [a0, a1])\n    } else if (isFunctionNode(node)) {\n      return new FunctionNode(\n        simplifyCore(node.fn), node.args.map(n => simplifyCore(n, options)))\n    } else if (isArrayNode(node)) {\n      return new ArrayNode(\n        node.items.map(n => simplifyCore(n, options)))\n    } else if (isAccessorNode(node)) {\n      return new AccessorNode(\n        simplifyCore(node.object, options), simplifyCore(node.index, options))\n    } else if (isIndexNode(node)) {\n      return new IndexNode(\n        node.dimensions.map(n => simplifyCore(n, options)))\n    } else if (isObjectNode(node)) {\n      const newProps = {}\n      for (const prop in node.properties) {\n        newProps[prop] = simplifyCore(node.properties[prop], options)\n      }\n      return new ObjectNode(newProps)\n    } else {\n      // cannot simplify\n    }\n    return node\n  }\n\n  return simplifyCore\n})\n","import { createMap, isMap } from '../../utils/map.js'\nimport { isFunctionNode, isNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'resolve'\nconst dependencies = [\n  'parse',\n  'ConstantNode',\n  'FunctionNode',\n  'OperatorNode',\n  'ParenthesisNode'\n]\n\nexport const createResolve = /* #__PURE__ */ factory(name, dependencies, ({\n  parse,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode\n}) => {\n  /**\n   * resolve(expr, scope) replaces variable nodes with their scoped values\n   *\n   * Syntax:\n   *\n   *     resolve(expr, scope)\n   *\n   * Examples:\n   *\n   *     math.resolve('x + y', {x:1, y:2})           // Node {1 + 2}\n   *     math.resolve(math.parse('x+y'), {x:1, y:2}) // Node {1 + 2}\n   *     math.simplify('x+y', {x:2, y:'x+x'}).toString()      // \"6\"\n   *\n   * See also:\n   *\n   *     simplify, evaluate\n   *\n   * @param {Node} node\n   *     The expression tree to be simplified\n   * @param {Object} scope\n   *     Scope specifying variables to be resolved\n   * @return {Node} Returns `node` with variables recursively substituted.\n   * @throws {ReferenceError}\n   *     If there is a cyclic dependency among the variables in `scope`,\n   *     resolution is impossible and a ReferenceError is thrown.\n   */\n  function resolve (node, scope, within = new Set()) { // note `within`:\n    // `within` is not documented, since it is for internal cycle\n    // detection only\n    if (!scope) {\n      return node\n    }\n    if (!isMap(scope)) {\n      scope = createMap(scope)\n    }\n    if (isSymbolNode(node)) {\n      if (within.has(node.name)) {\n        const variables = Array.from(within).join(', ')\n        throw new ReferenceError(\n          `recursive loop of variable definitions among {${variables}}`\n        )\n      }\n      const value = scope.get(node.name)\n      if (isNode(value)) {\n        const nextWithin = new Set(within)\n        nextWithin.add(node.name)\n        return resolve(value, scope, nextWithin)\n      } else if (typeof value === 'number') {\n        return parse(String(value))\n      } else if (value !== undefined) {\n        return new ConstantNode(value)\n      } else {\n        return node\n      }\n    } else if (isOperatorNode(node)) {\n      const args = node.args.map(function (arg) {\n        return resolve(arg, scope, within)\n      })\n      return new OperatorNode(node.op, node.fn, args, node.implicit)\n    } else if (isParenthesisNode(node)) {\n      return new ParenthesisNode(resolve(node.content, scope, within))\n    } else if (isFunctionNode(node)) {\n      const args = node.args.map(function (arg) {\n        return resolve(arg, scope, within)\n      })\n      return new FunctionNode(node.name, args)\n    }\n    // Otherwise just recursively resolve any children (might also work\n    // for some of the above special cases)\n    return node.map(child => resolve(child, scope, within))\n  }\n\n  return resolve\n})\n","import { isConstantNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'symbolicEqual'\nconst dependencies = [\n  'parse',\n  'simplify',\n  'typed',\n  'OperatorNode'\n]\n\nexport const createSymbolicEqual = /* #__PURE__ */ factory(name, dependencies, ({\n  parse,\n  simplify,\n  typed,\n  OperatorNode\n}) => {\n  /**\n   * Attempts to determine if two expressions are symbolically equal, i.e.\n   * one is the result of valid algebraic manipulations on the other.\n   * Currently, this simply checks if the difference of the two expressions\n   * simplifies down to 0. So there are two important caveats:\n   * 1. whether two expressions are symbolically equal depends on the\n   *     manipulations allowed. Therefore, this function takes an optional\n   *     third argument, which are the options that control the behavior\n   *     as documented for the `simplify()` function.\n   * 2. it is in general intractable to find the minimal simplification of\n   *     an arbitrarily complicated expression. So while a `true` value\n   *     of `symbolicEqual` ensures that the two expressions can be manipulated\n   *     to match each other, a `false` value does not absolutely rule this out.\n   *\n   * Syntax:\n   *\n   *    symbolicEqual(expr1, expr2)\n   *    symbolicEqual(expr1, expr2, options)\n   *\n   * Examples:\n   *\n   *    symbolicEqual('x*y', 'y*x') // true\n   *    symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}})\n   *        //false\n   *    symbolicEqual('x/y', '(y*x^(-1))^(-1)') // true\n   *    symbolicEqual('abs(x)','x') // false\n   *    symbolicEqual('abs(x)','x', simplify.positiveContext) // true\n   *\n   * See also:\n   *\n   *    simplify, evaluate\n   *\n   * @param {Node|string} expr1  The first expression to compare\n   * @param {Node|string} expr2  The second expression to compare\n   * @param {Object} [options] Optional option object, passed to simplify\n   * @returns {boolean}\n   *     Returns true if a valid manipulation making the expressions equal\n   *     is found.\n   */\n  return typed(name, {\n    'string, string': function (s1, s2) {\n      return this(parse(s1), parse(s2), {})\n    },\n    'string, string, Object': function (s1, s2, options) {\n      return this(parse(s1), parse(s2), options)\n    },\n    'Node, string': function (e1, s2) {\n      return this(e1, parse(s2), {})\n    },\n    'Node, string, Object': function (e1, s2, options) {\n      return this(e1, parse(s2), options)\n    },\n    'string, Node': function (s1, e2) {\n      return this(parse(s1), e2, {})\n    },\n    'string, Node, Object': function (s1, e2, options) {\n      return this(parse(s1), e2, options)\n    },\n    'Node, Node': function (e1, e2) {\n      return this(e1, e2, {})\n    },\n    'Node, Node, Object': function (e1, e2, options) {\n      const diff = new OperatorNode('-', 'subtract', [e1, e2])\n      const simplified = simplify(diff, {}, options)\n      return (isConstantNode(simplified) && !(simplified.value))\n    }\n  })\n})\n","import { isConstantNode, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'derivative'\nconst dependencies = [\n  'typed',\n  'config',\n  'parse',\n  'simplify',\n  'equal',\n  'isZero',\n  'numeric',\n  'ConstantNode',\n  'FunctionNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'SymbolNode'\n]\n\nexport const createDerivative = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  config,\n  parse,\n  simplify,\n  equal,\n  isZero,\n  numeric,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode\n}) => {\n  /**\n   * Takes the derivative of an expression expressed in parser Nodes.\n   * The derivative will be taken over the supplied variable in the\n   * second parameter. If there are multiple variables in the expression,\n   * it will return a partial derivative.\n   *\n   * This uses rules of differentiation which can be found here:\n   *\n   * - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)\n   *\n   * Syntax:\n   *\n   *     derivative(expr, variable)\n   *     derivative(expr, variable, options)\n   *\n   * Examples:\n   *\n   *     math.derivative('x^2', 'x')                     // Node {2 * x}\n   *     math.derivative('x^2', 'x', {simplify: false})  // Node {2 * 1 * x ^ (2 - 1)\n   *     math.derivative('sin(2x)', 'x'))                // Node {2 * cos(2 * x)}\n   *     math.derivative('2*x', 'x').evaluate()          // number 2\n   *     math.derivative('x^2', 'x').evaluate({x: 4})    // number 8\n   *     const f = math.parse('x^2')\n   *     const x = math.parse('x')\n   *     math.derivative(f, x)                           // Node {2 * x}\n   *\n   * See also:\n   *\n   *     simplify, parse, evaluate\n   *\n   * @param  {Node | string} expr           The expression to differentiate\n   * @param  {SymbolNode | string} variable The variable over which to differentiate\n   * @param  {{simplify: boolean}} [options]\n   *                         There is one option available, `simplify`, which\n   *                         is true by default. When false, output will not\n   *                         be simplified.\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`\n   */\n  const derivative = typed('derivative', {\n    'Node, SymbolNode, Object': function (expr, variable, options) {\n      const constNodes = {}\n      constTag(constNodes, expr, variable.name)\n      const res = _derivative(expr, constNodes)\n      return options.simplify ? simplify(res) : res\n    },\n    'Node, SymbolNode': function (expr, variable) {\n      return this(expr, variable, { simplify: true })\n    },\n\n    'string, SymbolNode': function (expr, variable) {\n      return this(parse(expr), variable)\n    },\n    'string, SymbolNode, Object': function (expr, variable, options) {\n      return this(parse(expr), variable, options)\n    },\n\n    'string, string': function (expr, variable) {\n      return this(parse(expr), parse(variable))\n    },\n    'string, string, Object': function (expr, variable, options) {\n      return this(parse(expr), parse(variable), options)\n    },\n\n    'Node, string': function (expr, variable) {\n      return this(expr, parse(variable))\n    },\n    'Node, string, Object': function (expr, variable, options) {\n      return this(expr, parse(variable), options)\n    }\n\n    // TODO: replace the 8 signatures above with 4 as soon as typed-function supports optional arguments\n\n    /* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}\n    'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {\n      let res = expr\n      for (let i = 0; i < order; i++) {\n        let constNodes = {}\n        constTag(constNodes, expr, variable.name)\n        res = _derivative(res, constNodes)\n      }\n      return res\n    }\n    */\n  })\n\n  derivative._simplify = true\n\n  derivative.toTex = function (deriv) {\n    return _derivTex.apply(null, deriv.args)\n  }\n\n  // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.\n  // NOTE: the optional \"order\" parameter here is currently unused\n  const _derivTex = typed('_derivTex', {\n    'Node, SymbolNode': function (expr, x) {\n      if (isConstantNode(expr) && typeOf(expr.value) === 'string') {\n        return _derivTex(parse(expr.value).toString(), x.toString(), 1)\n      } else {\n        return _derivTex(expr.toString(), x.toString(), 1)\n      }\n    },\n    'Node, ConstantNode': function (expr, x) {\n      if (typeOf(x.value) === 'string') {\n        return _derivTex(expr, parse(x.value))\n      } else {\n        throw new Error(\"The second parameter to 'derivative' is a non-string constant\")\n      }\n    },\n    'Node, SymbolNode, ConstantNode': function (expr, x, order) {\n      return _derivTex(expr.toString(), x.name, order.value)\n    },\n    'string, string, number': function (expr, x, order) {\n      let d\n      if (order === 1) {\n        d = '{d\\\\over d' + x + '}'\n      } else {\n        d = '{d^{' + order + '}\\\\over d' + x + '^{' + order + '}}'\n      }\n      return d + `\\\\left[${expr}\\\\right]`\n    }\n  })\n\n  /**\n   * Does a depth-first search on the expression tree to identify what Nodes\n   * are constants (e.g. 2 + 2), and stores the ones that are constants in\n   * constNodes. Classification is done as follows:\n   *\n   *   1. ConstantNodes are constants.\n   *   2. If there exists a SymbolNode, of which we are differentiating over,\n   *      in the subtree it is not constant.\n   *\n   * @param  {Object} constNodes  Holds the nodes that are constant\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {string} varName     Variable that we are differentiating\n   * @return {boolean}  if node is constant\n   */\n  // TODO: can we rewrite constTag into a pure function?\n  const constTag = typed('constTag', {\n    'Object, ConstantNode, string': function (constNodes, node) {\n      constNodes[node] = true\n      return true\n    },\n\n    'Object, SymbolNode, string': function (constNodes, node, varName) {\n      // Treat other variables like constants. For reasoning, see:\n      //   https://en.wikipedia.org/wiki/Partial_derivative\n      if (node.name !== varName) {\n        constNodes[node] = true\n        return true\n      }\n      return false\n    },\n\n    'Object, ParenthesisNode, string': function (constNodes, node, varName) {\n      return constTag(constNodes, node.content, varName)\n    },\n\n    'Object, FunctionAssignmentNode, string': function (constNodes, node, varName) {\n      if (node.params.indexOf(varName) === -1) {\n        constNodes[node] = true\n        return true\n      }\n      return constTag(constNodes, node.expr, varName)\n    },\n\n    'Object, FunctionNode | OperatorNode, string': function (constNodes, node, varName) {\n      if (node.args.length > 0) {\n        let isConst = constTag(constNodes, node.args[0], varName)\n        for (let i = 1; i < node.args.length; ++i) {\n          isConst = constTag(constNodes, node.args[i], varName) && isConst\n        }\n\n        if (isConst) {\n          constNodes[node] = true\n          return true\n        }\n      }\n      return false\n    }\n  })\n\n  /**\n   * Applies differentiation rules.\n   *\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {Object} constNodes  Holds the nodes that are constant\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`\n   */\n  const _derivative = typed('_derivative', {\n    'ConstantNode, Object': function (node) {\n      return createConstantNode(0)\n    },\n\n    'SymbolNode, Object': function (node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0)\n      }\n      return createConstantNode(1)\n    },\n\n    'ParenthesisNode, Object': function (node, constNodes) {\n      return new ParenthesisNode(_derivative(node.content, constNodes))\n    },\n\n    'FunctionAssignmentNode, Object': function (node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0)\n      }\n      return _derivative(node.expr, constNodes)\n    },\n\n    'FunctionNode, Object': function (node, constNodes) {\n      if (node.args.length !== 1) {\n        funcArgsCheck(node)\n      }\n\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0)\n      }\n\n      const arg0 = node.args[0]\n      let arg1\n\n      let div = false // is output a fraction?\n      let negative = false // is output negative?\n\n      let funcDerivative\n      switch (node.name) {\n        case 'cbrt':\n          // d/dx(cbrt(x)) = 1 / (3x^(2/3))\n          div = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            createConstantNode(3),\n            new OperatorNode('^', 'pow', [\n              arg0,\n              new OperatorNode('/', 'divide', [\n                createConstantNode(2),\n                createConstantNode(3)\n              ])\n            ])\n          ])\n          break\n        case 'sqrt':\n        case 'nthRoot':\n          // d/dx(sqrt(x)) = 1 / (2*sqrt(x))\n          if (node.args.length === 1) {\n            div = true\n            funcDerivative = new OperatorNode('*', 'multiply', [\n              createConstantNode(2),\n              new FunctionNode('sqrt', [arg0])\n            ])\n          } else if (node.args.length === 2) {\n            // Rearrange from nthRoot(x, a) -> x^(1/a)\n            arg1 = new OperatorNode('/', 'divide', [\n              createConstantNode(1),\n              node.args[1]\n            ])\n\n            // Is a variable?\n            constNodes[arg1] = constNodes[node.args[1]]\n\n            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes)\n          }\n          break\n        case 'log10':\n          arg1 = createConstantNode(10)\n          /* fall through! */\n        case 'log':\n          if (!arg1 && node.args.length === 1) {\n            // d/dx(log(x)) = 1 / x\n            funcDerivative = arg0.clone()\n            div = true\n          } else if ((node.args.length === 1 && arg1) ||\n              (node.args.length === 2 && constNodes[node.args[1]] !== undefined)) {\n            // d/dx(log(x, c)) = 1 / (x*ln(c))\n            funcDerivative = new OperatorNode('*', 'multiply', [\n              arg0.clone(),\n              new FunctionNode('log', [arg1 || node.args[1]])\n            ])\n            div = true\n          } else if (node.args.length === 2) {\n            // d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))\n            return _derivative(new OperatorNode('/', 'divide', [\n              new FunctionNode('log', [arg0]),\n              new FunctionNode('log', [node.args[1]])\n            ]), constNodes)\n          }\n          break\n        case 'pow':\n          constNodes[arg1] = constNodes[node.args[1]]\n          // Pass to pow operator node parser\n          return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes)\n        case 'exp':\n          // d/dx(e^x) = e^x\n          funcDerivative = new FunctionNode('exp', [arg0.clone()])\n          break\n        case 'sin':\n          // d/dx(sin(x)) = cos(x)\n          funcDerivative = new FunctionNode('cos', [arg0.clone()])\n          break\n        case 'cos':\n          // d/dx(cos(x)) = -sin(x)\n          funcDerivative = new OperatorNode('-', 'unaryMinus', [\n            new FunctionNode('sin', [arg0.clone()])\n          ])\n          break\n        case 'tan':\n          // d/dx(tan(x)) = sec(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('sec', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'sec':\n          // d/dx(sec(x)) = sec(x)tan(x)\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('tan', [arg0.clone()])\n          ])\n          break\n        case 'csc':\n          // d/dx(csc(x)) = -csc(x)cot(x)\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('cot', [arg0.clone()])\n          ])\n          break\n        case 'cot':\n          // d/dx(cot(x)) = -csc(x)^2\n          negative = true\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('csc', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'asin':\n          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)\n          div = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('-', 'subtract', [\n              createConstantNode(1),\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ])\n            ])\n          ])\n          break\n        case 'acos':\n          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)\n          div = true\n          negative = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('-', 'subtract', [\n              createConstantNode(1),\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ])\n            ])\n          ])\n          break\n        case 'atan':\n          // d/dx(atan(x)) = 1 / (x^2 + 1)\n          div = true\n          funcDerivative = new OperatorNode('+', 'add', [\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ]),\n            createConstantNode(1)\n          ])\n          break\n        case 'asec':\n          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))\n          div = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            new FunctionNode('abs', [arg0.clone()]),\n            new FunctionNode('sqrt', [\n              new OperatorNode('-', 'subtract', [\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ]),\n                createConstantNode(1)\n              ])\n            ])\n          ])\n          break\n        case 'acsc':\n          // d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            new FunctionNode('abs', [arg0.clone()]),\n            new FunctionNode('sqrt', [\n              new OperatorNode('-', 'subtract', [\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ]),\n                createConstantNode(1)\n              ])\n            ])\n          ])\n          break\n        case 'acot':\n          // d/dx(acot(x)) = -1 / (x^2 + 1)\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('+', 'add', [\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ]),\n            createConstantNode(1)\n          ])\n          break\n        case 'sinh':\n          // d/dx(sinh(x)) = cosh(x)\n          funcDerivative = new FunctionNode('cosh', [arg0.clone()])\n          break\n        case 'cosh':\n          // d/dx(cosh(x)) = sinh(x)\n          funcDerivative = new FunctionNode('sinh', [arg0.clone()])\n          break\n        case 'tanh':\n          // d/dx(tanh(x)) = sech(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('sech', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'sech':\n          // d/dx(sech(x)) = -sech(x)tanh(x)\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('tanh', [arg0.clone()])\n          ])\n          break\n        case 'csch':\n          // d/dx(csch(x)) = -csch(x)coth(x)\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('coth', [arg0.clone()])\n          ])\n          break\n        case 'coth':\n          // d/dx(coth(x)) = -csch(x)^2\n          negative = true\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('csch', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'asinh':\n          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)\n          div = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('+', 'add', [\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ]),\n              createConstantNode(1)\n            ])\n          ])\n          break\n        case 'acosh':\n          // d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)\n          div = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('-', 'subtract', [\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ]),\n              createConstantNode(1)\n            ])\n          ])\n          break\n        case 'atanh':\n          // d/dx(atanh(x)) = 1 / (1 - x^2)\n          div = true\n          funcDerivative = new OperatorNode('-', 'subtract', [\n            createConstantNode(1),\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ])\n          ])\n          break\n        case 'asech':\n          // d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            arg0.clone(),\n            new FunctionNode('sqrt', [\n              new OperatorNode('-', 'subtract', [\n                createConstantNode(1),\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ])\n              ])\n            ])\n          ])\n          break\n        case 'acsch':\n          // d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            new FunctionNode('abs', [arg0.clone()]),\n            new FunctionNode('sqrt', [\n              new OperatorNode('+', 'add', [\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ]),\n                createConstantNode(1)\n              ])\n            ])\n          ])\n          break\n        case 'acoth':\n          // d/dx(acoth(x)) = -1 / (1 - x^2)\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('-', 'subtract', [\n            createConstantNode(1),\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ])\n          ])\n          break\n        case 'abs':\n          // d/dx(abs(x)) = abs(x)/x\n          funcDerivative = new OperatorNode('/', 'divide', [\n            new FunctionNode(new SymbolNode('abs'), [arg0.clone()]),\n            arg0.clone()\n          ])\n          break\n        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)\n        default: throw new Error('Function \"' + node.name + '\" is not supported by derivative, or a wrong number of arguments is passed')\n      }\n\n      let op, func\n      if (div) {\n        op = '/'\n        func = 'divide'\n      } else {\n        op = '*'\n        func = 'multiply'\n      }\n\n      /* Apply chain rule to all functions:\n         F(x)  = f(g(x))\n         F'(x) = g'(x)*f'(g(x)) */\n      let chainDerivative = _derivative(arg0, constNodes)\n      if (negative) {\n        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative])\n      }\n      return new OperatorNode(op, func, [chainDerivative, funcDerivative])\n    },\n\n    'OperatorNode, Object': function (node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0)\n      }\n\n      if (node.op === '+') {\n        // d/dx(sum(f(x)) = sum(f'(x))\n        return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {\n          return _derivative(arg, constNodes)\n        }))\n      }\n\n      if (node.op === '-') {\n        // d/dx(+/-f(x)) = +/-f'(x)\n        if (node.isUnary()) {\n          return new OperatorNode(node.op, node.fn, [\n            _derivative(node.args[0], constNodes)\n          ])\n        }\n\n        // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)\n        if (node.isBinary()) {\n          return new OperatorNode(node.op, node.fn, [\n            _derivative(node.args[0], constNodes),\n            _derivative(node.args[1], constNodes)\n          ])\n        }\n      }\n\n      if (node.op === '*') {\n        // d/dx(c*f(x)) = c*f'(x)\n        const constantTerms = node.args.filter(function (arg) {\n          return constNodes[arg] !== undefined\n        })\n\n        if (constantTerms.length > 0) {\n          const nonConstantTerms = node.args.filter(function (arg) {\n            return constNodes[arg] === undefined\n          })\n\n          const nonConstantNode = nonConstantTerms.length === 1\n            ? nonConstantTerms[0]\n            : new OperatorNode('*', 'multiply', nonConstantTerms)\n\n          const newArgs = constantTerms.concat(_derivative(nonConstantNode, constNodes))\n\n          return new OperatorNode('*', 'multiply', newArgs)\n        }\n\n        // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)\n        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {\n          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {\n            return (argInner === argOuter)\n              ? _derivative(argInner, constNodes)\n              : argInner.clone()\n          }))\n        }))\n      }\n\n      if (node.op === '/' && node.isBinary()) {\n        const arg0 = node.args[0]\n        const arg1 = node.args[1]\n\n        // d/dx(f(x) / c) = f'(x) / c\n        if (constNodes[arg1] !== undefined) {\n          return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1])\n        }\n\n        // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)\n        if (constNodes[arg0] !== undefined) {\n          return new OperatorNode('*', 'multiply', [\n            new OperatorNode('-', 'unaryMinus', [arg0]),\n            new OperatorNode('/', 'divide', [\n              _derivative(arg1, constNodes),\n              new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])\n            ])\n          ])\n        }\n\n        // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2\n        return new OperatorNode('/', 'divide', [\n          new OperatorNode('-', 'subtract', [\n            new OperatorNode('*', 'multiply', [_derivative(arg0, constNodes), arg1.clone()]),\n            new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, constNodes)])\n          ]),\n          new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])\n        ])\n      }\n\n      if (node.op === '^' && node.isBinary()) {\n        const arg0 = node.args[0]\n        const arg1 = node.args[1]\n\n        if (constNodes[arg0] !== undefined) {\n          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1\n          if (isConstantNode(arg0) && (isZero(arg0.value) || equal(arg0.value, 1))) {\n            return createConstantNode(0)\n          }\n\n          // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)\n          return new OperatorNode('*', 'multiply', [\n            node,\n            new OperatorNode('*', 'multiply', [\n              new FunctionNode('log', [arg0.clone()]),\n              _derivative(arg1.clone(), constNodes)\n            ])\n          ])\n        }\n\n        if (constNodes[arg1] !== undefined) {\n          if (isConstantNode(arg1)) {\n            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0\n            if (isZero(arg1.value)) {\n              return createConstantNode(0)\n            }\n            // Ignore exponent; f(x)^1 = f(x)\n            if (equal(arg1.value, 1)) {\n              return _derivative(arg0, constNodes)\n            }\n          }\n\n          // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)\n          const powMinusOne = new OperatorNode('^', 'pow', [\n            arg0.clone(),\n            new OperatorNode('-', 'subtract', [\n              arg1,\n              createConstantNode(1)\n            ])\n          ])\n\n          return new OperatorNode('*', 'multiply', [\n            arg1.clone(),\n            new OperatorNode('*', 'multiply', [\n              _derivative(arg0, constNodes),\n              powMinusOne\n            ])\n          ])\n        }\n\n        // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]\n        return new OperatorNode('*', 'multiply', [\n          new OperatorNode('^', 'pow', [arg0.clone(), arg1.clone()]),\n          new OperatorNode('+', 'add', [\n            new OperatorNode('*', 'multiply', [\n              _derivative(arg0, constNodes),\n              new OperatorNode('/', 'divide', [arg1.clone(), arg0.clone()])\n            ]),\n            new OperatorNode('*', 'multiply', [\n              _derivative(arg1, constNodes),\n              new FunctionNode('log', [arg0.clone()])\n            ])\n          ])\n        ])\n      }\n\n      throw new Error('Operator \"' + node.op + '\" is not supported by derivative, or a wrong number of arguments is passed')\n    }\n  })\n\n  /**\n   * Ensures the number of arguments for a function are correct,\n   * and will throw an error otherwise.\n   *\n   * @param {FunctionNode} node\n   */\n  function funcArgsCheck (node) {\n    // TODO add min, max etc\n    if ((node.name === 'log' || node.name === 'nthRoot' || node.name === 'pow') && node.args.length === 2) {\n      return\n    }\n\n    // There should be an incorrect number of arguments if we reach here\n\n    // Change all args to constants to avoid unidentified\n    // symbol error when compiling function\n    for (let i = 0; i < node.args.length; ++i) {\n      node.args[i] = createConstantNode(0)\n    }\n\n    node.compile().evaluate()\n    throw new Error('Expected TypeError, but none found')\n  }\n\n  /**\n   * Helper function to create a constant node with a specific type\n   * (number, BigNumber, Fraction)\n   * @param {number} value\n   * @param {string} [valueType]\n   * @return {ConstantNode}\n   */\n  function createConstantNode (value, valueType) {\n    return new ConstantNode(numeric(value, valueType || config.number))\n  }\n\n  return derivative\n})\n","import { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { createSimplifyConstant } from './simplify/simplifyConstant.js'\n\nconst name = 'rationalize'\nconst dependencies = [\n  'config',\n  'typed',\n  'equal',\n  'isZero',\n  'add',\n  'subtract',\n  'multiply',\n  'divide',\n  'pow',\n  'parse',\n  'simplifyCore',\n  'simplify',\n  '?bignumber',\n  '?fraction',\n  'mathWithTransform',\n  'matrix',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'SymbolNode',\n  'ParenthesisNode'\n]\n\nexport const createRationalize = /* #__PURE__ */ factory(name, dependencies, ({\n  config,\n  typed,\n  equal,\n  isZero,\n  add,\n  subtract,\n  multiply,\n  divide,\n  pow,\n  parse,\n  simplifyCore,\n  simplify,\n  fraction,\n  bignumber,\n  mathWithTransform,\n  matrix,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  SymbolNode,\n  ParenthesisNode\n}) => {\n  const simplifyConstant = createSimplifyConstant({\n    typed,\n    config,\n    mathWithTransform,\n    matrix,\n    fraction,\n    bignumber,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    SymbolNode\n  })\n\n  /**\n   * Transform a rationalizable expression in a rational fraction.\n   * If rational fraction is one variable polynomial then converts\n   * the numerator and denominator in canonical form, with decreasing\n   * exponents, returning the coefficients of numerator.\n   *\n   * Syntax:\n   *\n   *     rationalize(expr)\n   *     rationalize(expr, detailed)\n   *     rationalize(expr, scope)\n   *     rationalize(expr, scope, detailed)\n   *\n   * Examples:\n   *\n   *     math.rationalize('sin(x)+y')\n   *                   //  Error: There is an unsolved function call\n   *     math.rationalize('2x/y - y/(x+1)')\n   *                   // (2*x^2-y^2+2*x)/(x*y+y)\n   *     math.rationalize('(2x+1)^6')\n   *                   // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1\n   *     math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')\n   *                   // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)\n   *     math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =\n   *                   // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/\n   *                   //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)\n   *\n   *     math.rationalize('x+x+x+y',{y:1}) // 3*x+1\n   *     math.rationalize('x+x+x+y',{})    // 3*x+y\n   *\n   *     const ret = math.rationalize('x+x+x+y',{},true)\n   *                   // ret.expression=3*x+y, ret.variables = [\"x\",\"y\"]\n   *     const ret = math.rationalize('-2+5x^2',{},true)\n   *                   // ret.expression=5*x^2-2, ret.variables = [\"x\"], ret.coefficients=[-2,0,5]\n   *\n   * See also:\n   *\n   *     simplify\n   *\n   * @param  {Node|string} expr    The expression to check if is a polynomial expression\n   * @param  {Object|boolean}      optional scope of expression or true for already evaluated rational expression at input\n   * @param  {Boolean}  detailed   optional True if return an object, false if return expression node (default)\n   *\n   * @return {Object | Node}    The rational polynomial of `expr` or an object\n   *            `{expression, numerator, denominator, variables, coefficients}`, where\n   *              `expression` is a `Node` with the node simplified expression,\n   *              `numerator` is a `Node` with the simplified numerator of expression,\n   *              `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator),\n   *              `variables` is an array with variable names,\n   *              and `coefficients` is an array with coefficients of numerator sorted by increased exponent\n   *           {Expression Node}  node simplified expression\n   *\n   */\n  return typed(name, {\n    string: function (expr) {\n      return this(parse(expr), {}, false)\n    },\n\n    'string, boolean': function (expr, detailed) {\n      return this(parse(expr), {}, detailed)\n    },\n\n    'string, Object': function (expr, scope) {\n      return this(parse(expr), scope, false)\n    },\n\n    'string, Object, boolean': function (expr, scope, detailed) {\n      return this(parse(expr), scope, detailed)\n    },\n\n    Node: function (expr) {\n      return this(expr, {}, false)\n    },\n\n    'Node, boolean': function (expr, detailed) {\n      return this(expr, {}, detailed)\n    },\n\n    'Node, Object': function (expr, scope) {\n      return this(expr, scope, false)\n    },\n\n    'Node, Object, boolean': function (expr, scope, detailed) {\n      const setRules = rulesRationalize() // Rules for change polynomial in near canonical form\n      const polyRet = polynomial(expr, scope, true, setRules.firstRules) // Check if expression is a rationalizable polynomial\n      const nVars = polyRet.variables.length\n      const noExactFractions = { exactFractions: false }\n      const withExactFractions = { exactFractions: true }\n      expr = polyRet.expression\n\n      if (nVars >= 1) { // If expression in not a constant\n        expr = expandPower(expr) // First expand power of polynomials (cannot be made from rules!)\n        let sBefore // Previous expression\n        let rules\n        let eDistrDiv = true\n        let redoInic = false\n        // Apply the initial rules, including succ div rules:\n        expr = simplify(expr, setRules.firstRules, {}, noExactFractions)\n        let s\n        while (true) {\n          // Alternate applying successive division rules and distr.div.rules\n          // until there are no more changes:\n          rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules\n          expr = simplify(expr, rules, {}, withExactFractions)\n          eDistrDiv = !eDistrDiv // Swap between Distr.Div and Succ. Div. Rules\n\n          s = expr.toString()\n          if (s === sBefore) {\n            break // No changes : end of the loop\n          }\n\n          redoInic = true\n          sBefore = s\n        }\n\n        if (redoInic) { // Apply first rules again without succ div rules (if there are changes)\n          expr = simplify(expr, setRules.firstRulesAgain, {}, noExactFractions)\n        }\n        // Apply final rules:\n        expr = simplify(expr, setRules.finalRules, {}, noExactFractions)\n      } // NVars >= 1\n\n      const coefficients = []\n      const retRationalize = {}\n\n      if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') { // Separate numerator from denominator\n        if (nVars === 1) {\n          expr.args[0] = polyToCanonical(expr.args[0], coefficients)\n          expr.args[1] = polyToCanonical(expr.args[1])\n        }\n        if (detailed) {\n          retRationalize.numerator = expr.args[0]\n          retRationalize.denominator = expr.args[1]\n        }\n      } else {\n        if (nVars === 1) {\n          expr = polyToCanonical(expr, coefficients)\n        }\n        if (detailed) {\n          retRationalize.numerator = expr\n          retRationalize.denominator = null\n        }\n      }\n      // nVars\n\n      if (!detailed) return expr\n      retRationalize.coefficients = coefficients\n      retRationalize.variables = polyRet.variables\n      retRationalize.expression = expr\n      return retRationalize\n    } // ^^^^^^^ end of rationalize ^^^^^^^^\n  }) // end of typed rationalize\n\n  /**\n   *  Function to simplify an expression using an optional scope and\n   *  return it if the expression is a polynomial expression, i.e.\n   *  an expression with one or more variables and the operators\n   *  +, -, *, and ^, where the exponent can only be a positive integer.\n   *\n   * Syntax:\n   *\n   *     polynomial(expr,scope,extended, rules)\n   *\n   * @param  {Node | string} expr     The expression to simplify and check if is polynomial expression\n   * @param  {object} scope           Optional scope for expression simplification\n   * @param  {boolean} extended       Optional. Default is false. When true allows divide operator.\n   * @param  {array}  rules           Optional. Default is no rule.\n   *\n   *\n   * @return {Object}\n   *            {Object} node:   node simplified expression\n   *            {Array}  variables:  variable names\n   */\n  function polynomial (expr, scope, extended, rules) {\n    const variables = []\n    const node = simplify(expr, rules, scope, { exactFractions: false }) // Resolves any variables and functions with all defined parameters\n    extended = !!extended\n\n    const oper = '+-*' + (extended ? '/' : '')\n    recPoly(node)\n    const retFunc = {}\n    retFunc.expression = node\n    retFunc.variables = variables\n    return retFunc\n\n    // -------------------------------------------------------------------------------------------------------\n\n    /**\n     *  Function to simplify an expression using an optional scope and\n     *  return it if the expression is a polynomial expression, i.e.\n     *  an expression with one or more variables and the operators\n     *  +, -, *, and ^, where the exponent can only be a positive integer.\n     *\n     * Syntax:\n     *\n     *     recPoly(node)\n     *\n     *\n     * @param  {Node} node               The current sub tree expression in recursion\n     *\n     * @return                           nothing, throw an exception if error\n     */\n    function recPoly (node) {\n      const tp = node.type // node type\n      if (tp === 'FunctionNode') {\n        // No function call in polynomial expression\n        throw new Error('There is an unsolved function call')\n      } else if (tp === 'OperatorNode') {\n        if (node.op === '^') {\n          // TODO: handle negative exponents like in '1/x^(-2)'\n          if (node.args[1].type !== 'ConstantNode' || !isInteger(parseFloat(node.args[1].value))) {\n            throw new Error('There is a non-integer exponent')\n          } else {\n            recPoly(node.args[0])\n          }\n        } else {\n          if (oper.indexOf(node.op) === -1) {\n            throw new Error('Operator ' + node.op + ' invalid in polynomial expression')\n          }\n          for (let i = 0; i < node.args.length; i++) {\n            recPoly(node.args[i])\n          }\n        } // type of operator\n      } else if (tp === 'SymbolNode') {\n        const name = node.name // variable name\n        const pos = variables.indexOf(name)\n        if (pos === -1) {\n          // new variable in expression\n          variables.push(name)\n        }\n      } else if (tp === 'ParenthesisNode') {\n        recPoly(node.content)\n      } else if (tp !== 'ConstantNode') {\n        throw new Error('type ' + tp + ' is not allowed in polynomial expression')\n      }\n    } // end of recPoly\n  } // end of polynomial\n\n  // ---------------------------------------------------------------------------------------\n  /**\n   * Return a rule set to rationalize an polynomial expression in rationalize\n   *\n   * Syntax:\n   *\n   *     rulesRationalize()\n   *\n   * @return {array}        rule set to rationalize an polynomial expression\n   */\n  function rulesRationalize () {\n    const oldRules = [simplifyCore, // sCore\n      { l: 'n+n', r: '2*n' },\n      { l: 'n+-n', r: '0' },\n      simplifyConstant, // sConstant\n      { l: 'n*(n1^-1)', r: 'n/n1' },\n      { l: 'n*n1^-n2', r: 'n/n1^n2' },\n      { l: 'n1^-1', r: '1/n1' },\n      { l: 'n*(n1/n2)', r: '(n*n1)/n2' },\n      { l: '1*n', r: 'n' }]\n\n    const rulesFirst = [\n      { l: '(-n1)/(-n2)', r: 'n1/n2' }, // Unary division\n      { l: '(-n1)*(-n2)', r: 'n1*n2' }, // Unary multiplication\n      { l: 'n1--n2', r: 'n1+n2' }, // '--' elimination\n      { l: 'n1-n2', r: 'n1+(-n2)' }, // Subtraction turn into add with un�ry minus\n      { l: '(n1+n2)*n3', r: '(n1*n3 + n2*n3)' }, // Distributive 1\n      { l: 'n1*(n2+n3)', r: '(n1*n2+n1*n3)' }, // Distributive 2\n      { l: 'c1*n + c2*n', r: '(c1+c2)*n' }, // Joining constants\n      { l: 'c1*n + n', r: '(c1+1)*n' }, // Joining constants\n      { l: 'c1*n - c2*n', r: '(c1-c2)*n' }, // Joining constants\n      { l: 'c1*n - n', r: '(c1-1)*n' }, // Joining constants\n      { l: 'v/c', r: '(1/c)*v' }, // variable/constant (new!)\n      { l: 'v/-c', r: '-(1/c)*v' }, // variable/constant (new!)\n      { l: '-v*-c', r: 'c*v' }, // Inversion constant and variable 1\n      { l: '-v*c', r: '-c*v' }, // Inversion constant and variable 2\n      { l: 'v*-c', r: '-c*v' }, // Inversion constant and variable 3\n      { l: 'v*c', r: 'c*v' }, // Inversion constant and variable 4\n      { l: '-(-n1*n2)', r: '(n1*n2)' }, // Unary propagation\n      { l: '-(n1*n2)', r: '(-n1*n2)' }, // Unary propagation\n      { l: '-(-n1+n2)', r: '(n1-n2)' }, // Unary propagation\n      { l: '-(n1+n2)', r: '(-n1-n2)' }, // Unary propagation\n      { l: '(n1^n2)^n3', r: '(n1^(n2*n3))' }, // Power to Power\n      { l: '-(-n1/n2)', r: '(n1/n2)' }, // Division and Unary\n      { l: '-(n1/n2)', r: '(-n1/n2)' }] // Divisao and Unary\n\n    const rulesDistrDiv = [\n      { l: '(n1/n2 + n3/n4)', r: '((n1*n4 + n3*n2)/(n2*n4))' }, // Sum of fractions\n      { l: '(n1/n2 + n3)', r: '((n1 + n3*n2)/n2)' }, // Sum fraction with number 1\n      { l: '(n1 + n2/n3)', r: '((n1*n3 + n2)/n3)' }] // Sum fraction with number 1\n\n    const rulesSucDiv = [\n      { l: '(n1/(n2/n3))', r: '((n1*n3)/n2)' }, // Division simplification\n      { l: '(n1/n2/n3)', r: '(n1/(n2*n3))' }]\n\n    const setRules = {} // rules set in 4 steps.\n\n    // All rules => infinite loop\n    // setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)\n\n    setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv) // First rule set\n    setRules.distrDivRules = rulesDistrDiv // Just distr. div. rules\n    setRules.sucDivRules = rulesSucDiv // Jus succ. div. rules\n    setRules.firstRulesAgain = oldRules.concat(rulesFirst) // Last rules set without succ. div.\n\n    // Division simplification\n\n    // Second rule set.\n    // There is no aggregate expression with parentesis, but the only variable can be scattered.\n    setRules.finalRules = [simplifyCore, // simplify.rules[0]\n      { l: 'n*-n', r: '-n^2' }, // Joining multiply with power 1\n      { l: 'n*n', r: 'n^2' }, // Joining multiply with power 2\n      simplifyConstant, // simplify.rules[14] old 3rd index in oldRules\n      { l: 'n*-n^n1', r: '-n^(n1+1)' }, // Joining multiply with power 3\n      { l: 'n*n^n1', r: 'n^(n1+1)' }, // Joining multiply with power 4\n      { l: 'n^n1*-n^n2', r: '-n^(n1+n2)' }, // Joining multiply with power 5\n      { l: 'n^n1*n^n2', r: 'n^(n1+n2)' }, // Joining multiply with power 6\n      { l: 'n^n1*-n', r: '-n^(n1+1)' }, // Joining multiply with power 7\n      { l: 'n^n1*n', r: 'n^(n1+1)' }, // Joining multiply with power 8\n      { l: 'n^n1/-n', r: '-n^(n1-1)' }, // Joining multiply with power 8\n      { l: 'n^n1/n', r: 'n^(n1-1)' }, // Joining division with power 1\n      { l: 'n/-n^n1', r: '-n^(1-n1)' }, // Joining division with power 2\n      { l: 'n/n^n1', r: 'n^(1-n1)' }, // Joining division with power 3\n      { l: 'n^n1/-n^n2', r: 'n^(n1-n2)' }, // Joining division with power 4\n      { l: 'n^n1/n^n2', r: 'n^(n1-n2)' }, // Joining division with power 5\n      { l: 'n1+(-n2*n3)', r: 'n1-n2*n3' }, // Solving useless parenthesis 1\n      { l: 'v*(-c)', r: '-c*v' }, // Solving useless unary 2\n      { l: 'n1+-n2', r: 'n1-n2' }, // Solving +- together (new!)\n      { l: 'v*c', r: 'c*v' }, // inversion constant with variable\n      { l: '(n1^n2)^n3', r: '(n1^(n2*n3))' } // Power to Power\n\n    ]\n    return setRules\n  } // End rulesRationalize\n\n  // ---------------------------------------------------------------------------------------\n  /**\n   *  Expand recursively a tree node for handling with expressions with exponents\n   *  (it's not for constants, symbols or functions with exponents)\n   *  PS: The other parameters are internal for recursion\n   *\n   * Syntax:\n   *\n   *     expandPower(node)\n   *\n   * @param  {Node} node         Current expression node\n   * @param  {node} parent       Parent current node inside the recursion\n   * @param  (int}               Parent number of chid inside the rercursion\n   *\n   * @return {node}        node expression with all powers expanded.\n   */\n  function expandPower (node, parent, indParent) {\n    const tp = node.type\n    const internal = (arguments.length > 1) // TRUE in internal calls\n\n    if (tp === 'OperatorNode' && node.isBinary()) {\n      let does = false\n      let val\n      if (node.op === '^') { // First operator: Parenthesis or UnaryMinus\n        if ((node.args[0].type === 'ParenthesisNode' ||\n            node.args[0].type === 'OperatorNode') &&\n            (node.args[1].type === 'ConstantNode')) { // Second operator: Constant\n          val = parseFloat(node.args[1].value)\n          does = (val >= 2 && isInteger(val))\n        }\n      }\n\n      if (does) { // Exponent >= 2\n        // Before:\n        //            operator A --> Subtree\n        // parent pow\n        //            constant\n        //\n        if (val > 2) { // Exponent > 2,\n          // AFTER:  (exponent > 2)\n          //             operator A --> Subtree\n          // parent  *\n          //                 deep clone (operator A --> Subtree\n          //             pow\n          //                 constant - 1\n          //\n          const nEsqTopo = node.args[0]\n          const nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)])\n          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo])\n        } else { // Expo = 2 - no power\n          // AFTER:  (exponent =  2)\n          //             operator A --> Subtree\n          // parent   oper\n          //            deep clone (operator A --> Subtree)\n          //\n          node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()])\n        }\n\n        if (internal) {\n          // Change parent references in internal recursive calls\n          if (indParent === 'content') { parent.content = node } else { parent.args[indParent] = node }\n        }\n      } // does\n    } // binary OperatorNode\n\n    if (tp === 'ParenthesisNode') {\n      // Recursion\n      expandPower(node.content, node, 'content')\n    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {\n      for (let i = 0; i < node.args.length; i++) {\n        expandPower(node.args[i], node, i)\n      }\n    }\n\n    if (!internal) {\n      // return the root node\n      return node\n    }\n  } // End expandPower\n\n  // ---------------------------------------------------------------------------------------\n  /**\n   * Auxilary function for rationalize\n   * Convert near canonical polynomial in one variable in a canonical polynomial\n   * with one term for each exponent in decreasing order\n   *\n   * Syntax:\n   *\n   *     polyToCanonical(node [, coefficients])\n   *\n   * @param  {Node | string} expr       The near canonical polynomial expression to convert in a a canonical polynomial expression\n   *\n   *        The string or tree expression needs to be at below syntax, with free spaces:\n   *         (  (^(-)? | [+-]? )cte (*)? var (^expo)?  | cte )+\n   *       Where 'var' is one variable with any valid name\n   *             'cte' are real numeric constants with any value. It can be omitted if equal than 1\n   *             'expo' are integers greater than 0. It can be omitted if equal than 1.\n   *\n   * @param  {array}   coefficients             Optional returns coefficients sorted by increased exponent\n   *\n   *\n   * @return {node}        new node tree with one variable polynomial or string error.\n   */\n  function polyToCanonical (node, coefficients) {\n    if (coefficients === undefined) { coefficients = [] } // coefficients.\n\n    coefficients[0] = 0 // index is the exponent\n    const o = {}\n    o.cte = 1\n    o.oper = '+'\n\n    // fire: mark with * or ^ when finds * or ^ down tree, reset to \"\" with + and -.\n    //       It is used to deduce the exponent: 1 for *, 0 for \"\".\n    o.fire = ''\n\n    let maxExpo = 0 // maximum exponent\n    let varname = '' // variable name\n\n    recurPol(node, null, o)\n    maxExpo = coefficients.length - 1\n    let first = true\n    let no\n\n    for (let i = maxExpo; i >= 0; i--) {\n      if (coefficients[i] === 0) continue\n      let n1 = new ConstantNode(\n        first ? coefficients[i] : Math.abs(coefficients[i]))\n      const op = coefficients[i] < 0 ? '-' : '+'\n\n      if (i > 0) { // Is not a constant without variable\n        let n2 = new SymbolNode(varname)\n        if (i > 1) {\n          const n3 = new ConstantNode(i)\n          n2 = new OperatorNode('^', 'pow', [n2, n3])\n        }\n        if (coefficients[i] === -1 && first) { n1 = new OperatorNode('-', 'unaryMinus', [n2]) } else if (Math.abs(coefficients[i]) === 1) { n1 = n2 } else { n1 = new OperatorNode('*', 'multiply', [n1, n2]) }\n      }\n\n      if (first) { no = n1 } else if (op === '+') { no = new OperatorNode('+', 'add', [no, n1]) } else { no = new OperatorNode('-', 'subtract', [no, n1]) }\n\n      first = false\n    } // for\n\n    if (first) { return new ConstantNode(0) } else { return no }\n\n    /**\n     * Recursive auxilary function inside polyToCanonical for\n     * converting expression in canonical form\n     *\n     * Syntax:\n     *\n     *     recurPol(node, noPai, obj)\n     *\n     * @param  {Node} node        The current subpolynomial expression\n     * @param  {Node | Null}  noPai   The current parent node\n     * @param  {object}    obj        Object with many internal flags\n     *\n     * @return {}                    No return. If error, throws an exception\n     */\n    function recurPol (node, noPai, o) {\n      const tp = node.type\n      if (tp === 'FunctionNode') {\n        // ***** FunctionName *****\n        // No function call in polynomial expression\n        throw new Error('There is an unsolved function call')\n      } else if (tp === 'OperatorNode') {\n        // ***** OperatorName *****\n        if ('+-*^'.indexOf(node.op) === -1) throw new Error('Operator ' + node.op + ' invalid')\n\n        if (noPai !== null) {\n          // -(unary),^  : children of *,+,-\n          if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' &&\n                                noPai.fn !== 'subtract' && noPai.fn !== 'multiply') { throw new Error('Invalid ' + node.op + ' placing') }\n\n          // -,+,* : children of +,-\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') &&\n              noPai.fn !== 'add' && noPai.fn !== 'subtract') { throw new Error('Invalid ' + node.op + ' placing') }\n\n          // -,+ : first child\n          if ((node.fn === 'subtract' || node.fn === 'add' ||\n            node.fn === 'unaryMinus') && o.noFil !== 0) { throw new Error('Invalid ' + node.op + ' placing') }\n        } // Has parent\n\n        // Firers: ^,*       Old:   ^,&,-(unary): firers\n        if (node.op === '^' || node.op === '*') {\n          o.fire = node.op\n        }\n\n        for (let i = 0; i < node.args.length; i++) {\n          // +,-: reset fire\n          if (node.fn === 'unaryMinus') o.oper = '-'\n          if (node.op === '+' || node.fn === 'subtract') {\n            o.fire = ''\n            o.cte = 1 // default if there is no constant\n            o.oper = (i === 0 ? '+' : node.op)\n          }\n          o.noFil = i // number of son\n          recurPol(node.args[i], node, o)\n        } // for in children\n      } else if (tp === 'SymbolNode') { // ***** SymbolName *****\n        if (node.name !== varname && varname !== '') { throw new Error('There is more than one variable') }\n        varname = node.name\n        if (noPai === null) {\n          coefficients[1] = 1\n          return\n        }\n\n        // ^: Symbol is First child\n        if (noPai.op === '^' && o.noFil !== 0) { throw new Error('In power the variable should be the first parameter') }\n\n        // *: Symbol is Second child\n        if (noPai.op === '*' && o.noFil !== 1) { throw new Error('In multiply the variable should be the second parameter') }\n\n        // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)\n        if (o.fire === '' || o.fire === '*') {\n          if (maxExpo < 1) coefficients[1] = 0\n          coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1)\n          maxExpo = Math.max(1, maxExpo)\n        }\n      } else if (tp === 'ConstantNode') {\n        const valor = parseFloat(node.value)\n        if (noPai === null) {\n          coefficients[0] = valor\n          return\n        }\n        if (noPai.op === '^') {\n          // cte: second  child of power\n          if (o.noFil !== 1) throw new Error('Constant cannot be powered')\n\n          if (!isInteger(valor) || valor <= 0) { throw new Error('Non-integer exponent is not allowed') }\n\n          for (let i = maxExpo + 1; i < valor; i++) coefficients[i] = 0\n          if (valor > maxExpo) coefficients[valor] = 0\n          coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1)\n          maxExpo = Math.max(valor, maxExpo)\n          return\n        }\n        o.cte = valor\n\n        // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.\n        if (o.fire === '') { coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1) }\n      } else { throw new Error('Type ' + tp + ' is not allowed') }\n    } // End of recurPol\n  } // End of polyToCanonical\n})\n","import { factory } from '../utils/factory.js'\n\nconst name = 'reviver'\nconst dependencies = [\n  'classes'\n]\n\nexport const createReviver = /* #__PURE__ */ factory(name, dependencies, ({ classes }) => {\n  /**\n   * Instantiate mathjs data types from their JSON representation\n   * @param {string} key\n   * @param {*} value\n   * @returns {*} Returns the revived object\n   */\n  return function reviver (key, value) {\n    const constructor = classes[value && value.mathjs]\n\n    if (constructor && typeof constructor.fromJSON === 'function') {\n      return constructor.fromJSON(value)\n    }\n\n    return value\n  }\n})\n","import { factory } from '../utils/factory.js'\n\nconst name = 'replacer'\nconst dependencies = []\n\nexport const createReplacer = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Stringify data types into their JSON representation.\n   * Most data types can be serialized using their `.toJSON` method,\n   * but not all, for example the number `Infinity`. For these cases you have\n   * to use the replacer. Example usage:\n   *\n   *     JSON.stringify([2, Infinity], math.replacer)\n   *\n   * @param {string} key\n   * @param {*} value\n   * @returns {*} Returns the replaced object\n   */\n  return function replacer (key, value) {\n    // the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON\n    if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {\n      return {\n        mathjs: 'number',\n        value: String(value)\n      }\n    }\n\n    return value\n  }\n})\n","\nexport const pi = Math.PI\nexport const tau = 2 * Math.PI\nexport const e = Math.E\nexport const phi = 1.6180339887498948 // eslint-disable-line no-loss-of-precision\n","import { factory } from './utils/factory.js'\nimport { version } from './version.js'\nimport {\n  createBigNumberE,\n  createBigNumberPhi,\n  createBigNumberPi,\n  createBigNumberTau\n} from './utils/bignumber/constants.js'\nimport { pi, tau, e, phi } from './plain/number/index.js'\n\nexport const createTrue = /* #__PURE__ */ factory('true', [], () => true)\nexport const createFalse = /* #__PURE__ */ factory('false', [], () => false)\nexport const createNull = /* #__PURE__ */ factory('null', [], () => null)\n\nexport const createInfinity = /* #__PURE__ */ recreateFactory(\n  'Infinity',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(Infinity)\n    : Infinity\n)\n\nexport const createNaN = /* #__PURE__ */ recreateFactory(\n  'NaN',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(NaN)\n    : NaN\n)\n\nexport const createPi = /* #__PURE__ */ recreateFactory(\n  'pi',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberPi(BigNumber)\n    : pi\n)\n\nexport const createTau = /* #__PURE__ */ recreateFactory(\n  'tau',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberTau(BigNumber)\n    : tau\n)\n\nexport const createE = /* #__PURE__ */ recreateFactory(\n  'e',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberE(BigNumber)\n    : e\n)\n\n// golden ratio, (1+sqrt(5))/2\nexport const createPhi = /* #__PURE__ */ recreateFactory(\n  'phi',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberPhi(BigNumber)\n    : phi\n)\n\nexport const createLN2 = /* #__PURE__ */ recreateFactory(\n  'LN2',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(2).ln()\n    : Math.LN2\n)\n\nexport const createLN10 = /* #__PURE__ */ recreateFactory(\n  'LN10',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(10).ln()\n    : Math.LN10\n)\n\nexport const createLOG2E = /* #__PURE__ */ recreateFactory(\n  'LOG2E',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(1).div(new BigNumber(2).ln())\n    : Math.LOG2E\n)\n\nexport const createLOG10E = /* #__PURE__ */ recreateFactory(\n  'LOG10E',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(1).div(new BigNumber(10).ln())\n    : Math.LOG10E\n)\n\nexport const createSQRT1_2 = /* #__PURE__ */ recreateFactory( // eslint-disable-line camelcase\n  'SQRT1_2',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber('0.5').sqrt()\n    : Math.SQRT1_2\n)\n\nexport const createSQRT2 = /* #__PURE__ */ recreateFactory(\n  'SQRT2',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(2).sqrt()\n    : Math.SQRT2\n)\n\nexport const createI = /* #__PURE__ */ recreateFactory(\n  'i',\n  ['Complex'],\n  ({ Complex }) => Complex.I\n)\n\n// for backward compatibility with v5\nexport const createUppercasePi = /* #__PURE__ */ factory('PI', ['pi'], ({ pi }) => pi)\nexport const createUppercaseE = /* #__PURE__ */ factory('E', ['e'], ({ e }) => e)\n\nexport const createVersion = /* #__PURE__ */ factory('version', [], () => version)\n\n// helper function to create a factory with a flag recreateOnConfigChange\n// idea: allow passing optional properties to be attached to the factory function as 4th argument?\nfunction recreateFactory (name, dependencies, create) {\n  return factory(name, dependencies, create, {\n    recreateOnConfigChange: true\n  })\n}\n","export const version = '10.4.3'\n// Note: This file is automatically generated when building math.js.\n// Changes made in this file will be overwritten.\n","import { factory } from '../../utils/factory.js'\n\n// Source: https://en.wikipedia.org/wiki/Physical_constant\n\n// Universal constants\nexport const createSpeedOfLight = /* #__PURE__ */ unitFactory('speedOfLight', '299792458', 'm s^-1')\nexport const createGravitationConstant = /* #__PURE__ */ unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2')\nexport const createPlanckConstant = /* #__PURE__ */ unitFactory('planckConstant', '6.62607015e-34', 'J s')\nexport const createReducedPlanckConstant = /* #__PURE__ */ unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s')\n\n// Electromagnetic constants\nexport const createMagneticConstant = /* #__PURE__ */ unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2')\nexport const createElectricConstant = /* #__PURE__ */ unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1')\nexport const createVacuumImpedance = /* #__PURE__ */ unitFactory('vacuumImpedance', '376.730313667', 'ohm')\nexport const createCoulomb = /* #__PURE__ */ unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2')\nexport const createElementaryCharge = /* #__PURE__ */ unitFactory('elementaryCharge', '1.602176634e-19', 'C')\nexport const createBohrMagneton = /* #__PURE__ */ unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1')\nexport const createConductanceQuantum = /* #__PURE__ */ unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S')\nexport const createInverseConductanceQuantum = /* #__PURE__ */ unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm')\nexport const createMagneticFluxQuantum = /* #__PURE__ */ unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb')\nexport const createNuclearMagneton = /* #__PURE__ */ unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1')\nexport const createKlitzing = /* #__PURE__ */ unitFactory('klitzing', '25812.807459304513', 'ohm')\nexport const createJosephson = /* #__PURE__ */ unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1') // TODO: support for Hz needed\n\n// Atomic and nuclear constants\nexport const createBohrRadius = /* #__PURE__ */ unitFactory('bohrRadius', '5.29177210903e-11', 'm')\nexport const createClassicalElectronRadius = /* #__PURE__ */ unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm')\nexport const createElectronMass = /* #__PURE__ */ unitFactory('electronMass', '9.1093837015e-31', 'kg')\nexport const createFermiCoupling = /* #__PURE__ */ unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2')\nexport const createFineStructure = numberFactory('fineStructure', 7.2973525693e-3)\nexport const createHartreeEnergy = /* #__PURE__ */ unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J')\nexport const createProtonMass = /* #__PURE__ */ unitFactory('protonMass', '1.67262192369e-27', 'kg')\nexport const createDeuteronMass = /* #__PURE__ */ unitFactory('deuteronMass', '3.3435830926e-27', 'kg')\nexport const createNeutronMass = /* #__PURE__ */ unitFactory('neutronMass', '1.6749271613e-27', 'kg')\nexport const createQuantumOfCirculation = /* #__PURE__ */ unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1')\nexport const createRydberg = /* #__PURE__ */ unitFactory('rydberg', '10973731.568160', 'm^-1')\nexport const createThomsonCrossSection = /* #__PURE__ */ unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2')\nexport const createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290)\nexport const createEfimovFactor = numberFactory('efimovFactor', 22.7)\n\n// Physico-chemical constants\nexport const createAtomicMass = /* #__PURE__ */ unitFactory('atomicMass', '1.66053906660e-27', 'kg')\nexport const createAvogadro = /* #__PURE__ */ unitFactory('avogadro', '6.02214076e23', 'mol^-1')\nexport const createBoltzmann = /* #__PURE__ */ unitFactory('boltzmann', '1.380649e-23', 'J K^-1')\nexport const createFaraday = /* #__PURE__ */ unitFactory('faraday', '96485.33212331001', 'C mol^-1')\nexport const createFirstRadiation = /* #__PURE__ */ unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2')\n// export const createSpectralRadiance = /* #__PURE__ */ unitFactory('spectralRadiance', '1.1910429723971881e-16', 'W m^2 sr^-1') // TODO spectralRadiance\nexport const createLoschmidt = /* #__PURE__ */ unitFactory('loschmidt', '2.686780111798444e25', 'm^-3')\nexport const createGasConstant = /* #__PURE__ */ unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1')\nexport const createMolarPlanckConstant = /* #__PURE__ */ unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1')\nexport const createMolarVolume = /* #__PURE__ */ unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1')\nexport const createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358)\nexport const createSecondRadiation = /* #__PURE__ */ unitFactory('secondRadiation', '0.014387768775039337', 'm K')\nexport const createStefanBoltzmann = /* #__PURE__ */ unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4')\nexport const createWienDisplacement = /* #__PURE__ */ unitFactory('wienDisplacement', '2.897771955e-3', 'm K')\n\n// Adopted values\nexport const createMolarMass = /* #__PURE__ */ unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1')\nexport const createMolarMassC12 = /* #__PURE__ */ unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1')\nexport const createGravity = /* #__PURE__ */ unitFactory('gravity', '9.80665', 'm s^-2')\n// atm is defined in Unit.js\n\n// Natural units\nexport const createPlanckLength = /* #__PURE__ */ unitFactory('planckLength', '1.616255e-35', 'm')\nexport const createPlanckMass = /* #__PURE__ */ unitFactory('planckMass', '2.176435e-8', 'kg')\nexport const createPlanckTime = /* #__PURE__ */ unitFactory('planckTime', '5.391245e-44', 's')\nexport const createPlanckCharge = /* #__PURE__ */ unitFactory('planckCharge', '1.87554603778e-18', 'C')\nexport const createPlanckTemperature = /* #__PURE__ */ unitFactory('planckTemperature', '1.416785e+32', 'K')\n\n// helper function to create a factory function which creates a physical constant,\n// a Unit with either a number value or a BigNumber value depending on the configuration\nfunction unitFactory (name, valueStr, unitStr) {\n  const dependencies = ['config', 'Unit', 'BigNumber']\n\n  return factory(name, dependencies, ({ config, Unit, BigNumber }) => {\n    // Note that we can parse into number or BigNumber.\n    // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values\n    // Therefore we dont use Unit.parse()\n    const value = config.number === 'BigNumber'\n      ? new BigNumber(valueStr)\n      : parseFloat(valueStr)\n\n    const unit = new Unit(value, unitStr)\n    unit.fixPrefix = true\n    return unit\n  })\n}\n\n// helper function to create a factory function which creates a numeric constant,\n// either a number or BigNumber depending on the configuration\nfunction numberFactory (name, value) {\n  const dependencies = ['config', 'BigNumber']\n\n  return factory(name, dependencies, ({ config, BigNumber }) => {\n    return config.number === 'BigNumber'\n      ? new BigNumber(value)\n      : value\n  })\n}\n","import { errorTransform } from './utils/errorTransform.js'\nimport { factory } from '../../utils/factory.js'\nimport { createApply } from '../../function/matrix/apply.js'\nimport { isBigNumber, isNumber } from '../../utils/is.js'\n\nconst name = 'apply'\nconst dependencies = ['typed', 'isInteger']\n\n/**\n * Attach a transform function to math.apply\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function apply\n * from one-based to zero based\n */\nexport const createApplyTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, isInteger }) => {\n  const apply = createApply({ typed, isInteger })\n\n  // @see: comment of concat itself\n  return typed('apply', {\n    '...any': function (args) {\n      // change dim from one-based to zero-based\n      const dim = args[1]\n\n      if (isNumber(dim)) {\n        args[1] = dim - 1\n      } else if (isBigNumber(dim)) {\n        args[1] = dim.minus(1)\n      }\n\n      try {\n        return apply.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { errorTransform } from './utils/errorTransform.js'\nimport { factory } from '../../utils/factory.js'\nimport { createColumn } from '../../function/matrix/column.js'\nimport { isNumber } from '../../utils/is.js'\n\nconst name = 'column'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\n/**\n * Attach a transform function to matrix.column\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `index` parameter of function column\n * from zero-based to one-based\n */\nexport const createColumnTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  const column = createColumn({ typed, Index, matrix, range })\n\n  // @see: comment of column itself\n  return typed('column', {\n    '...any': function (args) {\n      // change last argument from zero-based to one-based\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (isNumber(last)) {\n        args[lastIndex] = last - 1\n      }\n\n      try {\n        return column.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { isSymbolNode } from '../../../utils/is.js'\nimport { createSubScope } from '../../../utils/scope.js'\n\n/**\n * Compile an inline expression like \"x > 0\"\n * @param {Node} expression\n * @param {Object} math\n * @param {Object} scope\n * @return {function} Returns a function with one argument which fills in the\n *                    undefined variable (like \"x\") and evaluates the expression\n */\nexport function compileInlineExpression (expression, math, scope) {\n  // find an undefined symbol\n  const symbol = expression.filter(function (node) {\n    return isSymbolNode(node) &&\n        !(node.name in math) &&\n        !(scope.has(node.name))\n  })[0]\n\n  if (!symbol) {\n    throw new Error('No undefined variable found in inline expression \"' + expression + '\"')\n  }\n\n  // create a test function for this equation\n  const name = symbol.name // variable name\n  const subScope = createSubScope(scope)\n  const eq = expression.compile()\n  return function inlineExpression (x) {\n    subScope.set(name, x)\n    return eq.evaluate(subScope)\n  }\n}\n","import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js'\nimport { filter, filterRegExp } from '../../utils/array.js'\nimport { maxArgumentCount } from '../../utils/function.js'\nimport { compileInlineExpression } from './utils/compileInlineExpression.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'filter'\nconst dependencies = ['typed']\n\nexport const createFilterTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Attach a transform function to math.filter\n   * Adds a property transform containing the transform function.\n   *\n   * This transform adds support for equations as test function for math.filter,\n   * so you can do something like 'filter([3, -2, 5], x > 0)'.\n   */\n  function filterTransform (args, math, scope) {\n    let x, callback\n\n    if (args[0]) {\n      x = args[0].compile().evaluate(scope)\n    }\n\n    if (args[1]) {\n      if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = args[1].compile().evaluate(scope)\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(args[1], math, scope)\n      }\n    }\n\n    return filter(x, callback)\n  }\n  filterTransform.rawArgs = true\n\n  // one based version of function filter\n  const filter = typed('filter', {\n    'Array, function': _filter,\n\n    'Matrix, function': function (x, test) {\n      return x.create(_filter(x.toArray(), test))\n    },\n\n    'Array, RegExp': filterRegExp,\n\n    'Matrix, RegExp': function (x, test) {\n      return x.create(filterRegExp(x.toArray(), test))\n    }\n  })\n\n  return filterTransform\n}, { isTransformFunction: true })\n\n/**\n * Filter values in a callback given a callback function\n *\n * !!! Passes a one-based index !!!\n *\n * @param {Array} x\n * @param {Function} callback\n * @return {Array} Returns the filtered array\n * @private\n */\nfunction _filter (x, callback) {\n  // figure out what number of arguments the callback function expects\n  const args = maxArgumentCount(callback)\n\n  return filter(x, function (value, index, array) {\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 + 1])\n    } else { // 3 or -1\n      return callback(value, [index + 1], array)\n    }\n  })\n}\n","import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js'\nimport { maxArgumentCount } from '../../utils/function.js'\nimport { forEach } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { compileInlineExpression } from './utils/compileInlineExpression.js'\n\nconst name = 'forEach'\nconst dependencies = ['typed']\n\nexport const createForEachTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Attach a transform function to math.forEach\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a one-based index instead of a zero-based index\n   */\n  function forEachTransform (args, math, scope) {\n    let x, callback\n\n    if (args[0]) {\n      x = args[0].compile().evaluate(scope)\n    }\n\n    if (args[1]) {\n      if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {\n        // a function pointer, like forEach([3, -2, 5], myTestFunction)\n        callback = args[1].compile().evaluate(scope)\n      } else {\n        // an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )\n        callback = compileInlineExpression(args[1], math, scope)\n      }\n    }\n\n    return _forEach(x, callback)\n  }\n  forEachTransform.rawArgs = true\n\n  // one-based version of forEach\n  const _forEach = typed('forEach', {\n    'Array | Matrix, function': function (array, callback) {\n      // figure out what number of arguments the callback function expects\n      const args = maxArgumentCount(callback)\n\n      const recurse = function (value, index) {\n        if (Array.isArray(value)) {\n          forEach(value, function (child, i) {\n            // we create a copy of the index array and append the new index value\n            recurse(child, index.concat(i + 1)) // one based index, hence i+1\n          })\n        } else {\n          // invoke the callback function with the right number of arguments\n          if (args === 1) {\n            callback(value)\n          } else if (args === 2) {\n            callback(value, index)\n          } else { // 3 or -1\n            callback(value, index, array)\n          }\n        }\n      }\n      recurse(array.valueOf(), []) // pass Array\n    }\n  })\n\n  return forEachTransform\n}, { isTransformFunction: true })\n","import { isArray, isBigNumber, isMatrix, isNumber, isRange } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'index'\nconst dependencies = ['Index']\n\nexport const createIndexTransform = /* #__PURE__ */ factory(name, dependencies, ({ Index }) => {\n  /**\n   * Attach a transform function to math.index\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a one-based index instead of a zero-based index\n   */\n  return function indexTransform () {\n    const args = []\n    for (let i = 0, ii = arguments.length; i < ii; i++) {\n      let arg = arguments[i]\n\n      // change from one-based to zero based, and convert BigNumber to number\n      if (isRange(arg)) {\n        arg.start--\n        arg.end -= (arg.step > 0 ? 0 : 2)\n      } else if (arg && arg.isSet === true) {\n        arg = arg.map(function (v) { return v - 1 })\n      } else if (isArray(arg) || isMatrix(arg)) {\n        arg = arg.map(function (v) { return v - 1 })\n      } else if (isNumber(arg)) {\n        arg--\n      } else if (isBigNumber(arg)) {\n        arg = arg.toNumber() - 1\n      } else if (typeof arg === 'string') {\n        // leave as is\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range')\n      }\n\n      args[i] = arg\n    }\n\n    const res = new Index()\n    Index.apply(res, args)\n    return res\n  }\n}, { isTransformFunction: true })\n","import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js'\nimport { maxArgumentCount } from '../../utils/function.js'\nimport { map } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { compileInlineExpression } from './utils/compileInlineExpression.js'\n\nconst name = 'map'\nconst dependencies = ['typed']\n\nexport const createMapTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Attach a transform function to math.map\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a one-based index instead of a zero-based index\n   */\n  function mapTransform (args, math, scope) {\n    let x, callback\n\n    if (args[0]) {\n      x = args[0].compile().evaluate(scope)\n    }\n\n    if (args[1]) {\n      if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = args[1].compile().evaluate(scope)\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(args[1], math, scope)\n      }\n    }\n\n    return map(x, callback)\n  }\n  mapTransform.rawArgs = true\n\n  // one-based version of map function\n  const map = typed('map', {\n    'Array, function': function (x, callback) {\n      return _map(x, callback, x)\n    },\n\n    'Matrix, function': function (x, callback) {\n      return x.create(_map(x.valueOf(), callback, x))\n    }\n  })\n\n  return mapTransform\n}, { isTransformFunction: true })\n\n/**\n * Map for a multi dimensional array. One-based indexes\n * @param {Array} array\n * @param {function} callback\n * @param {Array} orig\n * @return {Array}\n * @private\n */\nfunction _map (array, callback, orig) {\n  // figure out what number of arguments the callback function expects\n  const argsCount = maxArgumentCount(callback)\n\n  function recurse (value, index) {\n    if (Array.isArray(value)) {\n      return map(value, function (child, i) {\n        // we create a copy of the index array and append the new index value\n        return recurse(child, index.concat(i + 1)) // one based index, hence i + 1\n      })\n    } else {\n      // invoke the (typed) callback function with the right number of arguments\n      if (argsCount === 1) {\n        return callback(value)\n      } else if (argsCount === 2) {\n        return callback(value, index)\n      } else { // 3 or -1\n        return callback(value, index, orig)\n      }\n    }\n  }\n\n  return recurse(array, [])\n}\n","import { isBigNumber, isCollection, isNumber } from '../../../utils/is.js'\n\n/**\n * Change last argument dim from one-based to zero-based.\n */\nexport function lastDimToZeroBase (args) {\n  if (args.length === 2 && isCollection(args[0])) {\n    args = args.slice()\n    const dim = args[1]\n    if (isNumber(dim)) {\n      args[1] = dim - 1\n    } else if (isBigNumber(dim)) {\n      args[1] = dim.minus(1)\n    }\n  }\n  return args\n}\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createMax } from '../../function/statistics/max.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'max'\nconst dependencies = ['typed', 'config', 'numeric', 'larger']\n\nexport const createMaxTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, larger }) => {\n  const max = createMax({ typed, config, numeric, larger })\n\n  /**\n   * Attach a transform function to math.max\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function max\n   * from one-based to zero based\n   */\n  return typed('max', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return max.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createMean } from '../../function/statistics/mean.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'mean'\nconst dependencies = ['typed', 'add', 'divide']\n\nexport const createMeanTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide }) => {\n  const mean = createMean({ typed, add, divide })\n\n  /**\n   * Attach a transform function to math.mean\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function mean\n   * from one-based to zero based\n   */\n  return typed('mean', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return mean.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createMin } from '../../function/statistics/min.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'min'\nconst dependencies = ['typed', 'config', 'numeric', 'smaller']\n\nexport const createMinTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, smaller }) => {\n  const min = createMin({ typed, config, numeric, smaller })\n\n  /**\n   * Attach a transform function to math.min\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function min\n   * from one-based to zero based\n   */\n  return typed('min', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return min.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { createRange } from '../../function/matrix/range.js'\n\nconst name = 'range'\nconst dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq']\n\nexport const createRangeTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, bignumber, smaller, smallerEq, larger, largerEq }) => {\n  const range = createRange({ typed, config, matrix, bignumber, smaller, smallerEq, larger, largerEq })\n\n  /**\n   * Attach a transform function to math.range\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a range which includes the end value\n   */\n  return typed('range', {\n    '...any': function (args) {\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (typeof last !== 'boolean') {\n        // append a parameter includeEnd=true\n        args.push(true)\n      }\n\n      return range.apply(null, args)\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { createRow } from '../../function/matrix/row.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { isNumber } from '../../utils/is.js'\n\nconst name = 'row'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\n/**\n * Attach a transform function to matrix.column\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `index` parameter of function column\n * from zero-based to one-based\n */\nexport const createRowTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  const row = createRow({ typed, Index, matrix, range })\n\n  // @see: comment of row itself\n  return typed('row', {\n    '...any': function (args) {\n      // change last argument from zero-based to one-based\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (isNumber(last)) {\n        args[lastIndex] = last - 1\n      }\n\n      try {\n        return row.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createSubset } from '../../function/matrix/subset.js'\n\nconst name = 'subset'\nconst dependencies = ['typed', 'matrix']\n\nexport const createSubsetTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  const subset = createSubset({ typed, matrix })\n\n  /**\n   * Attach a transform function to math.subset\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a range which includes the end value\n   */\n  return typed('subset', {\n    '...any': function (args) {\n      try {\n        return subset.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { isBigNumber, isNumber } from '../../utils/is.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { factory } from '../../utils/factory.js'\nimport { createConcat } from '../../function/matrix/concat.js'\n\nconst name = 'concat'\nconst dependencies = ['typed', 'matrix', 'isInteger']\n\nexport const createConcatTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, isInteger }) => {\n  const concat = createConcat({ typed, matrix, isInteger })\n\n  /**\n   * Attach a transform function to math.range\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function concat\n   * from one-based to zero based\n   */\n  return typed('concat', {\n    '...any': function (args) {\n      // change last argument from one-based to zero-based\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (isNumber(last)) {\n        args[lastIndex] = last - 1\n      } else if (isBigNumber(last)) {\n        args[lastIndex] = last.minus(1)\n      }\n\n      try {\n        return concat.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createDiff } from '../../function/matrix/diff.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'diff'\nconst dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber']\n\nexport const createDiffTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtract, number, bignumber }) => {\n  const diff = createDiff({ typed, matrix, subtract, number, bignumber })\n\n  /**\n   * Attach a transform function to math.diff\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a range which includes the end value\n   */\n  return typed(name, {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return diff.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { createStd } from '../../function/statistics/std.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'std'\nconst dependencies = ['typed', 'sqrt', 'variance']\n\n/**\n * Attach a transform function to math.std\n * Adds a property transform containing the transform function.\n *\n * This transform changed the `dim` parameter of function std\n * from one-based to zero based\n */\nexport const createStdTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, sqrt, variance }) => {\n  const std = createStd({ typed, sqrt, variance })\n\n  return typed('std', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return std.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createSum } from '../../function/statistics/sum.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\n/**\n * Attach a transform function to math.sum\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function sum\n * from one-based to zero based\n */\nconst name = 'sum'\nconst dependencies = ['typed', 'config', 'add', 'numeric']\n\nexport const createSumTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, add, numeric }) => {\n  const sum = createSum({ typed, config, add, numeric })\n\n  return typed(name, {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return sum.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { isBigNumber, isCollection, isNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createCumSum } from '../../function/statistics/cumsum.js'\n\n/**\n * Attach a transform function to math.sum\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function sum\n * from one-based to zero based\n */\nconst name = 'cumsum'\nconst dependencies = ['typed', 'add', 'unaryPlus']\n\nexport const createCumSumTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, unaryPlus }) => {\n  const cumsum = createCumSum({ typed, add, unaryPlus })\n\n  return typed(name, {\n    '...any': function (args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length === 2 && isCollection(args[0])) {\n        const dim = args[1]\n        if (isNumber(dim)) {\n          args[1] = dim - 1\n        } else if (isBigNumber(dim)) {\n          args[1] = dim.minus(1)\n        }\n      }\n\n      try {\n        return cumsum.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createVariance } from '../../function/statistics/variance.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'variance'\nconst dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN']\n\n/**\n * Attach a transform function to math.var\n * Adds a property transform containing the transform function.\n *\n * This transform changed the `dim` parameter of function var\n * from one-based to zero based\n */\nexport const createVarianceTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, subtract, multiply, divide, apply, isNaN }) => {\n  const variance = createVariance({ typed, add, subtract, multiply, divide, apply, isNaN })\n\n  return typed(name, {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return variance.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { isBigNumber, isComplex, isFraction, isMatrix, isUnit } from '../../utils/is.js'\nimport { isFactory, stripOptionalNotation } from '../../utils/factory.js'\nimport { hasOwnProperty, lazy } from '../../utils/object.js'\nimport { contains } from '../../utils/array.js'\nimport { ArgumentsError } from '../../error/ArgumentsError.js'\n\nexport function importFactory (typed, load, math, importedFactories) {\n  /**\n   * Import functions from an object or a module.\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *    math.import(functions)\n   *    math.import(functions, options)\n   *\n   * Where:\n   *\n   * - `functions: Object`\n   *   An object with functions or factories to be imported.\n   * - `options: Object` An object with import options. Available options:\n   *   - `override: boolean`\n   *     If true, existing functions will be overwritten. False by default.\n   *   - `silent: boolean`\n   *     If true, the function will not throw errors on duplicates or invalid\n   *     types. False by default.\n   *   - `wrap: boolean`\n   *     If true, the functions will be wrapped in a wrapper function\n   *     which converts data types like Matrix to primitive data types like Array.\n   *     The wrapper is needed when extending math.js with libraries which do not\n   *     support these data type. False by default.\n   *\n   * Examples:\n   *\n   *    import { create, all } from 'mathjs'\n   *    import * as numbers from 'numbers'\n   *\n   *    // create a mathjs instance\n   *    const math = create(all)\n   *\n   *    // define new functions and variables\n   *    math.import({\n   *      myvalue: 42,\n   *      hello: function (name) {\n   *        return 'hello, ' + name + '!'\n   *      }\n   *    })\n   *\n   *    // use the imported function and variable\n   *    math.myvalue * 2               // 84\n   *    math.hello('user')             // 'hello, user!'\n   *\n   *    // import the npm module 'numbers'\n   *    // (must be installed first with `npm install numbers`)\n   *    math.import(numbers, {wrap: true})\n   *\n   *    math.fibonacci(7) // returns 13\n   *\n   * @param {Object | Array} functions  Object with functions to be imported.\n   * @param {Object} [options]          Import options.\n   */\n  function mathImport (functions, options) {\n    const num = arguments.length\n    if (num !== 1 && num !== 2) {\n      throw new ArgumentsError('import', num, 1, 2)\n    }\n\n    if (!options) {\n      options = {}\n    }\n\n    function flattenImports (flatValues, value, name) {\n      if (Array.isArray(value)) {\n        value.forEach(item => flattenImports(flatValues, item))\n      } else if (typeof value === 'object') {\n        for (const name in value) {\n          if (hasOwnProperty(value, name)) {\n            flattenImports(flatValues, value[name], name)\n          }\n        }\n      } else if (isFactory(value) || name !== undefined) {\n        const flatName = isFactory(value)\n          ? isTransformFunctionFactory(value)\n              ? (value.fn + '.transform') // TODO: this is ugly\n              : value.fn\n          : name\n\n        // we allow importing the same function twice if it points to the same implementation\n        if (hasOwnProperty(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {\n          throw new Error('Cannot import \"' + flatName + '\" twice')\n        }\n\n        flatValues[flatName] = value\n      } else {\n        if (!options.silent) {\n          throw new TypeError('Factory, Object, or Array expected')\n        }\n      }\n    }\n\n    const flatValues = {}\n    flattenImports(flatValues, functions)\n\n    for (const name in flatValues) {\n      if (hasOwnProperty(flatValues, name)) {\n        // console.log('import', name)\n        const value = flatValues[name]\n\n        if (isFactory(value)) {\n          // we ignore name here and enforce the name of the factory\n          // maybe at some point we do want to allow overriding it\n          // in that case we can implement an option overrideFactoryNames: true\n          _importFactory(value, options)\n        } else if (isSupportedType(value)) {\n          _import(name, value, options)\n        } else {\n          if (!options.silent) {\n            throw new TypeError('Factory, Object, or Array expected')\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Add a property to the math namespace\n   * @param {string} name\n   * @param {*} value\n   * @param {Object} options  See import for a description of the options\n   * @private\n   */\n  function _import (name, value, options) {\n    // TODO: refactor this function, it's to complicated and contains duplicate code\n    if (options.wrap && typeof value === 'function') {\n      // create a wrapper around the function\n      value = _wrap(value)\n    }\n\n    // turn a plain function with a typed-function signature into a typed-function\n    if (hasTypedFunctionSignature(value)) {\n      value = typed(name, {\n        [value.signature]: value\n      })\n    }\n\n    if (isTypedFunction(math[name]) && isTypedFunction(value)) {\n      if (options.override) {\n        // give the typed function the right name\n        value = typed(name, value.signatures)\n      } else {\n        // merge the existing and typed function\n        value = typed(math[name], value)\n      }\n\n      math[name] = value\n      delete importedFactories[name]\n\n      _importTransform(name, value)\n      math.emit('import', name, function resolver () {\n        return value\n      })\n      return\n    }\n\n    if (math[name] === undefined || options.override) {\n      math[name] = value\n      delete importedFactories[name]\n\n      _importTransform(name, value)\n      math.emit('import', name, function resolver () {\n        return value\n      })\n      return\n    }\n\n    if (!options.silent) {\n      throw new Error('Cannot import \"' + name + '\": already exists')\n    }\n  }\n\n  function _importTransform (name, value) {\n    if (value && typeof value.transform === 'function') {\n      math.expression.transform[name] = value.transform\n      if (allowedInExpressions(name)) {\n        math.expression.mathWithTransform[name] = value.transform\n      }\n    } else {\n      // remove existing transform\n      delete math.expression.transform[name]\n      if (allowedInExpressions(name)) {\n        math.expression.mathWithTransform[name] = value\n      }\n    }\n  }\n\n  function _deleteTransform (name) {\n    delete math.expression.transform[name]\n    if (allowedInExpressions(name)) {\n      math.expression.mathWithTransform[name] = math[name]\n    } else {\n      delete math.expression.mathWithTransform[name]\n    }\n  }\n\n  /**\n   * Create a wrapper a round an function which converts the arguments\n   * to their primitive values (like convert a Matrix to Array)\n   * @param {Function} fn\n   * @return {Function} Returns the wrapped function\n   * @private\n   */\n  function _wrap (fn) {\n    const wrapper = function wrapper () {\n      const args = []\n      for (let i = 0, len = arguments.length; i < len; i++) {\n        const arg = arguments[i]\n        args[i] = arg && arg.valueOf()\n      }\n      return fn.apply(math, args)\n    }\n\n    if (fn.transform) {\n      wrapper.transform = fn.transform\n    }\n\n    return wrapper\n  }\n\n  /**\n   * Import an instance of a factory into math.js\n   * @param {function(scope: object)} factory\n   * @param {Object} options  See import for a description of the options\n   * @param {string} [name=factory.name] Optional custom name\n   * @private\n   */\n  function _importFactory (factory, options, name = factory.fn) {\n    if (contains(name, '.')) {\n      throw new Error('Factory name should not contain a nested path. ' +\n        'Name: ' + JSON.stringify(name))\n    }\n\n    const namespace = isTransformFunctionFactory(factory)\n      ? math.expression.transform\n      : math\n\n    const existingTransform = name in math.expression.transform\n    const existing = hasOwnProperty(namespace, name) ? namespace[name] : undefined\n\n    const resolver = function () {\n      // collect all dependencies, handle finding both functions and classes and other special cases\n      const dependencies = {}\n      factory.dependencies\n        .map(stripOptionalNotation)\n        .forEach(dependency => {\n          if (contains(dependency, '.')) {\n            throw new Error('Factory dependency should not contain a nested path. ' +\n              'Name: ' + JSON.stringify(dependency))\n          }\n\n          if (dependency === 'math') {\n            dependencies.math = math\n          } else if (dependency === 'mathWithTransform') {\n            dependencies.mathWithTransform = math.expression.mathWithTransform\n          } else if (dependency === 'classes') { // special case for json reviver\n            dependencies.classes = math\n          } else {\n            dependencies[dependency] = math[dependency]\n          }\n        })\n\n      const instance = /* #__PURE__ */ factory(dependencies)\n\n      if (instance && typeof instance.transform === 'function') {\n        throw new Error('Transforms cannot be attached to factory functions. ' +\n            'Please create a separate function for it with exports.path=\"expression.transform\"')\n      }\n\n      if (existing === undefined || options.override) {\n        return instance\n      }\n\n      if (isTypedFunction(existing) && isTypedFunction(instance)) {\n        // merge the existing and new typed function\n        return typed(existing, instance)\n      }\n\n      if (options.silent) {\n        // keep existing, ignore imported function\n        return existing\n      } else {\n        throw new Error('Cannot import \"' + name + '\": already exists')\n      }\n    }\n\n    // TODO: add unit test with non-lazy factory\n    if (!factory.meta || factory.meta.lazy !== false) {\n      lazy(namespace, name, resolver)\n\n      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n      if (existing && existingTransform) {\n        _deleteTransform(name)\n      } else {\n        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {\n          lazy(math.expression.mathWithTransform, name, () => namespace[name])\n        }\n      }\n    } else {\n      namespace[name] = resolver()\n\n      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n      if (existing && existingTransform) {\n        _deleteTransform(name)\n      } else {\n        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {\n          lazy(math.expression.mathWithTransform, name, () => namespace[name])\n        }\n      }\n    }\n\n    // TODO: improve factories, store a list with imports instead which can be re-played\n    importedFactories[name] = factory\n\n    math.emit('import', name, resolver)\n  }\n\n  /**\n   * Check whether given object is a type which can be imported\n   * @param {Function | number | string | boolean | null | Unit | Complex} object\n   * @return {boolean}\n   * @private\n   */\n  function isSupportedType (object) {\n    return typeof object === 'function' ||\n        typeof object === 'number' ||\n        typeof object === 'string' ||\n        typeof object === 'boolean' ||\n        object === null ||\n        isUnit(object) ||\n        isComplex(object) ||\n        isBigNumber(object) ||\n        isFraction(object) ||\n        isMatrix(object) ||\n        Array.isArray(object)\n  }\n\n  /**\n   * Test whether a given thing is a typed-function\n   * @param {*} fn\n   * @return {boolean} Returns true when `fn` is a typed-function\n   */\n  function isTypedFunction (fn) {\n    return typeof fn === 'function' && typeof fn.signatures === 'object'\n  }\n\n  function hasTypedFunctionSignature (fn) {\n    return typeof fn === 'function' && typeof fn.signature === 'string'\n  }\n\n  function allowedInExpressions (name) {\n    return !hasOwnProperty(unsafe, name)\n  }\n\n  function factoryAllowedInExpressions (factory) {\n    return factory.fn.indexOf('.') === -1 && // FIXME: make checking on path redundant, check on meta data instead\n      !hasOwnProperty(unsafe, factory.fn) &&\n      (!factory.meta || !factory.meta.isClass)\n  }\n\n  function isTransformFunctionFactory (factory) {\n    return (factory !== undefined &&\n      factory.meta !== undefined &&\n      factory.meta.isTransformFunction === true) || false\n  }\n\n  // namespaces and functions not available in the parser for safety reasons\n  const unsafe = {\n    expression: true,\n    type: true,\n    docs: true,\n    error: true,\n    json: true,\n    chain: true // chain method not supported. Note that there is a unit chain too.\n  }\n\n  return mathImport\n}\n","export const DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  epsilon: 1e-12,\n\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n\n  // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction\n  number: 'number',\n\n  // number of significant digits in BigNumbers\n  precision: 64,\n\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\n  // random seed for seeded pseudo random number generation\n  // null = randomly seed\n  randomSeed: null\n}\n","import { clone, mapObject, deepExtend } from '../../utils/object.js'\nimport { DEFAULT_CONFIG } from '../config.js'\n\nexport const MATRIX_OPTIONS = ['Matrix', 'Array'] // valid values for option matrix\nexport const 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      const 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\n      const curr = mapObject(config, clone)\n\n      const changes = mapObject(options, clone)\n\n      // emit 'config' event\n      emit('config', curr, prev, changes)\n\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\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 + '\". ' +\n      'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.')\n  }\n}\n","import * as all from './factoriesAny.js'\nimport { create } from './core/create.js'\n\nexport default create(all)\n","import './../utils/polyfills.js'\nimport { deepFlatten, isLegacyFactory, values } from '../utils/object.js'\nimport * as emitter from './../utils/emitter.js'\nimport { importFactory } from './function/import.js'\nimport { configFactory } from './function/config.js'\nimport { factory, isFactory } from '../utils/factory.js'\nimport {\n  isAccessorNode,\n  isArray,\n  isArrayNode,\n  isAssignmentNode,\n  isBigNumber,\n  isBlockNode,\n  isBoolean,\n  isChain,\n  isCollection,\n  isComplex,\n  isConditionalNode,\n  isConstantNode,\n  isDate,\n  isDenseMatrix,\n  isFraction,\n  isFunction,\n  isFunctionAssignmentNode,\n  isFunctionNode,\n  isHelp,\n  isIndex,\n  isIndexNode,\n  isMatrix,\n  isNode,\n  isNull,\n  isNumber,\n  isObject,\n  isObjectNode,\n  isOperatorNode,\n  isParenthesisNode,\n  isRange,\n  isRangeNode,\n  isRegExp,\n  isResultSet,\n  isSparseMatrix,\n  isString,\n  isSymbolNode,\n  isUndefined,\n  isUnit\n} from '../utils/is.js'\nimport { ArgumentsError } from '../error/ArgumentsError.js'\nimport { DimensionError } from '../error/DimensionError.js'\nimport { IndexError } from '../error/IndexError.js'\nimport { DEFAULT_CONFIG } from './config.js'\n\n/**\n * Create a mathjs instance from given factory functions and optionally config\n *\n * Usage:\n *\n *     const mathjs1 = create({ createAdd, createMultiply, ...})\n *     const config = { number: 'BigNumber' }\n *     const mathjs2 = create(all, config)\n *\n * @param {Object} [factories] An object with factory functions\n *                             The object can contain nested objects,\n *                             all nested objects will be flattened.\n * @param {Object} [config]    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 *                            {boolean} predictable\n *                              Predictable output type of functions. When true,\n *                              output type depends only on the input types. When\n *                              false (default), output type can vary depending\n *                              on input values. For example `math.sqrt(-4)`\n *                              returns `complex('2i')` when predictable is false, and\n *                              returns `NaN` when true.\n *                            {string} randomSeed\n *                              Random seed for seeded pseudo random number generator.\n *                              Set to null to randomly seed.\n * @returns {Object} Returns a bare-bone math.js instance containing\n *                   functions:\n *                   - `import` to add new functions\n *                   - `config` to change configuration\n *                   - `on`, `off`, `once`, `emit` for events\n */\nexport function create (factories, config) {\n  const configInternal = Object.assign({}, DEFAULT_CONFIG, config)\n\n  // simple test for ES5 support\n  if (typeof Object.create !== 'function') {\n    throw new Error('ES5 not supported by this JavaScript engine. ' +\n      'Please load the es5-shim and es5-sham library for compatibility.')\n  }\n\n  // create the mathjs instance\n  const math = emitter.mixin({\n    // only here for backward compatibility for legacy factory functions\n    isNumber,\n    isComplex,\n    isBigNumber,\n    isFraction,\n    isUnit,\n    isString,\n    isArray,\n    isMatrix,\n    isCollection,\n    isDenseMatrix,\n    isSparseMatrix,\n    isRange,\n    isIndex,\n    isBoolean,\n    isResultSet,\n    isHelp,\n    isFunction,\n    isDate,\n    isRegExp,\n    isObject,\n    isNull,\n    isUndefined,\n\n    isAccessorNode,\n    isArrayNode,\n    isAssignmentNode,\n    isBlockNode,\n    isConditionalNode,\n    isConstantNode,\n    isFunctionAssignmentNode,\n    isFunctionNode,\n    isIndexNode,\n    isNode,\n    isObjectNode,\n    isOperatorNode,\n    isParenthesisNode,\n    isRangeNode,\n    isSymbolNode,\n\n    isChain\n  })\n\n  // load config function and apply provided config\n  math.config = configFactory(configInternal, math.emit)\n\n  math.expression = {\n    transform: {},\n    mathWithTransform: {\n      config: math.config\n    }\n  }\n\n  // cached factories and instances used by function load\n  const legacyFactories = []\n  const legacyInstances = []\n\n  /**\n   * Load a function or data type from a factory.\n   * If the function or data type already exists, the existing instance is\n   * returned.\n   * @param {Function} factory\n   * @returns {*}\n   */\n  function load (factory) {\n    if (isFactory(factory)) {\n      return factory(math)\n    }\n\n    const firstProperty = factory[Object.keys(factory)[0]]\n    if (isFactory(firstProperty)) {\n      return firstProperty(math)\n    }\n\n    if (!isLegacyFactory(factory)) {\n      console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory)\n      throw new Error('Factory object with properties `type`, `name`, and `factory` expected')\n    }\n\n    const index = legacyFactories.indexOf(factory)\n    let instance\n    if (index === -1) {\n      // doesn't yet exist\n      if (factory.math === true) {\n        // pass with math namespace\n        instance = factory.factory(math.type, configInternal, load, math.typed, math)\n      } else {\n        instance = factory.factory(math.type, configInternal, load, math.typed)\n      }\n\n      // append to the cache\n      legacyFactories.push(factory)\n      legacyInstances.push(instance)\n    } else {\n      // already existing function, return the cached instance\n      instance = legacyInstances[index]\n    }\n\n    return instance\n  }\n\n  const importedFactories = {}\n\n  // load the import function\n  function lazyTyped (...args) {\n    return math.typed.apply(math.typed, args)\n  }\n  const internalImport = importFactory(lazyTyped, load, math, importedFactories)\n  math.import = internalImport\n\n  // listen for changes in config, import all functions again when changed\n  // TODO: move this listener into the import function?\n  math.on('config', () => {\n    values(importedFactories).forEach(factory => {\n      if (factory && factory.meta && factory.meta.recreateOnConfigChange) {\n        // FIXME: only re-create when the current instance is the same as was initially created\n        // FIXME: delete the functions/constants before importing them again?\n        internalImport(factory, { override: true })\n      }\n    })\n  })\n\n  // the create function exposed on the mathjs instance is bound to\n  // the factory functions passed before\n  math.create = create.bind(null, factories)\n\n  // export factory function\n  math.factory = factory\n\n  // import the factory functions like createAdd as an array instead of object,\n  // else they will get a different naming (`createAdd` instead of `add`).\n  math.import(values(deepFlatten(factories)))\n\n  math.ArgumentsError = ArgumentsError\n  math.DimensionError = DimensionError\n  math.IndexError = IndexError\n\n  return math\n}\n","import Emitter from 'tiny-emitter'\n\n/**\n * Extend given object with emitter functions `on`, `off`, `once`, `emit`\n * @param {Object} obj\n * @return {Object} obj\n */\nexport function mixin (obj) {\n  // create event emitter\n  const emitter = new Emitter()\n\n  // bind methods to obj (we don't want to expose the emitter.e Array...)\n  obj.on = emitter.on.bind(emitter)\n  obj.off = emitter.off.bind(emitter)\n  obj.once = emitter.once.bind(emitter)\n  obj.emit = emitter.emit.bind(emitter)\n\n  return obj\n}\n"],"sourceRoot":""}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/browser/package.json b/node_modules/mathjs/lib/browser/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/lib/browser/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/lib/cjs/constants.js b/node_modules/mathjs/lib/cjs/constants.js
new file mode 100644
index 0000000..c86d2a2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/constants.js
@@ -0,0 +1,129 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createVersion = exports.createUppercasePi = exports.createUppercaseE = exports.createTrue = exports.createTau = exports.createSQRT2 = exports.createSQRT1_2 = exports.createPi = exports.createPhi = exports.createNull = exports.createNaN = exports.createLOG2E = exports.createLOG10E = exports.createLN2 = exports.createLN10 = exports.createInfinity = exports.createI = exports.createFalse = exports.createE = void 0;
+
+var _factory = require("./utils/factory.js");
+
+var _version = require("./version.js");
+
+var _constants = require("./utils/bignumber/constants.js");
+
+var _index = require("./plain/number/index.js");
+
+var createTrue = /* #__PURE__ */(0, _factory.factory)('true', [], function () {
+  return true;
+});
+exports.createTrue = createTrue;
+var createFalse = /* #__PURE__ */(0, _factory.factory)('false', [], function () {
+  return false;
+});
+exports.createFalse = createFalse;
+var createNull = /* #__PURE__ */(0, _factory.factory)('null', [], function () {
+  return null;
+});
+exports.createNull = createNull;
+var createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], function (_ref) {
+  var config = _ref.config,
+      BigNumber = _ref.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;
+});
+exports.createInfinity = createInfinity;
+var createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], function (_ref2) {
+  var config = _ref2.config,
+      BigNumber = _ref2.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;
+});
+exports.createNaN = createNaN;
+var createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], function (_ref3) {
+  var config = _ref3.config,
+      BigNumber = _ref3.BigNumber;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberPi)(BigNumber) : _index.pi;
+});
+exports.createPi = createPi;
+var createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], function (_ref4) {
+  var config = _ref4.config,
+      BigNumber = _ref4.BigNumber;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberTau)(BigNumber) : _index.tau;
+});
+exports.createTau = createTau;
+var createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], function (_ref5) {
+  var config = _ref5.config,
+      BigNumber = _ref5.BigNumber;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberE)(BigNumber) : _index.e;
+}); // golden ratio, (1+sqrt(5))/2
+
+exports.createE = createE;
+var createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], function (_ref6) {
+  var config = _ref6.config,
+      BigNumber = _ref6.BigNumber;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberPhi)(BigNumber) : _index.phi;
+});
+exports.createPhi = createPhi;
+var createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], function (_ref7) {
+  var config = _ref7.config,
+      BigNumber = _ref7.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;
+});
+exports.createLN2 = createLN2;
+var createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], function (_ref8) {
+  var config = _ref8.config,
+      BigNumber = _ref8.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;
+});
+exports.createLN10 = createLN10;
+var createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], function (_ref9) {
+  var config = _ref9.config,
+      BigNumber = _ref9.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;
+});
+exports.createLOG2E = createLOG2E;
+var createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], function (_ref10) {
+  var config = _ref10.config,
+      BigNumber = _ref10.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;
+});
+exports.createLOG10E = createLOG10E;
+var createSQRT1_2 = /* #__PURE__ */recreateFactory( // eslint-disable-line camelcase
+'SQRT1_2', ['config', '?BigNumber'], function (_ref11) {
+  var config = _ref11.config,
+      BigNumber = _ref11.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;
+});
+exports.createSQRT1_2 = createSQRT1_2;
+var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], function (_ref12) {
+  var config = _ref12.config,
+      BigNumber = _ref12.BigNumber;
+  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;
+});
+exports.createSQRT2 = createSQRT2;
+var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], function (_ref13) {
+  var Complex = _ref13.Complex;
+  return Complex.I;
+}); // for backward compatibility with v5
+
+exports.createI = createI;
+var createUppercasePi = /* #__PURE__ */(0, _factory.factory)('PI', ['pi'], function (_ref14) {
+  var pi = _ref14.pi;
+  return pi;
+});
+exports.createUppercasePi = createUppercasePi;
+var createUppercaseE = /* #__PURE__ */(0, _factory.factory)('E', ['e'], function (_ref15) {
+  var e = _ref15.e;
+  return e;
+});
+exports.createUppercaseE = createUppercaseE;
+var createVersion = /* #__PURE__ */(0, _factory.factory)('version', [], function () {
+  return _version.version;
+}); // helper function to create a factory with a flag recreateOnConfigChange
+// idea: allow passing optional properties to be attached to the factory function as 4th argument?
+
+exports.createVersion = createVersion;
+
+function recreateFactory(name, dependencies, create) {
+  return (0, _factory.factory)(name, dependencies, create, {
+    recreateOnConfigChange: true
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/config.js b/node_modules/mathjs/lib/cjs/core/config.js
new file mode 100644
index 0000000..3012857
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/config.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.DEFAULT_CONFIG = void 0;
+var DEFAULT_CONFIG = {
+  // minimum relative difference between two compared values,
+  // used by all comparison functions
+  epsilon: 1e-12,
+  // type of default matrix output. Choose 'matrix' (default) or 'array'
+  matrix: 'Matrix',
+  // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction
+  number: 'number',
+  // number of significant digits in BigNumbers
+  precision: 64,
+  // predictable output type of functions. When true, output type depends only
+  // on the input types. When false (default), output type can vary depending
+  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when
+  // predictable is false, and returns `NaN` when true.
+  predictable: false,
+  // random seed for seeded pseudo random number generation
+  // null = randomly seed
+  randomSeed: null
+};
+exports.DEFAULT_CONFIG = DEFAULT_CONFIG;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/create.js b/node_modules/mathjs/lib/cjs/core/create.js
new file mode 100644
index 0000000..791d186
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/create.js
@@ -0,0 +1,223 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+var _typeof = require("@babel/runtime/helpers/typeof");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.create = create;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+require("./../utils/polyfills.js");
+
+var _object = require("../utils/object.js");
+
+var emitter = _interopRequireWildcard(require("./../utils/emitter.js"));
+
+var _import = require("./function/import.js");
+
+var _config = require("./function/config.js");
+
+var _factory = require("../utils/factory.js");
+
+var _is = require("../utils/is.js");
+
+var _ArgumentsError = require("../error/ArgumentsError.js");
+
+var _DimensionError = require("../error/DimensionError.js");
+
+var _IndexError = require("../error/IndexError.js");
+
+var _config2 = require("./config.js");
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+/**
+ * Create a mathjs instance from given factory functions and optionally config
+ *
+ * Usage:
+ *
+ *     const mathjs1 = create({ createAdd, createMultiply, ...})
+ *     const config = { number: 'BigNumber' }
+ *     const mathjs2 = create(all, config)
+ *
+ * @param {Object} [factories] An object with factory functions
+ *                             The object can contain nested objects,
+ *                             all nested objects will be flattened.
+ * @param {Object} [config]    Available options:
+ *                            {number} epsilon
+ *                              Minimum relative difference between two
+ *                              compared values, used by all comparison functions.
+ *                            {string} matrix
+ *                              A string 'Matrix' (default) or 'Array'.
+ *                            {string} number
+ *                              A string 'number' (default), 'BigNumber', or 'Fraction'
+ *                            {number} precision
+ *                              The number of significant digits for BigNumbers.
+ *                              Not applicable for Numbers.
+ *                            {boolean} predictable
+ *                              Predictable output type of functions. When true,
+ *                              output type depends only on the input types. When
+ *                              false (default), output type can vary depending
+ *                              on input values. For example `math.sqrt(-4)`
+ *                              returns `complex('2i')` when predictable is false, and
+ *                              returns `NaN` when true.
+ *                            {string} randomSeed
+ *                              Random seed for seeded pseudo random number generator.
+ *                              Set to null to randomly seed.
+ * @returns {Object} Returns a bare-bone math.js instance containing
+ *                   functions:
+ *                   - `import` to add new functions
+ *                   - `config` to change configuration
+ *                   - `on`, `off`, `once`, `emit` for events
+ */
+function create(factories, config) {
+  var configInternal = (0, _extends2.default)({}, _config2.DEFAULT_CONFIG, config); // simple test for ES5 support
+
+  if (typeof Object.create !== 'function') {
+    throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');
+  } // create the mathjs instance
+
+
+  var math = emitter.mixin({
+    // only here for backward compatibility for legacy factory functions
+    isNumber: _is.isNumber,
+    isComplex: _is.isComplex,
+    isBigNumber: _is.isBigNumber,
+    isFraction: _is.isFraction,
+    isUnit: _is.isUnit,
+    isString: _is.isString,
+    isArray: _is.isArray,
+    isMatrix: _is.isMatrix,
+    isCollection: _is.isCollection,
+    isDenseMatrix: _is.isDenseMatrix,
+    isSparseMatrix: _is.isSparseMatrix,
+    isRange: _is.isRange,
+    isIndex: _is.isIndex,
+    isBoolean: _is.isBoolean,
+    isResultSet: _is.isResultSet,
+    isHelp: _is.isHelp,
+    isFunction: _is.isFunction,
+    isDate: _is.isDate,
+    isRegExp: _is.isRegExp,
+    isObject: _is.isObject,
+    isNull: _is.isNull,
+    isUndefined: _is.isUndefined,
+    isAccessorNode: _is.isAccessorNode,
+    isArrayNode: _is.isArrayNode,
+    isAssignmentNode: _is.isAssignmentNode,
+    isBlockNode: _is.isBlockNode,
+    isConditionalNode: _is.isConditionalNode,
+    isConstantNode: _is.isConstantNode,
+    isFunctionAssignmentNode: _is.isFunctionAssignmentNode,
+    isFunctionNode: _is.isFunctionNode,
+    isIndexNode: _is.isIndexNode,
+    isNode: _is.isNode,
+    isObjectNode: _is.isObjectNode,
+    isOperatorNode: _is.isOperatorNode,
+    isParenthesisNode: _is.isParenthesisNode,
+    isRangeNode: _is.isRangeNode,
+    isSymbolNode: _is.isSymbolNode,
+    isChain: _is.isChain
+  }); // load config function and apply provided config
+
+  math.config = (0, _config.configFactory)(configInternal, math.emit);
+  math.expression = {
+    transform: {},
+    mathWithTransform: {
+      config: math.config
+    }
+  }; // cached factories and instances used by function load
+
+  var legacyFactories = [];
+  var legacyInstances = [];
+  /**
+   * Load a function or data type from a factory.
+   * If the function or data type already exists, the existing instance is
+   * returned.
+   * @param {Function} factory
+   * @returns {*}
+   */
+
+  function load(factory) {
+    if ((0, _factory.isFactory)(factory)) {
+      return factory(math);
+    }
+
+    var firstProperty = factory[Object.keys(factory)[0]];
+
+    if ((0, _factory.isFactory)(firstProperty)) {
+      return firstProperty(math);
+    }
+
+    if (!(0, _object.isLegacyFactory)(factory)) {
+      console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);
+      throw new Error('Factory object with properties `type`, `name`, and `factory` expected');
+    }
+
+    var index = legacyFactories.indexOf(factory);
+    var instance;
+
+    if (index === -1) {
+      // doesn't yet exist
+      if (factory.math === true) {
+        // pass with math namespace
+        instance = factory.factory(math.type, configInternal, load, math.typed, math);
+      } else {
+        instance = factory.factory(math.type, configInternal, load, math.typed);
+      } // append to the cache
+
+
+      legacyFactories.push(factory);
+      legacyInstances.push(instance);
+    } else {
+      // already existing function, return the cached instance
+      instance = legacyInstances[index];
+    }
+
+    return instance;
+  }
+
+  var importedFactories = {}; // load the import function
+
+  function lazyTyped() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+
+    return math.typed.apply(math.typed, args);
+  }
+
+  var internalImport = (0, _import.importFactory)(lazyTyped, load, math, importedFactories);
+  math.import = internalImport; // listen for changes in config, import all functions again when changed
+  // TODO: move this listener into the import function?
+
+  math.on('config', function () {
+    (0, _object.values)(importedFactories).forEach(function (factory) {
+      if (factory && factory.meta && factory.meta.recreateOnConfigChange) {
+        // FIXME: only re-create when the current instance is the same as was initially created
+        // FIXME: delete the functions/constants before importing them again?
+        internalImport(factory, {
+          override: true
+        });
+      }
+    });
+  }); // the create function exposed on the mathjs instance is bound to
+  // the factory functions passed before
+
+  math.create = create.bind(null, factories); // export factory function
+
+  math.factory = _factory.factory; // import the factory functions like createAdd as an array instead of object,
+  // else they will get a different naming (`createAdd` instead of `add`).
+
+  math.import((0, _object.values)((0, _object.deepFlatten)(factories)));
+  math.ArgumentsError = _ArgumentsError.ArgumentsError;
+  math.DimensionError = _DimensionError.DimensionError;
+  math.IndexError = _IndexError.IndexError;
+  return math;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/function/config.js b/node_modules/mathjs/lib/cjs/core/function/config.js
new file mode 100644
index 0000000..d860aa4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/function/config.js
@@ -0,0 +1,122 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NUMBER_OPTIONS = exports.MATRIX_OPTIONS = void 0;
+exports.configFactory = configFactory;
+
+var _object = require("../../utils/object.js");
+
+var _config2 = require("../config.js");
+
+var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix
+
+exports.MATRIX_OPTIONS = MATRIX_OPTIONS;
+var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number
+
+exports.NUMBER_OPTIONS = NUMBER_OPTIONS;
+
+function configFactory(config, emit) {
+  /**
+   * Set configuration options for math.js, and get current options.
+   * Will emit a 'config' event, with arguments (curr, prev, changes).
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *     math.config(config: Object): Object
+   *
+   * Examples:
+   *
+   *
+   *     import { create, all } from 'mathjs'
+   *
+   *     // create a mathjs instance
+   *     const math = create(all)
+   *
+   *     math.config().number                // outputs 'number'
+   *     math.evaluate('0.4')                // outputs number 0.4
+   *     math.config({number: 'Fraction'})
+   *     math.evaluate('0.4')                // outputs Fraction 2/5
+   *
+   * @param {Object} [options] Available options:
+   *                            {number} epsilon
+   *                              Minimum relative difference between two
+   *                              compared values, used by all comparison functions.
+   *                            {string} matrix
+   *                              A string 'Matrix' (default) or 'Array'.
+   *                            {string} number
+   *                              A string 'number' (default), 'BigNumber', or 'Fraction'
+   *                            {number} precision
+   *                              The number of significant digits for BigNumbers.
+   *                              Not applicable for Numbers.
+   *                            {string} parenthesis
+   *                              How to display parentheses in LaTeX and string
+   *                              output.
+   *                            {string} randomSeed
+   *                              Random seed for seeded pseudo random number generator.
+   *                              Set to null to randomly seed.
+   * @return {Object} Returns the current configuration
+   */
+  function _config(options) {
+    if (options) {
+      var prev = (0, _object.mapObject)(config, _object.clone); // validate some of the options
+
+      validateOption(options, 'matrix', MATRIX_OPTIONS);
+      validateOption(options, 'number', NUMBER_OPTIONS); // merge options
+
+      (0, _object.deepExtend)(config, options);
+      var curr = (0, _object.mapObject)(config, _object.clone);
+      var changes = (0, _object.mapObject)(options, _object.clone); // emit 'config' event
+
+      emit('config', curr, prev, changes);
+      return curr;
+    } else {
+      return (0, _object.mapObject)(config, _object.clone);
+    }
+  } // attach the valid options to the function so they can be extended
+
+
+  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;
+  _config.NUMBER_OPTIONS = NUMBER_OPTIONS; // attach the config properties as readonly properties to the config function
+
+  Object.keys(_config2.DEFAULT_CONFIG).forEach(function (key) {
+    Object.defineProperty(_config, key, {
+      get: function get() {
+        return config[key];
+      },
+      enumerable: true,
+      configurable: true
+    });
+  });
+  return _config;
+}
+/**
+ * Test whether an Array contains a specific item.
+ * @param {Array.<string>} array
+ * @param {string} item
+ * @return {boolean}
+ */
+
+
+function contains(array, item) {
+  return array.indexOf(item) !== -1;
+}
+/**
+ * Validate an option
+ * @param {Object} options         Object with options
+ * @param {string} name            Name of the option to validate
+ * @param {Array.<string>} values  Array with valid values for this option
+ */
+
+
+function validateOption(options, name, values) {
+  if (options[name] !== undefined && !contains(values, options[name])) {
+    // unknown value
+    console.warn('Warning: Unknown value "' + options[name] + '" for configuration option "' + name + '". ' + 'Available options: ' + values.map(function (value) {
+      return JSON.stringify(value);
+    }).join(', ') + '.');
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/function/import.js b/node_modules/mathjs/lib/cjs/core/function/import.js
new file mode 100644
index 0000000..2e92176
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/function/import.js
@@ -0,0 +1,395 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.importFactory = importFactory;
+
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _ArgumentsError = require("../../error/ArgumentsError.js");
+
+function importFactory(typed, load, math, importedFactories) {
+  /**
+   * Import functions from an object or a module.
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *    math.import(functions)
+   *    math.import(functions, options)
+   *
+   * Where:
+   *
+   * - `functions: Object`
+   *   An object with functions or factories to be imported.
+   * - `options: Object` An object with import options. Available options:
+   *   - `override: boolean`
+   *     If true, existing functions will be overwritten. False by default.
+   *   - `silent: boolean`
+   *     If true, the function will not throw errors on duplicates or invalid
+   *     types. False by default.
+   *   - `wrap: boolean`
+   *     If true, the functions will be wrapped in a wrapper function
+   *     which converts data types like Matrix to primitive data types like Array.
+   *     The wrapper is needed when extending math.js with libraries which do not
+   *     support these data type. False by default.
+   *
+   * Examples:
+   *
+   *    import { create, all } from 'mathjs'
+   *    import * as numbers from 'numbers'
+   *
+   *    // create a mathjs instance
+   *    const math = create(all)
+   *
+   *    // define new functions and variables
+   *    math.import({
+   *      myvalue: 42,
+   *      hello: function (name) {
+   *        return 'hello, ' + name + '!'
+   *      }
+   *    })
+   *
+   *    // use the imported function and variable
+   *    math.myvalue * 2               // 84
+   *    math.hello('user')             // 'hello, user!'
+   *
+   *    // import the npm module 'numbers'
+   *    // (must be installed first with `npm install numbers`)
+   *    math.import(numbers, {wrap: true})
+   *
+   *    math.fibonacci(7) // returns 13
+   *
+   * @param {Object | Array} functions  Object with functions to be imported.
+   * @param {Object} [options]          Import options.
+   */
+  function mathImport(functions, options) {
+    var num = arguments.length;
+
+    if (num !== 1 && num !== 2) {
+      throw new _ArgumentsError.ArgumentsError('import', num, 1, 2);
+    }
+
+    if (!options) {
+      options = {};
+    }
+
+    function flattenImports(flatValues, value, name) {
+      if (Array.isArray(value)) {
+        value.forEach(function (item) {
+          return flattenImports(flatValues, item);
+        });
+      } else if ((0, _typeof2.default)(value) === 'object') {
+        for (var _name in value) {
+          if ((0, _object.hasOwnProperty)(value, _name)) {
+            flattenImports(flatValues, value[_name], _name);
+          }
+        }
+      } else if ((0, _factory.isFactory)(value) || name !== undefined) {
+        var flatName = (0, _factory.isFactory)(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly
+        : value.fn : name; // we allow importing the same function twice if it points to the same implementation
+
+        if ((0, _object.hasOwnProperty)(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {
+          throw new Error('Cannot import "' + flatName + '" twice');
+        }
+
+        flatValues[flatName] = value;
+      } else {
+        if (!options.silent) {
+          throw new TypeError('Factory, Object, or Array expected');
+        }
+      }
+    }
+
+    var flatValues = {};
+    flattenImports(flatValues, functions);
+
+    for (var name in flatValues) {
+      if ((0, _object.hasOwnProperty)(flatValues, name)) {
+        // console.log('import', name)
+        var value = flatValues[name];
+
+        if ((0, _factory.isFactory)(value)) {
+          // we ignore name here and enforce the name of the factory
+          // maybe at some point we do want to allow overriding it
+          // in that case we can implement an option overrideFactoryNames: true
+          _importFactory(value, options);
+        } else if (isSupportedType(value)) {
+          _import(name, value, options);
+        } else {
+          if (!options.silent) {
+            throw new TypeError('Factory, Object, or Array expected');
+          }
+        }
+      }
+    }
+  }
+  /**
+   * Add a property to the math namespace
+   * @param {string} name
+   * @param {*} value
+   * @param {Object} options  See import for a description of the options
+   * @private
+   */
+
+
+  function _import(name, value, options) {
+    // TODO: refactor this function, it's to complicated and contains duplicate code
+    if (options.wrap && typeof value === 'function') {
+      // create a wrapper around the function
+      value = _wrap(value);
+    } // turn a plain function with a typed-function signature into a typed-function
+
+
+    if (hasTypedFunctionSignature(value)) {
+      value = typed(name, (0, _defineProperty2.default)({}, value.signature, value));
+    }
+
+    if (isTypedFunction(math[name]) && isTypedFunction(value)) {
+      if (options.override) {
+        // give the typed function the right name
+        value = typed(name, value.signatures);
+      } else {
+        // merge the existing and typed function
+        value = typed(math[name], value);
+      }
+
+      math[name] = value;
+      delete importedFactories[name];
+
+      _importTransform(name, value);
+
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+
+    if (math[name] === undefined || options.override) {
+      math[name] = value;
+      delete importedFactories[name];
+
+      _importTransform(name, value);
+
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+
+    if (!options.silent) {
+      throw new Error('Cannot import "' + name + '": already exists');
+    }
+  }
+
+  function _importTransform(name, value) {
+    if (value && typeof value.transform === 'function') {
+      math.expression.transform[name] = value.transform;
+
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value.transform;
+      }
+    } else {
+      // remove existing transform
+      delete math.expression.transform[name];
+
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value;
+      }
+    }
+  }
+
+  function _deleteTransform(name) {
+    delete math.expression.transform[name];
+
+    if (allowedInExpressions(name)) {
+      math.expression.mathWithTransform[name] = math[name];
+    } else {
+      delete math.expression.mathWithTransform[name];
+    }
+  }
+  /**
+   * Create a wrapper a round an function which converts the arguments
+   * to their primitive values (like convert a Matrix to Array)
+   * @param {Function} fn
+   * @return {Function} Returns the wrapped function
+   * @private
+   */
+
+
+  function _wrap(fn) {
+    var wrapper = function wrapper() {
+      var args = [];
+
+      for (var i = 0, len = arguments.length; i < len; i++) {
+        var arg = arguments[i];
+        args[i] = arg && arg.valueOf();
+      }
+
+      return fn.apply(math, args);
+    };
+
+    if (fn.transform) {
+      wrapper.transform = fn.transform;
+    }
+
+    return wrapper;
+  }
+  /**
+   * Import an instance of a factory into math.js
+   * @param {function(scope: object)} factory
+   * @param {Object} options  See import for a description of the options
+   * @param {string} [name=factory.name] Optional custom name
+   * @private
+   */
+
+
+  function _importFactory(factory, options) {
+    var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;
+
+    if ((0, _array.contains)(name, '.')) {
+      throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));
+    }
+
+    var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;
+    var existingTransform = (name in math.expression.transform);
+    var existing = (0, _object.hasOwnProperty)(namespace, name) ? namespace[name] : undefined;
+
+    var resolver = function resolver() {
+      // collect all dependencies, handle finding both functions and classes and other special cases
+      var dependencies = {};
+      factory.dependencies.map(_factory.stripOptionalNotation).forEach(function (dependency) {
+        if ((0, _array.contains)(dependency, '.')) {
+          throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));
+        }
+
+        if (dependency === 'math') {
+          dependencies.math = math;
+        } else if (dependency === 'mathWithTransform') {
+          dependencies.mathWithTransform = math.expression.mathWithTransform;
+        } else if (dependency === 'classes') {
+          // special case for json reviver
+          dependencies.classes = math;
+        } else {
+          dependencies[dependency] = math[dependency];
+        }
+      });
+      var instance = /* #__PURE__ */factory(dependencies);
+
+      if (instance && typeof instance.transform === 'function') {
+        throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with exports.path="expression.transform"');
+      }
+
+      if (existing === undefined || options.override) {
+        return instance;
+      }
+
+      if (isTypedFunction(existing) && isTypedFunction(instance)) {
+        // merge the existing and new typed function
+        return typed(existing, instance);
+      }
+
+      if (options.silent) {
+        // keep existing, ignore imported function
+        return existing;
+      } else {
+        throw new Error('Cannot import "' + name + '": already exists');
+      }
+    }; // TODO: add unit test with non-lazy factory
+
+
+    if (!factory.meta || factory.meta.lazy !== false) {
+      (0, _object.lazy)(namespace, name, resolver); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+      } else {
+        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {
+          (0, _object.lazy)(math.expression.mathWithTransform, name, function () {
+            return namespace[name];
+          });
+        }
+      }
+    } else {
+      namespace[name] = resolver(); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+      } else {
+        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {
+          (0, _object.lazy)(math.expression.mathWithTransform, name, function () {
+            return namespace[name];
+          });
+        }
+      }
+    } // TODO: improve factories, store a list with imports instead which can be re-played
+
+
+    importedFactories[name] = factory;
+    math.emit('import', name, resolver);
+  }
+  /**
+   * Check whether given object is a type which can be imported
+   * @param {Function | number | string | boolean | null | Unit | Complex} object
+   * @return {boolean}
+   * @private
+   */
+
+
+  function isSupportedType(object) {
+    return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || (0, _is.isUnit)(object) || (0, _is.isComplex)(object) || (0, _is.isBigNumber)(object) || (0, _is.isFraction)(object) || (0, _is.isMatrix)(object) || Array.isArray(object);
+  }
+  /**
+   * Test whether a given thing is a typed-function
+   * @param {*} fn
+   * @return {boolean} Returns true when `fn` is a typed-function
+   */
+
+
+  function isTypedFunction(fn) {
+    return typeof fn === 'function' && (0, _typeof2.default)(fn.signatures) === 'object';
+  }
+
+  function hasTypedFunctionSignature(fn) {
+    return typeof fn === 'function' && typeof fn.signature === 'string';
+  }
+
+  function allowedInExpressions(name) {
+    return !(0, _object.hasOwnProperty)(unsafe, name);
+  }
+
+  function factoryAllowedInExpressions(factory) {
+    return factory.fn.indexOf('.') === -1 && // FIXME: make checking on path redundant, check on meta data instead
+    !(0, _object.hasOwnProperty)(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);
+  }
+
+  function isTransformFunctionFactory(factory) {
+    return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;
+  } // namespaces and functions not available in the parser for safety reasons
+
+
+  var unsafe = {
+    expression: true,
+    type: true,
+    docs: true,
+    error: true,
+    json: true,
+    chain: true // chain method not supported. Note that there is a unit chain too.
+
+  };
+  return mathImport;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/function/typed.js b/node_modules/mathjs/lib/cjs/core/function/typed.js
new file mode 100644
index 0000000..54e9b6e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/function/typed.js
@@ -0,0 +1,402 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTyped = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _typedFunction = _interopRequireDefault(require("typed-function"));
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _map = require("../../utils/map.js");
+
+/**
+ * Create a typed-function which checks the types of the arguments and
+ * can match them against multiple provided signatures. The typed-function
+ * automatically converts inputs in order to find a matching signature.
+ * Typed functions throw informative errors in case of wrong input arguments.
+ *
+ * See the library [typed-function](https://github.com/josdejong/typed-function)
+ * for detailed documentation.
+ *
+ * Syntax:
+ *
+ *     math.typed(name, signatures) : function
+ *     math.typed(signatures) : function
+ *
+ * Examples:
+ *
+ *     // create a typed function with multiple types per argument (type union)
+ *     const fn2 = typed({
+ *       'number | boolean': function (b) {
+ *         return 'b is a number or boolean'
+ *       },
+ *       'string, number | boolean': function (a, b) {
+ *         return 'a is a string, b is a number or boolean'
+ *       }
+ *     })
+ *
+ *     // create a typed function with an any type argument
+ *     const log = typed({
+ *       'string, any': function (event, data) {
+ *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))
+ *       }
+ *     })
+ *
+ * @param {string} [name]                          Optional name for the typed-function
+ * @param {Object<string, function>} signatures   Object with one or multiple function signatures
+ * @returns {function} The created typed-function.
+ */
+// returns a new instance of typed-function
+var _createTyped2 = function _createTyped() {
+  // initially, return the original instance of typed-function
+  // consecutively, return a new instance from typed.create.
+  _createTyped2 = _typedFunction.default.create;
+  return _typedFunction.default;
+};
+
+var dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];
+/**
+ * Factory function for creating a new typed instance
+ * @param {Object} dependencies   Object with data types like Complex and BigNumber
+ * @returns {Function}
+ */
+
+var createTyped = /* #__PURE__ */(0, _factory.factory)('typed', dependencies, function createTyped(_ref) {
+  var BigNumber = _ref.BigNumber,
+      Complex = _ref.Complex,
+      DenseMatrix = _ref.DenseMatrix,
+      Fraction = _ref.Fraction;
+
+  // TODO: typed-function must be able to silently ignore signatures with unknown data types
+  // get a new instance of typed-function
+  var typed = _createTyped2(); // define all types. The order of the types determines in which order function
+  // arguments are type-checked (so for performance it's important to put the
+  // most used types first).
+
+
+  typed.types = [{
+    name: 'number',
+    test: _is.isNumber
+  }, {
+    name: 'Complex',
+    test: _is.isComplex
+  }, {
+    name: 'BigNumber',
+    test: _is.isBigNumber
+  }, {
+    name: 'Fraction',
+    test: _is.isFraction
+  }, {
+    name: 'Unit',
+    test: _is.isUnit
+  }, {
+    name: 'string',
+    test: _is.isString
+  }, {
+    name: 'Chain',
+    test: _is.isChain
+  }, {
+    name: 'Array',
+    test: _is.isArray
+  }, {
+    name: 'Matrix',
+    test: _is.isMatrix
+  }, {
+    name: 'DenseMatrix',
+    test: _is.isDenseMatrix
+  }, {
+    name: 'SparseMatrix',
+    test: _is.isSparseMatrix
+  }, {
+    name: 'Range',
+    test: _is.isRange
+  }, {
+    name: 'Index',
+    test: _is.isIndex
+  }, {
+    name: 'boolean',
+    test: _is.isBoolean
+  }, {
+    name: 'ResultSet',
+    test: _is.isResultSet
+  }, {
+    name: 'Help',
+    test: _is.isHelp
+  }, {
+    name: 'function',
+    test: _is.isFunction
+  }, {
+    name: 'Date',
+    test: _is.isDate
+  }, {
+    name: 'RegExp',
+    test: _is.isRegExp
+  }, {
+    name: 'null',
+    test: _is.isNull
+  }, {
+    name: 'undefined',
+    test: _is.isUndefined
+  }, {
+    name: 'AccessorNode',
+    test: _is.isAccessorNode
+  }, {
+    name: 'ArrayNode',
+    test: _is.isArrayNode
+  }, {
+    name: 'AssignmentNode',
+    test: _is.isAssignmentNode
+  }, {
+    name: 'BlockNode',
+    test: _is.isBlockNode
+  }, {
+    name: 'ConditionalNode',
+    test: _is.isConditionalNode
+  }, {
+    name: 'ConstantNode',
+    test: _is.isConstantNode
+  }, {
+    name: 'FunctionNode',
+    test: _is.isFunctionNode
+  }, {
+    name: 'FunctionAssignmentNode',
+    test: _is.isFunctionAssignmentNode
+  }, {
+    name: 'IndexNode',
+    test: _is.isIndexNode
+  }, {
+    name: 'Node',
+    test: _is.isNode
+  }, {
+    name: 'ObjectNode',
+    test: _is.isObjectNode
+  }, {
+    name: 'OperatorNode',
+    test: _is.isOperatorNode
+  }, {
+    name: 'ParenthesisNode',
+    test: _is.isParenthesisNode
+  }, {
+    name: 'RangeNode',
+    test: _is.isRangeNode
+  }, {
+    name: 'SymbolNode',
+    test: _is.isSymbolNode
+  }, {
+    name: 'Map',
+    test: _map.isMap
+  }, {
+    name: 'Object',
+    test: _is.isObject
+  } // order 'Object' last, it matches on other classes too
+  ];
+  typed.conversions = [{
+    from: 'number',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      } // note: conversion from number to BigNumber can fail if x has >15 digits
+
+
+      if ((0, _number.digits)(x) > 15) {
+        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');
+      }
+
+      return new BigNumber(x);
+    }
+  }, {
+    from: 'number',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      return new Complex(x, 0);
+    }
+  }, {
+    from: 'number',
+    to: 'string',
+    convert: function convert(x) {
+      return x + '';
+    }
+  }, {
+    from: 'BigNumber',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      return new Complex(x.toNumber(), 0);
+    }
+  }, {
+    from: 'Fraction',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      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.');
+    }
+  }, {
+    from: 'Fraction',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      return new Complex(x.valueOf(), 0);
+    }
+  }, {
+    from: 'number',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+
+      var f = new Fraction(x);
+
+      if (f.valueOf() !== x) {
+        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.');
+      }
+
+      return f;
+    }
+  }, {
+    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`
+    //  from: 'Fraction',
+    //  to: 'number',
+    //  convert: function (x) {
+    //    return x.valueOf()
+    //  }
+    // }, {
+    from: 'string',
+    to: 'number',
+    convert: function convert(x) {
+      var n = Number(x);
+
+      if (isNaN(n)) {
+        throw new Error('Cannot convert "' + x + '" to a number');
+      }
+
+      return n;
+    }
+  }, {
+    from: 'string',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+
+      try {
+        return new BigNumber(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to BigNumber');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+
+      try {
+        return new Fraction(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Fraction');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      try {
+        return new Complex(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Complex');
+      }
+    }
+  }, {
+    from: 'boolean',
+    to: 'number',
+    convert: function convert(x) {
+      return +x;
+    }
+  }, {
+    from: 'boolean',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+
+      return new BigNumber(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+
+      return new Fraction(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'string',
+    convert: function convert(x) {
+      return String(x);
+    }
+  }, {
+    from: 'Array',
+    to: 'Matrix',
+    convert: function convert(array) {
+      if (!DenseMatrix) {
+        throwNoMatrix();
+      }
+
+      return new DenseMatrix(array);
+    }
+  }, {
+    from: 'Matrix',
+    to: 'Array',
+    convert: function convert(matrix) {
+      return matrix.valueOf();
+    }
+  }];
+  return typed;
+});
+exports.createTyped = createTyped;
+
+function throwNoBignumber(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a BigNumber: no class 'BigNumber' provided"));
+}
+
+function throwNoComplex(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a Complex number: no class 'Complex' provided"));
+}
+
+function throwNoMatrix() {
+  throw new Error('Cannot convert array into a Matrix: no class \'DenseMatrix\' provided');
+}
+
+function throwNoFraction(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a Fraction, no class 'Fraction' provided."));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/defaultInstance.js b/node_modules/mathjs/lib/cjs/defaultInstance.js
new file mode 100644
index 0000000..10b593e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/defaultInstance.js
@@ -0,0 +1,20 @@
+"use strict";
+
+var _typeof = require("@babel/runtime/helpers/typeof");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var all = _interopRequireWildcard(require("./factoriesAny.js"));
+
+var _create = require("./core/create.js");
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+var _default = (0, _create.create)(all);
+
+exports.default = _default;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/allFactoriesAny.js b/node_modules/mathjs/lib/cjs/entry/allFactoriesAny.js
new file mode 100644
index 0000000..d159bb0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/allFactoriesAny.js
@@ -0,0 +1,18 @@
+"use strict";
+
+var _typeof = require("@babel/runtime/helpers/typeof");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.all = void 0;
+
+var allFactories = _interopRequireWildcard(require("../factoriesAny.js"));
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+// creating all factories here in a separate file is needed to get tree-shaking working
+var all = allFactories;
+exports.all = all;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/allFactoriesNumber.js b/node_modules/mathjs/lib/cjs/entry/allFactoriesNumber.js
new file mode 100644
index 0000000..1563134
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/allFactoriesNumber.js
@@ -0,0 +1,18 @@
+"use strict";
+
+var _typeof = require("@babel/runtime/helpers/typeof");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.all = void 0;
+
+var allFactories = _interopRequireWildcard(require("../factoriesNumber.js"));
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+// creating all factories here in a separate file is needed to get tree-shaking working
+var all = allFactories;
+exports.all = all;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/configReadonly.js b/node_modules/mathjs/lib/cjs/entry/configReadonly.js
new file mode 100644
index 0000000..db42238
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/configReadonly.js
@@ -0,0 +1,29 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.config = void 0;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+var _config = require("../core/config.js");
+
+var _config2 = require("../core/function/config.js");
+
+// create a read-only version of config
+var config = /* #__PURE__ */function config(options) {
+  if (options) {
+    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');
+  }
+
+  return Object.freeze(_config.DEFAULT_CONFIG);
+};
+
+exports.config = config;
+(0, _extends2.default)(config, _config.DEFAULT_CONFIG, {
+  MATRIX_OPTIONS: _config2.MATRIX_OPTIONS,
+  NUMBER_OPTIONS: _config2.NUMBER_OPTIONS
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny.generated.js
new file mode 100644
index 0000000..094f0f8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny.generated.js
@@ -0,0 +1,2733 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "AccessorNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAccessorNodeGenerated.AccessorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ArrayNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesArrayNodeGenerated.ArrayNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "AssignmentNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "BigNumberDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBigNumberClassGenerated.BigNumberDependencies;
+  }
+});
+Object.defineProperty(exports, "BlockNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBlockNodeGenerated.BlockNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ChainDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesChainClassGenerated.ChainDependencies;
+  }
+});
+Object.defineProperty(exports, "ComplexDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesComplexClassGenerated.ComplexDependencies;
+  }
+});
+Object.defineProperty(exports, "ConditionalNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ConstantNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConstantNodeGenerated.ConstantNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "DenseMatrixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "EDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUppercaseEGenerated.EDependencies;
+  }
+});
+Object.defineProperty(exports, "FibonacciHeapDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFibonacciHeapClassGenerated.FibonacciHeapDependencies;
+  }
+});
+Object.defineProperty(exports, "FractionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFractionClassGenerated.FractionDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionAssignmentNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFunctionNodeGenerated.FunctionNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "HelpDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHelpClassGenerated.HelpDependencies;
+  }
+});
+Object.defineProperty(exports, "ImmutableDenseMatrixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesImmutableDenseMatrixClassGenerated.ImmutableDenseMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "IndexDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIndexClassGenerated.IndexDependencies;
+  }
+});
+Object.defineProperty(exports, "IndexNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIndexNodeGenerated.IndexNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "InfinityDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesInfinityGenerated.InfinityDependencies;
+  }
+});
+Object.defineProperty(exports, "LN10Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLN10Generated.LN10Dependencies;
+  }
+});
+Object.defineProperty(exports, "LN2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLN2Generated.LN2Dependencies;
+  }
+});
+Object.defineProperty(exports, "LOG10EDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLOG10EGenerated.LOG10EDependencies;
+  }
+});
+Object.defineProperty(exports, "LOG2EDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLOG2EGenerated.LOG2EDependencies;
+  }
+});
+Object.defineProperty(exports, "MatrixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMatrixClassGenerated.MatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "NaNDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNaNGenerated.NaNDependencies;
+  }
+});
+Object.defineProperty(exports, "NodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNodeGenerated.NodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ObjectNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesObjectNodeGenerated.ObjectNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "OperatorNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesOperatorNodeGenerated.OperatorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "PIDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUppercasePiGenerated.PIDependencies;
+  }
+});
+Object.defineProperty(exports, "ParenthesisNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ParserDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParserClassGenerated.ParserDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeClassGenerated.RangeDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeNodeGenerated.RangeNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "RelationalNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRelationalNodeGenerated.RelationalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ResultSetDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesResultSetGenerated.ResultSetDependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT1_2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSQRT1_2Generated.SQRT1_2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSQRT2Generated.SQRT2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SpaDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSpaClassGenerated.SpaDependencies;
+  }
+});
+Object.defineProperty(exports, "SparseMatrixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "SymbolNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSymbolNodeGenerated.SymbolNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "UnitDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnitClassGenerated.UnitDependencies;
+  }
+});
+Object.defineProperty(exports, "absDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAbsGenerated.absDependencies;
+  }
+});
+Object.defineProperty(exports, "acosDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcosGenerated.acosDependencies;
+  }
+});
+Object.defineProperty(exports, "acoshDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcoshGenerated.acoshDependencies;
+  }
+});
+Object.defineProperty(exports, "acotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcotGenerated.acotDependencies;
+  }
+});
+Object.defineProperty(exports, "acothDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcothGenerated.acothDependencies;
+  }
+});
+Object.defineProperty(exports, "acscDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcscGenerated.acscDependencies;
+  }
+});
+Object.defineProperty(exports, "acschDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcschGenerated.acschDependencies;
+  }
+});
+Object.defineProperty(exports, "addDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAddGenerated.addDependencies;
+  }
+});
+Object.defineProperty(exports, "addScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAddScalarGenerated.addScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "all", {
+  enumerable: true,
+  get: function get() {
+    return _allFactoriesAny.all;
+  }
+});
+Object.defineProperty(exports, "andDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAndGenerated.andDependencies;
+  }
+});
+Object.defineProperty(exports, "applyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesApplyGenerated.applyDependencies;
+  }
+});
+Object.defineProperty(exports, "applyTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesApplyTransformGenerated.applyTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "argDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesArgGenerated.argDependencies;
+  }
+});
+Object.defineProperty(exports, "asecDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsecGenerated.asecDependencies;
+  }
+});
+Object.defineProperty(exports, "asechDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsechGenerated.asechDependencies;
+  }
+});
+Object.defineProperty(exports, "asinDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsinGenerated.asinDependencies;
+  }
+});
+Object.defineProperty(exports, "asinhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsinhGenerated.asinhDependencies;
+  }
+});
+Object.defineProperty(exports, "atan2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAtan2Generated.atan2Dependencies;
+  }
+});
+Object.defineProperty(exports, "atanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAtanGenerated.atanDependencies;
+  }
+});
+Object.defineProperty(exports, "atanhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAtanhGenerated.atanhDependencies;
+  }
+});
+Object.defineProperty(exports, "atomicMassDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAtomicMassGenerated.atomicMassDependencies;
+  }
+});
+Object.defineProperty(exports, "avogadroDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAvogadroGenerated.avogadroDependencies;
+  }
+});
+Object.defineProperty(exports, "bellNumbersDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBellNumbersGenerated.bellNumbersDependencies;
+  }
+});
+Object.defineProperty(exports, "bignumberDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBignumberGenerated.bignumberDependencies;
+  }
+});
+Object.defineProperty(exports, "binDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBinGenerated.binDependencies;
+  }
+});
+Object.defineProperty(exports, "bitAndDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitAndGenerated.bitAndDependencies;
+  }
+});
+Object.defineProperty(exports, "bitNotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitNotGenerated.bitNotDependencies;
+  }
+});
+Object.defineProperty(exports, "bitOrDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitOrGenerated.bitOrDependencies;
+  }
+});
+Object.defineProperty(exports, "bitXorDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitXorGenerated.bitXorDependencies;
+  }
+});
+Object.defineProperty(exports, "bohrMagnetonDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBohrMagnetonGenerated.bohrMagnetonDependencies;
+  }
+});
+Object.defineProperty(exports, "bohrRadiusDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBohrRadiusGenerated.bohrRadiusDependencies;
+  }
+});
+Object.defineProperty(exports, "boltzmannDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBoltzmannGenerated.boltzmannDependencies;
+  }
+});
+Object.defineProperty(exports, "booleanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBooleanGenerated.booleanDependencies;
+  }
+});
+Object.defineProperty(exports, "catalanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCatalanGenerated.catalanDependencies;
+  }
+});
+Object.defineProperty(exports, "cbrtDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCbrtGenerated.cbrtDependencies;
+  }
+});
+Object.defineProperty(exports, "ceilDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCeilGenerated.ceilDependencies;
+  }
+});
+Object.defineProperty(exports, "chainDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesChainGenerated.chainDependencies;
+  }
+});
+Object.defineProperty(exports, "classicalElectronRadiusDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesClassicalElectronRadiusGenerated.classicalElectronRadiusDependencies;
+  }
+});
+Object.defineProperty(exports, "cloneDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCloneGenerated.cloneDependencies;
+  }
+});
+Object.defineProperty(exports, "columnDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesColumnGenerated.columnDependencies;
+  }
+});
+Object.defineProperty(exports, "columnTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesColumnTransformGenerated.columnTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCombinationsGenerated.combinationsDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsWithRepDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCombinationsWithRepGenerated.combinationsWithRepDependencies;
+  }
+});
+Object.defineProperty(exports, "compareDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompareGenerated.compareDependencies;
+  }
+});
+Object.defineProperty(exports, "compareNaturalDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompareNaturalGenerated.compareNaturalDependencies;
+  }
+});
+Object.defineProperty(exports, "compareTextDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompareTextGenerated.compareTextDependencies;
+  }
+});
+Object.defineProperty(exports, "compileDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompileGenerated.compileDependencies;
+  }
+});
+Object.defineProperty(exports, "complexDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesComplexGenerated.complexDependencies;
+  }
+});
+Object.defineProperty(exports, "compositionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompositionGenerated.compositionDependencies;
+  }
+});
+Object.defineProperty(exports, "concatDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConcatGenerated.concatDependencies;
+  }
+});
+Object.defineProperty(exports, "concatTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConcatTransformGenerated.concatTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "conductanceQuantumDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConductanceQuantumGenerated.conductanceQuantumDependencies;
+  }
+});
+Object.defineProperty(exports, "conjDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConjGenerated.conjDependencies;
+  }
+});
+Object.defineProperty(exports, "cosDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCosGenerated.cosDependencies;
+  }
+});
+Object.defineProperty(exports, "coshDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCoshGenerated.coshDependencies;
+  }
+});
+Object.defineProperty(exports, "cotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCotGenerated.cotDependencies;
+  }
+});
+Object.defineProperty(exports, "cothDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCothGenerated.cothDependencies;
+  }
+});
+Object.defineProperty(exports, "coulombDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCoulombGenerated.coulombDependencies;
+  }
+});
+Object.defineProperty(exports, "countDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCountGenerated.countDependencies;
+  }
+});
+Object.defineProperty(exports, "createUnitDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCreateUnitGenerated.createUnitDependencies;
+  }
+});
+Object.defineProperty(exports, "crossDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCrossGenerated.crossDependencies;
+  }
+});
+Object.defineProperty(exports, "cscDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCscGenerated.cscDependencies;
+  }
+});
+Object.defineProperty(exports, "cschDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCschGenerated.cschDependencies;
+  }
+});
+Object.defineProperty(exports, "ctransposeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCtransposeGenerated.ctransposeDependencies;
+  }
+});
+Object.defineProperty(exports, "cubeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCubeGenerated.cubeDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCumSumGenerated.cumsumDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCumSumTransformGenerated.cumsumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "deepEqualDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDeepEqualGenerated.deepEqualDependencies;
+  }
+});
+Object.defineProperty(exports, "derivativeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDerivativeGenerated.derivativeDependencies;
+  }
+});
+Object.defineProperty(exports, "detDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDetGenerated.detDependencies;
+  }
+});
+Object.defineProperty(exports, "deuteronMassDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDeuteronMassGenerated.deuteronMassDependencies;
+  }
+});
+Object.defineProperty(exports, "diagDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDiagGenerated.diagDependencies;
+  }
+});
+Object.defineProperty(exports, "diffDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDiffGenerated.diffDependencies;
+  }
+});
+Object.defineProperty(exports, "diffTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDiffTransformGenerated.diffTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "distanceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDistanceGenerated.distanceDependencies;
+  }
+});
+Object.defineProperty(exports, "divideDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDivideGenerated.divideDependencies;
+  }
+});
+Object.defineProperty(exports, "divideScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDivideScalarGenerated.divideScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "dotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDotGenerated.dotDependencies;
+  }
+});
+Object.defineProperty(exports, "dotDivideDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDotDivideGenerated.dotDivideDependencies;
+  }
+});
+Object.defineProperty(exports, "dotMultiplyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDotMultiplyGenerated.dotMultiplyDependencies;
+  }
+});
+Object.defineProperty(exports, "dotPowDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDotPowGenerated.dotPowDependencies;
+  }
+});
+Object.defineProperty(exports, "eDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEGenerated.eDependencies;
+  }
+});
+Object.defineProperty(exports, "efimovFactorDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEfimovFactorGenerated.efimovFactorDependencies;
+  }
+});
+Object.defineProperty(exports, "eigsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEigsGenerated.eigsDependencies;
+  }
+});
+Object.defineProperty(exports, "electricConstantDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesElectricConstantGenerated.electricConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "electronMassDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesElectronMassGenerated.electronMassDependencies;
+  }
+});
+Object.defineProperty(exports, "elementaryChargeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesElementaryChargeGenerated.elementaryChargeDependencies;
+  }
+});
+Object.defineProperty(exports, "equalDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEqualGenerated.equalDependencies;
+  }
+});
+Object.defineProperty(exports, "equalScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEqualScalarGenerated.equalScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "equalTextDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEqualTextGenerated.equalTextDependencies;
+  }
+});
+Object.defineProperty(exports, "erfDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesErfGenerated.erfDependencies;
+  }
+});
+Object.defineProperty(exports, "evaluateDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEvaluateGenerated.evaluateDependencies;
+  }
+});
+Object.defineProperty(exports, "expDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesExpGenerated.expDependencies;
+  }
+});
+Object.defineProperty(exports, "expm1Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesExpm1Generated.expm1Dependencies;
+  }
+});
+Object.defineProperty(exports, "expmDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesExpmGenerated.expmDependencies;
+  }
+});
+Object.defineProperty(exports, "factorialDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFactorialGenerated.factorialDependencies;
+  }
+});
+Object.defineProperty(exports, "falseDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFalseGenerated.falseDependencies;
+  }
+});
+Object.defineProperty(exports, "faradayDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFaradayGenerated.faradayDependencies;
+  }
+});
+Object.defineProperty(exports, "fermiCouplingDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFermiCouplingGenerated.fermiCouplingDependencies;
+  }
+});
+Object.defineProperty(exports, "filterDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFilterGenerated.filterDependencies;
+  }
+});
+Object.defineProperty(exports, "filterTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFilterTransformGenerated.filterTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "fineStructureDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFineStructureGenerated.fineStructureDependencies;
+  }
+});
+Object.defineProperty(exports, "firstRadiationDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFirstRadiationGenerated.firstRadiationDependencies;
+  }
+});
+Object.defineProperty(exports, "fixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFixGenerated.fixDependencies;
+  }
+});
+Object.defineProperty(exports, "flattenDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFlattenGenerated.flattenDependencies;
+  }
+});
+Object.defineProperty(exports, "floorDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFloorGenerated.floorDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesForEachGenerated.forEachDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesForEachTransformGenerated.forEachTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "formatDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFormatGenerated.formatDependencies;
+  }
+});
+Object.defineProperty(exports, "fractionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFractionGenerated.fractionDependencies;
+  }
+});
+Object.defineProperty(exports, "gammaDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGammaGenerated.gammaDependencies;
+  }
+});
+Object.defineProperty(exports, "gasConstantDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGasConstantGenerated.gasConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "gcdDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGcdGenerated.gcdDependencies;
+  }
+});
+Object.defineProperty(exports, "getMatrixDataTypeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGetMatrixDataTypeGenerated.getMatrixDataTypeDependencies;
+  }
+});
+Object.defineProperty(exports, "gravitationConstantDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGravitationConstantGenerated.gravitationConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "gravityDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGravityGenerated.gravityDependencies;
+  }
+});
+Object.defineProperty(exports, "hartreeEnergyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHartreeEnergyGenerated.hartreeEnergyDependencies;
+  }
+});
+Object.defineProperty(exports, "hasNumericValueDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHasNumericValueGenerated.hasNumericValueDependencies;
+  }
+});
+Object.defineProperty(exports, "helpDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHelpGenerated.helpDependencies;
+  }
+});
+Object.defineProperty(exports, "hexDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHexGenerated.hexDependencies;
+  }
+});
+Object.defineProperty(exports, "hypotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHypotGenerated.hypotDependencies;
+  }
+});
+Object.defineProperty(exports, "iDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIGenerated.iDependencies;
+  }
+});
+Object.defineProperty(exports, "identityDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIdentityGenerated.identityDependencies;
+  }
+});
+Object.defineProperty(exports, "imDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesImGenerated.imDependencies;
+  }
+});
+Object.defineProperty(exports, "indexDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIndexGenerated.indexDependencies;
+  }
+});
+Object.defineProperty(exports, "indexTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIndexTransformGenerated.indexTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "intersectDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIntersectGenerated.intersectDependencies;
+  }
+});
+Object.defineProperty(exports, "invDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesInvGenerated.invDependencies;
+  }
+});
+Object.defineProperty(exports, "inverseConductanceQuantumDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesInverseConductanceQuantumGenerated.inverseConductanceQuantumDependencies;
+  }
+});
+Object.defineProperty(exports, "invmodDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesInvmodGenerated.invmodDependencies;
+  }
+});
+Object.defineProperty(exports, "isIntegerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsIntegerGenerated.isIntegerDependencies;
+  }
+});
+Object.defineProperty(exports, "isNaNDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsNaNGenerated.isNaNDependencies;
+  }
+});
+Object.defineProperty(exports, "isNegativeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsNegativeGenerated.isNegativeDependencies;
+  }
+});
+Object.defineProperty(exports, "isNumericDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsNumericGenerated.isNumericDependencies;
+  }
+});
+Object.defineProperty(exports, "isPositiveDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsPositiveGenerated.isPositiveDependencies;
+  }
+});
+Object.defineProperty(exports, "isPrimeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsPrimeGenerated.isPrimeDependencies;
+  }
+});
+Object.defineProperty(exports, "isZeroDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsZeroGenerated.isZeroDependencies;
+  }
+});
+Object.defineProperty(exports, "kldivergenceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesKldivergenceGenerated.kldivergenceDependencies;
+  }
+});
+Object.defineProperty(exports, "klitzingDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesKlitzingGenerated.klitzingDependencies;
+  }
+});
+Object.defineProperty(exports, "kronDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesKronGenerated.kronDependencies;
+  }
+});
+Object.defineProperty(exports, "largerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLargerGenerated.largerDependencies;
+  }
+});
+Object.defineProperty(exports, "largerEqDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLargerEqGenerated.largerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "lcmDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLcmGenerated.lcmDependencies;
+  }
+});
+Object.defineProperty(exports, "leafCountDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLeafCountGenerated.leafCountDependencies;
+  }
+});
+Object.defineProperty(exports, "leftShiftDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLeftShiftGenerated.leftShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "log10Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLog10Generated.log10Dependencies;
+  }
+});
+Object.defineProperty(exports, "log1pDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLog1pGenerated.log1pDependencies;
+  }
+});
+Object.defineProperty(exports, "log2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLog2Generated.log2Dependencies;
+  }
+});
+Object.defineProperty(exports, "logDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLogGenerated.logDependencies;
+  }
+});
+Object.defineProperty(exports, "loschmidtDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLoschmidtGenerated.loschmidtDependencies;
+  }
+});
+Object.defineProperty(exports, "lsolveAllDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLsolveAllGenerated.lsolveAllDependencies;
+  }
+});
+Object.defineProperty(exports, "lsolveDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLsolveGenerated.lsolveDependencies;
+  }
+});
+Object.defineProperty(exports, "lupDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLupGenerated.lupDependencies;
+  }
+});
+Object.defineProperty(exports, "lusolveDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLusolveGenerated.lusolveDependencies;
+  }
+});
+Object.defineProperty(exports, "madDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMadGenerated.madDependencies;
+  }
+});
+Object.defineProperty(exports, "magneticConstantDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMagneticConstantGenerated.magneticConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "magneticFluxQuantumDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMagneticFluxQuantumGenerated.magneticFluxQuantumDependencies;
+  }
+});
+Object.defineProperty(exports, "mapDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMapGenerated.mapDependencies;
+  }
+});
+Object.defineProperty(exports, "mapTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMapTransformGenerated.mapTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMatrixGenerated.matrixDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixFromColumnsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixFromFunctionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMatrixFromFunctionGenerated.matrixFromFunctionDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixFromRowsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMatrixFromRowsGenerated.matrixFromRowsDependencies;
+  }
+});
+Object.defineProperty(exports, "maxDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMaxGenerated.maxDependencies;
+  }
+});
+Object.defineProperty(exports, "maxTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMaxTransformGenerated.maxTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "meanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMeanGenerated.meanDependencies;
+  }
+});
+Object.defineProperty(exports, "meanTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMeanTransformGenerated.meanTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "medianDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMedianGenerated.medianDependencies;
+  }
+});
+Object.defineProperty(exports, "minDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMinGenerated.minDependencies;
+  }
+});
+Object.defineProperty(exports, "minTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMinTransformGenerated.minTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "modDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesModGenerated.modDependencies;
+  }
+});
+Object.defineProperty(exports, "modeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesModeGenerated.modeDependencies;
+  }
+});
+Object.defineProperty(exports, "molarMassC12Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMolarMassC12Generated.molarMassC12Dependencies;
+  }
+});
+Object.defineProperty(exports, "molarMassDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMolarMassGenerated.molarMassDependencies;
+  }
+});
+Object.defineProperty(exports, "molarPlanckConstantDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMolarPlanckConstantGenerated.molarPlanckConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "molarVolumeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMolarVolumeGenerated.molarVolumeDependencies;
+  }
+});
+Object.defineProperty(exports, "multinomialDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMultinomialGenerated.multinomialDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMultiplyGenerated.multiplyDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "neutronMassDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNeutronMassGenerated.neutronMassDependencies;
+  }
+});
+Object.defineProperty(exports, "normDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNormGenerated.normDependencies;
+  }
+});
+Object.defineProperty(exports, "notDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNotGenerated.notDependencies;
+  }
+});
+Object.defineProperty(exports, "nthRootDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNthRootGenerated.nthRootDependencies;
+  }
+});
+Object.defineProperty(exports, "nthRootsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNthRootsGenerated.nthRootsDependencies;
+  }
+});
+Object.defineProperty(exports, "nuclearMagnetonDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNuclearMagnetonGenerated.nuclearMagnetonDependencies;
+  }
+});
+Object.defineProperty(exports, "nullDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNullGenerated.nullDependencies;
+  }
+});
+Object.defineProperty(exports, "numberDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNumberGenerated.numberDependencies;
+  }
+});
+Object.defineProperty(exports, "numericDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNumericGenerated.numericDependencies;
+  }
+});
+Object.defineProperty(exports, "octDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesOctGenerated.octDependencies;
+  }
+});
+Object.defineProperty(exports, "onesDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesOnesGenerated.onesDependencies;
+  }
+});
+Object.defineProperty(exports, "orDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesOrGenerated.orDependencies;
+  }
+});
+Object.defineProperty(exports, "parseDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParseGenerated.parseDependencies;
+  }
+});
+Object.defineProperty(exports, "parserDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParserGenerated.parserDependencies;
+  }
+});
+Object.defineProperty(exports, "partitionSelectDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPartitionSelectGenerated.partitionSelectDependencies;
+  }
+});
+Object.defineProperty(exports, "permutationsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPermutationsGenerated.permutationsDependencies;
+  }
+});
+Object.defineProperty(exports, "phiDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPhiGenerated.phiDependencies;
+  }
+});
+Object.defineProperty(exports, "piDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPiGenerated.piDependencies;
+  }
+});
+Object.defineProperty(exports, "pickRandomDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPickRandomGenerated.pickRandomDependencies;
+  }
+});
+Object.defineProperty(exports, "planckChargeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPlanckChargeGenerated.planckChargeDependencies;
+  }
+});
+Object.defineProperty(exports, "planckConstantDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPlanckConstantGenerated.planckConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "planckLengthDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPlanckLengthGenerated.planckLengthDependencies;
+  }
+});
+Object.defineProperty(exports, "planckMassDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPlanckMassGenerated.planckMassDependencies;
+  }
+});
+Object.defineProperty(exports, "planckTemperatureDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPlanckTemperatureGenerated.planckTemperatureDependencies;
+  }
+});
+Object.defineProperty(exports, "planckTimeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPlanckTimeGenerated.planckTimeDependencies;
+  }
+});
+Object.defineProperty(exports, "powDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPowGenerated.powDependencies;
+  }
+});
+Object.defineProperty(exports, "printDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPrintGenerated.printDependencies;
+  }
+});
+Object.defineProperty(exports, "prodDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesProdGenerated.prodDependencies;
+  }
+});
+Object.defineProperty(exports, "protonMassDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesProtonMassGenerated.protonMassDependencies;
+  }
+});
+Object.defineProperty(exports, "qrDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesQrGenerated.qrDependencies;
+  }
+});
+Object.defineProperty(exports, "quantileSeqDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesQuantileSeqGenerated.quantileSeqDependencies;
+  }
+});
+Object.defineProperty(exports, "quantumOfCirculationDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesQuantumOfCirculationGenerated.quantumOfCirculationDependencies;
+  }
+});
+Object.defineProperty(exports, "randomDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRandomGenerated.randomDependencies;
+  }
+});
+Object.defineProperty(exports, "randomIntDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRandomIntGenerated.randomIntDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeGenerated.rangeDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeTransformGenerated.rangeTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "rationalizeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRationalizeGenerated.rationalizeDependencies;
+  }
+});
+Object.defineProperty(exports, "reDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesReGenerated.reDependencies;
+  }
+});
+Object.defineProperty(exports, "reducedPlanckConstantDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesReducedPlanckConstantGenerated.reducedPlanckConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "replacerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesReplacerGenerated.replacerDependencies;
+  }
+});
+Object.defineProperty(exports, "reshapeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesReshapeGenerated.reshapeDependencies;
+  }
+});
+Object.defineProperty(exports, "resizeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesResizeGenerated.resizeDependencies;
+  }
+});
+Object.defineProperty(exports, "resolveDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesResolveGenerated.resolveDependencies;
+  }
+});
+Object.defineProperty(exports, "reviverDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesReviverGenerated.reviverDependencies;
+  }
+});
+Object.defineProperty(exports, "rightArithShiftDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRightArithShiftGenerated.rightArithShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "rightLogShiftDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRightLogShiftGenerated.rightLogShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "rotateDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRotateGenerated.rotateDependencies;
+  }
+});
+Object.defineProperty(exports, "rotationMatrixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRotationMatrixGenerated.rotationMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "roundDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRoundGenerated.roundDependencies;
+  }
+});
+Object.defineProperty(exports, "rowDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRowGenerated.rowDependencies;
+  }
+});
+Object.defineProperty(exports, "rowTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRowTransformGenerated.rowTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "rydbergDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRydbergGenerated.rydbergDependencies;
+  }
+});
+Object.defineProperty(exports, "sackurTetrodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSackurTetrodeGenerated.sackurTetrodeDependencies;
+  }
+});
+Object.defineProperty(exports, "secDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSecGenerated.secDependencies;
+  }
+});
+Object.defineProperty(exports, "sechDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSechGenerated.sechDependencies;
+  }
+});
+Object.defineProperty(exports, "secondRadiationDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSecondRadiationGenerated.secondRadiationDependencies;
+  }
+});
+Object.defineProperty(exports, "setCartesianDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetCartesianGenerated.setCartesianDependencies;
+  }
+});
+Object.defineProperty(exports, "setDifferenceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetDifferenceGenerated.setDifferenceDependencies;
+  }
+});
+Object.defineProperty(exports, "setDistinctDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetDistinctGenerated.setDistinctDependencies;
+  }
+});
+Object.defineProperty(exports, "setIntersectDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetIntersectGenerated.setIntersectDependencies;
+  }
+});
+Object.defineProperty(exports, "setIsSubsetDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetIsSubsetGenerated.setIsSubsetDependencies;
+  }
+});
+Object.defineProperty(exports, "setMultiplicityDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetMultiplicityGenerated.setMultiplicityDependencies;
+  }
+});
+Object.defineProperty(exports, "setPowersetDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetPowersetGenerated.setPowersetDependencies;
+  }
+});
+Object.defineProperty(exports, "setSizeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetSizeGenerated.setSizeDependencies;
+  }
+});
+Object.defineProperty(exports, "setSymDifferenceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetSymDifferenceGenerated.setSymDifferenceDependencies;
+  }
+});
+Object.defineProperty(exports, "setUnionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSetUnionGenerated.setUnionDependencies;
+  }
+});
+Object.defineProperty(exports, "signDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSignGenerated.signDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyCoreDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSimplifyGenerated.simplifyDependencies;
+  }
+});
+Object.defineProperty(exports, "sinDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSinGenerated.sinDependencies;
+  }
+});
+Object.defineProperty(exports, "sinhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSinhGenerated.sinhDependencies;
+  }
+});
+Object.defineProperty(exports, "sizeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSizeGenerated.sizeDependencies;
+  }
+});
+Object.defineProperty(exports, "sluDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSluGenerated.sluDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSmallerGenerated.smallerDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerEqDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSmallerEqGenerated.smallerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "sortDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSortGenerated.sortDependencies;
+  }
+});
+Object.defineProperty(exports, "sparseDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSparseGenerated.sparseDependencies;
+  }
+});
+Object.defineProperty(exports, "speedOfLightDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSpeedOfLightGenerated.speedOfLightDependencies;
+  }
+});
+Object.defineProperty(exports, "splitUnitDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSplitUnitGenerated.splitUnitDependencies;
+  }
+});
+Object.defineProperty(exports, "sqrtDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSqrtGenerated.sqrtDependencies;
+  }
+});
+Object.defineProperty(exports, "sqrtmDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSqrtmGenerated.sqrtmDependencies;
+  }
+});
+Object.defineProperty(exports, "squareDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSquareGenerated.squareDependencies;
+  }
+});
+Object.defineProperty(exports, "squeezeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSqueezeGenerated.squeezeDependencies;
+  }
+});
+Object.defineProperty(exports, "stdDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStdGenerated.stdDependencies;
+  }
+});
+Object.defineProperty(exports, "stdTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStdTransformGenerated.stdTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "stefanBoltzmannDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStefanBoltzmannGenerated.stefanBoltzmannDependencies;
+  }
+});
+Object.defineProperty(exports, "stirlingS2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStirlingS2Generated.stirlingS2Dependencies;
+  }
+});
+Object.defineProperty(exports, "stringDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStringGenerated.stringDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSubsetGenerated.subsetDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSubsetTransformGenerated.subsetTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "subtractDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSubtractGenerated.subtractDependencies;
+  }
+});
+Object.defineProperty(exports, "sumDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSumGenerated.sumDependencies;
+  }
+});
+Object.defineProperty(exports, "sumTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSumTransformGenerated.sumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "symbolicEqualDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSymbolicEqualGenerated.symbolicEqualDependencies;
+  }
+});
+Object.defineProperty(exports, "tanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTanGenerated.tanDependencies;
+  }
+});
+Object.defineProperty(exports, "tanhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTanhGenerated.tanhDependencies;
+  }
+});
+Object.defineProperty(exports, "tauDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTauGenerated.tauDependencies;
+  }
+});
+Object.defineProperty(exports, "thomsonCrossSectionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesThomsonCrossSectionGenerated.thomsonCrossSectionDependencies;
+  }
+});
+Object.defineProperty(exports, "toDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesToGenerated.toDependencies;
+  }
+});
+Object.defineProperty(exports, "traceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTraceGenerated.traceDependencies;
+  }
+});
+Object.defineProperty(exports, "transposeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTransposeGenerated.transposeDependencies;
+  }
+});
+Object.defineProperty(exports, "trueDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTrueGenerated.trueDependencies;
+  }
+});
+Object.defineProperty(exports, "typeOfDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTypeOfGenerated.typeOfDependencies;
+  }
+});
+Object.defineProperty(exports, "typedDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTypedGenerated.typedDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryMinusDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnaryMinusGenerated.unaryMinusDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryPlusDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnaryPlusGenerated.unaryPlusDependencies;
+  }
+});
+Object.defineProperty(exports, "unequalDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnequalGenerated.unequalDependencies;
+  }
+});
+Object.defineProperty(exports, "unitDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnitFunctionGenerated.unitDependencies;
+  }
+});
+Object.defineProperty(exports, "usolveAllDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUsolveAllGenerated.usolveAllDependencies;
+  }
+});
+Object.defineProperty(exports, "usolveDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUsolveGenerated.usolveDependencies;
+  }
+});
+Object.defineProperty(exports, "vacuumImpedanceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesVacuumImpedanceGenerated.vacuumImpedanceDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesVarianceGenerated.varianceDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesVarianceTransformGenerated.varianceTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "versionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesVersionGenerated.versionDependencies;
+  }
+});
+Object.defineProperty(exports, "weakMixingAngleDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesWeakMixingAngleGenerated.weakMixingAngleDependencies;
+  }
+});
+Object.defineProperty(exports, "wienDisplacementDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesWienDisplacementGenerated.wienDisplacementDependencies;
+  }
+});
+Object.defineProperty(exports, "xgcdDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesXgcdGenerated.xgcdDependencies;
+  }
+});
+Object.defineProperty(exports, "xorDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesXorGenerated.xorDependencies;
+  }
+});
+Object.defineProperty(exports, "zerosDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesZerosGenerated.zerosDependencies;
+  }
+});
+
+var _dependenciesAbsGenerated = require("./dependenciesAny/dependenciesAbs.generated.js");
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAny/dependenciesAccessorNode.generated.js");
+
+var _dependenciesAcosGenerated = require("./dependenciesAny/dependenciesAcos.generated.js");
+
+var _dependenciesAcoshGenerated = require("./dependenciesAny/dependenciesAcosh.generated.js");
+
+var _dependenciesAcotGenerated = require("./dependenciesAny/dependenciesAcot.generated.js");
+
+var _dependenciesAcothGenerated = require("./dependenciesAny/dependenciesAcoth.generated.js");
+
+var _dependenciesAcscGenerated = require("./dependenciesAny/dependenciesAcsc.generated.js");
+
+var _dependenciesAcschGenerated = require("./dependenciesAny/dependenciesAcsch.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAny/dependenciesAdd.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAny/dependenciesAddScalar.generated.js");
+
+var _dependenciesAndGenerated = require("./dependenciesAny/dependenciesAnd.generated.js");
+
+var _dependenciesApplyGenerated = require("./dependenciesAny/dependenciesApply.generated.js");
+
+var _dependenciesApplyTransformGenerated = require("./dependenciesAny/dependenciesApplyTransform.generated.js");
+
+var _dependenciesArgGenerated = require("./dependenciesAny/dependenciesArg.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesAny/dependenciesArrayNode.generated.js");
+
+var _dependenciesAsecGenerated = require("./dependenciesAny/dependenciesAsec.generated.js");
+
+var _dependenciesAsechGenerated = require("./dependenciesAny/dependenciesAsech.generated.js");
+
+var _dependenciesAsinGenerated = require("./dependenciesAny/dependenciesAsin.generated.js");
+
+var _dependenciesAsinhGenerated = require("./dependenciesAny/dependenciesAsinh.generated.js");
+
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesAny/dependenciesAssignmentNode.generated.js");
+
+var _dependenciesAtanGenerated = require("./dependenciesAny/dependenciesAtan.generated.js");
+
+var _dependenciesAtan2Generated = require("./dependenciesAny/dependenciesAtan2.generated.js");
+
+var _dependenciesAtanhGenerated = require("./dependenciesAny/dependenciesAtanh.generated.js");
+
+var _dependenciesAtomicMassGenerated = require("./dependenciesAny/dependenciesAtomicMass.generated.js");
+
+var _dependenciesAvogadroGenerated = require("./dependenciesAny/dependenciesAvogadro.generated.js");
+
+var _dependenciesBellNumbersGenerated = require("./dependenciesAny/dependenciesBellNumbers.generated.js");
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesAny/dependenciesBigNumberClass.generated.js");
+
+var _dependenciesBignumberGenerated = require("./dependenciesAny/dependenciesBignumber.generated.js");
+
+var _dependenciesBinGenerated = require("./dependenciesAny/dependenciesBin.generated.js");
+
+var _dependenciesBitAndGenerated = require("./dependenciesAny/dependenciesBitAnd.generated.js");
+
+var _dependenciesBitNotGenerated = require("./dependenciesAny/dependenciesBitNot.generated.js");
+
+var _dependenciesBitOrGenerated = require("./dependenciesAny/dependenciesBitOr.generated.js");
+
+var _dependenciesBitXorGenerated = require("./dependenciesAny/dependenciesBitXor.generated.js");
+
+var _dependenciesBlockNodeGenerated = require("./dependenciesAny/dependenciesBlockNode.generated.js");
+
+var _dependenciesBohrMagnetonGenerated = require("./dependenciesAny/dependenciesBohrMagneton.generated.js");
+
+var _dependenciesBohrRadiusGenerated = require("./dependenciesAny/dependenciesBohrRadius.generated.js");
+
+var _dependenciesBoltzmannGenerated = require("./dependenciesAny/dependenciesBoltzmann.generated.js");
+
+var _dependenciesBooleanGenerated = require("./dependenciesAny/dependenciesBoolean.generated.js");
+
+var _dependenciesCatalanGenerated = require("./dependenciesAny/dependenciesCatalan.generated.js");
+
+var _dependenciesCbrtGenerated = require("./dependenciesAny/dependenciesCbrt.generated.js");
+
+var _dependenciesCeilGenerated = require("./dependenciesAny/dependenciesCeil.generated.js");
+
+var _dependenciesChainGenerated = require("./dependenciesAny/dependenciesChain.generated.js");
+
+var _dependenciesChainClassGenerated = require("./dependenciesAny/dependenciesChainClass.generated.js");
+
+var _dependenciesClassicalElectronRadiusGenerated = require("./dependenciesAny/dependenciesClassicalElectronRadius.generated.js");
+
+var _dependenciesCloneGenerated = require("./dependenciesAny/dependenciesClone.generated.js");
+
+var _dependenciesColumnGenerated = require("./dependenciesAny/dependenciesColumn.generated.js");
+
+var _dependenciesColumnTransformGenerated = require("./dependenciesAny/dependenciesColumnTransform.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesAny/dependenciesCombinations.generated.js");
+
+var _dependenciesCombinationsWithRepGenerated = require("./dependenciesAny/dependenciesCombinationsWithRep.generated.js");
+
+var _dependenciesCompareGenerated = require("./dependenciesAny/dependenciesCompare.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesAny/dependenciesCompareNatural.generated.js");
+
+var _dependenciesCompareTextGenerated = require("./dependenciesAny/dependenciesCompareText.generated.js");
+
+var _dependenciesCompileGenerated = require("./dependenciesAny/dependenciesCompile.generated.js");
+
+var _dependenciesComplexGenerated = require("./dependenciesAny/dependenciesComplex.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesAny/dependenciesComplexClass.generated.js");
+
+var _dependenciesCompositionGenerated = require("./dependenciesAny/dependenciesComposition.generated.js");
+
+var _dependenciesConcatGenerated = require("./dependenciesAny/dependenciesConcat.generated.js");
+
+var _dependenciesConcatTransformGenerated = require("./dependenciesAny/dependenciesConcatTransform.generated.js");
+
+var _dependenciesConditionalNodeGenerated = require("./dependenciesAny/dependenciesConditionalNode.generated.js");
+
+var _dependenciesConductanceQuantumGenerated = require("./dependenciesAny/dependenciesConductanceQuantum.generated.js");
+
+var _dependenciesConjGenerated = require("./dependenciesAny/dependenciesConj.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesAny/dependenciesConstantNode.generated.js");
+
+var _dependenciesCosGenerated = require("./dependenciesAny/dependenciesCos.generated.js");
+
+var _dependenciesCoshGenerated = require("./dependenciesAny/dependenciesCosh.generated.js");
+
+var _dependenciesCotGenerated = require("./dependenciesAny/dependenciesCot.generated.js");
+
+var _dependenciesCothGenerated = require("./dependenciesAny/dependenciesCoth.generated.js");
+
+var _dependenciesCoulombGenerated = require("./dependenciesAny/dependenciesCoulomb.generated.js");
+
+var _dependenciesCountGenerated = require("./dependenciesAny/dependenciesCount.generated.js");
+
+var _dependenciesCreateUnitGenerated = require("./dependenciesAny/dependenciesCreateUnit.generated.js");
+
+var _dependenciesCrossGenerated = require("./dependenciesAny/dependenciesCross.generated.js");
+
+var _dependenciesCscGenerated = require("./dependenciesAny/dependenciesCsc.generated.js");
+
+var _dependenciesCschGenerated = require("./dependenciesAny/dependenciesCsch.generated.js");
+
+var _dependenciesCtransposeGenerated = require("./dependenciesAny/dependenciesCtranspose.generated.js");
+
+var _dependenciesCubeGenerated = require("./dependenciesAny/dependenciesCube.generated.js");
+
+var _dependenciesCumSumGenerated = require("./dependenciesAny/dependenciesCumSum.generated.js");
+
+var _dependenciesCumSumTransformGenerated = require("./dependenciesAny/dependenciesCumSumTransform.generated.js");
+
+var _dependenciesDeepEqualGenerated = require("./dependenciesAny/dependenciesDeepEqual.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesAny/dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesDerivativeGenerated = require("./dependenciesAny/dependenciesDerivative.generated.js");
+
+var _dependenciesDetGenerated = require("./dependenciesAny/dependenciesDet.generated.js");
+
+var _dependenciesDeuteronMassGenerated = require("./dependenciesAny/dependenciesDeuteronMass.generated.js");
+
+var _dependenciesDiagGenerated = require("./dependenciesAny/dependenciesDiag.generated.js");
+
+var _dependenciesDiffGenerated = require("./dependenciesAny/dependenciesDiff.generated.js");
+
+var _dependenciesDiffTransformGenerated = require("./dependenciesAny/dependenciesDiffTransform.generated.js");
+
+var _dependenciesDistanceGenerated = require("./dependenciesAny/dependenciesDistance.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesAny/dependenciesDivide.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesAny/dependenciesDivideScalar.generated.js");
+
+var _dependenciesDotGenerated = require("./dependenciesAny/dependenciesDot.generated.js");
+
+var _dependenciesDotDivideGenerated = require("./dependenciesAny/dependenciesDotDivide.generated.js");
+
+var _dependenciesDotMultiplyGenerated = require("./dependenciesAny/dependenciesDotMultiply.generated.js");
+
+var _dependenciesDotPowGenerated = require("./dependenciesAny/dependenciesDotPow.generated.js");
+
+var _dependenciesEGenerated = require("./dependenciesAny/dependenciesE.generated.js");
+
+var _dependenciesEfimovFactorGenerated = require("./dependenciesAny/dependenciesEfimovFactor.generated.js");
+
+var _dependenciesEigsGenerated = require("./dependenciesAny/dependenciesEigs.generated.js");
+
+var _dependenciesElectricConstantGenerated = require("./dependenciesAny/dependenciesElectricConstant.generated.js");
+
+var _dependenciesElectronMassGenerated = require("./dependenciesAny/dependenciesElectronMass.generated.js");
+
+var _dependenciesElementaryChargeGenerated = require("./dependenciesAny/dependenciesElementaryCharge.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesAny/dependenciesEqual.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesAny/dependenciesEqualScalar.generated.js");
+
+var _dependenciesEqualTextGenerated = require("./dependenciesAny/dependenciesEqualText.generated.js");
+
+var _dependenciesErfGenerated = require("./dependenciesAny/dependenciesErf.generated.js");
+
+var _dependenciesEvaluateGenerated = require("./dependenciesAny/dependenciesEvaluate.generated.js");
+
+var _dependenciesExpGenerated = require("./dependenciesAny/dependenciesExp.generated.js");
+
+var _dependenciesExpmGenerated = require("./dependenciesAny/dependenciesExpm.generated.js");
+
+var _dependenciesExpm1Generated = require("./dependenciesAny/dependenciesExpm1.generated.js");
+
+var _dependenciesFactorialGenerated = require("./dependenciesAny/dependenciesFactorial.generated.js");
+
+var _dependenciesFalseGenerated = require("./dependenciesAny/dependenciesFalse.generated.js");
+
+var _dependenciesFaradayGenerated = require("./dependenciesAny/dependenciesFaraday.generated.js");
+
+var _dependenciesFermiCouplingGenerated = require("./dependenciesAny/dependenciesFermiCoupling.generated.js");
+
+var _dependenciesFibonacciHeapClassGenerated = require("./dependenciesAny/dependenciesFibonacciHeapClass.generated.js");
+
+var _dependenciesFilterGenerated = require("./dependenciesAny/dependenciesFilter.generated.js");
+
+var _dependenciesFilterTransformGenerated = require("./dependenciesAny/dependenciesFilterTransform.generated.js");
+
+var _dependenciesFineStructureGenerated = require("./dependenciesAny/dependenciesFineStructure.generated.js");
+
+var _dependenciesFirstRadiationGenerated = require("./dependenciesAny/dependenciesFirstRadiation.generated.js");
+
+var _dependenciesFixGenerated = require("./dependenciesAny/dependenciesFix.generated.js");
+
+var _dependenciesFlattenGenerated = require("./dependenciesAny/dependenciesFlatten.generated.js");
+
+var _dependenciesFloorGenerated = require("./dependenciesAny/dependenciesFloor.generated.js");
+
+var _dependenciesForEachGenerated = require("./dependenciesAny/dependenciesForEach.generated.js");
+
+var _dependenciesForEachTransformGenerated = require("./dependenciesAny/dependenciesForEachTransform.generated.js");
+
+var _dependenciesFormatGenerated = require("./dependenciesAny/dependenciesFormat.generated.js");
+
+var _dependenciesFractionGenerated = require("./dependenciesAny/dependenciesFraction.generated.js");
+
+var _dependenciesFractionClassGenerated = require("./dependenciesAny/dependenciesFractionClass.generated.js");
+
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesAny/dependenciesFunctionAssignmentNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesAny/dependenciesFunctionNode.generated.js");
+
+var _dependenciesGammaGenerated = require("./dependenciesAny/dependenciesGamma.generated.js");
+
+var _dependenciesGasConstantGenerated = require("./dependenciesAny/dependenciesGasConstant.generated.js");
+
+var _dependenciesGcdGenerated = require("./dependenciesAny/dependenciesGcd.generated.js");
+
+var _dependenciesGetMatrixDataTypeGenerated = require("./dependenciesAny/dependenciesGetMatrixDataType.generated.js");
+
+var _dependenciesGravitationConstantGenerated = require("./dependenciesAny/dependenciesGravitationConstant.generated.js");
+
+var _dependenciesGravityGenerated = require("./dependenciesAny/dependenciesGravity.generated.js");
+
+var _dependenciesHartreeEnergyGenerated = require("./dependenciesAny/dependenciesHartreeEnergy.generated.js");
+
+var _dependenciesHasNumericValueGenerated = require("./dependenciesAny/dependenciesHasNumericValue.generated.js");
+
+var _dependenciesHelpGenerated = require("./dependenciesAny/dependenciesHelp.generated.js");
+
+var _dependenciesHelpClassGenerated = require("./dependenciesAny/dependenciesHelpClass.generated.js");
+
+var _dependenciesHexGenerated = require("./dependenciesAny/dependenciesHex.generated.js");
+
+var _dependenciesHypotGenerated = require("./dependenciesAny/dependenciesHypot.generated.js");
+
+var _dependenciesIGenerated = require("./dependenciesAny/dependenciesI.generated.js");
+
+var _dependenciesIdentityGenerated = require("./dependenciesAny/dependenciesIdentity.generated.js");
+
+var _dependenciesImGenerated = require("./dependenciesAny/dependenciesIm.generated.js");
+
+var _dependenciesImmutableDenseMatrixClassGenerated = require("./dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js");
+
+var _dependenciesIndexGenerated = require("./dependenciesAny/dependenciesIndex.generated.js");
+
+var _dependenciesIndexClassGenerated = require("./dependenciesAny/dependenciesIndexClass.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesAny/dependenciesIndexNode.generated.js");
+
+var _dependenciesIndexTransformGenerated = require("./dependenciesAny/dependenciesIndexTransform.generated.js");
+
+var _dependenciesInfinityGenerated = require("./dependenciesAny/dependenciesInfinity.generated.js");
+
+var _dependenciesIntersectGenerated = require("./dependenciesAny/dependenciesIntersect.generated.js");
+
+var _dependenciesInvGenerated = require("./dependenciesAny/dependenciesInv.generated.js");
+
+var _dependenciesInverseConductanceQuantumGenerated = require("./dependenciesAny/dependenciesInverseConductanceQuantum.generated.js");
+
+var _dependenciesInvmodGenerated = require("./dependenciesAny/dependenciesInvmod.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesAny/dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesAny/dependenciesIsNaN.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesAny/dependenciesIsNegative.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesAny/dependenciesIsNumeric.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesAny/dependenciesIsPositive.generated.js");
+
+var _dependenciesIsPrimeGenerated = require("./dependenciesAny/dependenciesIsPrime.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesAny/dependenciesIsZero.generated.js");
+
+var _dependenciesKldivergenceGenerated = require("./dependenciesAny/dependenciesKldivergence.generated.js");
+
+var _dependenciesKlitzingGenerated = require("./dependenciesAny/dependenciesKlitzing.generated.js");
+
+var _dependenciesKronGenerated = require("./dependenciesAny/dependenciesKron.generated.js");
+
+var _dependenciesLN10Generated = require("./dependenciesAny/dependenciesLN10.generated.js");
+
+var _dependenciesLN2Generated = require("./dependenciesAny/dependenciesLN2.generated.js");
+
+var _dependenciesLOG10EGenerated = require("./dependenciesAny/dependenciesLOG10E.generated.js");
+
+var _dependenciesLOG2EGenerated = require("./dependenciesAny/dependenciesLOG2E.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesAny/dependenciesLarger.generated.js");
+
+var _dependenciesLargerEqGenerated = require("./dependenciesAny/dependenciesLargerEq.generated.js");
+
+var _dependenciesLcmGenerated = require("./dependenciesAny/dependenciesLcm.generated.js");
+
+var _dependenciesLeafCountGenerated = require("./dependenciesAny/dependenciesLeafCount.generated.js");
+
+var _dependenciesLeftShiftGenerated = require("./dependenciesAny/dependenciesLeftShift.generated.js");
+
+var _dependenciesLogGenerated = require("./dependenciesAny/dependenciesLog.generated.js");
+
+var _dependenciesLog10Generated = require("./dependenciesAny/dependenciesLog10.generated.js");
+
+var _dependenciesLog1pGenerated = require("./dependenciesAny/dependenciesLog1p.generated.js");
+
+var _dependenciesLog2Generated = require("./dependenciesAny/dependenciesLog2.generated.js");
+
+var _dependenciesLoschmidtGenerated = require("./dependenciesAny/dependenciesLoschmidt.generated.js");
+
+var _dependenciesLsolveGenerated = require("./dependenciesAny/dependenciesLsolve.generated.js");
+
+var _dependenciesLsolveAllGenerated = require("./dependenciesAny/dependenciesLsolveAll.generated.js");
+
+var _dependenciesLupGenerated = require("./dependenciesAny/dependenciesLup.generated.js");
+
+var _dependenciesLusolveGenerated = require("./dependenciesAny/dependenciesLusolve.generated.js");
+
+var _dependenciesMadGenerated = require("./dependenciesAny/dependenciesMad.generated.js");
+
+var _dependenciesMagneticConstantGenerated = require("./dependenciesAny/dependenciesMagneticConstant.generated.js");
+
+var _dependenciesMagneticFluxQuantumGenerated = require("./dependenciesAny/dependenciesMagneticFluxQuantum.generated.js");
+
+var _dependenciesMapGenerated = require("./dependenciesAny/dependenciesMap.generated.js");
+
+var _dependenciesMapTransformGenerated = require("./dependenciesAny/dependenciesMapTransform.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesAny/dependenciesMatrix.generated.js");
+
+var _dependenciesMatrixClassGenerated = require("./dependenciesAny/dependenciesMatrixClass.generated.js");
+
+var _dependenciesMatrixFromColumnsGenerated = require("./dependenciesAny/dependenciesMatrixFromColumns.generated.js");
+
+var _dependenciesMatrixFromFunctionGenerated = require("./dependenciesAny/dependenciesMatrixFromFunction.generated.js");
+
+var _dependenciesMatrixFromRowsGenerated = require("./dependenciesAny/dependenciesMatrixFromRows.generated.js");
+
+var _dependenciesMaxGenerated = require("./dependenciesAny/dependenciesMax.generated.js");
+
+var _dependenciesMaxTransformGenerated = require("./dependenciesAny/dependenciesMaxTransform.generated.js");
+
+var _dependenciesMeanGenerated = require("./dependenciesAny/dependenciesMean.generated.js");
+
+var _dependenciesMeanTransformGenerated = require("./dependenciesAny/dependenciesMeanTransform.generated.js");
+
+var _dependenciesMedianGenerated = require("./dependenciesAny/dependenciesMedian.generated.js");
+
+var _dependenciesMinGenerated = require("./dependenciesAny/dependenciesMin.generated.js");
+
+var _dependenciesMinTransformGenerated = require("./dependenciesAny/dependenciesMinTransform.generated.js");
+
+var _dependenciesModGenerated = require("./dependenciesAny/dependenciesMod.generated.js");
+
+var _dependenciesModeGenerated = require("./dependenciesAny/dependenciesMode.generated.js");
+
+var _dependenciesMolarMassGenerated = require("./dependenciesAny/dependenciesMolarMass.generated.js");
+
+var _dependenciesMolarMassC12Generated = require("./dependenciesAny/dependenciesMolarMassC12.generated.js");
+
+var _dependenciesMolarPlanckConstantGenerated = require("./dependenciesAny/dependenciesMolarPlanckConstant.generated.js");
+
+var _dependenciesMolarVolumeGenerated = require("./dependenciesAny/dependenciesMolarVolume.generated.js");
+
+var _dependenciesMultinomialGenerated = require("./dependenciesAny/dependenciesMultinomial.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesAny/dependenciesMultiply.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesAny/dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNaNGenerated = require("./dependenciesAny/dependenciesNaN.generated.js");
+
+var _dependenciesNeutronMassGenerated = require("./dependenciesAny/dependenciesNeutronMass.generated.js");
+
+var _dependenciesNodeGenerated = require("./dependenciesAny/dependenciesNode.generated.js");
+
+var _dependenciesNormGenerated = require("./dependenciesAny/dependenciesNorm.generated.js");
+
+var _dependenciesNotGenerated = require("./dependenciesAny/dependenciesNot.generated.js");
+
+var _dependenciesNthRootGenerated = require("./dependenciesAny/dependenciesNthRoot.generated.js");
+
+var _dependenciesNthRootsGenerated = require("./dependenciesAny/dependenciesNthRoots.generated.js");
+
+var _dependenciesNuclearMagnetonGenerated = require("./dependenciesAny/dependenciesNuclearMagneton.generated.js");
+
+var _dependenciesNullGenerated = require("./dependenciesAny/dependenciesNull.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesAny/dependenciesNumber.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesAny/dependenciesNumeric.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesAny/dependenciesObjectNode.generated.js");
+
+var _dependenciesOctGenerated = require("./dependenciesAny/dependenciesOct.generated.js");
+
+var _dependenciesOnesGenerated = require("./dependenciesAny/dependenciesOnes.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesAny/dependenciesOperatorNode.generated.js");
+
+var _dependenciesOrGenerated = require("./dependenciesAny/dependenciesOr.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesAny/dependenciesParenthesisNode.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesAny/dependenciesParse.generated.js");
+
+var _dependenciesParserGenerated = require("./dependenciesAny/dependenciesParser.generated.js");
+
+var _dependenciesParserClassGenerated = require("./dependenciesAny/dependenciesParserClass.generated.js");
+
+var _dependenciesPartitionSelectGenerated = require("./dependenciesAny/dependenciesPartitionSelect.generated.js");
+
+var _dependenciesPermutationsGenerated = require("./dependenciesAny/dependenciesPermutations.generated.js");
+
+var _dependenciesPhiGenerated = require("./dependenciesAny/dependenciesPhi.generated.js");
+
+var _dependenciesPiGenerated = require("./dependenciesAny/dependenciesPi.generated.js");
+
+var _dependenciesPickRandomGenerated = require("./dependenciesAny/dependenciesPickRandom.generated.js");
+
+var _dependenciesPlanckChargeGenerated = require("./dependenciesAny/dependenciesPlanckCharge.generated.js");
+
+var _dependenciesPlanckConstantGenerated = require("./dependenciesAny/dependenciesPlanckConstant.generated.js");
+
+var _dependenciesPlanckLengthGenerated = require("./dependenciesAny/dependenciesPlanckLength.generated.js");
+
+var _dependenciesPlanckMassGenerated = require("./dependenciesAny/dependenciesPlanckMass.generated.js");
+
+var _dependenciesPlanckTemperatureGenerated = require("./dependenciesAny/dependenciesPlanckTemperature.generated.js");
+
+var _dependenciesPlanckTimeGenerated = require("./dependenciesAny/dependenciesPlanckTime.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesAny/dependenciesPow.generated.js");
+
+var _dependenciesPrintGenerated = require("./dependenciesAny/dependenciesPrint.generated.js");
+
+var _dependenciesProdGenerated = require("./dependenciesAny/dependenciesProd.generated.js");
+
+var _dependenciesProtonMassGenerated = require("./dependenciesAny/dependenciesProtonMass.generated.js");
+
+var _dependenciesQrGenerated = require("./dependenciesAny/dependenciesQr.generated.js");
+
+var _dependenciesQuantileSeqGenerated = require("./dependenciesAny/dependenciesQuantileSeq.generated.js");
+
+var _dependenciesQuantumOfCirculationGenerated = require("./dependenciesAny/dependenciesQuantumOfCirculation.generated.js");
+
+var _dependenciesRandomGenerated = require("./dependenciesAny/dependenciesRandom.generated.js");
+
+var _dependenciesRandomIntGenerated = require("./dependenciesAny/dependenciesRandomInt.generated.js");
+
+var _dependenciesRangeGenerated = require("./dependenciesAny/dependenciesRange.generated.js");
+
+var _dependenciesRangeClassGenerated = require("./dependenciesAny/dependenciesRangeClass.generated.js");
+
+var _dependenciesRangeNodeGenerated = require("./dependenciesAny/dependenciesRangeNode.generated.js");
+
+var _dependenciesRangeTransformGenerated = require("./dependenciesAny/dependenciesRangeTransform.generated.js");
+
+var _dependenciesRationalizeGenerated = require("./dependenciesAny/dependenciesRationalize.generated.js");
+
+var _dependenciesReGenerated = require("./dependenciesAny/dependenciesRe.generated.js");
+
+var _dependenciesReducedPlanckConstantGenerated = require("./dependenciesAny/dependenciesReducedPlanckConstant.generated.js");
+
+var _dependenciesRelationalNodeGenerated = require("./dependenciesAny/dependenciesRelationalNode.generated.js");
+
+var _dependenciesReplacerGenerated = require("./dependenciesAny/dependenciesReplacer.generated.js");
+
+var _dependenciesReshapeGenerated = require("./dependenciesAny/dependenciesReshape.generated.js");
+
+var _dependenciesResizeGenerated = require("./dependenciesAny/dependenciesResize.generated.js");
+
+var _dependenciesResolveGenerated = require("./dependenciesAny/dependenciesResolve.generated.js");
+
+var _dependenciesResultSetGenerated = require("./dependenciesAny/dependenciesResultSet.generated.js");
+
+var _dependenciesReviverGenerated = require("./dependenciesAny/dependenciesReviver.generated.js");
+
+var _dependenciesRightArithShiftGenerated = require("./dependenciesAny/dependenciesRightArithShift.generated.js");
+
+var _dependenciesRightLogShiftGenerated = require("./dependenciesAny/dependenciesRightLogShift.generated.js");
+
+var _dependenciesRotateGenerated = require("./dependenciesAny/dependenciesRotate.generated.js");
+
+var _dependenciesRotationMatrixGenerated = require("./dependenciesAny/dependenciesRotationMatrix.generated.js");
+
+var _dependenciesRoundGenerated = require("./dependenciesAny/dependenciesRound.generated.js");
+
+var _dependenciesRowGenerated = require("./dependenciesAny/dependenciesRow.generated.js");
+
+var _dependenciesRowTransformGenerated = require("./dependenciesAny/dependenciesRowTransform.generated.js");
+
+var _dependenciesRydbergGenerated = require("./dependenciesAny/dependenciesRydberg.generated.js");
+
+var _dependenciesSQRT1_2Generated = require("./dependenciesAny/dependenciesSQRT1_2.generated.js");
+
+var _dependenciesSQRT2Generated = require("./dependenciesAny/dependenciesSQRT2.generated.js");
+
+var _dependenciesSackurTetrodeGenerated = require("./dependenciesAny/dependenciesSackurTetrode.generated.js");
+
+var _dependenciesSecGenerated = require("./dependenciesAny/dependenciesSec.generated.js");
+
+var _dependenciesSechGenerated = require("./dependenciesAny/dependenciesSech.generated.js");
+
+var _dependenciesSecondRadiationGenerated = require("./dependenciesAny/dependenciesSecondRadiation.generated.js");
+
+var _dependenciesSetCartesianGenerated = require("./dependenciesAny/dependenciesSetCartesian.generated.js");
+
+var _dependenciesSetDifferenceGenerated = require("./dependenciesAny/dependenciesSetDifference.generated.js");
+
+var _dependenciesSetDistinctGenerated = require("./dependenciesAny/dependenciesSetDistinct.generated.js");
+
+var _dependenciesSetIntersectGenerated = require("./dependenciesAny/dependenciesSetIntersect.generated.js");
+
+var _dependenciesSetIsSubsetGenerated = require("./dependenciesAny/dependenciesSetIsSubset.generated.js");
+
+var _dependenciesSetMultiplicityGenerated = require("./dependenciesAny/dependenciesSetMultiplicity.generated.js");
+
+var _dependenciesSetPowersetGenerated = require("./dependenciesAny/dependenciesSetPowerset.generated.js");
+
+var _dependenciesSetSizeGenerated = require("./dependenciesAny/dependenciesSetSize.generated.js");
+
+var _dependenciesSetSymDifferenceGenerated = require("./dependenciesAny/dependenciesSetSymDifference.generated.js");
+
+var _dependenciesSetUnionGenerated = require("./dependenciesAny/dependenciesSetUnion.generated.js");
+
+var _dependenciesSignGenerated = require("./dependenciesAny/dependenciesSign.generated.js");
+
+var _dependenciesSimplifyGenerated = require("./dependenciesAny/dependenciesSimplify.generated.js");
+
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesAny/dependenciesSimplifyCore.generated.js");
+
+var _dependenciesSinGenerated = require("./dependenciesAny/dependenciesSin.generated.js");
+
+var _dependenciesSinhGenerated = require("./dependenciesAny/dependenciesSinh.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesAny/dependenciesSize.generated.js");
+
+var _dependenciesSluGenerated = require("./dependenciesAny/dependenciesSlu.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesAny/dependenciesSmaller.generated.js");
+
+var _dependenciesSmallerEqGenerated = require("./dependenciesAny/dependenciesSmallerEq.generated.js");
+
+var _dependenciesSortGenerated = require("./dependenciesAny/dependenciesSort.generated.js");
+
+var _dependenciesSpaClassGenerated = require("./dependenciesAny/dependenciesSpaClass.generated.js");
+
+var _dependenciesSparseGenerated = require("./dependenciesAny/dependenciesSparse.generated.js");
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesAny/dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesSpeedOfLightGenerated = require("./dependenciesAny/dependenciesSpeedOfLight.generated.js");
+
+var _dependenciesSplitUnitGenerated = require("./dependenciesAny/dependenciesSplitUnit.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesAny/dependenciesSqrt.generated.js");
+
+var _dependenciesSqrtmGenerated = require("./dependenciesAny/dependenciesSqrtm.generated.js");
+
+var _dependenciesSquareGenerated = require("./dependenciesAny/dependenciesSquare.generated.js");
+
+var _dependenciesSqueezeGenerated = require("./dependenciesAny/dependenciesSqueeze.generated.js");
+
+var _dependenciesStdGenerated = require("./dependenciesAny/dependenciesStd.generated.js");
+
+var _dependenciesStdTransformGenerated = require("./dependenciesAny/dependenciesStdTransform.generated.js");
+
+var _dependenciesStefanBoltzmannGenerated = require("./dependenciesAny/dependenciesStefanBoltzmann.generated.js");
+
+var _dependenciesStirlingS2Generated = require("./dependenciesAny/dependenciesStirlingS2.generated.js");
+
+var _dependenciesStringGenerated = require("./dependenciesAny/dependenciesString.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesAny/dependenciesSubset.generated.js");
+
+var _dependenciesSubsetTransformGenerated = require("./dependenciesAny/dependenciesSubsetTransform.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesAny/dependenciesSubtract.generated.js");
+
+var _dependenciesSumGenerated = require("./dependenciesAny/dependenciesSum.generated.js");
+
+var _dependenciesSumTransformGenerated = require("./dependenciesAny/dependenciesSumTransform.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesAny/dependenciesSymbolNode.generated.js");
+
+var _dependenciesSymbolicEqualGenerated = require("./dependenciesAny/dependenciesSymbolicEqual.generated.js");
+
+var _dependenciesTanGenerated = require("./dependenciesAny/dependenciesTan.generated.js");
+
+var _dependenciesTanhGenerated = require("./dependenciesAny/dependenciesTanh.generated.js");
+
+var _dependenciesTauGenerated = require("./dependenciesAny/dependenciesTau.generated.js");
+
+var _dependenciesThomsonCrossSectionGenerated = require("./dependenciesAny/dependenciesThomsonCrossSection.generated.js");
+
+var _dependenciesToGenerated = require("./dependenciesAny/dependenciesTo.generated.js");
+
+var _dependenciesTraceGenerated = require("./dependenciesAny/dependenciesTrace.generated.js");
+
+var _dependenciesTransposeGenerated = require("./dependenciesAny/dependenciesTranspose.generated.js");
+
+var _dependenciesTrueGenerated = require("./dependenciesAny/dependenciesTrue.generated.js");
+
+var _dependenciesTypeOfGenerated = require("./dependenciesAny/dependenciesTypeOf.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesAny/dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesAny/dependenciesUnaryMinus.generated.js");
+
+var _dependenciesUnaryPlusGenerated = require("./dependenciesAny/dependenciesUnaryPlus.generated.js");
+
+var _dependenciesUnequalGenerated = require("./dependenciesAny/dependenciesUnequal.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesAny/dependenciesUnitClass.generated.js");
+
+var _dependenciesUnitFunctionGenerated = require("./dependenciesAny/dependenciesUnitFunction.generated.js");
+
+var _dependenciesUppercaseEGenerated = require("./dependenciesAny/dependenciesUppercaseE.generated.js");
+
+var _dependenciesUppercasePiGenerated = require("./dependenciesAny/dependenciesUppercasePi.generated.js");
+
+var _dependenciesUsolveGenerated = require("./dependenciesAny/dependenciesUsolve.generated.js");
+
+var _dependenciesUsolveAllGenerated = require("./dependenciesAny/dependenciesUsolveAll.generated.js");
+
+var _dependenciesVacuumImpedanceGenerated = require("./dependenciesAny/dependenciesVacuumImpedance.generated.js");
+
+var _dependenciesVarianceGenerated = require("./dependenciesAny/dependenciesVariance.generated.js");
+
+var _dependenciesVarianceTransformGenerated = require("./dependenciesAny/dependenciesVarianceTransform.generated.js");
+
+var _dependenciesVersionGenerated = require("./dependenciesAny/dependenciesVersion.generated.js");
+
+var _dependenciesWeakMixingAngleGenerated = require("./dependenciesAny/dependenciesWeakMixingAngle.generated.js");
+
+var _dependenciesWienDisplacementGenerated = require("./dependenciesAny/dependenciesWienDisplacement.generated.js");
+
+var _dependenciesXgcdGenerated = require("./dependenciesAny/dependenciesXgcd.generated.js");
+
+var _dependenciesXorGenerated = require("./dependenciesAny/dependenciesXor.generated.js");
+
+var _dependenciesZerosGenerated = require("./dependenciesAny/dependenciesZeros.generated.js");
+
+var _allFactoriesAny = require("./allFactoriesAny.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAbs.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAbs.generated.js
new file mode 100644
index 0000000..24a3fc2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAbs.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var absDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAbs: _factoriesAny.createAbs
+};
+exports.absDependencies = absDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..c994c41
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAccessorNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AccessorNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var AccessorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAccessorNode: _factoriesAny.createAccessorNode
+};
+exports.AccessorNodeDependencies = AccessorNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcos.generated.js
new file mode 100644
index 0000000..c665ce8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcos.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acosDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcos: _factoriesAny.createAcos
+};
+exports.acosDependencies = acosDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..dcd5eb6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcosh.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acoshDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acoshDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcosh: _factoriesAny.createAcosh
+};
+exports.acoshDependencies = acoshDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcot.generated.js
new file mode 100644
index 0000000..d8c85cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcot.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acotDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acotDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcot: _factoriesAny.createAcot
+};
+exports.acotDependencies = acotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..a32d9cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcoth.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acothDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acothDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcoth: _factoriesAny.createAcoth
+};
+exports.acothDependencies = acothDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..b9110cf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsc.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acscDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acscDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsc: _factoriesAny.createAcsc
+};
+exports.acscDependencies = acscDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..418e467
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsch.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acschDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acschDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsch: _factoriesAny.createAcsch
+};
+exports.acschDependencies = acschDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAdd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAdd.generated.js
new file mode 100644
index 0000000..0193df5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAdd.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var addDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAdd: _factoriesAny.createAdd
+};
+exports.addDependencies = addDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..4c9255a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAddScalar.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addScalarDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var addScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAddScalar: _factoriesAny.createAddScalar
+};
+exports.addScalarDependencies = addScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAnd.generated.js
new file mode 100644
index 0000000..07aeb08
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAnd.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesNotGenerated = require("./dependenciesNot.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var andDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  notDependencies: _dependenciesNotGenerated.notDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createAnd: _factoriesAny.createAnd
+};
+exports.andDependencies = andDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApply.generated.js
new file mode 100644
index 0000000..332e14f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApply.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.applyDependencies = void 0;
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var applyDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createApply: _factoriesAny.createApply
+};
+exports.applyDependencies = applyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApplyTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApplyTransform.generated.js
new file mode 100644
index 0000000..3c1e09e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApplyTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.applyTransformDependencies = void 0;
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var applyTransformDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createApplyTransform: _factoriesAny.createApplyTransform
+};
+exports.applyTransformDependencies = applyTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArg.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArg.generated.js
new file mode 100644
index 0000000..f42c901
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArg.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.argDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var argDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createArg: _factoriesAny.createArg
+};
+exports.argDependencies = argDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..264469e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArrayNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ArrayNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ArrayNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createArrayNode: _factoriesAny.createArrayNode
+};
+exports.ArrayNodeDependencies = ArrayNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsec.generated.js
new file mode 100644
index 0000000..268e3d7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsec.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asecDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asecDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsec: _factoriesAny.createAsec
+};
+exports.asecDependencies = asecDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsech.generated.js
new file mode 100644
index 0000000..6e32e5c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsech.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asechDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asechDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsech: _factoriesAny.createAsech
+};
+exports.asechDependencies = asechDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsin.generated.js
new file mode 100644
index 0000000..985aa2f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsin.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asinDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsin: _factoriesAny.createAsin
+};
+exports.asinDependencies = asinDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..fdab86f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsinh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinhDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsinh: _factoriesAny.createAsinh
+};
+exports.asinhDependencies = asinhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..d4c39a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AssignmentNodeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var AssignmentNodeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAssignmentNode: _factoriesAny.createAssignmentNode
+};
+exports.AssignmentNodeDependencies = AssignmentNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan.generated.js
new file mode 100644
index 0000000..36da0bb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var atanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan: _factoriesAny.createAtan
+};
+exports.atanDependencies = atanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..a9d656a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan2.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atan2Dependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var atan2Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan2: _factoriesAny.createAtan2
+};
+exports.atan2Dependencies = atan2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..4cf3803
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtanh.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanhDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var atanhDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtanh: _factoriesAny.createAtanh
+};
+exports.atanhDependencies = atanhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtomicMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtomicMass.generated.js
new file mode 100644
index 0000000..96f4578
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtomicMass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atomicMassDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var atomicMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createAtomicMass: _factoriesAny.createAtomicMass
+};
+exports.atomicMassDependencies = atomicMassDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAvogadro.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAvogadro.generated.js
new file mode 100644
index 0000000..862abc0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAvogadro.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.avogadroDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var avogadroDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createAvogadro: _factoriesAny.createAvogadro
+};
+exports.avogadroDependencies = avogadroDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..afc3ced
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBellNumbers.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bellNumbersDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesStirlingS2Generated = require("./dependenciesStirlingS2.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bellNumbersDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  stirlingS2Dependencies: _dependenciesStirlingS2Generated.stirlingS2Dependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBellNumbers: _factoriesAny.createBellNumbers
+};
+exports.bellNumbersDependencies = bellNumbersDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigNumberClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
new file mode 100644
index 0000000..0edadfa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.BigNumberDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var BigNumberDependencies = {
+  createBigNumberClass: _factoriesAny.createBigNumberClass
+};
+exports.BigNumberDependencies = BigNumberDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBignumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBignumber.generated.js
new file mode 100644
index 0000000..a5e6d44
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBignumber.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bignumberDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bignumberDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBignumber: _factoriesAny.createBignumber
+};
+exports.bignumberDependencies = bignumberDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBin.generated.js
new file mode 100644
index 0000000..8af86bf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBin.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.binDependencies = void 0;
+
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var binDependencies = {
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBin: _factoriesAny.createBin
+};
+exports.binDependencies = binDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..1dee9d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAnd.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitAndDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitAnd: _factoriesAny.createBitAnd
+};
+exports.bitAndDependencies = bitAndDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..2be9694
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitNot.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitNotDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitNotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitNot: _factoriesAny.createBitNot
+};
+exports.bitNotDependencies = bitNotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..95a4e91
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOr.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitOrDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitOrDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitOr: _factoriesAny.createBitOr
+};
+exports.bitOrDependencies = bitOrDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..4361ba5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitXor.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitXorDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitXorDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitXor: _factoriesAny.createBitXor
+};
+exports.bitXorDependencies = bitXorDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..378ccdc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBlockNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.BlockNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesResultSetGenerated = require("./dependenciesResultSet.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var BlockNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  ResultSetDependencies: _dependenciesResultSetGenerated.ResultSetDependencies,
+  createBlockNode: _factoriesAny.createBlockNode
+};
+exports.BlockNodeDependencies = BlockNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrMagneton.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
new file mode 100644
index 0000000..a788ab4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bohrMagnetonDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bohrMagnetonDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createBohrMagneton: _factoriesAny.createBohrMagneton
+};
+exports.bohrMagnetonDependencies = bohrMagnetonDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrRadius.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrRadius.generated.js
new file mode 100644
index 0000000..24c8b62
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrRadius.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bohrRadiusDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bohrRadiusDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createBohrRadius: _factoriesAny.createBohrRadius
+};
+exports.bohrRadiusDependencies = bohrRadiusDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoltzmann.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoltzmann.generated.js
new file mode 100644
index 0000000..2be1828
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoltzmann.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.boltzmannDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var boltzmannDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createBoltzmann: _factoriesAny.createBoltzmann
+};
+exports.boltzmannDependencies = boltzmannDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..20a3d59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoolean.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.booleanDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var booleanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBoolean: _factoriesAny.createBoolean
+};
+exports.booleanDependencies = booleanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..e6eccba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCatalan.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.catalanDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var catalanDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCatalan: _factoriesAny.createCatalan
+};
+exports.catalanDependencies = catalanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..327fb2f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCbrt.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cbrtDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cbrtDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createCbrt: _factoriesAny.createCbrt
+};
+exports.cbrtDependencies = cbrtDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCeil.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCeil.generated.js
new file mode 100644
index 0000000..0e6ee69
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCeil.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ceilDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ceilDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCeil: _factoriesAny.createCeil
+};
+exports.ceilDependencies = ceilDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChain.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChain.generated.js
new file mode 100644
index 0000000..0e06631
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChain.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.chainDependencies = void 0;
+
+var _dependenciesChainClassGenerated = require("./dependenciesChainClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var chainDependencies = {
+  ChainDependencies: _dependenciesChainClassGenerated.ChainDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createChain: _factoriesAny.createChain
+};
+exports.chainDependencies = chainDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..fb0643c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChainClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ChainDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ChainDependencies = {
+  createChainClass: _factoriesAny.createChainClass
+};
+exports.ChainDependencies = ChainDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
new file mode 100644
index 0000000..c6b1db7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.classicalElectronRadiusDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var classicalElectronRadiusDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createClassicalElectronRadius: _factoriesAny.createClassicalElectronRadius
+};
+exports.classicalElectronRadiusDependencies = classicalElectronRadiusDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClone.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClone.generated.js
new file mode 100644
index 0000000..0a3f477
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClone.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cloneDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cloneDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createClone: _factoriesAny.createClone
+};
+exports.cloneDependencies = cloneDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumn.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumn.generated.js
new file mode 100644
index 0000000..49126c4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumn.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.columnDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var columnDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createColumn: _factoriesAny.createColumn
+};
+exports.columnDependencies = columnDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumnTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumnTransform.generated.js
new file mode 100644
index 0000000..b47ca05
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumnTransform.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.columnTransformDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var columnTransformDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createColumnTransform: _factoriesAny.createColumnTransform
+};
+exports.columnTransformDependencies = columnTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..493db87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinations.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var combinationsDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinations: _factoriesAny.createCombinations
+};
+exports.combinationsDependencies = combinationsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..01f9de2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsWithRepDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var combinationsWithRepDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinationsWithRep: _factoriesAny.createCombinationsWithRep
+};
+exports.combinationsWithRepDependencies = combinationsWithRepDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompare.generated.js
new file mode 100644
index 0000000..c7211e3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompare.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compareDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompare: _factoriesAny.createCompare
+};
+exports.compareDependencies = compareDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..e69587e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareNatural.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareNaturalDependencies = void 0;
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compareNaturalDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareNatural: _factoriesAny.createCompareNatural
+};
+exports.compareNaturalDependencies = compareNaturalDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..df86e67
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareText.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareTextDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compareTextDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareText: _factoriesAny.createCompareText
+};
+exports.compareTextDependencies = compareTextDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompile.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompile.generated.js
new file mode 100644
index 0000000..3314039
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompile.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compileDependencies = void 0;
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compileDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompile: _factoriesAny.createCompile
+};
+exports.compileDependencies = compileDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplex.generated.js
new file mode 100644
index 0000000..c9206a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplex.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.complexDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var complexDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createComplex: _factoriesAny.createComplex
+};
+exports.complexDependencies = complexDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplexClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplexClass.generated.js
new file mode 100644
index 0000000..c4582d0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplexClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ComplexDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ComplexDependencies = {
+  createComplexClass: _factoriesAny.createComplexClass
+};
+exports.ComplexDependencies = ComplexDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComposition.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComposition.generated.js
new file mode 100644
index 0000000..17fedba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComposition.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compositionDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compositionDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createComposition: _factoriesAny.createComposition
+};
+exports.compositionDependencies = compositionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcat.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcat.generated.js
new file mode 100644
index 0000000..535960d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcat.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.concatDependencies = void 0;
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var concatDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createConcat: _factoriesAny.createConcat
+};
+exports.concatDependencies = concatDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcatTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcatTransform.generated.js
new file mode 100644
index 0000000..401c25f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcatTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.concatTransformDependencies = void 0;
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var concatTransformDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createConcatTransform: _factoriesAny.createConcatTransform
+};
+exports.concatTransformDependencies = concatTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..f767512
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConditionalNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConditionalNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ConditionalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConditionalNode: _factoriesAny.createConditionalNode
+};
+exports.ConditionalNodeDependencies = ConditionalNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
new file mode 100644
index 0000000..2c571b3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.conductanceQuantumDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var conductanceQuantumDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createConductanceQuantum: _factoriesAny.createConductanceQuantum
+};
+exports.conductanceQuantumDependencies = conductanceQuantumDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConj.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConj.generated.js
new file mode 100644
index 0000000..ba6a01f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConj.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.conjDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var conjDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createConj: _factoriesAny.createConj
+};
+exports.conjDependencies = conjDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..abc324f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConstantNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConstantNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ConstantNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConstantNode: _factoriesAny.createConstantNode
+};
+exports.ConstantNodeDependencies = ConstantNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCos.generated.js
new file mode 100644
index 0000000..5798dea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCos.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cosDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cosDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCos: _factoriesAny.createCos
+};
+exports.cosDependencies = cosDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCosh.generated.js
new file mode 100644
index 0000000..ab225b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCosh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coshDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var coshDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCosh: _factoriesAny.createCosh
+};
+exports.coshDependencies = coshDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCot.generated.js
new file mode 100644
index 0000000..a0c3dee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCot.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cotDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cotDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCot: _factoriesAny.createCot
+};
+exports.cotDependencies = cotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoth.generated.js
new file mode 100644
index 0000000..c35299a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoth.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cothDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cothDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCoth: _factoriesAny.createCoth
+};
+exports.cothDependencies = cothDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulomb.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulomb.generated.js
new file mode 100644
index 0000000..98599eb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulomb.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coulombDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var coulombDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createCoulomb: _factoriesAny.createCoulomb
+};
+exports.coulombDependencies = coulombDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCount.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCount.generated.js
new file mode 100644
index 0000000..837e9c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCount.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.countDependencies = void 0;
+
+var _dependenciesProdGenerated = require("./dependenciesProd.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var countDependencies = {
+  prodDependencies: _dependenciesProdGenerated.prodDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCount: _factoriesAny.createCount
+};
+exports.countDependencies = countDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCreateUnit.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCreateUnit.generated.js
new file mode 100644
index 0000000..624dcaa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCreateUnit.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitDependencies = void 0;
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var createUnitDependencies = {
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCreateUnit: _factoriesAny.createCreateUnit
+};
+exports.createUnitDependencies = createUnitDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCross.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCross.generated.js
new file mode 100644
index 0000000..a403c93
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCross.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.crossDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var crossDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCross: _factoriesAny.createCross
+};
+exports.crossDependencies = crossDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsc.generated.js
new file mode 100644
index 0000000..39a464e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsc.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cscDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cscDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsc: _factoriesAny.createCsc
+};
+exports.cscDependencies = cscDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsch.generated.js
new file mode 100644
index 0000000..94400eb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsch.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cschDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cschDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsch: _factoriesAny.createCsch
+};
+exports.cschDependencies = cschDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCtranspose.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCtranspose.generated.js
new file mode 100644
index 0000000..caaf08b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCtranspose.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ctransposeDependencies = void 0;
+
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+
+var _dependenciesTransposeGenerated = require("./dependenciesTranspose.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ctransposeDependencies = {
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCtranspose: _factoriesAny.createCtranspose
+};
+exports.ctransposeDependencies = ctransposeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCube.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCube.generated.js
new file mode 100644
index 0000000..f3f1012
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCube.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cubeDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cubeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCube: _factoriesAny.createCube
+};
+exports.cubeDependencies = cubeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..2ef8095
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSum.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cumsumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSum: _factoriesAny.createCumSum
+};
+exports.cumsumDependencies = cumsumDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..85dda73
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cumsumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSumTransform: _factoriesAny.createCumSumTransform
+};
+exports.cumsumTransformDependencies = cumsumTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..0314aab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeepEqual.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deepEqualDependencies = void 0;
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var deepEqualDependencies = {
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDeepEqual: _factoriesAny.createDeepEqual
+};
+exports.deepEqualDependencies = deepEqualDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
new file mode 100644
index 0000000..35df712
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.DenseMatrixDependencies = void 0;
+
+var _dependenciesMatrixClassGenerated = require("./dependenciesMatrixClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var DenseMatrixDependencies = {
+  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,
+  createDenseMatrixClass: _factoriesAny.createDenseMatrixClass
+};
+exports.DenseMatrixDependencies = DenseMatrixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..0083957
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDerivative.generated.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivativeDependencies = void 0;
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var derivativeDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDerivative: _factoriesAny.createDerivative
+};
+exports.derivativeDependencies = derivativeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDet.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDet.generated.js
new file mode 100644
index 0000000..d039ce1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDet.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.detDependencies = void 0;
+
+var _dependenciesLupGenerated = require("./dependenciesLup.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var detDependencies = {
+  lupDependencies: _dependenciesLupGenerated.lupDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createDet: _factoriesAny.createDet
+};
+exports.detDependencies = detDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeuteronMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
new file mode 100644
index 0000000..7efe925
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deuteronMassDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var deuteronMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createDeuteronMass: _factoriesAny.createDeuteronMass
+};
+exports.deuteronMassDependencies = deuteronMassDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiag.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiag.generated.js
new file mode 100644
index 0000000..a84f368
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiag.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diagDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var diagDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDiag: _factoriesAny.createDiag
+};
+exports.diagDependencies = diagDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiff.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiff.generated.js
new file mode 100644
index 0000000..53d2728
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiff.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diffDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var diffDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDiff: _factoriesAny.createDiff
+};
+exports.diffDependencies = diffDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiffTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiffTransform.generated.js
new file mode 100644
index 0000000..1d094c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiffTransform.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diffTransformDependencies = void 0;
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var diffTransformDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDiffTransform: _factoriesAny.createDiffTransform
+};
+exports.diffTransformDependencies = diffTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDistance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDistance.generated.js
new file mode 100644
index 0000000..196b2e0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDistance.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.distanceDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var distanceDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createDistance: _factoriesAny.createDistance
+};
+exports.distanceDependencies = distanceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivide.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivide.generated.js
new file mode 100644
index 0000000..46160f5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivide.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideDependencies = void 0;
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var divideDependencies = {
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivide: _factoriesAny.createDivide
+};
+exports.divideDependencies = divideDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..96099be
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivideScalar.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideScalarDependencies = void 0;
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var divideScalarDependencies = {
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivideScalar: _factoriesAny.createDivideScalar
+};
+exports.divideScalarDependencies = divideScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDot.generated.js
new file mode 100644
index 0000000..ce5fd8b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDot.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var dotDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDot: _factoriesAny.createDot
+};
+exports.dotDependencies = dotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotDivide.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotDivide.generated.js
new file mode 100644
index 0000000..4051c98
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotDivide.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDivideDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var dotDivideDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDotDivide: _factoriesAny.createDotDivide
+};
+exports.dotDivideDependencies = dotDivideDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotMultiply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotMultiply.generated.js
new file mode 100644
index 0000000..1c1c62a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotMultiply.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotMultiplyDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var dotMultiplyDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDotMultiply: _factoriesAny.createDotMultiply
+};
+exports.dotMultiplyDependencies = dotMultiplyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotPow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotPow.generated.js
new file mode 100644
index 0000000..673e134
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotPow.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotPowDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var dotPowDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDotPow: _factoriesAny.createDotPow
+};
+exports.dotPowDependencies = dotPowDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesE.generated.js
new file mode 100644
index 0000000..fa63535
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesE.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var eDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createE: _factoriesAny.createE
+};
+exports.eDependencies = eDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEfimovFactor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
new file mode 100644
index 0000000..d754ab7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.efimovFactorDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var efimovFactorDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createEfimovFactor: _factoriesAny.createEfimovFactor
+};
+exports.efimovFactorDependencies = efimovFactorDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEigs.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEigs.generated.js
new file mode 100644
index 0000000..ea6cd42
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEigs.generated.js
@@ -0,0 +1,107 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eigsDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesAtanGenerated = require("./dependenciesAtan.generated.js");
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesColumnGenerated = require("./dependenciesColumn.generated.js");
+
+var _dependenciesComplexGenerated = require("./dependenciesComplex.generated.js");
+
+var _dependenciesCosGenerated = require("./dependenciesCos.generated.js");
+
+var _dependenciesDiagGenerated = require("./dependenciesDiag.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesDotGenerated = require("./dependenciesDot.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+
+var _dependenciesImGenerated = require("./dependenciesIm.generated.js");
+
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMatrixFromColumnsGenerated = require("./dependenciesMatrixFromColumns.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _dependenciesQrGenerated = require("./dependenciesQr.generated.js");
+
+var _dependenciesReGenerated = require("./dependenciesRe.generated.js");
+
+var _dependenciesSinGenerated = require("./dependenciesSin.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUsolveGenerated = require("./dependenciesUsolve.generated.js");
+
+var _dependenciesUsolveAllGenerated = require("./dependenciesUsolveAll.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var eigsDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  atanDependencies: _dependenciesAtanGenerated.atanDependencies,
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  columnDependencies: _dependenciesColumnGenerated.columnDependencies,
+  complexDependencies: _dependenciesComplexGenerated.complexDependencies,
+  cosDependencies: _dependenciesCosGenerated.cosDependencies,
+  diagDependencies: _dependenciesDiagGenerated.diagDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  dotDependencies: _dependenciesDotGenerated.dotDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  imDependencies: _dependenciesImGenerated.imDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  matrixFromColumnsDependencies: _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  qrDependencies: _dependenciesQrGenerated.qrDependencies,
+  reDependencies: _dependenciesReGenerated.reDependencies,
+  sinDependencies: _dependenciesSinGenerated.sinDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  usolveDependencies: _dependenciesUsolveGenerated.usolveDependencies,
+  usolveAllDependencies: _dependenciesUsolveAllGenerated.usolveAllDependencies,
+  createEigs: _factoriesAny.createEigs
+};
+exports.eigsDependencies = eigsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectricConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectricConstant.generated.js
new file mode 100644
index 0000000..b18ec02
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectricConstant.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.electricConstantDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var electricConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createElectricConstant: _factoriesAny.createElectricConstant
+};
+exports.electricConstantDependencies = electricConstantDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectronMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectronMass.generated.js
new file mode 100644
index 0000000..97fbcd5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectronMass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.electronMassDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var electronMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createElectronMass: _factoriesAny.createElectronMass
+};
+exports.electronMassDependencies = electronMassDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElementaryCharge.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
new file mode 100644
index 0000000..b587517
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.elementaryChargeDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var elementaryChargeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createElementaryCharge: _factoriesAny.createElementaryCharge
+};
+exports.elementaryChargeDependencies = elementaryChargeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqual.generated.js
new file mode 100644
index 0000000..b628a49
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqual.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var equalDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqual: _factoriesAny.createEqual
+};
+exports.equalDependencies = equalDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..8af3926
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualScalar.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalScalarDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var equalScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualScalar: _factoriesAny.createEqualScalar
+};
+exports.equalScalarDependencies = equalScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..e0485c8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualText.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalTextDependencies = void 0;
+
+var _dependenciesCompareTextGenerated = require("./dependenciesCompareText.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var equalTextDependencies = {
+  compareTextDependencies: _dependenciesCompareTextGenerated.compareTextDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualText: _factoriesAny.createEqualText
+};
+exports.equalTextDependencies = equalTextDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesErf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesErf.generated.js
new file mode 100644
index 0000000..9a58efe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesErf.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.erfDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var erfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createErf: _factoriesAny.createErf
+};
+exports.erfDependencies = erfDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..6337b05
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEvaluate.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.evaluateDependencies = void 0;
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var evaluateDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEvaluate: _factoriesAny.createEvaluate
+};
+exports.evaluateDependencies = evaluateDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExp.generated.js
new file mode 100644
index 0000000..29996eb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExp.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var expDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExp: _factoriesAny.createExp
+};
+exports.expDependencies = expDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm.generated.js
new file mode 100644
index 0000000..65b2e93
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expmDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var expmDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExpm: _factoriesAny.createExpm
+};
+exports.expmDependencies = expmDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..1d920ce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm1.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expm1Dependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var expm1Dependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExpm1: _factoriesAny.createExpm1
+};
+exports.expm1Dependencies = expm1Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..c499700
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFactorial.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.factorialDependencies = void 0;
+
+var _dependenciesGammaGenerated = require("./dependenciesGamma.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var factorialDependencies = {
+  gammaDependencies: _dependenciesGammaGenerated.gammaDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFactorial: _factoriesAny.createFactorial
+};
+exports.factorialDependencies = factorialDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFalse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFalse.generated.js
new file mode 100644
index 0000000..5d39594
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFalse.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.falseDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var falseDependencies = {
+  createFalse: _factoriesAny.createFalse
+};
+exports.falseDependencies = falseDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFaraday.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFaraday.generated.js
new file mode 100644
index 0000000..3870ba4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFaraday.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.faradayDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var faradayDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createFaraday: _factoriesAny.createFaraday
+};
+exports.faradayDependencies = faradayDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFermiCoupling.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
new file mode 100644
index 0000000..e3ca67d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fermiCouplingDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var fermiCouplingDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createFermiCoupling: _factoriesAny.createFermiCoupling
+};
+exports.fermiCouplingDependencies = fermiCouplingDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
new file mode 100644
index 0000000..28638b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FibonacciHeapDependencies = void 0;
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var FibonacciHeapDependencies = {
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  createFibonacciHeapClass: _factoriesAny.createFibonacciHeapClass
+};
+exports.FibonacciHeapDependencies = FibonacciHeapDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilter.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilter.generated.js
new file mode 100644
index 0000000..b3f6aa1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilter.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var filterDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilter: _factoriesAny.createFilter
+};
+exports.filterDependencies = filterDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..2c33ac6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilterTransform.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterTransformDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var filterTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilterTransform: _factoriesAny.createFilterTransform
+};
+exports.filterTransformDependencies = filterTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFineStructure.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFineStructure.generated.js
new file mode 100644
index 0000000..5348024
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFineStructure.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fineStructureDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var fineStructureDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createFineStructure: _factoriesAny.createFineStructure
+};
+exports.fineStructureDependencies = fineStructureDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFirstRadiation.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
new file mode 100644
index 0000000..37142b0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.firstRadiationDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var firstRadiationDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createFirstRadiation: _factoriesAny.createFirstRadiation
+};
+exports.firstRadiationDependencies = firstRadiationDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFix.generated.js
new file mode 100644
index 0000000..b654d82
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFix.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fixDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesCeilGenerated = require("./dependenciesCeil.generated.js");
+
+var _dependenciesFloorGenerated = require("./dependenciesFloor.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var fixDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  ceilDependencies: _dependenciesCeilGenerated.ceilDependencies,
+  floorDependencies: _dependenciesFloorGenerated.floorDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFix: _factoriesAny.createFix
+};
+exports.fixDependencies = fixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFlatten.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFlatten.generated.js
new file mode 100644
index 0000000..575afcd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFlatten.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.flattenDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var flattenDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFlatten: _factoriesAny.createFlatten
+};
+exports.flattenDependencies = flattenDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFloor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFloor.generated.js
new file mode 100644
index 0000000..295a16f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFloor.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.floorDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var floorDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFloor: _factoriesAny.createFloor
+};
+exports.floorDependencies = floorDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEach.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEach.generated.js
new file mode 100644
index 0000000..5352f7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEach.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var forEachDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEach: _factoriesAny.createForEach
+};
+exports.forEachDependencies = forEachDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..cd8b338
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEachTransform.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachTransformDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var forEachTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEachTransform: _factoriesAny.createForEachTransform
+};
+exports.forEachTransformDependencies = forEachTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFormat.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFormat.generated.js
new file mode 100644
index 0000000..a166ebd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFormat.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.formatDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var formatDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFormat: _factoriesAny.createFormat
+};
+exports.formatDependencies = formatDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFraction.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFraction.generated.js
new file mode 100644
index 0000000..21e97ce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFraction.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fractionDependencies = void 0;
+
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var fractionDependencies = {
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFraction: _factoriesAny.createFraction
+};
+exports.fractionDependencies = fractionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFractionClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFractionClass.generated.js
new file mode 100644
index 0000000..2419f87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFractionClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FractionDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var FractionDependencies = {
+  createFractionClass: _factoriesAny.createFractionClass
+};
+exports.FractionDependencies = FractionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..072c06c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionAssignmentNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var FunctionAssignmentNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFunctionAssignmentNode: _factoriesAny.createFunctionAssignmentNode
+};
+exports.FunctionAssignmentNodeDependencies = FunctionAssignmentNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..f4f1389
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var FunctionNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  createFunctionNode: _factoriesAny.createFunctionNode
+};
+exports.FunctionNodeDependencies = FunctionNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGamma.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGamma.generated.js
new file mode 100644
index 0000000..335a964
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGamma.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var gammaDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGamma: _factoriesAny.createGamma
+};
+exports.gammaDependencies = gammaDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGasConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGasConstant.generated.js
new file mode 100644
index 0000000..109488e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGasConstant.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gasConstantDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var gasConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createGasConstant: _factoriesAny.createGasConstant
+};
+exports.gasConstantDependencies = gasConstantDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGcd.generated.js
new file mode 100644
index 0000000..72c9221
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGcd.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gcdDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var gcdDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGcd: _factoriesAny.createGcd
+};
+exports.gcdDependencies = gcdDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
new file mode 100644
index 0000000..748453e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getMatrixDataTypeDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var getMatrixDataTypeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGetMatrixDataType: _factoriesAny.createGetMatrixDataType
+};
+exports.getMatrixDataTypeDependencies = getMatrixDataTypeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravitationConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
new file mode 100644
index 0000000..7b9cde4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gravitationConstantDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var gravitationConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createGravitationConstant: _factoriesAny.createGravitationConstant
+};
+exports.gravitationConstantDependencies = gravitationConstantDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravity.generated.js
new file mode 100644
index 0000000..a55569c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravity.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gravityDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var gravityDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createGravity: _factoriesAny.createGravity
+};
+exports.gravityDependencies = gravityDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
new file mode 100644
index 0000000..009f7f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hartreeEnergyDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var hartreeEnergyDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createHartreeEnergy: _factoriesAny.createHartreeEnergy
+};
+exports.hartreeEnergyDependencies = hartreeEnergyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..48ac28d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hasNumericValueDependencies = void 0;
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var hasNumericValueDependencies = {
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHasNumericValue: _factoriesAny.createHasNumericValue
+};
+exports.hasNumericValueDependencies = hasNumericValueDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelp.generated.js
new file mode 100644
index 0000000..6d1d076
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelp.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.helpDependencies = void 0;
+
+var _dependenciesHelpClassGenerated = require("./dependenciesHelpClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var helpDependencies = {
+  HelpDependencies: _dependenciesHelpClassGenerated.HelpDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHelp: _factoriesAny.createHelp
+};
+exports.helpDependencies = helpDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..0186f9f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelpClass.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.HelpDependencies = void 0;
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var HelpDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  createHelpClass: _factoriesAny.createHelpClass
+};
+exports.HelpDependencies = HelpDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHex.generated.js
new file mode 100644
index 0000000..edb7289
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHex.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hexDependencies = void 0;
+
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var hexDependencies = {
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHex: _factoriesAny.createHex
+};
+exports.hexDependencies = hexDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHypot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHypot.generated.js
new file mode 100644
index 0000000..0a498f9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHypot.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hypotDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var hypotDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHypot: _factoriesAny.createHypot
+};
+exports.hypotDependencies = hypotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesI.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesI.generated.js
new file mode 100644
index 0000000..02c2475
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesI.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.iDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var iDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  createI: _factoriesAny.createI
+};
+exports.iDependencies = iDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIdentity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIdentity.generated.js
new file mode 100644
index 0000000..81ab585
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIdentity.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.identityDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var identityDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIdentity: _factoriesAny.createIdentity
+};
+exports.identityDependencies = identityDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIm.generated.js
new file mode 100644
index 0000000..ca101b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIm.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.imDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var imDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIm: _factoriesAny.createIm
+};
+exports.imDependencies = imDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
new file mode 100644
index 0000000..fab70a4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ImmutableDenseMatrixDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ImmutableDenseMatrixDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  createImmutableDenseMatrixClass: _factoriesAny.createImmutableDenseMatrixClass
+};
+exports.ImmutableDenseMatrixDependencies = ImmutableDenseMatrixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndex.generated.js
new file mode 100644
index 0000000..d0286c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndex.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var indexDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIndex: _factoriesAny.createIndex
+};
+exports.indexDependencies = indexDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexClass.generated.js
new file mode 100644
index 0000000..bd6ee9a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexClass.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexDependencies = void 0;
+
+var _dependenciesImmutableDenseMatrixClassGenerated = require("./dependenciesImmutableDenseMatrixClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var IndexDependencies = {
+  ImmutableDenseMatrixDependencies: _dependenciesImmutableDenseMatrixClassGenerated.ImmutableDenseMatrixDependencies,
+  createIndexClass: _factoriesAny.createIndexClass
+};
+exports.IndexDependencies = IndexDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..02e2c31
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexNode.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesRangeClassGenerated = require("./dependenciesRangeClass.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var IndexNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  RangeDependencies: _dependenciesRangeClassGenerated.RangeDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  createIndexNode: _factoriesAny.createIndexNode
+};
+exports.IndexNodeDependencies = IndexNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexTransform.generated.js
new file mode 100644
index 0000000..e29c178
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexTransform.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexTransformDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var indexTransformDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  createIndexTransform: _factoriesAny.createIndexTransform
+};
+exports.indexTransformDependencies = indexTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..1ad9428
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInfinity.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.InfinityDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var InfinityDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createInfinity: _factoriesAny.createInfinity
+};
+exports.InfinityDependencies = InfinityDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIntersect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIntersect.generated.js
new file mode 100644
index 0000000..44bc607
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIntersect.generated.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.intersectDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var intersectDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIntersect: _factoriesAny.createIntersect
+};
+exports.intersectDependencies = intersectDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInv.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInv.generated.js
new file mode 100644
index 0000000..aedfc65
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInv.generated.js
@@ -0,0 +1,44 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDetGenerated = require("./dependenciesDet.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var invDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  detDependencies: _dependenciesDetGenerated.detDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createInv: _factoriesAny.createInv
+};
+exports.invDependencies = invDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
new file mode 100644
index 0000000..7b93812
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.inverseConductanceQuantumDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var inverseConductanceQuantumDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createInverseConductanceQuantum: _factoriesAny.createInverseConductanceQuantum
+};
+exports.inverseConductanceQuantumDependencies = inverseConductanceQuantumDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInvmod.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInvmod.generated.js
new file mode 100644
index 0000000..3c14b51
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInvmod.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invmodDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesModGenerated = require("./dependenciesMod.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesXgcdGenerated = require("./dependenciesXgcd.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var invmodDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  modDependencies: _dependenciesModGenerated.modDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  xgcdDependencies: _dependenciesXgcdGenerated.xgcdDependencies,
+  createInvmod: _factoriesAny.createInvmod
+};
+exports.invmodDependencies = invmodDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..ec69948
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsInteger.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isIntegerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsInteger: _factoriesAny.createIsInteger
+};
+exports.isIntegerDependencies = isIntegerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..0600369
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNaN.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNaNDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isNaNDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNaN: _factoriesAny.createIsNaN
+};
+exports.isNaNDependencies = isNaNDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..9954c51
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNegative.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNegativeDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isNegativeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNegative: _factoriesAny.createIsNegative
+};
+exports.isNegativeDependencies = isNegativeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..cfeed25
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNumeric.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNumericDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isNumericDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNumeric: _factoriesAny.createIsNumeric
+};
+exports.isNumericDependencies = isNumericDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..0d8cf71
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPositive.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPositiveDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isPositiveDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPositive: _factoriesAny.createIsPositive
+};
+exports.isPositiveDependencies = isPositiveDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..4711144
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPrime.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPrimeDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isPrimeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPrime: _factoriesAny.createIsPrime
+};
+exports.isPrimeDependencies = isPrimeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..794e64f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsZero.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isZeroDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isZeroDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsZero: _factoriesAny.createIsZero
+};
+exports.isZeroDependencies = isZeroDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKldivergence.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKldivergence.generated.js
new file mode 100644
index 0000000..8be26c6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKldivergence.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kldivergenceDependencies = void 0;
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesDotDivideGenerated = require("./dependenciesDotDivide.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesLogGenerated = require("./dependenciesLog.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSumGenerated = require("./dependenciesSum.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var kldivergenceDependencies = {
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  logDependencies: _dependenciesLogGenerated.logDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  sumDependencies: _dependenciesSumGenerated.sumDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createKldivergence: _factoriesAny.createKldivergence
+};
+exports.kldivergenceDependencies = kldivergenceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKlitzing.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKlitzing.generated.js
new file mode 100644
index 0000000..7330811
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKlitzing.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.klitzingDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var klitzingDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createKlitzing: _factoriesAny.createKlitzing
+};
+exports.klitzingDependencies = klitzingDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKron.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKron.generated.js
new file mode 100644
index 0000000..2cb7873
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKron.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kronDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var kronDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createKron: _factoriesAny.createKron
+};
+exports.kronDependencies = kronDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN10.generated.js
new file mode 100644
index 0000000..bcedcd7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN10.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN10Dependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LN10Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLN10: _factoriesAny.createLN10
+};
+exports.LN10Dependencies = LN10Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN2.generated.js
new file mode 100644
index 0000000..d34343d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN2.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN2Dependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LN2Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLN2: _factoriesAny.createLN2
+};
+exports.LN2Dependencies = LN2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..76dd6bf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG10E.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG10EDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LOG10EDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLOG10E: _factoriesAny.createLOG10E
+};
+exports.LOG10EDependencies = LOG10EDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..4d89522
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG2E.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG2EDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LOG2EDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLOG2E: _factoriesAny.createLOG2E
+};
+exports.LOG2EDependencies = LOG2EDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLarger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLarger.generated.js
new file mode 100644
index 0000000..d636f2e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLarger.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var largerDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLarger: _factoriesAny.createLarger
+};
+exports.largerDependencies = largerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..1428eab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLargerEq.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerEqDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var largerEqDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLargerEq: _factoriesAny.createLargerEq
+};
+exports.largerEqDependencies = largerEqDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLcm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLcm.generated.js
new file mode 100644
index 0000000..367ab07
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLcm.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lcmDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var lcmDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLcm: _factoriesAny.createLcm
+};
+exports.lcmDependencies = lcmDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeafCount.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeafCount.generated.js
new file mode 100644
index 0000000..cc8e1a2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeafCount.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leafCountDependencies = void 0;
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var leafCountDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLeafCount: _factoriesAny.createLeafCount
+};
+exports.leafCountDependencies = leafCountDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..4ebb02a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeftShift.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leftShiftDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var leftShiftDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createLeftShift: _factoriesAny.createLeftShift
+};
+exports.leftShiftDependencies = leftShiftDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog.generated.js
new file mode 100644
index 0000000..5394a3e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.logDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var logDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog: _factoriesAny.createLog
+};
+exports.logDependencies = logDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog10.generated.js
new file mode 100644
index 0000000..8ed45ac
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog10.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log10Dependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var log10Dependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog10: _factoriesAny.createLog10
+};
+exports.log10Dependencies = log10Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..010e829
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog1p.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log1pDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesLogGenerated = require("./dependenciesLog.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var log1pDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  logDependencies: _dependenciesLogGenerated.logDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog1p: _factoriesAny.createLog1p
+};
+exports.log1pDependencies = log1pDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog2.generated.js
new file mode 100644
index 0000000..e8540ed
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog2.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log2Dependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var log2Dependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog2: _factoriesAny.createLog2
+};
+exports.log2Dependencies = log2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLoschmidt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLoschmidt.generated.js
new file mode 100644
index 0000000..6671c65
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLoschmidt.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.loschmidtDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var loschmidtDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createLoschmidt: _factoriesAny.createLoschmidt
+};
+exports.loschmidtDependencies = loschmidtDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolve.generated.js
new file mode 100644
index 0000000..3ce24df
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolve.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var lsolveDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLsolve: _factoriesAny.createLsolve
+};
+exports.lsolveDependencies = lsolveDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolveAll.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolveAll.generated.js
new file mode 100644
index 0000000..1455bc0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolveAll.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveAllDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var lsolveAllDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLsolveAll: _factoriesAny.createLsolveAll
+};
+exports.lsolveAllDependencies = lsolveAllDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLup.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLup.generated.js
new file mode 100644
index 0000000..52a1c83
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLup.generated.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lupDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesSpaClassGenerated = require("./dependenciesSpaClass.generated.js");
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var lupDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SpaDependencies: _dependenciesSpaClassGenerated.SpaDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createLup: _factoriesAny.createLup
+};
+exports.lupDependencies = lupDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLusolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLusolve.generated.js
new file mode 100644
index 0000000..82cdfa0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLusolve.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lusolveDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesLsolveGenerated = require("./dependenciesLsolve.generated.js");
+
+var _dependenciesLupGenerated = require("./dependenciesLup.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesSluGenerated = require("./dependenciesSlu.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUsolveGenerated = require("./dependenciesUsolve.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var lusolveDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  lsolveDependencies: _dependenciesLsolveGenerated.lsolveDependencies,
+  lupDependencies: _dependenciesLupGenerated.lupDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sluDependencies: _dependenciesSluGenerated.sluDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  usolveDependencies: _dependenciesUsolveGenerated.usolveDependencies,
+  createLusolve: _factoriesAny.createLusolve
+};
+exports.lusolveDependencies = lusolveDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMad.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMad.generated.js
new file mode 100644
index 0000000..1d7c2ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMad.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.madDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+
+var _dependenciesMedianGenerated = require("./dependenciesMedian.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var madDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  medianDependencies: _dependenciesMedianGenerated.medianDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMad: _factoriesAny.createMad
+};
+exports.madDependencies = madDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
new file mode 100644
index 0000000..d53d500
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.magneticConstantDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var magneticConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMagneticConstant: _factoriesAny.createMagneticConstant
+};
+exports.magneticConstantDependencies = magneticConstantDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
new file mode 100644
index 0000000..f50892b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.magneticFluxQuantumDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var magneticFluxQuantumDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMagneticFluxQuantum: _factoriesAny.createMagneticFluxQuantum
+};
+exports.magneticFluxQuantumDependencies = magneticFluxQuantumDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMap.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMap.generated.js
new file mode 100644
index 0000000..585531f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMap.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var mapDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMap: _factoriesAny.createMap
+};
+exports.mapDependencies = mapDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..d35ee50
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapTransform.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapTransformDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var mapTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapTransform: _factoriesAny.createMapTransform
+};
+exports.mapTransformDependencies = mapTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..73bb647
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrix.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesMatrixClassGenerated = require("./dependenciesMatrixClass.generated.js");
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var matrixDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrix: _factoriesAny.createMatrix
+};
+exports.matrixDependencies = matrixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixClass.generated.js
new file mode 100644
index 0000000..73d136c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.MatrixDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var MatrixDependencies = {
+  createMatrixClass: _factoriesAny.createMatrixClass
+};
+exports.MatrixDependencies = MatrixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
new file mode 100644
index 0000000..05acfc7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromColumnsDependencies = void 0;
+
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var matrixFromColumnsDependencies = {
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrixFromColumns: _factoriesAny.createMatrixFromColumns
+};
+exports.matrixFromColumnsDependencies = matrixFromColumnsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
new file mode 100644
index 0000000..ff6c70a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromFunctionDependencies = void 0;
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var matrixFromFunctionDependencies = {
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrixFromFunction: _factoriesAny.createMatrixFromFunction
+};
+exports.matrixFromFunctionDependencies = matrixFromFunctionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
new file mode 100644
index 0000000..ef50d9b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromRowsDependencies = void 0;
+
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var matrixFromRowsDependencies = {
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrixFromRows: _factoriesAny.createMatrixFromRows
+};
+exports.matrixFromRowsDependencies = matrixFromRowsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMax.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMax.generated.js
new file mode 100644
index 0000000..21ab68a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMax.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxDependencies = void 0;
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var maxDependencies = {
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMax: _factoriesAny.createMax
+};
+exports.maxDependencies = maxDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..4c6d5dd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMaxTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxTransformDependencies = void 0;
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var maxTransformDependencies = {
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMaxTransform: _factoriesAny.createMaxTransform
+};
+exports.maxTransformDependencies = maxTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMean.generated.js
new file mode 100644
index 0000000..7eb01a7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMean.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var meanDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMean: _factoriesAny.createMean
+};
+exports.meanDependencies = meanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..5b5e6e7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMeanTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var meanTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMeanTransform: _factoriesAny.createMeanTransform
+};
+exports.meanTransformDependencies = meanTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMedian.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMedian.generated.js
new file mode 100644
index 0000000..1bcaec0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMedian.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.medianDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var medianDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMedian: _factoriesAny.createMedian
+};
+exports.medianDependencies = medianDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMin.generated.js
new file mode 100644
index 0000000..b6c1d45
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMin.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minDependencies = void 0;
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var minDependencies = {
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMin: _factoriesAny.createMin
+};
+exports.minDependencies = minDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..9bc5e37
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMinTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minTransformDependencies = void 0;
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var minTransformDependencies = {
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMinTransform: _factoriesAny.createMinTransform
+};
+exports.minTransformDependencies = minTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMod.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMod.generated.js
new file mode 100644
index 0000000..b75b1a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMod.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var modDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMod: _factoriesAny.createMod
+};
+exports.modDependencies = modDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMode.generated.js
new file mode 100644
index 0000000..ad9e8ae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMode.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modeDependencies = void 0;
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var modeDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMode: _factoriesAny.createMode
+};
+exports.modeDependencies = modeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMass.generated.js
new file mode 100644
index 0000000..0109eed
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarMassDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var molarMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarMass: _factoriesAny.createMolarMass
+};
+exports.molarMassDependencies = molarMassDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMassC12.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
new file mode 100644
index 0000000..a139f92
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarMassC12Dependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var molarMassC12Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarMassC12: _factoriesAny.createMolarMassC12
+};
+exports.molarMassC12Dependencies = molarMassC12Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
new file mode 100644
index 0000000..b7d9f3f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarPlanckConstantDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var molarPlanckConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarPlanckConstant: _factoriesAny.createMolarPlanckConstant
+};
+exports.molarPlanckConstantDependencies = molarPlanckConstantDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarVolume.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarVolume.generated.js
new file mode 100644
index 0000000..8689230
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarVolume.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarVolumeDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var molarVolumeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarVolume: _factoriesAny.createMolarVolume
+};
+exports.molarVolumeDependencies = molarVolumeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..26bfc89
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultinomial.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multinomialDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var multinomialDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultinomial: _factoriesAny.createMultinomial
+};
+exports.multinomialDependencies = multinomialDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..700528d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiply.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDotGenerated = require("./dependenciesDot.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var multiplyDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  dotDependencies: _dependenciesDotGenerated.dotDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiply: _factoriesAny.createMultiply
+};
+exports.multiplyDependencies = multiplyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..f96493f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyScalarDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var multiplyScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiplyScalar: _factoriesAny.createMultiplyScalar
+};
+exports.multiplyScalarDependencies = multiplyScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNaN.generated.js
new file mode 100644
index 0000000..4f48baa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNaN.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NaNDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var NaNDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createNaN: _factoriesAny.createNaN
+};
+exports.NaNDependencies = NaNDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNeutronMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNeutronMass.generated.js
new file mode 100644
index 0000000..35cc765
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNeutronMass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.neutronMassDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var neutronMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createNeutronMass: _factoriesAny.createNeutronMass
+};
+exports.neutronMassDependencies = neutronMassDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNode.generated.js
new file mode 100644
index 0000000..0c29ac9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NodeDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var NodeDependencies = {
+  createNode: _factoriesAny.createNode
+};
+exports.NodeDependencies = NodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNorm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNorm.generated.js
new file mode 100644
index 0000000..2f35b7b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNorm.generated.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.normDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+
+var _dependenciesCtransposeGenerated = require("./dependenciesCtranspose.generated.js");
+
+var _dependenciesEigsGenerated = require("./dependenciesEigs.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var normDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  ctransposeDependencies: _dependenciesCtransposeGenerated.ctransposeDependencies,
+  eigsDependencies: _dependenciesEigsGenerated.eigsDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNorm: _factoriesAny.createNorm
+};
+exports.normDependencies = normDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNot.generated.js
new file mode 100644
index 0000000..253fcf9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNot.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.notDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var notDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNot: _factoriesAny.createNot
+};
+exports.notDependencies = notDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..ed1de9c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoot.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var nthRootDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNthRoot: _factoriesAny.createNthRoot
+};
+exports.nthRootDependencies = nthRootDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoots.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoots.generated.js
new file mode 100644
index 0000000..acd910d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoots.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootsDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var nthRootsDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNthRoots: _factoriesAny.createNthRoots
+};
+exports.nthRootsDependencies = nthRootsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
new file mode 100644
index 0000000..c5f9000
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nuclearMagnetonDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var nuclearMagnetonDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createNuclearMagneton: _factoriesAny.createNuclearMagneton
+};
+exports.nuclearMagnetonDependencies = nuclearMagnetonDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNull.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNull.generated.js
new file mode 100644
index 0000000..83cd09d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNull.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var nullDependencies = {
+  createNull: _factoriesAny.createNull
+};
+exports.nullDependencies = nullDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumber.generated.js
new file mode 100644
index 0000000..021ce86
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumber.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numberDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var numberDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNumber: _factoriesAny.createNumber
+};
+exports.numberDependencies = numberDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..4e1396b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumeric.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numericDependencies = void 0;
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var numericDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  createNumeric: _factoriesAny.createNumeric
+};
+exports.numericDependencies = numericDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..93d894f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesObjectNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ObjectNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ObjectNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createObjectNode: _factoriesAny.createObjectNode
+};
+exports.ObjectNodeDependencies = ObjectNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOct.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOct.generated.js
new file mode 100644
index 0000000..389da11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOct.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.octDependencies = void 0;
+
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var octDependencies = {
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOct: _factoriesAny.createOct
+};
+exports.octDependencies = octDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOnes.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOnes.generated.js
new file mode 100644
index 0000000..390f034
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOnes.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.onesDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var onesDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOnes: _factoriesAny.createOnes
+};
+exports.onesDependencies = onesDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..3a808d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOperatorNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.OperatorNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var OperatorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createOperatorNode: _factoriesAny.createOperatorNode
+};
+exports.OperatorNodeDependencies = OperatorNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOr.generated.js
new file mode 100644
index 0000000..0708832
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOr.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.orDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var orDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOr: _factoriesAny.createOr
+};
+exports.orDependencies = orDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..2c98aed
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParenthesisNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ParenthesisNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createParenthesisNode: _factoriesAny.createParenthesisNode
+};
+exports.ParenthesisNodeDependencies = ParenthesisNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParse.generated.js
new file mode 100644
index 0000000..dd6f7f2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParse.generated.js
@@ -0,0 +1,68 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parseDependencies = void 0;
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesAssignmentNode.generated.js");
+
+var _dependenciesBlockNodeGenerated = require("./dependenciesBlockNode.generated.js");
+
+var _dependenciesConditionalNodeGenerated = require("./dependenciesConditionalNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesFunctionAssignmentNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesRangeNodeGenerated = require("./dependenciesRangeNode.generated.js");
+
+var _dependenciesRelationalNodeGenerated = require("./dependenciesRelationalNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var parseDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  AssignmentNodeDependencies: _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies,
+  BlockNodeDependencies: _dependenciesBlockNodeGenerated.BlockNodeDependencies,
+  ConditionalNodeDependencies: _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies: _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  RangeNodeDependencies: _dependenciesRangeNodeGenerated.RangeNodeDependencies,
+  RelationalNodeDependencies: _dependenciesRelationalNodeGenerated.RelationalNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParse: _factoriesAny.createParse
+};
+exports.parseDependencies = parseDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParser.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParser.generated.js
new file mode 100644
index 0000000..e9c7a49
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParser.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parserDependencies = void 0;
+
+var _dependenciesParserClassGenerated = require("./dependenciesParserClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var parserDependencies = {
+  ParserDependencies: _dependenciesParserClassGenerated.ParserDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParser: _factoriesAny.createParser
+};
+exports.parserDependencies = parserDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..24bd907
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParserClass.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParserDependencies = void 0;
+
+var _dependenciesEvaluateGenerated = require("./dependenciesEvaluate.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ParserDependencies = {
+  evaluateDependencies: _dependenciesEvaluateGenerated.evaluateDependencies,
+  createParserClass: _factoriesAny.createParserClass
+};
+exports.ParserDependencies = ParserDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..cbef148
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.partitionSelectDependencies = void 0;
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var partitionSelectDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPartitionSelect: _factoriesAny.createPartitionSelect
+};
+exports.partitionSelectDependencies = partitionSelectDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..20cbb00
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPermutations.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.permutationsDependencies = void 0;
+
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var permutationsDependencies = {
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPermutations: _factoriesAny.createPermutations
+};
+exports.permutationsDependencies = permutationsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPhi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPhi.generated.js
new file mode 100644
index 0000000..e198817
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPhi.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.phiDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var phiDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createPhi: _factoriesAny.createPhi
+};
+exports.phiDependencies = phiDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPi.generated.js
new file mode 100644
index 0000000..06efc69
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPi.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.piDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var piDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createPi: _factoriesAny.createPi
+};
+exports.piDependencies = piDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..cb19aa2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPickRandom.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pickRandomDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var pickRandomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPickRandom: _factoriesAny.createPickRandom
+};
+exports.pickRandomDependencies = pickRandomDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckCharge.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
new file mode 100644
index 0000000..0afda89
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckChargeDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var planckChargeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckCharge: _factoriesAny.createPlanckCharge
+};
+exports.planckChargeDependencies = planckChargeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
new file mode 100644
index 0000000..a4a8abd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckConstantDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var planckConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckConstant: _factoriesAny.createPlanckConstant
+};
+exports.planckConstantDependencies = planckConstantDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckLength.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckLength.generated.js
new file mode 100644
index 0000000..2d26b59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckLength.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckLengthDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var planckLengthDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckLength: _factoriesAny.createPlanckLength
+};
+exports.planckLengthDependencies = planckLengthDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckMass.generated.js
new file mode 100644
index 0000000..10cae99
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckMass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckMassDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var planckMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckMass: _factoriesAny.createPlanckMass
+};
+exports.planckMassDependencies = planckMassDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
new file mode 100644
index 0000000..9d3b1b2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckTemperatureDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var planckTemperatureDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckTemperature: _factoriesAny.createPlanckTemperature
+};
+exports.planckTemperatureDependencies = planckTemperatureDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTime.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTime.generated.js
new file mode 100644
index 0000000..71f2689
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTime.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckTimeDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var planckTimeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckTime: _factoriesAny.createPlanckTime
+};
+exports.planckTimeDependencies = planckTimeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPow.generated.js
new file mode 100644
index 0000000..5a6cf6a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPow.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.powDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var powDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPow: _factoriesAny.createPow
+};
+exports.powDependencies = powDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrint.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrint.generated.js
new file mode 100644
index 0000000..604ba77
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrint.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var printDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPrint: _factoriesAny.createPrint
+};
+exports.printDependencies = printDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProd.generated.js
new file mode 100644
index 0000000..3fcfdaf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProd.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.prodDependencies = void 0;
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var prodDependencies = {
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createProd: _factoriesAny.createProd
+};
+exports.prodDependencies = prodDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProtonMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProtonMass.generated.js
new file mode 100644
index 0000000..74b96e1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProtonMass.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.protonMassDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var protonMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createProtonMass: _factoriesAny.createProtonMass
+};
+exports.protonMassDependencies = protonMassDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQr.generated.js
new file mode 100644
index 0000000..0d1cdeb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQr.generated.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.qrDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesComplexGenerated = require("./dependenciesComplex.generated.js");
+
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSignGenerated = require("./dependenciesSign.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var qrDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  complexDependencies: _dependenciesComplexGenerated.complexDependencies,
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  signDependencies: _dependenciesSignGenerated.signDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createQr: _factoriesAny.createQr
+};
+exports.qrDependencies = qrDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..1ea717c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantileSeqDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var quantileSeqDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createQuantileSeq: _factoriesAny.createQuantileSeq
+};
+exports.quantileSeqDependencies = quantileSeqDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
new file mode 100644
index 0000000..c56dc12
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantumOfCirculationDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var quantumOfCirculationDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createQuantumOfCirculation: _factoriesAny.createQuantumOfCirculation
+};
+exports.quantumOfCirculationDependencies = quantumOfCirculationDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandom.generated.js
new file mode 100644
index 0000000..ee5d73e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandom.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var randomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandom: _factoriesAny.createRandom
+};
+exports.randomDependencies = randomDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..5a29464
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandomInt.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomIntDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var randomIntDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandomInt: _factoriesAny.createRandomInt
+};
+exports.randomIntDependencies = randomIntDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRange.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRange.generated.js
new file mode 100644
index 0000000..928a523
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRange.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeDependencies = void 0;
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rangeDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRange: _factoriesAny.createRange
+};
+exports.rangeDependencies = rangeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..8d29909
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var RangeDependencies = {
+  createRangeClass: _factoriesAny.createRangeClass
+};
+exports.RangeDependencies = RangeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..b587b79
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var RangeNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRangeNode: _factoriesAny.createRangeNode
+};
+exports.RangeNodeDependencies = RangeNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..41b360e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeTransform.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeTransformDependencies = void 0;
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rangeTransformDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRangeTransform: _factoriesAny.createRangeTransform
+};
+exports.rangeTransformDependencies = rangeTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..05dbb7d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRationalize.generated.js
@@ -0,0 +1,86 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rationalizeDependencies = void 0;
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rationalizeDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRationalize: _factoriesAny.createRationalize
+};
+exports.rationalizeDependencies = rationalizeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRe.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRe.generated.js
new file mode 100644
index 0000000..3d153ea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRe.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var reDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRe: _factoriesAny.createRe
+};
+exports.reDependencies = reDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
new file mode 100644
index 0000000..26d3a34
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reducedPlanckConstantDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var reducedPlanckConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createReducedPlanckConstant: _factoriesAny.createReducedPlanckConstant
+};
+exports.reducedPlanckConstantDependencies = reducedPlanckConstantDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..e93a329
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRelationalNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RelationalNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var RelationalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRelationalNode: _factoriesAny.createRelationalNode
+};
+exports.RelationalNodeDependencies = RelationalNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..28f85cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReplacer.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.replacerDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var replacerDependencies = {
+  createReplacer: _factoriesAny.createReplacer
+};
+exports.replacerDependencies = replacerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReshape.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReshape.generated.js
new file mode 100644
index 0000000..9e32b69
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReshape.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reshapeDependencies = void 0;
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var reshapeDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createReshape: _factoriesAny.createReshape
+};
+exports.reshapeDependencies = reshapeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResize.generated.js
new file mode 100644
index 0000000..d41f97f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResize.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resizeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var resizeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  createResize: _factoriesAny.createResize
+};
+exports.resizeDependencies = resizeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResolve.generated.js
new file mode 100644
index 0000000..eb1bdbd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResolve.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resolveDependencies = void 0;
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var resolveDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  createResolve: _factoriesAny.createResolve
+};
+exports.resolveDependencies = resolveDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..cdb14a0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResultSet.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ResultSetDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ResultSetDependencies = {
+  createResultSet: _factoriesAny.createResultSet
+};
+exports.ResultSetDependencies = ResultSetDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReviver.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReviver.generated.js
new file mode 100644
index 0000000..9f7d464
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReviver.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reviverDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var reviverDependencies = {
+  createReviver: _factoriesAny.createReviver
+};
+exports.reviverDependencies = reviverDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..7285d57
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightArithShift.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightArithShiftDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rightArithShiftDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createRightArithShift: _factoriesAny.createRightArithShift
+};
+exports.rightArithShiftDependencies = rightArithShiftDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..65e620a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightLogShift.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightLogShiftDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rightLogShiftDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createRightLogShift: _factoriesAny.createRightLogShift
+};
+exports.rightLogShiftDependencies = rightLogShiftDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotate.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotate.generated.js
new file mode 100644
index 0000000..abf170b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotate.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotateDependencies = void 0;
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesRotationMatrixGenerated = require("./dependenciesRotationMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rotateDependencies = {
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  rotationMatrixDependencies: _dependenciesRotationMatrixGenerated.rotationMatrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRotate: _factoriesAny.createRotate
+};
+exports.rotateDependencies = rotateDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotationMatrix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
new file mode 100644
index 0000000..26a1d5c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotationMatrixDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesCosGenerated = require("./dependenciesCos.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNormGenerated = require("./dependenciesNorm.generated.js");
+
+var _dependenciesSinGenerated = require("./dependenciesSin.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rotationMatrixDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  cosDependencies: _dependenciesCosGenerated.cosDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  normDependencies: _dependenciesNormGenerated.normDependencies,
+  sinDependencies: _dependenciesSinGenerated.sinDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createRotationMatrix: _factoriesAny.createRotationMatrix
+};
+exports.rotationMatrixDependencies = rotationMatrixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRound.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRound.generated.js
new file mode 100644
index 0000000..ead21c2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRound.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.roundDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var roundDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createRound: _factoriesAny.createRound
+};
+exports.roundDependencies = roundDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRow.generated.js
new file mode 100644
index 0000000..0fc87b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRow.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rowDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rowDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRow: _factoriesAny.createRow
+};
+exports.rowDependencies = rowDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRowTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRowTransform.generated.js
new file mode 100644
index 0000000..aee3707
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRowTransform.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rowTransformDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rowTransformDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRowTransform: _factoriesAny.createRowTransform
+};
+exports.rowTransformDependencies = rowTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRydberg.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRydberg.generated.js
new file mode 100644
index 0000000..8af5c37
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRydberg.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rydbergDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rydbergDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createRydberg: _factoriesAny.createRydberg
+};
+exports.rydbergDependencies = rydbergDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..1c08769
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,22 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT1_2Dependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+// eslint-disable-line camelcase
+var SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createSQRT1_2: _factoriesAny.createSQRT1_2
+};
+exports.SQRT1_2Dependencies = SQRT1_2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..7827f85
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT2.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT2Dependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var SQRT2Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createSQRT2: _factoriesAny.createSQRT2
+};
+exports.SQRT2Dependencies = SQRT2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSackurTetrode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
new file mode 100644
index 0000000..0301ae1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sackurTetrodeDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sackurTetrodeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createSackurTetrode: _factoriesAny.createSackurTetrode
+};
+exports.sackurTetrodeDependencies = sackurTetrodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSec.generated.js
new file mode 100644
index 0000000..d7518e2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSec.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var secDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSec: _factoriesAny.createSec
+};
+exports.secDependencies = secDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSech.generated.js
new file mode 100644
index 0000000..db01650
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSech.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sechDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sechDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSech: _factoriesAny.createSech
+};
+exports.sechDependencies = sechDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSecondRadiation.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
new file mode 100644
index 0000000..70c65b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secondRadiationDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var secondRadiationDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createSecondRadiation: _factoriesAny.createSecondRadiation
+};
+exports.secondRadiationDependencies = secondRadiationDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetCartesian.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetCartesian.generated.js
new file mode 100644
index 0000000..b89ce70
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetCartesian.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setCartesianDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setCartesianDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetCartesian: _factoriesAny.createSetCartesian
+};
+exports.setCartesianDependencies = setCartesianDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDifference.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDifference.generated.js
new file mode 100644
index 0000000..5e0238b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDifference.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDifferenceDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setDifferenceDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetDifference: _factoriesAny.createSetDifference
+};
+exports.setDifferenceDependencies = setDifferenceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDistinct.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDistinct.generated.js
new file mode 100644
index 0000000..496fec3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDistinct.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDistinctDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setDistinctDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetDistinct: _factoriesAny.createSetDistinct
+};
+exports.setDistinctDependencies = setDistinctDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIntersect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIntersect.generated.js
new file mode 100644
index 0000000..2e8ec8e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIntersect.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIntersectDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setIntersectDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetIntersect: _factoriesAny.createSetIntersect
+};
+exports.setIntersectDependencies = setIntersectDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIsSubset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
new file mode 100644
index 0000000..47d663e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIsSubsetDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setIsSubsetDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetIsSubset: _factoriesAny.createSetIsSubset
+};
+exports.setIsSubsetDependencies = setIsSubsetDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
new file mode 100644
index 0000000..11bccf0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setMultiplicityDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setMultiplicityDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetMultiplicity: _factoriesAny.createSetMultiplicity
+};
+exports.setMultiplicityDependencies = setMultiplicityDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetPowerset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetPowerset.generated.js
new file mode 100644
index 0000000..d9cc139
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetPowerset.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setPowersetDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setPowersetDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetPowerset: _factoriesAny.createSetPowerset
+};
+exports.setPowersetDependencies = setPowersetDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSize.generated.js
new file mode 100644
index 0000000..f937cfd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSize.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSizeDependencies = void 0;
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setSizeDependencies = {
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetSize: _factoriesAny.createSetSize
+};
+exports.setSizeDependencies = setSizeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSymDifference.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
new file mode 100644
index 0000000..1a34a1b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSymDifferenceDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+
+var _dependenciesSetDifferenceGenerated = require("./dependenciesSetDifference.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setSymDifferenceDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  setDifferenceDependencies: _dependenciesSetDifferenceGenerated.setDifferenceDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetSymDifference: _factoriesAny.createSetSymDifference
+};
+exports.setSymDifferenceDependencies = setSymDifferenceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetUnion.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetUnion.generated.js
new file mode 100644
index 0000000..3045e73
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetUnion.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setUnionDependencies = void 0;
+
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+
+var _dependenciesSetIntersectGenerated = require("./dependenciesSetIntersect.generated.js");
+
+var _dependenciesSetSymDifferenceGenerated = require("./dependenciesSetSymDifference.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var setUnionDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  setIntersectDependencies: _dependenciesSetIntersectGenerated.setIntersectDependencies,
+  setSymDifferenceDependencies: _dependenciesSetSymDifferenceGenerated.setSymDifferenceDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetUnion: _factoriesAny.createSetUnion
+};
+exports.setUnionDependencies = setUnionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSign.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSign.generated.js
new file mode 100644
index 0000000..abd41de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSign.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.signDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+
+var _dependenciesComplexGenerated = require("./dependenciesComplex.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var signDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  complexDependencies: _dependenciesComplexGenerated.complexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSign: _factoriesAny.createSign
+};
+exports.signDependencies = signDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..9cbfd24
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplify.generated.js
@@ -0,0 +1,86 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyDependencies = void 0;
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesResolveGenerated = require("./dependenciesResolve.generated.js");
+
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var simplifyDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  resolveDependencies: _dependenciesResolveGenerated.resolveDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplify: _factoriesAny.createSimplify
+};
+exports.simplifyDependencies = simplifyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..37a2caf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyCoreDependencies = void 0;
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var simplifyCoreDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  createSimplifyCore: _factoriesAny.createSimplifyCore
+};
+exports.simplifyCoreDependencies = simplifyCoreDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSin.generated.js
new file mode 100644
index 0000000..d916b4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSin.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sinDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSin: _factoriesAny.createSin
+};
+exports.sinDependencies = sinDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSinh.generated.js
new file mode 100644
index 0000000..d7baacc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSinh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinhDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSinh: _factoriesAny.createSinh
+};
+exports.sinhDependencies = sinhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSize.generated.js
new file mode 100644
index 0000000..c1eeaf3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSize.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sizeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sizeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSize: _factoriesAny.createSize
+};
+exports.sizeDependencies = sizeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSlu.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSlu.generated.js
new file mode 100644
index 0000000..a680fb9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSlu.generated.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sluDependencies = void 0;
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTransposeGenerated = require("./dependenciesTranspose.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sluDependencies = {
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSlu: _factoriesAny.createSlu
+};
+exports.sluDependencies = sluDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..4e77098
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmaller.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var smallerDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmaller: _factoriesAny.createSmaller
+};
+exports.smallerDependencies = smallerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..6009be1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmallerEq.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerEqDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var smallerEqDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmallerEq: _factoriesAny.createSmallerEq
+};
+exports.smallerEqDependencies = smallerEqDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSort.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSort.generated.js
new file mode 100644
index 0000000..7e22777
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSort.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sortDependencies = void 0;
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sortDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSort: _factoriesAny.createSort
+};
+exports.sortDependencies = sortDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpaClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpaClass.generated.js
new file mode 100644
index 0000000..6c00ca7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpaClass.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SpaDependencies = void 0;
+
+var _dependenciesFibonacciHeapClassGenerated = require("./dependenciesFibonacciHeapClass.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var SpaDependencies = {
+  FibonacciHeapDependencies: _dependenciesFibonacciHeapClassGenerated.FibonacciHeapDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  createSpaClass: _factoriesAny.createSpaClass
+};
+exports.SpaDependencies = SpaDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparse.generated.js
new file mode 100644
index 0000000..2ea3092
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparse.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sparseDependencies = void 0;
+
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sparseDependencies = {
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSparse: _factoriesAny.createSparse
+};
+exports.sparseDependencies = sparseDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
new file mode 100644
index 0000000..c35f422
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SparseMatrixDependencies = void 0;
+
+var _dependenciesMatrixClassGenerated = require("./dependenciesMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var SparseMatrixDependencies = {
+  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSparseMatrixClass: _factoriesAny.createSparseMatrixClass
+};
+exports.SparseMatrixDependencies = SparseMatrixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
new file mode 100644
index 0000000..a674a53
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.speedOfLightDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var speedOfLightDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createSpeedOfLight: _factoriesAny.createSpeedOfLight
+};
+exports.speedOfLightDependencies = speedOfLightDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSplitUnit.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSplitUnit.generated.js
new file mode 100644
index 0000000..2e87223
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSplitUnit.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.splitUnitDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var splitUnitDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSplitUnit: _factoriesAny.createSplitUnit
+};
+exports.splitUnitDependencies = splitUnitDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..4bce2d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrt.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtDependencies = void 0;
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sqrtDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqrt: _factoriesAny.createSqrt
+};
+exports.sqrtDependencies = sqrtDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrtm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrtm.generated.js
new file mode 100644
index 0000000..82764e4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrtm.generated.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtmDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+
+var _dependenciesMaxGenerated = require("./dependenciesMax.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sqrtmDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  maxDependencies: _dependenciesMaxGenerated.maxDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqrtm: _factoriesAny.createSqrtm
+};
+exports.sqrtmDependencies = sqrtmDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSquare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSquare.generated.js
new file mode 100644
index 0000000..e8c72f9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSquare.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squareDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var squareDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSquare: _factoriesAny.createSquare
+};
+exports.squareDependencies = squareDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqueeze.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqueeze.generated.js
new file mode 100644
index 0000000..8501dd7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqueeze.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squeezeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var squeezeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqueeze: _factoriesAny.createSqueeze
+};
+exports.squeezeDependencies = squeezeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStd.generated.js
new file mode 100644
index 0000000..58b115c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStd.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdDependencies = void 0;
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stdDependencies = {
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStd: _factoriesAny.createStd
+};
+exports.stdDependencies = stdDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..8bcbf22
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStdTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdTransformDependencies = void 0;
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stdTransformDependencies = {
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStdTransform: _factoriesAny.createStdTransform
+};
+exports.stdTransformDependencies = stdTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
new file mode 100644
index 0000000..eaf1a81
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stefanBoltzmannDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stefanBoltzmannDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createStefanBoltzmann: _factoriesAny.createStefanBoltzmann
+};
+exports.stefanBoltzmannDependencies = stefanBoltzmannDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..fe5d4fd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStirlingS2.generated.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stirlingS2Dependencies = void 0;
+
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stirlingS2Dependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createStirlingS2: _factoriesAny.createStirlingS2
+};
+exports.stirlingS2Dependencies = stirlingS2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesString.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesString.generated.js
new file mode 100644
index 0000000..8885fbf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesString.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stringDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stringDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createString: _factoriesAny.createString
+};
+exports.stringDependencies = stringDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubset.generated.js
new file mode 100644
index 0000000..6496d3e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubset.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var subsetDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSubset: _factoriesAny.createSubset
+};
+exports.subsetDependencies = subsetDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..01865d6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetTransformDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var subsetTransformDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSubsetTransform: _factoriesAny.createSubsetTransform
+};
+exports.subsetTransformDependencies = subsetTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..fb28348
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtract.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var subtractDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createSubtract: _factoriesAny.createSubtract
+};
+exports.subtractDependencies = subtractDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSum.generated.js
new file mode 100644
index 0000000..c7f0149
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSum.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSum: _factoriesAny.createSum
+};
+exports.sumDependencies = sumDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..f7108b5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSumTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSumTransform: _factoriesAny.createSumTransform
+};
+exports.sumTransformDependencies = sumTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..2283b07
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SymbolNodeDependencies = void 0;
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var SymbolNodeDependencies = {
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createSymbolNode: _factoriesAny.createSymbolNode
+};
+exports.SymbolNodeDependencies = SymbolNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
new file mode 100644
index 0000000..ef95b90
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.symbolicEqualDependencies = void 0;
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var symbolicEqualDependencies = {
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSymbolicEqual: _factoriesAny.createSymbolicEqual
+};
+exports.symbolicEqualDependencies = symbolicEqualDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTan.generated.js
new file mode 100644
index 0000000..6d5d73a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTan.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var tanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTan: _factoriesAny.createTan
+};
+exports.tanDependencies = tanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTanh.generated.js
new file mode 100644
index 0000000..79b35f5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTanh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanhDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var tanhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTanh: _factoriesAny.createTanh
+};
+exports.tanhDependencies = tanhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTau.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTau.generated.js
new file mode 100644
index 0000000..edf43d5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTau.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tauDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var tauDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createTau: _factoriesAny.createTau
+};
+exports.tauDependencies = tauDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
new file mode 100644
index 0000000..323afb7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.thomsonCrossSectionDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var thomsonCrossSectionDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createThomsonCrossSection: _factoriesAny.createThomsonCrossSection
+};
+exports.thomsonCrossSectionDependencies = thomsonCrossSectionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTo.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTo.generated.js
new file mode 100644
index 0000000..831a86b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTo.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var toDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTo: _factoriesAny.createTo
+};
+exports.toDependencies = toDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrace.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrace.generated.js
new file mode 100644
index 0000000..7cb5f43
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrace.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.traceDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var traceDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTrace: _factoriesAny.createTrace
+};
+exports.traceDependencies = traceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTranspose.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTranspose.generated.js
new file mode 100644
index 0000000..4ff5bb4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTranspose.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.transposeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var transposeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTranspose: _factoriesAny.createTranspose
+};
+exports.transposeDependencies = transposeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrue.generated.js
new file mode 100644
index 0000000..a030e9d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrue.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.trueDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var trueDependencies = {
+  createTrue: _factoriesAny.createTrue
+};
+exports.trueDependencies = trueDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..8037235
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTypeOf.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typeOfDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var typeOfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTypeOf: _factoriesAny.createTypeOf
+};
+exports.typeOfDependencies = typeOfDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTyped.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTyped.generated.js
new file mode 100644
index 0000000..227695a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTyped.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typedDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var typedDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  createTyped: _factoriesAny.createTyped
+};
+exports.typedDependencies = typedDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..49b1638
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryMinusDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var unaryMinusDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryMinus: _factoriesAny.createUnaryMinus
+};
+exports.unaryMinusDependencies = unaryMinusDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..e1c4794
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryPlusDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var unaryPlusDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryPlus: _factoriesAny.createUnaryPlus
+};
+exports.unaryPlusDependencies = unaryPlusDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..2d3578b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnequal.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unequalDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var unequalDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnequal: _factoriesAny.createUnequal
+};
+exports.unequalDependencies = unequalDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitClass.generated.js
new file mode 100644
index 0000000..2ed350c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitClass.generated.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.UnitDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesFixGenerated = require("./dependenciesFix.generated.js");
+
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var UnitDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  fixDependencies: _dependenciesFixGenerated.fixDependencies,
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  createUnitClass: _factoriesAny.createUnitClass
+};
+exports.UnitDependencies = UnitDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitFunction.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitFunction.generated.js
new file mode 100644
index 0000000..d35c746
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitFunction.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unitDependencies = void 0;
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var unitDependencies = {
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnitFunction: _factoriesAny.createUnitFunction
+};
+exports.unitDependencies = unitDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..f701ff2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercaseE.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.EDependencies = void 0;
+
+var _dependenciesEGenerated = require("./dependenciesE.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var EDependencies = {
+  eDependencies: _dependenciesEGenerated.eDependencies,
+  createUppercaseE: _factoriesAny.createUppercaseE
+};
+exports.EDependencies = EDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..d2e3686
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercasePi.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.PIDependencies = void 0;
+
+var _dependenciesPiGenerated = require("./dependenciesPi.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var PIDependencies = {
+  piDependencies: _dependenciesPiGenerated.piDependencies,
+  createUppercasePi: _factoriesAny.createUppercasePi
+};
+exports.PIDependencies = PIDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolve.generated.js
new file mode 100644
index 0000000..453f344
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolve.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var usolveDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUsolve: _factoriesAny.createUsolve
+};
+exports.usolveDependencies = usolveDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolveAll.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolveAll.generated.js
new file mode 100644
index 0000000..fc1e98d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolveAll.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveAllDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var usolveAllDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUsolveAll: _factoriesAny.createUsolveAll
+};
+exports.usolveAllDependencies = usolveAllDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
new file mode 100644
index 0000000..16964ab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.vacuumImpedanceDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var vacuumImpedanceDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createVacuumImpedance: _factoriesAny.createVacuumImpedance
+};
+exports.vacuumImpedanceDependencies = vacuumImpedanceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVariance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVariance.generated.js
new file mode 100644
index 0000000..af3dd44
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVariance.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesApplyGenerated = require("./dependenciesApply.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var varianceDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  applyDependencies: _dependenciesApplyGenerated.applyDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVariance: _factoriesAny.createVariance
+};
+exports.varianceDependencies = varianceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..beb2664
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesApplyGenerated = require("./dependenciesApply.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var varianceTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  applyDependencies: _dependenciesApplyGenerated.applyDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVarianceTransform: _factoriesAny.createVarianceTransform
+};
+exports.varianceTransformDependencies = varianceTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVersion.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVersion.generated.js
new file mode 100644
index 0000000..78e883e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVersion.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.versionDependencies = void 0;
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var versionDependencies = {
+  createVersion: _factoriesAny.createVersion
+};
+exports.versionDependencies = versionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
new file mode 100644
index 0000000..e2ad926
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.weakMixingAngleDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var weakMixingAngleDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createWeakMixingAngle: _factoriesAny.createWeakMixingAngle
+};
+exports.weakMixingAngleDependencies = weakMixingAngleDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWienDisplacement.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
new file mode 100644
index 0000000..f59e959
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.wienDisplacementDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var wienDisplacementDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createWienDisplacement: _factoriesAny.createWienDisplacement
+};
+exports.wienDisplacementDependencies = wienDisplacementDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..53b4d3e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXgcd.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xgcdDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var xgcdDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXgcd: _factoriesAny.createXgcd
+};
+exports.xgcdDependencies = xgcdDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXor.generated.js
new file mode 100644
index 0000000..996d5bd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXor.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xorDependencies = void 0;
+
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var xorDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXor: _factoriesAny.createXor
+};
+exports.xorDependencies = xorDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeros.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeros.generated.js
new file mode 100644
index 0000000..e7efbe4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeros.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zerosDependencies = void 0;
+
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesAny = require("../../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var zerosDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createZeros: _factoriesAny.createZeros
+};
+exports.zerosDependencies = zerosDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber.generated.js
new file mode 100644
index 0000000..b2e0a2a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber.generated.js
@@ -0,0 +1,1605 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "AccessorNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAccessorNodeGenerated.AccessorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ArrayNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesArrayNodeGenerated.ArrayNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "AssignmentNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "BlockNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBlockNodeGenerated.BlockNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ChainDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesChainClassGenerated.ChainDependencies;
+  }
+});
+Object.defineProperty(exports, "ConditionalNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ConstantNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesConstantNodeGenerated.ConstantNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "EDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUppercaseEGenerated.EDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionAssignmentNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFunctionNodeGenerated.FunctionNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "HelpDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHelpClassGenerated.HelpDependencies;
+  }
+});
+Object.defineProperty(exports, "IndexNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIndexNodeGenerated.IndexNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "InfinityDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesInfinityGenerated.InfinityDependencies;
+  }
+});
+Object.defineProperty(exports, "LN10Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLN10Generated.LN10Dependencies;
+  }
+});
+Object.defineProperty(exports, "LN2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLN2Generated.LN2Dependencies;
+  }
+});
+Object.defineProperty(exports, "LOG10EDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLOG10EGenerated.LOG10EDependencies;
+  }
+});
+Object.defineProperty(exports, "LOG2EDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLOG2EGenerated.LOG2EDependencies;
+  }
+});
+Object.defineProperty(exports, "NaNDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNaNGenerated.NaNDependencies;
+  }
+});
+Object.defineProperty(exports, "NodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNodeGenerated.NodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ObjectNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesObjectNodeGenerated.ObjectNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "OperatorNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesOperatorNodeGenerated.OperatorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "PIDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUppercasePiGenerated.PIDependencies;
+  }
+});
+Object.defineProperty(exports, "ParenthesisNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ParserDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParserClassGenerated.ParserDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeClassGenerated.RangeDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeNodeGenerated.RangeNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "RelationalNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRelationalNodeGenerated.RelationalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ResultSetDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesResultSetGenerated.ResultSetDependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT1_2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSQRT1_2Generated.SQRT1_2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSQRT2Generated.SQRT2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SymbolNodeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSymbolNodeGenerated.SymbolNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "absDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAbsGenerated.absDependencies;
+  }
+});
+Object.defineProperty(exports, "acosDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcosGenerated.acosDependencies;
+  }
+});
+Object.defineProperty(exports, "acoshDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcoshGenerated.acoshDependencies;
+  }
+});
+Object.defineProperty(exports, "acotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcotGenerated.acotDependencies;
+  }
+});
+Object.defineProperty(exports, "acothDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcothGenerated.acothDependencies;
+  }
+});
+Object.defineProperty(exports, "acscDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcscGenerated.acscDependencies;
+  }
+});
+Object.defineProperty(exports, "acschDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAcschGenerated.acschDependencies;
+  }
+});
+Object.defineProperty(exports, "addDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAddGenerated.addDependencies;
+  }
+});
+Object.defineProperty(exports, "addScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAddScalarGenerated.addScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "all", {
+  enumerable: true,
+  get: function get() {
+    return _allFactoriesNumber.all;
+  }
+});
+Object.defineProperty(exports, "andDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAndGenerated.andDependencies;
+  }
+});
+Object.defineProperty(exports, "applyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesApplyGenerated.applyDependencies;
+  }
+});
+Object.defineProperty(exports, "applyTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesApplyTransformGenerated.applyTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "asecDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsecGenerated.asecDependencies;
+  }
+});
+Object.defineProperty(exports, "asechDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsechGenerated.asechDependencies;
+  }
+});
+Object.defineProperty(exports, "asinDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsinGenerated.asinDependencies;
+  }
+});
+Object.defineProperty(exports, "asinhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAsinhGenerated.asinhDependencies;
+  }
+});
+Object.defineProperty(exports, "atan2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAtan2Generated.atan2Dependencies;
+  }
+});
+Object.defineProperty(exports, "atanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAtanGenerated.atanDependencies;
+  }
+});
+Object.defineProperty(exports, "atanhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesAtanhGenerated.atanhDependencies;
+  }
+});
+Object.defineProperty(exports, "bellNumbersDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBellNumbersGenerated.bellNumbersDependencies;
+  }
+});
+Object.defineProperty(exports, "bitAndDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitAndGenerated.bitAndDependencies;
+  }
+});
+Object.defineProperty(exports, "bitNotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitNotGenerated.bitNotDependencies;
+  }
+});
+Object.defineProperty(exports, "bitOrDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitOrGenerated.bitOrDependencies;
+  }
+});
+Object.defineProperty(exports, "bitXorDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBitXorGenerated.bitXorDependencies;
+  }
+});
+Object.defineProperty(exports, "booleanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesBooleanGenerated.booleanDependencies;
+  }
+});
+Object.defineProperty(exports, "catalanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCatalanGenerated.catalanDependencies;
+  }
+});
+Object.defineProperty(exports, "cbrtDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCbrtGenerated.cbrtDependencies;
+  }
+});
+Object.defineProperty(exports, "ceilDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCeilGenerated.ceilDependencies;
+  }
+});
+Object.defineProperty(exports, "chainDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesChainGenerated.chainDependencies;
+  }
+});
+Object.defineProperty(exports, "cloneDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCloneGenerated.cloneDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCombinationsGenerated.combinationsDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsWithRepDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCombinationsWithRepGenerated.combinationsWithRepDependencies;
+  }
+});
+Object.defineProperty(exports, "compareDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompareGenerated.compareDependencies;
+  }
+});
+Object.defineProperty(exports, "compareNaturalDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompareNaturalGenerated.compareNaturalDependencies;
+  }
+});
+Object.defineProperty(exports, "compareTextDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompareTextGenerated.compareTextDependencies;
+  }
+});
+Object.defineProperty(exports, "compileDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompileGenerated.compileDependencies;
+  }
+});
+Object.defineProperty(exports, "compositionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCompositionGenerated.compositionDependencies;
+  }
+});
+Object.defineProperty(exports, "cosDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCosGenerated.cosDependencies;
+  }
+});
+Object.defineProperty(exports, "coshDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCoshGenerated.coshDependencies;
+  }
+});
+Object.defineProperty(exports, "cotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCotGenerated.cotDependencies;
+  }
+});
+Object.defineProperty(exports, "cothDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCothGenerated.cothDependencies;
+  }
+});
+Object.defineProperty(exports, "cscDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCscGenerated.cscDependencies;
+  }
+});
+Object.defineProperty(exports, "cschDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCschGenerated.cschDependencies;
+  }
+});
+Object.defineProperty(exports, "cubeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCubeGenerated.cubeDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCumSumGenerated.cumsumDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesCumSumTransformGenerated.cumsumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "deepEqualDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDeepEqualGenerated.deepEqualDependencies;
+  }
+});
+Object.defineProperty(exports, "derivativeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDerivativeGenerated.derivativeDependencies;
+  }
+});
+Object.defineProperty(exports, "divideDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDivideGenerated.divideDependencies;
+  }
+});
+Object.defineProperty(exports, "divideScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesDivideScalarGenerated.divideScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "eDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEGenerated.eDependencies;
+  }
+});
+Object.defineProperty(exports, "equalDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEqualGenerated.equalDependencies;
+  }
+});
+Object.defineProperty(exports, "equalScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEqualScalarGenerated.equalScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "equalTextDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEqualTextGenerated.equalTextDependencies;
+  }
+});
+Object.defineProperty(exports, "erfDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesErfGenerated.erfDependencies;
+  }
+});
+Object.defineProperty(exports, "evaluateDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesEvaluateGenerated.evaluateDependencies;
+  }
+});
+Object.defineProperty(exports, "expDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesExpGenerated.expDependencies;
+  }
+});
+Object.defineProperty(exports, "expm1Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesExpm1Generated.expm1Dependencies;
+  }
+});
+Object.defineProperty(exports, "factorialDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFactorialGenerated.factorialDependencies;
+  }
+});
+Object.defineProperty(exports, "falseDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFalseGenerated.falseDependencies;
+  }
+});
+Object.defineProperty(exports, "filterDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFilterGenerated.filterDependencies;
+  }
+});
+Object.defineProperty(exports, "filterTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFilterTransformGenerated.filterTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "fixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFixGenerated.fixDependencies;
+  }
+});
+Object.defineProperty(exports, "floorDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFloorGenerated.floorDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesForEachGenerated.forEachDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesForEachTransformGenerated.forEachTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "formatDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesFormatGenerated.formatDependencies;
+  }
+});
+Object.defineProperty(exports, "gammaDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGammaGenerated.gammaDependencies;
+  }
+});
+Object.defineProperty(exports, "gcdDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesGcdGenerated.gcdDependencies;
+  }
+});
+Object.defineProperty(exports, "hasNumericValueDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHasNumericValueGenerated.hasNumericValueDependencies;
+  }
+});
+Object.defineProperty(exports, "helpDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHelpGenerated.helpDependencies;
+  }
+});
+Object.defineProperty(exports, "hypotDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesHypotGenerated.hypotDependencies;
+  }
+});
+Object.defineProperty(exports, "indexDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIndexGenerated.indexDependencies;
+  }
+});
+Object.defineProperty(exports, "isIntegerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsIntegerGenerated.isIntegerDependencies;
+  }
+});
+Object.defineProperty(exports, "isNaNDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsNaNGenerated.isNaNDependencies;
+  }
+});
+Object.defineProperty(exports, "isNegativeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsNegativeGenerated.isNegativeDependencies;
+  }
+});
+Object.defineProperty(exports, "isNumericDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsNumericGenerated.isNumericDependencies;
+  }
+});
+Object.defineProperty(exports, "isPositiveDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsPositiveGenerated.isPositiveDependencies;
+  }
+});
+Object.defineProperty(exports, "isPrimeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsPrimeGenerated.isPrimeDependencies;
+  }
+});
+Object.defineProperty(exports, "isZeroDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesIsZeroGenerated.isZeroDependencies;
+  }
+});
+Object.defineProperty(exports, "largerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLargerGenerated.largerDependencies;
+  }
+});
+Object.defineProperty(exports, "largerEqDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLargerEqGenerated.largerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "lcmDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLcmGenerated.lcmDependencies;
+  }
+});
+Object.defineProperty(exports, "leftShiftDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLeftShiftGenerated.leftShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "log10Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLog10Generated.log10Dependencies;
+  }
+});
+Object.defineProperty(exports, "log1pDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLog1pGenerated.log1pDependencies;
+  }
+});
+Object.defineProperty(exports, "log2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLog2Generated.log2Dependencies;
+  }
+});
+Object.defineProperty(exports, "logDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesLogGenerated.logDependencies;
+  }
+});
+Object.defineProperty(exports, "madDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMadGenerated.madDependencies;
+  }
+});
+Object.defineProperty(exports, "mapDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMapGenerated.mapDependencies;
+  }
+});
+Object.defineProperty(exports, "mapTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMapTransformGenerated.mapTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMatrixGenerated.matrixDependencies;
+  }
+});
+Object.defineProperty(exports, "maxDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMaxGenerated.maxDependencies;
+  }
+});
+Object.defineProperty(exports, "maxTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMaxTransformGenerated.maxTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "meanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMeanGenerated.meanDependencies;
+  }
+});
+Object.defineProperty(exports, "meanTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMeanTransformGenerated.meanTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "medianDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMedianGenerated.medianDependencies;
+  }
+});
+Object.defineProperty(exports, "minDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMinGenerated.minDependencies;
+  }
+});
+Object.defineProperty(exports, "minTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMinTransformGenerated.minTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "modDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesModGenerated.modDependencies;
+  }
+});
+Object.defineProperty(exports, "modeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesModeGenerated.modeDependencies;
+  }
+});
+Object.defineProperty(exports, "multinomialDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMultinomialGenerated.multinomialDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMultiplyGenerated.multiplyDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyScalarDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "normDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNormGenerated.normDependencies;
+  }
+});
+Object.defineProperty(exports, "notDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNotGenerated.notDependencies;
+  }
+});
+Object.defineProperty(exports, "nthRootDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNthRootGenerated.nthRootDependencies;
+  }
+});
+Object.defineProperty(exports, "nullDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNullGenerated.nullDependencies;
+  }
+});
+Object.defineProperty(exports, "numberDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNumberGenerated.numberDependencies;
+  }
+});
+Object.defineProperty(exports, "numericDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesNumericGenerated.numericDependencies;
+  }
+});
+Object.defineProperty(exports, "orDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesOrGenerated.orDependencies;
+  }
+});
+Object.defineProperty(exports, "parseDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParseGenerated.parseDependencies;
+  }
+});
+Object.defineProperty(exports, "parserDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesParserGenerated.parserDependencies;
+  }
+});
+Object.defineProperty(exports, "partitionSelectDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPartitionSelectGenerated.partitionSelectDependencies;
+  }
+});
+Object.defineProperty(exports, "permutationsDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPermutationsGenerated.permutationsDependencies;
+  }
+});
+Object.defineProperty(exports, "phiDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPhiGenerated.phiDependencies;
+  }
+});
+Object.defineProperty(exports, "piDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPiGenerated.piDependencies;
+  }
+});
+Object.defineProperty(exports, "pickRandomDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPickRandomGenerated.pickRandomDependencies;
+  }
+});
+Object.defineProperty(exports, "powDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPowGenerated.powDependencies;
+  }
+});
+Object.defineProperty(exports, "printDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesPrintGenerated.printDependencies;
+  }
+});
+Object.defineProperty(exports, "prodDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesProdGenerated.prodDependencies;
+  }
+});
+Object.defineProperty(exports, "quantileSeqDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesQuantileSeqGenerated.quantileSeqDependencies;
+  }
+});
+Object.defineProperty(exports, "randomDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRandomGenerated.randomDependencies;
+  }
+});
+Object.defineProperty(exports, "randomIntDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRandomIntGenerated.randomIntDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeGenerated.rangeDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRangeTransformGenerated.rangeTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "rationalizeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRationalizeGenerated.rationalizeDependencies;
+  }
+});
+Object.defineProperty(exports, "replacerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesReplacerGenerated.replacerDependencies;
+  }
+});
+Object.defineProperty(exports, "resolveDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesResolveGenerated.resolveDependencies;
+  }
+});
+Object.defineProperty(exports, "reviverDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesReviverGenerated.reviverDependencies;
+  }
+});
+Object.defineProperty(exports, "rightArithShiftDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRightArithShiftGenerated.rightArithShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "rightLogShiftDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRightLogShiftGenerated.rightLogShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "roundDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesRoundGenerated.roundDependencies;
+  }
+});
+Object.defineProperty(exports, "secDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSecGenerated.secDependencies;
+  }
+});
+Object.defineProperty(exports, "sechDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSechGenerated.sechDependencies;
+  }
+});
+Object.defineProperty(exports, "signDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSignGenerated.signDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyCoreDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSimplifyGenerated.simplifyDependencies;
+  }
+});
+Object.defineProperty(exports, "sinDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSinGenerated.sinDependencies;
+  }
+});
+Object.defineProperty(exports, "sinhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSinhGenerated.sinhDependencies;
+  }
+});
+Object.defineProperty(exports, "sizeDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSizeGenerated.sizeDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSmallerGenerated.smallerDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerEqDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSmallerEqGenerated.smallerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "sqrtDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSqrtGenerated.sqrtDependencies;
+  }
+});
+Object.defineProperty(exports, "squareDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSquareGenerated.squareDependencies;
+  }
+});
+Object.defineProperty(exports, "stdDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStdGenerated.stdDependencies;
+  }
+});
+Object.defineProperty(exports, "stdTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStdTransformGenerated.stdTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "stirlingS2Dependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStirlingS2Generated.stirlingS2Dependencies;
+  }
+});
+Object.defineProperty(exports, "stringDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesStringGenerated.stringDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSubsetGenerated.subsetDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSubsetTransformGenerated.subsetTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "subtractDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSubtractGenerated.subtractDependencies;
+  }
+});
+Object.defineProperty(exports, "sumDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSumGenerated.sumDependencies;
+  }
+});
+Object.defineProperty(exports, "sumTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesSumTransformGenerated.sumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "tanDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTanGenerated.tanDependencies;
+  }
+});
+Object.defineProperty(exports, "tanhDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTanhGenerated.tanhDependencies;
+  }
+});
+Object.defineProperty(exports, "tauDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTauGenerated.tauDependencies;
+  }
+});
+Object.defineProperty(exports, "trueDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTrueGenerated.trueDependencies;
+  }
+});
+Object.defineProperty(exports, "typeOfDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTypeOfGenerated.typeOfDependencies;
+  }
+});
+Object.defineProperty(exports, "typedDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesTypedGenerated.typedDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryMinusDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnaryMinusGenerated.unaryMinusDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryPlusDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnaryPlusGenerated.unaryPlusDependencies;
+  }
+});
+Object.defineProperty(exports, "unequalDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesUnequalGenerated.unequalDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesVarianceGenerated.varianceDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceTransformDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesVarianceTransformGenerated.varianceTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "versionDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesVersionGenerated.versionDependencies;
+  }
+});
+Object.defineProperty(exports, "xgcdDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesXgcdGenerated.xgcdDependencies;
+  }
+});
+Object.defineProperty(exports, "xorDependencies", {
+  enumerable: true,
+  get: function get() {
+    return _dependenciesXorGenerated.xorDependencies;
+  }
+});
+
+var _dependenciesAbsGenerated = require("./dependenciesNumber/dependenciesAbs.generated.js");
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesNumber/dependenciesAccessorNode.generated.js");
+
+var _dependenciesAcosGenerated = require("./dependenciesNumber/dependenciesAcos.generated.js");
+
+var _dependenciesAcoshGenerated = require("./dependenciesNumber/dependenciesAcosh.generated.js");
+
+var _dependenciesAcotGenerated = require("./dependenciesNumber/dependenciesAcot.generated.js");
+
+var _dependenciesAcothGenerated = require("./dependenciesNumber/dependenciesAcoth.generated.js");
+
+var _dependenciesAcscGenerated = require("./dependenciesNumber/dependenciesAcsc.generated.js");
+
+var _dependenciesAcschGenerated = require("./dependenciesNumber/dependenciesAcsch.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesNumber/dependenciesAdd.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesNumber/dependenciesAddScalar.generated.js");
+
+var _dependenciesAndGenerated = require("./dependenciesNumber/dependenciesAnd.generated.js");
+
+var _dependenciesApplyGenerated = require("./dependenciesNumber/dependenciesApply.generated.js");
+
+var _dependenciesApplyTransformGenerated = require("./dependenciesNumber/dependenciesApplyTransform.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesNumber/dependenciesArrayNode.generated.js");
+
+var _dependenciesAsecGenerated = require("./dependenciesNumber/dependenciesAsec.generated.js");
+
+var _dependenciesAsechGenerated = require("./dependenciesNumber/dependenciesAsech.generated.js");
+
+var _dependenciesAsinGenerated = require("./dependenciesNumber/dependenciesAsin.generated.js");
+
+var _dependenciesAsinhGenerated = require("./dependenciesNumber/dependenciesAsinh.generated.js");
+
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesNumber/dependenciesAssignmentNode.generated.js");
+
+var _dependenciesAtanGenerated = require("./dependenciesNumber/dependenciesAtan.generated.js");
+
+var _dependenciesAtan2Generated = require("./dependenciesNumber/dependenciesAtan2.generated.js");
+
+var _dependenciesAtanhGenerated = require("./dependenciesNumber/dependenciesAtanh.generated.js");
+
+var _dependenciesBellNumbersGenerated = require("./dependenciesNumber/dependenciesBellNumbers.generated.js");
+
+var _dependenciesBitAndGenerated = require("./dependenciesNumber/dependenciesBitAnd.generated.js");
+
+var _dependenciesBitNotGenerated = require("./dependenciesNumber/dependenciesBitNot.generated.js");
+
+var _dependenciesBitOrGenerated = require("./dependenciesNumber/dependenciesBitOr.generated.js");
+
+var _dependenciesBitXorGenerated = require("./dependenciesNumber/dependenciesBitXor.generated.js");
+
+var _dependenciesBlockNodeGenerated = require("./dependenciesNumber/dependenciesBlockNode.generated.js");
+
+var _dependenciesBooleanGenerated = require("./dependenciesNumber/dependenciesBoolean.generated.js");
+
+var _dependenciesCatalanGenerated = require("./dependenciesNumber/dependenciesCatalan.generated.js");
+
+var _dependenciesCbrtGenerated = require("./dependenciesNumber/dependenciesCbrt.generated.js");
+
+var _dependenciesCeilGenerated = require("./dependenciesNumber/dependenciesCeil.generated.js");
+
+var _dependenciesChainGenerated = require("./dependenciesNumber/dependenciesChain.generated.js");
+
+var _dependenciesChainClassGenerated = require("./dependenciesNumber/dependenciesChainClass.generated.js");
+
+var _dependenciesCloneGenerated = require("./dependenciesNumber/dependenciesClone.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesNumber/dependenciesCombinations.generated.js");
+
+var _dependenciesCombinationsWithRepGenerated = require("./dependenciesNumber/dependenciesCombinationsWithRep.generated.js");
+
+var _dependenciesCompareGenerated = require("./dependenciesNumber/dependenciesCompare.generated.js");
+
+var _dependenciesCompareNaturalGenerated = require("./dependenciesNumber/dependenciesCompareNatural.generated.js");
+
+var _dependenciesCompareTextGenerated = require("./dependenciesNumber/dependenciesCompareText.generated.js");
+
+var _dependenciesCompileGenerated = require("./dependenciesNumber/dependenciesCompile.generated.js");
+
+var _dependenciesCompositionGenerated = require("./dependenciesNumber/dependenciesComposition.generated.js");
+
+var _dependenciesConditionalNodeGenerated = require("./dependenciesNumber/dependenciesConditionalNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesNumber/dependenciesConstantNode.generated.js");
+
+var _dependenciesCosGenerated = require("./dependenciesNumber/dependenciesCos.generated.js");
+
+var _dependenciesCoshGenerated = require("./dependenciesNumber/dependenciesCosh.generated.js");
+
+var _dependenciesCotGenerated = require("./dependenciesNumber/dependenciesCot.generated.js");
+
+var _dependenciesCothGenerated = require("./dependenciesNumber/dependenciesCoth.generated.js");
+
+var _dependenciesCscGenerated = require("./dependenciesNumber/dependenciesCsc.generated.js");
+
+var _dependenciesCschGenerated = require("./dependenciesNumber/dependenciesCsch.generated.js");
+
+var _dependenciesCubeGenerated = require("./dependenciesNumber/dependenciesCube.generated.js");
+
+var _dependenciesCumSumGenerated = require("./dependenciesNumber/dependenciesCumSum.generated.js");
+
+var _dependenciesCumSumTransformGenerated = require("./dependenciesNumber/dependenciesCumSumTransform.generated.js");
+
+var _dependenciesDeepEqualGenerated = require("./dependenciesNumber/dependenciesDeepEqual.generated.js");
+
+var _dependenciesDerivativeGenerated = require("./dependenciesNumber/dependenciesDerivative.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesNumber/dependenciesDivide.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesNumber/dependenciesDivideScalar.generated.js");
+
+var _dependenciesEGenerated = require("./dependenciesNumber/dependenciesE.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesNumber/dependenciesEqual.generated.js");
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesNumber/dependenciesEqualScalar.generated.js");
+
+var _dependenciesEqualTextGenerated = require("./dependenciesNumber/dependenciesEqualText.generated.js");
+
+var _dependenciesErfGenerated = require("./dependenciesNumber/dependenciesErf.generated.js");
+
+var _dependenciesEvaluateGenerated = require("./dependenciesNumber/dependenciesEvaluate.generated.js");
+
+var _dependenciesExpGenerated = require("./dependenciesNumber/dependenciesExp.generated.js");
+
+var _dependenciesExpm1Generated = require("./dependenciesNumber/dependenciesExpm1.generated.js");
+
+var _dependenciesFactorialGenerated = require("./dependenciesNumber/dependenciesFactorial.generated.js");
+
+var _dependenciesFalseGenerated = require("./dependenciesNumber/dependenciesFalse.generated.js");
+
+var _dependenciesFilterGenerated = require("./dependenciesNumber/dependenciesFilter.generated.js");
+
+var _dependenciesFilterTransformGenerated = require("./dependenciesNumber/dependenciesFilterTransform.generated.js");
+
+var _dependenciesFixGenerated = require("./dependenciesNumber/dependenciesFix.generated.js");
+
+var _dependenciesFloorGenerated = require("./dependenciesNumber/dependenciesFloor.generated.js");
+
+var _dependenciesForEachGenerated = require("./dependenciesNumber/dependenciesForEach.generated.js");
+
+var _dependenciesForEachTransformGenerated = require("./dependenciesNumber/dependenciesForEachTransform.generated.js");
+
+var _dependenciesFormatGenerated = require("./dependenciesNumber/dependenciesFormat.generated.js");
+
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesNumber/dependenciesFunctionNode.generated.js");
+
+var _dependenciesGammaGenerated = require("./dependenciesNumber/dependenciesGamma.generated.js");
+
+var _dependenciesGcdGenerated = require("./dependenciesNumber/dependenciesGcd.generated.js");
+
+var _dependenciesHasNumericValueGenerated = require("./dependenciesNumber/dependenciesHasNumericValue.generated.js");
+
+var _dependenciesHelpGenerated = require("./dependenciesNumber/dependenciesHelp.generated.js");
+
+var _dependenciesHelpClassGenerated = require("./dependenciesNumber/dependenciesHelpClass.generated.js");
+
+var _dependenciesHypotGenerated = require("./dependenciesNumber/dependenciesHypot.generated.js");
+
+var _dependenciesIndexGenerated = require("./dependenciesNumber/dependenciesIndex.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesNumber/dependenciesIndexNode.generated.js");
+
+var _dependenciesInfinityGenerated = require("./dependenciesNumber/dependenciesInfinity.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesNumber/dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesNumber/dependenciesIsNaN.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesNumber/dependenciesIsNegative.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesNumber/dependenciesIsNumeric.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesNumber/dependenciesIsPositive.generated.js");
+
+var _dependenciesIsPrimeGenerated = require("./dependenciesNumber/dependenciesIsPrime.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesNumber/dependenciesIsZero.generated.js");
+
+var _dependenciesLN10Generated = require("./dependenciesNumber/dependenciesLN10.generated.js");
+
+var _dependenciesLN2Generated = require("./dependenciesNumber/dependenciesLN2.generated.js");
+
+var _dependenciesLOG10EGenerated = require("./dependenciesNumber/dependenciesLOG10E.generated.js");
+
+var _dependenciesLOG2EGenerated = require("./dependenciesNumber/dependenciesLOG2E.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesNumber/dependenciesLarger.generated.js");
+
+var _dependenciesLargerEqGenerated = require("./dependenciesNumber/dependenciesLargerEq.generated.js");
+
+var _dependenciesLcmGenerated = require("./dependenciesNumber/dependenciesLcm.generated.js");
+
+var _dependenciesLeftShiftGenerated = require("./dependenciesNumber/dependenciesLeftShift.generated.js");
+
+var _dependenciesLogGenerated = require("./dependenciesNumber/dependenciesLog.generated.js");
+
+var _dependenciesLog10Generated = require("./dependenciesNumber/dependenciesLog10.generated.js");
+
+var _dependenciesLog1pGenerated = require("./dependenciesNumber/dependenciesLog1p.generated.js");
+
+var _dependenciesLog2Generated = require("./dependenciesNumber/dependenciesLog2.generated.js");
+
+var _dependenciesMadGenerated = require("./dependenciesNumber/dependenciesMad.generated.js");
+
+var _dependenciesMapGenerated = require("./dependenciesNumber/dependenciesMap.generated.js");
+
+var _dependenciesMapTransformGenerated = require("./dependenciesNumber/dependenciesMapTransform.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesNumber/dependenciesMatrix.generated.js");
+
+var _dependenciesMaxGenerated = require("./dependenciesNumber/dependenciesMax.generated.js");
+
+var _dependenciesMaxTransformGenerated = require("./dependenciesNumber/dependenciesMaxTransform.generated.js");
+
+var _dependenciesMeanGenerated = require("./dependenciesNumber/dependenciesMean.generated.js");
+
+var _dependenciesMeanTransformGenerated = require("./dependenciesNumber/dependenciesMeanTransform.generated.js");
+
+var _dependenciesMedianGenerated = require("./dependenciesNumber/dependenciesMedian.generated.js");
+
+var _dependenciesMinGenerated = require("./dependenciesNumber/dependenciesMin.generated.js");
+
+var _dependenciesMinTransformGenerated = require("./dependenciesNumber/dependenciesMinTransform.generated.js");
+
+var _dependenciesModGenerated = require("./dependenciesNumber/dependenciesMod.generated.js");
+
+var _dependenciesModeGenerated = require("./dependenciesNumber/dependenciesMode.generated.js");
+
+var _dependenciesMultinomialGenerated = require("./dependenciesNumber/dependenciesMultinomial.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesNumber/dependenciesMultiply.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesNumber/dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNaNGenerated = require("./dependenciesNumber/dependenciesNaN.generated.js");
+
+var _dependenciesNodeGenerated = require("./dependenciesNumber/dependenciesNode.generated.js");
+
+var _dependenciesNormGenerated = require("./dependenciesNumber/dependenciesNorm.generated.js");
+
+var _dependenciesNotGenerated = require("./dependenciesNumber/dependenciesNot.generated.js");
+
+var _dependenciesNthRootGenerated = require("./dependenciesNumber/dependenciesNthRoot.generated.js");
+
+var _dependenciesNullGenerated = require("./dependenciesNumber/dependenciesNull.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber/dependenciesNumber.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumber/dependenciesNumeric.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesNumber/dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesNumber/dependenciesOperatorNode.generated.js");
+
+var _dependenciesOrGenerated = require("./dependenciesNumber/dependenciesOr.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesNumber/dependenciesParenthesisNode.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesNumber/dependenciesParse.generated.js");
+
+var _dependenciesParserGenerated = require("./dependenciesNumber/dependenciesParser.generated.js");
+
+var _dependenciesParserClassGenerated = require("./dependenciesNumber/dependenciesParserClass.generated.js");
+
+var _dependenciesPartitionSelectGenerated = require("./dependenciesNumber/dependenciesPartitionSelect.generated.js");
+
+var _dependenciesPermutationsGenerated = require("./dependenciesNumber/dependenciesPermutations.generated.js");
+
+var _dependenciesPhiGenerated = require("./dependenciesNumber/dependenciesPhi.generated.js");
+
+var _dependenciesPiGenerated = require("./dependenciesNumber/dependenciesPi.generated.js");
+
+var _dependenciesPickRandomGenerated = require("./dependenciesNumber/dependenciesPickRandom.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesNumber/dependenciesPow.generated.js");
+
+var _dependenciesPrintGenerated = require("./dependenciesNumber/dependenciesPrint.generated.js");
+
+var _dependenciesProdGenerated = require("./dependenciesNumber/dependenciesProd.generated.js");
+
+var _dependenciesQuantileSeqGenerated = require("./dependenciesNumber/dependenciesQuantileSeq.generated.js");
+
+var _dependenciesRandomGenerated = require("./dependenciesNumber/dependenciesRandom.generated.js");
+
+var _dependenciesRandomIntGenerated = require("./dependenciesNumber/dependenciesRandomInt.generated.js");
+
+var _dependenciesRangeGenerated = require("./dependenciesNumber/dependenciesRange.generated.js");
+
+var _dependenciesRangeClassGenerated = require("./dependenciesNumber/dependenciesRangeClass.generated.js");
+
+var _dependenciesRangeNodeGenerated = require("./dependenciesNumber/dependenciesRangeNode.generated.js");
+
+var _dependenciesRangeTransformGenerated = require("./dependenciesNumber/dependenciesRangeTransform.generated.js");
+
+var _dependenciesRationalizeGenerated = require("./dependenciesNumber/dependenciesRationalize.generated.js");
+
+var _dependenciesRelationalNodeGenerated = require("./dependenciesNumber/dependenciesRelationalNode.generated.js");
+
+var _dependenciesReplacerGenerated = require("./dependenciesNumber/dependenciesReplacer.generated.js");
+
+var _dependenciesResolveGenerated = require("./dependenciesNumber/dependenciesResolve.generated.js");
+
+var _dependenciesResultSetGenerated = require("./dependenciesNumber/dependenciesResultSet.generated.js");
+
+var _dependenciesReviverGenerated = require("./dependenciesNumber/dependenciesReviver.generated.js");
+
+var _dependenciesRightArithShiftGenerated = require("./dependenciesNumber/dependenciesRightArithShift.generated.js");
+
+var _dependenciesRightLogShiftGenerated = require("./dependenciesNumber/dependenciesRightLogShift.generated.js");
+
+var _dependenciesRoundGenerated = require("./dependenciesNumber/dependenciesRound.generated.js");
+
+var _dependenciesSQRT1_2Generated = require("./dependenciesNumber/dependenciesSQRT1_2.generated.js");
+
+var _dependenciesSQRT2Generated = require("./dependenciesNumber/dependenciesSQRT2.generated.js");
+
+var _dependenciesSecGenerated = require("./dependenciesNumber/dependenciesSec.generated.js");
+
+var _dependenciesSechGenerated = require("./dependenciesNumber/dependenciesSech.generated.js");
+
+var _dependenciesSignGenerated = require("./dependenciesNumber/dependenciesSign.generated.js");
+
+var _dependenciesSimplifyGenerated = require("./dependenciesNumber/dependenciesSimplify.generated.js");
+
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesNumber/dependenciesSimplifyCore.generated.js");
+
+var _dependenciesSinGenerated = require("./dependenciesNumber/dependenciesSin.generated.js");
+
+var _dependenciesSinhGenerated = require("./dependenciesNumber/dependenciesSinh.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesNumber/dependenciesSize.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesNumber/dependenciesSmaller.generated.js");
+
+var _dependenciesSmallerEqGenerated = require("./dependenciesNumber/dependenciesSmallerEq.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesNumber/dependenciesSqrt.generated.js");
+
+var _dependenciesSquareGenerated = require("./dependenciesNumber/dependenciesSquare.generated.js");
+
+var _dependenciesStdGenerated = require("./dependenciesNumber/dependenciesStd.generated.js");
+
+var _dependenciesStdTransformGenerated = require("./dependenciesNumber/dependenciesStdTransform.generated.js");
+
+var _dependenciesStirlingS2Generated = require("./dependenciesNumber/dependenciesStirlingS2.generated.js");
+
+var _dependenciesStringGenerated = require("./dependenciesNumber/dependenciesString.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesNumber/dependenciesSubset.generated.js");
+
+var _dependenciesSubsetTransformGenerated = require("./dependenciesNumber/dependenciesSubsetTransform.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesNumber/dependenciesSubtract.generated.js");
+
+var _dependenciesSumGenerated = require("./dependenciesNumber/dependenciesSum.generated.js");
+
+var _dependenciesSumTransformGenerated = require("./dependenciesNumber/dependenciesSumTransform.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesNumber/dependenciesSymbolNode.generated.js");
+
+var _dependenciesTanGenerated = require("./dependenciesNumber/dependenciesTan.generated.js");
+
+var _dependenciesTanhGenerated = require("./dependenciesNumber/dependenciesTanh.generated.js");
+
+var _dependenciesTauGenerated = require("./dependenciesNumber/dependenciesTau.generated.js");
+
+var _dependenciesTrueGenerated = require("./dependenciesNumber/dependenciesTrue.generated.js");
+
+var _dependenciesTypeOfGenerated = require("./dependenciesNumber/dependenciesTypeOf.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesNumber/dependenciesTyped.generated.js");
+
+var _dependenciesUnaryMinusGenerated = require("./dependenciesNumber/dependenciesUnaryMinus.generated.js");
+
+var _dependenciesUnaryPlusGenerated = require("./dependenciesNumber/dependenciesUnaryPlus.generated.js");
+
+var _dependenciesUnequalGenerated = require("./dependenciesNumber/dependenciesUnequal.generated.js");
+
+var _dependenciesUppercaseEGenerated = require("./dependenciesNumber/dependenciesUppercaseE.generated.js");
+
+var _dependenciesUppercasePiGenerated = require("./dependenciesNumber/dependenciesUppercasePi.generated.js");
+
+var _dependenciesVarianceGenerated = require("./dependenciesNumber/dependenciesVariance.generated.js");
+
+var _dependenciesVarianceTransformGenerated = require("./dependenciesNumber/dependenciesVarianceTransform.generated.js");
+
+var _dependenciesVersionGenerated = require("./dependenciesNumber/dependenciesVersion.generated.js");
+
+var _dependenciesXgcdGenerated = require("./dependenciesNumber/dependenciesXgcd.generated.js");
+
+var _dependenciesXorGenerated = require("./dependenciesNumber/dependenciesXor.generated.js");
+
+var _allFactoriesNumber = require("./allFactoriesNumber.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAbs.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAbs.generated.js
new file mode 100644
index 0000000..2bad130
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAbs.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var absDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAbs: _factoriesNumber.createAbs
+};
+exports.absDependencies = absDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..0bf9770
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AccessorNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var AccessorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAccessorNode: _factoriesNumber.createAccessorNode
+};
+exports.AccessorNodeDependencies = AccessorNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcos.generated.js
new file mode 100644
index 0000000..1bc3ecf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcos.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acosDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcos: _factoriesNumber.createAcos
+};
+exports.acosDependencies = acosDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..96052d1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcosh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acoshDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acoshDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcosh: _factoriesNumber.createAcosh
+};
+exports.acoshDependencies = acoshDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcot.generated.js
new file mode 100644
index 0000000..0555202
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcot.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acotDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcot: _factoriesNumber.createAcot
+};
+exports.acotDependencies = acotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..028cb0a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcoth.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acothDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acothDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcoth: _factoriesNumber.createAcoth
+};
+exports.acothDependencies = acothDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..6d10855
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsc.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acscDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acscDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsc: _factoriesNumber.createAcsc
+};
+exports.acscDependencies = acscDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..cf44b05
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsch.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acschDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var acschDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsch: _factoriesNumber.createAcsch
+};
+exports.acschDependencies = acschDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAdd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAdd.generated.js
new file mode 100644
index 0000000..c03f615
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAdd.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var addDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAdd: _factoriesNumber.createAdd
+};
+exports.addDependencies = addDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..f9f0deb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAddScalar.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addScalarDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var addScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAddScalar: _factoriesNumber.createAddScalar
+};
+exports.addScalarDependencies = addScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAnd.generated.js
new file mode 100644
index 0000000..2f4efd2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAnd.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var andDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAnd: _factoriesNumber.createAnd
+};
+exports.andDependencies = andDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesApply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesApply.generated.js
new file mode 100644
index 0000000..21eeec9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesApply.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.applyDependencies = void 0;
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var applyDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createApply: _factoriesNumber.createApply
+};
+exports.applyDependencies = applyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesApplyTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesApplyTransform.generated.js
new file mode 100644
index 0000000..48bdd2d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesApplyTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.applyTransformDependencies = void 0;
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var applyTransformDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createApplyTransform: _factoriesNumber.createApplyTransform
+};
+exports.applyTransformDependencies = applyTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..3293826
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesArrayNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ArrayNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ArrayNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createArrayNode: _factoriesNumber.createArrayNode
+};
+exports.ArrayNodeDependencies = ArrayNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsec.generated.js
new file mode 100644
index 0000000..b2f1996
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsec.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asecDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asecDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsec: _factoriesNumber.createAsec
+};
+exports.asecDependencies = asecDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsech.generated.js
new file mode 100644
index 0000000..903741c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsech.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asechDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asechDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsech: _factoriesNumber.createAsech
+};
+exports.asechDependencies = asechDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsin.generated.js
new file mode 100644
index 0000000..5a23848
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsin.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asinDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsin: _factoriesNumber.createAsin
+};
+exports.asinDependencies = asinDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..8f0f0b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsinh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinhDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var asinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsinh: _factoriesNumber.createAsinh
+};
+exports.asinhDependencies = asinhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..8d0aa51
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AssignmentNodeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var AssignmentNodeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAssignmentNode: _factoriesNumber.createAssignmentNode
+};
+exports.AssignmentNodeDependencies = AssignmentNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan.generated.js
new file mode 100644
index 0000000..9ff8f14
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var atanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan: _factoriesNumber.createAtan
+};
+exports.atanDependencies = atanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..8311a7c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan2.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atan2Dependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var atan2Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan2: _factoriesNumber.createAtan2
+};
+exports.atan2Dependencies = atan2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..6b7af70
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtanh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanhDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var atanhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtanh: _factoriesNumber.createAtanh
+};
+exports.atanhDependencies = atanhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..a0c9972
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bellNumbersDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesStirlingS2Generated = require("./dependenciesStirlingS2.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bellNumbersDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  stirlingS2Dependencies: _dependenciesStirlingS2Generated.stirlingS2Dependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBellNumbers: _factoriesNumber.createBellNumbers
+};
+exports.bellNumbersDependencies = bellNumbersDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..edb3a18
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitAnd.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitAndDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitAnd: _factoriesNumber.createBitAnd
+};
+exports.bitAndDependencies = bitAndDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..4e5a930
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitNot.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitNotDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitNotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitNot: _factoriesNumber.createBitNot
+};
+exports.bitNotDependencies = bitNotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..2a78c75
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitOr.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitOrDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitOrDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitOr: _factoriesNumber.createBitOr
+};
+exports.bitOrDependencies = bitOrDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..9a0c052
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitXor.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitXorDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var bitXorDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitXor: _factoriesNumber.createBitXor
+};
+exports.bitXorDependencies = bitXorDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..18340e5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBlockNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.BlockNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesResultSetGenerated = require("./dependenciesResultSet.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var BlockNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  ResultSetDependencies: _dependenciesResultSetGenerated.ResultSetDependencies,
+  createBlockNode: _factoriesNumber.createBlockNode
+};
+exports.BlockNodeDependencies = BlockNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..5dbf779
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBoolean.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.booleanDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var booleanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBoolean: _factoriesNumber.createBoolean
+};
+exports.booleanDependencies = booleanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..ec161a6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCatalan.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.catalanDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var catalanDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCatalan: _factoriesNumber.createCatalan
+};
+exports.catalanDependencies = catalanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..7197d00
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCbrt.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cbrtDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cbrtDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCbrt: _factoriesNumber.createCbrt
+};
+exports.cbrtDependencies = cbrtDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCeil.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCeil.generated.js
new file mode 100644
index 0000000..7cccb73
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCeil.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ceilDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ceilDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCeil: _factoriesNumber.createCeil
+};
+exports.ceilDependencies = ceilDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChain.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChain.generated.js
new file mode 100644
index 0000000..73e0b04
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChain.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.chainDependencies = void 0;
+
+var _dependenciesChainClassGenerated = require("./dependenciesChainClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var chainDependencies = {
+  ChainDependencies: _dependenciesChainClassGenerated.ChainDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createChain: _factoriesNumber.createChain
+};
+exports.chainDependencies = chainDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..dc96665
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChainClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ChainDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ChainDependencies = {
+  createChainClass: _factoriesNumber.createChainClass
+};
+exports.ChainDependencies = ChainDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesClone.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesClone.generated.js
new file mode 100644
index 0000000..53b4ffe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesClone.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cloneDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cloneDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createClone: _factoriesNumber.createClone
+};
+exports.cloneDependencies = cloneDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..223de5f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinations.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var combinationsDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinations: _factoriesNumber.createCombinations
+};
+exports.combinationsDependencies = combinationsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..3abd491
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsWithRepDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var combinationsWithRepDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinationsWithRep: _factoriesNumber.createCombinationsWithRep
+};
+exports.combinationsWithRepDependencies = combinationsWithRepDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompare.generated.js
new file mode 100644
index 0000000..f9c7058
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompare.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compareDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompare: _factoriesNumber.createCompare
+};
+exports.compareDependencies = compareDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..d3a8579
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareNaturalDependencies = void 0;
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compareNaturalDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareNatural: _factoriesNumber.createCompareNatural
+};
+exports.compareNaturalDependencies = compareNaturalDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..a6520f8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareText.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareTextDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compareTextDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareText: _factoriesNumber.createCompareText
+};
+exports.compareTextDependencies = compareTextDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompile.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompile.generated.js
new file mode 100644
index 0000000..711b1aa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompile.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compileDependencies = void 0;
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compileDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompile: _factoriesNumber.createCompile
+};
+exports.compileDependencies = compileDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesComposition.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesComposition.generated.js
new file mode 100644
index 0000000..cdcd6bc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesComposition.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compositionDependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var compositionDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createComposition: _factoriesNumber.createComposition
+};
+exports.compositionDependencies = compositionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..8386eea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConditionalNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ConditionalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConditionalNode: _factoriesNumber.createConditionalNode
+};
+exports.ConditionalNodeDependencies = ConditionalNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..3a1c8ef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConstantNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConstantNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ConstantNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConstantNode: _factoriesNumber.createConstantNode
+};
+exports.ConstantNodeDependencies = ConstantNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCos.generated.js
new file mode 100644
index 0000000..ede6a4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCos.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cosDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cosDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCos: _factoriesNumber.createCos
+};
+exports.cosDependencies = cosDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCosh.generated.js
new file mode 100644
index 0000000..50b791d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCosh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coshDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var coshDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCosh: _factoriesNumber.createCosh
+};
+exports.coshDependencies = coshDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCot.generated.js
new file mode 100644
index 0000000..2e1da3e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCot.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cotDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCot: _factoriesNumber.createCot
+};
+exports.cotDependencies = cotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCoth.generated.js
new file mode 100644
index 0000000..a9390e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCoth.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cothDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cothDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCoth: _factoriesNumber.createCoth
+};
+exports.cothDependencies = cothDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsc.generated.js
new file mode 100644
index 0000000..42c3ca6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsc.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cscDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cscDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsc: _factoriesNumber.createCsc
+};
+exports.cscDependencies = cscDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsch.generated.js
new file mode 100644
index 0000000..12ef88d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsch.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cschDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cschDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsch: _factoriesNumber.createCsch
+};
+exports.cschDependencies = cschDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCube.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCube.generated.js
new file mode 100644
index 0000000..77db5c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCube.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cubeDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cubeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCube: _factoriesNumber.createCube
+};
+exports.cubeDependencies = cubeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..fcf89f6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSum.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cumsumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSum: _factoriesNumber.createCumSum
+};
+exports.cumsumDependencies = cumsumDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..b8e6dbe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var cumsumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSumTransform: _factoriesNumber.createCumSumTransform
+};
+exports.cumsumTransformDependencies = cumsumTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..6a26c48
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deepEqualDependencies = void 0;
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var deepEqualDependencies = {
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDeepEqual: _factoriesNumber.createDeepEqual
+};
+exports.deepEqualDependencies = deepEqualDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..4ffafb2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDerivative.generated.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivativeDependencies = void 0;
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var derivativeDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDerivative: _factoriesNumber.createDerivative
+};
+exports.derivativeDependencies = derivativeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivide.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivide.generated.js
new file mode 100644
index 0000000..81d9d3d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivide.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var divideDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivide: _factoriesNumber.createDivide
+};
+exports.divideDependencies = divideDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..0a713df
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideScalarDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var divideScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivideScalar: _factoriesNumber.createDivideScalar
+};
+exports.divideScalarDependencies = divideScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesE.generated.js
new file mode 100644
index 0000000..4a7292e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesE.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var eDependencies = {
+  createE: _factoriesNumber.createE
+};
+exports.eDependencies = eDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqual.generated.js
new file mode 100644
index 0000000..dcff0b6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqual.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var equalDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqual: _factoriesNumber.createEqual
+};
+exports.equalDependencies = equalDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..56b1d6a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalScalarDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var equalScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualScalar: _factoriesNumber.createEqualScalar
+};
+exports.equalScalarDependencies = equalScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..3a2e42e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualText.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalTextDependencies = void 0;
+
+var _dependenciesCompareTextGenerated = require("./dependenciesCompareText.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var equalTextDependencies = {
+  compareTextDependencies: _dependenciesCompareTextGenerated.compareTextDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualText: _factoriesNumber.createEqualText
+};
+exports.equalTextDependencies = equalTextDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesErf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesErf.generated.js
new file mode 100644
index 0000000..b2e90b3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesErf.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.erfDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var erfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createErf: _factoriesNumber.createErf
+};
+exports.erfDependencies = erfDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..a2ff018
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEvaluate.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.evaluateDependencies = void 0;
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var evaluateDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEvaluate: _factoriesNumber.createEvaluate
+};
+exports.evaluateDependencies = evaluateDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExp.generated.js
new file mode 100644
index 0000000..ac3cdc1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExp.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var expDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExp: _factoriesNumber.createExp
+};
+exports.expDependencies = expDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..357c0ff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExpm1.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expm1Dependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var expm1Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExpm1: _factoriesNumber.createExpm1
+};
+exports.expm1Dependencies = expm1Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..ad4af21
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFactorial.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.factorialDependencies = void 0;
+
+var _dependenciesGammaGenerated = require("./dependenciesGamma.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var factorialDependencies = {
+  gammaDependencies: _dependenciesGammaGenerated.gammaDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFactorial: _factoriesNumber.createFactorial
+};
+exports.factorialDependencies = factorialDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFalse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFalse.generated.js
new file mode 100644
index 0000000..2e1ae31
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFalse.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.falseDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var falseDependencies = {
+  createFalse: _factoriesNumber.createFalse
+};
+exports.falseDependencies = falseDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilter.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilter.generated.js
new file mode 100644
index 0000000..29713af
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilter.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var filterDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilter: _factoriesNumber.createFilter
+};
+exports.filterDependencies = filterDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..4923429
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterTransformDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var filterTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilterTransform: _factoriesNumber.createFilterTransform
+};
+exports.filterTransformDependencies = filterTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFix.generated.js
new file mode 100644
index 0000000..b582d04
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFix.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fixDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var fixDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFix: _factoriesNumber.createFix
+};
+exports.fixDependencies = fixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFloor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFloor.generated.js
new file mode 100644
index 0000000..2d9e577
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFloor.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.floorDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var floorDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFloor: _factoriesNumber.createFloor
+};
+exports.floorDependencies = floorDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEach.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEach.generated.js
new file mode 100644
index 0000000..4191381
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEach.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var forEachDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEach: _factoriesNumber.createForEach
+};
+exports.forEachDependencies = forEachDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..dba9d17
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachTransformDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var forEachTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEachTransform: _factoriesNumber.createForEachTransform
+};
+exports.forEachTransformDependencies = forEachTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFormat.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFormat.generated.js
new file mode 100644
index 0000000..81035a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFormat.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.formatDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var formatDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFormat: _factoriesNumber.createFormat
+};
+exports.formatDependencies = formatDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..235563e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionAssignmentNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var FunctionAssignmentNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFunctionAssignmentNode: _factoriesNumber.createFunctionAssignmentNode
+};
+exports.FunctionAssignmentNodeDependencies = FunctionAssignmentNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..1738c1a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var FunctionNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  createFunctionNode: _factoriesNumber.createFunctionNode
+};
+exports.FunctionNodeDependencies = FunctionNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGamma.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGamma.generated.js
new file mode 100644
index 0000000..18ef5b4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGamma.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var gammaDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGamma: _factoriesNumber.createGamma
+};
+exports.gammaDependencies = gammaDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGcd.generated.js
new file mode 100644
index 0000000..37b3f61
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGcd.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gcdDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var gcdDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGcd: _factoriesNumber.createGcd
+};
+exports.gcdDependencies = gcdDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..df9874d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hasNumericValueDependencies = void 0;
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var hasNumericValueDependencies = {
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHasNumericValue: _factoriesNumber.createHasNumericValue
+};
+exports.hasNumericValueDependencies = hasNumericValueDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelp.generated.js
new file mode 100644
index 0000000..da56092
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelp.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.helpDependencies = void 0;
+
+var _dependenciesHelpClassGenerated = require("./dependenciesHelpClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var helpDependencies = {
+  HelpDependencies: _dependenciesHelpClassGenerated.HelpDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHelp: _factoriesNumber.createHelp
+};
+exports.helpDependencies = helpDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..8e579df
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelpClass.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.HelpDependencies = void 0;
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var HelpDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  createHelpClass: _factoriesNumber.createHelpClass
+};
+exports.HelpDependencies = HelpDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHypot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHypot.generated.js
new file mode 100644
index 0000000..0f80147
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHypot.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hypotDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var hypotDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHypot: _factoriesNumber.createHypot
+};
+exports.hypotDependencies = hypotDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndex.generated.js
new file mode 100644
index 0000000..fc2e5cc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndex.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var indexDependencies = {
+  createIndex: _factoriesNumber.createIndex
+};
+exports.indexDependencies = indexDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..f2a00b2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndexNode.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _dependenciesRangeClassGenerated = require("./dependenciesRangeClass.generated.js");
+
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var IndexNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  RangeDependencies: _dependenciesRangeClassGenerated.RangeDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  createIndexNode: _factoriesNumber.createIndexNode
+};
+exports.IndexNodeDependencies = IndexNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..0f006ff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesInfinity.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.InfinityDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var InfinityDependencies = {
+  createInfinity: _factoriesNumber.createInfinity
+};
+exports.InfinityDependencies = InfinityDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..2e03ced
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsInteger.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isIntegerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsInteger: _factoriesNumber.createIsInteger
+};
+exports.isIntegerDependencies = isIntegerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..59227f4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNaN.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNaNDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isNaNDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNaN: _factoriesNumber.createIsNaN
+};
+exports.isNaNDependencies = isNaNDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..8834a38
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNegative.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNegativeDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isNegativeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNegative: _factoriesNumber.createIsNegative
+};
+exports.isNegativeDependencies = isNegativeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..67b7111
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNumericDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isNumericDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNumeric: _factoriesNumber.createIsNumeric
+};
+exports.isNumericDependencies = isNumericDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..9a1c138
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPositive.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPositiveDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isPositiveDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPositive: _factoriesNumber.createIsPositive
+};
+exports.isPositiveDependencies = isPositiveDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..713a787
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPrime.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPrimeDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isPrimeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPrime: _factoriesNumber.createIsPrime
+};
+exports.isPrimeDependencies = isPrimeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..99e9587
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsZero.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isZeroDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var isZeroDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsZero: _factoriesNumber.createIsZero
+};
+exports.isZeroDependencies = isZeroDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN10.generated.js
new file mode 100644
index 0000000..6ea5bff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN10.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN10Dependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LN10Dependencies = {
+  createLN10: _factoriesNumber.createLN10
+};
+exports.LN10Dependencies = LN10Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN2.generated.js
new file mode 100644
index 0000000..cbcf6e8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN2.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN2Dependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LN2Dependencies = {
+  createLN2: _factoriesNumber.createLN2
+};
+exports.LN2Dependencies = LN2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..0d7cee0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG10E.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG10EDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LOG10EDependencies = {
+  createLOG10E: _factoriesNumber.createLOG10E
+};
+exports.LOG10EDependencies = LOG10EDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..edd6a63
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG2E.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG2EDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var LOG2EDependencies = {
+  createLOG2E: _factoriesNumber.createLOG2E
+};
+exports.LOG2EDependencies = LOG2EDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLarger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLarger.generated.js
new file mode 100644
index 0000000..8bbe5a2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLarger.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var largerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLarger: _factoriesNumber.createLarger
+};
+exports.largerDependencies = largerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..a6b48a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLargerEq.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerEqDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var largerEqDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLargerEq: _factoriesNumber.createLargerEq
+};
+exports.largerEqDependencies = largerEqDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLcm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLcm.generated.js
new file mode 100644
index 0000000..c9b6f52
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLcm.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lcmDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var lcmDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLcm: _factoriesNumber.createLcm
+};
+exports.lcmDependencies = lcmDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..c854546
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLeftShift.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leftShiftDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var leftShiftDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLeftShift: _factoriesNumber.createLeftShift
+};
+exports.leftShiftDependencies = leftShiftDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog.generated.js
new file mode 100644
index 0000000..0526358
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.logDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var logDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog: _factoriesNumber.createLog
+};
+exports.logDependencies = logDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog10.generated.js
new file mode 100644
index 0000000..8e4955f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog10.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log10Dependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var log10Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog10: _factoriesNumber.createLog10
+};
+exports.log10Dependencies = log10Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..124ee6f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog1p.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log1pDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var log1pDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog1p: _factoriesNumber.createLog1p
+};
+exports.log1pDependencies = log1pDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog2.generated.js
new file mode 100644
index 0000000..5d237d3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog2.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log2Dependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var log2Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog2: _factoriesNumber.createLog2
+};
+exports.log2Dependencies = log2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMad.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMad.generated.js
new file mode 100644
index 0000000..6ae9dbb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMad.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.madDependencies = void 0;
+
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+
+var _dependenciesMedianGenerated = require("./dependenciesMedian.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var madDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  medianDependencies: _dependenciesMedianGenerated.medianDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMad: _factoriesNumber.createMad
+};
+exports.madDependencies = madDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMap.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMap.generated.js
new file mode 100644
index 0000000..61e4e11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMap.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var mapDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMap: _factoriesNumber.createMap
+};
+exports.mapDependencies = mapDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..33d8587
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapTransform.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapTransformDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var mapTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapTransform: _factoriesNumber.createMapTransform
+};
+exports.mapTransformDependencies = mapTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..589c3b2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMatrix.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var matrixDependencies = {
+  createMatrix: _factoriesNumber.createMatrix
+};
+exports.matrixDependencies = matrixDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMax.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMax.generated.js
new file mode 100644
index 0000000..85374d0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMax.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxDependencies = void 0;
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var maxDependencies = {
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMax: _factoriesNumber.createMax
+};
+exports.maxDependencies = maxDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..fd2ef77
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxTransformDependencies = void 0;
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var maxTransformDependencies = {
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMaxTransform: _factoriesNumber.createMaxTransform
+};
+exports.maxTransformDependencies = maxTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMean.generated.js
new file mode 100644
index 0000000..46b52e5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMean.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var meanDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMean: _factoriesNumber.createMean
+};
+exports.meanDependencies = meanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..9b40641
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var meanTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMeanTransform: _factoriesNumber.createMeanTransform
+};
+exports.meanTransformDependencies = meanTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMedian.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMedian.generated.js
new file mode 100644
index 0000000..5959a24
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMedian.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.medianDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var medianDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMedian: _factoriesNumber.createMedian
+};
+exports.medianDependencies = medianDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMin.generated.js
new file mode 100644
index 0000000..6397073
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMin.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minDependencies = void 0;
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var minDependencies = {
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMin: _factoriesNumber.createMin
+};
+exports.minDependencies = minDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..aad73c8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMinTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minTransformDependencies = void 0;
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var minTransformDependencies = {
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMinTransform: _factoriesNumber.createMinTransform
+};
+exports.minTransformDependencies = minTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMod.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMod.generated.js
new file mode 100644
index 0000000..7dcc201
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMod.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var modDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMod: _factoriesNumber.createMod
+};
+exports.modDependencies = modDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMode.generated.js
new file mode 100644
index 0000000..4645d34
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMode.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modeDependencies = void 0;
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var modeDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMode: _factoriesNumber.createMode
+};
+exports.modeDependencies = modeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..e1df981
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultinomial.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multinomialDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var multinomialDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultinomial: _factoriesNumber.createMultinomial
+};
+exports.multinomialDependencies = multinomialDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..b236794
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiply.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var multiplyDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiply: _factoriesNumber.createMultiply
+};
+exports.multiplyDependencies = multiplyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..d2b503a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyScalarDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var multiplyScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiplyScalar: _factoriesNumber.createMultiplyScalar
+};
+exports.multiplyScalarDependencies = multiplyScalarDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNaN.generated.js
new file mode 100644
index 0000000..eff7fb0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNaN.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NaNDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var NaNDependencies = {
+  createNaN: _factoriesNumber.createNaN
+};
+exports.NaNDependencies = NaNDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNode.generated.js
new file mode 100644
index 0000000..386cfe1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NodeDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var NodeDependencies = {
+  createNode: _factoriesNumber.createNode
+};
+exports.NodeDependencies = NodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNorm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNorm.generated.js
new file mode 100644
index 0000000..79cdca8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNorm.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.normDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var normDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNorm: _factoriesNumber.createNorm
+};
+exports.normDependencies = normDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNot.generated.js
new file mode 100644
index 0000000..2e0b59d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNot.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.notDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var notDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNot: _factoriesNumber.createNot
+};
+exports.notDependencies = notDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..0f89bd1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNthRoot.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var nthRootDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNthRoot: _factoriesNumber.createNthRoot
+};
+exports.nthRootDependencies = nthRootDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNull.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNull.generated.js
new file mode 100644
index 0000000..1f63576
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNull.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var nullDependencies = {
+  createNull: _factoriesNumber.createNull
+};
+exports.nullDependencies = nullDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumber.generated.js
new file mode 100644
index 0000000..5e5d173
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumber.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numberDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var numberDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNumber: _factoriesNumber.createNumber
+};
+exports.numberDependencies = numberDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..2d79622
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumeric.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numericDependencies = void 0;
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var numericDependencies = {
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  createNumeric: _factoriesNumber.createNumeric
+};
+exports.numericDependencies = numericDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..fde34ab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesObjectNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ObjectNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ObjectNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createObjectNode: _factoriesNumber.createObjectNode
+};
+exports.ObjectNodeDependencies = ObjectNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..912d426
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.OperatorNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var OperatorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createOperatorNode: _factoriesNumber.createOperatorNode
+};
+exports.OperatorNodeDependencies = OperatorNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOr.generated.js
new file mode 100644
index 0000000..433f7d3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOr.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.orDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var orDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOr: _factoriesNumber.createOr
+};
+exports.orDependencies = orDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..cd0aee9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParenthesisNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ParenthesisNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createParenthesisNode: _factoriesNumber.createParenthesisNode
+};
+exports.ParenthesisNodeDependencies = ParenthesisNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParse.generated.js
new file mode 100644
index 0000000..8396871
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParse.generated.js
@@ -0,0 +1,68 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parseDependencies = void 0;
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesAssignmentNode.generated.js");
+
+var _dependenciesBlockNodeGenerated = require("./dependenciesBlockNode.generated.js");
+
+var _dependenciesConditionalNodeGenerated = require("./dependenciesConditionalNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesFunctionAssignmentNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesRangeNodeGenerated = require("./dependenciesRangeNode.generated.js");
+
+var _dependenciesRelationalNodeGenerated = require("./dependenciesRelationalNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var parseDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  AssignmentNodeDependencies: _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies,
+  BlockNodeDependencies: _dependenciesBlockNodeGenerated.BlockNodeDependencies,
+  ConditionalNodeDependencies: _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies: _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  RangeNodeDependencies: _dependenciesRangeNodeGenerated.RangeNodeDependencies,
+  RelationalNodeDependencies: _dependenciesRelationalNodeGenerated.RelationalNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParse: _factoriesNumber.createParse
+};
+exports.parseDependencies = parseDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParser.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParser.generated.js
new file mode 100644
index 0000000..e625639
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParser.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parserDependencies = void 0;
+
+var _dependenciesParserClassGenerated = require("./dependenciesParserClass.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var parserDependencies = {
+  ParserDependencies: _dependenciesParserClassGenerated.ParserDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParser: _factoriesNumber.createParser
+};
+exports.parserDependencies = parserDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..b1051c5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParserClass.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParserDependencies = void 0;
+
+var _dependenciesEvaluateGenerated = require("./dependenciesEvaluate.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ParserDependencies = {
+  evaluateDependencies: _dependenciesEvaluateGenerated.evaluateDependencies,
+  createParserClass: _factoriesNumber.createParserClass
+};
+exports.ParserDependencies = ParserDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..a00d73d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.partitionSelectDependencies = void 0;
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var partitionSelectDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPartitionSelect: _factoriesNumber.createPartitionSelect
+};
+exports.partitionSelectDependencies = partitionSelectDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..a5c38a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPermutations.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.permutationsDependencies = void 0;
+
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var permutationsDependencies = {
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPermutations: _factoriesNumber.createPermutations
+};
+exports.permutationsDependencies = permutationsDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPhi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPhi.generated.js
new file mode 100644
index 0000000..83cc03b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPhi.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.phiDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var phiDependencies = {
+  createPhi: _factoriesNumber.createPhi
+};
+exports.phiDependencies = phiDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPi.generated.js
new file mode 100644
index 0000000..6f1fd70
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPi.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.piDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var piDependencies = {
+  createPi: _factoriesNumber.createPi
+};
+exports.piDependencies = piDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..7c4a666
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPickRandom.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pickRandomDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var pickRandomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPickRandom: _factoriesNumber.createPickRandom
+};
+exports.pickRandomDependencies = pickRandomDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPow.generated.js
new file mode 100644
index 0000000..6cdd879
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPow.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.powDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var powDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPow: _factoriesNumber.createPow
+};
+exports.powDependencies = powDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPrint.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPrint.generated.js
new file mode 100644
index 0000000..2ea64a4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPrint.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var printDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPrint: _factoriesNumber.createPrint
+};
+exports.printDependencies = printDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesProd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesProd.generated.js
new file mode 100644
index 0000000..2d160a4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesProd.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.prodDependencies = void 0;
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var prodDependencies = {
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createProd: _factoriesNumber.createProd
+};
+exports.prodDependencies = prodDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..4962a46
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantileSeqDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var quantileSeqDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createQuantileSeq: _factoriesNumber.createQuantileSeq
+};
+exports.quantileSeqDependencies = quantileSeqDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandom.generated.js
new file mode 100644
index 0000000..dbd43a5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandom.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var randomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandom: _factoriesNumber.createRandom
+};
+exports.randomDependencies = randomDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..a956e16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandomInt.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomIntDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var randomIntDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandomInt: _factoriesNumber.createRandomInt
+};
+exports.randomIntDependencies = randomIntDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRange.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRange.generated.js
new file mode 100644
index 0000000..d6ed2c4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRange.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rangeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRange: _factoriesNumber.createRange
+};
+exports.rangeDependencies = rangeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..e376e44
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var RangeDependencies = {
+  createRangeClass: _factoriesNumber.createRangeClass
+};
+exports.RangeDependencies = RangeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..e51ab3b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var RangeNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRangeNode: _factoriesNumber.createRangeNode
+};
+exports.RangeNodeDependencies = RangeNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..7a82a40
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeTransformDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rangeTransformDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRangeTransform: _factoriesNumber.createRangeTransform
+};
+exports.rangeTransformDependencies = rangeTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..2ff33cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRationalize.generated.js
@@ -0,0 +1,80 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rationalizeDependencies = void 0;
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rationalizeDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRationalize: _factoriesNumber.createRationalize
+};
+exports.rationalizeDependencies = rationalizeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..7e62c1b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RelationalNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var RelationalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRelationalNode: _factoriesNumber.createRelationalNode
+};
+exports.RelationalNodeDependencies = RelationalNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..f962a2c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReplacer.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.replacerDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var replacerDependencies = {
+  createReplacer: _factoriesNumber.createReplacer
+};
+exports.replacerDependencies = replacerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResolve.generated.js
new file mode 100644
index 0000000..86ebf82
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResolve.generated.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resolveDependencies = void 0;
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var resolveDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  createResolve: _factoriesNumber.createResolve
+};
+exports.resolveDependencies = resolveDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..0971b47
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResultSet.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ResultSetDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var ResultSetDependencies = {
+  createResultSet: _factoriesNumber.createResultSet
+};
+exports.ResultSetDependencies = ResultSetDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReviver.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReviver.generated.js
new file mode 100644
index 0000000..381545d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReviver.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reviverDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var reviverDependencies = {
+  createReviver: _factoriesNumber.createReviver
+};
+exports.reviverDependencies = reviverDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..5c64430
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightArithShiftDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rightArithShiftDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRightArithShift: _factoriesNumber.createRightArithShift
+};
+exports.rightArithShiftDependencies = rightArithShiftDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..00f89e4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightLogShiftDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var rightLogShiftDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRightLogShift: _factoriesNumber.createRightLogShift
+};
+exports.rightLogShiftDependencies = rightLogShiftDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRound.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRound.generated.js
new file mode 100644
index 0000000..6a99679
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRound.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.roundDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var roundDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRound: _factoriesNumber.createRound
+};
+exports.roundDependencies = roundDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..6c07c04
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT1_2Dependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+// eslint-disable-line camelcase
+var SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  createSQRT1_2: _factoriesNumber.createSQRT1_2
+};
+exports.SQRT1_2Dependencies = SQRT1_2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..84711ae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT2.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT2Dependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var SQRT2Dependencies = {
+  createSQRT2: _factoriesNumber.createSQRT2
+};
+exports.SQRT2Dependencies = SQRT2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSec.generated.js
new file mode 100644
index 0000000..3cce7d2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSec.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var secDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSec: _factoriesNumber.createSec
+};
+exports.secDependencies = secDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSech.generated.js
new file mode 100644
index 0000000..a3badd1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSech.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sechDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sechDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSech: _factoriesNumber.createSech
+};
+exports.sechDependencies = sechDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSign.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSign.generated.js
new file mode 100644
index 0000000..81c6f1e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSign.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.signDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var signDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSign: _factoriesNumber.createSign
+};
+exports.signDependencies = signDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..f5cace1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplify.generated.js
@@ -0,0 +1,80 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyDependencies = void 0;
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesResolveGenerated = require("./dependenciesResolve.generated.js");
+
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var simplifyDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  resolveDependencies: _dependenciesResolveGenerated.resolveDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplify: _factoriesNumber.createSimplify
+};
+exports.simplifyDependencies = simplifyDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..c96b93c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyCoreDependencies = void 0;
+
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var simplifyCoreDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  createSimplifyCore: _factoriesNumber.createSimplifyCore
+};
+exports.simplifyCoreDependencies = simplifyCoreDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSin.generated.js
new file mode 100644
index 0000000..6df966b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSin.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sinDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSin: _factoriesNumber.createSin
+};
+exports.sinDependencies = sinDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSinh.generated.js
new file mode 100644
index 0000000..dedc2bf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSinh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinhDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSinh: _factoriesNumber.createSinh
+};
+exports.sinhDependencies = sinhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSize.generated.js
new file mode 100644
index 0000000..299261e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSize.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sizeDependencies = void 0;
+
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sizeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSize: _factoriesNumber.createSize
+};
+exports.sizeDependencies = sizeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..1f2d161
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmaller.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var smallerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmaller: _factoriesNumber.createSmaller
+};
+exports.smallerDependencies = smallerDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..a028939
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerEqDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var smallerEqDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmallerEq: _factoriesNumber.createSmallerEq
+};
+exports.smallerEqDependencies = smallerEqDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..c476361
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSqrt.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sqrtDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqrt: _factoriesNumber.createSqrt
+};
+exports.sqrtDependencies = sqrtDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSquare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSquare.generated.js
new file mode 100644
index 0000000..3b0a54c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSquare.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squareDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var squareDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSquare: _factoriesNumber.createSquare
+};
+exports.squareDependencies = squareDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStd.generated.js
new file mode 100644
index 0000000..31f4917
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStd.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdDependencies = void 0;
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stdDependencies = {
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStd: _factoriesNumber.createStd
+};
+exports.stdDependencies = stdDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..5a7b6f4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStdTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdTransformDependencies = void 0;
+
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stdTransformDependencies = {
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStdTransform: _factoriesNumber.createStdTransform
+};
+exports.stdTransformDependencies = stdTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..fd12b45
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stirlingS2Dependencies = void 0;
+
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stirlingS2Dependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createStirlingS2: _factoriesNumber.createStirlingS2
+};
+exports.stirlingS2Dependencies = stirlingS2Dependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesString.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesString.generated.js
new file mode 100644
index 0000000..e9f3006
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesString.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stringDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var stringDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createString: _factoriesNumber.createString
+};
+exports.stringDependencies = stringDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubset.generated.js
new file mode 100644
index 0000000..86a1a41
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubset.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var subsetDependencies = {
+  createSubset: _factoriesNumber.createSubset
+};
+exports.subsetDependencies = subsetDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..3d00955
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetTransformDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var subsetTransformDependencies = {
+  createSubsetTransform: _factoriesNumber.createSubsetTransform
+};
+exports.subsetTransformDependencies = subsetTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..7f08681
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtract.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var subtractDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSubtract: _factoriesNumber.createSubtract
+};
+exports.subtractDependencies = subtractDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSum.generated.js
new file mode 100644
index 0000000..97ac32f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSum.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSum: _factoriesNumber.createSum
+};
+exports.sumDependencies = sumDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..f7bd46c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSumTransform.generated.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var sumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSumTransform: _factoriesNumber.createSumTransform
+};
+exports.sumTransformDependencies = sumTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..7f3d10d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SymbolNodeDependencies = void 0;
+
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var SymbolNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createSymbolNode: _factoriesNumber.createSymbolNode
+};
+exports.SymbolNodeDependencies = SymbolNodeDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTan.generated.js
new file mode 100644
index 0000000..8d5600a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTan.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var tanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTan: _factoriesNumber.createTan
+};
+exports.tanDependencies = tanDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTanh.generated.js
new file mode 100644
index 0000000..3b25d43
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTanh.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanhDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var tanhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTanh: _factoriesNumber.createTanh
+};
+exports.tanhDependencies = tanhDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTau.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTau.generated.js
new file mode 100644
index 0000000..00ce134
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTau.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tauDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var tauDependencies = {
+  createTau: _factoriesNumber.createTau
+};
+exports.tauDependencies = tauDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTrue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTrue.generated.js
new file mode 100644
index 0000000..ee2f707
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTrue.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.trueDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var trueDependencies = {
+  createTrue: _factoriesNumber.createTrue
+};
+exports.trueDependencies = trueDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..4066df8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTypeOf.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typeOfDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var typeOfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTypeOf: _factoriesNumber.createTypeOf
+};
+exports.typeOfDependencies = typeOfDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTyped.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTyped.generated.js
new file mode 100644
index 0000000..dc1a7f8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTyped.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typedDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var typedDependencies = {
+  createTyped: _factoriesNumber.createTyped
+};
+exports.typedDependencies = typedDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..9e69ead
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryMinusDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var unaryMinusDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryMinus: _factoriesNumber.createUnaryMinus
+};
+exports.unaryMinusDependencies = unaryMinusDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..9bc7409
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryPlusDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var unaryPlusDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryPlus: _factoriesNumber.createUnaryPlus
+};
+exports.unaryPlusDependencies = unaryPlusDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..c86ef96
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnequal.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unequalDependencies = void 0;
+
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var unequalDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnequal: _factoriesNumber.createUnequal
+};
+exports.unequalDependencies = unequalDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..44e123c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.EDependencies = void 0;
+
+var _dependenciesEGenerated = require("./dependenciesE.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var EDependencies = {
+  eDependencies: _dependenciesEGenerated.eDependencies,
+  createUppercaseE: _factoriesNumber.createUppercaseE
+};
+exports.EDependencies = EDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..223191b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.PIDependencies = void 0;
+
+var _dependenciesPiGenerated = require("./dependenciesPi.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var PIDependencies = {
+  piDependencies: _dependenciesPiGenerated.piDependencies,
+  createUppercasePi: _factoriesNumber.createUppercasePi
+};
+exports.PIDependencies = PIDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVariance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVariance.generated.js
new file mode 100644
index 0000000..c0e7cf1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVariance.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesApplyGenerated = require("./dependenciesApply.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var varianceDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  applyDependencies: _dependenciesApplyGenerated.applyDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVariance: _factoriesNumber.createVariance
+};
+exports.varianceDependencies = varianceDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..0ab0be3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceTransformDependencies = void 0;
+
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+
+var _dependenciesApplyGenerated = require("./dependenciesApply.generated.js");
+
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var varianceTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  applyDependencies: _dependenciesApplyGenerated.applyDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVarianceTransform: _factoriesNumber.createVarianceTransform
+};
+exports.varianceTransformDependencies = varianceTransformDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVersion.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVersion.generated.js
new file mode 100644
index 0000000..e522697
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVersion.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.versionDependencies = void 0;
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var versionDependencies = {
+  createVersion: _factoriesNumber.createVersion
+};
+exports.versionDependencies = versionDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..eda1b9e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXgcd.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xgcdDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var xgcdDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXgcd: _factoriesNumber.createXgcd
+};
+exports.xgcdDependencies = xgcdDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXor.generated.js
new file mode 100644
index 0000000..66e7ff3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXor.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xorDependencies = void 0;
+
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+
+var _factoriesNumber = require("../../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var xorDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXor: _factoriesNumber.createXor
+};
+exports.xorDependencies = xorDependencies;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/impureFunctionsAny.generated.js b/node_modules/mathjs/lib/cjs/entry/impureFunctionsAny.generated.js
new file mode 100644
index 0000000..5f20481
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/impureFunctionsAny.generated.js
@@ -0,0 +1,710 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivative = exports.compile = exports.chain = exports.SymbolNode = exports.RelationalNode = exports.RangeNode = exports.Parser = exports.ParenthesisNode = exports.OperatorNode = exports.ObjectNode = exports.Node = exports.IndexNode = exports.Help = exports.FunctionNode = exports.FunctionAssignmentNode = exports.ConstantNode = exports.ConditionalNode = exports.Chain = exports.BlockNode = exports.AssignmentNode = exports.ArrayNode = exports.AccessorNode = void 0;
+Object.defineProperty(exports, "docs", {
+  enumerable: true,
+  get: function get() {
+    return _embeddedDocs.embeddedDocs;
+  }
+});
+exports.symbolicEqual = exports.simplifyCore = exports.simplify = exports.reviver = exports.resolve = exports.rationalize = exports.parser = exports.parse = exports.leafCount = exports.help = exports.evaluate = void 0;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+var _configReadonly = require("./configReadonly.js");
+
+var _factoriesAny = require("../factoriesAny.js");
+
+var _pureFunctionsAnyGenerated = require("./pureFunctionsAny.generated.js");
+
+var _embeddedDocs = require("../expression/embeddedDocs/embeddedDocs.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var math = {}; // NOT pure!
+
+var mathWithTransform = {}; // NOT pure!
+
+var classes = {}; // NOT pure!
+
+var Chain = (0, _factoriesAny.createChainClass)({
+  math: math
+});
+exports.Chain = Chain;
+var Node = (0, _factoriesAny.createNode)({
+  mathWithTransform: mathWithTransform
+});
+exports.Node = Node;
+var ObjectNode = (0, _factoriesAny.createObjectNode)({
+  Node: Node
+});
+exports.ObjectNode = ObjectNode;
+var OperatorNode = (0, _factoriesAny.createOperatorNode)({
+  Node: Node
+});
+exports.OperatorNode = OperatorNode;
+var ParenthesisNode = (0, _factoriesAny.createParenthesisNode)({
+  Node: Node
+});
+exports.ParenthesisNode = ParenthesisNode;
+var RelationalNode = (0, _factoriesAny.createRelationalNode)({
+  Node: Node
+});
+exports.RelationalNode = RelationalNode;
+var ArrayNode = (0, _factoriesAny.createArrayNode)({
+  Node: Node
+});
+exports.ArrayNode = ArrayNode;
+var BlockNode = (0, _factoriesAny.createBlockNode)({
+  Node: Node,
+  ResultSet: _pureFunctionsAnyGenerated.ResultSet
+});
+exports.BlockNode = BlockNode;
+var ConditionalNode = (0, _factoriesAny.createConditionalNode)({
+  Node: Node
+});
+exports.ConditionalNode = ConditionalNode;
+var ConstantNode = (0, _factoriesAny.createConstantNode)({
+  Node: Node
+});
+exports.ConstantNode = ConstantNode;
+var RangeNode = (0, _factoriesAny.createRangeNode)({
+  Node: Node
+});
+exports.RangeNode = RangeNode;
+var reviver = (0, _factoriesAny.createReviver)({
+  classes: classes
+});
+exports.reviver = reviver;
+var chain = (0, _factoriesAny.createChain)({
+  Chain: Chain,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.chain = chain;
+var FunctionAssignmentNode = (0, _factoriesAny.createFunctionAssignmentNode)({
+  Node: Node,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.FunctionAssignmentNode = FunctionAssignmentNode;
+var AccessorNode = (0, _factoriesAny.createAccessorNode)({
+  Node: Node,
+  subset: _pureFunctionsAnyGenerated.subset
+});
+exports.AccessorNode = AccessorNode;
+var AssignmentNode = (0, _factoriesAny.createAssignmentNode)({
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  Node: Node,
+  subset: _pureFunctionsAnyGenerated.subset
+});
+exports.AssignmentNode = AssignmentNode;
+var IndexNode = (0, _factoriesAny.createIndexNode)({
+  Node: Node,
+  Range: _pureFunctionsAnyGenerated.Range,
+  size: _pureFunctionsAnyGenerated.size
+});
+exports.IndexNode = IndexNode;
+var SymbolNode = (0, _factoriesAny.createSymbolNode)({
+  Unit: _pureFunctionsAnyGenerated.Unit,
+  Node: Node,
+  math: math
+});
+exports.SymbolNode = SymbolNode;
+var FunctionNode = (0, _factoriesAny.createFunctionNode)({
+  Node: Node,
+  SymbolNode: SymbolNode,
+  math: math
+});
+exports.FunctionNode = FunctionNode;
+var parse = (0, _factoriesAny.createParse)({
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  AssignmentNode: AssignmentNode,
+  BlockNode: BlockNode,
+  ConditionalNode: ConditionalNode,
+  ConstantNode: ConstantNode,
+  FunctionAssignmentNode: FunctionAssignmentNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  RangeNode: RangeNode,
+  RelationalNode: RelationalNode,
+  SymbolNode: SymbolNode,
+  config: _configReadonly.config,
+  numeric: _pureFunctionsAnyGenerated.numeric,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.parse = parse;
+var resolve = (0, _factoriesAny.createResolve)({
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  parse: parse
+});
+exports.resolve = resolve;
+var compile = (0, _factoriesAny.createCompile)({
+  parse: parse,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.compile = compile;
+var evaluate = (0, _factoriesAny.createEvaluate)({
+  parse: parse,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.evaluate = evaluate;
+var Help = (0, _factoriesAny.createHelpClass)({
+  parse: parse
+});
+exports.Help = Help;
+var leafCount = (0, _factoriesAny.createLeafCount)({
+  parse: parse,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.leafCount = leafCount;
+var Parser = (0, _factoriesAny.createParserClass)({
+  evaluate: evaluate
+});
+exports.Parser = Parser;
+var parser = (0, _factoriesAny.createParser)({
+  Parser: Parser,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.parser = parser;
+var simplifyCore = (0, _factoriesAny.createSimplifyCore)({
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  add: _pureFunctionsAnyGenerated.add,
+  divide: _pureFunctionsAnyGenerated.divide,
+  equal: _pureFunctionsAnyGenerated.equal,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  multiply: _pureFunctionsAnyGenerated.multiply,
+  pow: _pureFunctionsAnyGenerated.pow,
+  subtract: _pureFunctionsAnyGenerated.subtract
+});
+exports.simplifyCore = simplifyCore;
+var simplify = (0, _factoriesAny.createSimplify)({
+  bignumber: _pureFunctionsAnyGenerated.bignumber,
+  fraction: _pureFunctionsAnyGenerated.fraction,
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  add: _pureFunctionsAnyGenerated.add,
+  config: _configReadonly.config,
+  divide: _pureFunctionsAnyGenerated.divide,
+  equal: _pureFunctionsAnyGenerated.equal,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  mathWithTransform: mathWithTransform,
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  multiply: _pureFunctionsAnyGenerated.multiply,
+  parse: parse,
+  pow: _pureFunctionsAnyGenerated.pow,
+  resolve: resolve,
+  simplifyCore: simplifyCore,
+  subtract: _pureFunctionsAnyGenerated.subtract,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.simplify = simplify;
+var derivative = (0, _factoriesAny.createDerivative)({
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  config: _configReadonly.config,
+  equal: _pureFunctionsAnyGenerated.equal,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  numeric: _pureFunctionsAnyGenerated.numeric,
+  parse: parse,
+  simplify: simplify,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.derivative = derivative;
+var rationalize = (0, _factoriesAny.createRationalize)({
+  bignumber: _pureFunctionsAnyGenerated.bignumber,
+  fraction: _pureFunctionsAnyGenerated.fraction,
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  add: _pureFunctionsAnyGenerated.add,
+  config: _configReadonly.config,
+  divide: _pureFunctionsAnyGenerated.divide,
+  equal: _pureFunctionsAnyGenerated.equal,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  mathWithTransform: mathWithTransform,
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  multiply: _pureFunctionsAnyGenerated.multiply,
+  parse: parse,
+  pow: _pureFunctionsAnyGenerated.pow,
+  simplify: simplify,
+  simplifyCore: simplifyCore,
+  subtract: _pureFunctionsAnyGenerated.subtract,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.rationalize = rationalize;
+var help = (0, _factoriesAny.createHelp)({
+  Help: Help,
+  mathWithTransform: mathWithTransform,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.help = help;
+var symbolicEqual = (0, _factoriesAny.createSymbolicEqual)({
+  OperatorNode: OperatorNode,
+  parse: parse,
+  simplify: simplify,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+exports.symbolicEqual = symbolicEqual;
+(0, _extends2.default)(math, {
+  e: _pureFunctionsAnyGenerated.e,
+  false: _pureFunctionsAnyGenerated._false,
+  fineStructure: _pureFunctionsAnyGenerated.fineStructure,
+  i: _pureFunctionsAnyGenerated.i,
+  Infinity: _pureFunctionsAnyGenerated._Infinity,
+  LN10: _pureFunctionsAnyGenerated.LN10,
+  LOG10E: _pureFunctionsAnyGenerated.LOG10E,
+  NaN: _pureFunctionsAnyGenerated._NaN,
+  null: _pureFunctionsAnyGenerated._null,
+  phi: _pureFunctionsAnyGenerated.phi,
+  SQRT1_2: _pureFunctionsAnyGenerated.SQRT1_2,
+  sackurTetrode: _pureFunctionsAnyGenerated.sackurTetrode,
+  tau: _pureFunctionsAnyGenerated.tau,
+  true: _pureFunctionsAnyGenerated._true,
+  'E': _pureFunctionsAnyGenerated.e,
+  version: _pureFunctionsAnyGenerated.version,
+  efimovFactor: _pureFunctionsAnyGenerated.efimovFactor,
+  LN2: _pureFunctionsAnyGenerated.LN2,
+  pi: _pureFunctionsAnyGenerated.pi,
+  replacer: _pureFunctionsAnyGenerated.replacer,
+  reviver: reviver,
+  SQRT2: _pureFunctionsAnyGenerated.SQRT2,
+  typed: _pureFunctionsAnyGenerated.typed,
+  unaryPlus: _pureFunctionsAnyGenerated.unaryPlus,
+  'PI': _pureFunctionsAnyGenerated.pi,
+  weakMixingAngle: _pureFunctionsAnyGenerated.weakMixingAngle,
+  abs: _pureFunctionsAnyGenerated.abs,
+  acos: _pureFunctionsAnyGenerated.acos,
+  acot: _pureFunctionsAnyGenerated.acot,
+  acsc: _pureFunctionsAnyGenerated.acsc,
+  addScalar: _pureFunctionsAnyGenerated.addScalar,
+  arg: _pureFunctionsAnyGenerated.arg,
+  asech: _pureFunctionsAnyGenerated.asech,
+  asinh: _pureFunctionsAnyGenerated.asinh,
+  atan: _pureFunctionsAnyGenerated.atan,
+  atanh: _pureFunctionsAnyGenerated.atanh,
+  bignumber: _pureFunctionsAnyGenerated.bignumber,
+  bitNot: _pureFunctionsAnyGenerated.bitNot,
+  boolean: _pureFunctionsAnyGenerated.boolean,
+  chain: chain,
+  clone: _pureFunctionsAnyGenerated.clone,
+  combinations: _pureFunctionsAnyGenerated.combinations,
+  complex: _pureFunctionsAnyGenerated.complex,
+  conj: _pureFunctionsAnyGenerated.conj,
+  cosh: _pureFunctionsAnyGenerated.cosh,
+  coth: _pureFunctionsAnyGenerated.coth,
+  csc: _pureFunctionsAnyGenerated.csc,
+  cube: _pureFunctionsAnyGenerated.cube,
+  equalScalar: _pureFunctionsAnyGenerated.equalScalar,
+  erf: _pureFunctionsAnyGenerated.erf,
+  exp: _pureFunctionsAnyGenerated.exp,
+  expm1: _pureFunctionsAnyGenerated.expm1,
+  filter: _pureFunctionsAnyGenerated.filter,
+  forEach: _pureFunctionsAnyGenerated.forEach,
+  format: _pureFunctionsAnyGenerated.format,
+  getMatrixDataType: _pureFunctionsAnyGenerated.getMatrixDataType,
+  hex: _pureFunctionsAnyGenerated.hex,
+  im: _pureFunctionsAnyGenerated.im,
+  isInteger: _pureFunctionsAnyGenerated.isInteger,
+  isNegative: _pureFunctionsAnyGenerated.isNegative,
+  isPositive: _pureFunctionsAnyGenerated.isPositive,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  LOG2E: _pureFunctionsAnyGenerated.LOG2E,
+  log10: _pureFunctionsAnyGenerated.log10,
+  log2: _pureFunctionsAnyGenerated.log2,
+  map: _pureFunctionsAnyGenerated.map,
+  multiplyScalar: _pureFunctionsAnyGenerated.multiplyScalar,
+  not: _pureFunctionsAnyGenerated.not,
+  number: _pureFunctionsAnyGenerated.number,
+  oct: _pureFunctionsAnyGenerated.oct,
+  pickRandom: _pureFunctionsAnyGenerated.pickRandom,
+  print: _pureFunctionsAnyGenerated.print,
+  random: _pureFunctionsAnyGenerated.random,
+  re: _pureFunctionsAnyGenerated.re,
+  sec: _pureFunctionsAnyGenerated.sec,
+  sign: _pureFunctionsAnyGenerated.sign,
+  sin: _pureFunctionsAnyGenerated.sin,
+  splitUnit: _pureFunctionsAnyGenerated.splitUnit,
+  square: _pureFunctionsAnyGenerated.square,
+  string: _pureFunctionsAnyGenerated.string,
+  tan: _pureFunctionsAnyGenerated.tan,
+  typeOf: _pureFunctionsAnyGenerated.typeOf,
+  acosh: _pureFunctionsAnyGenerated.acosh,
+  acsch: _pureFunctionsAnyGenerated.acsch,
+  apply: _pureFunctionsAnyGenerated.apply,
+  asec: _pureFunctionsAnyGenerated.asec,
+  bin: _pureFunctionsAnyGenerated.bin,
+  combinationsWithRep: _pureFunctionsAnyGenerated.combinationsWithRep,
+  cos: _pureFunctionsAnyGenerated.cos,
+  csch: _pureFunctionsAnyGenerated.csch,
+  isNaN: _pureFunctionsAnyGenerated.isNaN,
+  isPrime: _pureFunctionsAnyGenerated.isPrime,
+  randomInt: _pureFunctionsAnyGenerated.randomInt,
+  sech: _pureFunctionsAnyGenerated.sech,
+  sinh: _pureFunctionsAnyGenerated.sinh,
+  sparse: _pureFunctionsAnyGenerated.sparse,
+  sqrt: _pureFunctionsAnyGenerated.sqrt,
+  tanh: _pureFunctionsAnyGenerated.tanh,
+  unaryMinus: _pureFunctionsAnyGenerated.unaryMinus,
+  acoth: _pureFunctionsAnyGenerated.acoth,
+  cot: _pureFunctionsAnyGenerated.cot,
+  fraction: _pureFunctionsAnyGenerated.fraction,
+  isNumeric: _pureFunctionsAnyGenerated.isNumeric,
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  matrixFromFunction: _pureFunctionsAnyGenerated.matrixFromFunction,
+  mod: _pureFunctionsAnyGenerated.mod,
+  nthRoot: _pureFunctionsAnyGenerated.nthRoot,
+  numeric: _pureFunctionsAnyGenerated.numeric,
+  or: _pureFunctionsAnyGenerated.or,
+  prod: _pureFunctionsAnyGenerated.prod,
+  reshape: _pureFunctionsAnyGenerated.reshape,
+  size: _pureFunctionsAnyGenerated.size,
+  smaller: _pureFunctionsAnyGenerated.smaller,
+  squeeze: _pureFunctionsAnyGenerated.squeeze,
+  subset: _pureFunctionsAnyGenerated.subset,
+  subtract: _pureFunctionsAnyGenerated.subtract,
+  to: _pureFunctionsAnyGenerated.to,
+  transpose: _pureFunctionsAnyGenerated.transpose,
+  xgcd: _pureFunctionsAnyGenerated.xgcd,
+  zeros: _pureFunctionsAnyGenerated.zeros,
+  and: _pureFunctionsAnyGenerated.and,
+  bitAnd: _pureFunctionsAnyGenerated.bitAnd,
+  bitXor: _pureFunctionsAnyGenerated.bitXor,
+  cbrt: _pureFunctionsAnyGenerated.cbrt,
+  compare: _pureFunctionsAnyGenerated.compare,
+  compareText: _pureFunctionsAnyGenerated.compareText,
+  concat: _pureFunctionsAnyGenerated.concat,
+  count: _pureFunctionsAnyGenerated.count,
+  ctranspose: _pureFunctionsAnyGenerated.ctranspose,
+  diag: _pureFunctionsAnyGenerated.diag,
+  divideScalar: _pureFunctionsAnyGenerated.divideScalar,
+  dotDivide: _pureFunctionsAnyGenerated.dotDivide,
+  equal: _pureFunctionsAnyGenerated.equal,
+  flatten: _pureFunctionsAnyGenerated.flatten,
+  gcd: _pureFunctionsAnyGenerated.gcd,
+  hasNumericValue: _pureFunctionsAnyGenerated.hasNumericValue,
+  hypot: _pureFunctionsAnyGenerated.hypot,
+  kron: _pureFunctionsAnyGenerated.kron,
+  largerEq: _pureFunctionsAnyGenerated.largerEq,
+  leftShift: _pureFunctionsAnyGenerated.leftShift,
+  lsolve: _pureFunctionsAnyGenerated.lsolve,
+  matrixFromColumns: _pureFunctionsAnyGenerated.matrixFromColumns,
+  min: _pureFunctionsAnyGenerated.min,
+  mode: _pureFunctionsAnyGenerated.mode,
+  nthRoots: _pureFunctionsAnyGenerated.nthRoots,
+  ones: _pureFunctionsAnyGenerated.ones,
+  partitionSelect: _pureFunctionsAnyGenerated.partitionSelect,
+  resize: _pureFunctionsAnyGenerated.resize,
+  rightArithShift: _pureFunctionsAnyGenerated.rightArithShift,
+  round: _pureFunctionsAnyGenerated.round,
+  smallerEq: _pureFunctionsAnyGenerated.smallerEq,
+  unequal: _pureFunctionsAnyGenerated.unequal,
+  usolve: _pureFunctionsAnyGenerated.usolve,
+  xor: _pureFunctionsAnyGenerated.xor,
+  add: _pureFunctionsAnyGenerated.add,
+  atan2: _pureFunctionsAnyGenerated.atan2,
+  bitOr: _pureFunctionsAnyGenerated.bitOr,
+  catalan: _pureFunctionsAnyGenerated.catalan,
+  compareNatural: _pureFunctionsAnyGenerated.compareNatural,
+  cumsum: _pureFunctionsAnyGenerated.cumsum,
+  deepEqual: _pureFunctionsAnyGenerated.deepEqual,
+  diff: _pureFunctionsAnyGenerated.diff,
+  dot: _pureFunctionsAnyGenerated.dot,
+  equalText: _pureFunctionsAnyGenerated.equalText,
+  floor: _pureFunctionsAnyGenerated.floor,
+  identity: _pureFunctionsAnyGenerated.identity,
+  invmod: _pureFunctionsAnyGenerated.invmod,
+  larger: _pureFunctionsAnyGenerated.larger,
+  log: _pureFunctionsAnyGenerated.log,
+  lsolveAll: _pureFunctionsAnyGenerated.lsolveAll,
+  matrixFromRows: _pureFunctionsAnyGenerated.matrixFromRows,
+  multiply: _pureFunctionsAnyGenerated.multiply,
+  pow: _pureFunctionsAnyGenerated.pow,
+  qr: _pureFunctionsAnyGenerated.qr,
+  range: _pureFunctionsAnyGenerated.range,
+  rightLogShift: _pureFunctionsAnyGenerated.rightLogShift,
+  row: _pureFunctionsAnyGenerated.row,
+  setCartesian: _pureFunctionsAnyGenerated.setCartesian,
+  setDistinct: _pureFunctionsAnyGenerated.setDistinct,
+  setIsSubset: _pureFunctionsAnyGenerated.setIsSubset,
+  setPowerset: _pureFunctionsAnyGenerated.setPowerset,
+  slu: _pureFunctionsAnyGenerated.slu,
+  sum: _pureFunctionsAnyGenerated.sum,
+  trace: _pureFunctionsAnyGenerated.trace,
+  usolveAll: _pureFunctionsAnyGenerated.usolveAll,
+  asin: _pureFunctionsAnyGenerated.asin,
+  ceil: _pureFunctionsAnyGenerated.ceil,
+  column: _pureFunctionsAnyGenerated.column,
+  composition: _pureFunctionsAnyGenerated.composition,
+  cross: _pureFunctionsAnyGenerated.cross,
+  distance: _pureFunctionsAnyGenerated.distance,
+  dotMultiply: _pureFunctionsAnyGenerated.dotMultiply,
+  fix: _pureFunctionsAnyGenerated.fix,
+  gamma: _pureFunctionsAnyGenerated.gamma,
+  index: _pureFunctionsAnyGenerated.index,
+  lcm: _pureFunctionsAnyGenerated.lcm,
+  log1p: _pureFunctionsAnyGenerated.log1p,
+  max: _pureFunctionsAnyGenerated.max,
+  quantileSeq: _pureFunctionsAnyGenerated.quantileSeq,
+  setDifference: _pureFunctionsAnyGenerated.setDifference,
+  setMultiplicity: _pureFunctionsAnyGenerated.setMultiplicity,
+  setSymDifference: _pureFunctionsAnyGenerated.setSymDifference,
+  sort: _pureFunctionsAnyGenerated.sort,
+  vacuumImpedance: _pureFunctionsAnyGenerated.vacuumImpedance,
+  wienDisplacement: _pureFunctionsAnyGenerated.wienDisplacement,
+  atomicMass: _pureFunctionsAnyGenerated.atomicMass,
+  bohrMagneton: _pureFunctionsAnyGenerated.bohrMagneton,
+  boltzmann: _pureFunctionsAnyGenerated.boltzmann,
+  conductanceQuantum: _pureFunctionsAnyGenerated.conductanceQuantum,
+  createUnit: _pureFunctionsAnyGenerated.createUnit,
+  deuteronMass: _pureFunctionsAnyGenerated.deuteronMass,
+  dotPow: _pureFunctionsAnyGenerated.dotPow,
+  electricConstant: _pureFunctionsAnyGenerated.electricConstant,
+  elementaryCharge: _pureFunctionsAnyGenerated.elementaryCharge,
+  factorial: _pureFunctionsAnyGenerated.factorial,
+  fermiCoupling: _pureFunctionsAnyGenerated.fermiCoupling,
+  gasConstant: _pureFunctionsAnyGenerated.gasConstant,
+  gravity: _pureFunctionsAnyGenerated.gravity,
+  intersect: _pureFunctionsAnyGenerated.intersect,
+  inverseConductanceQuantum: _pureFunctionsAnyGenerated.inverseConductanceQuantum,
+  klitzing: _pureFunctionsAnyGenerated.klitzing,
+  loschmidt: _pureFunctionsAnyGenerated.loschmidt,
+  magneticConstant: _pureFunctionsAnyGenerated.magneticConstant,
+  molarMass: _pureFunctionsAnyGenerated.molarMass,
+  molarPlanckConstant: _pureFunctionsAnyGenerated.molarPlanckConstant,
+  neutronMass: _pureFunctionsAnyGenerated.neutronMass,
+  nuclearMagneton: _pureFunctionsAnyGenerated.nuclearMagneton,
+  permutations: _pureFunctionsAnyGenerated.permutations,
+  planckConstant: _pureFunctionsAnyGenerated.planckConstant,
+  planckMass: _pureFunctionsAnyGenerated.planckMass,
+  planckTime: _pureFunctionsAnyGenerated.planckTime,
+  quantumOfCirculation: _pureFunctionsAnyGenerated.quantumOfCirculation,
+  reducedPlanckConstant: _pureFunctionsAnyGenerated.reducedPlanckConstant,
+  rydberg: _pureFunctionsAnyGenerated.rydberg,
+  setIntersect: _pureFunctionsAnyGenerated.setIntersect,
+  setUnion: _pureFunctionsAnyGenerated.setUnion,
+  stefanBoltzmann: _pureFunctionsAnyGenerated.stefanBoltzmann,
+  thomsonCrossSection: _pureFunctionsAnyGenerated.thomsonCrossSection,
+  avogadro: _pureFunctionsAnyGenerated.avogadro,
+  bohrRadius: _pureFunctionsAnyGenerated.bohrRadius,
+  coulomb: _pureFunctionsAnyGenerated.coulomb,
+  electronMass: _pureFunctionsAnyGenerated.electronMass,
+  faraday: _pureFunctionsAnyGenerated.faraday,
+  hartreeEnergy: _pureFunctionsAnyGenerated.hartreeEnergy,
+  lup: _pureFunctionsAnyGenerated.lup,
+  magneticFluxQuantum: _pureFunctionsAnyGenerated.magneticFluxQuantum,
+  molarMassC12: _pureFunctionsAnyGenerated.molarMassC12,
+  parse: parse,
+  planckCharge: _pureFunctionsAnyGenerated.planckCharge,
+  planckTemperature: _pureFunctionsAnyGenerated.planckTemperature,
+  resolve: resolve,
+  secondRadiation: _pureFunctionsAnyGenerated.secondRadiation,
+  speedOfLight: _pureFunctionsAnyGenerated.speedOfLight,
+  stirlingS2: _pureFunctionsAnyGenerated.stirlingS2,
+  unit: _pureFunctionsAnyGenerated.unit,
+  bellNumbers: _pureFunctionsAnyGenerated.bellNumbers,
+  compile: compile,
+  det: _pureFunctionsAnyGenerated.det,
+  evaluate: evaluate,
+  firstRadiation: _pureFunctionsAnyGenerated.firstRadiation,
+  leafCount: leafCount,
+  molarVolume: _pureFunctionsAnyGenerated.molarVolume,
+  protonMass: _pureFunctionsAnyGenerated.protonMass,
+  setSize: _pureFunctionsAnyGenerated.setSize,
+  classicalElectronRadius: _pureFunctionsAnyGenerated.classicalElectronRadius,
+  gravitationConstant: _pureFunctionsAnyGenerated.gravitationConstant,
+  inv: _pureFunctionsAnyGenerated.inv,
+  lusolve: _pureFunctionsAnyGenerated.lusolve,
+  parser: parser,
+  sqrtm: _pureFunctionsAnyGenerated.sqrtm,
+  divide: _pureFunctionsAnyGenerated.divide,
+  expm: _pureFunctionsAnyGenerated.expm,
+  kldivergence: _pureFunctionsAnyGenerated.kldivergence,
+  mean: _pureFunctionsAnyGenerated.mean,
+  median: _pureFunctionsAnyGenerated.median,
+  planckLength: _pureFunctionsAnyGenerated.planckLength,
+  simplifyCore: simplifyCore,
+  variance: _pureFunctionsAnyGenerated.variance,
+  eigs: _pureFunctionsAnyGenerated.eigs,
+  mad: _pureFunctionsAnyGenerated.mad,
+  multinomial: _pureFunctionsAnyGenerated.multinomial,
+  simplify: simplify,
+  derivative: derivative,
+  rationalize: rationalize,
+  std: _pureFunctionsAnyGenerated.std,
+  help: help,
+  symbolicEqual: symbolicEqual,
+  norm: _pureFunctionsAnyGenerated.norm,
+  rotationMatrix: _pureFunctionsAnyGenerated.rotationMatrix,
+  rotate: _pureFunctionsAnyGenerated.rotate,
+  config: _configReadonly.config
+});
+(0, _extends2.default)(mathWithTransform, math, {
+  filter: (0, _factoriesAny.createFilterTransform)({
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  forEach: (0, _factoriesAny.createForEachTransform)({
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  map: (0, _factoriesAny.createMapTransform)({
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  apply: (0, _factoriesAny.createApplyTransform)({
+    isInteger: _pureFunctionsAnyGenerated.isInteger,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  diff: (0, _factoriesAny.createDiffTransform)({
+    bignumber: _pureFunctionsAnyGenerated.bignumber,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    number: _pureFunctionsAnyGenerated.number,
+    subtract: _pureFunctionsAnyGenerated.subtract,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  index: (0, _factoriesAny.createIndexTransform)({
+    Index: _pureFunctionsAnyGenerated.Index
+  }),
+  subset: (0, _factoriesAny.createSubsetTransform)({
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  concat: (0, _factoriesAny.createConcatTransform)({
+    isInteger: _pureFunctionsAnyGenerated.isInteger,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  max: (0, _factoriesAny.createMaxTransform)({
+    config: _configReadonly.config,
+    larger: _pureFunctionsAnyGenerated.larger,
+    numeric: _pureFunctionsAnyGenerated.numeric,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  min: (0, _factoriesAny.createMinTransform)({
+    config: _configReadonly.config,
+    numeric: _pureFunctionsAnyGenerated.numeric,
+    smaller: _pureFunctionsAnyGenerated.smaller,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  range: (0, _factoriesAny.createRangeTransform)({
+    bignumber: _pureFunctionsAnyGenerated.bignumber,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    config: _configReadonly.config,
+    larger: _pureFunctionsAnyGenerated.larger,
+    largerEq: _pureFunctionsAnyGenerated.largerEq,
+    smaller: _pureFunctionsAnyGenerated.smaller,
+    smallerEq: _pureFunctionsAnyGenerated.smallerEq,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  row: (0, _factoriesAny.createRowTransform)({
+    Index: _pureFunctionsAnyGenerated.Index,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    range: _pureFunctionsAnyGenerated.range,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  sum: (0, _factoriesAny.createSumTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    config: _configReadonly.config,
+    numeric: _pureFunctionsAnyGenerated.numeric,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  column: (0, _factoriesAny.createColumnTransform)({
+    Index: _pureFunctionsAnyGenerated.Index,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    range: _pureFunctionsAnyGenerated.range,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  cumsum: (0, _factoriesAny.createCumSumTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    typed: _pureFunctionsAnyGenerated.typed,
+    unaryPlus: _pureFunctionsAnyGenerated.unaryPlus
+  }),
+  std: (0, _factoriesAny.createStdTransform)({
+    sqrt: _pureFunctionsAnyGenerated.sqrt,
+    typed: _pureFunctionsAnyGenerated.typed,
+    variance: _pureFunctionsAnyGenerated.variance
+  }),
+  variance: (0, _factoriesAny.createVarianceTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    apply: _pureFunctionsAnyGenerated.apply,
+    divide: _pureFunctionsAnyGenerated.divide,
+    isNaN: _pureFunctionsAnyGenerated.isNaN,
+    multiply: _pureFunctionsAnyGenerated.multiply,
+    subtract: _pureFunctionsAnyGenerated.subtract,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  mean: (0, _factoriesAny.createMeanTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    divide: _pureFunctionsAnyGenerated.divide,
+    typed: _pureFunctionsAnyGenerated.typed
+  })
+});
+(0, _extends2.default)(classes, {
+  BigNumber: _pureFunctionsAnyGenerated.BigNumber,
+  Chain: Chain,
+  Complex: _pureFunctionsAnyGenerated.Complex,
+  Fraction: _pureFunctionsAnyGenerated.Fraction,
+  Matrix: _pureFunctionsAnyGenerated.Matrix,
+  Node: Node,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  Range: _pureFunctionsAnyGenerated.Range,
+  RelationalNode: RelationalNode,
+  ResultSet: _pureFunctionsAnyGenerated.ResultSet,
+  ArrayNode: ArrayNode,
+  BlockNode: BlockNode,
+  ConditionalNode: ConditionalNode,
+  ConstantNode: ConstantNode,
+  DenseMatrix: _pureFunctionsAnyGenerated.DenseMatrix,
+  RangeNode: RangeNode,
+  FunctionAssignmentNode: FunctionAssignmentNode,
+  SparseMatrix: _pureFunctionsAnyGenerated.SparseMatrix,
+  AccessorNode: AccessorNode,
+  AssignmentNode: AssignmentNode,
+  ImmutableDenseMatrix: _pureFunctionsAnyGenerated.ImmutableDenseMatrix,
+  Index: _pureFunctionsAnyGenerated.Index,
+  IndexNode: IndexNode,
+  FibonacciHeap: _pureFunctionsAnyGenerated.FibonacciHeap,
+  Unit: _pureFunctionsAnyGenerated.Unit,
+  Spa: _pureFunctionsAnyGenerated.Spa,
+  SymbolNode: SymbolNode,
+  FunctionNode: FunctionNode,
+  Help: Help,
+  Parser: Parser
+});
+Chain.createProxy(math);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/impureFunctionsNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/impureFunctionsNumber.generated.js
new file mode 100644
index 0000000..0c8a876
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/impureFunctionsNumber.generated.js
@@ -0,0 +1,526 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivative = exports.compile = exports.chain = exports.SymbolNode = exports.RelationalNode = exports.RangeNode = exports.Parser = exports.ParenthesisNode = exports.OperatorNode = exports.ObjectNode = exports.Node = exports.IndexNode = exports.Help = exports.FunctionNode = exports.FunctionAssignmentNode = exports.ConstantNode = exports.ConditionalNode = exports.Chain = exports.BlockNode = exports.AssignmentNode = exports.ArrayNode = exports.AccessorNode = void 0;
+Object.defineProperty(exports, "docs", {
+  enumerable: true,
+  get: function get() {
+    return _embeddedDocs.embeddedDocs;
+  }
+});
+exports.simplifyCore = exports.simplify = exports.reviver = exports.resolve = exports.rationalize = exports.parser = exports.parse = exports.help = exports.evaluate = void 0;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+var _configReadonly = require("./configReadonly.js");
+
+var _factoriesNumber = require("../factoriesNumber.js");
+
+var _pureFunctionsNumberGenerated = require("./pureFunctionsNumber.generated.js");
+
+var _embeddedDocs = require("../expression/embeddedDocs/embeddedDocs.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var math = {}; // NOT pure!
+
+var mathWithTransform = {}; // NOT pure!
+
+var classes = {}; // NOT pure!
+
+var Chain = (0, _factoriesNumber.createChainClass)({
+  math: math
+});
+exports.Chain = Chain;
+var chain = (0, _factoriesNumber.createChain)({
+  Chain: Chain,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.chain = chain;
+var Node = (0, _factoriesNumber.createNode)({
+  mathWithTransform: mathWithTransform
+});
+exports.Node = Node;
+var ObjectNode = (0, _factoriesNumber.createObjectNode)({
+  Node: Node
+});
+exports.ObjectNode = ObjectNode;
+var RangeNode = (0, _factoriesNumber.createRangeNode)({
+  Node: Node
+});
+exports.RangeNode = RangeNode;
+var RelationalNode = (0, _factoriesNumber.createRelationalNode)({
+  Node: Node
+});
+exports.RelationalNode = RelationalNode;
+var reviver = (0, _factoriesNumber.createReviver)({
+  classes: classes
+});
+exports.reviver = reviver;
+var SymbolNode = (0, _factoriesNumber.createSymbolNode)({
+  Node: Node,
+  math: math
+});
+exports.SymbolNode = SymbolNode;
+var AccessorNode = (0, _factoriesNumber.createAccessorNode)({
+  Node: Node,
+  subset: _pureFunctionsNumberGenerated.subset
+});
+exports.AccessorNode = AccessorNode;
+var AssignmentNode = (0, _factoriesNumber.createAssignmentNode)({
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  Node: Node,
+  subset: _pureFunctionsNumberGenerated.subset
+});
+exports.AssignmentNode = AssignmentNode;
+var BlockNode = (0, _factoriesNumber.createBlockNode)({
+  Node: Node,
+  ResultSet: _pureFunctionsNumberGenerated.ResultSet
+});
+exports.BlockNode = BlockNode;
+var ConditionalNode = (0, _factoriesNumber.createConditionalNode)({
+  Node: Node
+});
+exports.ConditionalNode = ConditionalNode;
+var FunctionNode = (0, _factoriesNumber.createFunctionNode)({
+  Node: Node,
+  SymbolNode: SymbolNode,
+  math: math
+});
+exports.FunctionNode = FunctionNode;
+var IndexNode = (0, _factoriesNumber.createIndexNode)({
+  Node: Node,
+  Range: _pureFunctionsNumberGenerated.Range,
+  size: _pureFunctionsNumberGenerated.size
+});
+exports.IndexNode = IndexNode;
+var OperatorNode = (0, _factoriesNumber.createOperatorNode)({
+  Node: Node
+});
+exports.OperatorNode = OperatorNode;
+var ConstantNode = (0, _factoriesNumber.createConstantNode)({
+  Node: Node
+});
+exports.ConstantNode = ConstantNode;
+var FunctionAssignmentNode = (0, _factoriesNumber.createFunctionAssignmentNode)({
+  Node: Node,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.FunctionAssignmentNode = FunctionAssignmentNode;
+var ParenthesisNode = (0, _factoriesNumber.createParenthesisNode)({
+  Node: Node
+});
+exports.ParenthesisNode = ParenthesisNode;
+var ArrayNode = (0, _factoriesNumber.createArrayNode)({
+  Node: Node
+});
+exports.ArrayNode = ArrayNode;
+var simplifyCore = (0, _factoriesNumber.createSimplifyCore)({
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  add: _pureFunctionsNumberGenerated.add,
+  divide: _pureFunctionsNumberGenerated.divide,
+  equal: _pureFunctionsNumberGenerated.equal,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  multiply: _pureFunctionsNumberGenerated.multiply,
+  pow: _pureFunctionsNumberGenerated.pow,
+  subtract: _pureFunctionsNumberGenerated.subtract
+});
+exports.simplifyCore = simplifyCore;
+var parse = (0, _factoriesNumber.createParse)({
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  AssignmentNode: AssignmentNode,
+  BlockNode: BlockNode,
+  ConditionalNode: ConditionalNode,
+  ConstantNode: ConstantNode,
+  FunctionAssignmentNode: FunctionAssignmentNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  RangeNode: RangeNode,
+  RelationalNode: RelationalNode,
+  SymbolNode: SymbolNode,
+  config: _configReadonly.config,
+  numeric: _pureFunctionsNumberGenerated.numeric,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.parse = parse;
+var resolve = (0, _factoriesNumber.createResolve)({
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  parse: parse
+});
+exports.resolve = resolve;
+var compile = (0, _factoriesNumber.createCompile)({
+  parse: parse,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.compile = compile;
+var evaluate = (0, _factoriesNumber.createEvaluate)({
+  parse: parse,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.evaluate = evaluate;
+var Help = (0, _factoriesNumber.createHelpClass)({
+  parse: parse
+});
+exports.Help = Help;
+var Parser = (0, _factoriesNumber.createParserClass)({
+  evaluate: evaluate
+});
+exports.Parser = Parser;
+var simplify = (0, _factoriesNumber.createSimplify)({
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  add: _pureFunctionsNumberGenerated.add,
+  config: _configReadonly.config,
+  divide: _pureFunctionsNumberGenerated.divide,
+  equal: _pureFunctionsNumberGenerated.equal,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  mathWithTransform: mathWithTransform,
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  multiply: _pureFunctionsNumberGenerated.multiply,
+  parse: parse,
+  pow: _pureFunctionsNumberGenerated.pow,
+  resolve: resolve,
+  simplifyCore: simplifyCore,
+  subtract: _pureFunctionsNumberGenerated.subtract,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.simplify = simplify;
+var derivative = (0, _factoriesNumber.createDerivative)({
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  config: _configReadonly.config,
+  equal: _pureFunctionsNumberGenerated.equal,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  numeric: _pureFunctionsNumberGenerated.numeric,
+  parse: parse,
+  simplify: simplify,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.derivative = derivative;
+var rationalize = (0, _factoriesNumber.createRationalize)({
+  AccessorNode: AccessorNode,
+  ArrayNode: ArrayNode,
+  ConstantNode: ConstantNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  ObjectNode: ObjectNode,
+  OperatorNode: OperatorNode,
+  ParenthesisNode: ParenthesisNode,
+  SymbolNode: SymbolNode,
+  add: _pureFunctionsNumberGenerated.add,
+  config: _configReadonly.config,
+  divide: _pureFunctionsNumberGenerated.divide,
+  equal: _pureFunctionsNumberGenerated.equal,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  mathWithTransform: mathWithTransform,
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  multiply: _pureFunctionsNumberGenerated.multiply,
+  parse: parse,
+  pow: _pureFunctionsNumberGenerated.pow,
+  simplify: simplify,
+  simplifyCore: simplifyCore,
+  subtract: _pureFunctionsNumberGenerated.subtract,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.rationalize = rationalize;
+var help = (0, _factoriesNumber.createHelp)({
+  Help: Help,
+  mathWithTransform: mathWithTransform,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.help = help;
+var parser = (0, _factoriesNumber.createParser)({
+  Parser: Parser,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+exports.parser = parser;
+(0, _extends2.default)(math, {
+  e: _pureFunctionsNumberGenerated.e,
+  false: _pureFunctionsNumberGenerated._false,
+  index: _pureFunctionsNumberGenerated.index,
+  Infinity: _pureFunctionsNumberGenerated._Infinity,
+  LN10: _pureFunctionsNumberGenerated.LN10,
+  LOG10E: _pureFunctionsNumberGenerated.LOG10E,
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  NaN: _pureFunctionsNumberGenerated._NaN,
+  null: _pureFunctionsNumberGenerated._null,
+  phi: _pureFunctionsNumberGenerated.phi,
+  replacer: _pureFunctionsNumberGenerated.replacer,
+  SQRT1_2: _pureFunctionsNumberGenerated.SQRT1_2,
+  subset: _pureFunctionsNumberGenerated.subset,
+  tau: _pureFunctionsNumberGenerated.tau,
+  typed: _pureFunctionsNumberGenerated.typed,
+  unaryPlus: _pureFunctionsNumberGenerated.unaryPlus,
+  'E': _pureFunctionsNumberGenerated.e,
+  version: _pureFunctionsNumberGenerated.version,
+  xor: _pureFunctionsNumberGenerated.xor,
+  abs: _pureFunctionsNumberGenerated.abs,
+  acos: _pureFunctionsNumberGenerated.acos,
+  acot: _pureFunctionsNumberGenerated.acot,
+  acsc: _pureFunctionsNumberGenerated.acsc,
+  add: _pureFunctionsNumberGenerated.add,
+  and: _pureFunctionsNumberGenerated.and,
+  asec: _pureFunctionsNumberGenerated.asec,
+  asin: _pureFunctionsNumberGenerated.asin,
+  atan: _pureFunctionsNumberGenerated.atan,
+  atanh: _pureFunctionsNumberGenerated.atanh,
+  bitAnd: _pureFunctionsNumberGenerated.bitAnd,
+  bitOr: _pureFunctionsNumberGenerated.bitOr,
+  boolean: _pureFunctionsNumberGenerated.boolean,
+  cbrt: _pureFunctionsNumberGenerated.cbrt,
+  chain: chain,
+  combinations: _pureFunctionsNumberGenerated.combinations,
+  compare: _pureFunctionsNumberGenerated.compare,
+  compareText: _pureFunctionsNumberGenerated.compareText,
+  cos: _pureFunctionsNumberGenerated.cos,
+  cot: _pureFunctionsNumberGenerated.cot,
+  csc: _pureFunctionsNumberGenerated.csc,
+  cube: _pureFunctionsNumberGenerated.cube,
+  divide: _pureFunctionsNumberGenerated.divide,
+  equalScalar: _pureFunctionsNumberGenerated.equalScalar,
+  erf: _pureFunctionsNumberGenerated.erf,
+  exp: _pureFunctionsNumberGenerated.exp,
+  filter: _pureFunctionsNumberGenerated.filter,
+  fix: _pureFunctionsNumberGenerated.fix,
+  forEach: _pureFunctionsNumberGenerated.forEach,
+  format: _pureFunctionsNumberGenerated.format,
+  gamma: _pureFunctionsNumberGenerated.gamma,
+  isInteger: _pureFunctionsNumberGenerated.isInteger,
+  isNegative: _pureFunctionsNumberGenerated.isNegative,
+  isPositive: _pureFunctionsNumberGenerated.isPositive,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  LOG2E: _pureFunctionsNumberGenerated.LOG2E,
+  largerEq: _pureFunctionsNumberGenerated.largerEq,
+  leftShift: _pureFunctionsNumberGenerated.leftShift,
+  log10: _pureFunctionsNumberGenerated.log10,
+  log2: _pureFunctionsNumberGenerated.log2,
+  map: _pureFunctionsNumberGenerated.map,
+  mean: _pureFunctionsNumberGenerated.mean,
+  mod: _pureFunctionsNumberGenerated.mod,
+  multiply: _pureFunctionsNumberGenerated.multiply,
+  not: _pureFunctionsNumberGenerated.not,
+  number: _pureFunctionsNumberGenerated.number,
+  or: _pureFunctionsNumberGenerated.or,
+  pi: _pureFunctionsNumberGenerated.pi,
+  pow: _pureFunctionsNumberGenerated.pow,
+  random: _pureFunctionsNumberGenerated.random,
+  reviver: reviver,
+  rightLogShift: _pureFunctionsNumberGenerated.rightLogShift,
+  SQRT2: _pureFunctionsNumberGenerated.SQRT2,
+  sech: _pureFunctionsNumberGenerated.sech,
+  sin: _pureFunctionsNumberGenerated.sin,
+  size: _pureFunctionsNumberGenerated.size,
+  smallerEq: _pureFunctionsNumberGenerated.smallerEq,
+  square: _pureFunctionsNumberGenerated.square,
+  string: _pureFunctionsNumberGenerated.string,
+  subtract: _pureFunctionsNumberGenerated.subtract,
+  tanh: _pureFunctionsNumberGenerated.tanh,
+  typeOf: _pureFunctionsNumberGenerated.typeOf,
+  unequal: _pureFunctionsNumberGenerated.unequal,
+  xgcd: _pureFunctionsNumberGenerated.xgcd,
+  acoth: _pureFunctionsNumberGenerated.acoth,
+  addScalar: _pureFunctionsNumberGenerated.addScalar,
+  asech: _pureFunctionsNumberGenerated.asech,
+  bitNot: _pureFunctionsNumberGenerated.bitNot,
+  ceil: _pureFunctionsNumberGenerated.ceil,
+  combinationsWithRep: _pureFunctionsNumberGenerated.combinationsWithRep,
+  cosh: _pureFunctionsNumberGenerated.cosh,
+  csch: _pureFunctionsNumberGenerated.csch,
+  divideScalar: _pureFunctionsNumberGenerated.divideScalar,
+  equalText: _pureFunctionsNumberGenerated.equalText,
+  expm1: _pureFunctionsNumberGenerated.expm1,
+  isNumeric: _pureFunctionsNumberGenerated.isNumeric,
+  LN2: _pureFunctionsNumberGenerated.LN2,
+  lcm: _pureFunctionsNumberGenerated.lcm,
+  log1p: _pureFunctionsNumberGenerated.log1p,
+  multiplyScalar: _pureFunctionsNumberGenerated.multiplyScalar,
+  nthRoot: _pureFunctionsNumberGenerated.nthRoot,
+  pickRandom: _pureFunctionsNumberGenerated.pickRandom,
+  randomInt: _pureFunctionsNumberGenerated.randomInt,
+  rightArithShift: _pureFunctionsNumberGenerated.rightArithShift,
+  sec: _pureFunctionsNumberGenerated.sec,
+  sinh: _pureFunctionsNumberGenerated.sinh,
+  sqrt: _pureFunctionsNumberGenerated.sqrt,
+  tan: _pureFunctionsNumberGenerated.tan,
+  unaryMinus: _pureFunctionsNumberGenerated.unaryMinus,
+  acosh: _pureFunctionsNumberGenerated.acosh,
+  apply: _pureFunctionsNumberGenerated.apply,
+  asinh: _pureFunctionsNumberGenerated.asinh,
+  bitXor: _pureFunctionsNumberGenerated.bitXor,
+  clone: _pureFunctionsNumberGenerated.clone,
+  cumsum: _pureFunctionsNumberGenerated.cumsum,
+  equal: _pureFunctionsNumberGenerated.equal,
+  factorial: _pureFunctionsNumberGenerated.factorial,
+  hasNumericValue: _pureFunctionsNumberGenerated.hasNumericValue,
+  isNaN: _pureFunctionsNumberGenerated.isNaN,
+  larger: _pureFunctionsNumberGenerated.larger,
+  mode: _pureFunctionsNumberGenerated.mode,
+  norm: _pureFunctionsNumberGenerated.norm,
+  partitionSelect: _pureFunctionsNumberGenerated.partitionSelect,
+  print: _pureFunctionsNumberGenerated.print,
+  quantileSeq: _pureFunctionsNumberGenerated.quantileSeq,
+  round: _pureFunctionsNumberGenerated.round,
+  smaller: _pureFunctionsNumberGenerated.smaller,
+  stirlingS2: _pureFunctionsNumberGenerated.stirlingS2,
+  true: _pureFunctionsNumberGenerated._true,
+  variance: _pureFunctionsNumberGenerated.variance,
+  acsch: _pureFunctionsNumberGenerated.acsch,
+  atan2: _pureFunctionsNumberGenerated.atan2,
+  catalan: _pureFunctionsNumberGenerated.catalan,
+  composition: _pureFunctionsNumberGenerated.composition,
+  deepEqual: _pureFunctionsNumberGenerated.deepEqual,
+  floor: _pureFunctionsNumberGenerated.floor,
+  hypot: _pureFunctionsNumberGenerated.hypot,
+  log: _pureFunctionsNumberGenerated.log,
+  median: _pureFunctionsNumberGenerated.median,
+  multinomial: _pureFunctionsNumberGenerated.multinomial,
+  permutations: _pureFunctionsNumberGenerated.permutations,
+  range: _pureFunctionsNumberGenerated.range,
+  sign: _pureFunctionsNumberGenerated.sign,
+  std: _pureFunctionsNumberGenerated.std,
+  'PI': _pureFunctionsNumberGenerated.pi,
+  compareNatural: _pureFunctionsNumberGenerated.compareNatural,
+  coth: _pureFunctionsNumberGenerated.coth,
+  gcd: _pureFunctionsNumberGenerated.gcd,
+  isPrime: _pureFunctionsNumberGenerated.isPrime,
+  numeric: _pureFunctionsNumberGenerated.numeric,
+  prod: _pureFunctionsNumberGenerated.prod,
+  simplifyCore: simplifyCore,
+  sum: _pureFunctionsNumberGenerated.sum,
+  bellNumbers: _pureFunctionsNumberGenerated.bellNumbers,
+  mad: _pureFunctionsNumberGenerated.mad,
+  max: _pureFunctionsNumberGenerated.max,
+  parse: parse,
+  resolve: resolve,
+  compile: compile,
+  evaluate: evaluate,
+  simplify: simplify,
+  derivative: derivative,
+  min: _pureFunctionsNumberGenerated.min,
+  rationalize: rationalize,
+  help: help,
+  parser: parser,
+  config: _configReadonly.config
+});
+(0, _extends2.default)(mathWithTransform, math, {
+  cumsum: (0, _factoriesNumber.createCumSumTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    typed: _pureFunctionsNumberGenerated.typed,
+    unaryPlus: _pureFunctionsNumberGenerated.unaryPlus
+  }),
+  apply: (0, _factoriesNumber.createApplyTransform)({
+    isInteger: _pureFunctionsNumberGenerated.isInteger,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  filter: (0, _factoriesNumber.createFilterTransform)({
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  forEach: (0, _factoriesNumber.createForEachTransform)({
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  map: (0, _factoriesNumber.createMapTransform)({
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  mean: (0, _factoriesNumber.createMeanTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    divide: _pureFunctionsNumberGenerated.divide,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  subset: (0, _factoriesNumber.createSubsetTransform)({}),
+  variance: (0, _factoriesNumber.createVarianceTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    apply: _pureFunctionsNumberGenerated.apply,
+    divide: _pureFunctionsNumberGenerated.divide,
+    isNaN: _pureFunctionsNumberGenerated.isNaN,
+    multiply: _pureFunctionsNumberGenerated.multiply,
+    subtract: _pureFunctionsNumberGenerated.subtract,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  max: (0, _factoriesNumber.createMaxTransform)({
+    config: _configReadonly.config,
+    larger: _pureFunctionsNumberGenerated.larger,
+    numeric: _pureFunctionsNumberGenerated.numeric,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  min: (0, _factoriesNumber.createMinTransform)({
+    config: _configReadonly.config,
+    numeric: _pureFunctionsNumberGenerated.numeric,
+    smaller: _pureFunctionsNumberGenerated.smaller,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  range: (0, _factoriesNumber.createRangeTransform)({
+    matrix: _pureFunctionsNumberGenerated.matrix,
+    config: _configReadonly.config,
+    larger: _pureFunctionsNumberGenerated.larger,
+    largerEq: _pureFunctionsNumberGenerated.largerEq,
+    smaller: _pureFunctionsNumberGenerated.smaller,
+    smallerEq: _pureFunctionsNumberGenerated.smallerEq,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  std: (0, _factoriesNumber.createStdTransform)({
+    sqrt: _pureFunctionsNumberGenerated.sqrt,
+    typed: _pureFunctionsNumberGenerated.typed,
+    variance: _pureFunctionsNumberGenerated.variance
+  }),
+  sum: (0, _factoriesNumber.createSumTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    config: _configReadonly.config,
+    numeric: _pureFunctionsNumberGenerated.numeric,
+    typed: _pureFunctionsNumberGenerated.typed
+  })
+});
+(0, _extends2.default)(classes, {
+  Chain: Chain,
+  Range: _pureFunctionsNumberGenerated.Range,
+  ResultSet: _pureFunctionsNumberGenerated.ResultSet,
+  Node: Node,
+  ObjectNode: ObjectNode,
+  RangeNode: RangeNode,
+  RelationalNode: RelationalNode,
+  SymbolNode: SymbolNode,
+  AccessorNode: AccessorNode,
+  AssignmentNode: AssignmentNode,
+  BlockNode: BlockNode,
+  ConditionalNode: ConditionalNode,
+  FunctionNode: FunctionNode,
+  IndexNode: IndexNode,
+  OperatorNode: OperatorNode,
+  ConstantNode: ConstantNode,
+  FunctionAssignmentNode: FunctionAssignmentNode,
+  ParenthesisNode: ParenthesisNode,
+  ArrayNode: ArrayNode,
+  Help: Help,
+  Parser: Parser
+});
+Chain.createProxy(math);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/mainAny.js b/node_modules/mathjs/lib/cjs/entry/mainAny.js
new file mode 100644
index 0000000..aad3de9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/mainAny.js
@@ -0,0 +1,131 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _exportNames = {
+  config: true,
+  IndexError: true,
+  DimensionError: true,
+  ArgumentsError: true,
+  create: true,
+  factory: true
+};
+Object.defineProperty(exports, "ArgumentsError", {
+  enumerable: true,
+  get: function get() {
+    return _ArgumentsError.ArgumentsError;
+  }
+});
+Object.defineProperty(exports, "DimensionError", {
+  enumerable: true,
+  get: function get() {
+    return _DimensionError.DimensionError;
+  }
+});
+Object.defineProperty(exports, "IndexError", {
+  enumerable: true,
+  get: function get() {
+    return _IndexError.IndexError;
+  }
+});
+Object.defineProperty(exports, "config", {
+  enumerable: true,
+  get: function get() {
+    return _configReadonly.config;
+  }
+});
+Object.defineProperty(exports, "create", {
+  enumerable: true,
+  get: function get() {
+    return _create.create;
+  }
+});
+Object.defineProperty(exports, "factory", {
+  enumerable: true,
+  get: function get() {
+    return _factory.factory;
+  }
+});
+
+var _configReadonly = require("./configReadonly.js");
+
+var _pureFunctionsAnyGenerated = require("./pureFunctionsAny.generated.js");
+
+Object.keys(_pureFunctionsAnyGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _pureFunctionsAnyGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _pureFunctionsAnyGenerated[key];
+    }
+  });
+});
+
+var _impureFunctionsAnyGenerated = require("./impureFunctionsAny.generated.js");
+
+Object.keys(_impureFunctionsAnyGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _impureFunctionsAnyGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _impureFunctionsAnyGenerated[key];
+    }
+  });
+});
+
+var _typeChecks = require("./typeChecks.js");
+
+Object.keys(_typeChecks).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _typeChecks[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _typeChecks[key];
+    }
+  });
+});
+
+var _IndexError = require("../error/IndexError.js");
+
+var _DimensionError = require("../error/DimensionError.js");
+
+var _ArgumentsError = require("../error/ArgumentsError.js");
+
+var _dependenciesAnyGenerated = require("./dependenciesAny.generated.js");
+
+Object.keys(_dependenciesAnyGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _dependenciesAnyGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _dependenciesAnyGenerated[key];
+    }
+  });
+});
+
+var _factoriesAny = require("../factoriesAny.js");
+
+Object.keys(_factoriesAny).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _factoriesAny[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _factoriesAny[key];
+    }
+  });
+});
+
+var _create = require("../core/create.js");
+
+var _factory = require("../utils/factory.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/mainNumber.js b/node_modules/mathjs/lib/cjs/entry/mainNumber.js
new file mode 100644
index 0000000..aa0bc60
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/mainNumber.js
@@ -0,0 +1,131 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _exportNames = {
+  config: true,
+  IndexError: true,
+  DimensionError: true,
+  ArgumentsError: true,
+  create: true,
+  factory: true
+};
+Object.defineProperty(exports, "ArgumentsError", {
+  enumerable: true,
+  get: function get() {
+    return _ArgumentsError.ArgumentsError;
+  }
+});
+Object.defineProperty(exports, "DimensionError", {
+  enumerable: true,
+  get: function get() {
+    return _DimensionError.DimensionError;
+  }
+});
+Object.defineProperty(exports, "IndexError", {
+  enumerable: true,
+  get: function get() {
+    return _IndexError.IndexError;
+  }
+});
+Object.defineProperty(exports, "config", {
+  enumerable: true,
+  get: function get() {
+    return _configReadonly.config;
+  }
+});
+Object.defineProperty(exports, "create", {
+  enumerable: true,
+  get: function get() {
+    return _create.create;
+  }
+});
+Object.defineProperty(exports, "factory", {
+  enumerable: true,
+  get: function get() {
+    return _factory.factory;
+  }
+});
+
+var _configReadonly = require("./configReadonly.js");
+
+var _pureFunctionsNumberGenerated = require("./pureFunctionsNumber.generated.js");
+
+Object.keys(_pureFunctionsNumberGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _pureFunctionsNumberGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _pureFunctionsNumberGenerated[key];
+    }
+  });
+});
+
+var _impureFunctionsNumberGenerated = require("./impureFunctionsNumber.generated.js");
+
+Object.keys(_impureFunctionsNumberGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _impureFunctionsNumberGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _impureFunctionsNumberGenerated[key];
+    }
+  });
+});
+
+var _typeChecks = require("./typeChecks.js");
+
+Object.keys(_typeChecks).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _typeChecks[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _typeChecks[key];
+    }
+  });
+});
+
+var _IndexError = require("../error/IndexError.js");
+
+var _DimensionError = require("../error/DimensionError.js");
+
+var _ArgumentsError = require("../error/ArgumentsError.js");
+
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+
+Object.keys(_dependenciesNumberGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _dependenciesNumberGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _dependenciesNumberGenerated[key];
+    }
+  });
+});
+
+var _factoriesNumber = require("../factoriesNumber.js");
+
+Object.keys(_factoriesNumber).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _factoriesNumber[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _factoriesNumber[key];
+    }
+  });
+});
+
+var _create = require("../core/create.js");
+
+var _factory = require("../utils/factory.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/pureFunctionsAny.generated.js b/node_modules/mathjs/lib/cjs/entry/pureFunctionsAny.generated.js
new file mode 100644
index 0000000..8bae6fe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/pureFunctionsAny.generated.js
@@ -0,0 +1,1882 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eigs = exports.efimovFactor = exports.e = exports.dotPow = exports.dotMultiply = exports.dotDivide = exports.dot = exports.divideScalar = exports.divide = exports.distance = exports.diff = exports.diag = exports.deuteronMass = exports.det = exports.deepEqual = exports.cumsum = exports.cube = exports.ctranspose = exports.csch = exports.csc = exports.cross = exports.createUnit = exports.count = exports.coulomb = exports.coth = exports.cot = exports.cosh = exports.cos = exports.conj = exports.conductanceQuantum = exports.concat = exports.composition = exports.complex = exports.compareText = exports.compareNatural = exports.compare = exports.combinationsWithRep = exports.combinations = exports.column = exports.clone = exports.classicalElectronRadius = exports.ceil = exports.cbrt = exports.catalan = exports.boolean = exports.boltzmann = exports.bohrRadius = exports.bohrMagneton = exports.bitXor = exports.bitOr = exports.bitNot = exports.bitAnd = exports.bin = exports.bignumber = exports.bellNumbers = exports.avogadro = exports.atomicMass = exports.atanh = exports.atan2 = exports.atan = exports.asinh = exports.asin = exports.asech = exports.asec = exports.arg = exports.apply = exports.and = exports.addScalar = exports.add = exports.acsch = exports.acsc = exports.acoth = exports.acot = exports.acosh = exports.acos = exports.abs = exports._true = exports._null = exports._false = exports._NaN = exports._Infinity = exports.Unit = exports.SparseMatrix = exports.Spa = exports.SQRT2 = exports.SQRT1_2 = exports.ResultSet = exports.Range = exports.Matrix = exports.LOG2E = exports.LOG10E = exports.LN2 = exports.LN10 = exports.Index = exports.ImmutableDenseMatrix = exports.Fraction = exports.FibonacciHeap = exports.DenseMatrix = exports.Complex = exports.BigNumber = void 0;
+exports.pickRandom = exports.pi = exports.phi = exports.permutations = exports.partitionSelect = exports.or = exports.ones = exports.oct = exports.numeric = exports.number = exports.nuclearMagneton = exports.nthRoots = exports.nthRoot = exports.not = exports.norm = exports.neutronMass = exports.multiplyScalar = exports.multiply = exports.multinomial = exports.molarVolume = exports.molarPlanckConstant = exports.molarMassC12 = exports.molarMass = exports.mode = exports.mod = exports.min = exports.median = exports.mean = exports.max = exports.matrixFromRows = exports.matrixFromFunction = exports.matrixFromColumns = exports.matrix = exports.map = exports.magneticFluxQuantum = exports.magneticConstant = exports.mad = exports.lusolve = exports.lup = exports.lsolveAll = exports.lsolve = exports.loschmidt = exports.log2 = exports.log1p = exports.log10 = exports.log = exports.leftShift = exports.lcm = exports.largerEq = exports.larger = exports.kron = exports.klitzing = exports.kldivergence = exports.isZero = exports.isPrime = exports.isPositive = exports.isNumeric = exports.isNegative = exports.isNaN = exports.isInteger = exports.invmod = exports.inverseConductanceQuantum = exports.inv = exports.intersect = exports.index = exports.im = exports.identity = exports.i = exports.hypot = exports.hex = exports.hasNumericValue = exports.hartreeEnergy = exports.gravity = exports.gravitationConstant = exports.getMatrixDataType = exports.gcd = exports.gasConstant = exports.gamma = exports.fraction = exports.format = exports.forEach = exports.floor = exports.flatten = exports.fix = exports.firstRadiation = exports.fineStructure = exports.filter = exports.fermiCoupling = exports.faraday = exports.factorial = exports.expm1 = exports.expm = exports.exp = exports.erf = exports.equalText = exports.equalScalar = exports.equal = exports.elementaryCharge = exports.electronMass = exports.electricConstant = void 0;
+exports.zeros = exports.xor = exports.xgcd = exports.wienDisplacement = exports.weakMixingAngle = exports.version = exports.variance = exports.vacuumImpedance = exports.usolveAll = exports.usolve = exports.unit = exports.unequal = exports.unaryPlus = exports.unaryMinus = exports.typed = exports.typeOf = exports.transpose = exports.trace = exports.to = exports.thomsonCrossSection = exports.tau = exports.tanh = exports.tan = exports.sum = exports.subtract = exports.subset = exports.string = exports.stirlingS2 = exports.stefanBoltzmann = exports.std = exports.squeeze = exports.square = exports.sqrtm = exports.sqrt = exports.splitUnit = exports.speedOfLight = exports.sparse = exports.sort = exports.smallerEq = exports.smaller = exports.slu = exports.size = exports.sinh = exports.sin = exports.sign = exports.setUnion = exports.setSymDifference = exports.setSize = exports.setPowerset = exports.setMultiplicity = exports.setIsSubset = exports.setIntersect = exports.setDistinct = exports.setDifference = exports.setCartesian = exports.secondRadiation = exports.sech = exports.sec = exports.sackurTetrode = exports.rydberg = exports.row = exports.round = exports.rotationMatrix = exports.rotate = exports.rightLogShift = exports.rightArithShift = exports.resize = exports.reshape = exports.replacer = exports.reducedPlanckConstant = exports.re = exports.range = exports.randomInt = exports.random = exports.quantumOfCirculation = exports.quantileSeq = exports.qr = exports.protonMass = exports.prod = exports.print = exports.pow = exports.planckTime = exports.planckTemperature = exports.planckMass = exports.planckLength = exports.planckConstant = exports.planckCharge = void 0;
+
+var _configReadonly = require("./configReadonly.js");
+
+var _factoriesAny = require("../factoriesAny.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var BigNumber = /* #__PURE__ */(0, _factoriesAny.createBigNumberClass)({
+  config: _configReadonly.config
+});
+exports.BigNumber = BigNumber;
+var Complex = /* #__PURE__ */(0, _factoriesAny.createComplexClass)({});
+exports.Complex = Complex;
+var e = /* #__PURE__ */(0, _factoriesAny.createE)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.e = e;
+
+var _false = /* #__PURE__ */(0, _factoriesAny.createFalse)({});
+
+exports._false = _false;
+var fineStructure = /* #__PURE__ */(0, _factoriesAny.createFineStructure)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.fineStructure = fineStructure;
+var Fraction = /* #__PURE__ */(0, _factoriesAny.createFractionClass)({});
+exports.Fraction = Fraction;
+var i = /* #__PURE__ */(0, _factoriesAny.createI)({
+  Complex: Complex
+});
+exports.i = i;
+
+var _Infinity = /* #__PURE__ */(0, _factoriesAny.createInfinity)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+
+exports._Infinity = _Infinity;
+var LN10 = /* #__PURE__ */(0, _factoriesAny.createLN10)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.LN10 = LN10;
+var LOG10E = /* #__PURE__ */(0, _factoriesAny.createLOG10E)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.LOG10E = LOG10E;
+var Matrix = /* #__PURE__ */(0, _factoriesAny.createMatrixClass)({});
+exports.Matrix = Matrix;
+
+var _NaN = /* #__PURE__ */(0, _factoriesAny.createNaN)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+
+exports._NaN = _NaN;
+
+var _null = /* #__PURE__ */(0, _factoriesAny.createNull)({});
+
+exports._null = _null;
+var phi = /* #__PURE__ */(0, _factoriesAny.createPhi)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.phi = phi;
+var Range = /* #__PURE__ */(0, _factoriesAny.createRangeClass)({});
+exports.Range = Range;
+var ResultSet = /* #__PURE__ */(0, _factoriesAny.createResultSet)({});
+exports.ResultSet = ResultSet;
+var SQRT1_2 = /* #__PURE__ */(0, _factoriesAny.createSQRT1_2)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.SQRT1_2 = SQRT1_2;
+var sackurTetrode = /* #__PURE__ */(0, _factoriesAny.createSackurTetrode)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.sackurTetrode = sackurTetrode;
+var tau = /* #__PURE__ */(0, _factoriesAny.createTau)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.tau = tau;
+
+var _true = /* #__PURE__ */(0, _factoriesAny.createTrue)({});
+
+exports._true = _true;
+var version = /* #__PURE__ */(0, _factoriesAny.createVersion)({});
+exports.version = version;
+var DenseMatrix = /* #__PURE__ */(0, _factoriesAny.createDenseMatrixClass)({
+  Matrix: Matrix
+});
+exports.DenseMatrix = DenseMatrix;
+var efimovFactor = /* #__PURE__ */(0, _factoriesAny.createEfimovFactor)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.efimovFactor = efimovFactor;
+var LN2 = /* #__PURE__ */(0, _factoriesAny.createLN2)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.LN2 = LN2;
+var pi = /* #__PURE__ */(0, _factoriesAny.createPi)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.pi = pi;
+var replacer = /* #__PURE__ */(0, _factoriesAny.createReplacer)({});
+exports.replacer = replacer;
+var SQRT2 = /* #__PURE__ */(0, _factoriesAny.createSQRT2)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.SQRT2 = SQRT2;
+var typed = /* #__PURE__ */(0, _factoriesAny.createTyped)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  DenseMatrix: DenseMatrix,
+  Fraction: Fraction
+});
+exports.typed = typed;
+var unaryPlus = /* #__PURE__ */(0, _factoriesAny.createUnaryPlus)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.unaryPlus = unaryPlus;
+var weakMixingAngle = /* #__PURE__ */(0, _factoriesAny.createWeakMixingAngle)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.weakMixingAngle = weakMixingAngle;
+var abs = /* #__PURE__ */(0, _factoriesAny.createAbs)({
+  typed: typed
+});
+exports.abs = abs;
+var acos = /* #__PURE__ */(0, _factoriesAny.createAcos)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.acos = acos;
+var acot = /* #__PURE__ */(0, _factoriesAny.createAcot)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.acot = acot;
+var acsc = /* #__PURE__ */(0, _factoriesAny.createAcsc)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.acsc = acsc;
+var addScalar = /* #__PURE__ */(0, _factoriesAny.createAddScalar)({
+  typed: typed
+});
+exports.addScalar = addScalar;
+var arg = /* #__PURE__ */(0, _factoriesAny.createArg)({
+  typed: typed
+});
+exports.arg = arg;
+var asech = /* #__PURE__ */(0, _factoriesAny.createAsech)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.asech = asech;
+var asinh = /* #__PURE__ */(0, _factoriesAny.createAsinh)({
+  typed: typed
+});
+exports.asinh = asinh;
+var atan = /* #__PURE__ */(0, _factoriesAny.createAtan)({
+  typed: typed
+});
+exports.atan = atan;
+var atanh = /* #__PURE__ */(0, _factoriesAny.createAtanh)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.atanh = atanh;
+var bignumber = /* #__PURE__ */(0, _factoriesAny.createBignumber)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.bignumber = bignumber;
+var bitNot = /* #__PURE__ */(0, _factoriesAny.createBitNot)({
+  typed: typed
+});
+exports.bitNot = bitNot;
+var boolean = /* #__PURE__ */(0, _factoriesAny.createBoolean)({
+  typed: typed
+});
+exports.boolean = boolean;
+var clone = /* #__PURE__ */(0, _factoriesAny.createClone)({
+  typed: typed
+});
+exports.clone = clone;
+var combinations = /* #__PURE__ */(0, _factoriesAny.createCombinations)({
+  typed: typed
+});
+exports.combinations = combinations;
+var complex = /* #__PURE__ */(0, _factoriesAny.createComplex)({
+  Complex: Complex,
+  typed: typed
+});
+exports.complex = complex;
+var conj = /* #__PURE__ */(0, _factoriesAny.createConj)({
+  typed: typed
+});
+exports.conj = conj;
+var cosh = /* #__PURE__ */(0, _factoriesAny.createCosh)({
+  typed: typed
+});
+exports.cosh = cosh;
+var coth = /* #__PURE__ */(0, _factoriesAny.createCoth)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.coth = coth;
+var csc = /* #__PURE__ */(0, _factoriesAny.createCsc)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.csc = csc;
+var cube = /* #__PURE__ */(0, _factoriesAny.createCube)({
+  typed: typed
+});
+exports.cube = cube;
+var equalScalar = /* #__PURE__ */(0, _factoriesAny.createEqualScalar)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.equalScalar = equalScalar;
+var erf = /* #__PURE__ */(0, _factoriesAny.createErf)({
+  typed: typed
+});
+exports.erf = erf;
+var exp = /* #__PURE__ */(0, _factoriesAny.createExp)({
+  typed: typed
+});
+exports.exp = exp;
+var expm1 = /* #__PURE__ */(0, _factoriesAny.createExpm1)({
+  Complex: Complex,
+  typed: typed
+});
+exports.expm1 = expm1;
+var filter = /* #__PURE__ */(0, _factoriesAny.createFilter)({
+  typed: typed
+});
+exports.filter = filter;
+var forEach = /* #__PURE__ */(0, _factoriesAny.createForEach)({
+  typed: typed
+});
+exports.forEach = forEach;
+var format = /* #__PURE__ */(0, _factoriesAny.createFormat)({
+  typed: typed
+});
+exports.format = format;
+var getMatrixDataType = /* #__PURE__ */(0, _factoriesAny.createGetMatrixDataType)({
+  typed: typed
+});
+exports.getMatrixDataType = getMatrixDataType;
+var hex = /* #__PURE__ */(0, _factoriesAny.createHex)({
+  format: format,
+  typed: typed
+});
+exports.hex = hex;
+var im = /* #__PURE__ */(0, _factoriesAny.createIm)({
+  typed: typed
+});
+exports.im = im;
+var isInteger = /* #__PURE__ */(0, _factoriesAny.createIsInteger)({
+  typed: typed
+});
+exports.isInteger = isInteger;
+var isNegative = /* #__PURE__ */(0, _factoriesAny.createIsNegative)({
+  typed: typed
+});
+exports.isNegative = isNegative;
+var isPositive = /* #__PURE__ */(0, _factoriesAny.createIsPositive)({
+  typed: typed
+});
+exports.isPositive = isPositive;
+var isZero = /* #__PURE__ */(0, _factoriesAny.createIsZero)({
+  typed: typed
+});
+exports.isZero = isZero;
+var LOG2E = /* #__PURE__ */(0, _factoriesAny.createLOG2E)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config
+});
+exports.LOG2E = LOG2E;
+var log10 = /* #__PURE__ */(0, _factoriesAny.createLog10)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.log10 = log10;
+var log2 = /* #__PURE__ */(0, _factoriesAny.createLog2)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.log2 = log2;
+var map = /* #__PURE__ */(0, _factoriesAny.createMap)({
+  typed: typed
+});
+exports.map = map;
+var multiplyScalar = /* #__PURE__ */(0, _factoriesAny.createMultiplyScalar)({
+  typed: typed
+});
+exports.multiplyScalar = multiplyScalar;
+var not = /* #__PURE__ */(0, _factoriesAny.createNot)({
+  typed: typed
+});
+exports.not = not;
+var number = /* #__PURE__ */(0, _factoriesAny.createNumber)({
+  typed: typed
+});
+exports.number = number;
+var oct = /* #__PURE__ */(0, _factoriesAny.createOct)({
+  format: format,
+  typed: typed
+});
+exports.oct = oct;
+var pickRandom = /* #__PURE__ */(0, _factoriesAny.createPickRandom)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.pickRandom = pickRandom;
+var print = /* #__PURE__ */(0, _factoriesAny.createPrint)({
+  typed: typed
+});
+exports.print = print;
+var random = /* #__PURE__ */(0, _factoriesAny.createRandom)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.random = random;
+var re = /* #__PURE__ */(0, _factoriesAny.createRe)({
+  typed: typed
+});
+exports.re = re;
+var sec = /* #__PURE__ */(0, _factoriesAny.createSec)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.sec = sec;
+var sign = /* #__PURE__ */(0, _factoriesAny.createSign)({
+  BigNumber: BigNumber,
+  Fraction: Fraction,
+  complex: complex,
+  typed: typed
+});
+exports.sign = sign;
+var sin = /* #__PURE__ */(0, _factoriesAny.createSin)({
+  typed: typed
+});
+exports.sin = sin;
+var SparseMatrix = /* #__PURE__ */(0, _factoriesAny.createSparseMatrixClass)({
+  Matrix: Matrix,
+  equalScalar: equalScalar,
+  typed: typed
+});
+exports.SparseMatrix = SparseMatrix;
+var splitUnit = /* #__PURE__ */(0, _factoriesAny.createSplitUnit)({
+  typed: typed
+});
+exports.splitUnit = splitUnit;
+var square = /* #__PURE__ */(0, _factoriesAny.createSquare)({
+  typed: typed
+});
+exports.square = square;
+var string = /* #__PURE__ */(0, _factoriesAny.createString)({
+  typed: typed
+});
+exports.string = string;
+var tan = /* #__PURE__ */(0, _factoriesAny.createTan)({
+  typed: typed
+});
+exports.tan = tan;
+var typeOf = /* #__PURE__ */(0, _factoriesAny.createTypeOf)({
+  typed: typed
+});
+exports.typeOf = typeOf;
+var acosh = /* #__PURE__ */(0, _factoriesAny.createAcosh)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.acosh = acosh;
+var acsch = /* #__PURE__ */(0, _factoriesAny.createAcsch)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.acsch = acsch;
+var apply = /* #__PURE__ */(0, _factoriesAny.createApply)({
+  isInteger: isInteger,
+  typed: typed
+});
+exports.apply = apply;
+var asec = /* #__PURE__ */(0, _factoriesAny.createAsec)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.asec = asec;
+var bin = /* #__PURE__ */(0, _factoriesAny.createBin)({
+  format: format,
+  typed: typed
+});
+exports.bin = bin;
+var combinationsWithRep = /* #__PURE__ */(0, _factoriesAny.createCombinationsWithRep)({
+  typed: typed
+});
+exports.combinationsWithRep = combinationsWithRep;
+var cos = /* #__PURE__ */(0, _factoriesAny.createCos)({
+  typed: typed
+});
+exports.cos = cos;
+var csch = /* #__PURE__ */(0, _factoriesAny.createCsch)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.csch = csch;
+var isNaN = /* #__PURE__ */(0, _factoriesAny.createIsNaN)({
+  typed: typed
+});
+exports.isNaN = isNaN;
+var isPrime = /* #__PURE__ */(0, _factoriesAny.createIsPrime)({
+  typed: typed
+});
+exports.isPrime = isPrime;
+var randomInt = /* #__PURE__ */(0, _factoriesAny.createRandomInt)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.randomInt = randomInt;
+var sech = /* #__PURE__ */(0, _factoriesAny.createSech)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.sech = sech;
+var sinh = /* #__PURE__ */(0, _factoriesAny.createSinh)({
+  typed: typed
+});
+exports.sinh = sinh;
+var sparse = /* #__PURE__ */(0, _factoriesAny.createSparse)({
+  SparseMatrix: SparseMatrix,
+  typed: typed
+});
+exports.sparse = sparse;
+var sqrt = /* #__PURE__ */(0, _factoriesAny.createSqrt)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.sqrt = sqrt;
+var tanh = /* #__PURE__ */(0, _factoriesAny.createTanh)({
+  typed: typed
+});
+exports.tanh = tanh;
+var unaryMinus = /* #__PURE__ */(0, _factoriesAny.createUnaryMinus)({
+  typed: typed
+});
+exports.unaryMinus = unaryMinus;
+var acoth = /* #__PURE__ */(0, _factoriesAny.createAcoth)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.acoth = acoth;
+var cot = /* #__PURE__ */(0, _factoriesAny.createCot)({
+  BigNumber: BigNumber,
+  typed: typed
+});
+exports.cot = cot;
+var fraction = /* #__PURE__ */(0, _factoriesAny.createFraction)({
+  Fraction: Fraction,
+  typed: typed
+});
+exports.fraction = fraction;
+var isNumeric = /* #__PURE__ */(0, _factoriesAny.createIsNumeric)({
+  typed: typed
+});
+exports.isNumeric = isNumeric;
+var matrix = /* #__PURE__ */(0, _factoriesAny.createMatrix)({
+  DenseMatrix: DenseMatrix,
+  Matrix: Matrix,
+  SparseMatrix: SparseMatrix,
+  typed: typed
+});
+exports.matrix = matrix;
+var matrixFromFunction = /* #__PURE__ */(0, _factoriesAny.createMatrixFromFunction)({
+  isZero: isZero,
+  matrix: matrix,
+  typed: typed
+});
+exports.matrixFromFunction = matrixFromFunction;
+var mod = /* #__PURE__ */(0, _factoriesAny.createMod)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.mod = mod;
+var nthRoot = /* #__PURE__ */(0, _factoriesAny.createNthRoot)({
+  BigNumber: BigNumber,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.nthRoot = nthRoot;
+var numeric = /* #__PURE__ */(0, _factoriesAny.createNumeric)({
+  bignumber: bignumber,
+  fraction: fraction,
+  number: number
+});
+exports.numeric = numeric;
+var or = /* #__PURE__ */(0, _factoriesAny.createOr)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.or = or;
+var prod = /* #__PURE__ */(0, _factoriesAny.createProd)({
+  config: _configReadonly.config,
+  multiplyScalar: multiplyScalar,
+  numeric: numeric,
+  typed: typed
+});
+exports.prod = prod;
+var reshape = /* #__PURE__ */(0, _factoriesAny.createReshape)({
+  isInteger: isInteger,
+  matrix: matrix,
+  typed: typed
+});
+exports.reshape = reshape;
+var size = /* #__PURE__ */(0, _factoriesAny.createSize)({
+  matrix: matrix,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.size = size;
+var smaller = /* #__PURE__ */(0, _factoriesAny.createSmaller)({
+  DenseMatrix: DenseMatrix,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.smaller = smaller;
+var squeeze = /* #__PURE__ */(0, _factoriesAny.createSqueeze)({
+  matrix: matrix,
+  typed: typed
+});
+exports.squeeze = squeeze;
+var subset = /* #__PURE__ */(0, _factoriesAny.createSubset)({
+  matrix: matrix,
+  typed: typed
+});
+exports.subset = subset;
+var subtract = /* #__PURE__ */(0, _factoriesAny.createSubtract)({
+  DenseMatrix: DenseMatrix,
+  addScalar: addScalar,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed,
+  unaryMinus: unaryMinus
+});
+exports.subtract = subtract;
+var to = /* #__PURE__ */(0, _factoriesAny.createTo)({
+  matrix: matrix,
+  typed: typed
+});
+exports.to = to;
+var transpose = /* #__PURE__ */(0, _factoriesAny.createTranspose)({
+  matrix: matrix,
+  typed: typed
+});
+exports.transpose = transpose;
+var xgcd = /* #__PURE__ */(0, _factoriesAny.createXgcd)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.xgcd = xgcd;
+var zeros = /* #__PURE__ */(0, _factoriesAny.createZeros)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.zeros = zeros;
+var and = /* #__PURE__ */(0, _factoriesAny.createAnd)({
+  equalScalar: equalScalar,
+  matrix: matrix,
+  not: not,
+  typed: typed,
+  zeros: zeros
+});
+exports.and = and;
+var bitAnd = /* #__PURE__ */(0, _factoriesAny.createBitAnd)({
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.bitAnd = bitAnd;
+var bitXor = /* #__PURE__ */(0, _factoriesAny.createBitXor)({
+  DenseMatrix: DenseMatrix,
+  matrix: matrix,
+  typed: typed
+});
+exports.bitXor = bitXor;
+var cbrt = /* #__PURE__ */(0, _factoriesAny.createCbrt)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  Fraction: Fraction,
+  config: _configReadonly.config,
+  isNegative: isNegative,
+  matrix: matrix,
+  typed: typed,
+  unaryMinus: unaryMinus
+});
+exports.cbrt = cbrt;
+var compare = /* #__PURE__ */(0, _factoriesAny.createCompare)({
+  BigNumber: BigNumber,
+  DenseMatrix: DenseMatrix,
+  Fraction: Fraction,
+  config: _configReadonly.config,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.compare = compare;
+var compareText = /* #__PURE__ */(0, _factoriesAny.createCompareText)({
+  matrix: matrix,
+  typed: typed
+});
+exports.compareText = compareText;
+var concat = /* #__PURE__ */(0, _factoriesAny.createConcat)({
+  isInteger: isInteger,
+  matrix: matrix,
+  typed: typed
+});
+exports.concat = concat;
+var count = /* #__PURE__ */(0, _factoriesAny.createCount)({
+  prod: prod,
+  size: size,
+  typed: typed
+});
+exports.count = count;
+var ctranspose = /* #__PURE__ */(0, _factoriesAny.createCtranspose)({
+  conj: conj,
+  transpose: transpose,
+  typed: typed
+});
+exports.ctranspose = ctranspose;
+var diag = /* #__PURE__ */(0, _factoriesAny.createDiag)({
+  DenseMatrix: DenseMatrix,
+  SparseMatrix: SparseMatrix,
+  matrix: matrix,
+  typed: typed
+});
+exports.diag = diag;
+var divideScalar = /* #__PURE__ */(0, _factoriesAny.createDivideScalar)({
+  numeric: numeric,
+  typed: typed
+});
+exports.divideScalar = divideScalar;
+var dotDivide = /* #__PURE__ */(0, _factoriesAny.createDotDivide)({
+  DenseMatrix: DenseMatrix,
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.dotDivide = dotDivide;
+var equal = /* #__PURE__ */(0, _factoriesAny.createEqual)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.equal = equal;
+var flatten = /* #__PURE__ */(0, _factoriesAny.createFlatten)({
+  matrix: matrix,
+  typed: typed
+});
+exports.flatten = flatten;
+var gcd = /* #__PURE__ */(0, _factoriesAny.createGcd)({
+  BigNumber: BigNumber,
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.gcd = gcd;
+var hasNumericValue = /* #__PURE__ */(0, _factoriesAny.createHasNumericValue)({
+  isNumeric: isNumeric,
+  typed: typed
+});
+exports.hasNumericValue = hasNumericValue;
+var hypot = /* #__PURE__ */(0, _factoriesAny.createHypot)({
+  abs: abs,
+  addScalar: addScalar,
+  divideScalar: divideScalar,
+  isPositive: isPositive,
+  multiplyScalar: multiplyScalar,
+  smaller: smaller,
+  sqrt: sqrt,
+  typed: typed
+});
+exports.hypot = hypot;
+var ImmutableDenseMatrix = /* #__PURE__ */(0, _factoriesAny.createImmutableDenseMatrixClass)({
+  DenseMatrix: DenseMatrix,
+  smaller: smaller
+});
+exports.ImmutableDenseMatrix = ImmutableDenseMatrix;
+var Index = /* #__PURE__ */(0, _factoriesAny.createIndexClass)({
+  ImmutableDenseMatrix: ImmutableDenseMatrix
+});
+exports.Index = Index;
+var kron = /* #__PURE__ */(0, _factoriesAny.createKron)({
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  typed: typed
+});
+exports.kron = kron;
+var largerEq = /* #__PURE__ */(0, _factoriesAny.createLargerEq)({
+  DenseMatrix: DenseMatrix,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.largerEq = largerEq;
+var leftShift = /* #__PURE__ */(0, _factoriesAny.createLeftShift)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed,
+  zeros: zeros
+});
+exports.leftShift = leftShift;
+var lsolve = /* #__PURE__ */(0, _factoriesAny.createLsolve)({
+  DenseMatrix: DenseMatrix,
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  subtract: subtract,
+  typed: typed
+});
+exports.lsolve = lsolve;
+var matrixFromColumns = /* #__PURE__ */(0, _factoriesAny.createMatrixFromColumns)({
+  flatten: flatten,
+  matrix: matrix,
+  size: size,
+  typed: typed
+});
+exports.matrixFromColumns = matrixFromColumns;
+var min = /* #__PURE__ */(0, _factoriesAny.createMin)({
+  config: _configReadonly.config,
+  numeric: numeric,
+  smaller: smaller,
+  typed: typed
+});
+exports.min = min;
+var mode = /* #__PURE__ */(0, _factoriesAny.createMode)({
+  isNaN: isNaN,
+  isNumeric: isNumeric,
+  typed: typed
+});
+exports.mode = mode;
+var nthRoots = /* #__PURE__ */(0, _factoriesAny.createNthRoots)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  divideScalar: divideScalar,
+  typed: typed
+});
+exports.nthRoots = nthRoots;
+var ones = /* #__PURE__ */(0, _factoriesAny.createOnes)({
+  BigNumber: BigNumber,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.ones = ones;
+var partitionSelect = /* #__PURE__ */(0, _factoriesAny.createPartitionSelect)({
+  compare: compare,
+  isNaN: isNaN,
+  isNumeric: isNumeric,
+  typed: typed
+});
+exports.partitionSelect = partitionSelect;
+var resize = /* #__PURE__ */(0, _factoriesAny.createResize)({
+  config: _configReadonly.config,
+  matrix: matrix
+});
+exports.resize = resize;
+var rightArithShift = /* #__PURE__ */(0, _factoriesAny.createRightArithShift)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed,
+  zeros: zeros
+});
+exports.rightArithShift = rightArithShift;
+var round = /* #__PURE__ */(0, _factoriesAny.createRound)({
+  BigNumber: BigNumber,
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed,
+  zeros: zeros
+});
+exports.round = round;
+var smallerEq = /* #__PURE__ */(0, _factoriesAny.createSmallerEq)({
+  DenseMatrix: DenseMatrix,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.smallerEq = smallerEq;
+var unequal = /* #__PURE__ */(0, _factoriesAny.createUnequal)({
+  DenseMatrix: DenseMatrix,
+  config: _configReadonly.config,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.unequal = unequal;
+var usolve = /* #__PURE__ */(0, _factoriesAny.createUsolve)({
+  DenseMatrix: DenseMatrix,
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  subtract: subtract,
+  typed: typed
+});
+exports.usolve = usolve;
+var xor = /* #__PURE__ */(0, _factoriesAny.createXor)({
+  DenseMatrix: DenseMatrix,
+  matrix: matrix,
+  typed: typed
+});
+exports.xor = xor;
+var add = /* #__PURE__ */(0, _factoriesAny.createAdd)({
+  DenseMatrix: DenseMatrix,
+  SparseMatrix: SparseMatrix,
+  addScalar: addScalar,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.add = add;
+var atan2 = /* #__PURE__ */(0, _factoriesAny.createAtan2)({
+  BigNumber: BigNumber,
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.atan2 = atan2;
+var bitOr = /* #__PURE__ */(0, _factoriesAny.createBitOr)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.bitOr = bitOr;
+var catalan = /* #__PURE__ */(0, _factoriesAny.createCatalan)({
+  addScalar: addScalar,
+  combinations: combinations,
+  divideScalar: divideScalar,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  multiplyScalar: multiplyScalar,
+  typed: typed
+});
+exports.catalan = catalan;
+var compareNatural = /* #__PURE__ */(0, _factoriesAny.createCompareNatural)({
+  compare: compare,
+  typed: typed
+});
+exports.compareNatural = compareNatural;
+var cumsum = /* #__PURE__ */(0, _factoriesAny.createCumSum)({
+  add: add,
+  typed: typed,
+  unaryPlus: unaryPlus
+});
+exports.cumsum = cumsum;
+var deepEqual = /* #__PURE__ */(0, _factoriesAny.createDeepEqual)({
+  equal: equal,
+  typed: typed
+});
+exports.deepEqual = deepEqual;
+var diff = /* #__PURE__ */(0, _factoriesAny.createDiff)({
+  matrix: matrix,
+  number: number,
+  subtract: subtract,
+  typed: typed
+});
+exports.diff = diff;
+var dot = /* #__PURE__ */(0, _factoriesAny.createDot)({
+  addScalar: addScalar,
+  conj: conj,
+  multiplyScalar: multiplyScalar,
+  size: size,
+  typed: typed
+});
+exports.dot = dot;
+var equalText = /* #__PURE__ */(0, _factoriesAny.createEqualText)({
+  compareText: compareText,
+  isZero: isZero,
+  typed: typed
+});
+exports.equalText = equalText;
+var floor = /* #__PURE__ */(0, _factoriesAny.createFloor)({
+  config: _configReadonly.config,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  round: round,
+  typed: typed
+});
+exports.floor = floor;
+var identity = /* #__PURE__ */(0, _factoriesAny.createIdentity)({
+  BigNumber: BigNumber,
+  DenseMatrix: DenseMatrix,
+  SparseMatrix: SparseMatrix,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.identity = identity;
+var invmod = /* #__PURE__ */(0, _factoriesAny.createInvmod)({
+  BigNumber: BigNumber,
+  add: add,
+  config: _configReadonly.config,
+  equal: equal,
+  isInteger: isInteger,
+  mod: mod,
+  smaller: smaller,
+  typed: typed,
+  xgcd: xgcd
+});
+exports.invmod = invmod;
+var larger = /* #__PURE__ */(0, _factoriesAny.createLarger)({
+  DenseMatrix: DenseMatrix,
+  config: _configReadonly.config,
+  matrix: matrix,
+  typed: typed
+});
+exports.larger = larger;
+var log = /* #__PURE__ */(0, _factoriesAny.createLog)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  divideScalar: divideScalar,
+  typed: typed
+});
+exports.log = log;
+var lsolveAll = /* #__PURE__ */(0, _factoriesAny.createLsolveAll)({
+  DenseMatrix: DenseMatrix,
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  subtract: subtract,
+  typed: typed
+});
+exports.lsolveAll = lsolveAll;
+var matrixFromRows = /* #__PURE__ */(0, _factoriesAny.createMatrixFromRows)({
+  flatten: flatten,
+  matrix: matrix,
+  size: size,
+  typed: typed
+});
+exports.matrixFromRows = matrixFromRows;
+var multiply = /* #__PURE__ */(0, _factoriesAny.createMultiply)({
+  addScalar: addScalar,
+  dot: dot,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  typed: typed
+});
+exports.multiply = multiply;
+var pow = /* #__PURE__ */(0, _factoriesAny.createPow)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  fraction: fraction,
+  identity: identity,
+  matrix: matrix,
+  multiply: multiply,
+  number: number,
+  typed: typed
+});
+exports.pow = pow;
+var qr = /* #__PURE__ */(0, _factoriesAny.createQr)({
+  addScalar: addScalar,
+  complex: complex,
+  conj: conj,
+  divideScalar: divideScalar,
+  equal: equal,
+  identity: identity,
+  isZero: isZero,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  sign: sign,
+  sqrt: sqrt,
+  subtract: subtract,
+  typed: typed,
+  unaryMinus: unaryMinus,
+  zeros: zeros
+});
+exports.qr = qr;
+var range = /* #__PURE__ */(0, _factoriesAny.createRange)({
+  bignumber: bignumber,
+  matrix: matrix,
+  config: _configReadonly.config,
+  larger: larger,
+  largerEq: largerEq,
+  smaller: smaller,
+  smallerEq: smallerEq,
+  typed: typed
+});
+exports.range = range;
+var rightLogShift = /* #__PURE__ */(0, _factoriesAny.createRightLogShift)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed,
+  zeros: zeros
+});
+exports.rightLogShift = rightLogShift;
+var row = /* #__PURE__ */(0, _factoriesAny.createRow)({
+  Index: Index,
+  matrix: matrix,
+  range: range,
+  typed: typed
+});
+exports.row = row;
+var setCartesian = /* #__PURE__ */(0, _factoriesAny.createSetCartesian)({
+  DenseMatrix: DenseMatrix,
+  Index: Index,
+  compareNatural: compareNatural,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setCartesian = setCartesian;
+var setDistinct = /* #__PURE__ */(0, _factoriesAny.createSetDistinct)({
+  DenseMatrix: DenseMatrix,
+  Index: Index,
+  compareNatural: compareNatural,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setDistinct = setDistinct;
+var setIsSubset = /* #__PURE__ */(0, _factoriesAny.createSetIsSubset)({
+  Index: Index,
+  compareNatural: compareNatural,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setIsSubset = setIsSubset;
+var setPowerset = /* #__PURE__ */(0, _factoriesAny.createSetPowerset)({
+  Index: Index,
+  compareNatural: compareNatural,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setPowerset = setPowerset;
+var slu = /* #__PURE__ */(0, _factoriesAny.createSlu)({
+  SparseMatrix: SparseMatrix,
+  abs: abs,
+  add: add,
+  divideScalar: divideScalar,
+  larger: larger,
+  largerEq: largerEq,
+  multiply: multiply,
+  subtract: subtract,
+  transpose: transpose,
+  typed: typed
+});
+exports.slu = slu;
+var sum = /* #__PURE__ */(0, _factoriesAny.createSum)({
+  add: add,
+  config: _configReadonly.config,
+  numeric: numeric,
+  typed: typed
+});
+exports.sum = sum;
+var trace = /* #__PURE__ */(0, _factoriesAny.createTrace)({
+  add: add,
+  matrix: matrix,
+  typed: typed
+});
+exports.trace = trace;
+var usolveAll = /* #__PURE__ */(0, _factoriesAny.createUsolveAll)({
+  DenseMatrix: DenseMatrix,
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  subtract: subtract,
+  typed: typed
+});
+exports.usolveAll = usolveAll;
+var asin = /* #__PURE__ */(0, _factoriesAny.createAsin)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.asin = asin;
+var ceil = /* #__PURE__ */(0, _factoriesAny.createCeil)({
+  config: _configReadonly.config,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  round: round,
+  typed: typed
+});
+exports.ceil = ceil;
+var column = /* #__PURE__ */(0, _factoriesAny.createColumn)({
+  Index: Index,
+  matrix: matrix,
+  range: range,
+  typed: typed
+});
+exports.column = column;
+var composition = /* #__PURE__ */(0, _factoriesAny.createComposition)({
+  addScalar: addScalar,
+  combinations: combinations,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  isPositive: isPositive,
+  larger: larger,
+  typed: typed
+});
+exports.composition = composition;
+var cross = /* #__PURE__ */(0, _factoriesAny.createCross)({
+  matrix: matrix,
+  multiply: multiply,
+  subtract: subtract,
+  typed: typed
+});
+exports.cross = cross;
+var distance = /* #__PURE__ */(0, _factoriesAny.createDistance)({
+  abs: abs,
+  addScalar: addScalar,
+  divideScalar: divideScalar,
+  multiplyScalar: multiplyScalar,
+  sqrt: sqrt,
+  subtract: subtract,
+  typed: typed,
+  unaryMinus: unaryMinus
+});
+exports.distance = distance;
+var dotMultiply = /* #__PURE__ */(0, _factoriesAny.createDotMultiply)({
+  equalScalar: equalScalar,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  typed: typed
+});
+exports.dotMultiply = dotMultiply;
+var FibonacciHeap = /* #__PURE__ */(0, _factoriesAny.createFibonacciHeapClass)({
+  larger: larger,
+  smaller: smaller
+});
+exports.FibonacciHeap = FibonacciHeap;
+var fix = /* #__PURE__ */(0, _factoriesAny.createFix)({
+  Complex: Complex,
+  ceil: ceil,
+  floor: floor,
+  matrix: matrix,
+  typed: typed
+});
+exports.fix = fix;
+var gamma = /* #__PURE__ */(0, _factoriesAny.createGamma)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  config: _configReadonly.config,
+  multiplyScalar: multiplyScalar,
+  pow: pow,
+  typed: typed
+});
+exports.gamma = gamma;
+var index = /* #__PURE__ */(0, _factoriesAny.createIndex)({
+  Index: Index,
+  typed: typed
+});
+exports.index = index;
+var lcm = /* #__PURE__ */(0, _factoriesAny.createLcm)({
+  equalScalar: equalScalar,
+  matrix: matrix,
+  typed: typed
+});
+exports.lcm = lcm;
+var log1p = /* #__PURE__ */(0, _factoriesAny.createLog1p)({
+  Complex: Complex,
+  config: _configReadonly.config,
+  divideScalar: divideScalar,
+  log: log,
+  typed: typed
+});
+exports.log1p = log1p;
+var max = /* #__PURE__ */(0, _factoriesAny.createMax)({
+  config: _configReadonly.config,
+  larger: larger,
+  numeric: numeric,
+  typed: typed
+});
+exports.max = max;
+var quantileSeq = /* #__PURE__ */(0, _factoriesAny.createQuantileSeq)({
+  add: add,
+  compare: compare,
+  multiply: multiply,
+  partitionSelect: partitionSelect,
+  typed: typed
+});
+exports.quantileSeq = quantileSeq;
+var setDifference = /* #__PURE__ */(0, _factoriesAny.createSetDifference)({
+  DenseMatrix: DenseMatrix,
+  Index: Index,
+  compareNatural: compareNatural,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setDifference = setDifference;
+var setMultiplicity = /* #__PURE__ */(0, _factoriesAny.createSetMultiplicity)({
+  Index: Index,
+  compareNatural: compareNatural,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setMultiplicity = setMultiplicity;
+var setSymDifference = /* #__PURE__ */(0, _factoriesAny.createSetSymDifference)({
+  Index: Index,
+  concat: concat,
+  setDifference: setDifference,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setSymDifference = setSymDifference;
+var sort = /* #__PURE__ */(0, _factoriesAny.createSort)({
+  compare: compare,
+  compareNatural: compareNatural,
+  matrix: matrix,
+  typed: typed
+});
+exports.sort = sort;
+var Unit = /* #__PURE__ */(0, _factoriesAny.createUnitClass)({
+  BigNumber: BigNumber,
+  Complex: Complex,
+  Fraction: Fraction,
+  abs: abs,
+  addScalar: addScalar,
+  config: _configReadonly.config,
+  divideScalar: divideScalar,
+  equal: equal,
+  fix: fix,
+  format: format,
+  isNumeric: isNumeric,
+  multiplyScalar: multiplyScalar,
+  number: number,
+  pow: pow,
+  round: round,
+  subtract: subtract
+});
+exports.Unit = Unit;
+var vacuumImpedance = /* #__PURE__ */(0, _factoriesAny.createVacuumImpedance)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.vacuumImpedance = vacuumImpedance;
+var wienDisplacement = /* #__PURE__ */(0, _factoriesAny.createWienDisplacement)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.wienDisplacement = wienDisplacement;
+var atomicMass = /* #__PURE__ */(0, _factoriesAny.createAtomicMass)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.atomicMass = atomicMass;
+var bohrMagneton = /* #__PURE__ */(0, _factoriesAny.createBohrMagneton)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.bohrMagneton = bohrMagneton;
+var boltzmann = /* #__PURE__ */(0, _factoriesAny.createBoltzmann)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.boltzmann = boltzmann;
+var conductanceQuantum = /* #__PURE__ */(0, _factoriesAny.createConductanceQuantum)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.conductanceQuantum = conductanceQuantum;
+var createUnit = /* #__PURE__ */(0, _factoriesAny.createCreateUnit)({
+  Unit: Unit,
+  typed: typed
+});
+exports.createUnit = createUnit;
+var deuteronMass = /* #__PURE__ */(0, _factoriesAny.createDeuteronMass)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.deuteronMass = deuteronMass;
+var dotPow = /* #__PURE__ */(0, _factoriesAny.createDotPow)({
+  DenseMatrix: DenseMatrix,
+  equalScalar: equalScalar,
+  matrix: matrix,
+  pow: pow,
+  typed: typed
+});
+exports.dotPow = dotPow;
+var electricConstant = /* #__PURE__ */(0, _factoriesAny.createElectricConstant)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.electricConstant = electricConstant;
+var elementaryCharge = /* #__PURE__ */(0, _factoriesAny.createElementaryCharge)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.elementaryCharge = elementaryCharge;
+var factorial = /* #__PURE__ */(0, _factoriesAny.createFactorial)({
+  gamma: gamma,
+  typed: typed
+});
+exports.factorial = factorial;
+var fermiCoupling = /* #__PURE__ */(0, _factoriesAny.createFermiCoupling)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.fermiCoupling = fermiCoupling;
+var gasConstant = /* #__PURE__ */(0, _factoriesAny.createGasConstant)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.gasConstant = gasConstant;
+var gravity = /* #__PURE__ */(0, _factoriesAny.createGravity)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.gravity = gravity;
+var intersect = /* #__PURE__ */(0, _factoriesAny.createIntersect)({
+  abs: abs,
+  add: add,
+  addScalar: addScalar,
+  config: _configReadonly.config,
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  flatten: flatten,
+  isNumeric: isNumeric,
+  isZero: isZero,
+  matrix: matrix,
+  multiply: multiply,
+  multiplyScalar: multiplyScalar,
+  smaller: smaller,
+  subtract: subtract,
+  typed: typed
+});
+exports.intersect = intersect;
+var inverseConductanceQuantum = /* #__PURE__ */(0, _factoriesAny.createInverseConductanceQuantum)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.inverseConductanceQuantum = inverseConductanceQuantum;
+var klitzing = /* #__PURE__ */(0, _factoriesAny.createKlitzing)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.klitzing = klitzing;
+var loschmidt = /* #__PURE__ */(0, _factoriesAny.createLoschmidt)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.loschmidt = loschmidt;
+var magneticConstant = /* #__PURE__ */(0, _factoriesAny.createMagneticConstant)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.magneticConstant = magneticConstant;
+var molarMass = /* #__PURE__ */(0, _factoriesAny.createMolarMass)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.molarMass = molarMass;
+var molarPlanckConstant = /* #__PURE__ */(0, _factoriesAny.createMolarPlanckConstant)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.molarPlanckConstant = molarPlanckConstant;
+var neutronMass = /* #__PURE__ */(0, _factoriesAny.createNeutronMass)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.neutronMass = neutronMass;
+var nuclearMagneton = /* #__PURE__ */(0, _factoriesAny.createNuclearMagneton)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.nuclearMagneton = nuclearMagneton;
+var permutations = /* #__PURE__ */(0, _factoriesAny.createPermutations)({
+  factorial: factorial,
+  typed: typed
+});
+exports.permutations = permutations;
+var planckConstant = /* #__PURE__ */(0, _factoriesAny.createPlanckConstant)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.planckConstant = planckConstant;
+var planckMass = /* #__PURE__ */(0, _factoriesAny.createPlanckMass)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.planckMass = planckMass;
+var planckTime = /* #__PURE__ */(0, _factoriesAny.createPlanckTime)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.planckTime = planckTime;
+var quantumOfCirculation = /* #__PURE__ */(0, _factoriesAny.createQuantumOfCirculation)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.quantumOfCirculation = quantumOfCirculation;
+var reducedPlanckConstant = /* #__PURE__ */(0, _factoriesAny.createReducedPlanckConstant)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.reducedPlanckConstant = reducedPlanckConstant;
+var rydberg = /* #__PURE__ */(0, _factoriesAny.createRydberg)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.rydberg = rydberg;
+var setIntersect = /* #__PURE__ */(0, _factoriesAny.createSetIntersect)({
+  DenseMatrix: DenseMatrix,
+  Index: Index,
+  compareNatural: compareNatural,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setIntersect = setIntersect;
+var setUnion = /* #__PURE__ */(0, _factoriesAny.createSetUnion)({
+  Index: Index,
+  concat: concat,
+  setIntersect: setIntersect,
+  setSymDifference: setSymDifference,
+  size: size,
+  subset: subset,
+  typed: typed
+});
+exports.setUnion = setUnion;
+var Spa = /* #__PURE__ */(0, _factoriesAny.createSpaClass)({
+  FibonacciHeap: FibonacciHeap,
+  addScalar: addScalar,
+  equalScalar: equalScalar
+});
+exports.Spa = Spa;
+var stefanBoltzmann = /* #__PURE__ */(0, _factoriesAny.createStefanBoltzmann)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.stefanBoltzmann = stefanBoltzmann;
+var thomsonCrossSection = /* #__PURE__ */(0, _factoriesAny.createThomsonCrossSection)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.thomsonCrossSection = thomsonCrossSection;
+var avogadro = /* #__PURE__ */(0, _factoriesAny.createAvogadro)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.avogadro = avogadro;
+var bohrRadius = /* #__PURE__ */(0, _factoriesAny.createBohrRadius)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.bohrRadius = bohrRadius;
+var coulomb = /* #__PURE__ */(0, _factoriesAny.createCoulomb)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.coulomb = coulomb;
+var electronMass = /* #__PURE__ */(0, _factoriesAny.createElectronMass)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.electronMass = electronMass;
+var faraday = /* #__PURE__ */(0, _factoriesAny.createFaraday)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.faraday = faraday;
+var hartreeEnergy = /* #__PURE__ */(0, _factoriesAny.createHartreeEnergy)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.hartreeEnergy = hartreeEnergy;
+var lup = /* #__PURE__ */(0, _factoriesAny.createLup)({
+  DenseMatrix: DenseMatrix,
+  Spa: Spa,
+  SparseMatrix: SparseMatrix,
+  abs: abs,
+  addScalar: addScalar,
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  larger: larger,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  subtract: subtract,
+  typed: typed,
+  unaryMinus: unaryMinus
+});
+exports.lup = lup;
+var magneticFluxQuantum = /* #__PURE__ */(0, _factoriesAny.createMagneticFluxQuantum)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.magneticFluxQuantum = magneticFluxQuantum;
+var molarMassC12 = /* #__PURE__ */(0, _factoriesAny.createMolarMassC12)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.molarMassC12 = molarMassC12;
+var planckCharge = /* #__PURE__ */(0, _factoriesAny.createPlanckCharge)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.planckCharge = planckCharge;
+var planckTemperature = /* #__PURE__ */(0, _factoriesAny.createPlanckTemperature)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.planckTemperature = planckTemperature;
+var secondRadiation = /* #__PURE__ */(0, _factoriesAny.createSecondRadiation)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.secondRadiation = secondRadiation;
+var speedOfLight = /* #__PURE__ */(0, _factoriesAny.createSpeedOfLight)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.speedOfLight = speedOfLight;
+var stirlingS2 = /* #__PURE__ */(0, _factoriesAny.createStirlingS2)({
+  bignumber: bignumber,
+  addScalar: addScalar,
+  combinations: combinations,
+  divideScalar: divideScalar,
+  factorial: factorial,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  larger: larger,
+  multiplyScalar: multiplyScalar,
+  number: number,
+  pow: pow,
+  subtract: subtract,
+  typed: typed
+});
+exports.stirlingS2 = stirlingS2;
+var unit = /* #__PURE__ */(0, _factoriesAny.createUnitFunction)({
+  Unit: Unit,
+  typed: typed
+});
+exports.unit = unit;
+var bellNumbers = /* #__PURE__ */(0, _factoriesAny.createBellNumbers)({
+  addScalar: addScalar,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  stirlingS2: stirlingS2,
+  typed: typed
+});
+exports.bellNumbers = bellNumbers;
+var det = /* #__PURE__ */(0, _factoriesAny.createDet)({
+  lup: lup,
+  matrix: matrix,
+  multiply: multiply,
+  subtract: subtract,
+  typed: typed,
+  unaryMinus: unaryMinus
+});
+exports.det = det;
+var firstRadiation = /* #__PURE__ */(0, _factoriesAny.createFirstRadiation)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.firstRadiation = firstRadiation;
+var molarVolume = /* #__PURE__ */(0, _factoriesAny.createMolarVolume)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.molarVolume = molarVolume;
+var protonMass = /* #__PURE__ */(0, _factoriesAny.createProtonMass)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.protonMass = protonMass;
+var setSize = /* #__PURE__ */(0, _factoriesAny.createSetSize)({
+  compareNatural: compareNatural,
+  typed: typed
+});
+exports.setSize = setSize;
+var classicalElectronRadius = /* #__PURE__ */(0, _factoriesAny.createClassicalElectronRadius)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.classicalElectronRadius = classicalElectronRadius;
+var gravitationConstant = /* #__PURE__ */(0, _factoriesAny.createGravitationConstant)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.gravitationConstant = gravitationConstant;
+var inv = /* #__PURE__ */(0, _factoriesAny.createInv)({
+  abs: abs,
+  addScalar: addScalar,
+  det: det,
+  divideScalar: divideScalar,
+  identity: identity,
+  matrix: matrix,
+  multiply: multiply,
+  typed: typed,
+  unaryMinus: unaryMinus
+});
+exports.inv = inv;
+var lusolve = /* #__PURE__ */(0, _factoriesAny.createLusolve)({
+  DenseMatrix: DenseMatrix,
+  lsolve: lsolve,
+  lup: lup,
+  matrix: matrix,
+  slu: slu,
+  typed: typed,
+  usolve: usolve
+});
+exports.lusolve = lusolve;
+var sqrtm = /* #__PURE__ */(0, _factoriesAny.createSqrtm)({
+  abs: abs,
+  add: add,
+  identity: identity,
+  inv: inv,
+  max: max,
+  multiply: multiply,
+  size: size,
+  sqrt: sqrt,
+  subtract: subtract,
+  typed: typed
+});
+exports.sqrtm = sqrtm;
+var divide = /* #__PURE__ */(0, _factoriesAny.createDivide)({
+  divideScalar: divideScalar,
+  equalScalar: equalScalar,
+  inv: inv,
+  matrix: matrix,
+  multiply: multiply,
+  typed: typed
+});
+exports.divide = divide;
+var expm = /* #__PURE__ */(0, _factoriesAny.createExpm)({
+  abs: abs,
+  add: add,
+  identity: identity,
+  inv: inv,
+  multiply: multiply,
+  typed: typed
+});
+exports.expm = expm;
+var kldivergence = /* #__PURE__ */(0, _factoriesAny.createKldivergence)({
+  divide: divide,
+  dotDivide: dotDivide,
+  isNumeric: isNumeric,
+  log: log,
+  matrix: matrix,
+  multiply: multiply,
+  sum: sum,
+  typed: typed
+});
+exports.kldivergence = kldivergence;
+var mean = /* #__PURE__ */(0, _factoriesAny.createMean)({
+  add: add,
+  divide: divide,
+  typed: typed
+});
+exports.mean = mean;
+var median = /* #__PURE__ */(0, _factoriesAny.createMedian)({
+  add: add,
+  compare: compare,
+  divide: divide,
+  partitionSelect: partitionSelect,
+  typed: typed
+});
+exports.median = median;
+var planckLength = /* #__PURE__ */(0, _factoriesAny.createPlanckLength)({
+  BigNumber: BigNumber,
+  Unit: Unit,
+  config: _configReadonly.config
+});
+exports.planckLength = planckLength;
+var variance = /* #__PURE__ */(0, _factoriesAny.createVariance)({
+  add: add,
+  apply: apply,
+  divide: divide,
+  isNaN: isNaN,
+  multiply: multiply,
+  subtract: subtract,
+  typed: typed
+});
+exports.variance = variance;
+var eigs = /* #__PURE__ */(0, _factoriesAny.createEigs)({
+  abs: abs,
+  add: add,
+  addScalar: addScalar,
+  atan: atan,
+  bignumber: bignumber,
+  column: column,
+  complex: complex,
+  config: _configReadonly.config,
+  cos: cos,
+  diag: diag,
+  divideScalar: divideScalar,
+  dot: dot,
+  equal: equal,
+  flatten: flatten,
+  im: im,
+  inv: inv,
+  larger: larger,
+  matrix: matrix,
+  matrixFromColumns: matrixFromColumns,
+  multiply: multiply,
+  multiplyScalar: multiplyScalar,
+  number: number,
+  qr: qr,
+  re: re,
+  sin: sin,
+  smaller: smaller,
+  sqrt: sqrt,
+  subtract: subtract,
+  typed: typed,
+  usolve: usolve,
+  usolveAll: usolveAll
+});
+exports.eigs = eigs;
+var mad = /* #__PURE__ */(0, _factoriesAny.createMad)({
+  abs: abs,
+  map: map,
+  median: median,
+  subtract: subtract,
+  typed: typed
+});
+exports.mad = mad;
+var multinomial = /* #__PURE__ */(0, _factoriesAny.createMultinomial)({
+  add: add,
+  divide: divide,
+  factorial: factorial,
+  isInteger: isInteger,
+  isPositive: isPositive,
+  multiply: multiply,
+  typed: typed
+});
+exports.multinomial = multinomial;
+var std = /* #__PURE__ */(0, _factoriesAny.createStd)({
+  sqrt: sqrt,
+  typed: typed,
+  variance: variance
+});
+exports.std = std;
+var norm = /* #__PURE__ */(0, _factoriesAny.createNorm)({
+  abs: abs,
+  add: add,
+  conj: conj,
+  ctranspose: ctranspose,
+  eigs: eigs,
+  equalScalar: equalScalar,
+  larger: larger,
+  matrix: matrix,
+  multiply: multiply,
+  pow: pow,
+  smaller: smaller,
+  sqrt: sqrt,
+  typed: typed
+});
+exports.norm = norm;
+var rotationMatrix = /* #__PURE__ */(0, _factoriesAny.createRotationMatrix)({
+  BigNumber: BigNumber,
+  DenseMatrix: DenseMatrix,
+  SparseMatrix: SparseMatrix,
+  addScalar: addScalar,
+  config: _configReadonly.config,
+  cos: cos,
+  matrix: matrix,
+  multiplyScalar: multiplyScalar,
+  norm: norm,
+  sin: sin,
+  typed: typed,
+  unaryMinus: unaryMinus
+});
+exports.rotationMatrix = rotationMatrix;
+var rotate = /* #__PURE__ */(0, _factoriesAny.createRotate)({
+  multiply: multiply,
+  rotationMatrix: rotationMatrix,
+  typed: typed
+});
+exports.rotate = rotate;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/pureFunctionsNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/pureFunctionsNumber.generated.js
new file mode 100644
index 0000000..1fad174
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/pureFunctionsNumber.generated.js
@@ -0,0 +1,724 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mode = exports.mod = exports.min = exports.median = exports.mean = exports.max = exports.matrix = exports.map = exports.mad = exports.log2 = exports.log1p = exports.log10 = exports.log = exports.leftShift = exports.lcm = exports.largerEq = exports.larger = exports.isZero = exports.isPrime = exports.isPositive = exports.isNumeric = exports.isNegative = exports.isNaN = exports.isInteger = exports.index = exports.hypot = exports.hasNumericValue = exports.gcd = exports.gamma = exports.format = exports.forEach = exports.floor = exports.fix = exports.filter = exports.factorial = exports.expm1 = exports.exp = exports.erf = exports.equalText = exports.equalScalar = exports.equal = exports.e = exports.divideScalar = exports.divide = exports.deepEqual = exports.cumsum = exports.cube = exports.csch = exports.csc = exports.coth = exports.cot = exports.cosh = exports.cos = exports.composition = exports.compareText = exports.compareNatural = exports.compare = exports.combinationsWithRep = exports.combinations = exports.clone = exports.ceil = exports.cbrt = exports.catalan = exports.boolean = exports.bitXor = exports.bitOr = exports.bitNot = exports.bitAnd = exports.bellNumbers = exports.atanh = exports.atan2 = exports.atan = exports.asinh = exports.asin = exports.asech = exports.asec = exports.apply = exports.and = exports.addScalar = exports.add = exports.acsch = exports.acsc = exports.acoth = exports.acot = exports.acosh = exports.acos = exports.abs = exports._true = exports._null = exports._false = exports._NaN = exports._Infinity = exports.SQRT2 = exports.SQRT1_2 = exports.ResultSet = exports.Range = exports.LOG2E = exports.LOG10E = exports.LN2 = exports.LN10 = void 0;
+exports.xor = exports.xgcd = exports.version = exports.variance = exports.unequal = exports.unaryPlus = exports.unaryMinus = exports.typed = exports.typeOf = exports.tau = exports.tanh = exports.tan = exports.sum = exports.subtract = exports.subset = exports.string = exports.stirlingS2 = exports.std = exports.square = exports.sqrt = exports.smallerEq = exports.smaller = exports.size = exports.sinh = exports.sin = exports.sign = exports.sech = exports.sec = exports.round = exports.rightLogShift = exports.rightArithShift = exports.replacer = exports.range = exports.randomInt = exports.random = exports.quantileSeq = exports.prod = exports.print = exports.pow = exports.pickRandom = exports.pi = exports.phi = exports.permutations = exports.partitionSelect = exports.or = exports.numeric = exports.number = exports.nthRoot = exports.not = exports.norm = exports.multiplyScalar = exports.multiply = exports.multinomial = void 0;
+
+var _configReadonly = require("./configReadonly.js");
+
+var _factoriesNumber = require("../factoriesNumber.js");
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+var e = /* #__PURE__ */(0, _factoriesNumber.createE)({
+  config: _configReadonly.config
+});
+exports.e = e;
+
+var _false = /* #__PURE__ */(0, _factoriesNumber.createFalse)({});
+
+exports._false = _false;
+var index = /* #__PURE__ */(0, _factoriesNumber.createIndex)({});
+exports.index = index;
+
+var _Infinity = /* #__PURE__ */(0, _factoriesNumber.createInfinity)({
+  config: _configReadonly.config
+});
+
+exports._Infinity = _Infinity;
+var LN10 = /* #__PURE__ */(0, _factoriesNumber.createLN10)({
+  config: _configReadonly.config
+});
+exports.LN10 = LN10;
+var LOG10E = /* #__PURE__ */(0, _factoriesNumber.createLOG10E)({
+  config: _configReadonly.config
+});
+exports.LOG10E = LOG10E;
+var matrix = /* #__PURE__ */(0, _factoriesNumber.createMatrix)({});
+exports.matrix = matrix;
+
+var _NaN = /* #__PURE__ */(0, _factoriesNumber.createNaN)({
+  config: _configReadonly.config
+});
+
+exports._NaN = _NaN;
+
+var _null = /* #__PURE__ */(0, _factoriesNumber.createNull)({});
+
+exports._null = _null;
+var phi = /* #__PURE__ */(0, _factoriesNumber.createPhi)({
+  config: _configReadonly.config
+});
+exports.phi = phi;
+var Range = /* #__PURE__ */(0, _factoriesNumber.createRangeClass)({});
+exports.Range = Range;
+var replacer = /* #__PURE__ */(0, _factoriesNumber.createReplacer)({});
+exports.replacer = replacer;
+var ResultSet = /* #__PURE__ */(0, _factoriesNumber.createResultSet)({});
+exports.ResultSet = ResultSet;
+var SQRT1_2 = /* #__PURE__ */(0, _factoriesNumber.createSQRT1_2)({
+  config: _configReadonly.config
+});
+exports.SQRT1_2 = SQRT1_2;
+var subset = /* #__PURE__ */(0, _factoriesNumber.createSubset)({});
+exports.subset = subset;
+var tau = /* #__PURE__ */(0, _factoriesNumber.createTau)({
+  config: _configReadonly.config
+});
+exports.tau = tau;
+var typed = /* #__PURE__ */(0, _factoriesNumber.createTyped)({});
+exports.typed = typed;
+var unaryPlus = /* #__PURE__ */(0, _factoriesNumber.createUnaryPlus)({
+  typed: typed
+});
+exports.unaryPlus = unaryPlus;
+var version = /* #__PURE__ */(0, _factoriesNumber.createVersion)({});
+exports.version = version;
+var xor = /* #__PURE__ */(0, _factoriesNumber.createXor)({
+  typed: typed
+});
+exports.xor = xor;
+var abs = /* #__PURE__ */(0, _factoriesNumber.createAbs)({
+  typed: typed
+});
+exports.abs = abs;
+var acos = /* #__PURE__ */(0, _factoriesNumber.createAcos)({
+  typed: typed
+});
+exports.acos = acos;
+var acot = /* #__PURE__ */(0, _factoriesNumber.createAcot)({
+  typed: typed
+});
+exports.acot = acot;
+var acsc = /* #__PURE__ */(0, _factoriesNumber.createAcsc)({
+  typed: typed
+});
+exports.acsc = acsc;
+var add = /* #__PURE__ */(0, _factoriesNumber.createAdd)({
+  typed: typed
+});
+exports.add = add;
+var and = /* #__PURE__ */(0, _factoriesNumber.createAnd)({
+  typed: typed
+});
+exports.and = and;
+var asec = /* #__PURE__ */(0, _factoriesNumber.createAsec)({
+  typed: typed
+});
+exports.asec = asec;
+var asin = /* #__PURE__ */(0, _factoriesNumber.createAsin)({
+  typed: typed
+});
+exports.asin = asin;
+var atan = /* #__PURE__ */(0, _factoriesNumber.createAtan)({
+  typed: typed
+});
+exports.atan = atan;
+var atanh = /* #__PURE__ */(0, _factoriesNumber.createAtanh)({
+  typed: typed
+});
+exports.atanh = atanh;
+var bitAnd = /* #__PURE__ */(0, _factoriesNumber.createBitAnd)({
+  typed: typed
+});
+exports.bitAnd = bitAnd;
+var bitOr = /* #__PURE__ */(0, _factoriesNumber.createBitOr)({
+  typed: typed
+});
+exports.bitOr = bitOr;
+var boolean = /* #__PURE__ */(0, _factoriesNumber.createBoolean)({
+  typed: typed
+});
+exports.boolean = boolean;
+var cbrt = /* #__PURE__ */(0, _factoriesNumber.createCbrt)({
+  typed: typed
+});
+exports.cbrt = cbrt;
+var combinations = /* #__PURE__ */(0, _factoriesNumber.createCombinations)({
+  typed: typed
+});
+exports.combinations = combinations;
+var compare = /* #__PURE__ */(0, _factoriesNumber.createCompare)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.compare = compare;
+var compareText = /* #__PURE__ */(0, _factoriesNumber.createCompareText)({
+  typed: typed
+});
+exports.compareText = compareText;
+var cos = /* #__PURE__ */(0, _factoriesNumber.createCos)({
+  typed: typed
+});
+exports.cos = cos;
+var cot = /* #__PURE__ */(0, _factoriesNumber.createCot)({
+  typed: typed
+});
+exports.cot = cot;
+var csc = /* #__PURE__ */(0, _factoriesNumber.createCsc)({
+  typed: typed
+});
+exports.csc = csc;
+var cube = /* #__PURE__ */(0, _factoriesNumber.createCube)({
+  typed: typed
+});
+exports.cube = cube;
+var divide = /* #__PURE__ */(0, _factoriesNumber.createDivide)({
+  typed: typed
+});
+exports.divide = divide;
+var equalScalar = /* #__PURE__ */(0, _factoriesNumber.createEqualScalar)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.equalScalar = equalScalar;
+var erf = /* #__PURE__ */(0, _factoriesNumber.createErf)({
+  typed: typed
+});
+exports.erf = erf;
+var exp = /* #__PURE__ */(0, _factoriesNumber.createExp)({
+  typed: typed
+});
+exports.exp = exp;
+var filter = /* #__PURE__ */(0, _factoriesNumber.createFilter)({
+  typed: typed
+});
+exports.filter = filter;
+var fix = /* #__PURE__ */(0, _factoriesNumber.createFix)({
+  typed: typed
+});
+exports.fix = fix;
+var forEach = /* #__PURE__ */(0, _factoriesNumber.createForEach)({
+  typed: typed
+});
+exports.forEach = forEach;
+var format = /* #__PURE__ */(0, _factoriesNumber.createFormat)({
+  typed: typed
+});
+exports.format = format;
+var gamma = /* #__PURE__ */(0, _factoriesNumber.createGamma)({
+  typed: typed
+});
+exports.gamma = gamma;
+var isInteger = /* #__PURE__ */(0, _factoriesNumber.createIsInteger)({
+  typed: typed
+});
+exports.isInteger = isInteger;
+var isNegative = /* #__PURE__ */(0, _factoriesNumber.createIsNegative)({
+  typed: typed
+});
+exports.isNegative = isNegative;
+var isPositive = /* #__PURE__ */(0, _factoriesNumber.createIsPositive)({
+  typed: typed
+});
+exports.isPositive = isPositive;
+var isZero = /* #__PURE__ */(0, _factoriesNumber.createIsZero)({
+  typed: typed
+});
+exports.isZero = isZero;
+var LOG2E = /* #__PURE__ */(0, _factoriesNumber.createLOG2E)({
+  config: _configReadonly.config
+});
+exports.LOG2E = LOG2E;
+var largerEq = /* #__PURE__ */(0, _factoriesNumber.createLargerEq)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.largerEq = largerEq;
+var leftShift = /* #__PURE__ */(0, _factoriesNumber.createLeftShift)({
+  typed: typed
+});
+exports.leftShift = leftShift;
+var log10 = /* #__PURE__ */(0, _factoriesNumber.createLog10)({
+  typed: typed
+});
+exports.log10 = log10;
+var log2 = /* #__PURE__ */(0, _factoriesNumber.createLog2)({
+  typed: typed
+});
+exports.log2 = log2;
+var map = /* #__PURE__ */(0, _factoriesNumber.createMap)({
+  typed: typed
+});
+exports.map = map;
+var mean = /* #__PURE__ */(0, _factoriesNumber.createMean)({
+  add: add,
+  divide: divide,
+  typed: typed
+});
+exports.mean = mean;
+var mod = /* #__PURE__ */(0, _factoriesNumber.createMod)({
+  typed: typed
+});
+exports.mod = mod;
+var multiply = /* #__PURE__ */(0, _factoriesNumber.createMultiply)({
+  typed: typed
+});
+exports.multiply = multiply;
+var not = /* #__PURE__ */(0, _factoriesNumber.createNot)({
+  typed: typed
+});
+exports.not = not;
+var number = /* #__PURE__ */(0, _factoriesNumber.createNumber)({
+  typed: typed
+});
+exports.number = number;
+var or = /* #__PURE__ */(0, _factoriesNumber.createOr)({
+  typed: typed
+});
+exports.or = or;
+var pi = /* #__PURE__ */(0, _factoriesNumber.createPi)({
+  config: _configReadonly.config
+});
+exports.pi = pi;
+var pow = /* #__PURE__ */(0, _factoriesNumber.createPow)({
+  typed: typed
+});
+exports.pow = pow;
+var random = /* #__PURE__ */(0, _factoriesNumber.createRandom)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.random = random;
+var rightLogShift = /* #__PURE__ */(0, _factoriesNumber.createRightLogShift)({
+  typed: typed
+});
+exports.rightLogShift = rightLogShift;
+var SQRT2 = /* #__PURE__ */(0, _factoriesNumber.createSQRT2)({
+  config: _configReadonly.config
+});
+exports.SQRT2 = SQRT2;
+var sech = /* #__PURE__ */(0, _factoriesNumber.createSech)({
+  typed: typed
+});
+exports.sech = sech;
+var sin = /* #__PURE__ */(0, _factoriesNumber.createSin)({
+  typed: typed
+});
+exports.sin = sin;
+var size = /* #__PURE__ */(0, _factoriesNumber.createSize)({
+  matrix: matrix,
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.size = size;
+var smallerEq = /* #__PURE__ */(0, _factoriesNumber.createSmallerEq)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.smallerEq = smallerEq;
+var square = /* #__PURE__ */(0, _factoriesNumber.createSquare)({
+  typed: typed
+});
+exports.square = square;
+var string = /* #__PURE__ */(0, _factoriesNumber.createString)({
+  typed: typed
+});
+exports.string = string;
+var subtract = /* #__PURE__ */(0, _factoriesNumber.createSubtract)({
+  typed: typed
+});
+exports.subtract = subtract;
+var tanh = /* #__PURE__ */(0, _factoriesNumber.createTanh)({
+  typed: typed
+});
+exports.tanh = tanh;
+var typeOf = /* #__PURE__ */(0, _factoriesNumber.createTypeOf)({
+  typed: typed
+});
+exports.typeOf = typeOf;
+var unequal = /* #__PURE__ */(0, _factoriesNumber.createUnequal)({
+  equalScalar: equalScalar,
+  typed: typed
+});
+exports.unequal = unequal;
+var xgcd = /* #__PURE__ */(0, _factoriesNumber.createXgcd)({
+  typed: typed
+});
+exports.xgcd = xgcd;
+var acoth = /* #__PURE__ */(0, _factoriesNumber.createAcoth)({
+  typed: typed
+});
+exports.acoth = acoth;
+var addScalar = /* #__PURE__ */(0, _factoriesNumber.createAddScalar)({
+  typed: typed
+});
+exports.addScalar = addScalar;
+var asech = /* #__PURE__ */(0, _factoriesNumber.createAsech)({
+  typed: typed
+});
+exports.asech = asech;
+var bitNot = /* #__PURE__ */(0, _factoriesNumber.createBitNot)({
+  typed: typed
+});
+exports.bitNot = bitNot;
+var ceil = /* #__PURE__ */(0, _factoriesNumber.createCeil)({
+  typed: typed
+});
+exports.ceil = ceil;
+var combinationsWithRep = /* #__PURE__ */(0, _factoriesNumber.createCombinationsWithRep)({
+  typed: typed
+});
+exports.combinationsWithRep = combinationsWithRep;
+var cosh = /* #__PURE__ */(0, _factoriesNumber.createCosh)({
+  typed: typed
+});
+exports.cosh = cosh;
+var csch = /* #__PURE__ */(0, _factoriesNumber.createCsch)({
+  typed: typed
+});
+exports.csch = csch;
+var divideScalar = /* #__PURE__ */(0, _factoriesNumber.createDivideScalar)({
+  typed: typed
+});
+exports.divideScalar = divideScalar;
+var equalText = /* #__PURE__ */(0, _factoriesNumber.createEqualText)({
+  compareText: compareText,
+  isZero: isZero,
+  typed: typed
+});
+exports.equalText = equalText;
+var expm1 = /* #__PURE__ */(0, _factoriesNumber.createExpm1)({
+  typed: typed
+});
+exports.expm1 = expm1;
+var isNumeric = /* #__PURE__ */(0, _factoriesNumber.createIsNumeric)({
+  typed: typed
+});
+exports.isNumeric = isNumeric;
+var LN2 = /* #__PURE__ */(0, _factoriesNumber.createLN2)({
+  config: _configReadonly.config
+});
+exports.LN2 = LN2;
+var lcm = /* #__PURE__ */(0, _factoriesNumber.createLcm)({
+  typed: typed
+});
+exports.lcm = lcm;
+var log1p = /* #__PURE__ */(0, _factoriesNumber.createLog1p)({
+  typed: typed
+});
+exports.log1p = log1p;
+var multiplyScalar = /* #__PURE__ */(0, _factoriesNumber.createMultiplyScalar)({
+  typed: typed
+});
+exports.multiplyScalar = multiplyScalar;
+var nthRoot = /* #__PURE__ */(0, _factoriesNumber.createNthRoot)({
+  typed: typed
+});
+exports.nthRoot = nthRoot;
+var pickRandom = /* #__PURE__ */(0, _factoriesNumber.createPickRandom)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.pickRandom = pickRandom;
+var randomInt = /* #__PURE__ */(0, _factoriesNumber.createRandomInt)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.randomInt = randomInt;
+var rightArithShift = /* #__PURE__ */(0, _factoriesNumber.createRightArithShift)({
+  typed: typed
+});
+exports.rightArithShift = rightArithShift;
+var sec = /* #__PURE__ */(0, _factoriesNumber.createSec)({
+  typed: typed
+});
+exports.sec = sec;
+var sinh = /* #__PURE__ */(0, _factoriesNumber.createSinh)({
+  typed: typed
+});
+exports.sinh = sinh;
+var sqrt = /* #__PURE__ */(0, _factoriesNumber.createSqrt)({
+  typed: typed
+});
+exports.sqrt = sqrt;
+var tan = /* #__PURE__ */(0, _factoriesNumber.createTan)({
+  typed: typed
+});
+exports.tan = tan;
+var unaryMinus = /* #__PURE__ */(0, _factoriesNumber.createUnaryMinus)({
+  typed: typed
+});
+exports.unaryMinus = unaryMinus;
+var acosh = /* #__PURE__ */(0, _factoriesNumber.createAcosh)({
+  typed: typed
+});
+exports.acosh = acosh;
+var apply = /* #__PURE__ */(0, _factoriesNumber.createApply)({
+  isInteger: isInteger,
+  typed: typed
+});
+exports.apply = apply;
+var asinh = /* #__PURE__ */(0, _factoriesNumber.createAsinh)({
+  typed: typed
+});
+exports.asinh = asinh;
+var bitXor = /* #__PURE__ */(0, _factoriesNumber.createBitXor)({
+  typed: typed
+});
+exports.bitXor = bitXor;
+var clone = /* #__PURE__ */(0, _factoriesNumber.createClone)({
+  typed: typed
+});
+exports.clone = clone;
+var cumsum = /* #__PURE__ */(0, _factoriesNumber.createCumSum)({
+  add: add,
+  typed: typed,
+  unaryPlus: unaryPlus
+});
+exports.cumsum = cumsum;
+var equal = /* #__PURE__ */(0, _factoriesNumber.createEqual)({
+  equalScalar: equalScalar,
+  typed: typed
+});
+exports.equal = equal;
+var factorial = /* #__PURE__ */(0, _factoriesNumber.createFactorial)({
+  gamma: gamma,
+  typed: typed
+});
+exports.factorial = factorial;
+var hasNumericValue = /* #__PURE__ */(0, _factoriesNumber.createHasNumericValue)({
+  isNumeric: isNumeric,
+  typed: typed
+});
+exports.hasNumericValue = hasNumericValue;
+var isNaN = /* #__PURE__ */(0, _factoriesNumber.createIsNaN)({
+  typed: typed
+});
+exports.isNaN = isNaN;
+var larger = /* #__PURE__ */(0, _factoriesNumber.createLarger)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.larger = larger;
+var mode = /* #__PURE__ */(0, _factoriesNumber.createMode)({
+  isNaN: isNaN,
+  isNumeric: isNumeric,
+  typed: typed
+});
+exports.mode = mode;
+var norm = /* #__PURE__ */(0, _factoriesNumber.createNorm)({
+  typed: typed
+});
+exports.norm = norm;
+var partitionSelect = /* #__PURE__ */(0, _factoriesNumber.createPartitionSelect)({
+  compare: compare,
+  isNaN: isNaN,
+  isNumeric: isNumeric,
+  typed: typed
+});
+exports.partitionSelect = partitionSelect;
+var print = /* #__PURE__ */(0, _factoriesNumber.createPrint)({
+  typed: typed
+});
+exports.print = print;
+var quantileSeq = /* #__PURE__ */(0, _factoriesNumber.createQuantileSeq)({
+  add: add,
+  compare: compare,
+  multiply: multiply,
+  partitionSelect: partitionSelect,
+  typed: typed
+});
+exports.quantileSeq = quantileSeq;
+var round = /* #__PURE__ */(0, _factoriesNumber.createRound)({
+  typed: typed
+});
+exports.round = round;
+var smaller = /* #__PURE__ */(0, _factoriesNumber.createSmaller)({
+  config: _configReadonly.config,
+  typed: typed
+});
+exports.smaller = smaller;
+var stirlingS2 = /* #__PURE__ */(0, _factoriesNumber.createStirlingS2)({
+  addScalar: addScalar,
+  combinations: combinations,
+  divideScalar: divideScalar,
+  factorial: factorial,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  larger: larger,
+  multiplyScalar: multiplyScalar,
+  number: number,
+  pow: pow,
+  subtract: subtract,
+  typed: typed
+});
+exports.stirlingS2 = stirlingS2;
+
+var _true = /* #__PURE__ */(0, _factoriesNumber.createTrue)({});
+
+exports._true = _true;
+var variance = /* #__PURE__ */(0, _factoriesNumber.createVariance)({
+  add: add,
+  apply: apply,
+  divide: divide,
+  isNaN: isNaN,
+  multiply: multiply,
+  subtract: subtract,
+  typed: typed
+});
+exports.variance = variance;
+var acsch = /* #__PURE__ */(0, _factoriesNumber.createAcsch)({
+  typed: typed
+});
+exports.acsch = acsch;
+var atan2 = /* #__PURE__ */(0, _factoriesNumber.createAtan2)({
+  typed: typed
+});
+exports.atan2 = atan2;
+var catalan = /* #__PURE__ */(0, _factoriesNumber.createCatalan)({
+  addScalar: addScalar,
+  combinations: combinations,
+  divideScalar: divideScalar,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  multiplyScalar: multiplyScalar,
+  typed: typed
+});
+exports.catalan = catalan;
+var composition = /* #__PURE__ */(0, _factoriesNumber.createComposition)({
+  addScalar: addScalar,
+  combinations: combinations,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  isPositive: isPositive,
+  larger: larger,
+  typed: typed
+});
+exports.composition = composition;
+var deepEqual = /* #__PURE__ */(0, _factoriesNumber.createDeepEqual)({
+  equal: equal,
+  typed: typed
+});
+exports.deepEqual = deepEqual;
+var floor = /* #__PURE__ */(0, _factoriesNumber.createFloor)({
+  typed: typed
+});
+exports.floor = floor;
+var hypot = /* #__PURE__ */(0, _factoriesNumber.createHypot)({
+  abs: abs,
+  addScalar: addScalar,
+  divideScalar: divideScalar,
+  isPositive: isPositive,
+  multiplyScalar: multiplyScalar,
+  smaller: smaller,
+  sqrt: sqrt,
+  typed: typed
+});
+exports.hypot = hypot;
+var log = /* #__PURE__ */(0, _factoriesNumber.createLog)({
+  typed: typed
+});
+exports.log = log;
+var median = /* #__PURE__ */(0, _factoriesNumber.createMedian)({
+  add: add,
+  compare: compare,
+  divide: divide,
+  partitionSelect: partitionSelect,
+  typed: typed
+});
+exports.median = median;
+var multinomial = /* #__PURE__ */(0, _factoriesNumber.createMultinomial)({
+  add: add,
+  divide: divide,
+  factorial: factorial,
+  isInteger: isInteger,
+  isPositive: isPositive,
+  multiply: multiply,
+  typed: typed
+});
+exports.multinomial = multinomial;
+var permutations = /* #__PURE__ */(0, _factoriesNumber.createPermutations)({
+  factorial: factorial,
+  typed: typed
+});
+exports.permutations = permutations;
+var range = /* #__PURE__ */(0, _factoriesNumber.createRange)({
+  matrix: matrix,
+  config: _configReadonly.config,
+  larger: larger,
+  largerEq: largerEq,
+  smaller: smaller,
+  smallerEq: smallerEq,
+  typed: typed
+});
+exports.range = range;
+var sign = /* #__PURE__ */(0, _factoriesNumber.createSign)({
+  typed: typed
+});
+exports.sign = sign;
+var std = /* #__PURE__ */(0, _factoriesNumber.createStd)({
+  sqrt: sqrt,
+  typed: typed,
+  variance: variance
+});
+exports.std = std;
+var compareNatural = /* #__PURE__ */(0, _factoriesNumber.createCompareNatural)({
+  compare: compare,
+  typed: typed
+});
+exports.compareNatural = compareNatural;
+var coth = /* #__PURE__ */(0, _factoriesNumber.createCoth)({
+  typed: typed
+});
+exports.coth = coth;
+var gcd = /* #__PURE__ */(0, _factoriesNumber.createGcd)({
+  typed: typed
+});
+exports.gcd = gcd;
+var isPrime = /* #__PURE__ */(0, _factoriesNumber.createIsPrime)({
+  typed: typed
+});
+exports.isPrime = isPrime;
+var numeric = /* #__PURE__ */(0, _factoriesNumber.createNumeric)({
+  number: number
+});
+exports.numeric = numeric;
+var prod = /* #__PURE__ */(0, _factoriesNumber.createProd)({
+  config: _configReadonly.config,
+  multiplyScalar: multiplyScalar,
+  numeric: numeric,
+  typed: typed
+});
+exports.prod = prod;
+var sum = /* #__PURE__ */(0, _factoriesNumber.createSum)({
+  add: add,
+  config: _configReadonly.config,
+  numeric: numeric,
+  typed: typed
+});
+exports.sum = sum;
+var bellNumbers = /* #__PURE__ */(0, _factoriesNumber.createBellNumbers)({
+  addScalar: addScalar,
+  isInteger: isInteger,
+  isNegative: isNegative,
+  stirlingS2: stirlingS2,
+  typed: typed
+});
+exports.bellNumbers = bellNumbers;
+var mad = /* #__PURE__ */(0, _factoriesNumber.createMad)({
+  abs: abs,
+  map: map,
+  median: median,
+  subtract: subtract,
+  typed: typed
+});
+exports.mad = mad;
+var max = /* #__PURE__ */(0, _factoriesNumber.createMax)({
+  config: _configReadonly.config,
+  larger: larger,
+  numeric: numeric,
+  typed: typed
+});
+exports.max = max;
+var min = /* #__PURE__ */(0, _factoriesNumber.createMin)({
+  config: _configReadonly.config,
+  numeric: numeric,
+  smaller: smaller,
+  typed: typed
+});
+exports.min = min;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/typeChecks.js b/node_modules/mathjs/lib/cjs/entry/typeChecks.js
new file mode 100644
index 0000000..36f2e31
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/typeChecks.js
@@ -0,0 +1,235 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "isAccessorNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isAccessorNode;
+  }
+});
+Object.defineProperty(exports, "isArray", {
+  enumerable: true,
+  get: function get() {
+    return _is.isArray;
+  }
+});
+Object.defineProperty(exports, "isArrayNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isArrayNode;
+  }
+});
+Object.defineProperty(exports, "isAssignmentNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "isBigNumber", {
+  enumerable: true,
+  get: function get() {
+    return _is.isBigNumber;
+  }
+});
+Object.defineProperty(exports, "isBlockNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isBlockNode;
+  }
+});
+Object.defineProperty(exports, "isBoolean", {
+  enumerable: true,
+  get: function get() {
+    return _is.isBoolean;
+  }
+});
+Object.defineProperty(exports, "isChain", {
+  enumerable: true,
+  get: function get() {
+    return _is.isChain;
+  }
+});
+Object.defineProperty(exports, "isCollection", {
+  enumerable: true,
+  get: function get() {
+    return _is.isCollection;
+  }
+});
+Object.defineProperty(exports, "isComplex", {
+  enumerable: true,
+  get: function get() {
+    return _is.isComplex;
+  }
+});
+Object.defineProperty(exports, "isConditionalNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isConditionalNode;
+  }
+});
+Object.defineProperty(exports, "isConstantNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isConstantNode;
+  }
+});
+Object.defineProperty(exports, "isDate", {
+  enumerable: true,
+  get: function get() {
+    return _is.isDate;
+  }
+});
+Object.defineProperty(exports, "isDenseMatrix", {
+  enumerable: true,
+  get: function get() {
+    return _is.isDenseMatrix;
+  }
+});
+Object.defineProperty(exports, "isFraction", {
+  enumerable: true,
+  get: function get() {
+    return _is.isFraction;
+  }
+});
+Object.defineProperty(exports, "isFunction", {
+  enumerable: true,
+  get: function get() {
+    return _is.isFunction;
+  }
+});
+Object.defineProperty(exports, "isFunctionAssignmentNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isFunctionAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "isFunctionNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isFunctionNode;
+  }
+});
+Object.defineProperty(exports, "isHelp", {
+  enumerable: true,
+  get: function get() {
+    return _is.isHelp;
+  }
+});
+Object.defineProperty(exports, "isIndex", {
+  enumerable: true,
+  get: function get() {
+    return _is.isIndex;
+  }
+});
+Object.defineProperty(exports, "isIndexNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isIndexNode;
+  }
+});
+Object.defineProperty(exports, "isMatrix", {
+  enumerable: true,
+  get: function get() {
+    return _is.isMatrix;
+  }
+});
+Object.defineProperty(exports, "isNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isNode;
+  }
+});
+Object.defineProperty(exports, "isNull", {
+  enumerable: true,
+  get: function get() {
+    return _is.isNull;
+  }
+});
+Object.defineProperty(exports, "isNumber", {
+  enumerable: true,
+  get: function get() {
+    return _is.isNumber;
+  }
+});
+Object.defineProperty(exports, "isObject", {
+  enumerable: true,
+  get: function get() {
+    return _is.isObject;
+  }
+});
+Object.defineProperty(exports, "isObjectNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isObjectNode;
+  }
+});
+Object.defineProperty(exports, "isOperatorNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isOperatorNode;
+  }
+});
+Object.defineProperty(exports, "isParenthesisNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isParenthesisNode;
+  }
+});
+Object.defineProperty(exports, "isRange", {
+  enumerable: true,
+  get: function get() {
+    return _is.isRange;
+  }
+});
+Object.defineProperty(exports, "isRangeNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isRangeNode;
+  }
+});
+Object.defineProperty(exports, "isRegExp", {
+  enumerable: true,
+  get: function get() {
+    return _is.isRegExp;
+  }
+});
+Object.defineProperty(exports, "isResultSet", {
+  enumerable: true,
+  get: function get() {
+    return _is.isResultSet;
+  }
+});
+Object.defineProperty(exports, "isSparseMatrix", {
+  enumerable: true,
+  get: function get() {
+    return _is.isSparseMatrix;
+  }
+});
+Object.defineProperty(exports, "isString", {
+  enumerable: true,
+  get: function get() {
+    return _is.isString;
+  }
+});
+Object.defineProperty(exports, "isSymbolNode", {
+  enumerable: true,
+  get: function get() {
+    return _is.isSymbolNode;
+  }
+});
+Object.defineProperty(exports, "isUndefined", {
+  enumerable: true,
+  get: function get() {
+    return _is.isUndefined;
+  }
+});
+Object.defineProperty(exports, "isUnit", {
+  enumerable: true,
+  get: function get() {
+    return _is.isUnit;
+  }
+});
+
+var _is = require("../utils/is.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/error/ArgumentsError.js b/node_modules/mathjs/lib/cjs/error/ArgumentsError.js
new file mode 100644
index 0000000..1fed305
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/error/ArgumentsError.js
@@ -0,0 +1,33 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ArgumentsError = ArgumentsError;
+
+/**
+ * Create a syntax error with the message:
+ *     'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'
+ * @param {string} fn     Function name
+ * @param {number} count  Actual argument count
+ * @param {number} min    Minimum required argument count
+ * @param {number} [max]  Maximum required argument count
+ * @extends Error
+ */
+function ArgumentsError(fn, count, min, max) {
+  if (!(this instanceof ArgumentsError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+
+  this.fn = fn;
+  this.count = count;
+  this.min = min;
+  this.max = max;
+  this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';
+  this.stack = new Error().stack;
+}
+
+ArgumentsError.prototype = new Error();
+ArgumentsError.prototype.constructor = Error;
+ArgumentsError.prototype.name = 'ArgumentsError';
+ArgumentsError.prototype.isArgumentsError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/error/DimensionError.js b/node_modules/mathjs/lib/cjs/error/DimensionError.js
new file mode 100644
index 0000000..9c4d2df
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/error/DimensionError.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.DimensionError = DimensionError;
+
+/**
+ * Create a range error with the message:
+ *     'Dimension mismatch (<actual size> != <expected size>)'
+ * @param {number | number[]} actual        The actual size
+ * @param {number | number[]} expected      The expected size
+ * @param {string} [relation='!=']          Optional relation between actual
+ *                                          and expected size: '!=', '<', etc.
+ * @extends RangeError
+ */
+function DimensionError(actual, expected, relation) {
+  if (!(this instanceof DimensionError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+
+  this.actual = actual;
+  this.expected = expected;
+  this.relation = relation;
+  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';
+  this.stack = new Error().stack;
+}
+
+DimensionError.prototype = new RangeError();
+DimensionError.prototype.constructor = RangeError;
+DimensionError.prototype.name = 'DimensionError';
+DimensionError.prototype.isDimensionError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/error/IndexError.js b/node_modules/mathjs/lib/cjs/error/IndexError.js
new file mode 100644
index 0000000..5f1a439
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/error/IndexError.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexError = IndexError;
+
+/**
+ * Create a range error with the message:
+ *     'Index out of range (index < min)'
+ *     'Index out of range (index < max)'
+ *
+ * @param {number} index     The actual index
+ * @param {number} [min=0]   Minimum index (included)
+ * @param {number} [max]     Maximum index (excluded)
+ * @extends RangeError
+ */
+function IndexError(index, min, max) {
+  if (!(this instanceof IndexError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+
+  this.index = index;
+
+  if (arguments.length < 3) {
+    this.min = 0;
+    this.max = min;
+  } else {
+    this.min = min;
+    this.max = max;
+  }
+
+  if (this.min !== undefined && this.index < this.min) {
+    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';
+  } else if (this.max !== undefined && this.index >= this.max) {
+    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';
+  } else {
+    this.message = 'Index out of range (' + this.index + ')';
+  }
+
+  this.stack = new Error().stack;
+}
+
+IndexError.prototype = new RangeError();
+IndexError.prototype.constructor = RangeError;
+IndexError.prototype.name = 'IndexError';
+IndexError.prototype.isIndexError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/Help.js b/node_modules/mathjs/lib/cjs/expression/Help.js
new file mode 100644
index 0000000..fb2438b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/Help.js
@@ -0,0 +1,145 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHelpClass = void 0;
+
+var _is = require("../utils/is.js");
+
+var _object = require("../utils/object.js");
+
+var _string = require("../utils/string.js");
+
+var _factory = require("../utils/factory.js");
+
+var name = 'Help';
+var dependencies = ['parse'];
+var createHelpClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var parse = _ref.parse;
+
+  /**
+   * Documentation object
+   * @param {Object} doc  Object containing properties:
+   *                      {string} name
+   *                      {string} category
+   *                      {string} description
+   *                      {string[]} syntax
+   *                      {string[]} examples
+   *                      {string[]} seealso
+   * @constructor
+   */
+  function Help(doc) {
+    if (!(this instanceof Help)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!doc) throw new Error('Argument "doc" missing');
+    this.doc = doc;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Help.prototype.type = 'Help';
+  Help.prototype.isHelp = true;
+  /**
+   * Generate a string representation of the Help object
+   * @return {string} Returns a string
+   * @private
+   */
+
+  Help.prototype.toString = function () {
+    var doc = this.doc || {};
+    var desc = '\n';
+
+    if (doc.name) {
+      desc += 'Name: ' + doc.name + '\n\n';
+    }
+
+    if (doc.category) {
+      desc += 'Category: ' + doc.category + '\n\n';
+    }
+
+    if (doc.description) {
+      desc += 'Description:\n    ' + doc.description + '\n\n';
+    }
+
+    if (doc.syntax) {
+      desc += 'Syntax:\n    ' + doc.syntax.join('\n    ') + '\n\n';
+    }
+
+    if (doc.examples) {
+      desc += 'Examples:\n';
+      var scope = {};
+
+      for (var i = 0; i < doc.examples.length; i++) {
+        var expr = doc.examples[i];
+        desc += '    ' + expr + '\n';
+        var res = void 0;
+
+        try {
+          // note: res can be undefined when `expr` is an empty string
+          res = parse(expr).compile().evaluate(scope);
+        } catch (e) {
+          res = e;
+        }
+
+        if (res !== undefined && !(0, _is.isHelp)(res)) {
+          desc += '        ' + (0, _string.format)(res, {
+            precision: 14
+          }) + '\n';
+        }
+      }
+
+      desc += '\n';
+    }
+
+    if (doc.mayThrow && doc.mayThrow.length) {
+      desc += 'Throws: ' + doc.mayThrow.join(', ') + '\n\n';
+    }
+
+    if (doc.seealso && doc.seealso.length) {
+      desc += 'See also: ' + doc.seealso.join(', ') + '\n';
+    }
+
+    return desc;
+  };
+  /**
+   * Export the help object to JSON
+   */
+
+
+  Help.prototype.toJSON = function () {
+    var obj = (0, _object.clone)(this.doc);
+    obj.mathjs = 'Help';
+    return obj;
+  };
+  /**
+   * Instantiate a Help object from a JSON object
+   * @param {Object} json
+   * @returns {Help} Returns a new Help object
+   */
+
+
+  Help.fromJSON = function (json) {
+    var doc = {};
+    Object.keys(json).filter(function (prop) {
+      return prop !== 'mathjs';
+    }).forEach(function (prop) {
+      doc[prop] = json[prop];
+    });
+    return new Help(doc);
+  };
+  /**
+   * Returns a string representation of the Help object
+   */
+
+
+  Help.prototype.valueOf = Help.prototype.toString;
+  return Help;
+}, {
+  isClass: true
+});
+exports.createHelpClass = createHelpClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/Parser.js b/node_modules/mathjs/lib/cjs/expression/Parser.js
new file mode 100644
index 0000000..09890d0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/Parser.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParserClass = void 0;
+
+var _factory = require("../utils/factory.js");
+
+var _map = require("../utils/map.js");
+
+var name = 'Parser';
+var dependencies = ['evaluate'];
+var createParserClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var evaluate = _ref.evaluate;
+
+  /**
+   * @constructor Parser
+   * Parser contains methods to evaluate or parse expressions, and has a number
+   * of convenience methods to get, set, and remove variables from memory. Parser
+   * keeps a scope containing variables in memory, which is used for all
+   * evaluations.
+   *
+   * Methods:
+   *    const result = parser.evaluate(expr)  // evaluate an expression
+   *    const value = parser.get(name)        // retrieve a variable from the parser
+   *    const values = parser.getAll()        // retrieve all defined variables
+   *    parser.set(name, value)               // set a variable in the parser
+   *    parser.remove(name)                   // clear a variable from the
+   *                                          // parsers scope
+   *    parser.clear()                        // clear the parsers scope
+   *
+   * Example usage:
+   *    const parser = new Parser()
+   *    // Note: there is a convenience method which can be used instead:
+   *    // const parser = new math.parser()
+   *
+   *    // evaluate expressions
+   *    parser.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *    parser.evaluate('sqrt(-4)')               // 2i
+   *    parser.evaluate('2 inch in cm')           // 5.08 cm
+   *    parser.evaluate('cos(45 deg)')            // 0.7071067811865476
+   *
+   *    // define variables and functions
+   *    parser.evaluate('x = 7 / 2')              // 3.5
+   *    parser.evaluate('x + 3')                  // 6.5
+   *    parser.evaluate('f(x, y) = x^y')          // f(x, y)
+   *    parser.evaluate('f(2, 3)')                // 8
+   *
+   *    // get and set variables and functions
+   *    const x = parser.get('x')                 // 7
+   *    const f = parser.get('f')                 // function
+   *    const g = f(3, 2)                         // 9
+   *    parser.set('h', 500)
+   *    const i = parser.evaluate('h / 2')        // 250
+   *    parser.set('hello', function (name) {
+   *        return 'hello, ' + name + '!'
+   *    })
+   *    parser.evaluate('hello("user")')          // "hello, user!"
+   *
+   *    // clear defined functions and variables
+   *    parser.clear()
+   *
+   */
+  function Parser() {
+    if (!(this instanceof Parser)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    Object.defineProperty(this, 'scope', {
+      value: (0, _map.createEmptyMap)(),
+      writable: false
+    });
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Parser.prototype.type = 'Parser';
+  Parser.prototype.isParser = true;
+  /**
+   * Parse and evaluate the given expression
+   * @param {string | string[]} expr   A string containing an expression,
+   *                                   for example "2+3", or a list with expressions
+   * @return {*} result     The result, or undefined when the expression was empty
+   * @throws {Error}
+   */
+
+  Parser.prototype.evaluate = function (expr) {
+    // TODO: validate arguments
+    return evaluate(expr, this.scope);
+  };
+  /**
+   * Get a variable (a function or variable) by name from the parsers scope.
+   * Returns undefined when not found
+   * @param {string} name
+   * @return {* | undefined} value
+   */
+
+
+  Parser.prototype.get = function (name) {
+    // TODO: validate arguments
+    if (this.scope.has(name)) {
+      return this.scope.get(name);
+    }
+  };
+  /**
+   * Get a map with all defined variables
+   * @return {Object} values
+   */
+
+
+  Parser.prototype.getAll = function () {
+    return (0, _map.toObject)(this.scope);
+  };
+  /**
+   * Get a map with all defined variables
+   * @return {Map} values
+   */
+
+
+  Parser.prototype.getAllAsMap = function () {
+    return this.scope;
+  };
+  /**
+   * Set a symbol (a function or variable) by name from the parsers scope.
+   * @param {string} name
+   * @param {* | undefined} value
+   */
+
+
+  Parser.prototype.set = function (name, value) {
+    this.scope.set(name, value);
+    return value;
+  };
+  /**
+   * Remove a variable from the parsers scope
+   * @param {string} name
+   */
+
+
+  Parser.prototype.remove = function (name) {
+    this.scope.delete(name);
+  };
+  /**
+   * Clear the scope with variables and functions
+   */
+
+
+  Parser.prototype.clear = function () {
+    this.scope.clear();
+  };
+
+  return Parser;
+}, {
+  isClass: true
+});
+exports.createParserClass = createParserClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/Infinity.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/Infinity.js
new file mode 100644
index 0000000..7f8f457
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/Infinity.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.InfinityDocs = void 0;
+var InfinityDocs = {
+  name: 'Infinity',
+  category: 'Constants',
+  syntax: ['Infinity'],
+  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',
+  examples: ['Infinity', '1 / 0'],
+  seealso: []
+};
+exports.InfinityDocs = InfinityDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN10.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN10.js
new file mode 100644
index 0000000..4645796
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN10.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN10Docs = void 0;
+var LN10Docs = {
+  name: 'LN10',
+  category: 'Constants',
+  syntax: ['LN10'],
+  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',
+  examples: ['LN10', 'log(10)'],
+  seealso: []
+};
+exports.LN10Docs = LN10Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN2.js
new file mode 100644
index 0000000..d14b4de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN2.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN2Docs = void 0;
+var LN2Docs = {
+  name: 'LN2',
+  category: 'Constants',
+  syntax: ['LN2'],
+  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',
+  examples: ['LN2', 'log(2)'],
+  seealso: []
+};
+exports.LN2Docs = LN2Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG10E.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG10E.js
new file mode 100644
index 0000000..6e425bb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG10E.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG10EDocs = void 0;
+var LOG10EDocs = {
+  name: 'LOG10E',
+  category: 'Constants',
+  syntax: ['LOG10E'],
+  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',
+  examples: ['LOG10E', 'log(e, 10)'],
+  seealso: []
+};
+exports.LOG10EDocs = LOG10EDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG2E.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG2E.js
new file mode 100644
index 0000000..210abdc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG2E.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG2EDocs = void 0;
+var LOG2EDocs = {
+  name: 'LOG2E',
+  category: 'Constants',
+  syntax: ['LOG2E'],
+  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',
+  examples: ['LOG2E', 'log(e, 2)'],
+  seealso: []
+};
+exports.LOG2EDocs = LOG2EDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/NaN.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/NaN.js
new file mode 100644
index 0000000..f6d2bb6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/NaN.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NaNDocs = void 0;
+var NaNDocs = {
+  name: 'NaN',
+  category: 'Constants',
+  syntax: ['NaN'],
+  description: 'Not a number',
+  examples: ['NaN', '0 / 0'],
+  seealso: []
+};
+exports.NaNDocs = NaNDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT1_2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT1_2.js
new file mode 100644
index 0000000..f143022
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT1_2.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT12Docs = void 0;
+var SQRT12Docs = {
+  name: 'SQRT1_2',
+  category: 'Constants',
+  syntax: ['SQRT1_2'],
+  description: 'Returns the square root of 1/2, approximately equal to 0.707',
+  examples: ['SQRT1_2', 'sqrt(1/2)'],
+  seealso: []
+};
+exports.SQRT12Docs = SQRT12Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT2.js
new file mode 100644
index 0000000..7991e6e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT2.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT2Docs = void 0;
+var SQRT2Docs = {
+  name: 'SQRT2',
+  category: 'Constants',
+  syntax: ['SQRT2'],
+  description: 'Returns the square root of 2, approximately equal to 1.414',
+  examples: ['SQRT2', 'sqrt(2)'],
+  seealso: []
+};
+exports.SQRT2Docs = SQRT2Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/e.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/e.js
new file mode 100644
index 0000000..ef5cc6a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/e.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eDocs = void 0;
+var eDocs = {
+  name: 'e',
+  category: 'Constants',
+  syntax: ['e'],
+  description: 'Euler\'s number, the base of the natural logarithm. Approximately equal to 2.71828',
+  examples: ['e', 'e ^ 2', 'exp(2)', 'log(e)'],
+  seealso: ['exp']
+};
+exports.eDocs = eDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/false.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/false.js
new file mode 100644
index 0000000..8541a99
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/false.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.falseDocs = void 0;
+var falseDocs = {
+  name: 'false',
+  category: 'Constants',
+  syntax: ['false'],
+  description: 'Boolean value false',
+  examples: ['false'],
+  seealso: ['true']
+};
+exports.falseDocs = falseDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/i.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/i.js
new file mode 100644
index 0000000..73adf64
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/i.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.iDocs = void 0;
+var iDocs = {
+  name: 'i',
+  category: 'Constants',
+  syntax: ['i'],
+  description: 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',
+  examples: ['i', 'i * i', 'sqrt(-1)'],
+  seealso: []
+};
+exports.iDocs = iDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/null.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/null.js
new file mode 100644
index 0000000..93587ee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/null.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullDocs = void 0;
+var nullDocs = {
+  name: 'null',
+  category: 'Constants',
+  syntax: ['null'],
+  description: 'Value null',
+  examples: ['null'],
+  seealso: ['true', 'false']
+};
+exports.nullDocs = nullDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/phi.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/phi.js
new file mode 100644
index 0000000..c516727
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/phi.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.phiDocs = void 0;
+var phiDocs = {
+  name: 'phi',
+  category: 'Constants',
+  syntax: ['phi'],
+  description: 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',
+  examples: ['phi'],
+  seealso: []
+};
+exports.phiDocs = phiDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/pi.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/pi.js
new file mode 100644
index 0000000..47019e8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/pi.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.piDocs = void 0;
+var piDocs = {
+  name: 'pi',
+  category: 'Constants',
+  syntax: ['pi'],
+  description: 'The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter, and is approximately equal to 3.14159',
+  examples: ['pi', 'sin(pi/2)'],
+  seealso: ['tau']
+};
+exports.piDocs = piDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/tau.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/tau.js
new file mode 100644
index 0000000..d779805
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/tau.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tauDocs = void 0;
+var tauDocs = {
+  name: 'tau',
+  category: 'Constants',
+  syntax: ['tau'],
+  description: 'Tau is the ratio constant of a circle\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',
+  examples: ['tau', '2 * pi'],
+  seealso: ['pi']
+};
+exports.tauDocs = tauDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/true.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/true.js
new file mode 100644
index 0000000..96e9b9a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/true.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.trueDocs = void 0;
+var trueDocs = {
+  name: 'true',
+  category: 'Constants',
+  syntax: ['true'],
+  description: 'Boolean value true',
+  examples: ['true'],
+  seealso: ['false']
+};
+exports.trueDocs = trueDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/version.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/version.js
new file mode 100644
index 0000000..1b72718
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/version.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.versionDocs = void 0;
+var versionDocs = {
+  name: 'version',
+  category: 'Constants',
+  syntax: ['version'],
+  description: 'A string with the version number of math.js',
+  examples: ['version'],
+  seealso: []
+};
+exports.versionDocs = versionDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bignumber.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bignumber.js
new file mode 100644
index 0000000..f7b229a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bignumber.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bignumberDocs = void 0;
+var bignumberDocs = {
+  name: 'bignumber',
+  category: 'Construction',
+  syntax: ['bignumber(x)'],
+  description: 'Create a big number from a number or string.',
+  examples: ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber("7.2")', 'bignumber("7.2e500")', 'bignumber([0.1, 0.2, 0.3])'],
+  seealso: ['boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
+exports.bignumberDocs = bignumberDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/boolean.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/boolean.js
new file mode 100644
index 0000000..6f984ad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/boolean.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.booleanDocs = void 0;
+var booleanDocs = {
+  name: 'boolean',
+  category: 'Construction',
+  syntax: ['x', 'boolean(x)'],
+  description: 'Convert a string or number into a boolean.',
+  examples: ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean("true")', 'boolean("false")', 'boolean([1, 0, 1, 1])'],
+  seealso: ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']
+};
+exports.booleanDocs = booleanDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/complex.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/complex.js
new file mode 100644
index 0000000..2e13606
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/complex.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.complexDocs = void 0;
+var complexDocs = {
+  name: 'complex',
+  category: 'Construction',
+  syntax: ['complex()', 'complex(re, im)', 'complex(string)'],
+  description: 'Create a complex number.',
+  examples: ['complex()', 'complex(2, 3)', 'complex("7 - 2i")'],
+  seealso: ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']
+};
+exports.complexDocs = complexDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/createUnit.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/createUnit.js
new file mode 100644
index 0000000..bdf4404
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/createUnit.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitDocs = void 0;
+var createUnitDocs = {
+  name: 'createUnit',
+  category: 'Construction',
+  syntax: ['createUnit(definitions)', 'createUnit(name, definition)'],
+  description: 'Create a user-defined unit and register it with the Unit type.',
+  examples: ['createUnit("foo")', 'createUnit("knot", {definition: "0.514444444 m/s", aliases: ["knots", "kt", "kts"]})', 'createUnit("mph", "1 mile/hour")'],
+  seealso: ['unit', 'splitUnit']
+};
+exports.createUnitDocs = createUnitDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/fraction.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/fraction.js
new file mode 100644
index 0000000..42ce030
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/fraction.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fractionDocs = void 0;
+var fractionDocs = {
+  name: 'fraction',
+  category: 'Construction',
+  syntax: ['fraction(num)', 'fraction(matrix)', 'fraction(num,den)', 'fraction({n: num, d: den})'],
+  description: 'Create a fraction from a number or from integer numerator and denominator.',
+  examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)', 'fraction({n: 333, d: 53})', 'fraction([sqrt(9), sqrt(10), sqrt(11)])'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']
+};
+exports.fractionDocs = fractionDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/index.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/index.js
new file mode 100644
index 0000000..bd3e5fe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/index.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexDocs = void 0;
+var indexDocs = {
+  name: 'index',
+  category: 'Construction',
+  syntax: ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],
+  description: 'Create an index to get or replace a subset of a matrix',
+  examples: ['[]', '[1, 2, 3]', 'A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[0:2, 0:2] = ones(2, 2)'],
+  seealso: ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']
+};
+exports.indexDocs = indexDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/matrix.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/matrix.js
new file mode 100644
index 0000000..2157d4e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/matrix.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixDocs = void 0;
+var matrixDocs = {
+  name: 'matrix',
+  category: 'Construction',
+  syntax: ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix("dense")', 'matrix([...])'],
+  description: 'Create a matrix.',
+  examples: ['[]', '[1, 2, 3]', '[1, 2, 3; 4, 5, 6]', 'matrix()', 'matrix([3, 4])', 'matrix([3, 4; 5, 6], "sparse")', 'matrix([3, 4; 5, 6], "sparse", "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']
+};
+exports.matrixDocs = matrixDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/number.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/number.js
new file mode 100644
index 0000000..fb0c899
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/number.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numberDocs = void 0;
+var numberDocs = {
+  name: 'number',
+  category: 'Construction',
+  syntax: ['x', 'number(x)', 'number(unit, valuelessUnit)'],
+  description: 'Create a number or convert a string or boolean into a number.',
+  examples: ['2', '2e3', '4.05', 'number(2)', 'number("7.2")', 'number(true)', 'number([true, false, true, true])', 'number(unit("52cm"), "m")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
+exports.numberDocs = numberDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/sparse.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/sparse.js
new file mode 100644
index 0000000..1a187d3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/sparse.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sparseDocs = void 0;
+var sparseDocs = {
+  name: 'sparse',
+  category: 'Construction',
+  syntax: ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], "number")'],
+  description: 'Create a sparse matrix.',
+  examples: ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']
+};
+exports.sparseDocs = sparseDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/splitUnit.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/splitUnit.js
new file mode 100644
index 0000000..fa08ee6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/splitUnit.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.splitUnitDocs = void 0;
+var splitUnitDocs = {
+  name: 'splitUnit',
+  category: 'Construction',
+  syntax: ['splitUnit(unit: Unit, parts: Unit[])'],
+  description: 'Split a unit in an array of units whose sum is equal to the original unit.',
+  examples: ['splitUnit(1 m, ["feet", "inch"])'],
+  seealso: ['unit', 'createUnit']
+};
+exports.splitUnitDocs = splitUnitDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/string.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/string.js
new file mode 100644
index 0000000..e8f8d87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/string.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stringDocs = void 0;
+var stringDocs = {
+  name: 'string',
+  category: 'Construction',
+  syntax: ['"text"', 'string(x)'],
+  description: 'Create a string or convert a value to a string',
+  examples: ['"Hello World!"', 'string(4.2)', 'string(3 + 2i)'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']
+};
+exports.stringDocs = stringDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/unit.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/unit.js
new file mode 100644
index 0000000..74a7a5e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/unit.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unitDocs = void 0;
+var unitDocs = {
+  name: 'unit',
+  category: 'Construction',
+  syntax: ['value unit', 'unit(value, unit)', 'unit(string)'],
+  description: 'Create a unit.',
+  examples: ['5.5 mm', '3 inch', 'unit(7.1, "kilogram")', 'unit("23 deg")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']
+};
+exports.unitDocs = unitDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/config.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/config.js
new file mode 100644
index 0000000..91d028a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/config.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.configDocs = void 0;
+var configDocs = {
+  name: 'config',
+  category: 'Core',
+  syntax: ['config()', 'config(options)'],
+  description: 'Get configuration or change configuration.',
+  examples: ['config()', '1/3 + 1/4', 'config({number: "Fraction"})', '1/3 + 1/4'],
+  seealso: []
+};
+exports.configDocs = configDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/import.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/import.js
new file mode 100644
index 0000000..06b8855
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/import.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.importDocs = void 0;
+var importDocs = {
+  name: 'import',
+  category: 'Core',
+  syntax: ['import(functions)', 'import(functions, options)'],
+  description: 'Import functions or constants from an object.',
+  examples: ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],
+  seealso: []
+};
+exports.importDocs = importDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/typed.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/typed.js
new file mode 100644
index 0000000..76d0e1a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/typed.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typedDocs = void 0;
+var typedDocs = {
+  name: 'typed',
+  category: 'Core',
+  syntax: ['typed(signatures)', 'typed(name, signatures)'],
+  description: 'Create a typed function.',
+  examples: ['double = typed({ "number": f(x)=x+x })', 'double(2)', 'double("hello")'],
+  seealso: []
+};
+exports.typedDocs = typedDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/embeddedDocs.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/embeddedDocs.js
new file mode 100644
index 0000000..0360d6f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/embeddedDocs.js
@@ -0,0 +1,924 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.embeddedDocs = void 0;
+
+var _e = require("./constants/e.js");
+
+var _false = require("./constants/false.js");
+
+var _i = require("./constants/i.js");
+
+var _Infinity = require("./constants/Infinity.js");
+
+var _LN = require("./constants/LN10.js");
+
+var _LN2 = require("./constants/LN2.js");
+
+var _LOG10E = require("./constants/LOG10E.js");
+
+var _LOG2E = require("./constants/LOG2E.js");
+
+var _NaN = require("./constants/NaN.js");
+
+var _null = require("./constants/null.js");
+
+var _phi = require("./constants/phi.js");
+
+var _pi = require("./constants/pi.js");
+
+var _SQRT1_ = require("./constants/SQRT1_2.js");
+
+var _SQRT = require("./constants/SQRT2.js");
+
+var _tau = require("./constants/tau.js");
+
+var _true = require("./constants/true.js");
+
+var _version = require("./constants/version.js");
+
+var _bignumber = require("./construction/bignumber.js");
+
+var _boolean = require("./construction/boolean.js");
+
+var _complex = require("./construction/complex.js");
+
+var _createUnit = require("./construction/createUnit.js");
+
+var _fraction = require("./construction/fraction.js");
+
+var _index = require("./construction/index.js");
+
+var _matrix = require("./construction/matrix.js");
+
+var _number = require("./construction/number.js");
+
+var _sparse = require("./construction/sparse.js");
+
+var _splitUnit = require("./construction/splitUnit.js");
+
+var _string = require("./construction/string.js");
+
+var _unit = require("./construction/unit.js");
+
+var _config = require("./core/config.js");
+
+var _import = require("./core/import.js");
+
+var _typed = require("./core/typed.js");
+
+var _derivative = require("./function/algebra/derivative.js");
+
+var _leafCount = require("./function/algebra/leafCount.js");
+
+var _lsolve = require("./function/algebra/lsolve.js");
+
+var _lsolveAll = require("./function/algebra/lsolveAll.js");
+
+var _lup = require("./function/algebra/lup.js");
+
+var _lusolve = require("./function/algebra/lusolve.js");
+
+var _qr = require("./function/algebra/qr.js");
+
+var _rationalize = require("./function/algebra/rationalize.js");
+
+var _resolve = require("./function/algebra/resolve.js");
+
+var _simplify = require("./function/algebra/simplify.js");
+
+var _simplifyCore = require("./function/algebra/simplifyCore.js");
+
+var _slu = require("./function/algebra/slu.js");
+
+var _symbolicEqual = require("./function/algebra/symbolicEqual.js");
+
+var _usolve = require("./function/algebra/usolve.js");
+
+var _usolveAll = require("./function/algebra/usolveAll.js");
+
+var _abs = require("./function/arithmetic/abs.js");
+
+var _add = require("./function/arithmetic/add.js");
+
+var _cbrt = require("./function/arithmetic/cbrt.js");
+
+var _ceil = require("./function/arithmetic/ceil.js");
+
+var _cube = require("./function/arithmetic/cube.js");
+
+var _divide = require("./function/arithmetic/divide.js");
+
+var _dotDivide = require("./function/arithmetic/dotDivide.js");
+
+var _dotMultiply = require("./function/arithmetic/dotMultiply.js");
+
+var _dotPow = require("./function/arithmetic/dotPow.js");
+
+var _exp = require("./function/arithmetic/exp.js");
+
+var _expm = require("./function/arithmetic/expm.js");
+
+var _expm2 = require("./function/arithmetic/expm1.js");
+
+var _fix = require("./function/arithmetic/fix.js");
+
+var _floor = require("./function/arithmetic/floor.js");
+
+var _gcd = require("./function/arithmetic/gcd.js");
+
+var _hypot = require("./function/arithmetic/hypot.js");
+
+var _invmod = require("./function/arithmetic/invmod.js");
+
+var _lcm = require("./function/arithmetic/lcm.js");
+
+var _log = require("./function/arithmetic/log.js");
+
+var _log2 = require("./function/arithmetic/log10.js");
+
+var _log1p = require("./function/arithmetic/log1p.js");
+
+var _log3 = require("./function/arithmetic/log2.js");
+
+var _mod = require("./function/arithmetic/mod.js");
+
+var _multiply = require("./function/arithmetic/multiply.js");
+
+var _norm = require("./function/arithmetic/norm.js");
+
+var _nthRoot = require("./function/arithmetic/nthRoot.js");
+
+var _nthRoots = require("./function/arithmetic/nthRoots.js");
+
+var _pow = require("./function/arithmetic/pow.js");
+
+var _round = require("./function/arithmetic/round.js");
+
+var _sign = require("./function/arithmetic/sign.js");
+
+var _sqrt = require("./function/arithmetic/sqrt.js");
+
+var _sqrtm = require("./function/arithmetic/sqrtm.js");
+
+var _square = require("./function/arithmetic/square.js");
+
+var _subtract = require("./function/arithmetic/subtract.js");
+
+var _unaryMinus = require("./function/arithmetic/unaryMinus.js");
+
+var _unaryPlus = require("./function/arithmetic/unaryPlus.js");
+
+var _xgcd = require("./function/arithmetic/xgcd.js");
+
+var _bitAnd = require("./function/bitwise/bitAnd.js");
+
+var _bitNot = require("./function/bitwise/bitNot.js");
+
+var _bitOr = require("./function/bitwise/bitOr.js");
+
+var _bitXor = require("./function/bitwise/bitXor.js");
+
+var _leftShift = require("./function/bitwise/leftShift.js");
+
+var _rightArithShift = require("./function/bitwise/rightArithShift.js");
+
+var _rightLogShift = require("./function/bitwise/rightLogShift.js");
+
+var _bellNumbers = require("./function/combinatorics/bellNumbers.js");
+
+var _catalan = require("./function/combinatorics/catalan.js");
+
+var _composition = require("./function/combinatorics/composition.js");
+
+var _stirlingS = require("./function/combinatorics/stirlingS2.js");
+
+var _arg = require("./function/complex/arg.js");
+
+var _conj = require("./function/complex/conj.js");
+
+var _im = require("./function/complex/im.js");
+
+var _re = require("./function/complex/re.js");
+
+var _evaluate = require("./function/expression/evaluate.js");
+
+var _help = require("./function/expression/help.js");
+
+var _distance = require("./function/geometry/distance.js");
+
+var _intersect = require("./function/geometry/intersect.js");
+
+var _and = require("./function/logical/and.js");
+
+var _not = require("./function/logical/not.js");
+
+var _or = require("./function/logical/or.js");
+
+var _xor = require("./function/logical/xor.js");
+
+var _column = require("./function/matrix/column.js");
+
+var _concat = require("./function/matrix/concat.js");
+
+var _count = require("./function/matrix/count.js");
+
+var _cross = require("./function/matrix/cross.js");
+
+var _ctranspose = require("./function/matrix/ctranspose.js");
+
+var _det = require("./function/matrix/det.js");
+
+var _diag = require("./function/matrix/diag.js");
+
+var _diff = require("./function/matrix/diff.js");
+
+var _dot = require("./function/matrix/dot.js");
+
+var _eigs = require("./function/matrix/eigs.js");
+
+var _filter = require("./function/matrix/filter.js");
+
+var _flatten = require("./function/matrix/flatten.js");
+
+var _forEach = require("./function/matrix/forEach.js");
+
+var _getMatrixDataType = require("./function/matrix/getMatrixDataType.js");
+
+var _identity = require("./function/matrix/identity.js");
+
+var _inv = require("./function/matrix/inv.js");
+
+var _kron = require("./function/matrix/kron.js");
+
+var _map = require("./function/matrix/map.js");
+
+var _matrixFromColumns = require("./function/matrix/matrixFromColumns.js");
+
+var _matrixFromFunction = require("./function/matrix/matrixFromFunction.js");
+
+var _matrixFromRows = require("./function/matrix/matrixFromRows.js");
+
+var _ones = require("./function/matrix/ones.js");
+
+var _partitionSelect = require("./function/matrix/partitionSelect.js");
+
+var _range = require("./function/matrix/range.js");
+
+var _reshape = require("./function/matrix/reshape.js");
+
+var _resize = require("./function/matrix/resize.js");
+
+var _rotate = require("./function/matrix/rotate.js");
+
+var _rotationMatrix = require("./function/matrix/rotationMatrix.js");
+
+var _row = require("./function/matrix/row.js");
+
+var _size = require("./function/matrix/size.js");
+
+var _sort = require("./function/matrix/sort.js");
+
+var _squeeze = require("./function/matrix/squeeze.js");
+
+var _subset = require("./function/matrix/subset.js");
+
+var _trace = require("./function/matrix/trace.js");
+
+var _transpose = require("./function/matrix/transpose.js");
+
+var _zeros = require("./function/matrix/zeros.js");
+
+var _combinations = require("./function/probability/combinations.js");
+
+var _combinationsWithRep = require("./function/probability/combinationsWithRep.js");
+
+var _factorial = require("./function/probability/factorial.js");
+
+var _gamma = require("./function/probability/gamma.js");
+
+var _kldivergence = require("./function/probability/kldivergence.js");
+
+var _multinomial = require("./function/probability/multinomial.js");
+
+var _permutations = require("./function/probability/permutations.js");
+
+var _pickRandom = require("./function/probability/pickRandom.js");
+
+var _random = require("./function/probability/random.js");
+
+var _randomInt = require("./function/probability/randomInt.js");
+
+var _compare = require("./function/relational/compare.js");
+
+var _compareNatural = require("./function/relational/compareNatural.js");
+
+var _compareText = require("./function/relational/compareText.js");
+
+var _deepEqual = require("./function/relational/deepEqual.js");
+
+var _equal = require("./function/relational/equal.js");
+
+var _equalText = require("./function/relational/equalText.js");
+
+var _larger = require("./function/relational/larger.js");
+
+var _largerEq = require("./function/relational/largerEq.js");
+
+var _smaller = require("./function/relational/smaller.js");
+
+var _smallerEq = require("./function/relational/smallerEq.js");
+
+var _unequal = require("./function/relational/unequal.js");
+
+var _setCartesian = require("./function/set/setCartesian.js");
+
+var _setDifference = require("./function/set/setDifference.js");
+
+var _setDistinct = require("./function/set/setDistinct.js");
+
+var _setIntersect = require("./function/set/setIntersect.js");
+
+var _setIsSubset = require("./function/set/setIsSubset.js");
+
+var _setMultiplicity = require("./function/set/setMultiplicity.js");
+
+var _setPowerset = require("./function/set/setPowerset.js");
+
+var _setSize = require("./function/set/setSize.js");
+
+var _setSymDifference = require("./function/set/setSymDifference.js");
+
+var _setUnion = require("./function/set/setUnion.js");
+
+var _erf = require("./function/special/erf.js");
+
+var _mad = require("./function/statistics/mad.js");
+
+var _max = require("./function/statistics/max.js");
+
+var _mean = require("./function/statistics/mean.js");
+
+var _median = require("./function/statistics/median.js");
+
+var _min = require("./function/statistics/min.js");
+
+var _mode = require("./function/statistics/mode.js");
+
+var _prod = require("./function/statistics/prod.js");
+
+var _quantileSeq = require("./function/statistics/quantileSeq.js");
+
+var _std = require("./function/statistics/std.js");
+
+var _cumsum = require("./function/statistics/cumsum.js");
+
+var _sum = require("./function/statistics/sum.js");
+
+var _variance = require("./function/statistics/variance.js");
+
+var _acos = require("./function/trigonometry/acos.js");
+
+var _acosh = require("./function/trigonometry/acosh.js");
+
+var _acot = require("./function/trigonometry/acot.js");
+
+var _acoth = require("./function/trigonometry/acoth.js");
+
+var _acsc = require("./function/trigonometry/acsc.js");
+
+var _acsch = require("./function/trigonometry/acsch.js");
+
+var _asec = require("./function/trigonometry/asec.js");
+
+var _asech = require("./function/trigonometry/asech.js");
+
+var _asin = require("./function/trigonometry/asin.js");
+
+var _asinh = require("./function/trigonometry/asinh.js");
+
+var _atan = require("./function/trigonometry/atan.js");
+
+var _atan2 = require("./function/trigonometry/atan2.js");
+
+var _atanh = require("./function/trigonometry/atanh.js");
+
+var _cos = require("./function/trigonometry/cos.js");
+
+var _cosh = require("./function/trigonometry/cosh.js");
+
+var _cot = require("./function/trigonometry/cot.js");
+
+var _coth = require("./function/trigonometry/coth.js");
+
+var _csc = require("./function/trigonometry/csc.js");
+
+var _csch = require("./function/trigonometry/csch.js");
+
+var _sec = require("./function/trigonometry/sec.js");
+
+var _sech = require("./function/trigonometry/sech.js");
+
+var _sin = require("./function/trigonometry/sin.js");
+
+var _sinh = require("./function/trigonometry/sinh.js");
+
+var _tan = require("./function/trigonometry/tan.js");
+
+var _tanh = require("./function/trigonometry/tanh.js");
+
+var _to = require("./function/units/to.js");
+
+var _bin = require("./function/utils/bin.js");
+
+var _clone = require("./function/utils/clone.js");
+
+var _format = require("./function/utils/format.js");
+
+var _hasNumericValue = require("./function/utils/hasNumericValue.js");
+
+var _hex = require("./function/utils/hex.js");
+
+var _isInteger = require("./function/utils/isInteger.js");
+
+var _isNaN = require("./function/utils/isNaN.js");
+
+var _isNegative = require("./function/utils/isNegative.js");
+
+var _isNumeric = require("./function/utils/isNumeric.js");
+
+var _isPositive = require("./function/utils/isPositive.js");
+
+var _isPrime = require("./function/utils/isPrime.js");
+
+var _isZero = require("./function/utils/isZero.js");
+
+var _numeric = require("./function/utils/numeric.js");
+
+var _oct = require("./function/utils/oct.js");
+
+var _print = require("./function/utils/print.js");
+
+var _typeOf = require("./function/utils/typeOf.js");
+
+var embeddedDocs = {
+  // construction functions
+  bignumber: _bignumber.bignumberDocs,
+  boolean: _boolean.booleanDocs,
+  complex: _complex.complexDocs,
+  createUnit: _createUnit.createUnitDocs,
+  fraction: _fraction.fractionDocs,
+  index: _index.indexDocs,
+  matrix: _matrix.matrixDocs,
+  number: _number.numberDocs,
+  sparse: _sparse.sparseDocs,
+  splitUnit: _splitUnit.splitUnitDocs,
+  string: _string.stringDocs,
+  unit: _unit.unitDocs,
+  // constants
+  e: _e.eDocs,
+  E: _e.eDocs,
+  false: _false.falseDocs,
+  i: _i.iDocs,
+  Infinity: _Infinity.InfinityDocs,
+  LN2: _LN2.LN2Docs,
+  LN10: _LN.LN10Docs,
+  LOG2E: _LOG2E.LOG2EDocs,
+  LOG10E: _LOG10E.LOG10EDocs,
+  NaN: _NaN.NaNDocs,
+  null: _null.nullDocs,
+  pi: _pi.piDocs,
+  PI: _pi.piDocs,
+  phi: _phi.phiDocs,
+  SQRT1_2: _SQRT1_.SQRT12Docs,
+  SQRT2: _SQRT.SQRT2Docs,
+  tau: _tau.tauDocs,
+  true: _true.trueDocs,
+  version: _version.versionDocs,
+  // physical constants
+  // TODO: more detailed docs for physical constants
+  speedOfLight: {
+    description: 'Speed of light in vacuum',
+    examples: ['speedOfLight']
+  },
+  gravitationConstant: {
+    description: 'Newtonian constant of gravitation',
+    examples: ['gravitationConstant']
+  },
+  planckConstant: {
+    description: 'Planck constant',
+    examples: ['planckConstant']
+  },
+  reducedPlanckConstant: {
+    description: 'Reduced Planck constant',
+    examples: ['reducedPlanckConstant']
+  },
+  magneticConstant: {
+    description: 'Magnetic constant (vacuum permeability)',
+    examples: ['magneticConstant']
+  },
+  electricConstant: {
+    description: 'Electric constant (vacuum permeability)',
+    examples: ['electricConstant']
+  },
+  vacuumImpedance: {
+    description: 'Characteristic impedance of vacuum',
+    examples: ['vacuumImpedance']
+  },
+  coulomb: {
+    description: 'Coulomb\'s constant',
+    examples: ['coulomb']
+  },
+  elementaryCharge: {
+    description: 'Elementary charge',
+    examples: ['elementaryCharge']
+  },
+  bohrMagneton: {
+    description: 'Borh magneton',
+    examples: ['bohrMagneton']
+  },
+  conductanceQuantum: {
+    description: 'Conductance quantum',
+    examples: ['conductanceQuantum']
+  },
+  inverseConductanceQuantum: {
+    description: 'Inverse conductance quantum',
+    examples: ['inverseConductanceQuantum']
+  },
+  // josephson: {description: 'Josephson constant', examples: ['josephson']},
+  magneticFluxQuantum: {
+    description: 'Magnetic flux quantum',
+    examples: ['magneticFluxQuantum']
+  },
+  nuclearMagneton: {
+    description: 'Nuclear magneton',
+    examples: ['nuclearMagneton']
+  },
+  klitzing: {
+    description: 'Von Klitzing constant',
+    examples: ['klitzing']
+  },
+  bohrRadius: {
+    description: 'Borh radius',
+    examples: ['bohrRadius']
+  },
+  classicalElectronRadius: {
+    description: 'Classical electron radius',
+    examples: ['classicalElectronRadius']
+  },
+  electronMass: {
+    description: 'Electron mass',
+    examples: ['electronMass']
+  },
+  fermiCoupling: {
+    description: 'Fermi coupling constant',
+    examples: ['fermiCoupling']
+  },
+  fineStructure: {
+    description: 'Fine-structure constant',
+    examples: ['fineStructure']
+  },
+  hartreeEnergy: {
+    description: 'Hartree energy',
+    examples: ['hartreeEnergy']
+  },
+  protonMass: {
+    description: 'Proton mass',
+    examples: ['protonMass']
+  },
+  deuteronMass: {
+    description: 'Deuteron Mass',
+    examples: ['deuteronMass']
+  },
+  neutronMass: {
+    description: 'Neutron mass',
+    examples: ['neutronMass']
+  },
+  quantumOfCirculation: {
+    description: 'Quantum of circulation',
+    examples: ['quantumOfCirculation']
+  },
+  rydberg: {
+    description: 'Rydberg constant',
+    examples: ['rydberg']
+  },
+  thomsonCrossSection: {
+    description: 'Thomson cross section',
+    examples: ['thomsonCrossSection']
+  },
+  weakMixingAngle: {
+    description: 'Weak mixing angle',
+    examples: ['weakMixingAngle']
+  },
+  efimovFactor: {
+    description: 'Efimov factor',
+    examples: ['efimovFactor']
+  },
+  atomicMass: {
+    description: 'Atomic mass constant',
+    examples: ['atomicMass']
+  },
+  avogadro: {
+    description: 'Avogadro\'s number',
+    examples: ['avogadro']
+  },
+  boltzmann: {
+    description: 'Boltzmann constant',
+    examples: ['boltzmann']
+  },
+  faraday: {
+    description: 'Faraday constant',
+    examples: ['faraday']
+  },
+  firstRadiation: {
+    description: 'First radiation constant',
+    examples: ['firstRadiation']
+  },
+  loschmidt: {
+    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',
+    examples: ['loschmidt']
+  },
+  gasConstant: {
+    description: 'Gas constant',
+    examples: ['gasConstant']
+  },
+  molarPlanckConstant: {
+    description: 'Molar Planck constant',
+    examples: ['molarPlanckConstant']
+  },
+  molarVolume: {
+    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',
+    examples: ['molarVolume']
+  },
+  sackurTetrode: {
+    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',
+    examples: ['sackurTetrode']
+  },
+  secondRadiation: {
+    description: 'Second radiation constant',
+    examples: ['secondRadiation']
+  },
+  stefanBoltzmann: {
+    description: 'Stefan-Boltzmann constant',
+    examples: ['stefanBoltzmann']
+  },
+  wienDisplacement: {
+    description: 'Wien displacement law constant',
+    examples: ['wienDisplacement']
+  },
+  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},
+  molarMass: {
+    description: 'Molar mass constant',
+    examples: ['molarMass']
+  },
+  molarMassC12: {
+    description: 'Molar mass constant of carbon-12',
+    examples: ['molarMassC12']
+  },
+  gravity: {
+    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',
+    examples: ['gravity']
+  },
+  planckLength: {
+    description: 'Planck length',
+    examples: ['planckLength']
+  },
+  planckMass: {
+    description: 'Planck mass',
+    examples: ['planckMass']
+  },
+  planckTime: {
+    description: 'Planck time',
+    examples: ['planckTime']
+  },
+  planckCharge: {
+    description: 'Planck charge',
+    examples: ['planckCharge']
+  },
+  planckTemperature: {
+    description: 'Planck temperature',
+    examples: ['planckTemperature']
+  },
+  // functions - algebra
+  derivative: _derivative.derivativeDocs,
+  lsolve: _lsolve.lsolveDocs,
+  lsolveAll: _lsolveAll.lsolveAllDocs,
+  lup: _lup.lupDocs,
+  lusolve: _lusolve.lusolveDocs,
+  leafCount: _leafCount.leafCountDocs,
+  resolve: _resolve.resolveDocs,
+  simplify: _simplify.simplifyDocs,
+  simplifyCore: _simplifyCore.simplifyCoreDocs,
+  symbolicEqual: _symbolicEqual.symbolicEqualDocs,
+  rationalize: _rationalize.rationalizeDocs,
+  slu: _slu.sluDocs,
+  usolve: _usolve.usolveDocs,
+  usolveAll: _usolveAll.usolveAllDocs,
+  qr: _qr.qrDocs,
+  // functions - arithmetic
+  abs: _abs.absDocs,
+  add: _add.addDocs,
+  cbrt: _cbrt.cbrtDocs,
+  ceil: _ceil.ceilDocs,
+  cube: _cube.cubeDocs,
+  divide: _divide.divideDocs,
+  dotDivide: _dotDivide.dotDivideDocs,
+  dotMultiply: _dotMultiply.dotMultiplyDocs,
+  dotPow: _dotPow.dotPowDocs,
+  exp: _exp.expDocs,
+  expm: _expm.expmDocs,
+  expm1: _expm2.expm1Docs,
+  fix: _fix.fixDocs,
+  floor: _floor.floorDocs,
+  gcd: _gcd.gcdDocs,
+  hypot: _hypot.hypotDocs,
+  lcm: _lcm.lcmDocs,
+  log: _log.logDocs,
+  log2: _log3.log2Docs,
+  log1p: _log1p.log1pDocs,
+  log10: _log2.log10Docs,
+  mod: _mod.modDocs,
+  multiply: _multiply.multiplyDocs,
+  norm: _norm.normDocs,
+  nthRoot: _nthRoot.nthRootDocs,
+  nthRoots: _nthRoots.nthRootsDocs,
+  pow: _pow.powDocs,
+  round: _round.roundDocs,
+  sign: _sign.signDocs,
+  sqrt: _sqrt.sqrtDocs,
+  sqrtm: _sqrtm.sqrtmDocs,
+  square: _square.squareDocs,
+  subtract: _subtract.subtractDocs,
+  unaryMinus: _unaryMinus.unaryMinusDocs,
+  unaryPlus: _unaryPlus.unaryPlusDocs,
+  xgcd: _xgcd.xgcdDocs,
+  invmod: _invmod.invmodDocs,
+  // functions - bitwise
+  bitAnd: _bitAnd.bitAndDocs,
+  bitNot: _bitNot.bitNotDocs,
+  bitOr: _bitOr.bitOrDocs,
+  bitXor: _bitXor.bitXorDocs,
+  leftShift: _leftShift.leftShiftDocs,
+  rightArithShift: _rightArithShift.rightArithShiftDocs,
+  rightLogShift: _rightLogShift.rightLogShiftDocs,
+  // functions - combinatorics
+  bellNumbers: _bellNumbers.bellNumbersDocs,
+  catalan: _catalan.catalanDocs,
+  composition: _composition.compositionDocs,
+  stirlingS2: _stirlingS.stirlingS2Docs,
+  // functions - core
+  config: _config.configDocs,
+  import: _import.importDocs,
+  typed: _typed.typedDocs,
+  // functions - complex
+  arg: _arg.argDocs,
+  conj: _conj.conjDocs,
+  re: _re.reDocs,
+  im: _im.imDocs,
+  // functions - expression
+  evaluate: _evaluate.evaluateDocs,
+  help: _help.helpDocs,
+  // functions - geometry
+  distance: _distance.distanceDocs,
+  intersect: _intersect.intersectDocs,
+  // functions - logical
+  and: _and.andDocs,
+  not: _not.notDocs,
+  or: _or.orDocs,
+  xor: _xor.xorDocs,
+  // functions - matrix
+  concat: _concat.concatDocs,
+  count: _count.countDocs,
+  cross: _cross.crossDocs,
+  column: _column.columnDocs,
+  ctranspose: _ctranspose.ctransposeDocs,
+  det: _det.detDocs,
+  diag: _diag.diagDocs,
+  diff: _diff.diffDocs,
+  dot: _dot.dotDocs,
+  getMatrixDataType: _getMatrixDataType.getMatrixDataTypeDocs,
+  identity: _identity.identityDocs,
+  filter: _filter.filterDocs,
+  flatten: _flatten.flattenDocs,
+  forEach: _forEach.forEachDocs,
+  inv: _inv.invDocs,
+  eigs: _eigs.eigsDocs,
+  kron: _kron.kronDocs,
+  matrixFromFunction: _matrixFromFunction.matrixFromFunctionDocs,
+  matrixFromRows: _matrixFromRows.matrixFromRowsDocs,
+  matrixFromColumns: _matrixFromColumns.matrixFromColumnsDocs,
+  map: _map.mapDocs,
+  ones: _ones.onesDocs,
+  partitionSelect: _partitionSelect.partitionSelectDocs,
+  range: _range.rangeDocs,
+  resize: _resize.resizeDocs,
+  reshape: _reshape.reshapeDocs,
+  rotate: _rotate.rotateDocs,
+  rotationMatrix: _rotationMatrix.rotationMatrixDocs,
+  row: _row.rowDocs,
+  size: _size.sizeDocs,
+  sort: _sort.sortDocs,
+  squeeze: _squeeze.squeezeDocs,
+  subset: _subset.subsetDocs,
+  trace: _trace.traceDocs,
+  transpose: _transpose.transposeDocs,
+  zeros: _zeros.zerosDocs,
+  // functions - probability
+  combinations: _combinations.combinationsDocs,
+  combinationsWithRep: _combinationsWithRep.combinationsWithRepDocs,
+  // distribution: distributionDocs,
+  factorial: _factorial.factorialDocs,
+  gamma: _gamma.gammaDocs,
+  kldivergence: _kldivergence.kldivergenceDocs,
+  multinomial: _multinomial.multinomialDocs,
+  permutations: _permutations.permutationsDocs,
+  pickRandom: _pickRandom.pickRandomDocs,
+  random: _random.randomDocs,
+  randomInt: _randomInt.randomIntDocs,
+  // functions - relational
+  compare: _compare.compareDocs,
+  compareNatural: _compareNatural.compareNaturalDocs,
+  compareText: _compareText.compareTextDocs,
+  deepEqual: _deepEqual.deepEqualDocs,
+  equal: _equal.equalDocs,
+  equalText: _equalText.equalTextDocs,
+  larger: _larger.largerDocs,
+  largerEq: _largerEq.largerEqDocs,
+  smaller: _smaller.smallerDocs,
+  smallerEq: _smallerEq.smallerEqDocs,
+  unequal: _unequal.unequalDocs,
+  // functions - set
+  setCartesian: _setCartesian.setCartesianDocs,
+  setDifference: _setDifference.setDifferenceDocs,
+  setDistinct: _setDistinct.setDistinctDocs,
+  setIntersect: _setIntersect.setIntersectDocs,
+  setIsSubset: _setIsSubset.setIsSubsetDocs,
+  setMultiplicity: _setMultiplicity.setMultiplicityDocs,
+  setPowerset: _setPowerset.setPowersetDocs,
+  setSize: _setSize.setSizeDocs,
+  setSymDifference: _setSymDifference.setSymDifferenceDocs,
+  setUnion: _setUnion.setUnionDocs,
+  // functions - special
+  erf: _erf.erfDocs,
+  // functions - statistics
+  cumsum: _cumsum.cumSumDocs,
+  mad: _mad.madDocs,
+  max: _max.maxDocs,
+  mean: _mean.meanDocs,
+  median: _median.medianDocs,
+  min: _min.minDocs,
+  mode: _mode.modeDocs,
+  prod: _prod.prodDocs,
+  quantileSeq: _quantileSeq.quantileSeqDocs,
+  std: _std.stdDocs,
+  sum: _sum.sumDocs,
+  variance: _variance.varianceDocs,
+  // functions - trigonometry
+  acos: _acos.acosDocs,
+  acosh: _acosh.acoshDocs,
+  acot: _acot.acotDocs,
+  acoth: _acoth.acothDocs,
+  acsc: _acsc.acscDocs,
+  acsch: _acsch.acschDocs,
+  asec: _asec.asecDocs,
+  asech: _asech.asechDocs,
+  asin: _asin.asinDocs,
+  asinh: _asinh.asinhDocs,
+  atan: _atan.atanDocs,
+  atanh: _atanh.atanhDocs,
+  atan2: _atan2.atan2Docs,
+  cos: _cos.cosDocs,
+  cosh: _cosh.coshDocs,
+  cot: _cot.cotDocs,
+  coth: _coth.cothDocs,
+  csc: _csc.cscDocs,
+  csch: _csch.cschDocs,
+  sec: _sec.secDocs,
+  sech: _sech.sechDocs,
+  sin: _sin.sinDocs,
+  sinh: _sinh.sinhDocs,
+  tan: _tan.tanDocs,
+  tanh: _tanh.tanhDocs,
+  // functions - units
+  to: _to.toDocs,
+  // functions - utils
+  clone: _clone.cloneDocs,
+  format: _format.formatDocs,
+  bin: _bin.binDocs,
+  oct: _oct.octDocs,
+  hex: _hex.hexDocs,
+  isNaN: _isNaN.isNaNDocs,
+  isInteger: _isInteger.isIntegerDocs,
+  isNegative: _isNegative.isNegativeDocs,
+  isNumeric: _isNumeric.isNumericDocs,
+  hasNumericValue: _hasNumericValue.hasNumericValueDocs,
+  isPositive: _isPositive.isPositiveDocs,
+  isPrime: _isPrime.isPrimeDocs,
+  isZero: _isZero.isZeroDocs,
+  print: _print.printDocs,
+  typeOf: _typeOf.typeOfDocs,
+  numeric: _numeric.numericDocs
+};
+exports.embeddedDocs = embeddedDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/derivative.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/derivative.js
new file mode 100644
index 0000000..97c99a6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/derivative.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivativeDocs = void 0;
+var derivativeDocs = {
+  name: 'derivative',
+  category: 'Algebra',
+  syntax: ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],
+  description: 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',
+  examples: ['derivative("2x^3", "x")', 'derivative("2x^3", "x", {simplify: false})', 'derivative("2x^2 + 3x + 4", "x")', 'derivative("sin(2x)", "x")', 'f = parse("x^2 + x")', 'x = parse("x")', 'df = derivative(f, x)', 'df.evaluate({x: 3})'],
+  seealso: ['simplify', 'parse', 'evaluate']
+};
+exports.derivativeDocs = derivativeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/leafCount.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/leafCount.js
new file mode 100644
index 0000000..27412ca
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/leafCount.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leafCountDocs = void 0;
+var leafCountDocs = {
+  name: 'leafCount',
+  category: 'Algebra',
+  syntax: ['leafCount(expr)'],
+  description: 'Computes the number of leaves in the parse tree of the given expression',
+  examples: ['leafCount("e^(i*pi)-1")', 'leafCount(parse("{a: 22/7, b: 10^(1/2)}"))'],
+  seealso: ['simplify']
+};
+exports.leafCountDocs = leafCountDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolve.js
new file mode 100644
index 0000000..151c9b3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolve.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveDocs = void 0;
+var lsolveDocs = {
+  name: 'lsolve',
+  category: 'Algebra',
+  syntax: ['x=lsolve(L, b)'],
+  description: 'Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
+exports.lsolveDocs = lsolveDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolveAll.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolveAll.js
new file mode 100644
index 0000000..8ecb9a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolveAll.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveAllDocs = void 0;
+var lsolveAllDocs = {
+  name: 'lsolveAll',
+  category: 'Algebra',
+  syntax: ['x=lsolveAll(L, b)'],
+  description: 'Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
+exports.lsolveAllDocs = lsolveAllDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lup.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lup.js
new file mode 100644
index 0000000..af0ef27
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lup.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lupDocs = void 0;
+var lupDocs = {
+  name: 'lup',
+  category: 'Algebra',
+  syntax: ['lup(m)'],
+  description: 'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',
+  examples: ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']
+};
+exports.lupDocs = lupDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lusolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lusolve.js
new file mode 100644
index 0000000..6f78420
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lusolve.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lusolveDocs = void 0;
+var lusolveDocs = {
+  name: 'lusolve',
+  category: 'Algebra',
+  syntax: ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],
+  description: 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],
+  seealso: ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']
+};
+exports.lusolveDocs = lusolveDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/qr.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/qr.js
new file mode 100644
index 0000000..a99cc6c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/qr.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.qrDocs = void 0;
+var qrDocs = {
+  name: 'qr',
+  category: 'Algebra',
+  syntax: ['qr(A)'],
+  description: 'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',
+  examples: ['qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'],
+  seealso: ['lup', 'slu', 'matrix']
+};
+exports.qrDocs = qrDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/rationalize.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/rationalize.js
new file mode 100644
index 0000000..cd2441b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/rationalize.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rationalizeDocs = void 0;
+var rationalizeDocs = {
+  name: 'rationalize',
+  category: 'Algebra',
+  syntax: ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],
+  description: 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',
+  examples: ['rationalize("2x/y - y/(x+1)")', 'rationalize("2x/y - y/(x+1)", true)'],
+  seealso: ['simplify']
+};
+exports.rationalizeDocs = rationalizeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/resolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/resolve.js
new file mode 100644
index 0000000..946c0c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/resolve.js
@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resolveDocs = void 0;
+var resolveDocs = {
+  name: 'resolve',
+  category: 'Algebra',
+  syntax: ['resolve(node, scope)'],
+  description: 'Recursively substitute variables in an expression tree.',
+  examples: ['resolve(parse("1 + x"), { x: 7 })', 'resolve(parse("size(text)"), { text: "Hello World" })', 'resolve(parse("x + y"), { x: parse("3z") })', 'resolve(parse("3x"), { x: parse("y+z"), z: parse("w^y") })'],
+  seealso: ['simplify', 'evaluate'],
+  mayThrow: ['ReferenceError']
+};
+exports.resolveDocs = resolveDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplify.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplify.js
new file mode 100644
index 0000000..166c207
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplify.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyDocs = void 0;
+var simplifyDocs = {
+  name: 'simplify',
+  category: 'Algebra',
+  syntax: ['simplify(expr)', 'simplify(expr, rules)'],
+  description: 'Simplify an expression tree.',
+  examples: ['simplify("3 + 2 / 4")', 'simplify("2x + x")', 'f = parse("x * (x + 2 + x)")', 'simplified = simplify(f)', 'simplified.evaluate({x: 2})'],
+  seealso: ['simplifyCore', 'derivative', 'evaluate', 'parse', 'rationalize', 'resolve']
+};
+exports.simplifyDocs = simplifyDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..316702c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyCore.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyCoreDocs = void 0;
+var simplifyCoreDocs = {
+  name: 'simplifyCore',
+  category: 'Algebra',
+  syntax: ['simplifyCore(node)'],
+  description: 'Perform simple one-pass simplifications on an expression tree.',
+  examples: ['simplifyCore(parse("0*x"))', 'simplifyCore(parse("(x+0)*2"))'],
+  seealso: ['simplify', 'evaluate']
+};
+exports.simplifyCoreDocs = simplifyCoreDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/slu.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/slu.js
new file mode 100644
index 0000000..2128961
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/slu.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sluDocs = void 0;
+var sluDocs = {
+  name: 'slu',
+  category: 'Algebra',
+  syntax: ['slu(A, order, threshold)'],
+  description: 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',
+  examples: ['slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']
+};
+exports.sluDocs = sluDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..228eb06
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/symbolicEqual.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.symbolicEqualDocs = void 0;
+var symbolicEqualDocs = {
+  name: 'symbolicEqual',
+  category: 'Algebra',
+  syntax: ['symbolicEqual(expr1, expr2)', 'symbolicEqual(expr1, expr2, options)'],
+  description: 'Returns true if the difference of the expressions simplifies to 0',
+  examples: ['symbolicEqual("x*y","y*x")', 'symbolicEqual("abs(x^2)", "x^2")', 'symbolicEqual("abs(x)", "x", {context: {abs: {trivial: true}}})'],
+  seealso: ['simplify', 'evaluate']
+};
+exports.symbolicEqualDocs = symbolicEqualDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolve.js
new file mode 100644
index 0000000..d4d950b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolve.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveDocs = void 0;
+var usolveDocs = {
+  name: 'usolve',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
+exports.usolveDocs = usolveDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolveAll.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolveAll.js
new file mode 100644
index 0000000..58ea161
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolveAll.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveAllDocs = void 0;
+var usolveAllDocs = {
+  name: 'usolveAll',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
+exports.usolveAllDocs = usolveAllDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/abs.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/abs.js
new file mode 100644
index 0000000..505fb6c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/abs.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absDocs = void 0;
+var absDocs = {
+  name: 'abs',
+  category: 'Arithmetic',
+  syntax: ['abs(x)'],
+  description: 'Compute the absolute value.',
+  examples: ['abs(3.5)', 'abs(-4.2)'],
+  seealso: ['sign']
+};
+exports.absDocs = absDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/add.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/add.js
new file mode 100644
index 0000000..1a69502
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/add.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addDocs = void 0;
+var addDocs = {
+  name: 'add',
+  category: 'Operators',
+  syntax: ['x + y', 'add(x, y)'],
+  description: 'Add two values.',
+  examples: ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '"2.3" + "4"'],
+  seealso: ['subtract']
+};
+exports.addDocs = addDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..cdcfb59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cbrt.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cbrtDocs = void 0;
+var cbrtDocs = {
+  name: 'cbrt',
+  category: 'Arithmetic',
+  syntax: ['cbrt(x)', 'cbrt(x, allRoots)'],
+  description: 'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',
+  examples: ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],
+  seealso: ['square', 'sqrt', 'cube', 'multiply']
+};
+exports.cbrtDocs = cbrtDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/ceil.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/ceil.js
new file mode 100644
index 0000000..1ff6bf4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/ceil.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ceilDocs = void 0;
+var ceilDocs = {
+  name: 'ceil',
+  category: 'Arithmetic',
+  syntax: ['ceil(x)'],
+  description: 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',
+  examples: ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)'],
+  seealso: ['floor', 'fix', 'round']
+};
+exports.ceilDocs = ceilDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cube.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cube.js
new file mode 100644
index 0000000..1625be7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cube.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cubeDocs = void 0;
+var cubeDocs = {
+  name: 'cube',
+  category: 'Arithmetic',
+  syntax: ['cube(x)'],
+  description: 'Compute the cube of a value. The cube of x is x * x * x.',
+  examples: ['cube(2)', '2^3', '2 * 2 * 2'],
+  seealso: ['multiply', 'square', 'pow']
+};
+exports.cubeDocs = cubeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/divide.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/divide.js
new file mode 100644
index 0000000..7733e6f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/divide.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideDocs = void 0;
+var divideDocs = {
+  name: 'divide',
+  category: 'Operators',
+  syntax: ['x / y', 'divide(x, y)'],
+  description: 'Divide two values.',
+  examples: ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],
+  seealso: ['multiply']
+};
+exports.divideDocs = divideDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..2c4fcab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotDivide.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDivideDocs = void 0;
+var dotDivideDocs = {
+  name: 'dotDivide',
+  category: 'Operators',
+  syntax: ['x ./ y', 'dotDivide(x, y)'],
+  description: 'Divide two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],
+  seealso: ['multiply', 'dotMultiply', 'divide']
+};
+exports.dotDivideDocs = dotDivideDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..2c9cb64
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotMultiply.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotMultiplyDocs = void 0;
+var dotMultiplyDocs = {
+  name: 'dotMultiply',
+  category: 'Operators',
+  syntax: ['x .* y', 'dotMultiply(x, y)'],
+  description: 'Multiply two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],
+  seealso: ['multiply', 'divide', 'dotDivide']
+};
+exports.dotMultiplyDocs = dotMultiplyDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..5e61e76
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotPow.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotPowDocs = void 0;
+var dotPowDocs = {
+  name: 'dotPow',
+  category: 'Operators',
+  syntax: ['x .^ y', 'dotPow(x, y)'],
+  description: 'Calculates the power of x to y element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],
+  seealso: ['pow']
+};
+exports.dotPowDocs = dotPowDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/exp.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/exp.js
new file mode 100644
index 0000000..b914299
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/exp.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expDocs = void 0;
+var expDocs = {
+  name: 'exp',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Calculate the exponent of a value.',
+  examples: ['exp(1.3)', 'e ^ 1.3', 'log(exp(1.3))', 'x = 2.4', '(exp(i*x) == cos(x) + i*sin(x))   # Euler\'s formula'],
+  seealso: ['expm', 'expm1', 'pow', 'log']
+};
+exports.expDocs = expDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm.js
new file mode 100644
index 0000000..3d0116d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expmDocs = void 0;
+var expmDocs = {
+  name: 'expm',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Compute the matrix exponential, expm(A) = e^A. ' + 'The matrix must be square. ' + 'Not to be confused with exp(a), which performs element-wise exponentiation.',
+  examples: ['expm([[0,2],[0,0]])'],
+  seealso: ['exp']
+};
+exports.expmDocs = expmDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm1.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm1.js
new file mode 100644
index 0000000..eac87f0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm1.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expm1Docs = void 0;
+var expm1Docs = {
+  name: 'expm1',
+  category: 'Arithmetic',
+  syntax: ['expm1(x)'],
+  description: 'Calculate the value of subtracting 1 from the exponential value.',
+  examples: ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],
+  seealso: ['exp', 'pow', 'log']
+};
+exports.expm1Docs = expm1Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/fix.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/fix.js
new file mode 100644
index 0000000..ea90949
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/fix.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fixDocs = void 0;
+var fixDocs = {
+  name: 'fix',
+  category: 'Arithmetic',
+  syntax: ['fix(x)'],
+  description: 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',
+  examples: ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)'],
+  seealso: ['ceil', 'floor', 'round']
+};
+exports.fixDocs = fixDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/floor.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/floor.js
new file mode 100644
index 0000000..f854c73
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/floor.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.floorDocs = void 0;
+var floorDocs = {
+  name: 'floor',
+  category: 'Arithmetic',
+  syntax: ['floor(x)'],
+  description: 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',
+  examples: ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)'],
+  seealso: ['ceil', 'fix', 'round']
+};
+exports.floorDocs = floorDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/gcd.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/gcd.js
new file mode 100644
index 0000000..647bedd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/gcd.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gcdDocs = void 0;
+var gcdDocs = {
+  name: 'gcd',
+  category: 'Arithmetic',
+  syntax: ['gcd(a, b)', 'gcd(a, b, c, ...)'],
+  description: 'Compute the greatest common divisor.',
+  examples: ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],
+  seealso: ['lcm', 'xgcd']
+};
+exports.gcdDocs = gcdDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/hypot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/hypot.js
new file mode 100644
index 0000000..9505cef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/hypot.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hypotDocs = void 0;
+var hypotDocs = {
+  name: 'hypot',
+  category: 'Arithmetic',
+  syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],
+  description: 'Calculate the hypotenusa of a list with values. ',
+  examples: ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],
+  seealso: ['abs', 'norm']
+};
+exports.hypotDocs = hypotDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/invmod.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/invmod.js
new file mode 100644
index 0000000..d1c507c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/invmod.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invmodDocs = void 0;
+var invmodDocs = {
+  name: 'invmod',
+  category: 'Arithmetic',
+  syntax: ['invmod(a, b)'],
+  description: 'Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)',
+  examples: ['invmod(8, 12)=NaN', 'invmod(7, 13)=2', 'math.invmod(15151, 15122)=10429'],
+  seealso: ['gcd', 'xgcd']
+};
+exports.invmodDocs = invmodDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/lcm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/lcm.js
new file mode 100644
index 0000000..78039af
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/lcm.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lcmDocs = void 0;
+var lcmDocs = {
+  name: 'lcm',
+  category: 'Arithmetic',
+  syntax: ['lcm(x, y)'],
+  description: 'Compute the least common multiple.',
+  examples: ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],
+  seealso: ['gcd']
+};
+exports.lcmDocs = lcmDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log.js
new file mode 100644
index 0000000..592caa7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.logDocs = void 0;
+var logDocs = {
+  name: 'log',
+  category: 'Arithmetic',
+  syntax: ['log(x)', 'log(x, base)'],
+  description: 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',
+  examples: ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],
+  seealso: ['exp', 'log1p', 'log2', 'log10']
+};
+exports.logDocs = logDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log10.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log10.js
new file mode 100644
index 0000000..1b050d5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log10.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log10Docs = void 0;
+var log10Docs = {
+  name: 'log10',
+  category: 'Arithmetic',
+  syntax: ['log10(x)'],
+  description: 'Compute the 10-base logarithm of a value.',
+  examples: ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],
+  seealso: ['exp', 'log']
+};
+exports.log10Docs = log10Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log1p.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log1p.js
new file mode 100644
index 0000000..d0f3e77
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log1p.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log1pDocs = void 0;
+var log1pDocs = {
+  name: 'log1p',
+  category: 'Arithmetic',
+  syntax: ['log1p(x)', 'log1p(x, base)'],
+  description: 'Calculate the logarithm of a `value+1`',
+  examples: ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],
+  seealso: ['exp', 'log', 'log2', 'log10']
+};
+exports.log1pDocs = log1pDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log2.js
new file mode 100644
index 0000000..2212b58
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log2.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log2Docs = void 0;
+var log2Docs = {
+  name: 'log2',
+  category: 'Arithmetic',
+  syntax: ['log2(x)'],
+  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',
+  examples: ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],
+  seealso: ['exp', 'log1p', 'log', 'log10']
+};
+exports.log2Docs = log2Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/mod.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/mod.js
new file mode 100644
index 0000000..d482c2a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/mod.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modDocs = void 0;
+var modDocs = {
+  name: 'mod',
+  category: 'Operators',
+  syntax: ['x % y', 'x mod y', 'mod(x, y)'],
+  description: 'Calculates the modulus, the remainder of an integer division.',
+  examples: ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],
+  seealso: ['divide']
+};
+exports.modDocs = modDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/multiply.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/multiply.js
new file mode 100644
index 0000000..326454c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/multiply.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyDocs = void 0;
+var multiplyDocs = {
+  name: 'multiply',
+  category: 'Operators',
+  syntax: ['x * y', 'multiply(x, y)'],
+  description: 'multiply two values.',
+  examples: ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],
+  seealso: ['divide']
+};
+exports.multiplyDocs = multiplyDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/norm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/norm.js
new file mode 100644
index 0000000..154fd37
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/norm.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.normDocs = void 0;
+var normDocs = {
+  name: 'norm',
+  category: 'Arithmetic',
+  syntax: ['norm(x)', 'norm(x, p)'],
+  description: 'Calculate the norm of a number, vector or matrix.',
+  examples: ['abs(-3.5)', 'norm(-3.5)', 'norm(3 - 4i)', 'norm([1, 2, -3], Infinity)', 'norm([1, 2, -3], -Infinity)', 'norm([3, 4], 2)', 'norm([[1, 2], [3, 4]], 1)', 'norm([[1, 2], [3, 4]], "inf")', 'norm([[1, 2], [3, 4]], "fro")']
+};
+exports.normDocs = normDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..cf18f14
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoot.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootDocs = void 0;
+var nthRootDocs = {
+  name: 'nthRoot',
+  category: 'Arithmetic',
+  syntax: ['nthRoot(a)', 'nthRoot(a, root)'],
+  description: 'Calculate the nth root of a value. ' + 'The principal nth root of a positive real number A, ' + 'is the positive real solution of the equation "x^root = A".',
+  examples: ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],
+  seealso: ['nthRoots', 'pow', 'sqrt']
+};
+exports.nthRootDocs = nthRootDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..005e8f9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoots.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootsDocs = void 0;
+var nthRootsDocs = {
+  name: 'nthRoots',
+  category: 'Arithmetic',
+  syntax: ['nthRoots(A)', 'nthRoots(A, root)'],
+  description: '' + 'Calculate the nth roots of a value. ' + 'An nth root of a positive real number A, ' + 'is a positive real solution of the equation "x^root = A". ' + 'This function returns an array of complex values.',
+  examples: ['nthRoots(1)', 'nthRoots(1, 3)'],
+  seealso: ['sqrt', 'pow', 'nthRoot']
+};
+exports.nthRootsDocs = nthRootsDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js
new file mode 100644
index 0000000..8d208dc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.powDocs = void 0;
+var powDocs = {
+  name: 'pow',
+  category: 'Operators',
+  syntax: ['x ^ y', 'pow(x, y)'],
+  description: 'Calculates the power of x to y, x^y.',
+  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)'],
+  seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']
+};
+exports.powDocs = powDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/round.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/round.js
new file mode 100644
index 0000000..c4d7422
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/round.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.roundDocs = void 0;
+var roundDocs = {
+  name: 'round',
+  category: 'Arithmetic',
+  syntax: ['round(x)', 'round(x, n)'],
+  description: 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',
+  examples: ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)'],
+  seealso: ['ceil', 'floor', 'fix']
+};
+exports.roundDocs = roundDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sign.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sign.js
new file mode 100644
index 0000000..621fa21
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sign.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.signDocs = void 0;
+var signDocs = {
+  name: 'sign',
+  category: 'Arithmetic',
+  syntax: ['sign(x)'],
+  description: 'Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.',
+  examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],
+  seealso: ['abs']
+};
+exports.signDocs = signDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..7e11387
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrt.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtDocs = void 0;
+var sqrtDocs = {
+  name: 'sqrt',
+  category: 'Arithmetic',
+  syntax: ['sqrt(x)'],
+  description: 'Compute the square root value. If x = y * y, then y is the square root of x.',
+  examples: ['sqrt(25)', '5 * 5', 'sqrt(-1)'],
+  seealso: ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']
+};
+exports.sqrtDocs = sqrtDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrtm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrtm.js
new file mode 100644
index 0000000..3277f48
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrtm.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtmDocs = void 0;
+var sqrtmDocs = {
+  name: 'sqrtm',
+  category: 'Arithmetic',
+  syntax: ['sqrtm(x)'],
+  description: 'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',
+  examples: ['sqrtm([[1, 2], [3, 4]])'],
+  seealso: ['sqrt', 'abs', 'square', 'multiply']
+};
+exports.sqrtmDocs = sqrtmDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/square.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/square.js
new file mode 100644
index 0000000..e53a262
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/square.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squareDocs = void 0;
+var squareDocs = {
+  name: 'square',
+  category: 'Arithmetic',
+  syntax: ['square(x)'],
+  description: 'Compute the square of a value. The square of x is x * x.',
+  examples: ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],
+  seealso: ['multiply', 'pow', 'sqrt', 'cube']
+};
+exports.squareDocs = squareDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/subtract.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/subtract.js
new file mode 100644
index 0000000..cc95575
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/subtract.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractDocs = void 0;
+var subtractDocs = {
+  name: 'subtract',
+  category: 'Operators',
+  syntax: ['x - y', 'subtract(x, y)'],
+  description: 'subtract two values.',
+  examples: ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],
+  seealso: ['add']
+};
+exports.subtractDocs = subtractDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..bd20643
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryMinus.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryMinusDocs = void 0;
+var unaryMinusDocs = {
+  name: 'unaryMinus',
+  category: 'Operators',
+  syntax: ['-x', 'unaryMinus(x)'],
+  description: 'Inverse the sign of a value. Converts booleans and strings to numbers.',
+  examples: ['-4.5', '-(-5.6)', '-"22"'],
+  seealso: ['add', 'subtract', 'unaryPlus']
+};
+exports.unaryMinusDocs = unaryMinusDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..4b4bb24
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryPlus.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryPlusDocs = void 0;
+var unaryPlusDocs = {
+  name: 'unaryPlus',
+  category: 'Operators',
+  syntax: ['+x', 'unaryPlus(x)'],
+  description: 'Converts booleans and strings to numbers.',
+  examples: ['+true', '+"2"'],
+  seealso: ['add', 'subtract', 'unaryMinus']
+};
+exports.unaryPlusDocs = unaryPlusDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..e238b8b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/xgcd.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xgcdDocs = void 0;
+var xgcdDocs = {
+  name: 'xgcd',
+  category: 'Arithmetic',
+  syntax: ['xgcd(a, b)'],
+  description: 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',
+  examples: ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],
+  seealso: ['gcd', 'lcm']
+};
+exports.xgcdDocs = xgcdDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..640b6da
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitAnd.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndDocs = void 0;
+var bitAndDocs = {
+  name: 'bitAnd',
+  category: 'Bitwise',
+  syntax: ['x & y', 'bitAnd(x, y)'],
+  description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',
+  examples: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],
+  seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
+exports.bitAndDocs = bitAndDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitNot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitNot.js
new file mode 100644
index 0000000..96f8e64
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitNot.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitNotDocs = void 0;
+var bitNotDocs = {
+  name: 'bitNot',
+  category: 'Bitwise',
+  syntax: ['~x', 'bitNot(x)'],
+  description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',
+  examples: ['~1', '~2', 'bitNot([2, -3, 4])'],
+  seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
+exports.bitNotDocs = bitNotDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitOr.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitOr.js
new file mode 100644
index 0000000..2e79d16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitOr.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitOrDocs = void 0;
+var bitOrDocs = {
+  name: 'bitOr',
+  category: 'Bitwise',
+  syntax: ['x | y', 'bitOr(x, y)'],
+  description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',
+  examples: ['5 | 3', 'bitOr([1, 2, 3], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
+exports.bitOrDocs = bitOrDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitXor.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitXor.js
new file mode 100644
index 0000000..4bb88a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitXor.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitXorDocs = void 0;
+var bitXorDocs = {
+  name: 'bitXor',
+  category: 'Bitwise',
+  syntax: ['bitXor(x, y)'],
+  description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',
+  examples: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
+exports.bitXorDocs = bitXorDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/leftShift.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/leftShift.js
new file mode 100644
index 0000000..ba6e7fa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/leftShift.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leftShiftDocs = void 0;
+var leftShiftDocs = {
+  name: 'leftShift',
+  category: 'Bitwise',
+  syntax: ['x << y', 'leftShift(x, y)'],
+  description: 'Bitwise left logical shift of a value x by y number of bits.',
+  examples: ['4 << 1', '8 >> 1'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']
+};
+exports.leftShiftDocs = leftShiftDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..1336a99
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightArithShift.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightArithShiftDocs = void 0;
+var rightArithShiftDocs = {
+  name: 'rightArithShift',
+  category: 'Bitwise',
+  syntax: ['x >> y', 'rightArithShift(x, y)'],
+  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',
+  examples: ['8 >> 1', '4 << 1', '-12 >> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']
+};
+exports.rightArithShiftDocs = rightArithShiftDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..acc2832
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightLogShift.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightLogShiftDocs = void 0;
+var rightLogShiftDocs = {
+  name: 'rightLogShift',
+  category: 'Bitwise',
+  syntax: ['x >>> y', 'rightLogShift(x, y)'],
+  description: 'Bitwise right logical shift of a value x by y number of bits.',
+  examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']
+};
+exports.rightLogShiftDocs = rightLogShiftDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..6937a4e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/bellNumbers.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bellNumbersDocs = void 0;
+var bellNumbersDocs = {
+  name: 'bellNumbers',
+  category: 'Combinatorics',
+  syntax: ['bellNumbers(n)'],
+  description: 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['bellNumbers(3)', 'bellNumbers(8)'],
+  seealso: ['stirlingS2']
+};
+exports.bellNumbersDocs = bellNumbersDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/catalan.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/catalan.js
new file mode 100644
index 0000000..df0de38
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/catalan.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.catalanDocs = void 0;
+var catalanDocs = {
+  name: 'catalan',
+  category: 'Combinatorics',
+  syntax: ['catalan(n)'],
+  description: 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['catalan(3)', 'catalan(8)'],
+  seealso: ['bellNumbers']
+};
+exports.catalanDocs = catalanDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/composition.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/composition.js
new file mode 100644
index 0000000..af85182
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/composition.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compositionDocs = void 0;
+var compositionDocs = {
+  name: 'composition',
+  category: 'Combinatorics',
+  syntax: ['composition(n, k)'],
+  description: 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',
+  examples: ['composition(5, 3)'],
+  seealso: ['combinations']
+};
+exports.compositionDocs = compositionDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..40d0a4c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/stirlingS2.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stirlingS2Docs = void 0;
+var stirlingS2Docs = {
+  name: 'stirlingS2',
+  category: 'Combinatorics',
+  syntax: ['stirlingS2(n, k)'],
+  description: 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',
+  examples: ['stirlingS2(5, 3)'],
+  seealso: ['bellNumbers']
+};
+exports.stirlingS2Docs = stirlingS2Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/arg.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/arg.js
new file mode 100644
index 0000000..0480713
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/arg.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.argDocs = void 0;
+var argDocs = {
+  name: 'arg',
+  category: 'Complex',
+  syntax: ['arg(x)'],
+  description: 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',
+  examples: ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],
+  seealso: ['re', 'im', 'conj', 'abs']
+};
+exports.argDocs = argDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/conj.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/conj.js
new file mode 100644
index 0000000..9334bf9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/conj.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.conjDocs = void 0;
+var conjDocs = {
+  name: 'conj',
+  category: 'Complex',
+  syntax: ['conj(x)'],
+  description: 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',
+  examples: ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],
+  seealso: ['re', 'im', 'abs', 'arg']
+};
+exports.conjDocs = conjDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/im.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/im.js
new file mode 100644
index 0000000..d8f1e05
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/im.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.imDocs = void 0;
+var imDocs = {
+  name: 'im',
+  category: 'Complex',
+  syntax: ['im(x)'],
+  description: 'Get the imaginary part of a complex number.',
+  examples: ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],
+  seealso: ['re', 'conj', 'abs', 'arg']
+};
+exports.imDocs = imDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/re.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/re.js
new file mode 100644
index 0000000..65fb3f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/re.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reDocs = void 0;
+var reDocs = {
+  name: 're',
+  category: 'Complex',
+  syntax: ['re(x)'],
+  description: 'Get the real part of a complex number.',
+  examples: ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],
+  seealso: ['im', 'conj', 'abs', 'arg']
+};
+exports.reDocs = reDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/evaluate.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/evaluate.js
new file mode 100644
index 0000000..7fd5b25
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/evaluate.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.evaluateDocs = void 0;
+var evaluateDocs = {
+  name: 'evaluate',
+  category: 'Expression',
+  syntax: ['evaluate(expression)', 'evaluate([expr1, expr2, expr3, ...])'],
+  description: 'Evaluate an expression or an array with expressions.',
+  examples: ['evaluate("2 + 3")', 'evaluate("sqrt(" + 4 + ")")'],
+  seealso: []
+};
+exports.evaluateDocs = evaluateDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/help.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/help.js
new file mode 100644
index 0000000..d272f13
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/help.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.helpDocs = void 0;
+var helpDocs = {
+  name: 'help',
+  category: 'Expression',
+  syntax: ['help(object)', 'help(string)'],
+  description: 'Display documentation on a function or data type.',
+  examples: ['help(sqrt)', 'help("complex")'],
+  seealso: []
+};
+exports.helpDocs = helpDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/distance.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/distance.js
new file mode 100644
index 0000000..497e3c0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/distance.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.distanceDocs = void 0;
+var distanceDocs = {
+  name: 'distance',
+  category: 'Geometry',
+  syntax: ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2]])'],
+  description: 'Calculates the Euclidean distance between two points.',
+  examples: ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],
+  seealso: []
+};
+exports.distanceDocs = distanceDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/intersect.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/intersect.js
new file mode 100644
index 0000000..027a53a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/intersect.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.intersectDocs = void 0;
+var intersectDocs = {
+  name: 'intersect',
+  category: 'Geometry',
+  syntax: ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],
+  description: 'Computes the intersection point of lines and/or planes.',
+  examples: ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'],
+  seealso: []
+};
+exports.intersectDocs = intersectDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/and.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/and.js
new file mode 100644
index 0000000..e7a5e69
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/and.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andDocs = void 0;
+var andDocs = {
+  name: 'and',
+  category: 'Logical',
+  syntax: ['x and y', 'and(x, y)'],
+  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',
+  examples: ['true and false', 'true and true', '2 and 4'],
+  seealso: ['not', 'or', 'xor']
+};
+exports.andDocs = andDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/not.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/not.js
new file mode 100644
index 0000000..89bf672
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/not.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.notDocs = void 0;
+var notDocs = {
+  name: 'not',
+  category: 'Logical',
+  syntax: ['not x', 'not(x)'],
+  description: 'Logical not. Flips the boolean value of given argument.',
+  examples: ['not true', 'not false', 'not 2', 'not 0'],
+  seealso: ['and', 'or', 'xor']
+};
+exports.notDocs = notDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/or.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/or.js
new file mode 100644
index 0000000..d11730a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/or.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.orDocs = void 0;
+var orDocs = {
+  name: 'or',
+  category: 'Logical',
+  syntax: ['x or y', 'or(x, y)'],
+  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',
+  examples: ['true or false', 'false or false', '0 or 4'],
+  seealso: ['not', 'and', 'xor']
+};
+exports.orDocs = orDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/xor.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/xor.js
new file mode 100644
index 0000000..609dd8a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/xor.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xorDocs = void 0;
+var xorDocs = {
+  name: 'xor',
+  category: 'Logical',
+  syntax: ['x xor y', 'xor(x, y)'],
+  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',
+  examples: ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],
+  seealso: ['not', 'and', 'or']
+};
+exports.xorDocs = xorDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/column.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/column.js
new file mode 100644
index 0000000..87a0c3a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/column.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.columnDocs = void 0;
+var columnDocs = {
+  name: 'column',
+  category: 'Matrix',
+  syntax: ['column(x, index)'],
+  description: 'Return a column from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],
+  seealso: ['row', 'matrixFromColumns']
+};
+exports.columnDocs = columnDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/concat.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/concat.js
new file mode 100644
index 0000000..1df5cdd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/concat.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.concatDocs = void 0;
+var concatDocs = {
+  name: 'concat',
+  category: 'Matrix',
+  syntax: ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],
+  description: 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',
+  examples: ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],
+  seealso: ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.concatDocs = concatDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/count.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/count.js
new file mode 100644
index 0000000..767b5cc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/count.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.countDocs = void 0;
+var countDocs = {
+  name: 'count',
+  category: 'Matrix',
+  syntax: ['count(x)'],
+  description: 'Count the number of elements of a matrix, array or string.',
+  examples: ['a = [1, 2; 3, 4; 5, 6]', 'count(a)', 'size(a)', 'count("hello world")'],
+  seealso: ['size']
+};
+exports.countDocs = countDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/cross.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/cross.js
new file mode 100644
index 0000000..0988d71
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/cross.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.crossDocs = void 0;
+var crossDocs = {
+  name: 'cross',
+  category: 'Matrix',
+  syntax: ['cross(A, B)'],
+  description: 'Calculate the cross product for two vectors in three dimensional space.',
+  examples: ['cross([1, 1, 0],  [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4],  [5, 6, 7])'],
+  seealso: ['multiply', 'dot']
+};
+exports.crossDocs = crossDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ctranspose.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ctranspose.js
new file mode 100644
index 0000000..b069ad4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ctranspose.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ctransposeDocs = void 0;
+var ctransposeDocs = {
+  name: 'ctranspose',
+  category: 'Matrix',
+  syntax: ['x\'', 'ctranspose(x)'],
+  description: 'Complex Conjugate and Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'ctranspose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
+exports.ctransposeDocs = ctransposeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/det.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/det.js
new file mode 100644
index 0000000..f4c869a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/det.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.detDocs = void 0;
+var detDocs = {
+  name: 'det',
+  category: 'Matrix',
+  syntax: ['det(x)'],
+  description: 'Calculate the determinant of a matrix',
+  examples: ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],
+  seealso: ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.detDocs = detDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diag.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diag.js
new file mode 100644
index 0000000..74af0e7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diag.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diagDocs = void 0;
+var diagDocs = {
+  name: 'diag',
+  category: 'Matrix',
+  syntax: ['diag(x)', 'diag(x, k)'],
+  description: 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',
+  examples: ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],
+  seealso: ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.diagDocs = diagDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diff.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diff.js
new file mode 100644
index 0000000..05f24b9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diff.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diffDocs = void 0;
+var diffDocs = {
+  name: 'diff',
+  category: 'Matrix',
+  syntax: ['diff(arr)', 'diff(arr, dim)'],
+  description: ['Create a new matrix or array with the difference of the passed matrix or array.', 'Dim parameter is optional and used to indicant the dimension of the array/matrix to apply the difference', 'If no dimension parameter is passed it is assumed as dimension 0', 'Dimension is zero-based in javascript and one-based in the parser', 'Arrays must be \'rectangular\' meaning arrays like [1, 2]', 'If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays'],
+  examples: ['diff([1, 2, 4, 7, 0])', 'diff([1, 2, 4, 7, 0], 0)', 'diff(matrix([1, 2, 4, 7, 0]))', 'diff([[1, 2], [3, 4]])', 'diff([[1, 2], [3, 4]], 0)', 'diff([[1, 2], [3, 4]], 1)', 'diff([[1, 2], [3, 4]], bignumber(1))', 'diff(matrix([[1, 2], [3, 4]]), 1)', 'diff([[1, 2], matrix([3, 4])], 1)'],
+  seealso: ['subtract', 'partitionSelect']
+};
+exports.diffDocs = diffDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/dot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/dot.js
new file mode 100644
index 0000000..6b3bff1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/dot.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDocs = void 0;
+var dotDocs = {
+  name: 'dot',
+  category: 'Matrix',
+  syntax: ['dot(A, B)', 'A * B'],
+  description: 'Calculate the dot product of two vectors. ' + 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',
+  examples: ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],
+  seealso: ['multiply', 'cross']
+};
+exports.dotDocs = dotDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/eigs.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/eigs.js
new file mode 100644
index 0000000..09d5772
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/eigs.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eigsDocs = void 0;
+var eigsDocs = {
+  name: 'eigs',
+  category: 'Matrix',
+  syntax: ['eigs(x)'],
+  description: 'Calculate the eigenvalues and eigenvectors of a real symmetric matrix',
+  examples: ['eigs([[5, 2.3], [2.3, 1]])'],
+  seealso: ['inv']
+};
+exports.eigsDocs = eigsDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/filter.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/filter.js
new file mode 100644
index 0000000..505666a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/filter.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterDocs = void 0;
+var filterDocs = {
+  name: 'filter',
+  category: 'Matrix',
+  syntax: ['filter(x, test)'],
+  description: 'Filter items in a matrix.',
+  examples: ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],
+  seealso: ['sort', 'map', 'forEach']
+};
+exports.filterDocs = filterDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/flatten.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/flatten.js
new file mode 100644
index 0000000..3c29b11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/flatten.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.flattenDocs = void 0;
+var flattenDocs = {
+  name: 'flatten',
+  category: 'Matrix',
+  syntax: ['flatten(x)'],
+  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],
+  seealso: ['concat', 'resize', 'size', 'squeeze']
+};
+exports.flattenDocs = flattenDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/forEach.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/forEach.js
new file mode 100644
index 0000000..eae5fbb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/forEach.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachDocs = void 0;
+var forEachDocs = {
+  name: 'forEach',
+  category: 'Matrix',
+  syntax: ['forEach(x, callback)'],
+  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',
+  examples: ['numberOfPets = {}', 'addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;', 'forEach(["Dog","Cat","Cat"], addPet)', 'numberOfPets'],
+  seealso: ['map', 'sort', 'filter']
+};
+exports.forEachDocs = forEachDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..bc37b9f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/getMatrixDataType.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getMatrixDataTypeDocs = void 0;
+var getMatrixDataTypeDocs = {
+  name: 'getMatrixDataType',
+  category: 'Matrix',
+  syntax: ['getMatrixDataType(x)'],
+  description: 'Find the data type of all elements in a matrix or array, ' + 'for example "number" if all items are a number ' + 'and "Complex" if all values are complex numbers. ' + 'If a matrix contains more than one data type, it will return "mixed".',
+  examples: ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, "text"])', 'getMatrixDataType([1, bignumber(4)])'],
+  seealso: ['matrix', 'sparse', 'typeOf']
+};
+exports.getMatrixDataTypeDocs = getMatrixDataTypeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/identity.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/identity.js
new file mode 100644
index 0000000..a39508d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/identity.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.identityDocs = void 0;
+var identityDocs = {
+  name: 'identity',
+  category: 'Matrix',
+  syntax: ['identity(n)', 'identity(m, n)', 'identity([m, n])'],
+  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',
+  examples: ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.identityDocs = identityDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/inv.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/inv.js
new file mode 100644
index 0000000..9c643ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/inv.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invDocs = void 0;
+var invDocs = {
+  name: 'inv',
+  category: 'Matrix',
+  syntax: ['inv(x)'],
+  description: 'Calculate the inverse of a matrix',
+  examples: ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.invDocs = invDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/kron.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/kron.js
new file mode 100644
index 0000000..cdf1cf7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/kron.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kronDocs = void 0;
+var kronDocs = {
+  name: 'kron',
+  category: 'Matrix',
+  syntax: ['kron(x, y)'],
+  description: 'Calculates the kronecker product of 2 matrices or vectors.',
+  examples: ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],
+  seealso: ['multiply', 'dot', 'cross']
+};
+exports.kronDocs = kronDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/map.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/map.js
new file mode 100644
index 0000000..f36a82f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/map.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapDocs = void 0;
+var mapDocs = {
+  name: 'map',
+  category: 'Matrix',
+  syntax: ['map(x, callback)'],
+  description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.',
+  examples: ['map([1, 2, 3], square)'],
+  seealso: ['filter', 'forEach']
+};
+exports.mapDocs = mapDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..a4afaf0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromColumns.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromColumnsDocs = void 0;
+var matrixFromColumnsDocs = {
+  name: 'matrixFromColumns',
+  category: 'Matrix',
+  syntax: ['math.matrixFromColumns(...arr)', 'math.matrixFromColumns(row1, row2)', 'math.matrixFromColumns(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual columns.',
+  examples: ['matrixFromColumns([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromFunction', 'zeros']
+};
+exports.matrixFromColumnsDocs = matrixFromColumnsDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..5732f62
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromFunction.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromFunctionDocs = void 0;
+var matrixFromFunctionDocs = {
+  name: 'matrixFromFunction',
+  category: 'Matrix',
+  syntax: ['math.matrixFromFunction(size, fn)', 'math.matrixFromFunction(size, fn, format)', 'math.matrixFromFunction(size, fn, format, datatype)', 'math.matrixFromFunction(size, format, fn)', 'math.matrixFromFunction(size, format, datatype, fn)'],
+  description: 'Create a matrix by evaluating a generating function at each index.',
+  examples: ['f(I) = I[1] - I[2]', 'matrixFromFunction([3,3], f)', 'g(I) = I[1] - I[2] == 1 ? 4 : 0', 'matrixFromFunction([100, 100], "sparse", g)', 'matrixFromFunction([5], random)'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromColumns', 'zeros']
+};
+exports.matrixFromFunctionDocs = matrixFromFunctionDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..95a89ad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromRows.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromRowsDocs = void 0;
+var matrixFromRowsDocs = {
+  name: 'matrixFromRows',
+  category: 'Matrix',
+  syntax: ['math.matrixFromRows(...arr)', 'math.matrixFromRows(row1, row2)', 'math.matrixFromRows(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual rows.',
+  examples: ['matrixFromRows([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromColumns', 'matrixFromFunction', 'zeros']
+};
+exports.matrixFromRowsDocs = matrixFromRowsDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ones.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ones.js
new file mode 100644
index 0000000..b69c331
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ones.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.onesDocs = void 0;
+var onesDocs = {
+  name: 'ones',
+  category: 'Matrix',
+  syntax: ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],
+  description: 'Create a matrix containing ones.',
+  examples: ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.onesDocs = onesDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..8901da0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/partitionSelect.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.partitionSelectDocs = void 0;
+var partitionSelectDocs = {
+  name: 'partitionSelect',
+  category: 'Matrix',
+  syntax: ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],
+  description: 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',
+  examples: ['partitionSelect([5, 10, 1], 2)', 'partitionSelect(["C", "B", "A", "D"], 1)'],
+  seealso: ['sort']
+};
+exports.partitionSelectDocs = partitionSelectDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/range.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/range.js
new file mode 100644
index 0000000..28ac46e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/range.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeDocs = void 0;
+var rangeDocs = {
+  name: 'range',
+  category: 'Type',
+  syntax: ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],
+  description: 'Create a range. Lower bound of the range is included, upper bound is excluded.',
+  examples: ['1:5', '3:-1:-3', 'range(3, 7)', 'range(0, 12, 2)', 'range("4:10")', 'a = [1, 2, 3, 4; 5, 6, 7, 8]', 'a[1:2, 1:2]'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.rangeDocs = rangeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/reshape.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/reshape.js
new file mode 100644
index 0000000..87cc034
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/reshape.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reshapeDocs = void 0;
+var reshapeDocs = {
+  name: 'reshape',
+  category: 'Matrix',
+  syntax: ['reshape(x, sizes)'],
+  description: 'Reshape a multi dimensional array to fit the specified dimensions.',
+  examples: ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])'],
+  seealso: ['size', 'squeeze', 'resize']
+};
+exports.reshapeDocs = reshapeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/resize.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/resize.js
new file mode 100644
index 0000000..86bb660
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/resize.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resizeDocs = void 0;
+var resizeDocs = {
+  name: 'resize',
+  category: 'Matrix',
+  syntax: ['resize(x, size)', 'resize(x, size, defaultValue)'],
+  description: 'Resize a matrix.',
+  examples: ['resize([1,2,3,4,5], [3])', 'resize([1,2,3], [5])', 'resize([1,2,3], [5], -1)', 'resize(2, [2, 3])', 'resize("hello", [8], "!")'],
+  seealso: ['size', 'subset', 'squeeze', 'reshape']
+};
+exports.resizeDocs = resizeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotate.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotate.js
new file mode 100644
index 0000000..32035fa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotate.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotateDocs = void 0;
+var rotateDocs = {
+  name: 'rotate',
+  category: 'Matrix',
+  syntax: ['rotate(w, theta)', 'rotate(w, theta, v)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotate([1, 0], math.pi / 2)', 'rotate(matrix([1, 0]), unit("35deg"))', 'rotate([1, 0, 0], unit("90deg"), [0, 0, 1])', 'rotate(matrix([1, 0, 0]), unit("90deg"), matrix([0, 0, 1]))'],
+  seealso: ['matrix', 'rotationMatrix']
+};
+exports.rotateDocs = rotateDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..ab96ede
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotationMatrix.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotationMatrixDocs = void 0;
+var rotationMatrixDocs = {
+  name: 'rotationMatrix',
+  category: 'Matrix',
+  syntax: ['rotationMatrix(theta)', 'rotationMatrix(theta, v)', 'rotationMatrix(theta, v, format)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotationMatrix(pi / 2)', 'rotationMatrix(unit("45deg"), [0, 0, 1])', 'rotationMatrix(1, matrix([0, 0, 1]), "sparse")'],
+  seealso: ['cos', 'sin']
+};
+exports.rotationMatrixDocs = rotationMatrixDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/row.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/row.js
new file mode 100644
index 0000000..a938042
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/row.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rowDocs = void 0;
+var rowDocs = {
+  name: 'row',
+  category: 'Matrix',
+  syntax: ['row(x, index)'],
+  description: 'Return a row from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],
+  seealso: ['column', 'matrixFromRows']
+};
+exports.rowDocs = rowDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/size.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/size.js
new file mode 100644
index 0000000..c24c29f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/size.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sizeDocs = void 0;
+var sizeDocs = {
+  name: 'size',
+  category: 'Matrix',
+  syntax: ['size(x)'],
+  description: 'Calculate the size of a matrix.',
+  examples: ['size(2.3)', 'size("hello world")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],
+  seealso: ['concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.sizeDocs = sizeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sort.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sort.js
new file mode 100644
index 0000000..ad41a97
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sort.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sortDocs = void 0;
+var sortDocs = {
+  name: 'sort',
+  category: 'Matrix',
+  syntax: ['sort(x)', 'sort(x, compare)'],
+  description: 'Sort the items in a matrix. Compare can be a string "asc", "desc", "natural", or a custom sort function.',
+  examples: ['sort([5, 10, 1])', 'sort(["C", "B", "A", "D"])', 'sortByLength(a, b) = size(a)[1] - size(b)[1]', 'sort(["Langdon", "Tom", "Sara"], sortByLength)', 'sort(["10", "1", "2"], "natural")'],
+  seealso: ['map', 'filter', 'forEach']
+};
+exports.sortDocs = sortDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/squeeze.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/squeeze.js
new file mode 100644
index 0000000..ea116d6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/squeeze.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squeezeDocs = void 0;
+var squeezeDocs = {
+  name: 'squeeze',
+  category: 'Matrix',
+  syntax: ['squeeze(x)'],
+  description: 'Remove inner and outer singleton dimensions from a matrix.',
+  examples: ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']
+};
+exports.squeezeDocs = squeezeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/subset.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/subset.js
new file mode 100644
index 0000000..a5eeb09
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/subset.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetDocs = void 0;
+var subsetDocs = {
+  name: 'subset',
+  category: 'Matrix',
+  syntax: ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],
+  description: 'Get or set a subset of the entries of a matrix or ' + 'characters of a string. ' + 'Indexes are one-based. There should be one index specification for ' + 'each dimension of the target. Each specification can be a single ' + 'index, a list of indices, or a range in colon notation `l:u`. ' + 'In a range, both the lower bound l and upper bound u are included; ' + 'and if a bound is omitted it defaults to the most extreme valid value. ' + 'The cartesian product of the indices specified in each dimension ' + 'determines the target of the operation.',
+  examples: ['d = [1, 2; 3, 4]', 'e = []', 'e[1, 1:2] = [5, 6]', 'e[2, :] = [7, 8]', 'f = d * e', 'f[2, 1]', 'f[:, 1]', 'f[[1,2], [1,3]] = [9, 10; 11, 12]', 'f'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']
+};
+exports.subsetDocs = subsetDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/trace.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/trace.js
new file mode 100644
index 0000000..0dbd1bd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/trace.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.traceDocs = void 0;
+var traceDocs = {
+  name: 'trace',
+  category: 'Matrix',
+  syntax: ['trace(A)'],
+  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',
+  examples: ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']
+};
+exports.traceDocs = traceDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/transpose.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/transpose.js
new file mode 100644
index 0000000..762f1ea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/transpose.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.transposeDocs = void 0;
+var transposeDocs = {
+  name: 'transpose',
+  category: 'Matrix',
+  syntax: ['x\'', 'transpose(x)'],
+  description: 'Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'transpose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
+exports.transposeDocs = transposeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/zeros.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/zeros.js
new file mode 100644
index 0000000..a4ed2d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/zeros.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zerosDocs = void 0;
+var zerosDocs = {
+  name: 'zeros',
+  category: 'Matrix',
+  syntax: ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],
+  description: 'Create a matrix containing zeros.',
+  examples: ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']
+};
+exports.zerosDocs = zerosDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinations.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinations.js
new file mode 100644
index 0000000..db328b9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinations.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsDocs = void 0;
+var combinationsDocs = {
+  name: 'combinations',
+  category: 'Probability',
+  syntax: ['combinations(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time',
+  examples: ['combinations(7, 5)'],
+  seealso: ['combinationsWithRep', 'permutations', 'factorial']
+};
+exports.combinationsDocs = combinationsDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..b9942e5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinationsWithRep.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsWithRepDocs = void 0;
+var combinationsWithRepDocs = {
+  name: 'combinationsWithRep',
+  category: 'Probability',
+  syntax: ['combinationsWithRep(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time with replacements.',
+  examples: ['combinationsWithRep(7, 5)'],
+  seealso: ['combinations', 'permutations', 'factorial']
+};
+exports.combinationsWithRepDocs = combinationsWithRepDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/distribution.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/distribution.js
new file mode 100644
index 0000000..ec26ee8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/distribution.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.distributionDocs = void 0;
+var distributionDocs = {
+  name: 'distribution',
+  category: 'Probability',
+  syntax: ['distribution(name)', 'distribution(name, arg1, arg2, ...)'],
+  description: 'Create a distribution object of a specific type. ' + 'A distribution object contains functions `random([size,] [min,] [max])`, ' + '`randomInt([size,] [min,] [max])` and `pickRandom(array)`. ' + 'Available types of distributions: "uniform", "normal". ' + 'Note that the function distribution is currently not available via the expression parser.',
+  examples: [],
+  seealso: ['random', 'randomInt']
+};
+exports.distributionDocs = distributionDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/factorial.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/factorial.js
new file mode 100644
index 0000000..499e946
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/factorial.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.factorialDocs = void 0;
+var factorialDocs = {
+  name: 'factorial',
+  category: 'Probability',
+  syntax: ['n!', 'factorial(n)'],
+  description: 'Compute the factorial of a value',
+  examples: ['5!', '5 * 4 * 3 * 2 * 1', '3!'],
+  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']
+};
+exports.factorialDocs = factorialDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/gamma.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/gamma.js
new file mode 100644
index 0000000..63994c4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/gamma.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaDocs = void 0;
+var gammaDocs = {
+  name: 'gamma',
+  category: 'Probability',
+  syntax: ['gamma(n)'],
+  description: 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',
+  examples: ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],
+  seealso: ['factorial']
+};
+exports.gammaDocs = gammaDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/kldivergence.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/kldivergence.js
new file mode 100644
index 0000000..466feaa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/kldivergence.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kldivergenceDocs = void 0;
+var kldivergenceDocs = {
+  name: 'kldivergence',
+  category: 'Probability',
+  syntax: ['kldivergence(x, y)'],
+  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',
+  examples: ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],
+  seealso: []
+};
+exports.kldivergenceDocs = kldivergenceDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/multinomial.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/multinomial.js
new file mode 100644
index 0000000..5b46980
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/multinomial.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multinomialDocs = void 0;
+var multinomialDocs = {
+  name: 'multinomial',
+  category: 'Probability',
+  syntax: ['multinomial(A)'],
+  description: 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',
+  examples: ['multinomial([1, 2, 1])'],
+  seealso: ['combinations', 'factorial']
+};
+exports.multinomialDocs = multinomialDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/permutations.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/permutations.js
new file mode 100644
index 0000000..161bfd0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/permutations.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.permutationsDocs = void 0;
+var permutationsDocs = {
+  name: 'permutations',
+  category: 'Probability',
+  syntax: ['permutations(n)', 'permutations(n, k)'],
+  description: 'Compute the number of permutations of n items taken k at a time',
+  examples: ['permutations(5)', 'permutations(5, 3)'],
+  seealso: ['combinations', 'combinationsWithRep', 'factorial']
+};
+exports.permutationsDocs = permutationsDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/pickRandom.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/pickRandom.js
new file mode 100644
index 0000000..25dcd9b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/pickRandom.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pickRandomDocs = void 0;
+var pickRandomDocs = {
+  name: 'pickRandom',
+  category: 'Probability',
+  syntax: ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],
+  description: 'Pick a random entry from a given array.',
+  examples: ['pickRandom(0:10)', 'pickRandom([1, 3, 1, 6])', 'pickRandom([1, 3, 1, 6], 2)', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'],
+  seealso: ['random', 'randomInt']
+};
+exports.pickRandomDocs = pickRandomDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/random.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/random.js
new file mode 100644
index 0000000..e91783f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/random.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomDocs = void 0;
+var randomDocs = {
+  name: 'random',
+  category: 'Probability',
+  syntax: ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],
+  description: 'Return a random number.',
+  examples: ['random()', 'random(10, 20)', 'random([2, 3])'],
+  seealso: ['pickRandom', 'randomInt']
+};
+exports.randomDocs = randomDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/randomInt.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/randomInt.js
new file mode 100644
index 0000000..a8272e8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/randomInt.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomIntDocs = void 0;
+var randomIntDocs = {
+  name: 'randomInt',
+  category: 'Probability',
+  syntax: ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],
+  description: 'Return a random integer number',
+  examples: ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],
+  seealso: ['pickRandom', 'random']
+};
+exports.randomIntDocs = randomIntDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compare.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compare.js
new file mode 100644
index 0000000..0f8e9ce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compare.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareDocs = void 0;
+var compareDocs = {
+  name: 'compare',
+  category: 'Relational',
+  syntax: ['compare(x, y)'],
+  description: 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']
+};
+exports.compareDocs = compareDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareNatural.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareNatural.js
new file mode 100644
index 0000000..cb3d85e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareNatural.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareNaturalDocs = void 0;
+var compareNaturalDocs = {
+  name: 'compareNatural',
+  category: 'Relational',
+  syntax: ['compareNatural(x, y)'],
+  description: 'Compare two values of any type in a deterministic, natural way. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareNatural(2, 3)', 'compareNatural(3, 2)', 'compareNatural(2, 2)', 'compareNatural(5cm, 40mm)', 'compareNatural("2", "10")', 'compareNatural(2 + 3i, 2 + 4i)', 'compareNatural([1, 2, 4], [1, 2, 3])', 'compareNatural([1, 5], [1, 2, 3])', 'compareNatural([1, 2], [1, 2])', 'compareNatural({a: 2}, {a: 4})'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']
+};
+exports.compareNaturalDocs = compareNaturalDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareText.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareText.js
new file mode 100644
index 0000000..645405a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareText.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareTextDocs = void 0;
+var compareTextDocs = {
+  name: 'compareText',
+  category: 'Relational',
+  syntax: ['compareText(x, y)'],
+  description: 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareText("B", "A")', 'compareText("A", "B")', 'compareText("A", "A")', 'compareText("2", "10")', 'compare("2", "10")', 'compare(2, 10)', 'compareNatural("2", "10")', 'compareText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural']
+};
+exports.compareTextDocs = compareTextDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/deepEqual.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/deepEqual.js
new file mode 100644
index 0000000..58a8a3b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/deepEqual.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deepEqualDocs = void 0;
+var deepEqualDocs = {
+  name: 'deepEqual',
+  category: 'Relational',
+  syntax: ['deepEqual(x, y)'],
+  description: 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',
+  examples: ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
+exports.deepEqualDocs = deepEqualDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equal.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equal.js
new file mode 100644
index 0000000..2dcbab1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equal.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalDocs = void 0;
+var equalDocs = {
+  name: 'equal',
+  category: 'Relational',
+  syntax: ['x == y', 'equal(x, y)'],
+  description: 'Check equality of two values. Returns true if the values are equal, and false if not.',
+  examples: ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],
+  seealso: ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']
+};
+exports.equalDocs = equalDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equalText.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equalText.js
new file mode 100644
index 0000000..691260f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equalText.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalTextDocs = void 0;
+var equalTextDocs = {
+  name: 'equalText',
+  category: 'Relational',
+  syntax: ['equalText(x, y)'],
+  description: 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',
+  examples: ['equalText("Hello", "Hello")', 'equalText("a", "A")', 'equal("2e3", "2000")', 'equalText("2e3", "2000")', 'equalText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural', 'compareText', 'equal']
+};
+exports.equalTextDocs = equalTextDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/larger.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/larger.js
new file mode 100644
index 0000000..1eab8c5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/larger.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerDocs = void 0;
+var largerDocs = {
+  name: 'larger',
+  category: 'Relational',
+  syntax: ['x > y', 'larger(x, y)'],
+  description: 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.',
+  examples: ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']
+};
+exports.largerDocs = largerDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/largerEq.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/largerEq.js
new file mode 100644
index 0000000..e0c6a15
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/largerEq.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerEqDocs = void 0;
+var largerEqDocs = {
+  name: 'largerEq',
+  category: 'Relational',
+  syntax: ['x >= y', 'largerEq(x, y)'],
+  description: 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',
+  examples: ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],
+  seealso: ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']
+};
+exports.largerEqDocs = largerEqDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smaller.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smaller.js
new file mode 100644
index 0000000..2e93c16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smaller.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerDocs = void 0;
+var smallerDocs = {
+  name: 'smaller',
+  category: 'Relational',
+  syntax: ['x < y', 'smaller(x, y)'],
+  description: 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.',
+  examples: ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],
+  seealso: ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
+exports.smallerDocs = smallerDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smallerEq.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smallerEq.js
new file mode 100644
index 0000000..4246ffe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smallerEq.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerEqDocs = void 0;
+var smallerEqDocs = {
+  name: 'smallerEq',
+  category: 'Relational',
+  syntax: ['x <= y', 'smallerEq(x, y)'],
+  description: 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',
+  examples: ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],
+  seealso: ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']
+};
+exports.smallerEqDocs = smallerEqDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/unequal.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/unequal.js
new file mode 100644
index 0000000..3fda022
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/unequal.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unequalDocs = void 0;
+var unequalDocs = {
+  name: 'unequal',
+  category: 'Relational',
+  syntax: ['x != y', 'unequal(x, y)'],
+  description: 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',
+  examples: ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],
+  seealso: ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']
+};
+exports.unequalDocs = unequalDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setCartesian.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setCartesian.js
new file mode 100644
index 0000000..0355610
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setCartesian.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setCartesianDocs = void 0;
+var setCartesianDocs = {
+  name: 'setCartesian',
+  category: 'Set',
+  syntax: ['setCartesian(set1, set2)'],
+  description: 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.',
+  examples: ['setCartesian([1, 2], [3, 4])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']
+};
+exports.setCartesianDocs = setCartesianDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDifference.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDifference.js
new file mode 100644
index 0000000..fccaa04
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDifference.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDifferenceDocs = void 0;
+var setDifferenceDocs = {
+  name: 'setDifference',
+  category: 'Set',
+  syntax: ['setDifference(set1, set2)'],
+  description: 'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setSymDifference']
+};
+exports.setDifferenceDocs = setDifferenceDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDistinct.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDistinct.js
new file mode 100644
index 0000000..c03082a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDistinct.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDistinctDocs = void 0;
+var setDistinctDocs = {
+  name: 'setDistinct',
+  category: 'Set',
+  syntax: ['setDistinct(set)'],
+  description: 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setDistinct([1, 1, 1, 2, 2, 3])'],
+  seealso: ['setMultiplicity']
+};
+exports.setDistinctDocs = setDistinctDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIntersect.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIntersect.js
new file mode 100644
index 0000000..6baa045
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIntersect.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIntersectDocs = void 0;
+var setIntersectDocs = {
+  name: 'setIntersect',
+  category: 'Set',
+  syntax: ['setIntersect(set1, set2)'],
+  description: 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setDifference']
+};
+exports.setIntersectDocs = setIntersectDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIsSubset.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIsSubset.js
new file mode 100644
index 0000000..52fa09f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIsSubset.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIsSubsetDocs = void 0;
+var setIsSubsetDocs = {
+  name: 'setIsSubset',
+  category: 'Set',
+  syntax: ['setIsSubset(set1, set2)'],
+  description: 'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
+exports.setIsSubsetDocs = setIsSubsetDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setMultiplicity.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setMultiplicity.js
new file mode 100644
index 0000000..7270be4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setMultiplicity.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setMultiplicityDocs = void 0;
+var setMultiplicityDocs = {
+  name: 'setMultiplicity',
+  category: 'Set',
+  syntax: ['setMultiplicity(element, set)'],
+  description: 'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],
+  seealso: ['setDistinct', 'setSize']
+};
+exports.setMultiplicityDocs = setMultiplicityDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setPowerset.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setPowerset.js
new file mode 100644
index 0000000..89a9a94
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setPowerset.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setPowersetDocs = void 0;
+var setPowersetDocs = {
+  name: 'setPowerset',
+  category: 'Set',
+  syntax: ['setPowerset(set)'],
+  description: 'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setPowerset([1, 2, 3])'],
+  seealso: ['setCartesian']
+};
+exports.setPowersetDocs = setPowersetDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSize.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSize.js
new file mode 100644
index 0000000..1b93bcf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSize.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSizeDocs = void 0;
+var setSizeDocs = {
+  name: 'setSize',
+  category: 'Set',
+  syntax: ['setSize(set)', 'setSize(set, unique)'],
+  description: 'Count the number of elements of a (multi)set. When the second parameter "unique" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
+exports.setSizeDocs = setSizeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSymDifference.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSymDifference.js
new file mode 100644
index 0000000..9a6bb8c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSymDifference.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSymDifferenceDocs = void 0;
+var setSymDifferenceDocs = {
+  name: 'setSymDifference',
+  category: 'Set',
+  syntax: ['setSymDifference(set1, set2)'],
+  description: 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
+exports.setSymDifferenceDocs = setSymDifferenceDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setUnion.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setUnion.js
new file mode 100644
index 0000000..db49213
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setUnion.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setUnionDocs = void 0;
+var setUnionDocs = {
+  name: 'setUnion',
+  category: 'Set',
+  syntax: ['setUnion(set1, set2)'],
+  description: 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setIntersect', 'setDifference']
+};
+exports.setUnionDocs = setUnionDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/erf.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/erf.js
new file mode 100644
index 0000000..8e777e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/erf.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.erfDocs = void 0;
+var erfDocs = {
+  name: 'erf',
+  category: 'Special',
+  syntax: ['erf(x)'],
+  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',
+  examples: ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],
+  seealso: []
+};
+exports.erfDocs = erfDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/cumsum.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/cumsum.js
new file mode 100644
index 0000000..5aa6258
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/cumsum.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumSumDocs = void 0;
+var cumSumDocs = {
+  name: 'cumsum',
+  category: 'Statistics',
+  syntax: ['cumsum(a, b, c, ...)', 'cumsum(A)'],
+  description: 'Compute the cumulative sum of all values.',
+  examples: ['cumsum(2, 3, 4, 1)', 'cumsum([2, 3, 4, 1])', 'cumsum([1, 2; 3, 4])', 'cumsum([1, 2; 3, 4], 1)', 'cumsum([1, 2; 3, 4], 2)'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
+exports.cumSumDocs = cumSumDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mad.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mad.js
new file mode 100644
index 0000000..13941bd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mad.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.madDocs = void 0;
+var madDocs = {
+  name: 'mad',
+  category: 'Statistics',
+  syntax: ['mad(a, b, c, ...)', 'mad(A)'],
+  description: 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',
+  examples: ['mad(10, 20, 30)', 'mad([1, 2, 3])'],
+  seealso: ['mean', 'median', 'std', 'abs']
+};
+exports.madDocs = madDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/max.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/max.js
new file mode 100644
index 0000000..1112223
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/max.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxDocs = void 0;
+var maxDocs = {
+  name: 'max',
+  category: 'Statistics',
+  syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dim)'],
+  description: 'Compute the maximum value of a list of values.',
+  examples: ['max(2, 3, 4, 1)', 'max([2, 3, 4, 1])', 'max([2, 5; 4, 3])', 'max([2, 5; 4, 3], 1)', 'max([2, 5; 4, 3], 2)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
+exports.maxDocs = maxDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mean.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mean.js
new file mode 100644
index 0000000..1694599
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mean.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanDocs = void 0;
+var meanDocs = {
+  name: 'mean',
+  category: 'Statistics',
+  syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dim)'],
+  description: 'Compute the arithmetic mean of a list of values.',
+  examples: ['mean(2, 3, 4, 1)', 'mean([2, 3, 4, 1])', 'mean([2, 5; 4, 3])', 'mean([2, 5; 4, 3], 1)', 'mean([2, 5; 4, 3], 2)', 'mean([1.0, 2.7, 3.2, 4.0])'],
+  seealso: ['max', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
+exports.meanDocs = meanDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/median.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/median.js
new file mode 100644
index 0000000..0f7c1f4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/median.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.medianDocs = void 0;
+var medianDocs = {
+  name: 'median',
+  category: 'Statistics',
+  syntax: ['median(a, b, c, ...)', 'median(A)'],
+  description: 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',
+  examples: ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],
+  seealso: ['max', 'mean', 'min', 'prod', 'std', 'sum', 'variance', 'quantileSeq']
+};
+exports.medianDocs = medianDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/min.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/min.js
new file mode 100644
index 0000000..fd0bac9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/min.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minDocs = void 0;
+var minDocs = {
+  name: 'min',
+  category: 'Statistics',
+  syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dim)'],
+  description: 'Compute the minimum value of a list of values.',
+  examples: ['min(2, 3, 4, 1)', 'min([2, 3, 4, 1])', 'min([2, 5; 4, 3])', 'min([2, 5; 4, 3], 1)', 'min([2, 5; 4, 3], 2)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['max', 'mean', 'median', 'prod', 'std', 'sum', 'variance']
+};
+exports.minDocs = minDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mode.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mode.js
new file mode 100644
index 0000000..258fbad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mode.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modeDocs = void 0;
+var modeDocs = {
+  name: 'mode',
+  category: 'Statistics',
+  syntax: ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],
+  description: 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',
+  examples: ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'variance']
+};
+exports.modeDocs = modeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/prod.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/prod.js
new file mode 100644
index 0000000..52ad2b6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/prod.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.prodDocs = void 0;
+var prodDocs = {
+  name: 'prod',
+  category: 'Statistics',
+  syntax: ['prod(a, b, c, ...)', 'prod(A)'],
+  description: 'Compute the product of all values.',
+  examples: ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'variance']
+};
+exports.prodDocs = prodDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..6306fb6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/quantileSeq.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantileSeqDocs = void 0;
+var quantileSeqDocs = {
+  name: 'quantileSeq',
+  category: 'Statistics',
+  syntax: ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],
+  description: 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probablity are: Number, BigNumber. \n\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',
+  examples: ['quantileSeq([3, -1, 5, 7], 0.5)', 'quantileSeq([3, -1, 5, 7], [1/3, 2/3])', 'quantileSeq([3, -1, 5, 7], 2)', 'quantileSeq([-1, 3, 5, 7], 0.5, true)'],
+  seealso: ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'variance']
+};
+exports.quantileSeqDocs = quantileSeqDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/std.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/std.js
new file mode 100644
index 0000000..98435b0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/std.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdDocs = void 0;
+var stdDocs = {
+  name: 'std',
+  category: 'Statistics',
+  syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, normalization)'],
+  description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['std(2, 4, 6)', 'std([2, 4, 6, 8])', 'std([2, 4, 6, 8], "uncorrected")', 'std([2, 4, 6, 8], "biased")', 'std([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'sum', 'variance']
+};
+exports.stdDocs = stdDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/sum.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/sum.js
new file mode 100644
index 0000000..2b47648
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/sum.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumDocs = void 0;
+var sumDocs = {
+  name: 'sum',
+  category: 'Statistics',
+  syntax: ['sum(a, b, c, ...)', 'sum(A)'],
+  description: 'Compute the sum of all values.',
+  examples: ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
+exports.sumDocs = sumDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/variance.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/variance.js
new file mode 100644
index 0000000..a442a8a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/variance.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceDocs = void 0;
+var varianceDocs = {
+  name: 'variance',
+  category: 'Statistics',
+  syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, normalization)'],
+  description: 'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['variance(2, 4, 6)', 'variance([2, 4, 6, 8])', 'variance([2, 4, 6, 8], "uncorrected")', 'variance([2, 4, 6, 8], "biased")', 'variance([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']
+};
+exports.varianceDocs = varianceDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acos.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acos.js
new file mode 100644
index 0000000..2662be8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acos.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosDocs = void 0;
+var acosDocs = {
+  name: 'acos',
+  category: 'Trigonometry',
+  syntax: ['acos(x)'],
+  description: 'Compute the inverse cosine of a value in radians.',
+  examples: ['acos(0.5)', 'acos(cos(2.3))'],
+  seealso: ['cos', 'atan', 'asin']
+};
+exports.acosDocs = acosDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acosh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acosh.js
new file mode 100644
index 0000000..a596020
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acosh.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acoshDocs = void 0;
+var acoshDocs = {
+  name: 'acosh',
+  category: 'Trigonometry',
+  syntax: ['acosh(x)'],
+  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',
+  examples: ['acosh(1.5)'],
+  seealso: ['cosh', 'asinh', 'atanh']
+};
+exports.acoshDocs = acoshDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acot.js
new file mode 100644
index 0000000..964d7eb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acot.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acotDocs = void 0;
+var acotDocs = {
+  name: 'acot',
+  category: 'Trigonometry',
+  syntax: ['acot(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],
+  seealso: ['cot', 'atan']
+};
+exports.acotDocs = acotDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acoth.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acoth.js
new file mode 100644
index 0000000..b62f40c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acoth.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acothDocs = void 0;
+var acothDocs = {
+  name: 'acoth',
+  category: 'Trigonometry',
+  syntax: ['acoth(x)'],
+  description: 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',
+  examples: ['acoth(2)', 'acoth(0.5)'],
+  seealso: ['acsch', 'asech']
+};
+exports.acothDocs = acothDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsc.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsc.js
new file mode 100644
index 0000000..76ba015
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsc.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acscDocs = void 0;
+var acscDocs = {
+  name: 'acsc',
+  category: 'Trigonometry',
+  syntax: ['acsc(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],
+  seealso: ['csc', 'asin', 'asec']
+};
+exports.acscDocs = acscDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsch.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsch.js
new file mode 100644
index 0000000..74e6f4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsch.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acschDocs = void 0;
+var acschDocs = {
+  name: 'acsch',
+  category: 'Trigonometry',
+  syntax: ['acsch(x)'],
+  description: 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',
+  examples: ['acsch(0.5)'],
+  seealso: ['asech', 'acoth']
+};
+exports.acschDocs = acschDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asec.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asec.js
new file mode 100644
index 0000000..cea69dc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asec.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asecDocs = void 0;
+var asecDocs = {
+  name: 'asec',
+  category: 'Trigonometry',
+  syntax: ['asec(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],
+  seealso: ['acos', 'acot', 'acsc']
+};
+exports.asecDocs = asecDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asech.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asech.js
new file mode 100644
index 0000000..32de712
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asech.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asechDocs = void 0;
+var asechDocs = {
+  name: 'asech',
+  category: 'Trigonometry',
+  syntax: ['asech(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asech(0.5)'],
+  seealso: ['acsch', 'acoth']
+};
+exports.asechDocs = asechDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asin.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asin.js
new file mode 100644
index 0000000..740b104
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asin.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinDocs = void 0;
+var asinDocs = {
+  name: 'asin',
+  category: 'Trigonometry',
+  syntax: ['asin(x)'],
+  description: 'Compute the inverse sine of a value in radians.',
+  examples: ['asin(0.5)', 'asin(sin(0.5))'],
+  seealso: ['sin', 'acos', 'atan']
+};
+exports.asinDocs = asinDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asinh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asinh.js
new file mode 100644
index 0000000..751bad5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asinh.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinhDocs = void 0;
+var asinhDocs = {
+  name: 'asinh',
+  category: 'Trigonometry',
+  syntax: ['asinh(x)'],
+  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',
+  examples: ['asinh(0.5)'],
+  seealso: ['acosh', 'atanh']
+};
+exports.asinhDocs = asinhDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan.js
new file mode 100644
index 0000000..6a65254
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanDocs = void 0;
+var atanDocs = {
+  name: 'atan',
+  category: 'Trigonometry',
+  syntax: ['atan(x)'],
+  description: 'Compute the inverse tangent of a value in radians.',
+  examples: ['atan(0.5)', 'atan(tan(0.5))'],
+  seealso: ['tan', 'acos', 'asin']
+};
+exports.atanDocs = atanDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan2.js
new file mode 100644
index 0000000..9150992
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan2.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atan2Docs = void 0;
+var atan2Docs = {
+  name: 'atan2',
+  category: 'Trigonometry',
+  syntax: ['atan2(y, x)'],
+  description: 'Computes the principal value of the arc tangent of y/x in radians.',
+  examples: ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],
+  seealso: ['sin', 'cos', 'tan']
+};
+exports.atan2Docs = atan2Docs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atanh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atanh.js
new file mode 100644
index 0000000..3932b8b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atanh.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanhDocs = void 0;
+var atanhDocs = {
+  name: 'atanh',
+  category: 'Trigonometry',
+  syntax: ['atanh(x)'],
+  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',
+  examples: ['atanh(0.5)'],
+  seealso: ['acosh', 'asinh']
+};
+exports.atanhDocs = atanhDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cos.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cos.js
new file mode 100644
index 0000000..a1378ae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cos.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cosDocs = void 0;
+var cosDocs = {
+  name: 'cos',
+  category: 'Trigonometry',
+  syntax: ['cos(x)'],
+  description: 'Compute the cosine of x in radians.',
+  examples: ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['acos', 'sin', 'tan']
+};
+exports.cosDocs = cosDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cosh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cosh.js
new file mode 100644
index 0000000..981a598
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cosh.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coshDocs = void 0;
+var coshDocs = {
+  name: 'cosh',
+  category: 'Trigonometry',
+  syntax: ['cosh(x)'],
+  description: 'Compute the hyperbolic cosine of x in radians.',
+  examples: ['cosh(0.5)'],
+  seealso: ['sinh', 'tanh', 'coth']
+};
+exports.coshDocs = coshDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cot.js
new file mode 100644
index 0000000..3f30f05
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cot.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cotDocs = void 0;
+var cotDocs = {
+  name: 'cot',
+  category: 'Trigonometry',
+  syntax: ['cot(x)'],
+  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',
+  examples: ['cot(2)', '1 / tan(2)'],
+  seealso: ['sec', 'csc', 'tan']
+};
+exports.cotDocs = cotDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/coth.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/coth.js
new file mode 100644
index 0000000..57b8380
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/coth.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cothDocs = void 0;
+var cothDocs = {
+  name: 'coth',
+  category: 'Trigonometry',
+  syntax: ['coth(x)'],
+  description: 'Compute the hyperbolic cotangent of x in radians.',
+  examples: ['coth(2)', '1 / tanh(2)'],
+  seealso: ['sech', 'csch', 'tanh']
+};
+exports.cothDocs = cothDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csc.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csc.js
new file mode 100644
index 0000000..207ea8b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csc.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cscDocs = void 0;
+var cscDocs = {
+  name: 'csc',
+  category: 'Trigonometry',
+  syntax: ['csc(x)'],
+  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',
+  examples: ['csc(2)', '1 / sin(2)'],
+  seealso: ['sec', 'cot', 'sin']
+};
+exports.cscDocs = cscDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csch.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csch.js
new file mode 100644
index 0000000..889e70d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csch.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cschDocs = void 0;
+var cschDocs = {
+  name: 'csch',
+  category: 'Trigonometry',
+  syntax: ['csch(x)'],
+  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',
+  examples: ['csch(2)', '1 / sinh(2)'],
+  seealso: ['sech', 'coth', 'sinh']
+};
+exports.cschDocs = cschDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sec.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sec.js
new file mode 100644
index 0000000..0a34404
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sec.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secDocs = void 0;
+var secDocs = {
+  name: 'sec',
+  category: 'Trigonometry',
+  syntax: ['sec(x)'],
+  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',
+  examples: ['sec(2)', '1 / cos(2)'],
+  seealso: ['cot', 'csc', 'cos']
+};
+exports.secDocs = secDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sech.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sech.js
new file mode 100644
index 0000000..75dfaf5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sech.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sechDocs = void 0;
+var sechDocs = {
+  name: 'sech',
+  category: 'Trigonometry',
+  syntax: ['sech(x)'],
+  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',
+  examples: ['sech(2)', '1 / cosh(2)'],
+  seealso: ['coth', 'csch', 'cosh']
+};
+exports.sechDocs = sechDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sin.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sin.js
new file mode 100644
index 0000000..348db19
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sin.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinDocs = void 0;
+var sinDocs = {
+  name: 'sin',
+  category: 'Trigonometry',
+  syntax: ['sin(x)'],
+  description: 'Compute the sine of x in radians.',
+  examples: ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['asin', 'cos', 'tan']
+};
+exports.sinDocs = sinDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sinh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sinh.js
new file mode 100644
index 0000000..af30992
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sinh.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinhDocs = void 0;
+var sinhDocs = {
+  name: 'sinh',
+  category: 'Trigonometry',
+  syntax: ['sinh(x)'],
+  description: 'Compute the hyperbolic sine of x in radians.',
+  examples: ['sinh(0.5)'],
+  seealso: ['cosh', 'tanh']
+};
+exports.sinhDocs = sinhDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tan.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tan.js
new file mode 100644
index 0000000..2510c59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tan.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanDocs = void 0;
+var tanDocs = {
+  name: 'tan',
+  category: 'Trigonometry',
+  syntax: ['tan(x)'],
+  description: 'Compute the tangent of x in radians.',
+  examples: ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],
+  seealso: ['atan', 'sin', 'cos']
+};
+exports.tanDocs = tanDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tanh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tanh.js
new file mode 100644
index 0000000..1b8dd96
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tanh.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanhDocs = void 0;
+var tanhDocs = {
+  name: 'tanh',
+  category: 'Trigonometry',
+  syntax: ['tanh(x)'],
+  description: 'Compute the hyperbolic tangent of x in radians.',
+  examples: ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],
+  seealso: ['sinh', 'cosh']
+};
+exports.tanhDocs = tanhDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/to.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/to.js
new file mode 100644
index 0000000..68632c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/to.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toDocs = void 0;
+var toDocs = {
+  name: 'to',
+  category: 'Units',
+  syntax: ['x to unit', 'to(x, unit)'],
+  description: 'Change the unit of a value.',
+  examples: ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],
+  seealso: []
+};
+exports.toDocs = toDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/bin.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/bin.js
new file mode 100644
index 0000000..411945c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/bin.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.binDocs = void 0;
+var binDocs = {
+  name: 'bin',
+  category: 'Utils',
+  syntax: ['bin(value)'],
+  description: 'Format a number as binary',
+  examples: ['bin(2)'],
+  seealso: ['oct', 'hex']
+};
+exports.binDocs = binDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/clone.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/clone.js
new file mode 100644
index 0000000..00e11c6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/clone.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cloneDocs = void 0;
+var cloneDocs = {
+  name: 'clone',
+  category: 'Utils',
+  syntax: ['clone(x)'],
+  description: 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices',
+  examples: ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone("hello world")'],
+  seealso: []
+};
+exports.cloneDocs = cloneDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/format.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/format.js
new file mode 100644
index 0000000..6940826
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/format.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.formatDocs = void 0;
+var formatDocs = {
+  name: 'format',
+  category: 'Utils',
+  syntax: ['format(value)', 'format(value, precision)'],
+  description: 'Format a value of any type as string.',
+  examples: ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],
+  seealso: ['print']
+};
+exports.formatDocs = formatDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..cce1053
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hasNumericValue.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hasNumericValueDocs = void 0;
+var hasNumericValueDocs = {
+  name: 'hasNumericValue',
+  category: 'Utils',
+  syntax: ['hasNumericValue(x)'],
+  description: 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',
+  examples: ['hasNumericValue(2)', 'hasNumericValue("2")', 'isNumeric("2")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']
+};
+exports.hasNumericValueDocs = hasNumericValueDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hex.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hex.js
new file mode 100644
index 0000000..3b19d6f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hex.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hexDocs = void 0;
+var hexDocs = {
+  name: 'hex',
+  category: 'Utils',
+  syntax: ['hex(value)'],
+  description: 'Format a number as hexadecimal',
+  examples: ['hex(240)'],
+  seealso: ['bin', 'oct']
+};
+exports.hexDocs = hexDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isInteger.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isInteger.js
new file mode 100644
index 0000000..65be89f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isInteger.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerDocs = void 0;
+var isIntegerDocs = {
+  name: 'isInteger',
+  category: 'Utils',
+  syntax: ['isInteger(x)'],
+  description: 'Test whether a value is an integer number.',
+  examples: ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
+exports.isIntegerDocs = isIntegerDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNaN.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNaN.js
new file mode 100644
index 0000000..d67ebee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNaN.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNaNDocs = void 0;
+var isNaNDocs = {
+  name: 'isNaN',
+  category: 'Utils',
+  syntax: ['isNaN(x)'],
+  description: 'Test whether a value is NaN (not a number)',
+  examples: ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
+exports.isNaNDocs = isNaNDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNegative.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNegative.js
new file mode 100644
index 0000000..b3c3c93
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNegative.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNegativeDocs = void 0;
+var isNegativeDocs = {
+  name: 'isNegative',
+  category: 'Utils',
+  syntax: ['isNegative(x)'],
+  description: 'Test whether a value is negative: smaller than zero.',
+  examples: ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']
+};
+exports.isNegativeDocs = isNegativeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNumeric.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNumeric.js
new file mode 100644
index 0000000..33adfc2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNumeric.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNumericDocs = void 0;
+var isNumericDocs = {
+  name: 'isNumeric',
+  category: 'Utils',
+  syntax: ['isNumeric(x)'],
+  description: 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',
+  examples: ['isNumeric(2)', 'isNumeric("2")', 'hasNumericValue("2")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']
+};
+exports.isNumericDocs = isNumericDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPositive.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPositive.js
new file mode 100644
index 0000000..30632e1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPositive.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPositiveDocs = void 0;
+var isPositiveDocs = {
+  name: 'isPositive',
+  category: 'Utils',
+  syntax: ['isPositive(x)'],
+  description: 'Test whether a value is positive: larger than zero.',
+  examples: ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
+exports.isPositiveDocs = isPositiveDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPrime.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPrime.js
new file mode 100644
index 0000000..9e6ff66
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPrime.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPrimeDocs = void 0;
+var isPrimeDocs = {
+  name: 'isPrime',
+  category: 'Utils',
+  syntax: ['isPrime(x)'],
+  description: 'Test whether a value is prime: has no divisors other than itself and one.',
+  examples: ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
+exports.isPrimeDocs = isPrimeDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isZero.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isZero.js
new file mode 100644
index 0000000..1e23b1b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isZero.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isZeroDocs = void 0;
+var isZeroDocs = {
+  name: 'isZero',
+  category: 'Utils',
+  syntax: ['isZero(x)'],
+  description: 'Test whether a value is zero.',
+  examples: ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']
+};
+exports.isZeroDocs = isZeroDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/numeric.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/numeric.js
new file mode 100644
index 0000000..ec8ff63
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/numeric.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numericDocs = void 0;
+var numericDocs = {
+  name: 'numeric',
+  category: 'Utils',
+  syntax: ['numeric(x)'],
+  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.',
+  examples: ['numeric("4")', 'numeric("4", "number")', 'numeric("4", "BigNumber")', 'numeric("4", "Fraction)', 'numeric(4, "Fraction")', 'numeric(fraction(2, 5), "number)'],
+  seealso: ['number', 'fraction', 'bignumber', 'string', 'format']
+};
+exports.numericDocs = numericDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/oct.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/oct.js
new file mode 100644
index 0000000..07b1c11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/oct.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.octDocs = void 0;
+var octDocs = {
+  name: 'oct',
+  category: 'Utils',
+  syntax: ['oct(value)'],
+  description: 'Format a number as octal',
+  examples: ['oct(56)'],
+  seealso: ['bin', 'hex']
+};
+exports.octDocs = octDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/print.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/print.js
new file mode 100644
index 0000000..274a999
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/print.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printDocs = void 0;
+var printDocs = {
+  name: 'print',
+  category: 'Utils',
+  syntax: ['print(template, values)', 'print(template, values, precision)'],
+  description: 'Interpolate values into a string template.',
+  examples: ['print("Lucy is $age years old", {age: 5})', 'print("The value of pi is $pi", {pi: pi}, 3)', 'print("Hello, $user.name!", {user: {name: "John"}})', 'print("Values: $0, $1, $2", [6, 9, 4])'],
+  seealso: ['format']
+};
+exports.printDocs = printDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/typeOf.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/typeOf.js
new file mode 100644
index 0000000..1c16fc3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/typeOf.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typeOfDocs = void 0;
+var typeOfDocs = {
+  name: 'typeOf',
+  category: 'Utils',
+  syntax: ['typeOf(x)'],
+  description: 'Get the type of a variable.',
+  examples: ['typeOf(3.5)', 'typeOf(2 - 4i)', 'typeOf(45 deg)', 'typeOf("hello world")'],
+  seealso: ['getMatrixDataType']
+};
+exports.typeOfDocs = typeOfDocs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/compile.js b/node_modules/mathjs/lib/cjs/expression/function/compile.js
new file mode 100644
index 0000000..8762a5e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/compile.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompile = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'compile';
+var dependencies = ['typed', 'parse'];
+var createCompile = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      parse = _ref.parse;
+
+  /**
+   * Parse and compile an expression.
+   * Returns a an object with a function `evaluate([scope])` to evaluate the
+   * compiled expression.
+   *
+   * Syntax:
+   *
+   *     math.compile(expr)                       // returns one node
+   *     math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes
+   *
+   * Examples:
+   *
+   *     const code1 = math.compile('sqrt(3^2 + 4^2)')
+   *     code1.evaluate() // 5
+   *
+   *     let scope = {a: 3, b: 4}
+   *     const code2 = math.compile('a * b') // 12
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].evaluate() // 12
+   *
+   * See also:
+   *
+   *    parse, evaluate
+   *
+   * @param {string | string[] | Array | Matrix} expr
+   *            The expression to be compiled
+   * @return {{evaluate: Function} | Array.<{evaluate: Function}>} code
+   *            An object with the compiled expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function string(expr) {
+      return parse(expr).compile();
+    },
+    'Array | Matrix': function ArrayMatrix(expr) {
+      return (0, _collection.deepMap)(expr, function (entry) {
+        return parse(entry).compile();
+      });
+    }
+  });
+});
+exports.createCompile = createCompile;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/evaluate.js b/node_modules/mathjs/lib/cjs/expression/function/evaluate.js
new file mode 100644
index 0000000..053c75b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/evaluate.js
@@ -0,0 +1,73 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEvaluate = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _map = require("../../utils/map.js");
+
+var name = 'evaluate';
+var dependencies = ['typed', 'parse'];
+var createEvaluate = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      parse = _ref.parse;
+
+  /**
+   * Evaluate an expression.
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.evaluate(expr)
+   *     math.evaluate(expr, scope)
+   *     math.evaluate([expr1, expr2, expr3, ...])
+   *     math.evaluate([expr1, expr2, expr3, ...], scope)
+   *
+   * Example:
+   *
+   *     math.evaluate('(2+3)/4')                // 1.25
+   *     math.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *     math.evaluate('sqrt(-4)')               // 2i
+   *     math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]
+   *
+   *     let scope = {a:3, b:4}
+   *     math.evaluate('a * b', scope)           // 12
+   *
+   * See also:
+   *
+   *    parse, compile
+   *
+   * @param {string | string[] | Matrix} expr   The expression to be evaluated
+   * @param {Object} [scope]                    Scope to read/write variables
+   * @return {*} The result of the expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function string(expr) {
+      var scope = (0, _map.createEmptyMap)();
+      return parse(expr).compile().evaluate(scope);
+    },
+    'string, Map | Object': function stringMapObject(expr, scope) {
+      return parse(expr).compile().evaluate(scope);
+    },
+    'Array | Matrix': function ArrayMatrix(expr) {
+      var scope = (0, _map.createEmptyMap)();
+      return (0, _collection.deepMap)(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    },
+    'Array | Matrix, Map | Object': function ArrayMatrixMapObject(expr, scope) {
+      return (0, _collection.deepMap)(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    }
+  });
+});
+exports.createEvaluate = createEvaluate;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/help.js b/node_modules/mathjs/lib/cjs/expression/function/help.js
new file mode 100644
index 0000000..fb97a16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/help.js
@@ -0,0 +1,81 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHelp = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _embeddedDocs = require("../embeddedDocs/embeddedDocs.js");
+
+var _object = require("../../utils/object.js");
+
+var name = 'help';
+var dependencies = ['typed', 'mathWithTransform', 'Help'];
+var createHelp = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      mathWithTransform = _ref.mathWithTransform,
+      Help = _ref.Help;
+
+  /**
+   * Retrieve help on a function or data type.
+   * Help files are retrieved from the embedded documentation in math.docs.
+   *
+   * Syntax:
+   *
+   *    math.help(search)
+   *
+   * Examples:
+   *
+   *    console.log(math.help('sin').toString())
+   *    console.log(math.help(math.add).toString())
+   *    console.log(math.help(math.add).toJSON())
+   *
+   * @param {Function | string | Object} search   A function or function name
+   *                                              for which to get help
+   * @return {Help} A help object
+   */
+  return typed(name, {
+    any: function any(search) {
+      var prop;
+      var searchName = search;
+
+      if (typeof search !== 'string') {
+        for (prop in mathWithTransform) {
+          // search in functions and constants
+          if ((0, _object.hasOwnProperty)(mathWithTransform, prop) && search === mathWithTransform[prop]) {
+            searchName = prop;
+            break;
+          }
+        }
+        /* TODO: implement help for data types
+         if (!text) {
+         // search data type
+         for (prop in math.type) {
+         if (hasOwnProperty(math, prop)) {
+         if (search === math.type[prop]) {
+         text = prop
+         break
+         }
+         }
+         }
+         }
+         */
+
+      }
+
+      var doc = (0, _customs.getSafeProperty)(_embeddedDocs.embeddedDocs, searchName);
+
+      if (!doc) {
+        var searchText = typeof searchName === 'function' ? searchName.name : searchName;
+        throw new Error('No documentation found on "' + searchText + '"');
+      }
+
+      return new Help(doc);
+    }
+  });
+});
+exports.createHelp = createHelp;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/parser.js b/node_modules/mathjs/lib/cjs/expression/function/parser.js
new file mode 100644
index 0000000..04fa574
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/parser.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParser = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'parser';
+var dependencies = ['typed', 'Parser'];
+var createParser = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Parser = _ref.Parser;
+
+  /**
+   * Create a parser. The function creates a new `math.Parser` object.
+   *
+   * Syntax:
+   *
+   *    math.parser()
+   *
+   * Examples:
+   *
+   *     const parser = new math.parser()
+   *
+   *     // evaluate expressions
+   *     const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5
+   *     const b = parser.evaluate('sqrt(-4)')        // 2i
+   *     const c = parser.evaluate('2 inch in cm')    // 5.08 cm
+   *     const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476
+   *
+   *     // define variables and functions
+   *     parser.evaluate('x = 7 / 2')             // 3.5
+   *     parser.evaluate('x + 3')                 // 6.5
+   *     parser.evaluate('f(x, y) = x^y')         // f(x, y)
+   *     parser.evaluate('f(2, 3)')               // 8
+   *
+   *     // get and set variables and functions
+   *     const x = parser.get('x')                // 7
+   *     const f = parser.get('f')                // function
+   *     const g = f(3, 2)                        // 9
+   *     parser.set('h', 500)
+   *     const i = parser.evaluate('h / 2')       // 250
+   *     parser.set('hello', function (name) {
+   *       return 'hello, ' + name + '!'
+   *     })
+   *     parser.evaluate('hello("user")')         // "hello, user!"
+   *
+   *     // clear defined functions and variables
+   *     parser.clear()
+   *
+   * See also:
+   *
+   *    evaluate, compile, parse
+   *
+   * @return {Parser} Parser
+   */
+  return typed(name, {
+    '': function _() {
+      return new Parser();
+    }
+  });
+});
+exports.createParser = createParser;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/keywords.js b/node_modules/mathjs/lib/cjs/expression/keywords.js
new file mode 100644
index 0000000..bfc9a84
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/keywords.js
@@ -0,0 +1,9 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.keywords = void 0;
+// Reserved keywords not allowed to use in the parser
+var keywords = new Set(['end']);
+exports.keywords = keywords;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/AccessorNode.js b/node_modules/mathjs/lib/cjs/expression/node/AccessorNode.js
new file mode 100644
index 0000000..d9aca11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/AccessorNode.js
@@ -0,0 +1,220 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAccessorNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _access = require("./utils/access.js");
+
+var name = 'AccessorNode';
+var dependencies = ['subset', 'Node'];
+var createAccessorNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var subset = _ref.subset,
+      Node = _ref.Node;
+  var access = (0, _access.accessFactory)({
+    subset: subset
+  });
+  /**
+   * @constructor AccessorNode
+   * @extends {Node}
+   * Access an object property or get a matrix subset
+   *
+   * @param {Node} object                 The object from which to retrieve
+   *                                      a property or subset.
+   * @param {IndexNode} index             IndexNode containing ranges
+   */
+
+  function AccessorNode(object, index) {
+    if (!(this instanceof AccessorNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!(0, _is.isNode)(object)) {
+      throw new TypeError('Node expected for parameter "object"');
+    }
+
+    if (!(0, _is.isIndexNode)(index)) {
+      throw new TypeError('IndexNode expected for parameter "index"');
+    }
+
+    this.object = object || null;
+    this.index = index; // readonly property name
+
+    Object.defineProperty(this, 'name', {
+      get: function () {
+        if (this.index) {
+          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+        } else {
+          return this.object.name || '';
+        }
+      }.bind(this),
+      set: function set() {
+        throw new Error('Cannot assign a new name, name is read-only');
+      }
+    });
+  }
+
+  AccessorNode.prototype = new Node();
+  AccessorNode.prototype.type = 'AccessorNode';
+  AccessorNode.prototype.isAccessorNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  AccessorNode.prototype._compile = function (math, argNames) {
+    var evalObject = this.object._compile(math, argNames);
+
+    var evalIndex = this.index._compile(math, argNames);
+
+    if (this.index.isObjectProperty()) {
+      var prop = this.index.getObjectProperty();
+      return function evalAccessorNode(scope, args, context) {
+        // get a property from an object evaluated using the scope.
+        return (0, _customs.getSafeProperty)(evalObject(scope, args, context), prop);
+      };
+    } else {
+      return function evalAccessorNode(scope, args, context) {
+        var object = evalObject(scope, args, context);
+        var index = evalIndex(scope, args, object); // we pass object here instead of context
+
+        return access(object, index);
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  AccessorNode.prototype.forEach = function (callback) {
+    callback(this.object, 'object', this);
+    callback(this.index, 'index', this);
+  };
+  /**
+   * Create a new AccessorNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {AccessorNode} Returns a transformed copy of the node
+   */
+
+
+  AccessorNode.prototype.map = function (callback) {
+    return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {AccessorNode}
+   */
+
+
+  AccessorNode.prototype.clone = function () {
+    return new AccessorNode(this.object, this.index);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AccessorNode.prototype._toString = function (options) {
+    var object = this.object.toString(options);
+
+    if (needParenthesis(this.object)) {
+      object = '(' + object + ')';
+    }
+
+    return object + this.index.toString(options);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AccessorNode.prototype.toHTML = function (options) {
+    var object = this.object.toHTML(options);
+
+    if (needParenthesis(this.object)) {
+      object = '<span class="math-parenthesis math-round-parenthesis">(</span>' + object + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return object + this.index.toHTML(options);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AccessorNode.prototype._toTex = function (options) {
+    var object = this.object.toTex(options);
+
+    if (needParenthesis(this.object)) {
+      object = '\\left(\' + object + \'\\right)';
+    }
+
+    return object + this.index.toTex(options);
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  AccessorNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'AccessorNode',
+      object: this.object,
+      index: this.index
+    };
+  };
+  /**
+   * Instantiate an AccessorNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "AccessorNode", object: ..., index: ...}`,
+   *                       where mathjs is optional
+   * @returns {AccessorNode}
+   */
+
+
+  AccessorNode.fromJSON = function (json) {
+    return new AccessorNode(json.object, json.index);
+  };
+  /**
+   * Are parenthesis needed?
+   * @private
+   */
+
+
+  function needParenthesis(node) {
+    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?
+    return !((0, _is.isAccessorNode)(node) || (0, _is.isArrayNode)(node) || (0, _is.isConstantNode)(node) || (0, _is.isFunctionNode)(node) || (0, _is.isObjectNode)(node) || (0, _is.isParenthesisNode)(node) || (0, _is.isSymbolNode)(node));
+  }
+
+  return AccessorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createAccessorNode = createAccessorNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ArrayNode.js b/node_modules/mathjs/lib/cjs/expression/node/ArrayNode.js
new file mode 100644
index 0000000..98d429f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ArrayNode.js
@@ -0,0 +1,195 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createArrayNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ArrayNode';
+var dependencies = ['Node'];
+var createArrayNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * @constructor ArrayNode
+   * @extends {Node}
+   * Holds an 1-dimensional array with items
+   * @param {Node[]} [items]   1 dimensional array with items
+   */
+  function ArrayNode(items) {
+    if (!(this instanceof ArrayNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.items = items || []; // validate input
+
+    if (!Array.isArray(this.items) || !this.items.every(_is.isNode)) {
+      throw new TypeError('Array containing Nodes expected');
+    }
+  }
+
+  ArrayNode.prototype = new Node();
+  ArrayNode.prototype.type = 'ArrayNode';
+  ArrayNode.prototype.isArrayNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ArrayNode.prototype._compile = function (math, argNames) {
+    var evalItems = (0, _array.map)(this.items, function (item) {
+      return item._compile(math, argNames);
+    });
+    var asMatrix = math.config.matrix !== 'Array';
+
+    if (asMatrix) {
+      var matrix = math.matrix;
+      return function evalArrayNode(scope, args, context) {
+        return matrix((0, _array.map)(evalItems, function (evalItem) {
+          return evalItem(scope, args, context);
+        }));
+      };
+    } else {
+      return function evalArrayNode(scope, args, context) {
+        return (0, _array.map)(evalItems, function (evalItem) {
+          return evalItem(scope, args, context);
+        });
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ArrayNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.items.length; i++) {
+      var node = this.items[i];
+      callback(node, 'items[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new ArrayNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {ArrayNode} Returns a transformed copy of the node
+   */
+
+
+  ArrayNode.prototype.map = function (callback) {
+    var items = [];
+
+    for (var i = 0; i < this.items.length; i++) {
+      items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));
+    }
+
+    return new ArrayNode(items);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ArrayNode}
+   */
+
+
+  ArrayNode.prototype.clone = function () {
+    return new ArrayNode(this.items.slice(0));
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ArrayNode.prototype._toString = function (options) {
+    var items = this.items.map(function (node) {
+      return node.toString(options);
+    });
+    return '[' + items.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ArrayNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ArrayNode',
+      items: this.items
+    };
+  };
+  /**
+   * Instantiate an ArrayNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ArrayNode", items: [...]}`,
+   *                       where mathjs is optional
+   * @returns {ArrayNode}
+   */
+
+
+  ArrayNode.fromJSON = function (json) {
+    return new ArrayNode(json.items);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ArrayNode.prototype.toHTML = function (options) {
+    var items = this.items.map(function (node) {
+      return node.toHTML(options);
+    });
+    return '<span class="math-parenthesis math-square-parenthesis">[</span>' + items.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ArrayNode.prototype._toTex = function (options) {
+    function itemsToTex(items, nested) {
+      var mixedItems = items.some(_is.isArrayNode) && !items.every(_is.isArrayNode);
+      var itemsFormRow = nested || mixedItems;
+      var itemSep = itemsFormRow ? '&' : '\\\\';
+      var itemsTex = items.map(function (node) {
+        if (node.items) {
+          return itemsToTex(node.items, !nested);
+        } else {
+          return node.toTex(options);
+        }
+      }).join(itemSep);
+      return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\begin{bmatrix}' + itemsTex + '\\end{bmatrix}' : itemsTex;
+    }
+
+    return itemsToTex(this.items, false);
+  };
+
+  return ArrayNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createArrayNode = createArrayNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/AssignmentNode.js b/node_modules/mathjs/lib/cjs/expression/node/AssignmentNode.js
new file mode 100644
index 0000000..f7a31de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/AssignmentNode.js
@@ -0,0 +1,339 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAssignmentNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _access = require("./utils/access.js");
+
+var _assign = require("./utils/assign.js");
+
+var _operators = require("../operators.js");
+
+var name = 'AssignmentNode';
+var dependencies = ['subset', '?matrix', // FIXME: should not be needed at all, should be handled by subset
+'Node'];
+var createAssignmentNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var subset = _ref.subset,
+      matrix = _ref.matrix,
+      Node = _ref.Node;
+  var access = (0, _access.accessFactory)({
+    subset: subset
+  });
+  var assign = (0, _assign.assignFactory)({
+    subset: subset,
+    matrix: matrix
+  });
+  /**
+   * @constructor AssignmentNode
+   * @extends {Node}
+   *
+   * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or
+   * replace a subset of a matrix like `A[2,2]=42`.
+   *
+   * Syntax:
+   *
+   *     new AssignmentNode(symbol, value)
+   *     new AssignmentNode(object, index, value)
+   *
+   * Usage:
+   *
+   *    new AssignmentNode(new SymbolNode('a'), new ConstantNode(2))                       // a=2
+   *    new AssignmentNode(new SymbolNode('a'), new IndexNode('b'), new ConstantNode(2))   // a.b=2
+   *    new AssignmentNode(new SymbolNode('a'), new IndexNode(1, 2), new ConstantNode(3))  // a[1,2]=3
+   *
+   * @param {SymbolNode | AccessorNode} object  Object on which to assign a value
+   * @param {IndexNode} [index=null]            Index, property name or matrix
+   *                                            index. Optional. If not provided
+   *                                            and `object` is a SymbolNode,
+   *                                            the property is assigned to the
+   *                                            global scope.
+   * @param {Node} value                        The value to be assigned
+   */
+
+  function AssignmentNode(object, index, value) {
+    if (!(this instanceof AssignmentNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.object = object;
+    this.index = value ? index : null;
+    this.value = value || index; // validate input
+
+    if (!(0, _is.isSymbolNode)(object) && !(0, _is.isAccessorNode)(object)) {
+      throw new TypeError('SymbolNode or AccessorNode expected as "object"');
+    }
+
+    if ((0, _is.isSymbolNode)(object) && object.name === 'end') {
+      throw new Error('Cannot assign to symbol "end"');
+    }
+
+    if (this.index && !(0, _is.isIndexNode)(this.index)) {
+      // index is optional
+      throw new TypeError('IndexNode expected as "index"');
+    }
+
+    if (!(0, _is.isNode)(this.value)) {
+      throw new TypeError('Node expected as "value"');
+    } // readonly property name
+
+
+    Object.defineProperty(this, 'name', {
+      get: function () {
+        if (this.index) {
+          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+        } else {
+          return this.object.name || '';
+        }
+      }.bind(this),
+      set: function set() {
+        throw new Error('Cannot assign a new name, name is read-only');
+      }
+    });
+  }
+
+  AssignmentNode.prototype = new Node();
+  AssignmentNode.prototype.type = 'AssignmentNode';
+  AssignmentNode.prototype.isAssignmentNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  AssignmentNode.prototype._compile = function (math, argNames) {
+    var evalObject = this.object._compile(math, argNames);
+
+    var evalIndex = this.index ? this.index._compile(math, argNames) : null;
+
+    var evalValue = this.value._compile(math, argNames);
+
+    var name = this.object.name;
+
+    if (!this.index) {
+      // apply a variable to the scope, for example `a=2`
+      if (!(0, _is.isSymbolNode)(this.object)) {
+        throw new TypeError('SymbolNode expected as object');
+      }
+
+      return function evalAssignmentNode(scope, args, context) {
+        var value = evalValue(scope, args, context);
+        scope.set(name, value);
+        return value;
+      };
+    } else if (this.index.isObjectProperty()) {
+      // apply an object property for example `a.b=2`
+      var prop = this.index.getObjectProperty();
+      return function evalAssignmentNode(scope, args, context) {
+        var object = evalObject(scope, args, context);
+        var value = evalValue(scope, args, context);
+        (0, _customs.setSafeProperty)(object, prop, value);
+        return value;
+      };
+    } else if ((0, _is.isSymbolNode)(this.object)) {
+      // update a matrix subset, for example `a[2]=3`
+      return function evalAssignmentNode(scope, args, context) {
+        var childObject = evalObject(scope, args, context);
+        var value = evalValue(scope, args, context);
+        var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context
+
+        scope.set(name, assign(childObject, index, value));
+        return value;
+      };
+    } else {
+      // isAccessorNode(node.object) === true
+      // update a matrix subset, for example `a.b[2]=3`
+      // we will not use the compile function of the AccessorNode, but compile it
+      // ourselves here as we need the parent object of the AccessorNode:
+      // wee need to apply the updated object to parent object
+      var evalParentObject = this.object.object._compile(math, argNames);
+
+      if (this.object.index.isObjectProperty()) {
+        var parentProp = this.object.index.getObjectProperty();
+        return function evalAssignmentNode(scope, args, context) {
+          var parent = evalParentObject(scope, args, context);
+          var childObject = (0, _customs.getSafeProperty)(parent, parentProp);
+          var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context
+
+          var value = evalValue(scope, args, context);
+          (0, _customs.setSafeProperty)(parent, parentProp, assign(childObject, index, value));
+          return value;
+        };
+      } else {
+        // if some parameters use the 'end' parameter, we need to calculate the size
+        var evalParentIndex = this.object.index._compile(math, argNames);
+
+        return function evalAssignmentNode(scope, args, context) {
+          var parent = evalParentObject(scope, args, context);
+          var parentIndex = evalParentIndex(scope, args, parent); // Important: we pass parent instead of context
+
+          var childObject = access(parent, parentIndex);
+          var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context
+
+          var value = evalValue(scope, args, context);
+          assign(parent, parentIndex, assign(childObject, index, value));
+          return value;
+        };
+      }
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  AssignmentNode.prototype.forEach = function (callback) {
+    callback(this.object, 'object', this);
+
+    if (this.index) {
+      callback(this.index, 'index', this);
+    }
+
+    callback(this.value, 'value', this);
+  };
+  /**
+   * Create a new AssignmentNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {AssignmentNode} Returns a transformed copy of the node
+   */
+
+
+  AssignmentNode.prototype.map = function (callback) {
+    var object = this._ifNode(callback(this.object, 'object', this));
+
+    var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;
+
+    var value = this._ifNode(callback(this.value, 'value', this));
+
+    return new AssignmentNode(object, index, value);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {AssignmentNode}
+   */
+
+
+  AssignmentNode.prototype.clone = function () {
+    return new AssignmentNode(this.object, this.index, this.value);
+  };
+  /*
+   * Is parenthesis needed?
+   * @param {node} node
+   * @param {string} [parenthesis='keep']
+   * @private
+   */
+
+
+  function needParenthesis(node, parenthesis) {
+    if (!parenthesis) {
+      parenthesis = 'keep';
+    }
+
+    var precedence = (0, _operators.getPrecedence)(node, parenthesis);
+    var exprPrecedence = (0, _operators.getPrecedence)(node.value, parenthesis);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AssignmentNode.prototype._toString = function (options) {
+    var object = this.object.toString(options);
+    var index = this.index ? this.index.toString(options) : '';
+    var value = this.value.toString(options);
+
+    if (needParenthesis(this, options && options.parenthesis)) {
+      value = '(' + value + ')';
+    }
+
+    return object + index + ' = ' + value;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  AssignmentNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'AssignmentNode',
+      object: this.object,
+      index: this.index,
+      value: this.value
+    };
+  };
+  /**
+   * Instantiate an AssignmentNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "AssignmentNode", object: ..., index: ..., value: ...}`,
+   *                       where mathjs is optional
+   * @returns {AssignmentNode}
+   */
+
+
+  AssignmentNode.fromJSON = function (json) {
+    return new AssignmentNode(json.object, json.index, json.value);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AssignmentNode.prototype.toHTML = function (options) {
+    var object = this.object.toHTML(options);
+    var index = this.index ? this.index.toHTML(options) : '';
+    var value = this.value.toHTML(options);
+
+    if (needParenthesis(this, options && options.parenthesis)) {
+      value = '<span class="math-paranthesis math-round-parenthesis">(</span>' + value + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+    }
+
+    return object + index + '<span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>' + value;
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AssignmentNode.prototype._toTex = function (options) {
+    var object = this.object.toTex(options);
+    var index = this.index ? this.index.toTex(options) : '';
+    var value = this.value.toTex(options);
+
+    if (needParenthesis(this, options && options.parenthesis)) {
+      value = "\\left(".concat(value, "\\right)");
+    }
+
+    return object + index + ':=' + value;
+  };
+
+  return AssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createAssignmentNode = createAssignmentNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/BlockNode.js b/node_modules/mathjs/lib/cjs/expression/node/BlockNode.js
new file mode 100644
index 0000000..5d8560c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/BlockNode.js
@@ -0,0 +1,202 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBlockNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'BlockNode';
+var dependencies = ['ResultSet', 'Node'];
+var createBlockNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var ResultSet = _ref.ResultSet,
+      Node = _ref.Node;
+
+  /**
+   * @constructor BlockNode
+   * @extends {Node}
+   * Holds a set with blocks
+   * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks
+   *            An array with blocks, where a block is constructed as an Object
+   *            with properties block, which is a Node, and visible, which is
+   *            a boolean. The property visible is optional and is true by default
+   */
+  function BlockNode(blocks) {
+    if (!(this instanceof BlockNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input, copy blocks
+
+
+    if (!Array.isArray(blocks)) throw new Error('Array expected');
+    this.blocks = blocks.map(function (block) {
+      var node = block && block.node;
+      var visible = block && block.visible !== undefined ? block.visible : true;
+      if (!(0, _is.isNode)(node)) throw new TypeError('Property "node" must be a Node');
+      if (typeof visible !== 'boolean') throw new TypeError('Property "visible" must be a boolean');
+      return {
+        node: node,
+        visible: visible
+      };
+    });
+  }
+
+  BlockNode.prototype = new Node();
+  BlockNode.prototype.type = 'BlockNode';
+  BlockNode.prototype.isBlockNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  BlockNode.prototype._compile = function (math, argNames) {
+    var evalBlocks = (0, _array.map)(this.blocks, function (block) {
+      return {
+        evaluate: block.node._compile(math, argNames),
+        visible: block.visible
+      };
+    });
+    return function evalBlockNodes(scope, args, context) {
+      var results = [];
+      (0, _array.forEach)(evalBlocks, function evalBlockNode(block) {
+        var result = block.evaluate(scope, args, context);
+
+        if (block.visible) {
+          results.push(result);
+        }
+      });
+      return new ResultSet(results);
+    };
+  };
+  /**
+   * Execute a callback for each of the child blocks of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  BlockNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.blocks.length; i++) {
+      callback(this.blocks[i].node, 'blocks[' + i + '].node', this);
+    }
+  };
+  /**
+   * Create a new BlockNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {BlockNode} Returns a transformed copy of the node
+   */
+
+
+  BlockNode.prototype.map = function (callback) {
+    var blocks = [];
+
+    for (var i = 0; i < this.blocks.length; i++) {
+      var block = this.blocks[i];
+
+      var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));
+
+      blocks[i] = {
+        node: node,
+        visible: block.visible
+      };
+    }
+
+    return new BlockNode(blocks);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {BlockNode}
+   */
+
+
+  BlockNode.prototype.clone = function () {
+    var blocks = this.blocks.map(function (block) {
+      return {
+        node: block.node,
+        visible: block.visible
+      };
+    });
+    return new BlockNode(blocks);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  BlockNode.prototype._toString = function (options) {
+    return this.blocks.map(function (param) {
+      return param.node.toString(options) + (param.visible ? '' : ';');
+    }).join('\n');
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  BlockNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'BlockNode',
+      blocks: this.blocks
+    };
+  };
+  /**
+   * Instantiate an BlockNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "BlockNode", blocks: [{node: ..., visible: false}, ...]}`,
+   *                       where mathjs is optional
+   * @returns {BlockNode}
+   */
+
+
+  BlockNode.fromJSON = function (json) {
+    return new BlockNode(json.blocks);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  BlockNode.prototype.toHTML = function (options) {
+    return this.blocks.map(function (param) {
+      return param.node.toHTML(options) + (param.visible ? '' : '<span class="math-separator">;</span>');
+    }).join('<span class="math-separator"><br /></span>');
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  BlockNode.prototype._toTex = function (options) {
+    return this.blocks.map(function (param) {
+      return param.node.toTex(options) + (param.visible ? '' : ';');
+    }).join('\\;\\;\n');
+  };
+
+  return BlockNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createBlockNode = createBlockNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ConditionalNode.js b/node_modules/mathjs/lib/cjs/expression/node/ConditionalNode.js
new file mode 100644
index 0000000..9a6e8a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ConditionalNode.js
@@ -0,0 +1,249 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConditionalNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _operators = require("../operators.js");
+
+var name = 'ConditionalNode';
+var dependencies = ['Node'];
+var createConditionalNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'
+   *
+   * @param {Node} condition   Condition, must result in a boolean
+   * @param {Node} trueExpr    Expression evaluated when condition is true
+   * @param {Node} falseExpr   Expression evaluated when condition is true
+   *
+   * @constructor ConditionalNode
+   * @extends {Node}
+   */
+  function ConditionalNode(condition, trueExpr, falseExpr) {
+    if (!(this instanceof ConditionalNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!(0, _is.isNode)(condition)) throw new TypeError('Parameter condition must be a Node');
+    if (!(0, _is.isNode)(trueExpr)) throw new TypeError('Parameter trueExpr must be a Node');
+    if (!(0, _is.isNode)(falseExpr)) throw new TypeError('Parameter falseExpr must be a Node');
+    this.condition = condition;
+    this.trueExpr = trueExpr;
+    this.falseExpr = falseExpr;
+  }
+
+  ConditionalNode.prototype = new Node();
+  ConditionalNode.prototype.type = 'ConditionalNode';
+  ConditionalNode.prototype.isConditionalNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ConditionalNode.prototype._compile = function (math, argNames) {
+    var evalCondition = this.condition._compile(math, argNames);
+
+    var evalTrueExpr = this.trueExpr._compile(math, argNames);
+
+    var evalFalseExpr = this.falseExpr._compile(math, argNames);
+
+    return function evalConditionalNode(scope, args, context) {
+      return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ConditionalNode.prototype.forEach = function (callback) {
+    callback(this.condition, 'condition', this);
+    callback(this.trueExpr, 'trueExpr', this);
+    callback(this.falseExpr, 'falseExpr', this);
+  };
+  /**
+   * Create a new ConditionalNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {ConditionalNode} Returns a transformed copy of the node
+   */
+
+
+  ConditionalNode.prototype.map = function (callback) {
+    return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ConditionalNode}
+   */
+
+
+  ConditionalNode.prototype.clone = function () {
+    return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConditionalNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = (0, _operators.getPrecedence)(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode
+    // or have lower or equal precedence
+    // NOTE: enclosing all OperatorNodes in parentheses is a decision
+    // purely based on aesthetics and readability
+
+    var condition = this.condition.toString(options);
+    var conditionPrecedence = (0, _operators.getPrecedence)(this.condition, parenthesis);
+
+    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+      condition = '(' + condition + ')';
+    }
+
+    var trueExpr = this.trueExpr.toString(options);
+    var truePrecedence = (0, _operators.getPrecedence)(this.trueExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+      trueExpr = '(' + trueExpr + ')';
+    }
+
+    var falseExpr = this.falseExpr.toString(options);
+    var falsePrecedence = (0, _operators.getPrecedence)(this.falseExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+      falseExpr = '(' + falseExpr + ')';
+    }
+
+    return condition + ' ? ' + trueExpr + ' : ' + falseExpr;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ConditionalNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ConditionalNode',
+      condition: this.condition,
+      trueExpr: this.trueExpr,
+      falseExpr: this.falseExpr
+    };
+  };
+  /**
+   * Instantiate an ConditionalNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ConditionalNode", "condition": ..., "trueExpr": ..., "falseExpr": ...}`,
+   *                       where mathjs is optional
+   * @returns {ConditionalNode}
+   */
+
+
+  ConditionalNode.fromJSON = function (json) {
+    return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConditionalNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = (0, _operators.getPrecedence)(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode
+    // or have lower or equal precedence
+    // NOTE: enclosing all OperatorNodes in parentheses is a decision
+    // purely based on aesthetics and readability
+
+    var condition = this.condition.toHTML(options);
+    var conditionPrecedence = (0, _operators.getPrecedence)(this.condition, parenthesis);
+
+    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+      condition = '<span class="math-parenthesis math-round-parenthesis">(</span>' + condition + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    var trueExpr = this.trueExpr.toHTML(options);
+    var truePrecedence = (0, _operators.getPrecedence)(this.trueExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+      trueExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + trueExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    var falseExpr = this.falseExpr.toHTML(options);
+    var falsePrecedence = (0, _operators.getPrecedence)(this.falseExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+      falseExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + falseExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return condition + '<span class="math-operator math-conditional-operator">?</span>' + trueExpr + '<span class="math-operator math-conditional-operator">:</span>' + falseExpr;
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConditionalNode.prototype._toTex = function (options) {
+    return '\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\quad{\\text{if }\\;' + this.condition.toTex(options) + '}\\\\{' + this.falseExpr.toTex(options) + '}, &\\quad{\\text{otherwise}}\\end{cases}';
+  };
+  /**
+   * Test whether a condition is met
+   * @param {*} condition
+   * @returns {boolean} true if condition is true or non-zero, else false
+   */
+
+
+  function testCondition(condition) {
+    if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {
+      return !!condition;
+    }
+
+    if (condition) {
+      if ((0, _is.isBigNumber)(condition)) {
+        return !condition.isZero();
+      }
+
+      if ((0, _is.isComplex)(condition)) {
+        return !!(condition.re || condition.im);
+      }
+
+      if ((0, _is.isUnit)(condition)) {
+        return !!condition.value;
+      }
+    }
+
+    if (condition === null || condition === undefined) {
+      return false;
+    }
+
+    throw new TypeError('Unsupported type of condition "' + (0, _is.typeOf)(condition) + '"');
+  }
+
+  return ConditionalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createConditionalNode = createConditionalNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ConstantNode.js b/node_modules/mathjs/lib/cjs/expression/node/ConstantNode.js
new file mode 100644
index 0000000..df0d624
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ConstantNode.js
@@ -0,0 +1,200 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConstantNode = void 0;
+
+var _string = require("../../utils/string.js");
+
+var _is = require("../../utils/is.js");
+
+var _latex = require("../../utils/latex.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ConstantNode';
+var dependencies = ['Node'];
+var createConstantNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * A ConstantNode holds a constant value like a number or string.
+   *
+   * Usage:
+   *
+   *     new ConstantNode(2.3)
+   *     new ConstantNode('hello')
+   *
+   * @param {*} value    Value can be any type (number, BigNumber, string, ...)
+   * @constructor ConstantNode
+   * @extends {Node}
+   */
+  function ConstantNode(value) {
+    if (!(this instanceof ConstantNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.value = value;
+  }
+
+  ConstantNode.prototype = new Node();
+  ConstantNode.prototype.type = 'ConstantNode';
+  ConstantNode.prototype.isConstantNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ConstantNode.prototype._compile = function (math, argNames) {
+    var value = this.value;
+    return function evalConstantNode() {
+      return value;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ConstantNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs
+  };
+  /**
+   * Create a new ConstantNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node) : Node} callback
+   * @returns {ConstantNode} Returns a clone of the node
+   */
+
+
+  ConstantNode.prototype.map = function (callback) {
+    return this.clone();
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ConstantNode}
+   */
+
+
+  ConstantNode.prototype.clone = function () {
+    return new ConstantNode(this.value);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConstantNode.prototype._toString = function (options) {
+    return (0, _string.format)(this.value, options);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConstantNode.prototype.toHTML = function (options) {
+    var value = this._toString(options);
+
+    switch ((0, _is.typeOf)(this.value)) {
+      case 'number':
+      case 'BigNumber':
+      case 'Fraction':
+        return '<span class="math-number">' + value + '</span>';
+
+      case 'string':
+        return '<span class="math-string">' + value + '</span>';
+
+      case 'boolean':
+        return '<span class="math-boolean">' + value + '</span>';
+
+      case 'null':
+        return '<span class="math-null-symbol">' + value + '</span>';
+
+      case 'undefined':
+        return '<span class="math-undefined">' + value + '</span>';
+
+      default:
+        return '<span class="math-symbol">' + value + '</span>';
+    }
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ConstantNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ConstantNode',
+      value: this.value
+    };
+  };
+  /**
+   * Instantiate a ConstantNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SymbolNode", value: 2.3}`,
+   *                       where mathjs is optional
+   * @returns {ConstantNode}
+   */
+
+
+  ConstantNode.fromJSON = function (json) {
+    return new ConstantNode(json.value);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConstantNode.prototype._toTex = function (options) {
+    var value = this._toString(options);
+
+    switch ((0, _is.typeOf)(this.value)) {
+      case 'string':
+        return '\\mathtt{' + (0, _latex.escapeLatex)(value) + '}';
+
+      case 'number':
+      case 'BigNumber':
+        {
+          if (!isFinite(this.value)) {
+            return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
+          }
+
+          var index = value.toLowerCase().indexOf('e');
+
+          if (index !== -1) {
+            return value.substring(0, index) + '\\cdot10^{' + value.substring(index + 1) + '}';
+          }
+        }
+        return value;
+
+      case 'Fraction':
+        return this.value.toLatex();
+
+      default:
+        return value;
+    }
+  };
+
+  return ConstantNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createConstantNode = createConstantNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/FunctionAssignmentNode.js b/node_modules/mathjs/lib/cjs/expression/node/FunctionAssignmentNode.js
new file mode 100644
index 0000000..92bbe56
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/FunctionAssignmentNode.js
@@ -0,0 +1,247 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFunctionAssignmentNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _keywords = require("../keywords.js");
+
+var _string = require("../../utils/string.js");
+
+var _array = require("../../utils/array.js");
+
+var _latex = require("../../utils/latex.js");
+
+var _operators = require("../operators.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'FunctionAssignmentNode';
+var dependencies = ['typed', 'Node'];
+var createFunctionAssignmentNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Node = _ref.Node;
+
+  /**
+   * @constructor FunctionAssignmentNode
+   * @extends {Node}
+   * Function assignment
+   *
+   * @param {string} name           Function name
+   * @param {string[] | Array.<{name: string, type: string}>} params
+   *                                Array with function parameter names, or an
+   *                                array with objects containing the name
+   *                                and type of the parameter
+   * @param {Node} expr             The function expression
+   */
+  function FunctionAssignmentNode(name, params, expr) {
+    if (!(this instanceof FunctionAssignmentNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (typeof name !== 'string') throw new TypeError('String expected for parameter "name"');
+    if (!Array.isArray(params)) throw new TypeError('Array containing strings or objects expected for parameter "params"');
+    if (!(0, _is.isNode)(expr)) throw new TypeError('Node expected for parameter "expr"');
+    if (_keywords.keywords.has(name)) throw new Error('Illegal function name, "' + name + '" is a reserved keyword');
+    this.name = name;
+    this.params = params.map(function (param) {
+      return param && param.name || param;
+    });
+    this.types = params.map(function (param) {
+      return param && param.type || 'any';
+    });
+    this.expr = expr;
+  }
+
+  FunctionAssignmentNode.prototype = new Node();
+  FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode';
+  FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  FunctionAssignmentNode.prototype._compile = function (math, argNames) {
+    var childArgNames = Object.create(argNames);
+    (0, _array.forEach)(this.params, function (param) {
+      childArgNames[param] = true;
+    }); // compile the function expression with the child args
+
+    var evalExpr = this.expr._compile(math, childArgNames);
+
+    var name = this.name;
+    var params = this.params;
+    var signature = (0, _array.join)(this.types, ',');
+    var syntax = name + '(' + (0, _array.join)(this.params, ', ') + ')';
+    return function evalFunctionAssignmentNode(scope, args, context) {
+      var signatures = {};
+
+      signatures[signature] = function () {
+        var childArgs = Object.create(args);
+
+        for (var i = 0; i < params.length; i++) {
+          childArgs[params[i]] = arguments[i];
+        }
+
+        return evalExpr(scope, childArgs, context);
+      };
+
+      var fn = typed(name, signatures);
+      fn.syntax = syntax;
+      scope.set(name, fn);
+      return fn;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  FunctionAssignmentNode.prototype.forEach = function (callback) {
+    callback(this.expr, 'expr', this);
+  };
+  /**
+   * Create a new FunctionAssignmentNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {FunctionAssignmentNode} Returns a transformed copy of the node
+   */
+
+
+  FunctionAssignmentNode.prototype.map = function (callback) {
+    var expr = this._ifNode(callback(this.expr, 'expr', this));
+
+    return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {FunctionAssignmentNode}
+   */
+
+
+  FunctionAssignmentNode.prototype.clone = function () {
+    return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);
+  };
+  /**
+   * Is parenthesis needed?
+   * @param {Node} node
+   * @param {Object} parenthesis
+   * @private
+   */
+
+
+  function needParenthesis(node, parenthesis) {
+    var precedence = (0, _operators.getPrecedence)(node, parenthesis);
+    var exprPrecedence = (0, _operators.getPrecedence)(node.expr, parenthesis);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  /**
+   * get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionAssignmentNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var expr = this.expr.toString(options);
+
+    if (needParenthesis(this, parenthesis)) {
+      expr = '(' + expr + ')';
+    }
+
+    return this.name + '(' + this.params.join(', ') + ') = ' + expr;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  FunctionAssignmentNode.prototype.toJSON = function () {
+    var types = this.types;
+    return {
+      mathjs: 'FunctionAssignmentNode',
+      name: this.name,
+      params: this.params.map(function (param, index) {
+        return {
+          name: param,
+          type: types[index]
+        };
+      }),
+      expr: this.expr
+    };
+  };
+  /**
+   * Instantiate an FunctionAssignmentNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "FunctionAssignmentNode", name: ..., params: ..., expr: ...}`,
+   *                       where mathjs is optional
+   * @returns {FunctionAssignmentNode}
+   */
+
+
+  FunctionAssignmentNode.fromJSON = function (json) {
+    return new FunctionAssignmentNode(json.name, json.params, json.expr);
+  };
+  /**
+   * get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionAssignmentNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var params = [];
+
+    for (var i = 0; i < this.params.length; i++) {
+      params.push('<span class="math-symbol math-parameter">' + (0, _string.escape)(this.params[i]) + '</span>');
+    }
+
+    var expr = this.expr.toHTML(options);
+
+    if (needParenthesis(this, parenthesis)) {
+      expr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + expr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return '<span class="math-function">' + (0, _string.escape)(this.name) + '</span>' + '<span class="math-parenthesis math-round-parenthesis">(</span>' + params.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-round-parenthesis">)</span><span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>' + expr;
+  };
+  /**
+   * get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionAssignmentNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var expr = this.expr.toTex(options);
+
+    if (needParenthesis(this, parenthesis)) {
+      expr = "\\left(".concat(expr, "\\right)");
+    }
+
+    return '\\mathrm{' + this.name + '}\\left(' + this.params.map(_latex.toSymbol).join(',') + '\\right):=' + expr;
+  };
+
+  return FunctionAssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createFunctionAssignmentNode = createFunctionAssignmentNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/FunctionNode.js b/node_modules/mathjs/lib/cjs/expression/node/FunctionNode.js
new file mode 100644
index 0000000..55293f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/FunctionNode.js
@@ -0,0 +1,564 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFunctionNode = void 0;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
+
+var _is = require("../../utils/is.js");
+
+var _string = require("../../utils/string.js");
+
+var _object = require("../../utils/object.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _scope = require("../../utils/scope.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _latex = require("../../utils/latex.js");
+
+var name = 'FunctionNode';
+var dependencies = ['math', 'Node', 'SymbolNode'];
+var createFunctionNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var math = _ref.math,
+      Node = _ref.Node,
+      SymbolNode = _ref.SymbolNode;
+
+  /**
+   * @constructor FunctionNode
+   * @extends {./Node}
+   * invoke a list with arguments on a node
+   * @param {./Node | string} fn Node resolving with a function on which to invoke
+   *                             the arguments, typically a SymboNode or AccessorNode
+   * @param {./Node[]} args
+   */
+  function FunctionNode(fn, args) {
+    if (!(this instanceof FunctionNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (typeof fn === 'string') {
+      fn = new SymbolNode(fn);
+    } // validate input
+
+
+    if (!(0, _is.isNode)(fn)) throw new TypeError('Node expected as parameter "fn"');
+
+    if (!Array.isArray(args) || !args.every(_is.isNode)) {
+      throw new TypeError('Array containing Nodes expected for parameter "args"');
+    }
+
+    this.fn = fn;
+    this.args = args || []; // readonly property name
+
+    Object.defineProperty(this, 'name', {
+      get: function () {
+        return this.fn.name || '';
+      }.bind(this),
+      set: function set() {
+        throw new Error('Cannot assign a new name, name is read-only');
+      }
+    });
+  }
+
+  FunctionNode.prototype = new Node();
+  FunctionNode.prototype.type = 'FunctionNode';
+  FunctionNode.prototype.isFunctionNode = true;
+  /* format to fixed length */
+
+  var strin = function strin(entity) {
+    return (0, _string.format)(entity, {
+      truncate: 78
+    });
+  };
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+
+  FunctionNode.prototype._compile = function (math, argNames) {
+    if (!(this instanceof FunctionNode)) {
+      throw new TypeError('No valid FunctionNode');
+    } // compile arguments
+
+
+    var evalArgs = this.args.map(function (arg) {
+      return arg._compile(math, argNames);
+    });
+
+    if ((0, _is.isSymbolNode)(this.fn)) {
+      var _name = this.fn.name;
+
+      if (!argNames[_name]) {
+        // we can statically determine whether the function has an rawArgs property
+        var fn = _name in math ? (0, _customs.getSafeProperty)(math, _name) : undefined;
+        var isRaw = typeof fn === 'function' && fn.rawArgs === true;
+
+        var resolveFn = function resolveFn(scope) {
+          var value;
+
+          if (scope.has(_name)) {
+            value = scope.get(_name);
+          } else if (_name in math) {
+            value = (0, _customs.getSafeProperty)(math, _name);
+          } else {
+            return FunctionNode.onUndefinedFunction(_name);
+          }
+
+          if (typeof value === 'function') {
+            return value;
+          }
+
+          throw new TypeError("'".concat(_name, "' is not a function; its value is:\n  ").concat(strin(value)));
+        };
+
+        if (isRaw) {
+          // pass unevaluated parameters (nodes) to the function
+          // "raw" evaluation
+          var rawArgs = this.args;
+          return function evalFunctionNode(scope, args, context) {
+            var fn = resolveFn(scope);
+            return fn(rawArgs, math, (0, _scope.createSubScope)(scope, args), scope);
+          };
+        } else {
+          // "regular" evaluation
+          switch (evalArgs.length) {
+            case 0:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                return fn();
+              };
+
+            case 1:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                var evalArg0 = evalArgs[0];
+                return fn(evalArg0(scope, args, context));
+              };
+
+            case 2:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                var evalArg0 = evalArgs[0];
+                var evalArg1 = evalArgs[1];
+                return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));
+              };
+
+            default:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                var values = evalArgs.map(function (evalArg) {
+                  return evalArg(scope, args, context);
+                });
+                return fn.apply(void 0, (0, _toConsumableArray2.default)(values));
+              };
+          }
+        }
+      } else {
+        // the function symbol is an argName
+        var _rawArgs = this.args;
+        return function evalFunctionNode(scope, args, context) {
+          var fn = args[_name];
+
+          if (typeof fn !== 'function') {
+            throw new TypeError("Argument '".concat(_name, "' was not a function; received: ").concat(strin(fn)));
+          }
+
+          if (fn.rawArgs) {
+            return fn(_rawArgs, math, (0, _scope.createSubScope)(scope, args), scope); // "raw" evaluation
+          } else {
+            var values = evalArgs.map(function (evalArg) {
+              return evalArg(scope, args, context);
+            });
+            return fn.apply(fn, values);
+          }
+        };
+      }
+    } else if ((0, _is.isAccessorNode)(this.fn) && (0, _is.isIndexNode)(this.fn.index) && this.fn.index.isObjectProperty()) {
+      // execute the function with the right context: the object of the AccessorNode
+      var evalObject = this.fn.object._compile(math, argNames);
+
+      var prop = this.fn.index.getObjectProperty();
+      var _rawArgs2 = this.args;
+      return function evalFunctionNode(scope, args, context) {
+        var object = evalObject(scope, args, context);
+        (0, _customs.validateSafeMethod)(object, prop);
+        var isRaw = object[prop] && object[prop].rawArgs;
+
+        if (isRaw) {
+          return object[prop](_rawArgs2, math, (0, _scope.createSubScope)(scope, args), scope); // "raw" evaluation
+        } else {
+          // "regular" evaluation
+          var values = evalArgs.map(function (evalArg) {
+            return evalArg(scope, args, context);
+          });
+          return object[prop].apply(object, values);
+        }
+      };
+    } else {
+      // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()
+      // we have to dynamically determine whether the function has a rawArgs property
+      var fnExpr = this.fn.toString();
+
+      var evalFn = this.fn._compile(math, argNames);
+
+      var _rawArgs3 = this.args;
+      return function evalFunctionNode(scope, args, context) {
+        var fn = evalFn(scope, args, context);
+
+        if (typeof fn !== 'function') {
+          throw new TypeError("Expression '".concat(fnExpr, "' did not evaluate to a function; value is:") + "\n  ".concat(strin(fn)));
+        }
+
+        if (fn.rawArgs) {
+          return fn(_rawArgs3, math, (0, _scope.createSubScope)(scope, args), scope); // "raw" evaluation
+        } else {
+          // "regular" evaluation
+          var values = evalArgs.map(function (evalArg) {
+            return evalArg(scope, args, context);
+          });
+          return fn.apply(fn, values);
+        }
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  FunctionNode.prototype.forEach = function (callback) {
+    callback(this.fn, 'fn', this);
+
+    for (var i = 0; i < this.args.length; i++) {
+      callback(this.args[i], 'args[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new FunctionNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {FunctionNode} Returns a transformed copy of the node
+   */
+
+
+  FunctionNode.prototype.map = function (callback) {
+    var fn = this._ifNode(callback(this.fn, 'fn', this));
+
+    var args = [];
+
+    for (var i = 0; i < this.args.length; i++) {
+      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+    }
+
+    return new FunctionNode(fn, args);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {FunctionNode}
+   */
+
+
+  FunctionNode.prototype.clone = function () {
+    return new FunctionNode(this.fn, this.args.slice(0));
+  };
+  /**
+   * Throws an error 'Undefined function {name}'
+   * @param {string} name
+   */
+
+
+  FunctionNode.onUndefinedFunction = function (name) {
+    throw new Error('Undefined function ' + name);
+  }; // backup Node's toString function
+  // @private
+
+
+  var nodeToString = FunctionNode.prototype.toString;
+  /**
+   * Get string representation. (wrapper function)
+   * This overrides parts of Node's toString function.
+   * If callback is an object containing callbacks, it
+   * calls the correct callback for the current node,
+   * otherwise it falls back to calling Node's toString
+   * function.
+   *
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+  FunctionNode.prototype.toString = function (options) {
+    var customString;
+    var name = this.fn.toString(options);
+
+    if (options && (0, _typeof2.default)(options.handler) === 'object' && (0, _object.hasOwnProperty)(options.handler, name)) {
+      // callback is a map of callback functions
+      customString = options.handler[name](this, options);
+    }
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    } // fall back to Node's toString
+
+
+    return nodeToString.call(this, options);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionNode.prototype._toString = function (options) {
+    var args = this.args.map(function (arg) {
+      return arg.toString(options);
+    });
+    var fn = (0, _is.isFunctionAssignmentNode)(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options); // format the arguments like "add(2, 4.2)"
+
+    return fn + '(' + args.join(', ') + ')';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  FunctionNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'FunctionNode',
+      fn: this.fn,
+      args: this.args
+    };
+  };
+  /**
+   * Instantiate an AssignmentNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "FunctionNode", fn: ..., args: ...}`,
+   *                       where mathjs is optional
+   * @returns {FunctionNode}
+   */
+
+
+  FunctionNode.fromJSON = function (json) {
+    return new FunctionNode(json.fn, json.args);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionNode.prototype.toHTML = function (options) {
+    var args = this.args.map(function (arg) {
+      return arg.toHTML(options);
+    }); // format the arguments like "add(2, 4.2)"
+
+    return '<span class="math-function">' + (0, _string.escape)(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + args.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+  };
+  /*
+   * Expand a LaTeX template
+   *
+   * @param {string} template
+   * @param {Node} node
+   * @param {Object} options
+   * @private
+   **/
+
+
+  function expandTemplate(template, node, options) {
+    var latex = ''; // Match everything of the form ${identifier} or ${identifier[2]} or $$
+    // while submatching identifier and 2 (in the second case)
+
+    var regex = /\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi;
+    var inputPos = 0; // position in the input string
+
+    var match;
+
+    while ((match = regex.exec(template)) !== null) {
+      // go through all matches
+      // add everything in front of the match to the LaTeX string
+      latex += template.substring(inputPos, match.index);
+      inputPos = match.index;
+
+      if (match[0] === '$$') {
+        // escaped dollar sign
+        latex += '$';
+        inputPos++;
+      } else {
+        // template parameter
+        inputPos += match[0].length;
+        var property = node[match[1]];
+
+        if (!property) {
+          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');
+        }
+
+        if (match[2] === undefined) {
+          // no square brackets
+          switch ((0, _typeof2.default)(property)) {
+            case 'string':
+              latex += property;
+              break;
+
+            case 'object':
+              if ((0, _is.isNode)(property)) {
+                latex += property.toTex(options);
+              } else if (Array.isArray(property)) {
+                // make array of Nodes into comma separated list
+                latex += property.map(function (arg, index) {
+                  if ((0, _is.isNode)(arg)) {
+                    return arg.toTex(options);
+                  }
+
+                  throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');
+                }).join(',');
+              } else {
+                throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+              }
+
+              break;
+
+            default:
+              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+          }
+        } else {
+          // with square brackets
+          if ((0, _is.isNode)(property[match[2]] && property[match[2]])) {
+            latex += property[match[2]].toTex(options);
+          } else {
+            throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.');
+          }
+        }
+      }
+    }
+
+    latex += template.slice(inputPos); // append rest of the template
+
+    return latex;
+  } // backup Node's toTex function
+  // @private
+
+
+  var nodeToTex = FunctionNode.prototype.toTex;
+  /**
+   * Get LaTeX representation. (wrapper function)
+   * This overrides parts of Node's toTex function.
+   * If callback is an object containing callbacks, it
+   * calls the correct callback for the current node,
+   * otherwise it falls back to calling Node's toTex
+   * function.
+   *
+   * @param {Object} options
+   * @return {string}
+   */
+
+  FunctionNode.prototype.toTex = function (options) {
+    var customTex;
+
+    if (options && (0, _typeof2.default)(options.handler) === 'object' && (0, _object.hasOwnProperty)(options.handler, this.name)) {
+      // callback is a map of callback functions
+      customTex = options.handler[this.name](this, options);
+    }
+
+    if (typeof customTex !== 'undefined') {
+      return customTex;
+    } // fall back to Node's toTex
+
+
+    return nodeToTex.call(this, options);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionNode.prototype._toTex = function (options) {
+    var args = this.args.map(function (arg) {
+      // get LaTeX of the arguments
+      return arg.toTex(options);
+    });
+    var latexConverter;
+
+    if (_latex.latexFunctions[this.name]) {
+      latexConverter = _latex.latexFunctions[this.name];
+    } // toTex property on the function itself
+
+
+    if (math[this.name] && (typeof math[this.name].toTex === 'function' || (0, _typeof2.default)(math[this.name].toTex) === 'object' || typeof math[this.name].toTex === 'string')) {
+      // .toTex is a callback function
+      latexConverter = math[this.name].toTex;
+    }
+
+    var customToTex;
+
+    switch ((0, _typeof2.default)(latexConverter)) {
+      case 'function':
+        // a callback function
+        customToTex = latexConverter(this, options);
+        break;
+
+      case 'string':
+        // a template string
+        customToTex = expandTemplate(latexConverter, this, options);
+        break;
+
+      case 'object':
+        // an object with different "converters" for different numbers of arguments
+        switch ((0, _typeof2.default)(latexConverter[args.length])) {
+          case 'function':
+            customToTex = latexConverter[args.length](this, options);
+            break;
+
+          case 'string':
+            customToTex = expandTemplate(latexConverter[args.length], this, options);
+            break;
+        }
+
+    }
+
+    if (typeof customToTex !== 'undefined') {
+      return customToTex;
+    }
+
+    return expandTemplate(_latex.defaultTemplate, this, options);
+  };
+  /**
+   * Get identifier.
+   * @return {string}
+   */
+
+
+  FunctionNode.prototype.getIdentifier = function () {
+    return this.type + ':' + this.name;
+  };
+
+  return FunctionNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createFunctionNode = createFunctionNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/IndexNode.js b/node_modules/mathjs/lib/cjs/expression/node/IndexNode.js
new file mode 100644
index 0000000..ac24c16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/IndexNode.js
@@ -0,0 +1,286 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndexNode = void 0;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _string = require("../../utils/string.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _customs = require("../../utils/customs.js");
+
+var name = 'IndexNode';
+var dependencies = ['Range', 'Node', 'size'];
+var createIndexNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Range = _ref.Range,
+      Node = _ref.Node,
+      size = _ref.size;
+
+  /**
+   * @constructor IndexNode
+   * @extends Node
+   *
+   * Describes a subset of a matrix or an object property.
+   * Cannot be used on its own, needs to be used within an AccessorNode or
+   * AssignmentNode.
+   *
+   * @param {Node[]} dimensions
+   * @param {boolean} [dotNotation=false]  Optional property describing whether
+   *                                       this index was written using dot
+   *                                       notation like `a.b`, or using bracket
+   *                                       notation like `a["b"]` (default).
+   *                                       Used to stringify an IndexNode.
+   */
+  function IndexNode(dimensions, dotNotation) {
+    if (!(this instanceof IndexNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.dimensions = dimensions;
+    this.dotNotation = dotNotation || false; // validate input
+
+    if (!Array.isArray(dimensions) || !dimensions.every(_is.isNode)) {
+      throw new TypeError('Array containing Nodes expected for parameter "dimensions"');
+    }
+
+    if (this.dotNotation && !this.isObjectProperty()) {
+      throw new Error('dotNotation only applicable for object properties');
+    }
+  }
+
+  IndexNode.prototype = new Node();
+  IndexNode.prototype.type = 'IndexNode';
+  IndexNode.prototype.isIndexNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  IndexNode.prototype._compile = function (math, argNames) {
+    // TODO: implement support for bignumber (currently bignumbers are silently
+    //       reduced to numbers when changing the value to zero-based)
+    // TODO: Optimization: when the range values are ConstantNodes,
+    //       we can beforehand resolve the zero-based value
+    // optimization for a simple object property
+    var evalDimensions = (0, _array.map)(this.dimensions, function (range, i) {
+      if ((0, _is.isRangeNode)(range)) {
+        if (range.needsEnd()) {
+          // create a range containing end (like '4:end')
+          var childArgNames = Object.create(argNames);
+          childArgNames.end = true;
+
+          var evalStart = range.start._compile(math, childArgNames);
+
+          var evalEnd = range.end._compile(math, childArgNames);
+
+          var evalStep = range.step ? range.step._compile(math, childArgNames) : function () {
+            return 1;
+          };
+          return function evalDimension(scope, args, context) {
+            var s = size(context).valueOf();
+            var childArgs = Object.create(args);
+            childArgs.end = s[i];
+            return createRange(evalStart(scope, childArgs, context), evalEnd(scope, childArgs, context), evalStep(scope, childArgs, context));
+          };
+        } else {
+          // create range
+          var _evalStart = range.start._compile(math, argNames);
+
+          var _evalEnd = range.end._compile(math, argNames);
+
+          var _evalStep = range.step ? range.step._compile(math, argNames) : function () {
+            return 1;
+          };
+
+          return function evalDimension(scope, args, context) {
+            return createRange(_evalStart(scope, args, context), _evalEnd(scope, args, context), _evalStep(scope, args, context));
+          };
+        }
+      } else if ((0, _is.isSymbolNode)(range) && range.name === 'end') {
+        // SymbolNode 'end'
+        var _childArgNames = Object.create(argNames);
+
+        _childArgNames.end = true;
+
+        var evalRange = range._compile(math, _childArgNames);
+
+        return function evalDimension(scope, args, context) {
+          var s = size(context).valueOf();
+          var childArgs = Object.create(args);
+          childArgs.end = s[i];
+          return evalRange(scope, childArgs, context);
+        };
+      } else {
+        // ConstantNode
+        var _evalRange = range._compile(math, argNames);
+
+        return function evalDimension(scope, args, context) {
+          return _evalRange(scope, args, context);
+        };
+      }
+    });
+    var index = (0, _customs.getSafeProperty)(math, 'index');
+    return function evalIndexNode(scope, args, context) {
+      var dimensions = (0, _array.map)(evalDimensions, function (evalDimension) {
+        return evalDimension(scope, args, context);
+      });
+      return index.apply(void 0, (0, _toConsumableArray2.default)(dimensions));
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  IndexNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.dimensions.length; i++) {
+      callback(this.dimensions[i], 'dimensions[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new IndexNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {IndexNode} Returns a transformed copy of the node
+   */
+
+
+  IndexNode.prototype.map = function (callback) {
+    var dimensions = [];
+
+    for (var i = 0; i < this.dimensions.length; i++) {
+      dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));
+    }
+
+    return new IndexNode(dimensions, this.dotNotation);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {IndexNode}
+   */
+
+
+  IndexNode.prototype.clone = function () {
+    return new IndexNode(this.dimensions.slice(0), this.dotNotation);
+  };
+  /**
+   * Test whether this IndexNode contains a single property name
+   * @return {boolean}
+   */
+
+
+  IndexNode.prototype.isObjectProperty = function () {
+    return this.dimensions.length === 1 && (0, _is.isConstantNode)(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';
+  };
+  /**
+   * Returns the property name if IndexNode contains a property.
+   * If not, returns null.
+   * @return {string | null}
+   */
+
+
+  IndexNode.prototype.getObjectProperty = function () {
+    return this.isObjectProperty() ? this.dimensions[0].value : null;
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  IndexNode.prototype._toString = function (options) {
+    // format the parameters like "[1, 0:5]"
+    return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  IndexNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'IndexNode',
+      dimensions: this.dimensions,
+      dotNotation: this.dotNotation
+    };
+  };
+  /**
+   * Instantiate an IndexNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "IndexNode", dimensions: [...], dotNotation: false}`,
+   *                       where mathjs is optional
+   * @returns {IndexNode}
+   */
+
+
+  IndexNode.fromJSON = function (json) {
+    return new IndexNode(json.dimensions, json.dotNotation);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  IndexNode.prototype.toHTML = function (options) {
+    // format the parameters like "[1, 0:5]"
+    var dimensions = [];
+
+    for (var i = 0; i < this.dimensions.length; i++) {
+      dimensions[i] = this.dimensions[i].toHTML();
+    }
+
+    if (this.dotNotation) {
+      return '<span class="math-operator math-accessor-operator">.</span>' + '<span class="math-symbol math-property">' + (0, _string.escape)(this.getObjectProperty()) + '</span>';
+    } else {
+      return '<span class="math-parenthesis math-square-parenthesis">[</span>' + dimensions.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+    }
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  IndexNode.prototype._toTex = function (options) {
+    var dimensions = this.dimensions.map(function (range) {
+      return range.toTex(options);
+    });
+    return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';
+  }; // helper function to create a Range from start, step and end
+
+
+  function createRange(start, end, step) {
+    return new Range((0, _is.isBigNumber)(start) ? start.toNumber() : start, (0, _is.isBigNumber)(end) ? end.toNumber() : end, (0, _is.isBigNumber)(step) ? step.toNumber() : step);
+  }
+
+  return IndexNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createIndexNode = createIndexNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/Node.js b/node_modules/mathjs/lib/cjs/expression/node/Node.js
new file mode 100644
index 0000000..207f22c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/Node.js
@@ -0,0 +1,424 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNode = void 0;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _is = require("../../utils/is.js");
+
+var _keywords = require("../keywords.js");
+
+var _object = require("../../utils/object.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _map = require("../../utils/map.js");
+
+var name = 'Node';
+var dependencies = ['mathWithTransform'];
+var createNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var mathWithTransform = _ref.mathWithTransform;
+
+  /**
+   * Node
+   */
+  function Node() {
+    if (!(this instanceof Node)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+  }
+  /**
+   * Evaluate the node
+   * @param {Object} [scope]  Scope to read/write variables
+   * @return {*}              Returns the result
+   */
+
+
+  Node.prototype.evaluate = function (scope) {
+    return this.compile().evaluate(scope);
+  };
+
+  Node.prototype.type = 'Node';
+  Node.prototype.isNode = true;
+  Node.prototype.comment = '';
+  /**
+   * Compile the node into an optimized, evauatable JavaScript function
+   * @return {{evaluate: function([Object])}} object
+   *                Returns an object with a function 'evaluate',
+   *                which can be invoked as expr.evaluate([scope: Object]),
+   *                where scope is an optional object with
+   *                variables.
+   */
+
+  Node.prototype.compile = function () {
+    var expr = this._compile(mathWithTransform, {});
+
+    var args = {};
+    var context = null;
+
+    function evaluate(scope) {
+      var s = (0, _map.createMap)(scope);
+
+      _validateScope(s);
+
+      return expr(s, args, context);
+    }
+
+    return {
+      evaluate: evaluate
+    };
+  };
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+
+  Node.prototype._compile = function (math, argNames) {
+    throw new Error('Method _compile should be implemented by type ' + this.type);
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  Node.prototype.forEach = function (callback) {
+    // must be implemented by each of the Node implementations
+    throw new Error('Cannot run forEach on a Node interface');
+  };
+  /**
+   * Create a new Node having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {OperatorNode} Returns a transformed copy of the node
+   */
+
+
+  Node.prototype.map = function (callback) {
+    // must be implemented by each of the Node implementations
+    throw new Error('Cannot run map on a Node interface');
+  };
+  /**
+   * Validate whether an object is a Node, for use with map
+   * @param {Node} node
+   * @returns {Node} Returns the input if it's a node, else throws an Error
+   * @protected
+   */
+
+
+  Node.prototype._ifNode = function (node) {
+    if (!(0, _is.isNode)(node)) {
+      throw new TypeError('Callback function must return a Node');
+    }
+
+    return node;
+  };
+  /**
+   * Recursively traverse all nodes in a node tree. Executes given callback for
+   * this node and each of its child nodes.
+   * @param {function(node: Node, path: string, parent: Node)} callback
+   *          A callback called for every node in the node tree.
+   */
+
+
+  Node.prototype.traverse = function (callback) {
+    // execute callback for itself
+    // eslint-disable-next-line
+    callback(this, null, null); // recursively traverse over all childs of a node
+
+    function _traverse(node, callback) {
+      node.forEach(function (child, path, parent) {
+        callback(child, path, parent);
+
+        _traverse(child, callback);
+      });
+    }
+
+    _traverse(this, callback);
+  };
+  /**
+   * Recursively transform a node tree via a transform function.
+   *
+   * For example, to replace all nodes of type SymbolNode having name 'x' with a
+   * ConstantNode with value 2:
+   *
+   *     const res = Node.transform(function (node, path, parent) {
+   *       if (node && node.isSymbolNode) && (node.name === 'x')) {
+   *         return new ConstantNode(2)
+   *       }
+   *       else {
+   *         return node
+   *       }
+   *     })
+   *
+   * @param {function(node: Node, path: string, parent: Node) : Node} callback
+   *          A mapping function accepting a node, and returning
+   *          a replacement for the node or the original node.
+   *          Signature: callback(node: Node, index: string, parent: Node) : Node
+   * @return {Node} Returns the original node or its replacement
+   */
+
+
+  Node.prototype.transform = function (callback) {
+    function _transform(child, path, parent) {
+      var replacement = callback(child, path, parent);
+
+      if (replacement !== child) {
+        // stop iterating when the node is replaced
+        return replacement;
+      }
+
+      return child.map(_transform);
+    }
+
+    return _transform(this, null, null);
+  };
+  /**
+   * Find any node in the node tree matching given filter function. For example, to
+   * find all nodes of type SymbolNode having name 'x':
+   *
+   *     const results = Node.filter(function (node) {
+   *       return (node && node.isSymbolNode) && (node.name === 'x')
+   *     })
+   *
+   * @param {function(node: Node, path: string, parent: Node) : Node} callback
+   *            A test function returning true when a node matches, and false
+   *            otherwise. Function signature:
+   *            callback(node: Node, index: string, parent: Node) : boolean
+   * @return {Node[]} nodes       An array with nodes matching given filter criteria
+   */
+
+
+  Node.prototype.filter = function (callback) {
+    var nodes = [];
+    this.traverse(function (node, path, parent) {
+      if (callback(node, path, parent)) {
+        nodes.push(node);
+      }
+    });
+    return nodes;
+  };
+  /**
+   * Create a shallow clone of this node
+   * @return {Node}
+   */
+
+
+  Node.prototype.clone = function () {
+    // must be implemented by each of the Node implementations
+    throw new Error('Cannot clone a Node interface');
+  };
+  /**
+   * Create a deep clone of this node
+   * @return {Node}
+   */
+
+
+  Node.prototype.cloneDeep = function () {
+    return this.map(function (node) {
+      return node.cloneDeep();
+    });
+  };
+  /**
+   * Deep compare this node with another node.
+   * @param {Node} other
+   * @return {boolean} Returns true when both nodes are of the same type and
+   *                   contain the same values (as do their childs)
+   */
+
+
+  Node.prototype.equals = function (other) {
+    return other ? (0, _object.deepStrictEqual)(this, other) : false;
+  };
+  /**
+   * Get string representation. (wrapper function)
+   *
+   * This function can get an object of the following form:
+   * {
+   *    handler: //This can be a callback function of the form
+   *             // "function callback(node, options)"or
+   *             // a map that maps function names (used in FunctionNodes)
+   *             // to callbacks
+   *    parenthesis: "keep" //the parenthesis option (This is optional)
+   * }
+   *
+   * @param {Object} [options]
+   * @return {string}
+   */
+
+
+  Node.prototype.toString = function (options) {
+    var customString = this._getCustomString(options);
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    }
+
+    return this._toString(options);
+  };
+  /**
+   * Get a JSON representation of the node
+   * Both .toJSON() and the static .fromJSON(json) should be implemented by all
+   * implementations of Node
+   * @returns {Object}
+   */
+
+
+  Node.prototype.toJSON = function () {
+    throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);
+  };
+  /**
+   * Get HTML representation. (wrapper function)
+   *
+   * This function can get an object of the following form:
+   * {
+   *    handler: //This can be a callback function of the form
+   *             // "function callback(node, options)" or
+   *             // a map that maps function names (used in FunctionNodes)
+   *             // to callbacks
+   *    parenthesis: "keep" //the parenthesis option (This is optional)
+   * }
+   *
+   * @param {Object} [options]
+   * @return {string}
+   */
+
+
+  Node.prototype.toHTML = function (options) {
+    var customString = this._getCustomString(options);
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    }
+
+    return this.toHTML(options);
+  };
+  /**
+   * Internal function to generate the string output.
+   * This has to be implemented by every Node
+   *
+   * @throws {Error}
+   */
+
+
+  Node.prototype._toString = function () {
+    // must be implemented by each of the Node implementations
+    throw new Error('_toString not implemented for ' + this.type);
+  };
+  /**
+   * Get LaTeX representation. (wrapper function)
+   *
+   * This function can get an object of the following form:
+   * {
+   *    handler: //This can be a callback function of the form
+   *             // "function callback(node, options)"or
+   *             // a map that maps function names (used in FunctionNodes)
+   *             // to callbacks
+   *    parenthesis: "keep" //the parenthesis option (This is optional)
+   * }
+   *
+   * @param {Object} [options]
+   * @return {string}
+   */
+
+
+  Node.prototype.toTex = function (options) {
+    var customString = this._getCustomString(options);
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    }
+
+    return this._toTex(options);
+  };
+  /**
+   * Internal function to generate the LaTeX output.
+   * This has to be implemented by every Node
+   *
+   * @param {Object} [options]
+   * @throws {Error}
+   */
+
+
+  Node.prototype._toTex = function (options) {
+    // must be implemented by each of the Node implementations
+    throw new Error('_toTex not implemented for ' + this.type);
+  };
+  /**
+   * Helper used by `to...` functions.
+   */
+
+
+  Node.prototype._getCustomString = function (options) {
+    if (options && (0, _typeof2.default)(options) === 'object') {
+      switch ((0, _typeof2.default)(options.handler)) {
+        case 'object':
+        case 'undefined':
+          return;
+
+        case 'function':
+          return options.handler(this, options);
+
+        default:
+          throw new TypeError('Object or function expected as callback');
+      }
+    }
+  };
+  /**
+   * Get identifier.
+   * @return {string}
+   */
+
+
+  Node.prototype.getIdentifier = function () {
+    return this.type;
+  };
+  /**
+   * Get the content of the current Node.
+   * @return {Node} node
+   **/
+
+
+  Node.prototype.getContent = function () {
+    return this;
+  };
+  /**
+   * Validate the symbol names of a scope.
+   * Throws an error when the scope contains an illegal symbol.
+   * @param {Object} scope
+   */
+
+
+  function _validateScope(scope) {
+    for (var _i = 0, _arr = (0, _toConsumableArray2.default)(_keywords.keywords); _i < _arr.length; _i++) {
+      var symbol = _arr[_i];
+
+      if (scope.has(symbol)) {
+        throw new Error('Scope contains an illegal symbol, "' + symbol + '" is a reserved keyword');
+      }
+    }
+  }
+
+  return Node;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createNode = createNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ObjectNode.js b/node_modules/mathjs/lib/cjs/expression/node/ObjectNode.js
new file mode 100644
index 0000000..2963fd4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ObjectNode.js
@@ -0,0 +1,231 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createObjectNode = void 0;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _is = require("../../utils/is.js");
+
+var _string = require("../../utils/string.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _object = require("../../utils/object.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ObjectNode';
+var dependencies = ['Node'];
+var createObjectNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * @constructor ObjectNode
+   * @extends {Node}
+   * Holds an object with keys/values
+   * @param {Object.<string, Node>} [properties]   object with key/value pairs
+   */
+  function ObjectNode(properties) {
+    if (!(this instanceof ObjectNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.properties = properties || {}; // validate input
+
+    if (properties) {
+      if (!((0, _typeof2.default)(properties) === 'object') || !Object.keys(properties).every(function (key) {
+        return (0, _is.isNode)(properties[key]);
+      })) {
+        throw new TypeError('Object containing Nodes expected');
+      }
+    }
+  }
+
+  ObjectNode.prototype = new Node();
+  ObjectNode.prototype.type = 'ObjectNode';
+  ObjectNode.prototype.isObjectNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ObjectNode.prototype._compile = function (math, argNames) {
+    var evalEntries = {};
+
+    for (var key in this.properties) {
+      if ((0, _object.hasOwnProperty)(this.properties, key)) {
+        // we stringify/parse the key here to resolve unicode characters,
+        // so you cannot create a key like {"co\\u006Estructor": null}
+        var stringifiedKey = (0, _string.stringify)(key);
+        var parsedKey = JSON.parse(stringifiedKey);
+
+        if (!(0, _customs.isSafeProperty)(this.properties, parsedKey)) {
+          throw new Error('No access to property "' + parsedKey + '"');
+        }
+
+        evalEntries[parsedKey] = this.properties[key]._compile(math, argNames);
+      }
+    }
+
+    return function evalObjectNode(scope, args, context) {
+      var obj = {};
+
+      for (var _key in evalEntries) {
+        if ((0, _object.hasOwnProperty)(evalEntries, _key)) {
+          obj[_key] = evalEntries[_key](scope, args, context);
+        }
+      }
+
+      return obj;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ObjectNode.prototype.forEach = function (callback) {
+    for (var key in this.properties) {
+      if ((0, _object.hasOwnProperty)(this.properties, key)) {
+        callback(this.properties[key], 'properties[' + (0, _string.stringify)(key) + ']', this);
+      }
+    }
+  };
+  /**
+   * Create a new ObjectNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {ObjectNode} Returns a transformed copy of the node
+   */
+
+
+  ObjectNode.prototype.map = function (callback) {
+    var properties = {};
+
+    for (var key in this.properties) {
+      if ((0, _object.hasOwnProperty)(this.properties, key)) {
+        properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + (0, _string.stringify)(key) + ']', this));
+      }
+    }
+
+    return new ObjectNode(properties);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ObjectNode}
+   */
+
+
+  ObjectNode.prototype.clone = function () {
+    var properties = {};
+
+    for (var key in this.properties) {
+      if ((0, _object.hasOwnProperty)(this.properties, key)) {
+        properties[key] = this.properties[key];
+      }
+    }
+
+    return new ObjectNode(properties);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ObjectNode.prototype._toString = function (options) {
+    var entries = [];
+
+    for (var key in this.properties) {
+      if ((0, _object.hasOwnProperty)(this.properties, key)) {
+        entries.push((0, _string.stringify)(key) + ': ' + this.properties[key].toString(options));
+      }
+    }
+
+    return '{' + entries.join(', ') + '}';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ObjectNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ObjectNode',
+      properties: this.properties
+    };
+  };
+  /**
+   * Instantiate an OperatorNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ObjectNode", "properties": {...}}`,
+   *                       where mathjs is optional
+   * @returns {ObjectNode}
+   */
+
+
+  ObjectNode.fromJSON = function (json) {
+    return new ObjectNode(json.properties);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ObjectNode.prototype.toHTML = function (options) {
+    var entries = [];
+
+    for (var key in this.properties) {
+      if ((0, _object.hasOwnProperty)(this.properties, key)) {
+        entries.push('<span class="math-symbol math-property">' + (0, _string.escape)(key) + '</span>' + '<span class="math-operator math-assignment-operator math-property-assignment-operator math-binary-operator">:</span>' + this.properties[key].toHTML(options));
+      }
+    }
+
+    return '<span class="math-parenthesis math-curly-parenthesis">{</span>' + entries.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-curly-parenthesis">}</span>';
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ObjectNode.prototype._toTex = function (options) {
+    var entries = [];
+
+    for (var key in this.properties) {
+      if ((0, _object.hasOwnProperty)(this.properties, key)) {
+        entries.push('\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\');
+      }
+    }
+
+    return "\\left\\{\\begin{array}{ll}".concat(entries.join('\n'), "\\end{array}\\right\\}");
+  };
+
+  return ObjectNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createObjectNode = createObjectNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/OperatorNode.js b/node_modules/mathjs/lib/cjs/expression/node/OperatorNode.js
new file mode 100644
index 0000000..695f66c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/OperatorNode.js
@@ -0,0 +1,701 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOperatorNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _string = require("../../utils/string.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _operators = require("../operators.js");
+
+var _latex = require("../../utils/latex.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'OperatorNode';
+var dependencies = ['Node'];
+var createOperatorNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * @constructor OperatorNode
+   * @extends {Node}
+   * An operator with two arguments, like 2+3
+   *
+   * @param {string} op           Operator name, for example '+'
+   * @param {string} fn           Function name, for example 'add'
+   * @param {Node[]} args         Operator arguments
+   * @param {boolean} [implicit]  Is this an implicit multiplication?
+   * @param {boolean} [isPercentage] Is this an percentage Operation?
+   */
+  function OperatorNode(op, fn, args, implicit, isPercentage) {
+    if (!(this instanceof OperatorNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (typeof op !== 'string') {
+      throw new TypeError('string expected for parameter "op"');
+    }
+
+    if (typeof fn !== 'string') {
+      throw new TypeError('string expected for parameter "fn"');
+    }
+
+    if (!Array.isArray(args) || !args.every(_is.isNode)) {
+      throw new TypeError('Array containing Nodes expected for parameter "args"');
+    }
+
+    this.implicit = implicit === true;
+    this.isPercentage = isPercentage === true;
+    this.op = op;
+    this.fn = fn;
+    this.args = args || [];
+  }
+
+  OperatorNode.prototype = new Node();
+  OperatorNode.prototype.type = 'OperatorNode';
+  OperatorNode.prototype.isOperatorNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  OperatorNode.prototype._compile = function (math, argNames) {
+    // validate fn
+    if (typeof this.fn !== 'string' || !(0, _customs.isSafeMethod)(math, this.fn)) {
+      if (!math[this.fn]) {
+        throw new Error('Function ' + this.fn + ' missing in provided namespace "math"');
+      } else {
+        throw new Error('No access to function "' + this.fn + '"');
+      }
+    }
+
+    var fn = (0, _customs.getSafeProperty)(math, this.fn);
+    var evalArgs = (0, _array.map)(this.args, function (arg) {
+      return arg._compile(math, argNames);
+    });
+
+    if (evalArgs.length === 1) {
+      var evalArg0 = evalArgs[0];
+      return function evalOperatorNode(scope, args, context) {
+        return fn(evalArg0(scope, args, context));
+      };
+    } else if (evalArgs.length === 2) {
+      var _evalArg = evalArgs[0];
+      var evalArg1 = evalArgs[1];
+      return function evalOperatorNode(scope, args, context) {
+        return fn(_evalArg(scope, args, context), evalArg1(scope, args, context));
+      };
+    } else {
+      return function evalOperatorNode(scope, args, context) {
+        return fn.apply(null, (0, _array.map)(evalArgs, function (evalArg) {
+          return evalArg(scope, args, context);
+        }));
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  OperatorNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.args.length; i++) {
+      callback(this.args[i], 'args[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new OperatorNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {OperatorNode} Returns a transformed copy of the node
+   */
+
+
+  OperatorNode.prototype.map = function (callback) {
+    var args = [];
+
+    for (var i = 0; i < this.args.length; i++) {
+      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+    }
+
+    return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {OperatorNode}
+   */
+
+
+  OperatorNode.prototype.clone = function () {
+    return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);
+  };
+  /**
+   * Check whether this is an unary OperatorNode:
+   * has exactly one argument, like `-a`.
+   * @return {boolean} Returns true when an unary operator node, false otherwise.
+   */
+
+
+  OperatorNode.prototype.isUnary = function () {
+    return this.args.length === 1;
+  };
+  /**
+   * Check whether this is a binary OperatorNode:
+   * has exactly two arguments, like `a + b`.
+   * @return {boolean} Returns true when a binary operator node, false otherwise.
+   */
+
+
+  OperatorNode.prototype.isBinary = function () {
+    return this.args.length === 2;
+  };
+  /**
+   * Calculate which parentheses are necessary. Gets an OperatorNode
+   * (which is the root of the tree) and an Array of Nodes
+   * (this.args) and returns an array where 'true' means that an argument
+   * has to be enclosed in parentheses whereas 'false' means the opposite.
+   *
+   * @param {OperatorNode} root
+   * @param {string} parenthesis
+   * @param {Node[]} args
+   * @param {boolean} latex
+   * @return {boolean[]}
+   * @private
+   */
+
+
+  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {
+    // precedence of the root OperatorNode
+    var precedence = (0, _operators.getPrecedence)(root, parenthesis);
+    var associativity = (0, _operators.getAssociativity)(root, parenthesis);
+
+    if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {
+      return args.map(function (arg) {
+        switch (arg.getContent().type) {
+          // Nodes that don't need extra parentheses
+          case 'ArrayNode':
+          case 'ConstantNode':
+          case 'SymbolNode':
+          case 'ParenthesisNode':
+            return false;
+
+          default:
+            return true;
+        }
+      });
+    }
+
+    var result;
+
+    switch (args.length) {
+      case 0:
+        result = [];
+        break;
+
+      case 1:
+        // unary operators
+        {
+          // precedence of the operand
+          var operandPrecedence = (0, _operators.getPrecedence)(args[0], parenthesis); // handle special cases for LaTeX, where some of the parentheses aren't needed
+
+          if (latex && operandPrecedence !== null) {
+            var operandIdentifier;
+            var rootIdentifier;
+
+            if (parenthesis === 'keep') {
+              operandIdentifier = args[0].getIdentifier();
+              rootIdentifier = root.getIdentifier();
+            } else {
+              // Ignore Parenthesis Nodes when not in 'keep' mode
+              operandIdentifier = args[0].getContent().getIdentifier();
+              rootIdentifier = root.getContent().getIdentifier();
+            }
+
+            if (_operators.properties[precedence][rootIdentifier].latexLeftParens === false) {
+              result = [false];
+              break;
+            }
+
+            if (_operators.properties[operandPrecedence][operandIdentifier].latexParens === false) {
+              result = [false];
+              break;
+            }
+          }
+
+          if (operandPrecedence === null) {
+            // if the operand has no defined precedence, no parens are needed
+            result = [false];
+            break;
+          }
+
+          if (operandPrecedence <= precedence) {
+            // if the operands precedence is lower, parens are needed
+            result = [true];
+            break;
+          } // otherwise, no parens needed
+
+
+          result = [false];
+        }
+        break;
+
+      case 2:
+        // binary operators
+        {
+          var lhsParens; // left hand side needs parenthesis?
+          // precedence of the left hand side
+
+          var lhsPrecedence = (0, _operators.getPrecedence)(args[0], parenthesis); // is the root node associative with the left hand side
+
+          var assocWithLhs = (0, _operators.isAssociativeWith)(root, args[0], parenthesis);
+
+          if (lhsPrecedence === null) {
+            // if the left hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            lhsParens = false;
+          } else if (lhsPrecedence === precedence && associativity === 'right' && !assocWithLhs) {
+            // In case of equal precedence, if the root node is left associative
+            // parens are **never** necessary for the left hand side.
+            // If it is right associative however, parens are necessary
+            // if the root node isn't associative with the left hand side
+            lhsParens = true;
+          } else if (lhsPrecedence < precedence) {
+            lhsParens = true;
+          } else {
+            lhsParens = false;
+          }
+
+          var rhsParens; // right hand side needs parenthesis?
+          // precedence of the right hand side
+
+          var rhsPrecedence = (0, _operators.getPrecedence)(args[1], parenthesis); // is the root node associative with the right hand side?
+
+          var assocWithRhs = (0, _operators.isAssociativeWith)(root, args[1], parenthesis);
+
+          if (rhsPrecedence === null) {
+            // if the right hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            rhsParens = false;
+          } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {
+            // In case of equal precedence, if the root node is right associative
+            // parens are **never** necessary for the right hand side.
+            // If it is left associative however, parens are necessary
+            // if the root node isn't associative with the right hand side
+            rhsParens = true;
+          } else if (rhsPrecedence < precedence) {
+            rhsParens = true;
+          } else {
+            rhsParens = false;
+          } // handle special cases for LaTeX, where some of the parentheses aren't needed
+
+
+          if (latex) {
+            var _rootIdentifier;
+
+            var lhsIdentifier;
+            var rhsIdentifier;
+
+            if (parenthesis === 'keep') {
+              _rootIdentifier = root.getIdentifier();
+              lhsIdentifier = root.args[0].getIdentifier();
+              rhsIdentifier = root.args[1].getIdentifier();
+            } else {
+              // Ignore ParenthesisNodes when not in 'keep' mode
+              _rootIdentifier = root.getContent().getIdentifier();
+              lhsIdentifier = root.args[0].getContent().getIdentifier();
+              rhsIdentifier = root.args[1].getContent().getIdentifier();
+            }
+
+            if (lhsPrecedence !== null) {
+              if (_operators.properties[precedence][_rootIdentifier].latexLeftParens === false) {
+                lhsParens = false;
+              }
+
+              if (_operators.properties[lhsPrecedence][lhsIdentifier].latexParens === false) {
+                lhsParens = false;
+              }
+            }
+
+            if (rhsPrecedence !== null) {
+              if (_operators.properties[precedence][_rootIdentifier].latexRightParens === false) {
+                rhsParens = false;
+              }
+
+              if (_operators.properties[rhsPrecedence][rhsIdentifier].latexParens === false) {
+                rhsParens = false;
+              }
+            }
+          }
+
+          result = [lhsParens, rhsParens];
+        }
+        break;
+
+      default:
+        if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {
+          result = args.map(function (arg) {
+            var argPrecedence = (0, _operators.getPrecedence)(arg, parenthesis);
+            var assocWithArg = (0, _operators.isAssociativeWith)(root, arg, parenthesis);
+            var argAssociativity = (0, _operators.getAssociativity)(arg, parenthesis);
+
+            if (argPrecedence === null) {
+              // if the argument has no defined precedence, no parens are needed
+              return false;
+            } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {
+              return true;
+            } else if (argPrecedence < precedence) {
+              return true;
+            }
+
+            return false;
+          });
+        }
+
+        break;
+    } // handles an edge case of 'auto' parentheses with implicit multiplication of ConstantNode
+    // In that case print parentheses for ParenthesisNodes even though they normally wouldn't be
+    // printed.
+
+
+    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis === 'auto' && implicit === 'hide') {
+      result = args.map(function (arg, index) {
+        var isParenthesisNode = arg.getIdentifier() === 'ParenthesisNode';
+
+        if (result[index] || isParenthesisNode) {
+          // put in parenthesis?
+          return true;
+        }
+
+        return false;
+      });
+    }
+
+    return result;
+  }
+  /**
+   * Get string representation.
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  OperatorNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var implicit = options && options.implicit ? options.implicit : 'hide';
+    var args = this.args;
+    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+
+    if (args.length === 1) {
+      // unary operators
+      var assoc = (0, _operators.getAssociativity)(this, parenthesis);
+      var operand = args[0].toString(options);
+
+      if (parens[0]) {
+        operand = '(' + operand + ')';
+      } // for example for "not", we want a space between operand and argument
+
+
+      var opIsNamed = /[a-zA-Z]+/.test(this.op);
+
+      if (assoc === 'right') {
+        // prefix operator
+        return this.op + (opIsNamed ? ' ' : '') + operand;
+      } else if (assoc === 'left') {
+        // postfix
+        return operand + (opIsNamed ? ' ' : '') + this.op;
+      } // fall back to postfix
+
+
+      return operand + this.op;
+    } else if (args.length === 2) {
+      var lhs = args[0].toString(options); // left hand side
+
+      var rhs = args[1].toString(options); // right hand side
+
+      if (parens[0]) {
+        // left hand side in parenthesis?
+        lhs = '(' + lhs + ')';
+      }
+
+      if (parens[1]) {
+        // right hand side in parenthesis?
+        rhs = '(' + rhs + ')';
+      }
+
+      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+        return lhs + ' ' + rhs;
+      }
+
+      return lhs + ' ' + this.op + ' ' + rhs;
+    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+      var stringifiedArgs = args.map(function (arg, index) {
+        arg = arg.toString(options);
+
+        if (parens[index]) {
+          // put in parenthesis?
+          arg = '(' + arg + ')';
+        }
+
+        return arg;
+      });
+
+      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+        return stringifiedArgs.join(' ');
+      }
+
+      return stringifiedArgs.join(' ' + this.op + ' ');
+    } else {
+      // fallback to formatting as a function call
+      return this.fn + '(' + this.args.join(', ') + ')';
+    }
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  OperatorNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'OperatorNode',
+      op: this.op,
+      fn: this.fn,
+      args: this.args,
+      implicit: this.implicit,
+      isPercentage: this.isPercentage
+    };
+  };
+  /**
+   * Instantiate an OperatorNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "OperatorNode", "op": "+", "fn": "add", "args": [...], "implicit": false, "isPercentage":false}`,
+   *                       where mathjs is optional
+   * @returns {OperatorNode}
+   */
+
+
+  OperatorNode.fromJSON = function (json) {
+    return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);
+  };
+  /**
+   * Get HTML representation.
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  OperatorNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var implicit = options && options.implicit ? options.implicit : 'hide';
+    var args = this.args;
+    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+
+    if (args.length === 1) {
+      // unary operators
+      var assoc = (0, _operators.getAssociativity)(this, parenthesis);
+      var operand = args[0].toHTML(options);
+
+      if (parens[0]) {
+        operand = '<span class="math-parenthesis math-round-parenthesis">(</span>' + operand + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      if (assoc === 'right') {
+        // prefix operator
+        return '<span class="math-operator math-unary-operator math-lefthand-unary-operator">' + (0, _string.escape)(this.op) + '</span>' + operand;
+      } else {
+        // postfix when assoc === 'left' or undefined
+        return operand + '<span class="math-operator math-unary-operator math-righthand-unary-operator">' + (0, _string.escape)(this.op) + '</span>';
+      }
+    } else if (args.length === 2) {
+      // binary operatoes
+      var lhs = args[0].toHTML(options); // left hand side
+
+      var rhs = args[1].toHTML(options); // right hand side
+
+      if (parens[0]) {
+        // left hand side in parenthesis?
+        lhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + lhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      if (parens[1]) {
+        // right hand side in parenthesis?
+        rhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + rhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+        return lhs + '<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>' + rhs;
+      }
+
+      return lhs + '<span class="math-operator math-binary-operator math-explicit-binary-operator">' + (0, _string.escape)(this.op) + '</span>' + rhs;
+    } else {
+      var stringifiedArgs = args.map(function (arg, index) {
+        arg = arg.toHTML(options);
+
+        if (parens[index]) {
+          // put in parenthesis?
+          arg = '<span class="math-parenthesis math-round-parenthesis">(</span>' + arg + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+
+        return arg;
+      });
+
+      if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return stringifiedArgs.join('<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>');
+        }
+
+        return stringifiedArgs.join('<span class="math-operator math-binary-operator math-explicit-binary-operator">' + (0, _string.escape)(this.op) + '</span>');
+      } else {
+        // fallback to formatting as a function call
+        return '<span class="math-function">' + (0, _string.escape)(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + stringifiedArgs.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+      }
+    }
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  OperatorNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var implicit = options && options.implicit ? options.implicit : 'hide';
+    var args = this.args;
+    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);
+    var op = _latex.latexOperators[this.fn];
+    op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op
+
+    if (args.length === 1) {
+      // unary operators
+      var assoc = (0, _operators.getAssociativity)(this, parenthesis);
+      var operand = args[0].toTex(options);
+
+      if (parens[0]) {
+        operand = "\\left(".concat(operand, "\\right)");
+      }
+
+      if (assoc === 'right') {
+        // prefix operator
+        return op + operand;
+      } else if (assoc === 'left') {
+        // postfix operator
+        return operand + op;
+      } // fall back to postfix
+
+
+      return operand + op;
+    } else if (args.length === 2) {
+      // binary operators
+      var lhs = args[0]; // left hand side
+
+      var lhsTex = lhs.toTex(options);
+
+      if (parens[0]) {
+        lhsTex = "\\left(".concat(lhsTex, "\\right)");
+      }
+
+      var rhs = args[1]; // right hand side
+
+      var rhsTex = rhs.toTex(options);
+
+      if (parens[1]) {
+        rhsTex = "\\left(".concat(rhsTex, "\\right)");
+      } // handle some exceptions (due to the way LaTeX works)
+
+
+      var lhsIdentifier;
+
+      if (parenthesis === 'keep') {
+        lhsIdentifier = lhs.getIdentifier();
+      } else {
+        // Ignore ParenthesisNodes if in 'keep' mode
+        lhsIdentifier = lhs.getContent().getIdentifier();
+      }
+
+      switch (this.getIdentifier()) {
+        case 'OperatorNode:divide':
+          // op contains '\\frac' at this point
+          return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';
+
+        case 'OperatorNode:pow':
+          lhsTex = '{' + lhsTex + '}';
+          rhsTex = '{' + rhsTex + '}';
+
+          switch (lhsIdentifier) {
+            case 'ConditionalNode': //
+
+            case 'OperatorNode:divide':
+              lhsTex = "\\left(".concat(lhsTex, "\\right)");
+          }
+
+          break;
+
+        case 'OperatorNode:multiply':
+          if (this.implicit && implicit === 'hide') {
+            return lhsTex + '~' + rhsTex;
+          }
+
+      }
+
+      return lhsTex + op + rhsTex;
+    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+      var texifiedArgs = args.map(function (arg, index) {
+        arg = arg.toTex(options);
+
+        if (parens[index]) {
+          arg = "\\left(".concat(arg, "\\right)");
+        }
+
+        return arg;
+      });
+
+      if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit) {
+        return texifiedArgs.join('~');
+      }
+
+      return texifiedArgs.join(op);
+    } else {
+      // fall back to formatting as a function call
+      // as this is a fallback, it doesn't use
+      // fancy function names
+      return '\\mathrm{' + this.fn + '}\\left(' + args.map(function (arg) {
+        return arg.toTex(options);
+      }).join(',') + '\\right)';
+    }
+  };
+  /**
+   * Get identifier.
+   * @return {string}
+   */
+
+
+  OperatorNode.prototype.getIdentifier = function () {
+    return this.type + ':' + this.fn;
+  };
+
+  return OperatorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createOperatorNode = createOperatorNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ParenthesisNode.js b/node_modules/mathjs/lib/cjs/expression/node/ParenthesisNode.js
new file mode 100644
index 0000000..faff9d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ParenthesisNode.js
@@ -0,0 +1,172 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParenthesisNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ParenthesisNode';
+var dependencies = ['Node'];
+var createParenthesisNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * @constructor ParenthesisNode
+   * @extends {Node}
+   * A parenthesis node describes manual parenthesis from the user input
+   * @param {Node} content
+   * @extends {Node}
+   */
+  function ParenthesisNode(content) {
+    if (!(this instanceof ParenthesisNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (!(0, _is.isNode)(content)) {
+      throw new TypeError('Node expected for parameter "content"');
+    }
+
+    this.content = content;
+  }
+
+  ParenthesisNode.prototype = new Node();
+  ParenthesisNode.prototype.type = 'ParenthesisNode';
+  ParenthesisNode.prototype.isParenthesisNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ParenthesisNode.prototype._compile = function (math, argNames) {
+    return this.content._compile(math, argNames);
+  };
+  /**
+   * Get the content of the current Node.
+   * @return {Node} content
+   * @override
+   **/
+
+
+  ParenthesisNode.prototype.getContent = function () {
+    return this.content.getContent();
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ParenthesisNode.prototype.forEach = function (callback) {
+    callback(this.content, 'content', this);
+  };
+  /**
+   * Create a new ParenthesisNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node) : Node} callback
+   * @returns {ParenthesisNode} Returns a clone of the node
+   */
+
+
+  ParenthesisNode.prototype.map = function (callback) {
+    var content = callback(this.content, 'content', this);
+    return new ParenthesisNode(content);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ParenthesisNode}
+   */
+
+
+  ParenthesisNode.prototype.clone = function () {
+    return new ParenthesisNode(this.content);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ParenthesisNode.prototype._toString = function (options) {
+    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+      return '(' + this.content.toString(options) + ')';
+    }
+
+    return this.content.toString(options);
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ParenthesisNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ParenthesisNode',
+      content: this.content
+    };
+  };
+  /**
+   * Instantiate an ParenthesisNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ParenthesisNode", "content": ...}`,
+   *                       where mathjs is optional
+   * @returns {ParenthesisNode}
+   */
+
+
+  ParenthesisNode.fromJSON = function (json) {
+    return new ParenthesisNode(json.content);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ParenthesisNode.prototype.toHTML = function (options) {
+    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+      return '<span class="math-parenthesis math-round-parenthesis">(</span>' + this.content.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return this.content.toHTML(options);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ParenthesisNode.prototype._toTex = function (options) {
+    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+      return "\\left(".concat(this.content.toTex(options), "\\right)");
+    }
+
+    return this.content.toTex(options);
+  };
+
+  return ParenthesisNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createParenthesisNode = createParenthesisNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/RangeNode.js b/node_modules/mathjs/lib/cjs/expression/node/RangeNode.js
new file mode 100644
index 0000000..b381f96
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/RangeNode.js
@@ -0,0 +1,297 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRangeNode = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _operators = require("../operators.js");
+
+var name = 'RangeNode';
+var dependencies = ['Node'];
+var createRangeNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * @constructor RangeNode
+   * @extends {Node}
+   * create a range
+   * @param {Node} start  included lower-bound
+   * @param {Node} end    included upper-bound
+   * @param {Node} [step] optional step
+   */
+  function RangeNode(start, end, step) {
+    if (!(this instanceof RangeNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate inputs
+
+
+    if (!(0, _is.isNode)(start)) throw new TypeError('Node expected');
+    if (!(0, _is.isNode)(end)) throw new TypeError('Node expected');
+    if (step && !(0, _is.isNode)(step)) throw new TypeError('Node expected');
+    if (arguments.length > 3) throw new Error('Too many arguments');
+    this.start = start; // included lower-bound
+
+    this.end = end; // included upper-bound
+
+    this.step = step || null; // optional step
+  }
+
+  RangeNode.prototype = new Node();
+  RangeNode.prototype.type = 'RangeNode';
+  RangeNode.prototype.isRangeNode = true;
+  /**
+   * Check whether the RangeNode needs the `end` symbol to be defined.
+   * This end is the size of the Matrix in current dimension.
+   * @return {boolean}
+   */
+
+  RangeNode.prototype.needsEnd = function () {
+    // find all `end` symbols in this RangeNode
+    var endSymbols = this.filter(function (node) {
+      return (0, _is.isSymbolNode)(node) && node.name === 'end';
+    });
+    return endSymbols.length > 0;
+  };
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+
+  RangeNode.prototype._compile = function (math, argNames) {
+    var range = math.range;
+
+    var evalStart = this.start._compile(math, argNames);
+
+    var evalEnd = this.end._compile(math, argNames);
+
+    if (this.step) {
+      var evalStep = this.step._compile(math, argNames);
+
+      return function evalRangeNode(scope, args, context) {
+        return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));
+      };
+    } else {
+      return function evalRangeNode(scope, args, context) {
+        return range(evalStart(scope, args, context), evalEnd(scope, args, context));
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  RangeNode.prototype.forEach = function (callback) {
+    callback(this.start, 'start', this);
+    callback(this.end, 'end', this);
+
+    if (this.step) {
+      callback(this.step, 'step', this);
+    }
+  };
+  /**
+   * Create a new RangeNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {RangeNode} Returns a transformed copy of the node
+   */
+
+
+  RangeNode.prototype.map = function (callback) {
+    return new RangeNode(this._ifNode(callback(this.start, 'start', this)), this._ifNode(callback(this.end, 'end', this)), this.step && this._ifNode(callback(this.step, 'step', this)));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {RangeNode}
+   */
+
+
+  RangeNode.prototype.clone = function () {
+    return new RangeNode(this.start, this.end, this.step && this.step);
+  };
+  /**
+   * Calculate the necessary parentheses
+   * @param {Node} node
+   * @param {string} parenthesis
+   * @return {Object} parentheses
+   * @private
+   */
+
+
+  function calculateNecessaryParentheses(node, parenthesis) {
+    var precedence = (0, _operators.getPrecedence)(node, parenthesis);
+    var parens = {};
+    var startPrecedence = (0, _operators.getPrecedence)(node.start, parenthesis);
+    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';
+
+    if (node.step) {
+      var stepPrecedence = (0, _operators.getPrecedence)(node.step, parenthesis);
+      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';
+    }
+
+    var endPrecedence = (0, _operators.getPrecedence)(node.end, parenthesis);
+    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';
+    return parens;
+  }
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RangeNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop
+
+    var str;
+    var start = this.start.toString(options);
+
+    if (parens.start) {
+      start = '(' + start + ')';
+    }
+
+    str = start;
+
+    if (this.step) {
+      var step = this.step.toString(options);
+
+      if (parens.step) {
+        step = '(' + step + ')';
+      }
+
+      str += ':' + step;
+    }
+
+    var end = this.end.toString(options);
+
+    if (parens.end) {
+      end = '(' + end + ')';
+    }
+
+    str += ':' + end;
+    return str;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  RangeNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'RangeNode',
+      start: this.start,
+      end: this.end,
+      step: this.step
+    };
+  };
+  /**
+   * Instantiate an RangeNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "RangeNode", "start": ..., "end": ..., "step": ...}`,
+   *                       where mathjs is optional
+   * @returns {RangeNode}
+   */
+
+
+  RangeNode.fromJSON = function (json) {
+    return new RangeNode(json.start, json.end, json.step);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RangeNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop
+
+    var str;
+    var start = this.start.toHTML(options);
+
+    if (parens.start) {
+      start = '<span class="math-parenthesis math-round-parenthesis">(</span>' + start + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    str = start;
+
+    if (this.step) {
+      var step = this.step.toHTML(options);
+
+      if (parens.step) {
+        step = '<span class="math-parenthesis math-round-parenthesis">(</span>' + step + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      str += '<span class="math-operator math-range-operator">:</span>' + step;
+    }
+
+    var end = this.end.toHTML(options);
+
+    if (parens.end) {
+      end = '<span class="math-parenthesis math-round-parenthesis">(</span>' + end + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    str += '<span class="math-operator math-range-operator">:</span>' + end;
+    return str;
+  };
+  /**
+   * Get LaTeX representation
+   * @params {Object} options
+   * @return {string} str
+   */
+
+
+  RangeNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var parens = calculateNecessaryParentheses(this, parenthesis);
+    var str = this.start.toTex(options);
+
+    if (parens.start) {
+      str = "\\left(".concat(str, "\\right)");
+    }
+
+    if (this.step) {
+      var step = this.step.toTex(options);
+
+      if (parens.step) {
+        step = "\\left(".concat(step, "\\right)");
+      }
+
+      str += ':' + step;
+    }
+
+    var end = this.end.toTex(options);
+
+    if (parens.end) {
+      end = "\\left(".concat(end, "\\right)");
+    }
+
+    str += ':' + end;
+    return str;
+  };
+
+  return RangeNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createRangeNode = createRangeNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/RelationalNode.js b/node_modules/mathjs/lib/cjs/expression/node/RelationalNode.js
new file mode 100644
index 0000000..e25b02c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/RelationalNode.js
@@ -0,0 +1,233 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRelationalNode = void 0;
+
+var _operators = require("../operators.js");
+
+var _string = require("../../utils/string.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _latex = require("../../utils/latex.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'RelationalNode';
+var dependencies = ['Node'];
+var createRelationalNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Node = _ref.Node;
+
+  /**
+   * A node representing a chained conditional expression, such as 'x > y > z'
+   *
+   * @param {String[]} conditionals   An array of conditional operators used to compare the parameters
+   * @param {Node[]} params   The parameters that will be compared
+   *
+   * @constructor RelationalNode
+   * @extends {Node}
+   */
+  function RelationalNode(conditionals, params) {
+    if (!(this instanceof RelationalNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!Array.isArray(conditionals)) throw new TypeError('Parameter conditionals must be an array');
+    if (!Array.isArray(params)) throw new TypeError('Parameter params must be an array');
+    if (conditionals.length !== params.length - 1) throw new TypeError('Parameter params must contain exactly one more element than parameter conditionals');
+    this.conditionals = conditionals;
+    this.params = params;
+  }
+
+  RelationalNode.prototype = new Node();
+  RelationalNode.prototype.type = 'RelationalNode';
+  RelationalNode.prototype.isRelationalNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  RelationalNode.prototype._compile = function (math, argNames) {
+    var self = this;
+    var compiled = this.params.map(function (p) {
+      return p._compile(math, argNames);
+    });
+    return function evalRelationalNode(scope, args, context) {
+      var evalLhs;
+      var evalRhs = compiled[0](scope, args, context);
+
+      for (var i = 0; i < self.conditionals.length; i++) {
+        evalLhs = evalRhs;
+        evalRhs = compiled[i + 1](scope, args, context);
+        var condFn = (0, _customs.getSafeProperty)(math, self.conditionals[i]);
+
+        if (!condFn(evalLhs, evalRhs)) {
+          return false;
+        }
+      }
+
+      return true;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  RelationalNode.prototype.forEach = function (callback) {
+    var _this = this;
+
+    this.params.forEach(function (n, i) {
+      return callback(n, 'params[' + i + ']', _this);
+    }, this);
+  };
+  /**
+   * Create a new RelationalNode having its childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {RelationalNode} Returns a transformed copy of the node
+   */
+
+
+  RelationalNode.prototype.map = function (callback) {
+    var _this2 = this;
+
+    return new RelationalNode(this.conditionals.slice(), this.params.map(function (n, i) {
+      return _this2._ifNode(callback(n, 'params[' + i + ']', _this2));
+    }, this));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {RelationalNode}
+   */
+
+
+  RelationalNode.prototype.clone = function () {
+    return new RelationalNode(this.conditionals, this.params);
+  };
+  /**
+   * Get string representation.
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RelationalNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = (0, _operators.getPrecedence)(this, parenthesis);
+    var paramStrings = this.params.map(function (p, index) {
+      var paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis);
+      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);
+    });
+    var operatorMap = {
+      equal: '==',
+      unequal: '!=',
+      smaller: '<',
+      larger: '>',
+      smallerEq: '<=',
+      largerEq: '>='
+    };
+    var ret = paramStrings[0];
+
+    for (var i = 0; i < this.conditionals.length; i++) {
+      ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1];
+    }
+
+    return ret;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  RelationalNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'RelationalNode',
+      conditionals: this.conditionals,
+      params: this.params
+    };
+  };
+  /**
+   * Instantiate a RelationalNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "RelationalNode", "condition": ..., "trueExpr": ..., "falseExpr": ...}`,
+   *                       where mathjs is optional
+   * @returns {RelationalNode}
+   */
+
+
+  RelationalNode.fromJSON = function (json) {
+    return new RelationalNode(json.conditionals, json.params);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RelationalNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = (0, _operators.getPrecedence)(this, parenthesis);
+    var paramStrings = this.params.map(function (p, index) {
+      var paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis);
+      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '<span class="math-parenthesis math-round-parenthesis">(</span>' + p.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>' : p.toHTML(options);
+    });
+    var operatorMap = {
+      equal: '==',
+      unequal: '!=',
+      smaller: '<',
+      larger: '>',
+      smallerEq: '<=',
+      largerEq: '>='
+    };
+    var ret = paramStrings[0];
+
+    for (var i = 0; i < this.conditionals.length; i++) {
+      ret += '<span class="math-operator math-binary-operator math-explicit-binary-operator">' + (0, _string.escape)(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1];
+    }
+
+    return ret;
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RelationalNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = (0, _operators.getPrecedence)(this, parenthesis);
+    var paramStrings = this.params.map(function (p, index) {
+      var paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis);
+      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\left(' + p.toTex(options) + '\right)' : p.toTex(options);
+    });
+    var ret = paramStrings[0];
+
+    for (var i = 0; i < this.conditionals.length; i++) {
+      ret += _latex.latexOperators[this.conditionals[i]] + paramStrings[i + 1];
+    }
+
+    return ret;
+  };
+
+  return RelationalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createRelationalNode = createRelationalNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/SymbolNode.js b/node_modules/mathjs/lib/cjs/expression/node/SymbolNode.js
new file mode 100644
index 0000000..9900715
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/SymbolNode.js
@@ -0,0 +1,217 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSymbolNode = void 0;
+
+var _string = require("../../utils/string.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _latex = require("../../utils/latex.js");
+
+var name = 'SymbolNode';
+var dependencies = ['math', '?Unit', 'Node'];
+var createSymbolNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var math = _ref.math,
+      Unit = _ref.Unit,
+      Node = _ref.Node;
+
+  /**
+   * Check whether some name is a valueless unit like "inch".
+   * @param {string} name
+   * @return {boolean}
+   */
+  function isValuelessUnit(name) {
+    return Unit ? Unit.isValuelessUnit(name) : false;
+  }
+  /**
+   * @constructor SymbolNode
+   * @extends {Node}
+   * A symbol node can hold and resolve a symbol
+   * @param {string} name
+   * @extends {Node}
+   */
+
+
+  function SymbolNode(name) {
+    if (!(this instanceof SymbolNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (typeof name !== 'string') throw new TypeError('String expected for parameter "name"');
+    this.name = name;
+  }
+
+  SymbolNode.prototype = new Node();
+  SymbolNode.prototype.type = 'SymbolNode';
+  SymbolNode.prototype.isSymbolNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  SymbolNode.prototype._compile = function (math, argNames) {
+    var name = this.name;
+
+    if (argNames[name] === true) {
+      // this is a FunctionAssignment argument
+      // (like an x when inside the expression of a function assignment `f(x) = ...`)
+      return function (scope, args, context) {
+        return args[name];
+      };
+    } else if (name in math) {
+      return function (scope, args, context) {
+        return scope.has(name) ? scope.get(name) : (0, _customs.getSafeProperty)(math, name);
+      };
+    } else {
+      var isUnit = isValuelessUnit(name);
+      return function (scope, args, context) {
+        return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  SymbolNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs
+  };
+  /**
+   * Create a new SymbolNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node) : Node} callback
+   * @returns {SymbolNode} Returns a clone of the node
+   */
+
+
+  SymbolNode.prototype.map = function (callback) {
+    return this.clone();
+  };
+  /**
+   * Throws an error 'Undefined symbol {name}'
+   * @param {string} name
+   */
+
+
+  SymbolNode.onUndefinedSymbol = function (name) {
+    throw new Error('Undefined symbol ' + name);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {SymbolNode}
+   */
+
+
+  SymbolNode.prototype.clone = function () {
+    return new SymbolNode(this.name);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  SymbolNode.prototype._toString = function (options) {
+    return this.name;
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  SymbolNode.prototype.toHTML = function (options) {
+    var name = (0, _string.escape)(this.name);
+
+    if (name === 'true' || name === 'false') {
+      return '<span class="math-symbol math-boolean">' + name + '</span>';
+    } else if (name === 'i') {
+      return '<span class="math-symbol math-imaginary-symbol">' + name + '</span>';
+    } else if (name === 'Infinity') {
+      return '<span class="math-symbol math-infinity-symbol">' + name + '</span>';
+    } else if (name === 'NaN') {
+      return '<span class="math-symbol math-nan-symbol">' + name + '</span>';
+    } else if (name === 'null') {
+      return '<span class="math-symbol math-null-symbol">' + name + '</span>';
+    } else if (name === 'undefined') {
+      return '<span class="math-symbol math-undefined-symbol">' + name + '</span>';
+    }
+
+    return '<span class="math-symbol">' + name + '</span>';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  SymbolNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'SymbolNode',
+      name: this.name
+    };
+  };
+  /**
+   * Instantiate a SymbolNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SymbolNode", name: "x"}`,
+   *                       where mathjs is optional
+   * @returns {SymbolNode}
+   */
+
+
+  SymbolNode.fromJSON = function (json) {
+    return new SymbolNode(json.name);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  SymbolNode.prototype._toTex = function (options) {
+    var isUnit = false;
+
+    if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {
+      isUnit = true;
+    }
+
+    var symbol = (0, _latex.toSymbol)(this.name, isUnit);
+
+    if (symbol[0] === '\\') {
+      // no space needed if the symbol starts with '\'
+      return symbol;
+    } // the space prevents symbols from breaking stuff like '\cdot' if it's written right before the symbol
+
+
+    return ' ' + symbol;
+  };
+
+  return SymbolNode;
+}, {
+  isClass: true,
+  isNode: true
+});
+exports.createSymbolNode = createSymbolNode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/utils/access.js b/node_modules/mathjs/lib/cjs/expression/node/utils/access.js
new file mode 100644
index 0000000..a434fb7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/utils/access.js
@@ -0,0 +1,53 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.accessFactory = accessFactory;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _errorTransform = require("../../transform/utils/errorTransform.js");
+
+var _customs = require("../../../utils/customs.js");
+
+function accessFactory(_ref) {
+  var subset = _ref.subset;
+
+  /**
+   * Retrieve part of an object:
+   *
+   * - Retrieve a property from an object
+   * - Retrieve a part of a string
+   * - Retrieve a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @return {Object | Array | Matrix | string} Returns the subset
+   */
+  return function access(object, index) {
+    try {
+      if (Array.isArray(object)) {
+        return subset(object, index);
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index);
+      } else if (typeof object === 'string') {
+        // TODO: move getStringSubset into a separate util file, use that
+        return subset(object, index);
+      } else if ((0, _typeof2.default)(object) === 'object') {
+        if (!index.isObjectProperty()) {
+          throw new TypeError('Cannot apply a numeric index as object property');
+        }
+
+        return (0, _customs.getSafeProperty)(object, index.getObjectProperty());
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw (0, _errorTransform.errorTransform)(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/utils/assign.js b/node_modules/mathjs/lib/cjs/expression/node/utils/assign.js
new file mode 100644
index 0000000..23b1a45
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/utils/assign.js
@@ -0,0 +1,59 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.assignFactory = assignFactory;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _errorTransform = require("../../transform/utils/errorTransform.js");
+
+var _customs = require("../../../utils/customs.js");
+
+function assignFactory(_ref) {
+  var subset = _ref.subset,
+      matrix = _ref.matrix;
+
+  /**
+   * Replace part of an object:
+   *
+   * - Assign a property to an object
+   * - Replace a part of a string
+   * - Replace a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @param {*} value
+   * @return {Object | Array | Matrix | string} Returns the original object
+   *                                            except in case of a string
+   */
+  // TODO: change assign to return the value instead of the object
+  return function assign(object, index, value) {
+    try {
+      if (Array.isArray(object)) {
+        // we use matrix.subset here instead of the function subset because we must not clone the contents
+        return matrix(object).subset(index, value).valueOf();
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index, value);
+      } else if (typeof object === 'string') {
+        // TODO: move setStringSubset into a separate util file, use that
+        return subset(object, index, value);
+      } else if ((0, _typeof2.default)(object) === 'object') {
+        if (!index.isObjectProperty()) {
+          throw TypeError('Cannot apply a numeric index as object property');
+        }
+
+        (0, _customs.setSafeProperty)(object, index.getObjectProperty(), value);
+        return object;
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw (0, _errorTransform.errorTransform)(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/operators.js b/node_modules/mathjs/lib/cjs/expression/operators.js
new file mode 100644
index 0000000..e060bea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/operators.js
@@ -0,0 +1,324 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getAssociativity = getAssociativity;
+exports.getPrecedence = getPrecedence;
+exports.isAssociativeWith = isAssociativeWith;
+exports.properties = void 0;
+
+var _object = require("../utils/object.js");
+
+// list of identifiers of nodes in order of their precedence
+// also contains information about left/right associativity
+// and which other operator the operator is associative with
+// Example:
+// addition is associative with addition and subtraction, because:
+// (a+b)+c=a+(b+c)
+// (a+b)-c=a+(b-c)
+//
+// postfix operators are left associative, prefix operators
+// are right associative
+//
+// It's also possible to set the following properties:
+// latexParens: if set to false, this node doesn't need to be enclosed
+//              in parentheses when using LaTeX
+// latexLeftParens: if set to false, this !OperatorNode's!
+//                  left argument doesn't need to be enclosed
+//                  in parentheses
+// latexRightParens: the same for the right argument
+var properties = [{
+  // assignment
+  AssignmentNode: {},
+  FunctionAssignmentNode: {}
+}, {
+  // conditional expression
+  ConditionalNode: {
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false // conditionals don't need parentheses in LaTeX because
+    // they are 2 dimensional
+
+  }
+}, {
+  // logical or
+  'OperatorNode:or': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical xor
+  'OperatorNode:xor': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical and
+  'OperatorNode:and': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise or
+  'OperatorNode:bitOr': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise xor
+  'OperatorNode:bitXor': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise and
+  'OperatorNode:bitAnd': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // relational operators
+  'OperatorNode:equal': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:unequal': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smaller': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:larger': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smallerEq': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:largerEq': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  RelationalNode: {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitshift operators
+  'OperatorNode:leftShift': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightArithShift': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightLogShift': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // unit conversion
+  'OperatorNode:to': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // range
+  RangeNode: {}
+}, {
+  // addition, subtraction
+  'OperatorNode:add': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']
+  },
+  'OperatorNode:subtract': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // multiply, divide, modulus
+  'OperatorNode:multiply': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']
+  },
+  'OperatorNode:divide': {
+    associativity: 'left',
+    associativeWith: [],
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false // fractions don't require parentheses because
+    // they're 2 dimensional, so parens aren't needed
+    // in LaTeX
+
+  },
+  'OperatorNode:dotMultiply': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']
+  },
+  'OperatorNode:dotDivide': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:mod': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // unary prefix operators
+  'OperatorNode:unaryPlus': {
+    associativity: 'right'
+  },
+  'OperatorNode:unaryMinus': {
+    associativity: 'right'
+  },
+  'OperatorNode:bitNot': {
+    associativity: 'right'
+  },
+  'OperatorNode:not': {
+    associativity: 'right'
+  }
+}, {
+  // exponentiation
+  'OperatorNode:pow': {
+    associativity: 'right',
+    associativeWith: [],
+    latexRightParens: false // the exponent doesn't need parentheses in
+    // LaTeX because it's 2 dimensional
+    // (it's on top)
+
+  },
+  'OperatorNode:dotPow': {
+    associativity: 'right',
+    associativeWith: []
+  }
+}, {
+  // factorial
+  'OperatorNode:factorial': {
+    associativity: 'left'
+  }
+}, {
+  // matrix transpose
+  'OperatorNode:transpose': {
+    associativity: 'left'
+  }
+}];
+/**
+ * Get the precedence of a Node.
+ * Higher number for higher precedence, starting with 0.
+ * Returns null if the precedence is undefined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {number | null}
+ */
+
+exports.properties = properties;
+
+function getPrecedence(_node, parenthesis) {
+  var node = _node;
+
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+
+  var identifier = node.getIdentifier();
+
+  for (var i = 0; i < properties.length; i++) {
+    if (identifier in properties[i]) {
+      return i;
+    }
+  }
+
+  return null;
+}
+/**
+ * Get the associativity of an operator (left or right).
+ * Returns a string containing 'left' or 'right' or null if
+ * the associativity is not defined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {string|null}
+ * @throws {Error}
+ */
+
+
+function getAssociativity(_node, parenthesis) {
+  var node = _node;
+
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+
+  var identifier = node.getIdentifier();
+  var index = getPrecedence(node, parenthesis);
+
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+
+  var property = properties[index][identifier];
+
+  if ((0, _object.hasOwnProperty)(property, 'associativity')) {
+    if (property.associativity === 'left') {
+      return 'left';
+    }
+
+    if (property.associativity === 'right') {
+      return 'right';
+    } // associativity is invalid
+
+
+    throw Error('\'' + identifier + '\' has the invalid associativity \'' + property.associativity + '\'.');
+  } // associativity is undefined
+
+
+  return null;
+}
+/**
+ * Check if an operator is associative with another operator.
+ * Returns either true or false or null if not defined.
+ *
+ * @param {Node} nodeA
+ * @param {Node} nodeB
+ * @param {string} parenthesis
+ * @return {boolean | null}
+ */
+
+
+function isAssociativeWith(nodeA, nodeB, parenthesis) {
+  // ParenthesisNodes are only ignored when not in 'keep' mode
+  var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;
+  var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;
+  var identifierA = a.getIdentifier();
+  var identifierB = b.getIdentifier();
+  var index = getPrecedence(a, parenthesis);
+
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+
+  var property = properties[index][identifierA];
+
+  if ((0, _object.hasOwnProperty)(property, 'associativeWith') && property.associativeWith instanceof Array) {
+    for (var i = 0; i < property.associativeWith.length; i++) {
+      if (property.associativeWith[i] === identifierB) {
+        return true;
+      }
+    }
+
+    return false;
+  } // associativeWith is not defined
+
+
+  return null;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/parse.js b/node_modules/mathjs/lib/cjs/expression/parse.js
new file mode 100644
index 0000000..f539b76
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/parse.js
@@ -0,0 +1,1811 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParse = void 0;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+var _factory = require("../utils/factory.js");
+
+var _is = require("../utils/is.js");
+
+var _collection = require("../utils/collection.js");
+
+var _object = require("../utils/object.js");
+
+var name = 'parse';
+var dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];
+var createParse = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      numeric = _ref.numeric,
+      config = _ref.config,
+      AccessorNode = _ref.AccessorNode,
+      ArrayNode = _ref.ArrayNode,
+      AssignmentNode = _ref.AssignmentNode,
+      BlockNode = _ref.BlockNode,
+      ConditionalNode = _ref.ConditionalNode,
+      ConstantNode = _ref.ConstantNode,
+      FunctionAssignmentNode = _ref.FunctionAssignmentNode,
+      FunctionNode = _ref.FunctionNode,
+      IndexNode = _ref.IndexNode,
+      ObjectNode = _ref.ObjectNode,
+      OperatorNode = _ref.OperatorNode,
+      ParenthesisNode = _ref.ParenthesisNode,
+      RangeNode = _ref.RangeNode,
+      RelationalNode = _ref.RelationalNode,
+      SymbolNode = _ref.SymbolNode;
+
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate().
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.parse(expr)
+   *     math.parse(expr, options)
+   *     math.parse([expr1, expr2, expr3, ...])
+   *     math.parse([expr1, expr2, expr3, ...], options)
+   *
+   * Example:
+   *
+   *     const node1 = math.parse('sqrt(3^2 + 4^2)')
+   *     node1.compile().evaluate() // 5
+   *
+   *     let scope = {a:3, b:4}
+   *     const node2 = math.parse('a * b') // 12
+   *     const code2 = node2.compile()
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].compile().evaluate() // 12
+   *
+   * See also:
+   *
+   *     evaluate, compile
+   *
+   * @param {string | string[] | Matrix} expr          Expression to be parsed
+   * @param {{nodes: Object<string, Node>}} [options]  Available options:
+   *                                                   - `nodes` a set of custom nodes
+   * @return {Node | Node[]} node
+   * @throws {Error}
+   */
+  var parse = typed(name, {
+    string: function string(expression) {
+      return parseStart(expression, {});
+    },
+    'Array | Matrix': function ArrayMatrix(expressions) {
+      return parseMultiple(expressions, {});
+    },
+    'string, Object': function stringObject(expression, options) {
+      var extraNodes = options.nodes !== undefined ? options.nodes : {};
+      return parseStart(expression, extraNodes);
+    },
+    'Array | Matrix, Object': parseMultiple
+  });
+
+  function parseMultiple(expressions) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    var extraNodes = options.nodes !== undefined ? options.nodes : {}; // parse an array or matrix with expressions
+
+    return (0, _collection.deepMap)(expressions, function (elem) {
+      if (typeof elem !== 'string') throw new TypeError('String expected');
+      return parseStart(elem, extraNodes);
+    });
+  } // token types enumeration
+
+
+  var TOKENTYPE = {
+    NULL: 0,
+    DELIMITER: 1,
+    NUMBER: 2,
+    SYMBOL: 3,
+    UNKNOWN: 4
+  }; // map with all delimiters
+
+  var DELIMITERS = {
+    ',': true,
+    '(': true,
+    ')': true,
+    '[': true,
+    ']': true,
+    '{': true,
+    '}': true,
+    '"': true,
+    '\'': true,
+    ';': true,
+    '+': true,
+    '-': true,
+    '*': true,
+    '.*': true,
+    '/': true,
+    './': true,
+    '%': true,
+    '^': true,
+    '.^': true,
+    '~': true,
+    '!': true,
+    '&': true,
+    '|': true,
+    '^|': true,
+    '=': true,
+    ':': true,
+    '?': true,
+    '==': true,
+    '!=': true,
+    '<': true,
+    '>': true,
+    '<=': true,
+    '>=': true,
+    '<<': true,
+    '>>': true,
+    '>>>': true
+  }; // map with all named delimiters
+
+  var NAMED_DELIMITERS = {
+    mod: true,
+    to: true,
+    in: true,
+    and: true,
+    xor: true,
+    or: true,
+    not: true
+  };
+  var CONSTANTS = {
+    true: true,
+    false: false,
+    null: null,
+    undefined: undefined
+  };
+  var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];
+
+  function initialState() {
+    return {
+      extraNodes: {},
+      // current extra nodes, must be careful not to mutate
+      expression: '',
+      // current expression
+      comment: '',
+      // last parsed comment
+      index: 0,
+      // current index in expr
+      token: '',
+      // current token
+      tokenType: TOKENTYPE.NULL,
+      // type of the token
+      nestingLevel: 0,
+      // level of nesting inside parameters, used to ignore newline characters
+      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here
+
+    };
+  }
+  /**
+   * View upto `length` characters of the expression starting at the current character.
+   *
+   * @param {Object} state
+   * @param {number} [length=1] Number of characters to view
+   * @returns {string}
+   * @private
+   */
+
+
+  function currentString(state, length) {
+    return state.expression.substr(state.index, length);
+  }
+  /**
+   * View the current character. Returns '' if end of expression is reached.
+   *
+   * @param {Object} state
+   * @returns {string}
+   * @private
+   */
+
+
+  function currentCharacter(state) {
+    return currentString(state, 1);
+  }
+  /**
+   * Get the next character from the expression.
+   * The character is stored into the char c. If the end of the expression is
+   * reached, the function puts an empty string in c.
+   * @private
+   */
+
+
+  function next(state) {
+    state.index++;
+  }
+  /**
+   * Preview the previous character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+
+
+  function prevCharacter(state) {
+    return state.expression.charAt(state.index - 1);
+  }
+  /**
+   * Preview the next character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+
+
+  function nextCharacter(state) {
+    return state.expression.charAt(state.index + 1);
+  }
+  /**
+   * Get next token in the current string expr.
+   * The token and token type are available as token and tokenType
+   * @private
+   */
+
+
+  function getToken(state) {
+    state.tokenType = TOKENTYPE.NULL;
+    state.token = '';
+    state.comment = ''; // skip over ignored characters:
+
+    while (true) {
+      // comments:
+      if (currentCharacter(state) === '#') {
+        while (currentCharacter(state) !== '\n' && currentCharacter(state) !== '') {
+          state.comment += currentCharacter(state);
+          next(state);
+        }
+      } // whitespace: space, tab, and newline when inside parameters
+
+
+      if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {
+        next(state);
+      } else {
+        break;
+      }
+    } // check for end of expression
+
+
+    if (currentCharacter(state) === '') {
+      // token is still empty
+      state.tokenType = TOKENTYPE.DELIMITER;
+      return;
+    } // check for new line character
+
+
+    if (currentCharacter(state) === '\n' && !state.nestingLevel) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = currentCharacter(state);
+      next(state);
+      return;
+    }
+
+    var c1 = currentCharacter(state);
+    var c2 = currentString(state, 2);
+    var c3 = currentString(state, 3);
+
+    if (c3.length === 3 && DELIMITERS[c3]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c3;
+      next(state);
+      next(state);
+      next(state);
+      return;
+    } // check for delimiters consisting of 2 characters
+
+
+    if (c2.length === 2 && DELIMITERS[c2]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c2;
+      next(state);
+      next(state);
+      return;
+    } // check for delimiters consisting of 1 character
+
+
+    if (DELIMITERS[c1]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c1;
+      next(state);
+      return;
+    } // check for a number
+
+
+    if (parse.isDigitDot(c1)) {
+      state.tokenType = TOKENTYPE.NUMBER; // check for binary, octal, or hex
+
+      var _c = currentString(state, 2);
+
+      if (_c === '0b' || _c === '0o' || _c === '0x') {
+        state.token += currentCharacter(state);
+        next(state);
+        state.token += currentCharacter(state);
+        next(state);
+
+        while (parse.isHexDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+
+        if (currentCharacter(state) === '.') {
+          // this number has a radix point
+          state.token += '.';
+          next(state); // get the digits after the radix
+
+          while (parse.isHexDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        } else if (currentCharacter(state) === 'i') {
+          // this number has a word size suffix
+          state.token += 'i';
+          next(state); // get the word size
+
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        }
+
+        return;
+      } // get number, can have a single dot
+
+
+      if (currentCharacter(state) === '.') {
+        state.token += currentCharacter(state);
+        next(state);
+
+        if (!parse.isDigit(currentCharacter(state))) {
+          // this is no number, it is just a dot (can be dot notation)
+          state.tokenType = TOKENTYPE.DELIMITER;
+          return;
+        }
+      } else {
+        while (parse.isDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+
+        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+      }
+
+      while (parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      } // check for exponential notation like "2.3e-4", "1.23e50" or "2e+4"
+
+
+      if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {
+        if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {
+          state.token += currentCharacter(state);
+          next(state);
+
+          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {
+            state.token += currentCharacter(state);
+            next(state);
+          } // Scientific notation MUST be followed by an exponent
+
+
+          if (!parse.isDigit(currentCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+
+          if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+        } else if (nextCharacter(state) === '.') {
+          next(state);
+          throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+        }
+      }
+
+      return;
+    } // check for variables, functions, named operators
+
+
+    if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {
+      while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      }
+
+      if ((0, _object.hasOwnProperty)(NAMED_DELIMITERS, state.token)) {
+        state.tokenType = TOKENTYPE.DELIMITER;
+      } else {
+        state.tokenType = TOKENTYPE.SYMBOL;
+      }
+
+      return;
+    } // something unknown is found, wrong characters -> a syntax error
+
+
+    state.tokenType = TOKENTYPE.UNKNOWN;
+
+    while (currentCharacter(state) !== '') {
+      state.token += currentCharacter(state);
+      next(state);
+    }
+
+    throw createSyntaxError(state, 'Syntax error in part "' + state.token + '"');
+  }
+  /**
+   * Get next token and skip newline tokens
+   */
+
+
+  function getTokenSkipNewline(state) {
+    do {
+      getToken(state);
+    } while (state.token === '\n'); // eslint-disable-line no-unmodified-loop-condition
+
+  }
+  /**
+   * Open parameters.
+   * New line characters will be ignored until closeParams(state) is called
+   */
+
+
+  function openParams(state) {
+    state.nestingLevel++;
+  }
+  /**
+   * Close parameters.
+   * New line characters will no longer be ignored
+   */
+
+
+  function closeParams(state) {
+    state.nestingLevel--;
+  }
+  /**
+   * Checks whether the current character `c` is a valid alpha character:
+   *
+   * - A latin letter (upper or lower case) Ascii: a-z, A-Z
+   * - An underscore                        Ascii: _
+   * - A dollar sign                        Ascii: $
+   * - A latin letter with accents          Unicode: \u00C0 - \u02AF
+   * - A greek letter                       Unicode: \u0370 - \u03FF
+   * - A mathematical alphanumeric symbol   Unicode: \u{1D400} - \u{1D7FF} excluding invalid code points
+   *
+   * The previous and next characters are needed to determine whether
+   * this character is part of a unicode surrogate pair.
+   *
+   * @param {string} c      Current character in the expression
+   * @param {string} cPrev  Previous character
+   * @param {string} cNext  Next character
+   * @return {boolean}
+   */
+
+
+  parse.isAlpha = function isAlpha(c, cPrev, cNext) {
+    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);
+  };
+  /**
+   * Test whether a character is a valid latin, greek, or letter-like character
+   * @param {string} c
+   * @return {boolean}
+   */
+
+
+  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {
+    return /^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(c);
+  };
+  /**
+   * Test whether two given 16 bit characters form a surrogate pair of a
+   * unicode math symbol.
+   *
+   * https://unicode-table.com/en/
+   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode
+   *
+   * Note: In ES6 will be unicode aware:
+   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes
+   * https://mathiasbynens.be/notes/es6-unicode-regex
+   *
+   * @param {string} high
+   * @param {string} low
+   * @return {boolean}
+   */
+
+
+  parse.isValidMathSymbol = function isValidMathSymbol(high, low) {
+    return /^[\uD835]$/.test(high) && /^[\uDC00-\uDFFF]$/.test(low) && /^[^\uDC55\uDC9D\uDCA0\uDCA1\uDCA3\uDCA4\uDCA7\uDCA8\uDCAD\uDCBA\uDCBC\uDCC4\uDD06\uDD0B\uDD0C\uDD15\uDD1D\uDD3A\uDD3F\uDD45\uDD47-\uDD49\uDD51\uDEA6\uDEA7\uDFCC\uDFCD]$/.test(low);
+  };
+  /**
+   * Check whether given character c is a white space character: space, tab, or enter
+   * @param {string} c
+   * @param {number} nestingLevel
+   * @return {boolean}
+   */
+
+
+  parse.isWhitespace = function isWhitespace(c, nestingLevel) {
+    // TODO: also take '\r' carriage return as newline? Or does that give problems on mac?
+    return c === ' ' || c === '\t' || c === '\n' && nestingLevel > 0;
+  };
+  /**
+   * Test whether the character c is a decimal mark (dot).
+   * This is the case when it's not the start of a delimiter '.*', './', or '.^'
+   * @param {string} c
+   * @param {string} cNext
+   * @return {boolean}
+   */
+
+
+  parse.isDecimalMark = function isDecimalMark(c, cNext) {
+    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';
+  };
+  /**
+   * checks if the given char c is a digit or dot
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+
+
+  parse.isDigitDot = function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  };
+  /**
+   * checks if the given char c is a digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+
+
+  parse.isDigit = function isDigit(c) {
+    return c >= '0' && c <= '9';
+  };
+  /**
+   * checks if the given char c is a hex digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+
+
+  parse.isHexDigit = function isHexDigit(c) {
+    return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';
+  };
+  /**
+   * Start of the parse levels below, in order of precedence
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseStart(expression, extraNodes) {
+    var state = initialState();
+    (0, _extends2.default)(state, {
+      expression: expression,
+      extraNodes: extraNodes
+    });
+    getToken(state);
+    var node = parseBlock(state); // check for garbage at the end of the expression
+    // an expression ends with a empty character '' and tokenType DELIMITER
+
+    if (state.token !== '') {
+      if (state.tokenType === TOKENTYPE.DELIMITER) {
+        // user entered a not existing operator like "//"
+        // TODO: give hints for aliases, for example with "<>" give as hint " did you mean !== ?"
+        throw createError(state, 'Unexpected operator ' + state.token);
+      } else {
+        throw createSyntaxError(state, 'Unexpected part "' + state.token + '"');
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Parse a block with expressions. Expressions can be separated by a newline
+   * character '\n', or by a semicolon ';'. In case of a semicolon, no output
+   * of the preceding line is returned.
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBlock(state) {
+    var node;
+    var blocks = [];
+    var visible;
+
+    if (state.token !== '' && state.token !== '\n' && state.token !== ';') {
+      node = parseAssignment(state);
+      node.comment = state.comment;
+    } // TODO: simplify this loop
+
+
+    while (state.token === '\n' || state.token === ';') {
+      // eslint-disable-line no-unmodified-loop-condition
+      if (blocks.length === 0 && node) {
+        visible = state.token !== ';';
+        blocks.push({
+          node: node,
+          visible: visible
+        });
+      }
+
+      getToken(state);
+
+      if (state.token !== '\n' && state.token !== ';' && state.token !== '') {
+        node = parseAssignment(state);
+        node.comment = state.comment;
+        visible = state.token !== ';';
+        blocks.push({
+          node: node,
+          visible: visible
+        });
+      }
+    }
+
+    if (blocks.length > 0) {
+      return new BlockNode(blocks);
+    } else {
+      if (!node) {
+        node = new ConstantNode(undefined);
+        node.comment = state.comment;
+      }
+
+      return node;
+    }
+  }
+  /**
+   * Assignment of a function or variable,
+   * - can be a variable like 'a=2.3'
+   * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'
+   * - defining a function like 'f(x) = x^2'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseAssignment(state) {
+    var name, args, value, valid;
+    var node = parseConditional(state);
+
+    if (state.token === '=') {
+      if ((0, _is.isSymbolNode)(node)) {
+        // parse a variable assignment like 'a = 2/3'
+        name = node.name;
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(new SymbolNode(name), value);
+      } else if ((0, _is.isAccessorNode)(node)) {
+        // parse a matrix subset assignment like 'A[1,2] = 4'
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(node.object, node.index, value);
+      } else if ((0, _is.isFunctionNode)(node) && (0, _is.isSymbolNode)(node.fn)) {
+        // parse function assignment like 'f(x) = x^2'
+        valid = true;
+        args = [];
+        name = node.name;
+        node.args.forEach(function (arg, index) {
+          if ((0, _is.isSymbolNode)(arg)) {
+            args[index] = arg.name;
+          } else {
+            valid = false;
+          }
+        });
+
+        if (valid) {
+          getTokenSkipNewline(state);
+          value = parseAssignment(state);
+          return new FunctionAssignmentNode(name, args, value);
+        }
+      }
+
+      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');
+    }
+
+    return node;
+  }
+  /**
+   * conditional operation
+   *
+   *     condition ? truePart : falsePart
+   *
+   * Note: conditional operator is right-associative
+   *
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseConditional(state) {
+    var node = parseLogicalOr(state);
+
+    while (state.token === '?') {
+      // eslint-disable-line no-unmodified-loop-condition
+      // set a conditional level, the range operator will be ignored as long
+      // as conditionalLevel === state.nestingLevel.
+      var prev = state.conditionalLevel;
+      state.conditionalLevel = state.nestingLevel;
+      getTokenSkipNewline(state);
+      var condition = node;
+      var trueExpr = parseAssignment(state);
+      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');
+      state.conditionalLevel = null;
+      getTokenSkipNewline(state);
+      var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity
+
+      node = new ConditionalNode(condition, trueExpr, falseExpr); // restore the previous conditional level
+
+      state.conditionalLevel = prev;
+    }
+
+    return node;
+  }
+  /**
+   * logical or, 'x or y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLogicalOr(state) {
+    var node = parseLogicalXor(state);
+
+    while (state.token === 'or') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * logical exclusive or, 'x xor y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLogicalXor(state) {
+    var node = parseLogicalAnd(state);
+
+    while (state.token === 'xor') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * logical and, 'x and y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLogicalAnd(state) {
+    var node = parseBitwiseOr(state);
+
+    while (state.token === 'and') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * bitwise or, 'x | y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBitwiseOr(state) {
+    var node = parseBitwiseXor(state);
+
+    while (state.token === '|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * bitwise exclusive or (xor), 'x ^| y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBitwiseXor(state) {
+    var node = parseBitwiseAnd(state);
+
+    while (state.token === '^|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * bitwise and, 'x & y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBitwiseAnd(state) {
+    var node = parseRelational(state);
+
+    while (state.token === '&') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * Parse a chained conditional, like 'a > b >= c'
+   * @return {Node} node
+   */
+
+
+  function parseRelational(state) {
+    var params = [parseShift(state)];
+    var conditionals = [];
+    var operators = {
+      '==': 'equal',
+      '!=': 'unequal',
+      '<': 'smaller',
+      '>': 'larger',
+      '<=': 'smallerEq',
+      '>=': 'largerEq'
+    };
+
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      // eslint-disable-line no-unmodified-loop-condition
+      var cond = {
+        name: state.token,
+        fn: operators[state.token]
+      };
+      conditionals.push(cond);
+      getTokenSkipNewline(state);
+      params.push(parseShift(state));
+    }
+
+    if (params.length === 1) {
+      return params[0];
+    } else if (params.length === 2) {
+      return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);
+    } else {
+      return new RelationalNode(conditionals.map(function (c) {
+        return c.fn;
+      }), params);
+    }
+  }
+  /**
+   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseShift(state) {
+    var node, name, fn, params;
+    node = parseConversion(state);
+    var operators = {
+      '<<': 'leftShift',
+      '>>': 'rightArithShift',
+      '>>>': 'rightLogShift'
+    };
+
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      params = [node, parseConversion(state)];
+      node = new OperatorNode(name, fn, params);
+    }
+
+    return node;
+  }
+  /**
+   * conversion operators 'to' and 'in'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseConversion(state) {
+    var node, name, fn, params;
+    node = parseRange(state);
+    var operators = {
+      to: 'to',
+      in: 'to' // alias of 'to'
+
+    };
+
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+
+      if (name === 'in' && state.token === '') {
+        // end of expression -> this is the unit 'in' ('inch')
+        node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);
+      } else {
+        // operator 'a to b' or 'a in b'
+        params = [node, parseRange(state)];
+        node = new OperatorNode(name, fn, params);
+      }
+    }
+
+    return node;
+  }
+  /**
+   * parse range, "start:end", "start:step:end", ":", "start:", ":end", etc
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseRange(state) {
+    var node;
+    var params = [];
+
+    if (state.token === ':') {
+      // implicit start=1 (one-based)
+      node = new ConstantNode(1);
+    } else {
+      // explicit start
+      node = parseAddSubtract(state);
+    }
+
+    if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {
+      // we ignore the range operator when a conditional operator is being processed on the same level
+      params.push(node); // parse step and end
+
+      while (state.token === ':' && params.length < 3) {
+        // eslint-disable-line no-unmodified-loop-condition
+        getTokenSkipNewline(state);
+
+        if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {
+          // implicit end
+          params.push(new SymbolNode('end'));
+        } else {
+          // explicit end
+          params.push(parseAddSubtract(state));
+        }
+      }
+
+      if (params.length === 3) {
+        // params = [start, step, end]
+        node = new RangeNode(params[0], params[2], params[1]); // start, end, step
+      } else {
+        // length === 2
+        // params = [start, end]
+        node = new RangeNode(params[0], params[1]); // start, end
+      }
+    }
+
+    return node;
+  }
+  /**
+   * add or subtract
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseAddSubtract(state) {
+    var node, name, fn, params;
+    node = parseMultiplyDivide(state);
+    var operators = {
+      '+': 'add',
+      '-': 'subtract'
+    };
+
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      var rightNode = parseMultiplyDivide(state);
+
+      if (rightNode.isPercentage) {
+        params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];
+      } else {
+        params = [node, rightNode];
+      }
+
+      node = new OperatorNode(name, fn, params);
+    }
+
+    return node;
+  }
+  /**
+   * multiply, divide, modulus
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseMultiplyDivide(state) {
+    var node, last, name, fn;
+    node = parseImplicitMultiplication(state);
+    last = node;
+    var operators = {
+      '*': 'multiply',
+      '.*': 'dotMultiply',
+      '/': 'divide',
+      './': 'dotDivide'
+    };
+
+    while (true) {
+      if ((0, _object.hasOwnProperty)(operators, state.token)) {
+        // explicit operators
+        name = state.token;
+        fn = operators[name];
+        getTokenSkipNewline(state);
+        last = parseImplicitMultiplication(state);
+        node = new OperatorNode(name, fn, [node, last]);
+      } else {
+        break;
+      }
+    }
+
+    return node;
+  }
+  /**
+   * implicit multiplication
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseImplicitMultiplication(state) {
+    var node, last;
+    node = parseRule2(state);
+    last = node;
+
+    while (true) {
+      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && (0, _is.isConstantNode)(node) || state.tokenType === TOKENTYPE.NUMBER && !(0, _is.isConstantNode)(last) && (!(0, _is.isOperatorNode)(last) || last.op === '!') || state.token === '(') {
+        // parse implicit multiplication
+        //
+        // symbol:      implicit multiplication like '2a', '(2+3)a', 'a b'
+        // number:      implicit multiplication like '(2+3)2'
+        // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'
+        last = parseRule2(state);
+        node = new OperatorNode('*', 'multiply', [node, last], true
+        /* implicit */
+        );
+      } else {
+        break;
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Infamous "rule 2" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370
+   * Explicit division gets higher precedence than implicit multiplication
+   * when the division matches this pattern: [number] / [number] [symbol]
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseRule2(state) {
+    var node = parsePercentage(state);
+    var last = node;
+    var tokenStates = [];
+
+    while (true) {
+      // Match the "number /" part of the pattern "number / number symbol"
+      if (state.token === '/' && (0, _is.isConstantNode)(last)) {
+        // Look ahead to see if the next token is a number
+        tokenStates.push((0, _extends2.default)({}, state));
+        getTokenSkipNewline(state); // Match the "number / number" part of the pattern
+
+        if (state.tokenType === TOKENTYPE.NUMBER) {
+          // Look ahead again
+          tokenStates.push((0, _extends2.default)({}, state));
+          getTokenSkipNewline(state); // Match the "symbol" part of the pattern, or a left parenthesis
+
+          if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(') {
+            // We've matched the pattern "number / number symbol".
+            // Rewind once and build the "number / number" node; the symbol will be consumed later
+            (0, _extends2.default)(state, tokenStates.pop());
+            tokenStates.pop();
+            last = parsePercentage(state);
+            node = new OperatorNode('/', 'divide', [node, last]);
+          } else {
+            // Not a match, so rewind
+            tokenStates.pop();
+            (0, _extends2.default)(state, tokenStates.pop());
+            break;
+          }
+        } else {
+          // Not a match, so rewind
+          (0, _extends2.default)(state, tokenStates.pop());
+          break;
+        }
+      } else {
+        break;
+      }
+    }
+
+    return node;
+  }
+  /**
+   * percentage or mod
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parsePercentage(state) {
+    var node, name, fn, params;
+    node = parseUnary(state);
+    var operators = {
+      '%': 'mod',
+      mod: 'mod'
+    };
+
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+
+      if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {
+        // If the expression contains only %, then treat that as /100
+        node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);
+      } else {
+        params = [node, parseUnary(state)];
+        node = new OperatorNode(name, fn, params);
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Unary plus and minus, and logical and bitwise not
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseUnary(state) {
+    var name, params, fn;
+    var operators = {
+      '-': 'unaryMinus',
+      '+': 'unaryPlus',
+      '~': 'bitNot',
+      not: 'not'
+    };
+
+    if ((0, _object.hasOwnProperty)(operators, state.token)) {
+      fn = operators[state.token];
+      name = state.token;
+      getTokenSkipNewline(state);
+      params = [parseUnary(state)];
+      return new OperatorNode(name, fn, params);
+    }
+
+    return parsePow(state);
+  }
+  /**
+   * power
+   * Note: power operator is right associative
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parsePow(state) {
+    var node, name, fn, params;
+    node = parseLeftHandOperators(state);
+
+    if (state.token === '^' || state.token === '.^') {
+      name = state.token;
+      fn = name === '^' ? 'pow' : 'dotPow';
+      getTokenSkipNewline(state);
+      params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'
+
+      node = new OperatorNode(name, fn, params);
+    }
+
+    return node;
+  }
+  /**
+   * Left hand operators: factorial x!, ctranspose x'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLeftHandOperators(state) {
+    var node, name, fn, params;
+    node = parseCustomNodes(state);
+    var operators = {
+      '!': 'factorial',
+      '\'': 'ctranspose'
+    };
+
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getToken(state);
+      params = [node];
+      node = new OperatorNode(name, fn, params);
+      node = parseAccessors(state, node);
+    }
+
+    return node;
+  }
+  /**
+   * Parse a custom node handler. A node handler can be used to process
+   * nodes in a custom way, for example for handling a plot.
+   *
+   * A handler must be passed as second argument of the parse function.
+   * - must extend math.Node
+   * - must contain a function _compile(defs: Object) : string
+   * - must contain a function find(filter: Object) : Node[]
+   * - must contain a function toString() : string
+   * - the constructor is called with a single argument containing all parameters
+   *
+   * For example:
+   *
+   *     nodes = {
+   *       'plot': PlotHandler
+   *     }
+   *
+   * The constructor of the handler is called as:
+   *
+   *     node = new PlotHandler(params)
+   *
+   * The handler will be invoked when evaluating an expression like:
+   *
+   *     node = math.parse('plot(sin(x), x)', nodes)
+   *
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseCustomNodes(state) {
+    var params = [];
+
+    if (state.tokenType === TOKENTYPE.SYMBOL && (0, _object.hasOwnProperty)(state.extraNodes, state.token)) {
+      var CustomNode = state.extraNodes[state.token];
+      getToken(state); // parse parameters
+
+      if (state.token === '(') {
+        params = [];
+        openParams(state);
+        getToken(state);
+
+        if (state.token !== ')') {
+          params.push(parseAssignment(state)); // parse a list with parameters
+
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+
+        if (state.token !== ')') {
+          throw createSyntaxError(state, 'Parenthesis ) expected');
+        }
+
+        closeParams(state);
+        getToken(state);
+      } // create a new custom node
+      // noinspection JSValidateTypes
+
+
+      return new CustomNode(params);
+    }
+
+    return parseSymbol(state);
+  }
+  /**
+   * parse symbols: functions, variables, constants, units
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseSymbol(state) {
+    var node, name;
+
+    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+      name = state.token;
+      getToken(state);
+
+      if ((0, _object.hasOwnProperty)(CONSTANTS, name)) {
+        // true, false, null, ...
+        node = new ConstantNode(CONSTANTS[name]);
+      } else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) {
+        // NaN, Infinity
+        node = new ConstantNode(numeric(name, 'number'));
+      } else {
+        node = new SymbolNode(name);
+      } // parse function parameters and matrix index
+
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseDoubleQuotesString(state);
+  }
+  /**
+   * parse accessors:
+   * - function invocation in round brackets (...), for example sqrt(2)
+   * - index enclosed in square brackets [...], for example A[2,3]
+   * - dot notation for properties, like foo.bar
+   * @param {Object} state
+   * @param {Node} node    Node on which to apply the parameters. If there
+   *                       are no parameters in the expression, the node
+   *                       itself is returned
+   * @param {string[]} [types]  Filter the types of notations
+   *                            can be ['(', '[', '.']
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseAccessors(state, node, types) {
+    var params;
+
+    while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.indexOf(state.token) !== -1)) {
+      // eslint-disable-line no-unmodified-loop-condition
+      params = [];
+
+      if (state.token === '(') {
+        if ((0, _is.isSymbolNode)(node) || (0, _is.isAccessorNode)(node)) {
+          // function invocation like fn(2, 3) or obj.fn(2, 3)
+          openParams(state);
+          getToken(state);
+
+          if (state.token !== ')') {
+            params.push(parseAssignment(state)); // parse a list with parameters
+
+            while (state.token === ',') {
+              // eslint-disable-line no-unmodified-loop-condition
+              getToken(state);
+              params.push(parseAssignment(state));
+            }
+          }
+
+          if (state.token !== ')') {
+            throw createSyntaxError(state, 'Parenthesis ) expected');
+          }
+
+          closeParams(state);
+          getToken(state);
+          node = new FunctionNode(node, params);
+        } else {
+          // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)
+          // don't parse it here but let it be handled by parseImplicitMultiplication
+          // with correct precedence
+          return node;
+        }
+      } else if (state.token === '[') {
+        // index notation like variable[2, 3]
+        openParams(state);
+        getToken(state);
+
+        if (state.token !== ']') {
+          params.push(parseAssignment(state)); // parse a list with parameters
+
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+
+        if (state.token !== ']') {
+          throw createSyntaxError(state, 'Parenthesis ] expected');
+        }
+
+        closeParams(state);
+        getToken(state);
+        node = new AccessorNode(node, new IndexNode(params));
+      } else {
+        // dot notation like variable.prop
+        getToken(state);
+
+        if (state.tokenType !== TOKENTYPE.SYMBOL) {
+          throw createSyntaxError(state, 'Property name expected after dot');
+        }
+
+        params.push(new ConstantNode(state.token));
+        getToken(state);
+        var dotNotation = true;
+        node = new AccessorNode(node, new IndexNode(params, dotNotation));
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Parse a double quotes string.
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseDoubleQuotesString(state) {
+    var node, str;
+
+    if (state.token === '"') {
+      str = parseDoubleQuotesStringToken(state); // create constant
+
+      node = new ConstantNode(str); // parse index parameters
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseSingleQuotesString(state);
+  }
+  /**
+   * Parse a string surrounded by double quotes "..."
+   * @return {string}
+   */
+
+
+  function parseDoubleQuotesStringToken(state) {
+    var str = '';
+
+    while (currentCharacter(state) !== '' && currentCharacter(state) !== '"') {
+      if (currentCharacter(state) === '\\') {
+        // escape character, immediately process the next
+        // character to prevent stopping at a next '\"'
+        str += currentCharacter(state);
+        next(state);
+      }
+
+      str += currentCharacter(state);
+      next(state);
+    }
+
+    getToken(state);
+
+    if (state.token !== '"') {
+      throw createSyntaxError(state, 'End of string " expected');
+    }
+
+    getToken(state);
+    return JSON.parse('"' + str + '"'); // unescape escaped characters
+  }
+  /**
+   * Parse a single quotes string.
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseSingleQuotesString(state) {
+    var node, str;
+
+    if (state.token === '\'') {
+      str = parseSingleQuotesStringToken(state); // create constant
+
+      node = new ConstantNode(str); // parse index parameters
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseMatrix(state);
+  }
+  /**
+   * Parse a string surrounded by single quotes '...'
+   * @return {string}
+   */
+
+
+  function parseSingleQuotesStringToken(state) {
+    var str = '';
+
+    while (currentCharacter(state) !== '' && currentCharacter(state) !== '\'') {
+      if (currentCharacter(state) === '\\') {
+        // escape character, immediately process the next
+        // character to prevent stopping at a next '\''
+        str += currentCharacter(state);
+        next(state);
+      }
+
+      str += currentCharacter(state);
+      next(state);
+    }
+
+    getToken(state);
+
+    if (state.token !== '\'') {
+      throw createSyntaxError(state, 'End of string \' expected');
+    }
+
+    getToken(state);
+    return JSON.parse('"' + str + '"'); // unescape escaped characters
+  }
+  /**
+   * parse the matrix
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseMatrix(state) {
+    var array, params, rows, cols;
+
+    if (state.token === '[') {
+      // matrix [...]
+      openParams(state);
+      getToken(state);
+
+      if (state.token !== ']') {
+        // this is a non-empty matrix
+        var row = parseRow(state);
+
+        if (state.token === ';') {
+          // 2 dimensional array
+          rows = 1;
+          params = [row]; // the rows of the matrix are separated by dot-comma's
+
+          while (state.token === ';') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params[rows] = parseRow(state);
+            rows++;
+          }
+
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+
+          closeParams(state);
+          getToken(state); // check if the number of columns matches in all rows
+
+          cols = params[0].items.length;
+
+          for (var r = 1; r < rows; r++) {
+            if (params[r].items.length !== cols) {
+              throw createError(state, 'Column dimensions mismatch ' + '(' + params[r].items.length + ' !== ' + cols + ')');
+            }
+          }
+
+          array = new ArrayNode(params);
+        } else {
+          // 1 dimensional vector
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+
+          closeParams(state);
+          getToken(state);
+          array = row;
+        }
+      } else {
+        // this is an empty matrix "[ ]"
+        closeParams(state);
+        getToken(state);
+        array = new ArrayNode([]);
+      }
+
+      return parseAccessors(state, array);
+    }
+
+    return parseObject(state);
+  }
+  /**
+   * Parse a single comma-separated row from a matrix, like 'a, b, c'
+   * @return {ArrayNode} node
+   */
+
+
+  function parseRow(state) {
+    var params = [parseAssignment(state)];
+    var len = 1;
+
+    while (state.token === ',') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getToken(state); // parse expression
+
+      params[len] = parseAssignment(state);
+      len++;
+    }
+
+    return new ArrayNode(params);
+  }
+  /**
+   * parse an object, enclosed in angle brackets{...}, for example {value: 2}
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseObject(state) {
+    if (state.token === '{') {
+      openParams(state);
+      var key;
+      var properties = {};
+
+      do {
+        getToken(state);
+
+        if (state.token !== '}') {
+          // parse key
+          if (state.token === '"') {
+            key = parseDoubleQuotesStringToken(state);
+          } else if (state.token === '\'') {
+            key = parseSingleQuotesStringToken(state);
+          } else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+            key = state.token;
+            getToken(state);
+          } else {
+            throw createSyntaxError(state, 'Symbol or string expected as object key');
+          } // parse key/value separator
+
+
+          if (state.token !== ':') {
+            throw createSyntaxError(state, 'Colon : expected after object key');
+          }
+
+          getToken(state); // parse key
+
+          properties[key] = parseAssignment(state);
+        }
+      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition
+
+
+      if (state.token !== '}') {
+        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');
+      }
+
+      closeParams(state);
+      getToken(state);
+      var node = new ObjectNode(properties); // parse index parameters
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseNumber(state);
+  }
+  /**
+   * parse a number
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseNumber(state) {
+    var numberStr;
+
+    if (state.tokenType === TOKENTYPE.NUMBER) {
+      // this is a number
+      numberStr = state.token;
+      getToken(state);
+      return new ConstantNode(numeric(numberStr, config.number));
+    }
+
+    return parseParentheses(state);
+  }
+  /**
+   * parentheses
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseParentheses(state) {
+    var node; // check if it is a parenthesized expression
+
+    if (state.token === '(') {
+      // parentheses (...)
+      openParams(state);
+      getToken(state);
+      node = parseAssignment(state); // start again
+
+      if (state.token !== ')') {
+        throw createSyntaxError(state, 'Parenthesis ) expected');
+      }
+
+      closeParams(state);
+      getToken(state);
+      node = new ParenthesisNode(node);
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseEnd(state);
+  }
+  /**
+   * Evaluated when the expression is not yet ended but expected to end
+   * @return {Node} res
+   * @private
+   */
+
+
+  function parseEnd(state) {
+    if (state.token === '') {
+      // syntax error or unexpected end of expression
+      throw createSyntaxError(state, 'Unexpected end of expression');
+    } else {
+      throw createSyntaxError(state, 'Value expected');
+    }
+  }
+  /**
+   * Shortcut for getting the current row value (one based)
+   * Returns the line of the currently handled expression
+   * @private
+   */
+
+  /* TODO: implement keeping track on the row number
+  function row () {
+    return null
+  }
+  */
+
+  /**
+   * Shortcut for getting the current col value (one based)
+   * Returns the column (position) where the last state.token starts
+   * @private
+   */
+
+
+  function col(state) {
+    return state.index - state.token.length + 1;
+  }
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {SyntaxError} instantiated error
+   * @private
+   */
+
+
+  function createSyntaxError(state, message) {
+    var c = col(state);
+    var error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {Error} instantiated error
+   * @private
+   */
+
+
+  function createError(state, message) {
+    var c = col(state);
+    var error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+
+  return parse;
+});
+exports.createParse = createParse;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/apply.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/apply.transform.js
new file mode 100644
index 0000000..b35184f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/apply.transform.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createApplyTransform = void 0;
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _apply = require("../../function/matrix/apply.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'apply';
+var dependencies = ['typed', 'isInteger'];
+/**
+ * Attach a transform function to math.apply
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function apply
+ * from one-based to zero based
+ */
+
+var createApplyTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      isInteger = _ref.isInteger;
+  var apply = (0, _apply.createApply)({
+    typed: typed,
+    isInteger: isInteger
+  }); // @see: comment of concat itself
+
+  return typed('apply', {
+    '...any': function any(args) {
+      // change dim from one-based to zero-based
+      var dim = args[1];
+
+      if ((0, _is.isNumber)(dim)) {
+        args[1] = dim - 1;
+      } else if ((0, _is.isBigNumber)(dim)) {
+        args[1] = dim.minus(1);
+      }
+
+      try {
+        return apply.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createApplyTransform = createApplyTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/column.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/column.transform.js
new file mode 100644
index 0000000..f1b3a7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/column.transform.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createColumnTransform = void 0;
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _column = require("../../function/matrix/column.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'column';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+
+var createColumnTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Index = _ref.Index,
+      matrix = _ref.matrix,
+      range = _ref.range;
+  var column = (0, _column.createColumn)({
+    typed: typed,
+    Index: Index,
+    matrix: matrix,
+    range: range
+  }); // @see: comment of column itself
+
+  return typed('column', {
+    '...any': function any(args) {
+      // change last argument from zero-based to one-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if ((0, _is.isNumber)(last)) {
+        args[lastIndex] = last - 1;
+      }
+
+      try {
+        return column.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createColumnTransform = createColumnTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/concat.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/concat.transform.js
new file mode 100644
index 0000000..4bf59a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/concat.transform.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConcatTransform = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _concat = require("../../function/matrix/concat.js");
+
+var name = 'concat';
+var dependencies = ['typed', 'matrix', 'isInteger'];
+var createConcatTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      isInteger = _ref.isInteger;
+  var concat = (0, _concat.createConcat)({
+    typed: typed,
+    matrix: matrix,
+    isInteger: isInteger
+  });
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function concat
+   * from one-based to zero based
+   */
+
+  return typed('concat', {
+    '...any': function any(args) {
+      // change last argument from one-based to zero-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if ((0, _is.isNumber)(last)) {
+        args[lastIndex] = last - 1;
+      } else if ((0, _is.isBigNumber)(last)) {
+        args[lastIndex] = last.minus(1);
+      }
+
+      try {
+        return concat.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createConcatTransform = createConcatTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/cumsum.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/cumsum.transform.js
new file mode 100644
index 0000000..f5a5b6a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/cumsum.transform.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCumSumTransform = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _cumsum = require("../../function/statistics/cumsum.js");
+
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+var name = 'cumsum';
+var dependencies = ['typed', 'add', 'unaryPlus'];
+var createCumSumTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      unaryPlus = _ref.unaryPlus;
+  var cumsum = (0, _cumsum.createCumSum)({
+    typed: typed,
+    add: add,
+    unaryPlus: unaryPlus
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      // change last argument dim from one-based to zero-based
+      if (args.length === 2 && (0, _is.isCollection)(args[0])) {
+        var dim = args[1];
+
+        if ((0, _is.isNumber)(dim)) {
+          args[1] = dim - 1;
+        } else if ((0, _is.isBigNumber)(dim)) {
+          args[1] = dim.minus(1);
+        }
+      }
+
+      try {
+        return cumsum.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createCumSumTransform = createCumSumTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/diff.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/diff.transform.js
new file mode 100644
index 0000000..e8e4ed9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/diff.transform.js
@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDiffTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _diff = require("../../function/matrix/diff.js");
+
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+
+var name = 'diff';
+var dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];
+var createDiffTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      subtract = _ref.subtract,
+      number = _ref.number,
+      bignumber = _ref.bignumber;
+  var diff = (0, _diff.createDiff)({
+    typed: typed,
+    matrix: matrix,
+    subtract: subtract,
+    number: number,
+    bignumber: bignumber
+  });
+  /**
+   * Attach a transform function to math.diff
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+
+  return typed(name, {
+    '...any': function any(args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+
+      try {
+        return diff.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createDiffTransform = createDiffTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/filter.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/filter.transform.js
new file mode 100644
index 0000000..b9ee771
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/filter.transform.js
@@ -0,0 +1,93 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFilterTransform = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _function = require("../../utils/function.js");
+
+var _compileInlineExpression = require("./utils/compileInlineExpression.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'filter';
+var dependencies = ['typed'];
+var createFilterTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Attach a transform function to math.filter
+   * Adds a property transform containing the transform function.
+   *
+   * This transform adds support for equations as test function for math.filter,
+   * so you can do something like 'filter([3, -2, 5], x > 0)'.
+   */
+  function filterTransform(args, math, scope) {
+    var x, callback;
+
+    if (args[0]) {
+      x = args[0].compile().evaluate(scope);
+    }
+
+    if (args[1]) {
+      if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = args[1].compile().evaluate(scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);
+      }
+    }
+
+    return filter(x, callback);
+  }
+
+  filterTransform.rawArgs = true; // one based version of function filter
+
+  var filter = typed('filter', {
+    'Array, function': _filter,
+    'Matrix, function': function MatrixFunction(x, test) {
+      return x.create(_filter(x.toArray(), test));
+    },
+    'Array, RegExp': _array.filterRegExp,
+    'Matrix, RegExp': function MatrixRegExp(x, test) {
+      return x.create((0, _array.filterRegExp)(x.toArray(), test));
+    }
+  });
+  return filterTransform;
+}, {
+  isTransformFunction: true
+});
+/**
+ * Filter values in a callback given a callback function
+ *
+ * !!! Passes a one-based index !!!
+ *
+ * @param {Array} x
+ * @param {Function} callback
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+
+exports.createFilterTransform = createFilterTransform;
+
+function _filter(x, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = (0, _function.maxArgumentCount)(callback);
+  return (0, _array.filter)(x, function (value, index, array) {
+    // invoke the callback function with the right number of arguments
+    if (args === 1) {
+      return callback(value);
+    } else if (args === 2) {
+      return callback(value, [index + 1]);
+    } else {
+      // 3 or -1
+      return callback(value, [index + 1], array);
+    }
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/forEach.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/forEach.transform.js
new file mode 100644
index 0000000..8db1210
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/forEach.transform.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createForEachTransform = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _function = require("../../utils/function.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _compileInlineExpression = require("./utils/compileInlineExpression.js");
+
+var name = 'forEach';
+var dependencies = ['typed'];
+var createForEachTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Attach a transform function to math.forEach
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  function forEachTransform(args, math, scope) {
+    var x, callback;
+
+    if (args[0]) {
+      x = args[0].compile().evaluate(scope);
+    }
+
+    if (args[1]) {
+      if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {
+        // a function pointer, like forEach([3, -2, 5], myTestFunction)
+        callback = args[1].compile().evaluate(scope);
+      } else {
+        // an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )
+        callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);
+      }
+    }
+
+    return _forEach(x, callback);
+  }
+
+  forEachTransform.rawArgs = true; // one-based version of forEach
+
+  var _forEach = typed('forEach', {
+    'Array | Matrix, function': function ArrayMatrixFunction(array, callback) {
+      // figure out what number of arguments the callback function expects
+      var args = (0, _function.maxArgumentCount)(callback);
+
+      var recurse = function recurse(value, index) {
+        if (Array.isArray(value)) {
+          (0, _array.forEach)(value, function (child, i) {
+            // we create a copy of the index array and append the new index value
+            recurse(child, index.concat(i + 1)); // one based index, hence i+1
+          });
+        } else {
+          // invoke the callback function with the right number of arguments
+          if (args === 1) {
+            callback(value);
+          } else if (args === 2) {
+            callback(value, index);
+          } else {
+            // 3 or -1
+            callback(value, index, array);
+          }
+        }
+      };
+
+      recurse(array.valueOf(), []); // pass Array
+    }
+  });
+
+  return forEachTransform;
+}, {
+  isTransformFunction: true
+});
+exports.createForEachTransform = createForEachTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/index.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/index.transform.js
new file mode 100644
index 0000000..ab2512e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/index.transform.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndexTransform = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'index';
+var dependencies = ['Index'];
+var createIndexTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Index = _ref.Index;
+
+  /**
+   * Attach a transform function to math.index
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  return function indexTransform() {
+    var args = [];
+
+    for (var i = 0, ii = arguments.length; i < ii; i++) {
+      var arg = arguments[i]; // change from one-based to zero based, and convert BigNumber to number
+
+      if ((0, _is.isRange)(arg)) {
+        arg.start--;
+        arg.end -= arg.step > 0 ? 0 : 2;
+      } else if (arg && arg.isSet === true) {
+        arg = arg.map(function (v) {
+          return v - 1;
+        });
+      } else if ((0, _is.isArray)(arg) || (0, _is.isMatrix)(arg)) {
+        arg = arg.map(function (v) {
+          return v - 1;
+        });
+      } else if ((0, _is.isNumber)(arg)) {
+        arg--;
+      } else if ((0, _is.isBigNumber)(arg)) {
+        arg = arg.toNumber() - 1;
+      } else if (typeof arg === 'string') {// leave as is
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');
+      }
+
+      args[i] = arg;
+    }
+
+    var res = new Index();
+    Index.apply(res, args);
+    return res;
+  };
+}, {
+  isTransformFunction: true
+});
+exports.createIndexTransform = createIndexTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/map.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/map.transform.js
new file mode 100644
index 0000000..03bfd34
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/map.transform.js
@@ -0,0 +1,98 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMapTransform = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _function = require("../../utils/function.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _compileInlineExpression = require("./utils/compileInlineExpression.js");
+
+var name = 'map';
+var dependencies = ['typed'];
+var createMapTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Attach a transform function to math.map
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  function mapTransform(args, math, scope) {
+    var x, callback;
+
+    if (args[0]) {
+      x = args[0].compile().evaluate(scope);
+    }
+
+    if (args[1]) {
+      if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = args[1].compile().evaluate(scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);
+      }
+    }
+
+    return map(x, callback);
+  }
+
+  mapTransform.rawArgs = true; // one-based version of map function
+
+  var map = typed('map', {
+    'Array, function': function ArrayFunction(x, callback) {
+      return _map(x, callback, x);
+    },
+    'Matrix, function': function MatrixFunction(x, callback) {
+      return x.create(_map(x.valueOf(), callback, x));
+    }
+  });
+  return mapTransform;
+}, {
+  isTransformFunction: true
+});
+/**
+ * Map for a multi dimensional array. One-based indexes
+ * @param {Array} array
+ * @param {function} callback
+ * @param {Array} orig
+ * @return {Array}
+ * @private
+ */
+
+exports.createMapTransform = createMapTransform;
+
+function _map(array, callback, orig) {
+  // figure out what number of arguments the callback function expects
+  var argsCount = (0, _function.maxArgumentCount)(callback);
+
+  function recurse(value, index) {
+    if (Array.isArray(value)) {
+      return (0, _array.map)(value, function (child, i) {
+        // we create a copy of the index array and append the new index value
+        return recurse(child, index.concat(i + 1)); // one based index, hence i + 1
+      });
+    } else {
+      // invoke the (typed) callback function with the right number of arguments
+      if (argsCount === 1) {
+        return callback(value);
+      } else if (argsCount === 2) {
+        return callback(value, index);
+      } else {
+        // 3 or -1
+        return callback(value, index, orig);
+      }
+    }
+  }
+
+  return recurse(array, []);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/max.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/max.transform.js
new file mode 100644
index 0000000..a19d953
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/max.transform.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMaxTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _max = require("../../function/statistics/max.js");
+
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+
+var name = 'max';
+var dependencies = ['typed', 'config', 'numeric', 'larger'];
+var createMaxTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      numeric = _ref.numeric,
+      larger = _ref.larger;
+  var max = (0, _max.createMax)({
+    typed: typed,
+    config: config,
+    numeric: numeric,
+    larger: larger
+  });
+  /**
+   * Attach a transform function to math.max
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function max
+   * from one-based to zero based
+   */
+
+  return typed('max', {
+    '...any': function any(args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+
+      try {
+        return max.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createMaxTransform = createMaxTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/mean.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/mean.transform.js
new file mode 100644
index 0000000..e79d27e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/mean.transform.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMeanTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _mean = require("../../function/statistics/mean.js");
+
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+
+var name = 'mean';
+var dependencies = ['typed', 'add', 'divide'];
+var createMeanTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      divide = _ref.divide;
+  var mean = (0, _mean.createMean)({
+    typed: typed,
+    add: add,
+    divide: divide
+  });
+  /**
+   * Attach a transform function to math.mean
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function mean
+   * from one-based to zero based
+   */
+
+  return typed('mean', {
+    '...any': function any(args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+
+      try {
+        return mean.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createMeanTransform = createMeanTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/min.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/min.transform.js
new file mode 100644
index 0000000..c7ea7d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/min.transform.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMinTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _min = require("../../function/statistics/min.js");
+
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+
+var name = 'min';
+var dependencies = ['typed', 'config', 'numeric', 'smaller'];
+var createMinTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      numeric = _ref.numeric,
+      smaller = _ref.smaller;
+  var min = (0, _min.createMin)({
+    typed: typed,
+    config: config,
+    numeric: numeric,
+    smaller: smaller
+  });
+  /**
+   * Attach a transform function to math.min
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function min
+   * from one-based to zero based
+   */
+
+  return typed('min', {
+    '...any': function any(args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+
+      try {
+        return min.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createMinTransform = createMinTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/range.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/range.transform.js
new file mode 100644
index 0000000..6baee8f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/range.transform.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRangeTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _range = require("../../function/matrix/range.js");
+
+var name = 'range';
+var dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];
+var createRangeTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      bignumber = _ref.bignumber,
+      smaller = _ref.smaller,
+      smallerEq = _ref.smallerEq,
+      larger = _ref.larger,
+      largerEq = _ref.largerEq;
+  var range = (0, _range.createRange)({
+    typed: typed,
+    config: config,
+    matrix: matrix,
+    bignumber: bignumber,
+    smaller: smaller,
+    smallerEq: smallerEq,
+    larger: larger,
+    largerEq: largerEq
+  });
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+
+  return typed('range', {
+    '...any': function any(args) {
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if (typeof last !== 'boolean') {
+        // append a parameter includeEnd=true
+        args.push(true);
+      }
+
+      return range.apply(null, args);
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createRangeTransform = createRangeTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/row.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/row.transform.js
new file mode 100644
index 0000000..ca0b4dc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/row.transform.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRowTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _row = require("../../function/matrix/row.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'row';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+
+var createRowTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Index = _ref.Index,
+      matrix = _ref.matrix,
+      range = _ref.range;
+  var row = (0, _row.createRow)({
+    typed: typed,
+    Index: Index,
+    matrix: matrix,
+    range: range
+  }); // @see: comment of row itself
+
+  return typed('row', {
+    '...any': function any(args) {
+      // change last argument from zero-based to one-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if ((0, _is.isNumber)(last)) {
+        args[lastIndex] = last - 1;
+      }
+
+      try {
+        return row.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createRowTransform = createRowTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/std.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/std.transform.js
new file mode 100644
index 0000000..0963b2f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/std.transform.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createStdTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _std = require("../../function/statistics/std.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+
+var name = 'std';
+var dependencies = ['typed', 'sqrt', 'variance'];
+/**
+ * Attach a transform function to math.std
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function std
+ * from one-based to zero based
+ */
+
+var createStdTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      sqrt = _ref.sqrt,
+      variance = _ref.variance;
+  var std = (0, _std.createStd)({
+    typed: typed,
+    sqrt: sqrt,
+    variance: variance
+  });
+  return typed('std', {
+    '...any': function any(args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+
+      try {
+        return std.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createStdTransform = createStdTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/subset.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/subset.transform.js
new file mode 100644
index 0000000..fb0cfe2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/subset.transform.js
@@ -0,0 +1,42 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubsetTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _subset = require("../../function/matrix/subset.js");
+
+var name = 'subset';
+var dependencies = ['typed', 'matrix'];
+var createSubsetTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix;
+  var subset = (0, _subset.createSubset)({
+    typed: typed,
+    matrix: matrix
+  });
+  /**
+   * Attach a transform function to math.subset
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+
+  return typed('subset', {
+    '...any': function any(args) {
+      try {
+        return subset.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createSubsetTransform = createSubsetTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/sum.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/sum.transform.js
new file mode 100644
index 0000000..7ef6499
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/sum.transform.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSumTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _sum = require("../../function/statistics/sum.js");
+
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+var name = 'sum';
+var dependencies = ['typed', 'config', 'add', 'numeric'];
+var createSumTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      add = _ref.add,
+      numeric = _ref.numeric;
+  var sum = (0, _sum.createSum)({
+    typed: typed,
+    config: config,
+    add: add,
+    numeric: numeric
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+
+      try {
+        return sum.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createSumTransform = createSumTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/compileInlineExpression.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/compileInlineExpression.js
new file mode 100644
index 0000000..c84f416
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/compileInlineExpression.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compileInlineExpression = compileInlineExpression;
+
+var _is = require("../../../utils/is.js");
+
+var _scope = require("../../../utils/scope.js");
+
+/**
+ * Compile an inline expression like "x > 0"
+ * @param {Node} expression
+ * @param {Object} math
+ * @param {Object} scope
+ * @return {function} Returns a function with one argument which fills in the
+ *                    undefined variable (like "x") and evaluates the expression
+ */
+function compileInlineExpression(expression, math, scope) {
+  // find an undefined symbol
+  var symbol = expression.filter(function (node) {
+    return (0, _is.isSymbolNode)(node) && !(node.name in math) && !scope.has(node.name);
+  })[0];
+
+  if (!symbol) {
+    throw new Error('No undefined variable found in inline expression "' + expression + '"');
+  } // create a test function for this equation
+
+
+  var name = symbol.name; // variable name
+
+  var subScope = (0, _scope.createSubScope)(scope);
+  var eq = expression.compile();
+  return function inlineExpression(x) {
+    subScope.set(name, x);
+    return eq.evaluate(subScope);
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/errorTransform.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/errorTransform.js
new file mode 100644
index 0000000..b766ba9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/errorTransform.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.errorTransform = errorTransform;
+
+var _IndexError = require("../../../error/IndexError.js");
+
+/**
+ * Transform zero-based indices to one-based indices in errors
+ * @param {Error} err
+ * @returns {Error | IndexError} Returns the transformed error
+ */
+function errorTransform(err) {
+  if (err && err.isIndexError) {
+    return new _IndexError.IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);
+  }
+
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/lastDimToZeroBase.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/lastDimToZeroBase.js
new file mode 100644
index 0000000..cabf19d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/lastDimToZeroBase.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lastDimToZeroBase = lastDimToZeroBase;
+
+var _is = require("../../../utils/is.js");
+
+/**
+ * Change last argument dim from one-based to zero-based.
+ */
+function lastDimToZeroBase(args) {
+  if (args.length === 2 && (0, _is.isCollection)(args[0])) {
+    args = args.slice();
+    var dim = args[1];
+
+    if ((0, _is.isNumber)(dim)) {
+      args[1] = dim - 1;
+    } else if ((0, _is.isBigNumber)(dim)) {
+      args[1] = dim.minus(1);
+    }
+  }
+
+  return args;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/variance.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/variance.transform.js
new file mode 100644
index 0000000..5e8d588
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/variance.transform.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createVarianceTransform = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _errorTransform = require("./utils/errorTransform.js");
+
+var _variance = require("../../function/statistics/variance.js");
+
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+
+var name = 'variance';
+var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];
+/**
+ * Attach a transform function to math.var
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function var
+ * from one-based to zero based
+ */
+
+var createVarianceTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply,
+      divide = _ref.divide,
+      apply = _ref.apply,
+      isNaN = _ref.isNaN;
+  var variance = (0, _variance.createVariance)({
+    typed: typed,
+    add: add,
+    subtract: subtract,
+    multiply: multiply,
+    divide: divide,
+    apply: apply,
+    isNaN: isNaN
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+
+      try {
+        return variance.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
+exports.createVarianceTransform = createVarianceTransform;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/factoriesAny.js b/node_modules/mathjs/lib/cjs/factoriesAny.js
new file mode 100644
index 0000000..b44985c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/factoriesAny.js
@@ -0,0 +1,2591 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "createAbs", {
+  enumerable: true,
+  get: function get() {
+    return _abs.createAbs;
+  }
+});
+Object.defineProperty(exports, "createAccessorNode", {
+  enumerable: true,
+  get: function get() {
+    return _AccessorNode.createAccessorNode;
+  }
+});
+Object.defineProperty(exports, "createAcos", {
+  enumerable: true,
+  get: function get() {
+    return _acos.createAcos;
+  }
+});
+Object.defineProperty(exports, "createAcosh", {
+  enumerable: true,
+  get: function get() {
+    return _acosh.createAcosh;
+  }
+});
+Object.defineProperty(exports, "createAcot", {
+  enumerable: true,
+  get: function get() {
+    return _acot.createAcot;
+  }
+});
+Object.defineProperty(exports, "createAcoth", {
+  enumerable: true,
+  get: function get() {
+    return _acoth.createAcoth;
+  }
+});
+Object.defineProperty(exports, "createAcsc", {
+  enumerable: true,
+  get: function get() {
+    return _acsc.createAcsc;
+  }
+});
+Object.defineProperty(exports, "createAcsch", {
+  enumerable: true,
+  get: function get() {
+    return _acsch.createAcsch;
+  }
+});
+Object.defineProperty(exports, "createAdd", {
+  enumerable: true,
+  get: function get() {
+    return _add.createAdd;
+  }
+});
+Object.defineProperty(exports, "createAddScalar", {
+  enumerable: true,
+  get: function get() {
+    return _addScalar.createAddScalar;
+  }
+});
+Object.defineProperty(exports, "createAnd", {
+  enumerable: true,
+  get: function get() {
+    return _and.createAnd;
+  }
+});
+Object.defineProperty(exports, "createApply", {
+  enumerable: true,
+  get: function get() {
+    return _apply.createApply;
+  }
+});
+Object.defineProperty(exports, "createApplyTransform", {
+  enumerable: true,
+  get: function get() {
+    return _applyTransform.createApplyTransform;
+  }
+});
+Object.defineProperty(exports, "createArg", {
+  enumerable: true,
+  get: function get() {
+    return _arg.createArg;
+  }
+});
+Object.defineProperty(exports, "createArrayNode", {
+  enumerable: true,
+  get: function get() {
+    return _ArrayNode.createArrayNode;
+  }
+});
+Object.defineProperty(exports, "createAsec", {
+  enumerable: true,
+  get: function get() {
+    return _asec.createAsec;
+  }
+});
+Object.defineProperty(exports, "createAsech", {
+  enumerable: true,
+  get: function get() {
+    return _asech.createAsech;
+  }
+});
+Object.defineProperty(exports, "createAsin", {
+  enumerable: true,
+  get: function get() {
+    return _asin.createAsin;
+  }
+});
+Object.defineProperty(exports, "createAsinh", {
+  enumerable: true,
+  get: function get() {
+    return _asinh.createAsinh;
+  }
+});
+Object.defineProperty(exports, "createAssignmentNode", {
+  enumerable: true,
+  get: function get() {
+    return _AssignmentNode.createAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "createAtan", {
+  enumerable: true,
+  get: function get() {
+    return _atan.createAtan;
+  }
+});
+Object.defineProperty(exports, "createAtan2", {
+  enumerable: true,
+  get: function get() {
+    return _atan2.createAtan2;
+  }
+});
+Object.defineProperty(exports, "createAtanh", {
+  enumerable: true,
+  get: function get() {
+    return _atanh.createAtanh;
+  }
+});
+Object.defineProperty(exports, "createAtomicMass", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createAtomicMass;
+  }
+});
+Object.defineProperty(exports, "createAvogadro", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createAvogadro;
+  }
+});
+Object.defineProperty(exports, "createBellNumbers", {
+  enumerable: true,
+  get: function get() {
+    return _bellNumbers.createBellNumbers;
+  }
+});
+Object.defineProperty(exports, "createBigNumberClass", {
+  enumerable: true,
+  get: function get() {
+    return _BigNumber.createBigNumberClass;
+  }
+});
+Object.defineProperty(exports, "createBignumber", {
+  enumerable: true,
+  get: function get() {
+    return _bignumber.createBignumber;
+  }
+});
+Object.defineProperty(exports, "createBin", {
+  enumerable: true,
+  get: function get() {
+    return _bin.createBin;
+  }
+});
+Object.defineProperty(exports, "createBitAnd", {
+  enumerable: true,
+  get: function get() {
+    return _bitAnd.createBitAnd;
+  }
+});
+Object.defineProperty(exports, "createBitNot", {
+  enumerable: true,
+  get: function get() {
+    return _bitNot.createBitNot;
+  }
+});
+Object.defineProperty(exports, "createBitOr", {
+  enumerable: true,
+  get: function get() {
+    return _bitOr.createBitOr;
+  }
+});
+Object.defineProperty(exports, "createBitXor", {
+  enumerable: true,
+  get: function get() {
+    return _bitXor.createBitXor;
+  }
+});
+Object.defineProperty(exports, "createBlockNode", {
+  enumerable: true,
+  get: function get() {
+    return _BlockNode.createBlockNode;
+  }
+});
+Object.defineProperty(exports, "createBohrMagneton", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createBohrMagneton;
+  }
+});
+Object.defineProperty(exports, "createBohrRadius", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createBohrRadius;
+  }
+});
+Object.defineProperty(exports, "createBoltzmann", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createBoltzmann;
+  }
+});
+Object.defineProperty(exports, "createBoolean", {
+  enumerable: true,
+  get: function get() {
+    return _boolean.createBoolean;
+  }
+});
+Object.defineProperty(exports, "createCatalan", {
+  enumerable: true,
+  get: function get() {
+    return _catalan.createCatalan;
+  }
+});
+Object.defineProperty(exports, "createCbrt", {
+  enumerable: true,
+  get: function get() {
+    return _cbrt.createCbrt;
+  }
+});
+Object.defineProperty(exports, "createCeil", {
+  enumerable: true,
+  get: function get() {
+    return _ceil.createCeil;
+  }
+});
+Object.defineProperty(exports, "createChain", {
+  enumerable: true,
+  get: function get() {
+    return _chain.createChain;
+  }
+});
+Object.defineProperty(exports, "createChainClass", {
+  enumerable: true,
+  get: function get() {
+    return _Chain.createChainClass;
+  }
+});
+Object.defineProperty(exports, "createClassicalElectronRadius", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createClassicalElectronRadius;
+  }
+});
+Object.defineProperty(exports, "createClone", {
+  enumerable: true,
+  get: function get() {
+    return _clone.createClone;
+  }
+});
+Object.defineProperty(exports, "createColumn", {
+  enumerable: true,
+  get: function get() {
+    return _column.createColumn;
+  }
+});
+Object.defineProperty(exports, "createColumnTransform", {
+  enumerable: true,
+  get: function get() {
+    return _columnTransform.createColumnTransform;
+  }
+});
+Object.defineProperty(exports, "createCombinations", {
+  enumerable: true,
+  get: function get() {
+    return _combinations.createCombinations;
+  }
+});
+Object.defineProperty(exports, "createCombinationsWithRep", {
+  enumerable: true,
+  get: function get() {
+    return _combinationsWithRep.createCombinationsWithRep;
+  }
+});
+Object.defineProperty(exports, "createCompare", {
+  enumerable: true,
+  get: function get() {
+    return _compare.createCompare;
+  }
+});
+Object.defineProperty(exports, "createCompareNatural", {
+  enumerable: true,
+  get: function get() {
+    return _compareNatural.createCompareNatural;
+  }
+});
+Object.defineProperty(exports, "createCompareText", {
+  enumerable: true,
+  get: function get() {
+    return _compareText.createCompareText;
+  }
+});
+Object.defineProperty(exports, "createCompile", {
+  enumerable: true,
+  get: function get() {
+    return _compile.createCompile;
+  }
+});
+Object.defineProperty(exports, "createComplex", {
+  enumerable: true,
+  get: function get() {
+    return _complex.createComplex;
+  }
+});
+Object.defineProperty(exports, "createComplexClass", {
+  enumerable: true,
+  get: function get() {
+    return _Complex.createComplexClass;
+  }
+});
+Object.defineProperty(exports, "createComposition", {
+  enumerable: true,
+  get: function get() {
+    return _composition.createComposition;
+  }
+});
+Object.defineProperty(exports, "createConcat", {
+  enumerable: true,
+  get: function get() {
+    return _concat.createConcat;
+  }
+});
+Object.defineProperty(exports, "createConcatTransform", {
+  enumerable: true,
+  get: function get() {
+    return _concatTransform.createConcatTransform;
+  }
+});
+Object.defineProperty(exports, "createConditionalNode", {
+  enumerable: true,
+  get: function get() {
+    return _ConditionalNode.createConditionalNode;
+  }
+});
+Object.defineProperty(exports, "createConductanceQuantum", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createConductanceQuantum;
+  }
+});
+Object.defineProperty(exports, "createConj", {
+  enumerable: true,
+  get: function get() {
+    return _conj.createConj;
+  }
+});
+Object.defineProperty(exports, "createConstantNode", {
+  enumerable: true,
+  get: function get() {
+    return _ConstantNode.createConstantNode;
+  }
+});
+Object.defineProperty(exports, "createCos", {
+  enumerable: true,
+  get: function get() {
+    return _cos.createCos;
+  }
+});
+Object.defineProperty(exports, "createCosh", {
+  enumerable: true,
+  get: function get() {
+    return _cosh.createCosh;
+  }
+});
+Object.defineProperty(exports, "createCot", {
+  enumerable: true,
+  get: function get() {
+    return _cot.createCot;
+  }
+});
+Object.defineProperty(exports, "createCoth", {
+  enumerable: true,
+  get: function get() {
+    return _coth.createCoth;
+  }
+});
+Object.defineProperty(exports, "createCoulomb", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createCoulomb;
+  }
+});
+Object.defineProperty(exports, "createCount", {
+  enumerable: true,
+  get: function get() {
+    return _count.createCount;
+  }
+});
+Object.defineProperty(exports, "createCreateUnit", {
+  enumerable: true,
+  get: function get() {
+    return _createUnit.createCreateUnit;
+  }
+});
+Object.defineProperty(exports, "createCross", {
+  enumerable: true,
+  get: function get() {
+    return _cross.createCross;
+  }
+});
+Object.defineProperty(exports, "createCsc", {
+  enumerable: true,
+  get: function get() {
+    return _csc.createCsc;
+  }
+});
+Object.defineProperty(exports, "createCsch", {
+  enumerable: true,
+  get: function get() {
+    return _csch.createCsch;
+  }
+});
+Object.defineProperty(exports, "createCtranspose", {
+  enumerable: true,
+  get: function get() {
+    return _ctranspose.createCtranspose;
+  }
+});
+Object.defineProperty(exports, "createCube", {
+  enumerable: true,
+  get: function get() {
+    return _cube.createCube;
+  }
+});
+Object.defineProperty(exports, "createCumSum", {
+  enumerable: true,
+  get: function get() {
+    return _cumsum.createCumSum;
+  }
+});
+Object.defineProperty(exports, "createCumSumTransform", {
+  enumerable: true,
+  get: function get() {
+    return _cumsumTransform.createCumSumTransform;
+  }
+});
+Object.defineProperty(exports, "createDeepEqual", {
+  enumerable: true,
+  get: function get() {
+    return _deepEqual.createDeepEqual;
+  }
+});
+Object.defineProperty(exports, "createDenseMatrixClass", {
+  enumerable: true,
+  get: function get() {
+    return _DenseMatrix.createDenseMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createDerivative", {
+  enumerable: true,
+  get: function get() {
+    return _derivative.createDerivative;
+  }
+});
+Object.defineProperty(exports, "createDet", {
+  enumerable: true,
+  get: function get() {
+    return _det.createDet;
+  }
+});
+Object.defineProperty(exports, "createDeuteronMass", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createDeuteronMass;
+  }
+});
+Object.defineProperty(exports, "createDiag", {
+  enumerable: true,
+  get: function get() {
+    return _diag.createDiag;
+  }
+});
+Object.defineProperty(exports, "createDiff", {
+  enumerable: true,
+  get: function get() {
+    return _diff.createDiff;
+  }
+});
+Object.defineProperty(exports, "createDiffTransform", {
+  enumerable: true,
+  get: function get() {
+    return _diffTransform.createDiffTransform;
+  }
+});
+Object.defineProperty(exports, "createDistance", {
+  enumerable: true,
+  get: function get() {
+    return _distance.createDistance;
+  }
+});
+Object.defineProperty(exports, "createDivide", {
+  enumerable: true,
+  get: function get() {
+    return _divide.createDivide;
+  }
+});
+Object.defineProperty(exports, "createDivideScalar", {
+  enumerable: true,
+  get: function get() {
+    return _divideScalar.createDivideScalar;
+  }
+});
+Object.defineProperty(exports, "createDot", {
+  enumerable: true,
+  get: function get() {
+    return _dot.createDot;
+  }
+});
+Object.defineProperty(exports, "createDotDivide", {
+  enumerable: true,
+  get: function get() {
+    return _dotDivide.createDotDivide;
+  }
+});
+Object.defineProperty(exports, "createDotMultiply", {
+  enumerable: true,
+  get: function get() {
+    return _dotMultiply.createDotMultiply;
+  }
+});
+Object.defineProperty(exports, "createDotPow", {
+  enumerable: true,
+  get: function get() {
+    return _dotPow.createDotPow;
+  }
+});
+Object.defineProperty(exports, "createE", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createE;
+  }
+});
+Object.defineProperty(exports, "createEfimovFactor", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createEfimovFactor;
+  }
+});
+Object.defineProperty(exports, "createEigs", {
+  enumerable: true,
+  get: function get() {
+    return _eigs.createEigs;
+  }
+});
+Object.defineProperty(exports, "createElectricConstant", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createElectricConstant;
+  }
+});
+Object.defineProperty(exports, "createElectronMass", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createElectronMass;
+  }
+});
+Object.defineProperty(exports, "createElementaryCharge", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createElementaryCharge;
+  }
+});
+Object.defineProperty(exports, "createEqual", {
+  enumerable: true,
+  get: function get() {
+    return _equal.createEqual;
+  }
+});
+Object.defineProperty(exports, "createEqualScalar", {
+  enumerable: true,
+  get: function get() {
+    return _equalScalar.createEqualScalar;
+  }
+});
+Object.defineProperty(exports, "createEqualText", {
+  enumerable: true,
+  get: function get() {
+    return _equalText.createEqualText;
+  }
+});
+Object.defineProperty(exports, "createErf", {
+  enumerable: true,
+  get: function get() {
+    return _erf.createErf;
+  }
+});
+Object.defineProperty(exports, "createEvaluate", {
+  enumerable: true,
+  get: function get() {
+    return _evaluate.createEvaluate;
+  }
+});
+Object.defineProperty(exports, "createExp", {
+  enumerable: true,
+  get: function get() {
+    return _exp.createExp;
+  }
+});
+Object.defineProperty(exports, "createExpm", {
+  enumerable: true,
+  get: function get() {
+    return _expm2.createExpm;
+  }
+});
+Object.defineProperty(exports, "createExpm1", {
+  enumerable: true,
+  get: function get() {
+    return _expm.createExpm1;
+  }
+});
+Object.defineProperty(exports, "createFactorial", {
+  enumerable: true,
+  get: function get() {
+    return _factorial.createFactorial;
+  }
+});
+Object.defineProperty(exports, "createFalse", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createFalse;
+  }
+});
+Object.defineProperty(exports, "createFaraday", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createFaraday;
+  }
+});
+Object.defineProperty(exports, "createFermiCoupling", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createFermiCoupling;
+  }
+});
+Object.defineProperty(exports, "createFibonacciHeapClass", {
+  enumerable: true,
+  get: function get() {
+    return _FibonacciHeap.createFibonacciHeapClass;
+  }
+});
+Object.defineProperty(exports, "createFilter", {
+  enumerable: true,
+  get: function get() {
+    return _filter.createFilter;
+  }
+});
+Object.defineProperty(exports, "createFilterTransform", {
+  enumerable: true,
+  get: function get() {
+    return _filterTransform.createFilterTransform;
+  }
+});
+Object.defineProperty(exports, "createFineStructure", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createFineStructure;
+  }
+});
+Object.defineProperty(exports, "createFirstRadiation", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createFirstRadiation;
+  }
+});
+Object.defineProperty(exports, "createFix", {
+  enumerable: true,
+  get: function get() {
+    return _fix.createFix;
+  }
+});
+Object.defineProperty(exports, "createFlatten", {
+  enumerable: true,
+  get: function get() {
+    return _flatten.createFlatten;
+  }
+});
+Object.defineProperty(exports, "createFloor", {
+  enumerable: true,
+  get: function get() {
+    return _floor.createFloor;
+  }
+});
+Object.defineProperty(exports, "createForEach", {
+  enumerable: true,
+  get: function get() {
+    return _forEach.createForEach;
+  }
+});
+Object.defineProperty(exports, "createForEachTransform", {
+  enumerable: true,
+  get: function get() {
+    return _forEachTransform.createForEachTransform;
+  }
+});
+Object.defineProperty(exports, "createFormat", {
+  enumerable: true,
+  get: function get() {
+    return _format.createFormat;
+  }
+});
+Object.defineProperty(exports, "createFraction", {
+  enumerable: true,
+  get: function get() {
+    return _fraction.createFraction;
+  }
+});
+Object.defineProperty(exports, "createFractionClass", {
+  enumerable: true,
+  get: function get() {
+    return _Fraction.createFractionClass;
+  }
+});
+Object.defineProperty(exports, "createFunctionAssignmentNode", {
+  enumerable: true,
+  get: function get() {
+    return _FunctionAssignmentNode.createFunctionAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "createFunctionNode", {
+  enumerable: true,
+  get: function get() {
+    return _FunctionNode.createFunctionNode;
+  }
+});
+Object.defineProperty(exports, "createGamma", {
+  enumerable: true,
+  get: function get() {
+    return _gamma.createGamma;
+  }
+});
+Object.defineProperty(exports, "createGasConstant", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createGasConstant;
+  }
+});
+Object.defineProperty(exports, "createGcd", {
+  enumerable: true,
+  get: function get() {
+    return _gcd.createGcd;
+  }
+});
+Object.defineProperty(exports, "createGetMatrixDataType", {
+  enumerable: true,
+  get: function get() {
+    return _getMatrixDataType.createGetMatrixDataType;
+  }
+});
+Object.defineProperty(exports, "createGravitationConstant", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createGravitationConstant;
+  }
+});
+Object.defineProperty(exports, "createGravity", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createGravity;
+  }
+});
+Object.defineProperty(exports, "createHartreeEnergy", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createHartreeEnergy;
+  }
+});
+Object.defineProperty(exports, "createHasNumericValue", {
+  enumerable: true,
+  get: function get() {
+    return _hasNumericValue.createHasNumericValue;
+  }
+});
+Object.defineProperty(exports, "createHelp", {
+  enumerable: true,
+  get: function get() {
+    return _help.createHelp;
+  }
+});
+Object.defineProperty(exports, "createHelpClass", {
+  enumerable: true,
+  get: function get() {
+    return _Help.createHelpClass;
+  }
+});
+Object.defineProperty(exports, "createHex", {
+  enumerable: true,
+  get: function get() {
+    return _hex.createHex;
+  }
+});
+Object.defineProperty(exports, "createHypot", {
+  enumerable: true,
+  get: function get() {
+    return _hypot.createHypot;
+  }
+});
+Object.defineProperty(exports, "createI", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createI;
+  }
+});
+Object.defineProperty(exports, "createIdentity", {
+  enumerable: true,
+  get: function get() {
+    return _identity.createIdentity;
+  }
+});
+Object.defineProperty(exports, "createIm", {
+  enumerable: true,
+  get: function get() {
+    return _im.createIm;
+  }
+});
+Object.defineProperty(exports, "createImmutableDenseMatrixClass", {
+  enumerable: true,
+  get: function get() {
+    return _ImmutableDenseMatrix.createImmutableDenseMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createIndex", {
+  enumerable: true,
+  get: function get() {
+    return _index.createIndex;
+  }
+});
+Object.defineProperty(exports, "createIndexClass", {
+  enumerable: true,
+  get: function get() {
+    return _MatrixIndex.createIndexClass;
+  }
+});
+Object.defineProperty(exports, "createIndexNode", {
+  enumerable: true,
+  get: function get() {
+    return _IndexNode.createIndexNode;
+  }
+});
+Object.defineProperty(exports, "createIndexTransform", {
+  enumerable: true,
+  get: function get() {
+    return _indexTransform.createIndexTransform;
+  }
+});
+Object.defineProperty(exports, "createInfinity", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createInfinity;
+  }
+});
+Object.defineProperty(exports, "createIntersect", {
+  enumerable: true,
+  get: function get() {
+    return _intersect.createIntersect;
+  }
+});
+Object.defineProperty(exports, "createInv", {
+  enumerable: true,
+  get: function get() {
+    return _inv.createInv;
+  }
+});
+Object.defineProperty(exports, "createInverseConductanceQuantum", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createInverseConductanceQuantum;
+  }
+});
+Object.defineProperty(exports, "createInvmod", {
+  enumerable: true,
+  get: function get() {
+    return _invmod.createInvmod;
+  }
+});
+Object.defineProperty(exports, "createIsInteger", {
+  enumerable: true,
+  get: function get() {
+    return _isInteger.createIsInteger;
+  }
+});
+Object.defineProperty(exports, "createIsNaN", {
+  enumerable: true,
+  get: function get() {
+    return _isNaN.createIsNaN;
+  }
+});
+Object.defineProperty(exports, "createIsNegative", {
+  enumerable: true,
+  get: function get() {
+    return _isNegative.createIsNegative;
+  }
+});
+Object.defineProperty(exports, "createIsNumeric", {
+  enumerable: true,
+  get: function get() {
+    return _isNumeric.createIsNumeric;
+  }
+});
+Object.defineProperty(exports, "createIsPositive", {
+  enumerable: true,
+  get: function get() {
+    return _isPositive.createIsPositive;
+  }
+});
+Object.defineProperty(exports, "createIsPrime", {
+  enumerable: true,
+  get: function get() {
+    return _isPrime.createIsPrime;
+  }
+});
+Object.defineProperty(exports, "createIsZero", {
+  enumerable: true,
+  get: function get() {
+    return _isZero.createIsZero;
+  }
+});
+Object.defineProperty(exports, "createKldivergence", {
+  enumerable: true,
+  get: function get() {
+    return _kldivergence.createKldivergence;
+  }
+});
+Object.defineProperty(exports, "createKlitzing", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createKlitzing;
+  }
+});
+Object.defineProperty(exports, "createKron", {
+  enumerable: true,
+  get: function get() {
+    return _kron.createKron;
+  }
+});
+Object.defineProperty(exports, "createLN10", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLN10;
+  }
+});
+Object.defineProperty(exports, "createLN2", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLN2;
+  }
+});
+Object.defineProperty(exports, "createLOG10E", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLOG10E;
+  }
+});
+Object.defineProperty(exports, "createLOG2E", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLOG2E;
+  }
+});
+Object.defineProperty(exports, "createLarger", {
+  enumerable: true,
+  get: function get() {
+    return _larger.createLarger;
+  }
+});
+Object.defineProperty(exports, "createLargerEq", {
+  enumerable: true,
+  get: function get() {
+    return _largerEq.createLargerEq;
+  }
+});
+Object.defineProperty(exports, "createLcm", {
+  enumerable: true,
+  get: function get() {
+    return _lcm.createLcm;
+  }
+});
+Object.defineProperty(exports, "createLeafCount", {
+  enumerable: true,
+  get: function get() {
+    return _leafCount.createLeafCount;
+  }
+});
+Object.defineProperty(exports, "createLeftShift", {
+  enumerable: true,
+  get: function get() {
+    return _leftShift.createLeftShift;
+  }
+});
+Object.defineProperty(exports, "createLog", {
+  enumerable: true,
+  get: function get() {
+    return _log3.createLog;
+  }
+});
+Object.defineProperty(exports, "createLog10", {
+  enumerable: true,
+  get: function get() {
+    return _log.createLog10;
+  }
+});
+Object.defineProperty(exports, "createLog1p", {
+  enumerable: true,
+  get: function get() {
+    return _log1p.createLog1p;
+  }
+});
+Object.defineProperty(exports, "createLog2", {
+  enumerable: true,
+  get: function get() {
+    return _log2.createLog2;
+  }
+});
+Object.defineProperty(exports, "createLoschmidt", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createLoschmidt;
+  }
+});
+Object.defineProperty(exports, "createLsolve", {
+  enumerable: true,
+  get: function get() {
+    return _lsolve.createLsolve;
+  }
+});
+Object.defineProperty(exports, "createLsolveAll", {
+  enumerable: true,
+  get: function get() {
+    return _lsolveAll.createLsolveAll;
+  }
+});
+Object.defineProperty(exports, "createLup", {
+  enumerable: true,
+  get: function get() {
+    return _lup.createLup;
+  }
+});
+Object.defineProperty(exports, "createLusolve", {
+  enumerable: true,
+  get: function get() {
+    return _lusolve.createLusolve;
+  }
+});
+Object.defineProperty(exports, "createMad", {
+  enumerable: true,
+  get: function get() {
+    return _mad.createMad;
+  }
+});
+Object.defineProperty(exports, "createMagneticConstant", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createMagneticConstant;
+  }
+});
+Object.defineProperty(exports, "createMagneticFluxQuantum", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createMagneticFluxQuantum;
+  }
+});
+Object.defineProperty(exports, "createMap", {
+  enumerable: true,
+  get: function get() {
+    return _map.createMap;
+  }
+});
+Object.defineProperty(exports, "createMapTransform", {
+  enumerable: true,
+  get: function get() {
+    return _mapTransform.createMapTransform;
+  }
+});
+Object.defineProperty(exports, "createMatrix", {
+  enumerable: true,
+  get: function get() {
+    return _matrix.createMatrix;
+  }
+});
+Object.defineProperty(exports, "createMatrixClass", {
+  enumerable: true,
+  get: function get() {
+    return _Matrix.createMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createMatrixFromColumns", {
+  enumerable: true,
+  get: function get() {
+    return _matrixFromColumns.createMatrixFromColumns;
+  }
+});
+Object.defineProperty(exports, "createMatrixFromFunction", {
+  enumerable: true,
+  get: function get() {
+    return _matrixFromFunction.createMatrixFromFunction;
+  }
+});
+Object.defineProperty(exports, "createMatrixFromRows", {
+  enumerable: true,
+  get: function get() {
+    return _matrixFromRows.createMatrixFromRows;
+  }
+});
+Object.defineProperty(exports, "createMax", {
+  enumerable: true,
+  get: function get() {
+    return _max.createMax;
+  }
+});
+Object.defineProperty(exports, "createMaxTransform", {
+  enumerable: true,
+  get: function get() {
+    return _maxTransform.createMaxTransform;
+  }
+});
+Object.defineProperty(exports, "createMean", {
+  enumerable: true,
+  get: function get() {
+    return _mean.createMean;
+  }
+});
+Object.defineProperty(exports, "createMeanTransform", {
+  enumerable: true,
+  get: function get() {
+    return _meanTransform.createMeanTransform;
+  }
+});
+Object.defineProperty(exports, "createMedian", {
+  enumerable: true,
+  get: function get() {
+    return _median.createMedian;
+  }
+});
+Object.defineProperty(exports, "createMin", {
+  enumerable: true,
+  get: function get() {
+    return _min.createMin;
+  }
+});
+Object.defineProperty(exports, "createMinTransform", {
+  enumerable: true,
+  get: function get() {
+    return _minTransform.createMinTransform;
+  }
+});
+Object.defineProperty(exports, "createMod", {
+  enumerable: true,
+  get: function get() {
+    return _mod.createMod;
+  }
+});
+Object.defineProperty(exports, "createMode", {
+  enumerable: true,
+  get: function get() {
+    return _mode.createMode;
+  }
+});
+Object.defineProperty(exports, "createMolarMass", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createMolarMass;
+  }
+});
+Object.defineProperty(exports, "createMolarMassC12", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createMolarMassC12;
+  }
+});
+Object.defineProperty(exports, "createMolarPlanckConstant", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createMolarPlanckConstant;
+  }
+});
+Object.defineProperty(exports, "createMolarVolume", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createMolarVolume;
+  }
+});
+Object.defineProperty(exports, "createMultinomial", {
+  enumerable: true,
+  get: function get() {
+    return _multinomial.createMultinomial;
+  }
+});
+Object.defineProperty(exports, "createMultiply", {
+  enumerable: true,
+  get: function get() {
+    return _multiply.createMultiply;
+  }
+});
+Object.defineProperty(exports, "createMultiplyScalar", {
+  enumerable: true,
+  get: function get() {
+    return _multiplyScalar.createMultiplyScalar;
+  }
+});
+Object.defineProperty(exports, "createNaN", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createNaN;
+  }
+});
+Object.defineProperty(exports, "createNeutronMass", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createNeutronMass;
+  }
+});
+Object.defineProperty(exports, "createNode", {
+  enumerable: true,
+  get: function get() {
+    return _Node.createNode;
+  }
+});
+Object.defineProperty(exports, "createNorm", {
+  enumerable: true,
+  get: function get() {
+    return _norm.createNorm;
+  }
+});
+Object.defineProperty(exports, "createNot", {
+  enumerable: true,
+  get: function get() {
+    return _not.createNot;
+  }
+});
+Object.defineProperty(exports, "createNthRoot", {
+  enumerable: true,
+  get: function get() {
+    return _nthRoot.createNthRoot;
+  }
+});
+Object.defineProperty(exports, "createNthRoots", {
+  enumerable: true,
+  get: function get() {
+    return _nthRoots.createNthRoots;
+  }
+});
+Object.defineProperty(exports, "createNuclearMagneton", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createNuclearMagneton;
+  }
+});
+Object.defineProperty(exports, "createNull", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createNull;
+  }
+});
+Object.defineProperty(exports, "createNumber", {
+  enumerable: true,
+  get: function get() {
+    return _number.createNumber;
+  }
+});
+Object.defineProperty(exports, "createNumeric", {
+  enumerable: true,
+  get: function get() {
+    return _numeric.createNumeric;
+  }
+});
+Object.defineProperty(exports, "createObjectNode", {
+  enumerable: true,
+  get: function get() {
+    return _ObjectNode.createObjectNode;
+  }
+});
+Object.defineProperty(exports, "createOct", {
+  enumerable: true,
+  get: function get() {
+    return _oct.createOct;
+  }
+});
+Object.defineProperty(exports, "createOnes", {
+  enumerable: true,
+  get: function get() {
+    return _ones.createOnes;
+  }
+});
+Object.defineProperty(exports, "createOperatorNode", {
+  enumerable: true,
+  get: function get() {
+    return _OperatorNode.createOperatorNode;
+  }
+});
+Object.defineProperty(exports, "createOr", {
+  enumerable: true,
+  get: function get() {
+    return _or.createOr;
+  }
+});
+Object.defineProperty(exports, "createParenthesisNode", {
+  enumerable: true,
+  get: function get() {
+    return _ParenthesisNode.createParenthesisNode;
+  }
+});
+Object.defineProperty(exports, "createParse", {
+  enumerable: true,
+  get: function get() {
+    return _parse.createParse;
+  }
+});
+Object.defineProperty(exports, "createParser", {
+  enumerable: true,
+  get: function get() {
+    return _parser.createParser;
+  }
+});
+Object.defineProperty(exports, "createParserClass", {
+  enumerable: true,
+  get: function get() {
+    return _Parser.createParserClass;
+  }
+});
+Object.defineProperty(exports, "createPartitionSelect", {
+  enumerable: true,
+  get: function get() {
+    return _partitionSelect.createPartitionSelect;
+  }
+});
+Object.defineProperty(exports, "createPermutations", {
+  enumerable: true,
+  get: function get() {
+    return _permutations.createPermutations;
+  }
+});
+Object.defineProperty(exports, "createPhi", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createPhi;
+  }
+});
+Object.defineProperty(exports, "createPi", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createPi;
+  }
+});
+Object.defineProperty(exports, "createPickRandom", {
+  enumerable: true,
+  get: function get() {
+    return _pickRandom.createPickRandom;
+  }
+});
+Object.defineProperty(exports, "createPlanckCharge", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createPlanckCharge;
+  }
+});
+Object.defineProperty(exports, "createPlanckConstant", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createPlanckConstant;
+  }
+});
+Object.defineProperty(exports, "createPlanckLength", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createPlanckLength;
+  }
+});
+Object.defineProperty(exports, "createPlanckMass", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createPlanckMass;
+  }
+});
+Object.defineProperty(exports, "createPlanckTemperature", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createPlanckTemperature;
+  }
+});
+Object.defineProperty(exports, "createPlanckTime", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createPlanckTime;
+  }
+});
+Object.defineProperty(exports, "createPow", {
+  enumerable: true,
+  get: function get() {
+    return _pow.createPow;
+  }
+});
+Object.defineProperty(exports, "createPrint", {
+  enumerable: true,
+  get: function get() {
+    return _print.createPrint;
+  }
+});
+Object.defineProperty(exports, "createProd", {
+  enumerable: true,
+  get: function get() {
+    return _prod.createProd;
+  }
+});
+Object.defineProperty(exports, "createProtonMass", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createProtonMass;
+  }
+});
+Object.defineProperty(exports, "createQr", {
+  enumerable: true,
+  get: function get() {
+    return _qr.createQr;
+  }
+});
+Object.defineProperty(exports, "createQuantileSeq", {
+  enumerable: true,
+  get: function get() {
+    return _quantileSeq.createQuantileSeq;
+  }
+});
+Object.defineProperty(exports, "createQuantumOfCirculation", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createQuantumOfCirculation;
+  }
+});
+Object.defineProperty(exports, "createRandom", {
+  enumerable: true,
+  get: function get() {
+    return _random.createRandom;
+  }
+});
+Object.defineProperty(exports, "createRandomInt", {
+  enumerable: true,
+  get: function get() {
+    return _randomInt.createRandomInt;
+  }
+});
+Object.defineProperty(exports, "createRange", {
+  enumerable: true,
+  get: function get() {
+    return _range.createRange;
+  }
+});
+Object.defineProperty(exports, "createRangeClass", {
+  enumerable: true,
+  get: function get() {
+    return _Range.createRangeClass;
+  }
+});
+Object.defineProperty(exports, "createRangeNode", {
+  enumerable: true,
+  get: function get() {
+    return _RangeNode.createRangeNode;
+  }
+});
+Object.defineProperty(exports, "createRangeTransform", {
+  enumerable: true,
+  get: function get() {
+    return _rangeTransform.createRangeTransform;
+  }
+});
+Object.defineProperty(exports, "createRationalize", {
+  enumerable: true,
+  get: function get() {
+    return _rationalize.createRationalize;
+  }
+});
+Object.defineProperty(exports, "createRe", {
+  enumerable: true,
+  get: function get() {
+    return _re.createRe;
+  }
+});
+Object.defineProperty(exports, "createReducedPlanckConstant", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createReducedPlanckConstant;
+  }
+});
+Object.defineProperty(exports, "createRelationalNode", {
+  enumerable: true,
+  get: function get() {
+    return _RelationalNode.createRelationalNode;
+  }
+});
+Object.defineProperty(exports, "createReplacer", {
+  enumerable: true,
+  get: function get() {
+    return _replacer.createReplacer;
+  }
+});
+Object.defineProperty(exports, "createReshape", {
+  enumerable: true,
+  get: function get() {
+    return _reshape.createReshape;
+  }
+});
+Object.defineProperty(exports, "createResize", {
+  enumerable: true,
+  get: function get() {
+    return _resize.createResize;
+  }
+});
+Object.defineProperty(exports, "createResolve", {
+  enumerable: true,
+  get: function get() {
+    return _resolve.createResolve;
+  }
+});
+Object.defineProperty(exports, "createResultSet", {
+  enumerable: true,
+  get: function get() {
+    return _ResultSet.createResultSet;
+  }
+});
+Object.defineProperty(exports, "createReviver", {
+  enumerable: true,
+  get: function get() {
+    return _reviver.createReviver;
+  }
+});
+Object.defineProperty(exports, "createRightArithShift", {
+  enumerable: true,
+  get: function get() {
+    return _rightArithShift.createRightArithShift;
+  }
+});
+Object.defineProperty(exports, "createRightLogShift", {
+  enumerable: true,
+  get: function get() {
+    return _rightLogShift.createRightLogShift;
+  }
+});
+Object.defineProperty(exports, "createRotate", {
+  enumerable: true,
+  get: function get() {
+    return _rotate.createRotate;
+  }
+});
+Object.defineProperty(exports, "createRotationMatrix", {
+  enumerable: true,
+  get: function get() {
+    return _rotationMatrix.createRotationMatrix;
+  }
+});
+Object.defineProperty(exports, "createRound", {
+  enumerable: true,
+  get: function get() {
+    return _round.createRound;
+  }
+});
+Object.defineProperty(exports, "createRow", {
+  enumerable: true,
+  get: function get() {
+    return _row.createRow;
+  }
+});
+Object.defineProperty(exports, "createRowTransform", {
+  enumerable: true,
+  get: function get() {
+    return _rowTransform.createRowTransform;
+  }
+});
+Object.defineProperty(exports, "createRydberg", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createRydberg;
+  }
+});
+Object.defineProperty(exports, "createSQRT1_2", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createSQRT1_2;
+  }
+});
+Object.defineProperty(exports, "createSQRT2", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createSQRT2;
+  }
+});
+Object.defineProperty(exports, "createSackurTetrode", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createSackurTetrode;
+  }
+});
+Object.defineProperty(exports, "createSec", {
+  enumerable: true,
+  get: function get() {
+    return _sec.createSec;
+  }
+});
+Object.defineProperty(exports, "createSech", {
+  enumerable: true,
+  get: function get() {
+    return _sech.createSech;
+  }
+});
+Object.defineProperty(exports, "createSecondRadiation", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createSecondRadiation;
+  }
+});
+Object.defineProperty(exports, "createSetCartesian", {
+  enumerable: true,
+  get: function get() {
+    return _setCartesian.createSetCartesian;
+  }
+});
+Object.defineProperty(exports, "createSetDifference", {
+  enumerable: true,
+  get: function get() {
+    return _setDifference.createSetDifference;
+  }
+});
+Object.defineProperty(exports, "createSetDistinct", {
+  enumerable: true,
+  get: function get() {
+    return _setDistinct.createSetDistinct;
+  }
+});
+Object.defineProperty(exports, "createSetIntersect", {
+  enumerable: true,
+  get: function get() {
+    return _setIntersect.createSetIntersect;
+  }
+});
+Object.defineProperty(exports, "createSetIsSubset", {
+  enumerable: true,
+  get: function get() {
+    return _setIsSubset.createSetIsSubset;
+  }
+});
+Object.defineProperty(exports, "createSetMultiplicity", {
+  enumerable: true,
+  get: function get() {
+    return _setMultiplicity.createSetMultiplicity;
+  }
+});
+Object.defineProperty(exports, "createSetPowerset", {
+  enumerable: true,
+  get: function get() {
+    return _setPowerset.createSetPowerset;
+  }
+});
+Object.defineProperty(exports, "createSetSize", {
+  enumerable: true,
+  get: function get() {
+    return _setSize.createSetSize;
+  }
+});
+Object.defineProperty(exports, "createSetSymDifference", {
+  enumerable: true,
+  get: function get() {
+    return _setSymDifference.createSetSymDifference;
+  }
+});
+Object.defineProperty(exports, "createSetUnion", {
+  enumerable: true,
+  get: function get() {
+    return _setUnion.createSetUnion;
+  }
+});
+Object.defineProperty(exports, "createSign", {
+  enumerable: true,
+  get: function get() {
+    return _sign.createSign;
+  }
+});
+Object.defineProperty(exports, "createSimplify", {
+  enumerable: true,
+  get: function get() {
+    return _simplify.createSimplify;
+  }
+});
+Object.defineProperty(exports, "createSimplifyCore", {
+  enumerable: true,
+  get: function get() {
+    return _simplifyCore.createSimplifyCore;
+  }
+});
+Object.defineProperty(exports, "createSin", {
+  enumerable: true,
+  get: function get() {
+    return _sin.createSin;
+  }
+});
+Object.defineProperty(exports, "createSinh", {
+  enumerable: true,
+  get: function get() {
+    return _sinh.createSinh;
+  }
+});
+Object.defineProperty(exports, "createSize", {
+  enumerable: true,
+  get: function get() {
+    return _size.createSize;
+  }
+});
+Object.defineProperty(exports, "createSlu", {
+  enumerable: true,
+  get: function get() {
+    return _slu.createSlu;
+  }
+});
+Object.defineProperty(exports, "createSmaller", {
+  enumerable: true,
+  get: function get() {
+    return _smaller.createSmaller;
+  }
+});
+Object.defineProperty(exports, "createSmallerEq", {
+  enumerable: true,
+  get: function get() {
+    return _smallerEq.createSmallerEq;
+  }
+});
+Object.defineProperty(exports, "createSort", {
+  enumerable: true,
+  get: function get() {
+    return _sort.createSort;
+  }
+});
+Object.defineProperty(exports, "createSpaClass", {
+  enumerable: true,
+  get: function get() {
+    return _Spa.createSpaClass;
+  }
+});
+Object.defineProperty(exports, "createSparse", {
+  enumerable: true,
+  get: function get() {
+    return _sparse.createSparse;
+  }
+});
+Object.defineProperty(exports, "createSparseMatrixClass", {
+  enumerable: true,
+  get: function get() {
+    return _SparseMatrix.createSparseMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createSpeedOfLight", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createSpeedOfLight;
+  }
+});
+Object.defineProperty(exports, "createSplitUnit", {
+  enumerable: true,
+  get: function get() {
+    return _splitUnit.createSplitUnit;
+  }
+});
+Object.defineProperty(exports, "createSqrt", {
+  enumerable: true,
+  get: function get() {
+    return _sqrt.createSqrt;
+  }
+});
+Object.defineProperty(exports, "createSqrtm", {
+  enumerable: true,
+  get: function get() {
+    return _sqrtm.createSqrtm;
+  }
+});
+Object.defineProperty(exports, "createSquare", {
+  enumerable: true,
+  get: function get() {
+    return _square.createSquare;
+  }
+});
+Object.defineProperty(exports, "createSqueeze", {
+  enumerable: true,
+  get: function get() {
+    return _squeeze.createSqueeze;
+  }
+});
+Object.defineProperty(exports, "createStd", {
+  enumerable: true,
+  get: function get() {
+    return _std.createStd;
+  }
+});
+Object.defineProperty(exports, "createStdTransform", {
+  enumerable: true,
+  get: function get() {
+    return _stdTransform.createStdTransform;
+  }
+});
+Object.defineProperty(exports, "createStefanBoltzmann", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createStefanBoltzmann;
+  }
+});
+Object.defineProperty(exports, "createStirlingS2", {
+  enumerable: true,
+  get: function get() {
+    return _stirlingS.createStirlingS2;
+  }
+});
+Object.defineProperty(exports, "createString", {
+  enumerable: true,
+  get: function get() {
+    return _string.createString;
+  }
+});
+Object.defineProperty(exports, "createSubset", {
+  enumerable: true,
+  get: function get() {
+    return _subset.createSubset;
+  }
+});
+Object.defineProperty(exports, "createSubsetTransform", {
+  enumerable: true,
+  get: function get() {
+    return _subsetTransform.createSubsetTransform;
+  }
+});
+Object.defineProperty(exports, "createSubtract", {
+  enumerable: true,
+  get: function get() {
+    return _subtract.createSubtract;
+  }
+});
+Object.defineProperty(exports, "createSum", {
+  enumerable: true,
+  get: function get() {
+    return _sum.createSum;
+  }
+});
+Object.defineProperty(exports, "createSumTransform", {
+  enumerable: true,
+  get: function get() {
+    return _sumTransform.createSumTransform;
+  }
+});
+Object.defineProperty(exports, "createSymbolNode", {
+  enumerable: true,
+  get: function get() {
+    return _SymbolNode.createSymbolNode;
+  }
+});
+Object.defineProperty(exports, "createSymbolicEqual", {
+  enumerable: true,
+  get: function get() {
+    return _symbolicEqual.createSymbolicEqual;
+  }
+});
+Object.defineProperty(exports, "createTan", {
+  enumerable: true,
+  get: function get() {
+    return _tan.createTan;
+  }
+});
+Object.defineProperty(exports, "createTanh", {
+  enumerable: true,
+  get: function get() {
+    return _tanh.createTanh;
+  }
+});
+Object.defineProperty(exports, "createTau", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createTau;
+  }
+});
+Object.defineProperty(exports, "createThomsonCrossSection", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createThomsonCrossSection;
+  }
+});
+Object.defineProperty(exports, "createTo", {
+  enumerable: true,
+  get: function get() {
+    return _to.createTo;
+  }
+});
+Object.defineProperty(exports, "createTrace", {
+  enumerable: true,
+  get: function get() {
+    return _trace.createTrace;
+  }
+});
+Object.defineProperty(exports, "createTranspose", {
+  enumerable: true,
+  get: function get() {
+    return _transpose.createTranspose;
+  }
+});
+Object.defineProperty(exports, "createTrue", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createTrue;
+  }
+});
+Object.defineProperty(exports, "createTypeOf", {
+  enumerable: true,
+  get: function get() {
+    return _typeOf.createTypeOf;
+  }
+});
+Object.defineProperty(exports, "createTyped", {
+  enumerable: true,
+  get: function get() {
+    return _typed.createTyped;
+  }
+});
+Object.defineProperty(exports, "createUnaryMinus", {
+  enumerable: true,
+  get: function get() {
+    return _unaryMinus.createUnaryMinus;
+  }
+});
+Object.defineProperty(exports, "createUnaryPlus", {
+  enumerable: true,
+  get: function get() {
+    return _unaryPlus.createUnaryPlus;
+  }
+});
+Object.defineProperty(exports, "createUnequal", {
+  enumerable: true,
+  get: function get() {
+    return _unequal.createUnequal;
+  }
+});
+Object.defineProperty(exports, "createUnitClass", {
+  enumerable: true,
+  get: function get() {
+    return _Unit.createUnitClass;
+  }
+});
+Object.defineProperty(exports, "createUnitFunction", {
+  enumerable: true,
+  get: function get() {
+    return _unit.createUnitFunction;
+  }
+});
+Object.defineProperty(exports, "createUppercaseE", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createUppercaseE;
+  }
+});
+Object.defineProperty(exports, "createUppercasePi", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createUppercasePi;
+  }
+});
+Object.defineProperty(exports, "createUsolve", {
+  enumerable: true,
+  get: function get() {
+    return _usolve.createUsolve;
+  }
+});
+Object.defineProperty(exports, "createUsolveAll", {
+  enumerable: true,
+  get: function get() {
+    return _usolveAll.createUsolveAll;
+  }
+});
+Object.defineProperty(exports, "createVacuumImpedance", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createVacuumImpedance;
+  }
+});
+Object.defineProperty(exports, "createVariance", {
+  enumerable: true,
+  get: function get() {
+    return _variance.createVariance;
+  }
+});
+Object.defineProperty(exports, "createVarianceTransform", {
+  enumerable: true,
+  get: function get() {
+    return _varianceTransform.createVarianceTransform;
+  }
+});
+Object.defineProperty(exports, "createVersion", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createVersion;
+  }
+});
+Object.defineProperty(exports, "createWeakMixingAngle", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createWeakMixingAngle;
+  }
+});
+Object.defineProperty(exports, "createWienDisplacement", {
+  enumerable: true,
+  get: function get() {
+    return _physicalConstants.createWienDisplacement;
+  }
+});
+Object.defineProperty(exports, "createXgcd", {
+  enumerable: true,
+  get: function get() {
+    return _xgcd.createXgcd;
+  }
+});
+Object.defineProperty(exports, "createXor", {
+  enumerable: true,
+  get: function get() {
+    return _xor.createXor;
+  }
+});
+Object.defineProperty(exports, "createZeros", {
+  enumerable: true,
+  get: function get() {
+    return _zeros.createZeros;
+  }
+});
+
+var _typed = require("./core/function/typed.js");
+
+var _ResultSet = require("./type/resultset/ResultSet.js");
+
+var _BigNumber = require("./type/bignumber/BigNumber.js");
+
+var _Complex = require("./type/complex/Complex.js");
+
+var _Fraction = require("./type/fraction/Fraction.js");
+
+var _Range = require("./type/matrix/Range.js");
+
+var _Matrix = require("./type/matrix/Matrix.js");
+
+var _DenseMatrix = require("./type/matrix/DenseMatrix.js");
+
+var _clone = require("./function/utils/clone.js");
+
+var _isInteger = require("./function/utils/isInteger.js");
+
+var _isNegative = require("./function/utils/isNegative.js");
+
+var _isNumeric = require("./function/utils/isNumeric.js");
+
+var _hasNumericValue = require("./function/utils/hasNumericValue.js");
+
+var _isPositive = require("./function/utils/isPositive.js");
+
+var _isZero = require("./function/utils/isZero.js");
+
+var _isNaN = require("./function/utils/isNaN.js");
+
+var _typeOf = require("./function/utils/typeOf.js");
+
+var _equalScalar = require("./function/relational/equalScalar.js");
+
+var _SparseMatrix = require("./type/matrix/SparseMatrix.js");
+
+var _number = require("./type/number.js");
+
+var _string = require("./type/string.js");
+
+var _boolean = require("./type/boolean.js");
+
+var _bignumber = require("./type/bignumber/function/bignumber.js");
+
+var _complex = require("./type/complex/function/complex.js");
+
+var _fraction = require("./type/fraction/function/fraction.js");
+
+var _matrix = require("./type/matrix/function/matrix.js");
+
+var _matrixFromFunction = require("./function/matrix/matrixFromFunction.js");
+
+var _matrixFromRows = require("./function/matrix/matrixFromRows.js");
+
+var _matrixFromColumns = require("./function/matrix/matrixFromColumns.js");
+
+var _splitUnit = require("./type/unit/function/splitUnit.js");
+
+var _unaryMinus = require("./function/arithmetic/unaryMinus.js");
+
+var _unaryPlus = require("./function/arithmetic/unaryPlus.js");
+
+var _abs = require("./function/arithmetic/abs.js");
+
+var _apply = require("./function/matrix/apply.js");
+
+var _addScalar = require("./function/arithmetic/addScalar.js");
+
+var _cbrt = require("./function/arithmetic/cbrt.js");
+
+var _ceil = require("./function/arithmetic/ceil.js");
+
+var _cube = require("./function/arithmetic/cube.js");
+
+var _exp = require("./function/arithmetic/exp.js");
+
+var _expm = require("./function/arithmetic/expm1.js");
+
+var _fix = require("./function/arithmetic/fix.js");
+
+var _floor = require("./function/arithmetic/floor.js");
+
+var _gcd = require("./function/arithmetic/gcd.js");
+
+var _lcm = require("./function/arithmetic/lcm.js");
+
+var _log = require("./function/arithmetic/log10.js");
+
+var _log2 = require("./function/arithmetic/log2.js");
+
+var _mod = require("./function/arithmetic/mod.js");
+
+var _multiplyScalar = require("./function/arithmetic/multiplyScalar.js");
+
+var _multiply = require("./function/arithmetic/multiply.js");
+
+var _nthRoot = require("./function/arithmetic/nthRoot.js");
+
+var _sign = require("./function/arithmetic/sign.js");
+
+var _sqrt = require("./function/arithmetic/sqrt.js");
+
+var _square = require("./function/arithmetic/square.js");
+
+var _subtract = require("./function/arithmetic/subtract.js");
+
+var _xgcd = require("./function/arithmetic/xgcd.js");
+
+var _invmod = require("./function/arithmetic/invmod.js");
+
+var _dotMultiply = require("./function/arithmetic/dotMultiply.js");
+
+var _bitAnd = require("./function/bitwise/bitAnd.js");
+
+var _bitNot = require("./function/bitwise/bitNot.js");
+
+var _bitOr = require("./function/bitwise/bitOr.js");
+
+var _bitXor = require("./function/bitwise/bitXor.js");
+
+var _arg = require("./function/complex/arg.js");
+
+var _conj = require("./function/complex/conj.js");
+
+var _im = require("./function/complex/im.js");
+
+var _re = require("./function/complex/re.js");
+
+var _not = require("./function/logical/not.js");
+
+var _or = require("./function/logical/or.js");
+
+var _xor = require("./function/logical/xor.js");
+
+var _concat = require("./function/matrix/concat.js");
+
+var _column = require("./function/matrix/column.js");
+
+var _count = require("./function/matrix/count.js");
+
+var _cross = require("./function/matrix/cross.js");
+
+var _diag = require("./function/matrix/diag.js");
+
+var _filter = require("./function/matrix/filter.js");
+
+var _flatten = require("./function/matrix/flatten.js");
+
+var _forEach = require("./function/matrix/forEach.js");
+
+var _getMatrixDataType = require("./function/matrix/getMatrixDataType.js");
+
+var _identity = require("./function/matrix/identity.js");
+
+var _kron = require("./function/matrix/kron.js");
+
+var _map = require("./function/matrix/map.js");
+
+var _diff = require("./function/matrix/diff.js");
+
+var _ones = require("./function/matrix/ones.js");
+
+var _range = require("./function/matrix/range.js");
+
+var _reshape = require("./function/matrix/reshape.js");
+
+var _resize = require("./function/matrix/resize.js");
+
+var _rotate = require("./function/matrix/rotate.js");
+
+var _rotationMatrix = require("./function/matrix/rotationMatrix.js");
+
+var _row = require("./function/matrix/row.js");
+
+var _size = require("./function/matrix/size.js");
+
+var _squeeze = require("./function/matrix/squeeze.js");
+
+var _subset = require("./function/matrix/subset.js");
+
+var _transpose = require("./function/matrix/transpose.js");
+
+var _ctranspose = require("./function/matrix/ctranspose.js");
+
+var _zeros = require("./function/matrix/zeros.js");
+
+var _erf = require("./function/special/erf.js");
+
+var _mode = require("./function/statistics/mode.js");
+
+var _prod = require("./function/statistics/prod.js");
+
+var _format = require("./function/string/format.js");
+
+var _bin = require("./function/string/bin.js");
+
+var _oct = require("./function/string/oct.js");
+
+var _hex = require("./function/string/hex.js");
+
+var _print = require("./function/string/print.js");
+
+var _to = require("./function/unit/to.js");
+
+var _isPrime = require("./function/utils/isPrime.js");
+
+var _numeric = require("./function/utils/numeric.js");
+
+var _divideScalar = require("./function/arithmetic/divideScalar.js");
+
+var _pow = require("./function/arithmetic/pow.js");
+
+var _round = require("./function/arithmetic/round.js");
+
+var _log3 = require("./function/arithmetic/log.js");
+
+var _log1p = require("./function/arithmetic/log1p.js");
+
+var _nthRoots = require("./function/arithmetic/nthRoots.js");
+
+var _dotPow = require("./function/arithmetic/dotPow.js");
+
+var _dotDivide = require("./function/arithmetic/dotDivide.js");
+
+var _lsolve = require("./function/algebra/solver/lsolve.js");
+
+var _usolve = require("./function/algebra/solver/usolve.js");
+
+var _lsolveAll = require("./function/algebra/solver/lsolveAll.js");
+
+var _usolveAll = require("./function/algebra/solver/usolveAll.js");
+
+var _leftShift = require("./function/bitwise/leftShift.js");
+
+var _rightArithShift = require("./function/bitwise/rightArithShift.js");
+
+var _rightLogShift = require("./function/bitwise/rightLogShift.js");
+
+var _and = require("./function/logical/and.js");
+
+var _compare = require("./function/relational/compare.js");
+
+var _compareNatural = require("./function/relational/compareNatural.js");
+
+var _compareText = require("./function/relational/compareText.js");
+
+var _equal = require("./function/relational/equal.js");
+
+var _equalText = require("./function/relational/equalText.js");
+
+var _smaller = require("./function/relational/smaller.js");
+
+var _smallerEq = require("./function/relational/smallerEq.js");
+
+var _larger = require("./function/relational/larger.js");
+
+var _largerEq = require("./function/relational/largerEq.js");
+
+var _deepEqual = require("./function/relational/deepEqual.js");
+
+var _unequal = require("./function/relational/unequal.js");
+
+var _partitionSelect = require("./function/matrix/partitionSelect.js");
+
+var _sort = require("./function/matrix/sort.js");
+
+var _max = require("./function/statistics/max.js");
+
+var _min = require("./function/statistics/min.js");
+
+var _ImmutableDenseMatrix = require("./type/matrix/ImmutableDenseMatrix.js");
+
+var _MatrixIndex = require("./type/matrix/MatrixIndex.js");
+
+var _FibonacciHeap = require("./type/matrix/FibonacciHeap.js");
+
+var _Spa = require("./type/matrix/Spa.js");
+
+var _Unit = require("./type/unit/Unit.js");
+
+var _unit = require("./type/unit/function/unit.js");
+
+var _sparse = require("./type/matrix/function/sparse.js");
+
+var _createUnit = require("./type/unit/function/createUnit.js");
+
+var _acos = require("./function/trigonometry/acos.js");
+
+var _acosh = require("./function/trigonometry/acosh.js");
+
+var _acot = require("./function/trigonometry/acot.js");
+
+var _acoth = require("./function/trigonometry/acoth.js");
+
+var _acsc = require("./function/trigonometry/acsc.js");
+
+var _acsch = require("./function/trigonometry/acsch.js");
+
+var _asec = require("./function/trigonometry/asec.js");
+
+var _asech = require("./function/trigonometry/asech.js");
+
+var _asin = require("./function/trigonometry/asin.js");
+
+var _asinh = require("./function/trigonometry/asinh.js");
+
+var _atan = require("./function/trigonometry/atan.js");
+
+var _atan2 = require("./function/trigonometry/atan2.js");
+
+var _atanh = require("./function/trigonometry/atanh.js");
+
+var _cos = require("./function/trigonometry/cos.js");
+
+var _cosh = require("./function/trigonometry/cosh.js");
+
+var _cot = require("./function/trigonometry/cot.js");
+
+var _coth = require("./function/trigonometry/coth.js");
+
+var _csc = require("./function/trigonometry/csc.js");
+
+var _csch = require("./function/trigonometry/csch.js");
+
+var _sec = require("./function/trigonometry/sec.js");
+
+var _sech = require("./function/trigonometry/sech.js");
+
+var _sin = require("./function/trigonometry/sin.js");
+
+var _sinh = require("./function/trigonometry/sinh.js");
+
+var _tan = require("./function/trigonometry/tan.js");
+
+var _tanh = require("./function/trigonometry/tanh.js");
+
+var _setCartesian = require("./function/set/setCartesian.js");
+
+var _setDifference = require("./function/set/setDifference.js");
+
+var _setDistinct = require("./function/set/setDistinct.js");
+
+var _setIntersect = require("./function/set/setIntersect.js");
+
+var _setIsSubset = require("./function/set/setIsSubset.js");
+
+var _setMultiplicity = require("./function/set/setMultiplicity.js");
+
+var _setPowerset = require("./function/set/setPowerset.js");
+
+var _setSize = require("./function/set/setSize.js");
+
+var _setSymDifference = require("./function/set/setSymDifference.js");
+
+var _setUnion = require("./function/set/setUnion.js");
+
+var _add = require("./function/arithmetic/add.js");
+
+var _hypot = require("./function/arithmetic/hypot.js");
+
+var _norm = require("./function/arithmetic/norm.js");
+
+var _dot = require("./function/matrix/dot.js");
+
+var _trace = require("./function/matrix/trace.js");
+
+var _index = require("./type/matrix/function/index.js");
+
+var _Node = require("./expression/node/Node.js");
+
+var _AccessorNode = require("./expression/node/AccessorNode.js");
+
+var _ArrayNode = require("./expression/node/ArrayNode.js");
+
+var _AssignmentNode = require("./expression/node/AssignmentNode.js");
+
+var _BlockNode = require("./expression/node/BlockNode.js");
+
+var _ConditionalNode = require("./expression/node/ConditionalNode.js");
+
+var _ConstantNode = require("./expression/node/ConstantNode.js");
+
+var _FunctionAssignmentNode = require("./expression/node/FunctionAssignmentNode.js");
+
+var _IndexNode = require("./expression/node/IndexNode.js");
+
+var _ObjectNode = require("./expression/node/ObjectNode.js");
+
+var _OperatorNode = require("./expression/node/OperatorNode.js");
+
+var _ParenthesisNode = require("./expression/node/ParenthesisNode.js");
+
+var _RangeNode = require("./expression/node/RangeNode.js");
+
+var _RelationalNode = require("./expression/node/RelationalNode.js");
+
+var _SymbolNode = require("./expression/node/SymbolNode.js");
+
+var _FunctionNode = require("./expression/node/FunctionNode.js");
+
+var _parse = require("./expression/parse.js");
+
+var _compile = require("./expression/function/compile.js");
+
+var _evaluate = require("./expression/function/evaluate.js");
+
+var _Parser = require("./expression/Parser.js");
+
+var _parser = require("./expression/function/parser.js");
+
+var _lup = require("./function/algebra/decomposition/lup.js");
+
+var _qr = require("./function/algebra/decomposition/qr.js");
+
+var _slu = require("./function/algebra/decomposition/slu.js");
+
+var _lusolve = require("./function/algebra/solver/lusolve.js");
+
+var _Help = require("./expression/Help.js");
+
+var _Chain = require("./type/chain/Chain.js");
+
+var _help = require("./expression/function/help.js");
+
+var _chain = require("./type/chain/function/chain.js");
+
+var _det = require("./function/matrix/det.js");
+
+var _inv = require("./function/matrix/inv.js");
+
+var _eigs = require("./function/matrix/eigs.js");
+
+var _expm2 = require("./function/matrix/expm.js");
+
+var _sqrtm = require("./function/matrix/sqrtm.js");
+
+var _divide = require("./function/arithmetic/divide.js");
+
+var _distance = require("./function/geometry/distance.js");
+
+var _intersect = require("./function/geometry/intersect.js");
+
+var _sum = require("./function/statistics/sum.js");
+
+var _cumsum = require("./function/statistics/cumsum.js");
+
+var _mean = require("./function/statistics/mean.js");
+
+var _median = require("./function/statistics/median.js");
+
+var _mad = require("./function/statistics/mad.js");
+
+var _variance = require("./function/statistics/variance.js");
+
+var _quantileSeq = require("./function/statistics/quantileSeq.js");
+
+var _std = require("./function/statistics/std.js");
+
+var _combinations = require("./function/probability/combinations.js");
+
+var _combinationsWithRep = require("./function/probability/combinationsWithRep.js");
+
+var _gamma = require("./function/probability/gamma.js");
+
+var _factorial = require("./function/probability/factorial.js");
+
+var _kldivergence = require("./function/probability/kldivergence.js");
+
+var _multinomial = require("./function/probability/multinomial.js");
+
+var _permutations = require("./function/probability/permutations.js");
+
+var _pickRandom = require("./function/probability/pickRandom.js");
+
+var _random = require("./function/probability/random.js");
+
+var _randomInt = require("./function/probability/randomInt.js");
+
+var _stirlingS = require("./function/combinatorics/stirlingS2.js");
+
+var _bellNumbers = require("./function/combinatorics/bellNumbers.js");
+
+var _catalan = require("./function/combinatorics/catalan.js");
+
+var _composition = require("./function/combinatorics/composition.js");
+
+var _leafCount = require("./function/algebra/leafCount.js");
+
+var _simplify = require("./function/algebra/simplify.js");
+
+var _simplifyCore = require("./function/algebra/simplifyCore.js");
+
+var _resolve = require("./function/algebra/resolve.js");
+
+var _symbolicEqual = require("./function/algebra/symbolicEqual.js");
+
+var _derivative = require("./function/algebra/derivative.js");
+
+var _rationalize = require("./function/algebra/rationalize.js");
+
+var _reviver = require("./json/reviver.js");
+
+var _replacer = require("./json/replacer.js");
+
+var _constants = require("./constants.js");
+
+var _physicalConstants = require("./type/unit/physicalConstants.js");
+
+var _applyTransform = require("./expression/transform/apply.transform.js");
+
+var _columnTransform = require("./expression/transform/column.transform.js");
+
+var _filterTransform = require("./expression/transform/filter.transform.js");
+
+var _forEachTransform = require("./expression/transform/forEach.transform.js");
+
+var _indexTransform = require("./expression/transform/index.transform.js");
+
+var _mapTransform = require("./expression/transform/map.transform.js");
+
+var _maxTransform = require("./expression/transform/max.transform.js");
+
+var _meanTransform = require("./expression/transform/mean.transform.js");
+
+var _minTransform = require("./expression/transform/min.transform.js");
+
+var _rangeTransform = require("./expression/transform/range.transform.js");
+
+var _rowTransform = require("./expression/transform/row.transform.js");
+
+var _subsetTransform = require("./expression/transform/subset.transform.js");
+
+var _concatTransform = require("./expression/transform/concat.transform.js");
+
+var _diffTransform = require("./expression/transform/diff.transform.js");
+
+var _stdTransform = require("./expression/transform/std.transform.js");
+
+var _sumTransform = require("./expression/transform/sum.transform.js");
+
+var _cumsumTransform = require("./expression/transform/cumsum.transform.js");
+
+var _varianceTransform = require("./expression/transform/variance.transform.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/factoriesNumber.js b/node_modules/mathjs/lib/cjs/factoriesNumber.js
new file mode 100644
index 0000000..3b813b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/factoriesNumber.js
@@ -0,0 +1,1185 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAbs = void 0;
+Object.defineProperty(exports, "createAccessorNode", {
+  enumerable: true,
+  get: function get() {
+    return _AccessorNode.createAccessorNode;
+  }
+});
+exports.createAnd = exports.createAddScalar = exports.createAdd = exports.createAcsch = exports.createAcsc = exports.createAcoth = exports.createAcot = exports.createAcosh = exports.createAcos = void 0;
+Object.defineProperty(exports, "createApply", {
+  enumerable: true,
+  get: function get() {
+    return _apply.createApply;
+  }
+});
+Object.defineProperty(exports, "createApplyTransform", {
+  enumerable: true,
+  get: function get() {
+    return _applyTransform.createApplyTransform;
+  }
+});
+Object.defineProperty(exports, "createArrayNode", {
+  enumerable: true,
+  get: function get() {
+    return _ArrayNode.createArrayNode;
+  }
+});
+exports.createAsinh = exports.createAsin = exports.createAsech = exports.createAsec = void 0;
+Object.defineProperty(exports, "createAssignmentNode", {
+  enumerable: true,
+  get: function get() {
+    return _AssignmentNode.createAssignmentNode;
+  }
+});
+exports.createAtanh = exports.createAtan2 = exports.createAtan = void 0;
+Object.defineProperty(exports, "createBellNumbers", {
+  enumerable: true,
+  get: function get() {
+    return _bellNumbers.createBellNumbers;
+  }
+});
+exports.createBitXor = exports.createBitOr = exports.createBitNot = exports.createBitAnd = void 0;
+Object.defineProperty(exports, "createBlockNode", {
+  enumerable: true,
+  get: function get() {
+    return _BlockNode.createBlockNode;
+  }
+});
+Object.defineProperty(exports, "createBoolean", {
+  enumerable: true,
+  get: function get() {
+    return _boolean.createBoolean;
+  }
+});
+Object.defineProperty(exports, "createCatalan", {
+  enumerable: true,
+  get: function get() {
+    return _catalan.createCatalan;
+  }
+});
+exports.createCeil = exports.createCbrt = void 0;
+Object.defineProperty(exports, "createChain", {
+  enumerable: true,
+  get: function get() {
+    return _chain.createChain;
+  }
+});
+Object.defineProperty(exports, "createChainClass", {
+  enumerable: true,
+  get: function get() {
+    return _Chain.createChainClass;
+  }
+});
+Object.defineProperty(exports, "createClone", {
+  enumerable: true,
+  get: function get() {
+    return _clone.createClone;
+  }
+});
+exports.createCombinations = void 0;
+Object.defineProperty(exports, "createCombinationsWithRep", {
+  enumerable: true,
+  get: function get() {
+    return _combinationsWithRep.createCombinationsWithRep;
+  }
+});
+Object.defineProperty(exports, "createCompare", {
+  enumerable: true,
+  get: function get() {
+    return _compare.createCompareNumber;
+  }
+});
+Object.defineProperty(exports, "createCompareNatural", {
+  enumerable: true,
+  get: function get() {
+    return _compareNatural.createCompareNatural;
+  }
+});
+Object.defineProperty(exports, "createCompareText", {
+  enumerable: true,
+  get: function get() {
+    return _compareText.createCompareTextNumber;
+  }
+});
+Object.defineProperty(exports, "createCompile", {
+  enumerable: true,
+  get: function get() {
+    return _compile.createCompile;
+  }
+});
+Object.defineProperty(exports, "createComposition", {
+  enumerable: true,
+  get: function get() {
+    return _composition.createComposition;
+  }
+});
+Object.defineProperty(exports, "createConditionalNode", {
+  enumerable: true,
+  get: function get() {
+    return _ConditionalNode.createConditionalNode;
+  }
+});
+Object.defineProperty(exports, "createConstantNode", {
+  enumerable: true,
+  get: function get() {
+    return _ConstantNode.createConstantNode;
+  }
+});
+exports.createCube = exports.createCsch = exports.createCsc = exports.createCoth = exports.createCot = exports.createCosh = exports.createCos = void 0;
+Object.defineProperty(exports, "createCumSum", {
+  enumerable: true,
+  get: function get() {
+    return _cumsum.createCumSum;
+  }
+});
+Object.defineProperty(exports, "createCumSumTransform", {
+  enumerable: true,
+  get: function get() {
+    return _cumsumTransform.createCumSumTransform;
+  }
+});
+Object.defineProperty(exports, "createDeepEqual", {
+  enumerable: true,
+  get: function get() {
+    return _deepEqual.createDeepEqual;
+  }
+});
+Object.defineProperty(exports, "createDerivative", {
+  enumerable: true,
+  get: function get() {
+    return _derivative.createDerivative;
+  }
+});
+exports.createDivideScalar = exports.createDivide = void 0;
+Object.defineProperty(exports, "createE", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createE;
+  }
+});
+Object.defineProperty(exports, "createEqual", {
+  enumerable: true,
+  get: function get() {
+    return _equal.createEqualNumber;
+  }
+});
+Object.defineProperty(exports, "createEqualScalar", {
+  enumerable: true,
+  get: function get() {
+    return _equalScalar.createEqualScalarNumber;
+  }
+});
+Object.defineProperty(exports, "createEqualText", {
+  enumerable: true,
+  get: function get() {
+    return _equalText.createEqualText;
+  }
+});
+Object.defineProperty(exports, "createErf", {
+  enumerable: true,
+  get: function get() {
+    return _erf.createErf;
+  }
+});
+Object.defineProperty(exports, "createEvaluate", {
+  enumerable: true,
+  get: function get() {
+    return _evaluate.createEvaluate;
+  }
+});
+exports.createExpm1 = exports.createExp = void 0;
+Object.defineProperty(exports, "createFactorial", {
+  enumerable: true,
+  get: function get() {
+    return _factorial.createFactorial;
+  }
+});
+Object.defineProperty(exports, "createFalse", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createFalse;
+  }
+});
+Object.defineProperty(exports, "createFilter", {
+  enumerable: true,
+  get: function get() {
+    return _filter.createFilter;
+  }
+});
+Object.defineProperty(exports, "createFilterTransform", {
+  enumerable: true,
+  get: function get() {
+    return _filterTransform.createFilterTransform;
+  }
+});
+exports.createFloor = exports.createFix = void 0;
+Object.defineProperty(exports, "createForEach", {
+  enumerable: true,
+  get: function get() {
+    return _forEach.createForEach;
+  }
+});
+Object.defineProperty(exports, "createForEachTransform", {
+  enumerable: true,
+  get: function get() {
+    return _forEachTransform.createForEachTransform;
+  }
+});
+Object.defineProperty(exports, "createFormat", {
+  enumerable: true,
+  get: function get() {
+    return _format.createFormat;
+  }
+});
+Object.defineProperty(exports, "createFunctionAssignmentNode", {
+  enumerable: true,
+  get: function get() {
+    return _FunctionAssignmentNode.createFunctionAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "createFunctionNode", {
+  enumerable: true,
+  get: function get() {
+    return _FunctionNode.createFunctionNode;
+  }
+});
+exports.createGcd = exports.createGamma = void 0;
+Object.defineProperty(exports, "createHasNumericValue", {
+  enumerable: true,
+  get: function get() {
+    return _hasNumericValue.createHasNumericValue;
+  }
+});
+Object.defineProperty(exports, "createHelp", {
+  enumerable: true,
+  get: function get() {
+    return _help.createHelp;
+  }
+});
+Object.defineProperty(exports, "createHelpClass", {
+  enumerable: true,
+  get: function get() {
+    return _Help.createHelpClass;
+  }
+});
+Object.defineProperty(exports, "createHypot", {
+  enumerable: true,
+  get: function get() {
+    return _hypot.createHypot;
+  }
+});
+exports.createIndex = void 0;
+Object.defineProperty(exports, "createIndexNode", {
+  enumerable: true,
+  get: function get() {
+    return _IndexNode.createIndexNode;
+  }
+});
+Object.defineProperty(exports, "createInfinity", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createInfinity;
+  }
+});
+exports.createIsNegative = exports.createIsNaN = exports.createIsInteger = void 0;
+Object.defineProperty(exports, "createIsNumeric", {
+  enumerable: true,
+  get: function get() {
+    return _isNumeric.createIsNumeric;
+  }
+});
+exports.createIsPositive = void 0;
+Object.defineProperty(exports, "createIsPrime", {
+  enumerable: true,
+  get: function get() {
+    return _isPrime.createIsPrime;
+  }
+});
+exports.createIsZero = void 0;
+Object.defineProperty(exports, "createLN10", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLN10;
+  }
+});
+Object.defineProperty(exports, "createLN2", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLN2;
+  }
+});
+Object.defineProperty(exports, "createLOG10E", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLOG10E;
+  }
+});
+Object.defineProperty(exports, "createLOG2E", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createLOG2E;
+  }
+});
+Object.defineProperty(exports, "createLarger", {
+  enumerable: true,
+  get: function get() {
+    return _larger.createLargerNumber;
+  }
+});
+Object.defineProperty(exports, "createLargerEq", {
+  enumerable: true,
+  get: function get() {
+    return _largerEq.createLargerEqNumber;
+  }
+});
+exports.createLeftShift = exports.createLcm = void 0;
+exports.createLog2 = exports.createLog1p = exports.createLog10 = exports.createLog = void 0;
+Object.defineProperty(exports, "createMad", {
+  enumerable: true,
+  get: function get() {
+    return _mad.createMad;
+  }
+});
+Object.defineProperty(exports, "createMap", {
+  enumerable: true,
+  get: function get() {
+    return _map.createMap;
+  }
+});
+Object.defineProperty(exports, "createMapTransform", {
+  enumerable: true,
+  get: function get() {
+    return _mapTransform.createMapTransform;
+  }
+});
+exports.createMatrix = void 0;
+Object.defineProperty(exports, "createMax", {
+  enumerable: true,
+  get: function get() {
+    return _max.createMax;
+  }
+});
+Object.defineProperty(exports, "createMaxTransform", {
+  enumerable: true,
+  get: function get() {
+    return _maxTransform.createMaxTransform;
+  }
+});
+Object.defineProperty(exports, "createMean", {
+  enumerable: true,
+  get: function get() {
+    return _mean.createMean;
+  }
+});
+Object.defineProperty(exports, "createMeanTransform", {
+  enumerable: true,
+  get: function get() {
+    return _meanTransform.createMeanTransform;
+  }
+});
+Object.defineProperty(exports, "createMedian", {
+  enumerable: true,
+  get: function get() {
+    return _median.createMedian;
+  }
+});
+Object.defineProperty(exports, "createMin", {
+  enumerable: true,
+  get: function get() {
+    return _min.createMin;
+  }
+});
+Object.defineProperty(exports, "createMinTransform", {
+  enumerable: true,
+  get: function get() {
+    return _minTransform.createMinTransform;
+  }
+});
+exports.createMod = void 0;
+Object.defineProperty(exports, "createMode", {
+  enumerable: true,
+  get: function get() {
+    return _mode.createMode;
+  }
+});
+Object.defineProperty(exports, "createMultinomial", {
+  enumerable: true,
+  get: function get() {
+    return _multinomial.createMultinomial;
+  }
+});
+exports.createMultiplyScalar = exports.createMultiply = void 0;
+Object.defineProperty(exports, "createNaN", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createNaN;
+  }
+});
+Object.defineProperty(exports, "createNode", {
+  enumerable: true,
+  get: function get() {
+    return _Node.createNode;
+  }
+});
+exports.createNot = exports.createNorm = void 0;
+Object.defineProperty(exports, "createNthRoot", {
+  enumerable: true,
+  get: function get() {
+    return _nthRoot.createNthRootNumber;
+  }
+});
+Object.defineProperty(exports, "createNull", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createNull;
+  }
+});
+Object.defineProperty(exports, "createNumber", {
+  enumerable: true,
+  get: function get() {
+    return _number.createNumber;
+  }
+});
+Object.defineProperty(exports, "createNumeric", {
+  enumerable: true,
+  get: function get() {
+    return _numeric.createNumeric;
+  }
+});
+Object.defineProperty(exports, "createObjectNode", {
+  enumerable: true,
+  get: function get() {
+    return _ObjectNode.createObjectNode;
+  }
+});
+Object.defineProperty(exports, "createOperatorNode", {
+  enumerable: true,
+  get: function get() {
+    return _OperatorNode.createOperatorNode;
+  }
+});
+exports.createOr = void 0;
+Object.defineProperty(exports, "createParenthesisNode", {
+  enumerable: true,
+  get: function get() {
+    return _ParenthesisNode.createParenthesisNode;
+  }
+});
+Object.defineProperty(exports, "createParse", {
+  enumerable: true,
+  get: function get() {
+    return _parse.createParse;
+  }
+});
+Object.defineProperty(exports, "createParser", {
+  enumerable: true,
+  get: function get() {
+    return _parser.createParser;
+  }
+});
+Object.defineProperty(exports, "createParserClass", {
+  enumerable: true,
+  get: function get() {
+    return _Parser.createParserClass;
+  }
+});
+Object.defineProperty(exports, "createPartitionSelect", {
+  enumerable: true,
+  get: function get() {
+    return _partitionSelect.createPartitionSelect;
+  }
+});
+Object.defineProperty(exports, "createPermutations", {
+  enumerable: true,
+  get: function get() {
+    return _permutations.createPermutations;
+  }
+});
+Object.defineProperty(exports, "createPhi", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createPhi;
+  }
+});
+Object.defineProperty(exports, "createPi", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createPi;
+  }
+});
+Object.defineProperty(exports, "createPickRandom", {
+  enumerable: true,
+  get: function get() {
+    return _pickRandom.createPickRandom;
+  }
+});
+exports.createPow = void 0;
+Object.defineProperty(exports, "createPrint", {
+  enumerable: true,
+  get: function get() {
+    return _print.createPrint;
+  }
+});
+Object.defineProperty(exports, "createProd", {
+  enumerable: true,
+  get: function get() {
+    return _prod.createProd;
+  }
+});
+Object.defineProperty(exports, "createQuantileSeq", {
+  enumerable: true,
+  get: function get() {
+    return _quantileSeq.createQuantileSeq;
+  }
+});
+Object.defineProperty(exports, "createRandom", {
+  enumerable: true,
+  get: function get() {
+    return _random.createRandomNumber;
+  }
+});
+Object.defineProperty(exports, "createRandomInt", {
+  enumerable: true,
+  get: function get() {
+    return _randomInt.createRandomInt;
+  }
+});
+Object.defineProperty(exports, "createRange", {
+  enumerable: true,
+  get: function get() {
+    return _range.createRange;
+  }
+});
+Object.defineProperty(exports, "createRangeClass", {
+  enumerable: true,
+  get: function get() {
+    return _Range.createRangeClass;
+  }
+});
+Object.defineProperty(exports, "createRangeNode", {
+  enumerable: true,
+  get: function get() {
+    return _RangeNode.createRangeNode;
+  }
+});
+Object.defineProperty(exports, "createRangeTransform", {
+  enumerable: true,
+  get: function get() {
+    return _rangeTransform.createRangeTransform;
+  }
+});
+Object.defineProperty(exports, "createRationalize", {
+  enumerable: true,
+  get: function get() {
+    return _rationalize.createRationalize;
+  }
+});
+Object.defineProperty(exports, "createRelationalNode", {
+  enumerable: true,
+  get: function get() {
+    return _RelationalNode.createRelationalNode;
+  }
+});
+Object.defineProperty(exports, "createReplacer", {
+  enumerable: true,
+  get: function get() {
+    return _replacer.createReplacer;
+  }
+});
+Object.defineProperty(exports, "createResolve", {
+  enumerable: true,
+  get: function get() {
+    return _resolve.createResolve;
+  }
+});
+Object.defineProperty(exports, "createResultSet", {
+  enumerable: true,
+  get: function get() {
+    return _ResultSet.createResultSet;
+  }
+});
+Object.defineProperty(exports, "createReviver", {
+  enumerable: true,
+  get: function get() {
+    return _reviver.createReviver;
+  }
+});
+exports.createRightLogShift = exports.createRightArithShift = void 0;
+Object.defineProperty(exports, "createRound", {
+  enumerable: true,
+  get: function get() {
+    return _round.createRoundNumber;
+  }
+});
+Object.defineProperty(exports, "createSQRT1_2", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createSQRT1_2;
+  }
+});
+Object.defineProperty(exports, "createSQRT2", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createSQRT2;
+  }
+});
+exports.createSign = exports.createSech = exports.createSec = void 0;
+Object.defineProperty(exports, "createSimplify", {
+  enumerable: true,
+  get: function get() {
+    return _simplify.createSimplify;
+  }
+});
+Object.defineProperty(exports, "createSimplifyCore", {
+  enumerable: true,
+  get: function get() {
+    return _simplifyCore.createSimplifyCore;
+  }
+});
+exports.createSinh = exports.createSin = void 0;
+Object.defineProperty(exports, "createSize", {
+  enumerable: true,
+  get: function get() {
+    return _size.createSize;
+  }
+});
+Object.defineProperty(exports, "createSmaller", {
+  enumerable: true,
+  get: function get() {
+    return _smaller.createSmallerNumber;
+  }
+});
+Object.defineProperty(exports, "createSmallerEq", {
+  enumerable: true,
+  get: function get() {
+    return _smallerEq.createSmallerEqNumber;
+  }
+});
+exports.createSquare = exports.createSqrt = void 0;
+Object.defineProperty(exports, "createStd", {
+  enumerable: true,
+  get: function get() {
+    return _std.createStd;
+  }
+});
+Object.defineProperty(exports, "createStdTransform", {
+  enumerable: true,
+  get: function get() {
+    return _stdTransform.createStdTransform;
+  }
+});
+Object.defineProperty(exports, "createStirlingS2", {
+  enumerable: true,
+  get: function get() {
+    return _stirlingS.createStirlingS2;
+  }
+});
+Object.defineProperty(exports, "createString", {
+  enumerable: true,
+  get: function get() {
+    return _string.createString;
+  }
+});
+exports.createSubtract = exports.createSubsetTransform = exports.createSubset = void 0;
+Object.defineProperty(exports, "createSum", {
+  enumerable: true,
+  get: function get() {
+    return _sum.createSum;
+  }
+});
+Object.defineProperty(exports, "createSumTransform", {
+  enumerable: true,
+  get: function get() {
+    return _sumTransform.createSumTransform;
+  }
+});
+Object.defineProperty(exports, "createSymbolNode", {
+  enumerable: true,
+  get: function get() {
+    return _SymbolNode.createSymbolNode;
+  }
+});
+exports.createTanh = exports.createTan = void 0;
+Object.defineProperty(exports, "createTau", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createTau;
+  }
+});
+Object.defineProperty(exports, "createTrue", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createTrue;
+  }
+});
+Object.defineProperty(exports, "createTypeOf", {
+  enumerable: true,
+  get: function get() {
+    return _typeOf.createTypeOf;
+  }
+});
+Object.defineProperty(exports, "createTyped", {
+  enumerable: true,
+  get: function get() {
+    return _typed.createTyped;
+  }
+});
+exports.createUnaryPlus = exports.createUnaryMinus = void 0;
+Object.defineProperty(exports, "createUnequal", {
+  enumerable: true,
+  get: function get() {
+    return _unequal.createUnequalNumber;
+  }
+});
+Object.defineProperty(exports, "createUppercaseE", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createUppercaseE;
+  }
+});
+Object.defineProperty(exports, "createUppercasePi", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createUppercasePi;
+  }
+});
+Object.defineProperty(exports, "createVariance", {
+  enumerable: true,
+  get: function get() {
+    return _variance.createVariance;
+  }
+});
+Object.defineProperty(exports, "createVarianceTransform", {
+  enumerable: true,
+  get: function get() {
+    return _varianceTransform.createVarianceTransform;
+  }
+});
+Object.defineProperty(exports, "createVersion", {
+  enumerable: true,
+  get: function get() {
+    return _constants.createVersion;
+  }
+});
+exports.createXor = exports.createXgcd = void 0;
+
+var _index = require("./plain/number/index.js");
+
+var _factory = require("./utils/factory.js");
+
+var _noop = require("./utils/noop.js");
+
+var _typed = require("./core/function/typed.js");
+
+var _ResultSet = require("./type/resultset/ResultSet.js");
+
+var _Range = require("./type/matrix/Range.js");
+
+var _Help = require("./expression/Help.js");
+
+var _Chain = require("./type/chain/Chain.js");
+
+var _help = require("./expression/function/help.js");
+
+var _chain = require("./type/chain/function/chain.js");
+
+var _resolve = require("./function/algebra/resolve.js");
+
+var _simplify = require("./function/algebra/simplify.js");
+
+var _simplifyCore = require("./function/algebra/simplifyCore.js");
+
+var _derivative = require("./function/algebra/derivative.js");
+
+var _rationalize = require("./function/algebra/rationalize.js");
+
+var _nthRoot = require("./function/arithmetic/nthRoot.js");
+
+var _round = require("./function/arithmetic/round.js");
+
+var _hypot = require("./function/arithmetic/hypot.js");
+
+var _stirlingS = require("./function/combinatorics/stirlingS2.js");
+
+var _bellNumbers = require("./function/combinatorics/bellNumbers.js");
+
+var _catalan = require("./function/combinatorics/catalan.js");
+
+var _composition = require("./function/combinatorics/composition.js");
+
+var _constants = require("./constants.js");
+
+var _number = require("./type/number.js");
+
+var _string = require("./type/string.js");
+
+var _boolean = require("./type/boolean.js");
+
+var _parser = require("./expression/function/parser.js");
+
+var _Node = require("./expression/node/Node.js");
+
+var _AccessorNode = require("./expression/node/AccessorNode.js");
+
+var _ArrayNode = require("./expression/node/ArrayNode.js");
+
+var _AssignmentNode = require("./expression/node/AssignmentNode.js");
+
+var _BlockNode = require("./expression/node/BlockNode.js");
+
+var _ConditionalNode = require("./expression/node/ConditionalNode.js");
+
+var _ConstantNode = require("./expression/node/ConstantNode.js");
+
+var _FunctionAssignmentNode = require("./expression/node/FunctionAssignmentNode.js");
+
+var _IndexNode = require("./expression/node/IndexNode.js");
+
+var _ObjectNode = require("./expression/node/ObjectNode.js");
+
+var _OperatorNode = require("./expression/node/OperatorNode.js");
+
+var _ParenthesisNode = require("./expression/node/ParenthesisNode.js");
+
+var _RangeNode = require("./expression/node/RangeNode.js");
+
+var _RelationalNode = require("./expression/node/RelationalNode.js");
+
+var _SymbolNode = require("./expression/node/SymbolNode.js");
+
+var _FunctionNode = require("./expression/node/FunctionNode.js");
+
+var _parse = require("./expression/parse.js");
+
+var _compile = require("./expression/function/compile.js");
+
+var _evaluate = require("./expression/function/evaluate.js");
+
+var _Parser = require("./expression/Parser.js");
+
+var _apply = require("./function/matrix/apply.js");
+
+var _filter = require("./function/matrix/filter.js");
+
+var _forEach = require("./function/matrix/forEach.js");
+
+var _map = require("./function/matrix/map.js");
+
+var _range = require("./function/matrix/range.js");
+
+var _size = require("./function/matrix/size.js");
+
+var _partitionSelect = require("./function/matrix/partitionSelect.js");
+
+var _combinationsWithRep = require("./function/probability/combinationsWithRep.js");
+
+var _factorial = require("./function/probability/factorial.js");
+
+var _multinomial = require("./function/probability/multinomial.js");
+
+var _permutations = require("./function/probability/permutations.js");
+
+var _pickRandom = require("./function/probability/pickRandom.js");
+
+var _random = require("./function/probability/random.js");
+
+var _randomInt = require("./function/probability/randomInt.js");
+
+var _equalScalar = require("./function/relational/equalScalar.js");
+
+var _compare = require("./function/relational/compare.js");
+
+var _compareNatural = require("./function/relational/compareNatural.js");
+
+var _compareText = require("./function/relational/compareText.js");
+
+var _equal = require("./function/relational/equal.js");
+
+var _equalText = require("./function/relational/equalText.js");
+
+var _smaller = require("./function/relational/smaller.js");
+
+var _smallerEq = require("./function/relational/smallerEq.js");
+
+var _larger = require("./function/relational/larger.js");
+
+var _largerEq = require("./function/relational/largerEq.js");
+
+var _deepEqual = require("./function/relational/deepEqual.js");
+
+var _unequal = require("./function/relational/unequal.js");
+
+var _erf = require("./function/special/erf.js");
+
+var _mode = require("./function/statistics/mode.js");
+
+var _prod = require("./function/statistics/prod.js");
+
+var _max = require("./function/statistics/max.js");
+
+var _min = require("./function/statistics/min.js");
+
+var _sum = require("./function/statistics/sum.js");
+
+var _cumsum = require("./function/statistics/cumsum.js");
+
+var _mean = require("./function/statistics/mean.js");
+
+var _median = require("./function/statistics/median.js");
+
+var _mad = require("./function/statistics/mad.js");
+
+var _variance = require("./function/statistics/variance.js");
+
+var _quantileSeq = require("./function/statistics/quantileSeq.js");
+
+var _std = require("./function/statistics/std.js");
+
+var _format = require("./function/string/format.js");
+
+var _print = require("./function/string/print.js");
+
+var _applyTransform = require("./expression/transform/apply.transform.js");
+
+var _filterTransform = require("./expression/transform/filter.transform.js");
+
+var _forEachTransform = require("./expression/transform/forEach.transform.js");
+
+var _mapTransform = require("./expression/transform/map.transform.js");
+
+var _maxTransform = require("./expression/transform/max.transform.js");
+
+var _meanTransform = require("./expression/transform/mean.transform.js");
+
+var _minTransform = require("./expression/transform/min.transform.js");
+
+var _rangeTransform = require("./expression/transform/range.transform.js");
+
+var _stdTransform = require("./expression/transform/std.transform.js");
+
+var _sumTransform = require("./expression/transform/sum.transform.js");
+
+var _cumsumTransform = require("./expression/transform/cumsum.transform.js");
+
+var _varianceTransform = require("./expression/transform/variance.transform.js");
+
+var _clone = require("./function/utils/clone.js");
+
+var _isNumeric = require("./function/utils/isNumeric.js");
+
+var _hasNumericValue = require("./function/utils/hasNumericValue.js");
+
+var _typeOf = require("./function/utils/typeOf.js");
+
+var _isPrime = require("./function/utils/isPrime.js");
+
+var _numeric = require("./function/utils/numeric.js");
+
+var _reviver = require("./json/reviver.js");
+
+var _replacer = require("./json/replacer.js");
+
+// ----------------------------------------------------------------------------
+// classes and functions
+// core
+// classes
+// algebra
+// arithmetic
+var createUnaryMinus = /* #__PURE__ */createNumberFactory('unaryMinus', _index.unaryMinusNumber);
+exports.createUnaryMinus = createUnaryMinus;
+var createUnaryPlus = /* #__PURE__ */createNumberFactory('unaryPlus', _index.unaryPlusNumber);
+exports.createUnaryPlus = createUnaryPlus;
+var createAbs = /* #__PURE__ */createNumberFactory('abs', _index.absNumber);
+exports.createAbs = createAbs;
+var createAddScalar = /* #__PURE__ */createNumberFactory('addScalar', _index.addNumber);
+exports.createAddScalar = createAddScalar;
+var createCbrt = /* #__PURE__ */createNumberFactory('cbrt', _index.cbrtNumber);
+exports.createCbrt = createCbrt;
+var createCeil = /* #__PURE__ */createNumberFactory('ceil', _index.ceilNumber);
+exports.createCeil = createCeil;
+var createCube = /* #__PURE__ */createNumberFactory('cube', _index.cubeNumber);
+exports.createCube = createCube;
+var createExp = /* #__PURE__ */createNumberFactory('exp', _index.expNumber);
+exports.createExp = createExp;
+var createExpm1 = /* #__PURE__ */createNumberFactory('expm1', _index.expm1Number);
+exports.createExpm1 = createExpm1;
+var createFix = /* #__PURE__ */createNumberFactory('fix', _index.fixNumber);
+exports.createFix = createFix;
+var createFloor = /* #__PURE__ */createNumberFactory('floor', _index.floorNumber);
+exports.createFloor = createFloor;
+var createGcd = /* #__PURE__ */createNumberFactory('gcd', _index.gcdNumber);
+exports.createGcd = createGcd;
+var createLcm = /* #__PURE__ */createNumberFactory('lcm', _index.lcmNumber);
+exports.createLcm = createLcm;
+var createLog10 = /* #__PURE__ */createNumberFactory('log10', _index.log10Number);
+exports.createLog10 = createLog10;
+var createLog2 = /* #__PURE__ */createNumberFactory('log2', _index.log2Number);
+exports.createLog2 = createLog2;
+var createMod = /* #__PURE__ */createNumberFactory('mod', _index.modNumber);
+exports.createMod = createMod;
+var createMultiplyScalar = /* #__PURE__ */createNumberFactory('multiplyScalar', _index.multiplyNumber);
+exports.createMultiplyScalar = createMultiplyScalar;
+var createMultiply = /* #__PURE__ */createNumberFactory('multiply', _index.multiplyNumber);
+exports.createMultiply = createMultiply;
+var createSign = /* #__PURE__ */createNumberFactory('sign', _index.signNumber);
+exports.createSign = createSign;
+var createSqrt = /* #__PURE__ */createNumberFactory('sqrt', _index.sqrtNumber);
+exports.createSqrt = createSqrt;
+var createSquare = /* #__PURE__ */createNumberFactory('square', _index.squareNumber);
+exports.createSquare = createSquare;
+var createSubtract = /* #__PURE__ */createNumberFactory('subtract', _index.subtractNumber);
+exports.createSubtract = createSubtract;
+var createXgcd = /* #__PURE__ */createNumberFactory('xgcd', _index.xgcdNumber);
+exports.createXgcd = createXgcd;
+var createDivideScalar = /* #__PURE__ */createNumberFactory('divideScalar', _index.divideNumber);
+exports.createDivideScalar = createDivideScalar;
+var createPow = /* #__PURE__ */createNumberFactory('pow', _index.powNumber);
+exports.createPow = createPow;
+var createLog = /* #__PURE__ */createNumberOptionalSecondArgFactory('log', _index.logNumber);
+exports.createLog = createLog;
+var createLog1p = /* #__PURE__ */createNumberFactory('log1p', _index.log1pNumber);
+exports.createLog1p = createLog1p;
+var createAdd = /* #__PURE__ */createNumberFactory('add', _index.addNumber);
+exports.createAdd = createAdd;
+var createNorm = /* #__PURE__ */createNumberFactory('norm', _index.normNumber);
+exports.createNorm = createNorm;
+var createDivide = /* #__PURE__ */createNumberFactory('divide', _index.divideNumber); // bitwise
+
+exports.createDivide = createDivide;
+var createBitAnd = /* #__PURE__ */createNumberFactory('bitAnd', _index.bitAndNumber);
+exports.createBitAnd = createBitAnd;
+var createBitNot = /* #__PURE__ */createNumberFactory('bitNot', _index.bitNotNumber);
+exports.createBitNot = createBitNot;
+var createBitOr = /* #__PURE__ */createNumberFactory('bitOr', _index.bitOrNumber);
+exports.createBitOr = createBitOr;
+var createBitXor = /* #__PURE__ */createNumberFactory('bitXor', _index.bitXorNumber);
+exports.createBitXor = createBitXor;
+var createLeftShift = /* #__PURE__ */createNumberFactory('leftShift', _index.leftShiftNumber);
+exports.createLeftShift = createLeftShift;
+var createRightArithShift = /* #__PURE__ */createNumberFactory('rightArithShift', _index.rightArithShiftNumber);
+exports.createRightArithShift = createRightArithShift;
+var createRightLogShift = /* #__PURE__ */createNumberFactory('rightLogShift', _index.rightLogShiftNumber); // combinatorics
+
+exports.createRightLogShift = createRightLogShift;
+// logical
+var createAnd = /* #__PURE__ */createNumberFactory('and', _index.andNumber);
+exports.createAnd = createAnd;
+var createNot = /* #__PURE__ */createNumberFactory('not', _index.notNumber);
+exports.createNot = createNot;
+var createOr = /* #__PURE__ */createNumberFactory('or', _index.orNumber);
+exports.createOr = createOr;
+var createXor = /* #__PURE__ */createNumberFactory('xor', _index.xorNumber); // matrix
+
+exports.createXor = createXor;
+// FIXME: create a lightweight "number" implementation of subset only supporting plain objects/arrays
+var createIndex = /* #__PURE__ */(0, _factory.factory)('index', [], function () {
+  return _noop.noIndex;
+});
+exports.createIndex = createIndex;
+var createMatrix = /* #__PURE__ */(0, _factory.factory)('matrix', [], function () {
+  return _noop.noMatrix;
+}); // FIXME: needed now because subset transform needs it. Remove the need for it in subset
+
+exports.createMatrix = createMatrix;
+var createSubset = /* #__PURE__ */(0, _factory.factory)('subset', [], function () {
+  return _noop.noSubset;
+}); // TODO: provide number+array implementations for map, filter, forEach, zeros, ...?
+// TODO: create range implementation for range?
+
+exports.createSubset = createSubset;
+// probability
+var createCombinations = createNumberFactory('combinations', _index.combinationsNumber);
+exports.createCombinations = createCombinations;
+var createGamma = createNumberFactory('gamma', _index.gammaNumber);
+exports.createGamma = createGamma;
+// trigonometry
+var createAcos = /* #__PURE__ */createNumberFactory('acos', _index.acosNumber);
+exports.createAcos = createAcos;
+var createAcosh = /* #__PURE__ */createNumberFactory('acosh', _index.acoshNumber);
+exports.createAcosh = createAcosh;
+var createAcot = /* #__PURE__ */createNumberFactory('acot', _index.acotNumber);
+exports.createAcot = createAcot;
+var createAcoth = /* #__PURE__ */createNumberFactory('acoth', _index.acothNumber);
+exports.createAcoth = createAcoth;
+var createAcsc = /* #__PURE__ */createNumberFactory('acsc', _index.acscNumber);
+exports.createAcsc = createAcsc;
+var createAcsch = /* #__PURE__ */createNumberFactory('acsch', _index.acschNumber);
+exports.createAcsch = createAcsch;
+var createAsec = /* #__PURE__ */createNumberFactory('asec', _index.asecNumber);
+exports.createAsec = createAsec;
+var createAsech = /* #__PURE__ */createNumberFactory('asech', _index.asechNumber);
+exports.createAsech = createAsech;
+var createAsin = /* #__PURE__ */createNumberFactory('asin', _index.asinNumber);
+exports.createAsin = createAsin;
+var createAsinh = /* #__PURE__ */createNumberFactory('asinh', _index.asinhNumber);
+exports.createAsinh = createAsinh;
+var createAtan = /* #__PURE__ */createNumberFactory('atan', _index.atanNumber);
+exports.createAtan = createAtan;
+var createAtan2 = /* #__PURE__ */createNumberFactory('atan2', _index.atan2Number);
+exports.createAtan2 = createAtan2;
+var createAtanh = /* #__PURE__ */createNumberFactory('atanh', _index.atanhNumber);
+exports.createAtanh = createAtanh;
+var createCos = /* #__PURE__ */createNumberFactory('cos', _index.cosNumber);
+exports.createCos = createCos;
+var createCosh = /* #__PURE__ */createNumberFactory('cosh', _index.coshNumber);
+exports.createCosh = createCosh;
+var createCot = /* #__PURE__ */createNumberFactory('cot', _index.cotNumber);
+exports.createCot = createCot;
+var createCoth = /* #__PURE__ */createNumberFactory('coth', _index.cothNumber);
+exports.createCoth = createCoth;
+var createCsc = /* #__PURE__ */createNumberFactory('csc', _index.cscNumber);
+exports.createCsc = createCsc;
+var createCsch = /* #__PURE__ */createNumberFactory('csch', _index.cschNumber);
+exports.createCsch = createCsch;
+var createSec = /* #__PURE__ */createNumberFactory('sec', _index.secNumber);
+exports.createSec = createSec;
+var createSech = /* #__PURE__ */createNumberFactory('sech', _index.sechNumber);
+exports.createSech = createSech;
+var createSin = /* #__PURE__ */createNumberFactory('sin', _index.sinNumber);
+exports.createSin = createSin;
+var createSinh = /* #__PURE__ */createNumberFactory('sinh', _index.sinhNumber);
+exports.createSinh = createSinh;
+var createTan = /* #__PURE__ */createNumberFactory('tan', _index.tanNumber);
+exports.createTan = createTan;
+var createTanh = /* #__PURE__ */createNumberFactory('tanh', _index.tanhNumber); // transforms
+
+exports.createTanh = createTanh;
+var createSubsetTransform = /* #__PURE__ */(0, _factory.factory)('subset', [], function () {
+  return _noop.noSubset;
+}, {
+  isTransformFunction: true
+});
+exports.createSubsetTransform = createSubsetTransform;
+var createIsInteger = /* #__PURE__ */createNumberFactory('isInteger', _index.isIntegerNumber);
+exports.createIsInteger = createIsInteger;
+var createIsNegative = /* #__PURE__ */createNumberFactory('isNegative', _index.isNegativeNumber);
+exports.createIsNegative = createIsNegative;
+var createIsPositive = /* #__PURE__ */createNumberFactory('isPositive', _index.isPositiveNumber);
+exports.createIsPositive = createIsPositive;
+var createIsZero = /* #__PURE__ */createNumberFactory('isZero', _index.isZeroNumber);
+exports.createIsZero = createIsZero;
+var createIsNaN = /* #__PURE__ */createNumberFactory('isNaN', _index.isNaNNumber);
+exports.createIsNaN = createIsNaN;
+
+// helper functions to create a factory function for a function which only needs typed-function
+function createNumberFactory(name, fn) {
+  return (0, _factory.factory)(name, ['typed'], function (_ref) {
+    var typed = _ref.typed;
+    return typed(fn);
+  });
+}
+
+function createNumberOptionalSecondArgFactory(name, fn) {
+  return (0, _factory.factory)(name, ['typed'], function (_ref2) {
+    var typed = _ref2.typed;
+    return typed({
+      number: fn,
+      'number,number': fn
+    });
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/decomposition/lup.js b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/lup.js
new file mode 100644
index 0000000..da7d220
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/lup.js
@@ -0,0 +1,421 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLup = void 0;
+
+var _object = require("../../../utils/object.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'lup';
+var dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];
+var createLup = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      abs = _ref.abs,
+      addScalar = _ref.addScalar,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      subtract = _ref.subtract,
+      larger = _ref.larger,
+      equalScalar = _ref.equalScalar,
+      unaryMinus = _ref.unaryMinus,
+      DenseMatrix = _ref.DenseMatrix,
+      SparseMatrix = _ref.SparseMatrix,
+      Spa = _ref.Spa;
+
+  /**
+   * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a
+   * row permutation vector `p` where `A[p,:] = L * U`
+   *
+   * Syntax:
+   *
+   *    math.lup(A)
+   *
+   * Example:
+   *
+   *    const m = [[2, 1], [1, 4]]
+   *    const r = math.lup(m)
+   *    // r = {
+   *    //   L: [[1, 0], [0.5, 1]],
+   *    //   U: [[2, 1], [0, 3.5]],
+   *    //   P: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    slu, lsolve, lusolve, usolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array for which to get the LUP decomposition.
+   *
+   * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.
+   */
+  return typed(name, {
+    DenseMatrix: function DenseMatrix(m) {
+      return _denseLUP(m);
+    },
+    SparseMatrix: function SparseMatrix(m) {
+      return _sparseLUP(m);
+    },
+    Array: function Array(a) {
+      // create dense matrix from array
+      var m = matrix(a); // lup, use matrix implementation
+
+      var r = _denseLUP(m); // result
+
+
+      return {
+        L: r.L.valueOf(),
+        U: r.U.valueOf(),
+        p: r.p
+      };
+    }
+  });
+
+  function _denseLUP(m) {
+    // rows & columns
+    var rows = m._size[0];
+    var columns = m._size[1]; // minimum rows and columns
+
+    var n = Math.min(rows, columns); // matrix array, clone original data
+
+    var data = (0, _object.clone)(m._data); // l matrix arrays
+
+    var ldata = [];
+    var lsize = [rows, n]; // u matrix arrays
+
+    var udata = [];
+    var usize = [n, columns]; // vars
+
+    var i, j, k; // permutation vector
+
+    var p = [];
+
+    for (i = 0; i < rows; i++) {
+      p[i] = i;
+    } // loop columns
+
+
+    for (j = 0; j < columns; j++) {
+      // skip first column in upper triangular matrix
+      if (j > 0) {
+        // loop rows
+        for (i = 0; i < rows; i++) {
+          // min i,j
+          var min = Math.min(i, j); // v[i, j]
+
+          var s = 0; // loop up to min
+
+          for (k = 0; k < min; k++) {
+            // s = l[i, k] - data[k, j]
+            s = addScalar(s, multiplyScalar(data[i][k], data[k][j]));
+          }
+
+          data[i][j] = subtract(data[i][j], s);
+        }
+      } // row with larger value in cvector, row >= j
+
+
+      var pi = j;
+      var pabsv = 0;
+      var vjj = 0; // loop rows
+
+      for (i = j; i < rows; i++) {
+        // data @ i, j
+        var v = data[i][j]; // absolute value
+
+        var absv = abs(v); // value is greater than pivote value
+
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = i; // update max value
+
+          pabsv = absv; // value @ [j, j]
+
+          vjj = v;
+        }
+      } // swap rows (j <-> pi)
+
+
+      if (j !== pi) {
+        // swap values j <-> pi in p
+        p[j] = [p[pi], p[pi] = p[j]][0]; // swap j <-> pi in data
+
+        DenseMatrix._swapRows(j, pi, data);
+      } // check column is in lower triangular matrix
+
+
+      if (j < rows) {
+        // loop rows (lower triangular matrix)
+        for (i = j + 1; i < rows; i++) {
+          // value @ i, j
+          var vij = data[i][j];
+
+          if (!equalScalar(vij, 0)) {
+            // update data
+            data[i][j] = divideScalar(data[i][j], vjj);
+          }
+        }
+      }
+    } // loop columns
+
+
+    for (j = 0; j < columns; j++) {
+      // loop rows
+      for (i = 0; i < rows; i++) {
+        // initialize row in arrays
+        if (j === 0) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i] = [];
+          } // L
+
+
+          ldata[i] = [];
+        } // check we are in the upper triangular matrix
+
+
+        if (i < j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          } // check column exists in lower triangular matrix
+
+
+          if (j < rows) {
+            // L
+            ldata[i][j] = 0;
+          }
+
+          continue;
+        } // diagonal value
+
+
+        if (i === j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          } // check column exists in lower triangular matrix
+
+
+          if (j < rows) {
+            // L
+            ldata[i][j] = 1;
+          }
+
+          continue;
+        } // check row exists in upper triangular matrix
+
+
+        if (i < columns) {
+          // U
+          udata[i][j] = 0;
+        } // check column exists in lower triangular matrix
+
+
+        if (j < rows) {
+          // L
+          ldata[i][j] = data[i][j];
+        }
+      }
+    } // l matrix
+
+
+    var l = new DenseMatrix({
+      data: ldata,
+      size: lsize
+    }); // u matrix
+
+    var u = new DenseMatrix({
+      data: udata,
+      size: usize
+    }); // p vector
+
+    var pv = [];
+
+    for (i = 0, n = p.length; i < n; i++) {
+      pv[p[i]] = i;
+    } // return matrices
+
+
+    return {
+      L: l,
+      U: u,
+      p: pv,
+      toString: function toString() {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+
+  function _sparseLUP(m) {
+    // rows & columns
+    var rows = m._size[0];
+    var columns = m._size[1]; // minimum rows and columns
+
+    var n = Math.min(rows, columns); // matrix arrays (will not be modified, thanks to permutation vector)
+
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // l matrix arrays
+
+    var lvalues = [];
+    var lindex = [];
+    var lptr = [];
+    var lsize = [rows, n]; // u matrix arrays
+
+    var uvalues = [];
+    var uindex = [];
+    var uptr = [];
+    var usize = [n, columns]; // vars
+
+    var i, j, k; // permutation vectors, (current index -> original index) and (original index -> current index)
+
+    var pvCo = [];
+    var pvOc = [];
+
+    for (i = 0; i < rows; i++) {
+      pvCo[i] = i;
+      pvOc[i] = i;
+    } // swap indices in permutation vectors (condition x < y)!
+
+
+    var swapIndeces = function swapIndeces(x, y) {
+      // find pv indeces getting data from x and y
+      var kx = pvOc[x];
+      var ky = pvOc[y]; // update permutation vector current -> original
+
+      pvCo[kx] = y;
+      pvCo[ky] = x; // update permutation vector original -> current
+
+      pvOc[x] = ky;
+      pvOc[y] = kx;
+    }; // loop columns
+
+
+    var _loop = function _loop() {
+      // sparse accumulator
+      var spa = new Spa(); // check lower triangular matrix has a value @ column j
+
+      if (j < rows) {
+        // update ptr
+        lptr.push(lvalues.length); // first value in j column for lower triangular matrix
+
+        lvalues.push(1);
+        lindex.push(j);
+      } // update ptr
+
+
+      uptr.push(uvalues.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1]; // copy column j into sparse accumulator
+
+      for (k = k0; k < k1; k++) {
+        // row
+        i = index[k]; // copy column values into sparse accumulator (use permutation vector)
+
+        spa.set(pvCo[i], values[k]);
+      } // skip first column in upper triangular matrix
+
+
+      if (j > 0) {
+        // loop rows in column j (above diagonal)
+        spa.forEach(0, j - 1, function (k, vkj) {
+          // loop rows in column k (L)
+          SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {
+            // check row is below k
+            if (i > k) {
+              // update spa value
+              spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)));
+            }
+          });
+        });
+      } // row with larger value in spa, row >= j
+
+
+      var pi = j;
+      var vjj = spa.get(j);
+      var pabsv = abs(vjj); // loop values in spa (order by row, below diagonal)
+
+      spa.forEach(j + 1, rows - 1, function (x, v) {
+        // absolute value
+        var absv = abs(v); // value is greater than pivote value
+
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = x; // update max value
+
+          pabsv = absv; // value @ [j, j]
+
+          vjj = v;
+        }
+      }); // swap rows (j <-> pi)
+
+      if (j !== pi) {
+        // swap values j <-> pi in L
+        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); // swap values j <-> pi in U
+
+
+        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); // swap values in spa
+
+
+        spa.swap(j, pi); // update permutation vector (swap values @ j, pi)
+
+        swapIndeces(j, pi);
+      } // loop values in spa (order by row)
+
+
+      spa.forEach(0, rows - 1, function (x, v) {
+        // check we are above diagonal
+        if (x <= j) {
+          // update upper triangular matrix
+          uvalues.push(v);
+          uindex.push(x);
+        } else {
+          // update value
+          v = divideScalar(v, vjj); // check value is non zero
+
+          if (!equalScalar(v, 0)) {
+            // update lower triangular matrix
+            lvalues.push(v);
+            lindex.push(x);
+          }
+        }
+      });
+    };
+
+    for (j = 0; j < columns; j++) {
+      _loop();
+    } // update ptrs
+
+
+    uptr.push(uvalues.length);
+    lptr.push(lvalues.length); // return matrices
+
+    return {
+      L: new SparseMatrix({
+        values: lvalues,
+        index: lindex,
+        ptr: lptr,
+        size: lsize
+      }),
+      U: new SparseMatrix({
+        values: uvalues,
+        index: uindex,
+        ptr: uptr,
+        size: usize
+      }),
+      p: pvCo,
+      toString: function toString() {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+});
+exports.createLup = createLup;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/decomposition/qr.js b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/qr.js
new file mode 100644
index 0000000..43601b4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/qr.js
@@ -0,0 +1,246 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createQr = void 0;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'qr';
+var dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'complex'];
+var createQr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      zeros = _ref.zeros,
+      identity = _ref.identity,
+      isZero = _ref.isZero,
+      equal = _ref.equal,
+      sign = _ref.sign,
+      sqrt = _ref.sqrt,
+      conj = _ref.conj,
+      unaryMinus = _ref.unaryMinus,
+      addScalar = _ref.addScalar,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      subtract = _ref.subtract,
+      complex = _ref.complex;
+
+  /**
+   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in
+   * two matrices (`Q`, `R`) where `Q` is an
+   * orthogonal matrix and `R` is an upper triangular matrix.
+   *
+   * Syntax:
+   *
+   *    math.qr(A)
+   *
+   * Example:
+   *
+   *    const m = [
+   *      [1, -1,  4],
+   *      [1,  4, -2],
+   *      [1,  4,  2],
+   *      [1,  -1, 0]
+   *    ]
+   *    const result = math.qr(m)
+   *    // r = {
+   *    //   Q: [
+   *    //     [0.5, -0.5,   0.5],
+   *    //     [0.5,  0.5,  -0.5],
+   *    //     [0.5,  0.5,   0.5],
+   *    //     [0.5, -0.5,  -0.5],
+   *    //   ],
+   *    //   R: [
+   *    //     [2, 3,  2],
+   *    //     [0, 5, -2],
+   *    //     [0, 0,  4],
+   *    //     [0, 0,  0]
+   *    //   ]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lusolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array
+   * for which to get the QR decomposition.
+   *
+   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal
+   * matrix and R: the upper triangular matrix
+   */
+  return (0, _extends2.default)(typed(name, {
+    DenseMatrix: function DenseMatrix(m) {
+      return _denseQR(m);
+    },
+    SparseMatrix: function SparseMatrix(m) {
+      return _sparseQR(m);
+    },
+    Array: function Array(a) {
+      // create dense matrix from array
+      var m = matrix(a); // lup, use matrix implementation
+
+      var r = _denseQR(m); // result
+
+
+      return {
+        Q: r.Q.valueOf(),
+        R: r.R.valueOf()
+      };
+    }
+  }), {
+    _denseQRimpl: _denseQRimpl
+  });
+
+  function _denseQRimpl(m) {
+    // rows & columns (m x n)
+    var rows = m._size[0]; // m
+
+    var cols = m._size[1]; // n
+
+    var Q = identity([rows], 'dense');
+    var Qdata = Q._data;
+    var R = m.clone();
+    var Rdata = R._data; // vars
+
+    var i, j, k;
+    var w = zeros([rows], '');
+
+    for (k = 0; k < Math.min(cols, rows); ++k) {
+      /*
+       * **k-th Household matrix**
+       *
+       * The matrix I - 2*v*transpose(v)
+       * x     = first column of A
+       * x1    = first element of x
+       * alpha = x1 / |x1| * |x|
+       * e1    = tranpose([1, 0, 0, ...])
+       * u     = x - alpha * e1
+       * v     = u / |u|
+       *
+       * Household matrix = I - 2 * v * tranpose(v)
+       *
+       *  * Initially Q = I and R = A.
+       *  * Household matrix is a reflection in a plane normal to v which
+       *    will zero out all but the top right element in R.
+       *  * Appplying reflection to both Q and R will not change product.
+       *  * Repeat this process on the (1,1) minor to get R as an upper
+       *    triangular matrix.
+       *  * Reflections leave the magnitude of the columns of Q unchanged
+       *    so Q remains othoganal.
+       *
+       */
+      var pivot = Rdata[k][k];
+      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));
+      var conjSgn = conj(sgn);
+      var alphaSquared = 0;
+
+      for (i = k; i < rows; i++) {
+        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));
+      }
+
+      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));
+
+      if (!isZero(alpha)) {
+        // first element in vector u
+        var u1 = subtract(pivot, alpha); // w = v * u1 / |u|    (only elements k to (rows-1) are used)
+
+        w[k] = 1;
+
+        for (i = k + 1; i < rows; i++) {
+          w[i] = divideScalar(Rdata[i][k], u1);
+        } // tau = - conj(u1 / alpha)
+
+
+        var tau = unaryMinus(conj(divideScalar(u1, alpha)));
+        var s = void 0;
+        /*
+         * tau and w have been choosen so that
+         *
+         * 2 * v * tranpose(v) = tau * w * tranpose(w)
+         */
+
+        /*
+         * -- calculate R = R - tau * w * tranpose(w) * R --
+         * Only do calculation with rows k to (rows-1)
+         * Additionally columns 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+
+        for (j = k; j < cols; j++) {
+          s = 0.0; // calculate jth element of [tranpose(w) * R]
+
+          for (i = k; i < rows; i++) {
+            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));
+          } // calculate the jth element of [tau * transpose(w) * R]
+
+
+          s = multiplyScalar(s, tau);
+
+          for (i = k; i < rows; i++) {
+            Rdata[i][j] = multiplyScalar(subtract(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);
+          }
+        }
+        /*
+         * -- calculate Q = Q - tau * Q * w * transpose(w) --
+         * Q is a square matrix (rows x rows)
+         * Only do calculation with columns k to (rows-1)
+         * Additionally rows 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+
+
+        for (i = 0; i < rows; i++) {
+          s = 0.0; // calculate ith element of [Q * w]
+
+          for (j = k; j < rows; j++) {
+            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));
+          } // calculate the ith element of [tau * Q * w]
+
+
+          s = multiplyScalar(s, tau);
+
+          for (j = k; j < rows; ++j) {
+            Qdata[i][j] = divideScalar(subtract(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);
+          }
+        }
+      }
+    } // return matrices
+
+
+    return {
+      Q: Q,
+      R: R,
+      toString: function toString() {
+        return 'Q: ' + this.Q.toString() + '\nR: ' + this.R.toString();
+      }
+    };
+  }
+
+  function _denseQR(m) {
+    var ret = _denseQRimpl(m);
+
+    var Rdata = ret.R._data;
+
+    if (m._data.length > 0) {
+      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;
+
+      for (var i = 0; i < Rdata.length; ++i) {
+        for (var j = 0; j < i && j < (Rdata[0] || []).length; ++j) {
+          Rdata[i][j] = zero;
+        }
+      }
+    }
+
+    return ret;
+  }
+
+  function _sparseQR(m) {
+    throw new Error('qr not implemented for sparse matrices yet');
+  }
+});
+exports.createQr = createQr;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/decomposition/slu.js b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/slu.js
new file mode 100644
index 0000000..54f2069
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/slu.js
@@ -0,0 +1,110 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSlu = void 0;
+
+var _number = require("../../../utils/number.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var _csSqr = require("../sparse/csSqr.js");
+
+var _csLu = require("../sparse/csLu.js");
+
+var name = 'slu';
+var dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+var createSlu = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      abs = _ref.abs,
+      add = _ref.add,
+      multiply = _ref.multiply,
+      transpose = _ref.transpose,
+      divideScalar = _ref.divideScalar,
+      subtract = _ref.subtract,
+      larger = _ref.larger,
+      largerEq = _ref.largerEq,
+      SparseMatrix = _ref.SparseMatrix;
+  var csSqr = (0, _csSqr.createCsSqr)({
+    add: add,
+    multiply: multiply,
+    transpose: transpose
+  });
+  var csLu = (0, _csLu.createCsLu)({
+    abs: abs,
+    divideScalar: divideScalar,
+    multiply: multiply,
+    subtract: subtract,
+    larger: larger,
+    largerEq: largerEq,
+    SparseMatrix: SparseMatrix
+  });
+  /**
+   * Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where
+   *
+   * `P * A * Q = L * U`
+   *
+   * Syntax:
+   *
+   *    math.slu(A, order, threshold)
+   *
+   * Examples:
+   *
+   *    const A = math.sparse([[4,3], [6, 3]])
+   *    math.slu(A, 1, 0.001)
+   *    // returns:
+   *    // {
+   *    //   L: [[1, 0], [1.5, 1]]
+   *    //   U: [[4, 3], [0, -1.5]]
+   *    //   p: [0, 1]
+   *    //   q: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lsolve, usolve, lusolve
+   *
+   * @param {SparseMatrix} A              A two dimensional sparse matrix for which to get the LU decomposition.
+   * @param {Number}       order          The Symbolic Ordering and Analysis order:
+   *                                       0 - Natural ordering, no permutation vector q is returned
+   *                                       1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'
+   *                                       2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.
+   *                                           This is appropriatefor LU factorization of unsymmetric matrices.
+   *                                       3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.
+   *                                           A dense row is a row with more than 10*sqr(columns) entries.
+   * @param {Number}       threshold       Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.
+   */
+
+  return typed(name, {
+    'SparseMatrix, number, number': function SparseMatrixNumberNumber(a, order, threshold) {
+      // verify order
+      if (!(0, _number.isInteger)(order) || order < 0 || order > 3) {
+        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');
+      } // verify threshold
+
+
+      if (threshold < 0 || threshold > 1) {
+        throw new Error('Partial pivoting threshold must be a number from 0 to 1');
+      } // perform symbolic ordering and analysis
+
+
+      var s = csSqr(order, a, false); // perform lu decomposition
+
+      var f = csLu(a, s, threshold); // return decomposition
+
+      return {
+        L: f.L,
+        U: f.U,
+        p: f.pinv,
+        q: s.q,
+        toString: function toString() {
+          return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\np: ' + this.p.toString() + (this.q ? '\nq: ' + this.q.toString() : '') + '\n';
+        }
+      };
+    }
+  });
+});
+exports.createSlu = createSlu;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/derivative.js b/node_modules/mathjs/lib/cjs/function/algebra/derivative.js
new file mode 100644
index 0000000..60d153d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/derivative.js
@@ -0,0 +1,628 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDerivative = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'derivative';
+var dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+var createDerivative = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      parse = _ref.parse,
+      simplify = _ref.simplify,
+      equal = _ref.equal,
+      isZero = _ref.isZero,
+      numeric = _ref.numeric,
+      ConstantNode = _ref.ConstantNode,
+      FunctionNode = _ref.FunctionNode,
+      OperatorNode = _ref.OperatorNode,
+      ParenthesisNode = _ref.ParenthesisNode,
+      SymbolNode = _ref.SymbolNode;
+
+  /**
+   * Takes the derivative of an expression expressed in parser Nodes.
+   * The derivative will be taken over the supplied variable in the
+   * second parameter. If there are multiple variables in the expression,
+   * it will return a partial derivative.
+   *
+   * This uses rules of differentiation which can be found here:
+   *
+   * - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)
+   *
+   * Syntax:
+   *
+   *     derivative(expr, variable)
+   *     derivative(expr, variable, options)
+   *
+   * Examples:
+   *
+   *     math.derivative('x^2', 'x')                     // Node {2 * x}
+   *     math.derivative('x^2', 'x', {simplify: false})  // Node {2 * 1 * x ^ (2 - 1)
+   *     math.derivative('sin(2x)', 'x'))                // Node {2 * cos(2 * x)}
+   *     math.derivative('2*x', 'x').evaluate()          // number 2
+   *     math.derivative('x^2', 'x').evaluate({x: 4})    // number 8
+   *     const f = math.parse('x^2')
+   *     const x = math.parse('x')
+   *     math.derivative(f, x)                           // Node {2 * x}
+   *
+   * See also:
+   *
+   *     simplify, parse, evaluate
+   *
+   * @param  {Node | string} expr           The expression to differentiate
+   * @param  {SymbolNode | string} variable The variable over which to differentiate
+   * @param  {{simplify: boolean}} [options]
+   *                         There is one option available, `simplify`, which
+   *                         is true by default. When false, output will not
+   *                         be simplified.
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+  var derivative = typed('derivative', {
+    'Node, SymbolNode, Object': function NodeSymbolNodeObject(expr, variable, options) {
+      var constNodes = {};
+      constTag(constNodes, expr, variable.name);
+
+      var res = _derivative(expr, constNodes);
+
+      return options.simplify ? simplify(res) : res;
+    },
+    'Node, SymbolNode': function NodeSymbolNode(expr, variable) {
+      return this(expr, variable, {
+        simplify: true
+      });
+    },
+    'string, SymbolNode': function stringSymbolNode(expr, variable) {
+      return this(parse(expr), variable);
+    },
+    'string, SymbolNode, Object': function stringSymbolNodeObject(expr, variable, options) {
+      return this(parse(expr), variable, options);
+    },
+    'string, string': function stringString(expr, variable) {
+      return this(parse(expr), parse(variable));
+    },
+    'string, string, Object': function stringStringObject(expr, variable, options) {
+      return this(parse(expr), parse(variable), options);
+    },
+    'Node, string': function NodeString(expr, variable) {
+      return this(expr, parse(variable));
+    },
+    'Node, string, Object': function NodeStringObject(expr, variable, options) {
+      return this(expr, parse(variable), options);
+    } // TODO: replace the 8 signatures above with 4 as soon as typed-function supports optional arguments
+
+    /* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}
+    'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {
+      let res = expr
+      for (let i = 0; i < order; i++) {
+        let constNodes = {}
+        constTag(constNodes, expr, variable.name)
+        res = _derivative(res, constNodes)
+      }
+      return res
+    }
+    */
+
+  });
+  derivative._simplify = true;
+
+  derivative.toTex = function (deriv) {
+    return _derivTex.apply(null, deriv.args);
+  }; // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.
+  // NOTE: the optional "order" parameter here is currently unused
+
+
+  var _derivTex = typed('_derivTex', {
+    'Node, SymbolNode': function NodeSymbolNode(expr, x) {
+      if ((0, _is.isConstantNode)(expr) && (0, _is.typeOf)(expr.value) === 'string') {
+        return _derivTex(parse(expr.value).toString(), x.toString(), 1);
+      } else {
+        return _derivTex(expr.toString(), x.toString(), 1);
+      }
+    },
+    'Node, ConstantNode': function NodeConstantNode(expr, x) {
+      if ((0, _is.typeOf)(x.value) === 'string') {
+        return _derivTex(expr, parse(x.value));
+      } else {
+        throw new Error("The second parameter to 'derivative' is a non-string constant");
+      }
+    },
+    'Node, SymbolNode, ConstantNode': function NodeSymbolNodeConstantNode(expr, x, order) {
+      return _derivTex(expr.toString(), x.name, order.value);
+    },
+    'string, string, number': function stringStringNumber(expr, x, order) {
+      var d;
+
+      if (order === 1) {
+        d = '{d\\over d' + x + '}';
+      } else {
+        d = '{d^{' + order + '}\\over d' + x + '^{' + order + '}}';
+      }
+
+      return d + "\\left[".concat(expr, "\\right]");
+    }
+  });
+  /**
+   * Does a depth-first search on the expression tree to identify what Nodes
+   * are constants (e.g. 2 + 2), and stores the ones that are constants in
+   * constNodes. Classification is done as follows:
+   *
+   *   1. ConstantNodes are constants.
+   *   2. If there exists a SymbolNode, of which we are differentiating over,
+   *      in the subtree it is not constant.
+   *
+   * @param  {Object} constNodes  Holds the nodes that are constant
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {string} varName     Variable that we are differentiating
+   * @return {boolean}  if node is constant
+   */
+  // TODO: can we rewrite constTag into a pure function?
+
+
+  var constTag = typed('constTag', {
+    'Object, ConstantNode, string': function ObjectConstantNodeString(constNodes, node) {
+      constNodes[node] = true;
+      return true;
+    },
+    'Object, SymbolNode, string': function ObjectSymbolNodeString(constNodes, node, varName) {
+      // Treat other variables like constants. For reasoning, see:
+      //   https://en.wikipedia.org/wiki/Partial_derivative
+      if (node.name !== varName) {
+        constNodes[node] = true;
+        return true;
+      }
+
+      return false;
+    },
+    'Object, ParenthesisNode, string': function ObjectParenthesisNodeString(constNodes, node, varName) {
+      return constTag(constNodes, node.content, varName);
+    },
+    'Object, FunctionAssignmentNode, string': function ObjectFunctionAssignmentNodeString(constNodes, node, varName) {
+      if (node.params.indexOf(varName) === -1) {
+        constNodes[node] = true;
+        return true;
+      }
+
+      return constTag(constNodes, node.expr, varName);
+    },
+    'Object, FunctionNode | OperatorNode, string': function ObjectFunctionNodeOperatorNodeString(constNodes, node, varName) {
+      if (node.args.length > 0) {
+        var isConst = constTag(constNodes, node.args[0], varName);
+
+        for (var i = 1; i < node.args.length; ++i) {
+          isConst = constTag(constNodes, node.args[i], varName) && isConst;
+        }
+
+        if (isConst) {
+          constNodes[node] = true;
+          return true;
+        }
+      }
+
+      return false;
+    }
+  });
+  /**
+   * Applies differentiation rules.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {Object} constNodes  Holds the nodes that are constant
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+
+  var _derivative = typed('_derivative', {
+    'ConstantNode, Object': function ConstantNodeObject(node) {
+      return createConstantNode(0);
+    },
+    'SymbolNode, Object': function SymbolNodeObject(node, constNodes) {
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      return createConstantNode(1);
+    },
+    'ParenthesisNode, Object': function ParenthesisNodeObject(node, constNodes) {
+      return new ParenthesisNode(_derivative(node.content, constNodes));
+    },
+    'FunctionAssignmentNode, Object': function FunctionAssignmentNodeObject(node, constNodes) {
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      return _derivative(node.expr, constNodes);
+    },
+    'FunctionNode, Object': function FunctionNodeObject(node, constNodes) {
+      if (node.args.length !== 1) {
+        funcArgsCheck(node);
+      }
+
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      var arg0 = node.args[0];
+      var arg1;
+      var div = false; // is output a fraction?
+
+      var negative = false; // is output negative?
+
+      var funcDerivative;
+
+      switch (node.name) {
+        case 'cbrt':
+          // d/dx(cbrt(x)) = 1 / (3x^(2/3))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);
+          break;
+
+        case 'sqrt':
+        case 'nthRoot':
+          // d/dx(sqrt(x)) = 1 / (2*sqrt(x))
+          if (node.args.length === 1) {
+            div = true;
+            funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);
+          } else if (node.args.length === 2) {
+            // Rearrange from nthRoot(x, a) -> x^(1/a)
+            arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]); // Is a variable?
+
+            constNodes[arg1] = constNodes[node.args[1]];
+            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes);
+          }
+
+          break;
+
+        case 'log10':
+          arg1 = createConstantNode(10);
+
+        /* fall through! */
+
+        case 'log':
+          if (!arg1 && node.args.length === 1) {
+            // d/dx(log(x)) = 1 / x
+            funcDerivative = arg0.clone();
+            div = true;
+          } else if (node.args.length === 1 && arg1 || node.args.length === 2 && constNodes[node.args[1]] !== undefined) {
+            // d/dx(log(x, c)) = 1 / (x*ln(c))
+            funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);
+            div = true;
+          } else if (node.args.length === 2) {
+            // d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))
+            return _derivative(new OperatorNode('/', 'divide', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), constNodes);
+          }
+
+          break;
+
+        case 'pow':
+          constNodes[arg1] = constNodes[node.args[1]]; // Pass to pow operator node parser
+
+          return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes);
+
+        case 'exp':
+          // d/dx(e^x) = e^x
+          funcDerivative = new FunctionNode('exp', [arg0.clone()]);
+          break;
+
+        case 'sin':
+          // d/dx(sin(x)) = cos(x)
+          funcDerivative = new FunctionNode('cos', [arg0.clone()]);
+          break;
+
+        case 'cos':
+          // d/dx(cos(x)) = -sin(x)
+          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);
+          break;
+
+        case 'tan':
+          // d/dx(tan(x)) = sec(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'sec':
+          // d/dx(sec(x)) = sec(x)tan(x)
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);
+          break;
+
+        case 'csc':
+          // d/dx(csc(x)) = -csc(x)cot(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);
+          break;
+
+        case 'cot':
+          // d/dx(cot(x)) = -csc(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'asin':
+          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+
+        case 'acos':
+          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+
+        case 'atan':
+          // d/dx(atan(x)) = 1 / (x^2 + 1)
+          div = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+
+        case 'asec':
+          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+
+        case 'acsc':
+          // d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+
+        case 'acot':
+          // d/dx(acot(x)) = -1 / (x^2 + 1)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+
+        case 'sinh':
+          // d/dx(sinh(x)) = cosh(x)
+          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);
+          break;
+
+        case 'cosh':
+          // d/dx(cosh(x)) = sinh(x)
+          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);
+          break;
+
+        case 'tanh':
+          // d/dx(tanh(x)) = sech(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'sech':
+          // d/dx(sech(x)) = -sech(x)tanh(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);
+          break;
+
+        case 'csch':
+          // d/dx(csch(x)) = -csch(x)coth(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);
+          break;
+
+        case 'coth':
+          // d/dx(coth(x)) = -csch(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'asinh':
+          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+
+        case 'acosh':
+          // d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+
+        case 'atanh':
+          // d/dx(atanh(x)) = 1 / (1 - x^2)
+          div = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+
+        case 'asech':
+          // d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);
+          break;
+
+        case 'acsch':
+          // d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+
+        case 'acoth':
+          // d/dx(acoth(x)) = -1 / (1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+
+        case 'abs':
+          // d/dx(abs(x)) = abs(x)/x
+          funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);
+          break;
+
+        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)
+
+        default:
+          throw new Error('Function "' + node.name + '" is not supported by derivative, or a wrong number of arguments is passed');
+      }
+
+      var op, func;
+
+      if (div) {
+        op = '/';
+        func = 'divide';
+      } else {
+        op = '*';
+        func = 'multiply';
+      }
+      /* Apply chain rule to all functions:
+         F(x)  = f(g(x))
+         F'(x) = g'(x)*f'(g(x)) */
+
+
+      var chainDerivative = _derivative(arg0, constNodes);
+
+      if (negative) {
+        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);
+      }
+
+      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);
+    },
+    'OperatorNode, Object': function OperatorNodeObject(node, constNodes) {
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      if (node.op === '+') {
+        // d/dx(sum(f(x)) = sum(f'(x))
+        return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {
+          return _derivative(arg, constNodes);
+        }));
+      }
+
+      if (node.op === '-') {
+        // d/dx(+/-f(x)) = +/-f'(x)
+        if (node.isUnary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes)]);
+        } // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)
+
+
+        if (node.isBinary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes), _derivative(node.args[1], constNodes)]);
+        }
+      }
+
+      if (node.op === '*') {
+        // d/dx(c*f(x)) = c*f'(x)
+        var constantTerms = node.args.filter(function (arg) {
+          return constNodes[arg] !== undefined;
+        });
+
+        if (constantTerms.length > 0) {
+          var nonConstantTerms = node.args.filter(function (arg) {
+            return constNodes[arg] === undefined;
+          });
+          var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);
+          var newArgs = constantTerms.concat(_derivative(nonConstantNode, constNodes));
+          return new OperatorNode('*', 'multiply', newArgs);
+        } // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)
+
+
+        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {
+          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {
+            return argInner === argOuter ? _derivative(argInner, constNodes) : argInner.clone();
+          }));
+        }));
+      }
+
+      if (node.op === '/' && node.isBinary()) {
+        var arg0 = node.args[0];
+        var arg1 = node.args[1]; // d/dx(f(x) / c) = f'(x) / c
+
+        if (constNodes[arg1] !== undefined) {
+          return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1]);
+        } // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)
+
+
+        if (constNodes[arg0] !== undefined) {
+          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, constNodes), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);
+        } // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2
+
+
+        return new OperatorNode('/', 'divide', [new OperatorNode('-', 'subtract', [new OperatorNode('*', 'multiply', [_derivative(arg0, constNodes), arg1.clone()]), new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, constNodes)])]), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])]);
+      }
+
+      if (node.op === '^' && node.isBinary()) {
+        var _arg = node.args[0];
+        var _arg2 = node.args[1];
+
+        if (constNodes[_arg] !== undefined) {
+          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1
+          if ((0, _is.isConstantNode)(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {
+            return createConstantNode(0);
+          } // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)
+
+
+          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), constNodes)])]);
+        }
+
+        if (constNodes[_arg2] !== undefined) {
+          if ((0, _is.isConstantNode)(_arg2)) {
+            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0
+            if (isZero(_arg2.value)) {
+              return createConstantNode(0);
+            } // Ignore exponent; f(x)^1 = f(x)
+
+
+            if (equal(_arg2.value, 1)) {
+              return _derivative(_arg, constNodes);
+            }
+          } // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)
+
+
+          var powMinusOne = new OperatorNode('^', 'pow', [_arg.clone(), new OperatorNode('-', 'subtract', [_arg2, createConstantNode(1)])]);
+          return new OperatorNode('*', 'multiply', [_arg2.clone(), new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), powMinusOne])]);
+        } // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]
+
+
+        return new OperatorNode('*', 'multiply', [new OperatorNode('^', 'pow', [_arg.clone(), _arg2.clone()]), new OperatorNode('+', 'add', [new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), new OperatorNode('/', 'divide', [_arg2.clone(), _arg.clone()])]), new OperatorNode('*', 'multiply', [_derivative(_arg2, constNodes), new FunctionNode('log', [_arg.clone()])])])]);
+      }
+
+      throw new Error('Operator "' + node.op + '" is not supported by derivative, or a wrong number of arguments is passed');
+    }
+  });
+  /**
+   * Ensures the number of arguments for a function are correct,
+   * and will throw an error otherwise.
+   *
+   * @param {FunctionNode} node
+   */
+
+
+  function funcArgsCheck(node) {
+    // TODO add min, max etc
+    if ((node.name === 'log' || node.name === 'nthRoot' || node.name === 'pow') && node.args.length === 2) {
+      return;
+    } // There should be an incorrect number of arguments if we reach here
+    // Change all args to constants to avoid unidentified
+    // symbol error when compiling function
+
+
+    for (var i = 0; i < node.args.length; ++i) {
+      node.args[i] = createConstantNode(0);
+    }
+
+    node.compile().evaluate();
+    throw new Error('Expected TypeError, but none found');
+  }
+  /**
+   * Helper function to create a constant node with a specific type
+   * (number, BigNumber, Fraction)
+   * @param {number} value
+   * @param {string} [valueType]
+   * @return {ConstantNode}
+   */
+
+
+  function createConstantNode(value, valueType) {
+    return new ConstantNode(numeric(value, valueType || config.number));
+  }
+
+  return derivative;
+});
+exports.createDerivative = createDerivative;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/leafCount.js b/node_modules/mathjs/lib/cjs/function/algebra/leafCount.js
new file mode 100644
index 0000000..27d28f3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/leafCount.js
@@ -0,0 +1,66 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLeafCount = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'leafCount';
+var dependencies = ['parse', 'typed'];
+var createLeafCount = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var parse = _ref.parse,
+      typed = _ref.typed;
+
+  // This does the real work, but we don't have to recurse through
+  // a typed call if we separate it out
+  function countLeaves(node) {
+    var count = 0;
+    node.forEach(function (n) {
+      count += countLeaves(n);
+    });
+    return count || 1;
+  }
+  /**
+   * Gives the number of "leaf nodes" in the parse tree of the given expression
+   * A leaf node is one that has no subexpressions, essentially either a
+   * symbol or a constant. Note that `5!` has just one leaf, the '5'; the
+   * unary factorial operator does not add a leaf. On the other hand,
+   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.
+   *
+   * The `simplify()` function should generally not increase the `leafCount()`
+   * of an expression, although currently there is no guarantee that it never
+   * does so. In many cases, `simplify()` reduces the leaf count.
+   *
+   * Syntax:
+   *
+   *     leafCount(expr)
+   *
+   * Examples:
+   *
+   *     math.leafCount('x') // 1
+   *     math.leafCount(math.parse('a*d-b*c')) // 4
+   *     math.leafCount('[a,b;c,d][0,1]') // 6
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param {Node|string} expr    The expression to count the leaves of
+   *
+   * @return {number}  The number of leaves of `expr`
+   *
+   */
+
+
+  return typed(name, {
+    string: function string(expr) {
+      return this(parse(expr));
+    },
+    Node: function Node(expr) {
+      return countLeaves(expr);
+    }
+  });
+});
+exports.createLeafCount = createLeafCount;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/rationalize.js b/node_modules/mathjs/lib/cjs/function/algebra/rationalize.js
new file mode 100644
index 0000000..bd3c3ab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/rationalize.js
@@ -0,0 +1,878 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRationalize = void 0;
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _simplifyConstant = require("./simplify/simplifyConstant.js");
+
+var name = 'rationalize';
+var dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplifyCore', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode', 'ParenthesisNode'];
+var createRationalize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var config = _ref.config,
+      typed = _ref.typed,
+      equal = _ref.equal,
+      isZero = _ref.isZero,
+      add = _ref.add,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply,
+      divide = _ref.divide,
+      pow = _ref.pow,
+      parse = _ref.parse,
+      simplifyCore = _ref.simplifyCore,
+      simplify = _ref.simplify,
+      fraction = _ref.fraction,
+      bignumber = _ref.bignumber,
+      mathWithTransform = _ref.mathWithTransform,
+      matrix = _ref.matrix,
+      AccessorNode = _ref.AccessorNode,
+      ArrayNode = _ref.ArrayNode,
+      ConstantNode = _ref.ConstantNode,
+      FunctionNode = _ref.FunctionNode,
+      IndexNode = _ref.IndexNode,
+      ObjectNode = _ref.ObjectNode,
+      OperatorNode = _ref.OperatorNode,
+      SymbolNode = _ref.SymbolNode,
+      ParenthesisNode = _ref.ParenthesisNode;
+  var simplifyConstant = (0, _simplifyConstant.createSimplifyConstant)({
+    typed: typed,
+    config: config,
+    mathWithTransform: mathWithTransform,
+    matrix: matrix,
+    fraction: fraction,
+    bignumber: bignumber,
+    AccessorNode: AccessorNode,
+    ArrayNode: ArrayNode,
+    ConstantNode: ConstantNode,
+    FunctionNode: FunctionNode,
+    IndexNode: IndexNode,
+    ObjectNode: ObjectNode,
+    OperatorNode: OperatorNode,
+    SymbolNode: SymbolNode
+  });
+  /**
+   * Transform a rationalizable expression in a rational fraction.
+   * If rational fraction is one variable polynomial then converts
+   * the numerator and denominator in canonical form, with decreasing
+   * exponents, returning the coefficients of numerator.
+   *
+   * Syntax:
+   *
+   *     rationalize(expr)
+   *     rationalize(expr, detailed)
+   *     rationalize(expr, scope)
+   *     rationalize(expr, scope, detailed)
+   *
+   * Examples:
+   *
+   *     math.rationalize('sin(x)+y')
+   *                   //  Error: There is an unsolved function call
+   *     math.rationalize('2x/y - y/(x+1)')
+   *                   // (2*x^2-y^2+2*x)/(x*y+y)
+   *     math.rationalize('(2x+1)^6')
+   *                   // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1
+   *     math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')
+   *                   // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)
+   *     math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =
+   *                   // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/
+   *                   //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)
+   *
+   *     math.rationalize('x+x+x+y',{y:1}) // 3*x+1
+   *     math.rationalize('x+x+x+y',{})    // 3*x+y
+   *
+   *     const ret = math.rationalize('x+x+x+y',{},true)
+   *                   // ret.expression=3*x+y, ret.variables = ["x","y"]
+   *     const ret = math.rationalize('-2+5x^2',{},true)
+   *                   // ret.expression=5*x^2-2, ret.variables = ["x"], ret.coefficients=[-2,0,5]
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param  {Node|string} expr    The expression to check if is a polynomial expression
+   * @param  {Object|boolean}      optional scope of expression or true for already evaluated rational expression at input
+   * @param  {Boolean}  detailed   optional True if return an object, false if return expression node (default)
+   *
+   * @return {Object | Node}    The rational polynomial of `expr` or an object
+   *            `{expression, numerator, denominator, variables, coefficients}`, where
+   *              `expression` is a `Node` with the node simplified expression,
+   *              `numerator` is a `Node` with the simplified numerator of expression,
+   *              `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator),
+   *              `variables` is an array with variable names,
+   *              and `coefficients` is an array with coefficients of numerator sorted by increased exponent
+   *           {Expression Node}  node simplified expression
+   *
+   */
+
+  return typed(name, {
+    string: function string(expr) {
+      return this(parse(expr), {}, false);
+    },
+    'string, boolean': function stringBoolean(expr, detailed) {
+      return this(parse(expr), {}, detailed);
+    },
+    'string, Object': function stringObject(expr, scope) {
+      return this(parse(expr), scope, false);
+    },
+    'string, Object, boolean': function stringObjectBoolean(expr, scope, detailed) {
+      return this(parse(expr), scope, detailed);
+    },
+    Node: function Node(expr) {
+      return this(expr, {}, false);
+    },
+    'Node, boolean': function NodeBoolean(expr, detailed) {
+      return this(expr, {}, detailed);
+    },
+    'Node, Object': function NodeObject(expr, scope) {
+      return this(expr, scope, false);
+    },
+    'Node, Object, boolean': function NodeObjectBoolean(expr, scope, detailed) {
+      var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form
+
+      var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial
+
+      var nVars = polyRet.variables.length;
+      var noExactFractions = {
+        exactFractions: false
+      };
+      var withExactFractions = {
+        exactFractions: true
+      };
+      expr = polyRet.expression;
+
+      if (nVars >= 1) {
+        // If expression in not a constant
+        expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)
+
+        var sBefore; // Previous expression
+
+        var rules;
+        var eDistrDiv = true;
+        var redoInic = false; // Apply the initial rules, including succ div rules:
+
+        expr = simplify(expr, setRules.firstRules, {}, noExactFractions);
+        var s;
+
+        while (true) {
+          // Alternate applying successive division rules and distr.div.rules
+          // until there are no more changes:
+          rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;
+          expr = simplify(expr, rules, {}, withExactFractions);
+          eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules
+
+          s = expr.toString();
+
+          if (s === sBefore) {
+            break; // No changes : end of the loop
+          }
+
+          redoInic = true;
+          sBefore = s;
+        }
+
+        if (redoInic) {
+          // Apply first rules again without succ div rules (if there are changes)
+          expr = simplify(expr, setRules.firstRulesAgain, {}, noExactFractions);
+        } // Apply final rules:
+
+
+        expr = simplify(expr, setRules.finalRules, {}, noExactFractions);
+      } // NVars >= 1
+
+
+      var coefficients = [];
+      var retRationalize = {};
+
+      if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {
+        // Separate numerator from denominator
+        if (nVars === 1) {
+          expr.args[0] = polyToCanonical(expr.args[0], coefficients);
+          expr.args[1] = polyToCanonical(expr.args[1]);
+        }
+
+        if (detailed) {
+          retRationalize.numerator = expr.args[0];
+          retRationalize.denominator = expr.args[1];
+        }
+      } else {
+        if (nVars === 1) {
+          expr = polyToCanonical(expr, coefficients);
+        }
+
+        if (detailed) {
+          retRationalize.numerator = expr;
+          retRationalize.denominator = null;
+        }
+      } // nVars
+
+
+      if (!detailed) return expr;
+      retRationalize.coefficients = coefficients;
+      retRationalize.variables = polyRet.variables;
+      retRationalize.expression = expr;
+      return retRationalize;
+    } // ^^^^^^^ end of rationalize ^^^^^^^^
+
+  }); // end of typed rationalize
+
+  /**
+   *  Function to simplify an expression using an optional scope and
+   *  return it if the expression is a polynomial expression, i.e.
+   *  an expression with one or more variables and the operators
+   *  +, -, *, and ^, where the exponent can only be a positive integer.
+   *
+   * Syntax:
+   *
+   *     polynomial(expr,scope,extended, rules)
+   *
+   * @param  {Node | string} expr     The expression to simplify and check if is polynomial expression
+   * @param  {object} scope           Optional scope for expression simplification
+   * @param  {boolean} extended       Optional. Default is false. When true allows divide operator.
+   * @param  {array}  rules           Optional. Default is no rule.
+   *
+   *
+   * @return {Object}
+   *            {Object} node:   node simplified expression
+   *            {Array}  variables:  variable names
+   */
+
+  function polynomial(expr, scope, extended, rules) {
+    var variables = [];
+    var node = simplify(expr, rules, scope, {
+      exactFractions: false
+    }); // Resolves any variables and functions with all defined parameters
+
+    extended = !!extended;
+    var oper = '+-*' + (extended ? '/' : '');
+    recPoly(node);
+    var retFunc = {};
+    retFunc.expression = node;
+    retFunc.variables = variables;
+    return retFunc; // -------------------------------------------------------------------------------------------------------
+
+    /**
+     *  Function to simplify an expression using an optional scope and
+     *  return it if the expression is a polynomial expression, i.e.
+     *  an expression with one or more variables and the operators
+     *  +, -, *, and ^, where the exponent can only be a positive integer.
+     *
+     * Syntax:
+     *
+     *     recPoly(node)
+     *
+     *
+     * @param  {Node} node               The current sub tree expression in recursion
+     *
+     * @return                           nothing, throw an exception if error
+     */
+
+    function recPoly(node) {
+      var tp = node.type; // node type
+
+      if (tp === 'FunctionNode') {
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        if (node.op === '^') {
+          // TODO: handle negative exponents like in '1/x^(-2)'
+          if (node.args[1].type !== 'ConstantNode' || !(0, _number.isInteger)(parseFloat(node.args[1].value))) {
+            throw new Error('There is a non-integer exponent');
+          } else {
+            recPoly(node.args[0]);
+          }
+        } else {
+          if (oper.indexOf(node.op) === -1) {
+            throw new Error('Operator ' + node.op + ' invalid in polynomial expression');
+          }
+
+          for (var i = 0; i < node.args.length; i++) {
+            recPoly(node.args[i]);
+          }
+        } // type of operator
+
+      } else if (tp === 'SymbolNode') {
+        var _name = node.name; // variable name
+
+        var pos = variables.indexOf(_name);
+
+        if (pos === -1) {
+          // new variable in expression
+          variables.push(_name);
+        }
+      } else if (tp === 'ParenthesisNode') {
+        recPoly(node.content);
+      } else if (tp !== 'ConstantNode') {
+        throw new Error('type ' + tp + ' is not allowed in polynomial expression');
+      }
+    } // end of recPoly
+
+  } // end of polynomial
+  // ---------------------------------------------------------------------------------------
+
+  /**
+   * Return a rule set to rationalize an polynomial expression in rationalize
+   *
+   * Syntax:
+   *
+   *     rulesRationalize()
+   *
+   * @return {array}        rule set to rationalize an polynomial expression
+   */
+
+
+  function rulesRationalize() {
+    var oldRules = [simplifyCore, // sCore
+    {
+      l: 'n+n',
+      r: '2*n'
+    }, {
+      l: 'n+-n',
+      r: '0'
+    }, simplifyConstant, // sConstant
+    {
+      l: 'n*(n1^-1)',
+      r: 'n/n1'
+    }, {
+      l: 'n*n1^-n2',
+      r: 'n/n1^n2'
+    }, {
+      l: 'n1^-1',
+      r: '1/n1'
+    }, {
+      l: 'n*(n1/n2)',
+      r: '(n*n1)/n2'
+    }, {
+      l: '1*n',
+      r: 'n'
+    }];
+    var rulesFirst = [{
+      l: '(-n1)/(-n2)',
+      r: 'n1/n2'
+    }, // Unary division
+    {
+      l: '(-n1)*(-n2)',
+      r: 'n1*n2'
+    }, // Unary multiplication
+    {
+      l: 'n1--n2',
+      r: 'n1+n2'
+    }, // '--' elimination
+    {
+      l: 'n1-n2',
+      r: 'n1+(-n2)'
+    }, // Subtraction turn into add with un�ry minus
+    {
+      l: '(n1+n2)*n3',
+      r: '(n1*n3 + n2*n3)'
+    }, // Distributive 1
+    {
+      l: 'n1*(n2+n3)',
+      r: '(n1*n2+n1*n3)'
+    }, // Distributive 2
+    {
+      l: 'c1*n + c2*n',
+      r: '(c1+c2)*n'
+    }, // Joining constants
+    {
+      l: 'c1*n + n',
+      r: '(c1+1)*n'
+    }, // Joining constants
+    {
+      l: 'c1*n - c2*n',
+      r: '(c1-c2)*n'
+    }, // Joining constants
+    {
+      l: 'c1*n - n',
+      r: '(c1-1)*n'
+    }, // Joining constants
+    {
+      l: 'v/c',
+      r: '(1/c)*v'
+    }, // variable/constant (new!)
+    {
+      l: 'v/-c',
+      r: '-(1/c)*v'
+    }, // variable/constant (new!)
+    {
+      l: '-v*-c',
+      r: 'c*v'
+    }, // Inversion constant and variable 1
+    {
+      l: '-v*c',
+      r: '-c*v'
+    }, // Inversion constant and variable 2
+    {
+      l: 'v*-c',
+      r: '-c*v'
+    }, // Inversion constant and variable 3
+    {
+      l: 'v*c',
+      r: 'c*v'
+    }, // Inversion constant and variable 4
+    {
+      l: '-(-n1*n2)',
+      r: '(n1*n2)'
+    }, // Unary propagation
+    {
+      l: '-(n1*n2)',
+      r: '(-n1*n2)'
+    }, // Unary propagation
+    {
+      l: '-(-n1+n2)',
+      r: '(n1-n2)'
+    }, // Unary propagation
+    {
+      l: '-(n1+n2)',
+      r: '(-n1-n2)'
+    }, // Unary propagation
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    }, // Power to Power
+    {
+      l: '-(-n1/n2)',
+      r: '(n1/n2)'
+    }, // Division and Unary
+    {
+      l: '-(n1/n2)',
+      r: '(-n1/n2)'
+    }]; // Divisao and Unary
+
+    var rulesDistrDiv = [{
+      l: '(n1/n2 + n3/n4)',
+      r: '((n1*n4 + n3*n2)/(n2*n4))'
+    }, // Sum of fractions
+    {
+      l: '(n1/n2 + n3)',
+      r: '((n1 + n3*n2)/n2)'
+    }, // Sum fraction with number 1
+    {
+      l: '(n1 + n2/n3)',
+      r: '((n1*n3 + n2)/n3)'
+    }]; // Sum fraction with number 1
+
+    var rulesSucDiv = [{
+      l: '(n1/(n2/n3))',
+      r: '((n1*n3)/n2)'
+    }, // Division simplification
+    {
+      l: '(n1/n2/n3)',
+      r: '(n1/(n2*n3))'
+    }];
+    var setRules = {}; // rules set in 4 steps.
+    // All rules => infinite loop
+    // setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)
+
+    setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv); // First rule set
+
+    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules
+
+    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules
+
+    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.
+    // Division simplification
+    // Second rule set.
+    // There is no aggregate expression with parentesis, but the only variable can be scattered.
+
+    setRules.finalRules = [simplifyCore, // simplify.rules[0]
+    {
+      l: 'n*-n',
+      r: '-n^2'
+    }, // Joining multiply with power 1
+    {
+      l: 'n*n',
+      r: 'n^2'
+    }, // Joining multiply with power 2
+    simplifyConstant, // simplify.rules[14] old 3rd index in oldRules
+    {
+      l: 'n*-n^n1',
+      r: '-n^(n1+1)'
+    }, // Joining multiply with power 3
+    {
+      l: 'n*n^n1',
+      r: 'n^(n1+1)'
+    }, // Joining multiply with power 4
+    {
+      l: 'n^n1*-n^n2',
+      r: '-n^(n1+n2)'
+    }, // Joining multiply with power 5
+    {
+      l: 'n^n1*n^n2',
+      r: 'n^(n1+n2)'
+    }, // Joining multiply with power 6
+    {
+      l: 'n^n1*-n',
+      r: '-n^(n1+1)'
+    }, // Joining multiply with power 7
+    {
+      l: 'n^n1*n',
+      r: 'n^(n1+1)'
+    }, // Joining multiply with power 8
+    {
+      l: 'n^n1/-n',
+      r: '-n^(n1-1)'
+    }, // Joining multiply with power 8
+    {
+      l: 'n^n1/n',
+      r: 'n^(n1-1)'
+    }, // Joining division with power 1
+    {
+      l: 'n/-n^n1',
+      r: '-n^(1-n1)'
+    }, // Joining division with power 2
+    {
+      l: 'n/n^n1',
+      r: 'n^(1-n1)'
+    }, // Joining division with power 3
+    {
+      l: 'n^n1/-n^n2',
+      r: 'n^(n1-n2)'
+    }, // Joining division with power 4
+    {
+      l: 'n^n1/n^n2',
+      r: 'n^(n1-n2)'
+    }, // Joining division with power 5
+    {
+      l: 'n1+(-n2*n3)',
+      r: 'n1-n2*n3'
+    }, // Solving useless parenthesis 1
+    {
+      l: 'v*(-c)',
+      r: '-c*v'
+    }, // Solving useless unary 2
+    {
+      l: 'n1+-n2',
+      r: 'n1-n2'
+    }, // Solving +- together (new!)
+    {
+      l: 'v*c',
+      r: 'c*v'
+    }, // inversion constant with variable
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    } // Power to Power
+    ];
+    return setRules;
+  } // End rulesRationalize
+  // ---------------------------------------------------------------------------------------
+
+  /**
+   *  Expand recursively a tree node for handling with expressions with exponents
+   *  (it's not for constants, symbols or functions with exponents)
+   *  PS: The other parameters are internal for recursion
+   *
+   * Syntax:
+   *
+   *     expandPower(node)
+   *
+   * @param  {Node} node         Current expression node
+   * @param  {node} parent       Parent current node inside the recursion
+   * @param  (int}               Parent number of chid inside the rercursion
+   *
+   * @return {node}        node expression with all powers expanded.
+   */
+
+
+  function expandPower(node, parent, indParent) {
+    var tp = node.type;
+    var internal = arguments.length > 1; // TRUE in internal calls
+
+    if (tp === 'OperatorNode' && node.isBinary()) {
+      var does = false;
+      var val;
+
+      if (node.op === '^') {
+        // First operator: Parenthesis or UnaryMinus
+        if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {
+          // Second operator: Constant
+          val = parseFloat(node.args[1].value);
+          does = val >= 2 && (0, _number.isInteger)(val);
+        }
+      }
+
+      if (does) {
+        // Exponent >= 2
+        // Before:
+        //            operator A --> Subtree
+        // parent pow
+        //            constant
+        //
+        if (val > 2) {
+          // Exponent > 2,
+          // AFTER:  (exponent > 2)
+          //             operator A --> Subtree
+          // parent  *
+          //                 deep clone (operator A --> Subtree
+          //             pow
+          //                 constant - 1
+          //
+          var nEsqTopo = node.args[0];
+          var nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);
+          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);
+        } else {
+          // Expo = 2 - no power
+          // AFTER:  (exponent =  2)
+          //             operator A --> Subtree
+          // parent   oper
+          //            deep clone (operator A --> Subtree)
+          //
+          node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()]);
+        }
+
+        if (internal) {
+          // Change parent references in internal recursive calls
+          if (indParent === 'content') {
+            parent.content = node;
+          } else {
+            parent.args[indParent] = node;
+          }
+        }
+      } // does
+
+    } // binary OperatorNode
+
+
+    if (tp === 'ParenthesisNode') {
+      // Recursion
+      expandPower(node.content, node, 'content');
+    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {
+      for (var i = 0; i < node.args.length; i++) {
+        expandPower(node.args[i], node, i);
+      }
+    }
+
+    if (!internal) {
+      // return the root node
+      return node;
+    }
+  } // End expandPower
+  // ---------------------------------------------------------------------------------------
+
+  /**
+   * Auxilary function for rationalize
+   * Convert near canonical polynomial in one variable in a canonical polynomial
+   * with one term for each exponent in decreasing order
+   *
+   * Syntax:
+   *
+   *     polyToCanonical(node [, coefficients])
+   *
+   * @param  {Node | string} expr       The near canonical polynomial expression to convert in a a canonical polynomial expression
+   *
+   *        The string or tree expression needs to be at below syntax, with free spaces:
+   *         (  (^(-)? | [+-]? )cte (*)? var (^expo)?  | cte )+
+   *       Where 'var' is one variable with any valid name
+   *             'cte' are real numeric constants with any value. It can be omitted if equal than 1
+   *             'expo' are integers greater than 0. It can be omitted if equal than 1.
+   *
+   * @param  {array}   coefficients             Optional returns coefficients sorted by increased exponent
+   *
+   *
+   * @return {node}        new node tree with one variable polynomial or string error.
+   */
+
+
+  function polyToCanonical(node, coefficients) {
+    if (coefficients === undefined) {
+      coefficients = [];
+    } // coefficients.
+
+
+    coefficients[0] = 0; // index is the exponent
+
+    var o = {};
+    o.cte = 1;
+    o.oper = '+'; // fire: mark with * or ^ when finds * or ^ down tree, reset to "" with + and -.
+    //       It is used to deduce the exponent: 1 for *, 0 for "".
+
+    o.fire = '';
+    var maxExpo = 0; // maximum exponent
+
+    var varname = ''; // variable name
+
+    recurPol(node, null, o);
+    maxExpo = coefficients.length - 1;
+    var first = true;
+    var no;
+
+    for (var i = maxExpo; i >= 0; i--) {
+      if (coefficients[i] === 0) continue;
+      var n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));
+      var op = coefficients[i] < 0 ? '-' : '+';
+
+      if (i > 0) {
+        // Is not a constant without variable
+        var n2 = new SymbolNode(varname);
+
+        if (i > 1) {
+          var n3 = new ConstantNode(i);
+          n2 = new OperatorNode('^', 'pow', [n2, n3]);
+        }
+
+        if (coefficients[i] === -1 && first) {
+          n1 = new OperatorNode('-', 'unaryMinus', [n2]);
+        } else if (Math.abs(coefficients[i]) === 1) {
+          n1 = n2;
+        } else {
+          n1 = new OperatorNode('*', 'multiply', [n1, n2]);
+        }
+      }
+
+      if (first) {
+        no = n1;
+      } else if (op === '+') {
+        no = new OperatorNode('+', 'add', [no, n1]);
+      } else {
+        no = new OperatorNode('-', 'subtract', [no, n1]);
+      }
+
+      first = false;
+    } // for
+
+
+    if (first) {
+      return new ConstantNode(0);
+    } else {
+      return no;
+    }
+    /**
+     * Recursive auxilary function inside polyToCanonical for
+     * converting expression in canonical form
+     *
+     * Syntax:
+     *
+     *     recurPol(node, noPai, obj)
+     *
+     * @param  {Node} node        The current subpolynomial expression
+     * @param  {Node | Null}  noPai   The current parent node
+     * @param  {object}    obj        Object with many internal flags
+     *
+     * @return {}                    No return. If error, throws an exception
+     */
+
+
+    function recurPol(node, noPai, o) {
+      var tp = node.type;
+
+      if (tp === 'FunctionNode') {
+        // ***** FunctionName *****
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        // ***** OperatorName *****
+        if ('+-*^'.indexOf(node.op) === -1) throw new Error('Operator ' + node.op + ' invalid');
+
+        if (noPai !== null) {
+          // -(unary),^  : children of *,+,-
+          if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          } // -,+,* : children of +,-
+
+
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          } // -,+ : first child
+
+
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+        } // Has parent
+        // Firers: ^,*       Old:   ^,&,-(unary): firers
+
+
+        if (node.op === '^' || node.op === '*') {
+          o.fire = node.op;
+        }
+
+        for (var _i = 0; _i < node.args.length; _i++) {
+          // +,-: reset fire
+          if (node.fn === 'unaryMinus') o.oper = '-';
+
+          if (node.op === '+' || node.fn === 'subtract') {
+            o.fire = '';
+            o.cte = 1; // default if there is no constant
+
+            o.oper = _i === 0 ? '+' : node.op;
+          }
+
+          o.noFil = _i; // number of son
+
+          recurPol(node.args[_i], node, o);
+        } // for in children
+
+      } else if (tp === 'SymbolNode') {
+        // ***** SymbolName *****
+        if (node.name !== varname && varname !== '') {
+          throw new Error('There is more than one variable');
+        }
+
+        varname = node.name;
+
+        if (noPai === null) {
+          coefficients[1] = 1;
+          return;
+        } // ^: Symbol is First child
+
+
+        if (noPai.op === '^' && o.noFil !== 0) {
+          throw new Error('In power the variable should be the first parameter');
+        } // *: Symbol is Second child
+
+
+        if (noPai.op === '*' && o.noFil !== 1) {
+          throw new Error('In multiply the variable should be the second parameter');
+        } // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)
+
+
+        if (o.fire === '' || o.fire === '*') {
+          if (maxExpo < 1) coefficients[1] = 0;
+          coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(1, maxExpo);
+        }
+      } else if (tp === 'ConstantNode') {
+        var valor = parseFloat(node.value);
+
+        if (noPai === null) {
+          coefficients[0] = valor;
+          return;
+        }
+
+        if (noPai.op === '^') {
+          // cte: second  child of power
+          if (o.noFil !== 1) throw new Error('Constant cannot be powered');
+
+          if (!(0, _number.isInteger)(valor) || valor <= 0) {
+            throw new Error('Non-integer exponent is not allowed');
+          }
+
+          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) {
+            coefficients[_i2] = 0;
+          }
+
+          if (valor > maxExpo) coefficients[valor] = 0;
+          coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(valor, maxExpo);
+          return;
+        }
+
+        o.cte = valor; // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.
+
+        if (o.fire === '') {
+          coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);
+        }
+      } else {
+        throw new Error('Type ' + tp + ' is not allowed');
+      }
+    } // End of recurPol
+
+  } // End of polyToCanonical
+
+});
+exports.createRationalize = createRationalize;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/resolve.js b/node_modules/mathjs/lib/cjs/function/algebra/resolve.js
new file mode 100644
index 0000000..92aeb11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/resolve.js
@@ -0,0 +1,106 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createResolve = void 0;
+
+var _map = require("../../utils/map.js");
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'resolve';
+var dependencies = ['parse', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];
+var createResolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var parse = _ref.parse,
+      ConstantNode = _ref.ConstantNode,
+      FunctionNode = _ref.FunctionNode,
+      OperatorNode = _ref.OperatorNode,
+      ParenthesisNode = _ref.ParenthesisNode;
+
+  /**
+   * resolve(expr, scope) replaces variable nodes with their scoped values
+   *
+   * Syntax:
+   *
+   *     resolve(expr, scope)
+   *
+   * Examples:
+   *
+   *     math.resolve('x + y', {x:1, y:2})           // Node {1 + 2}
+   *     math.resolve(math.parse('x+y'), {x:1, y:2}) // Node {1 + 2}
+   *     math.simplify('x+y', {x:2, y:'x+x'}).toString()      // "6"
+   *
+   * See also:
+   *
+   *     simplify, evaluate
+   *
+   * @param {Node} node
+   *     The expression tree to be simplified
+   * @param {Object} scope
+   *     Scope specifying variables to be resolved
+   * @return {Node} Returns `node` with variables recursively substituted.
+   * @throws {ReferenceError}
+   *     If there is a cyclic dependency among the variables in `scope`,
+   *     resolution is impossible and a ReferenceError is thrown.
+   */
+  function resolve(node, scope) {
+    var within = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : new Set();
+
+    // note `within`:
+    // `within` is not documented, since it is for internal cycle
+    // detection only
+    if (!scope) {
+      return node;
+    }
+
+    if (!(0, _map.isMap)(scope)) {
+      scope = (0, _map.createMap)(scope);
+    }
+
+    if ((0, _is.isSymbolNode)(node)) {
+      if (within.has(node.name)) {
+        var variables = Array.from(within).join(', ');
+        throw new ReferenceError("recursive loop of variable definitions among {".concat(variables, "}"));
+      }
+
+      var value = scope.get(node.name);
+
+      if ((0, _is.isNode)(value)) {
+        var nextWithin = new Set(within);
+        nextWithin.add(node.name);
+        return resolve(value, scope, nextWithin);
+      } else if (typeof value === 'number') {
+        return parse(String(value));
+      } else if (value !== undefined) {
+        return new ConstantNode(value);
+      } else {
+        return node;
+      }
+    } else if ((0, _is.isOperatorNode)(node)) {
+      var args = node.args.map(function (arg) {
+        return resolve(arg, scope, within);
+      });
+      return new OperatorNode(node.op, node.fn, args, node.implicit);
+    } else if ((0, _is.isParenthesisNode)(node)) {
+      return new ParenthesisNode(resolve(node.content, scope, within));
+    } else if ((0, _is.isFunctionNode)(node)) {
+      var _args = node.args.map(function (arg) {
+        return resolve(arg, scope, within);
+      });
+
+      return new FunctionNode(node.name, _args);
+    } // Otherwise just recursively resolve any children (might also work
+    // for some of the above special cases)
+
+
+    return node.map(function (child) {
+      return resolve(child, scope, within);
+    });
+  }
+
+  return resolve;
+});
+exports.createResolve = createResolve;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplify.js b/node_modules/mathjs/lib/cjs/function/algebra/simplify.js
new file mode 100644
index 0000000..95053bd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplify.js
@@ -0,0 +1,1264 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSimplify = void 0;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _util = require("./simplify/util.js");
+
+var _simplifyConstant = require("./simplify/simplifyConstant.js");
+
+var _object = require("../../utils/object.js");
+
+var _map = require("../../utils/map.js");
+
+var name = 'simplify';
+var dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', 'resolve', 'simplifyCore', '?fraction', '?bignumber', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var config = _ref.config,
+      typed = _ref.typed,
+      parse = _ref.parse,
+      add = _ref.add,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply,
+      divide = _ref.divide,
+      pow = _ref.pow,
+      isZero = _ref.isZero,
+      equal = _ref.equal,
+      resolve = _ref.resolve,
+      simplifyCore = _ref.simplifyCore,
+      fraction = _ref.fraction,
+      bignumber = _ref.bignumber,
+      mathWithTransform = _ref.mathWithTransform,
+      matrix = _ref.matrix,
+      AccessorNode = _ref.AccessorNode,
+      ArrayNode = _ref.ArrayNode,
+      ConstantNode = _ref.ConstantNode,
+      FunctionNode = _ref.FunctionNode,
+      IndexNode = _ref.IndexNode,
+      ObjectNode = _ref.ObjectNode,
+      OperatorNode = _ref.OperatorNode,
+      ParenthesisNode = _ref.ParenthesisNode,
+      SymbolNode = _ref.SymbolNode;
+  var simplifyConstant = (0, _simplifyConstant.createSimplifyConstant)({
+    typed: typed,
+    config: config,
+    mathWithTransform: mathWithTransform,
+    matrix: matrix,
+    fraction: fraction,
+    bignumber: bignumber,
+    AccessorNode: AccessorNode,
+    ArrayNode: ArrayNode,
+    ConstantNode: ConstantNode,
+    FunctionNode: FunctionNode,
+    IndexNode: IndexNode,
+    ObjectNode: ObjectNode,
+    OperatorNode: OperatorNode,
+    SymbolNode: SymbolNode
+  });
+
+  var _createUtil = (0, _util.createUtil)({
+    FunctionNode: FunctionNode,
+    OperatorNode: OperatorNode,
+    SymbolNode: SymbolNode
+  }),
+      hasProperty = _createUtil.hasProperty,
+      isCommutative = _createUtil.isCommutative,
+      isAssociative = _createUtil.isAssociative,
+      mergeContext = _createUtil.mergeContext,
+      flatten = _createUtil.flatten,
+      unflattenr = _createUtil.unflattenr,
+      unflattenl = _createUtil.unflattenl,
+      createMakeNodeFunction = _createUtil.createMakeNodeFunction,
+      defaultContext = _createUtil.defaultContext,
+      realContext = _createUtil.realContext,
+      positiveContext = _createUtil.positiveContext;
+  /**
+   * Simplify an expression tree.
+   *
+   * A list of rules are applied to an expression, repeating over the list until
+   * no further changes are made.
+   * It's possible to pass a custom set of rules to the function as second
+   * argument. A rule can be specified as an object, string, or function:
+   *
+   *     const rules = [
+   *       { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },
+   *       'n1*n3 + n2*n3 -> (n1+n2)*n3',
+   *       function (node) {
+   *         // ... return a new node or return the node unchanged
+   *         return node
+   *       }
+   *     ]
+   *
+   * String and object rules consist of a left and right pattern. The left is
+   * used to match against the expression and the right determines what matches
+   * are replaced with. The main difference between a pattern and a normal
+   * expression is that variables starting with the following characters are
+   * interpreted as wildcards:
+   *
+   * - 'n' - matches any Node
+   * - 'c' - matches any ConstantNode
+   * - 'v' - matches any Node that is not a ConstantNode
+   *
+   * The default list of rules is exposed on the function as `simplify.rules`
+   * and can be used as a basis to built a set of custom rules.
+   *
+   * To specify a rule as a string, separate the left and right pattern by '->'
+   * When specifying a rule as an object, the following keys are meaningful:
+   * - l - the left pattern
+   * - r - the right pattern
+   * - s - in lieu of l and r, the string form that is broken at -> to give them
+   * - repeat - whether to repeat this rule until the expression stabilizes
+   * - assuming - gives a context object, as in the 'context' option to
+   *     simplify. Every property in the context object must match the current
+   *     context in order, or else the rule will not be applied.
+   * - imposeContext - gives a context object, as in the 'context' option to
+   *     simplify. Any settings specified will override the incoming context
+   *     for all matches of this rule.
+   *
+   * For more details on the theory, see:
+   *
+   * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
+   * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
+   *
+   *  An optional `options` argument can be passed as last argument of `simplify`.
+   *  Currently available options (defaults in parentheses):
+   *  - `consoleDebug` (false): whether to write the expression being simplified
+   *    and any changes to it, along with the rule responsible, to console
+   *  - `context` (simplify.defaultContext): an object giving properties of
+   *    each operator, which determine what simplifications are allowed. The
+   *    currently meaningful properties are commutative, associative,
+   *    total (whether the operation is defined for all arguments), and
+   *    trivial (whether the operation applied to a single argument leaves
+   *    that argument unchanged). The default context is very permissive and
+   *    allows almost all simplifications. Only properties differing from
+   *    the default need to be specified; the default context is used as a
+   *    fallback. Additional contexts `simplify.realContext` and
+   *    `simplify.positiveContext` are supplied to cause simplify to perform
+   *    just simplifications guaranteed to preserve all values of the expression
+   *    assuming all variables and subexpressions are real numbers or
+   *    positive real numbers, respectively. (Note that these are in some cases
+   *    more restrictive than the default context; for example, the default
+   *    context will allow `x/x` to simplify to 1, whereas
+   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)
+   *  - `exactFractions` (true): whether to try to convert all constants to
+   *    exact rational numbers.
+   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+   *    be expressed as fractions only when both numerator and denominator
+   *    are smaller than `fractionsLimit`.
+   *
+   * Syntax:
+   *
+   *     simplify(expr)
+   *     simplify(expr, rules)
+   *     simplify(expr, rules)
+   *     simplify(expr, rules, scope)
+   *     simplify(expr, rules, scope, options)
+   *     simplify(expr, scope)
+   *     simplify(expr, scope, options)
+   *
+   * Examples:
+   *
+   *     math.simplify('2 * 1 * x ^ (2 - 1)')      // Node "2 * x"
+   *     math.simplify('2 * 3 * x', {x: 4})        // Node "24"
+   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')
+   *     math.simplify(f)                          // Node "2 * x"
+   *     math.simplify('0.4 * x', {}, {exactFractions: true})  // Node "x * 2 / 5"
+   *     math.simplify('0.4 * x', {}, {exactFractions: false}) // Node "0.4 * x"
+   *
+   * See also:
+   *
+   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve
+   *
+   * @param {Node | string} expr
+   *            The expression to be simplified
+   * @param {Array<{l:string, r: string} | string | function>} [rules]
+   *            Optional list with custom rules
+   * @return {Node} Returns the simplified form of `expr`
+   */
+
+
+  var simplify = typed('simplify', {
+    string: function string(expr) {
+      return this(parse(expr), this.rules, (0, _map.createEmptyMap)(), {});
+    },
+    'string, Map | Object': function stringMapObject(expr, scope) {
+      return this(parse(expr), this.rules, scope, {});
+    },
+    'string, Map | Object, Object': function stringMapObjectObject(expr, scope, options) {
+      return this(parse(expr), this.rules, scope, options);
+    },
+    'string, Array': function stringArray(expr, rules) {
+      return this(parse(expr), rules, (0, _map.createEmptyMap)(), {});
+    },
+    'string, Array, Map | Object': function stringArrayMapObject(expr, rules, scope) {
+      return this(parse(expr), rules, scope, {});
+    },
+    'string, Array, Map | Object, Object': function stringArrayMapObjectObject(expr, rules, scope, options) {
+      return this(parse(expr), rules, scope, options);
+    },
+    'Node, Map | Object': function NodeMapObject(expr, scope) {
+      return this(expr, this.rules, scope, {});
+    },
+    'Node, Map | Object, Object': function NodeMapObjectObject(expr, scope, options) {
+      return this(expr, this.rules, scope, options);
+    },
+    Node: function Node(expr) {
+      return this(expr, this.rules, (0, _map.createEmptyMap)(), {});
+    },
+    'Node, Array': function NodeArray(expr, rules) {
+      return this(expr, rules, (0, _map.createEmptyMap)(), {});
+    },
+    'Node, Array, Map | Object': function NodeArrayMapObject(expr, rules, scope) {
+      return this(expr, rules, scope, {});
+    },
+    'Node, Array, Object, Object': function NodeArrayObjectObject(expr, rules, scope, options) {
+      return this(expr, rules, (0, _map.createMap)(scope), options);
+    },
+    'Node, Array, Map, Object': function NodeArrayMapObject(expr, rules, scope, options) {
+      var debug = options.consoleDebug;
+      rules = _buildRules(rules, options.context);
+      var res = resolve(expr, scope);
+      res = removeParens(res);
+      var visited = {};
+      var str = res.toString({
+        parenthesis: 'all'
+      });
+
+      while (!visited[str]) {
+        visited[str] = true;
+        _lastsym = 0; // counter for placeholder symbols
+
+        var laststr = str;
+        if (debug) console.log('Working on: ', str);
+
+        for (var i = 0; i < rules.length; i++) {
+          var rulestr = '';
+
+          if (typeof rules[i] === 'function') {
+            res = rules[i](res, options);
+            if (debug) rulestr = rules[i].name;
+          } else {
+            flatten(res, options.context);
+            res = applyRule(res, rules[i], options.context);
+
+            if (debug) {
+              rulestr = "".concat(rules[i].l.toString(), " -> ").concat(rules[i].r.toString());
+            }
+          }
+
+          if (debug) {
+            var newstr = res.toString({
+              parenthesis: 'all'
+            });
+
+            if (newstr !== laststr) {
+              console.log('Applying', rulestr, 'produced', newstr);
+              laststr = newstr;
+            }
+          }
+          /* Use left-heavy binary tree internally,
+           * since custom rule functions may expect it
+           */
+
+
+          unflattenl(res, options.context);
+        }
+
+        str = res.toString({
+          parenthesis: 'all'
+        });
+      }
+
+      return res;
+    }
+  });
+  simplify.defaultContext = defaultContext;
+  simplify.realContext = realContext;
+  simplify.positiveContext = positiveContext;
+
+  function removeParens(node) {
+    return node.transform(function (node, path, parent) {
+      return (0, _is.isParenthesisNode)(node) ? removeParens(node.content) : node;
+    });
+  } // All constants that are allowed in rules
+
+
+  var SUPPORTED_CONSTANTS = {
+    true: true,
+    false: true,
+    e: true,
+    i: true,
+    Infinity: true,
+    LN2: true,
+    LN10: true,
+    LOG2E: true,
+    LOG10E: true,
+    NaN: true,
+    phi: true,
+    pi: true,
+    SQRT1_2: true,
+    SQRT2: true,
+    tau: true // null: false,
+    // undefined: false,
+    // version: false,
+
+  }; // Array of strings, used to build the ruleSet.
+  // Each l (left side) and r (right side) are parsed by
+  // the expression parser into a node tree.
+  // Left hand sides are matched to subtrees within the
+  // expression to be parsed and replaced with the right
+  // hand side.
+  // TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])
+  // To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.
+  // It is possible to get into an infinite loop with conflicting rules
+
+  simplify.rules = [simplifyCore, // { l: 'n+0', r: 'n' },     // simplifyCore
+  // { l: 'n^0', r: '1' },     // simplifyCore
+  // { l: '0*n', r: '0' },     // simplifyCore
+  // { l: 'n/n', r: '1'},      // simplifyCore
+  // { l: 'n^1', r: 'n' },     // simplifyCore
+  // { l: '+n1', r:'n1' },     // simplifyCore
+  // { l: 'n--n1', r:'n+n1' }, // simplifyCore
+  {
+    l: 'log(e)',
+    r: '1'
+  }, // temporary rules
+  // Note initially we tend constants to the right because like-term
+  // collection prefers the left, and we would rather collect nonconstants
+  {
+    s: 'n-n1 -> n+-n1',
+    // temporarily replace 'subtract' so we can further flatten the 'add' operator
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n-n -> 0',
+    // partial alternative when we can't always subtract
+    assuming: {
+      subtract: {
+        total: false
+      }
+    }
+  }, {
+    s: '-(c*v) -> v * (-c)',
+    // make non-constant terms positive
+    assuming: {
+      multiply: {
+        commutative: true
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(c*v) -> (-c) * v',
+    // non-commutative version, part 1
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(v*c) -> v * (-c)',
+    // non-commutative version, part 2
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    l: '-(n1/n2)',
+    r: '-n1/n2'
+  }, {
+    l: '-v',
+    r: 'v * (-1)'
+  }, // finish making non-constant terms positive
+  {
+    l: '(n1 + n2)*(-1)',
+    r: 'n1*(-1) + n2*(-1)',
+    repeat: true
+  }, // expand negations to achieve as much sign cancellation as possible
+  {
+    l: 'n/n1^n2',
+    r: 'n*n1^-n2'
+  }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator
+  {
+    l: 'n/n1',
+    r: 'n*n1^-1'
+  }, {
+    s: '(n1*n2)^n3 -> n1^n3 * n2^n3',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, // expand nested exponentiation
+  {
+    s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // 1/(1/n) = n needs 1/n to exist
+
+  }, // collect like factors; into a sum, only do this for nonconstants
+  {
+    l: ' v   * ( v   * n1 + n2)',
+    r: 'v^2       * n1 +  v   * n2'
+  }, {
+    s: ' v   * (v^n4 * n1 + n2)   ->  v^(1+n4)  * n1 +  v   * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // v*1/v = v^(1+-1) needs 1/v
+
+  }, {
+    s: 'v^n3 * ( v   * n1 + n2)   ->  v^(n3+1)  * n1 + v^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    s: 'v^n3 * (v^n4 * n1 + n2)   ->  v^(n3+n4) * n1 + v^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    l: 'n*n',
+    r: 'n^2'
+  }, {
+    s: 'n * n^n1 -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // n*1/n = n^(-1+1) needs 1/n
+
+  }, {
+    s: 'n^n1 * n^n2 -> n^(n1+n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // ditto for n^2*1/n^2
+
+  }, // Unfortunately, to deal with more complicated cancellations, it
+  // becomes necessary to simplify constants twice per pass. It's not
+  // terribly expensive compared to matching rules, so this should not
+  // pose a performance problem.
+  simplifyConstant, // First: before collecting like terms
+  // collect like terms
+  {
+    s: 'n+n -> 2*n',
+    assuming: {
+      add: {
+        total: true
+      }
+    } // 2 = 1 + 1 needs to exist
+
+  }, {
+    l: 'n+-n',
+    r: '0'
+  }, {
+    l: 'v*n + v',
+    r: 'v*(n+1)'
+  }, // NOTE: leftmost position is special:
+  {
+    l: 'n3*n1 + n3*n2',
+    r: 'n3*(n1+n2)'
+  }, // All sub-monomials tried there.
+  {
+    l: 'n3^(-n4)*n1 +   n3  * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)'
+  }, {
+    l: 'n3^(-n4)*n1 + n3^n5 * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)'
+  }, {
+    s: 'n*v + v -> (n+1)*v',
+    // noncommutative additional cases
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    l: 'n*c + c',
+    r: '(n+1)*c'
+  }, {
+    s: 'c*n + c -> c*(n+1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, simplifyConstant, // Second: before returning expressions to "standard form"
+  // make factors positive (and undo 'make non-constant terms positive')
+  {
+    s: '(-n)*n1 -> -(n*n1)',
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n1*(-n) -> -(n1*n)',
+    // in case * non-commutative
+    assuming: {
+      subtract: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
+  }, // final ordering of constants
+  {
+    s: 'c+v -> v+c',
+    assuming: {
+      add: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      add: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'v*c -> c*v',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, // undo temporary rules
+  // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant
+  {
+    l: 'n+-n1',
+    r: 'n-n1'
+  }, // undo replace 'subtract'
+  {
+    s: 'n*(n1^-1) -> n/n1',
+    // undo replace 'divide'; for * commutative
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
+  }, {
+    s: 'n*n1^-n2 -> n/n1^n2',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
+  }, {
+    s: 'n^-1 -> 1/n',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
+  }, {
+    l: 'n^1',
+    r: 'n'
+  }, // can be produced by power cancellation
+  {
+    s: 'n*(n1/n2) -> (n*n1)/n2',
+    // '*' before '/'
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    s: 'n-(n1+n2) -> n-n1-n2',
+    // '-' before '+'
+    assuming: {
+      addition: {
+        associative: true,
+        commutative: true
+      }
+    }
+  }, // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },
+  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },
+  // simplifyConstant can leave an extra factor of 1, which can always
+  // be eliminated, since the identity always commutes
+  {
+    l: '1*n',
+    r: 'n',
+    imposeContext: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: 'n1/(n2/n3) -> (n1*n3)/n2',
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    l: 'n1/(-n2)',
+    r: '-n1/n2'
+  }];
+  /**
+   * Takes any rule object as allowed by the specification in simplify
+   * and puts it in a standard form used by applyRule
+   */
+
+  function _canonicalizeRule(ruleObject, context) {
+    var newRule = {};
+
+    if (ruleObject.s) {
+      var lr = ruleObject.s.split('->');
+
+      if (lr.length === 2) {
+        newRule.l = lr[0];
+        newRule.r = lr[1];
+      } else {
+        throw SyntaxError('Could not parse rule: ' + ruleObject.s);
+      }
+    } else {
+      newRule.l = ruleObject.l;
+      newRule.r = ruleObject.r;
+    }
+
+    newRule.l = removeParens(parse(newRule.l));
+    newRule.r = removeParens(parse(newRule.r));
+
+    for (var _i = 0, _arr = ['imposeContext', 'repeat', 'assuming']; _i < _arr.length; _i++) {
+      var prop = _arr[_i];
+
+      if (prop in ruleObject) {
+        newRule[prop] = ruleObject[prop];
+      }
+    }
+
+    if (ruleObject.evaluate) {
+      newRule.evaluate = parse(ruleObject.evaluate);
+    }
+
+    if (isAssociative(newRule.l, context)) {
+      var makeNode = createMakeNodeFunction(newRule.l);
+
+      var expandsym = _getExpandPlaceholderSymbol();
+
+      newRule.expanded = {};
+      newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.
+      // This helps to match the newRule against nodes returned from getSplits() later on.
+
+      flatten(newRule.expanded.l, context);
+      unflattenr(newRule.expanded.l, context);
+      newRule.expanded.r = makeNode([newRule.r, expandsym]);
+    }
+
+    return newRule;
+  }
+  /**
+   * Parse the string array of rules into nodes
+   *
+   * Example syntax for rules:
+   *
+   * Position constants to the left in a product:
+   * { l: 'n1 * c1', r: 'c1 * n1' }
+   * n1 is any Node, and c1 is a ConstantNode.
+   *
+   * Apply difference of squares formula:
+   * { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }
+   * n1, n2 mean any Node.
+   *
+   * Short hand notation:
+   * 'n1 * c1 -> c1 * n1'
+   */
+
+
+  function _buildRules(rules, context) {
+    // Array of rules to be used to simplify expressions
+    var ruleSet = [];
+
+    for (var i = 0; i < rules.length; i++) {
+      var rule = rules[i];
+      var newRule = void 0;
+      var ruleType = (0, _typeof2.default)(rule);
+
+      switch (ruleType) {
+        case 'string':
+          rule = {
+            s: rule
+          };
+
+        /* falls through */
+
+        case 'object':
+          newRule = _canonicalizeRule(rule, context);
+          break;
+
+        case 'function':
+          newRule = rule;
+          break;
+
+        default:
+          throw TypeError('Unsupported type of rule: ' + ruleType);
+      } // console.log('Adding rule: ' + rules[i])
+      // console.log(newRule)
+
+
+      ruleSet.push(newRule);
+    }
+
+    return ruleSet;
+  }
+
+  var _lastsym = 0;
+
+  function _getExpandPlaceholderSymbol() {
+    return new SymbolNode('_p' + _lastsym++);
+  }
+
+  function mapRule(nodes, rule, context) {
+    var resNodes = nodes;
+
+    if (nodes) {
+      for (var i = 0; i < nodes.length; ++i) {
+        var newNode = applyRule(nodes[i], rule, context);
+
+        if (newNode !== nodes[i]) {
+          if (resNodes === nodes) {
+            resNodes = nodes.slice();
+          }
+
+          resNodes[i] = newNode;
+        }
+      }
+    }
+
+    return resNodes;
+  }
+  /**
+   * Returns a simplfied form of node, or the original node if no simplification was possible.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {Object | Function} rule
+   * @param  {Object} context -- information about assumed properties of operators
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.
+   */
+
+
+  function applyRule(node, rule, context) {
+    //    console.log('Entering applyRule("', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '",', node.toString({parenthesis:'all'}),')')
+    // check that the assumptions for this rule are satisfied by the current
+    // context:
+    if (rule.assuming) {
+      for (var symbol in rule.assuming) {
+        for (var property in rule.assuming[symbol]) {
+          if (hasProperty(symbol, property, context) !== rule.assuming[symbol][property]) {
+            return node;
+          }
+        }
+      }
+    }
+
+    var mergedContext = mergeContext(rule.imposeContext, context); // Do not clone node unless we find a match
+
+    var res = node; // First replace our child nodes with their simplified versions
+    // If a child could not be simplified, applying the rule to it
+    // will have no effect since the node is returned unchanged
+
+    if (res instanceof OperatorNode || res instanceof FunctionNode) {
+      var newArgs = mapRule(res.args, rule, context);
+
+      if (newArgs !== res.args) {
+        res = res.clone();
+        res.args = newArgs;
+      }
+    } else if (res instanceof ParenthesisNode) {
+      if (res.content) {
+        var newContent = applyRule(res.content, rule, context);
+
+        if (newContent !== res.content) {
+          res = new ParenthesisNode(newContent);
+        }
+      }
+    } else if (res instanceof ArrayNode) {
+      var newItems = mapRule(res.items, rule, context);
+
+      if (newItems !== res.items) {
+        res = new ArrayNode(newItems);
+      }
+    } else if (res instanceof AccessorNode) {
+      var newObj = res.object;
+
+      if (res.object) {
+        newObj = applyRule(res.object, rule, context);
+      }
+
+      var newIndex = res.index;
+
+      if (res.index) {
+        newIndex = applyRule(res.index, rule, context);
+      }
+
+      if (newObj !== res.object || newIndex !== res.index) {
+        res = new AccessorNode(newObj, newIndex);
+      }
+    } else if (res instanceof IndexNode) {
+      var newDims = mapRule(res.dimensions, rule, context);
+
+      if (newDims !== res.dimensions) {
+        res = new IndexNode(newDims);
+      }
+    } else if (res instanceof ObjectNode) {
+      var changed = false;
+      var newProps = {};
+
+      for (var prop in res.properties) {
+        newProps[prop] = applyRule(res.properties[prop], rule, context);
+
+        if (newProps[prop] !== res.properties[prop]) {
+          changed = true;
+        }
+      }
+
+      if (changed) {
+        res = new ObjectNode(newProps);
+      }
+    } // Try to match a rule against this node
+
+
+    var repl = rule.r;
+
+    var matches = _ruleMatch(rule.l, res, mergedContext)[0]; // If the rule is associative operator, we can try matching it while allowing additional terms.
+    // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.
+
+
+    if (!matches && rule.expanded) {
+      repl = rule.expanded.r;
+      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0];
+    }
+
+    if (matches) {
+      // const before = res.toString({parenthesis: 'all'})
+      // Create a new node by cloning the rhs of the matched rule
+      // we keep any implicit multiplication state if relevant
+      var implicit = res.implicit;
+      res = repl.clone();
+
+      if (implicit && 'implicit' in repl) {
+        res.implicit = true;
+      } // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes
+
+
+      res = res.transform(function (node) {
+        if (node.isSymbolNode && (0, _object.hasOwnProperty)(matches.placeholders, node.name)) {
+          return matches.placeholders[node.name].clone();
+        } else {
+          return node;
+        }
+      }); // const after = res.toString({parenthesis: 'all'})
+      // console.log('Simplified ' + before + ' to ' + after)
+    }
+
+    if (rule.repeat && res !== node) {
+      res = applyRule(res, rule, context);
+    }
+
+    return res;
+  }
+  /**
+   * Get (binary) combinations of a flattened binary node
+   * e.g. +(node1, node2, node3) -> [
+   *        +(node1,  +(node2, node3)),
+   *        +(node2,  +(node1, node3)),
+   *        +(node3,  +(node1, node2))]
+   *
+   */
+
+
+  function getSplits(node, context) {
+    var res = [];
+    var right, rightArgs;
+    var makeNode = createMakeNodeFunction(node);
+
+    if (isCommutative(node, context)) {
+      for (var i = 0; i < node.args.length; i++) {
+        rightArgs = node.args.slice(0);
+        rightArgs.splice(i, 1);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([node.args[i], right]));
+      }
+    } else {
+      // Keep order, but try all parenthesizations
+      for (var _i2 = 1; _i2 < node.args.length; _i2++) {
+        var left = node.args[0];
+
+        if (_i2 > 1) {
+          left = makeNode(node.args.slice(0, _i2));
+        }
+
+        rightArgs = node.args.slice(_i2);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([left, right]));
+      }
+    }
+
+    return res;
+  }
+  /**
+   * Returns the set union of two match-placeholders or null if there is a conflict.
+   */
+
+
+  function mergeMatch(match1, match2) {
+    var res = {
+      placeholders: {}
+    }; // Some matches may not have placeholders; this is OK
+
+    if (!match1.placeholders && !match2.placeholders) {
+      return res;
+    } else if (!match1.placeholders) {
+      return match2;
+    } else if (!match2.placeholders) {
+      return match1;
+    } // Placeholders with the same key must match exactly
+
+
+    for (var key in match1.placeholders) {
+      if ((0, _object.hasOwnProperty)(match1.placeholders, key)) {
+        res.placeholders[key] = match1.placeholders[key];
+
+        if ((0, _object.hasOwnProperty)(match2.placeholders, key)) {
+          if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {
+            return null;
+          }
+        }
+      }
+    }
+
+    for (var _key in match2.placeholders) {
+      if ((0, _object.hasOwnProperty)(match2.placeholders, _key)) {
+        res.placeholders[_key] = match2.placeholders[_key];
+      }
+    }
+
+    return res;
+  }
+  /**
+   * Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   */
+
+
+  function combineChildMatches(list1, list2) {
+    var res = [];
+
+    if (list1.length === 0 || list2.length === 0) {
+      return res;
+    }
+
+    var merged;
+
+    for (var i1 = 0; i1 < list1.length; i1++) {
+      for (var i2 = 0; i2 < list2.length; i2++) {
+        merged = mergeMatch(list1[i1], list2[i2]);
+
+        if (merged) {
+          res.push(merged);
+        }
+      }
+    }
+
+    return res;
+  }
+  /**
+   * Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   * Returns a list of unique matches.
+   */
+
+
+  function mergeChildMatches(childMatches) {
+    if (childMatches.length === 0) {
+      return childMatches;
+    }
+
+    var sets = childMatches.reduce(combineChildMatches);
+    var uniqueSets = [];
+    var unique = {};
+
+    for (var i = 0; i < sets.length; i++) {
+      var s = JSON.stringify(sets[i]);
+
+      if (!unique[s]) {
+        unique[s] = true;
+        uniqueSets.push(sets[i]);
+      }
+    }
+
+    return uniqueSets;
+  }
+  /**
+   * Determines whether node matches rule.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param {Object} context -- provides assumed properties of operators
+   * @param {Boolean} isSplit -- whether we are in process of splitting an
+   *                    n-ary operator node into possible binary combinations.
+   *                    Defaults to false.
+   * @return {Object} Information about the match, if it exists.
+   */
+
+
+  function _ruleMatch(rule, node, context, isSplit) {
+    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')
+    //    console.log('rule = ' + rule)
+    //    console.log('node = ' + node)
+    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')
+    var res = [{
+      placeholders: {}
+    }];
+
+    if (rule instanceof OperatorNode && node instanceof OperatorNode || rule instanceof FunctionNode && node instanceof FunctionNode) {
+      // If the rule is an OperatorNode or a FunctionNode, then node must match exactly
+      if (rule instanceof OperatorNode) {
+        if (rule.op !== node.op || rule.fn !== node.fn) {
+          return [];
+        }
+      } else if (rule instanceof FunctionNode) {
+        if (rule.name !== node.name) {
+          return [];
+        }
+      } // rule and node match. Search the children of rule and node.
+
+
+      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node, context) && node.args.length === rule.args.length || isSplit) {
+        // Expect non-associative operators to match exactly,
+        // except in any order if operator is commutative
+        var childMatches = [];
+
+        for (var i = 0; i < rule.args.length; i++) {
+          var childMatch = _ruleMatch(rule.args[i], node.args[i], context);
+
+          if (childMatch.length === 0) {
+            // Child did not match, so stop searching immediately
+            break;
+          } // The child matched, so add the information returned from the child to our result
+
+
+          childMatches.push(childMatch);
+        }
+
+        if (childMatches.length !== rule.args.length) {
+          if (!isCommutative(node, context) || // exact match in order needed
+          rule.args.length === 1) {
+            // nothing to commute
+            return [];
+          }
+
+          if (rule.args.length > 2) {
+            /* Need to generate all permutations and try them.
+             * It's a bit complicated, and unlikely to come up since there
+             * are very few ternary or higher operators. So punt for now.
+             */
+            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented');
+          }
+          /* Exactly two arguments, try them reversed */
+
+
+          var leftMatch = _ruleMatch(rule.args[0], node.args[1], context);
+
+          if (leftMatch.length === 0) {
+            return [];
+          }
+
+          var rightMatch = _ruleMatch(rule.args[1], node.args[0], context);
+
+          if (rightMatch.length === 0) {
+            return [];
+          }
+
+          childMatches = [leftMatch, rightMatch];
+        }
+
+        res = mergeChildMatches(childMatches);
+      } else if (node.args.length >= 2 && rule.args.length === 2) {
+        // node is flattened, rule is not
+        // Associative operators/functions can be split in different ways so we check if the rule matches each
+        // them and return their union.
+        var splits = getSplits(node, context);
+        var splitMatches = [];
+
+        for (var _i3 = 0; _i3 < splits.length; _i3++) {
+          var matchSet = _ruleMatch(rule, splits[_i3], context, true); // recursing at the same tree depth here
+
+
+          splitMatches = splitMatches.concat(matchSet);
+        }
+
+        return splitMatches;
+      } else if (rule.args.length > 2) {
+        throw Error('Unexpected non-binary associative function: ' + rule.toString());
+      } else {
+        // Incorrect number of arguments in rule and node, so no match
+        return [];
+      }
+    } else if (rule instanceof SymbolNode) {
+      // If the rule is a SymbolNode, then it carries a special meaning
+      // according to the first character of the symbol node name.
+      // c.* matches a ConstantNode
+      // n.* matches any node
+      if (rule.name.length === 0) {
+        throw new Error('Symbol in rule has 0 length...!?');
+      }
+
+      if (SUPPORTED_CONSTANTS[rule.name]) {
+        // built-in constant must match exactly
+        if (rule.name !== node.name) {
+          return [];
+        }
+      } else if (rule.name[0] === 'n' || rule.name.substring(0, 2) === '_p') {
+        // rule matches _anything_, so assign this node to the rule.name placeholder
+        // Assign node to the rule.name placeholder.
+        // Our parent will check for matches among placeholders.
+        res[0].placeholders[rule.name] = node;
+      } else if (rule.name[0] === 'v') {
+        // rule matches any variable thing (not a ConstantNode)
+        if (!(0, _is.isConstantNode)(node)) {
+          res[0].placeholders[rule.name] = node;
+        } else {
+          // Mis-match: rule was expecting something other than a ConstantNode
+          return [];
+        }
+      } else if (rule.name[0] === 'c') {
+        // rule matches any ConstantNode
+        if (node instanceof ConstantNode) {
+          res[0].placeholders[rule.name] = node;
+        } else {
+          // Mis-match: rule was expecting a ConstantNode
+          return [];
+        }
+      } else {
+        throw new Error('Invalid symbol in rule: ' + rule.name);
+      }
+    } else if (rule instanceof ConstantNode) {
+      // Literal constant must match exactly
+      if (!equal(rule.value, node.value)) {
+        return [];
+      }
+    } else {
+      // Some other node was encountered which we aren't prepared for, so no match
+      return [];
+    } // It's a match!
+    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')
+
+
+    return res;
+  }
+  /**
+   * Determines whether p and q (and all their children nodes) are identical.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q
+   * @return {Object} Information about the match, if it exists.
+   */
+
+
+  function _exactMatch(p, q) {
+    if (p instanceof ConstantNode && q instanceof ConstantNode) {
+      if (!equal(p.value, q.value)) {
+        return false;
+      }
+    } else if (p instanceof SymbolNode && q instanceof SymbolNode) {
+      if (p.name !== q.name) {
+        return false;
+      }
+    } else if (p instanceof OperatorNode && q instanceof OperatorNode || p instanceof FunctionNode && q instanceof FunctionNode) {
+      if (p instanceof OperatorNode) {
+        if (p.op !== q.op || p.fn !== q.fn) {
+          return false;
+        }
+      } else if (p instanceof FunctionNode) {
+        if (p.name !== q.name) {
+          return false;
+        }
+      }
+
+      if (p.args.length !== q.args.length) {
+        return false;
+      }
+
+      for (var i = 0; i < p.args.length; i++) {
+        if (!_exactMatch(p.args[i], q.args[i])) {
+          return false;
+        }
+      }
+    } else {
+      return false;
+    }
+
+    return true;
+  }
+
+  return simplify;
+});
+exports.createSimplify = createSimplify;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplify/simplifyConstant.js b/node_modules/mathjs/lib/cjs/function/algebra/simplify/simplifyConstant.js
new file mode 100644
index 0000000..ca87bbd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplify/simplifyConstant.js
@@ -0,0 +1,526 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSimplifyConstant = void 0;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _is = require("../../../utils/is.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var _util = require("./util.js");
+
+var _noop = require("../../../utils/noop.js");
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+var name = 'simplifyConstant';
+var dependencies = ['typed', 'config', 'mathWithTransform', 'matrix', '?fraction', '?bignumber', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode'];
+var createSimplifyConstant = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      mathWithTransform = _ref.mathWithTransform,
+      matrix = _ref.matrix,
+      fraction = _ref.fraction,
+      bignumber = _ref.bignumber,
+      AccessorNode = _ref.AccessorNode,
+      ArrayNode = _ref.ArrayNode,
+      ConstantNode = _ref.ConstantNode,
+      FunctionNode = _ref.FunctionNode,
+      IndexNode = _ref.IndexNode,
+      ObjectNode = _ref.ObjectNode,
+      OperatorNode = _ref.OperatorNode,
+      SymbolNode = _ref.SymbolNode;
+
+  var _createUtil = (0, _util.createUtil)({
+    FunctionNode: FunctionNode,
+    OperatorNode: OperatorNode,
+    SymbolNode: SymbolNode
+  }),
+      isCommutative = _createUtil.isCommutative,
+      isAssociative = _createUtil.isAssociative,
+      allChildren = _createUtil.allChildren,
+      createMakeNodeFunction = _createUtil.createMakeNodeFunction;
+
+  function simplifyConstant(expr, options) {
+    return _ensureNode(foldFraction(expr, options));
+  }
+
+  function _removeFractions(thing) {
+    if ((0, _is.isFraction)(thing)) {
+      return thing.valueOf();
+    }
+
+    if (thing instanceof Array) {
+      return thing.map(_removeFractions);
+    }
+
+    if ((0, _is.isMatrix)(thing)) {
+      return matrix(_removeFractions(thing.valueOf()));
+    }
+
+    return thing;
+  }
+
+  function _eval(fnname, args, options) {
+    try {
+      return mathWithTransform[fnname].apply(null, args);
+    } catch (ignore) {
+      // sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions
+      args = args.map(_removeFractions);
+      return _toNumber(mathWithTransform[fnname].apply(null, args), options);
+    }
+  }
+
+  var _toNode = typed({
+    Fraction: _fractionToNode,
+    number: function number(n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+
+      return new ConstantNode(n);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+
+      return new ConstantNode(n); // old parameters: (n.toString(), 'number')
+    },
+    Complex: function Complex(s) {
+      throw new Error('Cannot convert Complex number to Node');
+    },
+    string: function string(s) {
+      return new ConstantNode(s);
+    },
+    Matrix: function Matrix(m) {
+      return new ArrayNode(m.valueOf().map(function (e) {
+        return _toNode(e);
+      }));
+    }
+  });
+
+  function _ensureNode(thing) {
+    if ((0, _is.isNode)(thing)) {
+      return thing;
+    }
+
+    return _toNode(thing);
+  } // convert a number to a fraction only if it can be expressed exactly,
+  // and when both numerator and denominator are small enough
+
+
+  function _exactFraction(n, options) {
+    var exactFractions = options && options.exactFractions !== false;
+
+    if (exactFractions && isFinite(n) && fraction) {
+      var f = fraction(n);
+      var fractionsLimit = options && typeof options.fractionsLimit === 'number' ? options.fractionsLimit : Infinity; // no limit by default
+
+      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {
+        return f;
+      }
+    }
+
+    return n;
+  } // Convert numbers to a preferred number type in preference order: Fraction, number, Complex
+  // BigNumbers are left alone
+
+
+  var _toNumber = typed({
+    'string, Object': function stringObject(s, options) {
+      if (config.number === 'BigNumber') {
+        if (bignumber === undefined) {
+          (0, _noop.noBignumber)();
+        }
+
+        return bignumber(s);
+      } else if (config.number === 'Fraction') {
+        if (fraction === undefined) {
+          (0, _noop.noFraction)();
+        }
+
+        return fraction(s);
+      } else {
+        var n = parseFloat(s);
+        return _exactFraction(n, options);
+      }
+    },
+    'Fraction, Object': function FractionObject(s, options) {
+      return s;
+    },
+    // we don't need options here
+    'BigNumber, Object': function BigNumberObject(s, options) {
+      return s;
+    },
+    // we don't need options here
+    'number, Object': function numberObject(s, options) {
+      return _exactFraction(s, options);
+    },
+    'Complex, Object': function ComplexObject(s, options) {
+      if (s.im !== 0) {
+        return s;
+      }
+
+      return _exactFraction(s.re, options);
+    },
+    'Matrix, Object': function MatrixObject(s, options) {
+      return matrix(_exactFraction(s.valueOf()));
+    },
+    'Array, Object': function ArrayObject(s, options) {
+      return s.map(_exactFraction);
+    }
+  });
+
+  function unaryMinusNode(n) {
+    return new OperatorNode('-', 'unaryMinus', [n]);
+  }
+
+  function _fractionToNode(f) {
+    var n;
+    var vn = f.s * f.n;
+
+    if (vn < 0) {
+      n = new OperatorNode('-', 'unaryMinus', [new ConstantNode(-vn)]);
+    } else {
+      n = new ConstantNode(vn);
+    }
+
+    if (f.d === 1) {
+      return n;
+    }
+
+    return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)]);
+  }
+  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */
+
+
+  function _foldAccessor(obj, index, options) {
+    if (!(0, _is.isIndexNode)(index)) {
+      // don't know what to do with that...
+      return new AccessorNode(_ensureNode(obj), _ensureNode(index));
+    }
+
+    if ((0, _is.isArrayNode)(obj) || (0, _is.isMatrix)(obj)) {
+      var remainingDims = Array.from(index.dimensions);
+      /* We will resolve constant indices one at a time, looking
+       * just in the first or second dimensions because (a) arrays
+       * of more than two dimensions are likely rare, and (b) pulling
+       * out the third or higher dimension would be pretty intricate.
+       * The price is that we miss simplifying [..3d array][x,y,1]
+       */
+
+      while (remainingDims.length > 0) {
+        if ((0, _is.isConstantNode)(remainingDims[0]) && typeof remainingDims[0].value !== 'string') {
+          var first = _toNumber(remainingDims.shift().value, options);
+
+          if ((0, _is.isArrayNode)(obj)) {
+            obj = obj.items[first - 1];
+          } else {
+            // matrix
+            obj = obj.valueOf()[first - 1];
+
+            if (obj instanceof Array) {
+              obj = matrix(obj);
+            }
+          }
+        } else if (remainingDims.length > 1 && (0, _is.isConstantNode)(remainingDims[1]) && typeof remainingDims[1].value !== 'string') {
+          var second = _toNumber(remainingDims[1].value, options);
+
+          var tryItems = [];
+          var fromItems = (0, _is.isArrayNode)(obj) ? obj.items : obj.valueOf();
+
+          var _iterator = _createForOfIteratorHelper(fromItems),
+              _step;
+
+          try {
+            for (_iterator.s(); !(_step = _iterator.n()).done;) {
+              var item = _step.value;
+
+              if ((0, _is.isArrayNode)(item)) {
+                tryItems.push(item.items[second - 1]);
+              } else if ((0, _is.isMatrix)(obj)) {
+                tryItems.push(item[second - 1]);
+              } else {
+                break;
+              }
+            }
+          } catch (err) {
+            _iterator.e(err);
+          } finally {
+            _iterator.f();
+          }
+
+          if (tryItems.length === fromItems.length) {
+            if ((0, _is.isArrayNode)(obj)) {
+              obj = new ArrayNode(tryItems);
+            } else {
+              // matrix
+              obj = matrix(tryItems);
+            }
+
+            remainingDims.splice(1, 1);
+          } else {
+            // extracting slice along 2nd dimension failed, give up
+            break;
+          }
+        } else {
+          // neither 1st or 2nd dimension is constant, give up
+          break;
+        }
+      }
+
+      if (remainingDims.length === index.dimensions.length) {
+        /* No successful constant indexing */
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+
+      if (remainingDims.length > 0) {
+        /* Indexed some but not all dimensions */
+        index = new IndexNode(remainingDims);
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+      /* All dimensions were constant, access completely resolved */
+
+
+      return obj;
+    }
+
+    if ((0, _is.isObjectNode)(obj) && index.dimensions.length === 1 && (0, _is.isConstantNode)(index.dimensions[0])) {
+      var key = index.dimensions[0].value;
+
+      if (key in obj.properties) {
+        return obj.properties[key];
+      }
+
+      return new ConstantNode(); // undefined
+    }
+    /* Don't know how to index this sort of obj, at least not with this index */
+
+
+    return new AccessorNode(_ensureNode(obj), index);
+  }
+  /*
+   * Create a binary tree from a list of Fractions and Nodes.
+   * Tries to fold Fractions by evaluating them until the first Node in the list is hit, so
+   * `args` should be sorted to have the Fractions at the start (if the operator is commutative).
+   * @param args - list of Fractions and Nodes
+   * @param fn - evaluator for the binary operation evaluator that accepts two Fractions
+   * @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes
+   * if args.length is 1, returns args[0]
+   * @return - Either a Node representing a binary expression or Fraction
+   */
+
+
+  function foldOp(fn, args, makeNode, options) {
+    return args.reduce(function (a, b) {
+      if (!(0, _is.isNode)(a) && !(0, _is.isNode)(b)) {
+        try {
+          return _eval(fn, [a, b], options);
+        } catch (ignoreandcontinue) {}
+
+        a = _toNode(a);
+        b = _toNode(b);
+      } else if (!(0, _is.isNode)(a)) {
+        a = _toNode(a);
+      } else if (!(0, _is.isNode)(b)) {
+        b = _toNode(b);
+      }
+
+      return makeNode([a, b]);
+    });
+  } // destroys the original node and returns a folded one
+
+
+  function foldFraction(node, options) {
+    switch (node.type) {
+      case 'SymbolNode':
+        return node;
+
+      case 'ConstantNode':
+        switch ((0, _typeof2.default)(node.value)) {
+          case 'number':
+            return _toNumber(node.value, options);
+
+          case 'string':
+            return node.value;
+
+          default:
+            if (!isNaN(node.value)) return _toNumber(node.value, options);
+        }
+
+        return node;
+
+      case 'FunctionNode':
+        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {
+          return node;
+        }
+
+        {
+          // Process operators as OperatorNode
+          var operatorFunctions = ['add', 'multiply'];
+
+          if (operatorFunctions.indexOf(node.name) === -1) {
+            var args = node.args.map(function (arg) {
+              return foldFraction(arg, options);
+            }); // If all args are numbers
+
+            if (!args.some(_is.isNode)) {
+              try {
+                return _eval(node.name, args, options);
+              } catch (ignoreandcontinue) {}
+            } // Size of a matrix does not depend on entries
+
+
+            if (node.name === 'size' && args.length === 1 && (0, _is.isArrayNode)(args[0])) {
+              var sz = [];
+              var section = args[0];
+
+              while ((0, _is.isArrayNode)(section)) {
+                sz.push(section.items.length);
+                section = section.items[0];
+              }
+
+              return matrix(sz);
+            } // Convert all args to nodes and construct a symbolic function call
+
+
+            return new FunctionNode(node.name, args.map(_ensureNode));
+          } else {// treat as operator
+          }
+        }
+
+      /* falls through */
+
+      case 'OperatorNode':
+        {
+          var fn = node.fn.toString();
+
+          var _args;
+
+          var res;
+          var makeNode = createMakeNodeFunction(node);
+
+          if ((0, _is.isOperatorNode)(node) && node.isUnary()) {
+            _args = [foldFraction(node.args[0], options)];
+
+            if (!(0, _is.isNode)(_args[0])) {
+              res = _eval(fn, _args, options);
+            } else {
+              res = makeNode(_args);
+            }
+          } else if (isAssociative(node, options.context)) {
+            _args = allChildren(node, options.context);
+            _args = _args.map(function (arg) {
+              return foldFraction(arg, options);
+            });
+
+            if (isCommutative(fn, options.context)) {
+              // commutative binary operator
+              var consts = [];
+              var vars = [];
+
+              for (var i = 0; i < _args.length; i++) {
+                if (!(0, _is.isNode)(_args[i])) {
+                  consts.push(_args[i]);
+                } else {
+                  vars.push(_args[i]);
+                }
+              }
+
+              if (consts.length > 1) {
+                res = foldOp(fn, consts, makeNode, options);
+                vars.unshift(res);
+                res = foldOp(fn, vars, makeNode, options);
+              } else {
+                // we won't change the children order since it's not neccessary
+                res = foldOp(fn, _args, makeNode, options);
+              }
+            } else {
+              // non-commutative binary operator
+              res = foldOp(fn, _args, makeNode, options);
+            }
+          } else {
+            // non-associative binary operator
+            _args = node.args.map(function (arg) {
+              return foldFraction(arg, options);
+            });
+            res = foldOp(fn, _args, makeNode, options);
+          }
+
+          return res;
+        }
+
+      case 'ParenthesisNode':
+        // remove the uneccessary parenthesis
+        return foldFraction(node.content, options);
+
+      case 'AccessorNode':
+        return _foldAccessor(foldFraction(node.object, options), foldFraction(node.index, options), options);
+
+      case 'ArrayNode':
+        {
+          var foldItems = node.items.map(function (item) {
+            return foldFraction(item, options);
+          });
+
+          if (foldItems.some(_is.isNode)) {
+            return new ArrayNode(foldItems.map(_ensureNode));
+          }
+          /* All literals -- return a Matrix so we can operate on it */
+
+
+          return matrix(foldItems);
+        }
+
+      case 'IndexNode':
+        {
+          return new IndexNode(node.dimensions.map(function (n) {
+            return simplifyConstant(n, options);
+          }));
+        }
+
+      case 'ObjectNode':
+        {
+          var foldProps = {};
+
+          for (var prop in node.properties) {
+            foldProps[prop] = simplifyConstant(node.properties[prop], options);
+          }
+
+          return new ObjectNode(foldProps);
+        }
+
+      case 'AssignmentNode':
+      /* falls through */
+
+      case 'BlockNode':
+      /* falls through */
+
+      case 'FunctionAssignmentNode':
+      /* falls through */
+
+      case 'RangeNode':
+      /* falls through */
+
+      case 'ConditionalNode':
+      /* falls through */
+
+      default:
+        throw new Error("Unimplemented node type in simplifyConstant: ".concat(node.type));
+    }
+  }
+
+  return simplifyConstant;
+});
+exports.createSimplifyConstant = createSimplifyConstant;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplify/util.js b/node_modules/mathjs/lib/cjs/function/algebra/simplify/util.js
new file mode 100644
index 0000000..1934cd5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplify/util.js
@@ -0,0 +1,327 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUtil = void 0;
+
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
+var _is = require("../../../utils/is.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var _object = require("../../../utils/object.js");
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2.default)(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+var name = 'simplifyUtil';
+var dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];
+var createUtil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var FunctionNode = _ref.FunctionNode,
+      OperatorNode = _ref.OperatorNode,
+      SymbolNode = _ref.SymbolNode;
+  // TODO commutative/associative properties rely on the arguments
+  // e.g. multiply is not commutative for matrices
+  // The properties should be calculated from an argument to simplify, or possibly something in math.config
+  // the other option is for typed() to specify a return type so that we can evaluate the type of arguments
+
+  /* So that properties of an operator fit on one line: */
+  var T = true;
+  var F = false;
+  var defaultName = 'defaultF';
+  var defaultContext = {
+    /*      */
+    add: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+
+    /**/
+    unaryPlus: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+
+    /* */
+    subtract: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+
+    /* */
+    multiply: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+
+    /*   */
+    divide: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+
+    /*    */
+    paren: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: F
+    },
+
+    /* */
+    defaultF: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    }
+  };
+  var realContext = {
+    divide: {
+      total: F
+    },
+    log: {
+      total: F
+    }
+  };
+  var positiveContext = {
+    subtract: {
+      total: F
+    },
+    abs: {
+      trivial: T
+    },
+    log: {
+      total: T
+    }
+  };
+
+  function hasProperty(nodeOrName, property) {
+    var context = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultContext;
+    var name = defaultName;
+
+    if (typeof nodeOrName === 'string') {
+      name = nodeOrName;
+    } else if ((0, _is.isOperatorNode)(nodeOrName)) {
+      name = nodeOrName.fn.toString();
+    } else if ((0, _is.isFunctionNode)(nodeOrName)) {
+      name = nodeOrName.name;
+    } else if ((0, _is.isParenthesisNode)(nodeOrName)) {
+      name = 'paren';
+    }
+
+    if ((0, _object.hasOwnProperty)(context, name)) {
+      var properties = context[name];
+
+      if ((0, _object.hasOwnProperty)(properties, property)) {
+        return properties[property];
+      }
+
+      if ((0, _object.hasOwnProperty)(defaultContext, name)) {
+        return defaultContext[name][property];
+      }
+    }
+
+    if ((0, _object.hasOwnProperty)(context, defaultName)) {
+      var _properties = context[defaultName];
+
+      if ((0, _object.hasOwnProperty)(_properties, property)) {
+        return _properties[property];
+      }
+
+      return defaultContext[defaultName][property];
+    }
+    /* name not found in context and context has no global default */
+
+    /* So use default context. */
+
+
+    if ((0, _object.hasOwnProperty)(defaultContext, name)) {
+      var _properties2 = defaultContext[name];
+
+      if ((0, _object.hasOwnProperty)(_properties2, property)) {
+        return _properties2[property];
+      }
+    }
+
+    return defaultContext[defaultName][property];
+  }
+
+  function isCommutative(node) {
+    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'commutative', context);
+  }
+
+  function isAssociative(node) {
+    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'associative', context);
+  }
+  /**
+   * Merge the given contexts, with primary overriding secondary
+   * wherever they might conflict
+   */
+
+
+  function mergeContext(primary, secondary) {
+    var merged = _objectSpread({}, primary);
+
+    for (var prop in secondary) {
+      if ((0, _object.hasOwnProperty)(primary, prop)) {
+        merged[prop] = _objectSpread(_objectSpread({}, secondary[prop]), primary[prop]);
+      } else {
+        merged[prop] = secondary[prop];
+      }
+    }
+
+    return merged;
+  }
+  /**
+   * Flatten all associative operators in an expression tree.
+   * Assumes parentheses have already been removed.
+   */
+
+
+  function flatten(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return node;
+    }
+
+    node.args = allChildren(node, context);
+
+    for (var i = 0; i < node.args.length; i++) {
+      flatten(node.args[i], context);
+    }
+  }
+  /**
+   * Get the children of a node as if it has been flattened.
+   * TODO implement for FunctionNodes
+   */
+
+
+  function allChildren(node, context) {
+    var op;
+    var children = [];
+
+    var findChildren = function findChildren(node) {
+      for (var i = 0; i < node.args.length; i++) {
+        var child = node.args[i];
+
+        if ((0, _is.isOperatorNode)(child) && op === child.op) {
+          findChildren(child);
+        } else {
+          children.push(child);
+        }
+      }
+    };
+
+    if (isAssociative(node, context)) {
+      op = node.op;
+      findChildren(node);
+      return children;
+    } else {
+      return node.args;
+    }
+  }
+  /**
+   *  Unflatten all flattened operators to a right-heavy binary tree.
+   */
+
+
+  function unflattenr(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+
+    var makeNode = createMakeNodeFunction(node);
+    var l = node.args.length;
+
+    for (var i = 0; i < l; i++) {
+      unflattenr(node.args[i], context);
+    }
+
+    if (l > 2 && isAssociative(node, context)) {
+      var curnode = node.args.pop();
+
+      while (node.args.length > 0) {
+        curnode = makeNode([node.args.pop(), curnode]);
+      }
+
+      node.args = curnode.args;
+    }
+  }
+  /**
+   *  Unflatten all flattened operators to a left-heavy binary tree.
+   */
+
+
+  function unflattenl(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+
+    var makeNode = createMakeNodeFunction(node);
+    var l = node.args.length;
+
+    for (var i = 0; i < l; i++) {
+      unflattenl(node.args[i], context);
+    }
+
+    if (l > 2 && isAssociative(node, context)) {
+      var curnode = node.args.shift();
+
+      while (node.args.length > 0) {
+        curnode = makeNode([curnode, node.args.shift()]);
+      }
+
+      node.args = curnode.args;
+    }
+  }
+
+  function createMakeNodeFunction(node) {
+    if ((0, _is.isOperatorNode)(node)) {
+      return function (args) {
+        try {
+          return new OperatorNode(node.op, node.fn, args, node.implicit);
+        } catch (err) {
+          console.error(err);
+          return [];
+        }
+      };
+    } else {
+      return function (args) {
+        return new FunctionNode(new SymbolNode(node.name), args);
+      };
+    }
+  }
+
+  return {
+    createMakeNodeFunction: createMakeNodeFunction,
+    hasProperty: hasProperty,
+    isCommutative: isCommutative,
+    isAssociative: isAssociative,
+    mergeContext: mergeContext,
+    flatten: flatten,
+    allChildren: allChildren,
+    unflattenr: unflattenr,
+    unflattenl: unflattenl,
+    defaultContext: defaultContext,
+    realContext: realContext,
+    positiveContext: positiveContext
+  };
+});
+exports.createUtil = createUtil;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/cjs/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..235671b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplifyCore.js
@@ -0,0 +1,251 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSimplifyCore = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _util = require("./simplify/util.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'simplifyCore';
+var dependencies = ['equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var equal = _ref.equal,
+      isZero = _ref.isZero,
+      add = _ref.add,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply,
+      divide = _ref.divide,
+      pow = _ref.pow,
+      AccessorNode = _ref.AccessorNode,
+      ArrayNode = _ref.ArrayNode,
+      ConstantNode = _ref.ConstantNode,
+      FunctionNode = _ref.FunctionNode,
+      IndexNode = _ref.IndexNode,
+      ObjectNode = _ref.ObjectNode,
+      OperatorNode = _ref.OperatorNode,
+      ParenthesisNode = _ref.ParenthesisNode,
+      SymbolNode = _ref.SymbolNode;
+  var node0 = new ConstantNode(0);
+  var node1 = new ConstantNode(1);
+
+  var _createUtil = (0, _util.createUtil)({
+    FunctionNode: FunctionNode,
+    OperatorNode: OperatorNode,
+    SymbolNode: SymbolNode
+  }),
+      hasProperty = _createUtil.hasProperty,
+      isCommutative = _createUtil.isCommutative;
+  /**
+   * simplifyCore() performs single pass simplification suitable for
+   * applications requiring ultimate performance. In contrast, simplify()
+   * extends simplifyCore() with additional passes to provide deeper
+   * simplification.
+   *
+   * Syntax:
+   *
+   *     simplifyCore(expr)
+   *
+   * Examples:
+   *
+   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')
+   *     math.simpifyCore(f)                          // Node {2 * x}
+   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplifyCore]) // Node {2 * x}
+   *
+   * See also:
+   *
+   *     simplify, resolve, derivative
+   *
+   * @param {Node} node
+   *     The expression to be simplified
+   * @param {Object} options
+   *     Simplification options, as per simplify()
+   * @return {Node} Returns expression with basic simplifications applied
+   */
+
+
+  function simplifyCore(node, options) {
+    var context = options ? options.context : undefined;
+
+    if (hasProperty(node, 'trivial', context)) {
+      // This node does nothing if it has only one argument, so if so,
+      // return that argument simplified
+      if ((0, _is.isFunctionNode)(node) && node.args.length === 1) {
+        return simplifyCore(node.args[0], options);
+      } // For other node types, we try the generic methods
+
+
+      var simpChild = false;
+      var childCount = 0;
+      node.forEach(function (c) {
+        ++childCount;
+
+        if (childCount === 1) {
+          simpChild = simplifyCore(c, options);
+        }
+      });
+
+      if (childCount === 1) {
+        return simpChild;
+      }
+    }
+
+    if ((0, _is.isOperatorNode)(node) && node.isUnary()) {
+      var a0 = simplifyCore(node.args[0], options);
+
+      if (node.op === '-') {
+        // unary minus
+        if ((0, _is.isOperatorNode)(a0)) {
+          if (a0.isUnary() && a0.op === '-') {
+            return a0.args[0];
+          } else if (a0.isBinary() && a0.fn === 'subtract') {
+            return new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]]);
+          }
+        }
+
+        return new OperatorNode(node.op, node.fn, [a0]);
+      }
+    } else if ((0, _is.isOperatorNode)(node) && node.isBinary()) {
+      var _a = simplifyCore(node.args[0], options);
+
+      var a1 = simplifyCore(node.args[1], options);
+
+      if (node.op === '+') {
+        if ((0, _is.isConstantNode)(_a)) {
+          if (isZero(_a.value)) {
+            return a1;
+          } else if ((0, _is.isConstantNode)(a1)) {
+            return new ConstantNode(add(_a.value, a1.value));
+          }
+        }
+
+        if ((0, _is.isConstantNode)(a1) && isZero(a1.value)) {
+          return _a;
+        }
+
+        if ((0, _is.isOperatorNode)(a1) && a1.isUnary() && a1.op === '-') {
+          return new OperatorNode('-', 'subtract', [_a, a1.args[0]]);
+        }
+
+        return new OperatorNode(node.op, node.fn, a1 ? [_a, a1] : [_a]);
+      } else if (node.op === '-') {
+        if ((0, _is.isConstantNode)(_a) && a1) {
+          if ((0, _is.isConstantNode)(a1)) {
+            return new ConstantNode(subtract(_a.value, a1.value));
+          } else if (isZero(_a.value)) {
+            return new OperatorNode('-', 'unaryMinus', [a1]);
+          }
+        } // if (node.fn === "subtract" && node.args.length === 2) {
+
+
+        if (node.fn === 'subtract') {
+          if ((0, _is.isConstantNode)(a1) && isZero(a1.value)) {
+            return _a;
+          }
+
+          if ((0, _is.isOperatorNode)(a1) && a1.isUnary() && a1.op === '-') {
+            return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]), options);
+          }
+
+          return new OperatorNode(node.op, node.fn, [_a, a1]);
+        }
+      } else if (node.op === '*') {
+        if ((0, _is.isConstantNode)(_a)) {
+          if (isZero(_a.value)) {
+            return node0;
+          } else if (equal(_a.value, 1)) {
+            return a1;
+          } else if ((0, _is.isConstantNode)(a1)) {
+            return new ConstantNode(multiply(_a.value, a1.value));
+          }
+        }
+
+        if ((0, _is.isConstantNode)(a1)) {
+          if (isZero(a1.value)) {
+            return node0;
+          } else if (equal(a1.value, 1)) {
+            return _a;
+          } else if ((0, _is.isOperatorNode)(_a) && _a.isBinary() && _a.op === node.op && isCommutative(node, context)) {
+            var a00 = _a.args[0];
+
+            if ((0, _is.isConstantNode)(a00)) {
+              var a00a1 = new ConstantNode(multiply(a00.value, a1.value));
+              return new OperatorNode(node.op, node.fn, [a00a1, _a.args[1]], node.implicit); // constants on left
+            }
+          }
+
+          if (isCommutative(node, context)) {
+            return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left
+          } else {
+            return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
+          }
+        }
+
+        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
+      } else if (node.op === '/') {
+        if ((0, _is.isConstantNode)(_a)) {
+          if (isZero(_a.value)) {
+            return node0;
+          } else if ((0, _is.isConstantNode)(a1) && (equal(a1.value, 1) || equal(a1.value, 2) || equal(a1.value, 4))) {
+            return new ConstantNode(divide(_a.value, a1.value));
+          }
+        }
+
+        return new OperatorNode(node.op, node.fn, [_a, a1]);
+      } else if (node.op === '^') {
+        if ((0, _is.isConstantNode)(a1)) {
+          if (isZero(a1.value)) {
+            return node1;
+          } else if (equal(a1.value, 1)) {
+            return _a;
+          } else {
+            if ((0, _is.isConstantNode)(_a)) {
+              // fold constant
+              return new ConstantNode(pow(_a.value, a1.value));
+            } else if ((0, _is.isOperatorNode)(_a) && _a.isBinary() && _a.op === '^') {
+              var a01 = _a.args[1];
+
+              if ((0, _is.isConstantNode)(a01)) {
+                return new OperatorNode(node.op, node.fn, [_a.args[0], new ConstantNode(multiply(a01.value, a1.value))]);
+              }
+            }
+          }
+        }
+      }
+
+      return new OperatorNode(node.op, node.fn, [_a, a1]);
+    } else if ((0, _is.isFunctionNode)(node)) {
+      return new FunctionNode(simplifyCore(node.fn), node.args.map(function (n) {
+        return simplifyCore(n, options);
+      }));
+    } else if ((0, _is.isArrayNode)(node)) {
+      return new ArrayNode(node.items.map(function (n) {
+        return simplifyCore(n, options);
+      }));
+    } else if ((0, _is.isAccessorNode)(node)) {
+      return new AccessorNode(simplifyCore(node.object, options), simplifyCore(node.index, options));
+    } else if ((0, _is.isIndexNode)(node)) {
+      return new IndexNode(node.dimensions.map(function (n) {
+        return simplifyCore(n, options);
+      }));
+    } else if ((0, _is.isObjectNode)(node)) {
+      var newProps = {};
+
+      for (var prop in node.properties) {
+        newProps[prop] = simplifyCore(node.properties[prop], options);
+      }
+
+      return new ObjectNode(newProps);
+    } else {// cannot simplify
+    }
+
+    return node;
+  }
+
+  return simplifyCore;
+});
+exports.createSimplifyCore = createSimplifyCore;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolve.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolve.js
new file mode 100644
index 0000000..7e772a0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolve.js
@@ -0,0 +1,169 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLsolve = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _solveValidation = require("./utils/solveValidation.js");
+
+var name = 'lsolve';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+var createLsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      subtract = _ref.subtract,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix: DenseMatrix
+  });
+  /**
+   * Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolve(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolve(a, b)  // [[-5.5], [20]]
+   *
+   * See also:
+   *
+   *    lsolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var r = _denseForwardSubstitution(m, b);
+
+      return r.valueOf();
+    }
+  });
+
+  function _denseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // result
+
+    var x = [];
+    var mdata = m._data; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      var bj = bdata[j][0] || 0;
+      var xj = void 0;
+
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+        var vjj = mdata[j][j];
+
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        xj = divideScalar(bj, vjj); // loop rows
+
+        for (var i = j + 1; i < rows; i++) {
+          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // degenerate row, we can choose any value
+        xj = 0;
+      }
+
+      x[j] = [xj];
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+
+  function _sparseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // result
+
+    var x = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      var bj = bdata[j][0] || 0;
+
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+        var vjj = 0; // matrix values & indices (column j)
+
+        var jValues = [];
+        var jIndices = []; // first and last index in the column
+
+        var firstIndex = ptr[j];
+        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j]
+
+        for (var k = firstIndex; k < lastIndex; k++) {
+          var i = index[k]; // check row (rows are not sorted!)
+
+          if (i === j) {
+            vjj = values[k];
+          } else if (i > j) {
+            // store lower triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        } // at this point we must have a value in vjj
+
+
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        var xj = divideScalar(bj, vjj);
+
+        for (var _k = 0, l = jIndices.length; _k < l; _k++) {
+          var _i = jIndices[_k];
+          bdata[_i] = [subtract(bdata[_i][0] || 0, multiplyScalar(xj, jValues[_k]))];
+        }
+
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
+exports.createLsolve = createLsolve;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolveAll.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolveAll.js
new file mode 100644
index 0000000..d301bb5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolveAll.js
@@ -0,0 +1,213 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLsolveAll = void 0;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
+
+var _factory = require("../../../utils/factory.js");
+
+var _solveValidation = require("./utils/solveValidation.js");
+
+var name = 'lsolveAll';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+var createLsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      subtract = _ref.subtract,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix: DenseMatrix
+  });
+  /**
+   * Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolveAll(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]
+   *
+   * See also:
+   *
+   *    lsolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var R = _denseForwardSubstitution(m, b);
+
+      return R.map(function (r) {
+        return r.valueOf();
+      });
+    }
+  });
+
+  function _denseForwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(function (e) {
+      return e[0];
+    })];
+    var M = m._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // loop columns
+
+    for (var i = 0; i < columns; i++) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], M[i][i]);
+
+          for (var j = i + 1; j < columns; j++) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = (0, _toConsumableArray2.default)(b);
+          bNew[i] = 1;
+
+          for (var _j = i + 1; _j < columns; _j++) {
+            bNew[_j] = subtract(bNew[_j], M[_j][i]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(function (x) {
+      return new DenseMatrix({
+        data: x.map(function (e) {
+          return [e];
+        }),
+        size: [rows, 1]
+      });
+    });
+  }
+
+  function _sparseForwardSubstitution(m, b_) {
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(function (e) {
+      return e[0];
+    })];
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // loop columns
+
+    for (var i = 0; i < columns; i++) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k]; // values & indices (column i)
+
+        var iValues = [];
+        var iIndices = []; // first & last indeces in column
+
+        var firstIndex = ptr[i];
+        var lastIndex = ptr[i + 1]; // find the value at [i, i]
+
+        var Mii = 0;
+
+        for (var j = firstIndex; j < lastIndex; j++) {
+          var J = index[j]; // check row
+
+          if (J === i) {
+            Mii = values[j];
+          } else if (J > i) {
+            // store lower triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], Mii);
+
+          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {
+            var _J = iIndices[_j2];
+            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = (0, _toConsumableArray2.default)(b);
+          bNew[i] = 1;
+
+          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {
+            var _J2 = iIndices[_j3];
+            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(function (x) {
+      return new DenseMatrix({
+        data: x.map(function (e) {
+          return [e];
+        }),
+        size: [rows, 1]
+      });
+    });
+  }
+});
+exports.createLsolveAll = createLsolveAll;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/lusolve.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/lusolve.js
new file mode 100644
index 0000000..172cb36
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/lusolve.js
@@ -0,0 +1,123 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLusolve = void 0;
+
+var _is = require("../../../utils/is.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var _solveValidation = require("./utils/solveValidation.js");
+
+var _csIpvec = require("../sparse/csIpvec.js");
+
+var name = 'lusolve';
+var dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];
+var createLusolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      lup = _ref.lup,
+      slu = _ref.slu,
+      usolve = _ref.usolve,
+      lsolve = _ref.lsolve,
+      DenseMatrix = _ref.DenseMatrix;
+  var solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix: DenseMatrix
+  });
+  /**
+   * Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.
+   *
+   * Syntax:
+   *
+   *    math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b
+   *    math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)
+   *
+   * Examples:
+   *
+   *    const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]
+   *
+   *    const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]
+   *
+   *    const f = math.lup(m)
+   *    const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]
+   *    const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = math.lusolve(a, b)  // [[2], [5]]
+   *
+   * See also:
+   *
+   *    lup, slu, lsolve, usolve
+   *
+   * @param {Matrix | Array | Object} A      Invertible Matrix or the Matrix LU decomposition
+   * @param {Matrix | Array} b               Column Vector
+   * @param {number} [order]                 The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix
+   * @param {Number} [threshold]             Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.
+   *
+   * @return {DenseMatrix | Array}           Column vector with the solution to the linear system A * x = b
+   */
+
+  return typed(name, {
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      a = matrix(a);
+      var d = lup(a);
+
+      var x = _lusolve(d.L, d.U, d.p, null, b);
+
+      return x.valueOf();
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(a, b) {
+      var d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(a, b) {
+      var d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix, number, number': function SparseMatrixArrayMatrixNumberNumber(a, b, order, threshold) {
+      var d = slu(a, order, threshold);
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    },
+    'Object, Array | Matrix': function ObjectArrayMatrix(d, b) {
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    }
+  });
+
+  function _toMatrix(a) {
+    if ((0, _is.isMatrix)(a)) {
+      return a;
+    }
+
+    if ((0, _is.isArray)(a)) {
+      return matrix(a);
+    }
+
+    throw new TypeError('Invalid Matrix LU decomposition');
+  }
+
+  function _lusolve(l, u, p, q, b) {
+    // verify decomposition
+    l = _toMatrix(l);
+    u = _toMatrix(u); // apply row permutations if needed (b is a DenseMatrix)
+
+    if (p) {
+      b = solveValidation(l, b, true);
+      b._data = (0, _csIpvec.csIpvec)(p, b._data);
+    } // use forward substitution to resolve L * y = b
+
+
+    var y = lsolve(l, b); // use backward substitution to resolve U * x = y
+
+    var x = usolve(u, y); // apply column permutations if needed (x is a DenseMatrix)
+
+    if (q) {
+      x._data = (0, _csIpvec.csIpvec)(q, x._data);
+    }
+
+    return x;
+  }
+});
+exports.createLusolve = createLusolve;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/usolve.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolve.js
new file mode 100644
index 0000000..347d31c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolve.js
@@ -0,0 +1,174 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUsolve = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _solveValidation = require("./utils/solveValidation.js");
+
+var name = 'usolve';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+var createUsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      subtract = _ref.subtract,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix: DenseMatrix
+  });
+  /**
+   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolve(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolve(a, b)  // [[8], [9]]
+   *
+   * See also:
+   *
+   *    usolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var r = _denseBackwardSubstitution(m, b);
+
+      return r.valueOf();
+    }
+  });
+
+  function _denseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // result
+
+    var x = [];
+    var mdata = m._data; // loop columns backwards
+
+    for (var j = columns - 1; j >= 0; j--) {
+      // b[j]
+      var bj = bdata[j][0] || 0; // x[j]
+
+      var xj = void 0;
+
+      if (!equalScalar(bj, 0)) {
+        // value at [j, j]
+        var vjj = mdata[j][j];
+
+        if (equalScalar(vjj, 0)) {
+          // system cannot be solved
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        xj = divideScalar(bj, vjj); // loop rows
+
+        for (var i = j - 1; i >= 0; i--) {
+          // update copy of b
+          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // zero value at j
+        xj = 0;
+      } // update x
+
+
+      x[j] = [xj];
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+
+  function _sparseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // result
+
+    var x = []; // loop columns backwards
+
+    for (var j = columns - 1; j >= 0; j--) {
+      var bj = bdata[j][0] || 0;
+
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+        var vjj = 0; // upper triangular matrix values & index (column j)
+
+        var jValues = [];
+        var jIndices = []; // first & last indeces in column
+
+        var firstIndex = ptr[j];
+        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j], loop backwards
+
+        for (var k = lastIndex - 1; k >= firstIndex; k--) {
+          var i = index[k]; // check row (rows are not sorted!)
+
+          if (i === j) {
+            vjj = values[k];
+          } else if (i < j) {
+            // store upper triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        } // at this point we must have a value in vjj
+
+
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        var xj = divideScalar(bj, vjj);
+
+        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {
+          var _i = jIndices[_k];
+          bdata[_i] = [subtract(bdata[_i][0], multiplyScalar(xj, jValues[_k]))];
+        }
+
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
+exports.createUsolve = createUsolve;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/usolveAll.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolveAll.js
new file mode 100644
index 0000000..2ab796d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolveAll.js
@@ -0,0 +1,213 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUsolveAll = void 0;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
+
+var _factory = require("../../../utils/factory.js");
+
+var _solveValidation = require("./utils/solveValidation.js");
+
+var name = 'usolveAll';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+var createUsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      subtract = _ref.subtract,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix: DenseMatrix
+  });
+  /**
+   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolveAll(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]
+   *
+   * See also:
+   *
+   *    usolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var R = _denseBackwardSubstitution(m, b);
+
+      return R.map(function (r) {
+        return r.valueOf();
+      });
+    }
+  });
+
+  function _denseBackwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(function (e) {
+      return e[0];
+    })];
+    var M = m._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // loop columns backwards
+
+    for (var i = columns - 1; i >= 0; i--) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], M[i][i]);
+
+          for (var j = i - 1; j >= 0; j--) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = (0, _toConsumableArray2.default)(b);
+          bNew[i] = 1;
+
+          for (var _j = i - 1; _j >= 0; _j--) {
+            bNew[_j] = subtract(bNew[_j], M[_j][i]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(function (x) {
+      return new DenseMatrix({
+        data: x.map(function (e) {
+          return [e];
+        }),
+        size: [rows, 1]
+      });
+    });
+  }
+
+  function _sparseBackwardSubstitution(m, b_) {
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(function (e) {
+      return e[0];
+    })];
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // loop columns backwards
+
+    for (var i = columns - 1; i >= 0; i--) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k]; // values & indices (column i)
+
+        var iValues = [];
+        var iIndices = []; // first & last indeces in column
+
+        var firstIndex = ptr[i];
+        var lastIndex = ptr[i + 1]; // find the value at [i, i]
+
+        var Mii = 0;
+
+        for (var j = lastIndex - 1; j >= firstIndex; j--) {
+          var J = index[j]; // check row
+
+          if (J === i) {
+            Mii = values[j];
+          } else if (J < i) {
+            // store upper triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], Mii); // loop upper triangular
+
+          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {
+            var _J = iIndices[_j2];
+            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = (0, _toConsumableArray2.default)(b);
+          bNew[i] = 1; // loop upper triangular
+
+          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {
+            var _J2 = iIndices[_j3];
+            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(function (x) {
+      return new DenseMatrix({
+        data: x.map(function (e) {
+          return [e];
+        }),
+        size: [rows, 1]
+      });
+    });
+  }
+});
+exports.createUsolveAll = createUsolveAll;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/utils/solveValidation.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/utils/solveValidation.js
new file mode 100644
index 0000000..012f41e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/utils/solveValidation.js
@@ -0,0 +1,147 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSolveValidation = createSolveValidation;
+
+var _is = require("../../../../utils/is.js");
+
+var _array = require("../../../../utils/array.js");
+
+var _string = require("../../../../utils/string.js");
+
+function createSolveValidation(_ref) {
+  var DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Validates matrix and column vector b for backward/forward substitution algorithms.
+   *
+   * @param {Matrix} m            An N x N matrix
+   * @param {Array | Matrix} b    A column vector
+   * @param {Boolean} copy        Return a copy of vector b
+   *
+   * @return {DenseMatrix}        Dense column vector b
+   */
+  return function solveValidation(m, b, copy) {
+    var mSize = m.size();
+
+    if (mSize.length !== 2) {
+      throw new RangeError('Matrix must be two dimensional (size: ' + (0, _string.format)(mSize) + ')');
+    }
+
+    var rows = mSize[0];
+    var columns = mSize[1];
+
+    if (rows !== columns) {
+      throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(mSize) + ')');
+    }
+
+    var data = [];
+
+    if ((0, _is.isMatrix)(b)) {
+      var bSize = b.size();
+      var bdata = b._data; // 1-dim vector
+
+      if (bSize.length === 1) {
+        if (bSize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        for (var i = 0; i < rows; i++) {
+          data[i] = [bdata[i]];
+        }
+
+        return new DenseMatrix({
+          data: data,
+          size: [rows, 1],
+          datatype: b._datatype
+        });
+      } // 2-dim column
+
+
+      if (bSize.length === 2) {
+        if (bSize[0] !== rows || bSize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        if ((0, _is.isDenseMatrix)(b)) {
+          if (copy) {
+            data = [];
+
+            for (var _i = 0; _i < rows; _i++) {
+              data[_i] = [bdata[_i][0]];
+            }
+
+            return new DenseMatrix({
+              data: data,
+              size: [rows, 1],
+              datatype: b._datatype
+            });
+          }
+
+          return b;
+        }
+
+        if ((0, _is.isSparseMatrix)(b)) {
+          for (var _i2 = 0; _i2 < rows; _i2++) {
+            data[_i2] = [0];
+          }
+
+          var values = b._values;
+          var index = b._index;
+          var ptr = b._ptr;
+
+          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {
+            var _i3 = index[k];
+            data[_i3][0] = values[k];
+          }
+
+          return new DenseMatrix({
+            data: data,
+            size: [rows, 1],
+            datatype: b._datatype
+          });
+        }
+      }
+
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+
+    if ((0, _is.isArray)(b)) {
+      var bsize = (0, _array.arraySize)(b);
+
+      if (bsize.length === 1) {
+        if (bsize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        for (var _i4 = 0; _i4 < rows; _i4++) {
+          data[_i4] = [b[_i4]];
+        }
+
+        return new DenseMatrix({
+          data: data,
+          size: [rows, 1]
+        });
+      }
+
+      if (bsize.length === 2) {
+        if (bsize[0] !== rows || bsize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        for (var _i5 = 0; _i5 < rows; _i5++) {
+          data[_i5] = [b[_i5][0]];
+        }
+
+        return new DenseMatrix({
+          data: data,
+          size: [rows, 1]
+        });
+      }
+
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csAmd.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csAmd.js
new file mode 100644
index 0000000..614ef52
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csAmd.js
@@ -0,0 +1,638 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsAmd = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _csFkeep = require("./csFkeep.js");
+
+var _csFlip = require("./csFlip.js");
+
+var _csTdfs = require("./csTdfs.js");
+
+var name = 'csAmd';
+var dependencies = ['add', 'multiply', 'transpose'];
+var createCsAmd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var add = _ref.add,
+      multiply = _ref.multiply,
+      transpose = _ref.transpose;
+
+  /**
+   * Approximate minimum degree ordering. The minimum degree algorithm is a widely used
+   * heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization
+   * than A. It is a gready method that selects the sparsest pivot row and column during the course
+   * of a right looking sparse Cholesky factorization.
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   *
+   * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
+   * @param {Matrix} m        Sparse Matrix
+   */
+  return function csAmd(order, a) {
+    // check input parameters
+    if (!a || order <= 0 || order > 3) {
+      return null;
+    } // a matrix arrays
+
+
+    var asize = a._size; // rows and columns
+
+    var m = asize[0];
+    var n = asize[1]; // initialize vars
+
+    var lemax = 0; // dense threshold
+
+    var dense = Math.max(16, 10 * Math.sqrt(n));
+    dense = Math.min(n - 2, dense); // create target matrix C
+
+    var cm = _createTargetMatrix(order, a, m, n, dense); // drop diagonal entries
+
+
+    (0, _csFkeep.csFkeep)(cm, _diag, null); // C matrix arrays
+
+    var cindex = cm._index;
+    var cptr = cm._ptr; // number of nonzero elements in C
+
+    var cnz = cptr[n]; // allocate result (n+1)
+
+    var P = []; // create workspace (8 * (n + 1))
+
+    var W = [];
+    var len = 0; // first n + 1 entries
+
+    var nv = n + 1; // next n + 1 entries
+
+    var next = 2 * (n + 1); // next n + 1 entries
+
+    var head = 3 * (n + 1); // next n + 1 entries
+
+    var elen = 4 * (n + 1); // next n + 1 entries
+
+    var degree = 5 * (n + 1); // next n + 1 entries
+
+    var w = 6 * (n + 1); // next n + 1 entries
+
+    var hhead = 7 * (n + 1); // last n + 1 entries
+    // use P as workspace for last
+
+    var last = P; // initialize quotient graph
+
+    var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree); // initialize degree lists
+
+
+    var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next); // minimum degree node
+
+
+    var mindeg = 0; // vars
+
+    var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d; // while (selecting pivots) do
+
+    while (nel < n) {
+      // select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first
+      // finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow
+      // many nodes have been eliminated.
+      for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++) {
+        ;
+      }
+
+      if (W[next + k] !== -1) {
+        last[W[next + k]] = -1;
+      } // remove k from degree list
+
+
+      W[head + mindeg] = W[next + k]; // elenk = |Ek|
+
+      var elenk = W[elen + k]; // # of nodes k represents
+
+      var nvk = W[nv + k]; // W[nv + k] nodes of A eliminated
+
+      nel += nvk; // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is
+      // negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the
+      // degree lists. All elements e in Ek are absorved into element k.
+
+      var dk = 0; // flag k as in Lk
+
+      W[nv + k] = -nvk;
+      var p = cptr[k]; // do in place if W[elen + k] === 0
+
+      var pk1 = elenk === 0 ? p : cnz;
+      var pk2 = pk1;
+
+      for (k1 = 1; k1 <= elenk + 1; k1++) {
+        if (k1 > elenk) {
+          // search the nodes in k
+          e = k; // list of nodes starts at cindex[pj]
+
+          pj = p; // length of list of nodes in k
+
+          ln = W[len + k] - elenk;
+        } else {
+          // search the nodes in e
+          e = cindex[p++];
+          pj = cptr[e]; // length of list of nodes in e
+
+          ln = W[len + e];
+        }
+
+        for (k2 = 1; k2 <= ln; k2++) {
+          i = cindex[pj++]; // check  node i dead, or seen
+
+          if ((nvi = W[nv + i]) <= 0) {
+            continue;
+          } // W[degree + Lk] += size of node i
+
+
+          dk += nvi; // negate W[nv + i] to denote i in Lk
+
+          W[nv + i] = -nvi; // place i in Lk
+
+          cindex[pk2++] = i;
+
+          if (W[next + i] !== -1) {
+            last[W[next + i]] = last[i];
+          } // check we need to remove i from degree list
+
+
+          if (last[i] !== -1) {
+            W[next + last[i]] = W[next + i];
+          } else {
+            W[head + W[degree + i]] = W[next + i];
+          }
+        }
+
+        if (e !== k) {
+          // absorb e into k
+          cptr[e] = (0, _csFlip.csFlip)(k); // e is now a dead element
+
+          W[w + e] = 0;
+        }
+      } // cindex[cnz...nzmax] is free
+
+
+      if (elenk !== 0) {
+        cnz = pk2;
+      } // external degree of k - |Lk\i|
+
+
+      W[degree + k] = dk; // element k is in cindex[pk1..pk2-1]
+
+      cptr[k] = pk1;
+      W[len + k] = pk2 - pk1; // k is now an element
+
+      W[elen + k] = -2; // Find set differences. The scan1 function now computes the set differences |Le \ Lk| for all elements e. At the start of the
+      // scan, no entry in the w array is greater than or equal to mark.
+      // clear w if necessary
+
+      mark = _wclear(mark, lemax, W, w, n); // scan 1: find |Le\Lk|
+
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk]; // check if W[elen + i] empty, skip it
+
+        if ((eln = W[elen + i]) <= 0) {
+          continue;
+        } // W[nv + i] was negated
+
+
+        nvi = -W[nv + i];
+        var wnvi = mark - nvi; // scan Ei
+
+        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {
+          e = cindex[p];
+
+          if (W[w + e] >= mark) {
+            // decrement |Le\Lk|
+            W[w + e] -= nvi;
+          } else if (W[w + e] !== 0) {
+            // ensure e is a live element, 1st time e seen in scan 1
+            W[w + e] = W[degree + e] + wnvi;
+          }
+        }
+      } // degree update
+      // The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash
+      // function h(i) for all nodes in Lk.
+      // scan2: degree update
+
+
+      for (pk = pk1; pk < pk2; pk++) {
+        // consider node i in Lk
+        i = cindex[pk];
+        p1 = cptr[i];
+        p2 = p1 + W[elen + i] - 1;
+        pn = p1; // scan Ei
+
+        for (h = 0, d = 0, p = p1; p <= p2; p++) {
+          e = cindex[p]; // check e is an unabsorbed element
+
+          if (W[w + e] !== 0) {
+            // dext = |Le\Lk|
+            var dext = W[w + e] - mark;
+
+            if (dext > 0) {
+              // sum up the set differences
+              d += dext; // keep e in Ei
+
+              cindex[pn++] = e; // compute the hash of node i
+
+              h += e;
+            } else {
+              // aggressive absorb. e->k
+              cptr[e] = (0, _csFlip.csFlip)(k); // e is a dead element
+
+              W[w + e] = 0;
+            }
+          }
+        } // W[elen + i] = |Ei|
+
+
+        W[elen + i] = pn - p1 + 1;
+        var p3 = pn;
+        var p4 = p1 + W[len + i]; // prune edges in Ai
+
+        for (p = p2 + 1; p < p4; p++) {
+          j = cindex[p]; // check node j dead or in Lk
+
+          var nvj = W[nv + j];
+
+          if (nvj <= 0) {
+            continue;
+          } // degree(i) += |j|
+
+
+          d += nvj; // place j in node list of i
+
+          cindex[pn++] = j; // compute hash for node i
+
+          h += j;
+        } // check for mass elimination
+
+
+        if (d === 0) {
+          // absorb i into k
+          cptr[i] = (0, _csFlip.csFlip)(k);
+          nvi = -W[nv + i]; // |Lk| -= |i|
+
+          dk -= nvi; // |k| += W[nv + i]
+
+          nvk += nvi;
+          nel += nvi;
+          W[nv + i] = 0; // node i is dead
+
+          W[elen + i] = -1;
+        } else {
+          // update degree(i)
+          W[degree + i] = Math.min(W[degree + i], d); // move first node to end
+
+          cindex[pn] = cindex[p3]; // move 1st el. to end of Ei
+
+          cindex[p3] = cindex[p1]; // add k as 1st element in of Ei
+
+          cindex[p1] = k; // new len of adj. list of node i
+
+          W[len + i] = pn - p1 + 1; // finalize hash of i
+
+          h = (h < 0 ? -h : h) % n; // place i in hash bucket
+
+          W[next + i] = W[hhead + h];
+          W[hhead + h] = i; // save hash of i in last[i]
+
+          last[i] = h;
+        }
+      } // finalize |Lk|
+
+
+      W[degree + k] = dk;
+      lemax = Math.max(lemax, dk); // clear w
+
+      mark = _wclear(mark + lemax, lemax, W, w, n); // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.
+      // If two nodes have identical adjacency lists, their hash functions wil be identical.
+
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk]; // check i is dead, skip it
+
+        if (W[nv + i] >= 0) {
+          continue;
+        } // scan hash bucket of node i
+
+
+        h = last[i];
+        i = W[hhead + h]; // hash bucket will be empty
+
+        W[hhead + h] = -1;
+
+        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {
+          ln = W[len + i];
+          eln = W[elen + i];
+
+          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {
+            W[w + cindex[p]] = mark;
+          }
+
+          var jlast = i; // compare i with all j
+
+          for (j = W[next + i]; j !== -1;) {
+            var ok = W[len + j] === ln && W[elen + j] === eln;
+
+            for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {
+              // compare i and j
+              if (W[w + cindex[p]] !== mark) {
+                ok = 0;
+              }
+            } // check i and j are identical
+
+
+            if (ok) {
+              // absorb j into i
+              cptr[j] = (0, _csFlip.csFlip)(i);
+              W[nv + i] += W[nv + j];
+              W[nv + j] = 0; // node j is dead
+
+              W[elen + j] = -1; // delete j from hash bucket
+
+              j = W[next + j];
+              W[next + jlast] = j;
+            } else {
+              // j and i are different
+              jlast = j;
+              j = W[next + j];
+            }
+          }
+        }
+      } // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.
+      // Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.
+
+
+      for (p = pk1, pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk]; // check  i is dead, skip it
+
+        if ((nvi = -W[nv + i]) <= 0) {
+          continue;
+        } // restore W[nv + i]
+
+
+        W[nv + i] = nvi; // compute external degree(i)
+
+        d = W[degree + i] + dk - nvi;
+        d = Math.min(d, n - nel - nvi);
+
+        if (W[head + d] !== -1) {
+          last[W[head + d]] = i;
+        } // put i back in degree list
+
+
+        W[next + i] = W[head + d];
+        last[i] = -1;
+        W[head + d] = i; // find new minimum degree
+
+        mindeg = Math.min(mindeg, d);
+        W[degree + i] = d; // place i in Lk
+
+        cindex[p++] = i;
+      } // # nodes absorbed into k
+
+
+      W[nv + k] = nvk; // length of adj list of element k
+
+      if ((W[len + k] = p - pk1) === 0) {
+        // k is a root of the tree
+        cptr[k] = -1; // k is now a dead element
+
+        W[w + k] = 0;
+      }
+
+      if (elenk !== 0) {
+        // free unused space in Lk
+        cnz = p;
+      }
+    } // Postordering. The elimination is complete, but no permutation has been computed. All that is left
+    // of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if
+    // nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation
+    // is computed. The tree is restored by unflipping all of ptr.
+    // fix assembly tree
+
+
+    for (i = 0; i < n; i++) {
+      cptr[i] = (0, _csFlip.csFlip)(cptr[i]);
+    }
+
+    for (j = 0; j <= n; j++) {
+      W[head + j] = -1;
+    } // place unordered nodes in lists
+
+
+    for (j = n; j >= 0; j--) {
+      // skip if j is an element
+      if (W[nv + j] > 0) {
+        continue;
+      } // place j in list of its parent
+
+
+      W[next + j] = W[head + cptr[j]];
+      W[head + cptr[j]] = j;
+    } // place elements in lists
+
+
+    for (e = n; e >= 0; e--) {
+      // skip unless e is an element
+      if (W[nv + e] <= 0) {
+        continue;
+      }
+
+      if (cptr[e] !== -1) {
+        // place e in list of its parent
+        W[next + e] = W[head + cptr[e]];
+        W[head + cptr[e]] = e;
+      }
+    } // postorder the assembly tree
+
+
+    for (k = 0, i = 0; i <= n; i++) {
+      if (cptr[i] === -1) {
+        k = (0, _csTdfs.csTdfs)(i, k, W, head, next, P, w);
+      }
+    } // remove last item in array
+
+
+    P.splice(P.length - 1, 1); // return P
+
+    return P;
+  };
+  /**
+   * Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation
+   * vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.
+   *
+   * Order: 0
+   *   A natural ordering P=null matrix is returned.
+   *
+   * Order: 1
+   *   Matrix must be square. This is appropriate for a Cholesky or LU factorization.
+   *   P = M + M'
+   *
+   * Order: 2
+   *   Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.
+   *   P = M' * M
+   *
+   * Order: 3
+   *   This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.
+   *   P = M' * M
+   */
+
+  function _createTargetMatrix(order, a, m, n, dense) {
+    // compute A'
+    var at = transpose(a); // check order = 1, matrix must be square
+
+    if (order === 1 && n === m) {
+      // C = A + A'
+      return add(a, at);
+    } // check order = 2, drop dense columns from M'
+
+
+    if (order === 2) {
+      // transpose arrays
+      var tindex = at._index;
+      var tptr = at._ptr; // new column index
+
+      var p2 = 0; // loop A' columns (rows)
+
+      for (var j = 0; j < m; j++) {
+        // column j of AT starts here
+        var p = tptr[j]; // new column j starts here
+
+        tptr[j] = p2; // skip dense col j
+
+        if (tptr[j + 1] - p > dense) {
+          continue;
+        } // map rows in column j of A
+
+
+        for (var p1 = tptr[j + 1]; p < p1; p++) {
+          tindex[p2++] = tindex[p];
+        }
+      } // finalize AT
+
+
+      tptr[m] = p2; // recreate A from new transpose matrix
+
+      a = transpose(at); // use A' * A
+
+      return multiply(at, a);
+    } // use A' * A, square or rectangular matrix
+
+
+    return multiply(at, a);
+  }
+  /**
+   * Initialize quotient graph. There are four kind of nodes and elements that must be represented:
+   *
+   *  - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.
+   *  - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).
+   *  - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.
+   *  - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).
+   */
+
+
+  function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {
+    // Initialize quotient graph
+    for (var k = 0; k < n; k++) {
+      W[len + k] = cptr[k + 1] - cptr[k];
+    }
+
+    W[len + n] = 0; // initialize workspace
+
+    for (var i = 0; i <= n; i++) {
+      // degree list i is empty
+      W[head + i] = -1;
+      last[i] = -1;
+      W[next + i] = -1; // hash list i is empty
+
+      W[hhead + i] = -1; // node i is just one node
+
+      W[nv + i] = 1; // node i is alive
+
+      W[w + i] = 1; // Ek of node i is empty
+
+      W[elen + i] = 0; // degree of node i
+
+      W[degree + i] = W[len + i];
+    } // clear w
+
+
+    var mark = _wclear(0, 0, W, w, n); // n is a dead element
+
+
+    W[elen + n] = -2; // n is a root of assembly tree
+
+    cptr[n] = -1; // n is a dead element
+
+    W[w + n] = 0; // return mark
+
+    return mark;
+  }
+  /**
+   * Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with
+   * degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the
+   * output permutation p.
+   */
+
+
+  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {
+    // result
+    var nel = 0; // loop columns
+
+    for (var i = 0; i < n; i++) {
+      // degree @ i
+      var d = W[degree + i]; // check node i is empty
+
+      if (d === 0) {
+        // element i is dead
+        W[elen + i] = -2;
+        nel++; // i is a root of assembly tree
+
+        cptr[i] = -1;
+        W[w + i] = 0;
+      } else if (d > dense) {
+        // absorb i into element n
+        W[nv + i] = 0; // node i is dead
+
+        W[elen + i] = -1;
+        nel++;
+        cptr[i] = (0, _csFlip.csFlip)(n);
+        W[nv + n]++;
+      } else {
+        var h = W[head + d];
+
+        if (h !== -1) {
+          last[h] = i;
+        } // put node i in degree list d
+
+
+        W[next + i] = W[head + d];
+        W[head + d] = i;
+      }
+    }
+
+    return nel;
+  }
+
+  function _wclear(mark, lemax, W, w, n) {
+    if (mark < 2 || mark + lemax < 0) {
+      for (var k = 0; k < n; k++) {
+        if (W[w + k] !== 0) {
+          W[w + k] = 1;
+        }
+      }
+
+      mark = 2;
+    } // at this point, W [0..n-1] < mark holds
+
+
+    return mark;
+  }
+
+  function _diag(i, j) {
+    return i !== j;
+  }
+});
+exports.createCsAmd = createCsAmd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csChol.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csChol.js
new file mode 100644
index 0000000..0221d21
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csChol.js
@@ -0,0 +1,177 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsChol = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _csEreach = require("./csEreach.js");
+
+var _csSymperm = require("./csSymperm.js");
+
+var name = 'csChol';
+var dependencies = ['divideScalar', 'sqrt', 'subtract', 'multiply', 'im', 're', 'conj', 'equal', 'smallerEq', 'SparseMatrix'];
+var createCsChol = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var divideScalar = _ref.divideScalar,
+      sqrt = _ref.sqrt,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply,
+      im = _ref.im,
+      re = _ref.re,
+      conj = _ref.conj,
+      equal = _ref.equal,
+      smallerEq = _ref.smallerEq,
+      SparseMatrix = _ref.SparseMatrix;
+  var csSymperm = (0, _csSymperm.createCsSymperm)({
+    conj: conj,
+    SparseMatrix: SparseMatrix
+  });
+  /**
+   * Computes the Cholesky factorization of matrix A. It computes L and P so
+   * L * L' = P * A * P'
+   *
+   * @param {Matrix}  m               The A Matrix to factorize, only upper triangular part used
+   * @param {Object}  s               The symbolic analysis from cs_schol()
+   *
+   * @return {Number}                 The numeric Cholesky factorization of A or null
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+
+  return function csChol(m, s) {
+    // validate input
+    if (!m) {
+      return null;
+    } // m arrays
+
+
+    var size = m._size; // columns
+
+    var n = size[1]; // symbolic analysis result
+
+    var parent = s.parent;
+    var cp = s.cp;
+    var pinv = s.pinv; // L arrays
+
+    var lvalues = [];
+    var lindex = [];
+    var lptr = []; // L
+
+    var L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    }); // vars
+
+    var c = []; // (2 * n)
+
+    var x = []; // (n)
+    // compute C = P * A * P'
+
+    var cm = pinv ? csSymperm(m, pinv, 1) : m; // C matrix arrays
+
+    var cvalues = cm._values;
+    var cindex = cm._index;
+    var cptr = cm._ptr; // vars
+
+    var k, p; // initialize variables
+
+    for (k = 0; k < n; k++) {
+      lptr[k] = c[k] = cp[k];
+    } // compute L(k,:) for L*L' = C
+
+
+    for (k = 0; k < n; k++) {
+      // nonzero pattern of L(k,:)
+      var top = (0, _csEreach.csEreach)(cm, k, parent, c); // x (0:k) is now zero
+
+      x[k] = 0; // x = full(triu(C(:,k)))
+
+      for (p = cptr[k]; p < cptr[k + 1]; p++) {
+        if (cindex[p] <= k) {
+          x[cindex[p]] = cvalues[p];
+        }
+      } // d = C(k,k)
+
+
+      var d = x[k]; // clear x for k+1st iteration
+
+      x[k] = 0; // solve L(0:k-1,0:k-1) * x = C(:,k)
+
+      for (; top < n; top++) {
+        // s[top..n-1] is pattern of L(k,:)
+        var i = s[top]; // L(k,i) = x (i) / L(i,i)
+
+        var lki = divideScalar(x[i], lvalues[lptr[i]]); // clear x for k+1st iteration
+
+        x[i] = 0;
+
+        for (p = lptr[i] + 1; p < c[i]; p++) {
+          // row
+          var r = lindex[p]; // update x[r]
+
+          x[r] = subtract(x[r], multiply(lvalues[p], lki));
+        } // d = d - L(k,i)*L(k,i)
+
+
+        d = subtract(d, multiply(lki, conj(lki)));
+        p = c[i]++; // store L(k,i) in column i
+
+        lindex[p] = k;
+        lvalues[p] = conj(lki);
+      } // compute L(k,k)
+
+
+      if (smallerEq(re(d), 0) || !equal(im(d), 0)) {
+        // not pos def
+        return null;
+      }
+
+      p = c[k]++; //  store L(k,k) = sqrt(d) in column k
+
+      lindex[p] = k;
+      lvalues[p] = sqrt(d);
+    } // finalize L
+
+
+    lptr[n] = cp[n]; // P matrix
+
+    var P; // check we need to calculate P
+
+    if (pinv) {
+      // P arrays
+      var pvalues = [];
+      var pindex = [];
+      var pptr = []; // create P matrix
+
+      for (p = 0; p < n; p++) {
+        // initialize ptr (one value per column)
+        pptr[p] = p; // index (apply permutation vector)
+
+        pindex.push(pinv[p]); // value 1
+
+        pvalues.push(1);
+      } // update ptr
+
+
+      pptr[n] = n; // P
+
+      P = new SparseMatrix({
+        values: pvalues,
+        index: pindex,
+        ptr: pptr,
+        size: [n, n]
+      });
+    } // return L & P
+
+
+    return {
+      L: L,
+      P: P
+    };
+  };
+});
+exports.createCsChol = createCsChol;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCounts.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCounts.js
new file mode 100644
index 0000000..313a15a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCounts.js
@@ -0,0 +1,148 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsCounts = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _csLeaf = require("./csLeaf.js");
+
+var name = 'csCounts';
+var dependencies = ['transpose'];
+var createCsCounts = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var transpose = _ref.transpose;
+
+  /**
+   * Computes the column counts using the upper triangular part of A.
+   * It transposes A internally, none of the input parameters are modified.
+   *
+   * @param {Matrix} a           The sparse matrix A
+   *
+   * @param {Matrix} ata         Count the columns of A'A instead
+   *
+   * @return                     An array of size n of the column counts or null on error
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function (a, parent, post, ata) {
+    // check inputs
+    if (!a || !parent || !post) {
+      return null;
+    } // a matrix arrays
+
+
+    var asize = a._size; // rows and columns
+
+    var m = asize[0];
+    var n = asize[1]; // variables
+
+    var i, j, k, J, p, p0, p1; // workspace size
+
+    var s = 4 * n + (ata ? n + m + 1 : 0); // allocate workspace
+
+    var w = []; // (s)
+
+    var ancestor = 0; // first n entries
+
+    var maxfirst = n; // next n entries
+
+    var prevleaf = 2 * n; // next n entries
+
+    var first = 3 * n; // next n entries
+
+    var head = 4 * n; // next n + 1 entries (used when ata is true)
+
+    var next = 5 * n + 1; // last entries in workspace
+    // clear workspace w[0..s-1]
+
+    for (k = 0; k < s; k++) {
+      w[k] = -1;
+    } // allocate result
+
+
+    var colcount = []; // (n)
+    // AT = A'
+
+    var at = transpose(a); // at arrays
+
+    var tindex = at._index;
+    var tptr = at._ptr; // find w[first + j]
+
+    for (k = 0; k < n; k++) {
+      j = post[k]; // colcount[j]=1 if j is a leaf
+
+      colcount[j] = w[first + j] === -1 ? 1 : 0;
+
+      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {
+        w[first + j] = k;
+      }
+    } // initialize ata if needed
+
+
+    if (ata) {
+      // invert post
+      for (k = 0; k < n; k++) {
+        w[post[k]] = k;
+      } // loop rows (columns in AT)
+
+
+      for (i = 0; i < m; i++) {
+        // values in column i of AT
+        for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) {
+          k = Math.min(k, w[tindex[p]]);
+        } // place row i in linked list k
+
+
+        w[next + i] = w[head + k];
+        w[head + k] = i;
+      }
+    } // each node in its own set
+
+
+    for (i = 0; i < n; i++) {
+      w[ancestor + i] = i;
+    }
+
+    for (k = 0; k < n; k++) {
+      // j is the kth node in postordered etree
+      j = post[k]; // check j is not a root
+
+      if (parent[j] !== -1) {
+        colcount[parent[j]]--;
+      } // J=j for LL'=A case
+
+
+      for (J = ata ? w[head + k] : j; J !== -1; J = ata ? w[next + J] : -1) {
+        for (p = tptr[J]; p < tptr[J + 1]; p++) {
+          i = tindex[p];
+          var r = (0, _csLeaf.csLeaf)(i, j, w, first, maxfirst, prevleaf, ancestor); // check A(i,j) is in skeleton
+
+          if (r.jleaf >= 1) {
+            colcount[j]++;
+          } // check account for overlap in q
+
+
+          if (r.jleaf === 2) {
+            colcount[r.q]--;
+          }
+        }
+      }
+
+      if (parent[j] !== -1) {
+        w[ancestor + j] = parent[j];
+      }
+    } // sum up colcount's of each child
+
+
+    for (j = 0; j < n; j++) {
+      if (parent[j] !== -1) {
+        colcount[parent[j]] += colcount[j];
+      }
+    }
+
+    return colcount;
+  };
+});
+exports.createCsCounts = createCsCounts;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCumsum.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCumsum.js
new file mode 100644
index 0000000..69ef403
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCumsum.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csCumsum = csCumsum;
+
+/**
+ * It sets the p[i] equal to the sum of c[0] through c[i-1].
+ *
+ * @param {Array}   ptr             The Sparse Matrix ptr array
+ * @param {Array}   c               The Sparse Matrix ptr array
+ * @param {Number}  n               The number of columns
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csCumsum(ptr, c, n) {
+  // variables
+  var i;
+  var nz = 0;
+
+  for (i = 0; i < n; i++) {
+    // initialize ptr @ i
+    ptr[i] = nz; // increment number of nonzeros
+
+    nz += c[i]; // also copy p[0..n-1] back into c[0..n-1]
+
+    c[i] = ptr[i];
+  } // finalize ptr
+
+
+  ptr[n] = nz; // return sum (c [0..n-1])
+
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csDfs.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csDfs.js
new file mode 100644
index 0000000..90e85eb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csDfs.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csDfs = csDfs;
+
+var _csMarked = require("./csMarked.js");
+
+var _csMark = require("./csMark.js");
+
+var _csUnflip = require("./csUnflip.js");
+
+/**
+ * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
+ * at nodes in B (see csReach()).
+ *
+ * @param {Number}  j               The starting node for the DFS algorithm
+ * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored
+ * @param {Number}  top             Start index in stack xi[top..n-1]
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+ *
+ * @return {Number}                 New value of top
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csDfs(j, g, top, xi, pinv) {
+  // g arrays
+  var index = g._index;
+  var ptr = g._ptr;
+  var size = g._size; // columns
+
+  var n = size[1]; // vars
+
+  var i, p, p2; // initialize head
+
+  var head = 0; // initialize the recursion stack
+
+  xi[0] = j; // loop
+
+  while (head >= 0) {
+    // get j from the top of the recursion stack
+    j = xi[head]; // apply permutation vector
+
+    var jnew = pinv ? pinv[j] : j; // check node j is marked
+
+    if (!(0, _csMarked.csMarked)(ptr, j)) {
+      // mark node j as visited
+      (0, _csMark.csMark)(ptr, j); // update stack (last n entries in xi)
+
+      xi[n + head] = jnew < 0 ? 0 : (0, _csUnflip.csUnflip)(ptr[jnew]);
+    } // node j done if no unvisited neighbors
+
+
+    var done = 1; // examine all neighbors of j, stack (last n entries in xi)
+
+    for (p = xi[n + head], p2 = jnew < 0 ? 0 : (0, _csUnflip.csUnflip)(ptr[jnew + 1]); p < p2; p++) {
+      // consider neighbor node i
+      i = index[p]; // check we have visited node i, skip it
+
+      if ((0, _csMarked.csMarked)(ptr, i)) {
+        continue;
+      } // pause depth-first search of node j, update stack (last n entries in xi)
+
+
+      xi[n + head] = p; // start dfs at node i
+
+      xi[++head] = i; // node j is not done
+
+      done = 0; // break, to start dfs(i)
+
+      break;
+    } // check depth-first search at node j is done
+
+
+    if (done) {
+      // remove j from the recursion stack
+      head--; // and place in the output stack
+
+      xi[--top] = j;
+    }
+  }
+
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEreach.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEreach.js
new file mode 100644
index 0000000..0d2139c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEreach.js
@@ -0,0 +1,74 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csEreach = csEreach;
+
+var _csMark = require("./csMark.js");
+
+var _csMarked = require("./csMarked.js");
+
+/**
+ * Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k))
+ *
+ * @param {Matrix}  a               The A matrix
+ * @param {Number}  k               The kth column in A
+ * @param {Array}   parent          The parent vector from the symbolic analysis result
+ * @param {Array}   w               The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csEreach(a, k, parent, w) {
+  // a arrays
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size; // columns
+
+  var n = asize[1]; // initialize top
+
+  var top = n; // vars
+
+  var p, p0, p1, len; // mark node k as visited
+
+  (0, _csMark.csMark)(w, k); // loop values & index for column k
+
+  for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+    // A(i,k) is nonzero
+    var i = aindex[p]; // only use upper triangular part of A
+
+    if (i > k) {
+      continue;
+    } // traverse up etree
+
+
+    for (len = 0; !(0, _csMarked.csMarked)(w, i); i = parent[i]) {
+      // L(k,i) is nonzero, last n entries in w
+      w[n + len++] = i; // mark i as visited
+
+      (0, _csMark.csMark)(w, i);
+    }
+
+    while (len > 0) {
+      // decrement top & len
+      --top;
+      --len; // push path onto stack, last n entries in w
+
+      w[n + top] = w[n + len];
+    }
+  } // unmark all nodes
+
+
+  for (p = top; p < n; p++) {
+    // use stack value, last n entries in w
+    (0, _csMark.csMark)(w, w[n + p]);
+  } // unmark node k
+
+
+  (0, _csMark.csMark)(w, k); // s[top..n-1] contains pattern of L(k,:)
+
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEtree.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEtree.js
new file mode 100644
index 0000000..c83a087
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEtree.js
@@ -0,0 +1,80 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csEtree = csEtree;
+
+/**
+ * Computes the elimination tree of Matrix A (using triu(A)) or the
+ * elimination tree of A'A without forming A'A.
+ *
+ * @param {Matrix}  a               The A Matrix
+ * @param {boolean} ata             A value of true the function computes the etree of A'A
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csEtree(a, ata) {
+  // check inputs
+  if (!a) {
+    return null;
+  } // a arrays
+
+
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size; // rows & columns
+
+  var m = asize[0];
+  var n = asize[1]; // allocate result
+
+  var parent = []; // (n)
+  // allocate workspace
+
+  var w = []; // (n + (ata ? m : 0))
+
+  var ancestor = 0; // first n entries in w
+
+  var prev = n; // last m entries (ata = true)
+
+  var i, inext; // check we are calculating A'A
+
+  if (ata) {
+    // initialize workspace
+    for (i = 0; i < m; i++) {
+      w[prev + i] = -1;
+    }
+  } // loop columns
+
+
+  for (var k = 0; k < n; k++) {
+    // node k has no parent yet
+    parent[k] = -1; // nor does k have an ancestor
+
+    w[ancestor + k] = -1; // values in column k
+
+    for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+      // row
+      var r = aindex[p]; // node
+
+      i = ata ? w[prev + r] : r; // traverse from i to k
+
+      for (; i !== -1 && i < k; i = inext) {
+        // inext = ancestor of i
+        inext = w[ancestor + i]; // path compression
+
+        w[ancestor + i] = k; // check no anc., parent is k
+
+        if (inext === -1) {
+          parent[i] = k;
+        }
+      }
+
+      if (ata) {
+        w[prev + r] = k;
+      }
+    }
+  }
+
+  return parent;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFkeep.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFkeep.js
new file mode 100644
index 0000000..0bfe76b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFkeep.js
@@ -0,0 +1,67 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csFkeep = csFkeep;
+
+/**
+ * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
+ *
+ * @param {Matrix}   a              The sparse matrix
+ * @param {function} callback       The callback function, function will be invoked with the following args:
+ *                                    - The entry row
+ *                                    - The entry column
+ *                                    - The entry value
+ *                                    - The state parameter
+ * @param {any}      other          The state
+ *
+ * @return                          The number of nonzero elements in the matrix
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csFkeep(a, callback, other) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size; // columns
+
+  var n = asize[1]; // nonzero items
+
+  var nz = 0; // loop columns
+
+  for (var j = 0; j < n; j++) {
+    // get current location of col j
+    var p = aptr[j]; // record new location of col j
+
+    aptr[j] = nz;
+
+    for (; p < aptr[j + 1]; p++) {
+      // check we need to keep this item
+      if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {
+        // keep A(i,j)
+        aindex[nz] = aindex[p]; // check we need to process values (pattern only)
+
+        if (avalues) {
+          avalues[nz] = avalues[p];
+        } // increment nonzero items
+
+
+        nz++;
+      }
+    }
+  } // finalize A
+
+
+  aptr[n] = nz; // trim arrays
+
+  aindex.splice(nz, aindex.length - nz); // check we need to process values (pattern only)
+
+  if (avalues) {
+    avalues.splice(nz, avalues.length - nz);
+  } // return number of nonzero items
+
+
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFlip.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFlip.js
new file mode 100644
index 0000000..f7d9bff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFlip.js
@@ -0,0 +1,18 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csFlip = csFlip;
+
+/**
+ * This function "flips" its input about the integer -1.
+ *
+ * @param {Number}  i               The value to flip
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csFlip(i) {
+  // flip the value
+  return -i - 2;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csIpvec.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csIpvec.js
new file mode 100644
index 0000000..e8da294
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csIpvec.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csIpvec = csIpvec;
+
+/**
+ * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.
+ *
+ * @param {Array} p           The permutation vector of length n. null value denotes identity
+ * @param {Array} b           The input vector
+ *
+ * @return {Array}            The output vector x = P'b
+ */
+function csIpvec(p, b) {
+  // vars
+  var k;
+  var n = b.length;
+  var x = []; // check permutation vector was provided, p = null denotes identity
+
+  if (p) {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // apply permutation
+      x[p[k]] = b[k];
+    }
+  } else {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // x[i] = b[i]
+      x[k] = b[k];
+    }
+  }
+
+  return x;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLeaf.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLeaf.js
new file mode 100644
index 0000000..8578f02
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLeaf.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csLeaf = csLeaf;
+
+/**
+ * This function determines if j is a leaf of the ith row subtree.
+ * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)
+ *
+ * @param {Number}  i               The ith row subtree
+ * @param {Number}  j               The node to test
+ * @param {Array}   w               The workspace array
+ * @param {Number}  first           The index offset within the workspace for the first array
+ * @param {Number}  maxfirst        The index offset within the workspace for the maxfirst array
+ * @param {Number}  prevleaf        The index offset within the workspace for the prevleaf array
+ * @param {Number}  ancestor        The index offset within the workspace for the ancestor array
+ *
+ * @return {Object}
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {
+  var s, sparent; // our result
+
+  var jleaf = 0;
+  var q; // check j is a leaf
+
+  if (i <= j || w[first + j] <= w[maxfirst + i]) {
+    return -1;
+  } // update max first[j] seen so far
+
+
+  w[maxfirst + i] = w[first + j]; // jprev = previous leaf of ith subtree
+
+  var jprev = w[prevleaf + i];
+  w[prevleaf + i] = j; // check j is first or subsequent leaf
+
+  if (jprev === -1) {
+    // 1st leaf, q = root of ith subtree
+    jleaf = 1;
+    q = i;
+  } else {
+    // update jleaf
+    jleaf = 2; // q = least common ancester (jprev,j)
+
+    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]) {
+      ;
+    }
+
+    for (s = jprev; s !== q; s = sparent) {
+      // path compression
+      sparent = w[ancestor + s];
+      w[ancestor + s] = q;
+    }
+  }
+
+  return {
+    jleaf: jleaf,
+    q: q
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLu.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLu.js
new file mode 100644
index 0000000..38e6544
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLu.js
@@ -0,0 +1,206 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsLu = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _csSpsolve = require("./csSpsolve.js");
+
+var name = 'csLu';
+var dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+var createCsLu = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var abs = _ref.abs,
+      divideScalar = _ref.divideScalar,
+      multiply = _ref.multiply,
+      subtract = _ref.subtract,
+      larger = _ref.larger,
+      largerEq = _ref.largerEq,
+      SparseMatrix = _ref.SparseMatrix;
+  var csSpsolve = (0, _csSpsolve.createCsSpsolve)({
+    divideScalar: divideScalar,
+    multiply: multiply,
+    subtract: subtract
+  });
+  /**
+   * Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization
+   * algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L
+   * and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so
+   * L * U = A(p, q), where p is the inverse of pinv.
+   *
+   * @param {Matrix}  m               The A Matrix to factorize
+   * @param {Object}  s               The symbolic analysis from csSqr(). Provides the fill-reducing
+   *                                  column ordering q
+   * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Number}                 The numeric LU factorization of A or null
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+
+  return function csLu(m, s, tol) {
+    // validate input
+    if (!m) {
+      return null;
+    } // m arrays
+
+
+    var size = m._size; // columns
+
+    var n = size[1]; // symbolic analysis result
+
+    var q;
+    var lnz = 100;
+    var unz = 100; // update symbolic analysis parameters
+
+    if (s) {
+      q = s.q;
+      lnz = s.lnz || lnz;
+      unz = s.unz || unz;
+    } // L arrays
+
+
+    var lvalues = []; // (lnz)
+
+    var lindex = []; // (lnz)
+
+    var lptr = []; // (n + 1)
+    // L
+
+    var L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    }); // U arrays
+
+    var uvalues = []; // (unz)
+
+    var uindex = []; // (unz)
+
+    var uptr = []; // (n + 1)
+    // U
+
+    var U = new SparseMatrix({
+      values: uvalues,
+      index: uindex,
+      ptr: uptr,
+      size: [n, n]
+    }); // inverse of permutation vector
+
+    var pinv = []; // (n)
+    // vars
+
+    var i, p; // allocate arrays
+
+    var x = []; // (n)
+
+    var xi = []; // (2 * n)
+    // initialize variables
+
+    for (i = 0; i < n; i++) {
+      // clear workspace
+      x[i] = 0; // no rows pivotal yet
+
+      pinv[i] = -1; // no cols of L yet
+
+      lptr[i + 1] = 0;
+    } // reset number of nonzero elements in L and U
+
+
+    lnz = 0;
+    unz = 0; // compute L(:,k) and U(:,k)
+
+    for (var k = 0; k < n; k++) {
+      // update ptr
+      lptr[k] = lnz;
+      uptr[k] = unz; // apply column permutations if needed
+
+      var col = q ? q[k] : k; // solve triangular system, x = L\A(:,col)
+
+      var top = csSpsolve(L, m, col, xi, x, pinv, 1); // find pivot
+
+      var ipiv = -1;
+      var a = -1; // loop xi[] from top -> n
+
+      for (p = top; p < n; p++) {
+        // x[i] is nonzero
+        i = xi[p]; // check row i is not yet pivotal
+
+        if (pinv[i] < 0) {
+          // absolute value of x[i]
+          var xabs = abs(x[i]); // check absoulte value is greater than pivot value
+
+          if (larger(xabs, a)) {
+            // largest pivot candidate so far
+            a = xabs;
+            ipiv = i;
+          }
+        } else {
+          // x(i) is the entry U(pinv[i],k)
+          uindex[unz] = pinv[i];
+          uvalues[unz++] = x[i];
+        }
+      } // validate we found a valid pivot
+
+
+      if (ipiv === -1 || a <= 0) {
+        return null;
+      } // update actual pivot column, give preference to diagonal value
+
+
+      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {
+        ipiv = col;
+      } // the chosen pivot
+
+
+      var pivot = x[ipiv]; // last entry in U(:,k) is U(k,k)
+
+      uindex[unz] = k;
+      uvalues[unz++] = pivot; // ipiv is the kth pivot row
+
+      pinv[ipiv] = k; // first entry in L(:,k) is L(k,k) = 1
+
+      lindex[lnz] = ipiv;
+      lvalues[lnz++] = 1; // L(k+1:n,k) = x / pivot
+
+      for (p = top; p < n; p++) {
+        // row
+        i = xi[p]; // check x(i) is an entry in L(:,k)
+
+        if (pinv[i] < 0) {
+          // save unpermuted row in L
+          lindex[lnz] = i; // scale pivot column
+
+          lvalues[lnz++] = divideScalar(x[i], pivot);
+        } // x[0..n-1] = 0 for next k
+
+
+        x[i] = 0;
+      }
+    } // update ptr
+
+
+    lptr[n] = lnz;
+    uptr[n] = unz; // fix row indices of L for final pinv
+
+    for (p = 0; p < lnz; p++) {
+      lindex[p] = pinv[lindex[p]];
+    } // trim arrays
+
+
+    lvalues.splice(lnz, lvalues.length - lnz);
+    lindex.splice(lnz, lindex.length - lnz);
+    uvalues.splice(unz, uvalues.length - unz);
+    uindex.splice(unz, uindex.length - unz); // return LU factor
+
+    return {
+      L: L,
+      U: U,
+      pinv: pinv
+    };
+  };
+});
+exports.createCsLu = createCsLu;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMark.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMark.js
new file mode 100644
index 0000000..98a330b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMark.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csMark = csMark;
+
+var _csFlip = require("./csFlip.js");
+
+/**
+ * Marks the node at w[j]
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csMark(w, j) {
+  // mark w[j]
+  w[j] = (0, _csFlip.csFlip)(w[j]);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMarked.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMarked.js
new file mode 100644
index 0000000..75486fc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMarked.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csMarked = csMarked;
+
+/**
+ * Checks if the node at w[j] is marked
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csMarked(w, j) {
+  // check node is marked
+  return w[j] < 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPermute.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPermute.js
new file mode 100644
index 0000000..988f347
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPermute.js
@@ -0,0 +1,70 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csPermute = csPermute;
+
+/**
+ * Permutes a sparse matrix C = P * A * Q
+ *
+ * @param {SparseMatrix}  a         The Matrix A
+ * @param {Array}   pinv            The row permutation vector
+ * @param {Array}   q               The column permutation vector
+ * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise
+ *
+ * @return {Matrix}                 C = P * A * Q, null on error
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csPermute(a, pinv, q, values) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size;
+  var adt = a._datatype; // rows & columns
+
+  var m = asize[0];
+  var n = asize[1]; // c arrays
+
+  var cvalues = values && a._values ? [] : null;
+  var cindex = []; // (aptr[n])
+
+  var cptr = []; // (n + 1)
+  // initialize vars
+
+  var nz = 0; // loop columns
+
+  for (var k = 0; k < n; k++) {
+    // column k of C is column q[k] of A
+    cptr[k] = nz; // apply column permutation
+
+    var j = q ? q[k] : k; // loop values in column j of A
+
+    for (var t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {
+      // row i of A is row pinv[i] of C
+      var r = pinv ? pinv[aindex[t]] : aindex[t]; // index
+
+      cindex[nz] = r; // check we need to populate values
+
+      if (cvalues) {
+        cvalues[nz] = avalues[t];
+      } // increment number of nonzero elements
+
+
+      nz++;
+    }
+  } // finalize the last column of C
+
+
+  cptr[n] = nz; // return C matrix
+
+  return a.createSparseMatrix({
+    values: cvalues,
+    index: cindex,
+    ptr: cptr,
+    size: [m, n],
+    datatype: adt
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPost.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPost.js
new file mode 100644
index 0000000..7749de3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPost.js
@@ -0,0 +1,66 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csPost = csPost;
+
+var _csTdfs = require("./csTdfs.js");
+
+/**
+ * Post order a tree of forest
+ *
+ * @param {Array}   parent          The tree or forest
+ * @param {Number}  n               Number of columns
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csPost(parent, n) {
+  // check inputs
+  if (!parent) {
+    return null;
+  } // vars
+
+
+  var k = 0;
+  var j; // allocate result
+
+  var post = []; // (n)
+  // workspace, head: first n entries, next: next n entries, stack: last n entries
+
+  var w = []; // (3 * n)
+
+  var head = 0;
+  var next = n;
+  var stack = 2 * n; // initialize workspace
+
+  for (j = 0; j < n; j++) {
+    // empty linked lists
+    w[head + j] = -1;
+  } // traverse nodes in reverse order
+
+
+  for (j = n - 1; j >= 0; j--) {
+    // check j is a root
+    if (parent[j] === -1) {
+      continue;
+    } // add j to list of its parent
+
+
+    w[next + j] = w[head + parent[j]];
+    w[head + parent[j]] = j;
+  } // loop nodes
+
+
+  for (j = 0; j < n; j++) {
+    // skip j if it is not a root
+    if (parent[j] !== -1) {
+      continue;
+    } // depth-first search
+
+
+    k = (0, _csTdfs.csTdfs)(j, k, w, head, next, post, stack);
+  }
+
+  return post;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csReach.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csReach.js
new file mode 100644
index 0000000..69effd9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csReach.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csReach = csReach;
+
+var _csMarked = require("./csMarked.js");
+
+var _csMark = require("./csMark.js");
+
+var _csDfs = require("./csDfs.js");
+
+/**
+ * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
+ * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The
+ * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).
+ *
+ * @param {Matrix}  g               The G matrix
+ * @param {Matrix}  b               The B matrix
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csReach(g, b, k, xi, pinv) {
+  // g arrays
+  var gptr = g._ptr;
+  var gsize = g._size; // b arrays
+
+  var bindex = b._index;
+  var bptr = b._ptr; // columns
+
+  var n = gsize[1]; // vars
+
+  var p, p0, p1; // initialize top
+
+  var top = n; // loop column indeces in B
+
+  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+    // node i
+    var i = bindex[p]; // check node i is marked
+
+    if (!(0, _csMarked.csMarked)(gptr, i)) {
+      // start a dfs at unmarked node i
+      top = (0, _csDfs.csDfs)(i, g, top, xi, pinv);
+    }
+  } // loop columns from top -> n - 1
+
+
+  for (p = top; p < n; p++) {
+    // restore G
+    (0, _csMark.csMark)(gptr, xi[p]);
+  }
+
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSpsolve.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSpsolve.js
new file mode 100644
index 0000000..63a187e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSpsolve.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSpsolve = void 0;
+
+var _csReach = require("./csReach.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'csSpsolve';
+var dependencies = ['divideScalar', 'multiply', 'subtract'];
+var createCsSpsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var divideScalar = _ref.divideScalar,
+      multiply = _ref.multiply,
+      subtract = _ref.subtract;
+
+  /**
+   * The function csSpsolve() computes the solution to G * x = bk, where bk is the
+   * kth column of B. When lo is true, the function assumes G = L is lower triangular with the
+   * diagonal entry as the first entry in each column. When lo is true, the function assumes G = U
+   * is upper triangular with the diagonal entry as the last entry in each column.
+   *
+   * @param {Matrix}  g               The G matrix
+   * @param {Matrix}  b               The B matrix
+   * @param {Number}  k               The kth column in B
+   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+   *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+   * @param {Array}   x               The soluton to the linear system G * x = b
+   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+   * @param {boolean} lo              The lower (true) upper triangular (false) flag
+   *
+   * @return {Number}                 The index for the nonzero pattern
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function csSpsolve(g, b, k, xi, x, pinv, lo) {
+    // g arrays
+    var gvalues = g._values;
+    var gindex = g._index;
+    var gptr = g._ptr;
+    var gsize = g._size; // columns
+
+    var n = gsize[1]; // b arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr; // vars
+
+    var p, p0, p1, q; // xi[top..n-1] = csReach(B(:,k))
+
+    var top = (0, _csReach.csReach)(g, b, k, xi, pinv); // clear x
+
+    for (p = top; p < n; p++) {
+      x[xi[p]] = 0;
+    } // scatter b
+
+
+    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+      x[bindex[p]] = bvalues[p];
+    } // loop columns
+
+
+    for (var px = top; px < n; px++) {
+      // x array index for px
+      var j = xi[px]; // apply permutation vector (U x = b), j maps to column J of G
+
+      var J = pinv ? pinv[j] : j; // check column J is empty
+
+      if (J < 0) {
+        continue;
+      } // column value indeces in G, p0 <= p < p1
+
+
+      p0 = gptr[J];
+      p1 = gptr[J + 1]; // x(j) /= G(j,j)
+
+      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]); // first entry L(j,j)
+
+      p = lo ? p0 + 1 : p0;
+      q = lo ? p1 : p1 - 1; // loop
+
+      for (; p < q; p++) {
+        // row
+        var i = gindex[p]; // x(i) -= G(i,j) * x(j)
+
+        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));
+      }
+    } // return top of stack
+
+
+    return top;
+  };
+});
+exports.createCsSpsolve = createCsSpsolve;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSqr.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSqr.js
new file mode 100644
index 0000000..73e16f6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSqr.js
@@ -0,0 +1,207 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSqr = void 0;
+
+var _csPermute = require("./csPermute.js");
+
+var _csPost = require("./csPost.js");
+
+var _csEtree = require("./csEtree.js");
+
+var _csAmd = require("./csAmd.js");
+
+var _csCounts = require("./csCounts.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'csSqr';
+var dependencies = ['add', 'multiply', 'transpose'];
+var createCsSqr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var add = _ref.add,
+      multiply = _ref.multiply,
+      transpose = _ref.transpose;
+  var csAmd = (0, _csAmd.createCsAmd)({
+    add: add,
+    multiply: multiply,
+    transpose: transpose
+  });
+  var csCounts = (0, _csCounts.createCsCounts)({
+    transpose: transpose
+  });
+  /**
+   * Symbolic ordering and analysis for QR and LU decompositions.
+   *
+   * @param {Number}  order           The ordering strategy (see csAmd for more details)
+   * @param {Matrix}  a               The A matrix
+   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or
+   *                                  symbolic ordering and analysis for LU decomposition (false)
+   *
+   * @return {Object}                 The Symbolic ordering and analysis for matrix A
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+
+  return function csSqr(order, a, qr) {
+    // a arrays
+    var aptr = a._ptr;
+    var asize = a._size; // columns
+
+    var n = asize[1]; // vars
+
+    var k; // symbolic analysis result
+
+    var s = {}; // fill-reducing ordering
+
+    s.q = csAmd(order, a); // validate results
+
+    if (order && !s.q) {
+      return null;
+    } // QR symbolic analysis
+
+
+    if (qr) {
+      // apply permutations if needed
+      var c = order ? (0, _csPermute.csPermute)(a, null, s.q, 0) : a; // etree of C'*C, where C=A(:,q)
+
+      s.parent = (0, _csEtree.csEtree)(c, 1); // post order elimination tree
+
+      var post = (0, _csPost.csPost)(s.parent, n); // col counts chol(C'*C)
+
+      s.cp = csCounts(c, s.parent, post, 1); // check we have everything needed to calculate number of nonzero elements
+
+      if (c && s.parent && s.cp && _vcount(c, s)) {
+        // calculate number of nonzero elements
+        for (s.unz = 0, k = 0; k < n; k++) {
+          s.unz += s.cp[k];
+        }
+      }
+    } else {
+      // for LU factorization only, guess nnz(L) and nnz(U)
+      s.unz = 4 * aptr[n] + n;
+      s.lnz = s.unz;
+    } // return result S
+
+
+    return s;
+  };
+  /**
+   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent
+   */
+
+  function _vcount(a, s) {
+    // a arrays
+    var aptr = a._ptr;
+    var aindex = a._index;
+    var asize = a._size; // rows & columns
+
+    var m = asize[0];
+    var n = asize[1]; // initialize s arrays
+
+    s.pinv = []; // (m + n)
+
+    s.leftmost = []; // (m)
+    // vars
+
+    var parent = s.parent;
+    var pinv = s.pinv;
+    var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries
+
+    var w = []; // (m + 3 * n)
+
+    var next = 0;
+    var head = m;
+    var tail = m + n;
+    var nque = m + 2 * n; // vars
+
+    var i, k, p, p0, p1; // initialize w
+
+    for (k = 0; k < n; k++) {
+      // queue k is empty
+      w[head + k] = -1;
+      w[tail + k] = -1;
+      w[nque + k] = 0;
+    } // initialize row arrays
+
+
+    for (i = 0; i < m; i++) {
+      leftmost[i] = -1;
+    } // loop columns backwards
+
+
+    for (k = n - 1; k >= 0; k--) {
+      // values & index for column k
+      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+        // leftmost[i] = min(find(A(i,:)))
+        leftmost[aindex[p]] = k;
+      }
+    } // scan rows in reverse order
+
+
+    for (i = m - 1; i >= 0; i--) {
+      // row i is not yet ordered
+      pinv[i] = -1;
+      k = leftmost[i]; // check row i is empty
+
+      if (k === -1) {
+        continue;
+      } // first row in queue k
+
+
+      if (w[nque + k]++ === 0) {
+        w[tail + k] = i;
+      } // put i at head of queue k
+
+
+      w[next + i] = w[head + k];
+      w[head + k] = i;
+    }
+
+    s.lnz = 0;
+    s.m2 = m; // find row permutation and nnz(V)
+
+    for (k = 0; k < n; k++) {
+      // remove row i from queue k
+      i = w[head + k]; // count V(k,k) as nonzero
+
+      s.lnz++; // add a fictitious row
+
+      if (i < 0) {
+        i = s.m2++;
+      } // associate row i with V(:,k)
+
+
+      pinv[i] = k; // skip if V(k+1:m,k) is empty
+
+      if (--nque[k] <= 0) {
+        continue;
+      } // nque[k] is nnz (V(k+1:m,k))
+
+
+      s.lnz += w[nque + k]; // move all rows to parent of k
+
+      var pa = parent[k];
+
+      if (pa !== -1) {
+        if (w[nque + pa] === 0) {
+          w[tail + pa] = w[tail + k];
+        }
+
+        w[next + w[tail + k]] = w[head + pa];
+        w[head + pa] = w[next + i];
+        w[nque + pa] += w[nque + k];
+      }
+    }
+
+    for (i = 0; i < m; i++) {
+      if (pinv[i] < 0) {
+        pinv[i] = k++;
+      }
+    }
+
+    return true;
+  }
+});
+exports.createCsSqr = createCsSqr;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSymperm.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSymperm.js
new file mode 100644
index 0000000..05ca41d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSymperm.js
@@ -0,0 +1,108 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSymperm = void 0;
+
+var _csCumsum = require("./csCumsum.js");
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'csSymperm';
+var dependencies = ['conj', 'SparseMatrix'];
+var createCsSymperm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var conj = _ref.conj,
+      SparseMatrix = _ref.SparseMatrix;
+
+  /**
+   * Computes the symmetric permutation of matrix A accessing only
+   * the upper triangular part of A.
+   *
+   * C = P * A * P'
+   *
+   * @param {Matrix}  a               The A matrix
+   * @param {Array}   pinv            The inverse of permutation vector
+   * @param {boolean} values          Process matrix values (true)
+   *
+   * @return {Matrix}                 The C matrix, C = P * A * P'
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function csSymperm(a, pinv, values) {
+    // A matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size; // columns
+
+    var n = asize[1]; // C matrix arrays
+
+    var cvalues = values && avalues ? [] : null;
+    var cindex = []; // (nz)
+
+    var cptr = []; // (n + 1)
+    // variables
+
+    var i, i2, j, j2, p, p0, p1; // create workspace vector
+
+    var w = []; // (n)
+    // count entries in each column of C
+
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j; // loop values in column j
+
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p]; // skip lower triangular part of A
+
+        if (i > j) {
+          continue;
+        } // row i of A is row i2 of C
+
+
+        i2 = pinv ? pinv[i] : i; // column count of C
+
+        w[Math.max(i2, j2)]++;
+      }
+    } // compute column pointers of C
+
+
+    (0, _csCumsum.csCumsum)(cptr, w, n); // loop columns
+
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j; // loop values in column j
+
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p]; // skip lower triangular part of A
+
+        if (i > j) {
+          continue;
+        } // row i of A is row i2 of C
+
+
+        i2 = pinv ? pinv[i] : i; // C index for column j2
+
+        var q = w[Math.max(i2, j2)]++; // update C index for entry q
+
+        cindex[q] = Math.min(i2, j2); // check we need to process values
+
+        if (cvalues) {
+          cvalues[q] = i2 <= j2 ? avalues[p] : conj(avalues[p]);
+        }
+      }
+    } // return C matrix
+
+
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [n, n]
+    });
+  };
+});
+exports.createCsSymperm = createCsSymperm;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csTdfs.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csTdfs.js
new file mode 100644
index 0000000..62d4a2b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csTdfs.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csTdfs = csTdfs;
+
+/**
+ * Depth-first search and postorder of a tree rooted at node j
+ *
+ * @param {Number}  j               The tree node
+ * @param {Number}  k
+ * @param {Array}   w               The workspace array
+ * @param {Number}  head            The index offset within the workspace for the head array
+ * @param {Number}  next            The index offset within the workspace for the next array
+ * @param {Array}   post            The post ordering array
+ * @param {Number}  stack           The index offset within the workspace for the stack array
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csTdfs(j, k, w, head, next, post, stack) {
+  // variables
+  var top = 0; // place j on the stack
+
+  w[stack] = j; // while (stack is not empty)
+
+  while (top >= 0) {
+    // p = top of stack
+    var p = w[stack + top]; // i = youngest child of p
+
+    var i = w[head + p];
+
+    if (i === -1) {
+      // p has no unordered children left
+      top--; // node p is the kth postordered node
+
+      post[k++] = p;
+    } else {
+      // remove i from children of p
+      w[head + p] = w[next + i]; // increment top
+
+      ++top; // start dfs on child node i
+
+      w[stack + top] = i;
+    }
+  }
+
+  return k;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csUnflip.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csUnflip.js
new file mode 100644
index 0000000..124b64b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csUnflip.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csUnflip = csUnflip;
+
+var _csFlip = require("./csFlip.js");
+
+/**
+ * Flips the value if it is negative of returns the same value otherwise.
+ *
+ * @param {Number}  i               The value to flip
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csUnflip(i) {
+  // flip the value if it is negative
+  return i < 0 ? (0, _csFlip.csFlip)(i) : i;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/cjs/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..718c8c0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/symbolicEqual.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSymbolicEqual = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'symbolicEqual';
+var dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];
+var createSymbolicEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var parse = _ref.parse,
+      simplify = _ref.simplify,
+      typed = _ref.typed,
+      OperatorNode = _ref.OperatorNode;
+
+  /**
+   * Attempts to determine if two expressions are symbolically equal, i.e.
+   * one is the result of valid algebraic manipulations on the other.
+   * Currently, this simply checks if the difference of the two expressions
+   * simplifies down to 0. So there are two important caveats:
+   * 1. whether two expressions are symbolically equal depends on the
+   *     manipulations allowed. Therefore, this function takes an optional
+   *     third argument, which are the options that control the behavior
+   *     as documented for the `simplify()` function.
+   * 2. it is in general intractable to find the minimal simplification of
+   *     an arbitrarily complicated expression. So while a `true` value
+   *     of `symbolicEqual` ensures that the two expressions can be manipulated
+   *     to match each other, a `false` value does not absolutely rule this out.
+   *
+   * Syntax:
+   *
+   *    symbolicEqual(expr1, expr2)
+   *    symbolicEqual(expr1, expr2, options)
+   *
+   * Examples:
+   *
+   *    symbolicEqual('x*y', 'y*x') // true
+   *    symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}})
+   *        //false
+   *    symbolicEqual('x/y', '(y*x^(-1))^(-1)') // true
+   *    symbolicEqual('abs(x)','x') // false
+   *    symbolicEqual('abs(x)','x', simplify.positiveContext) // true
+   *
+   * See also:
+   *
+   *    simplify, evaluate
+   *
+   * @param {Node|string} expr1  The first expression to compare
+   * @param {Node|string} expr2  The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean}
+   *     Returns true if a valid manipulation making the expressions equal
+   *     is found.
+   */
+  return typed(name, {
+    'string, string': function stringString(s1, s2) {
+      return this(parse(s1), parse(s2), {});
+    },
+    'string, string, Object': function stringStringObject(s1, s2, options) {
+      return this(parse(s1), parse(s2), options);
+    },
+    'Node, string': function NodeString(e1, s2) {
+      return this(e1, parse(s2), {});
+    },
+    'Node, string, Object': function NodeStringObject(e1, s2, options) {
+      return this(e1, parse(s2), options);
+    },
+    'string, Node': function stringNode(s1, e2) {
+      return this(parse(s1), e2, {});
+    },
+    'string, Node, Object': function stringNodeObject(s1, e2, options) {
+      return this(parse(s1), e2, options);
+    },
+    'Node, Node': function NodeNode(e1, e2) {
+      return this(e1, e2, {});
+    },
+    'Node, Node, Object': function NodeNodeObject(e1, e2, options) {
+      var diff = new OperatorNode('-', 'subtract', [e1, e2]);
+      var simplified = simplify(diff, {}, options);
+      return (0, _is.isConstantNode)(simplified) && !simplified.value;
+    }
+  });
+});
+exports.createSymbolicEqual = createSymbolicEqual;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/abs.js b/node_modules/mathjs/lib/cjs/function/arithmetic/abs.js
new file mode 100644
index 0000000..da78610
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/abs.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAbs = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'abs';
+var dependencies = ['typed'];
+var createAbs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the absolute value of a number. For matrices, the function is
+   * evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.abs(x)
+   *
+   * Examples:
+   *
+   *    math.abs(3.5)                // returns number 3.5
+   *    math.abs(-4.2)               // returns number 4.2
+   *
+   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]
+   *
+   * See also:
+   *
+   *    sign
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            A number or matrix for which to get the absolute value
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
+   *            Absolute value of `x`
+   */
+  return typed(name, {
+    number: _index.absNumber,
+    Complex: function Complex(x) {
+      return x.abs();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.abs();
+    },
+    Fraction: function Fraction(x) {
+      return x.abs();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since abs(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    Unit: function Unit(x) {
+      return x.abs();
+    }
+  });
+});
+exports.createAbs = createAbs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/add.js b/node_modules/mathjs/lib/cjs/function/arithmetic/add.js
new file mode 100644
index 0000000..896cfd1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/add.js
@@ -0,0 +1,141 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAdd = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _object = require("../../utils/object.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm01.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm04.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm10.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'add';
+var dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];
+var createAdd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      addScalar = _ref.addScalar,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix,
+      SparseMatrix = _ref.SparseMatrix;
+  var algorithm01 = (0, _algorithm.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm04 = (0, _algorithm2.createAlgorithm04)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm10 = (0, _algorithm3.createAlgorithm10)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Add two or more values, `x + y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.add(x, y)
+   *    math.add(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.add(2, 3)               // returns number 5
+   *    math.add(2, 3, 4)            // returns number 9
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(-4, 1)
+   *    math.add(a, b)               // returns Complex -2 + 4i
+   *
+   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   *    const c = math.unit('5 cm')
+   *    const d = math.unit('2.1 mm')
+   *    math.add(c, d)               // returns Unit 52.1 mm
+   *
+   *    math.add("2.3", "4")         // returns number 6.3
+   *
+   * See also:
+   *
+   *    subtract, sum
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
+   */
+
+  return typed(name, (0, _object.extend)({
+    // we extend the signatures of addScalar with signatures dealing with matrices
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, addScalar);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, addScalar, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm01(y, x, addScalar, true);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm04(x, y, addScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, addScalar, false);
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm10(x, y, addScalar, false);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, addScalar, true);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm10(y, x, addScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, addScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, addScalar, true).valueOf();
+    },
+    'any, any': addScalar,
+    'any, any, ...any': function anyAnyAny(x, y, rest) {
+      var result = this(x, y);
+
+      for (var i = 0; i < rest.length; i++) {
+        result = this(result, rest[i]);
+      }
+
+      return result;
+    }
+  }, addScalar.signatures));
+});
+exports.createAdd = createAdd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/addScalar.js b/node_modules/mathjs/lib/cjs/function/arithmetic/addScalar.js
new file mode 100644
index 0000000..9dd4902
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/addScalar.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAddScalar = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'addScalar';
+var dependencies = ['typed'];
+var createAddScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Add two scalar values, `x + y`.
+   * This function is meant for internal use: it is used by the public function
+   * `add`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add
+   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add
+   * @return {number | BigNumber | Fraction | Complex | Unit}     Sum of `x` and `y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': _index.addNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.add(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.plus(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.add(y);
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value');
+      if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value');
+      if (!x.equalBase(y)) throw new Error('Units do not match');
+      var res = x.clone();
+      res.value = this(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    }
+  });
+});
+exports.createAddScalar = createAddScalar;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/cjs/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..43678c5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/cbrt.js
@@ -0,0 +1,151 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCbrt = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'cbrt';
+var dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];
+var createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var config = _ref.config,
+      typed = _ref.typed,
+      isNegative = _ref.isNegative,
+      unaryMinus = _ref.unaryMinus,
+      matrix = _ref.matrix,
+      Complex = _ref.Complex,
+      BigNumber = _ref.BigNumber,
+      Fraction = _ref.Fraction;
+
+  /**
+   * Calculate the cubic root of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cbrt(x)
+   *    math.cbrt(x, allRoots)
+   *
+   * Examples:
+   *
+   *    math.cbrt(27)                  // returns 3
+   *    math.cube(3)                   // returns 27
+   *    math.cbrt(-64)                 // returns -4
+   *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m
+   *    math.cbrt([27, 64, 125])       // returns [3, 4, 5]
+   *
+   *    const x = math.complex('8i')
+   *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i
+   *    math.cbrt(x, true)             // returns Matrix [
+   *                                    //    1.7320508075689 + i
+   *                                    //   -1.7320508075689 + i
+   *                                    //   -2i
+   *                                    // ]
+   *
+   * See also:
+   *
+   *    square, sqrt, cube
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x
+   *            Value for which to calculate the cubic root.
+   * @param {boolean} [allRoots]  Optional, false by default. Only applicable
+   *            when `x` is a number or complex number. If true, all complex
+   *            roots are returned, if false (default) the principal root is
+   *            returned.
+   * @return {number | BigNumber | Complex | Unit | Array | Matrix}
+   *            Returns the cubic root of `x`
+   */
+  return typed(name, {
+    number: _index.cbrtNumber,
+    // note: signature 'number, boolean' is also supported,
+    //       created by typed as it knows how to convert number to Complex
+    Complex: _cbrtComplex,
+    'Complex, boolean': _cbrtComplex,
+    BigNumber: function BigNumber(x) {
+      return x.cbrt();
+    },
+    Unit: _cbrtUnit,
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since cbrt(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+  /**
+   * Calculate the cubic root for a complex number
+   * @param {Complex} x
+   * @param {boolean} [allRoots]   If true, the function will return an array
+   *                               with all three roots. If false or undefined,
+   *                               the principal root is returned.
+   * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x
+   * @private
+   */
+
+  function _cbrtComplex(x, allRoots) {
+    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers
+    var arg3 = x.arg() / 3;
+    var abs = x.abs(); // principal root:
+
+    var principal = new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3).exp());
+
+    if (allRoots) {
+      var all = [principal, new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())];
+      return config.matrix === 'Array' ? all : matrix(all);
+    } else {
+      return principal;
+    }
+  }
+  /**
+   * Calculate the cubic root for a Unit
+   * @param {Unit} x
+   * @return {Unit} Returns the cubic root of x
+   * @private
+   */
+
+
+  function _cbrtUnit(x) {
+    if (x.value && (0, _is.isComplex)(x.value)) {
+      var result = x.clone();
+      result.value = 1.0;
+      result = result.pow(1.0 / 3); // Compute the units
+
+      result.value = _cbrtComplex(x.value); // Compute the value
+
+      return result;
+    } else {
+      var negate = isNegative(x.value);
+
+      if (negate) {
+        x.value = unaryMinus(x.value);
+      } // TODO: create a helper function for this
+
+
+      var third;
+
+      if ((0, _is.isBigNumber)(x.value)) {
+        third = new BigNumber(1).div(3);
+      } else if ((0, _is.isFraction)(x.value)) {
+        third = new Fraction(1, 3);
+      } else {
+        third = 1 / 3;
+      }
+
+      var _result = x.pow(third);
+
+      if (negate) {
+        _result.value = unaryMinus(_result.value);
+      }
+
+      return _result;
+    }
+  }
+});
+exports.createCbrt = createCbrt;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/ceil.js b/node_modules/mathjs/lib/cjs/function/arithmetic/ceil.js
new file mode 100644
index 0000000..6183609
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/ceil.js
@@ -0,0 +1,159 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCeil = void 0;
+
+var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
+
+var _decimal = _interopRequireDefault(require("decimal.js"));
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _index = require("../../plain/number/index.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'ceil';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];
+var createCeil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      round = _ref.round,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar;
+  var algorithm11 = (0, _algorithm.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm14 = (0, _algorithm2.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Round a value towards plus infinity
+   * If `x` is complex, both real and imaginary part are rounded towards plus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.ceil(x)
+   *    math.ceil(x, n)
+   *
+   * Examples:
+   *
+   *    math.ceil(3.2)               // returns number 4
+   *    math.ceil(3.8)               // returns number 4
+   *    math.ceil(-4.2)              // returns number -4
+   *    math.ceil(-4.7)              // returns number -4
+   *
+   *    math.ceil(3.212, 2)          // returns number 3.22
+   *    math.ceil(3.288, 2)          // returns number 3.29
+   *    math.ceil(-4.212, 2)         // returns number -4.21
+   *    math.ceil(-4.782, 2)         // returns number -4.78
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.ceil(c)                 // returns Complex 4 - 2i
+   *    math.ceil(c, 1)              // returns Complex 3.3 - 2.7i
+   *
+   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]
+   *    math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]
+   *
+   * See also:
+   *
+   *    floor, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
+   */
+
+  return typed('ceil', {
+    number: function number(x) {
+      if ((0, _number.nearlyEqual)(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return (0, _index.ceilNumber)(x);
+      }
+    },
+    'number, number': function numberNumber(x, n) {
+      if ((0, _number.nearlyEqual)(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        var _$split = "".concat(x, "e").split('e'),
+            _$split2 = (0, _slicedToArray2.default)(_$split, 2),
+            number = _$split2[0],
+            exponent = _$split2[1];
+
+        var result = Math.ceil(Number("".concat(number, "e").concat(Number(exponent) + n)));
+
+        var _$split3 = "".concat(result, "e").split('e');
+
+        var _$split4 = (0, _slicedToArray2.default)(_$split3, 2);
+
+        number = _$split4[0];
+        exponent = _$split4[1];
+        return Number("".concat(number, "e").concat(Number(exponent) - n));
+      }
+    },
+    Complex: function Complex(x) {
+      return x.ceil();
+    },
+    'Complex, number': function ComplexNumber(x, n) {
+      return x.ceil(n);
+    },
+    BigNumber: function BigNumber(x) {
+      if ((0, _nearlyEqual.nearlyEqual)(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return x.ceil();
+      }
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {
+      if ((0, _nearlyEqual.nearlyEqual)(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        return x.toDecimalPlaces(n.toNumber(), _decimal.default.ROUND_CEIL);
+      }
+    },
+    Fraction: function Fraction(x) {
+      return x.ceil();
+    },
+    'Fraction, number': function FractionNumber(x, n) {
+      return x.ceil(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {
+      var _this = this;
+
+      // deep map collection, skip zeros since ceil(0) = 0
+      return (0, _collection.deepMap)(x, function (i) {
+        return _this(i, n);
+      }, true);
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createCeil = createCeil;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/cube.js b/node_modules/mathjs/lib/cjs/function/arithmetic/cube.js
new file mode 100644
index 0000000..f1c0f16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/cube.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCube = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'cube';
+var dependencies = ['typed'];
+var createCube = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Compute the cube of a value, `x * x * x`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cube(x)
+   *
+   * Examples:
+   *
+   *    math.cube(2)            // returns number 8
+   *    math.pow(2, 3)          // returns number 8
+   *    math.cube(4)            // returns number 64
+   *    4 * 4 * 4               // returns number 64
+   *
+   *    math.cube([1, 2, 3, 4]) // returns Array [1, 8, 27, 64]
+   *
+   * See also:
+   *
+   *    multiply, square, pow, cbrt
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x  Number for which to calculate the cube
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} Cube of x
+   */
+  return typed(name, {
+    number: _index.cubeNumber,
+    Complex: function Complex(x) {
+      return x.mul(x).mul(x); // Is faster than pow(x, 3)
+    },
+    BigNumber: function BigNumber(x) {
+      return x.times(x).times(x);
+    },
+    Fraction: function Fraction(x) {
+      return x.pow(3); // Is faster than mul()mul()mul()
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since cube(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    Unit: function Unit(x) {
+      return x.pow(3);
+    }
+  });
+});
+exports.createCube = createCube;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/divide.js b/node_modules/mathjs/lib/cjs/function/arithmetic/divide.js
new file mode 100644
index 0000000..5f5b0f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/divide.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDivide = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _object = require("../../utils/object.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'divide';
+var dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];
+var createDivide = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      multiply = _ref.multiply,
+      equalScalar = _ref.equalScalar,
+      divideScalar = _ref.divideScalar,
+      inv = _ref.inv;
+  var algorithm11 = (0, _algorithm.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm14 = (0, _algorithm2.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Divide two values, `x / y`.
+   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.
+   *
+   * Syntax:
+   *
+   *    math.divide(x, y)
+   *
+   * Examples:
+   *
+   *    math.divide(2, 3)            // returns number 0.6666666666666666
+   *
+   *    const a = math.complex(5, 14)
+   *    const b = math.complex(4, 1)
+   *    math.divide(a, b)            // returns Complex 2 + 3i
+   *
+   *    const c = [[7, -6], [13, -4]]
+   *    const d = [[1, 2], [4, 3]]
+   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]
+   *
+   *    const e = math.unit('18 km')
+   *    math.divide(e, 4.5)          // returns Unit 4 km
+   *
+   * See also:
+   *
+   *    multiply
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x   Numerator
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} y          Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`
+   */
+
+  return typed('divide', (0, _object.extend)({
+    // we extend the signatures of divideScalar with signatures dealing with matrices
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(x, y) {
+      // TODO: implement matrix right division using pseudo inverse
+      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html
+      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html
+      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour
+      return multiply(x, inv(y));
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, divideScalar, false);
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, divideScalar, false);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, divideScalar, false).valueOf();
+    },
+    'any, Array | Matrix': function anyArrayMatrix(x, y) {
+      return multiply(x, inv(y));
+    }
+  }, divideScalar.signatures));
+});
+exports.createDivide = createDivide;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/divideScalar.js b/node_modules/mathjs/lib/cjs/function/arithmetic/divideScalar.js
new file mode 100644
index 0000000..1fb2630
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/divideScalar.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDivideScalar = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'divideScalar';
+var dependencies = ['typed', 'numeric'];
+var createDivideScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      numeric = _ref.numeric;
+
+  /**
+   * Divide two scalar values, `x / y`.
+   * This function is meant for internal use: it is used by the public functions
+   * `divide` and `inv`.
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit} x   Numerator
+   * @param  {number | BigNumber | Fraction | Complex} y          Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit}     Quotient, `x / y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x / y;
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.div(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.div(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.div(y);
+    },
+    'Unit, number | Fraction | BigNumber': function UnitNumberFractionBigNumber(x, y) {
+      var res = x.clone(); // TODO: move the divide function to Unit.js, it uses internals of Unit
+
+      var one = numeric(1, (0, _is.typeOf)(y));
+      res.value = this(res.value === null ? res._normalize(one) : res.value, y);
+      return res;
+    },
+    'number | Fraction | BigNumber, Unit': function numberFractionBigNumberUnit(x, y) {
+      var res = y.clone();
+      res = res.pow(-1); // TODO: move the divide function to Unit.js, it uses internals of Unit
+
+      var one = numeric(1, (0, _is.typeOf)(x));
+      res.value = this(x, y.value === null ? y._normalize(one) : y.value);
+      return res;
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return x.divide(y);
+    }
+  });
+});
+exports.createDivideScalar = createDivideScalar;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/cjs/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..9b769fb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/dotDivide.js
@@ -0,0 +1,132 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDotDivide = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm7 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'dotDivide';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix'];
+var createDotDivide = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      divideScalar = _ref.divideScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm03 = (0, _algorithm2.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm3.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm11 = (0, _algorithm4.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm12 = (0, _algorithm5.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm6.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm7.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Divide two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotDivide(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotDivide(2, 4)   // returns 0.5
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]
+   *    math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]
+   *
+   * See also:
+   *
+   *    divide, multiply, dotMultiply
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Quotient, `x ./ y`
+   */
+
+  return typed(name, {
+    'any, any': divideScalar,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, divideScalar, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, divideScalar, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, divideScalar, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, divideScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, divideScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, divideScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, divideScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, divideScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, divideScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, divideScalar, true).valueOf();
+    }
+  });
+});
+exports.createDotDivide = createDotDivide;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/cjs/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..4e61042
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/dotMultiply.js
@@ -0,0 +1,120 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDotMultiply = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm09.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'dotMultiply';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar'];
+var createDotMultiply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      multiplyScalar = _ref.multiplyScalar;
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm09 = (0, _algorithm2.createAlgorithm09)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm11 = (0, _algorithm3.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Multiply two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotMultiply(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotMultiply(2, 4) // returns 8
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]
+   *    math.multiply(a, b)    // returns [[52, 28], [23, 14]]
+   *
+   * See also:
+   *
+   *    multiply, divide, dotDivide
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Multiplication of `x` and `y`
+   */
+
+  return typed(name, {
+    'any, any': multiplyScalar,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm09(x, y, multiplyScalar, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, multiplyScalar, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, multiplyScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, multiplyScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm11(y, x, multiplyScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, multiplyScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();
+    }
+  });
+});
+exports.createDotMultiply = createDotMultiply;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/cjs/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..e7ff58c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/dotPow.js
@@ -0,0 +1,123 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDotPow = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'dotPow';
+var dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix'];
+var createDotPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar,
+      matrix = _ref.matrix,
+      pow = _ref.pow,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm11 = (0, _algorithm3.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm12 = (0, _algorithm4.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm6.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Calculates the power of x to y element wise.
+   *
+   * Syntax:
+   *
+   *    math.dotPow(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotPow(2, 3)            // returns number 8
+   *
+   *    const a = [[1, 2], [4, 3]]
+   *    math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]
+   *    math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   * See also:
+   *
+   *    pow, sqrt, multiply
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y  The exponent
+   * @return {number | BigNumber | Complex | Unit | Array | Matrix}                     The value of `x` to the power `y`
+   */
+
+  return typed(name, {
+    'any, any': pow,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, pow, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, pow, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, pow, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, pow);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createDotPow = createDotPow;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/exp.js b/node_modules/mathjs/lib/cjs/function/arithmetic/exp.js
new file mode 100644
index 0000000..ffd1d58
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/exp.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createExp = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'exp';
+var dependencies = ['typed'];
+var createExp = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the exponent of a value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.exp(x)
+   *
+   * Examples:
+   *
+   *    math.exp(2)                  // returns number 7.3890560989306495
+   *    math.pow(math.e, 2)          // returns number 7.3890560989306495
+   *    math.log(math.exp(2))        // returns number 2
+   *
+   *    math.exp([1, 2, 3])
+   *    // returns Array [
+   *    //   2.718281828459045,
+   *    //   7.3890560989306495,
+   *    //   20.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    expm1, log, pow
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to exponentiate
+   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`
+   */
+  return typed(name, {
+    number: _index.expNumber,
+    Complex: function Complex(x) {
+      return x.exp();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.exp();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // TODO: exp(sparse) should return a dense matrix since exp(0)==1
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createExp = createExp;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/expm1.js b/node_modules/mathjs/lib/cjs/function/arithmetic/expm1.js
new file mode 100644
index 0000000..d837f11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/expm1.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createExpm1 = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'expm1';
+var dependencies = ['typed', 'Complex'];
+var createExpm1 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _Complex = _ref.Complex;
+
+  /**
+   * Calculate the value of subtracting 1 from the exponential value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.expm1(x)
+   *
+   * Examples:
+   *
+   *    math.expm1(2)                      // returns number 6.38905609893065
+   *    math.pow(math.e, 2) - 1            // returns number 6.3890560989306495
+   *    math.log(math.expm1(2) + 1)        // returns number 2
+   *
+   *    math.expm1([1, 2, 3])
+   *    // returns Array [
+   *    //   1.718281828459045,
+   *    //   6.3890560989306495,
+   *    //   19.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    exp, log, pow
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to apply expm1
+   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`
+   */
+  return typed(name, {
+    number: _index.expm1Number,
+    Complex: function Complex(x) {
+      var r = Math.exp(x.re);
+      return new _Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));
+    },
+    BigNumber: function BigNumber(x) {
+      return x.exp().minus(1);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createExpm1 = createExpm1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/fix.js b/node_modules/mathjs/lib/cjs/function/arithmetic/fix.js
new file mode 100644
index 0000000..09faf87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/fix.js
@@ -0,0 +1,104 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFix = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'fix';
+var dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor'];
+var createFix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _Complex = _ref.Complex,
+      matrix = _ref.matrix,
+      ceil = _ref.ceil,
+      floor = _ref.floor;
+  var algorithm14 = (0, _algorithm.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Round a value towards zero.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.fix(x)
+   *
+   * Examples:
+   *
+   *    math.fix(3.2)                // returns number 3
+   *    math.fix(3.8)                // returns number 3
+   *    math.fix(-4.2)               // returns number -4
+   *    math.fix(-4.7)               // returns number -4
+   *
+   *    math.fix(3.12, 1)                // returns number 3.1
+   *    math.fix(3.18, 1)                // returns number 3.1
+   *    math.fix(-4.12, 1)               // returns number -4.1
+   *    math.fix(-4.17, 1)               // returns number -4.1
+   *
+   *    const c = math.complex(3.22, -2.78)
+   *    math.fix(c)                  // returns Complex 3 - 2i
+   *    math.fix(c, 1)               // returns Complex 3.2 - 2.7i
+   *
+   *    math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]
+   *    math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]
+   *
+   * See also:
+   *
+   *    ceil, floor, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x    Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                             Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix}     Rounded value
+   */
+
+  return typed('fix', {
+    number: function number(x) {
+      return x > 0 ? floor(x) : ceil(x);
+    },
+    'number, number | BigNumber': function numberNumberBigNumber(x, n) {
+      return x > 0 ? floor(x, n) : ceil(x, n);
+    },
+    Complex: function Complex(x) {
+      return new _Complex(x.re > 0 ? Math.floor(x.re) : Math.ceil(x.re), x.im > 0 ? Math.floor(x.im) : Math.ceil(x.im));
+    },
+    'Complex, number | BigNumber': function ComplexNumberBigNumber(x, n) {
+      return new _Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));
+    },
+    BigNumber: function BigNumber(x) {
+      return x.isNegative() ? ceil(x) : floor(x);
+    },
+    'BigNumber, number | BigNumber': function BigNumberNumberBigNumber(x, n) {
+      return x.isNegative() ? ceil(x, n) : floor(x, n);
+    },
+    Fraction: function Fraction(x) {
+      return x.s < 0 ? x.ceil() : x.floor();
+    },
+    'Fraction, number | BigNumber': function FractionNumberBigNumber(x, n) {
+      return x.s < 0 ? x.ceil(n) : x.floor(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since fix(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(x, n) {
+      var _this = this;
+
+      // deep map collection, skip zeros since fix(0) = 0
+      return (0, _collection.deepMap)(x, function (i) {
+        return _this(i, n);
+      }, true);
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createFix = createFix;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/floor.js b/node_modules/mathjs/lib/cjs/function/arithmetic/floor.js
new file mode 100644
index 0000000..6206383
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/floor.js
@@ -0,0 +1,156 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFloor = void 0;
+
+var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
+
+var _decimal = _interopRequireDefault(require("decimal.js"));
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'floor';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];
+var createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      round = _ref.round,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar;
+  var algorithm11 = (0, _algorithm.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm14 = (0, _algorithm2.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Round a value towards minus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.floor(x)
+   *    math.floor(x, n)
+   *
+   * Examples:
+   *
+   *    math.floor(3.2)              // returns number 3
+   *    math.floor(3.8)              // returns number 3
+   *    math.floor(-4.2)             // returns number -5
+   *    math.floor(-4.7)             // returns number -5
+   *
+   *    math.floor(3.212, 2)          // returns number 3.21
+   *    math.floor(3.288, 2)          // returns number 3.28
+   *    math.floor(-4.212, 2)         // returns number -4.22
+   *    math.floor(-4.782, 2)         // returns number -4.79
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.floor(c)                 // returns Complex 3 - 3i
+   *    math.floor(c, 1)              // returns Complex 3.2 - 2.8i
+   *
+   *    math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]
+   *    math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]
+   *
+   * See also:
+   *
+   *    ceil, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
+   */
+
+  return typed('floor', {
+    number: function number(x) {
+      if ((0, _number.nearlyEqual)(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return Math.floor(x);
+      }
+    },
+    'number, number': function numberNumber(x, n) {
+      if ((0, _number.nearlyEqual)(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        var _$split = "".concat(x, "e").split('e'),
+            _$split2 = (0, _slicedToArray2.default)(_$split, 2),
+            number = _$split2[0],
+            exponent = _$split2[1];
+
+        var result = Math.floor(Number("".concat(number, "e").concat(Number(exponent) + n)));
+
+        var _$split3 = "".concat(result, "e").split('e');
+
+        var _$split4 = (0, _slicedToArray2.default)(_$split3, 2);
+
+        number = _$split4[0];
+        exponent = _$split4[1];
+        return Number("".concat(number, "e").concat(Number(exponent) - n));
+      }
+    },
+    Complex: function Complex(x) {
+      return x.floor();
+    },
+    'Complex, number': function ComplexNumber(x, n) {
+      return x.floor(n);
+    },
+    BigNumber: function BigNumber(x) {
+      if ((0, _nearlyEqual.nearlyEqual)(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return x.floor();
+      }
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {
+      if ((0, _nearlyEqual.nearlyEqual)(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        return x.toDecimalPlaces(n.toNumber(), _decimal.default.ROUND_FLOOR);
+      }
+    },
+    Fraction: function Fraction(x) {
+      return x.floor();
+    },
+    'Fraction, number': function FractionNumber(x, n) {
+      return x.floor(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since floor(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {
+      var _this = this;
+
+      // deep map collection, skip zeros since ceil(0) = 0
+      return (0, _collection.deepMap)(x, function (i) {
+        return _this(i, n);
+      }, true);
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createFloor = createFloor;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/gcd.js b/node_modules/mathjs/lib/cjs/function/arithmetic/gcd.js
new file mode 100644
index 0000000..654fc42
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/gcd.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createGcd = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm01.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm04.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm10.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'gcd';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];
+var createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      BigNumber = _ref.BigNumber,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm01 = (0, _algorithm.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm04 = (0, _algorithm2.createAlgorithm04)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm10 = (0, _algorithm3.createAlgorithm10)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Calculate the greatest common divisor for two or more values or arrays.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.gcd(a, b)
+   *    math.gcd(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.gcd(8, 12)              // returns 4
+   *    math.gcd(-4, 6)              // returns 2
+   *    math.gcd(25, 15, -10)        // returns 5
+   *
+   *    math.gcd([8, -4], [12, 6])   // returns [4, 2]
+   *
+   * See also:
+   *
+   *    lcm, xgcd
+   *
+   * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor
+   */
+
+  return typed(name, {
+    'number, number': _index.gcdNumber,
+    'BigNumber, BigNumber': _gcdBigNumber,
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.gcd(y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm04(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm01(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm10(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    },
+    // TODO: need a smarter notation here
+    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {
+      var res = this(a, b);
+
+      for (var i = 0; i < args.length; i++) {
+        res = this(res, args[i]);
+      }
+
+      return res;
+    }
+  });
+  /**
+   * Calculate gcd for BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns greatest common denominator of a and b
+   * @private
+   */
+
+  function _gcdBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function gcd must be integer numbers');
+    } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+
+
+    var zero = new BigNumber(0);
+
+    while (!b.isZero()) {
+      var r = a.mod(b);
+      a = b;
+      b = r;
+    }
+
+    return a.lt(zero) ? a.neg() : a;
+  }
+});
+exports.createGcd = createGcd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/hypot.js b/node_modules/mathjs/lib/cjs/function/arithmetic/hypot.js
new file mode 100644
index 0000000..a9d1760
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/hypot.js
@@ -0,0 +1,89 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHypot = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _array = require("../../utils/array.js");
+
+var name = 'hypot';
+var dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];
+var createHypot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      abs = _ref.abs,
+      addScalar = _ref.addScalar,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      sqrt = _ref.sqrt,
+      smaller = _ref.smaller,
+      isPositive = _ref.isPositive;
+
+  /**
+   * Calculate the hypotenusa of a list with values. The hypotenusa is defined as:
+   *
+   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)
+   *
+   * For matrix input, the hypotenusa is calculated for all values in the matrix.
+   *
+   * Syntax:
+   *
+   *     math.hypot(a, b, ...)
+   *     math.hypot([a, b, c, ...])
+   *
+   * Examples:
+   *
+   *     math.hypot(3, 4)      // 5
+   *     math.hypot(3, 4, 5)   // 7.0710678118654755
+   *     math.hypot([3, 4, 5]) // 7.0710678118654755
+   *     math.hypot(-2)        // 2
+   *
+   * See also:
+   *
+   *     abs, norm
+   *
+   * @param {... number | BigNumber | Array | Matrix} args    A list with numeric values or an Array or Matrix.
+   *                                                          Matrix and Array input is flattened and returns a
+   *                                                          single number for the whole matrix.
+   * @return {number | BigNumber} Returns the hypothenusa of the input values.
+   */
+  return typed(name, {
+    '... number | BigNumber': _hypot,
+    Array: function Array(x) {
+      return this.apply(this, (0, _array.flatten)(x));
+    },
+    Matrix: function Matrix(x) {
+      return this.apply(this, (0, _array.flatten)(x.toArray()));
+    }
+  });
+  /**
+   * Calculate the hypotenusa for an Array with values
+   * @param {Array.<number | BigNumber>} args
+   * @return {number | BigNumber} Returns the result
+   * @private
+   */
+
+  function _hypot(args) {
+    // code based on `hypot` from es6-shim:
+    // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633
+    var result = 0;
+    var largest = 0;
+
+    for (var i = 0; i < args.length; i++) {
+      var value = abs(args[i]);
+
+      if (smaller(largest, value)) {
+        result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));
+        result = addScalar(result, 1);
+        largest = value;
+      } else {
+        result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);
+      }
+    }
+
+    return multiplyScalar(largest, sqrt(result));
+  }
+});
+exports.createHypot = createHypot;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/invmod.js b/node_modules/mathjs/lib/cjs/function/arithmetic/invmod.js
new file mode 100644
index 0000000..f518697
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/invmod.js
@@ -0,0 +1,73 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createInvmod = void 0;
+
+var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'invmod';
+var dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];
+var createInvmod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      BigNumber = _ref.BigNumber,
+      xgcd = _ref.xgcd,
+      equal = _ref.equal,
+      smaller = _ref.smaller,
+      mod = _ref.mod,
+      add = _ref.add,
+      isInteger = _ref.isInteger;
+
+  /**
+   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`
+   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.
+   *
+   * Syntax:
+   *
+   *    math.invmod(a, b)
+   *
+   * Examples:
+   *
+   *    math.invmod(8, 12)             // returns NaN
+   *    math.invmod(7, 13)             // return 2
+   *    math.invmod(15151, 15122)      // returns 10429
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {number | BigNumber }  Returns an integer number
+   *                              where `invmod(a,b)*a ≣ 1 (mod b)`
+   */
+  return typed(name, {
+    'number, number': invmod,
+    'BigNumber, BigNumber': invmod
+  });
+
+  function invmod(a, b) {
+    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers');
+    a = mod(a, b);
+    if (equal(b, 0)) throw new Error('Divisor must be non zero');
+    var res = xgcd(a, b);
+    res = res.valueOf();
+
+    var _res = res,
+        _res2 = (0, _slicedToArray2.default)(_res, 2),
+        gcd = _res2[0],
+        inv = _res2[1];
+
+    if (!equal(gcd, BigNumber(1))) return NaN;
+    inv = mod(inv, b);
+    if (smaller(inv, BigNumber(0))) inv = add(inv, b);
+    return inv;
+  }
+});
+exports.createInvmod = createInvmod;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/lcm.js b/node_modules/mathjs/lib/cjs/function/arithmetic/lcm.js
new file mode 100644
index 0000000..164a95d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/lcm.js
@@ -0,0 +1,171 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLcm = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm06.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'lcm';
+var dependencies = ['typed', 'matrix', 'equalScalar'];
+var createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar;
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm06 = (0, _algorithm2.createAlgorithm06)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm11 = (0, _algorithm3.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Calculate the least common multiple for two or more values or arrays.
+   *
+   * lcm is defined as:
+   *
+   *     lcm(a, b) = abs(a * b) / gcd(a, b)
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.lcm(a, b)
+   *    math.lcm(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.lcm(4, 6)               // returns 12
+   *    math.lcm(6, 21)              // returns 42
+   *    math.lcm(6, 21, 5)           // returns 210
+   *
+   *    math.lcm([4, 6], [6, 21])    // returns [12, 42]
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Array | Matrix}                           The least common multiple
+   */
+
+  return typed(name, {
+    'number, number': _index.lcmNumber,
+    'BigNumber, BigNumber': _lcmBigNumber,
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.lcm(y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm06(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      return algorithm11(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    },
+    // TODO: need a smarter notation here
+    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {
+      var res = this(a, b);
+
+      for (var i = 0; i < args.length; i++) {
+        res = this(res, args[i]);
+      }
+
+      return res;
+    }
+  });
+  /**
+   * Calculate lcm for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns the least common multiple of a and b
+   * @private
+   */
+
+  function _lcmBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function lcm must be integer numbers');
+    }
+
+    if (a.isZero()) {
+      return a;
+    }
+
+    if (b.isZero()) {
+      return b;
+    } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    // evaluate lcm here inline to reduce overhead
+
+
+    var prod = a.times(b);
+
+    while (!b.isZero()) {
+      var t = b;
+      b = a.mod(t);
+      a = t;
+    }
+
+    return prod.div(a).abs();
+  }
+});
+exports.createLcm = createLcm;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log.js
new file mode 100644
index 0000000..484aa74
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'log';
+var dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
+var createLog = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      divideScalar = _ref.divideScalar,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the logarithm of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log(x)
+   *    math.log(x, base)
+   *
+   * Examples:
+   *
+   *    math.log(3.5)                  // returns 1.252762968495368
+   *    math.exp(math.log(2.4))        // returns 2.4
+   *
+   *    math.pow(10, 4)                // returns 10000
+   *    math.log(10000, 10)            // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *
+   *    math.log(1024, 2)              // returns 10
+   *    math.pow(2, 10)                // returns 1024
+   *
+   * See also:
+   *
+   *    exp, log2, log10, log1p
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @param {number | BigNumber | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x` is calculated.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the logarithm of `x`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return (0, _index.logNumber)(x);
+      } else {
+        // negative value -> complex value computation
+        return new Complex(x, 0).log();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.log();
+    },
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return new Complex(x.toNumber(), 0).log();
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    },
+    'any, any': function anyAny(x, base) {
+      // calculate logarithm for a specified base, log(x, base)
+      return divideScalar(this(x), this(base));
+    }
+  });
+});
+exports.createLog = createLog;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log10.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log10.js
new file mode 100644
index 0000000..a04dd0c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log10.js
@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog10 = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'log10';
+var dependencies = ['typed', 'config', 'Complex'];
+var createLog10 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      _Complex = _ref.Complex;
+
+  /**
+   * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log10(x)
+   *
+   * Examples:
+   *
+   *    math.log10(0.00001)            // returns -5
+   *    math.log10(10000)              // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *    math.pow(10, 4)                // returns 10000
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log2
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 10-base logarithm of `x`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return (0, _index.log10Number)(x);
+      } else {
+        // negative value -> complex value computation
+        return new _Complex(x, 0).log().div(Math.LN10);
+      }
+    },
+    Complex: function Complex(x) {
+      return new _Complex(x).log().div(Math.LN10);
+    },
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log();
+      } else {
+        // downgrade to number, return Complex valued result
+        return new _Complex(x.toNumber(), 0).log().div(Math.LN10);
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createLog10 = createLog10;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log1p.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log1p.js
new file mode 100644
index 0000000..4ee0b45
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log1p.js
@@ -0,0 +1,94 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog1p = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var name = 'log1p';
+var dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];
+var createLog1p = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      divideScalar = _ref.divideScalar,
+      log = _ref.log,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the logarithm of a `value+1`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log1p(x)
+   *    math.log1p(x, base)
+   *
+   * Examples:
+   *
+   *    math.log1p(2.5)                 // returns 1.252762968495368
+   *    math.exp(math.log1p(1.4))       // returns 2.4
+   *
+   *    math.pow(10, 4)                 // returns 10000
+   *    math.log1p(9999, 10)            // returns 4
+   *    math.log1p(9999) / math.log(10) // returns 4
+   *
+   * See also:
+   *
+   *    exp, log, log2, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm of `x+1`.
+   * @param {number | BigNumber | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x+1` is calculated.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the logarithm of `x+1`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 || config.predictable) {
+        return (0, _number.log1p)(x);
+      } else {
+        // negative value -> complex value computation
+        return _log1pComplex(new Complex(x, 0));
+      }
+    },
+    Complex: _log1pComplex,
+    BigNumber: function BigNumber(x) {
+      var y = x.plus(1);
+
+      if (!y.isNegative() || config.predictable) {
+        return y.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return _log1pComplex(new Complex(x.toNumber(), 0));
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    },
+    'any, any': function anyAny(x, base) {
+      // calculate logarithm for a specified base, log1p(x, base)
+      return divideScalar(this(x), log(base));
+    }
+  });
+  /**
+   * Calculate the natural logarithm of a complex number + 1
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+
+  function _log1pComplex(x) {
+    var xRe1p = x.re + 1;
+    return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));
+  }
+});
+exports.createLog1p = createLog1p;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log2.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log2.js
new file mode 100644
index 0000000..f78ed66
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log2.js
@@ -0,0 +1,80 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog2 = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'log2';
+var dependencies = ['typed', 'config', 'Complex'];
+var createLog2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log2(x)
+   *
+   * Examples:
+   *
+   *    math.log2(0.03125)           // returns -5
+   *    math.log2(16)                // returns 4
+   *    math.log2(16) / math.log2(2) // returns 4
+   *    math.pow(2, 4)               // returns 16
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 2-base logarithm of `x`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return (0, _index.log2Number)(x);
+      } else {
+        // negative value -> complex value computation
+        return _log2Complex(new Complex(x, 0));
+      }
+    },
+    Complex: _log2Complex,
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log(2);
+      } else {
+        // downgrade to number, return Complex valued result
+        return _log2Complex(new Complex(x.toNumber(), 0));
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+  /**
+   * Calculate log2 for a complex value
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+
+  function _log2Complex(x) {
+    var newX = Math.sqrt(x.re * x.re + x.im * x.im);
+    return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);
+  }
+});
+exports.createLog2 = createLog2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/mod.js b/node_modules/mathjs/lib/cjs/function/arithmetic/mod.js
new file mode 100644
index 0000000..a40f4bc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/mod.js
@@ -0,0 +1,157 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMod = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm05.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm7 = require("../../type/matrix/utils/algorithm14.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'mod';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+var createMod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm03 = (0, _algorithm2.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm05 = (0, _algorithm3.createAlgorithm05)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm11 = (0, _algorithm4.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm12 = (0, _algorithm5.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm6.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm7.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Calculates the modulus, the remainder of an integer division.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * The modulus is defined as:
+   *
+   *     x - y * floor(x / y)
+   *
+   * See https://en.wikipedia.org/wiki/Modulo_operation.
+   *
+   * Syntax:
+   *
+   *    math.mod(x, y)
+   *
+   * Examples:
+   *
+   *    math.mod(8, 3)                // returns 2
+   *    math.mod(11, 2)               // returns 1
+   *
+   *    function isOdd(x) {
+   *      return math.mod(x, 2) != 0
+   *    }
+   *
+   *    isOdd(2)                      // returns false
+   *    isOdd(3)                      // returns true
+   *
+   * See also:
+   *
+   *    divide
+   *
+   * @param  {number | BigNumber | Fraction | Array | Matrix} x Dividend
+   * @param  {number | BigNumber | Fraction | Array | Matrix} y Divisor
+   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.
+   */
+
+  return typed(name, {
+    'number, number': _index.modNumber,
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      if (y.isNeg()) {
+        throw new Error('Cannot calculate mod for a negative divisor');
+      }
+
+      return y.isZero() ? x : x.mod(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      if (y.compare(0) < 0) {
+        throw new Error('Cannot calculate mod for a negative divisor');
+      } // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend
+
+
+      return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm05(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createMod = createMod;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/multiply.js b/node_modules/mathjs/lib/cjs/function/arithmetic/multiply.js
new file mode 100644
index 0000000..0657a22
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/multiply.js
@@ -0,0 +1,912 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMultiply = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'multiply';
+var dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];
+var createMultiply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      addScalar = _ref.addScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      equalScalar = _ref.equalScalar,
+      dot = _ref.dot;
+  var algorithm11 = (0, _algorithm.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm14 = (0, _algorithm2.createAlgorithm14)({
+    typed: typed
+  });
+
+  function _validateMatrixDimensions(size1, size2) {
+    // check left operand dimensions
+    switch (size1.length) {
+      case 1:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Vector x Vector
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');
+            }
+
+            break;
+
+          case 2:
+            // Vector x Matrix
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');
+            }
+
+            break;
+
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+
+        break;
+
+      case 2:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Matrix x Vector
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');
+            }
+
+            break;
+
+          case 2:
+            // Matrix x Matrix
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');
+            }
+
+            break;
+
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+
+        break;
+
+      default:
+        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');
+    }
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (N)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {number}             Scalar value
+   */
+
+
+  function _multiplyVectorVector(a, b, n) {
+    // check empty vector
+    if (n === 0) {
+      throw new Error('Cannot multiply two empty vectors');
+    }
+
+    return dot(a, b);
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Matrix         (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+
+
+  function _multiplyVectorMatrix(a, b) {
+    // process storage
+    if (b.storage() !== 'dense') {
+      throw new Error('Support for SparseMatrix not implemented');
+    }
+
+    return _multiplyVectorDenseMatrix(a, b);
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Dense Matrix   (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+
+
+  function _multiplyVectorDenseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b dense
+
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype; // rows & columns
+
+    var alength = asize[0];
+    var bcolumns = bsize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var c = []; // loop matrix columns
+
+    for (var j = 0; j < bcolumns; j++) {
+      // sum (do not initialize it with zero)
+      var sum = mf(adata[0], bdata[0][j]); // loop vector
+
+      for (var i = 1; i < alength; i++) {
+        // multiply & accumulate
+        sum = af(sum, mf(adata[i], bdata[i][j]));
+      }
+
+      c[j] = sum;
+    } // return matrix
+
+
+    return a.createDenseMatrix({
+      data: c,
+      size: [bcolumns],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {Matrix}             Dense Vector   (M)
+   */
+
+
+  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {
+    'DenseMatrix, any': _multiplyDenseMatrixVector,
+    'SparseMatrix, any': _multiplySparseMatrixVector
+  });
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Matrix         (NxC)
+   *
+   * @return {Matrix}             Matrix         (MxC)
+   */
+
+
+  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {
+    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,
+    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,
+    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,
+    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix
+  });
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix  (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             Dense Vector (M)
+   */
+
+
+  function _multiplyDenseMatrixVector(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b dense
+
+    var bdata = b._data;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = asize[0];
+    var acolumns = asize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var c = []; // loop matrix a rows
+
+    for (var i = 0; i < arows; i++) {
+      // current row
+      var row = adata[i]; // sum (do not initialize it with zero)
+
+      var sum = mf(row[0], bdata[0]); // loop matrix a columns
+
+      for (var j = 1; j < acolumns; j++) {
+        // multiply & accumulate
+        sum = af(sum, mf(row[j], bdata[j]));
+      }
+
+      c[i] = sum;
+    } // return matrix
+
+
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            DenseMatrix    (NxC)
+   *
+   * @return {Matrix}             DenseMatrix    (MxC)
+   */
+
+
+  function _multiplyDenseMatrixDenseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b dense
+
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = asize[0];
+    var acolumns = asize[1];
+    var bcolumns = bsize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var c = []; // loop matrix a rows
+
+    for (var i = 0; i < arows; i++) {
+      // current row
+      var row = adata[i]; // initialize row array
+
+      c[i] = []; // loop matrix b columns
+
+      for (var j = 0; j < bcolumns; j++) {
+        // sum (avoid initializing sum to zero)
+        var sum = mf(row[0], bdata[0][j]); // loop matrix a columns
+
+        for (var x = 1; x < acolumns; x++) {
+          // multiply & accumulate
+          sum = af(sum, mf(row[x], bdata[x][j]));
+        }
+
+        c[i][j] = sum;
+      }
+    } // return matrix
+
+
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows, bcolumns],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            SparseMatrix   (NxC)
+   *
+   * @return {Matrix}             SparseMatrix   (MxC)
+   */
+
+
+  function _multiplyDenseMatrixSparseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b sparse
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate b matrix
+
+    if (!bvalues) {
+      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');
+    } // rows & columns
+
+
+    var arows = asize[0];
+    var bcolumns = bsize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // equalScalar signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt);
+    } // result
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // c matrix
+
+    var c = b.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: dt
+    }); // loop b columns
+
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length; // indeces in column jb
+
+      var kb0 = bptr[jb];
+      var kb1 = bptr[jb + 1]; // do not process column jb if no data exists
+
+      if (kb1 > kb0) {
+        // last row mark processed
+        var last = 0; // loop a rows
+
+        for (var i = 0; i < arows; i++) {
+          // column mark
+          var mark = i + 1; // C[i, jb]
+
+          var cij = void 0; // values in b column j
+
+          for (var kb = kb0; kb < kb1; kb++) {
+            // row
+            var ib = bindex[kb]; // check value has been initialized
+
+            if (last !== mark) {
+              // first value in column jb
+              cij = mf(adata[i][ib], bvalues[kb]); // update mark
+
+              last = mark;
+            } else {
+              // accumulate value
+              cij = af(cij, mf(adata[i][ib], bvalues[kb]));
+            }
+          } // check column has been processed and value != 0
+
+
+          if (last === mark && !eq(cij, zero)) {
+            // push row & value
+            cindex.push(i);
+            cvalues.push(cij);
+          }
+        }
+      }
+    } // update ptr
+
+
+    cptr[bcolumns] = cindex.length; // return sparse matrix
+
+    return c;
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix    (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             SparseMatrix    (M, 1)
+   */
+
+
+  function _multiplySparseMatrixVector(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype; // validate a matrix
+
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    } // b dense
+
+
+    var bdata = b._data;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = a._size[0];
+    var brows = b._size[0]; // result
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // equalScalar signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt);
+    } // workspace
+
+
+    var x = []; // vector with marks indicating a value x[i] exists in a given column
+
+    var w = []; // update ptr
+
+    cptr[0] = 0; // rows in b
+
+    for (var ib = 0; ib < brows; ib++) {
+      // b[ib]
+      var vbi = bdata[ib]; // check b[ib] != 0, avoid loops
+
+      if (!eq(vbi, zero)) {
+        // A values & index in ib column
+        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+          // a row
+          var ia = aindex[ka]; // check value exists in current j
+
+          if (!w[ia]) {
+            // ia is new entry in j
+            w[ia] = true; // add i to pattern of C
+
+            cindex.push(ia); // x(ia) = A
+
+            x[ia] = mf(vbi, avalues[ka]);
+          } else {
+            // i exists in C already
+            x[ia] = af(x[ia], mf(vbi, avalues[ka]));
+          }
+        }
+      }
+    } // copy values from x to column jb of c
+
+
+    for (var p1 = cindex.length, p = 0; p < p1; p++) {
+      // row
+      var ic = cindex[p]; // copy value
+
+      cvalues[p] = x[ic];
+    } // update ptr
+
+
+    cptr[1] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, 1],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            DenseMatrix       (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+
+
+  function _multiplySparseMatrixDenseMatrix(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype; // validate a matrix
+
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    } // b dense
+
+
+    var bdata = b._data;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = a._size[0];
+    var brows = b._size[0];
+    var bcolumns = b._size[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // equalScalar signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt);
+    } // result
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // c matrix
+
+    var c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: dt
+    }); // workspace
+
+    var x = []; // vector with marks indicating a value x[i] exists in a given column
+
+    var w = []; // loop b columns
+
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length; // mark in workspace for current column
+
+      var mark = jb + 1; // rows in jb
+
+      for (var ib = 0; ib < brows; ib++) {
+        // b[ib, jb]
+        var vbij = bdata[ib][jb]; // check b[ib, jb] != 0, avoid loops
+
+        if (!eq(vbij, zero)) {
+          // A values & index in ib column
+          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // a row
+            var ia = aindex[ka]; // check value exists in current j
+
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark; // add i to pattern of C
+
+              cindex.push(ia); // x(ia) = A
+
+              x[ia] = mf(vbij, avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(vbij, avalues[ka]));
+            }
+          }
+        }
+      } // copy values from x to column jb of c
+
+
+      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+        // row
+        var ic = cindex[p]; // copy value
+
+        cvalues[p] = x[ic];
+      }
+    } // update ptr
+
+
+    cptr[bcolumns] = cindex.length; // return sparse matrix
+
+    return c;
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            SparseMatrix      (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+
+
+  function _multiplySparseMatrixSparseMatrix(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype; // b sparse
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = a._size[0];
+    var bcolumns = b._size[1]; // flag indicating both matrices (a & b) contain data
+
+    var values = avalues && bvalues; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var cvalues = values ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // c matrix
+
+    var c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: dt
+    }); // workspace
+
+    var x = values ? [] : undefined; // vector with marks indicating a value x[i] exists in a given column
+
+    var w = []; // variables
+
+    var ka, ka0, ka1, kb, kb0, kb1, ia, ib; // loop b columns
+
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length; // mark in workspace for current column
+
+      var mark = jb + 1; // B values & index in j
+
+      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {
+        // b row
+        ib = bindex[kb]; // check we need to process values
+
+        if (values) {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka]; // check value exists in current j
+
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark; // add i to pattern of C
+
+              cindex.push(ia); // x(ia) = A
+
+              x[ia] = mf(bvalues[kb], avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));
+            }
+          }
+        } else {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka]; // check value exists in current j
+
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark; // add i to pattern of C
+
+              cindex.push(ia);
+            }
+          }
+        }
+      } // check we need to process matrix values (pattern matrix)
+
+
+      if (values) {
+        // copy values from x to column jb of c
+        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+          // row
+          var ic = cindex[p]; // copy value
+
+          cvalues[p] = x[ic];
+        }
+      }
+    } // update ptr
+
+
+    cptr[bcolumns] = cindex.length; // return sparse matrix
+
+    return c;
+  }
+  /**
+   * Multiply two or more values, `x * y`.
+   * For matrices, the matrix product is calculated.
+   *
+   * Syntax:
+   *
+   *    math.multiply(x, y)
+   *    math.multiply(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.multiply(4, 5.2)        // returns number 20.8
+   *    math.multiply(2, 3, 4)       // returns number 24
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.multiply(a, b)          // returns Complex 5 + 14i
+   *
+   *    const c = [[1, 2], [4, 3]]
+   *    const d = [[1, 2, 3], [3, -4, 7]]
+   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]
+   *
+   *    const e = math.unit('2.1 km')
+   *    math.multiply(3, e)          // returns Unit 6.3 km
+   *
+   * See also:
+   *
+   *    divide, prod, cross, dot
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to multiply
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`
+   */
+
+
+  return typed(name, (0, _object.extend)({
+    // we extend the signatures of multiplyScalar with signatures dealing with matrices
+    'Array, Array': function ArrayArray(x, y) {
+      // check dimensions
+      _validateMatrixDimensions((0, _array.arraySize)(x), (0, _array.arraySize)(y)); // use dense matrix implementation
+
+
+      var m = this(matrix(x), matrix(y)); // return array or scalar
+
+      return (0, _is.isMatrix)(m) ? m.valueOf() : m;
+    },
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      // dimensions
+      var xsize = x.size();
+      var ysize = y.size(); // check dimensions
+
+      _validateMatrixDimensions(xsize, ysize); // process dimensions
+
+
+      if (xsize.length === 1) {
+        // process y dimensions
+        if (ysize.length === 1) {
+          // Vector * Vector
+          return _multiplyVectorVector(x, y, xsize[0]);
+        } // Vector * Matrix
+
+
+        return _multiplyVectorMatrix(x, y);
+      } // process y dimensions
+
+
+      if (ysize.length === 1) {
+        // Matrix * Vector
+        return _multiplyMatrixVector(x, y);
+      } // Matrix * Matrix
+
+
+      return _multiplyMatrixMatrix(x, y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use Matrix * Matrix implementation
+      return this(x, matrix(y));
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use Matrix * Matrix implementation
+      return this(matrix(x, y.storage()), y);
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, multiplyScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm11(y, x, multiplyScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, multiplyScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();
+    },
+    'any, any': multiplyScalar,
+    'any, any, ...any': function anyAnyAny(x, y, rest) {
+      var result = this(x, y);
+
+      for (var i = 0; i < rest.length; i++) {
+        result = this(result, rest[i]);
+      }
+
+      return result;
+    }
+  }, multiplyScalar.signatures));
+});
+exports.createMultiply = createMultiply;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/multiplyScalar.js b/node_modules/mathjs/lib/cjs/function/arithmetic/multiplyScalar.js
new file mode 100644
index 0000000..34d3935
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/multiplyScalar.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMultiplyScalar = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'multiplyScalar';
+var dependencies = ['typed'];
+var createMultiplyScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Multiply two scalar values, `x * y`.
+   * This function is meant for internal use: it is used by the public function
+   * `multiply`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to multiply
+   * @param  {number | BigNumber | Fraction | Complex} y          Second value to multiply
+   * @return {number | BigNumber | Fraction | Complex | Unit}     Multiplication of `x` and `y`
+   * @private
+   */
+  return typed('multiplyScalar', {
+    'number, number': _index.multiplyNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.mul(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.times(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.mul(y);
+    },
+    'number | Fraction | BigNumber | Complex, Unit': function numberFractionBigNumberComplexUnit(x, y) {
+      var res = y.clone();
+      res.value = res.value === null ? res._normalize(x) : this(res.value, x);
+      return res;
+    },
+    'Unit, number | Fraction | BigNumber | Complex': function UnitNumberFractionBigNumberComplex(x, y) {
+      var res = x.clone();
+      res.value = res.value === null ? res._normalize(y) : this(res.value, y);
+      return res;
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return x.multiply(y);
+    }
+  });
+});
+exports.createMultiplyScalar = createMultiplyScalar;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/norm.js b/node_modules/mathjs/lib/cjs/function/arithmetic/norm.js
new file mode 100644
index 0000000..7814a0b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/norm.js
@@ -0,0 +1,324 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNorm = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'norm';
+var dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];
+var createNorm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      abs = _ref.abs,
+      add = _ref.add,
+      pow = _ref.pow,
+      conj = _ref.conj,
+      sqrt = _ref.sqrt,
+      multiply = _ref.multiply,
+      equalScalar = _ref.equalScalar,
+      larger = _ref.larger,
+      smaller = _ref.smaller,
+      matrix = _ref.matrix,
+      ctranspose = _ref.ctranspose,
+      eigs = _ref.eigs;
+
+  /**
+   * Calculate the norm of a number, vector or matrix.
+   *
+   * The second parameter p is optional. If not provided, it defaults to 2.
+   *
+   * Syntax:
+   *
+   *    math.norm(x)
+   *    math.norm(x, p)
+   *
+   * Examples:
+   *
+   *    math.abs(-3.5)                         // returns 3.5
+   *    math.norm(-3.5)                        // returns 3.5
+   *
+   *    math.norm(math.complex(3, -4))         // returns 5
+   *
+   *    math.norm([1, 2, -3], Infinity)        // returns 3
+   *    math.norm([1, 2, -3], -Infinity)       // returns 1
+   *
+   *    math.norm([3, 4], 2)                   // returns 5
+   *
+   *    math.norm([[1, 2], [3, 4]], 1)          // returns 6
+   *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7
+   *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661
+   *
+   * See also:
+   *
+   *    abs, hypot
+   *
+   * @param  {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the norm
+   * @param  {number | BigNumber | string} [p=2]
+   *            Vector space.
+   *            Supported numbers include Infinity and -Infinity.
+   *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)
+   * @return {number | BigNumber} the p-norm
+   */
+  return typed(name, {
+    number: Math.abs,
+    Complex: function Complex(x) {
+      return x.abs();
+    },
+    BigNumber: function BigNumber(x) {
+      // norm(x) = abs(x)
+      return x.abs();
+    },
+    boolean: function boolean(x) {
+      // norm(x) = abs(x)
+      return Math.abs(x);
+    },
+    Array: function Array(x) {
+      return _norm(matrix(x), 2);
+    },
+    Matrix: function Matrix(x) {
+      return _norm(x, 2);
+    },
+    'number | Complex | BigNumber | boolean, number | BigNumber | string': function numberComplexBigNumberBooleanNumberBigNumberString(x) {
+      // ignore second parameter, TODO: remove the option of second parameter for these types
+      return this(x);
+    },
+    'Array, number | BigNumber | string': function ArrayNumberBigNumberString(x, p) {
+      return _norm(matrix(x), p);
+    },
+    'Matrix, number | BigNumber | string': function MatrixNumberBigNumberString(x, p) {
+      return _norm(x, p);
+    }
+  });
+  /**
+   * Calculate the plus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+  function _vectorNormPlusInfinity(x) {
+    // norm(x, Infinity) = max(abs(x))
+    var pinf = 0; // skip zeros since abs(0) === 0
+
+    x.forEach(function (value) {
+      var v = abs(value);
+
+      if (larger(v, pinf)) {
+        pinf = v;
+      }
+    }, true);
+    return pinf;
+  }
+  /**
+   * Calculate the minus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _vectorNormMinusInfinity(x) {
+    // norm(x, -Infinity) = min(abs(x))
+    var ninf; // skip zeros since abs(0) === 0
+
+    x.forEach(function (value) {
+      var v = abs(value);
+
+      if (!ninf || smaller(v, ninf)) {
+        ninf = v;
+      }
+    }, true);
+    return ninf || 0;
+  }
+  /**
+   * Calculate the norm for a vector
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _vectorNorm(x, p) {
+    // check p
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _vectorNormPlusInfinity(x);
+    }
+
+    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {
+      return _vectorNormMinusInfinity(x);
+    }
+
+    if (p === 'fro') {
+      return _norm(x, 2);
+    }
+
+    if (typeof p === 'number' && !isNaN(p)) {
+      // check p != 0
+      if (!equalScalar(p, 0)) {
+        // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p
+        var n = 0; // skip zeros since abs(0) === 0
+
+        x.forEach(function (value) {
+          n = add(pow(abs(value), p), n);
+        }, true);
+        return pow(n, 1 / p);
+      }
+
+      return Number.POSITIVE_INFINITY;
+    } // invalid parameter value
+
+
+    throw new Error('Unsupported parameter value');
+  }
+  /**
+   * Calculate the Frobenius norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormFrobenius(x) {
+    // norm(x) = sqrt(sum(diag(x'x)))
+    var fro = 0;
+    x.forEach(function (value, index) {
+      fro = add(fro, multiply(value, conj(value)));
+    });
+    return abs(sqrt(fro));
+  }
+  /**
+   * Calculate the norm L1 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormOne(x) {
+    // norm(x) = the largest column sum
+    var c = []; // result
+
+    var maxc = 0; // skip zeros since abs(0) == 0
+
+    x.forEach(function (value, index) {
+      var j = index[1];
+      var cj = add(c[j] || 0, abs(value));
+
+      if (larger(cj, maxc)) {
+        maxc = cj;
+      }
+
+      c[j] = cj;
+    }, true);
+    return maxc;
+  }
+  /**
+   * Calculate the norm L2 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormTwo(x) {
+    // norm(x) = sqrt( max eigenvalue of A*.A)
+    var sizeX = x.size();
+
+    if (sizeX[0] !== sizeX[1]) {
+      throw new RangeError('Invalid matrix dimensions');
+    }
+
+    var tx = ctranspose(x);
+    var squaredX = multiply(tx, x);
+    var eigenVals = eigs(squaredX).values.toArray();
+    var rho = eigenVals[eigenVals.length - 1];
+    return abs(sqrt(rho));
+  }
+  /**
+   * Calculate the infinity norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormInfinity(x) {
+    // norm(x) = the largest row sum
+    var r = []; // result
+
+    var maxr = 0; // skip zeros since abs(0) == 0
+
+    x.forEach(function (value, index) {
+      var i = index[0];
+      var ri = add(r[i] || 0, abs(value));
+
+      if (larger(ri, maxr)) {
+        maxr = ri;
+      }
+
+      r[i] = ri;
+    }, true);
+    return maxr;
+  }
+  /**
+   * Calculate the norm for a 2D Matrix (M*N)
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNorm(x, p) {
+    // check p
+    if (p === 1) {
+      return _matrixNormOne(x);
+    }
+
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _matrixNormInfinity(x);
+    }
+
+    if (p === 'fro') {
+      return _matrixNormFrobenius(x);
+    }
+
+    if (p === 2) {
+      return _matrixNormTwo(x);
+    } // invalid parameter value
+
+
+    throw new Error('Unsupported parameter value ' + p);
+  }
+  /**
+   * Calculate the norm for an array
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _norm(x, p) {
+    // size
+    var sizeX = x.size(); // check if it is a vector
+
+    if (sizeX.length === 1) {
+      return _vectorNorm(x, p);
+    } // MxN matrix
+
+
+    if (sizeX.length === 2) {
+      if (sizeX[0] && sizeX[1]) {
+        return _matrixNorm(x, p);
+      } else {
+        throw new RangeError('Invalid matrix dimensions');
+      }
+    }
+  }
+});
+exports.createNorm = createNorm;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..08d5048
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoot.js
@@ -0,0 +1,222 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNthRootNumber = exports.createNthRoot = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm01.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm06.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm14.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'nthRoot';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber'];
+var createNthRoot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      _BigNumber = _ref.BigNumber;
+  var algorithm01 = (0, _algorithm.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm02 = (0, _algorithm2.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm06 = (0, _algorithm3.createAlgorithm06)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm11 = (0, _algorithm4.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm6.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Calculate the nth root of a value.
+   * The principal nth root of a positive real number A, is the positive real
+   * solution of the equation
+   *
+   *     x^root = A
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *     math.nthRoot(a)
+   *     math.nthRoot(a, root)
+   *
+   * Examples:
+   *
+   *     math.nthRoot(9, 2)    // returns 3, as 3^2 == 9
+   *     math.sqrt(9)          // returns 3, as 3^2 == 9
+   *     math.nthRoot(64, 3)   // returns 4, as 4^3 == 64
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param {number | BigNumber | Array | Matrix | Complex} a
+   *              Value for which to calculate the nth root
+   * @param {number | BigNumber} [root=2]    The root.
+   * @return {number | Complex | Array | Matrix} Returns the nth root of `a`
+   */
+
+  var complexErr = '' + 'Complex number not supported in function nthRoot. ' + 'Use nthRoots instead.';
+  return typed(name, {
+    number: function number(x) {
+      return (0, _index.nthRootNumber)(x, 2);
+    },
+    'number, number': _index.nthRootNumber,
+    BigNumber: function BigNumber(x) {
+      return _bigNthRoot(x, new _BigNumber(2));
+    },
+    Complex: function Complex(x) {
+      throw new Error(complexErr);
+    },
+    'Complex, number': function ComplexNumber(x, y) {
+      throw new Error(complexErr);
+    },
+    'BigNumber, BigNumber': _bigNthRoot,
+    'Array | Matrix': function ArrayMatrix(x) {
+      return this(x, 2);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse + sparse
+        return algorithm06(x, y, this);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // dense + sparse
+        return algorithm01(x, y, this, false);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse - scalar
+        return algorithm11(y, x, this, true);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+  /**
+   * Calculate the nth root of a for BigNumbers, solve x^root == a
+   * https://rosettacode.org/wiki/Nth_root#JavaScript
+   * @param {BigNumber} a
+   * @param {BigNumber} root
+   * @private
+   */
+
+  function _bigNthRoot(a, root) {
+    var precision = _BigNumber.precision;
+
+    var Big = _BigNumber.clone({
+      precision: precision + 2
+    });
+
+    var zero = new _BigNumber(0);
+    var one = new Big(1);
+    var inv = root.isNegative();
+
+    if (inv) {
+      root = root.neg();
+    }
+
+    if (root.isZero()) {
+      throw new Error('Root must be non-zero');
+    }
+
+    if (a.isNegative() && !root.abs().mod(2).equals(1)) {
+      throw new Error('Root must be odd when a is negative.');
+    } // edge cases zero and infinity
+
+
+    if (a.isZero()) {
+      return inv ? new Big(Infinity) : 0;
+    }
+
+    if (!a.isFinite()) {
+      return inv ? zero : a;
+    }
+
+    var x = a.abs().pow(one.div(root)); // If a < 0, we require that root is an odd integer,
+    // so (-1) ^ (1/root) = -1
+
+    x = a.isNeg() ? x.neg() : x;
+    return new _BigNumber((inv ? one.div(x) : x).toPrecision(precision));
+  }
+});
+exports.createNthRoot = createNthRoot;
+var createNthRootNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed'], function (_ref2) {
+  var typed = _ref2.typed;
+  return typed(name, {
+    number: _index.nthRootNumber,
+    'number, number': _index.nthRootNumber
+  });
+});
+exports.createNthRootNumber = createNthRootNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..3802542
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoots.js
@@ -0,0 +1,124 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNthRoots = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'nthRoots';
+var dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
+var createNthRoots = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      divideScalar = _ref.divideScalar,
+      Complex = _ref.Complex;
+
+  /**
+   * Each function here returns a real multiple of i as a Complex value.
+   * @param  {number} val
+   * @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3
+   */
+  // This is used to fix float artifacts for zero-valued components.
+  var _calculateExactResult = [function realPos(val) {
+    return new Complex(val, 0);
+  }, function imagPos(val) {
+    return new Complex(0, val);
+  }, function realNeg(val) {
+    return new Complex(-val, 0);
+  }, function imagNeg(val) {
+    return new Complex(0, -val);
+  }];
+  /**
+   * Calculate the nth root of a Complex Number a using De Movire's Theorem.
+   * @param  {Complex} a
+   * @param  {number} root
+   * @return {Array} array of n Complex Roots
+   */
+
+  function _nthComplexRoots(a, root) {
+    if (root < 0) throw new Error('Root must be greater than zero');
+    if (root === 0) throw new Error('Root must be non-zero');
+    if (root % 1 !== 0) throw new Error('Root must be an integer');
+    if (a === 0 || a.abs() === 0) return [new Complex(0, 0)];
+    var aIsNumeric = typeof a === 'number';
+    var offset; // determine the offset (argument of a)/(pi/2)
+
+    if (aIsNumeric || a.re === 0 || a.im === 0) {
+      if (aIsNumeric) {
+        offset = 2 * +(a < 0); // numeric value on the real axis
+      } else if (a.im === 0) {
+        offset = 2 * +(a.re < 0); // complex value on the real axis
+      } else {
+        offset = 2 * +(a.im < 0) + 1; // complex value on the imaginary axis
+      }
+    }
+
+    var arg = a.arg();
+    var abs = a.abs();
+    var roots = [];
+    var r = Math.pow(abs, 1 / root);
+
+    for (var k = 0; k < root; k++) {
+      var halfPiFactor = (offset + 4 * k) / root;
+      /**
+       * If (offset + 4*k)/root is an integral multiple of pi/2
+       * then we can produce a more exact result.
+       */
+
+      if (halfPiFactor === Math.round(halfPiFactor)) {
+        roots.push(_calculateExactResult[halfPiFactor % 4](r));
+        continue;
+      }
+
+      roots.push(new Complex({
+        r: r,
+        phi: (arg + 2 * Math.PI * k) / root
+      }));
+    }
+
+    return roots;
+  }
+  /**
+   * Calculate the nth roots of a value.
+   * An nth root of a positive real number A,
+   * is a positive real solution of the equation "x^root = A".
+   * This function returns an array of complex values.
+   *
+   * Syntax:
+   *
+   *    math.nthRoots(x)
+   *    math.nthRoots(x, root)
+   *
+   * Examples:
+   *
+   *    math.nthRoots(1)
+   *    // returns [
+   *    //   {re: 1, im: 0},
+   *    //   {re: -1, im: 0}
+   *    // ]
+   *    nthRoots(1, 3)
+   *    // returns [
+   *    //   { re: 1, im: 0 },
+   *    //   { re: -0.4999999999999998, im: 0.8660254037844387 },
+   *    //   { re: -0.5000000000000004, im: -0.8660254037844385 }
+   *    ]
+   *
+   * See also:
+   *
+   *    nthRoot, pow, sqrt
+   *
+   * @param {number | BigNumber | Fraction | Complex} x Number to be rounded
+   * @return {number | BigNumber | Fraction | Complex}            Rounded value
+   */
+
+
+  return typed(name, {
+    Complex: function Complex(x) {
+      return _nthComplexRoots(x, 2);
+    },
+    'Complex, number': _nthComplexRoots
+  });
+});
+exports.createNthRoots = createNthRoots;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/pow.js b/node_modules/mathjs/lib/cjs/function/arithmetic/pow.js
new file mode 100644
index 0000000..8785c78
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/pow.js
@@ -0,0 +1,196 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPow = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _number = require("../../utils/number.js");
+
+var _array = require("../../utils/array.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'pow';
+var dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'fraction', 'number', 'Complex'];
+var createPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      identity = _ref.identity,
+      multiply = _ref.multiply,
+      matrix = _ref.matrix,
+      number = _ref.number,
+      fraction = _ref.fraction,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculates the power of x to y, `x ^ y`.
+   * Matrix exponentiation is supported for square matrices `x`, and positive
+   * integer exponents `y`.
+   *
+   * For cubic roots of negative numbers, the function returns the principal
+   * root by default. In order to let the function return the real root,
+   * math.js can be configured with `math.config({predictable: true})`.
+   * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.
+   *
+   * Syntax:
+   *
+   *    math.pow(x, y)
+   *
+   * Examples:
+   *
+   *    math.pow(2, 3)               // returns number 8
+   *
+   *    const a = math.complex(2, 3)
+   *    math.pow(a, 2)                // returns Complex -5 + 12i
+   *
+   *    const b = [[1, 2], [4, 3]]
+   *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   * See also:
+   *
+   *    multiply, sqrt, cbrt, nthRoot
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | Complex} y                          The exponent
+   * @return {number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y`
+   */
+  return typed(name, {
+    'number, number': _pow,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.pow(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      if (y.isInteger() || x >= 0 || config.predictable) {
+        return x.pow(y);
+      } else {
+        return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0);
+      }
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      var result = x.pow(y);
+
+      if (result != null) {
+        return result;
+      }
+
+      if (config.predictable) {
+        throw new Error('Result of pow is non-rational and cannot be expressed as a fraction');
+      } else {
+        return _pow(x.valueOf(), y.valueOf());
+      }
+    },
+    'Array, number': _powArray,
+    'Array, BigNumber': function ArrayBigNumber(x, y) {
+      return _powArray(x, y.toNumber());
+    },
+    'Matrix, number': _powMatrix,
+    'Matrix, BigNumber': function MatrixBigNumber(x, y) {
+      return _powMatrix(x, y.toNumber());
+    },
+    'Unit, number | BigNumber': function UnitNumberBigNumber(x, y) {
+      return x.pow(y);
+    }
+  });
+  /**
+   * Calculates the power of x to y, x^y, for two numbers.
+   * @param {number} x
+   * @param {number} y
+   * @return {number | Complex} res
+   * @private
+   */
+
+  function _pow(x, y) {
+    // Alternatively could define a 'realmode' config option or something, but
+    // 'predictable' will work for now
+    if (config.predictable && !(0, _number.isInteger)(y) && x < 0) {
+      // Check to see if y can be represented as a fraction
+      try {
+        var yFrac = fraction(y);
+        var yNum = number(yFrac);
+
+        if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {
+          if (yFrac.d % 2 === 1) {
+            return (yFrac.n % 2 === 0 ? 1 : -1) * Math.pow(-x, y);
+          }
+        }
+      } catch (ex) {// fraction() throws an error if y is Infinity, etc.
+      } // Unable to express y as a fraction, so continue on
+
+    } // **for predictable mode** x^Infinity === NaN if x < -1
+    // N.B. this behavour is different from `Math.pow` which gives
+    // (-2)^Infinity === Infinity
+
+
+    if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {
+      return NaN;
+    }
+
+    if ((0, _number.isInteger)(y) || x >= 0 || config.predictable) {
+      return (0, _index.powNumber)(x, y);
+    } else {
+      // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow
+      // x^Infinity === 0 if -1 < x < 1
+      // A real number 0 is returned instead of complex(0)
+      if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+        return 0;
+      }
+
+      return new Complex(x, 0).pow(y, 0);
+    }
+  }
+  /**
+   * Calculate the power of a 2d array
+   * @param {Array} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a positive, integer value
+   * @returns {Array}
+   * @private
+   */
+
+
+  function _powArray(x, y) {
+    if (!(0, _number.isInteger)(y) || y < 0) {
+      throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')');
+    } // verify that A is a 2 dimensional square matrix
+
+
+    var s = (0, _array.arraySize)(x);
+
+    if (s.length !== 2) {
+      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');
+    }
+
+    if (s[0] !== s[1]) {
+      throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')');
+    }
+
+    var res = identity(s[0]).valueOf();
+    var px = x;
+
+    while (y >= 1) {
+      if ((y & 1) === 1) {
+        res = multiply(px, res);
+      }
+
+      y >>= 1;
+      px = multiply(px, px);
+    }
+
+    return res;
+  }
+  /**
+   * Calculate the power of a 2d matrix
+   * @param {Matrix} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a positive, integer value
+   * @returns {Matrix}
+   * @private
+   */
+
+
+  function _powMatrix(x, y) {
+    return matrix(_powArray(x.valueOf(), y));
+  }
+});
+exports.createPow = createPow;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/round.js b/node_modules/mathjs/lib/cjs/function/arithmetic/round.js
new file mode 100644
index 0000000..b664e4e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/round.js
@@ -0,0 +1,191 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRoundNumber = exports.createRound = void 0;
+
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm14.js");
+
+var _index = require("../../plain/number/index.js");
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2.default)(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+var NO_INT = 'Number of decimals in function round must be an integer';
+var name = 'round';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];
+var createRound = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      zeros = _ref.zeros,
+      BigNumber = _ref.BigNumber,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm11 = (0, _algorithm.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm12 = (0, _algorithm2.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm14 = (0, _algorithm3.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Round a value towards the nearest integer.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.round(x)
+   *    math.round(x, n)
+   *
+   * Examples:
+   *
+   *    math.round(3.22)             // returns number 3
+   *    math.round(3.82)             // returns number 4
+   *    math.round(-4.2)             // returns number -4
+   *    math.round(-4.7)             // returns number -5
+   *    math.round(3.22, 1)          // returns number 3.2
+   *    math.round(3.88, 1)          // returns number 3.9
+   *    math.round(-4.21, 1)         // returns number -4.2
+   *    math.round(-4.71, 1)         // returns number -4.7
+   *    math.round(math.pi, 3)       // returns number 3.142
+   *    math.round(123.45678, 2)     // returns number 123.46
+   *
+   *    const c = math.complex(3.2, -2.7)
+   *    math.round(c)                // returns Complex 3 - 3i
+   *
+   *    math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]
+   *
+   * See also:
+   *
+   *    ceil, fix, floor
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
+   */
+
+  return typed(name, _objectSpread(_objectSpread({}, roundNumberSignatures), {}, {
+    Complex: function Complex(x) {
+      return x.round();
+    },
+    'Complex, number': function ComplexNumber(x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+
+      return x.round(n);
+    },
+    'Complex, BigNumber': function ComplexBigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      var _n = n.toNumber();
+
+      return x.round(_n);
+    },
+    'number, BigNumber': function numberBigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      return new BigNumber(x).toDecimalPlaces(n.toNumber());
+    },
+    BigNumber: function BigNumber(x) {
+      return x.toDecimalPlaces(0);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      return x.toDecimalPlaces(n.toNumber());
+    },
+    Fraction: function Fraction(x) {
+      return x.round();
+    },
+    'Fraction, number': function FractionNumber(x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+
+      return x.round(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since round(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | Complex | BigNumber, SparseMatrix': function numberComplexBigNumberSparseMatrix(x, y) {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm12(y, x, this, true);
+    },
+    'number | Complex | BigNumber, DenseMatrix': function numberComplexBigNumberDenseMatrix(x, y) {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  }));
+});
+exports.createRound = createRound;
+var roundNumberSignatures = {
+  number: _index.roundNumber,
+  'number, number': function numberNumber(x, n) {
+    if (!(0, _number.isInteger)(n)) {
+      throw new TypeError(NO_INT);
+    }
+
+    if (n < 0 || n > 15) {
+      throw new Error('Number of decimals in function round must be in the range of 0-15');
+    }
+
+    return (0, _index.roundNumber)(x, n);
+  }
+};
+var createRoundNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed'], function (_ref2) {
+  var typed = _ref2.typed;
+  return typed(name, roundNumberSignatures);
+});
+exports.createRoundNumber = createRoundNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/sign.js b/node_modules/mathjs/lib/cjs/function/arithmetic/sign.js
new file mode 100644
index 0000000..e6298d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/sign.js
@@ -0,0 +1,76 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSign = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'sign';
+var dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];
+var createSign = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber,
+      complex = _ref.complex,
+      _Fraction = _ref.Fraction;
+
+  /**
+   * Compute the sign of a value. The sign of a value x is:
+   *
+   * -  1 when x > 0
+   * - -1 when x < 0
+   * -  0 when x == 0
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sign(x)
+   *
+   * Examples:
+   *
+   *    math.sign(3.5)               // returns 1
+   *    math.sign(-4.2)              // returns -1
+   *    math.sign(0)                 // returns 0
+   *
+   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]
+   *
+   * See also:
+   *
+   *    abs
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            The number for which to determine the sign
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}e
+   *            The sign of `x`
+   */
+  return typed(name, {
+    number: _index.signNumber,
+    Complex: function Complex(x) {
+      return x.im === 0 ? complex((0, _index.signNumber)(x.re)) : x.sign();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(x.cmp(0));
+    },
+    Fraction: function Fraction(x) {
+      return new _Fraction(x.s, 1);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sign(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    Unit: function Unit(x) {
+      if (!x._isDerived() && x.units[0].unit.offset !== 0) {
+        throw new TypeError('sign is ambiguous for units with offset');
+      }
+
+      return this(x.value);
+    }
+  });
+});
+exports.createSign = createSign;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/cjs/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..4053d8a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/sqrt.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSqrt = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'sqrt';
+var dependencies = ['config', 'typed', 'Complex'];
+var createSqrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var config = _ref.config,
+      typed = _ref.typed,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the square root of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sqrt(x)
+   *
+   * Examples:
+   *
+   *    math.sqrt(25)                // returns 5
+   *    math.square(5)               // returns 25
+   *    math.sqrt(-4)                // returns Complex 2i
+   *
+   * See also:
+   *
+   *    square, multiply, cube, cbrt, sqrtm
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x
+   *            Value for which to calculate the square root.
+   * @return {number | BigNumber | Complex | Array | Matrix | Unit}
+   *            Returns the square root of `x`
+   */
+  return typed('sqrt', {
+    number: _sqrtNumber,
+    Complex: function Complex(x) {
+      return x.sqrt();
+    },
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.sqrt();
+      } else {
+        // negative value -> downgrade to number to do complex value computation
+        return _sqrtNumber(x.toNumber());
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sqrt(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    Unit: function Unit(x) {
+      // Someday will work for complex units when they are implemented
+      return x.pow(0.5);
+    }
+  });
+  /**
+   * Calculate sqrt for a number
+   * @param {number} x
+   * @returns {number | Complex} Returns the square root of x
+   * @private
+   */
+
+  function _sqrtNumber(x) {
+    if (isNaN(x)) {
+      return NaN;
+    } else if (x >= 0 || config.predictable) {
+      return Math.sqrt(x);
+    } else {
+      return new Complex(x, 0).sqrt();
+    }
+  }
+});
+exports.createSqrt = createSqrt;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/square.js b/node_modules/mathjs/lib/cjs/function/arithmetic/square.js
new file mode 100644
index 0000000..9d6ffcf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/square.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSquare = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'square';
+var dependencies = ['typed'];
+var createSquare = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Compute the square of a value, `x * x`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.square(x)
+   *
+   * Examples:
+   *
+   *    math.square(2)           // returns number 4
+   *    math.square(3)           // returns number 9
+   *    math.pow(3, 2)           // returns number 9
+   *    math.multiply(3, 3)      // returns number 9
+   *
+   *    math.square([1, 2, 3, 4])  // returns Array [1, 4, 9, 16]
+   *
+   * See also:
+   *
+   *    multiply, cube, sqrt, pow
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            Number for which to calculate the square
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
+   *            Squared value
+   */
+  return typed(name, {
+    number: _index.squareNumber,
+    Complex: function Complex(x) {
+      return x.mul(x);
+    },
+    BigNumber: function BigNumber(x) {
+      return x.times(x);
+    },
+    Fraction: function Fraction(x) {
+      return x.mul(x);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since square(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    Unit: function Unit(x) {
+      return x.pow(2);
+    }
+  });
+});
+exports.createSquare = createSquare;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/subtract.js b/node_modules/mathjs/lib/cjs/function/arithmetic/subtract.js
new file mode 100644
index 0000000..e9c31bd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/subtract.js
@@ -0,0 +1,185 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubtract = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _DimensionError = require("../../error/DimensionError.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm01.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm05.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm10.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'subtract';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'addScalar', 'unaryMinus', 'DenseMatrix'];
+var createSubtract = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      addScalar = _ref.addScalar,
+      unaryMinus = _ref.unaryMinus,
+      DenseMatrix = _ref.DenseMatrix;
+  // TODO: split function subtract in two: subtract and subtractScalar
+  var algorithm01 = (0, _algorithm.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm03 = (0, _algorithm2.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm05 = (0, _algorithm3.createAlgorithm05)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm10 = (0, _algorithm4.createAlgorithm10)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm6.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Subtract two values, `x - y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.subtract(x, y)
+   *
+   * Examples:
+   *
+   *    math.subtract(5.3, 2)        // returns number 3.3
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.subtract(a, b)          // returns Complex -2 + 2i
+   *
+   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]
+   *
+   *    const c = math.unit('2.1 km')
+   *    const d = math.unit('500m')
+   *    math.subtract(c, d)          // returns Unit 1.6 km
+   *
+   * See also:
+   *
+   *    add
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x
+   *            Initial value
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y
+   *            Value to subtract from `x`
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Subtraction of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x - y;
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.sub(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.minus(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.sub(y);
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (x.value === null) {
+        throw new Error('Parameter x contains a unit with undefined value');
+      }
+
+      if (y.value === null) {
+        throw new Error('Parameter y contains a unit with undefined value');
+      }
+
+      if (!x.equalBase(y)) {
+        throw new Error('Units do not match');
+      }
+
+      var res = x.clone();
+      res.value = this(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm05(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm10(x, unaryMinus(y), addScalar);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm10(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+/**
+ * Check whether matrix x and y have the same number of dimensions.
+ * Throws a DimensionError when dimensions are not equal
+ * @param {Matrix} x
+ * @param {Matrix} y
+ */
+
+exports.createSubtract = createSubtract;
+
+function checkEqualDimensions(x, y) {
+  var xsize = x.size();
+  var ysize = y.size();
+
+  if (xsize.length !== ysize.length) {
+    throw new _DimensionError.DimensionError(xsize.length, ysize.length);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..30bd664
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryMinus.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnaryMinus = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'unaryMinus';
+var dependencies = ['typed'];
+var createUnaryMinus = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Inverse the sign of a value, apply a unary minus operation.
+   *
+   * For matrices, the function is evaluated element wise. Boolean values and
+   * strings will be converted to a number. For complex numbers, both real and
+   * complex value are inverted.
+   *
+   * Syntax:
+   *
+   *    math.unaryMinus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryMinus(3.5)      // returns -3.5
+   *    math.unaryMinus(-4.2)     // returns 4.2
+   *
+   * See also:
+   *
+   *    add, subtract, unaryPlus
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.
+   */
+  return typed(name, {
+    number: _index.unaryMinusNumber,
+    Complex: function Complex(x) {
+      return x.neg();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.neg();
+    },
+    Fraction: function Fraction(x) {
+      return x.neg();
+    },
+    Unit: function Unit(x) {
+      var res = x.clone();
+      res.value = this(x.value);
+      return res;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since unaryMinus(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    } // TODO: add support for string
+
+  });
+});
+exports.createUnaryMinus = createUnaryMinus;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..5af8136
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryPlus.js
@@ -0,0 +1,69 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnaryPlus = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'unaryPlus';
+var dependencies = ['typed', 'config', 'BigNumber'];
+var createUnaryPlus = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      BigNumber = _ref.BigNumber;
+
+  /**
+   * Unary plus operation.
+   * Boolean values and strings will be converted to a number, numeric values will be returned as is.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.unaryPlus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryPlus(3.5)      // returns 3.5
+   *    math.unaryPlus(1)     // returns 1
+   *
+   * See also:
+   *
+   *    unaryMinus, add, subtract
+   *
+   * @param  {number | BigNumber | Fraction | string | Complex | Unit | Array | Matrix} x
+   *            Input value
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns the input value when numeric, converts to a number when input is non-numeric.
+   */
+  return typed(name, {
+    number: _index.unaryPlusNumber,
+    Complex: function Complex(x) {
+      return x; // complex numbers are immutable
+    },
+    BigNumber: function BigNumber(x) {
+      return x; // bignumbers are immutable
+    },
+    Fraction: function Fraction(x) {
+      return x; // fractions are immutable
+    },
+    Unit: function Unit(x) {
+      return x.clone();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since unaryPlus(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    },
+    'boolean | string': function booleanString(x) {
+      // convert to a number or bignumber
+      return config.number === 'BigNumber' ? new BigNumber(+x) : +x;
+    }
+  });
+});
+exports.createUnaryPlus = createUnaryPlus;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/cjs/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..daa5767
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/xgcd.js
@@ -0,0 +1,102 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createXgcd = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'xgcd';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+var createXgcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the extended greatest common divisor for two values.
+   * See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+   *
+   * Syntax:
+   *
+   *    math.xgcd(a, b)
+   *
+   * Examples:
+   *
+   *    math.xgcd(8, 12)             // returns [4, -1, 1]
+   *    math.gcd(8, 12)              // returns 4
+   *    math.xgcd(36163, 21199)      // returns [1247, -7, 12]
+   *
+   * See also:
+   *
+   *    gcd, lcm
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {Array}              Returns an array containing 3 integers `[div, m, n]`
+   *                              where `div = gcd(a, b)` and `a*m + b*n = div`
+   */
+  return typed(name, {
+    'number, number': function numberNumber(a, b) {
+      var res = (0, _index.xgcdNumber)(a, b);
+      return config.matrix === 'Array' ? res : matrix(res);
+    },
+    'BigNumber, BigNumber': _xgcdBigNumber // TODO: implement support for Fraction
+
+  });
+  /**
+   * Calculate xgcd for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @return {BigNumber[]} result
+   * @private
+   */
+
+  function _xgcdBigNumber(a, b) {
+    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+    var // used to swap two variables
+    t;
+    var // quotient
+    q;
+    var // remainder
+    r;
+    var zero = new BigNumber(0);
+    var one = new BigNumber(1);
+    var x = zero;
+    var lastx = one;
+    var y = one;
+    var lasty = zero;
+
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function xgcd must be integer numbers');
+    }
+
+    while (!b.isZero()) {
+      q = a.div(b).floor();
+      r = a.mod(b);
+      t = x;
+      x = lastx.minus(q.times(x));
+      lastx = t;
+      t = y;
+      y = lasty.minus(q.times(y));
+      lasty = t;
+      a = b;
+      b = r;
+    }
+
+    var res;
+
+    if (a.lt(zero)) {
+      res = [a.neg(), lastx.neg(), lasty.neg()];
+    } else {
+      res = [a, !a.isZero() ? lastx : 0, lasty];
+    }
+
+    return config.matrix === 'Array' ? res : matrix(res);
+  }
+});
+exports.createXgcd = createXgcd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..fc4bde1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitAnd.js
@@ -0,0 +1,120 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitAnd = void 0;
+
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm06.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'bitAnd';
+var dependencies = ['typed', 'matrix', 'equalScalar'];
+var createBitAnd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar;
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm06 = (0, _algorithm5.createAlgorithm06)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm11 = (0, _algorithm2.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm3.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Bitwise AND two values, `x & y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitAnd(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitAnd(53, 131)               // returns number 1
+   *
+   *    math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]
+   *
+   * See also:
+   *
+   *    bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x First value to and
+   * @param  {number | BigNumber | Array | Matrix} y Second value to and
+   * @return {number | BigNumber | Array | Matrix} AND of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': _index.bitAndNumber,
+    'BigNumber, BigNumber': _bitwise.bitAndBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm06(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm11(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createBitAnd = createBitAnd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitNot.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitNot.js
new file mode 100644
index 0000000..882f397
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitNot.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitNot = void 0;
+
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'bitNot';
+var dependencies = ['typed'];
+var createBitNot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Bitwise NOT value, `~x`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.bitNot(x)
+   *
+   * Examples:
+   *
+   *    math.bitNot(1)               // returns number -2
+   *
+   *    math.bitNot([2, -3, 4])      // returns Array [-3, 2, 5]
+   *
+   * See also:
+   *
+   *    bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x Value to not
+   * @return {number | BigNumber | Array | Matrix} NOT of `x`
+   */
+  return typed(name, {
+    number: _index.bitNotNumber,
+    BigNumber: _bitwise.bitNotBigNumber,
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createBitNot = createBitNot;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitOr.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitOr.js
new file mode 100644
index 0000000..46d9bdd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitOr.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitOr = void 0;
+
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm10.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm04.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm01.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'bitOr';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+var createBitOr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm01 = (0, _algorithm5.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm04 = (0, _algorithm4.createAlgorithm04)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm10 = (0, _algorithm3.createAlgorithm10)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm2.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Bitwise OR two values, `x | y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the lowest print base.
+   *
+   * Syntax:
+   *
+   *    math.bitOr(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitOr(1, 2)               // returns number 3
+   *
+   *    math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x First value to or
+   * @param  {number | BigNumber | Array | Matrix} y Second value to or
+   * @return {number | BigNumber | Array | Matrix} OR of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': _index.bitOrNumber,
+    'BigNumber, BigNumber': _bitwise.bitOrBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm04(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm01(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm10(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm10(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createBitOr = createBitOr;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitXor.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitXor.js
new file mode 100644
index 0000000..6e65e20
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitXor.js
@@ -0,0 +1,119 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitXor = void 0;
+
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'bitXor';
+var dependencies = ['typed', 'matrix', 'DenseMatrix'];
+var createBitXor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Bitwise XOR two values, `x ^ y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitXor(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitXor(1, 2)               // returns number 3
+   *
+   *    math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x First value to xor
+   * @param  {number | BigNumber | Array | Matrix} y Second value to xor
+   * @return {number | BigNumber | Array | Matrix} XOR of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': _index.bitXorNumber,
+    'BigNumber, BigNumber': _bitwise.bitXor,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createBitXor = createBitXor;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/leftShift.js b/node_modules/mathjs/lib/cjs/function/bitwise/leftShift.js
new file mode 100644
index 0000000..15363e0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/leftShift.js
@@ -0,0 +1,154 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLeftShift = void 0;
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm01.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm10.js");
+
+var _algorithm7 = require("../../type/matrix/utils/algorithm08.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+
+var name = 'leftShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+var createLeftShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      zeros = _ref.zeros,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm01 = (0, _algorithm5.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm08 = (0, _algorithm7.createAlgorithm08)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm10 = (0, _algorithm6.createAlgorithm10)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm11 = (0, _algorithm2.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm3.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Bitwise left logical shift of a value x by y number of bits, `x << y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.leftShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.leftShift(1, 2)               // returns number 4
+   *
+   *    math.leftShift([1, 2, 3], 4)       // returns Array [16, 32, 64]
+   *
+   * See also:
+   *
+   *    leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber} y Amount of shifts
+   * @return {number | BigNumber | Array | Matrix} `x` shifted left `y` times
+   */
+
+  return typed(name, {
+    'number, number': _index.leftShiftNumber,
+    'BigNumber, BigNumber': _bitwise.leftShiftBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm08(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
+exports.createLeftShift = createLeftShift;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/cjs/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..79ea3c8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/rightArithShift.js
@@ -0,0 +1,154 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRightArithShift = void 0;
+
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm01.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm10.js");
+
+var _algorithm7 = require("../../type/matrix/utils/algorithm08.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'rightArithShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+var createRightArithShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      zeros = _ref.zeros,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm01 = (0, _algorithm5.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm08 = (0, _algorithm7.createAlgorithm08)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm10 = (0, _algorithm6.createAlgorithm10)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm11 = (0, _algorithm2.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm3.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightArithShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightArithShift(4, 2)               // returns number 1
+   *
+   *    math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 3]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber} y Amount of shifts
+   * @return {number | BigNumber | Array | Matrix} `x` sign-filled shifted right `y` times
+   */
+
+  return typed(name, {
+    'number, number': _index.rightArithShiftNumber,
+    'BigNumber, BigNumber': _bitwise.rightArithShiftBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm08(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
+exports.createRightArithShift = createRightArithShift;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/cjs/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..a4ce237
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/rightLogShift.js
@@ -0,0 +1,152 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRightLogShift = void 0;
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm01.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm10.js");
+
+var _algorithm7 = require("../../type/matrix/utils/algorithm08.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'rightLogShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+var createRightLogShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      zeros = _ref.zeros,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm01 = (0, _algorithm5.createAlgorithm01)({
+    typed: typed
+  });
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm08 = (0, _algorithm7.createAlgorithm08)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm10 = (0, _algorithm6.createAlgorithm10)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm11 = (0, _algorithm2.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm3.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Bitwise right logical shift of value x by y number of bits, `x >>> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightLogShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightLogShift(4, 2)               // returns number 1
+   *
+   *    math.rightLogShift([16, -32, 64], 4)   // returns Array [1, 2, 3]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift
+   *
+   * @param  {number | Array | Matrix} x Value to be shifted
+   * @param  {number} y Amount of shifts
+   * @return {number | Array | Matrix} `x` zero-filled shifted right `y` times
+   */
+
+  return typed(name, {
+    'number, number': _index.rightLogShiftNumber,
+    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm08(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
+exports.createRightLogShift = createRightLogShift;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/cjs/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..ded83b0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/bellNumbers.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBellNumbers = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'bellNumbers';
+var dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];
+var createBellNumbers = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      addScalar = _ref.addScalar,
+      isNegative = _ref.isNegative,
+      isInteger = _ref.isInteger,
+      stirlingS2 = _ref.stirlingS2;
+
+  /**
+   * The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.
+   * bellNumbers only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.bellNumbers(n)
+   *
+   * Examples:
+   *
+   *    math.bellNumbers(3) // returns 5
+   *    math.bellNumbers(8) // returns 4140
+   *
+   * See also:
+   *
+   *    stirlingS2
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @return {Number | BigNumber}     B(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function bellNumbers');
+      } // Sum (k=0, n) S(n,k).
+
+
+      var result = 0;
+
+      for (var i = 0; i <= n; i++) {
+        result = addScalar(result, stirlingS2(n, i));
+      }
+
+      return result;
+    }
+  });
+});
+exports.createBellNumbers = createBellNumbers;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/catalan.js b/node_modules/mathjs/lib/cjs/function/combinatorics/catalan.js
new file mode 100644
index 0000000..84fd57f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/catalan.js
@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCatalan = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'catalan';
+var dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];
+var createCatalan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      addScalar = _ref.addScalar,
+      divideScalar = _ref.divideScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      combinations = _ref.combinations,
+      isNegative = _ref.isNegative,
+      isInteger = _ref.isInteger;
+
+  /**
+   * The Catalan Numbers enumerate combinatorial structures of many different types.
+   * catalan only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.catalan(n)
+   *
+   * Examples:
+   *
+   *    math.catalan(3) // returns 5
+   *    math.catalan(8) // returns 1430
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    nth Catalan number
+   * @return {Number | BigNumber}     Cn(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function catalan');
+      }
+
+      return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1));
+    }
+  });
+});
+exports.createCatalan = createCatalan;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/composition.js b/node_modules/mathjs/lib/cjs/function/combinatorics/composition.js
new file mode 100644
index 0000000..4d1e06e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/composition.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComposition = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'composition';
+var dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];
+var createComposition = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      addScalar = _ref.addScalar,
+      combinations = _ref.combinations,
+      isPositive = _ref.isPositive,
+      isNegative = _ref.isNegative,
+      isInteger = _ref.isInteger,
+      larger = _ref.larger;
+
+  /**
+   * The composition counts of n into k parts.
+   *
+   * composition only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *   math.composition(n, k)
+   *
+   * Examples:
+   *
+   *    math.composition(5, 3) // returns 6
+   *
+   * See also:
+   *
+   *    combinations
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     Returns the composition counts of n into k parts.
+   */
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {
+      if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {
+        throw new TypeError('Positive integer value expected in function composition');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function composition');
+      }
+
+      return combinations(addScalar(n, -1), addScalar(k, -1));
+    }
+  });
+});
+exports.createComposition = createComposition;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/cjs/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..fc34475
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/stirlingS2.js
@@ -0,0 +1,102 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createStirlingS2 = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'stirlingS2';
+var dependencies = ['typed', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'number', '?bignumber', 'larger'];
+var createStirlingS2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      addScalar = _ref.addScalar,
+      subtract = _ref.subtract,
+      multiplyScalar = _ref.multiplyScalar,
+      divideScalar = _ref.divideScalar,
+      pow = _ref.pow,
+      factorial = _ref.factorial,
+      combinations = _ref.combinations,
+      isNegative = _ref.isNegative,
+      isInteger = _ref.isInteger,
+      number = _ref.number,
+      bignumber = _ref.bignumber,
+      larger = _ref.larger;
+  var smallCache = [];
+  var bigCache = [];
+  /**
+   * The Stirling numbers of the second kind, counts the number of ways to partition
+   * a set of n labelled objects into k nonempty unlabelled subsets.
+   * stirlingS2 only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   *  If n = k or k = 1 <= n, then s(n,k) = 1
+   *  If k = 0 < n, then s(n,k) = 0
+   *
+   * Note that if either n or k is supplied as a BigNumber, the result will be
+   * as well.
+   *
+   * Syntax:
+   *
+   *   math.stirlingS2(n, k)
+   *
+   * Examples:
+   *
+   *    math.stirlingS2(5, 3) //returns 25
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     S(n,k)
+   */
+
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {
+      if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {
+        throw new TypeError('Non-negative integer value expected in function stirlingS2');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function stirlingS2');
+      }
+
+      var big = !((0, _is.isNumber)(n) && (0, _is.isNumber)(k));
+      var cache = big ? bigCache : smallCache;
+      var make = big ? bignumber : number;
+      var nn = number(n);
+      var nk = number(k);
+      /* See if we already have the value: */
+
+      if (cache[nn] && cache[nn].length > nk) {
+        return cache[nn][nk];
+      }
+      /* Fill the cache */
+
+
+      for (var m = 0; m <= nn; ++m) {
+        if (!cache[m]) {
+          cache[m] = [m === 0 ? make(1) : make(0)];
+        }
+
+        if (m === 0) continue;
+        var row = cache[m];
+        var prev = cache[m - 1];
+
+        for (var i = row.length; i <= m && i <= nk; ++i) {
+          if (i === m) {
+            row[i] = 1;
+          } else {
+            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1]);
+          }
+        }
+      }
+
+      return cache[nn][nk];
+    }
+  });
+});
+exports.createStirlingS2 = createStirlingS2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/arg.js b/node_modules/mathjs/lib/cjs/function/complex/arg.js
new file mode 100644
index 0000000..9fbc019
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/arg.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createArg = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'arg';
+var dependencies = ['typed'];
+var createArg = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Compute the argument of a complex value.
+   * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.arg(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 2)
+   *    math.arg(a) / math.pi          // returns number 0.25
+   *
+   *    const b = math.complex('2 + 3i')
+   *    math.arg(b)                    // returns number 0.982793723247329
+   *    math.atan2(3, 2)               // returns number 0.982793723247329
+   *
+   * See also:
+   *
+   *    re, im, conj, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The argument of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return Math.atan2(0, x);
+    },
+    BigNumber: function BigNumber(x) {
+      return x.constructor.atan2(0, x);
+    },
+    Complex: function Complex(x) {
+      return x.arg();
+    },
+    // TODO: implement BigNumber support for function arg
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createArg = createArg;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/conj.js b/node_modules/mathjs/lib/cjs/function/complex/conj.js
new file mode 100644
index 0000000..31547bb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/conj.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConj = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'conj';
+var dependencies = ['typed'];
+var createConj = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Compute the complex conjugate of a complex value.
+   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.conj(x)
+   *
+   * Examples:
+   *
+   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i
+   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i
+   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i
+   *
+   * See also:
+   *
+   *    re, im, arg, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            The complex conjugate of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return x;
+    },
+    BigNumber: function BigNumber(x) {
+      return x;
+    },
+    Complex: function Complex(x) {
+      return x.conjugate();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createConj = createConj;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/im.js b/node_modules/mathjs/lib/cjs/function/complex/im.js
new file mode 100644
index 0000000..740deb7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/im.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIm = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'im';
+var dependencies = ['typed'];
+var createIm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Get the imaginary part of a complex number.
+   * For a complex number `a + bi`, the function returns `b`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.im(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number -5.2
+   *    math.re(math.complex(2.4))     // returns number 0
+   *
+   * See also:
+   *
+   *    re, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The imaginary part of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return 0;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.mul(0);
+    },
+    Fraction: function Fraction(x) {
+      return x.mul(0);
+    },
+    Complex: function Complex(x) {
+      return x.im;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createIm = createIm;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/re.js b/node_modules/mathjs/lib/cjs/function/complex/re.js
new file mode 100644
index 0000000..7d04037
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/re.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRe = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 're';
+var dependencies = ['typed'];
+var createRe = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Get the real part of a complex number.
+   * For a complex number `a + bi`, the function returns `a`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.re(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number 0
+   *    math.re(math.complex(2.4))     // returns number 2.4
+   *
+   * See also:
+   *
+   *    im, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The real part of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return x;
+    },
+    BigNumber: function BigNumber(x) {
+      return x;
+    },
+    Fraction: function Fraction(x) {
+      return x;
+    },
+    Complex: function Complex(x) {
+      return x.re;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createRe = createRe;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/geometry/distance.js b/node_modules/mathjs/lib/cjs/function/geometry/distance.js
new file mode 100644
index 0000000..055ed4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/geometry/distance.js
@@ -0,0 +1,360 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDistance = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'distance';
+var dependencies = ['typed', 'addScalar', 'subtract', 'divideScalar', 'multiplyScalar', 'unaryMinus', 'sqrt', 'abs'];
+var createDistance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      addScalar = _ref.addScalar,
+      subtract = _ref.subtract,
+      multiplyScalar = _ref.multiplyScalar,
+      divideScalar = _ref.divideScalar,
+      unaryMinus = _ref.unaryMinus,
+      sqrt = _ref.sqrt,
+      abs = _ref.abs;
+
+  /**
+    * Calculates:
+    *    The eucledian distance between two points in N-dimensional spaces.
+    *    Distance between point and a line in 2 and 3 dimensional spaces.
+    *    Pairwise distance between a set of 2D or 3D points
+    * NOTE:
+    *    When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c
+    *    For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)
+    *
+    * Syntax:
+    *    math.distance([x1, y1], [x2, y2])
+    *-   math.distance({pointOneX: 4, pointOneY: 5}, {pointTwoX: 2, pointTwoY: 7})
+    *    math.distance([x1, y1, z1], [x2, y2, z2])
+    *    math.distance({pointOneX: 4, pointOneY: 5, pointOneZ: 8}, {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})
+    *    math.distance([x1, y1, ... , N1], [x2, y2, ... , N2])
+    *    math.distance([[A], [B], [C]...])
+    *    math.distance([x1, y1], [LinePtX1, LinePtY1], [LinePtX2, LinePtY2])
+    *    math.distance({pointX: 1, pointY: 4}, {lineOnePtX: 6, lineOnePtY: 3}, {lineTwoPtX: 2, lineTwoPtY: 8})
+    *    math.distance([x1, y1, z1], [LinePtX1, LinePtY1, LinePtZ1], [LinePtX2, LinePtY2, LinePtZ2])
+    *    math.distance({pointX: 1, pointY: 4, pointZ: 7}, {lineOnePtX: 6, lineOnePtY: 3, lineOnePtZ: 4}, {lineTwoPtX: 2, lineTwoPtY: 8, lineTwoPtZ: 5})
+    *    math.distance([x1, y1], [xCoeffLine, yCoeffLine, constant])
+    *    math.distance({pointX: 10, pointY: 10}, {xCoeffLine: 8, yCoeffLine: 1, constant: 3})
+    *    math.distance([x1, y1, z1], [x0, y0, z0, a-tCoeff, b-tCoeff, c-tCoeff]) point and parametric equation of 3D line
+    *    math.distance([x, y, z], [x0, y0, z0, a, b, c])
+    *    math.distance({pointX: 2, pointY: 5, pointZ: 9}, {x0: 4, y0: 6, z0: 3, a: 4, b: 2, c: 0})
+    *
+    * Examples:
+    *    math.distance([0,0], [4,4])                     // Returns 5.6569
+    *    math.distance(
+    *     {pointOneX: 0, pointOneY: 0},
+    *     {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951
+    *    math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.74166
+    *    math.distance(
+    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},
+    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3
+    *    math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2
+    *    math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]
+    *    math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]
+    *    math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387
+    *    math.distance([10, 10], [2, 3], [-8, 0])        // Returns 8.759953130362847
+    *    math.distance(
+    *     {pointX: 1, pointY: 4},
+    *     {lineOnePtX: 6, lineOnePtY: 3},
+    *     {lineTwoPtX: 2, lineTwoPtY: 8})                // Returns 2.720549372624744
+    *    math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857
+    *    math.distance(
+    *     {pointX: 2, pointY: 3, pointZ: 1},
+    *     {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1}        // Returns 2.3204774044612857
+    *
+    * @param {Array | Matrix | Object} x    Co-ordinates of first point
+    * @param {Array | Matrix | Object} y    Co-ordinates of second point
+    * @return {Number | BigNumber} Returns the distance from two/three points
+  */
+  return typed(name, {
+    'Array, Array, Array': function ArrayArrayArray(x, y, z) {
+      // Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)
+      if (x.length === 2 && y.length === 2 && z.length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+
+        if (!_2d(y)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+        }
+
+        if (!_2d(z)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+        }
+
+        var m = divideScalar(subtract(z[1], z[0]), subtract(y[1], y[0]));
+        var xCoeff = multiplyScalar(multiplyScalar(m, m), y[0]);
+        var yCoeff = unaryMinus(multiplyScalar(m, y[0]));
+        var constant = x[1];
+        return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object, Object': function ObjectObjectObject(x, y, z) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+
+        if (!_2d(y)) {
+          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');
+        }
+
+        if (!_2d(z)) {
+          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');
+        }
+
+        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {
+          var m = divideScalar(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX));
+          var xCoeff = multiplyScalar(multiplyScalar(m, m), y.lineOnePtX);
+          var yCoeff = unaryMinus(multiplyScalar(m, y.lineOnePtX));
+          var constant = x.pointX;
+          return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])
+      if (x.length === 2 && y.length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+
+        if (!_3d(y)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+        }
+
+        return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2]);
+      } else if (x.length === 3 && y.length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+        }
+
+        if (!_parametricLine(y)) {
+          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument');
+        }
+
+        return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5]);
+      } else if (x.length === y.length && x.length > 0) {
+        // Point to Point N-dimensions
+        if (!_containsOnlyNumbers(x)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+
+        if (!_containsOnlyNumbers(y)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+
+        return _euclideanDistance(x, y);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object': function ObjectObject(x, y) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+
+        if (!_3d(y)) {
+          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');
+        }
+
+        if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {
+          return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers');
+        }
+
+        if (!_parametricLine(y)) {
+          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');
+        }
+
+        if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {
+          return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {
+        // Point to Point 2D
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers');
+        }
+
+        if (!_2d(y)) {
+          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');
+        }
+
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY], [y.pointTwoX, y.pointTwoY]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {
+        // Point to Point 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers');
+        }
+
+        if (!_3d(y)) {
+          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');
+        }
+
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY, x.pointOneZ], [y.pointTwoX, y.pointTwoY, y.pointTwoZ]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    Array: function Array(arr) {
+      if (!_pairwise(arr)) {
+        throw new TypeError('Incorrect array format entered for pairwise distance calculation');
+      }
+
+      return _distancePairwise(arr);
+    }
+  });
+
+  function _isNumber(a) {
+    // distance supports numbers and bignumbers
+    return typeof a === 'number' || (0, _is.isBigNumber)(a);
+  }
+
+  function _2d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+
+    return _isNumber(a[0]) && _isNumber(a[1]);
+  }
+
+  function _3d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]);
+  }
+
+  function _containsOnlyNumbers(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (!Array.isArray(a)) {
+      a = _objectToArray(a);
+    }
+
+    return a.every(_isNumber);
+  }
+
+  function _parametricLine(a) {
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);
+  }
+
+  function _objectToArray(o) {
+    var keys = Object.keys(o);
+    var a = [];
+
+    for (var i = 0; i < keys.length; i++) {
+      a.push(o[keys[i]]);
+    }
+
+    return a;
+  }
+
+  function _pairwise(a) {
+    // checks for valid arguments passed to _distancePairwise(Array)
+    if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {
+      if (a.some(function (aI) {
+        return aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]);
+      })) {
+        return false;
+      }
+    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {
+      if (a.some(function (aI) {
+        return aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]);
+      })) {
+        return false;
+      }
+    } else {
+      return false;
+    }
+
+    return true;
+  }
+
+  function _distancePointLine2D(x, y, a, b, c) {
+    var num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));
+    var den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)));
+    return divideScalar(num, den);
+  }
+
+  function _distancePointLine3D(x, y, z, x0, y0, z0, a, b, c) {
+    var num = [subtract(multiplyScalar(subtract(y0, y), c), multiplyScalar(subtract(z0, z), b)), subtract(multiplyScalar(subtract(z0, z), a), multiplyScalar(subtract(x0, x), c)), subtract(multiplyScalar(subtract(x0, x), b), multiplyScalar(subtract(y0, y), a))];
+    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));
+    var den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)));
+    return divideScalar(num, den);
+  }
+
+  function _euclideanDistance(x, y) {
+    var vectorSize = x.length;
+    var result = 0;
+    var diff = 0;
+
+    for (var i = 0; i < vectorSize; i++) {
+      diff = subtract(x[i], y[i]);
+      result = addScalar(multiplyScalar(diff, diff), result);
+    }
+
+    return sqrt(result);
+  }
+
+  function _distancePairwise(a) {
+    var result = [];
+    var pointA = [];
+    var pointB = [];
+
+    for (var i = 0; i < a.length - 1; i++) {
+      for (var j = i + 1; j < a.length; j++) {
+        if (a[0].length === 2) {
+          pointA = [a[i][0], a[i][1]];
+          pointB = [a[j][0], a[j][1]];
+        } else if (a[0].length === 3) {
+          pointA = [a[i][0], a[i][1], a[i][2]];
+          pointB = [a[j][0], a[j][1], a[j][2]];
+        }
+
+        result.push(_euclideanDistance(pointA, pointB));
+      }
+    }
+
+    return result;
+  }
+});
+exports.createDistance = createDistance;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/geometry/intersect.js b/node_modules/mathjs/lib/cjs/function/geometry/intersect.js
new file mode 100644
index 0000000..0596c83
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/geometry/intersect.js
@@ -0,0 +1,242 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIntersect = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'intersect';
+var dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'];
+var createIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      abs = _ref.abs,
+      add = _ref.add,
+      addScalar = _ref.addScalar,
+      matrix = _ref.matrix,
+      multiply = _ref.multiply,
+      multiplyScalar = _ref.multiplyScalar,
+      divideScalar = _ref.divideScalar,
+      subtract = _ref.subtract,
+      smaller = _ref.smaller,
+      equalScalar = _ref.equalScalar,
+      flatten = _ref.flatten,
+      isZero = _ref.isZero,
+      isNumeric = _ref.isNumeric;
+
+  /**
+   * Calculates the point of intersection of two lines in two or three dimensions
+   * and of a line and a plane in three dimensions. The inputs are in the form of
+   * arrays or 1 dimensional matrices. The line intersection functions return null
+   * if the lines do not meet.
+   *
+   * Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.
+   *
+   * Syntax:
+   *
+   *    math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)
+   *    math.intersect(endPoint1, endPoint2, planeCoefficients)
+   *
+   * Examples:
+   *
+   *    math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]
+   *    math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]
+   *    math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]
+   *
+   * @param  {Array | Matrix} w   Co-ordinates of first end-point of first line
+   * @param  {Array | Matrix} x   Co-ordinates of second end-point of first line
+   * @param  {Array | Matrix} y   Co-ordinates of first end-point of second line
+   *                              OR Co-efficients of the plane's equation
+   * @param  {Array | Matrix} z   Co-ordinates of second end-point of second line
+   *                              OR undefined if the calculation is for line and plane
+   * @return {Array}              Returns the point of intersection of lines/lines-planes
+   */
+  return typed('intersect', {
+    'Array, Array, Array': _AAA,
+    'Array, Array, Array, Array': _AAAA,
+    'Matrix, Matrix, Matrix': function MatrixMatrixMatrix(x, y, plane) {
+      var arr = _AAA(x.valueOf(), y.valueOf(), plane.valueOf());
+
+      return arr === null ? null : matrix(arr);
+    },
+    'Matrix, Matrix, Matrix, Matrix': function MatrixMatrixMatrixMatrix(w, x, y, z) {
+      // TODO: output matrix type should match input matrix type
+      var arr = _AAAA(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf());
+
+      return arr === null ? null : matrix(arr);
+    }
+  });
+
+  function _AAA(x, y, plane) {
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    plane = _coerceArr(plane);
+
+    if (!_3d(x)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+    }
+
+    if (!_3d(y)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+    }
+
+    if (!_4d(plane)) {
+      throw new TypeError('Array with 4 numbers expected as third argument');
+    }
+
+    return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3]);
+  }
+
+  function _AAAA(w, x, y, z) {
+    w = _coerceArr(w);
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    z = _coerceArr(z);
+
+    if (w.length === 2) {
+      if (!_2d(w)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+      }
+
+      if (!_2d(x)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+      }
+
+      if (!_2d(y)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+      }
+
+      if (!_2d(z)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');
+      }
+
+      return _intersect2d(w, x, y, z);
+    } else if (w.length === 3) {
+      if (!_3d(w)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+      }
+
+      if (!_3d(x)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+      }
+
+      if (!_3d(y)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');
+      }
+
+      if (!_3d(z)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');
+      }
+
+      return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2]);
+    } else {
+      throw new TypeError('Arrays with two or thee dimensional points expected');
+    }
+  }
+  /** Coerce row and column 2-dim arrays to 1-dim array */
+
+
+  function _coerceArr(arr) {
+    // row matrix
+    if (arr.length === 1) return arr[0]; // column matrix
+
+    if (arr.length > 1 && Array.isArray(arr[0])) {
+      if (arr.every(function (el) {
+        return Array.isArray(el) && el.length === 1;
+      })) return flatten(arr);
+    }
+
+    return arr;
+  }
+
+  function _2d(x) {
+    return x.length === 2 && isNumeric(x[0]) && isNumeric(x[1]);
+  }
+
+  function _3d(x) {
+    return x.length === 3 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]);
+  }
+
+  function _4d(x) {
+    return x.length === 4 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]) && isNumeric(x[3]);
+  }
+
+  function _intersect2d(p1a, p1b, p2a, p2b) {
+    var o1 = p1a;
+    var o2 = p2a;
+    var d1 = subtract(o1, p1b);
+    var d2 = subtract(o2, p2b);
+    var det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));
+    if (isZero(det)) return null;
+
+    if (smaller(abs(det), config.epsilon)) {
+      return null;
+    }
+
+    var d20o11 = multiplyScalar(d2[0], o1[1]);
+    var d21o10 = multiplyScalar(d2[1], o1[0]);
+    var d20o21 = multiplyScalar(d2[0], o2[1]);
+    var d21o20 = multiplyScalar(d2[1], o2[0]);
+    var t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det);
+    return add(multiply(d1, t), o1);
+  }
+
+  function _intersect3dHelper(a, b, c, d, e, f, g, h, i, j, k, l) {
+    // (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)
+    var add1 = multiplyScalar(subtract(a, b), subtract(c, d));
+    var add2 = multiplyScalar(subtract(e, f), subtract(g, h));
+    var add3 = multiplyScalar(subtract(i, j), subtract(k, l));
+    return addScalar(addScalar(add1, add2), add3);
+  }
+
+  function _intersect3d(x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {
+    var d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);
+
+    var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);
+
+    var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);
+
+    var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);
+
+    var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);
+
+    var numerator = subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343));
+    var denominator = subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321));
+    if (isZero(denominator)) return null;
+    var ta = divideScalar(numerator, denominator);
+    var tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);
+    var pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));
+    var pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));
+    var paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));
+    var pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));
+    var pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));
+    var pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));
+
+    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {
+      return [pax, pay, paz];
+    } else {
+      return null;
+    }
+  }
+
+  function _intersectLinePlane(x1, y1, z1, x2, y2, z2, x, y, z, c) {
+    var x1x = multiplyScalar(x1, x);
+    var x2x = multiplyScalar(x2, x);
+    var y1y = multiplyScalar(y1, y);
+    var y2y = multiplyScalar(y2, y);
+    var z1z = multiplyScalar(z1, z);
+    var z2z = multiplyScalar(z2, z);
+    var numerator = subtract(subtract(subtract(c, x1x), y1y), z1z);
+    var denominator = subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z);
+    var t = divideScalar(numerator, denominator);
+    var px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));
+    var py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));
+    var pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));
+    return [px, py, pz]; // TODO: Add cases when line is parallel to the plane:
+    //       (a) no intersection,
+    //       (b) line contained in plane
+  }
+});
+exports.createIntersect = createIntersect;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/and.js b/node_modules/mathjs/lib/cjs/function/logical/and.js
new file mode 100644
index 0000000..c0110b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/and.js
@@ -0,0 +1,158 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAnd = void 0;
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm06.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'and';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not'];
+var createAnd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      zeros = _ref.zeros,
+      not = _ref.not;
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm06 = (0, _algorithm5.createAlgorithm06)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm11 = (0, _algorithm2.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm13 = (0, _algorithm3.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.and(x, y)
+   *
+   * Examples:
+   *
+   *    math.and(2, 4)   // returns true
+   *
+   *    a = [2, 0, 0]
+   *    b = [3, 7, 0]
+   *    c = 0
+   *
+   *    math.and(a, b)   // returns [true, false, false]
+   *    math.and(a, c)   // returns [false, false, false]
+   *
+   * See also:
+   *
+   *    not, or, xor
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when both inputs are defined with a nonzero/nonempty value.
+   */
+
+  return typed(name, {
+    'number, number': _index.andNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return this(x.value || 0, y.value || 0);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm06(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm11(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
+exports.createAnd = createAnd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/not.js b/node_modules/mathjs/lib/cjs/function/logical/not.js
new file mode 100644
index 0000000..985c6ed
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/not.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNot = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'not';
+var dependencies = ['typed'];
+var createNot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Logical `not`. Flips boolean value of a given parameter.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.not(x)
+   *
+   * Examples:
+   *
+   *    math.not(2)      // returns false
+   *    math.not(0)      // returns true
+   *    math.not(true)   // returns false
+   *
+   *    a = [2, -7, 0]
+   *    math.not(a)      // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    and, or, xor
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when input is a zero or empty value.
+   */
+  return typed(name, {
+    number: _index.notNumber,
+    Complex: function Complex(x) {
+      return x.re === 0 && x.im === 0;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.isZero() || x.isNaN();
+    },
+    Unit: function Unit(x) {
+      return x.value !== null ? this(x.value) : true;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createNot = createNot;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/or.js b/node_modules/mathjs/lib/cjs/function/logical/or.js
new file mode 100644
index 0000000..6d0300d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/or.js
@@ -0,0 +1,132 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOr = void 0;
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm05.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'or';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+var createOr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm05 = (0, _algorithm5.createAlgorithm05)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm12 = (0, _algorithm2.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm3.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.or(x, y)
+   *
+   * Examples:
+   *
+   *    math.or(2, 4)   // returns true
+   *
+   *    a = [2, 5, 0]
+   *    b = [0, 22, 0]
+   *    c = 0
+   *
+   *    math.or(a, b)   // returns [true, true, false]
+   *    math.or(b, c)   // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    and, not, xor
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one of the inputs is defined with a nonzero/nonempty value.
+   */
+
+  return typed(name, {
+    'number, number': _index.orNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return this(x.value || 0, y.value || 0);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm05(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createOr = createOr;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/xor.js b/node_modules/mathjs/lib/cjs/function/logical/xor.js
new file mode 100644
index 0000000..328e67a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/xor.js
@@ -0,0 +1,131 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createXor = void 0;
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'xor';
+var dependencies = ['typed', 'matrix', 'DenseMatrix'];
+var createXor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.xor(x, y)
+   *
+   * Examples:
+   *
+   *    math.xor(2, 4)   // returns false
+   *
+   *    a = [2, 0, 0]
+   *    b = [2, 7, 0]
+   *    c = 0
+   *
+   *    math.xor(a, b)   // returns [false, true, false]
+   *    math.xor(a, c)   // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    and, not, or
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one and only one input is defined with a nonzero/nonempty value.
+   */
+
+  return typed(name, {
+    'number, number': _index.xorNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return this(x.value || 0, y.value || 0);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createXor = createXor;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/apply.js b/node_modules/mathjs/lib/cjs/function/matrix/apply.js
new file mode 100644
index 0000000..186b58f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/apply.js
@@ -0,0 +1,136 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createApply = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _array = require("../../utils/array.js");
+
+var _is = require("../../utils/is.js");
+
+var _IndexError = require("../../error/IndexError.js");
+
+var name = 'apply';
+var dependencies = ['typed', 'isInteger'];
+var createApply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      isInteger = _ref.isInteger;
+
+  /**
+   * Apply a function that maps an array to a scalar
+   * along a given axis of a matrix or array.
+   * Returns a new matrix or array with one less dimension than the input.
+   *
+   * Syntax:
+   *
+   *     math.apply(A, dim, callback)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [3, 4]]
+   *    const sum = math.sum
+   *
+   *    math.apply(A, 0, sum)             // returns [4, 6]
+   *    math.apply(A, 1, sum)             // returns [3, 7]
+   *
+   * See also:
+   *
+   *    map, filter, forEach
+   *
+   * @param {Array | Matrix} array   The input Matrix
+   * @param {number} dim             The dimension along which the callback is applied
+   * @param {Function} callback      The callback function that is applied. This Function
+   *                                 should take an array or 1-d matrix as an input and
+   *                                 return a number.
+   * @return {Array | Matrix} res    The residual matrix with the function applied over some dimension.
+   */
+  return typed(name, {
+    'Array | Matrix, number | BigNumber, function': function ArrayMatrixNumberBigNumberFunction(mat, dim, callback) {
+      if (!isInteger(dim)) {
+        throw new TypeError('Integer number expected for dimension');
+      }
+
+      var size = Array.isArray(mat) ? (0, _array.arraySize)(mat) : mat.size();
+
+      if (dim < 0 || dim >= size.length) {
+        throw new _IndexError.IndexError(dim, size.length);
+      }
+
+      if ((0, _is.isMatrix)(mat)) {
+        return mat.create(_apply(mat.valueOf(), dim, callback));
+      } else {
+        return _apply(mat, dim, callback);
+      }
+    }
+  });
+});
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+
+exports.createApply = createApply;
+
+function _apply(mat, dim, callback) {
+  var i, ret, tran;
+
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      return callback(mat);
+    } else {
+      tran = _switch(mat);
+      ret = [];
+
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _apply(tran[i], dim - 1, callback);
+      }
+
+      return ret;
+    }
+  } else {
+    ret = [];
+
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _apply(mat[i], dim - 1, callback);
+    }
+
+    return ret;
+  }
+}
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+
+
+function _switch(mat) {
+  var I = mat.length;
+  var J = mat[0].length;
+  var i, j;
+  var ret = [];
+
+  for (j = 0; j < J; j++) {
+    var tmp = [];
+
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+
+    ret.push(tmp);
+  }
+
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/column.js b/node_modules/mathjs/lib/cjs/function/matrix/column.js
new file mode 100644
index 0000000..831e56a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/column.js
@@ -0,0 +1,68 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createColumn = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var name = 'column';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+var createColumn = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Index = _ref.Index,
+      matrix = _ref.matrix,
+      range = _ref.range;
+
+  /**
+   * Return a column from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.column(value, index)
+   *
+   * Example:
+   *
+   *     // get a column
+   *     const d = [[1, 2], [3, 4]]
+   *     math.column(d, 1) // returns [[2], [4]]
+   *
+   * See also:
+   *
+   *     row
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} column           The index of the column
+   * @return {Array | Matrix}         The retrieved column
+   */
+  return typed(name, {
+    'Matrix, number': _column,
+    'Array, number': function ArrayNumber(value, column) {
+      return _column(matrix((0, _object.clone)(value)), column).valueOf();
+    }
+  });
+  /**
+   * Retrieve a column of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} column  The index of the column
+   * @return {Matrix}        The retrieved column
+   */
+
+  function _column(value, column) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+
+    (0, _array.validateIndex)(column, value.size()[1]);
+    var rowRange = range(0, value.size()[0]);
+    var index = new Index(rowRange, column);
+    return value.subset(index);
+  }
+});
+exports.createColumn = createColumn;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/concat.js b/node_modules/mathjs/lib/cjs/function/matrix/concat.js
new file mode 100644
index 0000000..a7144db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/concat.js
@@ -0,0 +1,153 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConcat = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _IndexError = require("../../error/IndexError.js");
+
+var _DimensionError = require("../../error/DimensionError.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'concat';
+var dependencies = ['typed', 'matrix', 'isInteger'];
+var createConcat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      isInteger = _ref.isInteger;
+
+  /**
+   * Concatenate two or more matrices.
+   *
+   * Syntax:
+   *
+   *     math.concat(A, B, C, ...)
+   *     math.concat(A, B, C, ..., dim)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *   By default the last dimension of the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [5, 6]]
+   *    const B = [[3, 4], [7, 8]]
+   *
+   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]
+   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]
+   *    math.concat('hello', ' ', 'world') // returns 'hello world'
+   *
+   * See also:
+   *
+   *    size, squeeze, subset, transpose
+   *
+   * @param {... Array | Matrix} args     Two or more matrices
+   * @return {Array | Matrix} Concatenated matrix
+   */
+  return typed(name, {
+    // TODO: change signature to '...Array | Matrix, dim?' when supported
+    '...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumber(args) {
+      var i;
+      var len = args.length;
+      var dim = -1; // zero-based dimension
+
+      var prevDim;
+      var asMatrix = false;
+      var matrices = []; // contains multi dimensional arrays
+
+      for (i = 0; i < len; i++) {
+        var arg = args[i]; // test whether we need to return a Matrix (if not we return an Array)
+
+        if ((0, _is.isMatrix)(arg)) {
+          asMatrix = true;
+        }
+
+        if ((0, _is.isNumber)(arg) || (0, _is.isBigNumber)(arg)) {
+          if (i !== len - 1) {
+            throw new Error('Dimension must be specified as last argument');
+          } // last argument contains the dimension on which to concatenate
+
+
+          prevDim = dim;
+          dim = arg.valueOf(); // change BigNumber to number
+
+          if (!isInteger(dim)) {
+            throw new TypeError('Integer number expected for dimension');
+          }
+
+          if (dim < 0 || i > 0 && dim > prevDim) {
+            // TODO: would be more clear when throwing a DimensionError here
+            throw new _IndexError.IndexError(dim, prevDim + 1);
+          }
+        } else {
+          // this is a matrix or array
+          var m = (0, _object.clone)(arg).valueOf();
+          var size = (0, _array.arraySize)(m);
+          matrices[i] = m;
+          prevDim = dim;
+          dim = size.length - 1; // verify whether each of the matrices has the same number of dimensions
+
+          if (i > 0 && dim !== prevDim) {
+            throw new _DimensionError.DimensionError(prevDim + 1, dim + 1);
+          }
+        }
+      }
+
+      if (matrices.length === 0) {
+        throw new SyntaxError('At least one matrix expected');
+      }
+
+      var res = matrices.shift();
+
+      while (matrices.length) {
+        res = _concat(res, matrices.shift(), dim, 0);
+      }
+
+      return asMatrix ? matrix(res) : res;
+    },
+    '...string': function string(args) {
+      return args.join('');
+    }
+  });
+});
+/**
+ * Recursively concatenate two matrices.
+ * The contents of the matrices is not cloned.
+ * @param {Array} a             Multi dimensional array
+ * @param {Array} b             Multi dimensional array
+ * @param {number} concatDim    The dimension on which to concatenate (zero-based)
+ * @param {number} dim          The current dim (zero-based)
+ * @return {Array} c            The concatenated matrix
+ * @private
+ */
+
+exports.createConcat = createConcat;
+
+function _concat(a, b, concatDim, dim) {
+  if (dim < concatDim) {
+    // recurse into next dimension
+    if (a.length !== b.length) {
+      throw new _DimensionError.DimensionError(a.length, b.length);
+    }
+
+    var c = [];
+
+    for (var i = 0; i < a.length; i++) {
+      c[i] = _concat(a[i], b[i], concatDim, dim + 1);
+    }
+
+    return c;
+  } else {
+    // concatenate this dimension
+    return a.concat(b);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/count.js b/node_modules/mathjs/lib/cjs/function/matrix/count.js
new file mode 100644
index 0000000..82d291b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/count.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCount = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'count';
+var dependencies = ['typed', 'size', 'prod'];
+var createCount = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      prod = _ref.prod;
+
+  /**
+   * Count the number of elements of a matrix, array or string.
+   *
+   * Syntax:
+   *
+   *     math.count(x)
+   *
+   * Examples:
+   *
+   *     math.count('hello world')        // returns 11
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.count(A)                    // returns 6
+   *     math.count(math.range(1,6))      // returns 5
+   *
+   * See also:
+   *
+   *     size
+   *
+   * @param {string | Array | Matrix} x  A matrix or string
+   * @return {number} An integer with the elements in `x`.
+   */
+  return typed(name, {
+    string: function string(x) {
+      return x.length;
+    },
+    'Matrix | Array': function MatrixArray(x) {
+      return prod(size(x));
+    }
+  });
+});
+exports.createCount = createCount;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/cross.js b/node_modules/mathjs/lib/cjs/function/matrix/cross.js
new file mode 100644
index 0000000..aa1d486
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/cross.js
@@ -0,0 +1,93 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCross = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'cross';
+var dependencies = ['typed', 'matrix', 'subtract', 'multiply'];
+var createCross = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply;
+
+  /**
+   * Calculate the cross product for two vectors in three dimensional space.
+   * The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined
+   * as:
+   *
+   *    cross(A, B) = [
+   *      a2 * b3 - a3 * b2,
+   *      a3 * b1 - a1 * b3,
+   *      a1 * b2 - a2 * b1
+   *    ]
+   *
+   * If one of the input vectors has a dimension greater than 1, the output
+   * vector will be a 1x3 (2-dimensional) matrix.
+   *
+   * Syntax:
+   *
+   *    math.cross(x, y)
+   *
+   * Examples:
+   *
+   *    math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]
+   *    math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]
+   *    math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]
+   *    math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]
+   *
+   * See also:
+   *
+   *    dot, multiply
+   *
+   * @param  {Array | Matrix} x   First vector
+   * @param  {Array | Matrix} y   Second vector
+   * @return {Array | Matrix}     Returns the cross product of `x` and `y`
+   */
+  return typed(name, {
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      return matrix(_cross(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      return matrix(_cross(x.toArray(), y));
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      return matrix(_cross(x, y.toArray()));
+    },
+    'Array, Array': _cross
+  });
+  /**
+   * Calculate the cross product for two arrays
+   * @param {Array} x  First vector
+   * @param {Array} y  Second vector
+   * @returns {Array} Returns the cross product of x and y
+   * @private
+   */
+
+  function _cross(x, y) {
+    var highestDimension = Math.max((0, _array.arraySize)(x).length, (0, _array.arraySize)(y).length);
+    x = (0, _array.squeeze)(x);
+    y = (0, _array.squeeze)(y);
+    var xSize = (0, _array.arraySize)(x);
+    var ySize = (0, _array.arraySize)(y);
+
+    if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {
+      throw new RangeError('Vectors with length 3 expected ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');
+    }
+
+    var product = [subtract(multiply(x[1], y[2]), multiply(x[2], y[1])), subtract(multiply(x[2], y[0]), multiply(x[0], y[2])), subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))];
+
+    if (highestDimension > 1) {
+      return [product];
+    } else {
+      return product;
+    }
+  }
+});
+exports.createCross = createCross;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/ctranspose.js b/node_modules/mathjs/lib/cjs/function/matrix/ctranspose.js
new file mode 100644
index 0000000..48114b5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/ctranspose.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCtranspose = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ctranspose';
+var dependencies = ['typed', 'transpose', 'conj'];
+var createCtranspose = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      transpose = _ref.transpose,
+      conj = _ref.conj;
+
+  /**
+   * Transpose and complex conjugate a matrix. All values of the matrix are
+   * reflected over its main diagonal and then the complex conjugate is
+   * taken. This is equivalent to complex conjugation for scalars and
+   * vectors.
+   *
+   * Syntax:
+   *
+   *     math.ctranspose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]
+   *     math.ctranspose(A)               // returns [[1, 4], [2, 5], [3, {re:6,im:7}]]
+   *
+   * See also:
+   *
+   *     transpose, diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be ctransposed
+   * @return {Array | Matrix}   The ctransposed matrix
+   */
+  return typed(name, {
+    any: function any(x) {
+      return conj(transpose(x));
+    }
+  });
+});
+exports.createCtranspose = createCtranspose;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/det.js b/node_modules/mathjs/lib/cjs/function/matrix/det.js
new file mode 100644
index 0000000..9349dde
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/det.js
@@ -0,0 +1,157 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDet = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _object = require("../../utils/object.js");
+
+var _string = require("../../utils/string.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'det';
+var dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];
+var createDet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply,
+      unaryMinus = _ref.unaryMinus,
+      lup = _ref.lup;
+
+  /**
+   * Calculate the determinant of a matrix.
+   *
+   * Syntax:
+   *
+   *    math.det(x)
+   *
+   * Examples:
+   *
+   *    math.det([[1, 2], [3, 4]]) // returns -2
+   *
+   *    const A = [
+   *      [-2, 2, 3],
+   *      [-1, 1, 3],
+   *      [2, 0, -1]
+   *    ]
+   *    math.det(A) // returns 6
+   *
+   * See also:
+   *
+   *    inv
+   *
+   * @param {Array | Matrix} x  A matrix
+   * @return {number} The determinant of `x`
+   */
+  return typed(name, {
+    any: function any(x) {
+      return (0, _object.clone)(x);
+    },
+    'Array | Matrix': function det(x) {
+      var size;
+
+      if ((0, _is.isMatrix)(x)) {
+        size = x.size();
+      } else if (Array.isArray(x)) {
+        x = matrix(x);
+        size = x.size();
+      } else {
+        // a scalar
+        size = [];
+      }
+
+      switch (size.length) {
+        case 0:
+          // scalar
+          return (0, _object.clone)(x);
+
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            return (0, _object.clone)(x.valueOf()[0]);
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+          }
+
+        case 2:
+          {
+            // two dimensional array
+            var rows = size[0];
+            var cols = size[1];
+
+            if (rows === cols) {
+              return _det(x.clone().valueOf(), rows, cols);
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+            }
+          }
+
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    }
+  });
+  /**
+   * Calculate the determinant of a matrix
+   * @param {Array[]} matrix  A square, two dimensional matrix
+   * @param {number} rows     Number of rows of the matrix (zero-based)
+   * @param {number} cols     Number of columns of the matrix (zero-based)
+   * @returns {number} det
+   * @private
+   */
+
+  function _det(matrix, rows, cols) {
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      return (0, _object.clone)(matrix[0][0]);
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12
+      return subtract(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));
+    } else {
+      // Compute the LU decomposition
+      var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)
+
+      var det = decomp.U[0][0];
+
+      for (var _i = 1; _i < rows; _i++) {
+        det = multiply(det, decomp.U[_i][_i]);
+      } // The determinant will be multiplied by 1 or -1 depending on the parity of the permutation matrix.
+      // This can be determined by counting the cycles. This is roughly a linear time algorithm.
+
+
+      var evenCycles = 0;
+      var i = 0;
+      var visited = [];
+
+      while (true) {
+        while (visited[i]) {
+          i++;
+        }
+
+        if (i >= rows) break;
+        var j = i;
+        var cycleLen = 0;
+
+        while (!visited[decomp.p[j]]) {
+          visited[decomp.p[j]] = true;
+          j = decomp.p[j];
+          cycleLen++;
+        }
+
+        if (cycleLen % 2 === 0) {
+          evenCycles++;
+        }
+      }
+
+      return evenCycles % 2 === 0 ? det : unaryMinus(det);
+    }
+  }
+});
+exports.createDet = createDet;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/diag.js b/node_modules/mathjs/lib/cjs/function/matrix/diag.js
new file mode 100644
index 0000000..ae20558
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/diag.js
@@ -0,0 +1,174 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDiag = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'diag';
+var dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];
+var createDiag = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix,
+      SparseMatrix = _ref.SparseMatrix;
+
+  /**
+   * Create a diagonal matrix or retrieve the diagonal of a matrix
+   *
+   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.
+   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.
+   * When k is positive, the values are placed on the super diagonal.
+   * When k is negative, the values are placed on the sub diagonal.
+   *
+   * Syntax:
+   *
+   *     math.diag(X)
+   *     math.diag(X, format)
+   *     math.diag(X, k)
+   *     math.diag(X, k, format)
+   *
+   * Examples:
+   *
+   *     // create a diagonal matrix
+   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]
+   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *
+   *    // retrieve the diagonal from a matrix
+   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
+   *    math.diag(a)   // returns [1, 5, 9]
+   *
+   * See also:
+   *
+   *     ones, zeros, identity
+   *
+   * @param {Matrix | Array} x          A two dimensional matrix or a vector
+   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled
+   *                                    in or retrieved.
+   * @param {string} [format='dense']   The matrix storage format.
+   *
+   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.
+   */
+  return typed(name, {
+    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments
+    Array: function Array(x) {
+      return _diag(x, 0, (0, _array.arraySize)(x), null);
+    },
+    'Array, number': function ArrayNumber(x, k) {
+      return _diag(x, k, (0, _array.arraySize)(x), null);
+    },
+    'Array, BigNumber': function ArrayBigNumber(x, k) {
+      return _diag(x, k.toNumber(), (0, _array.arraySize)(x), null);
+    },
+    'Array, string': function ArrayString(x, format) {
+      return _diag(x, 0, (0, _array.arraySize)(x), format);
+    },
+    'Array, number, string': function ArrayNumberString(x, k, format) {
+      return _diag(x, k, (0, _array.arraySize)(x), format);
+    },
+    'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {
+      return _diag(x, k.toNumber(), (0, _array.arraySize)(x), format);
+    },
+    Matrix: function Matrix(x) {
+      return _diag(x, 0, x.size(), x.storage());
+    },
+    'Matrix, number': function MatrixNumber(x, k) {
+      return _diag(x, k, x.size(), x.storage());
+    },
+    'Matrix, BigNumber': function MatrixBigNumber(x, k) {
+      return _diag(x, k.toNumber(), x.size(), x.storage());
+    },
+    'Matrix, string': function MatrixString(x, format) {
+      return _diag(x, 0, x.size(), format);
+    },
+    'Matrix, number, string': function MatrixNumberString(x, k, format) {
+      return _diag(x, k, x.size(), format);
+    },
+    'Matrix, BigNumber, string': function MatrixBigNumberString(x, k, format) {
+      return _diag(x, k.toNumber(), x.size(), format);
+    }
+  });
+  /**
+   * Creeate diagonal matrix from a vector or vice versa
+   * @param {Array | Matrix} x
+   * @param {number} k
+   * @param {string} format Storage format for matrix. If null,
+   *                          an Array is returned
+   * @returns {Array | Matrix}
+   * @private
+   */
+
+  function _diag(x, k, size, format) {
+    if (!(0, _number.isInteger)(k)) {
+      throw new TypeError('Second parameter in function diag must be an integer');
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // check dimensions
+
+    switch (size.length) {
+      case 1:
+        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);
+
+      case 2:
+        return _getDiagonal(x, k, format, size, kSub, kSuper);
+    }
+
+    throw new RangeError('Matrix for function diag must be 2 dimensional');
+  }
+
+  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {
+    // matrix size
+    var ms = [l + kSub, l + kSuper];
+
+    if (format && format !== 'sparse' && format !== 'dense') {
+      throw new TypeError("Unknown matrix type ".concat(format, "\""));
+    } // create diagonal matrix
+
+
+    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k); // check we need to return a matrix
+
+    return format !== null ? m : m.valueOf();
+  }
+
+  function _getDiagonal(x, k, format, s, kSub, kSuper) {
+    // check x is a Matrix
+    if ((0, _is.isMatrix)(x)) {
+      // get diagonal matrix
+      var dm = x.diagonal(k); // check we need to return a matrix
+
+      if (format !== null) {
+        // check we need to change matrix format
+        if (format !== dm.storage()) {
+          return matrix(dm, format);
+        }
+
+        return dm;
+      }
+
+      return dm.valueOf();
+    } // vector size
+
+
+    var n = Math.min(s[0] - kSub, s[1] - kSuper); // diagonal values
+
+    var vector = []; // loop diagonal
+
+    for (var i = 0; i < n; i++) {
+      vector[i] = x[i + kSub][i + kSuper];
+    } // check we need to return a matrix
+
+
+    return format !== null ? matrix(vector) : vector;
+  }
+});
+exports.createDiag = createDiag;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/diff.js b/node_modules/mathjs/lib/cjs/function/matrix/diff.js
new file mode 100644
index 0000000..d18f43e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/diff.js
@@ -0,0 +1,192 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDiff = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _number = require("../../utils/number.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'diff';
+var dependencies = ['typed', 'matrix', 'subtract', 'number'];
+var createDiff = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      subtract = _ref.subtract,
+      number = _ref.number;
+
+  /**
+   * Create a new matrix or array of the difference between elements of the given array
+   * The optional dim parameter lets you specify the dimension to evaluate the difference of
+   * If no dimension parameter is passed it is assumed as dimension 0
+   *
+   * Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber
+   * Arrays must be 'rectangular' meaning arrays like [1, 2]
+   * If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays
+   *
+   * Syntax:
+   *
+   *     math.diff(arr)
+   *     math.diff(arr, dim)
+   *
+   * Examples:
+   *
+   *     const arr = [1, 2, 4, 7, 0]
+   *     math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)
+   *     math.diff(math.matrix(arr)) // returns math.matrix([1, 2, 3, -7])
+   *
+   *     const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]
+   *     math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *     math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *
+   *     math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3
+   *     math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed
+   *
+   *     // These will all produce the same result
+   *     math.diff([[1, 2], [3, 4]])
+   *     math.diff([math.matrix([1, 2]), math.matrix([3, 4])])
+   *     math.diff([[1, 2], math.matrix([3, 4])])
+   *     math.diff([math.matrix([1, 2]), [3, 4]])
+   *     // They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix
+   *
+   * See Also:
+   *
+   *      sum
+   *      subtract
+   *      partitionSelect
+   *
+   * @param {Array | Matrix} arr    An array or matrix
+   * @param {number} dim            Dimension
+   * @return {Array | Matrix}       Difference between array elements in given dimension
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(arr) {
+      // No dimension specified => assume dimension 0
+      if ((0, _is.isMatrix)(arr)) {
+        return matrix(_diff(arr.toArray()));
+      } else {
+        return _diff(arr);
+      }
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(arr, dim) {
+      if (!(0, _number.isInteger)(dim)) throw new RangeError('Dimension must be a whole number');
+
+      if ((0, _is.isMatrix)(arr)) {
+        return matrix(_recursive(arr.toArray(), dim));
+      } else {
+        return _recursive(arr, dim);
+      }
+    },
+    'Array | Matrix, BigNumber': function ArrayMatrixBigNumber(arr, dim) {
+      return this(arr, number(dim));
+    }
+  });
+  /**
+   * Recursively find the correct dimension in the array/matrix
+   * Then Apply _diff to that dimension
+   *
+   * @param {Array} arr      The array
+   * @param {number} dim     Dimension
+   * @return {Array}         resulting array
+   */
+
+  function _recursive(arr, dim) {
+    if ((0, _is.isMatrix)(arr)) {
+      arr = arr.toArray(); // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly
+    }
+
+    if (!Array.isArray(arr)) {
+      throw RangeError('Array/Matrix does not have that many dimensions');
+    }
+
+    if (dim > 0) {
+      var result = [];
+      arr.forEach(function (element) {
+        result.push(_recursive(element, dim - 1));
+      });
+      return result;
+    } else if (dim === 0) {
+      return _diff(arr);
+    } else {
+      throw RangeError('Cannot have negative dimension');
+    }
+  }
+  /**
+   * Difference between elements in the array
+   *
+   * @param {Array} arr      An array
+   * @return {Array}         resulting array
+   */
+
+
+  function _diff(arr) {
+    var result = [];
+    var size = arr.length;
+
+    if (size < 2) {
+      return arr;
+    }
+
+    for (var i = 1; i < size; i++) {
+      result.push(_ElementDiff(arr[i - 1], arr[i]));
+    }
+
+    return result;
+  }
+  /**
+   * Difference between 2 objects
+   *
+   * @param {Object} obj1    First object
+   * @param {Object} obj2    Second object
+   * @return {Array}         resulting array
+   */
+
+
+  function _ElementDiff(obj1, obj2) {
+    // Convert matrices to arrays
+    if ((0, _is.isMatrix)(obj1)) obj1 = obj1.toArray();
+    if ((0, _is.isMatrix)(obj2)) obj2 = obj2.toArray();
+    var obj1IsArray = Array.isArray(obj1);
+    var obj2IsArray = Array.isArray(obj2);
+
+    if (obj1IsArray && obj2IsArray) {
+      return _ArrayDiff(obj1, obj2);
+    }
+
+    if (!obj1IsArray && !obj2IsArray) {
+      return subtract(obj2, obj1); // Difference is (second - first) NOT (first - second)
+    }
+
+    throw TypeError('Cannot calculate difference between 1 array and 1 non-array');
+  }
+  /**
+   * Difference of elements in 2 arrays
+   *
+   * @param {Array} arr1     Array 1
+   * @param {Array} arr2     Array 2
+   * @return {Array}         resulting array
+   */
+
+
+  function _ArrayDiff(arr1, arr2) {
+    if (arr1.length !== arr2.length) {
+      throw RangeError('Not all sub-arrays have the same length');
+    }
+
+    var result = [];
+    var size = arr1.length;
+
+    for (var i = 0; i < size; i++) {
+      result.push(_ElementDiff(arr1[i], arr2[i]));
+    }
+
+    return result;
+  }
+});
+exports.createDiff = createDiff;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/dot.js b/node_modules/mathjs/lib/cjs/function/matrix/dot.js
new file mode 100644
index 0000000..4311fe8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/dot.js
@@ -0,0 +1,185 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDot = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'dot';
+var dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];
+var createDot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      addScalar = _ref.addScalar,
+      multiplyScalar = _ref.multiplyScalar,
+      conj = _ref.conj,
+      size = _ref.size;
+
+  /**
+   * Calculate the dot product of two vectors. The dot product of
+   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:
+   *
+   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn
+   *
+   * Syntax:
+   *
+   *    math.dot(x, y)
+   *
+   * Examples:
+   *
+   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15
+   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15
+   *
+   * See also:
+   *
+   *    multiply, cross
+   *
+   * @param  {Array | Matrix} x     First vector
+   * @param  {Array | Matrix} y     Second vector
+   * @return {number}               Returns the dot product of `x` and `y`
+   */
+  return typed(name, {
+    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,
+    'SparseMatrix, SparseMatrix': _sparseDot
+  });
+
+  function _validateDim(x, y) {
+    var xSize = _size(x);
+
+    var ySize = _size(y);
+
+    var xLen, yLen;
+
+    if (xSize.length === 1) {
+      xLen = xSize[0];
+    } else if (xSize.length === 2 && xSize[1] === 1) {
+      xLen = xSize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');
+    }
+
+    if (ySize.length === 1) {
+      yLen = ySize[0];
+    } else if (ySize.length === 2 && ySize[1] === 1) {
+      yLen = ySize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');
+    }
+
+    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');
+    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');
+    return xLen;
+  }
+
+  function _denseDot(a, b) {
+    var N = _validateDim(a, b);
+
+    var adata = (0, _is.isMatrix)(a) ? a._data : a;
+    var adt = (0, _is.isMatrix)(a) ? a._datatype : undefined;
+    var bdata = (0, _is.isMatrix)(b) ? b._data : b;
+    var bdt = (0, _is.isMatrix)(b) ? b._datatype : undefined; // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)
+
+    var aIsColumn = _size(a).length === 2;
+    var bIsColumn = _size(b).length === 2;
+    var add = addScalar;
+    var mul = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      var dt = adt; // find signatures that matches (dt, dt)
+
+      add = typed.find(addScalar, [dt, dt]);
+      mul = typed.find(multiplyScalar, [dt, dt]);
+    } // both vectors 1-dimensional
+
+
+    if (!aIsColumn && !bIsColumn) {
+      var c = mul(conj(adata[0]), bdata[0]);
+
+      for (var i = 1; i < N; i++) {
+        c = add(c, mul(conj(adata[i]), bdata[i]));
+      }
+
+      return c;
+    } // a is 1-dim, b is column
+
+
+    if (!aIsColumn && bIsColumn) {
+      var _c = mul(conj(adata[0]), bdata[0][0]);
+
+      for (var _i = 1; _i < N; _i++) {
+        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));
+      }
+
+      return _c;
+    } // a is column, b is 1-dim
+
+
+    if (aIsColumn && !bIsColumn) {
+      var _c2 = mul(conj(adata[0][0]), bdata[0]);
+
+      for (var _i2 = 1; _i2 < N; _i2++) {
+        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));
+      }
+
+      return _c2;
+    } // both vectors are column
+
+
+    if (aIsColumn && bIsColumn) {
+      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);
+
+      for (var _i3 = 1; _i3 < N; _i3++) {
+        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));
+      }
+
+      return _c3;
+    }
+  }
+
+  function _sparseDot(x, y) {
+    _validateDim(x, y);
+
+    var xindex = x._index;
+    var xvalues = x._values;
+    var yindex = y._index;
+    var yvalues = y._values; // TODO optimize add & mul using datatype
+
+    var c = 0;
+    var add = addScalar;
+    var mul = multiplyScalar;
+    var i = 0;
+    var j = 0;
+
+    while (i < xindex.length && j < yindex.length) {
+      var I = xindex[i];
+      var J = yindex[j];
+
+      if (I < J) {
+        i++;
+        continue;
+      }
+
+      if (I > J) {
+        j++;
+        continue;
+      }
+
+      if (I === J) {
+        c = add(c, mul(xvalues[i], yvalues[j]));
+        i++;
+        j++;
+      }
+    }
+
+    return c;
+  } // TODO remove this once #1771 is fixed
+
+
+  function _size(x) {
+    return (0, _is.isMatrix)(x) ? x.size() : size(x);
+  }
+});
+exports.createDot = createDot;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/eigs.js b/node_modules/mathjs/lib/cjs/function/matrix/eigs.js
new file mode 100644
index 0000000..8ae394d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/eigs.js
@@ -0,0 +1,291 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEigs = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _string = require("../../utils/string.js");
+
+var _complexEigs = require("./eigs/complexEigs.js");
+
+var _realSymetric = require("./eigs/realSymetric.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'eigs'; // The absolute state of math.js's dependency system:
+
+var dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];
+var createEigs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var config = _ref.config,
+      typed = _ref.typed,
+      matrix = _ref.matrix,
+      addScalar = _ref.addScalar,
+      subtract = _ref.subtract,
+      equal = _ref.equal,
+      abs = _ref.abs,
+      atan = _ref.atan,
+      cos = _ref.cos,
+      sin = _ref.sin,
+      multiplyScalar = _ref.multiplyScalar,
+      divideScalar = _ref.divideScalar,
+      inv = _ref.inv,
+      bignumber = _ref.bignumber,
+      multiply = _ref.multiply,
+      add = _ref.add,
+      larger = _ref.larger,
+      column = _ref.column,
+      flatten = _ref.flatten,
+      number = _ref.number,
+      complex = _ref.complex,
+      sqrt = _ref.sqrt,
+      diag = _ref.diag,
+      qr = _ref.qr,
+      usolve = _ref.usolve,
+      usolveAll = _ref.usolveAll,
+      im = _ref.im,
+      re = _ref.re,
+      smaller = _ref.smaller,
+      matrixFromColumns = _ref.matrixFromColumns,
+      dot = _ref.dot;
+  var doRealSymetric = (0, _realSymetric.createRealSymmetric)({
+    config: config,
+    addScalar: addScalar,
+    subtract: subtract,
+    column: column,
+    flatten: flatten,
+    equal: equal,
+    abs: abs,
+    atan: atan,
+    cos: cos,
+    sin: sin,
+    multiplyScalar: multiplyScalar,
+    inv: inv,
+    bignumber: bignumber,
+    complex: complex,
+    multiply: multiply,
+    add: add
+  });
+  var doComplexEigs = (0, _complexEigs.createComplexEigs)({
+    config: config,
+    addScalar: addScalar,
+    subtract: subtract,
+    multiply: multiply,
+    multiplyScalar: multiplyScalar,
+    flatten: flatten,
+    divideScalar: divideScalar,
+    sqrt: sqrt,
+    abs: abs,
+    bignumber: bignumber,
+    diag: diag,
+    qr: qr,
+    inv: inv,
+    usolve: usolve,
+    usolveAll: usolveAll,
+    equal: equal,
+    complex: complex,
+    larger: larger,
+    smaller: smaller,
+    matrixFromColumns: matrixFromColumns,
+    dot: dot
+  });
+  /**
+   * Compute eigenvalues and eigenvectors of a matrix. The eigenvalues are sorted by their absolute value, ascending.
+   * An eigenvalue with multiplicity k will be listed k times. The eigenvectors are returned as columns of a matrix –
+   * the eigenvector that belongs to the j-th eigenvalue in the list (eg. `values[j]`) is the j-th column (eg. `column(vectors, j)`).
+   * If the algorithm fails to converge, it will throw an error – in that case, however, you may still find useful information
+   * in `err.values` and `err.vectors`.
+   *
+   * Syntax:
+   *
+   *     math.eigs(x, [prec])
+   *
+   * Examples:
+   *
+   *     const { eigs, multiply, column, transpose } = math
+   *     const H = [[5, 2.3], [2.3, 1]]
+   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], vectors: [v1,v2.... corresponding vectors as columns]}
+   *     const E = ans.values
+   *     const U = ans.vectors
+   *     multiply(H, column(U, 0)) // returns multiply(E[0], column(U, 0))
+   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H
+   *     E[0] == UTxHxU[0][0]  // returns true
+   *
+   * See also:
+   *
+   *     inv
+   *
+   * @param {Array | Matrix} x  Matrix to be diagonalized
+   *
+   * @param {number | BigNumber} [prec] Precision, default value: 1e-15
+   * @return {{values: Array|Matrix, vectors: Array|Matrix}} Object containing an array of eigenvalues and a matrix with eigenvectors as columns.
+   *
+   */
+
+  return typed('eigs', {
+    Array: function Array(x) {
+      var mat = matrix(x);
+      return computeValuesAndVectors(mat);
+    },
+    'Array, number|BigNumber': function ArrayNumberBigNumber(x, prec) {
+      var mat = matrix(x);
+      return computeValuesAndVectors(mat, prec);
+    },
+    Matrix: function Matrix(mat) {
+      var _computeValuesAndVect = computeValuesAndVectors(mat),
+          values = _computeValuesAndVect.values,
+          vectors = _computeValuesAndVect.vectors;
+
+      return {
+        values: matrix(values),
+        vectors: matrix(vectors)
+      };
+    },
+    'Matrix, number|BigNumber': function MatrixNumberBigNumber(mat, prec) {
+      var _computeValuesAndVect2 = computeValuesAndVectors(mat, prec),
+          values = _computeValuesAndVect2.values,
+          vectors = _computeValuesAndVect2.vectors;
+
+      return {
+        values: matrix(values),
+        vectors: matrix(vectors)
+      };
+    }
+  });
+
+  function computeValuesAndVectors(mat, prec) {
+    if (prec === undefined) {
+      prec = config.epsilon;
+    }
+
+    var size = mat.size();
+
+    if (size.length !== 2 || size[0] !== size[1]) {
+      throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');
+    }
+
+    var arr = mat.toArray();
+    var N = size[0];
+
+    if (isReal(arr, N, prec)) {
+      coerceReal(arr, N);
+
+      if (isSymmetric(arr, N, prec)) {
+        var _type = coerceTypes(mat, arr, N);
+
+        return doRealSymetric(arr, N, prec, _type);
+      }
+    }
+
+    var type = coerceTypes(mat, arr, N);
+    return doComplexEigs(arr, N, prec, type);
+  }
+  /** @return {boolean} */
+
+
+  function isSymmetric(arr, N, prec) {
+    for (var i = 0; i < N; i++) {
+      for (var j = i; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {
+          return false;
+        }
+      }
+    }
+
+    return true;
+  }
+  /** @return {boolean} */
+
+
+  function isReal(arr, N, prec) {
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {
+          return false;
+        }
+      }
+    }
+
+    return true;
+  }
+
+  function coerceReal(arr, N) {
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        arr[i][j] = re(arr[i][j]);
+      }
+    }
+  }
+  /** @return {'number' | 'BigNumber' | 'Complex'} */
+
+
+  function coerceTypes(mat, arr, N) {
+    /** @type {string} */
+    var type = mat.datatype();
+
+    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {
+      return type;
+    }
+
+    var hasNumber = false;
+    var hasBig = false;
+    var hasComplex = false;
+
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        var el = arr[i][j];
+
+        if ((0, _is.isNumber)(el) || (0, _is.isFraction)(el)) {
+          hasNumber = true;
+        } else if ((0, _is.isBigNumber)(el)) {
+          hasBig = true;
+        } else if ((0, _is.isComplex)(el)) {
+          hasComplex = true;
+        } else {
+          throw TypeError('Unsupported type in Matrix: ' + (0, _is.typeOf)(el));
+        }
+      }
+    }
+
+    if (hasBig && hasComplex) {
+      console.warn('Complex BigNumbers not supported, this operation will lose precission.');
+    }
+
+    if (hasComplex) {
+      for (var _i = 0; _i < N; _i++) {
+        for (var _j = 0; _j < N; _j++) {
+          arr[_i][_j] = complex(arr[_i][_j]);
+        }
+      }
+
+      return 'Complex';
+    }
+
+    if (hasBig) {
+      for (var _i2 = 0; _i2 < N; _i2++) {
+        for (var _j2 = 0; _j2 < N; _j2++) {
+          arr[_i2][_j2] = bignumber(arr[_i2][_j2]);
+        }
+      }
+
+      return 'BigNumber';
+    }
+
+    if (hasNumber) {
+      for (var _i3 = 0; _i3 < N; _i3++) {
+        for (var _j3 = 0; _j3 < N; _j3++) {
+          arr[_i3][_j3] = number(arr[_i3][_j3]);
+        }
+      }
+
+      return 'number';
+    } else {
+      throw TypeError('Matrix contains unsupported types only.');
+    }
+  }
+});
+exports.createEigs = createEigs;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/eigs/complexEigs.js b/node_modules/mathjs/lib/cjs/function/matrix/eigs/complexEigs.js
new file mode 100644
index 0000000..a69dea9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/eigs/complexEigs.js
@@ -0,0 +1,792 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComplexEigs = createComplexEigs;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
+
+var _object = require("../../../utils/object.js");
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+function createComplexEigs(_ref) {
+  var addScalar = _ref.addScalar,
+      subtract = _ref.subtract,
+      flatten = _ref.flatten,
+      multiply = _ref.multiply,
+      multiplyScalar = _ref.multiplyScalar,
+      divideScalar = _ref.divideScalar,
+      sqrt = _ref.sqrt,
+      abs = _ref.abs,
+      bignumber = _ref.bignumber,
+      diag = _ref.diag,
+      inv = _ref.inv,
+      qr = _ref.qr,
+      usolve = _ref.usolve,
+      usolveAll = _ref.usolveAll,
+      equal = _ref.equal,
+      complex = _ref.complex,
+      larger = _ref.larger,
+      smaller = _ref.smaller,
+      matrixFromColumns = _ref.matrixFromColumns,
+      dot = _ref.dot;
+
+  /**
+   * @param {number[][]} arr the matrix to find eigenvalues of
+   * @param {number} N size of the matrix
+   * @param {number|BigNumber} prec precision, anything lower will be considered zero
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors should we find eigenvectors?
+   *
+   * @returns {{ values: number[], vectors: number[][] }}
+   */
+  function complexEigs(arr, N, prec, type, findVectors) {
+    if (findVectors === undefined) {
+      findVectors = true;
+    } // TODO check if any row/col are zero except the diagonal
+    // make sure corresponding rows and columns have similar magnitude
+    // important because of numerical stability
+    // MODIFIES arr by side effect!
+
+
+    var R = balance(arr, N, prec, type, findVectors); // R is the row transformation matrix
+    // arr = A' = R A R⁻¹, A is the original matrix
+    // (if findVectors is false, R is undefined)
+    // (And so to return to original matrix: A = R⁻¹ arr R)
+    // TODO if magnitudes of elements vary over many orders,
+    // move greatest elements to the top left corner
+    // using similarity transformations, reduce the matrix
+    // to Hessenberg form (upper triangular plus one subdiagonal row)
+    // updates the transformation matrix R with new row operationsq
+    // MODIFIES arr by side effect!
+
+    reduceToHessenberg(arr, N, prec, type, findVectors, R); // still true that original A = R⁻¹ arr R)
+    // find eigenvalues
+
+    var _iterateUntilTriangul = iterateUntilTriangular(arr, N, prec, type, findVectors),
+        values = _iterateUntilTriangul.values,
+        C = _iterateUntilTriangul.C; // values is the list of eigenvalues, C is the column
+    // transformation matrix that transforms arr, the hessenberg
+    // matrix, to upper triangular
+    // (So U = C⁻¹ arr C and the relationship between current arr
+    // and original A is unchanged.)
+
+
+    var vectors;
+
+    if (findVectors) {
+      vectors = findEigenvectors(arr, N, C, R, values, prec, type);
+      vectors = matrixFromColumns.apply(void 0, (0, _toConsumableArray2.default)(vectors));
+    }
+
+    return {
+      values: values,
+      vectors: vectors
+    };
+  }
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]}
+   */
+
+
+  function balance(arr, N, prec, type, findVectors) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var realzero = big ? bignumber(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    var realone = big ? bignumber(1) : 1; // base of the floating-point arithmetic
+
+    var radix = big ? bignumber(10) : 2;
+    var radixSq = multiplyScalar(radix, radix); // the diagonal transformation matrix R
+
+    var Rdiag;
+
+    if (findVectors) {
+      Rdiag = Array(N).fill(one);
+    } // this isn't the only time we loop thru the matrix...
+
+
+    var last = false;
+
+    while (!last) {
+      // ...haha I'm joking! unless...
+      last = true;
+
+      for (var i = 0; i < N; i++) {
+        // compute the taxicab norm of i-th column and row
+        // TODO optimize for complex numbers
+        var colNorm = realzero;
+        var rowNorm = realzero;
+
+        for (var j = 0; j < N; j++) {
+          if (i === j) continue;
+          var c = abs(arr[i][j]); // should be real
+
+          colNorm = addScalar(colNorm, c);
+          rowNorm = addScalar(rowNorm, c);
+        }
+
+        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {
+          // find integer power closest to balancing the matrix
+          // (we want to scale only by integer powers of radix,
+          // so that we don't lose any precision due to round-off)
+          var f = realone;
+          var _c = colNorm;
+          var rowDivRadix = divideScalar(rowNorm, radix);
+          var rowMulRadix = multiplyScalar(rowNorm, radix);
+
+          while (smaller(_c, rowDivRadix)) {
+            _c = multiplyScalar(_c, radixSq);
+            f = multiplyScalar(f, radix);
+          }
+
+          while (larger(_c, rowMulRadix)) {
+            _c = divideScalar(_c, radixSq);
+            f = divideScalar(f, radix);
+          } // check whether balancing is needed
+          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)
+
+
+          var condition = smaller(divideScalar(addScalar(_c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95)); // apply balancing similarity transformation
+
+          if (condition) {
+            // we should loop once again to check whether
+            // another rebalancing is needed
+            last = false;
+            var g = divideScalar(1, f);
+
+            for (var _j = 0; _j < N; _j++) {
+              if (i === _j) {
+                continue;
+              }
+
+              arr[i][_j] = multiplyScalar(arr[i][_j], f);
+              arr[_j][i] = multiplyScalar(arr[_j][i], g);
+            } // keep track of transformations
+
+
+            if (findVectors) {
+              Rdiag[i] = multiplyScalar(Rdiag[i], f);
+            }
+          }
+        }
+      }
+    } // return the diagonal row transformation matrix
+
+
+    return diag(Rdiag);
+  }
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors
+   * @param {number[][]} R the row transformation matrix that will be modified
+   */
+
+
+  function reduceToHessenberg(arr, N, prec, type, findVectors, R) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+
+    if (big) {
+      prec = bignumber(prec);
+    }
+
+    for (var i = 0; i < N - 2; i++) {
+      // Find the largest subdiag element in the i-th col
+      var maxIndex = 0;
+      var max = zero;
+
+      for (var j = i + 1; j < N; j++) {
+        var el = arr[j][i];
+
+        if (smaller(abs(max), abs(el))) {
+          max = el;
+          maxIndex = j;
+        }
+      } // This col is pivoted, no need to do anything
+
+
+      if (smaller(abs(max), prec)) {
+        continue;
+      }
+
+      if (maxIndex !== i + 1) {
+        // Interchange maxIndex-th and (i+1)-th row
+        var tmp1 = arr[maxIndex];
+        arr[maxIndex] = arr[i + 1];
+        arr[i + 1] = tmp1; // Interchange maxIndex-th and (i+1)-th column
+
+        for (var _j2 = 0; _j2 < N; _j2++) {
+          var tmp2 = arr[_j2][maxIndex];
+          arr[_j2][maxIndex] = arr[_j2][i + 1];
+          arr[_j2][i + 1] = tmp2;
+        } // keep track of transformations
+
+
+        if (findVectors) {
+          var tmp3 = R[maxIndex];
+          R[maxIndex] = R[i + 1];
+          R[i + 1] = tmp3;
+        }
+      } // Reduce following rows and columns
+
+
+      for (var _j3 = i + 2; _j3 < N; _j3++) {
+        var n = divideScalar(arr[_j3][i], max);
+
+        if (n === 0) {
+          continue;
+        } // from j-th row subtract n-times (i+1)th row
+
+
+        for (var k = 0; k < N; k++) {
+          arr[_j3][k] = subtract(arr[_j3][k], multiplyScalar(n, arr[i + 1][k]));
+        } // to (i+1)th column add n-times j-th column
+
+
+        for (var _k = 0; _k < N; _k++) {
+          arr[_k][i + 1] = addScalar(arr[_k][i + 1], multiplyScalar(n, arr[_k][_j3]));
+        } // keep track of transformations
+
+
+        if (findVectors) {
+          for (var _k2 = 0; _k2 < N; _k2++) {
+            R[_j3][_k2] = subtract(R[_j3][_k2], multiplyScalar(n, R[i + 1][_k2]));
+          }
+        }
+      }
+    }
+
+    return R;
+  }
+  /**
+   * @returns {{values: values, C: Matrix}}
+   * @see Press, Wiliams: Numerical recipes in Fortran 77
+   * @see https://en.wikipedia.org/wiki/QR_algorithm
+   */
+
+
+  function iterateUntilTriangular(A, N, prec, type, findVectors) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+
+    if (big) {
+      prec = bignumber(prec);
+    } // The Francis Algorithm
+    // The core idea of this algorithm is that doing successive
+    // A' = Q⁺AQ transformations will eventually converge to block-
+    // upper-triangular with diagonal blocks either 1x1 or 2x2.
+    // The Q here is the one from the QR decomposition, A = QR.
+    // Since the eigenvalues of a block-upper-triangular matrix are
+    // the eigenvalues of its diagonal blocks and we know how to find
+    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.
+
+
+    var arr = (0, _object.clone)(A); // the list of converged eigenvalues
+
+    var lambdas = []; // size of arr, which will get smaller as eigenvalues converge
+
+    var n = N; // the diagonal of the block-diagonal matrix that turns
+    // converged 2x2 matrices into upper triangular matrices
+
+    var Sdiag = []; // N×N matrix describing the overall transformation done during the QR algorithm
+
+    var Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined; // n×n matrix describing the QR transformations done since last convergence
+
+    var Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined; // last eigenvalue converged before this many steps
+
+    var lastConvergenceBefore = 0;
+
+    while (lastConvergenceBefore <= 100) {
+      lastConvergenceBefore += 1; // TODO if the convergence is slow, do something clever
+      // Perform the factorization
+
+      var k = 0; // TODO set close to an eigenvalue
+
+      for (var i = 0; i < n; i++) {
+        arr[i][i] = subtract(arr[i][i], k);
+      } // TODO do an implicit QR transformation
+
+
+      var _qr = qr(arr),
+          Q = _qr.Q,
+          R = _qr.R;
+
+      arr = multiply(R, Q);
+
+      for (var _i = 0; _i < n; _i++) {
+        arr[_i][_i] = addScalar(arr[_i][_i], k);
+      } // keep track of transformations
+
+
+      if (findVectors) {
+        Qpartial = multiply(Qpartial, Q);
+      } // The rightmost diagonal element converged to an eigenvalue
+
+
+      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {
+        lastConvergenceBefore = 0;
+        lambdas.push(arr[n - 1][n - 1]); // keep track of transformations
+
+        if (findVectors) {
+          Sdiag.unshift([[1]]);
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+
+          if (n > 1) {
+            Qpartial = diag(Array(n - 1).fill(one));
+          }
+        } // reduce the matrix size
+
+
+        n -= 1;
+        arr.pop();
+
+        for (var _i2 = 0; _i2 < n; _i2++) {
+          arr[_i2].pop();
+        } // The rightmost diagonal 2x2 block converged
+
+      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {
+        lastConvergenceBefore = 0;
+        var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);
+        lambdas.push.apply(lambdas, (0, _toConsumableArray2.default)(ll)); // keep track of transformations
+
+        if (findVectors) {
+          Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+
+          if (n > 2) {
+            Qpartial = diag(Array(n - 2).fill(one));
+          }
+        } // reduce the matrix size
+
+
+        n -= 2;
+        arr.pop();
+        arr.pop();
+
+        for (var _i3 = 0; _i3 < n; _i3++) {
+          arr[_i3].pop();
+
+          arr[_i3].pop();
+        }
+      }
+
+      if (n === 0) {
+        break;
+      }
+    } // standard sorting
+
+
+    lambdas.sort(function (a, b) {
+      return +subtract(abs(a), abs(b));
+    }); // the algorithm didn't converge
+
+    if (lastConvergenceBefore > 100) {
+      var err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '));
+      err.values = lambdas;
+      err.vectors = [];
+      throw err;
+    } // combine the overall QR transformation Qtotal with the subsequent
+    // transformation S that turns the diagonal 2x2 blocks to upper triangular
+
+
+    var C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined;
+    return {
+      values: lambdas,
+      C: C
+    };
+  }
+  /**
+   * @param {Matrix} A hessenberg-form matrix
+   * @param {number} N size of A
+   * @param {Matrix} C column transformation matrix that turns A into upper triangular
+   * @param {Matrix} R similarity that turns original matrix into A
+   * @param {number[]} values array of eigenvalues of A
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]} eigenvalues
+   */
+
+
+  function findEigenvectors(A, N, C, R, values, prec, type) {
+    var Cinv = inv(C);
+    var U = multiply(Cinv, A, C);
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1; // turn values into a kind of "multiset"
+    // this way it is easier to find eigenvectors
+
+    var uniqueValues = [];
+    var multiplicities = [];
+
+    var _iterator = _createForOfIteratorHelper(values),
+        _step;
+
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var λ = _step.value;
+
+        var _i4 = indexOf(uniqueValues, λ, equal);
+
+        if (_i4 === -1) {
+          uniqueValues.push(λ);
+          multiplicities.push(1);
+        } else {
+          multiplicities[_i4] += 1;
+        }
+      } // find eigenvectors by solving U − λE = 0
+      // TODO replace with an iterative eigenvector algorithm
+      // (this one might fail for imprecise eigenvalues)
+
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+
+    var vectors = [];
+    var len = uniqueValues.length;
+    var b = Array(N).fill(zero);
+    var E = diag(Array(N).fill(one)); // eigenvalues for which usolve failed (due to numerical error)
+
+    var failedLambdas = [];
+
+    var _loop = function _loop(i) {
+      var λ = uniqueValues[i];
+      var S = subtract(U, multiply(λ, E)); // the characteristic matrix
+
+      var solutions = usolveAll(S, b);
+      solutions.shift(); // ignore the null vector
+      // looks like we missed something, try inverse iteration
+
+      while (solutions.length < multiplicities[i]) {
+        var approxVec = inverseIterate(S, N, solutions, prec, type);
+
+        if (approxVec == null) {
+          // no more vectors were found
+          failedLambdas.push(λ);
+          break;
+        }
+
+        solutions.push(approxVec);
+      } // Transform back into original array coordinates
+
+
+      var correction = multiply(inv(R), C);
+      solutions = solutions.map(function (v) {
+        return multiply(correction, v);
+      });
+      vectors.push.apply(vectors, (0, _toConsumableArray2.default)(solutions.map(function (v) {
+        return flatten(v);
+      })));
+    };
+
+    for (var i = 0; i < len; i++) {
+      _loop(i);
+    }
+
+    if (failedLambdas.length !== 0) {
+      var err = new Error('Failed to find eigenvectors for the following eigenvalues: ' + failedLambdas.join(', '));
+      err.values = values;
+      err.vectors = vectors;
+      throw err;
+    }
+
+    return vectors;
+  }
+  /**
+   * Compute the eigenvalues of an 2x2 matrix
+   * @return {[number,number]}
+   */
+
+
+  function eigenvalues2x2(a, b, c, d) {
+    // λ± = ½ trA ± ½ √( tr²A - 4 detA )
+    var trA = addScalar(a, d);
+    var detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c));
+    var x = multiplyScalar(trA, 0.5);
+    var y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5);
+    return [addScalar(x, y), subtract(x, y)];
+  }
+  /**
+   * For an 2x2 matrix compute the transformation matrix S,
+   * so that SAS⁻¹ is an upper triangular matrix
+   * @return {[[number,number],[number,number]]}
+   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf
+   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html
+   */
+
+
+  function jordanBase2x2(a, b, c, d, l1, l2, prec, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1; // matrix is already upper triangular
+    // return an identity matrix
+
+    if (smaller(abs(c), prec)) {
+      return [[one, zero], [zero, one]];
+    } // matrix is diagonalizable
+    // return its eigenvectors as columns
+
+
+    if (larger(abs(subtract(l1, l2)), prec)) {
+      return [[subtract(l1, d), subtract(l2, d)], [c, c]];
+    } // matrix is not diagonalizable
+    // compute off-diagonal elements of N = A - λI
+    // N₁₂ = 0 ⇒ S = ( N⃗₁, I⃗₁ )
+    // N₁₂ ≠ 0 ⇒ S = ( N⃗₂, I⃗₂ )
+
+
+    var na = subtract(a, l1);
+    var nb = subtract(b, l1);
+    var nc = subtract(c, l1);
+    var nd = subtract(d, l1);
+
+    if (smaller(abs(nb), prec)) {
+      return [[na, one], [nc, zero]];
+    } else {
+      return [[nb, zero], [nd, one]];
+    }
+  }
+  /**
+   * Enlarge the matrix from n×n to N×N, setting the new
+   * elements to 1 on diagonal and 0 elsewhere
+   */
+
+
+  function inflateMatrix(arr, N) {
+    // add columns
+    for (var i = 0; i < arr.length; i++) {
+      var _arr$i;
+
+      (_arr$i = arr[i]).push.apply(_arr$i, (0, _toConsumableArray2.default)(Array(N - arr[i].length).fill(0)));
+    } // add rows
+
+
+    for (var _i5 = arr.length; _i5 < N; _i5++) {
+      arr.push(Array(N).fill(0));
+      arr[_i5][_i5] = 1;
+    }
+
+    return arr;
+  }
+  /**
+   * Create a block-diagonal matrix with the given square matrices on the diagonal
+   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal
+   * @param {number} N the size of the resulting matrix
+   */
+
+
+  function blockDiag(arr, N) {
+    var M = [];
+
+    for (var i = 0; i < N; i++) {
+      M[i] = Array(N).fill(0);
+    }
+
+    var I = 0;
+
+    var _iterator2 = _createForOfIteratorHelper(arr),
+        _step2;
+
+    try {
+      for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+        var sub = _step2.value;
+        var n = sub.length;
+
+        for (var _i6 = 0; _i6 < n; _i6++) {
+          for (var j = 0; j < n; j++) {
+            M[I + _i6][I + j] = sub[_i6][j];
+          }
+        }
+
+        I += n;
+      }
+    } catch (err) {
+      _iterator2.e(err);
+    } finally {
+      _iterator2.f();
+    }
+
+    return M;
+  }
+  /**
+   * Finds the index of an element in an array using a custom equality function
+   * @template T
+   * @param {Array<T>} arr array in which to search
+   * @param {T} el the element to find
+   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`
+   * @returns {number} the index of `el`, or -1 when it's not in `arr`
+   */
+
+
+  function indexOf(arr, el, fn) {
+    for (var i = 0; i < arr.length; i++) {
+      if (fn(arr[i], el)) {
+        return i;
+      }
+    }
+
+    return -1;
+  }
+  /**
+   * Provided a near-singular upper-triangular matrix A and a list of vectors,
+   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal
+   * to each vector in the list
+   * @template T
+   * @param {T[][]} A near-singular square matrix
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {number} prec epsilon
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @return {T[] | null} eigenvector
+   *
+   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration
+   */
+
+
+  function inverseIterate(A, N, orthog, prec, type) {
+    var largeNum = type === 'BigNumber' ? bignumber(1000) : 1000;
+    var b; // the vector
+    // you better choose a random vector before I count to five
+
+    var i = 0;
+
+    while (true) {
+      b = randomOrthogonalVector(N, orthog, type);
+      b = usolve(A, b);
+
+      if (larger(norm(b), largeNum)) {
+        break;
+      }
+
+      if (++i >= 5) {
+        return null;
+      }
+    } // you better converge before I count to ten
+
+
+    i = 0;
+
+    while (true) {
+      var c = usolve(A, b);
+
+      if (smaller(norm(orthogonalComplement(b, [c])), prec)) {
+        break;
+      }
+
+      if (++i >= 10) {
+        return null;
+      }
+
+      b = normalize(c);
+    }
+
+    return b;
+  }
+  /**
+   * Generates a random unit vector of dimension N, orthogonal to each vector in the list
+   * @template T
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} random vector
+   */
+
+
+  function randomOrthogonalVector(N, orthog, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex'; // generate random vector with the correct type
+
+    var v = Array(N).fill(0).map(function (_) {
+      return 2 * Math.random() - 1;
+    });
+
+    if (big) {
+      v = v.map(function (n) {
+        return bignumber(n);
+      });
+    }
+
+    if (cplx) {
+      v = v.map(function (n) {
+        return complex(n);
+      });
+    } // project to orthogonal complement
+
+
+    v = orthogonalComplement(v, orthog); // normalize
+
+    return normalize(v, type);
+  }
+  /**
+   * Project vector v to the orthogonal complement of an array of vectors
+   */
+
+
+  function orthogonalComplement(v, orthog) {
+    var _iterator3 = _createForOfIteratorHelper(orthog),
+        _step3;
+
+    try {
+      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+        var w = _step3.value;
+        // v := v − (w, v)/∥w∥² w
+        v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));
+      }
+    } catch (err) {
+      _iterator3.e(err);
+    } finally {
+      _iterator3.f();
+    }
+
+    return v;
+  }
+  /**
+   * Calculate the norm of a vector.
+   * We can't use math.norm because factory can't handle circular dependency.
+   * Seriously, I'm really fed up with factory.
+   */
+
+
+  function norm(v) {
+    return abs(sqrt(dot(v, v)));
+  }
+  /**
+   * Normalize a vector
+   * @template T
+   * @param {T[]} v
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} normalized vec
+   */
+
+
+  function normalize(v, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    return multiply(divideScalar(one, norm(v)), v);
+  }
+
+  return complexEigs;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/eigs/realSymetric.js b/node_modules/mathjs/lib/cjs/function/matrix/eigs/realSymetric.js
new file mode 100644
index 0000000..d15eb32
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/eigs/realSymetric.js
@@ -0,0 +1,341 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRealSymmetric = createRealSymmetric;
+
+var _object = require("../../../utils/object.js");
+
+function createRealSymmetric(_ref) {
+  var config = _ref.config,
+      addScalar = _ref.addScalar,
+      subtract = _ref.subtract,
+      abs = _ref.abs,
+      atan = _ref.atan,
+      cos = _ref.cos,
+      sin = _ref.sin,
+      multiplyScalar = _ref.multiplyScalar,
+      inv = _ref.inv,
+      bignumber = _ref.bignumber,
+      multiply = _ref.multiply,
+      add = _ref.add;
+
+  /**
+   * @param {number[] | BigNumber[]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number' | 'BigNumber'} type
+   */
+  function main(arr, N) {
+    var prec = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : config.epsilon;
+    var type = arguments.length > 3 ? arguments[3] : undefined;
+
+    if (type === 'number') {
+      return diag(arr, prec);
+    }
+
+    if (type === 'BigNumber') {
+      return diagBig(arr, prec);
+    }
+
+    throw TypeError('Unsupported data type: ' + type);
+  } // diagonalization implementation for number (efficient)
+
+
+  function diag(x, precision) {
+    var N = x.length;
+    var e0 = Math.abs(precision / N);
+    var psi;
+    var Sij = new Array(N); // Sij is Identity Matrix
+
+    for (var i = 0; i < N; i++) {
+      Sij[i] = createArray(N, 0);
+      Sij[i][i] = 1.0;
+    } // initial error
+
+
+    var Vab = getAij(x);
+
+    while (Math.abs(Vab[1]) >= Math.abs(e0)) {
+      var _i = Vab[0][0];
+      var j = Vab[0][1];
+      psi = getTheta(x[_i][_i], x[j][j], x[_i][j]);
+      x = x1(x, psi, _i, j);
+      Sij = Sij1(Sij, psi, _i, j);
+      Vab = getAij(x);
+    }
+
+    var Ei = createArray(N, 0); // eigenvalues
+
+    for (var _i2 = 0; _i2 < N; _i2++) {
+      Ei[_i2] = x[_i2][_i2];
+    }
+
+    return sorting((0, _object.clone)(Ei), (0, _object.clone)(Sij));
+  } // diagonalization implementation for bigNumber
+
+
+  function diagBig(x, precision) {
+    var N = x.length;
+    var e0 = abs(precision / N);
+    var psi;
+    var Sij = new Array(N); // Sij is Identity Matrix
+
+    for (var i = 0; i < N; i++) {
+      Sij[i] = createArray(N, 0);
+      Sij[i][i] = 1.0;
+    } // initial error
+
+
+    var Vab = getAijBig(x);
+
+    while (abs(Vab[1]) >= abs(e0)) {
+      var _i3 = Vab[0][0];
+      var j = Vab[0][1];
+      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);
+      x = x1Big(x, psi, _i3, j);
+      Sij = Sij1Big(Sij, psi, _i3, j);
+      Vab = getAijBig(x);
+    }
+
+    var Ei = createArray(N, 0); // eigenvalues
+
+    for (var _i4 = 0; _i4 < N; _i4++) {
+      Ei[_i4] = x[_i4][_i4];
+    } // return [clone(Ei), clone(Sij)]
+
+
+    return sorting((0, _object.clone)(Ei), (0, _object.clone)(Sij));
+  } // get angle
+
+
+  function getTheta(aii, ajj, aij) {
+    var denom = ajj - aii;
+
+    if (Math.abs(denom) <= config.epsilon) {
+      return Math.PI / 4.0;
+    } else {
+      return 0.5 * Math.atan(2.0 * aij / (ajj - aii));
+    }
+  } // get angle
+
+
+  function getThetaBig(aii, ajj, aij) {
+    var denom = subtract(ajj, aii);
+
+    if (abs(denom) <= config.epsilon) {
+      return bignumber(-1).acos().div(4);
+    } else {
+      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))));
+    }
+  } // update eigvec
+
+
+  function Sij1(Sij, theta, i, j) {
+    var N = Sij.length;
+    var c = Math.cos(theta);
+    var s = Math.sin(theta);
+    var Ski = createArray(N, 0);
+    var Skj = createArray(N, 0);
+
+    for (var k = 0; k < N; k++) {
+      Ski[k] = c * Sij[k][i] - s * Sij[k][j];
+      Skj[k] = s * Sij[k][i] + c * Sij[k][j];
+    }
+
+    for (var _k = 0; _k < N; _k++) {
+      Sij[_k][i] = Ski[_k];
+      Sij[_k][j] = Skj[_k];
+    }
+
+    return Sij;
+  } // update eigvec for overlap
+
+
+  function Sij1Big(Sij, theta, i, j) {
+    var N = Sij.length;
+    var c = cos(theta);
+    var s = sin(theta);
+    var Ski = createArray(N, bignumber(0));
+    var Skj = createArray(N, bignumber(0));
+
+    for (var k = 0; k < N; k++) {
+      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));
+      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));
+    }
+
+    for (var _k2 = 0; _k2 < N; _k2++) {
+      Sij[_k2][i] = Ski[_k2];
+      Sij[_k2][j] = Skj[_k2];
+    }
+
+    return Sij;
+  } // update matrix
+
+
+  function x1Big(Hij, theta, i, j) {
+    var N = Hij.length;
+    var c = bignumber(cos(theta));
+    var s = bignumber(sin(theta));
+    var c2 = multiplyScalar(c, c);
+    var s2 = multiplyScalar(s, s);
+    var Aki = createArray(N, bignumber(0));
+    var Akj = createArray(N, bignumber(0)); // 2cs Hij
+
+    var csHij = multiply(bignumber(2), c, s, Hij[i][j]); //  Aii
+
+    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));
+    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j])); // 0  to i
+
+    for (var k = 0; k < N; k++) {
+      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));
+      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));
+    } // Modify Hij
+
+
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = bignumber(0);
+    Hij[j][i] = bignumber(0); // 0  to i
+
+    for (var _k3 = 0; _k3 < N; _k3++) {
+      if (_k3 !== i && _k3 !== j) {
+        Hij[i][_k3] = Aki[_k3];
+        Hij[_k3][i] = Aki[_k3];
+        Hij[j][_k3] = Akj[_k3];
+        Hij[_k3][j] = Akj[_k3];
+      }
+    }
+
+    return Hij;
+  } // update matrix
+
+
+  function x1(Hij, theta, i, j) {
+    var N = Hij.length;
+    var c = Math.cos(theta);
+    var s = Math.sin(theta);
+    var c2 = c * c;
+    var s2 = s * s;
+    var Aki = createArray(N, 0);
+    var Akj = createArray(N, 0); //  Aii
+
+    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];
+    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j]; // 0  to i
+
+    for (var k = 0; k < N; k++) {
+      Aki[k] = c * Hij[i][k] - s * Hij[j][k];
+      Akj[k] = s * Hij[i][k] + c * Hij[j][k];
+    } // Modify Hij
+
+
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = 0;
+    Hij[j][i] = 0; // 0  to i
+
+    for (var _k4 = 0; _k4 < N; _k4++) {
+      if (_k4 !== i && _k4 !== j) {
+        Hij[i][_k4] = Aki[_k4];
+        Hij[_k4][i] = Aki[_k4];
+        Hij[j][_k4] = Akj[_k4];
+        Hij[_k4][j] = Akj[_k4];
+      }
+    }
+
+    return Hij;
+  } // get max off-diagonal value from Upper Diagonal
+
+
+  function getAij(Mij) {
+    var N = Mij.length;
+    var maxMij = 0;
+    var maxIJ = [0, 1];
+
+    for (var i = 0; i < N; i++) {
+      for (var j = i + 1; j < N; j++) {
+        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {
+          maxMij = Math.abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+
+    return [maxIJ, maxMij];
+  } // get max off-diagonal value from Upper Diagonal
+
+
+  function getAijBig(Mij) {
+    var N = Mij.length;
+    var maxMij = 0;
+    var maxIJ = [0, 1];
+
+    for (var i = 0; i < N; i++) {
+      for (var j = i + 1; j < N; j++) {
+        if (abs(maxMij) < abs(Mij[i][j])) {
+          maxMij = abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+
+    return [maxIJ, maxMij];
+  } // sort results
+
+
+  function sorting(E, S) {
+    var N = E.length;
+    var values = Array(N);
+    var vectors = Array(N);
+
+    for (var k = 0; k < N; k++) {
+      vectors[k] = Array(N);
+    }
+
+    for (var i = 0; i < N; i++) {
+      var minID = 0;
+      var minE = E[0];
+
+      for (var j = 0; j < E.length; j++) {
+        if (abs(E[j]) < abs(minE)) {
+          minID = j;
+          minE = E[minID];
+        }
+      }
+
+      values[i] = E.splice(minID, 1)[0];
+
+      for (var _k5 = 0; _k5 < N; _k5++) {
+        vectors[_k5][i] = S[_k5][minID];
+
+        S[_k5].splice(minID, 1);
+      }
+    }
+
+    return {
+      values: values,
+      vectors: vectors
+    };
+  }
+  /**
+   * Create an array of a certain size and fill all items with an initial value
+   * @param {number} size
+   * @param {number} value
+   * @return {number[]}
+   */
+
+
+  function createArray(size, value) {
+    // TODO: as soon as all browsers support Array.fill, use that instead (IE doesn't support it)
+    var array = new Array(size);
+
+    for (var i = 0; i < size; i++) {
+      array[i] = value;
+    }
+
+    return array;
+  }
+
+  return main;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/expm.js b/node_modules/mathjs/lib/cjs/function/matrix/expm.js
new file mode 100644
index 0000000..055984f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/expm.js
@@ -0,0 +1,175 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createExpm = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _string = require("../../utils/string.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'expm';
+var dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];
+var createExpm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      abs = _ref.abs,
+      add = _ref.add,
+      identity = _ref.identity,
+      inv = _ref.inv,
+      multiply = _ref.multiply;
+
+  /**
+   * Compute the matrix exponential, expm(A) = e^A. The matrix must be square.
+   * Not to be confused with exp(a), which performs element-wise
+   * exponentiation.
+   *
+   * The exponential is calculated using the Padé approximant with scaling and
+   * squaring; see "Nineteen Dubious Ways to Compute the Exponential of a
+   * Matrix," by Moler and Van Loan.
+   *
+   * Syntax:
+   *
+   *     math.expm(x)
+   *
+   * Examples:
+   *
+   *     const A = [[0,2],[0,0]]
+   *     math.expm(A)        // returns [[1,2],[0,1]]
+   *
+   * See also:
+   *
+   *     exp
+   *
+   * @param {Matrix} x  A square Matrix
+   * @return {Matrix}   The exponential of x
+   */
+  return typed(name, {
+    Matrix: function Matrix(A) {
+      // Check matrix size
+      var size = A.size();
+
+      if (size.length !== 2 || size[0] !== size[1]) {
+        throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+
+      var n = size[0]; // Desired accuracy of the approximant (The actual accuracy
+      // will be affected by round-off error)
+
+      var eps = 1e-15; // The Padé approximant is not so accurate when the values of A
+      // are "large", so scale A by powers of two. Then compute the
+      // exponential, and square the result repeatedly according to
+      // the identity e^A = (e^(A/m))^m
+      // Compute infinity-norm of A, ||A||, to see how "big" it is
+
+      var infNorm = infinityNorm(A); // Find the optimal scaling factor and number of terms in the
+      // Padé approximant to reach the desired accuracy
+
+      var params = findParams(infNorm, eps);
+      var q = params.q;
+      var j = params.j; // The Pade approximation to e^A is:
+      // Rqq(A) = Dqq(A) ^ -1 * Nqq(A)
+      // where
+      // Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i
+      // Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i
+      // Scale A by 1 / 2^j
+
+      var Apos = multiply(A, Math.pow(2, -j)); // The i=0 term is just the identity matrix
+
+      var N = identity(n);
+      var D = identity(n); // Initialization (i=0)
+
+      var factor = 1; // Initialization (i=1)
+
+      var AposToI = Apos; // Cloning not necessary
+
+      var alternate = -1;
+
+      for (var i = 1; i <= q; i++) {
+        if (i > 1) {
+          AposToI = multiply(AposToI, Apos);
+          alternate = -alternate;
+        }
+
+        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);
+        N = add(N, multiply(factor, AposToI));
+        D = add(D, multiply(factor * alternate, AposToI));
+      }
+
+      var R = multiply(inv(D), N); // Square j times
+
+      for (var _i = 0; _i < j; _i++) {
+        R = multiply(R, R);
+      }
+
+      return (0, _is.isSparseMatrix)(A) ? A.createSparseMatrix(R) : R;
+    }
+  });
+
+  function infinityNorm(A) {
+    var n = A.size()[0];
+    var infNorm = 0;
+
+    for (var i = 0; i < n; i++) {
+      var rowSum = 0;
+
+      for (var j = 0; j < n; j++) {
+        rowSum += abs(A.get([i, j]));
+      }
+
+      infNorm = Math.max(rowSum, infNorm);
+    }
+
+    return infNorm;
+  }
+  /**
+   * Find the best parameters for the Pade approximant given
+   * the matrix norm and desired accuracy. Returns the first acceptable
+   * combination in order of increasing computational load.
+   */
+
+
+  function findParams(infNorm, eps) {
+    var maxSearchSize = 30;
+
+    for (var k = 0; k < maxSearchSize; k++) {
+      for (var q = 0; q <= k; q++) {
+        var j = k - q;
+
+        if (errorEstimate(infNorm, q, j) < eps) {
+          return {
+            q: q,
+            j: j
+          };
+        }
+      }
+    }
+
+    throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)');
+  }
+  /**
+   * Returns the estimated error of the Pade approximant for the given
+   * parameters.
+   */
+
+
+  function errorEstimate(infNorm, q, j) {
+    var qfac = 1;
+
+    for (var i = 2; i <= q; i++) {
+      qfac *= i;
+    }
+
+    var twoqfac = qfac;
+
+    for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {
+      twoqfac *= _i2;
+    }
+
+    var twoqp1fac = twoqfac * (2 * q + 1);
+    return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);
+  }
+});
+exports.createExpm = createExpm;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/filter.js b/node_modules/mathjs/lib/cjs/function/matrix/filter.js
new file mode 100644
index 0000000..417ad8a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/filter.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFilter = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _function = require("../../utils/function.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'filter';
+var dependencies = ['typed'];
+var createFilter = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Filter the items in an array or one dimensional matrix.
+   *
+   * Syntax:
+   *
+   *    math.filter(x, test)
+   *
+   * Examples:
+   *
+   *    function isPositive (x) {
+   *      return x > 0
+   *    }
+   *    math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]
+   *
+   *    math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/) // returns ["23", "100", "55"]
+   *
+   * See also:
+   *
+   *    forEach, map, sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to filter
+   * @param {Function | RegExp} test
+   *        A function or regular expression to test items.
+   *        All entries for which `test` returns true are returned.
+   *        When `test` is a function, it is invoked with three parameters:
+   *        the value of the element, the index of the element, and the
+   *        matrix/array being traversed. The function must return a boolean.
+   * @return {Matrix | Array} Returns the filtered matrix.
+   */
+  return typed('filter', {
+    'Array, function': _filterCallback,
+    'Matrix, function': function MatrixFunction(x, test) {
+      return x.create(_filterCallback(x.toArray(), test));
+    },
+    'Array, RegExp': _array.filterRegExp,
+    'Matrix, RegExp': function MatrixRegExp(x, test) {
+      return x.create((0, _array.filterRegExp)(x.toArray(), test));
+    }
+  });
+});
+/**
+ * Filter values in a callback given a callback function
+ * @param {Array} x
+ * @param {Function} callback
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+
+exports.createFilter = createFilter;
+
+function _filterCallback(x, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = (0, _function.maxArgumentCount)(callback);
+  return (0, _array.filter)(x, function (value, index, array) {
+    // invoke the callback function with the right number of arguments
+    if (args === 1) {
+      return callback(value);
+    } else if (args === 2) {
+      return callback(value, [index]);
+    } else {
+      // 3 or -1
+      return callback(value, [index], array);
+    }
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/flatten.js b/node_modules/mathjs/lib/cjs/function/matrix/flatten.js
new file mode 100644
index 0000000..25243cf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/flatten.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFlatten = void 0;
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'flatten';
+var dependencies = ['typed', 'matrix'];
+var createFlatten = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix;
+
+  /**
+   * Flatten a multi dimensional matrix into a single dimensional matrix.
+   * It is guaranteed to always return a clone of the argument.
+   *
+   * Syntax:
+   *
+   *    math.flatten(x)
+   *
+   * Examples:
+   *
+   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]
+   *
+   * See also:
+   *
+   *    concat, resize, size, squeeze
+   *
+   * @param {Matrix | Array} x   Matrix to be flattened
+   * @return {Matrix | Array} Returns the flattened matrix
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return (0, _array.flatten)((0, _object.clone)(x));
+    },
+    Matrix: function Matrix(x) {
+      var flat = (0, _array.flatten)((0, _object.clone)(x.toArray())); // TODO: return the same matrix type as x
+
+      return matrix(flat);
+    }
+  });
+});
+exports.createFlatten = createFlatten;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/forEach.js b/node_modules/mathjs/lib/cjs/function/matrix/forEach.js
new file mode 100644
index 0000000..3b1a4fa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/forEach.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createForEach = void 0;
+
+var _function = require("../../utils/function.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'forEach';
+var dependencies = ['typed'];
+var createForEach = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given callback function.
+   *
+   * Syntax:
+   *
+   *    math.forEach(x, callback)
+   *
+   * Examples:
+   *
+   *    math.forEach([1, 2, 3], function(value) {
+   *      console.log(value)
+   *    })
+   *    // outputs 1, 2, 3
+   *
+   * See also:
+   *
+   *    filter, map, sort
+   *
+   * @param {Matrix | Array} x    The matrix to iterate on.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix/array being traversed.
+   */
+  return typed(name, {
+    'Array, function': _forEach,
+    'Matrix, function': function MatrixFunction(x, callback) {
+      return x.forEach(callback);
+    }
+  });
+});
+/**
+ * forEach for a multi dimensional array
+ * @param {Array} array
+ * @param {Function} callback
+ * @private
+ */
+
+exports.createForEach = createForEach;
+
+function _forEach(array, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = (0, _function.maxArgumentCount)(callback);
+
+  var recurse = function recurse(value, index) {
+    if (Array.isArray(value)) {
+      (0, _array.forEach)(value, function (child, i) {
+        // we create a copy of the index array and append the new index value
+        recurse(child, index.concat(i));
+      });
+    } else {
+      // invoke the callback function with the right number of arguments
+      if (args === 1) {
+        callback(value);
+      } else if (args === 2) {
+        callback(value, index);
+      } else {
+        // 3 or -1
+        callback(value, index, array);
+      }
+    }
+  };
+
+  recurse(array, []);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/cjs/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..9e14167
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/getMatrixDataType.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createGetMatrixDataType = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _array = require("../../utils/array.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'getMatrixDataType';
+var dependencies = ['typed'];
+var createGetMatrixDataType = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Find the data type of all elements in a matrix or array,
+   * for example 'number' if all items are a number and 'Complex' if all values
+   * are complex numbers.
+   * If a matrix contains more than one data type, it will return 'mixed'.
+   *
+   * Syntax:
+   *
+   *    math.getMatrixDataType(x)
+   *
+   * Examples:
+   *
+   *    const x = [ [1, 2, 3], [4, 5, 6] ]
+   *    const mixedX = [ [1, true], [2, 3] ]
+   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3] ]
+   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]
+   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]
+   *    const sparse = math.sparse(x)
+   *    const dense = math.matrix(x)
+   *    math.getMatrixDataType(x)   // returns 'number'
+   *    math.getMatrixDataType(sparse)   // returns 'number'
+   *    math.getMatrixDataType(dense)   // returns 'number'
+   *    math.getMatrixDataType(mixedX) // returns 'mixed'
+   *    math.getMatrixDataType(fractionX) // returns 'Fraction'
+   *    math.getMatrixDataType(unitX) // returns 'Unit'
+   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'
+   *
+   * See also:
+   *  SparseMatrix, DenseMatrix
+   *
+   * @param {...Matrix | Array} x   The Matrix with values.
+   *
+   * @return {string} A string representation of the matrix type
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return (0, _array.getArrayDataType)(x, _is.typeOf);
+    },
+    Matrix: function Matrix(x) {
+      return x.getDataType();
+    }
+  });
+});
+exports.createGetMatrixDataType = createGetMatrixDataType;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/identity.js b/node_modules/mathjs/lib/cjs/function/matrix/identity.js
new file mode 100644
index 0000000..8fb6eaa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/identity.js
@@ -0,0 +1,157 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIdentity = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'identity';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];
+var createIdentity = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      BigNumber = _ref.BigNumber,
+      DenseMatrix = _ref.DenseMatrix,
+      SparseMatrix = _ref.SparseMatrix;
+
+  /**
+   * Create a 2-dimensional identity matrix with size m x n or n x n.
+   * The matrix has ones on the diagonal and zeros elsewhere.
+   *
+   * Syntax:
+   *
+   *    math.identity(n)
+   *    math.identity(n, format)
+   *    math.identity(m, n)
+   *    math.identity(m, n, format)
+   *    math.identity([m, n])
+   *    math.identity([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]
+   *
+   * See also:
+   *
+   *    diag, ones, zeros, size, range
+   *
+   * @param {...number | Matrix | Array} size   The size for the matrix
+   * @param {string} [format]                   The Matrix storage format
+   *
+   * @return {Matrix | Array | number} A matrix with ones on the diagonal.
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function string(format) {
+      return matrix(format);
+    },
+    'number | BigNumber': function numberBigNumber(rows) {
+      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, string': function numberBigNumberString(rows, format) {
+      return _identity(rows, rows, format);
+    },
+    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(rows, cols) {
+      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, number | BigNumber, string': function numberBigNumberNumberBigNumberString(rows, cols, format) {
+      return _identity(rows, cols, format);
+    },
+    Array: function Array(size) {
+      return _identityVector(size);
+    },
+    'Array, string': function ArrayString(size, format) {
+      return _identityVector(size, format);
+    },
+    Matrix: function Matrix(size) {
+      return _identityVector(size.valueOf(), size.storage());
+    },
+    'Matrix, string': function MatrixString(size, format) {
+      return _identityVector(size.valueOf(), format);
+    }
+  });
+
+  function _identityVector(size, format) {
+    switch (size.length) {
+      case 0:
+        return format ? matrix(format) : [];
+
+      case 1:
+        return _identity(size[0], size[0], format);
+
+      case 2:
+        return _identity(size[0], size[1], format);
+
+      default:
+        throw new Error('Vector containing two values expected');
+    }
+  }
+  /**
+   * Create an identity matrix
+   * @param {number | BigNumber} rows
+   * @param {number | BigNumber} cols
+   * @param {string} [format]
+   * @returns {Matrix}
+   * @private
+   */
+
+
+  function _identity(rows, cols, format) {
+    // BigNumber constructor with the right precision
+    var Big = (0, _is.isBigNumber)(rows) || (0, _is.isBigNumber)(cols) ? BigNumber : null;
+    if ((0, _is.isBigNumber)(rows)) rows = rows.toNumber();
+    if ((0, _is.isBigNumber)(cols)) cols = cols.toNumber();
+
+    if (!(0, _number.isInteger)(rows) || rows < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+
+    if (!(0, _number.isInteger)(cols) || cols < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+
+    var one = Big ? new BigNumber(1) : 1;
+    var defaultValue = Big ? new Big(0) : 0;
+    var size = [rows, cols]; // check we need to return a matrix
+
+    if (format) {
+      // create diagonal matrix (use optimized implementation for storage format)
+      if (format === 'sparse') {
+        return SparseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+
+      if (format === 'dense') {
+        return DenseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+
+      throw new TypeError("Unknown matrix type \"".concat(format, "\""));
+    } // create and resize array
+
+
+    var res = (0, _array.resize)([], size, defaultValue); // fill in ones on the diagonal
+
+    var minimum = rows < cols ? rows : cols; // fill diagonal
+
+    for (var d = 0; d < minimum; d++) {
+      res[d][d] = one;
+    }
+
+    return res;
+  }
+});
+exports.createIdentity = createIdentity;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/inv.js b/node_modules/mathjs/lib/cjs/function/matrix/inv.js
new file mode 100644
index 0000000..f08ecf6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/inv.js
@@ -0,0 +1,213 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createInv = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _string = require("../../utils/string.js");
+
+var name = 'inv';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];
+var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      divideScalar = _ref.divideScalar,
+      addScalar = _ref.addScalar,
+      multiply = _ref.multiply,
+      unaryMinus = _ref.unaryMinus,
+      det = _ref.det,
+      identity = _ref.identity,
+      abs = _ref.abs;
+
+  /**
+   * Calculate the inverse of a square matrix.
+   *
+   * Syntax:
+   *
+   *     math.inv(x)
+   *
+   * Examples:
+   *
+   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]
+   *     math.inv(4)                 // returns 0.25
+   *     1 / 4                       // returns 0.25
+   *
+   * See also:
+   *
+   *     det, transpose
+   *
+   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed
+   * @return {number | Complex | Array | Matrix} The inverse of `x`.
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(x) {
+      var size = (0, _is.isMatrix)(x) ? x.size() : (0, _array.arraySize)(x);
+
+      switch (size.length) {
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            if ((0, _is.isMatrix)(x)) {
+              return matrix([divideScalar(1, x.valueOf()[0])]);
+            } else {
+              return [divideScalar(1, x[0])];
+            }
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+          }
+
+        case 2:
+          // two dimensional array
+          {
+            var rows = size[0];
+            var cols = size[1];
+
+            if (rows === cols) {
+              if ((0, _is.isMatrix)(x)) {
+                return matrix(_inv(x.valueOf(), rows, cols), x.storage());
+              } else {
+                // return an Array
+                return _inv(x, rows, cols);
+              }
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+            }
+          }
+
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    },
+    any: function any(x) {
+      // scalar
+      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers
+    }
+  });
+  /**
+   * Calculate the inverse of a square matrix
+   * @param {Array[]} mat     A square matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns, must equal rows
+   * @return {Array[]} inv    Inverse matrix
+   * @private
+   */
+
+  function _inv(mat, rows, cols) {
+    var r, s, f, value, temp;
+
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      value = mat[0][0];
+
+      if (value === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+
+      return [[divideScalar(1, value)]];
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      var d = det(mat);
+
+      if (d === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+
+      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];
+    } else {
+      // this is a matrix of 3 x 3 or larger
+      // calculate inverse using gauss-jordan elimination
+      //      https://en.wikipedia.org/wiki/Gaussian_elimination
+      //      http://mathworld.wolfram.com/MatrixInverse.html
+      //      http://math.uww.edu/~mcfarlat/inverse.htm
+      // make a copy of the matrix (only the arrays, not of the elements)
+      var A = mat.concat();
+
+      for (r = 0; r < rows; r++) {
+        A[r] = A[r].concat();
+      } // create an identity matrix which in the end will contain the
+      // matrix inverse
+
+
+      var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions
+
+      for (var c = 0; c < cols; c++) {
+        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]
+        var ABig = abs(A[c][c]);
+        var rBig = c;
+        r = c + 1;
+
+        while (r < rows) {
+          if (abs(A[r][c]) > ABig) {
+            ABig = abs(A[r][c]);
+            rBig = r;
+          }
+
+          r++;
+        }
+
+        if (ABig === 0) {
+          throw Error('Cannot calculate inverse, determinant is zero');
+        }
+
+        r = rBig;
+
+        if (r !== c) {
+          temp = A[c];
+          A[c] = A[r];
+          A[r] = temp;
+          temp = B[c];
+          B[c] = B[r];
+          B[r] = temp;
+        } // eliminate non-zero values on the other rows at column c
+
+
+        var Ac = A[c];
+        var Bc = B[c];
+
+        for (r = 0; r < rows; r++) {
+          var Ar = A[r];
+          var Br = B[r];
+
+          if (r !== c) {
+            // eliminate value at column c and row r
+            if (Ar[c] !== 0) {
+              f = divideScalar(unaryMinus(Ar[c]), Ac[c]); // add (f * row c) to row r to eliminate the value
+              // at column c
+
+              for (s = c; s < cols; s++) {
+                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));
+              }
+
+              for (s = 0; s < cols; s++) {
+                Br[s] = addScalar(Br[s], multiply(f, Bc[s]));
+              }
+            }
+          } else {
+            // normalize value at Acc to 1,
+            // divide each value on row r with the value at Acc
+            f = Ac[c];
+
+            for (s = c; s < cols; s++) {
+              Ar[s] = divideScalar(Ar[s], f);
+            }
+
+            for (s = 0; s < cols; s++) {
+              Br[s] = divideScalar(Br[s], f);
+            }
+          }
+        }
+      }
+
+      return B;
+    }
+  }
+});
+exports.createInv = createInv;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/kron.js b/node_modules/mathjs/lib/cjs/function/matrix/kron.js
new file mode 100644
index 0000000..2437993
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/kron.js
@@ -0,0 +1,97 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createKron = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'kron';
+var dependencies = ['typed', 'matrix', 'multiplyScalar'];
+var createKron = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      multiplyScalar = _ref.multiplyScalar;
+
+  /**
+     * Calculates the kronecker product of 2 matrices or vectors.
+     *
+     * NOTE: If a one dimensional vector / matrix is given, it will be
+     * wrapped so its two dimensions.
+     * See the examples.
+     *
+     * Syntax:
+     *
+     *    math.kron(x, y)
+     *
+     * Examples:
+     *
+     *    math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])
+     *    // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]
+     *
+     *    math.kron([1,1], [2,3,4])
+     *    // returns [ [ 2, 3, 4, 2, 3, 4 ] ]
+     *
+     * See also:
+     *
+     *    multiply, dot, cross
+     *
+     * @param  {Array | Matrix} x     First vector
+     * @param  {Array | Matrix} y     Second vector
+     * @return {Array | Matrix}       Returns the kronecker product of `x` and `y`
+     */
+  return typed(name, {
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      return matrix(_kron(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      return matrix(_kron(x.toArray(), y));
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      return matrix(_kron(x, y.toArray()));
+    },
+    'Array, Array': _kron
+  });
+  /**
+     * Calculate the kronecker product of two matrices / vectors
+     * @param {Array} a  First vector
+     * @param {Array} b  Second vector
+     * @returns {Array} Returns the kronecker product of x and y
+     * @private
+     */
+
+  function _kron(a, b) {
+    // Deal with the dimensions of the matricies.
+    if ((0, _array.arraySize)(a).length === 1) {
+      // Wrap it in a 2D Matrix
+      a = [a];
+    }
+
+    if ((0, _array.arraySize)(b).length === 1) {
+      // Wrap it in a 2D Matrix
+      b = [b];
+    }
+
+    if ((0, _array.arraySize)(a).length > 2 || (0, _array.arraySize)(b).length > 2) {
+      throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');
+    }
+
+    var t = [];
+    var r = [];
+    return a.map(function (a) {
+      return b.map(function (b) {
+        r = [];
+        t.push(r);
+        return a.map(function (y) {
+          return b.map(function (x) {
+            return r.push(multiplyScalar(y, x));
+          });
+        });
+      });
+    }) && t;
+  }
+});
+exports.createKron = createKron;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/map.js b/node_modules/mathjs/lib/cjs/function/matrix/map.js
new file mode 100644
index 0000000..f0d10d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/map.js
@@ -0,0 +1,120 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMap = void 0;
+
+var _function = require("../../utils/function.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'map';
+var dependencies = ['typed'];
+var createMap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Create a new matrix or array with the results of a callback function executed on
+   * each entry of a given matrix/array.
+   *
+   * For each entry of the input, the callback is invoked with three arguments:
+   * the value of the entry, the index at which that entry occurs, and the full
+   * matrix/array being traversed. Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.map(x, callback)
+   *
+   * Examples:
+   *
+   *    math.map([1, 2, 3], function(value) {
+   *      return value * value
+   *    })  // returns [1, 4, 9]
+   *
+   *    // The calling convention for the callback can cause subtleties:
+   *    math.map([1, 2, 3], math.format)
+   *    // throws TypeError: map attempted to call 'format(1,[0])' but argument 2 of type Array does not match expected type number or function or Object or string or boolean
+   *    // [This happens because `format` _can_ take a second argument,
+   *    // but its semantics don't match that of the 2nd argument `map` provides]
+   *
+   *    // To avoid this error, use a function that takes exactly the
+   *    // desired arguments:
+   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']
+   *
+   * See also:
+   *
+   *    filter, forEach, sort
+   *
+   * @param {Matrix | Array} x    The input to iterate on.
+   * @param {Function} callback
+   *     The function to call (as described above) on each entry of the input
+   * @return {Matrix | array}
+   *     Transformed map of x; always has the same type and shape as x
+   */
+  return typed(name, {
+    'Array, function': _map,
+    'Matrix, function': function MatrixFunction(x, callback) {
+      return x.map(callback);
+    }
+  });
+});
+/**
+ * Map for a multi dimensional array
+ * @param {Array} array
+ * @param {Function} callback
+ * @return {Array}
+ * @private
+ */
+
+exports.createMap = createMap;
+
+function _map(array, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = (0, _function.maxArgumentCount)(callback);
+
+  var recurse = function recurse(value, index) {
+    if (Array.isArray(value)) {
+      return value.map(function (child, i) {
+        // we create a copy of the index array and append the new index value
+        return recurse(child, index.concat(i));
+      });
+    } else {
+      try {
+        // invoke the callback function with the right number of arguments
+        if (args === 1) {
+          return callback(value);
+        } else if (args === 2) {
+          return callback(value, index);
+        } else {
+          // 3 or -1
+          return callback(value, index, array);
+        }
+      } catch (err) {
+        // But maybe the arguments still weren't right
+        if (err instanceof TypeError && 'data' in err && err.data.category === 'wrongType') {
+          var newmsg = "map attempted to call '".concat(err.data.fn, "(").concat(value);
+          var indexString = JSON.stringify(index);
+
+          if (args === 2) {
+            newmsg += ',' + indexString;
+          } else if (args !== 1) {
+            newmsg += ",".concat(indexString, ",").concat(array);
+          }
+
+          newmsg += ")' but argument ".concat(err.data.index + 1, " of type ");
+          newmsg += "".concat(err.data.actual, " does not match expected type ");
+          newmsg += err.data.expected.join(' or ');
+          throw new TypeError(newmsg);
+        }
+
+        throw err;
+      }
+    }
+  };
+
+  return recurse(array, []);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..4ca7da0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromColumns.js
@@ -0,0 +1,118 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixFromColumns = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+var name = 'matrixFromColumns';
+var dependencies = ['typed', 'matrix', 'flatten', 'size'];
+var createMatrixFromColumns = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      flatten = _ref.flatten,
+      size = _ref.size;
+
+  /**
+   * Create a dense matrix from vectors as individual columns.
+   * If you pass row vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromColumns(...arr)
+   *    math.matrixFromColumns(col1, col2)
+   *    math.matrixFromColumns(col1, col2, col3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromColumns(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromRows, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} cols Multiple columns
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function Array(arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function Matrix(arr) {
+      return matrix(_createArray(arr.map(function (m) {
+        return m.toArray();
+      })));
+    } // TODO implement this properly for SparseMatrix
+
+  });
+
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');
+    var N = checkVectorTypeAndReturnLength(arr[0]); // create an array with empty rows
+
+    var result = [];
+
+    for (var i = 0; i < N; i++) {
+      result[i] = [];
+    } // loop columns
+
+
+    var _iterator = _createForOfIteratorHelper(arr),
+        _step;
+
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var col = _step.value;
+        var colLength = checkVectorTypeAndReturnLength(col);
+
+        if (colLength !== N) {
+          throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));
+        }
+
+        var f = flatten(col); // push a value to each row
+
+        for (var _i = 0; _i < N; _i++) {
+          result[_i].push(f[_i]);
+        }
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+
+    return result;
+  }
+
+  function checkVectorTypeAndReturnLength(vec) {
+    var s = size(vec);
+
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
+exports.createMatrixFromColumns = createMatrixFromColumns;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..21c32a6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromFunction.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixFromFunction = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'matrixFromFunction';
+var dependencies = ['typed', 'matrix', 'isZero'];
+var createMatrixFromFunction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      isZero = _ref.isZero;
+
+  /**
+   * Create a matrix by evaluating a generating function at each index.
+   * The simplest overload returns a multi-dimensional array as long as `size` is an array.
+   * Passing `size` as a Matrix or specifying a `format` will result in returning a Matrix.
+   *
+   * Syntax:
+   *
+   *    math.matrixFromFunction(size, fn)
+   *    math.matrixFromFunction(size, fn, format)
+   *    math.matrixFromFunction(size, fn, format, datatype)
+   *    math.matrixFromFunction(size, format, fn)
+   *    math.matrixFromFunction(size, format, datatype, fn)
+   *
+   * Examples:
+   *
+   *    math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix
+   *    math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix
+   *    math.matrixFromFunction([5], i => math.random()) // a random vector
+   *
+   * See also:
+   *
+   *    matrix, zeros
+   *
+   * @param {Array | Matrix} size   The size of the matrix to be created
+   * @param {function} fn           Callback function invoked for every entry in the matrix
+   * @param {string} [format]       The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]     Type of the values
+   * @return {Array | Matrix} Returns the created matrix
+   */
+  return typed(name, {
+    'Array | Matrix, function, string, string': function ArrayMatrixFunctionStringString(size, fn, format, datatype) {
+      return _create(size, fn, format, datatype);
+    },
+    'Array | Matrix, function, string': function ArrayMatrixFunctionString(size, fn, format) {
+      return _create(size, fn, format);
+    },
+    'Matrix, function': function MatrixFunction(size, fn) {
+      return _create(size, fn, 'dense');
+    },
+    'Array, function': function ArrayFunction(size, fn) {
+      return _create(size, fn, 'dense').toArray();
+    },
+    'Array | Matrix, string, function': function ArrayMatrixStringFunction(size, format, fn) {
+      return _create(size, fn, format);
+    },
+    'Array | Matrix, string, string, function': function ArrayMatrixStringStringFunction(size, format, datatype, fn) {
+      return _create(size, fn, format, datatype);
+    }
+  });
+
+  function _create(size, fn, format, datatype) {
+    var m;
+
+    if (datatype !== undefined) {
+      m = matrix(format, datatype);
+    } else {
+      m = matrix(format);
+    }
+
+    m.resize(size);
+    m.forEach(function (_, index) {
+      var val = fn(index);
+      if (isZero(val)) return;
+      m.set(index, val);
+    });
+    return m;
+  }
+});
+exports.createMatrixFromFunction = createMatrixFromFunction;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..a71107d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromRows.js
@@ -0,0 +1,108 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixFromRows = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+var name = 'matrixFromRows';
+var dependencies = ['typed', 'matrix', 'flatten', 'size'];
+var createMatrixFromRows = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      flatten = _ref.flatten,
+      size = _ref.size;
+
+  /**
+   * Create a dense matrix from vectors as individual rows.
+   * If you pass column vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromRows(...arr)
+   *    math.matrixFromRows(row1, row2)
+   *    math.matrixFromRows(row1, row2, row3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromRows([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromRows(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromColumns, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} rows  Multiple rows
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function Array(arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function Matrix(arr) {
+      return matrix(_createArray(arr.map(function (m) {
+        return m.toArray();
+      })));
+    } // TODO implement this properly for SparseMatrix
+
+  });
+
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.');
+    var N = checkVectorTypeAndReturnLength(arr[0]);
+    var result = [];
+
+    var _iterator = _createForOfIteratorHelper(arr),
+        _step;
+
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var row = _step.value;
+        var rowLength = checkVectorTypeAndReturnLength(row);
+
+        if (rowLength !== N) {
+          throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0));
+        }
+
+        result.push(flatten(row));
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+
+    return result;
+  }
+
+  function checkVectorTypeAndReturnLength(vec) {
+    var s = size(vec);
+
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
+exports.createMatrixFromRows = createMatrixFromRows;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/ones.js b/node_modules/mathjs/lib/cjs/function/matrix/ones.js
new file mode 100644
index 0000000..c4948b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/ones.js
@@ -0,0 +1,141 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOnes = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _number = require("../../utils/number.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ones';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      BigNumber = _ref.BigNumber;
+
+  /**
+   * Create a matrix filled with ones. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.ones(m)
+   *    math.ones(m, format)
+   *    math.ones(m, n)
+   *    math.ones(m, n, format)
+   *    math.ones([m, n])
+   *    math.ones([m, n], format)
+   *    math.ones([m, n, p, ...])
+   *    math.ones([m, n, p, ...], format)
+   *
+   * Examples:
+   *
+   *    math.ones(3)                   // returns [1, 1, 1]
+   *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]
+   *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]
+   *
+   * See also:
+   *
+   *    zeros, identity, size, range
+   *
+   * @param {...number | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix | number}  A matrix filled with ones
+   */
+  return typed('ones', {
+    '': function _() {
+      return config.matrix === 'Array' ? _ones([]) : _ones([], 'default');
+    },
+    // math.ones(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function numberBigNumberString(size) {
+      var last = size[size.length - 1];
+
+      if (typeof last === 'string') {
+        var format = size.pop();
+        return _ones(size, format);
+      } else if (config.matrix === 'Array') {
+        return _ones(size);
+      } else {
+        return _ones(size, 'default');
+      }
+    },
+    Array: _ones,
+    Matrix: function Matrix(size) {
+      var format = size.storage();
+      return _ones(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function ArrayMatrixString(size, format) {
+      return _ones(size.valueOf(), format);
+    }
+  });
+  /**
+   * Create an Array or Matrix with ones
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+
+  function _ones(size, format) {
+    var hasBigNumbers = _normalize(size);
+
+    var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;
+
+    _validate(size);
+
+    if (format) {
+      // return a matrix
+      var m = matrix(format);
+
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+
+      return m;
+    } else {
+      // return an Array
+      var arr = [];
+
+      if (size.length > 0) {
+        return (0, _array.resize)(arr, size, defaultValue);
+      }
+
+      return arr;
+    }
+  } // replace BigNumbers with numbers, returns true if size contained BigNumbers
+
+
+  function _normalize(size) {
+    var hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if ((0, _is.isBigNumber)(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  } // validate arguments
+
+
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !(0, _number.isInteger)(value) || value < 0) {
+        throw new Error('Parameters in function ones must be positive integers');
+      }
+    });
+  }
+});
+exports.createOnes = createOnes;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/cjs/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..334e085
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/partitionSelect.js
@@ -0,0 +1,157 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPartitionSelect = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'partitionSelect';
+var dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];
+var createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      isNumeric = _ref.isNumeric,
+      isNaN = _ref.isNaN,
+      compare = _ref.compare;
+  var asc = compare;
+
+  var desc = function desc(a, b) {
+    return -compare(a, b);
+  };
+  /**
+   * Partition-based selection of an array or 1D matrix.
+   * Will find the kth smallest value, and mutates the input array.
+   * Uses Quickselect.
+   *
+   * Syntax:
+   *
+   *    math.partitionSelect(x, k)
+   *    math.partitionSelect(x, k, compare)
+   *
+   * Examples:
+   *
+   *    math.partitionSelect([5, 10, 1], 2)           // returns 10
+   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1) // returns 'B'
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'
+   *
+   * See also:
+   *
+   *    sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Number} k            The kth smallest value to be retrieved zero-based index
+   * @param {Function | 'asc' | 'desc'} [compare='asc']
+   *        An optional comparator function. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {*} Returns the kth lowest value.
+   */
+
+
+  return typed(name, {
+    'Array | Matrix, number': function ArrayMatrixNumber(x, k) {
+      return _partitionSelect(x, k, asc);
+    },
+    'Array | Matrix, number, string': function ArrayMatrixNumberString(x, k, compare) {
+      if (compare === 'asc') {
+        return _partitionSelect(x, k, asc);
+      } else if (compare === 'desc') {
+        return _partitionSelect(x, k, desc);
+      } else {
+        throw new Error('Compare string must be "asc" or "desc"');
+      }
+    },
+    'Array | Matrix, number, function': _partitionSelect
+  });
+
+  function _partitionSelect(x, k, compare) {
+    if (!(0, _number.isInteger)(k) || k < 0) {
+      throw new Error('k must be a non-negative integer');
+    }
+
+    if ((0, _is.isMatrix)(x)) {
+      var size = x.size();
+
+      if (size.length > 1) {
+        throw new Error('Only one dimensional matrices supported');
+      }
+
+      return quickSelect(x.valueOf(), k, compare);
+    }
+
+    if (Array.isArray(x)) {
+      return quickSelect(x, k, compare);
+    }
+  }
+  /**
+   * Quickselect algorithm.
+   * Code adapted from:
+   * https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html
+   *
+   * @param {Array} arr
+   * @param {Number} k
+   * @param {Function} compare
+   * @private
+   */
+
+
+  function quickSelect(arr, k, compare) {
+    if (k >= arr.length) {
+      throw new Error('k out of bounds');
+    } // check for NaN values since these can cause an infinite while loop
+
+
+    for (var i = 0; i < arr.length; i++) {
+      if (isNumeric(arr[i]) && isNaN(arr[i])) {
+        return arr[i]; // return NaN
+      }
+    }
+
+    var from = 0;
+    var to = arr.length - 1; // if from == to we reached the kth element
+
+    while (from < to) {
+      var r = from;
+      var w = to;
+      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]; // stop if the reader and writer meets
+
+      while (r < w) {
+        // arr[r] >= pivot
+        if (compare(arr[r], pivot) >= 0) {
+          // put the large values at the end
+          var tmp = arr[w];
+          arr[w] = arr[r];
+          arr[r] = tmp;
+          --w;
+        } else {
+          // the value is smaller than the pivot, skip
+          ++r;
+        }
+      } // if we stepped up (r++) we need to step one down (arr[r] > pivot)
+
+
+      if (compare(arr[r], pivot) > 0) {
+        --r;
+      } // the r pointer is on the end of the first k elements
+
+
+      if (k <= r) {
+        to = r;
+      } else {
+        from = r + 1;
+      }
+    }
+
+    return arr[k];
+  }
+});
+exports.createPartitionSelect = createPartitionSelect;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/range.js b/node_modules/mathjs/lib/cjs/function/matrix/range.js
new file mode 100644
index 0000000..310b2a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/range.js
@@ -0,0 +1,289 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRange = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _noop = require("../../utils/noop.js");
+
+var name = 'range';
+var dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];
+var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      bignumber = _ref.bignumber,
+      smaller = _ref.smaller,
+      smallerEq = _ref.smallerEq,
+      larger = _ref.larger,
+      largerEq = _ref.largerEq;
+
+  /**
+   * Create an array from a range.
+   * By default, the range end is excluded. This can be customized by providing
+   * an extra parameter `includeEnd`.
+   *
+   * Syntax:
+   *
+   *     math.range(str [, includeEnd])               // Create a range from a string,
+   *                                                  // where the string contains the
+   *                                                  // start, optional step, and end,
+   *                                                  // separated by a colon.
+   *     math.range(start, end [, includeEnd])        // Create a range with start and
+   *                                                  // end and a step size of 1.
+   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,
+   *                                                  // and end.
+   *
+   * Where:
+   *
+   * - `str: string`
+   *   A string 'start:end' or 'start:step:end'
+   * - `start: {number | BigNumber}`
+   *   Start of the range
+   * - `end: number | BigNumber`
+   *   End of the range, excluded by default, included when parameter includeEnd=true
+   * - `step: number | BigNumber`
+   *   Step size. Default value is 1.
+   * - `includeEnd: boolean`
+   *   Option to specify whether to include the end or not. False by default.
+   *
+   * Examples:
+   *
+   *     math.range(2, 6)        // [2, 3, 4, 5]
+   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]
+   *     math.range('2:1:6')     // [2, 3, 4, 5]
+   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]
+   *
+   * See also:
+   *
+   *     ones, zeros, size, subset
+   *
+   * @param {*} args   Parameters describing the ranges `start`, `end`, and optional `step`.
+   * @return {Array | Matrix} range
+   */
+  return typed(name, {
+    // TODO: simplify signatures when typed-function supports default values and optional arguments
+    // TODO: a number or boolean should not be converted to string here
+    string: _strRange,
+    'string, boolean': _strRange,
+    'number, number': function numberNumber(start, end) {
+      return _out(_rangeEx(start, end, 1));
+    },
+    'number, number, number': function numberNumberNumber(start, end, step) {
+      return _out(_rangeEx(start, end, step));
+    },
+    'number, number, boolean': function numberNumberBoolean(start, end, includeEnd) {
+      return includeEnd ? _out(_rangeInc(start, end, 1)) : _out(_rangeEx(start, end, 1));
+    },
+    'number, number, number, boolean': function numberNumberNumberBoolean(start, end, step, includeEnd) {
+      return includeEnd ? _out(_rangeInc(start, end, step)) : _out(_rangeEx(start, end, step));
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(start, end) {
+      var BigNumber = start.constructor;
+      return _out(_bigRangeEx(start, end, new BigNumber(1)));
+    },
+    'BigNumber, BigNumber, BigNumber': function BigNumberBigNumberBigNumber(start, end, step) {
+      return _out(_bigRangeEx(start, end, step));
+    },
+    'BigNumber, BigNumber, boolean': function BigNumberBigNumberBoolean(start, end, includeEnd) {
+      var BigNumber = start.constructor;
+      return includeEnd ? _out(_bigRangeInc(start, end, new BigNumber(1))) : _out(_bigRangeEx(start, end, new BigNumber(1)));
+    },
+    'BigNumber, BigNumber, BigNumber, boolean': function BigNumberBigNumberBigNumberBoolean(start, end, step, includeEnd) {
+      return includeEnd ? _out(_bigRangeInc(start, end, step)) : _out(_bigRangeEx(start, end, step));
+    }
+  });
+
+  function _out(arr) {
+    if (config.matrix === 'Matrix') {
+      return matrix ? matrix(arr) : (0, _noop.noMatrix)();
+    }
+
+    return arr;
+  }
+
+  function _strRange(str, includeEnd) {
+    var r = _parse(str);
+
+    if (!r) {
+      throw new SyntaxError('String "' + str + '" is no valid range');
+    }
+
+    var fn;
+
+    if (config.number === 'BigNumber') {
+      if (bignumber === undefined) {
+        (0, _noop.noBignumber)();
+      }
+
+      fn = includeEnd ? _bigRangeInc : _bigRangeEx;
+      return _out(fn(bignumber(r.start), bignumber(r.end), bignumber(r.step)));
+    } else {
+      fn = includeEnd ? _rangeInc : _rangeEx;
+      return _out(fn(r.start, r.end, r.step));
+    }
+  }
+  /**
+   * Create a range with numbers. End is excluded
+   * @param {number} start
+   * @param {number} end
+   * @param {number} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _rangeEx(start, end, step) {
+    var array = [];
+    var x = start;
+
+    if (step > 0) {
+      while (smaller(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    } else if (step < 0) {
+      while (larger(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Create a range with numbers. End is included
+   * @param {number} start
+   * @param {number} end
+   * @param {number} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _rangeInc(start, end, step) {
+    var array = [];
+    var x = start;
+
+    if (step > 0) {
+      while (smallerEq(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    } else if (step < 0) {
+      while (largerEq(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Create a range with big numbers. End is excluded
+   * @param {BigNumber} start
+   * @param {BigNumber} end
+   * @param {BigNumber} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _bigRangeEx(start, end, step) {
+    var zero = bignumber(0);
+    var array = [];
+    var x = start;
+
+    if (step.gt(zero)) {
+      while (smaller(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    } else if (step.lt(zero)) {
+      while (larger(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Create a range with big numbers. End is included
+   * @param {BigNumber} start
+   * @param {BigNumber} end
+   * @param {BigNumber} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _bigRangeInc(start, end, step) {
+    var zero = bignumber(0);
+    var array = [];
+    var x = start;
+
+    if (step.gt(zero)) {
+      while (smallerEq(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    } else if (step.lt(zero)) {
+      while (largerEq(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @param {string} str
+   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step
+   * @private
+   */
+
+
+  function _parse(str) {
+    var args = str.split(':'); // number
+
+    var nums = args.map(function (arg) {
+      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string
+      return Number(arg);
+    });
+    var invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+
+    if (invalid) {
+      return null;
+    }
+
+    switch (nums.length) {
+      case 2:
+        return {
+          start: nums[0],
+          end: nums[1],
+          step: 1
+        };
+
+      case 3:
+        return {
+          start: nums[0],
+          end: nums[2],
+          step: nums[1]
+        };
+
+      default:
+        return null;
+    }
+  }
+});
+exports.createRange = createRange;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/reshape.js b/node_modules/mathjs/lib/cjs/function/matrix/reshape.js
new file mode 100644
index 0000000..eb1beb8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/reshape.js
@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReshape = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'reshape';
+var dependencies = ['typed', 'isInteger', 'matrix'];
+var createReshape = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      isInteger = _ref.isInteger;
+
+  /**
+   * Reshape a multi dimensional array to fit the specified dimensions
+   *
+   * Syntax:
+   *
+   *     math.reshape(x, sizes)
+   *
+   * Examples:
+   *
+   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])
+   *     // returns Array  [[1, 2, 3], [4, 5, 6]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [1, 4])
+   *     // returns Array  [[1, 2, 3, 4]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [4])
+   *     // returns Array [1, 2, 3, 4]
+   *
+   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])
+   *     math.reshape(x, [2, 2, 2])
+   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]
+   *
+   *    math.reshape([1, 2, 3, 4], [-1, 2])
+   *    // returns Matrix [[1, 2], [3, 4]]
+   *
+   * See also:
+   *
+   *     size, squeeze, resize
+   *
+   * @param {Array | Matrix | *} x  Matrix to be reshaped
+   * @param {number[]} sizes        One dimensional array with integral sizes for
+   *                                each dimension. One -1 is allowed as wildcard,
+   *                                which calculates this dimension automatically.
+   *
+   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`
+   *
+   * @throws {TypeError}            If `sizes` does not contain solely integers
+   * @throws {DimensionError}       If the product of the new dimension sizes does
+   *                                not equal that of the old ones
+   */
+  return typed(name, {
+    'Matrix, Array': function MatrixArray(x, sizes) {
+      return x.reshape(sizes);
+    },
+    'Array, Array': function ArrayArray(x, sizes) {
+      sizes.forEach(function (size) {
+        if (!isInteger(size)) {
+          throw new TypeError('Invalid size for dimension: ' + size);
+        }
+      });
+      return (0, _array.reshape)(x, sizes);
+    }
+  });
+});
+exports.createReshape = createReshape;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/resize.js b/node_modules/mathjs/lib/cjs/function/matrix/resize.js
new file mode 100644
index 0000000..fe8b6ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/resize.js
@@ -0,0 +1,147 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createResize = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _DimensionError = require("../../error/DimensionError.js");
+
+var _ArgumentsError = require("../../error/ArgumentsError.js");
+
+var _number = require("../../utils/number.js");
+
+var _string = require("../../utils/string.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'resize';
+var dependencies = ['config', 'matrix'];
+var createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var config = _ref.config,
+      matrix = _ref.matrix;
+
+  /**
+   * Resize a matrix
+   *
+   * Syntax:
+   *
+   *     math.resize(x, size)
+   *     math.resize(x, size, defaultValue)
+   *
+   * Examples:
+   *
+   *     math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]
+   *     math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]
+   *     math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]
+   *     math.resize("hello", [8], "!")    // returns string 'hello!!!'
+   *
+   * See also:
+   *
+   *     size, squeeze, subset, reshape
+   *
+   * @param {Array | Matrix | *} x             Matrix to be resized
+   * @param {Array | Matrix} size              One dimensional array with numbers
+   * @param {number | string} [defaultValue=0] Zero by default, except in
+   *                                           case of a string, in that case
+   *                                           defaultValue = ' '
+   * @return {* | Array | Matrix} A resized clone of matrix `x`
+   */
+  // TODO: rework resize to a typed-function
+  return function resize(x, size, defaultValue) {
+    if (arguments.length !== 2 && arguments.length !== 3) {
+      throw new _ArgumentsError.ArgumentsError('resize', arguments.length, 2, 3);
+    }
+
+    if ((0, _is.isMatrix)(size)) {
+      size = size.valueOf(); // get Array
+    }
+
+    if ((0, _is.isBigNumber)(size[0])) {
+      // convert bignumbers to numbers
+      size = size.map(function (value) {
+        return !(0, _is.isBigNumber)(value) ? value : value.toNumber();
+      });
+    } // check x is a Matrix
+
+
+    if ((0, _is.isMatrix)(x)) {
+      // use optimized matrix implementation, return copy
+      return x.resize(size, defaultValue, true);
+    }
+
+    if (typeof x === 'string') {
+      // resize string
+      return _resizeString(x, size, defaultValue);
+    } // check result should be a matrix
+
+
+    var asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';
+
+    if (size.length === 0) {
+      // output a scalar
+      while (Array.isArray(x)) {
+        x = x[0];
+      }
+
+      return (0, _object.clone)(x);
+    } else {
+      // output an array/matrix
+      if (!Array.isArray(x)) {
+        x = [x];
+      }
+
+      x = (0, _object.clone)(x);
+      var res = (0, _array.resize)(x, size, defaultValue);
+      return asMatrix ? matrix(res) : res;
+    }
+  };
+  /**
+   * Resize a string
+   * @param {string} str
+   * @param {number[]} size
+   * @param {string} [defaultChar=' ']
+   * @private
+   */
+
+  function _resizeString(str, size, defaultChar) {
+    if (defaultChar !== undefined) {
+      if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {
+        throw new TypeError('Single character expected as defaultValue');
+      }
+    } else {
+      defaultChar = ' ';
+    }
+
+    if (size.length !== 1) {
+      throw new _DimensionError.DimensionError(size.length, 1);
+    }
+
+    var len = size[0];
+
+    if (typeof len !== 'number' || !(0, _number.isInteger)(len)) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(size) + ')');
+    }
+
+    if (str.length > len) {
+      return str.substring(0, len);
+    } else if (str.length < len) {
+      var res = str;
+
+      for (var i = 0, ii = len - str.length; i < ii; i++) {
+        res += defaultChar;
+      }
+
+      return res;
+    } else {
+      return str;
+    }
+  }
+});
+exports.createResize = createResize;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/rotate.js b/node_modules/mathjs/lib/cjs/function/matrix/rotate.js
new file mode 100644
index 0000000..30689d7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/rotate.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRotate = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _array = require("../../utils/array.js");
+
+var name = 'rotate';
+var dependencies = ['typed', 'multiply', 'rotationMatrix'];
+var createRotate = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      multiply = _ref.multiply,
+      rotationMatrix = _ref.rotationMatrix;
+
+  /**
+     * Rotate a vector of size 1x2 counter-clockwise by a given angle
+     * Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis
+     *
+     * Syntax:
+     *
+     *    math.rotate(w, theta)
+     *    math.rotate(w, theta, v)
+     *
+     * Examples:
+     *
+     *    math.rotate([11, 12], math.pi / 2)                           // returns matrix([-12, 11])
+     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns matrix([-12, 11])
+     *
+     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns matrix([0, 1, 0])
+     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns matrix([0, 1, 0])
+     *
+     *    math.rotate([1, 0], math.complex(1 + i))                     // returns matrix([cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)])
+     *
+     * See also:
+     *
+     *    matrix, rotationMatrix
+     *
+     * @param {Array | Matrix} w                             Vector to rotate
+     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+     * @param {Array | Matrix} [v]                           Rotation axis
+     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w
+     */
+  return typed(name, {
+    'Array , number | BigNumber | Complex | Unit': function ArrayNumberBigNumberComplexUnit(w, theta) {
+      _validateSize(w, 2);
+
+      var matrixRes = multiply(rotationMatrix(theta), w);
+      return matrixRes.toArray();
+    },
+    'Matrix , number | BigNumber | Complex | Unit': function MatrixNumberBigNumberComplexUnit(w, theta) {
+      _validateSize(w, 2);
+
+      return multiply(rotationMatrix(theta), w);
+    },
+    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function ArrayNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {
+      _validateSize(w, 3);
+
+      var matrixRes = multiply(rotationMatrix(theta, v), w);
+      return matrixRes;
+    },
+    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function MatrixNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {
+      _validateSize(w, 3);
+
+      return multiply(rotationMatrix(theta, v), w);
+    }
+  });
+
+  function _validateSize(v, expectedSize) {
+    var actualSize = Array.isArray(v) ? (0, _array.arraySize)(v) : v.size();
+
+    if (actualSize.length > 2) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+
+    if (actualSize.length === 2 && actualSize[1] !== 1) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+
+    if (actualSize[0] !== expectedSize) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+  }
+});
+exports.createRotate = createRotate;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/cjs/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..ea16357
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/rotationMatrix.js
@@ -0,0 +1,186 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRotationMatrix = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'rotationMatrix';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];
+var createRotationMatrix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      multiplyScalar = _ref.multiplyScalar,
+      addScalar = _ref.addScalar,
+      unaryMinus = _ref.unaryMinus,
+      norm = _ref.norm,
+      BigNumber = _ref.BigNumber,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix,
+      SparseMatrix = _ref.SparseMatrix,
+      cos = _ref.cos,
+      sin = _ref.sin;
+
+  /**
+   * Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).
+   * Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).
+   *
+   * Syntax:
+   *
+   *    math.rotationMatrix(theta)
+   *    math.rotationMatrix(theta, format)
+   *    math.rotationMatrix(theta, [v])
+   *    math.rotationMatrix(theta, [v], format)
+   *
+   * Examples:
+   *
+   *    math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]
+   *    math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]
+   *    math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]
+   *    math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]
+   *
+   *    math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]
+   *    math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])
+   *
+   *
+   * See also:
+   *
+   *    matrix, cos, sin
+   *
+   *
+   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+   * @param {Array | Matrix} [v]                           Rotation axis
+   * @param {string} [format]                              Result Matrix storage format
+   * @return {Array | Matrix}                              Rotation matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function string(format) {
+      return matrix(format);
+    },
+    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(theta) {
+      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber | Complex | Unit, string': function numberBigNumberComplexUnitString(theta, format) {
+      return _rotationMatrix2x2(theta, format);
+    },
+    'number | BigNumber | Complex | Unit, Array': function numberBigNumberComplexUnitArray(theta, v) {
+      var matrixV = matrix(v);
+
+      _validateVector(matrixV);
+
+      return _rotationMatrix3x3(theta, matrixV, undefined);
+    },
+    'number | BigNumber | Complex | Unit, Matrix': function numberBigNumberComplexUnitMatrix(theta, v) {
+      _validateVector(v);
+
+      var storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined);
+      return _rotationMatrix3x3(theta, v, storageType);
+    },
+    'number | BigNumber | Complex | Unit, Array, string': function numberBigNumberComplexUnitArrayString(theta, v, format) {
+      var matrixV = matrix(v);
+
+      _validateVector(matrixV);
+
+      return _rotationMatrix3x3(theta, matrixV, format);
+    },
+    'number | BigNumber | Complex | Unit, Matrix, string': function numberBigNumberComplexUnitMatrixString(theta, v, format) {
+      _validateVector(v);
+
+      return _rotationMatrix3x3(theta, v, format);
+    }
+  });
+  /**
+   * Returns 2x2 matrix of 2D rotation of angle theta
+   *
+   * @param {number | BigNumber | Complex | Unit} theta  The rotation angle
+   * @param {string} format                              The result Matrix storage format
+   * @returns {Matrix}
+   * @private
+   */
+
+  function _rotationMatrix2x2(theta, format) {
+    var Big = (0, _is.isBigNumber)(theta);
+    var minusOne = Big ? new BigNumber(-1) : -1;
+    var cosTheta = cos(theta);
+    var sinTheta = sin(theta);
+    var data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]];
+    return _convertToFormat(data, format);
+  }
+
+  function _validateVector(v) {
+    var size = v.size();
+
+    if (size.length < 1 || size[0] !== 3) {
+      throw new RangeError('Vector must be of dimensions 1x3');
+    }
+  }
+
+  function _mul(array) {
+    return array.reduce(function (p, curr) {
+      return multiplyScalar(p, curr);
+    });
+  }
+
+  function _convertToFormat(data, format) {
+    if (format) {
+      if (format === 'sparse') {
+        return new SparseMatrix(data);
+      }
+
+      if (format === 'dense') {
+        return new DenseMatrix(data);
+      }
+
+      throw new TypeError("Unknown matrix type \"".concat(format, "\""));
+    }
+
+    return data;
+  }
+  /**
+   * Returns a 3x3 matrix of rotation of angle theta around vector v
+   *
+   * @param {number | BigNumber | Complex | Unit} theta The rotation angle
+   * @param {Matrix} v                                  The rotation axis vector
+   * @param {string} format                             The storage format of the resulting matrix
+   * @returns {Matrix}
+   * @private
+   */
+
+
+  function _rotationMatrix3x3(theta, v, format) {
+    var normV = norm(v);
+
+    if (normV === 0) {
+      throw new RangeError('Rotation around zero vector');
+    }
+
+    var Big = (0, _is.isBigNumber)(theta) ? BigNumber : null;
+    var one = Big ? new Big(1) : 1;
+    var minusOne = Big ? new Big(-1) : -1;
+    var vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV;
+    var vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV;
+    var vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV;
+    var c = cos(theta);
+    var oneMinusC = addScalar(one, unaryMinus(c));
+    var s = sin(theta);
+    var r11 = addScalar(c, _mul([vx, vx, oneMinusC]));
+    var r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]));
+    var r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]));
+    var r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]));
+    var r22 = addScalar(c, _mul([vy, vy, oneMinusC]));
+    var r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]));
+    var r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]));
+    var r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]));
+    var r33 = addScalar(c, _mul([vz, vz, oneMinusC]));
+    var data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]];
+    return _convertToFormat(data, format);
+  }
+});
+exports.createRotationMatrix = createRotationMatrix;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/row.js b/node_modules/mathjs/lib/cjs/function/matrix/row.js
new file mode 100644
index 0000000..5fca4c3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/row.js
@@ -0,0 +1,68 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRow = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var name = 'row';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+var createRow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Index = _ref.Index,
+      matrix = _ref.matrix,
+      range = _ref.range;
+
+  /**
+   * Return a row from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.row(value, index)
+   *
+   * Example:
+   *
+   *     // get a row
+   *     const d = [[1, 2], [3, 4]]
+   *     math.row(d, 1) // returns [[3, 4]]
+   *
+   * See also:
+   *
+   *     column
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} row              The index of the row
+   * @return {Array | Matrix}         The retrieved row
+   */
+  return typed(name, {
+    'Matrix, number': _row,
+    'Array, number': function ArrayNumber(value, row) {
+      return _row(matrix((0, _object.clone)(value)), row).valueOf();
+    }
+  });
+  /**
+   * Retrieve a row of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} row     The index of the row
+   * @return {Matrix}        The retrieved row
+   */
+
+  function _row(value, row) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+
+    (0, _array.validateIndex)(row, value.size()[0]);
+    var columnRange = range(0, value.size()[1]);
+    var index = new Index(row, columnRange);
+    return value.subset(index);
+  }
+});
+exports.createRow = createRow;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/size.js b/node_modules/mathjs/lib/cjs/function/matrix/size.js
new file mode 100644
index 0000000..1ba919b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/size.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSize = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _noop = require("../../utils/noop.js");
+
+var name = 'size';
+var dependencies = ['typed', 'config', '?matrix'];
+var createSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix;
+
+  /**
+   * Calculate the size of a matrix or scalar.
+   *
+   * Syntax:
+   *
+   *     math.size(x)
+   *
+   * Examples:
+   *
+   *     math.size(2.3)                  // returns []
+   *     math.size('hello world')        // returns [11]
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.size(A)                    // returns [2, 3]
+   *     math.size(math.range(1,6))      // returns [5]
+   *
+   * See also:
+   *
+   *     count, resize, squeeze, subset
+   *
+   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix
+   * @return {Array | Matrix} A vector with size of `x`.
+   */
+  return typed(name, {
+    Matrix: function Matrix(x) {
+      return x.create(x.size());
+    },
+    Array: _array.arraySize,
+    string: function string(x) {
+      return config.matrix === 'Array' ? [x.length] : matrix([x.length]);
+    },
+    'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {
+      // scalar
+      return config.matrix === 'Array' ? [] : matrix ? matrix([]) : (0, _noop.noMatrix)();
+    }
+  });
+});
+exports.createSize = createSize;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/sort.js b/node_modules/mathjs/lib/cjs/function/matrix/sort.js
new file mode 100644
index 0000000..2c0c4e1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/sort.js
@@ -0,0 +1,133 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSort = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'sort';
+var dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];
+var createSort = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      compare = _ref.compare,
+      compareNatural = _ref.compareNatural;
+  var compareAsc = compare;
+
+  var compareDesc = function compareDesc(a, b) {
+    return -compare(a, b);
+  };
+  /**
+   * Sort the items in a matrix.
+   *
+   * Syntax:
+   *
+   *    math.sort(x)
+   *    math.sort(x, compare)
+   *
+   * Examples:
+   *
+   *    math.sort([5, 10, 1]) // returns [1, 5, 10]
+   *    math.sort(['C', 'B', 'A', 'D'], math.compareNatural)
+   *    // returns ['A', 'B', 'C', 'D']
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)
+   *    // returns ['Tom', 'Sara', 'Langdon']
+   *
+   * See also:
+   *
+   *    filter, forEach, map, compare, compareNatural
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']
+   *        An optional _comparator function or name. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {Matrix | Array} Returns the sorted matrix.
+   */
+
+
+  return typed(name, {
+    Array: function Array(x) {
+      _arrayIsVector(x);
+
+      return x.sort(compareAsc);
+    },
+    Matrix: function Matrix(x) {
+      _matrixIsVector(x);
+
+      return matrix(x.toArray().sort(compareAsc), x.storage());
+    },
+    'Array, function': function ArrayFunction(x, _comparator) {
+      _arrayIsVector(x);
+
+      return x.sort(_comparator);
+    },
+    'Matrix, function': function MatrixFunction(x, _comparator) {
+      _matrixIsVector(x);
+
+      return matrix(x.toArray().sort(_comparator), x.storage());
+    },
+    'Array, string': function ArrayString(x, order) {
+      _arrayIsVector(x);
+
+      return x.sort(_comparator(order));
+    },
+    'Matrix, string': function MatrixString(x, order) {
+      _matrixIsVector(x);
+
+      return matrix(x.toArray().sort(_comparator(order)), x.storage());
+    }
+  });
+  /**
+   * Get the comparator for given order ('asc', 'desc', 'natural')
+   * @param {'asc' | 'desc' | 'natural'} order
+   * @return {Function} Returns a _comparator function
+   */
+
+  function _comparator(order) {
+    if (order === 'asc') {
+      return compareAsc;
+    } else if (order === 'desc') {
+      return compareDesc;
+    } else if (order === 'natural') {
+      return compareNatural;
+    } else {
+      throw new Error('String "asc", "desc", or "natural" expected');
+    }
+  }
+  /**
+   * Validate whether an array is one dimensional
+   * Throws an error when this is not the case
+   * @param {Array} array
+   * @private
+   */
+
+
+  function _arrayIsVector(array) {
+    if ((0, _array.arraySize)(array).length !== 1) {
+      throw new Error('One dimensional array expected');
+    }
+  }
+  /**
+   * Validate whether a matrix is one dimensional
+   * Throws an error when this is not the case
+   * @param {Matrix} matrix
+   * @private
+   */
+
+
+  function _matrixIsVector(matrix) {
+    if (matrix.size().length !== 1) {
+      throw new Error('One dimensional matrix expected');
+    }
+  }
+});
+exports.createSort = createSort;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/sqrtm.js b/node_modules/mathjs/lib/cjs/function/matrix/sqrtm.js
new file mode 100644
index 0000000..bbdf29b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/sqrtm.js
@@ -0,0 +1,116 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSqrtm = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _string = require("../../utils/string.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'sqrtm';
+var dependencies = ['typed', 'abs', 'add', 'multiply', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];
+var createSqrtm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      abs = _ref.abs,
+      add = _ref.add,
+      multiply = _ref.multiply,
+      sqrt = _ref.sqrt,
+      subtract = _ref.subtract,
+      inv = _ref.inv,
+      size = _ref.size,
+      max = _ref.max,
+      identity = _ref.identity;
+  var _maxIterations = 1e3;
+  var _tolerance = 1e-6;
+  /**
+   * Calculate the principal square root matrix using the Denman–Beavers iterative method
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   * @private
+   */
+
+  function _denmanBeavers(A) {
+    var error;
+    var iterations = 0;
+    var Y = A;
+    var Z = identity(size(A));
+
+    do {
+      var Yk = Y;
+      Y = multiply(0.5, add(Yk, inv(Z)));
+      Z = multiply(0.5, add(Z, inv(Yk)));
+      error = max(abs(subtract(Y, Yk)));
+
+      if (error > _tolerance && ++iterations > _maxIterations) {
+        throw new Error('computing square root of matrix: iterative method could not converge');
+      }
+    } while (error > _tolerance);
+
+    return Y;
+  }
+  /**
+   * Calculate the principal square root of a square matrix.
+   * The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix
+   *
+   * Syntax:
+   *
+   *     X = math.sqrtm(A)
+   *
+   * Examples:
+   *
+   *     math.sqrtm([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   */
+
+
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(A) {
+      var size = (0, _is.isMatrix)(A) ? A.size() : (0, _array.arraySize)(A);
+
+      switch (size.length) {
+        case 1:
+          // Single element Array | Matrix
+          if (size[0] === 1) {
+            return sqrt(A);
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+          }
+
+        case 2:
+          {
+            // Two-dimensional Array | Matrix
+            var rows = size[0];
+            var cols = size[1];
+
+            if (rows === cols) {
+              return _denmanBeavers(A);
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+            }
+          }
+
+        default:
+          // Multi dimensional array
+          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    }
+  });
+});
+exports.createSqrtm = createSqrtm;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/squeeze.js b/node_modules/mathjs/lib/cjs/function/matrix/squeeze.js
new file mode 100644
index 0000000..33a1fac
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/squeeze.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSqueeze = void 0;
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'squeeze';
+var dependencies = ['typed', 'matrix'];
+var createSqueeze = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix;
+
+  /**
+   * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.
+   *
+   * Syntax:
+   *
+   *     math.squeeze(x)
+   *
+   * Examples:
+   *
+   *     math.squeeze([3])           // returns 3
+   *     math.squeeze([[3]])         // returns 3
+   *
+   *     const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)
+   *     math.squeeze(A)             // returns [0, 0, 0] (size 3)
+   *
+   *     const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)
+   *     math.squeeze(B)             // returns [0, 0, 0] (size 3)
+   *
+   *     // only inner and outer dimensions are removed
+   *     const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *     math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *
+   * See also:
+   *
+   *     subset
+   *
+   * @param {Matrix | Array} x      Matrix to be squeezed
+   * @return {Matrix | Array} Squeezed matrix
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return (0, _array.squeeze)((0, _object.clone)(x));
+    },
+    Matrix: function Matrix(x) {
+      var res = (0, _array.squeeze)(x.toArray()); // FIXME: return the same type of matrix as the input
+
+      return Array.isArray(res) ? matrix(res) : res;
+    },
+    any: function any(x) {
+      // scalar
+      return (0, _object.clone)(x);
+    }
+  });
+});
+exports.createSqueeze = createSqueeze;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/subset.js b/node_modules/mathjs/lib/cjs/function/matrix/subset.js
new file mode 100644
index 0000000..40d8b2e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/subset.js
@@ -0,0 +1,241 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubset = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _customs = require("../../utils/customs.js");
+
+var _DimensionError = require("../../error/DimensionError.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'subset';
+var dependencies = ['typed', 'matrix'];
+var createSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix;
+
+  /**
+   * Get or set a subset of a matrix or string.
+   *
+   * Syntax:
+   *     math.subset(value, index)                                // retrieve a subset
+   *     math.subset(value, index, replacement [, defaultValue])  // replace a subset
+   *
+   * Examples:
+   *
+   *     // get a subset
+   *     const d = [[1, 2], [3, 4]]
+   *     math.subset(d, math.index(1, 0))        // returns 3
+   *     math.subset(d, math.index([0, 1], 1))   // returns [[2], [4]]
+   *
+   *     // replace a subset
+   *     const e = []
+   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 6]] and e = [[5, 0, 6]]
+   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 6], [0, 7]]
+   *
+   *     // get submatrix using ranges
+   *     const M = [
+   *       [1,2,3],
+   *       [4,5,6],
+   *       [7,8,9]
+   *     ]
+   *     math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1,2,3],[4,5,6]]
+   *
+   * See also:
+   *
+   *     size, resize, squeeze, index
+   *
+   * @param {Array | Matrix | string} matrix  An array, matrix, or string
+   * @param {Index} index
+   *    For each dimension of the target, specifies an index or a list of
+   *    indices to fetch or set. `subset` uses the cartesian product of
+   *    the indices specified in each dimension.
+   * @param {*} [replacement]                 An array, matrix, or scalar.
+   *                                          If provided, the subset is replaced with replacement.
+   *                                          If not provided, the subset is returned
+   * @param {*} [defaultValue=undefined]      Default value, filled in on new entries when
+   *                                          the matrix is resized. If not provided,
+   *                                          math.matrix elements will be left undefined.
+   * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.
+   */
+  return typed(name, {
+    // get subset
+    'Array, Index': function ArrayIndex(value, index) {
+      var m = matrix(value);
+      var subset = m.subset(index); // returns a Matrix
+
+      return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)
+    },
+    'Matrix, Index': function MatrixIndex(value, index) {
+      return value.subset(index);
+    },
+    'Object, Index': _getObjectProperty,
+    'string, Index': _getSubstring,
+    // set subset
+    'Array, Index, any': function ArrayIndexAny(value, index, replacement) {
+      return matrix((0, _object.clone)(value)).subset(index, replacement, undefined).valueOf();
+    },
+    'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {
+      return matrix((0, _object.clone)(value)).subset(index, replacement, defaultValue).valueOf();
+    },
+    'Matrix, Index, any': function MatrixIndexAny(value, index, replacement) {
+      return value.clone().subset(index, replacement);
+    },
+    'Matrix, Index, any, any': function MatrixIndexAnyAny(value, index, replacement, defaultValue) {
+      return value.clone().subset(index, replacement, defaultValue);
+    },
+    'string, Index, string': _setSubstring,
+    'string, Index, string, string': _setSubstring,
+    'Object, Index, any': _setObjectProperty
+  });
+});
+/**
+ * Retrieve a subset of a string
+ * @param {string} str            string from which to get a substring
+ * @param {Index} index           An index or list of indices (character positions)
+ * @returns {string} substring
+ * @private
+ */
+
+exports.createSubset = createSubset;
+
+function _getSubstring(str, index) {
+  if (!(0, _is.isIndex)(index)) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size().length, 1);
+  } // validate whether the range is out of range
+
+
+  var strLen = str.length;
+  (0, _array.validateIndex)(index.min()[0], strLen);
+  (0, _array.validateIndex)(index.max()[0], strLen);
+  var range = index.dimension(0);
+  var substr = '';
+  range.forEach(function (v) {
+    substr += str.charAt(v);
+  });
+  return substr;
+}
+/**
+ * Replace a substring in a string
+ * @param {string} str            string to be replaced
+ * @param {Index} index           An index or list of indices (character positions)
+ * @param {string} replacement    Replacement string
+ * @param {string} [defaultValue] Default value to be uses when resizing
+ *                                the string. is ' ' by default
+ * @returns {string} result
+ * @private
+ */
+
+
+function _setSubstring(str, index, replacement, defaultValue) {
+  if (!index || index.isIndex !== true) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size().length, 1);
+  }
+
+  if (defaultValue !== undefined) {
+    if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {
+      throw new TypeError('Single character expected as defaultValue');
+    }
+  } else {
+    defaultValue = ' ';
+  }
+
+  var range = index.dimension(0);
+  var len = range.size()[0];
+
+  if (len !== replacement.length) {
+    throw new _DimensionError.DimensionError(range.size()[0], replacement.length);
+  } // validate whether the range is out of range
+
+
+  var strLen = str.length;
+  (0, _array.validateIndex)(index.min()[0]);
+  (0, _array.validateIndex)(index.max()[0]); // copy the string into an array with characters
+
+  var chars = [];
+
+  for (var i = 0; i < strLen; i++) {
+    chars[i] = str.charAt(i);
+  }
+
+  range.forEach(function (v, i) {
+    chars[v] = replacement.charAt(i[0]);
+  }); // initialize undefined characters with a space
+
+  if (chars.length > strLen) {
+    for (var _i = strLen - 1, _len = chars.length; _i < _len; _i++) {
+      if (!chars[_i]) {
+        chars[_i] = defaultValue;
+      }
+    }
+  }
+
+  return chars.join('');
+}
+/**
+ * Retrieve a property from an object
+ * @param {Object} object
+ * @param {Index} index
+ * @return {*} Returns the value of the property
+ * @private
+ */
+
+
+function _getObjectProperty(object, index) {
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size(), 1);
+  }
+
+  var key = index.dimension(0);
+
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  }
+
+  return (0, _customs.getSafeProperty)(object, key);
+}
+/**
+ * Set a property on an object
+ * @param {Object} object
+ * @param {Index} index
+ * @param {*} replacement
+ * @return {*} Returns the updated object
+ * @private
+ */
+
+
+function _setObjectProperty(object, index, replacement) {
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size(), 1);
+  }
+
+  var key = index.dimension(0);
+
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  } // clone the object, and apply the property to the clone
+
+
+  var updated = (0, _object.clone)(object);
+  (0, _customs.setSafeProperty)(updated, key, replacement);
+  return updated;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/trace.js b/node_modules/mathjs/lib/cjs/function/matrix/trace.js
new file mode 100644
index 0000000..baa3c26
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/trace.js
@@ -0,0 +1,147 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTrace = void 0;
+
+var _object = require("../../utils/object.js");
+
+var _string = require("../../utils/string.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'trace';
+var dependencies = ['typed', 'matrix', 'add'];
+var createTrace = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      add = _ref.add;
+
+  /**
+   * Calculate the trace of a matrix: the sum of the elements on the main
+   * diagonal of a square matrix.
+   *
+   * Syntax:
+   *
+   *    math.trace(x)
+   *
+   * Examples:
+   *
+   *    math.trace([[1, 2], [3, 4]]) // returns 5
+   *
+   *    const A = [
+   *      [1, 2, 3],
+   *      [-1, 2, 3],
+   *      [2, 0, 3]
+   *    ]
+   *    math.trace(A) // returns 6
+   *
+   * See also:
+   *
+   *    diag
+   *
+   * @param {Array | Matrix} x  A matrix
+   *
+   * @return {number} The trace of `x`
+   */
+  return typed('trace', {
+    Array: function _arrayTrace(x) {
+      // use dense matrix implementation
+      return _denseTrace(matrix(x));
+    },
+    SparseMatrix: _sparseTrace,
+    DenseMatrix: _denseTrace,
+    any: _object.clone
+  });
+
+  function _denseTrace(m) {
+    // matrix size & data
+    var size = m._size;
+    var data = m._data; // process dimensions
+
+    switch (size.length) {
+      case 1:
+        // vector
+        if (size[0] === 1) {
+          // return data[0]
+          return (0, _object.clone)(data[0]);
+        }
+
+        throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');
+
+      case 2:
+        {
+          // two dimensional
+          var rows = size[0];
+          var cols = size[1];
+
+          if (rows === cols) {
+            // calulate sum
+            var sum = 0; // loop diagonal
+
+            for (var i = 0; i < rows; i++) {
+              sum = add(sum, data[i][i]);
+            } // return trace
+
+
+            return sum;
+          } else {
+            throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');
+          }
+        }
+
+      default:
+        // multi dimensional
+        throw new RangeError('Matrix must be two dimensional (size: ' + (0, _string.format)(size) + ')');
+    }
+  }
+
+  function _sparseTrace(m) {
+    // matrix arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+    var size = m._size; // check dimensions
+
+    var rows = size[0];
+    var columns = size[1]; // matrix must be square
+
+    if (rows === columns) {
+      // calulate sum
+      var sum = 0; // check we have data (avoid looping columns)
+
+      if (values.length > 0) {
+        // loop columns
+        for (var j = 0; j < columns; j++) {
+          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+          var k0 = ptr[j];
+          var k1 = ptr[j + 1]; // loop k within [k0, k1[
+
+          for (var k = k0; k < k1; k++) {
+            // row index
+            var i = index[k]; // check row
+
+            if (i === j) {
+              // accumulate value
+              sum = add(sum, values[k]); // exit loop
+
+              break;
+            }
+
+            if (i > j) {
+              // exit loop, no value on the diagonal for column j
+              break;
+            }
+          }
+        }
+      } // return trace
+
+
+      return sum;
+    }
+
+    throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');
+  }
+});
+exports.createTrace = createTrace;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/transpose.js b/node_modules/mathjs/lib/cjs/function/matrix/transpose.js
new file mode 100644
index 0000000..375a66d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/transpose.js
@@ -0,0 +1,184 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTranspose = void 0;
+
+var _object = require("../../utils/object.js");
+
+var _string = require("../../utils/string.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'transpose';
+var dependencies = ['typed', 'matrix'];
+var createTranspose = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix;
+
+  /**
+   * Transpose a matrix. All values of the matrix are reflected over its
+   * main diagonal. Only applicable to two dimensional matrices containing
+   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional
+   * vectors and scalars return the input unchanged.
+   *
+   * Syntax:
+   *
+   *     math.transpose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]
+   *
+   * See also:
+   *
+   *     diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be transposed
+   * @return {Array | Matrix}   The transposed matrix
+   */
+  return typed('transpose', {
+    Array: function Array(x) {
+      // use dense matrix implementation
+      return this(matrix(x)).valueOf();
+    },
+    Matrix: function Matrix(x) {
+      // matrix size
+      var size = x.size(); // result
+
+      var c; // process dimensions
+
+      switch (size.length) {
+        case 1:
+          // vector
+          c = x.clone();
+          break;
+
+        case 2:
+          {
+            // rows and columns
+            var rows = size[0];
+            var columns = size[1]; // check columns
+
+            if (columns === 0) {
+              // throw exception
+              throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + (0, _string.format)(size) + ')');
+            } // process storage format
+
+
+            switch (x.storage()) {
+              case 'dense':
+                c = _denseTranspose(x, rows, columns);
+                break;
+
+              case 'sparse':
+                c = _sparseTranspose(x, rows, columns);
+                break;
+            }
+          }
+          break;
+
+        default:
+          // multi dimensional
+          throw new RangeError('Matrix must be a vector or two dimensional (size: ' + (0, _string.format)(this._size) + ')');
+      }
+
+      return c;
+    },
+    // scalars
+    any: function any(x) {
+      return (0, _object.clone)(x);
+    }
+  });
+
+  function _denseTranspose(m, rows, columns) {
+    // matrix array
+    var data = m._data; // transposed matrix data
+
+    var transposed = [];
+    var transposedRow; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // initialize row
+      transposedRow = transposed[j] = []; // loop rows
+
+      for (var i = 0; i < rows; i++) {
+        // set data
+        transposedRow[i] = (0, _object.clone)(data[i][j]);
+      }
+    } // return matrix
+
+
+    return m.createDenseMatrix({
+      data: transposed,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+
+  function _sparseTranspose(m, rows, columns) {
+    // matrix arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // result matrices
+
+    var cvalues = values ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // row counts
+
+    var w = [];
+
+    for (var x = 0; x < rows; x++) {
+      w[x] = 0;
+    } // vars
+
+
+    var p, l, j; // loop values in matrix
+
+    for (p = 0, l = index.length; p < l; p++) {
+      // number of values in row
+      w[index[p]]++;
+    } // cumulative sum
+
+
+    var sum = 0; // initialize cptr with the cummulative sum of row counts
+
+    for (var i = 0; i < rows; i++) {
+      // update cptr
+      cptr.push(sum); // update sum
+
+      sum += w[i]; // update w
+
+      w[i] = cptr[i];
+    } // update cptr
+
+
+    cptr.push(sum); // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // values & index in column
+      for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {
+        // C values & index
+        var q = w[index[k]]++; // C[j, i] = A[i, j]
+
+        cindex[q] = j; // check we need to process values (pattern matrix)
+
+        if (values) {
+          cvalues[q] = (0, _object.clone)(values[k]);
+        }
+      }
+    } // return matrix
+
+
+    return m.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+});
+exports.createTranspose = createTranspose;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/zeros.js b/node_modules/mathjs/lib/cjs/function/matrix/zeros.js
new file mode 100644
index 0000000..ac827c8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/zeros.js
@@ -0,0 +1,140 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createZeros = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _number = require("../../utils/number.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'zeros';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+var createZeros = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      BigNumber = _ref.BigNumber;
+
+  /**
+   * Create a matrix filled with zeros. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.zeros(m)
+   *    math.zeros(m, format)
+   *    math.zeros(m, n)
+   *    math.zeros(m, n, format)
+   *    math.zeros([m, n])
+   *    math.zeros([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.zeros(3)                  // returns [0, 0, 0]
+   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]
+   *    math.zeros(3, 'dense')         // returns [0, 0, 0]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]
+   *
+   * See also:
+   *
+   *    ones, identity, size, range
+   *
+   * @param {...number | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix}           A matrix filled with zeros
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');
+    },
+    // math.zeros(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function numberBigNumberString(size) {
+      var last = size[size.length - 1];
+
+      if (typeof last === 'string') {
+        var format = size.pop();
+        return _zeros(size, format);
+      } else if (config.matrix === 'Array') {
+        return _zeros(size);
+      } else {
+        return _zeros(size, 'default');
+      }
+    },
+    Array: _zeros,
+    Matrix: function Matrix(size) {
+      var format = size.storage();
+      return _zeros(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function ArrayMatrixString(size, format) {
+      return _zeros(size.valueOf(), format);
+    }
+  });
+  /**
+   * Create an Array or Matrix with zeros
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+
+  function _zeros(size, format) {
+    var hasBigNumbers = _normalize(size);
+
+    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;
+
+    _validate(size);
+
+    if (format) {
+      // return a matrix
+      var m = matrix(format);
+
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+
+      return m;
+    } else {
+      // return an Array
+      var arr = [];
+
+      if (size.length > 0) {
+        return (0, _array.resize)(arr, size, defaultValue);
+      }
+
+      return arr;
+    }
+  } // replace BigNumbers with numbers, returns true if size contained BigNumbers
+
+
+  function _normalize(size) {
+    var hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if ((0, _is.isBigNumber)(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  } // validate arguments
+
+
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !(0, _number.isInteger)(value) || value < 0) {
+        throw new Error('Parameters in function zeros must be positive integers');
+      }
+    });
+  }
+}); // TODO: zeros contains almost the same code as ones. Reuse this?
+
+exports.createZeros = createZeros;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/combinations.js b/node_modules/mathjs/lib/cjs/function/probability/combinations.js
new file mode 100644
index 0000000..06e92db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/combinations.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCombinations = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _combinations = require("../../plain/number/combinations.js");
+
+var name = 'combinations';
+var dependencies = ['typed'];
+var createCombinations = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities.
+   *
+   * Combinations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.combinations(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinations(7, 5) // returns 21
+   *
+   * See also:
+   *
+   *    combinationsWithRep, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations.
+   */
+  return typed(name, {
+    'number, number': _combinations.combinationsNumber,
+    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
+      var BigNumber = n.constructor;
+      var result, i;
+      var nMinusk = n.minus(k);
+      var one = new BigNumber(1);
+
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinations');
+      }
+
+      if (k.gt(n)) {
+        throw new TypeError('k must be less than n in function combinations');
+      }
+
+      result = one;
+
+      if (k.lt(nMinusk)) {
+        for (i = one; i.lte(nMinusk); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusk.plus(i)).dividedBy(i);
+        }
+      }
+
+      return result;
+    } // TODO: implement support for collection in combinations
+
+  });
+});
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+
+exports.createCombinations = createCombinations;
+
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/cjs/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..35bfdd7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/combinationsWithRep.js
@@ -0,0 +1,105 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCombinationsWithRep = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _number = require("../../utils/number.js");
+
+var _product = require("../../utils/product.js");
+
+var name = 'combinationsWithRep';
+var dependencies = ['typed'];
+var createCombinationsWithRep = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities, allowing individual outcomes to be repeated more than once.
+   *
+   * CombinationsWithRep only takes integer arguments.
+   * The following condition must be enforced: k <= n + k -1.
+   *
+   * Syntax:
+   *
+   *     math.combinationsWithRep(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinationsWithRep(7, 5) // returns 462
+   *
+   * See also:
+   *
+   *    combinations, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations with replacement.
+   */
+  return typed(name, {
+    'number, number': function numberNumber(n, k) {
+      if (!(0, _number.isInteger)(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+
+      if (!(0, _number.isInteger)(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+
+      if (n < 1) {
+        throw new TypeError('k must be less than or equal to n + k - 1');
+      }
+
+      if (k < n - 1) {
+        var _prodrange = (0, _product.product)(n, n + k - 1);
+
+        return _prodrange / (0, _product.product)(1, k);
+      }
+
+      var prodrange = (0, _product.product)(k + 1, n + k - 1);
+      return prodrange / (0, _product.product)(1, n - 1);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
+      var BigNumber = n.constructor;
+      var result, i;
+      var one = new BigNumber(1);
+      var nMinusOne = n.minus(one);
+
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+
+      if (n.lt(one)) {
+        throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep');
+      }
+
+      result = one;
+
+      if (k.lt(nMinusOne)) {
+        for (i = one; i.lte(nMinusOne); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusOne.plus(i)).dividedBy(i);
+        }
+      }
+
+      return result;
+    }
+  });
+});
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+
+exports.createCombinationsWithRep = createCombinationsWithRep;
+
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/factorial.js b/node_modules/mathjs/lib/cjs/function/probability/factorial.js
new file mode 100644
index 0000000..9c9a736
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/factorial.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFactorial = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'factorial';
+var dependencies = ['typed', 'gamma'];
+var createFactorial = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      gamma = _ref.gamma;
+
+  /**
+   * Compute the factorial of a value
+   *
+   * Factorial only supports an integer value as argument.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.factorial(n)
+   *
+   * Examples:
+   *
+   *    math.factorial(5)    // returns 120
+   *    math.factorial(3)    // returns 6
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, gamma, permutations
+   *
+   * @param {number | BigNumber | Array | Matrix} n   An integer number
+   * @return {number | BigNumber | Array | Matrix}    The factorial of `n`
+   */
+  return typed(name, {
+    number: function number(n) {
+      if (n < 0) {
+        throw new Error('Value must be non-negative');
+      }
+
+      return gamma(n + 1);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.isNegative()) {
+        throw new Error('Value must be non-negative');
+      }
+
+      return gamma(n.plus(1));
+    },
+    'Array | Matrix': function ArrayMatrix(n) {
+      return (0, _collection.deepMap)(n, this);
+    }
+  });
+});
+exports.createFactorial = createFactorial;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/gamma.js b/node_modules/mathjs/lib/cjs/function/probability/gamma.js
new file mode 100644
index 0000000..e241c84
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/gamma.js
@@ -0,0 +1,138 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createGamma = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'gamma';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];
+var createGamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      multiplyScalar = _ref.multiplyScalar,
+      pow = _ref.pow,
+      _BigNumber = _ref.BigNumber,
+      _Complex = _ref.Complex;
+
+  /**
+   * Compute the gamma function of a value using Lanczos approximation for
+   * small values, and an extended Stirling approximation for large values.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.gamma(n)
+   *
+   * Examples:
+   *
+   *    math.gamma(5)       // returns 24
+   *    math.gamma(-0.5)    // returns -3.5449077018110335
+   *    math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i
+   *
+   * See also:
+   *
+   *    combinations, factorial, permutations
+   *
+   * @param {number | Array | Matrix} n   A real or complex number
+   * @return {number | Array | Matrix}    The gamma of `n`
+   */
+  return typed(name, {
+    number: _index.gammaNumber,
+    Complex: function Complex(n) {
+      if (n.im === 0) {
+        return this(n.re);
+      } // Lanczos approximation doesn't work well with real part lower than 0.5
+      // So reflection formula is required
+
+
+      if (n.re < 0.5) {
+        // Euler's reflection formula
+        // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+        // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+        // thanks to imperfect sin implementation sin(PI * n) != 0
+        // we can safely use it anyway
+        var _t = new _Complex(1 - n.re, -n.im);
+
+        var r = new _Complex(Math.PI * n.re, Math.PI * n.im);
+        return new _Complex(Math.PI).div(r.sin()).div(this(_t));
+      } // Lanczos approximation
+      // z -= 1
+
+
+      n = new _Complex(n.re - 1, n.im); // x = gammaPval[0]
+
+      var x = new _Complex(_index.gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
+
+      for (var i = 1; i < _index.gammaP.length; ++i) {
+        // x += gammaPval / (z + i)
+        var gammaPval = new _Complex(_index.gammaP[i], 0);
+        x = x.add(gammaPval.div(n.add(i)));
+      } // t = z + gammaG + 0.5
+
+
+      var t = new _Complex(n.re + _index.gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
+
+      var twoPiSqrt = Math.sqrt(2 * Math.PI);
+      var tpow = t.pow(n.add(0.5));
+      var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
+
+      return x.mul(twoPiSqrt).mul(tpow).mul(expt);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.isInteger()) {
+        return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : bigFactorial(n.minus(1));
+      }
+
+      if (!n.isFinite()) {
+        return new _BigNumber(n.isNegative() ? NaN : Infinity);
+      }
+
+      throw new Error('Integer BigNumber expected');
+    },
+    'Array | Matrix': function ArrayMatrix(n) {
+      return (0, _collection.deepMap)(n, this);
+    }
+  });
+  /**
+   * Calculate factorial for a BigNumber
+   * @param {BigNumber} n
+   * @returns {BigNumber} Returns the factorial of n
+   */
+
+  function bigFactorial(n) {
+    if (n < 8) {
+      return new _BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n]);
+    }
+
+    var precision = config.precision + (Math.log(n.toNumber()) | 0);
+
+    var Big = _BigNumber.clone({
+      precision: precision
+    });
+
+    if (n % 2 === 1) {
+      return n.times(bigFactorial(new _BigNumber(n - 1)));
+    }
+
+    var p = n;
+    var prod = new Big(n);
+    var sum = n.toNumber();
+
+    while (p > 2) {
+      p -= 2;
+      sum += p;
+      prod = prod.times(sum);
+    }
+
+    return new _BigNumber(prod.toPrecision(_BigNumber.precision));
+  }
+});
+exports.createGamma = createGamma;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/kldivergence.js b/node_modules/mathjs/lib/cjs/function/probability/kldivergence.js
new file mode 100644
index 0000000..28509fc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/kldivergence.js
@@ -0,0 +1,93 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createKldivergence = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'kldivergence';
+var dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric'];
+var createKldivergence = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      divide = _ref.divide,
+      sum = _ref.sum,
+      multiply = _ref.multiply,
+      dotDivide = _ref.dotDivide,
+      log = _ref.log,
+      isNumeric = _ref.isNumeric;
+
+  /**
+     * Calculate the Kullback-Leibler (KL) divergence  between two distributions
+     *
+     * Syntax:
+     *
+     *     math.kldivergence(x, y)
+     *
+     * Examples:
+     *
+     *     math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153
+     *
+     *
+     * @param  {Array | Matrix} q    First vector
+     * @param  {Array | Matrix} p    Second vector
+     * @return {number}              Returns distance between q and p
+     */
+  return typed(name, {
+    'Array, Array': function ArrayArray(q, p) {
+      return _kldiv(matrix(q), matrix(p));
+    },
+    'Matrix, Array': function MatrixArray(q, p) {
+      return _kldiv(q, matrix(p));
+    },
+    'Array, Matrix': function ArrayMatrix(q, p) {
+      return _kldiv(matrix(q), p);
+    },
+    'Matrix, Matrix': function MatrixMatrix(q, p) {
+      return _kldiv(q, p);
+    }
+  });
+
+  function _kldiv(q, p) {
+    var plength = p.size().length;
+    var qlength = q.size().length;
+
+    if (plength > 1) {
+      throw new Error('first object must be one dimensional');
+    }
+
+    if (qlength > 1) {
+      throw new Error('second object must be one dimensional');
+    }
+
+    if (plength !== qlength) {
+      throw new Error('Length of two vectors must be equal');
+    } // Before calculation, apply normalization
+
+
+    var sumq = sum(q);
+
+    if (sumq === 0) {
+      throw new Error('Sum of elements in first object must be non zero');
+    }
+
+    var sump = sum(p);
+
+    if (sump === 0) {
+      throw new Error('Sum of elements in second object must be non zero');
+    }
+
+    var qnorm = divide(q, sum(q));
+    var pnorm = divide(p, sum(p));
+    var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));
+
+    if (isNumeric(result)) {
+      return result;
+    } else {
+      return Number.NaN;
+    }
+  }
+});
+exports.createKldivergence = createKldivergence;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/multinomial.js b/node_modules/mathjs/lib/cjs/function/probability/multinomial.js
new file mode 100644
index 0000000..fac4f60
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/multinomial.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMultinomial = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'multinomial';
+var dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];
+var createMultinomial = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      divide = _ref.divide,
+      multiply = _ref.multiply,
+      factorial = _ref.factorial,
+      isInteger = _ref.isInteger,
+      isPositive = _ref.isPositive;
+
+  /**
+   * Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.
+   *
+   * multinomial takes one array of integers as an argument.
+   * The following condition must be enforced: every ai <= 0
+   *
+   * Syntax:
+   *
+   *     math.multinomial(a) // a is an array type
+   *
+   * Examples:
+   *
+   *    math.multinomial([1,2,1]) // returns 12
+   *
+   * See also:
+   *
+   *    combinations, factorial
+   *
+   * @param {number[] | BigNumber[]} a    Integer numbers of objects in the subset
+   * @return {Number | BigNumber}         Multinomial coefficient.
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      var sum = 0;
+      var denom = 1;
+      (0, _collection.deepForEach)(a, function (ai) {
+        if (!isInteger(ai) || !isPositive(ai)) {
+          throw new TypeError('Positive integer value expected in function multinomial');
+        }
+
+        sum = add(sum, ai);
+        denom = multiply(denom, factorial(ai));
+      });
+      return divide(factorial(sum), denom);
+    }
+  });
+});
+exports.createMultinomial = createMultinomial;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/permutations.js b/node_modules/mathjs/lib/cjs/function/probability/permutations.js
new file mode 100644
index 0000000..e49a328
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/permutations.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPermutations = void 0;
+
+var _number = require("../../utils/number.js");
+
+var _product = require("../../utils/product.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'permutations';
+var dependencies = ['typed', 'factorial'];
+var createPermutations = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      factorial = _ref.factorial;
+
+  /**
+   * Compute the number of ways of obtaining an ordered subset of `k` elements
+   * from a set of `n` elements.
+   *
+   * Permutations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.permutations(n)
+   *     math.permutations(n, k)
+   *
+   * Examples:
+   *
+   *    math.permutations(5)     // 120
+   *    math.permutations(5, 3)  // 60
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, factorial
+   *
+   * @param {number | BigNumber} n   The number of objects in total
+   * @param {number | BigNumber} [k] The number of objects in the subset
+   * @return {number | BigNumber}    The number of permutations
+   */
+  return typed(name, {
+    'number | BigNumber': factorial,
+    'number, number': function numberNumber(n, k) {
+      if (!(0, _number.isInteger)(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+
+      if (!(0, _number.isInteger)(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+
+      if (k > n) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      } // Permute n objects, k at a time
+
+
+      return (0, _product.product)(n - k + 1, n);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
+      var result, i;
+
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+
+      if (k.gt(n)) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      }
+
+      var one = n.mul(0).add(1);
+      result = one;
+
+      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {
+        result = result.times(i);
+      }
+
+      return result;
+    } // TODO: implement support for collection in permutations
+
+  });
+});
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+
+exports.createPermutations = createPermutations;
+
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/pickRandom.js b/node_modules/mathjs/lib/cjs/function/probability/pickRandom.js
new file mode 100644
index 0000000..99aae53
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/pickRandom.js
@@ -0,0 +1,175 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPickRandom = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var _seededRNG = require("./util/seededRNG.js");
+
+var name = 'pickRandom';
+var dependencies = ['typed', 'config', '?on'];
+var createPickRandom = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      on = _ref.on;
+  // seeded pseudo random number generator
+  var rng = (0, _seededRNG.createRng)(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+  /**
+   * Random pick one or more values from a one dimensional array.
+   * Array elements are picked using a random function with uniform or weighted distribution.
+   *
+   * Syntax:
+   *
+   *     math.pickRandom(array)
+   *     math.pickRandom(array, number)
+   *     math.pickRandom(array, weights)
+   *     math.pickRandom(array, number, weights)
+   *     math.pickRandom(array, weights, number)
+   *     math.pickRandom(array, { weights, number, elementWise })
+   *
+   * Examples:
+   *
+   *     math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], { number: 2 })   // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution
+   *
+   *     math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })
+   *         // returns one of the items in the array
+   *
+   * See also:
+   *
+   *     random, randomInt
+   *
+   * @param {Array | Matrix} array     A one dimensional array
+   * @param {Int} number               An int or float
+   * @param {Array | Matrix} weights   An array of ints or floats
+   * @return {number | Array}          Returns a single random value from array when number is 1 or undefined.
+   *                                   Returns an array with the configured number of elements when number is > 1.
+   */
+
+
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(possibles) {
+      return _pickRandom(possibles, {});
+    },
+    'Array | Matrix, Object': function ArrayMatrixObject(possibles, options) {
+      return _pickRandom(possibles, options);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(possibles, number) {
+      return _pickRandom(possibles, {
+        number: number
+      });
+    },
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(possibles, weights) {
+      return _pickRandom(possibles, {
+        weights: weights
+      });
+    },
+    'Array | Matrix, Array | Matrix, number': function ArrayMatrixArrayMatrixNumber(possibles, weights, number) {
+      return _pickRandom(possibles, {
+        number: number,
+        weights: weights
+      });
+    },
+    'Array | Matrix, number, Array | Matrix': function ArrayMatrixNumberArrayMatrix(possibles, number, weights) {
+      return _pickRandom(possibles, {
+        number: number,
+        weights: weights
+      });
+    }
+  });
+  /**
+   * @param {Array | Matrix} possibles
+   * @param {{
+   *   number?: number,
+   *   weights?: Array | Matrix,
+   *   elementWise: boolean
+   * }} options
+   * @returns {number | Array}
+   * @private
+   */
+
+  function _pickRandom(possibles, _ref2) {
+    var number = _ref2.number,
+        weights = _ref2.weights,
+        _ref2$elementWise = _ref2.elementWise,
+        elementWise = _ref2$elementWise === void 0 ? true : _ref2$elementWise;
+    var single = typeof number === 'undefined';
+
+    if (single) {
+      number = 1;
+    }
+
+    var createMatrix = (0, _is.isMatrix)(possibles) ? possibles.create : (0, _is.isMatrix)(weights) ? weights.create : null;
+    possibles = possibles.valueOf(); // get Array
+
+    if (weights) {
+      weights = weights.valueOf(); // get Array
+    }
+
+    if (elementWise === true) {
+      possibles = (0, _array.flatten)(possibles);
+      weights = (0, _array.flatten)(weights);
+    }
+
+    var totalWeights = 0;
+
+    if (typeof weights !== 'undefined') {
+      if (weights.length !== possibles.length) {
+        throw new Error('Weights must have the same length as possibles');
+      }
+
+      for (var i = 0, len = weights.length; i < len; i++) {
+        if (!(0, _is.isNumber)(weights[i]) || weights[i] < 0) {
+          throw new Error('Weights must be an array of positive numbers');
+        }
+
+        totalWeights += weights[i];
+      }
+    }
+
+    var length = possibles.length;
+    var result = [];
+    var pick;
+
+    while (result.length < number) {
+      if (typeof weights === 'undefined') {
+        pick = possibles[Math.floor(rng() * length)];
+      } else {
+        var randKey = rng() * totalWeights;
+
+        for (var _i = 0, _len = possibles.length; _i < _len; _i++) {
+          randKey -= weights[_i];
+
+          if (randKey < 0) {
+            pick = possibles[_i];
+            break;
+          }
+        }
+      }
+
+      result.push(pick);
+    }
+
+    return single ? result[0] : createMatrix ? createMatrix(result) : result;
+  }
+});
+exports.createPickRandom = createPickRandom;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/random.js b/node_modules/mathjs/lib/cjs/function/probability/random.js
new file mode 100644
index 0000000..d37d024
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/random.js
@@ -0,0 +1,131 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRandomNumber = exports.createRandom = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var _seededRNG = require("./util/seededRNG.js");
+
+var _randomMatrix2 = require("./util/randomMatrix.js");
+
+var name = 'random';
+var dependencies = ['typed', 'config', '?on'];
+var createRandom = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      on = _ref.on;
+  // seeded pseudo random number generator
+  var rng = (0, _seededRNG.createRng)(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+  /**
+   * Return a random number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.random()                // generate a random number between 0 and 1
+   *     math.random(max)             // generate a random number between 0 and max
+   *     math.random(min, max)        // generate a random number between min and max
+   *     math.random(size)            // generate a matrix with random numbers between 0 and 1
+   *     math.random(size, max)       // generate a matrix with random numbers between 0 and max
+   *     math.random(size, min, max)  // generate a matrix with random numbers between min and max
+   *
+   * Examples:
+   *
+   *     math.random()       // returns a random number between 0 and 1
+   *     math.random(100)    // returns a random number between 0 and 100
+   *     math.random(30, 40) // returns a random number between 30 and 40
+   *     math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1
+   *
+   * See also:
+   *
+   *     randomInt, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random number
+   */
+
+
+  return typed(name, {
+    '': function _() {
+      return _random(0, 1);
+    },
+    number: function number(max) {
+      return _random(0, max);
+    },
+    'number, number': function numberNumber(min, max) {
+      return _random(min, max);
+    },
+    'Array | Matrix': function ArrayMatrix(size) {
+      return _randomMatrix(size, 0, 1);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(size, max) {
+      return _randomMatrix(size, 0, max);
+    },
+    'Array | Matrix, number, number': function ArrayMatrixNumberNumber(size, min, max) {
+      return _randomMatrix(size, min, max);
+    }
+  });
+
+  function _randomMatrix(size, min, max) {
+    var res = (0, _randomMatrix2.randomMatrix)(size.valueOf(), function () {
+      return _random(min, max);
+    });
+    return (0, _is.isMatrix)(size) ? size.create(res) : res;
+  }
+
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+}); // number only implementation of random, no matrix support
+// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?
+
+exports.createRandom = createRandom;
+var createRandomNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', '?on'], function (_ref2) {
+  var typed = _ref2.typed,
+      config = _ref2.config,
+      on = _ref2.on,
+      matrix = _ref2.matrix;
+  // seeded pseudo random number generator1
+  var rng = (0, _seededRNG.createRng)(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+
+  return typed(name, {
+    '': function _() {
+      return _random(0, 1);
+    },
+    number: function number(max) {
+      return _random(0, max);
+    },
+    'number, number': function numberNumber(min, max) {
+      return _random(min, max);
+    }
+  });
+
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+});
+exports.createRandomNumber = createRandomNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/randomInt.js b/node_modules/mathjs/lib/cjs/function/probability/randomInt.js
new file mode 100644
index 0000000..2a025d0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/randomInt.js
@@ -0,0 +1,95 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRandomInt = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _randomMatrix = require("./util/randomMatrix.js");
+
+var _seededRNG = require("./util/seededRNG.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'randomInt';
+var dependencies = ['typed', 'config', '?on'];
+var createRandomInt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      on = _ref.on;
+  // seeded pseudo random number generator
+  var rng = (0, _seededRNG.createRng)(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+  /**
+   * Return a random integer number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.randomInt()                // generate a random integer between 0 and 1
+   *     math.randomInt(max)             // generate a random integer between 0 and max
+   *     math.randomInt(min, max)        // generate a random integer between min and max
+   *     math.randomInt(size)            // generate a matrix with random integer between 0 and 1
+   *     math.randomInt(size, max)       // generate a matrix with random integer between 0 and max
+   *     math.randomInt(size, min, max)  // generate a matrix with random integer between min and max
+   *
+   * Examples:
+   *
+   *     math.randomInt(100)    // returns a random integer between 0 and 100
+   *     math.randomInt(30, 40) // returns a random integer between 30 and 40
+   *     math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1
+   *
+   * See also:
+   *
+   *     random, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random integer value
+   */
+
+
+  return typed(name, {
+    '': function _() {
+      return _randomInt(0, 1);
+    },
+    number: function number(max) {
+      return _randomInt(0, max);
+    },
+    'number, number': function numberNumber(min, max) {
+      return _randomInt(min, max);
+    },
+    'Array | Matrix': function ArrayMatrix(size) {
+      return _randomIntMatrix(size, 0, 1);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(size, max) {
+      return _randomIntMatrix(size, 0, max);
+    },
+    'Array | Matrix, number, number': function ArrayMatrixNumberNumber(size, min, max) {
+      return _randomIntMatrix(size, min, max);
+    }
+  });
+
+  function _randomIntMatrix(size, min, max) {
+    var res = (0, _randomMatrix.randomMatrix)(size.valueOf(), function () {
+      return _randomInt(min, max);
+    });
+    return (0, _is.isMatrix)(size) ? size.create(res) : res;
+  }
+
+  function _randomInt(min, max) {
+    return Math.floor(min + rng() * (max - min));
+  }
+});
+exports.createRandomInt = createRandomInt;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/util/randomMatrix.js b/node_modules/mathjs/lib/cjs/function/probability/util/randomMatrix.js
new file mode 100644
index 0000000..64d9bbb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/util/randomMatrix.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomMatrix = randomMatrix;
+
+/**
+ * This is a util function for generating a random matrix recursively.
+ * @param {number[]} size
+ * @param {function} random
+ * @returns {Array}
+ */
+function randomMatrix(size, random) {
+  var data = [];
+  size = size.slice(0);
+
+  if (size.length > 1) {
+    for (var i = 0, length = size.shift(); i < length; i++) {
+      data.push(randomMatrix(size, random));
+    }
+  } else {
+    for (var _i = 0, _length = size.shift(); _i < _length; _i++) {
+      data.push(random());
+    }
+  }
+
+  return data;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/util/seededRNG.js b/node_modules/mathjs/lib/cjs/function/probability/util/seededRNG.js
new file mode 100644
index 0000000..4925b0d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/util/seededRNG.js
@@ -0,0 +1,29 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRng = createRng;
+
+var _seedrandom = _interopRequireDefault(require("seedrandom"));
+
+var singletonRandom = /* #__PURE__ */(0, _seedrandom.default)(Date.now());
+
+function createRng(randomSeed) {
+  var random; // create a new random generator with given seed
+
+  function setSeed(seed) {
+    random = seed === null ? singletonRandom : (0, _seedrandom.default)(String(seed));
+  } // initialize a seeded pseudo random number generator with config's random seed
+
+
+  setSeed(randomSeed); // wrapper function so the rng can be updated via generator
+
+  function rng() {
+    return random();
+  }
+
+  return rng;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/compare.js b/node_modules/mathjs/lib/cjs/function/relational/compare.js
new file mode 100644
index 0000000..4f93758
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/compare.js
@@ -0,0 +1,168 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompareNumber = exports.createCompare = void 0;
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm05.js");
+
+var name = 'compare';
+var dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix'];
+var createCompare = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      equalScalar = _ref.equalScalar,
+      matrix = _ref.matrix,
+      BigNumber = _ref.BigNumber,
+      Fraction = _ref.Fraction,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm05 = (0, _algorithm5.createAlgorithm05)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm12 = (0, _algorithm2.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm3.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * x and y are considered equal when the relative difference between x and y
+   * is smaller than the configured epsilon. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.compare(x, y)
+   *
+   * Examples:
+   *
+   *    math.compare(6, 1)           // returns 1
+   *    math.compare(2, 3)           // returns -1
+   *    math.compare(7, 7)           // returns 0
+   *    math.compare('10', '2')      // returns 1
+   *    math.compare('1000', '1e3')  // returns 0
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compare(a, b)           // returns 1
+   *
+   *    math.compare(2, [1, 2, 3])   // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText
+   *
+   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} y Second value to compare
+   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the result of the comparison:
+   *                                                          1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x === y ? 0 : x > y ? 1 : -1;
+    },
+    'number, number': function numberNumber(x, y) {
+      return (0, _number.nearlyEqual)(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return (0, _nearlyEqual.nearlyEqual)(x, y, config.epsilon) ? new BigNumber(0) : new BigNumber(x.cmp(y));
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return new Fraction(x.compare(y));
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm05(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createCompare = createCompare;
+var createCompareNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {
+  var typed = _ref2.typed,
+      config = _ref2.config;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return (0, _number.nearlyEqual)(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;
+    }
+  });
+});
+exports.createCompareNumber = createCompareNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/compareNatural.js b/node_modules/mathjs/lib/cjs/function/relational/compareNatural.js
new file mode 100644
index 0000000..1eb98d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/compareNatural.js
@@ -0,0 +1,306 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompareNatural = void 0;
+
+var _javascriptNaturalSort = _interopRequireDefault(require("javascript-natural-sort"));
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'compareNatural';
+var dependencies = ['typed', 'compare'];
+var createCompareNatural = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      compare = _ref.compare;
+  var compareBooleans = compare.signatures['boolean,boolean'];
+  /**
+   * Compare two values of any type in a deterministic, natural way.
+   *
+   * For numeric values, the function works the same as `math.compare`.
+   * For types of values that can't be compared mathematically,
+   * the function compares in a natural way.
+   *
+   * For numeric values, x and y are considered equal when the relative
+   * difference between x and y is smaller than the configured epsilon.
+   * The function cannot be used to compare values smaller than
+   * approximately 2.22e-16.
+   *
+   * For Complex numbers, first the real parts are compared. If equal,
+   * the imaginary parts are compared.
+   *
+   * Strings are compared with a natural sorting algorithm, which
+   * orders strings in a "logic" way following some heuristics.
+   * This differs from the function `compare`, which converts the string
+   * into a numeric value and compares that. The function `compareText`
+   * on the other hand compares text lexically.
+   *
+   * Arrays and Matrices are compared value by value until there is an
+   * unequal pair of values encountered. Objects are compared by sorted
+   * keys until the keys or their values are unequal.
+   *
+   * Syntax:
+   *
+   *    math.compareNatural(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareNatural(6, 1)              // returns 1
+   *    math.compareNatural(2, 3)              // returns -1
+   *    math.compareNatural(7, 7)              // returns 0
+   *
+   *    math.compareNatural('10', '2')         // returns 1
+   *    math.compareText('10', '2')            // returns -1
+   *    math.compare('10', '2')                // returns 1
+   *
+   *    math.compareNatural('Answer: 10', 'Answer: 2') // returns 1
+   *    math.compareText('Answer: 10', 'Answer: 2')    // returns -1
+   *    math.compare('Answer: 10', 'Answer: 2')
+   *        // Error: Cannot convert "Answer: 10" to a number
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compareNatural(a, b)              // returns 1
+   *
+   *    const c = math.complex('2 + 3i')
+   *    const d = math.complex('2 + 4i')
+   *    math.compareNatural(c, d)              // returns -1
+   *
+   *    math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1
+   *    math.compareNatural([1, 2, 3], [1, 2])    // returns 1
+   *    math.compareNatural([1, 5], [1, 2, 3])    // returns 1
+   *    math.compareNatural([1, 2], [1, 2])       // returns 0
+   *
+   *    math.compareNatural({a: 2}, {a: 4})       // returns -1
+   *
+   * See also:
+   *
+   *    compare, compareText
+   *
+   * @param  {*} x First value to compare
+   * @param  {*} y Second value to compare
+   * @return {number} Returns the result of the comparison:
+   *                  1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      var typeX = (0, _is.typeOf)(x);
+      var typeY = (0, _is.typeOf)(y);
+      var c; // numeric types
+
+      if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {
+        c = compare(x, y);
+
+        if (c.toString() !== '0') {
+          // c can be number, BigNumber, or Fraction
+          return c > 0 ? 1 : -1; // return a number
+        } else {
+          return (0, _javascriptNaturalSort.default)(typeX, typeY);
+        }
+      } // matrix types
+
+
+      if (typeX === 'Array' || typeX === 'Matrix' || typeY === 'Array' || typeY === 'Matrix') {
+        c = compareMatricesAndArrays(this, x, y);
+
+        if (c !== 0) {
+          return c;
+        } else {
+          return (0, _javascriptNaturalSort.default)(typeX, typeY);
+        }
+      } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
+
+
+      if (typeX !== typeY) {
+        return (0, _javascriptNaturalSort.default)(typeX, typeY);
+      }
+
+      if (typeX === 'Complex') {
+        return compareComplexNumbers(x, y);
+      }
+
+      if (typeX === 'Unit') {
+        if (x.equalBase(y)) {
+          return this(x.value, y.value);
+        } // compare by units
+
+
+        return compareArrays(this, x.formatUnits(), y.formatUnits());
+      }
+
+      if (typeX === 'boolean') {
+        return compareBooleans(x, y);
+      }
+
+      if (typeX === 'string') {
+        return (0, _javascriptNaturalSort.default)(x, y);
+      }
+
+      if (typeX === 'Object') {
+        return compareObjects(this, x, y);
+      }
+
+      if (typeX === 'null') {
+        return 0;
+      }
+
+      if (typeX === 'undefined') {
+        return 0;
+      } // this should not occur...
+
+
+      throw new TypeError('Unsupported type of value "' + typeX + '"');
+    }
+  });
+  /**
+   * Compare mixed matrix/array types, by converting to same-shaped array.
+   * This comparator is non-deterministic regarding input types.
+   * @param {Array | SparseMatrix | DenseMatrix | *} x
+   * @param {Array | SparseMatrix | DenseMatrix | *} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+  function compareMatricesAndArrays(compareNatural, x, y) {
+    if ((0, _is.isSparseMatrix)(x) && (0, _is.isSparseMatrix)(y)) {
+      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);
+    }
+
+    if ((0, _is.isSparseMatrix)(x)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x.toArray(), y);
+    }
+
+    if ((0, _is.isSparseMatrix)(y)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x, y.toArray());
+    } // convert DenseArray into Array
+
+
+    if ((0, _is.isDenseMatrix)(x)) {
+      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);
+    }
+
+    if ((0, _is.isDenseMatrix)(y)) {
+      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);
+    } // convert scalars to array
+
+
+    if (!Array.isArray(x)) {
+      return compareMatricesAndArrays(compareNatural, [x], y);
+    }
+
+    if (!Array.isArray(y)) {
+      return compareMatricesAndArrays(compareNatural, x, [y]);
+    }
+
+    return compareArrays(compareNatural, x, y);
+  }
+  /**
+   * Compare two Arrays
+   *
+   * - First, compares value by value
+   * - Next, if all corresponding values are equal,
+   *   look at the length: longest array will be considered largest
+   *
+   * @param {Array} x
+   * @param {Array} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+
+  function compareArrays(compareNatural, x, y) {
+    // compare each value
+    for (var i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {
+      var v = compareNatural(x[i], y[i]);
+
+      if (v !== 0) {
+        return v;
+      }
+    } // compare the size of the arrays
+
+
+    if (x.length > y.length) {
+      return 1;
+    }
+
+    if (x.length < y.length) {
+      return -1;
+    } // both Arrays have equal size and content
+
+
+    return 0;
+  }
+  /**
+   * Compare two objects
+   *
+   * - First, compare sorted property names
+   * - Next, compare the property values
+   *
+   * @param {Object} x
+   * @param {Object} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+
+  function compareObjects(compareNatural, x, y) {
+    var keysX = Object.keys(x);
+    var keysY = Object.keys(y); // compare keys
+
+    keysX.sort(_javascriptNaturalSort.default);
+    keysY.sort(_javascriptNaturalSort.default);
+    var c = compareArrays(compareNatural, keysX, keysY);
+
+    if (c !== 0) {
+      return c;
+    } // compare values
+
+
+    for (var i = 0; i < keysX.length; i++) {
+      var v = compareNatural(x[keysX[i]], y[keysY[i]]);
+
+      if (v !== 0) {
+        return v;
+      }
+    }
+
+    return 0;
+  }
+});
+/**
+ * Compare two complex numbers, `x` and `y`:
+ *
+ * - First, compare the real values of `x` and `y`
+ * - If equal, compare the imaginary values of `x` and `y`
+ *
+ * @params {Complex} x
+ * @params {Complex} y
+ * @returns {number} Returns the comparison result: -1, 0, or 1
+ */
+
+exports.createCompareNatural = createCompareNatural;
+
+function compareComplexNumbers(x, y) {
+  if (x.re > y.re) {
+    return 1;
+  }
+
+  if (x.re < y.re) {
+    return -1;
+  }
+
+  if (x.im > y.im) {
+    return 1;
+  }
+
+  if (x.im < y.im) {
+    return -1;
+  }
+
+  return 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/compareText.js b/node_modules/mathjs/lib/cjs/function/relational/compareText.js
new file mode 100644
index 0000000..4757a27
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/compareText.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompareTextNumber = exports.createCompareText = void 0;
+
+var _string = require("../../utils/string.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm13.js");
+
+var name = 'compareText';
+var dependencies = ['typed', 'matrix'];
+var createCompareText = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix;
+  var algorithm13 = (0, _algorithm2.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Compare two strings lexically. Comparison is case sensitive.
+   * Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.compareText(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareText('B', 'A')     // returns 1
+   *    math.compareText('2', '10')    // returns 1
+   *    math.compare('2', '10')        // returns -1
+   *    math.compareNatural('2', '10') // returns -1
+   *
+   *    math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, equalText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns the result of the comparison:
+   *                                        1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+
+  return typed(name, {
+    'any, any': _string.compareText,
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, _string.compareText);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, _string.compareText, false);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, _string.compareText, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, _string.compareText, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, _string.compareText, true).valueOf();
+    }
+  });
+});
+exports.createCompareText = createCompareText;
+var createCompareTextNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed'], function (_ref2) {
+  var typed = _ref2.typed;
+  return typed(name, {
+    'any, any': _string.compareText
+  });
+});
+exports.createCompareTextNumber = createCompareTextNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/deepEqual.js b/node_modules/mathjs/lib/cjs/function/relational/deepEqual.js
new file mode 100644
index 0000000..9ae0d17
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/deepEqual.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDeepEqual = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'deepEqual';
+var dependencies = ['typed', 'equal'];
+var createDeepEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equal = _ref.equal;
+
+  /**
+   * Test element wise whether two matrices are equal.
+   * The function accepts both matrices and scalar values.
+   *
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.deepEqual(x, y)
+   *
+   * Examples:
+   *
+   *    math.deepEqual(2, 4)   // returns false
+   *
+   *    a = [2, 5, 1]
+   *    b = [2, 7, 1]
+   *
+   *    math.deepEqual(a, b)   // returns false
+   *    math.equal(a, b)       // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    equal, unequal
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns true when the input matrices have the same size and each of their elements is equal.
+   */
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      return _deepEqual(x.valueOf(), y.valueOf());
+    }
+  });
+  /**
+   * Test whether two arrays have the same size and all elements are equal
+   * @param {Array | *} x
+   * @param {Array | *} y
+   * @return {boolean} Returns true if both arrays are deep equal
+   */
+
+  function _deepEqual(x, y) {
+    if (Array.isArray(x)) {
+      if (Array.isArray(y)) {
+        var len = x.length;
+
+        if (len !== y.length) {
+          return false;
+        }
+
+        for (var i = 0; i < len; i++) {
+          if (!_deepEqual(x[i], y[i])) {
+            return false;
+          }
+        }
+
+        return true;
+      } else {
+        return false;
+      }
+    } else {
+      if (Array.isArray(y)) {
+        return false;
+      } else {
+        return equal(x, y);
+      }
+    }
+  }
+});
+exports.createDeepEqual = createDeepEqual;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/equal.js b/node_modules/mathjs/lib/cjs/function/relational/equal.js
new file mode 100644
index 0000000..9127447
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/equal.js
@@ -0,0 +1,183 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEqualNumber = exports.createEqual = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'equal';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+var createEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Test whether two values are equal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * smaller than the configured epsilon. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is only
+   * equal to `null` and nothing else, and `undefined` is only equal to
+   * `undefined` and nothing else. Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.equal(x, y)
+   *
+   * Examples:
+   *
+   *    math.equal(2 + 2, 3)         // returns false
+   *    math.equal(2 + 2, 4)         // returns true
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.equal(a, b)             // returns true
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.equal(c, d)             // returns [true, false, true]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.equal("1000", "1e3")    // returns true
+   *    math.equal(0, null)          // returns false
+   *
+   * See also:
+   *
+   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText
+   *
+   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false
+   */
+
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y === null;
+      }
+
+      if (y === null) {
+        return x === null;
+      }
+
+      if (x === undefined) {
+        return y === undefined;
+      }
+
+      if (y === undefined) {
+        return x === undefined;
+      }
+
+      return equalScalar(x, y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, equalScalar);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, equalScalar, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, equalScalar, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, equalScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, equalScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, equalScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, equalScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, equalScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, equalScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, equalScalar, true).valueOf();
+    }
+  });
+});
+exports.createEqual = createEqual;
+var createEqualNumber = (0, _factory.factory)(name, ['typed', 'equalScalar'], function (_ref2) {
+  var typed = _ref2.typed,
+      equalScalar = _ref2.equalScalar;
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y === null;
+      }
+
+      if (y === null) {
+        return x === null;
+      }
+
+      if (x === undefined) {
+        return y === undefined;
+      }
+
+      if (y === undefined) {
+        return x === undefined;
+      }
+
+      return equalScalar(x, y);
+    }
+  });
+});
+exports.createEqualNumber = createEqualNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/equalScalar.js b/node_modules/mathjs/lib/cjs/function/relational/equalScalar.js
new file mode 100644
index 0000000..c8410ad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/equalScalar.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEqualScalarNumber = exports.createEqualScalar = void 0;
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _complex = require("../../utils/complex.js");
+
+var name = 'equalScalar';
+var dependencies = ['typed', 'config'];
+var createEqualScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config;
+
+  /**
+   * Test whether two scalar values are nearly equal.
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit} x   First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Complex} y          Second value to compare
+   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false
+   * @private
+   */
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x === y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return (0, _number.nearlyEqual)(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.eq(y) || (0, _nearlyEqual.nearlyEqual)(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.equals(y);
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return (0, _complex.complexEquals)(x, y, config.epsilon);
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    }
+  });
+});
+exports.createEqualScalar = createEqualScalar;
+var createEqualScalarNumber = (0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {
+  var typed = _ref2.typed,
+      config = _ref2.config;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return (0, _number.nearlyEqual)(x, y, config.epsilon);
+    }
+  });
+});
+exports.createEqualScalarNumber = createEqualScalarNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/equalText.js b/node_modules/mathjs/lib/cjs/function/relational/equalText.js
new file mode 100644
index 0000000..741e18c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/equalText.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEqualText = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'equalText';
+var dependencies = ['typed', 'compareText', 'isZero'];
+var createEqualText = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      compareText = _ref.compareText,
+      isZero = _ref.isZero;
+
+  /**
+   * Check equality of two strings. Comparison is case sensitive.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.equalText(x, y)
+   *
+   * Examples:
+   *
+   *    math.equalText('Hello', 'Hello')     // returns true
+   *    math.equalText('a', 'A')             // returns false
+   *    math.equal('2e3', '2000')            // returns true
+   *    math.equalText('2e3', '2000')        // returns false
+   *
+   *    math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    equal, compareText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.
+   */
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      return isZero(compareText(x, y));
+    }
+  });
+});
+exports.createEqualText = createEqualText;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/larger.js b/node_modules/mathjs/lib/cjs/function/relational/larger.js
new file mode 100644
index 0000000..3d0e35b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/larger.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLargerNumber = exports.createLarger = void 0;
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var name = 'larger';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+var createLarger = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Test whether value x is larger than y.
+   *
+   * The function returns true when x is larger than y and the relative
+   * difference between x and y is larger than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.larger(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 3)             // returns false
+   *    math.larger(5, 2 + 2)         // returns true
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.larger(a, b)             // returns false
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x > y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x > y && !(0, _number.nearlyEqual)(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.gt(y) && !(0, _nearlyEqual.nearlyEqual)(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) === 1;
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createLarger = createLarger;
+var createLargerNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {
+  var typed = _ref2.typed,
+      config = _ref2.config;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x > y && !(0, _number.nearlyEqual)(x, y, config.epsilon);
+    }
+  });
+});
+exports.createLargerNumber = createLargerNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/largerEq.js b/node_modules/mathjs/lib/cjs/function/relational/largerEq.js
new file mode 100644
index 0000000..331045b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/largerEq.js
@@ -0,0 +1,155 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLargerEqNumber = exports.createLargerEq = void 0;
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var name = 'largerEq';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+var createLargerEq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Test whether value x is larger or equal to y.
+   *
+   * The function returns true when x is larger than y or the relative
+   * difference between x and y is smaller than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.largerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 1 + 1)         // returns false
+   *    math.largerEq(2, 1 + 1)       // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x >= y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x >= y || (0, _number.nearlyEqual)(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.gte(y) || (0, _nearlyEqual.nearlyEqual)(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) !== -1;
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createLargerEq = createLargerEq;
+var createLargerEqNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {
+  var typed = _ref2.typed,
+      config = _ref2.config;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x >= y || (0, _number.nearlyEqual)(x, y, config.epsilon);
+    }
+  });
+});
+exports.createLargerEqNumber = createLargerEqNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/smaller.js b/node_modules/mathjs/lib/cjs/function/relational/smaller.js
new file mode 100644
index 0000000..0259730
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/smaller.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSmallerNumber = exports.createSmaller = void 0;
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var name = 'smaller';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+var createSmaller = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Test whether value x is smaller than y.
+   *
+   * The function returns true when x is smaller than y and the relative
+   * difference between x and y is smaller than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smaller(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(2, 3)            // returns true
+   *    math.smaller(5, 2 * 2)        // returns false
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.smaller(a, b)            // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smallerEq, smaller, smallerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x < y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x < y && !(0, _number.nearlyEqual)(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.lt(y) && !(0, _nearlyEqual.nearlyEqual)(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) === -1;
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createSmaller = createSmaller;
+var createSmallerNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {
+  var typed = _ref2.typed,
+      config = _ref2.config;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x < y && !(0, _number.nearlyEqual)(x, y, config.epsilon);
+    }
+  });
+});
+exports.createSmallerNumber = createSmallerNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/smallerEq.js b/node_modules/mathjs/lib/cjs/function/relational/smallerEq.js
new file mode 100644
index 0000000..34bae40
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/smallerEq.js
@@ -0,0 +1,155 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSmallerEqNumber = exports.createSmallerEq = void 0;
+
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var name = 'smallerEq';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+var createSmallerEq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Test whether value x is smaller or equal to y.
+   *
+   * The function returns true when x is smaller than y or the relative
+   * difference between x and y is smaller than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smallerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(1 + 2, 3)        // returns false
+   *    math.smallerEq(1 + 2, 3)      // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x <= y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x <= y || (0, _number.nearlyEqual)(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.lte(y) || (0, _nearlyEqual.nearlyEqual)(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) !== 1;
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createSmallerEq = createSmallerEq;
+var createSmallerEqNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {
+  var typed = _ref2.typed,
+      config = _ref2.config;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x <= y || (0, _number.nearlyEqual)(x, y, config.epsilon);
+    }
+  });
+});
+exports.createSmallerEqNumber = createSmallerEqNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/unequal.js b/node_modules/mathjs/lib/cjs/function/relational/unequal.js
new file mode 100644
index 0000000..52630a1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/unequal.js
@@ -0,0 +1,187 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnequalNumber = exports.createUnequal = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm07.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm14.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm13.js");
+
+var name = 'unequal';
+var dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix'];
+var createUnequal = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      equalScalar = _ref.equalScalar,
+      matrix = _ref.matrix,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm03 = (0, _algorithm.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm07 = (0, _algorithm2.createAlgorithm07)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm12 = (0, _algorithm3.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm5.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm4.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Test whether two values are unequal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * larger than the configured epsilon. The function cannot be used to compare
+   * values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.
+   * Strings are compared by their numerical value.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is unequal
+   * with everything except `null`, and `undefined` is unequal with everything
+   * except `undefined`.
+   *
+   * Syntax:
+   *
+   *    math.unequal(x, y)
+   *
+   * Examples:
+   *
+   *    math.unequal(2 + 2, 3)       // returns true
+   *    math.unequal(2 + 2, 4)       // returns false
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.unequal(a, b)           // returns false
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.unequal(c, d)           // returns [false, true, false]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.unequal(0, null)        // returns true
+   * See also:
+   *
+   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false
+   */
+
+  return typed('unequal', {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y !== null;
+      }
+
+      if (y === null) {
+        return x !== null;
+      }
+
+      if (x === undefined) {
+        return y !== undefined;
+      }
+
+      if (y === undefined) {
+        return x !== undefined;
+      }
+
+      return _unequal(x, y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, _unequal);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, _unequal, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, _unequal, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, _unequal);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, _unequal, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, _unequal, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, _unequal, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, _unequal, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, _unequal, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, _unequal, true).valueOf();
+    }
+  });
+
+  function _unequal(x, y) {
+    return !equalScalar(x, y);
+  }
+});
+exports.createUnequal = createUnequal;
+var createUnequalNumber = (0, _factory.factory)(name, ['typed', 'equalScalar'], function (_ref2) {
+  var typed = _ref2.typed,
+      equalScalar = _ref2.equalScalar;
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y !== null;
+      }
+
+      if (y === null) {
+        return x !== null;
+      }
+
+      if (x === undefined) {
+        return y !== undefined;
+      }
+
+      if (y === undefined) {
+        return x !== undefined;
+      }
+
+      return !equalScalar(x, y);
+    }
+  });
+});
+exports.createUnequalNumber = createUnequalNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setCartesian.js b/node_modules/mathjs/lib/cjs/function/set/setCartesian.js
new file mode 100644
index 0000000..f24d44c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setCartesian.js
@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetCartesian = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setCartesian';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+var createSetCartesian = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      subset = _ref.subset,
+      compareNatural = _ref.compareNatural,
+      Index = _ref.Index,
+      DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Create the cartesian product of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays
+   * and the values will be sorted in ascending order before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setCartesian(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]
+   *    math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference, setPowerset
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The cartesian product of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      var result = [];
+
+      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {
+        // if any of them is empty, return empty
+        var b1 = (0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);
+        var b2 = (0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);
+        result = [];
+
+        for (var i = 0; i < b1.length; i++) {
+          for (var j = 0; j < b2.length; j++) {
+            result.push([b1[i], b2[j]]);
+          }
+        }
+      } // return an array, if both inputs were arrays
+
+
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return result;
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix(result);
+    }
+  });
+});
+exports.createSetCartesian = createSetCartesian;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setDifference.js b/node_modules/mathjs/lib/cjs/function/set/setDifference.js
new file mode 100644
index 0000000..e4b7292
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setDifference.js
@@ -0,0 +1,86 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetDifference = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setDifference';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+var createSetDifference = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      subset = _ref.subset,
+      compareNatural = _ref.compareNatural,
+      Index = _ref.Index,
+      DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]
+   *    math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setSymDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      var result;
+
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty-anything=empty
+        result = [];
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything-empty=anything
+        return (0, _array.flatten)(a1.toArray());
+      } else {
+        var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+        var inb2;
+
+        for (var i = 0; i < b1.length; i++) {
+          inb2 = false;
+
+          for (var j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              inb2 = true;
+              break;
+            }
+          }
+
+          if (!inb2) {
+            result.push(b1[i]);
+          }
+        }
+      } // return an array, if both inputs were arrays
+
+
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return (0, _array.generalize)(result);
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix((0, _array.generalize)(result));
+    }
+  });
+});
+exports.createSetDifference = createSetDifference;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setDistinct.js b/node_modules/mathjs/lib/cjs/function/set/setDistinct.js
new file mode 100644
index 0000000..2818958
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setDistinct.js
@@ -0,0 +1,70 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetDistinct = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setDistinct';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+var createSetDistinct = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      subset = _ref.subset,
+      compareNatural = _ref.compareNatural,
+      Index = _ref.Index,
+      DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Collect the distinct elements of a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDistinct(set)
+   *
+   * Examples:
+   *
+   *    math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]
+   *
+   * See also:
+   *
+   *    setMultiplicity
+   *
+   * @param {Array | Matrix}    a  A multiset
+   * @return {Array | Matrix}    A set containing the distinc elements of the multiset
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      var result;
+
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        result = [];
+      } else {
+        var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        result = [];
+        result.push(b[0]);
+
+        for (var i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            result.push(b[i]);
+          }
+        }
+      } // return an array, if the input was an array
+
+
+      if (Array.isArray(a)) {
+        return result;
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix(result);
+    }
+  });
+});
+exports.createSetDistinct = createSetDistinct;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setIntersect.js b/node_modules/mathjs/lib/cjs/function/set/setIntersect.js
new file mode 100644
index 0000000..58bd546
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setIntersect.js
@@ -0,0 +1,76 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetIntersect = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setIntersect';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+var createSetIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      subset = _ref.subset,
+      compareNatural = _ref.compareNatural,
+      Index = _ref.Index,
+      DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Create the intersection of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIntersect(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]
+   *    math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]
+   *
+   * See also:
+   *
+   *    setUnion, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The intersection of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      var result;
+
+      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {
+        // of any of them is empty, return empty
+        result = [];
+      } else {
+        var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+
+        for (var i = 0; i < b1.length; i++) {
+          for (var j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              result.push(b1[i]);
+              break;
+            }
+          }
+        }
+      } // return an array, if both inputs were arrays
+
+
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return (0, _array.generalize)(result);
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix((0, _array.generalize)(result));
+    }
+  });
+});
+exports.createSetIntersect = createSetIntersect;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setIsSubset.js b/node_modules/mathjs/lib/cjs/function/set/setIsSubset.js
new file mode 100644
index 0000000..20ebce2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setIsSubset.js
@@ -0,0 +1,76 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetIsSubset = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setIsSubset';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+var createSetIsSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      subset = _ref.subset,
+      compareNatural = _ref.compareNatural,
+      Index = _ref.Index;
+
+  /**
+   * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIsSubset(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false
+   *    math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {boolean}            true | false
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty is a subset of anything
+        return true;
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything is not a subset of empty
+        return false;
+      }
+
+      var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+      var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+      var inb2;
+
+      for (var i = 0; i < b1.length; i++) {
+        inb2 = false;
+
+        for (var j = 0; j < b2.length; j++) {
+          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+            // the identifier is always a decimal int
+            inb2 = true;
+            break;
+          }
+        }
+
+        if (inb2 === false) {
+          return false;
+        }
+      }
+
+      return true;
+    }
+  });
+});
+exports.createSetIsSubset = createSetIsSubset;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setMultiplicity.js b/node_modules/mathjs/lib/cjs/function/set/setMultiplicity.js
new file mode 100644
index 0000000..4e69501
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setMultiplicity.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetMultiplicity = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setMultiplicity';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+var createSetMultiplicity = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      subset = _ref.subset,
+      compareNatural = _ref.compareNatural,
+      Index = _ref.Index;
+
+  /**
+   * Count the multiplicity of an element in a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setMultiplicity(element, set)
+   *
+   * Examples:
+   *
+   *    math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1
+   *    math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2
+   *
+   * See also:
+   *
+   *    setDistinct, setSize
+   *
+   * @param {number | BigNumber | Fraction | Complex} e  An element in the multiset
+   * @param {Array | Matrix}     a  A multiset
+   * @return {number}            The number of how many times the multiset contains the element
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction | Complex, Array | Matrix': function numberBigNumberFractionComplexArrayMatrix(e, a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return 0
+        return 0;
+      }
+
+      var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray());
+      var count = 0;
+
+      for (var i = 0; i < b.length; i++) {
+        if (compareNatural(b[i], e) === 0) {
+          count++;
+        }
+      }
+
+      return count;
+    }
+  });
+});
+exports.createSetMultiplicity = createSetMultiplicity;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setPowerset.js b/node_modules/mathjs/lib/cjs/function/set/setPowerset.js
new file mode 100644
index 0000000..e6abcec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setPowerset.js
@@ -0,0 +1,90 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetPowerset = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setPowerset';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+var createSetPowerset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      subset = _ref.subset,
+      compareNatural = _ref.compareNatural,
+      Index = _ref.Index;
+
+  /**
+   * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setPowerset(set)
+   *
+   * Examples:
+   *
+   *    math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
+   *
+   * See also:
+   *
+   *    setCartesian
+   *
+   * @param {Array | Matrix}    a  A (multi)set
+   * @return {Array}    The powerset of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        return [];
+      }
+
+      var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+      var result = [];
+      var number = 0;
+
+      while (number.toString(2).length <= b.length) {
+        result.push(_subset(b, number.toString(2).split('').reverse()));
+        number++;
+      } // can not return a matrix, because of the different size of the subarrays
+
+
+      return _sort(result);
+    }
+  }); // create subset
+
+  function _subset(array, bitarray) {
+    var result = [];
+
+    for (var i = 0; i < bitarray.length; i++) {
+      if (bitarray[i] === '1') {
+        result.push(array[i]);
+      }
+    }
+
+    return result;
+  } // sort subsests by length
+
+
+  function _sort(array) {
+    var temp = [];
+
+    for (var i = array.length - 1; i > 0; i--) {
+      for (var j = 0; j < i; j++) {
+        if (array[j].length > array[j + 1].length) {
+          temp = array[j];
+          array[j] = array[j + 1];
+          array[j + 1] = temp;
+        }
+      }
+    }
+
+    return array;
+  }
+});
+exports.createSetPowerset = createSetPowerset;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setSize.js b/node_modules/mathjs/lib/cjs/function/set/setSize.js
new file mode 100644
index 0000000..cbd3cc1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setSize.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetSize = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setSize';
+var dependencies = ['typed', 'compareNatural'];
+var createSetSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      compareNatural = _ref.compareNatural;
+
+  /**
+   * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSize(set)
+   *    math.setSize(set, unique)
+   *
+   * Examples:
+   *
+   *    math.setSize([1, 2, 2, 4])          // returns 4
+   *    math.setSize([1, 2, 2, 4], true)    // returns 3
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a  A multiset
+   * @return {number}            The number of elements of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      return Array.isArray(a) ? (0, _array.flatten)(a).length : (0, _array.flatten)(a.toArray()).length;
+    },
+    'Array | Matrix, boolean': function ArrayMatrixBoolean(a, unique) {
+      if (unique === false || a.length === 0) {
+        return Array.isArray(a) ? (0, _array.flatten)(a).length : (0, _array.flatten)(a.toArray()).length;
+      } else {
+        var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        var count = 1;
+
+        for (var i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            count++;
+          }
+        }
+
+        return count;
+      }
+    }
+  });
+});
+exports.createSetSize = createSetSize;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setSymDifference.js b/node_modules/mathjs/lib/cjs/function/set/setSymDifference.js
new file mode 100644
index 0000000..cde3f5d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setSymDifference.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetSymDifference = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setSymDifference';
+var dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];
+var createSetSymDifference = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      concat = _ref.concat,
+      subset = _ref.subset,
+      setDifference = _ref.setDifference,
+      Index = _ref.Index;
+
+  /**
+   * Create the symmetric difference of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSymDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]
+   *    math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The symmetric difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return (0, _array.flatten)(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return (0, _array.flatten)(a1);
+      }
+
+      var b1 = (0, _array.flatten)(a1);
+      var b2 = (0, _array.flatten)(a2);
+      return concat(setDifference(b1, b2), setDifference(b2, b1));
+    }
+  });
+});
+exports.createSetSymDifference = createSetSymDifference;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setUnion.js b/node_modules/mathjs/lib/cjs/function/set/setUnion.js
new file mode 100644
index 0000000..2880724
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setUnion.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetUnion = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'setUnion';
+var dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];
+var createSetUnion = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      size = _ref.size,
+      concat = _ref.concat,
+      subset = _ref.subset,
+      setIntersect = _ref.setIntersect,
+      setSymDifference = _ref.setSymDifference,
+      Index = _ref.Index;
+
+  /**
+   * Create the union of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setUnion(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]
+   *    math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]
+   *
+   * See also:
+   *
+   *    setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The union of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return (0, _array.flatten)(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return (0, _array.flatten)(a1);
+      }
+
+      var b1 = (0, _array.flatten)(a1);
+      var b2 = (0, _array.flatten)(a2);
+      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));
+    }
+  });
+});
+exports.createSetUnion = createSetUnion;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/special/erf.js b/node_modules/mathjs/lib/cjs/function/special/erf.js
new file mode 100644
index 0000000..5524fe7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/special/erf.js
@@ -0,0 +1,174 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createErf = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+/* eslint-disable no-loss-of-precision */
+var name = 'erf';
+var dependencies = ['typed'];
+var createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Compute the erf function of a value using a rational Chebyshev
+   * approximations for different intervals of x.
+   *
+   * This is a translation of W. J. Cody's Fortran implementation from 1987
+   * ( https://www.netlib.org/specfun/erf ). See the AMS publication
+   * "Rational Chebyshev Approximations for the Error Function" by W. J. Cody
+   * for an explanation of this process.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.erf(x)
+   *
+   * Examples:
+   *
+   *    math.erf(0.2)    // returns 0.22270258921047847
+   *    math.erf(-0.5)   // returns -0.5204998778130465
+   *    math.erf(4)      // returns 0.9999999845827421
+   *
+   * @param {number | Array | Matrix} x   A real number
+   * @return {number | Array | Matrix}    The erf of `x`
+   */
+  return typed('name', {
+    number: function number(x) {
+      var y = Math.abs(x);
+
+      if (y >= MAX_NUM) {
+        return (0, _number.sign)(x);
+      }
+
+      if (y <= THRESH) {
+        return (0, _number.sign)(x) * erf1(y);
+      }
+
+      if (y <= 4.0) {
+        return (0, _number.sign)(x) * (1 - erfc2(y));
+      }
+
+      return (0, _number.sign)(x) * (1 - erfc3(y));
+    },
+    'Array | Matrix': function ArrayMatrix(n) {
+      return (0, _collection.deepMap)(n, this);
+    } // TODO: For complex numbers, use the approximation for the Faddeeva function
+    //  from "More Efficient Computation of the Complex Error Function" (AMS)
+
+  });
+  /**
+   * Approximates the error function erf() for x <= 0.46875 using this function:
+   *               n
+   * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))
+   *              j=0
+   */
+
+  function erf1(y) {
+    var ysq = y * y;
+    var xnum = P[0][4] * ysq;
+    var xden = ysq;
+    var i;
+
+    for (i = 0; i < 3; i += 1) {
+      xnum = (xnum + P[0][i]) * ysq;
+      xden = (xden + Q[0][i]) * ysq;
+    }
+
+    return y * (xnum + P[0][3]) / (xden + Q[0][3]);
+  }
+  /**
+   * Approximates the complement of the error function erfc() for
+   * 0.46875 <= x <= 4.0 using this function:
+   *                       n
+   * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)
+   *                      j=0
+   */
+
+
+  function erfc2(y) {
+    var xnum = P[1][8] * y;
+    var xden = y;
+    var i;
+
+    for (i = 0; i < 7; i += 1) {
+      xnum = (xnum + P[1][i]) * y;
+      xden = (xden + Q[1][i]) * y;
+    }
+
+    var result = (xnum + P[1][7]) / (xden + Q[1][7]);
+    var ysq = parseInt(y * 16) / 16;
+    var del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+  /**
+   * Approximates the complement of the error function erfc() for x > 4.0 using
+   * this function:
+   *
+   * erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +
+   *               n
+   *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]
+   *              j=0
+   */
+
+
+  function erfc3(y) {
+    var ysq = 1 / (y * y);
+    var xnum = P[2][5] * ysq;
+    var xden = ysq;
+    var i;
+
+    for (i = 0; i < 4; i += 1) {
+      xnum = (xnum + P[2][i]) * ysq;
+      xden = (xden + Q[2][i]) * ysq;
+    }
+
+    var result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);
+    result = (SQRPI - result) / y;
+    ysq = parseInt(y * 16) / 16;
+    var del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+});
+/**
+ * Upper bound for the first approximation interval, 0 <= x <= THRESH
+ * @constant
+ */
+
+exports.createErf = createErf;
+var THRESH = 0.46875;
+/**
+ * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)
+ * @constant
+ */
+
+var SQRPI = 5.6418958354775628695e-1;
+/**
+ * Coefficients for each term of the numerator sum (p_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+
+var P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];
+/**
+ * Coefficients for each term of the denominator sum (q_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+
+var Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];
+/**
+ * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is
+ * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will
+ * return 1
+ */
+
+var MAX_NUM = Math.pow(2, 53);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/cumsum.js b/node_modules/mathjs/lib/cjs/function/statistics/cumsum.js
new file mode 100644
index 0000000..e00050b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/cumsum.js
@@ -0,0 +1,151 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCumSum = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _switch2 = require("../../utils/switch.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var _array = require("../../utils/array.js");
+
+var _IndexError = require("../../error/IndexError.js");
+
+var name = 'cumsum';
+var dependencies = ['typed', 'add', 'unaryPlus'];
+var createCumSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      unaryPlus = _ref.unaryPlus;
+
+  /**
+   * Compute the cumulative sum of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the cumulative sums
+   * along a specified dimension (defaulting to the first) will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.cumsum(a, b, c, ...)
+   *     math.cumsum(A)
+   *
+   * Examples:
+   *
+   *     math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]
+   *     math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]
+   *     math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]
+   *     math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, sum
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The cumulative sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    Array: _cumsum,
+    Matrix: function Matrix(matrix) {
+      return matrix.create(_cumsum(matrix.valueOf()));
+    },
+    // sum([a, b, c, d, ...], dim)
+    'Array, number | BigNumber': _ncumSumDim,
+    'Matrix, number | BigNumber': function MatrixNumberBigNumber(matrix, dim) {
+      return matrix.create(_ncumSumDim(matrix.valueOf(), dim));
+    },
+    // cumsum(a, b, c, d, ...)
+    '...': function _(args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('All values expected to be scalar in function cumsum');
+      }
+
+      return _cumsum(args);
+    }
+  });
+  /**
+     * Recursively calculate the cumulative sum of an n-dimensional array
+     * @param {Array} array
+     * @return {number} cumsum
+     * @private
+     */
+
+  function _cumsum(array) {
+    try {
+      return _cumsummap(array);
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, name);
+    }
+  }
+
+  function _cumsummap(array) {
+    if (array.length === 0) {
+      return [];
+    }
+
+    var sums = [unaryPlus(array[0])]; // unaryPlus converts to number if need be
+
+    for (var i = 1; i < array.length; ++i) {
+      // Must use add below and not addScalar for the case of summing a
+      // 2+-dimensional array along the 0th dimension (the row vectors,
+      // or higher-d analogues, are literally added to each other).
+      sums.push(add(sums[i - 1], array[i]));
+    }
+
+    return sums;
+  }
+
+  function _ncumSumDim(array, dim) {
+    var size = (0, _array.arraySize)(array);
+
+    if (dim < 0 || dim >= size.length) {
+      // TODO: would be more clear when throwing a DimensionError here
+      throw new _IndexError.IndexError(dim, size.length);
+    }
+
+    try {
+      return _cumsumDimensional(array, dim);
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, name);
+    }
+  }
+  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */
+
+
+  function _cumsumDimensional(mat, dim) {
+    var i, ret, tran;
+
+    if (dim <= 0) {
+      var initialValue = mat[0][0];
+
+      if (!Array.isArray(initialValue)) {
+        return _cumsummap(mat);
+      } else {
+        tran = (0, _switch2._switch)(mat);
+        ret = [];
+
+        for (i = 0; i < tran.length; i++) {
+          ret[i] = _cumsumDimensional(tran[i], dim - 1);
+        }
+
+        return ret;
+      }
+    } else {
+      ret = [];
+
+      for (i = 0; i < mat.length; i++) {
+        ret[i] = _cumsumDimensional(mat[i], dim - 1);
+      }
+
+      return ret;
+    }
+  }
+});
+exports.createCumSum = createCumSum;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/mad.js b/node_modules/mathjs/lib/cjs/function/statistics/mad.js
new file mode 100644
index 0000000..81b4f07
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/mad.js
@@ -0,0 +1,77 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMad = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var name = 'mad';
+var dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];
+var createMad = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      abs = _ref.abs,
+      map = _ref.map,
+      median = _ref.median,
+      subtract = _ref.subtract;
+
+  /**
+   * Compute the median absolute deviation of a matrix or a list with values.
+   * The median absolute deviation is defined as the median of the absolute
+   * deviations from the median.
+   *
+   * Syntax:
+   *
+   *     math.mad(a, b, c, ...)
+   *     math.mad(A)
+   *
+   * Examples:
+   *
+   *     math.mad(10, 20, 30)             // returns 10
+   *     math.mad([1, 2, 3])              // returns 1
+   *     math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5
+   *
+   * See also:
+   *
+   *     median, mean, std, abs
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or multiple scalar values.
+   * @return {*} The median absolute deviation.
+   */
+  return typed(name, {
+    // mad([a, b, c, d, ...])
+    'Array | Matrix': _mad,
+    // mad(a, b, c, d, ...)
+    '...': function _(args) {
+      return _mad(args);
+    }
+  });
+
+  function _mad(array) {
+    array = (0, _array.flatten)(array.valueOf());
+
+    if (array.length === 0) {
+      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');
+    }
+
+    try {
+      var med = median(array);
+      return median(map(array, function (value) {
+        return abs(subtract(value, med));
+      }));
+    } catch (err) {
+      if (err instanceof TypeError && err.message.indexOf('median') !== -1) {
+        throw new TypeError(err.message.replace('median', 'mad'));
+      } else {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mad');
+      }
+    }
+  }
+});
+exports.createMad = createMad;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/max.js b/node_modules/mathjs/lib/cjs/function/statistics/max.js
new file mode 100644
index 0000000..8861b6e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/max.js
@@ -0,0 +1,118 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMax = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var name = 'max';
+var dependencies = ['typed', 'config', 'numeric', 'larger'];
+var createMax = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      numeric = _ref.numeric,
+      larger = _ref.larger;
+
+  /**
+   * Compute the maximum value of a matrix or a  list with values.
+   * In case of a multi dimensional array, the maximum of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.max(a, b, c, ...)
+   *     math.max(A)
+   *     math.max(A, dim)
+   *
+   * Examples:
+   *
+   *     math.max(2, 1, 4, 3)                  // returns 4
+   *     math.max([2, 1, 4, 3])                // returns 4
+   *
+   *     // maximum over a specified dimension (zero-based)
+   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]
+   *     math.max([[2, 5], [4, 3]], [1, 7], 1) // returns [5, 4, 7]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, min, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The maximum value
+   */
+  return typed(name, {
+    // max([a, b, c, d, ...])
+    'Array | Matrix': _max,
+    // max([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      return (0, _collection.reduce)(array, dim.valueOf(), _largest);
+    },
+    // max(a, b, c, d, ...)
+    '...': function _(args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function max');
+      }
+
+      return _max(args);
+    }
+  });
+  /**
+   * Return the largest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is largest, or y when y is largest
+   * @private
+   */
+
+  function _largest(x, y) {
+    try {
+      return larger(x, y) ? x : y;
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'max', y);
+    }
+  }
+  /**
+   * Recursively calculate the maximum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} max
+   * @private
+   */
+
+
+  function _max(array) {
+    var res;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        if (isNaN(value) && typeof value === 'number') {
+          res = NaN;
+        } else if (res === undefined || larger(value, res)) {
+          res = value;
+        }
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'max', value);
+      }
+    });
+
+    if (res === undefined) {
+      throw new Error('Cannot calculate max of an empty array');
+    } // make sure returning numeric value: parse a string into a numeric value
+
+
+    if (typeof res === 'string') {
+      res = numeric(res, config.number);
+    }
+
+    return res;
+  }
+});
+exports.createMax = createMax;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/mean.js b/node_modules/mathjs/lib/cjs/function/statistics/mean.js
new file mode 100644
index 0000000..1b6e529
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/mean.js
@@ -0,0 +1,109 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMean = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var name = 'mean';
+var dependencies = ['typed', 'add', 'divide'];
+var createMean = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      divide = _ref.divide;
+
+  /**
+   * Compute the mean value of matrix or a list with values.
+   * In case of a multi dimensional array, the mean of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.mean(a, b, c, ...)
+   *     math.mean(A)
+   *     math.mean(A, dim)
+   *
+   * Examples:
+   *
+   *     math.mean(2, 1, 4, 3)                     // returns 2.5
+   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725
+   *
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]
+   *
+   * See also:
+   *
+   *     median, min, max, sum, prod, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The mean of all values
+   */
+  return typed(name, {
+    // mean([a, b, c, d, ...])
+    'Array | Matrix': _mean,
+    // mean([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nmeanDim,
+    // mean(a, b, c, d, ...)
+    '...': function _(args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function mean');
+      }
+
+      return _mean(args);
+    }
+  });
+  /**
+   * Calculate the mean value in an n-dimensional array, returning a
+   * n-1 dimensional array
+   * @param {Array} array
+   * @param {number} dim
+   * @return {number} mean
+   * @private
+   */
+
+  function _nmeanDim(array, dim) {
+    try {
+      var sum = (0, _collection.reduce)(array, dim, add);
+      var s = Array.isArray(array) ? (0, _array.arraySize)(array) : array.size();
+      return divide(sum, s[dim]);
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mean');
+    }
+  }
+  /**
+   * Recursively calculate the mean value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} mean
+   * @private
+   */
+
+
+  function _mean(array) {
+    var sum;
+    var num = 0;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mean', value);
+      }
+    });
+
+    if (num === 0) {
+      throw new Error('Cannot calculate the mean of an empty array');
+    }
+
+    return divide(sum, num);
+  }
+});
+exports.createMean = createMean;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/median.js b/node_modules/mathjs/lib/cjs/function/statistics/median.js
new file mode 100644
index 0000000..ac67f0f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/median.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMedian = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var name = 'median';
+var dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];
+var createMedian = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      divide = _ref.divide,
+      compare = _ref.compare,
+      partitionSelect = _ref.partitionSelect;
+
+  /**
+   * Recursively calculate the median of an n-dimensional array
+   * @param {Array} array
+   * @return {Number} median
+   * @private
+   */
+  function _median(array) {
+    try {
+      array = (0, _array.flatten)(array.valueOf());
+      var num = array.length;
+
+      if (num === 0) {
+        throw new Error('Cannot calculate median of an empty array');
+      }
+
+      if (num % 2 === 0) {
+        // even: return the average of the two middle values
+        var mid = num / 2 - 1;
+        var right = partitionSelect(array, mid + 1); // array now partitioned at mid + 1, take max of left part
+
+        var left = array[mid];
+
+        for (var i = 0; i < mid; ++i) {
+          if (compare(array[i], left) > 0) {
+            left = array[i];
+          }
+        }
+
+        return middle2(left, right);
+      } else {
+        // odd: return the middle value
+        var m = partitionSelect(array, (num - 1) / 2);
+        return middle(m);
+      }
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'median');
+    }
+  } // helper function to type check the middle value of the array
+
+
+  var middle = typed({
+    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(value) {
+      return value;
+    }
+  }); // helper function to type check the two middle value of the array
+
+  var middle2 = typed({
+    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function numberBigNumberComplexUnitNumberBigNumberComplexUnit(left, right) {
+      return divide(add(left, right), 2);
+    }
+  });
+  /**
+   * Compute the median of a matrix or a list with values. The values are
+   * sorted and the middle value is returned. In case of an even number of
+   * values, the average of the two middle values is returned.
+   * Supported types of values are: Number, BigNumber, Unit
+   *
+   * In case of a (multi dimensional) array or matrix, the median of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.median(a, b, c, ...)
+   *     math.median(A)
+   *
+   * Examples:
+   *
+   *     math.median(5, 2, 7)        // returns 5
+   *     math.median([3, -1, 5, 7])  // returns 4
+   *
+   * See also:
+   *
+   *     mean, min, max, sum, prod, std, variance, quantileSeq
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The median
+   */
+
+  return typed(name, {
+    // median([a, b, c, d, ...])
+    'Array | Matrix': _median,
+    // median([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      // TODO: implement median(A, dim)
+      throw new Error('median(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], ...)
+    },
+    // median(a, b, c, d, ...)
+    '...': function _(args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function median');
+      }
+
+      return _median(args);
+    }
+  });
+});
+exports.createMedian = createMedian;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/min.js b/node_modules/mathjs/lib/cjs/function/statistics/min.js
new file mode 100644
index 0000000..70cca38
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/min.js
@@ -0,0 +1,118 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMin = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var name = 'min';
+var dependencies = ['typed', 'config', 'numeric', 'smaller'];
+var createMin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      numeric = _ref.numeric,
+      smaller = _ref.smaller;
+
+  /**
+   * Compute the minimum value of a matrix or a  list of values.
+   * In case of a multi dimensional array, the minimum of the flattened array
+   * will be calculated. When `dim` is provided, the minimum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.min(a, b, c, ...)
+   *     math.min(A)
+   *     math.min(A, dim)
+   *
+   * Examples:
+   *
+   *     math.min(2, 1, 4, 3)                  // returns 1
+   *     math.min([2, 1, 4, 3])                // returns 1
+   *
+   *     // minimum over a specified dimension (zero-based)
+   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]
+   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, max, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The minimum value
+   */
+  return typed(name, {
+    // min([a, b, c, d, ...])
+    'Array | Matrix': _min,
+    // min([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      return (0, _collection.reduce)(array, dim.valueOf(), _smallest);
+    },
+    // min(a, b, c, d, ...)
+    '...': function _(args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function min');
+      }
+
+      return _min(args);
+    }
+  });
+  /**
+   * Return the smallest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is smallest, or y when y is smallest
+   * @private
+   */
+
+  function _smallest(x, y) {
+    try {
+      return smaller(x, y) ? x : y;
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'min', y);
+    }
+  }
+  /**
+   * Recursively calculate the minimum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} min
+   * @private
+   */
+
+
+  function _min(array) {
+    var min;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        if (isNaN(value) && typeof value === 'number') {
+          min = NaN;
+        } else if (min === undefined || smaller(value, min)) {
+          min = value;
+        }
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'min', value);
+      }
+    });
+
+    if (min === undefined) {
+      throw new Error('Cannot calculate min of an empty array');
+    } // make sure returning numeric value: parse a string into a numeric value
+
+
+    if (typeof min === 'string') {
+      min = numeric(min, config.number);
+    }
+
+    return min;
+  }
+});
+exports.createMin = createMin;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/mode.js b/node_modules/mathjs/lib/cjs/function/statistics/mode.js
new file mode 100644
index 0000000..22714c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/mode.js
@@ -0,0 +1,93 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMode = void 0;
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'mode';
+var dependencies = ['typed', 'isNaN', 'isNumeric'];
+var createMode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      isNaN = _ref.isNaN,
+      isNumeric = _ref.isNumeric;
+
+  /**
+  * Computes the mode of a set of numbers or a list with values(numbers or characters).
+  * If there are more than one modes, it returns a list of those values.
+  *
+  * Syntax:
+  *
+  *     math.mode(a, b, c, ...)
+  *     math.mode(A)
+  *
+  * Examples:
+  *
+  *     math.mode(2, 1, 4, 3, 1)                            // returns [1]
+  *     math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]
+  *     math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]
+  *     math.mode('a','a','b','c')                           // returns ["a"]
+  *     math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, "abc"]
+  *
+  * See also:
+  *
+  *     median,
+  *     mean
+  *
+  * @param {... *} args  A single matrix
+  * @return {*} The mode of all values
+  */
+  return typed(name, {
+    'Array | Matrix': _mode,
+    '...': function _(args) {
+      return _mode(args);
+    }
+  });
+  /**
+   * Calculates the mode in an 1-dimensional array
+   * @param {Array} values
+   * @return {Array} mode
+   * @private
+   */
+
+  function _mode(values) {
+    values = (0, _array.flatten)(values.valueOf());
+    var num = values.length;
+
+    if (num === 0) {
+      throw new Error('Cannot calculate mode of an empty array');
+    }
+
+    var count = {};
+    var mode = [];
+    var max = 0;
+
+    for (var i = 0; i < values.length; i++) {
+      var value = values[i];
+
+      if (isNumeric(value) && isNaN(value)) {
+        throw new Error('Cannot calculate mode of an array containing NaN values');
+      }
+
+      if (!(value in count)) {
+        count[value] = 0;
+      }
+
+      count[value]++;
+
+      if (count[value] === max) {
+        mode.push(value);
+      } else if (count[value] > max) {
+        max = count[value];
+        mode = [value];
+      }
+    }
+
+    return mode;
+  }
+});
+exports.createMode = createMode;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/prod.js b/node_modules/mathjs/lib/cjs/function/statistics/prod.js
new file mode 100644
index 0000000..a4f3f46
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/prod.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createProd = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var name = 'prod';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];
+var createProd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      multiplyScalar = _ref.multiplyScalar,
+      numeric = _ref.numeric;
+
+  /**
+   * Compute the product of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.prod(a, b, c, ...)
+   *     math.prod(A)
+   *
+   * Examples:
+   *
+   *     math.multiply(2, 3)           // returns 6
+   *     math.prod(2, 3)               // returns 6
+   *     math.prod(2, 3, 4)            // returns 24
+   *     math.prod([2, 3, 4])          // returns 24
+   *     math.prod([[2, 5], [4, 3]])   // returns 120
+   *
+   * See also:
+   *
+   *    mean, median, min, max, sum, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The product of all values
+   */
+  return typed(name, {
+    // prod([a, b, c, d, ...])
+    'Array | Matrix': _prod,
+    // prod([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      // TODO: implement prod(A, dim)
+      throw new Error('prod(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], math.prod)
+    },
+    // prod(a, b, c, d, ...)
+    '...': function _(args) {
+      return _prod(args);
+    }
+  });
+  /**
+   * Recursively calculate the product of an n-dimensional array
+   * @param {Array} array
+   * @return {number} prod
+   * @private
+   */
+
+  function _prod(array) {
+    var prod;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        prod = prod === undefined ? value : multiplyScalar(prod, value);
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'prod', value);
+      }
+    }); // make sure returning numeric value: parse a string into a numeric value
+
+    if (typeof prod === 'string') {
+      prod = numeric(prod, config.number);
+    }
+
+    if (prod === undefined) {
+      throw new Error('Cannot calculate prod of an empty array');
+    }
+
+    return prod;
+  }
+});
+exports.createProd = createProd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/cjs/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..897dfc3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/quantileSeq.js
@@ -0,0 +1,285 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createQuantileSeq = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _number = require("../../utils/number.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'quantileSeq';
+var dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare'];
+var createQuantileSeq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      multiply = _ref.multiply,
+      partitionSelect = _ref.partitionSelect,
+      compare = _ref.compare;
+
+  /**
+   * Compute the prob order quantile of a matrix or a list with values.
+   * The sequence is sorted and the middle value is returned.
+   * Supported types of sequence values are: Number, BigNumber, Unit
+   * Supported types of probability are: Number, BigNumber
+   *
+   * In case of a (multi dimensional) array or matrix, the prob order quantile
+   * of all elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.quantileSeq(A, prob[, sorted])
+   *     math.quantileSeq(A, [prob1, prob2, ...][, sorted])
+   *     math.quantileSeq(A, N[, sorted])
+   *
+   * Examples:
+   *
+   *     math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4
+   *     math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]
+   *     math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]
+   *     math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4
+   *
+   * See also:
+   *
+   *     median, mean, min, max, sum, prod, std, variance
+   *
+   * @param {Array, Matrix} data                A single matrix or Array
+   * @param {Number, BigNumber, Array} probOrN  prob is the order of the quantile, while N is
+   *                                            the amount of evenly distributed steps of
+   *                                            probabilities; only one of these options can
+   *                                            be provided
+   * @param {Boolean} sorted=false              is data sorted in ascending order
+   * @return {Number, BigNumber, Unit, Array}   Quantile(s)
+   */
+  function quantileSeq(data, probOrN, sorted) {
+    var probArr, dataArr, one;
+
+    if (arguments.length < 2 || arguments.length > 3) {
+      throw new SyntaxError('Function quantileSeq requires two or three parameters');
+    }
+
+    if ((0, _is.isCollection)(data)) {
+      sorted = sorted || false;
+
+      if (typeof sorted === 'boolean') {
+        dataArr = data.valueOf();
+
+        if ((0, _is.isNumber)(probOrN)) {
+          if (probOrN < 0) {
+            throw new Error('N/prob must be non-negative');
+          }
+
+          if (probOrN <= 1) {
+            // quantileSeq([a, b, c, d, ...], prob[,sorted])
+            return _quantileSeq(dataArr, probOrN, sorted);
+          }
+
+          if (probOrN > 1) {
+            // quantileSeq([a, b, c, d, ...], N[,sorted])
+            if (!(0, _number.isInteger)(probOrN)) {
+              throw new Error('N must be a positive integer');
+            }
+
+            var nPlusOne = probOrN + 1;
+            probArr = new Array(probOrN);
+
+            for (var i = 0; i < probOrN;) {
+              probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);
+            }
+
+            return probArr;
+          }
+        }
+
+        if ((0, _is.isBigNumber)(probOrN)) {
+          var BigNumber = probOrN.constructor;
+
+          if (probOrN.isNegative()) {
+            throw new Error('N/prob must be non-negative');
+          }
+
+          one = new BigNumber(1);
+
+          if (probOrN.lte(one)) {
+            // quantileSeq([a, b, c, d, ...], prob[,sorted])
+            return new BigNumber(_quantileSeq(dataArr, probOrN, sorted));
+          }
+
+          if (probOrN.gt(one)) {
+            // quantileSeq([a, b, c, d, ...], N[,sorted])
+            if (!probOrN.isInteger()) {
+              throw new Error('N must be a positive integer');
+            } // largest possible Array length is 2^32-1
+            // 2^32 < 10^15, thus safe conversion guaranteed
+
+
+            var intN = probOrN.toNumber();
+
+            if (intN > 4294967295) {
+              throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array');
+            }
+
+            var _nPlusOne = new BigNumber(intN + 1);
+
+            probArr = new Array(intN);
+
+            for (var _i = 0; _i < intN;) {
+              probArr[_i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++_i).div(_nPlusOne), sorted));
+            }
+
+            return probArr;
+          }
+        }
+
+        if (Array.isArray(probOrN)) {
+          // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
+          probArr = new Array(probOrN.length);
+
+          for (var _i2 = 0; _i2 < probArr.length; ++_i2) {
+            var currProb = probOrN[_i2];
+
+            if ((0, _is.isNumber)(currProb)) {
+              if (currProb < 0 || currProb > 1) {
+                throw new Error('Probability must be between 0 and 1, inclusive');
+              }
+            } else if ((0, _is.isBigNumber)(currProb)) {
+              one = new currProb.constructor(1);
+
+              if (currProb.isNegative() || currProb.gt(one)) {
+                throw new Error('Probability must be between 0 and 1, inclusive');
+              }
+            } else {
+              throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+            }
+
+            probArr[_i2] = _quantileSeq(dataArr, currProb, sorted);
+          }
+
+          return probArr;
+        }
+
+        throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+      }
+
+      throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+    }
+
+    throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+  }
+  /**
+   * Calculate the prob order quantile of an n-dimensional array.
+   *
+   * @param {Array} array
+   * @param {Number, BigNumber} prob
+   * @param {Boolean} sorted
+   * @return {Number, BigNumber, Unit} prob order quantile
+   * @private
+   */
+
+
+  function _quantileSeq(array, prob, sorted) {
+    var flat = (0, _array.flatten)(array);
+    var len = flat.length;
+
+    if (len === 0) {
+      throw new Error('Cannot calculate quantile of an empty sequence');
+    }
+
+    if ((0, _is.isNumber)(prob)) {
+      var _index = prob * (len - 1);
+
+      var _fracPart = _index % 1;
+
+      if (_fracPart === 0) {
+        var value = sorted ? flat[_index] : partitionSelect(flat, _index);
+        validate(value);
+        return value;
+      }
+
+      var _integerPart = Math.floor(_index);
+
+      var _left;
+
+      var _right;
+
+      if (sorted) {
+        _left = flat[_integerPart];
+        _right = flat[_integerPart + 1];
+      } else {
+        _right = partitionSelect(flat, _integerPart + 1); // max of partition is kth largest
+
+        _left = flat[_integerPart];
+
+        for (var i = 0; i < _integerPart; ++i) {
+          if (compare(flat[i], _left) > 0) {
+            _left = flat[i];
+          }
+        }
+      }
+
+      validate(_left);
+      validate(_right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+
+      return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));
+    } // If prob is a BigNumber
+
+
+    var index = prob.times(len - 1);
+
+    if (index.isInteger()) {
+      index = index.toNumber();
+
+      var _value = sorted ? flat[index] : partitionSelect(flat, index);
+
+      validate(_value);
+      return _value;
+    }
+
+    var integerPart = index.floor();
+    var fracPart = index.minus(integerPart);
+    var integerPartNumber = integerPart.toNumber();
+    var left;
+    var right;
+
+    if (sorted) {
+      left = flat[integerPartNumber];
+      right = flat[integerPartNumber + 1];
+    } else {
+      right = partitionSelect(flat, integerPartNumber + 1); // max of partition is kth largest
+
+      left = flat[integerPartNumber];
+
+      for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {
+        if (compare(flat[_i3], left) > 0) {
+          left = flat[_i3];
+        }
+      }
+    }
+
+    validate(left);
+    validate(right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+
+    var one = new fracPart.constructor(1);
+    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));
+  }
+  /**
+   * Check if array value types are valid, throw error otherwise.
+   * @param {number | BigNumber | Unit} x
+   * @param {number | BigNumber | Unit} x
+   * @private
+   */
+
+
+  var validate = typed({
+    'number | BigNumber | Unit': function numberBigNumberUnit(x) {
+      return x;
+    }
+  });
+  return quantileSeq;
+});
+exports.createQuantileSeq = createQuantileSeq;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/std.js b/node_modules/mathjs/lib/cjs/function/statistics/std.js
new file mode 100644
index 0000000..cadbb42
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/std.js
@@ -0,0 +1,100 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createStd = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'std';
+var dependencies = ['typed', 'sqrt', 'variance'];
+var createStd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      sqrt = _ref.sqrt,
+      variance = _ref.variance;
+
+  /**
+   * Compute the standard deviation of a matrix or a  list with values.
+   * The standard deviations is defined as the square root of the variance:
+   * `std(A) = sqrt(variance(A))`.
+   * In case of a (multi dimensional) array or matrix, the standard deviation
+   * over all elements will be calculated by default, unless an axis is specified
+   * in which case the standard deviation will be computed along that axis.
+   *
+   * Additionally, it is possible to compute the standard deviation along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Syntax:
+   *
+   *     math.std(a, b, c, ...)
+   *     math.std(A)
+   *     math.std(A, normalization)
+   *     math.std(A, dimension)
+   *     math.std(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.std(2, 4, 6)                     // returns 2
+   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611
+   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979
+   *     math.std([2, 4, 6, 8], 'biased')      // returns 2
+   *
+   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707
+   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, sum, variance
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the standard deviation for a matrix
+   * @return {*} The standard deviation
+   */
+  return typed(name, {
+    // std([a, b, c, d, ...])
+    'Array | Matrix': _std,
+    // std([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _std,
+    // std([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': _std,
+    // std([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _std,
+    // std(a, b, c, d, ...)
+    '...': function _(args) {
+      return _std(args);
+    }
+  });
+
+  function _std(array, normalization) {
+    if (array.length === 0) {
+      throw new SyntaxError('Function std requires one or more parameters (0 provided)');
+    }
+
+    try {
+      return sqrt(variance.apply(null, arguments));
+    } catch (err) {
+      if (err instanceof TypeError && err.message.indexOf(' variance') !== -1) {
+        throw new TypeError(err.message.replace(' variance', ' std'));
+      } else {
+        throw err;
+      }
+    }
+  }
+});
+exports.createStd = createStd;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/sum.js b/node_modules/mathjs/lib/cjs/function/statistics/sum.js
new file mode 100644
index 0000000..b667d37
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/sum.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSum = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var name = 'sum';
+var dependencies = ['typed', 'config', 'add', 'numeric'];
+var createSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      add = _ref.add,
+      numeric = _ref.numeric;
+
+  /**
+   * Compute the sum of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.sum(a, b, c, ...)
+   *     math.sum(A)
+   *
+   * Examples:
+   *
+   *     math.sum(2, 1, 4, 3)               // returns 10
+   *     math.sum([2, 1, 4, 3])             // returns 10
+   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, cumsum
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    'Array | Matrix': _sum,
+    // sum([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nsumDim,
+    // sum(a, b, c, d, ...)
+    '...': function _(args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function sum');
+      }
+
+      return _sum(args);
+    }
+  });
+  /**
+   * Recursively calculate the sum of an n-dimensional array
+   * @param {Array | Matrix} array
+   * @return {number} sum
+   * @private
+   */
+
+  function _sum(array) {
+    var sum;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'sum', value);
+      }
+    }); // make sure returning numeric value: parse a string into a numeric value
+
+    if (sum === undefined) {
+      sum = numeric(0, config.number);
+    }
+
+    if (typeof sum === 'string') {
+      sum = numeric(sum, config.number);
+    }
+
+    return sum;
+  }
+
+  function _nsumDim(array, dim) {
+    try {
+      var sum = (0, _collection.reduce)(array, dim, add);
+      return sum;
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'sum');
+    }
+  }
+});
+exports.createSum = createSum;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/utils/improveErrorMessage.js b/node_modules/mathjs/lib/cjs/function/statistics/utils/improveErrorMessage.js
new file mode 100644
index 0000000..7f29ac9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/utils/improveErrorMessage.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.improveErrorMessage = improveErrorMessage;
+
+var _is = require("../../../utils/is.js");
+
+/**
+ * Improve error messages for statistics functions. Errors are typically
+ * thrown in an internally used function like larger, causing the error
+ * not to mention the function (like max) which is actually used by the user.
+ *
+ * @param {Error} err
+ * @param {String} fnName
+ * @param {*} [value]
+ * @return {Error}
+ */
+function improveErrorMessage(err, fnName, value) {
+  // TODO: add information with the index (also needs transform in expression parser)
+  var details;
+
+  if (String(err).indexOf('Unexpected type') !== -1) {
+    details = arguments.length > 2 ? ' (type: ' + (0, _is.typeOf)(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';
+    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);
+  }
+
+  if (String(err).indexOf('complex numbers') !== -1) {
+    details = arguments.length > 2 ? ' (type: ' + (0, _is.typeOf)(value) + ', value: ' + JSON.stringify(value) + ')' : '';
+    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);
+  }
+
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/variance.js b/node_modules/mathjs/lib/cjs/function/statistics/variance.js
new file mode 100644
index 0000000..19c22e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/variance.js
@@ -0,0 +1,173 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createVariance = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+
+var DEFAULT_NORMALIZATION = 'unbiased';
+var name = 'variance';
+var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];
+var createVariance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      add = _ref.add,
+      subtract = _ref.subtract,
+      multiply = _ref.multiply,
+      divide = _ref.divide,
+      apply = _ref.apply,
+      isNaN = _ref.isNaN;
+
+  /**
+   * Compute the variance of a matrix or a  list with values.
+   * In case of a (multi dimensional) array or matrix, the variance over all
+   * elements will be calculated.
+   *
+   * Additionally, it is possible to compute the variance along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Note that older browser may not like the variable name `var`. In that
+   * case, the function can be called as `math['var'](...)` instead of
+   * `math.var(...)`.
+   *
+   * Syntax:
+   *
+   *     math.variance(a, b, c, ...)
+   *     math.variance(A)
+   *     math.variance(A, normalization)
+   *     math.variance(A, dimension)
+   *     math.variance(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.variance(2, 4, 6)                     // returns 4
+   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667
+   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5
+   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4
+   *
+   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, std, sum
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the variance for a matrix
+   * @return {*} The variance
+   */
+  return typed(name, {
+    // variance([a, b, c, d, ...])
+    'Array | Matrix': function ArrayMatrix(array) {
+      return _var(array, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _var,
+    // variance([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      return _varDim(array, dim, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _varDim,
+    // variance(a, b, c, d, ...)
+    '...': function _(args) {
+      return _var(args, DEFAULT_NORMALIZATION);
+    }
+  });
+  /**
+   * Recursively calculate the variance of an n-dimensional array
+   * @param {Array} array
+   * @param {string} normalization
+   *                        Determines how to normalize the variance:
+   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)
+   *                        - 'uncorrected' The sum of squared errors is divided by n
+   *                        - 'biased'      The sum of squared errors is divided by (n + 1)
+   * @return {number | BigNumber} variance
+   * @private
+   */
+
+  function _var(array, normalization) {
+    var sum;
+    var num = 0;
+
+    if (array.length === 0) {
+      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+    } // calculate the mean and number of elements
+
+
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'variance', value);
+      }
+    });
+    if (num === 0) throw new Error('Cannot calculate variance of an empty array');
+    var mean = divide(sum, num); // calculate the variance
+
+    sum = undefined;
+    (0, _collection.deepForEach)(array, function (value) {
+      var diff = subtract(value, mean);
+      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff));
+    });
+
+    if (isNaN(sum)) {
+      return sum;
+    }
+
+    switch (normalization) {
+      case 'uncorrected':
+        return divide(sum, num);
+
+      case 'biased':
+        return divide(sum, num + 1);
+
+      case 'unbiased':
+        {
+          var zero = (0, _is.isBigNumber)(sum) ? sum.mul(0) : 0;
+          return num === 1 ? zero : divide(sum, num - 1);
+        }
+
+      default:
+        throw new Error('Unknown normalization "' + normalization + '". ' + 'Choose "unbiased" (default), "uncorrected", or "biased".');
+    }
+  }
+
+  function _varDim(array, dim, normalization) {
+    try {
+      if (array.length === 0) {
+        throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+      }
+
+      return apply(array, dim, function (x) {
+        return _var(x, normalization);
+      });
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'variance');
+    }
+  }
+});
+exports.createVariance = createVariance;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/bin.js b/node_modules/mathjs/lib/cjs/function/string/bin.js
new file mode 100644
index 0000000..73f6ea2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/bin.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBin = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'bin';
+var dependencies = ['typed', 'format'];
+/**
+ * Format a number as binary.
+ *
+ * Syntax:
+ *
+ *    math.bin(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0b10"
+ *    math.bin(2)
+ *
+ * See also:
+ *
+ *    oct
+ *    hex
+ *
+ * @param {number} value    Value to be stringified
+ * @param {number} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+var createBin = (0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      format = _ref.format;
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      return format(n, {
+        notation: 'bin'
+      });
+    },
+    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {
+      return format(n, {
+        notation: 'bin',
+        wordSize: wordSize
+      });
+    }
+  });
+});
+exports.createBin = createBin;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/format.js b/node_modules/mathjs/lib/cjs/function/string/format.js
new file mode 100644
index 0000000..7b1fd7a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/format.js
@@ -0,0 +1,140 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFormat = void 0;
+
+var _string = require("../../utils/string.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'format';
+var dependencies = ['typed'];
+var createFormat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Format a value of any type into a string.
+   *
+   * Syntax:
+   *
+   *    math.format(value)
+   *    math.format(value, options)
+   *    math.format(value, precision)
+   *    math.format(value, callback)
+   *
+   * Where:
+   *
+   *  - `value: *`
+   *    The value to be formatted
+   *  - `options: Object`
+   *    An object with formatting options. Available options:
+   *    - `notation: string`
+   *      Number notation. Choose from:
+   *      - 'fixed'
+   *        Always use regular number notation.
+   *        For example '123.40' and '14000000'
+   *      - 'exponential'
+   *        Always use exponential notation.
+   *        For example '1.234e+2' and '1.4e+7'
+   *      - 'engineering'
+   *        Always use engineering notation: always have exponential notation,
+   *        and select the exponent to be a multiple of 3.
+   *        For example '123.4e+0' and '14.0e+6'
+   *      - 'auto' (default)
+   *        Regular number notation for numbers having an absolute value between
+   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.
+   *        Lower bound is included, upper bound is excluded.
+   *        For example '123.4' and '1.4e7'.
+   *      - 'bin', 'oct, or 'hex'
+   *        Format the number using binary, octal, or hexadecimal notation.
+   *        For example '0b1101' and '0x10fe'.
+   *    - `wordSize: number`
+   *      The word size in bits to use for formatting in binary, octal, or
+   *      hexadecimal notation. To be used only with 'bin', 'oct', or 'hex'
+   *      values for 'notation' option. When this option is defined the value
+   *      is formatted as a signed twos complement integer of the given word
+   *      size and the size suffix is appended to the output.
+   *      For example format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+   *      Default value is undefined.
+   *    - `precision: number`
+   *      Limit the number of digits of the formatted value.
+   *      For regular numbers, must be a number between 0 and 16.
+   *      For bignumbers, the maximum depends on the configured precision,
+   *      see function `config()`.
+   *      In case of notations 'exponential', 'engineering', and 'auto', `precision`
+   *      defines the total number of significant digits returned.
+   *      In case of notation 'fixed', `precision` defines the number of
+   *      significant digits after the decimal point.
+   *      `precision` is undefined by default.
+   *    - `lowerExp: number`
+   *      Exponent determining the lower boundary for formatting a value with
+   *      an exponent when `notation='auto`. Default value is `-3`.
+   *    - `upperExp: number`
+   *      Exponent determining the upper boundary for formatting a value with
+   *      an exponent when `notation='auto`. Default value is `5`.
+   *    - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.
+   *      For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is
+   *      configured, and will output `0.(3)` when 'decimal' is configured.
+   *    - `truncate: number`. Specifies the maximum allowed length of the
+   *      returned string. If it would have been longer, the excess characters
+   *      are deleted and replaced with `'...'`.
+   * - `callback: function`
+   *   A custom formatting function, invoked for all numeric elements in `value`,
+   *   for example all elements of a matrix, or the real and imaginary
+   *   parts of a complex number. This callback can be used to override the
+   *   built-in numeric notation with any type of formatting. Function `callback`
+   *   is called with `value` as parameter and must return a string.
+   *
+   * When `value` is an Object:
+   *
+   * - When the object contains a property `format` being a function, this function
+   *   is invoked as `value.format(options)` and the result is returned.
+   * - When the object has its own `toString` method, this method is invoked
+   *   and the result is returned.
+   * - In other cases the function will loop over all object properties and
+   *   return JSON object notation like '{"a": 2, "b": 3}'.
+   *
+   * When value is a function:
+   *
+   * - When the function has a property `syntax`, it returns this
+   *   syntax description.
+   * - In other cases, a string `'function'` is returned.
+   *
+   * Examples:
+   *
+   *    math.format(6.4)                                        // returns '6.4'
+   *    math.format(1240000)                                    // returns '1.24e6'
+   *    math.format(1/3)                                        // returns '0.3333333333333333'
+   *    math.format(1/3, 3)                                     // returns '0.333'
+   *    math.format(21385, 2)                                   // returns '21000'
+   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'
+   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'
+   *    math.format(12400,{notation: 'engineering'})            // returns '12.400e+3'
+   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'
+   *
+   *    function formatCurrency(value) {
+   *      // return currency notation with two digits:
+   *      return '$' + value.toFixed(2)
+   *
+   *      // you could also use math.format inside the callback:
+   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})
+   *    }
+   *    math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'
+   *
+   * See also:
+   *
+   *    print
+   *
+   * @param {*} value                               Value to be stringified
+   * @param {Object | Function | number} [options]  Formatting options
+   * @return {string} The formatted value
+   */
+  return typed(name, {
+    any: _string.format,
+    'any, Object | function | number': _string.format
+  });
+});
+exports.createFormat = createFormat;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/hex.js b/node_modules/mathjs/lib/cjs/function/string/hex.js
new file mode 100644
index 0000000..61ddd4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/hex.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHex = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'hex';
+var dependencies = ['typed', 'format'];
+/**
+ * Format a number as hexadecimal.
+ *
+ * Syntax:
+ *
+ *    math.hex(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0xF0"
+ *    math.hex(240)
+ *
+ * See also:
+ *
+ *    oct
+ *    bin
+ *
+ * @param {number} value    Value to be stringified
+ * @param {number} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+var createHex = (0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      format = _ref.format;
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      return format(n, {
+        notation: 'hex'
+      });
+    },
+    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {
+      return format(n, {
+        notation: 'hex',
+        wordSize: wordSize
+      });
+    }
+  });
+});
+exports.createHex = createHex;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/oct.js b/node_modules/mathjs/lib/cjs/function/string/oct.js
new file mode 100644
index 0000000..89e933a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/oct.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOct = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'oct';
+var dependencies = ['typed', 'format'];
+/**
+ * Format a number as octal.
+ *
+ * Syntax:
+ *
+ *    math.oct(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0o70"
+ *    math.oct(56)
+ *
+ * See also:
+ *
+ *    bin
+ *    hex
+ *
+ * @param {number} value    Value to be stringified
+ * @param {number} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+var createOct = (0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      format = _ref.format;
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      return format(n, {
+        notation: 'oct'
+      });
+    },
+    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {
+      return format(n, {
+        notation: 'oct',
+        wordSize: wordSize
+      });
+    }
+  });
+});
+exports.createOct = createOct;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/print.js b/node_modules/mathjs/lib/cjs/function/string/print.js
new file mode 100644
index 0000000..dbecda0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/print.js
@@ -0,0 +1,100 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPrint = void 0;
+
+var _string = require("../../utils/string.js");
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'print';
+var dependencies = ['typed'];
+var createPrint = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Interpolate values into a string template.
+   *
+   * Syntax:
+   *
+   *     math.print(template, values)
+   *     math.print(template, values, precision)
+   *     math.print(template, values, options)
+   *
+   * Example usage:
+   *
+   *     // the following outputs: 'Lucy is 5 years old'
+   *     math.print('Lucy is $age years old', {age: 5})
+   *
+   *     // the following outputs: 'The value of pi is 3.141592654'
+   *     math.print('The value of pi is $pi', {pi: math.pi}, 10)
+   *
+   *     // the following outputs: 'hello Mary! The date is 2013-03-23'
+   *     math.print('Hello $user.name! The date is $date', {
+   *       user: {
+   *         name: 'Mary',
+   *       },
+   *       date: new Date(2013, 2, 23).toISOString().substring(0, 10)
+   *     })
+   *
+   *     // the following outputs: 'My favorite fruits are apples and bananas !'
+   *     math.print('My favorite fruits are $0 and $1 !', [
+   *       'apples',
+   *       'bananas'
+   *     ])
+   *
+   * See also:
+   *
+   *     format
+   *
+   * @param {string} template           A string containing variable placeholders.
+   * @param {Object | Array | Matrix}   values An object or array containing variables
+   *                                    which will be filled in in the template.
+   * @param {number | Object} [options] Formatting options,
+   *                                    or the number of digits to format numbers.
+   *                                    See function math.format for a description
+   *                                    of all options.
+   * @return {string} Interpolated string
+   */
+  return typed(name, {
+    // note: Matrix will be converted automatically to an Array
+    'string, Object | Array': _print,
+    'string, Object | Array, number | Object': _print
+  });
+});
+/**
+ * Interpolate values into a string template.
+ * @param {string} template
+ * @param {Object} values
+ * @param {number | Object} [options]
+ * @returns {string} Interpolated string
+ * @private
+ */
+
+exports.createPrint = createPrint;
+
+function _print(template, values, options) {
+  return template.replace(/\$([\w.]+)/g, function (original, key) {
+    var keys = key.split('.');
+    var value = values[keys.shift()];
+
+    while (keys.length && value !== undefined) {
+      var k = keys.shift();
+      value = k ? value[k] : value + '.';
+    }
+
+    if (value !== undefined) {
+      if (!(0, _is.isString)(value)) {
+        return (0, _string.format)(value, options);
+      } else {
+        return value;
+      }
+    }
+
+    return original;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acos.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acos.js
new file mode 100644
index 0000000..e8f88e8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acos.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcos = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'acos';
+var dependencies = ['typed', 'config', 'Complex'];
+var createAcos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the inverse cosine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acos(x)
+   *
+   * Examples:
+   *
+   *    math.acos(0.5)           // returns number 1.0471975511965979
+   *    math.acos(math.cos(1.5)) // returns number 1.5
+   *
+   *    math.acos(2)             // returns Complex 0 + 1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    cos, atan, asin
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} The arc cosine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.acos(x);
+      } else {
+        return new Complex(x, 0).acos();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.acos();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.acos();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAcos = createAcos;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acosh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acosh.js
new file mode 100644
index 0000000..42d99c5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acosh.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcosh = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'acosh';
+var dependencies = ['typed', 'config', 'Complex'];
+var createAcosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the hyperbolic arccos of a value,
+   * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acosh(x)
+   *
+   * Examples:
+   *
+   *    math.acosh(1.5)       // returns 0.9624236501192069
+   *
+   * See also:
+   *
+   *    cosh, asinh, atanh
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arccosine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 1 || config.predictable) {
+        return (0, _index.acoshNumber)(x);
+      }
+
+      if (x <= -1) {
+        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);
+      }
+
+      return new Complex(x, 0).acosh();
+    },
+    Complex: function Complex(x) {
+      return x.acosh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.acosh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAcosh = createAcosh;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acot.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acot.js
new file mode 100644
index 0000000..f548422
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acot.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcot = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'acot';
+var dependencies = ['typed', 'BigNumber'];
+var createAcot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acot(x)
+   *
+   * Examples:
+   *
+   *    math.acot(0.5)           // returns number 0.4636476090008061
+   *    math.acot(math.cot(1.5)) // returns number 1.5
+   *
+   *    math.acot(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    cot, atan
+   *
+   * @param {number | Complex | Array | Matrix} x   Function input
+   * @return {number | Complex | Array | Matrix} The arc cotangent of x
+   */
+  return typed(name, {
+    number: _index.acotNumber,
+    Complex: function Complex(x) {
+      return x.acot();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).atan();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAcot = createAcot;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acoth.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acoth.js
new file mode 100644
index 0000000..565c672
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acoth.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcoth = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'acoth';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+var createAcoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the hyperbolic arccotangent of a value,
+   * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acoth(x)
+   *
+   * Examples:
+   *
+   *    math.acoth(0.5)       // returns 0.8047189562170503
+   *
+   * See also:
+   *
+   *    acsch, asech
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arccotangent of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 1 || x <= -1 || config.predictable) {
+        return (0, _index.acothNumber)(x);
+      }
+
+      return new Complex(x, 0).acoth();
+    },
+    Complex: function Complex(x) {
+      return x.acoth();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).atanh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAcoth = createAcoth;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acsc.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acsc.js
new file mode 100644
index 0000000..ca2b244
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acsc.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcsc = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'acsc';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+var createAcsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acsc(x)
+   *
+   * Examples:
+   *
+   *    math.acsc(0.5)           // returns number 0.5235987755982989
+   *    math.acsc(math.csc(1.5)) // returns number ~1.5
+   *
+   *    math.acsc(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    csc, asin, asec
+   *
+   * @param {number | Complex | Array | Matrix} x   Function input
+   * @return {number | Complex | Array | Matrix} The arc cosecant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return (0, _index.acscNumber)(x);
+      }
+
+      return new Complex(x, 0).acsc();
+    },
+    Complex: function Complex(x) {
+      return x.acsc();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).asin();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAcsc = createAcsc;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acsch.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acsch.js
new file mode 100644
index 0000000..ed3cb24
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acsch.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcsch = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'acsch';
+var dependencies = ['typed', 'BigNumber'];
+var createAcsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the hyperbolic arccosecant of a value,
+   * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acsch(x)
+   *
+   * Examples:
+   *
+   *    math.acsch(0.5)       // returns 1.4436354751788103
+   *
+   * See also:
+   *
+   *    asech, acoth
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arccosecant of x
+   */
+  return typed(name, {
+    number: _index.acschNumber,
+    Complex: function Complex(x) {
+      return x.acsch();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).asinh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAcsch = createAcsch;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asec.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asec.js
new file mode 100644
index 0000000..0c337f6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asec.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsec = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'asec';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+var createAsec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asec(x)
+   *
+   * Examples:
+   *
+   *    math.asec(0.5)           // returns 1.0471975511965979
+   *    math.asec(math.sec(1.5)) // returns 1.5
+   *
+   *    math.asec(2)             // returns 0 + 1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    acos, acot, acsc
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} The arc secant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return (0, _index.asecNumber)(x);
+      }
+
+      return new Complex(x, 0).asec();
+    },
+    Complex: function Complex(x) {
+      return x.asec();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).acos();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAsec = createAsec;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asech.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asech.js
new file mode 100644
index 0000000..5d342be
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asech.js
@@ -0,0 +1,69 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsech = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'asech';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+var createAsech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the hyperbolic arcsecant of a value,
+   * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asech(x)
+   *
+   * Examples:
+   *
+   *    math.asech(0.5)       // returns 1.3169578969248166
+   *
+   * See also:
+   *
+   *    acsch, acoth
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arcsecant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        var xInv = 1 / x;
+
+        if (xInv > 0 || config.predictable) {
+          return (0, _index.asechNumber)(x);
+        }
+
+        var ret = Math.sqrt(xInv * xInv - 1);
+        return new Complex(Math.log(ret - xInv), Math.PI);
+      }
+
+      return new Complex(x, 0).asech();
+    },
+    Complex: function Complex(x) {
+      return x.asech();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).acosh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createAsech = createAsech;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asin.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asin.js
new file mode 100644
index 0000000..5fdfa3f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asin.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsin = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'asin';
+var dependencies = ['typed', 'config', 'Complex'];
+var createAsin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the inverse sine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asin(x)
+   *
+   * Examples:
+   *
+   *    math.asin(0.5)           // returns number 0.5235987755982989
+   *    math.asin(math.sin(1.5)) // returns number ~1.5
+   *
+   *    math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    sin, atan, acos
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} The arc sine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.asin(x);
+      } else {
+        return new Complex(x, 0).asin();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.asin();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.asin();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since asin(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createAsin = createAsin;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asinh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asinh.js
new file mode 100644
index 0000000..524e0db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asinh.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsinh = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'asinh';
+var dependencies = ['typed'];
+var createAsinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the hyperbolic arcsine of a value,
+   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asinh(x)
+   *
+   * Examples:
+   *
+   *    math.asinh(0.5)       // returns 0.48121182505960347
+   *
+   * See also:
+   *
+   *    acosh, atanh
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arcsine of x
+   */
+  return typed('asinh', {
+    number: _index.asinhNumber,
+    Complex: function Complex(x) {
+      return x.asinh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.asinh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since asinh(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createAsinh = createAsinh;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/atan.js b/node_modules/mathjs/lib/cjs/function/trigonometry/atan.js
new file mode 100644
index 0000000..a2a5ad9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/atan.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAtan = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'atan';
+var dependencies = ['typed'];
+var createAtan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the inverse tangent of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atan(x)
+   *
+   * Examples:
+   *
+   *    math.atan(0.5)           // returns number 0.4636476090008061
+   *    math.atan(math.tan(1.5)) // returns number 1.5
+   *
+   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    tan, asin, acos
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} The arc tangent of x
+   */
+  return typed('atan', {
+    number: function number(x) {
+      return Math.atan(x);
+    },
+    Complex: function Complex(x) {
+      return x.atan();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.atan();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since atan(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createAtan = createAtan;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/atan2.js b/node_modules/mathjs/lib/cjs/function/trigonometry/atan2.js
new file mode 100644
index 0000000..7ca8454
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/atan2.js
@@ -0,0 +1,139 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAtan2 = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm02.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm03.js");
+
+var _algorithm3 = require("../../type/matrix/utils/algorithm09.js");
+
+var _algorithm4 = require("../../type/matrix/utils/algorithm11.js");
+
+var _algorithm5 = require("../../type/matrix/utils/algorithm12.js");
+
+var _algorithm6 = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm7 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'atan2';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];
+var createAtan2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      equalScalar = _ref.equalScalar,
+      BigNumber = _ref.BigNumber,
+      DenseMatrix = _ref.DenseMatrix;
+  var algorithm02 = (0, _algorithm.createAlgorithm02)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm03 = (0, _algorithm2.createAlgorithm03)({
+    typed: typed
+  });
+  var algorithm09 = (0, _algorithm3.createAlgorithm09)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm11 = (0, _algorithm4.createAlgorithm11)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var algorithm12 = (0, _algorithm5.createAlgorithm12)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var algorithm13 = (0, _algorithm6.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm7.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Calculate the inverse tangent function with two arguments, y/x.
+   * By providing two arguments, the right quadrant of the computed angle can be
+   * determined.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atan2(y, x)
+   *
+   * Examples:
+   *
+   *    math.atan2(2, 2) / math.pi       // returns number 0.25
+   *
+   *    const angle = math.unit(60, 'deg') // returns Unit 60 deg
+   *    const x = math.cos(angle)
+   *    const y = math.sin(angle)
+   *
+   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    tan, atan, sin, cos
+   *
+   * @param {number | Array | Matrix} y  Second dimension
+   * @param {number | Array | Matrix} x  First dimension
+   * @return {number | Array | Matrix} Four-quadrant inverse tangent
+   */
+
+  return typed(name, {
+    'number, number': Math.atan2,
+    // Complex numbers doesn't seem to have a reasonable implementation of
+    // atan2(). Even Matlab removed the support, after they only calculated
+    // the atan only on base of the real part of the numbers and ignored the imaginary.
+    'BigNumber, BigNumber': function BigNumberBigNumber(y, x) {
+      return BigNumber.atan2(y, x);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm09(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      // mind the order of y and x!
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // mind the order of y and x
+      return algorithm12(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // mind the order of y and x
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createAtan2 = createAtan2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/atanh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/atanh.js
new file mode 100644
index 0000000..87b33d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/atanh.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAtanh = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'atanh';
+var dependencies = ['typed', 'config', 'Complex'];
+var createAtanh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the hyperbolic arctangent of a value,
+   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atanh(x)
+   *
+   * Examples:
+   *
+   *    math.atanh(0.5)       // returns 0.5493061443340549
+   *
+   * See also:
+   *
+   *    acosh, asinh
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arctangent of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        return (0, _index.atanhNumber)(x);
+      }
+
+      return new Complex(x, 0).atanh();
+    },
+    Complex: function Complex(x) {
+      return x.atanh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.atanh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since atanh(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createAtanh = createAtanh;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/cos.js b/node_modules/mathjs/lib/cjs/function/trigonometry/cos.js
new file mode 100644
index 0000000..b32dad4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/cos.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCos = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'cos';
+var dependencies = ['typed'];
+var createCos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the cosine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cos(x)
+   *
+   * Examples:
+   *
+   *    math.cos(2)                      // returns number -0.4161468365471422
+   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475
+   *    math.cos(math.unit(180, 'deg'))  // returns number -1
+   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Cosine of x
+   */
+  return typed(name, {
+    number: Math.cos,
+    Complex: function Complex(x) {
+      return x.cos();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.cos();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cos is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createCos = createCos;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/cosh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/cosh.js
new file mode 100644
index 0000000..8b7711d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/cosh.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCosh = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var name = 'cosh';
+var dependencies = ['typed'];
+var createCosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the hyperbolic cosine of a value,
+   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cosh(x)
+   *
+   * Examples:
+   *
+   *    math.cosh(0.5)       // returns number 1.1276259652063807
+   *
+   * See also:
+   *
+   *    sinh, tanh
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic cosine of x
+   */
+  return typed(name, {
+    number: _number.cosh,
+    Complex: function Complex(x) {
+      return x.cosh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.cosh();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cosh is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createCosh = createCosh;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/cot.js b/node_modules/mathjs/lib/cjs/function/trigonometry/cot.js
new file mode 100644
index 0000000..8d40e32
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/cot.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCot = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'cot';
+var dependencies = ['typed', 'BigNumber'];
+var createCot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cot(x)
+   *
+   * Examples:
+   *
+   *    math.cot(2)      // returns number -0.45765755436028577
+   *    1 / math.tan(2)  // returns number -0.45765755436028577
+   *
+   * See also:
+   *
+   *    tan, sec, csc
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Cotangent of x
+   */
+  return typed(name, {
+    number: _index.cotNumber,
+    Complex: function Complex(x) {
+      return x.cot();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.tan());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cot is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createCot = createCot;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/coth.js b/node_modules/mathjs/lib/cjs/function/trigonometry/coth.js
new file mode 100644
index 0000000..14d852c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/coth.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCoth = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'coth';
+var dependencies = ['typed', 'BigNumber'];
+var createCoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the hyperbolic cotangent of a value,
+   * defined as `coth(x) = 1 / tanh(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.coth(x)
+   *
+   * Examples:
+   *
+   *    // coth(x) = 1 / tanh(x)
+   *    math.coth(2)         // returns 1.0373147207275482
+   *    1 / math.tanh(2)     // returns 1.0373147207275482
+   *
+   * See also:
+   *
+   *    sinh, tanh, cosh
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic cotangent of x
+   */
+  return typed(name, {
+    number: _index.cothNumber,
+    Complex: function Complex(x) {
+      return x.coth();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.tanh());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function coth is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createCoth = createCoth;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/csc.js b/node_modules/mathjs/lib/cjs/function/trigonometry/csc.js
new file mode 100644
index 0000000..1647d13
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/csc.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsc = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'csc';
+var dependencies = ['typed', 'BigNumber'];
+var createCsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.csc(x)
+   *
+   * Examples:
+   *
+   *    math.csc(2)      // returns number 1.099750170294617
+   *    1 / math.sin(2)  // returns number 1.099750170294617
+   *
+   * See also:
+   *
+   *    sin, sec, cot
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Cosecant of x
+   */
+  return typed(name, {
+    number: _index.cscNumber,
+    Complex: function Complex(x) {
+      return x.csc();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.sin());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function csc is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createCsc = createCsc;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/csch.js b/node_modules/mathjs/lib/cjs/function/trigonometry/csch.js
new file mode 100644
index 0000000..017ae5f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/csch.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsch = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'csch';
+var dependencies = ['typed', 'BigNumber'];
+var createCsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the hyperbolic cosecant of a value,
+   * defined as `csch(x) = 1 / sinh(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.csch(x)
+   *
+   * Examples:
+   *
+   *    // csch(x) = 1/ sinh(x)
+   *    math.csch(0.5)       // returns 1.9190347513349437
+   *    1 / math.sinh(0.5)   // returns 1.9190347513349437
+   *
+   * See also:
+   *
+   *    sinh, sech, coth
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic cosecant of x
+   */
+  return typed(name, {
+    number: _index.cschNumber,
+    Complex: function Complex(x) {
+      return x.csch();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.sinh());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function csch is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createCsch = createCsch;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sec.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sec.js
new file mode 100644
index 0000000..4a634dd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sec.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSec = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'sec';
+var dependencies = ['typed', 'BigNumber'];
+var createSec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sec(x)
+   *
+   * Examples:
+   *
+   *    math.sec(2)      // returns number -2.4029979617223822
+   *    1 / math.cos(2)  // returns number -2.4029979617223822
+   *
+   * See also:
+   *
+   *    cos, csc, cot
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Secant of x
+   */
+  return typed(name, {
+    number: _index.secNumber,
+    Complex: function Complex(x) {
+      return x.sec();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.cos());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sec is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createSec = createSec;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sech.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sech.js
new file mode 100644
index 0000000..bb6f937
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sech.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSech = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'sech';
+var dependencies = ['typed', 'BigNumber'];
+var createSech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      _BigNumber = _ref.BigNumber;
+
+  /**
+   * Calculate the hyperbolic secant of a value,
+   * defined as `sech(x) = 1 / cosh(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sech(x)
+   *
+   * Examples:
+   *
+   *    // sech(x) = 1/ cosh(x)
+   *    math.sech(0.5)       // returns 0.886818883970074
+   *    1 / math.cosh(0.5)   // returns 0.886818883970074
+   *
+   * See also:
+   *
+   *    cosh, csch, coth
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic secant of x
+   */
+  return typed(name, {
+    number: _index.sechNumber,
+    Complex: function Complex(x) {
+      return x.sech();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.cosh());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sech is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createSech = createSech;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sin.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sin.js
new file mode 100644
index 0000000..7912a7e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sin.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSin = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'sin';
+var dependencies = ['typed'];
+var createSin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the sine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sin(x)
+   *
+   * Examples:
+   *
+   *    math.sin(2)                      // returns number 0.9092974268256813
+   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475
+   *    math.sin(math.unit(90, 'deg'))   // returns number 1
+   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Sine of x
+   */
+  return typed(name, {
+    number: Math.sin,
+    Complex: function Complex(x) {
+      return x.sin();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.sin();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sin is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sin(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createSin = createSin;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sinh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sinh.js
new file mode 100644
index 0000000..55b3508
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sinh.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSinh = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'sinh';
+var dependencies = ['typed'];
+var createSinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the hyperbolic sine of a value,
+   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sinh(x)
+   *
+   * Examples:
+   *
+   *    math.sinh(0.5)       // returns number 0.5210953054937474
+   *
+   * See also:
+   *
+   *    cosh, tanh
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic sine of x
+   */
+  return typed(name, {
+    number: _index.sinhNumber,
+    Complex: function Complex(x) {
+      return x.sinh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.sinh();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sinh is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sinh(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createSinh = createSinh;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/tan.js b/node_modules/mathjs/lib/cjs/function/trigonometry/tan.js
new file mode 100644
index 0000000..a8863b9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/tan.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTan = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var name = 'tan';
+var dependencies = ['typed'];
+var createTan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.tan(x)
+   *
+   * Examples:
+   *
+   *    math.tan(0.5)                    // returns number 0.5463024898437905
+   *    math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905
+   *    math.tan(math.pi / 4)            // returns number 1
+   *    math.tan(math.unit(45, 'deg'))   // returns number 1
+   *
+   * See also:
+   *
+   *    atan, sin, cos
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Tangent of x
+   */
+  return typed(name, {
+    number: Math.tan,
+    Complex: function Complex(x) {
+      return x.tan();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.tan();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function tan is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since tan(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createTan = createTan;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/tanh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/tanh.js
new file mode 100644
index 0000000..b17e886
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/tanh.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTanh = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var name = 'tanh';
+var dependencies = ['typed'];
+var createTanh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Calculate the hyperbolic tangent of a value,
+   * defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.tanh(x)
+   *
+   * Examples:
+   *
+   *    // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)
+   *    math.tanh(0.5)                   // returns 0.46211715726000974
+   *    math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974
+   *    1 / math.coth(0.5)               // returns 0.46211715726000974
+   *
+   * See also:
+   *
+   *    sinh, cosh, coth
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic tangent of x
+   */
+  return typed('tanh', {
+    number: _number.tanh,
+    Complex: function Complex(x) {
+      return x.tanh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.tanh();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function tanh is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since tanh(0) = 0
+      return (0, _collection.deepMap)(x, this, true);
+    }
+  });
+});
+exports.createTanh = createTanh;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/unit/to.js b/node_modules/mathjs/lib/cjs/function/unit/to.js
new file mode 100644
index 0000000..56eeeae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/unit/to.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTo = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _algorithm = require("../../type/matrix/utils/algorithm13.js");
+
+var _algorithm2 = require("../../type/matrix/utils/algorithm14.js");
+
+var name = 'to';
+var dependencies = ['typed', 'matrix'];
+var createTo = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix;
+  var algorithm13 = (0, _algorithm.createAlgorithm13)({
+    typed: typed
+  });
+  var algorithm14 = (0, _algorithm2.createAlgorithm14)({
+    typed: typed
+  });
+  /**
+   * Change the unit of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.to(x, unit)
+   *
+   * Examples:
+   *
+   *    math.to(math.unit('2 inch'), 'cm')                   // returns Unit 5.08 cm
+   *    math.to(math.unit('2 inch'), math.unit(null, 'cm'))  // returns Unit 5.08 cm
+   *    math.to(math.unit(16, 'bytes'), 'bits')              // returns Unit 128 bits
+   *
+   * See also:
+   *
+   *    unit
+   *
+   * @param {Unit | Array | Matrix} x     The unit to be converted.
+   * @param {Unit | Array | Matrix} unit  New unit. Can be a string like "cm"
+   *                                      or a unit without value.
+   * @return {Unit | Array | Matrix} value with changed, fixed unit.
+   */
+
+  return typed(name, {
+    'Unit, Unit | string': function UnitUnitString(x, unit) {
+      return x.to(unit);
+    },
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      // SparseMatrix does not support Units
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'Matrix, any': function MatrixAny(x, y) {
+      // SparseMatrix does not support Units
+      return algorithm14(x, y, this, false);
+    },
+    'any, Matrix': function anyMatrix(x, y) {
+      // SparseMatrix does not support Units
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+exports.createTo = createTo;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/clone.js b/node_modules/mathjs/lib/cjs/function/utils/clone.js
new file mode 100644
index 0000000..3a642ab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/clone.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createClone = void 0;
+
+var _object = require("../../utils/object.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'clone';
+var dependencies = ['typed'];
+var createClone = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Clone an object. Will make a deep copy of the data.
+   *
+   * Syntax:
+   *
+   *     math.clone(x)
+   *
+   * Examples:
+   *
+   *    math.clone(3.5)                   // returns number 3.5
+   *    math.clone(math.complex('2-4i') // returns Complex 2 - 4i
+   *    math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg
+   *    math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]
+   *    math.clone("hello world")         // returns string "hello world"
+   *
+   * @param {*} x   Object to be cloned
+   * @return {*} A clone of object x
+   */
+  return typed(name, {
+    any: _object.clone
+  });
+});
+exports.createClone = createClone;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/cjs/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..3862e81
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/hasNumericValue.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHasNumericValue = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'hasNumericValue';
+var dependencies = ['typed', 'isNumeric'];
+var createHasNumericValue = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      isNumeric = _ref.isNumeric;
+
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * In case of a string, true is returned if the string contains a numeric value.
+   *
+   * Syntax:
+   *
+   *     math.hasNumericValue(x)
+   *
+   * Examples:
+   *
+   *    math.hasNumericValue(2)                     // returns true
+   *    math.hasNumericValue('2')                   // returns true
+   *    math.isNumeric('2')                         // returns false
+   *    math.hasNumericValue(0)                     // returns true
+   *    math.hasNumericValue(math.bignumber(500))   // returns true
+   *    math.hasNumericValue(math.fraction(4))      // returns true
+   *    math.hasNumericValue(math.complex('2-4i')   // returns false
+   *    math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, isNumeric
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    string: function string(x) {
+      return x.trim().length > 0 && !isNaN(Number(x));
+    },
+    any: function any(x) {
+      return isNumeric(x);
+    }
+  });
+});
+exports.createHasNumericValue = createHasNumericValue;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isInteger.js b/node_modules/mathjs/lib/cjs/function/utils/isInteger.js
new file mode 100644
index 0000000..fcb6c29
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isInteger.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsInteger = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'isInteger';
+var dependencies = ['typed'];
+var createIsInteger = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Test whether a value is an integer number.
+   * The function supports `number`, `BigNumber`, and `Fraction`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isInteger(x)
+   *
+   * Examples:
+   *
+   *    math.isInteger(2)                     // returns true
+   *    math.isInteger(0)                     // returns true
+   *    math.isInteger(0.5)                   // returns false
+   *    math.isInteger(math.bignumber(500))   // returns true
+   *    math.isInteger(math.fraction(4))      // returns true
+   *    math.isInteger('3')                   // returns true
+   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]
+   *    math.isInteger(math.complex('2-4i')   // throws an error
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isZero
+   *
+   * @param {number | BigNumber | Fraction | Array | Matrix} x   Value to be tested
+   * @return {boolean}  Returns true when `x` contains a numeric, integer value.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: _number.isInteger,
+    // TODO: what to do with isInteger(add(0.1, 0.2))  ?
+    BigNumber: function BigNumber(x) {
+      return x.isInt();
+    },
+    Fraction: function Fraction(x) {
+      return x.d === 1 && isFinite(x.n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createIsInteger = createIsInteger;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isNaN.js b/node_modules/mathjs/lib/cjs/function/utils/isNaN.js
new file mode 100644
index 0000000..e3d9535
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isNaN.js
@@ -0,0 +1,67 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsNaN = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'isNaN';
+var dependencies = ['typed'];
+var createIsNaN = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Test whether a value is NaN (not a number).
+   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNaN(x)
+   *
+   * Examples:
+   *
+   *    math.isNaN(3)                     // returns false
+   *    math.isNaN(NaN)                   // returns true
+   *    math.isNaN(0)                     // returns false
+   *    math.isNaN(math.bignumber(NaN))   // returns true
+   *    math.isNaN(math.bignumber(0))     // returns false
+   *    math.isNaN(math.fraction(-2, 5))  // returns false
+   *    math.isNaN('-2')                  // returns false
+   *    math.isNaN([2, 0, -3, NaN]')      // returns [false, false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isNegative, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is NaN.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: _index.isNaNNumber,
+    BigNumber: function BigNumber(x) {
+      return x.isNaN();
+    },
+    Fraction: function Fraction(x) {
+      return false;
+    },
+    Complex: function Complex(x) {
+      return x.isNaN();
+    },
+    Unit: function Unit(x) {
+      return Number.isNaN(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, Number.isNaN);
+    }
+  });
+});
+exports.createIsNaN = createIsNaN;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isNegative.js b/node_modules/mathjs/lib/cjs/function/utils/isNegative.js
new file mode 100644
index 0000000..35cadb9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isNegative.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsNegative = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'isNegative';
+var dependencies = ['typed'];
+var createIsNegative = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Test whether a value is negative: smaller than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNegative(x)
+   *
+   * Examples:
+   *
+   *    math.isNegative(3)                     // returns false
+   *    math.isNegative(-2)                    // returns true
+   *    math.isNegative(0)                     // returns false
+   *    math.isNegative(-0)                    // returns false
+   *    math.isNegative(math.bignumber(2))     // returns false
+   *    math.isNegative(math.fraction(-2, 5))  // returns true
+   *    math.isNegative('-2')                  // returns true
+   *    math.isNegative([2, 0, -3]')           // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: _index.isNegativeNumber,
+    BigNumber: function BigNumber(x) {
+      return x.isNeg() && !x.isZero() && !x.isNaN();
+    },
+    Fraction: function Fraction(x) {
+      return x.s < 0; // It's enough to decide on the sign
+    },
+    Unit: function Unit(x) {
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createIsNegative = createIsNegative;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isNumeric.js b/node_modules/mathjs/lib/cjs/function/utils/isNumeric.js
new file mode 100644
index 0000000..417c380
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isNumeric.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsNumeric = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'isNumeric';
+var dependencies = ['typed'];
+var createIsNumeric = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNumeric(x)
+   *
+   * Examples:
+   *
+   *    math.isNumeric(2)                     // returns true
+   *    math.isNumeric('2')                   // returns false
+   *    math.hasNumericValue('2')             // returns true
+   *    math.isNumeric(0)                     // returns true
+   *    math.isNumeric(math.bignumber(500))   // returns true
+   *    math.isNumeric(math.fraction(4))      // returns true
+   *    math.isNumeric(math.complex('2-4i')   // returns false
+   *    math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, hasNumericValue
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, or `boolean`. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction | boolean': function numberBigNumberFractionBoolean() {
+      return true;
+    },
+    'Complex | Unit | string | null | undefined | Node': function ComplexUnitStringNullUndefinedNode() {
+      return false;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createIsNumeric = createIsNumeric;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isPositive.js b/node_modules/mathjs/lib/cjs/function/utils/isPositive.js
new file mode 100644
index 0000000..3f3fb2a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isPositive.js
@@ -0,0 +1,66 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsPositive = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'isPositive';
+var dependencies = ['typed'];
+var createIsPositive = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Test whether a value is positive: larger than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPositive(x)
+   *
+   * Examples:
+   *
+   *    math.isPositive(3)                     // returns true
+   *    math.isPositive(-2)                    // returns false
+   *    math.isPositive(0)                     // returns false
+   *    math.isPositive(-0)                    // returns false
+   *    math.isPositive(0.5)                   // returns true
+   *    math.isPositive(math.bignumber(2))     // returns true
+   *    math.isPositive(math.fraction(-2, 5))  // returns false
+   *    math.isPositive(math.fraction(1,3))    // returns false
+   *    math.isPositive('2')                   // returns true
+   *    math.isPositive([2, 0, -3])            // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: _index.isPositiveNumber,
+    BigNumber: function BigNumber(x) {
+      return !x.isNeg() && !x.isZero() && !x.isNaN();
+    },
+    Fraction: function Fraction(x) {
+      return x.s > 0 && x.n > 0;
+    },
+    Unit: function Unit(x) {
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createIsPositive = createIsPositive;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isPrime.js b/node_modules/mathjs/lib/cjs/function/utils/isPrime.js
new file mode 100644
index 0000000..d945c38
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isPrime.js
@@ -0,0 +1,152 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsPrime = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'isPrime';
+var dependencies = ['typed'];
+var createIsPrime = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Test whether a value is prime: has no divisors other than itself and one.
+   * The function supports type `number`, `bignumber`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPrime(x)
+   *
+   * Examples:
+   *
+   *    math.isPrime(3)                     // returns true
+   *    math.isPrime(-2)                    // returns false
+   *    math.isPrime(0)                     // returns false
+   *    math.isPrime(-0)                    // returns false
+   *    math.isPrime(0.5)                   // returns false
+   *    math.isPrime('2')                   // returns true
+   *    math.isPrime([2, 17, 100])           // returns [true, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x * 0 !== 0) {
+        return false;
+      }
+
+      if (x <= 3) {
+        return x > 1;
+      }
+
+      if (x % 2 === 0 || x % 3 === 0) {
+        return false;
+      }
+
+      for (var i = 5; i * i <= x; i += 6) {
+        if (x % i === 0 || x % (i + 2) === 0) {
+          return false;
+        }
+      }
+
+      return true;
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.toNumber() * 0 !== 0) {
+        return false;
+      }
+
+      if (n.lte(3)) return n.gt(1);
+      if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false;
+
+      if (n.lt(Math.pow(2, 32))) {
+        var x = n.toNumber();
+
+        for (var i = 5; i * i <= x; i += 6) {
+          if (x % i === 0 || x % (i + 2) === 0) {
+            return false;
+          }
+        }
+
+        return true;
+      }
+
+      function modPow(base, exponent, modulus) {
+        // exponent can be huge, use non-recursive variant
+        var accumulator = 1;
+
+        while (!exponent.eq(0)) {
+          if (exponent.mod(2).eq(0)) {
+            exponent = exponent.div(2);
+            base = base.mul(base).mod(modulus);
+          } else {
+            exponent = exponent.sub(1);
+            accumulator = base.mul(accumulator).mod(modulus);
+          }
+        }
+
+        return accumulator;
+      } // https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Deterministic_variants
+
+
+      var Decimal = n.constructor.clone({
+        precision: n.toFixed(0).length * 2
+      });
+      n = new Decimal(n);
+      var r = 0;
+      var d = n.sub(1);
+
+      while (d.mod(2).eq(0)) {
+        d = d.div(2);
+        r += 1;
+      }
+
+      var bases = null; // https://en.wikipedia.org/wiki/Miller–Rabin_primality_test#Testing_against_small_sets_of_bases
+
+      if (n.lt('3317044064679887385961981')) {
+        bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(function (x) {
+          return x < n;
+        });
+      } else {
+        var max = Math.min(n.toNumber() - 2, Math.floor(2 * Math.pow(n.toFixed(0).length * Math.log(10), 2)));
+        bases = [];
+
+        for (var _i = 2; _i <= max; _i += 1) {
+          bases.push(max);
+        }
+      }
+
+      for (var _i2 = 0; _i2 < bases.length; _i2 += 1) {
+        var a = bases[_i2];
+        var adn = modPow(n.sub(n).add(a), d, n);
+
+        if (!adn.eq(1)) {
+          for (var _i3 = 0, _x = adn; !_x.eq(n.sub(1)); _i3 += 1, _x = _x.mul(_x).mod(n)) {
+            if (_i3 === r - 1) {
+              return false;
+            }
+          }
+        }
+      }
+
+      return true;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createIsPrime = createIsPrime;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isZero.js b/node_modules/mathjs/lib/cjs/function/utils/isZero.js
new file mode 100644
index 0000000..a6d5cbe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isZero.js
@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsZero = void 0;
+
+var _collection = require("../../utils/collection.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _index = require("../../plain/number/index.js");
+
+var name = 'isZero';
+var dependencies = ['typed'];
+var createIsZero = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Test whether a value is zero.
+   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,
+   * `Complex`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isZero(x)
+   *
+   * Examples:
+   *
+   *    math.isZero(0)                     // returns true
+   *    math.isZero(2)                     // returns false
+   *    math.isZero(0.5)                   // returns false
+   *    math.isZero(math.bignumber(0))     // returns true
+   *    math.isZero(math.fraction(0))      // returns true
+   *    math.isZero(math.fraction(1,3))    // returns false
+   *    math.isZero(math.complex('2 - 4i') // returns false
+   *    math.isZero(math.complex('0i')     // returns true
+   *    math.isZero('0')                   // returns true
+   *    math.isZero('2')                   // returns false
+   *    math.isZero([2, 0, -3]')           // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isInteger
+   *
+   * @param {number | BigNumber | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: _index.isZeroNumber,
+    BigNumber: function BigNumber(x) {
+      return x.isZero();
+    },
+    Complex: function Complex(x) {
+      return x.re === 0 && x.im === 0;
+    },
+    Fraction: function Fraction(x) {
+      return x.d === 1 && x.n === 0;
+    },
+    Unit: function Unit(x) {
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createIsZero = createIsZero;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/numeric.js b/node_modules/mathjs/lib/cjs/function/utils/numeric.js
new file mode 100644
index 0000000..3b252de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/numeric.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNumeric = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _noop = require("../../utils/noop.js");
+
+var name = 'numeric';
+var dependencies = ['number', '?bignumber', '?fraction'];
+var createNumeric = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var _number = _ref.number,
+      bignumber = _ref.bignumber,
+      fraction = _ref.fraction;
+  var validInputTypes = {
+    string: true,
+    number: true,
+    BigNumber: true,
+    Fraction: true
+  }; // Load the conversion functions for each output type
+
+  var validOutputTypes = {
+    number: function number(x) {
+      return _number(x);
+    },
+    BigNumber: bignumber ? function (x) {
+      return bignumber(x);
+    } : _noop.noBignumber,
+    Fraction: fraction ? function (x) {
+      return fraction(x);
+    } : _noop.noFraction
+  };
+  /**
+   * Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.
+   *
+   * Syntax:
+   *
+   *    math.numeric(x)
+   *
+   * Examples:
+   *
+   *    math.numeric('4')                           // returns number 4
+   *    math.numeric('4', 'number')                 // returns number 4
+   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4
+   *    math.numeric('4', 'Fraction')               // returns Fraction 4
+   *    math.numeric(4, 'Fraction')                 // returns Fraction 4
+   *    math.numeric(math.fraction(2, 5), 'number') // returns number 0.4
+   *
+   * See also:
+   *
+   *    number, fraction, bignumber, string, format
+   *
+   * @param {string | number | BigNumber | Fraction } value
+   *              A numeric value or a string containing a numeric value
+   * @param {string} outputType
+   *              Desired numeric output type.
+   *              Available values: 'number', 'BigNumber', or 'Fraction'
+   * @return {number | BigNumber | Fraction}
+   *              Returns an instance of the numeric in the requested type
+   */
+
+  return function numeric(value, outputType) {
+    var inputType = (0, _is.typeOf)(value);
+
+    if (!(inputType in validInputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' of type "' + inputType + '"; valid input types are ' + Object.keys(validInputTypes).join(', '));
+    }
+
+    if (!(outputType in validOutputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' to type "' + outputType + '"; valid output types are ' + Object.keys(validOutputTypes).join(', '));
+    }
+
+    if (outputType === inputType) {
+      return value;
+    } else {
+      return validOutputTypes[outputType](value);
+    }
+  };
+});
+exports.createNumeric = createNumeric;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/typeOf.js b/node_modules/mathjs/lib/cjs/function/utils/typeOf.js
new file mode 100644
index 0000000..5d43cd8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/typeOf.js
@@ -0,0 +1,79 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTypeOf = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var _is = require("../../utils/is.js");
+
+var name = 'typeOf';
+var dependencies = ['typed'];
+var createTypeOf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Determine the type of a variable.
+   *
+   * Function `typeOf` recognizes the following types of objects:
+   *
+   * Object                 | Returns       | Example
+   * ---------------------- | ------------- | ------------------------------------------
+   * null                   | `'null'`      | `math.typeOf(null)`
+   * number                 | `'number'`    | `math.typeOf(3.5)`
+   * boolean                | `'boolean'`   | `math.typeOf(true)`
+   * string                 | `'string'`    | `math.typeOf('hello world')`
+   * Array                  | `'Array'`     | `math.typeOf([1, 2, 3])`
+   * Date                   | `'Date'`      | `math.typeOf(new Date())`
+   * Function               | `'Function'`  | `math.typeOf(function () {})`
+   * Object                 | `'Object'`    | `math.typeOf({a: 2, b: 3})`
+   * RegExp                 | `'RegExp'`    | `math.typeOf(/a regexp/)`
+   * undefined              | `'undefined'` | `math.typeOf(undefined)`
+   * math.BigNumber         | `'BigNumber'` | `math.typeOf(math.bignumber('2.3e500'))`
+   * math.Chain             | `'Chain'`     | `math.typeOf(math.chain(2))`
+   * math.Complex           | `'Complex'`   | `math.typeOf(math.complex(2, 3))`
+   * math.Fraction          | `'Fraction'`  | `math.typeOf(math.fraction(1, 3))`
+   * math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`
+   * math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`
+   * math.Index             | `'Index'`     | `math.typeOf(math.index(1, 3))`
+   * math.Matrix            | `'Matrix'`    | `math.typeOf(math.matrix([[1,2], [3, 4]]))`
+   * math.Range             | `'Range'`     | `math.typeOf(math.range(0, 10))`
+   * math.ResultSet         | `'ResultSet'` | `math.typeOf(math.evaluate('a=2\nb=3'))`
+   * math.Unit              | `'Unit'`      | `math.typeOf(math.unit('45 deg'))`
+   * math.AccessorNode            | `'AccessorNode'`            | `math.typeOf(math.parse('A[2]'))`
+   * math.ArrayNode               | `'ArrayNode'`               | `math.typeOf(math.parse('[1,2,3]'))`
+   * math.AssignmentNode          | `'AssignmentNode'`          | `math.typeOf(math.parse('x=2'))`
+   * math.BlockNode               | `'BlockNode'`               | `math.typeOf(math.parse('a=2; b=3'))`
+   * math.ConditionalNode         | `'ConditionalNode'`         | `math.typeOf(math.parse('x<0 ? -x : x'))`
+   * math.ConstantNode            | `'ConstantNode'`            | `math.typeOf(math.parse('2.3'))`
+   * math.FunctionAssignmentNode  | `'FunctionAssignmentNode'`  | `math.typeOf(math.parse('f(x)=x^2'))`
+   * math.FunctionNode            | `'FunctionNode'`            | `math.typeOf(math.parse('sqrt(4)'))`
+   * math.IndexNode               | `'IndexNode'`               | `math.typeOf(math.parse('A[2]').index)`
+   * math.ObjectNode              | `'ObjectNode'`              | `math.typeOf(math.parse('{a:2}'))`
+   * math.ParenthesisNode         | `'ParenthesisNode'`         | `math.typeOf(math.parse('(2+3)'))`
+   * math.RangeNode               | `'RangeNode'`               | `math.typeOf(math.parse('1:10'))`
+   * math.SymbolNode              | `'SymbolNode'`              | `math.typeOf(math.parse('x'))`
+   *
+   * Syntax:
+   *
+   *    math.typeOf(x)
+   *
+   * Examples:
+   *
+   *    math.typeOf(3.5)                     // returns 'number'
+   *    math.typeOf(math.complex('2-4i'))    // returns 'Complex'
+   *    math.typeOf(math.unit('45 deg'))     // returns 'Unit'
+   *    math.typeOf('hello world')           // returns 'string'
+   *
+   * @param {*} x     The variable for which to test the type.
+   * @return {string} Returns the name of the type. Primitive types are lower case,
+   *                  non-primitive types are upper-camel-case.
+   *                  For example 'number', 'string', 'Array', 'Date'.
+   */
+  return typed(name, {
+    any: _is.typeOf
+  });
+});
+exports.createTypeOf = createTypeOf;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/header.js b/node_modules/mathjs/lib/cjs/header.js
new file mode 100644
index 0000000..5925600
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/header.js
@@ -0,0 +1,26 @@
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * @version 10.4.3
+ * @date    2022-04-08
+ *
+ * @license
+ * Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License"); you may not
+ * use this file except in compliance with the License. You may obtain a copy
+ * of the License at
+ *
+ * https://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
+ * License for the specific language governing permissions and limitations under
+ * the License.
+ */
diff --git a/node_modules/mathjs/lib/cjs/index.js b/node_modules/mathjs/lib/cjs/index.js
new file mode 100644
index 0000000..28dc1c2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/index.js
@@ -0,0 +1,18 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+
+var _mainAny = require("./entry/mainAny.js");
+
+Object.keys(_mainAny).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _mainAny[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _mainAny[key];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/json/replacer.js b/node_modules/mathjs/lib/cjs/json/replacer.js
new file mode 100644
index 0000000..d772e6a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/json/replacer.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReplacer = void 0;
+
+var _factory = require("../utils/factory.js");
+
+var name = 'replacer';
+var dependencies = [];
+var createReplacer = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {
+  /**
+   * Stringify data types into their JSON representation.
+   * Most data types can be serialized using their `.toJSON` method,
+   * but not all, for example the number `Infinity`. For these cases you have
+   * to use the replacer. Example usage:
+   *
+   *     JSON.stringify([2, Infinity], math.replacer)
+   *
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the replaced object
+   */
+  return function replacer(key, value) {
+    // the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON
+    if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {
+      return {
+        mathjs: 'number',
+        value: String(value)
+      };
+    }
+
+    return value;
+  };
+});
+exports.createReplacer = createReplacer;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/json/reviver.js b/node_modules/mathjs/lib/cjs/json/reviver.js
new file mode 100644
index 0000000..da33a2b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/json/reviver.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReviver = void 0;
+
+var _factory = require("../utils/factory.js");
+
+var name = 'reviver';
+var dependencies = ['classes'];
+var createReviver = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var classes = _ref.classes;
+
+  /**
+   * Instantiate mathjs data types from their JSON representation
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the revived object
+   */
+  return function reviver(key, value) {
+    var constructor = classes[value && value.mathjs];
+
+    if (constructor && typeof constructor.fromJSON === 'function') {
+      return constructor.fromJSON(value);
+    }
+
+    return value;
+  };
+});
+exports.createReviver = createReviver;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/number.js b/node_modules/mathjs/lib/cjs/number.js
new file mode 100644
index 0000000..a714abe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/number.js
@@ -0,0 +1,18 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+
+var _mainNumber = require("./entry/mainNumber.js");
+
+Object.keys(_mainNumber).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _mainNumber[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _mainNumber[key];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/package.json b/node_modules/mathjs/lib/cjs/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/lib/cjs/plain/bignumber/arithmetic.js b/node_modules/mathjs/lib/cjs/plain/bignumber/arithmetic.js
new file mode 100644
index 0000000..e8b171c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/bignumber/arithmetic.js
@@ -0,0 +1,42 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absBigNumber = absBigNumber;
+exports.addBigNumber = addBigNumber;
+exports.divideBigNumber = divideBigNumber;
+exports.multiplyBigNumber = multiplyBigNumber;
+exports.subtractBigNumber = subtractBigNumber;
+var signature1 = 'BigNumber';
+var signature2 = 'BigNumber, BigNumber';
+
+function absBigNumber(a) {
+  return a.abs();
+}
+
+absBigNumber.signature = signature1;
+
+function addBigNumber(a, b) {
+  return a.add(b);
+}
+
+addBigNumber.signature = signature2;
+
+function subtractBigNumber(a, b) {
+  return a.sub(b);
+}
+
+subtractBigNumber.signature = signature2;
+
+function multiplyBigNumber(a, b) {
+  return a.mul(b);
+}
+
+multiplyBigNumber.signature = signature2;
+
+function divideBigNumber(a, b) {
+  return a.div(b);
+}
+
+divideBigNumber.signature = signature2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/bignumber/index.js b/node_modules/mathjs/lib/cjs/plain/bignumber/index.js
new file mode 100644
index 0000000..2221c2f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/bignumber/index.js
@@ -0,0 +1,36 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _exportNames = {
+  bignumber: true
+};
+exports.bignumber = bignumber;
+
+var _decimal = _interopRequireDefault(require("decimal.js"));
+
+var _arithmetic = require("./arithmetic.js");
+
+Object.keys(_arithmetic).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _arithmetic[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _arithmetic[key];
+    }
+  });
+});
+
+// TODO: this is ugly. Instead, be able to pass your own isBigNumber function to typed?
+var BigNumber = _decimal.default.clone();
+
+BigNumber.prototype.isBigNumber = true;
+
+function bignumber(x) {
+  return new BigNumber(x);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/arithmetic.js b/node_modules/mathjs/lib/cjs/plain/number/arithmetic.js
new file mode 100644
index 0000000..5d13970
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/arithmetic.js
@@ -0,0 +1,422 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absNumber = absNumber;
+exports.addNumber = addNumber;
+exports.cbrtNumber = cbrtNumber;
+exports.ceilNumber = ceilNumber;
+exports.cubeNumber = cubeNumber;
+exports.divideNumber = divideNumber;
+exports.expNumber = expNumber;
+exports.expm1Number = expm1Number;
+exports.fixNumber = fixNumber;
+exports.floorNumber = floorNumber;
+exports.gcdNumber = gcdNumber;
+exports.lcmNumber = lcmNumber;
+exports.log10Number = log10Number;
+exports.log1pNumber = log1pNumber;
+exports.log2Number = log2Number;
+exports.logNumber = logNumber;
+exports.modNumber = modNumber;
+exports.multiplyNumber = multiplyNumber;
+exports.normNumber = normNumber;
+exports.nthRootNumber = nthRootNumber;
+exports.powNumber = powNumber;
+exports.roundNumber = roundNumber;
+exports.signNumber = signNumber;
+exports.sqrtNumber = sqrtNumber;
+exports.squareNumber = squareNumber;
+exports.subtractNumber = subtractNumber;
+exports.unaryMinusNumber = unaryMinusNumber;
+exports.unaryPlusNumber = unaryPlusNumber;
+exports.xgcdNumber = xgcdNumber;
+
+var _number = require("../../utils/number.js");
+
+var n1 = 'number';
+var n2 = 'number, number';
+
+function absNumber(a) {
+  return Math.abs(a);
+}
+
+absNumber.signature = n1;
+
+function addNumber(a, b) {
+  return a + b;
+}
+
+addNumber.signature = n2;
+
+function subtractNumber(a, b) {
+  return a - b;
+}
+
+subtractNumber.signature = n2;
+
+function multiplyNumber(a, b) {
+  return a * b;
+}
+
+multiplyNumber.signature = n2;
+
+function divideNumber(a, b) {
+  return a / b;
+}
+
+divideNumber.signature = n2;
+
+function unaryMinusNumber(x) {
+  return -x;
+}
+
+unaryMinusNumber.signature = n1;
+
+function unaryPlusNumber(x) {
+  return x;
+}
+
+unaryPlusNumber.signature = n1;
+
+function cbrtNumber(x) {
+  return (0, _number.cbrt)(x);
+}
+
+cbrtNumber.signature = n1;
+
+function ceilNumber(x) {
+  return Math.ceil(x);
+}
+
+ceilNumber.signature = n1;
+
+function cubeNumber(x) {
+  return x * x * x;
+}
+
+cubeNumber.signature = n1;
+
+function expNumber(x) {
+  return Math.exp(x);
+}
+
+expNumber.signature = n1;
+
+function expm1Number(x) {
+  return (0, _number.expm1)(x);
+}
+
+expm1Number.signature = n1;
+
+function fixNumber(x) {
+  return x > 0 ? Math.floor(x) : Math.ceil(x);
+}
+
+fixNumber.signature = n1;
+
+function floorNumber(x) {
+  return Math.floor(x);
+}
+
+floorNumber.signature = n1;
+/**
+ * Calculate gcd for numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the greatest common denominator of a and b
+ */
+
+function gcdNumber(a, b) {
+  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
+    throw new Error('Parameters in function gcd must be integer numbers');
+  } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+
+
+  var r;
+
+  while (b !== 0) {
+    r = a % b;
+    a = b;
+    b = r;
+  }
+
+  return a < 0 ? -a : a;
+}
+
+gcdNumber.signature = n2;
+/**
+ * Calculate lcm for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the least common multiple of a and b
+ */
+
+function lcmNumber(a, b) {
+  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
+    throw new Error('Parameters in function lcm must be integer numbers');
+  }
+
+  if (a === 0 || b === 0) {
+    return 0;
+  } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+  // evaluate lcm here inline to reduce overhead
+
+
+  var t;
+  var prod = a * b;
+
+  while (b !== 0) {
+    t = b;
+    b = a % t;
+    a = t;
+  }
+
+  return Math.abs(prod / a);
+}
+
+lcmNumber.signature = n2;
+/**
+ * Calculate the logarithm of a value, optionally to a given base.
+ * @param {number} x
+ * @param {number | null | undefined} base
+ * @return {number}
+ */
+
+function logNumber(x, y) {
+  if (y) {
+    return Math.log(x) / Math.log(y);
+  }
+
+  return Math.log(x);
+}
+/**
+ * Calculate the 10-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+
+function log10Number(x) {
+  return (0, _number.log10)(x);
+}
+
+log10Number.signature = n1;
+/**
+ * Calculate the 2-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+function log2Number(x) {
+  return (0, _number.log2)(x);
+}
+
+log2Number.signature = n1;
+/**
+ * Calculate the natural logarithm of a `number+1`
+ * @param {number} x
+ * @returns {number}
+ */
+
+function log1pNumber(x) {
+  return (0, _number.log1p)(x);
+}
+
+log1pNumber.signature = n1;
+/**
+ * Calculate the modulus of two numbers
+ * @param {number} x
+ * @param {number} y
+ * @returns {number} res
+ * @private
+ */
+
+function modNumber(x, y) {
+  if (y > 0) {
+    // We don't use JavaScript's % operator here as this doesn't work
+    // correctly for x < 0 and x === 0
+    // see https://en.wikipedia.org/wiki/Modulo_operation
+    return x - y * Math.floor(x / y);
+  } else if (y === 0) {
+    return x;
+  } else {
+    // y < 0
+    // TODO: implement mod for a negative divisor
+    throw new Error('Cannot calculate mod for a negative divisor');
+  }
+}
+
+modNumber.signature = n2;
+/**
+ * Calculate the nth root of a, solve x^root == a
+ * http://rosettacode.org/wiki/Nth_root#JavaScript
+ * @param {number} a
+ * @param {number} root
+ * @private
+ */
+
+function nthRootNumber(a, root) {
+  var inv = root < 0;
+
+  if (inv) {
+    root = -root;
+  }
+
+  if (root === 0) {
+    throw new Error('Root must be non-zero');
+  }
+
+  if (a < 0 && Math.abs(root) % 2 !== 1) {
+    throw new Error('Root must be odd when a is negative.');
+  } // edge cases zero and infinity
+
+
+  if (a === 0) {
+    return inv ? Infinity : 0;
+  }
+
+  if (!isFinite(a)) {
+    return inv ? 0 : a;
+  }
+
+  var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,
+  // so (-1) ^ (1/root) = -1
+
+  x = a < 0 ? -x : x;
+  return inv ? 1 / x : x; // Very nice algorithm, but fails with nthRoot(-2, 3).
+  // Newton's method has some well-known problems at times:
+  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis
+
+  /*
+  let x = 1 // Initial guess
+  let xPrev = 1
+  let i = 0
+  const iMax = 10000
+  do {
+    const delta = (a / Math.pow(x, root - 1) - x) / root
+    xPrev = x
+    x = x + delta
+    i++
+  }
+  while (xPrev !== x && i < iMax)
+   if (xPrev !== x) {
+    throw new Error('Function nthRoot failed to converge')
+  }
+   return inv ? 1 / x : x
+  */
+}
+
+nthRootNumber.signature = n2;
+
+function signNumber(x) {
+  return (0, _number.sign)(x);
+}
+
+signNumber.signature = n1;
+
+function sqrtNumber(x) {
+  return Math.sqrt(x);
+}
+
+sqrtNumber.signature = n1;
+
+function squareNumber(x) {
+  return x * x;
+}
+
+squareNumber.signature = n1;
+/**
+ * Calculate xgcd for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @return {number} result
+ * @private
+ */
+
+function xgcdNumber(a, b) {
+  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+  var t; // used to swap two variables
+
+  var q; // quotient
+
+  var r; // remainder
+
+  var x = 0;
+  var lastx = 1;
+  var y = 1;
+  var lasty = 0;
+
+  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
+    throw new Error('Parameters in function xgcd must be integer numbers');
+  }
+
+  while (b) {
+    q = Math.floor(a / b);
+    r = a - q * b;
+    t = x;
+    x = lastx - q * x;
+    lastx = t;
+    t = y;
+    y = lasty - q * y;
+    lasty = t;
+    a = b;
+    b = r;
+  }
+
+  var res;
+
+  if (a < 0) {
+    res = [-a, -lastx, -lasty];
+  } else {
+    res = [a, a ? lastx : 0, lasty];
+  }
+
+  return res;
+}
+
+xgcdNumber.signature = n2;
+/**
+ * Calculates the power of x to y, x^y, for two numbers.
+ * @param {number} x
+ * @param {number} y
+ * @return {number} res
+ */
+
+function powNumber(x, y) {
+  // x^Infinity === 0 if -1 < x < 1
+  // A real number 0 is returned instead of complex(0)
+  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+    return 0;
+  }
+
+  return Math.pow(x, y);
+}
+
+powNumber.signature = n2;
+/**
+ * round a number to the given number of decimals, or to zero if decimals is
+ * not provided
+ * @param {number} value
+ * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)
+ * @return {number} roundedValue
+ */
+
+function roundNumber(value) {
+  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  return parseFloat((0, _number.toFixed)(value, decimals));
+}
+
+roundNumber.signature = n2;
+/**
+ * Calculate the norm of a number, the absolute value.
+ * @param {number} x
+ * @return {number}
+ */
+
+function normNumber(x) {
+  return Math.abs(x);
+}
+
+normNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/bitwise.js b/node_modules/mathjs/lib/cjs/plain/number/bitwise.js
new file mode 100644
index 0000000..ec7be87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/bitwise.js
@@ -0,0 +1,87 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndNumber = bitAndNumber;
+exports.bitNotNumber = bitNotNumber;
+exports.bitOrNumber = bitOrNumber;
+exports.bitXorNumber = bitXorNumber;
+exports.leftShiftNumber = leftShiftNumber;
+exports.rightArithShiftNumber = rightArithShiftNumber;
+exports.rightLogShiftNumber = rightLogShiftNumber;
+
+var _number = require("../../utils/number.js");
+
+var n1 = 'number';
+var n2 = 'number, number';
+
+function bitAndNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+
+  return x & y;
+}
+
+bitAndNumber.signature = n2;
+
+function bitNotNumber(x) {
+  if (!(0, _number.isInteger)(x)) {
+    throw new Error('Integer expected in function bitNot');
+  }
+
+  return ~x;
+}
+
+bitNotNumber.signature = n1;
+
+function bitOrNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function bitOr');
+  }
+
+  return x | y;
+}
+
+bitOrNumber.signature = n2;
+
+function bitXorNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function bitXor');
+  }
+
+  return x ^ y;
+}
+
+bitXorNumber.signature = n2;
+
+function leftShiftNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function leftShift');
+  }
+
+  return x << y;
+}
+
+leftShiftNumber.signature = n2;
+
+function rightArithShiftNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+
+  return x >> y;
+}
+
+rightArithShiftNumber.signature = n2;
+
+function rightLogShiftNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function rightLogShift');
+  }
+
+  return x >>> y;
+}
+
+rightLogShiftNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/combinations.js b/node_modules/mathjs/lib/cjs/plain/number/combinations.js
new file mode 100644
index 0000000..e4c77e7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/combinations.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsNumber = combinationsNumber;
+
+var _number = require("../../utils/number.js");
+
+var _product = require("../../utils/product.js");
+
+function combinationsNumber(n, k) {
+  if (!(0, _number.isInteger)(n) || n < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+
+  if (!(0, _number.isInteger)(k) || k < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+
+  if (k > n) {
+    throw new TypeError('k must be less than or equal to n');
+  }
+
+  var nMinusk = n - k;
+  var answer = 1;
+  var firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;
+  var nextdivisor = 2;
+  var lastdivisor = k < nMinusk ? k : nMinusk; // balance multiplications and divisions to try to keep intermediate values
+  // in exact-integer range as long as possible
+
+  for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {
+    answer *= nextnumerator;
+
+    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {
+      answer /= nextdivisor;
+      ++nextdivisor;
+    }
+  } // for big n, k, floating point may have caused weirdness in remainder
+
+
+  if (nextdivisor <= lastdivisor) {
+    answer /= (0, _product.product)(nextdivisor, lastdivisor);
+  }
+
+  return answer;
+}
+
+combinationsNumber.signature = 'number, number';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/constants.js b/node_modules/mathjs/lib/cjs/plain/number/constants.js
new file mode 100644
index 0000000..93c28a2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/constants.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tau = exports.pi = exports.phi = exports.e = void 0;
+var pi = Math.PI;
+exports.pi = pi;
+var tau = 2 * Math.PI;
+exports.tau = tau;
+var e = Math.E;
+exports.e = e;
+var phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision
+
+exports.phi = phi;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/index.js b/node_modules/mathjs/lib/cjs/plain/number/index.js
new file mode 100644
index 0000000..165abcc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/index.js
@@ -0,0 +1,122 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+
+var _arithmetic = require("./arithmetic.js");
+
+Object.keys(_arithmetic).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _arithmetic[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _arithmetic[key];
+    }
+  });
+});
+
+var _bitwise = require("./bitwise.js");
+
+Object.keys(_bitwise).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _bitwise[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _bitwise[key];
+    }
+  });
+});
+
+var _combinations = require("./combinations.js");
+
+Object.keys(_combinations).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _combinations[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _combinations[key];
+    }
+  });
+});
+
+var _constants = require("./constants.js");
+
+Object.keys(_constants).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _constants[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _constants[key];
+    }
+  });
+});
+
+var _logical = require("./logical.js");
+
+Object.keys(_logical).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _logical[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _logical[key];
+    }
+  });
+});
+
+var _relational = require("./relational.js");
+
+Object.keys(_relational).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _relational[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _relational[key];
+    }
+  });
+});
+
+var _probability = require("./probability.js");
+
+Object.keys(_probability).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _probability[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _probability[key];
+    }
+  });
+});
+
+var _trigonometry = require("./trigonometry.js");
+
+Object.keys(_trigonometry).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _trigonometry[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _trigonometry[key];
+    }
+  });
+});
+
+var _utils = require("./utils.js");
+
+Object.keys(_utils).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _utils[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _utils[key];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/logical.js b/node_modules/mathjs/lib/cjs/plain/number/logical.js
new file mode 100644
index 0000000..4e3c32c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/logical.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andNumber = andNumber;
+exports.notNumber = notNumber;
+exports.orNumber = orNumber;
+exports.xorNumber = xorNumber;
+var n1 = 'number';
+var n2 = 'number, number';
+
+function notNumber(x) {
+  return !x;
+}
+
+notNumber.signature = n1;
+
+function orNumber(x, y) {
+  return !!(x || y);
+}
+
+orNumber.signature = n2;
+
+function xorNumber(x, y) {
+  return !!x !== !!y;
+}
+
+xorNumber.signature = n2;
+
+function andNumber(x, y) {
+  return !!(x && y);
+}
+
+andNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/probability.js b/node_modules/mathjs/lib/cjs/plain/number/probability.js
new file mode 100644
index 0000000..80e00b2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/probability.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaG = void 0;
+exports.gammaNumber = gammaNumber;
+exports.gammaP = void 0;
+
+var _number = require("../../utils/number.js");
+
+var _product = require("../../utils/product.js");
+
+/* eslint-disable no-loss-of-precision */
+function gammaNumber(n) {
+  var x;
+
+  if ((0, _number.isInteger)(n)) {
+    if (n <= 0) {
+      return isFinite(n) ? Infinity : NaN;
+    }
+
+    if (n > 171) {
+      return Infinity; // Will overflow
+    }
+
+    return (0, _product.product)(1, n - 1);
+  }
+
+  if (n < 0.5) {
+    return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n));
+  }
+
+  if (n >= 171.35) {
+    return Infinity; // will overflow
+  }
+
+  if (n > 85.0) {
+    // Extended Stirling Approx
+    var twoN = n * n;
+    var threeN = twoN * n;
+    var fourN = threeN * n;
+    var fiveN = fourN * n;
+    return Math.sqrt(2 * Math.PI / n) * Math.pow(n / Math.E, n) * (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) - 571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) + 5246819 / (75246796800 * fiveN * n));
+  }
+
+  --n;
+  x = gammaP[0];
+
+  for (var i = 1; i < gammaP.length; ++i) {
+    x += gammaP[i] / (n + i);
+  }
+
+  var t = n + gammaG + 0.5;
+  return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x;
+}
+
+gammaNumber.signature = 'number'; // TODO: comment on the variables g and p
+
+var gammaG = 4.7421875;
+exports.gammaG = gammaG;
+var gammaP = [0.99999999999999709182, 57.156235665862923517, -59.597960355475491248, 14.136097974741747174, -0.49191381609762019978, 0.33994649984811888699e-4, 0.46523628927048575665e-4, -0.98374475304879564677e-4, 0.15808870322491248884e-3, -0.21026444172410488319e-3, 0.21743961811521264320e-3, -0.16431810653676389022e-3, 0.84418223983852743293e-4, -0.26190838401581408670e-4, 0.36899182659531622704e-5];
+exports.gammaP = gammaP;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/relational.js b/node_modules/mathjs/lib/cjs/plain/number/relational.js
new file mode 100644
index 0000000..9a390c3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/relational.js
@@ -0,0 +1 @@
+"use strict";
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/trigonometry.js b/node_modules/mathjs/lib/cjs/plain/number/trigonometry.js
new file mode 100644
index 0000000..7889c5b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/trigonometry.js
@@ -0,0 +1,194 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosNumber = acosNumber;
+exports.acoshNumber = acoshNumber;
+exports.acotNumber = acotNumber;
+exports.acothNumber = acothNumber;
+exports.acscNumber = acscNumber;
+exports.acschNumber = acschNumber;
+exports.asecNumber = asecNumber;
+exports.asechNumber = asechNumber;
+exports.asinNumber = asinNumber;
+exports.asinhNumber = asinhNumber;
+exports.atan2Number = atan2Number;
+exports.atanNumber = atanNumber;
+exports.atanhNumber = atanhNumber;
+exports.cosNumber = cosNumber;
+exports.coshNumber = coshNumber;
+exports.cotNumber = cotNumber;
+exports.cothNumber = cothNumber;
+exports.cscNumber = cscNumber;
+exports.cschNumber = cschNumber;
+exports.secNumber = secNumber;
+exports.sechNumber = sechNumber;
+exports.sinNumber = sinNumber;
+exports.sinhNumber = sinhNumber;
+exports.tanNumber = tanNumber;
+exports.tanhNumber = tanhNumber;
+
+var _number = require("../../utils/number.js");
+
+var n1 = 'number';
+var n2 = 'number, number';
+
+function acosNumber(x) {
+  return Math.acos(x);
+}
+
+acosNumber.signature = n1;
+
+function acoshNumber(x) {
+  return (0, _number.acosh)(x);
+}
+
+acoshNumber.signature = n1;
+
+function acotNumber(x) {
+  return Math.atan(1 / x);
+}
+
+acotNumber.signature = n1;
+
+function acothNumber(x) {
+  return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;
+}
+
+acothNumber.signature = n1;
+
+function acscNumber(x) {
+  return Math.asin(1 / x);
+}
+
+acscNumber.signature = n1;
+
+function acschNumber(x) {
+  var xInv = 1 / x;
+  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));
+}
+
+acschNumber.signature = n1;
+
+function asecNumber(x) {
+  return Math.acos(1 / x);
+}
+
+asecNumber.signature = n1;
+
+function asechNumber(x) {
+  var xInv = 1 / x;
+  var ret = Math.sqrt(xInv * xInv - 1);
+  return Math.log(ret + xInv);
+}
+
+asechNumber.signature = n1;
+
+function asinNumber(x) {
+  return Math.asin(x);
+}
+
+asinNumber.signature = n1;
+
+function asinhNumber(x) {
+  return (0, _number.asinh)(x);
+}
+
+asinhNumber.signature = n1;
+
+function atanNumber(x) {
+  return Math.atan(x);
+}
+
+atanNumber.signature = n1;
+
+function atan2Number(y, x) {
+  return Math.atan2(y, x);
+}
+
+atan2Number.signature = n2;
+
+function atanhNumber(x) {
+  return (0, _number.atanh)(x);
+}
+
+atanhNumber.signature = n1;
+
+function cosNumber(x) {
+  return Math.cos(x);
+}
+
+cosNumber.signature = n1;
+
+function coshNumber(x) {
+  return (0, _number.cosh)(x);
+}
+
+coshNumber.signature = n1;
+
+function cotNumber(x) {
+  return 1 / Math.tan(x);
+}
+
+cotNumber.signature = n1;
+
+function cothNumber(x) {
+  var e = Math.exp(2 * x);
+  return (e + 1) / (e - 1);
+}
+
+cothNumber.signature = n1;
+
+function cscNumber(x) {
+  return 1 / Math.sin(x);
+}
+
+cscNumber.signature = n1;
+
+function cschNumber(x) {
+  // consider values close to zero (+/-)
+  if (x === 0) {
+    return Number.POSITIVE_INFINITY;
+  } else {
+    return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * (0, _number.sign)(x);
+  }
+}
+
+cschNumber.signature = n1;
+
+function secNumber(x) {
+  return 1 / Math.cos(x);
+}
+
+secNumber.signature = n1;
+
+function sechNumber(x) {
+  return 2 / (Math.exp(x) + Math.exp(-x));
+}
+
+sechNumber.signature = n1;
+
+function sinNumber(x) {
+  return Math.sin(x);
+}
+
+sinNumber.signature = n1;
+
+function sinhNumber(x) {
+  return (0, _number.sinh)(x);
+}
+
+sinhNumber.signature = n1;
+
+function tanNumber(x) {
+  return Math.tan(x);
+}
+
+tanNumber.signature = n1;
+
+function tanhNumber(x) {
+  return (0, _number.tanh)(x);
+}
+
+tanhNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/utils.js b/node_modules/mathjs/lib/cjs/plain/number/utils.js
new file mode 100644
index 0000000..a6a16e2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/utils.js
@@ -0,0 +1,44 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerNumber = isIntegerNumber;
+exports.isNaNNumber = isNaNNumber;
+exports.isNegativeNumber = isNegativeNumber;
+exports.isPositiveNumber = isPositiveNumber;
+exports.isZeroNumber = isZeroNumber;
+
+var _number = require("../../utils/number.js");
+
+var n1 = 'number';
+
+function isIntegerNumber(x) {
+  return (0, _number.isInteger)(x);
+}
+
+isIntegerNumber.signature = n1;
+
+function isNegativeNumber(x) {
+  return x < 0;
+}
+
+isNegativeNumber.signature = n1;
+
+function isPositiveNumber(x) {
+  return x > 0;
+}
+
+isPositiveNumber.signature = n1;
+
+function isZeroNumber(x) {
+  return x === 0;
+}
+
+isZeroNumber.signature = n1;
+
+function isNaNNumber(x) {
+  return Number.isNaN(x);
+}
+
+isNaNNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/bignumber/BigNumber.js b/node_modules/mathjs/lib/cjs/type/bignumber/BigNumber.js
new file mode 100644
index 0000000..5a25fa6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/bignumber/BigNumber.js
@@ -0,0 +1,72 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBigNumberClass = void 0;
+
+var _decimal = _interopRequireDefault(require("decimal.js"));
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'BigNumber';
+var dependencies = ['?on', 'config'];
+var createBigNumberClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var on = _ref.on,
+      config = _ref.config;
+
+  var BigNumber = _decimal.default.clone({
+    precision: config.precision,
+    modulo: _decimal.default.EUCLID
+  });
+
+  BigNumber.prototype = Object.create(BigNumber.prototype);
+  /**
+   * Attach type information
+   */
+
+  BigNumber.prototype.type = 'BigNumber';
+  BigNumber.prototype.isBigNumber = true;
+  /**
+   * Get a JSON representation of a BigNumber containing
+   * type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "BigNumber", "value": "0.2"}`
+   */
+
+  BigNumber.prototype.toJSON = function () {
+    return {
+      mathjs: 'BigNumber',
+      value: this.toString()
+    };
+  };
+  /**
+   * Instantiate a BigNumber from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "BigNumber", "value": "0.2"}`
+   * @return {BigNumber}
+   */
+
+
+  BigNumber.fromJSON = function (json) {
+    return new BigNumber(json.value);
+  };
+
+  if (on) {
+    // listen for changed in the configuration, automatically apply changed precision
+    on('config', function (curr, prev) {
+      if (curr.precision !== prev.precision) {
+        BigNumber.config({
+          precision: curr.precision
+        });
+      }
+    });
+  }
+
+  return BigNumber;
+}, {
+  isClass: true
+});
+exports.createBigNumberClass = createBigNumberClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/bignumber/function/bignumber.js b/node_modules/mathjs/lib/cjs/type/bignumber/function/bignumber.js
new file mode 100644
index 0000000..f1508bd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/bignumber/function/bignumber.js
@@ -0,0 +1,90 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBignumber = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _collection = require("../../../utils/collection.js");
+
+var name = 'bignumber';
+var dependencies = ['typed', 'BigNumber'];
+var createBignumber = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      BigNumber = _ref.BigNumber;
+
+  /**
+   * Create a BigNumber, which can store numbers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to BigNumber.
+   *
+   * Syntax:
+   *
+   *    math.bignumber(x)
+   *
+   * Examples:
+   *
+   *    0.1 + 0.2                                  // returns number 0.30000000000000004
+   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3
+   *
+   *
+   *    7.2e500                                    // returns number Infinity
+   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500
+   *
+   * See also:
+   *
+   *    boolean, complex, index, matrix, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | Array | Matrix | boolean | null} [value]  Value for the big number,
+   *                                                    0 by default.
+   * @returns {BigNumber} The created bignumber
+   */
+  return typed('bignumber', {
+    '': function _() {
+      return new BigNumber(0);
+    },
+    number: function number(x) {
+      // convert to string to prevent errors in case of >15 digits
+      return new BigNumber(x + '');
+    },
+    string: function string(x) {
+      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+
+      if (wordSizeSuffixMatch) {
+        // x has a word size suffix
+        var size = wordSizeSuffixMatch[2];
+        var n = BigNumber(wordSizeSuffixMatch[1]);
+        var twoPowSize = new BigNumber(2).pow(Number(size));
+
+        if (n.gt(twoPowSize.sub(1))) {
+          throw new SyntaxError("String \"".concat(x, "\" is out of range"));
+        }
+
+        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);
+
+        if (n.gte(twoPowSizeSubOne)) {
+          return n.sub(twoPowSize);
+        } else {
+          return n;
+        }
+      }
+
+      return new BigNumber(x);
+    },
+    BigNumber: function BigNumber(x) {
+      // we assume a BigNumber is immutable
+      return x;
+    },
+    Fraction: function Fraction(x) {
+      return new BigNumber(x.n).div(x.d).times(x.s);
+    },
+    null: function _null(x) {
+      return new BigNumber(0);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createBignumber = createBignumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/boolean.js b/node_modules/mathjs/lib/cjs/type/boolean.js
new file mode 100644
index 0000000..3c9c70b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/boolean.js
@@ -0,0 +1,84 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBoolean = void 0;
+
+var _factory = require("../utils/factory.js");
+
+var _collection = require("../utils/collection.js");
+
+var name = 'boolean';
+var dependencies = ['typed'];
+var createBoolean = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Create a boolean or convert a string or number to a boolean.
+   * In case of a number, `true` is returned for non-zero numbers, and `false` in
+   * case of zero.
+   * Strings can be `'true'` or `'false'`, or can contain a number.
+   * When value is a matrix, all elements will be converted to boolean.
+   *
+   * Syntax:
+   *
+   *    math.boolean(x)
+   *
+   * Examples:
+   *
+   *    math.boolean(0)     // returns false
+   *    math.boolean(1)     // returns true
+   *    math.boolean(-3)     // returns true
+   *    math.boolean('true')     // returns true
+   *    math.boolean('false')     // returns false
+   *    math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]
+   *
+   * See also:
+   *
+   *    bignumber, complex, index, matrix, string, unit
+   *
+   * @param {string | number | boolean | Array | Matrix | null} value  A value of any type
+   * @return {boolean | Array | Matrix} The boolean value
+   */
+  return typed(name, {
+    '': function _() {
+      return false;
+    },
+    boolean: function boolean(x) {
+      return x;
+    },
+    number: function number(x) {
+      return !!x;
+    },
+    null: function _null(x) {
+      return false;
+    },
+    BigNumber: function BigNumber(x) {
+      return !x.isZero();
+    },
+    string: function string(x) {
+      // try case insensitive
+      var lcase = x.toLowerCase();
+
+      if (lcase === 'true') {
+        return true;
+      } else if (lcase === 'false') {
+        return false;
+      } // test whether value is a valid number
+
+
+      var num = Number(x);
+
+      if (x !== '' && !isNaN(num)) {
+        return !!num;
+      }
+
+      throw new Error('Cannot convert "' + x + '" to a boolean');
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createBoolean = createBoolean;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/chain/Chain.js b/node_modules/mathjs/lib/cjs/type/chain/Chain.js
new file mode 100644
index 0000000..4413763
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/chain/Chain.js
@@ -0,0 +1,225 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createChainClass = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _string = require("../../utils/string.js");
+
+var _object = require("../../utils/object.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'Chain';
+var dependencies = ['?on', 'math'];
+var createChainClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var on = _ref.on,
+      math = _ref.math;
+
+  /**
+   * @constructor Chain
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing chain.done(), which will return
+   * the final value.
+   *
+   * The Chain has a number of special functions:
+   * - done()             Finalize the chained operation and return the
+   *                      chain's value.
+   * - valueOf()          The same as done()
+   * - toString()         Returns a string representation of the chain's value.
+   *
+   * @param {*} [value]
+   */
+  function Chain(value) {
+    if (!(this instanceof Chain)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if ((0, _is.isChain)(value)) {
+      this.value = value.value;
+    } else {
+      this.value = value;
+    }
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Chain.prototype.type = 'Chain';
+  Chain.prototype.isChain = true;
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method valueOf()
+   * @returns {*} value
+   */
+
+  Chain.prototype.done = function () {
+    return this.value;
+  };
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method done()
+   * @returns {*} value
+   */
+
+
+  Chain.prototype.valueOf = function () {
+    return this.value;
+  };
+  /**
+   * Get a string representation of the value in the chain
+   * @returns {string}
+   */
+
+
+  Chain.prototype.toString = function () {
+    return (0, _string.format)(this.value);
+  };
+  /**
+   * Get a JSON representation of the chain
+   * @returns {Object}
+   */
+
+
+  Chain.prototype.toJSON = function () {
+    return {
+      mathjs: 'Chain',
+      value: this.value
+    };
+  };
+  /**
+   * Instantiate a Chain from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "Chain", value: ...}`,
+   *                       where mathjs is optional
+   * @returns {Chain}
+   */
+
+
+  Chain.fromJSON = function (json) {
+    return new Chain(json.value);
+  };
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {Function} fn      The function to be proxied
+   *                           If fn is no function, it is silently ignored.
+   * @private
+   */
+
+
+  function createProxy(name, fn) {
+    if (typeof fn === 'function') {
+      Chain.prototype[name] = chainify(fn);
+    }
+  }
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {function} resolver   The function resolving with the
+   *                              function to be proxied
+   * @private
+   */
+
+
+  function createLazyProxy(name, resolver) {
+    (0, _object.lazy)(Chain.prototype, name, function outerResolver() {
+      var fn = resolver();
+
+      if (typeof fn === 'function') {
+        return chainify(fn);
+      }
+
+      return undefined; // if not a function, ignore
+    });
+  }
+  /**
+   * Make a function chainable
+   * @param {function} fn
+   * @return {Function} chain function
+   * @private
+   */
+
+
+  function chainify(fn) {
+    return function () {
+      var args = [this.value]; // `this` will be the context of a Chain instance
+
+      for (var i = 0; i < arguments.length; i++) {
+        args[i + 1] = arguments[i];
+      }
+
+      return new Chain(fn.apply(fn, args));
+    };
+  }
+  /**
+   * Create a proxy for a single method, or an object with multiple methods.
+   * Example usage:
+   *
+   *   Chain.createProxy('add', function add (x, y) {...})
+   *   Chain.createProxy({
+   *     add:      function add (x, y) {...},
+   *     subtract: function subtract (x, y) {...}
+   *   }
+   *
+   * @param {string | Object} arg0   A name (string), or an object with
+   *                                 functions
+   * @param {*} [arg1]               A function, when arg0 is a name
+   */
+
+
+  Chain.createProxy = function (arg0, arg1) {
+    if (typeof arg0 === 'string') {
+      // createProxy(name, value)
+      createProxy(arg0, arg1);
+    } else {
+      var _loop = function _loop(_name) {
+        if ((0, _object.hasOwnProperty)(arg0, _name) && excludedNames[_name] === undefined) {
+          createLazyProxy(_name, function () {
+            return arg0[_name];
+          });
+        }
+      };
+
+      // createProxy(values)
+      for (var _name in arg0) {
+        _loop(_name);
+      }
+    }
+  };
+
+  var excludedNames = {
+    expression: true,
+    docs: true,
+    type: true,
+    classes: true,
+    json: true,
+    error: true,
+    isChain: true // conflicts with the property isChain of a Chain instance
+
+  }; // create proxy for everything that is in math.js
+
+  Chain.createProxy(math); // register on the import event, automatically add a proxy for every imported function.
+
+  if (on) {
+    on('import', function (name, resolver, path) {
+      if (!path) {
+        // an imported function (not a data type or something special)
+        createLazyProxy(name, resolver);
+      }
+    });
+  }
+
+  return Chain;
+}, {
+  isClass: true
+});
+exports.createChainClass = createChainClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/chain/function/chain.js b/node_modules/mathjs/lib/cjs/type/chain/function/chain.js
new file mode 100644
index 0000000..9a074c3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/chain/function/chain.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createChain = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'chain';
+var dependencies = ['typed', 'Chain'];
+var createChain = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Chain = _ref.Chain;
+
+  /**
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing `chain.done()`, which returns
+   * the final value.
+   *
+   * The chain has a number of special functions:
+   *
+   * - `done()`     Finalize the chain and return the chain's value.
+   * - `valueOf()`  The same as `done()`
+   * - `toString()` Executes `math.format()` onto the chain's value, returning
+   *                a string representation of the value.
+   *
+   * Syntax:
+   *
+   *    math.chain(value)
+   *
+   * Examples:
+   *
+   *     math.chain(3)
+   *         .add(4)
+   *         .subtract(2)
+   *         .done()     // 5
+   *
+   *     math.chain( [[1, 2], [3, 4]] )
+   *         .subset(math.index(0, 0), 8)
+   *         .multiply(3)
+   *         .done()     // [[24, 6], [9, 12]]
+   *
+   * @param {*} [value]   A value of any type on which to start a chained operation.
+   * @return {math.Chain} The created chain
+   */
+  return typed(name, {
+    '': function _() {
+      return new Chain();
+    },
+    any: function any(value) {
+      return new Chain(value);
+    }
+  });
+});
+exports.createChain = createChain;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/complex/Complex.js b/node_modules/mathjs/lib/cjs/type/complex/Complex.js
new file mode 100644
index 0000000..571844d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/complex/Complex.js
@@ -0,0 +1,226 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComplexClass = void 0;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _complex = _interopRequireDefault(require("complex.js"));
+
+var _number = require("../../utils/number.js");
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'Complex';
+var dependencies = [];
+var createComplexClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {
+  /**
+   * Attach type information
+   */
+  _complex.default.prototype.type = 'Complex';
+  _complex.default.prototype.isComplex = true;
+  /**
+   * Get a JSON representation of the complex number
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Complex", "re": 2, "im": 3}`
+   */
+
+  _complex.default.prototype.toJSON = function () {
+    return {
+      mathjs: 'Complex',
+      re: this.re,
+      im: this.im
+    };
+  };
+  /*
+   * Return the value of the complex number in polar notation
+   * The angle phi will be set in the interval of [-pi, pi].
+   * @return {{r: number, phi: number}} Returns and object with properties r and phi.
+   */
+
+
+  _complex.default.prototype.toPolar = function () {
+    return {
+      r: this.abs(),
+      phi: this.arg()
+    };
+  };
+  /**
+   * Get a string representation of the complex number,
+   * with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string} str
+   */
+
+
+  _complex.default.prototype.format = function (options) {
+    var str = '';
+    var im = this.im;
+    var re = this.re;
+    var strRe = (0, _number.format)(this.re, options);
+    var strIm = (0, _number.format)(this.im, options); // round either re or im when smaller than the configured precision
+
+    var precision = (0, _is.isNumber)(options) ? options : options ? options.precision : null;
+
+    if (precision !== null) {
+      var epsilon = Math.pow(10, -precision);
+
+      if (Math.abs(re / im) < epsilon) {
+        re = 0;
+      }
+
+      if (Math.abs(im / re) < epsilon) {
+        im = 0;
+      }
+    }
+
+    if (im === 0) {
+      // real value
+      str = strRe;
+    } else if (re === 0) {
+      // purely complex value
+      if (im === 1) {
+        str = 'i';
+      } else if (im === -1) {
+        str = '-i';
+      } else {
+        str = strIm + 'i';
+      }
+    } else {
+      // complex value
+      if (im < 0) {
+        if (im === -1) {
+          str = strRe + ' - i';
+        } else {
+          str = strRe + ' - ' + strIm.substring(1) + 'i';
+        }
+      } else {
+        if (im === 1) {
+          str = strRe + ' + i';
+        } else {
+          str = strRe + ' + ' + strIm + 'i';
+        }
+      }
+    }
+
+    return str;
+  };
+  /**
+   * Create a complex number from polar coordinates
+   *
+   * Usage:
+   *
+   *     Complex.fromPolar(r: number, phi: number) : Complex
+   *     Complex.fromPolar({r: number, phi: number}) : Complex
+   *
+   * @param {*} args...
+   * @return {Complex}
+   */
+
+
+  _complex.default.fromPolar = function (args) {
+    switch (arguments.length) {
+      case 1:
+        {
+          var arg = arguments[0];
+
+          if ((0, _typeof2.default)(arg) === 'object') {
+            return (0, _complex.default)(arg);
+          } else {
+            throw new TypeError('Input has to be an object with r and phi keys.');
+          }
+        }
+
+      case 2:
+        {
+          var r = arguments[0];
+          var phi = arguments[1];
+
+          if ((0, _is.isNumber)(r)) {
+            if ((0, _is.isUnit)(phi) && phi.hasBase('ANGLE')) {
+              // convert unit to a number in radians
+              phi = phi.toNumber('rad');
+            }
+
+            if ((0, _is.isNumber)(phi)) {
+              return new _complex.default({
+                r: r,
+                phi: phi
+              });
+            }
+
+            throw new TypeError('Phi is not a number nor an angle unit.');
+          } else {
+            throw new TypeError('Radius r is not a number.');
+          }
+        }
+
+      default:
+        throw new SyntaxError('Wrong number of arguments in function fromPolar');
+    }
+  };
+
+  _complex.default.prototype.valueOf = _complex.default.prototype.toString;
+  /**
+   * Create a Complex number from a JSON object
+   * @param {Object} json  A JSON Object structured as
+   *                       {"mathjs": "Complex", "re": 2, "im": 3}
+   *                       All properties are optional, default values
+   *                       for `re` and `im` are 0.
+   * @return {Complex} Returns a new Complex number
+   */
+
+  _complex.default.fromJSON = function (json) {
+    return new _complex.default(json);
+  };
+  /**
+   * Compare two complex numbers, `a` and `b`:
+   *
+   * - Returns 1 when the real part of `a` is larger than the real part of `b`
+   * - Returns -1 when the real part of `a` is smaller than the real part of `b`
+   * - Returns 1 when the real parts are equal
+   *   and the imaginary part of `a` is larger than the imaginary part of `b`
+   * - Returns -1 when the real parts are equal
+   *   and the imaginary part of `a` is smaller than the imaginary part of `b`
+   * - Returns 0 when both real and imaginary parts are equal.
+   *
+   * @params {Complex} a
+   * @params {Complex} b
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+
+  _complex.default.compare = function (a, b) {
+    if (a.re > b.re) {
+      return 1;
+    }
+
+    if (a.re < b.re) {
+      return -1;
+    }
+
+    if (a.im > b.im) {
+      return 1;
+    }
+
+    if (a.im < b.im) {
+      return -1;
+    }
+
+    return 0;
+  };
+
+  return _complex.default;
+}, {
+  isClass: true
+});
+exports.createComplexClass = createComplexClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/complex/function/complex.js b/node_modules/mathjs/lib/cjs/type/complex/function/complex.js
new file mode 100644
index 0000000..30e99ef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/complex/function/complex.js
@@ -0,0 +1,98 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComplex = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _collection = require("../../../utils/collection.js");
+
+var name = 'complex';
+var dependencies = ['typed', 'Complex'];
+var createComplex = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Complex = _ref.Complex;
+
+  /**
+   * Create a complex value or convert a value to a complex value.
+   *
+   * Syntax:
+   *
+   *     math.complex()                           // creates a complex value with zero
+   *                                              // as real and imaginary part.
+   *     math.complex(re : number, im : string)   // creates a complex value with provided
+   *                                              // values for real and imaginary part.
+   *     math.complex(re : number)                // creates a complex value with provided
+   *                                              // real value and zero imaginary part.
+   *     math.complex(complex : Complex)          // clones the provided complex value.
+   *     math.complex(arg : string)               // parses a string into a complex value.
+   *     math.complex(array : Array)              // converts the elements of the array
+   *                                              // or matrix element wise into a
+   *                                              // complex value.
+   *     math.complex({re: number, im: number})   // creates a complex value with provided
+   *                                              // values for real an imaginary part.
+   *     math.complex({r: number, phi: number})   // creates a complex value with provided
+   *                                              // polar coordinates
+   *
+   * Examples:
+   *
+   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i
+   *    a.re = 5                          // a = Complex 5 - 4i
+   *    const i = a.im                    // Number -4
+   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i
+   *    const c = math.complex()          // Complex 0 + 0i
+   *    const d = math.add(a, b)          // Complex 5 + 2i
+   *
+   * See also:
+   *
+   *    bignumber, boolean, index, matrix, number, string, unit
+   *
+   * @param {* | Array | Matrix} [args]
+   *            Arguments specifying the real and imaginary part of the complex number
+   * @return {Complex | Array | Matrix} Returns a complex value
+   */
+  return typed('complex', {
+    '': function _() {
+      return Complex.ZERO;
+    },
+    number: function number(x) {
+      return new Complex(x, 0);
+    },
+    'number, number': function numberNumber(re, im) {
+      return new Complex(re, im);
+    },
+    // TODO: this signature should be redundant
+    'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {
+      return new Complex(re.toNumber(), im.toNumber());
+    },
+    Fraction: function Fraction(x) {
+      return new Complex(x.valueOf(), 0);
+    },
+    Complex: function Complex(x) {
+      return x.clone();
+    },
+    string: function string(x) {
+      return Complex(x); // for example '2 + 3i'
+    },
+    null: function _null(x) {
+      return Complex(0);
+    },
+    Object: function Object(x) {
+      if ('re' in x && 'im' in x) {
+        return new Complex(x.re, x.im);
+      }
+
+      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {
+        return new Complex(x);
+      }
+
+      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createComplex = createComplex;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/fraction/Fraction.js b/node_modules/mathjs/lib/cjs/type/fraction/Fraction.js
new file mode 100644
index 0000000..970c53a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/fraction/Fraction.js
@@ -0,0 +1,51 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFractionClass = void 0;
+
+var _fraction = _interopRequireDefault(require("fraction.js"));
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'Fraction';
+var dependencies = [];
+var createFractionClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {
+  /**
+   * Attach type information
+   */
+  _fraction.default.prototype.type = 'Fraction';
+  _fraction.default.prototype.isFraction = true;
+  /**
+   * Get a JSON representation of a Fraction containing type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Fraction", "n": 3, "d": 8}`
+   */
+
+  _fraction.default.prototype.toJSON = function () {
+    return {
+      mathjs: 'Fraction',
+      n: this.s * this.n,
+      d: this.d
+    };
+  };
+  /**
+   * Instantiate a Fraction from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "Fraction", "n": 3, "d": 8}`
+   * @return {BigNumber}
+   */
+
+
+  _fraction.default.fromJSON = function (json) {
+    return new _fraction.default(json);
+  };
+
+  return _fraction.default;
+}, {
+  isClass: true
+});
+exports.createFractionClass = createFractionClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/fraction/function/fraction.js b/node_modules/mathjs/lib/cjs/type/fraction/function/fraction.js
new file mode 100644
index 0000000..db68e28
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/fraction/function/fraction.js
@@ -0,0 +1,86 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFraction = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _collection = require("../../../utils/collection.js");
+
+var name = 'fraction';
+var dependencies = ['typed', 'Fraction'];
+var createFraction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Fraction = _ref.Fraction;
+
+  /**
+   * Create a fraction or convert a value to a fraction.
+   *
+   * With one numeric argument, produces the closest rational approximation to the
+   * input.
+   * With two arguments, the first is the numerator and the second is the denominator,
+   * and creates the corresponding fraction. Both numerator and denominator must be
+   * integers.
+   * With one object argument, looks for the integer numerator as the value of property
+   * 'n' and the integer denominator as the value of property 'd'.
+   * With a matrix argument, creates a matrix of the same shape with entries
+   * converted into fractions.
+   *
+   * Syntax:
+   *     math.fraction(value)
+   *     math.fraction(numerator, denominator)
+   *     math.fraction({n: numerator, d: denominator})
+   *     math.fraction(matrix: Array | Matrix)
+   *
+   * Examples:
+   *
+   *     math.fraction(6.283)             // returns Fraction 6283/1000
+   *     math.fraction(1, 3)              // returns Fraction 1/3
+   *     math.fraction('2/3')             // returns Fraction 2/3
+   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3
+   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]
+   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer
+   *
+   * See also:
+   *
+   *    bignumber, number, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]
+   *            Arguments specifying the value, or numerator and denominator of
+   *            the fraction
+   * @return {Fraction | Array | Matrix} Returns a fraction
+   */
+  return typed('fraction', {
+    number: function number(x) {
+      if (!isFinite(x) || isNaN(x)) {
+        throw new Error(x + ' cannot be represented as a fraction');
+      }
+
+      return new Fraction(x);
+    },
+    string: function string(x) {
+      return new Fraction(x);
+    },
+    'number, number': function numberNumber(numerator, denominator) {
+      return new Fraction(numerator, denominator);
+    },
+    null: function _null(x) {
+      return new Fraction(0);
+    },
+    BigNumber: function BigNumber(x) {
+      return new Fraction(x.toString());
+    },
+    Fraction: function Fraction(x) {
+      return x; // fractions are immutable
+    },
+    Object: function Object(x) {
+      return new Fraction(x);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createFraction = createFraction;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/DenseMatrix.js b/node_modules/mathjs/lib/cjs/type/matrix/DenseMatrix.js
new file mode 100644
index 0000000..4c534a0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/DenseMatrix.js
@@ -0,0 +1,1089 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDenseMatrixClass = void 0;
+
+var _regenerator = _interopRequireDefault(require("@babel/runtime/regenerator"));
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _string = require("../../utils/string.js");
+
+var _number = require("../../utils/number.js");
+
+var _object = require("../../utils/object.js");
+
+var _DimensionError = require("../../error/DimensionError.js");
+
+var _factory = require("../../utils/factory.js");
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+var name = 'DenseMatrix';
+var dependencies = ['Matrix'];
+var createDenseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var Matrix = _ref.Matrix;
+
+  /**
+   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.
+   * @class DenseMatrix
+   * @enum {{ value, index: number[] }}
+   */
+  function DenseMatrix(data, datatype) {
+    if (!(this instanceof DenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (datatype && !(0, _is.isString)(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+
+    if ((0, _is.isMatrix)(data)) {
+      // check data is a DenseMatrix
+      if (data.type === 'DenseMatrix') {
+        // clone data & size
+        this._data = (0, _object.clone)(data._data);
+        this._size = (0, _object.clone)(data._size);
+        this._datatype = datatype || data._datatype;
+      } else {
+        // build data from existing matrix
+        this._data = data.toArray();
+        this._size = data.size();
+        this._datatype = datatype || data._datatype;
+      }
+    } else if (data && (0, _is.isArray)(data.data) && (0, _is.isArray)(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size; // verify the dimensions of the array
+
+      (0, _array.validate)(this._data, this._size);
+      this._datatype = datatype || data.datatype;
+    } else if ((0, _is.isArray)(data)) {
+      // replace nested Matrices with Arrays
+      this._data = preprocess(data); // get the dimensions of the array
+
+      this._size = (0, _array.arraySize)(this._data); // verify the dimensions of the array, TODO: compute size while processing array
+
+      (0, _array.validate)(this._data, this._size); // data type unknown
+
+      this._datatype = datatype;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + (0, _is.typeOf)(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+    }
+  }
+
+  DenseMatrix.prototype = new Matrix();
+  /**
+   * Create a new DenseMatrix
+   */
+
+  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+  /**
+   * Attach type information
+   */
+
+
+  DenseMatrix.prototype.type = 'DenseMatrix';
+  DenseMatrix.prototype.isDenseMatrix = true;
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf DenseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+
+  DenseMatrix.prototype.getDataType = function () {
+    return (0, _array.getArrayDataType)(this._data, _is.typeOf);
+  };
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()  // retrieve storage format
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The storage format.
+   */
+
+
+  DenseMatrix.prototype.storage = function () {
+    return 'dense';
+  };
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()   // retrieve matrix datatype
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The datatype.
+   */
+
+
+  DenseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+  /**
+   * Create a new DenseMatrix
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+
+
+  DenseMatrix.prototype.create = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof DenseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+
+  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    switch (arguments.length) {
+      case 1:
+        return _get(this, index);
+      // intentional fall through
+
+      case 2:
+      case 3:
+        return _set(this, index, replacement, defaultValue);
+
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+  /**
+   * Get a single element from the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+
+
+  DenseMatrix.prototype.get = function (index) {
+    if (!(0, _is.isArray)(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length !== this._size.length) {
+      throw new _DimensionError.DimensionError(index.length, this._size.length);
+    } // check index
+
+
+    for (var x = 0; x < index.length; x++) {
+      (0, _array.validateIndex)(index[x], this._size[x]);
+    }
+
+    var data = this._data;
+
+    for (var i = 0, ii = index.length; i < ii; i++) {
+      var indexI = index[i];
+      (0, _array.validateIndex)(indexI, data.length);
+      data = data[indexI];
+    }
+
+    return data;
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {DenseMatrix} self
+   */
+
+
+  DenseMatrix.prototype.set = function (index, value, defaultValue) {
+    if (!(0, _is.isArray)(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length < this._size.length) {
+      throw new _DimensionError.DimensionError(index.length, this._size.length, '<');
+    }
+
+    var i, ii, indexI; // enlarge matrix when needed
+
+    var size = index.map(function (i) {
+      return i + 1;
+    });
+
+    _fit(this, size, defaultValue); // traverse over the dimensions
+
+
+    var data = this._data;
+
+    for (i = 0, ii = index.length - 1; i < ii; i++) {
+      indexI = index[i];
+      (0, _array.validateIndex)(indexI, data.length);
+      data = data[indexI];
+    } // set new value
+
+
+    indexI = index[index.length - 1];
+    (0, _array.validateIndex)(indexI, data.length);
+    data[indexI] = value;
+    return this;
+  };
+  /**
+   * Get a submatrix of this matrix
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index   Zero-based index
+   * @private
+   */
+
+
+  function _get(matrix, index) {
+    if (!(0, _is.isIndex)(index)) {
+      throw new TypeError('Invalid index');
+    }
+
+    var isScalar = index.isScalar();
+
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(index.min());
+    } else {
+      // validate dimensions
+      var size = index.size();
+
+      if (size.length !== matrix._size.length) {
+        throw new _DimensionError.DimensionError(size.length, matrix._size.length);
+      } // validate if any of the ranges in the index is out of range
+
+
+      var min = index.min();
+      var max = index.max();
+
+      for (var i = 0, ii = matrix._size.length; i < ii; i++) {
+        (0, _array.validateIndex)(min[i], matrix._size[i]);
+        (0, _array.validateIndex)(max[i], matrix._size[i]);
+      } // retrieve submatrix
+      // TODO: more efficient when creating an empty matrix and setting _data and _size manually
+
+
+      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);
+    }
+  }
+  /**
+   * Recursively get a submatrix of a multi dimensional matrix.
+   * Index is not checked for correct number or length of dimensions.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @param {number} dims   Total number of dimensions
+   * @param {number} dim    Current dimension
+   * @return {Array} submatrix
+   * @private
+   */
+
+
+  function _getSubmatrix(data, index, dims, dim) {
+    var last = dim === dims - 1;
+    var range = index.dimension(dim);
+
+    if (last) {
+      return range.map(function (i) {
+        (0, _array.validateIndex)(i, data.length);
+        return data[i];
+      }).valueOf();
+    } else {
+      return range.map(function (i) {
+        (0, _array.validateIndex)(i, data.length);
+        var child = data[i];
+        return _getSubmatrix(child, index, dims, dim + 1);
+      }).valueOf();
+    }
+  }
+  /**
+   * Replace a submatrix in this matrix
+   * Indexes are zero-based.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index
+   * @param {DenseMatrix | Array | *} submatrix
+   * @param {*} defaultValue          Default value, filled in on new entries when
+   *                                  the matrix is resized.
+   * @return {DenseMatrix} matrix
+   * @private
+   */
+
+
+  function _set(matrix, index, submatrix, defaultValue) {
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    } // get index size and check whether the index contains a single value
+
+
+    var iSize = index.size();
+    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed
+
+    var sSize;
+
+    if ((0, _is.isMatrix)(submatrix)) {
+      sSize = submatrix.size();
+      submatrix = submatrix.valueOf();
+    } else {
+      sSize = (0, _array.arraySize)(submatrix);
+    }
+
+    if (isScalar) {
+      // set a scalar
+      // check whether submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      }
+
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // set a submatrix
+      // validate dimensions
+      if (iSize.length < matrix._size.length) {
+        throw new _DimensionError.DimensionError(iSize.length, matrix._size.length, '<');
+      }
+
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        var i = 0;
+        var outer = 0;
+
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        } // unsqueeze both outer and inner dimensions
+
+
+        submatrix = (0, _array.unsqueeze)(submatrix, iSize.length, outer, sSize);
+      } // check whether the size of the submatrix matches the index size
+
+
+      if (!(0, _object.deepStrictEqual)(iSize, sSize)) {
+        throw new _DimensionError.DimensionError(iSize, sSize, '>');
+      } // enlarge matrix when needed
+
+
+      var size = index.max().map(function (i) {
+        return i + 1;
+      });
+
+      _fit(matrix, size, defaultValue); // insert the sub matrix
+
+
+      var dims = iSize.length;
+      var dim = 0;
+
+      _setSubmatrix(matrix._data, index, submatrix, dims, dim);
+    }
+
+    return matrix;
+  }
+  /**
+   * Replace a submatrix of a multi dimensional matrix.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @param {Array} submatrix
+   * @param {number} dims   Total number of dimensions
+   * @param {number} dim
+   * @private
+   */
+
+
+  function _setSubmatrix(data, index, submatrix, dims, dim) {
+    var last = dim === dims - 1;
+    var range = index.dimension(dim);
+
+    if (last) {
+      range.forEach(function (dataIndex, subIndex) {
+        (0, _array.validateIndex)(dataIndex);
+        data[dataIndex] = submatrix[subIndex[0]];
+      });
+    } else {
+      range.forEach(function (dataIndex, subIndex) {
+        (0, _array.validateIndex)(dataIndex);
+
+        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);
+      });
+    }
+  }
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof DenseMatrix
+   * @param {number[] || Matrix} size The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!(0, _is.isCollection)(size)) {
+      throw new TypeError('Array or Matrix expected');
+    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+
+
+    var sizeArray = size.valueOf().map(function (value) {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    }); // matrix to resize
+
+    var m = copy ? this.clone() : this; // resize matrix
+
+    return _resize(m, sizeArray, defaultValue);
+  };
+
+  function _resize(matrix, size, defaultValue) {
+    // check size
+    if (size.length === 0) {
+      // first value in matrix
+      var v = matrix._data; // go deep
+
+      while ((0, _is.isArray)(v)) {
+        v = v[0];
+      }
+
+      return v;
+    } // resize matrix
+
+
+    matrix._size = size.slice(0); // copy the array
+
+    matrix._data = (0, _array.resize)(matrix._data, matrix._size, defaultValue); // return matrix
+
+    return matrix;
+  }
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof DenseMatrix
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+
+
+  DenseMatrix.prototype.reshape = function (size, copy) {
+    var m = copy ? this.clone() : this;
+    m._data = (0, _array.reshape)(m._data, size);
+
+    var currentLength = m._size.reduce(function (length, size) {
+      return length * size;
+    });
+
+    m._size = (0, _array.processSizesWildcard)(size, currentLength);
+    return m;
+  };
+  /**
+   * Enlarge the matrix when it is smaller than given size.
+   * If the matrix is larger or equal sized, nothing is done.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix           The matrix to be resized
+   * @param {number[]} size
+   * @param {*} defaultValue          Default value, filled in on new entries.
+   * @private
+   */
+
+
+  function _fit(matrix, size, defaultValue) {
+    var // copy the array
+    newSize = matrix._size.slice(0);
+
+    var changed = false; // add dimensions when needed
+
+    while (newSize.length < size.length) {
+      newSize.push(0);
+      changed = true;
+    } // enlarge size when needed
+
+
+    for (var i = 0, ii = size.length; i < ii; i++) {
+      if (size[i] > newSize[i]) {
+        newSize[i] = size[i];
+        changed = true;
+      }
+    }
+
+    if (changed) {
+      // resize only when size is changed
+      _resize(matrix, newSize, defaultValue);
+    }
+  }
+  /**
+   * Create a clone of the matrix
+   * @memberof DenseMatrix
+   * @return {DenseMatrix} clone
+   */
+
+
+  DenseMatrix.prototype.clone = function () {
+    var m = new DenseMatrix({
+      data: (0, _object.clone)(this._data),
+      size: (0, _object.clone)(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof DenseMatrix
+   * @returns {number[]} size
+   */
+
+
+  DenseMatrix.prototype.size = function () {
+    return this._size.slice(0); // return a clone of _size
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   *
+   * @return {DenseMatrix} matrix
+   */
+
+
+  DenseMatrix.prototype.map = function (callback) {
+    // matrix instance
+    var me = this;
+
+    var recurse = function recurse(value, index) {
+      if ((0, _is.isArray)(value)) {
+        return value.map(function (child, i) {
+          return recurse(child, index.concat(i));
+        });
+      } else {
+        return callback(value, index, me);
+      }
+    }; // determine the new datatype when the original matrix has datatype defined
+    // TODO: should be done in matrix constructor instead
+
+
+    var data = recurse(this._data, []);
+    var datatype = this._datatype !== undefined ? (0, _array.getArrayDataType)(data, _is.typeOf) : undefined;
+    return new DenseMatrix(data, datatype);
+  };
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   */
+
+
+  DenseMatrix.prototype.forEach = function (callback) {
+    // matrix instance
+    var me = this;
+
+    var recurse = function recurse(value, index) {
+      if ((0, _is.isArray)(value)) {
+        value.forEach(function (child, i) {
+          recurse(child, index.concat(i));
+        });
+      } else {
+        callback(value, index, me);
+      }
+    };
+
+    recurse(this._data, []);
+  };
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+
+
+  DenseMatrix.prototype[Symbol.iterator] = /*#__PURE__*/_regenerator.default.mark(function _callee() {
+    var recurse;
+    return _regenerator.default.wrap(function _callee$(_context2) {
+      while (1) {
+        switch (_context2.prev = _context2.next) {
+          case 0:
+            recurse = /*#__PURE__*/_regenerator.default.mark(function recurse(value, index) {
+              var i;
+              return _regenerator.default.wrap(function recurse$(_context) {
+                while (1) {
+                  switch (_context.prev = _context.next) {
+                    case 0:
+                      if (!(0, _is.isArray)(value)) {
+                        _context.next = 9;
+                        break;
+                      }
+
+                      i = 0;
+
+                    case 2:
+                      if (!(i < value.length)) {
+                        _context.next = 7;
+                        break;
+                      }
+
+                      return _context.delegateYield(recurse(value[i], index.concat(i)), "t0", 4);
+
+                    case 4:
+                      i++;
+                      _context.next = 2;
+                      break;
+
+                    case 7:
+                      _context.next = 11;
+                      break;
+
+                    case 9:
+                      _context.next = 11;
+                      return {
+                        value: value,
+                        index: index
+                      };
+
+                    case 11:
+                    case "end":
+                      return _context.stop();
+                  }
+                }
+              }, recurse);
+            });
+            return _context2.delegateYield(recurse(this._data, []), "t0", 2);
+
+          case 2:
+          case "end":
+            return _context2.stop();
+        }
+      }
+    }, _callee, this);
+  });
+  /**
+   * Returns an array containing the rows of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+
+  DenseMatrix.prototype.rows = function () {
+    var result = [];
+    var s = this.size();
+
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+
+    var data = this._data;
+
+    var _iterator = _createForOfIteratorHelper(data),
+        _step;
+
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var row = _step.value;
+        result.push(new DenseMatrix([row], this._datatype));
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+
+    return result;
+  };
+  /**
+   * Returns an array containing the columns of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+
+
+  DenseMatrix.prototype.columns = function () {
+    var _this = this;
+
+    var result = [];
+    var s = this.size();
+
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+
+    var data = this._data;
+
+    var _loop = function _loop(i) {
+      var col = data.map(function (row) {
+        return [row[i]];
+      });
+      result.push(new DenseMatrix(col, _this._datatype));
+    };
+
+    for (var i = 0; i < s[1]; i++) {
+      _loop(i);
+    }
+
+    return result;
+  };
+  /**
+   * Create an Array with a copy of the data of the DenseMatrix
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+
+
+  DenseMatrix.prototype.toArray = function () {
+    return (0, _object.clone)(this._data);
+  };
+  /**
+   * Get the primitive value of the DenseMatrix: a multidimensional array
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+
+
+  DenseMatrix.prototype.valueOf = function () {
+    return this._data;
+  };
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof DenseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  DenseMatrix.prototype.format = function (options) {
+    return (0, _string.format)(this._data, options);
+  };
+  /**
+   * Get a string representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {string} str
+   */
+
+
+  DenseMatrix.prototype.toString = function () {
+    return (0, _string.format)(this._data);
+  };
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {Object}
+   */
+
+
+  DenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'DenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof DenseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix with the diagonal values.
+   */
+
+
+  DenseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows & columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // number diagonal values
+
+    var n = Math.min(rows - kSub, columns - kSuper); // x is a matrix get diagonal from matrix
+
+    var data = []; // loop rows
+
+    for (var i = 0; i < n; i++) {
+      data[i] = this._data[i + kSub][i + kSuper];
+    } // create DenseMatrix
+
+
+    return new DenseMatrix({
+      data: data,
+      size: [n],
+      datatype: this._datatype
+    });
+  };
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {Array} size                     The matrix size.
+   * @param {number | Matrix | Array } value The values for the diagonal.
+   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]          The default value for non-diagonal
+   * @param {string} [datatype]              The datatype for the diagonal
+   *
+   * @returns {DenseMatrix}
+   */
+
+
+  DenseMatrix.diagonal = function (size, value, k, defaultValue) {
+    if (!(0, _is.isArray)(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    } // map size & validate
+
+
+    size = size.map(function (s) {
+      // check it is a big number
+      if ((0, _is.isBigNumber)(s)) {
+        // convert it
+        s = s.toNumber();
+      } // validate arguments
+
+
+      if (!(0, _is.isNumber)(s) || !(0, _number.isInteger)(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+
+      return s;
+    }); // validate k if any
+
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows and columns
+
+    var rows = size[0];
+    var columns = size[1]; // number of non-zero items
+
+    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function
+
+    var _value; // check value
+
+
+    if ((0, _is.isArray)(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if ((0, _is.isMatrix)(value)) {
+      // matrix size
+      var ms = value.size(); // validate matrix
+
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function _value() {
+        // return value
+        return value;
+      };
+    } // discover default value if needed
+
+
+    if (!defaultValue) {
+      // check first value in array
+      defaultValue = (0, _is.isBigNumber)(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero
+      : 0;
+    } // empty array
+
+
+    var data = []; // check we need to resize array
+
+    if (size.length > 0) {
+      // resize array
+      data = (0, _array.resize)(data, size, defaultValue); // fill diagonal
+
+      for (var d = 0; d < n; d++) {
+        data[d + kSub][d + kSuper] = _value(d);
+      }
+    } // create DenseMatrix
+
+
+    return new DenseMatrix({
+      data: data,
+      size: [rows, columns]
+    });
+  };
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof DenseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "DenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {DenseMatrix}
+   */
+
+
+  DenseMatrix.fromJSON = function (json) {
+    return new DenseMatrix(json);
+  };
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+
+
+  DenseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!(0, _is.isNumber)(i) || !(0, _number.isInteger)(i) || !(0, _is.isNumber)(j) || !(0, _number.isInteger)(j)) {
+      throw new Error('Row index must be positive integers');
+    } // check dimensions
+
+
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    } // validate index
+
+
+    (0, _array.validateIndex)(i, this._size[0]);
+    (0, _array.validateIndex)(j, this._size[0]); // swap rows
+
+    DenseMatrix._swapRows(i, j, this._data); // return current instance
+
+
+    return this;
+  };
+  /**
+   * Swap rows i and j in Dense Matrix data structure.
+   *
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   * @param {Array} data     Matrix data
+   */
+
+
+  DenseMatrix._swapRows = function (i, j, data) {
+    // swap values i <-> j
+    var vi = data[i];
+    data[i] = data[j];
+    data[j] = vi;
+  };
+  /**
+   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and
+   * Matrices. Replaces all nested Matrices with Arrays
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @return {Array} data
+   */
+
+
+  function preprocess(data) {
+    for (var i = 0, ii = data.length; i < ii; i++) {
+      var elem = data[i];
+
+      if ((0, _is.isArray)(elem)) {
+        data[i] = preprocess(elem);
+      } else if (elem && elem.isMatrix === true) {
+        data[i] = preprocess(elem.valueOf());
+      }
+    }
+
+    return data;
+  }
+
+  return DenseMatrix;
+}, {
+  isClass: true
+});
+exports.createDenseMatrixClass = createDenseMatrixClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/FibonacciHeap.js b/node_modules/mathjs/lib/cjs/type/matrix/FibonacciHeap.js
new file mode 100644
index 0000000..61e8ee4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/FibonacciHeap.js
@@ -0,0 +1,396 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFibonacciHeapClass = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'FibonacciHeap';
+var dependencies = ['smaller', 'larger'];
+var createFibonacciHeapClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var smaller = _ref.smaller,
+      larger = _ref.larger;
+  var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);
+  /**
+   * Fibonacci Heap implementation, used interally for Matrix math.
+   * @class FibonacciHeap
+   * @constructor FibonacciHeap
+   */
+
+  function FibonacciHeap() {
+    if (!(this instanceof FibonacciHeap)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // initialize fields
+
+
+    this._minimum = null;
+    this._size = 0;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  FibonacciHeap.prototype.type = 'FibonacciHeap';
+  FibonacciHeap.prototype.isFibonacciHeap = true;
+  /**
+   * Inserts a new data element into the heap. No heap consolidation is
+   * performed at this time, the new node is simply inserted into the root
+   * list of this heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+
+  FibonacciHeap.prototype.insert = function (key, value) {
+    // create node
+    var node = {
+      key: key,
+      value: value,
+      degree: 0
+    }; // check we have a node in the minimum
+
+    if (this._minimum) {
+      // minimum node
+      var minimum = this._minimum; // update left & right of node
+
+      node.left = minimum;
+      node.right = minimum.right;
+      minimum.right = node;
+      node.right.left = node; // update minimum node in heap if needed
+
+      if (smaller(key, minimum.key)) {
+        // node has a smaller key, use it as minimum
+        this._minimum = node;
+      }
+    } else {
+      // set left & right
+      node.left = node;
+      node.right = node; // this is the first node
+
+      this._minimum = node;
+    } // increment number of nodes in heap
+
+
+    this._size++; // return node
+
+    return node;
+  };
+  /**
+   * Returns the number of nodes in heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.size = function () {
+    return this._size;
+  };
+  /**
+   * Removes all elements from this heap.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.clear = function () {
+    this._minimum = null;
+    this._size = 0;
+  };
+  /**
+   * Returns true if the heap is empty, otherwise false.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.isEmpty = function () {
+    return this._size === 0;
+  };
+  /**
+   * Extracts the node with minimum key from heap. Amortized running
+   * time: O(log n).
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.extractMinimum = function () {
+    // node to remove
+    var node = this._minimum; // check we have a minimum
+
+    if (node === null) {
+      return node;
+    } // current minimum
+
+
+    var minimum = this._minimum; // get number of children
+
+    var numberOfChildren = node.degree; // pointer to the first child
+
+    var x = node.child; // for each child of node do...
+
+    while (numberOfChildren > 0) {
+      // store node in right side
+      var tempRight = x.right; // remove x from child list
+
+      x.left.right = x.right;
+      x.right.left = x.left; // add x to root list of heap
+
+      x.left = minimum;
+      x.right = minimum.right;
+      minimum.right = x;
+      x.right.left = x; // set Parent[x] to null
+
+      x.parent = null;
+      x = tempRight;
+      numberOfChildren--;
+    } // remove node from root list of heap
+
+
+    node.left.right = node.right;
+    node.right.left = node.left; // update minimum
+
+    if (node === node.right) {
+      // empty
+      minimum = null;
+    } else {
+      // update minimum
+      minimum = node.right; // we need to update the pointer to the root with minimum key
+
+      minimum = _findMinimumNode(minimum, this._size);
+    } // decrement size of heap
+
+
+    this._size--; // update minimum
+
+    this._minimum = minimum; // return node
+
+    return node;
+  };
+  /**
+   * Removes a node from the heap given the reference to the node. The trees
+   * in the heap will be consolidated, if necessary. This operation may fail
+   * to remove the correct element if there are nodes with key value -Infinity.
+   * Running time: O(log n) amortized.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.remove = function (node) {
+    // decrease key value
+    this._minimum = _decreaseKey(this._minimum, node, -1); // remove the smallest
+
+    this.extractMinimum();
+  };
+  /**
+   * Decreases the key value for a heap node, given the new value to take on.
+   * The structure of the heap may be changed and will not be consolidated.
+   * Running time: O(1) amortized.
+   * @memberof FibonacciHeap
+   */
+
+
+  function _decreaseKey(minimum, node, key) {
+    // set node key
+    node.key = key; // get parent node
+
+    var parent = node.parent;
+
+    if (parent && smaller(node.key, parent.key)) {
+      // remove node from parent
+      _cut(minimum, node, parent); // remove all nodes from parent to the root parent
+
+
+      _cascadingCut(minimum, parent);
+    } // update minimum node if needed
+
+
+    if (smaller(node.key, minimum.key)) {
+      minimum = node;
+    } // return minimum
+
+
+    return minimum;
+  }
+  /**
+   * The reverse of the link operation: removes node from the child list of parent.
+   * This method assumes that min is non-null. Running time: O(1).
+   * @memberof FibonacciHeap
+   */
+
+
+  function _cut(minimum, node, parent) {
+    // remove node from parent children and decrement Degree[parent]
+    node.left.right = node.right;
+    node.right.left = node.left;
+    parent.degree--; // reset y.child if necessary
+
+    if (parent.child === node) {
+      parent.child = node.right;
+    } // remove child if degree is 0
+
+
+    if (parent.degree === 0) {
+      parent.child = null;
+    } // add node to root list of heap
+
+
+    node.left = minimum;
+    node.right = minimum.right;
+    minimum.right = node;
+    node.right.left = node; // set parent[node] to null
+
+    node.parent = null; // set mark[node] to false
+
+    node.mark = false;
+  }
+  /**
+   * Performs a cascading cut operation. This cuts node from its parent and then
+   * does the same for its parent, and so on up the tree.
+   * Running time: O(log n); O(1) excluding the recursion.
+   * @memberof FibonacciHeap
+   */
+
+
+  function _cascadingCut(minimum, node) {
+    // store parent node
+    var parent = node.parent; // if there's a parent...
+
+    if (!parent) {
+      return;
+    } // if node is unmarked, set it marked
+
+
+    if (!node.mark) {
+      node.mark = true;
+    } else {
+      // it's marked, cut it from parent
+      _cut(minimum, node, parent); // cut its parent as well
+
+
+      _cascadingCut(parent);
+    }
+  }
+  /**
+   * Make the first node a child of the second one. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+
+
+  var _linkNodes = function _linkNodes(node, parent) {
+    // remove node from root list of heap
+    node.left.right = node.right;
+    node.right.left = node.left; // make node a Child of parent
+
+    node.parent = parent;
+
+    if (!parent.child) {
+      parent.child = node;
+      node.right = node;
+      node.left = node;
+    } else {
+      node.left = parent.child;
+      node.right = parent.child.right;
+      parent.child.right = node;
+      node.right.left = node;
+    } // increase degree[parent]
+
+
+    parent.degree++; // set mark[node] false
+
+    node.mark = false;
+  };
+
+  function _findMinimumNode(minimum, size) {
+    // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree
+    var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; // create list with initial capacity
+
+    var array = new Array(arraySize); // find the number of root nodes.
+
+    var numRoots = 0;
+    var x = minimum;
+
+    if (x) {
+      numRoots++;
+      x = x.right;
+
+      while (x !== minimum) {
+        numRoots++;
+        x = x.right;
+      }
+    } // vars
+
+
+    var y; // For each node in root list do...
+
+    while (numRoots > 0) {
+      // access this node's degree..
+      var d = x.degree; // get next node
+
+      var next = x.right; // check if there is a node already in array with the same degree
+
+      while (true) {
+        // get node with the same degree is any
+        y = array[d];
+
+        if (!y) {
+          break;
+        } // make one node with the same degree a child of the other, do this based on the key value.
+
+
+        if (larger(x.key, y.key)) {
+          var temp = y;
+          y = x;
+          x = temp;
+        } // make y a child of x
+
+
+        _linkNodes(y, x); // we have handled this degree, go to next one.
+
+
+        array[d] = null;
+        d++;
+      } // save this node for later when we might encounter another of the same degree.
+
+
+      array[d] = x; // move forward through list.
+
+      x = next;
+      numRoots--;
+    } // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].
+
+
+    minimum = null; // loop nodes in array
+
+    for (var i = 0; i < arraySize; i++) {
+      // get current node
+      y = array[i];
+
+      if (!y) {
+        continue;
+      } // check if we have a linked list
+
+
+      if (minimum) {
+        // First remove node from root list.
+        y.left.right = y.right;
+        y.right.left = y.left; // now add to root list, again.
+
+        y.left = minimum;
+        y.right = minimum.right;
+        minimum.right = y;
+        y.right.left = y; // check if this is a new min.
+
+        if (smaller(y.key, minimum.key)) {
+          minimum = y;
+        }
+      } else {
+        minimum = y;
+      }
+    }
+
+    return minimum;
+  }
+
+  return FibonacciHeap;
+}, {
+  isClass: true
+});
+exports.createFibonacciHeapClass = createFibonacciHeapClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/ImmutableDenseMatrix.js b/node_modules/mathjs/lib/cjs/type/matrix/ImmutableDenseMatrix.js
new file mode 100644
index 0000000..220bd7d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/ImmutableDenseMatrix.js
@@ -0,0 +1,249 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createImmutableDenseMatrixClass = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _object = require("../../utils/object.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ImmutableDenseMatrix';
+var dependencies = ['smaller', 'DenseMatrix'];
+var createImmutableDenseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var smaller = _ref.smaller,
+      DenseMatrix = _ref.DenseMatrix;
+
+  function ImmutableDenseMatrix(data, datatype) {
+    if (!(this instanceof ImmutableDenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (datatype && !(0, _is.isString)(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+
+    if ((0, _is.isMatrix)(data) || (0, _is.isArray)(data)) {
+      // use DenseMatrix implementation
+      var matrix = new DenseMatrix(data, datatype); // internal structures
+
+      this._data = matrix._data;
+      this._size = matrix._size;
+      this._datatype = matrix._datatype;
+      this._min = null;
+      this._max = null;
+    } else if (data && (0, _is.isArray)(data.data) && (0, _is.isArray)(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size;
+      this._datatype = data.datatype;
+      this._min = typeof data.min !== 'undefined' ? data.min : null;
+      this._max = typeof data.max !== 'undefined' ? data.max : null;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + (0, _is.typeOf)(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+      this._min = null;
+      this._max = null;
+    }
+  }
+
+  ImmutableDenseMatrix.prototype = new DenseMatrix();
+  /**
+   * Attach type information
+   */
+
+  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';
+  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | ImmutableDenseMatrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+  ImmutableDenseMatrix.prototype.subset = function (index) {
+    switch (arguments.length) {
+      case 1:
+        {
+          // use base implementation
+          var m = DenseMatrix.prototype.subset.call(this, index); // check result is a matrix
+
+          if ((0, _is.isMatrix)(m)) {
+            // return immutable matrix
+            return new ImmutableDenseMatrix({
+              data: m._data,
+              size: m._size,
+              datatype: m._datatype
+            });
+          }
+
+          return m;
+        }
+      // intentional fall through
+
+      case 2:
+      case 3:
+        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');
+
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @param {Number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {ImmutableDenseMatrix} self
+   */
+
+
+  ImmutableDenseMatrix.prototype.set = function () {
+    throw new Error('Cannot invoke set on an Immutable Matrix instance');
+  };
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {Number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  ImmutableDenseMatrix.prototype.resize = function () {
+    throw new Error('Cannot invoke resize on an Immutable Matrix instance');
+  };
+  /**
+   * Disallows reshaping in favor of immutability.
+   *
+   * @throws {Error} Operation not allowed
+   */
+
+
+  ImmutableDenseMatrix.prototype.reshape = function () {
+    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');
+  };
+  /**
+   * Create a clone of the matrix
+   * @return {ImmutableDenseMatrix} clone
+   */
+
+
+  ImmutableDenseMatrix.prototype.clone = function () {
+    return new ImmutableDenseMatrix({
+      data: (0, _object.clone)(this._data),
+      size: (0, _object.clone)(this._size),
+      datatype: this._datatype
+    });
+  };
+  /**
+   * Get a JSON representation of the matrix
+   * @returns {Object}
+   */
+
+
+  ImmutableDenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'ImmutableDenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+  /**
+   * Generate a matrix from a JSON object
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ImmutableDenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {ImmutableDenseMatrix}
+   */
+
+
+  ImmutableDenseMatrix.fromJSON = function (json) {
+    return new ImmutableDenseMatrix(json);
+  };
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @param {Number} i       Matrix row index 1
+   * @param {Number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+
+
+  ImmutableDenseMatrix.prototype.swapRows = function () {
+    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');
+  };
+  /**
+   * Calculate the minimum value in the set
+   * @return {Number | undefined} min
+   */
+
+
+  ImmutableDenseMatrix.prototype.min = function () {
+    // check min has been calculated before
+    if (this._min === null) {
+      // minimum
+      var m = null; // compute min
+
+      this.forEach(function (v) {
+        if (m === null || smaller(v, m)) {
+          m = v;
+        }
+      });
+      this._min = m !== null ? m : undefined;
+    }
+
+    return this._min;
+  };
+  /**
+   * Calculate the maximum value in the set
+   * @return {Number | undefined} max
+   */
+
+
+  ImmutableDenseMatrix.prototype.max = function () {
+    // check max has been calculated before
+    if (this._max === null) {
+      // maximum
+      var m = null; // compute max
+
+      this.forEach(function (v) {
+        if (m === null || smaller(m, v)) {
+          m = v;
+        }
+      });
+      this._max = m !== null ? m : undefined;
+    }
+
+    return this._max;
+  };
+
+  return ImmutableDenseMatrix;
+}, {
+  isClass: true
+});
+exports.createImmutableDenseMatrixClass = createImmutableDenseMatrixClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/Matrix.js b/node_modules/mathjs/lib/cjs/type/matrix/Matrix.js
new file mode 100644
index 0000000..bd92c7a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/Matrix.js
@@ -0,0 +1,269 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixClass = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'Matrix';
+var dependencies = [];
+var createMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {
+  /**
+   * @constructor Matrix
+   *
+   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional
+   * array. A matrix can be constructed as:
+   *
+   *     let matrix = math.matrix(data)
+   *
+   * Matrix contains the functions to resize, get and set values, get the size,
+   * clone the matrix and to convert the matrix to a vector, array, or scalar.
+   * Furthermore, one can iterate over the matrix using map and forEach.
+   * The internal Array of the Matrix can be accessed using the function valueOf.
+   *
+   * Example usage:
+   *
+   *     let matrix = math.matrix([[1, 2], [3, 4]])
+   *     matix.size()              // [2, 2]
+   *     matrix.resize([3, 2], 5)
+   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]
+   *     matrix.subset([1,2])       // 3 (indexes are zero-based)
+   *
+   */
+  function Matrix() {
+    if (!(this instanceof Matrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Matrix.prototype.type = 'Matrix';
+  Matrix.prototype.isMatrix = true;
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @return {string}           The storage format.
+   */
+
+  Matrix.prototype.storage = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke storage on a Matrix interface');
+  };
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @return {string}           The datatype.
+   */
+
+
+  Matrix.prototype.datatype = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke datatype on a Matrix interface');
+  };
+  /**
+   * Create a new Matrix With the type of the current matrix instance
+   * @param {Array | Object} data
+   * @param {string} [datatype]
+   */
+
+
+  Matrix.prototype.create = function (data, datatype) {
+    throw new Error('Cannot invoke create on a Matrix interface');
+  };
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+
+  Matrix.prototype.subset = function (index, replacement, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke subset on a Matrix interface');
+  };
+  /**
+   * Get a single element from the matrix.
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+
+
+  Matrix.prototype.get = function (index) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke get on a Matrix interface');
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {Matrix} self
+   */
+
+
+  Matrix.prototype.set = function (index, value, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke set on a Matrix interface');
+  };
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  Matrix.prototype.resize = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke resize on a Matrix interface');
+  };
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+
+
+  Matrix.prototype.reshape = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke reshape on a Matrix interface');
+  };
+  /**
+   * Create a clone of the matrix
+   * @return {Matrix} clone
+   */
+
+
+  Matrix.prototype.clone = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke clone on a Matrix interface');
+  };
+  /**
+   * Retrieve the size of the matrix.
+   * @returns {number[]} size
+   */
+
+
+  Matrix.prototype.size = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke size on a Matrix interface');
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {Matrix} matrix
+   */
+
+
+  Matrix.prototype.map = function (callback, skipZeros) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke map on a Matrix interface');
+  };
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   */
+
+
+  Matrix.prototype.forEach = function (callback) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke forEach on a Matrix interface');
+  };
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+
+
+  Matrix.prototype[Symbol.iterator] = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot iterate a Matrix interface');
+  };
+  /**
+   * Create an Array with a copy of the data of the Matrix
+   * @returns {Array} array
+   */
+
+
+  Matrix.prototype.toArray = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toArray on a Matrix interface');
+  };
+  /**
+   * Get the primitive value of the Matrix: a multidimensional array
+   * @returns {Array} array
+   */
+
+
+  Matrix.prototype.valueOf = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke valueOf on a Matrix interface');
+  };
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  Matrix.prototype.format = function (options) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke format on a Matrix interface');
+  };
+  /**
+   * Get a string representation of the matrix
+   * @returns {string} str
+   */
+
+
+  Matrix.prototype.toString = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toString on a Matrix interface');
+  };
+
+  return Matrix;
+}, {
+  isClass: true
+});
+exports.createMatrixClass = createMatrixClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/MatrixIndex.js b/node_modules/mathjs/lib/cjs/type/matrix/MatrixIndex.js
new file mode 100644
index 0000000..a2d6ddd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/MatrixIndex.js
@@ -0,0 +1,312 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndexClass = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _object = require("../../utils/object.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'Index';
+var dependencies = ['ImmutableDenseMatrix'];
+var createIndexClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var ImmutableDenseMatrix = _ref.ImmutableDenseMatrix;
+
+  /**
+   * Create an index. An Index can store ranges and sets for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Usage:
+   *     const index = new Index(range1, range2, matrix1, array1, ...)
+   *
+   * Where each parameter can be any of:
+   *     A number
+   *     A string (containing a name of an object property)
+   *     An instance of Range
+   *     An Array with the Set values
+   *     A Matrix with the Set values
+   *
+   * The parameters start, end, and step must be integer numbers.
+   *
+   * @class Index
+   * @Constructor Index
+   * @param {...*} ranges
+   */
+  function Index(ranges) {
+    if (!(this instanceof Index)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this._dimensions = [];
+    this._isScalar = true;
+
+    for (var i = 0, ii = arguments.length; i < ii; i++) {
+      var arg = arguments[i];
+
+      if ((0, _is.isRange)(arg)) {
+        this._dimensions.push(arg);
+
+        this._isScalar = false;
+      } else if (Array.isArray(arg) || (0, _is.isMatrix)(arg)) {
+        // create matrix
+        var m = _createImmutableMatrix(arg.valueOf());
+
+        this._dimensions.push(m); // size
+
+
+        var size = m.size(); // scalar
+
+        if (size.length !== 1 || size[0] !== 1) {
+          this._isScalar = false;
+        }
+      } else if (typeof arg === 'number') {
+        this._dimensions.push(_createImmutableMatrix([arg]));
+      } else if (typeof arg === 'string') {
+        // object property (arguments.count should be 1)
+        this._dimensions.push(arg);
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');
+      } // TODO: implement support for wildcard '*'
+
+    }
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Index.prototype.type = 'Index';
+  Index.prototype.isIndex = true;
+
+  function _createImmutableMatrix(arg) {
+    // loop array elements
+    for (var i = 0, l = arg.length; i < l; i++) {
+      if (typeof arg[i] !== 'number' || !(0, _number.isInteger)(arg[i])) {
+        throw new TypeError('Index parameters must be positive integer numbers');
+      }
+    } // create matrix
+
+
+    return new ImmutableDenseMatrix(arg);
+  }
+  /**
+   * Create a clone of the index
+   * @memberof Index
+   * @return {Index} clone
+   */
+
+
+  Index.prototype.clone = function () {
+    var index = new Index();
+    index._dimensions = (0, _object.clone)(this._dimensions);
+    index._isScalar = this._isScalar;
+    return index;
+  };
+  /**
+   * Create an index from an array with ranges/numbers
+   * @memberof Index
+   * @param {Array.<Array | number>} ranges
+   * @return {Index} index
+   * @private
+   */
+
+
+  Index.create = function (ranges) {
+    var index = new Index();
+    Index.apply(index, ranges);
+    return index;
+  };
+  /**
+   * Retrieve the size of the index, the number of elements for each dimension.
+   * @memberof Index
+   * @returns {number[]} size
+   */
+
+
+  Index.prototype.size = function () {
+    var size = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var d = this._dimensions[i];
+      size[i] = typeof d === 'string' ? 1 : d.size()[0];
+    }
+
+    return size;
+  };
+  /**
+   * Get the maximum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} max
+   */
+
+
+  Index.prototype.max = function () {
+    var values = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.max();
+    }
+
+    return values;
+  };
+  /**
+   * Get the minimum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} min
+   */
+
+
+  Index.prototype.min = function () {
+    var values = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.min();
+    }
+
+    return values;
+  };
+  /**
+   * Loop over each of the ranges of the index
+   * @memberof Index
+   * @param {Function} callback   Called for each range with a Range as first
+   *                              argument, the dimension as second, and the
+   *                              index object as third.
+   */
+
+
+  Index.prototype.forEach = function (callback) {
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      callback(this._dimensions[i], i, this);
+    }
+  };
+  /**
+   * Retrieve the dimension for the given index
+   * @memberof Index
+   * @param {Number} dim                  Number of the dimension
+   * @returns {Range | null} range
+   */
+
+
+  Index.prototype.dimension = function (dim) {
+    return this._dimensions[dim] || null;
+  };
+  /**
+   * Test whether this index contains an object property
+   * @returns {boolean} Returns true if the index is an object property
+   */
+
+
+  Index.prototype.isObjectProperty = function () {
+    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';
+  };
+  /**
+   * Returns the object property name when the Index holds a single object property,
+   * else returns null
+   * @returns {string | null}
+   */
+
+
+  Index.prototype.getObjectProperty = function () {
+    return this.isObjectProperty() ? this._dimensions[0] : null;
+  };
+  /**
+   * Test whether this index contains only a single value.
+   *
+   * This is the case when the index is created with only scalar values as ranges,
+   * not for ranges resolving into a single value.
+   * @memberof Index
+   * @return {boolean} isScalar
+   */
+
+
+  Index.prototype.isScalar = function () {
+    return this._isScalar;
+  };
+  /**
+   * Expand the Index into an array.
+   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]
+   * @memberof Index
+   * @returns {Array} array
+   */
+
+
+  Index.prototype.toArray = function () {
+    var array = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var dimension = this._dimensions[i];
+      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());
+    }
+
+    return array;
+  };
+  /**
+   * Get the primitive value of the Index, a two dimensional array.
+   * Equivalent to Index.toArray().
+   * @memberof Index
+   * @returns {Array} array
+   */
+
+
+  Index.prototype.valueOf = Index.prototype.toArray;
+  /**
+   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'
+   * @memberof Index
+   * @returns {String} str
+   */
+
+  Index.prototype.toString = function () {
+    var strings = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var dimension = this._dimensions[i];
+
+      if (typeof dimension === 'string') {
+        strings.push(JSON.stringify(dimension));
+      } else {
+        strings.push(dimension.toString());
+      }
+    }
+
+    return '[' + strings.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the Index
+   * @memberof Index
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   */
+
+
+  Index.prototype.toJSON = function () {
+    return {
+      mathjs: 'Index',
+      dimensions: this._dimensions
+    };
+  };
+  /**
+   * Instantiate an Index from a JSON object
+   * @memberof Index
+   * @param {Object} json A JSON object structured as:
+   *                     `{"mathjs": "Index", "dimensions": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   * @return {Index}
+   */
+
+
+  Index.fromJSON = function (json) {
+    return Index.create(json.dimensions);
+  };
+
+  return Index;
+}, {
+  isClass: true
+});
+exports.createIndexClass = createIndexClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/Range.js b/node_modules/mathjs/lib/cjs/type/matrix/Range.js
new file mode 100644
index 0000000..a505da4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/Range.js
@@ -0,0 +1,347 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRangeClass = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _number = require("../../utils/number.js");
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'Range';
+var dependencies = [];
+var createRangeClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {
+  /**
+   * Create a range. A range has a start, step, and end, and contains functions
+   * to iterate over the range.
+   *
+   * A range can be constructed as:
+   *
+   *     const range = new Range(start, end)
+   *     const range = new Range(start, end, step)
+   *
+   * To get the result of the range:
+   *     range.forEach(function (x) {
+   *         console.log(x)
+   *     })
+   *     range.map(function (x) {
+   *         return math.sin(x)
+   *     })
+   *     range.toArray()
+   *
+   * Example usage:
+   *
+   *     const c = new Range(2, 6)       // 2:1:5
+   *     c.toArray()                     // [2, 3, 4, 5]
+   *     const d = new Range(2, -3, -1)  // 2:-1:-2
+   *     d.toArray()                     // [2, 1, 0, -1, -2]
+   *
+   * @class Range
+   * @constructor Range
+   * @param {number} start  included lower bound
+   * @param {number} end    excluded upper bound
+   * @param {number} [step] step size, default value is 1
+   */
+  function Range(start, end, step) {
+    if (!(this instanceof Range)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    var hasStart = start !== null && start !== undefined;
+    var hasEnd = end !== null && end !== undefined;
+    var hasStep = step !== null && step !== undefined;
+
+    if (hasStart) {
+      if ((0, _is.isBigNumber)(start)) {
+        start = start.toNumber();
+      } else if (typeof start !== 'number') {
+        throw new TypeError('Parameter start must be a number');
+      }
+    }
+
+    if (hasEnd) {
+      if ((0, _is.isBigNumber)(end)) {
+        end = end.toNumber();
+      } else if (typeof end !== 'number') {
+        throw new TypeError('Parameter end must be a number');
+      }
+    }
+
+    if (hasStep) {
+      if ((0, _is.isBigNumber)(step)) {
+        step = step.toNumber();
+      } else if (typeof step !== 'number') {
+        throw new TypeError('Parameter step must be a number');
+      }
+    }
+
+    this.start = hasStart ? parseFloat(start) : 0;
+    this.end = hasEnd ? parseFloat(end) : 0;
+    this.step = hasStep ? parseFloat(step) : 1;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Range.prototype.type = 'Range';
+  Range.prototype.isRange = true;
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @memberof Range
+   * @param {string} str
+   * @return {Range | null} range
+   */
+
+  Range.parse = function (str) {
+    if (typeof str !== 'string') {
+      return null;
+    }
+
+    var args = str.split(':');
+    var nums = args.map(function (arg) {
+      return parseFloat(arg);
+    });
+    var invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+
+    if (invalid) {
+      return null;
+    }
+
+    switch (nums.length) {
+      case 2:
+        return new Range(nums[0], nums[1]);
+
+      case 3:
+        return new Range(nums[0], nums[2], nums[1]);
+
+      default:
+        return null;
+    }
+  };
+  /**
+   * Create a clone of the range
+   * @return {Range} clone
+   */
+
+
+  Range.prototype.clone = function () {
+    return new Range(this.start, this.end, this.step);
+  };
+  /**
+   * Retrieve the size of the range.
+   * Returns an array containing one number, the number of elements in the range.
+   * @memberof Range
+   * @returns {number[]} size
+   */
+
+
+  Range.prototype.size = function () {
+    var len = 0;
+    var start = this.start;
+    var step = this.step;
+    var end = this.end;
+    var diff = end - start;
+
+    if ((0, _number.sign)(step) === (0, _number.sign)(diff)) {
+      len = Math.ceil(diff / step);
+    } else if (diff === 0) {
+      len = 0;
+    }
+
+    if (isNaN(len)) {
+      len = 0;
+    }
+
+    return [len];
+  };
+  /**
+   * Calculate the minimum value in the range
+   * @memberof Range
+   * @return {number | undefined} min
+   */
+
+
+  Range.prototype.min = function () {
+    var size = this.size()[0];
+
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start;
+      } else {
+        // negative step
+        return this.start + (size - 1) * this.step;
+      }
+    } else {
+      return undefined;
+    }
+  };
+  /**
+   * Calculate the maximum value in the range
+   * @memberof Range
+   * @return {number | undefined} max
+   */
+
+
+  Range.prototype.max = function () {
+    var size = this.size()[0];
+
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start + (size - 1) * this.step;
+      } else {
+        // negative step
+        return this.start;
+      }
+    } else {
+      return undefined;
+    }
+  };
+  /**
+   * Execute a callback function for each value in the range.
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Range being traversed.
+   */
+
+
+  Range.prototype.forEach = function (callback) {
+    var x = this.start;
+    var step = this.step;
+    var end = this.end;
+    var i = 0;
+
+    if (step > 0) {
+      while (x < end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    } else if (step < 0) {
+      while (x > end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    }
+  };
+  /**
+   * Execute a callback function for each value in the Range, and return the
+   * results as an array
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @returns {Array} array
+   */
+
+
+  Range.prototype.map = function (callback) {
+    var array = [];
+    this.forEach(function (value, index, obj) {
+      array[index[0]] = callback(value, index, obj);
+    });
+    return array;
+  };
+  /**
+   * Create an Array with a copy of the Ranges data
+   * @memberof Range
+   * @returns {Array} array
+   */
+
+
+  Range.prototype.toArray = function () {
+    var array = [];
+    this.forEach(function (value, index) {
+      array[index[0]] = value;
+    });
+    return array;
+  };
+  /**
+   * Get the primitive value of the Range, a one dimensional array
+   * @memberof Range
+   * @returns {Array} array
+   */
+
+
+  Range.prototype.valueOf = function () {
+    // TODO: implement a caching mechanism for range.valueOf()
+    return this.toArray();
+  };
+  /**
+   * Get a string representation of the range, with optional formatting options.
+   * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'
+   * @memberof Range
+   * @param {Object | number | function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  Range.prototype.format = function (options) {
+    var str = (0, _number.format)(this.start, options);
+
+    if (this.step !== 1) {
+      str += ':' + (0, _number.format)(this.step, options);
+    }
+
+    str += ':' + (0, _number.format)(this.end, options);
+    return str;
+  };
+  /**
+   * Get a string representation of the range.
+   * @memberof Range
+   * @returns {string}
+   */
+
+
+  Range.prototype.toString = function () {
+    return this.format();
+  };
+  /**
+   * Get a JSON representation of the range
+   * @memberof Range
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   */
+
+
+  Range.prototype.toJSON = function () {
+    return {
+      mathjs: 'Range',
+      start: this.start,
+      end: this.end,
+      step: this.step
+    };
+  };
+  /**
+   * Instantiate a Range from a JSON object
+   * @memberof Range
+   * @param {Object} json A JSON object structured as:
+   *                      `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   * @return {Range}
+   */
+
+
+  Range.fromJSON = function (json) {
+    return new Range(json.start, json.end, json.step);
+  };
+
+  return Range;
+}, {
+  isClass: true
+});
+exports.createRangeClass = createRangeClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/Spa.js b/node_modules/mathjs/lib/cjs/type/matrix/Spa.js
new file mode 100644
index 0000000..57137ae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/Spa.js
@@ -0,0 +1,161 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSpaClass = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'Spa';
+var dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];
+var createSpaClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var addScalar = _ref.addScalar,
+      equalScalar = _ref.equalScalar,
+      FibonacciHeap = _ref.FibonacciHeap;
+
+  /**
+   * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array
+   * of the vector elements and an ordered list of non-zero elements.
+   */
+  function Spa() {
+    if (!(this instanceof Spa)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // allocate vector, TODO use typed arrays
+
+
+    this._values = [];
+    this._heap = new FibonacciHeap();
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Spa.prototype.type = 'Spa';
+  Spa.prototype.isSpa = true;
+  /**
+   * Set the value for index i.
+   *
+   * @param {number} i                       The index
+   * @param {number | BigNumber | Complex}   The value at index i
+   */
+
+  Spa.prototype.set = function (i, v) {
+    // check we have a value @ i
+    if (!this._values[i]) {
+      // insert in heap
+      var node = this._heap.insert(i, v); // set the value @ i
+
+
+      this._values[i] = node;
+    } else {
+      // update the value @ i
+      this._values[i].value = v;
+    }
+  };
+
+  Spa.prototype.get = function (i) {
+    var node = this._values[i];
+
+    if (node) {
+      return node.value;
+    }
+
+    return 0;
+  };
+
+  Spa.prototype.accumulate = function (i, v) {
+    // node @ i
+    var node = this._values[i];
+
+    if (!node) {
+      // insert in heap
+      node = this._heap.insert(i, v); // initialize value
+
+      this._values[i] = node;
+    } else {
+      // accumulate value
+      node.value = addScalar(node.value, v);
+    }
+  };
+
+  Spa.prototype.forEach = function (from, to, callback) {
+    // references
+    var heap = this._heap;
+    var values = this._values; // nodes
+
+    var nodes = []; // node with minimum key, save it
+
+    var node = heap.extractMinimum();
+
+    if (node) {
+      nodes.push(node);
+    } // extract nodes from heap (ordered)
+
+
+    while (node && node.key <= to) {
+      // check it is in range
+      if (node.key >= from) {
+        // check value is not zero
+        if (!equalScalar(node.value, 0)) {
+          // invoke callback
+          callback(node.key, node.value, this);
+        }
+      } // extract next node, save it
+
+
+      node = heap.extractMinimum();
+
+      if (node) {
+        nodes.push(node);
+      }
+    } // reinsert all nodes in heap
+
+
+    for (var i = 0; i < nodes.length; i++) {
+      // current node
+      var n = nodes[i]; // insert node in heap
+
+      node = heap.insert(n.key, n.value); // update values
+
+      values[node.key] = node;
+    }
+  };
+
+  Spa.prototype.swap = function (i, j) {
+    // node @ i and j
+    var nodei = this._values[i];
+    var nodej = this._values[j]; // check we need to insert indeces
+
+    if (!nodei && nodej) {
+      // insert in heap
+      nodei = this._heap.insert(i, nodej.value); // remove from heap
+
+      this._heap.remove(nodej); // set values
+
+
+      this._values[i] = nodei;
+      this._values[j] = undefined;
+    } else if (nodei && !nodej) {
+      // insert in heap
+      nodej = this._heap.insert(j, nodei.value); // remove from heap
+
+      this._heap.remove(nodei); // set values
+
+
+      this._values[j] = nodej;
+      this._values[i] = undefined;
+    } else if (nodei && nodej) {
+      // swap values
+      var v = nodei.value;
+      nodei.value = nodej.value;
+      nodej.value = v;
+    }
+  };
+
+  return Spa;
+}, {
+  isClass: true
+});
+exports.createSpaClass = createSpaClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/SparseMatrix.js b/node_modules/mathjs/lib/cjs/type/matrix/SparseMatrix.js
new file mode 100644
index 0000000..6320301
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/SparseMatrix.js
@@ -0,0 +1,1629 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSparseMatrixClass = void 0;
+
+var _regenerator = _interopRequireDefault(require("@babel/runtime/regenerator"));
+
+var _is = require("../../utils/is.js");
+
+var _number = require("../../utils/number.js");
+
+var _string = require("../../utils/string.js");
+
+var _object = require("../../utils/object.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _DimensionError = require("../../error/DimensionError.js");
+
+var name = 'SparseMatrix';
+var dependencies = ['typed', 'equalScalar', 'Matrix'];
+var createSparseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar,
+      Matrix = _ref.Matrix;
+
+  /**
+   * Sparse Matrix implementation. This type implements
+   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))
+   * format for two-dimensional sparse matrices.
+   * @class SparseMatrix
+   */
+  function SparseMatrix(data, datatype) {
+    if (!(this instanceof SparseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (datatype && !(0, _is.isString)(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+
+    if ((0, _is.isMatrix)(data)) {
+      // create from matrix
+      _createFromMatrix(this, data, datatype);
+    } else if (data && (0, _is.isArray)(data.index) && (0, _is.isArray)(data.ptr) && (0, _is.isArray)(data.size)) {
+      // initialize fields
+      this._values = data.values;
+      this._index = data.index;
+      this._ptr = data.ptr;
+      this._size = data.size;
+      this._datatype = datatype || data.datatype;
+    } else if ((0, _is.isArray)(data)) {
+      // create from array
+      _createFromArray(this, data, datatype);
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + (0, _is.typeOf)(data) + ')');
+    } else {
+      // nothing provided
+      this._values = [];
+      this._index = [];
+      this._ptr = [0];
+      this._size = [0, 0];
+      this._datatype = datatype;
+    }
+  }
+
+  function _createFromMatrix(matrix, source, datatype) {
+    // check matrix type
+    if (source.type === 'SparseMatrix') {
+      // clone arrays
+      matrix._values = source._values ? (0, _object.clone)(source._values) : undefined;
+      matrix._index = (0, _object.clone)(source._index);
+      matrix._ptr = (0, _object.clone)(source._ptr);
+      matrix._size = (0, _object.clone)(source._size);
+      matrix._datatype = datatype || source._datatype;
+    } else {
+      // build from matrix data
+      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);
+    }
+  }
+
+  function _createFromArray(matrix, data, datatype) {
+    // initialize fields
+    matrix._values = [];
+    matrix._index = [];
+    matrix._ptr = [];
+    matrix._datatype = datatype; // discover rows & columns, do not use math.size() to avoid looping array twice
+
+    var rows = data.length;
+    var columns = 0; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if ((0, _is.isString)(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, datatype);
+    } // check we have rows (empty array)
+
+
+    if (rows > 0) {
+      // column index
+      var j = 0;
+
+      do {
+        // store pointer to values index
+        matrix._ptr.push(matrix._index.length); // loop rows
+
+
+        for (var i = 0; i < rows; i++) {
+          // current row
+          var row = data[i]; // check row is an array
+
+          if ((0, _is.isArray)(row)) {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < row.length) {
+              columns = row.length;
+            } // check row has column
+
+
+            if (j < row.length) {
+              // value
+              var v = row[j]; // check value != 0
+
+              if (!eq(v, zero)) {
+                // store value
+                matrix._values.push(v); // index
+
+
+                matrix._index.push(i);
+              }
+            }
+          } else {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < 1) {
+              columns = 1;
+            } // check value != 0 (row is a scalar)
+
+
+            if (!eq(row, zero)) {
+              // store value
+              matrix._values.push(row); // index
+
+
+              matrix._index.push(i);
+            }
+          }
+        } // increment index
+
+
+        j++;
+      } while (j < columns);
+    } // store number of values in ptr
+
+
+    matrix._ptr.push(matrix._index.length); // size
+
+
+    matrix._size = [rows, columns];
+  }
+
+  SparseMatrix.prototype = new Matrix();
+  /**
+   * Create a new SparseMatrix
+   */
+
+  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+  /**
+   * Attach type information
+   */
+
+
+  SparseMatrix.prototype.type = 'SparseMatrix';
+  SparseMatrix.prototype.isSparseMatrix = true;
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf SparseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+
+  SparseMatrix.prototype.getDataType = function () {
+    return (0, _array.getArrayDataType)(this._values, _is.typeOf);
+  };
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The storage format.
+   */
+
+
+  SparseMatrix.prototype.storage = function () {
+    return 'sparse';
+  };
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The datatype.
+   */
+
+
+  SparseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+  /**
+   * Create a new SparseMatrix
+   * @memberof SparseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+
+
+  SparseMatrix.prototype.create = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+  /**
+   * Get the matrix density.
+   *
+   * Usage:
+   *     const density = matrix.density()                   // retrieve matrix density
+   *
+   * @memberof SparseMatrix
+   * @return {number}           The matrix density.
+   */
+
+
+  SparseMatrix.prototype.density = function () {
+    // rows & columns
+    var rows = this._size[0];
+    var columns = this._size[1]; // calculate density
+
+    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;
+  };
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof SparseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+
+  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke subset on a Pattern only matrix');
+    } // check arguments
+
+
+    switch (arguments.length) {
+      case 1:
+        return _getsubset(this, index);
+      // intentional fall through
+
+      case 2:
+      case 3:
+        return _setsubset(this, index, replacement, defaultValue);
+
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+
+  function _getsubset(matrix, idx) {
+    // check idx
+    if (!(0, _is.isIndex)(idx)) {
+      throw new TypeError('Invalid index');
+    }
+
+    var isScalar = idx.isScalar();
+
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(idx.min());
+    } // validate dimensions
+
+
+    var size = idx.size();
+
+    if (size.length !== matrix._size.length) {
+      throw new _DimensionError.DimensionError(size.length, matrix._size.length);
+    } // vars
+
+
+    var i, ii, k, kk; // validate if any of the ranges in the index is out of range
+
+    var min = idx.min();
+    var max = idx.max();
+
+    for (i = 0, ii = matrix._size.length; i < ii; i++) {
+      (0, _array.validateIndex)(min[i], matrix._size[i]);
+      (0, _array.validateIndex)(max[i], matrix._size[i]);
+    } // matrix arrays
+
+
+    var mvalues = matrix._values;
+    var mindex = matrix._index;
+    var mptr = matrix._ptr; // rows & columns dimensions for result matrix
+
+    var rows = idx.dimension(0);
+    var columns = idx.dimension(1); // workspace & permutation vector
+
+    var w = [];
+    var pv = []; // loop rows in resulting matrix
+
+    rows.forEach(function (i, r) {
+      // update permutation vector
+      pv[i] = r[0]; // mark i in workspace
+
+      w[i] = true;
+    }); // result matrix arrays
+
+    var values = mvalues ? [] : undefined;
+    var index = [];
+    var ptr = []; // loop columns in result matrix
+
+    columns.forEach(function (j) {
+      // update ptr
+      ptr.push(index.length); // loop values in column j
+
+      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {
+        // row
+        i = mindex[k]; // check row is in result matrix
+
+        if (w[i] === true) {
+          // push index
+          index.push(pv[i]); // check we need to process values
+
+          if (values) {
+            values.push(mvalues[k]);
+          }
+        }
+      }
+    }); // update ptr
+
+    ptr.push(index.length); // return matrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: size,
+      datatype: matrix._datatype
+    });
+  }
+
+  function _setsubset(matrix, index, submatrix, defaultValue) {
+    // check index
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    } // get index size and check whether the index contains a single value
+
+
+    var iSize = index.size();
+    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed
+
+    var sSize;
+
+    if ((0, _is.isMatrix)(submatrix)) {
+      // submatrix size
+      sSize = submatrix.size(); // use array representation
+
+      submatrix = submatrix.toArray();
+    } else {
+      // get submatrix size (array, scalar)
+      sSize = (0, _array.arraySize)(submatrix);
+    } // check index is a scalar
+
+
+    if (isScalar) {
+      // verify submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      } // set value
+
+
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // validate dimensions, index size must be one or two dimensions
+      if (iSize.length !== 1 && iSize.length !== 2) {
+        throw new _DimensionError.DimensionError(iSize.length, matrix._size.length, '<');
+      } // check submatrix and index have the same dimensions
+
+
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        var i = 0;
+        var outer = 0;
+
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        } // unsqueeze both outer and inner dimensions
+
+
+        submatrix = (0, _array.unsqueeze)(submatrix, iSize.length, outer, sSize);
+      } // check whether the size of the submatrix matches the index size
+
+
+      if (!(0, _object.deepStrictEqual)(iSize, sSize)) {
+        throw new _DimensionError.DimensionError(iSize, sSize, '>');
+      } // insert the sub matrix
+
+
+      if (iSize.length === 1) {
+        // if the replacement index only has 1 dimension, go trough each one and set its value
+        var range = index.dimension(0);
+        range.forEach(function (dataIndex, subIndex) {
+          (0, _array.validateIndex)(dataIndex);
+          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);
+        });
+      } else {
+        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index
+        var firstDimensionRange = index.dimension(0);
+        var secondDimensionRange = index.dimension(1);
+        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {
+          (0, _array.validateIndex)(firstDataIndex);
+          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {
+            (0, _array.validateIndex)(secondDataIndex);
+            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);
+          });
+        });
+      }
+    }
+
+    return matrix;
+  }
+  /**
+   * Get a single element from the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+
+
+  SparseMatrix.prototype.get = function (index) {
+    if (!(0, _is.isArray)(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length !== this._size.length) {
+      throw new _DimensionError.DimensionError(index.length, this._size.length);
+    } // check it is a pattern matrix
+
+
+    if (!this._values) {
+      throw new Error('Cannot invoke get on a Pattern only matrix');
+    } // row and column
+
+
+    var i = index[0];
+    var j = index[1]; // check i, j are valid
+
+    (0, _array.validateIndex)(i, this._size[0]);
+    (0, _array.validateIndex)(j, this._size[1]); // find value index
+
+    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row
+
+
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      return this._values[k];
+    }
+
+    return 0;
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} v
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be set to zero.
+   * @return {SparseMatrix} self
+   */
+
+
+  SparseMatrix.prototype.set = function (index, v, defaultValue) {
+    if (!(0, _is.isArray)(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length !== this._size.length) {
+      throw new _DimensionError.DimensionError(index.length, this._size.length);
+    } // check it is a pattern matrix
+
+
+    if (!this._values) {
+      throw new Error('Cannot invoke set on a Pattern only matrix');
+    } // row and column
+
+
+    var i = index[0];
+    var j = index[1]; // rows & columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if ((0, _is.isString)(this._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, this._datatype);
+    } // check we need to resize matrix
+
+
+    if (i > rows - 1 || j > columns - 1) {
+      // resize matrix
+      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue); // update rows & columns
+
+
+      rows = this._size[0];
+      columns = this._size[1];
+    } // check i, j are valid
+
+
+    (0, _array.validateIndex)(i, rows);
+    (0, _array.validateIndex)(j, columns); // find value index
+
+    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row
+
+
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      // check value != 0
+      if (!eq(v, zero)) {
+        // update value
+        this._values[k] = v;
+      } else {
+        // remove value from matrix
+        _remove(k, j, this._values, this._index, this._ptr);
+      }
+    } else {
+      // insert value @ (i, j)
+      _insert(k, i, j, v, this._values, this._index, this._ptr);
+    }
+
+    return this;
+  };
+
+  function _getValueIndex(i, top, bottom, index) {
+    // check row is on the bottom side
+    if (bottom - top === 0) {
+      return bottom;
+    } // loop rows [top, bottom[
+
+
+    for (var r = top; r < bottom; r++) {
+      // check we found value index
+      if (index[r] === i) {
+        return r;
+      }
+    } // we did not find row
+
+
+    return top;
+  }
+
+  function _remove(k, j, values, index, ptr) {
+    // remove value @ k
+    values.splice(k, 1);
+    index.splice(k, 1); // update pointers
+
+    for (var x = j + 1; x < ptr.length; x++) {
+      ptr[x]--;
+    }
+  }
+
+  function _insert(k, i, j, v, values, index, ptr) {
+    // insert value
+    values.splice(k, 0, v); // update row for k
+
+    index.splice(k, 0, i); // update column pointers
+
+    for (var x = j + 1; x < ptr.length; x++) {
+      ptr[x]++;
+    }
+  }
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof SparseMatrix
+   * @param {number[] | Matrix} size  The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!(0, _is.isCollection)(size)) {
+      throw new TypeError('Array or Matrix expected');
+    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+
+
+    var sizeArray = size.valueOf().map(function (value) {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    });
+
+    if (sizeArray.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    } // check sizes
+
+
+    sizeArray.forEach(function (value) {
+      if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value < 0) {
+        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(sizeArray) + ')');
+      }
+    }); // matrix to resize
+
+    var m = copy ? this.clone() : this; // resize matrix
+
+    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);
+  };
+
+  function _resize(matrix, rows, columns, defaultValue) {
+    // value to insert at the time of growing matrix
+    var value = defaultValue || 0; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if ((0, _is.isString)(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, matrix._datatype); // convert value to the same datatype
+
+      value = typed.convert(value, matrix._datatype);
+    } // should we insert the value?
+
+
+    var ins = !eq(value, zero); // old columns and rows
+
+    var r = matrix._size[0];
+    var c = matrix._size[1];
+    var i, j, k; // check we need to increase columns
+
+    if (columns > c) {
+      // loop new columns
+      for (j = c; j < columns; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._values.length; // check we need to insert matrix._values
+
+        if (ins) {
+          // loop rows
+          for (i = 0; i < r; i++) {
+            // add new matrix._values
+            matrix._values.push(value); // update matrix._index
+
+
+            matrix._index.push(i);
+          }
+        }
+      } // store number of matrix._values in matrix._ptr
+
+
+      matrix._ptr[columns] = matrix._values.length;
+    } else if (columns < c) {
+      // truncate matrix._ptr
+      matrix._ptr.splice(columns + 1, c - columns); // truncate matrix._values and matrix._index
+
+
+      matrix._values.splice(matrix._ptr[columns], matrix._values.length);
+
+      matrix._index.splice(matrix._ptr[columns], matrix._index.length);
+    } // update columns
+
+
+    c = columns; // check we need to increase rows
+
+    if (rows > r) {
+      // check we have to insert values
+      if (ins) {
+        // inserts
+        var n = 0; // loop columns
+
+        for (j = 0; j < c; j++) {
+          // update matrix._ptr for current column
+          matrix._ptr[j] = matrix._ptr[j] + n; // where to insert matrix._values
+
+          k = matrix._ptr[j + 1] + n; // pointer
+
+          var p = 0; // loop new rows, initialize pointer
+
+          for (i = r; i < rows; i++, p++) {
+            // add value
+            matrix._values.splice(k + p, 0, value); // update matrix._index
+
+
+            matrix._index.splice(k + p, 0, i); // increment inserts
+
+
+            n++;
+          }
+        } // store number of matrix._values in matrix._ptr
+
+
+        matrix._ptr[c] = matrix._values.length;
+      }
+    } else if (rows < r) {
+      // deletes
+      var d = 0; // loop columns
+
+      for (j = 0; j < c; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._ptr[j] - d; // where matrix._values start for next column
+
+        var k0 = matrix._ptr[j];
+        var k1 = matrix._ptr[j + 1] - d; // loop matrix._index
+
+        for (k = k0; k < k1; k++) {
+          // row
+          i = matrix._index[k]; // check we need to delete value and matrix._index
+
+          if (i > rows - 1) {
+            // remove value
+            matrix._values.splice(k, 1); // remove item from matrix._index
+
+
+            matrix._index.splice(k, 1); // increase deletes
+
+
+            d++;
+          }
+        }
+      } // update matrix._ptr for current column
+
+
+      matrix._ptr[j] = matrix._values.length;
+    } // update matrix._size
+
+
+    matrix._size[0] = rows;
+    matrix._size[1] = columns; // return matrix
+
+    return matrix;
+  }
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof SparseMatrix
+   * @param {number[]} sizes          The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+
+
+  SparseMatrix.prototype.reshape = function (sizes, copy) {
+    // validate arguments
+    if (!(0, _is.isArray)(sizes)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (sizes.length !== 2) {
+      throw new Error('Sparse matrices can only be reshaped in two dimensions');
+    } // check sizes
+
+
+    sizes.forEach(function (value) {
+      if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value <= -2 || value === 0) {
+        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + (0, _string.format)(sizes) + ')');
+      }
+    });
+    var currentLength = this._size[0] * this._size[1];
+    sizes = (0, _array.processSizesWildcard)(sizes, currentLength);
+    var newLength = sizes[0] * sizes[1]; // m * n must not change
+
+    if (currentLength !== newLength) {
+      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');
+    } // matrix to reshape
+
+
+    var m = copy ? this.clone() : this; // return unchanged if the same shape
+
+    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {
+      return m;
+    } // Convert to COO format (generate a column index)
+
+
+    var colIndex = [];
+
+    for (var i = 0; i < m._ptr.length; i++) {
+      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {
+        colIndex.push(i);
+      }
+    } // Clone the values array
+
+
+    var values = m._values.slice(); // Clone the row index array
+
+
+    var rowIndex = m._index.slice(); // Transform the (row, column) indices
+
+
+    for (var _i = 0; _i < m._index.length; _i++) {
+      var r1 = rowIndex[_i];
+      var c1 = colIndex[_i];
+      var flat = r1 * m._size[1] + c1;
+      colIndex[_i] = flat % sizes[1];
+      rowIndex[_i] = Math.floor(flat / sizes[1]);
+    } // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored
+    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,
+    // sorting several arrays based on some other array.
+    // OR, we could easily just:
+    // 1. Remove all values from the matrix
+
+
+    m._values.length = 0;
+    m._index.length = 0;
+    m._ptr.length = sizes[1] + 1;
+    m._size = sizes.slice();
+
+    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {
+      m._ptr[_i2] = 0;
+    } // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)
+    // This step is probably the most time-consuming
+
+
+    for (var h = 0; h < values.length; h++) {
+      var _i3 = rowIndex[h];
+      var _j = colIndex[h];
+      var v = values[h];
+
+      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);
+
+      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);
+    } // The value indices are inserted out of order, but apparently that's... still OK?
+
+
+    return m;
+  };
+  /**
+   * Create a clone of the matrix
+   * @memberof SparseMatrix
+   * @return {SparseMatrix} clone
+   */
+
+
+  SparseMatrix.prototype.clone = function () {
+    var m = new SparseMatrix({
+      values: this._values ? (0, _object.clone)(this._values) : undefined,
+      index: (0, _object.clone)(this._index),
+      ptr: (0, _object.clone)(this._ptr),
+      size: (0, _object.clone)(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof SparseMatrix
+   * @returns {number[]} size
+   */
+
+
+  SparseMatrix.prototype.size = function () {
+    return this._size.slice(0); // copy the Array
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {SparseMatrix} matrix
+   */
+
+
+  SparseMatrix.prototype.map = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke map on a Pattern only matrix');
+    } // matrix instance
+
+
+    var me = this; // rows and columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // invoke callback
+
+    var invoke = function invoke(v, i, j) {
+      // invoke callback
+      return callback(v, [i, j], me);
+    }; // invoke _map
+
+
+    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on the interval
+   * [minRow..maxRow, minColumn..maxColumn].
+   */
+
+
+  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {
+    // result arrays
+    var values = [];
+    var index = [];
+    var ptr = []; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if ((0, _is.isString)(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, matrix._datatype);
+    } // invoke callback
+
+
+    var invoke = function invoke(v, x, y) {
+      // invoke callback
+      v = callback(v, x, y); // check value != 0
+
+      if (!eq(v, zero)) {
+        // store value
+        values.push(v); // index
+
+        index.push(x);
+      }
+    }; // loop columns
+
+
+    for (var j = minColumn; j <= maxColumn; j++) {
+      // store pointer to values index
+      ptr.push(values.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+
+      var k0 = matrix._ptr[j];
+      var k1 = matrix._ptr[j + 1];
+
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (var k = k0; k < k1; k++) {
+          // row index
+          var i = matrix._index[k]; // check i is in range
+
+          if (i >= minRow && i <= maxRow) {
+            // value @ k
+            invoke(matrix._values[k], i - minRow, j - minColumn);
+          }
+        }
+      } else {
+        // create a cache holding all defined values
+        var _values = {};
+
+        for (var _k = k0; _k < k1; _k++) {
+          var _i4 = matrix._index[_k];
+          _values[_i4] = matrix._values[_k];
+        } // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+
+
+        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {
+          var value = _i5 in _values ? _values[_i5] : 0;
+          invoke(value, _i5 - minRow, j - minColumn);
+        }
+      }
+    } // store number of values in ptr
+
+
+    ptr.push(values.length); // return sparse matrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]
+    });
+  }
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *                              If false, the indices are guaranteed to be in order,
+   *                              if true, the indices can be unordered.
+   */
+
+
+  SparseMatrix.prototype.forEach = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke forEach on a Pattern only matrix');
+    } // matrix instance
+
+
+    var me = this; // rows and columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1];
+
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (var k = k0; k < k1; k++) {
+          // row index
+          var i = this._index[k]; // value @ k
+
+          callback(this._values[k], [i, j], me);
+        }
+      } else {
+        // create a cache holding all defined values
+        var values = {};
+
+        for (var _k2 = k0; _k2 < k1; _k2++) {
+          var _i6 = this._index[_k2];
+          values[_i6] = this._values[_k2];
+        } // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+
+
+        for (var _i7 = 0; _i7 < rows; _i7++) {
+          var value = _i7 in values ? values[_i7] : 0;
+          callback(value, [_i7, j], me);
+        }
+      }
+    }
+  };
+  /**
+   * Iterate over the matrix elements, skipping zeros
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+
+
+  SparseMatrix.prototype[Symbol.iterator] = /*#__PURE__*/_regenerator.default.mark(function _callee() {
+    var columns, j, k0, k1, k, i;
+    return _regenerator.default.wrap(function _callee$(_context) {
+      while (1) {
+        switch (_context.prev = _context.next) {
+          case 0:
+            if (this._values) {
+              _context.next = 2;
+              break;
+            }
+
+            throw new Error('Cannot iterate a Pattern only matrix');
+
+          case 2:
+            columns = this._size[1];
+            j = 0;
+
+          case 4:
+            if (!(j < columns)) {
+              _context.next = 18;
+              break;
+            }
+
+            k0 = this._ptr[j];
+            k1 = this._ptr[j + 1];
+            k = k0;
+
+          case 8:
+            if (!(k < k1)) {
+              _context.next = 15;
+              break;
+            }
+
+            // row index
+            i = this._index[k];
+            _context.next = 12;
+            return {
+              value: this._values[k],
+              index: [i, j]
+            };
+
+          case 12:
+            k++;
+            _context.next = 8;
+            break;
+
+          case 15:
+            j++;
+            _context.next = 4;
+            break;
+
+          case 18:
+          case "end":
+            return _context.stop();
+        }
+      }
+    }, _callee, this);
+  });
+  /**
+   * Create an Array with a copy of the data of the SparseMatrix
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+
+  SparseMatrix.prototype.toArray = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, true);
+  };
+  /**
+   * Get the primitive value of the SparseMatrix: a two dimensions array
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+
+
+  SparseMatrix.prototype.valueOf = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, false);
+  };
+
+  function _toArray(values, index, ptr, size, copy) {
+    // rows and columns
+    var rows = size[0];
+    var columns = size[1]; // result
+
+    var a = []; // vars
+
+    var i, j; // initialize array
+
+    for (i = 0; i < rows; i++) {
+      a[i] = [];
+
+      for (j = 0; j < columns; j++) {
+        a[i][j] = 0;
+      }
+    } // loop columns
+
+
+    for (j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1]; // loop k within [k0, k1[
+
+      for (var k = k0; k < k1; k++) {
+        // row index
+        i = index[k]; // set value (use one for pattern matrix)
+
+        a[i][j] = values ? copy ? (0, _object.clone)(values[k]) : values[k] : 1;
+      }
+    }
+
+    return a;
+  }
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof SparseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  SparseMatrix.prototype.format = function (options) {
+    // rows and columns
+    var rows = this._size[0];
+    var columns = this._size[1]; // density
+
+    var density = this.density(); // rows & columns
+
+    var str = 'Sparse Matrix [' + (0, _string.format)(rows, options) + ' x ' + (0, _string.format)(columns, options) + '] density: ' + (0, _string.format)(density, options) + '\n'; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1]; // loop k within [k0, k1[
+
+      for (var k = k0; k < k1; k++) {
+        // row index
+        var i = this._index[k]; // append value
+
+        str += '\n    (' + (0, _string.format)(i, options) + ', ' + (0, _string.format)(j, options) + ') ==> ' + (this._values ? (0, _string.format)(this._values[k], options) : 'X');
+      }
+    }
+
+    return str;
+  };
+  /**
+   * Get a string representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {string} str
+   */
+
+
+  SparseMatrix.prototype.toString = function () {
+    return (0, _string.format)(this.toArray());
+  };
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {Object}
+   */
+
+
+  SparseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'SparseMatrix',
+      values: this._values,
+      index: this._index,
+      ptr: this._ptr,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof SparseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix vector with the diagonal values.
+   */
+
+
+  SparseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows & columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // number diagonal values
+
+    var n = Math.min(rows - kSub, columns - kSuper); // diagonal arrays
+
+    var values = [];
+    var index = [];
+    var ptr = []; // initial ptr value
+
+    ptr[0] = 0; // loop columns
+
+    for (var j = kSuper; j < columns && values.length < n; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1]; // loop x within [k0, k1[
+
+      for (var x = k0; x < k1; x++) {
+        // row index
+        var i = this._index[x]; // check row
+
+        if (i === j - kSuper + kSub) {
+          // value on this column
+          values.push(this._values[x]); // store row
+
+          index[values.length - 1] = i - kSub; // exit loop
+
+          break;
+        }
+      }
+    } // close ptr
+
+
+    ptr.push(values.length); // return matrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: [n, 1]
+    });
+  };
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof SparseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SparseMatrix", "values": [], "index": [], "ptr": [], "size": []}`,
+   *                       where mathjs is optional
+   * @returns {SparseMatrix}
+   */
+
+
+  SparseMatrix.fromJSON = function (json) {
+    return new SparseMatrix(json);
+  };
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {Array} size                       The matrix size.
+   * @param {number | Array | Matrix } value   The values for the diagonal.
+   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]            The default value for non-diagonal
+   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.
+   *
+   * @returns {SparseMatrix}
+   */
+
+
+  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {
+    if (!(0, _is.isArray)(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    } // map size & validate
+
+
+    size = size.map(function (s) {
+      // check it is a big number
+      if ((0, _is.isBigNumber)(s)) {
+        // convert it
+        s = s.toNumber();
+      } // validate arguments
+
+
+      if (!(0, _is.isNumber)(s) || !(0, _number.isInteger)(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+
+      return s;
+    }); // validate k if any
+
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    } // equal signature to use
+
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if ((0, _is.isString)(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, datatype);
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows and columns
+
+    var rows = size[0];
+    var columns = size[1]; // number of non-zero items
+
+    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function
+
+    var _value; // check value
+
+
+    if ((0, _is.isArray)(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if ((0, _is.isMatrix)(value)) {
+      // matrix size
+      var ms = value.size(); // validate matrix
+
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function _value() {
+        // return value
+        return value;
+      };
+    } // create arrays
+
+
+    var values = [];
+    var index = [];
+    var ptr = []; // loop items
+
+    for (var j = 0; j < columns; j++) {
+      // number of rows with value
+      ptr.push(values.length); // diagonal index
+
+      var i = j - kSuper; // check we need to set diagonal value
+
+      if (i >= 0 && i < n) {
+        // get value @ i
+        var v = _value(i); // check for zero
+
+
+        if (!eq(v, zero)) {
+          // column
+          index.push(i + kSub); // add value
+
+          values.push(v);
+        }
+      }
+    } // last value should be number of values
+
+
+    ptr.push(values.length); // create SparseMatrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: [rows, columns]
+    });
+  };
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+
+
+  SparseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!(0, _is.isNumber)(i) || !(0, _number.isInteger)(i) || !(0, _is.isNumber)(j) || !(0, _number.isInteger)(j)) {
+      throw new Error('Row index must be positive integers');
+    } // check dimensions
+
+
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    } // validate index
+
+
+    (0, _array.validateIndex)(i, this._size[0]);
+    (0, _array.validateIndex)(j, this._size[0]); // swap rows
+
+    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); // return current instance
+
+
+    return this;
+  };
+  /**
+   * Loop rows with data in column j.
+   *
+   * @param {number} j            Column
+   * @param {Array} values        Matrix values
+   * @param {Array} index         Matrix row indeces
+   * @param {Array} ptr           Matrix column pointers
+   * @param {Function} callback   Callback function invoked for every row in column j
+   */
+
+
+  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {
+    // indeces for column j
+    var k0 = ptr[j];
+    var k1 = ptr[j + 1]; // loop
+
+    for (var k = k0; k < k1; k++) {
+      // invoke callback
+      callback(index[k], values[k]);
+    }
+  };
+  /**
+   * Swap rows x and y in Sparse Matrix data structures.
+   *
+   * @param {number} x         Matrix row index 1
+   * @param {number} y         Matrix row index 2
+   * @param {number} columns   Number of columns in matrix
+   * @param {Array} values     Matrix values
+   * @param {Array} index      Matrix row indeces
+   * @param {Array} ptr        Matrix column pointers
+   */
+
+
+  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1]; // find value index @ x
+
+      var kx = _getValueIndex(x, k0, k1, index); // find value index @ x
+
+
+      var ky = _getValueIndex(y, k0, k1, index); // check both rows exist in matrix
+
+
+      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {
+        // swap values (check for pattern matrix)
+        if (values) {
+          var v = values[kx];
+          values[kx] = values[ky];
+          values[ky] = v;
+        } // next column
+
+
+        continue;
+      } // check x row exist & no y row
+
+
+      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {
+        // value @ x (check for pattern matrix)
+        var vx = values ? values[kx] : undefined; // insert value @ y
+
+        index.splice(ky, 0, y);
+
+        if (values) {
+          values.splice(ky, 0, vx);
+        } // remove value @ x (adjust array index if needed)
+
+
+        index.splice(ky <= kx ? kx + 1 : kx, 1);
+
+        if (values) {
+          values.splice(ky <= kx ? kx + 1 : kx, 1);
+        } // next column
+
+
+        continue;
+      } // check y row exist & no x row
+
+
+      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {
+        // value @ y (check for pattern matrix)
+        var vy = values ? values[ky] : undefined; // insert value @ x
+
+        index.splice(kx, 0, x);
+
+        if (values) {
+          values.splice(kx, 0, vy);
+        } // remove value @ y (adjust array index if needed)
+
+
+        index.splice(kx <= ky ? ky + 1 : ky, 1);
+
+        if (values) {
+          values.splice(kx <= ky ? ky + 1 : ky, 1);
+        }
+      }
+    }
+  };
+
+  return SparseMatrix;
+}, {
+  isClass: true
+});
+exports.createSparseMatrixClass = createSparseMatrixClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/function/index.js b/node_modules/mathjs/lib/cjs/type/matrix/function/index.js
new file mode 100644
index 0000000..bd9a2d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/function/index.js
@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndex = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _is = require("../../../utils/is.js");
+
+var name = 'index';
+var dependencies = ['typed', 'Index'];
+var createIndex = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Index = _ref.Index;
+
+  /**
+   * Create an index. An Index can store ranges having start, step, and end
+   * for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Syntax:
+   *
+   *     math.index(range1, range2, ...)
+   *
+   * Where each range can be any of:
+   *
+   * - A number
+   * - A string for getting/setting an object property
+   * - An instance of `Range`
+   * - A one-dimensional Array or a Matrix with numbers
+   *
+   * Indexes must be zero-based, integer numbers.
+   *
+   * Examples:
+   *
+   *    const b = [1, 2, 3, 4, 5]
+   *    math.subset(b, math.index([1, 2, 3]))     // returns [2, 3, 4]
+   *
+   *    const a = math.matrix([[1, 2], [3, 4]])
+   *    a.subset(math.index(0, 1))             // returns 2
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, matrix, number, string, unit
+   *
+   * @param {...*} ranges   Zero or more ranges or numbers.
+   * @return {Index}        Returns the created index
+   */
+  return typed(name, {
+    '...number | string | BigNumber | Range | Array | Matrix': function numberStringBigNumberRangeArrayMatrix(args) {
+      var ranges = args.map(function (arg) {
+        if ((0, _is.isBigNumber)(arg)) {
+          return arg.toNumber(); // convert BigNumber to Number
+        } else if (Array.isArray(arg) || (0, _is.isMatrix)(arg)) {
+          return arg.map(function (elem) {
+            // convert BigNumber to Number
+            return (0, _is.isBigNumber)(elem) ? elem.toNumber() : elem;
+          });
+        } else {
+          return arg;
+        }
+      });
+      var res = new Index();
+      Index.apply(res, ranges);
+      return res;
+    }
+  });
+});
+exports.createIndex = createIndex;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/function/matrix.js b/node_modules/mathjs/lib/cjs/type/matrix/function/matrix.js
new file mode 100644
index 0000000..5830841
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/function/matrix.js
@@ -0,0 +1,92 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrix = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'matrix';
+var dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];
+var createMatrix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Matrix = _ref.Matrix,
+      DenseMatrix = _ref.DenseMatrix,
+      SparseMatrix = _ref.SparseMatrix;
+
+  /**
+   * Create a Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   * Supported storage formats are 'dense' and 'sparse'.
+   *
+   * Syntax:
+   *
+   *    math.matrix()                         // creates an empty matrix using default storage format (dense).
+   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).
+   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.
+   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.
+   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.
+   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.
+   *
+   * Examples:
+   *
+   *    let m = math.matrix([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, sparse
+   *
+   * @param {Array | Matrix} [data]    A multi dimensional array
+   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]        Type of the values
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return _create([]);
+    },
+    string: function string(format) {
+      return _create([], format);
+    },
+    'string, string': function stringString(format, datatype) {
+      return _create([], format, datatype);
+    },
+    Array: function Array(data) {
+      return _create(data);
+    },
+    Matrix: function Matrix(data) {
+      return _create(data, data.storage());
+    },
+    'Array | Matrix, string': _create,
+    'Array | Matrix, string, string': _create
+  });
+  /**
+   * Create a new Matrix with given storage format
+   * @param {Array} data
+   * @param {string} [format]
+   * @param {string} [datatype]
+   * @returns {Matrix} Returns a new Matrix
+   * @private
+   */
+
+  function _create(data, format, datatype) {
+    // get storage format constructor
+    if (format === 'dense' || format === 'default' || format === undefined) {
+      return new DenseMatrix(data, datatype);
+    }
+
+    if (format === 'sparse') {
+      return new SparseMatrix(data, datatype);
+    }
+
+    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');
+  }
+});
+exports.createMatrix = createMatrix;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/function/sparse.js b/node_modules/mathjs/lib/cjs/type/matrix/function/sparse.js
new file mode 100644
index 0000000..54c72fc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/function/sparse.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSparse = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'sparse';
+var dependencies = ['typed', 'SparseMatrix'];
+var createSparse = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      SparseMatrix = _ref.SparseMatrix;
+
+  /**
+   * Create a Sparse Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   *
+   * Syntax:
+   *
+   *    math.sparse()               // creates an empty sparse matrix.
+   *    math.sparse(data)           // creates a sparse matrix with initial data.
+   *    math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.
+   *
+   * Examples:
+   *
+   *    let m = math.sparse([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, matrix
+   *
+   * @param {Array | Matrix} [data]    A two dimensional array
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return new SparseMatrix([]);
+    },
+    string: function string(datatype) {
+      return new SparseMatrix([], datatype);
+    },
+    'Array | Matrix': function ArrayMatrix(data) {
+      return new SparseMatrix(data);
+    },
+    'Array | Matrix, string': function ArrayMatrixString(data, datatype) {
+      return new SparseMatrix(data, datatype);
+    }
+  });
+});
+exports.createSparse = createSparse;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm01.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm01.js
new file mode 100644
index 0000000..4dbe8d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm01.js
@@ -0,0 +1,117 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm01 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm01';
+var dependencies = ['typed'];
+var createAlgorithm01 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  Dij          ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype; // sparse matrix arrays
+
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // process data types
+
+    var dt = typeof adt === 'string' && adt === bdt ? adt : undefined; // callback function
+
+    var cf = dt ? typed.find(callback, [dt, dt]) : callback; // vars
+
+    var i, j; // result (DenseMatrix)
+
+    var cdata = []; // initialize c
+
+    for (i = 0; i < rows; i++) {
+      cdata[i] = [];
+    } // workspace
+
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns in b
+
+    for (j = 0; j < columns; j++) {
+      // column mark
+      var mark = j + 1; // values in column j
+
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k]; // update workspace
+
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // mark i as updated
+
+        w[i] = mark;
+      } // loop rows
+
+
+      for (i = 0; i < rows; i++) {
+        // check row is in workspace
+        if (w[i] === mark) {
+          // c[i][j] was already calculated
+          cdata[i][j] = x[i];
+        } else {
+          // item does not exist in S
+          cdata[i][j] = adata[i][j];
+        }
+      }
+    } // return dense matrix
+
+
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm01 = createAlgorithm01;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm02.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm02.js
new file mode 100644
index 0000000..f7f5bb2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm02.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm02 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm02';
+var dependencies = ['typed', 'equalScalar'];
+var createAlgorithm02 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar;
+
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm02(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype; // sparse matrix arrays
+
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result (SparseMatrix)
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // loop columns in b
+
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // values in column j
+
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = bindex[k]; // update C(i,j)
+
+        var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // check for nonzero
+
+        if (!eq(cij, zero)) {
+          // push i & v
+          cindex.push(i);
+          cvalues.push(cij);
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return sparseMatrix.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm02 = createAlgorithm02;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm03.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm03.js
new file mode 100644
index 0000000..23e3a5b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm03.js
@@ -0,0 +1,127 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm03 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm03';
+var dependencies = ['typed'];
+var createAlgorithm03 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked M*N times.
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(Dij, 0)    ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm03(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype; // sparse matrix arrays
+
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result (DenseMatrix)
+
+
+    var cdata = []; // initialize dense matrix
+
+    for (var z = 0; z < rows; z++) {
+      // initialize row
+      cdata[z] = [];
+    } // workspace
+
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns in b
+
+    for (var j = 0; j < columns; j++) {
+      // column mark
+      var mark = j + 1; // values in column j
+
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = bindex[k]; // update workspace
+
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        w[i] = mark;
+      } // process workspace
+
+
+      for (var y = 0; y < rows; y++) {
+        // check we have a calculated value for current row
+        if (w[y] === mark) {
+          // use calculated value
+          cdata[y][j] = x[y];
+        } else {
+          // calculate value
+          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);
+        }
+      }
+    } // return dense matrix
+
+
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm03 = createAlgorithm03;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm04.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm04.js
new file mode 100644
index 0000000..c305519
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm04.js
@@ -0,0 +1,184 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm04 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm04';
+var dependencies = ['typed', 'equalScalar'];
+var createAlgorithm04 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0
+   *          └  B(i,j)       ; B(i,j) !== 0
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm04(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspace
+
+    var xa = avalues && bvalues ? [] : undefined;
+    var xb = avalues && bvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var wa = [];
+    var wb = []; // vars
+
+    var i, j, k, k0, k1; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // loop A(:,j)
+
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k]; // update c
+
+        cindex.push(i); // update workspace
+
+        wa[i] = mark; // check we need to process values
+
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      } // loop B(:,j)
+
+
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k]; // check row exists in A
+
+        if (wa[i] === mark) {
+          // update record in xa @ i
+          if (xa) {
+            // invoke callback
+            var v = cf(xa[i], bvalues[k]); // check for zero
+
+            if (!eq(v, zero)) {
+              // update workspace
+              xa[i] = v;
+            } else {
+              // remove mark (index will be removed later)
+              wa[i] = null;
+            }
+          }
+        } else {
+          // update c
+          cindex.push(i); // update workspace
+
+          wb[i] = mark; // check we need to process values
+
+          if (xb) {
+            xb[i] = bvalues[k];
+          }
+        }
+      } // check we need to process values (non pattern matrix)
+
+
+      if (xa && xb) {
+        // initialize first index in j
+        k = cptr[j]; // loop index in j
+
+        while (k < cindex.length) {
+          // row
+          i = cindex[k]; // check workspace has value @ i
+
+          if (wa[i] === mark) {
+            // push value (Aij != 0 || (Aij != 0 && Bij != 0))
+            cvalues[k] = xa[i]; // increment pointer
+
+            k++;
+          } else if (wb[i] === mark) {
+            // push value (bij != 0)
+            cvalues[k] = xb[i]; // increment pointer
+
+            k++;
+          } else {
+            // remove index @ k
+            cindex.splice(k, 1);
+          }
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm04 = createAlgorithm04;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm05.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm05.js
new file mode 100644
index 0000000..085f793
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm05.js
@@ -0,0 +1,177 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm05 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm05';
+var dependencies = ['typed', 'equalScalar'];
+var createAlgorithm05 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm05(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspaces
+
+    var xa = cvalues ? [] : undefined;
+    var xb = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var wa = [];
+    var wb = []; // vars
+
+    var i, j, k, k1; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // loop values A(:,j)
+
+      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {
+        // row
+        i = aindex[k]; // push index
+
+        cindex.push(i); // update workspace
+
+        wa[i] = mark; // check we need to process values
+
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      } // loop values B(:,j)
+
+
+      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {
+        // row
+        i = bindex[k]; // check row existed in A
+
+        if (wa[i] !== mark) {
+          // push index
+          cindex.push(i);
+        } // update workspace
+
+
+        wb[i] = mark; // check we need to process values
+
+        if (xb) {
+          xb[i] = bvalues[k];
+        }
+      } // check we need to process values (non pattern matrix)
+
+
+      if (cvalues) {
+        // initialize first index in j
+        k = cptr[j]; // loop index in j
+
+        while (k < cindex.length) {
+          // row
+          i = cindex[k]; // marks
+
+          var wai = wa[i];
+          var wbi = wb[i]; // check Aij or Bij are nonzero
+
+          if (wai === mark || wbi === mark) {
+            // matrix values @ i,j
+            var va = wai === mark ? xa[i] : zero;
+            var vb = wbi === mark ? xb[i] : zero; // Cij
+
+            var vc = cf(va, vb); // check for zero
+
+            if (!eq(vc, zero)) {
+              // push value
+              cvalues.push(vc); // increment pointer
+
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          }
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm05 = createAlgorithm05;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm06.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm06.js
new file mode 100644
index 0000000..2b3f2eb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm06.js
@@ -0,0 +1,158 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm06 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var _collection = require("../../../utils/collection.js");
+
+var name = 'algorithm06';
+var dependencies = ['typed', 'equalScalar'];
+var createAlgorithm06 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm06(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspaces
+
+    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var w = []; // marks indicating value in a given row has been updated
+
+    var u = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // scatter the values of A(:,j) into workspace
+
+      (0, _collection.scatter)(a, j, w, x, u, mark, cindex, cf); // scatter the values of B(:,j) into workspace
+
+      (0, _collection.scatter)(b, j, w, x, u, mark, cindex, cf); // check we need to process values (non pattern matrix)
+
+      if (x) {
+        // initialize first index in j
+        var k = cptr[j]; // loop index in j
+
+        while (k < cindex.length) {
+          // row
+          var i = cindex[k]; // check function was invoked on current row (Aij !=0 && Bij != 0)
+
+          if (u[i] === mark) {
+            // value @ i
+            var v = x[i]; // check for zero value
+
+            if (!eq(v, zero)) {
+              // push value
+              cvalues.push(v); // increment pointer
+
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          } else {
+            // remove value @ i, do not increment pointer
+            cindex.splice(k, 1);
+          }
+        }
+      } else {
+        // initialize first index in j
+        var p = cptr[j]; // loop index in j
+
+        while (p < cindex.length) {
+          // row
+          var r = cindex[p]; // check function was invoked on current row (Aij !=0 && Bij != 0)
+
+          if (u[r] !== mark) {
+            // remove value @ i, do not increment pointer
+            cindex.splice(p, 1);
+          } else {
+            // increment pointer
+            p++;
+          }
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm06 = createAlgorithm06;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm07.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm07.js
new file mode 100644
index 0000000..02b503f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm07.js
@@ -0,0 +1,126 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm07 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm07';
+var dependencies = ['typed', 'DenseMatrix'];
+var createAlgorithm07 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j) = f(Aij, Bij)
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm07(a, b, callback) {
+    // sparse matrix arrays
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // vars
+
+
+    var i, j; // result arrays
+
+    var cdata = []; // initialize c
+
+    for (i = 0; i < rows; i++) {
+      cdata[i] = [];
+    } // workspaces
+
+
+    var xa = [];
+    var xb = []; // marks indicating we have a value in x for a given column
+
+    var wa = [];
+    var wb = []; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1; // scatter the values of A(:,j) into workspace
+
+      _scatter(a, j, wa, xa, mark); // scatter the values of B(:,j) into workspace
+
+
+      _scatter(b, j, wb, xb, mark); // loop rows
+
+
+      for (i = 0; i < rows; i++) {
+        // matrix values @ i,j
+        var va = wa[i] === mark ? xa[i] : zero;
+        var vb = wb[i] === mark ? xb[i] : zero; // invoke callback
+
+        cdata[i][j] = cf(va, vb);
+      }
+    } // return dense matrix
+
+
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+
+  function _scatter(m, j, w, x, mark) {
+    // a arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // loop values in column j
+
+    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {
+      // row
+      var i = index[k]; // update workspace
+
+      w[i] = mark;
+      x[i] = values[k];
+    }
+  }
+});
+exports.createAlgorithm07 = createAlgorithm07;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm08.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm08.js
new file mode 100644
index 0000000..9de7bd3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm08.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm08 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm08';
+var dependencies = ['typed', 'equalScalar'];
+var createAlgorithm08 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm08(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!avalues || !bvalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrices');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // workspace
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // vars
+
+    var k, k0, k1, i; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // loop values in a
+
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k]; // mark workspace
+
+        w[i] = mark; // set value
+
+        x[i] = avalues[k]; // add index
+
+        cindex.push(i);
+      } // loop values in b
+
+
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k]; // check value exists in workspace
+
+        if (w[i] === mark) {
+          // evaluate callback
+          x[i] = cf(x[i], bvalues[k]);
+        }
+      } // initialize first index in j
+
+
+      k = cptr[j]; // loop index in j
+
+      while (k < cindex.length) {
+        // row
+        i = cindex[k]; // value @ i
+
+        var v = x[i]; // check for zero value
+
+        if (!eq(v, zero)) {
+          // push value
+          cvalues.push(v); // increment pointer
+
+          k++;
+        } else {
+          // remove value @ i, do not increment pointer
+          cindex.splice(k, 1);
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm08 = createAlgorithm08;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm09.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm09.js
new file mode 100644
index 0000000..a91cdec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm09.js
@@ -0,0 +1,146 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm09 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm09';
+var dependencies = ['typed', 'equalScalar'];
+var createAlgorithm09 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar;
+
+  /**
+   * Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).
+   * Callback function invoked NZA times, number of nonzero elements in A.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm09(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspaces
+
+    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var w = []; // vars
+
+    var i, j, k, k0, k1; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // column mark
+
+      var mark = j + 1; // check we need to process values
+
+      if (x) {
+        // loop B(:,j)
+        for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+          // row
+          i = bindex[k]; // update workspace
+
+          w[i] = mark;
+          x[i] = bvalues[k];
+        }
+      } // loop A(:,j)
+
+
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k]; // check we need to process values
+
+        if (x) {
+          // b value @ i,j
+          var vb = w[i] === mark ? x[i] : zero; // invoke f
+
+          var vc = cf(avalues[k], vb); // check zero value
+
+          if (!eq(vc, zero)) {
+            // push index
+            cindex.push(i); // push value
+
+            cvalues.push(vc);
+          }
+        } else {
+          // push index
+          cindex.push(i);
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm09 = createAlgorithm09;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm10.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm10.js
new file mode 100644
index 0000000..fdc05ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm10.js
@@ -0,0 +1,110 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm10 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'algorithm10';
+var dependencies = ['typed', 'DenseMatrix'];
+var createAlgorithm10 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  b          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function algorithm10(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
+
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cdata = []; // workspaces
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1; // values in j
+
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var r = aindex[k]; // update workspace
+
+        x[r] = avalues[k];
+        w[r] = mark;
+      } // loop rows
+
+
+      for (var i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        } // check sparse matrix has a value @ i,j
+
+
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = b;
+        }
+      }
+    } // return dense matrix
+
+
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm10 = createAlgorithm10;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm11.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm11.js
new file mode 100644
index 0000000..3bcdbf7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm11.js
@@ -0,0 +1,107 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm11 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'algorithm11';
+var dependencies = ['typed', 'equalScalar'];
+var createAlgorithm11 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      equalScalar = _ref.equalScalar;
+
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function algorithm11(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
+
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // initialize ptr
+      cptr[j] = cindex.length; // values in j
+
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = aindex[k]; // invoke callback
+
+        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b); // check value is zero
+
+        if (!eq(v, zero)) {
+          // push index & value
+          cindex.push(i);
+          cvalues.push(v);
+        }
+      }
+    } // update ptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return s.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm11 = createAlgorithm11;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm12.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm12.js
new file mode 100644
index 0000000..cfc4183
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm12.js
@@ -0,0 +1,110 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm12 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'algorithm12';
+var dependencies = ['typed', 'DenseMatrix'];
+var createAlgorithm12 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      DenseMatrix = _ref.DenseMatrix;
+
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked MxN times.
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(0, b)    ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function algorithm12(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
+
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cdata = []; // workspaces
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1; // values in j
+
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var r = aindex[k]; // update workspace
+
+        x[r] = avalues[k];
+        w[r] = mark;
+      } // loop rows
+
+
+      for (var i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        } // check sparse matrix has a value @ i,j
+
+
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);
+        }
+      }
+    } // return dense matrix
+
+
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
+exports.createAlgorithm12 = createAlgorithm12;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm13.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm13.js
new file mode 100644
index 0000000..60b48d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm13.js
@@ -0,0 +1,101 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm13 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _DimensionError = require("../../../error/DimensionError.js");
+
+var name = 'algorithm13';
+var dependencies = ['typed'];
+var createAlgorithm13 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, Bij..z)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Matrix}   b                 The DenseMatrix instance (B)
+   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658
+   */
+  return function algorithm13(a, b, callback) {
+    // a arrays
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b arrays
+
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype; // c arrays
+
+    var csize = []; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    } // validate each one of the dimension sizes
+
+
+    for (var s = 0; s < asize.length; s++) {
+      // must match
+      if (asize[s] !== bsize[s]) {
+        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+      } // update dimension in c
+
+
+      csize[s] = asize[s];
+    } // datatype
+
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // populate cdata, iterate through dimensions
+
+
+    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []; // c matrix
+
+    return a.createDenseMatrix({
+      data: cdata,
+      size: csize,
+      datatype: dt
+    });
+  }; // recursive function
+
+  function _iterate(f, level, s, n, av, bv) {
+    // initialize array for this level
+    var cv = []; // check we reach the last level
+
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (var i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = f(av[i], bv[i]);
+      }
+    } else {
+      // iterate current level
+      for (var j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);
+      }
+    }
+
+    return cv;
+  }
+});
+exports.createAlgorithm13 = createAlgorithm13;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm14.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm14.js
new file mode 100644
index 0000000..04d9f32
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/algorithm14.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAlgorithm14 = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _object = require("../../../utils/object.js");
+
+var name = 'algorithm14';
+var dependencies = ['typed'];
+var createAlgorithm14 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, b)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij..z,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042
+   */
+  return function algorithm14(a, b, callback, inverse) {
+    // a arrays
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // datatype
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // populate cdata, iterate through dimensions
+
+
+    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []; // c matrix
+
+    return a.createDenseMatrix({
+      data: cdata,
+      size: (0, _object.clone)(asize),
+      datatype: dt
+    });
+  }; // recursive function
+
+  function _iterate(f, level, s, n, av, bv, inverse) {
+    // initialize array for this level
+    var cv = []; // check we reach the last level
+
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (var i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);
+      }
+    } else {
+      // iterate current level
+      for (var j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);
+      }
+    }
+
+    return cv;
+  }
+});
+exports.createAlgorithm14 = createAlgorithm14;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/number.js b/node_modules/mathjs/lib/cjs/type/number.js
new file mode 100644
index 0000000..edf6b21
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/number.js
@@ -0,0 +1,171 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNumber = void 0;
+
+var _factory = require("../utils/factory.js");
+
+var _collection = require("../utils/collection.js");
+
+var name = 'number';
+var dependencies = ['typed'];
+/**
+ * Separates the radix, integer part, and fractional part of a non decimal number string
+ * @param {string} input string to parse
+ * @returns {object} the parts of the string or null if not a valid input
+ */
+
+function getNonDecimalNumberParts(input) {
+  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/);
+
+  if (nonDecimalWithRadixMatch) {
+    var radix = {
+      '0b': 2,
+      '0o': 8,
+      '0x': 16
+    }[nonDecimalWithRadixMatch[1]];
+    var integerPart = nonDecimalWithRadixMatch[2];
+    var fractionalPart = nonDecimalWithRadixMatch[3];
+    return {
+      input: input,
+      radix: radix,
+      integerPart: integerPart,
+      fractionalPart: fractionalPart
+    };
+  } else {
+    return null;
+  }
+}
+/**
+ * Makes a number from a radix, and integer part, and a fractional part
+ * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)
+ * @returns {number} the number
+ */
+
+
+function makeNumberFromNonDecimalParts(parts) {
+  var n = parseInt(parts.integerPart, parts.radix);
+  var f = 0;
+
+  for (var i = 0; i < parts.fractionalPart.length; i++) {
+    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);
+    f += digitValue / Math.pow(parts.radix, i + 1);
+  }
+
+  var result = n + f;
+
+  if (isNaN(result)) {
+    throw new SyntaxError('String "' + parts.input + '" is no valid number');
+  }
+
+  return result;
+}
+
+var createNumber = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Create a number or convert a string, boolean, or unit to a number.
+   * When value is a matrix, all elements will be converted to number.
+   *
+   * Syntax:
+   *
+   *    math.number(value)
+   *    math.number(unit, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.number(2)                         // returns number 2
+   *    math.number('7.2')                     // returns number 7.2
+   *    math.number(true)                      // returns number 1
+   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]
+   *    math.number(math.unit('52cm'), 'm')    // returns 0.52
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, string, unit
+   *
+   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted
+   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number
+   * @return {number | Array | Matrix} The created number
+   */
+  var number = typed('number', {
+    '': function _() {
+      return 0;
+    },
+    number: function number(x) {
+      return x;
+    },
+    string: function string(x) {
+      if (x === 'NaN') return NaN;
+      var nonDecimalNumberParts = getNonDecimalNumberParts(x);
+
+      if (nonDecimalNumberParts) {
+        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);
+      }
+
+      var size = 0;
+      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+
+      if (wordSizeSuffixMatch) {
+        // x includes a size suffix like 0xffffi32, so we extract
+        // the suffix and remove it from x
+        size = Number(wordSizeSuffixMatch[2]);
+        x = wordSizeSuffixMatch[1];
+      }
+
+      var num = Number(x);
+
+      if (isNaN(num)) {
+        throw new SyntaxError('String "' + x + '" is no valid number');
+      }
+
+      if (wordSizeSuffixMatch) {
+        // x is a signed bin, oct, or hex literal
+        // num is the value of string x if x is interpreted as unsigned
+        if (num > Math.pow(2, size) - 1) {
+          // literal is too large for size suffix
+          throw new SyntaxError("String \"".concat(x, "\" is out of range"));
+        } // check if the bit at index size - 1 is set and if so do the twos complement
+
+
+        if (num >= Math.pow(2, size - 1)) {
+          num = num - Math.pow(2, size);
+        }
+      }
+
+      return num;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.toNumber();
+    },
+    Fraction: function Fraction(x) {
+      return x.valueOf();
+    },
+    Unit: function Unit(x) {
+      throw new Error('Second argument with valueless unit expected');
+    },
+    null: function _null(x) {
+      return 0;
+    },
+    'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {
+      return unit.toNumber(valuelessUnit);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  }); // reviver function to parse a JSON object like:
+  //
+  //     {"mathjs":"number","value":"2.3"}
+  //
+  // into a number 2.3
+
+  number.fromJSON = function (json) {
+    return parseFloat(json.value);
+  };
+
+  return number;
+});
+exports.createNumber = createNumber;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/resultset/ResultSet.js b/node_modules/mathjs/lib/cjs/type/resultset/ResultSet.js
new file mode 100644
index 0000000..0babc88
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/resultset/ResultSet.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createResultSet = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'ResultSet';
+var dependencies = [];
+var createResultSet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {
+  /**
+   * A ResultSet contains a list or results
+   * @class ResultSet
+   * @param {Array} entries
+   * @constructor ResultSet
+   */
+  function ResultSet(entries) {
+    if (!(this instanceof ResultSet)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.entries = entries || [];
+  }
+  /**
+   * Attach type information
+   */
+
+
+  ResultSet.prototype.type = 'ResultSet';
+  ResultSet.prototype.isResultSet = true;
+  /**
+   * Returns the array with results hold by this ResultSet
+   * @memberof ResultSet
+   * @returns {Array} entries
+   */
+
+  ResultSet.prototype.valueOf = function () {
+    return this.entries;
+  };
+  /**
+   * Returns the stringified results of the ResultSet
+   * @memberof ResultSet
+   * @returns {string} string
+   */
+
+
+  ResultSet.prototype.toString = function () {
+    return '[' + this.entries.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the ResultSet
+   * @memberof ResultSet
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "ResultSet", "entries": [...]}`
+   */
+
+
+  ResultSet.prototype.toJSON = function () {
+    return {
+      mathjs: 'ResultSet',
+      entries: this.entries
+    };
+  };
+  /**
+   * Instantiate a ResultSet from a JSON object
+   * @memberof ResultSet
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "ResultSet", "entries": [...]}`
+   * @return {ResultSet}
+   */
+
+
+  ResultSet.fromJSON = function (json) {
+    return new ResultSet(json.entries);
+  };
+
+  return ResultSet;
+}, {
+  isClass: true
+});
+exports.createResultSet = createResultSet;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/string.js b/node_modules/mathjs/lib/cjs/type/string.js
new file mode 100644
index 0000000..6281e06
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/string.js
@@ -0,0 +1,66 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createString = void 0;
+
+var _factory = require("../utils/factory.js");
+
+var _collection = require("../utils/collection.js");
+
+var _number = require("../utils/number.js");
+
+var name = 'string';
+var dependencies = ['typed'];
+var createString = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Create a string or convert any object into a string.
+   * Elements of Arrays and Matrices are processed element wise.
+   *
+   * Syntax:
+   *
+   *    math.string(value)
+   *
+   * Examples:
+   *
+   *    math.string(4.2)               // returns string '4.2'
+   *    math.string(math.complex(3, 2) // returns string '3 + 2i'
+   *
+   *    const u = math.unit(5, 'km')
+   *    math.string(u.to('m'))         // returns string '5000 m'
+   *
+   *    math.string([true, false])     // returns ['true', 'false']
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, unit
+   *
+   * @param {* | Array | Matrix | null} [value]  A value to convert to a string
+   * @return {string | Array | Matrix} The created string
+   */
+  return typed(name, {
+    '': function _() {
+      return '';
+    },
+    number: _number.format,
+    null: function _null(x) {
+      return 'null';
+    },
+    boolean: function boolean(x) {
+      return x + '';
+    },
+    string: function string(x) {
+      return x;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    },
+    any: function any(x) {
+      return String(x);
+    }
+  });
+});
+exports.createString = createString;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/Unit.js b/node_modules/mathjs/lib/cjs/type/unit/Unit.js
new file mode 100644
index 0000000..96ff8d2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/Unit.js
@@ -0,0 +1,3996 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitClass = void 0;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
+var _is = require("../../utils/is.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _function = require("../../utils/function.js");
+
+var _string = require("../../utils/string.js");
+
+var _object = require("../../utils/object.js");
+
+var _constants = require("../../utils/bignumber/constants.js");
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2.default)(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+var name = 'Unit';
+var dependencies = ['?on', 'config', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];
+var createUnitClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var on = _ref.on,
+      config = _ref.config,
+      addScalar = _ref.addScalar,
+      subtract = _ref.subtract,
+      multiplyScalar = _ref.multiplyScalar,
+      divideScalar = _ref.divideScalar,
+      pow = _ref.pow,
+      abs = _ref.abs,
+      fix = _ref.fix,
+      round = _ref.round,
+      equal = _ref.equal,
+      isNumeric = _ref.isNumeric,
+      format = _ref.format,
+      number = _ref.number,
+      Complex = _ref.Complex,
+      _BigNumber = _ref.BigNumber,
+      _Fraction = _ref.Fraction;
+  var toNumber = number;
+  /**
+   * A unit can be constructed in the following ways:
+   *
+   *     const a = new Unit(value, name)
+   *     const b = new Unit(null, name)
+   *     const c = Unit.parse(str)
+   *
+   * Example usage:
+   *
+   *     const a = new Unit(5, 'cm')               // 50 mm
+   *     const b = Unit.parse('23 kg')             // 23 kg
+   *     const c = math.in(a, new Unit(null, 'm')  // 0.05 m
+   *     const d = new Unit(9.81, "m/s^2")         // 9.81 m/s^2
+   *
+   * @class Unit
+   * @constructor Unit
+   * @param {number | BigNumber | Fraction | Complex | boolean} [value]  A value like 5.2
+   * @param {string} [name]   A unit name like "cm" or "inch", or a derived unit of the form: "u1[^ex1] [u2[^ex2] ...] [/ u3[^ex3] [u4[^ex4]]]", such as "kg m^2/s^2", where each unit appearing after the forward slash is taken to be in the denominator. "kg m^2 s^-2" is a synonym and is also acceptable. Any of the units can include a prefix.
+   */
+
+  function Unit(value, name) {
+    if (!(this instanceof Unit)) {
+      throw new Error('Constructor must be called with the new operator');
+    }
+
+    if (!(value === null || value === undefined || isNumeric(value) || (0, _is.isComplex)(value))) {
+      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');
+    }
+
+    if (name !== undefined && (typeof name !== 'string' || name === '')) {
+      throw new TypeError('Second parameter in Unit constructor must be a string');
+    }
+
+    if (name !== undefined) {
+      var u = Unit.parse(name);
+      this.units = u.units;
+      this.dimensions = u.dimensions;
+    } else {
+      this.units = [{
+        unit: UNIT_NONE,
+        prefix: PREFIXES.NONE,
+        // link to a list with supported prefixes
+        power: 0
+      }];
+      this.dimensions = [];
+
+      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+        this.dimensions[i] = 0;
+      }
+    }
+
+    this.value = value !== undefined && value !== null ? this._normalize(value) : null;
+    this.fixPrefix = false; // if true, function format will not search for the
+    // best prefix but leave it as initially provided.
+    // fixPrefix is set true by the method Unit.to
+    // The justification behind this is that if the constructor is explicitly called,
+    // the caller wishes the units to be returned exactly as he supplied.
+
+    this.skipAutomaticSimplification = true;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Unit.prototype.type = 'Unit';
+  Unit.prototype.isUnit = true; // private variables and functions for the Unit parser
+
+  var text, index, c;
+
+  function skipWhitespace() {
+    while (c === ' ' || c === '\t') {
+      next();
+    }
+  }
+
+  function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  }
+
+  function isDigit(c) {
+    return c >= '0' && c <= '9';
+  }
+
+  function next() {
+    index++;
+    c = text.charAt(index);
+  }
+
+  function revert(oldIndex) {
+    index = oldIndex;
+    c = text.charAt(index);
+  }
+
+  function parseNumber() {
+    var number = '';
+    var oldIndex = index;
+
+    if (c === '+') {
+      next();
+    } else if (c === '-') {
+      number += c;
+      next();
+    }
+
+    if (!isDigitDot(c)) {
+      // a + or - must be followed by a digit
+      revert(oldIndex);
+      return null;
+    } // get number, can have a single dot
+
+
+    if (c === '.') {
+      number += c;
+      next();
+
+      if (!isDigit(c)) {
+        // this is no legal number, it is just a dot
+        revert(oldIndex);
+        return null;
+      }
+    } else {
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+
+      if (c === '.') {
+        number += c;
+        next();
+      }
+    }
+
+    while (isDigit(c)) {
+      number += c;
+      next();
+    } // check for exponential notation like "2.3e-4" or "1.23e50"
+
+
+    if (c === 'E' || c === 'e') {
+      // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as "4exabytes"
+      var tentativeNumber = '';
+      var tentativeIndex = index;
+      tentativeNumber += c;
+      next();
+
+      if (c === '+' || c === '-') {
+        tentativeNumber += c;
+        next();
+      } // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)
+
+
+      if (!isDigit(c)) {
+        // The e or E must belong to something else, so return the number without the e or E.
+        revert(tentativeIndex);
+        return number;
+      } // We can now safely say that this is scientific notation.
+
+
+      number = number + tentativeNumber;
+
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+    }
+
+    return number;
+  }
+
+  function parseUnit() {
+    var unitName = ''; // Alphanumeric characters only; matches [a-zA-Z0-9]
+
+    while (isDigit(c) || Unit.isValidAlpha(c)) {
+      unitName += c;
+      next();
+    } // Must begin with [a-zA-Z]
+
+
+    var firstC = unitName.charAt(0);
+
+    if (Unit.isValidAlpha(firstC)) {
+      return unitName;
+    } else {
+      return null;
+    }
+  }
+
+  function parseCharacter(toFind) {
+    if (c === toFind) {
+      next();
+      return toFind;
+    } else {
+      return null;
+    }
+  }
+  /**
+   * Parse a string into a unit. The value of the unit is parsed as number,
+   * BigNumber, or Fraction depending on the math.js config setting `number`.
+   *
+   * Throws an exception if the provided string does not contain a valid unit or
+   * cannot be parsed.
+   * @memberof Unit
+   * @param {string} str        A string like "5.2 inch", "4e2 cm/s^2"
+   * @return {Unit} unit
+   */
+
+
+  Unit.parse = function (str, options) {
+    options = options || {};
+    text = str;
+    index = -1;
+    c = '';
+
+    if (typeof text !== 'string') {
+      throw new TypeError('Invalid argument in Unit.parse, string expected');
+    }
+
+    var unit = new Unit();
+    unit.units = [];
+    var powerMultiplierCurrent = 1;
+    var expectingUnit = false; // A unit should follow this pattern:
+    // [number] ...[ [*/] unit[^number] ]
+    // unit[^number] ... [ [*/] unit[^number] ]
+    // Rules:
+    // number is any floating point number.
+    // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!
+    // The string may optionally begin with a number.
+    // Each unit may optionally be followed by ^number.
+    // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:
+    //   2m^2kg/s^2
+    // it is not good form. If a unit starts with e, then it could be confused as a floating point number:
+    //   4erg
+
+    next();
+    skipWhitespace(); // Optional number at the start of the string
+
+    var valueStr = parseNumber();
+    var value = null;
+
+    if (valueStr) {
+      if (config.number === 'BigNumber') {
+        value = new _BigNumber(valueStr);
+      } else if (config.number === 'Fraction') {
+        try {
+          // not all numbers can be turned in Fractions, for example very small numbers not
+          value = new _Fraction(valueStr);
+        } catch (err) {
+          value = parseFloat(valueStr);
+        }
+      } else {
+        // number
+        value = parseFloat(valueStr);
+      }
+
+      skipWhitespace(); // Whitespace is not required here
+      // handle multiplication or division right after the value, like '1/s'
+
+      if (parseCharacter('*')) {
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      }
+    } // Stack to keep track of powerMultipliers applied to each parentheses group
+
+
+    var powerMultiplierStack = []; // Running product of all elements in powerMultiplierStack
+
+    var powerMultiplierStackProduct = 1;
+
+    while (true) {
+      skipWhitespace(); // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack
+      // A '(' will always appear directly before a unit.
+
+      while (c === '(') {
+        powerMultiplierStack.push(powerMultiplierCurrent);
+        powerMultiplierStackProduct *= powerMultiplierCurrent;
+        powerMultiplierCurrent = 1;
+        next();
+        skipWhitespace();
+      } // Is there something here?
+
+
+      var uStr = void 0;
+
+      if (c) {
+        var oldC = c;
+        uStr = parseUnit();
+
+        if (uStr === null) {
+          throw new SyntaxError('Unexpected "' + oldC + '" in "' + text + '" at index ' + index.toString());
+        }
+      } else {
+        // End of input.
+        break;
+      } // Verify the unit exists and get the prefix (if any)
+
+
+      var res = _findUnit(uStr);
+
+      if (res === null) {
+        // Unit not found.
+        throw new SyntaxError('Unit "' + uStr + '" not found.');
+      }
+
+      var power = powerMultiplierCurrent * powerMultiplierStackProduct; // Is there a "^ number"?
+
+      skipWhitespace();
+
+      if (parseCharacter('^')) {
+        skipWhitespace();
+        var p = parseNumber();
+
+        if (p === null) {
+          // No valid number found for the power!
+          throw new SyntaxError('In "' + str + '", "^" must be followed by a floating-point number');
+        }
+
+        power *= p;
+      } // Add the unit to the list
+
+
+      unit.units.push({
+        unit: res.unit,
+        prefix: res.prefix,
+        power: power
+      });
+
+      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;
+      } // Check for and consume closing parentheses, popping from the stack.
+      // A ')' will always follow a unit.
+
+
+      skipWhitespace();
+
+      while (c === ')') {
+        if (powerMultiplierStack.length === 0) {
+          throw new SyntaxError('Unmatched ")" in "' + text + '" at index ' + index.toString());
+        }
+
+        powerMultiplierStackProduct /= powerMultiplierStack.pop();
+        next();
+        skipWhitespace();
+      } // "*" and "/" should mean we are expecting something to come next.
+      // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.
+
+
+      expectingUnit = false;
+
+      if (parseCharacter('*')) {
+        // explicit multiplication
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        // division
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      } else {
+        // implicit multiplication
+        powerMultiplierCurrent = 1;
+      } // Replace the unit into the auto unit system
+
+
+      if (res.unit.base) {
+        var baseDim = res.unit.base.key;
+        UNIT_SYSTEMS.auto[baseDim] = {
+          unit: res.unit,
+          prefix: res.prefix
+        };
+      }
+    } // Has the string been entirely consumed?
+
+
+    skipWhitespace();
+
+    if (c) {
+      throw new SyntaxError('Could not parse: "' + str + '"');
+    } // Is there a trailing slash?
+
+
+    if (expectingUnit) {
+      throw new SyntaxError('Trailing characters: "' + str + '"');
+    } // Is the parentheses stack empty?
+
+
+    if (powerMultiplierStack.length !== 0) {
+      throw new SyntaxError('Unmatched "(" in "' + text + '"');
+    } // Are there any units at all?
+
+
+    if (unit.units.length === 0 && !options.allowNoUnits) {
+      throw new SyntaxError('"' + str + '" contains no units');
+    }
+
+    unit.value = value !== undefined ? unit._normalize(value) : null;
+    return unit;
+  };
+  /**
+   * create a copy of this unit
+   * @memberof Unit
+   * @return {Unit} Returns a cloned version of the unit
+   */
+
+
+  Unit.prototype.clone = function () {
+    var unit = new Unit();
+    unit.fixPrefix = this.fixPrefix;
+    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;
+    unit.value = (0, _object.clone)(this.value);
+    unit.dimensions = this.dimensions.slice(0);
+    unit.units = [];
+
+    for (var i = 0; i < this.units.length; i++) {
+      unit.units[i] = {};
+
+      for (var p in this.units[i]) {
+        if ((0, _object.hasOwnProperty)(this.units[i], p)) {
+          unit.units[i][p] = this.units[i][p];
+        }
+      }
+    }
+
+    return unit;
+  };
+  /**
+   * Return whether the unit is derived (such as m/s, or cm^2, but not N)
+   * @memberof Unit
+   * @return {boolean} True if the unit is derived
+   */
+
+
+  Unit.prototype._isDerived = function () {
+    if (this.units.length === 0) {
+      return false;
+    }
+
+    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;
+  };
+  /**
+   * Normalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number | BigNumber | Fraction | boolean} value
+   * @return {number | BigNumber | Fraction | boolean} normalized value
+   * @private
+   */
+
+
+  Unit.prototype._normalize = function (value) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+
+    var res = value;
+
+    var convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed
+
+
+    for (var i = 0; i < this.units.length; i++) {
+      var unitValue = convert(this.units[i].unit.value);
+      var unitPrefixValue = convert(this.units[i].prefix.value);
+      var unitPower = convert(this.units[i].power);
+      res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+
+    return res;
+  };
+  /**
+   * Denormalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number} value
+   * @param {number} [prefixValue]    Optional prefix value to be used (ignored if this is a derived unit)
+   * @return {number} denormalized value
+   * @private
+   */
+
+
+  Unit.prototype._denormalize = function (value, prefixValue) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+
+    var res = value;
+
+    var convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed
+
+
+    for (var i = 0; i < this.units.length; i++) {
+      var unitValue = convert(this.units[i].unit.value);
+      var unitPrefixValue = convert(this.units[i].prefix.value);
+      var unitPower = convert(this.units[i].power);
+      res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+
+    return res;
+  };
+  /**
+   * Find a unit from a string
+   * @memberof Unit
+   * @param {string} str              A string like 'cm' or 'inch'
+   * @returns {Object | null} result  When found, an object with fields unit and
+   *                                  prefix is returned. Else, null is returned.
+   * @private
+   */
+
+
+  var _findUnit = (0, _function.memoize)(function (str) {
+    // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.
+    if ((0, _object.hasOwnProperty)(UNITS, str)) {
+      var unit = UNITS[str];
+      var prefix = unit.prefixes[''];
+      return {
+        unit: unit,
+        prefix: prefix
+      };
+    }
+
+    for (var _name in UNITS) {
+      if ((0, _object.hasOwnProperty)(UNITS, _name)) {
+        if ((0, _string.endsWith)(str, _name)) {
+          var _unit = UNITS[_name];
+          var prefixLen = str.length - _name.length;
+          var prefixName = str.substring(0, prefixLen);
+
+          var _prefix = (0, _object.hasOwnProperty)(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;
+
+          if (_prefix !== undefined) {
+            // store unit, prefix, and value
+            return {
+              unit: _unit,
+              prefix: _prefix
+            };
+          }
+        }
+      }
+    }
+
+    return null;
+  }, {
+    hasher: function hasher(args) {
+      return args[0];
+    },
+    limit: 100
+  });
+  /**
+   * Test if the given expression is a unit.
+   * The unit can have a prefix but cannot have a value.
+   * @memberof Unit
+   * @param {string} name   A string to be tested whether it is a value less unit.
+   *                        The unit can have prefix, like "cm"
+   * @return {boolean}      true if the given string is a unit
+   */
+
+
+  Unit.isValuelessUnit = function (name) {
+    return _findUnit(name) !== null;
+  };
+  /**
+   * check if this unit has given base unit
+   * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.
+   * @memberof Unit
+   * @param {BASE_UNITS | string | undefined} base
+   */
+
+
+  Unit.prototype.hasBase = function (base) {
+    if (typeof base === 'string') {
+      base = BASE_UNITS[base];
+    }
+
+    if (!base) {
+      return false;
+    } // All dimensions must be the same
+
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+
+    return true;
+  };
+  /**
+   * Check if this unit has a base or bases equal to another base or bases
+   * For derived units, the exponent on each base also must match
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if equal base
+   */
+
+
+  Unit.prototype.equalBase = function (other) {
+    // All dimensions must be the same
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+
+    return true;
+  };
+  /**
+   * Check if this unit equals another unit
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if both units are equal
+   */
+
+
+  Unit.prototype.equals = function (other) {
+    return this.equalBase(other) && equal(this.value, other.value);
+  };
+  /**
+   * Multiply this unit with another one
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {Unit} product of this unit and the other unit
+   */
+
+
+  Unit.prototype.multiply = function (other) {
+    var res = this.clone();
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0);
+    } // Append other's units list onto res
+
+
+    for (var _i = 0; _i < other.units.length; _i++) {
+      // Make a shallow copy of every unit
+      var inverted = _objectSpread({}, other.units[_i]);
+
+      res.units.push(inverted);
+    } // If at least one operand has a value, then the result should also have a value
+
+
+    if (this.value !== null || other.value !== null) {
+      var valThis = this.value === null ? this._normalize(1) : this.value;
+      var valOther = other.value === null ? other._normalize(1) : other.value;
+      res.value = multiplyScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+  /**
+   * Divide this unit by another one
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {Unit} result of dividing this unit by the other unit
+   */
+
+
+  Unit.prototype.divide = function (other) {
+    var res = this.clone();
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0);
+    } // Invert and append other's units list onto res
+
+
+    for (var _i2 = 0; _i2 < other.units.length; _i2++) {
+      // Make a shallow copy of every unit
+      var inverted = _objectSpread(_objectSpread({}, other.units[_i2]), {}, {
+        power: -other.units[_i2].power
+      });
+
+      res.units.push(inverted);
+    } // If at least one operand has a value, the result should have a value
+
+
+    if (this.value !== null || other.value !== null) {
+      var valThis = this.value === null ? this._normalize(1) : this.value;
+      var valOther = other.value === null ? other._normalize(1) : other.value;
+      res.value = divideScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+  /**
+   * Calculate the power of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} p
+   * @returns {Unit}      The result: this^p
+   */
+
+
+  Unit.prototype.pow = function (p) {
+    var res = this.clone();
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) * p;
+    } // Adjust the power of each unit in the list
+
+
+    for (var _i3 = 0; _i3 < res.units.length; _i3++) {
+      res.units[_i3].power *= p;
+    }
+
+    if (res.value !== null) {
+      res.value = pow(res.value, p); // only allow numeric output, we don't want to return a Complex number
+      // if (!isNumeric(res.value)) {
+      //  res.value = NaN
+      // }
+      // Update: Complex supported now
+    } else {
+      res.value = null;
+    }
+
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+  /**
+   * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise
+   * @param {Unit} unit
+   * @returns {number | Fraction | BigNumber | Unit}  The numeric value of the unit if conditions are met, or the original unit otherwise
+   */
+
+
+  function getNumericIfUnitless(unit) {
+    if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {
+      return unit.value;
+    } else {
+      return unit;
+    }
+  }
+  /**
+   * Calculate the absolute value of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} x
+   * @returns {Unit}      The result: |x|, absolute value of x
+   */
+
+
+  Unit.prototype.abs = function () {
+    var ret = this.clone();
+
+    if (ret.value !== null) {
+      if (ret._isDerived() || ret.units[0].unit.offset === 0) {
+        ret.value = abs(ret.value);
+      } else {
+        // To give the correct, but unexpected, results for units with an offset.
+        // For example, abs(-283.15 degC) = -263.15 degC !!!
+        // We must take the offset into consideration here
+        var convert = Unit._getNumberConverter((0, _is.typeOf)(ret.value)); // convert to Fraction or BigNumber if needed
+
+
+        var unitValue = convert(ret.units[0].unit.value);
+        var nominalOffset = convert(ret.units[0].unit.offset);
+        var unitOffset = multiplyScalar(unitValue, nominalOffset);
+        ret.value = subtract(abs(addScalar(ret.value, unitOffset)), unitOffset);
+      }
+    }
+
+    for (var i in ret.units) {
+      if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {
+        ret.units[i].unit = UNITS.W;
+      }
+    }
+
+    return ret;
+  };
+  /**
+   * Convert the unit to a specific unit name.
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like "cm"
+   * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.
+   */
+
+
+  Unit.prototype.to = function (valuelessUnit) {
+    var value = this.value === null ? this._normalize(1) : this.value;
+    var other;
+
+    if (typeof valuelessUnit === 'string') {
+      other = Unit.parse(valuelessUnit);
+    } else if ((0, _is.isUnit)(valuelessUnit)) {
+      other = valuelessUnit.clone();
+    } else {
+      throw new Error('String or Unit expected as parameter');
+    }
+
+    if (!this.equalBase(other)) {
+      throw new Error("Units do not match ('".concat(other.toString(), "' != '").concat(this.toString(), "')"));
+    }
+
+    if (other.value !== null) {
+      throw new Error('Cannot convert to a unit with a value');
+    }
+
+    if (this.value === null || this._isDerived() || this.units[0].unit.offset === other.units[0].unit.offset) {
+      other.value = (0, _object.clone)(value);
+    } else {
+      /* Need to adjust value by difference in offset to convert */
+      var convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed
+
+
+      var thisUnitValue = convert(this.units[0].unit.value);
+      var thisNominalOffset = convert(this.units[0].unit.offset);
+      var thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset);
+      var otherUnitValue = convert(other.units[0].unit.value);
+      var otherNominalOffset = convert(other.units[0].unit.offset);
+      var otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset);
+      other.value = subtract(addScalar(value, thisUnitOffset), otherUnitOffset);
+    }
+
+    other.fixPrefix = true;
+    other.skipAutomaticSimplification = true;
+    return other;
+  };
+  /**
+   * Return the value of the unit when represented with given valueless unit
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number} Returns the unit value as number.
+   */
+  // TODO: deprecate Unit.toNumber? It's always better to use toNumeric
+
+
+  Unit.prototype.toNumber = function (valuelessUnit) {
+    return toNumber(this.toNumeric(valuelessUnit));
+  };
+  /**
+   * Return the value of the unit in the original numeric type
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number | BigNumber | Fraction} Returns the unit value
+   */
+
+
+  Unit.prototype.toNumeric = function (valuelessUnit) {
+    var other;
+
+    if (valuelessUnit) {
+      // Allow getting the numeric value without converting to a different unit
+      other = this.to(valuelessUnit);
+    } else {
+      other = this.clone();
+    }
+
+    if (other._isDerived() || other.units.length === 0) {
+      return other._denormalize(other.value);
+    } else {
+      return other._denormalize(other.value, other.units[0].prefix.value);
+    }
+  };
+  /**
+   * Get a string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+
+
+  Unit.prototype.toString = function () {
+    return this.format();
+  };
+  /**
+   * Get a JSON representation of the unit
+   * @memberof Unit
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   */
+
+
+  Unit.prototype.toJSON = function () {
+    return {
+      mathjs: 'Unit',
+      value: this._denormalize(this.value),
+      unit: this.formatUnits(),
+      fixPrefix: this.fixPrefix
+    };
+  };
+  /**
+   * Instantiate a Unit from a JSON object
+   * @memberof Unit
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   * @return {Unit}
+   */
+
+
+  Unit.fromJSON = function (json) {
+    var unit = new Unit(json.value, json.unit);
+    unit.fixPrefix = json.fixPrefix || false;
+    return unit;
+  };
+  /**
+   * Returns the string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+
+
+  Unit.prototype.valueOf = Unit.prototype.toString;
+  /**
+   * Simplify this Unit's unit list and return a new Unit with the simplified list.
+   * The returned Unit will contain a list of the "best" units for formatting.
+   */
+
+  Unit.prototype.simplify = function () {
+    var ret = this.clone();
+    var proposedUnitList = []; // Search for a matching base
+
+    var matchingBase;
+
+    for (var key in currentUnitSystem) {
+      if ((0, _object.hasOwnProperty)(currentUnitSystem, key)) {
+        if (ret.hasBase(BASE_UNITS[key])) {
+          matchingBase = key;
+          break;
+        }
+      }
+    }
+
+    if (matchingBase === 'NONE') {
+      ret.units = [];
+    } else {
+      var matchingUnit;
+
+      if (matchingBase) {
+        // Does the unit system have a matching unit?
+        if ((0, _object.hasOwnProperty)(currentUnitSystem, matchingBase)) {
+          matchingUnit = currentUnitSystem[matchingBase];
+        }
+      }
+
+      if (matchingUnit) {
+        ret.units = [{
+          unit: matchingUnit.unit,
+          prefix: matchingUnit.prefix,
+          power: 1.0
+        }];
+      } else {
+        // Multiple units or units with powers are formatted like this:
+        // 5 (kg m^2) / (s^3 mol)
+        // Build an representation from the base units of the current unit system
+        var missingBaseDim = false;
+
+        for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+          var baseDim = BASE_DIMENSIONS[i];
+
+          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+            if ((0, _object.hasOwnProperty)(currentUnitSystem, baseDim)) {
+              proposedUnitList.push({
+                unit: currentUnitSystem[baseDim].unit,
+                prefix: currentUnitSystem[baseDim].prefix,
+                power: ret.dimensions[i] || 0
+              });
+            } else {
+              missingBaseDim = true;
+            }
+          }
+        } // Is the proposed unit list "simpler" than the existing one?
+
+
+        if (proposedUnitList.length < ret.units.length && !missingBaseDim) {
+          // Replace this unit list with the proposed list
+          ret.units = proposedUnitList;
+        }
+      }
+    }
+
+    return ret;
+  };
+  /**
+   * Returns a new Unit in the SI system with the same value as this one
+   */
+
+
+  Unit.prototype.toSI = function () {
+    var ret = this.clone();
+    var proposedUnitList = []; // Multiple units or units with powers are formatted like this:
+    // 5 (kg m^2) / (s^3 mol)
+    // Build an representation from the base units of the SI unit system
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      var baseDim = BASE_DIMENSIONS[i];
+
+      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+        if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS.si, baseDim)) {
+          proposedUnitList.push({
+            unit: UNIT_SYSTEMS.si[baseDim].unit,
+            prefix: UNIT_SYSTEMS.si[baseDim].prefix,
+            power: ret.dimensions[i] || 0
+          });
+        } else {
+          throw new Error('Cannot express custom unit ' + baseDim + ' in SI units');
+        }
+      }
+    } // Replace this unit list with the proposed list
+
+
+    ret.units = proposedUnitList;
+    ret.fixPrefix = true;
+    ret.skipAutomaticSimplification = true;
+    return ret;
+  };
+  /**
+   * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.
+   * @memberof Unit
+   * @return {string}
+   */
+
+
+  Unit.prototype.formatUnits = function () {
+    var strNum = '';
+    var strDen = '';
+    var nNum = 0;
+    var nDen = 0;
+
+    for (var i = 0; i < this.units.length; i++) {
+      if (this.units[i].power > 0) {
+        nNum++;
+        strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name;
+
+        if (Math.abs(this.units[i].power - 1.0) > 1e-15) {
+          strNum += '^' + this.units[i].power;
+        }
+      } else if (this.units[i].power < 0) {
+        nDen++;
+      }
+    }
+
+    if (nDen > 0) {
+      for (var _i4 = 0; _i4 < this.units.length; _i4++) {
+        if (this.units[_i4].power < 0) {
+          if (nNum > 0) {
+            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
+
+            if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {
+              strDen += '^' + -this.units[_i4].power;
+            }
+          } else {
+            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
+            strDen += '^' + this.units[_i4].power;
+          }
+        }
+      }
+    } // Remove leading " "
+
+
+    strNum = strNum.substr(1);
+    strDen = strDen.substr(1); // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting
+
+    if (nNum > 1 && nDen > 0) {
+      strNum = '(' + strNum + ')';
+    }
+
+    if (nDen > 1 && nNum > 0) {
+      strDen = '(' + strDen + ')';
+    }
+
+    var str = strNum;
+
+    if (nNum > 0 && nDen > 0) {
+      str += ' / ';
+    }
+
+    str += strDen;
+    return str;
+  };
+  /**
+   * Get a string representation of the Unit, with optional formatting options.
+   * @memberof Unit
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string}
+   */
+
+
+  Unit.prototype.format = function (options) {
+    // Simplfy the unit list, unless it is valueless or was created directly in the
+    // constructor or as the result of to or toSI
+    var simp = this.skipAutomaticSimplification || this.value === null ? this.clone() : this.simplify(); // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.
+
+    var isImaginary = false;
+
+    if (typeof simp.value !== 'undefined' && simp.value !== null && (0, _is.isComplex)(simp.value)) {
+      // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute
+      isImaginary = Math.abs(simp.value.re) < 1e-14;
+    }
+
+    for (var i in simp.units) {
+      if ((0, _object.hasOwnProperty)(simp.units, i)) {
+        if (simp.units[i].unit) {
+          if (simp.units[i].unit.name === 'VA' && isImaginary) {
+            simp.units[i].unit = UNITS.VAR;
+          } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {
+            simp.units[i].unit = UNITS.VA;
+          }
+        }
+      }
+    } // Now apply the best prefix
+    // Units must have only one unit and not have the fixPrefix flag set
+
+
+    if (simp.units.length === 1 && !simp.fixPrefix) {
+      // Units must have integer powers, otherwise the prefix will change the
+      // outputted value by not-an-integer-power-of-ten
+      if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {
+        // Apply the best prefix
+        simp.units[0].prefix = simp._bestPrefix();
+      }
+    }
+
+    var value = simp._denormalize(simp.value);
+
+    var str = simp.value !== null ? format(value, options || {}) : '';
+    var unitStr = simp.formatUnits();
+
+    if (simp.value && (0, _is.isComplex)(simp.value)) {
+      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing
+    }
+
+    if (unitStr.length > 0 && str.length > 0) {
+      str += ' ';
+    }
+
+    str += unitStr;
+    return str;
+  };
+  /**
+   * Calculate the best prefix using current value.
+   * @memberof Unit
+   * @returns {Object} prefix
+   * @private
+   */
+
+
+  Unit.prototype._bestPrefix = function () {
+    if (this.units.length !== 1) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    }
+
+    if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    } // find the best prefix value (resulting in the value of which
+    // the absolute value of the log10 is closest to zero,
+    // though with a little offset of 1.2 for nicer values: you get a
+    // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...
+    // Note: the units value can be any numeric type, but to find the best
+    // prefix it's enough to work with limited precision of a regular number
+    // Update: using mathjs abs since we also allow complex numbers
+
+
+    var absValue = this.value !== null ? abs(this.value) : 0;
+    var absUnitValue = abs(this.units[0].unit.value);
+    var bestPrefix = this.units[0].prefix;
+
+    if (absValue === 0) {
+      return bestPrefix;
+    }
+
+    var power = this.units[0].power;
+    var bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - 1.2;
+    if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix; // Allow the original prefix
+
+    bestDiff = Math.abs(bestDiff);
+    var prefixes = this.units[0].unit.prefixes;
+
+    for (var p in prefixes) {
+      if ((0, _object.hasOwnProperty)(prefixes, p)) {
+        var prefix = prefixes[p];
+
+        if (prefix.scientific) {
+          var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);
+
+          if (diff < bestDiff || diff === bestDiff && prefix.name.length < bestPrefix.name.length) {
+            // choose the prefix with the smallest diff, or if equal, choose the one
+            // with the shortest name (can happen with SHORTLONG for example)
+            bestPrefix = prefix;
+            bestDiff = diff;
+          }
+        }
+      }
+    }
+
+    return bestPrefix;
+  };
+  /**
+   * Returns an array of units whose sum is equal to this unit
+   * @memberof Unit
+   * @param {Array} [parts] An array of strings or valueless units.
+   *
+   *   Example:
+   *
+   *   const u = new Unit(1, 'm')
+   *   u.splitUnit(['feet', 'inch'])
+   *     [ 3 feet, 3.3700787401575 inch ]
+   *
+   * @return {Array} An array of units.
+   */
+
+
+  Unit.prototype.splitUnit = function (parts) {
+    var x = this.clone();
+    var ret = [];
+
+    for (var i = 0; i < parts.length; i++) {
+      // Convert x to the requested unit
+      x = x.to(parts[i]);
+      if (i === parts.length - 1) break; // Get the numeric value of this unit
+
+      var xNumeric = x.toNumeric(); // Check to see if xNumeric is nearly equal to an integer,
+      // since fix can incorrectly round down if there is round-off error
+
+      var xRounded = round(xNumeric);
+      var xFixed = void 0;
+      var isNearlyEqual = equal(xRounded, xNumeric);
+
+      if (isNearlyEqual) {
+        xFixed = xRounded;
+      } else {
+        xFixed = fix(x.toNumeric());
+      }
+
+      var y = new Unit(xFixed, parts[i].toString());
+      ret.push(y);
+      x = subtract(x, y);
+    } // This little bit fixes a bug where the remainder should be 0 but is a little bit off.
+    // But instead of comparing x, the remainder, with zero--we will compare the sum of
+    // all the parts so far with the original value. If they are nearly equal,
+    // we set the remainder to 0.
+
+
+    var testSum = 0;
+
+    for (var _i5 = 0; _i5 < ret.length; _i5++) {
+      testSum = addScalar(testSum, ret[_i5].value);
+    }
+
+    if (equal(testSum, this.value)) {
+      x.value = 0;
+    }
+
+    ret.push(x);
+    return ret;
+  };
+
+  var PREFIXES = {
+    NONE: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      }
+    },
+    SHORT: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e1,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e2,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-1,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-2,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-3,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-6,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-9,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-12,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-15,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-18,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-21,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-24,
+        scientific: true
+      }
+    },
+    LONG: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      deca: {
+        name: 'deca',
+        value: 1e1,
+        scientific: false
+      },
+      hecto: {
+        name: 'hecto',
+        value: 1e2,
+        scientific: false
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      },
+      deci: {
+        name: 'deci',
+        value: 1e-1,
+        scientific: false
+      },
+      centi: {
+        name: 'centi',
+        value: 1e-2,
+        scientific: false
+      },
+      milli: {
+        name: 'milli',
+        value: 1e-3,
+        scientific: true
+      },
+      micro: {
+        name: 'micro',
+        value: 1e-6,
+        scientific: true
+      },
+      nano: {
+        name: 'nano',
+        value: 1e-9,
+        scientific: true
+      },
+      pico: {
+        name: 'pico',
+        value: 1e-12,
+        scientific: true
+      },
+      femto: {
+        name: 'femto',
+        value: 1e-15,
+        scientific: true
+      },
+      atto: {
+        name: 'atto',
+        value: 1e-18,
+        scientific: true
+      },
+      zepto: {
+        name: 'zepto',
+        value: 1e-21,
+        scientific: true
+      },
+      yocto: {
+        name: 'yocto',
+        value: 1e-24,
+        scientific: true
+      }
+    },
+    SQUARED: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e2,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e4,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e6,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e12,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e18,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e24,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e30,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e36,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e42,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e48,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-2,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-4,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-6,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-12,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-18,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-24,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-30,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-36,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-42,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-48,
+        scientific: true
+      }
+    },
+    CUBIC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e3,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e6,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e9,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e18,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e27,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e36,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e45,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e54,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e63,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e72,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-3,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-6,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-9,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-18,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-27,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-36,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-45,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-54,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-63,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-72,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      Ki: {
+        name: 'Ki',
+        value: 1024,
+        scientific: true
+      },
+      Mi: {
+        name: 'Mi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      Gi: {
+        name: 'Gi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      Ti: {
+        name: 'Ti',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      Pi: {
+        name: 'Pi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      Ei: {
+        name: 'Ei',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      Zi: {
+        name: 'Zi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      Yi: {
+        name: 'Yi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BINARY_LONG_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_LONG_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kibi: {
+        name: 'kibi',
+        value: 1024,
+        scientific: true
+      },
+      mebi: {
+        name: 'mebi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      gibi: {
+        name: 'gibi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      tebi: {
+        name: 'tebi',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      pebi: {
+        name: 'pebi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      exi: {
+        name: 'exi',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      zebi: {
+        name: 'zebi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      yobi: {
+        name: 'yobi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BTU: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      MM: {
+        name: 'MM',
+        value: 1e6,
+        scientific: true
+      }
+    }
+  };
+  PREFIXES.SHORTLONG = (0, _extends2.default)({}, PREFIXES.SHORT, PREFIXES.LONG);
+  PREFIXES.BINARY_SHORT = (0, _extends2.default)({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);
+  PREFIXES.BINARY_LONG = (0, _extends2.default)({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);
+  /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:
+   * Index  Dimension
+   * -----  ---------
+   *   0    Length
+   *   1    Mass
+   *   2    Time
+   *   3    Current
+   *   4    Temperature
+   *   5    Luminous intensity
+   *   6    Amount of substance
+   *   7    Angle
+   *   8    Bit (digital)
+   * For example, the unit "298.15 K" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit "1 cal / (gm °C)" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].
+   *
+   */
+
+  var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];
+  var BASE_UNITS = {
+    NONE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    MASS: {
+      dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    LENGTH: {
+      dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]
+    },
+    TIME: {
+      dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]
+    },
+    CURRENT: {
+      dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]
+    },
+    TEMPERATURE: {
+      dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]
+    },
+    LUMINOUS_INTENSITY: {
+      dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]
+    },
+    AMOUNT_OF_SUBSTANCE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]
+    },
+    FORCE: {
+      dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    SURFACE: {
+      dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]
+    },
+    VOLUME: {
+      dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]
+    },
+    ENERGY: {
+      dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]
+    },
+    POWER: {
+      dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]
+    },
+    PRESSURE: {
+      dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CHARGE: {
+      dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CAPACITANCE: {
+      dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_POTENTIAL: {
+      dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_RESISTANCE: {
+      dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_INDUCTANCE: {
+      dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CONDUCTANCE: {
+      dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX: {
+      dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX_DENSITY: {
+      dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]
+    },
+    FREQUENCY: {
+      dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]
+    },
+    ANGLE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]
+    },
+    BIT: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]
+    }
+  };
+
+  for (var key in BASE_UNITS) {
+    if ((0, _object.hasOwnProperty)(BASE_UNITS, key)) {
+      BASE_UNITS[key].key = key;
+    }
+  }
+
+  var BASE_UNIT_NONE = {};
+  var UNIT_NONE = {
+    name: '',
+    base: BASE_UNIT_NONE,
+    value: 1,
+    offset: 0,
+    dimensions: BASE_DIMENSIONS.map(function (x) {
+      return 0;
+    })
+  };
+  var UNITS = {
+    // length
+    meter: {
+      name: 'meter',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    inch: {
+      name: 'inch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    foot: {
+      name: 'foot',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yard: {
+      name: 'yard',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mile: {
+      name: 'mile',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    link: {
+      name: 'link',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rod: {
+      name: 'rod',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.0292,
+      offset: 0
+    },
+    chain: {
+      name: 'chain',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    angstrom: {
+      name: 'angstrom',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1e-10,
+      offset: 0
+    },
+    m: {
+      name: 'm',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    in: {
+      name: 'in',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    ft: {
+      name: 'ft',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yd: {
+      name: 'yd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mi: {
+      name: 'mi',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    li: {
+      name: 'li',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rd: {
+      name: 'rd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.029210,
+      offset: 0
+    },
+    ch: {
+      name: 'ch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    mil: {
+      name: 'mil',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000254,
+      offset: 0
+    },
+    // 1/1000 inch
+    // Surface
+    m2: {
+      name: 'm2',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.SQUARED,
+      value: 1,
+      offset: 0
+    },
+    sqin: {
+      name: 'sqin',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.00064516,
+      offset: 0
+    },
+    // 645.16 mm2
+    sqft: {
+      name: 'sqft',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.09290304,
+      offset: 0
+    },
+    // 0.09290304 m2
+    sqyd: {
+      name: 'sqyd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.83612736,
+      offset: 0
+    },
+    // 0.83612736 m2
+    sqmi: {
+      name: 'sqmi',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 2589988.110336,
+      offset: 0
+    },
+    // 2.589988110336 km2
+    sqrd: {
+      name: 'sqrd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 25.29295,
+      offset: 0
+    },
+    // 25.29295 m2
+    sqch: {
+      name: 'sqch',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 404.6873,
+      offset: 0
+    },
+    // 404.6873 m2
+    sqmil: {
+      name: 'sqmil',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 6.4516e-10,
+      offset: 0
+    },
+    // 6.4516 * 10^-10 m2
+    acre: {
+      name: 'acre',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 4046.86,
+      offset: 0
+    },
+    // 4046.86 m2
+    hectare: {
+      name: 'hectare',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 10000,
+      offset: 0
+    },
+    // 10000 m2
+    // Volume
+    m3: {
+      name: 'm3',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.CUBIC,
+      value: 1,
+      offset: 0
+    },
+    L: {
+      name: 'L',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    l: {
+      name: 'l',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    litre: {
+      name: 'litre',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    cuin: {
+      name: 'cuin',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1.6387064e-5,
+      offset: 0
+    },
+    // 1.6387064e-5 m3
+    cuft: {
+      name: 'cuft',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.028316846592,
+      offset: 0
+    },
+    // 28.316 846 592 L
+    cuyd: {
+      name: 'cuyd',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.764554857984,
+      offset: 0
+    },
+    // 764.554 857 984 L
+    teaspoon: {
+      name: 'teaspoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000005,
+      offset: 0
+    },
+    // 5 mL
+    tablespoon: {
+      name: 'tablespoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000015,
+      offset: 0
+    },
+    // 15 mL
+    // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL  // not possible, we have already another cup
+    drop: {
+      name: 'drop',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+    gtt: {
+      name: 'gtt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+    // Liquid volume
+    minim: {
+      name: 'minim',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00000006161152,
+      offset: 0
+    },
+    // 0.06161152 mL
+    fluiddram: {
+      name: 'fluiddram',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000036966911,
+      offset: 0
+    },
+    // 3.696691 mL
+    fluidounce: {
+      name: 'fluidounce',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00002957353,
+      offset: 0
+    },
+    // 29.57353 mL
+    gill: {
+      name: 'gill',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0001182941,
+      offset: 0
+    },
+    // 118.2941 mL
+    cc: {
+      name: 'cc',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1e-6,
+      offset: 0
+    },
+    // 1e-6 L
+    cup: {
+      name: 'cup',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0002365882,
+      offset: 0
+    },
+    // 236.5882 mL
+    pint: {
+      name: 'pint',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0004731765,
+      offset: 0
+    },
+    // 473.1765 mL
+    quart: {
+      name: 'quart',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0009463529,
+      offset: 0
+    },
+    // 946.3529 mL
+    gallon: {
+      name: 'gallon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.003785412,
+      offset: 0
+    },
+    // 3.785412 L
+    beerbarrel: {
+      name: 'beerbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1173478,
+      offset: 0
+    },
+    // 117.3478 L
+    oilbarrel: {
+      name: 'oilbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1589873,
+      offset: 0
+    },
+    // 158.9873 L
+    hogshead: {
+      name: 'hogshead',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.2384810,
+      offset: 0
+    },
+    // 238.4810 L
+    // {name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute
+    fldr: {
+      name: 'fldr',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000036966911,
+      offset: 0
+    },
+    // 3.696691 mL
+    floz: {
+      name: 'floz',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00002957353,
+      offset: 0
+    },
+    // 29.57353 mL
+    gi: {
+      name: 'gi',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0001182941,
+      offset: 0
+    },
+    // 118.2941 mL
+    cp: {
+      name: 'cp',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0002365882,
+      offset: 0
+    },
+    // 236.5882 mL
+    pt: {
+      name: 'pt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0004731765,
+      offset: 0
+    },
+    // 473.1765 mL
+    qt: {
+      name: 'qt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0009463529,
+      offset: 0
+    },
+    // 946.3529 mL
+    gal: {
+      name: 'gal',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.003785412,
+      offset: 0
+    },
+    // 3.785412 L
+    bbl: {
+      name: 'bbl',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1173478,
+      offset: 0
+    },
+    // 117.3478 L
+    obl: {
+      name: 'obl',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1589873,
+      offset: 0
+    },
+    // 158.9873 L
+    // {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh?
+    // Mass
+    g: {
+      name: 'g',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    gram: {
+      name: 'gram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    ton: {
+      name: 'ton',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 907.18474,
+      offset: 0
+    },
+    t: {
+      name: 't',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 1000,
+      offset: 0
+    },
+    tonne: {
+      name: 'tonne',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 1000,
+      offset: 0
+    },
+    grain: {
+      name: 'grain',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dram: {
+      name: 'dram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    ounce: {
+      name: 'ounce',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    poundmass: {
+      name: 'poundmass',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    hundredweight: {
+      name: 'hundredweight',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    stick: {
+      name: 'stick',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 115e-3,
+      offset: 0
+    },
+    stone: {
+      name: 'stone',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 6.35029318,
+      offset: 0
+    },
+    gr: {
+      name: 'gr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dr: {
+      name: 'dr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    oz: {
+      name: 'oz',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    lbm: {
+      name: 'lbm',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    cwt: {
+      name: 'cwt',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    // Time
+    s: {
+      name: 's',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    min: {
+      name: 'min',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    h: {
+      name: 'h',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    second: {
+      name: 'second',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    sec: {
+      name: 'sec',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    minute: {
+      name: 'minute',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    hour: {
+      name: 'hour',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    day: {
+      name: 'day',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 86400,
+      offset: 0
+    },
+    week: {
+      name: 'week',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 7 * 86400,
+      offset: 0
+    },
+    month: {
+      name: 'month',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 2629800,
+      // 1/12th of Julian year
+      offset: 0
+    },
+    year: {
+      name: 'year',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600,
+      // Julian year
+      offset: 0
+    },
+    decade: {
+      name: 'decade',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 315576000,
+      // Julian decade
+      offset: 0
+    },
+    century: {
+      name: 'century',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3155760000,
+      // Julian century
+      offset: 0
+    },
+    millennium: {
+      name: 'millennium',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600000,
+      // Julian millennium
+      offset: 0
+    },
+    // Frequency
+    hertz: {
+      name: 'Hertz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    Hz: {
+      name: 'Hz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    // Angle
+    rad: {
+      name: 'rad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    radian: {
+      name: 'radian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888
+    deg: {
+      name: 'deg',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    degree: {
+      name: 'degree',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // grad = rad / (2*pi) * 400  = rad / 0.015707963267948966192313216916399
+    grad: {
+      name: 'grad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    gradian: {
+      name: 'gradian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793
+    cycle: {
+      name: 'cycle',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795
+    arcsec: {
+      name: 'arcsec',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477
+    arcmin: {
+      name: 'arcmin',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // Electric current
+    A: {
+      name: 'A',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    ampere: {
+      name: 'ampere',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // Temperature
+    // K(C) = °C + 273.15
+    // K(F) = (°F + 459.67) / 1.8
+    // K(R) = °R / 1.8
+    K: {
+      name: 'K',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 0
+    },
+    degC: {
+      name: 'degC',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 273.15
+    },
+    degF: {
+      name: 'degF',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 459.67
+    },
+    degR: {
+      name: 'degR',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 0
+    },
+    kelvin: {
+      name: 'kelvin',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 0
+    },
+    celsius: {
+      name: 'celsius',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 273.15
+    },
+    fahrenheit: {
+      name: 'fahrenheit',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 459.67
+    },
+    rankine: {
+      name: 'rankine',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 0
+    },
+    // amount of substance
+    mol: {
+      name: 'mol',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    mole: {
+      name: 'mole',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // luminous intensity
+    cd: {
+      name: 'cd',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    candela: {
+      name: 'candela',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // TODO: units STERADIAN
+    // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+    // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+    // Force
+    N: {
+      name: 'N',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    newton: {
+      name: 'newton',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    dyn: {
+      name: 'dyn',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 0.00001,
+      offset: 0
+    },
+    dyne: {
+      name: 'dyne',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 0.00001,
+      offset: 0
+    },
+    lbf: {
+      name: 'lbf',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    poundforce: {
+      name: 'poundforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    kip: {
+      name: 'kip',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 4448.2216,
+      offset: 0
+    },
+    kilogramforce: {
+      name: 'kilogramforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    // Energy
+    J: {
+      name: 'J',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    joule: {
+      name: 'joule',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    erg: {
+      name: 'erg',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.NONE,
+      value: 1e-7,
+      offset: 0
+    },
+    Wh: {
+      name: 'Wh',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 3600,
+      offset: 0
+    },
+    BTU: {
+      name: 'BTU',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.BTU,
+      value: 1055.05585262,
+      offset: 0
+    },
+    eV: {
+      name: 'eV',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    electronvolt: {
+      name: 'electronvolt',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.LONG,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    // Power
+    W: {
+      name: 'W',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    watt: {
+      name: 'watt',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    hp: {
+      name: 'hp',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.NONE,
+      value: 745.6998715386,
+      offset: 0
+    },
+    // Electrical power units
+    VAR: {
+      name: 'VAR',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: Complex.I,
+      offset: 0
+    },
+    VA: {
+      name: 'VA',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Pressure
+    Pa: {
+      name: 'Pa',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    psi: {
+      name: 'psi',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 6894.75729276459,
+      offset: 0
+    },
+    atm: {
+      name: 'atm',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 101325,
+      offset: 0
+    },
+    bar: {
+      name: 'bar',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORTLONG,
+      value: 100000,
+      offset: 0
+    },
+    torr: {
+      name: 'torr',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmHg: {
+      name: 'mmHg',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmH2O: {
+      name: 'mmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    cmH2O: {
+      name: 'cmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 98.0665,
+      offset: 0
+    },
+    // Electric charge
+    coulomb: {
+      name: 'coulomb',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    C: {
+      name: 'C',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric capacitance
+    farad: {
+      name: 'farad',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    F: {
+      name: 'F',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric potential
+    volt: {
+      name: 'volt',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    V: {
+      name: 'V',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric resistance
+    ohm: {
+      name: 'ohm',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORTLONG,
+      // Both Mohm and megaohm are acceptable
+      value: 1,
+      offset: 0
+    },
+
+    /*
+     * Unicode breaks in browsers if charset is not specified
+    Ω: {
+      name: 'Ω',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    */
+    // Electric inductance
+    henry: {
+      name: 'henry',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    H: {
+      name: 'H',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric conductance
+    siemens: {
+      name: 'siemens',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    S: {
+      name: 'S',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux
+    weber: {
+      name: 'weber',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    Wb: {
+      name: 'Wb',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux density
+    tesla: {
+      name: 'tesla',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    T: {
+      name: 'T',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Binary
+    b: {
+      name: 'b',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 1,
+      offset: 0
+    },
+    bits: {
+      name: 'bits',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 1,
+      offset: 0
+    },
+    B: {
+      name: 'B',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 8,
+      offset: 0
+    },
+    bytes: {
+      name: 'bytes',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 8,
+      offset: 0
+    }
+  }; // aliases (formerly plurals)
+
+  var ALIASES = {
+    meters: 'meter',
+    inches: 'inch',
+    feet: 'foot',
+    yards: 'yard',
+    miles: 'mile',
+    links: 'link',
+    rods: 'rod',
+    chains: 'chain',
+    angstroms: 'angstrom',
+    lt: 'l',
+    litres: 'litre',
+    liter: 'litre',
+    liters: 'litre',
+    teaspoons: 'teaspoon',
+    tablespoons: 'tablespoon',
+    minims: 'minim',
+    fluiddrams: 'fluiddram',
+    fluidounces: 'fluidounce',
+    gills: 'gill',
+    cups: 'cup',
+    pints: 'pint',
+    quarts: 'quart',
+    gallons: 'gallon',
+    beerbarrels: 'beerbarrel',
+    oilbarrels: 'oilbarrel',
+    hogsheads: 'hogshead',
+    gtts: 'gtt',
+    grams: 'gram',
+    tons: 'ton',
+    tonnes: 'tonne',
+    grains: 'grain',
+    drams: 'dram',
+    ounces: 'ounce',
+    poundmasses: 'poundmass',
+    hundredweights: 'hundredweight',
+    sticks: 'stick',
+    lb: 'lbm',
+    lbs: 'lbm',
+    kips: 'kip',
+    kgf: 'kilogramforce',
+    acres: 'acre',
+    hectares: 'hectare',
+    sqfeet: 'sqft',
+    sqyard: 'sqyd',
+    sqmile: 'sqmi',
+    sqmiles: 'sqmi',
+    mmhg: 'mmHg',
+    mmh2o: 'mmH2O',
+    cmh2o: 'cmH2O',
+    seconds: 'second',
+    secs: 'second',
+    minutes: 'minute',
+    mins: 'minute',
+    hours: 'hour',
+    hr: 'hour',
+    hrs: 'hour',
+    days: 'day',
+    weeks: 'week',
+    months: 'month',
+    years: 'year',
+    decades: 'decade',
+    centuries: 'century',
+    millennia: 'millennium',
+    hertz: 'hertz',
+    radians: 'radian',
+    degrees: 'degree',
+    gradians: 'gradian',
+    cycles: 'cycle',
+    arcsecond: 'arcsec',
+    arcseconds: 'arcsec',
+    arcminute: 'arcmin',
+    arcminutes: 'arcmin',
+    BTUs: 'BTU',
+    watts: 'watt',
+    joules: 'joule',
+    amperes: 'ampere',
+    coulombs: 'coulomb',
+    volts: 'volt',
+    ohms: 'ohm',
+    farads: 'farad',
+    webers: 'weber',
+    teslas: 'tesla',
+    electronvolts: 'electronvolt',
+    moles: 'mole',
+    bit: 'bits',
+    byte: 'bytes'
+  };
+  /**
+   * Calculate the values for the angle units.
+   * Value is calculated as number or BigNumber depending on the configuration
+   * @param {{number: 'number' | 'BigNumber'}} config
+   */
+
+  function calculateAngleValues(config) {
+    if (config.number === 'BigNumber') {
+      var pi = (0, _constants.createBigNumberPi)(_BigNumber);
+      UNITS.rad.value = new _BigNumber(1);
+      UNITS.deg.value = pi.div(180); // 2 * pi / 360
+
+      UNITS.grad.value = pi.div(200); // 2 * pi / 400
+
+      UNITS.cycle.value = pi.times(2); // 2 * pi
+
+      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600
+
+      UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60
+    } else {
+      // number
+      UNITS.rad.value = 1;
+      UNITS.deg.value = Math.PI / 180; // 2 * pi / 360
+
+      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400
+
+      UNITS.cycle.value = Math.PI * 2; // 2 * pi
+
+      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600
+
+      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60
+    } // copy to the full names of the angles
+
+
+    UNITS.radian.value = UNITS.rad.value;
+    UNITS.degree.value = UNITS.deg.value;
+    UNITS.gradian.value = UNITS.grad.value;
+  } // apply the angle values now
+
+
+  calculateAngleValues(config);
+
+  if (on) {
+    // recalculate the values on change of configuration
+    on('config', function (curr, prev) {
+      if (curr.number !== prev.number) {
+        calculateAngleValues(curr);
+      }
+    });
+  }
+  /**
+   * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.
+   * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).
+   * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.
+   */
+
+
+  var UNIT_SYSTEMS = {
+    si: {
+      // Base units
+      NONE: {
+        unit: UNIT_NONE,
+        prefix: PREFIXES.NONE['']
+      },
+      LENGTH: {
+        unit: UNITS.m,
+        prefix: PREFIXES.SHORT['']
+      },
+      MASS: {
+        unit: UNITS.g,
+        prefix: PREFIXES.SHORT.k
+      },
+      TIME: {
+        unit: UNITS.s,
+        prefix: PREFIXES.SHORT['']
+      },
+      CURRENT: {
+        unit: UNITS.A,
+        prefix: PREFIXES.SHORT['']
+      },
+      TEMPERATURE: {
+        unit: UNITS.K,
+        prefix: PREFIXES.SHORT['']
+      },
+      LUMINOUS_INTENSITY: {
+        unit: UNITS.cd,
+        prefix: PREFIXES.SHORT['']
+      },
+      AMOUNT_OF_SUBSTANCE: {
+        unit: UNITS.mol,
+        prefix: PREFIXES.SHORT['']
+      },
+      ANGLE: {
+        unit: UNITS.rad,
+        prefix: PREFIXES.SHORT['']
+      },
+      BIT: {
+        unit: UNITS.bits,
+        prefix: PREFIXES.SHORT['']
+      },
+      // Derived units
+      FORCE: {
+        unit: UNITS.N,
+        prefix: PREFIXES.SHORT['']
+      },
+      ENERGY: {
+        unit: UNITS.J,
+        prefix: PREFIXES.SHORT['']
+      },
+      POWER: {
+        unit: UNITS.W,
+        prefix: PREFIXES.SHORT['']
+      },
+      PRESSURE: {
+        unit: UNITS.Pa,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CHARGE: {
+        unit: UNITS.C,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CAPACITANCE: {
+        unit: UNITS.F,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_POTENTIAL: {
+        unit: UNITS.V,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_RESISTANCE: {
+        unit: UNITS.ohm,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_INDUCTANCE: {
+        unit: UNITS.H,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CONDUCTANCE: {
+        unit: UNITS.S,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX: {
+        unit: UNITS.Wb,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX_DENSITY: {
+        unit: UNITS.T,
+        prefix: PREFIXES.SHORT['']
+      },
+      FREQUENCY: {
+        unit: UNITS.Hz,
+        prefix: PREFIXES.SHORT['']
+      }
+    }
+  }; // Clone to create the other unit systems
+
+  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.cgs.LENGTH = {
+    unit: UNITS.m,
+    prefix: PREFIXES.SHORT.c
+  };
+  UNIT_SYSTEMS.cgs.MASS = {
+    unit: UNITS.g,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.FORCE = {
+    unit: UNITS.dyn,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.ENERGY = {
+    unit: UNITS.erg,
+    prefix: PREFIXES.NONE['']
+  }; // there are wholly 4 unique cgs systems for electricity and magnetism,
+  // so let's not worry about it unless somebody complains
+
+  UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.us.LENGTH = {
+    unit: UNITS.ft,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.MASS = {
+    unit: UNITS.lbm,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.TEMPERATURE = {
+    unit: UNITS.degF,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.FORCE = {
+    unit: UNITS.lbf,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.ENERGY = {
+    unit: UNITS.BTU,
+    prefix: PREFIXES.BTU['']
+  };
+  UNIT_SYSTEMS.us.POWER = {
+    unit: UNITS.hp,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.PRESSURE = {
+    unit: UNITS.psi,
+    prefix: PREFIXES.NONE['']
+  }; // Add additional unit systems here.
+  // Choose a unit system to seed the auto unit system.
+
+  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si)); // Set the current unit system
+
+  var currentUnitSystem = UNIT_SYSTEMS.auto;
+  /**
+   * Set a unit system for formatting derived units.
+   * @param {string} [name] The name of the unit system.
+   */
+
+  Unit.setUnitSystem = function (name) {
+    if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS, name)) {
+      currentUnitSystem = UNIT_SYSTEMS[name];
+    } else {
+      throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '));
+    }
+  };
+  /**
+   * Return the current unit system.
+   * @return {string} The current unit system.
+   */
+
+
+  Unit.getUnitSystem = function () {
+    for (var _key in UNIT_SYSTEMS) {
+      if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS, _key)) {
+        if (UNIT_SYSTEMS[_key] === currentUnitSystem) {
+          return _key;
+        }
+      }
+    }
+  };
+  /**
+   * Converters to convert from number to an other numeric type like BigNumber
+   * or Fraction
+   */
+
+
+  Unit.typeConverters = {
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(x + ''); // stringify to prevent constructor error
+    },
+    Fraction: function Fraction(x) {
+      return new _Fraction(x);
+    },
+    Complex: function Complex(x) {
+      return x;
+    },
+    number: function number(x) {
+      return x;
+    }
+  };
+  /**
+   * Retrieve the right convertor function corresponding with the type
+   * of provided exampleValue.
+   *
+   * @param {string} type   A string 'number', 'BigNumber', or 'Fraction'
+   *                        In case of an unknown type,
+   * @return {Function}
+   */
+
+  Unit._getNumberConverter = function (type) {
+    if (!Unit.typeConverters[type]) {
+      throw new TypeError('Unsupported type "' + type + '"');
+    }
+
+    return Unit.typeConverters[type];
+  }; // Add dimensions to each built-in unit
+
+
+  for (var _key2 in UNITS) {
+    if ((0, _object.hasOwnProperty)(UNITS, _key2)) {
+      var unit = UNITS[_key2];
+      unit.dimensions = unit.base.dimensions;
+    }
+  } // Create aliases
+
+
+  for (var _name2 in ALIASES) {
+    if ((0, _object.hasOwnProperty)(ALIASES, _name2)) {
+      var _unit2 = UNITS[ALIASES[_name2]];
+      var alias = {};
+
+      for (var _key3 in _unit2) {
+        if ((0, _object.hasOwnProperty)(_unit2, _key3)) {
+          alias[_key3] = _unit2[_key3];
+        }
+      }
+
+      alias.name = _name2;
+      UNITS[_name2] = alias;
+    }
+  }
+  /**
+   * Checks if a character is a valid latin letter (upper or lower case).
+   * Note that this function can be overridden, for example to allow support of other alphabets.
+   * @param {string} c Tested character
+   */
+
+
+  Unit.isValidAlpha = function isValidAlpha(c) {
+    return /^[a-zA-Z]$/.test(c);
+  };
+
+  function assertUnitNameIsValid(name) {
+    for (var i = 0; i < name.length; i++) {
+      c = name.charAt(i);
+
+      if (i === 0 && !Unit.isValidAlpha(c)) {
+        throw new Error('Invalid unit name (must begin with alpha character): "' + name + '"');
+      }
+
+      if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {
+        throw new Error('Invalid unit name (only alphanumeric characters are allowed): "' + name + '"');
+      }
+    }
+  }
+  /**
+   * Wrapper around createUnitSingle.
+   * Example:
+   *  createUnit({
+   *    foo: { },
+   *    bar: {
+   *      definition: 'kg/foo',
+   *      aliases: ['ba', 'barr', 'bars'],
+   *      offset: 200
+   *    },
+   *    baz: '4 bar'
+   *  },
+   *  {
+   *    override: true
+   *  })
+   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.
+   * @param {object} options
+   */
+
+
+  Unit.createUnit = function (obj, options) {
+    if ((0, _typeof2.default)(obj) !== 'object') {
+      throw new TypeError("createUnit expects first parameter to be of type 'Object'");
+    } // Remove all units and aliases we are overriding
+
+
+    if (options && options.override) {
+      for (var _key4 in obj) {
+        if ((0, _object.hasOwnProperty)(obj, _key4)) {
+          Unit.deleteUnit(_key4);
+        }
+
+        if (obj[_key4].aliases) {
+          for (var i = 0; i < obj[_key4].aliases.length; i++) {
+            Unit.deleteUnit(obj[_key4].aliases[i]);
+          }
+        }
+      }
+    } // TODO: traverse multiple times until all units have been added
+
+
+    var lastUnit;
+
+    for (var _key5 in obj) {
+      if ((0, _object.hasOwnProperty)(obj, _key5)) {
+        lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);
+      }
+    }
+
+    return lastUnit;
+  };
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * Example:
+   *  createUnitSingle('knot', '0.514444444 m/s')
+   *  createUnitSingle('acre', new Unit(43560, 'ft^2'))
+   *
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string, Unit, Object} definition      Definition of the unit in terms
+   * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,
+   * or an Object. If an Object, may have the following properties:
+   *   - definition {string|Unit} The definition of this unit.
+   *   - prefixes {string} "none", "short", "long", "binary_short", or "binary_long".
+   *     The default is "none".
+   *   - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']
+   *   - offset {Numeric} An offset to apply when converting from the unit. For
+   *     example, the offset for celsius is 273.15 and the offset for farhenheit
+   *     is 459.67. Default is 0.
+   *   - baseName {string} If the unit's dimension does not match that of any other
+   *     base unit, the name of the newly create base unit. Otherwise, this property
+   *     has no effect.
+   *
+   * @param {Object} options   (optional) An object containing any of the following
+   * properties:
+   *   - override {boolean} Whether this unit should be allowed to override existing
+   *     units.
+   *
+   * @return {Unit}
+   */
+
+
+  Unit.createUnitSingle = function (name, obj, options) {
+    if (typeof obj === 'undefined' || obj === null) {
+      obj = {};
+    }
+
+    if (typeof name !== 'string') {
+      throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");
+    } // Check collisions with existing units
+
+
+    if ((0, _object.hasOwnProperty)(UNITS, name)) {
+      throw new Error('Cannot create unit "' + name + '": a unit with that name already exists');
+    } // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.
+
+
+    assertUnitNameIsValid(name);
+    var defUnit = null; // The Unit from which the new unit will be created.
+
+    var aliases = [];
+    var offset = 0;
+    var definition;
+    var prefixes;
+    var baseName;
+
+    if (obj && obj.type === 'Unit') {
+      defUnit = obj.clone();
+    } else if (typeof obj === 'string') {
+      if (obj !== '') {
+        definition = obj;
+      }
+    } else if ((0, _typeof2.default)(obj) === 'object') {
+      definition = obj.definition;
+      prefixes = obj.prefixes;
+      offset = obj.offset;
+      baseName = obj.baseName;
+
+      if (obj.aliases) {
+        aliases = obj.aliases.valueOf(); // aliases could be a Matrix, so convert to Array
+      }
+    } else {
+      throw new TypeError('Cannot create unit "' + name + '" from "' + obj.toString() + '": expecting "string" or "Unit" or "Object"');
+    }
+
+    if (aliases) {
+      for (var i = 0; i < aliases.length; i++) {
+        if ((0, _object.hasOwnProperty)(UNITS, aliases[i])) {
+          throw new Error('Cannot create alias "' + aliases[i] + '": a unit with that name already exists');
+        }
+      }
+    }
+
+    if (definition && typeof definition === 'string' && !defUnit) {
+      try {
+        defUnit = Unit.parse(definition, {
+          allowNoUnits: true
+        });
+      } catch (ex) {
+        ex.message = 'Could not create unit "' + name + '" from "' + definition + '": ' + ex.message;
+        throw ex;
+      }
+    } else if (definition && definition.type === 'Unit') {
+      defUnit = definition.clone();
+    }
+
+    aliases = aliases || [];
+    offset = offset || 0;
+
+    if (prefixes && prefixes.toUpperCase) {
+      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;
+    } else {
+      prefixes = PREFIXES.NONE;
+    } // If defUnit is null, it is because the user did not
+    // specify a defintion. So create a new base dimension.
+
+
+    var newUnit = {};
+
+    if (!defUnit) {
+      // Add a new base dimension
+      baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+
+      if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {
+        throw new Error('Cannot create new base unit "' + name + '": a base unit with that name already exists (and cannot be overridden)');
+      }
+
+      BASE_DIMENSIONS.push(baseName); // Push 0 onto existing base units
+
+      for (var b in BASE_UNITS) {
+        if ((0, _object.hasOwnProperty)(BASE_UNITS, b)) {
+          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;
+        }
+      } // Add the new base unit
+
+
+      var newBaseUnit = {
+        dimensions: []
+      };
+
+      for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {
+        newBaseUnit.dimensions[_i6] = 0;
+      }
+
+      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;
+      newBaseUnit.key = baseName;
+      BASE_UNITS[baseName] = newBaseUnit;
+      newUnit = {
+        name: name,
+        value: 1,
+        dimensions: BASE_UNITS[baseName].dimensions.slice(0),
+        prefixes: prefixes,
+        offset: offset,
+        base: BASE_UNITS[baseName]
+      };
+      currentUnitSystem[baseName] = {
+        unit: newUnit,
+        prefix: PREFIXES.NONE['']
+      };
+    } else {
+      newUnit = {
+        name: name,
+        value: defUnit.value,
+        dimensions: defUnit.dimensions.slice(0),
+        prefixes: prefixes,
+        offset: offset
+      }; // Create a new base if no matching base exists
+
+      var anyMatch = false;
+
+      for (var _i7 in BASE_UNITS) {
+        if ((0, _object.hasOwnProperty)(BASE_UNITS, _i7)) {
+          var match = true;
+
+          for (var j = 0; j < BASE_DIMENSIONS.length; j++) {
+            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {
+              match = false;
+              break;
+            }
+          }
+
+          if (match) {
+            anyMatch = true;
+            newUnit.base = BASE_UNITS[_i7];
+            break;
+          }
+        }
+      }
+
+      if (!anyMatch) {
+        baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+        // Add the new base unit
+
+        var _newBaseUnit = {
+          dimensions: defUnit.dimensions.slice(0)
+        };
+        _newBaseUnit.key = baseName;
+        BASE_UNITS[baseName] = _newBaseUnit;
+        currentUnitSystem[baseName] = {
+          unit: newUnit,
+          prefix: PREFIXES.NONE['']
+        };
+        newUnit.base = BASE_UNITS[baseName];
+      }
+    }
+
+    Unit.UNITS[name] = newUnit;
+
+    for (var _i8 = 0; _i8 < aliases.length; _i8++) {
+      var aliasName = aliases[_i8];
+      var _alias = {};
+
+      for (var _key6 in newUnit) {
+        if ((0, _object.hasOwnProperty)(newUnit, _key6)) {
+          _alias[_key6] = newUnit[_key6];
+        }
+      }
+
+      _alias.name = aliasName;
+      Unit.UNITS[aliasName] = _alias;
+    } // delete the memoization cache, since adding a new unit to the array
+    // invalidates all old results
+
+
+    delete _findUnit.cache;
+    return new Unit(null, name);
+  };
+
+  Unit.deleteUnit = function (name) {
+    delete Unit.UNITS[name];
+  }; // expose arrays with prefixes, dimensions, units, systems
+
+
+  Unit.PREFIXES = PREFIXES;
+  Unit.BASE_DIMENSIONS = BASE_DIMENSIONS;
+  Unit.BASE_UNITS = BASE_UNITS;
+  Unit.UNIT_SYSTEMS = UNIT_SYSTEMS;
+  Unit.UNITS = UNITS;
+  return Unit;
+}, {
+  isClass: true
+});
+exports.createUnitClass = createUnitClass;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/function/createUnit.js b/node_modules/mathjs/lib/cjs/type/unit/function/createUnit.js
new file mode 100644
index 0000000..1a8b9c6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/function/createUnit.js
@@ -0,0 +1,86 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCreateUnit = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'createUnit';
+var dependencies = ['typed', 'Unit'];
+var createCreateUnit = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Unit = _ref.Unit;
+
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   *
+   * Syntax:
+   *
+   *     math.createUnit({
+   *       baseUnit1: {
+   *         aliases: [string, ...]
+   *         prefixes: object
+   *       },
+   *       unit2: {
+   *         definition: string,
+   *         aliases: [string, ...]
+   *         prefixes: object,
+   *         offset: number
+   *       },
+   *       unit3: string    // Shortcut
+   *     })
+   *
+   *     // Another shortcut:
+   *     math.createUnit(string, unit : string, [object])
+   *
+   * Examples:
+   *
+   *     math.createUnit('foo')
+   *     math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})
+   *     math.createUnit('mph', '1 mile/hour')
+   *
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.
+   * @param {Object} options   (optional) An object containing any of the following properties:
+   *     - `prefixes {string}` "none", "short", "long", "binary_short", or "binary_long". The default is "none".
+   *     - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']
+   *     - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @return {Unit} The new unit
+   */
+  return typed(name, {
+    // General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.
+    'Object, Object': function ObjectObject(obj, options) {
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    Object: function Object(obj) {
+      return Unit.createUnit(obj, {});
+    },
+    // Shortcut method for creating one unit.
+    'string, Unit | string | Object, Object': function stringUnitStringObjectObject(name, def, options) {
+      var obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    'string, Unit | string | Object': function stringUnitStringObject(name, def) {
+      var obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, {});
+    },
+    // Without a definition, creates a base unit.
+    string: function string(name) {
+      var obj = {};
+      obj[name] = {};
+      return Unit.createUnit(obj, {});
+    }
+  });
+});
+exports.createCreateUnit = createCreateUnit;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/function/splitUnit.js b/node_modules/mathjs/lib/cjs/type/unit/function/splitUnit.js
new file mode 100644
index 0000000..5da465e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/function/splitUnit.js
@@ -0,0 +1,40 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSplitUnit = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var name = 'splitUnit';
+var dependencies = ['typed'];
+var createSplitUnit = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed;
+
+  /**
+   * Split a unit in an array of units whose sum is equal to the original unit.
+   *
+   * Syntax:
+   *
+   *     splitUnit(unit: Unit, parts: Array.<Unit>)
+   *
+   * Example:
+   *
+   *     math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])
+   *     // [ 3 feet, 3.3700787401575 inch ]
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @param {Array} [parts] An array of strings or valueless units.
+   * @return {Array} An array of units.
+   */
+  return typed(name, {
+    'Unit, Array': function UnitArray(unit, parts) {
+      return unit.splitUnit(parts);
+    }
+  });
+});
+exports.createSplitUnit = createSplitUnit;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/function/unit.js b/node_modules/mathjs/lib/cjs/type/unit/function/unit.js
new file mode 100644
index 0000000..81edecd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/function/unit.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitFunction = void 0;
+
+var _factory = require("../../../utils/factory.js");
+
+var _collection = require("../../../utils/collection.js");
+
+var name = 'unit';
+var dependencies = ['typed', 'Unit']; // This function is named createUnitFunction to prevent a naming conflict with createUnit
+
+var createUnitFunction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      Unit = _ref.Unit;
+
+  /**
+   * Create a unit. Depending on the passed arguments, the function
+   * will create and return a new math.Unit object.
+   * When a matrix is provided, all elements will be converted to units.
+   *
+   * Syntax:
+   *
+   *     math.unit(unit : string)
+   *     math.unit(value : number, unit : string)
+   *
+   * Examples:
+   *
+   *    const a = math.unit(5, 'cm')    // returns Unit 50 mm
+   *    const b = math.unit('23 kg')    // returns Unit 23 kg
+   *    a.to('m')                       // returns Unit 0.05 m
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, string, createUnit
+   *
+   * @param {* | Array | Matrix} args   A number and unit.
+   * @return {Unit | Array | Matrix}    The created unit
+   */
+  return typed(name, {
+    Unit: function Unit(x) {
+      return x.clone();
+    },
+    string: function string(x) {
+      if (Unit.isValuelessUnit(x)) {
+        return new Unit(null, x); // a pure unit
+      }
+
+      return Unit.parse(x, {
+        allowNoUnits: true
+      }); // a unit with value, like '5cm'
+    },
+    'number | BigNumber | Fraction | Complex, string': function numberBigNumberFractionComplexString(value, unit) {
+      return new Unit(value, unit);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return (0, _collection.deepMap)(x, this);
+    }
+  });
+});
+exports.createUnitFunction = createUnitFunction;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/physicalConstants.js b/node_modules/mathjs/lib/cjs/type/unit/physicalConstants.js
new file mode 100644
index 0000000..473566f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/physicalConstants.js
@@ -0,0 +1,150 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createWienDisplacement = exports.createWeakMixingAngle = exports.createVacuumImpedance = exports.createThomsonCrossSection = exports.createStefanBoltzmann = exports.createSpeedOfLight = exports.createSecondRadiation = exports.createSackurTetrode = exports.createRydberg = exports.createReducedPlanckConstant = exports.createQuantumOfCirculation = exports.createProtonMass = exports.createPlanckTime = exports.createPlanckTemperature = exports.createPlanckMass = exports.createPlanckLength = exports.createPlanckConstant = exports.createPlanckCharge = exports.createNuclearMagneton = exports.createNeutronMass = exports.createMolarVolume = exports.createMolarPlanckConstant = exports.createMolarMassC12 = exports.createMolarMass = exports.createMagneticFluxQuantum = exports.createMagneticConstant = exports.createLoschmidt = exports.createKlitzing = exports.createJosephson = exports.createInverseConductanceQuantum = exports.createHartreeEnergy = exports.createGravity = exports.createGravitationConstant = exports.createGasConstant = exports.createFirstRadiation = exports.createFineStructure = exports.createFermiCoupling = exports.createFaraday = exports.createElementaryCharge = exports.createElectronMass = exports.createElectricConstant = exports.createEfimovFactor = exports.createDeuteronMass = exports.createCoulomb = exports.createConductanceQuantum = exports.createClassicalElectronRadius = exports.createBoltzmann = exports.createBohrRadius = exports.createBohrMagneton = exports.createAvogadro = exports.createAtomicMass = void 0;
+
+var _factory = require("../../utils/factory.js");
+
+// Source: https://en.wikipedia.org/wiki/Physical_constant
+// Universal constants
+var createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');
+exports.createSpeedOfLight = createSpeedOfLight;
+var createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');
+exports.createGravitationConstant = createGravitationConstant;
+var createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');
+exports.createPlanckConstant = createPlanckConstant;
+var createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s'); // Electromagnetic constants
+
+exports.createReducedPlanckConstant = createReducedPlanckConstant;
+var createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');
+exports.createMagneticConstant = createMagneticConstant;
+var createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');
+exports.createElectricConstant = createElectricConstant;
+var createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');
+exports.createVacuumImpedance = createVacuumImpedance;
+var createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2');
+exports.createCoulomb = createCoulomb;
+var createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');
+exports.createElementaryCharge = createElementaryCharge;
+var createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');
+exports.createBohrMagneton = createBohrMagneton;
+var createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');
+exports.createConductanceQuantum = createConductanceQuantum;
+var createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');
+exports.createInverseConductanceQuantum = createInverseConductanceQuantum;
+var createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');
+exports.createMagneticFluxQuantum = createMagneticFluxQuantum;
+var createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');
+exports.createNuclearMagneton = createNuclearMagneton;
+var createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');
+exports.createKlitzing = createKlitzing;
+var createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed
+// Atomic and nuclear constants
+
+exports.createJosephson = createJosephson;
+var createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');
+exports.createBohrRadius = createBohrRadius;
+var createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');
+exports.createClassicalElectronRadius = createClassicalElectronRadius;
+var createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');
+exports.createElectronMass = createElectronMass;
+var createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');
+exports.createFermiCoupling = createFermiCoupling;
+var createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);
+exports.createFineStructure = createFineStructure;
+var createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');
+exports.createHartreeEnergy = createHartreeEnergy;
+var createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');
+exports.createProtonMass = createProtonMass;
+var createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');
+exports.createDeuteronMass = createDeuteronMass;
+var createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');
+exports.createNeutronMass = createNeutronMass;
+var createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');
+exports.createQuantumOfCirculation = createQuantumOfCirculation;
+var createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');
+exports.createRydberg = createRydberg;
+var createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');
+exports.createThomsonCrossSection = createThomsonCrossSection;
+var createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);
+exports.createWeakMixingAngle = createWeakMixingAngle;
+var createEfimovFactor = numberFactory('efimovFactor', 22.7); // Physico-chemical constants
+
+exports.createEfimovFactor = createEfimovFactor;
+var createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');
+exports.createAtomicMass = createAtomicMass;
+var createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');
+exports.createAvogadro = createAvogadro;
+var createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');
+exports.createBoltzmann = createBoltzmann;
+var createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');
+exports.createFaraday = createFaraday;
+var createFirstRadiation = /* #__PURE__ */unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2'); // export const createSpectralRadiance = /* #__PURE__ */ unitFactory('spectralRadiance', '1.1910429723971881e-16', 'W m^2 sr^-1') // TODO spectralRadiance
+
+exports.createFirstRadiation = createFirstRadiation;
+var createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');
+exports.createLoschmidt = createLoschmidt;
+var createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');
+exports.createGasConstant = createGasConstant;
+var createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');
+exports.createMolarPlanckConstant = createMolarPlanckConstant;
+var createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');
+exports.createMolarVolume = createMolarVolume;
+var createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);
+exports.createSackurTetrode = createSackurTetrode;
+var createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');
+exports.createSecondRadiation = createSecondRadiation;
+var createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');
+exports.createStefanBoltzmann = createStefanBoltzmann;
+var createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K'); // Adopted values
+
+exports.createWienDisplacement = createWienDisplacement;
+var createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');
+exports.createMolarMass = createMolarMass;
+var createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');
+exports.createMolarMassC12 = createMolarMassC12;
+var createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2'); // atm is defined in Unit.js
+// Natural units
+
+exports.createGravity = createGravity;
+var createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');
+exports.createPlanckLength = createPlanckLength;
+var createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');
+exports.createPlanckMass = createPlanckMass;
+var createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');
+exports.createPlanckTime = createPlanckTime;
+var createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');
+exports.createPlanckCharge = createPlanckCharge;
+var createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K'); // helper function to create a factory function which creates a physical constant,
+// a Unit with either a number value or a BigNumber value depending on the configuration
+
+exports.createPlanckTemperature = createPlanckTemperature;
+
+function unitFactory(name, valueStr, unitStr) {
+  var dependencies = ['config', 'Unit', 'BigNumber'];
+  return (0, _factory.factory)(name, dependencies, function (_ref) {
+    var config = _ref.config,
+        Unit = _ref.Unit,
+        BigNumber = _ref.BigNumber;
+    // Note that we can parse into number or BigNumber.
+    // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values
+    // Therefore we dont use Unit.parse()
+    var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);
+    var unit = new Unit(value, unitStr);
+    unit.fixPrefix = true;
+    return unit;
+  });
+} // helper function to create a factory function which creates a numeric constant,
+// either a number or BigNumber depending on the configuration
+
+
+function numberFactory(name, value) {
+  var dependencies = ['config', 'BigNumber'];
+  return (0, _factory.factory)(name, dependencies, function (_ref2) {
+    var config = _ref2.config,
+        BigNumber = _ref2.BigNumber;
+    return config.number === 'BigNumber' ? new BigNumber(value) : value;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/array.js b/node_modules/mathjs/lib/cjs/utils/array.js
new file mode 100644
index 0000000..98ec6ef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/array.js
@@ -0,0 +1,682 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.arraySize = arraySize;
+exports.contains = contains;
+exports.filter = filter;
+exports.filterRegExp = filterRegExp;
+exports.flatten = flatten;
+exports.forEach = forEach;
+exports.generalize = generalize;
+exports.getArrayDataType = getArrayDataType;
+exports.identify = identify;
+exports.initial = initial;
+exports.join = join;
+exports.last = last;
+exports.map = map;
+exports.processSizesWildcard = processSizesWildcard;
+exports.reshape = reshape;
+exports.resize = resize;
+exports.squeeze = squeeze;
+exports.unsqueeze = unsqueeze;
+exports.validate = validate;
+exports.validateIndex = validateIndex;
+
+var _number = require("./number.js");
+
+var _is = require("./is.js");
+
+var _string = require("./string.js");
+
+var _DimensionError = require("../error/DimensionError.js");
+
+var _IndexError = require("../error/IndexError.js");
+
+/**
+ * Calculate the size of a multi dimensional array.
+ * This function checks the size of the first entry, it does not validate
+ * whether all dimensions match. (use function `validate` for that)
+ * @param {Array} x
+ * @Return {Number[]} size
+ */
+function arraySize(x) {
+  var s = [];
+
+  while (Array.isArray(x)) {
+    s.push(x.length);
+    x = x[0];
+  }
+
+  return s;
+}
+/**
+ * Recursively validate whether each element in a multi dimensional array
+ * has a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @param {number} dim   Current dimension
+ * @throws DimensionError
+ * @private
+ */
+
+
+function _validate(array, size, dim) {
+  var i;
+  var len = array.length;
+
+  if (len !== size[dim]) {
+    throw new _DimensionError.DimensionError(len, size[dim]);
+  }
+
+  if (dim < size.length - 1) {
+    // recursively validate each child array
+    var dimNext = dim + 1;
+
+    for (i = 0; i < len; i++) {
+      var child = array[i];
+
+      if (!Array.isArray(child)) {
+        throw new _DimensionError.DimensionError(size.length - 1, size.length, '<');
+      }
+
+      _validate(array[i], size, dimNext);
+    }
+  } else {
+    // last dimension. none of the childs may be an array
+    for (i = 0; i < len; i++) {
+      if (Array.isArray(array[i])) {
+        throw new _DimensionError.DimensionError(size.length + 1, size.length, '>');
+      }
+    }
+  }
+}
+/**
+ * Validate whether each element in a multi dimensional array has
+ * a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @throws DimensionError
+ */
+
+
+function validate(array, size) {
+  var isScalar = size.length === 0;
+
+  if (isScalar) {
+    // scalar
+    if (Array.isArray(array)) {
+      throw new _DimensionError.DimensionError(array.length, 0);
+    }
+  } else {
+    // array
+    _validate(array, size, 0);
+  }
+}
+/**
+ * Test whether index is an integer number with index >= 0 and index < length
+ * when length is provided
+ * @param {number} index    Zero-based index
+ * @param {number} [length] Length of the array
+ */
+
+
+function validateIndex(index, length) {
+  if (!(0, _is.isNumber)(index) || !(0, _number.isInteger)(index)) {
+    throw new TypeError('Index must be an integer (value: ' + index + ')');
+  }
+
+  if (index < 0 || typeof length === 'number' && index >= length) {
+    throw new _IndexError.IndexError(index, length);
+  }
+}
+/**
+ * Resize a multi dimensional array. The resized array is returned.
+ * @param {Array} array         Array to be resized
+ * @param {Array.<number>} size Array with the size of each dimension
+ * @param {*} [defaultValue=0]  Value to be filled in in new entries,
+ *                              zero by default. Specify for example `null`,
+ *                              to clearly see entries that are not explicitly
+ *                              set.
+ * @return {Array} array         The resized array
+ */
+
+
+function resize(array, size, defaultValue) {
+  // TODO: add support for scalars, having size=[] ?
+  // check the type of the arguments
+  if (!Array.isArray(array) || !Array.isArray(size)) {
+    throw new TypeError('Array expected');
+  }
+
+  if (size.length === 0) {
+    throw new Error('Resizing to scalar is not supported');
+  } // check whether size contains positive integers
+
+
+  size.forEach(function (value) {
+    if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value < 0) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(size) + ')');
+    }
+  }); // recursively resize the array
+
+  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;
+
+  _resize(array, size, 0, _defaultValue);
+
+  return array;
+}
+/**
+ * Recursively resize a multi dimensional array
+ * @param {Array} array         Array to be resized
+ * @param {number[]} size       Array with the size of each dimension
+ * @param {number} dim          Current dimension
+ * @param {*} [defaultValue]    Value to be filled in in new entries,
+ *                              undefined by default.
+ * @private
+ */
+
+
+function _resize(array, size, dim, defaultValue) {
+  var i;
+  var elem;
+  var oldLen = array.length;
+  var newLen = size[dim];
+  var minLen = Math.min(oldLen, newLen); // apply new length
+
+  array.length = newLen;
+
+  if (dim < size.length - 1) {
+    // non-last dimension
+    var dimNext = dim + 1; // resize existing child arrays
+
+    for (i = 0; i < minLen; i++) {
+      // resize child array
+      elem = array[i];
+
+      if (!Array.isArray(elem)) {
+        elem = [elem]; // add a dimension
+
+        array[i] = elem;
+      }
+
+      _resize(elem, size, dimNext, defaultValue);
+    } // create new child arrays
+
+
+    for (i = minLen; i < newLen; i++) {
+      // get child array
+      elem = [];
+      array[i] = elem; // resize new child array
+
+      _resize(elem, size, dimNext, defaultValue);
+    }
+  } else {
+    // last dimension
+    // remove dimensions of existing values
+    for (i = 0; i < minLen; i++) {
+      while (Array.isArray(array[i])) {
+        array[i] = array[i][0];
+      }
+    } // fill new elements with the default value
+
+
+    for (i = minLen; i < newLen; i++) {
+      array[i] = defaultValue;
+    }
+  }
+}
+/**
+ * Re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {Array.<number>} sizes  List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ *
+ * @throws {DimensionError}       If the product of the new dimension sizes does
+ *                                not equal that of the old ones
+ */
+
+
+function reshape(array, sizes) {
+  var flatArray = flatten(array);
+  var currentLength = flatArray.length;
+
+  if (!Array.isArray(array) || !Array.isArray(sizes)) {
+    throw new TypeError('Array expected');
+  }
+
+  if (sizes.length === 0) {
+    throw new _DimensionError.DimensionError(0, currentLength, '!=');
+  }
+
+  sizes = processSizesWildcard(sizes, currentLength);
+  var newLength = product(sizes);
+
+  if (currentLength !== newLength) {
+    throw new _DimensionError.DimensionError(newLength, currentLength, '!=');
+  }
+
+  try {
+    return _reshape(flatArray, sizes);
+  } catch (e) {
+    if (e instanceof _DimensionError.DimensionError) {
+      throw new _DimensionError.DimensionError(newLength, currentLength, '!=');
+    }
+
+    throw e;
+  }
+}
+/**
+ * Replaces the wildcard -1 in the sizes array.
+ * @param {Array.<number>} sizes  List of sizes for each dimension. At most on wildcard.
+ * @param {number} currentLength  Number of elements in the array.
+ * @throws {Error}                If more than one wildcard or unable to replace it.
+ * @returns {Array.<number>}      The sizes array with wildcard replaced.
+ */
+
+
+function processSizesWildcard(sizes, currentLength) {
+  var newLength = product(sizes);
+  var processedSizes = sizes.slice();
+  var WILDCARD = -1;
+  var wildCardIndex = sizes.indexOf(WILDCARD);
+  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;
+
+  if (isMoreThanOneWildcard) {
+    throw new Error('More than one wildcard in sizes');
+  }
+
+  var hasWildcard = wildCardIndex >= 0;
+  var canReplaceWildcard = currentLength % newLength === 0;
+
+  if (hasWildcard) {
+    if (canReplaceWildcard) {
+      processedSizes[wildCardIndex] = -currentLength / newLength;
+    } else {
+      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);
+    }
+  }
+
+  return processedSizes;
+}
+/**
+ * Computes the product of all array elements.
+ * @param {Array<number>} array Array of factors
+ * @returns {number}            Product of all elements
+ */
+
+
+function product(array) {
+  return array.reduce(function (prev, curr) {
+    return prev * curr;
+  }, 1);
+}
+/**
+ * Iteratively re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {Array.<number>} sizes  List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ */
+
+
+function _reshape(array, sizes) {
+  // testing if there are enough elements for the requested shape
+  var tmpArray = array;
+  var tmpArray2; // for each dimensions starting by the last one and ignoring the first one
+
+  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {
+    var size = sizes[sizeIndex];
+    tmpArray2 = []; // aggregate the elements of the current tmpArray in elements of the requested size
+
+    var length = tmpArray.length / size;
+
+    for (var i = 0; i < length; i++) {
+      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));
+    } // set it as the new tmpArray for the next loop turn or for return
+
+
+    tmpArray = tmpArray2;
+  }
+
+  return tmpArray;
+}
+/**
+ * Squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {Array} [size]
+ * @returns {Array} returns the array itself
+ */
+
+
+function squeeze(array, size) {
+  var s = size || arraySize(array); // squeeze outer dimensions
+
+  while (Array.isArray(array) && array.length === 1) {
+    array = array[0];
+    s.shift();
+  } // find the first dimension to be squeezed
+
+
+  var dims = s.length;
+
+  while (s[dims - 1] === 1) {
+    dims--;
+  } // squeeze inner dimensions
+
+
+  if (dims < s.length) {
+    array = _squeeze(array, dims, 0);
+    s.length = dims;
+  }
+
+  return array;
+}
+/**
+ * Recursively squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the squeezed array
+ * @private
+ */
+
+
+function _squeeze(array, dims, dim) {
+  var i, ii;
+
+  if (dim < dims) {
+    var next = dim + 1;
+
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _squeeze(array[i], dims, next);
+    }
+  } else {
+    while (Array.isArray(array)) {
+      array = array[0];
+    }
+  }
+
+  return array;
+}
+/**
+ * Unsqueeze a multi dimensional array: add dimensions when missing
+ *
+ * Paramter `size` will be mutated to match the new, unqueezed matrix size.
+ *
+ * @param {Array} array
+ * @param {number} dims       Desired number of dimensions of the array
+ * @param {number} [outer]    Number of outer dimensions to be added
+ * @param {Array} [size] Current size of array.
+ * @returns {Array} returns the array itself
+ * @private
+ */
+
+
+function unsqueeze(array, dims, outer, size) {
+  var s = size || arraySize(array); // unsqueeze outer dimensions
+
+  if (outer) {
+    for (var i = 0; i < outer; i++) {
+      array = [array];
+      s.unshift(1);
+    }
+  } // unsqueeze inner dimensions
+
+
+  array = _unsqueeze(array, dims, 0);
+
+  while (s.length < dims) {
+    s.push(1);
+  }
+
+  return array;
+}
+/**
+ * Recursively unsqueeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the squeezed array
+ * @private
+ */
+
+
+function _unsqueeze(array, dims, dim) {
+  var i, ii;
+
+  if (Array.isArray(array)) {
+    var next = dim + 1;
+
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _unsqueeze(array[i], dims, next);
+    }
+  } else {
+    for (var d = dim; d < dims; d++) {
+      array = [array];
+    }
+  }
+
+  return array;
+}
+/**
+ * Flatten a multi dimensional array, put all elements in a one dimensional
+ * array
+ * @param {Array} array   A multi dimensional array
+ * @return {Array}        The flattened array (1 dimensional)
+ */
+
+
+function flatten(array) {
+  if (!Array.isArray(array)) {
+    // if not an array, return as is
+    return array;
+  }
+
+  var flat = [];
+  array.forEach(function callback(value) {
+    if (Array.isArray(value)) {
+      value.forEach(callback); // traverse through sub-arrays recursively
+    } else {
+      flat.push(value);
+    }
+  });
+  return flat;
+}
+/**
+ * A safe map
+ * @param {Array} array
+ * @param {function} callback
+ */
+
+
+function map(array, callback) {
+  return Array.prototype.map.call(array, callback);
+}
+/**
+ * A safe forEach
+ * @param {Array} array
+ * @param {function} callback
+ */
+
+
+function forEach(array, callback) {
+  Array.prototype.forEach.call(array, callback);
+}
+/**
+ * A safe filter
+ * @param {Array} array
+ * @param {function} callback
+ */
+
+
+function filter(array, callback) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+
+  return Array.prototype.filter.call(array, callback);
+}
+/**
+ * Filter values in a callback given a regular expression
+ * @param {Array} array
+ * @param {RegExp} regexp
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+
+
+function filterRegExp(array, regexp) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+
+  return Array.prototype.filter.call(array, function (entry) {
+    return regexp.test(entry);
+  });
+}
+/**
+ * A safe join
+ * @param {Array} array
+ * @param {string} separator
+ */
+
+
+function join(array, separator) {
+  return Array.prototype.join.call(array, separator);
+}
+/**
+ * Assign a numeric identifier to every element of a sorted array
+ * @param {Array} a  An array
+ * @return {Array} An array of objects containing the original value and its identifier
+ */
+
+
+function identify(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+
+  if (a.length === 0) {
+    return a;
+  }
+
+  var b = [];
+  var count = 0;
+  b[0] = {
+    value: a[0],
+    identifier: 0
+  };
+
+  for (var i = 1; i < a.length; i++) {
+    if (a[i] === a[i - 1]) {
+      count++;
+    } else {
+      count = 0;
+    }
+
+    b.push({
+      value: a[i],
+      identifier: count
+    });
+  }
+
+  return b;
+}
+/**
+ * Remove the numeric identifier from the elements
+ * @param {array} a  An array
+ * @return {array} An array of values without identifiers
+ */
+
+
+function generalize(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+
+  if (a.length === 0) {
+    return a;
+  }
+
+  var b = [];
+
+  for (var i = 0; i < a.length; i++) {
+    b.push(a[i].value);
+  }
+
+  return b;
+}
+/**
+ * Check the datatype of a given object
+ * This is a low level implementation that should only be used by
+ * parent Matrix classes such as SparseMatrix or DenseMatrix
+ * This method does not validate Array Matrix shape
+ * @param {Array} array
+ * @param {function} typeOf   Callback function to use to determine the type of a value
+ * @return {string}
+ */
+
+
+function getArrayDataType(array, typeOf) {
+  var type; // to hold type info
+
+  var length = 0; // to hold length value to ensure it has consistent sizes
+
+  for (var i = 0; i < array.length; i++) {
+    var item = array[i];
+    var isArray = Array.isArray(item); // Saving the target matrix row size
+
+    if (i === 0 && isArray) {
+      length = item.length;
+    } // If the current item is an array but the length does not equal the targetVectorSize
+
+
+    if (isArray && item.length !== length) {
+      return undefined;
+    }
+
+    var itemType = isArray ? getArrayDataType(item, typeOf) // recurse into a nested array
+    : typeOf(item);
+
+    if (type === undefined) {
+      type = itemType; // first item
+    } else if (type !== itemType) {
+      return 'mixed';
+    } else {// we're good, everything has the same type so far
+    }
+  }
+
+  return type;
+}
+/**
+ * Return the last item from an array
+ * @param array
+ * @returns {*}
+ */
+
+
+function last(array) {
+  return array[array.length - 1];
+}
+/**
+ * Get all but the last element of array.
+ */
+
+
+function initial(array) {
+  return array.slice(0, array.length - 1);
+}
+/**
+ * Test whether an array or string contains an item
+ * @param {Array | string} array
+ * @param {*} item
+ * @return {boolean}
+ */
+
+
+function contains(array, item) {
+  return array.indexOf(item) !== -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/bitwise.js b/node_modules/mathjs/lib/cjs/utils/bignumber/bitwise.js
new file mode 100644
index 0000000..2415180
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/bitwise.js
@@ -0,0 +1,494 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndBigNumber = bitAndBigNumber;
+exports.bitNotBigNumber = bitNotBigNumber;
+exports.bitOrBigNumber = bitOrBigNumber;
+exports.bitXor = bitXor;
+exports.bitwise = bitwise;
+exports.leftShiftBigNumber = leftShiftBigNumber;
+exports.rightArithShiftBigNumber = rightArithShiftBigNumber;
+
+/**
+ * Bitwise and for Bignumbers
+ *
+ * Special Cases:
+ *   N &  n =  N
+ *   n &  0 =  0
+ *   n & -1 =  n
+ *   n &  n =  n
+ *   I &  I =  I
+ *  -I & -I = -I
+ *   I & -I =  0
+ *   I &  n =  n
+ *   I & -n =  I
+ *  -I &  n =  0
+ *  -I & -n = -I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` & `y`, is fully precise
+ * @private
+ */
+function bitAndBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero() || y.eq(-1) || x.eq(y)) {
+    return x;
+  }
+
+  if (y.isZero() || x.eq(-1)) {
+    return y;
+  }
+
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      if (x.isNegative() === y.isNegative()) {
+        return x;
+      }
+
+      return new BigNumber(0);
+    }
+
+    if (!x.isFinite()) {
+      if (y.isNegative()) {
+        return x;
+      }
+
+      if (x.isNegative()) {
+        return new BigNumber(0);
+      }
+
+      return y;
+    }
+
+    if (!y.isFinite()) {
+      if (x.isNegative()) {
+        return y;
+      }
+
+      if (y.isNegative()) {
+        return new BigNumber(0);
+      }
+
+      return x;
+    }
+  }
+
+  return bitwise(x, y, function (a, b) {
+    return a & b;
+  });
+}
+/**
+ * Bitwise not
+ * @param {BigNumber} x
+ * @return {BigNumber} Result of ~`x`, fully precise
+ *
+ */
+
+
+function bitNotBigNumber(x) {
+  if (x.isFinite() && !x.isInteger()) {
+    throw new Error('Integer expected in function bitNot');
+  }
+
+  var BigNumber = x.constructor;
+  var prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+  var result = x.plus(new BigNumber(1));
+  result.s = -result.s || null;
+  BigNumber.config({
+    precision: prevPrec
+  });
+  return result;
+}
+/**
+ * Bitwise OR for BigNumbers
+ *
+ * Special Cases:
+ *   N |  n =  N
+ *   n |  0 =  n
+ *   n | -1 = -1
+ *   n |  n =  n
+ *   I |  I =  I
+ *  -I | -I = -I
+ *   I | -n = -1
+ *   I | -I = -1
+ *   I |  n =  I
+ *  -I |  n = -I
+ *  -I | -n = -n
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` | `y`, fully precise
+ */
+
+
+function bitOrBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitOr');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+
+  var negOne = new BigNumber(-1);
+
+  if (x.isZero() || y.eq(negOne) || x.eq(y)) {
+    return y;
+  }
+
+  if (y.isZero() || x.eq(negOne)) {
+    return x;
+  }
+
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !x.isNegative() && y.isNegative() || x.isNegative() && !y.isNegative() && !y.isFinite()) {
+      return negOne;
+    }
+
+    if (x.isNegative() && y.isNegative()) {
+      return x.isFinite() ? x : y;
+    }
+
+    return x.isFinite() ? y : x;
+  }
+
+  return bitwise(x, y, function (a, b) {
+    return a | b;
+  });
+}
+/**
+ * Applies bitwise function to numbers
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @param {function (a, b)} func
+ * @return {BigNumber}
+ */
+
+
+function bitwise(x, y, func) {
+  var BigNumber = x.constructor;
+  var xBits, yBits;
+  var xSign = +(x.s < 0);
+  var ySign = +(y.s < 0);
+
+  if (xSign) {
+    xBits = decCoefficientToBinaryString(bitNotBigNumber(x));
+
+    for (var i = 0; i < xBits.length; ++i) {
+      xBits[i] ^= 1;
+    }
+  } else {
+    xBits = decCoefficientToBinaryString(x);
+  }
+
+  if (ySign) {
+    yBits = decCoefficientToBinaryString(bitNotBigNumber(y));
+
+    for (var _i = 0; _i < yBits.length; ++_i) {
+      yBits[_i] ^= 1;
+    }
+  } else {
+    yBits = decCoefficientToBinaryString(y);
+  }
+
+  var minBits, maxBits, minSign;
+
+  if (xBits.length <= yBits.length) {
+    minBits = xBits;
+    maxBits = yBits;
+    minSign = xSign;
+  } else {
+    minBits = yBits;
+    maxBits = xBits;
+    minSign = ySign;
+  }
+
+  var shortLen = minBits.length;
+  var longLen = maxBits.length;
+  var expFuncVal = func(xSign, ySign) ^ 1;
+  var outVal = new BigNumber(expFuncVal ^ 1);
+  var twoPower = new BigNumber(1);
+  var two = new BigNumber(2);
+  var prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+
+  while (shortLen > 0) {
+    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+
+    twoPower = twoPower.times(two);
+  }
+
+  while (longLen > 0) {
+    if (func(minSign, maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+
+    twoPower = twoPower.times(two);
+  }
+
+  BigNumber.config({
+    precision: prevPrec
+  });
+
+  if (expFuncVal === 0) {
+    outVal.s = -outVal.s;
+  }
+
+  return outVal;
+}
+/* Extracted from decimal.js, and edited to specialize. */
+
+
+function decCoefficientToBinaryString(x) {
+  // Convert to string
+  var a = x.d; // array with digits
+
+  var r = a[0] + '';
+
+  for (var i = 1; i < a.length; ++i) {
+    var s = a[i] + '';
+
+    for (var z = 7 - s.length; z--;) {
+      s = '0' + s;
+    }
+
+    r += s;
+  }
+
+  var j = r.length;
+
+  while (r.charAt(j) === '0') {
+    j--;
+  }
+
+  var xe = x.e;
+  var str = r.slice(0, j + 1 || 1);
+  var strL = str.length;
+
+  if (xe > 0) {
+    if (++xe > strL) {
+      // Append zeros.
+      xe -= strL;
+
+      while (xe--) {
+        str += '0';
+      }
+    } else if (xe < strL) {
+      str = str.slice(0, xe) + '.' + str.slice(xe);
+    }
+  } // Convert from base 10 (decimal) to base 2
+
+
+  var arr = [0];
+
+  for (var _i2 = 0; _i2 < str.length;) {
+    var arrL = arr.length;
+
+    while (arrL--) {
+      arr[arrL] *= 10;
+    }
+
+    arr[0] += parseInt(str.charAt(_i2++)); // convert to int
+
+    for (var _j = 0; _j < arr.length; ++_j) {
+      if (arr[_j] > 1) {
+        if (arr[_j + 1] === null || arr[_j + 1] === undefined) {
+          arr[_j + 1] = 0;
+        }
+
+        arr[_j + 1] += arr[_j] >> 1;
+        arr[_j] &= 1;
+      }
+    }
+  }
+
+  return arr.reverse();
+}
+/**
+ * Bitwise XOR for BigNumbers
+ *
+ * Special Cases:
+ *   N ^  n =  N
+ *   n ^  0 =  n
+ *   n ^  n =  0
+ *   n ^ -1 = ~n
+ *   I ^  n =  I
+ *   I ^ -n = -I
+ *   I ^ -I = -1
+ *  -I ^  n = -I
+ *  -I ^ -n =  I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` ^ `y`, fully precise
+ *
+ */
+
+
+function bitXor(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitXor');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero()) {
+    return y;
+  }
+
+  if (y.isZero()) {
+    return x;
+  }
+
+  if (x.eq(y)) {
+    return new BigNumber(0);
+  }
+
+  var negOne = new BigNumber(-1);
+
+  if (x.eq(negOne)) {
+    return bitNotBigNumber(y);
+  }
+
+  if (y.eq(negOne)) {
+    return bitNotBigNumber(x);
+  }
+
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      return negOne;
+    }
+
+    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);
+  }
+
+  return bitwise(x, y, function (a, b) {
+    return a ^ b;
+  });
+}
+/**
+ * Bitwise left shift
+ *
+ * Special Cases:
+ *  n << -n = N
+ *  n <<  N = N
+ *  N <<  n = N
+ *  n <<  0 = n
+ *  0 <<  n = 0
+ *  I <<  I = N
+ *  I <<  n = I
+ *  n <<  I = I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` << `y`
+ *
+ */
+
+
+function leftShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function leftShift');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+
+  if (!x.isFinite() && !y.isFinite()) {
+    return new BigNumber(NaN);
+  } // Math.pow(2, y) is fully precise for y < 55, and fast
+
+
+  if (y.lt(55)) {
+    return x.times(Math.pow(2, y.toNumber()) + '');
+  }
+
+  return x.times(new BigNumber(2).pow(y));
+}
+/*
+ * Special Cases:
+ *   n >> -n =  N
+ *   n >>  N =  N
+ *   N >>  n =  N
+ *   I >>  I =  N
+ *   n >>  0 =  n
+ *   I >>  n =  I
+ *  -I >>  n = -I
+ *  -I >>  I = -I
+ *   n >>  I =  I
+ *  -n >>  I = -1
+ *   0 >>  n =  0
+ *
+ * @param {BigNumber} value
+ * @param {BigNumber} value
+ * @return {BigNumber} Result of `x` >> `y`
+ *
+ */
+
+
+function rightArithShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+
+  if (!y.isFinite()) {
+    if (x.isNegative()) {
+      return new BigNumber(-1);
+    }
+
+    if (!x.isFinite()) {
+      return new BigNumber(NaN);
+    }
+
+    return new BigNumber(0);
+  } // Math.pow(2, y) is fully precise for y < 55, and fast
+
+
+  if (y.lt(55)) {
+    return x.div(Math.pow(2, y.toNumber()) + '').floor();
+  }
+
+  return x.div(new BigNumber(2).pow(y)).floor();
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/constants.js b/node_modules/mathjs/lib/cjs/utils/bignumber/constants.js
new file mode 100644
index 0000000..5d5cea0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/constants.js
@@ -0,0 +1,69 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBigNumberTau = exports.createBigNumberPi = exports.createBigNumberPhi = exports.createBigNumberE = void 0;
+
+var _function = require("../function.js");
+
+/**
+ * Calculate BigNumber e
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns e
+ */
+var createBigNumberE = (0, _function.memoize)(function (BigNumber) {
+  return new BigNumber(1).exp();
+}, {
+  hasher: hasher
+});
+/**
+ * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns phi
+ */
+
+exports.createBigNumberE = createBigNumberE;
+var createBigNumberPhi = (0, _function.memoize)(function (BigNumber) {
+  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);
+}, {
+  hasher: hasher
+});
+/**
+ * Calculate BigNumber pi.
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns pi
+ */
+
+exports.createBigNumberPhi = createBigNumberPhi;
+var createBigNumberPi = (0, _function.memoize)(function (BigNumber) {
+  return BigNumber.acos(-1);
+}, {
+  hasher: hasher
+});
+/**
+ * Calculate BigNumber tau, tau = 2 * pi
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns tau
+ */
+
+exports.createBigNumberPi = createBigNumberPi;
+var createBigNumberTau = (0, _function.memoize)(function (BigNumber) {
+  return createBigNumberPi(BigNumber).times(2);
+}, {
+  hasher: hasher
+});
+/**
+ * Create a hash for a BigNumber constructor function. The created has is
+ * the configured precision
+ * @param {Array} args         Supposed to contain a single entry with
+ *                             a BigNumber constructor
+ * @return {number} precision
+ * @private
+ */
+
+exports.createBigNumberTau = createBigNumberTau;
+
+function hasher(args) {
+  return args[0].precision;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/formatter.js b/node_modules/mathjs/lib/cjs/utils/bignumber/formatter.js
new file mode 100644
index 0000000..18e9f87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/formatter.js
@@ -0,0 +1,285 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.format = format;
+exports.toEngineering = toEngineering;
+exports.toExponential = toExponential;
+exports.toFixed = toFixed;
+
+var _number = require("../number.js");
+
+/**
+ * Formats a BigNumber in a given base
+ * @param {BigNumber} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+function formatBigNumberToBase(n, base, size) {
+  var BigNumberCtor = n.constructor;
+  var big2 = new BigNumberCtor(2);
+  var suffix = '';
+
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+
+    if (!(0, _number.isInteger)(size)) {
+      throw new Error('size must be an integer');
+    }
+
+    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {
+      throw new Error("Value must be in range [-2^".concat(size - 1, ", 2^").concat(size - 1, "-1]"));
+    }
+
+    if (!n.isInteger()) {
+      throw new Error('Value must be an integer');
+    }
+
+    if (n.lessThan(0)) {
+      n = n.add(big2.pow(size));
+    }
+
+    suffix = "i".concat(size);
+  }
+
+  switch (base) {
+    case 2:
+      return "".concat(n.toBinary()).concat(suffix);
+
+    case 8:
+      return "".concat(n.toOctal()).concat(suffix);
+
+    case 16:
+      return "".concat(n.toHexadecimal()).concat(suffix);
+
+    default:
+      throw new Error("Base ".concat(base, " not supported "));
+  }
+}
+/**
+ * Convert a BigNumber to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lower` and `upper` bounds, and uses
+ *                                          exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+ *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'
+ *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'
+ *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'
+ *
+ * @param {BigNumber} value
+ * @param {Object | Function | number} [options]
+ * @return {string} str The formatted value
+ */
+
+
+function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  } // handle special cases
+
+
+  if (!value.isFinite()) {
+    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';
+  } // default values for options
+
+
+  var notation = 'auto';
+  var precision;
+  var wordSize;
+
+  if (options !== undefined) {
+    // determine notation from options
+    if (options.notation) {
+      notation = options.notation;
+    } // determine precision from options
+
+
+    if (typeof options === 'number') {
+      precision = options;
+    } else if (options.precision) {
+      precision = options.precision;
+    }
+
+    if (options.wordSize) {
+      wordSize = options.wordSize;
+
+      if (typeof wordSize !== 'number') {
+        throw new Error('Option "wordSize" must be a number');
+      }
+    }
+  } // handle the various notations
+
+
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+
+    case 'exponential':
+      return toExponential(value, precision);
+
+    case 'engineering':
+      return toEngineering(value, precision);
+
+    case 'bin':
+      return formatBigNumberToBase(value, 2, wordSize);
+
+    case 'oct':
+      return formatBigNumberToBase(value, 8, wordSize);
+
+    case 'hex':
+      return formatBigNumberToBase(value, 16, wordSize);
+
+    case 'auto':
+      {
+        // determine lower and upper bound for exponential notation.
+        // TODO: implement support for upper and lower to be BigNumbers themselves
+        var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;
+        var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5; // handle special case zero
+
+        if (value.isZero()) return '0'; // determine whether or not to output exponential notation
+
+        var str;
+        var rounded = value.toSignificantDigits(precision);
+        var exp = rounded.e;
+
+        if (exp >= lowerExp && exp < upperExp) {
+          // normal number notation
+          str = rounded.toFixed();
+        } else {
+          // exponential notation
+          str = toExponential(value, precision);
+        } // remove trailing zeros after the decimal point
+
+
+        return str.replace(/((\.\d*?)(0+))($|e)/, function () {
+          var digits = arguments[2];
+          var e = arguments[4];
+          return digits !== '.' ? digits + e : e;
+        });
+      }
+
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+/**
+ * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {BigNumber | string} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+
+
+function toEngineering(value, precision) {
+  // find nearest lower multiple of 3 for exponent
+  var e = value.e;
+  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3; // find difference in exponents, and calculate the value without exponent
+
+  var valueWithoutExp = value.mul(Math.pow(10, -newExp));
+  var valueStr = valueWithoutExp.toPrecision(precision);
+
+  if (valueStr.indexOf('e') !== -1) {
+    valueStr = valueWithoutExp.toString();
+  }
+
+  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+}
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {BigNumber} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ * @returns {string} str
+ */
+
+
+function toExponential(value, precision) {
+  if (precision !== undefined) {
+    return value.toExponential(precision - 1); // Note the offset of one
+  } else {
+    return value.toExponential();
+  }
+}
+/**
+ * Format a number with fixed notation.
+ * @param {BigNumber} value
+ * @param {number} [precision=undefined] Optional number of decimals after the
+ *                                       decimal point. Undefined by default.
+ */
+
+
+function toFixed(value, precision) {
+  return value.toFixed(precision);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/nearlyEqual.js b/node_modules/mathjs/lib/cjs/utils/bignumber/nearlyEqual.js
new file mode 100644
index 0000000..3b3ca70
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/nearlyEqual.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nearlyEqual = nearlyEqual;
+
+/**
+ * Compares two BigNumbers.
+ * @param {BigNumber} x       First value to compare
+ * @param {BigNumber} y       Second value to compare
+ * @param {number} [epsilon]  The maximum relative difference between x and y
+ *                            If epsilon is undefined or null, the function will
+ *                            test whether x and y are exactly equal.
+ * @return {boolean} whether the two numbers are nearly equal
+ */
+function nearlyEqual(x, y, epsilon) {
+  // if epsilon is null or undefined, test whether x and y are exactly equal
+  if (epsilon === null || epsilon === undefined) {
+    return x.eq(y);
+  } // use "==" operator, handles infinities
+
+
+  if (x.eq(y)) {
+    return true;
+  } // NaN
+
+
+  if (x.isNaN() || y.isNaN()) {
+    return false;
+  } // at this point x and y should be finite
+
+
+  if (x.isFinite() && y.isFinite()) {
+    // check numbers are very close, needed when comparing numbers near zero
+    var diff = x.minus(y).abs();
+
+    if (diff.isZero()) {
+      return true;
+    } else {
+      // use relative error
+      var max = x.constructor.max(x.abs(), y.abs());
+      return diff.lte(max.times(epsilon));
+    }
+  } // Infinite and Number or negative Infinite and positive Infinite cases
+
+
+  return false;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/collection.js b/node_modules/mathjs/lib/cjs/utils/collection.js
new file mode 100644
index 0000000..fd69a6e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/collection.js
@@ -0,0 +1,205 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.containsCollections = containsCollections;
+exports.deepForEach = deepForEach;
+exports.deepMap = deepMap;
+exports.reduce = reduce;
+exports.scatter = scatter;
+
+var _is = require("./is.js");
+
+var _IndexError = require("../error/IndexError.js");
+
+var _array = require("./array.js");
+
+var _switch2 = require("./switch.js");
+
+/**
+ * Test whether an array contains collections
+ * @param {Array} array
+ * @returns {boolean} Returns true when the array contains one or multiple
+ *                    collections (Arrays or Matrices). Returns false otherwise.
+ */
+function containsCollections(array) {
+  for (var i = 0; i < array.length; i++) {
+    if ((0, _is.isCollection)(array[i])) {
+      return true;
+    }
+  }
+
+  return false;
+}
+/**
+ * Recursively loop over all elements in a given multi dimensional array
+ * and invoke the callback on each of the elements.
+ * @param {Array | Matrix} array
+ * @param {Function} callback     The callback method is invoked with one
+ *                                parameter: the current element in the array
+ */
+
+
+function deepForEach(array, callback) {
+  if ((0, _is.isMatrix)(array)) {
+    array = array.valueOf();
+  }
+
+  for (var i = 0, ii = array.length; i < ii; i++) {
+    var value = array[i];
+
+    if (Array.isArray(value)) {
+      deepForEach(value, callback);
+    } else {
+      callback(value);
+    }
+  }
+}
+/**
+ * Execute the callback function element wise for each element in array and any
+ * nested array
+ * Returns an array with the results
+ * @param {Array | Matrix} array
+ * @param {Function} callback   The callback is called with two parameters:
+ *                              value1 and value2, which contain the current
+ *                              element of both arrays.
+ * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+ *
+ * @return {Array | Matrix} res
+ */
+
+
+function deepMap(array, callback, skipZeros) {
+  if (array && typeof array.map === 'function') {
+    // TODO: replace array.map with a for loop to improve performance
+    return array.map(function (x) {
+      return deepMap(x, callback, skipZeros);
+    });
+  } else {
+    return callback(array);
+  }
+}
+/**
+ * Reduce a given matrix or array to a new matrix or
+ * array with one less dimension, applying the given
+ * callback in the selected dimension.
+ * @param {Array | Matrix} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @return {Array | Matrix} res
+ */
+
+
+function reduce(mat, dim, callback) {
+  var size = Array.isArray(mat) ? (0, _array.arraySize)(mat) : mat.size();
+
+  if (dim < 0 || dim >= size.length) {
+    // TODO: would be more clear when throwing a DimensionError here
+    throw new _IndexError.IndexError(dim, size.length);
+  }
+
+  if ((0, _is.isMatrix)(mat)) {
+    return mat.create(_reduce(mat.valueOf(), dim, callback));
+  } else {
+    return _reduce(mat, dim, callback);
+  }
+}
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+
+
+function _reduce(mat, dim, callback) {
+  var i, ret, val, tran;
+
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      val = mat[0];
+
+      for (i = 1; i < mat.length; i++) {
+        val = callback(val, mat[i]);
+      }
+
+      return val;
+    } else {
+      tran = (0, _switch2._switch)(mat);
+      ret = [];
+
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _reduce(tran[i], dim - 1, callback);
+      }
+
+      return ret;
+    }
+  } else {
+    ret = [];
+
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _reduce(mat[i], dim - 1, callback);
+    }
+
+    return ret;
+  }
+} // TODO: document function scatter
+
+
+function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr; // vars
+
+  var k, k0, k1, i; // check we need to process values (pattern matrix)
+
+  if (x) {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k]; // check value exists in current j
+
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark; // add i to pattern of C
+
+        cindex.push(i); // x(i) = A, check we need to call function this time
+
+        if (update) {
+          // copy value to workspace calling callback function
+          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]); // function was called on current row
+
+          u[i] = mark;
+        } else {
+          // copy value to workspace
+          x[i] = avalues[k];
+        }
+      } else {
+        // i exists in C already
+        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]); // function was called on current row
+
+        u[i] = mark;
+      }
+    }
+  } else {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k]; // check value exists in current j
+
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark; // add i to pattern of C
+
+        cindex.push(i);
+      } else {
+        // indicate function was called on current row
+        u[i] = mark;
+      }
+    }
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/complex.js b/node_modules/mathjs/lib/cjs/utils/complex.js
new file mode 100644
index 0000000..72448d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/complex.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.complexEquals = complexEquals;
+
+var _number = require("./number.js");
+
+/**
+ * Test whether two complex values are equal provided a given epsilon.
+ * Does not use or change the global Complex.EPSILON setting
+ * @param {Complex} x
+ * @param {Complex} y
+ * @param {number} epsilon
+ * @returns {boolean}
+ */
+function complexEquals(x, y, epsilon) {
+  return (0, _number.nearlyEqual)(x.re, y.re, epsilon) && (0, _number.nearlyEqual)(x.im, y.im, epsilon);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/customs.js b/node_modules/mathjs/lib/cjs/utils/customs.js
new file mode 100644
index 0000000..140185b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/customs.js
@@ -0,0 +1,185 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getSafeProperties = getSafeProperties;
+exports.getSafeProperty = getSafeProperty;
+exports.hasSafeProperty = hasSafeProperty;
+exports.isPlainObject = isPlainObject;
+exports.isSafeMethod = isSafeMethod;
+exports.isSafeProperty = isSafeProperty;
+exports.setSafeProperty = setSafeProperty;
+exports.validateSafeMethod = validateSafeMethod;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _object = require("./object.js");
+
+/**
+ * Get a property of a plain object
+ * Throws an error in case the object is not a plain object or the
+ * property is not defined on the object itself
+ * @param {Object} object
+ * @param {string} prop
+ * @return {*} Returns the property value when safe
+ */
+function getSafeProperty(object, prop) {
+  // only allow getting safe properties of a plain object
+  if (isPlainObject(object) && isSafeProperty(object, prop)) {
+    return object[prop];
+  }
+
+  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {
+    throw new Error('Cannot access method "' + prop + '" as a property');
+  }
+
+  throw new Error('No access to property "' + prop + '"');
+}
+/**
+ * Set a property on a plain object.
+ * Throws an error in case the object is not a plain object or the
+ * property would override an inherited property like .constructor or .toString
+ * @param {Object} object
+ * @param {string} prop
+ * @param {*} value
+ * @return {*} Returns the value
+ */
+// TODO: merge this function into access.js?
+
+
+function setSafeProperty(object, prop, value) {
+  // only allow setting safe properties of a plain object
+  if (isPlainObject(object) && isSafeProperty(object, prop)) {
+    object[prop] = value;
+    return value;
+  }
+
+  throw new Error('No access to property "' + prop + '"');
+}
+
+function getSafeProperties(object) {
+  return Object.keys(object).filter(function (prop) {
+    return (0, _object.hasOwnProperty)(object, prop);
+  });
+}
+
+function hasSafeProperty(object, prop) {
+  return prop in object;
+}
+/**
+ * Test whether a property is safe to use for an object.
+ * For example .toString and .constructor are not safe
+ * @param {string} prop
+ * @return {boolean} Returns true when safe
+ */
+
+
+function isSafeProperty(object, prop) {
+  if (!object || (0, _typeof2.default)(object) !== 'object') {
+    return false;
+  } // SAFE: whitelisted
+  // e.g length
+
+
+  if ((0, _object.hasOwnProperty)(safeNativeProperties, prop)) {
+    return true;
+  } // UNSAFE: inherited from Object prototype
+  // e.g constructor
+
+
+  if (prop in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  } // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+
+
+  if (prop in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+
+  return true;
+}
+/**
+ * Validate whether a method is safe.
+ * Throws an error when that's not the case.
+ * @param {Object} object
+ * @param {string} method
+ */
+// TODO: merge this function into assign.js?
+
+
+function validateSafeMethod(object, method) {
+  if (!isSafeMethod(object, method)) {
+    throw new Error('No access to method "' + method + '"');
+  }
+}
+/**
+ * Check whether a method is safe.
+ * Throws an error when that's not the case (for example for `constructor`).
+ * @param {Object} object
+ * @param {string} method
+ * @return {boolean} Returns true when safe, false otherwise
+ */
+
+
+function isSafeMethod(object, method) {
+  if (object === null || object === undefined || typeof object[method] !== 'function') {
+    return false;
+  } // UNSAFE: ghosted
+  // e.g overridden toString
+  // Note that IE10 doesn't support __proto__ and we can't do this check there.
+
+
+  if ((0, _object.hasOwnProperty)(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {
+    return false;
+  } // SAFE: whitelisted
+  // e.g toString
+
+
+  if ((0, _object.hasOwnProperty)(safeNativeMethods, method)) {
+    return true;
+  } // UNSAFE: inherited from Object prototype
+  // e.g constructor
+
+
+  if (method in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  } // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+
+
+  if (method in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+
+  return true;
+}
+
+function isPlainObject(object) {
+  return (0, _typeof2.default)(object) === 'object' && object && object.constructor === Object;
+}
+
+var safeNativeProperties = {
+  length: true,
+  name: true
+};
+var safeNativeMethods = {
+  toString: true,
+  valueOf: true,
+  toLocaleString: true
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/emitter.js b/node_modules/mathjs/lib/cjs/utils/emitter.js
new file mode 100644
index 0000000..fed9499
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/emitter.js
@@ -0,0 +1,26 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mixin = mixin;
+
+var _tinyEmitter = _interopRequireDefault(require("tiny-emitter"));
+
+/**
+ * Extend given object with emitter functions `on`, `off`, `once`, `emit`
+ * @param {Object} obj
+ * @return {Object} obj
+ */
+function mixin(obj) {
+  // create event emitter
+  var emitter = new _tinyEmitter.default(); // bind methods to obj (we don't want to expose the emitter.e Array...)
+
+  obj.on = emitter.on.bind(emitter);
+  obj.off = emitter.off.bind(emitter);
+  obj.once = emitter.once.bind(emitter);
+  obj.emit = emitter.emit.bind(emitter);
+  return obj;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/factory.js b/node_modules/mathjs/lib/cjs/utils/factory.js
new file mode 100644
index 0000000..8888716
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/factory.js
@@ -0,0 +1,169 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.assertDependencies = assertDependencies;
+exports.create = create;
+exports.factory = factory;
+exports.isFactory = isFactory;
+exports.isOptionalDependency = isOptionalDependency;
+exports.sortFactories = sortFactories;
+exports.stripOptionalNotation = stripOptionalNotation;
+
+var _array = require("./array.js");
+
+var _object = require("./object.js");
+
+/**
+ * Create a factory function, which can be used to inject dependencies.
+ *
+ * The created functions are memoized, a consecutive call of the factory
+ * with the exact same inputs will return the same function instance.
+ * The memoized cache is exposed on `factory.cache` and can be cleared
+ * if needed.
+ *
+ * Example:
+ *
+ *     const name = 'log'
+ *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']
+ *
+ *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {
+ *       // ... create the function log here and return it
+ *     }
+ *
+ * @param {string} name           Name of the function to be created
+ * @param {string[]} dependencies The names of all required dependencies
+ * @param {function} create       Callback function called with an object with all dependencies
+ * @param {Object} [meta]         Optional object with meta information that will be attached
+ *                                to the created factory function as property `meta`.
+ * @returns {function}
+ */
+function factory(name, dependencies, create, meta) {
+  function assertAndCreate(scope) {
+    // we only pass the requested dependencies to the factory function
+    // to prevent functions to rely on dependencies that are not explicitly
+    // requested.
+    var deps = (0, _object.pickShallow)(scope, dependencies.map(stripOptionalNotation));
+    assertDependencies(name, dependencies, scope);
+    return create(deps);
+  }
+
+  assertAndCreate.isFactory = true;
+  assertAndCreate.fn = name;
+  assertAndCreate.dependencies = dependencies.slice().sort();
+
+  if (meta) {
+    assertAndCreate.meta = meta;
+  }
+
+  return assertAndCreate;
+}
+/**
+ * Sort all factories such that when loading in order, the dependencies are resolved.
+ *
+ * @param {Array} factories
+ * @returns {Array} Returns a new array with the sorted factories.
+ */
+
+
+function sortFactories(factories) {
+  var factoriesByName = {};
+  factories.forEach(function (factory) {
+    factoriesByName[factory.fn] = factory;
+  });
+
+  function containsDependency(factory, dependency) {
+    // TODO: detect circular references
+    if (isFactory(factory)) {
+      if ((0, _array.contains)(factory.dependencies, dependency.fn || dependency.name)) {
+        return true;
+      }
+
+      if (factory.dependencies.some(function (d) {
+        return containsDependency(factoriesByName[d], dependency);
+      })) {
+        return true;
+      }
+    }
+
+    return false;
+  }
+
+  var sorted = [];
+
+  function addFactory(factory) {
+    var index = 0;
+
+    while (index < sorted.length && !containsDependency(sorted[index], factory)) {
+      index++;
+    }
+
+    sorted.splice(index, 0, factory);
+  } // sort regular factory functions
+
+
+  factories.filter(isFactory).forEach(addFactory); // sort legacy factory functions AFTER the regular factory functions
+
+  factories.filter(function (factory) {
+    return !isFactory(factory);
+  }).forEach(addFactory);
+  return sorted;
+} // TODO: comment or cleanup if unused in the end
+
+
+function create(factories) {
+  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  sortFactories(factories).forEach(function (factory) {
+    return factory(scope);
+  });
+  return scope;
+}
+/**
+ * Test whether an object is a factory. This is the case when it has
+ * properties name, dependencies, and a function create.
+ * @param {*} obj
+ * @returns {boolean}
+ */
+
+
+function isFactory(obj) {
+  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);
+}
+/**
+ * Assert that all dependencies of a list with dependencies are available in the provided scope.
+ *
+ * Will throw an exception when there are dependencies missing.
+ *
+ * @param {string} name   Name for the function to be created. Used to generate a useful error message
+ * @param {string[]} dependencies
+ * @param {Object} scope
+ */
+
+
+function assertDependencies(name, dependencies, scope) {
+  var allDefined = dependencies.filter(function (dependency) {
+    return !isOptionalDependency(dependency);
+  }) // filter optionals
+  .every(function (dependency) {
+    return scope[dependency] !== undefined;
+  });
+
+  if (!allDefined) {
+    var missingDependencies = dependencies.filter(function (dependency) {
+      return scope[dependency] === undefined;
+    }); // TODO: create a custom error class for this, a MathjsError or something like that
+
+    throw new Error("Cannot create function \"".concat(name, "\", ") + "some dependencies are missing: ".concat(missingDependencies.map(function (d) {
+      return "\"".concat(d, "\"");
+    }).join(', '), "."));
+  }
+}
+
+function isOptionalDependency(dependency) {
+  return dependency && dependency[0] === '?';
+}
+
+function stripOptionalNotation(dependency) {
+  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/function.js b/node_modules/mathjs/lib/cjs/utils/function.js
new file mode 100644
index 0000000..3b09d44
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/function.js
@@ -0,0 +1,124 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxArgumentCount = maxArgumentCount;
+exports.memoize = memoize;
+exports.memoizeCompare = memoizeCompare;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _lruQueue = require("./lruQueue.js");
+
+// function utils
+
+/**
+ * Memoize a given function by caching the computed result.
+ * The cache of a memoized function can be cleared by deleting the `cache`
+ * property of the function.
+ *
+ * @param {function} fn                     The function to be memoized.
+ *                                          Must be a pure function.
+ * @param {Object} [options]
+ * @param {function(args: Array): string} [options.hasher]
+ *    A custom hash builder. Is JSON.stringify by default.
+ * @param {number | undefined} [options.limit]
+ *    Maximum number of values that may be cached. Undefined indicates
+ *    unlimited (default)
+ * @return {function}                       Returns the memoized function
+ */
+function memoize(fn) {
+  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
+      hasher = _ref.hasher,
+      limit = _ref.limit;
+
+  limit = limit == null ? Number.POSITIVE_INFINITY : limit;
+  hasher = hasher == null ? JSON.stringify : hasher;
+  return function memoize() {
+    if ((0, _typeof2.default)(memoize.cache) !== 'object') {
+      memoize.cache = {
+        values: new Map(),
+        lru: (0, _lruQueue.lruQueue)(limit || Number.POSITIVE_INFINITY)
+      };
+    }
+
+    var args = [];
+
+    for (var i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+
+    var hash = hasher(args);
+
+    if (memoize.cache.values.has(hash)) {
+      memoize.cache.lru.hit(hash);
+      return memoize.cache.values.get(hash);
+    }
+
+    var newVal = fn.apply(fn, args);
+    memoize.cache.values.set(hash, newVal);
+    memoize.cache.values.delete(memoize.cache.lru.hit(hash));
+    return newVal;
+  };
+}
+/**
+ * Memoize a given function by caching all results and the arguments,
+ * and comparing against the arguments of previous results before
+ * executing again.
+ * This is less performant than `memoize` which calculates a hash,
+ * which is very fast to compare. Use `memoizeCompare` only when it is
+ * not possible to create a unique serializable hash from the function
+ * arguments.
+ * The isEqual function must compare two sets of arguments
+ * and return true when equal (can be a deep equality check for example).
+ * @param {function} fn
+ * @param {function(a: *, b: *) : boolean} isEqual
+ * @returns {function}
+ */
+
+
+function memoizeCompare(fn, isEqual) {
+  var memoize = function memoize() {
+    var args = [];
+
+    for (var i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+
+    for (var c = 0; c < memoize.cache.length; c++) {
+      var cached = memoize.cache[c];
+
+      if (isEqual(args, cached.args)) {
+        // TODO: move this cache entry to the top so recently used entries move up?
+        return cached.res;
+      }
+    }
+
+    var res = fn.apply(fn, args);
+    memoize.cache.unshift({
+      args: args,
+      res: res
+    });
+    return res;
+  };
+
+  memoize.cache = [];
+  return memoize;
+}
+/**
+ * Find the maximum number of arguments expected by a typed function.
+ * @param {function} fn   A typed function
+ * @return {number} Returns the maximum number of expected arguments.
+ *                  Returns -1 when no signatures where found on the function.
+ */
+
+
+function maxArgumentCount(fn) {
+  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {
+    var count = (signature.match(/,/g) || []).length + 1;
+    return Math.max(args, count);
+  }, -1);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/is.js b/node_modules/mathjs/lib/cjs/utils/is.js
new file mode 100644
index 0000000..a32e0c0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/is.js
@@ -0,0 +1,258 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isAccessorNode = isAccessorNode;
+exports.isArray = void 0;
+exports.isArrayNode = isArrayNode;
+exports.isAssignmentNode = isAssignmentNode;
+exports.isBigNumber = isBigNumber;
+exports.isBlockNode = isBlockNode;
+exports.isBoolean = isBoolean;
+exports.isChain = isChain;
+exports.isCollection = isCollection;
+exports.isComplex = isComplex;
+exports.isConditionalNode = isConditionalNode;
+exports.isConstantNode = isConstantNode;
+exports.isDate = isDate;
+exports.isDenseMatrix = isDenseMatrix;
+exports.isFraction = isFraction;
+exports.isFunction = isFunction;
+exports.isFunctionAssignmentNode = isFunctionAssignmentNode;
+exports.isFunctionNode = isFunctionNode;
+exports.isHelp = isHelp;
+exports.isIndex = isIndex;
+exports.isIndexNode = isIndexNode;
+exports.isMatrix = isMatrix;
+exports.isNode = isNode;
+exports.isNull = isNull;
+exports.isNumber = isNumber;
+exports.isObject = isObject;
+exports.isObjectNode = isObjectNode;
+exports.isOperatorNode = isOperatorNode;
+exports.isParenthesisNode = isParenthesisNode;
+exports.isRange = isRange;
+exports.isRangeNode = isRangeNode;
+exports.isRegExp = isRegExp;
+exports.isResultSet = isResultSet;
+exports.isSparseMatrix = isSparseMatrix;
+exports.isString = isString;
+exports.isSymbolNode = isSymbolNode;
+exports.isUndefined = isUndefined;
+exports.isUnit = isUnit;
+exports.typeOf = typeOf;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+// type checks for all known types
+//
+// note that:
+//
+// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.
+//   instanceof cannot be used because that would not allow to pass data from
+//   one instance of math.js to another since each has it's own instance of Unit.
+// - check the `isUnit` property via the constructor, so there will be no
+//   matches for "fake" instances like plain objects with a property `isUnit`.
+//   That is important for security reasons.
+// - It must not be possible to override the type checks used internally,
+//   for security reasons, so these functions are not exposed in the expression
+//   parser.
+function isNumber(x) {
+  return typeof x === 'number';
+}
+
+function isBigNumber(x) {
+  if (!x || (0, _typeof2.default)(x) !== 'object' || typeof x.constructor !== 'function') {
+    return false;
+  }
+
+  if (x.isBigNumber === true && (0, _typeof2.default)(x.constructor.prototype) === 'object' && x.constructor.prototype.isBigNumber === true) {
+    return true;
+  }
+
+  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {
+    return true;
+  }
+
+  return false;
+}
+
+function isComplex(x) {
+  return x && (0, _typeof2.default)(x) === 'object' && Object.getPrototypeOf(x).isComplex === true || false;
+}
+
+function isFraction(x) {
+  return x && (0, _typeof2.default)(x) === 'object' && Object.getPrototypeOf(x).isFraction === true || false;
+}
+
+function isUnit(x) {
+  return x && x.constructor.prototype.isUnit === true || false;
+}
+
+function isString(x) {
+  return typeof x === 'string';
+}
+
+var isArray = Array.isArray;
+exports.isArray = isArray;
+
+function isMatrix(x) {
+  return x && x.constructor.prototype.isMatrix === true || false;
+}
+/**
+ * Test whether a value is a collection: an Array or Matrix
+ * @param {*} x
+ * @returns {boolean} isCollection
+ */
+
+
+function isCollection(x) {
+  return Array.isArray(x) || isMatrix(x);
+}
+
+function isDenseMatrix(x) {
+  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+
+function isSparseMatrix(x) {
+  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+
+function isRange(x) {
+  return x && x.constructor.prototype.isRange === true || false;
+}
+
+function isIndex(x) {
+  return x && x.constructor.prototype.isIndex === true || false;
+}
+
+function isBoolean(x) {
+  return typeof x === 'boolean';
+}
+
+function isResultSet(x) {
+  return x && x.constructor.prototype.isResultSet === true || false;
+}
+
+function isHelp(x) {
+  return x && x.constructor.prototype.isHelp === true || false;
+}
+
+function isFunction(x) {
+  return typeof x === 'function';
+}
+
+function isDate(x) {
+  return x instanceof Date;
+}
+
+function isRegExp(x) {
+  return x instanceof RegExp;
+}
+
+function isObject(x) {
+  return !!(x && (0, _typeof2.default)(x) === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));
+}
+
+function isNull(x) {
+  return x === null;
+}
+
+function isUndefined(x) {
+  return x === undefined;
+}
+
+function isAccessorNode(x) {
+  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isArrayNode(x) {
+  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isAssignmentNode(x) {
+  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isBlockNode(x) {
+  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isConditionalNode(x) {
+  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isConstantNode(x) {
+  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isFunctionAssignmentNode(x) {
+  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isFunctionNode(x) {
+  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isIndexNode(x) {
+  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isNode(x) {
+  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isObjectNode(x) {
+  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isOperatorNode(x) {
+  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isParenthesisNode(x) {
+  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isRangeNode(x) {
+  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isSymbolNode(x) {
+  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+function isChain(x) {
+  return x && x.constructor.prototype.isChain === true || false;
+}
+
+function typeOf(x) {
+  var t = (0, _typeof2.default)(x);
+
+  if (t === 'object') {
+    // JavaScript types
+    if (x === null) return 'null';
+    if (Array.isArray(x)) return 'Array';
+    if (x instanceof Date) return 'Date';
+    if (x instanceof RegExp) return 'RegExp'; // math.js types
+
+    if (isBigNumber(x)) return 'BigNumber';
+    if (isComplex(x)) return 'Complex';
+    if (isFraction(x)) return 'Fraction';
+    if (isMatrix(x)) return 'Matrix';
+    if (isUnit(x)) return 'Unit';
+    if (isIndex(x)) return 'Index';
+    if (isRange(x)) return 'Range';
+    if (isResultSet(x)) return 'ResultSet';
+    if (isNode(x)) return x.type;
+    if (isChain(x)) return 'Chain';
+    if (isHelp(x)) return 'Help';
+    return 'Object';
+  }
+
+  if (t === 'function') return 'Function';
+  return t; // can be 'string', 'number', 'boolean', ...
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/latex.js b/node_modules/mathjs/lib/cjs/utils/latex.js
new file mode 100644
index 0000000..bbb4cc3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/latex.js
@@ -0,0 +1,501 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.defaultTemplate = void 0;
+exports.escapeLatex = escapeLatex;
+exports.latexSymbols = exports.latexOperators = exports.latexFunctions = void 0;
+exports.toSymbol = toSymbol;
+
+var _escapeLatex = _interopRequireDefault(require("escape-latex"));
+
+var _object = require("./object.js");
+
+/* eslint no-template-curly-in-string: "off" */
+var latexSymbols = {
+  // GREEK LETTERS
+  Alpha: 'A',
+  alpha: '\\alpha',
+  Beta: 'B',
+  beta: '\\beta',
+  Gamma: '\\Gamma',
+  gamma: '\\gamma',
+  Delta: '\\Delta',
+  delta: '\\delta',
+  Epsilon: 'E',
+  epsilon: '\\epsilon',
+  varepsilon: '\\varepsilon',
+  Zeta: 'Z',
+  zeta: '\\zeta',
+  Eta: 'H',
+  eta: '\\eta',
+  Theta: '\\Theta',
+  theta: '\\theta',
+  vartheta: '\\vartheta',
+  Iota: 'I',
+  iota: '\\iota',
+  Kappa: 'K',
+  kappa: '\\kappa',
+  varkappa: '\\varkappa',
+  Lambda: '\\Lambda',
+  lambda: '\\lambda',
+  Mu: 'M',
+  mu: '\\mu',
+  Nu: 'N',
+  nu: '\\nu',
+  Xi: '\\Xi',
+  xi: '\\xi',
+  Omicron: 'O',
+  omicron: 'o',
+  Pi: '\\Pi',
+  pi: '\\pi',
+  varpi: '\\varpi',
+  Rho: 'P',
+  rho: '\\rho',
+  varrho: '\\varrho',
+  Sigma: '\\Sigma',
+  sigma: '\\sigma',
+  varsigma: '\\varsigma',
+  Tau: 'T',
+  tau: '\\tau',
+  Upsilon: "\\Upsilon",
+  upsilon: "\\upsilon",
+  Phi: '\\Phi',
+  phi: '\\phi',
+  varphi: '\\varphi',
+  Chi: 'X',
+  chi: '\\chi',
+  Psi: '\\Psi',
+  psi: '\\psi',
+  Omega: '\\Omega',
+  omega: '\\omega',
+  // logic
+  true: '\\mathrm{True}',
+  false: '\\mathrm{False}',
+  // other
+  i: 'i',
+  // TODO use \i ??
+  inf: '\\infty',
+  Inf: '\\infty',
+  infinity: '\\infty',
+  Infinity: '\\infty',
+  oo: '\\infty',
+  lim: '\\lim',
+  undefined: '\\mathbf{?}'
+};
+exports.latexSymbols = latexSymbols;
+var latexOperators = {
+  transpose: '^\\top',
+  ctranspose: '^H',
+  factorial: '!',
+  pow: '^',
+  dotPow: '.^\\wedge',
+  // TODO find ideal solution
+  unaryPlus: '+',
+  unaryMinus: '-',
+  bitNot: '\\~',
+  // TODO find ideal solution
+  not: '\\neg',
+  multiply: '\\cdot',
+  divide: '\\frac',
+  // TODO how to handle that properly?
+  dotMultiply: '.\\cdot',
+  // TODO find ideal solution
+  dotDivide: '.:',
+  // TODO find ideal solution
+  mod: '\\mod',
+  add: '+',
+  subtract: '-',
+  to: '\\rightarrow',
+  leftShift: '<<',
+  rightArithShift: '>>',
+  rightLogShift: '>>>',
+  equal: '=',
+  unequal: '\\neq',
+  smaller: '<',
+  larger: '>',
+  smallerEq: '\\leq',
+  largerEq: '\\geq',
+  bitAnd: '\\&',
+  bitXor: "\\underline{|}",
+  bitOr: '|',
+  and: '\\wedge',
+  xor: '\\veebar',
+  or: '\\vee'
+};
+exports.latexOperators = latexOperators;
+var latexFunctions = {
+  // arithmetic
+  abs: {
+    1: '\\left|${args[0]}\\right|'
+  },
+  add: {
+    2: "\\left(${args[0]}".concat(latexOperators.add, "${args[1]}\\right)")
+  },
+  cbrt: {
+    1: '\\sqrt[3]{${args[0]}}'
+  },
+  ceil: {
+    1: '\\left\\lceil${args[0]}\\right\\rceil'
+  },
+  cube: {
+    1: '\\left(${args[0]}\\right)^3'
+  },
+  divide: {
+    2: '\\frac{${args[0]}}{${args[1]}}'
+  },
+  dotDivide: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotDivide, "${args[1]}\\right)")
+  },
+  dotMultiply: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotMultiply, "${args[1]}\\right)")
+  },
+  dotPow: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotPow, "${args[1]}\\right)")
+  },
+  exp: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  expm1: "\\left(e".concat(latexOperators.pow, "{${args[0]}}-1\\right)"),
+  fix: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  floor: {
+    1: '\\left\\lfloor${args[0]}\\right\\rfloor'
+  },
+  gcd: '\\gcd\\left(${args}\\right)',
+  hypot: '\\hypot\\left(${args}\\right)',
+  log: {
+    1: '\\ln\\left(${args[0]}\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}\\right)'
+  },
+  log10: {
+    1: '\\log_{10}\\left(${args[0]}\\right)'
+  },
+  log1p: {
+    1: '\\ln\\left(${args[0]}+1\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}+1\\right)'
+  },
+  log2: '\\log_{2}\\left(${args[0]}\\right)',
+  mod: {
+    2: "\\left(${args[0]}".concat(latexOperators.mod, "${args[1]}\\right)")
+  },
+  multiply: {
+    2: "\\left(${args[0]}".concat(latexOperators.multiply, "${args[1]}\\right)")
+  },
+  norm: {
+    1: '\\left\\|${args[0]}\\right\\|',
+    2: undefined // use default template
+
+  },
+  nthRoot: {
+    2: '\\sqrt[${args[1]}]{${args[0]}}'
+  },
+  nthRoots: {
+    2: '\\{y : $y^{args[1]} = {${args[0]}}\\}'
+  },
+  pow: {
+    2: "\\left(${args[0]}\\right)".concat(latexOperators.pow, "{${args[1]}}")
+  },
+  round: {
+    1: '\\left\\lfloor${args[0]}\\right\\rceil',
+    2: undefined // use default template
+
+  },
+  sign: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  sqrt: {
+    1: '\\sqrt{${args[0]}}'
+  },
+  square: {
+    1: '\\left(${args[0]}\\right)^2'
+  },
+  subtract: {
+    2: "\\left(${args[0]}".concat(latexOperators.subtract, "${args[1]}\\right)")
+  },
+  unaryMinus: {
+    1: "".concat(latexOperators.unaryMinus, "\\left(${args[0]}\\right)")
+  },
+  unaryPlus: {
+    1: "".concat(latexOperators.unaryPlus, "\\left(${args[0]}\\right)")
+  },
+  // bitwise
+  bitAnd: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitAnd, "${args[1]}\\right)")
+  },
+  bitNot: {
+    1: latexOperators.bitNot + '\\left(${args[0]}\\right)'
+  },
+  bitOr: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitOr, "${args[1]}\\right)")
+  },
+  bitXor: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitXor, "${args[1]}\\right)")
+  },
+  leftShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.leftShift, "${args[1]}\\right)")
+  },
+  rightArithShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.rightArithShift, "${args[1]}\\right)")
+  },
+  rightLogShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.rightLogShift, "${args[1]}\\right)")
+  },
+  // combinatorics
+  bellNumbers: {
+    1: '\\mathrm{B}_{${args[0]}}'
+  },
+  catalan: {
+    1: '\\mathrm{C}_{${args[0]}}'
+  },
+  stirlingS2: {
+    2: '\\mathrm{S}\\left(${args}\\right)'
+  },
+  // complex
+  arg: {
+    1: '\\arg\\left(${args[0]}\\right)'
+  },
+  conj: {
+    1: '\\left(${args[0]}\\right)^*'
+  },
+  im: {
+    1: '\\Im\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  re: {
+    1: '\\Re\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  // logical
+  and: {
+    2: "\\left(${args[0]}".concat(latexOperators.and, "${args[1]}\\right)")
+  },
+  not: {
+    1: latexOperators.not + '\\left(${args[0]}\\right)'
+  },
+  or: {
+    2: "\\left(${args[0]}".concat(latexOperators.or, "${args[1]}\\right)")
+  },
+  xor: {
+    2: "\\left(${args[0]}".concat(latexOperators.xor, "${args[1]}\\right)")
+  },
+  // matrix
+  cross: {
+    2: '\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)'
+  },
+  ctranspose: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.ctranspose)
+  },
+  det: {
+    1: '\\det\\left(${args[0]}\\right)'
+  },
+  dot: {
+    2: '\\left(${args[0]}\\cdot${args[1]}\\right)'
+  },
+  expm: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  inv: {
+    1: '\\left(${args[0]}\\right)^{-1}'
+  },
+  sqrtm: {
+    1: "{${args[0]}}".concat(latexOperators.pow, "{\\frac{1}{2}}")
+  },
+  trace: {
+    1: '\\mathrm{tr}\\left(${args[0]}\\right)'
+  },
+  transpose: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.transpose)
+  },
+  // probability
+  combinations: {
+    2: '\\binom{${args[0]}}{${args[1]}}'
+  },
+  combinationsWithRep: {
+    2: '\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)'
+  },
+  factorial: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.factorial)
+  },
+  gamma: {
+    1: '\\Gamma\\left(${args[0]}\\right)'
+  },
+  // relational
+  equal: {
+    2: "\\left(${args[0]}".concat(latexOperators.equal, "${args[1]}\\right)")
+  },
+  larger: {
+    2: "\\left(${args[0]}".concat(latexOperators.larger, "${args[1]}\\right)")
+  },
+  largerEq: {
+    2: "\\left(${args[0]}".concat(latexOperators.largerEq, "${args[1]}\\right)")
+  },
+  smaller: {
+    2: "\\left(${args[0]}".concat(latexOperators.smaller, "${args[1]}\\right)")
+  },
+  smallerEq: {
+    2: "\\left(${args[0]}".concat(latexOperators.smallerEq, "${args[1]}\\right)")
+  },
+  unequal: {
+    2: "\\left(${args[0]}".concat(latexOperators.unequal, "${args[1]}\\right)")
+  },
+  // special
+  erf: {
+    1: 'erf\\left(${args[0]}\\right)'
+  },
+  // statistics
+  max: '\\max\\left(${args}\\right)',
+  min: '\\min\\left(${args}\\right)',
+  variance: '\\mathrm{Var}\\left(${args}\\right)',
+  // trigonometry
+  acos: {
+    1: '\\cos^{-1}\\left(${args[0]}\\right)'
+  },
+  acosh: {
+    1: '\\cosh^{-1}\\left(${args[0]}\\right)'
+  },
+  acot: {
+    1: '\\cot^{-1}\\left(${args[0]}\\right)'
+  },
+  acoth: {
+    1: '\\coth^{-1}\\left(${args[0]}\\right)'
+  },
+  acsc: {
+    1: '\\csc^{-1}\\left(${args[0]}\\right)'
+  },
+  acsch: {
+    1: '\\mathrm{csch}^{-1}\\left(${args[0]}\\right)'
+  },
+  asec: {
+    1: '\\sec^{-1}\\left(${args[0]}\\right)'
+  },
+  asech: {
+    1: '\\mathrm{sech}^{-1}\\left(${args[0]}\\right)'
+  },
+  asin: {
+    1: '\\sin^{-1}\\left(${args[0]}\\right)'
+  },
+  asinh: {
+    1: '\\sinh^{-1}\\left(${args[0]}\\right)'
+  },
+  atan: {
+    1: '\\tan^{-1}\\left(${args[0]}\\right)'
+  },
+  atan2: {
+    2: '\\mathrm{atan2}\\left(${args}\\right)'
+  },
+  atanh: {
+    1: '\\tanh^{-1}\\left(${args[0]}\\right)'
+  },
+  cos: {
+    1: '\\cos\\left(${args[0]}\\right)'
+  },
+  cosh: {
+    1: '\\cosh\\left(${args[0]}\\right)'
+  },
+  cot: {
+    1: '\\cot\\left(${args[0]}\\right)'
+  },
+  coth: {
+    1: '\\coth\\left(${args[0]}\\right)'
+  },
+  csc: {
+    1: '\\csc\\left(${args[0]}\\right)'
+  },
+  csch: {
+    1: '\\mathrm{csch}\\left(${args[0]}\\right)'
+  },
+  sec: {
+    1: '\\sec\\left(${args[0]}\\right)'
+  },
+  sech: {
+    1: '\\mathrm{sech}\\left(${args[0]}\\right)'
+  },
+  sin: {
+    1: '\\sin\\left(${args[0]}\\right)'
+  },
+  sinh: {
+    1: '\\sinh\\left(${args[0]}\\right)'
+  },
+  tan: {
+    1: '\\tan\\left(${args[0]}\\right)'
+  },
+  tanh: {
+    1: '\\tanh\\left(${args[0]}\\right)'
+  },
+  // unit
+  to: {
+    2: "\\left(${args[0]}".concat(latexOperators.to, "${args[1]}\\right)")
+  },
+  // utils
+  numeric: function numeric(node, options) {
+    // Not sure if this is strictly right but should work correctly for the vast majority of use cases.
+    return node.args[0].toTex();
+  },
+  // type
+  number: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  },
+  string: {
+    0: '\\mathtt{""}',
+    1: '\\mathrm{string}\\left(${args[0]}\\right)'
+  },
+  bignumber: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)'
+  },
+  complex: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: "\\left(\\left(${args[0]}\\right)+".concat(latexSymbols.i, "\\cdot\\left(${args[1]}\\right)\\right)")
+  },
+  matrix: {
+    0: '\\begin{bmatrix}\\end{bmatrix}',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(${args[0]}\\right)'
+  },
+  sparse: {
+    0: '\\begin{bsparse}\\end{bsparse}',
+    1: '\\left(${args[0]}\\right)'
+  },
+  unit: {
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  }
+};
+exports.latexFunctions = latexFunctions;
+var defaultTemplate = '\\mathrm{${name}}\\left(${args}\\right)';
+exports.defaultTemplate = defaultTemplate;
+var latexUnits = {
+  deg: '^\\circ'
+};
+
+function escapeLatex(string) {
+  return (0, _escapeLatex.default)(string, {
+    preserveFormatting: true
+  });
+} // @param {string} name
+// @param {boolean} isUnit
+
+
+function toSymbol(name, isUnit) {
+  isUnit = typeof isUnit === 'undefined' ? false : isUnit;
+
+  if (isUnit) {
+    if ((0, _object.hasOwnProperty)(latexUnits, name)) {
+      return latexUnits[name];
+    }
+
+    return '\\mathrm{' + escapeLatex(name) + '}';
+  }
+
+  if ((0, _object.hasOwnProperty)(latexSymbols, name)) {
+    return latexSymbols[name];
+  }
+
+  return escapeLatex(name);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/log.js b/node_modules/mathjs/lib/cjs/utils/log.js
new file mode 100644
index 0000000..555607e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/log.js
@@ -0,0 +1,30 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.warnOnce = void 0;
+
+/**
+ * Log a console.warn message only once
+ */
+var warnOnce = function () {
+  var messages = {};
+  return function warnOnce() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+
+    var message = args.join(', ');
+
+    if (!messages[message]) {
+      var _console;
+
+      messages[message] = true;
+
+      (_console = console).warn.apply(_console, ['Warning:'].concat(args));
+    }
+  };
+}();
+
+exports.warnOnce = warnOnce;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/lruQueue.js b/node_modules/mathjs/lib/cjs/utils/lruQueue.js
new file mode 100644
index 0000000..4b17921
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/lruQueue.js
@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lruQueue = lruQueue;
+
+// (c) 2018, Mariusz Nowak
+// SPDX-License-Identifier: ISC
+// Derived from https://github.com/medikoo/lru-queue
+function lruQueue(limit) {
+  var size = 0;
+  var base = 1;
+  var queue = Object.create(null);
+  var map = Object.create(null);
+  var index = 0;
+
+  var del = function del(id) {
+    var oldIndex = map[id];
+    if (!oldIndex) return;
+    delete queue[oldIndex];
+    delete map[id];
+    --size;
+    if (base !== oldIndex) return;
+
+    if (!size) {
+      index = 0;
+      base = 1;
+      return;
+    }
+
+    while (!hasOwnProperty.call(queue, ++base)) {
+      continue;
+    }
+  };
+
+  limit = Math.abs(limit);
+  return {
+    hit: function hit(id) {
+      var oldIndex = map[id];
+      var nuIndex = ++index;
+      queue[nuIndex] = id;
+      map[id] = nuIndex;
+
+      if (!oldIndex) {
+        ++size;
+        if (size <= limit) return undefined;
+        id = queue[base];
+        del(id);
+        return id;
+      }
+
+      delete queue[oldIndex];
+      if (base !== oldIndex) return undefined;
+
+      while (!hasOwnProperty.call(queue, ++base)) {
+        continue;
+      }
+
+      return undefined;
+    },
+    delete: del,
+    clear: function clear() {
+      size = index = 0;
+      base = 1;
+      queue = Object.create(null);
+      map = Object.create(null);
+    }
+  };
+}
+
+;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/map.js b/node_modules/mathjs/lib/cjs/utils/map.js
new file mode 100644
index 0000000..255f684
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/map.js
@@ -0,0 +1,197 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ObjectWrappingMap = void 0;
+exports.assign = assign;
+exports.createEmptyMap = createEmptyMap;
+exports.createMap = createMap;
+exports.isMap = isMap;
+exports.toObject = toObject;
+
+var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
+
+var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
+
+var _customs = require("./customs.js");
+
+var _is = require("./is.js");
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+/**
+ * A map facade on a bare object.
+ *
+ * The small number of methods needed to implement a scope,
+ * forwarding on to the SafeProperty functions. Over time, the codebase
+ * will stop using this method, as all objects will be Maps, rather than
+ * more security prone objects.
+ */
+var ObjectWrappingMap = /*#__PURE__*/function () {
+  function ObjectWrappingMap(object) {
+    (0, _classCallCheck2.default)(this, ObjectWrappingMap);
+    this.wrappedObject = object;
+  }
+
+  (0, _createClass2.default)(ObjectWrappingMap, [{
+    key: "keys",
+    value: function keys() {
+      return Object.keys(this.wrappedObject);
+    }
+  }, {
+    key: "get",
+    value: function get(key) {
+      return (0, _customs.getSafeProperty)(this.wrappedObject, key);
+    }
+  }, {
+    key: "set",
+    value: function set(key, value) {
+      (0, _customs.setSafeProperty)(this.wrappedObject, key, value);
+      return this;
+    }
+  }, {
+    key: "has",
+    value: function has(key) {
+      return (0, _customs.hasSafeProperty)(this.wrappedObject, key);
+    }
+  }]);
+  return ObjectWrappingMap;
+}();
+/**
+ * Creates an empty map, or whatever your platform's polyfill is.
+ *
+ * @returns an empty Map or Map like object.
+ */
+
+
+exports.ObjectWrappingMap = ObjectWrappingMap;
+
+function createEmptyMap() {
+  return new Map();
+}
+/**
+ * Creates a Map from the given object.
+ *
+ * @param { Map | { [key: string]: unknown } | undefined } mapOrObject
+ * @returns
+ */
+
+
+function createMap(mapOrObject) {
+  if (!mapOrObject) {
+    return createEmptyMap();
+  }
+
+  if (isMap(mapOrObject)) {
+    return mapOrObject;
+  }
+
+  if ((0, _is.isObject)(mapOrObject)) {
+    return new ObjectWrappingMap(mapOrObject);
+  }
+
+  throw new Error('createMap can create maps from objects or Maps');
+}
+/**
+ * Unwraps a map into an object.
+ *
+ * @param {Map} map
+ * @returns { [key: string]: unknown }
+ */
+
+
+function toObject(map) {
+  if (map instanceof ObjectWrappingMap) {
+    return map.wrappedObject;
+  }
+
+  var object = {};
+
+  var _iterator = _createForOfIteratorHelper(map.keys()),
+      _step;
+
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var key = _step.value;
+      var value = map.get(key);
+      (0, _customs.setSafeProperty)(object, key, value);
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+
+  return object;
+}
+/**
+ * Returns `true` if the passed object appears to be a Map (i.e. duck typing).
+ *
+ * Methods looked for are `get`, `set`, `keys` and `has`.
+ *
+ * @param {Map | object} object
+ * @returns
+ */
+
+
+function isMap(object) {
+  // We can use the fast instanceof, or a slower duck typing check.
+  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.
+  if (!object) {
+    return false;
+  }
+
+  return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';
+}
+/**
+ * Copies the contents of key-value pairs from each `objects` in to `map`.
+ *
+ * Object is `objects` can be a `Map` or object.
+ *
+ * This is the `Map` analog to `Object.assign`.
+ */
+
+
+function assign(map) {
+  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    objects[_key - 1] = arguments[_key];
+  }
+
+  for (var _i = 0, _objects = objects; _i < _objects.length; _i++) {
+    var args = _objects[_i];
+
+    if (!args) {
+      continue;
+    }
+
+    if (isMap(args)) {
+      var _iterator2 = _createForOfIteratorHelper(args.keys()),
+          _step2;
+
+      try {
+        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+          var key = _step2.value;
+          map.set(key, args.get(key));
+        }
+      } catch (err) {
+        _iterator2.e(err);
+      } finally {
+        _iterator2.f();
+      }
+    } else if ((0, _is.isObject)(args)) {
+      for (var _i2 = 0, _Object$keys = Object.keys(args); _i2 < _Object$keys.length; _i2++) {
+        var _key2 = _Object$keys[_i2];
+        map.set(_key2, args[_key2]);
+      }
+    }
+  }
+
+  return map;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/noop.js b/node_modules/mathjs/lib/cjs/utils/noop.js
new file mode 100644
index 0000000..807b867
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/noop.js
@@ -0,0 +1,30 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.noBignumber = noBignumber;
+exports.noFraction = noFraction;
+exports.noIndex = noIndex;
+exports.noMatrix = noMatrix;
+exports.noSubset = noSubset;
+
+function noBignumber() {
+  throw new Error('No "bignumber" implementation available');
+}
+
+function noFraction() {
+  throw new Error('No "fraction" implementation available');
+}
+
+function noMatrix() {
+  throw new Error('No "matrix" implementation available');
+}
+
+function noIndex() {
+  throw new Error('No "index" implementation available');
+}
+
+function noSubset() {
+  throw new Error('No "matrix" implementation available');
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/number.js b/node_modules/mathjs/lib/cjs/utils/number.js
new file mode 100644
index 0000000..c9a736d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/number.js
@@ -0,0 +1,756 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cosh = exports.cbrt = exports.atanh = exports.asinh = exports.acosh = exports.DBL_EPSILON = void 0;
+exports.digits = digits;
+exports.expm1 = void 0;
+exports.format = format;
+exports.isInteger = isInteger;
+exports.log2 = exports.log1p = exports.log10 = void 0;
+exports.nearlyEqual = nearlyEqual;
+exports.roundDigits = roundDigits;
+exports.sinh = exports.sign = void 0;
+exports.splitNumber = splitNumber;
+exports.tanh = void 0;
+exports.toEngineering = toEngineering;
+exports.toExponential = toExponential;
+exports.toFixed = toFixed;
+exports.toPrecision = toPrecision;
+
+var _is = require("./is.js");
+
+/**
+ * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue
+ */
+
+/**
+ * Check if a number is integer
+ * @param {number | boolean} value
+ * @return {boolean} isInteger
+ */
+function isInteger(value) {
+  if (typeof value === 'boolean') {
+    return true;
+  }
+
+  return isFinite(value) ? value === Math.round(value) : false;
+}
+/**
+ * Calculate the sign of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+
+var sign = /* #__PURE__ */Math.sign || function (x) {
+  if (x > 0) {
+    return 1;
+  } else if (x < 0) {
+    return -1;
+  } else {
+    return 0;
+  }
+};
+/**
+ * Calculate the base-2 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+
+exports.sign = sign;
+
+var log2 = /* #__PURE__ */Math.log2 || function log2(x) {
+  return Math.log(x) / Math.LN2;
+};
+/**
+ * Calculate the base-10 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+
+exports.log2 = log2;
+
+var log10 = /* #__PURE__ */Math.log10 || function log10(x) {
+  return Math.log(x) / Math.LN10;
+};
+/**
+ * Calculate the natural logarithm of a number + 1
+ * @param {number} x
+ * @returns {number}
+ */
+
+
+exports.log10 = log10;
+
+var log1p = /* #__PURE__ */Math.log1p || function (x) {
+  return Math.log(x + 1);
+};
+/**
+ * Calculate cubic root for a number
+ *
+ * Code from es6-shim.js:
+ *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577
+ *
+ * @param {number} x
+ * @returns {number} Returns the cubic root of x
+ */
+
+
+exports.log1p = log1p;
+
+var cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {
+  if (x === 0) {
+    return x;
+  }
+
+  var negate = x < 0;
+  var result;
+
+  if (negate) {
+    x = -x;
+  }
+
+  if (isFinite(x)) {
+    result = Math.exp(Math.log(x) / 3); // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods
+
+    result = (x / (result * result) + 2 * result) / 3;
+  } else {
+    result = x;
+  }
+
+  return negate ? -result : result;
+};
+/**
+ * Calculates exponentiation minus 1
+ * @param {number} x
+ * @return {number} res
+ */
+
+
+exports.cbrt = cbrt;
+
+var expm1 = /* #__PURE__ */Math.expm1 || function expm1(x) {
+  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;
+};
+/**
+ * Formats a number in a given base
+ * @param {number} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+
+
+exports.expm1 = expm1;
+
+function formatNumberToBase(n, base, size) {
+  var prefixes = {
+    2: '0b',
+    8: '0o',
+    16: '0x'
+  };
+  var prefix = prefixes[base];
+  var suffix = '';
+
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+
+    if (!isInteger(size)) {
+      throw new Error('size must be an integer');
+    }
+
+    if (n > Math.pow(2, size - 1) - 1 || n < -Math.pow(2, size - 1)) {
+      throw new Error("Value must be in range [-2^".concat(size - 1, ", 2^").concat(size - 1, "-1]"));
+    }
+
+    if (!isInteger(n)) {
+      throw new Error('Value must be an integer');
+    }
+
+    if (n < 0) {
+      n = n + Math.pow(2, size);
+    }
+
+    suffix = "i".concat(size);
+  }
+
+  var sign = '';
+
+  if (n < 0) {
+    n = -n;
+    sign = '-';
+  }
+
+  return "".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);
+}
+/**
+ * Convert a number to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'engineering'    Always use engineering notation.
+ *                                          For example '123.4e+0' and '14.0e+6'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lowerExp` and `upperExp` bounds, and
+ *                                          uses exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default,
+ *                                          not rounding any digits.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12.071, {notation: 'fixed'})                // '12'
+ *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'
+ *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'
+ *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'
+ *
+ * @param {number} value
+ * @param {Object | Function | number} [options]
+ * @return {string} str The formatted value
+ */
+
+
+function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  } // handle special cases
+
+
+  if (value === Infinity) {
+    return 'Infinity';
+  } else if (value === -Infinity) {
+    return '-Infinity';
+  } else if (isNaN(value)) {
+    return 'NaN';
+  } // default values for options
+
+
+  var notation = 'auto';
+  var precision;
+  var wordSize;
+
+  if (options) {
+    // determine notation from options
+    if (options.notation) {
+      notation = options.notation;
+    } // determine precision from options
+
+
+    if ((0, _is.isNumber)(options)) {
+      precision = options;
+    } else if ((0, _is.isNumber)(options.precision)) {
+      precision = options.precision;
+    }
+
+    if (options.wordSize) {
+      wordSize = options.wordSize;
+
+      if (typeof wordSize !== 'number') {
+        throw new Error('Option "wordSize" must be a number');
+      }
+    }
+  } // handle the various notations
+
+
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+
+    case 'exponential':
+      return toExponential(value, precision);
+
+    case 'engineering':
+      return toEngineering(value, precision);
+
+    case 'bin':
+      return formatNumberToBase(value, 2, wordSize);
+
+    case 'oct':
+      return formatNumberToBase(value, 8, wordSize);
+
+    case 'hex':
+      return formatNumberToBase(value, 16, wordSize);
+
+    case 'auto':
+      // remove trailing zeros after the decimal point
+      return toPrecision(value, precision, options && options).replace(/((\.\d*?)(0+))($|e)/, function () {
+        var digits = arguments[2];
+        var e = arguments[4];
+        return digits !== '.' ? digits + e : e;
+      });
+
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+/**
+ * Split a number into sign, coefficients, and exponent
+ * @param {number | string} value
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ */
+
+
+function splitNumber(value) {
+  // parse the input value
+  var match = String(value).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);
+
+  if (!match) {
+    throw new SyntaxError('Invalid number ' + value);
+  }
+
+  var sign = match[1];
+  var digits = match[2];
+  var exponent = parseFloat(match[4] || '0');
+  var dot = digits.indexOf('.');
+  exponent += dot !== -1 ? dot - 1 : digits.length - 1;
+  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)
+  .replace(/^0*/, function (zeros) {
+    // remove leading zeros, add their count to the exponent
+    exponent -= zeros.length;
+    return '';
+  }).replace(/0*$/, '') // remove trailing zeros
+  .split('').map(function (d) {
+    return parseInt(d);
+  });
+
+  if (coefficients.length === 0) {
+    coefficients.push(0);
+    exponent++;
+  }
+
+  return {
+    sign: sign,
+    coefficients: coefficients,
+    exponent: exponent
+  };
+}
+/**
+ * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+
+
+function toEngineering(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  var split = splitNumber(value);
+  var rounded = roundDigits(split, precision);
+  var e = rounded.exponent;
+  var c = rounded.coefficients; // find nearest lower multiple of 3 for exponent
+
+  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;
+
+  if ((0, _is.isNumber)(precision)) {
+    // add zeroes to give correct sig figs
+    while (precision > c.length || e - newExp + 1 > c.length) {
+      c.push(0);
+    }
+  } else {
+    // concatenate coefficients with necessary zeros
+    // add zeros if necessary (for example: 1e+8 -> 100e+6)
+    var missingZeros = Math.abs(e - newExp) - (c.length - 1);
+
+    for (var i = 0; i < missingZeros; i++) {
+      c.push(0);
+    }
+  } // find difference in exponents
+
+
+  var expDiff = Math.abs(e - newExp);
+  var decimalIdx = 1; // push decimal index over by expDiff times
+
+  while (expDiff > 0) {
+    decimalIdx++;
+    expDiff--;
+  } // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.
+  // otherwise concat with the rest of the coefficients
+
+
+  var decimals = c.slice(decimalIdx).join('');
+  var decimalVal = (0, _is.isNumber)(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';
+  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+  return rounded.sign + str;
+}
+/**
+ * Format a number with fixed notation.
+ * @param {number | string} value
+ * @param {number} [precision=undefined]  Optional number of decimals after the
+ *                                        decimal point. null by default.
+ */
+
+
+function toFixed(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  var splitValue = splitNumber(value);
+  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;
+  var c = rounded.coefficients;
+  var p = rounded.exponent + 1; // exponent may have changed
+  // append zeros if needed
+
+  var pp = p + (precision || 0);
+
+  if (c.length < pp) {
+    c = c.concat(zeros(pp - c.length));
+  } // prepend zeros if needed
+
+
+  if (p < 0) {
+    c = zeros(-p + 1).concat(c);
+    p = 1;
+  } // insert a dot if needed
+
+
+  if (p < c.length) {
+    c.splice(p, 0, p === 0 ? '0.' : '.');
+  }
+
+  return rounded.sign + c.join('');
+}
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ */
+
+
+function toExponential(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  } // round if needed, else create a clone
+
+
+  var split = splitNumber(value);
+  var rounded = precision ? roundDigits(split, precision) : split;
+  var c = rounded.coefficients;
+  var e = rounded.exponent; // append zeros if needed
+
+  if (c.length < precision) {
+    c = c.concat(zeros(precision - c.length));
+  } // format as `C.CCCe+EEE` or `C.CCCe-EEE`
+
+
+  var first = c.shift();
+  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;
+}
+/**
+ * Format a number with a certain precision
+ * @param {number | string} value
+ * @param {number} [precision=undefined] Optional number of digits.
+ * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]
+ *                                       By default:
+ *                                         lowerExp = -3 (incl)
+ *                                         upper = +5 (excl)
+ * @return {string}
+ */
+
+
+function toPrecision(value, precision, options) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  } // determine lower and upper bound for exponential notation.
+
+
+  var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;
+  var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;
+  var split = splitNumber(value);
+  var rounded = precision ? roundDigits(split, precision) : split;
+
+  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {
+    // exponential notation
+    return toExponential(value, precision);
+  } else {
+    var c = rounded.coefficients;
+    var e = rounded.exponent; // append trailing zeros
+
+    if (c.length < precision) {
+      c = c.concat(zeros(precision - c.length));
+    } // append trailing zeros
+    // TODO: simplify the next statement
+
+
+    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0))); // prepend zeros
+
+    c = zeros(-e).concat(c);
+    var dot = e > 0 ? e : 0;
+
+    if (dot < c.length - 1) {
+      c.splice(dot + 1, 0, '.');
+    }
+
+    return rounded.sign + c.join('');
+  }
+}
+/**
+ * Round the number of digits of a number *
+ * @param {SplitValue} split       A value split with .splitNumber(value)
+ * @param {number} precision  A positive integer
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ *              with rounded digits
+ */
+
+
+function roundDigits(split, precision) {
+  // create a clone
+  var rounded = {
+    sign: split.sign,
+    coefficients: split.coefficients,
+    exponent: split.exponent
+  };
+  var c = rounded.coefficients; // prepend zeros if needed
+
+  while (precision <= 0) {
+    c.unshift(0);
+    rounded.exponent++;
+    precision++;
+  }
+
+  if (c.length > precision) {
+    var removed = c.splice(precision, c.length - precision);
+
+    if (removed[0] >= 5) {
+      var i = precision - 1;
+      c[i]++;
+
+      while (c[i] === 10) {
+        c.pop();
+
+        if (i === 0) {
+          c.unshift(0);
+          rounded.exponent++;
+          i++;
+        }
+
+        i--;
+        c[i]++;
+      }
+    }
+  }
+
+  return rounded;
+}
+/**
+ * Create an array filled with zeros.
+ * @param {number} length
+ * @return {Array}
+ */
+
+
+function zeros(length) {
+  var arr = [];
+
+  for (var i = 0; i < length; i++) {
+    arr.push(0);
+  }
+
+  return arr;
+}
+/**
+ * Count the number of significant digits of a number.
+ *
+ * For example:
+ *   2.34 returns 3
+ *   0.0034 returns 2
+ *   120.5e+30 returns 4
+ *
+ * @param {number} value
+ * @return {number} digits   Number of significant digits
+ */
+
+
+function digits(value) {
+  return value.toExponential().replace(/e.*$/, '') // remove exponential notation
+  .replace(/^0\.?0*|\./, '') // remove decimal point and leading zeros
+  .length;
+}
+/**
+ * Minimum number added to one that makes the result different than one
+ */
+
+
+var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;
+/**
+ * Compares two floating point numbers.
+ * @param {number} x          First value to compare
+ * @param {number} y          Second value to compare
+ * @param {number} [epsilon]  The maximum relative difference between x and y
+ *                            If epsilon is undefined or null, the function will
+ *                            test whether x and y are exactly equal.
+ * @return {boolean} whether the two numbers are nearly equal
+*/
+
+exports.DBL_EPSILON = DBL_EPSILON;
+
+function nearlyEqual(x, y, epsilon) {
+  // if epsilon is null or undefined, test whether x and y are exactly equal
+  if (epsilon === null || epsilon === undefined) {
+    return x === y;
+  }
+
+  if (x === y) {
+    return true;
+  } // NaN
+
+
+  if (isNaN(x) || isNaN(y)) {
+    return false;
+  } // at this point x and y should be finite
+
+
+  if (isFinite(x) && isFinite(y)) {
+    // check numbers are very close, needed when comparing numbers near zero
+    var diff = Math.abs(x - y);
+
+    if (diff < DBL_EPSILON) {
+      return true;
+    } else {
+      // use relative error
+      return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon;
+    }
+  } // Infinite and Number or negative Infinite and positive Infinite cases
+
+
+  return false;
+}
+/**
+ * Calculate the hyperbolic arccos of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+
+var acosh = Math.acosh || function (x) {
+  return Math.log(Math.sqrt(x * x - 1) + x);
+};
+
+exports.acosh = acosh;
+
+var asinh = Math.asinh || function (x) {
+  return Math.log(Math.sqrt(x * x + 1) + x);
+};
+/**
+ * Calculate the hyperbolic arctangent of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+
+exports.asinh = asinh;
+
+var atanh = Math.atanh || function (x) {
+  return Math.log((1 + x) / (1 - x)) / 2;
+};
+/**
+ * Calculate the hyperbolic cosine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+
+exports.atanh = atanh;
+
+var cosh = Math.cosh || function (x) {
+  return (Math.exp(x) + Math.exp(-x)) / 2;
+};
+/**
+ * Calculate the hyperbolic sine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+
+exports.cosh = cosh;
+
+var sinh = Math.sinh || function (x) {
+  return (Math.exp(x) - Math.exp(-x)) / 2;
+};
+/**
+ * Calculate the hyperbolic tangent of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+
+exports.sinh = sinh;
+
+var tanh = Math.tanh || function (x) {
+  var e = Math.exp(2 * x);
+  return (e - 1) / (e + 1);
+};
+
+exports.tanh = tanh;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/object.js b/node_modules/mathjs/lib/cjs/utils/object.js
new file mode 100644
index 0000000..9051e6b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/object.js
@@ -0,0 +1,455 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.canDefineProperty = canDefineProperty;
+exports.clone = clone;
+exports.deepExtend = deepExtend;
+exports.deepFlatten = deepFlatten;
+exports.deepStrictEqual = deepStrictEqual;
+exports.extend = extend;
+exports.get = get;
+exports.hasOwnProperty = hasOwnProperty;
+exports.isLegacyFactory = isLegacyFactory;
+exports.lazy = lazy;
+exports.mapObject = mapObject;
+exports.pick = pick;
+exports.pickShallow = pickShallow;
+exports.set = set;
+exports.traverse = traverse;
+exports.values = values;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _is = require("./is.js");
+
+/**
+ * Clone an object
+ *
+ *     clone(x)
+ *
+ * Can clone any primitive type, array, and object.
+ * If x has a function clone, this function will be invoked to clone the object.
+ *
+ * @param {*} x
+ * @return {*} clone
+ */
+function clone(x) {
+  var type = (0, _typeof2.default)(x); // immutable primitive types
+
+  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {
+    return x;
+  } // use clone function of the object when available
+
+
+  if (typeof x.clone === 'function') {
+    return x.clone();
+  } // array
+
+
+  if (Array.isArray(x)) {
+    return x.map(function (value) {
+      return clone(value);
+    });
+  }
+
+  if (x instanceof Date) return new Date(x.valueOf());
+  if ((0, _is.isBigNumber)(x)) return x; // bignumbers are immutable
+
+  if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp
+  // object
+
+  return mapObject(x, clone);
+}
+/**
+ * Apply map to all properties of an object
+ * @param {Object} object
+ * @param {function} callback
+ * @return {Object} Returns a copy of the object with mapped properties
+ */
+
+
+function mapObject(object, callback) {
+  var clone = {};
+
+  for (var key in object) {
+    if (hasOwnProperty(object, key)) {
+      clone[key] = callback(object[key]);
+    }
+  }
+
+  return clone;
+}
+/**
+ * Extend object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @return {Object} a
+ */
+
+
+function extend(a, b) {
+  for (var prop in b) {
+    if (hasOwnProperty(b, prop)) {
+      a[prop] = b[prop];
+    }
+  }
+
+  return a;
+}
+/**
+ * Deep extend an object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @returns {Object}
+ */
+
+
+function deepExtend(a, b) {
+  // TODO: add support for Arrays to deepExtend
+  if (Array.isArray(b)) {
+    throw new TypeError('Arrays are not supported by deepExtend');
+  }
+
+  for (var prop in b) {
+    // We check against prop not being in Object.prototype or Function.prototype
+    // to prevent polluting for example Object.__proto__.
+    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {
+      if (b[prop] && b[prop].constructor === Object) {
+        if (a[prop] === undefined) {
+          a[prop] = {};
+        }
+
+        if (a[prop] && a[prop].constructor === Object) {
+          deepExtend(a[prop], b[prop]);
+        } else {
+          a[prop] = b[prop];
+        }
+      } else if (Array.isArray(b[prop])) {
+        throw new TypeError('Arrays are not supported by deepExtend');
+      } else {
+        a[prop] = b[prop];
+      }
+    }
+  }
+
+  return a;
+}
+/**
+ * Deep test equality of all fields in two pairs of arrays or objects.
+ * Compares values and functions strictly (ie. 2 is not the same as '2').
+ * @param {Array | Object} a
+ * @param {Array | Object} b
+ * @returns {boolean}
+ */
+
+
+function deepStrictEqual(a, b) {
+  var prop, i, len;
+
+  if (Array.isArray(a)) {
+    if (!Array.isArray(b)) {
+      return false;
+    }
+
+    if (a.length !== b.length) {
+      return false;
+    }
+
+    for (i = 0, len = a.length; i < len; i++) {
+      if (!deepStrictEqual(a[i], b[i])) {
+        return false;
+      }
+    }
+
+    return true;
+  } else if (typeof a === 'function') {
+    return a === b;
+  } else if (a instanceof Object) {
+    if (Array.isArray(b) || !(b instanceof Object)) {
+      return false;
+    }
+
+    for (prop in a) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {
+        return false;
+      }
+    }
+
+    for (prop in b) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in a)) {
+        return false;
+      }
+    }
+
+    return true;
+  } else {
+    return a === b;
+  }
+}
+/**
+ * Recursively flatten a nested object.
+ * @param {Object} nestedObject
+ * @return {Object} Returns the flattened object
+ */
+
+
+function deepFlatten(nestedObject) {
+  var flattenedObject = {};
+
+  _deepFlatten(nestedObject, flattenedObject);
+
+  return flattenedObject;
+} // helper function used by deepFlatten
+
+
+function _deepFlatten(nestedObject, flattenedObject) {
+  for (var prop in nestedObject) {
+    if (hasOwnProperty(nestedObject, prop)) {
+      var value = nestedObject[prop];
+
+      if ((0, _typeof2.default)(value) === 'object' && value !== null) {
+        _deepFlatten(value, flattenedObject);
+      } else {
+        flattenedObject[prop] = value;
+      }
+    }
+  }
+}
+/**
+ * Test whether the current JavaScript engine supports Object.defineProperty
+ * @returns {boolean} returns true if supported
+ */
+
+
+function canDefineProperty() {
+  // test needed for broken IE8 implementation
+  try {
+    if (Object.defineProperty) {
+      Object.defineProperty({}, 'x', {
+        get: function get() {}
+      });
+      return true;
+    }
+  } catch (e) {}
+
+  return false;
+}
+/**
+ * Attach a lazy loading property to a constant.
+ * The given function `fn` is called once when the property is first requested.
+ *
+ * @param {Object} object         Object where to add the property
+ * @param {string} prop           Property name
+ * @param {Function} valueResolver Function returning the property value. Called
+ *                                without arguments.
+ */
+
+
+function lazy(object, prop, valueResolver) {
+  var _uninitialized = true;
+
+  var _value;
+
+  Object.defineProperty(object, prop, {
+    get: function get() {
+      if (_uninitialized) {
+        _value = valueResolver();
+        _uninitialized = false;
+      }
+
+      return _value;
+    },
+    set: function set(value) {
+      _value = value;
+      _uninitialized = false;
+    },
+    configurable: true,
+    enumerable: true
+  });
+}
+/**
+ * Traverse a path into an object.
+ * When a namespace is missing, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path   A dot separated string like 'name.space'
+ * @return {Object} Returns the object at the end of the path
+ */
+
+
+function traverse(object, path) {
+  if (path && typeof path === 'string') {
+    return traverse(object, path.split('.'));
+  }
+
+  var obj = object;
+
+  if (path) {
+    for (var i = 0; i < path.length; i++) {
+      var key = path[i];
+
+      if (!(key in obj)) {
+        obj[key] = {};
+      }
+
+      obj = obj[key];
+    }
+  }
+
+  return obj;
+}
+/**
+ * A safe hasOwnProperty
+ * @param {Object} object
+ * @param {string} property
+ */
+
+
+function hasOwnProperty(object, property) {
+  return object && Object.hasOwnProperty.call(object, property);
+}
+/**
+ * Test whether an object is a factory. a factory has fields:
+ *
+ * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)
+ * - name: string (optional)
+ * - path: string    A dot separated path (optional)
+ * - math: boolean   If true (false by default), the math namespace is passed
+ *                   as fifth argument of the factory function
+ *
+ * @param {*} object
+ * @returns {boolean}
+ */
+
+
+function isLegacyFactory(object) {
+  return object && typeof object.factory === 'function';
+}
+/**
+ * Get a nested property from an object
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @returns {Object}
+ */
+
+
+function get(object, path) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return get(object, path.split('.'));
+    } else {
+      return object[path];
+    }
+  }
+
+  var child = object;
+
+  for (var i = 0; i < path.length; i++) {
+    var key = path[i];
+    child = child ? child[key] : undefined;
+  }
+
+  return child;
+}
+/**
+ * Set a nested property in an object
+ * Mutates the object itself
+ * If the path doesn't exist, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @param {*} value
+ * @returns {Object}
+ */
+
+
+function set(object, path, value) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return set(object, path.split('.'), value);
+    } else {
+      object[path] = value;
+      return object;
+    }
+  }
+
+  var child = object;
+
+  for (var i = 0; i < path.length - 1; i++) {
+    var key = path[i];
+
+    if (child[key] === undefined) {
+      child[key] = {};
+    }
+
+    child = child[key];
+  }
+
+  if (path.length > 0) {
+    var lastKey = path[path.length - 1];
+    child[lastKey] = value;
+  }
+
+  return object;
+}
+/**
+ * Create an object composed of the picked object properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @param {function} [transform] Optional value to transform a value when picking it
+ * @return {Object}
+ */
+
+
+function pick(object, properties, transform) {
+  var copy = {};
+
+  for (var i = 0; i < properties.length; i++) {
+    var key = properties[i];
+    var value = get(object, key);
+
+    if (value !== undefined) {
+      set(copy, key, transform ? transform(value, key) : value);
+    }
+  }
+
+  return copy;
+}
+/**
+ * Shallow version of pick, creating an object composed of the picked object properties
+ * but not for nested properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @return {Object}
+ */
+
+
+function pickShallow(object, properties) {
+  var copy = {};
+
+  for (var i = 0; i < properties.length; i++) {
+    var key = properties[i];
+    var value = object[key];
+
+    if (value !== undefined) {
+      copy[key] = value;
+    }
+  }
+
+  return copy;
+}
+
+function values(object) {
+  return Object.keys(object).map(function (key) {
+    return object[key];
+  });
+} // helper function to test whether a string contains a path like 'user.name'
+
+
+function isPath(str) {
+  return str.indexOf('.') !== -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/polyfills.js b/node_modules/mathjs/lib/cjs/utils/polyfills.js
new file mode 100644
index 0000000..4568e59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/polyfills.js
@@ -0,0 +1,14 @@
+"use strict";
+
+// TODO: remove these polyfills as soon as we have a build process that transpiles the code to ES5
+// Polyfill for IE 11 (Number.isFinite is used in `complex.js`)
+// source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/isFinite
+Number.isFinite = Number.isFinite || function (value) {
+  return typeof value === 'number' && isFinite(value);
+}; // Polyfill for IE 11
+// source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/isNaN
+
+
+Number.isNaN = Number.isNaN || function (value) {
+  return value !== value; // eslint-disable-line no-self-compare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/product.js b/node_modules/mathjs/lib/cjs/utils/product.js
new file mode 100644
index 0000000..cccc110
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/product.js
@@ -0,0 +1,24 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.product = product;
+
+/** @param {number} i
+ *  @param {number} n
+ *  @returns {number} product of i to n
+ */
+function product(i, n) {
+  if (n < i) {
+    return 1;
+  }
+
+  if (n === i) {
+    return n;
+  }
+
+  var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer
+
+  return product(i, half) * product(half + 1, n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/scope.js b/node_modules/mathjs/lib/cjs/utils/scope.js
new file mode 100644
index 0000000..f911812
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/scope.js
@@ -0,0 +1,33 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubScope = createSubScope;
+
+var _map = require("./map.js");
+
+/**
+ * Create a new scope which can access the parent scope,
+ * but does not affect it when written. This is suitable for variable definitions
+ * within a block node, or function definition.
+ *
+ * If parent scope has a createSubScope method, it delegates to that. Otherwise,
+ * creates an empty map, and copies the parent scope to it, adding in
+ * the remaining `args`.
+ *
+ * @param {Map} parentScope
+ * @param  {...any} args
+ * @returns {Map}
+ */
+function createSubScope(parentScope) {
+  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    args[_key - 1] = arguments[_key];
+  }
+
+  if (typeof parentScope.createSubScope === 'function') {
+    return _map.assign.apply(void 0, [parentScope.createSubScope()].concat(args));
+  }
+
+  return _map.assign.apply(void 0, [(0, _map.createEmptyMap)(), parentScope].concat(args));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/snapshot.js b/node_modules/mathjs/lib/cjs/utils/snapshot.js
new file mode 100644
index 0000000..19ddb39
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/snapshot.js
@@ -0,0 +1,295 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+var _typeof3 = require("@babel/runtime/helpers/typeof");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSnapshotFromFactories = createSnapshotFromFactories;
+exports.validateBundle = validateBundle;
+exports.validateTypeOf = validateTypeOf;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
+var _assert = _interopRequireDefault(require("assert"));
+
+var allIsFunctions = _interopRequireWildcard(require("./is.js"));
+
+var _create = require("../core/create.js");
+
+var _string = require("./string.js");
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof3(obj) !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2.default)(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+function validateBundle(expectedBundleStructure, bundle) {
+  var originalWarn = console.warn;
+
+  console.warn = function () {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+
+    if (args.join(' ').indexOf('is moved to') !== -1 && args.join(' ').indexOf('Please use the new location instead') !== -1) {
+      // Ignore warnings like:
+      // Warning: math.type.isNumber is moved to math.isNumber in v6.0.0. Please use the new location instead.
+      return;
+    }
+
+    originalWarn.apply(console, args);
+  };
+
+  try {
+    var issues = []; // see whether all expected functions and objects are there
+
+    traverse(expectedBundleStructure, function (expectedType, path) {
+      var actualValue = get(bundle, path);
+      var actualType = validateTypeOf(actualValue);
+      var message = actualType === 'undefined' ? 'Missing entry in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType) : 'Unexpected entry type in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType);
+
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType: actualType,
+          expectedType: expectedType,
+          message: message
+        });
+        console.warn(message);
+      }
+    }); // see whether there are any functions or objects that shouldn't be there
+
+    traverse(bundle, function (actualValue, path) {
+      var actualType = validateTypeOf(actualValue);
+      var expectedType = get(expectedBundleStructure, path) || 'undefined'; // FIXME: ugly to have these special cases
+
+      if (path.join('.').indexOf('docs.') !== -1) {
+        // ignore the contents of docs
+        return;
+      }
+
+      if (path.join('.').indexOf('all.') !== -1) {
+        // ignore the contents of all dependencies
+        return;
+      }
+
+      var message = expectedType === 'undefined' ? 'Unknown entry in bundle. ' + 'Is there a new function added which is missing in this snapshot test? ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType) : 'Unexpected entry type in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType);
+
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType: actualType,
+          expectedType: expectedType,
+          message: message
+        });
+        console.warn(message);
+      }
+    }); // assert on the first issue (if any)
+
+    if (issues.length > 0) {
+      var _issues$ = issues[0],
+          actualType = _issues$.actualType,
+          expectedType = _issues$.expectedType,
+          message = _issues$.message;
+      console.warn("".concat(issues.length, " bundle issues found"));
+
+      _assert.default.strictEqual(actualType, expectedType, message);
+    }
+  } finally {
+    console.warn = originalWarn;
+  }
+}
+/**
+ * Based on an object with factory functions, create the expected
+ * structures for ES6 export and a mathjs instance.
+ * @param {Object} factories
+ * @return {{expectedInstanceStructure: Object, expectedES6Structure: Object}}
+ */
+
+
+function createSnapshotFromFactories(factories) {
+  var math = (0, _create.create)(factories);
+  var allFactoryFunctions = {};
+  var allFunctionsConstantsClasses = {};
+  var allFunctionsConstants = {};
+  var allTransformFunctions = {};
+  var allDependencyCollections = {};
+  var allClasses = {};
+  var allNodeClasses = {};
+  Object.keys(factories).forEach(function (factoryName) {
+    var factory = factories[factoryName];
+    var name = factory.fn;
+    var isTransformFunction = factory.meta && factory.meta.isTransformFunction;
+    var isClass = !isLowerCase(name[0]) && validateTypeOf(math[name]) === 'Function';
+    var dependenciesName = factory.fn + (isTransformFunction ? 'Transform' : '') + 'Dependencies';
+    allFactoryFunctions[factoryName] = 'Function';
+    allFunctionsConstantsClasses[name] = validateTypeOf(math[name]);
+    allDependencyCollections[dependenciesName] = 'Object';
+
+    if (isTransformFunction) {
+      allTransformFunctions[name] = 'Function';
+    }
+
+    if (isClass) {
+      if ((0, _string.endsWith)(name, 'Node')) {
+        allNodeClasses[name] = 'Function';
+      } else {
+        allClasses[name] = 'Function';
+      }
+    } else {
+      allFunctionsConstants[name] = validateTypeOf(math[name]);
+    }
+  });
+  var embeddedDocs = {};
+  Object.keys(factories).forEach(function (factoryName) {
+    var factory = factories[factoryName];
+    var name = factory.fn;
+
+    if (isLowerCase(factory.fn[0])) {
+      // ignore class names starting with upper case
+      embeddedDocs[name] = 'Object';
+    }
+  });
+  embeddedDocs = exclude(embeddedDocs, ['equalScalar', 'apply', 'addScalar', 'multiplyScalar', 'print', 'divideScalar', 'parse', 'compile', 'parser', 'chain', 'reviver', 'replacer']);
+  var allTypeChecks = {};
+  Object.keys(allIsFunctions).forEach(function (name) {
+    if (name.indexOf('is') === 0) {
+      allTypeChecks[name] = 'Function';
+    }
+  });
+  var allErrorClasses = {
+    ArgumentsError: 'Function',
+    DimensionError: 'Function',
+    IndexError: 'Function'
+  };
+
+  var expectedInstanceStructure = _objectSpread(_objectSpread(_objectSpread(_objectSpread({}, allFunctionsConstantsClasses), {}, {
+    on: 'Function',
+    off: 'Function',
+    once: 'Function',
+    emit: 'Function',
+    import: 'Function',
+    config: 'Function',
+    create: 'Function',
+    factory: 'Function'
+  }, allTypeChecks), allErrorClasses), {}, {
+    expression: {
+      transform: _objectSpread({}, allTransformFunctions),
+      mathWithTransform: _objectSpread(_objectSpread({}, exclude(allFunctionsConstants, ['chain'])), {}, {
+        config: 'Function'
+      })
+    }
+  });
+
+  var expectedES6Structure = _objectSpread(_objectSpread(_objectSpread(_objectSpread(_objectSpread(_objectSpread({}, exclude(allFunctionsConstantsClasses, ['E', 'false', 'Infinity', 'NaN', 'null', 'PI', 'true'])), {}, {
+    create: 'Function',
+    config: 'Function',
+    factory: 'Function',
+    _true: 'boolean',
+    _false: 'boolean',
+    _null: 'null',
+    _Infinity: 'number',
+    _NaN: 'number'
+  }, allTypeChecks), allErrorClasses), allDependencyCollections), allFactoryFunctions), {}, {
+    docs: embeddedDocs
+  });
+
+  return {
+    expectedInstanceStructure: expectedInstanceStructure,
+    expectedES6Structure: expectedES6Structure
+  };
+}
+
+function validateTypeOf(x) {
+  if (x && x.type === 'Unit') {
+    return 'Unit';
+  }
+
+  if (x && x.type === 'Complex') {
+    return 'Complex';
+  }
+
+  if (Array.isArray(x)) {
+    return 'Array';
+  }
+
+  if (x === null) {
+    return 'null';
+  }
+
+  if (typeof x === 'function') {
+    return 'Function';
+  }
+
+  if ((0, _typeof2.default)(x) === 'object') {
+    return 'Object';
+  }
+
+  return (0, _typeof2.default)(x);
+}
+
+function traverse(obj) {
+  var callback = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : function (value, path) {};
+  var path = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+
+  // FIXME: ugly to have these special cases
+  if (path.length > 0 && path[0].indexOf('Dependencies') !== -1) {
+    // special case for objects holding a collection of dependencies
+    callback(obj, path);
+  } else if (validateTypeOf(obj) === 'Array') {
+    obj.map(function (item, index) {
+      return traverse(item, callback, path.concat(index));
+    });
+  } else if (validateTypeOf(obj) === 'Object') {
+    Object.keys(obj).forEach(function (key) {
+      // FIXME: ugly to have these special cases
+      // ignore special case of deprecated docs
+      if (key === 'docs' && path.join('.') === 'expression') {
+        return;
+      }
+
+      traverse(obj[key], callback, path.concat(key));
+    });
+  } else {
+    callback(obj, path);
+  }
+}
+
+function get(object, path) {
+  var child = object;
+
+  for (var i = 0; i < path.length; i++) {
+    var key = path[i];
+    child = child ? child[key] : undefined;
+  }
+
+  return child;
+}
+/**
+ * Create a copy of the provided `object` and delete
+ * all properties listed in `excludedProperties`
+ * @param {Object} object
+ * @param {string[]} excludedProperties
+ * @return {Object}
+ */
+
+
+function exclude(object, excludedProperties) {
+  var strippedObject = (0, _extends2.default)({}, object);
+  excludedProperties.forEach(function (excludedProperty) {
+    delete strippedObject[excludedProperty];
+  });
+  return strippedObject;
+}
+
+function isLowerCase(text) {
+  return typeof text === 'string' && text.toLowerCase() === text;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/string.js b/node_modules/mathjs/lib/cjs/utils/string.js
new file mode 100644
index 0000000..611927f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/string.js
@@ -0,0 +1,240 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareText = compareText;
+exports.endsWith = endsWith;
+exports.escape = escape;
+exports.format = format;
+exports.stringify = stringify;
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
+
+var _is = require("./is.js");
+
+var _number = require("./number.js");
+
+var _formatter = require("./bignumber/formatter.js");
+
+/**
+ * Check if a text ends with a certain string.
+ * @param {string} text
+ * @param {string} search
+ */
+function endsWith(text, search) {
+  var start = text.length - search.length;
+  var end = text.length;
+  return text.substring(start, end) === search;
+}
+/**
+ * Format a value of any type into a string.
+ *
+ * Usage:
+ *     math.format(value)
+ *     math.format(value, precision)
+ *     math.format(value, options)
+ *
+ * When value is a function:
+ *
+ * - When the function has a property `syntax`, it returns this
+ *   syntax description.
+ * - In other cases, a string `'function'` is returned.
+ *
+ * When `value` is an Object:
+ *
+ * - When the object contains a property `format` being a function, this
+ *   function is invoked as `value.format(options)` and the result is returned.
+ * - When the object has its own `toString` method, this method is invoked
+ *   and the result is returned.
+ * - In other cases the function will loop over all object properties and
+ *   return JSON object notation like '{"a": 2, "b": 3}'.
+ *
+ * Example usage:
+ *     math.format(2/7)                // '0.2857142857142857'
+ *     math.format(math.pi, 3)         // '3.14'
+ *     math.format(new Complex(2, 3))  // '2 + 3i'
+ *     math.format('hello')            // '"hello"'
+ *
+ * @param {*} value             Value to be stringified
+ * @param {Object | number | Function} [options]
+ *     Formatting options. See src/utils/number.js:format for a
+ *     description of the available options controlling number output.
+ *     This generic "format" also supports the option property `truncate: NN`
+ *     giving the maximum number NN of characters to return (if there would
+ *     have been more, they are deleted and replaced by an ellipsis).
+ * @return {string} str
+ */
+
+
+function format(value, options) {
+  var result = _format(value, options);
+
+  if (options && (0, _typeof2.default)(options) === 'object' && 'truncate' in options && result.length > options.truncate) {
+    return result.substring(0, options.truncate - 3) + '...';
+  }
+
+  return result;
+}
+
+function _format(value, options) {
+  if (typeof value === 'number') {
+    return (0, _number.format)(value, options);
+  }
+
+  if ((0, _is.isBigNumber)(value)) {
+    return (0, _formatter.format)(value, options);
+  } // note: we use unsafe duck-typing here to check for Fractions, this is
+  // ok here since we're only invoking toString or concatenating its values
+
+
+  if (looksLikeFraction(value)) {
+    if (!options || options.fraction !== 'decimal') {
+      // output as ratio, like '1/3'
+      return value.s * value.n + '/' + value.d;
+    } else {
+      // output as decimal, like '0.(3)'
+      return value.toString();
+    }
+  }
+
+  if (Array.isArray(value)) {
+    return formatArray(value, options);
+  }
+
+  if ((0, _is.isString)(value)) {
+    return '"' + value + '"';
+  }
+
+  if (typeof value === 'function') {
+    return value.syntax ? String(value.syntax) : 'function';
+  }
+
+  if (value && (0, _typeof2.default)(value) === 'object') {
+    if (typeof value.format === 'function') {
+      return value.format(options);
+    } else if (value && value.toString(options) !== {}.toString()) {
+      // this object has a non-native toString method, use that one
+      return value.toString(options);
+    } else {
+      var entries = Object.keys(value).map(function (key) {
+        return '"' + key + '": ' + format(value[key], options);
+      });
+      return '{' + entries.join(', ') + '}';
+    }
+  }
+
+  return String(value);
+}
+/**
+ * Stringify a value into a string enclosed in double quotes.
+ * Unescaped double quotes and backslashes inside the value are escaped.
+ * @param {*} value
+ * @return {string}
+ */
+
+
+function stringify(value) {
+  var text = String(value);
+  var escaped = '';
+  var i = 0;
+
+  while (i < text.length) {
+    var c = text.charAt(i);
+
+    if (c === '\\') {
+      escaped += c;
+      i++;
+      c = text.charAt(i);
+
+      if (c === '' || '"\\/bfnrtu'.indexOf(c) === -1) {
+        escaped += '\\'; // no valid escape character -> escape it
+      }
+
+      escaped += c;
+    } else if (c === '"') {
+      escaped += '\\"';
+    } else {
+      escaped += c;
+    }
+
+    i++;
+  }
+
+  return '"' + escaped + '"';
+}
+/**
+ * Escape special HTML characters
+ * @param {*} value
+ * @return {string}
+ */
+
+
+function escape(value) {
+  var text = String(value);
+  text = text.replace(/&/g, '&amp;').replace(/"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');
+  return text;
+}
+/**
+ * Recursively format an n-dimensional matrix
+ * Example output: "[[1, 2], [3, 4]]"
+ * @param {Array} array
+ * @param {Object | number | Function} [options]  Formatting options. See
+ *                                                lib/utils/number:format for a
+ *                                                description of the available
+ *                                                options.
+ * @returns {string} str
+ */
+
+
+function formatArray(array, options) {
+  if (Array.isArray(array)) {
+    var str = '[';
+    var len = array.length;
+
+    for (var i = 0; i < len; i++) {
+      if (i !== 0) {
+        str += ', ';
+      }
+
+      str += formatArray(array[i], options);
+    }
+
+    str += ']';
+    return str;
+  } else {
+    return format(array, options);
+  }
+}
+/**
+ * Check whether a value looks like a Fraction (unsafe duck-type check)
+ * @param {*} value
+ * @return {boolean}
+ */
+
+
+function looksLikeFraction(value) {
+  return value && (0, _typeof2.default)(value) === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;
+}
+/**
+ * Compare two strings
+ * @param {string} x
+ * @param {string} y
+ * @returns {number}
+ */
+
+
+function compareText(x, y) {
+  // we don't want to convert numbers to string, only accept string input
+  if (!(0, _is.isString)(x)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + (0, _is.typeOf)(x) + ', index: 0)');
+  }
+
+  if (!(0, _is.isString)(y)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + (0, _is.typeOf)(y) + ', index: 1)');
+  }
+
+  return x === y ? 0 : x > y ? 1 : -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/switch.js b/node_modules/mathjs/lib/cjs/utils/switch.js
new file mode 100644
index 0000000..b7b03fe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/switch.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports._switch = _switch;
+
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+function _switch(mat) {
+  var I = mat.length;
+  var J = mat[0].length;
+  var i, j;
+  var ret = [];
+
+  for (j = 0; j < J; j++) {
+    var tmp = [];
+
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+
+    ret.push(tmp);
+  }
+
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/version.js b/node_modules/mathjs/lib/cjs/version.js
new file mode 100644
index 0000000..10044e0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/version.js
@@ -0,0 +1,10 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.version = void 0;
+var version = '10.4.3'; // Note: This file is automatically generated when building math.js.
+// Changes made in this file will be overwritten.
+
+exports.version = version;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/constants.js b/node_modules/mathjs/lib/esm/constants.js
new file mode 100644
index 0000000..3be9d08
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/constants.js
@@ -0,0 +1,120 @@
+import { factory } from './utils/factory.js';
+import { version } from './version.js';
+import { createBigNumberE, createBigNumberPhi, createBigNumberPi, createBigNumberTau } from './utils/bignumber/constants.js';
+import { pi, tau, e, phi } from './plain/number/index.js';
+export var createTrue = /* #__PURE__ */factory('true', [], () => true);
+export var createFalse = /* #__PURE__ */factory('false', [], () => false);
+export var createNull = /* #__PURE__ */factory('null', [], () => null);
+export var createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], _ref => {
+  var {
+    config,
+    BigNumber
+  } = _ref;
+  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;
+});
+export var createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], _ref2 => {
+  var {
+    config,
+    BigNumber
+  } = _ref2;
+  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;
+});
+export var createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], _ref3 => {
+  var {
+    config,
+    BigNumber
+  } = _ref3;
+  return config.number === 'BigNumber' ? createBigNumberPi(BigNumber) : pi;
+});
+export var createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], _ref4 => {
+  var {
+    config,
+    BigNumber
+  } = _ref4;
+  return config.number === 'BigNumber' ? createBigNumberTau(BigNumber) : tau;
+});
+export var createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], _ref5 => {
+  var {
+    config,
+    BigNumber
+  } = _ref5;
+  return config.number === 'BigNumber' ? createBigNumberE(BigNumber) : e;
+}); // golden ratio, (1+sqrt(5))/2
+
+export var createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], _ref6 => {
+  var {
+    config,
+    BigNumber
+  } = _ref6;
+  return config.number === 'BigNumber' ? createBigNumberPhi(BigNumber) : phi;
+});
+export var createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], _ref7 => {
+  var {
+    config,
+    BigNumber
+  } = _ref7;
+  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;
+});
+export var createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], _ref8 => {
+  var {
+    config,
+    BigNumber
+  } = _ref8;
+  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;
+});
+export var createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], _ref9 => {
+  var {
+    config,
+    BigNumber
+  } = _ref9;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;
+});
+export var createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], _ref10 => {
+  var {
+    config,
+    BigNumber
+  } = _ref10;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;
+});
+export var createSQRT1_2 = /* #__PURE__ */recreateFactory( // eslint-disable-line camelcase
+'SQRT1_2', ['config', '?BigNumber'], _ref11 => {
+  var {
+    config,
+    BigNumber
+  } = _ref11;
+  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;
+});
+export var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], _ref12 => {
+  var {
+    config,
+    BigNumber
+  } = _ref12;
+  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;
+});
+export var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], _ref13 => {
+  var {
+    Complex
+  } = _ref13;
+  return Complex.I;
+}); // for backward compatibility with v5
+
+export var createUppercasePi = /* #__PURE__ */factory('PI', ['pi'], _ref14 => {
+  var {
+    pi
+  } = _ref14;
+  return pi;
+});
+export var createUppercaseE = /* #__PURE__ */factory('E', ['e'], _ref15 => {
+  var {
+    e
+  } = _ref15;
+  return e;
+});
+export var createVersion = /* #__PURE__ */factory('version', [], () => version); // helper function to create a factory with a flag recreateOnConfigChange
+// idea: allow passing optional properties to be attached to the factory function as 4th argument?
+
+function recreateFactory(name, dependencies, create) {
+  return factory(name, dependencies, create, {
+    recreateOnConfigChange: true
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/config.js b/node_modules/mathjs/lib/esm/core/config.js
new file mode 100644
index 0000000..5657f4e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/config.js
@@ -0,0 +1,19 @@
+export var DEFAULT_CONFIG = {
+  // minimum relative difference between two compared values,
+  // used by all comparison functions
+  epsilon: 1e-12,
+  // type of default matrix output. Choose 'matrix' (default) or 'array'
+  matrix: 'Matrix',
+  // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction
+  number: 'number',
+  // number of significant digits in BigNumbers
+  precision: 64,
+  // predictable output type of functions. When true, output type depends only
+  // on the input types. When false (default), output type can vary depending
+  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when
+  // predictable is false, and returns `NaN` when true.
+  predictable: false,
+  // random seed for seeded pseudo random number generation
+  // null = randomly seed
+  randomSeed: null
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/create.js b/node_modules/mathjs/lib/esm/core/create.js
new file mode 100644
index 0000000..e6b080a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/create.js
@@ -0,0 +1,198 @@
+import _extends from "@babel/runtime/helpers/extends";
+import './../utils/polyfills.js';
+import { deepFlatten, isLegacyFactory, values } from '../utils/object.js';
+import * as emitter from './../utils/emitter.js';
+import { importFactory } from './function/import.js';
+import { configFactory } from './function/config.js';
+import { factory, isFactory } from '../utils/factory.js';
+import { 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, isRegExp, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../utils/is.js';
+import { ArgumentsError } from '../error/ArgumentsError.js';
+import { DimensionError } from '../error/DimensionError.js';
+import { IndexError } from '../error/IndexError.js';
+import { DEFAULT_CONFIG } from './config.js';
+/**
+ * Create a mathjs instance from given factory functions and optionally config
+ *
+ * Usage:
+ *
+ *     const mathjs1 = create({ createAdd, createMultiply, ...})
+ *     const config = { number: 'BigNumber' }
+ *     const mathjs2 = create(all, config)
+ *
+ * @param {Object} [factories] An object with factory functions
+ *                             The object can contain nested objects,
+ *                             all nested objects will be flattened.
+ * @param {Object} [config]    Available options:
+ *                            {number} epsilon
+ *                              Minimum relative difference between two
+ *                              compared values, used by all comparison functions.
+ *                            {string} matrix
+ *                              A string 'Matrix' (default) or 'Array'.
+ *                            {string} number
+ *                              A string 'number' (default), 'BigNumber', or 'Fraction'
+ *                            {number} precision
+ *                              The number of significant digits for BigNumbers.
+ *                              Not applicable for Numbers.
+ *                            {boolean} predictable
+ *                              Predictable output type of functions. When true,
+ *                              output type depends only on the input types. When
+ *                              false (default), output type can vary depending
+ *                              on input values. For example `math.sqrt(-4)`
+ *                              returns `complex('2i')` when predictable is false, and
+ *                              returns `NaN` when true.
+ *                            {string} randomSeed
+ *                              Random seed for seeded pseudo random number generator.
+ *                              Set to null to randomly seed.
+ * @returns {Object} Returns a bare-bone math.js instance containing
+ *                   functions:
+ *                   - `import` to add new functions
+ *                   - `config` to change configuration
+ *                   - `on`, `off`, `once`, `emit` for events
+ */
+
+export function create(factories, config) {
+  var configInternal = _extends({}, DEFAULT_CONFIG, config); // simple test for ES5 support
+
+
+  if (typeof Object.create !== 'function') {
+    throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');
+  } // create the mathjs instance
+
+
+  var math = emitter.mixin({
+    // only here for backward compatibility for legacy factory functions
+    isNumber,
+    isComplex,
+    isBigNumber,
+    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,
+    isSymbolNode,
+    isChain
+  }); // load config function and apply provided config
+
+  math.config = configFactory(configInternal, math.emit);
+  math.expression = {
+    transform: {},
+    mathWithTransform: {
+      config: math.config
+    }
+  }; // cached factories and instances used by function load
+
+  var legacyFactories = [];
+  var legacyInstances = [];
+  /**
+   * Load a function or data type from a factory.
+   * If the function or data type already exists, the existing instance is
+   * returned.
+   * @param {Function} factory
+   * @returns {*}
+   */
+
+  function load(factory) {
+    if (isFactory(factory)) {
+      return factory(math);
+    }
+
+    var firstProperty = factory[Object.keys(factory)[0]];
+
+    if (isFactory(firstProperty)) {
+      return firstProperty(math);
+    }
+
+    if (!isLegacyFactory(factory)) {
+      console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);
+      throw new Error('Factory object with properties `type`, `name`, and `factory` expected');
+    }
+
+    var index = legacyFactories.indexOf(factory);
+    var instance;
+
+    if (index === -1) {
+      // doesn't yet exist
+      if (factory.math === true) {
+        // pass with math namespace
+        instance = factory.factory(math.type, configInternal, load, math.typed, math);
+      } else {
+        instance = factory.factory(math.type, configInternal, load, math.typed);
+      } // append to the cache
+
+
+      legacyFactories.push(factory);
+      legacyInstances.push(instance);
+    } else {
+      // already existing function, return the cached instance
+      instance = legacyInstances[index];
+    }
+
+    return instance;
+  }
+
+  var importedFactories = {}; // load the import function
+
+  function lazyTyped() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+
+    return math.typed.apply(math.typed, args);
+  }
+
+  var internalImport = importFactory(lazyTyped, load, math, importedFactories);
+  math.import = internalImport; // listen for changes in config, import all functions again when changed
+  // TODO: move this listener into the import function?
+
+  math.on('config', () => {
+    values(importedFactories).forEach(factory => {
+      if (factory && factory.meta && factory.meta.recreateOnConfigChange) {
+        // FIXME: only re-create when the current instance is the same as was initially created
+        // FIXME: delete the functions/constants before importing them again?
+        internalImport(factory, {
+          override: true
+        });
+      }
+    });
+  }); // the create function exposed on the mathjs instance is bound to
+  // the factory functions passed before
+
+  math.create = create.bind(null, factories); // export factory function
+
+  math.factory = factory; // import the factory functions like createAdd as an array instead of object,
+  // else they will get a different naming (`createAdd` instead of `add`).
+
+  math.import(values(deepFlatten(factories)));
+  math.ArgumentsError = ArgumentsError;
+  math.DimensionError = DimensionError;
+  math.IndexError = IndexError;
+  return math;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/function/config.js b/node_modules/mathjs/lib/esm/core/function/config.js
new file mode 100644
index 0000000..e0db048
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/function/config.js
@@ -0,0 +1,104 @@
+import { clone, mapObject, deepExtend } from '../../utils/object.js';
+import { DEFAULT_CONFIG } from '../config.js';
+export var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix
+
+export var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number
+
+export function configFactory(config, emit) {
+  /**
+   * Set configuration options for math.js, and get current options.
+   * Will emit a 'config' event, with arguments (curr, prev, changes).
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *     math.config(config: Object): Object
+   *
+   * Examples:
+   *
+   *
+   *     import { create, all } from 'mathjs'
+   *
+   *     // create a mathjs instance
+   *     const math = create(all)
+   *
+   *     math.config().number                // outputs 'number'
+   *     math.evaluate('0.4')                // outputs number 0.4
+   *     math.config({number: 'Fraction'})
+   *     math.evaluate('0.4')                // outputs Fraction 2/5
+   *
+   * @param {Object} [options] Available options:
+   *                            {number} epsilon
+   *                              Minimum relative difference between two
+   *                              compared values, used by all comparison functions.
+   *                            {string} matrix
+   *                              A string 'Matrix' (default) or 'Array'.
+   *                            {string} number
+   *                              A string 'number' (default), 'BigNumber', or 'Fraction'
+   *                            {number} precision
+   *                              The number of significant digits for BigNumbers.
+   *                              Not applicable for Numbers.
+   *                            {string} parenthesis
+   *                              How to display parentheses in LaTeX and string
+   *                              output.
+   *                            {string} randomSeed
+   *                              Random seed for seeded pseudo random number generator.
+   *                              Set to null to randomly seed.
+   * @return {Object} Returns the current configuration
+   */
+  function _config(options) {
+    if (options) {
+      var prev = mapObject(config, clone); // validate some of the options
+
+      validateOption(options, 'matrix', MATRIX_OPTIONS);
+      validateOption(options, 'number', NUMBER_OPTIONS); // merge options
+
+      deepExtend(config, options);
+      var curr = mapObject(config, clone);
+      var changes = mapObject(options, clone); // emit 'config' event
+
+      emit('config', curr, prev, changes);
+      return curr;
+    } else {
+      return mapObject(config, clone);
+    }
+  } // attach the valid options to the function so they can be extended
+
+
+  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;
+  _config.NUMBER_OPTIONS = NUMBER_OPTIONS; // attach the config properties as readonly properties to the config function
+
+  Object.keys(DEFAULT_CONFIG).forEach(key => {
+    Object.defineProperty(_config, key, {
+      get: () => config[key],
+      enumerable: true,
+      configurable: true
+    });
+  });
+  return _config;
+}
+/**
+ * Test whether an Array contains a specific item.
+ * @param {Array.<string>} array
+ * @param {string} item
+ * @return {boolean}
+ */
+
+function contains(array, item) {
+  return array.indexOf(item) !== -1;
+}
+/**
+ * Validate an option
+ * @param {Object} options         Object with options
+ * @param {string} name            Name of the option to validate
+ * @param {Array.<string>} values  Array with valid values for this option
+ */
+
+
+function validateOption(options, name, values) {
+  if (options[name] !== undefined && !contains(values, options[name])) {
+    // unknown value
+    console.warn('Warning: Unknown value "' + options[name] + '" for configuration option "' + name + '". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/function/import.js b/node_modules/mathjs/lib/esm/core/function/import.js
new file mode 100644
index 0000000..9fc6556
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/function/import.js
@@ -0,0 +1,373 @@
+import { isBigNumber, isComplex, isFraction, isMatrix, isUnit } from '../../utils/is.js';
+import { isFactory, stripOptionalNotation } from '../../utils/factory.js';
+import { hasOwnProperty, lazy } from '../../utils/object.js';
+import { contains } from '../../utils/array.js';
+import { ArgumentsError } from '../../error/ArgumentsError.js';
+export function importFactory(typed, load, math, importedFactories) {
+  /**
+   * Import functions from an object or a module.
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *    math.import(functions)
+   *    math.import(functions, options)
+   *
+   * Where:
+   *
+   * - `functions: Object`
+   *   An object with functions or factories to be imported.
+   * - `options: Object` An object with import options. Available options:
+   *   - `override: boolean`
+   *     If true, existing functions will be overwritten. False by default.
+   *   - `silent: boolean`
+   *     If true, the function will not throw errors on duplicates or invalid
+   *     types. False by default.
+   *   - `wrap: boolean`
+   *     If true, the functions will be wrapped in a wrapper function
+   *     which converts data types like Matrix to primitive data types like Array.
+   *     The wrapper is needed when extending math.js with libraries which do not
+   *     support these data type. False by default.
+   *
+   * Examples:
+   *
+   *    import { create, all } from 'mathjs'
+   *    import * as numbers from 'numbers'
+   *
+   *    // create a mathjs instance
+   *    const math = create(all)
+   *
+   *    // define new functions and variables
+   *    math.import({
+   *      myvalue: 42,
+   *      hello: function (name) {
+   *        return 'hello, ' + name + '!'
+   *      }
+   *    })
+   *
+   *    // use the imported function and variable
+   *    math.myvalue * 2               // 84
+   *    math.hello('user')             // 'hello, user!'
+   *
+   *    // import the npm module 'numbers'
+   *    // (must be installed first with `npm install numbers`)
+   *    math.import(numbers, {wrap: true})
+   *
+   *    math.fibonacci(7) // returns 13
+   *
+   * @param {Object | Array} functions  Object with functions to be imported.
+   * @param {Object} [options]          Import options.
+   */
+  function mathImport(functions, options) {
+    var num = arguments.length;
+
+    if (num !== 1 && num !== 2) {
+      throw new ArgumentsError('import', num, 1, 2);
+    }
+
+    if (!options) {
+      options = {};
+    }
+
+    function flattenImports(flatValues, value, name) {
+      if (Array.isArray(value)) {
+        value.forEach(item => flattenImports(flatValues, item));
+      } else if (typeof value === 'object') {
+        for (var _name in value) {
+          if (hasOwnProperty(value, _name)) {
+            flattenImports(flatValues, value[_name], _name);
+          }
+        }
+      } else if (isFactory(value) || name !== undefined) {
+        var flatName = isFactory(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly
+        : value.fn : name; // we allow importing the same function twice if it points to the same implementation
+
+        if (hasOwnProperty(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {
+          throw new Error('Cannot import "' + flatName + '" twice');
+        }
+
+        flatValues[flatName] = value;
+      } else {
+        if (!options.silent) {
+          throw new TypeError('Factory, Object, or Array expected');
+        }
+      }
+    }
+
+    var flatValues = {};
+    flattenImports(flatValues, functions);
+
+    for (var name in flatValues) {
+      if (hasOwnProperty(flatValues, name)) {
+        // console.log('import', name)
+        var value = flatValues[name];
+
+        if (isFactory(value)) {
+          // we ignore name here and enforce the name of the factory
+          // maybe at some point we do want to allow overriding it
+          // in that case we can implement an option overrideFactoryNames: true
+          _importFactory(value, options);
+        } else if (isSupportedType(value)) {
+          _import(name, value, options);
+        } else {
+          if (!options.silent) {
+            throw new TypeError('Factory, Object, or Array expected');
+          }
+        }
+      }
+    }
+  }
+  /**
+   * Add a property to the math namespace
+   * @param {string} name
+   * @param {*} value
+   * @param {Object} options  See import for a description of the options
+   * @private
+   */
+
+
+  function _import(name, value, options) {
+    // TODO: refactor this function, it's to complicated and contains duplicate code
+    if (options.wrap && typeof value === 'function') {
+      // create a wrapper around the function
+      value = _wrap(value);
+    } // turn a plain function with a typed-function signature into a typed-function
+
+
+    if (hasTypedFunctionSignature(value)) {
+      value = typed(name, {
+        [value.signature]: value
+      });
+    }
+
+    if (isTypedFunction(math[name]) && isTypedFunction(value)) {
+      if (options.override) {
+        // give the typed function the right name
+        value = typed(name, value.signatures);
+      } else {
+        // merge the existing and typed function
+        value = typed(math[name], value);
+      }
+
+      math[name] = value;
+      delete importedFactories[name];
+
+      _importTransform(name, value);
+
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+
+    if (math[name] === undefined || options.override) {
+      math[name] = value;
+      delete importedFactories[name];
+
+      _importTransform(name, value);
+
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+
+    if (!options.silent) {
+      throw new Error('Cannot import "' + name + '": already exists');
+    }
+  }
+
+  function _importTransform(name, value) {
+    if (value && typeof value.transform === 'function') {
+      math.expression.transform[name] = value.transform;
+
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value.transform;
+      }
+    } else {
+      // remove existing transform
+      delete math.expression.transform[name];
+
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value;
+      }
+    }
+  }
+
+  function _deleteTransform(name) {
+    delete math.expression.transform[name];
+
+    if (allowedInExpressions(name)) {
+      math.expression.mathWithTransform[name] = math[name];
+    } else {
+      delete math.expression.mathWithTransform[name];
+    }
+  }
+  /**
+   * Create a wrapper a round an function which converts the arguments
+   * to their primitive values (like convert a Matrix to Array)
+   * @param {Function} fn
+   * @return {Function} Returns the wrapped function
+   * @private
+   */
+
+
+  function _wrap(fn) {
+    var wrapper = function wrapper() {
+      var args = [];
+
+      for (var i = 0, len = arguments.length; i < len; i++) {
+        var arg = arguments[i];
+        args[i] = arg && arg.valueOf();
+      }
+
+      return fn.apply(math, args);
+    };
+
+    if (fn.transform) {
+      wrapper.transform = fn.transform;
+    }
+
+    return wrapper;
+  }
+  /**
+   * Import an instance of a factory into math.js
+   * @param {function(scope: object)} factory
+   * @param {Object} options  See import for a description of the options
+   * @param {string} [name=factory.name] Optional custom name
+   * @private
+   */
+
+
+  function _importFactory(factory, options) {
+    var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;
+
+    if (contains(name, '.')) {
+      throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));
+    }
+
+    var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;
+    var existingTransform = (name in math.expression.transform);
+    var existing = hasOwnProperty(namespace, name) ? namespace[name] : undefined;
+
+    var resolver = function resolver() {
+      // collect all dependencies, handle finding both functions and classes and other special cases
+      var dependencies = {};
+      factory.dependencies.map(stripOptionalNotation).forEach(dependency => {
+        if (contains(dependency, '.')) {
+          throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));
+        }
+
+        if (dependency === 'math') {
+          dependencies.math = math;
+        } else if (dependency === 'mathWithTransform') {
+          dependencies.mathWithTransform = math.expression.mathWithTransform;
+        } else if (dependency === 'classes') {
+          // special case for json reviver
+          dependencies.classes = math;
+        } else {
+          dependencies[dependency] = math[dependency];
+        }
+      });
+      var instance = /* #__PURE__ */factory(dependencies);
+
+      if (instance && typeof instance.transform === 'function') {
+        throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with exports.path="expression.transform"');
+      }
+
+      if (existing === undefined || options.override) {
+        return instance;
+      }
+
+      if (isTypedFunction(existing) && isTypedFunction(instance)) {
+        // merge the existing and new typed function
+        return typed(existing, instance);
+      }
+
+      if (options.silent) {
+        // keep existing, ignore imported function
+        return existing;
+      } else {
+        throw new Error('Cannot import "' + name + '": already exists');
+      }
+    }; // TODO: add unit test with non-lazy factory
+
+
+    if (!factory.meta || factory.meta.lazy !== false) {
+      lazy(namespace, name, resolver); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+      } else {
+        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {
+          lazy(math.expression.mathWithTransform, name, () => namespace[name]);
+        }
+      }
+    } else {
+      namespace[name] = resolver(); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+      } else {
+        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {
+          lazy(math.expression.mathWithTransform, name, () => namespace[name]);
+        }
+      }
+    } // TODO: improve factories, store a list with imports instead which can be re-played
+
+
+    importedFactories[name] = factory;
+    math.emit('import', name, resolver);
+  }
+  /**
+   * Check whether given object is a type which can be imported
+   * @param {Function | number | string | boolean | null | Unit | Complex} object
+   * @return {boolean}
+   * @private
+   */
+
+
+  function isSupportedType(object) {
+    return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || isUnit(object) || isComplex(object) || isBigNumber(object) || isFraction(object) || isMatrix(object) || Array.isArray(object);
+  }
+  /**
+   * Test whether a given thing is a typed-function
+   * @param {*} fn
+   * @return {boolean} Returns true when `fn` is a typed-function
+   */
+
+
+  function isTypedFunction(fn) {
+    return typeof fn === 'function' && typeof fn.signatures === 'object';
+  }
+
+  function hasTypedFunctionSignature(fn) {
+    return typeof fn === 'function' && typeof fn.signature === 'string';
+  }
+
+  function allowedInExpressions(name) {
+    return !hasOwnProperty(unsafe, name);
+  }
+
+  function factoryAllowedInExpressions(factory) {
+    return factory.fn.indexOf('.') === -1 && // FIXME: make checking on path redundant, check on meta data instead
+    !hasOwnProperty(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);
+  }
+
+  function isTransformFunctionFactory(factory) {
+    return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;
+  } // namespaces and functions not available in the parser for safety reasons
+
+
+  var unsafe = {
+    expression: true,
+    type: true,
+    docs: true,
+    error: true,
+    json: true,
+    chain: true // chain method not supported. Note that there is a unit chain too.
+
+  };
+  return mathImport;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/function/typed.js b/node_modules/mathjs/lib/esm/core/function/typed.js
new file mode 100644
index 0000000..2e5fa52
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/function/typed.js
@@ -0,0 +1,389 @@
+/**
+ * Create a typed-function which checks the types of the arguments and
+ * can match them against multiple provided signatures. The typed-function
+ * automatically converts inputs in order to find a matching signature.
+ * Typed functions throw informative errors in case of wrong input arguments.
+ *
+ * See the library [typed-function](https://github.com/josdejong/typed-function)
+ * for detailed documentation.
+ *
+ * Syntax:
+ *
+ *     math.typed(name, signatures) : function
+ *     math.typed(signatures) : function
+ *
+ * Examples:
+ *
+ *     // create a typed function with multiple types per argument (type union)
+ *     const fn2 = typed({
+ *       'number | boolean': function (b) {
+ *         return 'b is a number or boolean'
+ *       },
+ *       'string, number | boolean': function (a, b) {
+ *         return 'a is a string, b is a number or boolean'
+ *       }
+ *     })
+ *
+ *     // create a typed function with an any type argument
+ *     const log = typed({
+ *       'string, any': function (event, data) {
+ *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))
+ *       }
+ *     })
+ *
+ * @param {string} [name]                          Optional name for the typed-function
+ * @param {Object<string, function>} signatures   Object with one or multiple function signatures
+ * @returns {function} The created typed-function.
+ */
+import { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigNumber, isBlockNode, isBoolean, isChain, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';
+import typedFunction from 'typed-function';
+import { digits } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { isMap } from '../../utils/map.js'; // returns a new instance of typed-function
+
+var _createTyped2 = function _createTyped() {
+  // initially, return the original instance of typed-function
+  // consecutively, return a new instance from typed.create.
+  _createTyped2 = typedFunction.create;
+  return typedFunction;
+};
+
+var dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];
+/**
+ * Factory function for creating a new typed instance
+ * @param {Object} dependencies   Object with data types like Complex and BigNumber
+ * @returns {Function}
+ */
+
+export var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {
+  var {
+    BigNumber,
+    Complex,
+    DenseMatrix,
+    Fraction
+  } = _ref;
+
+  // TODO: typed-function must be able to silently ignore signatures with unknown data types
+  // get a new instance of typed-function
+  var typed = _createTyped2(); // define all types. The order of the types determines in which order function
+  // arguments are type-checked (so for performance it's important to put the
+  // most used types first).
+
+
+  typed.types = [{
+    name: 'number',
+    test: isNumber
+  }, {
+    name: 'Complex',
+    test: isComplex
+  }, {
+    name: 'BigNumber',
+    test: isBigNumber
+  }, {
+    name: 'Fraction',
+    test: isFraction
+  }, {
+    name: 'Unit',
+    test: isUnit
+  }, {
+    name: 'string',
+    test: isString
+  }, {
+    name: 'Chain',
+    test: isChain
+  }, {
+    name: 'Array',
+    test: isArray
+  }, {
+    name: 'Matrix',
+    test: isMatrix
+  }, {
+    name: 'DenseMatrix',
+    test: isDenseMatrix
+  }, {
+    name: 'SparseMatrix',
+    test: isSparseMatrix
+  }, {
+    name: 'Range',
+    test: isRange
+  }, {
+    name: 'Index',
+    test: isIndex
+  }, {
+    name: 'boolean',
+    test: isBoolean
+  }, {
+    name: 'ResultSet',
+    test: isResultSet
+  }, {
+    name: 'Help',
+    test: isHelp
+  }, {
+    name: 'function',
+    test: isFunction
+  }, {
+    name: 'Date',
+    test: isDate
+  }, {
+    name: 'RegExp',
+    test: isRegExp
+  }, {
+    name: 'null',
+    test: isNull
+  }, {
+    name: 'undefined',
+    test: isUndefined
+  }, {
+    name: 'AccessorNode',
+    test: isAccessorNode
+  }, {
+    name: 'ArrayNode',
+    test: isArrayNode
+  }, {
+    name: 'AssignmentNode',
+    test: isAssignmentNode
+  }, {
+    name: 'BlockNode',
+    test: isBlockNode
+  }, {
+    name: 'ConditionalNode',
+    test: isConditionalNode
+  }, {
+    name: 'ConstantNode',
+    test: isConstantNode
+  }, {
+    name: 'FunctionNode',
+    test: isFunctionNode
+  }, {
+    name: 'FunctionAssignmentNode',
+    test: isFunctionAssignmentNode
+  }, {
+    name: 'IndexNode',
+    test: isIndexNode
+  }, {
+    name: 'Node',
+    test: isNode
+  }, {
+    name: 'ObjectNode',
+    test: isObjectNode
+  }, {
+    name: 'OperatorNode',
+    test: isOperatorNode
+  }, {
+    name: 'ParenthesisNode',
+    test: isParenthesisNode
+  }, {
+    name: 'RangeNode',
+    test: isRangeNode
+  }, {
+    name: 'SymbolNode',
+    test: isSymbolNode
+  }, {
+    name: 'Map',
+    test: isMap
+  }, {
+    name: 'Object',
+    test: isObject
+  } // order 'Object' last, it matches on other classes too
+  ];
+  typed.conversions = [{
+    from: 'number',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      } // note: conversion from number to BigNumber can fail if x has >15 digits
+
+
+      if (digits(x) > 15) {
+        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');
+      }
+
+      return new BigNumber(x);
+    }
+  }, {
+    from: 'number',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      return new Complex(x, 0);
+    }
+  }, {
+    from: 'number',
+    to: 'string',
+    convert: function convert(x) {
+      return x + '';
+    }
+  }, {
+    from: 'BigNumber',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      return new Complex(x.toNumber(), 0);
+    }
+  }, {
+    from: 'Fraction',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      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.');
+    }
+  }, {
+    from: 'Fraction',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      return new Complex(x.valueOf(), 0);
+    }
+  }, {
+    from: 'number',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+
+      var f = new Fraction(x);
+
+      if (f.valueOf() !== x) {
+        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.');
+      }
+
+      return f;
+    }
+  }, {
+    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`
+    //  from: 'Fraction',
+    //  to: 'number',
+    //  convert: function (x) {
+    //    return x.valueOf()
+    //  }
+    // }, {
+    from: 'string',
+    to: 'number',
+    convert: function convert(x) {
+      var n = Number(x);
+
+      if (isNaN(n)) {
+        throw new Error('Cannot convert "' + x + '" to a number');
+      }
+
+      return n;
+    }
+  }, {
+    from: 'string',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+
+      try {
+        return new BigNumber(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to BigNumber');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+
+      try {
+        return new Fraction(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Fraction');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+
+      try {
+        return new Complex(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Complex');
+      }
+    }
+  }, {
+    from: 'boolean',
+    to: 'number',
+    convert: function convert(x) {
+      return +x;
+    }
+  }, {
+    from: 'boolean',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+
+      return new BigNumber(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+
+      return new Fraction(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'string',
+    convert: function convert(x) {
+      return String(x);
+    }
+  }, {
+    from: 'Array',
+    to: 'Matrix',
+    convert: function convert(array) {
+      if (!DenseMatrix) {
+        throwNoMatrix();
+      }
+
+      return new DenseMatrix(array);
+    }
+  }, {
+    from: 'Matrix',
+    to: 'Array',
+    convert: function convert(matrix) {
+      return matrix.valueOf();
+    }
+  }];
+  return typed;
+});
+
+function throwNoBignumber(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a BigNumber: no class 'BigNumber' provided"));
+}
+
+function throwNoComplex(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a Complex number: no class 'Complex' provided"));
+}
+
+function throwNoMatrix() {
+  throw new Error('Cannot convert array into a Matrix: no class \'DenseMatrix\' provided');
+}
+
+function throwNoFraction(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a Fraction, no class 'Fraction' provided."));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/defaultInstance.js b/node_modules/mathjs/lib/esm/defaultInstance.js
new file mode 100644
index 0000000..630e984
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/defaultInstance.js
@@ -0,0 +1,3 @@
+import * as all from './factoriesAny.js';
+import { create } from './core/create.js';
+export default create(all);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/allFactoriesAny.js b/node_modules/mathjs/lib/esm/entry/allFactoriesAny.js
new file mode 100644
index 0000000..b4e11fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/allFactoriesAny.js
@@ -0,0 +1,3 @@
+// creating all factories here in a separate file is needed to get tree-shaking working
+import * as allFactories from '../factoriesAny.js';
+export var all = allFactories;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/allFactoriesNumber.js b/node_modules/mathjs/lib/esm/entry/allFactoriesNumber.js
new file mode 100644
index 0000000..e4221a3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/allFactoriesNumber.js
@@ -0,0 +1,3 @@
+// creating all factories here in a separate file is needed to get tree-shaking working
+import * as allFactories from '../factoriesNumber.js';
+export var all = allFactories;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/configReadonly.js b/node_modules/mathjs/lib/esm/entry/configReadonly.js
new file mode 100644
index 0000000..7a962fd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/configReadonly.js
@@ -0,0 +1,16 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { DEFAULT_CONFIG } from '../core/config.js';
+import { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js'; // create a read-only version of config
+
+export var config = /* #__PURE__ */function config(options) {
+  if (options) {
+    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');
+  }
+
+  return Object.freeze(DEFAULT_CONFIG);
+};
+
+_extends(config, DEFAULT_CONFIG, {
+  MATRIX_OPTIONS,
+  NUMBER_OPTIONS
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny.generated.js
new file mode 100644
index 0000000..b4d4aae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny.generated.js
@@ -0,0 +1,346 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+export { absDependencies } from './dependenciesAny/dependenciesAbs.generated.js';
+export { AccessorNodeDependencies } from './dependenciesAny/dependenciesAccessorNode.generated.js';
+export { acosDependencies } from './dependenciesAny/dependenciesAcos.generated.js';
+export { acoshDependencies } from './dependenciesAny/dependenciesAcosh.generated.js';
+export { acotDependencies } from './dependenciesAny/dependenciesAcot.generated.js';
+export { acothDependencies } from './dependenciesAny/dependenciesAcoth.generated.js';
+export { acscDependencies } from './dependenciesAny/dependenciesAcsc.generated.js';
+export { acschDependencies } from './dependenciesAny/dependenciesAcsch.generated.js';
+export { addDependencies } from './dependenciesAny/dependenciesAdd.generated.js';
+export { addScalarDependencies } from './dependenciesAny/dependenciesAddScalar.generated.js';
+export { andDependencies } from './dependenciesAny/dependenciesAnd.generated.js';
+export { applyDependencies } from './dependenciesAny/dependenciesApply.generated.js';
+export { applyTransformDependencies } from './dependenciesAny/dependenciesApplyTransform.generated.js';
+export { argDependencies } from './dependenciesAny/dependenciesArg.generated.js';
+export { ArrayNodeDependencies } from './dependenciesAny/dependenciesArrayNode.generated.js';
+export { asecDependencies } from './dependenciesAny/dependenciesAsec.generated.js';
+export { asechDependencies } from './dependenciesAny/dependenciesAsech.generated.js';
+export { asinDependencies } from './dependenciesAny/dependenciesAsin.generated.js';
+export { asinhDependencies } from './dependenciesAny/dependenciesAsinh.generated.js';
+export { AssignmentNodeDependencies } from './dependenciesAny/dependenciesAssignmentNode.generated.js';
+export { atanDependencies } from './dependenciesAny/dependenciesAtan.generated.js';
+export { atan2Dependencies } from './dependenciesAny/dependenciesAtan2.generated.js';
+export { atanhDependencies } from './dependenciesAny/dependenciesAtanh.generated.js';
+export { atomicMassDependencies } from './dependenciesAny/dependenciesAtomicMass.generated.js';
+export { avogadroDependencies } from './dependenciesAny/dependenciesAvogadro.generated.js';
+export { bellNumbersDependencies } from './dependenciesAny/dependenciesBellNumbers.generated.js';
+export { BigNumberDependencies } from './dependenciesAny/dependenciesBigNumberClass.generated.js';
+export { bignumberDependencies } from './dependenciesAny/dependenciesBignumber.generated.js';
+export { binDependencies } from './dependenciesAny/dependenciesBin.generated.js';
+export { bitAndDependencies } from './dependenciesAny/dependenciesBitAnd.generated.js';
+export { bitNotDependencies } from './dependenciesAny/dependenciesBitNot.generated.js';
+export { bitOrDependencies } from './dependenciesAny/dependenciesBitOr.generated.js';
+export { bitXorDependencies } from './dependenciesAny/dependenciesBitXor.generated.js';
+export { BlockNodeDependencies } from './dependenciesAny/dependenciesBlockNode.generated.js';
+export { bohrMagnetonDependencies } from './dependenciesAny/dependenciesBohrMagneton.generated.js';
+export { bohrRadiusDependencies } from './dependenciesAny/dependenciesBohrRadius.generated.js';
+export { boltzmannDependencies } from './dependenciesAny/dependenciesBoltzmann.generated.js';
+export { booleanDependencies } from './dependenciesAny/dependenciesBoolean.generated.js';
+export { catalanDependencies } from './dependenciesAny/dependenciesCatalan.generated.js';
+export { cbrtDependencies } from './dependenciesAny/dependenciesCbrt.generated.js';
+export { ceilDependencies } from './dependenciesAny/dependenciesCeil.generated.js';
+export { chainDependencies } from './dependenciesAny/dependenciesChain.generated.js';
+export { ChainDependencies } from './dependenciesAny/dependenciesChainClass.generated.js';
+export { classicalElectronRadiusDependencies } from './dependenciesAny/dependenciesClassicalElectronRadius.generated.js';
+export { cloneDependencies } from './dependenciesAny/dependenciesClone.generated.js';
+export { columnDependencies } from './dependenciesAny/dependenciesColumn.generated.js';
+export { columnTransformDependencies } from './dependenciesAny/dependenciesColumnTransform.generated.js';
+export { combinationsDependencies } from './dependenciesAny/dependenciesCombinations.generated.js';
+export { combinationsWithRepDependencies } from './dependenciesAny/dependenciesCombinationsWithRep.generated.js';
+export { compareDependencies } from './dependenciesAny/dependenciesCompare.generated.js';
+export { compareNaturalDependencies } from './dependenciesAny/dependenciesCompareNatural.generated.js';
+export { compareTextDependencies } from './dependenciesAny/dependenciesCompareText.generated.js';
+export { compileDependencies } from './dependenciesAny/dependenciesCompile.generated.js';
+export { complexDependencies } from './dependenciesAny/dependenciesComplex.generated.js';
+export { ComplexDependencies } from './dependenciesAny/dependenciesComplexClass.generated.js';
+export { compositionDependencies } from './dependenciesAny/dependenciesComposition.generated.js';
+export { concatDependencies } from './dependenciesAny/dependenciesConcat.generated.js';
+export { concatTransformDependencies } from './dependenciesAny/dependenciesConcatTransform.generated.js';
+export { ConditionalNodeDependencies } from './dependenciesAny/dependenciesConditionalNode.generated.js';
+export { conductanceQuantumDependencies } from './dependenciesAny/dependenciesConductanceQuantum.generated.js';
+export { conjDependencies } from './dependenciesAny/dependenciesConj.generated.js';
+export { ConstantNodeDependencies } from './dependenciesAny/dependenciesConstantNode.generated.js';
+export { cosDependencies } from './dependenciesAny/dependenciesCos.generated.js';
+export { coshDependencies } from './dependenciesAny/dependenciesCosh.generated.js';
+export { cotDependencies } from './dependenciesAny/dependenciesCot.generated.js';
+export { cothDependencies } from './dependenciesAny/dependenciesCoth.generated.js';
+export { coulombDependencies } from './dependenciesAny/dependenciesCoulomb.generated.js';
+export { countDependencies } from './dependenciesAny/dependenciesCount.generated.js';
+export { createUnitDependencies } from './dependenciesAny/dependenciesCreateUnit.generated.js';
+export { crossDependencies } from './dependenciesAny/dependenciesCross.generated.js';
+export { cscDependencies } from './dependenciesAny/dependenciesCsc.generated.js';
+export { cschDependencies } from './dependenciesAny/dependenciesCsch.generated.js';
+export { ctransposeDependencies } from './dependenciesAny/dependenciesCtranspose.generated.js';
+export { cubeDependencies } from './dependenciesAny/dependenciesCube.generated.js';
+export { cumsumDependencies } from './dependenciesAny/dependenciesCumSum.generated.js';
+export { cumsumTransformDependencies } from './dependenciesAny/dependenciesCumSumTransform.generated.js';
+export { deepEqualDependencies } from './dependenciesAny/dependenciesDeepEqual.generated.js';
+export { DenseMatrixDependencies } from './dependenciesAny/dependenciesDenseMatrixClass.generated.js';
+export { derivativeDependencies } from './dependenciesAny/dependenciesDerivative.generated.js';
+export { detDependencies } from './dependenciesAny/dependenciesDet.generated.js';
+export { deuteronMassDependencies } from './dependenciesAny/dependenciesDeuteronMass.generated.js';
+export { diagDependencies } from './dependenciesAny/dependenciesDiag.generated.js';
+export { diffDependencies } from './dependenciesAny/dependenciesDiff.generated.js';
+export { diffTransformDependencies } from './dependenciesAny/dependenciesDiffTransform.generated.js';
+export { distanceDependencies } from './dependenciesAny/dependenciesDistance.generated.js';
+export { divideDependencies } from './dependenciesAny/dependenciesDivide.generated.js';
+export { divideScalarDependencies } from './dependenciesAny/dependenciesDivideScalar.generated.js';
+export { dotDependencies } from './dependenciesAny/dependenciesDot.generated.js';
+export { dotDivideDependencies } from './dependenciesAny/dependenciesDotDivide.generated.js';
+export { dotMultiplyDependencies } from './dependenciesAny/dependenciesDotMultiply.generated.js';
+export { dotPowDependencies } from './dependenciesAny/dependenciesDotPow.generated.js';
+export { eDependencies } from './dependenciesAny/dependenciesE.generated.js';
+export { efimovFactorDependencies } from './dependenciesAny/dependenciesEfimovFactor.generated.js';
+export { eigsDependencies } from './dependenciesAny/dependenciesEigs.generated.js';
+export { electricConstantDependencies } from './dependenciesAny/dependenciesElectricConstant.generated.js';
+export { electronMassDependencies } from './dependenciesAny/dependenciesElectronMass.generated.js';
+export { elementaryChargeDependencies } from './dependenciesAny/dependenciesElementaryCharge.generated.js';
+export { equalDependencies } from './dependenciesAny/dependenciesEqual.generated.js';
+export { equalScalarDependencies } from './dependenciesAny/dependenciesEqualScalar.generated.js';
+export { equalTextDependencies } from './dependenciesAny/dependenciesEqualText.generated.js';
+export { erfDependencies } from './dependenciesAny/dependenciesErf.generated.js';
+export { evaluateDependencies } from './dependenciesAny/dependenciesEvaluate.generated.js';
+export { expDependencies } from './dependenciesAny/dependenciesExp.generated.js';
+export { expmDependencies } from './dependenciesAny/dependenciesExpm.generated.js';
+export { expm1Dependencies } from './dependenciesAny/dependenciesExpm1.generated.js';
+export { factorialDependencies } from './dependenciesAny/dependenciesFactorial.generated.js';
+export { falseDependencies } from './dependenciesAny/dependenciesFalse.generated.js';
+export { faradayDependencies } from './dependenciesAny/dependenciesFaraday.generated.js';
+export { fermiCouplingDependencies } from './dependenciesAny/dependenciesFermiCoupling.generated.js';
+export { FibonacciHeapDependencies } from './dependenciesAny/dependenciesFibonacciHeapClass.generated.js';
+export { filterDependencies } from './dependenciesAny/dependenciesFilter.generated.js';
+export { filterTransformDependencies } from './dependenciesAny/dependenciesFilterTransform.generated.js';
+export { fineStructureDependencies } from './dependenciesAny/dependenciesFineStructure.generated.js';
+export { firstRadiationDependencies } from './dependenciesAny/dependenciesFirstRadiation.generated.js';
+export { fixDependencies } from './dependenciesAny/dependenciesFix.generated.js';
+export { flattenDependencies } from './dependenciesAny/dependenciesFlatten.generated.js';
+export { floorDependencies } from './dependenciesAny/dependenciesFloor.generated.js';
+export { forEachDependencies } from './dependenciesAny/dependenciesForEach.generated.js';
+export { forEachTransformDependencies } from './dependenciesAny/dependenciesForEachTransform.generated.js';
+export { formatDependencies } from './dependenciesAny/dependenciesFormat.generated.js';
+export { fractionDependencies } from './dependenciesAny/dependenciesFraction.generated.js';
+export { FractionDependencies } from './dependenciesAny/dependenciesFractionClass.generated.js';
+export { FunctionAssignmentNodeDependencies } from './dependenciesAny/dependenciesFunctionAssignmentNode.generated.js';
+export { FunctionNodeDependencies } from './dependenciesAny/dependenciesFunctionNode.generated.js';
+export { gammaDependencies } from './dependenciesAny/dependenciesGamma.generated.js';
+export { gasConstantDependencies } from './dependenciesAny/dependenciesGasConstant.generated.js';
+export { gcdDependencies } from './dependenciesAny/dependenciesGcd.generated.js';
+export { getMatrixDataTypeDependencies } from './dependenciesAny/dependenciesGetMatrixDataType.generated.js';
+export { gravitationConstantDependencies } from './dependenciesAny/dependenciesGravitationConstant.generated.js';
+export { gravityDependencies } from './dependenciesAny/dependenciesGravity.generated.js';
+export { hartreeEnergyDependencies } from './dependenciesAny/dependenciesHartreeEnergy.generated.js';
+export { hasNumericValueDependencies } from './dependenciesAny/dependenciesHasNumericValue.generated.js';
+export { helpDependencies } from './dependenciesAny/dependenciesHelp.generated.js';
+export { HelpDependencies } from './dependenciesAny/dependenciesHelpClass.generated.js';
+export { hexDependencies } from './dependenciesAny/dependenciesHex.generated.js';
+export { hypotDependencies } from './dependenciesAny/dependenciesHypot.generated.js';
+export { iDependencies } from './dependenciesAny/dependenciesI.generated.js';
+export { identityDependencies } from './dependenciesAny/dependenciesIdentity.generated.js';
+export { imDependencies } from './dependenciesAny/dependenciesIm.generated.js';
+export { ImmutableDenseMatrixDependencies } from './dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js';
+export { indexDependencies } from './dependenciesAny/dependenciesIndex.generated.js';
+export { IndexDependencies } from './dependenciesAny/dependenciesIndexClass.generated.js';
+export { IndexNodeDependencies } from './dependenciesAny/dependenciesIndexNode.generated.js';
+export { indexTransformDependencies } from './dependenciesAny/dependenciesIndexTransform.generated.js';
+export { InfinityDependencies } from './dependenciesAny/dependenciesInfinity.generated.js';
+export { intersectDependencies } from './dependenciesAny/dependenciesIntersect.generated.js';
+export { invDependencies } from './dependenciesAny/dependenciesInv.generated.js';
+export { inverseConductanceQuantumDependencies } from './dependenciesAny/dependenciesInverseConductanceQuantum.generated.js';
+export { invmodDependencies } from './dependenciesAny/dependenciesInvmod.generated.js';
+export { isIntegerDependencies } from './dependenciesAny/dependenciesIsInteger.generated.js';
+export { isNaNDependencies } from './dependenciesAny/dependenciesIsNaN.generated.js';
+export { isNegativeDependencies } from './dependenciesAny/dependenciesIsNegative.generated.js';
+export { isNumericDependencies } from './dependenciesAny/dependenciesIsNumeric.generated.js';
+export { isPositiveDependencies } from './dependenciesAny/dependenciesIsPositive.generated.js';
+export { isPrimeDependencies } from './dependenciesAny/dependenciesIsPrime.generated.js';
+export { isZeroDependencies } from './dependenciesAny/dependenciesIsZero.generated.js';
+export { kldivergenceDependencies } from './dependenciesAny/dependenciesKldivergence.generated.js';
+export { klitzingDependencies } from './dependenciesAny/dependenciesKlitzing.generated.js';
+export { kronDependencies } from './dependenciesAny/dependenciesKron.generated.js';
+export { LN10Dependencies } from './dependenciesAny/dependenciesLN10.generated.js';
+export { LN2Dependencies } from './dependenciesAny/dependenciesLN2.generated.js';
+export { LOG10EDependencies } from './dependenciesAny/dependenciesLOG10E.generated.js';
+export { LOG2EDependencies } from './dependenciesAny/dependenciesLOG2E.generated.js';
+export { largerDependencies } from './dependenciesAny/dependenciesLarger.generated.js';
+export { largerEqDependencies } from './dependenciesAny/dependenciesLargerEq.generated.js';
+export { lcmDependencies } from './dependenciesAny/dependenciesLcm.generated.js';
+export { leafCountDependencies } from './dependenciesAny/dependenciesLeafCount.generated.js';
+export { leftShiftDependencies } from './dependenciesAny/dependenciesLeftShift.generated.js';
+export { logDependencies } from './dependenciesAny/dependenciesLog.generated.js';
+export { log10Dependencies } from './dependenciesAny/dependenciesLog10.generated.js';
+export { log1pDependencies } from './dependenciesAny/dependenciesLog1p.generated.js';
+export { log2Dependencies } from './dependenciesAny/dependenciesLog2.generated.js';
+export { loschmidtDependencies } from './dependenciesAny/dependenciesLoschmidt.generated.js';
+export { lsolveDependencies } from './dependenciesAny/dependenciesLsolve.generated.js';
+export { lsolveAllDependencies } from './dependenciesAny/dependenciesLsolveAll.generated.js';
+export { lupDependencies } from './dependenciesAny/dependenciesLup.generated.js';
+export { lusolveDependencies } from './dependenciesAny/dependenciesLusolve.generated.js';
+export { madDependencies } from './dependenciesAny/dependenciesMad.generated.js';
+export { magneticConstantDependencies } from './dependenciesAny/dependenciesMagneticConstant.generated.js';
+export { magneticFluxQuantumDependencies } from './dependenciesAny/dependenciesMagneticFluxQuantum.generated.js';
+export { mapDependencies } from './dependenciesAny/dependenciesMap.generated.js';
+export { mapTransformDependencies } from './dependenciesAny/dependenciesMapTransform.generated.js';
+export { matrixDependencies } from './dependenciesAny/dependenciesMatrix.generated.js';
+export { MatrixDependencies } from './dependenciesAny/dependenciesMatrixClass.generated.js';
+export { matrixFromColumnsDependencies } from './dependenciesAny/dependenciesMatrixFromColumns.generated.js';
+export { matrixFromFunctionDependencies } from './dependenciesAny/dependenciesMatrixFromFunction.generated.js';
+export { matrixFromRowsDependencies } from './dependenciesAny/dependenciesMatrixFromRows.generated.js';
+export { maxDependencies } from './dependenciesAny/dependenciesMax.generated.js';
+export { maxTransformDependencies } from './dependenciesAny/dependenciesMaxTransform.generated.js';
+export { meanDependencies } from './dependenciesAny/dependenciesMean.generated.js';
+export { meanTransformDependencies } from './dependenciesAny/dependenciesMeanTransform.generated.js';
+export { medianDependencies } from './dependenciesAny/dependenciesMedian.generated.js';
+export { minDependencies } from './dependenciesAny/dependenciesMin.generated.js';
+export { minTransformDependencies } from './dependenciesAny/dependenciesMinTransform.generated.js';
+export { modDependencies } from './dependenciesAny/dependenciesMod.generated.js';
+export { modeDependencies } from './dependenciesAny/dependenciesMode.generated.js';
+export { molarMassDependencies } from './dependenciesAny/dependenciesMolarMass.generated.js';
+export { molarMassC12Dependencies } from './dependenciesAny/dependenciesMolarMassC12.generated.js';
+export { molarPlanckConstantDependencies } from './dependenciesAny/dependenciesMolarPlanckConstant.generated.js';
+export { molarVolumeDependencies } from './dependenciesAny/dependenciesMolarVolume.generated.js';
+export { multinomialDependencies } from './dependenciesAny/dependenciesMultinomial.generated.js';
+export { multiplyDependencies } from './dependenciesAny/dependenciesMultiply.generated.js';
+export { multiplyScalarDependencies } from './dependenciesAny/dependenciesMultiplyScalar.generated.js';
+export { NaNDependencies } from './dependenciesAny/dependenciesNaN.generated.js';
+export { neutronMassDependencies } from './dependenciesAny/dependenciesNeutronMass.generated.js';
+export { NodeDependencies } from './dependenciesAny/dependenciesNode.generated.js';
+export { normDependencies } from './dependenciesAny/dependenciesNorm.generated.js';
+export { notDependencies } from './dependenciesAny/dependenciesNot.generated.js';
+export { nthRootDependencies } from './dependenciesAny/dependenciesNthRoot.generated.js';
+export { nthRootsDependencies } from './dependenciesAny/dependenciesNthRoots.generated.js';
+export { nuclearMagnetonDependencies } from './dependenciesAny/dependenciesNuclearMagneton.generated.js';
+export { nullDependencies } from './dependenciesAny/dependenciesNull.generated.js';
+export { numberDependencies } from './dependenciesAny/dependenciesNumber.generated.js';
+export { numericDependencies } from './dependenciesAny/dependenciesNumeric.generated.js';
+export { ObjectNodeDependencies } from './dependenciesAny/dependenciesObjectNode.generated.js';
+export { octDependencies } from './dependenciesAny/dependenciesOct.generated.js';
+export { onesDependencies } from './dependenciesAny/dependenciesOnes.generated.js';
+export { OperatorNodeDependencies } from './dependenciesAny/dependenciesOperatorNode.generated.js';
+export { orDependencies } from './dependenciesAny/dependenciesOr.generated.js';
+export { ParenthesisNodeDependencies } from './dependenciesAny/dependenciesParenthesisNode.generated.js';
+export { parseDependencies } from './dependenciesAny/dependenciesParse.generated.js';
+export { parserDependencies } from './dependenciesAny/dependenciesParser.generated.js';
+export { ParserDependencies } from './dependenciesAny/dependenciesParserClass.generated.js';
+export { partitionSelectDependencies } from './dependenciesAny/dependenciesPartitionSelect.generated.js';
+export { permutationsDependencies } from './dependenciesAny/dependenciesPermutations.generated.js';
+export { phiDependencies } from './dependenciesAny/dependenciesPhi.generated.js';
+export { piDependencies } from './dependenciesAny/dependenciesPi.generated.js';
+export { pickRandomDependencies } from './dependenciesAny/dependenciesPickRandom.generated.js';
+export { planckChargeDependencies } from './dependenciesAny/dependenciesPlanckCharge.generated.js';
+export { planckConstantDependencies } from './dependenciesAny/dependenciesPlanckConstant.generated.js';
+export { planckLengthDependencies } from './dependenciesAny/dependenciesPlanckLength.generated.js';
+export { planckMassDependencies } from './dependenciesAny/dependenciesPlanckMass.generated.js';
+export { planckTemperatureDependencies } from './dependenciesAny/dependenciesPlanckTemperature.generated.js';
+export { planckTimeDependencies } from './dependenciesAny/dependenciesPlanckTime.generated.js';
+export { powDependencies } from './dependenciesAny/dependenciesPow.generated.js';
+export { printDependencies } from './dependenciesAny/dependenciesPrint.generated.js';
+export { prodDependencies } from './dependenciesAny/dependenciesProd.generated.js';
+export { protonMassDependencies } from './dependenciesAny/dependenciesProtonMass.generated.js';
+export { qrDependencies } from './dependenciesAny/dependenciesQr.generated.js';
+export { quantileSeqDependencies } from './dependenciesAny/dependenciesQuantileSeq.generated.js';
+export { quantumOfCirculationDependencies } from './dependenciesAny/dependenciesQuantumOfCirculation.generated.js';
+export { randomDependencies } from './dependenciesAny/dependenciesRandom.generated.js';
+export { randomIntDependencies } from './dependenciesAny/dependenciesRandomInt.generated.js';
+export { rangeDependencies } from './dependenciesAny/dependenciesRange.generated.js';
+export { RangeDependencies } from './dependenciesAny/dependenciesRangeClass.generated.js';
+export { RangeNodeDependencies } from './dependenciesAny/dependenciesRangeNode.generated.js';
+export { rangeTransformDependencies } from './dependenciesAny/dependenciesRangeTransform.generated.js';
+export { rationalizeDependencies } from './dependenciesAny/dependenciesRationalize.generated.js';
+export { reDependencies } from './dependenciesAny/dependenciesRe.generated.js';
+export { reducedPlanckConstantDependencies } from './dependenciesAny/dependenciesReducedPlanckConstant.generated.js';
+export { RelationalNodeDependencies } from './dependenciesAny/dependenciesRelationalNode.generated.js';
+export { replacerDependencies } from './dependenciesAny/dependenciesReplacer.generated.js';
+export { reshapeDependencies } from './dependenciesAny/dependenciesReshape.generated.js';
+export { resizeDependencies } from './dependenciesAny/dependenciesResize.generated.js';
+export { resolveDependencies } from './dependenciesAny/dependenciesResolve.generated.js';
+export { ResultSetDependencies } from './dependenciesAny/dependenciesResultSet.generated.js';
+export { reviverDependencies } from './dependenciesAny/dependenciesReviver.generated.js';
+export { rightArithShiftDependencies } from './dependenciesAny/dependenciesRightArithShift.generated.js';
+export { rightLogShiftDependencies } from './dependenciesAny/dependenciesRightLogShift.generated.js';
+export { rotateDependencies } from './dependenciesAny/dependenciesRotate.generated.js';
+export { rotationMatrixDependencies } from './dependenciesAny/dependenciesRotationMatrix.generated.js';
+export { roundDependencies } from './dependenciesAny/dependenciesRound.generated.js';
+export { rowDependencies } from './dependenciesAny/dependenciesRow.generated.js';
+export { rowTransformDependencies } from './dependenciesAny/dependenciesRowTransform.generated.js';
+export { rydbergDependencies } from './dependenciesAny/dependenciesRydberg.generated.js';
+export { SQRT1_2Dependencies } from './dependenciesAny/dependenciesSQRT1_2.generated.js'; // eslint-disable-line camelcase
+
+export { SQRT2Dependencies } from './dependenciesAny/dependenciesSQRT2.generated.js';
+export { sackurTetrodeDependencies } from './dependenciesAny/dependenciesSackurTetrode.generated.js';
+export { secDependencies } from './dependenciesAny/dependenciesSec.generated.js';
+export { sechDependencies } from './dependenciesAny/dependenciesSech.generated.js';
+export { secondRadiationDependencies } from './dependenciesAny/dependenciesSecondRadiation.generated.js';
+export { setCartesianDependencies } from './dependenciesAny/dependenciesSetCartesian.generated.js';
+export { setDifferenceDependencies } from './dependenciesAny/dependenciesSetDifference.generated.js';
+export { setDistinctDependencies } from './dependenciesAny/dependenciesSetDistinct.generated.js';
+export { setIntersectDependencies } from './dependenciesAny/dependenciesSetIntersect.generated.js';
+export { setIsSubsetDependencies } from './dependenciesAny/dependenciesSetIsSubset.generated.js';
+export { setMultiplicityDependencies } from './dependenciesAny/dependenciesSetMultiplicity.generated.js';
+export { setPowersetDependencies } from './dependenciesAny/dependenciesSetPowerset.generated.js';
+export { setSizeDependencies } from './dependenciesAny/dependenciesSetSize.generated.js';
+export { setSymDifferenceDependencies } from './dependenciesAny/dependenciesSetSymDifference.generated.js';
+export { setUnionDependencies } from './dependenciesAny/dependenciesSetUnion.generated.js';
+export { signDependencies } from './dependenciesAny/dependenciesSign.generated.js';
+export { simplifyDependencies } from './dependenciesAny/dependenciesSimplify.generated.js';
+export { simplifyCoreDependencies } from './dependenciesAny/dependenciesSimplifyCore.generated.js';
+export { sinDependencies } from './dependenciesAny/dependenciesSin.generated.js';
+export { sinhDependencies } from './dependenciesAny/dependenciesSinh.generated.js';
+export { sizeDependencies } from './dependenciesAny/dependenciesSize.generated.js';
+export { sluDependencies } from './dependenciesAny/dependenciesSlu.generated.js';
+export { smallerDependencies } from './dependenciesAny/dependenciesSmaller.generated.js';
+export { smallerEqDependencies } from './dependenciesAny/dependenciesSmallerEq.generated.js';
+export { sortDependencies } from './dependenciesAny/dependenciesSort.generated.js';
+export { SpaDependencies } from './dependenciesAny/dependenciesSpaClass.generated.js';
+export { sparseDependencies } from './dependenciesAny/dependenciesSparse.generated.js';
+export { SparseMatrixDependencies } from './dependenciesAny/dependenciesSparseMatrixClass.generated.js';
+export { speedOfLightDependencies } from './dependenciesAny/dependenciesSpeedOfLight.generated.js';
+export { splitUnitDependencies } from './dependenciesAny/dependenciesSplitUnit.generated.js';
+export { sqrtDependencies } from './dependenciesAny/dependenciesSqrt.generated.js';
+export { sqrtmDependencies } from './dependenciesAny/dependenciesSqrtm.generated.js';
+export { squareDependencies } from './dependenciesAny/dependenciesSquare.generated.js';
+export { squeezeDependencies } from './dependenciesAny/dependenciesSqueeze.generated.js';
+export { stdDependencies } from './dependenciesAny/dependenciesStd.generated.js';
+export { stdTransformDependencies } from './dependenciesAny/dependenciesStdTransform.generated.js';
+export { stefanBoltzmannDependencies } from './dependenciesAny/dependenciesStefanBoltzmann.generated.js';
+export { stirlingS2Dependencies } from './dependenciesAny/dependenciesStirlingS2.generated.js';
+export { stringDependencies } from './dependenciesAny/dependenciesString.generated.js';
+export { subsetDependencies } from './dependenciesAny/dependenciesSubset.generated.js';
+export { subsetTransformDependencies } from './dependenciesAny/dependenciesSubsetTransform.generated.js';
+export { subtractDependencies } from './dependenciesAny/dependenciesSubtract.generated.js';
+export { sumDependencies } from './dependenciesAny/dependenciesSum.generated.js';
+export { sumTransformDependencies } from './dependenciesAny/dependenciesSumTransform.generated.js';
+export { SymbolNodeDependencies } from './dependenciesAny/dependenciesSymbolNode.generated.js';
+export { symbolicEqualDependencies } from './dependenciesAny/dependenciesSymbolicEqual.generated.js';
+export { tanDependencies } from './dependenciesAny/dependenciesTan.generated.js';
+export { tanhDependencies } from './dependenciesAny/dependenciesTanh.generated.js';
+export { tauDependencies } from './dependenciesAny/dependenciesTau.generated.js';
+export { thomsonCrossSectionDependencies } from './dependenciesAny/dependenciesThomsonCrossSection.generated.js';
+export { toDependencies } from './dependenciesAny/dependenciesTo.generated.js';
+export { traceDependencies } from './dependenciesAny/dependenciesTrace.generated.js';
+export { transposeDependencies } from './dependenciesAny/dependenciesTranspose.generated.js';
+export { trueDependencies } from './dependenciesAny/dependenciesTrue.generated.js';
+export { typeOfDependencies } from './dependenciesAny/dependenciesTypeOf.generated.js';
+export { typedDependencies } from './dependenciesAny/dependenciesTyped.generated.js';
+export { unaryMinusDependencies } from './dependenciesAny/dependenciesUnaryMinus.generated.js';
+export { unaryPlusDependencies } from './dependenciesAny/dependenciesUnaryPlus.generated.js';
+export { unequalDependencies } from './dependenciesAny/dependenciesUnequal.generated.js';
+export { UnitDependencies } from './dependenciesAny/dependenciesUnitClass.generated.js';
+export { unitDependencies } from './dependenciesAny/dependenciesUnitFunction.generated.js';
+export { EDependencies } from './dependenciesAny/dependenciesUppercaseE.generated.js';
+export { PIDependencies } from './dependenciesAny/dependenciesUppercasePi.generated.js';
+export { usolveDependencies } from './dependenciesAny/dependenciesUsolve.generated.js';
+export { usolveAllDependencies } from './dependenciesAny/dependenciesUsolveAll.generated.js';
+export { vacuumImpedanceDependencies } from './dependenciesAny/dependenciesVacuumImpedance.generated.js';
+export { varianceDependencies } from './dependenciesAny/dependenciesVariance.generated.js';
+export { varianceTransformDependencies } from './dependenciesAny/dependenciesVarianceTransform.generated.js';
+export { versionDependencies } from './dependenciesAny/dependenciesVersion.generated.js';
+export { weakMixingAngleDependencies } from './dependenciesAny/dependenciesWeakMixingAngle.generated.js';
+export { wienDisplacementDependencies } from './dependenciesAny/dependenciesWienDisplacement.generated.js';
+export { xgcdDependencies } from './dependenciesAny/dependenciesXgcd.generated.js';
+export { xorDependencies } from './dependenciesAny/dependenciesXor.generated.js';
+export { zerosDependencies } from './dependenciesAny/dependenciesZeros.generated.js';
+export { all } from './allFactoriesAny.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAbs.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAbs.generated.js
new file mode 100644
index 0000000..fd8dd2f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAbs.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAbs } from '../../factoriesAny.js';
+export var absDependencies = {
+  typedDependencies,
+  createAbs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..08601f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAccessorNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAccessorNode } from '../../factoriesAny.js';
+export var AccessorNodeDependencies = {
+  NodeDependencies,
+  subsetDependencies,
+  createAccessorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcos.generated.js
new file mode 100644
index 0000000..a88d60d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcos.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcos } from '../../factoriesAny.js';
+export var acosDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAcos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..f5ff7aa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcosh.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcosh } from '../../factoriesAny.js';
+export var acoshDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAcosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcot.generated.js
new file mode 100644
index 0000000..178f6a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcot.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcot } from '../../factoriesAny.js';
+export var acotDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createAcot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..0bc9997
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcoth.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcoth } from '../../factoriesAny.js';
+export var acothDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAcoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..cc075d4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsc.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsc } from '../../factoriesAny.js';
+export var acscDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAcsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..197e00b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsch.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsch } from '../../factoriesAny.js';
+export var acschDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createAcsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAdd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAdd.generated.js
new file mode 100644
index 0000000..662afa0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAdd.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAdd } from '../../factoriesAny.js';
+export var addDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  addScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createAdd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..d1cb442
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAddScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAddScalar } from '../../factoriesAny.js';
+export var addScalarDependencies = {
+  typedDependencies,
+  createAddScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAnd.generated.js
new file mode 100644
index 0000000..6d1a977
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAnd.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { notDependencies } from './dependenciesNot.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createAnd } from '../../factoriesAny.js';
+export var andDependencies = {
+  equalScalarDependencies,
+  matrixDependencies,
+  notDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesApply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesApply.generated.js
new file mode 100644
index 0000000..46e5c78
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesApply.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createApply } from '../../factoriesAny.js';
+export var applyDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createApply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesApplyTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesApplyTransform.generated.js
new file mode 100644
index 0000000..c642ad4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesApplyTransform.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createApplyTransform } from '../../factoriesAny.js';
+export var applyTransformDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createApplyTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArg.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArg.generated.js
new file mode 100644
index 0000000..6181dfe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArg.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createArg } from '../../factoriesAny.js';
+export var argDependencies = {
+  typedDependencies,
+  createArg
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..66403fd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArrayNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createArrayNode } from '../../factoriesAny.js';
+export var ArrayNodeDependencies = {
+  NodeDependencies,
+  createArrayNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsec.generated.js
new file mode 100644
index 0000000..3173050
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsec.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsec } from '../../factoriesAny.js';
+export var asecDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAsec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsech.generated.js
new file mode 100644
index 0000000..d061320
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsech.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsech } from '../../factoriesAny.js';
+export var asechDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAsech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsin.generated.js
new file mode 100644
index 0000000..1367635
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsin.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsin } from '../../factoriesAny.js';
+export var asinDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAsin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..bcce057
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsinh } from '../../factoriesAny.js';
+export var asinhDependencies = {
+  typedDependencies,
+  createAsinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..28d47d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAssignmentNode } from '../../factoriesAny.js';
+export var AssignmentNodeDependencies = {
+  matrixDependencies,
+  NodeDependencies,
+  subsetDependencies,
+  createAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan.generated.js
new file mode 100644
index 0000000..b9b5fcc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan } from '../../factoriesAny.js';
+export var atanDependencies = {
+  typedDependencies,
+  createAtan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..b1c9423
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan2.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan2 } from '../../factoriesAny.js';
+export var atan2Dependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createAtan2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..ab877f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtanh.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtanh } from '../../factoriesAny.js';
+export var atanhDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAtanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtomicMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtomicMass.generated.js
new file mode 100644
index 0000000..84ad047
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtomicMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createAtomicMass } from '../../factoriesAny.js';
+export var atomicMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createAtomicMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAvogadro.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAvogadro.generated.js
new file mode 100644
index 0000000..f2339b0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAvogadro.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createAvogadro } from '../../factoriesAny.js';
+export var avogadroDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createAvogadro
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..369a7f0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBellNumbers.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { stirlingS2Dependencies } from './dependenciesStirlingS2.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBellNumbers } from '../../factoriesAny.js';
+export var bellNumbersDependencies = {
+  addScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  stirlingS2Dependencies,
+  typedDependencies,
+  createBellNumbers
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigNumberClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
new file mode 100644
index 0000000..fcc8438
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createBigNumberClass } from '../../factoriesAny.js';
+export var BigNumberDependencies = {
+  createBigNumberClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBignumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBignumber.generated.js
new file mode 100644
index 0000000..e9aabaf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBignumber.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBignumber } from '../../factoriesAny.js';
+export var bignumberDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createBignumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBin.generated.js
new file mode 100644
index 0000000..37befba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBin.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBin } from '../../factoriesAny.js';
+export var binDependencies = {
+  formatDependencies,
+  typedDependencies,
+  createBin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..ca371e4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAnd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitAnd } from '../../factoriesAny.js';
+export var bitAndDependencies = {
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createBitAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..f4ecf43
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitNot } from '../../factoriesAny.js';
+export var bitNotDependencies = {
+  typedDependencies,
+  createBitNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..bb50481
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOr.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitOr } from '../../factoriesAny.js';
+export var bitOrDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createBitOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..4e6b51e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitXor.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitXor } from '../../factoriesAny.js';
+export var bitXorDependencies = {
+  DenseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createBitXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..d55f841
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBlockNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { ResultSetDependencies } from './dependenciesResultSet.generated.js';
+import { createBlockNode } from '../../factoriesAny.js';
+export var BlockNodeDependencies = {
+  NodeDependencies,
+  ResultSetDependencies,
+  createBlockNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrMagneton.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
new file mode 100644
index 0000000..fd4895f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createBohrMagneton } from '../../factoriesAny.js';
+export var bohrMagnetonDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createBohrMagneton
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrRadius.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrRadius.generated.js
new file mode 100644
index 0000000..aea8671
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrRadius.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createBohrRadius } from '../../factoriesAny.js';
+export var bohrRadiusDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createBohrRadius
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoltzmann.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoltzmann.generated.js
new file mode 100644
index 0000000..3ce13ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoltzmann.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createBoltzmann } from '../../factoriesAny.js';
+export var boltzmannDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createBoltzmann
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..61e5c46
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoolean.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBoolean } from '../../factoriesAny.js';
+export var booleanDependencies = {
+  typedDependencies,
+  createBoolean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..06264f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCatalan.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCatalan } from '../../factoriesAny.js';
+export var catalanDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createCatalan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..051d9c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCbrt.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createCbrt } from '../../factoriesAny.js';
+export var cbrtDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  FractionDependencies,
+  isNegativeDependencies,
+  matrixDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createCbrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCeil.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCeil.generated.js
new file mode 100644
index 0000000..c75be67
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCeil.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCeil } from '../../factoriesAny.js';
+export var ceilDependencies = {
+  equalScalarDependencies,
+  matrixDependencies,
+  roundDependencies,
+  typedDependencies,
+  createCeil
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChain.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChain.generated.js
new file mode 100644
index 0000000..8d9e793
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChain.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ChainDependencies } from './dependenciesChainClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createChain } from '../../factoriesAny.js';
+export var chainDependencies = {
+  ChainDependencies,
+  typedDependencies,
+  createChain
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..f666222
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChainClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createChainClass } from '../../factoriesAny.js';
+export var ChainDependencies = {
+  createChainClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
new file mode 100644
index 0000000..2de8c67
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createClassicalElectronRadius } from '../../factoriesAny.js';
+export var classicalElectronRadiusDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createClassicalElectronRadius
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClone.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClone.generated.js
new file mode 100644
index 0000000..2e9077b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClone.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createClone } from '../../factoriesAny.js';
+export var cloneDependencies = {
+  typedDependencies,
+  createClone
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumn.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumn.generated.js
new file mode 100644
index 0000000..61447d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumn.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createColumn } from '../../factoriesAny.js';
+export var columnDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createColumn
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumnTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumnTransform.generated.js
new file mode 100644
index 0000000..d6bc3ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumnTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createColumnTransform } from '../../factoriesAny.js';
+export var columnTransformDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createColumnTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..926c7cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinations.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinations } from '../../factoriesAny.js';
+export var combinationsDependencies = {
+  typedDependencies,
+  createCombinations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..271eeaf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinationsWithRep } from '../../factoriesAny.js';
+export var combinationsWithRepDependencies = {
+  typedDependencies,
+  createCombinationsWithRep
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompare.generated.js
new file mode 100644
index 0000000..73b48cf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompare.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompare } from '../../factoriesAny.js';
+export var compareDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  FractionDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createCompare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..8ecb045
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareNatural.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareNatural } from '../../factoriesAny.js';
+export var compareNaturalDependencies = {
+  compareDependencies,
+  typedDependencies,
+  createCompareNatural
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..d8b0580
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareText.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareText } from '../../factoriesAny.js';
+export var compareTextDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createCompareText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompile.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompile.generated.js
new file mode 100644
index 0000000..c4e6841
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompile.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompile } from '../../factoriesAny.js';
+export var compileDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createCompile
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplex.generated.js
new file mode 100644
index 0000000..42e2055
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplex.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createComplex } from '../../factoriesAny.js';
+export var complexDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createComplex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplexClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplexClass.generated.js
new file mode 100644
index 0000000..abd54d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplexClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createComplexClass } from '../../factoriesAny.js';
+export var ComplexDependencies = {
+  createComplexClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComposition.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComposition.generated.js
new file mode 100644
index 0000000..c585659
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComposition.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createComposition } from '../../factoriesAny.js';
+export var compositionDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  isPositiveDependencies,
+  largerDependencies,
+  typedDependencies,
+  createComposition
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcat.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcat.generated.js
new file mode 100644
index 0000000..9a9956c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcat.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createConcat } from '../../factoriesAny.js';
+export var concatDependencies = {
+  isIntegerDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createConcat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcatTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcatTransform.generated.js
new file mode 100644
index 0000000..11baf40
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcatTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createConcatTransform } from '../../factoriesAny.js';
+export var concatTransformDependencies = {
+  isIntegerDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createConcatTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..8001ce1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConditionalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConditionalNode } from '../../factoriesAny.js';
+export var ConditionalNodeDependencies = {
+  NodeDependencies,
+  createConditionalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
new file mode 100644
index 0000000..61ef521
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createConductanceQuantum } from '../../factoriesAny.js';
+export var conductanceQuantumDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createConductanceQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConj.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConj.generated.js
new file mode 100644
index 0000000..4d698d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConj.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createConj } from '../../factoriesAny.js';
+export var conjDependencies = {
+  typedDependencies,
+  createConj
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..338fde0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConstantNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConstantNode } from '../../factoriesAny.js';
+export var ConstantNodeDependencies = {
+  NodeDependencies,
+  createConstantNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCos.generated.js
new file mode 100644
index 0000000..ee553b4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCos.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCos } from '../../factoriesAny.js';
+export var cosDependencies = {
+  typedDependencies,
+  createCos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCosh.generated.js
new file mode 100644
index 0000000..4c352e8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCosh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCosh } from '../../factoriesAny.js';
+export var coshDependencies = {
+  typedDependencies,
+  createCosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCot.generated.js
new file mode 100644
index 0000000..478e8c7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCot.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCot } from '../../factoriesAny.js';
+export var cotDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoth.generated.js
new file mode 100644
index 0000000..62f4381
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoth.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCoth } from '../../factoriesAny.js';
+export var cothDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulomb.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulomb.generated.js
new file mode 100644
index 0000000..59be861
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulomb.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createCoulomb } from '../../factoriesAny.js';
+export var coulombDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createCoulomb
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCount.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCount.generated.js
new file mode 100644
index 0000000..40d37b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCount.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { prodDependencies } from './dependenciesProd.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCount } from '../../factoriesAny.js';
+export var countDependencies = {
+  prodDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createCount
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCreateUnit.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCreateUnit.generated.js
new file mode 100644
index 0000000..cdfe9d8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCreateUnit.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCreateUnit } from '../../factoriesAny.js';
+export var createUnitDependencies = {
+  UnitDependencies,
+  typedDependencies,
+  createCreateUnit
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCross.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCross.generated.js
new file mode 100644
index 0000000..91b7ad4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCross.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCross } from '../../factoriesAny.js';
+export var crossDependencies = {
+  matrixDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createCross
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsc.generated.js
new file mode 100644
index 0000000..5cc6190
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsc.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsc } from '../../factoriesAny.js';
+export var cscDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsch.generated.js
new file mode 100644
index 0000000..5ce6e0b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsch.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsch } from '../../factoriesAny.js';
+export var cschDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCtranspose.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCtranspose.generated.js
new file mode 100644
index 0000000..4d0cec5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCtranspose.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { transposeDependencies } from './dependenciesTranspose.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCtranspose } from '../../factoriesAny.js';
+export var ctransposeDependencies = {
+  conjDependencies,
+  transposeDependencies,
+  typedDependencies,
+  createCtranspose
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCube.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCube.generated.js
new file mode 100644
index 0000000..f42092f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCube.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCube } from '../../factoriesAny.js';
+export var cubeDependencies = {
+  typedDependencies,
+  createCube
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..05941ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSum } from '../../factoriesAny.js';
+export var cumsumDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..fef6c6e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSumTransform } from '../../factoriesAny.js';
+export var cumsumTransformDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..94eb7b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeepEqual.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDeepEqual } from '../../factoriesAny.js';
+export var deepEqualDependencies = {
+  equalDependencies,
+  typedDependencies,
+  createDeepEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
new file mode 100644
index 0000000..bad8bd2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { MatrixDependencies } from './dependenciesMatrixClass.generated.js';
+import { createDenseMatrixClass } from '../../factoriesAny.js';
+export var DenseMatrixDependencies = {
+  MatrixDependencies,
+  createDenseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..3ac3894
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDerivative.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDerivative } from '../../factoriesAny.js';
+export var derivativeDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  numericDependencies,
+  parseDependencies,
+  simplifyDependencies,
+  typedDependencies,
+  createDerivative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDet.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDet.generated.js
new file mode 100644
index 0000000..7410623
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDet.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { lupDependencies } from './dependenciesLup.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createDet } from '../../factoriesAny.js';
+export var detDependencies = {
+  lupDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createDet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeuteronMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
new file mode 100644
index 0000000..605ff5a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createDeuteronMass } from '../../factoriesAny.js';
+export var deuteronMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createDeuteronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiag.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiag.generated.js
new file mode 100644
index 0000000..b852edf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiag.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDiag } from '../../factoriesAny.js';
+export var diagDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createDiag
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiff.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiff.generated.js
new file mode 100644
index 0000000..433e6b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiff.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDiff } from '../../factoriesAny.js';
+export var diffDependencies = {
+  matrixDependencies,
+  numberDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createDiff
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiffTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiffTransform.generated.js
new file mode 100644
index 0000000..4781b34
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiffTransform.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDiffTransform } from '../../factoriesAny.js';
+export var diffTransformDependencies = {
+  bignumberDependencies,
+  matrixDependencies,
+  numberDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createDiffTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDistance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDistance.generated.js
new file mode 100644
index 0000000..93db9d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDistance.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createDistance } from '../../factoriesAny.js';
+export var distanceDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  multiplyScalarDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createDistance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivide.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivide.generated.js
new file mode 100644
index 0000000..4db584f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivide.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivide } from '../../factoriesAny.js';
+export var divideDependencies = {
+  divideScalarDependencies,
+  equalScalarDependencies,
+  invDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..8333cb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivideScalar.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivideScalar } from '../../factoriesAny.js';
+export var divideScalarDependencies = {
+  numericDependencies,
+  typedDependencies,
+  createDivideScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDot.generated.js
new file mode 100644
index 0000000..6f5a94a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDot.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDot } from '../../factoriesAny.js';
+export var dotDependencies = {
+  addScalarDependencies,
+  conjDependencies,
+  multiplyScalarDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createDot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotDivide.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotDivide.generated.js
new file mode 100644
index 0000000..d195459
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotDivide.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDotDivide } from '../../factoriesAny.js';
+export var dotDivideDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createDotDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotMultiply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotMultiply.generated.js
new file mode 100644
index 0000000..ebbfe93
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotMultiply.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDotMultiply } from '../../factoriesAny.js';
+export var dotMultiplyDependencies = {
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createDotMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotPow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotPow.generated.js
new file mode 100644
index 0000000..c86691d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotPow.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDotPow } from '../../factoriesAny.js';
+export var dotPowDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  powDependencies,
+  typedDependencies,
+  createDotPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesE.generated.js
new file mode 100644
index 0000000..d4f8086
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesE.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createE } from '../../factoriesAny.js';
+export var eDependencies = {
+  BigNumberDependencies,
+  createE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEfimovFactor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
new file mode 100644
index 0000000..e4a46fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createEfimovFactor } from '../../factoriesAny.js';
+export var efimovFactorDependencies = {
+  BigNumberDependencies,
+  createEfimovFactor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEigs.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEigs.generated.js
new file mode 100644
index 0000000..310f392
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEigs.generated.js
@@ -0,0 +1,68 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { atanDependencies } from './dependenciesAtan.generated.js';
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { columnDependencies } from './dependenciesColumn.generated.js';
+import { complexDependencies } from './dependenciesComplex.generated.js';
+import { cosDependencies } from './dependenciesCos.generated.js';
+import { diagDependencies } from './dependenciesDiag.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { dotDependencies } from './dependenciesDot.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { imDependencies } from './dependenciesIm.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { matrixFromColumnsDependencies } from './dependenciesMatrixFromColumns.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { qrDependencies } from './dependenciesQr.generated.js';
+import { reDependencies } from './dependenciesRe.generated.js';
+import { sinDependencies } from './dependenciesSin.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { usolveDependencies } from './dependenciesUsolve.generated.js';
+import { usolveAllDependencies } from './dependenciesUsolveAll.generated.js';
+import { createEigs } from '../../factoriesAny.js';
+export var eigsDependencies = {
+  absDependencies,
+  addDependencies,
+  addScalarDependencies,
+  atanDependencies,
+  bignumberDependencies,
+  columnDependencies,
+  complexDependencies,
+  cosDependencies,
+  diagDependencies,
+  divideScalarDependencies,
+  dotDependencies,
+  equalDependencies,
+  flattenDependencies,
+  imDependencies,
+  invDependencies,
+  largerDependencies,
+  matrixDependencies,
+  matrixFromColumnsDependencies,
+  multiplyDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  qrDependencies,
+  reDependencies,
+  sinDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  typedDependencies,
+  usolveDependencies,
+  usolveAllDependencies,
+  createEigs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectricConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectricConstant.generated.js
new file mode 100644
index 0000000..711df06
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectricConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createElectricConstant } from '../../factoriesAny.js';
+export var electricConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createElectricConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectronMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectronMass.generated.js
new file mode 100644
index 0000000..75b98ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectronMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createElectronMass } from '../../factoriesAny.js';
+export var electronMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createElectronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElementaryCharge.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
new file mode 100644
index 0000000..85874ee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createElementaryCharge } from '../../factoriesAny.js';
+export var elementaryChargeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createElementaryCharge
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqual.generated.js
new file mode 100644
index 0000000..170d5a9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqual.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqual } from '../../factoriesAny.js';
+export var equalDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..ac93e47
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualScalar } from '../../factoriesAny.js';
+export var equalScalarDependencies = {
+  typedDependencies,
+  createEqualScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..7336e81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualText.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareTextDependencies } from './dependenciesCompareText.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualText } from '../../factoriesAny.js';
+export var equalTextDependencies = {
+  compareTextDependencies,
+  isZeroDependencies,
+  typedDependencies,
+  createEqualText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesErf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesErf.generated.js
new file mode 100644
index 0000000..ff4636e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesErf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createErf } from '../../factoriesAny.js';
+export var erfDependencies = {
+  typedDependencies,
+  createErf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..dc0ce5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEvaluate.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEvaluate } from '../../factoriesAny.js';
+export var evaluateDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createEvaluate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExp.generated.js
new file mode 100644
index 0000000..803f469
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExp.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExp } from '../../factoriesAny.js';
+export var expDependencies = {
+  typedDependencies,
+  createExp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm.generated.js
new file mode 100644
index 0000000..13c62ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExpm } from '../../factoriesAny.js';
+export var expmDependencies = {
+  absDependencies,
+  addDependencies,
+  identityDependencies,
+  invDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createExpm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..00c7bf4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm1.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExpm1 } from '../../factoriesAny.js';
+export var expm1Dependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createExpm1
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..fae74be
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFactorial.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { gammaDependencies } from './dependenciesGamma.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFactorial } from '../../factoriesAny.js';
+export var factorialDependencies = {
+  gammaDependencies,
+  typedDependencies,
+  createFactorial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFalse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFalse.generated.js
new file mode 100644
index 0000000..5694706
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFalse.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createFalse } from '../../factoriesAny.js';
+export var falseDependencies = {
+  createFalse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFaraday.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFaraday.generated.js
new file mode 100644
index 0000000..b97f80b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFaraday.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createFaraday } from '../../factoriesAny.js';
+export var faradayDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createFaraday
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFermiCoupling.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
new file mode 100644
index 0000000..daab210
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createFermiCoupling } from '../../factoriesAny.js';
+export var fermiCouplingDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createFermiCoupling
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
new file mode 100644
index 0000000..7df71d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { createFibonacciHeapClass } from '../../factoriesAny.js';
+export var FibonacciHeapDependencies = {
+  largerDependencies,
+  smallerDependencies,
+  createFibonacciHeapClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilter.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilter.generated.js
new file mode 100644
index 0000000..d564159
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilter.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilter } from '../../factoriesAny.js';
+export var filterDependencies = {
+  typedDependencies,
+  createFilter
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..48a768c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilterTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilterTransform } from '../../factoriesAny.js';
+export var filterTransformDependencies = {
+  typedDependencies,
+  createFilterTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFineStructure.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFineStructure.generated.js
new file mode 100644
index 0000000..d30692d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFineStructure.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createFineStructure } from '../../factoriesAny.js';
+export var fineStructureDependencies = {
+  BigNumberDependencies,
+  createFineStructure
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFirstRadiation.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
new file mode 100644
index 0000000..571fb9b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createFirstRadiation } from '../../factoriesAny.js';
+export var firstRadiationDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createFirstRadiation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFix.generated.js
new file mode 100644
index 0000000..37a9f03
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFix.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { ceilDependencies } from './dependenciesCeil.generated.js';
+import { floorDependencies } from './dependenciesFloor.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFix } from '../../factoriesAny.js';
+export var fixDependencies = {
+  ComplexDependencies,
+  ceilDependencies,
+  floorDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createFix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFlatten.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFlatten.generated.js
new file mode 100644
index 0000000..8c3ddc7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFlatten.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFlatten } from '../../factoriesAny.js';
+export var flattenDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createFlatten
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFloor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFloor.generated.js
new file mode 100644
index 0000000..c952f28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFloor.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFloor } from '../../factoriesAny.js';
+export var floorDependencies = {
+  equalScalarDependencies,
+  matrixDependencies,
+  roundDependencies,
+  typedDependencies,
+  createFloor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEach.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEach.generated.js
new file mode 100644
index 0000000..e39b6fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEach.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEach } from '../../factoriesAny.js';
+export var forEachDependencies = {
+  typedDependencies,
+  createForEach
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..1d33837
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEachTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEachTransform } from '../../factoriesAny.js';
+export var forEachTransformDependencies = {
+  typedDependencies,
+  createForEachTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFormat.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFormat.generated.js
new file mode 100644
index 0000000..d7d47cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFormat.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFormat } from '../../factoriesAny.js';
+export var formatDependencies = {
+  typedDependencies,
+  createFormat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFraction.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFraction.generated.js
new file mode 100644
index 0000000..502b793
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFraction.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFraction } from '../../factoriesAny.js';
+export var fractionDependencies = {
+  FractionDependencies,
+  typedDependencies,
+  createFraction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFractionClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFractionClass.generated.js
new file mode 100644
index 0000000..139d2b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFractionClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createFractionClass } from '../../factoriesAny.js';
+export var FractionDependencies = {
+  createFractionClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..a191dcd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFunctionAssignmentNode } from '../../factoriesAny.js';
+export var FunctionAssignmentNodeDependencies = {
+  NodeDependencies,
+  typedDependencies,
+  createFunctionAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..45d4dbd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { createFunctionNode } from '../../factoriesAny.js';
+export var FunctionNodeDependencies = {
+  NodeDependencies,
+  SymbolNodeDependencies,
+  createFunctionNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGamma.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGamma.generated.js
new file mode 100644
index 0000000..56cabf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGamma.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGamma } from '../../factoriesAny.js';
+export var gammaDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  multiplyScalarDependencies,
+  powDependencies,
+  typedDependencies,
+  createGamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGasConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGasConstant.generated.js
new file mode 100644
index 0000000..ffc3038
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGasConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createGasConstant } from '../../factoriesAny.js';
+export var gasConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createGasConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGcd.generated.js
new file mode 100644
index 0000000..5f56f6a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGcd.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGcd } from '../../factoriesAny.js';
+export var gcdDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createGcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
new file mode 100644
index 0000000..8e7a996
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGetMatrixDataType } from '../../factoriesAny.js';
+export var getMatrixDataTypeDependencies = {
+  typedDependencies,
+  createGetMatrixDataType
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravitationConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
new file mode 100644
index 0000000..0f7f12a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createGravitationConstant } from '../../factoriesAny.js';
+export var gravitationConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createGravitationConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravity.generated.js
new file mode 100644
index 0000000..1030929
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravity.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createGravity } from '../../factoriesAny.js';
+export var gravityDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createGravity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
new file mode 100644
index 0000000..76a305d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createHartreeEnergy } from '../../factoriesAny.js';
+export var hartreeEnergyDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createHartreeEnergy
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..5eb4dfb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHasNumericValue } from '../../factoriesAny.js';
+export var hasNumericValueDependencies = {
+  isNumericDependencies,
+  typedDependencies,
+  createHasNumericValue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelp.generated.js
new file mode 100644
index 0000000..58549f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelp.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { HelpDependencies } from './dependenciesHelpClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHelp } from '../../factoriesAny.js';
+export var helpDependencies = {
+  HelpDependencies,
+  typedDependencies,
+  createHelp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..abb7757
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelpClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { createHelpClass } from '../../factoriesAny.js';
+export var HelpDependencies = {
+  parseDependencies,
+  createHelpClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHex.generated.js
new file mode 100644
index 0000000..480205f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHex.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHex } from '../../factoriesAny.js';
+export var hexDependencies = {
+  formatDependencies,
+  typedDependencies,
+  createHex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHypot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHypot.generated.js
new file mode 100644
index 0000000..8100654
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHypot.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHypot } from '../../factoriesAny.js';
+export var hypotDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  isPositiveDependencies,
+  multiplyScalarDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  createHypot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesI.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesI.generated.js
new file mode 100644
index 0000000..045dbf0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesI.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { createI } from '../../factoriesAny.js';
+export var iDependencies = {
+  ComplexDependencies,
+  createI
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIdentity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIdentity.generated.js
new file mode 100644
index 0000000..4e118ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIdentity.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIdentity } from '../../factoriesAny.js';
+export var identityDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createIdentity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIm.generated.js
new file mode 100644
index 0000000..1e7da81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIm.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIm } from '../../factoriesAny.js';
+export var imDependencies = {
+  typedDependencies,
+  createIm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
new file mode 100644
index 0000000..8f5067d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { createImmutableDenseMatrixClass } from '../../factoriesAny.js';
+export var ImmutableDenseMatrixDependencies = {
+  DenseMatrixDependencies,
+  smallerDependencies,
+  createImmutableDenseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndex.generated.js
new file mode 100644
index 0000000..900da1e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndex.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIndex } from '../../factoriesAny.js';
+export var indexDependencies = {
+  IndexDependencies,
+  typedDependencies,
+  createIndex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexClass.generated.js
new file mode 100644
index 0000000..8fcc6a9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ImmutableDenseMatrixDependencies } from './dependenciesImmutableDenseMatrixClass.generated.js';
+import { createIndexClass } from '../../factoriesAny.js';
+export var IndexDependencies = {
+  ImmutableDenseMatrixDependencies,
+  createIndexClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..9e05578
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexNode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { RangeDependencies } from './dependenciesRangeClass.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { createIndexNode } from '../../factoriesAny.js';
+export var IndexNodeDependencies = {
+  NodeDependencies,
+  RangeDependencies,
+  sizeDependencies,
+  createIndexNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexTransform.generated.js
new file mode 100644
index 0000000..4152867
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { createIndexTransform } from '../../factoriesAny.js';
+export var indexTransformDependencies = {
+  IndexDependencies,
+  createIndexTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..870e9e1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInfinity.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createInfinity } from '../../factoriesAny.js';
+export var InfinityDependencies = {
+  BigNumberDependencies,
+  createInfinity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIntersect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIntersect.generated.js
new file mode 100644
index 0000000..46ff3fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIntersect.generated.js
@@ -0,0 +1,36 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIntersect } from '../../factoriesAny.js';
+export var intersectDependencies = {
+  absDependencies,
+  addDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  flattenDependencies,
+  isNumericDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  multiplyScalarDependencies,
+  smallerDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createIntersect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInv.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInv.generated.js
new file mode 100644
index 0000000..8a19c5f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInv.generated.js
@@ -0,0 +1,26 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { detDependencies } from './dependenciesDet.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createInv } from '../../factoriesAny.js';
+export var invDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  detDependencies,
+  divideScalarDependencies,
+  identityDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createInv
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
new file mode 100644
index 0000000..2cd33b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createInverseConductanceQuantum } from '../../factoriesAny.js';
+export var inverseConductanceQuantumDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createInverseConductanceQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInvmod.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInvmod.generated.js
new file mode 100644
index 0000000..461ee3f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInvmod.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { modDependencies } from './dependenciesMod.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { xgcdDependencies } from './dependenciesXgcd.generated.js';
+import { createInvmod } from '../../factoriesAny.js';
+export var invmodDependencies = {
+  BigNumberDependencies,
+  addDependencies,
+  equalDependencies,
+  isIntegerDependencies,
+  modDependencies,
+  smallerDependencies,
+  typedDependencies,
+  xgcdDependencies,
+  createInvmod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..d71f2b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsInteger.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsInteger } from '../../factoriesAny.js';
+export var isIntegerDependencies = {
+  typedDependencies,
+  createIsInteger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..797b48a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNaN.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNaN } from '../../factoriesAny.js';
+export var isNaNDependencies = {
+  typedDependencies,
+  createIsNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..f2b83ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNegative.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNegative } from '../../factoriesAny.js';
+export var isNegativeDependencies = {
+  typedDependencies,
+  createIsNegative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..00cdec9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNumeric.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNumeric } from '../../factoriesAny.js';
+export var isNumericDependencies = {
+  typedDependencies,
+  createIsNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..1aa1b12
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPositive.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPositive } from '../../factoriesAny.js';
+export var isPositiveDependencies = {
+  typedDependencies,
+  createIsPositive
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..f714257
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPrime.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPrime } from '../../factoriesAny.js';
+export var isPrimeDependencies = {
+  typedDependencies,
+  createIsPrime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..778e445
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsZero.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsZero } from '../../factoriesAny.js';
+export var isZeroDependencies = {
+  typedDependencies,
+  createIsZero
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKldivergence.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKldivergence.generated.js
new file mode 100644
index 0000000..b9b297a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKldivergence.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { dotDivideDependencies } from './dependenciesDotDivide.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { logDependencies } from './dependenciesLog.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { sumDependencies } from './dependenciesSum.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createKldivergence } from '../../factoriesAny.js';
+export var kldivergenceDependencies = {
+  divideDependencies,
+  dotDivideDependencies,
+  isNumericDependencies,
+  logDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  sumDependencies,
+  typedDependencies,
+  createKldivergence
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKlitzing.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKlitzing.generated.js
new file mode 100644
index 0000000..c8439b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKlitzing.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createKlitzing } from '../../factoriesAny.js';
+export var klitzingDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createKlitzing
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKron.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKron.generated.js
new file mode 100644
index 0000000..38af28c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKron.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createKron } from '../../factoriesAny.js';
+export var kronDependencies = {
+  matrixDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createKron
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN10.generated.js
new file mode 100644
index 0000000..f2d08b7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN10.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLN10 } from '../../factoriesAny.js';
+export var LN10Dependencies = {
+  BigNumberDependencies,
+  createLN10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN2.generated.js
new file mode 100644
index 0000000..9c5386c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLN2 } from '../../factoriesAny.js';
+export var LN2Dependencies = {
+  BigNumberDependencies,
+  createLN2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..ef35cd5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG10E.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLOG10E } from '../../factoriesAny.js';
+export var LOG10EDependencies = {
+  BigNumberDependencies,
+  createLOG10E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..c9e71e3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG2E.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLOG2E } from '../../factoriesAny.js';
+export var LOG2EDependencies = {
+  BigNumberDependencies,
+  createLOG2E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLarger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLarger.generated.js
new file mode 100644
index 0000000..568e5bf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLarger.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLarger } from '../../factoriesAny.js';
+export var largerDependencies = {
+  DenseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createLarger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..5b59f3f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLargerEq.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLargerEq } from '../../factoriesAny.js';
+export var largerEqDependencies = {
+  DenseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createLargerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLcm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLcm.generated.js
new file mode 100644
index 0000000..62ce190
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLcm.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLcm } from '../../factoriesAny.js';
+export var lcmDependencies = {
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createLcm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeafCount.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeafCount.generated.js
new file mode 100644
index 0000000..29a4a9f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeafCount.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLeafCount } from '../../factoriesAny.js';
+export var leafCountDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createLeafCount
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..99ec9f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeftShift.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createLeftShift } from '../../factoriesAny.js';
+export var leftShiftDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createLeftShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog.generated.js
new file mode 100644
index 0000000..456850a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog } from '../../factoriesAny.js';
+export var logDependencies = {
+  ComplexDependencies,
+  divideScalarDependencies,
+  typedDependencies,
+  createLog
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog10.generated.js
new file mode 100644
index 0000000..e5db01f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog10.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog10 } from '../../factoriesAny.js';
+export var log10Dependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createLog10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..95cdacf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog1p.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { logDependencies } from './dependenciesLog.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog1p } from '../../factoriesAny.js';
+export var log1pDependencies = {
+  ComplexDependencies,
+  divideScalarDependencies,
+  logDependencies,
+  typedDependencies,
+  createLog1p
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog2.generated.js
new file mode 100644
index 0000000..0f9eb10
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog2.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog2 } from '../../factoriesAny.js';
+export var log2Dependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createLog2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLoschmidt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLoschmidt.generated.js
new file mode 100644
index 0000000..e2559c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLoschmidt.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createLoschmidt } from '../../factoriesAny.js';
+export var loschmidtDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createLoschmidt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolve.generated.js
new file mode 100644
index 0000000..5bf1a72
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolve.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLsolve } from '../../factoriesAny.js';
+export var lsolveDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createLsolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolveAll.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolveAll.generated.js
new file mode 100644
index 0000000..8d100a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolveAll.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLsolveAll } from '../../factoriesAny.js';
+export var lsolveAllDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createLsolveAll
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLup.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLup.generated.js
new file mode 100644
index 0000000..6b7580f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLup.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SpaDependencies } from './dependenciesSpaClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createLup } from '../../factoriesAny.js';
+export var lupDependencies = {
+  DenseMatrixDependencies,
+  SpaDependencies,
+  SparseMatrixDependencies,
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  largerDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createLup
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLusolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLusolve.generated.js
new file mode 100644
index 0000000..265740a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLusolve.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { lsolveDependencies } from './dependenciesLsolve.generated.js';
+import { lupDependencies } from './dependenciesLup.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sluDependencies } from './dependenciesSlu.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { usolveDependencies } from './dependenciesUsolve.generated.js';
+import { createLusolve } from '../../factoriesAny.js';
+export var lusolveDependencies = {
+  DenseMatrixDependencies,
+  lsolveDependencies,
+  lupDependencies,
+  matrixDependencies,
+  sluDependencies,
+  typedDependencies,
+  usolveDependencies,
+  createLusolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMad.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMad.generated.js
new file mode 100644
index 0000000..82b4091
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMad.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { medianDependencies } from './dependenciesMedian.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMad } from '../../factoriesAny.js';
+export var madDependencies = {
+  absDependencies,
+  mapDependencies,
+  medianDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createMad
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
new file mode 100644
index 0000000..3ad2da9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMagneticConstant } from '../../factoriesAny.js';
+export var magneticConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMagneticConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
new file mode 100644
index 0000000..178fe1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMagneticFluxQuantum } from '../../factoriesAny.js';
+export var magneticFluxQuantumDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMagneticFluxQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMap.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMap.generated.js
new file mode 100644
index 0000000..a3e60dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMap.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMap } from '../../factoriesAny.js';
+export var mapDependencies = {
+  typedDependencies,
+  createMap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..dbc5460
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapTransform } from '../../factoriesAny.js';
+export var mapTransformDependencies = {
+  typedDependencies,
+  createMapTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..ab09ac4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrix.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { MatrixDependencies } from './dependenciesMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrix } from '../../factoriesAny.js';
+export var matrixDependencies = {
+  DenseMatrixDependencies,
+  MatrixDependencies,
+  SparseMatrixDependencies,
+  typedDependencies,
+  createMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixClass.generated.js
new file mode 100644
index 0000000..12ff246
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createMatrixClass } from '../../factoriesAny.js';
+export var MatrixDependencies = {
+  createMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
new file mode 100644
index 0000000..b63e1b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrixFromColumns } from '../../factoriesAny.js';
+export var matrixFromColumnsDependencies = {
+  flattenDependencies,
+  matrixDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createMatrixFromColumns
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
new file mode 100644
index 0000000..a20f85b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrixFromFunction } from '../../factoriesAny.js';
+export var matrixFromFunctionDependencies = {
+  isZeroDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createMatrixFromFunction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
new file mode 100644
index 0000000..adf7c20
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrixFromRows } from '../../factoriesAny.js';
+export var matrixFromRowsDependencies = {
+  flattenDependencies,
+  matrixDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createMatrixFromRows
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMax.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMax.generated.js
new file mode 100644
index 0000000..9fafc4b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMax.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMax } from '../../factoriesAny.js';
+export var maxDependencies = {
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMax
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..701633f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMaxTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMaxTransform } from '../../factoriesAny.js';
+export var maxTransformDependencies = {
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMaxTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMean.generated.js
new file mode 100644
index 0000000..1d5b71b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMean.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMean } from '../../factoriesAny.js';
+export var meanDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..478c6d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMeanTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMeanTransform } from '../../factoriesAny.js';
+export var meanTransformDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMeanTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMedian.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMedian.generated.js
new file mode 100644
index 0000000..6618e5c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMedian.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMedian } from '../../factoriesAny.js';
+export var medianDependencies = {
+  addDependencies,
+  compareDependencies,
+  divideDependencies,
+  partitionSelectDependencies,
+  typedDependencies,
+  createMedian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMin.generated.js
new file mode 100644
index 0000000..2141446
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMin.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMin } from '../../factoriesAny.js';
+export var minDependencies = {
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..475b810
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMinTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMinTransform } from '../../factoriesAny.js';
+export var minTransformDependencies = {
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMinTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMod.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMod.generated.js
new file mode 100644
index 0000000..484a720
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMod.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMod } from '../../factoriesAny.js';
+export var modDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createMod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMode.generated.js
new file mode 100644
index 0000000..1bcd89b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMode } from '../../factoriesAny.js';
+export var modeDependencies = {
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createMode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMass.generated.js
new file mode 100644
index 0000000..f1e27ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarMass } from '../../factoriesAny.js';
+export var molarMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMassC12.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
new file mode 100644
index 0000000..728a849
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarMassC12 } from '../../factoriesAny.js';
+export var molarMassC12Dependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarMassC12
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
new file mode 100644
index 0000000..288b280
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarPlanckConstant } from '../../factoriesAny.js';
+export var molarPlanckConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarVolume.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarVolume.generated.js
new file mode 100644
index 0000000..f8f7312
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarVolume.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarVolume } from '../../factoriesAny.js';
+export var molarVolumeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarVolume
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..f72fb19
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultinomial.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultinomial } from '../../factoriesAny.js';
+export var multinomialDependencies = {
+  addDependencies,
+  divideDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isPositiveDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createMultinomial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..5b6a14b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiply.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { dotDependencies } from './dependenciesDot.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiply } from '../../factoriesAny.js';
+export var multiplyDependencies = {
+  addScalarDependencies,
+  dotDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..c47ed5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiplyScalar } from '../../factoriesAny.js';
+export var multiplyScalarDependencies = {
+  typedDependencies,
+  createMultiplyScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNaN.generated.js
new file mode 100644
index 0000000..159644f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNaN.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createNaN } from '../../factoriesAny.js';
+export var NaNDependencies = {
+  BigNumberDependencies,
+  createNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNeutronMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNeutronMass.generated.js
new file mode 100644
index 0000000..4e85f4f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNeutronMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createNeutronMass } from '../../factoriesAny.js';
+export var neutronMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createNeutronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNode.generated.js
new file mode 100644
index 0000000..41e5cf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNode.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNode } from '../../factoriesAny.js';
+export var NodeDependencies = {
+  createNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNorm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNorm.generated.js
new file mode 100644
index 0000000..8acf1ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNorm.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { ctransposeDependencies } from './dependenciesCtranspose.generated.js';
+import { eigsDependencies } from './dependenciesEigs.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNorm } from '../../factoriesAny.js';
+export var normDependencies = {
+  absDependencies,
+  addDependencies,
+  conjDependencies,
+  ctransposeDependencies,
+  eigsDependencies,
+  equalScalarDependencies,
+  largerDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  powDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  createNorm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNot.generated.js
new file mode 100644
index 0000000..0954db4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNot } from '../../factoriesAny.js';
+export var notDependencies = {
+  typedDependencies,
+  createNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..28d7565
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoot.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNthRoot } from '../../factoriesAny.js';
+export var nthRootDependencies = {
+  BigNumberDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createNthRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoots.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoots.generated.js
new file mode 100644
index 0000000..830652c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoots.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNthRoots } from '../../factoriesAny.js';
+export var nthRootsDependencies = {
+  ComplexDependencies,
+  divideScalarDependencies,
+  typedDependencies,
+  createNthRoots
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
new file mode 100644
index 0000000..aff4825
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createNuclearMagneton } from '../../factoriesAny.js';
+export var nuclearMagnetonDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createNuclearMagneton
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNull.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNull.generated.js
new file mode 100644
index 0000000..8aa017c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNull.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNull } from '../../factoriesAny.js';
+export var nullDependencies = {
+  createNull
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumber.generated.js
new file mode 100644
index 0000000..6bde859
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumber.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNumber } from '../../factoriesAny.js';
+export var numberDependencies = {
+  typedDependencies,
+  createNumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..cb0b193
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumeric.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { createNumeric } from '../../factoriesAny.js';
+export var numericDependencies = {
+  bignumberDependencies,
+  fractionDependencies,
+  numberDependencies,
+  createNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..d0b0d71
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesObjectNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createObjectNode } from '../../factoriesAny.js';
+export var ObjectNodeDependencies = {
+  NodeDependencies,
+  createObjectNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOct.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOct.generated.js
new file mode 100644
index 0000000..38c424c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOct.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOct } from '../../factoriesAny.js';
+export var octDependencies = {
+  formatDependencies,
+  typedDependencies,
+  createOct
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOnes.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOnes.generated.js
new file mode 100644
index 0000000..d486f28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOnes.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOnes } from '../../factoriesAny.js';
+export var onesDependencies = {
+  BigNumberDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createOnes
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..64ff770
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOperatorNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createOperatorNode } from '../../factoriesAny.js';
+export var OperatorNodeDependencies = {
+  NodeDependencies,
+  createOperatorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOr.generated.js
new file mode 100644
index 0000000..8fc2b23
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOr.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOr } from '../../factoriesAny.js';
+export var orDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..92d4445
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createParenthesisNode } from '../../factoriesAny.js';
+export var ParenthesisNodeDependencies = {
+  NodeDependencies,
+  createParenthesisNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParse.generated.js
new file mode 100644
index 0000000..136168d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParse.generated.js
@@ -0,0 +1,42 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { AssignmentNodeDependencies } from './dependenciesAssignmentNode.generated.js';
+import { BlockNodeDependencies } from './dependenciesBlockNode.generated.js';
+import { ConditionalNodeDependencies } from './dependenciesConditionalNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionAssignmentNodeDependencies } from './dependenciesFunctionAssignmentNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { RangeNodeDependencies } from './dependenciesRangeNode.generated.js';
+import { RelationalNodeDependencies } from './dependenciesRelationalNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParse } from '../../factoriesAny.js';
+export var parseDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  AssignmentNodeDependencies,
+  BlockNodeDependencies,
+  ConditionalNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  RangeNodeDependencies,
+  RelationalNodeDependencies,
+  SymbolNodeDependencies,
+  numericDependencies,
+  typedDependencies,
+  createParse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParser.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParser.generated.js
new file mode 100644
index 0000000..f50f56a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParser.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ParserDependencies } from './dependenciesParserClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParser } from '../../factoriesAny.js';
+export var parserDependencies = {
+  ParserDependencies,
+  typedDependencies,
+  createParser
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..2922aae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParserClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { evaluateDependencies } from './dependenciesEvaluate.generated.js';
+import { createParserClass } from '../../factoriesAny.js';
+export var ParserDependencies = {
+  evaluateDependencies,
+  createParserClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..ecd2205
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPartitionSelect } from '../../factoriesAny.js';
+export var partitionSelectDependencies = {
+  compareDependencies,
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createPartitionSelect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..2c5449b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPermutations.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPermutations } from '../../factoriesAny.js';
+export var permutationsDependencies = {
+  factorialDependencies,
+  typedDependencies,
+  createPermutations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPhi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPhi.generated.js
new file mode 100644
index 0000000..fa8e2c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPhi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createPhi } from '../../factoriesAny.js';
+export var phiDependencies = {
+  BigNumberDependencies,
+  createPhi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPi.generated.js
new file mode 100644
index 0000000..2327874
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createPi } from '../../factoriesAny.js';
+export var piDependencies = {
+  BigNumberDependencies,
+  createPi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..a6809db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPickRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPickRandom } from '../../factoriesAny.js';
+export var pickRandomDependencies = {
+  typedDependencies,
+  createPickRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckCharge.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
new file mode 100644
index 0000000..b3849ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckCharge } from '../../factoriesAny.js';
+export var planckChargeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckCharge
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
new file mode 100644
index 0000000..d2c4c62
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckConstant } from '../../factoriesAny.js';
+export var planckConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckLength.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckLength.generated.js
new file mode 100644
index 0000000..221d993
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckLength.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckLength } from '../../factoriesAny.js';
+export var planckLengthDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckLength
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckMass.generated.js
new file mode 100644
index 0000000..209989d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckMass } from '../../factoriesAny.js';
+export var planckMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
new file mode 100644
index 0000000..7eac32c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckTemperature } from '../../factoriesAny.js';
+export var planckTemperatureDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckTemperature
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTime.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTime.generated.js
new file mode 100644
index 0000000..9d07160
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTime.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckTime } from '../../factoriesAny.js';
+export var planckTimeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckTime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPow.generated.js
new file mode 100644
index 0000000..3b52335
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPow.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPow } from '../../factoriesAny.js';
+export var powDependencies = {
+  ComplexDependencies,
+  fractionDependencies,
+  identityDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  numberDependencies,
+  typedDependencies,
+  createPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrint.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrint.generated.js
new file mode 100644
index 0000000..731a3bd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrint.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPrint } from '../../factoriesAny.js';
+export var printDependencies = {
+  typedDependencies,
+  createPrint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProd.generated.js
new file mode 100644
index 0000000..59fe201
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createProd } from '../../factoriesAny.js';
+export var prodDependencies = {
+  multiplyScalarDependencies,
+  numericDependencies,
+  typedDependencies,
+  createProd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProtonMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProtonMass.generated.js
new file mode 100644
index 0000000..351feae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProtonMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createProtonMass } from '../../factoriesAny.js';
+export var protonMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createProtonMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQr.generated.js
new file mode 100644
index 0000000..e8bb815
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQr.generated.js
@@ -0,0 +1,38 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { complexDependencies } from './dependenciesComplex.generated.js';
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { signDependencies } from './dependenciesSign.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createQr } from '../../factoriesAny.js';
+export var qrDependencies = {
+  addScalarDependencies,
+  complexDependencies,
+  conjDependencies,
+  divideScalarDependencies,
+  equalDependencies,
+  identityDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  signDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  zerosDependencies,
+  createQr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..a56b49b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createQuantileSeq } from '../../factoriesAny.js';
+export var quantileSeqDependencies = {
+  addDependencies,
+  compareDependencies,
+  multiplyDependencies,
+  partitionSelectDependencies,
+  typedDependencies,
+  createQuantileSeq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
new file mode 100644
index 0000000..5f05d77
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createQuantumOfCirculation } from '../../factoriesAny.js';
+export var quantumOfCirculationDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createQuantumOfCirculation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandom.generated.js
new file mode 100644
index 0000000..b11fb5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandom } from '../../factoriesAny.js';
+export var randomDependencies = {
+  typedDependencies,
+  createRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..fb51851
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandomInt.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandomInt } from '../../factoriesAny.js';
+export var randomIntDependencies = {
+  typedDependencies,
+  createRandomInt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRange.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRange.generated.js
new file mode 100644
index 0000000..e7be24c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRange.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRange } from '../../factoriesAny.js';
+export var rangeDependencies = {
+  bignumberDependencies,
+  matrixDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRange
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..dc28667
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createRangeClass } from '../../factoriesAny.js';
+export var RangeDependencies = {
+  createRangeClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..829b356
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRangeNode } from '../../factoriesAny.js';
+export var RangeNodeDependencies = {
+  NodeDependencies,
+  createRangeNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..1b05ecc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeTransform.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRangeTransform } from '../../factoriesAny.js';
+export var rangeTransformDependencies = {
+  bignumberDependencies,
+  matrixDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRangeTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..3b23473
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRationalize.generated.js
@@ -0,0 +1,54 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRationalize } from '../../factoriesAny.js';
+export var rationalizeDependencies = {
+  bignumberDependencies,
+  fractionDependencies,
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  simplifyDependencies,
+  simplifyCoreDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createRationalize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRe.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRe.generated.js
new file mode 100644
index 0000000..addd9fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRe.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRe } from '../../factoriesAny.js';
+export var reDependencies = {
+  typedDependencies,
+  createRe
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
new file mode 100644
index 0000000..58f1fcd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createReducedPlanckConstant } from '../../factoriesAny.js';
+export var reducedPlanckConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createReducedPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..f76b3f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRelationalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRelationalNode } from '../../factoriesAny.js';
+export var RelationalNodeDependencies = {
+  NodeDependencies,
+  createRelationalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..6fcdff6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReplacer.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReplacer } from '../../factoriesAny.js';
+export var replacerDependencies = {
+  createReplacer
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReshape.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReshape.generated.js
new file mode 100644
index 0000000..1668dd9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReshape.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createReshape } from '../../factoriesAny.js';
+export var reshapeDependencies = {
+  isIntegerDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createReshape
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResize.generated.js
new file mode 100644
index 0000000..3ffb8bf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResize.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { createResize } from '../../factoriesAny.js';
+export var resizeDependencies = {
+  matrixDependencies,
+  createResize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResolve.generated.js
new file mode 100644
index 0000000..d4e35a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResolve.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { createResolve } from '../../factoriesAny.js';
+export var resolveDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  parseDependencies,
+  createResolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..41f61b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResultSet.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createResultSet } from '../../factoriesAny.js';
+export var ResultSetDependencies = {
+  createResultSet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReviver.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReviver.generated.js
new file mode 100644
index 0000000..3dd5918
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReviver.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReviver } from '../../factoriesAny.js';
+export var reviverDependencies = {
+  createReviver
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..a8972c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightArithShift.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createRightArithShift } from '../../factoriesAny.js';
+export var rightArithShiftDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createRightArithShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..c81751c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightLogShift.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createRightLogShift } from '../../factoriesAny.js';
+export var rightLogShiftDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createRightLogShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotate.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotate.generated.js
new file mode 100644
index 0000000..faf69a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotate.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { rotationMatrixDependencies } from './dependenciesRotationMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRotate } from '../../factoriesAny.js';
+export var rotateDependencies = {
+  multiplyDependencies,
+  rotationMatrixDependencies,
+  typedDependencies,
+  createRotate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotationMatrix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
new file mode 100644
index 0000000..667ce47
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { cosDependencies } from './dependenciesCos.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { normDependencies } from './dependenciesNorm.generated.js';
+import { sinDependencies } from './dependenciesSin.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createRotationMatrix } from '../../factoriesAny.js';
+export var rotationMatrixDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  addScalarDependencies,
+  cosDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  normDependencies,
+  sinDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createRotationMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRound.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRound.generated.js
new file mode 100644
index 0000000..38f9715
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRound.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createRound } from '../../factoriesAny.js';
+export var roundDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createRound
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRow.generated.js
new file mode 100644
index 0000000..78165be
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRow.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRow } from '../../factoriesAny.js';
+export var rowDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createRow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRowTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRowTransform.generated.js
new file mode 100644
index 0000000..b5d752f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRowTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRowTransform } from '../../factoriesAny.js';
+export var rowTransformDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createRowTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRydberg.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRydberg.generated.js
new file mode 100644
index 0000000..7494da9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRydberg.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createRydberg } from '../../factoriesAny.js';
+export var rydbergDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createRydberg
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..1b52232
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createSQRT1_2 } from '../../factoriesAny.js'; // eslint-disable-line camelcase
+
+export var SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  BigNumberDependencies,
+  createSQRT1_2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..3ed6f02
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createSQRT2 } from '../../factoriesAny.js';
+export var SQRT2Dependencies = {
+  BigNumberDependencies,
+  createSQRT2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSackurTetrode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
new file mode 100644
index 0000000..c5dcbee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createSackurTetrode } from '../../factoriesAny.js';
+export var sackurTetrodeDependencies = {
+  BigNumberDependencies,
+  createSackurTetrode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSec.generated.js
new file mode 100644
index 0000000..cadafe2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSec.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSec } from '../../factoriesAny.js';
+export var secDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createSec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSech.generated.js
new file mode 100644
index 0000000..51c336e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSech.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSech } from '../../factoriesAny.js';
+export var sechDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createSech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSecondRadiation.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
new file mode 100644
index 0000000..29a2a14
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createSecondRadiation } from '../../factoriesAny.js';
+export var secondRadiationDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createSecondRadiation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetCartesian.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetCartesian.generated.js
new file mode 100644
index 0000000..5156f57
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetCartesian.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetCartesian } from '../../factoriesAny.js';
+export var setCartesianDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetCartesian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDifference.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDifference.generated.js
new file mode 100644
index 0000000..da3d014
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDifference.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetDifference } from '../../factoriesAny.js';
+export var setDifferenceDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetDifference
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDistinct.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDistinct.generated.js
new file mode 100644
index 0000000..2fa0712
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDistinct.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetDistinct } from '../../factoriesAny.js';
+export var setDistinctDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetDistinct
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIntersect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIntersect.generated.js
new file mode 100644
index 0000000..9af570f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIntersect.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetIntersect } from '../../factoriesAny.js';
+export var setIntersectDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetIntersect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIsSubset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
new file mode 100644
index 0000000..a868e2e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetIsSubset } from '../../factoriesAny.js';
+export var setIsSubsetDependencies = {
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetIsSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
new file mode 100644
index 0000000..4a9cdeb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetMultiplicity } from '../../factoriesAny.js';
+export var setMultiplicityDependencies = {
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetMultiplicity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetPowerset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetPowerset.generated.js
new file mode 100644
index 0000000..9914a7d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetPowerset.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetPowerset } from '../../factoriesAny.js';
+export var setPowersetDependencies = {
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetPowerset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSize.generated.js
new file mode 100644
index 0000000..7dcdab9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSize.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetSize } from '../../factoriesAny.js';
+export var setSizeDependencies = {
+  compareNaturalDependencies,
+  typedDependencies,
+  createSetSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSymDifference.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
new file mode 100644
index 0000000..3a3cee2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { setDifferenceDependencies } from './dependenciesSetDifference.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetSymDifference } from '../../factoriesAny.js';
+export var setSymDifferenceDependencies = {
+  IndexDependencies,
+  concatDependencies,
+  setDifferenceDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetSymDifference
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetUnion.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetUnion.generated.js
new file mode 100644
index 0000000..c288bf6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetUnion.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { setIntersectDependencies } from './dependenciesSetIntersect.generated.js';
+import { setSymDifferenceDependencies } from './dependenciesSetSymDifference.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetUnion } from '../../factoriesAny.js';
+export var setUnionDependencies = {
+  IndexDependencies,
+  concatDependencies,
+  setIntersectDependencies,
+  setSymDifferenceDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetUnion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSign.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSign.generated.js
new file mode 100644
index 0000000..e3f38ba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSign.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { complexDependencies } from './dependenciesComplex.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSign } from '../../factoriesAny.js';
+export var signDependencies = {
+  BigNumberDependencies,
+  FractionDependencies,
+  complexDependencies,
+  typedDependencies,
+  createSign
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..1e59b90
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplify.generated.js
@@ -0,0 +1,54 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { resolveDependencies } from './dependenciesResolve.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplify } from '../../factoriesAny.js';
+export var simplifyDependencies = {
+  bignumberDependencies,
+  fractionDependencies,
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  resolveDependencies,
+  simplifyCoreDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createSimplify
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..4ed0b65
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,40 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { createSimplifyCore } from '../../factoriesAny.js';
+export var simplifyCoreDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  multiplyDependencies,
+  powDependencies,
+  subtractDependencies,
+  createSimplifyCore
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSin.generated.js
new file mode 100644
index 0000000..44dc216
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSin.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSin } from '../../factoriesAny.js';
+export var sinDependencies = {
+  typedDependencies,
+  createSin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSinh.generated.js
new file mode 100644
index 0000000..6eacc28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSinh } from '../../factoriesAny.js';
+export var sinhDependencies = {
+  typedDependencies,
+  createSinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSize.generated.js
new file mode 100644
index 0000000..19d3a80
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSize.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSize } from '../../factoriesAny.js';
+export var sizeDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSlu.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSlu.generated.js
new file mode 100644
index 0000000..a348ceb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSlu.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { transposeDependencies } from './dependenciesTranspose.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSlu } from '../../factoriesAny.js';
+export var sluDependencies = {
+  SparseMatrixDependencies,
+  absDependencies,
+  addDependencies,
+  divideScalarDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  transposeDependencies,
+  typedDependencies,
+  createSlu
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..cd18781
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmaller.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmaller } from '../../factoriesAny.js';
+export var smallerDependencies = {
+  DenseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSmaller
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..8656454
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmallerEq.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmallerEq } from '../../factoriesAny.js';
+export var smallerEqDependencies = {
+  DenseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSmallerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSort.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSort.generated.js
new file mode 100644
index 0000000..7ce4fa8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSort.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSort } from '../../factoriesAny.js';
+export var sortDependencies = {
+  compareDependencies,
+  compareNaturalDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSort
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpaClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpaClass.generated.js
new file mode 100644
index 0000000..2a2c95c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpaClass.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { FibonacciHeapDependencies } from './dependenciesFibonacciHeapClass.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { createSpaClass } from '../../factoriesAny.js';
+export var SpaDependencies = {
+  FibonacciHeapDependencies,
+  addScalarDependencies,
+  equalScalarDependencies,
+  createSpaClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparse.generated.js
new file mode 100644
index 0000000..2166043
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparse.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSparse } from '../../factoriesAny.js';
+export var sparseDependencies = {
+  SparseMatrixDependencies,
+  typedDependencies,
+  createSparse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
new file mode 100644
index 0000000..220d4be
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { MatrixDependencies } from './dependenciesMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSparseMatrixClass } from '../../factoriesAny.js';
+export var SparseMatrixDependencies = {
+  MatrixDependencies,
+  equalScalarDependencies,
+  typedDependencies,
+  createSparseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
new file mode 100644
index 0000000..963a387
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createSpeedOfLight } from '../../factoriesAny.js';
+export var speedOfLightDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createSpeedOfLight
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSplitUnit.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSplitUnit.generated.js
new file mode 100644
index 0000000..67bfa6a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSplitUnit.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSplitUnit } from '../../factoriesAny.js';
+export var splitUnitDependencies = {
+  typedDependencies,
+  createSplitUnit
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..f2a68df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrt.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqrt } from '../../factoriesAny.js';
+export var sqrtDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createSqrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrtm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrtm.generated.js
new file mode 100644
index 0000000..cef2b0b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrtm.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { maxDependencies } from './dependenciesMax.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqrtm } from '../../factoriesAny.js';
+export var sqrtmDependencies = {
+  absDependencies,
+  addDependencies,
+  identityDependencies,
+  invDependencies,
+  maxDependencies,
+  multiplyDependencies,
+  sizeDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createSqrtm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSquare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSquare.generated.js
new file mode 100644
index 0000000..8c24c0e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSquare.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSquare } from '../../factoriesAny.js';
+export var squareDependencies = {
+  typedDependencies,
+  createSquare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqueeze.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqueeze.generated.js
new file mode 100644
index 0000000..07a7e49
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqueeze.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqueeze } from '../../factoriesAny.js';
+export var squeezeDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createSqueeze
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStd.generated.js
new file mode 100644
index 0000000..4a78da9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStd } from '../../factoriesAny.js';
+export var stdDependencies = {
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..d181742
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStdTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStdTransform } from '../../factoriesAny.js';
+export var stdTransformDependencies = {
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStdTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
new file mode 100644
index 0000000..ee5c4d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createStefanBoltzmann } from '../../factoriesAny.js';
+export var stefanBoltzmannDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createStefanBoltzmann
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..a41cf6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStirlingS2.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createStirlingS2 } from '../../factoriesAny.js';
+export var stirlingS2Dependencies = {
+  bignumberDependencies,
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  largerDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  powDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createStirlingS2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesString.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesString.generated.js
new file mode 100644
index 0000000..e7d173e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesString.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createString } from '../../factoriesAny.js';
+export var stringDependencies = {
+  typedDependencies,
+  createString
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubset.generated.js
new file mode 100644
index 0000000..b4eb2c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubset.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSubset } from '../../factoriesAny.js';
+export var subsetDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..44e3299
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSubsetTransform } from '../../factoriesAny.js';
+export var subsetTransformDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createSubsetTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..7edb46c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtract.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createSubtract } from '../../factoriesAny.js';
+export var subtractDependencies = {
+  DenseMatrixDependencies,
+  addScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createSubtract
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSum.generated.js
new file mode 100644
index 0000000..49fc33d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSum } from '../../factoriesAny.js';
+export var sumDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..a21526f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSumTransform } from '../../factoriesAny.js';
+export var sumTransformDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..dcde6cf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createSymbolNode } from '../../factoriesAny.js';
+export var SymbolNodeDependencies = {
+  UnitDependencies,
+  NodeDependencies,
+  createSymbolNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
new file mode 100644
index 0000000..6f529c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSymbolicEqual } from '../../factoriesAny.js';
+export var symbolicEqualDependencies = {
+  OperatorNodeDependencies,
+  parseDependencies,
+  simplifyDependencies,
+  typedDependencies,
+  createSymbolicEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTan.generated.js
new file mode 100644
index 0000000..e445666
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTan } from '../../factoriesAny.js';
+export var tanDependencies = {
+  typedDependencies,
+  createTan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTanh.generated.js
new file mode 100644
index 0000000..d770f24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTanh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTanh } from '../../factoriesAny.js';
+export var tanhDependencies = {
+  typedDependencies,
+  createTanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTau.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTau.generated.js
new file mode 100644
index 0000000..8cf5bda
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTau.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createTau } from '../../factoriesAny.js';
+export var tauDependencies = {
+  BigNumberDependencies,
+  createTau
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
new file mode 100644
index 0000000..92d52f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createThomsonCrossSection } from '../../factoriesAny.js';
+export var thomsonCrossSectionDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createThomsonCrossSection
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTo.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTo.generated.js
new file mode 100644
index 0000000..974861b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTo.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTo } from '../../factoriesAny.js';
+export var toDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createTo
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrace.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrace.generated.js
new file mode 100644
index 0000000..48b6db0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrace.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTrace } from '../../factoriesAny.js';
+export var traceDependencies = {
+  addDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createTrace
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTranspose.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTranspose.generated.js
new file mode 100644
index 0000000..d89ace7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTranspose.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTranspose } from '../../factoriesAny.js';
+export var transposeDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createTranspose
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrue.generated.js
new file mode 100644
index 0000000..c4e92e0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrue.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTrue } from '../../factoriesAny.js';
+export var trueDependencies = {
+  createTrue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..d9aa68b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTypeOf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTypeOf } from '../../factoriesAny.js';
+export var typeOfDependencies = {
+  typedDependencies,
+  createTypeOf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTyped.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTyped.generated.js
new file mode 100644
index 0000000..61e4723
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTyped.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { createTyped } from '../../factoriesAny.js';
+export var typedDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  DenseMatrixDependencies,
+  FractionDependencies,
+  createTyped
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..465375d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryMinus } from '../../factoriesAny.js';
+export var unaryMinusDependencies = {
+  typedDependencies,
+  createUnaryMinus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..2d27490
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryPlus } from '../../factoriesAny.js';
+export var unaryPlusDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createUnaryPlus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..ed50b14
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnequal.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnequal } from '../../factoriesAny.js';
+export var unequalDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createUnequal
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitClass.generated.js
new file mode 100644
index 0000000..1ede07f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitClass.generated.js
@@ -0,0 +1,38 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { fixDependencies } from './dependenciesFix.generated.js';
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { createUnitClass } from '../../factoriesAny.js';
+export var UnitDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  FractionDependencies,
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  equalDependencies,
+  fixDependencies,
+  formatDependencies,
+  isNumericDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  powDependencies,
+  roundDependencies,
+  subtractDependencies,
+  createUnitClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitFunction.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitFunction.generated.js
new file mode 100644
index 0000000..2b82164
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitFunction.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnitFunction } from '../../factoriesAny.js';
+export var unitDependencies = {
+  UnitDependencies,
+  typedDependencies,
+  createUnitFunction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..2c7a8a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercaseE.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { eDependencies } from './dependenciesE.generated.js';
+import { createUppercaseE } from '../../factoriesAny.js';
+export var EDependencies = {
+  eDependencies,
+  createUppercaseE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..fe09896
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercasePi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { piDependencies } from './dependenciesPi.generated.js';
+import { createUppercasePi } from '../../factoriesAny.js';
+export var PIDependencies = {
+  piDependencies,
+  createUppercasePi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolve.generated.js
new file mode 100644
index 0000000..9babfb4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolve.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUsolve } from '../../factoriesAny.js';
+export var usolveDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createUsolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolveAll.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolveAll.generated.js
new file mode 100644
index 0000000..8757317
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolveAll.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUsolveAll } from '../../factoriesAny.js';
+export var usolveAllDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createUsolveAll
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
new file mode 100644
index 0000000..6be2fb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createVacuumImpedance } from '../../factoriesAny.js';
+export var vacuumImpedanceDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createVacuumImpedance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVariance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVariance.generated.js
new file mode 100644
index 0000000..49151a8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVariance.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { applyDependencies } from './dependenciesApply.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVariance } from '../../factoriesAny.js';
+export var varianceDependencies = {
+  addDependencies,
+  applyDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVariance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..6095933
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { applyDependencies } from './dependenciesApply.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVarianceTransform } from '../../factoriesAny.js';
+export var varianceTransformDependencies = {
+  addDependencies,
+  applyDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVarianceTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVersion.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVersion.generated.js
new file mode 100644
index 0000000..7c895fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVersion.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createVersion } from '../../factoriesAny.js';
+export var versionDependencies = {
+  createVersion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
new file mode 100644
index 0000000..716bbf1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createWeakMixingAngle } from '../../factoriesAny.js';
+export var weakMixingAngleDependencies = {
+  BigNumberDependencies,
+  createWeakMixingAngle
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWienDisplacement.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
new file mode 100644
index 0000000..221b0b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createWienDisplacement } from '../../factoriesAny.js';
+export var wienDisplacementDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createWienDisplacement
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..a2e24d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXgcd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXgcd } from '../../factoriesAny.js';
+export var xgcdDependencies = {
+  BigNumberDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createXgcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXor.generated.js
new file mode 100644
index 0000000..eb90a0c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXor.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXor } from '../../factoriesAny.js';
+export var xorDependencies = {
+  DenseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeros.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeros.generated.js
new file mode 100644
index 0000000..de21eba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeros.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createZeros } from '../../factoriesAny.js';
+export var zerosDependencies = {
+  BigNumberDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createZeros
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber.generated.js
new file mode 100644
index 0000000..f2696cf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber.generated.js
@@ -0,0 +1,205 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+export { absDependencies } from './dependenciesNumber/dependenciesAbs.generated.js';
+export { AccessorNodeDependencies } from './dependenciesNumber/dependenciesAccessorNode.generated.js';
+export { acosDependencies } from './dependenciesNumber/dependenciesAcos.generated.js';
+export { acoshDependencies } from './dependenciesNumber/dependenciesAcosh.generated.js';
+export { acotDependencies } from './dependenciesNumber/dependenciesAcot.generated.js';
+export { acothDependencies } from './dependenciesNumber/dependenciesAcoth.generated.js';
+export { acscDependencies } from './dependenciesNumber/dependenciesAcsc.generated.js';
+export { acschDependencies } from './dependenciesNumber/dependenciesAcsch.generated.js';
+export { addDependencies } from './dependenciesNumber/dependenciesAdd.generated.js';
+export { addScalarDependencies } from './dependenciesNumber/dependenciesAddScalar.generated.js';
+export { andDependencies } from './dependenciesNumber/dependenciesAnd.generated.js';
+export { applyDependencies } from './dependenciesNumber/dependenciesApply.generated.js';
+export { applyTransformDependencies } from './dependenciesNumber/dependenciesApplyTransform.generated.js';
+export { ArrayNodeDependencies } from './dependenciesNumber/dependenciesArrayNode.generated.js';
+export { asecDependencies } from './dependenciesNumber/dependenciesAsec.generated.js';
+export { asechDependencies } from './dependenciesNumber/dependenciesAsech.generated.js';
+export { asinDependencies } from './dependenciesNumber/dependenciesAsin.generated.js';
+export { asinhDependencies } from './dependenciesNumber/dependenciesAsinh.generated.js';
+export { AssignmentNodeDependencies } from './dependenciesNumber/dependenciesAssignmentNode.generated.js';
+export { atanDependencies } from './dependenciesNumber/dependenciesAtan.generated.js';
+export { atan2Dependencies } from './dependenciesNumber/dependenciesAtan2.generated.js';
+export { atanhDependencies } from './dependenciesNumber/dependenciesAtanh.generated.js';
+export { bellNumbersDependencies } from './dependenciesNumber/dependenciesBellNumbers.generated.js';
+export { bitAndDependencies } from './dependenciesNumber/dependenciesBitAnd.generated.js';
+export { bitNotDependencies } from './dependenciesNumber/dependenciesBitNot.generated.js';
+export { bitOrDependencies } from './dependenciesNumber/dependenciesBitOr.generated.js';
+export { bitXorDependencies } from './dependenciesNumber/dependenciesBitXor.generated.js';
+export { BlockNodeDependencies } from './dependenciesNumber/dependenciesBlockNode.generated.js';
+export { booleanDependencies } from './dependenciesNumber/dependenciesBoolean.generated.js';
+export { catalanDependencies } from './dependenciesNumber/dependenciesCatalan.generated.js';
+export { cbrtDependencies } from './dependenciesNumber/dependenciesCbrt.generated.js';
+export { ceilDependencies } from './dependenciesNumber/dependenciesCeil.generated.js';
+export { chainDependencies } from './dependenciesNumber/dependenciesChain.generated.js';
+export { ChainDependencies } from './dependenciesNumber/dependenciesChainClass.generated.js';
+export { cloneDependencies } from './dependenciesNumber/dependenciesClone.generated.js';
+export { combinationsDependencies } from './dependenciesNumber/dependenciesCombinations.generated.js';
+export { combinationsWithRepDependencies } from './dependenciesNumber/dependenciesCombinationsWithRep.generated.js';
+export { compareDependencies } from './dependenciesNumber/dependenciesCompare.generated.js';
+export { compareNaturalDependencies } from './dependenciesNumber/dependenciesCompareNatural.generated.js';
+export { compareTextDependencies } from './dependenciesNumber/dependenciesCompareText.generated.js';
+export { compileDependencies } from './dependenciesNumber/dependenciesCompile.generated.js';
+export { compositionDependencies } from './dependenciesNumber/dependenciesComposition.generated.js';
+export { ConditionalNodeDependencies } from './dependenciesNumber/dependenciesConditionalNode.generated.js';
+export { ConstantNodeDependencies } from './dependenciesNumber/dependenciesConstantNode.generated.js';
+export { cosDependencies } from './dependenciesNumber/dependenciesCos.generated.js';
+export { coshDependencies } from './dependenciesNumber/dependenciesCosh.generated.js';
+export { cotDependencies } from './dependenciesNumber/dependenciesCot.generated.js';
+export { cothDependencies } from './dependenciesNumber/dependenciesCoth.generated.js';
+export { cscDependencies } from './dependenciesNumber/dependenciesCsc.generated.js';
+export { cschDependencies } from './dependenciesNumber/dependenciesCsch.generated.js';
+export { cubeDependencies } from './dependenciesNumber/dependenciesCube.generated.js';
+export { cumsumDependencies } from './dependenciesNumber/dependenciesCumSum.generated.js';
+export { cumsumTransformDependencies } from './dependenciesNumber/dependenciesCumSumTransform.generated.js';
+export { deepEqualDependencies } from './dependenciesNumber/dependenciesDeepEqual.generated.js';
+export { derivativeDependencies } from './dependenciesNumber/dependenciesDerivative.generated.js';
+export { divideDependencies } from './dependenciesNumber/dependenciesDivide.generated.js';
+export { divideScalarDependencies } from './dependenciesNumber/dependenciesDivideScalar.generated.js';
+export { eDependencies } from './dependenciesNumber/dependenciesE.generated.js';
+export { equalDependencies } from './dependenciesNumber/dependenciesEqual.generated.js';
+export { equalScalarDependencies } from './dependenciesNumber/dependenciesEqualScalar.generated.js';
+export { equalTextDependencies } from './dependenciesNumber/dependenciesEqualText.generated.js';
+export { erfDependencies } from './dependenciesNumber/dependenciesErf.generated.js';
+export { evaluateDependencies } from './dependenciesNumber/dependenciesEvaluate.generated.js';
+export { expDependencies } from './dependenciesNumber/dependenciesExp.generated.js';
+export { expm1Dependencies } from './dependenciesNumber/dependenciesExpm1.generated.js';
+export { factorialDependencies } from './dependenciesNumber/dependenciesFactorial.generated.js';
+export { falseDependencies } from './dependenciesNumber/dependenciesFalse.generated.js';
+export { filterDependencies } from './dependenciesNumber/dependenciesFilter.generated.js';
+export { filterTransformDependencies } from './dependenciesNumber/dependenciesFilterTransform.generated.js';
+export { fixDependencies } from './dependenciesNumber/dependenciesFix.generated.js';
+export { floorDependencies } from './dependenciesNumber/dependenciesFloor.generated.js';
+export { forEachDependencies } from './dependenciesNumber/dependenciesForEach.generated.js';
+export { forEachTransformDependencies } from './dependenciesNumber/dependenciesForEachTransform.generated.js';
+export { formatDependencies } from './dependenciesNumber/dependenciesFormat.generated.js';
+export { FunctionAssignmentNodeDependencies } from './dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js';
+export { FunctionNodeDependencies } from './dependenciesNumber/dependenciesFunctionNode.generated.js';
+export { gammaDependencies } from './dependenciesNumber/dependenciesGamma.generated.js';
+export { gcdDependencies } from './dependenciesNumber/dependenciesGcd.generated.js';
+export { hasNumericValueDependencies } from './dependenciesNumber/dependenciesHasNumericValue.generated.js';
+export { helpDependencies } from './dependenciesNumber/dependenciesHelp.generated.js';
+export { HelpDependencies } from './dependenciesNumber/dependenciesHelpClass.generated.js';
+export { hypotDependencies } from './dependenciesNumber/dependenciesHypot.generated.js';
+export { indexDependencies } from './dependenciesNumber/dependenciesIndex.generated.js';
+export { IndexNodeDependencies } from './dependenciesNumber/dependenciesIndexNode.generated.js';
+export { InfinityDependencies } from './dependenciesNumber/dependenciesInfinity.generated.js';
+export { isIntegerDependencies } from './dependenciesNumber/dependenciesIsInteger.generated.js';
+export { isNaNDependencies } from './dependenciesNumber/dependenciesIsNaN.generated.js';
+export { isNegativeDependencies } from './dependenciesNumber/dependenciesIsNegative.generated.js';
+export { isNumericDependencies } from './dependenciesNumber/dependenciesIsNumeric.generated.js';
+export { isPositiveDependencies } from './dependenciesNumber/dependenciesIsPositive.generated.js';
+export { isPrimeDependencies } from './dependenciesNumber/dependenciesIsPrime.generated.js';
+export { isZeroDependencies } from './dependenciesNumber/dependenciesIsZero.generated.js';
+export { LN10Dependencies } from './dependenciesNumber/dependenciesLN10.generated.js';
+export { LN2Dependencies } from './dependenciesNumber/dependenciesLN2.generated.js';
+export { LOG10EDependencies } from './dependenciesNumber/dependenciesLOG10E.generated.js';
+export { LOG2EDependencies } from './dependenciesNumber/dependenciesLOG2E.generated.js';
+export { largerDependencies } from './dependenciesNumber/dependenciesLarger.generated.js';
+export { largerEqDependencies } from './dependenciesNumber/dependenciesLargerEq.generated.js';
+export { lcmDependencies } from './dependenciesNumber/dependenciesLcm.generated.js';
+export { leftShiftDependencies } from './dependenciesNumber/dependenciesLeftShift.generated.js';
+export { logDependencies } from './dependenciesNumber/dependenciesLog.generated.js';
+export { log10Dependencies } from './dependenciesNumber/dependenciesLog10.generated.js';
+export { log1pDependencies } from './dependenciesNumber/dependenciesLog1p.generated.js';
+export { log2Dependencies } from './dependenciesNumber/dependenciesLog2.generated.js';
+export { madDependencies } from './dependenciesNumber/dependenciesMad.generated.js';
+export { mapDependencies } from './dependenciesNumber/dependenciesMap.generated.js';
+export { mapTransformDependencies } from './dependenciesNumber/dependenciesMapTransform.generated.js';
+export { matrixDependencies } from './dependenciesNumber/dependenciesMatrix.generated.js';
+export { maxDependencies } from './dependenciesNumber/dependenciesMax.generated.js';
+export { maxTransformDependencies } from './dependenciesNumber/dependenciesMaxTransform.generated.js';
+export { meanDependencies } from './dependenciesNumber/dependenciesMean.generated.js';
+export { meanTransformDependencies } from './dependenciesNumber/dependenciesMeanTransform.generated.js';
+export { medianDependencies } from './dependenciesNumber/dependenciesMedian.generated.js';
+export { minDependencies } from './dependenciesNumber/dependenciesMin.generated.js';
+export { minTransformDependencies } from './dependenciesNumber/dependenciesMinTransform.generated.js';
+export { modDependencies } from './dependenciesNumber/dependenciesMod.generated.js';
+export { modeDependencies } from './dependenciesNumber/dependenciesMode.generated.js';
+export { multinomialDependencies } from './dependenciesNumber/dependenciesMultinomial.generated.js';
+export { multiplyDependencies } from './dependenciesNumber/dependenciesMultiply.generated.js';
+export { multiplyScalarDependencies } from './dependenciesNumber/dependenciesMultiplyScalar.generated.js';
+export { NaNDependencies } from './dependenciesNumber/dependenciesNaN.generated.js';
+export { NodeDependencies } from './dependenciesNumber/dependenciesNode.generated.js';
+export { normDependencies } from './dependenciesNumber/dependenciesNorm.generated.js';
+export { notDependencies } from './dependenciesNumber/dependenciesNot.generated.js';
+export { nthRootDependencies } from './dependenciesNumber/dependenciesNthRoot.generated.js';
+export { nullDependencies } from './dependenciesNumber/dependenciesNull.generated.js';
+export { numberDependencies } from './dependenciesNumber/dependenciesNumber.generated.js';
+export { numericDependencies } from './dependenciesNumber/dependenciesNumeric.generated.js';
+export { ObjectNodeDependencies } from './dependenciesNumber/dependenciesObjectNode.generated.js';
+export { OperatorNodeDependencies } from './dependenciesNumber/dependenciesOperatorNode.generated.js';
+export { orDependencies } from './dependenciesNumber/dependenciesOr.generated.js';
+export { ParenthesisNodeDependencies } from './dependenciesNumber/dependenciesParenthesisNode.generated.js';
+export { parseDependencies } from './dependenciesNumber/dependenciesParse.generated.js';
+export { parserDependencies } from './dependenciesNumber/dependenciesParser.generated.js';
+export { ParserDependencies } from './dependenciesNumber/dependenciesParserClass.generated.js';
+export { partitionSelectDependencies } from './dependenciesNumber/dependenciesPartitionSelect.generated.js';
+export { permutationsDependencies } from './dependenciesNumber/dependenciesPermutations.generated.js';
+export { phiDependencies } from './dependenciesNumber/dependenciesPhi.generated.js';
+export { piDependencies } from './dependenciesNumber/dependenciesPi.generated.js';
+export { pickRandomDependencies } from './dependenciesNumber/dependenciesPickRandom.generated.js';
+export { powDependencies } from './dependenciesNumber/dependenciesPow.generated.js';
+export { printDependencies } from './dependenciesNumber/dependenciesPrint.generated.js';
+export { prodDependencies } from './dependenciesNumber/dependenciesProd.generated.js';
+export { quantileSeqDependencies } from './dependenciesNumber/dependenciesQuantileSeq.generated.js';
+export { randomDependencies } from './dependenciesNumber/dependenciesRandom.generated.js';
+export { randomIntDependencies } from './dependenciesNumber/dependenciesRandomInt.generated.js';
+export { rangeDependencies } from './dependenciesNumber/dependenciesRange.generated.js';
+export { RangeDependencies } from './dependenciesNumber/dependenciesRangeClass.generated.js';
+export { RangeNodeDependencies } from './dependenciesNumber/dependenciesRangeNode.generated.js';
+export { rangeTransformDependencies } from './dependenciesNumber/dependenciesRangeTransform.generated.js';
+export { rationalizeDependencies } from './dependenciesNumber/dependenciesRationalize.generated.js';
+export { RelationalNodeDependencies } from './dependenciesNumber/dependenciesRelationalNode.generated.js';
+export { replacerDependencies } from './dependenciesNumber/dependenciesReplacer.generated.js';
+export { resolveDependencies } from './dependenciesNumber/dependenciesResolve.generated.js';
+export { ResultSetDependencies } from './dependenciesNumber/dependenciesResultSet.generated.js';
+export { reviverDependencies } from './dependenciesNumber/dependenciesReviver.generated.js';
+export { rightArithShiftDependencies } from './dependenciesNumber/dependenciesRightArithShift.generated.js';
+export { rightLogShiftDependencies } from './dependenciesNumber/dependenciesRightLogShift.generated.js';
+export { roundDependencies } from './dependenciesNumber/dependenciesRound.generated.js';
+export { SQRT1_2Dependencies } from './dependenciesNumber/dependenciesSQRT1_2.generated.js'; // eslint-disable-line camelcase
+
+export { SQRT2Dependencies } from './dependenciesNumber/dependenciesSQRT2.generated.js';
+export { secDependencies } from './dependenciesNumber/dependenciesSec.generated.js';
+export { sechDependencies } from './dependenciesNumber/dependenciesSech.generated.js';
+export { signDependencies } from './dependenciesNumber/dependenciesSign.generated.js';
+export { simplifyDependencies } from './dependenciesNumber/dependenciesSimplify.generated.js';
+export { simplifyCoreDependencies } from './dependenciesNumber/dependenciesSimplifyCore.generated.js';
+export { sinDependencies } from './dependenciesNumber/dependenciesSin.generated.js';
+export { sinhDependencies } from './dependenciesNumber/dependenciesSinh.generated.js';
+export { sizeDependencies } from './dependenciesNumber/dependenciesSize.generated.js';
+export { smallerDependencies } from './dependenciesNumber/dependenciesSmaller.generated.js';
+export { smallerEqDependencies } from './dependenciesNumber/dependenciesSmallerEq.generated.js';
+export { sqrtDependencies } from './dependenciesNumber/dependenciesSqrt.generated.js';
+export { squareDependencies } from './dependenciesNumber/dependenciesSquare.generated.js';
+export { stdDependencies } from './dependenciesNumber/dependenciesStd.generated.js';
+export { stdTransformDependencies } from './dependenciesNumber/dependenciesStdTransform.generated.js';
+export { stirlingS2Dependencies } from './dependenciesNumber/dependenciesStirlingS2.generated.js';
+export { stringDependencies } from './dependenciesNumber/dependenciesString.generated.js';
+export { subsetDependencies } from './dependenciesNumber/dependenciesSubset.generated.js';
+export { subsetTransformDependencies } from './dependenciesNumber/dependenciesSubsetTransform.generated.js';
+export { subtractDependencies } from './dependenciesNumber/dependenciesSubtract.generated.js';
+export { sumDependencies } from './dependenciesNumber/dependenciesSum.generated.js';
+export { sumTransformDependencies } from './dependenciesNumber/dependenciesSumTransform.generated.js';
+export { SymbolNodeDependencies } from './dependenciesNumber/dependenciesSymbolNode.generated.js';
+export { tanDependencies } from './dependenciesNumber/dependenciesTan.generated.js';
+export { tanhDependencies } from './dependenciesNumber/dependenciesTanh.generated.js';
+export { tauDependencies } from './dependenciesNumber/dependenciesTau.generated.js';
+export { trueDependencies } from './dependenciesNumber/dependenciesTrue.generated.js';
+export { typeOfDependencies } from './dependenciesNumber/dependenciesTypeOf.generated.js';
+export { typedDependencies } from './dependenciesNumber/dependenciesTyped.generated.js';
+export { unaryMinusDependencies } from './dependenciesNumber/dependenciesUnaryMinus.generated.js';
+export { unaryPlusDependencies } from './dependenciesNumber/dependenciesUnaryPlus.generated.js';
+export { unequalDependencies } from './dependenciesNumber/dependenciesUnequal.generated.js';
+export { EDependencies } from './dependenciesNumber/dependenciesUppercaseE.generated.js';
+export { PIDependencies } from './dependenciesNumber/dependenciesUppercasePi.generated.js';
+export { varianceDependencies } from './dependenciesNumber/dependenciesVariance.generated.js';
+export { varianceTransformDependencies } from './dependenciesNumber/dependenciesVarianceTransform.generated.js';
+export { versionDependencies } from './dependenciesNumber/dependenciesVersion.generated.js';
+export { xgcdDependencies } from './dependenciesNumber/dependenciesXgcd.generated.js';
+export { xorDependencies } from './dependenciesNumber/dependenciesXor.generated.js';
+export { all } from './allFactoriesNumber.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js
new file mode 100644
index 0000000..8e76a18
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAbs } from '../../factoriesNumber.js';
+export var absDependencies = {
+  typedDependencies,
+  createAbs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..eb1fee5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAccessorNode } from '../../factoriesNumber.js';
+export var AccessorNodeDependencies = {
+  NodeDependencies,
+  subsetDependencies,
+  createAccessorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcos.generated.js
new file mode 100644
index 0000000..898a51e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcos.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcos } from '../../factoriesNumber.js';
+export var acosDependencies = {
+  typedDependencies,
+  createAcos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..b84cc05
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcosh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcosh } from '../../factoriesNumber.js';
+export var acoshDependencies = {
+  typedDependencies,
+  createAcosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcot.generated.js
new file mode 100644
index 0000000..f8db302
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcot } from '../../factoriesNumber.js';
+export var acotDependencies = {
+  typedDependencies,
+  createAcot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..a14ff92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcoth.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcoth } from '../../factoriesNumber.js';
+export var acothDependencies = {
+  typedDependencies,
+  createAcoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..bc87242
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsc.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsc } from '../../factoriesNumber.js';
+export var acscDependencies = {
+  typedDependencies,
+  createAcsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..3faae99
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsch.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsch } from '../../factoriesNumber.js';
+export var acschDependencies = {
+  typedDependencies,
+  createAcsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js
new file mode 100644
index 0000000..a440e5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAdd } from '../../factoriesNumber.js';
+export var addDependencies = {
+  typedDependencies,
+  createAdd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..47cb618
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAddScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAddScalar } from '../../factoriesNumber.js';
+export var addScalarDependencies = {
+  typedDependencies,
+  createAddScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAnd.generated.js
new file mode 100644
index 0000000..045289d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAnd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAnd } from '../../factoriesNumber.js';
+export var andDependencies = {
+  typedDependencies,
+  createAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesApply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesApply.generated.js
new file mode 100644
index 0000000..fac00eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesApply.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createApply } from '../../factoriesNumber.js';
+export var applyDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createApply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesApplyTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesApplyTransform.generated.js
new file mode 100644
index 0000000..003efa3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesApplyTransform.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createApplyTransform } from '../../factoriesNumber.js';
+export var applyTransformDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createApplyTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..0651558
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createArrayNode } from '../../factoriesNumber.js';
+export var ArrayNodeDependencies = {
+  NodeDependencies,
+  createArrayNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsec.generated.js
new file mode 100644
index 0000000..79fafbe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsec.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsec } from '../../factoriesNumber.js';
+export var asecDependencies = {
+  typedDependencies,
+  createAsec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsech.generated.js
new file mode 100644
index 0000000..607f607
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsech.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsech } from '../../factoriesNumber.js';
+export var asechDependencies = {
+  typedDependencies,
+  createAsech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsin.generated.js
new file mode 100644
index 0000000..631c616
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsin.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsin } from '../../factoriesNumber.js';
+export var asinDependencies = {
+  typedDependencies,
+  createAsin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..d55d45e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsinh } from '../../factoriesNumber.js';
+export var asinhDependencies = {
+  typedDependencies,
+  createAsinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..7f83cec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAssignmentNode } from '../../factoriesNumber.js';
+export var AssignmentNodeDependencies = {
+  matrixDependencies,
+  NodeDependencies,
+  subsetDependencies,
+  createAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan.generated.js
new file mode 100644
index 0000000..ed88d81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan } from '../../factoriesNumber.js';
+export var atanDependencies = {
+  typedDependencies,
+  createAtan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..8aaaafa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan2 } from '../../factoriesNumber.js';
+export var atan2Dependencies = {
+  typedDependencies,
+  createAtan2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..d5b8076
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtanh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtanh } from '../../factoriesNumber.js';
+export var atanhDependencies = {
+  typedDependencies,
+  createAtanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..5464e7a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { stirlingS2Dependencies } from './dependenciesStirlingS2.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBellNumbers } from '../../factoriesNumber.js';
+export var bellNumbersDependencies = {
+  addScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  stirlingS2Dependencies,
+  typedDependencies,
+  createBellNumbers
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..68268db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitAnd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitAnd } from '../../factoriesNumber.js';
+export var bitAndDependencies = {
+  typedDependencies,
+  createBitAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..a8c3bdc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitNot } from '../../factoriesNumber.js';
+export var bitNotDependencies = {
+  typedDependencies,
+  createBitNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..4aeaeda
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitOr.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitOr } from '../../factoriesNumber.js';
+export var bitOrDependencies = {
+  typedDependencies,
+  createBitOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..81badcb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitXor.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitXor } from '../../factoriesNumber.js';
+export var bitXorDependencies = {
+  typedDependencies,
+  createBitXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..0043939
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { ResultSetDependencies } from './dependenciesResultSet.generated.js';
+import { createBlockNode } from '../../factoriesNumber.js';
+export var BlockNodeDependencies = {
+  NodeDependencies,
+  ResultSetDependencies,
+  createBlockNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..f25ec83
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBoolean.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBoolean } from '../../factoriesNumber.js';
+export var booleanDependencies = {
+  typedDependencies,
+  createBoolean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..1933851
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCatalan.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCatalan } from '../../factoriesNumber.js';
+export var catalanDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createCatalan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..48c4f97
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCbrt.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCbrt } from '../../factoriesNumber.js';
+export var cbrtDependencies = {
+  typedDependencies,
+  createCbrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCeil.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCeil.generated.js
new file mode 100644
index 0000000..a0abed9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCeil.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCeil } from '../../factoriesNumber.js';
+export var ceilDependencies = {
+  typedDependencies,
+  createCeil
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChain.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChain.generated.js
new file mode 100644
index 0000000..71e7b15
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChain.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ChainDependencies } from './dependenciesChainClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createChain } from '../../factoriesNumber.js';
+export var chainDependencies = {
+  ChainDependencies,
+  typedDependencies,
+  createChain
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..0ac8536
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChainClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createChainClass } from '../../factoriesNumber.js';
+export var ChainDependencies = {
+  createChainClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesClone.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesClone.generated.js
new file mode 100644
index 0000000..8041edc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesClone.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createClone } from '../../factoriesNumber.js';
+export var cloneDependencies = {
+  typedDependencies,
+  createClone
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..9cda3b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinations.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinations } from '../../factoriesNumber.js';
+export var combinationsDependencies = {
+  typedDependencies,
+  createCombinations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..e1e4790
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinationsWithRep } from '../../factoriesNumber.js';
+export var combinationsWithRepDependencies = {
+  typedDependencies,
+  createCombinationsWithRep
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompare.generated.js
new file mode 100644
index 0000000..c884350
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompare.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompare } from '../../factoriesNumber.js';
+export var compareDependencies = {
+  typedDependencies,
+  createCompare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..9755e62
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareNatural } from '../../factoriesNumber.js';
+export var compareNaturalDependencies = {
+  compareDependencies,
+  typedDependencies,
+  createCompareNatural
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..ea978ce
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareText.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareText } from '../../factoriesNumber.js';
+export var compareTextDependencies = {
+  typedDependencies,
+  createCompareText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompile.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompile.generated.js
new file mode 100644
index 0000000..542a1f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompile.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompile } from '../../factoriesNumber.js';
+export var compileDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createCompile
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesComposition.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesComposition.generated.js
new file mode 100644
index 0000000..f330d8e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesComposition.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createComposition } from '../../factoriesNumber.js';
+export var compositionDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  isPositiveDependencies,
+  largerDependencies,
+  typedDependencies,
+  createComposition
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..4c34e6a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConditionalNode } from '../../factoriesNumber.js';
+export var ConditionalNodeDependencies = {
+  NodeDependencies,
+  createConditionalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..475a167
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConstantNode } from '../../factoriesNumber.js';
+export var ConstantNodeDependencies = {
+  NodeDependencies,
+  createConstantNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCos.generated.js
new file mode 100644
index 0000000..3e5005c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCos.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCos } from '../../factoriesNumber.js';
+export var cosDependencies = {
+  typedDependencies,
+  createCos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCosh.generated.js
new file mode 100644
index 0000000..2baafcc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCosh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCosh } from '../../factoriesNumber.js';
+export var coshDependencies = {
+  typedDependencies,
+  createCosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCot.generated.js
new file mode 100644
index 0000000..674ee60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCot } from '../../factoriesNumber.js';
+export var cotDependencies = {
+  typedDependencies,
+  createCot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCoth.generated.js
new file mode 100644
index 0000000..7a0499a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCoth.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCoth } from '../../factoriesNumber.js';
+export var cothDependencies = {
+  typedDependencies,
+  createCoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsc.generated.js
new file mode 100644
index 0000000..9f657c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsc.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsc } from '../../factoriesNumber.js';
+export var cscDependencies = {
+  typedDependencies,
+  createCsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsch.generated.js
new file mode 100644
index 0000000..1744426
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsch.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsch } from '../../factoriesNumber.js';
+export var cschDependencies = {
+  typedDependencies,
+  createCsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCube.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCube.generated.js
new file mode 100644
index 0000000..c4ae1d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCube.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCube } from '../../factoriesNumber.js';
+export var cubeDependencies = {
+  typedDependencies,
+  createCube
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..fb98496
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSum } from '../../factoriesNumber.js';
+export var cumsumDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..4bc32c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSumTransform } from '../../factoriesNumber.js';
+export var cumsumTransformDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..994ed63
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDeepEqual } from '../../factoriesNumber.js';
+export var deepEqualDependencies = {
+  equalDependencies,
+  typedDependencies,
+  createDeepEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..388309d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDerivative.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDerivative } from '../../factoriesNumber.js';
+export var derivativeDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  numericDependencies,
+  parseDependencies,
+  simplifyDependencies,
+  typedDependencies,
+  createDerivative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js
new file mode 100644
index 0000000..cc18b98
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivide } from '../../factoriesNumber.js';
+export var divideDependencies = {
+  typedDependencies,
+  createDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..7471996
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivideScalar } from '../../factoriesNumber.js';
+export var divideScalarDependencies = {
+  typedDependencies,
+  createDivideScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js
new file mode 100644
index 0000000..734a86c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createE } from '../../factoriesNumber.js';
+export var eDependencies = {
+  createE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqual.generated.js
new file mode 100644
index 0000000..f6efd58
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqual.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqual } from '../../factoriesNumber.js';
+export var equalDependencies = {
+  equalScalarDependencies,
+  typedDependencies,
+  createEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..e8985ab
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualScalar } from '../../factoriesNumber.js';
+export var equalScalarDependencies = {
+  typedDependencies,
+  createEqualScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..cfcbd90
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualText.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareTextDependencies } from './dependenciesCompareText.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualText } from '../../factoriesNumber.js';
+export var equalTextDependencies = {
+  compareTextDependencies,
+  isZeroDependencies,
+  typedDependencies,
+  createEqualText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesErf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesErf.generated.js
new file mode 100644
index 0000000..ccc3714
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesErf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createErf } from '../../factoriesNumber.js';
+export var erfDependencies = {
+  typedDependencies,
+  createErf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..b843c1c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEvaluate } from '../../factoriesNumber.js';
+export var evaluateDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createEvaluate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js
new file mode 100644
index 0000000..f1af13b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExp } from '../../factoriesNumber.js';
+export var expDependencies = {
+  typedDependencies,
+  createExp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..5379c46
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExpm1.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExpm1 } from '../../factoriesNumber.js';
+export var expm1Dependencies = {
+  typedDependencies,
+  createExpm1
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..9fe7608
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { gammaDependencies } from './dependenciesGamma.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFactorial } from '../../factoriesNumber.js';
+export var factorialDependencies = {
+  gammaDependencies,
+  typedDependencies,
+  createFactorial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFalse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFalse.generated.js
new file mode 100644
index 0000000..ba9c2d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFalse.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createFalse } from '../../factoriesNumber.js';
+export var falseDependencies = {
+  createFalse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilter.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilter.generated.js
new file mode 100644
index 0000000..365fbe3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilter.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilter } from '../../factoriesNumber.js';
+export var filterDependencies = {
+  typedDependencies,
+  createFilter
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..9195d5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilterTransform } from '../../factoriesNumber.js';
+export var filterTransformDependencies = {
+  typedDependencies,
+  createFilterTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFix.generated.js
new file mode 100644
index 0000000..90011c4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFix.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFix } from '../../factoriesNumber.js';
+export var fixDependencies = {
+  typedDependencies,
+  createFix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFloor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFloor.generated.js
new file mode 100644
index 0000000..963031a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFloor.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFloor } from '../../factoriesNumber.js';
+export var floorDependencies = {
+  typedDependencies,
+  createFloor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEach.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEach.generated.js
new file mode 100644
index 0000000..7bbdc94
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEach.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEach } from '../../factoriesNumber.js';
+export var forEachDependencies = {
+  typedDependencies,
+  createForEach
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..f300f41
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEachTransform } from '../../factoriesNumber.js';
+export var forEachTransformDependencies = {
+  typedDependencies,
+  createForEachTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFormat.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFormat.generated.js
new file mode 100644
index 0000000..7be7c47
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFormat.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFormat } from '../../factoriesNumber.js';
+export var formatDependencies = {
+  typedDependencies,
+  createFormat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..fd579c7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFunctionAssignmentNode } from '../../factoriesNumber.js';
+export var FunctionAssignmentNodeDependencies = {
+  NodeDependencies,
+  typedDependencies,
+  createFunctionAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..24ec5d6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { createFunctionNode } from '../../factoriesNumber.js';
+export var FunctionNodeDependencies = {
+  NodeDependencies,
+  SymbolNodeDependencies,
+  createFunctionNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js
new file mode 100644
index 0000000..c380fe5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGamma } from '../../factoriesNumber.js';
+export var gammaDependencies = {
+  typedDependencies,
+  createGamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js
new file mode 100644
index 0000000..47feec3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGcd } from '../../factoriesNumber.js';
+export var gcdDependencies = {
+  typedDependencies,
+  createGcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..d742528
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHasNumericValue } from '../../factoriesNumber.js';
+export var hasNumericValueDependencies = {
+  isNumericDependencies,
+  typedDependencies,
+  createHasNumericValue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelp.generated.js
new file mode 100644
index 0000000..6afd037
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelp.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { HelpDependencies } from './dependenciesHelpClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHelp } from '../../factoriesNumber.js';
+export var helpDependencies = {
+  HelpDependencies,
+  typedDependencies,
+  createHelp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..81e9714
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelpClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { createHelpClass } from '../../factoriesNumber.js';
+export var HelpDependencies = {
+  parseDependencies,
+  createHelpClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHypot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHypot.generated.js
new file mode 100644
index 0000000..fc777ba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHypot.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHypot } from '../../factoriesNumber.js';
+export var hypotDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  isPositiveDependencies,
+  multiplyScalarDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  createHypot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndex.generated.js
new file mode 100644
index 0000000..52f74db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndex.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createIndex } from '../../factoriesNumber.js';
+export var indexDependencies = {
+  createIndex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..05ae538
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { RangeDependencies } from './dependenciesRangeClass.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { createIndexNode } from '../../factoriesNumber.js';
+export var IndexNodeDependencies = {
+  NodeDependencies,
+  RangeDependencies,
+  sizeDependencies,
+  createIndexNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..9e44daf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesInfinity.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createInfinity } from '../../factoriesNumber.js';
+export var InfinityDependencies = {
+  createInfinity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..e00294f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsInteger.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsInteger } from '../../factoriesNumber.js';
+export var isIntegerDependencies = {
+  typedDependencies,
+  createIsInteger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..abb7251
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNaN.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNaN } from '../../factoriesNumber.js';
+export var isNaNDependencies = {
+  typedDependencies,
+  createIsNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..853c1cb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNegative.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNegative } from '../../factoriesNumber.js';
+export var isNegativeDependencies = {
+  typedDependencies,
+  createIsNegative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..92559b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNumeric } from '../../factoriesNumber.js';
+export var isNumericDependencies = {
+  typedDependencies,
+  createIsNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..f0364ca
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPositive.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPositive } from '../../factoriesNumber.js';
+export var isPositiveDependencies = {
+  typedDependencies,
+  createIsPositive
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..6640f72
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPrime.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPrime } from '../../factoriesNumber.js';
+export var isPrimeDependencies = {
+  typedDependencies,
+  createIsPrime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..5421b80
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsZero.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsZero } from '../../factoriesNumber.js';
+export var isZeroDependencies = {
+  typedDependencies,
+  createIsZero
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN10.generated.js
new file mode 100644
index 0000000..1400488
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN10.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLN10 } from '../../factoriesNumber.js';
+export var LN10Dependencies = {
+  createLN10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN2.generated.js
new file mode 100644
index 0000000..c2d6f69
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN2.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLN2 } from '../../factoriesNumber.js';
+export var LN2Dependencies = {
+  createLN2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..c2b3459
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG10E.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLOG10E } from '../../factoriesNumber.js';
+export var LOG10EDependencies = {
+  createLOG10E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..f3160ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG2E.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLOG2E } from '../../factoriesNumber.js';
+export var LOG2EDependencies = {
+  createLOG2E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLarger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLarger.generated.js
new file mode 100644
index 0000000..2f61473
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLarger.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLarger } from '../../factoriesNumber.js';
+export var largerDependencies = {
+  typedDependencies,
+  createLarger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..a4bb0d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLargerEq.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLargerEq } from '../../factoriesNumber.js';
+export var largerEqDependencies = {
+  typedDependencies,
+  createLargerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js
new file mode 100644
index 0000000..e4bd1f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLcm } from '../../factoriesNumber.js';
+export var lcmDependencies = {
+  typedDependencies,
+  createLcm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..73200ac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLeftShift.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLeftShift } from '../../factoriesNumber.js';
+export var leftShiftDependencies = {
+  typedDependencies,
+  createLeftShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js
new file mode 100644
index 0000000..cb01c2e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog } from '../../factoriesNumber.js';
+export var logDependencies = {
+  typedDependencies,
+  createLog
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js
new file mode 100644
index 0000000..1fe8881
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog10 } from '../../factoriesNumber.js';
+export var log10Dependencies = {
+  typedDependencies,
+  createLog10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..ca3d2c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog1p } from '../../factoriesNumber.js';
+export var log1pDependencies = {
+  typedDependencies,
+  createLog1p
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js
new file mode 100644
index 0000000..b05a6f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog2 } from '../../factoriesNumber.js';
+export var log2Dependencies = {
+  typedDependencies,
+  createLog2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMad.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMad.generated.js
new file mode 100644
index 0000000..b0f4b23
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMad.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { medianDependencies } from './dependenciesMedian.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMad } from '../../factoriesNumber.js';
+export var madDependencies = {
+  absDependencies,
+  mapDependencies,
+  medianDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createMad
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMap.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMap.generated.js
new file mode 100644
index 0000000..471b19e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMap.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMap } from '../../factoriesNumber.js';
+export var mapDependencies = {
+  typedDependencies,
+  createMap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..5164952
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapTransform } from '../../factoriesNumber.js';
+export var mapTransformDependencies = {
+  typedDependencies,
+  createMapTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..243ce4d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createMatrix } from '../../factoriesNumber.js';
+export var matrixDependencies = {
+  createMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMax.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMax.generated.js
new file mode 100644
index 0000000..ef1a6c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMax.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMax } from '../../factoriesNumber.js';
+export var maxDependencies = {
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMax
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..0a8a682
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMaxTransform } from '../../factoriesNumber.js';
+export var maxTransformDependencies = {
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMaxTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMean.generated.js
new file mode 100644
index 0000000..b98f47c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMean.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMean } from '../../factoriesNumber.js';
+export var meanDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..303d649
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMeanTransform } from '../../factoriesNumber.js';
+export var meanTransformDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMeanTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMedian.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMedian.generated.js
new file mode 100644
index 0000000..901be99
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMedian.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMedian } from '../../factoriesNumber.js';
+export var medianDependencies = {
+  addDependencies,
+  compareDependencies,
+  divideDependencies,
+  partitionSelectDependencies,
+  typedDependencies,
+  createMedian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMin.generated.js
new file mode 100644
index 0000000..ad5a53e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMin.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMin } from '../../factoriesNumber.js';
+export var minDependencies = {
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..9443dd3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMinTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMinTransform } from '../../factoriesNumber.js';
+export var minTransformDependencies = {
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMinTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js
new file mode 100644
index 0000000..05a3684
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMod } from '../../factoriesNumber.js';
+export var modDependencies = {
+  typedDependencies,
+  createMod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMode.generated.js
new file mode 100644
index 0000000..536d896
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMode } from '../../factoriesNumber.js';
+export var modeDependencies = {
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createMode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..58da7ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultinomial.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultinomial } from '../../factoriesNumber.js';
+export var multinomialDependencies = {
+  addDependencies,
+  divideDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isPositiveDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createMultinomial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..85e70b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiply } from '../../factoriesNumber.js';
+export var multiplyDependencies = {
+  typedDependencies,
+  createMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..9227ace
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiplyScalar } from '../../factoriesNumber.js';
+export var multiplyScalarDependencies = {
+  typedDependencies,
+  createMultiplyScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNaN.generated.js
new file mode 100644
index 0000000..f1d9672
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNaN.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNaN } from '../../factoriesNumber.js';
+export var NaNDependencies = {
+  createNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js
new file mode 100644
index 0000000..65103e1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNode } from '../../factoriesNumber.js';
+export var NodeDependencies = {
+  createNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNorm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNorm.generated.js
new file mode 100644
index 0000000..c717d33
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNorm.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNorm } from '../../factoriesNumber.js';
+export var normDependencies = {
+  typedDependencies,
+  createNorm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNot.generated.js
new file mode 100644
index 0000000..7dd2bfb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNot } from '../../factoriesNumber.js';
+export var notDependencies = {
+  typedDependencies,
+  createNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..7ec9c5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNthRoot } from '../../factoriesNumber.js';
+export var nthRootDependencies = {
+  typedDependencies,
+  createNthRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNull.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNull.generated.js
new file mode 100644
index 0000000..4fa0bcb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNull.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNull } from '../../factoriesNumber.js';
+export var nullDependencies = {
+  createNull
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js
new file mode 100644
index 0000000..c694992
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNumber } from '../../factoriesNumber.js';
+export var numberDependencies = {
+  typedDependencies,
+  createNumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..525b859
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { createNumeric } from '../../factoriesNumber.js';
+export var numericDependencies = {
+  numberDependencies,
+  createNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..4575c9e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createObjectNode } from '../../factoriesNumber.js';
+export var ObjectNodeDependencies = {
+  NodeDependencies,
+  createObjectNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..a694cce
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createOperatorNode } from '../../factoriesNumber.js';
+export var OperatorNodeDependencies = {
+  NodeDependencies,
+  createOperatorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOr.generated.js
new file mode 100644
index 0000000..6c4cd33
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOr.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOr } from '../../factoriesNumber.js';
+export var orDependencies = {
+  typedDependencies,
+  createOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..e21611e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createParenthesisNode } from '../../factoriesNumber.js';
+export var ParenthesisNodeDependencies = {
+  NodeDependencies,
+  createParenthesisNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js
new file mode 100644
index 0000000..63c742e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js
@@ -0,0 +1,42 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { AssignmentNodeDependencies } from './dependenciesAssignmentNode.generated.js';
+import { BlockNodeDependencies } from './dependenciesBlockNode.generated.js';
+import { ConditionalNodeDependencies } from './dependenciesConditionalNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionAssignmentNodeDependencies } from './dependenciesFunctionAssignmentNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { RangeNodeDependencies } from './dependenciesRangeNode.generated.js';
+import { RelationalNodeDependencies } from './dependenciesRelationalNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParse } from '../../factoriesNumber.js';
+export var parseDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  AssignmentNodeDependencies,
+  BlockNodeDependencies,
+  ConditionalNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  RangeNodeDependencies,
+  RelationalNodeDependencies,
+  SymbolNodeDependencies,
+  numericDependencies,
+  typedDependencies,
+  createParse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParser.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParser.generated.js
new file mode 100644
index 0000000..b7c3dba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParser.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ParserDependencies } from './dependenciesParserClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParser } from '../../factoriesNumber.js';
+export var parserDependencies = {
+  ParserDependencies,
+  typedDependencies,
+  createParser
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..bba1cc8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParserClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { evaluateDependencies } from './dependenciesEvaluate.generated.js';
+import { createParserClass } from '../../factoriesNumber.js';
+export var ParserDependencies = {
+  evaluateDependencies,
+  createParserClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..87a18c2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPartitionSelect } from '../../factoriesNumber.js';
+export var partitionSelectDependencies = {
+  compareDependencies,
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createPartitionSelect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..319d5b7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPermutations.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPermutations } from '../../factoriesNumber.js';
+export var permutationsDependencies = {
+  factorialDependencies,
+  typedDependencies,
+  createPermutations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPhi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPhi.generated.js
new file mode 100644
index 0000000..085d93e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPhi.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createPhi } from '../../factoriesNumber.js';
+export var phiDependencies = {
+  createPhi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js
new file mode 100644
index 0000000..76ba1ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createPi } from '../../factoriesNumber.js';
+export var piDependencies = {
+  createPi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..9d030e5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPickRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPickRandom } from '../../factoriesNumber.js';
+export var pickRandomDependencies = {
+  typedDependencies,
+  createPickRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js
new file mode 100644
index 0000000..afa55f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPow } from '../../factoriesNumber.js';
+export var powDependencies = {
+  typedDependencies,
+  createPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPrint.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPrint.generated.js
new file mode 100644
index 0000000..2c84688
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPrint.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPrint } from '../../factoriesNumber.js';
+export var printDependencies = {
+  typedDependencies,
+  createPrint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesProd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesProd.generated.js
new file mode 100644
index 0000000..c510314
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesProd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createProd } from '../../factoriesNumber.js';
+export var prodDependencies = {
+  multiplyScalarDependencies,
+  numericDependencies,
+  typedDependencies,
+  createProd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..cb08eb1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createQuantileSeq } from '../../factoriesNumber.js';
+export var quantileSeqDependencies = {
+  addDependencies,
+  compareDependencies,
+  multiplyDependencies,
+  partitionSelectDependencies,
+  typedDependencies,
+  createQuantileSeq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandom.generated.js
new file mode 100644
index 0000000..604e834
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandom } from '../../factoriesNumber.js';
+export var randomDependencies = {
+  typedDependencies,
+  createRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..d0e737d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandomInt.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandomInt } from '../../factoriesNumber.js';
+export var randomIntDependencies = {
+  typedDependencies,
+  createRandomInt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRange.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRange.generated.js
new file mode 100644
index 0000000..edd333d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRange.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRange } from '../../factoriesNumber.js';
+export var rangeDependencies = {
+  matrixDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRange
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..51eb295
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createRangeClass } from '../../factoriesNumber.js';
+export var RangeDependencies = {
+  createRangeClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..78457e1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRangeNode } from '../../factoriesNumber.js';
+export var RangeNodeDependencies = {
+  NodeDependencies,
+  createRangeNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..ec07e5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRangeTransform } from '../../factoriesNumber.js';
+export var rangeTransformDependencies = {
+  matrixDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRangeTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..e353f68
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRationalize.generated.js
@@ -0,0 +1,50 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRationalize } from '../../factoriesNumber.js';
+export var rationalizeDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  simplifyDependencies,
+  simplifyCoreDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createRationalize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..b833c77
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRelationalNode } from '../../factoriesNumber.js';
+export var RelationalNodeDependencies = {
+  NodeDependencies,
+  createRelationalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..93af6ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReplacer.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReplacer } from '../../factoriesNumber.js';
+export var replacerDependencies = {
+  createReplacer
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResolve.generated.js
new file mode 100644
index 0000000..a37abf7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResolve.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { createResolve } from '../../factoriesNumber.js';
+export var resolveDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  parseDependencies,
+  createResolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..859c522
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createResultSet } from '../../factoriesNumber.js';
+export var ResultSetDependencies = {
+  createResultSet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReviver.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReviver.generated.js
new file mode 100644
index 0000000..00bc722
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReviver.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReviver } from '../../factoriesNumber.js';
+export var reviverDependencies = {
+  createReviver
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..335469c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRightArithShift } from '../../factoriesNumber.js';
+export var rightArithShiftDependencies = {
+  typedDependencies,
+  createRightArithShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..e07b745
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRightLogShift } from '../../factoriesNumber.js';
+export var rightLogShiftDependencies = {
+  typedDependencies,
+  createRightLogShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js
new file mode 100644
index 0000000..6a77140
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRound } from '../../factoriesNumber.js';
+export var roundDependencies = {
+  typedDependencies,
+  createRound
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..38a4da2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSQRT1_2 } from '../../factoriesNumber.js'; // eslint-disable-line camelcase
+
+export var SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  createSQRT1_2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..5898c96
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT2.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSQRT2 } from '../../factoriesNumber.js';
+export var SQRT2Dependencies = {
+  createSQRT2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSec.generated.js
new file mode 100644
index 0000000..037c4d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSec.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSec } from '../../factoriesNumber.js';
+export var secDependencies = {
+  typedDependencies,
+  createSec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSech.generated.js
new file mode 100644
index 0000000..b37d296
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSech.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSech } from '../../factoriesNumber.js';
+export var sechDependencies = {
+  typedDependencies,
+  createSech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js
new file mode 100644
index 0000000..27bf617
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSign } from '../../factoriesNumber.js';
+export var signDependencies = {
+  typedDependencies,
+  createSign
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..be70400
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplify.generated.js
@@ -0,0 +1,50 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { resolveDependencies } from './dependenciesResolve.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplify } from '../../factoriesNumber.js';
+export var simplifyDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  resolveDependencies,
+  simplifyCoreDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createSimplify
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..e6b7106
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,40 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { createSimplifyCore } from '../../factoriesNumber.js';
+export var simplifyCoreDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  multiplyDependencies,
+  powDependencies,
+  subtractDependencies,
+  createSimplifyCore
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSin.generated.js
new file mode 100644
index 0000000..36e19f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSin.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSin } from '../../factoriesNumber.js';
+export var sinDependencies = {
+  typedDependencies,
+  createSin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSinh.generated.js
new file mode 100644
index 0000000..526371a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSinh } from '../../factoriesNumber.js';
+export var sinhDependencies = {
+  typedDependencies,
+  createSinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js
new file mode 100644
index 0000000..7bf5f8c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSize } from '../../factoriesNumber.js';
+export var sizeDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..c1a70ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmaller.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmaller } from '../../factoriesNumber.js';
+export var smallerDependencies = {
+  typedDependencies,
+  createSmaller
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..8cea526
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmallerEq } from '../../factoriesNumber.js';
+export var smallerEqDependencies = {
+  typedDependencies,
+  createSmallerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..4da7267
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqrt } from '../../factoriesNumber.js';
+export var sqrtDependencies = {
+  typedDependencies,
+  createSqrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSquare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSquare.generated.js
new file mode 100644
index 0000000..71799ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSquare.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSquare } from '../../factoriesNumber.js';
+export var squareDependencies = {
+  typedDependencies,
+  createSquare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStd.generated.js
new file mode 100644
index 0000000..75a3a8d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStd } from '../../factoriesNumber.js';
+export var stdDependencies = {
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..f6cb83b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStdTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStdTransform } from '../../factoriesNumber.js';
+export var stdTransformDependencies = {
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStdTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..4ddbd87
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
@@ -0,0 +1,32 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createStirlingS2 } from '../../factoriesNumber.js';
+export var stirlingS2Dependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  largerDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  powDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createStirlingS2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesString.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesString.generated.js
new file mode 100644
index 0000000..57db84e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesString.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createString } from '../../factoriesNumber.js';
+export var stringDependencies = {
+  typedDependencies,
+  createString
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js
new file mode 100644
index 0000000..668726f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSubset } from '../../factoriesNumber.js';
+export var subsetDependencies = {
+  createSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..6a3251a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSubsetTransform } from '../../factoriesNumber.js';
+export var subsetTransformDependencies = {
+  createSubsetTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..3f3e157
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSubtract } from '../../factoriesNumber.js';
+export var subtractDependencies = {
+  typedDependencies,
+  createSubtract
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSum.generated.js
new file mode 100644
index 0000000..9aa4cf5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSum } from '../../factoriesNumber.js';
+export var sumDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..19b997f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSumTransform } from '../../factoriesNumber.js';
+export var sumTransformDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..aca084a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createSymbolNode } from '../../factoriesNumber.js';
+export var SymbolNodeDependencies = {
+  NodeDependencies,
+  createSymbolNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTan.generated.js
new file mode 100644
index 0000000..cf31167
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTan } from '../../factoriesNumber.js';
+export var tanDependencies = {
+  typedDependencies,
+  createTan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTanh.generated.js
new file mode 100644
index 0000000..701f718
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTanh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTanh } from '../../factoriesNumber.js';
+export var tanhDependencies = {
+  typedDependencies,
+  createTanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTau.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTau.generated.js
new file mode 100644
index 0000000..ca81ba7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTau.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTau } from '../../factoriesNumber.js';
+export var tauDependencies = {
+  createTau
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTrue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTrue.generated.js
new file mode 100644
index 0000000..c29345a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTrue.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTrue } from '../../factoriesNumber.js';
+export var trueDependencies = {
+  createTrue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..dd137bd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTypeOf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTypeOf } from '../../factoriesNumber.js';
+export var typeOfDependencies = {
+  typedDependencies,
+  createTypeOf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js
new file mode 100644
index 0000000..2daf5ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTyped } from '../../factoriesNumber.js';
+export var typedDependencies = {
+  createTyped
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..a7a3254
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryMinus } from '../../factoriesNumber.js';
+export var unaryMinusDependencies = {
+  typedDependencies,
+  createUnaryMinus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..dd0851d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryPlus } from '../../factoriesNumber.js';
+export var unaryPlusDependencies = {
+  typedDependencies,
+  createUnaryPlus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..cff54df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnequal.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnequal } from '../../factoriesNumber.js';
+export var unequalDependencies = {
+  equalScalarDependencies,
+  typedDependencies,
+  createUnequal
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..152876b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { eDependencies } from './dependenciesE.generated.js';
+import { createUppercaseE } from '../../factoriesNumber.js';
+export var EDependencies = {
+  eDependencies,
+  createUppercaseE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..02189a3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { piDependencies } from './dependenciesPi.generated.js';
+import { createUppercasePi } from '../../factoriesNumber.js';
+export var PIDependencies = {
+  piDependencies,
+  createUppercasePi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVariance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVariance.generated.js
new file mode 100644
index 0000000..c13bfbe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVariance.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { applyDependencies } from './dependenciesApply.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVariance } from '../../factoriesNumber.js';
+export var varianceDependencies = {
+  addDependencies,
+  applyDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVariance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..596bb1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { applyDependencies } from './dependenciesApply.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVarianceTransform } from '../../factoriesNumber.js';
+export var varianceTransformDependencies = {
+  addDependencies,
+  applyDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVarianceTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVersion.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVersion.generated.js
new file mode 100644
index 0000000..c16c379
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVersion.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createVersion } from '../../factoriesNumber.js';
+export var versionDependencies = {
+  createVersion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..749e8e8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXgcd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXgcd } from '../../factoriesNumber.js';
+export var xgcdDependencies = {
+  typedDependencies,
+  createXgcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXor.generated.js
new file mode 100644
index 0000000..192daf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXor.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXor } from '../../factoriesNumber.js';
+export var xorDependencies = {
+  typedDependencies,
+  createXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js b/node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js
new file mode 100644
index 0000000..3bcaa12
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js
@@ -0,0 +1,662 @@
+import _extends from "@babel/runtime/helpers/extends";
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createChainClass, createNode, createObjectNode, createOperatorNode, createParenthesisNode, createRelationalNode, createArrayNode, createBlockNode, createConditionalNode, createConstantNode, createRangeNode, createReviver, createChain, createFunctionAssignmentNode, createAccessorNode, createAssignmentNode, createIndexNode, createSymbolNode, createFunctionNode, createParse, createResolve, createCompile, createEvaluate, createHelpClass, createLeafCount, createParserClass, createParser, createSimplifyCore, createSimplify, createDerivative, createRationalize, createHelp, createSymbolicEqual, createFilterTransform, createForEachTransform, createMapTransform, createApplyTransform, createDiffTransform, createIndexTransform, createSubsetTransform, createConcatTransform, createMaxTransform, createMinTransform, createRangeTransform, createRowTransform, createSumTransform, createColumnTransform, createCumSumTransform, createStdTransform, createVarianceTransform, createMeanTransform } from '../factoriesAny.js';
+import { BigNumber, Complex, e, _false, fineStructure, Fraction, i, _Infinity, LN10, LOG10E, Matrix, _NaN, _null, phi, Range, ResultSet, SQRT1_2, // eslint-disable-line camelcase
+sackurTetrode, tau, _true, version, DenseMatrix, efimovFactor, LN2, pi, replacer, SQRT2, typed, unaryPlus, weakMixingAngle, abs, acos, acot, acsc, addScalar, arg, asech, asinh, atan, atanh, bignumber, bitNot, boolean, clone, combinations, complex, conj, cosh, coth, csc, cube, equalScalar, erf, exp, expm1, filter, forEach, format, getMatrixDataType, hex, im, isInteger, isNegative, isPositive, isZero, LOG2E, log10, log2, map, multiplyScalar, not, number, oct, pickRandom, print, random, re, sec, sign, sin, SparseMatrix, splitUnit, square, string, tan, typeOf, acosh, acsch, apply, asec, bin, combinationsWithRep, cos, csch, isNaN, isPrime, randomInt, sech, sinh, sparse, sqrt, tanh, unaryMinus, acoth, cot, fraction, isNumeric, matrix, matrixFromFunction, mod, nthRoot, numeric, or, prod, reshape, size, smaller, squeeze, subset, subtract, to, transpose, xgcd, zeros, and, bitAnd, bitXor, cbrt, compare, compareText, concat, count, ctranspose, diag, divideScalar, dotDivide, equal, flatten, gcd, hasNumericValue, hypot, ImmutableDenseMatrix, Index, kron, largerEq, leftShift, lsolve, matrixFromColumns, min, mode, nthRoots, ones, partitionSelect, resize, rightArithShift, round, smallerEq, unequal, usolve, xor, add, atan2, bitOr, catalan, compareNatural, cumsum, deepEqual, diff, dot, equalText, floor, identity, invmod, larger, log, lsolveAll, matrixFromRows, multiply, pow, qr, range, rightLogShift, row, setCartesian, setDistinct, setIsSubset, setPowerset, slu, sum, trace, usolveAll, asin, ceil, column, composition, cross, distance, dotMultiply, FibonacciHeap, fix, gamma, index, lcm, log1p, max, quantileSeq, setDifference, setMultiplicity, setSymDifference, sort, Unit, vacuumImpedance, wienDisplacement, atomicMass, bohrMagneton, boltzmann, conductanceQuantum, createUnit, deuteronMass, dotPow, electricConstant, elementaryCharge, factorial, fermiCoupling, gasConstant, gravity, intersect, inverseConductanceQuantum, klitzing, loschmidt, magneticConstant, molarMass, molarPlanckConstant, neutronMass, nuclearMagneton, permutations, planckConstant, planckMass, planckTime, quantumOfCirculation, reducedPlanckConstant, rydberg, setIntersect, setUnion, Spa, stefanBoltzmann, thomsonCrossSection, avogadro, bohrRadius, coulomb, electronMass, faraday, hartreeEnergy, lup, magneticFluxQuantum, molarMassC12, planckCharge, planckTemperature, secondRadiation, speedOfLight, stirlingS2, unit, bellNumbers, det, firstRadiation, molarVolume, protonMass, setSize, classicalElectronRadius, gravitationConstant, inv, lusolve, sqrtm, divide, expm, kldivergence, mean, median, planckLength, variance, eigs, mad, multinomial, std, norm, rotationMatrix, rotate } from './pureFunctionsAny.generated.js';
+var math = {}; // NOT pure!
+
+var mathWithTransform = {}; // NOT pure!
+
+var classes = {}; // NOT pure!
+
+export var Chain = createChainClass({
+  math
+});
+export var Node = createNode({
+  mathWithTransform
+});
+export var ObjectNode = createObjectNode({
+  Node
+});
+export var OperatorNode = createOperatorNode({
+  Node
+});
+export var ParenthesisNode = createParenthesisNode({
+  Node
+});
+export var RelationalNode = createRelationalNode({
+  Node
+});
+export var ArrayNode = createArrayNode({
+  Node
+});
+export var BlockNode = createBlockNode({
+  Node,
+  ResultSet
+});
+export var ConditionalNode = createConditionalNode({
+  Node
+});
+export var ConstantNode = createConstantNode({
+  Node
+});
+export var RangeNode = createRangeNode({
+  Node
+});
+export var reviver = createReviver({
+  classes
+});
+export var chain = createChain({
+  Chain,
+  typed
+});
+export var FunctionAssignmentNode = createFunctionAssignmentNode({
+  Node,
+  typed
+});
+export var AccessorNode = createAccessorNode({
+  Node,
+  subset
+});
+export var AssignmentNode = createAssignmentNode({
+  matrix,
+  Node,
+  subset
+});
+export var IndexNode = createIndexNode({
+  Node,
+  Range,
+  size
+});
+export var SymbolNode = createSymbolNode({
+  Unit,
+  Node,
+  math
+});
+export var FunctionNode = createFunctionNode({
+  Node,
+  SymbolNode,
+  math
+});
+export var parse = createParse({
+  AccessorNode,
+  ArrayNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  config,
+  numeric,
+  typed
+});
+export var resolve = createResolve({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  parse
+});
+export var compile = createCompile({
+  parse,
+  typed
+});
+export var evaluate = createEvaluate({
+  parse,
+  typed
+});
+export var Help = createHelpClass({
+  parse
+});
+export var leafCount = createLeafCount({
+  parse,
+  typed
+});
+export var Parser = createParserClass({
+  evaluate
+});
+export var parser = createParser({
+  Parser,
+  typed
+});
+export var simplifyCore = createSimplifyCore({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  divide,
+  equal,
+  isZero,
+  multiply,
+  pow,
+  subtract
+});
+export var simplify = createSimplify({
+  bignumber,
+  fraction,
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  config,
+  divide,
+  equal,
+  isZero,
+  mathWithTransform,
+  matrix,
+  multiply,
+  parse,
+  pow,
+  resolve,
+  simplifyCore,
+  subtract,
+  typed
+});
+export var derivative = createDerivative({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  config,
+  equal,
+  isZero,
+  numeric,
+  parse,
+  simplify,
+  typed
+});
+export var rationalize = createRationalize({
+  bignumber,
+  fraction,
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  config,
+  divide,
+  equal,
+  isZero,
+  mathWithTransform,
+  matrix,
+  multiply,
+  parse,
+  pow,
+  simplify,
+  simplifyCore,
+  subtract,
+  typed
+});
+export var help = createHelp({
+  Help,
+  mathWithTransform,
+  typed
+});
+export var symbolicEqual = createSymbolicEqual({
+  OperatorNode,
+  parse,
+  simplify,
+  typed
+});
+
+_extends(math, {
+  e,
+  false: _false,
+  fineStructure,
+  i,
+  Infinity: _Infinity,
+  LN10,
+  LOG10E,
+  NaN: _NaN,
+  null: _null,
+  phi,
+  SQRT1_2,
+  sackurTetrode,
+  tau,
+  true: _true,
+  'E': e,
+  version,
+  efimovFactor,
+  LN2,
+  pi,
+  replacer,
+  reviver,
+  SQRT2,
+  typed,
+  unaryPlus,
+  'PI': pi,
+  weakMixingAngle,
+  abs,
+  acos,
+  acot,
+  acsc,
+  addScalar,
+  arg,
+  asech,
+  asinh,
+  atan,
+  atanh,
+  bignumber,
+  bitNot,
+  boolean,
+  chain,
+  clone,
+  combinations,
+  complex,
+  conj,
+  cosh,
+  coth,
+  csc,
+  cube,
+  equalScalar,
+  erf,
+  exp,
+  expm1,
+  filter,
+  forEach,
+  format,
+  getMatrixDataType,
+  hex,
+  im,
+  isInteger,
+  isNegative,
+  isPositive,
+  isZero,
+  LOG2E,
+  log10,
+  log2,
+  map,
+  multiplyScalar,
+  not,
+  number,
+  oct,
+  pickRandom,
+  print,
+  random,
+  re,
+  sec,
+  sign,
+  sin,
+  splitUnit,
+  square,
+  string,
+  tan,
+  typeOf,
+  acosh,
+  acsch,
+  apply,
+  asec,
+  bin,
+  combinationsWithRep,
+  cos,
+  csch,
+  isNaN,
+  isPrime,
+  randomInt,
+  sech,
+  sinh,
+  sparse,
+  sqrt,
+  tanh,
+  unaryMinus,
+  acoth,
+  cot,
+  fraction,
+  isNumeric,
+  matrix,
+  matrixFromFunction,
+  mod,
+  nthRoot,
+  numeric,
+  or,
+  prod,
+  reshape,
+  size,
+  smaller,
+  squeeze,
+  subset,
+  subtract,
+  to,
+  transpose,
+  xgcd,
+  zeros,
+  and,
+  bitAnd,
+  bitXor,
+  cbrt,
+  compare,
+  compareText,
+  concat,
+  count,
+  ctranspose,
+  diag,
+  divideScalar,
+  dotDivide,
+  equal,
+  flatten,
+  gcd,
+  hasNumericValue,
+  hypot,
+  kron,
+  largerEq,
+  leftShift,
+  lsolve,
+  matrixFromColumns,
+  min,
+  mode,
+  nthRoots,
+  ones,
+  partitionSelect,
+  resize,
+  rightArithShift,
+  round,
+  smallerEq,
+  unequal,
+  usolve,
+  xor,
+  add,
+  atan2,
+  bitOr,
+  catalan,
+  compareNatural,
+  cumsum,
+  deepEqual,
+  diff,
+  dot,
+  equalText,
+  floor,
+  identity,
+  invmod,
+  larger,
+  log,
+  lsolveAll,
+  matrixFromRows,
+  multiply,
+  pow,
+  qr,
+  range,
+  rightLogShift,
+  row,
+  setCartesian,
+  setDistinct,
+  setIsSubset,
+  setPowerset,
+  slu,
+  sum,
+  trace,
+  usolveAll,
+  asin,
+  ceil,
+  column,
+  composition,
+  cross,
+  distance,
+  dotMultiply,
+  fix,
+  gamma,
+  index,
+  lcm,
+  log1p,
+  max,
+  quantileSeq,
+  setDifference,
+  setMultiplicity,
+  setSymDifference,
+  sort,
+  vacuumImpedance,
+  wienDisplacement,
+  atomicMass,
+  bohrMagneton,
+  boltzmann,
+  conductanceQuantum,
+  createUnit,
+  deuteronMass,
+  dotPow,
+  electricConstant,
+  elementaryCharge,
+  factorial,
+  fermiCoupling,
+  gasConstant,
+  gravity,
+  intersect,
+  inverseConductanceQuantum,
+  klitzing,
+  loschmidt,
+  magneticConstant,
+  molarMass,
+  molarPlanckConstant,
+  neutronMass,
+  nuclearMagneton,
+  permutations,
+  planckConstant,
+  planckMass,
+  planckTime,
+  quantumOfCirculation,
+  reducedPlanckConstant,
+  rydberg,
+  setIntersect,
+  setUnion,
+  stefanBoltzmann,
+  thomsonCrossSection,
+  avogadro,
+  bohrRadius,
+  coulomb,
+  electronMass,
+  faraday,
+  hartreeEnergy,
+  lup,
+  magneticFluxQuantum,
+  molarMassC12,
+  parse,
+  planckCharge,
+  planckTemperature,
+  resolve,
+  secondRadiation,
+  speedOfLight,
+  stirlingS2,
+  unit,
+  bellNumbers,
+  compile,
+  det,
+  evaluate,
+  firstRadiation,
+  leafCount,
+  molarVolume,
+  protonMass,
+  setSize,
+  classicalElectronRadius,
+  gravitationConstant,
+  inv,
+  lusolve,
+  parser,
+  sqrtm,
+  divide,
+  expm,
+  kldivergence,
+  mean,
+  median,
+  planckLength,
+  simplifyCore,
+  variance,
+  eigs,
+  mad,
+  multinomial,
+  simplify,
+  derivative,
+  rationalize,
+  std,
+  help,
+  symbolicEqual,
+  norm,
+  rotationMatrix,
+  rotate,
+  config
+});
+
+_extends(mathWithTransform, math, {
+  filter: createFilterTransform({
+    typed
+  }),
+  forEach: createForEachTransform({
+    typed
+  }),
+  map: createMapTransform({
+    typed
+  }),
+  apply: createApplyTransform({
+    isInteger,
+    typed
+  }),
+  diff: createDiffTransform({
+    bignumber,
+    matrix,
+    number,
+    subtract,
+    typed
+  }),
+  index: createIndexTransform({
+    Index
+  }),
+  subset: createSubsetTransform({
+    matrix,
+    typed
+  }),
+  concat: createConcatTransform({
+    isInteger,
+    matrix,
+    typed
+  }),
+  max: createMaxTransform({
+    config,
+    larger,
+    numeric,
+    typed
+  }),
+  min: createMinTransform({
+    config,
+    numeric,
+    smaller,
+    typed
+  }),
+  range: createRangeTransform({
+    bignumber,
+    matrix,
+    config,
+    larger,
+    largerEq,
+    smaller,
+    smallerEq,
+    typed
+  }),
+  row: createRowTransform({
+    Index,
+    matrix,
+    range,
+    typed
+  }),
+  sum: createSumTransform({
+    add,
+    config,
+    numeric,
+    typed
+  }),
+  column: createColumnTransform({
+    Index,
+    matrix,
+    range,
+    typed
+  }),
+  cumsum: createCumSumTransform({
+    add,
+    typed,
+    unaryPlus
+  }),
+  std: createStdTransform({
+    sqrt,
+    typed,
+    variance
+  }),
+  variance: createVarianceTransform({
+    add,
+    apply,
+    divide,
+    isNaN,
+    multiply,
+    subtract,
+    typed
+  }),
+  mean: createMeanTransform({
+    add,
+    divide,
+    typed
+  })
+});
+
+_extends(classes, {
+  BigNumber,
+  Chain,
+  Complex,
+  Fraction,
+  Matrix,
+  Node,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  Range,
+  RelationalNode,
+  ResultSet,
+  ArrayNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  DenseMatrix,
+  RangeNode,
+  FunctionAssignmentNode,
+  SparseMatrix,
+  AccessorNode,
+  AssignmentNode,
+  ImmutableDenseMatrix,
+  Index,
+  IndexNode,
+  FibonacciHeap,
+  Unit,
+  Spa,
+  SymbolNode,
+  FunctionNode,
+  Help,
+  Parser
+});
+
+Chain.createProxy(math);
+export { embeddedDocs as docs } from '../expression/embeddedDocs/embeddedDocs.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/impureFunctionsNumber.generated.js b/node_modules/mathjs/lib/esm/entry/impureFunctionsNumber.generated.js
new file mode 100644
index 0000000..cce6309
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/impureFunctionsNumber.generated.js
@@ -0,0 +1,480 @@
+import _extends from "@babel/runtime/helpers/extends";
+
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createChainClass, createChain, createNode, createObjectNode, createRangeNode, createRelationalNode, createReviver, createSymbolNode, createAccessorNode, createAssignmentNode, createBlockNode, createConditionalNode, createFunctionNode, createIndexNode, createOperatorNode, createConstantNode, createFunctionAssignmentNode, createParenthesisNode, createArrayNode, createSimplifyCore, createParse, createResolve, createCompile, createEvaluate, createHelpClass, createParserClass, createSimplify, createDerivative, createRationalize, createHelp, createParser, createCumSumTransform, createApplyTransform, createFilterTransform, createForEachTransform, createMapTransform, createMeanTransform, createSubsetTransform, createVarianceTransform, createMaxTransform, createMinTransform, createRangeTransform, createStdTransform, createSumTransform } from '../factoriesNumber.js';
+import { e, _false, index, _Infinity, LN10, LOG10E, matrix, _NaN, _null, phi, Range, replacer, ResultSet, SQRT1_2, // eslint-disable-line camelcase
+subset, tau, typed, unaryPlus, version, xor, abs, acos, acot, acsc, add, and, asec, asin, atan, atanh, bitAnd, bitOr, boolean, cbrt, combinations, compare, compareText, cos, cot, csc, cube, divide, equalScalar, erf, exp, filter, fix, forEach, format, gamma, isInteger, isNegative, isPositive, isZero, LOG2E, largerEq, leftShift, log10, log2, map, mean, mod, multiply, not, number, or, pi, pow, random, rightLogShift, SQRT2, sech, sin, size, smallerEq, square, string, subtract, tanh, typeOf, unequal, xgcd, acoth, addScalar, asech, bitNot, ceil, combinationsWithRep, cosh, csch, divideScalar, equalText, expm1, isNumeric, LN2, lcm, log1p, multiplyScalar, nthRoot, pickRandom, randomInt, rightArithShift, sec, sinh, sqrt, tan, unaryMinus, acosh, apply, asinh, bitXor, clone, cumsum, equal, factorial, hasNumericValue, isNaN, larger, mode, norm, partitionSelect, print, quantileSeq, round, smaller, stirlingS2, _true, variance, acsch, atan2, catalan, composition, deepEqual, floor, hypot, log, median, multinomial, permutations, range, sign, std, compareNatural, coth, gcd, isPrime, numeric, prod, sum, bellNumbers, mad, max, min } from './pureFunctionsNumber.generated.js';
+var math = {}; // NOT pure!
+
+var mathWithTransform = {}; // NOT pure!
+
+var classes = {}; // NOT pure!
+
+export var Chain = createChainClass({
+  math
+});
+export var chain = createChain({
+  Chain,
+  typed
+});
+export var Node = createNode({
+  mathWithTransform
+});
+export var ObjectNode = createObjectNode({
+  Node
+});
+export var RangeNode = createRangeNode({
+  Node
+});
+export var RelationalNode = createRelationalNode({
+  Node
+});
+export var reviver = createReviver({
+  classes
+});
+export var SymbolNode = createSymbolNode({
+  Node,
+  math
+});
+export var AccessorNode = createAccessorNode({
+  Node,
+  subset
+});
+export var AssignmentNode = createAssignmentNode({
+  matrix,
+  Node,
+  subset
+});
+export var BlockNode = createBlockNode({
+  Node,
+  ResultSet
+});
+export var ConditionalNode = createConditionalNode({
+  Node
+});
+export var FunctionNode = createFunctionNode({
+  Node,
+  SymbolNode,
+  math
+});
+export var IndexNode = createIndexNode({
+  Node,
+  Range,
+  size
+});
+export var OperatorNode = createOperatorNode({
+  Node
+});
+export var ConstantNode = createConstantNode({
+  Node
+});
+export var FunctionAssignmentNode = createFunctionAssignmentNode({
+  Node,
+  typed
+});
+export var ParenthesisNode = createParenthesisNode({
+  Node
+});
+export var ArrayNode = createArrayNode({
+  Node
+});
+export var simplifyCore = createSimplifyCore({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  divide,
+  equal,
+  isZero,
+  multiply,
+  pow,
+  subtract
+});
+export var parse = createParse({
+  AccessorNode,
+  ArrayNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  config,
+  numeric,
+  typed
+});
+export var resolve = createResolve({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  parse
+});
+export var compile = createCompile({
+  parse,
+  typed
+});
+export var evaluate = createEvaluate({
+  parse,
+  typed
+});
+export var Help = createHelpClass({
+  parse
+});
+export var Parser = createParserClass({
+  evaluate
+});
+export var simplify = createSimplify({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  config,
+  divide,
+  equal,
+  isZero,
+  mathWithTransform,
+  matrix,
+  multiply,
+  parse,
+  pow,
+  resolve,
+  simplifyCore,
+  subtract,
+  typed
+});
+export var derivative = createDerivative({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  config,
+  equal,
+  isZero,
+  numeric,
+  parse,
+  simplify,
+  typed
+});
+export var rationalize = createRationalize({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  config,
+  divide,
+  equal,
+  isZero,
+  mathWithTransform,
+  matrix,
+  multiply,
+  parse,
+  pow,
+  simplify,
+  simplifyCore,
+  subtract,
+  typed
+});
+export var help = createHelp({
+  Help,
+  mathWithTransform,
+  typed
+});
+export var parser = createParser({
+  Parser,
+  typed
+});
+
+_extends(math, {
+  e,
+  false: _false,
+  index,
+  Infinity: _Infinity,
+  LN10,
+  LOG10E,
+  matrix,
+  NaN: _NaN,
+  null: _null,
+  phi,
+  replacer,
+  SQRT1_2,
+  subset,
+  tau,
+  typed,
+  unaryPlus,
+  'E': e,
+  version,
+  xor,
+  abs,
+  acos,
+  acot,
+  acsc,
+  add,
+  and,
+  asec,
+  asin,
+  atan,
+  atanh,
+  bitAnd,
+  bitOr,
+  boolean,
+  cbrt,
+  chain,
+  combinations,
+  compare,
+  compareText,
+  cos,
+  cot,
+  csc,
+  cube,
+  divide,
+  equalScalar,
+  erf,
+  exp,
+  filter,
+  fix,
+  forEach,
+  format,
+  gamma,
+  isInteger,
+  isNegative,
+  isPositive,
+  isZero,
+  LOG2E,
+  largerEq,
+  leftShift,
+  log10,
+  log2,
+  map,
+  mean,
+  mod,
+  multiply,
+  not,
+  number,
+  or,
+  pi,
+  pow,
+  random,
+  reviver,
+  rightLogShift,
+  SQRT2,
+  sech,
+  sin,
+  size,
+  smallerEq,
+  square,
+  string,
+  subtract,
+  tanh,
+  typeOf,
+  unequal,
+  xgcd,
+  acoth,
+  addScalar,
+  asech,
+  bitNot,
+  ceil,
+  combinationsWithRep,
+  cosh,
+  csch,
+  divideScalar,
+  equalText,
+  expm1,
+  isNumeric,
+  LN2,
+  lcm,
+  log1p,
+  multiplyScalar,
+  nthRoot,
+  pickRandom,
+  randomInt,
+  rightArithShift,
+  sec,
+  sinh,
+  sqrt,
+  tan,
+  unaryMinus,
+  acosh,
+  apply,
+  asinh,
+  bitXor,
+  clone,
+  cumsum,
+  equal,
+  factorial,
+  hasNumericValue,
+  isNaN,
+  larger,
+  mode,
+  norm,
+  partitionSelect,
+  print,
+  quantileSeq,
+  round,
+  smaller,
+  stirlingS2,
+  true: _true,
+  variance,
+  acsch,
+  atan2,
+  catalan,
+  composition,
+  deepEqual,
+  floor,
+  hypot,
+  log,
+  median,
+  multinomial,
+  permutations,
+  range,
+  sign,
+  std,
+  'PI': pi,
+  compareNatural,
+  coth,
+  gcd,
+  isPrime,
+  numeric,
+  prod,
+  simplifyCore,
+  sum,
+  bellNumbers,
+  mad,
+  max,
+  parse,
+  resolve,
+  compile,
+  evaluate,
+  simplify,
+  derivative,
+  min,
+  rationalize,
+  help,
+  parser,
+  config
+});
+
+_extends(mathWithTransform, math, {
+  cumsum: createCumSumTransform({
+    add,
+    typed,
+    unaryPlus
+  }),
+  apply: createApplyTransform({
+    isInteger,
+    typed
+  }),
+  filter: createFilterTransform({
+    typed
+  }),
+  forEach: createForEachTransform({
+    typed
+  }),
+  map: createMapTransform({
+    typed
+  }),
+  mean: createMeanTransform({
+    add,
+    divide,
+    typed
+  }),
+  subset: createSubsetTransform({}),
+  variance: createVarianceTransform({
+    add,
+    apply,
+    divide,
+    isNaN,
+    multiply,
+    subtract,
+    typed
+  }),
+  max: createMaxTransform({
+    config,
+    larger,
+    numeric,
+    typed
+  }),
+  min: createMinTransform({
+    config,
+    numeric,
+    smaller,
+    typed
+  }),
+  range: createRangeTransform({
+    matrix,
+    config,
+    larger,
+    largerEq,
+    smaller,
+    smallerEq,
+    typed
+  }),
+  std: createStdTransform({
+    sqrt,
+    typed,
+    variance
+  }),
+  sum: createSumTransform({
+    add,
+    config,
+    numeric,
+    typed
+  })
+});
+
+_extends(classes, {
+  Chain,
+  Range,
+  ResultSet,
+  Node,
+  ObjectNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  AccessorNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  FunctionNode,
+  IndexNode,
+  OperatorNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  ParenthesisNode,
+  ArrayNode,
+  Help,
+  Parser
+});
+
+Chain.createProxy(math);
+export { embeddedDocs as docs } from '../expression/embeddedDocs/embeddedDocs.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/mainAny.js b/node_modules/mathjs/lib/esm/entry/mainAny.js
new file mode 100644
index 0000000..1ff4f5a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/mainAny.js
@@ -0,0 +1,17 @@
+// configuration
+export { config } from './configReadonly.js'; // functions and constants
+
+export * from './pureFunctionsAny.generated.js';
+export * from './impureFunctionsAny.generated.js';
+export * from './typeChecks.js'; // error classes
+
+export { IndexError } from '../error/IndexError.js';
+export { DimensionError } from '../error/DimensionError.js';
+export { ArgumentsError } from '../error/ArgumentsError.js'; // dependency groups
+
+export * from './dependenciesAny.generated.js'; // factory functions
+
+export * from '../factoriesAny.js'; // core
+
+export { create } from '../core/create.js';
+export { factory } from '../utils/factory.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/mainNumber.js b/node_modules/mathjs/lib/esm/entry/mainNumber.js
new file mode 100644
index 0000000..0739dc1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/mainNumber.js
@@ -0,0 +1,17 @@
+// configuration
+export { config } from './configReadonly.js'; // functions and constants
+
+export * from './pureFunctionsNumber.generated.js';
+export * from './impureFunctionsNumber.generated.js';
+export * from './typeChecks.js'; // error classes
+
+export { IndexError } from '../error/IndexError.js';
+export { DimensionError } from '../error/DimensionError.js';
+export { ArgumentsError } from '../error/ArgumentsError.js'; // dependency groups
+
+export * from './dependenciesNumber.generated.js'; // factory functions
+
+export * from '../factoriesNumber.js'; // core
+
+export { create } from '../core/create.js';
+export { factory } from '../utils/factory.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js b/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js
new file mode 100644
index 0000000..f231f2c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js
@@ -0,0 +1,1575 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createBigNumberClass, createComplexClass, createE, createFalse, createFineStructure, createFractionClass, createI, createInfinity, createLN10, createLOG10E, createMatrixClass, createNaN, createNull, createPhi, createRangeClass, createResultSet, createSQRT1_2, // eslint-disable-line camelcase
+createSackurTetrode, 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, 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, createFlatten, createGcd, createHasNumericValue, createHypot, createImmutableDenseMatrixClass, createIndexClass, 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, createPow, createQr, createRange, createRightLogShift, createRow, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSlu, createSum, createTrace, createUsolveAll, createAsin, createCeil, createColumn, createComposition, createCross, createDistance, createDotMultiply, createFibonacciHeapClass, createFix, createGamma, createIndex, createLcm, createLog1p, createMax, createQuantileSeq, createSetDifference, createSetMultiplicity, createSetSymDifference, createSort, createUnitClass, createVacuumImpedance, createWienDisplacement, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createCreateUnit, createDeuteronMass, createDotPow, createElectricConstant, createElementaryCharge, createFactorial, createFermiCoupling, createGasConstant, createGravity, createIntersect, createInverseConductanceQuantum, createKlitzing, createLoschmidt, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createNuclearMagneton, createPermutations, createPlanckConstant, createPlanckMass, createPlanckTime, createQuantumOfCirculation, createReducedPlanckConstant, createRydberg, createSetIntersect, createSetUnion, createSpaClass, createStefanBoltzmann, createThomsonCrossSection, createAvogadro, createBohrRadius, createCoulomb, createElectronMass, createFaraday, createHartreeEnergy, createLup, createMagneticFluxQuantum, createMolarMassC12, createPlanckCharge, createPlanckTemperature, createSecondRadiation, createSpeedOfLight, createStirlingS2, createUnitFunction, createBellNumbers, createDet, createFirstRadiation, createMolarVolume, createProtonMass, createSetSize, createClassicalElectronRadius, createGravitationConstant, createInv, createLusolve, createSqrtm, createDivide, createExpm, createKldivergence, createMean, createMedian, createPlanckLength, createVariance, createEigs, createMad, createMultinomial, createStd, createNorm, createRotationMatrix, createRotate } from '../factoriesAny.js';
+export var BigNumber = /* #__PURE__ */createBigNumberClass({
+  config
+});
+export var Complex = /* #__PURE__ */createComplexClass({});
+export var e = /* #__PURE__ */createE({
+  BigNumber,
+  config
+});
+export var _false = /* #__PURE__ */createFalse({});
+export var fineStructure = /* #__PURE__ */createFineStructure({
+  BigNumber,
+  config
+});
+export var Fraction = /* #__PURE__ */createFractionClass({});
+export var i = /* #__PURE__ */createI({
+  Complex
+});
+export var _Infinity = /* #__PURE__ */createInfinity({
+  BigNumber,
+  config
+});
+export var LN10 = /* #__PURE__ */createLN10({
+  BigNumber,
+  config
+});
+export var LOG10E = /* #__PURE__ */createLOG10E({
+  BigNumber,
+  config
+});
+export var Matrix = /* #__PURE__ */createMatrixClass({});
+export var _NaN = /* #__PURE__ */createNaN({
+  BigNumber,
+  config
+});
+export var _null = /* #__PURE__ */createNull({});
+export var phi = /* #__PURE__ */createPhi({
+  BigNumber,
+  config
+});
+export var Range = /* #__PURE__ */createRangeClass({});
+export var ResultSet = /* #__PURE__ */createResultSet({});
+export var SQRT1_2 = /* #__PURE__ */createSQRT1_2({
+  BigNumber,
+  config
+});
+export var sackurTetrode = /* #__PURE__ */createSackurTetrode({
+  BigNumber,
+  config
+});
+export var tau = /* #__PURE__ */createTau({
+  BigNumber,
+  config
+});
+export var _true = /* #__PURE__ */createTrue({});
+export var version = /* #__PURE__ */createVersion({});
+export var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({
+  Matrix
+});
+export var efimovFactor = /* #__PURE__ */createEfimovFactor({
+  BigNumber,
+  config
+});
+export var LN2 = /* #__PURE__ */createLN2({
+  BigNumber,
+  config
+});
+export var pi = /* #__PURE__ */createPi({
+  BigNumber,
+  config
+});
+export var replacer = /* #__PURE__ */createReplacer({});
+export var SQRT2 = /* #__PURE__ */createSQRT2({
+  BigNumber,
+  config
+});
+export var typed = /* #__PURE__ */createTyped({
+  BigNumber,
+  Complex,
+  DenseMatrix,
+  Fraction
+});
+export var unaryPlus = /* #__PURE__ */createUnaryPlus({
+  BigNumber,
+  config,
+  typed
+});
+export var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({
+  BigNumber,
+  config
+});
+export var abs = /* #__PURE__ */createAbs({
+  typed
+});
+export var acos = /* #__PURE__ */createAcos({
+  Complex,
+  config,
+  typed
+});
+export var acot = /* #__PURE__ */createAcot({
+  BigNumber,
+  typed
+});
+export var acsc = /* #__PURE__ */createAcsc({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var addScalar = /* #__PURE__ */createAddScalar({
+  typed
+});
+export var arg = /* #__PURE__ */createArg({
+  typed
+});
+export var asech = /* #__PURE__ */createAsech({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var asinh = /* #__PURE__ */createAsinh({
+  typed
+});
+export var atan = /* #__PURE__ */createAtan({
+  typed
+});
+export var atanh = /* #__PURE__ */createAtanh({
+  Complex,
+  config,
+  typed
+});
+export var bignumber = /* #__PURE__ */createBignumber({
+  BigNumber,
+  typed
+});
+export var bitNot = /* #__PURE__ */createBitNot({
+  typed
+});
+export var boolean = /* #__PURE__ */createBoolean({
+  typed
+});
+export var clone = /* #__PURE__ */createClone({
+  typed
+});
+export var combinations = /* #__PURE__ */createCombinations({
+  typed
+});
+export var complex = /* #__PURE__ */createComplex({
+  Complex,
+  typed
+});
+export var conj = /* #__PURE__ */createConj({
+  typed
+});
+export var cosh = /* #__PURE__ */createCosh({
+  typed
+});
+export var coth = /* #__PURE__ */createCoth({
+  BigNumber,
+  typed
+});
+export var csc = /* #__PURE__ */createCsc({
+  BigNumber,
+  typed
+});
+export var cube = /* #__PURE__ */createCube({
+  typed
+});
+export var equalScalar = /* #__PURE__ */createEqualScalar({
+  config,
+  typed
+});
+export var erf = /* #__PURE__ */createErf({
+  typed
+});
+export var exp = /* #__PURE__ */createExp({
+  typed
+});
+export var expm1 = /* #__PURE__ */createExpm1({
+  Complex,
+  typed
+});
+export var filter = /* #__PURE__ */createFilter({
+  typed
+});
+export var forEach = /* #__PURE__ */createForEach({
+  typed
+});
+export var format = /* #__PURE__ */createFormat({
+  typed
+});
+export var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({
+  typed
+});
+export var hex = /* #__PURE__ */createHex({
+  format,
+  typed
+});
+export var im = /* #__PURE__ */createIm({
+  typed
+});
+export var isInteger = /* #__PURE__ */createIsInteger({
+  typed
+});
+export var isNegative = /* #__PURE__ */createIsNegative({
+  typed
+});
+export var isPositive = /* #__PURE__ */createIsPositive({
+  typed
+});
+export var isZero = /* #__PURE__ */createIsZero({
+  typed
+});
+export var LOG2E = /* #__PURE__ */createLOG2E({
+  BigNumber,
+  config
+});
+export var log10 = /* #__PURE__ */createLog10({
+  Complex,
+  config,
+  typed
+});
+export var log2 = /* #__PURE__ */createLog2({
+  Complex,
+  config,
+  typed
+});
+export var map = /* #__PURE__ */createMap({
+  typed
+});
+export var multiplyScalar = /* #__PURE__ */createMultiplyScalar({
+  typed
+});
+export var not = /* #__PURE__ */createNot({
+  typed
+});
+export var number = /* #__PURE__ */createNumber({
+  typed
+});
+export var oct = /* #__PURE__ */createOct({
+  format,
+  typed
+});
+export var pickRandom = /* #__PURE__ */createPickRandom({
+  config,
+  typed
+});
+export var print = /* #__PURE__ */createPrint({
+  typed
+});
+export var random = /* #__PURE__ */createRandom({
+  config,
+  typed
+});
+export var re = /* #__PURE__ */createRe({
+  typed
+});
+export var sec = /* #__PURE__ */createSec({
+  BigNumber,
+  typed
+});
+export var sign = /* #__PURE__ */createSign({
+  BigNumber,
+  Fraction,
+  complex,
+  typed
+});
+export var sin = /* #__PURE__ */createSin({
+  typed
+});
+export var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({
+  Matrix,
+  equalScalar,
+  typed
+});
+export var splitUnit = /* #__PURE__ */createSplitUnit({
+  typed
+});
+export var square = /* #__PURE__ */createSquare({
+  typed
+});
+export var string = /* #__PURE__ */createString({
+  typed
+});
+export var tan = /* #__PURE__ */createTan({
+  typed
+});
+export var typeOf = /* #__PURE__ */createTypeOf({
+  typed
+});
+export var acosh = /* #__PURE__ */createAcosh({
+  Complex,
+  config,
+  typed
+});
+export var acsch = /* #__PURE__ */createAcsch({
+  BigNumber,
+  typed
+});
+export var apply = /* #__PURE__ */createApply({
+  isInteger,
+  typed
+});
+export var asec = /* #__PURE__ */createAsec({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var bin = /* #__PURE__ */createBin({
+  format,
+  typed
+});
+export var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({
+  typed
+});
+export var cos = /* #__PURE__ */createCos({
+  typed
+});
+export var csch = /* #__PURE__ */createCsch({
+  BigNumber,
+  typed
+});
+export var isNaN = /* #__PURE__ */createIsNaN({
+  typed
+});
+export var isPrime = /* #__PURE__ */createIsPrime({
+  typed
+});
+export var randomInt = /* #__PURE__ */createRandomInt({
+  config,
+  typed
+});
+export var sech = /* #__PURE__ */createSech({
+  BigNumber,
+  typed
+});
+export var sinh = /* #__PURE__ */createSinh({
+  typed
+});
+export var sparse = /* #__PURE__ */createSparse({
+  SparseMatrix,
+  typed
+});
+export var sqrt = /* #__PURE__ */createSqrt({
+  Complex,
+  config,
+  typed
+});
+export var tanh = /* #__PURE__ */createTanh({
+  typed
+});
+export var unaryMinus = /* #__PURE__ */createUnaryMinus({
+  typed
+});
+export var acoth = /* #__PURE__ */createAcoth({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var cot = /* #__PURE__ */createCot({
+  BigNumber,
+  typed
+});
+export var fraction = /* #__PURE__ */createFraction({
+  Fraction,
+  typed
+});
+export var isNumeric = /* #__PURE__ */createIsNumeric({
+  typed
+});
+export var matrix = /* #__PURE__ */createMatrix({
+  DenseMatrix,
+  Matrix,
+  SparseMatrix,
+  typed
+});
+export var matrixFromFunction = /* #__PURE__ */createMatrixFromFunction({
+  isZero,
+  matrix,
+  typed
+});
+export var mod = /* #__PURE__ */createMod({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed
+});
+export var nthRoot = /* #__PURE__ */createNthRoot({
+  BigNumber,
+  equalScalar,
+  matrix,
+  typed
+});
+export var numeric = /* #__PURE__ */createNumeric({
+  bignumber,
+  fraction,
+  number
+});
+export var or = /* #__PURE__ */createOr({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed
+});
+export var prod = /* #__PURE__ */createProd({
+  config,
+  multiplyScalar,
+  numeric,
+  typed
+});
+export var reshape = /* #__PURE__ */createReshape({
+  isInteger,
+  matrix,
+  typed
+});
+export var size = /* #__PURE__ */createSize({
+  matrix,
+  config,
+  typed
+});
+export var smaller = /* #__PURE__ */createSmaller({
+  DenseMatrix,
+  config,
+  matrix,
+  typed
+});
+export var squeeze = /* #__PURE__ */createSqueeze({
+  matrix,
+  typed
+});
+export var subset = /* #__PURE__ */createSubset({
+  matrix,
+  typed
+});
+export var subtract = /* #__PURE__ */createSubtract({
+  DenseMatrix,
+  addScalar,
+  equalScalar,
+  matrix,
+  typed,
+  unaryMinus
+});
+export var to = /* #__PURE__ */createTo({
+  matrix,
+  typed
+});
+export var transpose = /* #__PURE__ */createTranspose({
+  matrix,
+  typed
+});
+export var xgcd = /* #__PURE__ */createXgcd({
+  BigNumber,
+  config,
+  matrix,
+  typed
+});
+export var zeros = /* #__PURE__ */createZeros({
+  BigNumber,
+  config,
+  matrix,
+  typed
+});
+export var and = /* #__PURE__ */createAnd({
+  equalScalar,
+  matrix,
+  not,
+  typed,
+  zeros
+});
+export var bitAnd = /* #__PURE__ */createBitAnd({
+  equalScalar,
+  matrix,
+  typed
+});
+export var bitXor = /* #__PURE__ */createBitXor({
+  DenseMatrix,
+  matrix,
+  typed
+});
+export var cbrt = /* #__PURE__ */createCbrt({
+  BigNumber,
+  Complex,
+  Fraction,
+  config,
+  isNegative,
+  matrix,
+  typed,
+  unaryMinus
+});
+export var compare = /* #__PURE__ */createCompare({
+  BigNumber,
+  DenseMatrix,
+  Fraction,
+  config,
+  equalScalar,
+  matrix,
+  typed
+});
+export var compareText = /* #__PURE__ */createCompareText({
+  matrix,
+  typed
+});
+export var concat = /* #__PURE__ */createConcat({
+  isInteger,
+  matrix,
+  typed
+});
+export var count = /* #__PURE__ */createCount({
+  prod,
+  size,
+  typed
+});
+export var ctranspose = /* #__PURE__ */createCtranspose({
+  conj,
+  transpose,
+  typed
+});
+export var diag = /* #__PURE__ */createDiag({
+  DenseMatrix,
+  SparseMatrix,
+  matrix,
+  typed
+});
+export var divideScalar = /* #__PURE__ */createDivideScalar({
+  numeric,
+  typed
+});
+export var dotDivide = /* #__PURE__ */createDotDivide({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  typed
+});
+export var equal = /* #__PURE__ */createEqual({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed
+});
+export var flatten = /* #__PURE__ */createFlatten({
+  matrix,
+  typed
+});
+export var gcd = /* #__PURE__ */createGcd({
+  BigNumber,
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed
+});
+export var hasNumericValue = /* #__PURE__ */createHasNumericValue({
+  isNumeric,
+  typed
+});
+export var hypot = /* #__PURE__ */createHypot({
+  abs,
+  addScalar,
+  divideScalar,
+  isPositive,
+  multiplyScalar,
+  smaller,
+  sqrt,
+  typed
+});
+export var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({
+  DenseMatrix,
+  smaller
+});
+export var Index = /* #__PURE__ */createIndexClass({
+  ImmutableDenseMatrix
+});
+export var kron = /* #__PURE__ */createKron({
+  matrix,
+  multiplyScalar,
+  typed
+});
+export var largerEq = /* #__PURE__ */createLargerEq({
+  DenseMatrix,
+  config,
+  matrix,
+  typed
+});
+export var leftShift = /* #__PURE__ */createLeftShift({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var lsolve = /* #__PURE__ */createLsolve({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtract,
+  typed
+});
+export var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({
+  flatten,
+  matrix,
+  size,
+  typed
+});
+export var min = /* #__PURE__ */createMin({
+  config,
+  numeric,
+  smaller,
+  typed
+});
+export var mode = /* #__PURE__ */createMode({
+  isNaN,
+  isNumeric,
+  typed
+});
+export var nthRoots = /* #__PURE__ */createNthRoots({
+  Complex,
+  config,
+  divideScalar,
+  typed
+});
+export var ones = /* #__PURE__ */createOnes({
+  BigNumber,
+  config,
+  matrix,
+  typed
+});
+export var partitionSelect = /* #__PURE__ */createPartitionSelect({
+  compare,
+  isNaN,
+  isNumeric,
+  typed
+});
+export var resize = /* #__PURE__ */createResize({
+  config,
+  matrix
+});
+export var rightArithShift = /* #__PURE__ */createRightArithShift({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var round = /* #__PURE__ */createRound({
+  BigNumber,
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var smallerEq = /* #__PURE__ */createSmallerEq({
+  DenseMatrix,
+  config,
+  matrix,
+  typed
+});
+export var unequal = /* #__PURE__ */createUnequal({
+  DenseMatrix,
+  config,
+  equalScalar,
+  matrix,
+  typed
+});
+export var usolve = /* #__PURE__ */createUsolve({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtract,
+  typed
+});
+export var xor = /* #__PURE__ */createXor({
+  DenseMatrix,
+  matrix,
+  typed
+});
+export var add = /* #__PURE__ */createAdd({
+  DenseMatrix,
+  SparseMatrix,
+  addScalar,
+  equalScalar,
+  matrix,
+  typed
+});
+export var atan2 = /* #__PURE__ */createAtan2({
+  BigNumber,
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed
+});
+export var bitOr = /* #__PURE__ */createBitOr({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed
+});
+export var catalan = /* #__PURE__ */createCatalan({
+  addScalar,
+  combinations,
+  divideScalar,
+  isInteger,
+  isNegative,
+  multiplyScalar,
+  typed
+});
+export var compareNatural = /* #__PURE__ */createCompareNatural({
+  compare,
+  typed
+});
+export var cumsum = /* #__PURE__ */createCumSum({
+  add,
+  typed,
+  unaryPlus
+});
+export var deepEqual = /* #__PURE__ */createDeepEqual({
+  equal,
+  typed
+});
+export var diff = /* #__PURE__ */createDiff({
+  matrix,
+  number,
+  subtract,
+  typed
+});
+export var dot = /* #__PURE__ */createDot({
+  addScalar,
+  conj,
+  multiplyScalar,
+  size,
+  typed
+});
+export var equalText = /* #__PURE__ */createEqualText({
+  compareText,
+  isZero,
+  typed
+});
+export var floor = /* #__PURE__ */createFloor({
+  config,
+  equalScalar,
+  matrix,
+  round,
+  typed
+});
+export var identity = /* #__PURE__ */createIdentity({
+  BigNumber,
+  DenseMatrix,
+  SparseMatrix,
+  config,
+  matrix,
+  typed
+});
+export var invmod = /* #__PURE__ */createInvmod({
+  BigNumber,
+  add,
+  config,
+  equal,
+  isInteger,
+  mod,
+  smaller,
+  typed,
+  xgcd
+});
+export var larger = /* #__PURE__ */createLarger({
+  DenseMatrix,
+  config,
+  matrix,
+  typed
+});
+export var log = /* #__PURE__ */createLog({
+  Complex,
+  config,
+  divideScalar,
+  typed
+});
+export var lsolveAll = /* #__PURE__ */createLsolveAll({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtract,
+  typed
+});
+export var matrixFromRows = /* #__PURE__ */createMatrixFromRows({
+  flatten,
+  matrix,
+  size,
+  typed
+});
+export var multiply = /* #__PURE__ */createMultiply({
+  addScalar,
+  dot,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  typed
+});
+export var pow = /* #__PURE__ */createPow({
+  Complex,
+  config,
+  fraction,
+  identity,
+  matrix,
+  multiply,
+  number,
+  typed
+});
+export var qr = /* #__PURE__ */createQr({
+  addScalar,
+  complex,
+  conj,
+  divideScalar,
+  equal,
+  identity,
+  isZero,
+  matrix,
+  multiplyScalar,
+  sign,
+  sqrt,
+  subtract,
+  typed,
+  unaryMinus,
+  zeros
+});
+export var range = /* #__PURE__ */createRange({
+  bignumber,
+  matrix,
+  config,
+  larger,
+  largerEq,
+  smaller,
+  smallerEq,
+  typed
+});
+export var rightLogShift = /* #__PURE__ */createRightLogShift({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var row = /* #__PURE__ */createRow({
+  Index,
+  matrix,
+  range,
+  typed
+});
+export var setCartesian = /* #__PURE__ */createSetCartesian({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setDistinct = /* #__PURE__ */createSetDistinct({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setIsSubset = /* #__PURE__ */createSetIsSubset({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setPowerset = /* #__PURE__ */createSetPowerset({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var slu = /* #__PURE__ */createSlu({
+  SparseMatrix,
+  abs,
+  add,
+  divideScalar,
+  larger,
+  largerEq,
+  multiply,
+  subtract,
+  transpose,
+  typed
+});
+export var sum = /* #__PURE__ */createSum({
+  add,
+  config,
+  numeric,
+  typed
+});
+export var trace = /* #__PURE__ */createTrace({
+  add,
+  matrix,
+  typed
+});
+export var usolveAll = /* #__PURE__ */createUsolveAll({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtract,
+  typed
+});
+export var asin = /* #__PURE__ */createAsin({
+  Complex,
+  config,
+  typed
+});
+export var ceil = /* #__PURE__ */createCeil({
+  config,
+  equalScalar,
+  matrix,
+  round,
+  typed
+});
+export var column = /* #__PURE__ */createColumn({
+  Index,
+  matrix,
+  range,
+  typed
+});
+export var composition = /* #__PURE__ */createComposition({
+  addScalar,
+  combinations,
+  isInteger,
+  isNegative,
+  isPositive,
+  larger,
+  typed
+});
+export var cross = /* #__PURE__ */createCross({
+  matrix,
+  multiply,
+  subtract,
+  typed
+});
+export var distance = /* #__PURE__ */createDistance({
+  abs,
+  addScalar,
+  divideScalar,
+  multiplyScalar,
+  sqrt,
+  subtract,
+  typed,
+  unaryMinus
+});
+export var dotMultiply = /* #__PURE__ */createDotMultiply({
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  typed
+});
+export var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({
+  larger,
+  smaller
+});
+export var fix = /* #__PURE__ */createFix({
+  Complex,
+  ceil,
+  floor,
+  matrix,
+  typed
+});
+export var gamma = /* #__PURE__ */createGamma({
+  BigNumber,
+  Complex,
+  config,
+  multiplyScalar,
+  pow,
+  typed
+});
+export var index = /* #__PURE__ */createIndex({
+  Index,
+  typed
+});
+export var lcm = /* #__PURE__ */createLcm({
+  equalScalar,
+  matrix,
+  typed
+});
+export var log1p = /* #__PURE__ */createLog1p({
+  Complex,
+  config,
+  divideScalar,
+  log,
+  typed
+});
+export var max = /* #__PURE__ */createMax({
+  config,
+  larger,
+  numeric,
+  typed
+});
+export var quantileSeq = /* #__PURE__ */createQuantileSeq({
+  add,
+  compare,
+  multiply,
+  partitionSelect,
+  typed
+});
+export var setDifference = /* #__PURE__ */createSetDifference({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setMultiplicity = /* #__PURE__ */createSetMultiplicity({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setSymDifference = /* #__PURE__ */createSetSymDifference({
+  Index,
+  concat,
+  setDifference,
+  size,
+  subset,
+  typed
+});
+export var sort = /* #__PURE__ */createSort({
+  compare,
+  compareNatural,
+  matrix,
+  typed
+});
+export var Unit = /* #__PURE__ */createUnitClass({
+  BigNumber,
+  Complex,
+  Fraction,
+  abs,
+  addScalar,
+  config,
+  divideScalar,
+  equal,
+  fix,
+  format,
+  isNumeric,
+  multiplyScalar,
+  number,
+  pow,
+  round,
+  subtract
+});
+export var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({
+  BigNumber,
+  Unit,
+  config
+});
+export var wienDisplacement = /* #__PURE__ */createWienDisplacement({
+  BigNumber,
+  Unit,
+  config
+});
+export var atomicMass = /* #__PURE__ */createAtomicMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var bohrMagneton = /* #__PURE__ */createBohrMagneton({
+  BigNumber,
+  Unit,
+  config
+});
+export var boltzmann = /* #__PURE__ */createBoltzmann({
+  BigNumber,
+  Unit,
+  config
+});
+export var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({
+  BigNumber,
+  Unit,
+  config
+});
+export var createUnit = /* #__PURE__ */createCreateUnit({
+  Unit,
+  typed
+});
+export var deuteronMass = /* #__PURE__ */createDeuteronMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var dotPow = /* #__PURE__ */createDotPow({
+  DenseMatrix,
+  equalScalar,
+  matrix,
+  pow,
+  typed
+});
+export var electricConstant = /* #__PURE__ */createElectricConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var elementaryCharge = /* #__PURE__ */createElementaryCharge({
+  BigNumber,
+  Unit,
+  config
+});
+export var factorial = /* #__PURE__ */createFactorial({
+  gamma,
+  typed
+});
+export var fermiCoupling = /* #__PURE__ */createFermiCoupling({
+  BigNumber,
+  Unit,
+  config
+});
+export var gasConstant = /* #__PURE__ */createGasConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var gravity = /* #__PURE__ */createGravity({
+  BigNumber,
+  Unit,
+  config
+});
+export var intersect = /* #__PURE__ */createIntersect({
+  abs,
+  add,
+  addScalar,
+  config,
+  divideScalar,
+  equalScalar,
+  flatten,
+  isNumeric,
+  isZero,
+  matrix,
+  multiply,
+  multiplyScalar,
+  smaller,
+  subtract,
+  typed
+});
+export var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({
+  BigNumber,
+  Unit,
+  config
+});
+export var klitzing = /* #__PURE__ */createKlitzing({
+  BigNumber,
+  Unit,
+  config
+});
+export var loschmidt = /* #__PURE__ */createLoschmidt({
+  BigNumber,
+  Unit,
+  config
+});
+export var magneticConstant = /* #__PURE__ */createMagneticConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var molarMass = /* #__PURE__ */createMolarMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var neutronMass = /* #__PURE__ */createNeutronMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({
+  BigNumber,
+  Unit,
+  config
+});
+export var permutations = /* #__PURE__ */createPermutations({
+  factorial,
+  typed
+});
+export var planckConstant = /* #__PURE__ */createPlanckConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckMass = /* #__PURE__ */createPlanckMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckTime = /* #__PURE__ */createPlanckTime({
+  BigNumber,
+  Unit,
+  config
+});
+export var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({
+  BigNumber,
+  Unit,
+  config
+});
+export var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var rydberg = /* #__PURE__ */createRydberg({
+  BigNumber,
+  Unit,
+  config
+});
+export var setIntersect = /* #__PURE__ */createSetIntersect({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setUnion = /* #__PURE__ */createSetUnion({
+  Index,
+  concat,
+  setIntersect,
+  setSymDifference,
+  size,
+  subset,
+  typed
+});
+export var Spa = /* #__PURE__ */createSpaClass({
+  FibonacciHeap,
+  addScalar,
+  equalScalar
+});
+export var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({
+  BigNumber,
+  Unit,
+  config
+});
+export var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({
+  BigNumber,
+  Unit,
+  config
+});
+export var avogadro = /* #__PURE__ */createAvogadro({
+  BigNumber,
+  Unit,
+  config
+});
+export var bohrRadius = /* #__PURE__ */createBohrRadius({
+  BigNumber,
+  Unit,
+  config
+});
+export var coulomb = /* #__PURE__ */createCoulomb({
+  BigNumber,
+  Unit,
+  config
+});
+export var electronMass = /* #__PURE__ */createElectronMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var faraday = /* #__PURE__ */createFaraday({
+  BigNumber,
+  Unit,
+  config
+});
+export var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({
+  BigNumber,
+  Unit,
+  config
+});
+export var lup = /* #__PURE__ */createLup({
+  DenseMatrix,
+  Spa,
+  SparseMatrix,
+  abs,
+  addScalar,
+  divideScalar,
+  equalScalar,
+  larger,
+  matrix,
+  multiplyScalar,
+  subtract,
+  typed,
+  unaryMinus
+});
+export var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({
+  BigNumber,
+  Unit,
+  config
+});
+export var molarMassC12 = /* #__PURE__ */createMolarMassC12({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckCharge = /* #__PURE__ */createPlanckCharge({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckTemperature = /* #__PURE__ */createPlanckTemperature({
+  BigNumber,
+  Unit,
+  config
+});
+export var secondRadiation = /* #__PURE__ */createSecondRadiation({
+  BigNumber,
+  Unit,
+  config
+});
+export var speedOfLight = /* #__PURE__ */createSpeedOfLight({
+  BigNumber,
+  Unit,
+  config
+});
+export var stirlingS2 = /* #__PURE__ */createStirlingS2({
+  bignumber,
+  addScalar,
+  combinations,
+  divideScalar,
+  factorial,
+  isInteger,
+  isNegative,
+  larger,
+  multiplyScalar,
+  number,
+  pow,
+  subtract,
+  typed
+});
+export var unit = /* #__PURE__ */createUnitFunction({
+  Unit,
+  typed
+});
+export var bellNumbers = /* #__PURE__ */createBellNumbers({
+  addScalar,
+  isInteger,
+  isNegative,
+  stirlingS2,
+  typed
+});
+export var det = /* #__PURE__ */createDet({
+  lup,
+  matrix,
+  multiply,
+  subtract,
+  typed,
+  unaryMinus
+});
+export var firstRadiation = /* #__PURE__ */createFirstRadiation({
+  BigNumber,
+  Unit,
+  config
+});
+export var molarVolume = /* #__PURE__ */createMolarVolume({
+  BigNumber,
+  Unit,
+  config
+});
+export var protonMass = /* #__PURE__ */createProtonMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var setSize = /* #__PURE__ */createSetSize({
+  compareNatural,
+  typed
+});
+export var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({
+  BigNumber,
+  Unit,
+  config
+});
+export var gravitationConstant = /* #__PURE__ */createGravitationConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var inv = /* #__PURE__ */createInv({
+  abs,
+  addScalar,
+  det,
+  divideScalar,
+  identity,
+  matrix,
+  multiply,
+  typed,
+  unaryMinus
+});
+export var lusolve = /* #__PURE__ */createLusolve({
+  DenseMatrix,
+  lsolve,
+  lup,
+  matrix,
+  slu,
+  typed,
+  usolve
+});
+export var sqrtm = /* #__PURE__ */createSqrtm({
+  abs,
+  add,
+  identity,
+  inv,
+  max,
+  multiply,
+  size,
+  sqrt,
+  subtract,
+  typed
+});
+export var divide = /* #__PURE__ */createDivide({
+  divideScalar,
+  equalScalar,
+  inv,
+  matrix,
+  multiply,
+  typed
+});
+export var expm = /* #__PURE__ */createExpm({
+  abs,
+  add,
+  identity,
+  inv,
+  multiply,
+  typed
+});
+export var kldivergence = /* #__PURE__ */createKldivergence({
+  divide,
+  dotDivide,
+  isNumeric,
+  log,
+  matrix,
+  multiply,
+  sum,
+  typed
+});
+export var mean = /* #__PURE__ */createMean({
+  add,
+  divide,
+  typed
+});
+export var median = /* #__PURE__ */createMedian({
+  add,
+  compare,
+  divide,
+  partitionSelect,
+  typed
+});
+export var planckLength = /* #__PURE__ */createPlanckLength({
+  BigNumber,
+  Unit,
+  config
+});
+export var variance = /* #__PURE__ */createVariance({
+  add,
+  apply,
+  divide,
+  isNaN,
+  multiply,
+  subtract,
+  typed
+});
+export var eigs = /* #__PURE__ */createEigs({
+  abs,
+  add,
+  addScalar,
+  atan,
+  bignumber,
+  column,
+  complex,
+  config,
+  cos,
+  diag,
+  divideScalar,
+  dot,
+  equal,
+  flatten,
+  im,
+  inv,
+  larger,
+  matrix,
+  matrixFromColumns,
+  multiply,
+  multiplyScalar,
+  number,
+  qr,
+  re,
+  sin,
+  smaller,
+  sqrt,
+  subtract,
+  typed,
+  usolve,
+  usolveAll
+});
+export var mad = /* #__PURE__ */createMad({
+  abs,
+  map,
+  median,
+  subtract,
+  typed
+});
+export var multinomial = /* #__PURE__ */createMultinomial({
+  add,
+  divide,
+  factorial,
+  isInteger,
+  isPositive,
+  multiply,
+  typed
+});
+export var std = /* #__PURE__ */createStd({
+  sqrt,
+  typed,
+  variance
+});
+export var norm = /* #__PURE__ */createNorm({
+  abs,
+  add,
+  conj,
+  ctranspose,
+  eigs,
+  equalScalar,
+  larger,
+  matrix,
+  multiply,
+  pow,
+  smaller,
+  sqrt,
+  typed
+});
+export var rotationMatrix = /* #__PURE__ */createRotationMatrix({
+  BigNumber,
+  DenseMatrix,
+  SparseMatrix,
+  addScalar,
+  config,
+  cos,
+  matrix,
+  multiplyScalar,
+  norm,
+  sin,
+  typed,
+  unaryMinus
+});
+export var rotate = /* #__PURE__ */createRotate({
+  multiply,
+  rotationMatrix,
+  typed
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/pureFunctionsNumber.generated.js b/node_modules/mathjs/lib/esm/entry/pureFunctionsNumber.generated.js
new file mode 100644
index 0000000..fad39ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/pureFunctionsNumber.generated.js
@@ -0,0 +1,552 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createE, createFalse, createIndex, createInfinity, createLN10, createLOG10E, createMatrix, createNaN, createNull, createPhi, createRangeClass, createReplacer, createResultSet, createSQRT1_2, // eslint-disable-line camelcase
+createSubset, createTau, createTyped, createUnaryPlus, createVersion, createXor, createAbs, createAcos, createAcot, createAcsc, createAdd, createAnd, createAsec, createAsin, createAtan, createAtanh, createBitAnd, createBitOr, createBoolean, createCbrt, createCombinations, createCompare, createCompareText, createCos, createCot, createCsc, createCube, createDivide, createEqualScalar, createErf, createExp, createFilter, createFix, createForEach, createFormat, createGamma, createIsInteger, createIsNegative, createIsPositive, createIsZero, createLOG2E, createLargerEq, createLeftShift, createLog10, createLog2, createMap, createMean, createMod, createMultiply, createNot, createNumber, createOr, createPi, createPow, createRandom, createRightLogShift, createSQRT2, createSech, createSin, createSize, createSmallerEq, createSquare, createString, createSubtract, createTanh, createTypeOf, createUnequal, createXgcd, createAcoth, createAddScalar, createAsech, createBitNot, createCeil, createCombinationsWithRep, createCosh, createCsch, createDivideScalar, createEqualText, createExpm1, createIsNumeric, createLN2, createLcm, createLog1p, createMultiplyScalar, createNthRoot, createPickRandom, createRandomInt, createRightArithShift, createSec, createSinh, createSqrt, createTan, createUnaryMinus, createAcosh, createApply, createAsinh, createBitXor, createClone, createCumSum, createEqual, createFactorial, createHasNumericValue, createIsNaN, createLarger, createMode, createNorm, createPartitionSelect, createPrint, createQuantileSeq, createRound, createSmaller, createStirlingS2, createTrue, createVariance, createAcsch, createAtan2, createCatalan, createComposition, createDeepEqual, createFloor, createHypot, createLog, createMedian, createMultinomial, createPermutations, createRange, createSign, createStd, createCompareNatural, createCoth, createGcd, createIsPrime, createNumeric, createProd, createSum, createBellNumbers, createMad, createMax, createMin } from '../factoriesNumber.js';
+export var e = /* #__PURE__ */createE({
+  config
+});
+export var _false = /* #__PURE__ */createFalse({});
+export var index = /* #__PURE__ */createIndex({});
+export var _Infinity = /* #__PURE__ */createInfinity({
+  config
+});
+export var LN10 = /* #__PURE__ */createLN10({
+  config
+});
+export var LOG10E = /* #__PURE__ */createLOG10E({
+  config
+});
+export var matrix = /* #__PURE__ */createMatrix({});
+export var _NaN = /* #__PURE__ */createNaN({
+  config
+});
+export var _null = /* #__PURE__ */createNull({});
+export var phi = /* #__PURE__ */createPhi({
+  config
+});
+export var Range = /* #__PURE__ */createRangeClass({});
+export var replacer = /* #__PURE__ */createReplacer({});
+export var ResultSet = /* #__PURE__ */createResultSet({});
+export var SQRT1_2 = /* #__PURE__ */createSQRT1_2({
+  config
+});
+export var subset = /* #__PURE__ */createSubset({});
+export var tau = /* #__PURE__ */createTau({
+  config
+});
+export var typed = /* #__PURE__ */createTyped({});
+export var unaryPlus = /* #__PURE__ */createUnaryPlus({
+  typed
+});
+export var version = /* #__PURE__ */createVersion({});
+export var xor = /* #__PURE__ */createXor({
+  typed
+});
+export var abs = /* #__PURE__ */createAbs({
+  typed
+});
+export var acos = /* #__PURE__ */createAcos({
+  typed
+});
+export var acot = /* #__PURE__ */createAcot({
+  typed
+});
+export var acsc = /* #__PURE__ */createAcsc({
+  typed
+});
+export var add = /* #__PURE__ */createAdd({
+  typed
+});
+export var and = /* #__PURE__ */createAnd({
+  typed
+});
+export var asec = /* #__PURE__ */createAsec({
+  typed
+});
+export var asin = /* #__PURE__ */createAsin({
+  typed
+});
+export var atan = /* #__PURE__ */createAtan({
+  typed
+});
+export var atanh = /* #__PURE__ */createAtanh({
+  typed
+});
+export var bitAnd = /* #__PURE__ */createBitAnd({
+  typed
+});
+export var bitOr = /* #__PURE__ */createBitOr({
+  typed
+});
+export var boolean = /* #__PURE__ */createBoolean({
+  typed
+});
+export var cbrt = /* #__PURE__ */createCbrt({
+  typed
+});
+export var combinations = /* #__PURE__ */createCombinations({
+  typed
+});
+export var compare = /* #__PURE__ */createCompare({
+  config,
+  typed
+});
+export var compareText = /* #__PURE__ */createCompareText({
+  typed
+});
+export var cos = /* #__PURE__ */createCos({
+  typed
+});
+export var cot = /* #__PURE__ */createCot({
+  typed
+});
+export var csc = /* #__PURE__ */createCsc({
+  typed
+});
+export var cube = /* #__PURE__ */createCube({
+  typed
+});
+export var divide = /* #__PURE__ */createDivide({
+  typed
+});
+export var equalScalar = /* #__PURE__ */createEqualScalar({
+  config,
+  typed
+});
+export var erf = /* #__PURE__ */createErf({
+  typed
+});
+export var exp = /* #__PURE__ */createExp({
+  typed
+});
+export var filter = /* #__PURE__ */createFilter({
+  typed
+});
+export var fix = /* #__PURE__ */createFix({
+  typed
+});
+export var forEach = /* #__PURE__ */createForEach({
+  typed
+});
+export var format = /* #__PURE__ */createFormat({
+  typed
+});
+export var gamma = /* #__PURE__ */createGamma({
+  typed
+});
+export var isInteger = /* #__PURE__ */createIsInteger({
+  typed
+});
+export var isNegative = /* #__PURE__ */createIsNegative({
+  typed
+});
+export var isPositive = /* #__PURE__ */createIsPositive({
+  typed
+});
+export var isZero = /* #__PURE__ */createIsZero({
+  typed
+});
+export var LOG2E = /* #__PURE__ */createLOG2E({
+  config
+});
+export var largerEq = /* #__PURE__ */createLargerEq({
+  config,
+  typed
+});
+export var leftShift = /* #__PURE__ */createLeftShift({
+  typed
+});
+export var log10 = /* #__PURE__ */createLog10({
+  typed
+});
+export var log2 = /* #__PURE__ */createLog2({
+  typed
+});
+export var map = /* #__PURE__ */createMap({
+  typed
+});
+export var mean = /* #__PURE__ */createMean({
+  add,
+  divide,
+  typed
+});
+export var mod = /* #__PURE__ */createMod({
+  typed
+});
+export var multiply = /* #__PURE__ */createMultiply({
+  typed
+});
+export var not = /* #__PURE__ */createNot({
+  typed
+});
+export var number = /* #__PURE__ */createNumber({
+  typed
+});
+export var or = /* #__PURE__ */createOr({
+  typed
+});
+export var pi = /* #__PURE__ */createPi({
+  config
+});
+export var pow = /* #__PURE__ */createPow({
+  typed
+});
+export var random = /* #__PURE__ */createRandom({
+  config,
+  typed
+});
+export var rightLogShift = /* #__PURE__ */createRightLogShift({
+  typed
+});
+export var SQRT2 = /* #__PURE__ */createSQRT2({
+  config
+});
+export var sech = /* #__PURE__ */createSech({
+  typed
+});
+export var sin = /* #__PURE__ */createSin({
+  typed
+});
+export var size = /* #__PURE__ */createSize({
+  matrix,
+  config,
+  typed
+});
+export var smallerEq = /* #__PURE__ */createSmallerEq({
+  config,
+  typed
+});
+export var square = /* #__PURE__ */createSquare({
+  typed
+});
+export var string = /* #__PURE__ */createString({
+  typed
+});
+export var subtract = /* #__PURE__ */createSubtract({
+  typed
+});
+export var tanh = /* #__PURE__ */createTanh({
+  typed
+});
+export var typeOf = /* #__PURE__ */createTypeOf({
+  typed
+});
+export var unequal = /* #__PURE__ */createUnequal({
+  equalScalar,
+  typed
+});
+export var xgcd = /* #__PURE__ */createXgcd({
+  typed
+});
+export var acoth = /* #__PURE__ */createAcoth({
+  typed
+});
+export var addScalar = /* #__PURE__ */createAddScalar({
+  typed
+});
+export var asech = /* #__PURE__ */createAsech({
+  typed
+});
+export var bitNot = /* #__PURE__ */createBitNot({
+  typed
+});
+export var ceil = /* #__PURE__ */createCeil({
+  typed
+});
+export var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({
+  typed
+});
+export var cosh = /* #__PURE__ */createCosh({
+  typed
+});
+export var csch = /* #__PURE__ */createCsch({
+  typed
+});
+export var divideScalar = /* #__PURE__ */createDivideScalar({
+  typed
+});
+export var equalText = /* #__PURE__ */createEqualText({
+  compareText,
+  isZero,
+  typed
+});
+export var expm1 = /* #__PURE__ */createExpm1({
+  typed
+});
+export var isNumeric = /* #__PURE__ */createIsNumeric({
+  typed
+});
+export var LN2 = /* #__PURE__ */createLN2({
+  config
+});
+export var lcm = /* #__PURE__ */createLcm({
+  typed
+});
+export var log1p = /* #__PURE__ */createLog1p({
+  typed
+});
+export var multiplyScalar = /* #__PURE__ */createMultiplyScalar({
+  typed
+});
+export var nthRoot = /* #__PURE__ */createNthRoot({
+  typed
+});
+export var pickRandom = /* #__PURE__ */createPickRandom({
+  config,
+  typed
+});
+export var randomInt = /* #__PURE__ */createRandomInt({
+  config,
+  typed
+});
+export var rightArithShift = /* #__PURE__ */createRightArithShift({
+  typed
+});
+export var sec = /* #__PURE__ */createSec({
+  typed
+});
+export var sinh = /* #__PURE__ */createSinh({
+  typed
+});
+export var sqrt = /* #__PURE__ */createSqrt({
+  typed
+});
+export var tan = /* #__PURE__ */createTan({
+  typed
+});
+export var unaryMinus = /* #__PURE__ */createUnaryMinus({
+  typed
+});
+export var acosh = /* #__PURE__ */createAcosh({
+  typed
+});
+export var apply = /* #__PURE__ */createApply({
+  isInteger,
+  typed
+});
+export var asinh = /* #__PURE__ */createAsinh({
+  typed
+});
+export var bitXor = /* #__PURE__ */createBitXor({
+  typed
+});
+export var clone = /* #__PURE__ */createClone({
+  typed
+});
+export var cumsum = /* #__PURE__ */createCumSum({
+  add,
+  typed,
+  unaryPlus
+});
+export var equal = /* #__PURE__ */createEqual({
+  equalScalar,
+  typed
+});
+export var factorial = /* #__PURE__ */createFactorial({
+  gamma,
+  typed
+});
+export var hasNumericValue = /* #__PURE__ */createHasNumericValue({
+  isNumeric,
+  typed
+});
+export var isNaN = /* #__PURE__ */createIsNaN({
+  typed
+});
+export var larger = /* #__PURE__ */createLarger({
+  config,
+  typed
+});
+export var mode = /* #__PURE__ */createMode({
+  isNaN,
+  isNumeric,
+  typed
+});
+export var norm = /* #__PURE__ */createNorm({
+  typed
+});
+export var partitionSelect = /* #__PURE__ */createPartitionSelect({
+  compare,
+  isNaN,
+  isNumeric,
+  typed
+});
+export var print = /* #__PURE__ */createPrint({
+  typed
+});
+export var quantileSeq = /* #__PURE__ */createQuantileSeq({
+  add,
+  compare,
+  multiply,
+  partitionSelect,
+  typed
+});
+export var round = /* #__PURE__ */createRound({
+  typed
+});
+export var smaller = /* #__PURE__ */createSmaller({
+  config,
+  typed
+});
+export var stirlingS2 = /* #__PURE__ */createStirlingS2({
+  addScalar,
+  combinations,
+  divideScalar,
+  factorial,
+  isInteger,
+  isNegative,
+  larger,
+  multiplyScalar,
+  number,
+  pow,
+  subtract,
+  typed
+});
+export var _true = /* #__PURE__ */createTrue({});
+export var variance = /* #__PURE__ */createVariance({
+  add,
+  apply,
+  divide,
+  isNaN,
+  multiply,
+  subtract,
+  typed
+});
+export var acsch = /* #__PURE__ */createAcsch({
+  typed
+});
+export var atan2 = /* #__PURE__ */createAtan2({
+  typed
+});
+export var catalan = /* #__PURE__ */createCatalan({
+  addScalar,
+  combinations,
+  divideScalar,
+  isInteger,
+  isNegative,
+  multiplyScalar,
+  typed
+});
+export var composition = /* #__PURE__ */createComposition({
+  addScalar,
+  combinations,
+  isInteger,
+  isNegative,
+  isPositive,
+  larger,
+  typed
+});
+export var deepEqual = /* #__PURE__ */createDeepEqual({
+  equal,
+  typed
+});
+export var floor = /* #__PURE__ */createFloor({
+  typed
+});
+export var hypot = /* #__PURE__ */createHypot({
+  abs,
+  addScalar,
+  divideScalar,
+  isPositive,
+  multiplyScalar,
+  smaller,
+  sqrt,
+  typed
+});
+export var log = /* #__PURE__ */createLog({
+  typed
+});
+export var median = /* #__PURE__ */createMedian({
+  add,
+  compare,
+  divide,
+  partitionSelect,
+  typed
+});
+export var multinomial = /* #__PURE__ */createMultinomial({
+  add,
+  divide,
+  factorial,
+  isInteger,
+  isPositive,
+  multiply,
+  typed
+});
+export var permutations = /* #__PURE__ */createPermutations({
+  factorial,
+  typed
+});
+export var range = /* #__PURE__ */createRange({
+  matrix,
+  config,
+  larger,
+  largerEq,
+  smaller,
+  smallerEq,
+  typed
+});
+export var sign = /* #__PURE__ */createSign({
+  typed
+});
+export var std = /* #__PURE__ */createStd({
+  sqrt,
+  typed,
+  variance
+});
+export var compareNatural = /* #__PURE__ */createCompareNatural({
+  compare,
+  typed
+});
+export var coth = /* #__PURE__ */createCoth({
+  typed
+});
+export var gcd = /* #__PURE__ */createGcd({
+  typed
+});
+export var isPrime = /* #__PURE__ */createIsPrime({
+  typed
+});
+export var numeric = /* #__PURE__ */createNumeric({
+  number
+});
+export var prod = /* #__PURE__ */createProd({
+  config,
+  multiplyScalar,
+  numeric,
+  typed
+});
+export var sum = /* #__PURE__ */createSum({
+  add,
+  config,
+  numeric,
+  typed
+});
+export var bellNumbers = /* #__PURE__ */createBellNumbers({
+  addScalar,
+  isInteger,
+  isNegative,
+  stirlingS2,
+  typed
+});
+export var mad = /* #__PURE__ */createMad({
+  abs,
+  map,
+  median,
+  subtract,
+  typed
+});
+export var max = /* #__PURE__ */createMax({
+  config,
+  larger,
+  numeric,
+  typed
+});
+export var min = /* #__PURE__ */createMin({
+  config,
+  numeric,
+  smaller,
+  typed
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/typeChecks.js b/node_modules/mathjs/lib/esm/entry/typeChecks.js
new file mode 100644
index 0000000..563f789
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/typeChecks.js
@@ -0,0 +1,2 @@
+// util functions
+export { 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, isString, isUndefined, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isResultSet, isSparseMatrix, isSymbolNode, isUnit } from '../utils/is.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/error/ArgumentsError.js b/node_modules/mathjs/lib/esm/error/ArgumentsError.js
new file mode 100644
index 0000000..2bf781d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/error/ArgumentsError.js
@@ -0,0 +1,25 @@
+/**
+ * Create a syntax error with the message:
+ *     'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'
+ * @param {string} fn     Function name
+ * @param {number} count  Actual argument count
+ * @param {number} min    Minimum required argument count
+ * @param {number} [max]  Maximum required argument count
+ * @extends Error
+ */
+export function ArgumentsError(fn, count, min, max) {
+  if (!(this instanceof ArgumentsError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+
+  this.fn = fn;
+  this.count = count;
+  this.min = min;
+  this.max = max;
+  this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';
+  this.stack = new Error().stack;
+}
+ArgumentsError.prototype = new Error();
+ArgumentsError.prototype.constructor = Error;
+ArgumentsError.prototype.name = 'ArgumentsError';
+ArgumentsError.prototype.isArgumentsError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/error/DimensionError.js b/node_modules/mathjs/lib/esm/error/DimensionError.js
new file mode 100644
index 0000000..060e351
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/error/DimensionError.js
@@ -0,0 +1,24 @@
+/**
+ * Create a range error with the message:
+ *     'Dimension mismatch (<actual size> != <expected size>)'
+ * @param {number | number[]} actual        The actual size
+ * @param {number | number[]} expected      The expected size
+ * @param {string} [relation='!=']          Optional relation between actual
+ *                                          and expected size: '!=', '<', etc.
+ * @extends RangeError
+ */
+export function DimensionError(actual, expected, relation) {
+  if (!(this instanceof DimensionError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+
+  this.actual = actual;
+  this.expected = expected;
+  this.relation = relation;
+  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';
+  this.stack = new Error().stack;
+}
+DimensionError.prototype = new RangeError();
+DimensionError.prototype.constructor = RangeError;
+DimensionError.prototype.name = 'DimensionError';
+DimensionError.prototype.isDimensionError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/error/IndexError.js b/node_modules/mathjs/lib/esm/error/IndexError.js
new file mode 100644
index 0000000..6f57f26
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/error/IndexError.js
@@ -0,0 +1,39 @@
+/**
+ * Create a range error with the message:
+ *     'Index out of range (index < min)'
+ *     'Index out of range (index < max)'
+ *
+ * @param {number} index     The actual index
+ * @param {number} [min=0]   Minimum index (included)
+ * @param {number} [max]     Maximum index (excluded)
+ * @extends RangeError
+ */
+export function IndexError(index, min, max) {
+  if (!(this instanceof IndexError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+
+  this.index = index;
+
+  if (arguments.length < 3) {
+    this.min = 0;
+    this.max = min;
+  } else {
+    this.min = min;
+    this.max = max;
+  }
+
+  if (this.min !== undefined && this.index < this.min) {
+    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';
+  } else if (this.max !== undefined && this.index >= this.max) {
+    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';
+  } else {
+    this.message = 'Index out of range (' + this.index + ')';
+  }
+
+  this.stack = new Error().stack;
+}
+IndexError.prototype = new RangeError();
+IndexError.prototype.constructor = RangeError;
+IndexError.prototype.name = 'IndexError';
+IndexError.prototype.isIndexError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/Help.js b/node_modules/mathjs/lib/esm/expression/Help.js
new file mode 100644
index 0000000..c3782f2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/Help.js
@@ -0,0 +1,133 @@
+import { isHelp } from '../utils/is.js';
+import { clone } from '../utils/object.js';
+import { format } from '../utils/string.js';
+import { factory } from '../utils/factory.js';
+var name = 'Help';
+var dependencies = ['parse'];
+export var createHelpClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    parse
+  } = _ref;
+
+  /**
+   * Documentation object
+   * @param {Object} doc  Object containing properties:
+   *                      {string} name
+   *                      {string} category
+   *                      {string} description
+   *                      {string[]} syntax
+   *                      {string[]} examples
+   *                      {string[]} seealso
+   * @constructor
+   */
+  function Help(doc) {
+    if (!(this instanceof Help)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!doc) throw new Error('Argument "doc" missing');
+    this.doc = doc;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Help.prototype.type = 'Help';
+  Help.prototype.isHelp = true;
+  /**
+   * Generate a string representation of the Help object
+   * @return {string} Returns a string
+   * @private
+   */
+
+  Help.prototype.toString = function () {
+    var doc = this.doc || {};
+    var desc = '\n';
+
+    if (doc.name) {
+      desc += 'Name: ' + doc.name + '\n\n';
+    }
+
+    if (doc.category) {
+      desc += 'Category: ' + doc.category + '\n\n';
+    }
+
+    if (doc.description) {
+      desc += 'Description:\n    ' + doc.description + '\n\n';
+    }
+
+    if (doc.syntax) {
+      desc += 'Syntax:\n    ' + doc.syntax.join('\n    ') + '\n\n';
+    }
+
+    if (doc.examples) {
+      desc += 'Examples:\n';
+      var scope = {};
+
+      for (var i = 0; i < doc.examples.length; i++) {
+        var expr = doc.examples[i];
+        desc += '    ' + expr + '\n';
+        var res = void 0;
+
+        try {
+          // note: res can be undefined when `expr` is an empty string
+          res = parse(expr).compile().evaluate(scope);
+        } catch (e) {
+          res = e;
+        }
+
+        if (res !== undefined && !isHelp(res)) {
+          desc += '        ' + format(res, {
+            precision: 14
+          }) + '\n';
+        }
+      }
+
+      desc += '\n';
+    }
+
+    if (doc.mayThrow && doc.mayThrow.length) {
+      desc += 'Throws: ' + doc.mayThrow.join(', ') + '\n\n';
+    }
+
+    if (doc.seealso && doc.seealso.length) {
+      desc += 'See also: ' + doc.seealso.join(', ') + '\n';
+    }
+
+    return desc;
+  };
+  /**
+   * Export the help object to JSON
+   */
+
+
+  Help.prototype.toJSON = function () {
+    var obj = clone(this.doc);
+    obj.mathjs = 'Help';
+    return obj;
+  };
+  /**
+   * Instantiate a Help object from a JSON object
+   * @param {Object} json
+   * @returns {Help} Returns a new Help object
+   */
+
+
+  Help.fromJSON = function (json) {
+    var doc = {};
+    Object.keys(json).filter(prop => prop !== 'mathjs').forEach(prop => {
+      doc[prop] = json[prop];
+    });
+    return new Help(doc);
+  };
+  /**
+   * Returns a string representation of the Help object
+   */
+
+
+  Help.prototype.valueOf = Help.prototype.toString;
+  return Help;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/Parser.js b/node_modules/mathjs/lib/esm/expression/Parser.js
new file mode 100644
index 0000000..26bb6d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/Parser.js
@@ -0,0 +1,151 @@
+import { factory } from '../utils/factory.js';
+import { createEmptyMap, toObject } from '../utils/map.js';
+var name = 'Parser';
+var dependencies = ['evaluate'];
+export var createParserClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    evaluate
+  } = _ref;
+
+  /**
+   * @constructor Parser
+   * Parser contains methods to evaluate or parse expressions, and has a number
+   * of convenience methods to get, set, and remove variables from memory. Parser
+   * keeps a scope containing variables in memory, which is used for all
+   * evaluations.
+   *
+   * Methods:
+   *    const result = parser.evaluate(expr)  // evaluate an expression
+   *    const value = parser.get(name)        // retrieve a variable from the parser
+   *    const values = parser.getAll()        // retrieve all defined variables
+   *    parser.set(name, value)               // set a variable in the parser
+   *    parser.remove(name)                   // clear a variable from the
+   *                                          // parsers scope
+   *    parser.clear()                        // clear the parsers scope
+   *
+   * Example usage:
+   *    const parser = new Parser()
+   *    // Note: there is a convenience method which can be used instead:
+   *    // const parser = new math.parser()
+   *
+   *    // evaluate expressions
+   *    parser.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *    parser.evaluate('sqrt(-4)')               // 2i
+   *    parser.evaluate('2 inch in cm')           // 5.08 cm
+   *    parser.evaluate('cos(45 deg)')            // 0.7071067811865476
+   *
+   *    // define variables and functions
+   *    parser.evaluate('x = 7 / 2')              // 3.5
+   *    parser.evaluate('x + 3')                  // 6.5
+   *    parser.evaluate('f(x, y) = x^y')          // f(x, y)
+   *    parser.evaluate('f(2, 3)')                // 8
+   *
+   *    // get and set variables and functions
+   *    const x = parser.get('x')                 // 7
+   *    const f = parser.get('f')                 // function
+   *    const g = f(3, 2)                         // 9
+   *    parser.set('h', 500)
+   *    const i = parser.evaluate('h / 2')        // 250
+   *    parser.set('hello', function (name) {
+   *        return 'hello, ' + name + '!'
+   *    })
+   *    parser.evaluate('hello("user")')          // "hello, user!"
+   *
+   *    // clear defined functions and variables
+   *    parser.clear()
+   *
+   */
+  function Parser() {
+    if (!(this instanceof Parser)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    Object.defineProperty(this, 'scope', {
+      value: createEmptyMap(),
+      writable: false
+    });
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Parser.prototype.type = 'Parser';
+  Parser.prototype.isParser = true;
+  /**
+   * Parse and evaluate the given expression
+   * @param {string | string[]} expr   A string containing an expression,
+   *                                   for example "2+3", or a list with expressions
+   * @return {*} result     The result, or undefined when the expression was empty
+   * @throws {Error}
+   */
+
+  Parser.prototype.evaluate = function (expr) {
+    // TODO: validate arguments
+    return evaluate(expr, this.scope);
+  };
+  /**
+   * Get a variable (a function or variable) by name from the parsers scope.
+   * Returns undefined when not found
+   * @param {string} name
+   * @return {* | undefined} value
+   */
+
+
+  Parser.prototype.get = function (name) {
+    // TODO: validate arguments
+    if (this.scope.has(name)) {
+      return this.scope.get(name);
+    }
+  };
+  /**
+   * Get a map with all defined variables
+   * @return {Object} values
+   */
+
+
+  Parser.prototype.getAll = function () {
+    return toObject(this.scope);
+  };
+  /**
+   * Get a map with all defined variables
+   * @return {Map} values
+   */
+
+
+  Parser.prototype.getAllAsMap = function () {
+    return this.scope;
+  };
+  /**
+   * Set a symbol (a function or variable) by name from the parsers scope.
+   * @param {string} name
+   * @param {* | undefined} value
+   */
+
+
+  Parser.prototype.set = function (name, value) {
+    this.scope.set(name, value);
+    return value;
+  };
+  /**
+   * Remove a variable from the parsers scope
+   * @param {string} name
+   */
+
+
+  Parser.prototype.remove = function (name) {
+    this.scope.delete(name);
+  };
+  /**
+   * Clear the scope with variables and functions
+   */
+
+
+  Parser.prototype.clear = function () {
+    this.scope.clear();
+  };
+
+  return Parser;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js
new file mode 100644
index 0000000..665c06c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js
@@ -0,0 +1,8 @@
+export var InfinityDocs = {
+  name: 'Infinity',
+  category: 'Constants',
+  syntax: ['Infinity'],
+  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',
+  examples: ['Infinity', '1 / 0'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js
new file mode 100644
index 0000000..14cee58
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js
@@ -0,0 +1,8 @@
+export var LN10Docs = {
+  name: 'LN10',
+  category: 'Constants',
+  syntax: ['LN10'],
+  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',
+  examples: ['LN10', 'log(10)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js
new file mode 100644
index 0000000..4cdd420
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js
@@ -0,0 +1,8 @@
+export var LN2Docs = {
+  name: 'LN2',
+  category: 'Constants',
+  syntax: ['LN2'],
+  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',
+  examples: ['LN2', 'log(2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js
new file mode 100644
index 0000000..2bc29fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js
@@ -0,0 +1,8 @@
+export var LOG10EDocs = {
+  name: 'LOG10E',
+  category: 'Constants',
+  syntax: ['LOG10E'],
+  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',
+  examples: ['LOG10E', 'log(e, 10)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js
new file mode 100644
index 0000000..91352dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js
@@ -0,0 +1,8 @@
+export var LOG2EDocs = {
+  name: 'LOG2E',
+  category: 'Constants',
+  syntax: ['LOG2E'],
+  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',
+  examples: ['LOG2E', 'log(e, 2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js
new file mode 100644
index 0000000..f44bd42
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js
@@ -0,0 +1,8 @@
+export var NaNDocs = {
+  name: 'NaN',
+  category: 'Constants',
+  syntax: ['NaN'],
+  description: 'Not a number',
+  examples: ['NaN', '0 / 0'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js
new file mode 100644
index 0000000..c08a377
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js
@@ -0,0 +1,8 @@
+export var SQRT12Docs = {
+  name: 'SQRT1_2',
+  category: 'Constants',
+  syntax: ['SQRT1_2'],
+  description: 'Returns the square root of 1/2, approximately equal to 0.707',
+  examples: ['SQRT1_2', 'sqrt(1/2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js
new file mode 100644
index 0000000..638c4b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js
@@ -0,0 +1,8 @@
+export var SQRT2Docs = {
+  name: 'SQRT2',
+  category: 'Constants',
+  syntax: ['SQRT2'],
+  description: 'Returns the square root of 2, approximately equal to 1.414',
+  examples: ['SQRT2', 'sqrt(2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js
new file mode 100644
index 0000000..e82480a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js
@@ -0,0 +1,8 @@
+export var eDocs = {
+  name: 'e',
+  category: 'Constants',
+  syntax: ['e'],
+  description: 'Euler\'s number, the base of the natural logarithm. Approximately equal to 2.71828',
+  examples: ['e', 'e ^ 2', 'exp(2)', 'log(e)'],
+  seealso: ['exp']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js
new file mode 100644
index 0000000..78c1791
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js
@@ -0,0 +1,8 @@
+export var falseDocs = {
+  name: 'false',
+  category: 'Constants',
+  syntax: ['false'],
+  description: 'Boolean value false',
+  examples: ['false'],
+  seealso: ['true']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js
new file mode 100644
index 0000000..69d62ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js
@@ -0,0 +1,8 @@
+export var iDocs = {
+  name: 'i',
+  category: 'Constants',
+  syntax: ['i'],
+  description: 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',
+  examples: ['i', 'i * i', 'sqrt(-1)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js
new file mode 100644
index 0000000..1d6a721
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js
@@ -0,0 +1,8 @@
+export var nullDocs = {
+  name: 'null',
+  category: 'Constants',
+  syntax: ['null'],
+  description: 'Value null',
+  examples: ['null'],
+  seealso: ['true', 'false']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js
new file mode 100644
index 0000000..bb48c9a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js
@@ -0,0 +1,8 @@
+export var phiDocs = {
+  name: 'phi',
+  category: 'Constants',
+  syntax: ['phi'],
+  description: 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',
+  examples: ['phi'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js
new file mode 100644
index 0000000..c34ae2e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js
@@ -0,0 +1,8 @@
+export var piDocs = {
+  name: 'pi',
+  category: 'Constants',
+  syntax: ['pi'],
+  description: 'The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter, and is approximately equal to 3.14159',
+  examples: ['pi', 'sin(pi/2)'],
+  seealso: ['tau']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js
new file mode 100644
index 0000000..0256449
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js
@@ -0,0 +1,8 @@
+export var tauDocs = {
+  name: 'tau',
+  category: 'Constants',
+  syntax: ['tau'],
+  description: 'Tau is the ratio constant of a circle\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',
+  examples: ['tau', '2 * pi'],
+  seealso: ['pi']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js
new file mode 100644
index 0000000..52c8f1f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js
@@ -0,0 +1,8 @@
+export var trueDocs = {
+  name: 'true',
+  category: 'Constants',
+  syntax: ['true'],
+  description: 'Boolean value true',
+  examples: ['true'],
+  seealso: ['false']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js
new file mode 100644
index 0000000..c58c20a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js
@@ -0,0 +1,8 @@
+export var versionDocs = {
+  name: 'version',
+  category: 'Constants',
+  syntax: ['version'],
+  description: 'A string with the version number of math.js',
+  examples: ['version'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js
new file mode 100644
index 0000000..0c61fb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js
@@ -0,0 +1,8 @@
+export var bignumberDocs = {
+  name: 'bignumber',
+  category: 'Construction',
+  syntax: ['bignumber(x)'],
+  description: 'Create a big number from a number or string.',
+  examples: ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber("7.2")', 'bignumber("7.2e500")', 'bignumber([0.1, 0.2, 0.3])'],
+  seealso: ['boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js
new file mode 100644
index 0000000..38f2053
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js
@@ -0,0 +1,8 @@
+export var booleanDocs = {
+  name: 'boolean',
+  category: 'Construction',
+  syntax: ['x', 'boolean(x)'],
+  description: 'Convert a string or number into a boolean.',
+  examples: ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean("true")', 'boolean("false")', 'boolean([1, 0, 1, 1])'],
+  seealso: ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js
new file mode 100644
index 0000000..abbc0f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js
@@ -0,0 +1,8 @@
+export var complexDocs = {
+  name: 'complex',
+  category: 'Construction',
+  syntax: ['complex()', 'complex(re, im)', 'complex(string)'],
+  description: 'Create a complex number.',
+  examples: ['complex()', 'complex(2, 3)', 'complex("7 - 2i")'],
+  seealso: ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js
new file mode 100644
index 0000000..444836d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js
@@ -0,0 +1,8 @@
+export var createUnitDocs = {
+  name: 'createUnit',
+  category: 'Construction',
+  syntax: ['createUnit(definitions)', 'createUnit(name, definition)'],
+  description: 'Create a user-defined unit and register it with the Unit type.',
+  examples: ['createUnit("foo")', 'createUnit("knot", {definition: "0.514444444 m/s", aliases: ["knots", "kt", "kts"]})', 'createUnit("mph", "1 mile/hour")'],
+  seealso: ['unit', 'splitUnit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js
new file mode 100644
index 0000000..922eb1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js
@@ -0,0 +1,8 @@
+export var fractionDocs = {
+  name: 'fraction',
+  category: 'Construction',
+  syntax: ['fraction(num)', 'fraction(matrix)', 'fraction(num,den)', 'fraction({n: num, d: den})'],
+  description: 'Create a fraction from a number or from integer numerator and denominator.',
+  examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)', 'fraction({n: 333, d: 53})', 'fraction([sqrt(9), sqrt(10), sqrt(11)])'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js
new file mode 100644
index 0000000..88acf22
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js
@@ -0,0 +1,8 @@
+export var indexDocs = {
+  name: 'index',
+  category: 'Construction',
+  syntax: ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],
+  description: 'Create an index to get or replace a subset of a matrix',
+  examples: ['[]', '[1, 2, 3]', 'A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[0:2, 0:2] = ones(2, 2)'],
+  seealso: ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js
new file mode 100644
index 0000000..bb51892
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js
@@ -0,0 +1,8 @@
+export var matrixDocs = {
+  name: 'matrix',
+  category: 'Construction',
+  syntax: ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix("dense")', 'matrix([...])'],
+  description: 'Create a matrix.',
+  examples: ['[]', '[1, 2, 3]', '[1, 2, 3; 4, 5, 6]', 'matrix()', 'matrix([3, 4])', 'matrix([3, 4; 5, 6], "sparse")', 'matrix([3, 4; 5, 6], "sparse", "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js
new file mode 100644
index 0000000..bc5479f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js
@@ -0,0 +1,8 @@
+export var numberDocs = {
+  name: 'number',
+  category: 'Construction',
+  syntax: ['x', 'number(x)', 'number(unit, valuelessUnit)'],
+  description: 'Create a number or convert a string or boolean into a number.',
+  examples: ['2', '2e3', '4.05', 'number(2)', 'number("7.2")', 'number(true)', 'number([true, false, true, true])', 'number(unit("52cm"), "m")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js
new file mode 100644
index 0000000..b6a776c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js
@@ -0,0 +1,8 @@
+export var sparseDocs = {
+  name: 'sparse',
+  category: 'Construction',
+  syntax: ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], "number")'],
+  description: 'Create a sparse matrix.',
+  examples: ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js
new file mode 100644
index 0000000..2b1354b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js
@@ -0,0 +1,8 @@
+export var splitUnitDocs = {
+  name: 'splitUnit',
+  category: 'Construction',
+  syntax: ['splitUnit(unit: Unit, parts: Unit[])'],
+  description: 'Split a unit in an array of units whose sum is equal to the original unit.',
+  examples: ['splitUnit(1 m, ["feet", "inch"])'],
+  seealso: ['unit', 'createUnit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js
new file mode 100644
index 0000000..deb8406
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js
@@ -0,0 +1,8 @@
+export var stringDocs = {
+  name: 'string',
+  category: 'Construction',
+  syntax: ['"text"', 'string(x)'],
+  description: 'Create a string or convert a value to a string',
+  examples: ['"Hello World!"', 'string(4.2)', 'string(3 + 2i)'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js
new file mode 100644
index 0000000..197f655
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js
@@ -0,0 +1,8 @@
+export var unitDocs = {
+  name: 'unit',
+  category: 'Construction',
+  syntax: ['value unit', 'unit(value, unit)', 'unit(string)'],
+  description: 'Create a unit.',
+  examples: ['5.5 mm', '3 inch', 'unit(7.1, "kilogram")', 'unit("23 deg")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js
new file mode 100644
index 0000000..3864bfd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js
@@ -0,0 +1,8 @@
+export var configDocs = {
+  name: 'config',
+  category: 'Core',
+  syntax: ['config()', 'config(options)'],
+  description: 'Get configuration or change configuration.',
+  examples: ['config()', '1/3 + 1/4', 'config({number: "Fraction"})', '1/3 + 1/4'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js
new file mode 100644
index 0000000..35df7c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js
@@ -0,0 +1,8 @@
+export var importDocs = {
+  name: 'import',
+  category: 'Core',
+  syntax: ['import(functions)', 'import(functions, options)'],
+  description: 'Import functions or constants from an object.',
+  examples: ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js
new file mode 100644
index 0000000..cb60168
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js
@@ -0,0 +1,8 @@
+export var typedDocs = {
+  name: 'typed',
+  category: 'Core',
+  syntax: ['typed(signatures)', 'typed(name, signatures)'],
+  description: 'Create a typed function.',
+  examples: ['double = typed({ "number": f(x)=x+x })', 'double(2)', 'double("hello")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js
new file mode 100644
index 0000000..712d80a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js
@@ -0,0 +1,687 @@
+import { eDocs } from './constants/e.js';
+import { falseDocs } from './constants/false.js';
+import { iDocs } from './constants/i.js';
+import { InfinityDocs } from './constants/Infinity.js';
+import { LN10Docs } from './constants/LN10.js';
+import { LN2Docs } from './constants/LN2.js';
+import { LOG10EDocs } from './constants/LOG10E.js';
+import { LOG2EDocs } from './constants/LOG2E.js';
+import { NaNDocs } from './constants/NaN.js';
+import { nullDocs } from './constants/null.js';
+import { phiDocs } from './constants/phi.js';
+import { piDocs } from './constants/pi.js';
+import { SQRT12Docs } from './constants/SQRT1_2.js';
+import { SQRT2Docs } from './constants/SQRT2.js';
+import { tauDocs } from './constants/tau.js';
+import { trueDocs } from './constants/true.js';
+import { versionDocs } from './constants/version.js';
+import { bignumberDocs } from './construction/bignumber.js';
+import { booleanDocs } from './construction/boolean.js';
+import { complexDocs } from './construction/complex.js';
+import { createUnitDocs } from './construction/createUnit.js';
+import { fractionDocs } from './construction/fraction.js';
+import { indexDocs } from './construction/index.js';
+import { matrixDocs } from './construction/matrix.js';
+import { numberDocs } from './construction/number.js';
+import { sparseDocs } from './construction/sparse.js';
+import { splitUnitDocs } from './construction/splitUnit.js';
+import { stringDocs } from './construction/string.js';
+import { unitDocs } from './construction/unit.js';
+import { configDocs } from './core/config.js';
+import { importDocs } from './core/import.js';
+import { typedDocs } from './core/typed.js';
+import { derivativeDocs } from './function/algebra/derivative.js';
+import { leafCountDocs } from './function/algebra/leafCount.js';
+import { lsolveDocs } from './function/algebra/lsolve.js';
+import { lsolveAllDocs } from './function/algebra/lsolveAll.js';
+import { lupDocs } from './function/algebra/lup.js';
+import { lusolveDocs } from './function/algebra/lusolve.js';
+import { qrDocs } from './function/algebra/qr.js';
+import { rationalizeDocs } from './function/algebra/rationalize.js';
+import { resolveDocs } from './function/algebra/resolve.js';
+import { simplifyDocs } from './function/algebra/simplify.js';
+import { simplifyCoreDocs } from './function/algebra/simplifyCore.js';
+import { sluDocs } from './function/algebra/slu.js';
+import { symbolicEqualDocs } from './function/algebra/symbolicEqual.js';
+import { usolveDocs } from './function/algebra/usolve.js';
+import { usolveAllDocs } from './function/algebra/usolveAll.js';
+import { absDocs } from './function/arithmetic/abs.js';
+import { addDocs } from './function/arithmetic/add.js';
+import { cbrtDocs } from './function/arithmetic/cbrt.js';
+import { ceilDocs } from './function/arithmetic/ceil.js';
+import { cubeDocs } from './function/arithmetic/cube.js';
+import { divideDocs } from './function/arithmetic/divide.js';
+import { dotDivideDocs } from './function/arithmetic/dotDivide.js';
+import { dotMultiplyDocs } from './function/arithmetic/dotMultiply.js';
+import { dotPowDocs } from './function/arithmetic/dotPow.js';
+import { expDocs } from './function/arithmetic/exp.js';
+import { expmDocs } from './function/arithmetic/expm.js';
+import { expm1Docs } from './function/arithmetic/expm1.js';
+import { fixDocs } from './function/arithmetic/fix.js';
+import { floorDocs } from './function/arithmetic/floor.js';
+import { gcdDocs } from './function/arithmetic/gcd.js';
+import { hypotDocs } from './function/arithmetic/hypot.js';
+import { invmodDocs } from './function/arithmetic/invmod.js';
+import { lcmDocs } from './function/arithmetic/lcm.js';
+import { logDocs } from './function/arithmetic/log.js';
+import { log10Docs } from './function/arithmetic/log10.js';
+import { log1pDocs } from './function/arithmetic/log1p.js';
+import { log2Docs } from './function/arithmetic/log2.js';
+import { modDocs } from './function/arithmetic/mod.js';
+import { multiplyDocs } from './function/arithmetic/multiply.js';
+import { normDocs } from './function/arithmetic/norm.js';
+import { nthRootDocs } from './function/arithmetic/nthRoot.js';
+import { nthRootsDocs } from './function/arithmetic/nthRoots.js';
+import { powDocs } from './function/arithmetic/pow.js';
+import { roundDocs } from './function/arithmetic/round.js';
+import { signDocs } from './function/arithmetic/sign.js';
+import { sqrtDocs } from './function/arithmetic/sqrt.js';
+import { sqrtmDocs } from './function/arithmetic/sqrtm.js';
+import { squareDocs } from './function/arithmetic/square.js';
+import { subtractDocs } from './function/arithmetic/subtract.js';
+import { unaryMinusDocs } from './function/arithmetic/unaryMinus.js';
+import { unaryPlusDocs } from './function/arithmetic/unaryPlus.js';
+import { xgcdDocs } from './function/arithmetic/xgcd.js';
+import { bitAndDocs } from './function/bitwise/bitAnd.js';
+import { bitNotDocs } from './function/bitwise/bitNot.js';
+import { bitOrDocs } from './function/bitwise/bitOr.js';
+import { bitXorDocs } from './function/bitwise/bitXor.js';
+import { leftShiftDocs } from './function/bitwise/leftShift.js';
+import { rightArithShiftDocs } from './function/bitwise/rightArithShift.js';
+import { rightLogShiftDocs } from './function/bitwise/rightLogShift.js';
+import { bellNumbersDocs } from './function/combinatorics/bellNumbers.js';
+import { catalanDocs } from './function/combinatorics/catalan.js';
+import { compositionDocs } from './function/combinatorics/composition.js';
+import { stirlingS2Docs } from './function/combinatorics/stirlingS2.js';
+import { argDocs } from './function/complex/arg.js';
+import { conjDocs } from './function/complex/conj.js';
+import { imDocs } from './function/complex/im.js';
+import { reDocs } from './function/complex/re.js';
+import { evaluateDocs } from './function/expression/evaluate.js';
+import { helpDocs } from './function/expression/help.js';
+import { distanceDocs } from './function/geometry/distance.js';
+import { intersectDocs } from './function/geometry/intersect.js';
+import { andDocs } from './function/logical/and.js';
+import { notDocs } from './function/logical/not.js';
+import { orDocs } from './function/logical/or.js';
+import { xorDocs } from './function/logical/xor.js';
+import { columnDocs } from './function/matrix/column.js';
+import { concatDocs } from './function/matrix/concat.js';
+import { countDocs } from './function/matrix/count.js';
+import { crossDocs } from './function/matrix/cross.js';
+import { ctransposeDocs } from './function/matrix/ctranspose.js';
+import { detDocs } from './function/matrix/det.js';
+import { diagDocs } from './function/matrix/diag.js';
+import { diffDocs } from './function/matrix/diff.js';
+import { dotDocs } from './function/matrix/dot.js';
+import { eigsDocs } from './function/matrix/eigs.js';
+import { filterDocs } from './function/matrix/filter.js';
+import { flattenDocs } from './function/matrix/flatten.js';
+import { forEachDocs } from './function/matrix/forEach.js';
+import { getMatrixDataTypeDocs } from './function/matrix/getMatrixDataType.js';
+import { identityDocs } from './function/matrix/identity.js';
+import { invDocs } from './function/matrix/inv.js';
+import { kronDocs } from './function/matrix/kron.js';
+import { mapDocs } from './function/matrix/map.js';
+import { matrixFromColumnsDocs } from './function/matrix/matrixFromColumns.js';
+import { matrixFromFunctionDocs } from './function/matrix/matrixFromFunction.js';
+import { matrixFromRowsDocs } from './function/matrix/matrixFromRows.js';
+import { onesDocs } from './function/matrix/ones.js';
+import { partitionSelectDocs } from './function/matrix/partitionSelect.js';
+import { rangeDocs } from './function/matrix/range.js';
+import { reshapeDocs } from './function/matrix/reshape.js';
+import { resizeDocs } from './function/matrix/resize.js';
+import { rotateDocs } from './function/matrix/rotate.js';
+import { rotationMatrixDocs } from './function/matrix/rotationMatrix.js';
+import { rowDocs } from './function/matrix/row.js';
+import { sizeDocs } from './function/matrix/size.js';
+import { sortDocs } from './function/matrix/sort.js';
+import { squeezeDocs } from './function/matrix/squeeze.js';
+import { subsetDocs } from './function/matrix/subset.js';
+import { traceDocs } from './function/matrix/trace.js';
+import { transposeDocs } from './function/matrix/transpose.js';
+import { zerosDocs } from './function/matrix/zeros.js';
+import { combinationsDocs } from './function/probability/combinations.js';
+import { combinationsWithRepDocs } from './function/probability/combinationsWithRep.js';
+import { factorialDocs } from './function/probability/factorial.js';
+import { gammaDocs } from './function/probability/gamma.js';
+import { kldivergenceDocs } from './function/probability/kldivergence.js';
+import { multinomialDocs } from './function/probability/multinomial.js';
+import { permutationsDocs } from './function/probability/permutations.js';
+import { pickRandomDocs } from './function/probability/pickRandom.js';
+import { randomDocs } from './function/probability/random.js';
+import { randomIntDocs } from './function/probability/randomInt.js';
+import { compareDocs } from './function/relational/compare.js';
+import { compareNaturalDocs } from './function/relational/compareNatural.js';
+import { compareTextDocs } from './function/relational/compareText.js';
+import { deepEqualDocs } from './function/relational/deepEqual.js';
+import { equalDocs } from './function/relational/equal.js';
+import { equalTextDocs } from './function/relational/equalText.js';
+import { largerDocs } from './function/relational/larger.js';
+import { largerEqDocs } from './function/relational/largerEq.js';
+import { smallerDocs } from './function/relational/smaller.js';
+import { smallerEqDocs } from './function/relational/smallerEq.js';
+import { unequalDocs } from './function/relational/unequal.js';
+import { setCartesianDocs } from './function/set/setCartesian.js';
+import { setDifferenceDocs } from './function/set/setDifference.js';
+import { setDistinctDocs } from './function/set/setDistinct.js';
+import { setIntersectDocs } from './function/set/setIntersect.js';
+import { setIsSubsetDocs } from './function/set/setIsSubset.js';
+import { setMultiplicityDocs } from './function/set/setMultiplicity.js';
+import { setPowersetDocs } from './function/set/setPowerset.js';
+import { setSizeDocs } from './function/set/setSize.js';
+import { setSymDifferenceDocs } from './function/set/setSymDifference.js';
+import { setUnionDocs } from './function/set/setUnion.js';
+import { erfDocs } from './function/special/erf.js';
+import { madDocs } from './function/statistics/mad.js';
+import { maxDocs } from './function/statistics/max.js';
+import { meanDocs } from './function/statistics/mean.js';
+import { medianDocs } from './function/statistics/median.js';
+import { minDocs } from './function/statistics/min.js';
+import { modeDocs } from './function/statistics/mode.js';
+import { prodDocs } from './function/statistics/prod.js';
+import { quantileSeqDocs } from './function/statistics/quantileSeq.js';
+import { stdDocs } from './function/statistics/std.js';
+import { cumSumDocs } from './function/statistics/cumsum.js';
+import { sumDocs } from './function/statistics/sum.js';
+import { varianceDocs } from './function/statistics/variance.js';
+import { acosDocs } from './function/trigonometry/acos.js';
+import { acoshDocs } from './function/trigonometry/acosh.js';
+import { acotDocs } from './function/trigonometry/acot.js';
+import { acothDocs } from './function/trigonometry/acoth.js';
+import { acscDocs } from './function/trigonometry/acsc.js';
+import { acschDocs } from './function/trigonometry/acsch.js';
+import { asecDocs } from './function/trigonometry/asec.js';
+import { asechDocs } from './function/trigonometry/asech.js';
+import { asinDocs } from './function/trigonometry/asin.js';
+import { asinhDocs } from './function/trigonometry/asinh.js';
+import { atanDocs } from './function/trigonometry/atan.js';
+import { atan2Docs } from './function/trigonometry/atan2.js';
+import { atanhDocs } from './function/trigonometry/atanh.js';
+import { cosDocs } from './function/trigonometry/cos.js';
+import { coshDocs } from './function/trigonometry/cosh.js';
+import { cotDocs } from './function/trigonometry/cot.js';
+import { cothDocs } from './function/trigonometry/coth.js';
+import { cscDocs } from './function/trigonometry/csc.js';
+import { cschDocs } from './function/trigonometry/csch.js';
+import { secDocs } from './function/trigonometry/sec.js';
+import { sechDocs } from './function/trigonometry/sech.js';
+import { sinDocs } from './function/trigonometry/sin.js';
+import { sinhDocs } from './function/trigonometry/sinh.js';
+import { tanDocs } from './function/trigonometry/tan.js';
+import { tanhDocs } from './function/trigonometry/tanh.js';
+import { toDocs } from './function/units/to.js';
+import { binDocs } from './function/utils/bin.js';
+import { cloneDocs } from './function/utils/clone.js';
+import { formatDocs } from './function/utils/format.js';
+import { hasNumericValueDocs } from './function/utils/hasNumericValue.js';
+import { hexDocs } from './function/utils/hex.js';
+import { isIntegerDocs } from './function/utils/isInteger.js';
+import { isNaNDocs } from './function/utils/isNaN.js';
+import { isNegativeDocs } from './function/utils/isNegative.js';
+import { isNumericDocs } from './function/utils/isNumeric.js';
+import { isPositiveDocs } from './function/utils/isPositive.js';
+import { isPrimeDocs } from './function/utils/isPrime.js';
+import { isZeroDocs } from './function/utils/isZero.js';
+import { numericDocs } from './function/utils/numeric.js';
+import { octDocs } from './function/utils/oct.js';
+import { printDocs } from './function/utils/print.js';
+import { typeOfDocs } from './function/utils/typeOf.js';
+export var embeddedDocs = {
+  // construction functions
+  bignumber: bignumberDocs,
+  boolean: booleanDocs,
+  complex: complexDocs,
+  createUnit: createUnitDocs,
+  fraction: fractionDocs,
+  index: indexDocs,
+  matrix: matrixDocs,
+  number: numberDocs,
+  sparse: sparseDocs,
+  splitUnit: splitUnitDocs,
+  string: stringDocs,
+  unit: unitDocs,
+  // constants
+  e: eDocs,
+  E: eDocs,
+  false: falseDocs,
+  i: iDocs,
+  Infinity: InfinityDocs,
+  LN2: LN2Docs,
+  LN10: LN10Docs,
+  LOG2E: LOG2EDocs,
+  LOG10E: LOG10EDocs,
+  NaN: NaNDocs,
+  null: nullDocs,
+  pi: piDocs,
+  PI: piDocs,
+  phi: phiDocs,
+  SQRT1_2: SQRT12Docs,
+  SQRT2: SQRT2Docs,
+  tau: tauDocs,
+  true: trueDocs,
+  version: versionDocs,
+  // physical constants
+  // TODO: more detailed docs for physical constants
+  speedOfLight: {
+    description: 'Speed of light in vacuum',
+    examples: ['speedOfLight']
+  },
+  gravitationConstant: {
+    description: 'Newtonian constant of gravitation',
+    examples: ['gravitationConstant']
+  },
+  planckConstant: {
+    description: 'Planck constant',
+    examples: ['planckConstant']
+  },
+  reducedPlanckConstant: {
+    description: 'Reduced Planck constant',
+    examples: ['reducedPlanckConstant']
+  },
+  magneticConstant: {
+    description: 'Magnetic constant (vacuum permeability)',
+    examples: ['magneticConstant']
+  },
+  electricConstant: {
+    description: 'Electric constant (vacuum permeability)',
+    examples: ['electricConstant']
+  },
+  vacuumImpedance: {
+    description: 'Characteristic impedance of vacuum',
+    examples: ['vacuumImpedance']
+  },
+  coulomb: {
+    description: 'Coulomb\'s constant',
+    examples: ['coulomb']
+  },
+  elementaryCharge: {
+    description: 'Elementary charge',
+    examples: ['elementaryCharge']
+  },
+  bohrMagneton: {
+    description: 'Borh magneton',
+    examples: ['bohrMagneton']
+  },
+  conductanceQuantum: {
+    description: 'Conductance quantum',
+    examples: ['conductanceQuantum']
+  },
+  inverseConductanceQuantum: {
+    description: 'Inverse conductance quantum',
+    examples: ['inverseConductanceQuantum']
+  },
+  // josephson: {description: 'Josephson constant', examples: ['josephson']},
+  magneticFluxQuantum: {
+    description: 'Magnetic flux quantum',
+    examples: ['magneticFluxQuantum']
+  },
+  nuclearMagneton: {
+    description: 'Nuclear magneton',
+    examples: ['nuclearMagneton']
+  },
+  klitzing: {
+    description: 'Von Klitzing constant',
+    examples: ['klitzing']
+  },
+  bohrRadius: {
+    description: 'Borh radius',
+    examples: ['bohrRadius']
+  },
+  classicalElectronRadius: {
+    description: 'Classical electron radius',
+    examples: ['classicalElectronRadius']
+  },
+  electronMass: {
+    description: 'Electron mass',
+    examples: ['electronMass']
+  },
+  fermiCoupling: {
+    description: 'Fermi coupling constant',
+    examples: ['fermiCoupling']
+  },
+  fineStructure: {
+    description: 'Fine-structure constant',
+    examples: ['fineStructure']
+  },
+  hartreeEnergy: {
+    description: 'Hartree energy',
+    examples: ['hartreeEnergy']
+  },
+  protonMass: {
+    description: 'Proton mass',
+    examples: ['protonMass']
+  },
+  deuteronMass: {
+    description: 'Deuteron Mass',
+    examples: ['deuteronMass']
+  },
+  neutronMass: {
+    description: 'Neutron mass',
+    examples: ['neutronMass']
+  },
+  quantumOfCirculation: {
+    description: 'Quantum of circulation',
+    examples: ['quantumOfCirculation']
+  },
+  rydberg: {
+    description: 'Rydberg constant',
+    examples: ['rydberg']
+  },
+  thomsonCrossSection: {
+    description: 'Thomson cross section',
+    examples: ['thomsonCrossSection']
+  },
+  weakMixingAngle: {
+    description: 'Weak mixing angle',
+    examples: ['weakMixingAngle']
+  },
+  efimovFactor: {
+    description: 'Efimov factor',
+    examples: ['efimovFactor']
+  },
+  atomicMass: {
+    description: 'Atomic mass constant',
+    examples: ['atomicMass']
+  },
+  avogadro: {
+    description: 'Avogadro\'s number',
+    examples: ['avogadro']
+  },
+  boltzmann: {
+    description: 'Boltzmann constant',
+    examples: ['boltzmann']
+  },
+  faraday: {
+    description: 'Faraday constant',
+    examples: ['faraday']
+  },
+  firstRadiation: {
+    description: 'First radiation constant',
+    examples: ['firstRadiation']
+  },
+  loschmidt: {
+    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',
+    examples: ['loschmidt']
+  },
+  gasConstant: {
+    description: 'Gas constant',
+    examples: ['gasConstant']
+  },
+  molarPlanckConstant: {
+    description: 'Molar Planck constant',
+    examples: ['molarPlanckConstant']
+  },
+  molarVolume: {
+    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',
+    examples: ['molarVolume']
+  },
+  sackurTetrode: {
+    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',
+    examples: ['sackurTetrode']
+  },
+  secondRadiation: {
+    description: 'Second radiation constant',
+    examples: ['secondRadiation']
+  },
+  stefanBoltzmann: {
+    description: 'Stefan-Boltzmann constant',
+    examples: ['stefanBoltzmann']
+  },
+  wienDisplacement: {
+    description: 'Wien displacement law constant',
+    examples: ['wienDisplacement']
+  },
+  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},
+  molarMass: {
+    description: 'Molar mass constant',
+    examples: ['molarMass']
+  },
+  molarMassC12: {
+    description: 'Molar mass constant of carbon-12',
+    examples: ['molarMassC12']
+  },
+  gravity: {
+    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',
+    examples: ['gravity']
+  },
+  planckLength: {
+    description: 'Planck length',
+    examples: ['planckLength']
+  },
+  planckMass: {
+    description: 'Planck mass',
+    examples: ['planckMass']
+  },
+  planckTime: {
+    description: 'Planck time',
+    examples: ['planckTime']
+  },
+  planckCharge: {
+    description: 'Planck charge',
+    examples: ['planckCharge']
+  },
+  planckTemperature: {
+    description: 'Planck temperature',
+    examples: ['planckTemperature']
+  },
+  // functions - algebra
+  derivative: derivativeDocs,
+  lsolve: lsolveDocs,
+  lsolveAll: lsolveAllDocs,
+  lup: lupDocs,
+  lusolve: lusolveDocs,
+  leafCount: leafCountDocs,
+  resolve: resolveDocs,
+  simplify: simplifyDocs,
+  simplifyCore: simplifyCoreDocs,
+  symbolicEqual: symbolicEqualDocs,
+  rationalize: rationalizeDocs,
+  slu: sluDocs,
+  usolve: usolveDocs,
+  usolveAll: usolveAllDocs,
+  qr: qrDocs,
+  // functions - arithmetic
+  abs: absDocs,
+  add: addDocs,
+  cbrt: cbrtDocs,
+  ceil: ceilDocs,
+  cube: cubeDocs,
+  divide: divideDocs,
+  dotDivide: dotDivideDocs,
+  dotMultiply: dotMultiplyDocs,
+  dotPow: dotPowDocs,
+  exp: expDocs,
+  expm: expmDocs,
+  expm1: expm1Docs,
+  fix: fixDocs,
+  floor: floorDocs,
+  gcd: gcdDocs,
+  hypot: hypotDocs,
+  lcm: lcmDocs,
+  log: logDocs,
+  log2: log2Docs,
+  log1p: log1pDocs,
+  log10: log10Docs,
+  mod: modDocs,
+  multiply: multiplyDocs,
+  norm: normDocs,
+  nthRoot: nthRootDocs,
+  nthRoots: nthRootsDocs,
+  pow: powDocs,
+  round: roundDocs,
+  sign: signDocs,
+  sqrt: sqrtDocs,
+  sqrtm: sqrtmDocs,
+  square: squareDocs,
+  subtract: subtractDocs,
+  unaryMinus: unaryMinusDocs,
+  unaryPlus: unaryPlusDocs,
+  xgcd: xgcdDocs,
+  invmod: invmodDocs,
+  // functions - bitwise
+  bitAnd: bitAndDocs,
+  bitNot: bitNotDocs,
+  bitOr: bitOrDocs,
+  bitXor: bitXorDocs,
+  leftShift: leftShiftDocs,
+  rightArithShift: rightArithShiftDocs,
+  rightLogShift: rightLogShiftDocs,
+  // functions - combinatorics
+  bellNumbers: bellNumbersDocs,
+  catalan: catalanDocs,
+  composition: compositionDocs,
+  stirlingS2: stirlingS2Docs,
+  // functions - core
+  config: configDocs,
+  import: importDocs,
+  typed: typedDocs,
+  // functions - complex
+  arg: argDocs,
+  conj: conjDocs,
+  re: reDocs,
+  im: imDocs,
+  // functions - expression
+  evaluate: evaluateDocs,
+  help: helpDocs,
+  // functions - geometry
+  distance: distanceDocs,
+  intersect: intersectDocs,
+  // functions - logical
+  and: andDocs,
+  not: notDocs,
+  or: orDocs,
+  xor: xorDocs,
+  // functions - matrix
+  concat: concatDocs,
+  count: countDocs,
+  cross: crossDocs,
+  column: columnDocs,
+  ctranspose: ctransposeDocs,
+  det: detDocs,
+  diag: diagDocs,
+  diff: diffDocs,
+  dot: dotDocs,
+  getMatrixDataType: getMatrixDataTypeDocs,
+  identity: identityDocs,
+  filter: filterDocs,
+  flatten: flattenDocs,
+  forEach: forEachDocs,
+  inv: invDocs,
+  eigs: eigsDocs,
+  kron: kronDocs,
+  matrixFromFunction: matrixFromFunctionDocs,
+  matrixFromRows: matrixFromRowsDocs,
+  matrixFromColumns: matrixFromColumnsDocs,
+  map: mapDocs,
+  ones: onesDocs,
+  partitionSelect: partitionSelectDocs,
+  range: rangeDocs,
+  resize: resizeDocs,
+  reshape: reshapeDocs,
+  rotate: rotateDocs,
+  rotationMatrix: rotationMatrixDocs,
+  row: rowDocs,
+  size: sizeDocs,
+  sort: sortDocs,
+  squeeze: squeezeDocs,
+  subset: subsetDocs,
+  trace: traceDocs,
+  transpose: transposeDocs,
+  zeros: zerosDocs,
+  // functions - probability
+  combinations: combinationsDocs,
+  combinationsWithRep: combinationsWithRepDocs,
+  // distribution: distributionDocs,
+  factorial: factorialDocs,
+  gamma: gammaDocs,
+  kldivergence: kldivergenceDocs,
+  multinomial: multinomialDocs,
+  permutations: permutationsDocs,
+  pickRandom: pickRandomDocs,
+  random: randomDocs,
+  randomInt: randomIntDocs,
+  // functions - relational
+  compare: compareDocs,
+  compareNatural: compareNaturalDocs,
+  compareText: compareTextDocs,
+  deepEqual: deepEqualDocs,
+  equal: equalDocs,
+  equalText: equalTextDocs,
+  larger: largerDocs,
+  largerEq: largerEqDocs,
+  smaller: smallerDocs,
+  smallerEq: smallerEqDocs,
+  unequal: unequalDocs,
+  // functions - set
+  setCartesian: setCartesianDocs,
+  setDifference: setDifferenceDocs,
+  setDistinct: setDistinctDocs,
+  setIntersect: setIntersectDocs,
+  setIsSubset: setIsSubsetDocs,
+  setMultiplicity: setMultiplicityDocs,
+  setPowerset: setPowersetDocs,
+  setSize: setSizeDocs,
+  setSymDifference: setSymDifferenceDocs,
+  setUnion: setUnionDocs,
+  // functions - special
+  erf: erfDocs,
+  // functions - statistics
+  cumsum: cumSumDocs,
+  mad: madDocs,
+  max: maxDocs,
+  mean: meanDocs,
+  median: medianDocs,
+  min: minDocs,
+  mode: modeDocs,
+  prod: prodDocs,
+  quantileSeq: quantileSeqDocs,
+  std: stdDocs,
+  sum: sumDocs,
+  variance: varianceDocs,
+  // functions - trigonometry
+  acos: acosDocs,
+  acosh: acoshDocs,
+  acot: acotDocs,
+  acoth: acothDocs,
+  acsc: acscDocs,
+  acsch: acschDocs,
+  asec: asecDocs,
+  asech: asechDocs,
+  asin: asinDocs,
+  asinh: asinhDocs,
+  atan: atanDocs,
+  atanh: atanhDocs,
+  atan2: atan2Docs,
+  cos: cosDocs,
+  cosh: coshDocs,
+  cot: cotDocs,
+  coth: cothDocs,
+  csc: cscDocs,
+  csch: cschDocs,
+  sec: secDocs,
+  sech: sechDocs,
+  sin: sinDocs,
+  sinh: sinhDocs,
+  tan: tanDocs,
+  tanh: tanhDocs,
+  // functions - units
+  to: toDocs,
+  // functions - utils
+  clone: cloneDocs,
+  format: formatDocs,
+  bin: binDocs,
+  oct: octDocs,
+  hex: hexDocs,
+  isNaN: isNaNDocs,
+  isInteger: isIntegerDocs,
+  isNegative: isNegativeDocs,
+  isNumeric: isNumericDocs,
+  hasNumericValue: hasNumericValueDocs,
+  isPositive: isPositiveDocs,
+  isPrime: isPrimeDocs,
+  isZero: isZeroDocs,
+  print: printDocs,
+  typeOf: typeOfDocs,
+  numeric: numericDocs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js
new file mode 100644
index 0000000..755c5db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js
@@ -0,0 +1,8 @@
+export var derivativeDocs = {
+  name: 'derivative',
+  category: 'Algebra',
+  syntax: ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],
+  description: 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',
+  examples: ['derivative("2x^3", "x")', 'derivative("2x^3", "x", {simplify: false})', 'derivative("2x^2 + 3x + 4", "x")', 'derivative("sin(2x)", "x")', 'f = parse("x^2 + x")', 'x = parse("x")', 'df = derivative(f, x)', 'df.evaluate({x: 3})'],
+  seealso: ['simplify', 'parse', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/leafCount.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/leafCount.js
new file mode 100644
index 0000000..5b7acd8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/leafCount.js
@@ -0,0 +1,8 @@
+export var leafCountDocs = {
+  name: 'leafCount',
+  category: 'Algebra',
+  syntax: ['leafCount(expr)'],
+  description: 'Computes the number of leaves in the parse tree of the given expression',
+  examples: ['leafCount("e^(i*pi)-1")', 'leafCount(parse("{a: 22/7, b: 10^(1/2)}"))'],
+  seealso: ['simplify']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js
new file mode 100644
index 0000000..e45f544
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js
@@ -0,0 +1,8 @@
+export var lsolveDocs = {
+  name: 'lsolve',
+  category: 'Algebra',
+  syntax: ['x=lsolve(L, b)'],
+  description: 'Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js
new file mode 100644
index 0000000..2bdf1d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js
@@ -0,0 +1,8 @@
+export var lsolveAllDocs = {
+  name: 'lsolveAll',
+  category: 'Algebra',
+  syntax: ['x=lsolveAll(L, b)'],
+  description: 'Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js
new file mode 100644
index 0000000..4b3af50
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js
@@ -0,0 +1,8 @@
+export var lupDocs = {
+  name: 'lup',
+  category: 'Algebra',
+  syntax: ['lup(m)'],
+  description: 'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',
+  examples: ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js
new file mode 100644
index 0000000..25a4709
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js
@@ -0,0 +1,8 @@
+export var lusolveDocs = {
+  name: 'lusolve',
+  category: 'Algebra',
+  syntax: ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],
+  description: 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],
+  seealso: ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js
new file mode 100644
index 0000000..f6e2433
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js
@@ -0,0 +1,8 @@
+export var qrDocs = {
+  name: 'qr',
+  category: 'Algebra',
+  syntax: ['qr(A)'],
+  description: 'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',
+  examples: ['qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'],
+  seealso: ['lup', 'slu', 'matrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js
new file mode 100644
index 0000000..0e93662
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js
@@ -0,0 +1,8 @@
+export var rationalizeDocs = {
+  name: 'rationalize',
+  category: 'Algebra',
+  syntax: ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],
+  description: 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',
+  examples: ['rationalize("2x/y - y/(x+1)")', 'rationalize("2x/y - y/(x+1)", true)'],
+  seealso: ['simplify']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/resolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/resolve.js
new file mode 100644
index 0000000..05cf54d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/resolve.js
@@ -0,0 +1,9 @@
+export var resolveDocs = {
+  name: 'resolve',
+  category: 'Algebra',
+  syntax: ['resolve(node, scope)'],
+  description: 'Recursively substitute variables in an expression tree.',
+  examples: ['resolve(parse("1 + x"), { x: 7 })', 'resolve(parse("size(text)"), { text: "Hello World" })', 'resolve(parse("x + y"), { x: parse("3z") })', 'resolve(parse("3x"), { x: parse("y+z"), z: parse("w^y") })'],
+  seealso: ['simplify', 'evaluate'],
+  mayThrow: ['ReferenceError']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js
new file mode 100644
index 0000000..a777a97
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js
@@ -0,0 +1,8 @@
+export var simplifyDocs = {
+  name: 'simplify',
+  category: 'Algebra',
+  syntax: ['simplify(expr)', 'simplify(expr, rules)'],
+  description: 'Simplify an expression tree.',
+  examples: ['simplify("3 + 2 / 4")', 'simplify("2x + x")', 'f = parse("x * (x + 2 + x)")', 'simplified = simplify(f)', 'simplified.evaluate({x: 2})'],
+  seealso: ['simplifyCore', 'derivative', 'evaluate', 'parse', 'rationalize', 'resolve']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..d73df8d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyCore.js
@@ -0,0 +1,8 @@
+export var simplifyCoreDocs = {
+  name: 'simplifyCore',
+  category: 'Algebra',
+  syntax: ['simplifyCore(node)'],
+  description: 'Perform simple one-pass simplifications on an expression tree.',
+  examples: ['simplifyCore(parse("0*x"))', 'simplifyCore(parse("(x+0)*2"))'],
+  seealso: ['simplify', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js
new file mode 100644
index 0000000..f1527e2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js
@@ -0,0 +1,8 @@
+export var sluDocs = {
+  name: 'slu',
+  category: 'Algebra',
+  syntax: ['slu(A, order, threshold)'],
+  description: 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',
+  examples: ['slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..87b25fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/symbolicEqual.js
@@ -0,0 +1,8 @@
+export var symbolicEqualDocs = {
+  name: 'symbolicEqual',
+  category: 'Algebra',
+  syntax: ['symbolicEqual(expr1, expr2)', 'symbolicEqual(expr1, expr2, options)'],
+  description: 'Returns true if the difference of the expressions simplifies to 0',
+  examples: ['symbolicEqual("x*y","y*x")', 'symbolicEqual("abs(x^2)", "x^2")', 'symbolicEqual("abs(x)", "x", {context: {abs: {trivial: true}}})'],
+  seealso: ['simplify', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js
new file mode 100644
index 0000000..4020054
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js
@@ -0,0 +1,8 @@
+export var usolveDocs = {
+  name: 'usolve',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js
new file mode 100644
index 0000000..b05833a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js
@@ -0,0 +1,8 @@
+export var usolveAllDocs = {
+  name: 'usolveAll',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js
new file mode 100644
index 0000000..27c8f89
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js
@@ -0,0 +1,8 @@
+export var absDocs = {
+  name: 'abs',
+  category: 'Arithmetic',
+  syntax: ['abs(x)'],
+  description: 'Compute the absolute value.',
+  examples: ['abs(3.5)', 'abs(-4.2)'],
+  seealso: ['sign']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js
new file mode 100644
index 0000000..50c902b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js
@@ -0,0 +1,8 @@
+export var addDocs = {
+  name: 'add',
+  category: 'Operators',
+  syntax: ['x + y', 'add(x, y)'],
+  description: 'Add two values.',
+  examples: ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '"2.3" + "4"'],
+  seealso: ['subtract']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..225cd12
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js
@@ -0,0 +1,8 @@
+export var cbrtDocs = {
+  name: 'cbrt',
+  category: 'Arithmetic',
+  syntax: ['cbrt(x)', 'cbrt(x, allRoots)'],
+  description: 'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',
+  examples: ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],
+  seealso: ['square', 'sqrt', 'cube', 'multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js
new file mode 100644
index 0000000..e38bb35
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js
@@ -0,0 +1,8 @@
+export var ceilDocs = {
+  name: 'ceil',
+  category: 'Arithmetic',
+  syntax: ['ceil(x)'],
+  description: 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',
+  examples: ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)'],
+  seealso: ['floor', 'fix', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js
new file mode 100644
index 0000000..db2ea35
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js
@@ -0,0 +1,8 @@
+export var cubeDocs = {
+  name: 'cube',
+  category: 'Arithmetic',
+  syntax: ['cube(x)'],
+  description: 'Compute the cube of a value. The cube of x is x * x * x.',
+  examples: ['cube(2)', '2^3', '2 * 2 * 2'],
+  seealso: ['multiply', 'square', 'pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js
new file mode 100644
index 0000000..350eaa2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js
@@ -0,0 +1,8 @@
+export var divideDocs = {
+  name: 'divide',
+  category: 'Operators',
+  syntax: ['x / y', 'divide(x, y)'],
+  description: 'Divide two values.',
+  examples: ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],
+  seealso: ['multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..d0124ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js
@@ -0,0 +1,8 @@
+export var dotDivideDocs = {
+  name: 'dotDivide',
+  category: 'Operators',
+  syntax: ['x ./ y', 'dotDivide(x, y)'],
+  description: 'Divide two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],
+  seealso: ['multiply', 'dotMultiply', 'divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..f66bba9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js
@@ -0,0 +1,8 @@
+export var dotMultiplyDocs = {
+  name: 'dotMultiply',
+  category: 'Operators',
+  syntax: ['x .* y', 'dotMultiply(x, y)'],
+  description: 'Multiply two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],
+  seealso: ['multiply', 'divide', 'dotDivide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..a977c1d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js
@@ -0,0 +1,8 @@
+export var dotPowDocs = {
+  name: 'dotPow',
+  category: 'Operators',
+  syntax: ['x .^ y', 'dotPow(x, y)'],
+  description: 'Calculates the power of x to y element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],
+  seealso: ['pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js
new file mode 100644
index 0000000..0067c84
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js
@@ -0,0 +1,8 @@
+export var expDocs = {
+  name: 'exp',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Calculate the exponent of a value.',
+  examples: ['exp(1.3)', 'e ^ 1.3', 'log(exp(1.3))', 'x = 2.4', '(exp(i*x) == cos(x) + i*sin(x))   # Euler\'s formula'],
+  seealso: ['expm', 'expm1', 'pow', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js
new file mode 100644
index 0000000..8fc045c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js
@@ -0,0 +1,8 @@
+export var expmDocs = {
+  name: 'expm',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Compute the matrix exponential, expm(A) = e^A. ' + 'The matrix must be square. ' + 'Not to be confused with exp(a), which performs element-wise exponentiation.',
+  examples: ['expm([[0,2],[0,0]])'],
+  seealso: ['exp']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js
new file mode 100644
index 0000000..28098a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js
@@ -0,0 +1,8 @@
+export var expm1Docs = {
+  name: 'expm1',
+  category: 'Arithmetic',
+  syntax: ['expm1(x)'],
+  description: 'Calculate the value of subtracting 1 from the exponential value.',
+  examples: ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],
+  seealso: ['exp', 'pow', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js
new file mode 100644
index 0000000..69ad27d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js
@@ -0,0 +1,8 @@
+export var fixDocs = {
+  name: 'fix',
+  category: 'Arithmetic',
+  syntax: ['fix(x)'],
+  description: 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',
+  examples: ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)'],
+  seealso: ['ceil', 'floor', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js
new file mode 100644
index 0000000..e004fe4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js
@@ -0,0 +1,8 @@
+export var floorDocs = {
+  name: 'floor',
+  category: 'Arithmetic',
+  syntax: ['floor(x)'],
+  description: 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',
+  examples: ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)'],
+  seealso: ['ceil', 'fix', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js
new file mode 100644
index 0000000..3944fc2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js
@@ -0,0 +1,8 @@
+export var gcdDocs = {
+  name: 'gcd',
+  category: 'Arithmetic',
+  syntax: ['gcd(a, b)', 'gcd(a, b, c, ...)'],
+  description: 'Compute the greatest common divisor.',
+  examples: ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],
+  seealso: ['lcm', 'xgcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js
new file mode 100644
index 0000000..27ccadf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js
@@ -0,0 +1,8 @@
+export var hypotDocs = {
+  name: 'hypot',
+  category: 'Arithmetic',
+  syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],
+  description: 'Calculate the hypotenusa of a list with values. ',
+  examples: ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],
+  seealso: ['abs', 'norm']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/invmod.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/invmod.js
new file mode 100644
index 0000000..02a9061
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/invmod.js
@@ -0,0 +1,8 @@
+export var invmodDocs = {
+  name: 'invmod',
+  category: 'Arithmetic',
+  syntax: ['invmod(a, b)'],
+  description: 'Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)',
+  examples: ['invmod(8, 12)=NaN', 'invmod(7, 13)=2', 'math.invmod(15151, 15122)=10429'],
+  seealso: ['gcd', 'xgcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js
new file mode 100644
index 0000000..3b6309f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js
@@ -0,0 +1,8 @@
+export var lcmDocs = {
+  name: 'lcm',
+  category: 'Arithmetic',
+  syntax: ['lcm(x, y)'],
+  description: 'Compute the least common multiple.',
+  examples: ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],
+  seealso: ['gcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js
new file mode 100644
index 0000000..af228dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js
@@ -0,0 +1,8 @@
+export var logDocs = {
+  name: 'log',
+  category: 'Arithmetic',
+  syntax: ['log(x)', 'log(x, base)'],
+  description: 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',
+  examples: ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],
+  seealso: ['exp', 'log1p', 'log2', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js
new file mode 100644
index 0000000..4687c87
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js
@@ -0,0 +1,8 @@
+export var log10Docs = {
+  name: 'log10',
+  category: 'Arithmetic',
+  syntax: ['log10(x)'],
+  description: 'Compute the 10-base logarithm of a value.',
+  examples: ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],
+  seealso: ['exp', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js
new file mode 100644
index 0000000..4c0a5cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js
@@ -0,0 +1,8 @@
+export var log1pDocs = {
+  name: 'log1p',
+  category: 'Arithmetic',
+  syntax: ['log1p(x)', 'log1p(x, base)'],
+  description: 'Calculate the logarithm of a `value+1`',
+  examples: ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],
+  seealso: ['exp', 'log', 'log2', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js
new file mode 100644
index 0000000..faf07cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js
@@ -0,0 +1,8 @@
+export var log2Docs = {
+  name: 'log2',
+  category: 'Arithmetic',
+  syntax: ['log2(x)'],
+  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',
+  examples: ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],
+  seealso: ['exp', 'log1p', 'log', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js
new file mode 100644
index 0000000..f8eda30
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js
@@ -0,0 +1,8 @@
+export var modDocs = {
+  name: 'mod',
+  category: 'Operators',
+  syntax: ['x % y', 'x mod y', 'mod(x, y)'],
+  description: 'Calculates the modulus, the remainder of an integer division.',
+  examples: ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],
+  seealso: ['divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js
new file mode 100644
index 0000000..1f28098
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js
@@ -0,0 +1,8 @@
+export var multiplyDocs = {
+  name: 'multiply',
+  category: 'Operators',
+  syntax: ['x * y', 'multiply(x, y)'],
+  description: 'multiply two values.',
+  examples: ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],
+  seealso: ['divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js
new file mode 100644
index 0000000..129579e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js
@@ -0,0 +1,7 @@
+export var normDocs = {
+  name: 'norm',
+  category: 'Arithmetic',
+  syntax: ['norm(x)', 'norm(x, p)'],
+  description: 'Calculate the norm of a number, vector or matrix.',
+  examples: ['abs(-3.5)', 'norm(-3.5)', 'norm(3 - 4i)', 'norm([1, 2, -3], Infinity)', 'norm([1, 2, -3], -Infinity)', 'norm([3, 4], 2)', 'norm([[1, 2], [3, 4]], 1)', 'norm([[1, 2], [3, 4]], "inf")', 'norm([[1, 2], [3, 4]], "fro")']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..9cf2442
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js
@@ -0,0 +1,8 @@
+export var nthRootDocs = {
+  name: 'nthRoot',
+  category: 'Arithmetic',
+  syntax: ['nthRoot(a)', 'nthRoot(a, root)'],
+  description: 'Calculate the nth root of a value. ' + 'The principal nth root of a positive real number A, ' + 'is the positive real solution of the equation "x^root = A".',
+  examples: ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],
+  seealso: ['nthRoots', 'pow', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..2b5de3c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js
@@ -0,0 +1,8 @@
+export var nthRootsDocs = {
+  name: 'nthRoots',
+  category: 'Arithmetic',
+  syntax: ['nthRoots(A)', 'nthRoots(A, root)'],
+  description: '' + 'Calculate the nth roots of a value. ' + 'An nth root of a positive real number A, ' + 'is a positive real solution of the equation "x^root = A". ' + 'This function returns an array of complex values.',
+  examples: ['nthRoots(1)', 'nthRoots(1, 3)'],
+  seealso: ['sqrt', 'pow', 'nthRoot']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js
new file mode 100644
index 0000000..297c4f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js
@@ -0,0 +1,8 @@
+export var powDocs = {
+  name: 'pow',
+  category: 'Operators',
+  syntax: ['x ^ y', 'pow(x, y)'],
+  description: 'Calculates the power of x to y, x^y.',
+  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)'],
+  seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js
new file mode 100644
index 0000000..e6ef5eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js
@@ -0,0 +1,8 @@
+export var roundDocs = {
+  name: 'round',
+  category: 'Arithmetic',
+  syntax: ['round(x)', 'round(x, n)'],
+  description: 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',
+  examples: ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)'],
+  seealso: ['ceil', 'floor', 'fix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js
new file mode 100644
index 0000000..8972a5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js
@@ -0,0 +1,8 @@
+export var signDocs = {
+  name: 'sign',
+  category: 'Arithmetic',
+  syntax: ['sign(x)'],
+  description: 'Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.',
+  examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],
+  seealso: ['abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..9fc19ac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js
@@ -0,0 +1,8 @@
+export var sqrtDocs = {
+  name: 'sqrt',
+  category: 'Arithmetic',
+  syntax: ['sqrt(x)'],
+  description: 'Compute the square root value. If x = y * y, then y is the square root of x.',
+  examples: ['sqrt(25)', '5 * 5', 'sqrt(-1)'],
+  seealso: ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js
new file mode 100644
index 0000000..305ca64
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js
@@ -0,0 +1,8 @@
+export var sqrtmDocs = {
+  name: 'sqrtm',
+  category: 'Arithmetic',
+  syntax: ['sqrtm(x)'],
+  description: 'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',
+  examples: ['sqrtm([[1, 2], [3, 4]])'],
+  seealso: ['sqrt', 'abs', 'square', 'multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js
new file mode 100644
index 0000000..5c858f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js
@@ -0,0 +1,8 @@
+export var squareDocs = {
+  name: 'square',
+  category: 'Arithmetic',
+  syntax: ['square(x)'],
+  description: 'Compute the square of a value. The square of x is x * x.',
+  examples: ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],
+  seealso: ['multiply', 'pow', 'sqrt', 'cube']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js
new file mode 100644
index 0000000..c6a2084
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js
@@ -0,0 +1,8 @@
+export var subtractDocs = {
+  name: 'subtract',
+  category: 'Operators',
+  syntax: ['x - y', 'subtract(x, y)'],
+  description: 'subtract two values.',
+  examples: ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],
+  seealso: ['add']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..e4dcbaf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js
@@ -0,0 +1,8 @@
+export var unaryMinusDocs = {
+  name: 'unaryMinus',
+  category: 'Operators',
+  syntax: ['-x', 'unaryMinus(x)'],
+  description: 'Inverse the sign of a value. Converts booleans and strings to numbers.',
+  examples: ['-4.5', '-(-5.6)', '-"22"'],
+  seealso: ['add', 'subtract', 'unaryPlus']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..783efc4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js
@@ -0,0 +1,8 @@
+export var unaryPlusDocs = {
+  name: 'unaryPlus',
+  category: 'Operators',
+  syntax: ['+x', 'unaryPlus(x)'],
+  description: 'Converts booleans and strings to numbers.',
+  examples: ['+true', '+"2"'],
+  seealso: ['add', 'subtract', 'unaryMinus']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..a0ec1de
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js
@@ -0,0 +1,8 @@
+export var xgcdDocs = {
+  name: 'xgcd',
+  category: 'Arithmetic',
+  syntax: ['xgcd(a, b)'],
+  description: 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',
+  examples: ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],
+  seealso: ['gcd', 'lcm']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..5e4af2a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js
@@ -0,0 +1,8 @@
+export var bitAndDocs = {
+  name: 'bitAnd',
+  category: 'Bitwise',
+  syntax: ['x & y', 'bitAnd(x, y)'],
+  description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',
+  examples: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],
+  seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js
new file mode 100644
index 0000000..905841f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js
@@ -0,0 +1,8 @@
+export var bitNotDocs = {
+  name: 'bitNot',
+  category: 'Bitwise',
+  syntax: ['~x', 'bitNot(x)'],
+  description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',
+  examples: ['~1', '~2', 'bitNot([2, -3, 4])'],
+  seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js
new file mode 100644
index 0000000..2e98ee5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js
@@ -0,0 +1,8 @@
+export var bitOrDocs = {
+  name: 'bitOr',
+  category: 'Bitwise',
+  syntax: ['x | y', 'bitOr(x, y)'],
+  description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',
+  examples: ['5 | 3', 'bitOr([1, 2, 3], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js
new file mode 100644
index 0000000..4be877e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js
@@ -0,0 +1,8 @@
+export var bitXorDocs = {
+  name: 'bitXor',
+  category: 'Bitwise',
+  syntax: ['bitXor(x, y)'],
+  description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',
+  examples: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js
new file mode 100644
index 0000000..a693a22
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js
@@ -0,0 +1,8 @@
+export var leftShiftDocs = {
+  name: 'leftShift',
+  category: 'Bitwise',
+  syntax: ['x << y', 'leftShift(x, y)'],
+  description: 'Bitwise left logical shift of a value x by y number of bits.',
+  examples: ['4 << 1', '8 >> 1'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..107a877
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js
@@ -0,0 +1,8 @@
+export var rightArithShiftDocs = {
+  name: 'rightArithShift',
+  category: 'Bitwise',
+  syntax: ['x >> y', 'rightArithShift(x, y)'],
+  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',
+  examples: ['8 >> 1', '4 << 1', '-12 >> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..fed62da
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js
@@ -0,0 +1,8 @@
+export var rightLogShiftDocs = {
+  name: 'rightLogShift',
+  category: 'Bitwise',
+  syntax: ['x >>> y', 'rightLogShift(x, y)'],
+  description: 'Bitwise right logical shift of a value x by y number of bits.',
+  examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..2a24de3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js
@@ -0,0 +1,8 @@
+export var bellNumbersDocs = {
+  name: 'bellNumbers',
+  category: 'Combinatorics',
+  syntax: ['bellNumbers(n)'],
+  description: 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['bellNumbers(3)', 'bellNumbers(8)'],
+  seealso: ['stirlingS2']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js
new file mode 100644
index 0000000..e68903b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js
@@ -0,0 +1,8 @@
+export var catalanDocs = {
+  name: 'catalan',
+  category: 'Combinatorics',
+  syntax: ['catalan(n)'],
+  description: 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['catalan(3)', 'catalan(8)'],
+  seealso: ['bellNumbers']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js
new file mode 100644
index 0000000..17ddea5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js
@@ -0,0 +1,8 @@
+export var compositionDocs = {
+  name: 'composition',
+  category: 'Combinatorics',
+  syntax: ['composition(n, k)'],
+  description: 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',
+  examples: ['composition(5, 3)'],
+  seealso: ['combinations']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..42da118
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js
@@ -0,0 +1,8 @@
+export var stirlingS2Docs = {
+  name: 'stirlingS2',
+  category: 'Combinatorics',
+  syntax: ['stirlingS2(n, k)'],
+  description: 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',
+  examples: ['stirlingS2(5, 3)'],
+  seealso: ['bellNumbers']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js
new file mode 100644
index 0000000..365d159
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js
@@ -0,0 +1,8 @@
+export var argDocs = {
+  name: 'arg',
+  category: 'Complex',
+  syntax: ['arg(x)'],
+  description: 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',
+  examples: ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],
+  seealso: ['re', 'im', 'conj', 'abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js
new file mode 100644
index 0000000..95d6966
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js
@@ -0,0 +1,8 @@
+export var conjDocs = {
+  name: 'conj',
+  category: 'Complex',
+  syntax: ['conj(x)'],
+  description: 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',
+  examples: ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],
+  seealso: ['re', 'im', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js
new file mode 100644
index 0000000..1ef8686
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js
@@ -0,0 +1,8 @@
+export var imDocs = {
+  name: 'im',
+  category: 'Complex',
+  syntax: ['im(x)'],
+  description: 'Get the imaginary part of a complex number.',
+  examples: ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],
+  seealso: ['re', 'conj', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js
new file mode 100644
index 0000000..5ba0074
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js
@@ -0,0 +1,8 @@
+export var reDocs = {
+  name: 're',
+  category: 'Complex',
+  syntax: ['re(x)'],
+  description: 'Get the real part of a complex number.',
+  examples: ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],
+  seealso: ['im', 'conj', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js
new file mode 100644
index 0000000..1c576f2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js
@@ -0,0 +1,8 @@
+export var evaluateDocs = {
+  name: 'evaluate',
+  category: 'Expression',
+  syntax: ['evaluate(expression)', 'evaluate([expr1, expr2, expr3, ...])'],
+  description: 'Evaluate an expression or an array with expressions.',
+  examples: ['evaluate("2 + 3")', 'evaluate("sqrt(" + 4 + ")")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js
new file mode 100644
index 0000000..51d9401
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js
@@ -0,0 +1,8 @@
+export var helpDocs = {
+  name: 'help',
+  category: 'Expression',
+  syntax: ['help(object)', 'help(string)'],
+  description: 'Display documentation on a function or data type.',
+  examples: ['help(sqrt)', 'help("complex")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js
new file mode 100644
index 0000000..f372020
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js
@@ -0,0 +1,8 @@
+export var distanceDocs = {
+  name: 'distance',
+  category: 'Geometry',
+  syntax: ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2]])'],
+  description: 'Calculates the Euclidean distance between two points.',
+  examples: ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js
new file mode 100644
index 0000000..ebf61d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js
@@ -0,0 +1,8 @@
+export var intersectDocs = {
+  name: 'intersect',
+  category: 'Geometry',
+  syntax: ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],
+  description: 'Computes the intersection point of lines and/or planes.',
+  examples: ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js
new file mode 100644
index 0000000..88112d0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js
@@ -0,0 +1,8 @@
+export var andDocs = {
+  name: 'and',
+  category: 'Logical',
+  syntax: ['x and y', 'and(x, y)'],
+  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',
+  examples: ['true and false', 'true and true', '2 and 4'],
+  seealso: ['not', 'or', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js
new file mode 100644
index 0000000..e5a7c58
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js
@@ -0,0 +1,8 @@
+export var notDocs = {
+  name: 'not',
+  category: 'Logical',
+  syntax: ['not x', 'not(x)'],
+  description: 'Logical not. Flips the boolean value of given argument.',
+  examples: ['not true', 'not false', 'not 2', 'not 0'],
+  seealso: ['and', 'or', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js
new file mode 100644
index 0000000..dbcd620
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js
@@ -0,0 +1,8 @@
+export var orDocs = {
+  name: 'or',
+  category: 'Logical',
+  syntax: ['x or y', 'or(x, y)'],
+  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',
+  examples: ['true or false', 'false or false', '0 or 4'],
+  seealso: ['not', 'and', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js
new file mode 100644
index 0000000..c362d93
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js
@@ -0,0 +1,8 @@
+export var xorDocs = {
+  name: 'xor',
+  category: 'Logical',
+  syntax: ['x xor y', 'xor(x, y)'],
+  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',
+  examples: ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],
+  seealso: ['not', 'and', 'or']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js
new file mode 100644
index 0000000..2a2ee86
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js
@@ -0,0 +1,8 @@
+export var columnDocs = {
+  name: 'column',
+  category: 'Matrix',
+  syntax: ['column(x, index)'],
+  description: 'Return a column from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],
+  seealso: ['row', 'matrixFromColumns']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js
new file mode 100644
index 0000000..b865da7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js
@@ -0,0 +1,8 @@
+export var concatDocs = {
+  name: 'concat',
+  category: 'Matrix',
+  syntax: ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],
+  description: 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',
+  examples: ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],
+  seealso: ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js
new file mode 100644
index 0000000..6237021
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js
@@ -0,0 +1,8 @@
+export var countDocs = {
+  name: 'count',
+  category: 'Matrix',
+  syntax: ['count(x)'],
+  description: 'Count the number of elements of a matrix, array or string.',
+  examples: ['a = [1, 2; 3, 4; 5, 6]', 'count(a)', 'size(a)', 'count("hello world")'],
+  seealso: ['size']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js
new file mode 100644
index 0000000..c9eed54
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js
@@ -0,0 +1,8 @@
+export var crossDocs = {
+  name: 'cross',
+  category: 'Matrix',
+  syntax: ['cross(A, B)'],
+  description: 'Calculate the cross product for two vectors in three dimensional space.',
+  examples: ['cross([1, 1, 0],  [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4],  [5, 6, 7])'],
+  seealso: ['multiply', 'dot']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js
new file mode 100644
index 0000000..730680e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js
@@ -0,0 +1,8 @@
+export var ctransposeDocs = {
+  name: 'ctranspose',
+  category: 'Matrix',
+  syntax: ['x\'', 'ctranspose(x)'],
+  description: 'Complex Conjugate and Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'ctranspose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js
new file mode 100644
index 0000000..79e0c92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js
@@ -0,0 +1,8 @@
+export var detDocs = {
+  name: 'det',
+  category: 'Matrix',
+  syntax: ['det(x)'],
+  description: 'Calculate the determinant of a matrix',
+  examples: ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],
+  seealso: ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js
new file mode 100644
index 0000000..b6f65c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js
@@ -0,0 +1,8 @@
+export var diagDocs = {
+  name: 'diag',
+  category: 'Matrix',
+  syntax: ['diag(x)', 'diag(x, k)'],
+  description: 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',
+  examples: ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],
+  seealso: ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js
new file mode 100644
index 0000000..2ec9cfb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js
@@ -0,0 +1,8 @@
+export var diffDocs = {
+  name: 'diff',
+  category: 'Matrix',
+  syntax: ['diff(arr)', 'diff(arr, dim)'],
+  description: ['Create a new matrix or array with the difference of the passed matrix or array.', 'Dim parameter is optional and used to indicant the dimension of the array/matrix to apply the difference', 'If no dimension parameter is passed it is assumed as dimension 0', 'Dimension is zero-based in javascript and one-based in the parser', 'Arrays must be \'rectangular\' meaning arrays like [1, 2]', 'If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays'],
+  examples: ['diff([1, 2, 4, 7, 0])', 'diff([1, 2, 4, 7, 0], 0)', 'diff(matrix([1, 2, 4, 7, 0]))', 'diff([[1, 2], [3, 4]])', 'diff([[1, 2], [3, 4]], 0)', 'diff([[1, 2], [3, 4]], 1)', 'diff([[1, 2], [3, 4]], bignumber(1))', 'diff(matrix([[1, 2], [3, 4]]), 1)', 'diff([[1, 2], matrix([3, 4])], 1)'],
+  seealso: ['subtract', 'partitionSelect']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js
new file mode 100644
index 0000000..05d137d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js
@@ -0,0 +1,8 @@
+export var dotDocs = {
+  name: 'dot',
+  category: 'Matrix',
+  syntax: ['dot(A, B)', 'A * B'],
+  description: 'Calculate the dot product of two vectors. ' + 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',
+  examples: ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],
+  seealso: ['multiply', 'cross']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js
new file mode 100644
index 0000000..6409c2f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js
@@ -0,0 +1,8 @@
+export var eigsDocs = {
+  name: 'eigs',
+  category: 'Matrix',
+  syntax: ['eigs(x)'],
+  description: 'Calculate the eigenvalues and eigenvectors of a real symmetric matrix',
+  examples: ['eigs([[5, 2.3], [2.3, 1]])'],
+  seealso: ['inv']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js
new file mode 100644
index 0000000..01658cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js
@@ -0,0 +1,8 @@
+export var filterDocs = {
+  name: 'filter',
+  category: 'Matrix',
+  syntax: ['filter(x, test)'],
+  description: 'Filter items in a matrix.',
+  examples: ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],
+  seealso: ['sort', 'map', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js
new file mode 100644
index 0000000..02660a9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js
@@ -0,0 +1,8 @@
+export var flattenDocs = {
+  name: 'flatten',
+  category: 'Matrix',
+  syntax: ['flatten(x)'],
+  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],
+  seealso: ['concat', 'resize', 'size', 'squeeze']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js
new file mode 100644
index 0000000..11f11dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js
@@ -0,0 +1,8 @@
+export var forEachDocs = {
+  name: 'forEach',
+  category: 'Matrix',
+  syntax: ['forEach(x, callback)'],
+  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',
+  examples: ['numberOfPets = {}', 'addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;', 'forEach(["Dog","Cat","Cat"], addPet)', 'numberOfPets'],
+  seealso: ['map', 'sort', 'filter']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..cc1daa2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js
@@ -0,0 +1,8 @@
+export var getMatrixDataTypeDocs = {
+  name: 'getMatrixDataType',
+  category: 'Matrix',
+  syntax: ['getMatrixDataType(x)'],
+  description: 'Find the data type of all elements in a matrix or array, ' + 'for example "number" if all items are a number ' + 'and "Complex" if all values are complex numbers. ' + 'If a matrix contains more than one data type, it will return "mixed".',
+  examples: ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, "text"])', 'getMatrixDataType([1, bignumber(4)])'],
+  seealso: ['matrix', 'sparse', 'typeOf']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js
new file mode 100644
index 0000000..c3d717e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js
@@ -0,0 +1,8 @@
+export var identityDocs = {
+  name: 'identity',
+  category: 'Matrix',
+  syntax: ['identity(n)', 'identity(m, n)', 'identity([m, n])'],
+  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',
+  examples: ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js
new file mode 100644
index 0000000..db48c64
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js
@@ -0,0 +1,8 @@
+export var invDocs = {
+  name: 'inv',
+  category: 'Matrix',
+  syntax: ['inv(x)'],
+  description: 'Calculate the inverse of a matrix',
+  examples: ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js
new file mode 100644
index 0000000..3a24f91
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js
@@ -0,0 +1,8 @@
+export var kronDocs = {
+  name: 'kron',
+  category: 'Matrix',
+  syntax: ['kron(x, y)'],
+  description: 'Calculates the kronecker product of 2 matrices or vectors.',
+  examples: ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],
+  seealso: ['multiply', 'dot', 'cross']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js
new file mode 100644
index 0000000..b18be56
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js
@@ -0,0 +1,8 @@
+export var mapDocs = {
+  name: 'map',
+  category: 'Matrix',
+  syntax: ['map(x, callback)'],
+  description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.',
+  examples: ['map([1, 2, 3], square)'],
+  seealso: ['filter', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..f45242f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromColumns.js
@@ -0,0 +1,8 @@
+export var matrixFromColumnsDocs = {
+  name: 'matrixFromColumns',
+  category: 'Matrix',
+  syntax: ['math.matrixFromColumns(...arr)', 'math.matrixFromColumns(row1, row2)', 'math.matrixFromColumns(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual columns.',
+  examples: ['matrixFromColumns([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromFunction', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..7c6c021
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromFunction.js
@@ -0,0 +1,8 @@
+export var matrixFromFunctionDocs = {
+  name: 'matrixFromFunction',
+  category: 'Matrix',
+  syntax: ['math.matrixFromFunction(size, fn)', 'math.matrixFromFunction(size, fn, format)', 'math.matrixFromFunction(size, fn, format, datatype)', 'math.matrixFromFunction(size, format, fn)', 'math.matrixFromFunction(size, format, datatype, fn)'],
+  description: 'Create a matrix by evaluating a generating function at each index.',
+  examples: ['f(I) = I[1] - I[2]', 'matrixFromFunction([3,3], f)', 'g(I) = I[1] - I[2] == 1 ? 4 : 0', 'matrixFromFunction([100, 100], "sparse", g)', 'matrixFromFunction([5], random)'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromColumns', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..33fca3d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromRows.js
@@ -0,0 +1,8 @@
+export var matrixFromRowsDocs = {
+  name: 'matrixFromRows',
+  category: 'Matrix',
+  syntax: ['math.matrixFromRows(...arr)', 'math.matrixFromRows(row1, row2)', 'math.matrixFromRows(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual rows.',
+  examples: ['matrixFromRows([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromColumns', 'matrixFromFunction', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js
new file mode 100644
index 0000000..793db0e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js
@@ -0,0 +1,8 @@
+export var onesDocs = {
+  name: 'ones',
+  category: 'Matrix',
+  syntax: ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],
+  description: 'Create a matrix containing ones.',
+  examples: ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..d94e24b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js
@@ -0,0 +1,8 @@
+export var partitionSelectDocs = {
+  name: 'partitionSelect',
+  category: 'Matrix',
+  syntax: ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],
+  description: 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',
+  examples: ['partitionSelect([5, 10, 1], 2)', 'partitionSelect(["C", "B", "A", "D"], 1)'],
+  seealso: ['sort']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js
new file mode 100644
index 0000000..a368a67
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js
@@ -0,0 +1,8 @@
+export var rangeDocs = {
+  name: 'range',
+  category: 'Type',
+  syntax: ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],
+  description: 'Create a range. Lower bound of the range is included, upper bound is excluded.',
+  examples: ['1:5', '3:-1:-3', 'range(3, 7)', 'range(0, 12, 2)', 'range("4:10")', 'a = [1, 2, 3, 4; 5, 6, 7, 8]', 'a[1:2, 1:2]'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js
new file mode 100644
index 0000000..3378cd5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js
@@ -0,0 +1,8 @@
+export var reshapeDocs = {
+  name: 'reshape',
+  category: 'Matrix',
+  syntax: ['reshape(x, sizes)'],
+  description: 'Reshape a multi dimensional array to fit the specified dimensions.',
+  examples: ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])'],
+  seealso: ['size', 'squeeze', 'resize']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js
new file mode 100644
index 0000000..8ff141a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js
@@ -0,0 +1,8 @@
+export var resizeDocs = {
+  name: 'resize',
+  category: 'Matrix',
+  syntax: ['resize(x, size)', 'resize(x, size, defaultValue)'],
+  description: 'Resize a matrix.',
+  examples: ['resize([1,2,3,4,5], [3])', 'resize([1,2,3], [5])', 'resize([1,2,3], [5], -1)', 'resize(2, [2, 3])', 'resize("hello", [8], "!")'],
+  seealso: ['size', 'subset', 'squeeze', 'reshape']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js
new file mode 100644
index 0000000..81ab84b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js
@@ -0,0 +1,8 @@
+export var rotateDocs = {
+  name: 'rotate',
+  category: 'Matrix',
+  syntax: ['rotate(w, theta)', 'rotate(w, theta, v)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotate([1, 0], math.pi / 2)', 'rotate(matrix([1, 0]), unit("35deg"))', 'rotate([1, 0, 0], unit("90deg"), [0, 0, 1])', 'rotate(matrix([1, 0, 0]), unit("90deg"), matrix([0, 0, 1]))'],
+  seealso: ['matrix', 'rotationMatrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..52c553d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js
@@ -0,0 +1,8 @@
+export var rotationMatrixDocs = {
+  name: 'rotationMatrix',
+  category: 'Matrix',
+  syntax: ['rotationMatrix(theta)', 'rotationMatrix(theta, v)', 'rotationMatrix(theta, v, format)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotationMatrix(pi / 2)', 'rotationMatrix(unit("45deg"), [0, 0, 1])', 'rotationMatrix(1, matrix([0, 0, 1]), "sparse")'],
+  seealso: ['cos', 'sin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js
new file mode 100644
index 0000000..ca6626b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js
@@ -0,0 +1,8 @@
+export var rowDocs = {
+  name: 'row',
+  category: 'Matrix',
+  syntax: ['row(x, index)'],
+  description: 'Return a row from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],
+  seealso: ['column', 'matrixFromRows']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js
new file mode 100644
index 0000000..a93282e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js
@@ -0,0 +1,8 @@
+export var sizeDocs = {
+  name: 'size',
+  category: 'Matrix',
+  syntax: ['size(x)'],
+  description: 'Calculate the size of a matrix.',
+  examples: ['size(2.3)', 'size("hello world")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],
+  seealso: ['concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js
new file mode 100644
index 0000000..33f6a64
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js
@@ -0,0 +1,8 @@
+export var sortDocs = {
+  name: 'sort',
+  category: 'Matrix',
+  syntax: ['sort(x)', 'sort(x, compare)'],
+  description: 'Sort the items in a matrix. Compare can be a string "asc", "desc", "natural", or a custom sort function.',
+  examples: ['sort([5, 10, 1])', 'sort(["C", "B", "A", "D"])', 'sortByLength(a, b) = size(a)[1] - size(b)[1]', 'sort(["Langdon", "Tom", "Sara"], sortByLength)', 'sort(["10", "1", "2"], "natural")'],
+  seealso: ['map', 'filter', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js
new file mode 100644
index 0000000..bd699fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js
@@ -0,0 +1,8 @@
+export var squeezeDocs = {
+  name: 'squeeze',
+  category: 'Matrix',
+  syntax: ['squeeze(x)'],
+  description: 'Remove inner and outer singleton dimensions from a matrix.',
+  examples: ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js
new file mode 100644
index 0000000..9c3907e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js
@@ -0,0 +1,8 @@
+export var subsetDocs = {
+  name: 'subset',
+  category: 'Matrix',
+  syntax: ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],
+  description: 'Get or set a subset of the entries of a matrix or ' + 'characters of a string. ' + 'Indexes are one-based. There should be one index specification for ' + 'each dimension of the target. Each specification can be a single ' + 'index, a list of indices, or a range in colon notation `l:u`. ' + 'In a range, both the lower bound l and upper bound u are included; ' + 'and if a bound is omitted it defaults to the most extreme valid value. ' + 'The cartesian product of the indices specified in each dimension ' + 'determines the target of the operation.',
+  examples: ['d = [1, 2; 3, 4]', 'e = []', 'e[1, 1:2] = [5, 6]', 'e[2, :] = [7, 8]', 'f = d * e', 'f[2, 1]', 'f[:, 1]', 'f[[1,2], [1,3]] = [9, 10; 11, 12]', 'f'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js
new file mode 100644
index 0000000..863f7f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js
@@ -0,0 +1,8 @@
+export var traceDocs = {
+  name: 'trace',
+  category: 'Matrix',
+  syntax: ['trace(A)'],
+  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',
+  examples: ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js
new file mode 100644
index 0000000..a565ec5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js
@@ -0,0 +1,8 @@
+export var transposeDocs = {
+  name: 'transpose',
+  category: 'Matrix',
+  syntax: ['x\'', 'transpose(x)'],
+  description: 'Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'transpose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js
new file mode 100644
index 0000000..c6bbeb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js
@@ -0,0 +1,8 @@
+export var zerosDocs = {
+  name: 'zeros',
+  category: 'Matrix',
+  syntax: ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],
+  description: 'Create a matrix containing zeros.',
+  examples: ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js
new file mode 100644
index 0000000..e9d3396
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js
@@ -0,0 +1,8 @@
+export var combinationsDocs = {
+  name: 'combinations',
+  category: 'Probability',
+  syntax: ['combinations(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time',
+  examples: ['combinations(7, 5)'],
+  seealso: ['combinationsWithRep', 'permutations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..1938bf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js
@@ -0,0 +1,8 @@
+export var combinationsWithRepDocs = {
+  name: 'combinationsWithRep',
+  category: 'Probability',
+  syntax: ['combinationsWithRep(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time with replacements.',
+  examples: ['combinationsWithRep(7, 5)'],
+  seealso: ['combinations', 'permutations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/distribution.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/distribution.js
new file mode 100644
index 0000000..fce3ffb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/distribution.js
@@ -0,0 +1,8 @@
+export var distributionDocs = {
+  name: 'distribution',
+  category: 'Probability',
+  syntax: ['distribution(name)', 'distribution(name, arg1, arg2, ...)'],
+  description: 'Create a distribution object of a specific type. ' + 'A distribution object contains functions `random([size,] [min,] [max])`, ' + '`randomInt([size,] [min,] [max])` and `pickRandom(array)`. ' + 'Available types of distributions: "uniform", "normal". ' + 'Note that the function distribution is currently not available via the expression parser.',
+  examples: [],
+  seealso: ['random', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js
new file mode 100644
index 0000000..a3086a2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js
@@ -0,0 +1,8 @@
+export var factorialDocs = {
+  name: 'factorial',
+  category: 'Probability',
+  syntax: ['n!', 'factorial(n)'],
+  description: 'Compute the factorial of a value',
+  examples: ['5!', '5 * 4 * 3 * 2 * 1', '3!'],
+  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js
new file mode 100644
index 0000000..a5101a2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js
@@ -0,0 +1,8 @@
+export var gammaDocs = {
+  name: 'gamma',
+  category: 'Probability',
+  syntax: ['gamma(n)'],
+  description: 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',
+  examples: ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],
+  seealso: ['factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js
new file mode 100644
index 0000000..f9e967a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js
@@ -0,0 +1,8 @@
+export var kldivergenceDocs = {
+  name: 'kldivergence',
+  category: 'Probability',
+  syntax: ['kldivergence(x, y)'],
+  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',
+  examples: ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js
new file mode 100644
index 0000000..d32e1f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js
@@ -0,0 +1,8 @@
+export var multinomialDocs = {
+  name: 'multinomial',
+  category: 'Probability',
+  syntax: ['multinomial(A)'],
+  description: 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',
+  examples: ['multinomial([1, 2, 1])'],
+  seealso: ['combinations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js
new file mode 100644
index 0000000..f955d24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js
@@ -0,0 +1,8 @@
+export var permutationsDocs = {
+  name: 'permutations',
+  category: 'Probability',
+  syntax: ['permutations(n)', 'permutations(n, k)'],
+  description: 'Compute the number of permutations of n items taken k at a time',
+  examples: ['permutations(5)', 'permutations(5, 3)'],
+  seealso: ['combinations', 'combinationsWithRep', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js
new file mode 100644
index 0000000..4acf5dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js
@@ -0,0 +1,8 @@
+export var pickRandomDocs = {
+  name: 'pickRandom',
+  category: 'Probability',
+  syntax: ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],
+  description: 'Pick a random entry from a given array.',
+  examples: ['pickRandom(0:10)', 'pickRandom([1, 3, 1, 6])', 'pickRandom([1, 3, 1, 6], 2)', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'],
+  seealso: ['random', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js
new file mode 100644
index 0000000..69d6711
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js
@@ -0,0 +1,8 @@
+export var randomDocs = {
+  name: 'random',
+  category: 'Probability',
+  syntax: ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],
+  description: 'Return a random number.',
+  examples: ['random()', 'random(10, 20)', 'random([2, 3])'],
+  seealso: ['pickRandom', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js
new file mode 100644
index 0000000..6518fc3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js
@@ -0,0 +1,8 @@
+export var randomIntDocs = {
+  name: 'randomInt',
+  category: 'Probability',
+  syntax: ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],
+  description: 'Return a random integer number',
+  examples: ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],
+  seealso: ['pickRandom', 'random']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js
new file mode 100644
index 0000000..17361a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js
@@ -0,0 +1,8 @@
+export var compareDocs = {
+  name: 'compare',
+  category: 'Relational',
+  syntax: ['compare(x, y)'],
+  description: 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js
new file mode 100644
index 0000000..c4202df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js
@@ -0,0 +1,8 @@
+export var compareNaturalDocs = {
+  name: 'compareNatural',
+  category: 'Relational',
+  syntax: ['compareNatural(x, y)'],
+  description: 'Compare two values of any type in a deterministic, natural way. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareNatural(2, 3)', 'compareNatural(3, 2)', 'compareNatural(2, 2)', 'compareNatural(5cm, 40mm)', 'compareNatural("2", "10")', 'compareNatural(2 + 3i, 2 + 4i)', 'compareNatural([1, 2, 4], [1, 2, 3])', 'compareNatural([1, 5], [1, 2, 3])', 'compareNatural([1, 2], [1, 2])', 'compareNatural({a: 2}, {a: 4})'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js
new file mode 100644
index 0000000..7225760
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js
@@ -0,0 +1,8 @@
+export var compareTextDocs = {
+  name: 'compareText',
+  category: 'Relational',
+  syntax: ['compareText(x, y)'],
+  description: 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareText("B", "A")', 'compareText("A", "B")', 'compareText("A", "A")', 'compareText("2", "10")', 'compare("2", "10")', 'compare(2, 10)', 'compareNatural("2", "10")', 'compareText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js
new file mode 100644
index 0000000..7332e8a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js
@@ -0,0 +1,8 @@
+export var deepEqualDocs = {
+  name: 'deepEqual',
+  category: 'Relational',
+  syntax: ['deepEqual(x, y)'],
+  description: 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',
+  examples: ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js
new file mode 100644
index 0000000..e0c956d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js
@@ -0,0 +1,8 @@
+export var equalDocs = {
+  name: 'equal',
+  category: 'Relational',
+  syntax: ['x == y', 'equal(x, y)'],
+  description: 'Check equality of two values. Returns true if the values are equal, and false if not.',
+  examples: ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],
+  seealso: ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js
new file mode 100644
index 0000000..f02230e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js
@@ -0,0 +1,8 @@
+export var equalTextDocs = {
+  name: 'equalText',
+  category: 'Relational',
+  syntax: ['equalText(x, y)'],
+  description: 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',
+  examples: ['equalText("Hello", "Hello")', 'equalText("a", "A")', 'equal("2e3", "2000")', 'equalText("2e3", "2000")', 'equalText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural', 'compareText', 'equal']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js
new file mode 100644
index 0000000..355fcb7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js
@@ -0,0 +1,8 @@
+export var largerDocs = {
+  name: 'larger',
+  category: 'Relational',
+  syntax: ['x > y', 'larger(x, y)'],
+  description: 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.',
+  examples: ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js
new file mode 100644
index 0000000..22fc8e2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js
@@ -0,0 +1,8 @@
+export var largerEqDocs = {
+  name: 'largerEq',
+  category: 'Relational',
+  syntax: ['x >= y', 'largerEq(x, y)'],
+  description: 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',
+  examples: ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],
+  seealso: ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js
new file mode 100644
index 0000000..7776324
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js
@@ -0,0 +1,8 @@
+export var smallerDocs = {
+  name: 'smaller',
+  category: 'Relational',
+  syntax: ['x < y', 'smaller(x, y)'],
+  description: 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.',
+  examples: ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],
+  seealso: ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js
new file mode 100644
index 0000000..c0a7b0a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js
@@ -0,0 +1,8 @@
+export var smallerEqDocs = {
+  name: 'smallerEq',
+  category: 'Relational',
+  syntax: ['x <= y', 'smallerEq(x, y)'],
+  description: 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',
+  examples: ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],
+  seealso: ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js
new file mode 100644
index 0000000..df7b95b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js
@@ -0,0 +1,8 @@
+export var unequalDocs = {
+  name: 'unequal',
+  category: 'Relational',
+  syntax: ['x != y', 'unequal(x, y)'],
+  description: 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',
+  examples: ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],
+  seealso: ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js
new file mode 100644
index 0000000..2c80f7b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js
@@ -0,0 +1,8 @@
+export var setCartesianDocs = {
+  name: 'setCartesian',
+  category: 'Set',
+  syntax: ['setCartesian(set1, set2)'],
+  description: 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.',
+  examples: ['setCartesian([1, 2], [3, 4])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js
new file mode 100644
index 0000000..844f47b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js
@@ -0,0 +1,8 @@
+export var setDifferenceDocs = {
+  name: 'setDifference',
+  category: 'Set',
+  syntax: ['setDifference(set1, set2)'],
+  description: 'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setSymDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js
new file mode 100644
index 0000000..50d839e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js
@@ -0,0 +1,8 @@
+export var setDistinctDocs = {
+  name: 'setDistinct',
+  category: 'Set',
+  syntax: ['setDistinct(set)'],
+  description: 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setDistinct([1, 1, 1, 2, 2, 3])'],
+  seealso: ['setMultiplicity']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js
new file mode 100644
index 0000000..b8dd9eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js
@@ -0,0 +1,8 @@
+export var setIntersectDocs = {
+  name: 'setIntersect',
+  category: 'Set',
+  syntax: ['setIntersect(set1, set2)'],
+  description: 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js
new file mode 100644
index 0000000..095c83f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js
@@ -0,0 +1,8 @@
+export var setIsSubsetDocs = {
+  name: 'setIsSubset',
+  category: 'Set',
+  syntax: ['setIsSubset(set1, set2)'],
+  description: 'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js
new file mode 100644
index 0000000..8ad1670
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js
@@ -0,0 +1,8 @@
+export var setMultiplicityDocs = {
+  name: 'setMultiplicity',
+  category: 'Set',
+  syntax: ['setMultiplicity(element, set)'],
+  description: 'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],
+  seealso: ['setDistinct', 'setSize']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js
new file mode 100644
index 0000000..b868e6e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js
@@ -0,0 +1,8 @@
+export var setPowersetDocs = {
+  name: 'setPowerset',
+  category: 'Set',
+  syntax: ['setPowerset(set)'],
+  description: 'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setPowerset([1, 2, 3])'],
+  seealso: ['setCartesian']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js
new file mode 100644
index 0000000..dbeff60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js
@@ -0,0 +1,8 @@
+export var setSizeDocs = {
+  name: 'setSize',
+  category: 'Set',
+  syntax: ['setSize(set)', 'setSize(set, unique)'],
+  description: 'Count the number of elements of a (multi)set. When the second parameter "unique" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js
new file mode 100644
index 0000000..f3bdcd6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js
@@ -0,0 +1,8 @@
+export var setSymDifferenceDocs = {
+  name: 'setSymDifference',
+  category: 'Set',
+  syntax: ['setSymDifference(set1, set2)'],
+  description: 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js
new file mode 100644
index 0000000..fadee5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js
@@ -0,0 +1,8 @@
+export var setUnionDocs = {
+  name: 'setUnion',
+  category: 'Set',
+  syntax: ['setUnion(set1, set2)'],
+  description: 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js
new file mode 100644
index 0000000..2a2f63b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js
@@ -0,0 +1,8 @@
+export var erfDocs = {
+  name: 'erf',
+  category: 'Special',
+  syntax: ['erf(x)'],
+  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',
+  examples: ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/cumsum.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/cumsum.js
new file mode 100644
index 0000000..18c3556
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/cumsum.js
@@ -0,0 +1,8 @@
+export var cumSumDocs = {
+  name: 'cumsum',
+  category: 'Statistics',
+  syntax: ['cumsum(a, b, c, ...)', 'cumsum(A)'],
+  description: 'Compute the cumulative sum of all values.',
+  examples: ['cumsum(2, 3, 4, 1)', 'cumsum([2, 3, 4, 1])', 'cumsum([1, 2; 3, 4])', 'cumsum([1, 2; 3, 4], 1)', 'cumsum([1, 2; 3, 4], 2)'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js
new file mode 100644
index 0000000..3ad0341
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js
@@ -0,0 +1,8 @@
+export var madDocs = {
+  name: 'mad',
+  category: 'Statistics',
+  syntax: ['mad(a, b, c, ...)', 'mad(A)'],
+  description: 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',
+  examples: ['mad(10, 20, 30)', 'mad([1, 2, 3])'],
+  seealso: ['mean', 'median', 'std', 'abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js
new file mode 100644
index 0000000..e22570c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js
@@ -0,0 +1,8 @@
+export var maxDocs = {
+  name: 'max',
+  category: 'Statistics',
+  syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dim)'],
+  description: 'Compute the maximum value of a list of values.',
+  examples: ['max(2, 3, 4, 1)', 'max([2, 3, 4, 1])', 'max([2, 5; 4, 3])', 'max([2, 5; 4, 3], 1)', 'max([2, 5; 4, 3], 2)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js
new file mode 100644
index 0000000..994b102
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js
@@ -0,0 +1,8 @@
+export var meanDocs = {
+  name: 'mean',
+  category: 'Statistics',
+  syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dim)'],
+  description: 'Compute the arithmetic mean of a list of values.',
+  examples: ['mean(2, 3, 4, 1)', 'mean([2, 3, 4, 1])', 'mean([2, 5; 4, 3])', 'mean([2, 5; 4, 3], 1)', 'mean([2, 5; 4, 3], 2)', 'mean([1.0, 2.7, 3.2, 4.0])'],
+  seealso: ['max', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js
new file mode 100644
index 0000000..7461756
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js
@@ -0,0 +1,8 @@
+export var medianDocs = {
+  name: 'median',
+  category: 'Statistics',
+  syntax: ['median(a, b, c, ...)', 'median(A)'],
+  description: 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',
+  examples: ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],
+  seealso: ['max', 'mean', 'min', 'prod', 'std', 'sum', 'variance', 'quantileSeq']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js
new file mode 100644
index 0000000..90bd2f9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js
@@ -0,0 +1,8 @@
+export var minDocs = {
+  name: 'min',
+  category: 'Statistics',
+  syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dim)'],
+  description: 'Compute the minimum value of a list of values.',
+  examples: ['min(2, 3, 4, 1)', 'min([2, 3, 4, 1])', 'min([2, 5; 4, 3])', 'min([2, 5; 4, 3], 1)', 'min([2, 5; 4, 3], 2)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['max', 'mean', 'median', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js
new file mode 100644
index 0000000..e61e57c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js
@@ -0,0 +1,8 @@
+export var modeDocs = {
+  name: 'mode',
+  category: 'Statistics',
+  syntax: ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],
+  description: 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',
+  examples: ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js
new file mode 100644
index 0000000..7f86d23
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js
@@ -0,0 +1,8 @@
+export var prodDocs = {
+  name: 'prod',
+  category: 'Statistics',
+  syntax: ['prod(a, b, c, ...)', 'prod(A)'],
+  description: 'Compute the product of all values.',
+  examples: ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..2073fa3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js
@@ -0,0 +1,8 @@
+export var quantileSeqDocs = {
+  name: 'quantileSeq',
+  category: 'Statistics',
+  syntax: ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],
+  description: 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probablity are: Number, BigNumber. \n\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',
+  examples: ['quantileSeq([3, -1, 5, 7], 0.5)', 'quantileSeq([3, -1, 5, 7], [1/3, 2/3])', 'quantileSeq([3, -1, 5, 7], 2)', 'quantileSeq([-1, 3, 5, 7], 0.5, true)'],
+  seealso: ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js
new file mode 100644
index 0000000..e6cf0f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js
@@ -0,0 +1,8 @@
+export var stdDocs = {
+  name: 'std',
+  category: 'Statistics',
+  syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, normalization)'],
+  description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['std(2, 4, 6)', 'std([2, 4, 6, 8])', 'std([2, 4, 6, 8], "uncorrected")', 'std([2, 4, 6, 8], "biased")', 'std([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js
new file mode 100644
index 0000000..32fc7c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js
@@ -0,0 +1,8 @@
+export var sumDocs = {
+  name: 'sum',
+  category: 'Statistics',
+  syntax: ['sum(a, b, c, ...)', 'sum(A)'],
+  description: 'Compute the sum of all values.',
+  examples: ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js
new file mode 100644
index 0000000..5f93a75
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js
@@ -0,0 +1,8 @@
+export var varianceDocs = {
+  name: 'variance',
+  category: 'Statistics',
+  syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, normalization)'],
+  description: 'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['variance(2, 4, 6)', 'variance([2, 4, 6, 8])', 'variance([2, 4, 6, 8], "uncorrected")', 'variance([2, 4, 6, 8], "biased")', 'variance([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js
new file mode 100644
index 0000000..f2aafc9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js
@@ -0,0 +1,8 @@
+export var acosDocs = {
+  name: 'acos',
+  category: 'Trigonometry',
+  syntax: ['acos(x)'],
+  description: 'Compute the inverse cosine of a value in radians.',
+  examples: ['acos(0.5)', 'acos(cos(2.3))'],
+  seealso: ['cos', 'atan', 'asin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js
new file mode 100644
index 0000000..e8be448
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js
@@ -0,0 +1,8 @@
+export var acoshDocs = {
+  name: 'acosh',
+  category: 'Trigonometry',
+  syntax: ['acosh(x)'],
+  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',
+  examples: ['acosh(1.5)'],
+  seealso: ['cosh', 'asinh', 'atanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js
new file mode 100644
index 0000000..96dc7df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js
@@ -0,0 +1,8 @@
+export var acotDocs = {
+  name: 'acot',
+  category: 'Trigonometry',
+  syntax: ['acot(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],
+  seealso: ['cot', 'atan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js
new file mode 100644
index 0000000..060d929
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js
@@ -0,0 +1,8 @@
+export var acothDocs = {
+  name: 'acoth',
+  category: 'Trigonometry',
+  syntax: ['acoth(x)'],
+  description: 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',
+  examples: ['acoth(2)', 'acoth(0.5)'],
+  seealso: ['acsch', 'asech']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js
new file mode 100644
index 0000000..9d93a03
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js
@@ -0,0 +1,8 @@
+export var acscDocs = {
+  name: 'acsc',
+  category: 'Trigonometry',
+  syntax: ['acsc(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],
+  seealso: ['csc', 'asin', 'asec']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js
new file mode 100644
index 0000000..1fab3ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js
@@ -0,0 +1,8 @@
+export var acschDocs = {
+  name: 'acsch',
+  category: 'Trigonometry',
+  syntax: ['acsch(x)'],
+  description: 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',
+  examples: ['acsch(0.5)'],
+  seealso: ['asech', 'acoth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js
new file mode 100644
index 0000000..2b3a0c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js
@@ -0,0 +1,8 @@
+export var asecDocs = {
+  name: 'asec',
+  category: 'Trigonometry',
+  syntax: ['asec(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],
+  seealso: ['acos', 'acot', 'acsc']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js
new file mode 100644
index 0000000..ed223d8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js
@@ -0,0 +1,8 @@
+export var asechDocs = {
+  name: 'asech',
+  category: 'Trigonometry',
+  syntax: ['asech(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asech(0.5)'],
+  seealso: ['acsch', 'acoth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js
new file mode 100644
index 0000000..4d956e9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js
@@ -0,0 +1,8 @@
+export var asinDocs = {
+  name: 'asin',
+  category: 'Trigonometry',
+  syntax: ['asin(x)'],
+  description: 'Compute the inverse sine of a value in radians.',
+  examples: ['asin(0.5)', 'asin(sin(0.5))'],
+  seealso: ['sin', 'acos', 'atan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js
new file mode 100644
index 0000000..ae60da9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js
@@ -0,0 +1,8 @@
+export var asinhDocs = {
+  name: 'asinh',
+  category: 'Trigonometry',
+  syntax: ['asinh(x)'],
+  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',
+  examples: ['asinh(0.5)'],
+  seealso: ['acosh', 'atanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js
new file mode 100644
index 0000000..3b94dc6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js
@@ -0,0 +1,8 @@
+export var atanDocs = {
+  name: 'atan',
+  category: 'Trigonometry',
+  syntax: ['atan(x)'],
+  description: 'Compute the inverse tangent of a value in radians.',
+  examples: ['atan(0.5)', 'atan(tan(0.5))'],
+  seealso: ['tan', 'acos', 'asin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js
new file mode 100644
index 0000000..2489919
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js
@@ -0,0 +1,8 @@
+export var atan2Docs = {
+  name: 'atan2',
+  category: 'Trigonometry',
+  syntax: ['atan2(y, x)'],
+  description: 'Computes the principal value of the arc tangent of y/x in radians.',
+  examples: ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],
+  seealso: ['sin', 'cos', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js
new file mode 100644
index 0000000..3065fd7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js
@@ -0,0 +1,8 @@
+export var atanhDocs = {
+  name: 'atanh',
+  category: 'Trigonometry',
+  syntax: ['atanh(x)'],
+  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',
+  examples: ['atanh(0.5)'],
+  seealso: ['acosh', 'asinh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js
new file mode 100644
index 0000000..6fecbbc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js
@@ -0,0 +1,8 @@
+export var cosDocs = {
+  name: 'cos',
+  category: 'Trigonometry',
+  syntax: ['cos(x)'],
+  description: 'Compute the cosine of x in radians.',
+  examples: ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['acos', 'sin', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js
new file mode 100644
index 0000000..b9b6a81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js
@@ -0,0 +1,8 @@
+export var coshDocs = {
+  name: 'cosh',
+  category: 'Trigonometry',
+  syntax: ['cosh(x)'],
+  description: 'Compute the hyperbolic cosine of x in radians.',
+  examples: ['cosh(0.5)'],
+  seealso: ['sinh', 'tanh', 'coth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js
new file mode 100644
index 0000000..3b48e1f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js
@@ -0,0 +1,8 @@
+export var cotDocs = {
+  name: 'cot',
+  category: 'Trigonometry',
+  syntax: ['cot(x)'],
+  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',
+  examples: ['cot(2)', '1 / tan(2)'],
+  seealso: ['sec', 'csc', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js
new file mode 100644
index 0000000..605e125
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js
@@ -0,0 +1,8 @@
+export var cothDocs = {
+  name: 'coth',
+  category: 'Trigonometry',
+  syntax: ['coth(x)'],
+  description: 'Compute the hyperbolic cotangent of x in radians.',
+  examples: ['coth(2)', '1 / tanh(2)'],
+  seealso: ['sech', 'csch', 'tanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js
new file mode 100644
index 0000000..0ab3e1d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js
@@ -0,0 +1,8 @@
+export var cscDocs = {
+  name: 'csc',
+  category: 'Trigonometry',
+  syntax: ['csc(x)'],
+  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',
+  examples: ['csc(2)', '1 / sin(2)'],
+  seealso: ['sec', 'cot', 'sin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js
new file mode 100644
index 0000000..7c1e0f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js
@@ -0,0 +1,8 @@
+export var cschDocs = {
+  name: 'csch',
+  category: 'Trigonometry',
+  syntax: ['csch(x)'],
+  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',
+  examples: ['csch(2)', '1 / sinh(2)'],
+  seealso: ['sech', 'coth', 'sinh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js
new file mode 100644
index 0000000..68e37dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js
@@ -0,0 +1,8 @@
+export var secDocs = {
+  name: 'sec',
+  category: 'Trigonometry',
+  syntax: ['sec(x)'],
+  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',
+  examples: ['sec(2)', '1 / cos(2)'],
+  seealso: ['cot', 'csc', 'cos']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js
new file mode 100644
index 0000000..3a51e19
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js
@@ -0,0 +1,8 @@
+export var sechDocs = {
+  name: 'sech',
+  category: 'Trigonometry',
+  syntax: ['sech(x)'],
+  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',
+  examples: ['sech(2)', '1 / cosh(2)'],
+  seealso: ['coth', 'csch', 'cosh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js
new file mode 100644
index 0000000..79de9f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js
@@ -0,0 +1,8 @@
+export var sinDocs = {
+  name: 'sin',
+  category: 'Trigonometry',
+  syntax: ['sin(x)'],
+  description: 'Compute the sine of x in radians.',
+  examples: ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['asin', 'cos', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js
new file mode 100644
index 0000000..4656c82
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js
@@ -0,0 +1,8 @@
+export var sinhDocs = {
+  name: 'sinh',
+  category: 'Trigonometry',
+  syntax: ['sinh(x)'],
+  description: 'Compute the hyperbolic sine of x in radians.',
+  examples: ['sinh(0.5)'],
+  seealso: ['cosh', 'tanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js
new file mode 100644
index 0000000..0a96d8e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js
@@ -0,0 +1,8 @@
+export var tanDocs = {
+  name: 'tan',
+  category: 'Trigonometry',
+  syntax: ['tan(x)'],
+  description: 'Compute the tangent of x in radians.',
+  examples: ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],
+  seealso: ['atan', 'sin', 'cos']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js
new file mode 100644
index 0000000..61cf2dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js
@@ -0,0 +1,8 @@
+export var tanhDocs = {
+  name: 'tanh',
+  category: 'Trigonometry',
+  syntax: ['tanh(x)'],
+  description: 'Compute the hyperbolic tangent of x in radians.',
+  examples: ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],
+  seealso: ['sinh', 'cosh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js
new file mode 100644
index 0000000..090ebee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js
@@ -0,0 +1,8 @@
+export var toDocs = {
+  name: 'to',
+  category: 'Units',
+  syntax: ['x to unit', 'to(x, unit)'],
+  description: 'Change the unit of a value.',
+  examples: ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js
new file mode 100644
index 0000000..e7f1ac2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js
@@ -0,0 +1,8 @@
+export var binDocs = {
+  name: 'bin',
+  category: 'Utils',
+  syntax: ['bin(value)'],
+  description: 'Format a number as binary',
+  examples: ['bin(2)'],
+  seealso: ['oct', 'hex']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js
new file mode 100644
index 0000000..c5a444b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js
@@ -0,0 +1,8 @@
+export var cloneDocs = {
+  name: 'clone',
+  category: 'Utils',
+  syntax: ['clone(x)'],
+  description: 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices',
+  examples: ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone("hello world")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js
new file mode 100644
index 0000000..a2d5544
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js
@@ -0,0 +1,8 @@
+export var formatDocs = {
+  name: 'format',
+  category: 'Utils',
+  syntax: ['format(value)', 'format(value, precision)'],
+  description: 'Format a value of any type as string.',
+  examples: ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],
+  seealso: ['print']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..fdc397c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js
@@ -0,0 +1,8 @@
+export var hasNumericValueDocs = {
+  name: 'hasNumericValue',
+  category: 'Utils',
+  syntax: ['hasNumericValue(x)'],
+  description: 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',
+  examples: ['hasNumericValue(2)', 'hasNumericValue("2")', 'isNumeric("2")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js
new file mode 100644
index 0000000..9764dc4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js
@@ -0,0 +1,8 @@
+export var hexDocs = {
+  name: 'hex',
+  category: 'Utils',
+  syntax: ['hex(value)'],
+  description: 'Format a number as hexadecimal',
+  examples: ['hex(240)'],
+  seealso: ['bin', 'oct']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js
new file mode 100644
index 0000000..5b87586
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js
@@ -0,0 +1,8 @@
+export var isIntegerDocs = {
+  name: 'isInteger',
+  category: 'Utils',
+  syntax: ['isInteger(x)'],
+  description: 'Test whether a value is an integer number.',
+  examples: ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js
new file mode 100644
index 0000000..87bc055
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js
@@ -0,0 +1,8 @@
+export var isNaNDocs = {
+  name: 'isNaN',
+  category: 'Utils',
+  syntax: ['isNaN(x)'],
+  description: 'Test whether a value is NaN (not a number)',
+  examples: ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js
new file mode 100644
index 0000000..a0f90c5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js
@@ -0,0 +1,8 @@
+export var isNegativeDocs = {
+  name: 'isNegative',
+  category: 'Utils',
+  syntax: ['isNegative(x)'],
+  description: 'Test whether a value is negative: smaller than zero.',
+  examples: ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js
new file mode 100644
index 0000000..9ecb3d3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js
@@ -0,0 +1,8 @@
+export var isNumericDocs = {
+  name: 'isNumeric',
+  category: 'Utils',
+  syntax: ['isNumeric(x)'],
+  description: 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',
+  examples: ['isNumeric(2)', 'isNumeric("2")', 'hasNumericValue("2")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js
new file mode 100644
index 0000000..3af6886
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js
@@ -0,0 +1,8 @@
+export var isPositiveDocs = {
+  name: 'isPositive',
+  category: 'Utils',
+  syntax: ['isPositive(x)'],
+  description: 'Test whether a value is positive: larger than zero.',
+  examples: ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js
new file mode 100644
index 0000000..a46ed17
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js
@@ -0,0 +1,8 @@
+export var isPrimeDocs = {
+  name: 'isPrime',
+  category: 'Utils',
+  syntax: ['isPrime(x)'],
+  description: 'Test whether a value is prime: has no divisors other than itself and one.',
+  examples: ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js
new file mode 100644
index 0000000..3e08770
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js
@@ -0,0 +1,8 @@
+export var isZeroDocs = {
+  name: 'isZero',
+  category: 'Utils',
+  syntax: ['isZero(x)'],
+  description: 'Test whether a value is zero.',
+  examples: ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js
new file mode 100644
index 0000000..e4ee297
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js
@@ -0,0 +1,8 @@
+export var numericDocs = {
+  name: 'numeric',
+  category: 'Utils',
+  syntax: ['numeric(x)'],
+  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.',
+  examples: ['numeric("4")', 'numeric("4", "number")', 'numeric("4", "BigNumber")', 'numeric("4", "Fraction)', 'numeric(4, "Fraction")', 'numeric(fraction(2, 5), "number)'],
+  seealso: ['number', 'fraction', 'bignumber', 'string', 'format']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js
new file mode 100644
index 0000000..535a28b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js
@@ -0,0 +1,8 @@
+export var octDocs = {
+  name: 'oct',
+  category: 'Utils',
+  syntax: ['oct(value)'],
+  description: 'Format a number as octal',
+  examples: ['oct(56)'],
+  seealso: ['bin', 'hex']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/print.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/print.js
new file mode 100644
index 0000000..6cd6956
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/print.js
@@ -0,0 +1,8 @@
+export var printDocs = {
+  name: 'print',
+  category: 'Utils',
+  syntax: ['print(template, values)', 'print(template, values, precision)'],
+  description: 'Interpolate values into a string template.',
+  examples: ['print("Lucy is $age years old", {age: 5})', 'print("The value of pi is $pi", {pi: pi}, 3)', 'print("Hello, $user.name!", {user: {name: "John"}})', 'print("Values: $0, $1, $2", [6, 9, 4])'],
+  seealso: ['format']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js
new file mode 100644
index 0000000..91629c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js
@@ -0,0 +1,8 @@
+export var typeOfDocs = {
+  name: 'typeOf',
+  category: 'Utils',
+  syntax: ['typeOf(x)'],
+  description: 'Get the type of a variable.',
+  examples: ['typeOf(3.5)', 'typeOf(2 - 4i)', 'typeOf(45 deg)', 'typeOf("hello world")'],
+  seealso: ['getMatrixDataType']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/compile.js b/node_modules/mathjs/lib/esm/expression/function/compile.js
new file mode 100644
index 0000000..99b489a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/compile.js
@@ -0,0 +1,55 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'compile';
+var dependencies = ['typed', 'parse'];
+export var createCompile = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    parse
+  } = _ref;
+
+  /**
+   * Parse and compile an expression.
+   * Returns a an object with a function `evaluate([scope])` to evaluate the
+   * compiled expression.
+   *
+   * Syntax:
+   *
+   *     math.compile(expr)                       // returns one node
+   *     math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes
+   *
+   * Examples:
+   *
+   *     const code1 = math.compile('sqrt(3^2 + 4^2)')
+   *     code1.evaluate() // 5
+   *
+   *     let scope = {a: 3, b: 4}
+   *     const code2 = math.compile('a * b') // 12
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].evaluate() // 12
+   *
+   * See also:
+   *
+   *    parse, evaluate
+   *
+   * @param {string | string[] | Array | Matrix} expr
+   *            The expression to be compiled
+   * @return {{evaluate: Function} | Array.<{evaluate: Function}>} code
+   *            An object with the compiled expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function string(expr) {
+      return parse(expr).compile();
+    },
+    'Array | Matrix': function ArrayMatrix(expr) {
+      return deepMap(expr, function (entry) {
+        return parse(entry).compile();
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/evaluate.js b/node_modules/mathjs/lib/esm/expression/function/evaluate.js
new file mode 100644
index 0000000..ca3b0e3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/evaluate.js
@@ -0,0 +1,64 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { createEmptyMap } from '../../utils/map.js';
+var name = 'evaluate';
+var dependencies = ['typed', 'parse'];
+export var createEvaluate = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    parse
+  } = _ref;
+
+  /**
+   * Evaluate an expression.
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.evaluate(expr)
+   *     math.evaluate(expr, scope)
+   *     math.evaluate([expr1, expr2, expr3, ...])
+   *     math.evaluate([expr1, expr2, expr3, ...], scope)
+   *
+   * Example:
+   *
+   *     math.evaluate('(2+3)/4')                // 1.25
+   *     math.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *     math.evaluate('sqrt(-4)')               // 2i
+   *     math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]
+   *
+   *     let scope = {a:3, b:4}
+   *     math.evaluate('a * b', scope)           // 12
+   *
+   * See also:
+   *
+   *    parse, compile
+   *
+   * @param {string | string[] | Matrix} expr   The expression to be evaluated
+   * @param {Object} [scope]                    Scope to read/write variables
+   * @return {*} The result of the expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function string(expr) {
+      var scope = createEmptyMap();
+      return parse(expr).compile().evaluate(scope);
+    },
+    'string, Map | Object': function stringMapObject(expr, scope) {
+      return parse(expr).compile().evaluate(scope);
+    },
+    'Array | Matrix': function ArrayMatrix(expr) {
+      var scope = createEmptyMap();
+      return deepMap(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    },
+    'Array | Matrix, Map | Object': function ArrayMatrixMapObject(expr, scope) {
+      return deepMap(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/help.js b/node_modules/mathjs/lib/esm/expression/function/help.js
new file mode 100644
index 0000000..eada1a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/help.js
@@ -0,0 +1,71 @@
+import { factory } from '../../utils/factory.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { embeddedDocs } from '../embeddedDocs/embeddedDocs.js';
+import { hasOwnProperty } from '../../utils/object.js';
+var name = 'help';
+var dependencies = ['typed', 'mathWithTransform', 'Help'];
+export var createHelp = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    mathWithTransform,
+    Help
+  } = _ref;
+
+  /**
+   * Retrieve help on a function or data type.
+   * Help files are retrieved from the embedded documentation in math.docs.
+   *
+   * Syntax:
+   *
+   *    math.help(search)
+   *
+   * Examples:
+   *
+   *    console.log(math.help('sin').toString())
+   *    console.log(math.help(math.add).toString())
+   *    console.log(math.help(math.add).toJSON())
+   *
+   * @param {Function | string | Object} search   A function or function name
+   *                                              for which to get help
+   * @return {Help} A help object
+   */
+  return typed(name, {
+    any: function any(search) {
+      var prop;
+      var searchName = search;
+
+      if (typeof search !== 'string') {
+        for (prop in mathWithTransform) {
+          // search in functions and constants
+          if (hasOwnProperty(mathWithTransform, prop) && search === mathWithTransform[prop]) {
+            searchName = prop;
+            break;
+          }
+        }
+        /* TODO: implement help for data types
+         if (!text) {
+         // search data type
+         for (prop in math.type) {
+         if (hasOwnProperty(math, prop)) {
+         if (search === math.type[prop]) {
+         text = prop
+         break
+         }
+         }
+         }
+         }
+         */
+
+      }
+
+      var doc = getSafeProperty(embeddedDocs, searchName);
+
+      if (!doc) {
+        var searchText = typeof searchName === 'function' ? searchName.name : searchName;
+        throw new Error('No documentation found on "' + searchText + '"');
+      }
+
+      return new Help(doc);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/parser.js b/node_modules/mathjs/lib/esm/expression/function/parser.js
new file mode 100644
index 0000000..0f13b33
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/parser.js
@@ -0,0 +1,58 @@
+import { factory } from '../../utils/factory.js';
+var name = 'parser';
+var dependencies = ['typed', 'Parser'];
+export var createParser = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Parser
+  } = _ref;
+
+  /**
+   * Create a parser. The function creates a new `math.Parser` object.
+   *
+   * Syntax:
+   *
+   *    math.parser()
+   *
+   * Examples:
+   *
+   *     const parser = new math.parser()
+   *
+   *     // evaluate expressions
+   *     const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5
+   *     const b = parser.evaluate('sqrt(-4)')        // 2i
+   *     const c = parser.evaluate('2 inch in cm')    // 5.08 cm
+   *     const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476
+   *
+   *     // define variables and functions
+   *     parser.evaluate('x = 7 / 2')             // 3.5
+   *     parser.evaluate('x + 3')                 // 6.5
+   *     parser.evaluate('f(x, y) = x^y')         // f(x, y)
+   *     parser.evaluate('f(2, 3)')               // 8
+   *
+   *     // get and set variables and functions
+   *     const x = parser.get('x')                // 7
+   *     const f = parser.get('f')                // function
+   *     const g = f(3, 2)                        // 9
+   *     parser.set('h', 500)
+   *     const i = parser.evaluate('h / 2')       // 250
+   *     parser.set('hello', function (name) {
+   *       return 'hello, ' + name + '!'
+   *     })
+   *     parser.evaluate('hello("user")')         // "hello, user!"
+   *
+   *     // clear defined functions and variables
+   *     parser.clear()
+   *
+   * See also:
+   *
+   *    evaluate, compile, parse
+   *
+   * @return {Parser} Parser
+   */
+  return typed(name, {
+    '': function _() {
+      return new Parser();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/keywords.js b/node_modules/mathjs/lib/esm/expression/keywords.js
new file mode 100644
index 0000000..4ab02b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/keywords.js
@@ -0,0 +1,2 @@
+// Reserved keywords not allowed to use in the parser
+export var keywords = new Set(['end']);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js b/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js
new file mode 100644
index 0000000..f207abd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js
@@ -0,0 +1,210 @@
+import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isNode, isObjectNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { accessFactory } from './utils/access.js';
+var name = 'AccessorNode';
+var dependencies = ['subset', 'Node'];
+export var createAccessorNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    subset,
+    Node
+  } = _ref;
+  var access = accessFactory({
+    subset
+  });
+  /**
+   * @constructor AccessorNode
+   * @extends {Node}
+   * Access an object property or get a matrix subset
+   *
+   * @param {Node} object                 The object from which to retrieve
+   *                                      a property or subset.
+   * @param {IndexNode} index             IndexNode containing ranges
+   */
+
+  function AccessorNode(object, index) {
+    if (!(this instanceof AccessorNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!isNode(object)) {
+      throw new TypeError('Node expected for parameter "object"');
+    }
+
+    if (!isIndexNode(index)) {
+      throw new TypeError('IndexNode expected for parameter "index"');
+    }
+
+    this.object = object || null;
+    this.index = index; // readonly property name
+
+    Object.defineProperty(this, 'name', {
+      get: function () {
+        if (this.index) {
+          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+        } else {
+          return this.object.name || '';
+        }
+      }.bind(this),
+      set: function set() {
+        throw new Error('Cannot assign a new name, name is read-only');
+      }
+    });
+  }
+
+  AccessorNode.prototype = new Node();
+  AccessorNode.prototype.type = 'AccessorNode';
+  AccessorNode.prototype.isAccessorNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  AccessorNode.prototype._compile = function (math, argNames) {
+    var evalObject = this.object._compile(math, argNames);
+
+    var evalIndex = this.index._compile(math, argNames);
+
+    if (this.index.isObjectProperty()) {
+      var prop = this.index.getObjectProperty();
+      return function evalAccessorNode(scope, args, context) {
+        // get a property from an object evaluated using the scope.
+        return getSafeProperty(evalObject(scope, args, context), prop);
+      };
+    } else {
+      return function evalAccessorNode(scope, args, context) {
+        var object = evalObject(scope, args, context);
+        var index = evalIndex(scope, args, object); // we pass object here instead of context
+
+        return access(object, index);
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  AccessorNode.prototype.forEach = function (callback) {
+    callback(this.object, 'object', this);
+    callback(this.index, 'index', this);
+  };
+  /**
+   * Create a new AccessorNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {AccessorNode} Returns a transformed copy of the node
+   */
+
+
+  AccessorNode.prototype.map = function (callback) {
+    return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {AccessorNode}
+   */
+
+
+  AccessorNode.prototype.clone = function () {
+    return new AccessorNode(this.object, this.index);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AccessorNode.prototype._toString = function (options) {
+    var object = this.object.toString(options);
+
+    if (needParenthesis(this.object)) {
+      object = '(' + object + ')';
+    }
+
+    return object + this.index.toString(options);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AccessorNode.prototype.toHTML = function (options) {
+    var object = this.object.toHTML(options);
+
+    if (needParenthesis(this.object)) {
+      object = '<span class="math-parenthesis math-round-parenthesis">(</span>' + object + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return object + this.index.toHTML(options);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AccessorNode.prototype._toTex = function (options) {
+    var object = this.object.toTex(options);
+
+    if (needParenthesis(this.object)) {
+      object = '\\left(\' + object + \'\\right)';
+    }
+
+    return object + this.index.toTex(options);
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  AccessorNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'AccessorNode',
+      object: this.object,
+      index: this.index
+    };
+  };
+  /**
+   * Instantiate an AccessorNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "AccessorNode", object: ..., index: ...}`,
+   *                       where mathjs is optional
+   * @returns {AccessorNode}
+   */
+
+
+  AccessorNode.fromJSON = function (json) {
+    return new AccessorNode(json.object, json.index);
+  };
+  /**
+   * Are parenthesis needed?
+   * @private
+   */
+
+
+  function needParenthesis(node) {
+    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?
+    return !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));
+  }
+
+  return AccessorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js b/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js
new file mode 100644
index 0000000..26d360a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js
@@ -0,0 +1,186 @@
+import { isArrayNode, isNode } from '../../utils/is.js';
+import { map } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ArrayNode';
+var dependencies = ['Node'];
+export var createArrayNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * @constructor ArrayNode
+   * @extends {Node}
+   * Holds an 1-dimensional array with items
+   * @param {Node[]} [items]   1 dimensional array with items
+   */
+  function ArrayNode(items) {
+    if (!(this instanceof ArrayNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.items = items || []; // validate input
+
+    if (!Array.isArray(this.items) || !this.items.every(isNode)) {
+      throw new TypeError('Array containing Nodes expected');
+    }
+  }
+
+  ArrayNode.prototype = new Node();
+  ArrayNode.prototype.type = 'ArrayNode';
+  ArrayNode.prototype.isArrayNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ArrayNode.prototype._compile = function (math, argNames) {
+    var evalItems = map(this.items, function (item) {
+      return item._compile(math, argNames);
+    });
+    var asMatrix = math.config.matrix !== 'Array';
+
+    if (asMatrix) {
+      var matrix = math.matrix;
+      return function evalArrayNode(scope, args, context) {
+        return matrix(map(evalItems, function (evalItem) {
+          return evalItem(scope, args, context);
+        }));
+      };
+    } else {
+      return function evalArrayNode(scope, args, context) {
+        return map(evalItems, function (evalItem) {
+          return evalItem(scope, args, context);
+        });
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ArrayNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.items.length; i++) {
+      var node = this.items[i];
+      callback(node, 'items[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new ArrayNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {ArrayNode} Returns a transformed copy of the node
+   */
+
+
+  ArrayNode.prototype.map = function (callback) {
+    var items = [];
+
+    for (var i = 0; i < this.items.length; i++) {
+      items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));
+    }
+
+    return new ArrayNode(items);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ArrayNode}
+   */
+
+
+  ArrayNode.prototype.clone = function () {
+    return new ArrayNode(this.items.slice(0));
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ArrayNode.prototype._toString = function (options) {
+    var items = this.items.map(function (node) {
+      return node.toString(options);
+    });
+    return '[' + items.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ArrayNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ArrayNode',
+      items: this.items
+    };
+  };
+  /**
+   * Instantiate an ArrayNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ArrayNode", items: [...]}`,
+   *                       where mathjs is optional
+   * @returns {ArrayNode}
+   */
+
+
+  ArrayNode.fromJSON = function (json) {
+    return new ArrayNode(json.items);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ArrayNode.prototype.toHTML = function (options) {
+    var items = this.items.map(function (node) {
+      return node.toHTML(options);
+    });
+    return '<span class="math-parenthesis math-square-parenthesis">[</span>' + items.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ArrayNode.prototype._toTex = function (options) {
+    function itemsToTex(items, nested) {
+      var mixedItems = items.some(isArrayNode) && !items.every(isArrayNode);
+      var itemsFormRow = nested || mixedItems;
+      var itemSep = itemsFormRow ? '&' : '\\\\';
+      var itemsTex = items.map(function (node) {
+        if (node.items) {
+          return itemsToTex(node.items, !nested);
+        } else {
+          return node.toTex(options);
+        }
+      }).join(itemSep);
+      return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\begin{bmatrix}' + itemsTex + '\\end{bmatrix}' : itemsTex;
+    }
+
+    return itemsToTex(this.items, false);
+  };
+
+  return ArrayNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js b/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js
new file mode 100644
index 0000000..592c3f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js
@@ -0,0 +1,327 @@
+import { isAccessorNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';
+import { getSafeProperty, setSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { accessFactory } from './utils/access.js';
+import { assignFactory } from './utils/assign.js';
+import { getPrecedence } from '../operators.js';
+var name = 'AssignmentNode';
+var dependencies = ['subset', '?matrix', // FIXME: should not be needed at all, should be handled by subset
+'Node'];
+export var createAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    subset,
+    matrix,
+    Node
+  } = _ref;
+  var access = accessFactory({
+    subset
+  });
+  var assign = assignFactory({
+    subset,
+    matrix
+  });
+  /**
+   * @constructor AssignmentNode
+   * @extends {Node}
+   *
+   * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or
+   * replace a subset of a matrix like `A[2,2]=42`.
+   *
+   * Syntax:
+   *
+   *     new AssignmentNode(symbol, value)
+   *     new AssignmentNode(object, index, value)
+   *
+   * Usage:
+   *
+   *    new AssignmentNode(new SymbolNode('a'), new ConstantNode(2))                       // a=2
+   *    new AssignmentNode(new SymbolNode('a'), new IndexNode('b'), new ConstantNode(2))   // a.b=2
+   *    new AssignmentNode(new SymbolNode('a'), new IndexNode(1, 2), new ConstantNode(3))  // a[1,2]=3
+   *
+   * @param {SymbolNode | AccessorNode} object  Object on which to assign a value
+   * @param {IndexNode} [index=null]            Index, property name or matrix
+   *                                            index. Optional. If not provided
+   *                                            and `object` is a SymbolNode,
+   *                                            the property is assigned to the
+   *                                            global scope.
+   * @param {Node} value                        The value to be assigned
+   */
+
+  function AssignmentNode(object, index, value) {
+    if (!(this instanceof AssignmentNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.object = object;
+    this.index = value ? index : null;
+    this.value = value || index; // validate input
+
+    if (!isSymbolNode(object) && !isAccessorNode(object)) {
+      throw new TypeError('SymbolNode or AccessorNode expected as "object"');
+    }
+
+    if (isSymbolNode(object) && object.name === 'end') {
+      throw new Error('Cannot assign to symbol "end"');
+    }
+
+    if (this.index && !isIndexNode(this.index)) {
+      // index is optional
+      throw new TypeError('IndexNode expected as "index"');
+    }
+
+    if (!isNode(this.value)) {
+      throw new TypeError('Node expected as "value"');
+    } // readonly property name
+
+
+    Object.defineProperty(this, 'name', {
+      get: function () {
+        if (this.index) {
+          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+        } else {
+          return this.object.name || '';
+        }
+      }.bind(this),
+      set: function set() {
+        throw new Error('Cannot assign a new name, name is read-only');
+      }
+    });
+  }
+
+  AssignmentNode.prototype = new Node();
+  AssignmentNode.prototype.type = 'AssignmentNode';
+  AssignmentNode.prototype.isAssignmentNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  AssignmentNode.prototype._compile = function (math, argNames) {
+    var evalObject = this.object._compile(math, argNames);
+
+    var evalIndex = this.index ? this.index._compile(math, argNames) : null;
+
+    var evalValue = this.value._compile(math, argNames);
+
+    var name = this.object.name;
+
+    if (!this.index) {
+      // apply a variable to the scope, for example `a=2`
+      if (!isSymbolNode(this.object)) {
+        throw new TypeError('SymbolNode expected as object');
+      }
+
+      return function evalAssignmentNode(scope, args, context) {
+        var value = evalValue(scope, args, context);
+        scope.set(name, value);
+        return value;
+      };
+    } else if (this.index.isObjectProperty()) {
+      // apply an object property for example `a.b=2`
+      var prop = this.index.getObjectProperty();
+      return function evalAssignmentNode(scope, args, context) {
+        var object = evalObject(scope, args, context);
+        var value = evalValue(scope, args, context);
+        setSafeProperty(object, prop, value);
+        return value;
+      };
+    } else if (isSymbolNode(this.object)) {
+      // update a matrix subset, for example `a[2]=3`
+      return function evalAssignmentNode(scope, args, context) {
+        var childObject = evalObject(scope, args, context);
+        var value = evalValue(scope, args, context);
+        var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context
+
+        scope.set(name, assign(childObject, index, value));
+        return value;
+      };
+    } else {
+      // isAccessorNode(node.object) === true
+      // update a matrix subset, for example `a.b[2]=3`
+      // we will not use the compile function of the AccessorNode, but compile it
+      // ourselves here as we need the parent object of the AccessorNode:
+      // wee need to apply the updated object to parent object
+      var evalParentObject = this.object.object._compile(math, argNames);
+
+      if (this.object.index.isObjectProperty()) {
+        var parentProp = this.object.index.getObjectProperty();
+        return function evalAssignmentNode(scope, args, context) {
+          var parent = evalParentObject(scope, args, context);
+          var childObject = getSafeProperty(parent, parentProp);
+          var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context
+
+          var value = evalValue(scope, args, context);
+          setSafeProperty(parent, parentProp, assign(childObject, index, value));
+          return value;
+        };
+      } else {
+        // if some parameters use the 'end' parameter, we need to calculate the size
+        var evalParentIndex = this.object.index._compile(math, argNames);
+
+        return function evalAssignmentNode(scope, args, context) {
+          var parent = evalParentObject(scope, args, context);
+          var parentIndex = evalParentIndex(scope, args, parent); // Important: we pass parent instead of context
+
+          var childObject = access(parent, parentIndex);
+          var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context
+
+          var value = evalValue(scope, args, context);
+          assign(parent, parentIndex, assign(childObject, index, value));
+          return value;
+        };
+      }
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  AssignmentNode.prototype.forEach = function (callback) {
+    callback(this.object, 'object', this);
+
+    if (this.index) {
+      callback(this.index, 'index', this);
+    }
+
+    callback(this.value, 'value', this);
+  };
+  /**
+   * Create a new AssignmentNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {AssignmentNode} Returns a transformed copy of the node
+   */
+
+
+  AssignmentNode.prototype.map = function (callback) {
+    var object = this._ifNode(callback(this.object, 'object', this));
+
+    var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;
+
+    var value = this._ifNode(callback(this.value, 'value', this));
+
+    return new AssignmentNode(object, index, value);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {AssignmentNode}
+   */
+
+
+  AssignmentNode.prototype.clone = function () {
+    return new AssignmentNode(this.object, this.index, this.value);
+  };
+  /*
+   * Is parenthesis needed?
+   * @param {node} node
+   * @param {string} [parenthesis='keep']
+   * @private
+   */
+
+
+  function needParenthesis(node, parenthesis) {
+    if (!parenthesis) {
+      parenthesis = 'keep';
+    }
+
+    var precedence = getPrecedence(node, parenthesis);
+    var exprPrecedence = getPrecedence(node.value, parenthesis);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AssignmentNode.prototype._toString = function (options) {
+    var object = this.object.toString(options);
+    var index = this.index ? this.index.toString(options) : '';
+    var value = this.value.toString(options);
+
+    if (needParenthesis(this, options && options.parenthesis)) {
+      value = '(' + value + ')';
+    }
+
+    return object + index + ' = ' + value;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  AssignmentNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'AssignmentNode',
+      object: this.object,
+      index: this.index,
+      value: this.value
+    };
+  };
+  /**
+   * Instantiate an AssignmentNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "AssignmentNode", object: ..., index: ..., value: ...}`,
+   *                       where mathjs is optional
+   * @returns {AssignmentNode}
+   */
+
+
+  AssignmentNode.fromJSON = function (json) {
+    return new AssignmentNode(json.object, json.index, json.value);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AssignmentNode.prototype.toHTML = function (options) {
+    var object = this.object.toHTML(options);
+    var index = this.index ? this.index.toHTML(options) : '';
+    var value = this.value.toHTML(options);
+
+    if (needParenthesis(this, options && options.parenthesis)) {
+      value = '<span class="math-paranthesis math-round-parenthesis">(</span>' + value + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+    }
+
+    return object + index + '<span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>' + value;
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string}
+   */
+
+
+  AssignmentNode.prototype._toTex = function (options) {
+    var object = this.object.toTex(options);
+    var index = this.index ? this.index.toTex(options) : '';
+    var value = this.value.toTex(options);
+
+    if (needParenthesis(this, options && options.parenthesis)) {
+      value = "\\left(".concat(value, "\\right)");
+    }
+
+    return object + index + ':=' + value;
+  };
+
+  return AssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/BlockNode.js b/node_modules/mathjs/lib/esm/expression/node/BlockNode.js
new file mode 100644
index 0000000..d79e231
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/BlockNode.js
@@ -0,0 +1,193 @@
+import { isNode } from '../../utils/is.js';
+import { forEach, map } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'BlockNode';
+var dependencies = ['ResultSet', 'Node'];
+export var createBlockNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    ResultSet,
+    Node
+  } = _ref;
+
+  /**
+   * @constructor BlockNode
+   * @extends {Node}
+   * Holds a set with blocks
+   * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks
+   *            An array with blocks, where a block is constructed as an Object
+   *            with properties block, which is a Node, and visible, which is
+   *            a boolean. The property visible is optional and is true by default
+   */
+  function BlockNode(blocks) {
+    if (!(this instanceof BlockNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input, copy blocks
+
+
+    if (!Array.isArray(blocks)) throw new Error('Array expected');
+    this.blocks = blocks.map(function (block) {
+      var node = block && block.node;
+      var visible = block && block.visible !== undefined ? block.visible : true;
+      if (!isNode(node)) throw new TypeError('Property "node" must be a Node');
+      if (typeof visible !== 'boolean') throw new TypeError('Property "visible" must be a boolean');
+      return {
+        node: node,
+        visible: visible
+      };
+    });
+  }
+
+  BlockNode.prototype = new Node();
+  BlockNode.prototype.type = 'BlockNode';
+  BlockNode.prototype.isBlockNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  BlockNode.prototype._compile = function (math, argNames) {
+    var evalBlocks = map(this.blocks, function (block) {
+      return {
+        evaluate: block.node._compile(math, argNames),
+        visible: block.visible
+      };
+    });
+    return function evalBlockNodes(scope, args, context) {
+      var results = [];
+      forEach(evalBlocks, function evalBlockNode(block) {
+        var result = block.evaluate(scope, args, context);
+
+        if (block.visible) {
+          results.push(result);
+        }
+      });
+      return new ResultSet(results);
+    };
+  };
+  /**
+   * Execute a callback for each of the child blocks of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  BlockNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.blocks.length; i++) {
+      callback(this.blocks[i].node, 'blocks[' + i + '].node', this);
+    }
+  };
+  /**
+   * Create a new BlockNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {BlockNode} Returns a transformed copy of the node
+   */
+
+
+  BlockNode.prototype.map = function (callback) {
+    var blocks = [];
+
+    for (var i = 0; i < this.blocks.length; i++) {
+      var block = this.blocks[i];
+
+      var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));
+
+      blocks[i] = {
+        node: node,
+        visible: block.visible
+      };
+    }
+
+    return new BlockNode(blocks);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {BlockNode}
+   */
+
+
+  BlockNode.prototype.clone = function () {
+    var blocks = this.blocks.map(function (block) {
+      return {
+        node: block.node,
+        visible: block.visible
+      };
+    });
+    return new BlockNode(blocks);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  BlockNode.prototype._toString = function (options) {
+    return this.blocks.map(function (param) {
+      return param.node.toString(options) + (param.visible ? '' : ';');
+    }).join('\n');
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  BlockNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'BlockNode',
+      blocks: this.blocks
+    };
+  };
+  /**
+   * Instantiate an BlockNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "BlockNode", blocks: [{node: ..., visible: false}, ...]}`,
+   *                       where mathjs is optional
+   * @returns {BlockNode}
+   */
+
+
+  BlockNode.fromJSON = function (json) {
+    return new BlockNode(json.blocks);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  BlockNode.prototype.toHTML = function (options) {
+    return this.blocks.map(function (param) {
+      return param.node.toHTML(options) + (param.visible ? '' : '<span class="math-separator">;</span>');
+    }).join('<span class="math-separator"><br /></span>');
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  BlockNode.prototype._toTex = function (options) {
+    return this.blocks.map(function (param) {
+      return param.node.toTex(options) + (param.visible ? '' : ';');
+    }).join('\\;\\;\n');
+  };
+
+  return BlockNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js b/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js
new file mode 100644
index 0000000..e4eda8a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js
@@ -0,0 +1,240 @@
+import { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { getPrecedence } from '../operators.js';
+var name = 'ConditionalNode';
+var dependencies = ['Node'];
+export var createConditionalNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'
+   *
+   * @param {Node} condition   Condition, must result in a boolean
+   * @param {Node} trueExpr    Expression evaluated when condition is true
+   * @param {Node} falseExpr   Expression evaluated when condition is true
+   *
+   * @constructor ConditionalNode
+   * @extends {Node}
+   */
+  function ConditionalNode(condition, trueExpr, falseExpr) {
+    if (!(this instanceof ConditionalNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!isNode(condition)) throw new TypeError('Parameter condition must be a Node');
+    if (!isNode(trueExpr)) throw new TypeError('Parameter trueExpr must be a Node');
+    if (!isNode(falseExpr)) throw new TypeError('Parameter falseExpr must be a Node');
+    this.condition = condition;
+    this.trueExpr = trueExpr;
+    this.falseExpr = falseExpr;
+  }
+
+  ConditionalNode.prototype = new Node();
+  ConditionalNode.prototype.type = 'ConditionalNode';
+  ConditionalNode.prototype.isConditionalNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ConditionalNode.prototype._compile = function (math, argNames) {
+    var evalCondition = this.condition._compile(math, argNames);
+
+    var evalTrueExpr = this.trueExpr._compile(math, argNames);
+
+    var evalFalseExpr = this.falseExpr._compile(math, argNames);
+
+    return function evalConditionalNode(scope, args, context) {
+      return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ConditionalNode.prototype.forEach = function (callback) {
+    callback(this.condition, 'condition', this);
+    callback(this.trueExpr, 'trueExpr', this);
+    callback(this.falseExpr, 'falseExpr', this);
+  };
+  /**
+   * Create a new ConditionalNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {ConditionalNode} Returns a transformed copy of the node
+   */
+
+
+  ConditionalNode.prototype.map = function (callback) {
+    return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ConditionalNode}
+   */
+
+
+  ConditionalNode.prototype.clone = function () {
+    return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConditionalNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode
+    // or have lower or equal precedence
+    // NOTE: enclosing all OperatorNodes in parentheses is a decision
+    // purely based on aesthetics and readability
+
+    var condition = this.condition.toString(options);
+    var conditionPrecedence = getPrecedence(this.condition, parenthesis);
+
+    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+      condition = '(' + condition + ')';
+    }
+
+    var trueExpr = this.trueExpr.toString(options);
+    var truePrecedence = getPrecedence(this.trueExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+      trueExpr = '(' + trueExpr + ')';
+    }
+
+    var falseExpr = this.falseExpr.toString(options);
+    var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+      falseExpr = '(' + falseExpr + ')';
+    }
+
+    return condition + ' ? ' + trueExpr + ' : ' + falseExpr;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ConditionalNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ConditionalNode',
+      condition: this.condition,
+      trueExpr: this.trueExpr,
+      falseExpr: this.falseExpr
+    };
+  };
+  /**
+   * Instantiate an ConditionalNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ConditionalNode", "condition": ..., "trueExpr": ..., "falseExpr": ...}`,
+   *                       where mathjs is optional
+   * @returns {ConditionalNode}
+   */
+
+
+  ConditionalNode.fromJSON = function (json) {
+    return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConditionalNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode
+    // or have lower or equal precedence
+    // NOTE: enclosing all OperatorNodes in parentheses is a decision
+    // purely based on aesthetics and readability
+
+    var condition = this.condition.toHTML(options);
+    var conditionPrecedence = getPrecedence(this.condition, parenthesis);
+
+    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+      condition = '<span class="math-parenthesis math-round-parenthesis">(</span>' + condition + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    var trueExpr = this.trueExpr.toHTML(options);
+    var truePrecedence = getPrecedence(this.trueExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+      trueExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + trueExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    var falseExpr = this.falseExpr.toHTML(options);
+    var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);
+
+    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+      falseExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + falseExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return condition + '<span class="math-operator math-conditional-operator">?</span>' + trueExpr + '<span class="math-operator math-conditional-operator">:</span>' + falseExpr;
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConditionalNode.prototype._toTex = function (options) {
+    return '\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\quad{\\text{if }\\;' + this.condition.toTex(options) + '}\\\\{' + this.falseExpr.toTex(options) + '}, &\\quad{\\text{otherwise}}\\end{cases}';
+  };
+  /**
+   * Test whether a condition is met
+   * @param {*} condition
+   * @returns {boolean} true if condition is true or non-zero, else false
+   */
+
+
+  function testCondition(condition) {
+    if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {
+      return !!condition;
+    }
+
+    if (condition) {
+      if (isBigNumber(condition)) {
+        return !condition.isZero();
+      }
+
+      if (isComplex(condition)) {
+        return !!(condition.re || condition.im);
+      }
+
+      if (isUnit(condition)) {
+        return !!condition.value;
+      }
+    }
+
+    if (condition === null || condition === undefined) {
+      return false;
+    }
+
+    throw new TypeError('Unsupported type of condition "' + typeOf(condition) + '"');
+  }
+
+  return ConditionalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js b/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js
new file mode 100644
index 0000000..c763c4f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js
@@ -0,0 +1,190 @@
+import { format } from '../../utils/string.js';
+import { typeOf } from '../../utils/is.js';
+import { escapeLatex } from '../../utils/latex.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ConstantNode';
+var dependencies = ['Node'];
+export var createConstantNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * A ConstantNode holds a constant value like a number or string.
+   *
+   * Usage:
+   *
+   *     new ConstantNode(2.3)
+   *     new ConstantNode('hello')
+   *
+   * @param {*} value    Value can be any type (number, BigNumber, string, ...)
+   * @constructor ConstantNode
+   * @extends {Node}
+   */
+  function ConstantNode(value) {
+    if (!(this instanceof ConstantNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.value = value;
+  }
+
+  ConstantNode.prototype = new Node();
+  ConstantNode.prototype.type = 'ConstantNode';
+  ConstantNode.prototype.isConstantNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ConstantNode.prototype._compile = function (math, argNames) {
+    var value = this.value;
+    return function evalConstantNode() {
+      return value;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ConstantNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs
+  };
+  /**
+   * Create a new ConstantNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node) : Node} callback
+   * @returns {ConstantNode} Returns a clone of the node
+   */
+
+
+  ConstantNode.prototype.map = function (callback) {
+    return this.clone();
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ConstantNode}
+   */
+
+
+  ConstantNode.prototype.clone = function () {
+    return new ConstantNode(this.value);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConstantNode.prototype._toString = function (options) {
+    return format(this.value, options);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConstantNode.prototype.toHTML = function (options) {
+    var value = this._toString(options);
+
+    switch (typeOf(this.value)) {
+      case 'number':
+      case 'BigNumber':
+      case 'Fraction':
+        return '<span class="math-number">' + value + '</span>';
+
+      case 'string':
+        return '<span class="math-string">' + value + '</span>';
+
+      case 'boolean':
+        return '<span class="math-boolean">' + value + '</span>';
+
+      case 'null':
+        return '<span class="math-null-symbol">' + value + '</span>';
+
+      case 'undefined':
+        return '<span class="math-undefined">' + value + '</span>';
+
+      default:
+        return '<span class="math-symbol">' + value + '</span>';
+    }
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ConstantNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ConstantNode',
+      value: this.value
+    };
+  };
+  /**
+   * Instantiate a ConstantNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SymbolNode", value: 2.3}`,
+   *                       where mathjs is optional
+   * @returns {ConstantNode}
+   */
+
+
+  ConstantNode.fromJSON = function (json) {
+    return new ConstantNode(json.value);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ConstantNode.prototype._toTex = function (options) {
+    var value = this._toString(options);
+
+    switch (typeOf(this.value)) {
+      case 'string':
+        return '\\mathtt{' + escapeLatex(value) + '}';
+
+      case 'number':
+      case 'BigNumber':
+        {
+          if (!isFinite(this.value)) {
+            return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
+          }
+
+          var index = value.toLowerCase().indexOf('e');
+
+          if (index !== -1) {
+            return value.substring(0, index) + '\\cdot10^{' + value.substring(index + 1) + '}';
+          }
+        }
+        return value;
+
+      case 'Fraction':
+        return this.value.toLatex();
+
+      default:
+        return value;
+    }
+  };
+
+  return ConstantNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js b/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js
new file mode 100644
index 0000000..50f0ee6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js
@@ -0,0 +1,234 @@
+import { isNode } from '../../utils/is.js';
+import { keywords } from '../keywords.js';
+import { escape } from '../../utils/string.js';
+import { forEach, join } from '../../utils/array.js';
+import { toSymbol } from '../../utils/latex.js';
+import { getPrecedence } from '../operators.js';
+import { factory } from '../../utils/factory.js';
+var name = 'FunctionAssignmentNode';
+var dependencies = ['typed', 'Node'];
+export var createFunctionAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Node
+  } = _ref;
+
+  /**
+   * @constructor FunctionAssignmentNode
+   * @extends {Node}
+   * Function assignment
+   *
+   * @param {string} name           Function name
+   * @param {string[] | Array.<{name: string, type: string}>} params
+   *                                Array with function parameter names, or an
+   *                                array with objects containing the name
+   *                                and type of the parameter
+   * @param {Node} expr             The function expression
+   */
+  function FunctionAssignmentNode(name, params, expr) {
+    if (!(this instanceof FunctionAssignmentNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (typeof name !== 'string') throw new TypeError('String expected for parameter "name"');
+    if (!Array.isArray(params)) throw new TypeError('Array containing strings or objects expected for parameter "params"');
+    if (!isNode(expr)) throw new TypeError('Node expected for parameter "expr"');
+    if (keywords.has(name)) throw new Error('Illegal function name, "' + name + '" is a reserved keyword');
+    this.name = name;
+    this.params = params.map(function (param) {
+      return param && param.name || param;
+    });
+    this.types = params.map(function (param) {
+      return param && param.type || 'any';
+    });
+    this.expr = expr;
+  }
+
+  FunctionAssignmentNode.prototype = new Node();
+  FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode';
+  FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  FunctionAssignmentNode.prototype._compile = function (math, argNames) {
+    var childArgNames = Object.create(argNames);
+    forEach(this.params, function (param) {
+      childArgNames[param] = true;
+    }); // compile the function expression with the child args
+
+    var evalExpr = this.expr._compile(math, childArgNames);
+
+    var name = this.name;
+    var params = this.params;
+    var signature = join(this.types, ',');
+    var syntax = name + '(' + join(this.params, ', ') + ')';
+    return function evalFunctionAssignmentNode(scope, args, context) {
+      var signatures = {};
+
+      signatures[signature] = function () {
+        var childArgs = Object.create(args);
+
+        for (var i = 0; i < params.length; i++) {
+          childArgs[params[i]] = arguments[i];
+        }
+
+        return evalExpr(scope, childArgs, context);
+      };
+
+      var fn = typed(name, signatures);
+      fn.syntax = syntax;
+      scope.set(name, fn);
+      return fn;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  FunctionAssignmentNode.prototype.forEach = function (callback) {
+    callback(this.expr, 'expr', this);
+  };
+  /**
+   * Create a new FunctionAssignmentNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {FunctionAssignmentNode} Returns a transformed copy of the node
+   */
+
+
+  FunctionAssignmentNode.prototype.map = function (callback) {
+    var expr = this._ifNode(callback(this.expr, 'expr', this));
+
+    return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {FunctionAssignmentNode}
+   */
+
+
+  FunctionAssignmentNode.prototype.clone = function () {
+    return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);
+  };
+  /**
+   * Is parenthesis needed?
+   * @param {Node} node
+   * @param {Object} parenthesis
+   * @private
+   */
+
+
+  function needParenthesis(node, parenthesis) {
+    var precedence = getPrecedence(node, parenthesis);
+    var exprPrecedence = getPrecedence(node.expr, parenthesis);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  /**
+   * get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionAssignmentNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var expr = this.expr.toString(options);
+
+    if (needParenthesis(this, parenthesis)) {
+      expr = '(' + expr + ')';
+    }
+
+    return this.name + '(' + this.params.join(', ') + ') = ' + expr;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  FunctionAssignmentNode.prototype.toJSON = function () {
+    var types = this.types;
+    return {
+      mathjs: 'FunctionAssignmentNode',
+      name: this.name,
+      params: this.params.map(function (param, index) {
+        return {
+          name: param,
+          type: types[index]
+        };
+      }),
+      expr: this.expr
+    };
+  };
+  /**
+   * Instantiate an FunctionAssignmentNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "FunctionAssignmentNode", name: ..., params: ..., expr: ...}`,
+   *                       where mathjs is optional
+   * @returns {FunctionAssignmentNode}
+   */
+
+
+  FunctionAssignmentNode.fromJSON = function (json) {
+    return new FunctionAssignmentNode(json.name, json.params, json.expr);
+  };
+  /**
+   * get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionAssignmentNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var params = [];
+
+    for (var i = 0; i < this.params.length; i++) {
+      params.push('<span class="math-symbol math-parameter">' + escape(this.params[i]) + '</span>');
+    }
+
+    var expr = this.expr.toHTML(options);
+
+    if (needParenthesis(this, parenthesis)) {
+      expr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + expr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return '<span class="math-function">' + escape(this.name) + '</span>' + '<span class="math-parenthesis math-round-parenthesis">(</span>' + params.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-round-parenthesis">)</span><span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>' + expr;
+  };
+  /**
+   * get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionAssignmentNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var expr = this.expr.toTex(options);
+
+    if (needParenthesis(this, parenthesis)) {
+      expr = "\\left(".concat(expr, "\\right)");
+    }
+
+    return '\\mathrm{' + this.name + '}\\left(' + this.params.map(toSymbol).join(',') + '\\right):=' + expr;
+  };
+
+  return FunctionAssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js b/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js
new file mode 100644
index 0000000..ea18e76
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js
@@ -0,0 +1,533 @@
+import { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';
+import { escape, format } from '../../utils/string.js';
+import { hasOwnProperty } from '../../utils/object.js';
+import { getSafeProperty, validateSafeMethod } from '../../utils/customs.js';
+import { createSubScope } from '../../utils/scope.js';
+import { factory } from '../../utils/factory.js';
+import { defaultTemplate, latexFunctions } from '../../utils/latex.js';
+var name = 'FunctionNode';
+var dependencies = ['math', 'Node', 'SymbolNode'];
+export var createFunctionNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    math,
+    Node,
+    SymbolNode
+  } = _ref;
+
+  /**
+   * @constructor FunctionNode
+   * @extends {./Node}
+   * invoke a list with arguments on a node
+   * @param {./Node | string} fn Node resolving with a function on which to invoke
+   *                             the arguments, typically a SymboNode or AccessorNode
+   * @param {./Node[]} args
+   */
+  function FunctionNode(fn, args) {
+    if (!(this instanceof FunctionNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (typeof fn === 'string') {
+      fn = new SymbolNode(fn);
+    } // validate input
+
+
+    if (!isNode(fn)) throw new TypeError('Node expected as parameter "fn"');
+
+    if (!Array.isArray(args) || !args.every(isNode)) {
+      throw new TypeError('Array containing Nodes expected for parameter "args"');
+    }
+
+    this.fn = fn;
+    this.args = args || []; // readonly property name
+
+    Object.defineProperty(this, 'name', {
+      get: function () {
+        return this.fn.name || '';
+      }.bind(this),
+      set: function set() {
+        throw new Error('Cannot assign a new name, name is read-only');
+      }
+    });
+  }
+
+  FunctionNode.prototype = new Node();
+  FunctionNode.prototype.type = 'FunctionNode';
+  FunctionNode.prototype.isFunctionNode = true;
+  /* format to fixed length */
+
+  var strin = entity => format(entity, {
+    truncate: 78
+  });
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+
+  FunctionNode.prototype._compile = function (math, argNames) {
+    if (!(this instanceof FunctionNode)) {
+      throw new TypeError('No valid FunctionNode');
+    } // compile arguments
+
+
+    var evalArgs = this.args.map(arg => arg._compile(math, argNames));
+
+    if (isSymbolNode(this.fn)) {
+      var _name = this.fn.name;
+
+      if (!argNames[_name]) {
+        // we can statically determine whether the function has an rawArgs property
+        var fn = _name in math ? getSafeProperty(math, _name) : undefined;
+        var isRaw = typeof fn === 'function' && fn.rawArgs === true;
+
+        var resolveFn = scope => {
+          var value;
+
+          if (scope.has(_name)) {
+            value = scope.get(_name);
+          } else if (_name in math) {
+            value = getSafeProperty(math, _name);
+          } else {
+            return FunctionNode.onUndefinedFunction(_name);
+          }
+
+          if (typeof value === 'function') {
+            return value;
+          }
+
+          throw new TypeError("'".concat(_name, "' is not a function; its value is:\n  ").concat(strin(value)));
+        };
+
+        if (isRaw) {
+          // pass unevaluated parameters (nodes) to the function
+          // "raw" evaluation
+          var rawArgs = this.args;
+          return function evalFunctionNode(scope, args, context) {
+            var fn = resolveFn(scope);
+            return fn(rawArgs, math, createSubScope(scope, args), scope);
+          };
+        } else {
+          // "regular" evaluation
+          switch (evalArgs.length) {
+            case 0:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                return fn();
+              };
+
+            case 1:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                var evalArg0 = evalArgs[0];
+                return fn(evalArg0(scope, args, context));
+              };
+
+            case 2:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                var evalArg0 = evalArgs[0];
+                var evalArg1 = evalArgs[1];
+                return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));
+              };
+
+            default:
+              return function evalFunctionNode(scope, args, context) {
+                var fn = resolveFn(scope);
+                var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+                return fn(...values);
+              };
+          }
+        }
+      } else {
+        // the function symbol is an argName
+        var _rawArgs = this.args;
+        return function evalFunctionNode(scope, args, context) {
+          var fn = args[_name];
+
+          if (typeof fn !== 'function') {
+            throw new TypeError("Argument '".concat(_name, "' was not a function; received: ").concat(strin(fn)));
+          }
+
+          if (fn.rawArgs) {
+            return fn(_rawArgs, math, createSubScope(scope, args), scope); // "raw" evaluation
+          } else {
+            var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+            return fn.apply(fn, values);
+          }
+        };
+      }
+    } else if (isAccessorNode(this.fn) && isIndexNode(this.fn.index) && this.fn.index.isObjectProperty()) {
+      // execute the function with the right context: the object of the AccessorNode
+      var evalObject = this.fn.object._compile(math, argNames);
+
+      var prop = this.fn.index.getObjectProperty();
+      var _rawArgs2 = this.args;
+      return function evalFunctionNode(scope, args, context) {
+        var object = evalObject(scope, args, context);
+        validateSafeMethod(object, prop);
+        var isRaw = object[prop] && object[prop].rawArgs;
+
+        if (isRaw) {
+          return object[prop](_rawArgs2, math, createSubScope(scope, args), scope); // "raw" evaluation
+        } else {
+          // "regular" evaluation
+          var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+          return object[prop].apply(object, values);
+        }
+      };
+    } else {
+      // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()
+      // we have to dynamically determine whether the function has a rawArgs property
+      var fnExpr = this.fn.toString();
+
+      var evalFn = this.fn._compile(math, argNames);
+
+      var _rawArgs3 = this.args;
+      return function evalFunctionNode(scope, args, context) {
+        var fn = evalFn(scope, args, context);
+
+        if (typeof fn !== 'function') {
+          throw new TypeError("Expression '".concat(fnExpr, "' did not evaluate to a function; value is:") + "\n  ".concat(strin(fn)));
+        }
+
+        if (fn.rawArgs) {
+          return fn(_rawArgs3, math, createSubScope(scope, args), scope); // "raw" evaluation
+        } else {
+          // "regular" evaluation
+          var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+          return fn.apply(fn, values);
+        }
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  FunctionNode.prototype.forEach = function (callback) {
+    callback(this.fn, 'fn', this);
+
+    for (var i = 0; i < this.args.length; i++) {
+      callback(this.args[i], 'args[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new FunctionNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {FunctionNode} Returns a transformed copy of the node
+   */
+
+
+  FunctionNode.prototype.map = function (callback) {
+    var fn = this._ifNode(callback(this.fn, 'fn', this));
+
+    var args = [];
+
+    for (var i = 0; i < this.args.length; i++) {
+      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+    }
+
+    return new FunctionNode(fn, args);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {FunctionNode}
+   */
+
+
+  FunctionNode.prototype.clone = function () {
+    return new FunctionNode(this.fn, this.args.slice(0));
+  };
+  /**
+   * Throws an error 'Undefined function {name}'
+   * @param {string} name
+   */
+
+
+  FunctionNode.onUndefinedFunction = function (name) {
+    throw new Error('Undefined function ' + name);
+  }; // backup Node's toString function
+  // @private
+
+
+  var nodeToString = FunctionNode.prototype.toString;
+  /**
+   * Get string representation. (wrapper function)
+   * This overrides parts of Node's toString function.
+   * If callback is an object containing callbacks, it
+   * calls the correct callback for the current node,
+   * otherwise it falls back to calling Node's toString
+   * function.
+   *
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+  FunctionNode.prototype.toString = function (options) {
+    var customString;
+    var name = this.fn.toString(options);
+
+    if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, name)) {
+      // callback is a map of callback functions
+      customString = options.handler[name](this, options);
+    }
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    } // fall back to Node's toString
+
+
+    return nodeToString.call(this, options);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionNode.prototype._toString = function (options) {
+    var args = this.args.map(function (arg) {
+      return arg.toString(options);
+    });
+    var fn = isFunctionAssignmentNode(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options); // format the arguments like "add(2, 4.2)"
+
+    return fn + '(' + args.join(', ') + ')';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  FunctionNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'FunctionNode',
+      fn: this.fn,
+      args: this.args
+    };
+  };
+  /**
+   * Instantiate an AssignmentNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "FunctionNode", fn: ..., args: ...}`,
+   *                       where mathjs is optional
+   * @returns {FunctionNode}
+   */
+
+
+  FunctionNode.fromJSON = function (json) {
+    return new FunctionNode(json.fn, json.args);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionNode.prototype.toHTML = function (options) {
+    var args = this.args.map(function (arg) {
+      return arg.toHTML(options);
+    }); // format the arguments like "add(2, 4.2)"
+
+    return '<span class="math-function">' + escape(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + args.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+  };
+  /*
+   * Expand a LaTeX template
+   *
+   * @param {string} template
+   * @param {Node} node
+   * @param {Object} options
+   * @private
+   **/
+
+
+  function expandTemplate(template, node, options) {
+    var latex = ''; // Match everything of the form ${identifier} or ${identifier[2]} or $$
+    // while submatching identifier and 2 (in the second case)
+
+    var regex = /\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi;
+    var inputPos = 0; // position in the input string
+
+    var match;
+
+    while ((match = regex.exec(template)) !== null) {
+      // go through all matches
+      // add everything in front of the match to the LaTeX string
+      latex += template.substring(inputPos, match.index);
+      inputPos = match.index;
+
+      if (match[0] === '$$') {
+        // escaped dollar sign
+        latex += '$';
+        inputPos++;
+      } else {
+        // template parameter
+        inputPos += match[0].length;
+        var property = node[match[1]];
+
+        if (!property) {
+          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');
+        }
+
+        if (match[2] === undefined) {
+          // no square brackets
+          switch (typeof property) {
+            case 'string':
+              latex += property;
+              break;
+
+            case 'object':
+              if (isNode(property)) {
+                latex += property.toTex(options);
+              } else if (Array.isArray(property)) {
+                // make array of Nodes into comma separated list
+                latex += property.map(function (arg, index) {
+                  if (isNode(arg)) {
+                    return arg.toTex(options);
+                  }
+
+                  throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');
+                }).join(',');
+              } else {
+                throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+              }
+
+              break;
+
+            default:
+              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+          }
+        } else {
+          // with square brackets
+          if (isNode(property[match[2]] && property[match[2]])) {
+            latex += property[match[2]].toTex(options);
+          } else {
+            throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.');
+          }
+        }
+      }
+    }
+
+    latex += template.slice(inputPos); // append rest of the template
+
+    return latex;
+  } // backup Node's toTex function
+  // @private
+
+
+  var nodeToTex = FunctionNode.prototype.toTex;
+  /**
+   * Get LaTeX representation. (wrapper function)
+   * This overrides parts of Node's toTex function.
+   * If callback is an object containing callbacks, it
+   * calls the correct callback for the current node,
+   * otherwise it falls back to calling Node's toTex
+   * function.
+   *
+   * @param {Object} options
+   * @return {string}
+   */
+
+  FunctionNode.prototype.toTex = function (options) {
+    var customTex;
+
+    if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, this.name)) {
+      // callback is a map of callback functions
+      customTex = options.handler[this.name](this, options);
+    }
+
+    if (typeof customTex !== 'undefined') {
+      return customTex;
+    } // fall back to Node's toTex
+
+
+    return nodeToTex.call(this, options);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  FunctionNode.prototype._toTex = function (options) {
+    var args = this.args.map(function (arg) {
+      // get LaTeX of the arguments
+      return arg.toTex(options);
+    });
+    var latexConverter;
+
+    if (latexFunctions[this.name]) {
+      latexConverter = latexFunctions[this.name];
+    } // toTex property on the function itself
+
+
+    if (math[this.name] && (typeof math[this.name].toTex === 'function' || typeof math[this.name].toTex === 'object' || typeof math[this.name].toTex === 'string')) {
+      // .toTex is a callback function
+      latexConverter = math[this.name].toTex;
+    }
+
+    var customToTex;
+
+    switch (typeof latexConverter) {
+      case 'function':
+        // a callback function
+        customToTex = latexConverter(this, options);
+        break;
+
+      case 'string':
+        // a template string
+        customToTex = expandTemplate(latexConverter, this, options);
+        break;
+
+      case 'object':
+        // an object with different "converters" for different numbers of arguments
+        switch (typeof latexConverter[args.length]) {
+          case 'function':
+            customToTex = latexConverter[args.length](this, options);
+            break;
+
+          case 'string':
+            customToTex = expandTemplate(latexConverter[args.length], this, options);
+            break;
+        }
+
+    }
+
+    if (typeof customToTex !== 'undefined') {
+      return customToTex;
+    }
+
+    return expandTemplate(defaultTemplate, this, options);
+  };
+  /**
+   * Get identifier.
+   * @return {string}
+   */
+
+
+  FunctionNode.prototype.getIdentifier = function () {
+    return this.type + ':' + this.name;
+  };
+
+  return FunctionNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/IndexNode.js b/node_modules/mathjs/lib/esm/expression/node/IndexNode.js
new file mode 100644
index 0000000..0b76d03
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/IndexNode.js
@@ -0,0 +1,271 @@
+import { isBigNumber, isConstantNode, isNode, isRangeNode, isSymbolNode } from '../../utils/is.js';
+import { map } from '../../utils/array.js';
+import { escape } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+import { getSafeProperty } from '../../utils/customs.js';
+var name = 'IndexNode';
+var dependencies = ['Range', 'Node', 'size'];
+export var createIndexNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Range,
+    Node,
+    size
+  } = _ref;
+
+  /**
+   * @constructor IndexNode
+   * @extends Node
+   *
+   * Describes a subset of a matrix or an object property.
+   * Cannot be used on its own, needs to be used within an AccessorNode or
+   * AssignmentNode.
+   *
+   * @param {Node[]} dimensions
+   * @param {boolean} [dotNotation=false]  Optional property describing whether
+   *                                       this index was written using dot
+   *                                       notation like `a.b`, or using bracket
+   *                                       notation like `a["b"]` (default).
+   *                                       Used to stringify an IndexNode.
+   */
+  function IndexNode(dimensions, dotNotation) {
+    if (!(this instanceof IndexNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.dimensions = dimensions;
+    this.dotNotation = dotNotation || false; // validate input
+
+    if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {
+      throw new TypeError('Array containing Nodes expected for parameter "dimensions"');
+    }
+
+    if (this.dotNotation && !this.isObjectProperty()) {
+      throw new Error('dotNotation only applicable for object properties');
+    }
+  }
+
+  IndexNode.prototype = new Node();
+  IndexNode.prototype.type = 'IndexNode';
+  IndexNode.prototype.isIndexNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  IndexNode.prototype._compile = function (math, argNames) {
+    // TODO: implement support for bignumber (currently bignumbers are silently
+    //       reduced to numbers when changing the value to zero-based)
+    // TODO: Optimization: when the range values are ConstantNodes,
+    //       we can beforehand resolve the zero-based value
+    // optimization for a simple object property
+    var evalDimensions = map(this.dimensions, function (range, i) {
+      if (isRangeNode(range)) {
+        if (range.needsEnd()) {
+          // create a range containing end (like '4:end')
+          var childArgNames = Object.create(argNames);
+          childArgNames.end = true;
+
+          var evalStart = range.start._compile(math, childArgNames);
+
+          var evalEnd = range.end._compile(math, childArgNames);
+
+          var evalStep = range.step ? range.step._compile(math, childArgNames) : function () {
+            return 1;
+          };
+          return function evalDimension(scope, args, context) {
+            var s = size(context).valueOf();
+            var childArgs = Object.create(args);
+            childArgs.end = s[i];
+            return createRange(evalStart(scope, childArgs, context), evalEnd(scope, childArgs, context), evalStep(scope, childArgs, context));
+          };
+        } else {
+          // create range
+          var _evalStart = range.start._compile(math, argNames);
+
+          var _evalEnd = range.end._compile(math, argNames);
+
+          var _evalStep = range.step ? range.step._compile(math, argNames) : function () {
+            return 1;
+          };
+
+          return function evalDimension(scope, args, context) {
+            return createRange(_evalStart(scope, args, context), _evalEnd(scope, args, context), _evalStep(scope, args, context));
+          };
+        }
+      } else if (isSymbolNode(range) && range.name === 'end') {
+        // SymbolNode 'end'
+        var _childArgNames = Object.create(argNames);
+
+        _childArgNames.end = true;
+
+        var evalRange = range._compile(math, _childArgNames);
+
+        return function evalDimension(scope, args, context) {
+          var s = size(context).valueOf();
+          var childArgs = Object.create(args);
+          childArgs.end = s[i];
+          return evalRange(scope, childArgs, context);
+        };
+      } else {
+        // ConstantNode
+        var _evalRange = range._compile(math, argNames);
+
+        return function evalDimension(scope, args, context) {
+          return _evalRange(scope, args, context);
+        };
+      }
+    });
+    var index = getSafeProperty(math, 'index');
+    return function evalIndexNode(scope, args, context) {
+      var dimensions = map(evalDimensions, function (evalDimension) {
+        return evalDimension(scope, args, context);
+      });
+      return index(...dimensions);
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  IndexNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.dimensions.length; i++) {
+      callback(this.dimensions[i], 'dimensions[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new IndexNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {IndexNode} Returns a transformed copy of the node
+   */
+
+
+  IndexNode.prototype.map = function (callback) {
+    var dimensions = [];
+
+    for (var i = 0; i < this.dimensions.length; i++) {
+      dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));
+    }
+
+    return new IndexNode(dimensions, this.dotNotation);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {IndexNode}
+   */
+
+
+  IndexNode.prototype.clone = function () {
+    return new IndexNode(this.dimensions.slice(0), this.dotNotation);
+  };
+  /**
+   * Test whether this IndexNode contains a single property name
+   * @return {boolean}
+   */
+
+
+  IndexNode.prototype.isObjectProperty = function () {
+    return this.dimensions.length === 1 && isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';
+  };
+  /**
+   * Returns the property name if IndexNode contains a property.
+   * If not, returns null.
+   * @return {string | null}
+   */
+
+
+  IndexNode.prototype.getObjectProperty = function () {
+    return this.isObjectProperty() ? this.dimensions[0].value : null;
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  IndexNode.prototype._toString = function (options) {
+    // format the parameters like "[1, 0:5]"
+    return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  IndexNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'IndexNode',
+      dimensions: this.dimensions,
+      dotNotation: this.dotNotation
+    };
+  };
+  /**
+   * Instantiate an IndexNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "IndexNode", dimensions: [...], dotNotation: false}`,
+   *                       where mathjs is optional
+   * @returns {IndexNode}
+   */
+
+
+  IndexNode.fromJSON = function (json) {
+    return new IndexNode(json.dimensions, json.dotNotation);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  IndexNode.prototype.toHTML = function (options) {
+    // format the parameters like "[1, 0:5]"
+    var dimensions = [];
+
+    for (var i = 0; i < this.dimensions.length; i++) {
+      dimensions[i] = this.dimensions[i].toHTML();
+    }
+
+    if (this.dotNotation) {
+      return '<span class="math-operator math-accessor-operator">.</span>' + '<span class="math-symbol math-property">' + escape(this.getObjectProperty()) + '</span>';
+    } else {
+      return '<span class="math-parenthesis math-square-parenthesis">[</span>' + dimensions.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+    }
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  IndexNode.prototype._toTex = function (options) {
+    var dimensions = this.dimensions.map(function (range) {
+      return range.toTex(options);
+    });
+    return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';
+  }; // helper function to create a Range from start, step and end
+
+
+  function createRange(start, end, step) {
+    return new Range(isBigNumber(start) ? start.toNumber() : start, isBigNumber(end) ? end.toNumber() : end, isBigNumber(step) ? step.toNumber() : step);
+  }
+
+  return IndexNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/Node.js b/node_modules/mathjs/lib/esm/expression/node/Node.js
new file mode 100644
index 0000000..623ec56
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/Node.js
@@ -0,0 +1,405 @@
+import { isNode } from '../../utils/is.js';
+import { keywords } from '../keywords.js';
+import { deepStrictEqual } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+import { createMap } from '../../utils/map.js';
+var name = 'Node';
+var dependencies = ['mathWithTransform'];
+export var createNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    mathWithTransform
+  } = _ref;
+
+  /**
+   * Node
+   */
+  function Node() {
+    if (!(this instanceof Node)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+  }
+  /**
+   * Evaluate the node
+   * @param {Object} [scope]  Scope to read/write variables
+   * @return {*}              Returns the result
+   */
+
+
+  Node.prototype.evaluate = function (scope) {
+    return this.compile().evaluate(scope);
+  };
+
+  Node.prototype.type = 'Node';
+  Node.prototype.isNode = true;
+  Node.prototype.comment = '';
+  /**
+   * Compile the node into an optimized, evauatable JavaScript function
+   * @return {{evaluate: function([Object])}} object
+   *                Returns an object with a function 'evaluate',
+   *                which can be invoked as expr.evaluate([scope: Object]),
+   *                where scope is an optional object with
+   *                variables.
+   */
+
+  Node.prototype.compile = function () {
+    var expr = this._compile(mathWithTransform, {});
+
+    var args = {};
+    var context = null;
+
+    function evaluate(scope) {
+      var s = createMap(scope);
+
+      _validateScope(s);
+
+      return expr(s, args, context);
+    }
+
+    return {
+      evaluate
+    };
+  };
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+
+  Node.prototype._compile = function (math, argNames) {
+    throw new Error('Method _compile should be implemented by type ' + this.type);
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  Node.prototype.forEach = function (callback) {
+    // must be implemented by each of the Node implementations
+    throw new Error('Cannot run forEach on a Node interface');
+  };
+  /**
+   * Create a new Node having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {OperatorNode} Returns a transformed copy of the node
+   */
+
+
+  Node.prototype.map = function (callback) {
+    // must be implemented by each of the Node implementations
+    throw new Error('Cannot run map on a Node interface');
+  };
+  /**
+   * Validate whether an object is a Node, for use with map
+   * @param {Node} node
+   * @returns {Node} Returns the input if it's a node, else throws an Error
+   * @protected
+   */
+
+
+  Node.prototype._ifNode = function (node) {
+    if (!isNode(node)) {
+      throw new TypeError('Callback function must return a Node');
+    }
+
+    return node;
+  };
+  /**
+   * Recursively traverse all nodes in a node tree. Executes given callback for
+   * this node and each of its child nodes.
+   * @param {function(node: Node, path: string, parent: Node)} callback
+   *          A callback called for every node in the node tree.
+   */
+
+
+  Node.prototype.traverse = function (callback) {
+    // execute callback for itself
+    // eslint-disable-next-line
+    callback(this, null, null); // recursively traverse over all childs of a node
+
+    function _traverse(node, callback) {
+      node.forEach(function (child, path, parent) {
+        callback(child, path, parent);
+
+        _traverse(child, callback);
+      });
+    }
+
+    _traverse(this, callback);
+  };
+  /**
+   * Recursively transform a node tree via a transform function.
+   *
+   * For example, to replace all nodes of type SymbolNode having name 'x' with a
+   * ConstantNode with value 2:
+   *
+   *     const res = Node.transform(function (node, path, parent) {
+   *       if (node && node.isSymbolNode) && (node.name === 'x')) {
+   *         return new ConstantNode(2)
+   *       }
+   *       else {
+   *         return node
+   *       }
+   *     })
+   *
+   * @param {function(node: Node, path: string, parent: Node) : Node} callback
+   *          A mapping function accepting a node, and returning
+   *          a replacement for the node or the original node.
+   *          Signature: callback(node: Node, index: string, parent: Node) : Node
+   * @return {Node} Returns the original node or its replacement
+   */
+
+
+  Node.prototype.transform = function (callback) {
+    function _transform(child, path, parent) {
+      var replacement = callback(child, path, parent);
+
+      if (replacement !== child) {
+        // stop iterating when the node is replaced
+        return replacement;
+      }
+
+      return child.map(_transform);
+    }
+
+    return _transform(this, null, null);
+  };
+  /**
+   * Find any node in the node tree matching given filter function. For example, to
+   * find all nodes of type SymbolNode having name 'x':
+   *
+   *     const results = Node.filter(function (node) {
+   *       return (node && node.isSymbolNode) && (node.name === 'x')
+   *     })
+   *
+   * @param {function(node: Node, path: string, parent: Node) : Node} callback
+   *            A test function returning true when a node matches, and false
+   *            otherwise. Function signature:
+   *            callback(node: Node, index: string, parent: Node) : boolean
+   * @return {Node[]} nodes       An array with nodes matching given filter criteria
+   */
+
+
+  Node.prototype.filter = function (callback) {
+    var nodes = [];
+    this.traverse(function (node, path, parent) {
+      if (callback(node, path, parent)) {
+        nodes.push(node);
+      }
+    });
+    return nodes;
+  };
+  /**
+   * Create a shallow clone of this node
+   * @return {Node}
+   */
+
+
+  Node.prototype.clone = function () {
+    // must be implemented by each of the Node implementations
+    throw new Error('Cannot clone a Node interface');
+  };
+  /**
+   * Create a deep clone of this node
+   * @return {Node}
+   */
+
+
+  Node.prototype.cloneDeep = function () {
+    return this.map(function (node) {
+      return node.cloneDeep();
+    });
+  };
+  /**
+   * Deep compare this node with another node.
+   * @param {Node} other
+   * @return {boolean} Returns true when both nodes are of the same type and
+   *                   contain the same values (as do their childs)
+   */
+
+
+  Node.prototype.equals = function (other) {
+    return other ? deepStrictEqual(this, other) : false;
+  };
+  /**
+   * Get string representation. (wrapper function)
+   *
+   * This function can get an object of the following form:
+   * {
+   *    handler: //This can be a callback function of the form
+   *             // "function callback(node, options)"or
+   *             // a map that maps function names (used in FunctionNodes)
+   *             // to callbacks
+   *    parenthesis: "keep" //the parenthesis option (This is optional)
+   * }
+   *
+   * @param {Object} [options]
+   * @return {string}
+   */
+
+
+  Node.prototype.toString = function (options) {
+    var customString = this._getCustomString(options);
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    }
+
+    return this._toString(options);
+  };
+  /**
+   * Get a JSON representation of the node
+   * Both .toJSON() and the static .fromJSON(json) should be implemented by all
+   * implementations of Node
+   * @returns {Object}
+   */
+
+
+  Node.prototype.toJSON = function () {
+    throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);
+  };
+  /**
+   * Get HTML representation. (wrapper function)
+   *
+   * This function can get an object of the following form:
+   * {
+   *    handler: //This can be a callback function of the form
+   *             // "function callback(node, options)" or
+   *             // a map that maps function names (used in FunctionNodes)
+   *             // to callbacks
+   *    parenthesis: "keep" //the parenthesis option (This is optional)
+   * }
+   *
+   * @param {Object} [options]
+   * @return {string}
+   */
+
+
+  Node.prototype.toHTML = function (options) {
+    var customString = this._getCustomString(options);
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    }
+
+    return this.toHTML(options);
+  };
+  /**
+   * Internal function to generate the string output.
+   * This has to be implemented by every Node
+   *
+   * @throws {Error}
+   */
+
+
+  Node.prototype._toString = function () {
+    // must be implemented by each of the Node implementations
+    throw new Error('_toString not implemented for ' + this.type);
+  };
+  /**
+   * Get LaTeX representation. (wrapper function)
+   *
+   * This function can get an object of the following form:
+   * {
+   *    handler: //This can be a callback function of the form
+   *             // "function callback(node, options)"or
+   *             // a map that maps function names (used in FunctionNodes)
+   *             // to callbacks
+   *    parenthesis: "keep" //the parenthesis option (This is optional)
+   * }
+   *
+   * @param {Object} [options]
+   * @return {string}
+   */
+
+
+  Node.prototype.toTex = function (options) {
+    var customString = this._getCustomString(options);
+
+    if (typeof customString !== 'undefined') {
+      return customString;
+    }
+
+    return this._toTex(options);
+  };
+  /**
+   * Internal function to generate the LaTeX output.
+   * This has to be implemented by every Node
+   *
+   * @param {Object} [options]
+   * @throws {Error}
+   */
+
+
+  Node.prototype._toTex = function (options) {
+    // must be implemented by each of the Node implementations
+    throw new Error('_toTex not implemented for ' + this.type);
+  };
+  /**
+   * Helper used by `to...` functions.
+   */
+
+
+  Node.prototype._getCustomString = function (options) {
+    if (options && typeof options === 'object') {
+      switch (typeof options.handler) {
+        case 'object':
+        case 'undefined':
+          return;
+
+        case 'function':
+          return options.handler(this, options);
+
+        default:
+          throw new TypeError('Object or function expected as callback');
+      }
+    }
+  };
+  /**
+   * Get identifier.
+   * @return {string}
+   */
+
+
+  Node.prototype.getIdentifier = function () {
+    return this.type;
+  };
+  /**
+   * Get the content of the current Node.
+   * @return {Node} node
+   **/
+
+
+  Node.prototype.getContent = function () {
+    return this;
+  };
+  /**
+   * Validate the symbol names of a scope.
+   * Throws an error when the scope contains an illegal symbol.
+   * @param {Object} scope
+   */
+
+
+  function _validateScope(scope) {
+    for (var symbol of [...keywords]) {
+      if (scope.has(symbol)) {
+        throw new Error('Scope contains an illegal symbol, "' + symbol + '" is a reserved keyword');
+      }
+    }
+  }
+
+  return Node;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js b/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js
new file mode 100644
index 0000000..f7718a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js
@@ -0,0 +1,216 @@
+import { isNode } from '../../utils/is.js';
+import { escape, stringify } from '../../utils/string.js';
+import { isSafeProperty } from '../../utils/customs.js';
+import { hasOwnProperty } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ObjectNode';
+var dependencies = ['Node'];
+export var createObjectNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * @constructor ObjectNode
+   * @extends {Node}
+   * Holds an object with keys/values
+   * @param {Object.<string, Node>} [properties]   object with key/value pairs
+   */
+  function ObjectNode(properties) {
+    if (!(this instanceof ObjectNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.properties = properties || {}; // validate input
+
+    if (properties) {
+      if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {
+        return isNode(properties[key]);
+      })) {
+        throw new TypeError('Object containing Nodes expected');
+      }
+    }
+  }
+
+  ObjectNode.prototype = new Node();
+  ObjectNode.prototype.type = 'ObjectNode';
+  ObjectNode.prototype.isObjectNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ObjectNode.prototype._compile = function (math, argNames) {
+    var evalEntries = {};
+
+    for (var key in this.properties) {
+      if (hasOwnProperty(this.properties, key)) {
+        // we stringify/parse the key here to resolve unicode characters,
+        // so you cannot create a key like {"co\\u006Estructor": null}
+        var stringifiedKey = stringify(key);
+        var parsedKey = JSON.parse(stringifiedKey);
+
+        if (!isSafeProperty(this.properties, parsedKey)) {
+          throw new Error('No access to property "' + parsedKey + '"');
+        }
+
+        evalEntries[parsedKey] = this.properties[key]._compile(math, argNames);
+      }
+    }
+
+    return function evalObjectNode(scope, args, context) {
+      var obj = {};
+
+      for (var _key in evalEntries) {
+        if (hasOwnProperty(evalEntries, _key)) {
+          obj[_key] = evalEntries[_key](scope, args, context);
+        }
+      }
+
+      return obj;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ObjectNode.prototype.forEach = function (callback) {
+    for (var key in this.properties) {
+      if (hasOwnProperty(this.properties, key)) {
+        callback(this.properties[key], 'properties[' + stringify(key) + ']', this);
+      }
+    }
+  };
+  /**
+   * Create a new ObjectNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {ObjectNode} Returns a transformed copy of the node
+   */
+
+
+  ObjectNode.prototype.map = function (callback) {
+    var properties = {};
+
+    for (var key in this.properties) {
+      if (hasOwnProperty(this.properties, key)) {
+        properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + stringify(key) + ']', this));
+      }
+    }
+
+    return new ObjectNode(properties);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ObjectNode}
+   */
+
+
+  ObjectNode.prototype.clone = function () {
+    var properties = {};
+
+    for (var key in this.properties) {
+      if (hasOwnProperty(this.properties, key)) {
+        properties[key] = this.properties[key];
+      }
+    }
+
+    return new ObjectNode(properties);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ObjectNode.prototype._toString = function (options) {
+    var entries = [];
+
+    for (var key in this.properties) {
+      if (hasOwnProperty(this.properties, key)) {
+        entries.push(stringify(key) + ': ' + this.properties[key].toString(options));
+      }
+    }
+
+    return '{' + entries.join(', ') + '}';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ObjectNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ObjectNode',
+      properties: this.properties
+    };
+  };
+  /**
+   * Instantiate an OperatorNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ObjectNode", "properties": {...}}`,
+   *                       where mathjs is optional
+   * @returns {ObjectNode}
+   */
+
+
+  ObjectNode.fromJSON = function (json) {
+    return new ObjectNode(json.properties);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ObjectNode.prototype.toHTML = function (options) {
+    var entries = [];
+
+    for (var key in this.properties) {
+      if (hasOwnProperty(this.properties, key)) {
+        entries.push('<span class="math-symbol math-property">' + escape(key) + '</span>' + '<span class="math-operator math-assignment-operator math-property-assignment-operator math-binary-operator">:</span>' + this.properties[key].toHTML(options));
+      }
+    }
+
+    return '<span class="math-parenthesis math-curly-parenthesis">{</span>' + entries.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-curly-parenthesis">}</span>';
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  ObjectNode.prototype._toTex = function (options) {
+    var entries = [];
+
+    for (var key in this.properties) {
+      if (hasOwnProperty(this.properties, key)) {
+        entries.push('\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\');
+      }
+    }
+
+    return "\\left\\{\\begin{array}{ll}".concat(entries.join('\n'), "\\end{array}\\right\\}");
+  };
+
+  return ObjectNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js b/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js
new file mode 100644
index 0000000..f4de913
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js
@@ -0,0 +1,688 @@
+import { isNode } from '../../utils/is.js';
+import { map } from '../../utils/array.js';
+import { escape } from '../../utils/string.js';
+import { getSafeProperty, isSafeMethod } from '../../utils/customs.js';
+import { getAssociativity, getPrecedence, isAssociativeWith, properties } from '../operators.js';
+import { latexOperators } from '../../utils/latex.js';
+import { factory } from '../../utils/factory.js';
+var name = 'OperatorNode';
+var dependencies = ['Node'];
+export var createOperatorNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * @constructor OperatorNode
+   * @extends {Node}
+   * An operator with two arguments, like 2+3
+   *
+   * @param {string} op           Operator name, for example '+'
+   * @param {string} fn           Function name, for example 'add'
+   * @param {Node[]} args         Operator arguments
+   * @param {boolean} [implicit]  Is this an implicit multiplication?
+   * @param {boolean} [isPercentage] Is this an percentage Operation?
+   */
+  function OperatorNode(op, fn, args, implicit, isPercentage) {
+    if (!(this instanceof OperatorNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (typeof op !== 'string') {
+      throw new TypeError('string expected for parameter "op"');
+    }
+
+    if (typeof fn !== 'string') {
+      throw new TypeError('string expected for parameter "fn"');
+    }
+
+    if (!Array.isArray(args) || !args.every(isNode)) {
+      throw new TypeError('Array containing Nodes expected for parameter "args"');
+    }
+
+    this.implicit = implicit === true;
+    this.isPercentage = isPercentage === true;
+    this.op = op;
+    this.fn = fn;
+    this.args = args || [];
+  }
+
+  OperatorNode.prototype = new Node();
+  OperatorNode.prototype.type = 'OperatorNode';
+  OperatorNode.prototype.isOperatorNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  OperatorNode.prototype._compile = function (math, argNames) {
+    // validate fn
+    if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {
+      if (!math[this.fn]) {
+        throw new Error('Function ' + this.fn + ' missing in provided namespace "math"');
+      } else {
+        throw new Error('No access to function "' + this.fn + '"');
+      }
+    }
+
+    var fn = getSafeProperty(math, this.fn);
+    var evalArgs = map(this.args, function (arg) {
+      return arg._compile(math, argNames);
+    });
+
+    if (evalArgs.length === 1) {
+      var evalArg0 = evalArgs[0];
+      return function evalOperatorNode(scope, args, context) {
+        return fn(evalArg0(scope, args, context));
+      };
+    } else if (evalArgs.length === 2) {
+      var _evalArg = evalArgs[0];
+      var evalArg1 = evalArgs[1];
+      return function evalOperatorNode(scope, args, context) {
+        return fn(_evalArg(scope, args, context), evalArg1(scope, args, context));
+      };
+    } else {
+      return function evalOperatorNode(scope, args, context) {
+        return fn.apply(null, map(evalArgs, function (evalArg) {
+          return evalArg(scope, args, context);
+        }));
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  OperatorNode.prototype.forEach = function (callback) {
+    for (var i = 0; i < this.args.length; i++) {
+      callback(this.args[i], 'args[' + i + ']', this);
+    }
+  };
+  /**
+   * Create a new OperatorNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {OperatorNode} Returns a transformed copy of the node
+   */
+
+
+  OperatorNode.prototype.map = function (callback) {
+    var args = [];
+
+    for (var i = 0; i < this.args.length; i++) {
+      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+    }
+
+    return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {OperatorNode}
+   */
+
+
+  OperatorNode.prototype.clone = function () {
+    return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);
+  };
+  /**
+   * Check whether this is an unary OperatorNode:
+   * has exactly one argument, like `-a`.
+   * @return {boolean} Returns true when an unary operator node, false otherwise.
+   */
+
+
+  OperatorNode.prototype.isUnary = function () {
+    return this.args.length === 1;
+  };
+  /**
+   * Check whether this is a binary OperatorNode:
+   * has exactly two arguments, like `a + b`.
+   * @return {boolean} Returns true when a binary operator node, false otherwise.
+   */
+
+
+  OperatorNode.prototype.isBinary = function () {
+    return this.args.length === 2;
+  };
+  /**
+   * Calculate which parentheses are necessary. Gets an OperatorNode
+   * (which is the root of the tree) and an Array of Nodes
+   * (this.args) and returns an array where 'true' means that an argument
+   * has to be enclosed in parentheses whereas 'false' means the opposite.
+   *
+   * @param {OperatorNode} root
+   * @param {string} parenthesis
+   * @param {Node[]} args
+   * @param {boolean} latex
+   * @return {boolean[]}
+   * @private
+   */
+
+
+  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {
+    // precedence of the root OperatorNode
+    var precedence = getPrecedence(root, parenthesis);
+    var associativity = getAssociativity(root, parenthesis);
+
+    if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {
+      return args.map(function (arg) {
+        switch (arg.getContent().type) {
+          // Nodes that don't need extra parentheses
+          case 'ArrayNode':
+          case 'ConstantNode':
+          case 'SymbolNode':
+          case 'ParenthesisNode':
+            return false;
+
+          default:
+            return true;
+        }
+      });
+    }
+
+    var result;
+
+    switch (args.length) {
+      case 0:
+        result = [];
+        break;
+
+      case 1:
+        // unary operators
+        {
+          // precedence of the operand
+          var operandPrecedence = getPrecedence(args[0], parenthesis); // handle special cases for LaTeX, where some of the parentheses aren't needed
+
+          if (latex && operandPrecedence !== null) {
+            var operandIdentifier;
+            var rootIdentifier;
+
+            if (parenthesis === 'keep') {
+              operandIdentifier = args[0].getIdentifier();
+              rootIdentifier = root.getIdentifier();
+            } else {
+              // Ignore Parenthesis Nodes when not in 'keep' mode
+              operandIdentifier = args[0].getContent().getIdentifier();
+              rootIdentifier = root.getContent().getIdentifier();
+            }
+
+            if (properties[precedence][rootIdentifier].latexLeftParens === false) {
+              result = [false];
+              break;
+            }
+
+            if (properties[operandPrecedence][operandIdentifier].latexParens === false) {
+              result = [false];
+              break;
+            }
+          }
+
+          if (operandPrecedence === null) {
+            // if the operand has no defined precedence, no parens are needed
+            result = [false];
+            break;
+          }
+
+          if (operandPrecedence <= precedence) {
+            // if the operands precedence is lower, parens are needed
+            result = [true];
+            break;
+          } // otherwise, no parens needed
+
+
+          result = [false];
+        }
+        break;
+
+      case 2:
+        // binary operators
+        {
+          var lhsParens; // left hand side needs parenthesis?
+          // precedence of the left hand side
+
+          var lhsPrecedence = getPrecedence(args[0], parenthesis); // is the root node associative with the left hand side
+
+          var assocWithLhs = isAssociativeWith(root, args[0], parenthesis);
+
+          if (lhsPrecedence === null) {
+            // if the left hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            lhsParens = false;
+          } else if (lhsPrecedence === precedence && associativity === 'right' && !assocWithLhs) {
+            // In case of equal precedence, if the root node is left associative
+            // parens are **never** necessary for the left hand side.
+            // If it is right associative however, parens are necessary
+            // if the root node isn't associative with the left hand side
+            lhsParens = true;
+          } else if (lhsPrecedence < precedence) {
+            lhsParens = true;
+          } else {
+            lhsParens = false;
+          }
+
+          var rhsParens; // right hand side needs parenthesis?
+          // precedence of the right hand side
+
+          var rhsPrecedence = getPrecedence(args[1], parenthesis); // is the root node associative with the right hand side?
+
+          var assocWithRhs = isAssociativeWith(root, args[1], parenthesis);
+
+          if (rhsPrecedence === null) {
+            // if the right hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            rhsParens = false;
+          } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {
+            // In case of equal precedence, if the root node is right associative
+            // parens are **never** necessary for the right hand side.
+            // If it is left associative however, parens are necessary
+            // if the root node isn't associative with the right hand side
+            rhsParens = true;
+          } else if (rhsPrecedence < precedence) {
+            rhsParens = true;
+          } else {
+            rhsParens = false;
+          } // handle special cases for LaTeX, where some of the parentheses aren't needed
+
+
+          if (latex) {
+            var _rootIdentifier;
+
+            var lhsIdentifier;
+            var rhsIdentifier;
+
+            if (parenthesis === 'keep') {
+              _rootIdentifier = root.getIdentifier();
+              lhsIdentifier = root.args[0].getIdentifier();
+              rhsIdentifier = root.args[1].getIdentifier();
+            } else {
+              // Ignore ParenthesisNodes when not in 'keep' mode
+              _rootIdentifier = root.getContent().getIdentifier();
+              lhsIdentifier = root.args[0].getContent().getIdentifier();
+              rhsIdentifier = root.args[1].getContent().getIdentifier();
+            }
+
+            if (lhsPrecedence !== null) {
+              if (properties[precedence][_rootIdentifier].latexLeftParens === false) {
+                lhsParens = false;
+              }
+
+              if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {
+                lhsParens = false;
+              }
+            }
+
+            if (rhsPrecedence !== null) {
+              if (properties[precedence][_rootIdentifier].latexRightParens === false) {
+                rhsParens = false;
+              }
+
+              if (properties[rhsPrecedence][rhsIdentifier].latexParens === false) {
+                rhsParens = false;
+              }
+            }
+          }
+
+          result = [lhsParens, rhsParens];
+        }
+        break;
+
+      default:
+        if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {
+          result = args.map(function (arg) {
+            var argPrecedence = getPrecedence(arg, parenthesis);
+            var assocWithArg = isAssociativeWith(root, arg, parenthesis);
+            var argAssociativity = getAssociativity(arg, parenthesis);
+
+            if (argPrecedence === null) {
+              // if the argument has no defined precedence, no parens are needed
+              return false;
+            } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {
+              return true;
+            } else if (argPrecedence < precedence) {
+              return true;
+            }
+
+            return false;
+          });
+        }
+
+        break;
+    } // handles an edge case of 'auto' parentheses with implicit multiplication of ConstantNode
+    // In that case print parentheses for ParenthesisNodes even though they normally wouldn't be
+    // printed.
+
+
+    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis === 'auto' && implicit === 'hide') {
+      result = args.map(function (arg, index) {
+        var isParenthesisNode = arg.getIdentifier() === 'ParenthesisNode';
+
+        if (result[index] || isParenthesisNode) {
+          // put in parenthesis?
+          return true;
+        }
+
+        return false;
+      });
+    }
+
+    return result;
+  }
+  /**
+   * Get string representation.
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  OperatorNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var implicit = options && options.implicit ? options.implicit : 'hide';
+    var args = this.args;
+    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+
+    if (args.length === 1) {
+      // unary operators
+      var assoc = getAssociativity(this, parenthesis);
+      var operand = args[0].toString(options);
+
+      if (parens[0]) {
+        operand = '(' + operand + ')';
+      } // for example for "not", we want a space between operand and argument
+
+
+      var opIsNamed = /[a-zA-Z]+/.test(this.op);
+
+      if (assoc === 'right') {
+        // prefix operator
+        return this.op + (opIsNamed ? ' ' : '') + operand;
+      } else if (assoc === 'left') {
+        // postfix
+        return operand + (opIsNamed ? ' ' : '') + this.op;
+      } // fall back to postfix
+
+
+      return operand + this.op;
+    } else if (args.length === 2) {
+      var lhs = args[0].toString(options); // left hand side
+
+      var rhs = args[1].toString(options); // right hand side
+
+      if (parens[0]) {
+        // left hand side in parenthesis?
+        lhs = '(' + lhs + ')';
+      }
+
+      if (parens[1]) {
+        // right hand side in parenthesis?
+        rhs = '(' + rhs + ')';
+      }
+
+      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+        return lhs + ' ' + rhs;
+      }
+
+      return lhs + ' ' + this.op + ' ' + rhs;
+    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+      var stringifiedArgs = args.map(function (arg, index) {
+        arg = arg.toString(options);
+
+        if (parens[index]) {
+          // put in parenthesis?
+          arg = '(' + arg + ')';
+        }
+
+        return arg;
+      });
+
+      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+        return stringifiedArgs.join(' ');
+      }
+
+      return stringifiedArgs.join(' ' + this.op + ' ');
+    } else {
+      // fallback to formatting as a function call
+      return this.fn + '(' + this.args.join(', ') + ')';
+    }
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  OperatorNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'OperatorNode',
+      op: this.op,
+      fn: this.fn,
+      args: this.args,
+      implicit: this.implicit,
+      isPercentage: this.isPercentage
+    };
+  };
+  /**
+   * Instantiate an OperatorNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "OperatorNode", "op": "+", "fn": "add", "args": [...], "implicit": false, "isPercentage":false}`,
+   *                       where mathjs is optional
+   * @returns {OperatorNode}
+   */
+
+
+  OperatorNode.fromJSON = function (json) {
+    return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);
+  };
+  /**
+   * Get HTML representation.
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  OperatorNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var implicit = options && options.implicit ? options.implicit : 'hide';
+    var args = this.args;
+    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+
+    if (args.length === 1) {
+      // unary operators
+      var assoc = getAssociativity(this, parenthesis);
+      var operand = args[0].toHTML(options);
+
+      if (parens[0]) {
+        operand = '<span class="math-parenthesis math-round-parenthesis">(</span>' + operand + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      if (assoc === 'right') {
+        // prefix operator
+        return '<span class="math-operator math-unary-operator math-lefthand-unary-operator">' + escape(this.op) + '</span>' + operand;
+      } else {
+        // postfix when assoc === 'left' or undefined
+        return operand + '<span class="math-operator math-unary-operator math-righthand-unary-operator">' + escape(this.op) + '</span>';
+      }
+    } else if (args.length === 2) {
+      // binary operatoes
+      var lhs = args[0].toHTML(options); // left hand side
+
+      var rhs = args[1].toHTML(options); // right hand side
+
+      if (parens[0]) {
+        // left hand side in parenthesis?
+        lhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + lhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      if (parens[1]) {
+        // right hand side in parenthesis?
+        rhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + rhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+        return lhs + '<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>' + rhs;
+      }
+
+      return lhs + '<span class="math-operator math-binary-operator math-explicit-binary-operator">' + escape(this.op) + '</span>' + rhs;
+    } else {
+      var stringifiedArgs = args.map(function (arg, index) {
+        arg = arg.toHTML(options);
+
+        if (parens[index]) {
+          // put in parenthesis?
+          arg = '<span class="math-parenthesis math-round-parenthesis">(</span>' + arg + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+
+        return arg;
+      });
+
+      if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return stringifiedArgs.join('<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>');
+        }
+
+        return stringifiedArgs.join('<span class="math-operator math-binary-operator math-explicit-binary-operator">' + escape(this.op) + '</span>');
+      } else {
+        // fallback to formatting as a function call
+        return '<span class="math-function">' + escape(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + stringifiedArgs.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+      }
+    }
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  OperatorNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var implicit = options && options.implicit ? options.implicit : 'hide';
+    var args = this.args;
+    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);
+    var op = latexOperators[this.fn];
+    op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op
+
+    if (args.length === 1) {
+      // unary operators
+      var assoc = getAssociativity(this, parenthesis);
+      var operand = args[0].toTex(options);
+
+      if (parens[0]) {
+        operand = "\\left(".concat(operand, "\\right)");
+      }
+
+      if (assoc === 'right') {
+        // prefix operator
+        return op + operand;
+      } else if (assoc === 'left') {
+        // postfix operator
+        return operand + op;
+      } // fall back to postfix
+
+
+      return operand + op;
+    } else if (args.length === 2) {
+      // binary operators
+      var lhs = args[0]; // left hand side
+
+      var lhsTex = lhs.toTex(options);
+
+      if (parens[0]) {
+        lhsTex = "\\left(".concat(lhsTex, "\\right)");
+      }
+
+      var rhs = args[1]; // right hand side
+
+      var rhsTex = rhs.toTex(options);
+
+      if (parens[1]) {
+        rhsTex = "\\left(".concat(rhsTex, "\\right)");
+      } // handle some exceptions (due to the way LaTeX works)
+
+
+      var lhsIdentifier;
+
+      if (parenthesis === 'keep') {
+        lhsIdentifier = lhs.getIdentifier();
+      } else {
+        // Ignore ParenthesisNodes if in 'keep' mode
+        lhsIdentifier = lhs.getContent().getIdentifier();
+      }
+
+      switch (this.getIdentifier()) {
+        case 'OperatorNode:divide':
+          // op contains '\\frac' at this point
+          return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';
+
+        case 'OperatorNode:pow':
+          lhsTex = '{' + lhsTex + '}';
+          rhsTex = '{' + rhsTex + '}';
+
+          switch (lhsIdentifier) {
+            case 'ConditionalNode': //
+
+            case 'OperatorNode:divide':
+              lhsTex = "\\left(".concat(lhsTex, "\\right)");
+          }
+
+          break;
+
+        case 'OperatorNode:multiply':
+          if (this.implicit && implicit === 'hide') {
+            return lhsTex + '~' + rhsTex;
+          }
+
+      }
+
+      return lhsTex + op + rhsTex;
+    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+      var texifiedArgs = args.map(function (arg, index) {
+        arg = arg.toTex(options);
+
+        if (parens[index]) {
+          arg = "\\left(".concat(arg, "\\right)");
+        }
+
+        return arg;
+      });
+
+      if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit) {
+        return texifiedArgs.join('~');
+      }
+
+      return texifiedArgs.join(op);
+    } else {
+      // fall back to formatting as a function call
+      // as this is a fallback, it doesn't use
+      // fancy function names
+      return '\\mathrm{' + this.fn + '}\\left(' + args.map(function (arg) {
+        return arg.toTex(options);
+      }).join(',') + '\\right)';
+    }
+  };
+  /**
+   * Get identifier.
+   * @return {string}
+   */
+
+
+  OperatorNode.prototype.getIdentifier = function () {
+    return this.type + ':' + this.fn;
+  };
+
+  return OperatorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js b/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js
new file mode 100644
index 0000000..8e652c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js
@@ -0,0 +1,164 @@
+import { isNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ParenthesisNode';
+var dependencies = ['Node'];
+export var createParenthesisNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * @constructor ParenthesisNode
+   * @extends {Node}
+   * A parenthesis node describes manual parenthesis from the user input
+   * @param {Node} content
+   * @extends {Node}
+   */
+  function ParenthesisNode(content) {
+    if (!(this instanceof ParenthesisNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (!isNode(content)) {
+      throw new TypeError('Node expected for parameter "content"');
+    }
+
+    this.content = content;
+  }
+
+  ParenthesisNode.prototype = new Node();
+  ParenthesisNode.prototype.type = 'ParenthesisNode';
+  ParenthesisNode.prototype.isParenthesisNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  ParenthesisNode.prototype._compile = function (math, argNames) {
+    return this.content._compile(math, argNames);
+  };
+  /**
+   * Get the content of the current Node.
+   * @return {Node} content
+   * @override
+   **/
+
+
+  ParenthesisNode.prototype.getContent = function () {
+    return this.content.getContent();
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  ParenthesisNode.prototype.forEach = function (callback) {
+    callback(this.content, 'content', this);
+  };
+  /**
+   * Create a new ParenthesisNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node) : Node} callback
+   * @returns {ParenthesisNode} Returns a clone of the node
+   */
+
+
+  ParenthesisNode.prototype.map = function (callback) {
+    var content = callback(this.content, 'content', this);
+    return new ParenthesisNode(content);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {ParenthesisNode}
+   */
+
+
+  ParenthesisNode.prototype.clone = function () {
+    return new ParenthesisNode(this.content);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ParenthesisNode.prototype._toString = function (options) {
+    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+      return '(' + this.content.toString(options) + ')';
+    }
+
+    return this.content.toString(options);
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  ParenthesisNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'ParenthesisNode',
+      content: this.content
+    };
+  };
+  /**
+   * Instantiate an ParenthesisNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ParenthesisNode", "content": ...}`,
+   *                       where mathjs is optional
+   * @returns {ParenthesisNode}
+   */
+
+
+  ParenthesisNode.fromJSON = function (json) {
+    return new ParenthesisNode(json.content);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ParenthesisNode.prototype.toHTML = function (options) {
+    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+      return '<span class="math-parenthesis math-round-parenthesis">(</span>' + this.content.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    return this.content.toHTML(options);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  ParenthesisNode.prototype._toTex = function (options) {
+    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+      return "\\left(".concat(this.content.toTex(options), "\\right)");
+    }
+
+    return this.content.toTex(options);
+  };
+
+  return ParenthesisNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/RangeNode.js b/node_modules/mathjs/lib/esm/expression/node/RangeNode.js
new file mode 100644
index 0000000..56985fd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/RangeNode.js
@@ -0,0 +1,288 @@
+import { isNode, isSymbolNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { getPrecedence } from '../operators.js';
+var name = 'RangeNode';
+var dependencies = ['Node'];
+export var createRangeNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * @constructor RangeNode
+   * @extends {Node}
+   * create a range
+   * @param {Node} start  included lower-bound
+   * @param {Node} end    included upper-bound
+   * @param {Node} [step] optional step
+   */
+  function RangeNode(start, end, step) {
+    if (!(this instanceof RangeNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate inputs
+
+
+    if (!isNode(start)) throw new TypeError('Node expected');
+    if (!isNode(end)) throw new TypeError('Node expected');
+    if (step && !isNode(step)) throw new TypeError('Node expected');
+    if (arguments.length > 3) throw new Error('Too many arguments');
+    this.start = start; // included lower-bound
+
+    this.end = end; // included upper-bound
+
+    this.step = step || null; // optional step
+  }
+
+  RangeNode.prototype = new Node();
+  RangeNode.prototype.type = 'RangeNode';
+  RangeNode.prototype.isRangeNode = true;
+  /**
+   * Check whether the RangeNode needs the `end` symbol to be defined.
+   * This end is the size of the Matrix in current dimension.
+   * @return {boolean}
+   */
+
+  RangeNode.prototype.needsEnd = function () {
+    // find all `end` symbols in this RangeNode
+    var endSymbols = this.filter(function (node) {
+      return isSymbolNode(node) && node.name === 'end';
+    });
+    return endSymbols.length > 0;
+  };
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+
+  RangeNode.prototype._compile = function (math, argNames) {
+    var range = math.range;
+
+    var evalStart = this.start._compile(math, argNames);
+
+    var evalEnd = this.end._compile(math, argNames);
+
+    if (this.step) {
+      var evalStep = this.step._compile(math, argNames);
+
+      return function evalRangeNode(scope, args, context) {
+        return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));
+      };
+    } else {
+      return function evalRangeNode(scope, args, context) {
+        return range(evalStart(scope, args, context), evalEnd(scope, args, context));
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  RangeNode.prototype.forEach = function (callback) {
+    callback(this.start, 'start', this);
+    callback(this.end, 'end', this);
+
+    if (this.step) {
+      callback(this.step, 'step', this);
+    }
+  };
+  /**
+   * Create a new RangeNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {RangeNode} Returns a transformed copy of the node
+   */
+
+
+  RangeNode.prototype.map = function (callback) {
+    return new RangeNode(this._ifNode(callback(this.start, 'start', this)), this._ifNode(callback(this.end, 'end', this)), this.step && this._ifNode(callback(this.step, 'step', this)));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {RangeNode}
+   */
+
+
+  RangeNode.prototype.clone = function () {
+    return new RangeNode(this.start, this.end, this.step && this.step);
+  };
+  /**
+   * Calculate the necessary parentheses
+   * @param {Node} node
+   * @param {string} parenthesis
+   * @return {Object} parentheses
+   * @private
+   */
+
+
+  function calculateNecessaryParentheses(node, parenthesis) {
+    var precedence = getPrecedence(node, parenthesis);
+    var parens = {};
+    var startPrecedence = getPrecedence(node.start, parenthesis);
+    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';
+
+    if (node.step) {
+      var stepPrecedence = getPrecedence(node.step, parenthesis);
+      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';
+    }
+
+    var endPrecedence = getPrecedence(node.end, parenthesis);
+    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';
+    return parens;
+  }
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RangeNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop
+
+    var str;
+    var start = this.start.toString(options);
+
+    if (parens.start) {
+      start = '(' + start + ')';
+    }
+
+    str = start;
+
+    if (this.step) {
+      var step = this.step.toString(options);
+
+      if (parens.step) {
+        step = '(' + step + ')';
+      }
+
+      str += ':' + step;
+    }
+
+    var end = this.end.toString(options);
+
+    if (parens.end) {
+      end = '(' + end + ')';
+    }
+
+    str += ':' + end;
+    return str;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  RangeNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'RangeNode',
+      start: this.start,
+      end: this.end,
+      step: this.step
+    };
+  };
+  /**
+   * Instantiate an RangeNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "RangeNode", "start": ..., "end": ..., "step": ...}`,
+   *                       where mathjs is optional
+   * @returns {RangeNode}
+   */
+
+
+  RangeNode.fromJSON = function (json) {
+    return new RangeNode(json.start, json.end, json.step);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RangeNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop
+
+    var str;
+    var start = this.start.toHTML(options);
+
+    if (parens.start) {
+      start = '<span class="math-parenthesis math-round-parenthesis">(</span>' + start + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    str = start;
+
+    if (this.step) {
+      var step = this.step.toHTML(options);
+
+      if (parens.step) {
+        step = '<span class="math-parenthesis math-round-parenthesis">(</span>' + step + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+
+      str += '<span class="math-operator math-range-operator">:</span>' + step;
+    }
+
+    var end = this.end.toHTML(options);
+
+    if (parens.end) {
+      end = '<span class="math-parenthesis math-round-parenthesis">(</span>' + end + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+    }
+
+    str += '<span class="math-operator math-range-operator">:</span>' + end;
+    return str;
+  };
+  /**
+   * Get LaTeX representation
+   * @params {Object} options
+   * @return {string} str
+   */
+
+
+  RangeNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var parens = calculateNecessaryParentheses(this, parenthesis);
+    var str = this.start.toTex(options);
+
+    if (parens.start) {
+      str = "\\left(".concat(str, "\\right)");
+    }
+
+    if (this.step) {
+      var step = this.step.toTex(options);
+
+      if (parens.step) {
+        step = "\\left(".concat(step, "\\right)");
+      }
+
+      str += ':' + step;
+    }
+
+    var end = this.end.toTex(options);
+
+    if (parens.end) {
+      end = "\\left(".concat(end, "\\right)");
+    }
+
+    str += ':' + end;
+    return str;
+  };
+
+  return RangeNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js b/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js
new file mode 100644
index 0000000..d382d70
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js
@@ -0,0 +1,212 @@
+import { getPrecedence } from '../operators.js';
+import { escape } from '../../utils/string.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { latexOperators } from '../../utils/latex.js';
+import { factory } from '../../utils/factory.js';
+var name = 'RelationalNode';
+var dependencies = ['Node'];
+export var createRelationalNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+
+  /**
+   * A node representing a chained conditional expression, such as 'x > y > z'
+   *
+   * @param {String[]} conditionals   An array of conditional operators used to compare the parameters
+   * @param {Node[]} params   The parameters that will be compared
+   *
+   * @constructor RelationalNode
+   * @extends {Node}
+   */
+  function RelationalNode(conditionals, params) {
+    if (!(this instanceof RelationalNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (!Array.isArray(conditionals)) throw new TypeError('Parameter conditionals must be an array');
+    if (!Array.isArray(params)) throw new TypeError('Parameter params must be an array');
+    if (conditionals.length !== params.length - 1) throw new TypeError('Parameter params must contain exactly one more element than parameter conditionals');
+    this.conditionals = conditionals;
+    this.params = params;
+  }
+
+  RelationalNode.prototype = new Node();
+  RelationalNode.prototype.type = 'RelationalNode';
+  RelationalNode.prototype.isRelationalNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  RelationalNode.prototype._compile = function (math, argNames) {
+    var self = this;
+    var compiled = this.params.map(p => p._compile(math, argNames));
+    return function evalRelationalNode(scope, args, context) {
+      var evalLhs;
+      var evalRhs = compiled[0](scope, args, context);
+
+      for (var i = 0; i < self.conditionals.length; i++) {
+        evalLhs = evalRhs;
+        evalRhs = compiled[i + 1](scope, args, context);
+        var condFn = getSafeProperty(math, self.conditionals[i]);
+
+        if (!condFn(evalLhs, evalRhs)) {
+          return false;
+        }
+      }
+
+      return true;
+    };
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  RelationalNode.prototype.forEach = function (callback) {
+    this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);
+  };
+  /**
+   * Create a new RelationalNode having its childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node): Node} callback
+   * @returns {RelationalNode} Returns a transformed copy of the node
+   */
+
+
+  RelationalNode.prototype.map = function (callback) {
+    return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this));
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {RelationalNode}
+   */
+
+
+  RelationalNode.prototype.clone = function () {
+    return new RelationalNode(this.conditionals, this.params);
+  };
+  /**
+   * Get string representation.
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RelationalNode.prototype._toString = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = getPrecedence(this, parenthesis);
+    var paramStrings = this.params.map(function (p, index) {
+      var paramPrecedence = getPrecedence(p, parenthesis);
+      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);
+    });
+    var operatorMap = {
+      equal: '==',
+      unequal: '!=',
+      smaller: '<',
+      larger: '>',
+      smallerEq: '<=',
+      largerEq: '>='
+    };
+    var ret = paramStrings[0];
+
+    for (var i = 0; i < this.conditionals.length; i++) {
+      ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1];
+    }
+
+    return ret;
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  RelationalNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'RelationalNode',
+      conditionals: this.conditionals,
+      params: this.params
+    };
+  };
+  /**
+   * Instantiate a RelationalNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "RelationalNode", "condition": ..., "trueExpr": ..., "falseExpr": ...}`,
+   *                       where mathjs is optional
+   * @returns {RelationalNode}
+   */
+
+
+  RelationalNode.fromJSON = function (json) {
+    return new RelationalNode(json.conditionals, json.params);
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RelationalNode.prototype.toHTML = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = getPrecedence(this, parenthesis);
+    var paramStrings = this.params.map(function (p, index) {
+      var paramPrecedence = getPrecedence(p, parenthesis);
+      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '<span class="math-parenthesis math-round-parenthesis">(</span>' + p.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>' : p.toHTML(options);
+    });
+    var operatorMap = {
+      equal: '==',
+      unequal: '!=',
+      smaller: '<',
+      larger: '>',
+      smallerEq: '<=',
+      largerEq: '>='
+    };
+    var ret = paramStrings[0];
+
+    for (var i = 0; i < this.conditionals.length; i++) {
+      ret += '<span class="math-operator math-binary-operator math-explicit-binary-operator">' + escape(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1];
+    }
+
+    return ret;
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   */
+
+
+  RelationalNode.prototype._toTex = function (options) {
+    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+    var precedence = getPrecedence(this, parenthesis);
+    var paramStrings = this.params.map(function (p, index) {
+      var paramPrecedence = getPrecedence(p, parenthesis);
+      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\left(' + p.toTex(options) + '\right)' : p.toTex(options);
+    });
+    var ret = paramStrings[0];
+
+    for (var i = 0; i < this.conditionals.length; i++) {
+      ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1];
+    }
+
+    return ret;
+  };
+
+  return RelationalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js b/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js
new file mode 100644
index 0000000..e3b1b0d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js
@@ -0,0 +1,207 @@
+import { escape } from '../../utils/string.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { toSymbol } from '../../utils/latex.js';
+var name = 'SymbolNode';
+var dependencies = ['math', '?Unit', 'Node'];
+export var createSymbolNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    math,
+    Unit,
+    Node
+  } = _ref;
+
+  /**
+   * Check whether some name is a valueless unit like "inch".
+   * @param {string} name
+   * @return {boolean}
+   */
+  function isValuelessUnit(name) {
+    return Unit ? Unit.isValuelessUnit(name) : false;
+  }
+  /**
+   * @constructor SymbolNode
+   * @extends {Node}
+   * A symbol node can hold and resolve a symbol
+   * @param {string} name
+   * @extends {Node}
+   */
+
+
+  function SymbolNode(name) {
+    if (!(this instanceof SymbolNode)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // validate input
+
+
+    if (typeof name !== 'string') throw new TypeError('String expected for parameter "name"');
+    this.name = name;
+  }
+
+  SymbolNode.prototype = new Node();
+  SymbolNode.prototype.type = 'SymbolNode';
+  SymbolNode.prototype.isSymbolNode = true;
+  /**
+   * Compile a node into a JavaScript function.
+   * This basically pre-calculates as much as possible and only leaves open
+   * calculations which depend on a dynamic scope with variables.
+   * @param {Object} math     Math.js namespace with functions and constants.
+   * @param {Object} argNames An object with argument names as key and `true`
+   *                          as value. Used in the SymbolNode to optimize
+   *                          for arguments from user assigned functions
+   *                          (see FunctionAssignmentNode) or special symbols
+   *                          like `end` (see IndexNode).
+   * @return {function} Returns a function which can be called like:
+   *                        evalNode(scope: Object, args: Object, context: *)
+   */
+
+  SymbolNode.prototype._compile = function (math, argNames) {
+    var name = this.name;
+
+    if (argNames[name] === true) {
+      // this is a FunctionAssignment argument
+      // (like an x when inside the expression of a function assignment `f(x) = ...`)
+      return function (scope, args, context) {
+        return args[name];
+      };
+    } else if (name in math) {
+      return function (scope, args, context) {
+        return scope.has(name) ? scope.get(name) : getSafeProperty(math, name);
+      };
+    } else {
+      var isUnit = isValuelessUnit(name);
+      return function (scope, args, context) {
+        return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);
+      };
+    }
+  };
+  /**
+   * Execute a callback for each of the child nodes of this node
+   * @param {function(child: Node, path: string, parent: Node)} callback
+   */
+
+
+  SymbolNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs
+  };
+  /**
+   * Create a new SymbolNode having it's childs be the results of calling
+   * the provided callback function for each of the childs of the original node.
+   * @param {function(child: Node, path: string, parent: Node) : Node} callback
+   * @returns {SymbolNode} Returns a clone of the node
+   */
+
+
+  SymbolNode.prototype.map = function (callback) {
+    return this.clone();
+  };
+  /**
+   * Throws an error 'Undefined symbol {name}'
+   * @param {string} name
+   */
+
+
+  SymbolNode.onUndefinedSymbol = function (name) {
+    throw new Error('Undefined symbol ' + name);
+  };
+  /**
+   * Create a clone of this node, a shallow copy
+   * @return {SymbolNode}
+   */
+
+
+  SymbolNode.prototype.clone = function () {
+    return new SymbolNode(this.name);
+  };
+  /**
+   * Get string representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  SymbolNode.prototype._toString = function (options) {
+    return this.name;
+  };
+  /**
+   * Get HTML representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  SymbolNode.prototype.toHTML = function (options) {
+    var name = escape(this.name);
+
+    if (name === 'true' || name === 'false') {
+      return '<span class="math-symbol math-boolean">' + name + '</span>';
+    } else if (name === 'i') {
+      return '<span class="math-symbol math-imaginary-symbol">' + name + '</span>';
+    } else if (name === 'Infinity') {
+      return '<span class="math-symbol math-infinity-symbol">' + name + '</span>';
+    } else if (name === 'NaN') {
+      return '<span class="math-symbol math-nan-symbol">' + name + '</span>';
+    } else if (name === 'null') {
+      return '<span class="math-symbol math-null-symbol">' + name + '</span>';
+    } else if (name === 'undefined') {
+      return '<span class="math-symbol math-undefined-symbol">' + name + '</span>';
+    }
+
+    return '<span class="math-symbol">' + name + '</span>';
+  };
+  /**
+   * Get a JSON representation of the node
+   * @returns {Object}
+   */
+
+
+  SymbolNode.prototype.toJSON = function () {
+    return {
+      mathjs: 'SymbolNode',
+      name: this.name
+    };
+  };
+  /**
+   * Instantiate a SymbolNode from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SymbolNode", name: "x"}`,
+   *                       where mathjs is optional
+   * @returns {SymbolNode}
+   */
+
+
+  SymbolNode.fromJSON = function (json) {
+    return new SymbolNode(json.name);
+  };
+  /**
+   * Get LaTeX representation
+   * @param {Object} options
+   * @return {string} str
+   * @override
+   */
+
+
+  SymbolNode.prototype._toTex = function (options) {
+    var isUnit = false;
+
+    if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {
+      isUnit = true;
+    }
+
+    var symbol = toSymbol(this.name, isUnit);
+
+    if (symbol[0] === '\\') {
+      // no space needed if the symbol starts with '\'
+      return symbol;
+    } // the space prevents symbols from breaking stuff like '\cdot' if it's written right before the symbol
+
+
+    return ' ' + symbol;
+  };
+
+  return SymbolNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/utils/access.js b/node_modules/mathjs/lib/esm/expression/node/utils/access.js
new file mode 100644
index 0000000..a82c2bf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/utils/access.js
@@ -0,0 +1,42 @@
+import { errorTransform } from '../../transform/utils/errorTransform.js';
+import { getSafeProperty } from '../../../utils/customs.js';
+export function accessFactory(_ref) {
+  var {
+    subset
+  } = _ref;
+
+  /**
+   * Retrieve part of an object:
+   *
+   * - Retrieve a property from an object
+   * - Retrieve a part of a string
+   * - Retrieve a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @return {Object | Array | Matrix | string} Returns the subset
+   */
+  return function access(object, index) {
+    try {
+      if (Array.isArray(object)) {
+        return subset(object, index);
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index);
+      } else if (typeof object === 'string') {
+        // TODO: move getStringSubset into a separate util file, use that
+        return subset(object, index);
+      } else if (typeof object === 'object') {
+        if (!index.isObjectProperty()) {
+          throw new TypeError('Cannot apply a numeric index as object property');
+        }
+
+        return getSafeProperty(object, index.getObjectProperty());
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw errorTransform(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/utils/assign.js b/node_modules/mathjs/lib/esm/expression/node/utils/assign.js
new file mode 100644
index 0000000..446c4c7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/utils/assign.js
@@ -0,0 +1,48 @@
+import { errorTransform } from '../../transform/utils/errorTransform.js';
+import { setSafeProperty } from '../../../utils/customs.js';
+export function assignFactory(_ref) {
+  var {
+    subset,
+    matrix
+  } = _ref;
+
+  /**
+   * Replace part of an object:
+   *
+   * - Assign a property to an object
+   * - Replace a part of a string
+   * - Replace a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @param {*} value
+   * @return {Object | Array | Matrix | string} Returns the original object
+   *                                            except in case of a string
+   */
+  // TODO: change assign to return the value instead of the object
+  return function assign(object, index, value) {
+    try {
+      if (Array.isArray(object)) {
+        // we use matrix.subset here instead of the function subset because we must not clone the contents
+        return matrix(object).subset(index, value).valueOf();
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index, value);
+      } else if (typeof object === 'string') {
+        // TODO: move setStringSubset into a separate util file, use that
+        return subset(object, index, value);
+      } else if (typeof object === 'object') {
+        if (!index.isObjectProperty()) {
+          throw TypeError('Cannot apply a numeric index as object property');
+        }
+
+        setSafeProperty(object, index.getObjectProperty(), value);
+        return object;
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw errorTransform(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/operators.js b/node_modules/mathjs/lib/esm/expression/operators.js
new file mode 100644
index 0000000..f59fc8f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/operators.js
@@ -0,0 +1,309 @@
+// list of identifiers of nodes in order of their precedence
+// also contains information about left/right associativity
+// and which other operator the operator is associative with
+// Example:
+// addition is associative with addition and subtraction, because:
+// (a+b)+c=a+(b+c)
+// (a+b)-c=a+(b-c)
+//
+// postfix operators are left associative, prefix operators
+// are right associative
+//
+// It's also possible to set the following properties:
+// latexParens: if set to false, this node doesn't need to be enclosed
+//              in parentheses when using LaTeX
+// latexLeftParens: if set to false, this !OperatorNode's!
+//                  left argument doesn't need to be enclosed
+//                  in parentheses
+// latexRightParens: the same for the right argument
+import { hasOwnProperty } from '../utils/object.js';
+export var properties = [{
+  // assignment
+  AssignmentNode: {},
+  FunctionAssignmentNode: {}
+}, {
+  // conditional expression
+  ConditionalNode: {
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false // conditionals don't need parentheses in LaTeX because
+    // they are 2 dimensional
+
+  }
+}, {
+  // logical or
+  'OperatorNode:or': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical xor
+  'OperatorNode:xor': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical and
+  'OperatorNode:and': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise or
+  'OperatorNode:bitOr': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise xor
+  'OperatorNode:bitXor': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise and
+  'OperatorNode:bitAnd': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // relational operators
+  'OperatorNode:equal': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:unequal': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smaller': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:larger': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smallerEq': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:largerEq': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  RelationalNode: {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitshift operators
+  'OperatorNode:leftShift': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightArithShift': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightLogShift': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // unit conversion
+  'OperatorNode:to': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // range
+  RangeNode: {}
+}, {
+  // addition, subtraction
+  'OperatorNode:add': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']
+  },
+  'OperatorNode:subtract': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // multiply, divide, modulus
+  'OperatorNode:multiply': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']
+  },
+  'OperatorNode:divide': {
+    associativity: 'left',
+    associativeWith: [],
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false // fractions don't require parentheses because
+    // they're 2 dimensional, so parens aren't needed
+    // in LaTeX
+
+  },
+  'OperatorNode:dotMultiply': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']
+  },
+  'OperatorNode:dotDivide': {
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:mod': {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // unary prefix operators
+  'OperatorNode:unaryPlus': {
+    associativity: 'right'
+  },
+  'OperatorNode:unaryMinus': {
+    associativity: 'right'
+  },
+  'OperatorNode:bitNot': {
+    associativity: 'right'
+  },
+  'OperatorNode:not': {
+    associativity: 'right'
+  }
+}, {
+  // exponentiation
+  'OperatorNode:pow': {
+    associativity: 'right',
+    associativeWith: [],
+    latexRightParens: false // the exponent doesn't need parentheses in
+    // LaTeX because it's 2 dimensional
+    // (it's on top)
+
+  },
+  'OperatorNode:dotPow': {
+    associativity: 'right',
+    associativeWith: []
+  }
+}, {
+  // factorial
+  'OperatorNode:factorial': {
+    associativity: 'left'
+  }
+}, {
+  // matrix transpose
+  'OperatorNode:transpose': {
+    associativity: 'left'
+  }
+}];
+/**
+ * Get the precedence of a Node.
+ * Higher number for higher precedence, starting with 0.
+ * Returns null if the precedence is undefined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {number | null}
+ */
+
+export function getPrecedence(_node, parenthesis) {
+  var node = _node;
+
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+
+  var identifier = node.getIdentifier();
+
+  for (var i = 0; i < properties.length; i++) {
+    if (identifier in properties[i]) {
+      return i;
+    }
+  }
+
+  return null;
+}
+/**
+ * Get the associativity of an operator (left or right).
+ * Returns a string containing 'left' or 'right' or null if
+ * the associativity is not defined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {string|null}
+ * @throws {Error}
+ */
+
+export function getAssociativity(_node, parenthesis) {
+  var node = _node;
+
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+
+  var identifier = node.getIdentifier();
+  var index = getPrecedence(node, parenthesis);
+
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+
+  var property = properties[index][identifier];
+
+  if (hasOwnProperty(property, 'associativity')) {
+    if (property.associativity === 'left') {
+      return 'left';
+    }
+
+    if (property.associativity === 'right') {
+      return 'right';
+    } // associativity is invalid
+
+
+    throw Error('\'' + identifier + '\' has the invalid associativity \'' + property.associativity + '\'.');
+  } // associativity is undefined
+
+
+  return null;
+}
+/**
+ * Check if an operator is associative with another operator.
+ * Returns either true or false or null if not defined.
+ *
+ * @param {Node} nodeA
+ * @param {Node} nodeB
+ * @param {string} parenthesis
+ * @return {boolean | null}
+ */
+
+export function isAssociativeWith(nodeA, nodeB, parenthesis) {
+  // ParenthesisNodes are only ignored when not in 'keep' mode
+  var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;
+  var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;
+  var identifierA = a.getIdentifier();
+  var identifierB = b.getIdentifier();
+  var index = getPrecedence(a, parenthesis);
+
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+
+  var property = properties[index][identifierA];
+
+  if (hasOwnProperty(property, 'associativeWith') && property.associativeWith instanceof Array) {
+    for (var i = 0; i < property.associativeWith.length; i++) {
+      if (property.associativeWith[i] === identifierB) {
+        return true;
+      }
+    }
+
+    return false;
+  } // associativeWith is not defined
+
+
+  return null;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/parse.js b/node_modules/mathjs/lib/esm/expression/parse.js
new file mode 100644
index 0000000..d498815
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/parse.js
@@ -0,0 +1,1802 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { factory } from '../utils/factory.js';
+import { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode } from '../utils/is.js';
+import { deepMap } from '../utils/collection.js';
+import { hasOwnProperty } from '../utils/object.js';
+var name = 'parse';
+var dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];
+export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    numeric,
+    config,
+    AccessorNode,
+    ArrayNode,
+    AssignmentNode,
+    BlockNode,
+    ConditionalNode,
+    ConstantNode,
+    FunctionAssignmentNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    RangeNode,
+    RelationalNode,
+    SymbolNode
+  } = _ref;
+
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate().
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.parse(expr)
+   *     math.parse(expr, options)
+   *     math.parse([expr1, expr2, expr3, ...])
+   *     math.parse([expr1, expr2, expr3, ...], options)
+   *
+   * Example:
+   *
+   *     const node1 = math.parse('sqrt(3^2 + 4^2)')
+   *     node1.compile().evaluate() // 5
+   *
+   *     let scope = {a:3, b:4}
+   *     const node2 = math.parse('a * b') // 12
+   *     const code2 = node2.compile()
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].compile().evaluate() // 12
+   *
+   * See also:
+   *
+   *     evaluate, compile
+   *
+   * @param {string | string[] | Matrix} expr          Expression to be parsed
+   * @param {{nodes: Object<string, Node>}} [options]  Available options:
+   *                                                   - `nodes` a set of custom nodes
+   * @return {Node | Node[]} node
+   * @throws {Error}
+   */
+  var parse = typed(name, {
+    string: function string(expression) {
+      return parseStart(expression, {});
+    },
+    'Array | Matrix': function ArrayMatrix(expressions) {
+      return parseMultiple(expressions, {});
+    },
+    'string, Object': function stringObject(expression, options) {
+      var extraNodes = options.nodes !== undefined ? options.nodes : {};
+      return parseStart(expression, extraNodes);
+    },
+    'Array | Matrix, Object': parseMultiple
+  });
+
+  function parseMultiple(expressions) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    var extraNodes = options.nodes !== undefined ? options.nodes : {}; // parse an array or matrix with expressions
+
+    return deepMap(expressions, function (elem) {
+      if (typeof elem !== 'string') throw new TypeError('String expected');
+      return parseStart(elem, extraNodes);
+    });
+  } // token types enumeration
+
+
+  var TOKENTYPE = {
+    NULL: 0,
+    DELIMITER: 1,
+    NUMBER: 2,
+    SYMBOL: 3,
+    UNKNOWN: 4
+  }; // map with all delimiters
+
+  var DELIMITERS = {
+    ',': true,
+    '(': true,
+    ')': true,
+    '[': true,
+    ']': true,
+    '{': true,
+    '}': true,
+    '"': true,
+    '\'': true,
+    ';': true,
+    '+': true,
+    '-': true,
+    '*': true,
+    '.*': true,
+    '/': true,
+    './': true,
+    '%': true,
+    '^': true,
+    '.^': true,
+    '~': true,
+    '!': true,
+    '&': true,
+    '|': true,
+    '^|': true,
+    '=': true,
+    ':': true,
+    '?': true,
+    '==': true,
+    '!=': true,
+    '<': true,
+    '>': true,
+    '<=': true,
+    '>=': true,
+    '<<': true,
+    '>>': true,
+    '>>>': true
+  }; // map with all named delimiters
+
+  var NAMED_DELIMITERS = {
+    mod: true,
+    to: true,
+    in: true,
+    and: true,
+    xor: true,
+    or: true,
+    not: true
+  };
+  var CONSTANTS = {
+    true: true,
+    false: false,
+    null: null,
+    undefined: undefined
+  };
+  var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];
+
+  function initialState() {
+    return {
+      extraNodes: {},
+      // current extra nodes, must be careful not to mutate
+      expression: '',
+      // current expression
+      comment: '',
+      // last parsed comment
+      index: 0,
+      // current index in expr
+      token: '',
+      // current token
+      tokenType: TOKENTYPE.NULL,
+      // type of the token
+      nestingLevel: 0,
+      // level of nesting inside parameters, used to ignore newline characters
+      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here
+
+    };
+  }
+  /**
+   * View upto `length` characters of the expression starting at the current character.
+   *
+   * @param {Object} state
+   * @param {number} [length=1] Number of characters to view
+   * @returns {string}
+   * @private
+   */
+
+
+  function currentString(state, length) {
+    return state.expression.substr(state.index, length);
+  }
+  /**
+   * View the current character. Returns '' if end of expression is reached.
+   *
+   * @param {Object} state
+   * @returns {string}
+   * @private
+   */
+
+
+  function currentCharacter(state) {
+    return currentString(state, 1);
+  }
+  /**
+   * Get the next character from the expression.
+   * The character is stored into the char c. If the end of the expression is
+   * reached, the function puts an empty string in c.
+   * @private
+   */
+
+
+  function next(state) {
+    state.index++;
+  }
+  /**
+   * Preview the previous character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+
+
+  function prevCharacter(state) {
+    return state.expression.charAt(state.index - 1);
+  }
+  /**
+   * Preview the next character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+
+
+  function nextCharacter(state) {
+    return state.expression.charAt(state.index + 1);
+  }
+  /**
+   * Get next token in the current string expr.
+   * The token and token type are available as token and tokenType
+   * @private
+   */
+
+
+  function getToken(state) {
+    state.tokenType = TOKENTYPE.NULL;
+    state.token = '';
+    state.comment = ''; // skip over ignored characters:
+
+    while (true) {
+      // comments:
+      if (currentCharacter(state) === '#') {
+        while (currentCharacter(state) !== '\n' && currentCharacter(state) !== '') {
+          state.comment += currentCharacter(state);
+          next(state);
+        }
+      } // whitespace: space, tab, and newline when inside parameters
+
+
+      if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {
+        next(state);
+      } else {
+        break;
+      }
+    } // check for end of expression
+
+
+    if (currentCharacter(state) === '') {
+      // token is still empty
+      state.tokenType = TOKENTYPE.DELIMITER;
+      return;
+    } // check for new line character
+
+
+    if (currentCharacter(state) === '\n' && !state.nestingLevel) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = currentCharacter(state);
+      next(state);
+      return;
+    }
+
+    var c1 = currentCharacter(state);
+    var c2 = currentString(state, 2);
+    var c3 = currentString(state, 3);
+
+    if (c3.length === 3 && DELIMITERS[c3]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c3;
+      next(state);
+      next(state);
+      next(state);
+      return;
+    } // check for delimiters consisting of 2 characters
+
+
+    if (c2.length === 2 && DELIMITERS[c2]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c2;
+      next(state);
+      next(state);
+      return;
+    } // check for delimiters consisting of 1 character
+
+
+    if (DELIMITERS[c1]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c1;
+      next(state);
+      return;
+    } // check for a number
+
+
+    if (parse.isDigitDot(c1)) {
+      state.tokenType = TOKENTYPE.NUMBER; // check for binary, octal, or hex
+
+      var _c = currentString(state, 2);
+
+      if (_c === '0b' || _c === '0o' || _c === '0x') {
+        state.token += currentCharacter(state);
+        next(state);
+        state.token += currentCharacter(state);
+        next(state);
+
+        while (parse.isHexDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+
+        if (currentCharacter(state) === '.') {
+          // this number has a radix point
+          state.token += '.';
+          next(state); // get the digits after the radix
+
+          while (parse.isHexDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        } else if (currentCharacter(state) === 'i') {
+          // this number has a word size suffix
+          state.token += 'i';
+          next(state); // get the word size
+
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        }
+
+        return;
+      } // get number, can have a single dot
+
+
+      if (currentCharacter(state) === '.') {
+        state.token += currentCharacter(state);
+        next(state);
+
+        if (!parse.isDigit(currentCharacter(state))) {
+          // this is no number, it is just a dot (can be dot notation)
+          state.tokenType = TOKENTYPE.DELIMITER;
+          return;
+        }
+      } else {
+        while (parse.isDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+
+        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+      }
+
+      while (parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      } // check for exponential notation like "2.3e-4", "1.23e50" or "2e+4"
+
+
+      if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {
+        if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {
+          state.token += currentCharacter(state);
+          next(state);
+
+          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {
+            state.token += currentCharacter(state);
+            next(state);
+          } // Scientific notation MUST be followed by an exponent
+
+
+          if (!parse.isDigit(currentCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+
+          if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+        } else if (nextCharacter(state) === '.') {
+          next(state);
+          throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+        }
+      }
+
+      return;
+    } // check for variables, functions, named operators
+
+
+    if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {
+      while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      }
+
+      if (hasOwnProperty(NAMED_DELIMITERS, state.token)) {
+        state.tokenType = TOKENTYPE.DELIMITER;
+      } else {
+        state.tokenType = TOKENTYPE.SYMBOL;
+      }
+
+      return;
+    } // something unknown is found, wrong characters -> a syntax error
+
+
+    state.tokenType = TOKENTYPE.UNKNOWN;
+
+    while (currentCharacter(state) !== '') {
+      state.token += currentCharacter(state);
+      next(state);
+    }
+
+    throw createSyntaxError(state, 'Syntax error in part "' + state.token + '"');
+  }
+  /**
+   * Get next token and skip newline tokens
+   */
+
+
+  function getTokenSkipNewline(state) {
+    do {
+      getToken(state);
+    } while (state.token === '\n'); // eslint-disable-line no-unmodified-loop-condition
+
+  }
+  /**
+   * Open parameters.
+   * New line characters will be ignored until closeParams(state) is called
+   */
+
+
+  function openParams(state) {
+    state.nestingLevel++;
+  }
+  /**
+   * Close parameters.
+   * New line characters will no longer be ignored
+   */
+
+
+  function closeParams(state) {
+    state.nestingLevel--;
+  }
+  /**
+   * Checks whether the current character `c` is a valid alpha character:
+   *
+   * - A latin letter (upper or lower case) Ascii: a-z, A-Z
+   * - An underscore                        Ascii: _
+   * - A dollar sign                        Ascii: $
+   * - A latin letter with accents          Unicode: \u00C0 - \u02AF
+   * - A greek letter                       Unicode: \u0370 - \u03FF
+   * - A mathematical alphanumeric symbol   Unicode: \u{1D400} - \u{1D7FF} excluding invalid code points
+   *
+   * The previous and next characters are needed to determine whether
+   * this character is part of a unicode surrogate pair.
+   *
+   * @param {string} c      Current character in the expression
+   * @param {string} cPrev  Previous character
+   * @param {string} cNext  Next character
+   * @return {boolean}
+   */
+
+
+  parse.isAlpha = function isAlpha(c, cPrev, cNext) {
+    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);
+  };
+  /**
+   * Test whether a character is a valid latin, greek, or letter-like character
+   * @param {string} c
+   * @return {boolean}
+   */
+
+
+  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {
+    return /^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(c);
+  };
+  /**
+   * Test whether two given 16 bit characters form a surrogate pair of a
+   * unicode math symbol.
+   *
+   * https://unicode-table.com/en/
+   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode
+   *
+   * Note: In ES6 will be unicode aware:
+   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes
+   * https://mathiasbynens.be/notes/es6-unicode-regex
+   *
+   * @param {string} high
+   * @param {string} low
+   * @return {boolean}
+   */
+
+
+  parse.isValidMathSymbol = function isValidMathSymbol(high, low) {
+    return /^[\uD835]$/.test(high) && /^[\uDC00-\uDFFF]$/.test(low) && /^[^\uDC55\uDC9D\uDCA0\uDCA1\uDCA3\uDCA4\uDCA7\uDCA8\uDCAD\uDCBA\uDCBC\uDCC4\uDD06\uDD0B\uDD0C\uDD15\uDD1D\uDD3A\uDD3F\uDD45\uDD47-\uDD49\uDD51\uDEA6\uDEA7\uDFCC\uDFCD]$/.test(low);
+  };
+  /**
+   * Check whether given character c is a white space character: space, tab, or enter
+   * @param {string} c
+   * @param {number} nestingLevel
+   * @return {boolean}
+   */
+
+
+  parse.isWhitespace = function isWhitespace(c, nestingLevel) {
+    // TODO: also take '\r' carriage return as newline? Or does that give problems on mac?
+    return c === ' ' || c === '\t' || c === '\n' && nestingLevel > 0;
+  };
+  /**
+   * Test whether the character c is a decimal mark (dot).
+   * This is the case when it's not the start of a delimiter '.*', './', or '.^'
+   * @param {string} c
+   * @param {string} cNext
+   * @return {boolean}
+   */
+
+
+  parse.isDecimalMark = function isDecimalMark(c, cNext) {
+    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';
+  };
+  /**
+   * checks if the given char c is a digit or dot
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+
+
+  parse.isDigitDot = function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  };
+  /**
+   * checks if the given char c is a digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+
+
+  parse.isDigit = function isDigit(c) {
+    return c >= '0' && c <= '9';
+  };
+  /**
+   * checks if the given char c is a hex digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+
+
+  parse.isHexDigit = function isHexDigit(c) {
+    return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';
+  };
+  /**
+   * Start of the parse levels below, in order of precedence
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseStart(expression, extraNodes) {
+    var state = initialState();
+
+    _extends(state, {
+      expression,
+      extraNodes
+    });
+
+    getToken(state);
+    var node = parseBlock(state); // check for garbage at the end of the expression
+    // an expression ends with a empty character '' and tokenType DELIMITER
+
+    if (state.token !== '') {
+      if (state.tokenType === TOKENTYPE.DELIMITER) {
+        // user entered a not existing operator like "//"
+        // TODO: give hints for aliases, for example with "<>" give as hint " did you mean !== ?"
+        throw createError(state, 'Unexpected operator ' + state.token);
+      } else {
+        throw createSyntaxError(state, 'Unexpected part "' + state.token + '"');
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Parse a block with expressions. Expressions can be separated by a newline
+   * character '\n', or by a semicolon ';'. In case of a semicolon, no output
+   * of the preceding line is returned.
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBlock(state) {
+    var node;
+    var blocks = [];
+    var visible;
+
+    if (state.token !== '' && state.token !== '\n' && state.token !== ';') {
+      node = parseAssignment(state);
+      node.comment = state.comment;
+    } // TODO: simplify this loop
+
+
+    while (state.token === '\n' || state.token === ';') {
+      // eslint-disable-line no-unmodified-loop-condition
+      if (blocks.length === 0 && node) {
+        visible = state.token !== ';';
+        blocks.push({
+          node: node,
+          visible: visible
+        });
+      }
+
+      getToken(state);
+
+      if (state.token !== '\n' && state.token !== ';' && state.token !== '') {
+        node = parseAssignment(state);
+        node.comment = state.comment;
+        visible = state.token !== ';';
+        blocks.push({
+          node: node,
+          visible: visible
+        });
+      }
+    }
+
+    if (blocks.length > 0) {
+      return new BlockNode(blocks);
+    } else {
+      if (!node) {
+        node = new ConstantNode(undefined);
+        node.comment = state.comment;
+      }
+
+      return node;
+    }
+  }
+  /**
+   * Assignment of a function or variable,
+   * - can be a variable like 'a=2.3'
+   * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'
+   * - defining a function like 'f(x) = x^2'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseAssignment(state) {
+    var name, args, value, valid;
+    var node = parseConditional(state);
+
+    if (state.token === '=') {
+      if (isSymbolNode(node)) {
+        // parse a variable assignment like 'a = 2/3'
+        name = node.name;
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(new SymbolNode(name), value);
+      } else if (isAccessorNode(node)) {
+        // parse a matrix subset assignment like 'A[1,2] = 4'
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(node.object, node.index, value);
+      } else if (isFunctionNode(node) && isSymbolNode(node.fn)) {
+        // parse function assignment like 'f(x) = x^2'
+        valid = true;
+        args = [];
+        name = node.name;
+        node.args.forEach(function (arg, index) {
+          if (isSymbolNode(arg)) {
+            args[index] = arg.name;
+          } else {
+            valid = false;
+          }
+        });
+
+        if (valid) {
+          getTokenSkipNewline(state);
+          value = parseAssignment(state);
+          return new FunctionAssignmentNode(name, args, value);
+        }
+      }
+
+      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');
+    }
+
+    return node;
+  }
+  /**
+   * conditional operation
+   *
+   *     condition ? truePart : falsePart
+   *
+   * Note: conditional operator is right-associative
+   *
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseConditional(state) {
+    var node = parseLogicalOr(state);
+
+    while (state.token === '?') {
+      // eslint-disable-line no-unmodified-loop-condition
+      // set a conditional level, the range operator will be ignored as long
+      // as conditionalLevel === state.nestingLevel.
+      var prev = state.conditionalLevel;
+      state.conditionalLevel = state.nestingLevel;
+      getTokenSkipNewline(state);
+      var condition = node;
+      var trueExpr = parseAssignment(state);
+      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');
+      state.conditionalLevel = null;
+      getTokenSkipNewline(state);
+      var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity
+
+      node = new ConditionalNode(condition, trueExpr, falseExpr); // restore the previous conditional level
+
+      state.conditionalLevel = prev;
+    }
+
+    return node;
+  }
+  /**
+   * logical or, 'x or y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLogicalOr(state) {
+    var node = parseLogicalXor(state);
+
+    while (state.token === 'or') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * logical exclusive or, 'x xor y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLogicalXor(state) {
+    var node = parseLogicalAnd(state);
+
+    while (state.token === 'xor') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * logical and, 'x and y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLogicalAnd(state) {
+    var node = parseBitwiseOr(state);
+
+    while (state.token === 'and') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * bitwise or, 'x | y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBitwiseOr(state) {
+    var node = parseBitwiseXor(state);
+
+    while (state.token === '|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * bitwise exclusive or (xor), 'x ^| y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBitwiseXor(state) {
+    var node = parseBitwiseAnd(state);
+
+    while (state.token === '^|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * bitwise and, 'x & y'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseBitwiseAnd(state) {
+    var node = parseRelational(state);
+
+    while (state.token === '&') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)]);
+    }
+
+    return node;
+  }
+  /**
+   * Parse a chained conditional, like 'a > b >= c'
+   * @return {Node} node
+   */
+
+
+  function parseRelational(state) {
+    var params = [parseShift(state)];
+    var conditionals = [];
+    var operators = {
+      '==': 'equal',
+      '!=': 'unequal',
+      '<': 'smaller',
+      '>': 'larger',
+      '<=': 'smallerEq',
+      '>=': 'largerEq'
+    };
+
+    while (hasOwnProperty(operators, state.token)) {
+      // eslint-disable-line no-unmodified-loop-condition
+      var cond = {
+        name: state.token,
+        fn: operators[state.token]
+      };
+      conditionals.push(cond);
+      getTokenSkipNewline(state);
+      params.push(parseShift(state));
+    }
+
+    if (params.length === 1) {
+      return params[0];
+    } else if (params.length === 2) {
+      return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);
+    } else {
+      return new RelationalNode(conditionals.map(c => c.fn), params);
+    }
+  }
+  /**
+   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseShift(state) {
+    var node, name, fn, params;
+    node = parseConversion(state);
+    var operators = {
+      '<<': 'leftShift',
+      '>>': 'rightArithShift',
+      '>>>': 'rightLogShift'
+    };
+
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      params = [node, parseConversion(state)];
+      node = new OperatorNode(name, fn, params);
+    }
+
+    return node;
+  }
+  /**
+   * conversion operators 'to' and 'in'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseConversion(state) {
+    var node, name, fn, params;
+    node = parseRange(state);
+    var operators = {
+      to: 'to',
+      in: 'to' // alias of 'to'
+
+    };
+
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+
+      if (name === 'in' && state.token === '') {
+        // end of expression -> this is the unit 'in' ('inch')
+        node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);
+      } else {
+        // operator 'a to b' or 'a in b'
+        params = [node, parseRange(state)];
+        node = new OperatorNode(name, fn, params);
+      }
+    }
+
+    return node;
+  }
+  /**
+   * parse range, "start:end", "start:step:end", ":", "start:", ":end", etc
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseRange(state) {
+    var node;
+    var params = [];
+
+    if (state.token === ':') {
+      // implicit start=1 (one-based)
+      node = new ConstantNode(1);
+    } else {
+      // explicit start
+      node = parseAddSubtract(state);
+    }
+
+    if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {
+      // we ignore the range operator when a conditional operator is being processed on the same level
+      params.push(node); // parse step and end
+
+      while (state.token === ':' && params.length < 3) {
+        // eslint-disable-line no-unmodified-loop-condition
+        getTokenSkipNewline(state);
+
+        if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {
+          // implicit end
+          params.push(new SymbolNode('end'));
+        } else {
+          // explicit end
+          params.push(parseAddSubtract(state));
+        }
+      }
+
+      if (params.length === 3) {
+        // params = [start, step, end]
+        node = new RangeNode(params[0], params[2], params[1]); // start, end, step
+      } else {
+        // length === 2
+        // params = [start, end]
+        node = new RangeNode(params[0], params[1]); // start, end
+      }
+    }
+
+    return node;
+  }
+  /**
+   * add or subtract
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseAddSubtract(state) {
+    var node, name, fn, params;
+    node = parseMultiplyDivide(state);
+    var operators = {
+      '+': 'add',
+      '-': 'subtract'
+    };
+
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      var rightNode = parseMultiplyDivide(state);
+
+      if (rightNode.isPercentage) {
+        params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];
+      } else {
+        params = [node, rightNode];
+      }
+
+      node = new OperatorNode(name, fn, params);
+    }
+
+    return node;
+  }
+  /**
+   * multiply, divide, modulus
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseMultiplyDivide(state) {
+    var node, last, name, fn;
+    node = parseImplicitMultiplication(state);
+    last = node;
+    var operators = {
+      '*': 'multiply',
+      '.*': 'dotMultiply',
+      '/': 'divide',
+      './': 'dotDivide'
+    };
+
+    while (true) {
+      if (hasOwnProperty(operators, state.token)) {
+        // explicit operators
+        name = state.token;
+        fn = operators[name];
+        getTokenSkipNewline(state);
+        last = parseImplicitMultiplication(state);
+        node = new OperatorNode(name, fn, [node, last]);
+      } else {
+        break;
+      }
+    }
+
+    return node;
+  }
+  /**
+   * implicit multiplication
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseImplicitMultiplication(state) {
+    var node, last;
+    node = parseRule2(state);
+    last = node;
+
+    while (true) {
+      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && isConstantNode(node) || state.tokenType === TOKENTYPE.NUMBER && !isConstantNode(last) && (!isOperatorNode(last) || last.op === '!') || state.token === '(') {
+        // parse implicit multiplication
+        //
+        // symbol:      implicit multiplication like '2a', '(2+3)a', 'a b'
+        // number:      implicit multiplication like '(2+3)2'
+        // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'
+        last = parseRule2(state);
+        node = new OperatorNode('*', 'multiply', [node, last], true
+        /* implicit */
+        );
+      } else {
+        break;
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Infamous "rule 2" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370
+   * Explicit division gets higher precedence than implicit multiplication
+   * when the division matches this pattern: [number] / [number] [symbol]
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseRule2(state) {
+    var node = parsePercentage(state);
+    var last = node;
+    var tokenStates = [];
+
+    while (true) {
+      // Match the "number /" part of the pattern "number / number symbol"
+      if (state.token === '/' && isConstantNode(last)) {
+        // Look ahead to see if the next token is a number
+        tokenStates.push(_extends({}, state));
+        getTokenSkipNewline(state); // Match the "number / number" part of the pattern
+
+        if (state.tokenType === TOKENTYPE.NUMBER) {
+          // Look ahead again
+          tokenStates.push(_extends({}, state));
+          getTokenSkipNewline(state); // Match the "symbol" part of the pattern, or a left parenthesis
+
+          if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(') {
+            // We've matched the pattern "number / number symbol".
+            // Rewind once and build the "number / number" node; the symbol will be consumed later
+            _extends(state, tokenStates.pop());
+
+            tokenStates.pop();
+            last = parsePercentage(state);
+            node = new OperatorNode('/', 'divide', [node, last]);
+          } else {
+            // Not a match, so rewind
+            tokenStates.pop();
+
+            _extends(state, tokenStates.pop());
+
+            break;
+          }
+        } else {
+          // Not a match, so rewind
+          _extends(state, tokenStates.pop());
+
+          break;
+        }
+      } else {
+        break;
+      }
+    }
+
+    return node;
+  }
+  /**
+   * percentage or mod
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parsePercentage(state) {
+    var node, name, fn, params;
+    node = parseUnary(state);
+    var operators = {
+      '%': 'mod',
+      mod: 'mod'
+    };
+
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+
+      if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {
+        // If the expression contains only %, then treat that as /100
+        node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);
+      } else {
+        params = [node, parseUnary(state)];
+        node = new OperatorNode(name, fn, params);
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Unary plus and minus, and logical and bitwise not
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseUnary(state) {
+    var name, params, fn;
+    var operators = {
+      '-': 'unaryMinus',
+      '+': 'unaryPlus',
+      '~': 'bitNot',
+      not: 'not'
+    };
+
+    if (hasOwnProperty(operators, state.token)) {
+      fn = operators[state.token];
+      name = state.token;
+      getTokenSkipNewline(state);
+      params = [parseUnary(state)];
+      return new OperatorNode(name, fn, params);
+    }
+
+    return parsePow(state);
+  }
+  /**
+   * power
+   * Note: power operator is right associative
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parsePow(state) {
+    var node, name, fn, params;
+    node = parseLeftHandOperators(state);
+
+    if (state.token === '^' || state.token === '.^') {
+      name = state.token;
+      fn = name === '^' ? 'pow' : 'dotPow';
+      getTokenSkipNewline(state);
+      params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'
+
+      node = new OperatorNode(name, fn, params);
+    }
+
+    return node;
+  }
+  /**
+   * Left hand operators: factorial x!, ctranspose x'
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseLeftHandOperators(state) {
+    var node, name, fn, params;
+    node = parseCustomNodes(state);
+    var operators = {
+      '!': 'factorial',
+      '\'': 'ctranspose'
+    };
+
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getToken(state);
+      params = [node];
+      node = new OperatorNode(name, fn, params);
+      node = parseAccessors(state, node);
+    }
+
+    return node;
+  }
+  /**
+   * Parse a custom node handler. A node handler can be used to process
+   * nodes in a custom way, for example for handling a plot.
+   *
+   * A handler must be passed as second argument of the parse function.
+   * - must extend math.Node
+   * - must contain a function _compile(defs: Object) : string
+   * - must contain a function find(filter: Object) : Node[]
+   * - must contain a function toString() : string
+   * - the constructor is called with a single argument containing all parameters
+   *
+   * For example:
+   *
+   *     nodes = {
+   *       'plot': PlotHandler
+   *     }
+   *
+   * The constructor of the handler is called as:
+   *
+   *     node = new PlotHandler(params)
+   *
+   * The handler will be invoked when evaluating an expression like:
+   *
+   *     node = math.parse('plot(sin(x), x)', nodes)
+   *
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseCustomNodes(state) {
+    var params = [];
+
+    if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {
+      var CustomNode = state.extraNodes[state.token];
+      getToken(state); // parse parameters
+
+      if (state.token === '(') {
+        params = [];
+        openParams(state);
+        getToken(state);
+
+        if (state.token !== ')') {
+          params.push(parseAssignment(state)); // parse a list with parameters
+
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+
+        if (state.token !== ')') {
+          throw createSyntaxError(state, 'Parenthesis ) expected');
+        }
+
+        closeParams(state);
+        getToken(state);
+      } // create a new custom node
+      // noinspection JSValidateTypes
+
+
+      return new CustomNode(params);
+    }
+
+    return parseSymbol(state);
+  }
+  /**
+   * parse symbols: functions, variables, constants, units
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseSymbol(state) {
+    var node, name;
+
+    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+      name = state.token;
+      getToken(state);
+
+      if (hasOwnProperty(CONSTANTS, name)) {
+        // true, false, null, ...
+        node = new ConstantNode(CONSTANTS[name]);
+      } else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) {
+        // NaN, Infinity
+        node = new ConstantNode(numeric(name, 'number'));
+      } else {
+        node = new SymbolNode(name);
+      } // parse function parameters and matrix index
+
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseDoubleQuotesString(state);
+  }
+  /**
+   * parse accessors:
+   * - function invocation in round brackets (...), for example sqrt(2)
+   * - index enclosed in square brackets [...], for example A[2,3]
+   * - dot notation for properties, like foo.bar
+   * @param {Object} state
+   * @param {Node} node    Node on which to apply the parameters. If there
+   *                       are no parameters in the expression, the node
+   *                       itself is returned
+   * @param {string[]} [types]  Filter the types of notations
+   *                            can be ['(', '[', '.']
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseAccessors(state, node, types) {
+    var params;
+
+    while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.indexOf(state.token) !== -1)) {
+      // eslint-disable-line no-unmodified-loop-condition
+      params = [];
+
+      if (state.token === '(') {
+        if (isSymbolNode(node) || isAccessorNode(node)) {
+          // function invocation like fn(2, 3) or obj.fn(2, 3)
+          openParams(state);
+          getToken(state);
+
+          if (state.token !== ')') {
+            params.push(parseAssignment(state)); // parse a list with parameters
+
+            while (state.token === ',') {
+              // eslint-disable-line no-unmodified-loop-condition
+              getToken(state);
+              params.push(parseAssignment(state));
+            }
+          }
+
+          if (state.token !== ')') {
+            throw createSyntaxError(state, 'Parenthesis ) expected');
+          }
+
+          closeParams(state);
+          getToken(state);
+          node = new FunctionNode(node, params);
+        } else {
+          // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)
+          // don't parse it here but let it be handled by parseImplicitMultiplication
+          // with correct precedence
+          return node;
+        }
+      } else if (state.token === '[') {
+        // index notation like variable[2, 3]
+        openParams(state);
+        getToken(state);
+
+        if (state.token !== ']') {
+          params.push(parseAssignment(state)); // parse a list with parameters
+
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+
+        if (state.token !== ']') {
+          throw createSyntaxError(state, 'Parenthesis ] expected');
+        }
+
+        closeParams(state);
+        getToken(state);
+        node = new AccessorNode(node, new IndexNode(params));
+      } else {
+        // dot notation like variable.prop
+        getToken(state);
+
+        if (state.tokenType !== TOKENTYPE.SYMBOL) {
+          throw createSyntaxError(state, 'Property name expected after dot');
+        }
+
+        params.push(new ConstantNode(state.token));
+        getToken(state);
+        var dotNotation = true;
+        node = new AccessorNode(node, new IndexNode(params, dotNotation));
+      }
+    }
+
+    return node;
+  }
+  /**
+   * Parse a double quotes string.
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseDoubleQuotesString(state) {
+    var node, str;
+
+    if (state.token === '"') {
+      str = parseDoubleQuotesStringToken(state); // create constant
+
+      node = new ConstantNode(str); // parse index parameters
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseSingleQuotesString(state);
+  }
+  /**
+   * Parse a string surrounded by double quotes "..."
+   * @return {string}
+   */
+
+
+  function parseDoubleQuotesStringToken(state) {
+    var str = '';
+
+    while (currentCharacter(state) !== '' && currentCharacter(state) !== '"') {
+      if (currentCharacter(state) === '\\') {
+        // escape character, immediately process the next
+        // character to prevent stopping at a next '\"'
+        str += currentCharacter(state);
+        next(state);
+      }
+
+      str += currentCharacter(state);
+      next(state);
+    }
+
+    getToken(state);
+
+    if (state.token !== '"') {
+      throw createSyntaxError(state, 'End of string " expected');
+    }
+
+    getToken(state);
+    return JSON.parse('"' + str + '"'); // unescape escaped characters
+  }
+  /**
+   * Parse a single quotes string.
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseSingleQuotesString(state) {
+    var node, str;
+
+    if (state.token === '\'') {
+      str = parseSingleQuotesStringToken(state); // create constant
+
+      node = new ConstantNode(str); // parse index parameters
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseMatrix(state);
+  }
+  /**
+   * Parse a string surrounded by single quotes '...'
+   * @return {string}
+   */
+
+
+  function parseSingleQuotesStringToken(state) {
+    var str = '';
+
+    while (currentCharacter(state) !== '' && currentCharacter(state) !== '\'') {
+      if (currentCharacter(state) === '\\') {
+        // escape character, immediately process the next
+        // character to prevent stopping at a next '\''
+        str += currentCharacter(state);
+        next(state);
+      }
+
+      str += currentCharacter(state);
+      next(state);
+    }
+
+    getToken(state);
+
+    if (state.token !== '\'') {
+      throw createSyntaxError(state, 'End of string \' expected');
+    }
+
+    getToken(state);
+    return JSON.parse('"' + str + '"'); // unescape escaped characters
+  }
+  /**
+   * parse the matrix
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseMatrix(state) {
+    var array, params, rows, cols;
+
+    if (state.token === '[') {
+      // matrix [...]
+      openParams(state);
+      getToken(state);
+
+      if (state.token !== ']') {
+        // this is a non-empty matrix
+        var row = parseRow(state);
+
+        if (state.token === ';') {
+          // 2 dimensional array
+          rows = 1;
+          params = [row]; // the rows of the matrix are separated by dot-comma's
+
+          while (state.token === ';') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params[rows] = parseRow(state);
+            rows++;
+          }
+
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+
+          closeParams(state);
+          getToken(state); // check if the number of columns matches in all rows
+
+          cols = params[0].items.length;
+
+          for (var r = 1; r < rows; r++) {
+            if (params[r].items.length !== cols) {
+              throw createError(state, 'Column dimensions mismatch ' + '(' + params[r].items.length + ' !== ' + cols + ')');
+            }
+          }
+
+          array = new ArrayNode(params);
+        } else {
+          // 1 dimensional vector
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+
+          closeParams(state);
+          getToken(state);
+          array = row;
+        }
+      } else {
+        // this is an empty matrix "[ ]"
+        closeParams(state);
+        getToken(state);
+        array = new ArrayNode([]);
+      }
+
+      return parseAccessors(state, array);
+    }
+
+    return parseObject(state);
+  }
+  /**
+   * Parse a single comma-separated row from a matrix, like 'a, b, c'
+   * @return {ArrayNode} node
+   */
+
+
+  function parseRow(state) {
+    var params = [parseAssignment(state)];
+    var len = 1;
+
+    while (state.token === ',') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getToken(state); // parse expression
+
+      params[len] = parseAssignment(state);
+      len++;
+    }
+
+    return new ArrayNode(params);
+  }
+  /**
+   * parse an object, enclosed in angle brackets{...}, for example {value: 2}
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseObject(state) {
+    if (state.token === '{') {
+      openParams(state);
+      var key;
+      var properties = {};
+
+      do {
+        getToken(state);
+
+        if (state.token !== '}') {
+          // parse key
+          if (state.token === '"') {
+            key = parseDoubleQuotesStringToken(state);
+          } else if (state.token === '\'') {
+            key = parseSingleQuotesStringToken(state);
+          } else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+            key = state.token;
+            getToken(state);
+          } else {
+            throw createSyntaxError(state, 'Symbol or string expected as object key');
+          } // parse key/value separator
+
+
+          if (state.token !== ':') {
+            throw createSyntaxError(state, 'Colon : expected after object key');
+          }
+
+          getToken(state); // parse key
+
+          properties[key] = parseAssignment(state);
+        }
+      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition
+
+
+      if (state.token !== '}') {
+        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');
+      }
+
+      closeParams(state);
+      getToken(state);
+      var node = new ObjectNode(properties); // parse index parameters
+
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseNumber(state);
+  }
+  /**
+   * parse a number
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseNumber(state) {
+    var numberStr;
+
+    if (state.tokenType === TOKENTYPE.NUMBER) {
+      // this is a number
+      numberStr = state.token;
+      getToken(state);
+      return new ConstantNode(numeric(numberStr, config.number));
+    }
+
+    return parseParentheses(state);
+  }
+  /**
+   * parentheses
+   * @return {Node} node
+   * @private
+   */
+
+
+  function parseParentheses(state) {
+    var node; // check if it is a parenthesized expression
+
+    if (state.token === '(') {
+      // parentheses (...)
+      openParams(state);
+      getToken(state);
+      node = parseAssignment(state); // start again
+
+      if (state.token !== ')') {
+        throw createSyntaxError(state, 'Parenthesis ) expected');
+      }
+
+      closeParams(state);
+      getToken(state);
+      node = new ParenthesisNode(node);
+      node = parseAccessors(state, node);
+      return node;
+    }
+
+    return parseEnd(state);
+  }
+  /**
+   * Evaluated when the expression is not yet ended but expected to end
+   * @return {Node} res
+   * @private
+   */
+
+
+  function parseEnd(state) {
+    if (state.token === '') {
+      // syntax error or unexpected end of expression
+      throw createSyntaxError(state, 'Unexpected end of expression');
+    } else {
+      throw createSyntaxError(state, 'Value expected');
+    }
+  }
+  /**
+   * Shortcut for getting the current row value (one based)
+   * Returns the line of the currently handled expression
+   * @private
+   */
+
+  /* TODO: implement keeping track on the row number
+  function row () {
+    return null
+  }
+  */
+
+  /**
+   * Shortcut for getting the current col value (one based)
+   * Returns the column (position) where the last state.token starts
+   * @private
+   */
+
+
+  function col(state) {
+    return state.index - state.token.length + 1;
+  }
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {SyntaxError} instantiated error
+   * @private
+   */
+
+
+  function createSyntaxError(state, message) {
+    var c = col(state);
+    var error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {Error} instantiated error
+   * @private
+   */
+
+
+  function createError(state, message) {
+    var c = col(state);
+    var error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+
+  return parse;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/apply.transform.js b/node_modules/mathjs/lib/esm/expression/transform/apply.transform.js
new file mode 100644
index 0000000..9537268
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/apply.transform.js
@@ -0,0 +1,45 @@
+import { errorTransform } from './utils/errorTransform.js';
+import { factory } from '../../utils/factory.js';
+import { createApply } from '../../function/matrix/apply.js';
+import { isBigNumber, isNumber } from '../../utils/is.js';
+var name = 'apply';
+var dependencies = ['typed', 'isInteger'];
+/**
+ * Attach a transform function to math.apply
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function apply
+ * from one-based to zero based
+ */
+
+export var createApplyTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isInteger
+  } = _ref;
+  var apply = createApply({
+    typed,
+    isInteger
+  }); // @see: comment of concat itself
+
+  return typed('apply', {
+    '...any': function any(args) {
+      // change dim from one-based to zero-based
+      var dim = args[1];
+
+      if (isNumber(dim)) {
+        args[1] = dim - 1;
+      } else if (isBigNumber(dim)) {
+        args[1] = dim.minus(1);
+      }
+
+      try {
+        return apply.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/column.transform.js b/node_modules/mathjs/lib/esm/expression/transform/column.transform.js
new file mode 100644
index 0000000..b75da6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/column.transform.js
@@ -0,0 +1,48 @@
+import { errorTransform } from './utils/errorTransform.js';
+import { factory } from '../../utils/factory.js';
+import { createColumn } from '../../function/matrix/column.js';
+import { isNumber } from '../../utils/is.js';
+var name = 'column';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+
+export var createColumnTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  var column = createColumn({
+    typed,
+    Index,
+    matrix,
+    range
+  }); // @see: comment of column itself
+
+  return typed('column', {
+    '...any': function any(args) {
+      // change last argument from zero-based to one-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if (isNumber(last)) {
+        args[lastIndex] = last - 1;
+      }
+
+      try {
+        return column.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/concat.transform.js b/node_modules/mathjs/lib/esm/expression/transform/concat.transform.js
new file mode 100644
index 0000000..ee59d5e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/concat.transform.js
@@ -0,0 +1,47 @@
+import { isBigNumber, isNumber } from '../../utils/is.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { factory } from '../../utils/factory.js';
+import { createConcat } from '../../function/matrix/concat.js';
+var name = 'concat';
+var dependencies = ['typed', 'matrix', 'isInteger'];
+export var createConcatTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    isInteger
+  } = _ref;
+  var concat = createConcat({
+    typed,
+    matrix,
+    isInteger
+  });
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function concat
+   * from one-based to zero based
+   */
+
+  return typed('concat', {
+    '...any': function any(args) {
+      // change last argument from one-based to zero-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if (isNumber(last)) {
+        args[lastIndex] = last - 1;
+      } else if (isBigNumber(last)) {
+        args[lastIndex] = last.minus(1);
+      }
+
+      try {
+        return concat.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/cumsum.transform.js b/node_modules/mathjs/lib/esm/expression/transform/cumsum.transform.js
new file mode 100644
index 0000000..a31b8df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/cumsum.transform.js
@@ -0,0 +1,48 @@
+import { isBigNumber, isCollection, isNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createCumSum } from '../../function/statistics/cumsum.js';
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+
+var name = 'cumsum';
+var dependencies = ['typed', 'add', 'unaryPlus'];
+export var createCumSumTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    unaryPlus
+  } = _ref;
+  var cumsum = createCumSum({
+    typed,
+    add,
+    unaryPlus
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      // change last argument dim from one-based to zero-based
+      if (args.length === 2 && isCollection(args[0])) {
+        var dim = args[1];
+
+        if (isNumber(dim)) {
+          args[1] = dim - 1;
+        } else if (isBigNumber(dim)) {
+          args[1] = dim.minus(1);
+        }
+      }
+
+      try {
+        return cumsum.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/diff.transform.js b/node_modules/mathjs/lib/esm/expression/transform/diff.transform.js
new file mode 100644
index 0000000..007ab73
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/diff.transform.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createDiff } from '../../function/matrix/diff.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'diff';
+var dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];
+export var createDiffTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtract,
+    number,
+    bignumber
+  } = _ref;
+  var diff = createDiff({
+    typed,
+    matrix,
+    subtract,
+    number,
+    bignumber
+  });
+  /**
+   * Attach a transform function to math.diff
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+
+  return typed(name, {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+
+      try {
+        return diff.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/filter.transform.js b/node_modules/mathjs/lib/esm/expression/transform/filter.transform.js
new file mode 100644
index 0000000..4d155ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/filter.transform.js
@@ -0,0 +1,81 @@
+import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';
+import { filter, filterRegExp } from '../../utils/array.js';
+import { maxArgumentCount } from '../../utils/function.js';
+import { compileInlineExpression } from './utils/compileInlineExpression.js';
+import { factory } from '../../utils/factory.js';
+var name = 'filter';
+var dependencies = ['typed'];
+export var createFilterTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Attach a transform function to math.filter
+   * Adds a property transform containing the transform function.
+   *
+   * This transform adds support for equations as test function for math.filter,
+   * so you can do something like 'filter([3, -2, 5], x > 0)'.
+   */
+  function filterTransform(args, math, scope) {
+    var x, callback;
+
+    if (args[0]) {
+      x = args[0].compile().evaluate(scope);
+    }
+
+    if (args[1]) {
+      if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = args[1].compile().evaluate(scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = compileInlineExpression(args[1], math, scope);
+      }
+    }
+
+    return filter(x, callback);
+  }
+
+  filterTransform.rawArgs = true; // one based version of function filter
+
+  var filter = typed('filter', {
+    'Array, function': _filter,
+    'Matrix, function': function MatrixFunction(x, test) {
+      return x.create(_filter(x.toArray(), test));
+    },
+    'Array, RegExp': filterRegExp,
+    'Matrix, RegExp': function MatrixRegExp(x, test) {
+      return x.create(filterRegExp(x.toArray(), test));
+    }
+  });
+  return filterTransform;
+}, {
+  isTransformFunction: true
+});
+/**
+ * Filter values in a callback given a callback function
+ *
+ * !!! Passes a one-based index !!!
+ *
+ * @param {Array} x
+ * @param {Function} callback
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+
+function _filter(x, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = maxArgumentCount(callback);
+  return filter(x, function (value, index, array) {
+    // invoke the callback function with the right number of arguments
+    if (args === 1) {
+      return callback(value);
+    } else if (args === 2) {
+      return callback(value, [index + 1]);
+    } else {
+      // 3 or -1
+      return callback(value, [index + 1], array);
+    }
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js b/node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js
new file mode 100644
index 0000000..21f6440
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js
@@ -0,0 +1,72 @@
+import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';
+import { maxArgumentCount } from '../../utils/function.js';
+import { forEach } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { compileInlineExpression } from './utils/compileInlineExpression.js';
+var name = 'forEach';
+var dependencies = ['typed'];
+export var createForEachTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Attach a transform function to math.forEach
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  function forEachTransform(args, math, scope) {
+    var x, callback;
+
+    if (args[0]) {
+      x = args[0].compile().evaluate(scope);
+    }
+
+    if (args[1]) {
+      if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {
+        // a function pointer, like forEach([3, -2, 5], myTestFunction)
+        callback = args[1].compile().evaluate(scope);
+      } else {
+        // an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )
+        callback = compileInlineExpression(args[1], math, scope);
+      }
+    }
+
+    return _forEach(x, callback);
+  }
+
+  forEachTransform.rawArgs = true; // one-based version of forEach
+
+  var _forEach = typed('forEach', {
+    'Array | Matrix, function': function ArrayMatrixFunction(array, callback) {
+      // figure out what number of arguments the callback function expects
+      var args = maxArgumentCount(callback);
+
+      var recurse = function recurse(value, index) {
+        if (Array.isArray(value)) {
+          forEach(value, function (child, i) {
+            // we create a copy of the index array and append the new index value
+            recurse(child, index.concat(i + 1)); // one based index, hence i+1
+          });
+        } else {
+          // invoke the callback function with the right number of arguments
+          if (args === 1) {
+            callback(value);
+          } else if (args === 2) {
+            callback(value, index);
+          } else {
+            // 3 or -1
+            callback(value, index, array);
+          }
+        }
+      };
+
+      recurse(array.valueOf(), []); // pass Array
+    }
+  });
+
+  return forEachTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/index.transform.js b/node_modules/mathjs/lib/esm/expression/transform/index.transform.js
new file mode 100644
index 0000000..80c32c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/index.transform.js
@@ -0,0 +1,51 @@
+import { isArray, isBigNumber, isMatrix, isNumber, isRange } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'index';
+var dependencies = ['Index'];
+export var createIndexTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Index
+  } = _ref;
+
+  /**
+   * Attach a transform function to math.index
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  return function indexTransform() {
+    var args = [];
+
+    for (var i = 0, ii = arguments.length; i < ii; i++) {
+      var arg = arguments[i]; // change from one-based to zero based, and convert BigNumber to number
+
+      if (isRange(arg)) {
+        arg.start--;
+        arg.end -= arg.step > 0 ? 0 : 2;
+      } else if (arg && arg.isSet === true) {
+        arg = arg.map(function (v) {
+          return v - 1;
+        });
+      } else if (isArray(arg) || isMatrix(arg)) {
+        arg = arg.map(function (v) {
+          return v - 1;
+        });
+      } else if (isNumber(arg)) {
+        arg--;
+      } else if (isBigNumber(arg)) {
+        arg = arg.toNumber() - 1;
+      } else if (typeof arg === 'string') {// leave as is
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');
+      }
+
+      args[i] = arg;
+    }
+
+    var res = new Index();
+    Index.apply(res, args);
+    return res;
+  };
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/map.transform.js b/node_modules/mathjs/lib/esm/expression/transform/map.transform.js
new file mode 100644
index 0000000..2e677a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/map.transform.js
@@ -0,0 +1,86 @@
+import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';
+import { maxArgumentCount } from '../../utils/function.js';
+import { map } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { compileInlineExpression } from './utils/compileInlineExpression.js';
+var name = 'map';
+var dependencies = ['typed'];
+export var createMapTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Attach a transform function to math.map
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  function mapTransform(args, math, scope) {
+    var x, callback;
+
+    if (args[0]) {
+      x = args[0].compile().evaluate(scope);
+    }
+
+    if (args[1]) {
+      if (isSymbolNode(args[1]) || isFunctionAssignmentNode(args[1])) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = args[1].compile().evaluate(scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = compileInlineExpression(args[1], math, scope);
+      }
+    }
+
+    return map(x, callback);
+  }
+
+  mapTransform.rawArgs = true; // one-based version of map function
+
+  var map = typed('map', {
+    'Array, function': function ArrayFunction(x, callback) {
+      return _map(x, callback, x);
+    },
+    'Matrix, function': function MatrixFunction(x, callback) {
+      return x.create(_map(x.valueOf(), callback, x));
+    }
+  });
+  return mapTransform;
+}, {
+  isTransformFunction: true
+});
+/**
+ * Map for a multi dimensional array. One-based indexes
+ * @param {Array} array
+ * @param {function} callback
+ * @param {Array} orig
+ * @return {Array}
+ * @private
+ */
+
+function _map(array, callback, orig) {
+  // figure out what number of arguments the callback function expects
+  var argsCount = maxArgumentCount(callback);
+
+  function recurse(value, index) {
+    if (Array.isArray(value)) {
+      return map(value, function (child, i) {
+        // we create a copy of the index array and append the new index value
+        return recurse(child, index.concat(i + 1)); // one based index, hence i + 1
+      });
+    } else {
+      // invoke the (typed) callback function with the right number of arguments
+      if (argsCount === 1) {
+        return callback(value);
+      } else if (argsCount === 2) {
+        return callback(value, index);
+      } else {
+        // 3 or -1
+        return callback(value, index, orig);
+      }
+    }
+  }
+
+  return recurse(array, []);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/max.transform.js b/node_modules/mathjs/lib/esm/expression/transform/max.transform.js
new file mode 100644
index 0000000..18fe6f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/max.transform.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createMax } from '../../function/statistics/max.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'max';
+var dependencies = ['typed', 'config', 'numeric', 'larger'];
+export var createMaxTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    larger
+  } = _ref;
+  var max = createMax({
+    typed,
+    config,
+    numeric,
+    larger
+  });
+  /**
+   * Attach a transform function to math.max
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function max
+   * from one-based to zero based
+   */
+
+  return typed('max', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+
+      try {
+        return max.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/mean.transform.js b/node_modules/mathjs/lib/esm/expression/transform/mean.transform.js
new file mode 100644
index 0000000..d222a57
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/mean.transform.js
@@ -0,0 +1,39 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createMean } from '../../function/statistics/mean.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'mean';
+var dependencies = ['typed', 'add', 'divide'];
+export var createMeanTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide
+  } = _ref;
+  var mean = createMean({
+    typed,
+    add,
+    divide
+  });
+  /**
+   * Attach a transform function to math.mean
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function mean
+   * from one-based to zero based
+   */
+
+  return typed('mean', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+
+      try {
+        return mean.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/min.transform.js b/node_modules/mathjs/lib/esm/expression/transform/min.transform.js
new file mode 100644
index 0000000..f8de2e4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/min.transform.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createMin } from '../../function/statistics/min.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'min';
+var dependencies = ['typed', 'config', 'numeric', 'smaller'];
+export var createMinTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    smaller
+  } = _ref;
+  var min = createMin({
+    typed,
+    config,
+    numeric,
+    smaller
+  });
+  /**
+   * Attach a transform function to math.min
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function min
+   * from one-based to zero based
+   */
+
+  return typed('min', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+
+      try {
+        return min.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/range.transform.js b/node_modules/mathjs/lib/esm/expression/transform/range.transform.js
new file mode 100644
index 0000000..fb4716b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/range.transform.js
@@ -0,0 +1,48 @@
+import { factory } from '../../utils/factory.js';
+import { createRange } from '../../function/matrix/range.js';
+var name = 'range';
+var dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];
+export var createRangeTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    bignumber,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq
+  } = _ref;
+  var range = createRange({
+    typed,
+    config,
+    matrix,
+    bignumber,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq
+  });
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+
+  return typed('range', {
+    '...any': function any(args) {
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if (typeof last !== 'boolean') {
+        // append a parameter includeEnd=true
+        args.push(true);
+      }
+
+      return range.apply(null, args);
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/row.transform.js b/node_modules/mathjs/lib/esm/expression/transform/row.transform.js
new file mode 100644
index 0000000..d2963a4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/row.transform.js
@@ -0,0 +1,48 @@
+import { factory } from '../../utils/factory.js';
+import { createRow } from '../../function/matrix/row.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { isNumber } from '../../utils/is.js';
+var name = 'row';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+
+export var createRowTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  var row = createRow({
+    typed,
+    Index,
+    matrix,
+    range
+  }); // @see: comment of row itself
+
+  return typed('row', {
+    '...any': function any(args) {
+      // change last argument from zero-based to one-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+
+      if (isNumber(last)) {
+        args[lastIndex] = last - 1;
+      }
+
+      try {
+        return row.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/std.transform.js b/node_modules/mathjs/lib/esm/expression/transform/std.transform.js
new file mode 100644
index 0000000..04cd531
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/std.transform.js
@@ -0,0 +1,39 @@
+import { factory } from '../../utils/factory.js';
+import { createStd } from '../../function/statistics/std.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'std';
+var dependencies = ['typed', 'sqrt', 'variance'];
+/**
+ * Attach a transform function to math.std
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function std
+ * from one-based to zero based
+ */
+
+export var createStdTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    sqrt,
+    variance
+  } = _ref;
+  var std = createStd({
+    typed,
+    sqrt,
+    variance
+  });
+  return typed('std', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+
+      try {
+        return std.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/subset.transform.js b/node_modules/mathjs/lib/esm/expression/transform/subset.transform.js
new file mode 100644
index 0000000..257044e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/subset.transform.js
@@ -0,0 +1,33 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createSubset } from '../../function/matrix/subset.js';
+var name = 'subset';
+var dependencies = ['typed', 'matrix'];
+export var createSubsetTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+  var subset = createSubset({
+    typed,
+    matrix
+  });
+  /**
+   * Attach a transform function to math.subset
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+
+  return typed('subset', {
+    '...any': function any(args) {
+      try {
+        return subset.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/sum.transform.js b/node_modules/mathjs/lib/esm/expression/transform/sum.transform.js
new file mode 100644
index 0000000..26027e0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/sum.transform.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createSum } from '../../function/statistics/sum.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+
+var name = 'sum';
+var dependencies = ['typed', 'config', 'add', 'numeric'];
+export var createSumTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    add,
+    numeric
+  } = _ref;
+  var sum = createSum({
+    typed,
+    config,
+    add,
+    numeric
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+
+      try {
+        return sum.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js b/node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js
new file mode 100644
index 0000000..fcdc061
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js
@@ -0,0 +1,31 @@
+import { isSymbolNode } from '../../../utils/is.js';
+import { createSubScope } from '../../../utils/scope.js';
+/**
+ * Compile an inline expression like "x > 0"
+ * @param {Node} expression
+ * @param {Object} math
+ * @param {Object} scope
+ * @return {function} Returns a function with one argument which fills in the
+ *                    undefined variable (like "x") and evaluates the expression
+ */
+
+export function compileInlineExpression(expression, math, scope) {
+  // find an undefined symbol
+  var symbol = expression.filter(function (node) {
+    return isSymbolNode(node) && !(node.name in math) && !scope.has(node.name);
+  })[0];
+
+  if (!symbol) {
+    throw new Error('No undefined variable found in inline expression "' + expression + '"');
+  } // create a test function for this equation
+
+
+  var name = symbol.name; // variable name
+
+  var subScope = createSubScope(scope);
+  var eq = expression.compile();
+  return function inlineExpression(x) {
+    subScope.set(name, x);
+    return eq.evaluate(subScope);
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js b/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js
new file mode 100644
index 0000000..d0b4866
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js
@@ -0,0 +1,14 @@
+import { IndexError } from '../../../error/IndexError.js';
+/**
+ * Transform zero-based indices to one-based indices in errors
+ * @param {Error} err
+ * @returns {Error | IndexError} Returns the transformed error
+ */
+
+export function errorTransform(err) {
+  if (err && err.isIndexError) {
+    return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);
+  }
+
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js b/node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js
new file mode 100644
index 0000000..aac9292
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js
@@ -0,0 +1,19 @@
+import { isBigNumber, isCollection, isNumber } from '../../../utils/is.js';
+/**
+ * Change last argument dim from one-based to zero-based.
+ */
+
+export function lastDimToZeroBase(args) {
+  if (args.length === 2 && isCollection(args[0])) {
+    args = args.slice();
+    var dim = args[1];
+
+    if (isNumber(dim)) {
+      args[1] = dim - 1;
+    } else if (isBigNumber(dim)) {
+      args[1] = dim.minus(1);
+    }
+  }
+
+  return args;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/variance.transform.js b/node_modules/mathjs/lib/esm/expression/transform/variance.transform.js
new file mode 100644
index 0000000..5b43961
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/variance.transform.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createVariance } from '../../function/statistics/variance.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'variance';
+var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];
+/**
+ * Attach a transform function to math.var
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function var
+ * from one-based to zero based
+ */
+
+export var createVarianceTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    apply,
+    isNaN
+  } = _ref;
+  var variance = createVariance({
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    apply,
+    isNaN
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+
+      try {
+        return variance.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/factoriesAny.js b/node_modules/mathjs/lib/esm/factoriesAny.js
new file mode 100644
index 0000000..9b0ef4b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/factoriesAny.js
@@ -0,0 +1,274 @@
+export { createTyped } from './core/function/typed.js';
+export { createResultSet } from './type/resultset/ResultSet.js';
+export { createBigNumberClass } from './type/bignumber/BigNumber.js';
+export { createComplexClass } from './type/complex/Complex.js';
+export { createFractionClass } from './type/fraction/Fraction.js';
+export { createRangeClass } from './type/matrix/Range.js';
+export { createMatrixClass } from './type/matrix/Matrix.js';
+export { createDenseMatrixClass } from './type/matrix/DenseMatrix.js';
+export { createClone } from './function/utils/clone.js';
+export { createIsInteger } from './function/utils/isInteger.js';
+export { createIsNegative } from './function/utils/isNegative.js';
+export { createIsNumeric } from './function/utils/isNumeric.js';
+export { createHasNumericValue } from './function/utils/hasNumericValue.js';
+export { createIsPositive } from './function/utils/isPositive.js';
+export { createIsZero } from './function/utils/isZero.js';
+export { createIsNaN } from './function/utils/isNaN.js';
+export { createTypeOf } from './function/utils/typeOf.js';
+export { createEqualScalar } from './function/relational/equalScalar.js';
+export { createSparseMatrixClass } from './type/matrix/SparseMatrix.js';
+export { createNumber } from './type/number.js';
+export { createString } from './type/string.js';
+export { createBoolean } from './type/boolean.js';
+export { createBignumber } from './type/bignumber/function/bignumber.js';
+export { createComplex } from './type/complex/function/complex.js';
+export { createFraction } from './type/fraction/function/fraction.js';
+export { createMatrix } from './type/matrix/function/matrix.js';
+export { createMatrixFromFunction } from './function/matrix/matrixFromFunction.js';
+export { createMatrixFromRows } from './function/matrix/matrixFromRows.js';
+export { createMatrixFromColumns } from './function/matrix/matrixFromColumns.js';
+export { createSplitUnit } from './type/unit/function/splitUnit.js';
+export { createUnaryMinus } from './function/arithmetic/unaryMinus.js';
+export { createUnaryPlus } from './function/arithmetic/unaryPlus.js';
+export { createAbs } from './function/arithmetic/abs.js';
+export { createApply } from './function/matrix/apply.js';
+export { createAddScalar } from './function/arithmetic/addScalar.js';
+export { createCbrt } from './function/arithmetic/cbrt.js';
+export { createCeil } from './function/arithmetic/ceil.js';
+export { createCube } from './function/arithmetic/cube.js';
+export { createExp } from './function/arithmetic/exp.js';
+export { createExpm1 } from './function/arithmetic/expm1.js';
+export { createFix } from './function/arithmetic/fix.js';
+export { createFloor } from './function/arithmetic/floor.js';
+export { createGcd } from './function/arithmetic/gcd.js';
+export { createLcm } from './function/arithmetic/lcm.js';
+export { createLog10 } from './function/arithmetic/log10.js';
+export { createLog2 } from './function/arithmetic/log2.js';
+export { createMod } from './function/arithmetic/mod.js';
+export { createMultiplyScalar } from './function/arithmetic/multiplyScalar.js';
+export { createMultiply } from './function/arithmetic/multiply.js';
+export { createNthRoot } from './function/arithmetic/nthRoot.js';
+export { createSign } from './function/arithmetic/sign.js';
+export { createSqrt } from './function/arithmetic/sqrt.js';
+export { createSquare } from './function/arithmetic/square.js';
+export { createSubtract } from './function/arithmetic/subtract.js';
+export { createXgcd } from './function/arithmetic/xgcd.js';
+export { createInvmod } from './function/arithmetic/invmod.js';
+export { createDotMultiply } from './function/arithmetic/dotMultiply.js';
+export { createBitAnd } from './function/bitwise/bitAnd.js';
+export { createBitNot } from './function/bitwise/bitNot.js';
+export { createBitOr } from './function/bitwise/bitOr.js';
+export { createBitXor } from './function/bitwise/bitXor.js';
+export { createArg } from './function/complex/arg.js';
+export { createConj } from './function/complex/conj.js';
+export { createIm } from './function/complex/im.js';
+export { createRe } from './function/complex/re.js';
+export { createNot } from './function/logical/not.js';
+export { createOr } from './function/logical/or.js';
+export { createXor } from './function/logical/xor.js';
+export { createConcat } from './function/matrix/concat.js';
+export { createColumn } from './function/matrix/column.js';
+export { createCount } from './function/matrix/count.js';
+export { createCross } from './function/matrix/cross.js';
+export { createDiag } from './function/matrix/diag.js';
+export { createFilter } from './function/matrix/filter.js';
+export { createFlatten } from './function/matrix/flatten.js';
+export { createForEach } from './function/matrix/forEach.js';
+export { createGetMatrixDataType } from './function/matrix/getMatrixDataType.js';
+export { createIdentity } from './function/matrix/identity.js';
+export { createKron } from './function/matrix/kron.js';
+export { createMap } from './function/matrix/map.js';
+export { createDiff } from './function/matrix/diff.js';
+export { createOnes } from './function/matrix/ones.js';
+export { createRange } from './function/matrix/range.js';
+export { createReshape } from './function/matrix/reshape.js';
+export { createResize } from './function/matrix/resize.js';
+export { createRotate } from './function/matrix/rotate.js';
+export { createRotationMatrix } from './function/matrix/rotationMatrix.js';
+export { createRow } from './function/matrix/row.js';
+export { createSize } from './function/matrix/size.js';
+export { createSqueeze } from './function/matrix/squeeze.js';
+export { createSubset } from './function/matrix/subset.js';
+export { createTranspose } from './function/matrix/transpose.js';
+export { createCtranspose } from './function/matrix/ctranspose.js';
+export { createZeros } from './function/matrix/zeros.js';
+export { createErf } from './function/special/erf.js';
+export { createMode } from './function/statistics/mode.js';
+export { createProd } from './function/statistics/prod.js';
+export { createFormat } from './function/string/format.js';
+export { createBin } from './function/string/bin.js';
+export { createOct } from './function/string/oct.js';
+export { createHex } from './function/string/hex.js';
+export { createPrint } from './function/string/print.js';
+export { createTo } from './function/unit/to.js';
+export { createIsPrime } from './function/utils/isPrime.js';
+export { createNumeric } from './function/utils/numeric.js';
+export { createDivideScalar } from './function/arithmetic/divideScalar.js';
+export { createPow } from './function/arithmetic/pow.js';
+export { createRound } from './function/arithmetic/round.js';
+export { createLog } from './function/arithmetic/log.js';
+export { createLog1p } from './function/arithmetic/log1p.js';
+export { createNthRoots } from './function/arithmetic/nthRoots.js';
+export { createDotPow } from './function/arithmetic/dotPow.js';
+export { createDotDivide } from './function/arithmetic/dotDivide.js';
+export { createLsolve } from './function/algebra/solver/lsolve.js';
+export { createUsolve } from './function/algebra/solver/usolve.js';
+export { createLsolveAll } from './function/algebra/solver/lsolveAll.js';
+export { createUsolveAll } from './function/algebra/solver/usolveAll.js';
+export { createLeftShift } from './function/bitwise/leftShift.js';
+export { createRightArithShift } from './function/bitwise/rightArithShift.js';
+export { createRightLogShift } from './function/bitwise/rightLogShift.js';
+export { createAnd } from './function/logical/and.js';
+export { createCompare } from './function/relational/compare.js';
+export { createCompareNatural } from './function/relational/compareNatural.js';
+export { createCompareText } from './function/relational/compareText.js';
+export { createEqual } from './function/relational/equal.js';
+export { createEqualText } from './function/relational/equalText.js';
+export { createSmaller } from './function/relational/smaller.js';
+export { createSmallerEq } from './function/relational/smallerEq.js';
+export { createLarger } from './function/relational/larger.js';
+export { createLargerEq } from './function/relational/largerEq.js';
+export { createDeepEqual } from './function/relational/deepEqual.js';
+export { createUnequal } from './function/relational/unequal.js';
+export { createPartitionSelect } from './function/matrix/partitionSelect.js';
+export { createSort } from './function/matrix/sort.js';
+export { createMax } from './function/statistics/max.js';
+export { createMin } from './function/statistics/min.js';
+export { createImmutableDenseMatrixClass } from './type/matrix/ImmutableDenseMatrix.js';
+export { createIndexClass } from './type/matrix/MatrixIndex.js';
+export { createFibonacciHeapClass } from './type/matrix/FibonacciHeap.js';
+export { createSpaClass } from './type/matrix/Spa.js';
+export { createUnitClass } from './type/unit/Unit.js';
+export { createUnitFunction } from './type/unit/function/unit.js';
+export { createSparse } from './type/matrix/function/sparse.js';
+export { createCreateUnit } from './type/unit/function/createUnit.js';
+export { createAcos } from './function/trigonometry/acos.js';
+export { createAcosh } from './function/trigonometry/acosh.js';
+export { createAcot } from './function/trigonometry/acot.js';
+export { createAcoth } from './function/trigonometry/acoth.js';
+export { createAcsc } from './function/trigonometry/acsc.js';
+export { createAcsch } from './function/trigonometry/acsch.js';
+export { createAsec } from './function/trigonometry/asec.js';
+export { createAsech } from './function/trigonometry/asech.js';
+export { createAsin } from './function/trigonometry/asin.js';
+export { createAsinh } from './function/trigonometry/asinh.js';
+export { createAtan } from './function/trigonometry/atan.js';
+export { createAtan2 } from './function/trigonometry/atan2.js';
+export { createAtanh } from './function/trigonometry/atanh.js';
+export { createCos } from './function/trigonometry/cos.js';
+export { createCosh } from './function/trigonometry/cosh.js';
+export { createCot } from './function/trigonometry/cot.js';
+export { createCoth } from './function/trigonometry/coth.js';
+export { createCsc } from './function/trigonometry/csc.js';
+export { createCsch } from './function/trigonometry/csch.js';
+export { createSec } from './function/trigonometry/sec.js';
+export { createSech } from './function/trigonometry/sech.js';
+export { createSin } from './function/trigonometry/sin.js';
+export { createSinh } from './function/trigonometry/sinh.js';
+export { createTan } from './function/trigonometry/tan.js';
+export { createTanh } from './function/trigonometry/tanh.js';
+export { createSetCartesian } from './function/set/setCartesian.js';
+export { createSetDifference } from './function/set/setDifference.js';
+export { createSetDistinct } from './function/set/setDistinct.js';
+export { createSetIntersect } from './function/set/setIntersect.js';
+export { createSetIsSubset } from './function/set/setIsSubset.js';
+export { createSetMultiplicity } from './function/set/setMultiplicity.js';
+export { createSetPowerset } from './function/set/setPowerset.js';
+export { createSetSize } from './function/set/setSize.js';
+export { createSetSymDifference } from './function/set/setSymDifference.js';
+export { createSetUnion } from './function/set/setUnion.js';
+export { createAdd } from './function/arithmetic/add.js';
+export { createHypot } from './function/arithmetic/hypot.js';
+export { createNorm } from './function/arithmetic/norm.js';
+export { createDot } from './function/matrix/dot.js';
+export { createTrace } from './function/matrix/trace.js';
+export { createIndex } from './type/matrix/function/index.js';
+export { createNode } from './expression/node/Node.js';
+export { createAccessorNode } from './expression/node/AccessorNode.js';
+export { createArrayNode } from './expression/node/ArrayNode.js';
+export { createAssignmentNode } from './expression/node/AssignmentNode.js';
+export { createBlockNode } from './expression/node/BlockNode.js';
+export { createConditionalNode } from './expression/node/ConditionalNode.js';
+export { createConstantNode } from './expression/node/ConstantNode.js';
+export { createFunctionAssignmentNode } from './expression/node/FunctionAssignmentNode.js';
+export { createIndexNode } from './expression/node/IndexNode.js';
+export { createObjectNode } from './expression/node/ObjectNode.js';
+export { createOperatorNode } from './expression/node/OperatorNode.js';
+export { createParenthesisNode } from './expression/node/ParenthesisNode.js';
+export { createRangeNode } from './expression/node/RangeNode.js';
+export { createRelationalNode } from './expression/node/RelationalNode.js';
+export { createSymbolNode } from './expression/node/SymbolNode.js';
+export { createFunctionNode } from './expression/node/FunctionNode.js';
+export { createParse } from './expression/parse.js';
+export { createCompile } from './expression/function/compile.js';
+export { createEvaluate } from './expression/function/evaluate.js';
+export { createParserClass } from './expression/Parser.js';
+export { createParser } from './expression/function/parser.js';
+export { createLup } from './function/algebra/decomposition/lup.js';
+export { createQr } from './function/algebra/decomposition/qr.js';
+export { createSlu } from './function/algebra/decomposition/slu.js';
+export { createLusolve } from './function/algebra/solver/lusolve.js';
+export { createHelpClass } from './expression/Help.js';
+export { createChainClass } from './type/chain/Chain.js';
+export { createHelp } from './expression/function/help.js';
+export { createChain } from './type/chain/function/chain.js';
+export { createDet } from './function/matrix/det.js';
+export { createInv } from './function/matrix/inv.js';
+export { createEigs } from './function/matrix/eigs.js';
+export { createExpm } from './function/matrix/expm.js';
+export { createSqrtm } from './function/matrix/sqrtm.js';
+export { createDivide } from './function/arithmetic/divide.js';
+export { createDistance } from './function/geometry/distance.js';
+export { createIntersect } from './function/geometry/intersect.js';
+export { createSum } from './function/statistics/sum.js';
+export { createCumSum } from './function/statistics/cumsum.js';
+export { createMean } from './function/statistics/mean.js';
+export { createMedian } from './function/statistics/median.js';
+export { createMad } from './function/statistics/mad.js';
+export { createVariance } from './function/statistics/variance.js';
+export { createQuantileSeq } from './function/statistics/quantileSeq.js';
+export { createStd } from './function/statistics/std.js';
+export { createCombinations } from './function/probability/combinations.js';
+export { createCombinationsWithRep } from './function/probability/combinationsWithRep.js';
+export { createGamma } from './function/probability/gamma.js';
+export { createFactorial } from './function/probability/factorial.js';
+export { createKldivergence } from './function/probability/kldivergence.js';
+export { createMultinomial } from './function/probability/multinomial.js';
+export { createPermutations } from './function/probability/permutations.js';
+export { createPickRandom } from './function/probability/pickRandom.js';
+export { createRandom } from './function/probability/random.js';
+export { createRandomInt } from './function/probability/randomInt.js';
+export { createStirlingS2 } from './function/combinatorics/stirlingS2.js';
+export { createBellNumbers } from './function/combinatorics/bellNumbers.js';
+export { createCatalan } from './function/combinatorics/catalan.js';
+export { createComposition } from './function/combinatorics/composition.js';
+export { createLeafCount } from './function/algebra/leafCount.js';
+export { createSimplify } from './function/algebra/simplify.js';
+export { createSimplifyCore } from './function/algebra/simplifyCore.js';
+export { createResolve } from './function/algebra/resolve.js';
+export { createSymbolicEqual } from './function/algebra/symbolicEqual.js';
+export { createDerivative } from './function/algebra/derivative.js';
+export { createRationalize } from './function/algebra/rationalize.js';
+export { createReviver } from './json/reviver.js';
+export { createReplacer } from './json/replacer.js';
+export { createE, createUppercaseE, createFalse, createI, createInfinity, createLN10, createLN2, createLOG10E, createLOG2E, createNaN, createNull, createPhi, createPi, createUppercasePi, createSQRT1_2, // eslint-disable-line camelcase
+createSQRT2, createTau, createTrue, createVersion } from './constants.js';
+export { createAtomicMass, createAvogadro, createBohrMagneton, createBohrRadius, createBoltzmann, createClassicalElectronRadius, createConductanceQuantum, createCoulomb, createDeuteronMass, createEfimovFactor, createElectricConstant, createElectronMass, createElementaryCharge, createFaraday, createFermiCoupling, createFineStructure, createFirstRadiation, createGasConstant, createGravitationConstant, createGravity, createHartreeEnergy, createInverseConductanceQuantum, createKlitzing, createLoschmidt, createMagneticConstant, createMagneticFluxQuantum, createMolarMass, createMolarMassC12, createMolarPlanckConstant, createMolarVolume, createNeutronMass, createNuclearMagneton, createPlanckCharge, createPlanckConstant, createPlanckLength, createPlanckMass, createPlanckTemperature, createPlanckTime, createProtonMass, createQuantumOfCirculation, createReducedPlanckConstant, createRydberg, createSackurTetrode, createSecondRadiation, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createVacuumImpedance, createWeakMixingAngle, createWienDisplacement } from './type/unit/physicalConstants.js';
+export { createApplyTransform } from './expression/transform/apply.transform.js';
+export { createColumnTransform } from './expression/transform/column.transform.js';
+export { createFilterTransform } from './expression/transform/filter.transform.js';
+export { createForEachTransform } from './expression/transform/forEach.transform.js';
+export { createIndexTransform } from './expression/transform/index.transform.js';
+export { createMapTransform } from './expression/transform/map.transform.js';
+export { createMaxTransform } from './expression/transform/max.transform.js';
+export { createMeanTransform } from './expression/transform/mean.transform.js';
+export { createMinTransform } from './expression/transform/min.transform.js';
+export { createRangeTransform } from './expression/transform/range.transform.js';
+export { createRowTransform } from './expression/transform/row.transform.js';
+export { createSubsetTransform } from './expression/transform/subset.transform.js';
+export { createConcatTransform } from './expression/transform/concat.transform.js';
+export { createDiffTransform } from './expression/transform/diff.transform.js';
+export { createStdTransform } from './expression/transform/std.transform.js';
+export { createSumTransform } from './expression/transform/sum.transform.js';
+export { createCumSumTransform } from './expression/transform/cumsum.transform.js';
+export { createVarianceTransform } from './expression/transform/variance.transform.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/factoriesNumber.js b/node_modules/mathjs/lib/esm/factoriesNumber.js
new file mode 100644
index 0000000..7f7deab
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/factoriesNumber.js
@@ -0,0 +1,236 @@
+import { absNumber, acoshNumber, acosNumber, acothNumber, acotNumber, acschNumber, acscNumber, addNumber, andNumber, asechNumber, asecNumber, asinhNumber, asinNumber, atan2Number, atanhNumber, atanNumber, bitAndNumber, bitNotNumber, bitOrNumber, bitXorNumber, cbrtNumber, ceilNumber, combinationsNumber, coshNumber, cosNumber, cothNumber, cotNumber, cschNumber, cscNumber, cubeNumber, divideNumber, expm1Number, expNumber, fixNumber, floorNumber, gammaNumber, gcdNumber, isIntegerNumber, isNaNNumber, isNegativeNumber, isPositiveNumber, isZeroNumber, lcmNumber, leftShiftNumber, log10Number, log1pNumber, log2Number, logNumber, modNumber, multiplyNumber, normNumber, notNumber, orNumber, powNumber, rightArithShiftNumber, rightLogShiftNumber, sechNumber, secNumber, signNumber, sinhNumber, sinNumber, sqrtNumber, squareNumber, subtractNumber, tanhNumber, tanNumber, unaryMinusNumber, unaryPlusNumber, xgcdNumber, xorNumber } from './plain/number/index.js';
+import { factory } from './utils/factory.js';
+import { noIndex, noMatrix, noSubset } from './utils/noop.js'; // ----------------------------------------------------------------------------
+// classes and functions
+// core
+
+export { createTyped } from './core/function/typed.js'; // classes
+
+export { createResultSet } from './type/resultset/ResultSet.js';
+export { createRangeClass } from './type/matrix/Range.js';
+export { createHelpClass } from './expression/Help.js';
+export { createChainClass } from './type/chain/Chain.js';
+export { createHelp } from './expression/function/help.js';
+export { createChain } from './type/chain/function/chain.js'; // algebra
+
+export { createResolve } from './function/algebra/resolve.js';
+export { createSimplify } from './function/algebra/simplify.js';
+export { createSimplifyCore } from './function/algebra/simplifyCore.js';
+export { createDerivative } from './function/algebra/derivative.js';
+export { createRationalize } from './function/algebra/rationalize.js'; // arithmetic
+
+export var createUnaryMinus = /* #__PURE__ */createNumberFactory('unaryMinus', unaryMinusNumber);
+export var createUnaryPlus = /* #__PURE__ */createNumberFactory('unaryPlus', unaryPlusNumber);
+export var createAbs = /* #__PURE__ */createNumberFactory('abs', absNumber);
+export var createAddScalar = /* #__PURE__ */createNumberFactory('addScalar', addNumber);
+export var createCbrt = /* #__PURE__ */createNumberFactory('cbrt', cbrtNumber);
+export var createCeil = /* #__PURE__ */createNumberFactory('ceil', ceilNumber);
+export var createCube = /* #__PURE__ */createNumberFactory('cube', cubeNumber);
+export var createExp = /* #__PURE__ */createNumberFactory('exp', expNumber);
+export var createExpm1 = /* #__PURE__ */createNumberFactory('expm1', expm1Number);
+export var createFix = /* #__PURE__ */createNumberFactory('fix', fixNumber);
+export var createFloor = /* #__PURE__ */createNumberFactory('floor', floorNumber);
+export var createGcd = /* #__PURE__ */createNumberFactory('gcd', gcdNumber);
+export var createLcm = /* #__PURE__ */createNumberFactory('lcm', lcmNumber);
+export var createLog10 = /* #__PURE__ */createNumberFactory('log10', log10Number);
+export var createLog2 = /* #__PURE__ */createNumberFactory('log2', log2Number);
+export var createMod = /* #__PURE__ */createNumberFactory('mod', modNumber);
+export var createMultiplyScalar = /* #__PURE__ */createNumberFactory('multiplyScalar', multiplyNumber);
+export var createMultiply = /* #__PURE__ */createNumberFactory('multiply', multiplyNumber);
+export { createNthRootNumber as createNthRoot } from './function/arithmetic/nthRoot.js';
+export var createSign = /* #__PURE__ */createNumberFactory('sign', signNumber);
+export var createSqrt = /* #__PURE__ */createNumberFactory('sqrt', sqrtNumber);
+export var createSquare = /* #__PURE__ */createNumberFactory('square', squareNumber);
+export var createSubtract = /* #__PURE__ */createNumberFactory('subtract', subtractNumber);
+export var createXgcd = /* #__PURE__ */createNumberFactory('xgcd', xgcdNumber);
+export var createDivideScalar = /* #__PURE__ */createNumberFactory('divideScalar', divideNumber);
+export var createPow = /* #__PURE__ */createNumberFactory('pow', powNumber);
+export { createRoundNumber as createRound } from './function/arithmetic/round.js';
+export var createLog = /* #__PURE__ */createNumberOptionalSecondArgFactory('log', logNumber);
+export var createLog1p = /* #__PURE__ */createNumberFactory('log1p', log1pNumber);
+export var createAdd = /* #__PURE__ */createNumberFactory('add', addNumber);
+export { createHypot } from './function/arithmetic/hypot.js';
+export var createNorm = /* #__PURE__ */createNumberFactory('norm', normNumber);
+export var createDivide = /* #__PURE__ */createNumberFactory('divide', divideNumber); // bitwise
+
+export var createBitAnd = /* #__PURE__ */createNumberFactory('bitAnd', bitAndNumber);
+export var createBitNot = /* #__PURE__ */createNumberFactory('bitNot', bitNotNumber);
+export var createBitOr = /* #__PURE__ */createNumberFactory('bitOr', bitOrNumber);
+export var createBitXor = /* #__PURE__ */createNumberFactory('bitXor', bitXorNumber);
+export var createLeftShift = /* #__PURE__ */createNumberFactory('leftShift', leftShiftNumber);
+export var createRightArithShift = /* #__PURE__ */createNumberFactory('rightArithShift', rightArithShiftNumber);
+export var createRightLogShift = /* #__PURE__ */createNumberFactory('rightLogShift', rightLogShiftNumber); // combinatorics
+
+export { createStirlingS2 } from './function/combinatorics/stirlingS2.js';
+export { createBellNumbers } from './function/combinatorics/bellNumbers.js';
+export { createCatalan } from './function/combinatorics/catalan.js';
+export { createComposition } from './function/combinatorics/composition.js'; // constants
+
+export { createE, createUppercaseE, createFalse, // createI,
+createInfinity, createLN10, createLN2, createLOG10E, createLOG2E, createNaN, createNull, createPhi, createPi, createUppercasePi, createSQRT1_2, // eslint-disable-line camelcase
+createSQRT2, createTau, createTrue, createVersion } from './constants.js'; // create
+
+export { createNumber } from './type/number.js';
+export { createString } from './type/string.js';
+export { createBoolean } from './type/boolean.js';
+export { createParser } from './expression/function/parser.js'; // expression
+
+export { createNode } from './expression/node/Node.js';
+export { createAccessorNode } from './expression/node/AccessorNode.js';
+export { createArrayNode } from './expression/node/ArrayNode.js';
+export { createAssignmentNode } from './expression/node/AssignmentNode.js';
+export { createBlockNode } from './expression/node/BlockNode.js';
+export { createConditionalNode } from './expression/node/ConditionalNode.js';
+export { createConstantNode } from './expression/node/ConstantNode.js';
+export { createFunctionAssignmentNode } from './expression/node/FunctionAssignmentNode.js';
+export { createIndexNode } from './expression/node/IndexNode.js';
+export { createObjectNode } from './expression/node/ObjectNode.js';
+export { createOperatorNode } from './expression/node/OperatorNode.js';
+export { createParenthesisNode } from './expression/node/ParenthesisNode.js';
+export { createRangeNode } from './expression/node/RangeNode.js';
+export { createRelationalNode } from './expression/node/RelationalNode.js';
+export { createSymbolNode } from './expression/node/SymbolNode.js';
+export { createFunctionNode } from './expression/node/FunctionNode.js';
+export { createParse } from './expression/parse.js';
+export { createCompile } from './expression/function/compile.js';
+export { createEvaluate } from './expression/function/evaluate.js';
+export { createParserClass } from './expression/Parser.js'; // logical
+
+export var createAnd = /* #__PURE__ */createNumberFactory('and', andNumber);
+export var createNot = /* #__PURE__ */createNumberFactory('not', notNumber);
+export var createOr = /* #__PURE__ */createNumberFactory('or', orNumber);
+export var createXor = /* #__PURE__ */createNumberFactory('xor', xorNumber); // matrix
+
+export { createApply } from './function/matrix/apply.js';
+export { createFilter } from './function/matrix/filter.js';
+export { createForEach } from './function/matrix/forEach.js';
+export { createMap } from './function/matrix/map.js';
+export { createRange } from './function/matrix/range.js';
+export { createSize } from './function/matrix/size.js'; // FIXME: create a lightweight "number" implementation of subset only supporting plain objects/arrays
+
+export var createIndex = /* #__PURE__ */factory('index', [], () => noIndex);
+export var createMatrix = /* #__PURE__ */factory('matrix', [], () => noMatrix); // FIXME: needed now because subset transform needs it. Remove the need for it in subset
+
+export var createSubset = /* #__PURE__ */factory('subset', [], () => noSubset); // TODO: provide number+array implementations for map, filter, forEach, zeros, ...?
+// TODO: create range implementation for range?
+
+export { createPartitionSelect } from './function/matrix/partitionSelect.js'; // probability
+
+export var createCombinations = createNumberFactory('combinations', combinationsNumber);
+export var createGamma = createNumberFactory('gamma', gammaNumber);
+export { createCombinationsWithRep } from './function/probability/combinationsWithRep.js';
+export { createFactorial } from './function/probability/factorial.js';
+export { createMultinomial } from './function/probability/multinomial.js';
+export { createPermutations } from './function/probability/permutations.js';
+export { createPickRandom } from './function/probability/pickRandom.js';
+export { createRandomNumber as createRandom } from './function/probability/random.js';
+export { createRandomInt } from './function/probability/randomInt.js'; // relational
+
+export { createEqualScalarNumber as createEqualScalar } from './function/relational/equalScalar.js';
+export { createCompareNumber as createCompare } from './function/relational/compare.js';
+export { createCompareNatural } from './function/relational/compareNatural.js';
+export { createCompareTextNumber as createCompareText } from './function/relational/compareText.js';
+export { createEqualNumber as createEqual } from './function/relational/equal.js';
+export { createEqualText } from './function/relational/equalText.js';
+export { createSmallerNumber as createSmaller } from './function/relational/smaller.js';
+export { createSmallerEqNumber as createSmallerEq } from './function/relational/smallerEq.js';
+export { createLargerNumber as createLarger } from './function/relational/larger.js';
+export { createLargerEqNumber as createLargerEq } from './function/relational/largerEq.js';
+export { createDeepEqual } from './function/relational/deepEqual.js';
+export { createUnequalNumber as createUnequal } from './function/relational/unequal.js'; // special
+
+export { createErf } from './function/special/erf.js'; // statistics
+
+export { createMode } from './function/statistics/mode.js';
+export { createProd } from './function/statistics/prod.js';
+export { createMax } from './function/statistics/max.js';
+export { createMin } from './function/statistics/min.js';
+export { createSum } from './function/statistics/sum.js';
+export { createCumSum } from './function/statistics/cumsum.js';
+export { createMean } from './function/statistics/mean.js';
+export { createMedian } from './function/statistics/median.js';
+export { createMad } from './function/statistics/mad.js';
+export { createVariance } from './function/statistics/variance.js';
+export { createQuantileSeq } from './function/statistics/quantileSeq.js';
+export { createStd } from './function/statistics/std.js'; // string
+
+export { createFormat } from './function/string/format.js';
+export { createPrint } from './function/string/print.js'; // trigonometry
+
+export var createAcos = /* #__PURE__ */createNumberFactory('acos', acosNumber);
+export var createAcosh = /* #__PURE__ */createNumberFactory('acosh', acoshNumber);
+export var createAcot = /* #__PURE__ */createNumberFactory('acot', acotNumber);
+export var createAcoth = /* #__PURE__ */createNumberFactory('acoth', acothNumber);
+export var createAcsc = /* #__PURE__ */createNumberFactory('acsc', acscNumber);
+export var createAcsch = /* #__PURE__ */createNumberFactory('acsch', acschNumber);
+export var createAsec = /* #__PURE__ */createNumberFactory('asec', asecNumber);
+export var createAsech = /* #__PURE__ */createNumberFactory('asech', asechNumber);
+export var createAsin = /* #__PURE__ */createNumberFactory('asin', asinNumber);
+export var createAsinh = /* #__PURE__ */createNumberFactory('asinh', asinhNumber);
+export var createAtan = /* #__PURE__ */createNumberFactory('atan', atanNumber);
+export var createAtan2 = /* #__PURE__ */createNumberFactory('atan2', atan2Number);
+export var createAtanh = /* #__PURE__ */createNumberFactory('atanh', atanhNumber);
+export var createCos = /* #__PURE__ */createNumberFactory('cos', cosNumber);
+export var createCosh = /* #__PURE__ */createNumberFactory('cosh', coshNumber);
+export var createCot = /* #__PURE__ */createNumberFactory('cot', cotNumber);
+export var createCoth = /* #__PURE__ */createNumberFactory('coth', cothNumber);
+export var createCsc = /* #__PURE__ */createNumberFactory('csc', cscNumber);
+export var createCsch = /* #__PURE__ */createNumberFactory('csch', cschNumber);
+export var createSec = /* #__PURE__ */createNumberFactory('sec', secNumber);
+export var createSech = /* #__PURE__ */createNumberFactory('sech', sechNumber);
+export var createSin = /* #__PURE__ */createNumberFactory('sin', sinNumber);
+export var createSinh = /* #__PURE__ */createNumberFactory('sinh', sinhNumber);
+export var createTan = /* #__PURE__ */createNumberFactory('tan', tanNumber);
+export var createTanh = /* #__PURE__ */createNumberFactory('tanh', tanhNumber); // transforms
+
+export { createApplyTransform } from './expression/transform/apply.transform.js';
+export { createFilterTransform } from './expression/transform/filter.transform.js';
+export { createForEachTransform } from './expression/transform/forEach.transform.js';
+export { createMapTransform } from './expression/transform/map.transform.js';
+export { createMaxTransform } from './expression/transform/max.transform.js';
+export { createMeanTransform } from './expression/transform/mean.transform.js';
+export { createMinTransform } from './expression/transform/min.transform.js';
+export { createRangeTransform } from './expression/transform/range.transform.js';
+export var createSubsetTransform = /* #__PURE__ */factory('subset', [], () => noSubset, {
+  isTransformFunction: true
+});
+export { createStdTransform } from './expression/transform/std.transform.js';
+export { createSumTransform } from './expression/transform/sum.transform.js';
+export { createCumSumTransform } from './expression/transform/cumsum.transform.js';
+export { createVarianceTransform } from './expression/transform/variance.transform.js'; // utils
+
+export { createClone } from './function/utils/clone.js';
+export var createIsInteger = /* #__PURE__ */createNumberFactory('isInteger', isIntegerNumber);
+export var createIsNegative = /* #__PURE__ */createNumberFactory('isNegative', isNegativeNumber);
+export { createIsNumeric } from './function/utils/isNumeric.js';
+export { createHasNumericValue } from './function/utils/hasNumericValue.js';
+export var createIsPositive = /* #__PURE__ */createNumberFactory('isPositive', isPositiveNumber);
+export var createIsZero = /* #__PURE__ */createNumberFactory('isZero', isZeroNumber);
+export var createIsNaN = /* #__PURE__ */createNumberFactory('isNaN', isNaNNumber);
+export { createTypeOf } from './function/utils/typeOf.js';
+export { createIsPrime } from './function/utils/isPrime.js';
+export { createNumeric } from './function/utils/numeric.js'; // json
+
+export { createReviver } from './json/reviver.js';
+export { createReplacer } from './json/replacer.js'; // helper functions to create a factory function for a function which only needs typed-function
+
+function createNumberFactory(name, fn) {
+  return factory(name, ['typed'], _ref => {
+    var {
+      typed
+    } = _ref;
+    return typed(fn);
+  });
+}
+
+function createNumberOptionalSecondArgFactory(name, fn) {
+  return factory(name, ['typed'], _ref2 => {
+    var {
+      typed
+    } = _ref2;
+    return typed({
+      number: fn,
+      'number,number': fn
+    });
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js b/node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js
new file mode 100644
index 0000000..1f1dc1c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js
@@ -0,0 +1,413 @@
+import { clone } from '../../../utils/object.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'lup';
+var dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];
+export var createLup = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    abs,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    subtract,
+    larger,
+    equalScalar,
+    unaryMinus,
+    DenseMatrix,
+    SparseMatrix,
+    Spa
+  } = _ref;
+
+  /**
+   * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a
+   * row permutation vector `p` where `A[p,:] = L * U`
+   *
+   * Syntax:
+   *
+   *    math.lup(A)
+   *
+   * Example:
+   *
+   *    const m = [[2, 1], [1, 4]]
+   *    const r = math.lup(m)
+   *    // r = {
+   *    //   L: [[1, 0], [0.5, 1]],
+   *    //   U: [[2, 1], [0, 3.5]],
+   *    //   P: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    slu, lsolve, lusolve, usolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array for which to get the LUP decomposition.
+   *
+   * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.
+   */
+  return typed(name, {
+    DenseMatrix: function DenseMatrix(m) {
+      return _denseLUP(m);
+    },
+    SparseMatrix: function SparseMatrix(m) {
+      return _sparseLUP(m);
+    },
+    Array: function Array(a) {
+      // create dense matrix from array
+      var m = matrix(a); // lup, use matrix implementation
+
+      var r = _denseLUP(m); // result
+
+
+      return {
+        L: r.L.valueOf(),
+        U: r.U.valueOf(),
+        p: r.p
+      };
+    }
+  });
+
+  function _denseLUP(m) {
+    // rows & columns
+    var rows = m._size[0];
+    var columns = m._size[1]; // minimum rows and columns
+
+    var n = Math.min(rows, columns); // matrix array, clone original data
+
+    var data = clone(m._data); // l matrix arrays
+
+    var ldata = [];
+    var lsize = [rows, n]; // u matrix arrays
+
+    var udata = [];
+    var usize = [n, columns]; // vars
+
+    var i, j, k; // permutation vector
+
+    var p = [];
+
+    for (i = 0; i < rows; i++) {
+      p[i] = i;
+    } // loop columns
+
+
+    for (j = 0; j < columns; j++) {
+      // skip first column in upper triangular matrix
+      if (j > 0) {
+        // loop rows
+        for (i = 0; i < rows; i++) {
+          // min i,j
+          var min = Math.min(i, j); // v[i, j]
+
+          var s = 0; // loop up to min
+
+          for (k = 0; k < min; k++) {
+            // s = l[i, k] - data[k, j]
+            s = addScalar(s, multiplyScalar(data[i][k], data[k][j]));
+          }
+
+          data[i][j] = subtract(data[i][j], s);
+        }
+      } // row with larger value in cvector, row >= j
+
+
+      var pi = j;
+      var pabsv = 0;
+      var vjj = 0; // loop rows
+
+      for (i = j; i < rows; i++) {
+        // data @ i, j
+        var v = data[i][j]; // absolute value
+
+        var absv = abs(v); // value is greater than pivote value
+
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = i; // update max value
+
+          pabsv = absv; // value @ [j, j]
+
+          vjj = v;
+        }
+      } // swap rows (j <-> pi)
+
+
+      if (j !== pi) {
+        // swap values j <-> pi in p
+        p[j] = [p[pi], p[pi] = p[j]][0]; // swap j <-> pi in data
+
+        DenseMatrix._swapRows(j, pi, data);
+      } // check column is in lower triangular matrix
+
+
+      if (j < rows) {
+        // loop rows (lower triangular matrix)
+        for (i = j + 1; i < rows; i++) {
+          // value @ i, j
+          var vij = data[i][j];
+
+          if (!equalScalar(vij, 0)) {
+            // update data
+            data[i][j] = divideScalar(data[i][j], vjj);
+          }
+        }
+      }
+    } // loop columns
+
+
+    for (j = 0; j < columns; j++) {
+      // loop rows
+      for (i = 0; i < rows; i++) {
+        // initialize row in arrays
+        if (j === 0) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i] = [];
+          } // L
+
+
+          ldata[i] = [];
+        } // check we are in the upper triangular matrix
+
+
+        if (i < j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          } // check column exists in lower triangular matrix
+
+
+          if (j < rows) {
+            // L
+            ldata[i][j] = 0;
+          }
+
+          continue;
+        } // diagonal value
+
+
+        if (i === j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          } // check column exists in lower triangular matrix
+
+
+          if (j < rows) {
+            // L
+            ldata[i][j] = 1;
+          }
+
+          continue;
+        } // check row exists in upper triangular matrix
+
+
+        if (i < columns) {
+          // U
+          udata[i][j] = 0;
+        } // check column exists in lower triangular matrix
+
+
+        if (j < rows) {
+          // L
+          ldata[i][j] = data[i][j];
+        }
+      }
+    } // l matrix
+
+
+    var l = new DenseMatrix({
+      data: ldata,
+      size: lsize
+    }); // u matrix
+
+    var u = new DenseMatrix({
+      data: udata,
+      size: usize
+    }); // p vector
+
+    var pv = [];
+
+    for (i = 0, n = p.length; i < n; i++) {
+      pv[p[i]] = i;
+    } // return matrices
+
+
+    return {
+      L: l,
+      U: u,
+      p: pv,
+      toString: function toString() {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+
+  function _sparseLUP(m) {
+    // rows & columns
+    var rows = m._size[0];
+    var columns = m._size[1]; // minimum rows and columns
+
+    var n = Math.min(rows, columns); // matrix arrays (will not be modified, thanks to permutation vector)
+
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // l matrix arrays
+
+    var lvalues = [];
+    var lindex = [];
+    var lptr = [];
+    var lsize = [rows, n]; // u matrix arrays
+
+    var uvalues = [];
+    var uindex = [];
+    var uptr = [];
+    var usize = [n, columns]; // vars
+
+    var i, j, k; // permutation vectors, (current index -> original index) and (original index -> current index)
+
+    var pvCo = [];
+    var pvOc = [];
+
+    for (i = 0; i < rows; i++) {
+      pvCo[i] = i;
+      pvOc[i] = i;
+    } // swap indices in permutation vectors (condition x < y)!
+
+
+    var swapIndeces = function swapIndeces(x, y) {
+      // find pv indeces getting data from x and y
+      var kx = pvOc[x];
+      var ky = pvOc[y]; // update permutation vector current -> original
+
+      pvCo[kx] = y;
+      pvCo[ky] = x; // update permutation vector original -> current
+
+      pvOc[x] = ky;
+      pvOc[y] = kx;
+    }; // loop columns
+
+
+    var _loop = function _loop() {
+      // sparse accumulator
+      var spa = new Spa(); // check lower triangular matrix has a value @ column j
+
+      if (j < rows) {
+        // update ptr
+        lptr.push(lvalues.length); // first value in j column for lower triangular matrix
+
+        lvalues.push(1);
+        lindex.push(j);
+      } // update ptr
+
+
+      uptr.push(uvalues.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1]; // copy column j into sparse accumulator
+
+      for (k = k0; k < k1; k++) {
+        // row
+        i = index[k]; // copy column values into sparse accumulator (use permutation vector)
+
+        spa.set(pvCo[i], values[k]);
+      } // skip first column in upper triangular matrix
+
+
+      if (j > 0) {
+        // loop rows in column j (above diagonal)
+        spa.forEach(0, j - 1, function (k, vkj) {
+          // loop rows in column k (L)
+          SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {
+            // check row is below k
+            if (i > k) {
+              // update spa value
+              spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)));
+            }
+          });
+        });
+      } // row with larger value in spa, row >= j
+
+
+      var pi = j;
+      var vjj = spa.get(j);
+      var pabsv = abs(vjj); // loop values in spa (order by row, below diagonal)
+
+      spa.forEach(j + 1, rows - 1, function (x, v) {
+        // absolute value
+        var absv = abs(v); // value is greater than pivote value
+
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = x; // update max value
+
+          pabsv = absv; // value @ [j, j]
+
+          vjj = v;
+        }
+      }); // swap rows (j <-> pi)
+
+      if (j !== pi) {
+        // swap values j <-> pi in L
+        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); // swap values j <-> pi in U
+
+
+        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); // swap values in spa
+
+
+        spa.swap(j, pi); // update permutation vector (swap values @ j, pi)
+
+        swapIndeces(j, pi);
+      } // loop values in spa (order by row)
+
+
+      spa.forEach(0, rows - 1, function (x, v) {
+        // check we are above diagonal
+        if (x <= j) {
+          // update upper triangular matrix
+          uvalues.push(v);
+          uindex.push(x);
+        } else {
+          // update value
+          v = divideScalar(v, vjj); // check value is non zero
+
+          if (!equalScalar(v, 0)) {
+            // update lower triangular matrix
+            lvalues.push(v);
+            lindex.push(x);
+          }
+        }
+      });
+    };
+
+    for (j = 0; j < columns; j++) {
+      _loop();
+    } // update ptrs
+
+
+    uptr.push(uvalues.length);
+    lptr.push(lvalues.length); // return matrices
+
+    return {
+      L: new SparseMatrix({
+        values: lvalues,
+        index: lindex,
+        ptr: lptr,
+        size: lsize
+      }),
+      U: new SparseMatrix({
+        values: uvalues,
+        index: uindex,
+        ptr: uptr,
+        size: usize
+      }),
+      p: pvCo,
+      toString: function toString() {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js b/node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js
new file mode 100644
index 0000000..aa9a482
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js
@@ -0,0 +1,236 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { factory } from '../../../utils/factory.js';
+var name = 'qr';
+var dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'complex'];
+export var createQr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    zeros,
+    identity,
+    isZero,
+    equal,
+    sign,
+    sqrt,
+    conj,
+    unaryMinus,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    subtract,
+    complex
+  } = _ref;
+
+  /**
+   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in
+   * two matrices (`Q`, `R`) where `Q` is an
+   * orthogonal matrix and `R` is an upper triangular matrix.
+   *
+   * Syntax:
+   *
+   *    math.qr(A)
+   *
+   * Example:
+   *
+   *    const m = [
+   *      [1, -1,  4],
+   *      [1,  4, -2],
+   *      [1,  4,  2],
+   *      [1,  -1, 0]
+   *    ]
+   *    const result = math.qr(m)
+   *    // r = {
+   *    //   Q: [
+   *    //     [0.5, -0.5,   0.5],
+   *    //     [0.5,  0.5,  -0.5],
+   *    //     [0.5,  0.5,   0.5],
+   *    //     [0.5, -0.5,  -0.5],
+   *    //   ],
+   *    //   R: [
+   *    //     [2, 3,  2],
+   *    //     [0, 5, -2],
+   *    //     [0, 0,  4],
+   *    //     [0, 0,  0]
+   *    //   ]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lusolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array
+   * for which to get the QR decomposition.
+   *
+   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal
+   * matrix and R: the upper triangular matrix
+   */
+  return _extends(typed(name, {
+    DenseMatrix: function DenseMatrix(m) {
+      return _denseQR(m);
+    },
+    SparseMatrix: function SparseMatrix(m) {
+      return _sparseQR(m);
+    },
+    Array: function Array(a) {
+      // create dense matrix from array
+      var m = matrix(a); // lup, use matrix implementation
+
+      var r = _denseQR(m); // result
+
+
+      return {
+        Q: r.Q.valueOf(),
+        R: r.R.valueOf()
+      };
+    }
+  }), {
+    _denseQRimpl
+  });
+
+  function _denseQRimpl(m) {
+    // rows & columns (m x n)
+    var rows = m._size[0]; // m
+
+    var cols = m._size[1]; // n
+
+    var Q = identity([rows], 'dense');
+    var Qdata = Q._data;
+    var R = m.clone();
+    var Rdata = R._data; // vars
+
+    var i, j, k;
+    var w = zeros([rows], '');
+
+    for (k = 0; k < Math.min(cols, rows); ++k) {
+      /*
+       * **k-th Household matrix**
+       *
+       * The matrix I - 2*v*transpose(v)
+       * x     = first column of A
+       * x1    = first element of x
+       * alpha = x1 / |x1| * |x|
+       * e1    = tranpose([1, 0, 0, ...])
+       * u     = x - alpha * e1
+       * v     = u / |u|
+       *
+       * Household matrix = I - 2 * v * tranpose(v)
+       *
+       *  * Initially Q = I and R = A.
+       *  * Household matrix is a reflection in a plane normal to v which
+       *    will zero out all but the top right element in R.
+       *  * Appplying reflection to both Q and R will not change product.
+       *  * Repeat this process on the (1,1) minor to get R as an upper
+       *    triangular matrix.
+       *  * Reflections leave the magnitude of the columns of Q unchanged
+       *    so Q remains othoganal.
+       *
+       */
+      var pivot = Rdata[k][k];
+      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));
+      var conjSgn = conj(sgn);
+      var alphaSquared = 0;
+
+      for (i = k; i < rows; i++) {
+        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));
+      }
+
+      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));
+
+      if (!isZero(alpha)) {
+        // first element in vector u
+        var u1 = subtract(pivot, alpha); // w = v * u1 / |u|    (only elements k to (rows-1) are used)
+
+        w[k] = 1;
+
+        for (i = k + 1; i < rows; i++) {
+          w[i] = divideScalar(Rdata[i][k], u1);
+        } // tau = - conj(u1 / alpha)
+
+
+        var tau = unaryMinus(conj(divideScalar(u1, alpha)));
+        var s = void 0;
+        /*
+         * tau and w have been choosen so that
+         *
+         * 2 * v * tranpose(v) = tau * w * tranpose(w)
+         */
+
+        /*
+         * -- calculate R = R - tau * w * tranpose(w) * R --
+         * Only do calculation with rows k to (rows-1)
+         * Additionally columns 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+
+        for (j = k; j < cols; j++) {
+          s = 0.0; // calculate jth element of [tranpose(w) * R]
+
+          for (i = k; i < rows; i++) {
+            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));
+          } // calculate the jth element of [tau * transpose(w) * R]
+
+
+          s = multiplyScalar(s, tau);
+
+          for (i = k; i < rows; i++) {
+            Rdata[i][j] = multiplyScalar(subtract(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);
+          }
+        }
+        /*
+         * -- calculate Q = Q - tau * Q * w * transpose(w) --
+         * Q is a square matrix (rows x rows)
+         * Only do calculation with columns k to (rows-1)
+         * Additionally rows 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+
+
+        for (i = 0; i < rows; i++) {
+          s = 0.0; // calculate ith element of [Q * w]
+
+          for (j = k; j < rows; j++) {
+            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));
+          } // calculate the ith element of [tau * Q * w]
+
+
+          s = multiplyScalar(s, tau);
+
+          for (j = k; j < rows; ++j) {
+            Qdata[i][j] = divideScalar(subtract(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);
+          }
+        }
+      }
+    } // return matrices
+
+
+    return {
+      Q: Q,
+      R: R,
+      toString: function toString() {
+        return 'Q: ' + this.Q.toString() + '\nR: ' + this.R.toString();
+      }
+    };
+  }
+
+  function _denseQR(m) {
+    var ret = _denseQRimpl(m);
+
+    var Rdata = ret.R._data;
+
+    if (m._data.length > 0) {
+      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;
+
+      for (var i = 0; i < Rdata.length; ++i) {
+        for (var j = 0; j < i && j < (Rdata[0] || []).length; ++j) {
+          Rdata[i][j] = zero;
+        }
+      }
+    }
+
+    return ret;
+  }
+
+  function _sparseQR(m) {
+    throw new Error('qr not implemented for sparse matrices yet');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js b/node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js
new file mode 100644
index 0000000..a79219c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js
@@ -0,0 +1,100 @@
+import { isInteger } from '../../../utils/number.js';
+import { factory } from '../../../utils/factory.js';
+import { createCsSqr } from '../sparse/csSqr.js';
+import { createCsLu } from '../sparse/csLu.js';
+var name = 'slu';
+var dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+export var createSlu = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    multiply,
+    transpose,
+    divideScalar,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  } = _ref;
+  var csSqr = createCsSqr({
+    add,
+    multiply,
+    transpose
+  });
+  var csLu = createCsLu({
+    abs,
+    divideScalar,
+    multiply,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  });
+  /**
+   * Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where
+   *
+   * `P * A * Q = L * U`
+   *
+   * Syntax:
+   *
+   *    math.slu(A, order, threshold)
+   *
+   * Examples:
+   *
+   *    const A = math.sparse([[4,3], [6, 3]])
+   *    math.slu(A, 1, 0.001)
+   *    // returns:
+   *    // {
+   *    //   L: [[1, 0], [1.5, 1]]
+   *    //   U: [[4, 3], [0, -1.5]]
+   *    //   p: [0, 1]
+   *    //   q: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lsolve, usolve, lusolve
+   *
+   * @param {SparseMatrix} A              A two dimensional sparse matrix for which to get the LU decomposition.
+   * @param {Number}       order          The Symbolic Ordering and Analysis order:
+   *                                       0 - Natural ordering, no permutation vector q is returned
+   *                                       1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'
+   *                                       2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.
+   *                                           This is appropriatefor LU factorization of unsymmetric matrices.
+   *                                       3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.
+   *                                           A dense row is a row with more than 10*sqr(columns) entries.
+   * @param {Number}       threshold       Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.
+   */
+
+  return typed(name, {
+    'SparseMatrix, number, number': function SparseMatrixNumberNumber(a, order, threshold) {
+      // verify order
+      if (!isInteger(order) || order < 0 || order > 3) {
+        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');
+      } // verify threshold
+
+
+      if (threshold < 0 || threshold > 1) {
+        throw new Error('Partial pivoting threshold must be a number from 0 to 1');
+      } // perform symbolic ordering and analysis
+
+
+      var s = csSqr(order, a, false); // perform lu decomposition
+
+      var f = csLu(a, s, threshold); // return decomposition
+
+      return {
+        L: f.L,
+        U: f.U,
+        p: f.pinv,
+        q: s.q,
+        toString: function toString() {
+          return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\np: ' + this.p.toString() + (this.q ? '\nq: ' + this.q.toString() : '') + '\n';
+        }
+      };
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/derivative.js b/node_modules/mathjs/lib/esm/function/algebra/derivative.js
new file mode 100644
index 0000000..7aee5a4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/derivative.js
@@ -0,0 +1,620 @@
+import { isConstantNode, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'derivative';
+var dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+export var createDerivative = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    parse,
+    simplify,
+    equal,
+    isZero,
+    numeric,
+    ConstantNode,
+    FunctionNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode
+  } = _ref;
+
+  /**
+   * Takes the derivative of an expression expressed in parser Nodes.
+   * The derivative will be taken over the supplied variable in the
+   * second parameter. If there are multiple variables in the expression,
+   * it will return a partial derivative.
+   *
+   * This uses rules of differentiation which can be found here:
+   *
+   * - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)
+   *
+   * Syntax:
+   *
+   *     derivative(expr, variable)
+   *     derivative(expr, variable, options)
+   *
+   * Examples:
+   *
+   *     math.derivative('x^2', 'x')                     // Node {2 * x}
+   *     math.derivative('x^2', 'x', {simplify: false})  // Node {2 * 1 * x ^ (2 - 1)
+   *     math.derivative('sin(2x)', 'x'))                // Node {2 * cos(2 * x)}
+   *     math.derivative('2*x', 'x').evaluate()          // number 2
+   *     math.derivative('x^2', 'x').evaluate({x: 4})    // number 8
+   *     const f = math.parse('x^2')
+   *     const x = math.parse('x')
+   *     math.derivative(f, x)                           // Node {2 * x}
+   *
+   * See also:
+   *
+   *     simplify, parse, evaluate
+   *
+   * @param  {Node | string} expr           The expression to differentiate
+   * @param  {SymbolNode | string} variable The variable over which to differentiate
+   * @param  {{simplify: boolean}} [options]
+   *                         There is one option available, `simplify`, which
+   *                         is true by default. When false, output will not
+   *                         be simplified.
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+  var derivative = typed('derivative', {
+    'Node, SymbolNode, Object': function NodeSymbolNodeObject(expr, variable, options) {
+      var constNodes = {};
+      constTag(constNodes, expr, variable.name);
+
+      var res = _derivative(expr, constNodes);
+
+      return options.simplify ? simplify(res) : res;
+    },
+    'Node, SymbolNode': function NodeSymbolNode(expr, variable) {
+      return this(expr, variable, {
+        simplify: true
+      });
+    },
+    'string, SymbolNode': function stringSymbolNode(expr, variable) {
+      return this(parse(expr), variable);
+    },
+    'string, SymbolNode, Object': function stringSymbolNodeObject(expr, variable, options) {
+      return this(parse(expr), variable, options);
+    },
+    'string, string': function stringString(expr, variable) {
+      return this(parse(expr), parse(variable));
+    },
+    'string, string, Object': function stringStringObject(expr, variable, options) {
+      return this(parse(expr), parse(variable), options);
+    },
+    'Node, string': function NodeString(expr, variable) {
+      return this(expr, parse(variable));
+    },
+    'Node, string, Object': function NodeStringObject(expr, variable, options) {
+      return this(expr, parse(variable), options);
+    } // TODO: replace the 8 signatures above with 4 as soon as typed-function supports optional arguments
+
+    /* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}
+    'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {
+      let res = expr
+      for (let i = 0; i < order; i++) {
+        let constNodes = {}
+        constTag(constNodes, expr, variable.name)
+        res = _derivative(res, constNodes)
+      }
+      return res
+    }
+    */
+
+  });
+  derivative._simplify = true;
+
+  derivative.toTex = function (deriv) {
+    return _derivTex.apply(null, deriv.args);
+  }; // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.
+  // NOTE: the optional "order" parameter here is currently unused
+
+
+  var _derivTex = typed('_derivTex', {
+    'Node, SymbolNode': function NodeSymbolNode(expr, x) {
+      if (isConstantNode(expr) && typeOf(expr.value) === 'string') {
+        return _derivTex(parse(expr.value).toString(), x.toString(), 1);
+      } else {
+        return _derivTex(expr.toString(), x.toString(), 1);
+      }
+    },
+    'Node, ConstantNode': function NodeConstantNode(expr, x) {
+      if (typeOf(x.value) === 'string') {
+        return _derivTex(expr, parse(x.value));
+      } else {
+        throw new Error("The second parameter to 'derivative' is a non-string constant");
+      }
+    },
+    'Node, SymbolNode, ConstantNode': function NodeSymbolNodeConstantNode(expr, x, order) {
+      return _derivTex(expr.toString(), x.name, order.value);
+    },
+    'string, string, number': function stringStringNumber(expr, x, order) {
+      var d;
+
+      if (order === 1) {
+        d = '{d\\over d' + x + '}';
+      } else {
+        d = '{d^{' + order + '}\\over d' + x + '^{' + order + '}}';
+      }
+
+      return d + "\\left[".concat(expr, "\\right]");
+    }
+  });
+  /**
+   * Does a depth-first search on the expression tree to identify what Nodes
+   * are constants (e.g. 2 + 2), and stores the ones that are constants in
+   * constNodes. Classification is done as follows:
+   *
+   *   1. ConstantNodes are constants.
+   *   2. If there exists a SymbolNode, of which we are differentiating over,
+   *      in the subtree it is not constant.
+   *
+   * @param  {Object} constNodes  Holds the nodes that are constant
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {string} varName     Variable that we are differentiating
+   * @return {boolean}  if node is constant
+   */
+  // TODO: can we rewrite constTag into a pure function?
+
+
+  var constTag = typed('constTag', {
+    'Object, ConstantNode, string': function ObjectConstantNodeString(constNodes, node) {
+      constNodes[node] = true;
+      return true;
+    },
+    'Object, SymbolNode, string': function ObjectSymbolNodeString(constNodes, node, varName) {
+      // Treat other variables like constants. For reasoning, see:
+      //   https://en.wikipedia.org/wiki/Partial_derivative
+      if (node.name !== varName) {
+        constNodes[node] = true;
+        return true;
+      }
+
+      return false;
+    },
+    'Object, ParenthesisNode, string': function ObjectParenthesisNodeString(constNodes, node, varName) {
+      return constTag(constNodes, node.content, varName);
+    },
+    'Object, FunctionAssignmentNode, string': function ObjectFunctionAssignmentNodeString(constNodes, node, varName) {
+      if (node.params.indexOf(varName) === -1) {
+        constNodes[node] = true;
+        return true;
+      }
+
+      return constTag(constNodes, node.expr, varName);
+    },
+    'Object, FunctionNode | OperatorNode, string': function ObjectFunctionNodeOperatorNodeString(constNodes, node, varName) {
+      if (node.args.length > 0) {
+        var isConst = constTag(constNodes, node.args[0], varName);
+
+        for (var i = 1; i < node.args.length; ++i) {
+          isConst = constTag(constNodes, node.args[i], varName) && isConst;
+        }
+
+        if (isConst) {
+          constNodes[node] = true;
+          return true;
+        }
+      }
+
+      return false;
+    }
+  });
+  /**
+   * Applies differentiation rules.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {Object} constNodes  Holds the nodes that are constant
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+
+  var _derivative = typed('_derivative', {
+    'ConstantNode, Object': function ConstantNodeObject(node) {
+      return createConstantNode(0);
+    },
+    'SymbolNode, Object': function SymbolNodeObject(node, constNodes) {
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      return createConstantNode(1);
+    },
+    'ParenthesisNode, Object': function ParenthesisNodeObject(node, constNodes) {
+      return new ParenthesisNode(_derivative(node.content, constNodes));
+    },
+    'FunctionAssignmentNode, Object': function FunctionAssignmentNodeObject(node, constNodes) {
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      return _derivative(node.expr, constNodes);
+    },
+    'FunctionNode, Object': function FunctionNodeObject(node, constNodes) {
+      if (node.args.length !== 1) {
+        funcArgsCheck(node);
+      }
+
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      var arg0 = node.args[0];
+      var arg1;
+      var div = false; // is output a fraction?
+
+      var negative = false; // is output negative?
+
+      var funcDerivative;
+
+      switch (node.name) {
+        case 'cbrt':
+          // d/dx(cbrt(x)) = 1 / (3x^(2/3))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);
+          break;
+
+        case 'sqrt':
+        case 'nthRoot':
+          // d/dx(sqrt(x)) = 1 / (2*sqrt(x))
+          if (node.args.length === 1) {
+            div = true;
+            funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);
+          } else if (node.args.length === 2) {
+            // Rearrange from nthRoot(x, a) -> x^(1/a)
+            arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]); // Is a variable?
+
+            constNodes[arg1] = constNodes[node.args[1]];
+            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes);
+          }
+
+          break;
+
+        case 'log10':
+          arg1 = createConstantNode(10);
+
+        /* fall through! */
+
+        case 'log':
+          if (!arg1 && node.args.length === 1) {
+            // d/dx(log(x)) = 1 / x
+            funcDerivative = arg0.clone();
+            div = true;
+          } else if (node.args.length === 1 && arg1 || node.args.length === 2 && constNodes[node.args[1]] !== undefined) {
+            // d/dx(log(x, c)) = 1 / (x*ln(c))
+            funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);
+            div = true;
+          } else if (node.args.length === 2) {
+            // d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))
+            return _derivative(new OperatorNode('/', 'divide', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), constNodes);
+          }
+
+          break;
+
+        case 'pow':
+          constNodes[arg1] = constNodes[node.args[1]]; // Pass to pow operator node parser
+
+          return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes);
+
+        case 'exp':
+          // d/dx(e^x) = e^x
+          funcDerivative = new FunctionNode('exp', [arg0.clone()]);
+          break;
+
+        case 'sin':
+          // d/dx(sin(x)) = cos(x)
+          funcDerivative = new FunctionNode('cos', [arg0.clone()]);
+          break;
+
+        case 'cos':
+          // d/dx(cos(x)) = -sin(x)
+          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);
+          break;
+
+        case 'tan':
+          // d/dx(tan(x)) = sec(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'sec':
+          // d/dx(sec(x)) = sec(x)tan(x)
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);
+          break;
+
+        case 'csc':
+          // d/dx(csc(x)) = -csc(x)cot(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);
+          break;
+
+        case 'cot':
+          // d/dx(cot(x)) = -csc(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'asin':
+          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+
+        case 'acos':
+          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+
+        case 'atan':
+          // d/dx(atan(x)) = 1 / (x^2 + 1)
+          div = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+
+        case 'asec':
+          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+
+        case 'acsc':
+          // d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+
+        case 'acot':
+          // d/dx(acot(x)) = -1 / (x^2 + 1)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+
+        case 'sinh':
+          // d/dx(sinh(x)) = cosh(x)
+          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);
+          break;
+
+        case 'cosh':
+          // d/dx(cosh(x)) = sinh(x)
+          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);
+          break;
+
+        case 'tanh':
+          // d/dx(tanh(x)) = sech(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'sech':
+          // d/dx(sech(x)) = -sech(x)tanh(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);
+          break;
+
+        case 'csch':
+          // d/dx(csch(x)) = -csch(x)coth(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);
+          break;
+
+        case 'coth':
+          // d/dx(coth(x)) = -csch(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);
+          break;
+
+        case 'asinh':
+          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+
+        case 'acosh':
+          // d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+
+        case 'atanh':
+          // d/dx(atanh(x)) = 1 / (1 - x^2)
+          div = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+
+        case 'asech':
+          // d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);
+          break;
+
+        case 'acsch':
+          // d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+
+        case 'acoth':
+          // d/dx(acoth(x)) = -1 / (1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+
+        case 'abs':
+          // d/dx(abs(x)) = abs(x)/x
+          funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);
+          break;
+
+        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)
+
+        default:
+          throw new Error('Function "' + node.name + '" is not supported by derivative, or a wrong number of arguments is passed');
+      }
+
+      var op, func;
+
+      if (div) {
+        op = '/';
+        func = 'divide';
+      } else {
+        op = '*';
+        func = 'multiply';
+      }
+      /* Apply chain rule to all functions:
+         F(x)  = f(g(x))
+         F'(x) = g'(x)*f'(g(x)) */
+
+
+      var chainDerivative = _derivative(arg0, constNodes);
+
+      if (negative) {
+        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);
+      }
+
+      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);
+    },
+    'OperatorNode, Object': function OperatorNodeObject(node, constNodes) {
+      if (constNodes[node] !== undefined) {
+        return createConstantNode(0);
+      }
+
+      if (node.op === '+') {
+        // d/dx(sum(f(x)) = sum(f'(x))
+        return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {
+          return _derivative(arg, constNodes);
+        }));
+      }
+
+      if (node.op === '-') {
+        // d/dx(+/-f(x)) = +/-f'(x)
+        if (node.isUnary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes)]);
+        } // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)
+
+
+        if (node.isBinary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes), _derivative(node.args[1], constNodes)]);
+        }
+      }
+
+      if (node.op === '*') {
+        // d/dx(c*f(x)) = c*f'(x)
+        var constantTerms = node.args.filter(function (arg) {
+          return constNodes[arg] !== undefined;
+        });
+
+        if (constantTerms.length > 0) {
+          var nonConstantTerms = node.args.filter(function (arg) {
+            return constNodes[arg] === undefined;
+          });
+          var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);
+          var newArgs = constantTerms.concat(_derivative(nonConstantNode, constNodes));
+          return new OperatorNode('*', 'multiply', newArgs);
+        } // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)
+
+
+        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {
+          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {
+            return argInner === argOuter ? _derivative(argInner, constNodes) : argInner.clone();
+          }));
+        }));
+      }
+
+      if (node.op === '/' && node.isBinary()) {
+        var arg0 = node.args[0];
+        var arg1 = node.args[1]; // d/dx(f(x) / c) = f'(x) / c
+
+        if (constNodes[arg1] !== undefined) {
+          return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1]);
+        } // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)
+
+
+        if (constNodes[arg0] !== undefined) {
+          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, constNodes), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);
+        } // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2
+
+
+        return new OperatorNode('/', 'divide', [new OperatorNode('-', 'subtract', [new OperatorNode('*', 'multiply', [_derivative(arg0, constNodes), arg1.clone()]), new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, constNodes)])]), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])]);
+      }
+
+      if (node.op === '^' && node.isBinary()) {
+        var _arg = node.args[0];
+        var _arg2 = node.args[1];
+
+        if (constNodes[_arg] !== undefined) {
+          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1
+          if (isConstantNode(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {
+            return createConstantNode(0);
+          } // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)
+
+
+          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), constNodes)])]);
+        }
+
+        if (constNodes[_arg2] !== undefined) {
+          if (isConstantNode(_arg2)) {
+            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0
+            if (isZero(_arg2.value)) {
+              return createConstantNode(0);
+            } // Ignore exponent; f(x)^1 = f(x)
+
+
+            if (equal(_arg2.value, 1)) {
+              return _derivative(_arg, constNodes);
+            }
+          } // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)
+
+
+          var powMinusOne = new OperatorNode('^', 'pow', [_arg.clone(), new OperatorNode('-', 'subtract', [_arg2, createConstantNode(1)])]);
+          return new OperatorNode('*', 'multiply', [_arg2.clone(), new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), powMinusOne])]);
+        } // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]
+
+
+        return new OperatorNode('*', 'multiply', [new OperatorNode('^', 'pow', [_arg.clone(), _arg2.clone()]), new OperatorNode('+', 'add', [new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), new OperatorNode('/', 'divide', [_arg2.clone(), _arg.clone()])]), new OperatorNode('*', 'multiply', [_derivative(_arg2, constNodes), new FunctionNode('log', [_arg.clone()])])])]);
+      }
+
+      throw new Error('Operator "' + node.op + '" is not supported by derivative, or a wrong number of arguments is passed');
+    }
+  });
+  /**
+   * Ensures the number of arguments for a function are correct,
+   * and will throw an error otherwise.
+   *
+   * @param {FunctionNode} node
+   */
+
+
+  function funcArgsCheck(node) {
+    // TODO add min, max etc
+    if ((node.name === 'log' || node.name === 'nthRoot' || node.name === 'pow') && node.args.length === 2) {
+      return;
+    } // There should be an incorrect number of arguments if we reach here
+    // Change all args to constants to avoid unidentified
+    // symbol error when compiling function
+
+
+    for (var i = 0; i < node.args.length; ++i) {
+      node.args[i] = createConstantNode(0);
+    }
+
+    node.compile().evaluate();
+    throw new Error('Expected TypeError, but none found');
+  }
+  /**
+   * Helper function to create a constant node with a specific type
+   * (number, BigNumber, Fraction)
+   * @param {number} value
+   * @param {string} [valueType]
+   * @return {ConstantNode}
+   */
+
+
+  function createConstantNode(value, valueType) {
+    return new ConstantNode(numeric(value, valueType || config.number));
+  }
+
+  return derivative;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/leafCount.js b/node_modules/mathjs/lib/esm/function/algebra/leafCount.js
new file mode 100644
index 0000000..c47d864
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/leafCount.js
@@ -0,0 +1,59 @@
+import { factory } from '../../utils/factory.js';
+var name = 'leafCount';
+var dependencies = ['parse', 'typed'];
+export var createLeafCount = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    parse,
+    typed
+  } = _ref;
+
+  // This does the real work, but we don't have to recurse through
+  // a typed call if we separate it out
+  function countLeaves(node) {
+    var count = 0;
+    node.forEach(n => {
+      count += countLeaves(n);
+    });
+    return count || 1;
+  }
+  /**
+   * Gives the number of "leaf nodes" in the parse tree of the given expression
+   * A leaf node is one that has no subexpressions, essentially either a
+   * symbol or a constant. Note that `5!` has just one leaf, the '5'; the
+   * unary factorial operator does not add a leaf. On the other hand,
+   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.
+   *
+   * The `simplify()` function should generally not increase the `leafCount()`
+   * of an expression, although currently there is no guarantee that it never
+   * does so. In many cases, `simplify()` reduces the leaf count.
+   *
+   * Syntax:
+   *
+   *     leafCount(expr)
+   *
+   * Examples:
+   *
+   *     math.leafCount('x') // 1
+   *     math.leafCount(math.parse('a*d-b*c')) // 4
+   *     math.leafCount('[a,b;c,d][0,1]') // 6
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param {Node|string} expr    The expression to count the leaves of
+   *
+   * @return {number}  The number of leaves of `expr`
+   *
+   */
+
+
+  return typed(name, {
+    string: function string(expr) {
+      return this(parse(expr));
+    },
+    Node: function Node(expr) {
+      return countLeaves(expr);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/rationalize.js b/node_modules/mathjs/lib/esm/function/algebra/rationalize.js
new file mode 100644
index 0000000..97f8c0b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/rationalize.js
@@ -0,0 +1,869 @@
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createSimplifyConstant } from './simplify/simplifyConstant.js';
+var name = 'rationalize';
+var dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplifyCore', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode', 'ParenthesisNode'];
+export var createRationalize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    equal,
+    isZero,
+    add,
+    subtract,
+    multiply,
+    divide,
+    pow,
+    parse,
+    simplifyCore,
+    simplify,
+    fraction,
+    bignumber,
+    mathWithTransform,
+    matrix,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode,
+    ParenthesisNode
+  } = _ref;
+  var simplifyConstant = createSimplifyConstant({
+    typed,
+    config,
+    mathWithTransform,
+    matrix,
+    fraction,
+    bignumber,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode
+  });
+  /**
+   * Transform a rationalizable expression in a rational fraction.
+   * If rational fraction is one variable polynomial then converts
+   * the numerator and denominator in canonical form, with decreasing
+   * exponents, returning the coefficients of numerator.
+   *
+   * Syntax:
+   *
+   *     rationalize(expr)
+   *     rationalize(expr, detailed)
+   *     rationalize(expr, scope)
+   *     rationalize(expr, scope, detailed)
+   *
+   * Examples:
+   *
+   *     math.rationalize('sin(x)+y')
+   *                   //  Error: There is an unsolved function call
+   *     math.rationalize('2x/y - y/(x+1)')
+   *                   // (2*x^2-y^2+2*x)/(x*y+y)
+   *     math.rationalize('(2x+1)^6')
+   *                   // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1
+   *     math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')
+   *                   // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)
+   *     math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =
+   *                   // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/
+   *                   //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)
+   *
+   *     math.rationalize('x+x+x+y',{y:1}) // 3*x+1
+   *     math.rationalize('x+x+x+y',{})    // 3*x+y
+   *
+   *     const ret = math.rationalize('x+x+x+y',{},true)
+   *                   // ret.expression=3*x+y, ret.variables = ["x","y"]
+   *     const ret = math.rationalize('-2+5x^2',{},true)
+   *                   // ret.expression=5*x^2-2, ret.variables = ["x"], ret.coefficients=[-2,0,5]
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param  {Node|string} expr    The expression to check if is a polynomial expression
+   * @param  {Object|boolean}      optional scope of expression or true for already evaluated rational expression at input
+   * @param  {Boolean}  detailed   optional True if return an object, false if return expression node (default)
+   *
+   * @return {Object | Node}    The rational polynomial of `expr` or an object
+   *            `{expression, numerator, denominator, variables, coefficients}`, where
+   *              `expression` is a `Node` with the node simplified expression,
+   *              `numerator` is a `Node` with the simplified numerator of expression,
+   *              `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator),
+   *              `variables` is an array with variable names,
+   *              and `coefficients` is an array with coefficients of numerator sorted by increased exponent
+   *           {Expression Node}  node simplified expression
+   *
+   */
+
+  return typed(name, {
+    string: function string(expr) {
+      return this(parse(expr), {}, false);
+    },
+    'string, boolean': function stringBoolean(expr, detailed) {
+      return this(parse(expr), {}, detailed);
+    },
+    'string, Object': function stringObject(expr, scope) {
+      return this(parse(expr), scope, false);
+    },
+    'string, Object, boolean': function stringObjectBoolean(expr, scope, detailed) {
+      return this(parse(expr), scope, detailed);
+    },
+    Node: function Node(expr) {
+      return this(expr, {}, false);
+    },
+    'Node, boolean': function NodeBoolean(expr, detailed) {
+      return this(expr, {}, detailed);
+    },
+    'Node, Object': function NodeObject(expr, scope) {
+      return this(expr, scope, false);
+    },
+    'Node, Object, boolean': function NodeObjectBoolean(expr, scope, detailed) {
+      var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form
+
+      var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial
+
+      var nVars = polyRet.variables.length;
+      var noExactFractions = {
+        exactFractions: false
+      };
+      var withExactFractions = {
+        exactFractions: true
+      };
+      expr = polyRet.expression;
+
+      if (nVars >= 1) {
+        // If expression in not a constant
+        expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)
+
+        var sBefore; // Previous expression
+
+        var rules;
+        var eDistrDiv = true;
+        var redoInic = false; // Apply the initial rules, including succ div rules:
+
+        expr = simplify(expr, setRules.firstRules, {}, noExactFractions);
+        var s;
+
+        while (true) {
+          // Alternate applying successive division rules and distr.div.rules
+          // until there are no more changes:
+          rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;
+          expr = simplify(expr, rules, {}, withExactFractions);
+          eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules
+
+          s = expr.toString();
+
+          if (s === sBefore) {
+            break; // No changes : end of the loop
+          }
+
+          redoInic = true;
+          sBefore = s;
+        }
+
+        if (redoInic) {
+          // Apply first rules again without succ div rules (if there are changes)
+          expr = simplify(expr, setRules.firstRulesAgain, {}, noExactFractions);
+        } // Apply final rules:
+
+
+        expr = simplify(expr, setRules.finalRules, {}, noExactFractions);
+      } // NVars >= 1
+
+
+      var coefficients = [];
+      var retRationalize = {};
+
+      if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {
+        // Separate numerator from denominator
+        if (nVars === 1) {
+          expr.args[0] = polyToCanonical(expr.args[0], coefficients);
+          expr.args[1] = polyToCanonical(expr.args[1]);
+        }
+
+        if (detailed) {
+          retRationalize.numerator = expr.args[0];
+          retRationalize.denominator = expr.args[1];
+        }
+      } else {
+        if (nVars === 1) {
+          expr = polyToCanonical(expr, coefficients);
+        }
+
+        if (detailed) {
+          retRationalize.numerator = expr;
+          retRationalize.denominator = null;
+        }
+      } // nVars
+
+
+      if (!detailed) return expr;
+      retRationalize.coefficients = coefficients;
+      retRationalize.variables = polyRet.variables;
+      retRationalize.expression = expr;
+      return retRationalize;
+    } // ^^^^^^^ end of rationalize ^^^^^^^^
+
+  }); // end of typed rationalize
+
+  /**
+   *  Function to simplify an expression using an optional scope and
+   *  return it if the expression is a polynomial expression, i.e.
+   *  an expression with one or more variables and the operators
+   *  +, -, *, and ^, where the exponent can only be a positive integer.
+   *
+   * Syntax:
+   *
+   *     polynomial(expr,scope,extended, rules)
+   *
+   * @param  {Node | string} expr     The expression to simplify and check if is polynomial expression
+   * @param  {object} scope           Optional scope for expression simplification
+   * @param  {boolean} extended       Optional. Default is false. When true allows divide operator.
+   * @param  {array}  rules           Optional. Default is no rule.
+   *
+   *
+   * @return {Object}
+   *            {Object} node:   node simplified expression
+   *            {Array}  variables:  variable names
+   */
+
+  function polynomial(expr, scope, extended, rules) {
+    var variables = [];
+    var node = simplify(expr, rules, scope, {
+      exactFractions: false
+    }); // Resolves any variables and functions with all defined parameters
+
+    extended = !!extended;
+    var oper = '+-*' + (extended ? '/' : '');
+    recPoly(node);
+    var retFunc = {};
+    retFunc.expression = node;
+    retFunc.variables = variables;
+    return retFunc; // -------------------------------------------------------------------------------------------------------
+
+    /**
+     *  Function to simplify an expression using an optional scope and
+     *  return it if the expression is a polynomial expression, i.e.
+     *  an expression with one or more variables and the operators
+     *  +, -, *, and ^, where the exponent can only be a positive integer.
+     *
+     * Syntax:
+     *
+     *     recPoly(node)
+     *
+     *
+     * @param  {Node} node               The current sub tree expression in recursion
+     *
+     * @return                           nothing, throw an exception if error
+     */
+
+    function recPoly(node) {
+      var tp = node.type; // node type
+
+      if (tp === 'FunctionNode') {
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        if (node.op === '^') {
+          // TODO: handle negative exponents like in '1/x^(-2)'
+          if (node.args[1].type !== 'ConstantNode' || !isInteger(parseFloat(node.args[1].value))) {
+            throw new Error('There is a non-integer exponent');
+          } else {
+            recPoly(node.args[0]);
+          }
+        } else {
+          if (oper.indexOf(node.op) === -1) {
+            throw new Error('Operator ' + node.op + ' invalid in polynomial expression');
+          }
+
+          for (var i = 0; i < node.args.length; i++) {
+            recPoly(node.args[i]);
+          }
+        } // type of operator
+
+      } else if (tp === 'SymbolNode') {
+        var _name = node.name; // variable name
+
+        var pos = variables.indexOf(_name);
+
+        if (pos === -1) {
+          // new variable in expression
+          variables.push(_name);
+        }
+      } else if (tp === 'ParenthesisNode') {
+        recPoly(node.content);
+      } else if (tp !== 'ConstantNode') {
+        throw new Error('type ' + tp + ' is not allowed in polynomial expression');
+      }
+    } // end of recPoly
+
+  } // end of polynomial
+  // ---------------------------------------------------------------------------------------
+
+  /**
+   * Return a rule set to rationalize an polynomial expression in rationalize
+   *
+   * Syntax:
+   *
+   *     rulesRationalize()
+   *
+   * @return {array}        rule set to rationalize an polynomial expression
+   */
+
+
+  function rulesRationalize() {
+    var oldRules = [simplifyCore, // sCore
+    {
+      l: 'n+n',
+      r: '2*n'
+    }, {
+      l: 'n+-n',
+      r: '0'
+    }, simplifyConstant, // sConstant
+    {
+      l: 'n*(n1^-1)',
+      r: 'n/n1'
+    }, {
+      l: 'n*n1^-n2',
+      r: 'n/n1^n2'
+    }, {
+      l: 'n1^-1',
+      r: '1/n1'
+    }, {
+      l: 'n*(n1/n2)',
+      r: '(n*n1)/n2'
+    }, {
+      l: '1*n',
+      r: 'n'
+    }];
+    var rulesFirst = [{
+      l: '(-n1)/(-n2)',
+      r: 'n1/n2'
+    }, // Unary division
+    {
+      l: '(-n1)*(-n2)',
+      r: 'n1*n2'
+    }, // Unary multiplication
+    {
+      l: 'n1--n2',
+      r: 'n1+n2'
+    }, // '--' elimination
+    {
+      l: 'n1-n2',
+      r: 'n1+(-n2)'
+    }, // Subtraction turn into add with un�ry minus
+    {
+      l: '(n1+n2)*n3',
+      r: '(n1*n3 + n2*n3)'
+    }, // Distributive 1
+    {
+      l: 'n1*(n2+n3)',
+      r: '(n1*n2+n1*n3)'
+    }, // Distributive 2
+    {
+      l: 'c1*n + c2*n',
+      r: '(c1+c2)*n'
+    }, // Joining constants
+    {
+      l: 'c1*n + n',
+      r: '(c1+1)*n'
+    }, // Joining constants
+    {
+      l: 'c1*n - c2*n',
+      r: '(c1-c2)*n'
+    }, // Joining constants
+    {
+      l: 'c1*n - n',
+      r: '(c1-1)*n'
+    }, // Joining constants
+    {
+      l: 'v/c',
+      r: '(1/c)*v'
+    }, // variable/constant (new!)
+    {
+      l: 'v/-c',
+      r: '-(1/c)*v'
+    }, // variable/constant (new!)
+    {
+      l: '-v*-c',
+      r: 'c*v'
+    }, // Inversion constant and variable 1
+    {
+      l: '-v*c',
+      r: '-c*v'
+    }, // Inversion constant and variable 2
+    {
+      l: 'v*-c',
+      r: '-c*v'
+    }, // Inversion constant and variable 3
+    {
+      l: 'v*c',
+      r: 'c*v'
+    }, // Inversion constant and variable 4
+    {
+      l: '-(-n1*n2)',
+      r: '(n1*n2)'
+    }, // Unary propagation
+    {
+      l: '-(n1*n2)',
+      r: '(-n1*n2)'
+    }, // Unary propagation
+    {
+      l: '-(-n1+n2)',
+      r: '(n1-n2)'
+    }, // Unary propagation
+    {
+      l: '-(n1+n2)',
+      r: '(-n1-n2)'
+    }, // Unary propagation
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    }, // Power to Power
+    {
+      l: '-(-n1/n2)',
+      r: '(n1/n2)'
+    }, // Division and Unary
+    {
+      l: '-(n1/n2)',
+      r: '(-n1/n2)'
+    }]; // Divisao and Unary
+
+    var rulesDistrDiv = [{
+      l: '(n1/n2 + n3/n4)',
+      r: '((n1*n4 + n3*n2)/(n2*n4))'
+    }, // Sum of fractions
+    {
+      l: '(n1/n2 + n3)',
+      r: '((n1 + n3*n2)/n2)'
+    }, // Sum fraction with number 1
+    {
+      l: '(n1 + n2/n3)',
+      r: '((n1*n3 + n2)/n3)'
+    }]; // Sum fraction with number 1
+
+    var rulesSucDiv = [{
+      l: '(n1/(n2/n3))',
+      r: '((n1*n3)/n2)'
+    }, // Division simplification
+    {
+      l: '(n1/n2/n3)',
+      r: '(n1/(n2*n3))'
+    }];
+    var setRules = {}; // rules set in 4 steps.
+    // All rules => infinite loop
+    // setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)
+
+    setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv); // First rule set
+
+    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules
+
+    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules
+
+    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.
+    // Division simplification
+    // Second rule set.
+    // There is no aggregate expression with parentesis, but the only variable can be scattered.
+
+    setRules.finalRules = [simplifyCore, // simplify.rules[0]
+    {
+      l: 'n*-n',
+      r: '-n^2'
+    }, // Joining multiply with power 1
+    {
+      l: 'n*n',
+      r: 'n^2'
+    }, // Joining multiply with power 2
+    simplifyConstant, // simplify.rules[14] old 3rd index in oldRules
+    {
+      l: 'n*-n^n1',
+      r: '-n^(n1+1)'
+    }, // Joining multiply with power 3
+    {
+      l: 'n*n^n1',
+      r: 'n^(n1+1)'
+    }, // Joining multiply with power 4
+    {
+      l: 'n^n1*-n^n2',
+      r: '-n^(n1+n2)'
+    }, // Joining multiply with power 5
+    {
+      l: 'n^n1*n^n2',
+      r: 'n^(n1+n2)'
+    }, // Joining multiply with power 6
+    {
+      l: 'n^n1*-n',
+      r: '-n^(n1+1)'
+    }, // Joining multiply with power 7
+    {
+      l: 'n^n1*n',
+      r: 'n^(n1+1)'
+    }, // Joining multiply with power 8
+    {
+      l: 'n^n1/-n',
+      r: '-n^(n1-1)'
+    }, // Joining multiply with power 8
+    {
+      l: 'n^n1/n',
+      r: 'n^(n1-1)'
+    }, // Joining division with power 1
+    {
+      l: 'n/-n^n1',
+      r: '-n^(1-n1)'
+    }, // Joining division with power 2
+    {
+      l: 'n/n^n1',
+      r: 'n^(1-n1)'
+    }, // Joining division with power 3
+    {
+      l: 'n^n1/-n^n2',
+      r: 'n^(n1-n2)'
+    }, // Joining division with power 4
+    {
+      l: 'n^n1/n^n2',
+      r: 'n^(n1-n2)'
+    }, // Joining division with power 5
+    {
+      l: 'n1+(-n2*n3)',
+      r: 'n1-n2*n3'
+    }, // Solving useless parenthesis 1
+    {
+      l: 'v*(-c)',
+      r: '-c*v'
+    }, // Solving useless unary 2
+    {
+      l: 'n1+-n2',
+      r: 'n1-n2'
+    }, // Solving +- together (new!)
+    {
+      l: 'v*c',
+      r: 'c*v'
+    }, // inversion constant with variable
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    } // Power to Power
+    ];
+    return setRules;
+  } // End rulesRationalize
+  // ---------------------------------------------------------------------------------------
+
+  /**
+   *  Expand recursively a tree node for handling with expressions with exponents
+   *  (it's not for constants, symbols or functions with exponents)
+   *  PS: The other parameters are internal for recursion
+   *
+   * Syntax:
+   *
+   *     expandPower(node)
+   *
+   * @param  {Node} node         Current expression node
+   * @param  {node} parent       Parent current node inside the recursion
+   * @param  (int}               Parent number of chid inside the rercursion
+   *
+   * @return {node}        node expression with all powers expanded.
+   */
+
+
+  function expandPower(node, parent, indParent) {
+    var tp = node.type;
+    var internal = arguments.length > 1; // TRUE in internal calls
+
+    if (tp === 'OperatorNode' && node.isBinary()) {
+      var does = false;
+      var val;
+
+      if (node.op === '^') {
+        // First operator: Parenthesis or UnaryMinus
+        if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {
+          // Second operator: Constant
+          val = parseFloat(node.args[1].value);
+          does = val >= 2 && isInteger(val);
+        }
+      }
+
+      if (does) {
+        // Exponent >= 2
+        // Before:
+        //            operator A --> Subtree
+        // parent pow
+        //            constant
+        //
+        if (val > 2) {
+          // Exponent > 2,
+          // AFTER:  (exponent > 2)
+          //             operator A --> Subtree
+          // parent  *
+          //                 deep clone (operator A --> Subtree
+          //             pow
+          //                 constant - 1
+          //
+          var nEsqTopo = node.args[0];
+          var nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);
+          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);
+        } else {
+          // Expo = 2 - no power
+          // AFTER:  (exponent =  2)
+          //             operator A --> Subtree
+          // parent   oper
+          //            deep clone (operator A --> Subtree)
+          //
+          node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()]);
+        }
+
+        if (internal) {
+          // Change parent references in internal recursive calls
+          if (indParent === 'content') {
+            parent.content = node;
+          } else {
+            parent.args[indParent] = node;
+          }
+        }
+      } // does
+
+    } // binary OperatorNode
+
+
+    if (tp === 'ParenthesisNode') {
+      // Recursion
+      expandPower(node.content, node, 'content');
+    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {
+      for (var i = 0; i < node.args.length; i++) {
+        expandPower(node.args[i], node, i);
+      }
+    }
+
+    if (!internal) {
+      // return the root node
+      return node;
+    }
+  } // End expandPower
+  // ---------------------------------------------------------------------------------------
+
+  /**
+   * Auxilary function for rationalize
+   * Convert near canonical polynomial in one variable in a canonical polynomial
+   * with one term for each exponent in decreasing order
+   *
+   * Syntax:
+   *
+   *     polyToCanonical(node [, coefficients])
+   *
+   * @param  {Node | string} expr       The near canonical polynomial expression to convert in a a canonical polynomial expression
+   *
+   *        The string or tree expression needs to be at below syntax, with free spaces:
+   *         (  (^(-)? | [+-]? )cte (*)? var (^expo)?  | cte )+
+   *       Where 'var' is one variable with any valid name
+   *             'cte' are real numeric constants with any value. It can be omitted if equal than 1
+   *             'expo' are integers greater than 0. It can be omitted if equal than 1.
+   *
+   * @param  {array}   coefficients             Optional returns coefficients sorted by increased exponent
+   *
+   *
+   * @return {node}        new node tree with one variable polynomial or string error.
+   */
+
+
+  function polyToCanonical(node, coefficients) {
+    if (coefficients === undefined) {
+      coefficients = [];
+    } // coefficients.
+
+
+    coefficients[0] = 0; // index is the exponent
+
+    var o = {};
+    o.cte = 1;
+    o.oper = '+'; // fire: mark with * or ^ when finds * or ^ down tree, reset to "" with + and -.
+    //       It is used to deduce the exponent: 1 for *, 0 for "".
+
+    o.fire = '';
+    var maxExpo = 0; // maximum exponent
+
+    var varname = ''; // variable name
+
+    recurPol(node, null, o);
+    maxExpo = coefficients.length - 1;
+    var first = true;
+    var no;
+
+    for (var i = maxExpo; i >= 0; i--) {
+      if (coefficients[i] === 0) continue;
+      var n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));
+      var op = coefficients[i] < 0 ? '-' : '+';
+
+      if (i > 0) {
+        // Is not a constant without variable
+        var n2 = new SymbolNode(varname);
+
+        if (i > 1) {
+          var n3 = new ConstantNode(i);
+          n2 = new OperatorNode('^', 'pow', [n2, n3]);
+        }
+
+        if (coefficients[i] === -1 && first) {
+          n1 = new OperatorNode('-', 'unaryMinus', [n2]);
+        } else if (Math.abs(coefficients[i]) === 1) {
+          n1 = n2;
+        } else {
+          n1 = new OperatorNode('*', 'multiply', [n1, n2]);
+        }
+      }
+
+      if (first) {
+        no = n1;
+      } else if (op === '+') {
+        no = new OperatorNode('+', 'add', [no, n1]);
+      } else {
+        no = new OperatorNode('-', 'subtract', [no, n1]);
+      }
+
+      first = false;
+    } // for
+
+
+    if (first) {
+      return new ConstantNode(0);
+    } else {
+      return no;
+    }
+    /**
+     * Recursive auxilary function inside polyToCanonical for
+     * converting expression in canonical form
+     *
+     * Syntax:
+     *
+     *     recurPol(node, noPai, obj)
+     *
+     * @param  {Node} node        The current subpolynomial expression
+     * @param  {Node | Null}  noPai   The current parent node
+     * @param  {object}    obj        Object with many internal flags
+     *
+     * @return {}                    No return. If error, throws an exception
+     */
+
+
+    function recurPol(node, noPai, o) {
+      var tp = node.type;
+
+      if (tp === 'FunctionNode') {
+        // ***** FunctionName *****
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        // ***** OperatorName *****
+        if ('+-*^'.indexOf(node.op) === -1) throw new Error('Operator ' + node.op + ' invalid');
+
+        if (noPai !== null) {
+          // -(unary),^  : children of *,+,-
+          if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          } // -,+,* : children of +,-
+
+
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          } // -,+ : first child
+
+
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+        } // Has parent
+        // Firers: ^,*       Old:   ^,&,-(unary): firers
+
+
+        if (node.op === '^' || node.op === '*') {
+          o.fire = node.op;
+        }
+
+        for (var _i = 0; _i < node.args.length; _i++) {
+          // +,-: reset fire
+          if (node.fn === 'unaryMinus') o.oper = '-';
+
+          if (node.op === '+' || node.fn === 'subtract') {
+            o.fire = '';
+            o.cte = 1; // default if there is no constant
+
+            o.oper = _i === 0 ? '+' : node.op;
+          }
+
+          o.noFil = _i; // number of son
+
+          recurPol(node.args[_i], node, o);
+        } // for in children
+
+      } else if (tp === 'SymbolNode') {
+        // ***** SymbolName *****
+        if (node.name !== varname && varname !== '') {
+          throw new Error('There is more than one variable');
+        }
+
+        varname = node.name;
+
+        if (noPai === null) {
+          coefficients[1] = 1;
+          return;
+        } // ^: Symbol is First child
+
+
+        if (noPai.op === '^' && o.noFil !== 0) {
+          throw new Error('In power the variable should be the first parameter');
+        } // *: Symbol is Second child
+
+
+        if (noPai.op === '*' && o.noFil !== 1) {
+          throw new Error('In multiply the variable should be the second parameter');
+        } // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)
+
+
+        if (o.fire === '' || o.fire === '*') {
+          if (maxExpo < 1) coefficients[1] = 0;
+          coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(1, maxExpo);
+        }
+      } else if (tp === 'ConstantNode') {
+        var valor = parseFloat(node.value);
+
+        if (noPai === null) {
+          coefficients[0] = valor;
+          return;
+        }
+
+        if (noPai.op === '^') {
+          // cte: second  child of power
+          if (o.noFil !== 1) throw new Error('Constant cannot be powered');
+
+          if (!isInteger(valor) || valor <= 0) {
+            throw new Error('Non-integer exponent is not allowed');
+          }
+
+          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) {
+            coefficients[_i2] = 0;
+          }
+
+          if (valor > maxExpo) coefficients[valor] = 0;
+          coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(valor, maxExpo);
+          return;
+        }
+
+        o.cte = valor; // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.
+
+        if (o.fire === '') {
+          coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);
+        }
+      } else {
+        throw new Error('Type ' + tp + ' is not allowed');
+      }
+    } // End of recurPol
+
+  } // End of polyToCanonical
+
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/resolve.js b/node_modules/mathjs/lib/esm/function/algebra/resolve.js
new file mode 100644
index 0000000..3424619
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/resolve.js
@@ -0,0 +1,95 @@
+import { createMap, isMap } from '../../utils/map.js';
+import { isFunctionNode, isNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'resolve';
+var dependencies = ['parse', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];
+export var createResolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    parse,
+    ConstantNode,
+    FunctionNode,
+    OperatorNode,
+    ParenthesisNode
+  } = _ref;
+
+  /**
+   * resolve(expr, scope) replaces variable nodes with their scoped values
+   *
+   * Syntax:
+   *
+   *     resolve(expr, scope)
+   *
+   * Examples:
+   *
+   *     math.resolve('x + y', {x:1, y:2})           // Node {1 + 2}
+   *     math.resolve(math.parse('x+y'), {x:1, y:2}) // Node {1 + 2}
+   *     math.simplify('x+y', {x:2, y:'x+x'}).toString()      // "6"
+   *
+   * See also:
+   *
+   *     simplify, evaluate
+   *
+   * @param {Node} node
+   *     The expression tree to be simplified
+   * @param {Object} scope
+   *     Scope specifying variables to be resolved
+   * @return {Node} Returns `node` with variables recursively substituted.
+   * @throws {ReferenceError}
+   *     If there is a cyclic dependency among the variables in `scope`,
+   *     resolution is impossible and a ReferenceError is thrown.
+   */
+  function resolve(node, scope) {
+    var within = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : new Set();
+
+    // note `within`:
+    // `within` is not documented, since it is for internal cycle
+    // detection only
+    if (!scope) {
+      return node;
+    }
+
+    if (!isMap(scope)) {
+      scope = createMap(scope);
+    }
+
+    if (isSymbolNode(node)) {
+      if (within.has(node.name)) {
+        var variables = Array.from(within).join(', ');
+        throw new ReferenceError("recursive loop of variable definitions among {".concat(variables, "}"));
+      }
+
+      var value = scope.get(node.name);
+
+      if (isNode(value)) {
+        var nextWithin = new Set(within);
+        nextWithin.add(node.name);
+        return resolve(value, scope, nextWithin);
+      } else if (typeof value === 'number') {
+        return parse(String(value));
+      } else if (value !== undefined) {
+        return new ConstantNode(value);
+      } else {
+        return node;
+      }
+    } else if (isOperatorNode(node)) {
+      var args = node.args.map(function (arg) {
+        return resolve(arg, scope, within);
+      });
+      return new OperatorNode(node.op, node.fn, args, node.implicit);
+    } else if (isParenthesisNode(node)) {
+      return new ParenthesisNode(resolve(node.content, scope, within));
+    } else if (isFunctionNode(node)) {
+      var _args = node.args.map(function (arg) {
+        return resolve(arg, scope, within);
+      });
+
+      return new FunctionNode(node.name, _args);
+    } // Otherwise just recursively resolve any children (might also work
+    // for some of the above special cases)
+
+
+    return node.map(child => resolve(child, scope, within));
+  }
+
+  return resolve;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplify.js b/node_modules/mathjs/lib/esm/function/algebra/simplify.js
new file mode 100644
index 0000000..929e16d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplify.js
@@ -0,0 +1,1245 @@
+import { isConstantNode, isParenthesisNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { createUtil } from './simplify/util.js';
+import { createSimplifyConstant } from './simplify/simplifyConstant.js';
+import { hasOwnProperty } from '../../utils/object.js';
+import { createEmptyMap, createMap } from '../../utils/map.js';
+var name = 'simplify';
+var dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', 'resolve', 'simplifyCore', '?fraction', '?bignumber', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+export var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    parse,
+    add,
+    subtract,
+    multiply,
+    divide,
+    pow,
+    isZero,
+    equal,
+    resolve,
+    simplifyCore,
+    fraction,
+    bignumber,
+    mathWithTransform,
+    matrix,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode
+  } = _ref;
+  var simplifyConstant = createSimplifyConstant({
+    typed,
+    config,
+    mathWithTransform,
+    matrix,
+    fraction,
+    bignumber,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode
+  });
+  var {
+    hasProperty,
+    isCommutative,
+    isAssociative,
+    mergeContext,
+    flatten,
+    unflattenr,
+    unflattenl,
+    createMakeNodeFunction,
+    defaultContext,
+    realContext,
+    positiveContext
+  } = createUtil({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+  /**
+   * Simplify an expression tree.
+   *
+   * A list of rules are applied to an expression, repeating over the list until
+   * no further changes are made.
+   * It's possible to pass a custom set of rules to the function as second
+   * argument. A rule can be specified as an object, string, or function:
+   *
+   *     const rules = [
+   *       { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },
+   *       'n1*n3 + n2*n3 -> (n1+n2)*n3',
+   *       function (node) {
+   *         // ... return a new node or return the node unchanged
+   *         return node
+   *       }
+   *     ]
+   *
+   * String and object rules consist of a left and right pattern. The left is
+   * used to match against the expression and the right determines what matches
+   * are replaced with. The main difference between a pattern and a normal
+   * expression is that variables starting with the following characters are
+   * interpreted as wildcards:
+   *
+   * - 'n' - matches any Node
+   * - 'c' - matches any ConstantNode
+   * - 'v' - matches any Node that is not a ConstantNode
+   *
+   * The default list of rules is exposed on the function as `simplify.rules`
+   * and can be used as a basis to built a set of custom rules.
+   *
+   * To specify a rule as a string, separate the left and right pattern by '->'
+   * When specifying a rule as an object, the following keys are meaningful:
+   * - l - the left pattern
+   * - r - the right pattern
+   * - s - in lieu of l and r, the string form that is broken at -> to give them
+   * - repeat - whether to repeat this rule until the expression stabilizes
+   * - assuming - gives a context object, as in the 'context' option to
+   *     simplify. Every property in the context object must match the current
+   *     context in order, or else the rule will not be applied.
+   * - imposeContext - gives a context object, as in the 'context' option to
+   *     simplify. Any settings specified will override the incoming context
+   *     for all matches of this rule.
+   *
+   * For more details on the theory, see:
+   *
+   * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
+   * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
+   *
+   *  An optional `options` argument can be passed as last argument of `simplify`.
+   *  Currently available options (defaults in parentheses):
+   *  - `consoleDebug` (false): whether to write the expression being simplified
+   *    and any changes to it, along with the rule responsible, to console
+   *  - `context` (simplify.defaultContext): an object giving properties of
+   *    each operator, which determine what simplifications are allowed. The
+   *    currently meaningful properties are commutative, associative,
+   *    total (whether the operation is defined for all arguments), and
+   *    trivial (whether the operation applied to a single argument leaves
+   *    that argument unchanged). The default context is very permissive and
+   *    allows almost all simplifications. Only properties differing from
+   *    the default need to be specified; the default context is used as a
+   *    fallback. Additional contexts `simplify.realContext` and
+   *    `simplify.positiveContext` are supplied to cause simplify to perform
+   *    just simplifications guaranteed to preserve all values of the expression
+   *    assuming all variables and subexpressions are real numbers or
+   *    positive real numbers, respectively. (Note that these are in some cases
+   *    more restrictive than the default context; for example, the default
+   *    context will allow `x/x` to simplify to 1, whereas
+   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)
+   *  - `exactFractions` (true): whether to try to convert all constants to
+   *    exact rational numbers.
+   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+   *    be expressed as fractions only when both numerator and denominator
+   *    are smaller than `fractionsLimit`.
+   *
+   * Syntax:
+   *
+   *     simplify(expr)
+   *     simplify(expr, rules)
+   *     simplify(expr, rules)
+   *     simplify(expr, rules, scope)
+   *     simplify(expr, rules, scope, options)
+   *     simplify(expr, scope)
+   *     simplify(expr, scope, options)
+   *
+   * Examples:
+   *
+   *     math.simplify('2 * 1 * x ^ (2 - 1)')      // Node "2 * x"
+   *     math.simplify('2 * 3 * x', {x: 4})        // Node "24"
+   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')
+   *     math.simplify(f)                          // Node "2 * x"
+   *     math.simplify('0.4 * x', {}, {exactFractions: true})  // Node "x * 2 / 5"
+   *     math.simplify('0.4 * x', {}, {exactFractions: false}) // Node "0.4 * x"
+   *
+   * See also:
+   *
+   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve
+   *
+   * @param {Node | string} expr
+   *            The expression to be simplified
+   * @param {Array<{l:string, r: string} | string | function>} [rules]
+   *            Optional list with custom rules
+   * @return {Node} Returns the simplified form of `expr`
+   */
+
+  var simplify = typed('simplify', {
+    string: function string(expr) {
+      return this(parse(expr), this.rules, createEmptyMap(), {});
+    },
+    'string, Map | Object': function stringMapObject(expr, scope) {
+      return this(parse(expr), this.rules, scope, {});
+    },
+    'string, Map | Object, Object': function stringMapObjectObject(expr, scope, options) {
+      return this(parse(expr), this.rules, scope, options);
+    },
+    'string, Array': function stringArray(expr, rules) {
+      return this(parse(expr), rules, createEmptyMap(), {});
+    },
+    'string, Array, Map | Object': function stringArrayMapObject(expr, rules, scope) {
+      return this(parse(expr), rules, scope, {});
+    },
+    'string, Array, Map | Object, Object': function stringArrayMapObjectObject(expr, rules, scope, options) {
+      return this(parse(expr), rules, scope, options);
+    },
+    'Node, Map | Object': function NodeMapObject(expr, scope) {
+      return this(expr, this.rules, scope, {});
+    },
+    'Node, Map | Object, Object': function NodeMapObjectObject(expr, scope, options) {
+      return this(expr, this.rules, scope, options);
+    },
+    Node: function Node(expr) {
+      return this(expr, this.rules, createEmptyMap(), {});
+    },
+    'Node, Array': function NodeArray(expr, rules) {
+      return this(expr, rules, createEmptyMap(), {});
+    },
+    'Node, Array, Map | Object': function NodeArrayMapObject(expr, rules, scope) {
+      return this(expr, rules, scope, {});
+    },
+    'Node, Array, Object, Object': function NodeArrayObjectObject(expr, rules, scope, options) {
+      return this(expr, rules, createMap(scope), options);
+    },
+    'Node, Array, Map, Object': function NodeArrayMapObject(expr, rules, scope, options) {
+      var debug = options.consoleDebug;
+      rules = _buildRules(rules, options.context);
+      var res = resolve(expr, scope);
+      res = removeParens(res);
+      var visited = {};
+      var str = res.toString({
+        parenthesis: 'all'
+      });
+
+      while (!visited[str]) {
+        visited[str] = true;
+        _lastsym = 0; // counter for placeholder symbols
+
+        var laststr = str;
+        if (debug) console.log('Working on: ', str);
+
+        for (var i = 0; i < rules.length; i++) {
+          var rulestr = '';
+
+          if (typeof rules[i] === 'function') {
+            res = rules[i](res, options);
+            if (debug) rulestr = rules[i].name;
+          } else {
+            flatten(res, options.context);
+            res = applyRule(res, rules[i], options.context);
+
+            if (debug) {
+              rulestr = "".concat(rules[i].l.toString(), " -> ").concat(rules[i].r.toString());
+            }
+          }
+
+          if (debug) {
+            var newstr = res.toString({
+              parenthesis: 'all'
+            });
+
+            if (newstr !== laststr) {
+              console.log('Applying', rulestr, 'produced', newstr);
+              laststr = newstr;
+            }
+          }
+          /* Use left-heavy binary tree internally,
+           * since custom rule functions may expect it
+           */
+
+
+          unflattenl(res, options.context);
+        }
+
+        str = res.toString({
+          parenthesis: 'all'
+        });
+      }
+
+      return res;
+    }
+  });
+  simplify.defaultContext = defaultContext;
+  simplify.realContext = realContext;
+  simplify.positiveContext = positiveContext;
+
+  function removeParens(node) {
+    return node.transform(function (node, path, parent) {
+      return isParenthesisNode(node) ? removeParens(node.content) : node;
+    });
+  } // All constants that are allowed in rules
+
+
+  var SUPPORTED_CONSTANTS = {
+    true: true,
+    false: true,
+    e: true,
+    i: true,
+    Infinity: true,
+    LN2: true,
+    LN10: true,
+    LOG2E: true,
+    LOG10E: true,
+    NaN: true,
+    phi: true,
+    pi: true,
+    SQRT1_2: true,
+    SQRT2: true,
+    tau: true // null: false,
+    // undefined: false,
+    // version: false,
+
+  }; // Array of strings, used to build the ruleSet.
+  // Each l (left side) and r (right side) are parsed by
+  // the expression parser into a node tree.
+  // Left hand sides are matched to subtrees within the
+  // expression to be parsed and replaced with the right
+  // hand side.
+  // TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])
+  // To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.
+  // It is possible to get into an infinite loop with conflicting rules
+
+  simplify.rules = [simplifyCore, // { l: 'n+0', r: 'n' },     // simplifyCore
+  // { l: 'n^0', r: '1' },     // simplifyCore
+  // { l: '0*n', r: '0' },     // simplifyCore
+  // { l: 'n/n', r: '1'},      // simplifyCore
+  // { l: 'n^1', r: 'n' },     // simplifyCore
+  // { l: '+n1', r:'n1' },     // simplifyCore
+  // { l: 'n--n1', r:'n+n1' }, // simplifyCore
+  {
+    l: 'log(e)',
+    r: '1'
+  }, // temporary rules
+  // Note initially we tend constants to the right because like-term
+  // collection prefers the left, and we would rather collect nonconstants
+  {
+    s: 'n-n1 -> n+-n1',
+    // temporarily replace 'subtract' so we can further flatten the 'add' operator
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n-n -> 0',
+    // partial alternative when we can't always subtract
+    assuming: {
+      subtract: {
+        total: false
+      }
+    }
+  }, {
+    s: '-(c*v) -> v * (-c)',
+    // make non-constant terms positive
+    assuming: {
+      multiply: {
+        commutative: true
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(c*v) -> (-c) * v',
+    // non-commutative version, part 1
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(v*c) -> v * (-c)',
+    // non-commutative version, part 2
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    l: '-(n1/n2)',
+    r: '-n1/n2'
+  }, {
+    l: '-v',
+    r: 'v * (-1)'
+  }, // finish making non-constant terms positive
+  {
+    l: '(n1 + n2)*(-1)',
+    r: 'n1*(-1) + n2*(-1)',
+    repeat: true
+  }, // expand negations to achieve as much sign cancellation as possible
+  {
+    l: 'n/n1^n2',
+    r: 'n*n1^-n2'
+  }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator
+  {
+    l: 'n/n1',
+    r: 'n*n1^-1'
+  }, {
+    s: '(n1*n2)^n3 -> n1^n3 * n2^n3',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, // expand nested exponentiation
+  {
+    s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // 1/(1/n) = n needs 1/n to exist
+
+  }, // collect like factors; into a sum, only do this for nonconstants
+  {
+    l: ' v   * ( v   * n1 + n2)',
+    r: 'v^2       * n1 +  v   * n2'
+  }, {
+    s: ' v   * (v^n4 * n1 + n2)   ->  v^(1+n4)  * n1 +  v   * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // v*1/v = v^(1+-1) needs 1/v
+
+  }, {
+    s: 'v^n3 * ( v   * n1 + n2)   ->  v^(n3+1)  * n1 + v^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    s: 'v^n3 * (v^n4 * n1 + n2)   ->  v^(n3+n4) * n1 + v^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    l: 'n*n',
+    r: 'n^2'
+  }, {
+    s: 'n * n^n1 -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // n*1/n = n^(-1+1) needs 1/n
+
+  }, {
+    s: 'n^n1 * n^n2 -> n^(n1+n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // ditto for n^2*1/n^2
+
+  }, // Unfortunately, to deal with more complicated cancellations, it
+  // becomes necessary to simplify constants twice per pass. It's not
+  // terribly expensive compared to matching rules, so this should not
+  // pose a performance problem.
+  simplifyConstant, // First: before collecting like terms
+  // collect like terms
+  {
+    s: 'n+n -> 2*n',
+    assuming: {
+      add: {
+        total: true
+      }
+    } // 2 = 1 + 1 needs to exist
+
+  }, {
+    l: 'n+-n',
+    r: '0'
+  }, {
+    l: 'v*n + v',
+    r: 'v*(n+1)'
+  }, // NOTE: leftmost position is special:
+  {
+    l: 'n3*n1 + n3*n2',
+    r: 'n3*(n1+n2)'
+  }, // All sub-monomials tried there.
+  {
+    l: 'n3^(-n4)*n1 +   n3  * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)'
+  }, {
+    l: 'n3^(-n4)*n1 + n3^n5 * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)'
+  }, {
+    s: 'n*v + v -> (n+1)*v',
+    // noncommutative additional cases
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    l: 'n*c + c',
+    r: '(n+1)*c'
+  }, {
+    s: 'c*n + c -> c*(n+1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, simplifyConstant, // Second: before returning expressions to "standard form"
+  // make factors positive (and undo 'make non-constant terms positive')
+  {
+    s: '(-n)*n1 -> -(n*n1)',
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n1*(-n) -> -(n1*n)',
+    // in case * non-commutative
+    assuming: {
+      subtract: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
+  }, // final ordering of constants
+  {
+    s: 'c+v -> v+c',
+    assuming: {
+      add: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      add: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'v*c -> c*v',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, // undo temporary rules
+  // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant
+  {
+    l: 'n+-n1',
+    r: 'n-n1'
+  }, // undo replace 'subtract'
+  {
+    s: 'n*(n1^-1) -> n/n1',
+    // undo replace 'divide'; for * commutative
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
+  }, {
+    s: 'n*n1^-n2 -> n/n1^n2',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
+  }, {
+    s: 'n^-1 -> 1/n',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
+  }, {
+    l: 'n^1',
+    r: 'n'
+  }, // can be produced by power cancellation
+  {
+    s: 'n*(n1/n2) -> (n*n1)/n2',
+    // '*' before '/'
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    s: 'n-(n1+n2) -> n-n1-n2',
+    // '-' before '+'
+    assuming: {
+      addition: {
+        associative: true,
+        commutative: true
+      }
+    }
+  }, // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },
+  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },
+  // simplifyConstant can leave an extra factor of 1, which can always
+  // be eliminated, since the identity always commutes
+  {
+    l: '1*n',
+    r: 'n',
+    imposeContext: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: 'n1/(n2/n3) -> (n1*n3)/n2',
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    l: 'n1/(-n2)',
+    r: '-n1/n2'
+  }];
+  /**
+   * Takes any rule object as allowed by the specification in simplify
+   * and puts it in a standard form used by applyRule
+   */
+
+  function _canonicalizeRule(ruleObject, context) {
+    var newRule = {};
+
+    if (ruleObject.s) {
+      var lr = ruleObject.s.split('->');
+
+      if (lr.length === 2) {
+        newRule.l = lr[0];
+        newRule.r = lr[1];
+      } else {
+        throw SyntaxError('Could not parse rule: ' + ruleObject.s);
+      }
+    } else {
+      newRule.l = ruleObject.l;
+      newRule.r = ruleObject.r;
+    }
+
+    newRule.l = removeParens(parse(newRule.l));
+    newRule.r = removeParens(parse(newRule.r));
+
+    for (var prop of ['imposeContext', 'repeat', 'assuming']) {
+      if (prop in ruleObject) {
+        newRule[prop] = ruleObject[prop];
+      }
+    }
+
+    if (ruleObject.evaluate) {
+      newRule.evaluate = parse(ruleObject.evaluate);
+    }
+
+    if (isAssociative(newRule.l, context)) {
+      var makeNode = createMakeNodeFunction(newRule.l);
+
+      var expandsym = _getExpandPlaceholderSymbol();
+
+      newRule.expanded = {};
+      newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.
+      // This helps to match the newRule against nodes returned from getSplits() later on.
+
+      flatten(newRule.expanded.l, context);
+      unflattenr(newRule.expanded.l, context);
+      newRule.expanded.r = makeNode([newRule.r, expandsym]);
+    }
+
+    return newRule;
+  }
+  /**
+   * Parse the string array of rules into nodes
+   *
+   * Example syntax for rules:
+   *
+   * Position constants to the left in a product:
+   * { l: 'n1 * c1', r: 'c1 * n1' }
+   * n1 is any Node, and c1 is a ConstantNode.
+   *
+   * Apply difference of squares formula:
+   * { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }
+   * n1, n2 mean any Node.
+   *
+   * Short hand notation:
+   * 'n1 * c1 -> c1 * n1'
+   */
+
+
+  function _buildRules(rules, context) {
+    // Array of rules to be used to simplify expressions
+    var ruleSet = [];
+
+    for (var i = 0; i < rules.length; i++) {
+      var rule = rules[i];
+      var newRule = void 0;
+      var ruleType = typeof rule;
+
+      switch (ruleType) {
+        case 'string':
+          rule = {
+            s: rule
+          };
+
+        /* falls through */
+
+        case 'object':
+          newRule = _canonicalizeRule(rule, context);
+          break;
+
+        case 'function':
+          newRule = rule;
+          break;
+
+        default:
+          throw TypeError('Unsupported type of rule: ' + ruleType);
+      } // console.log('Adding rule: ' + rules[i])
+      // console.log(newRule)
+
+
+      ruleSet.push(newRule);
+    }
+
+    return ruleSet;
+  }
+
+  var _lastsym = 0;
+
+  function _getExpandPlaceholderSymbol() {
+    return new SymbolNode('_p' + _lastsym++);
+  }
+
+  function mapRule(nodes, rule, context) {
+    var resNodes = nodes;
+
+    if (nodes) {
+      for (var i = 0; i < nodes.length; ++i) {
+        var newNode = applyRule(nodes[i], rule, context);
+
+        if (newNode !== nodes[i]) {
+          if (resNodes === nodes) {
+            resNodes = nodes.slice();
+          }
+
+          resNodes[i] = newNode;
+        }
+      }
+    }
+
+    return resNodes;
+  }
+  /**
+   * Returns a simplfied form of node, or the original node if no simplification was possible.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {Object | Function} rule
+   * @param  {Object} context -- information about assumed properties of operators
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.
+   */
+
+
+  function applyRule(node, rule, context) {
+    //    console.log('Entering applyRule("', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '",', node.toString({parenthesis:'all'}),')')
+    // check that the assumptions for this rule are satisfied by the current
+    // context:
+    if (rule.assuming) {
+      for (var symbol in rule.assuming) {
+        for (var property in rule.assuming[symbol]) {
+          if (hasProperty(symbol, property, context) !== rule.assuming[symbol][property]) {
+            return node;
+          }
+        }
+      }
+    }
+
+    var mergedContext = mergeContext(rule.imposeContext, context); // Do not clone node unless we find a match
+
+    var res = node; // First replace our child nodes with their simplified versions
+    // If a child could not be simplified, applying the rule to it
+    // will have no effect since the node is returned unchanged
+
+    if (res instanceof OperatorNode || res instanceof FunctionNode) {
+      var newArgs = mapRule(res.args, rule, context);
+
+      if (newArgs !== res.args) {
+        res = res.clone();
+        res.args = newArgs;
+      }
+    } else if (res instanceof ParenthesisNode) {
+      if (res.content) {
+        var newContent = applyRule(res.content, rule, context);
+
+        if (newContent !== res.content) {
+          res = new ParenthesisNode(newContent);
+        }
+      }
+    } else if (res instanceof ArrayNode) {
+      var newItems = mapRule(res.items, rule, context);
+
+      if (newItems !== res.items) {
+        res = new ArrayNode(newItems);
+      }
+    } else if (res instanceof AccessorNode) {
+      var newObj = res.object;
+
+      if (res.object) {
+        newObj = applyRule(res.object, rule, context);
+      }
+
+      var newIndex = res.index;
+
+      if (res.index) {
+        newIndex = applyRule(res.index, rule, context);
+      }
+
+      if (newObj !== res.object || newIndex !== res.index) {
+        res = new AccessorNode(newObj, newIndex);
+      }
+    } else if (res instanceof IndexNode) {
+      var newDims = mapRule(res.dimensions, rule, context);
+
+      if (newDims !== res.dimensions) {
+        res = new IndexNode(newDims);
+      }
+    } else if (res instanceof ObjectNode) {
+      var changed = false;
+      var newProps = {};
+
+      for (var prop in res.properties) {
+        newProps[prop] = applyRule(res.properties[prop], rule, context);
+
+        if (newProps[prop] !== res.properties[prop]) {
+          changed = true;
+        }
+      }
+
+      if (changed) {
+        res = new ObjectNode(newProps);
+      }
+    } // Try to match a rule against this node
+
+
+    var repl = rule.r;
+
+    var matches = _ruleMatch(rule.l, res, mergedContext)[0]; // If the rule is associative operator, we can try matching it while allowing additional terms.
+    // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.
+
+
+    if (!matches && rule.expanded) {
+      repl = rule.expanded.r;
+      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0];
+    }
+
+    if (matches) {
+      // const before = res.toString({parenthesis: 'all'})
+      // Create a new node by cloning the rhs of the matched rule
+      // we keep any implicit multiplication state if relevant
+      var implicit = res.implicit;
+      res = repl.clone();
+
+      if (implicit && 'implicit' in repl) {
+        res.implicit = true;
+      } // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes
+
+
+      res = res.transform(function (node) {
+        if (node.isSymbolNode && hasOwnProperty(matches.placeholders, node.name)) {
+          return matches.placeholders[node.name].clone();
+        } else {
+          return node;
+        }
+      }); // const after = res.toString({parenthesis: 'all'})
+      // console.log('Simplified ' + before + ' to ' + after)
+    }
+
+    if (rule.repeat && res !== node) {
+      res = applyRule(res, rule, context);
+    }
+
+    return res;
+  }
+  /**
+   * Get (binary) combinations of a flattened binary node
+   * e.g. +(node1, node2, node3) -> [
+   *        +(node1,  +(node2, node3)),
+   *        +(node2,  +(node1, node3)),
+   *        +(node3,  +(node1, node2))]
+   *
+   */
+
+
+  function getSplits(node, context) {
+    var res = [];
+    var right, rightArgs;
+    var makeNode = createMakeNodeFunction(node);
+
+    if (isCommutative(node, context)) {
+      for (var i = 0; i < node.args.length; i++) {
+        rightArgs = node.args.slice(0);
+        rightArgs.splice(i, 1);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([node.args[i], right]));
+      }
+    } else {
+      // Keep order, but try all parenthesizations
+      for (var _i = 1; _i < node.args.length; _i++) {
+        var left = node.args[0];
+
+        if (_i > 1) {
+          left = makeNode(node.args.slice(0, _i));
+        }
+
+        rightArgs = node.args.slice(_i);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([left, right]));
+      }
+    }
+
+    return res;
+  }
+  /**
+   * Returns the set union of two match-placeholders or null if there is a conflict.
+   */
+
+
+  function mergeMatch(match1, match2) {
+    var res = {
+      placeholders: {}
+    }; // Some matches may not have placeholders; this is OK
+
+    if (!match1.placeholders && !match2.placeholders) {
+      return res;
+    } else if (!match1.placeholders) {
+      return match2;
+    } else if (!match2.placeholders) {
+      return match1;
+    } // Placeholders with the same key must match exactly
+
+
+    for (var key in match1.placeholders) {
+      if (hasOwnProperty(match1.placeholders, key)) {
+        res.placeholders[key] = match1.placeholders[key];
+
+        if (hasOwnProperty(match2.placeholders, key)) {
+          if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {
+            return null;
+          }
+        }
+      }
+    }
+
+    for (var _key in match2.placeholders) {
+      if (hasOwnProperty(match2.placeholders, _key)) {
+        res.placeholders[_key] = match2.placeholders[_key];
+      }
+    }
+
+    return res;
+  }
+  /**
+   * Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   */
+
+
+  function combineChildMatches(list1, list2) {
+    var res = [];
+
+    if (list1.length === 0 || list2.length === 0) {
+      return res;
+    }
+
+    var merged;
+
+    for (var i1 = 0; i1 < list1.length; i1++) {
+      for (var i2 = 0; i2 < list2.length; i2++) {
+        merged = mergeMatch(list1[i1], list2[i2]);
+
+        if (merged) {
+          res.push(merged);
+        }
+      }
+    }
+
+    return res;
+  }
+  /**
+   * Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   * Returns a list of unique matches.
+   */
+
+
+  function mergeChildMatches(childMatches) {
+    if (childMatches.length === 0) {
+      return childMatches;
+    }
+
+    var sets = childMatches.reduce(combineChildMatches);
+    var uniqueSets = [];
+    var unique = {};
+
+    for (var i = 0; i < sets.length; i++) {
+      var s = JSON.stringify(sets[i]);
+
+      if (!unique[s]) {
+        unique[s] = true;
+        uniqueSets.push(sets[i]);
+      }
+    }
+
+    return uniqueSets;
+  }
+  /**
+   * Determines whether node matches rule.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param {Object} context -- provides assumed properties of operators
+   * @param {Boolean} isSplit -- whether we are in process of splitting an
+   *                    n-ary operator node into possible binary combinations.
+   *                    Defaults to false.
+   * @return {Object} Information about the match, if it exists.
+   */
+
+
+  function _ruleMatch(rule, node, context, isSplit) {
+    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')
+    //    console.log('rule = ' + rule)
+    //    console.log('node = ' + node)
+    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')
+    var res = [{
+      placeholders: {}
+    }];
+
+    if (rule instanceof OperatorNode && node instanceof OperatorNode || rule instanceof FunctionNode && node instanceof FunctionNode) {
+      // If the rule is an OperatorNode or a FunctionNode, then node must match exactly
+      if (rule instanceof OperatorNode) {
+        if (rule.op !== node.op || rule.fn !== node.fn) {
+          return [];
+        }
+      } else if (rule instanceof FunctionNode) {
+        if (rule.name !== node.name) {
+          return [];
+        }
+      } // rule and node match. Search the children of rule and node.
+
+
+      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node, context) && node.args.length === rule.args.length || isSplit) {
+        // Expect non-associative operators to match exactly,
+        // except in any order if operator is commutative
+        var childMatches = [];
+
+        for (var i = 0; i < rule.args.length; i++) {
+          var childMatch = _ruleMatch(rule.args[i], node.args[i], context);
+
+          if (childMatch.length === 0) {
+            // Child did not match, so stop searching immediately
+            break;
+          } // The child matched, so add the information returned from the child to our result
+
+
+          childMatches.push(childMatch);
+        }
+
+        if (childMatches.length !== rule.args.length) {
+          if (!isCommutative(node, context) || // exact match in order needed
+          rule.args.length === 1) {
+            // nothing to commute
+            return [];
+          }
+
+          if (rule.args.length > 2) {
+            /* Need to generate all permutations and try them.
+             * It's a bit complicated, and unlikely to come up since there
+             * are very few ternary or higher operators. So punt for now.
+             */
+            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented');
+          }
+          /* Exactly two arguments, try them reversed */
+
+
+          var leftMatch = _ruleMatch(rule.args[0], node.args[1], context);
+
+          if (leftMatch.length === 0) {
+            return [];
+          }
+
+          var rightMatch = _ruleMatch(rule.args[1], node.args[0], context);
+
+          if (rightMatch.length === 0) {
+            return [];
+          }
+
+          childMatches = [leftMatch, rightMatch];
+        }
+
+        res = mergeChildMatches(childMatches);
+      } else if (node.args.length >= 2 && rule.args.length === 2) {
+        // node is flattened, rule is not
+        // Associative operators/functions can be split in different ways so we check if the rule matches each
+        // them and return their union.
+        var splits = getSplits(node, context);
+        var splitMatches = [];
+
+        for (var _i2 = 0; _i2 < splits.length; _i2++) {
+          var matchSet = _ruleMatch(rule, splits[_i2], context, true); // recursing at the same tree depth here
+
+
+          splitMatches = splitMatches.concat(matchSet);
+        }
+
+        return splitMatches;
+      } else if (rule.args.length > 2) {
+        throw Error('Unexpected non-binary associative function: ' + rule.toString());
+      } else {
+        // Incorrect number of arguments in rule and node, so no match
+        return [];
+      }
+    } else if (rule instanceof SymbolNode) {
+      // If the rule is a SymbolNode, then it carries a special meaning
+      // according to the first character of the symbol node name.
+      // c.* matches a ConstantNode
+      // n.* matches any node
+      if (rule.name.length === 0) {
+        throw new Error('Symbol in rule has 0 length...!?');
+      }
+
+      if (SUPPORTED_CONSTANTS[rule.name]) {
+        // built-in constant must match exactly
+        if (rule.name !== node.name) {
+          return [];
+        }
+      } else if (rule.name[0] === 'n' || rule.name.substring(0, 2) === '_p') {
+        // rule matches _anything_, so assign this node to the rule.name placeholder
+        // Assign node to the rule.name placeholder.
+        // Our parent will check for matches among placeholders.
+        res[0].placeholders[rule.name] = node;
+      } else if (rule.name[0] === 'v') {
+        // rule matches any variable thing (not a ConstantNode)
+        if (!isConstantNode(node)) {
+          res[0].placeholders[rule.name] = node;
+        } else {
+          // Mis-match: rule was expecting something other than a ConstantNode
+          return [];
+        }
+      } else if (rule.name[0] === 'c') {
+        // rule matches any ConstantNode
+        if (node instanceof ConstantNode) {
+          res[0].placeholders[rule.name] = node;
+        } else {
+          // Mis-match: rule was expecting a ConstantNode
+          return [];
+        }
+      } else {
+        throw new Error('Invalid symbol in rule: ' + rule.name);
+      }
+    } else if (rule instanceof ConstantNode) {
+      // Literal constant must match exactly
+      if (!equal(rule.value, node.value)) {
+        return [];
+      }
+    } else {
+      // Some other node was encountered which we aren't prepared for, so no match
+      return [];
+    } // It's a match!
+    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')
+
+
+    return res;
+  }
+  /**
+   * Determines whether p and q (and all their children nodes) are identical.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q
+   * @return {Object} Information about the match, if it exists.
+   */
+
+
+  function _exactMatch(p, q) {
+    if (p instanceof ConstantNode && q instanceof ConstantNode) {
+      if (!equal(p.value, q.value)) {
+        return false;
+      }
+    } else if (p instanceof SymbolNode && q instanceof SymbolNode) {
+      if (p.name !== q.name) {
+        return false;
+      }
+    } else if (p instanceof OperatorNode && q instanceof OperatorNode || p instanceof FunctionNode && q instanceof FunctionNode) {
+      if (p instanceof OperatorNode) {
+        if (p.op !== q.op || p.fn !== q.fn) {
+          return false;
+        }
+      } else if (p instanceof FunctionNode) {
+        if (p.name !== q.name) {
+          return false;
+        }
+      }
+
+      if (p.args.length !== q.args.length) {
+        return false;
+      }
+
+      for (var i = 0; i < p.args.length; i++) {
+        if (!_exactMatch(p.args[i], q.args[i])) {
+          return false;
+        }
+      }
+    } else {
+      return false;
+    }
+
+    return true;
+  }
+
+  return simplify;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplify/simplifyConstant.js b/node_modules/mathjs/lib/esm/function/algebra/simplify/simplifyConstant.js
new file mode 100644
index 0000000..388709f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplify/simplifyConstant.js
@@ -0,0 +1,484 @@
+// TODO this could be improved by simplifying seperated constants under associative and commutative operators
+import { isFraction, isMatrix, isNode, isArrayNode, isConstantNode, isIndexNode, isObjectNode, isOperatorNode } from '../../../utils/is.js';
+import { factory } from '../../../utils/factory.js';
+import { createUtil } from './util.js';
+import { noBignumber, noFraction } from '../../../utils/noop.js';
+var name = 'simplifyConstant';
+var dependencies = ['typed', 'config', 'mathWithTransform', 'matrix', '?fraction', '?bignumber', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode'];
+export var createSimplifyConstant = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    mathWithTransform,
+    matrix,
+    fraction,
+    bignumber,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode
+  } = _ref;
+  var {
+    isCommutative,
+    isAssociative,
+    allChildren,
+    createMakeNodeFunction
+  } = createUtil({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+
+  function simplifyConstant(expr, options) {
+    return _ensureNode(foldFraction(expr, options));
+  }
+
+  function _removeFractions(thing) {
+    if (isFraction(thing)) {
+      return thing.valueOf();
+    }
+
+    if (thing instanceof Array) {
+      return thing.map(_removeFractions);
+    }
+
+    if (isMatrix(thing)) {
+      return matrix(_removeFractions(thing.valueOf()));
+    }
+
+    return thing;
+  }
+
+  function _eval(fnname, args, options) {
+    try {
+      return mathWithTransform[fnname].apply(null, args);
+    } catch (ignore) {
+      // sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions
+      args = args.map(_removeFractions);
+      return _toNumber(mathWithTransform[fnname].apply(null, args), options);
+    }
+  }
+
+  var _toNode = typed({
+    Fraction: _fractionToNode,
+    number: function number(n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+
+      return new ConstantNode(n);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+
+      return new ConstantNode(n); // old parameters: (n.toString(), 'number')
+    },
+    Complex: function Complex(s) {
+      throw new Error('Cannot convert Complex number to Node');
+    },
+    string: function string(s) {
+      return new ConstantNode(s);
+    },
+    Matrix: function Matrix(m) {
+      return new ArrayNode(m.valueOf().map(e => _toNode(e)));
+    }
+  });
+
+  function _ensureNode(thing) {
+    if (isNode(thing)) {
+      return thing;
+    }
+
+    return _toNode(thing);
+  } // convert a number to a fraction only if it can be expressed exactly,
+  // and when both numerator and denominator are small enough
+
+
+  function _exactFraction(n, options) {
+    var exactFractions = options && options.exactFractions !== false;
+
+    if (exactFractions && isFinite(n) && fraction) {
+      var f = fraction(n);
+      var fractionsLimit = options && typeof options.fractionsLimit === 'number' ? options.fractionsLimit : Infinity; // no limit by default
+
+      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {
+        return f;
+      }
+    }
+
+    return n;
+  } // Convert numbers to a preferred number type in preference order: Fraction, number, Complex
+  // BigNumbers are left alone
+
+
+  var _toNumber = typed({
+    'string, Object': function stringObject(s, options) {
+      if (config.number === 'BigNumber') {
+        if (bignumber === undefined) {
+          noBignumber();
+        }
+
+        return bignumber(s);
+      } else if (config.number === 'Fraction') {
+        if (fraction === undefined) {
+          noFraction();
+        }
+
+        return fraction(s);
+      } else {
+        var n = parseFloat(s);
+        return _exactFraction(n, options);
+      }
+    },
+    'Fraction, Object': function FractionObject(s, options) {
+      return s;
+    },
+    // we don't need options here
+    'BigNumber, Object': function BigNumberObject(s, options) {
+      return s;
+    },
+    // we don't need options here
+    'number, Object': function numberObject(s, options) {
+      return _exactFraction(s, options);
+    },
+    'Complex, Object': function ComplexObject(s, options) {
+      if (s.im !== 0) {
+        return s;
+      }
+
+      return _exactFraction(s.re, options);
+    },
+    'Matrix, Object': function MatrixObject(s, options) {
+      return matrix(_exactFraction(s.valueOf()));
+    },
+    'Array, Object': function ArrayObject(s, options) {
+      return s.map(_exactFraction);
+    }
+  });
+
+  function unaryMinusNode(n) {
+    return new OperatorNode('-', 'unaryMinus', [n]);
+  }
+
+  function _fractionToNode(f) {
+    var n;
+    var vn = f.s * f.n;
+
+    if (vn < 0) {
+      n = new OperatorNode('-', 'unaryMinus', [new ConstantNode(-vn)]);
+    } else {
+      n = new ConstantNode(vn);
+    }
+
+    if (f.d === 1) {
+      return n;
+    }
+
+    return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)]);
+  }
+  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */
+
+
+  function _foldAccessor(obj, index, options) {
+    if (!isIndexNode(index)) {
+      // don't know what to do with that...
+      return new AccessorNode(_ensureNode(obj), _ensureNode(index));
+    }
+
+    if (isArrayNode(obj) || isMatrix(obj)) {
+      var remainingDims = Array.from(index.dimensions);
+      /* We will resolve constant indices one at a time, looking
+       * just in the first or second dimensions because (a) arrays
+       * of more than two dimensions are likely rare, and (b) pulling
+       * out the third or higher dimension would be pretty intricate.
+       * The price is that we miss simplifying [..3d array][x,y,1]
+       */
+
+      while (remainingDims.length > 0) {
+        if (isConstantNode(remainingDims[0]) && typeof remainingDims[0].value !== 'string') {
+          var first = _toNumber(remainingDims.shift().value, options);
+
+          if (isArrayNode(obj)) {
+            obj = obj.items[first - 1];
+          } else {
+            // matrix
+            obj = obj.valueOf()[first - 1];
+
+            if (obj instanceof Array) {
+              obj = matrix(obj);
+            }
+          }
+        } else if (remainingDims.length > 1 && isConstantNode(remainingDims[1]) && typeof remainingDims[1].value !== 'string') {
+          var second = _toNumber(remainingDims[1].value, options);
+
+          var tryItems = [];
+          var fromItems = isArrayNode(obj) ? obj.items : obj.valueOf();
+
+          for (var item of fromItems) {
+            if (isArrayNode(item)) {
+              tryItems.push(item.items[second - 1]);
+            } else if (isMatrix(obj)) {
+              tryItems.push(item[second - 1]);
+            } else {
+              break;
+            }
+          }
+
+          if (tryItems.length === fromItems.length) {
+            if (isArrayNode(obj)) {
+              obj = new ArrayNode(tryItems);
+            } else {
+              // matrix
+              obj = matrix(tryItems);
+            }
+
+            remainingDims.splice(1, 1);
+          } else {
+            // extracting slice along 2nd dimension failed, give up
+            break;
+          }
+        } else {
+          // neither 1st or 2nd dimension is constant, give up
+          break;
+        }
+      }
+
+      if (remainingDims.length === index.dimensions.length) {
+        /* No successful constant indexing */
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+
+      if (remainingDims.length > 0) {
+        /* Indexed some but not all dimensions */
+        index = new IndexNode(remainingDims);
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+      /* All dimensions were constant, access completely resolved */
+
+
+      return obj;
+    }
+
+    if (isObjectNode(obj) && index.dimensions.length === 1 && isConstantNode(index.dimensions[0])) {
+      var key = index.dimensions[0].value;
+
+      if (key in obj.properties) {
+        return obj.properties[key];
+      }
+
+      return new ConstantNode(); // undefined
+    }
+    /* Don't know how to index this sort of obj, at least not with this index */
+
+
+    return new AccessorNode(_ensureNode(obj), index);
+  }
+  /*
+   * Create a binary tree from a list of Fractions and Nodes.
+   * Tries to fold Fractions by evaluating them until the first Node in the list is hit, so
+   * `args` should be sorted to have the Fractions at the start (if the operator is commutative).
+   * @param args - list of Fractions and Nodes
+   * @param fn - evaluator for the binary operation evaluator that accepts two Fractions
+   * @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes
+   * if args.length is 1, returns args[0]
+   * @return - Either a Node representing a binary expression or Fraction
+   */
+
+
+  function foldOp(fn, args, makeNode, options) {
+    return args.reduce(function (a, b) {
+      if (!isNode(a) && !isNode(b)) {
+        try {
+          return _eval(fn, [a, b], options);
+        } catch (ignoreandcontinue) {}
+
+        a = _toNode(a);
+        b = _toNode(b);
+      } else if (!isNode(a)) {
+        a = _toNode(a);
+      } else if (!isNode(b)) {
+        b = _toNode(b);
+      }
+
+      return makeNode([a, b]);
+    });
+  } // destroys the original node and returns a folded one
+
+
+  function foldFraction(node, options) {
+    switch (node.type) {
+      case 'SymbolNode':
+        return node;
+
+      case 'ConstantNode':
+        switch (typeof node.value) {
+          case 'number':
+            return _toNumber(node.value, options);
+
+          case 'string':
+            return node.value;
+
+          default:
+            if (!isNaN(node.value)) return _toNumber(node.value, options);
+        }
+
+        return node;
+
+      case 'FunctionNode':
+        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {
+          return node;
+        }
+
+        {
+          // Process operators as OperatorNode
+          var operatorFunctions = ['add', 'multiply'];
+
+          if (operatorFunctions.indexOf(node.name) === -1) {
+            var args = node.args.map(arg => foldFraction(arg, options)); // If all args are numbers
+
+            if (!args.some(isNode)) {
+              try {
+                return _eval(node.name, args, options);
+              } catch (ignoreandcontinue) {}
+            } // Size of a matrix does not depend on entries
+
+
+            if (node.name === 'size' && args.length === 1 && isArrayNode(args[0])) {
+              var sz = [];
+              var section = args[0];
+
+              while (isArrayNode(section)) {
+                sz.push(section.items.length);
+                section = section.items[0];
+              }
+
+              return matrix(sz);
+            } // Convert all args to nodes and construct a symbolic function call
+
+
+            return new FunctionNode(node.name, args.map(_ensureNode));
+          } else {// treat as operator
+          }
+        }
+
+      /* falls through */
+
+      case 'OperatorNode':
+        {
+          var fn = node.fn.toString();
+
+          var _args;
+
+          var res;
+          var makeNode = createMakeNodeFunction(node);
+
+          if (isOperatorNode(node) && node.isUnary()) {
+            _args = [foldFraction(node.args[0], options)];
+
+            if (!isNode(_args[0])) {
+              res = _eval(fn, _args, options);
+            } else {
+              res = makeNode(_args);
+            }
+          } else if (isAssociative(node, options.context)) {
+            _args = allChildren(node, options.context);
+            _args = _args.map(arg => foldFraction(arg, options));
+
+            if (isCommutative(fn, options.context)) {
+              // commutative binary operator
+              var consts = [];
+              var vars = [];
+
+              for (var i = 0; i < _args.length; i++) {
+                if (!isNode(_args[i])) {
+                  consts.push(_args[i]);
+                } else {
+                  vars.push(_args[i]);
+                }
+              }
+
+              if (consts.length > 1) {
+                res = foldOp(fn, consts, makeNode, options);
+                vars.unshift(res);
+                res = foldOp(fn, vars, makeNode, options);
+              } else {
+                // we won't change the children order since it's not neccessary
+                res = foldOp(fn, _args, makeNode, options);
+              }
+            } else {
+              // non-commutative binary operator
+              res = foldOp(fn, _args, makeNode, options);
+            }
+          } else {
+            // non-associative binary operator
+            _args = node.args.map(arg => foldFraction(arg, options));
+            res = foldOp(fn, _args, makeNode, options);
+          }
+
+          return res;
+        }
+
+      case 'ParenthesisNode':
+        // remove the uneccessary parenthesis
+        return foldFraction(node.content, options);
+
+      case 'AccessorNode':
+        return _foldAccessor(foldFraction(node.object, options), foldFraction(node.index, options), options);
+
+      case 'ArrayNode':
+        {
+          var foldItems = node.items.map(item => foldFraction(item, options));
+
+          if (foldItems.some(isNode)) {
+            return new ArrayNode(foldItems.map(_ensureNode));
+          }
+          /* All literals -- return a Matrix so we can operate on it */
+
+
+          return matrix(foldItems);
+        }
+
+      case 'IndexNode':
+        {
+          return new IndexNode(node.dimensions.map(n => simplifyConstant(n, options)));
+        }
+
+      case 'ObjectNode':
+        {
+          var foldProps = {};
+
+          for (var prop in node.properties) {
+            foldProps[prop] = simplifyConstant(node.properties[prop], options);
+          }
+
+          return new ObjectNode(foldProps);
+        }
+
+      case 'AssignmentNode':
+      /* falls through */
+
+      case 'BlockNode':
+      /* falls through */
+
+      case 'FunctionAssignmentNode':
+      /* falls through */
+
+      case 'RangeNode':
+      /* falls through */
+
+      case 'ConditionalNode':
+      /* falls through */
+
+      default:
+        throw new Error("Unimplemented node type in simplifyConstant: ".concat(node.type));
+    }
+  }
+
+  return simplifyConstant;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplify/util.js b/node_modules/mathjs/lib/esm/function/algebra/simplify/util.js
new file mode 100644
index 0000000..4372d64
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplify/util.js
@@ -0,0 +1,316 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+import { isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js';
+import { factory } from '../../../utils/factory.js';
+import { hasOwnProperty } from '../../../utils/object.js';
+var name = 'simplifyUtil';
+var dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];
+export var createUtil = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  } = _ref;
+  // TODO commutative/associative properties rely on the arguments
+  // e.g. multiply is not commutative for matrices
+  // The properties should be calculated from an argument to simplify, or possibly something in math.config
+  // the other option is for typed() to specify a return type so that we can evaluate the type of arguments
+
+  /* So that properties of an operator fit on one line: */
+  var T = true;
+  var F = false;
+  var defaultName = 'defaultF';
+  var defaultContext = {
+    /*      */
+    add: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+
+    /**/
+    unaryPlus: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+
+    /* */
+    subtract: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+
+    /* */
+    multiply: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+
+    /*   */
+    divide: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+
+    /*    */
+    paren: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: F
+    },
+
+    /* */
+    defaultF: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    }
+  };
+  var realContext = {
+    divide: {
+      total: F
+    },
+    log: {
+      total: F
+    }
+  };
+  var positiveContext = {
+    subtract: {
+      total: F
+    },
+    abs: {
+      trivial: T
+    },
+    log: {
+      total: T
+    }
+  };
+
+  function hasProperty(nodeOrName, property) {
+    var context = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultContext;
+    var name = defaultName;
+
+    if (typeof nodeOrName === 'string') {
+      name = nodeOrName;
+    } else if (isOperatorNode(nodeOrName)) {
+      name = nodeOrName.fn.toString();
+    } else if (isFunctionNode(nodeOrName)) {
+      name = nodeOrName.name;
+    } else if (isParenthesisNode(nodeOrName)) {
+      name = 'paren';
+    }
+
+    if (hasOwnProperty(context, name)) {
+      var properties = context[name];
+
+      if (hasOwnProperty(properties, property)) {
+        return properties[property];
+      }
+
+      if (hasOwnProperty(defaultContext, name)) {
+        return defaultContext[name][property];
+      }
+    }
+
+    if (hasOwnProperty(context, defaultName)) {
+      var _properties = context[defaultName];
+
+      if (hasOwnProperty(_properties, property)) {
+        return _properties[property];
+      }
+
+      return defaultContext[defaultName][property];
+    }
+    /* name not found in context and context has no global default */
+
+    /* So use default context. */
+
+
+    if (hasOwnProperty(defaultContext, name)) {
+      var _properties2 = defaultContext[name];
+
+      if (hasOwnProperty(_properties2, property)) {
+        return _properties2[property];
+      }
+    }
+
+    return defaultContext[defaultName][property];
+  }
+
+  function isCommutative(node) {
+    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'commutative', context);
+  }
+
+  function isAssociative(node) {
+    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'associative', context);
+  }
+  /**
+   * Merge the given contexts, with primary overriding secondary
+   * wherever they might conflict
+   */
+
+
+  function mergeContext(primary, secondary) {
+    var merged = _objectSpread({}, primary);
+
+    for (var prop in secondary) {
+      if (hasOwnProperty(primary, prop)) {
+        merged[prop] = _objectSpread(_objectSpread({}, secondary[prop]), primary[prop]);
+      } else {
+        merged[prop] = secondary[prop];
+      }
+    }
+
+    return merged;
+  }
+  /**
+   * Flatten all associative operators in an expression tree.
+   * Assumes parentheses have already been removed.
+   */
+
+
+  function flatten(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return node;
+    }
+
+    node.args = allChildren(node, context);
+
+    for (var i = 0; i < node.args.length; i++) {
+      flatten(node.args[i], context);
+    }
+  }
+  /**
+   * Get the children of a node as if it has been flattened.
+   * TODO implement for FunctionNodes
+   */
+
+
+  function allChildren(node, context) {
+    var op;
+    var children = [];
+
+    var findChildren = function findChildren(node) {
+      for (var i = 0; i < node.args.length; i++) {
+        var child = node.args[i];
+
+        if (isOperatorNode(child) && op === child.op) {
+          findChildren(child);
+        } else {
+          children.push(child);
+        }
+      }
+    };
+
+    if (isAssociative(node, context)) {
+      op = node.op;
+      findChildren(node);
+      return children;
+    } else {
+      return node.args;
+    }
+  }
+  /**
+   *  Unflatten all flattened operators to a right-heavy binary tree.
+   */
+
+
+  function unflattenr(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+
+    var makeNode = createMakeNodeFunction(node);
+    var l = node.args.length;
+
+    for (var i = 0; i < l; i++) {
+      unflattenr(node.args[i], context);
+    }
+
+    if (l > 2 && isAssociative(node, context)) {
+      var curnode = node.args.pop();
+
+      while (node.args.length > 0) {
+        curnode = makeNode([node.args.pop(), curnode]);
+      }
+
+      node.args = curnode.args;
+    }
+  }
+  /**
+   *  Unflatten all flattened operators to a left-heavy binary tree.
+   */
+
+
+  function unflattenl(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+
+    var makeNode = createMakeNodeFunction(node);
+    var l = node.args.length;
+
+    for (var i = 0; i < l; i++) {
+      unflattenl(node.args[i], context);
+    }
+
+    if (l > 2 && isAssociative(node, context)) {
+      var curnode = node.args.shift();
+
+      while (node.args.length > 0) {
+        curnode = makeNode([curnode, node.args.shift()]);
+      }
+
+      node.args = curnode.args;
+    }
+  }
+
+  function createMakeNodeFunction(node) {
+    if (isOperatorNode(node)) {
+      return function (args) {
+        try {
+          return new OperatorNode(node.op, node.fn, args, node.implicit);
+        } catch (err) {
+          console.error(err);
+          return [];
+        }
+      };
+    } else {
+      return function (args) {
+        return new FunctionNode(new SymbolNode(node.name), args);
+      };
+    }
+  }
+
+  return {
+    createMakeNodeFunction,
+    hasProperty,
+    isCommutative,
+    isAssociative,
+    mergeContext,
+    flatten,
+    allChildren,
+    unflattenr,
+    unflattenl,
+    defaultContext,
+    realContext,
+    positiveContext
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/esm/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..acc1b46
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplifyCore.js
@@ -0,0 +1,235 @@
+import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js';
+import { createUtil } from './simplify/util.js';
+import { factory } from '../../utils/factory.js';
+var name = 'simplifyCore';
+var dependencies = ['equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+export var createSimplifyCore = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    equal,
+    isZero,
+    add,
+    subtract,
+    multiply,
+    divide,
+    pow,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode
+  } = _ref;
+  var node0 = new ConstantNode(0);
+  var node1 = new ConstantNode(1);
+  var {
+    hasProperty,
+    isCommutative
+  } = createUtil({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+  /**
+   * simplifyCore() performs single pass simplification suitable for
+   * applications requiring ultimate performance. In contrast, simplify()
+   * extends simplifyCore() with additional passes to provide deeper
+   * simplification.
+   *
+   * Syntax:
+   *
+   *     simplifyCore(expr)
+   *
+   * Examples:
+   *
+   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')
+   *     math.simpifyCore(f)                          // Node {2 * x}
+   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplifyCore]) // Node {2 * x}
+   *
+   * See also:
+   *
+   *     simplify, resolve, derivative
+   *
+   * @param {Node} node
+   *     The expression to be simplified
+   * @param {Object} options
+   *     Simplification options, as per simplify()
+   * @return {Node} Returns expression with basic simplifications applied
+   */
+
+  function simplifyCore(node, options) {
+    var context = options ? options.context : undefined;
+
+    if (hasProperty(node, 'trivial', context)) {
+      // This node does nothing if it has only one argument, so if so,
+      // return that argument simplified
+      if (isFunctionNode(node) && node.args.length === 1) {
+        return simplifyCore(node.args[0], options);
+      } // For other node types, we try the generic methods
+
+
+      var simpChild = false;
+      var childCount = 0;
+      node.forEach(c => {
+        ++childCount;
+
+        if (childCount === 1) {
+          simpChild = simplifyCore(c, options);
+        }
+      });
+
+      if (childCount === 1) {
+        return simpChild;
+      }
+    }
+
+    if (isOperatorNode(node) && node.isUnary()) {
+      var a0 = simplifyCore(node.args[0], options);
+
+      if (node.op === '-') {
+        // unary minus
+        if (isOperatorNode(a0)) {
+          if (a0.isUnary() && a0.op === '-') {
+            return a0.args[0];
+          } else if (a0.isBinary() && a0.fn === 'subtract') {
+            return new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]]);
+          }
+        }
+
+        return new OperatorNode(node.op, node.fn, [a0]);
+      }
+    } else if (isOperatorNode(node) && node.isBinary()) {
+      var _a = simplifyCore(node.args[0], options);
+
+      var a1 = simplifyCore(node.args[1], options);
+
+      if (node.op === '+') {
+        if (isConstantNode(_a)) {
+          if (isZero(_a.value)) {
+            return a1;
+          } else if (isConstantNode(a1)) {
+            return new ConstantNode(add(_a.value, a1.value));
+          }
+        }
+
+        if (isConstantNode(a1) && isZero(a1.value)) {
+          return _a;
+        }
+
+        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {
+          return new OperatorNode('-', 'subtract', [_a, a1.args[0]]);
+        }
+
+        return new OperatorNode(node.op, node.fn, a1 ? [_a, a1] : [_a]);
+      } else if (node.op === '-') {
+        if (isConstantNode(_a) && a1) {
+          if (isConstantNode(a1)) {
+            return new ConstantNode(subtract(_a.value, a1.value));
+          } else if (isZero(_a.value)) {
+            return new OperatorNode('-', 'unaryMinus', [a1]);
+          }
+        } // if (node.fn === "subtract" && node.args.length === 2) {
+
+
+        if (node.fn === 'subtract') {
+          if (isConstantNode(a1) && isZero(a1.value)) {
+            return _a;
+          }
+
+          if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {
+            return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]), options);
+          }
+
+          return new OperatorNode(node.op, node.fn, [_a, a1]);
+        }
+      } else if (node.op === '*') {
+        if (isConstantNode(_a)) {
+          if (isZero(_a.value)) {
+            return node0;
+          } else if (equal(_a.value, 1)) {
+            return a1;
+          } else if (isConstantNode(a1)) {
+            return new ConstantNode(multiply(_a.value, a1.value));
+          }
+        }
+
+        if (isConstantNode(a1)) {
+          if (isZero(a1.value)) {
+            return node0;
+          } else if (equal(a1.value, 1)) {
+            return _a;
+          } else if (isOperatorNode(_a) && _a.isBinary() && _a.op === node.op && isCommutative(node, context)) {
+            var a00 = _a.args[0];
+
+            if (isConstantNode(a00)) {
+              var a00a1 = new ConstantNode(multiply(a00.value, a1.value));
+              return new OperatorNode(node.op, node.fn, [a00a1, _a.args[1]], node.implicit); // constants on left
+            }
+          }
+
+          if (isCommutative(node, context)) {
+            return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left
+          } else {
+            return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
+          }
+        }
+
+        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
+      } else if (node.op === '/') {
+        if (isConstantNode(_a)) {
+          if (isZero(_a.value)) {
+            return node0;
+          } else if (isConstantNode(a1) && (equal(a1.value, 1) || equal(a1.value, 2) || equal(a1.value, 4))) {
+            return new ConstantNode(divide(_a.value, a1.value));
+          }
+        }
+
+        return new OperatorNode(node.op, node.fn, [_a, a1]);
+      } else if (node.op === '^') {
+        if (isConstantNode(a1)) {
+          if (isZero(a1.value)) {
+            return node1;
+          } else if (equal(a1.value, 1)) {
+            return _a;
+          } else {
+            if (isConstantNode(_a)) {
+              // fold constant
+              return new ConstantNode(pow(_a.value, a1.value));
+            } else if (isOperatorNode(_a) && _a.isBinary() && _a.op === '^') {
+              var a01 = _a.args[1];
+
+              if (isConstantNode(a01)) {
+                return new OperatorNode(node.op, node.fn, [_a.args[0], new ConstantNode(multiply(a01.value, a1.value))]);
+              }
+            }
+          }
+        }
+      }
+
+      return new OperatorNode(node.op, node.fn, [_a, a1]);
+    } else if (isFunctionNode(node)) {
+      return new FunctionNode(simplifyCore(node.fn), node.args.map(n => simplifyCore(n, options)));
+    } else if (isArrayNode(node)) {
+      return new ArrayNode(node.items.map(n => simplifyCore(n, options)));
+    } else if (isAccessorNode(node)) {
+      return new AccessorNode(simplifyCore(node.object, options), simplifyCore(node.index, options));
+    } else if (isIndexNode(node)) {
+      return new IndexNode(node.dimensions.map(n => simplifyCore(n, options)));
+    } else if (isObjectNode(node)) {
+      var newProps = {};
+
+      for (var prop in node.properties) {
+        newProps[prop] = simplifyCore(node.properties[prop], options);
+      }
+
+      return new ObjectNode(newProps);
+    } else {// cannot simplify
+    }
+
+    return node;
+  }
+
+  return simplifyCore;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js
new file mode 100644
index 0000000..be3155e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js
@@ -0,0 +1,161 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'lsolve';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+export var createLsolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtract,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+  /**
+   * Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolve(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolve(a, b)  // [[-5.5], [20]]
+   *
+   * See also:
+   *
+   *    lsolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var r = _denseForwardSubstitution(m, b);
+
+      return r.valueOf();
+    }
+  });
+
+  function _denseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // result
+
+    var x = [];
+    var mdata = m._data; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      var bj = bdata[j][0] || 0;
+      var xj = void 0;
+
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+        var vjj = mdata[j][j];
+
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        xj = divideScalar(bj, vjj); // loop rows
+
+        for (var i = j + 1; i < rows; i++) {
+          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // degenerate row, we can choose any value
+        xj = 0;
+      }
+
+      x[j] = [xj];
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+
+  function _sparseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // result
+
+    var x = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      var bj = bdata[j][0] || 0;
+
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+        var vjj = 0; // matrix values & indices (column j)
+
+        var jValues = [];
+        var jIndices = []; // first and last index in the column
+
+        var firstIndex = ptr[j];
+        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j]
+
+        for (var k = firstIndex; k < lastIndex; k++) {
+          var i = index[k]; // check row (rows are not sorted!)
+
+          if (i === j) {
+            vjj = values[k];
+          } else if (i > j) {
+            // store lower triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        } // at this point we must have a value in vjj
+
+
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        var xj = divideScalar(bj, vjj);
+
+        for (var _k = 0, l = jIndices.length; _k < l; _k++) {
+          var _i = jIndices[_k];
+          bdata[_i] = [subtract(bdata[_i][0] || 0, multiplyScalar(xj, jValues[_k]))];
+        }
+
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js
new file mode 100644
index 0000000..44d421b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js
@@ -0,0 +1,187 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'lsolveAll';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+export var createLsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtract,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+  /**
+   * Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolveAll(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]
+   *
+   * See also:
+   *
+   *    lsolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var R = _denseForwardSubstitution(m, b);
+
+      return R.map(r => r.valueOf());
+    }
+  });
+
+  function _denseForwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var M = m._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // loop columns
+
+    for (var i = 0; i < columns; i++) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], M[i][i]);
+
+          for (var j = i + 1; j < columns; j++) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = [...b];
+          bNew[i] = 1;
+
+          for (var _j = i + 1; _j < columns; _j++) {
+            bNew[_j] = subtract(bNew[_j], M[_j][i]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+
+  function _sparseForwardSubstitution(m, b_) {
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // loop columns
+
+    for (var i = 0; i < columns; i++) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k]; // values & indices (column i)
+
+        var iValues = [];
+        var iIndices = []; // first & last indeces in column
+
+        var firstIndex = ptr[i];
+        var lastIndex = ptr[i + 1]; // find the value at [i, i]
+
+        var Mii = 0;
+
+        for (var j = firstIndex; j < lastIndex; j++) {
+          var J = index[j]; // check row
+
+          if (J === i) {
+            Mii = values[j];
+          } else if (J > i) {
+            // store lower triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], Mii);
+
+          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {
+            var _J = iIndices[_j2];
+            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = [...b];
+          bNew[i] = 1;
+
+          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {
+            var _J2 = iIndices[_j3];
+            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js b/node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js
new file mode 100644
index 0000000..3dc35de
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js
@@ -0,0 +1,113 @@
+import { isArray, isMatrix } from '../../../utils/is.js';
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+import { csIpvec } from '../sparse/csIpvec.js';
+var name = 'lusolve';
+var dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];
+export var createLusolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    lup,
+    slu,
+    usolve,
+    lsolve,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+  /**
+   * Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.
+   *
+   * Syntax:
+   *
+   *    math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b
+   *    math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)
+   *
+   * Examples:
+   *
+   *    const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]
+   *
+   *    const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]
+   *
+   *    const f = math.lup(m)
+   *    const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]
+   *    const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = math.lusolve(a, b)  // [[2], [5]]
+   *
+   * See also:
+   *
+   *    lup, slu, lsolve, usolve
+   *
+   * @param {Matrix | Array | Object} A      Invertible Matrix or the Matrix LU decomposition
+   * @param {Matrix | Array} b               Column Vector
+   * @param {number} [order]                 The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix
+   * @param {Number} [threshold]             Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.
+   *
+   * @return {DenseMatrix | Array}           Column vector with the solution to the linear system A * x = b
+   */
+
+  return typed(name, {
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      a = matrix(a);
+      var d = lup(a);
+
+      var x = _lusolve(d.L, d.U, d.p, null, b);
+
+      return x.valueOf();
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(a, b) {
+      var d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(a, b) {
+      var d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix, number, number': function SparseMatrixArrayMatrixNumberNumber(a, b, order, threshold) {
+      var d = slu(a, order, threshold);
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    },
+    'Object, Array | Matrix': function ObjectArrayMatrix(d, b) {
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    }
+  });
+
+  function _toMatrix(a) {
+    if (isMatrix(a)) {
+      return a;
+    }
+
+    if (isArray(a)) {
+      return matrix(a);
+    }
+
+    throw new TypeError('Invalid Matrix LU decomposition');
+  }
+
+  function _lusolve(l, u, p, q, b) {
+    // verify decomposition
+    l = _toMatrix(l);
+    u = _toMatrix(u); // apply row permutations if needed (b is a DenseMatrix)
+
+    if (p) {
+      b = solveValidation(l, b, true);
+      b._data = csIpvec(p, b._data);
+    } // use forward substitution to resolve L * y = b
+
+
+    var y = lsolve(l, b); // use backward substitution to resolve U * x = y
+
+    var x = usolve(u, y); // apply column permutations if needed (x is a DenseMatrix)
+
+    if (q) {
+      x._data = csIpvec(q, x._data);
+    }
+
+    return x;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js b/node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js
new file mode 100644
index 0000000..e59ddbf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js
@@ -0,0 +1,166 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'usolve';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+export var createUsolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtract,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+  /**
+   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolve(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolve(a, b)  // [[8], [9]]
+   *
+   * See also:
+   *
+   *    usolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var r = _denseBackwardSubstitution(m, b);
+
+      return r.valueOf();
+    }
+  });
+
+  function _denseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // result
+
+    var x = [];
+    var mdata = m._data; // loop columns backwards
+
+    for (var j = columns - 1; j >= 0; j--) {
+      // b[j]
+      var bj = bdata[j][0] || 0; // x[j]
+
+      var xj = void 0;
+
+      if (!equalScalar(bj, 0)) {
+        // value at [j, j]
+        var vjj = mdata[j][j];
+
+        if (equalScalar(vjj, 0)) {
+          // system cannot be solved
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        xj = divideScalar(bj, vjj); // loop rows
+
+        for (var i = j - 1; i >= 0; i--) {
+          // update copy of b
+          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // zero value at j
+        xj = 0;
+      } // update x
+
+
+      x[j] = [xj];
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+
+  function _sparseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // result
+
+    var x = []; // loop columns backwards
+
+    for (var j = columns - 1; j >= 0; j--) {
+      var bj = bdata[j][0] || 0;
+
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+        var vjj = 0; // upper triangular matrix values & index (column j)
+
+        var jValues = [];
+        var jIndices = []; // first & last indeces in column
+
+        var firstIndex = ptr[j];
+        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j], loop backwards
+
+        for (var k = lastIndex - 1; k >= firstIndex; k--) {
+          var i = index[k]; // check row (rows are not sorted!)
+
+          if (i === j) {
+            vjj = values[k];
+          } else if (i < j) {
+            // store upper triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        } // at this point we must have a value in vjj
+
+
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+
+        var xj = divideScalar(bj, vjj);
+
+        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {
+          var _i = jIndices[_k];
+          bdata[_i] = [subtract(bdata[_i][0], multiplyScalar(xj, jValues[_k]))];
+        }
+
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js b/node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js
new file mode 100644
index 0000000..a247e53
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js
@@ -0,0 +1,187 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'usolveAll';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
+export var createUsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtract,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+  /**
+   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolveAll(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]
+   *
+   * See also:
+   *
+   *    usolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
+      var m = matrix(a);
+
+      var R = _denseBackwardSubstitution(m, b);
+
+      return R.map(r => r.valueOf());
+    }
+  });
+
+  function _denseBackwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var M = m._data;
+    var rows = m._size[0];
+    var columns = m._size[1]; // loop columns backwards
+
+    for (var i = columns - 1; i >= 0; i--) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], M[i][i]);
+
+          for (var j = i - 1; j >= 0; j--) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = [...b];
+          bNew[i] = 1;
+
+          for (var _j = i - 1; _j >= 0; _j--) {
+            bNew[_j] = subtract(bNew[_j], M[_j][i]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+
+  function _sparseBackwardSubstitution(m, b_) {
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // loop columns backwards
+
+    for (var i = columns - 1; i >= 0; i--) {
+      var L = B.length; // loop right-hand sides
+
+      for (var k = 0; k < L; k++) {
+        var b = B[k]; // values & indices (column i)
+
+        var iValues = [];
+        var iIndices = []; // first & last indeces in column
+
+        var firstIndex = ptr[i];
+        var lastIndex = ptr[i + 1]; // find the value at [i, i]
+
+        var Mii = 0;
+
+        for (var j = lastIndex - 1; j >= firstIndex; j--) {
+          var J = index[j]; // check row
+
+          if (J === i) {
+            Mii = values[j];
+          } else if (J < i) {
+            // store upper triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+          b[i] = divideScalar(b[i], Mii); // loop upper triangular
+
+          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {
+            var _J = iIndices[_j2];
+            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+          var bNew = [...b];
+          bNew[i] = 1; // loop upper triangular
+
+          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {
+            var _J2 = iIndices[_j3];
+            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);
+          }
+
+          B.push(bNew);
+        }
+      }
+    }
+
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js b/node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js
new file mode 100644
index 0000000..1fefbd0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js
@@ -0,0 +1,139 @@
+import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js';
+import { arraySize } from '../../../../utils/array.js';
+import { format } from '../../../../utils/string.js';
+export function createSolveValidation(_ref) {
+  var {
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Validates matrix and column vector b for backward/forward substitution algorithms.
+   *
+   * @param {Matrix} m            An N x N matrix
+   * @param {Array | Matrix} b    A column vector
+   * @param {Boolean} copy        Return a copy of vector b
+   *
+   * @return {DenseMatrix}        Dense column vector b
+   */
+  return function solveValidation(m, b, copy) {
+    var mSize = m.size();
+
+    if (mSize.length !== 2) {
+      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')');
+    }
+
+    var rows = mSize[0];
+    var columns = mSize[1];
+
+    if (rows !== columns) {
+      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')');
+    }
+
+    var data = [];
+
+    if (isMatrix(b)) {
+      var bSize = b.size();
+      var bdata = b._data; // 1-dim vector
+
+      if (bSize.length === 1) {
+        if (bSize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        for (var i = 0; i < rows; i++) {
+          data[i] = [bdata[i]];
+        }
+
+        return new DenseMatrix({
+          data: data,
+          size: [rows, 1],
+          datatype: b._datatype
+        });
+      } // 2-dim column
+
+
+      if (bSize.length === 2) {
+        if (bSize[0] !== rows || bSize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        if (isDenseMatrix(b)) {
+          if (copy) {
+            data = [];
+
+            for (var _i = 0; _i < rows; _i++) {
+              data[_i] = [bdata[_i][0]];
+            }
+
+            return new DenseMatrix({
+              data: data,
+              size: [rows, 1],
+              datatype: b._datatype
+            });
+          }
+
+          return b;
+        }
+
+        if (isSparseMatrix(b)) {
+          for (var _i2 = 0; _i2 < rows; _i2++) {
+            data[_i2] = [0];
+          }
+
+          var values = b._values;
+          var index = b._index;
+          var ptr = b._ptr;
+
+          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {
+            var _i3 = index[k];
+            data[_i3][0] = values[k];
+          }
+
+          return new DenseMatrix({
+            data: data,
+            size: [rows, 1],
+            datatype: b._datatype
+          });
+        }
+      }
+
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+
+    if (isArray(b)) {
+      var bsize = arraySize(b);
+
+      if (bsize.length === 1) {
+        if (bsize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        for (var _i4 = 0; _i4 < rows; _i4++) {
+          data[_i4] = [b[_i4]];
+        }
+
+        return new DenseMatrix({
+          data: data,
+          size: [rows, 1]
+        });
+      }
+
+      if (bsize.length === 2) {
+        if (bsize[0] !== rows || bsize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+
+        for (var _i5 = 0; _i5 < rows; _i5++) {
+          data[_i5] = [b[_i5][0]];
+        }
+
+        return new DenseMatrix({
+          data: data,
+          size: [rows, 1]
+        });
+      }
+
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js
new file mode 100644
index 0000000..53ee9ca
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js
@@ -0,0 +1,628 @@
+import { factory } from '../../../utils/factory.js';
+import { csFkeep } from './csFkeep.js';
+import { csFlip } from './csFlip.js';
+import { csTdfs } from './csTdfs.js';
+var name = 'csAmd';
+var dependencies = ['add', 'multiply', 'transpose'];
+export var createCsAmd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    add,
+    multiply,
+    transpose
+  } = _ref;
+
+  /**
+   * Approximate minimum degree ordering. The minimum degree algorithm is a widely used
+   * heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization
+   * than A. It is a gready method that selects the sparsest pivot row and column during the course
+   * of a right looking sparse Cholesky factorization.
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   *
+   * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
+   * @param {Matrix} m        Sparse Matrix
+   */
+  return function csAmd(order, a) {
+    // check input parameters
+    if (!a || order <= 0 || order > 3) {
+      return null;
+    } // a matrix arrays
+
+
+    var asize = a._size; // rows and columns
+
+    var m = asize[0];
+    var n = asize[1]; // initialize vars
+
+    var lemax = 0; // dense threshold
+
+    var dense = Math.max(16, 10 * Math.sqrt(n));
+    dense = Math.min(n - 2, dense); // create target matrix C
+
+    var cm = _createTargetMatrix(order, a, m, n, dense); // drop diagonal entries
+
+
+    csFkeep(cm, _diag, null); // C matrix arrays
+
+    var cindex = cm._index;
+    var cptr = cm._ptr; // number of nonzero elements in C
+
+    var cnz = cptr[n]; // allocate result (n+1)
+
+    var P = []; // create workspace (8 * (n + 1))
+
+    var W = [];
+    var len = 0; // first n + 1 entries
+
+    var nv = n + 1; // next n + 1 entries
+
+    var next = 2 * (n + 1); // next n + 1 entries
+
+    var head = 3 * (n + 1); // next n + 1 entries
+
+    var elen = 4 * (n + 1); // next n + 1 entries
+
+    var degree = 5 * (n + 1); // next n + 1 entries
+
+    var w = 6 * (n + 1); // next n + 1 entries
+
+    var hhead = 7 * (n + 1); // last n + 1 entries
+    // use P as workspace for last
+
+    var last = P; // initialize quotient graph
+
+    var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree); // initialize degree lists
+
+
+    var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next); // minimum degree node
+
+
+    var mindeg = 0; // vars
+
+    var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d; // while (selecting pivots) do
+
+    while (nel < n) {
+      // select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first
+      // finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow
+      // many nodes have been eliminated.
+      for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++) {
+        ;
+      }
+
+      if (W[next + k] !== -1) {
+        last[W[next + k]] = -1;
+      } // remove k from degree list
+
+
+      W[head + mindeg] = W[next + k]; // elenk = |Ek|
+
+      var elenk = W[elen + k]; // # of nodes k represents
+
+      var nvk = W[nv + k]; // W[nv + k] nodes of A eliminated
+
+      nel += nvk; // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is
+      // negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the
+      // degree lists. All elements e in Ek are absorved into element k.
+
+      var dk = 0; // flag k as in Lk
+
+      W[nv + k] = -nvk;
+      var p = cptr[k]; // do in place if W[elen + k] === 0
+
+      var pk1 = elenk === 0 ? p : cnz;
+      var pk2 = pk1;
+
+      for (k1 = 1; k1 <= elenk + 1; k1++) {
+        if (k1 > elenk) {
+          // search the nodes in k
+          e = k; // list of nodes starts at cindex[pj]
+
+          pj = p; // length of list of nodes in k
+
+          ln = W[len + k] - elenk;
+        } else {
+          // search the nodes in e
+          e = cindex[p++];
+          pj = cptr[e]; // length of list of nodes in e
+
+          ln = W[len + e];
+        }
+
+        for (k2 = 1; k2 <= ln; k2++) {
+          i = cindex[pj++]; // check  node i dead, or seen
+
+          if ((nvi = W[nv + i]) <= 0) {
+            continue;
+          } // W[degree + Lk] += size of node i
+
+
+          dk += nvi; // negate W[nv + i] to denote i in Lk
+
+          W[nv + i] = -nvi; // place i in Lk
+
+          cindex[pk2++] = i;
+
+          if (W[next + i] !== -1) {
+            last[W[next + i]] = last[i];
+          } // check we need to remove i from degree list
+
+
+          if (last[i] !== -1) {
+            W[next + last[i]] = W[next + i];
+          } else {
+            W[head + W[degree + i]] = W[next + i];
+          }
+        }
+
+        if (e !== k) {
+          // absorb e into k
+          cptr[e] = csFlip(k); // e is now a dead element
+
+          W[w + e] = 0;
+        }
+      } // cindex[cnz...nzmax] is free
+
+
+      if (elenk !== 0) {
+        cnz = pk2;
+      } // external degree of k - |Lk\i|
+
+
+      W[degree + k] = dk; // element k is in cindex[pk1..pk2-1]
+
+      cptr[k] = pk1;
+      W[len + k] = pk2 - pk1; // k is now an element
+
+      W[elen + k] = -2; // Find set differences. The scan1 function now computes the set differences |Le \ Lk| for all elements e. At the start of the
+      // scan, no entry in the w array is greater than or equal to mark.
+      // clear w if necessary
+
+      mark = _wclear(mark, lemax, W, w, n); // scan 1: find |Le\Lk|
+
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk]; // check if W[elen + i] empty, skip it
+
+        if ((eln = W[elen + i]) <= 0) {
+          continue;
+        } // W[nv + i] was negated
+
+
+        nvi = -W[nv + i];
+        var wnvi = mark - nvi; // scan Ei
+
+        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {
+          e = cindex[p];
+
+          if (W[w + e] >= mark) {
+            // decrement |Le\Lk|
+            W[w + e] -= nvi;
+          } else if (W[w + e] !== 0) {
+            // ensure e is a live element, 1st time e seen in scan 1
+            W[w + e] = W[degree + e] + wnvi;
+          }
+        }
+      } // degree update
+      // The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash
+      // function h(i) for all nodes in Lk.
+      // scan2: degree update
+
+
+      for (pk = pk1; pk < pk2; pk++) {
+        // consider node i in Lk
+        i = cindex[pk];
+        p1 = cptr[i];
+        p2 = p1 + W[elen + i] - 1;
+        pn = p1; // scan Ei
+
+        for (h = 0, d = 0, p = p1; p <= p2; p++) {
+          e = cindex[p]; // check e is an unabsorbed element
+
+          if (W[w + e] !== 0) {
+            // dext = |Le\Lk|
+            var dext = W[w + e] - mark;
+
+            if (dext > 0) {
+              // sum up the set differences
+              d += dext; // keep e in Ei
+
+              cindex[pn++] = e; // compute the hash of node i
+
+              h += e;
+            } else {
+              // aggressive absorb. e->k
+              cptr[e] = csFlip(k); // e is a dead element
+
+              W[w + e] = 0;
+            }
+          }
+        } // W[elen + i] = |Ei|
+
+
+        W[elen + i] = pn - p1 + 1;
+        var p3 = pn;
+        var p4 = p1 + W[len + i]; // prune edges in Ai
+
+        for (p = p2 + 1; p < p4; p++) {
+          j = cindex[p]; // check node j dead or in Lk
+
+          var nvj = W[nv + j];
+
+          if (nvj <= 0) {
+            continue;
+          } // degree(i) += |j|
+
+
+          d += nvj; // place j in node list of i
+
+          cindex[pn++] = j; // compute hash for node i
+
+          h += j;
+        } // check for mass elimination
+
+
+        if (d === 0) {
+          // absorb i into k
+          cptr[i] = csFlip(k);
+          nvi = -W[nv + i]; // |Lk| -= |i|
+
+          dk -= nvi; // |k| += W[nv + i]
+
+          nvk += nvi;
+          nel += nvi;
+          W[nv + i] = 0; // node i is dead
+
+          W[elen + i] = -1;
+        } else {
+          // update degree(i)
+          W[degree + i] = Math.min(W[degree + i], d); // move first node to end
+
+          cindex[pn] = cindex[p3]; // move 1st el. to end of Ei
+
+          cindex[p3] = cindex[p1]; // add k as 1st element in of Ei
+
+          cindex[p1] = k; // new len of adj. list of node i
+
+          W[len + i] = pn - p1 + 1; // finalize hash of i
+
+          h = (h < 0 ? -h : h) % n; // place i in hash bucket
+
+          W[next + i] = W[hhead + h];
+          W[hhead + h] = i; // save hash of i in last[i]
+
+          last[i] = h;
+        }
+      } // finalize |Lk|
+
+
+      W[degree + k] = dk;
+      lemax = Math.max(lemax, dk); // clear w
+
+      mark = _wclear(mark + lemax, lemax, W, w, n); // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.
+      // If two nodes have identical adjacency lists, their hash functions wil be identical.
+
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk]; // check i is dead, skip it
+
+        if (W[nv + i] >= 0) {
+          continue;
+        } // scan hash bucket of node i
+
+
+        h = last[i];
+        i = W[hhead + h]; // hash bucket will be empty
+
+        W[hhead + h] = -1;
+
+        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {
+          ln = W[len + i];
+          eln = W[elen + i];
+
+          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {
+            W[w + cindex[p]] = mark;
+          }
+
+          var jlast = i; // compare i with all j
+
+          for (j = W[next + i]; j !== -1;) {
+            var ok = W[len + j] === ln && W[elen + j] === eln;
+
+            for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {
+              // compare i and j
+              if (W[w + cindex[p]] !== mark) {
+                ok = 0;
+              }
+            } // check i and j are identical
+
+
+            if (ok) {
+              // absorb j into i
+              cptr[j] = csFlip(i);
+              W[nv + i] += W[nv + j];
+              W[nv + j] = 0; // node j is dead
+
+              W[elen + j] = -1; // delete j from hash bucket
+
+              j = W[next + j];
+              W[next + jlast] = j;
+            } else {
+              // j and i are different
+              jlast = j;
+              j = W[next + j];
+            }
+          }
+        }
+      } // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.
+      // Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.
+
+
+      for (p = pk1, pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk]; // check  i is dead, skip it
+
+        if ((nvi = -W[nv + i]) <= 0) {
+          continue;
+        } // restore W[nv + i]
+
+
+        W[nv + i] = nvi; // compute external degree(i)
+
+        d = W[degree + i] + dk - nvi;
+        d = Math.min(d, n - nel - nvi);
+
+        if (W[head + d] !== -1) {
+          last[W[head + d]] = i;
+        } // put i back in degree list
+
+
+        W[next + i] = W[head + d];
+        last[i] = -1;
+        W[head + d] = i; // find new minimum degree
+
+        mindeg = Math.min(mindeg, d);
+        W[degree + i] = d; // place i in Lk
+
+        cindex[p++] = i;
+      } // # nodes absorbed into k
+
+
+      W[nv + k] = nvk; // length of adj list of element k
+
+      if ((W[len + k] = p - pk1) === 0) {
+        // k is a root of the tree
+        cptr[k] = -1; // k is now a dead element
+
+        W[w + k] = 0;
+      }
+
+      if (elenk !== 0) {
+        // free unused space in Lk
+        cnz = p;
+      }
+    } // Postordering. The elimination is complete, but no permutation has been computed. All that is left
+    // of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if
+    // nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation
+    // is computed. The tree is restored by unflipping all of ptr.
+    // fix assembly tree
+
+
+    for (i = 0; i < n; i++) {
+      cptr[i] = csFlip(cptr[i]);
+    }
+
+    for (j = 0; j <= n; j++) {
+      W[head + j] = -1;
+    } // place unordered nodes in lists
+
+
+    for (j = n; j >= 0; j--) {
+      // skip if j is an element
+      if (W[nv + j] > 0) {
+        continue;
+      } // place j in list of its parent
+
+
+      W[next + j] = W[head + cptr[j]];
+      W[head + cptr[j]] = j;
+    } // place elements in lists
+
+
+    for (e = n; e >= 0; e--) {
+      // skip unless e is an element
+      if (W[nv + e] <= 0) {
+        continue;
+      }
+
+      if (cptr[e] !== -1) {
+        // place e in list of its parent
+        W[next + e] = W[head + cptr[e]];
+        W[head + cptr[e]] = e;
+      }
+    } // postorder the assembly tree
+
+
+    for (k = 0, i = 0; i <= n; i++) {
+      if (cptr[i] === -1) {
+        k = csTdfs(i, k, W, head, next, P, w);
+      }
+    } // remove last item in array
+
+
+    P.splice(P.length - 1, 1); // return P
+
+    return P;
+  };
+  /**
+   * Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation
+   * vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.
+   *
+   * Order: 0
+   *   A natural ordering P=null matrix is returned.
+   *
+   * Order: 1
+   *   Matrix must be square. This is appropriate for a Cholesky or LU factorization.
+   *   P = M + M'
+   *
+   * Order: 2
+   *   Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.
+   *   P = M' * M
+   *
+   * Order: 3
+   *   This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.
+   *   P = M' * M
+   */
+
+  function _createTargetMatrix(order, a, m, n, dense) {
+    // compute A'
+    var at = transpose(a); // check order = 1, matrix must be square
+
+    if (order === 1 && n === m) {
+      // C = A + A'
+      return add(a, at);
+    } // check order = 2, drop dense columns from M'
+
+
+    if (order === 2) {
+      // transpose arrays
+      var tindex = at._index;
+      var tptr = at._ptr; // new column index
+
+      var p2 = 0; // loop A' columns (rows)
+
+      for (var j = 0; j < m; j++) {
+        // column j of AT starts here
+        var p = tptr[j]; // new column j starts here
+
+        tptr[j] = p2; // skip dense col j
+
+        if (tptr[j + 1] - p > dense) {
+          continue;
+        } // map rows in column j of A
+
+
+        for (var p1 = tptr[j + 1]; p < p1; p++) {
+          tindex[p2++] = tindex[p];
+        }
+      } // finalize AT
+
+
+      tptr[m] = p2; // recreate A from new transpose matrix
+
+      a = transpose(at); // use A' * A
+
+      return multiply(at, a);
+    } // use A' * A, square or rectangular matrix
+
+
+    return multiply(at, a);
+  }
+  /**
+   * Initialize quotient graph. There are four kind of nodes and elements that must be represented:
+   *
+   *  - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.
+   *  - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).
+   *  - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.
+   *  - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).
+   */
+
+
+  function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {
+    // Initialize quotient graph
+    for (var k = 0; k < n; k++) {
+      W[len + k] = cptr[k + 1] - cptr[k];
+    }
+
+    W[len + n] = 0; // initialize workspace
+
+    for (var i = 0; i <= n; i++) {
+      // degree list i is empty
+      W[head + i] = -1;
+      last[i] = -1;
+      W[next + i] = -1; // hash list i is empty
+
+      W[hhead + i] = -1; // node i is just one node
+
+      W[nv + i] = 1; // node i is alive
+
+      W[w + i] = 1; // Ek of node i is empty
+
+      W[elen + i] = 0; // degree of node i
+
+      W[degree + i] = W[len + i];
+    } // clear w
+
+
+    var mark = _wclear(0, 0, W, w, n); // n is a dead element
+
+
+    W[elen + n] = -2; // n is a root of assembly tree
+
+    cptr[n] = -1; // n is a dead element
+
+    W[w + n] = 0; // return mark
+
+    return mark;
+  }
+  /**
+   * Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with
+   * degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the
+   * output permutation p.
+   */
+
+
+  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {
+    // result
+    var nel = 0; // loop columns
+
+    for (var i = 0; i < n; i++) {
+      // degree @ i
+      var d = W[degree + i]; // check node i is empty
+
+      if (d === 0) {
+        // element i is dead
+        W[elen + i] = -2;
+        nel++; // i is a root of assembly tree
+
+        cptr[i] = -1;
+        W[w + i] = 0;
+      } else if (d > dense) {
+        // absorb i into element n
+        W[nv + i] = 0; // node i is dead
+
+        W[elen + i] = -1;
+        nel++;
+        cptr[i] = csFlip(n);
+        W[nv + n]++;
+      } else {
+        var h = W[head + d];
+
+        if (h !== -1) {
+          last[h] = i;
+        } // put node i in degree list d
+
+
+        W[next + i] = W[head + d];
+        W[head + d] = i;
+      }
+    }
+
+    return nel;
+  }
+
+  function _wclear(mark, lemax, W, w, n) {
+    if (mark < 2 || mark + lemax < 0) {
+      for (var k = 0; k < n; k++) {
+        if (W[w + k] !== 0) {
+          W[w + k] = 1;
+        }
+      }
+
+      mark = 2;
+    } // at this point, W [0..n-1] < mark holds
+
+
+    return mark;
+  }
+
+  function _diag(i, j) {
+    return i !== j;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csChol.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csChol.js
new file mode 100644
index 0000000..47a62a0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csChol.js
@@ -0,0 +1,168 @@
+import { factory } from '../../../utils/factory.js';
+import { csEreach } from './csEreach.js';
+import { createCsSymperm } from './csSymperm.js';
+var name = 'csChol';
+var dependencies = ['divideScalar', 'sqrt', 'subtract', 'multiply', 'im', 're', 'conj', 'equal', 'smallerEq', 'SparseMatrix'];
+export var createCsChol = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    divideScalar,
+    sqrt,
+    subtract,
+    multiply,
+    im,
+    re,
+    conj,
+    equal,
+    smallerEq,
+    SparseMatrix
+  } = _ref;
+  var csSymperm = createCsSymperm({
+    conj,
+    SparseMatrix
+  });
+  /**
+   * Computes the Cholesky factorization of matrix A. It computes L and P so
+   * L * L' = P * A * P'
+   *
+   * @param {Matrix}  m               The A Matrix to factorize, only upper triangular part used
+   * @param {Object}  s               The symbolic analysis from cs_schol()
+   *
+   * @return {Number}                 The numeric Cholesky factorization of A or null
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+
+  return function csChol(m, s) {
+    // validate input
+    if (!m) {
+      return null;
+    } // m arrays
+
+
+    var size = m._size; // columns
+
+    var n = size[1]; // symbolic analysis result
+
+    var parent = s.parent;
+    var cp = s.cp;
+    var pinv = s.pinv; // L arrays
+
+    var lvalues = [];
+    var lindex = [];
+    var lptr = []; // L
+
+    var L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    }); // vars
+
+    var c = []; // (2 * n)
+
+    var x = []; // (n)
+    // compute C = P * A * P'
+
+    var cm = pinv ? csSymperm(m, pinv, 1) : m; // C matrix arrays
+
+    var cvalues = cm._values;
+    var cindex = cm._index;
+    var cptr = cm._ptr; // vars
+
+    var k, p; // initialize variables
+
+    for (k = 0; k < n; k++) {
+      lptr[k] = c[k] = cp[k];
+    } // compute L(k,:) for L*L' = C
+
+
+    for (k = 0; k < n; k++) {
+      // nonzero pattern of L(k,:)
+      var top = csEreach(cm, k, parent, c); // x (0:k) is now zero
+
+      x[k] = 0; // x = full(triu(C(:,k)))
+
+      for (p = cptr[k]; p < cptr[k + 1]; p++) {
+        if (cindex[p] <= k) {
+          x[cindex[p]] = cvalues[p];
+        }
+      } // d = C(k,k)
+
+
+      var d = x[k]; // clear x for k+1st iteration
+
+      x[k] = 0; // solve L(0:k-1,0:k-1) * x = C(:,k)
+
+      for (; top < n; top++) {
+        // s[top..n-1] is pattern of L(k,:)
+        var i = s[top]; // L(k,i) = x (i) / L(i,i)
+
+        var lki = divideScalar(x[i], lvalues[lptr[i]]); // clear x for k+1st iteration
+
+        x[i] = 0;
+
+        for (p = lptr[i] + 1; p < c[i]; p++) {
+          // row
+          var r = lindex[p]; // update x[r]
+
+          x[r] = subtract(x[r], multiply(lvalues[p], lki));
+        } // d = d - L(k,i)*L(k,i)
+
+
+        d = subtract(d, multiply(lki, conj(lki)));
+        p = c[i]++; // store L(k,i) in column i
+
+        lindex[p] = k;
+        lvalues[p] = conj(lki);
+      } // compute L(k,k)
+
+
+      if (smallerEq(re(d), 0) || !equal(im(d), 0)) {
+        // not pos def
+        return null;
+      }
+
+      p = c[k]++; //  store L(k,k) = sqrt(d) in column k
+
+      lindex[p] = k;
+      lvalues[p] = sqrt(d);
+    } // finalize L
+
+
+    lptr[n] = cp[n]; // P matrix
+
+    var P; // check we need to calculate P
+
+    if (pinv) {
+      // P arrays
+      var pvalues = [];
+      var pindex = [];
+      var pptr = []; // create P matrix
+
+      for (p = 0; p < n; p++) {
+        // initialize ptr (one value per column)
+        pptr[p] = p; // index (apply permutation vector)
+
+        pindex.push(pinv[p]); // value 1
+
+        pvalues.push(1);
+      } // update ptr
+
+
+      pptr[n] = n; // P
+
+      P = new SparseMatrix({
+        values: pvalues,
+        index: pindex,
+        ptr: pptr,
+        size: [n, n]
+      });
+    } // return L & P
+
+
+    return {
+      L: L,
+      P: P
+    };
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js
new file mode 100644
index 0000000..549fd50
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js
@@ -0,0 +1,140 @@
+import { factory } from '../../../utils/factory.js';
+import { csLeaf } from './csLeaf.js';
+var name = 'csCounts';
+var dependencies = ['transpose'];
+export var createCsCounts = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    transpose
+  } = _ref;
+
+  /**
+   * Computes the column counts using the upper triangular part of A.
+   * It transposes A internally, none of the input parameters are modified.
+   *
+   * @param {Matrix} a           The sparse matrix A
+   *
+   * @param {Matrix} ata         Count the columns of A'A instead
+   *
+   * @return                     An array of size n of the column counts or null on error
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function (a, parent, post, ata) {
+    // check inputs
+    if (!a || !parent || !post) {
+      return null;
+    } // a matrix arrays
+
+
+    var asize = a._size; // rows and columns
+
+    var m = asize[0];
+    var n = asize[1]; // variables
+
+    var i, j, k, J, p, p0, p1; // workspace size
+
+    var s = 4 * n + (ata ? n + m + 1 : 0); // allocate workspace
+
+    var w = []; // (s)
+
+    var ancestor = 0; // first n entries
+
+    var maxfirst = n; // next n entries
+
+    var prevleaf = 2 * n; // next n entries
+
+    var first = 3 * n; // next n entries
+
+    var head = 4 * n; // next n + 1 entries (used when ata is true)
+
+    var next = 5 * n + 1; // last entries in workspace
+    // clear workspace w[0..s-1]
+
+    for (k = 0; k < s; k++) {
+      w[k] = -1;
+    } // allocate result
+
+
+    var colcount = []; // (n)
+    // AT = A'
+
+    var at = transpose(a); // at arrays
+
+    var tindex = at._index;
+    var tptr = at._ptr; // find w[first + j]
+
+    for (k = 0; k < n; k++) {
+      j = post[k]; // colcount[j]=1 if j is a leaf
+
+      colcount[j] = w[first + j] === -1 ? 1 : 0;
+
+      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {
+        w[first + j] = k;
+      }
+    } // initialize ata if needed
+
+
+    if (ata) {
+      // invert post
+      for (k = 0; k < n; k++) {
+        w[post[k]] = k;
+      } // loop rows (columns in AT)
+
+
+      for (i = 0; i < m; i++) {
+        // values in column i of AT
+        for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) {
+          k = Math.min(k, w[tindex[p]]);
+        } // place row i in linked list k
+
+
+        w[next + i] = w[head + k];
+        w[head + k] = i;
+      }
+    } // each node in its own set
+
+
+    for (i = 0; i < n; i++) {
+      w[ancestor + i] = i;
+    }
+
+    for (k = 0; k < n; k++) {
+      // j is the kth node in postordered etree
+      j = post[k]; // check j is not a root
+
+      if (parent[j] !== -1) {
+        colcount[parent[j]]--;
+      } // J=j for LL'=A case
+
+
+      for (J = ata ? w[head + k] : j; J !== -1; J = ata ? w[next + J] : -1) {
+        for (p = tptr[J]; p < tptr[J + 1]; p++) {
+          i = tindex[p];
+          var r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor); // check A(i,j) is in skeleton
+
+          if (r.jleaf >= 1) {
+            colcount[j]++;
+          } // check account for overlap in q
+
+
+          if (r.jleaf === 2) {
+            colcount[r.q]--;
+          }
+        }
+      }
+
+      if (parent[j] !== -1) {
+        w[ancestor + j] = parent[j];
+      }
+    } // sum up colcount's of each child
+
+
+    for (j = 0; j < n; j++) {
+      if (parent[j] !== -1) {
+        colcount[parent[j]] += colcount[j];
+      }
+    }
+
+    return colcount;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csCumsum.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCumsum.js
new file mode 100644
index 0000000..951808b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCumsum.js
@@ -0,0 +1,28 @@
+/**
+ * It sets the p[i] equal to the sum of c[0] through c[i-1].
+ *
+ * @param {Array}   ptr             The Sparse Matrix ptr array
+ * @param {Array}   c               The Sparse Matrix ptr array
+ * @param {Number}  n               The number of columns
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csCumsum(ptr, c, n) {
+  // variables
+  var i;
+  var nz = 0;
+
+  for (i = 0; i < n; i++) {
+    // initialize ptr @ i
+    ptr[i] = nz; // increment number of nonzeros
+
+    nz += c[i]; // also copy p[0..n-1] back into c[0..n-1]
+
+    c[i] = ptr[i];
+  } // finalize ptr
+
+
+  ptr[n] = nz; // return sum (c [0..n-1])
+
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js
new file mode 100644
index 0000000..e92dc0a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js
@@ -0,0 +1,79 @@
+import { csMarked } from './csMarked.js';
+import { csMark } from './csMark.js';
+import { csUnflip } from './csUnflip.js';
+/**
+ * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
+ * at nodes in B (see csReach()).
+ *
+ * @param {Number}  j               The starting node for the DFS algorithm
+ * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored
+ * @param {Number}  top             Start index in stack xi[top..n-1]
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+ *
+ * @return {Number}                 New value of top
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+
+export function csDfs(j, g, top, xi, pinv) {
+  // g arrays
+  var index = g._index;
+  var ptr = g._ptr;
+  var size = g._size; // columns
+
+  var n = size[1]; // vars
+
+  var i, p, p2; // initialize head
+
+  var head = 0; // initialize the recursion stack
+
+  xi[0] = j; // loop
+
+  while (head >= 0) {
+    // get j from the top of the recursion stack
+    j = xi[head]; // apply permutation vector
+
+    var jnew = pinv ? pinv[j] : j; // check node j is marked
+
+    if (!csMarked(ptr, j)) {
+      // mark node j as visited
+      csMark(ptr, j); // update stack (last n entries in xi)
+
+      xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew]);
+    } // node j done if no unvisited neighbors
+
+
+    var done = 1; // examine all neighbors of j, stack (last n entries in xi)
+
+    for (p = xi[n + head], p2 = jnew < 0 ? 0 : csUnflip(ptr[jnew + 1]); p < p2; p++) {
+      // consider neighbor node i
+      i = index[p]; // check we have visited node i, skip it
+
+      if (csMarked(ptr, i)) {
+        continue;
+      } // pause depth-first search of node j, update stack (last n entries in xi)
+
+
+      xi[n + head] = p; // start dfs at node i
+
+      xi[++head] = i; // node j is not done
+
+      done = 0; // break, to start dfs(i)
+
+      break;
+    } // check depth-first search at node j is done
+
+
+    if (done) {
+      // remove j from the recursion stack
+      head--; // and place in the output stack
+
+      xi[--top] = j;
+    }
+  }
+
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csEreach.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEreach.js
new file mode 100644
index 0000000..b8df227
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEreach.js
@@ -0,0 +1,66 @@
+import { csMark } from './csMark.js';
+import { csMarked } from './csMarked.js';
+/**
+ * Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k))
+ *
+ * @param {Matrix}  a               The A matrix
+ * @param {Number}  k               The kth column in A
+ * @param {Array}   parent          The parent vector from the symbolic analysis result
+ * @param {Array}   w               The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+
+export function csEreach(a, k, parent, w) {
+  // a arrays
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size; // columns
+
+  var n = asize[1]; // initialize top
+
+  var top = n; // vars
+
+  var p, p0, p1, len; // mark node k as visited
+
+  csMark(w, k); // loop values & index for column k
+
+  for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+    // A(i,k) is nonzero
+    var i = aindex[p]; // only use upper triangular part of A
+
+    if (i > k) {
+      continue;
+    } // traverse up etree
+
+
+    for (len = 0; !csMarked(w, i); i = parent[i]) {
+      // L(k,i) is nonzero, last n entries in w
+      w[n + len++] = i; // mark i as visited
+
+      csMark(w, i);
+    }
+
+    while (len > 0) {
+      // decrement top & len
+      --top;
+      --len; // push path onto stack, last n entries in w
+
+      w[n + top] = w[n + len];
+    }
+  } // unmark all nodes
+
+
+  for (p = top; p < n; p++) {
+    // use stack value, last n entries in w
+    csMark(w, w[n + p]);
+  } // unmark node k
+
+
+  csMark(w, k); // s[top..n-1] contains pattern of L(k,:)
+
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js
new file mode 100644
index 0000000..6a96c7b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js
@@ -0,0 +1,73 @@
+/**
+ * Computes the elimination tree of Matrix A (using triu(A)) or the
+ * elimination tree of A'A without forming A'A.
+ *
+ * @param {Matrix}  a               The A Matrix
+ * @param {boolean} ata             A value of true the function computes the etree of A'A
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csEtree(a, ata) {
+  // check inputs
+  if (!a) {
+    return null;
+  } // a arrays
+
+
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size; // rows & columns
+
+  var m = asize[0];
+  var n = asize[1]; // allocate result
+
+  var parent = []; // (n)
+  // allocate workspace
+
+  var w = []; // (n + (ata ? m : 0))
+
+  var ancestor = 0; // first n entries in w
+
+  var prev = n; // last m entries (ata = true)
+
+  var i, inext; // check we are calculating A'A
+
+  if (ata) {
+    // initialize workspace
+    for (i = 0; i < m; i++) {
+      w[prev + i] = -1;
+    }
+  } // loop columns
+
+
+  for (var k = 0; k < n; k++) {
+    // node k has no parent yet
+    parent[k] = -1; // nor does k have an ancestor
+
+    w[ancestor + k] = -1; // values in column k
+
+    for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+      // row
+      var r = aindex[p]; // node
+
+      i = ata ? w[prev + r] : r; // traverse from i to k
+
+      for (; i !== -1 && i < k; i = inext) {
+        // inext = ancestor of i
+        inext = w[ancestor + i]; // path compression
+
+        w[ancestor + i] = k; // check no anc., parent is k
+
+        if (inext === -1) {
+          parent[i] = k;
+        }
+      }
+
+      if (ata) {
+        w[prev + r] = k;
+      }
+    }
+  }
+
+  return parent;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js
new file mode 100644
index 0000000..5d8dabd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js
@@ -0,0 +1,60 @@
+/**
+ * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
+ *
+ * @param {Matrix}   a              The sparse matrix
+ * @param {function} callback       The callback function, function will be invoked with the following args:
+ *                                    - The entry row
+ *                                    - The entry column
+ *                                    - The entry value
+ *                                    - The state parameter
+ * @param {any}      other          The state
+ *
+ * @return                          The number of nonzero elements in the matrix
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csFkeep(a, callback, other) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size; // columns
+
+  var n = asize[1]; // nonzero items
+
+  var nz = 0; // loop columns
+
+  for (var j = 0; j < n; j++) {
+    // get current location of col j
+    var p = aptr[j]; // record new location of col j
+
+    aptr[j] = nz;
+
+    for (; p < aptr[j + 1]; p++) {
+      // check we need to keep this item
+      if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {
+        // keep A(i,j)
+        aindex[nz] = aindex[p]; // check we need to process values (pattern only)
+
+        if (avalues) {
+          avalues[nz] = avalues[p];
+        } // increment nonzero items
+
+
+        nz++;
+      }
+    }
+  } // finalize A
+
+
+  aptr[n] = nz; // trim arrays
+
+  aindex.splice(nz, aindex.length - nz); // check we need to process values (pattern only)
+
+  if (avalues) {
+    avalues.splice(nz, avalues.length - nz);
+  } // return number of nonzero items
+
+
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js
new file mode 100644
index 0000000..087c9a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js
@@ -0,0 +1,11 @@
+/**
+ * This function "flips" its input about the integer -1.
+ *
+ * @param {Number}  i               The value to flip
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csFlip(i) {
+  // flip the value
+  return -i - 2;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js
new file mode 100644
index 0000000..cf86c59
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js
@@ -0,0 +1,30 @@
+/**
+ * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.
+ *
+ * @param {Array} p           The permutation vector of length n. null value denotes identity
+ * @param {Array} b           The input vector
+ *
+ * @return {Array}            The output vector x = P'b
+ */
+export function csIpvec(p, b) {
+  // vars
+  var k;
+  var n = b.length;
+  var x = []; // check permutation vector was provided, p = null denotes identity
+
+  if (p) {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // apply permutation
+      x[p[k]] = b[k];
+    }
+  } else {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // x[i] = b[i]
+      x[k] = b[k];
+    }
+  }
+
+  return x;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js
new file mode 100644
index 0000000..fb6c4b0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js
@@ -0,0 +1,56 @@
+/**
+ * This function determines if j is a leaf of the ith row subtree.
+ * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)
+ *
+ * @param {Number}  i               The ith row subtree
+ * @param {Number}  j               The node to test
+ * @param {Array}   w               The workspace array
+ * @param {Number}  first           The index offset within the workspace for the first array
+ * @param {Number}  maxfirst        The index offset within the workspace for the maxfirst array
+ * @param {Number}  prevleaf        The index offset within the workspace for the prevleaf array
+ * @param {Number}  ancestor        The index offset within the workspace for the ancestor array
+ *
+ * @return {Object}
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {
+  var s, sparent; // our result
+
+  var jleaf = 0;
+  var q; // check j is a leaf
+
+  if (i <= j || w[first + j] <= w[maxfirst + i]) {
+    return -1;
+  } // update max first[j] seen so far
+
+
+  w[maxfirst + i] = w[first + j]; // jprev = previous leaf of ith subtree
+
+  var jprev = w[prevleaf + i];
+  w[prevleaf + i] = j; // check j is first or subsequent leaf
+
+  if (jprev === -1) {
+    // 1st leaf, q = root of ith subtree
+    jleaf = 1;
+    q = i;
+  } else {
+    // update jleaf
+    jleaf = 2; // q = least common ancester (jprev,j)
+
+    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]) {
+      ;
+    }
+
+    for (s = jprev; s !== q; s = sparent) {
+      // path compression
+      sparent = w[ancestor + s];
+      w[ancestor + s] = q;
+    }
+  }
+
+  return {
+    jleaf: jleaf,
+    q: q
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js
new file mode 100644
index 0000000..a9c45d2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js
@@ -0,0 +1,198 @@
+import { factory } from '../../../utils/factory.js';
+import { createCsSpsolve } from './csSpsolve.js';
+var name = 'csLu';
+var dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+export var createCsLu = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    abs,
+    divideScalar,
+    multiply,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  } = _ref;
+  var csSpsolve = createCsSpsolve({
+    divideScalar,
+    multiply,
+    subtract
+  });
+  /**
+   * Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization
+   * algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L
+   * and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so
+   * L * U = A(p, q), where p is the inverse of pinv.
+   *
+   * @param {Matrix}  m               The A Matrix to factorize
+   * @param {Object}  s               The symbolic analysis from csSqr(). Provides the fill-reducing
+   *                                  column ordering q
+   * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Number}                 The numeric LU factorization of A or null
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+
+  return function csLu(m, s, tol) {
+    // validate input
+    if (!m) {
+      return null;
+    } // m arrays
+
+
+    var size = m._size; // columns
+
+    var n = size[1]; // symbolic analysis result
+
+    var q;
+    var lnz = 100;
+    var unz = 100; // update symbolic analysis parameters
+
+    if (s) {
+      q = s.q;
+      lnz = s.lnz || lnz;
+      unz = s.unz || unz;
+    } // L arrays
+
+
+    var lvalues = []; // (lnz)
+
+    var lindex = []; // (lnz)
+
+    var lptr = []; // (n + 1)
+    // L
+
+    var L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    }); // U arrays
+
+    var uvalues = []; // (unz)
+
+    var uindex = []; // (unz)
+
+    var uptr = []; // (n + 1)
+    // U
+
+    var U = new SparseMatrix({
+      values: uvalues,
+      index: uindex,
+      ptr: uptr,
+      size: [n, n]
+    }); // inverse of permutation vector
+
+    var pinv = []; // (n)
+    // vars
+
+    var i, p; // allocate arrays
+
+    var x = []; // (n)
+
+    var xi = []; // (2 * n)
+    // initialize variables
+
+    for (i = 0; i < n; i++) {
+      // clear workspace
+      x[i] = 0; // no rows pivotal yet
+
+      pinv[i] = -1; // no cols of L yet
+
+      lptr[i + 1] = 0;
+    } // reset number of nonzero elements in L and U
+
+
+    lnz = 0;
+    unz = 0; // compute L(:,k) and U(:,k)
+
+    for (var k = 0; k < n; k++) {
+      // update ptr
+      lptr[k] = lnz;
+      uptr[k] = unz; // apply column permutations if needed
+
+      var col = q ? q[k] : k; // solve triangular system, x = L\A(:,col)
+
+      var top = csSpsolve(L, m, col, xi, x, pinv, 1); // find pivot
+
+      var ipiv = -1;
+      var a = -1; // loop xi[] from top -> n
+
+      for (p = top; p < n; p++) {
+        // x[i] is nonzero
+        i = xi[p]; // check row i is not yet pivotal
+
+        if (pinv[i] < 0) {
+          // absolute value of x[i]
+          var xabs = abs(x[i]); // check absoulte value is greater than pivot value
+
+          if (larger(xabs, a)) {
+            // largest pivot candidate so far
+            a = xabs;
+            ipiv = i;
+          }
+        } else {
+          // x(i) is the entry U(pinv[i],k)
+          uindex[unz] = pinv[i];
+          uvalues[unz++] = x[i];
+        }
+      } // validate we found a valid pivot
+
+
+      if (ipiv === -1 || a <= 0) {
+        return null;
+      } // update actual pivot column, give preference to diagonal value
+
+
+      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {
+        ipiv = col;
+      } // the chosen pivot
+
+
+      var pivot = x[ipiv]; // last entry in U(:,k) is U(k,k)
+
+      uindex[unz] = k;
+      uvalues[unz++] = pivot; // ipiv is the kth pivot row
+
+      pinv[ipiv] = k; // first entry in L(:,k) is L(k,k) = 1
+
+      lindex[lnz] = ipiv;
+      lvalues[lnz++] = 1; // L(k+1:n,k) = x / pivot
+
+      for (p = top; p < n; p++) {
+        // row
+        i = xi[p]; // check x(i) is an entry in L(:,k)
+
+        if (pinv[i] < 0) {
+          // save unpermuted row in L
+          lindex[lnz] = i; // scale pivot column
+
+          lvalues[lnz++] = divideScalar(x[i], pivot);
+        } // x[0..n-1] = 0 for next k
+
+
+        x[i] = 0;
+      }
+    } // update ptr
+
+
+    lptr[n] = lnz;
+    uptr[n] = unz; // fix row indices of L for final pinv
+
+    for (p = 0; p < lnz; p++) {
+      lindex[p] = pinv[lindex[p]];
+    } // trim arrays
+
+
+    lvalues.splice(lnz, lvalues.length - lnz);
+    lindex.splice(lnz, lindex.length - lnz);
+    uvalues.splice(unz, uvalues.length - unz);
+    uindex.splice(unz, uindex.length - unz); // return LU factor
+
+    return {
+      L: L,
+      U: U,
+      pinv: pinv
+    };
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js
new file mode 100644
index 0000000..053df16
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js
@@ -0,0 +1,14 @@
+import { csFlip } from './csFlip.js';
+/**
+ * Marks the node at w[j]
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+
+export function csMark(w, j) {
+  // mark w[j]
+  w[j] = csFlip(w[j]);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js
new file mode 100644
index 0000000..86a02ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js
@@ -0,0 +1,12 @@
+/**
+ * Checks if the node at w[j] is marked
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csMarked(w, j) {
+  // check node is marked
+  return w[j] < 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js
new file mode 100644
index 0000000..845db27
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js
@@ -0,0 +1,63 @@
+/**
+ * Permutes a sparse matrix C = P * A * Q
+ *
+ * @param {SparseMatrix}  a         The Matrix A
+ * @param {Array}   pinv            The row permutation vector
+ * @param {Array}   q               The column permutation vector
+ * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise
+ *
+ * @return {Matrix}                 C = P * A * Q, null on error
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csPermute(a, pinv, q, values) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size;
+  var adt = a._datatype; // rows & columns
+
+  var m = asize[0];
+  var n = asize[1]; // c arrays
+
+  var cvalues = values && a._values ? [] : null;
+  var cindex = []; // (aptr[n])
+
+  var cptr = []; // (n + 1)
+  // initialize vars
+
+  var nz = 0; // loop columns
+
+  for (var k = 0; k < n; k++) {
+    // column k of C is column q[k] of A
+    cptr[k] = nz; // apply column permutation
+
+    var j = q ? q[k] : k; // loop values in column j of A
+
+    for (var t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {
+      // row i of A is row pinv[i] of C
+      var r = pinv ? pinv[aindex[t]] : aindex[t]; // index
+
+      cindex[nz] = r; // check we need to populate values
+
+      if (cvalues) {
+        cvalues[nz] = avalues[t];
+      } // increment number of nonzero elements
+
+
+      nz++;
+    }
+  } // finalize the last column of C
+
+
+  cptr[n] = nz; // return C matrix
+
+  return a.createSparseMatrix({
+    values: cvalues,
+    index: cindex,
+    ptr: cptr,
+    size: [m, n],
+    datatype: adt
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js
new file mode 100644
index 0000000..1ac0d29
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js
@@ -0,0 +1,59 @@
+import { csTdfs } from './csTdfs.js';
+/**
+ * Post order a tree of forest
+ *
+ * @param {Array}   parent          The tree or forest
+ * @param {Number}  n               Number of columns
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+
+export function csPost(parent, n) {
+  // check inputs
+  if (!parent) {
+    return null;
+  } // vars
+
+
+  var k = 0;
+  var j; // allocate result
+
+  var post = []; // (n)
+  // workspace, head: first n entries, next: next n entries, stack: last n entries
+
+  var w = []; // (3 * n)
+
+  var head = 0;
+  var next = n;
+  var stack = 2 * n; // initialize workspace
+
+  for (j = 0; j < n; j++) {
+    // empty linked lists
+    w[head + j] = -1;
+  } // traverse nodes in reverse order
+
+
+  for (j = n - 1; j >= 0; j--) {
+    // check j is a root
+    if (parent[j] === -1) {
+      continue;
+    } // add j to list of its parent
+
+
+    w[next + j] = w[head + parent[j]];
+    w[head + parent[j]] = j;
+  } // loop nodes
+
+
+  for (j = 0; j < n; j++) {
+    // skip j if it is not a root
+    if (parent[j] !== -1) {
+      continue;
+    } // depth-first search
+
+
+    k = csTdfs(j, k, w, head, next, post, stack);
+  }
+
+  return post;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js
new file mode 100644
index 0000000..7bde5f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js
@@ -0,0 +1,52 @@
+import { csMarked } from './csMarked.js';
+import { csMark } from './csMark.js';
+import { csDfs } from './csDfs.js';
+/**
+ * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
+ * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The
+ * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).
+ *
+ * @param {Matrix}  g               The G matrix
+ * @param {Matrix}  b               The B matrix
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+
+export function csReach(g, b, k, xi, pinv) {
+  // g arrays
+  var gptr = g._ptr;
+  var gsize = g._size; // b arrays
+
+  var bindex = b._index;
+  var bptr = b._ptr; // columns
+
+  var n = gsize[1]; // vars
+
+  var p, p0, p1; // initialize top
+
+  var top = n; // loop column indeces in B
+
+  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+    // node i
+    var i = bindex[p]; // check node i is marked
+
+    if (!csMarked(gptr, i)) {
+      // start a dfs at unmarked node i
+      top = csDfs(i, g, top, xi, pinv);
+    }
+  } // loop columns from top -> n - 1
+
+
+  for (p = top; p < n; p++) {
+    // restore G
+    csMark(gptr, xi[p]);
+  }
+
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js
new file mode 100644
index 0000000..039db66
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js
@@ -0,0 +1,88 @@
+import { csReach } from './csReach.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSpsolve';
+var dependencies = ['divideScalar', 'multiply', 'subtract'];
+export var createCsSpsolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    divideScalar,
+    multiply,
+    subtract
+  } = _ref;
+
+  /**
+   * The function csSpsolve() computes the solution to G * x = bk, where bk is the
+   * kth column of B. When lo is true, the function assumes G = L is lower triangular with the
+   * diagonal entry as the first entry in each column. When lo is true, the function assumes G = U
+   * is upper triangular with the diagonal entry as the last entry in each column.
+   *
+   * @param {Matrix}  g               The G matrix
+   * @param {Matrix}  b               The B matrix
+   * @param {Number}  k               The kth column in B
+   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+   *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+   * @param {Array}   x               The soluton to the linear system G * x = b
+   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+   * @param {boolean} lo              The lower (true) upper triangular (false) flag
+   *
+   * @return {Number}                 The index for the nonzero pattern
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function csSpsolve(g, b, k, xi, x, pinv, lo) {
+    // g arrays
+    var gvalues = g._values;
+    var gindex = g._index;
+    var gptr = g._ptr;
+    var gsize = g._size; // columns
+
+    var n = gsize[1]; // b arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr; // vars
+
+    var p, p0, p1, q; // xi[top..n-1] = csReach(B(:,k))
+
+    var top = csReach(g, b, k, xi, pinv); // clear x
+
+    for (p = top; p < n; p++) {
+      x[xi[p]] = 0;
+    } // scatter b
+
+
+    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+      x[bindex[p]] = bvalues[p];
+    } // loop columns
+
+
+    for (var px = top; px < n; px++) {
+      // x array index for px
+      var j = xi[px]; // apply permutation vector (U x = b), j maps to column J of G
+
+      var J = pinv ? pinv[j] : j; // check column J is empty
+
+      if (J < 0) {
+        continue;
+      } // column value indeces in G, p0 <= p < p1
+
+
+      p0 = gptr[J];
+      p1 = gptr[J + 1]; // x(j) /= G(j,j)
+
+      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]); // first entry L(j,j)
+
+      p = lo ? p0 + 1 : p0;
+      q = lo ? p1 : p1 - 1; // loop
+
+      for (; p < q; p++) {
+        // row
+        var i = gindex[p]; // x(i) -= G(i,j) * x(j)
+
+        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));
+      }
+    } // return top of stack
+
+
+    return top;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js
new file mode 100644
index 0000000..01a6f6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js
@@ -0,0 +1,195 @@
+import { csPermute } from './csPermute.js';
+import { csPost } from './csPost.js';
+import { csEtree } from './csEtree.js';
+import { createCsAmd } from './csAmd.js';
+import { createCsCounts } from './csCounts.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSqr';
+var dependencies = ['add', 'multiply', 'transpose'];
+export var createCsSqr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    add,
+    multiply,
+    transpose
+  } = _ref;
+  var csAmd = createCsAmd({
+    add,
+    multiply,
+    transpose
+  });
+  var csCounts = createCsCounts({
+    transpose
+  });
+  /**
+   * Symbolic ordering and analysis for QR and LU decompositions.
+   *
+   * @param {Number}  order           The ordering strategy (see csAmd for more details)
+   * @param {Matrix}  a               The A matrix
+   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or
+   *                                  symbolic ordering and analysis for LU decomposition (false)
+   *
+   * @return {Object}                 The Symbolic ordering and analysis for matrix A
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+
+  return function csSqr(order, a, qr) {
+    // a arrays
+    var aptr = a._ptr;
+    var asize = a._size; // columns
+
+    var n = asize[1]; // vars
+
+    var k; // symbolic analysis result
+
+    var s = {}; // fill-reducing ordering
+
+    s.q = csAmd(order, a); // validate results
+
+    if (order && !s.q) {
+      return null;
+    } // QR symbolic analysis
+
+
+    if (qr) {
+      // apply permutations if needed
+      var c = order ? csPermute(a, null, s.q, 0) : a; // etree of C'*C, where C=A(:,q)
+
+      s.parent = csEtree(c, 1); // post order elimination tree
+
+      var post = csPost(s.parent, n); // col counts chol(C'*C)
+
+      s.cp = csCounts(c, s.parent, post, 1); // check we have everything needed to calculate number of nonzero elements
+
+      if (c && s.parent && s.cp && _vcount(c, s)) {
+        // calculate number of nonzero elements
+        for (s.unz = 0, k = 0; k < n; k++) {
+          s.unz += s.cp[k];
+        }
+      }
+    } else {
+      // for LU factorization only, guess nnz(L) and nnz(U)
+      s.unz = 4 * aptr[n] + n;
+      s.lnz = s.unz;
+    } // return result S
+
+
+    return s;
+  };
+  /**
+   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent
+   */
+
+  function _vcount(a, s) {
+    // a arrays
+    var aptr = a._ptr;
+    var aindex = a._index;
+    var asize = a._size; // rows & columns
+
+    var m = asize[0];
+    var n = asize[1]; // initialize s arrays
+
+    s.pinv = []; // (m + n)
+
+    s.leftmost = []; // (m)
+    // vars
+
+    var parent = s.parent;
+    var pinv = s.pinv;
+    var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries
+
+    var w = []; // (m + 3 * n)
+
+    var next = 0;
+    var head = m;
+    var tail = m + n;
+    var nque = m + 2 * n; // vars
+
+    var i, k, p, p0, p1; // initialize w
+
+    for (k = 0; k < n; k++) {
+      // queue k is empty
+      w[head + k] = -1;
+      w[tail + k] = -1;
+      w[nque + k] = 0;
+    } // initialize row arrays
+
+
+    for (i = 0; i < m; i++) {
+      leftmost[i] = -1;
+    } // loop columns backwards
+
+
+    for (k = n - 1; k >= 0; k--) {
+      // values & index for column k
+      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+        // leftmost[i] = min(find(A(i,:)))
+        leftmost[aindex[p]] = k;
+      }
+    } // scan rows in reverse order
+
+
+    for (i = m - 1; i >= 0; i--) {
+      // row i is not yet ordered
+      pinv[i] = -1;
+      k = leftmost[i]; // check row i is empty
+
+      if (k === -1) {
+        continue;
+      } // first row in queue k
+
+
+      if (w[nque + k]++ === 0) {
+        w[tail + k] = i;
+      } // put i at head of queue k
+
+
+      w[next + i] = w[head + k];
+      w[head + k] = i;
+    }
+
+    s.lnz = 0;
+    s.m2 = m; // find row permutation and nnz(V)
+
+    for (k = 0; k < n; k++) {
+      // remove row i from queue k
+      i = w[head + k]; // count V(k,k) as nonzero
+
+      s.lnz++; // add a fictitious row
+
+      if (i < 0) {
+        i = s.m2++;
+      } // associate row i with V(:,k)
+
+
+      pinv[i] = k; // skip if V(k+1:m,k) is empty
+
+      if (--nque[k] <= 0) {
+        continue;
+      } // nque[k] is nnz (V(k+1:m,k))
+
+
+      s.lnz += w[nque + k]; // move all rows to parent of k
+
+      var pa = parent[k];
+
+      if (pa !== -1) {
+        if (w[nque + pa] === 0) {
+          w[tail + pa] = w[tail + k];
+        }
+
+        w[next + w[tail + k]] = w[head + pa];
+        w[head + pa] = w[next + i];
+        w[nque + pa] += w[nque + k];
+      }
+    }
+
+    for (i = 0; i < m; i++) {
+      if (pinv[i] < 0) {
+        pinv[i] = k++;
+      }
+    }
+
+    return true;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csSymperm.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSymperm.js
new file mode 100644
index 0000000..8c7633d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSymperm.js
@@ -0,0 +1,100 @@
+import { csCumsum } from './csCumsum.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSymperm';
+var dependencies = ['conj', 'SparseMatrix'];
+export var createCsSymperm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    conj,
+    SparseMatrix
+  } = _ref;
+
+  /**
+   * Computes the symmetric permutation of matrix A accessing only
+   * the upper triangular part of A.
+   *
+   * C = P * A * P'
+   *
+   * @param {Matrix}  a               The A matrix
+   * @param {Array}   pinv            The inverse of permutation vector
+   * @param {boolean} values          Process matrix values (true)
+   *
+   * @return {Matrix}                 The C matrix, C = P * A * P'
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function csSymperm(a, pinv, values) {
+    // A matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size; // columns
+
+    var n = asize[1]; // C matrix arrays
+
+    var cvalues = values && avalues ? [] : null;
+    var cindex = []; // (nz)
+
+    var cptr = []; // (n + 1)
+    // variables
+
+    var i, i2, j, j2, p, p0, p1; // create workspace vector
+
+    var w = []; // (n)
+    // count entries in each column of C
+
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j; // loop values in column j
+
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p]; // skip lower triangular part of A
+
+        if (i > j) {
+          continue;
+        } // row i of A is row i2 of C
+
+
+        i2 = pinv ? pinv[i] : i; // column count of C
+
+        w[Math.max(i2, j2)]++;
+      }
+    } // compute column pointers of C
+
+
+    csCumsum(cptr, w, n); // loop columns
+
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j; // loop values in column j
+
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p]; // skip lower triangular part of A
+
+        if (i > j) {
+          continue;
+        } // row i of A is row i2 of C
+
+
+        i2 = pinv ? pinv[i] : i; // C index for column j2
+
+        var q = w[Math.max(i2, j2)]++; // update C index for entry q
+
+        cindex[q] = Math.min(i2, j2); // check we need to process values
+
+        if (cvalues) {
+          cvalues[q] = i2 <= j2 ? avalues[p] : conj(avalues[p]);
+        }
+      }
+    } // return C matrix
+
+
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [n, n]
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js
new file mode 100644
index 0000000..9beda10
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js
@@ -0,0 +1,42 @@
+/**
+ * Depth-first search and postorder of a tree rooted at node j
+ *
+ * @param {Number}  j               The tree node
+ * @param {Number}  k
+ * @param {Array}   w               The workspace array
+ * @param {Number}  head            The index offset within the workspace for the head array
+ * @param {Number}  next            The index offset within the workspace for the next array
+ * @param {Array}   post            The post ordering array
+ * @param {Number}  stack           The index offset within the workspace for the stack array
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csTdfs(j, k, w, head, next, post, stack) {
+  // variables
+  var top = 0; // place j on the stack
+
+  w[stack] = j; // while (stack is not empty)
+
+  while (top >= 0) {
+    // p = top of stack
+    var p = w[stack + top]; // i = youngest child of p
+
+    var i = w[head + p];
+
+    if (i === -1) {
+      // p has no unordered children left
+      top--; // node p is the kth postordered node
+
+      post[k++] = p;
+    } else {
+      // remove i from children of p
+      w[head + p] = w[next + i]; // increment top
+
+      ++top; // start dfs on child node i
+
+      w[stack + top] = i;
+    }
+  }
+
+  return k;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js
new file mode 100644
index 0000000..c093fe3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js
@@ -0,0 +1,13 @@
+import { csFlip } from './csFlip.js';
+/**
+ * Flips the value if it is negative of returns the same value otherwise.
+ *
+ * @param {Number}  i               The value to flip
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+
+export function csUnflip(i) {
+  // flip the value if it is negative
+  return i < 0 ? csFlip(i) : i;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..4a1f1ac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js
@@ -0,0 +1,80 @@
+import { isConstantNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'symbolicEqual';
+var dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];
+export var createSymbolicEqual = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    parse,
+    simplify,
+    typed,
+    OperatorNode
+  } = _ref;
+
+  /**
+   * Attempts to determine if two expressions are symbolically equal, i.e.
+   * one is the result of valid algebraic manipulations on the other.
+   * Currently, this simply checks if the difference of the two expressions
+   * simplifies down to 0. So there are two important caveats:
+   * 1. whether two expressions are symbolically equal depends on the
+   *     manipulations allowed. Therefore, this function takes an optional
+   *     third argument, which are the options that control the behavior
+   *     as documented for the `simplify()` function.
+   * 2. it is in general intractable to find the minimal simplification of
+   *     an arbitrarily complicated expression. So while a `true` value
+   *     of `symbolicEqual` ensures that the two expressions can be manipulated
+   *     to match each other, a `false` value does not absolutely rule this out.
+   *
+   * Syntax:
+   *
+   *    symbolicEqual(expr1, expr2)
+   *    symbolicEqual(expr1, expr2, options)
+   *
+   * Examples:
+   *
+   *    symbolicEqual('x*y', 'y*x') // true
+   *    symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}})
+   *        //false
+   *    symbolicEqual('x/y', '(y*x^(-1))^(-1)') // true
+   *    symbolicEqual('abs(x)','x') // false
+   *    symbolicEqual('abs(x)','x', simplify.positiveContext) // true
+   *
+   * See also:
+   *
+   *    simplify, evaluate
+   *
+   * @param {Node|string} expr1  The first expression to compare
+   * @param {Node|string} expr2  The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean}
+   *     Returns true if a valid manipulation making the expressions equal
+   *     is found.
+   */
+  return typed(name, {
+    'string, string': function stringString(s1, s2) {
+      return this(parse(s1), parse(s2), {});
+    },
+    'string, string, Object': function stringStringObject(s1, s2, options) {
+      return this(parse(s1), parse(s2), options);
+    },
+    'Node, string': function NodeString(e1, s2) {
+      return this(e1, parse(s2), {});
+    },
+    'Node, string, Object': function NodeStringObject(e1, s2, options) {
+      return this(e1, parse(s2), options);
+    },
+    'string, Node': function stringNode(s1, e2) {
+      return this(parse(s1), e2, {});
+    },
+    'string, Node, Object': function stringNodeObject(s1, e2, options) {
+      return this(parse(s1), e2, options);
+    },
+    'Node, Node': function NodeNode(e1, e2) {
+      return this(e1, e2, {});
+    },
+    'Node, Node, Object': function NodeNodeObject(e1, e2, options) {
+      var diff = new OperatorNode('-', 'subtract', [e1, e2]);
+      var simplified = simplify(diff, {}, options);
+      return isConstantNode(simplified) && !simplified.value;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/abs.js b/node_modules/mathjs/lib/esm/function/arithmetic/abs.js
new file mode 100644
index 0000000..3190b01
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/abs.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { absNumber } from '../../plain/number/index.js';
+var name = 'abs';
+var dependencies = ['typed'];
+export var createAbs = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the absolute value of a number. For matrices, the function is
+   * evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.abs(x)
+   *
+   * Examples:
+   *
+   *    math.abs(3.5)                // returns number 3.5
+   *    math.abs(-4.2)               // returns number 4.2
+   *
+   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]
+   *
+   * See also:
+   *
+   *    sign
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            A number or matrix for which to get the absolute value
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
+   *            Absolute value of `x`
+   */
+  return typed(name, {
+    number: absNumber,
+    Complex: function Complex(x) {
+      return x.abs();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.abs();
+    },
+    Fraction: function Fraction(x) {
+      return x.abs();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since abs(0) = 0
+      return deepMap(x, this, true);
+    },
+    Unit: function Unit(x) {
+      return x.abs();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/add.js b/node_modules/mathjs/lib/esm/function/arithmetic/add.js
new file mode 100644
index 0000000..32713b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/add.js
@@ -0,0 +1,128 @@
+import { factory } from '../../utils/factory.js';
+import { extend } from '../../utils/object.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'add';
+var dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];
+export var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    addScalar,
+    equalScalar,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm04 = createAlgorithm04({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Add two or more values, `x + y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.add(x, y)
+   *    math.add(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.add(2, 3)               // returns number 5
+   *    math.add(2, 3, 4)            // returns number 9
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(-4, 1)
+   *    math.add(a, b)               // returns Complex -2 + 4i
+   *
+   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   *    const c = math.unit('5 cm')
+   *    const d = math.unit('2.1 mm')
+   *    math.add(c, d)               // returns Unit 52.1 mm
+   *
+   *    math.add("2.3", "4")         // returns number 6.3
+   *
+   * See also:
+   *
+   *    subtract, sum
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
+   */
+
+  return typed(name, extend({
+    // we extend the signatures of addScalar with signatures dealing with matrices
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, addScalar);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, addScalar, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm01(y, x, addScalar, true);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm04(x, y, addScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, addScalar, false);
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm10(x, y, addScalar, false);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, addScalar, true);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm10(y, x, addScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, addScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, addScalar, true).valueOf();
+    },
+    'any, any': addScalar,
+    'any, any, ...any': function anyAnyAny(x, y, rest) {
+      var result = this(x, y);
+
+      for (var i = 0; i < rest.length; i++) {
+        result = this(result, rest[i]);
+      }
+
+      return result;
+    }
+  }, addScalar.signatures));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js b/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js
new file mode 100644
index 0000000..dd4cadd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js
@@ -0,0 +1,43 @@
+import { factory } from '../../utils/factory.js';
+import { addNumber } from '../../plain/number/index.js';
+var name = 'addScalar';
+var dependencies = ['typed'];
+export var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Add two scalar values, `x + y`.
+   * This function is meant for internal use: it is used by the public function
+   * `add`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add
+   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add
+   * @return {number | BigNumber | Fraction | Complex | Unit}     Sum of `x` and `y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': addNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.add(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.plus(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.add(y);
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value');
+      if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value');
+      if (!x.equalBase(y)) throw new Error('Units do not match');
+      var res = x.clone();
+      res.value = this(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..78924eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js
@@ -0,0 +1,141 @@
+import { factory } from '../../utils/factory.js';
+import { isBigNumber, isComplex, isFraction } from '../../utils/is.js';
+import { deepMap } from '../../utils/collection.js';
+import { cbrtNumber } from '../../plain/number/index.js';
+var name = 'cbrt';
+var dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];
+export var createCbrt = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    isNegative,
+    unaryMinus,
+    matrix,
+    Complex,
+    BigNumber,
+    Fraction
+  } = _ref;
+
+  /**
+   * Calculate the cubic root of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cbrt(x)
+   *    math.cbrt(x, allRoots)
+   *
+   * Examples:
+   *
+   *    math.cbrt(27)                  // returns 3
+   *    math.cube(3)                   // returns 27
+   *    math.cbrt(-64)                 // returns -4
+   *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m
+   *    math.cbrt([27, 64, 125])       // returns [3, 4, 5]
+   *
+   *    const x = math.complex('8i')
+   *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i
+   *    math.cbrt(x, true)             // returns Matrix [
+   *                                    //    1.7320508075689 + i
+   *                                    //   -1.7320508075689 + i
+   *                                    //   -2i
+   *                                    // ]
+   *
+   * See also:
+   *
+   *    square, sqrt, cube
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x
+   *            Value for which to calculate the cubic root.
+   * @param {boolean} [allRoots]  Optional, false by default. Only applicable
+   *            when `x` is a number or complex number. If true, all complex
+   *            roots are returned, if false (default) the principal root is
+   *            returned.
+   * @return {number | BigNumber | Complex | Unit | Array | Matrix}
+   *            Returns the cubic root of `x`
+   */
+  return typed(name, {
+    number: cbrtNumber,
+    // note: signature 'number, boolean' is also supported,
+    //       created by typed as it knows how to convert number to Complex
+    Complex: _cbrtComplex,
+    'Complex, boolean': _cbrtComplex,
+    BigNumber: function BigNumber(x) {
+      return x.cbrt();
+    },
+    Unit: _cbrtUnit,
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since cbrt(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+  /**
+   * Calculate the cubic root for a complex number
+   * @param {Complex} x
+   * @param {boolean} [allRoots]   If true, the function will return an array
+   *                               with all three roots. If false or undefined,
+   *                               the principal root is returned.
+   * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x
+   * @private
+   */
+
+  function _cbrtComplex(x, allRoots) {
+    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers
+    var arg3 = x.arg() / 3;
+    var abs = x.abs(); // principal root:
+
+    var principal = new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp());
+
+    if (allRoots) {
+      var all = [principal, new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())];
+      return config.matrix === 'Array' ? all : matrix(all);
+    } else {
+      return principal;
+    }
+  }
+  /**
+   * Calculate the cubic root for a Unit
+   * @param {Unit} x
+   * @return {Unit} Returns the cubic root of x
+   * @private
+   */
+
+
+  function _cbrtUnit(x) {
+    if (x.value && isComplex(x.value)) {
+      var result = x.clone();
+      result.value = 1.0;
+      result = result.pow(1.0 / 3); // Compute the units
+
+      result.value = _cbrtComplex(x.value); // Compute the value
+
+      return result;
+    } else {
+      var negate = isNegative(x.value);
+
+      if (negate) {
+        x.value = unaryMinus(x.value);
+      } // TODO: create a helper function for this
+
+
+      var third;
+
+      if (isBigNumber(x.value)) {
+        third = new BigNumber(1).div(3);
+      } else if (isFraction(x.value)) {
+        third = new Fraction(1, 3);
+      } else {
+        third = 1 / 3;
+      }
+
+      var _result = x.pow(third);
+
+      if (negate) {
+        _result.value = unaryMinus(_result.value);
+      }
+
+      return _result;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/ceil.js b/node_modules/mathjs/lib/esm/function/arithmetic/ceil.js
new file mode 100644
index 0000000..276df9d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/ceil.js
@@ -0,0 +1,127 @@
+import Decimal from 'decimal.js';
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { ceilNumber } from '../../plain/number/index.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'ceil';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];
+export var createCeil = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar
+  } = _ref;
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Round a value towards plus infinity
+   * If `x` is complex, both real and imaginary part are rounded towards plus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.ceil(x)
+   *    math.ceil(x, n)
+   *
+   * Examples:
+   *
+   *    math.ceil(3.2)               // returns number 4
+   *    math.ceil(3.8)               // returns number 4
+   *    math.ceil(-4.2)              // returns number -4
+   *    math.ceil(-4.7)              // returns number -4
+   *
+   *    math.ceil(3.212, 2)          // returns number 3.22
+   *    math.ceil(3.288, 2)          // returns number 3.29
+   *    math.ceil(-4.212, 2)         // returns number -4.21
+   *    math.ceil(-4.782, 2)         // returns number -4.78
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.ceil(c)                 // returns Complex 4 - 2i
+   *    math.ceil(c, 1)              // returns Complex 3.3 - 2.7i
+   *
+   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]
+   *    math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]
+   *
+   * See also:
+   *
+   *    floor, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
+   */
+
+  return typed('ceil', {
+    number: function number(x) {
+      if (nearlyEqual(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return ceilNumber(x);
+      }
+    },
+    'number, number': function numberNumber(x, n) {
+      if (nearlyEqual(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        var [number, exponent] = "".concat(x, "e").split('e');
+        var result = Math.ceil(Number("".concat(number, "e").concat(Number(exponent) + n)));
+        [number, exponent] = "".concat(result, "e").split('e');
+        return Number("".concat(number, "e").concat(Number(exponent) - n));
+      }
+    },
+    Complex: function Complex(x) {
+      return x.ceil();
+    },
+    'Complex, number': function ComplexNumber(x, n) {
+      return x.ceil(n);
+    },
+    BigNumber: function BigNumber(x) {
+      if (bigNearlyEqual(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return x.ceil();
+      }
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {
+      if (bigNearlyEqual(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        return x.toDecimalPlaces(n.toNumber(), Decimal.ROUND_CEIL);
+      }
+    },
+    Fraction: function Fraction(x) {
+      return x.ceil();
+    },
+    'Fraction, number': function FractionNumber(x, n) {
+      return x.ceil(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return deepMap(x, this, true);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return deepMap(x, i => this(i, n), true);
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/cube.js b/node_modules/mathjs/lib/esm/function/arithmetic/cube.js
new file mode 100644
index 0000000..7550dbd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/cube.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { cubeNumber } from '../../plain/number/index.js';
+var name = 'cube';
+var dependencies = ['typed'];
+export var createCube = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Compute the cube of a value, `x * x * x`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cube(x)
+   *
+   * Examples:
+   *
+   *    math.cube(2)            // returns number 8
+   *    math.pow(2, 3)          // returns number 8
+   *    math.cube(4)            // returns number 64
+   *    4 * 4 * 4               // returns number 64
+   *
+   *    math.cube([1, 2, 3, 4]) // returns Array [1, 8, 27, 64]
+   *
+   * See also:
+   *
+   *    multiply, square, pow, cbrt
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x  Number for which to calculate the cube
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} Cube of x
+   */
+  return typed(name, {
+    number: cubeNumber,
+    Complex: function Complex(x) {
+      return x.mul(x).mul(x); // Is faster than pow(x, 3)
+    },
+    BigNumber: function BigNumber(x) {
+      return x.times(x).times(x);
+    },
+    Fraction: function Fraction(x) {
+      return x.pow(3); // Is faster than mul()mul()mul()
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since cube(0) = 0
+      return deepMap(x, this, true);
+    },
+    Unit: function Unit(x) {
+      return x.pow(3);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/divide.js b/node_modules/mathjs/lib/esm/function/arithmetic/divide.js
new file mode 100644
index 0000000..ac082a4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/divide.js
@@ -0,0 +1,78 @@
+import { factory } from '../../utils/factory.js';
+import { extend } from '../../utils/object.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'divide';
+var dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];
+export var createDivide = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    multiply,
+    equalScalar,
+    divideScalar,
+    inv
+  } = _ref;
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Divide two values, `x / y`.
+   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.
+   *
+   * Syntax:
+   *
+   *    math.divide(x, y)
+   *
+   * Examples:
+   *
+   *    math.divide(2, 3)            // returns number 0.6666666666666666
+   *
+   *    const a = math.complex(5, 14)
+   *    const b = math.complex(4, 1)
+   *    math.divide(a, b)            // returns Complex 2 + 3i
+   *
+   *    const c = [[7, -6], [13, -4]]
+   *    const d = [[1, 2], [4, 3]]
+   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]
+   *
+   *    const e = math.unit('18 km')
+   *    math.divide(e, 4.5)          // returns Unit 4 km
+   *
+   * See also:
+   *
+   *    multiply
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x   Numerator
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} y          Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`
+   */
+
+  return typed('divide', extend({
+    // we extend the signatures of divideScalar with signatures dealing with matrices
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(x, y) {
+      // TODO: implement matrix right division using pseudo inverse
+      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html
+      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html
+      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour
+      return multiply(x, inv(y));
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, divideScalar, false);
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, divideScalar, false);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, divideScalar, false).valueOf();
+    },
+    'any, Array | Matrix': function anyArrayMatrix(x, y) {
+      return multiply(x, inv(y));
+    }
+  }, divideScalar.signatures));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js b/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js
new file mode 100644
index 0000000..964df16
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js
@@ -0,0 +1,55 @@
+import { factory } from '../../utils/factory.js';
+import { typeOf } from '../../utils/is.js';
+var name = 'divideScalar';
+var dependencies = ['typed', 'numeric'];
+export var createDivideScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    numeric
+  } = _ref;
+
+  /**
+   * Divide two scalar values, `x / y`.
+   * This function is meant for internal use: it is used by the public functions
+   * `divide` and `inv`.
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit} x   Numerator
+   * @param  {number | BigNumber | Fraction | Complex} y          Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit}     Quotient, `x / y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x / y;
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.div(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.div(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.div(y);
+    },
+    'Unit, number | Fraction | BigNumber': function UnitNumberFractionBigNumber(x, y) {
+      var res = x.clone(); // TODO: move the divide function to Unit.js, it uses internals of Unit
+
+      var one = numeric(1, typeOf(y));
+      res.value = this(res.value === null ? res._normalize(one) : res.value, y);
+      return res;
+    },
+    'number | Fraction | BigNumber, Unit': function numberFractionBigNumberUnit(x, y) {
+      var res = y.clone();
+      res = res.pow(-1); // TODO: move the divide function to Unit.js, it uses internals of Unit
+
+      var one = numeric(1, typeOf(x));
+      res.value = this(x, y.value === null ? y._normalize(one) : y.value);
+      return res;
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return x.divide(y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..504d0eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js
@@ -0,0 +1,118 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'dotDivide';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix'];
+export var createDotDivide = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    divideScalar,
+    DenseMatrix
+  } = _ref;
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Divide two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotDivide(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotDivide(2, 4)   // returns 0.5
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]
+   *    math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]
+   *
+   * See also:
+   *
+   *    divide, multiply, dotMultiply
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Quotient, `x ./ y`
+   */
+
+  return typed(name, {
+    'any, any': divideScalar,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, divideScalar, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, divideScalar, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, divideScalar, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, divideScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, divideScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, divideScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, divideScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, divideScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, divideScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, divideScalar, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..7de1d27
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js
@@ -0,0 +1,108 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm09 } from '../../type/matrix/utils/algorithm09.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'dotMultiply';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar'];
+export var createDotMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    multiplyScalar
+  } = _ref;
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm09 = createAlgorithm09({
+    typed,
+    equalScalar
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Multiply two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotMultiply(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotMultiply(2, 4) // returns 8
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]
+   *    math.multiply(a, b)    // returns [[52, 28], [23, 14]]
+   *
+   * See also:
+   *
+   *    multiply, divide, dotDivide
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Multiplication of `x` and `y`
+   */
+
+  return typed(name, {
+    'any, any': multiplyScalar,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm09(x, y, multiplyScalar, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, multiplyScalar, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, multiplyScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, multiplyScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm11(y, x, multiplyScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, multiplyScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..4ac0897
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js
@@ -0,0 +1,110 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'dotPow';
+var dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix'];
+export var createDotPow = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar,
+    matrix,
+    pow,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Calculates the power of x to y element wise.
+   *
+   * Syntax:
+   *
+   *    math.dotPow(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotPow(2, 3)            // returns number 8
+   *
+   *    const a = [[1, 2], [4, 3]]
+   *    math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]
+   *    math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   * See also:
+   *
+   *    pow, sqrt, multiply
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y  The exponent
+   * @return {number | BigNumber | Complex | Unit | Array | Matrix}                     The value of `x` to the power `y`
+   */
+
+  return typed(name, {
+    'any, any': pow,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, pow, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, pow, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, pow, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, pow);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/exp.js b/node_modules/mathjs/lib/esm/function/arithmetic/exp.js
new file mode 100644
index 0000000..3244ac9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/exp.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { expNumber } from '../../plain/number/index.js';
+var name = 'exp';
+var dependencies = ['typed'];
+export var createExp = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the exponent of a value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.exp(x)
+   *
+   * Examples:
+   *
+   *    math.exp(2)                  // returns number 7.3890560989306495
+   *    math.pow(math.e, 2)          // returns number 7.3890560989306495
+   *    math.log(math.exp(2))        // returns number 2
+   *
+   *    math.exp([1, 2, 3])
+   *    // returns Array [
+   *    //   2.718281828459045,
+   *    //   7.3890560989306495,
+   *    //   20.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    expm1, log, pow
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to exponentiate
+   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`
+   */
+  return typed(name, {
+    number: expNumber,
+    Complex: function Complex(x) {
+      return x.exp();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.exp();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // TODO: exp(sparse) should return a dense matrix since exp(0)==1
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/expm1.js b/node_modules/mathjs/lib/esm/function/arithmetic/expm1.js
new file mode 100644
index 0000000..28b53c5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/expm1.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { expm1Number } from '../../plain/number/index.js';
+var name = 'expm1';
+var dependencies = ['typed', 'Complex'];
+export var createExpm1 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Complex: _Complex
+  } = _ref;
+
+  /**
+   * Calculate the value of subtracting 1 from the exponential value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.expm1(x)
+   *
+   * Examples:
+   *
+   *    math.expm1(2)                      // returns number 6.38905609893065
+   *    math.pow(math.e, 2) - 1            // returns number 6.3890560989306495
+   *    math.log(math.expm1(2) + 1)        // returns number 2
+   *
+   *    math.expm1([1, 2, 3])
+   *    // returns Array [
+   *    //   1.718281828459045,
+   *    //   6.3890560989306495,
+   *    //   19.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    exp, log, pow
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to apply expm1
+   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`
+   */
+  return typed(name, {
+    number: expm1Number,
+    Complex: function Complex(x) {
+      var r = Math.exp(x.re);
+      return new _Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));
+    },
+    BigNumber: function BigNumber(x) {
+      return x.exp().minus(1);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/fix.js b/node_modules/mathjs/lib/esm/function/arithmetic/fix.js
new file mode 100644
index 0000000..c6596a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/fix.js
@@ -0,0 +1,91 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'fix';
+var dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor'];
+export var createFix = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Complex: _Complex,
+    matrix,
+    ceil,
+    floor
+  } = _ref;
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Round a value towards zero.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.fix(x)
+   *
+   * Examples:
+   *
+   *    math.fix(3.2)                // returns number 3
+   *    math.fix(3.8)                // returns number 3
+   *    math.fix(-4.2)               // returns number -4
+   *    math.fix(-4.7)               // returns number -4
+   *
+   *    math.fix(3.12, 1)                // returns number 3.1
+   *    math.fix(3.18, 1)                // returns number 3.1
+   *    math.fix(-4.12, 1)               // returns number -4.1
+   *    math.fix(-4.17, 1)               // returns number -4.1
+   *
+   *    const c = math.complex(3.22, -2.78)
+   *    math.fix(c)                  // returns Complex 3 - 2i
+   *    math.fix(c, 1)               // returns Complex 3.2 - 2.7i
+   *
+   *    math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]
+   *    math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]
+   *
+   * See also:
+   *
+   *    ceil, floor, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x    Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                             Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix}     Rounded value
+   */
+
+  return typed('fix', {
+    number: function number(x) {
+      return x > 0 ? floor(x) : ceil(x);
+    },
+    'number, number | BigNumber': function numberNumberBigNumber(x, n) {
+      return x > 0 ? floor(x, n) : ceil(x, n);
+    },
+    Complex: function Complex(x) {
+      return new _Complex(x.re > 0 ? Math.floor(x.re) : Math.ceil(x.re), x.im > 0 ? Math.floor(x.im) : Math.ceil(x.im));
+    },
+    'Complex, number | BigNumber': function ComplexNumberBigNumber(x, n) {
+      return new _Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));
+    },
+    BigNumber: function BigNumber(x) {
+      return x.isNegative() ? ceil(x) : floor(x);
+    },
+    'BigNumber, number | BigNumber': function BigNumberNumberBigNumber(x, n) {
+      return x.isNegative() ? ceil(x, n) : floor(x, n);
+    },
+    Fraction: function Fraction(x) {
+      return x.s < 0 ? x.ceil() : x.floor();
+    },
+    'Fraction, number | BigNumber': function FractionNumberBigNumber(x, n) {
+      return x.s < 0 ? x.ceil(n) : x.floor(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since fix(0) = 0
+      return deepMap(x, this, true);
+    },
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(x, n) {
+      // deep map collection, skip zeros since fix(0) = 0
+      return deepMap(x, i => this(i, n), true);
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/floor.js b/node_modules/mathjs/lib/esm/function/arithmetic/floor.js
new file mode 100644
index 0000000..e89e375
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/floor.js
@@ -0,0 +1,125 @@
+import Decimal from 'decimal.js';
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'floor';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];
+export var createFloor = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar
+  } = _ref;
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Round a value towards minus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.floor(x)
+   *    math.floor(x, n)
+   *
+   * Examples:
+   *
+   *    math.floor(3.2)              // returns number 3
+   *    math.floor(3.8)              // returns number 3
+   *    math.floor(-4.2)             // returns number -5
+   *    math.floor(-4.7)             // returns number -5
+   *
+   *    math.floor(3.212, 2)          // returns number 3.21
+   *    math.floor(3.288, 2)          // returns number 3.28
+   *    math.floor(-4.212, 2)         // returns number -4.22
+   *    math.floor(-4.782, 2)         // returns number -4.79
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.floor(c)                 // returns Complex 3 - 3i
+   *    math.floor(c, 1)              // returns Complex 3.2 - 2.8i
+   *
+   *    math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]
+   *    math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]
+   *
+   * See also:
+   *
+   *    ceil, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
+   */
+
+  return typed('floor', {
+    number: function number(x) {
+      if (nearlyEqual(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return Math.floor(x);
+      }
+    },
+    'number, number': function numberNumber(x, n) {
+      if (nearlyEqual(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        var [number, exponent] = "".concat(x, "e").split('e');
+        var result = Math.floor(Number("".concat(number, "e").concat(Number(exponent) + n)));
+        [number, exponent] = "".concat(result, "e").split('e');
+        return Number("".concat(number, "e").concat(Number(exponent) - n));
+      }
+    },
+    Complex: function Complex(x) {
+      return x.floor();
+    },
+    'Complex, number': function ComplexNumber(x, n) {
+      return x.floor(n);
+    },
+    BigNumber: function BigNumber(x) {
+      if (bigNearlyEqual(x, round(x), config.epsilon)) {
+        return round(x);
+      } else {
+        return x.floor();
+      }
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {
+      if (bigNearlyEqual(x, round(x, n), config.epsilon)) {
+        return round(x, n);
+      } else {
+        return x.toDecimalPlaces(n.toNumber(), Decimal.ROUND_FLOOR);
+      }
+    },
+    Fraction: function Fraction(x) {
+      return x.floor();
+    },
+    'Fraction, number': function FractionNumber(x, n) {
+      return x.floor(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since floor(0) = 0
+      return deepMap(x, this, true);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return deepMap(x, i => this(i, n), true);
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/gcd.js b/node_modules/mathjs/lib/esm/function/arithmetic/gcd.js
new file mode 100644
index 0000000..35ca4b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/gcd.js
@@ -0,0 +1,146 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { gcdNumber } from '../../plain/number/index.js';
+var name = 'gcd';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];
+export var createGcd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    BigNumber,
+    DenseMatrix
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm04 = createAlgorithm04({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Calculate the greatest common divisor for two or more values or arrays.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.gcd(a, b)
+   *    math.gcd(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.gcd(8, 12)              // returns 4
+   *    math.gcd(-4, 6)              // returns 2
+   *    math.gcd(25, 15, -10)        // returns 5
+   *
+   *    math.gcd([8, -4], [12, 6])   // returns [4, 2]
+   *
+   * See also:
+   *
+   *    lcm, xgcd
+   *
+   * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor
+   */
+
+  return typed(name, {
+    'number, number': gcdNumber,
+    'BigNumber, BigNumber': _gcdBigNumber,
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.gcd(y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm04(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm01(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm10(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    },
+    // TODO: need a smarter notation here
+    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {
+      var res = this(a, b);
+
+      for (var i = 0; i < args.length; i++) {
+        res = this(res, args[i]);
+      }
+
+      return res;
+    }
+  });
+  /**
+   * Calculate gcd for BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns greatest common denominator of a and b
+   * @private
+   */
+
+  function _gcdBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function gcd must be integer numbers');
+    } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+
+
+    var zero = new BigNumber(0);
+
+    while (!b.isZero()) {
+      var r = a.mod(b);
+      a = b;
+      b = r;
+    }
+
+    return a.lt(zero) ? a.neg() : a;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/hypot.js b/node_modules/mathjs/lib/esm/function/arithmetic/hypot.js
new file mode 100644
index 0000000..89ef8f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/hypot.js
@@ -0,0 +1,81 @@
+import { factory } from '../../utils/factory.js';
+import { flatten } from '../../utils/array.js';
+var name = 'hypot';
+var dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];
+export var createHypot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    sqrt,
+    smaller,
+    isPositive
+  } = _ref;
+
+  /**
+   * Calculate the hypotenusa of a list with values. The hypotenusa is defined as:
+   *
+   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)
+   *
+   * For matrix input, the hypotenusa is calculated for all values in the matrix.
+   *
+   * Syntax:
+   *
+   *     math.hypot(a, b, ...)
+   *     math.hypot([a, b, c, ...])
+   *
+   * Examples:
+   *
+   *     math.hypot(3, 4)      // 5
+   *     math.hypot(3, 4, 5)   // 7.0710678118654755
+   *     math.hypot([3, 4, 5]) // 7.0710678118654755
+   *     math.hypot(-2)        // 2
+   *
+   * See also:
+   *
+   *     abs, norm
+   *
+   * @param {... number | BigNumber | Array | Matrix} args    A list with numeric values or an Array or Matrix.
+   *                                                          Matrix and Array input is flattened and returns a
+   *                                                          single number for the whole matrix.
+   * @return {number | BigNumber} Returns the hypothenusa of the input values.
+   */
+  return typed(name, {
+    '... number | BigNumber': _hypot,
+    Array: function Array(x) {
+      return this.apply(this, flatten(x));
+    },
+    Matrix: function Matrix(x) {
+      return this.apply(this, flatten(x.toArray()));
+    }
+  });
+  /**
+   * Calculate the hypotenusa for an Array with values
+   * @param {Array.<number | BigNumber>} args
+   * @return {number | BigNumber} Returns the result
+   * @private
+   */
+
+  function _hypot(args) {
+    // code based on `hypot` from es6-shim:
+    // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633
+    var result = 0;
+    var largest = 0;
+
+    for (var i = 0; i < args.length; i++) {
+      var value = abs(args[i]);
+
+      if (smaller(largest, value)) {
+        result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));
+        result = addScalar(result, 1);
+        largest = value;
+      } else {
+        result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);
+      }
+    }
+
+    return multiplyScalar(largest, sqrt(result));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/invmod.js b/node_modules/mathjs/lib/esm/function/arithmetic/invmod.js
new file mode 100644
index 0000000..f74f9ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/invmod.js
@@ -0,0 +1,57 @@
+import { factory } from '../../utils/factory.js';
+var name = 'invmod';
+var dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];
+export var createInvmod = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    BigNumber,
+    xgcd,
+    equal,
+    smaller,
+    mod,
+    add,
+    isInteger
+  } = _ref;
+
+  /**
+   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`
+   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.
+   *
+   * Syntax:
+   *
+   *    math.invmod(a, b)
+   *
+   * Examples:
+   *
+   *    math.invmod(8, 12)             // returns NaN
+   *    math.invmod(7, 13)             // return 2
+   *    math.invmod(15151, 15122)      // returns 10429
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {number | BigNumber }  Returns an integer number
+   *                              where `invmod(a,b)*a ≣ 1 (mod b)`
+   */
+  return typed(name, {
+    'number, number': invmod,
+    'BigNumber, BigNumber': invmod
+  });
+
+  function invmod(a, b) {
+    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers');
+    a = mod(a, b);
+    if (equal(b, 0)) throw new Error('Divisor must be non zero');
+    var res = xgcd(a, b);
+    res = res.valueOf();
+    var [gcd, inv] = res;
+    if (!equal(gcd, BigNumber(1))) return NaN;
+    inv = mod(inv, b);
+    if (smaller(inv, BigNumber(0))) inv = add(inv, b);
+    return inv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/lcm.js b/node_modules/mathjs/lib/esm/function/arithmetic/lcm.js
new file mode 100644
index 0000000..8042edb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/lcm.js
@@ -0,0 +1,158 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { lcmNumber } from '../../plain/number/index.js';
+var name = 'lcm';
+var dependencies = ['typed', 'matrix', 'equalScalar'];
+export var createLcm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar
+  } = _ref;
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm06 = createAlgorithm06({
+    typed,
+    equalScalar
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Calculate the least common multiple for two or more values or arrays.
+   *
+   * lcm is defined as:
+   *
+   *     lcm(a, b) = abs(a * b) / gcd(a, b)
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.lcm(a, b)
+   *    math.lcm(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.lcm(4, 6)               // returns 12
+   *    math.lcm(6, 21)              // returns 42
+   *    math.lcm(6, 21, 5)           // returns 210
+   *
+   *    math.lcm([4, 6], [6, 21])    // returns [12, 42]
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Array | Matrix}                           The least common multiple
+   */
+
+  return typed(name, {
+    'number, number': lcmNumber,
+    'BigNumber, BigNumber': _lcmBigNumber,
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.lcm(y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm06(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      return algorithm11(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    },
+    // TODO: need a smarter notation here
+    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {
+      var res = this(a, b);
+
+      for (var i = 0; i < args.length; i++) {
+        res = this(res, args[i]);
+      }
+
+      return res;
+    }
+  });
+  /**
+   * Calculate lcm for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns the least common multiple of a and b
+   * @private
+   */
+
+  function _lcmBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function lcm must be integer numbers');
+    }
+
+    if (a.isZero()) {
+      return a;
+    }
+
+    if (b.isZero()) {
+      return b;
+    } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    // evaluate lcm here inline to reduce overhead
+
+
+    var prod = a.times(b);
+
+    while (!b.isZero()) {
+      var t = b;
+      b = a.mod(t);
+      a = t;
+    }
+
+    return prod.div(a).abs();
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log.js b/node_modules/mathjs/lib/esm/function/arithmetic/log.js
new file mode 100644
index 0000000..c365371
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log.js
@@ -0,0 +1,76 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { logNumber } from '../../plain/number/index.js';
+var name = 'log';
+var dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
+export var createLog = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    divideScalar,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the logarithm of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log(x)
+   *    math.log(x, base)
+   *
+   * Examples:
+   *
+   *    math.log(3.5)                  // returns 1.252762968495368
+   *    math.exp(math.log(2.4))        // returns 2.4
+   *
+   *    math.pow(10, 4)                // returns 10000
+   *    math.log(10000, 10)            // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *
+   *    math.log(1024, 2)              // returns 10
+   *    math.pow(2, 10)                // returns 1024
+   *
+   * See also:
+   *
+   *    exp, log2, log10, log1p
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @param {number | BigNumber | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x` is calculated.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the logarithm of `x`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return logNumber(x);
+      } else {
+        // negative value -> complex value computation
+        return new Complex(x, 0).log();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.log();
+    },
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return new Complex(x.toNumber(), 0).log();
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    },
+    'any, any': function anyAny(x, base) {
+      // calculate logarithm for a specified base, log(x, base)
+      return divideScalar(this(x), this(base));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log10.js b/node_modules/mathjs/lib/esm/function/arithmetic/log10.js
new file mode 100644
index 0000000..d323fd7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log10.js
@@ -0,0 +1,62 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { log10Number } from '../../plain/number/index.js';
+var name = 'log10';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createLog10 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex: _Complex
+  } = _ref;
+
+  /**
+   * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log10(x)
+   *
+   * Examples:
+   *
+   *    math.log10(0.00001)            // returns -5
+   *    math.log10(10000)              // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *    math.pow(10, 4)                // returns 10000
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log2
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 10-base logarithm of `x`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return log10Number(x);
+      } else {
+        // negative value -> complex value computation
+        return new _Complex(x, 0).log().div(Math.LN10);
+      }
+    },
+    Complex: function Complex(x) {
+      return new _Complex(x).log().div(Math.LN10);
+    },
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log();
+      } else {
+        // downgrade to number, return Complex valued result
+        return new _Complex(x.toNumber(), 0).log().div(Math.LN10);
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log1p.js b/node_modules/mathjs/lib/esm/function/arithmetic/log1p.js
new file mode 100644
index 0000000..2733d3f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log1p.js
@@ -0,0 +1,85 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { log1p as _log1p } from '../../utils/number.js';
+var name = 'log1p';
+var dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];
+export var createLog1p = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    divideScalar,
+    log,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the logarithm of a `value+1`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log1p(x)
+   *    math.log1p(x, base)
+   *
+   * Examples:
+   *
+   *    math.log1p(2.5)                 // returns 1.252762968495368
+   *    math.exp(math.log1p(1.4))       // returns 2.4
+   *
+   *    math.pow(10, 4)                 // returns 10000
+   *    math.log1p(9999, 10)            // returns 4
+   *    math.log1p(9999) / math.log(10) // returns 4
+   *
+   * See also:
+   *
+   *    exp, log, log2, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm of `x+1`.
+   * @param {number | BigNumber | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x+1` is calculated.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the logarithm of `x+1`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 || config.predictable) {
+        return _log1p(x);
+      } else {
+        // negative value -> complex value computation
+        return _log1pComplex(new Complex(x, 0));
+      }
+    },
+    Complex: _log1pComplex,
+    BigNumber: function BigNumber(x) {
+      var y = x.plus(1);
+
+      if (!y.isNegative() || config.predictable) {
+        return y.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return _log1pComplex(new Complex(x.toNumber(), 0));
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    },
+    'any, any': function anyAny(x, base) {
+      // calculate logarithm for a specified base, log1p(x, base)
+      return divideScalar(this(x), log(base));
+    }
+  });
+  /**
+   * Calculate the natural logarithm of a complex number + 1
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+
+  function _log1pComplex(x) {
+    var xRe1p = x.re + 1;
+    return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log2.js b/node_modules/mathjs/lib/esm/function/arithmetic/log2.js
new file mode 100644
index 0000000..5aa0e52
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log2.js
@@ -0,0 +1,71 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { log2Number } from '../../plain/number/index.js';
+var name = 'log2';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createLog2 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log2(x)
+   *
+   * Examples:
+   *
+   *    math.log2(0.03125)           // returns -5
+   *    math.log2(16)                // returns 4
+   *    math.log2(16) / math.log2(2) // returns 4
+   *    math.pow(2, 4)               // returns 16
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 2-base logarithm of `x`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return log2Number(x);
+      } else {
+        // negative value -> complex value computation
+        return _log2Complex(new Complex(x, 0));
+      }
+    },
+    Complex: _log2Complex,
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log(2);
+      } else {
+        // downgrade to number, return Complex valued result
+        return _log2Complex(new Complex(x.toNumber(), 0));
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+  /**
+   * Calculate log2 for a complex value
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+
+  function _log2Complex(x) {
+    var newX = Math.sqrt(x.re * x.re + x.im * x.im);
+    return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/mod.js b/node_modules/mathjs/lib/esm/function/arithmetic/mod.js
new file mode 100644
index 0000000..60ee77b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/mod.js
@@ -0,0 +1,142 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { modNumber } from '../../plain/number/index.js';
+var name = 'mod';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+export var createMod = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm05 = createAlgorithm05({
+    typed,
+    equalScalar
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Calculates the modulus, the remainder of an integer division.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * The modulus is defined as:
+   *
+   *     x - y * floor(x / y)
+   *
+   * See https://en.wikipedia.org/wiki/Modulo_operation.
+   *
+   * Syntax:
+   *
+   *    math.mod(x, y)
+   *
+   * Examples:
+   *
+   *    math.mod(8, 3)                // returns 2
+   *    math.mod(11, 2)               // returns 1
+   *
+   *    function isOdd(x) {
+   *      return math.mod(x, 2) != 0
+   *    }
+   *
+   *    isOdd(2)                      // returns false
+   *    isOdd(3)                      // returns true
+   *
+   * See also:
+   *
+   *    divide
+   *
+   * @param  {number | BigNumber | Fraction | Array | Matrix} x Dividend
+   * @param  {number | BigNumber | Fraction | Array | Matrix} y Divisor
+   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.
+   */
+
+  return typed(name, {
+    'number, number': modNumber,
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      if (y.isNeg()) {
+        throw new Error('Cannot calculate mod for a negative divisor');
+      }
+
+      return y.isZero() ? x : x.mod(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      if (y.compare(0) < 0) {
+        throw new Error('Cannot calculate mod for a negative divisor');
+      } // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend
+
+
+      return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm05(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js b/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js
new file mode 100644
index 0000000..a66a9fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js
@@ -0,0 +1,900 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+import { extend } from '../../utils/object.js';
+import { arraySize } from '../../utils/array.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'multiply';
+var dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];
+export var createMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    addScalar,
+    multiplyScalar,
+    equalScalar,
+    dot
+  } = _ref;
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+
+  function _validateMatrixDimensions(size1, size2) {
+    // check left operand dimensions
+    switch (size1.length) {
+      case 1:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Vector x Vector
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');
+            }
+
+            break;
+
+          case 2:
+            // Vector x Matrix
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');
+            }
+
+            break;
+
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+
+        break;
+
+      case 2:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Matrix x Vector
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');
+            }
+
+            break;
+
+          case 2:
+            // Matrix x Matrix
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');
+            }
+
+            break;
+
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+
+        break;
+
+      default:
+        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');
+    }
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (N)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {number}             Scalar value
+   */
+
+
+  function _multiplyVectorVector(a, b, n) {
+    // check empty vector
+    if (n === 0) {
+      throw new Error('Cannot multiply two empty vectors');
+    }
+
+    return dot(a, b);
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Matrix         (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+
+
+  function _multiplyVectorMatrix(a, b) {
+    // process storage
+    if (b.storage() !== 'dense') {
+      throw new Error('Support for SparseMatrix not implemented');
+    }
+
+    return _multiplyVectorDenseMatrix(a, b);
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Dense Matrix   (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+
+
+  function _multiplyVectorDenseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b dense
+
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype; // rows & columns
+
+    var alength = asize[0];
+    var bcolumns = bsize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var c = []; // loop matrix columns
+
+    for (var j = 0; j < bcolumns; j++) {
+      // sum (do not initialize it with zero)
+      var sum = mf(adata[0], bdata[0][j]); // loop vector
+
+      for (var i = 1; i < alength; i++) {
+        // multiply & accumulate
+        sum = af(sum, mf(adata[i], bdata[i][j]));
+      }
+
+      c[j] = sum;
+    } // return matrix
+
+
+    return a.createDenseMatrix({
+      data: c,
+      size: [bcolumns],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {Matrix}             Dense Vector   (M)
+   */
+
+
+  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {
+    'DenseMatrix, any': _multiplyDenseMatrixVector,
+    'SparseMatrix, any': _multiplySparseMatrixVector
+  });
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Matrix         (NxC)
+   *
+   * @return {Matrix}             Matrix         (MxC)
+   */
+
+
+  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {
+    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,
+    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,
+    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,
+    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix
+  });
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix  (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             Dense Vector (M)
+   */
+
+
+  function _multiplyDenseMatrixVector(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b dense
+
+    var bdata = b._data;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = asize[0];
+    var acolumns = asize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var c = []; // loop matrix a rows
+
+    for (var i = 0; i < arows; i++) {
+      // current row
+      var row = adata[i]; // sum (do not initialize it with zero)
+
+      var sum = mf(row[0], bdata[0]); // loop matrix a columns
+
+      for (var j = 1; j < acolumns; j++) {
+        // multiply & accumulate
+        sum = af(sum, mf(row[j], bdata[j]));
+      }
+
+      c[i] = sum;
+    } // return matrix
+
+
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            DenseMatrix    (NxC)
+   *
+   * @return {Matrix}             DenseMatrix    (MxC)
+   */
+
+
+  function _multiplyDenseMatrixDenseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b dense
+
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = asize[0];
+    var acolumns = asize[1];
+    var bcolumns = bsize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var c = []; // loop matrix a rows
+
+    for (var i = 0; i < arows; i++) {
+      // current row
+      var row = adata[i]; // initialize row array
+
+      c[i] = []; // loop matrix b columns
+
+      for (var j = 0; j < bcolumns; j++) {
+        // sum (avoid initializing sum to zero)
+        var sum = mf(row[0], bdata[0][j]); // loop matrix a columns
+
+        for (var x = 1; x < acolumns; x++) {
+          // multiply & accumulate
+          sum = af(sum, mf(row[x], bdata[x][j]));
+        }
+
+        c[i][j] = sum;
+      }
+    } // return matrix
+
+
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows, bcolumns],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            SparseMatrix   (NxC)
+   *
+   * @return {Matrix}             SparseMatrix   (MxC)
+   */
+
+
+  function _multiplyDenseMatrixSparseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b sparse
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate b matrix
+
+    if (!bvalues) {
+      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');
+    } // rows & columns
+
+
+    var arows = asize[0];
+    var bcolumns = bsize[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // equalScalar signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt);
+    } // result
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // c matrix
+
+    var c = b.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: dt
+    }); // loop b columns
+
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length; // indeces in column jb
+
+      var kb0 = bptr[jb];
+      var kb1 = bptr[jb + 1]; // do not process column jb if no data exists
+
+      if (kb1 > kb0) {
+        // last row mark processed
+        var last = 0; // loop a rows
+
+        for (var i = 0; i < arows; i++) {
+          // column mark
+          var mark = i + 1; // C[i, jb]
+
+          var cij = void 0; // values in b column j
+
+          for (var kb = kb0; kb < kb1; kb++) {
+            // row
+            var ib = bindex[kb]; // check value has been initialized
+
+            if (last !== mark) {
+              // first value in column jb
+              cij = mf(adata[i][ib], bvalues[kb]); // update mark
+
+              last = mark;
+            } else {
+              // accumulate value
+              cij = af(cij, mf(adata[i][ib], bvalues[kb]));
+            }
+          } // check column has been processed and value != 0
+
+
+          if (last === mark && !eq(cij, zero)) {
+            // push row & value
+            cindex.push(i);
+            cvalues.push(cij);
+          }
+        }
+      }
+    } // update ptr
+
+
+    cptr[bcolumns] = cindex.length; // return sparse matrix
+
+    return c;
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix    (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             SparseMatrix    (M, 1)
+   */
+
+
+  function _multiplySparseMatrixVector(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype; // validate a matrix
+
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    } // b dense
+
+
+    var bdata = b._data;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = a._size[0];
+    var brows = b._size[0]; // result
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // equalScalar signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt);
+    } // workspace
+
+
+    var x = []; // vector with marks indicating a value x[i] exists in a given column
+
+    var w = []; // update ptr
+
+    cptr[0] = 0; // rows in b
+
+    for (var ib = 0; ib < brows; ib++) {
+      // b[ib]
+      var vbi = bdata[ib]; // check b[ib] != 0, avoid loops
+
+      if (!eq(vbi, zero)) {
+        // A values & index in ib column
+        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+          // a row
+          var ia = aindex[ka]; // check value exists in current j
+
+          if (!w[ia]) {
+            // ia is new entry in j
+            w[ia] = true; // add i to pattern of C
+
+            cindex.push(ia); // x(ia) = A
+
+            x[ia] = mf(vbi, avalues[ka]);
+          } else {
+            // i exists in C already
+            x[ia] = af(x[ia], mf(vbi, avalues[ka]));
+          }
+        }
+      }
+    } // copy values from x to column jb of c
+
+
+    for (var p1 = cindex.length, p = 0; p < p1; p++) {
+      // row
+      var ic = cindex[p]; // copy value
+
+      cvalues[p] = x[ic];
+    } // update ptr
+
+
+    cptr[1] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, 1],
+      datatype: dt
+    });
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            DenseMatrix       (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+
+
+  function _multiplySparseMatrixDenseMatrix(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype; // validate a matrix
+
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    } // b dense
+
+
+    var bdata = b._data;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = a._size[0];
+    var brows = b._size[0];
+    var bcolumns = b._size[1]; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // equalScalar signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt);
+    } // result
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // c matrix
+
+    var c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: dt
+    }); // workspace
+
+    var x = []; // vector with marks indicating a value x[i] exists in a given column
+
+    var w = []; // loop b columns
+
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length; // mark in workspace for current column
+
+      var mark = jb + 1; // rows in jb
+
+      for (var ib = 0; ib < brows; ib++) {
+        // b[ib, jb]
+        var vbij = bdata[ib][jb]; // check b[ib, jb] != 0, avoid loops
+
+        if (!eq(vbij, zero)) {
+          // A values & index in ib column
+          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // a row
+            var ia = aindex[ka]; // check value exists in current j
+
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark; // add i to pattern of C
+
+              cindex.push(ia); // x(ia) = A
+
+              x[ia] = mf(vbij, avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(vbij, avalues[ka]));
+            }
+          }
+        }
+      } // copy values from x to column jb of c
+
+
+      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+        // row
+        var ic = cindex[p]; // copy value
+
+        cvalues[p] = x[ic];
+      }
+    } // update ptr
+
+
+    cptr[bcolumns] = cindex.length; // return sparse matrix
+
+    return c;
+  }
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            SparseMatrix      (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+
+
+  function _multiplySparseMatrixSparseMatrix(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype; // b sparse
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bdt = b._datatype; // rows & columns
+
+    var arows = a._size[0];
+    var bcolumns = b._size[1]; // flag indicating both matrices (a & b) contain data
+
+    var values = avalues && bvalues; // datatype
+
+    var dt; // addScalar signature to use
+
+    var af = addScalar; // multiplyScalar signature to use
+
+    var mf = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signatures that matches (dt, dt)
+
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    } // result
+
+
+    var cvalues = values ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // c matrix
+
+    var c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: dt
+    }); // workspace
+
+    var x = values ? [] : undefined; // vector with marks indicating a value x[i] exists in a given column
+
+    var w = []; // variables
+
+    var ka, ka0, ka1, kb, kb0, kb1, ia, ib; // loop b columns
+
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length; // mark in workspace for current column
+
+      var mark = jb + 1; // B values & index in j
+
+      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {
+        // b row
+        ib = bindex[kb]; // check we need to process values
+
+        if (values) {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka]; // check value exists in current j
+
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark; // add i to pattern of C
+
+              cindex.push(ia); // x(ia) = A
+
+              x[ia] = mf(bvalues[kb], avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));
+            }
+          }
+        } else {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka]; // check value exists in current j
+
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark; // add i to pattern of C
+
+              cindex.push(ia);
+            }
+          }
+        }
+      } // check we need to process matrix values (pattern matrix)
+
+
+      if (values) {
+        // copy values from x to column jb of c
+        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+          // row
+          var ic = cindex[p]; // copy value
+
+          cvalues[p] = x[ic];
+        }
+      }
+    } // update ptr
+
+
+    cptr[bcolumns] = cindex.length; // return sparse matrix
+
+    return c;
+  }
+  /**
+   * Multiply two or more values, `x * y`.
+   * For matrices, the matrix product is calculated.
+   *
+   * Syntax:
+   *
+   *    math.multiply(x, y)
+   *    math.multiply(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.multiply(4, 5.2)        // returns number 20.8
+   *    math.multiply(2, 3, 4)       // returns number 24
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.multiply(a, b)          // returns Complex 5 + 14i
+   *
+   *    const c = [[1, 2], [4, 3]]
+   *    const d = [[1, 2, 3], [3, -4, 7]]
+   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]
+   *
+   *    const e = math.unit('2.1 km')
+   *    math.multiply(3, e)          // returns Unit 6.3 km
+   *
+   * See also:
+   *
+   *    divide, prod, cross, dot
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to multiply
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`
+   */
+
+
+  return typed(name, extend({
+    // we extend the signatures of multiplyScalar with signatures dealing with matrices
+    'Array, Array': function ArrayArray(x, y) {
+      // check dimensions
+      _validateMatrixDimensions(arraySize(x), arraySize(y)); // use dense matrix implementation
+
+
+      var m = this(matrix(x), matrix(y)); // return array or scalar
+
+      return isMatrix(m) ? m.valueOf() : m;
+    },
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      // dimensions
+      var xsize = x.size();
+      var ysize = y.size(); // check dimensions
+
+      _validateMatrixDimensions(xsize, ysize); // process dimensions
+
+
+      if (xsize.length === 1) {
+        // process y dimensions
+        if (ysize.length === 1) {
+          // Vector * Vector
+          return _multiplyVectorVector(x, y, xsize[0]);
+        } // Vector * Matrix
+
+
+        return _multiplyVectorMatrix(x, y);
+      } // process y dimensions
+
+
+      if (ysize.length === 1) {
+        // Matrix * Vector
+        return _multiplyMatrixVector(x, y);
+      } // Matrix * Matrix
+
+
+      return _multiplyMatrixMatrix(x, y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use Matrix * Matrix implementation
+      return this(x, matrix(y));
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use Matrix * Matrix implementation
+      return this(matrix(x, y.storage()), y);
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, multiplyScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm11(y, x, multiplyScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, multiplyScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();
+    },
+    'any, any': multiplyScalar,
+    'any, any, ...any': function anyAnyAny(x, y, rest) {
+      var result = this(x, y);
+
+      for (var i = 0; i < rest.length; i++) {
+        result = this(result, rest[i]);
+      }
+
+      return result;
+    }
+  }, multiplyScalar.signatures));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js b/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js
new file mode 100644
index 0000000..629b362
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+import { multiplyNumber } from '../../plain/number/index.js';
+var name = 'multiplyScalar';
+var dependencies = ['typed'];
+export var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Multiply two scalar values, `x * y`.
+   * This function is meant for internal use: it is used by the public function
+   * `multiply`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to multiply
+   * @param  {number | BigNumber | Fraction | Complex} y          Second value to multiply
+   * @return {number | BigNumber | Fraction | Complex | Unit}     Multiplication of `x` and `y`
+   * @private
+   */
+  return typed('multiplyScalar', {
+    'number, number': multiplyNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.mul(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.times(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.mul(y);
+    },
+    'number | Fraction | BigNumber | Complex, Unit': function numberFractionBigNumberComplexUnit(x, y) {
+      var res = y.clone();
+      res.value = res.value === null ? res._normalize(x) : this(res.value, x);
+      return res;
+    },
+    'Unit, number | Fraction | BigNumber | Complex': function UnitNumberFractionBigNumberComplex(x, y) {
+      var res = x.clone();
+      res.value = res.value === null ? res._normalize(y) : this(res.value, y);
+      return res;
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return x.multiply(y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/norm.js b/node_modules/mathjs/lib/esm/function/arithmetic/norm.js
new file mode 100644
index 0000000..f3bc3f2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/norm.js
@@ -0,0 +1,317 @@
+import { factory } from '../../utils/factory.js';
+var name = 'norm';
+var dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];
+export var createNorm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    pow,
+    conj,
+    sqrt,
+    multiply,
+    equalScalar,
+    larger,
+    smaller,
+    matrix,
+    ctranspose,
+    eigs
+  } = _ref;
+
+  /**
+   * Calculate the norm of a number, vector or matrix.
+   *
+   * The second parameter p is optional. If not provided, it defaults to 2.
+   *
+   * Syntax:
+   *
+   *    math.norm(x)
+   *    math.norm(x, p)
+   *
+   * Examples:
+   *
+   *    math.abs(-3.5)                         // returns 3.5
+   *    math.norm(-3.5)                        // returns 3.5
+   *
+   *    math.norm(math.complex(3, -4))         // returns 5
+   *
+   *    math.norm([1, 2, -3], Infinity)        // returns 3
+   *    math.norm([1, 2, -3], -Infinity)       // returns 1
+   *
+   *    math.norm([3, 4], 2)                   // returns 5
+   *
+   *    math.norm([[1, 2], [3, 4]], 1)          // returns 6
+   *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7
+   *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661
+   *
+   * See also:
+   *
+   *    abs, hypot
+   *
+   * @param  {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the norm
+   * @param  {number | BigNumber | string} [p=2]
+   *            Vector space.
+   *            Supported numbers include Infinity and -Infinity.
+   *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)
+   * @return {number | BigNumber} the p-norm
+   */
+  return typed(name, {
+    number: Math.abs,
+    Complex: function Complex(x) {
+      return x.abs();
+    },
+    BigNumber: function BigNumber(x) {
+      // norm(x) = abs(x)
+      return x.abs();
+    },
+    boolean: function boolean(x) {
+      // norm(x) = abs(x)
+      return Math.abs(x);
+    },
+    Array: function Array(x) {
+      return _norm(matrix(x), 2);
+    },
+    Matrix: function Matrix(x) {
+      return _norm(x, 2);
+    },
+    'number | Complex | BigNumber | boolean, number | BigNumber | string': function numberComplexBigNumberBooleanNumberBigNumberString(x) {
+      // ignore second parameter, TODO: remove the option of second parameter for these types
+      return this(x);
+    },
+    'Array, number | BigNumber | string': function ArrayNumberBigNumberString(x, p) {
+      return _norm(matrix(x), p);
+    },
+    'Matrix, number | BigNumber | string': function MatrixNumberBigNumberString(x, p) {
+      return _norm(x, p);
+    }
+  });
+  /**
+   * Calculate the plus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+  function _vectorNormPlusInfinity(x) {
+    // norm(x, Infinity) = max(abs(x))
+    var pinf = 0; // skip zeros since abs(0) === 0
+
+    x.forEach(function (value) {
+      var v = abs(value);
+
+      if (larger(v, pinf)) {
+        pinf = v;
+      }
+    }, true);
+    return pinf;
+  }
+  /**
+   * Calculate the minus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _vectorNormMinusInfinity(x) {
+    // norm(x, -Infinity) = min(abs(x))
+    var ninf; // skip zeros since abs(0) === 0
+
+    x.forEach(function (value) {
+      var v = abs(value);
+
+      if (!ninf || smaller(v, ninf)) {
+        ninf = v;
+      }
+    }, true);
+    return ninf || 0;
+  }
+  /**
+   * Calculate the norm for a vector
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _vectorNorm(x, p) {
+    // check p
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _vectorNormPlusInfinity(x);
+    }
+
+    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {
+      return _vectorNormMinusInfinity(x);
+    }
+
+    if (p === 'fro') {
+      return _norm(x, 2);
+    }
+
+    if (typeof p === 'number' && !isNaN(p)) {
+      // check p != 0
+      if (!equalScalar(p, 0)) {
+        // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p
+        var n = 0; // skip zeros since abs(0) === 0
+
+        x.forEach(function (value) {
+          n = add(pow(abs(value), p), n);
+        }, true);
+        return pow(n, 1 / p);
+      }
+
+      return Number.POSITIVE_INFINITY;
+    } // invalid parameter value
+
+
+    throw new Error('Unsupported parameter value');
+  }
+  /**
+   * Calculate the Frobenius norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormFrobenius(x) {
+    // norm(x) = sqrt(sum(diag(x'x)))
+    var fro = 0;
+    x.forEach(function (value, index) {
+      fro = add(fro, multiply(value, conj(value)));
+    });
+    return abs(sqrt(fro));
+  }
+  /**
+   * Calculate the norm L1 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormOne(x) {
+    // norm(x) = the largest column sum
+    var c = []; // result
+
+    var maxc = 0; // skip zeros since abs(0) == 0
+
+    x.forEach(function (value, index) {
+      var j = index[1];
+      var cj = add(c[j] || 0, abs(value));
+
+      if (larger(cj, maxc)) {
+        maxc = cj;
+      }
+
+      c[j] = cj;
+    }, true);
+    return maxc;
+  }
+  /**
+   * Calculate the norm L2 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormTwo(x) {
+    // norm(x) = sqrt( max eigenvalue of A*.A)
+    var sizeX = x.size();
+
+    if (sizeX[0] !== sizeX[1]) {
+      throw new RangeError('Invalid matrix dimensions');
+    }
+
+    var tx = ctranspose(x);
+    var squaredX = multiply(tx, x);
+    var eigenVals = eigs(squaredX).values.toArray();
+    var rho = eigenVals[eigenVals.length - 1];
+    return abs(sqrt(rho));
+  }
+  /**
+   * Calculate the infinity norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNormInfinity(x) {
+    // norm(x) = the largest row sum
+    var r = []; // result
+
+    var maxr = 0; // skip zeros since abs(0) == 0
+
+    x.forEach(function (value, index) {
+      var i = index[0];
+      var ri = add(r[i] || 0, abs(value));
+
+      if (larger(ri, maxr)) {
+        maxr = ri;
+      }
+
+      r[i] = ri;
+    }, true);
+    return maxr;
+  }
+  /**
+   * Calculate the norm for a 2D Matrix (M*N)
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _matrixNorm(x, p) {
+    // check p
+    if (p === 1) {
+      return _matrixNormOne(x);
+    }
+
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _matrixNormInfinity(x);
+    }
+
+    if (p === 'fro') {
+      return _matrixNormFrobenius(x);
+    }
+
+    if (p === 2) {
+      return _matrixNormTwo(x);
+    } // invalid parameter value
+
+
+    throw new Error('Unsupported parameter value ' + p);
+  }
+  /**
+   * Calculate the norm for an array
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+
+
+  function _norm(x, p) {
+    // size
+    var sizeX = x.size(); // check if it is a vector
+
+    if (sizeX.length === 1) {
+      return _vectorNorm(x, p);
+    } // MxN matrix
+
+
+    if (sizeX.length === 2) {
+      if (sizeX[0] && sizeX[1]) {
+        return _matrixNorm(x, p);
+      } else {
+        throw new RangeError('Invalid matrix dimensions');
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..ca93a3f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js
@@ -0,0 +1,209 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { nthRootNumber } from '../../plain/number/index.js';
+var name = 'nthRoot';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber'];
+export var createNthRoot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    BigNumber: _BigNumber
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm06 = createAlgorithm06({
+    typed,
+    equalScalar
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Calculate the nth root of a value.
+   * The principal nth root of a positive real number A, is the positive real
+   * solution of the equation
+   *
+   *     x^root = A
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *     math.nthRoot(a)
+   *     math.nthRoot(a, root)
+   *
+   * Examples:
+   *
+   *     math.nthRoot(9, 2)    // returns 3, as 3^2 == 9
+   *     math.sqrt(9)          // returns 3, as 3^2 == 9
+   *     math.nthRoot(64, 3)   // returns 4, as 4^3 == 64
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param {number | BigNumber | Array | Matrix | Complex} a
+   *              Value for which to calculate the nth root
+   * @param {number | BigNumber} [root=2]    The root.
+   * @return {number | Complex | Array | Matrix} Returns the nth root of `a`
+   */
+
+  var complexErr = '' + 'Complex number not supported in function nthRoot. ' + 'Use nthRoots instead.';
+  return typed(name, {
+    number: function number(x) {
+      return nthRootNumber(x, 2);
+    },
+    'number, number': nthRootNumber,
+    BigNumber: function BigNumber(x) {
+      return _bigNthRoot(x, new _BigNumber(2));
+    },
+    Complex: function Complex(x) {
+      throw new Error(complexErr);
+    },
+    'Complex, number': function ComplexNumber(x, y) {
+      throw new Error(complexErr);
+    },
+    'BigNumber, BigNumber': _bigNthRoot,
+    'Array | Matrix': function ArrayMatrix(x) {
+      return this(x, 2);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse + sparse
+        return algorithm06(x, y, this);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // dense + sparse
+        return algorithm01(x, y, this, false);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse - scalar
+        return algorithm11(y, x, this, true);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+  /**
+   * Calculate the nth root of a for BigNumbers, solve x^root == a
+   * https://rosettacode.org/wiki/Nth_root#JavaScript
+   * @param {BigNumber} a
+   * @param {BigNumber} root
+   * @private
+   */
+
+  function _bigNthRoot(a, root) {
+    var precision = _BigNumber.precision;
+
+    var Big = _BigNumber.clone({
+      precision: precision + 2
+    });
+
+    var zero = new _BigNumber(0);
+    var one = new Big(1);
+    var inv = root.isNegative();
+
+    if (inv) {
+      root = root.neg();
+    }
+
+    if (root.isZero()) {
+      throw new Error('Root must be non-zero');
+    }
+
+    if (a.isNegative() && !root.abs().mod(2).equals(1)) {
+      throw new Error('Root must be odd when a is negative.');
+    } // edge cases zero and infinity
+
+
+    if (a.isZero()) {
+      return inv ? new Big(Infinity) : 0;
+    }
+
+    if (!a.isFinite()) {
+      return inv ? zero : a;
+    }
+
+    var x = a.abs().pow(one.div(root)); // If a < 0, we require that root is an odd integer,
+    // so (-1) ^ (1/root) = -1
+
+    x = a.isNeg() ? x.neg() : x;
+    return new _BigNumber((inv ? one.div(x) : x).toPrecision(precision));
+  }
+});
+export var createNthRootNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {
+  var {
+    typed
+  } = _ref2;
+  return typed(name, {
+    number: nthRootNumber,
+    'number, number': nthRootNumber
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..964a98e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js
@@ -0,0 +1,117 @@
+import { factory } from '../../utils/factory.js';
+var name = 'nthRoots';
+var dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
+export var createNthRoots = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    divideScalar,
+    Complex
+  } = _ref;
+
+  /**
+   * Each function here returns a real multiple of i as a Complex value.
+   * @param  {number} val
+   * @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3
+   */
+  // This is used to fix float artifacts for zero-valued components.
+  var _calculateExactResult = [function realPos(val) {
+    return new Complex(val, 0);
+  }, function imagPos(val) {
+    return new Complex(0, val);
+  }, function realNeg(val) {
+    return new Complex(-val, 0);
+  }, function imagNeg(val) {
+    return new Complex(0, -val);
+  }];
+  /**
+   * Calculate the nth root of a Complex Number a using De Movire's Theorem.
+   * @param  {Complex} a
+   * @param  {number} root
+   * @return {Array} array of n Complex Roots
+   */
+
+  function _nthComplexRoots(a, root) {
+    if (root < 0) throw new Error('Root must be greater than zero');
+    if (root === 0) throw new Error('Root must be non-zero');
+    if (root % 1 !== 0) throw new Error('Root must be an integer');
+    if (a === 0 || a.abs() === 0) return [new Complex(0, 0)];
+    var aIsNumeric = typeof a === 'number';
+    var offset; // determine the offset (argument of a)/(pi/2)
+
+    if (aIsNumeric || a.re === 0 || a.im === 0) {
+      if (aIsNumeric) {
+        offset = 2 * +(a < 0); // numeric value on the real axis
+      } else if (a.im === 0) {
+        offset = 2 * +(a.re < 0); // complex value on the real axis
+      } else {
+        offset = 2 * +(a.im < 0) + 1; // complex value on the imaginary axis
+      }
+    }
+
+    var arg = a.arg();
+    var abs = a.abs();
+    var roots = [];
+    var r = Math.pow(abs, 1 / root);
+
+    for (var k = 0; k < root; k++) {
+      var halfPiFactor = (offset + 4 * k) / root;
+      /**
+       * If (offset + 4*k)/root is an integral multiple of pi/2
+       * then we can produce a more exact result.
+       */
+
+      if (halfPiFactor === Math.round(halfPiFactor)) {
+        roots.push(_calculateExactResult[halfPiFactor % 4](r));
+        continue;
+      }
+
+      roots.push(new Complex({
+        r: r,
+        phi: (arg + 2 * Math.PI * k) / root
+      }));
+    }
+
+    return roots;
+  }
+  /**
+   * Calculate the nth roots of a value.
+   * An nth root of a positive real number A,
+   * is a positive real solution of the equation "x^root = A".
+   * This function returns an array of complex values.
+   *
+   * Syntax:
+   *
+   *    math.nthRoots(x)
+   *    math.nthRoots(x, root)
+   *
+   * Examples:
+   *
+   *    math.nthRoots(1)
+   *    // returns [
+   *    //   {re: 1, im: 0},
+   *    //   {re: -1, im: 0}
+   *    // ]
+   *    nthRoots(1, 3)
+   *    // returns [
+   *    //   { re: 1, im: 0 },
+   *    //   { re: -0.4999999999999998, im: 0.8660254037844387 },
+   *    //   { re: -0.5000000000000004, im: -0.8660254037844385 }
+   *    ]
+   *
+   * See also:
+   *
+   *    nthRoot, pow, sqrt
+   *
+   * @param {number | BigNumber | Fraction | Complex} x Number to be rounded
+   * @return {number | BigNumber | Fraction | Complex}            Rounded value
+   */
+
+
+  return typed(name, {
+    Complex: function Complex(x) {
+      return _nthComplexRoots(x, 2);
+    },
+    'Complex, number': _nthComplexRoots
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/pow.js b/node_modules/mathjs/lib/esm/function/arithmetic/pow.js
new file mode 100644
index 0000000..41593a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/pow.js
@@ -0,0 +1,186 @@
+import { factory } from '../../utils/factory.js';
+import { isInteger } from '../../utils/number.js';
+import { arraySize as size } from '../../utils/array.js';
+import { powNumber } from '../../plain/number/index.js';
+var name = 'pow';
+var dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'fraction', 'number', 'Complex'];
+export var createPow = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    identity,
+    multiply,
+    matrix,
+    number,
+    fraction,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculates the power of x to y, `x ^ y`.
+   * Matrix exponentiation is supported for square matrices `x`, and positive
+   * integer exponents `y`.
+   *
+   * For cubic roots of negative numbers, the function returns the principal
+   * root by default. In order to let the function return the real root,
+   * math.js can be configured with `math.config({predictable: true})`.
+   * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.
+   *
+   * Syntax:
+   *
+   *    math.pow(x, y)
+   *
+   * Examples:
+   *
+   *    math.pow(2, 3)               // returns number 8
+   *
+   *    const a = math.complex(2, 3)
+   *    math.pow(a, 2)                // returns Complex -5 + 12i
+   *
+   *    const b = [[1, 2], [4, 3]]
+   *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   * See also:
+   *
+   *    multiply, sqrt, cbrt, nthRoot
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | Complex} y                          The exponent
+   * @return {number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y`
+   */
+  return typed(name, {
+    'number, number': _pow,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.pow(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      if (y.isInteger() || x >= 0 || config.predictable) {
+        return x.pow(y);
+      } else {
+        return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0);
+      }
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      var result = x.pow(y);
+
+      if (result != null) {
+        return result;
+      }
+
+      if (config.predictable) {
+        throw new Error('Result of pow is non-rational and cannot be expressed as a fraction');
+      } else {
+        return _pow(x.valueOf(), y.valueOf());
+      }
+    },
+    'Array, number': _powArray,
+    'Array, BigNumber': function ArrayBigNumber(x, y) {
+      return _powArray(x, y.toNumber());
+    },
+    'Matrix, number': _powMatrix,
+    'Matrix, BigNumber': function MatrixBigNumber(x, y) {
+      return _powMatrix(x, y.toNumber());
+    },
+    'Unit, number | BigNumber': function UnitNumberBigNumber(x, y) {
+      return x.pow(y);
+    }
+  });
+  /**
+   * Calculates the power of x to y, x^y, for two numbers.
+   * @param {number} x
+   * @param {number} y
+   * @return {number | Complex} res
+   * @private
+   */
+
+  function _pow(x, y) {
+    // Alternatively could define a 'realmode' config option or something, but
+    // 'predictable' will work for now
+    if (config.predictable && !isInteger(y) && x < 0) {
+      // Check to see if y can be represented as a fraction
+      try {
+        var yFrac = fraction(y);
+        var yNum = number(yFrac);
+
+        if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {
+          if (yFrac.d % 2 === 1) {
+            return (yFrac.n % 2 === 0 ? 1 : -1) * Math.pow(-x, y);
+          }
+        }
+      } catch (ex) {// fraction() throws an error if y is Infinity, etc.
+      } // Unable to express y as a fraction, so continue on
+
+    } // **for predictable mode** x^Infinity === NaN if x < -1
+    // N.B. this behavour is different from `Math.pow` which gives
+    // (-2)^Infinity === Infinity
+
+
+    if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {
+      return NaN;
+    }
+
+    if (isInteger(y) || x >= 0 || config.predictable) {
+      return powNumber(x, y);
+    } else {
+      // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow
+      // x^Infinity === 0 if -1 < x < 1
+      // A real number 0 is returned instead of complex(0)
+      if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+        return 0;
+      }
+
+      return new Complex(x, 0).pow(y, 0);
+    }
+  }
+  /**
+   * Calculate the power of a 2d array
+   * @param {Array} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a positive, integer value
+   * @returns {Array}
+   * @private
+   */
+
+
+  function _powArray(x, y) {
+    if (!isInteger(y) || y < 0) {
+      throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')');
+    } // verify that A is a 2 dimensional square matrix
+
+
+    var s = size(x);
+
+    if (s.length !== 2) {
+      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');
+    }
+
+    if (s[0] !== s[1]) {
+      throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')');
+    }
+
+    var res = identity(s[0]).valueOf();
+    var px = x;
+
+    while (y >= 1) {
+      if ((y & 1) === 1) {
+        res = multiply(px, res);
+      }
+
+      y >>= 1;
+      px = multiply(px, px);
+    }
+
+    return res;
+  }
+  /**
+   * Calculate the power of a 2d matrix
+   * @param {Matrix} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a positive, integer value
+   * @returns {Matrix}
+   * @private
+   */
+
+
+  function _powMatrix(x, y) {
+    return matrix(_powArray(x.valueOf(), y));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/round.js b/node_modules/mathjs/lib/esm/function/arithmetic/round.js
new file mode 100644
index 0000000..8faa9f0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/round.js
@@ -0,0 +1,177 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { isInteger } from '../../utils/number.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { roundNumber } from '../../plain/number/index.js';
+var NO_INT = 'Number of decimals in function round must be an integer';
+var name = 'round';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];
+export var createRound = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    BigNumber,
+    DenseMatrix
+  } = _ref;
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Round a value towards the nearest integer.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.round(x)
+   *    math.round(x, n)
+   *
+   * Examples:
+   *
+   *    math.round(3.22)             // returns number 3
+   *    math.round(3.82)             // returns number 4
+   *    math.round(-4.2)             // returns number -4
+   *    math.round(-4.7)             // returns number -5
+   *    math.round(3.22, 1)          // returns number 3.2
+   *    math.round(3.88, 1)          // returns number 3.9
+   *    math.round(-4.21, 1)         // returns number -4.2
+   *    math.round(-4.71, 1)         // returns number -4.7
+   *    math.round(math.pi, 3)       // returns number 3.142
+   *    math.round(123.45678, 2)     // returns number 123.46
+   *
+   *    const c = math.complex(3.2, -2.7)
+   *    math.round(c)                // returns Complex 3 - 3i
+   *
+   *    math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]
+   *
+   * See also:
+   *
+   *    ceil, fix, floor
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
+   */
+
+  return typed(name, _objectSpread(_objectSpread({}, roundNumberSignatures), {}, {
+    Complex: function Complex(x) {
+      return x.round();
+    },
+    'Complex, number': function ComplexNumber(x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+
+      return x.round(n);
+    },
+    'Complex, BigNumber': function ComplexBigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      var _n = n.toNumber();
+
+      return x.round(_n);
+    },
+    'number, BigNumber': function numberBigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      return new BigNumber(x).toDecimalPlaces(n.toNumber());
+    },
+    BigNumber: function BigNumber(x) {
+      return x.toDecimalPlaces(0);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      return x.toDecimalPlaces(n.toNumber());
+    },
+    Fraction: function Fraction(x) {
+      return x.round();
+    },
+    'Fraction, number': function FractionNumber(x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+
+      return x.round(n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since round(0) = 0
+      return deepMap(x, this, true);
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | Complex | BigNumber, SparseMatrix': function numberComplexBigNumberSparseMatrix(x, y) {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm12(y, x, this, true);
+    },
+    'number | Complex | BigNumber, DenseMatrix': function numberComplexBigNumberDenseMatrix(x, y) {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  }));
+});
+var roundNumberSignatures = {
+  number: roundNumber,
+  'number, number': function numberNumber(x, n) {
+    if (!isInteger(n)) {
+      throw new TypeError(NO_INT);
+    }
+
+    if (n < 0 || n > 15) {
+      throw new Error('Number of decimals in function round must be in the range of 0-15');
+    }
+
+    return roundNumber(x, n);
+  }
+};
+export var createRoundNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {
+  var {
+    typed
+  } = _ref2;
+  return typed(name, roundNumberSignatures);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/sign.js b/node_modules/mathjs/lib/esm/function/arithmetic/sign.js
new file mode 100644
index 0000000..39a27ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/sign.js
@@ -0,0 +1,67 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { signNumber } from '../../plain/number/index.js';
+var name = 'sign';
+var dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];
+export var createSign = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber,
+    complex,
+    Fraction: _Fraction
+  } = _ref;
+
+  /**
+   * Compute the sign of a value. The sign of a value x is:
+   *
+   * -  1 when x > 0
+   * - -1 when x < 0
+   * -  0 when x == 0
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sign(x)
+   *
+   * Examples:
+   *
+   *    math.sign(3.5)               // returns 1
+   *    math.sign(-4.2)              // returns -1
+   *    math.sign(0)                 // returns 0
+   *
+   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]
+   *
+   * See also:
+   *
+   *    abs
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            The number for which to determine the sign
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}e
+   *            The sign of `x`
+   */
+  return typed(name, {
+    number: signNumber,
+    Complex: function Complex(x) {
+      return x.im === 0 ? complex(signNumber(x.re)) : x.sign();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(x.cmp(0));
+    },
+    Fraction: function Fraction(x) {
+      return new _Fraction(x.s, 1);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sign(0) = 0
+      return deepMap(x, this, true);
+    },
+    Unit: function Unit(x) {
+      if (!x._isDerived() && x.units[0].unit.offset !== 0) {
+        throw new TypeError('sign is ambiguous for units with offset');
+      }
+
+      return this(x.value);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..153086d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js
@@ -0,0 +1,74 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'sqrt';
+var dependencies = ['config', 'typed', 'Complex'];
+export var createSqrt = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the square root of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sqrt(x)
+   *
+   * Examples:
+   *
+   *    math.sqrt(25)                // returns 5
+   *    math.square(5)               // returns 25
+   *    math.sqrt(-4)                // returns Complex 2i
+   *
+   * See also:
+   *
+   *    square, multiply, cube, cbrt, sqrtm
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x
+   *            Value for which to calculate the square root.
+   * @return {number | BigNumber | Complex | Array | Matrix | Unit}
+   *            Returns the square root of `x`
+   */
+  return typed('sqrt', {
+    number: _sqrtNumber,
+    Complex: function Complex(x) {
+      return x.sqrt();
+    },
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.sqrt();
+      } else {
+        // negative value -> downgrade to number to do complex value computation
+        return _sqrtNumber(x.toNumber());
+      }
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sqrt(0) = 0
+      return deepMap(x, this, true);
+    },
+    Unit: function Unit(x) {
+      // Someday will work for complex units when they are implemented
+      return x.pow(0.5);
+    }
+  });
+  /**
+   * Calculate sqrt for a number
+   * @param {number} x
+   * @returns {number | Complex} Returns the square root of x
+   * @private
+   */
+
+  function _sqrtNumber(x) {
+    if (isNaN(x)) {
+      return NaN;
+    } else if (x >= 0 || config.predictable) {
+      return Math.sqrt(x);
+    } else {
+      return new Complex(x, 0).sqrt();
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/square.js b/node_modules/mathjs/lib/esm/function/arithmetic/square.js
new file mode 100644
index 0000000..2911229
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/square.js
@@ -0,0 +1,56 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { squareNumber } from '../../plain/number/index.js';
+var name = 'square';
+var dependencies = ['typed'];
+export var createSquare = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Compute the square of a value, `x * x`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.square(x)
+   *
+   * Examples:
+   *
+   *    math.square(2)           // returns number 4
+   *    math.square(3)           // returns number 9
+   *    math.pow(3, 2)           // returns number 9
+   *    math.multiply(3, 3)      // returns number 9
+   *
+   *    math.square([1, 2, 3, 4])  // returns Array [1, 4, 9, 16]
+   *
+   * See also:
+   *
+   *    multiply, cube, sqrt, pow
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            Number for which to calculate the square
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
+   *            Squared value
+   */
+  return typed(name, {
+    number: squareNumber,
+    Complex: function Complex(x) {
+      return x.mul(x);
+    },
+    BigNumber: function BigNumber(x) {
+      return x.times(x);
+    },
+    Fraction: function Fraction(x) {
+      return x.mul(x);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since square(0) = 0
+      return deepMap(x, this, true);
+    },
+    Unit: function Unit(x) {
+      return x.pow(2);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/subtract.js b/node_modules/mathjs/lib/esm/function/arithmetic/subtract.js
new file mode 100644
index 0000000..0e77665
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/subtract.js
@@ -0,0 +1,170 @@
+import { factory } from '../../utils/factory.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'subtract';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'addScalar', 'unaryMinus', 'DenseMatrix'];
+export var createSubtract = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    addScalar,
+    unaryMinus,
+    DenseMatrix
+  } = _ref;
+  // TODO: split function subtract in two: subtract and subtractScalar
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm05 = createAlgorithm05({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Subtract two values, `x - y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.subtract(x, y)
+   *
+   * Examples:
+   *
+   *    math.subtract(5.3, 2)        // returns number 3.3
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.subtract(a, b)          // returns Complex -2 + 2i
+   *
+   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]
+   *
+   *    const c = math.unit('2.1 km')
+   *    const d = math.unit('500m')
+   *    math.subtract(c, d)          // returns Unit 1.6 km
+   *
+   * See also:
+   *
+   *    add
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x
+   *            Initial value
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y
+   *            Value to subtract from `x`
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Subtraction of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x - y;
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.sub(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.minus(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.sub(y);
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (x.value === null) {
+        throw new Error('Parameter x contains a unit with undefined value');
+      }
+
+      if (y.value === null) {
+        throw new Error('Parameter y contains a unit with undefined value');
+      }
+
+      if (!x.equalBase(y)) {
+        throw new Error('Units do not match');
+      }
+
+      var res = x.clone();
+      res.value = this(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm05(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      checkEqualDimensions(x, y);
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm10(x, unaryMinus(y), addScalar);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm10(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+/**
+ * Check whether matrix x and y have the same number of dimensions.
+ * Throws a DimensionError when dimensions are not equal
+ * @param {Matrix} x
+ * @param {Matrix} y
+ */
+
+function checkEqualDimensions(x, y) {
+  var xsize = x.size();
+  var ysize = y.size();
+
+  if (xsize.length !== ysize.length) {
+    throw new DimensionError(xsize.length, ysize.length);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..1edab1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js
@@ -0,0 +1,56 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { unaryMinusNumber } from '../../plain/number/index.js';
+var name = 'unaryMinus';
+var dependencies = ['typed'];
+export var createUnaryMinus = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Inverse the sign of a value, apply a unary minus operation.
+   *
+   * For matrices, the function is evaluated element wise. Boolean values and
+   * strings will be converted to a number. For complex numbers, both real and
+   * complex value are inverted.
+   *
+   * Syntax:
+   *
+   *    math.unaryMinus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryMinus(3.5)      // returns -3.5
+   *    math.unaryMinus(-4.2)     // returns 4.2
+   *
+   * See also:
+   *
+   *    add, subtract, unaryPlus
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.
+   */
+  return typed(name, {
+    number: unaryMinusNumber,
+    Complex: function Complex(x) {
+      return x.neg();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.neg();
+    },
+    Fraction: function Fraction(x) {
+      return x.neg();
+    },
+    Unit: function Unit(x) {
+      var res = x.clone();
+      res.value = this(x.value);
+      return res;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since unaryMinus(0) = 0
+      return deepMap(x, this, true);
+    } // TODO: add support for string
+
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..25148ac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js
@@ -0,0 +1,60 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { unaryPlusNumber } from '../../plain/number/index.js';
+var name = 'unaryPlus';
+var dependencies = ['typed', 'config', 'BigNumber'];
+export var createUnaryPlus = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    BigNumber
+  } = _ref;
+
+  /**
+   * Unary plus operation.
+   * Boolean values and strings will be converted to a number, numeric values will be returned as is.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.unaryPlus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryPlus(3.5)      // returns 3.5
+   *    math.unaryPlus(1)     // returns 1
+   *
+   * See also:
+   *
+   *    unaryMinus, add, subtract
+   *
+   * @param  {number | BigNumber | Fraction | string | Complex | Unit | Array | Matrix} x
+   *            Input value
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns the input value when numeric, converts to a number when input is non-numeric.
+   */
+  return typed(name, {
+    number: unaryPlusNumber,
+    Complex: function Complex(x) {
+      return x; // complex numbers are immutable
+    },
+    BigNumber: function BigNumber(x) {
+      return x; // bignumbers are immutable
+    },
+    Fraction: function Fraction(x) {
+      return x; // fractions are immutable
+    },
+    Unit: function Unit(x) {
+      return x.clone();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since unaryPlus(0) = 0
+      return deepMap(x, this, true);
+    },
+    'boolean | string': function booleanString(x) {
+      // convert to a number or bignumber
+      return config.number === 'BigNumber' ? new BigNumber(+x) : +x;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..ccd97b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js
@@ -0,0 +1,94 @@
+import { factory } from '../../utils/factory.js';
+import { xgcdNumber } from '../../plain/number/index.js';
+var name = 'xgcd';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+export var createXgcd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the extended greatest common divisor for two values.
+   * See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+   *
+   * Syntax:
+   *
+   *    math.xgcd(a, b)
+   *
+   * Examples:
+   *
+   *    math.xgcd(8, 12)             // returns [4, -1, 1]
+   *    math.gcd(8, 12)              // returns 4
+   *    math.xgcd(36163, 21199)      // returns [1247, -7, 12]
+   *
+   * See also:
+   *
+   *    gcd, lcm
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {Array}              Returns an array containing 3 integers `[div, m, n]`
+   *                              where `div = gcd(a, b)` and `a*m + b*n = div`
+   */
+  return typed(name, {
+    'number, number': function numberNumber(a, b) {
+      var res = xgcdNumber(a, b);
+      return config.matrix === 'Array' ? res : matrix(res);
+    },
+    'BigNumber, BigNumber': _xgcdBigNumber // TODO: implement support for Fraction
+
+  });
+  /**
+   * Calculate xgcd for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @return {BigNumber[]} result
+   * @private
+   */
+
+  function _xgcdBigNumber(a, b) {
+    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+    var // used to swap two variables
+    t;
+    var // quotient
+    q;
+    var // remainder
+    r;
+    var zero = new BigNumber(0);
+    var one = new BigNumber(1);
+    var x = zero;
+    var lastx = one;
+    var y = one;
+    var lasty = zero;
+
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function xgcd must be integer numbers');
+    }
+
+    while (!b.isZero()) {
+      q = a.div(b).floor();
+      r = a.mod(b);
+      t = x;
+      x = lastx.minus(q.times(x));
+      lastx = t;
+      t = y;
+      y = lasty.minus(q.times(y));
+      lasty = t;
+      a = b;
+      b = r;
+    }
+
+    var res;
+
+    if (a.lt(zero)) {
+      res = [a.neg(), lastx.neg(), lasty.neg()];
+    } else {
+      res = [a, !a.isZero() ? lastx : 0, lasty];
+    }
+
+    return config.matrix === 'Array' ? res : matrix(res);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..3c7fdf4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js
@@ -0,0 +1,106 @@
+import { bitAndBigNumber } from '../../utils/bignumber/bitwise.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js';
+import { factory } from '../../utils/factory.js';
+import { bitAndNumber } from '../../plain/number/index.js';
+var name = 'bitAnd';
+var dependencies = ['typed', 'matrix', 'equalScalar'];
+export var createBitAnd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar
+  } = _ref;
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm06 = createAlgorithm06({
+    typed,
+    equalScalar
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Bitwise AND two values, `x & y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitAnd(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitAnd(53, 131)               // returns number 1
+   *
+   *    math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]
+   *
+   * See also:
+   *
+   *    bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x First value to and
+   * @param  {number | BigNumber | Array | Matrix} y Second value to and
+   * @return {number | BigNumber | Array | Matrix} AND of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': bitAndNumber,
+    'BigNumber, BigNumber': bitAndBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm06(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm11(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitNot.js b/node_modules/mathjs/lib/esm/function/bitwise/bitNot.js
new file mode 100644
index 0000000..39f66d3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitNot.js
@@ -0,0 +1,41 @@
+import { bitNotBigNumber } from '../../utils/bignumber/bitwise.js';
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { bitNotNumber } from '../../plain/number/index.js';
+var name = 'bitNot';
+var dependencies = ['typed'];
+export var createBitNot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Bitwise NOT value, `~x`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.bitNot(x)
+   *
+   * Examples:
+   *
+   *    math.bitNot(1)               // returns number -2
+   *
+   *    math.bitNot([2, -3, 4])      // returns Array [-3, 2, 5]
+   *
+   * See also:
+   *
+   *    bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x Value to not
+   * @return {number | BigNumber | Array | Matrix} NOT of `x`
+   */
+  return typed(name, {
+    number: bitNotNumber,
+    BigNumber: bitNotBigNumber,
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitOr.js b/node_modules/mathjs/lib/esm/function/bitwise/bitOr.js
new file mode 100644
index 0000000..1f54b35
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitOr.js
@@ -0,0 +1,107 @@
+import { bitOrBigNumber } from '../../utils/bignumber/bitwise.js';
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { bitOrNumber } from '../../plain/number/index.js';
+var name = 'bitOr';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+export var createBitOr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm04 = createAlgorithm04({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Bitwise OR two values, `x | y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the lowest print base.
+   *
+   * Syntax:
+   *
+   *    math.bitOr(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitOr(1, 2)               // returns number 3
+   *
+   *    math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x First value to or
+   * @param  {number | BigNumber | Array | Matrix} y Second value to or
+   * @return {number | BigNumber | Array | Matrix} OR of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': bitOrNumber,
+    'BigNumber, BigNumber': bitOrBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm04(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm01(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm10(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm10(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitXor.js b/node_modules/mathjs/lib/esm/function/bitwise/bitXor.js
new file mode 100644
index 0000000..0d9c954
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitXor.js
@@ -0,0 +1,105 @@
+import { bitXor as bigBitXor } from '../../utils/bignumber/bitwise.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { factory } from '../../utils/factory.js';
+import { bitXorNumber } from '../../plain/number/index.js';
+var name = 'bitXor';
+var dependencies = ['typed', 'matrix', 'DenseMatrix'];
+export var createBitXor = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Bitwise XOR two values, `x ^ y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitXor(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitXor(1, 2)               // returns number 3
+   *
+   *    math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x First value to xor
+   * @param  {number | BigNumber | Array | Matrix} y Second value to xor
+   * @return {number | BigNumber | Array | Matrix} XOR of `x` and `y`
+   */
+
+  return typed(name, {
+    'number, number': bitXorNumber,
+    'BigNumber, BigNumber': bigBitXor,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/leftShift.js b/node_modules/mathjs/lib/esm/function/bitwise/leftShift.js
new file mode 100644
index 0000000..d93ce36
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/leftShift.js
@@ -0,0 +1,138 @@
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm08 } from '../../type/matrix/utils/algorithm08.js';
+import { factory } from '../../utils/factory.js';
+import { leftShiftNumber } from '../../plain/number/index.js';
+import { leftShiftBigNumber } from '../../utils/bignumber/bitwise.js';
+var name = 'leftShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+export var createLeftShift = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm08 = createAlgorithm08({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Bitwise left logical shift of a value x by y number of bits, `x << y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.leftShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.leftShift(1, 2)               // returns number 4
+   *
+   *    math.leftShift([1, 2, 3], 4)       // returns Array [16, 32, 64]
+   *
+   * See also:
+   *
+   *    leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber} y Amount of shifts
+   * @return {number | BigNumber | Array | Matrix} `x` shifted left `y` times
+   */
+
+  return typed(name, {
+    'number, number': leftShiftNumber,
+    'BigNumber, BigNumber': leftShiftBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm08(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..c835ba2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js
@@ -0,0 +1,138 @@
+import { rightArithShiftBigNumber } from '../../utils/bignumber/bitwise.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm08 } from '../../type/matrix/utils/algorithm08.js';
+import { factory } from '../../utils/factory.js';
+import { rightArithShiftNumber } from '../../plain/number/index.js';
+var name = 'rightArithShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+export var createRightArithShift = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm08 = createAlgorithm08({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightArithShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightArithShift(4, 2)               // returns number 1
+   *
+   *    math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 3]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber} y Amount of shifts
+   * @return {number | BigNumber | Array | Matrix} `x` sign-filled shifted right `y` times
+   */
+
+  return typed(name, {
+    'number, number': rightArithShiftNumber,
+    'BigNumber, BigNumber': rightArithShiftBigNumber,
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm08(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..a477ae3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js
@@ -0,0 +1,137 @@
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm08 } from '../../type/matrix/utils/algorithm08.js';
+import { factory } from '../../utils/factory.js';
+import { rightLogShiftNumber } from '../../plain/number/index.js';
+var name = 'rightLogShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+export var createRightLogShift = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm08 = createAlgorithm08({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Bitwise right logical shift of value x by y number of bits, `x >>> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightLogShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightLogShift(4, 2)               // returns number 1
+   *
+   *    math.rightLogShift([16, -32, 64], 4)   // returns Array [1, 2, 3]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift
+   *
+   * @param  {number | Array | Matrix} x Value to be shifted
+   * @param  {number} y Amount of shifts
+   * @return {number | Array | Matrix} `x` zero-filled shifted right `y` times
+   */
+
+  return typed(name, {
+    'number, number': rightLogShiftNumber,
+    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm08(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm10(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..5298a3b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js
@@ -0,0 +1,50 @@
+import { factory } from '../../utils/factory.js';
+var name = 'bellNumbers';
+var dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];
+export var createBellNumbers = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    isNegative,
+    isInteger,
+    stirlingS2
+  } = _ref;
+
+  /**
+   * The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.
+   * bellNumbers only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.bellNumbers(n)
+   *
+   * Examples:
+   *
+   *    math.bellNumbers(3) // returns 5
+   *    math.bellNumbers(8) // returns 4140
+   *
+   * See also:
+   *
+   *    stirlingS2
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @return {Number | BigNumber}     B(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function bellNumbers');
+      } // Sum (k=0, n) S(n,k).
+
+
+      var result = 0;
+
+      for (var i = 0; i <= n; i++) {
+        result = addScalar(result, stirlingS2(n, i));
+      }
+
+      return result;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/catalan.js b/node_modules/mathjs/lib/esm/function/combinatorics/catalan.js
new file mode 100644
index 0000000..18191c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/catalan.js
@@ -0,0 +1,45 @@
+import { factory } from '../../utils/factory.js';
+var name = 'catalan';
+var dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];
+export var createCatalan = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    combinations,
+    isNegative,
+    isInteger
+  } = _ref;
+
+  /**
+   * The Catalan Numbers enumerate combinatorial structures of many different types.
+   * catalan only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.catalan(n)
+   *
+   * Examples:
+   *
+   *    math.catalan(3) // returns 5
+   *    math.catalan(8) // returns 1430
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    nth Catalan number
+   * @return {Number | BigNumber}     Cn(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function catalan');
+      }
+
+      return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/composition.js b/node_modules/mathjs/lib/esm/function/combinatorics/composition.js
new file mode 100644
index 0000000..d2699c0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/composition.js
@@ -0,0 +1,48 @@
+import { factory } from '../../utils/factory.js';
+var name = 'composition';
+var dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];
+export var createComposition = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    combinations,
+    isPositive,
+    isNegative,
+    isInteger,
+    larger
+  } = _ref;
+
+  /**
+   * The composition counts of n into k parts.
+   *
+   * composition only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *   math.composition(n, k)
+   *
+   * Examples:
+   *
+   *    math.composition(5, 3) // returns 6
+   *
+   * See also:
+   *
+   *    combinations
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     Returns the composition counts of n into k parts.
+   */
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {
+      if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {
+        throw new TypeError('Positive integer value expected in function composition');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function composition');
+      }
+
+      return combinations(addScalar(n, -1), addScalar(k, -1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..7f53a6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js
@@ -0,0 +1,94 @@
+import { factory } from '../../utils/factory.js';
+import { isNumber } from '../../utils/is.js';
+var name = 'stirlingS2';
+var dependencies = ['typed', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'number', '?bignumber', 'larger'];
+export var createStirlingS2 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    subtract,
+    multiplyScalar,
+    divideScalar,
+    pow,
+    factorial,
+    combinations,
+    isNegative,
+    isInteger,
+    number,
+    bignumber,
+    larger
+  } = _ref;
+  var smallCache = [];
+  var bigCache = [];
+  /**
+   * The Stirling numbers of the second kind, counts the number of ways to partition
+   * a set of n labelled objects into k nonempty unlabelled subsets.
+   * stirlingS2 only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   *  If n = k or k = 1 <= n, then s(n,k) = 1
+   *  If k = 0 < n, then s(n,k) = 0
+   *
+   * Note that if either n or k is supplied as a BigNumber, the result will be
+   * as well.
+   *
+   * Syntax:
+   *
+   *   math.stirlingS2(n, k)
+   *
+   * Examples:
+   *
+   *    math.stirlingS2(5, 3) //returns 25
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     S(n,k)
+   */
+
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {
+      if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {
+        throw new TypeError('Non-negative integer value expected in function stirlingS2');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function stirlingS2');
+      }
+
+      var big = !(isNumber(n) && isNumber(k));
+      var cache = big ? bigCache : smallCache;
+      var make = big ? bignumber : number;
+      var nn = number(n);
+      var nk = number(k);
+      /* See if we already have the value: */
+
+      if (cache[nn] && cache[nn].length > nk) {
+        return cache[nn][nk];
+      }
+      /* Fill the cache */
+
+
+      for (var m = 0; m <= nn; ++m) {
+        if (!cache[m]) {
+          cache[m] = [m === 0 ? make(1) : make(0)];
+        }
+
+        if (m === 0) continue;
+        var row = cache[m];
+        var prev = cache[m - 1];
+
+        for (var i = row.length; i <= m && i <= nk; ++i) {
+          if (i === m) {
+            row[i] = 1;
+          } else {
+            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1]);
+          }
+        }
+      }
+
+      return cache[nn][nk];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/arg.js b/node_modules/mathjs/lib/esm/function/complex/arg.js
new file mode 100644
index 0000000..317b7bc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/arg.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'arg';
+var dependencies = ['typed'];
+export var createArg = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Compute the argument of a complex value.
+   * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.arg(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 2)
+   *    math.arg(a) / math.pi          // returns number 0.25
+   *
+   *    const b = math.complex('2 + 3i')
+   *    math.arg(b)                    // returns number 0.982793723247329
+   *    math.atan2(3, 2)               // returns number 0.982793723247329
+   *
+   * See also:
+   *
+   *    re, im, conj, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The argument of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return Math.atan2(0, x);
+    },
+    BigNumber: function BigNumber(x) {
+      return x.constructor.atan2(0, x);
+    },
+    Complex: function Complex(x) {
+      return x.arg();
+    },
+    // TODO: implement BigNumber support for function arg
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/conj.js b/node_modules/mathjs/lib/esm/function/complex/conj.js
new file mode 100644
index 0000000..7aecbba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/conj.js
@@ -0,0 +1,49 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'conj';
+var dependencies = ['typed'];
+export var createConj = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Compute the complex conjugate of a complex value.
+   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.conj(x)
+   *
+   * Examples:
+   *
+   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i
+   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i
+   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i
+   *
+   * See also:
+   *
+   *    re, im, arg, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            The complex conjugate of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return x;
+    },
+    BigNumber: function BigNumber(x) {
+      return x;
+    },
+    Complex: function Complex(x) {
+      return x.conjugate();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/im.js b/node_modules/mathjs/lib/esm/function/complex/im.js
new file mode 100644
index 0000000..b5fa08e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/im.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'im';
+var dependencies = ['typed'];
+export var createIm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Get the imaginary part of a complex number.
+   * For a complex number `a + bi`, the function returns `b`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.im(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number -5.2
+   *    math.re(math.complex(2.4))     // returns number 0
+   *
+   * See also:
+   *
+   *    re, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The imaginary part of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return 0;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.mul(0);
+    },
+    Fraction: function Fraction(x) {
+      return x.mul(0);
+    },
+    Complex: function Complex(x) {
+      return x.im;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/re.js b/node_modules/mathjs/lib/esm/function/complex/re.js
new file mode 100644
index 0000000..5d65283
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/re.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 're';
+var dependencies = ['typed'];
+export var createRe = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Get the real part of a complex number.
+   * For a complex number `a + bi`, the function returns `a`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.re(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number 0
+   *    math.re(math.complex(2.4))     // returns number 2.4
+   *
+   * See also:
+   *
+   *    im, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The real part of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return x;
+    },
+    BigNumber: function BigNumber(x) {
+      return x;
+    },
+    Fraction: function Fraction(x) {
+      return x;
+    },
+    Complex: function Complex(x) {
+      return x.re;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/geometry/distance.js b/node_modules/mathjs/lib/esm/function/geometry/distance.js
new file mode 100644
index 0000000..e9f38fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/geometry/distance.js
@@ -0,0 +1,348 @@
+import { isBigNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'distance';
+var dependencies = ['typed', 'addScalar', 'subtract', 'divideScalar', 'multiplyScalar', 'unaryMinus', 'sqrt', 'abs'];
+export var createDistance = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    subtract,
+    multiplyScalar,
+    divideScalar,
+    unaryMinus,
+    sqrt,
+    abs
+  } = _ref;
+
+  /**
+    * Calculates:
+    *    The eucledian distance between two points in N-dimensional spaces.
+    *    Distance between point and a line in 2 and 3 dimensional spaces.
+    *    Pairwise distance between a set of 2D or 3D points
+    * NOTE:
+    *    When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c
+    *    For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)
+    *
+    * Syntax:
+    *    math.distance([x1, y1], [x2, y2])
+    *-   math.distance({pointOneX: 4, pointOneY: 5}, {pointTwoX: 2, pointTwoY: 7})
+    *    math.distance([x1, y1, z1], [x2, y2, z2])
+    *    math.distance({pointOneX: 4, pointOneY: 5, pointOneZ: 8}, {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})
+    *    math.distance([x1, y1, ... , N1], [x2, y2, ... , N2])
+    *    math.distance([[A], [B], [C]...])
+    *    math.distance([x1, y1], [LinePtX1, LinePtY1], [LinePtX2, LinePtY2])
+    *    math.distance({pointX: 1, pointY: 4}, {lineOnePtX: 6, lineOnePtY: 3}, {lineTwoPtX: 2, lineTwoPtY: 8})
+    *    math.distance([x1, y1, z1], [LinePtX1, LinePtY1, LinePtZ1], [LinePtX2, LinePtY2, LinePtZ2])
+    *    math.distance({pointX: 1, pointY: 4, pointZ: 7}, {lineOnePtX: 6, lineOnePtY: 3, lineOnePtZ: 4}, {lineTwoPtX: 2, lineTwoPtY: 8, lineTwoPtZ: 5})
+    *    math.distance([x1, y1], [xCoeffLine, yCoeffLine, constant])
+    *    math.distance({pointX: 10, pointY: 10}, {xCoeffLine: 8, yCoeffLine: 1, constant: 3})
+    *    math.distance([x1, y1, z1], [x0, y0, z0, a-tCoeff, b-tCoeff, c-tCoeff]) point and parametric equation of 3D line
+    *    math.distance([x, y, z], [x0, y0, z0, a, b, c])
+    *    math.distance({pointX: 2, pointY: 5, pointZ: 9}, {x0: 4, y0: 6, z0: 3, a: 4, b: 2, c: 0})
+    *
+    * Examples:
+    *    math.distance([0,0], [4,4])                     // Returns 5.6569
+    *    math.distance(
+    *     {pointOneX: 0, pointOneY: 0},
+    *     {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951
+    *    math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.74166
+    *    math.distance(
+    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},
+    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3
+    *    math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2
+    *    math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]
+    *    math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]
+    *    math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387
+    *    math.distance([10, 10], [2, 3], [-8, 0])        // Returns 8.759953130362847
+    *    math.distance(
+    *     {pointX: 1, pointY: 4},
+    *     {lineOnePtX: 6, lineOnePtY: 3},
+    *     {lineTwoPtX: 2, lineTwoPtY: 8})                // Returns 2.720549372624744
+    *    math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857
+    *    math.distance(
+    *     {pointX: 2, pointY: 3, pointZ: 1},
+    *     {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1}        // Returns 2.3204774044612857
+    *
+    * @param {Array | Matrix | Object} x    Co-ordinates of first point
+    * @param {Array | Matrix | Object} y    Co-ordinates of second point
+    * @return {Number | BigNumber} Returns the distance from two/three points
+  */
+  return typed(name, {
+    'Array, Array, Array': function ArrayArrayArray(x, y, z) {
+      // Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)
+      if (x.length === 2 && y.length === 2 && z.length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+
+        if (!_2d(y)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+        }
+
+        if (!_2d(z)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+        }
+
+        var m = divideScalar(subtract(z[1], z[0]), subtract(y[1], y[0]));
+        var xCoeff = multiplyScalar(multiplyScalar(m, m), y[0]);
+        var yCoeff = unaryMinus(multiplyScalar(m, y[0]));
+        var constant = x[1];
+        return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object, Object': function ObjectObjectObject(x, y, z) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+
+        if (!_2d(y)) {
+          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');
+        }
+
+        if (!_2d(z)) {
+          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');
+        }
+
+        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {
+          var m = divideScalar(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX));
+          var xCoeff = multiplyScalar(multiplyScalar(m, m), y.lineOnePtX);
+          var yCoeff = unaryMinus(multiplyScalar(m, y.lineOnePtX));
+          var constant = x.pointX;
+          return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])
+      if (x.length === 2 && y.length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+
+        if (!_3d(y)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+        }
+
+        return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2]);
+      } else if (x.length === 3 && y.length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+        }
+
+        if (!_parametricLine(y)) {
+          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument');
+        }
+
+        return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5]);
+      } else if (x.length === y.length && x.length > 0) {
+        // Point to Point N-dimensions
+        if (!_containsOnlyNumbers(x)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+
+        if (!_containsOnlyNumbers(y)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+
+        return _euclideanDistance(x, y);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object': function ObjectObject(x, y) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+
+        if (!_3d(y)) {
+          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');
+        }
+
+        if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {
+          return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers');
+        }
+
+        if (!_parametricLine(y)) {
+          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');
+        }
+
+        if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {
+          return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {
+        // Point to Point 2D
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers');
+        }
+
+        if (!_2d(y)) {
+          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');
+        }
+
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY], [y.pointTwoX, y.pointTwoY]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {
+        // Point to Point 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers');
+        }
+
+        if (!_3d(y)) {
+          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');
+        }
+
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY, x.pointOneZ], [y.pointTwoX, y.pointTwoY, y.pointTwoZ]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    Array: function Array(arr) {
+      if (!_pairwise(arr)) {
+        throw new TypeError('Incorrect array format entered for pairwise distance calculation');
+      }
+
+      return _distancePairwise(arr);
+    }
+  });
+
+  function _isNumber(a) {
+    // distance supports numbers and bignumbers
+    return typeof a === 'number' || isBigNumber(a);
+  }
+
+  function _2d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+
+    return _isNumber(a[0]) && _isNumber(a[1]);
+  }
+
+  function _3d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]);
+  }
+
+  function _containsOnlyNumbers(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (!Array.isArray(a)) {
+      a = _objectToArray(a);
+    }
+
+    return a.every(_isNumber);
+  }
+
+  function _parametricLine(a) {
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);
+  }
+
+  function _objectToArray(o) {
+    var keys = Object.keys(o);
+    var a = [];
+
+    for (var i = 0; i < keys.length; i++) {
+      a.push(o[keys[i]]);
+    }
+
+    return a;
+  }
+
+  function _pairwise(a) {
+    // checks for valid arguments passed to _distancePairwise(Array)
+    if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {
+      if (a.some(aI => aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]))) {
+        return false;
+      }
+    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {
+      if (a.some(aI => aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]))) {
+        return false;
+      }
+    } else {
+      return false;
+    }
+
+    return true;
+  }
+
+  function _distancePointLine2D(x, y, a, b, c) {
+    var num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));
+    var den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)));
+    return divideScalar(num, den);
+  }
+
+  function _distancePointLine3D(x, y, z, x0, y0, z0, a, b, c) {
+    var num = [subtract(multiplyScalar(subtract(y0, y), c), multiplyScalar(subtract(z0, z), b)), subtract(multiplyScalar(subtract(z0, z), a), multiplyScalar(subtract(x0, x), c)), subtract(multiplyScalar(subtract(x0, x), b), multiplyScalar(subtract(y0, y), a))];
+    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));
+    var den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)));
+    return divideScalar(num, den);
+  }
+
+  function _euclideanDistance(x, y) {
+    var vectorSize = x.length;
+    var result = 0;
+    var diff = 0;
+
+    for (var i = 0; i < vectorSize; i++) {
+      diff = subtract(x[i], y[i]);
+      result = addScalar(multiplyScalar(diff, diff), result);
+    }
+
+    return sqrt(result);
+  }
+
+  function _distancePairwise(a) {
+    var result = [];
+    var pointA = [];
+    var pointB = [];
+
+    for (var i = 0; i < a.length - 1; i++) {
+      for (var j = i + 1; j < a.length; j++) {
+        if (a[0].length === 2) {
+          pointA = [a[i][0], a[i][1]];
+          pointB = [a[j][0], a[j][1]];
+        } else if (a[0].length === 3) {
+          pointA = [a[i][0], a[i][1], a[i][2]];
+          pointB = [a[j][0], a[j][1], a[j][2]];
+        }
+
+        result.push(_euclideanDistance(pointA, pointB));
+      }
+    }
+
+    return result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/geometry/intersect.js b/node_modules/mathjs/lib/esm/function/geometry/intersect.js
new file mode 100644
index 0000000..4947cf9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/geometry/intersect.js
@@ -0,0 +1,233 @@
+import { factory } from '../../utils/factory.js';
+var name = 'intersect';
+var dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'];
+export var createIntersect = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    abs,
+    add,
+    addScalar,
+    matrix,
+    multiply,
+    multiplyScalar,
+    divideScalar,
+    subtract,
+    smaller,
+    equalScalar,
+    flatten,
+    isZero,
+    isNumeric
+  } = _ref;
+
+  /**
+   * Calculates the point of intersection of two lines in two or three dimensions
+   * and of a line and a plane in three dimensions. The inputs are in the form of
+   * arrays or 1 dimensional matrices. The line intersection functions return null
+   * if the lines do not meet.
+   *
+   * Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.
+   *
+   * Syntax:
+   *
+   *    math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)
+   *    math.intersect(endPoint1, endPoint2, planeCoefficients)
+   *
+   * Examples:
+   *
+   *    math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]
+   *    math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]
+   *    math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]
+   *
+   * @param  {Array | Matrix} w   Co-ordinates of first end-point of first line
+   * @param  {Array | Matrix} x   Co-ordinates of second end-point of first line
+   * @param  {Array | Matrix} y   Co-ordinates of first end-point of second line
+   *                              OR Co-efficients of the plane's equation
+   * @param  {Array | Matrix} z   Co-ordinates of second end-point of second line
+   *                              OR undefined if the calculation is for line and plane
+   * @return {Array}              Returns the point of intersection of lines/lines-planes
+   */
+  return typed('intersect', {
+    'Array, Array, Array': _AAA,
+    'Array, Array, Array, Array': _AAAA,
+    'Matrix, Matrix, Matrix': function MatrixMatrixMatrix(x, y, plane) {
+      var arr = _AAA(x.valueOf(), y.valueOf(), plane.valueOf());
+
+      return arr === null ? null : matrix(arr);
+    },
+    'Matrix, Matrix, Matrix, Matrix': function MatrixMatrixMatrixMatrix(w, x, y, z) {
+      // TODO: output matrix type should match input matrix type
+      var arr = _AAAA(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf());
+
+      return arr === null ? null : matrix(arr);
+    }
+  });
+
+  function _AAA(x, y, plane) {
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    plane = _coerceArr(plane);
+
+    if (!_3d(x)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+    }
+
+    if (!_3d(y)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+    }
+
+    if (!_4d(plane)) {
+      throw new TypeError('Array with 4 numbers expected as third argument');
+    }
+
+    return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3]);
+  }
+
+  function _AAAA(w, x, y, z) {
+    w = _coerceArr(w);
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    z = _coerceArr(z);
+
+    if (w.length === 2) {
+      if (!_2d(w)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+      }
+
+      if (!_2d(x)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+      }
+
+      if (!_2d(y)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+      }
+
+      if (!_2d(z)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');
+      }
+
+      return _intersect2d(w, x, y, z);
+    } else if (w.length === 3) {
+      if (!_3d(w)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+      }
+
+      if (!_3d(x)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+      }
+
+      if (!_3d(y)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');
+      }
+
+      if (!_3d(z)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');
+      }
+
+      return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2]);
+    } else {
+      throw new TypeError('Arrays with two or thee dimensional points expected');
+    }
+  }
+  /** Coerce row and column 2-dim arrays to 1-dim array */
+
+
+  function _coerceArr(arr) {
+    // row matrix
+    if (arr.length === 1) return arr[0]; // column matrix
+
+    if (arr.length > 1 && Array.isArray(arr[0])) {
+      if (arr.every(el => Array.isArray(el) && el.length === 1)) return flatten(arr);
+    }
+
+    return arr;
+  }
+
+  function _2d(x) {
+    return x.length === 2 && isNumeric(x[0]) && isNumeric(x[1]);
+  }
+
+  function _3d(x) {
+    return x.length === 3 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]);
+  }
+
+  function _4d(x) {
+    return x.length === 4 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]) && isNumeric(x[3]);
+  }
+
+  function _intersect2d(p1a, p1b, p2a, p2b) {
+    var o1 = p1a;
+    var o2 = p2a;
+    var d1 = subtract(o1, p1b);
+    var d2 = subtract(o2, p2b);
+    var det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));
+    if (isZero(det)) return null;
+
+    if (smaller(abs(det), config.epsilon)) {
+      return null;
+    }
+
+    var d20o11 = multiplyScalar(d2[0], o1[1]);
+    var d21o10 = multiplyScalar(d2[1], o1[0]);
+    var d20o21 = multiplyScalar(d2[0], o2[1]);
+    var d21o20 = multiplyScalar(d2[1], o2[0]);
+    var t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det);
+    return add(multiply(d1, t), o1);
+  }
+
+  function _intersect3dHelper(a, b, c, d, e, f, g, h, i, j, k, l) {
+    // (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)
+    var add1 = multiplyScalar(subtract(a, b), subtract(c, d));
+    var add2 = multiplyScalar(subtract(e, f), subtract(g, h));
+    var add3 = multiplyScalar(subtract(i, j), subtract(k, l));
+    return addScalar(addScalar(add1, add2), add3);
+  }
+
+  function _intersect3d(x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {
+    var d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);
+
+    var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);
+
+    var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);
+
+    var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);
+
+    var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);
+
+    var numerator = subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343));
+    var denominator = subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321));
+    if (isZero(denominator)) return null;
+    var ta = divideScalar(numerator, denominator);
+    var tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);
+    var pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));
+    var pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));
+    var paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));
+    var pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));
+    var pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));
+    var pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));
+
+    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {
+      return [pax, pay, paz];
+    } else {
+      return null;
+    }
+  }
+
+  function _intersectLinePlane(x1, y1, z1, x2, y2, z2, x, y, z, c) {
+    var x1x = multiplyScalar(x1, x);
+    var x2x = multiplyScalar(x2, x);
+    var y1y = multiplyScalar(y1, y);
+    var y2y = multiplyScalar(y2, y);
+    var z1z = multiplyScalar(z1, z);
+    var z2z = multiplyScalar(z2, z);
+    var numerator = subtract(subtract(subtract(c, x1x), y1y), z1z);
+    var denominator = subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z);
+    var t = divideScalar(numerator, denominator);
+    var px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));
+    var py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));
+    var pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));
+    return [px, py, pz]; // TODO: Add cases when line is parallel to the plane:
+    //       (a) no intersection,
+    //       (b) line contained in plane
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/and.js b/node_modules/mathjs/lib/esm/function/logical/and.js
new file mode 100644
index 0000000..8795cf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/and.js
@@ -0,0 +1,145 @@
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm06 } from '../../type/matrix/utils/algorithm06.js';
+import { factory } from '../../utils/factory.js';
+import { andNumber } from '../../plain/number/index.js';
+var name = 'and';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not'];
+export var createAnd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not
+  } = _ref;
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm06 = createAlgorithm06({
+    typed,
+    equalScalar
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.and(x, y)
+   *
+   * Examples:
+   *
+   *    math.and(2, 4)   // returns true
+   *
+   *    a = [2, 0, 0]
+   *    b = [3, 7, 0]
+   *    c = 0
+   *
+   *    math.and(a, b)   // returns [true, false, false]
+   *    math.and(a, c)   // returns [false, false, false]
+   *
+   * See also:
+   *
+   *    not, or, xor
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when both inputs are defined with a nonzero/nonempty value.
+   */
+
+  return typed(name, {
+    'number, number': andNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return this(x.value || 0, y.value || 0);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm06(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm02(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm11(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y)).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/not.js b/node_modules/mathjs/lib/esm/function/logical/not.js
new file mode 100644
index 0000000..5068f1d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/not.js
@@ -0,0 +1,51 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { notNumber } from '../../plain/number/index.js';
+var name = 'not';
+var dependencies = ['typed'];
+export var createNot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Logical `not`. Flips boolean value of a given parameter.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.not(x)
+   *
+   * Examples:
+   *
+   *    math.not(2)      // returns false
+   *    math.not(0)      // returns true
+   *    math.not(true)   // returns false
+   *
+   *    a = [2, -7, 0]
+   *    math.not(a)      // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    and, or, xor
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when input is a zero or empty value.
+   */
+  return typed(name, {
+    number: notNumber,
+    Complex: function Complex(x) {
+      return x.re === 0 && x.im === 0;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.isZero() || x.isNaN();
+    },
+    Unit: function Unit(x) {
+      return x.value !== null ? this(x.value) : true;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/or.js b/node_modules/mathjs/lib/esm/function/logical/or.js
new file mode 100644
index 0000000..f31c5f9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/or.js
@@ -0,0 +1,119 @@
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js';
+import { factory } from '../../utils/factory.js';
+import { orNumber } from '../../plain/number/index.js';
+var name = 'or';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+export var createOr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm05 = createAlgorithm05({
+    typed,
+    equalScalar
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.or(x, y)
+   *
+   * Examples:
+   *
+   *    math.or(2, 4)   // returns true
+   *
+   *    a = [2, 5, 0]
+   *    b = [0, 22, 0]
+   *    c = 0
+   *
+   *    math.or(a, b)   // returns [true, true, false]
+   *    math.or(b, c)   // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    and, not, xor
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one of the inputs is defined with a nonzero/nonempty value.
+   */
+
+  return typed(name, {
+    'number, number': orNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return this(x.value || 0, y.value || 0);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm05(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/xor.js b/node_modules/mathjs/lib/esm/function/logical/xor.js
new file mode 100644
index 0000000..6949dea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/xor.js
@@ -0,0 +1,118 @@
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { factory } from '../../utils/factory.js';
+import { xorNumber } from '../../plain/number/index.js';
+var name = 'xor';
+var dependencies = ['typed', 'matrix', 'DenseMatrix'];
+export var createXor = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.xor(x, y)
+   *
+   * Examples:
+   *
+   *    math.xor(2, 4)   // returns false
+   *
+   *    a = [2, 0, 0]
+   *    b = [2, 7, 0]
+   *    c = 0
+   *
+   *    math.xor(a, b)   // returns [false, true, false]
+   *    math.xor(a, c)   // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    and, not, or
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one and only one input is defined with a nonzero/nonempty value.
+   */
+
+  return typed(name, {
+    'number, number': xorNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      return this(x.value || 0, y.value || 0);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/apply.js b/node_modules/mathjs/lib/esm/function/matrix/apply.js
new file mode 100644
index 0000000..b5dc940
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/apply.js
@@ -0,0 +1,125 @@
+import { factory } from '../../utils/factory.js';
+import { arraySize } from '../../utils/array.js';
+import { isMatrix } from '../../utils/is.js';
+import { IndexError } from '../../error/IndexError.js';
+var name = 'apply';
+var dependencies = ['typed', 'isInteger'];
+export var createApply = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isInteger
+  } = _ref;
+
+  /**
+   * Apply a function that maps an array to a scalar
+   * along a given axis of a matrix or array.
+   * Returns a new matrix or array with one less dimension than the input.
+   *
+   * Syntax:
+   *
+   *     math.apply(A, dim, callback)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [3, 4]]
+   *    const sum = math.sum
+   *
+   *    math.apply(A, 0, sum)             // returns [4, 6]
+   *    math.apply(A, 1, sum)             // returns [3, 7]
+   *
+   * See also:
+   *
+   *    map, filter, forEach
+   *
+   * @param {Array | Matrix} array   The input Matrix
+   * @param {number} dim             The dimension along which the callback is applied
+   * @param {Function} callback      The callback function that is applied. This Function
+   *                                 should take an array or 1-d matrix as an input and
+   *                                 return a number.
+   * @return {Array | Matrix} res    The residual matrix with the function applied over some dimension.
+   */
+  return typed(name, {
+    'Array | Matrix, number | BigNumber, function': function ArrayMatrixNumberBigNumberFunction(mat, dim, callback) {
+      if (!isInteger(dim)) {
+        throw new TypeError('Integer number expected for dimension');
+      }
+
+      var size = Array.isArray(mat) ? arraySize(mat) : mat.size();
+
+      if (dim < 0 || dim >= size.length) {
+        throw new IndexError(dim, size.length);
+      }
+
+      if (isMatrix(mat)) {
+        return mat.create(_apply(mat.valueOf(), dim, callback));
+      } else {
+        return _apply(mat, dim, callback);
+      }
+    }
+  });
+});
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+
+function _apply(mat, dim, callback) {
+  var i, ret, tran;
+
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      return callback(mat);
+    } else {
+      tran = _switch(mat);
+      ret = [];
+
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _apply(tran[i], dim - 1, callback);
+      }
+
+      return ret;
+    }
+  } else {
+    ret = [];
+
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _apply(mat[i], dim - 1, callback);
+    }
+
+    return ret;
+  }
+}
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+
+
+function _switch(mat) {
+  var I = mat.length;
+  var J = mat[0].length;
+  var i, j;
+  var ret = [];
+
+  for (j = 0; j < J; j++) {
+    var tmp = [];
+
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+
+    ret.push(tmp);
+  }
+
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/column.js b/node_modules/mathjs/lib/esm/function/matrix/column.js
new file mode 100644
index 0000000..c7dd02c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/column.js
@@ -0,0 +1,59 @@
+import { factory } from '../../utils/factory.js';
+import { clone } from '../../utils/object.js';
+import { validateIndex } from '../../utils/array.js';
+var name = 'column';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+export var createColumn = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+
+  /**
+   * Return a column from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.column(value, index)
+   *
+   * Example:
+   *
+   *     // get a column
+   *     const d = [[1, 2], [3, 4]]
+   *     math.column(d, 1) // returns [[2], [4]]
+   *
+   * See also:
+   *
+   *     row
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} column           The index of the column
+   * @return {Array | Matrix}         The retrieved column
+   */
+  return typed(name, {
+    'Matrix, number': _column,
+    'Array, number': function ArrayNumber(value, column) {
+      return _column(matrix(clone(value)), column).valueOf();
+    }
+  });
+  /**
+   * Retrieve a column of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} column  The index of the column
+   * @return {Matrix}        The retrieved column
+   */
+
+  function _column(value, column) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+
+    validateIndex(column, value.size()[1]);
+    var rowRange = range(0, value.size()[0]);
+    var index = new Index(rowRange, column);
+    return value.subset(index);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/concat.js b/node_modules/mathjs/lib/esm/function/matrix/concat.js
new file mode 100644
index 0000000..17ad023
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/concat.js
@@ -0,0 +1,140 @@
+import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { arraySize } from '../../utils/array.js';
+import { IndexError } from '../../error/IndexError.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { factory } from '../../utils/factory.js';
+var name = 'concat';
+var dependencies = ['typed', 'matrix', 'isInteger'];
+export var createConcat = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    isInteger
+  } = _ref;
+
+  /**
+   * Concatenate two or more matrices.
+   *
+   * Syntax:
+   *
+   *     math.concat(A, B, C, ...)
+   *     math.concat(A, B, C, ..., dim)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *   By default the last dimension of the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [5, 6]]
+   *    const B = [[3, 4], [7, 8]]
+   *
+   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]
+   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]
+   *    math.concat('hello', ' ', 'world') // returns 'hello world'
+   *
+   * See also:
+   *
+   *    size, squeeze, subset, transpose
+   *
+   * @param {... Array | Matrix} args     Two or more matrices
+   * @return {Array | Matrix} Concatenated matrix
+   */
+  return typed(name, {
+    // TODO: change signature to '...Array | Matrix, dim?' when supported
+    '...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumber(args) {
+      var i;
+      var len = args.length;
+      var dim = -1; // zero-based dimension
+
+      var prevDim;
+      var asMatrix = false;
+      var matrices = []; // contains multi dimensional arrays
+
+      for (i = 0; i < len; i++) {
+        var arg = args[i]; // test whether we need to return a Matrix (if not we return an Array)
+
+        if (isMatrix(arg)) {
+          asMatrix = true;
+        }
+
+        if (isNumber(arg) || isBigNumber(arg)) {
+          if (i !== len - 1) {
+            throw new Error('Dimension must be specified as last argument');
+          } // last argument contains the dimension on which to concatenate
+
+
+          prevDim = dim;
+          dim = arg.valueOf(); // change BigNumber to number
+
+          if (!isInteger(dim)) {
+            throw new TypeError('Integer number expected for dimension');
+          }
+
+          if (dim < 0 || i > 0 && dim > prevDim) {
+            // TODO: would be more clear when throwing a DimensionError here
+            throw new IndexError(dim, prevDim + 1);
+          }
+        } else {
+          // this is a matrix or array
+          var m = clone(arg).valueOf();
+          var size = arraySize(m);
+          matrices[i] = m;
+          prevDim = dim;
+          dim = size.length - 1; // verify whether each of the matrices has the same number of dimensions
+
+          if (i > 0 && dim !== prevDim) {
+            throw new DimensionError(prevDim + 1, dim + 1);
+          }
+        }
+      }
+
+      if (matrices.length === 0) {
+        throw new SyntaxError('At least one matrix expected');
+      }
+
+      var res = matrices.shift();
+
+      while (matrices.length) {
+        res = _concat(res, matrices.shift(), dim, 0);
+      }
+
+      return asMatrix ? matrix(res) : res;
+    },
+    '...string': function string(args) {
+      return args.join('');
+    }
+  });
+});
+/**
+ * Recursively concatenate two matrices.
+ * The contents of the matrices is not cloned.
+ * @param {Array} a             Multi dimensional array
+ * @param {Array} b             Multi dimensional array
+ * @param {number} concatDim    The dimension on which to concatenate (zero-based)
+ * @param {number} dim          The current dim (zero-based)
+ * @return {Array} c            The concatenated matrix
+ * @private
+ */
+
+function _concat(a, b, concatDim, dim) {
+  if (dim < concatDim) {
+    // recurse into next dimension
+    if (a.length !== b.length) {
+      throw new DimensionError(a.length, b.length);
+    }
+
+    var c = [];
+
+    for (var i = 0; i < a.length; i++) {
+      c[i] = _concat(a[i], b[i], concatDim, dim + 1);
+    }
+
+    return c;
+  } else {
+    // concatenate this dimension
+    return a.concat(b);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/count.js b/node_modules/mathjs/lib/esm/function/matrix/count.js
new file mode 100644
index 0000000..c05e2ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/count.js
@@ -0,0 +1,40 @@
+import { factory } from '../../utils/factory.js';
+var name = 'count';
+var dependencies = ['typed', 'size', 'prod'];
+export var createCount = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    prod
+  } = _ref;
+
+  /**
+   * Count the number of elements of a matrix, array or string.
+   *
+   * Syntax:
+   *
+   *     math.count(x)
+   *
+   * Examples:
+   *
+   *     math.count('hello world')        // returns 11
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.count(A)                    // returns 6
+   *     math.count(math.range(1,6))      // returns 5
+   *
+   * See also:
+   *
+   *     size
+   *
+   * @param {string | Array | Matrix} x  A matrix or string
+   * @return {number} An integer with the elements in `x`.
+   */
+  return typed(name, {
+    string: function string(x) {
+      return x.length;
+    },
+    'Matrix | Array': function MatrixArray(x) {
+      return prod(size(x));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/cross.js b/node_modules/mathjs/lib/esm/function/matrix/cross.js
new file mode 100644
index 0000000..f7cf9ca
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/cross.js
@@ -0,0 +1,85 @@
+import { arraySize, squeeze } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'cross';
+var dependencies = ['typed', 'matrix', 'subtract', 'multiply'];
+export var createCross = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtract,
+    multiply
+  } = _ref;
+
+  /**
+   * Calculate the cross product for two vectors in three dimensional space.
+   * The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined
+   * as:
+   *
+   *    cross(A, B) = [
+   *      a2 * b3 - a3 * b2,
+   *      a3 * b1 - a1 * b3,
+   *      a1 * b2 - a2 * b1
+   *    ]
+   *
+   * If one of the input vectors has a dimension greater than 1, the output
+   * vector will be a 1x3 (2-dimensional) matrix.
+   *
+   * Syntax:
+   *
+   *    math.cross(x, y)
+   *
+   * Examples:
+   *
+   *    math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]
+   *    math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]
+   *    math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]
+   *    math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]
+   *
+   * See also:
+   *
+   *    dot, multiply
+   *
+   * @param  {Array | Matrix} x   First vector
+   * @param  {Array | Matrix} y   Second vector
+   * @return {Array | Matrix}     Returns the cross product of `x` and `y`
+   */
+  return typed(name, {
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      return matrix(_cross(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      return matrix(_cross(x.toArray(), y));
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      return matrix(_cross(x, y.toArray()));
+    },
+    'Array, Array': _cross
+  });
+  /**
+   * Calculate the cross product for two arrays
+   * @param {Array} x  First vector
+   * @param {Array} y  Second vector
+   * @returns {Array} Returns the cross product of x and y
+   * @private
+   */
+
+  function _cross(x, y) {
+    var highestDimension = Math.max(arraySize(x).length, arraySize(y).length);
+    x = squeeze(x);
+    y = squeeze(y);
+    var xSize = arraySize(x);
+    var ySize = arraySize(y);
+
+    if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {
+      throw new RangeError('Vectors with length 3 expected ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');
+    }
+
+    var product = [subtract(multiply(x[1], y[2]), multiply(x[2], y[1])), subtract(multiply(x[2], y[0]), multiply(x[0], y[2])), subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))];
+
+    if (highestDimension > 1) {
+      return [product];
+    } else {
+      return product;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/ctranspose.js b/node_modules/mathjs/lib/esm/function/matrix/ctranspose.js
new file mode 100644
index 0000000..9e56b8b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/ctranspose.js
@@ -0,0 +1,38 @@
+import { factory } from '../../utils/factory.js';
+var name = 'ctranspose';
+var dependencies = ['typed', 'transpose', 'conj'];
+export var createCtranspose = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    transpose,
+    conj
+  } = _ref;
+
+  /**
+   * Transpose and complex conjugate a matrix. All values of the matrix are
+   * reflected over its main diagonal and then the complex conjugate is
+   * taken. This is equivalent to complex conjugation for scalars and
+   * vectors.
+   *
+   * Syntax:
+   *
+   *     math.ctranspose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]
+   *     math.ctranspose(A)               // returns [[1, 4], [2, 5], [3, {re:6,im:7}]]
+   *
+   * See also:
+   *
+   *     transpose, diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be ctransposed
+   * @return {Array | Matrix}   The ctransposed matrix
+   */
+  return typed(name, {
+    any: function any(x) {
+      return conj(transpose(x));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/det.js b/node_modules/mathjs/lib/esm/function/matrix/det.js
new file mode 100644
index 0000000..04f63f9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/det.js
@@ -0,0 +1,147 @@
+import { isMatrix } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'det';
+var dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];
+export var createDet = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtract,
+    multiply,
+    unaryMinus,
+    lup
+  } = _ref;
+
+  /**
+   * Calculate the determinant of a matrix.
+   *
+   * Syntax:
+   *
+   *    math.det(x)
+   *
+   * Examples:
+   *
+   *    math.det([[1, 2], [3, 4]]) // returns -2
+   *
+   *    const A = [
+   *      [-2, 2, 3],
+   *      [-1, 1, 3],
+   *      [2, 0, -1]
+   *    ]
+   *    math.det(A) // returns 6
+   *
+   * See also:
+   *
+   *    inv
+   *
+   * @param {Array | Matrix} x  A matrix
+   * @return {number} The determinant of `x`
+   */
+  return typed(name, {
+    any: function any(x) {
+      return clone(x);
+    },
+    'Array | Matrix': function det(x) {
+      var size;
+
+      if (isMatrix(x)) {
+        size = x.size();
+      } else if (Array.isArray(x)) {
+        x = matrix(x);
+        size = x.size();
+      } else {
+        // a scalar
+        size = [];
+      }
+
+      switch (size.length) {
+        case 0:
+          // scalar
+          return clone(x);
+
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            return clone(x.valueOf()[0]);
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+          }
+
+        case 2:
+          {
+            // two dimensional array
+            var rows = size[0];
+            var cols = size[1];
+
+            if (rows === cols) {
+              return _det(x.clone().valueOf(), rows, cols);
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+            }
+          }
+
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');
+      }
+    }
+  });
+  /**
+   * Calculate the determinant of a matrix
+   * @param {Array[]} matrix  A square, two dimensional matrix
+   * @param {number} rows     Number of rows of the matrix (zero-based)
+   * @param {number} cols     Number of columns of the matrix (zero-based)
+   * @returns {number} det
+   * @private
+   */
+
+  function _det(matrix, rows, cols) {
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      return clone(matrix[0][0]);
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12
+      return subtract(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));
+    } else {
+      // Compute the LU decomposition
+      var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)
+
+      var det = decomp.U[0][0];
+
+      for (var _i = 1; _i < rows; _i++) {
+        det = multiply(det, decomp.U[_i][_i]);
+      } // The determinant will be multiplied by 1 or -1 depending on the parity of the permutation matrix.
+      // This can be determined by counting the cycles. This is roughly a linear time algorithm.
+
+
+      var evenCycles = 0;
+      var i = 0;
+      var visited = [];
+
+      while (true) {
+        while (visited[i]) {
+          i++;
+        }
+
+        if (i >= rows) break;
+        var j = i;
+        var cycleLen = 0;
+
+        while (!visited[decomp.p[j]]) {
+          visited[decomp.p[j]] = true;
+          j = decomp.p[j];
+          cycleLen++;
+        }
+
+        if (cycleLen % 2 === 0) {
+          evenCycles++;
+        }
+      }
+
+      return evenCycles % 2 === 0 ? det : unaryMinus(det);
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/diag.js b/node_modules/mathjs/lib/esm/function/matrix/diag.js
new file mode 100644
index 0000000..609b3a0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/diag.js
@@ -0,0 +1,164 @@
+import { isMatrix } from '../../utils/is.js';
+import { arraySize } from '../../utils/array.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'diag';
+var dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];
+export var createDiag = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+
+  /**
+   * Create a diagonal matrix or retrieve the diagonal of a matrix
+   *
+   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.
+   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.
+   * When k is positive, the values are placed on the super diagonal.
+   * When k is negative, the values are placed on the sub diagonal.
+   *
+   * Syntax:
+   *
+   *     math.diag(X)
+   *     math.diag(X, format)
+   *     math.diag(X, k)
+   *     math.diag(X, k, format)
+   *
+   * Examples:
+   *
+   *     // create a diagonal matrix
+   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]
+   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *
+   *    // retrieve the diagonal from a matrix
+   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
+   *    math.diag(a)   // returns [1, 5, 9]
+   *
+   * See also:
+   *
+   *     ones, zeros, identity
+   *
+   * @param {Matrix | Array} x          A two dimensional matrix or a vector
+   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled
+   *                                    in or retrieved.
+   * @param {string} [format='dense']   The matrix storage format.
+   *
+   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.
+   */
+  return typed(name, {
+    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments
+    Array: function Array(x) {
+      return _diag(x, 0, arraySize(x), null);
+    },
+    'Array, number': function ArrayNumber(x, k) {
+      return _diag(x, k, arraySize(x), null);
+    },
+    'Array, BigNumber': function ArrayBigNumber(x, k) {
+      return _diag(x, k.toNumber(), arraySize(x), null);
+    },
+    'Array, string': function ArrayString(x, format) {
+      return _diag(x, 0, arraySize(x), format);
+    },
+    'Array, number, string': function ArrayNumberString(x, k, format) {
+      return _diag(x, k, arraySize(x), format);
+    },
+    'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {
+      return _diag(x, k.toNumber(), arraySize(x), format);
+    },
+    Matrix: function Matrix(x) {
+      return _diag(x, 0, x.size(), x.storage());
+    },
+    'Matrix, number': function MatrixNumber(x, k) {
+      return _diag(x, k, x.size(), x.storage());
+    },
+    'Matrix, BigNumber': function MatrixBigNumber(x, k) {
+      return _diag(x, k.toNumber(), x.size(), x.storage());
+    },
+    'Matrix, string': function MatrixString(x, format) {
+      return _diag(x, 0, x.size(), format);
+    },
+    'Matrix, number, string': function MatrixNumberString(x, k, format) {
+      return _diag(x, k, x.size(), format);
+    },
+    'Matrix, BigNumber, string': function MatrixBigNumberString(x, k, format) {
+      return _diag(x, k.toNumber(), x.size(), format);
+    }
+  });
+  /**
+   * Creeate diagonal matrix from a vector or vice versa
+   * @param {Array | Matrix} x
+   * @param {number} k
+   * @param {string} format Storage format for matrix. If null,
+   *                          an Array is returned
+   * @returns {Array | Matrix}
+   * @private
+   */
+
+  function _diag(x, k, size, format) {
+    if (!isInteger(k)) {
+      throw new TypeError('Second parameter in function diag must be an integer');
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // check dimensions
+
+    switch (size.length) {
+      case 1:
+        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);
+
+      case 2:
+        return _getDiagonal(x, k, format, size, kSub, kSuper);
+    }
+
+    throw new RangeError('Matrix for function diag must be 2 dimensional');
+  }
+
+  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {
+    // matrix size
+    var ms = [l + kSub, l + kSuper];
+
+    if (format && format !== 'sparse' && format !== 'dense') {
+      throw new TypeError("Unknown matrix type ".concat(format, "\""));
+    } // create diagonal matrix
+
+
+    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k); // check we need to return a matrix
+
+    return format !== null ? m : m.valueOf();
+  }
+
+  function _getDiagonal(x, k, format, s, kSub, kSuper) {
+    // check x is a Matrix
+    if (isMatrix(x)) {
+      // get diagonal matrix
+      var dm = x.diagonal(k); // check we need to return a matrix
+
+      if (format !== null) {
+        // check we need to change matrix format
+        if (format !== dm.storage()) {
+          return matrix(dm, format);
+        }
+
+        return dm;
+      }
+
+      return dm.valueOf();
+    } // vector size
+
+
+    var n = Math.min(s[0] - kSub, s[1] - kSuper); // diagonal values
+
+    var vector = []; // loop diagonal
+
+    for (var i = 0; i < n; i++) {
+      vector[i] = x[i + kSub][i + kSuper];
+    } // check we need to return a matrix
+
+
+    return format !== null ? matrix(vector) : vector;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/diff.js b/node_modules/mathjs/lib/esm/function/matrix/diff.js
new file mode 100644
index 0000000..2495a13
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/diff.js
@@ -0,0 +1,183 @@
+import { factory } from '../../utils/factory.js';
+import { isInteger } from '../../utils/number.js';
+import { isMatrix } from '../../utils/is.js';
+var name = 'diff';
+var dependencies = ['typed', 'matrix', 'subtract', 'number'];
+export var createDiff = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtract,
+    number
+  } = _ref;
+
+  /**
+   * Create a new matrix or array of the difference between elements of the given array
+   * The optional dim parameter lets you specify the dimension to evaluate the difference of
+   * If no dimension parameter is passed it is assumed as dimension 0
+   *
+   * Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber
+   * Arrays must be 'rectangular' meaning arrays like [1, 2]
+   * If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays
+   *
+   * Syntax:
+   *
+   *     math.diff(arr)
+   *     math.diff(arr, dim)
+   *
+   * Examples:
+   *
+   *     const arr = [1, 2, 4, 7, 0]
+   *     math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)
+   *     math.diff(math.matrix(arr)) // returns math.matrix([1, 2, 3, -7])
+   *
+   *     const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]
+   *     math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *     math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *
+   *     math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3
+   *     math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed
+   *
+   *     // These will all produce the same result
+   *     math.diff([[1, 2], [3, 4]])
+   *     math.diff([math.matrix([1, 2]), math.matrix([3, 4])])
+   *     math.diff([[1, 2], math.matrix([3, 4])])
+   *     math.diff([math.matrix([1, 2]), [3, 4]])
+   *     // They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix
+   *
+   * See Also:
+   *
+   *      sum
+   *      subtract
+   *      partitionSelect
+   *
+   * @param {Array | Matrix} arr    An array or matrix
+   * @param {number} dim            Dimension
+   * @return {Array | Matrix}       Difference between array elements in given dimension
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(arr) {
+      // No dimension specified => assume dimension 0
+      if (isMatrix(arr)) {
+        return matrix(_diff(arr.toArray()));
+      } else {
+        return _diff(arr);
+      }
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(arr, dim) {
+      if (!isInteger(dim)) throw new RangeError('Dimension must be a whole number');
+
+      if (isMatrix(arr)) {
+        return matrix(_recursive(arr.toArray(), dim));
+      } else {
+        return _recursive(arr, dim);
+      }
+    },
+    'Array | Matrix, BigNumber': function ArrayMatrixBigNumber(arr, dim) {
+      return this(arr, number(dim));
+    }
+  });
+  /**
+   * Recursively find the correct dimension in the array/matrix
+   * Then Apply _diff to that dimension
+   *
+   * @param {Array} arr      The array
+   * @param {number} dim     Dimension
+   * @return {Array}         resulting array
+   */
+
+  function _recursive(arr, dim) {
+    if (isMatrix(arr)) {
+      arr = arr.toArray(); // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly
+    }
+
+    if (!Array.isArray(arr)) {
+      throw RangeError('Array/Matrix does not have that many dimensions');
+    }
+
+    if (dim > 0) {
+      var result = [];
+      arr.forEach(element => {
+        result.push(_recursive(element, dim - 1));
+      });
+      return result;
+    } else if (dim === 0) {
+      return _diff(arr);
+    } else {
+      throw RangeError('Cannot have negative dimension');
+    }
+  }
+  /**
+   * Difference between elements in the array
+   *
+   * @param {Array} arr      An array
+   * @return {Array}         resulting array
+   */
+
+
+  function _diff(arr) {
+    var result = [];
+    var size = arr.length;
+
+    if (size < 2) {
+      return arr;
+    }
+
+    for (var i = 1; i < size; i++) {
+      result.push(_ElementDiff(arr[i - 1], arr[i]));
+    }
+
+    return result;
+  }
+  /**
+   * Difference between 2 objects
+   *
+   * @param {Object} obj1    First object
+   * @param {Object} obj2    Second object
+   * @return {Array}         resulting array
+   */
+
+
+  function _ElementDiff(obj1, obj2) {
+    // Convert matrices to arrays
+    if (isMatrix(obj1)) obj1 = obj1.toArray();
+    if (isMatrix(obj2)) obj2 = obj2.toArray();
+    var obj1IsArray = Array.isArray(obj1);
+    var obj2IsArray = Array.isArray(obj2);
+
+    if (obj1IsArray && obj2IsArray) {
+      return _ArrayDiff(obj1, obj2);
+    }
+
+    if (!obj1IsArray && !obj2IsArray) {
+      return subtract(obj2, obj1); // Difference is (second - first) NOT (first - second)
+    }
+
+    throw TypeError('Cannot calculate difference between 1 array and 1 non-array');
+  }
+  /**
+   * Difference of elements in 2 arrays
+   *
+   * @param {Array} arr1     Array 1
+   * @param {Array} arr2     Array 2
+   * @return {Array}         resulting array
+   */
+
+
+  function _ArrayDiff(arr1, arr2) {
+    if (arr1.length !== arr2.length) {
+      throw RangeError('Not all sub-arrays have the same length');
+    }
+
+    var result = [];
+    var size = arr1.length;
+
+    for (var i = 0; i < size; i++) {
+      result.push(_ElementDiff(arr1[i], arr2[i]));
+    }
+
+    return result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/dot.js b/node_modules/mathjs/lib/esm/function/matrix/dot.js
new file mode 100644
index 0000000..75471f7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/dot.js
@@ -0,0 +1,177 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+var name = 'dot';
+var dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];
+export var createDot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    multiplyScalar,
+    conj,
+    size
+  } = _ref;
+
+  /**
+   * Calculate the dot product of two vectors. The dot product of
+   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:
+   *
+   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn
+   *
+   * Syntax:
+   *
+   *    math.dot(x, y)
+   *
+   * Examples:
+   *
+   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15
+   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15
+   *
+   * See also:
+   *
+   *    multiply, cross
+   *
+   * @param  {Array | Matrix} x     First vector
+   * @param  {Array | Matrix} y     Second vector
+   * @return {number}               Returns the dot product of `x` and `y`
+   */
+  return typed(name, {
+    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,
+    'SparseMatrix, SparseMatrix': _sparseDot
+  });
+
+  function _validateDim(x, y) {
+    var xSize = _size(x);
+
+    var ySize = _size(y);
+
+    var xLen, yLen;
+
+    if (xSize.length === 1) {
+      xLen = xSize[0];
+    } else if (xSize.length === 2 && xSize[1] === 1) {
+      xLen = xSize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');
+    }
+
+    if (ySize.length === 1) {
+      yLen = ySize[0];
+    } else if (ySize.length === 2 && ySize[1] === 1) {
+      yLen = ySize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');
+    }
+
+    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');
+    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');
+    return xLen;
+  }
+
+  function _denseDot(a, b) {
+    var N = _validateDim(a, b);
+
+    var adata = isMatrix(a) ? a._data : a;
+    var adt = isMatrix(a) ? a._datatype : undefined;
+    var bdata = isMatrix(b) ? b._data : b;
+    var bdt = isMatrix(b) ? b._datatype : undefined; // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)
+
+    var aIsColumn = _size(a).length === 2;
+    var bIsColumn = _size(b).length === 2;
+    var add = addScalar;
+    var mul = multiplyScalar; // process data types
+
+    if (adt && bdt && adt === bdt && typeof adt === 'string') {
+      var dt = adt; // find signatures that matches (dt, dt)
+
+      add = typed.find(addScalar, [dt, dt]);
+      mul = typed.find(multiplyScalar, [dt, dt]);
+    } // both vectors 1-dimensional
+
+
+    if (!aIsColumn && !bIsColumn) {
+      var c = mul(conj(adata[0]), bdata[0]);
+
+      for (var i = 1; i < N; i++) {
+        c = add(c, mul(conj(adata[i]), bdata[i]));
+      }
+
+      return c;
+    } // a is 1-dim, b is column
+
+
+    if (!aIsColumn && bIsColumn) {
+      var _c = mul(conj(adata[0]), bdata[0][0]);
+
+      for (var _i = 1; _i < N; _i++) {
+        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));
+      }
+
+      return _c;
+    } // a is column, b is 1-dim
+
+
+    if (aIsColumn && !bIsColumn) {
+      var _c2 = mul(conj(adata[0][0]), bdata[0]);
+
+      for (var _i2 = 1; _i2 < N; _i2++) {
+        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));
+      }
+
+      return _c2;
+    } // both vectors are column
+
+
+    if (aIsColumn && bIsColumn) {
+      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);
+
+      for (var _i3 = 1; _i3 < N; _i3++) {
+        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));
+      }
+
+      return _c3;
+    }
+  }
+
+  function _sparseDot(x, y) {
+    _validateDim(x, y);
+
+    var xindex = x._index;
+    var xvalues = x._values;
+    var yindex = y._index;
+    var yvalues = y._values; // TODO optimize add & mul using datatype
+
+    var c = 0;
+    var add = addScalar;
+    var mul = multiplyScalar;
+    var i = 0;
+    var j = 0;
+
+    while (i < xindex.length && j < yindex.length) {
+      var I = xindex[i];
+      var J = yindex[j];
+
+      if (I < J) {
+        i++;
+        continue;
+      }
+
+      if (I > J) {
+        j++;
+        continue;
+      }
+
+      if (I === J) {
+        c = add(c, mul(xvalues[i], yvalues[j]));
+        i++;
+        j++;
+      }
+    }
+
+    return c;
+  } // TODO remove this once #1771 is fixed
+
+
+  function _size(x) {
+    return isMatrix(x) ? x.size() : size(x);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/eigs.js b/node_modules/mathjs/lib/esm/function/matrix/eigs.js
new file mode 100644
index 0000000..fc09463
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/eigs.js
@@ -0,0 +1,280 @@
+import { factory } from '../../utils/factory.js';
+import { format } from '../../utils/string.js';
+import { createComplexEigs } from './eigs/complexEigs.js';
+import { createRealSymmetric } from './eigs/realSymetric.js';
+import { typeOf, isNumber, isBigNumber, isComplex, isFraction } from '../../utils/is.js';
+var name = 'eigs'; // The absolute state of math.js's dependency system:
+
+var dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];
+export var createEigs = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    matrix,
+    addScalar,
+    subtract,
+    equal,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    divideScalar,
+    inv,
+    bignumber,
+    multiply,
+    add,
+    larger,
+    column,
+    flatten,
+    number,
+    complex,
+    sqrt,
+    diag,
+    qr,
+    usolve,
+    usolveAll,
+    im,
+    re,
+    smaller,
+    matrixFromColumns,
+    dot
+  } = _ref;
+  var doRealSymetric = createRealSymmetric({
+    config,
+    addScalar,
+    subtract,
+    column,
+    flatten,
+    equal,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    inv,
+    bignumber,
+    complex,
+    multiply,
+    add
+  });
+  var doComplexEigs = createComplexEigs({
+    config,
+    addScalar,
+    subtract,
+    multiply,
+    multiplyScalar,
+    flatten,
+    divideScalar,
+    sqrt,
+    abs,
+    bignumber,
+    diag,
+    qr,
+    inv,
+    usolve,
+    usolveAll,
+    equal,
+    complex,
+    larger,
+    smaller,
+    matrixFromColumns,
+    dot
+  });
+  /**
+   * Compute eigenvalues and eigenvectors of a matrix. The eigenvalues are sorted by their absolute value, ascending.
+   * An eigenvalue with multiplicity k will be listed k times. The eigenvectors are returned as columns of a matrix –
+   * the eigenvector that belongs to the j-th eigenvalue in the list (eg. `values[j]`) is the j-th column (eg. `column(vectors, j)`).
+   * If the algorithm fails to converge, it will throw an error – in that case, however, you may still find useful information
+   * in `err.values` and `err.vectors`.
+   *
+   * Syntax:
+   *
+   *     math.eigs(x, [prec])
+   *
+   * Examples:
+   *
+   *     const { eigs, multiply, column, transpose } = math
+   *     const H = [[5, 2.3], [2.3, 1]]
+   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], vectors: [v1,v2.... corresponding vectors as columns]}
+   *     const E = ans.values
+   *     const U = ans.vectors
+   *     multiply(H, column(U, 0)) // returns multiply(E[0], column(U, 0))
+   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H
+   *     E[0] == UTxHxU[0][0]  // returns true
+   *
+   * See also:
+   *
+   *     inv
+   *
+   * @param {Array | Matrix} x  Matrix to be diagonalized
+   *
+   * @param {number | BigNumber} [prec] Precision, default value: 1e-15
+   * @return {{values: Array|Matrix, vectors: Array|Matrix}} Object containing an array of eigenvalues and a matrix with eigenvectors as columns.
+   *
+   */
+
+  return typed('eigs', {
+    Array: function Array(x) {
+      var mat = matrix(x);
+      return computeValuesAndVectors(mat);
+    },
+    'Array, number|BigNumber': function ArrayNumberBigNumber(x, prec) {
+      var mat = matrix(x);
+      return computeValuesAndVectors(mat, prec);
+    },
+    Matrix: function Matrix(mat) {
+      var {
+        values,
+        vectors
+      } = computeValuesAndVectors(mat);
+      return {
+        values: matrix(values),
+        vectors: matrix(vectors)
+      };
+    },
+    'Matrix, number|BigNumber': function MatrixNumberBigNumber(mat, prec) {
+      var {
+        values,
+        vectors
+      } = computeValuesAndVectors(mat, prec);
+      return {
+        values: matrix(values),
+        vectors: matrix(vectors)
+      };
+    }
+  });
+
+  function computeValuesAndVectors(mat, prec) {
+    if (prec === undefined) {
+      prec = config.epsilon;
+    }
+
+    var size = mat.size();
+
+    if (size.length !== 2 || size[0] !== size[1]) {
+      throw new RangeError('Matrix must be square (size: ' + format(size) + ')');
+    }
+
+    var arr = mat.toArray();
+    var N = size[0];
+
+    if (isReal(arr, N, prec)) {
+      coerceReal(arr, N);
+
+      if (isSymmetric(arr, N, prec)) {
+        var _type = coerceTypes(mat, arr, N);
+
+        return doRealSymetric(arr, N, prec, _type);
+      }
+    }
+
+    var type = coerceTypes(mat, arr, N);
+    return doComplexEigs(arr, N, prec, type);
+  }
+  /** @return {boolean} */
+
+
+  function isSymmetric(arr, N, prec) {
+    for (var i = 0; i < N; i++) {
+      for (var j = i; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {
+          return false;
+        }
+      }
+    }
+
+    return true;
+  }
+  /** @return {boolean} */
+
+
+  function isReal(arr, N, prec) {
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {
+          return false;
+        }
+      }
+    }
+
+    return true;
+  }
+
+  function coerceReal(arr, N) {
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        arr[i][j] = re(arr[i][j]);
+      }
+    }
+  }
+  /** @return {'number' | 'BigNumber' | 'Complex'} */
+
+
+  function coerceTypes(mat, arr, N) {
+    /** @type {string} */
+    var type = mat.datatype();
+
+    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {
+      return type;
+    }
+
+    var hasNumber = false;
+    var hasBig = false;
+    var hasComplex = false;
+
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        var el = arr[i][j];
+
+        if (isNumber(el) || isFraction(el)) {
+          hasNumber = true;
+        } else if (isBigNumber(el)) {
+          hasBig = true;
+        } else if (isComplex(el)) {
+          hasComplex = true;
+        } else {
+          throw TypeError('Unsupported type in Matrix: ' + typeOf(el));
+        }
+      }
+    }
+
+    if (hasBig && hasComplex) {
+      console.warn('Complex BigNumbers not supported, this operation will lose precission.');
+    }
+
+    if (hasComplex) {
+      for (var _i = 0; _i < N; _i++) {
+        for (var _j = 0; _j < N; _j++) {
+          arr[_i][_j] = complex(arr[_i][_j]);
+        }
+      }
+
+      return 'Complex';
+    }
+
+    if (hasBig) {
+      for (var _i2 = 0; _i2 < N; _i2++) {
+        for (var _j2 = 0; _j2 < N; _j2++) {
+          arr[_i2][_j2] = bignumber(arr[_i2][_j2]);
+        }
+      }
+
+      return 'BigNumber';
+    }
+
+    if (hasNumber) {
+      for (var _i3 = 0; _i3 < N; _i3++) {
+        for (var _j3 = 0; _j3 < N; _j3++) {
+          arr[_i3][_j3] = number(arr[_i3][_j3]);
+        }
+      }
+
+      return 'number';
+    } else {
+      throw TypeError('Matrix contains unsupported types only.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js b/node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js
new file mode 100644
index 0000000..05ffb53
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js
@@ -0,0 +1,731 @@
+import { clone } from '../../../utils/object.js';
+export function createComplexEigs(_ref) {
+  var {
+    addScalar,
+    subtract,
+    flatten,
+    multiply,
+    multiplyScalar,
+    divideScalar,
+    sqrt,
+    abs,
+    bignumber,
+    diag,
+    inv,
+    qr,
+    usolve,
+    usolveAll,
+    equal,
+    complex,
+    larger,
+    smaller,
+    matrixFromColumns,
+    dot
+  } = _ref;
+
+  /**
+   * @param {number[][]} arr the matrix to find eigenvalues of
+   * @param {number} N size of the matrix
+   * @param {number|BigNumber} prec precision, anything lower will be considered zero
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors should we find eigenvectors?
+   *
+   * @returns {{ values: number[], vectors: number[][] }}
+   */
+  function complexEigs(arr, N, prec, type, findVectors) {
+    if (findVectors === undefined) {
+      findVectors = true;
+    } // TODO check if any row/col are zero except the diagonal
+    // make sure corresponding rows and columns have similar magnitude
+    // important because of numerical stability
+    // MODIFIES arr by side effect!
+
+
+    var R = balance(arr, N, prec, type, findVectors); // R is the row transformation matrix
+    // arr = A' = R A R⁻¹, A is the original matrix
+    // (if findVectors is false, R is undefined)
+    // (And so to return to original matrix: A = R⁻¹ arr R)
+    // TODO if magnitudes of elements vary over many orders,
+    // move greatest elements to the top left corner
+    // using similarity transformations, reduce the matrix
+    // to Hessenberg form (upper triangular plus one subdiagonal row)
+    // updates the transformation matrix R with new row operationsq
+    // MODIFIES arr by side effect!
+
+    reduceToHessenberg(arr, N, prec, type, findVectors, R); // still true that original A = R⁻¹ arr R)
+    // find eigenvalues
+
+    var {
+      values,
+      C
+    } = iterateUntilTriangular(arr, N, prec, type, findVectors); // values is the list of eigenvalues, C is the column
+    // transformation matrix that transforms arr, the hessenberg
+    // matrix, to upper triangular
+    // (So U = C⁻¹ arr C and the relationship between current arr
+    // and original A is unchanged.)
+
+    var vectors;
+
+    if (findVectors) {
+      vectors = findEigenvectors(arr, N, C, R, values, prec, type);
+      vectors = matrixFromColumns(...vectors);
+    }
+
+    return {
+      values,
+      vectors
+    };
+  }
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]}
+   */
+
+
+  function balance(arr, N, prec, type, findVectors) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var realzero = big ? bignumber(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    var realone = big ? bignumber(1) : 1; // base of the floating-point arithmetic
+
+    var radix = big ? bignumber(10) : 2;
+    var radixSq = multiplyScalar(radix, radix); // the diagonal transformation matrix R
+
+    var Rdiag;
+
+    if (findVectors) {
+      Rdiag = Array(N).fill(one);
+    } // this isn't the only time we loop thru the matrix...
+
+
+    var last = false;
+
+    while (!last) {
+      // ...haha I'm joking! unless...
+      last = true;
+
+      for (var i = 0; i < N; i++) {
+        // compute the taxicab norm of i-th column and row
+        // TODO optimize for complex numbers
+        var colNorm = realzero;
+        var rowNorm = realzero;
+
+        for (var j = 0; j < N; j++) {
+          if (i === j) continue;
+          var c = abs(arr[i][j]); // should be real
+
+          colNorm = addScalar(colNorm, c);
+          rowNorm = addScalar(rowNorm, c);
+        }
+
+        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {
+          // find integer power closest to balancing the matrix
+          // (we want to scale only by integer powers of radix,
+          // so that we don't lose any precision due to round-off)
+          var f = realone;
+          var _c = colNorm;
+          var rowDivRadix = divideScalar(rowNorm, radix);
+          var rowMulRadix = multiplyScalar(rowNorm, radix);
+
+          while (smaller(_c, rowDivRadix)) {
+            _c = multiplyScalar(_c, radixSq);
+            f = multiplyScalar(f, radix);
+          }
+
+          while (larger(_c, rowMulRadix)) {
+            _c = divideScalar(_c, radixSq);
+            f = divideScalar(f, radix);
+          } // check whether balancing is needed
+          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)
+
+
+          var condition = smaller(divideScalar(addScalar(_c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95)); // apply balancing similarity transformation
+
+          if (condition) {
+            // we should loop once again to check whether
+            // another rebalancing is needed
+            last = false;
+            var g = divideScalar(1, f);
+
+            for (var _j = 0; _j < N; _j++) {
+              if (i === _j) {
+                continue;
+              }
+
+              arr[i][_j] = multiplyScalar(arr[i][_j], f);
+              arr[_j][i] = multiplyScalar(arr[_j][i], g);
+            } // keep track of transformations
+
+
+            if (findVectors) {
+              Rdiag[i] = multiplyScalar(Rdiag[i], f);
+            }
+          }
+        }
+      }
+    } // return the diagonal row transformation matrix
+
+
+    return diag(Rdiag);
+  }
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors
+   * @param {number[][]} R the row transformation matrix that will be modified
+   */
+
+
+  function reduceToHessenberg(arr, N, prec, type, findVectors, R) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+
+    if (big) {
+      prec = bignumber(prec);
+    }
+
+    for (var i = 0; i < N - 2; i++) {
+      // Find the largest subdiag element in the i-th col
+      var maxIndex = 0;
+      var max = zero;
+
+      for (var j = i + 1; j < N; j++) {
+        var el = arr[j][i];
+
+        if (smaller(abs(max), abs(el))) {
+          max = el;
+          maxIndex = j;
+        }
+      } // This col is pivoted, no need to do anything
+
+
+      if (smaller(abs(max), prec)) {
+        continue;
+      }
+
+      if (maxIndex !== i + 1) {
+        // Interchange maxIndex-th and (i+1)-th row
+        var tmp1 = arr[maxIndex];
+        arr[maxIndex] = arr[i + 1];
+        arr[i + 1] = tmp1; // Interchange maxIndex-th and (i+1)-th column
+
+        for (var _j2 = 0; _j2 < N; _j2++) {
+          var tmp2 = arr[_j2][maxIndex];
+          arr[_j2][maxIndex] = arr[_j2][i + 1];
+          arr[_j2][i + 1] = tmp2;
+        } // keep track of transformations
+
+
+        if (findVectors) {
+          var tmp3 = R[maxIndex];
+          R[maxIndex] = R[i + 1];
+          R[i + 1] = tmp3;
+        }
+      } // Reduce following rows and columns
+
+
+      for (var _j3 = i + 2; _j3 < N; _j3++) {
+        var n = divideScalar(arr[_j3][i], max);
+
+        if (n === 0) {
+          continue;
+        } // from j-th row subtract n-times (i+1)th row
+
+
+        for (var k = 0; k < N; k++) {
+          arr[_j3][k] = subtract(arr[_j3][k], multiplyScalar(n, arr[i + 1][k]));
+        } // to (i+1)th column add n-times j-th column
+
+
+        for (var _k = 0; _k < N; _k++) {
+          arr[_k][i + 1] = addScalar(arr[_k][i + 1], multiplyScalar(n, arr[_k][_j3]));
+        } // keep track of transformations
+
+
+        if (findVectors) {
+          for (var _k2 = 0; _k2 < N; _k2++) {
+            R[_j3][_k2] = subtract(R[_j3][_k2], multiplyScalar(n, R[i + 1][_k2]));
+          }
+        }
+      }
+    }
+
+    return R;
+  }
+  /**
+   * @returns {{values: values, C: Matrix}}
+   * @see Press, Wiliams: Numerical recipes in Fortran 77
+   * @see https://en.wikipedia.org/wiki/QR_algorithm
+   */
+
+
+  function iterateUntilTriangular(A, N, prec, type, findVectors) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+
+    if (big) {
+      prec = bignumber(prec);
+    } // The Francis Algorithm
+    // The core idea of this algorithm is that doing successive
+    // A' = Q⁺AQ transformations will eventually converge to block-
+    // upper-triangular with diagonal blocks either 1x1 or 2x2.
+    // The Q here is the one from the QR decomposition, A = QR.
+    // Since the eigenvalues of a block-upper-triangular matrix are
+    // the eigenvalues of its diagonal blocks and we know how to find
+    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.
+
+
+    var arr = clone(A); // the list of converged eigenvalues
+
+    var lambdas = []; // size of arr, which will get smaller as eigenvalues converge
+
+    var n = N; // the diagonal of the block-diagonal matrix that turns
+    // converged 2x2 matrices into upper triangular matrices
+
+    var Sdiag = []; // N×N matrix describing the overall transformation done during the QR algorithm
+
+    var Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined; // n×n matrix describing the QR transformations done since last convergence
+
+    var Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined; // last eigenvalue converged before this many steps
+
+    var lastConvergenceBefore = 0;
+
+    while (lastConvergenceBefore <= 100) {
+      lastConvergenceBefore += 1; // TODO if the convergence is slow, do something clever
+      // Perform the factorization
+
+      var k = 0; // TODO set close to an eigenvalue
+
+      for (var i = 0; i < n; i++) {
+        arr[i][i] = subtract(arr[i][i], k);
+      } // TODO do an implicit QR transformation
+
+
+      var {
+        Q,
+        R
+      } = qr(arr);
+      arr = multiply(R, Q);
+
+      for (var _i = 0; _i < n; _i++) {
+        arr[_i][_i] = addScalar(arr[_i][_i], k);
+      } // keep track of transformations
+
+
+      if (findVectors) {
+        Qpartial = multiply(Qpartial, Q);
+      } // The rightmost diagonal element converged to an eigenvalue
+
+
+      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {
+        lastConvergenceBefore = 0;
+        lambdas.push(arr[n - 1][n - 1]); // keep track of transformations
+
+        if (findVectors) {
+          Sdiag.unshift([[1]]);
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+
+          if (n > 1) {
+            Qpartial = diag(Array(n - 1).fill(one));
+          }
+        } // reduce the matrix size
+
+
+        n -= 1;
+        arr.pop();
+
+        for (var _i2 = 0; _i2 < n; _i2++) {
+          arr[_i2].pop();
+        } // The rightmost diagonal 2x2 block converged
+
+      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {
+        lastConvergenceBefore = 0;
+        var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);
+        lambdas.push(...ll); // keep track of transformations
+
+        if (findVectors) {
+          Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+
+          if (n > 2) {
+            Qpartial = diag(Array(n - 2).fill(one));
+          }
+        } // reduce the matrix size
+
+
+        n -= 2;
+        arr.pop();
+        arr.pop();
+
+        for (var _i3 = 0; _i3 < n; _i3++) {
+          arr[_i3].pop();
+
+          arr[_i3].pop();
+        }
+      }
+
+      if (n === 0) {
+        break;
+      }
+    } // standard sorting
+
+
+    lambdas.sort((a, b) => +subtract(abs(a), abs(b))); // the algorithm didn't converge
+
+    if (lastConvergenceBefore > 100) {
+      var err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '));
+      err.values = lambdas;
+      err.vectors = [];
+      throw err;
+    } // combine the overall QR transformation Qtotal with the subsequent
+    // transformation S that turns the diagonal 2x2 blocks to upper triangular
+
+
+    var C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined;
+    return {
+      values: lambdas,
+      C
+    };
+  }
+  /**
+   * @param {Matrix} A hessenberg-form matrix
+   * @param {number} N size of A
+   * @param {Matrix} C column transformation matrix that turns A into upper triangular
+   * @param {Matrix} R similarity that turns original matrix into A
+   * @param {number[]} values array of eigenvalues of A
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]} eigenvalues
+   */
+
+
+  function findEigenvectors(A, N, C, R, values, prec, type) {
+    var Cinv = inv(C);
+    var U = multiply(Cinv, A, C);
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1; // turn values into a kind of "multiset"
+    // this way it is easier to find eigenvectors
+
+    var uniqueValues = [];
+    var multiplicities = [];
+
+    for (var λ of values) {
+      var i = indexOf(uniqueValues, λ, equal);
+
+      if (i === -1) {
+        uniqueValues.push(λ);
+        multiplicities.push(1);
+      } else {
+        multiplicities[i] += 1;
+      }
+    } // find eigenvectors by solving U − λE = 0
+    // TODO replace with an iterative eigenvector algorithm
+    // (this one might fail for imprecise eigenvalues)
+
+
+    var vectors = [];
+    var len = uniqueValues.length;
+    var b = Array(N).fill(zero);
+    var E = diag(Array(N).fill(one)); // eigenvalues for which usolve failed (due to numerical error)
+
+    var failedLambdas = [];
+
+    var _loop = function _loop(_i4) {
+      var λ = uniqueValues[_i4];
+      var S = subtract(U, multiply(λ, E)); // the characteristic matrix
+
+      var solutions = usolveAll(S, b);
+      solutions.shift(); // ignore the null vector
+      // looks like we missed something, try inverse iteration
+
+      while (solutions.length < multiplicities[_i4]) {
+        var approxVec = inverseIterate(S, N, solutions, prec, type);
+
+        if (approxVec == null) {
+          // no more vectors were found
+          failedLambdas.push(λ);
+          break;
+        }
+
+        solutions.push(approxVec);
+      } // Transform back into original array coordinates
+
+
+      var correction = multiply(inv(R), C);
+      solutions = solutions.map(v => multiply(correction, v));
+      vectors.push(...solutions.map(v => flatten(v)));
+    };
+
+    for (var _i4 = 0; _i4 < len; _i4++) {
+      _loop(_i4);
+    }
+
+    if (failedLambdas.length !== 0) {
+      var err = new Error('Failed to find eigenvectors for the following eigenvalues: ' + failedLambdas.join(', '));
+      err.values = values;
+      err.vectors = vectors;
+      throw err;
+    }
+
+    return vectors;
+  }
+  /**
+   * Compute the eigenvalues of an 2x2 matrix
+   * @return {[number,number]}
+   */
+
+
+  function eigenvalues2x2(a, b, c, d) {
+    // λ± = ½ trA ± ½ √( tr²A - 4 detA )
+    var trA = addScalar(a, d);
+    var detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c));
+    var x = multiplyScalar(trA, 0.5);
+    var y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5);
+    return [addScalar(x, y), subtract(x, y)];
+  }
+  /**
+   * For an 2x2 matrix compute the transformation matrix S,
+   * so that SAS⁻¹ is an upper triangular matrix
+   * @return {[[number,number],[number,number]]}
+   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf
+   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html
+   */
+
+
+  function jordanBase2x2(a, b, c, d, l1, l2, prec, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1; // matrix is already upper triangular
+    // return an identity matrix
+
+    if (smaller(abs(c), prec)) {
+      return [[one, zero], [zero, one]];
+    } // matrix is diagonalizable
+    // return its eigenvectors as columns
+
+
+    if (larger(abs(subtract(l1, l2)), prec)) {
+      return [[subtract(l1, d), subtract(l2, d)], [c, c]];
+    } // matrix is not diagonalizable
+    // compute off-diagonal elements of N = A - λI
+    // N₁₂ = 0 ⇒ S = ( N⃗₁, I⃗₁ )
+    // N₁₂ ≠ 0 ⇒ S = ( N⃗₂, I⃗₂ )
+
+
+    var na = subtract(a, l1);
+    var nb = subtract(b, l1);
+    var nc = subtract(c, l1);
+    var nd = subtract(d, l1);
+
+    if (smaller(abs(nb), prec)) {
+      return [[na, one], [nc, zero]];
+    } else {
+      return [[nb, zero], [nd, one]];
+    }
+  }
+  /**
+   * Enlarge the matrix from n×n to N×N, setting the new
+   * elements to 1 on diagonal and 0 elsewhere
+   */
+
+
+  function inflateMatrix(arr, N) {
+    // add columns
+    for (var i = 0; i < arr.length; i++) {
+      arr[i].push(...Array(N - arr[i].length).fill(0));
+    } // add rows
+
+
+    for (var _i5 = arr.length; _i5 < N; _i5++) {
+      arr.push(Array(N).fill(0));
+      arr[_i5][_i5] = 1;
+    }
+
+    return arr;
+  }
+  /**
+   * Create a block-diagonal matrix with the given square matrices on the diagonal
+   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal
+   * @param {number} N the size of the resulting matrix
+   */
+
+
+  function blockDiag(arr, N) {
+    var M = [];
+
+    for (var i = 0; i < N; i++) {
+      M[i] = Array(N).fill(0);
+    }
+
+    var I = 0;
+
+    for (var sub of arr) {
+      var n = sub.length;
+
+      for (var _i6 = 0; _i6 < n; _i6++) {
+        for (var j = 0; j < n; j++) {
+          M[I + _i6][I + j] = sub[_i6][j];
+        }
+      }
+
+      I += n;
+    }
+
+    return M;
+  }
+  /**
+   * Finds the index of an element in an array using a custom equality function
+   * @template T
+   * @param {Array<T>} arr array in which to search
+   * @param {T} el the element to find
+   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`
+   * @returns {number} the index of `el`, or -1 when it's not in `arr`
+   */
+
+
+  function indexOf(arr, el, fn) {
+    for (var i = 0; i < arr.length; i++) {
+      if (fn(arr[i], el)) {
+        return i;
+      }
+    }
+
+    return -1;
+  }
+  /**
+   * Provided a near-singular upper-triangular matrix A and a list of vectors,
+   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal
+   * to each vector in the list
+   * @template T
+   * @param {T[][]} A near-singular square matrix
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {number} prec epsilon
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @return {T[] | null} eigenvector
+   *
+   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration
+   */
+
+
+  function inverseIterate(A, N, orthog, prec, type) {
+    var largeNum = type === 'BigNumber' ? bignumber(1000) : 1000;
+    var b; // the vector
+    // you better choose a random vector before I count to five
+
+    var i = 0;
+
+    while (true) {
+      b = randomOrthogonalVector(N, orthog, type);
+      b = usolve(A, b);
+
+      if (larger(norm(b), largeNum)) {
+        break;
+      }
+
+      if (++i >= 5) {
+        return null;
+      }
+    } // you better converge before I count to ten
+
+
+    i = 0;
+
+    while (true) {
+      var c = usolve(A, b);
+
+      if (smaller(norm(orthogonalComplement(b, [c])), prec)) {
+        break;
+      }
+
+      if (++i >= 10) {
+        return null;
+      }
+
+      b = normalize(c);
+    }
+
+    return b;
+  }
+  /**
+   * Generates a random unit vector of dimension N, orthogonal to each vector in the list
+   * @template T
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} random vector
+   */
+
+
+  function randomOrthogonalVector(N, orthog, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex'; // generate random vector with the correct type
+
+    var v = Array(N).fill(0).map(_ => 2 * Math.random() - 1);
+
+    if (big) {
+      v = v.map(n => bignumber(n));
+    }
+
+    if (cplx) {
+      v = v.map(n => complex(n));
+    } // project to orthogonal complement
+
+
+    v = orthogonalComplement(v, orthog); // normalize
+
+    return normalize(v, type);
+  }
+  /**
+   * Project vector v to the orthogonal complement of an array of vectors
+   */
+
+
+  function orthogonalComplement(v, orthog) {
+    for (var w of orthog) {
+      // v := v − (w, v)/∥w∥² w
+      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));
+    }
+
+    return v;
+  }
+  /**
+   * Calculate the norm of a vector.
+   * We can't use math.norm because factory can't handle circular dependency.
+   * Seriously, I'm really fed up with factory.
+   */
+
+
+  function norm(v) {
+    return abs(sqrt(dot(v, v)));
+  }
+  /**
+   * Normalize a vector
+   * @template T
+   * @param {T[]} v
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} normalized vec
+   */
+
+
+  function normalize(v, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    return multiply(divideScalar(one, norm(v)), v);
+  }
+
+  return complexEigs;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/eigs/realSymetric.js b/node_modules/mathjs/lib/esm/function/matrix/eigs/realSymetric.js
new file mode 100644
index 0000000..117672a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/eigs/realSymetric.js
@@ -0,0 +1,335 @@
+import { clone } from '../../../utils/object.js';
+export function createRealSymmetric(_ref) {
+  var {
+    config,
+    addScalar,
+    subtract,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    inv,
+    bignumber,
+    multiply,
+    add
+  } = _ref;
+
+  /**
+   * @param {number[] | BigNumber[]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number' | 'BigNumber'} type
+   */
+  function main(arr, N) {
+    var prec = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : config.epsilon;
+    var type = arguments.length > 3 ? arguments[3] : undefined;
+
+    if (type === 'number') {
+      return diag(arr, prec);
+    }
+
+    if (type === 'BigNumber') {
+      return diagBig(arr, prec);
+    }
+
+    throw TypeError('Unsupported data type: ' + type);
+  } // diagonalization implementation for number (efficient)
+
+
+  function diag(x, precision) {
+    var N = x.length;
+    var e0 = Math.abs(precision / N);
+    var psi;
+    var Sij = new Array(N); // Sij is Identity Matrix
+
+    for (var i = 0; i < N; i++) {
+      Sij[i] = createArray(N, 0);
+      Sij[i][i] = 1.0;
+    } // initial error
+
+
+    var Vab = getAij(x);
+
+    while (Math.abs(Vab[1]) >= Math.abs(e0)) {
+      var _i = Vab[0][0];
+      var j = Vab[0][1];
+      psi = getTheta(x[_i][_i], x[j][j], x[_i][j]);
+      x = x1(x, psi, _i, j);
+      Sij = Sij1(Sij, psi, _i, j);
+      Vab = getAij(x);
+    }
+
+    var Ei = createArray(N, 0); // eigenvalues
+
+    for (var _i2 = 0; _i2 < N; _i2++) {
+      Ei[_i2] = x[_i2][_i2];
+    }
+
+    return sorting(clone(Ei), clone(Sij));
+  } // diagonalization implementation for bigNumber
+
+
+  function diagBig(x, precision) {
+    var N = x.length;
+    var e0 = abs(precision / N);
+    var psi;
+    var Sij = new Array(N); // Sij is Identity Matrix
+
+    for (var i = 0; i < N; i++) {
+      Sij[i] = createArray(N, 0);
+      Sij[i][i] = 1.0;
+    } // initial error
+
+
+    var Vab = getAijBig(x);
+
+    while (abs(Vab[1]) >= abs(e0)) {
+      var _i3 = Vab[0][0];
+      var j = Vab[0][1];
+      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);
+      x = x1Big(x, psi, _i3, j);
+      Sij = Sij1Big(Sij, psi, _i3, j);
+      Vab = getAijBig(x);
+    }
+
+    var Ei = createArray(N, 0); // eigenvalues
+
+    for (var _i4 = 0; _i4 < N; _i4++) {
+      Ei[_i4] = x[_i4][_i4];
+    } // return [clone(Ei), clone(Sij)]
+
+
+    return sorting(clone(Ei), clone(Sij));
+  } // get angle
+
+
+  function getTheta(aii, ajj, aij) {
+    var denom = ajj - aii;
+
+    if (Math.abs(denom) <= config.epsilon) {
+      return Math.PI / 4.0;
+    } else {
+      return 0.5 * Math.atan(2.0 * aij / (ajj - aii));
+    }
+  } // get angle
+
+
+  function getThetaBig(aii, ajj, aij) {
+    var denom = subtract(ajj, aii);
+
+    if (abs(denom) <= config.epsilon) {
+      return bignumber(-1).acos().div(4);
+    } else {
+      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))));
+    }
+  } // update eigvec
+
+
+  function Sij1(Sij, theta, i, j) {
+    var N = Sij.length;
+    var c = Math.cos(theta);
+    var s = Math.sin(theta);
+    var Ski = createArray(N, 0);
+    var Skj = createArray(N, 0);
+
+    for (var k = 0; k < N; k++) {
+      Ski[k] = c * Sij[k][i] - s * Sij[k][j];
+      Skj[k] = s * Sij[k][i] + c * Sij[k][j];
+    }
+
+    for (var _k = 0; _k < N; _k++) {
+      Sij[_k][i] = Ski[_k];
+      Sij[_k][j] = Skj[_k];
+    }
+
+    return Sij;
+  } // update eigvec for overlap
+
+
+  function Sij1Big(Sij, theta, i, j) {
+    var N = Sij.length;
+    var c = cos(theta);
+    var s = sin(theta);
+    var Ski = createArray(N, bignumber(0));
+    var Skj = createArray(N, bignumber(0));
+
+    for (var k = 0; k < N; k++) {
+      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));
+      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));
+    }
+
+    for (var _k2 = 0; _k2 < N; _k2++) {
+      Sij[_k2][i] = Ski[_k2];
+      Sij[_k2][j] = Skj[_k2];
+    }
+
+    return Sij;
+  } // update matrix
+
+
+  function x1Big(Hij, theta, i, j) {
+    var N = Hij.length;
+    var c = bignumber(cos(theta));
+    var s = bignumber(sin(theta));
+    var c2 = multiplyScalar(c, c);
+    var s2 = multiplyScalar(s, s);
+    var Aki = createArray(N, bignumber(0));
+    var Akj = createArray(N, bignumber(0)); // 2cs Hij
+
+    var csHij = multiply(bignumber(2), c, s, Hij[i][j]); //  Aii
+
+    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));
+    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j])); // 0  to i
+
+    for (var k = 0; k < N; k++) {
+      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));
+      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));
+    } // Modify Hij
+
+
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = bignumber(0);
+    Hij[j][i] = bignumber(0); // 0  to i
+
+    for (var _k3 = 0; _k3 < N; _k3++) {
+      if (_k3 !== i && _k3 !== j) {
+        Hij[i][_k3] = Aki[_k3];
+        Hij[_k3][i] = Aki[_k3];
+        Hij[j][_k3] = Akj[_k3];
+        Hij[_k3][j] = Akj[_k3];
+      }
+    }
+
+    return Hij;
+  } // update matrix
+
+
+  function x1(Hij, theta, i, j) {
+    var N = Hij.length;
+    var c = Math.cos(theta);
+    var s = Math.sin(theta);
+    var c2 = c * c;
+    var s2 = s * s;
+    var Aki = createArray(N, 0);
+    var Akj = createArray(N, 0); //  Aii
+
+    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];
+    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j]; // 0  to i
+
+    for (var k = 0; k < N; k++) {
+      Aki[k] = c * Hij[i][k] - s * Hij[j][k];
+      Akj[k] = s * Hij[i][k] + c * Hij[j][k];
+    } // Modify Hij
+
+
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = 0;
+    Hij[j][i] = 0; // 0  to i
+
+    for (var _k4 = 0; _k4 < N; _k4++) {
+      if (_k4 !== i && _k4 !== j) {
+        Hij[i][_k4] = Aki[_k4];
+        Hij[_k4][i] = Aki[_k4];
+        Hij[j][_k4] = Akj[_k4];
+        Hij[_k4][j] = Akj[_k4];
+      }
+    }
+
+    return Hij;
+  } // get max off-diagonal value from Upper Diagonal
+
+
+  function getAij(Mij) {
+    var N = Mij.length;
+    var maxMij = 0;
+    var maxIJ = [0, 1];
+
+    for (var i = 0; i < N; i++) {
+      for (var j = i + 1; j < N; j++) {
+        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {
+          maxMij = Math.abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+
+    return [maxIJ, maxMij];
+  } // get max off-diagonal value from Upper Diagonal
+
+
+  function getAijBig(Mij) {
+    var N = Mij.length;
+    var maxMij = 0;
+    var maxIJ = [0, 1];
+
+    for (var i = 0; i < N; i++) {
+      for (var j = i + 1; j < N; j++) {
+        if (abs(maxMij) < abs(Mij[i][j])) {
+          maxMij = abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+
+    return [maxIJ, maxMij];
+  } // sort results
+
+
+  function sorting(E, S) {
+    var N = E.length;
+    var values = Array(N);
+    var vectors = Array(N);
+
+    for (var k = 0; k < N; k++) {
+      vectors[k] = Array(N);
+    }
+
+    for (var i = 0; i < N; i++) {
+      var minID = 0;
+      var minE = E[0];
+
+      for (var j = 0; j < E.length; j++) {
+        if (abs(E[j]) < abs(minE)) {
+          minID = j;
+          minE = E[minID];
+        }
+      }
+
+      values[i] = E.splice(minID, 1)[0];
+
+      for (var _k5 = 0; _k5 < N; _k5++) {
+        vectors[_k5][i] = S[_k5][minID];
+
+        S[_k5].splice(minID, 1);
+      }
+    }
+
+    return {
+      values,
+      vectors
+    };
+  }
+  /**
+   * Create an array of a certain size and fill all items with an initial value
+   * @param {number} size
+   * @param {number} value
+   * @return {number[]}
+   */
+
+
+  function createArray(size, value) {
+    // TODO: as soon as all browsers support Array.fill, use that instead (IE doesn't support it)
+    var array = new Array(size);
+
+    for (var i = 0; i < size; i++) {
+      array[i] = value;
+    }
+
+    return array;
+  }
+
+  return main;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/expm.js b/node_modules/mathjs/lib/esm/function/matrix/expm.js
new file mode 100644
index 0000000..0ea66fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/expm.js
@@ -0,0 +1,166 @@
+import { isSparseMatrix } from '../../utils/is.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'expm';
+var dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];
+export var createExpm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    identity,
+    inv,
+    multiply
+  } = _ref;
+
+  /**
+   * Compute the matrix exponential, expm(A) = e^A. The matrix must be square.
+   * Not to be confused with exp(a), which performs element-wise
+   * exponentiation.
+   *
+   * The exponential is calculated using the Padé approximant with scaling and
+   * squaring; see "Nineteen Dubious Ways to Compute the Exponential of a
+   * Matrix," by Moler and Van Loan.
+   *
+   * Syntax:
+   *
+   *     math.expm(x)
+   *
+   * Examples:
+   *
+   *     const A = [[0,2],[0,0]]
+   *     math.expm(A)        // returns [[1,2],[0,1]]
+   *
+   * See also:
+   *
+   *     exp
+   *
+   * @param {Matrix} x  A square Matrix
+   * @return {Matrix}   The exponential of x
+   */
+  return typed(name, {
+    Matrix: function Matrix(A) {
+      // Check matrix size
+      var size = A.size();
+
+      if (size.length !== 2 || size[0] !== size[1]) {
+        throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+      }
+
+      var n = size[0]; // Desired accuracy of the approximant (The actual accuracy
+      // will be affected by round-off error)
+
+      var eps = 1e-15; // The Padé approximant is not so accurate when the values of A
+      // are "large", so scale A by powers of two. Then compute the
+      // exponential, and square the result repeatedly according to
+      // the identity e^A = (e^(A/m))^m
+      // Compute infinity-norm of A, ||A||, to see how "big" it is
+
+      var infNorm = infinityNorm(A); // Find the optimal scaling factor and number of terms in the
+      // Padé approximant to reach the desired accuracy
+
+      var params = findParams(infNorm, eps);
+      var q = params.q;
+      var j = params.j; // The Pade approximation to e^A is:
+      // Rqq(A) = Dqq(A) ^ -1 * Nqq(A)
+      // where
+      // Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i
+      // Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i
+      // Scale A by 1 / 2^j
+
+      var Apos = multiply(A, Math.pow(2, -j)); // The i=0 term is just the identity matrix
+
+      var N = identity(n);
+      var D = identity(n); // Initialization (i=0)
+
+      var factor = 1; // Initialization (i=1)
+
+      var AposToI = Apos; // Cloning not necessary
+
+      var alternate = -1;
+
+      for (var i = 1; i <= q; i++) {
+        if (i > 1) {
+          AposToI = multiply(AposToI, Apos);
+          alternate = -alternate;
+        }
+
+        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);
+        N = add(N, multiply(factor, AposToI));
+        D = add(D, multiply(factor * alternate, AposToI));
+      }
+
+      var R = multiply(inv(D), N); // Square j times
+
+      for (var _i = 0; _i < j; _i++) {
+        R = multiply(R, R);
+      }
+
+      return isSparseMatrix(A) ? A.createSparseMatrix(R) : R;
+    }
+  });
+
+  function infinityNorm(A) {
+    var n = A.size()[0];
+    var infNorm = 0;
+
+    for (var i = 0; i < n; i++) {
+      var rowSum = 0;
+
+      for (var j = 0; j < n; j++) {
+        rowSum += abs(A.get([i, j]));
+      }
+
+      infNorm = Math.max(rowSum, infNorm);
+    }
+
+    return infNorm;
+  }
+  /**
+   * Find the best parameters for the Pade approximant given
+   * the matrix norm and desired accuracy. Returns the first acceptable
+   * combination in order of increasing computational load.
+   */
+
+
+  function findParams(infNorm, eps) {
+    var maxSearchSize = 30;
+
+    for (var k = 0; k < maxSearchSize; k++) {
+      for (var q = 0; q <= k; q++) {
+        var j = k - q;
+
+        if (errorEstimate(infNorm, q, j) < eps) {
+          return {
+            q: q,
+            j: j
+          };
+        }
+      }
+    }
+
+    throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)');
+  }
+  /**
+   * Returns the estimated error of the Pade approximant for the given
+   * parameters.
+   */
+
+
+  function errorEstimate(infNorm, q, j) {
+    var qfac = 1;
+
+    for (var i = 2; i <= q; i++) {
+      qfac *= i;
+    }
+
+    var twoqfac = qfac;
+
+    for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {
+      twoqfac *= _i2;
+    }
+
+    var twoqp1fac = twoqfac * (2 * q + 1);
+    return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/filter.js b/node_modules/mathjs/lib/esm/function/matrix/filter.js
new file mode 100644
index 0000000..cd8ad9f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/filter.js
@@ -0,0 +1,73 @@
+import { filter, filterRegExp } from '../../utils/array.js';
+import { maxArgumentCount } from '../../utils/function.js';
+import { factory } from '../../utils/factory.js';
+var name = 'filter';
+var dependencies = ['typed'];
+export var createFilter = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Filter the items in an array or one dimensional matrix.
+   *
+   * Syntax:
+   *
+   *    math.filter(x, test)
+   *
+   * Examples:
+   *
+   *    function isPositive (x) {
+   *      return x > 0
+   *    }
+   *    math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]
+   *
+   *    math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/) // returns ["23", "100", "55"]
+   *
+   * See also:
+   *
+   *    forEach, map, sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to filter
+   * @param {Function | RegExp} test
+   *        A function or regular expression to test items.
+   *        All entries for which `test` returns true are returned.
+   *        When `test` is a function, it is invoked with three parameters:
+   *        the value of the element, the index of the element, and the
+   *        matrix/array being traversed. The function must return a boolean.
+   * @return {Matrix | Array} Returns the filtered matrix.
+   */
+  return typed('filter', {
+    'Array, function': _filterCallback,
+    'Matrix, function': function MatrixFunction(x, test) {
+      return x.create(_filterCallback(x.toArray(), test));
+    },
+    'Array, RegExp': filterRegExp,
+    'Matrix, RegExp': function MatrixRegExp(x, test) {
+      return x.create(filterRegExp(x.toArray(), test));
+    }
+  });
+});
+/**
+ * Filter values in a callback given a callback function
+ * @param {Array} x
+ * @param {Function} callback
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+
+function _filterCallback(x, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = maxArgumentCount(callback);
+  return filter(x, function (value, index, array) {
+    // invoke the callback function with the right number of arguments
+    if (args === 1) {
+      return callback(value);
+    } else if (args === 2) {
+      return callback(value, [index]);
+    } else {
+      // 3 or -1
+      return callback(value, [index], array);
+    }
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/flatten.js b/node_modules/mathjs/lib/esm/function/matrix/flatten.js
new file mode 100644
index 0000000..075ee3c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/flatten.js
@@ -0,0 +1,41 @@
+import { clone } from '../../utils/object.js';
+import { flatten as flattenArray } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'flatten';
+var dependencies = ['typed', 'matrix'];
+export var createFlatten = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+
+  /**
+   * Flatten a multi dimensional matrix into a single dimensional matrix.
+   * It is guaranteed to always return a clone of the argument.
+   *
+   * Syntax:
+   *
+   *    math.flatten(x)
+   *
+   * Examples:
+   *
+   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]
+   *
+   * See also:
+   *
+   *    concat, resize, size, squeeze
+   *
+   * @param {Matrix | Array} x   Matrix to be flattened
+   * @return {Matrix | Array} Returns the flattened matrix
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return flattenArray(clone(x));
+    },
+    Matrix: function Matrix(x) {
+      var flat = flattenArray(clone(x.toArray())); // TODO: return the same matrix type as x
+
+      return matrix(flat);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/forEach.js b/node_modules/mathjs/lib/esm/function/matrix/forEach.js
new file mode 100644
index 0000000..fece797
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/forEach.js
@@ -0,0 +1,72 @@
+import { maxArgumentCount } from '../../utils/function.js';
+import { forEach as forEachArray } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'forEach';
+var dependencies = ['typed'];
+export var createForEach = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given callback function.
+   *
+   * Syntax:
+   *
+   *    math.forEach(x, callback)
+   *
+   * Examples:
+   *
+   *    math.forEach([1, 2, 3], function(value) {
+   *      console.log(value)
+   *    })
+   *    // outputs 1, 2, 3
+   *
+   * See also:
+   *
+   *    filter, map, sort
+   *
+   * @param {Matrix | Array} x    The matrix to iterate on.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix/array being traversed.
+   */
+  return typed(name, {
+    'Array, function': _forEach,
+    'Matrix, function': function MatrixFunction(x, callback) {
+      return x.forEach(callback);
+    }
+  });
+});
+/**
+ * forEach for a multi dimensional array
+ * @param {Array} array
+ * @param {Function} callback
+ * @private
+ */
+
+function _forEach(array, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = maxArgumentCount(callback);
+
+  var recurse = function recurse(value, index) {
+    if (Array.isArray(value)) {
+      forEachArray(value, function (child, i) {
+        // we create a copy of the index array and append the new index value
+        recurse(child, index.concat(i));
+      });
+    } else {
+      // invoke the callback function with the right number of arguments
+      if (args === 1) {
+        callback(value);
+      } else if (args === 2) {
+        callback(value, index);
+      } else {
+        // 3 or -1
+        callback(value, index, array);
+      }
+    }
+  };
+
+  recurse(array, []);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..260fcde
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { getArrayDataType } from '../../utils/array.js';
+import { typeOf } from '../../utils/is.js';
+var name = 'getMatrixDataType';
+var dependencies = ['typed'];
+export var createGetMatrixDataType = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Find the data type of all elements in a matrix or array,
+   * for example 'number' if all items are a number and 'Complex' if all values
+   * are complex numbers.
+   * If a matrix contains more than one data type, it will return 'mixed'.
+   *
+   * Syntax:
+   *
+   *    math.getMatrixDataType(x)
+   *
+   * Examples:
+   *
+   *    const x = [ [1, 2, 3], [4, 5, 6] ]
+   *    const mixedX = [ [1, true], [2, 3] ]
+   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3] ]
+   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]
+   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]
+   *    const sparse = math.sparse(x)
+   *    const dense = math.matrix(x)
+   *    math.getMatrixDataType(x)   // returns 'number'
+   *    math.getMatrixDataType(sparse)   // returns 'number'
+   *    math.getMatrixDataType(dense)   // returns 'number'
+   *    math.getMatrixDataType(mixedX) // returns 'mixed'
+   *    math.getMatrixDataType(fractionX) // returns 'Fraction'
+   *    math.getMatrixDataType(unitX) // returns 'Unit'
+   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'
+   *
+   * See also:
+   *  SparseMatrix, DenseMatrix
+   *
+   * @param {...Matrix | Array} x   The Matrix with values.
+   *
+   * @return {string} A string representation of the matrix type
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return getArrayDataType(x, typeOf);
+    },
+    Matrix: function Matrix(x) {
+      return x.getDataType();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/identity.js b/node_modules/mathjs/lib/esm/function/matrix/identity.js
new file mode 100644
index 0000000..b9404e4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/identity.js
@@ -0,0 +1,147 @@
+import { isBigNumber } from '../../utils/is.js';
+import { resize } from '../../utils/array.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'identity';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];
+export var createIdentity = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+
+  /**
+   * Create a 2-dimensional identity matrix with size m x n or n x n.
+   * The matrix has ones on the diagonal and zeros elsewhere.
+   *
+   * Syntax:
+   *
+   *    math.identity(n)
+   *    math.identity(n, format)
+   *    math.identity(m, n)
+   *    math.identity(m, n, format)
+   *    math.identity([m, n])
+   *    math.identity([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]
+   *
+   * See also:
+   *
+   *    diag, ones, zeros, size, range
+   *
+   * @param {...number | Matrix | Array} size   The size for the matrix
+   * @param {string} [format]                   The Matrix storage format
+   *
+   * @return {Matrix | Array | number} A matrix with ones on the diagonal.
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function string(format) {
+      return matrix(format);
+    },
+    'number | BigNumber': function numberBigNumber(rows) {
+      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, string': function numberBigNumberString(rows, format) {
+      return _identity(rows, rows, format);
+    },
+    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(rows, cols) {
+      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, number | BigNumber, string': function numberBigNumberNumberBigNumberString(rows, cols, format) {
+      return _identity(rows, cols, format);
+    },
+    Array: function Array(size) {
+      return _identityVector(size);
+    },
+    'Array, string': function ArrayString(size, format) {
+      return _identityVector(size, format);
+    },
+    Matrix: function Matrix(size) {
+      return _identityVector(size.valueOf(), size.storage());
+    },
+    'Matrix, string': function MatrixString(size, format) {
+      return _identityVector(size.valueOf(), format);
+    }
+  });
+
+  function _identityVector(size, format) {
+    switch (size.length) {
+      case 0:
+        return format ? matrix(format) : [];
+
+      case 1:
+        return _identity(size[0], size[0], format);
+
+      case 2:
+        return _identity(size[0], size[1], format);
+
+      default:
+        throw new Error('Vector containing two values expected');
+    }
+  }
+  /**
+   * Create an identity matrix
+   * @param {number | BigNumber} rows
+   * @param {number | BigNumber} cols
+   * @param {string} [format]
+   * @returns {Matrix}
+   * @private
+   */
+
+
+  function _identity(rows, cols, format) {
+    // BigNumber constructor with the right precision
+    var Big = isBigNumber(rows) || isBigNumber(cols) ? BigNumber : null;
+    if (isBigNumber(rows)) rows = rows.toNumber();
+    if (isBigNumber(cols)) cols = cols.toNumber();
+
+    if (!isInteger(rows) || rows < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+
+    if (!isInteger(cols) || cols < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+
+    var one = Big ? new BigNumber(1) : 1;
+    var defaultValue = Big ? new Big(0) : 0;
+    var size = [rows, cols]; // check we need to return a matrix
+
+    if (format) {
+      // create diagonal matrix (use optimized implementation for storage format)
+      if (format === 'sparse') {
+        return SparseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+
+      if (format === 'dense') {
+        return DenseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+
+      throw new TypeError("Unknown matrix type \"".concat(format, "\""));
+    } // create and resize array
+
+
+    var res = resize([], size, defaultValue); // fill in ones on the diagonal
+
+    var minimum = rows < cols ? rows : cols; // fill diagonal
+
+    for (var d = 0; d < minimum; d++) {
+      res[d][d] = one;
+    }
+
+    return res;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/inv.js b/node_modules/mathjs/lib/esm/function/matrix/inv.js
new file mode 100644
index 0000000..9d1833e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/inv.js
@@ -0,0 +1,203 @@
+import { isMatrix } from '../../utils/is.js';
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { format } from '../../utils/string.js';
+var name = 'inv';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];
+export var createInv = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    addScalar,
+    multiply,
+    unaryMinus,
+    det,
+    identity,
+    abs
+  } = _ref;
+
+  /**
+   * Calculate the inverse of a square matrix.
+   *
+   * Syntax:
+   *
+   *     math.inv(x)
+   *
+   * Examples:
+   *
+   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]
+   *     math.inv(4)                 // returns 0.25
+   *     1 / 4                       // returns 0.25
+   *
+   * See also:
+   *
+   *     det, transpose
+   *
+   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed
+   * @return {number | Complex | Array | Matrix} The inverse of `x`.
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(x) {
+      var size = isMatrix(x) ? x.size() : arraySize(x);
+
+      switch (size.length) {
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            if (isMatrix(x)) {
+              return matrix([divideScalar(1, x.valueOf()[0])]);
+            } else {
+              return [divideScalar(1, x[0])];
+            }
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+          }
+
+        case 2:
+          // two dimensional array
+          {
+            var rows = size[0];
+            var cols = size[1];
+
+            if (rows === cols) {
+              if (isMatrix(x)) {
+                return matrix(_inv(x.valueOf(), rows, cols), x.storage());
+              } else {
+                // return an Array
+                return _inv(x, rows, cols);
+              }
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+            }
+          }
+
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');
+      }
+    },
+    any: function any(x) {
+      // scalar
+      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers
+    }
+  });
+  /**
+   * Calculate the inverse of a square matrix
+   * @param {Array[]} mat     A square matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns, must equal rows
+   * @return {Array[]} inv    Inverse matrix
+   * @private
+   */
+
+  function _inv(mat, rows, cols) {
+    var r, s, f, value, temp;
+
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      value = mat[0][0];
+
+      if (value === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+
+      return [[divideScalar(1, value)]];
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      var d = det(mat);
+
+      if (d === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+
+      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];
+    } else {
+      // this is a matrix of 3 x 3 or larger
+      // calculate inverse using gauss-jordan elimination
+      //      https://en.wikipedia.org/wiki/Gaussian_elimination
+      //      http://mathworld.wolfram.com/MatrixInverse.html
+      //      http://math.uww.edu/~mcfarlat/inverse.htm
+      // make a copy of the matrix (only the arrays, not of the elements)
+      var A = mat.concat();
+
+      for (r = 0; r < rows; r++) {
+        A[r] = A[r].concat();
+      } // create an identity matrix which in the end will contain the
+      // matrix inverse
+
+
+      var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions
+
+      for (var c = 0; c < cols; c++) {
+        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]
+        var ABig = abs(A[c][c]);
+        var rBig = c;
+        r = c + 1;
+
+        while (r < rows) {
+          if (abs(A[r][c]) > ABig) {
+            ABig = abs(A[r][c]);
+            rBig = r;
+          }
+
+          r++;
+        }
+
+        if (ABig === 0) {
+          throw Error('Cannot calculate inverse, determinant is zero');
+        }
+
+        r = rBig;
+
+        if (r !== c) {
+          temp = A[c];
+          A[c] = A[r];
+          A[r] = temp;
+          temp = B[c];
+          B[c] = B[r];
+          B[r] = temp;
+        } // eliminate non-zero values on the other rows at column c
+
+
+        var Ac = A[c];
+        var Bc = B[c];
+
+        for (r = 0; r < rows; r++) {
+          var Ar = A[r];
+          var Br = B[r];
+
+          if (r !== c) {
+            // eliminate value at column c and row r
+            if (Ar[c] !== 0) {
+              f = divideScalar(unaryMinus(Ar[c]), Ac[c]); // add (f * row c) to row r to eliminate the value
+              // at column c
+
+              for (s = c; s < cols; s++) {
+                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));
+              }
+
+              for (s = 0; s < cols; s++) {
+                Br[s] = addScalar(Br[s], multiply(f, Bc[s]));
+              }
+            }
+          } else {
+            // normalize value at Acc to 1,
+            // divide each value on row r with the value at Acc
+            f = Ac[c];
+
+            for (s = c; s < cols; s++) {
+              Ar[s] = divideScalar(Ar[s], f);
+            }
+
+            for (s = 0; s < cols; s++) {
+              Br[s] = divideScalar(Br[s], f);
+            }
+          }
+        }
+      }
+
+      return B;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/kron.js b/node_modules/mathjs/lib/esm/function/matrix/kron.js
new file mode 100644
index 0000000..fca69e3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/kron.js
@@ -0,0 +1,89 @@
+import { arraySize as size } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'kron';
+var dependencies = ['typed', 'matrix', 'multiplyScalar'];
+export var createKron = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    multiplyScalar
+  } = _ref;
+
+  /**
+     * Calculates the kronecker product of 2 matrices or vectors.
+     *
+     * NOTE: If a one dimensional vector / matrix is given, it will be
+     * wrapped so its two dimensions.
+     * See the examples.
+     *
+     * Syntax:
+     *
+     *    math.kron(x, y)
+     *
+     * Examples:
+     *
+     *    math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])
+     *    // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]
+     *
+     *    math.kron([1,1], [2,3,4])
+     *    // returns [ [ 2, 3, 4, 2, 3, 4 ] ]
+     *
+     * See also:
+     *
+     *    multiply, dot, cross
+     *
+     * @param  {Array | Matrix} x     First vector
+     * @param  {Array | Matrix} y     Second vector
+     * @return {Array | Matrix}       Returns the kronecker product of `x` and `y`
+     */
+  return typed(name, {
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      return matrix(_kron(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      return matrix(_kron(x.toArray(), y));
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      return matrix(_kron(x, y.toArray()));
+    },
+    'Array, Array': _kron
+  });
+  /**
+     * Calculate the kronecker product of two matrices / vectors
+     * @param {Array} a  First vector
+     * @param {Array} b  Second vector
+     * @returns {Array} Returns the kronecker product of x and y
+     * @private
+     */
+
+  function _kron(a, b) {
+    // Deal with the dimensions of the matricies.
+    if (size(a).length === 1) {
+      // Wrap it in a 2D Matrix
+      a = [a];
+    }
+
+    if (size(b).length === 1) {
+      // Wrap it in a 2D Matrix
+      b = [b];
+    }
+
+    if (size(a).length > 2 || size(b).length > 2) {
+      throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');
+    }
+
+    var t = [];
+    var r = [];
+    return a.map(function (a) {
+      return b.map(function (b) {
+        r = [];
+        t.push(r);
+        return a.map(function (y) {
+          return b.map(function (x) {
+            return r.push(multiplyScalar(y, x));
+          });
+        });
+      });
+    }) && t;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/map.js b/node_modules/mathjs/lib/esm/function/matrix/map.js
new file mode 100644
index 0000000..7676886
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/map.js
@@ -0,0 +1,111 @@
+import { maxArgumentCount } from '../../utils/function.js';
+import { factory } from '../../utils/factory.js';
+var name = 'map';
+var dependencies = ['typed'];
+export var createMap = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Create a new matrix or array with the results of a callback function executed on
+   * each entry of a given matrix/array.
+   *
+   * For each entry of the input, the callback is invoked with three arguments:
+   * the value of the entry, the index at which that entry occurs, and the full
+   * matrix/array being traversed. Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.map(x, callback)
+   *
+   * Examples:
+   *
+   *    math.map([1, 2, 3], function(value) {
+   *      return value * value
+   *    })  // returns [1, 4, 9]
+   *
+   *    // The calling convention for the callback can cause subtleties:
+   *    math.map([1, 2, 3], math.format)
+   *    // throws TypeError: map attempted to call 'format(1,[0])' but argument 2 of type Array does not match expected type number or function or Object or string or boolean
+   *    // [This happens because `format` _can_ take a second argument,
+   *    // but its semantics don't match that of the 2nd argument `map` provides]
+   *
+   *    // To avoid this error, use a function that takes exactly the
+   *    // desired arguments:
+   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']
+   *
+   * See also:
+   *
+   *    filter, forEach, sort
+   *
+   * @param {Matrix | Array} x    The input to iterate on.
+   * @param {Function} callback
+   *     The function to call (as described above) on each entry of the input
+   * @return {Matrix | array}
+   *     Transformed map of x; always has the same type and shape as x
+   */
+  return typed(name, {
+    'Array, function': _map,
+    'Matrix, function': function MatrixFunction(x, callback) {
+      return x.map(callback);
+    }
+  });
+});
+/**
+ * Map for a multi dimensional array
+ * @param {Array} array
+ * @param {Function} callback
+ * @return {Array}
+ * @private
+ */
+
+function _map(array, callback) {
+  // figure out what number of arguments the callback function expects
+  var args = maxArgumentCount(callback);
+
+  var recurse = function recurse(value, index) {
+    if (Array.isArray(value)) {
+      return value.map(function (child, i) {
+        // we create a copy of the index array and append the new index value
+        return recurse(child, index.concat(i));
+      });
+    } else {
+      try {
+        // invoke the callback function with the right number of arguments
+        if (args === 1) {
+          return callback(value);
+        } else if (args === 2) {
+          return callback(value, index);
+        } else {
+          // 3 or -1
+          return callback(value, index, array);
+        }
+      } catch (err) {
+        // But maybe the arguments still weren't right
+        if (err instanceof TypeError && 'data' in err && err.data.category === 'wrongType') {
+          var newmsg = "map attempted to call '".concat(err.data.fn, "(").concat(value);
+          var indexString = JSON.stringify(index);
+
+          if (args === 2) {
+            newmsg += ',' + indexString;
+          } else if (args !== 1) {
+            newmsg += ",".concat(indexString, ",").concat(array);
+          }
+
+          newmsg += ")' but argument ".concat(err.data.index + 1, " of type ");
+          newmsg += "".concat(err.data.actual, " does not match expected type ");
+          newmsg += err.data.expected.join(' or ');
+          throw new TypeError(newmsg);
+        }
+
+        throw err;
+      }
+    }
+  };
+
+  return recurse(array, []);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..d158a7e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js
@@ -0,0 +1,93 @@
+import { factory } from '../../utils/factory.js';
+var name = 'matrixFromColumns';
+var dependencies = ['typed', 'matrix', 'flatten', 'size'];
+export var createMatrixFromColumns = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    flatten,
+    size
+  } = _ref;
+
+  /**
+   * Create a dense matrix from vectors as individual columns.
+   * If you pass row vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromColumns(...arr)
+   *    math.matrixFromColumns(col1, col2)
+   *    math.matrixFromColumns(col1, col2, col3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromColumns(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromRows, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} cols Multiple columns
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function Array(arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function Matrix(arr) {
+      return matrix(_createArray(arr.map(m => m.toArray())));
+    } // TODO implement this properly for SparseMatrix
+
+  });
+
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');
+    var N = checkVectorTypeAndReturnLength(arr[0]); // create an array with empty rows
+
+    var result = [];
+
+    for (var i = 0; i < N; i++) {
+      result[i] = [];
+    } // loop columns
+
+
+    for (var col of arr) {
+      var colLength = checkVectorTypeAndReturnLength(col);
+
+      if (colLength !== N) {
+        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));
+      }
+
+      var f = flatten(col); // push a value to each row
+
+      for (var _i = 0; _i < N; _i++) {
+        result[_i].push(f[_i]);
+      }
+    }
+
+    return result;
+  }
+
+  function checkVectorTypeAndReturnLength(vec) {
+    var s = size(vec);
+
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/esm/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..a69c159
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/matrixFromFunction.js
@@ -0,0 +1,78 @@
+import { factory } from '../../utils/factory.js';
+var name = 'matrixFromFunction';
+var dependencies = ['typed', 'matrix', 'isZero'];
+export var createMatrixFromFunction = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    isZero
+  } = _ref;
+
+  /**
+   * Create a matrix by evaluating a generating function at each index.
+   * The simplest overload returns a multi-dimensional array as long as `size` is an array.
+   * Passing `size` as a Matrix or specifying a `format` will result in returning a Matrix.
+   *
+   * Syntax:
+   *
+   *    math.matrixFromFunction(size, fn)
+   *    math.matrixFromFunction(size, fn, format)
+   *    math.matrixFromFunction(size, fn, format, datatype)
+   *    math.matrixFromFunction(size, format, fn)
+   *    math.matrixFromFunction(size, format, datatype, fn)
+   *
+   * Examples:
+   *
+   *    math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix
+   *    math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix
+   *    math.matrixFromFunction([5], i => math.random()) // a random vector
+   *
+   * See also:
+   *
+   *    matrix, zeros
+   *
+   * @param {Array | Matrix} size   The size of the matrix to be created
+   * @param {function} fn           Callback function invoked for every entry in the matrix
+   * @param {string} [format]       The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]     Type of the values
+   * @return {Array | Matrix} Returns the created matrix
+   */
+  return typed(name, {
+    'Array | Matrix, function, string, string': function ArrayMatrixFunctionStringString(size, fn, format, datatype) {
+      return _create(size, fn, format, datatype);
+    },
+    'Array | Matrix, function, string': function ArrayMatrixFunctionString(size, fn, format) {
+      return _create(size, fn, format);
+    },
+    'Matrix, function': function MatrixFunction(size, fn) {
+      return _create(size, fn, 'dense');
+    },
+    'Array, function': function ArrayFunction(size, fn) {
+      return _create(size, fn, 'dense').toArray();
+    },
+    'Array | Matrix, string, function': function ArrayMatrixStringFunction(size, format, fn) {
+      return _create(size, fn, format);
+    },
+    'Array | Matrix, string, string, function': function ArrayMatrixStringStringFunction(size, format, datatype, fn) {
+      return _create(size, fn, format, datatype);
+    }
+  });
+
+  function _create(size, fn, format, datatype) {
+    var m;
+
+    if (datatype !== undefined) {
+      m = matrix(format, datatype);
+    } else {
+      m = matrix(format);
+    }
+
+    m.resize(size);
+    m.forEach(function (_, index) {
+      var val = fn(index);
+      if (isZero(val)) return;
+      m.set(index, val);
+    });
+    return m;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/esm/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..397ce49
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/matrixFromRows.js
@@ -0,0 +1,83 @@
+import { factory } from '../../utils/factory.js';
+var name = 'matrixFromRows';
+var dependencies = ['typed', 'matrix', 'flatten', 'size'];
+export var createMatrixFromRows = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    flatten,
+    size
+  } = _ref;
+
+  /**
+   * Create a dense matrix from vectors as individual rows.
+   * If you pass column vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromRows(...arr)
+   *    math.matrixFromRows(row1, row2)
+   *    math.matrixFromRows(row1, row2, row3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromRows([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromRows(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromColumns, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} rows  Multiple rows
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function Array(arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function Matrix(arr) {
+      return matrix(_createArray(arr.map(m => m.toArray())));
+    } // TODO implement this properly for SparseMatrix
+
+  });
+
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.');
+    var N = checkVectorTypeAndReturnLength(arr[0]);
+    var result = [];
+
+    for (var row of arr) {
+      var rowLength = checkVectorTypeAndReturnLength(row);
+
+      if (rowLength !== N) {
+        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0));
+      }
+
+      result.push(flatten(row));
+    }
+
+    return result;
+  }
+
+  function checkVectorTypeAndReturnLength(vec) {
+    var s = size(vec);
+
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/ones.js b/node_modules/mathjs/lib/esm/function/matrix/ones.js
new file mode 100644
index 0000000..225f51f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/ones.js
@@ -0,0 +1,131 @@
+import { isBigNumber } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { resize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ones';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+export var createOnes = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+
+  /**
+   * Create a matrix filled with ones. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.ones(m)
+   *    math.ones(m, format)
+   *    math.ones(m, n)
+   *    math.ones(m, n, format)
+   *    math.ones([m, n])
+   *    math.ones([m, n], format)
+   *    math.ones([m, n, p, ...])
+   *    math.ones([m, n, p, ...], format)
+   *
+   * Examples:
+   *
+   *    math.ones(3)                   // returns [1, 1, 1]
+   *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]
+   *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]
+   *
+   * See also:
+   *
+   *    zeros, identity, size, range
+   *
+   * @param {...number | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix | number}  A matrix filled with ones
+   */
+  return typed('ones', {
+    '': function _() {
+      return config.matrix === 'Array' ? _ones([]) : _ones([], 'default');
+    },
+    // math.ones(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function numberBigNumberString(size) {
+      var last = size[size.length - 1];
+
+      if (typeof last === 'string') {
+        var format = size.pop();
+        return _ones(size, format);
+      } else if (config.matrix === 'Array') {
+        return _ones(size);
+      } else {
+        return _ones(size, 'default');
+      }
+    },
+    Array: _ones,
+    Matrix: function Matrix(size) {
+      var format = size.storage();
+      return _ones(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function ArrayMatrixString(size, format) {
+      return _ones(size.valueOf(), format);
+    }
+  });
+  /**
+   * Create an Array or Matrix with ones
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+
+  function _ones(size, format) {
+    var hasBigNumbers = _normalize(size);
+
+    var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;
+
+    _validate(size);
+
+    if (format) {
+      // return a matrix
+      var m = matrix(format);
+
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+
+      return m;
+    } else {
+      // return an Array
+      var arr = [];
+
+      if (size.length > 0) {
+        return resize(arr, size, defaultValue);
+      }
+
+      return arr;
+    }
+  } // replace BigNumbers with numbers, returns true if size contained BigNumbers
+
+
+  function _normalize(size) {
+    var hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if (isBigNumber(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  } // validate arguments
+
+
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !isInteger(value) || value < 0) {
+        throw new Error('Parameters in function ones must be positive integers');
+      }
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..61280c2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js
@@ -0,0 +1,146 @@
+import { isMatrix } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'partitionSelect';
+var dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];
+export var createPartitionSelect = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isNumeric,
+    isNaN,
+    compare
+  } = _ref;
+  var asc = compare;
+
+  var desc = (a, b) => -compare(a, b);
+  /**
+   * Partition-based selection of an array or 1D matrix.
+   * Will find the kth smallest value, and mutates the input array.
+   * Uses Quickselect.
+   *
+   * Syntax:
+   *
+   *    math.partitionSelect(x, k)
+   *    math.partitionSelect(x, k, compare)
+   *
+   * Examples:
+   *
+   *    math.partitionSelect([5, 10, 1], 2)           // returns 10
+   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1) // returns 'B'
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'
+   *
+   * See also:
+   *
+   *    sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Number} k            The kth smallest value to be retrieved zero-based index
+   * @param {Function | 'asc' | 'desc'} [compare='asc']
+   *        An optional comparator function. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {*} Returns the kth lowest value.
+   */
+
+
+  return typed(name, {
+    'Array | Matrix, number': function ArrayMatrixNumber(x, k) {
+      return _partitionSelect(x, k, asc);
+    },
+    'Array | Matrix, number, string': function ArrayMatrixNumberString(x, k, compare) {
+      if (compare === 'asc') {
+        return _partitionSelect(x, k, asc);
+      } else if (compare === 'desc') {
+        return _partitionSelect(x, k, desc);
+      } else {
+        throw new Error('Compare string must be "asc" or "desc"');
+      }
+    },
+    'Array | Matrix, number, function': _partitionSelect
+  });
+
+  function _partitionSelect(x, k, compare) {
+    if (!isInteger(k) || k < 0) {
+      throw new Error('k must be a non-negative integer');
+    }
+
+    if (isMatrix(x)) {
+      var size = x.size();
+
+      if (size.length > 1) {
+        throw new Error('Only one dimensional matrices supported');
+      }
+
+      return quickSelect(x.valueOf(), k, compare);
+    }
+
+    if (Array.isArray(x)) {
+      return quickSelect(x, k, compare);
+    }
+  }
+  /**
+   * Quickselect algorithm.
+   * Code adapted from:
+   * https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html
+   *
+   * @param {Array} arr
+   * @param {Number} k
+   * @param {Function} compare
+   * @private
+   */
+
+
+  function quickSelect(arr, k, compare) {
+    if (k >= arr.length) {
+      throw new Error('k out of bounds');
+    } // check for NaN values since these can cause an infinite while loop
+
+
+    for (var i = 0; i < arr.length; i++) {
+      if (isNumeric(arr[i]) && isNaN(arr[i])) {
+        return arr[i]; // return NaN
+      }
+    }
+
+    var from = 0;
+    var to = arr.length - 1; // if from == to we reached the kth element
+
+    while (from < to) {
+      var r = from;
+      var w = to;
+      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]; // stop if the reader and writer meets
+
+      while (r < w) {
+        // arr[r] >= pivot
+        if (compare(arr[r], pivot) >= 0) {
+          // put the large values at the end
+          var tmp = arr[w];
+          arr[w] = arr[r];
+          arr[r] = tmp;
+          --w;
+        } else {
+          // the value is smaller than the pivot, skip
+          ++r;
+        }
+      } // if we stepped up (r++) we need to step one down (arr[r] > pivot)
+
+
+      if (compare(arr[r], pivot) > 0) {
+        --r;
+      } // the r pointer is on the end of the first k elements
+
+
+      if (k <= r) {
+        to = r;
+      } else {
+        from = r + 1;
+      }
+    }
+
+    return arr[k];
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/range.js b/node_modules/mathjs/lib/esm/function/matrix/range.js
new file mode 100644
index 0000000..1484df9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/range.js
@@ -0,0 +1,281 @@
+import { factory } from '../../utils/factory.js';
+import { noBignumber, noMatrix } from '../../utils/noop.js';
+var name = 'range';
+var dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];
+export var createRange = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    bignumber,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq
+  } = _ref;
+
+  /**
+   * Create an array from a range.
+   * By default, the range end is excluded. This can be customized by providing
+   * an extra parameter `includeEnd`.
+   *
+   * Syntax:
+   *
+   *     math.range(str [, includeEnd])               // Create a range from a string,
+   *                                                  // where the string contains the
+   *                                                  // start, optional step, and end,
+   *                                                  // separated by a colon.
+   *     math.range(start, end [, includeEnd])        // Create a range with start and
+   *                                                  // end and a step size of 1.
+   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,
+   *                                                  // and end.
+   *
+   * Where:
+   *
+   * - `str: string`
+   *   A string 'start:end' or 'start:step:end'
+   * - `start: {number | BigNumber}`
+   *   Start of the range
+   * - `end: number | BigNumber`
+   *   End of the range, excluded by default, included when parameter includeEnd=true
+   * - `step: number | BigNumber`
+   *   Step size. Default value is 1.
+   * - `includeEnd: boolean`
+   *   Option to specify whether to include the end or not. False by default.
+   *
+   * Examples:
+   *
+   *     math.range(2, 6)        // [2, 3, 4, 5]
+   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]
+   *     math.range('2:1:6')     // [2, 3, 4, 5]
+   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]
+   *
+   * See also:
+   *
+   *     ones, zeros, size, subset
+   *
+   * @param {*} args   Parameters describing the ranges `start`, `end`, and optional `step`.
+   * @return {Array | Matrix} range
+   */
+  return typed(name, {
+    // TODO: simplify signatures when typed-function supports default values and optional arguments
+    // TODO: a number or boolean should not be converted to string here
+    string: _strRange,
+    'string, boolean': _strRange,
+    'number, number': function numberNumber(start, end) {
+      return _out(_rangeEx(start, end, 1));
+    },
+    'number, number, number': function numberNumberNumber(start, end, step) {
+      return _out(_rangeEx(start, end, step));
+    },
+    'number, number, boolean': function numberNumberBoolean(start, end, includeEnd) {
+      return includeEnd ? _out(_rangeInc(start, end, 1)) : _out(_rangeEx(start, end, 1));
+    },
+    'number, number, number, boolean': function numberNumberNumberBoolean(start, end, step, includeEnd) {
+      return includeEnd ? _out(_rangeInc(start, end, step)) : _out(_rangeEx(start, end, step));
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(start, end) {
+      var BigNumber = start.constructor;
+      return _out(_bigRangeEx(start, end, new BigNumber(1)));
+    },
+    'BigNumber, BigNumber, BigNumber': function BigNumberBigNumberBigNumber(start, end, step) {
+      return _out(_bigRangeEx(start, end, step));
+    },
+    'BigNumber, BigNumber, boolean': function BigNumberBigNumberBoolean(start, end, includeEnd) {
+      var BigNumber = start.constructor;
+      return includeEnd ? _out(_bigRangeInc(start, end, new BigNumber(1))) : _out(_bigRangeEx(start, end, new BigNumber(1)));
+    },
+    'BigNumber, BigNumber, BigNumber, boolean': function BigNumberBigNumberBigNumberBoolean(start, end, step, includeEnd) {
+      return includeEnd ? _out(_bigRangeInc(start, end, step)) : _out(_bigRangeEx(start, end, step));
+    }
+  });
+
+  function _out(arr) {
+    if (config.matrix === 'Matrix') {
+      return matrix ? matrix(arr) : noMatrix();
+    }
+
+    return arr;
+  }
+
+  function _strRange(str, includeEnd) {
+    var r = _parse(str);
+
+    if (!r) {
+      throw new SyntaxError('String "' + str + '" is no valid range');
+    }
+
+    var fn;
+
+    if (config.number === 'BigNumber') {
+      if (bignumber === undefined) {
+        noBignumber();
+      }
+
+      fn = includeEnd ? _bigRangeInc : _bigRangeEx;
+      return _out(fn(bignumber(r.start), bignumber(r.end), bignumber(r.step)));
+    } else {
+      fn = includeEnd ? _rangeInc : _rangeEx;
+      return _out(fn(r.start, r.end, r.step));
+    }
+  }
+  /**
+   * Create a range with numbers. End is excluded
+   * @param {number} start
+   * @param {number} end
+   * @param {number} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _rangeEx(start, end, step) {
+    var array = [];
+    var x = start;
+
+    if (step > 0) {
+      while (smaller(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    } else if (step < 0) {
+      while (larger(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Create a range with numbers. End is included
+   * @param {number} start
+   * @param {number} end
+   * @param {number} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _rangeInc(start, end, step) {
+    var array = [];
+    var x = start;
+
+    if (step > 0) {
+      while (smallerEq(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    } else if (step < 0) {
+      while (largerEq(x, end)) {
+        array.push(x);
+        x += step;
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Create a range with big numbers. End is excluded
+   * @param {BigNumber} start
+   * @param {BigNumber} end
+   * @param {BigNumber} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _bigRangeEx(start, end, step) {
+    var zero = bignumber(0);
+    var array = [];
+    var x = start;
+
+    if (step.gt(zero)) {
+      while (smaller(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    } else if (step.lt(zero)) {
+      while (larger(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Create a range with big numbers. End is included
+   * @param {BigNumber} start
+   * @param {BigNumber} end
+   * @param {BigNumber} step
+   * @returns {Array} range
+   * @private
+   */
+
+
+  function _bigRangeInc(start, end, step) {
+    var zero = bignumber(0);
+    var array = [];
+    var x = start;
+
+    if (step.gt(zero)) {
+      while (smallerEq(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    } else if (step.lt(zero)) {
+      while (largerEq(x, end)) {
+        array.push(x);
+        x = x.plus(step);
+      }
+    }
+
+    return array;
+  }
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @param {string} str
+   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step
+   * @private
+   */
+
+
+  function _parse(str) {
+    var args = str.split(':'); // number
+
+    var nums = args.map(function (arg) {
+      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string
+      return Number(arg);
+    });
+    var invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+
+    if (invalid) {
+      return null;
+    }
+
+    switch (nums.length) {
+      case 2:
+        return {
+          start: nums[0],
+          end: nums[1],
+          step: 1
+        };
+
+      case 3:
+        return {
+          start: nums[0],
+          end: nums[2],
+          step: nums[1]
+        };
+
+      default:
+        return null;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/reshape.js b/node_modules/mathjs/lib/esm/function/matrix/reshape.js
new file mode 100644
index 0000000..644f1b4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/reshape.js
@@ -0,0 +1,64 @@
+import { reshape as arrayReshape } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'reshape';
+var dependencies = ['typed', 'isInteger', 'matrix'];
+export var createReshape = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isInteger
+  } = _ref;
+
+  /**
+   * Reshape a multi dimensional array to fit the specified dimensions
+   *
+   * Syntax:
+   *
+   *     math.reshape(x, sizes)
+   *
+   * Examples:
+   *
+   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])
+   *     // returns Array  [[1, 2, 3], [4, 5, 6]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [1, 4])
+   *     // returns Array  [[1, 2, 3, 4]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [4])
+   *     // returns Array [1, 2, 3, 4]
+   *
+   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])
+   *     math.reshape(x, [2, 2, 2])
+   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]
+   *
+   *    math.reshape([1, 2, 3, 4], [-1, 2])
+   *    // returns Matrix [[1, 2], [3, 4]]
+   *
+   * See also:
+   *
+   *     size, squeeze, resize
+   *
+   * @param {Array | Matrix | *} x  Matrix to be reshaped
+   * @param {number[]} sizes        One dimensional array with integral sizes for
+   *                                each dimension. One -1 is allowed as wildcard,
+   *                                which calculates this dimension automatically.
+   *
+   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`
+   *
+   * @throws {TypeError}            If `sizes` does not contain solely integers
+   * @throws {DimensionError}       If the product of the new dimension sizes does
+   *                                not equal that of the old ones
+   */
+  return typed(name, {
+    'Matrix, Array': function MatrixArray(x, sizes) {
+      return x.reshape(sizes);
+    },
+    'Array, Array': function ArrayArray(x, sizes) {
+      sizes.forEach(function (size) {
+        if (!isInteger(size)) {
+          throw new TypeError('Invalid size for dimension: ' + size);
+        }
+      });
+      return arrayReshape(x, sizes);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/resize.js b/node_modules/mathjs/lib/esm/function/matrix/resize.js
new file mode 100644
index 0000000..02a2613
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/resize.js
@@ -0,0 +1,133 @@
+import { isBigNumber, isMatrix } from '../../utils/is.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { ArgumentsError } from '../../error/ArgumentsError.js';
+import { isInteger } from '../../utils/number.js';
+import { format } from '../../utils/string.js';
+import { clone } from '../../utils/object.js';
+import { resize as arrayResize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'resize';
+var dependencies = ['config', 'matrix'];
+export var createResize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    matrix
+  } = _ref;
+
+  /**
+   * Resize a matrix
+   *
+   * Syntax:
+   *
+   *     math.resize(x, size)
+   *     math.resize(x, size, defaultValue)
+   *
+   * Examples:
+   *
+   *     math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]
+   *     math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]
+   *     math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]
+   *     math.resize("hello", [8], "!")    // returns string 'hello!!!'
+   *
+   * See also:
+   *
+   *     size, squeeze, subset, reshape
+   *
+   * @param {Array | Matrix | *} x             Matrix to be resized
+   * @param {Array | Matrix} size              One dimensional array with numbers
+   * @param {number | string} [defaultValue=0] Zero by default, except in
+   *                                           case of a string, in that case
+   *                                           defaultValue = ' '
+   * @return {* | Array | Matrix} A resized clone of matrix `x`
+   */
+  // TODO: rework resize to a typed-function
+  return function resize(x, size, defaultValue) {
+    if (arguments.length !== 2 && arguments.length !== 3) {
+      throw new ArgumentsError('resize', arguments.length, 2, 3);
+    }
+
+    if (isMatrix(size)) {
+      size = size.valueOf(); // get Array
+    }
+
+    if (isBigNumber(size[0])) {
+      // convert bignumbers to numbers
+      size = size.map(function (value) {
+        return !isBigNumber(value) ? value : value.toNumber();
+      });
+    } // check x is a Matrix
+
+
+    if (isMatrix(x)) {
+      // use optimized matrix implementation, return copy
+      return x.resize(size, defaultValue, true);
+    }
+
+    if (typeof x === 'string') {
+      // resize string
+      return _resizeString(x, size, defaultValue);
+    } // check result should be a matrix
+
+
+    var asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';
+
+    if (size.length === 0) {
+      // output a scalar
+      while (Array.isArray(x)) {
+        x = x[0];
+      }
+
+      return clone(x);
+    } else {
+      // output an array/matrix
+      if (!Array.isArray(x)) {
+        x = [x];
+      }
+
+      x = clone(x);
+      var res = arrayResize(x, size, defaultValue);
+      return asMatrix ? matrix(res) : res;
+    }
+  };
+  /**
+   * Resize a string
+   * @param {string} str
+   * @param {number[]} size
+   * @param {string} [defaultChar=' ']
+   * @private
+   */
+
+  function _resizeString(str, size, defaultChar) {
+    if (defaultChar !== undefined) {
+      if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {
+        throw new TypeError('Single character expected as defaultValue');
+      }
+    } else {
+      defaultChar = ' ';
+    }
+
+    if (size.length !== 1) {
+      throw new DimensionError(size.length, 1);
+    }
+
+    var len = size[0];
+
+    if (typeof len !== 'number' || !isInteger(len)) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');
+    }
+
+    if (str.length > len) {
+      return str.substring(0, len);
+    } else if (str.length < len) {
+      var res = str;
+
+      for (var i = 0, ii = len - str.length; i < ii; i++) {
+        res += defaultChar;
+      }
+
+      return res;
+    } else {
+      return str;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/rotate.js b/node_modules/mathjs/lib/esm/function/matrix/rotate.js
new file mode 100644
index 0000000..811e33e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/rotate.js
@@ -0,0 +1,80 @@
+import { factory } from '../../utils/factory.js';
+import { arraySize } from '../../utils/array.js';
+var name = 'rotate';
+var dependencies = ['typed', 'multiply', 'rotationMatrix'];
+export var createRotate = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    multiply,
+    rotationMatrix
+  } = _ref;
+
+  /**
+     * Rotate a vector of size 1x2 counter-clockwise by a given angle
+     * Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis
+     *
+     * Syntax:
+     *
+     *    math.rotate(w, theta)
+     *    math.rotate(w, theta, v)
+     *
+     * Examples:
+     *
+     *    math.rotate([11, 12], math.pi / 2)                           // returns matrix([-12, 11])
+     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns matrix([-12, 11])
+     *
+     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns matrix([0, 1, 0])
+     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns matrix([0, 1, 0])
+     *
+     *    math.rotate([1, 0], math.complex(1 + i))                     // returns matrix([cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)])
+     *
+     * See also:
+     *
+     *    matrix, rotationMatrix
+     *
+     * @param {Array | Matrix} w                             Vector to rotate
+     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+     * @param {Array | Matrix} [v]                           Rotation axis
+     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w
+     */
+  return typed(name, {
+    'Array , number | BigNumber | Complex | Unit': function ArrayNumberBigNumberComplexUnit(w, theta) {
+      _validateSize(w, 2);
+
+      var matrixRes = multiply(rotationMatrix(theta), w);
+      return matrixRes.toArray();
+    },
+    'Matrix , number | BigNumber | Complex | Unit': function MatrixNumberBigNumberComplexUnit(w, theta) {
+      _validateSize(w, 2);
+
+      return multiply(rotationMatrix(theta), w);
+    },
+    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function ArrayNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {
+      _validateSize(w, 3);
+
+      var matrixRes = multiply(rotationMatrix(theta, v), w);
+      return matrixRes;
+    },
+    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function MatrixNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {
+      _validateSize(w, 3);
+
+      return multiply(rotationMatrix(theta, v), w);
+    }
+  });
+
+  function _validateSize(v, expectedSize) {
+    var actualSize = Array.isArray(v) ? arraySize(v) : v.size();
+
+    if (actualSize.length > 2) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+
+    if (actualSize.length === 2 && actualSize[1] !== 1) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+
+    if (actualSize[0] !== expectedSize) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..e1c7a58
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js
@@ -0,0 +1,176 @@
+import { isBigNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'rotationMatrix';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];
+export var createRotationMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    multiplyScalar,
+    addScalar,
+    unaryMinus,
+    norm,
+    BigNumber,
+    matrix,
+    DenseMatrix,
+    SparseMatrix,
+    cos,
+    sin
+  } = _ref;
+
+  /**
+   * Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).
+   * Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).
+   *
+   * Syntax:
+   *
+   *    math.rotationMatrix(theta)
+   *    math.rotationMatrix(theta, format)
+   *    math.rotationMatrix(theta, [v])
+   *    math.rotationMatrix(theta, [v], format)
+   *
+   * Examples:
+   *
+   *    math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]
+   *    math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]
+   *    math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]
+   *    math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]
+   *
+   *    math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]
+   *    math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])
+   *
+   *
+   * See also:
+   *
+   *    matrix, cos, sin
+   *
+   *
+   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+   * @param {Array | Matrix} [v]                           Rotation axis
+   * @param {string} [format]                              Result Matrix storage format
+   * @return {Array | Matrix}                              Rotation matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function string(format) {
+      return matrix(format);
+    },
+    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(theta) {
+      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber | Complex | Unit, string': function numberBigNumberComplexUnitString(theta, format) {
+      return _rotationMatrix2x2(theta, format);
+    },
+    'number | BigNumber | Complex | Unit, Array': function numberBigNumberComplexUnitArray(theta, v) {
+      var matrixV = matrix(v);
+
+      _validateVector(matrixV);
+
+      return _rotationMatrix3x3(theta, matrixV, undefined);
+    },
+    'number | BigNumber | Complex | Unit, Matrix': function numberBigNumberComplexUnitMatrix(theta, v) {
+      _validateVector(v);
+
+      var storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined);
+      return _rotationMatrix3x3(theta, v, storageType);
+    },
+    'number | BigNumber | Complex | Unit, Array, string': function numberBigNumberComplexUnitArrayString(theta, v, format) {
+      var matrixV = matrix(v);
+
+      _validateVector(matrixV);
+
+      return _rotationMatrix3x3(theta, matrixV, format);
+    },
+    'number | BigNumber | Complex | Unit, Matrix, string': function numberBigNumberComplexUnitMatrixString(theta, v, format) {
+      _validateVector(v);
+
+      return _rotationMatrix3x3(theta, v, format);
+    }
+  });
+  /**
+   * Returns 2x2 matrix of 2D rotation of angle theta
+   *
+   * @param {number | BigNumber | Complex | Unit} theta  The rotation angle
+   * @param {string} format                              The result Matrix storage format
+   * @returns {Matrix}
+   * @private
+   */
+
+  function _rotationMatrix2x2(theta, format) {
+    var Big = isBigNumber(theta);
+    var minusOne = Big ? new BigNumber(-1) : -1;
+    var cosTheta = cos(theta);
+    var sinTheta = sin(theta);
+    var data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]];
+    return _convertToFormat(data, format);
+  }
+
+  function _validateVector(v) {
+    var size = v.size();
+
+    if (size.length < 1 || size[0] !== 3) {
+      throw new RangeError('Vector must be of dimensions 1x3');
+    }
+  }
+
+  function _mul(array) {
+    return array.reduce((p, curr) => multiplyScalar(p, curr));
+  }
+
+  function _convertToFormat(data, format) {
+    if (format) {
+      if (format === 'sparse') {
+        return new SparseMatrix(data);
+      }
+
+      if (format === 'dense') {
+        return new DenseMatrix(data);
+      }
+
+      throw new TypeError("Unknown matrix type \"".concat(format, "\""));
+    }
+
+    return data;
+  }
+  /**
+   * Returns a 3x3 matrix of rotation of angle theta around vector v
+   *
+   * @param {number | BigNumber | Complex | Unit} theta The rotation angle
+   * @param {Matrix} v                                  The rotation axis vector
+   * @param {string} format                             The storage format of the resulting matrix
+   * @returns {Matrix}
+   * @private
+   */
+
+
+  function _rotationMatrix3x3(theta, v, format) {
+    var normV = norm(v);
+
+    if (normV === 0) {
+      throw new RangeError('Rotation around zero vector');
+    }
+
+    var Big = isBigNumber(theta) ? BigNumber : null;
+    var one = Big ? new Big(1) : 1;
+    var minusOne = Big ? new Big(-1) : -1;
+    var vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV;
+    var vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV;
+    var vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV;
+    var c = cos(theta);
+    var oneMinusC = addScalar(one, unaryMinus(c));
+    var s = sin(theta);
+    var r11 = addScalar(c, _mul([vx, vx, oneMinusC]));
+    var r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]));
+    var r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]));
+    var r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]));
+    var r22 = addScalar(c, _mul([vy, vy, oneMinusC]));
+    var r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]));
+    var r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]));
+    var r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]));
+    var r33 = addScalar(c, _mul([vz, vz, oneMinusC]));
+    var data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]];
+    return _convertToFormat(data, format);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/row.js b/node_modules/mathjs/lib/esm/function/matrix/row.js
new file mode 100644
index 0000000..1c11957
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/row.js
@@ -0,0 +1,59 @@
+import { factory } from '../../utils/factory.js';
+import { clone } from '../../utils/object.js';
+import { validateIndex } from '../../utils/array.js';
+var name = 'row';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+export var createRow = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+
+  /**
+   * Return a row from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.row(value, index)
+   *
+   * Example:
+   *
+   *     // get a row
+   *     const d = [[1, 2], [3, 4]]
+   *     math.row(d, 1) // returns [[3, 4]]
+   *
+   * See also:
+   *
+   *     column
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} row              The index of the row
+   * @return {Array | Matrix}         The retrieved row
+   */
+  return typed(name, {
+    'Matrix, number': _row,
+    'Array, number': function ArrayNumber(value, row) {
+      return _row(matrix(clone(value)), row).valueOf();
+    }
+  });
+  /**
+   * Retrieve a row of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} row     The index of the row
+   * @return {Matrix}        The retrieved row
+   */
+
+  function _row(value, row) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+
+    validateIndex(row, value.size()[0]);
+    var columnRange = range(0, value.size()[1]);
+    var index = new Index(row, columnRange);
+    return value.subset(index);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/size.js b/node_modules/mathjs/lib/esm/function/matrix/size.js
new file mode 100644
index 0000000..9103126
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/size.js
@@ -0,0 +1,49 @@
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { noMatrix } from '../../utils/noop.js';
+var name = 'size';
+var dependencies = ['typed', 'config', '?matrix'];
+export var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix
+  } = _ref;
+
+  /**
+   * Calculate the size of a matrix or scalar.
+   *
+   * Syntax:
+   *
+   *     math.size(x)
+   *
+   * Examples:
+   *
+   *     math.size(2.3)                  // returns []
+   *     math.size('hello world')        // returns [11]
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.size(A)                    // returns [2, 3]
+   *     math.size(math.range(1,6))      // returns [5]
+   *
+   * See also:
+   *
+   *     count, resize, squeeze, subset
+   *
+   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix
+   * @return {Array | Matrix} A vector with size of `x`.
+   */
+  return typed(name, {
+    Matrix: function Matrix(x) {
+      return x.create(x.size());
+    },
+    Array: arraySize,
+    string: function string(x) {
+      return config.matrix === 'Array' ? [x.length] : matrix([x.length]);
+    },
+    'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {
+      // scalar
+      return config.matrix === 'Array' ? [] : matrix ? matrix([]) : noMatrix();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/sort.js b/node_modules/mathjs/lib/esm/function/matrix/sort.js
new file mode 100644
index 0000000..bbd1580
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/sort.js
@@ -0,0 +1,123 @@
+import { arraySize as size } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'sort';
+var dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];
+export var createSort = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    compare,
+    compareNatural
+  } = _ref;
+  var compareAsc = compare;
+
+  var compareDesc = (a, b) => -compare(a, b);
+  /**
+   * Sort the items in a matrix.
+   *
+   * Syntax:
+   *
+   *    math.sort(x)
+   *    math.sort(x, compare)
+   *
+   * Examples:
+   *
+   *    math.sort([5, 10, 1]) // returns [1, 5, 10]
+   *    math.sort(['C', 'B', 'A', 'D'], math.compareNatural)
+   *    // returns ['A', 'B', 'C', 'D']
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)
+   *    // returns ['Tom', 'Sara', 'Langdon']
+   *
+   * See also:
+   *
+   *    filter, forEach, map, compare, compareNatural
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']
+   *        An optional _comparator function or name. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {Matrix | Array} Returns the sorted matrix.
+   */
+
+
+  return typed(name, {
+    Array: function Array(x) {
+      _arrayIsVector(x);
+
+      return x.sort(compareAsc);
+    },
+    Matrix: function Matrix(x) {
+      _matrixIsVector(x);
+
+      return matrix(x.toArray().sort(compareAsc), x.storage());
+    },
+    'Array, function': function ArrayFunction(x, _comparator) {
+      _arrayIsVector(x);
+
+      return x.sort(_comparator);
+    },
+    'Matrix, function': function MatrixFunction(x, _comparator) {
+      _matrixIsVector(x);
+
+      return matrix(x.toArray().sort(_comparator), x.storage());
+    },
+    'Array, string': function ArrayString(x, order) {
+      _arrayIsVector(x);
+
+      return x.sort(_comparator(order));
+    },
+    'Matrix, string': function MatrixString(x, order) {
+      _matrixIsVector(x);
+
+      return matrix(x.toArray().sort(_comparator(order)), x.storage());
+    }
+  });
+  /**
+   * Get the comparator for given order ('asc', 'desc', 'natural')
+   * @param {'asc' | 'desc' | 'natural'} order
+   * @return {Function} Returns a _comparator function
+   */
+
+  function _comparator(order) {
+    if (order === 'asc') {
+      return compareAsc;
+    } else if (order === 'desc') {
+      return compareDesc;
+    } else if (order === 'natural') {
+      return compareNatural;
+    } else {
+      throw new Error('String "asc", "desc", or "natural" expected');
+    }
+  }
+  /**
+   * Validate whether an array is one dimensional
+   * Throws an error when this is not the case
+   * @param {Array} array
+   * @private
+   */
+
+
+  function _arrayIsVector(array) {
+    if (size(array).length !== 1) {
+      throw new Error('One dimensional array expected');
+    }
+  }
+  /**
+   * Validate whether a matrix is one dimensional
+   * Throws an error when this is not the case
+   * @param {Matrix} matrix
+   * @private
+   */
+
+
+  function _matrixIsVector(matrix) {
+    if (matrix.size().length !== 1) {
+      throw new Error('One dimensional matrix expected');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/sqrtm.js b/node_modules/mathjs/lib/esm/function/matrix/sqrtm.js
new file mode 100644
index 0000000..96138bc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/sqrtm.js
@@ -0,0 +1,106 @@
+import { isMatrix } from '../../utils/is.js';
+import { format } from '../../utils/string.js';
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'sqrtm';
+var dependencies = ['typed', 'abs', 'add', 'multiply', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];
+export var createSqrtm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    multiply,
+    sqrt,
+    subtract,
+    inv,
+    size,
+    max,
+    identity
+  } = _ref;
+  var _maxIterations = 1e3;
+  var _tolerance = 1e-6;
+  /**
+   * Calculate the principal square root matrix using the Denman–Beavers iterative method
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   * @private
+   */
+
+  function _denmanBeavers(A) {
+    var error;
+    var iterations = 0;
+    var Y = A;
+    var Z = identity(size(A));
+
+    do {
+      var Yk = Y;
+      Y = multiply(0.5, add(Yk, inv(Z)));
+      Z = multiply(0.5, add(Z, inv(Yk)));
+      error = max(abs(subtract(Y, Yk)));
+
+      if (error > _tolerance && ++iterations > _maxIterations) {
+        throw new Error('computing square root of matrix: iterative method could not converge');
+      }
+    } while (error > _tolerance);
+
+    return Y;
+  }
+  /**
+   * Calculate the principal square root of a square matrix.
+   * The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix
+   *
+   * Syntax:
+   *
+   *     X = math.sqrtm(A)
+   *
+   * Examples:
+   *
+   *     math.sqrtm([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   */
+
+
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(A) {
+      var size = isMatrix(A) ? A.size() : arraySize(A);
+
+      switch (size.length) {
+        case 1:
+          // Single element Array | Matrix
+          if (size[0] === 1) {
+            return sqrt(A);
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+          }
+
+        case 2:
+          {
+            // Two-dimensional Array | Matrix
+            var rows = size[0];
+            var cols = size[1];
+
+            if (rows === cols) {
+              return _denmanBeavers(A);
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+            }
+          }
+
+        default:
+          // Multi dimensional array
+          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + format(size) + ')');
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/squeeze.js b/node_modules/mathjs/lib/esm/function/matrix/squeeze.js
new file mode 100644
index 0000000..d3c063b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/squeeze.js
@@ -0,0 +1,55 @@
+import { clone } from '../../utils/object.js';
+import { squeeze as arraySqueeze } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'squeeze';
+var dependencies = ['typed', 'matrix'];
+export var createSqueeze = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+
+  /**
+   * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.
+   *
+   * Syntax:
+   *
+   *     math.squeeze(x)
+   *
+   * Examples:
+   *
+   *     math.squeeze([3])           // returns 3
+   *     math.squeeze([[3]])         // returns 3
+   *
+   *     const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)
+   *     math.squeeze(A)             // returns [0, 0, 0] (size 3)
+   *
+   *     const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)
+   *     math.squeeze(B)             // returns [0, 0, 0] (size 3)
+   *
+   *     // only inner and outer dimensions are removed
+   *     const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *     math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *
+   * See also:
+   *
+   *     subset
+   *
+   * @param {Matrix | Array} x      Matrix to be squeezed
+   * @return {Matrix | Array} Squeezed matrix
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return arraySqueeze(clone(x));
+    },
+    Matrix: function Matrix(x) {
+      var res = arraySqueeze(x.toArray()); // FIXME: return the same type of matrix as the input
+
+      return Array.isArray(res) ? matrix(res) : res;
+    },
+    any: function any(x) {
+      // scalar
+      return clone(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/subset.js b/node_modules/mathjs/lib/esm/function/matrix/subset.js
new file mode 100644
index 0000000..12a8926
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/subset.js
@@ -0,0 +1,228 @@
+import { isIndex } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { validateIndex } from '../../utils/array.js';
+import { getSafeProperty, setSafeProperty } from '../../utils/customs.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { factory } from '../../utils/factory.js';
+var name = 'subset';
+var dependencies = ['typed', 'matrix'];
+export var createSubset = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+
+  /**
+   * Get or set a subset of a matrix or string.
+   *
+   * Syntax:
+   *     math.subset(value, index)                                // retrieve a subset
+   *     math.subset(value, index, replacement [, defaultValue])  // replace a subset
+   *
+   * Examples:
+   *
+   *     // get a subset
+   *     const d = [[1, 2], [3, 4]]
+   *     math.subset(d, math.index(1, 0))        // returns 3
+   *     math.subset(d, math.index([0, 1], 1))   // returns [[2], [4]]
+   *
+   *     // replace a subset
+   *     const e = []
+   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 6]] and e = [[5, 0, 6]]
+   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 6], [0, 7]]
+   *
+   *     // get submatrix using ranges
+   *     const M = [
+   *       [1,2,3],
+   *       [4,5,6],
+   *       [7,8,9]
+   *     ]
+   *     math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1,2,3],[4,5,6]]
+   *
+   * See also:
+   *
+   *     size, resize, squeeze, index
+   *
+   * @param {Array | Matrix | string} matrix  An array, matrix, or string
+   * @param {Index} index
+   *    For each dimension of the target, specifies an index or a list of
+   *    indices to fetch or set. `subset` uses the cartesian product of
+   *    the indices specified in each dimension.
+   * @param {*} [replacement]                 An array, matrix, or scalar.
+   *                                          If provided, the subset is replaced with replacement.
+   *                                          If not provided, the subset is returned
+   * @param {*} [defaultValue=undefined]      Default value, filled in on new entries when
+   *                                          the matrix is resized. If not provided,
+   *                                          math.matrix elements will be left undefined.
+   * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.
+   */
+  return typed(name, {
+    // get subset
+    'Array, Index': function ArrayIndex(value, index) {
+      var m = matrix(value);
+      var subset = m.subset(index); // returns a Matrix
+
+      return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)
+    },
+    'Matrix, Index': function MatrixIndex(value, index) {
+      return value.subset(index);
+    },
+    'Object, Index': _getObjectProperty,
+    'string, Index': _getSubstring,
+    // set subset
+    'Array, Index, any': function ArrayIndexAny(value, index, replacement) {
+      return matrix(clone(value)).subset(index, replacement, undefined).valueOf();
+    },
+    'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {
+      return matrix(clone(value)).subset(index, replacement, defaultValue).valueOf();
+    },
+    'Matrix, Index, any': function MatrixIndexAny(value, index, replacement) {
+      return value.clone().subset(index, replacement);
+    },
+    'Matrix, Index, any, any': function MatrixIndexAnyAny(value, index, replacement, defaultValue) {
+      return value.clone().subset(index, replacement, defaultValue);
+    },
+    'string, Index, string': _setSubstring,
+    'string, Index, string, string': _setSubstring,
+    'Object, Index, any': _setObjectProperty
+  });
+});
+/**
+ * Retrieve a subset of a string
+ * @param {string} str            string from which to get a substring
+ * @param {Index} index           An index or list of indices (character positions)
+ * @returns {string} substring
+ * @private
+ */
+
+function _getSubstring(str, index) {
+  if (!isIndex(index)) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size().length, 1);
+  } // validate whether the range is out of range
+
+
+  var strLen = str.length;
+  validateIndex(index.min()[0], strLen);
+  validateIndex(index.max()[0], strLen);
+  var range = index.dimension(0);
+  var substr = '';
+  range.forEach(function (v) {
+    substr += str.charAt(v);
+  });
+  return substr;
+}
+/**
+ * Replace a substring in a string
+ * @param {string} str            string to be replaced
+ * @param {Index} index           An index or list of indices (character positions)
+ * @param {string} replacement    Replacement string
+ * @param {string} [defaultValue] Default value to be uses when resizing
+ *                                the string. is ' ' by default
+ * @returns {string} result
+ * @private
+ */
+
+
+function _setSubstring(str, index, replacement, defaultValue) {
+  if (!index || index.isIndex !== true) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size().length, 1);
+  }
+
+  if (defaultValue !== undefined) {
+    if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {
+      throw new TypeError('Single character expected as defaultValue');
+    }
+  } else {
+    defaultValue = ' ';
+  }
+
+  var range = index.dimension(0);
+  var len = range.size()[0];
+
+  if (len !== replacement.length) {
+    throw new DimensionError(range.size()[0], replacement.length);
+  } // validate whether the range is out of range
+
+
+  var strLen = str.length;
+  validateIndex(index.min()[0]);
+  validateIndex(index.max()[0]); // copy the string into an array with characters
+
+  var chars = [];
+
+  for (var i = 0; i < strLen; i++) {
+    chars[i] = str.charAt(i);
+  }
+
+  range.forEach(function (v, i) {
+    chars[v] = replacement.charAt(i[0]);
+  }); // initialize undefined characters with a space
+
+  if (chars.length > strLen) {
+    for (var _i = strLen - 1, _len = chars.length; _i < _len; _i++) {
+      if (!chars[_i]) {
+        chars[_i] = defaultValue;
+      }
+    }
+  }
+
+  return chars.join('');
+}
+/**
+ * Retrieve a property from an object
+ * @param {Object} object
+ * @param {Index} index
+ * @return {*} Returns the value of the property
+ * @private
+ */
+
+
+function _getObjectProperty(object, index) {
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size(), 1);
+  }
+
+  var key = index.dimension(0);
+
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  }
+
+  return getSafeProperty(object, key);
+}
+/**
+ * Set a property on an object
+ * @param {Object} object
+ * @param {Index} index
+ * @param {*} replacement
+ * @return {*} Returns the updated object
+ * @private
+ */
+
+
+function _setObjectProperty(object, index, replacement) {
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size(), 1);
+  }
+
+  var key = index.dimension(0);
+
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  } // clone the object, and apply the property to the clone
+
+
+  var updated = clone(object);
+  setSafeProperty(updated, key, replacement);
+  return updated;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/trace.js b/node_modules/mathjs/lib/esm/function/matrix/trace.js
new file mode 100644
index 0000000..4ebb07a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/trace.js
@@ -0,0 +1,138 @@
+import { clone } from '../../utils/object.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'trace';
+var dependencies = ['typed', 'matrix', 'add'];
+export var createTrace = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    add
+  } = _ref;
+
+  /**
+   * Calculate the trace of a matrix: the sum of the elements on the main
+   * diagonal of a square matrix.
+   *
+   * Syntax:
+   *
+   *    math.trace(x)
+   *
+   * Examples:
+   *
+   *    math.trace([[1, 2], [3, 4]]) // returns 5
+   *
+   *    const A = [
+   *      [1, 2, 3],
+   *      [-1, 2, 3],
+   *      [2, 0, 3]
+   *    ]
+   *    math.trace(A) // returns 6
+   *
+   * See also:
+   *
+   *    diag
+   *
+   * @param {Array | Matrix} x  A matrix
+   *
+   * @return {number} The trace of `x`
+   */
+  return typed('trace', {
+    Array: function _arrayTrace(x) {
+      // use dense matrix implementation
+      return _denseTrace(matrix(x));
+    },
+    SparseMatrix: _sparseTrace,
+    DenseMatrix: _denseTrace,
+    any: clone
+  });
+
+  function _denseTrace(m) {
+    // matrix size & data
+    var size = m._size;
+    var data = m._data; // process dimensions
+
+    switch (size.length) {
+      case 1:
+        // vector
+        if (size[0] === 1) {
+          // return data[0]
+          return clone(data[0]);
+        }
+
+        throw new RangeError('Matrix must be square (size: ' + format(size) + ')');
+
+      case 2:
+        {
+          // two dimensional
+          var rows = size[0];
+          var cols = size[1];
+
+          if (rows === cols) {
+            // calulate sum
+            var sum = 0; // loop diagonal
+
+            for (var i = 0; i < rows; i++) {
+              sum = add(sum, data[i][i]);
+            } // return trace
+
+
+            return sum;
+          } else {
+            throw new RangeError('Matrix must be square (size: ' + format(size) + ')');
+          }
+        }
+
+      default:
+        // multi dimensional
+        throw new RangeError('Matrix must be two dimensional (size: ' + format(size) + ')');
+    }
+  }
+
+  function _sparseTrace(m) {
+    // matrix arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+    var size = m._size; // check dimensions
+
+    var rows = size[0];
+    var columns = size[1]; // matrix must be square
+
+    if (rows === columns) {
+      // calulate sum
+      var sum = 0; // check we have data (avoid looping columns)
+
+      if (values.length > 0) {
+        // loop columns
+        for (var j = 0; j < columns; j++) {
+          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+          var k0 = ptr[j];
+          var k1 = ptr[j + 1]; // loop k within [k0, k1[
+
+          for (var k = k0; k < k1; k++) {
+            // row index
+            var i = index[k]; // check row
+
+            if (i === j) {
+              // accumulate value
+              sum = add(sum, values[k]); // exit loop
+
+              break;
+            }
+
+            if (i > j) {
+              // exit loop, no value on the diagonal for column j
+              break;
+            }
+          }
+        }
+      } // return trace
+
+
+      return sum;
+    }
+
+    throw new RangeError('Matrix must be square (size: ' + format(size) + ')');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/transpose.js b/node_modules/mathjs/lib/esm/function/matrix/transpose.js
new file mode 100644
index 0000000..c4dc1bc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/transpose.js
@@ -0,0 +1,175 @@
+import { clone } from '../../utils/object.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'transpose';
+var dependencies = ['typed', 'matrix'];
+export var createTranspose = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+
+  /**
+   * Transpose a matrix. All values of the matrix are reflected over its
+   * main diagonal. Only applicable to two dimensional matrices containing
+   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional
+   * vectors and scalars return the input unchanged.
+   *
+   * Syntax:
+   *
+   *     math.transpose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]
+   *
+   * See also:
+   *
+   *     diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be transposed
+   * @return {Array | Matrix}   The transposed matrix
+   */
+  return typed('transpose', {
+    Array: function Array(x) {
+      // use dense matrix implementation
+      return this(matrix(x)).valueOf();
+    },
+    Matrix: function Matrix(x) {
+      // matrix size
+      var size = x.size(); // result
+
+      var c; // process dimensions
+
+      switch (size.length) {
+        case 1:
+          // vector
+          c = x.clone();
+          break;
+
+        case 2:
+          {
+            // rows and columns
+            var rows = size[0];
+            var columns = size[1]; // check columns
+
+            if (columns === 0) {
+              // throw exception
+              throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')');
+            } // process storage format
+
+
+            switch (x.storage()) {
+              case 'dense':
+                c = _denseTranspose(x, rows, columns);
+                break;
+
+              case 'sparse':
+                c = _sparseTranspose(x, rows, columns);
+                break;
+            }
+          }
+          break;
+
+        default:
+          // multi dimensional
+          throw new RangeError('Matrix must be a vector or two dimensional (size: ' + format(this._size) + ')');
+      }
+
+      return c;
+    },
+    // scalars
+    any: function any(x) {
+      return clone(x);
+    }
+  });
+
+  function _denseTranspose(m, rows, columns) {
+    // matrix array
+    var data = m._data; // transposed matrix data
+
+    var transposed = [];
+    var transposedRow; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // initialize row
+      transposedRow = transposed[j] = []; // loop rows
+
+      for (var i = 0; i < rows; i++) {
+        // set data
+        transposedRow[i] = clone(data[i][j]);
+      }
+    } // return matrix
+
+
+    return m.createDenseMatrix({
+      data: transposed,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+
+  function _sparseTranspose(m, rows, columns) {
+    // matrix arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // result matrices
+
+    var cvalues = values ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // row counts
+
+    var w = [];
+
+    for (var x = 0; x < rows; x++) {
+      w[x] = 0;
+    } // vars
+
+
+    var p, l, j; // loop values in matrix
+
+    for (p = 0, l = index.length; p < l; p++) {
+      // number of values in row
+      w[index[p]]++;
+    } // cumulative sum
+
+
+    var sum = 0; // initialize cptr with the cummulative sum of row counts
+
+    for (var i = 0; i < rows; i++) {
+      // update cptr
+      cptr.push(sum); // update sum
+
+      sum += w[i]; // update w
+
+      w[i] = cptr[i];
+    } // update cptr
+
+
+    cptr.push(sum); // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // values & index in column
+      for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {
+        // C values & index
+        var q = w[index[k]]++; // C[j, i] = A[i, j]
+
+        cindex[q] = j; // check we need to process values (pattern matrix)
+
+        if (values) {
+          cvalues[q] = clone(values[k]);
+        }
+      }
+    } // return matrix
+
+
+    return m.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/zeros.js b/node_modules/mathjs/lib/esm/function/matrix/zeros.js
new file mode 100644
index 0000000..221f841
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/zeros.js
@@ -0,0 +1,129 @@
+import { isBigNumber } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { resize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'zeros';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+export var createZeros = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+
+  /**
+   * Create a matrix filled with zeros. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.zeros(m)
+   *    math.zeros(m, format)
+   *    math.zeros(m, n)
+   *    math.zeros(m, n, format)
+   *    math.zeros([m, n])
+   *    math.zeros([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.zeros(3)                  // returns [0, 0, 0]
+   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]
+   *    math.zeros(3, 'dense')         // returns [0, 0, 0]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]
+   *
+   * See also:
+   *
+   *    ones, identity, size, range
+   *
+   * @param {...number | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix}           A matrix filled with zeros
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');
+    },
+    // math.zeros(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function numberBigNumberString(size) {
+      var last = size[size.length - 1];
+
+      if (typeof last === 'string') {
+        var format = size.pop();
+        return _zeros(size, format);
+      } else if (config.matrix === 'Array') {
+        return _zeros(size);
+      } else {
+        return _zeros(size, 'default');
+      }
+    },
+    Array: _zeros,
+    Matrix: function Matrix(size) {
+      var format = size.storage();
+      return _zeros(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function ArrayMatrixString(size, format) {
+      return _zeros(size.valueOf(), format);
+    }
+  });
+  /**
+   * Create an Array or Matrix with zeros
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+
+  function _zeros(size, format) {
+    var hasBigNumbers = _normalize(size);
+
+    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;
+
+    _validate(size);
+
+    if (format) {
+      // return a matrix
+      var m = matrix(format);
+
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+
+      return m;
+    } else {
+      // return an Array
+      var arr = [];
+
+      if (size.length > 0) {
+        return resize(arr, size, defaultValue);
+      }
+
+      return arr;
+    }
+  } // replace BigNumbers with numbers, returns true if size contained BigNumbers
+
+
+  function _normalize(size) {
+    var hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if (isBigNumber(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  } // validate arguments
+
+
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !isInteger(value) || value < 0) {
+        throw new Error('Parameters in function zeros must be positive integers');
+      }
+    });
+  }
+}); // TODO: zeros contains almost the same code as ones. Reuse this?
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/combinations.js b/node_modules/mathjs/lib/esm/function/probability/combinations.js
new file mode 100644
index 0000000..f99cb55
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/combinations.js
@@ -0,0 +1,74 @@
+import { factory } from '../../utils/factory.js';
+import { combinationsNumber } from '../../plain/number/combinations.js';
+var name = 'combinations';
+var dependencies = ['typed'];
+export var createCombinations = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities.
+   *
+   * Combinations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.combinations(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinations(7, 5) // returns 21
+   *
+   * See also:
+   *
+   *    combinationsWithRep, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations.
+   */
+  return typed(name, {
+    'number, number': combinationsNumber,
+    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
+      var BigNumber = n.constructor;
+      var result, i;
+      var nMinusk = n.minus(k);
+      var one = new BigNumber(1);
+
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinations');
+      }
+
+      if (k.gt(n)) {
+        throw new TypeError('k must be less than n in function combinations');
+      }
+
+      result = one;
+
+      if (k.lt(nMinusk)) {
+        for (i = one; i.lte(nMinusk); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusk.plus(i)).dividedBy(i);
+        }
+      }
+
+      return result;
+    } // TODO: implement support for collection in combinations
+
+  });
+});
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..bdf82e7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js
@@ -0,0 +1,95 @@
+import { factory } from '../../utils/factory.js';
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+var name = 'combinationsWithRep';
+var dependencies = ['typed'];
+export var createCombinationsWithRep = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities, allowing individual outcomes to be repeated more than once.
+   *
+   * CombinationsWithRep only takes integer arguments.
+   * The following condition must be enforced: k <= n + k -1.
+   *
+   * Syntax:
+   *
+   *     math.combinationsWithRep(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinationsWithRep(7, 5) // returns 462
+   *
+   * See also:
+   *
+   *    combinations, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations with replacement.
+   */
+  return typed(name, {
+    'number, number': function numberNumber(n, k) {
+      if (!isInteger(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+
+      if (!isInteger(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+
+      if (n < 1) {
+        throw new TypeError('k must be less than or equal to n + k - 1');
+      }
+
+      if (k < n - 1) {
+        var _prodrange = product(n, n + k - 1);
+
+        return _prodrange / product(1, k);
+      }
+
+      var prodrange = product(k + 1, n + k - 1);
+      return prodrange / product(1, n - 1);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
+      var BigNumber = n.constructor;
+      var result, i;
+      var one = new BigNumber(1);
+      var nMinusOne = n.minus(one);
+
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+
+      if (n.lt(one)) {
+        throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep');
+      }
+
+      result = one;
+
+      if (k.lt(nMinusOne)) {
+        for (i = one; i.lte(nMinusOne); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusOne.plus(i)).dividedBy(i);
+        }
+      }
+
+      return result;
+    }
+  });
+});
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/factorial.js b/node_modules/mathjs/lib/esm/function/probability/factorial.js
new file mode 100644
index 0000000..8e943fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/factorial.js
@@ -0,0 +1,52 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'factorial';
+var dependencies = ['typed', 'gamma'];
+export var createFactorial = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    gamma
+  } = _ref;
+
+  /**
+   * Compute the factorial of a value
+   *
+   * Factorial only supports an integer value as argument.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.factorial(n)
+   *
+   * Examples:
+   *
+   *    math.factorial(5)    // returns 120
+   *    math.factorial(3)    // returns 6
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, gamma, permutations
+   *
+   * @param {number | BigNumber | Array | Matrix} n   An integer number
+   * @return {number | BigNumber | Array | Matrix}    The factorial of `n`
+   */
+  return typed(name, {
+    number: function number(n) {
+      if (n < 0) {
+        throw new Error('Value must be non-negative');
+      }
+
+      return gamma(n + 1);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.isNegative()) {
+        throw new Error('Value must be non-negative');
+      }
+
+      return gamma(n.plus(1));
+    },
+    'Array | Matrix': function ArrayMatrix(n) {
+      return deepMap(n, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/gamma.js b/node_modules/mathjs/lib/esm/function/probability/gamma.js
new file mode 100644
index 0000000..cb5b3fd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/gamma.js
@@ -0,0 +1,129 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js';
+var name = 'gamma';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];
+export var createGamma = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    multiplyScalar,
+    pow,
+    BigNumber: _BigNumber,
+    Complex: _Complex
+  } = _ref;
+
+  /**
+   * Compute the gamma function of a value using Lanczos approximation for
+   * small values, and an extended Stirling approximation for large values.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.gamma(n)
+   *
+   * Examples:
+   *
+   *    math.gamma(5)       // returns 24
+   *    math.gamma(-0.5)    // returns -3.5449077018110335
+   *    math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i
+   *
+   * See also:
+   *
+   *    combinations, factorial, permutations
+   *
+   * @param {number | Array | Matrix} n   A real or complex number
+   * @return {number | Array | Matrix}    The gamma of `n`
+   */
+  return typed(name, {
+    number: gammaNumber,
+    Complex: function Complex(n) {
+      if (n.im === 0) {
+        return this(n.re);
+      } // Lanczos approximation doesn't work well with real part lower than 0.5
+      // So reflection formula is required
+
+
+      if (n.re < 0.5) {
+        // Euler's reflection formula
+        // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+        // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+        // thanks to imperfect sin implementation sin(PI * n) != 0
+        // we can safely use it anyway
+        var _t = new _Complex(1 - n.re, -n.im);
+
+        var r = new _Complex(Math.PI * n.re, Math.PI * n.im);
+        return new _Complex(Math.PI).div(r.sin()).div(this(_t));
+      } // Lanczos approximation
+      // z -= 1
+
+
+      n = new _Complex(n.re - 1, n.im); // x = gammaPval[0]
+
+      var x = new _Complex(gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
+
+      for (var i = 1; i < gammaP.length; ++i) {
+        // x += gammaPval / (z + i)
+        var gammaPval = new _Complex(gammaP[i], 0);
+        x = x.add(gammaPval.div(n.add(i)));
+      } // t = z + gammaG + 0.5
+
+
+      var t = new _Complex(n.re + gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
+
+      var twoPiSqrt = Math.sqrt(2 * Math.PI);
+      var tpow = t.pow(n.add(0.5));
+      var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
+
+      return x.mul(twoPiSqrt).mul(tpow).mul(expt);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.isInteger()) {
+        return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : bigFactorial(n.minus(1));
+      }
+
+      if (!n.isFinite()) {
+        return new _BigNumber(n.isNegative() ? NaN : Infinity);
+      }
+
+      throw new Error('Integer BigNumber expected');
+    },
+    'Array | Matrix': function ArrayMatrix(n) {
+      return deepMap(n, this);
+    }
+  });
+  /**
+   * Calculate factorial for a BigNumber
+   * @param {BigNumber} n
+   * @returns {BigNumber} Returns the factorial of n
+   */
+
+  function bigFactorial(n) {
+    if (n < 8) {
+      return new _BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n]);
+    }
+
+    var precision = config.precision + (Math.log(n.toNumber()) | 0);
+
+    var Big = _BigNumber.clone({
+      precision: precision
+    });
+
+    if (n % 2 === 1) {
+      return n.times(bigFactorial(new _BigNumber(n - 1)));
+    }
+
+    var p = n;
+    var prod = new Big(n);
+    var sum = n.toNumber();
+
+    while (p > 2) {
+      p -= 2;
+      sum += p;
+      prod = prod.times(sum);
+    }
+
+    return new _BigNumber(prod.toPrecision(_BigNumber.precision));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/kldivergence.js b/node_modules/mathjs/lib/esm/function/probability/kldivergence.js
new file mode 100644
index 0000000..91e4542
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/kldivergence.js
@@ -0,0 +1,86 @@
+import { factory } from '../../utils/factory.js';
+var name = 'kldivergence';
+var dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric'];
+export var createKldivergence = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divide,
+    sum,
+    multiply,
+    dotDivide,
+    log,
+    isNumeric
+  } = _ref;
+
+  /**
+     * Calculate the Kullback-Leibler (KL) divergence  between two distributions
+     *
+     * Syntax:
+     *
+     *     math.kldivergence(x, y)
+     *
+     * Examples:
+     *
+     *     math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153
+     *
+     *
+     * @param  {Array | Matrix} q    First vector
+     * @param  {Array | Matrix} p    Second vector
+     * @return {number}              Returns distance between q and p
+     */
+  return typed(name, {
+    'Array, Array': function ArrayArray(q, p) {
+      return _kldiv(matrix(q), matrix(p));
+    },
+    'Matrix, Array': function MatrixArray(q, p) {
+      return _kldiv(q, matrix(p));
+    },
+    'Array, Matrix': function ArrayMatrix(q, p) {
+      return _kldiv(matrix(q), p);
+    },
+    'Matrix, Matrix': function MatrixMatrix(q, p) {
+      return _kldiv(q, p);
+    }
+  });
+
+  function _kldiv(q, p) {
+    var plength = p.size().length;
+    var qlength = q.size().length;
+
+    if (plength > 1) {
+      throw new Error('first object must be one dimensional');
+    }
+
+    if (qlength > 1) {
+      throw new Error('second object must be one dimensional');
+    }
+
+    if (plength !== qlength) {
+      throw new Error('Length of two vectors must be equal');
+    } // Before calculation, apply normalization
+
+
+    var sumq = sum(q);
+
+    if (sumq === 0) {
+      throw new Error('Sum of elements in first object must be non zero');
+    }
+
+    var sump = sum(p);
+
+    if (sump === 0) {
+      throw new Error('Sum of elements in second object must be non zero');
+    }
+
+    var qnorm = divide(q, sum(q));
+    var pnorm = divide(p, sum(p));
+    var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));
+
+    if (isNumeric(result)) {
+      return result;
+    } else {
+      return Number.NaN;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/multinomial.js b/node_modules/mathjs/lib/esm/function/probability/multinomial.js
new file mode 100644
index 0000000..a7fb845
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/multinomial.js
@@ -0,0 +1,52 @@
+import { deepForEach } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'multinomial';
+var dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];
+export var createMultinomial = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide,
+    multiply,
+    factorial,
+    isInteger,
+    isPositive
+  } = _ref;
+
+  /**
+   * Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.
+   *
+   * multinomial takes one array of integers as an argument.
+   * The following condition must be enforced: every ai <= 0
+   *
+   * Syntax:
+   *
+   *     math.multinomial(a) // a is an array type
+   *
+   * Examples:
+   *
+   *    math.multinomial([1,2,1]) // returns 12
+   *
+   * See also:
+   *
+   *    combinations, factorial
+   *
+   * @param {number[] | BigNumber[]} a    Integer numbers of objects in the subset
+   * @return {Number | BigNumber}         Multinomial coefficient.
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      var sum = 0;
+      var denom = 1;
+      deepForEach(a, function (ai) {
+        if (!isInteger(ai) || !isPositive(ai)) {
+          throw new TypeError('Positive integer value expected in function multinomial');
+        }
+
+        sum = add(sum, ai);
+        denom = multiply(denom, factorial(ai));
+      });
+      return divide(factorial(sum), denom);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/permutations.js b/node_modules/mathjs/lib/esm/function/probability/permutations.js
new file mode 100644
index 0000000..caa2c2e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/permutations.js
@@ -0,0 +1,86 @@
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+import { factory } from '../../utils/factory.js';
+var name = 'permutations';
+var dependencies = ['typed', 'factorial'];
+export var createPermutations = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    factorial
+  } = _ref;
+
+  /**
+   * Compute the number of ways of obtaining an ordered subset of `k` elements
+   * from a set of `n` elements.
+   *
+   * Permutations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.permutations(n)
+   *     math.permutations(n, k)
+   *
+   * Examples:
+   *
+   *    math.permutations(5)     // 120
+   *    math.permutations(5, 3)  // 60
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, factorial
+   *
+   * @param {number | BigNumber} n   The number of objects in total
+   * @param {number | BigNumber} [k] The number of objects in the subset
+   * @return {number | BigNumber}    The number of permutations
+   */
+  return typed(name, {
+    'number | BigNumber': factorial,
+    'number, number': function numberNumber(n, k) {
+      if (!isInteger(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+
+      if (!isInteger(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+
+      if (k > n) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      } // Permute n objects, k at a time
+
+
+      return product(n - k + 1, n);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
+      var result, i;
+
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+
+      if (k.gt(n)) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      }
+
+      var one = n.mul(0).add(1);
+      result = one;
+
+      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {
+        result = result.times(i);
+      }
+
+      return result;
+    } // TODO: implement support for collection in permutations
+
+  });
+});
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/pickRandom.js b/node_modules/mathjs/lib/esm/function/probability/pickRandom.js
new file mode 100644
index 0000000..79e2172
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/pickRandom.js
@@ -0,0 +1,166 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { isMatrix, isNumber } from '../../utils/is.js';
+import { createRng } from './util/seededRNG.js';
+var name = 'pickRandom';
+var dependencies = ['typed', 'config', '?on'];
+export var createPickRandom = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  var rng = createRng(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+  /**
+   * Random pick one or more values from a one dimensional array.
+   * Array elements are picked using a random function with uniform or weighted distribution.
+   *
+   * Syntax:
+   *
+   *     math.pickRandom(array)
+   *     math.pickRandom(array, number)
+   *     math.pickRandom(array, weights)
+   *     math.pickRandom(array, number, weights)
+   *     math.pickRandom(array, weights, number)
+   *     math.pickRandom(array, { weights, number, elementWise })
+   *
+   * Examples:
+   *
+   *     math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], { number: 2 })   // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution
+   *
+   *     math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })
+   *         // returns one of the items in the array
+   *
+   * See also:
+   *
+   *     random, randomInt
+   *
+   * @param {Array | Matrix} array     A one dimensional array
+   * @param {Int} number               An int or float
+   * @param {Array | Matrix} weights   An array of ints or floats
+   * @return {number | Array}          Returns a single random value from array when number is 1 or undefined.
+   *                                   Returns an array with the configured number of elements when number is > 1.
+   */
+
+
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(possibles) {
+      return _pickRandom(possibles, {});
+    },
+    'Array | Matrix, Object': function ArrayMatrixObject(possibles, options) {
+      return _pickRandom(possibles, options);
+    },
+    'Array | Matrix, number': function ArrayMatrixNumber(possibles, number) {
+      return _pickRandom(possibles, {
+        number
+      });
+    },
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(possibles, weights) {
+      return _pickRandom(possibles, {
+        weights
+      });
+    },
+    'Array | Matrix, Array | Matrix, number': function ArrayMatrixArrayMatrixNumber(possibles, weights, number) {
+      return _pickRandom(possibles, {
+        number,
+        weights
+      });
+    },
+    'Array | Matrix, number, Array | Matrix': function ArrayMatrixNumberArrayMatrix(possibles, number, weights) {
+      return _pickRandom(possibles, {
+        number,
+        weights
+      });
+    }
+  });
+  /**
+   * @param {Array | Matrix} possibles
+   * @param {{
+   *   number?: number,
+   *   weights?: Array | Matrix,
+   *   elementWise: boolean
+   * }} options
+   * @returns {number | Array}
+   * @private
+   */
+
+  function _pickRandom(possibles, _ref2) {
+    var {
+      number,
+      weights,
+      elementWise = true
+    } = _ref2;
+    var single = typeof number === 'undefined';
+
+    if (single) {
+      number = 1;
+    }
+
+    var createMatrix = isMatrix(possibles) ? possibles.create : isMatrix(weights) ? weights.create : null;
+    possibles = possibles.valueOf(); // get Array
+
+    if (weights) {
+      weights = weights.valueOf(); // get Array
+    }
+
+    if (elementWise === true) {
+      possibles = flatten(possibles);
+      weights = flatten(weights);
+    }
+
+    var totalWeights = 0;
+
+    if (typeof weights !== 'undefined') {
+      if (weights.length !== possibles.length) {
+        throw new Error('Weights must have the same length as possibles');
+      }
+
+      for (var i = 0, len = weights.length; i < len; i++) {
+        if (!isNumber(weights[i]) || weights[i] < 0) {
+          throw new Error('Weights must be an array of positive numbers');
+        }
+
+        totalWeights += weights[i];
+      }
+    }
+
+    var length = possibles.length;
+    var result = [];
+    var pick;
+
+    while (result.length < number) {
+      if (typeof weights === 'undefined') {
+        pick = possibles[Math.floor(rng() * length)];
+      } else {
+        var randKey = rng() * totalWeights;
+
+        for (var _i = 0, _len = possibles.length; _i < _len; _i++) {
+          randKey -= weights[_i];
+
+          if (randKey < 0) {
+            pick = possibles[_i];
+            break;
+          }
+        }
+      }
+
+      result.push(pick);
+    }
+
+    return single ? result[0] : createMatrix ? createMatrix(result) : result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/random.js b/node_modules/mathjs/lib/esm/function/probability/random.js
new file mode 100644
index 0000000..32d10a3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/random.js
@@ -0,0 +1,102 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+import { createRng } from './util/seededRNG.js';
+import { randomMatrix } from './util/randomMatrix.js';
+var name = 'random';
+var dependencies = ['typed', 'config', '?on'];
+export var createRandom = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  var rng = createRng(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+  /**
+   * Return a random number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.random()                // generate a random number between 0 and 1
+   *     math.random(max)             // generate a random number between 0 and max
+   *     math.random(min, max)        // generate a random number between min and max
+   *     math.random(size)            // generate a matrix with random numbers between 0 and 1
+   *     math.random(size, max)       // generate a matrix with random numbers between 0 and max
+   *     math.random(size, min, max)  // generate a matrix with random numbers between min and max
+   *
+   * Examples:
+   *
+   *     math.random()       // returns a random number between 0 and 1
+   *     math.random(100)    // returns a random number between 0 and 100
+   *     math.random(30, 40) // returns a random number between 30 and 40
+   *     math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1
+   *
+   * See also:
+   *
+   *     randomInt, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random number
+   */
+
+
+  return typed(name, {
+    '': () => _random(0, 1),
+    number: max => _random(0, max),
+    'number, number': (min, max) => _random(min, max),
+    'Array | Matrix': size => _randomMatrix(size, 0, 1),
+    'Array | Matrix, number': (size, max) => _randomMatrix(size, 0, max),
+    'Array | Matrix, number, number': (size, min, max) => _randomMatrix(size, min, max)
+  });
+
+  function _randomMatrix(size, min, max) {
+    var res = randomMatrix(size.valueOf(), () => _random(min, max));
+    return isMatrix(size) ? size.create(res) : res;
+  }
+
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+}); // number only implementation of random, no matrix support
+// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?
+
+export var createRandomNumber = /* #__PURE__ */factory(name, ['typed', 'config', '?on'], _ref2 => {
+  var {
+    typed,
+    config,
+    on,
+    matrix
+  } = _ref2;
+  // seeded pseudo random number generator1
+  var rng = createRng(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+
+  return typed(name, {
+    '': () => _random(0, 1),
+    number: max => _random(0, max),
+    'number, number': (min, max) => _random(min, max)
+  });
+
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/randomInt.js b/node_modules/mathjs/lib/esm/function/probability/randomInt.js
new file mode 100644
index 0000000..5999f79
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/randomInt.js
@@ -0,0 +1,71 @@
+import { factory } from '../../utils/factory.js';
+import { randomMatrix } from './util/randomMatrix.js';
+import { createRng } from './util/seededRNG.js';
+import { isMatrix } from '../../utils/is.js';
+var name = 'randomInt';
+var dependencies = ['typed', 'config', '?on'];
+export var createRandomInt = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  var rng = createRng(config.randomSeed);
+
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+  /**
+   * Return a random integer number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.randomInt()                // generate a random integer between 0 and 1
+   *     math.randomInt(max)             // generate a random integer between 0 and max
+   *     math.randomInt(min, max)        // generate a random integer between min and max
+   *     math.randomInt(size)            // generate a matrix with random integer between 0 and 1
+   *     math.randomInt(size, max)       // generate a matrix with random integer between 0 and max
+   *     math.randomInt(size, min, max)  // generate a matrix with random integer between min and max
+   *
+   * Examples:
+   *
+   *     math.randomInt(100)    // returns a random integer between 0 and 100
+   *     math.randomInt(30, 40) // returns a random integer between 30 and 40
+   *     math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1
+   *
+   * See also:
+   *
+   *     random, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random integer value
+   */
+
+
+  return typed(name, {
+    '': () => _randomInt(0, 1),
+    number: max => _randomInt(0, max),
+    'number, number': (min, max) => _randomInt(min, max),
+    'Array | Matrix': size => _randomIntMatrix(size, 0, 1),
+    'Array | Matrix, number': (size, max) => _randomIntMatrix(size, 0, max),
+    'Array | Matrix, number, number': (size, min, max) => _randomIntMatrix(size, min, max)
+  });
+
+  function _randomIntMatrix(size, min, max) {
+    var res = randomMatrix(size.valueOf(), () => _randomInt(min, max));
+    return isMatrix(size) ? size.create(res) : res;
+  }
+
+  function _randomInt(min, max) {
+    return Math.floor(min + rng() * (max - min));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js b/node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js
new file mode 100644
index 0000000..c349dc4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js
@@ -0,0 +1,22 @@
+/**
+ * This is a util function for generating a random matrix recursively.
+ * @param {number[]} size
+ * @param {function} random
+ * @returns {Array}
+ */
+export function randomMatrix(size, random) {
+  var data = [];
+  size = size.slice(0);
+
+  if (size.length > 1) {
+    for (var i = 0, length = size.shift(); i < length; i++) {
+      data.push(randomMatrix(size, random));
+    }
+  } else {
+    for (var _i = 0, _length = size.shift(); _i < _length; _i++) {
+      data.push(random());
+    }
+  }
+
+  return data;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js b/node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js
new file mode 100644
index 0000000..3e340d4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js
@@ -0,0 +1,18 @@
+import seedrandom from 'seedrandom';
+var singletonRandom = /* #__PURE__ */seedrandom(Date.now());
+export function createRng(randomSeed) {
+  var random; // create a new random generator with given seed
+
+  function setSeed(seed) {
+    random = seed === null ? singletonRandom : seedrandom(String(seed));
+  } // initialize a seeded pseudo random number generator with config's random seed
+
+
+  setSeed(randomSeed); // wrapper function so the rng can be updated via generator
+
+  function rng() {
+    return random();
+  }
+
+  return rng;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/compare.js b/node_modules/mathjs/lib/esm/function/relational/compare.js
new file mode 100644
index 0000000..e10e841
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/compare.js
@@ -0,0 +1,155 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js';
+var name = 'compare';
+var dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix'];
+export var createCompare = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    equalScalar,
+    matrix,
+    BigNumber,
+    Fraction,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm05 = createAlgorithm05({
+    typed,
+    equalScalar
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * x and y are considered equal when the relative difference between x and y
+   * is smaller than the configured epsilon. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.compare(x, y)
+   *
+   * Examples:
+   *
+   *    math.compare(6, 1)           // returns 1
+   *    math.compare(2, 3)           // returns -1
+   *    math.compare(7, 7)           // returns 0
+   *    math.compare('10', '2')      // returns 1
+   *    math.compare('1000', '1e3')  // returns 0
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compare(a, b)           // returns 1
+   *
+   *    math.compare(2, [1, 2, 3])   // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText
+   *
+   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} y Second value to compare
+   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the result of the comparison:
+   *                                                          1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x === y ? 0 : x > y ? 1 : -1;
+    },
+    'number, number': function numberNumber(x, y) {
+      return nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return bigNearlyEqual(x, y, config.epsilon) ? new BigNumber(0) : new BigNumber(x.cmp(y));
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return new Fraction(x.compare(y));
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm05(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+export var createCompareNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/compareNatural.js b/node_modules/mathjs/lib/esm/function/relational/compareNatural.js
new file mode 100644
index 0000000..d912ef7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/compareNatural.js
@@ -0,0 +1,294 @@
+import naturalSort from 'javascript-natural-sort';
+import { isDenseMatrix, isSparseMatrix, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'compareNatural';
+var dependencies = ['typed', 'compare'];
+export var createCompareNatural = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    compare
+  } = _ref;
+  var compareBooleans = compare.signatures['boolean,boolean'];
+  /**
+   * Compare two values of any type in a deterministic, natural way.
+   *
+   * For numeric values, the function works the same as `math.compare`.
+   * For types of values that can't be compared mathematically,
+   * the function compares in a natural way.
+   *
+   * For numeric values, x and y are considered equal when the relative
+   * difference between x and y is smaller than the configured epsilon.
+   * The function cannot be used to compare values smaller than
+   * approximately 2.22e-16.
+   *
+   * For Complex numbers, first the real parts are compared. If equal,
+   * the imaginary parts are compared.
+   *
+   * Strings are compared with a natural sorting algorithm, which
+   * orders strings in a "logic" way following some heuristics.
+   * This differs from the function `compare`, which converts the string
+   * into a numeric value and compares that. The function `compareText`
+   * on the other hand compares text lexically.
+   *
+   * Arrays and Matrices are compared value by value until there is an
+   * unequal pair of values encountered. Objects are compared by sorted
+   * keys until the keys or their values are unequal.
+   *
+   * Syntax:
+   *
+   *    math.compareNatural(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareNatural(6, 1)              // returns 1
+   *    math.compareNatural(2, 3)              // returns -1
+   *    math.compareNatural(7, 7)              // returns 0
+   *
+   *    math.compareNatural('10', '2')         // returns 1
+   *    math.compareText('10', '2')            // returns -1
+   *    math.compare('10', '2')                // returns 1
+   *
+   *    math.compareNatural('Answer: 10', 'Answer: 2') // returns 1
+   *    math.compareText('Answer: 10', 'Answer: 2')    // returns -1
+   *    math.compare('Answer: 10', 'Answer: 2')
+   *        // Error: Cannot convert "Answer: 10" to a number
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compareNatural(a, b)              // returns 1
+   *
+   *    const c = math.complex('2 + 3i')
+   *    const d = math.complex('2 + 4i')
+   *    math.compareNatural(c, d)              // returns -1
+   *
+   *    math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1
+   *    math.compareNatural([1, 2, 3], [1, 2])    // returns 1
+   *    math.compareNatural([1, 5], [1, 2, 3])    // returns 1
+   *    math.compareNatural([1, 2], [1, 2])       // returns 0
+   *
+   *    math.compareNatural({a: 2}, {a: 4})       // returns -1
+   *
+   * See also:
+   *
+   *    compare, compareText
+   *
+   * @param  {*} x First value to compare
+   * @param  {*} y Second value to compare
+   * @return {number} Returns the result of the comparison:
+   *                  1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      var typeX = typeOf(x);
+      var typeY = typeOf(y);
+      var c; // numeric types
+
+      if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {
+        c = compare(x, y);
+
+        if (c.toString() !== '0') {
+          // c can be number, BigNumber, or Fraction
+          return c > 0 ? 1 : -1; // return a number
+        } else {
+          return naturalSort(typeX, typeY);
+        }
+      } // matrix types
+
+
+      if (typeX === 'Array' || typeX === 'Matrix' || typeY === 'Array' || typeY === 'Matrix') {
+        c = compareMatricesAndArrays(this, x, y);
+
+        if (c !== 0) {
+          return c;
+        } else {
+          return naturalSort(typeX, typeY);
+        }
+      } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
+
+
+      if (typeX !== typeY) {
+        return naturalSort(typeX, typeY);
+      }
+
+      if (typeX === 'Complex') {
+        return compareComplexNumbers(x, y);
+      }
+
+      if (typeX === 'Unit') {
+        if (x.equalBase(y)) {
+          return this(x.value, y.value);
+        } // compare by units
+
+
+        return compareArrays(this, x.formatUnits(), y.formatUnits());
+      }
+
+      if (typeX === 'boolean') {
+        return compareBooleans(x, y);
+      }
+
+      if (typeX === 'string') {
+        return naturalSort(x, y);
+      }
+
+      if (typeX === 'Object') {
+        return compareObjects(this, x, y);
+      }
+
+      if (typeX === 'null') {
+        return 0;
+      }
+
+      if (typeX === 'undefined') {
+        return 0;
+      } // this should not occur...
+
+
+      throw new TypeError('Unsupported type of value "' + typeX + '"');
+    }
+  });
+  /**
+   * Compare mixed matrix/array types, by converting to same-shaped array.
+   * This comparator is non-deterministic regarding input types.
+   * @param {Array | SparseMatrix | DenseMatrix | *} x
+   * @param {Array | SparseMatrix | DenseMatrix | *} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+  function compareMatricesAndArrays(compareNatural, x, y) {
+    if (isSparseMatrix(x) && isSparseMatrix(y)) {
+      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);
+    }
+
+    if (isSparseMatrix(x)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x.toArray(), y);
+    }
+
+    if (isSparseMatrix(y)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x, y.toArray());
+    } // convert DenseArray into Array
+
+
+    if (isDenseMatrix(x)) {
+      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);
+    }
+
+    if (isDenseMatrix(y)) {
+      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);
+    } // convert scalars to array
+
+
+    if (!Array.isArray(x)) {
+      return compareMatricesAndArrays(compareNatural, [x], y);
+    }
+
+    if (!Array.isArray(y)) {
+      return compareMatricesAndArrays(compareNatural, x, [y]);
+    }
+
+    return compareArrays(compareNatural, x, y);
+  }
+  /**
+   * Compare two Arrays
+   *
+   * - First, compares value by value
+   * - Next, if all corresponding values are equal,
+   *   look at the length: longest array will be considered largest
+   *
+   * @param {Array} x
+   * @param {Array} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+
+  function compareArrays(compareNatural, x, y) {
+    // compare each value
+    for (var i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {
+      var v = compareNatural(x[i], y[i]);
+
+      if (v !== 0) {
+        return v;
+      }
+    } // compare the size of the arrays
+
+
+    if (x.length > y.length) {
+      return 1;
+    }
+
+    if (x.length < y.length) {
+      return -1;
+    } // both Arrays have equal size and content
+
+
+    return 0;
+  }
+  /**
+   * Compare two objects
+   *
+   * - First, compare sorted property names
+   * - Next, compare the property values
+   *
+   * @param {Object} x
+   * @param {Object} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+
+  function compareObjects(compareNatural, x, y) {
+    var keysX = Object.keys(x);
+    var keysY = Object.keys(y); // compare keys
+
+    keysX.sort(naturalSort);
+    keysY.sort(naturalSort);
+    var c = compareArrays(compareNatural, keysX, keysY);
+
+    if (c !== 0) {
+      return c;
+    } // compare values
+
+
+    for (var i = 0; i < keysX.length; i++) {
+      var v = compareNatural(x[keysX[i]], y[keysY[i]]);
+
+      if (v !== 0) {
+        return v;
+      }
+    }
+
+    return 0;
+  }
+});
+/**
+ * Compare two complex numbers, `x` and `y`:
+ *
+ * - First, compare the real values of `x` and `y`
+ * - If equal, compare the imaginary values of `x` and `y`
+ *
+ * @params {Complex} x
+ * @params {Complex} y
+ * @returns {number} Returns the comparison result: -1, 0, or 1
+ */
+
+function compareComplexNumbers(x, y) {
+  if (x.re > y.re) {
+    return 1;
+  }
+
+  if (x.re < y.re) {
+    return -1;
+  }
+
+  if (x.im > y.im) {
+    return 1;
+  }
+
+  if (x.im < y.im) {
+    return -1;
+  }
+
+  return 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/compareText.js b/node_modules/mathjs/lib/esm/function/relational/compareText.js
new file mode 100644
index 0000000..906ad20
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/compareText.js
@@ -0,0 +1,87 @@
+import { compareText as _compareText } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+var name = 'compareText';
+var dependencies = ['typed', 'matrix'];
+export var createCompareText = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Compare two strings lexically. Comparison is case sensitive.
+   * Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.compareText(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareText('B', 'A')     // returns 1
+   *    math.compareText('2', '10')    // returns 1
+   *    math.compare('2', '10')        // returns -1
+   *    math.compareNatural('2', '10') // returns -1
+   *
+   *    math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, equalText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns the result of the comparison:
+   *                                        1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+
+  return typed(name, {
+    'any, any': _compareText,
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, _compareText);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, _compareText, false);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, _compareText, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, _compareText, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, _compareText, true).valueOf();
+    }
+  });
+});
+export var createCompareTextNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {
+  var {
+    typed
+  } = _ref2;
+  return typed(name, {
+    'any, any': _compareText
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/deepEqual.js b/node_modules/mathjs/lib/esm/function/relational/deepEqual.js
new file mode 100644
index 0000000..da47a9e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/deepEqual.js
@@ -0,0 +1,78 @@
+import { factory } from '../../utils/factory.js';
+var name = 'deepEqual';
+var dependencies = ['typed', 'equal'];
+export var createDeepEqual = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equal
+  } = _ref;
+
+  /**
+   * Test element wise whether two matrices are equal.
+   * The function accepts both matrices and scalar values.
+   *
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.deepEqual(x, y)
+   *
+   * Examples:
+   *
+   *    math.deepEqual(2, 4)   // returns false
+   *
+   *    a = [2, 5, 1]
+   *    b = [2, 7, 1]
+   *
+   *    math.deepEqual(a, b)   // returns false
+   *    math.equal(a, b)       // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    equal, unequal
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns true when the input matrices have the same size and each of their elements is equal.
+   */
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      return _deepEqual(x.valueOf(), y.valueOf());
+    }
+  });
+  /**
+   * Test whether two arrays have the same size and all elements are equal
+   * @param {Array | *} x
+   * @param {Array | *} y
+   * @return {boolean} Returns true if both arrays are deep equal
+   */
+
+  function _deepEqual(x, y) {
+    if (Array.isArray(x)) {
+      if (Array.isArray(y)) {
+        var len = x.length;
+
+        if (len !== y.length) {
+          return false;
+        }
+
+        for (var i = 0; i < len; i++) {
+          if (!_deepEqual(x[i], y[i])) {
+            return false;
+          }
+        }
+
+        return true;
+      } else {
+        return false;
+      }
+    } else {
+      if (Array.isArray(y)) {
+        return false;
+      } else {
+        return equal(x, y);
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/equal.js b/node_modules/mathjs/lib/esm/function/relational/equal.js
new file mode 100644
index 0000000..ffceb1c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/equal.js
@@ -0,0 +1,172 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'equal';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
+export var createEqual = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Test whether two values are equal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * smaller than the configured epsilon. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is only
+   * equal to `null` and nothing else, and `undefined` is only equal to
+   * `undefined` and nothing else. Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.equal(x, y)
+   *
+   * Examples:
+   *
+   *    math.equal(2 + 2, 3)         // returns false
+   *    math.equal(2 + 2, 4)         // returns true
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.equal(a, b)             // returns true
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.equal(c, d)             // returns [true, false, true]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.equal("1000", "1e3")    // returns true
+   *    math.equal(0, null)          // returns false
+   *
+   * See also:
+   *
+   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText
+   *
+   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false
+   */
+
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y === null;
+      }
+
+      if (y === null) {
+        return x === null;
+      }
+
+      if (x === undefined) {
+        return y === undefined;
+      }
+
+      if (y === undefined) {
+        return x === undefined;
+      }
+
+      return equalScalar(x, y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, equalScalar);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, equalScalar, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, equalScalar, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, equalScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, equalScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, equalScalar, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, equalScalar, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, equalScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, equalScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, equalScalar, true).valueOf();
+    }
+  });
+});
+export var createEqualNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {
+  var {
+    typed,
+    equalScalar
+  } = _ref2;
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y === null;
+      }
+
+      if (y === null) {
+        return x === null;
+      }
+
+      if (x === undefined) {
+        return y === undefined;
+      }
+
+      if (y === undefined) {
+        return x === undefined;
+      }
+
+      return equalScalar(x, y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/equalScalar.js b/node_modules/mathjs/lib/esm/function/relational/equalScalar.js
new file mode 100644
index 0000000..74db104
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/equalScalar.js
@@ -0,0 +1,56 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { complexEquals } from '../../utils/complex.js';
+var name = 'equalScalar';
+var dependencies = ['typed', 'config'];
+export var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config
+  } = _ref;
+
+  /**
+   * Test whether two scalar values are nearly equal.
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit} x   First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Complex} y          Second value to compare
+   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false
+   * @private
+   */
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x === y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return nearlyEqual(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.equals(y);
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return complexEquals(x, y, config.epsilon);
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    }
+  });
+});
+export var createEqualScalarNumber = factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return nearlyEqual(x, y, config.epsilon);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/equalText.js b/node_modules/mathjs/lib/esm/function/relational/equalText.js
new file mode 100644
index 0000000..1478880
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/equalText.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+var name = 'equalText';
+var dependencies = ['typed', 'compareText', 'isZero'];
+export var createEqualText = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    compareText,
+    isZero
+  } = _ref;
+
+  /**
+   * Check equality of two strings. Comparison is case sensitive.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.equalText(x, y)
+   *
+   * Examples:
+   *
+   *    math.equalText('Hello', 'Hello')     // returns true
+   *    math.equalText('a', 'A')             // returns false
+   *    math.equal('2e3', '2000')            // returns true
+   *    math.equalText('2e3', '2000')        // returns false
+   *
+   *    math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    equal, compareText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.
+   */
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      return isZero(compareText(x, y));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/larger.js b/node_modules/mathjs/lib/esm/function/relational/larger.js
new file mode 100644
index 0000000..46a7917
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/larger.js
@@ -0,0 +1,146 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+var name = 'larger';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+export var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Test whether value x is larger than y.
+   *
+   * The function returns true when x is larger than y and the relative
+   * difference between x and y is larger than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.larger(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 3)             // returns false
+   *    math.larger(5, 2 + 2)         // returns true
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.larger(a, b)             // returns false
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x > y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x > y && !nearlyEqual(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.gt(y) && !bigNearlyEqual(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) === 1;
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+export var createLargerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x > y && !nearlyEqual(x, y, config.epsilon);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/largerEq.js b/node_modules/mathjs/lib/esm/function/relational/largerEq.js
new file mode 100644
index 0000000..39b5144
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/largerEq.js
@@ -0,0 +1,142 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+var name = 'largerEq';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+export var createLargerEq = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Test whether value x is larger or equal to y.
+   *
+   * The function returns true when x is larger than y or the relative
+   * difference between x and y is smaller than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.largerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 1 + 1)         // returns false
+   *    math.largerEq(2, 1 + 1)       // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x >= y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x >= y || nearlyEqual(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.gte(y) || bigNearlyEqual(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) !== -1;
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+export var createLargerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x >= y || nearlyEqual(x, y, config.epsilon);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/smaller.js b/node_modules/mathjs/lib/esm/function/relational/smaller.js
new file mode 100644
index 0000000..ab800ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/smaller.js
@@ -0,0 +1,146 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+var name = 'smaller';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+export var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Test whether value x is smaller than y.
+   *
+   * The function returns true when x is smaller than y and the relative
+   * difference between x and y is smaller than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smaller(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(2, 3)            // returns true
+   *    math.smaller(5, 2 * 2)        // returns false
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.smaller(a, b)            // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smallerEq, smaller, smallerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x < y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x < y && !nearlyEqual(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.lt(y) && !bigNearlyEqual(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) === -1;
+    },
+    'Complex, Complex': function ComplexComplex(x, y) {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+export var createSmallerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x < y && !nearlyEqual(x, y, config.epsilon);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/smallerEq.js b/node_modules/mathjs/lib/esm/function/relational/smallerEq.js
new file mode 100644
index 0000000..6668278
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/smallerEq.js
@@ -0,0 +1,142 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+var name = 'smallerEq';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
+export var createSmallerEq = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Test whether value x is smaller or equal to y.
+   *
+   * The function returns true when x is smaller than y or the relative
+   * difference between x and y is smaller than the configured epsilon. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smallerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(1 + 2, 3)        // returns false
+   *    math.smallerEq(1 + 2, 3)      // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+
+  return typed(name, {
+    'boolean, boolean': function booleanBoolean(x, y) {
+      return x <= y;
+    },
+    'number, number': function numberNumber(x, y) {
+      return x <= y || nearlyEqual(x, y, config.epsilon);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.lte(y) || bigNearlyEqual(x, y, config.epsilon);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.compare(y) !== 1;
+    },
+    'Complex, Complex': function ComplexComplex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return this(x.value, y.value);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, this);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, this, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, this, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
+export var createSmallerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function numberNumber(x, y) {
+      return x <= y || nearlyEqual(x, y, config.epsilon);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/unequal.js b/node_modules/mathjs/lib/esm/function/relational/unequal.js
new file mode 100644
index 0000000..1474e14
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/unequal.js
@@ -0,0 +1,176 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+var name = 'unequal';
+var dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix'];
+export var createUnequal = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    equalScalar,
+    matrix,
+    DenseMatrix
+  } = _ref;
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm07 = createAlgorithm07({
+    typed,
+    DenseMatrix
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Test whether two values are unequal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * larger than the configured epsilon. The function cannot be used to compare
+   * values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.
+   * Strings are compared by their numerical value.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is unequal
+   * with everything except `null`, and `undefined` is unequal with everything
+   * except `undefined`.
+   *
+   * Syntax:
+   *
+   *    math.unequal(x, y)
+   *
+   * Examples:
+   *
+   *    math.unequal(2 + 2, 3)       // returns true
+   *    math.unequal(2 + 2, 4)       // returns false
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.unequal(a, b)           // returns false
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.unequal(c, d)           // returns [false, true, false]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.unequal(0, null)        // returns true
+   * See also:
+   *
+   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false
+   */
+
+  return typed('unequal', {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y !== null;
+      }
+
+      if (y === null) {
+        return x !== null;
+      }
+
+      if (x === undefined) {
+        return y !== undefined;
+      }
+
+      if (y === undefined) {
+        return x !== undefined;
+      }
+
+      return _unequal(x, y);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm07(x, y, _unequal);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm03(y, x, _unequal, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, _unequal, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, _unequal);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm12(x, y, _unequal, false);
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, _unequal, false);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm12(y, x, _unequal, true);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, _unequal, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, _unequal, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, _unequal, true).valueOf();
+    }
+  });
+
+  function _unequal(x, y) {
+    return !equalScalar(x, y);
+  }
+});
+export var createUnequalNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {
+  var {
+    typed,
+    equalScalar
+  } = _ref2;
+  return typed(name, {
+    'any, any': function anyAny(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y !== null;
+      }
+
+      if (y === null) {
+        return x !== null;
+      }
+
+      if (x === undefined) {
+        return y !== undefined;
+      }
+
+      if (y === undefined) {
+        return x !== undefined;
+      }
+
+      return !equalScalar(x, y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setCartesian.js b/node_modules/mathjs/lib/esm/function/set/setCartesian.js
new file mode 100644
index 0000000..e86bd89
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setCartesian.js
@@ -0,0 +1,63 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setCartesian';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetCartesian = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Create the cartesian product of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays
+   * and the values will be sorted in ascending order before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setCartesian(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]
+   *    math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference, setPowerset
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The cartesian product of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      var result = [];
+
+      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {
+        // if any of them is empty, return empty
+        var b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);
+        var b2 = flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);
+        result = [];
+
+        for (var i = 0; i < b1.length; i++) {
+          for (var j = 0; j < b2.length; j++) {
+            result.push([b1[i], b2[j]]);
+          }
+        }
+      } // return an array, if both inputs were arrays
+
+
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return result;
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix(result);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setDifference.js b/node_modules/mathjs/lib/esm/function/set/setDifference.js
new file mode 100644
index 0000000..a4e0837
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setDifference.js
@@ -0,0 +1,78 @@
+import { flatten, generalize, identify } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setDifference';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetDifference = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]
+   *    math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setSymDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      var result;
+
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty-anything=empty
+        result = [];
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything-empty=anything
+        return flatten(a1.toArray());
+      } else {
+        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+        var inb2;
+
+        for (var i = 0; i < b1.length; i++) {
+          inb2 = false;
+
+          for (var j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              inb2 = true;
+              break;
+            }
+          }
+
+          if (!inb2) {
+            result.push(b1[i]);
+          }
+        }
+      } // return an array, if both inputs were arrays
+
+
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return generalize(result);
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix(generalize(result));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setDistinct.js b/node_modules/mathjs/lib/esm/function/set/setDistinct.js
new file mode 100644
index 0000000..0d77caf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setDistinct.js
@@ -0,0 +1,62 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setDistinct';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetDistinct = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Collect the distinct elements of a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDistinct(set)
+   *
+   * Examples:
+   *
+   *    math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]
+   *
+   * See also:
+   *
+   *    setMultiplicity
+   *
+   * @param {Array | Matrix}    a  A multiset
+   * @return {Array | Matrix}    A set containing the distinc elements of the multiset
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      var result;
+
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        result = [];
+      } else {
+        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        result = [];
+        result.push(b[0]);
+
+        for (var i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            result.push(b[i]);
+          }
+        }
+      } // return an array, if the input was an array
+
+
+      if (Array.isArray(a)) {
+        return result;
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix(result);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setIntersect.js b/node_modules/mathjs/lib/esm/function/set/setIntersect.js
new file mode 100644
index 0000000..c3d8720
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setIntersect.js
@@ -0,0 +1,68 @@
+import { flatten, generalize, identify } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setIntersect';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetIntersect = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Create the intersection of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIntersect(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]
+   *    math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]
+   *
+   * See also:
+   *
+   *    setUnion, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The intersection of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      var result;
+
+      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {
+        // of any of them is empty, return empty
+        result = [];
+      } else {
+        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+
+        for (var i = 0; i < b1.length; i++) {
+          for (var j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              result.push(b1[i]);
+              break;
+            }
+          }
+        }
+      } // return an array, if both inputs were arrays
+
+
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return generalize(result);
+      } // return a matrix otherwise
+
+
+      return new DenseMatrix(generalize(result));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setIsSubset.js b/node_modules/mathjs/lib/esm/function/set/setIsSubset.js
new file mode 100644
index 0000000..ddc027d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setIsSubset.js
@@ -0,0 +1,68 @@
+import { flatten, identify } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setIsSubset';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+export var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+
+  /**
+   * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIsSubset(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false
+   *    math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {boolean}            true | false
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty is a subset of anything
+        return true;
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything is not a subset of empty
+        return false;
+      }
+
+      var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+      var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+      var inb2;
+
+      for (var i = 0; i < b1.length; i++) {
+        inb2 = false;
+
+        for (var j = 0; j < b2.length; j++) {
+          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+            // the identifier is always a decimal int
+            inb2 = true;
+            break;
+          }
+        }
+
+        if (inb2 === false) {
+          return false;
+        }
+      }
+
+      return true;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setMultiplicity.js b/node_modules/mathjs/lib/esm/function/set/setMultiplicity.js
new file mode 100644
index 0000000..b1ee5f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setMultiplicity.js
@@ -0,0 +1,54 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setMultiplicity';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+export var createSetMultiplicity = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+
+  /**
+   * Count the multiplicity of an element in a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setMultiplicity(element, set)
+   *
+   * Examples:
+   *
+   *    math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1
+   *    math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2
+   *
+   * See also:
+   *
+   *    setDistinct, setSize
+   *
+   * @param {number | BigNumber | Fraction | Complex} e  An element in the multiset
+   * @param {Array | Matrix}     a  A multiset
+   * @return {number}            The number of how many times the multiset contains the element
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction | Complex, Array | Matrix': function numberBigNumberFractionComplexArrayMatrix(e, a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return 0
+        return 0;
+      }
+
+      var b = flatten(Array.isArray(a) ? a : a.toArray());
+      var count = 0;
+
+      for (var i = 0; i < b.length; i++) {
+        if (compareNatural(b[i], e) === 0) {
+          count++;
+        }
+      }
+
+      return count;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setPowerset.js b/node_modules/mathjs/lib/esm/function/set/setPowerset.js
new file mode 100644
index 0000000..31fb89a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setPowerset.js
@@ -0,0 +1,82 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setPowerset';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+export var createSetPowerset = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+
+  /**
+   * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setPowerset(set)
+   *
+   * Examples:
+   *
+   *    math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
+   *
+   * See also:
+   *
+   *    setCartesian
+   *
+   * @param {Array | Matrix}    a  A (multi)set
+   * @return {Array}    The powerset of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        return [];
+      }
+
+      var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+      var result = [];
+      var number = 0;
+
+      while (number.toString(2).length <= b.length) {
+        result.push(_subset(b, number.toString(2).split('').reverse()));
+        number++;
+      } // can not return a matrix, because of the different size of the subarrays
+
+
+      return _sort(result);
+    }
+  }); // create subset
+
+  function _subset(array, bitarray) {
+    var result = [];
+
+    for (var i = 0; i < bitarray.length; i++) {
+      if (bitarray[i] === '1') {
+        result.push(array[i]);
+      }
+    }
+
+    return result;
+  } // sort subsests by length
+
+
+  function _sort(array) {
+    var temp = [];
+
+    for (var i = array.length - 1; i > 0; i--) {
+      for (var j = 0; j < i; j++) {
+        if (array[j].length > array[j + 1].length) {
+          temp = array[j];
+          array[j] = array[j + 1];
+          array[j + 1] = temp;
+        }
+      }
+    }
+
+    return array;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setSize.js b/node_modules/mathjs/lib/esm/function/set/setSize.js
new file mode 100644
index 0000000..6b635e7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setSize.js
@@ -0,0 +1,53 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setSize';
+var dependencies = ['typed', 'compareNatural'];
+export var createSetSize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    compareNatural
+  } = _ref;
+
+  /**
+   * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSize(set)
+   *    math.setSize(set, unique)
+   *
+   * Examples:
+   *
+   *    math.setSize([1, 2, 2, 4])          // returns 4
+   *    math.setSize([1, 2, 2, 4], true)    // returns 3
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a  A multiset
+   * @return {number}            The number of elements of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(a) {
+      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;
+    },
+    'Array | Matrix, boolean': function ArrayMatrixBoolean(a, unique) {
+      if (unique === false || a.length === 0) {
+        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;
+      } else {
+        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        var count = 1;
+
+        for (var i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            count++;
+          }
+        }
+
+        return count;
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setSymDifference.js b/node_modules/mathjs/lib/esm/function/set/setSymDifference.js
new file mode 100644
index 0000000..43d174e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setSymDifference.js
@@ -0,0 +1,50 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setSymDifference';
+var dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];
+export var createSetSymDifference = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    concat,
+    subset,
+    setDifference,
+    Index
+  } = _ref;
+
+  /**
+   * Create the symmetric difference of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSymDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]
+   *    math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The symmetric difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return flatten(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return flatten(a1);
+      }
+
+      var b1 = flatten(a1);
+      var b2 = flatten(a2);
+      return concat(setDifference(b1, b2), setDifference(b2, b1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setUnion.js b/node_modules/mathjs/lib/esm/function/set/setUnion.js
new file mode 100644
index 0000000..c7b66c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setUnion.js
@@ -0,0 +1,51 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setUnion';
+var dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];
+export var createSetUnion = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    concat,
+    subset,
+    setIntersect,
+    setSymDifference,
+    Index
+  } = _ref;
+
+  /**
+   * Create the union of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setUnion(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]
+   *    math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]
+   *
+   * See also:
+   *
+   *    setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The union of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return flatten(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return flatten(a1);
+      }
+
+      var b1 = flatten(a1);
+      var b2 = flatten(a2);
+      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/special/erf.js b/node_modules/mathjs/lib/esm/function/special/erf.js
new file mode 100644
index 0000000..a677882
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/special/erf.js
@@ -0,0 +1,165 @@
+/* eslint-disable no-loss-of-precision */
+import { deepMap } from '../../utils/collection.js';
+import { sign } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'erf';
+var dependencies = ['typed'];
+export var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Compute the erf function of a value using a rational Chebyshev
+   * approximations for different intervals of x.
+   *
+   * This is a translation of W. J. Cody's Fortran implementation from 1987
+   * ( https://www.netlib.org/specfun/erf ). See the AMS publication
+   * "Rational Chebyshev Approximations for the Error Function" by W. J. Cody
+   * for an explanation of this process.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.erf(x)
+   *
+   * Examples:
+   *
+   *    math.erf(0.2)    // returns 0.22270258921047847
+   *    math.erf(-0.5)   // returns -0.5204998778130465
+   *    math.erf(4)      // returns 0.9999999845827421
+   *
+   * @param {number | Array | Matrix} x   A real number
+   * @return {number | Array | Matrix}    The erf of `x`
+   */
+  return typed('name', {
+    number: function number(x) {
+      var y = Math.abs(x);
+
+      if (y >= MAX_NUM) {
+        return sign(x);
+      }
+
+      if (y <= THRESH) {
+        return sign(x) * erf1(y);
+      }
+
+      if (y <= 4.0) {
+        return sign(x) * (1 - erfc2(y));
+      }
+
+      return sign(x) * (1 - erfc3(y));
+    },
+    'Array | Matrix': function ArrayMatrix(n) {
+      return deepMap(n, this);
+    } // TODO: For complex numbers, use the approximation for the Faddeeva function
+    //  from "More Efficient Computation of the Complex Error Function" (AMS)
+
+  });
+  /**
+   * Approximates the error function erf() for x <= 0.46875 using this function:
+   *               n
+   * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))
+   *              j=0
+   */
+
+  function erf1(y) {
+    var ysq = y * y;
+    var xnum = P[0][4] * ysq;
+    var xden = ysq;
+    var i;
+
+    for (i = 0; i < 3; i += 1) {
+      xnum = (xnum + P[0][i]) * ysq;
+      xden = (xden + Q[0][i]) * ysq;
+    }
+
+    return y * (xnum + P[0][3]) / (xden + Q[0][3]);
+  }
+  /**
+   * Approximates the complement of the error function erfc() for
+   * 0.46875 <= x <= 4.0 using this function:
+   *                       n
+   * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)
+   *                      j=0
+   */
+
+
+  function erfc2(y) {
+    var xnum = P[1][8] * y;
+    var xden = y;
+    var i;
+
+    for (i = 0; i < 7; i += 1) {
+      xnum = (xnum + P[1][i]) * y;
+      xden = (xden + Q[1][i]) * y;
+    }
+
+    var result = (xnum + P[1][7]) / (xden + Q[1][7]);
+    var ysq = parseInt(y * 16) / 16;
+    var del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+  /**
+   * Approximates the complement of the error function erfc() for x > 4.0 using
+   * this function:
+   *
+   * erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +
+   *               n
+   *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]
+   *              j=0
+   */
+
+
+  function erfc3(y) {
+    var ysq = 1 / (y * y);
+    var xnum = P[2][5] * ysq;
+    var xden = ysq;
+    var i;
+
+    for (i = 0; i < 4; i += 1) {
+      xnum = (xnum + P[2][i]) * ysq;
+      xden = (xden + Q[2][i]) * ysq;
+    }
+
+    var result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);
+    result = (SQRPI - result) / y;
+    ysq = parseInt(y * 16) / 16;
+    var del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+});
+/**
+ * Upper bound for the first approximation interval, 0 <= x <= THRESH
+ * @constant
+ */
+
+var THRESH = 0.46875;
+/**
+ * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)
+ * @constant
+ */
+
+var SQRPI = 5.6418958354775628695e-1;
+/**
+ * Coefficients for each term of the numerator sum (p_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+
+var P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];
+/**
+ * Coefficients for each term of the denominator sum (q_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+
+var Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];
+/**
+ * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is
+ * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will
+ * return 1
+ */
+
+var MAX_NUM = Math.pow(2, 53);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/cumsum.js b/node_modules/mathjs/lib/esm/function/statistics/cumsum.js
new file mode 100644
index 0000000..1636822
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/cumsum.js
@@ -0,0 +1,139 @@
+import { containsCollections } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { _switch } from '../../utils/switch.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+import { arraySize } from '../../utils/array.js';
+import { IndexError } from '../../error/IndexError.js';
+var name = 'cumsum';
+var dependencies = ['typed', 'add', 'unaryPlus'];
+export var createCumSum = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    unaryPlus
+  } = _ref;
+
+  /**
+   * Compute the cumulative sum of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the cumulative sums
+   * along a specified dimension (defaulting to the first) will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.cumsum(a, b, c, ...)
+   *     math.cumsum(A)
+   *
+   * Examples:
+   *
+   *     math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]
+   *     math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]
+   *     math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]
+   *     math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, sum
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The cumulative sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    Array: _cumsum,
+    Matrix: function Matrix(matrix) {
+      return matrix.create(_cumsum(matrix.valueOf()));
+    },
+    // sum([a, b, c, d, ...], dim)
+    'Array, number | BigNumber': _ncumSumDim,
+    'Matrix, number | BigNumber': function MatrixNumberBigNumber(matrix, dim) {
+      return matrix.create(_ncumSumDim(matrix.valueOf(), dim));
+    },
+    // cumsum(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('All values expected to be scalar in function cumsum');
+      }
+
+      return _cumsum(args);
+    }
+  });
+  /**
+     * Recursively calculate the cumulative sum of an n-dimensional array
+     * @param {Array} array
+     * @return {number} cumsum
+     * @private
+     */
+
+  function _cumsum(array) {
+    try {
+      return _cumsummap(array);
+    } catch (err) {
+      throw improveErrorMessage(err, name);
+    }
+  }
+
+  function _cumsummap(array) {
+    if (array.length === 0) {
+      return [];
+    }
+
+    var sums = [unaryPlus(array[0])]; // unaryPlus converts to number if need be
+
+    for (var i = 1; i < array.length; ++i) {
+      // Must use add below and not addScalar for the case of summing a
+      // 2+-dimensional array along the 0th dimension (the row vectors,
+      // or higher-d analogues, are literally added to each other).
+      sums.push(add(sums[i - 1], array[i]));
+    }
+
+    return sums;
+  }
+
+  function _ncumSumDim(array, dim) {
+    var size = arraySize(array);
+
+    if (dim < 0 || dim >= size.length) {
+      // TODO: would be more clear when throwing a DimensionError here
+      throw new IndexError(dim, size.length);
+    }
+
+    try {
+      return _cumsumDimensional(array, dim);
+    } catch (err) {
+      throw improveErrorMessage(err, name);
+    }
+  }
+  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */
+
+
+  function _cumsumDimensional(mat, dim) {
+    var i, ret, tran;
+
+    if (dim <= 0) {
+      var initialValue = mat[0][0];
+
+      if (!Array.isArray(initialValue)) {
+        return _cumsummap(mat);
+      } else {
+        tran = _switch(mat);
+        ret = [];
+
+        for (i = 0; i < tran.length; i++) {
+          ret[i] = _cumsumDimensional(tran[i], dim - 1);
+        }
+
+        return ret;
+      }
+    } else {
+      ret = [];
+
+      for (i = 0; i < mat.length; i++) {
+        ret[i] = _cumsumDimensional(mat[i], dim - 1);
+      }
+
+      return ret;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/mad.js b/node_modules/mathjs/lib/esm/function/statistics/mad.js
new file mode 100644
index 0000000..83047eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/mad.js
@@ -0,0 +1,68 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'mad';
+var dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];
+export var createMad = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    map,
+    median,
+    subtract
+  } = _ref;
+
+  /**
+   * Compute the median absolute deviation of a matrix or a list with values.
+   * The median absolute deviation is defined as the median of the absolute
+   * deviations from the median.
+   *
+   * Syntax:
+   *
+   *     math.mad(a, b, c, ...)
+   *     math.mad(A)
+   *
+   * Examples:
+   *
+   *     math.mad(10, 20, 30)             // returns 10
+   *     math.mad([1, 2, 3])              // returns 1
+   *     math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5
+   *
+   * See also:
+   *
+   *     median, mean, std, abs
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or multiple scalar values.
+   * @return {*} The median absolute deviation.
+   */
+  return typed(name, {
+    // mad([a, b, c, d, ...])
+    'Array | Matrix': _mad,
+    // mad(a, b, c, d, ...)
+    '...': function _(args) {
+      return _mad(args);
+    }
+  });
+
+  function _mad(array) {
+    array = flatten(array.valueOf());
+
+    if (array.length === 0) {
+      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');
+    }
+
+    try {
+      var med = median(array);
+      return median(map(array, function (value) {
+        return abs(subtract(value, med));
+      }));
+    } catch (err) {
+      if (err instanceof TypeError && err.message.indexOf('median') !== -1) {
+        throw new TypeError(err.message.replace('median', 'mad'));
+      } else {
+        throw improveErrorMessage(err, 'mad');
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/max.js b/node_modules/mathjs/lib/esm/function/statistics/max.js
new file mode 100644
index 0000000..b106961
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/max.js
@@ -0,0 +1,109 @@
+import { deepForEach, reduce, containsCollections } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'max';
+var dependencies = ['typed', 'config', 'numeric', 'larger'];
+export var createMax = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    larger
+  } = _ref;
+
+  /**
+   * Compute the maximum value of a matrix or a  list with values.
+   * In case of a multi dimensional array, the maximum of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.max(a, b, c, ...)
+   *     math.max(A)
+   *     math.max(A, dim)
+   *
+   * Examples:
+   *
+   *     math.max(2, 1, 4, 3)                  // returns 4
+   *     math.max([2, 1, 4, 3])                // returns 4
+   *
+   *     // maximum over a specified dimension (zero-based)
+   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]
+   *     math.max([[2, 5], [4, 3]], [1, 7], 1) // returns [5, 4, 7]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, min, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The maximum value
+   */
+  return typed(name, {
+    // max([a, b, c, d, ...])
+    'Array | Matrix': _max,
+    // max([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      return reduce(array, dim.valueOf(), _largest);
+    },
+    // max(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function max');
+      }
+
+      return _max(args);
+    }
+  });
+  /**
+   * Return the largest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is largest, or y when y is largest
+   * @private
+   */
+
+  function _largest(x, y) {
+    try {
+      return larger(x, y) ? x : y;
+    } catch (err) {
+      throw improveErrorMessage(err, 'max', y);
+    }
+  }
+  /**
+   * Recursively calculate the maximum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} max
+   * @private
+   */
+
+
+  function _max(array) {
+    var res;
+    deepForEach(array, function (value) {
+      try {
+        if (isNaN(value) && typeof value === 'number') {
+          res = NaN;
+        } else if (res === undefined || larger(value, res)) {
+          res = value;
+        }
+      } catch (err) {
+        throw improveErrorMessage(err, 'max', value);
+      }
+    });
+
+    if (res === undefined) {
+      throw new Error('Cannot calculate max of an empty array');
+    } // make sure returning numeric value: parse a string into a numeric value
+
+
+    if (typeof res === 'string') {
+      res = numeric(res, config.number);
+    }
+
+    return res;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/mean.js b/node_modules/mathjs/lib/esm/function/statistics/mean.js
new file mode 100644
index 0000000..6bdd834
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/mean.js
@@ -0,0 +1,99 @@
+import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'mean';
+var dependencies = ['typed', 'add', 'divide'];
+export var createMean = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide
+  } = _ref;
+
+  /**
+   * Compute the mean value of matrix or a list with values.
+   * In case of a multi dimensional array, the mean of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.mean(a, b, c, ...)
+   *     math.mean(A)
+   *     math.mean(A, dim)
+   *
+   * Examples:
+   *
+   *     math.mean(2, 1, 4, 3)                     // returns 2.5
+   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725
+   *
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]
+   *
+   * See also:
+   *
+   *     median, min, max, sum, prod, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The mean of all values
+   */
+  return typed(name, {
+    // mean([a, b, c, d, ...])
+    'Array | Matrix': _mean,
+    // mean([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nmeanDim,
+    // mean(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function mean');
+      }
+
+      return _mean(args);
+    }
+  });
+  /**
+   * Calculate the mean value in an n-dimensional array, returning a
+   * n-1 dimensional array
+   * @param {Array} array
+   * @param {number} dim
+   * @return {number} mean
+   * @private
+   */
+
+  function _nmeanDim(array, dim) {
+    try {
+      var sum = reduce(array, dim, add);
+      var s = Array.isArray(array) ? arraySize(array) : array.size();
+      return divide(sum, s[dim]);
+    } catch (err) {
+      throw improveErrorMessage(err, 'mean');
+    }
+  }
+  /**
+   * Recursively calculate the mean value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} mean
+   * @private
+   */
+
+
+  function _mean(array) {
+    var sum;
+    var num = 0;
+    deepForEach(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw improveErrorMessage(err, 'mean', value);
+      }
+    });
+
+    if (num === 0) {
+      throw new Error('Cannot calculate the mean of an empty array');
+    }
+
+    return divide(sum, num);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/median.js b/node_modules/mathjs/lib/esm/function/statistics/median.js
new file mode 100644
index 0000000..aa8abd6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/median.js
@@ -0,0 +1,111 @@
+import { containsCollections } from '../../utils/collection.js';
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'median';
+var dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];
+export var createMedian = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide,
+    compare,
+    partitionSelect
+  } = _ref;
+
+  /**
+   * Recursively calculate the median of an n-dimensional array
+   * @param {Array} array
+   * @return {Number} median
+   * @private
+   */
+  function _median(array) {
+    try {
+      array = flatten(array.valueOf());
+      var num = array.length;
+
+      if (num === 0) {
+        throw new Error('Cannot calculate median of an empty array');
+      }
+
+      if (num % 2 === 0) {
+        // even: return the average of the two middle values
+        var mid = num / 2 - 1;
+        var right = partitionSelect(array, mid + 1); // array now partitioned at mid + 1, take max of left part
+
+        var left = array[mid];
+
+        for (var i = 0; i < mid; ++i) {
+          if (compare(array[i], left) > 0) {
+            left = array[i];
+          }
+        }
+
+        return middle2(left, right);
+      } else {
+        // odd: return the middle value
+        var m = partitionSelect(array, (num - 1) / 2);
+        return middle(m);
+      }
+    } catch (err) {
+      throw improveErrorMessage(err, 'median');
+    }
+  } // helper function to type check the middle value of the array
+
+
+  var middle = typed({
+    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(value) {
+      return value;
+    }
+  }); // helper function to type check the two middle value of the array
+
+  var middle2 = typed({
+    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function numberBigNumberComplexUnitNumberBigNumberComplexUnit(left, right) {
+      return divide(add(left, right), 2);
+    }
+  });
+  /**
+   * Compute the median of a matrix or a list with values. The values are
+   * sorted and the middle value is returned. In case of an even number of
+   * values, the average of the two middle values is returned.
+   * Supported types of values are: Number, BigNumber, Unit
+   *
+   * In case of a (multi dimensional) array or matrix, the median of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.median(a, b, c, ...)
+   *     math.median(A)
+   *
+   * Examples:
+   *
+   *     math.median(5, 2, 7)        // returns 5
+   *     math.median([3, -1, 5, 7])  // returns 4
+   *
+   * See also:
+   *
+   *     mean, min, max, sum, prod, std, variance, quantileSeq
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The median
+   */
+
+  return typed(name, {
+    // median([a, b, c, d, ...])
+    'Array | Matrix': _median,
+    // median([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      // TODO: implement median(A, dim)
+      throw new Error('median(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], ...)
+    },
+    // median(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function median');
+      }
+
+      return _median(args);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/min.js b/node_modules/mathjs/lib/esm/function/statistics/min.js
new file mode 100644
index 0000000..2c5d522
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/min.js
@@ -0,0 +1,109 @@
+import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'min';
+var dependencies = ['typed', 'config', 'numeric', 'smaller'];
+export var createMin = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    smaller
+  } = _ref;
+
+  /**
+   * Compute the minimum value of a matrix or a  list of values.
+   * In case of a multi dimensional array, the minimum of the flattened array
+   * will be calculated. When `dim` is provided, the minimum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.min(a, b, c, ...)
+   *     math.min(A)
+   *     math.min(A, dim)
+   *
+   * Examples:
+   *
+   *     math.min(2, 1, 4, 3)                  // returns 1
+   *     math.min([2, 1, 4, 3])                // returns 1
+   *
+   *     // minimum over a specified dimension (zero-based)
+   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]
+   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, max, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The minimum value
+   */
+  return typed(name, {
+    // min([a, b, c, d, ...])
+    'Array | Matrix': _min,
+    // min([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      return reduce(array, dim.valueOf(), _smallest);
+    },
+    // min(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function min');
+      }
+
+      return _min(args);
+    }
+  });
+  /**
+   * Return the smallest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is smallest, or y when y is smallest
+   * @private
+   */
+
+  function _smallest(x, y) {
+    try {
+      return smaller(x, y) ? x : y;
+    } catch (err) {
+      throw improveErrorMessage(err, 'min', y);
+    }
+  }
+  /**
+   * Recursively calculate the minimum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} min
+   * @private
+   */
+
+
+  function _min(array) {
+    var min;
+    deepForEach(array, function (value) {
+      try {
+        if (isNaN(value) && typeof value === 'number') {
+          min = NaN;
+        } else if (min === undefined || smaller(value, min)) {
+          min = value;
+        }
+      } catch (err) {
+        throw improveErrorMessage(err, 'min', value);
+      }
+    });
+
+    if (min === undefined) {
+      throw new Error('Cannot calculate min of an empty array');
+    } // make sure returning numeric value: parse a string into a numeric value
+
+
+    if (typeof min === 'string') {
+      min = numeric(min, config.number);
+    }
+
+    return min;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/mode.js b/node_modules/mathjs/lib/esm/function/statistics/mode.js
new file mode 100644
index 0000000..6d50b01
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/mode.js
@@ -0,0 +1,85 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'mode';
+var dependencies = ['typed', 'isNaN', 'isNumeric'];
+export var createMode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isNaN,
+    isNumeric
+  } = _ref;
+
+  /**
+  * Computes the mode of a set of numbers or a list with values(numbers or characters).
+  * If there are more than one modes, it returns a list of those values.
+  *
+  * Syntax:
+  *
+  *     math.mode(a, b, c, ...)
+  *     math.mode(A)
+  *
+  * Examples:
+  *
+  *     math.mode(2, 1, 4, 3, 1)                            // returns [1]
+  *     math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]
+  *     math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]
+  *     math.mode('a','a','b','c')                           // returns ["a"]
+  *     math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, "abc"]
+  *
+  * See also:
+  *
+  *     median,
+  *     mean
+  *
+  * @param {... *} args  A single matrix
+  * @return {*} The mode of all values
+  */
+  return typed(name, {
+    'Array | Matrix': _mode,
+    '...': function _(args) {
+      return _mode(args);
+    }
+  });
+  /**
+   * Calculates the mode in an 1-dimensional array
+   * @param {Array} values
+   * @return {Array} mode
+   * @private
+   */
+
+  function _mode(values) {
+    values = flatten(values.valueOf());
+    var num = values.length;
+
+    if (num === 0) {
+      throw new Error('Cannot calculate mode of an empty array');
+    }
+
+    var count = {};
+    var mode = [];
+    var max = 0;
+
+    for (var i = 0; i < values.length; i++) {
+      var value = values[i];
+
+      if (isNumeric(value) && isNaN(value)) {
+        throw new Error('Cannot calculate mode of an array containing NaN values');
+      }
+
+      if (!(value in count)) {
+        count[value] = 0;
+      }
+
+      count[value]++;
+
+      if (count[value] === max) {
+        mode.push(value);
+      } else if (count[value] > max) {
+        max = count[value];
+        mode = [value];
+      }
+    }
+
+    return mode;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/prod.js b/node_modules/mathjs/lib/esm/function/statistics/prod.js
new file mode 100644
index 0000000..67c04a9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/prod.js
@@ -0,0 +1,79 @@
+import { deepForEach } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'prod';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];
+export var createProd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    multiplyScalar,
+    numeric
+  } = _ref;
+
+  /**
+   * Compute the product of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.prod(a, b, c, ...)
+   *     math.prod(A)
+   *
+   * Examples:
+   *
+   *     math.multiply(2, 3)           // returns 6
+   *     math.prod(2, 3)               // returns 6
+   *     math.prod(2, 3, 4)            // returns 24
+   *     math.prod([2, 3, 4])          // returns 24
+   *     math.prod([[2, 5], [4, 3]])   // returns 120
+   *
+   * See also:
+   *
+   *    mean, median, min, max, sum, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The product of all values
+   */
+  return typed(name, {
+    // prod([a, b, c, d, ...])
+    'Array | Matrix': _prod,
+    // prod([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      // TODO: implement prod(A, dim)
+      throw new Error('prod(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], math.prod)
+    },
+    // prod(a, b, c, d, ...)
+    '...': function _(args) {
+      return _prod(args);
+    }
+  });
+  /**
+   * Recursively calculate the product of an n-dimensional array
+   * @param {Array} array
+   * @return {number} prod
+   * @private
+   */
+
+  function _prod(array) {
+    var prod;
+    deepForEach(array, function (value) {
+      try {
+        prod = prod === undefined ? value : multiplyScalar(prod, value);
+      } catch (err) {
+        throw improveErrorMessage(err, 'prod', value);
+      }
+    }); // make sure returning numeric value: parse a string into a numeric value
+
+    if (typeof prod === 'string') {
+      prod = numeric(prod, config.number);
+    }
+
+    if (prod === undefined) {
+      throw new Error('Cannot calculate prod of an empty array');
+    }
+
+    return prod;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..c448e7a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js
@@ -0,0 +1,275 @@
+import { isBigNumber, isCollection, isNumber } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'quantileSeq';
+var dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare'];
+export var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    multiply,
+    partitionSelect,
+    compare
+  } = _ref;
+
+  /**
+   * Compute the prob order quantile of a matrix or a list with values.
+   * The sequence is sorted and the middle value is returned.
+   * Supported types of sequence values are: Number, BigNumber, Unit
+   * Supported types of probability are: Number, BigNumber
+   *
+   * In case of a (multi dimensional) array or matrix, the prob order quantile
+   * of all elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.quantileSeq(A, prob[, sorted])
+   *     math.quantileSeq(A, [prob1, prob2, ...][, sorted])
+   *     math.quantileSeq(A, N[, sorted])
+   *
+   * Examples:
+   *
+   *     math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4
+   *     math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]
+   *     math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]
+   *     math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4
+   *
+   * See also:
+   *
+   *     median, mean, min, max, sum, prod, std, variance
+   *
+   * @param {Array, Matrix} data                A single matrix or Array
+   * @param {Number, BigNumber, Array} probOrN  prob is the order of the quantile, while N is
+   *                                            the amount of evenly distributed steps of
+   *                                            probabilities; only one of these options can
+   *                                            be provided
+   * @param {Boolean} sorted=false              is data sorted in ascending order
+   * @return {Number, BigNumber, Unit, Array}   Quantile(s)
+   */
+  function quantileSeq(data, probOrN, sorted) {
+    var probArr, dataArr, one;
+
+    if (arguments.length < 2 || arguments.length > 3) {
+      throw new SyntaxError('Function quantileSeq requires two or three parameters');
+    }
+
+    if (isCollection(data)) {
+      sorted = sorted || false;
+
+      if (typeof sorted === 'boolean') {
+        dataArr = data.valueOf();
+
+        if (isNumber(probOrN)) {
+          if (probOrN < 0) {
+            throw new Error('N/prob must be non-negative');
+          }
+
+          if (probOrN <= 1) {
+            // quantileSeq([a, b, c, d, ...], prob[,sorted])
+            return _quantileSeq(dataArr, probOrN, sorted);
+          }
+
+          if (probOrN > 1) {
+            // quantileSeq([a, b, c, d, ...], N[,sorted])
+            if (!isInteger(probOrN)) {
+              throw new Error('N must be a positive integer');
+            }
+
+            var nPlusOne = probOrN + 1;
+            probArr = new Array(probOrN);
+
+            for (var i = 0; i < probOrN;) {
+              probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);
+            }
+
+            return probArr;
+          }
+        }
+
+        if (isBigNumber(probOrN)) {
+          var BigNumber = probOrN.constructor;
+
+          if (probOrN.isNegative()) {
+            throw new Error('N/prob must be non-negative');
+          }
+
+          one = new BigNumber(1);
+
+          if (probOrN.lte(one)) {
+            // quantileSeq([a, b, c, d, ...], prob[,sorted])
+            return new BigNumber(_quantileSeq(dataArr, probOrN, sorted));
+          }
+
+          if (probOrN.gt(one)) {
+            // quantileSeq([a, b, c, d, ...], N[,sorted])
+            if (!probOrN.isInteger()) {
+              throw new Error('N must be a positive integer');
+            } // largest possible Array length is 2^32-1
+            // 2^32 < 10^15, thus safe conversion guaranteed
+
+
+            var intN = probOrN.toNumber();
+
+            if (intN > 4294967295) {
+              throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array');
+            }
+
+            var _nPlusOne = new BigNumber(intN + 1);
+
+            probArr = new Array(intN);
+
+            for (var _i = 0; _i < intN;) {
+              probArr[_i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++_i).div(_nPlusOne), sorted));
+            }
+
+            return probArr;
+          }
+        }
+
+        if (Array.isArray(probOrN)) {
+          // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
+          probArr = new Array(probOrN.length);
+
+          for (var _i2 = 0; _i2 < probArr.length; ++_i2) {
+            var currProb = probOrN[_i2];
+
+            if (isNumber(currProb)) {
+              if (currProb < 0 || currProb > 1) {
+                throw new Error('Probability must be between 0 and 1, inclusive');
+              }
+            } else if (isBigNumber(currProb)) {
+              one = new currProb.constructor(1);
+
+              if (currProb.isNegative() || currProb.gt(one)) {
+                throw new Error('Probability must be between 0 and 1, inclusive');
+              }
+            } else {
+              throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+            }
+
+            probArr[_i2] = _quantileSeq(dataArr, currProb, sorted);
+          }
+
+          return probArr;
+        }
+
+        throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+      }
+
+      throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+    }
+
+    throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+  }
+  /**
+   * Calculate the prob order quantile of an n-dimensional array.
+   *
+   * @param {Array} array
+   * @param {Number, BigNumber} prob
+   * @param {Boolean} sorted
+   * @return {Number, BigNumber, Unit} prob order quantile
+   * @private
+   */
+
+
+  function _quantileSeq(array, prob, sorted) {
+    var flat = flatten(array);
+    var len = flat.length;
+
+    if (len === 0) {
+      throw new Error('Cannot calculate quantile of an empty sequence');
+    }
+
+    if (isNumber(prob)) {
+      var _index = prob * (len - 1);
+
+      var _fracPart = _index % 1;
+
+      if (_fracPart === 0) {
+        var value = sorted ? flat[_index] : partitionSelect(flat, _index);
+        validate(value);
+        return value;
+      }
+
+      var _integerPart = Math.floor(_index);
+
+      var _left;
+
+      var _right;
+
+      if (sorted) {
+        _left = flat[_integerPart];
+        _right = flat[_integerPart + 1];
+      } else {
+        _right = partitionSelect(flat, _integerPart + 1); // max of partition is kth largest
+
+        _left = flat[_integerPart];
+
+        for (var i = 0; i < _integerPart; ++i) {
+          if (compare(flat[i], _left) > 0) {
+            _left = flat[i];
+          }
+        }
+      }
+
+      validate(_left);
+      validate(_right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+
+      return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));
+    } // If prob is a BigNumber
+
+
+    var index = prob.times(len - 1);
+
+    if (index.isInteger()) {
+      index = index.toNumber();
+
+      var _value = sorted ? flat[index] : partitionSelect(flat, index);
+
+      validate(_value);
+      return _value;
+    }
+
+    var integerPart = index.floor();
+    var fracPart = index.minus(integerPart);
+    var integerPartNumber = integerPart.toNumber();
+    var left;
+    var right;
+
+    if (sorted) {
+      left = flat[integerPartNumber];
+      right = flat[integerPartNumber + 1];
+    } else {
+      right = partitionSelect(flat, integerPartNumber + 1); // max of partition is kth largest
+
+      left = flat[integerPartNumber];
+
+      for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {
+        if (compare(flat[_i3], left) > 0) {
+          left = flat[_i3];
+        }
+      }
+    }
+
+    validate(left);
+    validate(right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+
+    var one = new fracPart.constructor(1);
+    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));
+  }
+  /**
+   * Check if array value types are valid, throw error otherwise.
+   * @param {number | BigNumber | Unit} x
+   * @param {number | BigNumber | Unit} x
+   * @private
+   */
+
+
+  var validate = typed({
+    'number | BigNumber | Unit': function numberBigNumberUnit(x) {
+      return x;
+    }
+  });
+  return quantileSeq;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/std.js b/node_modules/mathjs/lib/esm/function/statistics/std.js
new file mode 100644
index 0000000..9c0617a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/std.js
@@ -0,0 +1,93 @@
+import { factory } from '../../utils/factory.js';
+var name = 'std';
+var dependencies = ['typed', 'sqrt', 'variance'];
+export var createStd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    sqrt,
+    variance
+  } = _ref;
+
+  /**
+   * Compute the standard deviation of a matrix or a  list with values.
+   * The standard deviations is defined as the square root of the variance:
+   * `std(A) = sqrt(variance(A))`.
+   * In case of a (multi dimensional) array or matrix, the standard deviation
+   * over all elements will be calculated by default, unless an axis is specified
+   * in which case the standard deviation will be computed along that axis.
+   *
+   * Additionally, it is possible to compute the standard deviation along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Syntax:
+   *
+   *     math.std(a, b, c, ...)
+   *     math.std(A)
+   *     math.std(A, normalization)
+   *     math.std(A, dimension)
+   *     math.std(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.std(2, 4, 6)                     // returns 2
+   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611
+   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979
+   *     math.std([2, 4, 6, 8], 'biased')      // returns 2
+   *
+   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707
+   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, sum, variance
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the standard deviation for a matrix
+   * @return {*} The standard deviation
+   */
+  return typed(name, {
+    // std([a, b, c, d, ...])
+    'Array | Matrix': _std,
+    // std([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _std,
+    // std([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': _std,
+    // std([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _std,
+    // std(a, b, c, d, ...)
+    '...': function _(args) {
+      return _std(args);
+    }
+  });
+
+  function _std(array, normalization) {
+    if (array.length === 0) {
+      throw new SyntaxError('Function std requires one or more parameters (0 provided)');
+    }
+
+    try {
+      return sqrt(variance.apply(null, arguments));
+    } catch (err) {
+      if (err instanceof TypeError && err.message.indexOf(' variance') !== -1) {
+        throw new TypeError(err.message.replace(' variance', ' std'));
+      } else {
+        throw err;
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/sum.js b/node_modules/mathjs/lib/esm/function/statistics/sum.js
new file mode 100644
index 0000000..c7a3fb3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/sum.js
@@ -0,0 +1,87 @@
+import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'sum';
+var dependencies = ['typed', 'config', 'add', 'numeric'];
+export var createSum = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    add,
+    numeric
+  } = _ref;
+
+  /**
+   * Compute the sum of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.sum(a, b, c, ...)
+   *     math.sum(A)
+   *
+   * Examples:
+   *
+   *     math.sum(2, 1, 4, 3)               // returns 10
+   *     math.sum([2, 1, 4, 3])             // returns 10
+   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, cumsum
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    'Array | Matrix': _sum,
+    // sum([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nsumDim,
+    // sum(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function sum');
+      }
+
+      return _sum(args);
+    }
+  });
+  /**
+   * Recursively calculate the sum of an n-dimensional array
+   * @param {Array | Matrix} array
+   * @return {number} sum
+   * @private
+   */
+
+  function _sum(array) {
+    var sum;
+    deepForEach(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+      } catch (err) {
+        throw improveErrorMessage(err, 'sum', value);
+      }
+    }); // make sure returning numeric value: parse a string into a numeric value
+
+    if (sum === undefined) {
+      sum = numeric(0, config.number);
+    }
+
+    if (typeof sum === 'string') {
+      sum = numeric(sum, config.number);
+    }
+
+    return sum;
+  }
+
+  function _nsumDim(array, dim) {
+    try {
+      var sum = reduce(array, dim, add);
+      return sum;
+    } catch (err) {
+      throw improveErrorMessage(err, 'sum');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js b/node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js
new file mode 100644
index 0000000..e4bd175
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js
@@ -0,0 +1,28 @@
+import { typeOf } from '../../../utils/is.js';
+/**
+ * Improve error messages for statistics functions. Errors are typically
+ * thrown in an internally used function like larger, causing the error
+ * not to mention the function (like max) which is actually used by the user.
+ *
+ * @param {Error} err
+ * @param {String} fnName
+ * @param {*} [value]
+ * @return {Error}
+ */
+
+export function improveErrorMessage(err, fnName, value) {
+  // TODO: add information with the index (also needs transform in expression parser)
+  var details;
+
+  if (String(err).indexOf('Unexpected type') !== -1) {
+    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';
+    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);
+  }
+
+  if (String(err).indexOf('complex numbers') !== -1) {
+    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : '';
+    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);
+  }
+
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/variance.js b/node_modules/mathjs/lib/esm/function/statistics/variance.js
new file mode 100644
index 0000000..1786140
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/variance.js
@@ -0,0 +1,161 @@
+import { deepForEach } from '../../utils/collection.js';
+import { isBigNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var DEFAULT_NORMALIZATION = 'unbiased';
+var name = 'variance';
+var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];
+export var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    apply,
+    isNaN
+  } = _ref;
+
+  /**
+   * Compute the variance of a matrix or a  list with values.
+   * In case of a (multi dimensional) array or matrix, the variance over all
+   * elements will be calculated.
+   *
+   * Additionally, it is possible to compute the variance along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Note that older browser may not like the variable name `var`. In that
+   * case, the function can be called as `math['var'](...)` instead of
+   * `math.var(...)`.
+   *
+   * Syntax:
+   *
+   *     math.variance(a, b, c, ...)
+   *     math.variance(A)
+   *     math.variance(A, normalization)
+   *     math.variance(A, dimension)
+   *     math.variance(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.variance(2, 4, 6)                     // returns 4
+   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667
+   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5
+   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4
+   *
+   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, std, sum
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the variance for a matrix
+   * @return {*} The variance
+   */
+  return typed(name, {
+    // variance([a, b, c, d, ...])
+    'Array | Matrix': function ArrayMatrix(array) {
+      return _var(array, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _var,
+    // variance([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+      return _varDim(array, dim, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _varDim,
+    // variance(a, b, c, d, ...)
+    '...': function _(args) {
+      return _var(args, DEFAULT_NORMALIZATION);
+    }
+  });
+  /**
+   * Recursively calculate the variance of an n-dimensional array
+   * @param {Array} array
+   * @param {string} normalization
+   *                        Determines how to normalize the variance:
+   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)
+   *                        - 'uncorrected' The sum of squared errors is divided by n
+   *                        - 'biased'      The sum of squared errors is divided by (n + 1)
+   * @return {number | BigNumber} variance
+   * @private
+   */
+
+  function _var(array, normalization) {
+    var sum;
+    var num = 0;
+
+    if (array.length === 0) {
+      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+    } // calculate the mean and number of elements
+
+
+    deepForEach(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw improveErrorMessage(err, 'variance', value);
+      }
+    });
+    if (num === 0) throw new Error('Cannot calculate variance of an empty array');
+    var mean = divide(sum, num); // calculate the variance
+
+    sum = undefined;
+    deepForEach(array, function (value) {
+      var diff = subtract(value, mean);
+      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff));
+    });
+
+    if (isNaN(sum)) {
+      return sum;
+    }
+
+    switch (normalization) {
+      case 'uncorrected':
+        return divide(sum, num);
+
+      case 'biased':
+        return divide(sum, num + 1);
+
+      case 'unbiased':
+        {
+          var zero = isBigNumber(sum) ? sum.mul(0) : 0;
+          return num === 1 ? zero : divide(sum, num - 1);
+        }
+
+      default:
+        throw new Error('Unknown normalization "' + normalization + '". ' + 'Choose "unbiased" (default), "uncorrected", or "biased".');
+    }
+  }
+
+  function _varDim(array, dim, normalization) {
+    try {
+      if (array.length === 0) {
+        throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+      }
+
+      return apply(array, dim, x => _var(x, normalization));
+    } catch (err) {
+      throw improveErrorMessage(err, 'variance');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/bin.js b/node_modules/mathjs/lib/esm/function/string/bin.js
new file mode 100644
index 0000000..6508032
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/bin.js
@@ -0,0 +1,44 @@
+import { factory } from '../../utils/factory.js';
+var name = 'bin';
+var dependencies = ['typed', 'format'];
+/**
+ * Format a number as binary.
+ *
+ * Syntax:
+ *
+ *    math.bin(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0b10"
+ *    math.bin(2)
+ *
+ * See also:
+ *
+ *    oct
+ *    hex
+ *
+ * @param {number} value    Value to be stringified
+ * @param {number} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+export var createBin = factory(name, dependencies, _ref => {
+  var {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      return format(n, {
+        notation: 'bin'
+      });
+    },
+    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {
+      return format(n, {
+        notation: 'bin',
+        wordSize: wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/format.js b/node_modules/mathjs/lib/esm/function/string/format.js
new file mode 100644
index 0000000..706d711
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/format.js
@@ -0,0 +1,132 @@
+import { format as formatString } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'format';
+var dependencies = ['typed'];
+export var createFormat = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Format a value of any type into a string.
+   *
+   * Syntax:
+   *
+   *    math.format(value)
+   *    math.format(value, options)
+   *    math.format(value, precision)
+   *    math.format(value, callback)
+   *
+   * Where:
+   *
+   *  - `value: *`
+   *    The value to be formatted
+   *  - `options: Object`
+   *    An object with formatting options. Available options:
+   *    - `notation: string`
+   *      Number notation. Choose from:
+   *      - 'fixed'
+   *        Always use regular number notation.
+   *        For example '123.40' and '14000000'
+   *      - 'exponential'
+   *        Always use exponential notation.
+   *        For example '1.234e+2' and '1.4e+7'
+   *      - 'engineering'
+   *        Always use engineering notation: always have exponential notation,
+   *        and select the exponent to be a multiple of 3.
+   *        For example '123.4e+0' and '14.0e+6'
+   *      - 'auto' (default)
+   *        Regular number notation for numbers having an absolute value between
+   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.
+   *        Lower bound is included, upper bound is excluded.
+   *        For example '123.4' and '1.4e7'.
+   *      - 'bin', 'oct, or 'hex'
+   *        Format the number using binary, octal, or hexadecimal notation.
+   *        For example '0b1101' and '0x10fe'.
+   *    - `wordSize: number`
+   *      The word size in bits to use for formatting in binary, octal, or
+   *      hexadecimal notation. To be used only with 'bin', 'oct', or 'hex'
+   *      values for 'notation' option. When this option is defined the value
+   *      is formatted as a signed twos complement integer of the given word
+   *      size and the size suffix is appended to the output.
+   *      For example format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+   *      Default value is undefined.
+   *    - `precision: number`
+   *      Limit the number of digits of the formatted value.
+   *      For regular numbers, must be a number between 0 and 16.
+   *      For bignumbers, the maximum depends on the configured precision,
+   *      see function `config()`.
+   *      In case of notations 'exponential', 'engineering', and 'auto', `precision`
+   *      defines the total number of significant digits returned.
+   *      In case of notation 'fixed', `precision` defines the number of
+   *      significant digits after the decimal point.
+   *      `precision` is undefined by default.
+   *    - `lowerExp: number`
+   *      Exponent determining the lower boundary for formatting a value with
+   *      an exponent when `notation='auto`. Default value is `-3`.
+   *    - `upperExp: number`
+   *      Exponent determining the upper boundary for formatting a value with
+   *      an exponent when `notation='auto`. Default value is `5`.
+   *    - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.
+   *      For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is
+   *      configured, and will output `0.(3)` when 'decimal' is configured.
+   *    - `truncate: number`. Specifies the maximum allowed length of the
+   *      returned string. If it would have been longer, the excess characters
+   *      are deleted and replaced with `'...'`.
+   * - `callback: function`
+   *   A custom formatting function, invoked for all numeric elements in `value`,
+   *   for example all elements of a matrix, or the real and imaginary
+   *   parts of a complex number. This callback can be used to override the
+   *   built-in numeric notation with any type of formatting. Function `callback`
+   *   is called with `value` as parameter and must return a string.
+   *
+   * When `value` is an Object:
+   *
+   * - When the object contains a property `format` being a function, this function
+   *   is invoked as `value.format(options)` and the result is returned.
+   * - When the object has its own `toString` method, this method is invoked
+   *   and the result is returned.
+   * - In other cases the function will loop over all object properties and
+   *   return JSON object notation like '{"a": 2, "b": 3}'.
+   *
+   * When value is a function:
+   *
+   * - When the function has a property `syntax`, it returns this
+   *   syntax description.
+   * - In other cases, a string `'function'` is returned.
+   *
+   * Examples:
+   *
+   *    math.format(6.4)                                        // returns '6.4'
+   *    math.format(1240000)                                    // returns '1.24e6'
+   *    math.format(1/3)                                        // returns '0.3333333333333333'
+   *    math.format(1/3, 3)                                     // returns '0.333'
+   *    math.format(21385, 2)                                   // returns '21000'
+   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'
+   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'
+   *    math.format(12400,{notation: 'engineering'})            // returns '12.400e+3'
+   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'
+   *
+   *    function formatCurrency(value) {
+   *      // return currency notation with two digits:
+   *      return '$' + value.toFixed(2)
+   *
+   *      // you could also use math.format inside the callback:
+   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})
+   *    }
+   *    math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'
+   *
+   * See also:
+   *
+   *    print
+   *
+   * @param {*} value                               Value to be stringified
+   * @param {Object | Function | number} [options]  Formatting options
+   * @return {string} The formatted value
+   */
+  return typed(name, {
+    any: formatString,
+    'any, Object | function | number': formatString
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/hex.js b/node_modules/mathjs/lib/esm/function/string/hex.js
new file mode 100644
index 0000000..912f66d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/hex.js
@@ -0,0 +1,44 @@
+import { factory } from '../../utils/factory.js';
+var name = 'hex';
+var dependencies = ['typed', 'format'];
+/**
+ * Format a number as hexadecimal.
+ *
+ * Syntax:
+ *
+ *    math.hex(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0xF0"
+ *    math.hex(240)
+ *
+ * See also:
+ *
+ *    oct
+ *    bin
+ *
+ * @param {number} value    Value to be stringified
+ * @param {number} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+export var createHex = factory(name, dependencies, _ref => {
+  var {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      return format(n, {
+        notation: 'hex'
+      });
+    },
+    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {
+      return format(n, {
+        notation: 'hex',
+        wordSize: wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/oct.js b/node_modules/mathjs/lib/esm/function/string/oct.js
new file mode 100644
index 0000000..eb62bdd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/oct.js
@@ -0,0 +1,44 @@
+import { factory } from '../../utils/factory.js';
+var name = 'oct';
+var dependencies = ['typed', 'format'];
+/**
+ * Format a number as octal.
+ *
+ * Syntax:
+ *
+ *    math.oct(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0o70"
+ *    math.oct(56)
+ *
+ * See also:
+ *
+ *    bin
+ *    hex
+ *
+ * @param {number} value    Value to be stringified
+ * @param {number} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+export var createOct = factory(name, dependencies, _ref => {
+  var {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function numberBigNumber(n) {
+      return format(n, {
+        notation: 'oct'
+      });
+    },
+    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {
+      return format(n, {
+        notation: 'oct',
+        wordSize: wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/print.js b/node_modules/mathjs/lib/esm/function/string/print.js
new file mode 100644
index 0000000..61a360c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/print.js
@@ -0,0 +1,90 @@
+import { format } from '../../utils/string.js';
+import { isString } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'print';
+var dependencies = ['typed'];
+export var createPrint = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Interpolate values into a string template.
+   *
+   * Syntax:
+   *
+   *     math.print(template, values)
+   *     math.print(template, values, precision)
+   *     math.print(template, values, options)
+   *
+   * Example usage:
+   *
+   *     // the following outputs: 'Lucy is 5 years old'
+   *     math.print('Lucy is $age years old', {age: 5})
+   *
+   *     // the following outputs: 'The value of pi is 3.141592654'
+   *     math.print('The value of pi is $pi', {pi: math.pi}, 10)
+   *
+   *     // the following outputs: 'hello Mary! The date is 2013-03-23'
+   *     math.print('Hello $user.name! The date is $date', {
+   *       user: {
+   *         name: 'Mary',
+   *       },
+   *       date: new Date(2013, 2, 23).toISOString().substring(0, 10)
+   *     })
+   *
+   *     // the following outputs: 'My favorite fruits are apples and bananas !'
+   *     math.print('My favorite fruits are $0 and $1 !', [
+   *       'apples',
+   *       'bananas'
+   *     ])
+   *
+   * See also:
+   *
+   *     format
+   *
+   * @param {string} template           A string containing variable placeholders.
+   * @param {Object | Array | Matrix}   values An object or array containing variables
+   *                                    which will be filled in in the template.
+   * @param {number | Object} [options] Formatting options,
+   *                                    or the number of digits to format numbers.
+   *                                    See function math.format for a description
+   *                                    of all options.
+   * @return {string} Interpolated string
+   */
+  return typed(name, {
+    // note: Matrix will be converted automatically to an Array
+    'string, Object | Array': _print,
+    'string, Object | Array, number | Object': _print
+  });
+});
+/**
+ * Interpolate values into a string template.
+ * @param {string} template
+ * @param {Object} values
+ * @param {number | Object} [options]
+ * @returns {string} Interpolated string
+ * @private
+ */
+
+function _print(template, values, options) {
+  return template.replace(/\$([\w.]+)/g, function (original, key) {
+    var keys = key.split('.');
+    var value = values[keys.shift()];
+
+    while (keys.length && value !== undefined) {
+      var k = keys.shift();
+      value = k ? value[k] : value + '.';
+    }
+
+    if (value !== undefined) {
+      if (!isString(value)) {
+        return format(value, options);
+      } else {
+        return value;
+      }
+    }
+
+    return original;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acos.js b/node_modules/mathjs/lib/esm/function/trigonometry/acos.js
new file mode 100644
index 0000000..9c08d16
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acos.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'acos';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAcos = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the inverse cosine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acos(x)
+   *
+   * Examples:
+   *
+   *    math.acos(0.5)           // returns number 1.0471975511965979
+   *    math.acos(math.cos(1.5)) // returns number 1.5
+   *
+   *    math.acos(2)             // returns Complex 0 + 1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    cos, atan, asin
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} The arc cosine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.acos(x);
+      } else {
+        return new Complex(x, 0).acos();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.acos();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.acos();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acosh.js b/node_modules/mathjs/lib/esm/function/trigonometry/acosh.js
new file mode 100644
index 0000000..6a04b76
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acosh.js
@@ -0,0 +1,56 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { acoshNumber } from '../../plain/number/index.js';
+var name = 'acosh';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAcosh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic arccos of a value,
+   * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acosh(x)
+   *
+   * Examples:
+   *
+   *    math.acosh(1.5)       // returns 0.9624236501192069
+   *
+   * See also:
+   *
+   *    cosh, asinh, atanh
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arccosine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 1 || config.predictable) {
+        return acoshNumber(x);
+      }
+
+      if (x <= -1) {
+        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);
+      }
+
+      return new Complex(x, 0).acosh();
+    },
+    Complex: function Complex(x) {
+      return x.acosh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.acosh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acot.js b/node_modules/mathjs/lib/esm/function/trigonometry/acot.js
new file mode 100644
index 0000000..344fb68
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acot.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { acotNumber } from '../../plain/number/index.js';
+var name = 'acot';
+var dependencies = ['typed', 'BigNumber'];
+export var createAcot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acot(x)
+   *
+   * Examples:
+   *
+   *    math.acot(0.5)           // returns number 0.4636476090008061
+   *    math.acot(math.cot(1.5)) // returns number 1.5
+   *
+   *    math.acot(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    cot, atan
+   *
+   * @param {number | Complex | Array | Matrix} x   Function input
+   * @return {number | Complex | Array | Matrix} The arc cotangent of x
+   */
+  return typed(name, {
+    number: acotNumber,
+    Complex: function Complex(x) {
+      return x.acot();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).atan();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acoth.js b/node_modules/mathjs/lib/esm/function/trigonometry/acoth.js
new file mode 100644
index 0000000..5324cf3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acoth.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { acothNumber } from '../../plain/number/index.js';
+var name = 'acoth';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAcoth = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic arccotangent of a value,
+   * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acoth(x)
+   *
+   * Examples:
+   *
+   *    math.acoth(0.5)       // returns 0.8047189562170503
+   *
+   * See also:
+   *
+   *    acsch, asech
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arccotangent of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 1 || x <= -1 || config.predictable) {
+        return acothNumber(x);
+      }
+
+      return new Complex(x, 0).acoth();
+    },
+    Complex: function Complex(x) {
+      return x.acoth();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).atanh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acsc.js b/node_modules/mathjs/lib/esm/function/trigonometry/acsc.js
new file mode 100644
index 0000000..006e9bf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acsc.js
@@ -0,0 +1,55 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { acscNumber } from '../../plain/number/index.js';
+var name = 'acsc';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAcsc = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acsc(x)
+   *
+   * Examples:
+   *
+   *    math.acsc(0.5)           // returns number 0.5235987755982989
+   *    math.acsc(math.csc(1.5)) // returns number ~1.5
+   *
+   *    math.acsc(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    csc, asin, asec
+   *
+   * @param {number | Complex | Array | Matrix} x   Function input
+   * @return {number | Complex | Array | Matrix} The arc cosecant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return acscNumber(x);
+      }
+
+      return new Complex(x, 0).acsc();
+    },
+    Complex: function Complex(x) {
+      return x.acsc();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).asin();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acsch.js b/node_modules/mathjs/lib/esm/function/trigonometry/acsch.js
new file mode 100644
index 0000000..7ad5737
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acsch.js
@@ -0,0 +1,45 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { acschNumber } from '../../plain/number/index.js';
+var name = 'acsch';
+var dependencies = ['typed', 'BigNumber'];
+export var createAcsch = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic arccosecant of a value,
+   * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acsch(x)
+   *
+   * Examples:
+   *
+   *    math.acsch(0.5)       // returns 1.4436354751788103
+   *
+   * See also:
+   *
+   *    asech, acoth
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arccosecant of x
+   */
+  return typed(name, {
+    number: acschNumber,
+    Complex: function Complex(x) {
+      return x.acsch();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).asinh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asec.js b/node_modules/mathjs/lib/esm/function/trigonometry/asec.js
new file mode 100644
index 0000000..c57f61a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asec.js
@@ -0,0 +1,55 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { asecNumber } from '../../plain/number/index.js';
+var name = 'asec';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAsec = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asec(x)
+   *
+   * Examples:
+   *
+   *    math.asec(0.5)           // returns 1.0471975511965979
+   *    math.asec(math.sec(1.5)) // returns 1.5
+   *
+   *    math.asec(2)             // returns 0 + 1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    acos, acot, acsc
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} The arc secant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return asecNumber(x);
+      }
+
+      return new Complex(x, 0).asec();
+    },
+    Complex: function Complex(x) {
+      return x.asec();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).acos();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asech.js b/node_modules/mathjs/lib/esm/function/trigonometry/asech.js
new file mode 100644
index 0000000..8a6e162
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asech.js
@@ -0,0 +1,60 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { asechNumber } from '../../plain/number/index.js';
+var name = 'asech';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAsech = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic arcsecant of a value,
+   * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asech(x)
+   *
+   * Examples:
+   *
+   *    math.asech(0.5)       // returns 1.3169578969248166
+   *
+   * See also:
+   *
+   *    acsch, acoth
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arcsecant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        var xInv = 1 / x;
+
+        if (xInv > 0 || config.predictable) {
+          return asechNumber(x);
+        }
+
+        var ret = Math.sqrt(xInv * xInv - 1);
+        return new Complex(Math.log(ret - xInv), Math.PI);
+      }
+
+      return new Complex(x, 0).asech();
+    },
+    Complex: function Complex(x) {
+      return x.asech();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).acosh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asin.js b/node_modules/mathjs/lib/esm/function/trigonometry/asin.js
new file mode 100644
index 0000000..5a900ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asin.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'asin';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAsin = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the inverse sine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asin(x)
+   *
+   * Examples:
+   *
+   *    math.asin(0.5)           // returns number 0.5235987755982989
+   *    math.asin(math.sin(1.5)) // returns number ~1.5
+   *
+   *    math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    sin, atan, acos
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} The arc sine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.asin(x);
+      } else {
+        return new Complex(x, 0).asin();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.asin();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.asin();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since asin(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asinh.js b/node_modules/mathjs/lib/esm/function/trigonometry/asinh.js
new file mode 100644
index 0000000..3e50fcf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asinh.js
@@ -0,0 +1,45 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { asinhNumber } from '../../plain/number/index.js';
+var name = 'asinh';
+var dependencies = ['typed'];
+export var createAsinh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic arcsine of a value,
+   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.asinh(x)
+   *
+   * Examples:
+   *
+   *    math.asinh(0.5)       // returns 0.48121182505960347
+   *
+   * See also:
+   *
+   *    acosh, atanh
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arcsine of x
+   */
+  return typed('asinh', {
+    number: asinhNumber,
+    Complex: function Complex(x) {
+      return x.asinh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.asinh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since asinh(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/atan.js b/node_modules/mathjs/lib/esm/function/trigonometry/atan.js
new file mode 100644
index 0000000..c81c5c2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/atan.js
@@ -0,0 +1,48 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'atan';
+var dependencies = ['typed'];
+export var createAtan = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the inverse tangent of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atan(x)
+   *
+   * Examples:
+   *
+   *    math.atan(0.5)           // returns number 0.4636476090008061
+   *    math.atan(math.tan(1.5)) // returns number 1.5
+   *
+   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    tan, asin, acos
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} The arc tangent of x
+   */
+  return typed('atan', {
+    number: function number(x) {
+      return Math.atan(x);
+    },
+    Complex: function Complex(x) {
+      return x.atan();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.atan();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since atan(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/atan2.js b/node_modules/mathjs/lib/esm/function/trigonometry/atan2.js
new file mode 100644
index 0000000..78d00ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/atan2.js
@@ -0,0 +1,125 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
+import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
+import { createAlgorithm09 } from '../../type/matrix/utils/algorithm09.js';
+import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
+import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'atan2';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];
+export var createAtan2 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    BigNumber,
+    DenseMatrix
+  } = _ref;
+  var algorithm02 = createAlgorithm02({
+    typed,
+    equalScalar
+  });
+  var algorithm03 = createAlgorithm03({
+    typed
+  });
+  var algorithm09 = createAlgorithm09({
+    typed,
+    equalScalar
+  });
+  var algorithm11 = createAlgorithm11({
+    typed,
+    equalScalar
+  });
+  var algorithm12 = createAlgorithm12({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Calculate the inverse tangent function with two arguments, y/x.
+   * By providing two arguments, the right quadrant of the computed angle can be
+   * determined.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atan2(y, x)
+   *
+   * Examples:
+   *
+   *    math.atan2(2, 2) / math.pi       // returns number 0.25
+   *
+   *    const angle = math.unit(60, 'deg') // returns Unit 60 deg
+   *    const x = math.cos(angle)
+   *    const y = math.sin(angle)
+   *
+   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    tan, atan, sin, cos
+   *
+   * @param {number | Array | Matrix} y  Second dimension
+   * @param {number | Array | Matrix} x  First dimension
+   * @return {number | Array | Matrix} Four-quadrant inverse tangent
+   */
+
+  return typed(name, {
+    'number, number': Math.atan2,
+    // Complex numbers doesn't seem to have a reasonable implementation of
+    // atan2(). Even Matlab removed the support, after they only calculated
+    // the atan only on base of the real part of the numbers and ignored the imaginary.
+    'BigNumber, BigNumber': function BigNumberBigNumber(y, x) {
+      return BigNumber.atan2(y, x);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm09(x, y, this, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      // mind the order of y and x!
+      return algorithm02(y, x, this, true);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm03(x, y, this, false);
+    },
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      return this(x, matrix(y));
+    },
+    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
+      return algorithm11(x, y, this, false);
+    },
+    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
+      return algorithm14(x, y, this, false);
+    },
+    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
+      // mind the order of y and x
+      return algorithm12(y, x, this, true);
+    },
+    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
+      // mind the order of y and x
+      return algorithm14(y, x, this, true);
+    },
+    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'number | BigNumber, Array': function numberBigNumberArray(x, y) {
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/atanh.js b/node_modules/mathjs/lib/esm/function/trigonometry/atanh.js
new file mode 100644
index 0000000..dc050d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/atanh.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { atanhNumber } from '../../plain/number/index.js';
+var name = 'atanh';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAtanh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic arctangent of a value,
+   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atanh(x)
+   *
+   * Examples:
+   *
+   *    math.atanh(0.5)       // returns 0.5493061443340549
+   *
+   * See also:
+   *
+   *    acosh, asinh
+   *
+   * @param {number | Complex | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic arctangent of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        return atanhNumber(x);
+      }
+
+      return new Complex(x, 0).atanh();
+    },
+    Complex: function Complex(x) {
+      return x.atanh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.atanh();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since atanh(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/cos.js b/node_modules/mathjs/lib/esm/function/trigonometry/cos.js
new file mode 100644
index 0000000..f458b92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/cos.js
@@ -0,0 +1,55 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'cos';
+var dependencies = ['typed'];
+export var createCos = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the cosine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cos(x)
+   *
+   * Examples:
+   *
+   *    math.cos(2)                      // returns number -0.4161468365471422
+   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475
+   *    math.cos(math.unit(180, 'deg'))  // returns number -1
+   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Cosine of x
+   */
+  return typed(name, {
+    number: Math.cos,
+    Complex: function Complex(x) {
+      return x.cos();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.cos();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cos is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/cosh.js b/node_modules/mathjs/lib/esm/function/trigonometry/cosh.js
new file mode 100644
index 0000000..a171162
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/cosh.js
@@ -0,0 +1,51 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { cosh as coshNumber } from '../../utils/number.js';
+var name = 'cosh';
+var dependencies = ['typed'];
+export var createCosh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic cosine of a value,
+   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cosh(x)
+   *
+   * Examples:
+   *
+   *    math.cosh(0.5)       // returns number 1.1276259652063807
+   *
+   * See also:
+   *
+   *    sinh, tanh
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic cosine of x
+   */
+  return typed(name, {
+    number: coshNumber,
+    Complex: function Complex(x) {
+      return x.cosh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.cosh();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cosh is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/cot.js b/node_modules/mathjs/lib/esm/function/trigonometry/cot.js
new file mode 100644
index 0000000..9930d09
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/cot.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { cotNumber } from '../../plain/number/index.js';
+var name = 'cot';
+var dependencies = ['typed', 'BigNumber'];
+export var createCot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.cot(x)
+   *
+   * Examples:
+   *
+   *    math.cot(2)      // returns number -0.45765755436028577
+   *    1 / math.tan(2)  // returns number -0.45765755436028577
+   *
+   * See also:
+   *
+   *    tan, sec, csc
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Cotangent of x
+   */
+  return typed(name, {
+    number: cotNumber,
+    Complex: function Complex(x) {
+      return x.cot();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.tan());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cot is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/coth.js b/node_modules/mathjs/lib/esm/function/trigonometry/coth.js
new file mode 100644
index 0000000..b18023f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/coth.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { cothNumber } from '../../plain/number/index.js';
+var name = 'coth';
+var dependencies = ['typed', 'BigNumber'];
+export var createCoth = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic cotangent of a value,
+   * defined as `coth(x) = 1 / tanh(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.coth(x)
+   *
+   * Examples:
+   *
+   *    // coth(x) = 1 / tanh(x)
+   *    math.coth(2)         // returns 1.0373147207275482
+   *    1 / math.tanh(2)     // returns 1.0373147207275482
+   *
+   * See also:
+   *
+   *    sinh, tanh, cosh
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic cotangent of x
+   */
+  return typed(name, {
+    number: cothNumber,
+    Complex: function Complex(x) {
+      return x.coth();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.tanh());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function coth is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/csc.js b/node_modules/mathjs/lib/esm/function/trigonometry/csc.js
new file mode 100644
index 0000000..161f476
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/csc.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { cscNumber } from '../../plain/number/index.js';
+var name = 'csc';
+var dependencies = ['typed', 'BigNumber'];
+export var createCsc = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.csc(x)
+   *
+   * Examples:
+   *
+   *    math.csc(2)      // returns number 1.099750170294617
+   *    1 / math.sin(2)  // returns number 1.099750170294617
+   *
+   * See also:
+   *
+   *    sin, sec, cot
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Cosecant of x
+   */
+  return typed(name, {
+    number: cscNumber,
+    Complex: function Complex(x) {
+      return x.csc();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.sin());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function csc is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/csch.js b/node_modules/mathjs/lib/esm/function/trigonometry/csch.js
new file mode 100644
index 0000000..1179bef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/csch.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { cschNumber } from '../../plain/number/index.js';
+var name = 'csch';
+var dependencies = ['typed', 'BigNumber'];
+export var createCsch = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic cosecant of a value,
+   * defined as `csch(x) = 1 / sinh(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.csch(x)
+   *
+   * Examples:
+   *
+   *    // csch(x) = 1/ sinh(x)
+   *    math.csch(0.5)       // returns 1.9190347513349437
+   *    1 / math.sinh(0.5)   // returns 1.9190347513349437
+   *
+   * See also:
+   *
+   *    sinh, sech, coth
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic cosecant of x
+   */
+  return typed(name, {
+    number: cschNumber,
+    Complex: function Complex(x) {
+      return x.csch();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.sinh());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function csch is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sec.js b/node_modules/mathjs/lib/esm/function/trigonometry/sec.js
new file mode 100644
index 0000000..46f6eee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sec.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { secNumber } from '../../plain/number/index.js';
+var name = 'sec';
+var dependencies = ['typed', 'BigNumber'];
+export var createSec = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sec(x)
+   *
+   * Examples:
+   *
+   *    math.sec(2)      // returns number -2.4029979617223822
+   *    1 / math.cos(2)  // returns number -2.4029979617223822
+   *
+   * See also:
+   *
+   *    cos, csc, cot
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Secant of x
+   */
+  return typed(name, {
+    number: secNumber,
+    Complex: function Complex(x) {
+      return x.sec();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.cos());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sec is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sech.js b/node_modules/mathjs/lib/esm/function/trigonometry/sech.js
new file mode 100644
index 0000000..c1739df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sech.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { sechNumber } from '../../plain/number/index.js';
+var name = 'sech';
+var dependencies = ['typed', 'BigNumber'];
+export var createSech = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic secant of a value,
+   * defined as `sech(x) = 1 / cosh(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sech(x)
+   *
+   * Examples:
+   *
+   *    // sech(x) = 1/ cosh(x)
+   *    math.sech(0.5)       // returns 0.886818883970074
+   *    1 / math.cosh(0.5)   // returns 0.886818883970074
+   *
+   * See also:
+   *
+   *    cosh, csch, coth
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Hyperbolic secant of x
+   */
+  return typed(name, {
+    number: sechNumber,
+    Complex: function Complex(x) {
+      return x.sech();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x.cosh());
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sech is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sin.js b/node_modules/mathjs/lib/esm/function/trigonometry/sin.js
new file mode 100644
index 0000000..e286bb1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sin.js
@@ -0,0 +1,56 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'sin';
+var dependencies = ['typed'];
+export var createSin = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the sine of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sin(x)
+   *
+   * Examples:
+   *
+   *    math.sin(2)                      // returns number 0.9092974268256813
+   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475
+   *    math.sin(math.unit(90, 'deg'))   // returns number 1
+   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Sine of x
+   */
+  return typed(name, {
+    number: Math.sin,
+    Complex: function Complex(x) {
+      return x.sin();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.sin();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sin is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sin(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sinh.js b/node_modules/mathjs/lib/esm/function/trigonometry/sinh.js
new file mode 100644
index 0000000..fdeb4eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sinh.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { sinhNumber } from '../../plain/number/index.js';
+var name = 'sinh';
+var dependencies = ['typed'];
+export var createSinh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic sine of a value,
+   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sinh(x)
+   *
+   * Examples:
+   *
+   *    math.sinh(0.5)       // returns number 0.5210953054937474
+   *
+   * See also:
+   *
+   *    cosh, tanh
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic sine of x
+   */
+  return typed(name, {
+    number: sinhNumber,
+    Complex: function Complex(x) {
+      return x.sinh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.sinh();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function sinh is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since sinh(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/tan.js b/node_modules/mathjs/lib/esm/function/trigonometry/tan.js
new file mode 100644
index 0000000..bb269a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/tan.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'tan';
+var dependencies = ['typed'];
+export var createTan = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.tan(x)
+   *
+   * Examples:
+   *
+   *    math.tan(0.5)                    // returns number 0.5463024898437905
+   *    math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905
+   *    math.tan(math.pi / 4)            // returns number 1
+   *    math.tan(math.unit(45, 'deg'))   // returns number 1
+   *
+   * See also:
+   *
+   *    atan, sin, cos
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Tangent of x
+   */
+  return typed(name, {
+    number: Math.tan,
+    Complex: function Complex(x) {
+      return x.tan();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.tan();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function tan is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since tan(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/tanh.js b/node_modules/mathjs/lib/esm/function/trigonometry/tanh.js
new file mode 100644
index 0000000..d91f276
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/tanh.js
@@ -0,0 +1,55 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { tanh as _tanh } from '../../utils/number.js';
+var name = 'tanh';
+var dependencies = ['typed'];
+export var createTanh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the hyperbolic tangent of a value,
+   * defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.tanh(x)
+   *
+   * Examples:
+   *
+   *    // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)
+   *    math.tanh(0.5)                   // returns 0.46211715726000974
+   *    math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974
+   *    1 / math.coth(0.5)               // returns 0.46211715726000974
+   *
+   * See also:
+   *
+   *    sinh, cosh, coth
+   *
+   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic tangent of x
+   */
+  return typed('tanh', {
+    number: _tanh,
+    Complex: function Complex(x) {
+      return x.tanh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.tanh();
+    },
+    Unit: function Unit(x) {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function tanh is no angle');
+      }
+
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since tanh(0) = 0
+      return deepMap(x, this, true);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/unit/to.js b/node_modules/mathjs/lib/esm/function/unit/to.js
new file mode 100644
index 0000000..8ad975e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/unit/to.js
@@ -0,0 +1,79 @@
+import { factory } from '../../utils/factory.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'to';
+var dependencies = ['typed', 'matrix'];
+export var createTo = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Change the unit of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.to(x, unit)
+   *
+   * Examples:
+   *
+   *    math.to(math.unit('2 inch'), 'cm')                   // returns Unit 5.08 cm
+   *    math.to(math.unit('2 inch'), math.unit(null, 'cm'))  // returns Unit 5.08 cm
+   *    math.to(math.unit(16, 'bytes'), 'bits')              // returns Unit 128 bits
+   *
+   * See also:
+   *
+   *    unit
+   *
+   * @param {Unit | Array | Matrix} x     The unit to be converted.
+   * @param {Unit | Array | Matrix} unit  New unit. Can be a string like "cm"
+   *                                      or a unit without value.
+   * @return {Unit | Array | Matrix} value with changed, fixed unit.
+   */
+
+  return typed(name, {
+    'Unit, Unit | string': function UnitUnitString(x, unit) {
+      return x.to(unit);
+    },
+    'Matrix, Matrix': function MatrixMatrix(x, y) {
+      // SparseMatrix does not support Units
+      return algorithm13(x, y, this);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'Matrix, any': function MatrixAny(x, y) {
+      // SparseMatrix does not support Units
+      return algorithm14(x, y, this, false);
+    },
+    'any, Matrix': function anyMatrix(x, y) {
+      // SparseMatrix does not support Units
+      return algorithm14(y, x, this, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, this, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, this, true).valueOf();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/clone.js b/node_modules/mathjs/lib/esm/function/utils/clone.js
new file mode 100644
index 0000000..75e18f4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/clone.js
@@ -0,0 +1,31 @@
+import { clone as objectClone } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+var name = 'clone';
+var dependencies = ['typed'];
+export var createClone = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Clone an object. Will make a deep copy of the data.
+   *
+   * Syntax:
+   *
+   *     math.clone(x)
+   *
+   * Examples:
+   *
+   *    math.clone(3.5)                   // returns number 3.5
+   *    math.clone(math.complex('2-4i') // returns Complex 2 - 4i
+   *    math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg
+   *    math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]
+   *    math.clone("hello world")         // returns string "hello world"
+   *
+   * @param {*} x   Object to be cloned
+   * @return {*} A clone of object x
+   */
+  return typed(name, {
+    any: objectClone
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..4e8d043
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+var name = 'hasNumericValue';
+var dependencies = ['typed', 'isNumeric'];
+export var createHasNumericValue = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isNumeric
+  } = _ref;
+
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * In case of a string, true is returned if the string contains a numeric value.
+   *
+   * Syntax:
+   *
+   *     math.hasNumericValue(x)
+   *
+   * Examples:
+   *
+   *    math.hasNumericValue(2)                     // returns true
+   *    math.hasNumericValue('2')                   // returns true
+   *    math.isNumeric('2')                         // returns false
+   *    math.hasNumericValue(0)                     // returns true
+   *    math.hasNumericValue(math.bignumber(500))   // returns true
+   *    math.hasNumericValue(math.fraction(4))      // returns true
+   *    math.hasNumericValue(math.complex('2-4i')   // returns false
+   *    math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, isNumeric
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    string: function string(x) {
+      return x.trim().length > 0 && !isNaN(Number(x));
+    },
+    any: function any(x) {
+      return isNumeric(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isInteger.js b/node_modules/mathjs/lib/esm/function/utils/isInteger.js
new file mode 100644
index 0000000..0d07651
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isInteger.js
@@ -0,0 +1,53 @@
+import { deepMap } from '../../utils/collection.js';
+import { isInteger as isIntegerNumber } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'isInteger';
+var dependencies = ['typed'];
+export var createIsInteger = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Test whether a value is an integer number.
+   * The function supports `number`, `BigNumber`, and `Fraction`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isInteger(x)
+   *
+   * Examples:
+   *
+   *    math.isInteger(2)                     // returns true
+   *    math.isInteger(0)                     // returns true
+   *    math.isInteger(0.5)                   // returns false
+   *    math.isInteger(math.bignumber(500))   // returns true
+   *    math.isInteger(math.fraction(4))      // returns true
+   *    math.isInteger('3')                   // returns true
+   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]
+   *    math.isInteger(math.complex('2-4i')   // throws an error
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isZero
+   *
+   * @param {number | BigNumber | Fraction | Array | Matrix} x   Value to be tested
+   * @return {boolean}  Returns true when `x` contains a numeric, integer value.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: isIntegerNumber,
+    // TODO: what to do with isInteger(add(0.1, 0.2))  ?
+    BigNumber: function BigNumber(x) {
+      return x.isInt();
+    },
+    Fraction: function Fraction(x) {
+      return x.d === 1 && isFinite(x.n);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isNaN.js b/node_modules/mathjs/lib/esm/function/utils/isNaN.js
new file mode 100644
index 0000000..d7a7e9d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isNaN.js
@@ -0,0 +1,58 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { isNaNNumber } from '../../plain/number/index.js';
+var name = 'isNaN';
+var dependencies = ['typed'];
+export var createIsNaN = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Test whether a value is NaN (not a number).
+   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNaN(x)
+   *
+   * Examples:
+   *
+   *    math.isNaN(3)                     // returns false
+   *    math.isNaN(NaN)                   // returns true
+   *    math.isNaN(0)                     // returns false
+   *    math.isNaN(math.bignumber(NaN))   // returns true
+   *    math.isNaN(math.bignumber(0))     // returns false
+   *    math.isNaN(math.fraction(-2, 5))  // returns false
+   *    math.isNaN('-2')                  // returns false
+   *    math.isNaN([2, 0, -3, NaN]')      // returns [false, false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isNegative, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is NaN.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: isNaNNumber,
+    BigNumber: function BigNumber(x) {
+      return x.isNaN();
+    },
+    Fraction: function Fraction(x) {
+      return false;
+    },
+    Complex: function Complex(x) {
+      return x.isNaN();
+    },
+    Unit: function Unit(x) {
+      return Number.isNaN(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, Number.isNaN);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isNegative.js b/node_modules/mathjs/lib/esm/function/utils/isNegative.js
new file mode 100644
index 0000000..3a0fdb5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isNegative.js
@@ -0,0 +1,55 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { isNegativeNumber } from '../../plain/number/index.js';
+var name = 'isNegative';
+var dependencies = ['typed'];
+export var createIsNegative = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Test whether a value is negative: smaller than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNegative(x)
+   *
+   * Examples:
+   *
+   *    math.isNegative(3)                     // returns false
+   *    math.isNegative(-2)                    // returns true
+   *    math.isNegative(0)                     // returns false
+   *    math.isNegative(-0)                    // returns false
+   *    math.isNegative(math.bignumber(2))     // returns false
+   *    math.isNegative(math.fraction(-2, 5))  // returns true
+   *    math.isNegative('-2')                  // returns true
+   *    math.isNegative([2, 0, -3]')           // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: isNegativeNumber,
+    BigNumber: function BigNumber(x) {
+      return x.isNeg() && !x.isZero() && !x.isNaN();
+    },
+    Fraction: function Fraction(x) {
+      return x.s < 0; // It's enough to decide on the sign
+    },
+    Unit: function Unit(x) {
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isNumeric.js b/node_modules/mathjs/lib/esm/function/utils/isNumeric.js
new file mode 100644
index 0000000..2c67dfc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isNumeric.js
@@ -0,0 +1,50 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'isNumeric';
+var dependencies = ['typed'];
+export var createIsNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNumeric(x)
+   *
+   * Examples:
+   *
+   *    math.isNumeric(2)                     // returns true
+   *    math.isNumeric('2')                   // returns false
+   *    math.hasNumericValue('2')             // returns true
+   *    math.isNumeric(0)                     // returns true
+   *    math.isNumeric(math.bignumber(500))   // returns true
+   *    math.isNumeric(math.fraction(4))      // returns true
+   *    math.isNumeric(math.complex('2-4i')   // returns false
+   *    math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, hasNumericValue
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, or `boolean`. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction | boolean': function numberBigNumberFractionBoolean() {
+      return true;
+    },
+    'Complex | Unit | string | null | undefined | Node': function ComplexUnitStringNullUndefinedNode() {
+      return false;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isPositive.js b/node_modules/mathjs/lib/esm/function/utils/isPositive.js
new file mode 100644
index 0000000..a88a4f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isPositive.js
@@ -0,0 +1,57 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { isPositiveNumber } from '../../plain/number/index.js';
+var name = 'isPositive';
+var dependencies = ['typed'];
+export var createIsPositive = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Test whether a value is positive: larger than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPositive(x)
+   *
+   * Examples:
+   *
+   *    math.isPositive(3)                     // returns true
+   *    math.isPositive(-2)                    // returns false
+   *    math.isPositive(0)                     // returns false
+   *    math.isPositive(-0)                    // returns false
+   *    math.isPositive(0.5)                   // returns true
+   *    math.isPositive(math.bignumber(2))     // returns true
+   *    math.isPositive(math.fraction(-2, 5))  // returns false
+   *    math.isPositive(math.fraction(1,3))    // returns false
+   *    math.isPositive('2')                   // returns true
+   *    math.isPositive([2, 0, -3])            // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: isPositiveNumber,
+    BigNumber: function BigNumber(x) {
+      return !x.isNeg() && !x.isZero() && !x.isNaN();
+    },
+    Fraction: function Fraction(x) {
+      return x.s > 0 && x.n > 0;
+    },
+    Unit: function Unit(x) {
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isPrime.js b/node_modules/mathjs/lib/esm/function/utils/isPrime.js
new file mode 100644
index 0000000..c069bf2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isPrime.js
@@ -0,0 +1,142 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'isPrime';
+var dependencies = ['typed'];
+export var createIsPrime = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Test whether a value is prime: has no divisors other than itself and one.
+   * The function supports type `number`, `bignumber`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPrime(x)
+   *
+   * Examples:
+   *
+   *    math.isPrime(3)                     // returns true
+   *    math.isPrime(-2)                    // returns false
+   *    math.isPrime(0)                     // returns false
+   *    math.isPrime(-0)                    // returns false
+   *    math.isPrime(0.5)                   // returns false
+   *    math.isPrime('2')                   // returns true
+   *    math.isPrime([2, 17, 100])           // returns [true, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x * 0 !== 0) {
+        return false;
+      }
+
+      if (x <= 3) {
+        return x > 1;
+      }
+
+      if (x % 2 === 0 || x % 3 === 0) {
+        return false;
+      }
+
+      for (var i = 5; i * i <= x; i += 6) {
+        if (x % i === 0 || x % (i + 2) === 0) {
+          return false;
+        }
+      }
+
+      return true;
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.toNumber() * 0 !== 0) {
+        return false;
+      }
+
+      if (n.lte(3)) return n.gt(1);
+      if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false;
+
+      if (n.lt(Math.pow(2, 32))) {
+        var x = n.toNumber();
+
+        for (var i = 5; i * i <= x; i += 6) {
+          if (x % i === 0 || x % (i + 2) === 0) {
+            return false;
+          }
+        }
+
+        return true;
+      }
+
+      function modPow(base, exponent, modulus) {
+        // exponent can be huge, use non-recursive variant
+        var accumulator = 1;
+
+        while (!exponent.eq(0)) {
+          if (exponent.mod(2).eq(0)) {
+            exponent = exponent.div(2);
+            base = base.mul(base).mod(modulus);
+          } else {
+            exponent = exponent.sub(1);
+            accumulator = base.mul(accumulator).mod(modulus);
+          }
+        }
+
+        return accumulator;
+      } // https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Deterministic_variants
+
+
+      var Decimal = n.constructor.clone({
+        precision: n.toFixed(0).length * 2
+      });
+      n = new Decimal(n);
+      var r = 0;
+      var d = n.sub(1);
+
+      while (d.mod(2).eq(0)) {
+        d = d.div(2);
+        r += 1;
+      }
+
+      var bases = null; // https://en.wikipedia.org/wiki/Miller–Rabin_primality_test#Testing_against_small_sets_of_bases
+
+      if (n.lt('3317044064679887385961981')) {
+        bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(x => x < n);
+      } else {
+        var max = Math.min(n.toNumber() - 2, Math.floor(2 * Math.pow(n.toFixed(0).length * Math.log(10), 2)));
+        bases = [];
+
+        for (var _i = 2; _i <= max; _i += 1) {
+          bases.push(max);
+        }
+      }
+
+      for (var _i2 = 0; _i2 < bases.length; _i2 += 1) {
+        var a = bases[_i2];
+        var adn = modPow(n.sub(n).add(a), d, n);
+
+        if (!adn.eq(1)) {
+          for (var _i3 = 0, _x = adn; !_x.eq(n.sub(1)); _i3 += 1, _x = _x.mul(_x).mod(n)) {
+            if (_i3 === r - 1) {
+              return false;
+            }
+          }
+        }
+      }
+
+      return true;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isZero.js b/node_modules/mathjs/lib/esm/function/utils/isZero.js
new file mode 100644
index 0000000..6a1d81b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isZero.js
@@ -0,0 +1,62 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { isZeroNumber } from '../../plain/number/index.js';
+var name = 'isZero';
+var dependencies = ['typed'];
+export var createIsZero = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Test whether a value is zero.
+   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,
+   * `Complex`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isZero(x)
+   *
+   * Examples:
+   *
+   *    math.isZero(0)                     // returns true
+   *    math.isZero(2)                     // returns false
+   *    math.isZero(0.5)                   // returns false
+   *    math.isZero(math.bignumber(0))     // returns true
+   *    math.isZero(math.fraction(0))      // returns true
+   *    math.isZero(math.fraction(1,3))    // returns false
+   *    math.isZero(math.complex('2 - 4i') // returns false
+   *    math.isZero(math.complex('0i')     // returns true
+   *    math.isZero('0')                   // returns true
+   *    math.isZero('2')                   // returns false
+   *    math.isZero([2, 0, -3]')           // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isInteger
+   *
+   * @param {number | BigNumber | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: isZeroNumber,
+    BigNumber: function BigNumber(x) {
+      return x.isZero();
+    },
+    Complex: function Complex(x) {
+      return x.re === 0 && x.im === 0;
+    },
+    Fraction: function Fraction(x) {
+      return x.d === 1 && x.n === 0;
+    },
+    Unit: function Unit(x) {
+      return this(x.value);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/numeric.js b/node_modules/mathjs/lib/esm/function/utils/numeric.js
new file mode 100644
index 0000000..7495816
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/numeric.js
@@ -0,0 +1,70 @@
+import { typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { noBignumber, noFraction } from '../../utils/noop.js';
+var name = 'numeric';
+var dependencies = ['number', '?bignumber', '?fraction'];
+export var createNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    number: _number,
+    bignumber,
+    fraction
+  } = _ref;
+  var validInputTypes = {
+    string: true,
+    number: true,
+    BigNumber: true,
+    Fraction: true
+  }; // Load the conversion functions for each output type
+
+  var validOutputTypes = {
+    number: x => _number(x),
+    BigNumber: bignumber ? x => bignumber(x) : noBignumber,
+    Fraction: fraction ? x => fraction(x) : noFraction
+  };
+  /**
+   * Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.
+   *
+   * Syntax:
+   *
+   *    math.numeric(x)
+   *
+   * Examples:
+   *
+   *    math.numeric('4')                           // returns number 4
+   *    math.numeric('4', 'number')                 // returns number 4
+   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4
+   *    math.numeric('4', 'Fraction')               // returns Fraction 4
+   *    math.numeric(4, 'Fraction')                 // returns Fraction 4
+   *    math.numeric(math.fraction(2, 5), 'number') // returns number 0.4
+   *
+   * See also:
+   *
+   *    number, fraction, bignumber, string, format
+   *
+   * @param {string | number | BigNumber | Fraction } value
+   *              A numeric value or a string containing a numeric value
+   * @param {string} outputType
+   *              Desired numeric output type.
+   *              Available values: 'number', 'BigNumber', or 'Fraction'
+   * @return {number | BigNumber | Fraction}
+   *              Returns an instance of the numeric in the requested type
+   */
+
+  return function numeric(value, outputType) {
+    var inputType = typeOf(value);
+
+    if (!(inputType in validInputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' of type "' + inputType + '"; valid input types are ' + Object.keys(validInputTypes).join(', '));
+    }
+
+    if (!(outputType in validOutputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' to type "' + outputType + '"; valid output types are ' + Object.keys(validOutputTypes).join(', '));
+    }
+
+    if (outputType === inputType) {
+      return value;
+    } else {
+      return validOutputTypes[outputType](value);
+    }
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/typeOf.js b/node_modules/mathjs/lib/esm/function/utils/typeOf.js
new file mode 100644
index 0000000..ff39c39
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/typeOf.js
@@ -0,0 +1,71 @@
+import { factory } from '../../utils/factory.js';
+import { typeOf as _typeOf } from '../../utils/is.js';
+var name = 'typeOf';
+var dependencies = ['typed'];
+export var createTypeOf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Determine the type of a variable.
+   *
+   * Function `typeOf` recognizes the following types of objects:
+   *
+   * Object                 | Returns       | Example
+   * ---------------------- | ------------- | ------------------------------------------
+   * null                   | `'null'`      | `math.typeOf(null)`
+   * number                 | `'number'`    | `math.typeOf(3.5)`
+   * boolean                | `'boolean'`   | `math.typeOf(true)`
+   * string                 | `'string'`    | `math.typeOf('hello world')`
+   * Array                  | `'Array'`     | `math.typeOf([1, 2, 3])`
+   * Date                   | `'Date'`      | `math.typeOf(new Date())`
+   * Function               | `'Function'`  | `math.typeOf(function () {})`
+   * Object                 | `'Object'`    | `math.typeOf({a: 2, b: 3})`
+   * RegExp                 | `'RegExp'`    | `math.typeOf(/a regexp/)`
+   * undefined              | `'undefined'` | `math.typeOf(undefined)`
+   * math.BigNumber         | `'BigNumber'` | `math.typeOf(math.bignumber('2.3e500'))`
+   * math.Chain             | `'Chain'`     | `math.typeOf(math.chain(2))`
+   * math.Complex           | `'Complex'`   | `math.typeOf(math.complex(2, 3))`
+   * math.Fraction          | `'Fraction'`  | `math.typeOf(math.fraction(1, 3))`
+   * math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`
+   * math.Help              | `'Help'`      | `math.typeOf(math.help('sqrt'))`
+   * math.Index             | `'Index'`     | `math.typeOf(math.index(1, 3))`
+   * math.Matrix            | `'Matrix'`    | `math.typeOf(math.matrix([[1,2], [3, 4]]))`
+   * math.Range             | `'Range'`     | `math.typeOf(math.range(0, 10))`
+   * math.ResultSet         | `'ResultSet'` | `math.typeOf(math.evaluate('a=2\nb=3'))`
+   * math.Unit              | `'Unit'`      | `math.typeOf(math.unit('45 deg'))`
+   * math.AccessorNode            | `'AccessorNode'`            | `math.typeOf(math.parse('A[2]'))`
+   * math.ArrayNode               | `'ArrayNode'`               | `math.typeOf(math.parse('[1,2,3]'))`
+   * math.AssignmentNode          | `'AssignmentNode'`          | `math.typeOf(math.parse('x=2'))`
+   * math.BlockNode               | `'BlockNode'`               | `math.typeOf(math.parse('a=2; b=3'))`
+   * math.ConditionalNode         | `'ConditionalNode'`         | `math.typeOf(math.parse('x<0 ? -x : x'))`
+   * math.ConstantNode            | `'ConstantNode'`            | `math.typeOf(math.parse('2.3'))`
+   * math.FunctionAssignmentNode  | `'FunctionAssignmentNode'`  | `math.typeOf(math.parse('f(x)=x^2'))`
+   * math.FunctionNode            | `'FunctionNode'`            | `math.typeOf(math.parse('sqrt(4)'))`
+   * math.IndexNode               | `'IndexNode'`               | `math.typeOf(math.parse('A[2]').index)`
+   * math.ObjectNode              | `'ObjectNode'`              | `math.typeOf(math.parse('{a:2}'))`
+   * math.ParenthesisNode         | `'ParenthesisNode'`         | `math.typeOf(math.parse('(2+3)'))`
+   * math.RangeNode               | `'RangeNode'`               | `math.typeOf(math.parse('1:10'))`
+   * math.SymbolNode              | `'SymbolNode'`              | `math.typeOf(math.parse('x'))`
+   *
+   * Syntax:
+   *
+   *    math.typeOf(x)
+   *
+   * Examples:
+   *
+   *    math.typeOf(3.5)                     // returns 'number'
+   *    math.typeOf(math.complex('2-4i'))    // returns 'Complex'
+   *    math.typeOf(math.unit('45 deg'))     // returns 'Unit'
+   *    math.typeOf('hello world')           // returns 'string'
+   *
+   * @param {*} x     The variable for which to test the type.
+   * @return {string} Returns the name of the type. Primitive types are lower case,
+   *                  non-primitive types are upper-camel-case.
+   *                  For example 'number', 'string', 'Array', 'Date'.
+   */
+  return typed(name, {
+    any: _typeOf
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/header.js b/node_modules/mathjs/lib/esm/header.js
new file mode 100644
index 0000000..5e852e8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/header.js
@@ -0,0 +1,26 @@
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * @version @@version
+ * @date    @@date
+ *
+ * @license
+ * Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License"); you may not
+ * use this file except in compliance with the License. You may obtain a copy
+ * of the License at
+ *
+ * https://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
+ * License for the specific language governing permissions and limitations under
+ * the License.
+ */
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/index.js b/node_modules/mathjs/lib/esm/index.js
new file mode 100644
index 0000000..7e74c6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/index.js
@@ -0,0 +1 @@
+export * from './entry/mainAny.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/json/replacer.js b/node_modules/mathjs/lib/esm/json/replacer.js
new file mode 100644
index 0000000..3853f2c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/json/replacer.js
@@ -0,0 +1,28 @@
+import { factory } from '../utils/factory.js';
+var name = 'replacer';
+var dependencies = [];
+export var createReplacer = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Stringify data types into their JSON representation.
+   * Most data types can be serialized using their `.toJSON` method,
+   * but not all, for example the number `Infinity`. For these cases you have
+   * to use the replacer. Example usage:
+   *
+   *     JSON.stringify([2, Infinity], math.replacer)
+   *
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the replaced object
+   */
+  return function replacer(key, value) {
+    // the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON
+    if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {
+      return {
+        mathjs: 'number',
+        value: String(value)
+      };
+    }
+
+    return value;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/json/reviver.js b/node_modules/mathjs/lib/esm/json/reviver.js
new file mode 100644
index 0000000..a2463cb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/json/reviver.js
@@ -0,0 +1,24 @@
+import { factory } from '../utils/factory.js';
+var name = 'reviver';
+var dependencies = ['classes'];
+export var createReviver = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    classes
+  } = _ref;
+
+  /**
+   * Instantiate mathjs data types from their JSON representation
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the revived object
+   */
+  return function reviver(key, value) {
+    var constructor = classes[value && value.mathjs];
+
+    if (constructor && typeof constructor.fromJSON === 'function') {
+      return constructor.fromJSON(value);
+    }
+
+    return value;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/number.js b/node_modules/mathjs/lib/esm/number.js
new file mode 100644
index 0000000..5181f6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/number.js
@@ -0,0 +1 @@
+export * from './entry/mainNumber.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/bignumber/arithmetic.js b/node_modules/mathjs/lib/esm/plain/bignumber/arithmetic.js
new file mode 100644
index 0000000..2cf9080
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/bignumber/arithmetic.js
@@ -0,0 +1,22 @@
+var signature1 = 'BigNumber';
+var signature2 = 'BigNumber, BigNumber';
+export function absBigNumber(a) {
+  return a.abs();
+}
+absBigNumber.signature = signature1;
+export function addBigNumber(a, b) {
+  return a.add(b);
+}
+addBigNumber.signature = signature2;
+export function subtractBigNumber(a, b) {
+  return a.sub(b);
+}
+subtractBigNumber.signature = signature2;
+export function multiplyBigNumber(a, b) {
+  return a.mul(b);
+}
+multiplyBigNumber.signature = signature2;
+export function divideBigNumber(a, b) {
+  return a.div(b);
+}
+divideBigNumber.signature = signature2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/bignumber/index.js b/node_modules/mathjs/lib/esm/plain/bignumber/index.js
new file mode 100644
index 0000000..5cea52a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/bignumber/index.js
@@ -0,0 +1,8 @@
+import Decimal from 'decimal.js';
+export * from './arithmetic.js'; // TODO: this is ugly. Instead, be able to pass your own isBigNumber function to typed?
+
+var BigNumber = Decimal.clone();
+BigNumber.prototype.isBigNumber = true;
+export function bignumber(x) {
+  return new BigNumber(x);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/arithmetic.js b/node_modules/mathjs/lib/esm/plain/number/arithmetic.js
new file mode 100644
index 0000000..3dbca72
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/arithmetic.js
@@ -0,0 +1,340 @@
+import { isInteger, log2, log10, cbrt, expm1, sign, toFixed, log1p } from '../../utils/number.js';
+var n1 = 'number';
+var n2 = 'number, number';
+export function absNumber(a) {
+  return Math.abs(a);
+}
+absNumber.signature = n1;
+export function addNumber(a, b) {
+  return a + b;
+}
+addNumber.signature = n2;
+export function subtractNumber(a, b) {
+  return a - b;
+}
+subtractNumber.signature = n2;
+export function multiplyNumber(a, b) {
+  return a * b;
+}
+multiplyNumber.signature = n2;
+export function divideNumber(a, b) {
+  return a / b;
+}
+divideNumber.signature = n2;
+export function unaryMinusNumber(x) {
+  return -x;
+}
+unaryMinusNumber.signature = n1;
+export function unaryPlusNumber(x) {
+  return x;
+}
+unaryPlusNumber.signature = n1;
+export function cbrtNumber(x) {
+  return cbrt(x);
+}
+cbrtNumber.signature = n1;
+export function ceilNumber(x) {
+  return Math.ceil(x);
+}
+ceilNumber.signature = n1;
+export function cubeNumber(x) {
+  return x * x * x;
+}
+cubeNumber.signature = n1;
+export function expNumber(x) {
+  return Math.exp(x);
+}
+expNumber.signature = n1;
+export function expm1Number(x) {
+  return expm1(x);
+}
+expm1Number.signature = n1;
+export function fixNumber(x) {
+  return x > 0 ? Math.floor(x) : Math.ceil(x);
+}
+fixNumber.signature = n1;
+export function floorNumber(x) {
+  return Math.floor(x);
+}
+floorNumber.signature = n1;
+/**
+ * Calculate gcd for numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the greatest common denominator of a and b
+ */
+
+export function gcdNumber(a, b) {
+  if (!isInteger(a) || !isInteger(b)) {
+    throw new Error('Parameters in function gcd must be integer numbers');
+  } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+
+
+  var r;
+
+  while (b !== 0) {
+    r = a % b;
+    a = b;
+    b = r;
+  }
+
+  return a < 0 ? -a : a;
+}
+gcdNumber.signature = n2;
+/**
+ * Calculate lcm for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the least common multiple of a and b
+ */
+
+export function lcmNumber(a, b) {
+  if (!isInteger(a) || !isInteger(b)) {
+    throw new Error('Parameters in function lcm must be integer numbers');
+  }
+
+  if (a === 0 || b === 0) {
+    return 0;
+  } // https://en.wikipedia.org/wiki/Euclidean_algorithm
+  // evaluate lcm here inline to reduce overhead
+
+
+  var t;
+  var prod = a * b;
+
+  while (b !== 0) {
+    t = b;
+    b = a % t;
+    a = t;
+  }
+
+  return Math.abs(prod / a);
+}
+lcmNumber.signature = n2;
+/**
+ * Calculate the logarithm of a value, optionally to a given base.
+ * @param {number} x
+ * @param {number | null | undefined} base
+ * @return {number}
+ */
+
+export function logNumber(x, y) {
+  if (y) {
+    return Math.log(x) / Math.log(y);
+  }
+
+  return Math.log(x);
+}
+/**
+ * Calculate the 10-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+export function log10Number(x) {
+  return log10(x);
+}
+log10Number.signature = n1;
+/**
+ * Calculate the 2-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+export function log2Number(x) {
+  return log2(x);
+}
+log2Number.signature = n1;
+/**
+ * Calculate the natural logarithm of a `number+1`
+ * @param {number} x
+ * @returns {number}
+ */
+
+export function log1pNumber(x) {
+  return log1p(x);
+}
+log1pNumber.signature = n1;
+/**
+ * Calculate the modulus of two numbers
+ * @param {number} x
+ * @param {number} y
+ * @returns {number} res
+ * @private
+ */
+
+export function modNumber(x, y) {
+  if (y > 0) {
+    // We don't use JavaScript's % operator here as this doesn't work
+    // correctly for x < 0 and x === 0
+    // see https://en.wikipedia.org/wiki/Modulo_operation
+    return x - y * Math.floor(x / y);
+  } else if (y === 0) {
+    return x;
+  } else {
+    // y < 0
+    // TODO: implement mod for a negative divisor
+    throw new Error('Cannot calculate mod for a negative divisor');
+  }
+}
+modNumber.signature = n2;
+/**
+ * Calculate the nth root of a, solve x^root == a
+ * http://rosettacode.org/wiki/Nth_root#JavaScript
+ * @param {number} a
+ * @param {number} root
+ * @private
+ */
+
+export function nthRootNumber(a, root) {
+  var inv = root < 0;
+
+  if (inv) {
+    root = -root;
+  }
+
+  if (root === 0) {
+    throw new Error('Root must be non-zero');
+  }
+
+  if (a < 0 && Math.abs(root) % 2 !== 1) {
+    throw new Error('Root must be odd when a is negative.');
+  } // edge cases zero and infinity
+
+
+  if (a === 0) {
+    return inv ? Infinity : 0;
+  }
+
+  if (!isFinite(a)) {
+    return inv ? 0 : a;
+  }
+
+  var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,
+  // so (-1) ^ (1/root) = -1
+
+  x = a < 0 ? -x : x;
+  return inv ? 1 / x : x; // Very nice algorithm, but fails with nthRoot(-2, 3).
+  // Newton's method has some well-known problems at times:
+  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis
+
+  /*
+  let x = 1 // Initial guess
+  let xPrev = 1
+  let i = 0
+  const iMax = 10000
+  do {
+    const delta = (a / Math.pow(x, root - 1) - x) / root
+    xPrev = x
+    x = x + delta
+    i++
+  }
+  while (xPrev !== x && i < iMax)
+   if (xPrev !== x) {
+    throw new Error('Function nthRoot failed to converge')
+  }
+   return inv ? 1 / x : x
+  */
+}
+nthRootNumber.signature = n2;
+export function signNumber(x) {
+  return sign(x);
+}
+signNumber.signature = n1;
+export function sqrtNumber(x) {
+  return Math.sqrt(x);
+}
+sqrtNumber.signature = n1;
+export function squareNumber(x) {
+  return x * x;
+}
+squareNumber.signature = n1;
+/**
+ * Calculate xgcd for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @return {number} result
+ * @private
+ */
+
+export function xgcdNumber(a, b) {
+  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+  var t; // used to swap two variables
+
+  var q; // quotient
+
+  var r; // remainder
+
+  var x = 0;
+  var lastx = 1;
+  var y = 1;
+  var lasty = 0;
+
+  if (!isInteger(a) || !isInteger(b)) {
+    throw new Error('Parameters in function xgcd must be integer numbers');
+  }
+
+  while (b) {
+    q = Math.floor(a / b);
+    r = a - q * b;
+    t = x;
+    x = lastx - q * x;
+    lastx = t;
+    t = y;
+    y = lasty - q * y;
+    lasty = t;
+    a = b;
+    b = r;
+  }
+
+  var res;
+
+  if (a < 0) {
+    res = [-a, -lastx, -lasty];
+  } else {
+    res = [a, a ? lastx : 0, lasty];
+  }
+
+  return res;
+}
+xgcdNumber.signature = n2;
+/**
+ * Calculates the power of x to y, x^y, for two numbers.
+ * @param {number} x
+ * @param {number} y
+ * @return {number} res
+ */
+
+export function powNumber(x, y) {
+  // x^Infinity === 0 if -1 < x < 1
+  // A real number 0 is returned instead of complex(0)
+  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+    return 0;
+  }
+
+  return Math.pow(x, y);
+}
+powNumber.signature = n2;
+/**
+ * round a number to the given number of decimals, or to zero if decimals is
+ * not provided
+ * @param {number} value
+ * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)
+ * @return {number} roundedValue
+ */
+
+export function roundNumber(value) {
+  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  return parseFloat(toFixed(value, decimals));
+}
+roundNumber.signature = n2;
+/**
+ * Calculate the norm of a number, the absolute value.
+ * @param {number} x
+ * @return {number}
+ */
+
+export function normNumber(x) {
+  return Math.abs(x);
+}
+normNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/bitwise.js b/node_modules/mathjs/lib/esm/plain/number/bitwise.js
new file mode 100644
index 0000000..2f55ff9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/bitwise.js
@@ -0,0 +1,59 @@
+import { isInteger } from '../../utils/number.js';
+var n1 = 'number';
+var n2 = 'number, number';
+export function bitAndNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+
+  return x & y;
+}
+bitAndNumber.signature = n2;
+export function bitNotNumber(x) {
+  if (!isInteger(x)) {
+    throw new Error('Integer expected in function bitNot');
+  }
+
+  return ~x;
+}
+bitNotNumber.signature = n1;
+export function bitOrNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function bitOr');
+  }
+
+  return x | y;
+}
+bitOrNumber.signature = n2;
+export function bitXorNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function bitXor');
+  }
+
+  return x ^ y;
+}
+bitXorNumber.signature = n2;
+export function leftShiftNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function leftShift');
+  }
+
+  return x << y;
+}
+leftShiftNumber.signature = n2;
+export function rightArithShiftNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+
+  return x >> y;
+}
+rightArithShiftNumber.signature = n2;
+export function rightLogShiftNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function rightLogShift');
+  }
+
+  return x >>> y;
+}
+rightLogShiftNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/combinations.js b/node_modules/mathjs/lib/esm/plain/number/combinations.js
new file mode 100644
index 0000000..3abfc9b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/combinations.js
@@ -0,0 +1,39 @@
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+export function combinationsNumber(n, k) {
+  if (!isInteger(n) || n < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+
+  if (!isInteger(k) || k < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+
+  if (k > n) {
+    throw new TypeError('k must be less than or equal to n');
+  }
+
+  var nMinusk = n - k;
+  var answer = 1;
+  var firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;
+  var nextdivisor = 2;
+  var lastdivisor = k < nMinusk ? k : nMinusk; // balance multiplications and divisions to try to keep intermediate values
+  // in exact-integer range as long as possible
+
+  for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {
+    answer *= nextnumerator;
+
+    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {
+      answer /= nextdivisor;
+      ++nextdivisor;
+    }
+  } // for big n, k, floating point may have caused weirdness in remainder
+
+
+  if (nextdivisor <= lastdivisor) {
+    answer /= product(nextdivisor, lastdivisor);
+  }
+
+  return answer;
+}
+combinationsNumber.signature = 'number, number';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/constants.js b/node_modules/mathjs/lib/esm/plain/number/constants.js
new file mode 100644
index 0000000..a544965
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/constants.js
@@ -0,0 +1,4 @@
+export var pi = Math.PI;
+export var tau = 2 * Math.PI;
+export var e = Math.E;
+export var phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/index.js b/node_modules/mathjs/lib/esm/plain/number/index.js
new file mode 100644
index 0000000..769d9fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/index.js
@@ -0,0 +1,9 @@
+export * from './arithmetic.js';
+export * from './bitwise.js';
+export * from './combinations.js';
+export * from './constants.js';
+export * from './logical.js';
+export * from './relational.js';
+export * from './probability.js';
+export * from './trigonometry.js';
+export * from './utils.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/logical.js b/node_modules/mathjs/lib/esm/plain/number/logical.js
new file mode 100644
index 0000000..61f2d60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/logical.js
@@ -0,0 +1,18 @@
+var n1 = 'number';
+var n2 = 'number, number';
+export function notNumber(x) {
+  return !x;
+}
+notNumber.signature = n1;
+export function orNumber(x, y) {
+  return !!(x || y);
+}
+orNumber.signature = n2;
+export function xorNumber(x, y) {
+  return !!x !== !!y;
+}
+xorNumber.signature = n2;
+export function andNumber(x, y) {
+  return !!(x && y);
+}
+andNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/probability.js b/node_modules/mathjs/lib/esm/plain/number/probability.js
new file mode 100644
index 0000000..4f65c63
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/probability.js
@@ -0,0 +1,49 @@
+/* eslint-disable no-loss-of-precision */
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+export function gammaNumber(n) {
+  var x;
+
+  if (isInteger(n)) {
+    if (n <= 0) {
+      return isFinite(n) ? Infinity : NaN;
+    }
+
+    if (n > 171) {
+      return Infinity; // Will overflow
+    }
+
+    return product(1, n - 1);
+  }
+
+  if (n < 0.5) {
+    return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n));
+  }
+
+  if (n >= 171.35) {
+    return Infinity; // will overflow
+  }
+
+  if (n > 85.0) {
+    // Extended Stirling Approx
+    var twoN = n * n;
+    var threeN = twoN * n;
+    var fourN = threeN * n;
+    var fiveN = fourN * n;
+    return Math.sqrt(2 * Math.PI / n) * Math.pow(n / Math.E, n) * (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) - 571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) + 5246819 / (75246796800 * fiveN * n));
+  }
+
+  --n;
+  x = gammaP[0];
+
+  for (var i = 1; i < gammaP.length; ++i) {
+    x += gammaP[i] / (n + i);
+  }
+
+  var t = n + gammaG + 0.5;
+  return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x;
+}
+gammaNumber.signature = 'number'; // TODO: comment on the variables g and p
+
+export var gammaG = 4.7421875;
+export var gammaP = [0.99999999999999709182, 57.156235665862923517, -59.597960355475491248, 14.136097974741747174, -0.49191381609762019978, 0.33994649984811888699e-4, 0.46523628927048575665e-4, -0.98374475304879564677e-4, 0.15808870322491248884e-3, -0.21026444172410488319e-3, 0.21743961811521264320e-3, -0.16431810653676389022e-3, 0.84418223983852743293e-4, -0.26190838401581408670e-4, 0.36899182659531622704e-5];
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/relational.js b/node_modules/mathjs/lib/esm/plain/number/relational.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/lib/esm/plain/number/trigonometry.js b/node_modules/mathjs/lib/esm/plain/number/trigonometry.js
new file mode 100644
index 0000000..6a49a62
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/trigonometry.js
@@ -0,0 +1,112 @@
+import { acosh, asinh, atanh, cosh, sign, sinh, tanh } from '../../utils/number.js';
+var n1 = 'number';
+var n2 = 'number, number';
+export function acosNumber(x) {
+  return Math.acos(x);
+}
+acosNumber.signature = n1;
+export function acoshNumber(x) {
+  return acosh(x);
+}
+acoshNumber.signature = n1;
+export function acotNumber(x) {
+  return Math.atan(1 / x);
+}
+acotNumber.signature = n1;
+export function acothNumber(x) {
+  return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;
+}
+acothNumber.signature = n1;
+export function acscNumber(x) {
+  return Math.asin(1 / x);
+}
+acscNumber.signature = n1;
+export function acschNumber(x) {
+  var xInv = 1 / x;
+  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));
+}
+acschNumber.signature = n1;
+export function asecNumber(x) {
+  return Math.acos(1 / x);
+}
+asecNumber.signature = n1;
+export function asechNumber(x) {
+  var xInv = 1 / x;
+  var ret = Math.sqrt(xInv * xInv - 1);
+  return Math.log(ret + xInv);
+}
+asechNumber.signature = n1;
+export function asinNumber(x) {
+  return Math.asin(x);
+}
+asinNumber.signature = n1;
+export function asinhNumber(x) {
+  return asinh(x);
+}
+asinhNumber.signature = n1;
+export function atanNumber(x) {
+  return Math.atan(x);
+}
+atanNumber.signature = n1;
+export function atan2Number(y, x) {
+  return Math.atan2(y, x);
+}
+atan2Number.signature = n2;
+export function atanhNumber(x) {
+  return atanh(x);
+}
+atanhNumber.signature = n1;
+export function cosNumber(x) {
+  return Math.cos(x);
+}
+cosNumber.signature = n1;
+export function coshNumber(x) {
+  return cosh(x);
+}
+coshNumber.signature = n1;
+export function cotNumber(x) {
+  return 1 / Math.tan(x);
+}
+cotNumber.signature = n1;
+export function cothNumber(x) {
+  var e = Math.exp(2 * x);
+  return (e + 1) / (e - 1);
+}
+cothNumber.signature = n1;
+export function cscNumber(x) {
+  return 1 / Math.sin(x);
+}
+cscNumber.signature = n1;
+export function cschNumber(x) {
+  // consider values close to zero (+/-)
+  if (x === 0) {
+    return Number.POSITIVE_INFINITY;
+  } else {
+    return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * sign(x);
+  }
+}
+cschNumber.signature = n1;
+export function secNumber(x) {
+  return 1 / Math.cos(x);
+}
+secNumber.signature = n1;
+export function sechNumber(x) {
+  return 2 / (Math.exp(x) + Math.exp(-x));
+}
+sechNumber.signature = n1;
+export function sinNumber(x) {
+  return Math.sin(x);
+}
+sinNumber.signature = n1;
+export function sinhNumber(x) {
+  return sinh(x);
+}
+sinhNumber.signature = n1;
+export function tanNumber(x) {
+  return Math.tan(x);
+}
+tanNumber.signature = n1;
+export function tanhNumber(x) {
+  return tanh(x);
+}
+tanhNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/utils.js b/node_modules/mathjs/lib/esm/plain/number/utils.js
new file mode 100644
index 0000000..fec97d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/utils.js
@@ -0,0 +1,22 @@
+import { isInteger } from '../../utils/number.js';
+var n1 = 'number';
+export function isIntegerNumber(x) {
+  return isInteger(x);
+}
+isIntegerNumber.signature = n1;
+export function isNegativeNumber(x) {
+  return x < 0;
+}
+isNegativeNumber.signature = n1;
+export function isPositiveNumber(x) {
+  return x > 0;
+}
+isPositiveNumber.signature = n1;
+export function isZeroNumber(x) {
+  return x === 0;
+}
+isZeroNumber.signature = n1;
+export function isNaNNumber(x) {
+  return Number.isNaN(x);
+}
+isNaNNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js b/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js
new file mode 100644
index 0000000..de3ba54
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js
@@ -0,0 +1,60 @@
+import Decimal from 'decimal.js';
+import { factory } from '../../utils/factory.js';
+var name = 'BigNumber';
+var dependencies = ['?on', 'config'];
+export var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    on,
+    config
+  } = _ref;
+  var BigNumber = Decimal.clone({
+    precision: config.precision,
+    modulo: Decimal.EUCLID
+  });
+  BigNumber.prototype = Object.create(BigNumber.prototype);
+  /**
+   * Attach type information
+   */
+
+  BigNumber.prototype.type = 'BigNumber';
+  BigNumber.prototype.isBigNumber = true;
+  /**
+   * Get a JSON representation of a BigNumber containing
+   * type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "BigNumber", "value": "0.2"}`
+   */
+
+  BigNumber.prototype.toJSON = function () {
+    return {
+      mathjs: 'BigNumber',
+      value: this.toString()
+    };
+  };
+  /**
+   * Instantiate a BigNumber from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "BigNumber", "value": "0.2"}`
+   * @return {BigNumber}
+   */
+
+
+  BigNumber.fromJSON = function (json) {
+    return new BigNumber(json.value);
+  };
+
+  if (on) {
+    // listen for changed in the configuration, automatically apply changed precision
+    on('config', function (curr, prev) {
+      if (curr.precision !== prev.precision) {
+        BigNumber.config({
+          precision: curr.precision
+        });
+      }
+    });
+  }
+
+  return BigNumber;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js b/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js
new file mode 100644
index 0000000..2bf1141
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js
@@ -0,0 +1,82 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'bignumber';
+var dependencies = ['typed', 'BigNumber'];
+export var createBignumber = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber
+  } = _ref;
+
+  /**
+   * Create a BigNumber, which can store numbers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to BigNumber.
+   *
+   * Syntax:
+   *
+   *    math.bignumber(x)
+   *
+   * Examples:
+   *
+   *    0.1 + 0.2                                  // returns number 0.30000000000000004
+   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3
+   *
+   *
+   *    7.2e500                                    // returns number Infinity
+   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500
+   *
+   * See also:
+   *
+   *    boolean, complex, index, matrix, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | Array | Matrix | boolean | null} [value]  Value for the big number,
+   *                                                    0 by default.
+   * @returns {BigNumber} The created bignumber
+   */
+  return typed('bignumber', {
+    '': function _() {
+      return new BigNumber(0);
+    },
+    number: function number(x) {
+      // convert to string to prevent errors in case of >15 digits
+      return new BigNumber(x + '');
+    },
+    string: function string(x) {
+      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+
+      if (wordSizeSuffixMatch) {
+        // x has a word size suffix
+        var size = wordSizeSuffixMatch[2];
+        var n = BigNumber(wordSizeSuffixMatch[1]);
+        var twoPowSize = new BigNumber(2).pow(Number(size));
+
+        if (n.gt(twoPowSize.sub(1))) {
+          throw new SyntaxError("String \"".concat(x, "\" is out of range"));
+        }
+
+        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);
+
+        if (n.gte(twoPowSizeSubOne)) {
+          return n.sub(twoPowSize);
+        } else {
+          return n;
+        }
+      }
+
+      return new BigNumber(x);
+    },
+    BigNumber: function BigNumber(x) {
+      // we assume a BigNumber is immutable
+      return x;
+    },
+    Fraction: function Fraction(x) {
+      return new BigNumber(x.n).div(x.d).times(x.s);
+    },
+    null: function _null(x) {
+      return new BigNumber(0);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/boolean.js b/node_modules/mathjs/lib/esm/type/boolean.js
new file mode 100644
index 0000000..1e04195
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/boolean.js
@@ -0,0 +1,76 @@
+import { factory } from '../utils/factory.js';
+import { deepMap } from '../utils/collection.js';
+var name = 'boolean';
+var dependencies = ['typed'];
+export var createBoolean = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Create a boolean or convert a string or number to a boolean.
+   * In case of a number, `true` is returned for non-zero numbers, and `false` in
+   * case of zero.
+   * Strings can be `'true'` or `'false'`, or can contain a number.
+   * When value is a matrix, all elements will be converted to boolean.
+   *
+   * Syntax:
+   *
+   *    math.boolean(x)
+   *
+   * Examples:
+   *
+   *    math.boolean(0)     // returns false
+   *    math.boolean(1)     // returns true
+   *    math.boolean(-3)     // returns true
+   *    math.boolean('true')     // returns true
+   *    math.boolean('false')     // returns false
+   *    math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]
+   *
+   * See also:
+   *
+   *    bignumber, complex, index, matrix, string, unit
+   *
+   * @param {string | number | boolean | Array | Matrix | null} value  A value of any type
+   * @return {boolean | Array | Matrix} The boolean value
+   */
+  return typed(name, {
+    '': function _() {
+      return false;
+    },
+    boolean: function boolean(x) {
+      return x;
+    },
+    number: function number(x) {
+      return !!x;
+    },
+    null: function _null(x) {
+      return false;
+    },
+    BigNumber: function BigNumber(x) {
+      return !x.isZero();
+    },
+    string: function string(x) {
+      // try case insensitive
+      var lcase = x.toLowerCase();
+
+      if (lcase === 'true') {
+        return true;
+      } else if (lcase === 'false') {
+        return false;
+      } // test whether value is a valid number
+
+
+      var num = Number(x);
+
+      if (x !== '' && !isNaN(num)) {
+        return !!num;
+      }
+
+      throw new Error('Cannot convert "' + x + '" to a boolean');
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/chain/Chain.js b/node_modules/mathjs/lib/esm/type/chain/Chain.js
new file mode 100644
index 0000000..e466e95
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/chain/Chain.js
@@ -0,0 +1,213 @@
+import { isChain } from '../../utils/is.js';
+import { format } from '../../utils/string.js';
+import { hasOwnProperty, lazy } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Chain';
+var dependencies = ['?on', 'math'];
+export var createChainClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    on,
+    math
+  } = _ref;
+
+  /**
+   * @constructor Chain
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing chain.done(), which will return
+   * the final value.
+   *
+   * The Chain has a number of special functions:
+   * - done()             Finalize the chained operation and return the
+   *                      chain's value.
+   * - valueOf()          The same as done()
+   * - toString()         Returns a string representation of the chain's value.
+   *
+   * @param {*} [value]
+   */
+  function Chain(value) {
+    if (!(this instanceof Chain)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (isChain(value)) {
+      this.value = value.value;
+    } else {
+      this.value = value;
+    }
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Chain.prototype.type = 'Chain';
+  Chain.prototype.isChain = true;
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method valueOf()
+   * @returns {*} value
+   */
+
+  Chain.prototype.done = function () {
+    return this.value;
+  };
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method done()
+   * @returns {*} value
+   */
+
+
+  Chain.prototype.valueOf = function () {
+    return this.value;
+  };
+  /**
+   * Get a string representation of the value in the chain
+   * @returns {string}
+   */
+
+
+  Chain.prototype.toString = function () {
+    return format(this.value);
+  };
+  /**
+   * Get a JSON representation of the chain
+   * @returns {Object}
+   */
+
+
+  Chain.prototype.toJSON = function () {
+    return {
+      mathjs: 'Chain',
+      value: this.value
+    };
+  };
+  /**
+   * Instantiate a Chain from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "Chain", value: ...}`,
+   *                       where mathjs is optional
+   * @returns {Chain}
+   */
+
+
+  Chain.fromJSON = function (json) {
+    return new Chain(json.value);
+  };
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {Function} fn      The function to be proxied
+   *                           If fn is no function, it is silently ignored.
+   * @private
+   */
+
+
+  function createProxy(name, fn) {
+    if (typeof fn === 'function') {
+      Chain.prototype[name] = chainify(fn);
+    }
+  }
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {function} resolver   The function resolving with the
+   *                              function to be proxied
+   * @private
+   */
+
+
+  function createLazyProxy(name, resolver) {
+    lazy(Chain.prototype, name, function outerResolver() {
+      var fn = resolver();
+
+      if (typeof fn === 'function') {
+        return chainify(fn);
+      }
+
+      return undefined; // if not a function, ignore
+    });
+  }
+  /**
+   * Make a function chainable
+   * @param {function} fn
+   * @return {Function} chain function
+   * @private
+   */
+
+
+  function chainify(fn) {
+    return function () {
+      var args = [this.value]; // `this` will be the context of a Chain instance
+
+      for (var i = 0; i < arguments.length; i++) {
+        args[i + 1] = arguments[i];
+      }
+
+      return new Chain(fn.apply(fn, args));
+    };
+  }
+  /**
+   * Create a proxy for a single method, or an object with multiple methods.
+   * Example usage:
+   *
+   *   Chain.createProxy('add', function add (x, y) {...})
+   *   Chain.createProxy({
+   *     add:      function add (x, y) {...},
+   *     subtract: function subtract (x, y) {...}
+   *   }
+   *
+   * @param {string | Object} arg0   A name (string), or an object with
+   *                                 functions
+   * @param {*} [arg1]               A function, when arg0 is a name
+   */
+
+
+  Chain.createProxy = function (arg0, arg1) {
+    if (typeof arg0 === 'string') {
+      // createProxy(name, value)
+      createProxy(arg0, arg1);
+    } else {
+      var _loop = function _loop(_name) {
+        if (hasOwnProperty(arg0, _name) && excludedNames[_name] === undefined) {
+          createLazyProxy(_name, () => arg0[_name]);
+        }
+      };
+
+      // createProxy(values)
+      for (var _name in arg0) {
+        _loop(_name);
+      }
+    }
+  };
+
+  var excludedNames = {
+    expression: true,
+    docs: true,
+    type: true,
+    classes: true,
+    json: true,
+    error: true,
+    isChain: true // conflicts with the property isChain of a Chain instance
+
+  }; // create proxy for everything that is in math.js
+
+  Chain.createProxy(math); // register on the import event, automatically add a proxy for every imported function.
+
+  if (on) {
+    on('import', function (name, resolver, path) {
+      if (!path) {
+        // an imported function (not a data type or something special)
+        createLazyProxy(name, resolver);
+      }
+    });
+  }
+
+  return Chain;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/chain/function/chain.js b/node_modules/mathjs/lib/esm/type/chain/function/chain.js
new file mode 100644
index 0000000..a69d3b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/chain/function/chain.js
@@ -0,0 +1,53 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'chain';
+var dependencies = ['typed', 'Chain'];
+export var createChain = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Chain
+  } = _ref;
+
+  /**
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing `chain.done()`, which returns
+   * the final value.
+   *
+   * The chain has a number of special functions:
+   *
+   * - `done()`     Finalize the chain and return the chain's value.
+   * - `valueOf()`  The same as `done()`
+   * - `toString()` Executes `math.format()` onto the chain's value, returning
+   *                a string representation of the value.
+   *
+   * Syntax:
+   *
+   *    math.chain(value)
+   *
+   * Examples:
+   *
+   *     math.chain(3)
+   *         .add(4)
+   *         .subtract(2)
+   *         .done()     // 5
+   *
+   *     math.chain( [[1, 2], [3, 4]] )
+   *         .subset(math.index(0, 0), 8)
+   *         .multiply(3)
+   *         .done()     // [[24, 6], [9, 12]]
+   *
+   * @param {*} [value]   A value of any type on which to start a chained operation.
+   * @return {math.Chain} The created chain
+   */
+  return typed(name, {
+    '': function _() {
+      return new Chain();
+    },
+    any: function any(value) {
+      return new Chain(value);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/complex/Complex.js b/node_modules/mathjs/lib/esm/type/complex/Complex.js
new file mode 100644
index 0000000..7c9f03d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/complex/Complex.js
@@ -0,0 +1,210 @@
+import Complex from 'complex.js';
+import { format } from '../../utils/number.js';
+import { isNumber, isUnit } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Complex';
+var dependencies = [];
+export var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Attach type information
+   */
+  Complex.prototype.type = 'Complex';
+  Complex.prototype.isComplex = true;
+  /**
+   * Get a JSON representation of the complex number
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Complex", "re": 2, "im": 3}`
+   */
+
+  Complex.prototype.toJSON = function () {
+    return {
+      mathjs: 'Complex',
+      re: this.re,
+      im: this.im
+    };
+  };
+  /*
+   * Return the value of the complex number in polar notation
+   * The angle phi will be set in the interval of [-pi, pi].
+   * @return {{r: number, phi: number}} Returns and object with properties r and phi.
+   */
+
+
+  Complex.prototype.toPolar = function () {
+    return {
+      r: this.abs(),
+      phi: this.arg()
+    };
+  };
+  /**
+   * Get a string representation of the complex number,
+   * with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string} str
+   */
+
+
+  Complex.prototype.format = function (options) {
+    var str = '';
+    var im = this.im;
+    var re = this.re;
+    var strRe = format(this.re, options);
+    var strIm = format(this.im, options); // round either re or im when smaller than the configured precision
+
+    var precision = isNumber(options) ? options : options ? options.precision : null;
+
+    if (precision !== null) {
+      var epsilon = Math.pow(10, -precision);
+
+      if (Math.abs(re / im) < epsilon) {
+        re = 0;
+      }
+
+      if (Math.abs(im / re) < epsilon) {
+        im = 0;
+      }
+    }
+
+    if (im === 0) {
+      // real value
+      str = strRe;
+    } else if (re === 0) {
+      // purely complex value
+      if (im === 1) {
+        str = 'i';
+      } else if (im === -1) {
+        str = '-i';
+      } else {
+        str = strIm + 'i';
+      }
+    } else {
+      // complex value
+      if (im < 0) {
+        if (im === -1) {
+          str = strRe + ' - i';
+        } else {
+          str = strRe + ' - ' + strIm.substring(1) + 'i';
+        }
+      } else {
+        if (im === 1) {
+          str = strRe + ' + i';
+        } else {
+          str = strRe + ' + ' + strIm + 'i';
+        }
+      }
+    }
+
+    return str;
+  };
+  /**
+   * Create a complex number from polar coordinates
+   *
+   * Usage:
+   *
+   *     Complex.fromPolar(r: number, phi: number) : Complex
+   *     Complex.fromPolar({r: number, phi: number}) : Complex
+   *
+   * @param {*} args...
+   * @return {Complex}
+   */
+
+
+  Complex.fromPolar = function (args) {
+    switch (arguments.length) {
+      case 1:
+        {
+          var arg = arguments[0];
+
+          if (typeof arg === 'object') {
+            return Complex(arg);
+          } else {
+            throw new TypeError('Input has to be an object with r and phi keys.');
+          }
+        }
+
+      case 2:
+        {
+          var r = arguments[0];
+          var phi = arguments[1];
+
+          if (isNumber(r)) {
+            if (isUnit(phi) && phi.hasBase('ANGLE')) {
+              // convert unit to a number in radians
+              phi = phi.toNumber('rad');
+            }
+
+            if (isNumber(phi)) {
+              return new Complex({
+                r: r,
+                phi: phi
+              });
+            }
+
+            throw new TypeError('Phi is not a number nor an angle unit.');
+          } else {
+            throw new TypeError('Radius r is not a number.');
+          }
+        }
+
+      default:
+        throw new SyntaxError('Wrong number of arguments in function fromPolar');
+    }
+  };
+
+  Complex.prototype.valueOf = Complex.prototype.toString;
+  /**
+   * Create a Complex number from a JSON object
+   * @param {Object} json  A JSON Object structured as
+   *                       {"mathjs": "Complex", "re": 2, "im": 3}
+   *                       All properties are optional, default values
+   *                       for `re` and `im` are 0.
+   * @return {Complex} Returns a new Complex number
+   */
+
+  Complex.fromJSON = function (json) {
+    return new Complex(json);
+  };
+  /**
+   * Compare two complex numbers, `a` and `b`:
+   *
+   * - Returns 1 when the real part of `a` is larger than the real part of `b`
+   * - Returns -1 when the real part of `a` is smaller than the real part of `b`
+   * - Returns 1 when the real parts are equal
+   *   and the imaginary part of `a` is larger than the imaginary part of `b`
+   * - Returns -1 when the real parts are equal
+   *   and the imaginary part of `a` is smaller than the imaginary part of `b`
+   * - Returns 0 when both real and imaginary parts are equal.
+   *
+   * @params {Complex} a
+   * @params {Complex} b
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+
+
+  Complex.compare = function (a, b) {
+    if (a.re > b.re) {
+      return 1;
+    }
+
+    if (a.re < b.re) {
+      return -1;
+    }
+
+    if (a.im > b.im) {
+      return 1;
+    }
+
+    if (a.im < b.im) {
+      return -1;
+    }
+
+    return 0;
+  };
+
+  return Complex;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/complex/function/complex.js b/node_modules/mathjs/lib/esm/type/complex/function/complex.js
new file mode 100644
index 0000000..479915f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/complex/function/complex.js
@@ -0,0 +1,90 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'complex';
+var dependencies = ['typed', 'Complex'];
+export var createComplex = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Complex
+  } = _ref;
+
+  /**
+   * Create a complex value or convert a value to a complex value.
+   *
+   * Syntax:
+   *
+   *     math.complex()                           // creates a complex value with zero
+   *                                              // as real and imaginary part.
+   *     math.complex(re : number, im : string)   // creates a complex value with provided
+   *                                              // values for real and imaginary part.
+   *     math.complex(re : number)                // creates a complex value with provided
+   *                                              // real value and zero imaginary part.
+   *     math.complex(complex : Complex)          // clones the provided complex value.
+   *     math.complex(arg : string)               // parses a string into a complex value.
+   *     math.complex(array : Array)              // converts the elements of the array
+   *                                              // or matrix element wise into a
+   *                                              // complex value.
+   *     math.complex({re: number, im: number})   // creates a complex value with provided
+   *                                              // values for real an imaginary part.
+   *     math.complex({r: number, phi: number})   // creates a complex value with provided
+   *                                              // polar coordinates
+   *
+   * Examples:
+   *
+   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i
+   *    a.re = 5                          // a = Complex 5 - 4i
+   *    const i = a.im                    // Number -4
+   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i
+   *    const c = math.complex()          // Complex 0 + 0i
+   *    const d = math.add(a, b)          // Complex 5 + 2i
+   *
+   * See also:
+   *
+   *    bignumber, boolean, index, matrix, number, string, unit
+   *
+   * @param {* | Array | Matrix} [args]
+   *            Arguments specifying the real and imaginary part of the complex number
+   * @return {Complex | Array | Matrix} Returns a complex value
+   */
+  return typed('complex', {
+    '': function _() {
+      return Complex.ZERO;
+    },
+    number: function number(x) {
+      return new Complex(x, 0);
+    },
+    'number, number': function numberNumber(re, im) {
+      return new Complex(re, im);
+    },
+    // TODO: this signature should be redundant
+    'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {
+      return new Complex(re.toNumber(), im.toNumber());
+    },
+    Fraction: function Fraction(x) {
+      return new Complex(x.valueOf(), 0);
+    },
+    Complex: function Complex(x) {
+      return x.clone();
+    },
+    string: function string(x) {
+      return Complex(x); // for example '2 + 3i'
+    },
+    null: function _null(x) {
+      return Complex(0);
+    },
+    Object: function Object(x) {
+      if ('re' in x && 'im' in x) {
+        return new Complex(x.re, x.im);
+      }
+
+      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {
+        return new Complex(x);
+      }
+
+      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/fraction/Fraction.js b/node_modules/mathjs/lib/esm/type/fraction/Fraction.js
new file mode 100644
index 0000000..4dc1f47
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/fraction/Fraction.js
@@ -0,0 +1,39 @@
+import Fraction from 'fraction.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Fraction';
+var dependencies = [];
+export var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Attach type information
+   */
+  Fraction.prototype.type = 'Fraction';
+  Fraction.prototype.isFraction = true;
+  /**
+   * Get a JSON representation of a Fraction containing type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Fraction", "n": 3, "d": 8}`
+   */
+
+  Fraction.prototype.toJSON = function () {
+    return {
+      mathjs: 'Fraction',
+      n: this.s * this.n,
+      d: this.d
+    };
+  };
+  /**
+   * Instantiate a Fraction from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "Fraction", "n": 3, "d": 8}`
+   * @return {BigNumber}
+   */
+
+
+  Fraction.fromJSON = function (json) {
+    return new Fraction(json);
+  };
+
+  return Fraction;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js b/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js
new file mode 100644
index 0000000..bf778e5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js
@@ -0,0 +1,78 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'fraction';
+var dependencies = ['typed', 'Fraction'];
+export var createFraction = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Fraction
+  } = _ref;
+
+  /**
+   * Create a fraction or convert a value to a fraction.
+   *
+   * With one numeric argument, produces the closest rational approximation to the
+   * input.
+   * With two arguments, the first is the numerator and the second is the denominator,
+   * and creates the corresponding fraction. Both numerator and denominator must be
+   * integers.
+   * With one object argument, looks for the integer numerator as the value of property
+   * 'n' and the integer denominator as the value of property 'd'.
+   * With a matrix argument, creates a matrix of the same shape with entries
+   * converted into fractions.
+   *
+   * Syntax:
+   *     math.fraction(value)
+   *     math.fraction(numerator, denominator)
+   *     math.fraction({n: numerator, d: denominator})
+   *     math.fraction(matrix: Array | Matrix)
+   *
+   * Examples:
+   *
+   *     math.fraction(6.283)             // returns Fraction 6283/1000
+   *     math.fraction(1, 3)              // returns Fraction 1/3
+   *     math.fraction('2/3')             // returns Fraction 2/3
+   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3
+   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]
+   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer
+   *
+   * See also:
+   *
+   *    bignumber, number, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]
+   *            Arguments specifying the value, or numerator and denominator of
+   *            the fraction
+   * @return {Fraction | Array | Matrix} Returns a fraction
+   */
+  return typed('fraction', {
+    number: function number(x) {
+      if (!isFinite(x) || isNaN(x)) {
+        throw new Error(x + ' cannot be represented as a fraction');
+      }
+
+      return new Fraction(x);
+    },
+    string: function string(x) {
+      return new Fraction(x);
+    },
+    'number, number': function numberNumber(numerator, denominator) {
+      return new Fraction(numerator, denominator);
+    },
+    null: function _null(x) {
+      return new Fraction(0);
+    },
+    BigNumber: function BigNumber(x) {
+      return new Fraction(x.toString());
+    },
+    Fraction: function Fraction(x) {
+      return x; // fractions are immutable
+    },
+    Object: function Object(x) {
+      return new Fraction(x);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js b/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js
new file mode 100644
index 0000000..19c6beb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js
@@ -0,0 +1,1010 @@
+import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';
+import { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex } from '../../utils/array.js';
+import { format } from '../../utils/string.js';
+import { isInteger } from '../../utils/number.js';
+import { clone, deepStrictEqual } from '../../utils/object.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { factory } from '../../utils/factory.js';
+var name = 'DenseMatrix';
+var dependencies = ['Matrix'];
+export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Matrix
+  } = _ref;
+
+  /**
+   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.
+   * @class DenseMatrix
+   * @enum {{ value, index: number[] }}
+   */
+  function DenseMatrix(data, datatype) {
+    if (!(this instanceof DenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (datatype && !isString(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+
+    if (isMatrix(data)) {
+      // check data is a DenseMatrix
+      if (data.type === 'DenseMatrix') {
+        // clone data & size
+        this._data = clone(data._data);
+        this._size = clone(data._size);
+        this._datatype = datatype || data._datatype;
+      } else {
+        // build data from existing matrix
+        this._data = data.toArray();
+        this._size = data.size();
+        this._datatype = datatype || data._datatype;
+      }
+    } else if (data && isArray(data.data) && isArray(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size; // verify the dimensions of the array
+
+      validate(this._data, this._size);
+      this._datatype = datatype || data.datatype;
+    } else if (isArray(data)) {
+      // replace nested Matrices with Arrays
+      this._data = preprocess(data); // get the dimensions of the array
+
+      this._size = arraySize(this._data); // verify the dimensions of the array, TODO: compute size while processing array
+
+      validate(this._data, this._size); // data type unknown
+
+      this._datatype = datatype;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+    }
+  }
+
+  DenseMatrix.prototype = new Matrix();
+  /**
+   * Create a new DenseMatrix
+   */
+
+  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+  /**
+   * Attach type information
+   */
+
+
+  DenseMatrix.prototype.type = 'DenseMatrix';
+  DenseMatrix.prototype.isDenseMatrix = true;
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf DenseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+
+  DenseMatrix.prototype.getDataType = function () {
+    return getArrayDataType(this._data, typeOf);
+  };
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()  // retrieve storage format
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The storage format.
+   */
+
+
+  DenseMatrix.prototype.storage = function () {
+    return 'dense';
+  };
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()   // retrieve matrix datatype
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The datatype.
+   */
+
+
+  DenseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+  /**
+   * Create a new DenseMatrix
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+
+
+  DenseMatrix.prototype.create = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof DenseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+
+  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    switch (arguments.length) {
+      case 1:
+        return _get(this, index);
+      // intentional fall through
+
+      case 2:
+      case 3:
+        return _set(this, index, replacement, defaultValue);
+
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+  /**
+   * Get a single element from the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+
+
+  DenseMatrix.prototype.get = function (index) {
+    if (!isArray(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length !== this._size.length) {
+      throw new DimensionError(index.length, this._size.length);
+    } // check index
+
+
+    for (var x = 0; x < index.length; x++) {
+      validateIndex(index[x], this._size[x]);
+    }
+
+    var data = this._data;
+
+    for (var i = 0, ii = index.length; i < ii; i++) {
+      var indexI = index[i];
+      validateIndex(indexI, data.length);
+      data = data[indexI];
+    }
+
+    return data;
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {DenseMatrix} self
+   */
+
+
+  DenseMatrix.prototype.set = function (index, value, defaultValue) {
+    if (!isArray(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length < this._size.length) {
+      throw new DimensionError(index.length, this._size.length, '<');
+    }
+
+    var i, ii, indexI; // enlarge matrix when needed
+
+    var size = index.map(function (i) {
+      return i + 1;
+    });
+
+    _fit(this, size, defaultValue); // traverse over the dimensions
+
+
+    var data = this._data;
+
+    for (i = 0, ii = index.length - 1; i < ii; i++) {
+      indexI = index[i];
+      validateIndex(indexI, data.length);
+      data = data[indexI];
+    } // set new value
+
+
+    indexI = index[index.length - 1];
+    validateIndex(indexI, data.length);
+    data[indexI] = value;
+    return this;
+  };
+  /**
+   * Get a submatrix of this matrix
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index   Zero-based index
+   * @private
+   */
+
+
+  function _get(matrix, index) {
+    if (!isIndex(index)) {
+      throw new TypeError('Invalid index');
+    }
+
+    var isScalar = index.isScalar();
+
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(index.min());
+    } else {
+      // validate dimensions
+      var size = index.size();
+
+      if (size.length !== matrix._size.length) {
+        throw new DimensionError(size.length, matrix._size.length);
+      } // validate if any of the ranges in the index is out of range
+
+
+      var min = index.min();
+      var max = index.max();
+
+      for (var i = 0, ii = matrix._size.length; i < ii; i++) {
+        validateIndex(min[i], matrix._size[i]);
+        validateIndex(max[i], matrix._size[i]);
+      } // retrieve submatrix
+      // TODO: more efficient when creating an empty matrix and setting _data and _size manually
+
+
+      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);
+    }
+  }
+  /**
+   * Recursively get a submatrix of a multi dimensional matrix.
+   * Index is not checked for correct number or length of dimensions.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @param {number} dims   Total number of dimensions
+   * @param {number} dim    Current dimension
+   * @return {Array} submatrix
+   * @private
+   */
+
+
+  function _getSubmatrix(data, index, dims, dim) {
+    var last = dim === dims - 1;
+    var range = index.dimension(dim);
+
+    if (last) {
+      return range.map(function (i) {
+        validateIndex(i, data.length);
+        return data[i];
+      }).valueOf();
+    } else {
+      return range.map(function (i) {
+        validateIndex(i, data.length);
+        var child = data[i];
+        return _getSubmatrix(child, index, dims, dim + 1);
+      }).valueOf();
+    }
+  }
+  /**
+   * Replace a submatrix in this matrix
+   * Indexes are zero-based.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index
+   * @param {DenseMatrix | Array | *} submatrix
+   * @param {*} defaultValue          Default value, filled in on new entries when
+   *                                  the matrix is resized.
+   * @return {DenseMatrix} matrix
+   * @private
+   */
+
+
+  function _set(matrix, index, submatrix, defaultValue) {
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    } // get index size and check whether the index contains a single value
+
+
+    var iSize = index.size();
+    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed
+
+    var sSize;
+
+    if (isMatrix(submatrix)) {
+      sSize = submatrix.size();
+      submatrix = submatrix.valueOf();
+    } else {
+      sSize = arraySize(submatrix);
+    }
+
+    if (isScalar) {
+      // set a scalar
+      // check whether submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      }
+
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // set a submatrix
+      // validate dimensions
+      if (iSize.length < matrix._size.length) {
+        throw new DimensionError(iSize.length, matrix._size.length, '<');
+      }
+
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        var i = 0;
+        var outer = 0;
+
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        } // unsqueeze both outer and inner dimensions
+
+
+        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);
+      } // check whether the size of the submatrix matches the index size
+
+
+      if (!deepStrictEqual(iSize, sSize)) {
+        throw new DimensionError(iSize, sSize, '>');
+      } // enlarge matrix when needed
+
+
+      var size = index.max().map(function (i) {
+        return i + 1;
+      });
+
+      _fit(matrix, size, defaultValue); // insert the sub matrix
+
+
+      var dims = iSize.length;
+      var dim = 0;
+
+      _setSubmatrix(matrix._data, index, submatrix, dims, dim);
+    }
+
+    return matrix;
+  }
+  /**
+   * Replace a submatrix of a multi dimensional matrix.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @param {Array} submatrix
+   * @param {number} dims   Total number of dimensions
+   * @param {number} dim
+   * @private
+   */
+
+
+  function _setSubmatrix(data, index, submatrix, dims, dim) {
+    var last = dim === dims - 1;
+    var range = index.dimension(dim);
+
+    if (last) {
+      range.forEach(function (dataIndex, subIndex) {
+        validateIndex(dataIndex);
+        data[dataIndex] = submatrix[subIndex[0]];
+      });
+    } else {
+      range.forEach(function (dataIndex, subIndex) {
+        validateIndex(dataIndex);
+
+        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);
+      });
+    }
+  }
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof DenseMatrix
+   * @param {number[] || Matrix} size The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!isCollection(size)) {
+      throw new TypeError('Array or Matrix expected');
+    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+
+
+    var sizeArray = size.valueOf().map(value => {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    }); // matrix to resize
+
+    var m = copy ? this.clone() : this; // resize matrix
+
+    return _resize(m, sizeArray, defaultValue);
+  };
+
+  function _resize(matrix, size, defaultValue) {
+    // check size
+    if (size.length === 0) {
+      // first value in matrix
+      var v = matrix._data; // go deep
+
+      while (isArray(v)) {
+        v = v[0];
+      }
+
+      return v;
+    } // resize matrix
+
+
+    matrix._size = size.slice(0); // copy the array
+
+    matrix._data = resize(matrix._data, matrix._size, defaultValue); // return matrix
+
+    return matrix;
+  }
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof DenseMatrix
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+
+
+  DenseMatrix.prototype.reshape = function (size, copy) {
+    var m = copy ? this.clone() : this;
+    m._data = reshape(m._data, size);
+
+    var currentLength = m._size.reduce((length, size) => length * size);
+
+    m._size = processSizesWildcard(size, currentLength);
+    return m;
+  };
+  /**
+   * Enlarge the matrix when it is smaller than given size.
+   * If the matrix is larger or equal sized, nothing is done.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix           The matrix to be resized
+   * @param {number[]} size
+   * @param {*} defaultValue          Default value, filled in on new entries.
+   * @private
+   */
+
+
+  function _fit(matrix, size, defaultValue) {
+    var // copy the array
+    newSize = matrix._size.slice(0);
+
+    var changed = false; // add dimensions when needed
+
+    while (newSize.length < size.length) {
+      newSize.push(0);
+      changed = true;
+    } // enlarge size when needed
+
+
+    for (var i = 0, ii = size.length; i < ii; i++) {
+      if (size[i] > newSize[i]) {
+        newSize[i] = size[i];
+        changed = true;
+      }
+    }
+
+    if (changed) {
+      // resize only when size is changed
+      _resize(matrix, newSize, defaultValue);
+    }
+  }
+  /**
+   * Create a clone of the matrix
+   * @memberof DenseMatrix
+   * @return {DenseMatrix} clone
+   */
+
+
+  DenseMatrix.prototype.clone = function () {
+    var m = new DenseMatrix({
+      data: clone(this._data),
+      size: clone(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof DenseMatrix
+   * @returns {number[]} size
+   */
+
+
+  DenseMatrix.prototype.size = function () {
+    return this._size.slice(0); // return a clone of _size
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   *
+   * @return {DenseMatrix} matrix
+   */
+
+
+  DenseMatrix.prototype.map = function (callback) {
+    // matrix instance
+    var me = this;
+
+    var recurse = function recurse(value, index) {
+      if (isArray(value)) {
+        return value.map(function (child, i) {
+          return recurse(child, index.concat(i));
+        });
+      } else {
+        return callback(value, index, me);
+      }
+    }; // determine the new datatype when the original matrix has datatype defined
+    // TODO: should be done in matrix constructor instead
+
+
+    var data = recurse(this._data, []);
+    var datatype = this._datatype !== undefined ? getArrayDataType(data, typeOf) : undefined;
+    return new DenseMatrix(data, datatype);
+  };
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   */
+
+
+  DenseMatrix.prototype.forEach = function (callback) {
+    // matrix instance
+    var me = this;
+
+    var recurse = function recurse(value, index) {
+      if (isArray(value)) {
+        value.forEach(function (child, i) {
+          recurse(child, index.concat(i));
+        });
+      } else {
+        callback(value, index, me);
+      }
+    };
+
+    recurse(this._data, []);
+  };
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+
+
+  DenseMatrix.prototype[Symbol.iterator] = function* () {
+    var recurse = function* recurse(value, index) {
+      if (isArray(value)) {
+        for (var i = 0; i < value.length; i++) {
+          yield* recurse(value[i], index.concat(i));
+        }
+      } else {
+        yield {
+          value,
+          index
+        };
+      }
+    };
+
+    yield* recurse(this._data, []);
+  };
+  /**
+   * Returns an array containing the rows of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+
+
+  DenseMatrix.prototype.rows = function () {
+    var result = [];
+    var s = this.size();
+
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+
+    var data = this._data;
+
+    for (var row of data) {
+      result.push(new DenseMatrix([row], this._datatype));
+    }
+
+    return result;
+  };
+  /**
+   * Returns an array containing the columns of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+
+
+  DenseMatrix.prototype.columns = function () {
+    var _this = this;
+
+    var result = [];
+    var s = this.size();
+
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+
+    var data = this._data;
+
+    var _loop = function _loop(i) {
+      var col = data.map(row => [row[i]]);
+      result.push(new DenseMatrix(col, _this._datatype));
+    };
+
+    for (var i = 0; i < s[1]; i++) {
+      _loop(i);
+    }
+
+    return result;
+  };
+  /**
+   * Create an Array with a copy of the data of the DenseMatrix
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+
+
+  DenseMatrix.prototype.toArray = function () {
+    return clone(this._data);
+  };
+  /**
+   * Get the primitive value of the DenseMatrix: a multidimensional array
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+
+
+  DenseMatrix.prototype.valueOf = function () {
+    return this._data;
+  };
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof DenseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  DenseMatrix.prototype.format = function (options) {
+    return format(this._data, options);
+  };
+  /**
+   * Get a string representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {string} str
+   */
+
+
+  DenseMatrix.prototype.toString = function () {
+    return format(this._data);
+  };
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {Object}
+   */
+
+
+  DenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'DenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof DenseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix with the diagonal values.
+   */
+
+
+  DenseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows & columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // number diagonal values
+
+    var n = Math.min(rows - kSub, columns - kSuper); // x is a matrix get diagonal from matrix
+
+    var data = []; // loop rows
+
+    for (var i = 0; i < n; i++) {
+      data[i] = this._data[i + kSub][i + kSuper];
+    } // create DenseMatrix
+
+
+    return new DenseMatrix({
+      data: data,
+      size: [n],
+      datatype: this._datatype
+    });
+  };
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {Array} size                     The matrix size.
+   * @param {number | Matrix | Array } value The values for the diagonal.
+   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]          The default value for non-diagonal
+   * @param {string} [datatype]              The datatype for the diagonal
+   *
+   * @returns {DenseMatrix}
+   */
+
+
+  DenseMatrix.diagonal = function (size, value, k, defaultValue) {
+    if (!isArray(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    } // map size & validate
+
+
+    size = size.map(function (s) {
+      // check it is a big number
+      if (isBigNumber(s)) {
+        // convert it
+        s = s.toNumber();
+      } // validate arguments
+
+
+      if (!isNumber(s) || !isInteger(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+
+      return s;
+    }); // validate k if any
+
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows and columns
+
+    var rows = size[0];
+    var columns = size[1]; // number of non-zero items
+
+    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function
+
+    var _value; // check value
+
+
+    if (isArray(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if (isMatrix(value)) {
+      // matrix size
+      var ms = value.size(); // validate matrix
+
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function _value() {
+        // return value
+        return value;
+      };
+    } // discover default value if needed
+
+
+    if (!defaultValue) {
+      // check first value in array
+      defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero
+      : 0;
+    } // empty array
+
+
+    var data = []; // check we need to resize array
+
+    if (size.length > 0) {
+      // resize array
+      data = resize(data, size, defaultValue); // fill diagonal
+
+      for (var d = 0; d < n; d++) {
+        data[d + kSub][d + kSuper] = _value(d);
+      }
+    } // create DenseMatrix
+
+
+    return new DenseMatrix({
+      data: data,
+      size: [rows, columns]
+    });
+  };
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof DenseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "DenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {DenseMatrix}
+   */
+
+
+  DenseMatrix.fromJSON = function (json) {
+    return new DenseMatrix(json);
+  };
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+
+
+  DenseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {
+      throw new Error('Row index must be positive integers');
+    } // check dimensions
+
+
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    } // validate index
+
+
+    validateIndex(i, this._size[0]);
+    validateIndex(j, this._size[0]); // swap rows
+
+    DenseMatrix._swapRows(i, j, this._data); // return current instance
+
+
+    return this;
+  };
+  /**
+   * Swap rows i and j in Dense Matrix data structure.
+   *
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   * @param {Array} data     Matrix data
+   */
+
+
+  DenseMatrix._swapRows = function (i, j, data) {
+    // swap values i <-> j
+    var vi = data[i];
+    data[i] = data[j];
+    data[j] = vi;
+  };
+  /**
+   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and
+   * Matrices. Replaces all nested Matrices with Arrays
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @return {Array} data
+   */
+
+
+  function preprocess(data) {
+    for (var i = 0, ii = data.length; i < ii; i++) {
+      var elem = data[i];
+
+      if (isArray(elem)) {
+        data[i] = preprocess(elem);
+      } else if (elem && elem.isMatrix === true) {
+        data[i] = preprocess(elem.valueOf());
+      }
+    }
+
+    return data;
+  }
+
+  return DenseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js b/node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js
new file mode 100644
index 0000000..b5b1659
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js
@@ -0,0 +1,389 @@
+import { factory } from '../../utils/factory.js';
+var name = 'FibonacciHeap';
+var dependencies = ['smaller', 'larger'];
+export var createFibonacciHeapClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    smaller,
+    larger
+  } = _ref;
+  var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);
+  /**
+   * Fibonacci Heap implementation, used interally for Matrix math.
+   * @class FibonacciHeap
+   * @constructor FibonacciHeap
+   */
+
+  function FibonacciHeap() {
+    if (!(this instanceof FibonacciHeap)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // initialize fields
+
+
+    this._minimum = null;
+    this._size = 0;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  FibonacciHeap.prototype.type = 'FibonacciHeap';
+  FibonacciHeap.prototype.isFibonacciHeap = true;
+  /**
+   * Inserts a new data element into the heap. No heap consolidation is
+   * performed at this time, the new node is simply inserted into the root
+   * list of this heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+
+  FibonacciHeap.prototype.insert = function (key, value) {
+    // create node
+    var node = {
+      key: key,
+      value: value,
+      degree: 0
+    }; // check we have a node in the minimum
+
+    if (this._minimum) {
+      // minimum node
+      var minimum = this._minimum; // update left & right of node
+
+      node.left = minimum;
+      node.right = minimum.right;
+      minimum.right = node;
+      node.right.left = node; // update minimum node in heap if needed
+
+      if (smaller(key, minimum.key)) {
+        // node has a smaller key, use it as minimum
+        this._minimum = node;
+      }
+    } else {
+      // set left & right
+      node.left = node;
+      node.right = node; // this is the first node
+
+      this._minimum = node;
+    } // increment number of nodes in heap
+
+
+    this._size++; // return node
+
+    return node;
+  };
+  /**
+   * Returns the number of nodes in heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.size = function () {
+    return this._size;
+  };
+  /**
+   * Removes all elements from this heap.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.clear = function () {
+    this._minimum = null;
+    this._size = 0;
+  };
+  /**
+   * Returns true if the heap is empty, otherwise false.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.isEmpty = function () {
+    return this._size === 0;
+  };
+  /**
+   * Extracts the node with minimum key from heap. Amortized running
+   * time: O(log n).
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.extractMinimum = function () {
+    // node to remove
+    var node = this._minimum; // check we have a minimum
+
+    if (node === null) {
+      return node;
+    } // current minimum
+
+
+    var minimum = this._minimum; // get number of children
+
+    var numberOfChildren = node.degree; // pointer to the first child
+
+    var x = node.child; // for each child of node do...
+
+    while (numberOfChildren > 0) {
+      // store node in right side
+      var tempRight = x.right; // remove x from child list
+
+      x.left.right = x.right;
+      x.right.left = x.left; // add x to root list of heap
+
+      x.left = minimum;
+      x.right = minimum.right;
+      minimum.right = x;
+      x.right.left = x; // set Parent[x] to null
+
+      x.parent = null;
+      x = tempRight;
+      numberOfChildren--;
+    } // remove node from root list of heap
+
+
+    node.left.right = node.right;
+    node.right.left = node.left; // update minimum
+
+    if (node === node.right) {
+      // empty
+      minimum = null;
+    } else {
+      // update minimum
+      minimum = node.right; // we need to update the pointer to the root with minimum key
+
+      minimum = _findMinimumNode(minimum, this._size);
+    } // decrement size of heap
+
+
+    this._size--; // update minimum
+
+    this._minimum = minimum; // return node
+
+    return node;
+  };
+  /**
+   * Removes a node from the heap given the reference to the node. The trees
+   * in the heap will be consolidated, if necessary. This operation may fail
+   * to remove the correct element if there are nodes with key value -Infinity.
+   * Running time: O(log n) amortized.
+   * @memberof FibonacciHeap
+   */
+
+
+  FibonacciHeap.prototype.remove = function (node) {
+    // decrease key value
+    this._minimum = _decreaseKey(this._minimum, node, -1); // remove the smallest
+
+    this.extractMinimum();
+  };
+  /**
+   * Decreases the key value for a heap node, given the new value to take on.
+   * The structure of the heap may be changed and will not be consolidated.
+   * Running time: O(1) amortized.
+   * @memberof FibonacciHeap
+   */
+
+
+  function _decreaseKey(minimum, node, key) {
+    // set node key
+    node.key = key; // get parent node
+
+    var parent = node.parent;
+
+    if (parent && smaller(node.key, parent.key)) {
+      // remove node from parent
+      _cut(minimum, node, parent); // remove all nodes from parent to the root parent
+
+
+      _cascadingCut(minimum, parent);
+    } // update minimum node if needed
+
+
+    if (smaller(node.key, minimum.key)) {
+      minimum = node;
+    } // return minimum
+
+
+    return minimum;
+  }
+  /**
+   * The reverse of the link operation: removes node from the child list of parent.
+   * This method assumes that min is non-null. Running time: O(1).
+   * @memberof FibonacciHeap
+   */
+
+
+  function _cut(minimum, node, parent) {
+    // remove node from parent children and decrement Degree[parent]
+    node.left.right = node.right;
+    node.right.left = node.left;
+    parent.degree--; // reset y.child if necessary
+
+    if (parent.child === node) {
+      parent.child = node.right;
+    } // remove child if degree is 0
+
+
+    if (parent.degree === 0) {
+      parent.child = null;
+    } // add node to root list of heap
+
+
+    node.left = minimum;
+    node.right = minimum.right;
+    minimum.right = node;
+    node.right.left = node; // set parent[node] to null
+
+    node.parent = null; // set mark[node] to false
+
+    node.mark = false;
+  }
+  /**
+   * Performs a cascading cut operation. This cuts node from its parent and then
+   * does the same for its parent, and so on up the tree.
+   * Running time: O(log n); O(1) excluding the recursion.
+   * @memberof FibonacciHeap
+   */
+
+
+  function _cascadingCut(minimum, node) {
+    // store parent node
+    var parent = node.parent; // if there's a parent...
+
+    if (!parent) {
+      return;
+    } // if node is unmarked, set it marked
+
+
+    if (!node.mark) {
+      node.mark = true;
+    } else {
+      // it's marked, cut it from parent
+      _cut(minimum, node, parent); // cut its parent as well
+
+
+      _cascadingCut(parent);
+    }
+  }
+  /**
+   * Make the first node a child of the second one. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+
+
+  var _linkNodes = function _linkNodes(node, parent) {
+    // remove node from root list of heap
+    node.left.right = node.right;
+    node.right.left = node.left; // make node a Child of parent
+
+    node.parent = parent;
+
+    if (!parent.child) {
+      parent.child = node;
+      node.right = node;
+      node.left = node;
+    } else {
+      node.left = parent.child;
+      node.right = parent.child.right;
+      parent.child.right = node;
+      node.right.left = node;
+    } // increase degree[parent]
+
+
+    parent.degree++; // set mark[node] false
+
+    node.mark = false;
+  };
+
+  function _findMinimumNode(minimum, size) {
+    // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree
+    var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; // create list with initial capacity
+
+    var array = new Array(arraySize); // find the number of root nodes.
+
+    var numRoots = 0;
+    var x = minimum;
+
+    if (x) {
+      numRoots++;
+      x = x.right;
+
+      while (x !== minimum) {
+        numRoots++;
+        x = x.right;
+      }
+    } // vars
+
+
+    var y; // For each node in root list do...
+
+    while (numRoots > 0) {
+      // access this node's degree..
+      var d = x.degree; // get next node
+
+      var next = x.right; // check if there is a node already in array with the same degree
+
+      while (true) {
+        // get node with the same degree is any
+        y = array[d];
+
+        if (!y) {
+          break;
+        } // make one node with the same degree a child of the other, do this based on the key value.
+
+
+        if (larger(x.key, y.key)) {
+          var temp = y;
+          y = x;
+          x = temp;
+        } // make y a child of x
+
+
+        _linkNodes(y, x); // we have handled this degree, go to next one.
+
+
+        array[d] = null;
+        d++;
+      } // save this node for later when we might encounter another of the same degree.
+
+
+      array[d] = x; // move forward through list.
+
+      x = next;
+      numRoots--;
+    } // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].
+
+
+    minimum = null; // loop nodes in array
+
+    for (var i = 0; i < arraySize; i++) {
+      // get current node
+      y = array[i];
+
+      if (!y) {
+        continue;
+      } // check if we have a linked list
+
+
+      if (minimum) {
+        // First remove node from root list.
+        y.left.right = y.right;
+        y.right.left = y.left; // now add to root list, again.
+
+        y.left = minimum;
+        y.right = minimum.right;
+        minimum.right = y;
+        y.right.left = y; // check if this is a new min.
+
+        if (smaller(y.key, minimum.key)) {
+          minimum = y;
+        }
+      } else {
+        minimum = y;
+      }
+    }
+
+    return minimum;
+  }
+
+  return FibonacciHeap;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js b/node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js
new file mode 100644
index 0000000..9087d4f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js
@@ -0,0 +1,240 @@
+import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ImmutableDenseMatrix';
+var dependencies = ['smaller', 'DenseMatrix'];
+export var createImmutableDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    smaller,
+    DenseMatrix
+  } = _ref;
+
+  function ImmutableDenseMatrix(data, datatype) {
+    if (!(this instanceof ImmutableDenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (datatype && !isString(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+
+    if (isMatrix(data) || isArray(data)) {
+      // use DenseMatrix implementation
+      var matrix = new DenseMatrix(data, datatype); // internal structures
+
+      this._data = matrix._data;
+      this._size = matrix._size;
+      this._datatype = matrix._datatype;
+      this._min = null;
+      this._max = null;
+    } else if (data && isArray(data.data) && isArray(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size;
+      this._datatype = data.datatype;
+      this._min = typeof data.min !== 'undefined' ? data.min : null;
+      this._max = typeof data.max !== 'undefined' ? data.max : null;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+      this._min = null;
+      this._max = null;
+    }
+  }
+
+  ImmutableDenseMatrix.prototype = new DenseMatrix();
+  /**
+   * Attach type information
+   */
+
+  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';
+  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | ImmutableDenseMatrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+  ImmutableDenseMatrix.prototype.subset = function (index) {
+    switch (arguments.length) {
+      case 1:
+        {
+          // use base implementation
+          var m = DenseMatrix.prototype.subset.call(this, index); // check result is a matrix
+
+          if (isMatrix(m)) {
+            // return immutable matrix
+            return new ImmutableDenseMatrix({
+              data: m._data,
+              size: m._size,
+              datatype: m._datatype
+            });
+          }
+
+          return m;
+        }
+      // intentional fall through
+
+      case 2:
+      case 3:
+        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');
+
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @param {Number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {ImmutableDenseMatrix} self
+   */
+
+
+  ImmutableDenseMatrix.prototype.set = function () {
+    throw new Error('Cannot invoke set on an Immutable Matrix instance');
+  };
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {Number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  ImmutableDenseMatrix.prototype.resize = function () {
+    throw new Error('Cannot invoke resize on an Immutable Matrix instance');
+  };
+  /**
+   * Disallows reshaping in favor of immutability.
+   *
+   * @throws {Error} Operation not allowed
+   */
+
+
+  ImmutableDenseMatrix.prototype.reshape = function () {
+    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');
+  };
+  /**
+   * Create a clone of the matrix
+   * @return {ImmutableDenseMatrix} clone
+   */
+
+
+  ImmutableDenseMatrix.prototype.clone = function () {
+    return new ImmutableDenseMatrix({
+      data: clone(this._data),
+      size: clone(this._size),
+      datatype: this._datatype
+    });
+  };
+  /**
+   * Get a JSON representation of the matrix
+   * @returns {Object}
+   */
+
+
+  ImmutableDenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'ImmutableDenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+  /**
+   * Generate a matrix from a JSON object
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ImmutableDenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {ImmutableDenseMatrix}
+   */
+
+
+  ImmutableDenseMatrix.fromJSON = function (json) {
+    return new ImmutableDenseMatrix(json);
+  };
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @param {Number} i       Matrix row index 1
+   * @param {Number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+
+
+  ImmutableDenseMatrix.prototype.swapRows = function () {
+    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');
+  };
+  /**
+   * Calculate the minimum value in the set
+   * @return {Number | undefined} min
+   */
+
+
+  ImmutableDenseMatrix.prototype.min = function () {
+    // check min has been calculated before
+    if (this._min === null) {
+      // minimum
+      var m = null; // compute min
+
+      this.forEach(function (v) {
+        if (m === null || smaller(v, m)) {
+          m = v;
+        }
+      });
+      this._min = m !== null ? m : undefined;
+    }
+
+    return this._min;
+  };
+  /**
+   * Calculate the maximum value in the set
+   * @return {Number | undefined} max
+   */
+
+
+  ImmutableDenseMatrix.prototype.max = function () {
+    // check max has been calculated before
+    if (this._max === null) {
+      // maximum
+      var m = null; // compute max
+
+      this.forEach(function (v) {
+        if (m === null || smaller(m, v)) {
+          m = v;
+        }
+      });
+      this._max = m !== null ? m : undefined;
+    }
+
+    return this._max;
+  };
+
+  return ImmutableDenseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/Matrix.js b/node_modules/mathjs/lib/esm/type/matrix/Matrix.js
new file mode 100644
index 0000000..e46698a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/Matrix.js
@@ -0,0 +1,260 @@
+import { factory } from '../../utils/factory.js';
+var name = 'Matrix';
+var dependencies = [];
+export var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * @constructor Matrix
+   *
+   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional
+   * array. A matrix can be constructed as:
+   *
+   *     let matrix = math.matrix(data)
+   *
+   * Matrix contains the functions to resize, get and set values, get the size,
+   * clone the matrix and to convert the matrix to a vector, array, or scalar.
+   * Furthermore, one can iterate over the matrix using map and forEach.
+   * The internal Array of the Matrix can be accessed using the function valueOf.
+   *
+   * Example usage:
+   *
+   *     let matrix = math.matrix([[1, 2], [3, 4]])
+   *     matix.size()              // [2, 2]
+   *     matrix.resize([3, 2], 5)
+   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]
+   *     matrix.subset([1,2])       // 3 (indexes are zero-based)
+   *
+   */
+  function Matrix() {
+    if (!(this instanceof Matrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Matrix.prototype.type = 'Matrix';
+  Matrix.prototype.isMatrix = true;
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @return {string}           The storage format.
+   */
+
+  Matrix.prototype.storage = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke storage on a Matrix interface');
+  };
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @return {string}           The datatype.
+   */
+
+
+  Matrix.prototype.datatype = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke datatype on a Matrix interface');
+  };
+  /**
+   * Create a new Matrix With the type of the current matrix instance
+   * @param {Array | Object} data
+   * @param {string} [datatype]
+   */
+
+
+  Matrix.prototype.create = function (data, datatype) {
+    throw new Error('Cannot invoke create on a Matrix interface');
+  };
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+
+  Matrix.prototype.subset = function (index, replacement, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke subset on a Matrix interface');
+  };
+  /**
+   * Get a single element from the matrix.
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+
+
+  Matrix.prototype.get = function (index) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke get on a Matrix interface');
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {Matrix} self
+   */
+
+
+  Matrix.prototype.set = function (index, value, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke set on a Matrix interface');
+  };
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  Matrix.prototype.resize = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke resize on a Matrix interface');
+  };
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+
+
+  Matrix.prototype.reshape = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke reshape on a Matrix interface');
+  };
+  /**
+   * Create a clone of the matrix
+   * @return {Matrix} clone
+   */
+
+
+  Matrix.prototype.clone = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke clone on a Matrix interface');
+  };
+  /**
+   * Retrieve the size of the matrix.
+   * @returns {number[]} size
+   */
+
+
+  Matrix.prototype.size = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke size on a Matrix interface');
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {Matrix} matrix
+   */
+
+
+  Matrix.prototype.map = function (callback, skipZeros) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke map on a Matrix interface');
+  };
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   */
+
+
+  Matrix.prototype.forEach = function (callback) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke forEach on a Matrix interface');
+  };
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+
+
+  Matrix.prototype[Symbol.iterator] = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot iterate a Matrix interface');
+  };
+  /**
+   * Create an Array with a copy of the data of the Matrix
+   * @returns {Array} array
+   */
+
+
+  Matrix.prototype.toArray = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toArray on a Matrix interface');
+  };
+  /**
+   * Get the primitive value of the Matrix: a multidimensional array
+   * @returns {Array} array
+   */
+
+
+  Matrix.prototype.valueOf = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke valueOf on a Matrix interface');
+  };
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  Matrix.prototype.format = function (options) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke format on a Matrix interface');
+  };
+  /**
+   * Get a string representation of the matrix
+   * @returns {string} str
+   */
+
+
+  Matrix.prototype.toString = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toString on a Matrix interface');
+  };
+
+  return Matrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js b/node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js
new file mode 100644
index 0000000..63ec6a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js
@@ -0,0 +1,302 @@
+import { isMatrix, isRange } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Index';
+var dependencies = ['ImmutableDenseMatrix'];
+export var createIndexClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    ImmutableDenseMatrix
+  } = _ref;
+
+  /**
+   * Create an index. An Index can store ranges and sets for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Usage:
+   *     const index = new Index(range1, range2, matrix1, array1, ...)
+   *
+   * Where each parameter can be any of:
+   *     A number
+   *     A string (containing a name of an object property)
+   *     An instance of Range
+   *     An Array with the Set values
+   *     A Matrix with the Set values
+   *
+   * The parameters start, end, and step must be integer numbers.
+   *
+   * @class Index
+   * @Constructor Index
+   * @param {...*} ranges
+   */
+  function Index(ranges) {
+    if (!(this instanceof Index)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this._dimensions = [];
+    this._isScalar = true;
+
+    for (var i = 0, ii = arguments.length; i < ii; i++) {
+      var arg = arguments[i];
+
+      if (isRange(arg)) {
+        this._dimensions.push(arg);
+
+        this._isScalar = false;
+      } else if (Array.isArray(arg) || isMatrix(arg)) {
+        // create matrix
+        var m = _createImmutableMatrix(arg.valueOf());
+
+        this._dimensions.push(m); // size
+
+
+        var size = m.size(); // scalar
+
+        if (size.length !== 1 || size[0] !== 1) {
+          this._isScalar = false;
+        }
+      } else if (typeof arg === 'number') {
+        this._dimensions.push(_createImmutableMatrix([arg]));
+      } else if (typeof arg === 'string') {
+        // object property (arguments.count should be 1)
+        this._dimensions.push(arg);
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');
+      } // TODO: implement support for wildcard '*'
+
+    }
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Index.prototype.type = 'Index';
+  Index.prototype.isIndex = true;
+
+  function _createImmutableMatrix(arg) {
+    // loop array elements
+    for (var i = 0, l = arg.length; i < l; i++) {
+      if (typeof arg[i] !== 'number' || !isInteger(arg[i])) {
+        throw new TypeError('Index parameters must be positive integer numbers');
+      }
+    } // create matrix
+
+
+    return new ImmutableDenseMatrix(arg);
+  }
+  /**
+   * Create a clone of the index
+   * @memberof Index
+   * @return {Index} clone
+   */
+
+
+  Index.prototype.clone = function () {
+    var index = new Index();
+    index._dimensions = clone(this._dimensions);
+    index._isScalar = this._isScalar;
+    return index;
+  };
+  /**
+   * Create an index from an array with ranges/numbers
+   * @memberof Index
+   * @param {Array.<Array | number>} ranges
+   * @return {Index} index
+   * @private
+   */
+
+
+  Index.create = function (ranges) {
+    var index = new Index();
+    Index.apply(index, ranges);
+    return index;
+  };
+  /**
+   * Retrieve the size of the index, the number of elements for each dimension.
+   * @memberof Index
+   * @returns {number[]} size
+   */
+
+
+  Index.prototype.size = function () {
+    var size = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var d = this._dimensions[i];
+      size[i] = typeof d === 'string' ? 1 : d.size()[0];
+    }
+
+    return size;
+  };
+  /**
+   * Get the maximum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} max
+   */
+
+
+  Index.prototype.max = function () {
+    var values = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.max();
+    }
+
+    return values;
+  };
+  /**
+   * Get the minimum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} min
+   */
+
+
+  Index.prototype.min = function () {
+    var values = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.min();
+    }
+
+    return values;
+  };
+  /**
+   * Loop over each of the ranges of the index
+   * @memberof Index
+   * @param {Function} callback   Called for each range with a Range as first
+   *                              argument, the dimension as second, and the
+   *                              index object as third.
+   */
+
+
+  Index.prototype.forEach = function (callback) {
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      callback(this._dimensions[i], i, this);
+    }
+  };
+  /**
+   * Retrieve the dimension for the given index
+   * @memberof Index
+   * @param {Number} dim                  Number of the dimension
+   * @returns {Range | null} range
+   */
+
+
+  Index.prototype.dimension = function (dim) {
+    return this._dimensions[dim] || null;
+  };
+  /**
+   * Test whether this index contains an object property
+   * @returns {boolean} Returns true if the index is an object property
+   */
+
+
+  Index.prototype.isObjectProperty = function () {
+    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';
+  };
+  /**
+   * Returns the object property name when the Index holds a single object property,
+   * else returns null
+   * @returns {string | null}
+   */
+
+
+  Index.prototype.getObjectProperty = function () {
+    return this.isObjectProperty() ? this._dimensions[0] : null;
+  };
+  /**
+   * Test whether this index contains only a single value.
+   *
+   * This is the case when the index is created with only scalar values as ranges,
+   * not for ranges resolving into a single value.
+   * @memberof Index
+   * @return {boolean} isScalar
+   */
+
+
+  Index.prototype.isScalar = function () {
+    return this._isScalar;
+  };
+  /**
+   * Expand the Index into an array.
+   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]
+   * @memberof Index
+   * @returns {Array} array
+   */
+
+
+  Index.prototype.toArray = function () {
+    var array = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var dimension = this._dimensions[i];
+      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());
+    }
+
+    return array;
+  };
+  /**
+   * Get the primitive value of the Index, a two dimensional array.
+   * Equivalent to Index.toArray().
+   * @memberof Index
+   * @returns {Array} array
+   */
+
+
+  Index.prototype.valueOf = Index.prototype.toArray;
+  /**
+   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'
+   * @memberof Index
+   * @returns {String} str
+   */
+
+  Index.prototype.toString = function () {
+    var strings = [];
+
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var dimension = this._dimensions[i];
+
+      if (typeof dimension === 'string') {
+        strings.push(JSON.stringify(dimension));
+      } else {
+        strings.push(dimension.toString());
+      }
+    }
+
+    return '[' + strings.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the Index
+   * @memberof Index
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   */
+
+
+  Index.prototype.toJSON = function () {
+    return {
+      mathjs: 'Index',
+      dimensions: this._dimensions
+    };
+  };
+  /**
+   * Instantiate an Index from a JSON object
+   * @memberof Index
+   * @param {Object} json A JSON object structured as:
+   *                     `{"mathjs": "Index", "dimensions": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   * @return {Index}
+   */
+
+
+  Index.fromJSON = function (json) {
+    return Index.create(json.dimensions);
+  };
+
+  return Index;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/Range.js b/node_modules/mathjs/lib/esm/type/matrix/Range.js
new file mode 100644
index 0000000..e5a04c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/Range.js
@@ -0,0 +1,336 @@
+import { isBigNumber } from '../../utils/is.js';
+import { format, sign } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Range';
+var dependencies = [];
+export var createRangeClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Create a range. A range has a start, step, and end, and contains functions
+   * to iterate over the range.
+   *
+   * A range can be constructed as:
+   *
+   *     const range = new Range(start, end)
+   *     const range = new Range(start, end, step)
+   *
+   * To get the result of the range:
+   *     range.forEach(function (x) {
+   *         console.log(x)
+   *     })
+   *     range.map(function (x) {
+   *         return math.sin(x)
+   *     })
+   *     range.toArray()
+   *
+   * Example usage:
+   *
+   *     const c = new Range(2, 6)       // 2:1:5
+   *     c.toArray()                     // [2, 3, 4, 5]
+   *     const d = new Range(2, -3, -1)  // 2:-1:-2
+   *     d.toArray()                     // [2, 1, 0, -1, -2]
+   *
+   * @class Range
+   * @constructor Range
+   * @param {number} start  included lower bound
+   * @param {number} end    excluded upper bound
+   * @param {number} [step] step size, default value is 1
+   */
+  function Range(start, end, step) {
+    if (!(this instanceof Range)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    var hasStart = start !== null && start !== undefined;
+    var hasEnd = end !== null && end !== undefined;
+    var hasStep = step !== null && step !== undefined;
+
+    if (hasStart) {
+      if (isBigNumber(start)) {
+        start = start.toNumber();
+      } else if (typeof start !== 'number') {
+        throw new TypeError('Parameter start must be a number');
+      }
+    }
+
+    if (hasEnd) {
+      if (isBigNumber(end)) {
+        end = end.toNumber();
+      } else if (typeof end !== 'number') {
+        throw new TypeError('Parameter end must be a number');
+      }
+    }
+
+    if (hasStep) {
+      if (isBigNumber(step)) {
+        step = step.toNumber();
+      } else if (typeof step !== 'number') {
+        throw new TypeError('Parameter step must be a number');
+      }
+    }
+
+    this.start = hasStart ? parseFloat(start) : 0;
+    this.end = hasEnd ? parseFloat(end) : 0;
+    this.step = hasStep ? parseFloat(step) : 1;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Range.prototype.type = 'Range';
+  Range.prototype.isRange = true;
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @memberof Range
+   * @param {string} str
+   * @return {Range | null} range
+   */
+
+  Range.parse = function (str) {
+    if (typeof str !== 'string') {
+      return null;
+    }
+
+    var args = str.split(':');
+    var nums = args.map(function (arg) {
+      return parseFloat(arg);
+    });
+    var invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+
+    if (invalid) {
+      return null;
+    }
+
+    switch (nums.length) {
+      case 2:
+        return new Range(nums[0], nums[1]);
+
+      case 3:
+        return new Range(nums[0], nums[2], nums[1]);
+
+      default:
+        return null;
+    }
+  };
+  /**
+   * Create a clone of the range
+   * @return {Range} clone
+   */
+
+
+  Range.prototype.clone = function () {
+    return new Range(this.start, this.end, this.step);
+  };
+  /**
+   * Retrieve the size of the range.
+   * Returns an array containing one number, the number of elements in the range.
+   * @memberof Range
+   * @returns {number[]} size
+   */
+
+
+  Range.prototype.size = function () {
+    var len = 0;
+    var start = this.start;
+    var step = this.step;
+    var end = this.end;
+    var diff = end - start;
+
+    if (sign(step) === sign(diff)) {
+      len = Math.ceil(diff / step);
+    } else if (diff === 0) {
+      len = 0;
+    }
+
+    if (isNaN(len)) {
+      len = 0;
+    }
+
+    return [len];
+  };
+  /**
+   * Calculate the minimum value in the range
+   * @memberof Range
+   * @return {number | undefined} min
+   */
+
+
+  Range.prototype.min = function () {
+    var size = this.size()[0];
+
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start;
+      } else {
+        // negative step
+        return this.start + (size - 1) * this.step;
+      }
+    } else {
+      return undefined;
+    }
+  };
+  /**
+   * Calculate the maximum value in the range
+   * @memberof Range
+   * @return {number | undefined} max
+   */
+
+
+  Range.prototype.max = function () {
+    var size = this.size()[0];
+
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start + (size - 1) * this.step;
+      } else {
+        // negative step
+        return this.start;
+      }
+    } else {
+      return undefined;
+    }
+  };
+  /**
+   * Execute a callback function for each value in the range.
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Range being traversed.
+   */
+
+
+  Range.prototype.forEach = function (callback) {
+    var x = this.start;
+    var step = this.step;
+    var end = this.end;
+    var i = 0;
+
+    if (step > 0) {
+      while (x < end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    } else if (step < 0) {
+      while (x > end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    }
+  };
+  /**
+   * Execute a callback function for each value in the Range, and return the
+   * results as an array
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @returns {Array} array
+   */
+
+
+  Range.prototype.map = function (callback) {
+    var array = [];
+    this.forEach(function (value, index, obj) {
+      array[index[0]] = callback(value, index, obj);
+    });
+    return array;
+  };
+  /**
+   * Create an Array with a copy of the Ranges data
+   * @memberof Range
+   * @returns {Array} array
+   */
+
+
+  Range.prototype.toArray = function () {
+    var array = [];
+    this.forEach(function (value, index) {
+      array[index[0]] = value;
+    });
+    return array;
+  };
+  /**
+   * Get the primitive value of the Range, a one dimensional array
+   * @memberof Range
+   * @returns {Array} array
+   */
+
+
+  Range.prototype.valueOf = function () {
+    // TODO: implement a caching mechanism for range.valueOf()
+    return this.toArray();
+  };
+  /**
+   * Get a string representation of the range, with optional formatting options.
+   * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'
+   * @memberof Range
+   * @param {Object | number | function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  Range.prototype.format = function (options) {
+    var str = format(this.start, options);
+
+    if (this.step !== 1) {
+      str += ':' + format(this.step, options);
+    }
+
+    str += ':' + format(this.end, options);
+    return str;
+  };
+  /**
+   * Get a string representation of the range.
+   * @memberof Range
+   * @returns {string}
+   */
+
+
+  Range.prototype.toString = function () {
+    return this.format();
+  };
+  /**
+   * Get a JSON representation of the range
+   * @memberof Range
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   */
+
+
+  Range.prototype.toJSON = function () {
+    return {
+      mathjs: 'Range',
+      start: this.start,
+      end: this.end,
+      step: this.step
+    };
+  };
+  /**
+   * Instantiate a Range from a JSON object
+   * @memberof Range
+   * @param {Object} json A JSON object structured as:
+   *                      `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   * @return {Range}
+   */
+
+
+  Range.fromJSON = function (json) {
+    return new Range(json.start, json.end, json.step);
+  };
+
+  return Range;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/Spa.js b/node_modules/mathjs/lib/esm/type/matrix/Spa.js
new file mode 100644
index 0000000..76ca2c2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/Spa.js
@@ -0,0 +1,154 @@
+import { factory } from '../../utils/factory.js';
+var name = 'Spa';
+var dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];
+export var createSpaClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    addScalar,
+    equalScalar,
+    FibonacciHeap
+  } = _ref;
+
+  /**
+   * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array
+   * of the vector elements and an ordered list of non-zero elements.
+   */
+  function Spa() {
+    if (!(this instanceof Spa)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    } // allocate vector, TODO use typed arrays
+
+
+    this._values = [];
+    this._heap = new FibonacciHeap();
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Spa.prototype.type = 'Spa';
+  Spa.prototype.isSpa = true;
+  /**
+   * Set the value for index i.
+   *
+   * @param {number} i                       The index
+   * @param {number | BigNumber | Complex}   The value at index i
+   */
+
+  Spa.prototype.set = function (i, v) {
+    // check we have a value @ i
+    if (!this._values[i]) {
+      // insert in heap
+      var node = this._heap.insert(i, v); // set the value @ i
+
+
+      this._values[i] = node;
+    } else {
+      // update the value @ i
+      this._values[i].value = v;
+    }
+  };
+
+  Spa.prototype.get = function (i) {
+    var node = this._values[i];
+
+    if (node) {
+      return node.value;
+    }
+
+    return 0;
+  };
+
+  Spa.prototype.accumulate = function (i, v) {
+    // node @ i
+    var node = this._values[i];
+
+    if (!node) {
+      // insert in heap
+      node = this._heap.insert(i, v); // initialize value
+
+      this._values[i] = node;
+    } else {
+      // accumulate value
+      node.value = addScalar(node.value, v);
+    }
+  };
+
+  Spa.prototype.forEach = function (from, to, callback) {
+    // references
+    var heap = this._heap;
+    var values = this._values; // nodes
+
+    var nodes = []; // node with minimum key, save it
+
+    var node = heap.extractMinimum();
+
+    if (node) {
+      nodes.push(node);
+    } // extract nodes from heap (ordered)
+
+
+    while (node && node.key <= to) {
+      // check it is in range
+      if (node.key >= from) {
+        // check value is not zero
+        if (!equalScalar(node.value, 0)) {
+          // invoke callback
+          callback(node.key, node.value, this);
+        }
+      } // extract next node, save it
+
+
+      node = heap.extractMinimum();
+
+      if (node) {
+        nodes.push(node);
+      }
+    } // reinsert all nodes in heap
+
+
+    for (var i = 0; i < nodes.length; i++) {
+      // current node
+      var n = nodes[i]; // insert node in heap
+
+      node = heap.insert(n.key, n.value); // update values
+
+      values[node.key] = node;
+    }
+  };
+
+  Spa.prototype.swap = function (i, j) {
+    // node @ i and j
+    var nodei = this._values[i];
+    var nodej = this._values[j]; // check we need to insert indeces
+
+    if (!nodei && nodej) {
+      // insert in heap
+      nodei = this._heap.insert(i, nodej.value); // remove from heap
+
+      this._heap.remove(nodej); // set values
+
+
+      this._values[i] = nodei;
+      this._values[j] = undefined;
+    } else if (nodei && !nodej) {
+      // insert in heap
+      nodej = this._heap.insert(j, nodei.value); // remove from heap
+
+      this._heap.remove(nodei); // set values
+
+
+      this._values[j] = nodej;
+      this._values[i] = undefined;
+    } else if (nodei && nodej) {
+      // swap values
+      var v = nodei.value;
+      nodei.value = nodej.value;
+      nodej.value = v;
+    }
+  };
+
+  return Spa;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js b/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js
new file mode 100644
index 0000000..d537b1f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js
@@ -0,0 +1,1576 @@
+import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { format } from '../../utils/string.js';
+import { clone, deepStrictEqual } from '../../utils/object.js';
+import { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { DimensionError } from '../../error/DimensionError.js';
+var name = 'SparseMatrix';
+var dependencies = ['typed', 'equalScalar', 'Matrix'];
+export var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar,
+    Matrix
+  } = _ref;
+
+  /**
+   * Sparse Matrix implementation. This type implements
+   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))
+   * format for two-dimensional sparse matrices.
+   * @class SparseMatrix
+   */
+  function SparseMatrix(data, datatype) {
+    if (!(this instanceof SparseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    if (datatype && !isString(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+
+    if (isMatrix(data)) {
+      // create from matrix
+      _createFromMatrix(this, data, datatype);
+    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {
+      // initialize fields
+      this._values = data.values;
+      this._index = data.index;
+      this._ptr = data.ptr;
+      this._size = data.size;
+      this._datatype = datatype || data.datatype;
+    } else if (isArray(data)) {
+      // create from array
+      _createFromArray(this, data, datatype);
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');
+    } else {
+      // nothing provided
+      this._values = [];
+      this._index = [];
+      this._ptr = [0];
+      this._size = [0, 0];
+      this._datatype = datatype;
+    }
+  }
+
+  function _createFromMatrix(matrix, source, datatype) {
+    // check matrix type
+    if (source.type === 'SparseMatrix') {
+      // clone arrays
+      matrix._values = source._values ? clone(source._values) : undefined;
+      matrix._index = clone(source._index);
+      matrix._ptr = clone(source._ptr);
+      matrix._size = clone(source._size);
+      matrix._datatype = datatype || source._datatype;
+    } else {
+      // build from matrix data
+      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);
+    }
+  }
+
+  function _createFromArray(matrix, data, datatype) {
+    // initialize fields
+    matrix._values = [];
+    matrix._index = [];
+    matrix._ptr = [];
+    matrix._datatype = datatype; // discover rows & columns, do not use math.size() to avoid looping array twice
+
+    var rows = data.length;
+    var columns = 0; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if (isString(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, datatype);
+    } // check we have rows (empty array)
+
+
+    if (rows > 0) {
+      // column index
+      var j = 0;
+
+      do {
+        // store pointer to values index
+        matrix._ptr.push(matrix._index.length); // loop rows
+
+
+        for (var i = 0; i < rows; i++) {
+          // current row
+          var row = data[i]; // check row is an array
+
+          if (isArray(row)) {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < row.length) {
+              columns = row.length;
+            } // check row has column
+
+
+            if (j < row.length) {
+              // value
+              var v = row[j]; // check value != 0
+
+              if (!eq(v, zero)) {
+                // store value
+                matrix._values.push(v); // index
+
+
+                matrix._index.push(i);
+              }
+            }
+          } else {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < 1) {
+              columns = 1;
+            } // check value != 0 (row is a scalar)
+
+
+            if (!eq(row, zero)) {
+              // store value
+              matrix._values.push(row); // index
+
+
+              matrix._index.push(i);
+            }
+          }
+        } // increment index
+
+
+        j++;
+      } while (j < columns);
+    } // store number of values in ptr
+
+
+    matrix._ptr.push(matrix._index.length); // size
+
+
+    matrix._size = [rows, columns];
+  }
+
+  SparseMatrix.prototype = new Matrix();
+  /**
+   * Create a new SparseMatrix
+   */
+
+  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+  /**
+   * Attach type information
+   */
+
+
+  SparseMatrix.prototype.type = 'SparseMatrix';
+  SparseMatrix.prototype.isSparseMatrix = true;
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf SparseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+
+  SparseMatrix.prototype.getDataType = function () {
+    return getArrayDataType(this._values, typeOf);
+  };
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The storage format.
+   */
+
+
+  SparseMatrix.prototype.storage = function () {
+    return 'sparse';
+  };
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The datatype.
+   */
+
+
+  SparseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+  /**
+   * Create a new SparseMatrix
+   * @memberof SparseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+
+
+  SparseMatrix.prototype.create = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+  /**
+   * Get the matrix density.
+   *
+   * Usage:
+   *     const density = matrix.density()                   // retrieve matrix density
+   *
+   * @memberof SparseMatrix
+   * @return {number}           The matrix density.
+   */
+
+
+  SparseMatrix.prototype.density = function () {
+    // rows & columns
+    var rows = this._size[0];
+    var columns = this._size[1]; // calculate density
+
+    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;
+  };
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof SparseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+
+
+  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke subset on a Pattern only matrix');
+    } // check arguments
+
+
+    switch (arguments.length) {
+      case 1:
+        return _getsubset(this, index);
+      // intentional fall through
+
+      case 2:
+      case 3:
+        return _setsubset(this, index, replacement, defaultValue);
+
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+
+  function _getsubset(matrix, idx) {
+    // check idx
+    if (!isIndex(idx)) {
+      throw new TypeError('Invalid index');
+    }
+
+    var isScalar = idx.isScalar();
+
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(idx.min());
+    } // validate dimensions
+
+
+    var size = idx.size();
+
+    if (size.length !== matrix._size.length) {
+      throw new DimensionError(size.length, matrix._size.length);
+    } // vars
+
+
+    var i, ii, k, kk; // validate if any of the ranges in the index is out of range
+
+    var min = idx.min();
+    var max = idx.max();
+
+    for (i = 0, ii = matrix._size.length; i < ii; i++) {
+      validateIndex(min[i], matrix._size[i]);
+      validateIndex(max[i], matrix._size[i]);
+    } // matrix arrays
+
+
+    var mvalues = matrix._values;
+    var mindex = matrix._index;
+    var mptr = matrix._ptr; // rows & columns dimensions for result matrix
+
+    var rows = idx.dimension(0);
+    var columns = idx.dimension(1); // workspace & permutation vector
+
+    var w = [];
+    var pv = []; // loop rows in resulting matrix
+
+    rows.forEach(function (i, r) {
+      // update permutation vector
+      pv[i] = r[0]; // mark i in workspace
+
+      w[i] = true;
+    }); // result matrix arrays
+
+    var values = mvalues ? [] : undefined;
+    var index = [];
+    var ptr = []; // loop columns in result matrix
+
+    columns.forEach(function (j) {
+      // update ptr
+      ptr.push(index.length); // loop values in column j
+
+      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {
+        // row
+        i = mindex[k]; // check row is in result matrix
+
+        if (w[i] === true) {
+          // push index
+          index.push(pv[i]); // check we need to process values
+
+          if (values) {
+            values.push(mvalues[k]);
+          }
+        }
+      }
+    }); // update ptr
+
+    ptr.push(index.length); // return matrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: size,
+      datatype: matrix._datatype
+    });
+  }
+
+  function _setsubset(matrix, index, submatrix, defaultValue) {
+    // check index
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    } // get index size and check whether the index contains a single value
+
+
+    var iSize = index.size();
+    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed
+
+    var sSize;
+
+    if (isMatrix(submatrix)) {
+      // submatrix size
+      sSize = submatrix.size(); // use array representation
+
+      submatrix = submatrix.toArray();
+    } else {
+      // get submatrix size (array, scalar)
+      sSize = arraySize(submatrix);
+    } // check index is a scalar
+
+
+    if (isScalar) {
+      // verify submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      } // set value
+
+
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // validate dimensions, index size must be one or two dimensions
+      if (iSize.length !== 1 && iSize.length !== 2) {
+        throw new DimensionError(iSize.length, matrix._size.length, '<');
+      } // check submatrix and index have the same dimensions
+
+
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        var i = 0;
+        var outer = 0;
+
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        } // unsqueeze both outer and inner dimensions
+
+
+        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);
+      } // check whether the size of the submatrix matches the index size
+
+
+      if (!deepStrictEqual(iSize, sSize)) {
+        throw new DimensionError(iSize, sSize, '>');
+      } // insert the sub matrix
+
+
+      if (iSize.length === 1) {
+        // if the replacement index only has 1 dimension, go trough each one and set its value
+        var range = index.dimension(0);
+        range.forEach(function (dataIndex, subIndex) {
+          validateIndex(dataIndex);
+          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);
+        });
+      } else {
+        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index
+        var firstDimensionRange = index.dimension(0);
+        var secondDimensionRange = index.dimension(1);
+        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {
+          validateIndex(firstDataIndex);
+          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {
+            validateIndex(secondDataIndex);
+            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);
+          });
+        });
+      }
+    }
+
+    return matrix;
+  }
+  /**
+   * Get a single element from the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+
+
+  SparseMatrix.prototype.get = function (index) {
+    if (!isArray(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length !== this._size.length) {
+      throw new DimensionError(index.length, this._size.length);
+    } // check it is a pattern matrix
+
+
+    if (!this._values) {
+      throw new Error('Cannot invoke get on a Pattern only matrix');
+    } // row and column
+
+
+    var i = index[0];
+    var j = index[1]; // check i, j are valid
+
+    validateIndex(i, this._size[0]);
+    validateIndex(j, this._size[1]); // find value index
+
+    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row
+
+
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      return this._values[k];
+    }
+
+    return 0;
+  };
+  /**
+   * Replace a single element in the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} v
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be set to zero.
+   * @return {SparseMatrix} self
+   */
+
+
+  SparseMatrix.prototype.set = function (index, v, defaultValue) {
+    if (!isArray(index)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (index.length !== this._size.length) {
+      throw new DimensionError(index.length, this._size.length);
+    } // check it is a pattern matrix
+
+
+    if (!this._values) {
+      throw new Error('Cannot invoke set on a Pattern only matrix');
+    } // row and column
+
+
+    var i = index[0];
+    var j = index[1]; // rows & columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if (isString(this._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, this._datatype);
+    } // check we need to resize matrix
+
+
+    if (i > rows - 1 || j > columns - 1) {
+      // resize matrix
+      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue); // update rows & columns
+
+
+      rows = this._size[0];
+      columns = this._size[1];
+    } // check i, j are valid
+
+
+    validateIndex(i, rows);
+    validateIndex(j, columns); // find value index
+
+    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row
+
+
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      // check value != 0
+      if (!eq(v, zero)) {
+        // update value
+        this._values[k] = v;
+      } else {
+        // remove value from matrix
+        _remove(k, j, this._values, this._index, this._ptr);
+      }
+    } else {
+      // insert value @ (i, j)
+      _insert(k, i, j, v, this._values, this._index, this._ptr);
+    }
+
+    return this;
+  };
+
+  function _getValueIndex(i, top, bottom, index) {
+    // check row is on the bottom side
+    if (bottom - top === 0) {
+      return bottom;
+    } // loop rows [top, bottom[
+
+
+    for (var r = top; r < bottom; r++) {
+      // check we found value index
+      if (index[r] === i) {
+        return r;
+      }
+    } // we did not find row
+
+
+    return top;
+  }
+
+  function _remove(k, j, values, index, ptr) {
+    // remove value @ k
+    values.splice(k, 1);
+    index.splice(k, 1); // update pointers
+
+    for (var x = j + 1; x < ptr.length; x++) {
+      ptr[x]--;
+    }
+  }
+
+  function _insert(k, i, j, v, values, index, ptr) {
+    // insert value
+    values.splice(k, 0, v); // update row for k
+
+    index.splice(k, 0, i); // update column pointers
+
+    for (var x = j + 1; x < ptr.length; x++) {
+      ptr[x]++;
+    }
+  }
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof SparseMatrix
+   * @param {number[] | Matrix} size  The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+
+
+  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!isCollection(size)) {
+      throw new TypeError('Array or Matrix expected');
+    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+
+
+    var sizeArray = size.valueOf().map(value => {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    });
+
+    if (sizeArray.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    } // check sizes
+
+
+    sizeArray.forEach(function (value) {
+      if (!isNumber(value) || !isInteger(value) || value < 0) {
+        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');
+      }
+    }); // matrix to resize
+
+    var m = copy ? this.clone() : this; // resize matrix
+
+    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);
+  };
+
+  function _resize(matrix, rows, columns, defaultValue) {
+    // value to insert at the time of growing matrix
+    var value = defaultValue || 0; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if (isString(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, matrix._datatype); // convert value to the same datatype
+
+      value = typed.convert(value, matrix._datatype);
+    } // should we insert the value?
+
+
+    var ins = !eq(value, zero); // old columns and rows
+
+    var r = matrix._size[0];
+    var c = matrix._size[1];
+    var i, j, k; // check we need to increase columns
+
+    if (columns > c) {
+      // loop new columns
+      for (j = c; j < columns; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._values.length; // check we need to insert matrix._values
+
+        if (ins) {
+          // loop rows
+          for (i = 0; i < r; i++) {
+            // add new matrix._values
+            matrix._values.push(value); // update matrix._index
+
+
+            matrix._index.push(i);
+          }
+        }
+      } // store number of matrix._values in matrix._ptr
+
+
+      matrix._ptr[columns] = matrix._values.length;
+    } else if (columns < c) {
+      // truncate matrix._ptr
+      matrix._ptr.splice(columns + 1, c - columns); // truncate matrix._values and matrix._index
+
+
+      matrix._values.splice(matrix._ptr[columns], matrix._values.length);
+
+      matrix._index.splice(matrix._ptr[columns], matrix._index.length);
+    } // update columns
+
+
+    c = columns; // check we need to increase rows
+
+    if (rows > r) {
+      // check we have to insert values
+      if (ins) {
+        // inserts
+        var n = 0; // loop columns
+
+        for (j = 0; j < c; j++) {
+          // update matrix._ptr for current column
+          matrix._ptr[j] = matrix._ptr[j] + n; // where to insert matrix._values
+
+          k = matrix._ptr[j + 1] + n; // pointer
+
+          var p = 0; // loop new rows, initialize pointer
+
+          for (i = r; i < rows; i++, p++) {
+            // add value
+            matrix._values.splice(k + p, 0, value); // update matrix._index
+
+
+            matrix._index.splice(k + p, 0, i); // increment inserts
+
+
+            n++;
+          }
+        } // store number of matrix._values in matrix._ptr
+
+
+        matrix._ptr[c] = matrix._values.length;
+      }
+    } else if (rows < r) {
+      // deletes
+      var d = 0; // loop columns
+
+      for (j = 0; j < c; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._ptr[j] - d; // where matrix._values start for next column
+
+        var k0 = matrix._ptr[j];
+        var k1 = matrix._ptr[j + 1] - d; // loop matrix._index
+
+        for (k = k0; k < k1; k++) {
+          // row
+          i = matrix._index[k]; // check we need to delete value and matrix._index
+
+          if (i > rows - 1) {
+            // remove value
+            matrix._values.splice(k, 1); // remove item from matrix._index
+
+
+            matrix._index.splice(k, 1); // increase deletes
+
+
+            d++;
+          }
+        }
+      } // update matrix._ptr for current column
+
+
+      matrix._ptr[j] = matrix._values.length;
+    } // update matrix._size
+
+
+    matrix._size[0] = rows;
+    matrix._size[1] = columns; // return matrix
+
+    return matrix;
+  }
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof SparseMatrix
+   * @param {number[]} sizes          The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+
+
+  SparseMatrix.prototype.reshape = function (sizes, copy) {
+    // validate arguments
+    if (!isArray(sizes)) {
+      throw new TypeError('Array expected');
+    }
+
+    if (sizes.length !== 2) {
+      throw new Error('Sparse matrices can only be reshaped in two dimensions');
+    } // check sizes
+
+
+    sizes.forEach(function (value) {
+      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {
+        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');
+      }
+    });
+    var currentLength = this._size[0] * this._size[1];
+    sizes = processSizesWildcard(sizes, currentLength);
+    var newLength = sizes[0] * sizes[1]; // m * n must not change
+
+    if (currentLength !== newLength) {
+      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');
+    } // matrix to reshape
+
+
+    var m = copy ? this.clone() : this; // return unchanged if the same shape
+
+    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {
+      return m;
+    } // Convert to COO format (generate a column index)
+
+
+    var colIndex = [];
+
+    for (var i = 0; i < m._ptr.length; i++) {
+      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {
+        colIndex.push(i);
+      }
+    } // Clone the values array
+
+
+    var values = m._values.slice(); // Clone the row index array
+
+
+    var rowIndex = m._index.slice(); // Transform the (row, column) indices
+
+
+    for (var _i = 0; _i < m._index.length; _i++) {
+      var r1 = rowIndex[_i];
+      var c1 = colIndex[_i];
+      var flat = r1 * m._size[1] + c1;
+      colIndex[_i] = flat % sizes[1];
+      rowIndex[_i] = Math.floor(flat / sizes[1]);
+    } // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored
+    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,
+    // sorting several arrays based on some other array.
+    // OR, we could easily just:
+    // 1. Remove all values from the matrix
+
+
+    m._values.length = 0;
+    m._index.length = 0;
+    m._ptr.length = sizes[1] + 1;
+    m._size = sizes.slice();
+
+    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {
+      m._ptr[_i2] = 0;
+    } // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)
+    // This step is probably the most time-consuming
+
+
+    for (var h = 0; h < values.length; h++) {
+      var _i3 = rowIndex[h];
+      var _j = colIndex[h];
+      var v = values[h];
+
+      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);
+
+      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);
+    } // The value indices are inserted out of order, but apparently that's... still OK?
+
+
+    return m;
+  };
+  /**
+   * Create a clone of the matrix
+   * @memberof SparseMatrix
+   * @return {SparseMatrix} clone
+   */
+
+
+  SparseMatrix.prototype.clone = function () {
+    var m = new SparseMatrix({
+      values: this._values ? clone(this._values) : undefined,
+      index: clone(this._index),
+      ptr: clone(this._ptr),
+      size: clone(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof SparseMatrix
+   * @returns {number[]} size
+   */
+
+
+  SparseMatrix.prototype.size = function () {
+    return this._size.slice(0); // copy the Array
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {SparseMatrix} matrix
+   */
+
+
+  SparseMatrix.prototype.map = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke map on a Pattern only matrix');
+    } // matrix instance
+
+
+    var me = this; // rows and columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // invoke callback
+
+    var invoke = function invoke(v, i, j) {
+      // invoke callback
+      return callback(v, [i, j], me);
+    }; // invoke _map
+
+
+    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);
+  };
+  /**
+   * Create a new matrix with the results of the callback function executed on the interval
+   * [minRow..maxRow, minColumn..maxColumn].
+   */
+
+
+  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {
+    // result arrays
+    var values = [];
+    var index = [];
+    var ptr = []; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if (isString(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, matrix._datatype);
+    } // invoke callback
+
+
+    var invoke = function invoke(v, x, y) {
+      // invoke callback
+      v = callback(v, x, y); // check value != 0
+
+      if (!eq(v, zero)) {
+        // store value
+        values.push(v); // index
+
+        index.push(x);
+      }
+    }; // loop columns
+
+
+    for (var j = minColumn; j <= maxColumn; j++) {
+      // store pointer to values index
+      ptr.push(values.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+
+      var k0 = matrix._ptr[j];
+      var k1 = matrix._ptr[j + 1];
+
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (var k = k0; k < k1; k++) {
+          // row index
+          var i = matrix._index[k]; // check i is in range
+
+          if (i >= minRow && i <= maxRow) {
+            // value @ k
+            invoke(matrix._values[k], i - minRow, j - minColumn);
+          }
+        }
+      } else {
+        // create a cache holding all defined values
+        var _values = {};
+
+        for (var _k = k0; _k < k1; _k++) {
+          var _i4 = matrix._index[_k];
+          _values[_i4] = matrix._values[_k];
+        } // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+
+
+        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {
+          var value = _i5 in _values ? _values[_i5] : 0;
+          invoke(value, _i5 - minRow, j - minColumn);
+        }
+      }
+    } // store number of values in ptr
+
+
+    ptr.push(values.length); // return sparse matrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]
+    });
+  }
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *                              If false, the indices are guaranteed to be in order,
+   *                              if true, the indices can be unordered.
+   */
+
+
+  SparseMatrix.prototype.forEach = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke forEach on a Pattern only matrix');
+    } // matrix instance
+
+
+    var me = this; // rows and columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1];
+
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (var k = k0; k < k1; k++) {
+          // row index
+          var i = this._index[k]; // value @ k
+
+          callback(this._values[k], [i, j], me);
+        }
+      } else {
+        // create a cache holding all defined values
+        var values = {};
+
+        for (var _k2 = k0; _k2 < k1; _k2++) {
+          var _i6 = this._index[_k2];
+          values[_i6] = this._values[_k2];
+        } // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+
+
+        for (var _i7 = 0; _i7 < rows; _i7++) {
+          var value = _i7 in values ? values[_i7] : 0;
+          callback(value, [_i7, j], me);
+        }
+      }
+    }
+  };
+  /**
+   * Iterate over the matrix elements, skipping zeros
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+
+
+  SparseMatrix.prototype[Symbol.iterator] = function* () {
+    if (!this._values) {
+      throw new Error('Cannot iterate a Pattern only matrix');
+    }
+
+    var columns = this._size[1];
+
+    for (var j = 0; j < columns; j++) {
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1];
+
+      for (var k = k0; k < k1; k++) {
+        // row index
+        var i = this._index[k];
+        yield {
+          value: this._values[k],
+          index: [i, j]
+        };
+      }
+    }
+  };
+  /**
+   * Create an Array with a copy of the data of the SparseMatrix
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+
+
+  SparseMatrix.prototype.toArray = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, true);
+  };
+  /**
+   * Get the primitive value of the SparseMatrix: a two dimensions array
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+
+
+  SparseMatrix.prototype.valueOf = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, false);
+  };
+
+  function _toArray(values, index, ptr, size, copy) {
+    // rows and columns
+    var rows = size[0];
+    var columns = size[1]; // result
+
+    var a = []; // vars
+
+    var i, j; // initialize array
+
+    for (i = 0; i < rows; i++) {
+      a[i] = [];
+
+      for (j = 0; j < columns; j++) {
+        a[i][j] = 0;
+      }
+    } // loop columns
+
+
+    for (j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1]; // loop k within [k0, k1[
+
+      for (var k = k0; k < k1; k++) {
+        // row index
+        i = index[k]; // set value (use one for pattern matrix)
+
+        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;
+      }
+    }
+
+    return a;
+  }
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof SparseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+
+
+  SparseMatrix.prototype.format = function (options) {
+    // rows and columns
+    var rows = this._size[0];
+    var columns = this._size[1]; // density
+
+    var density = this.density(); // rows & columns
+
+    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\n'; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1]; // loop k within [k0, k1[
+
+      for (var k = k0; k < k1; k++) {
+        // row index
+        var i = this._index[k]; // append value
+
+        str += '\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');
+      }
+    }
+
+    return str;
+  };
+  /**
+   * Get a string representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {string} str
+   */
+
+
+  SparseMatrix.prototype.toString = function () {
+    return format(this.toArray());
+  };
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {Object}
+   */
+
+
+  SparseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'SparseMatrix',
+      values: this._values,
+      index: this._index,
+      ptr: this._ptr,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof SparseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix vector with the diagonal values.
+   */
+
+
+  SparseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows & columns
+
+    var rows = this._size[0];
+    var columns = this._size[1]; // number diagonal values
+
+    var n = Math.min(rows - kSub, columns - kSuper); // diagonal arrays
+
+    var values = [];
+    var index = [];
+    var ptr = []; // initial ptr value
+
+    ptr[0] = 0; // loop columns
+
+    for (var j = kSuper; j < columns && values.length < n; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1]; // loop x within [k0, k1[
+
+      for (var x = k0; x < k1; x++) {
+        // row index
+        var i = this._index[x]; // check row
+
+        if (i === j - kSuper + kSub) {
+          // value on this column
+          values.push(this._values[x]); // store row
+
+          index[values.length - 1] = i - kSub; // exit loop
+
+          break;
+        }
+      }
+    } // close ptr
+
+
+    ptr.push(values.length); // return matrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: [n, 1]
+    });
+  };
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof SparseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SparseMatrix", "values": [], "index": [], "ptr": [], "size": []}`,
+   *                       where mathjs is optional
+   * @returns {SparseMatrix}
+   */
+
+
+  SparseMatrix.fromJSON = function (json) {
+    return new SparseMatrix(json);
+  };
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {Array} size                       The matrix size.
+   * @param {number | Array | Matrix } value   The values for the diagonal.
+   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]            The default value for non-diagonal
+   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.
+   *
+   * @returns {SparseMatrix}
+   */
+
+
+  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {
+    if (!isArray(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    } // map size & validate
+
+
+    size = size.map(function (s) {
+      // check it is a big number
+      if (isBigNumber(s)) {
+        // convert it
+        s = s.toNumber();
+      } // validate arguments
+
+
+      if (!isNumber(s) || !isInteger(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+
+      return s;
+    }); // validate k if any
+
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      } // is must be an integer
+
+
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    } // equal signature to use
+
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0;
+
+    if (isString(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype
+
+      zero = typed.convert(0, datatype);
+    }
+
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0; // rows and columns
+
+    var rows = size[0];
+    var columns = size[1]; // number of non-zero items
+
+    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function
+
+    var _value; // check value
+
+
+    if (isArray(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if (isMatrix(value)) {
+      // matrix size
+      var ms = value.size(); // validate matrix
+
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      } // define function
+
+
+      _value = function _value(i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function _value() {
+        // return value
+        return value;
+      };
+    } // create arrays
+
+
+    var values = [];
+    var index = [];
+    var ptr = []; // loop items
+
+    for (var j = 0; j < columns; j++) {
+      // number of rows with value
+      ptr.push(values.length); // diagonal index
+
+      var i = j - kSuper; // check we need to set diagonal value
+
+      if (i >= 0 && i < n) {
+        // get value @ i
+        var v = _value(i); // check for zero
+
+
+        if (!eq(v, zero)) {
+          // column
+          index.push(i + kSub); // add value
+
+          values.push(v);
+        }
+      }
+    } // last value should be number of values
+
+
+    ptr.push(values.length); // create SparseMatrix
+
+    return new SparseMatrix({
+      values: values,
+      index: index,
+      ptr: ptr,
+      size: [rows, columns]
+    });
+  };
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+
+
+  SparseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {
+      throw new Error('Row index must be positive integers');
+    } // check dimensions
+
+
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    } // validate index
+
+
+    validateIndex(i, this._size[0]);
+    validateIndex(j, this._size[0]); // swap rows
+
+    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); // return current instance
+
+
+    return this;
+  };
+  /**
+   * Loop rows with data in column j.
+   *
+   * @param {number} j            Column
+   * @param {Array} values        Matrix values
+   * @param {Array} index         Matrix row indeces
+   * @param {Array} ptr           Matrix column pointers
+   * @param {Function} callback   Callback function invoked for every row in column j
+   */
+
+
+  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {
+    // indeces for column j
+    var k0 = ptr[j];
+    var k1 = ptr[j + 1]; // loop
+
+    for (var k = k0; k < k1; k++) {
+      // invoke callback
+      callback(index[k], values[k]);
+    }
+  };
+  /**
+   * Swap rows x and y in Sparse Matrix data structures.
+   *
+   * @param {number} x         Matrix row index 1
+   * @param {number} y         Matrix row index 2
+   * @param {number} columns   Number of columns in matrix
+   * @param {Array} values     Matrix values
+   * @param {Array} index      Matrix row indeces
+   * @param {Array} ptr        Matrix column pointers
+   */
+
+
+  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1]; // find value index @ x
+
+      var kx = _getValueIndex(x, k0, k1, index); // find value index @ x
+
+
+      var ky = _getValueIndex(y, k0, k1, index); // check both rows exist in matrix
+
+
+      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {
+        // swap values (check for pattern matrix)
+        if (values) {
+          var v = values[kx];
+          values[kx] = values[ky];
+          values[ky] = v;
+        } // next column
+
+
+        continue;
+      } // check x row exist & no y row
+
+
+      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {
+        // value @ x (check for pattern matrix)
+        var vx = values ? values[kx] : undefined; // insert value @ y
+
+        index.splice(ky, 0, y);
+
+        if (values) {
+          values.splice(ky, 0, vx);
+        } // remove value @ x (adjust array index if needed)
+
+
+        index.splice(ky <= kx ? kx + 1 : kx, 1);
+
+        if (values) {
+          values.splice(ky <= kx ? kx + 1 : kx, 1);
+        } // next column
+
+
+        continue;
+      } // check y row exist & no x row
+
+
+      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {
+        // value @ y (check for pattern matrix)
+        var vy = values ? values[ky] : undefined; // insert value @ x
+
+        index.splice(kx, 0, x);
+
+        if (values) {
+          values.splice(kx, 0, vy);
+        } // remove value @ y (adjust array index if needed)
+
+
+        index.splice(kx <= ky ? ky + 1 : ky, 1);
+
+        if (values) {
+          values.splice(kx <= ky ? ky + 1 : ky, 1);
+        }
+      }
+    }
+  };
+
+  return SparseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/function/index.js b/node_modules/mathjs/lib/esm/type/matrix/function/index.js
new file mode 100644
index 0000000..97e2d6b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/function/index.js
@@ -0,0 +1,63 @@
+import { factory } from '../../../utils/factory.js';
+import { isBigNumber, isMatrix } from '../../../utils/is.js';
+var name = 'index';
+var dependencies = ['typed', 'Index'];
+export var createIndex = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index
+  } = _ref;
+
+  /**
+   * Create an index. An Index can store ranges having start, step, and end
+   * for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Syntax:
+   *
+   *     math.index(range1, range2, ...)
+   *
+   * Where each range can be any of:
+   *
+   * - A number
+   * - A string for getting/setting an object property
+   * - An instance of `Range`
+   * - A one-dimensional Array or a Matrix with numbers
+   *
+   * Indexes must be zero-based, integer numbers.
+   *
+   * Examples:
+   *
+   *    const b = [1, 2, 3, 4, 5]
+   *    math.subset(b, math.index([1, 2, 3]))     // returns [2, 3, 4]
+   *
+   *    const a = math.matrix([[1, 2], [3, 4]])
+   *    a.subset(math.index(0, 1))             // returns 2
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, matrix, number, string, unit
+   *
+   * @param {...*} ranges   Zero or more ranges or numbers.
+   * @return {Index}        Returns the created index
+   */
+  return typed(name, {
+    '...number | string | BigNumber | Range | Array | Matrix': function numberStringBigNumberRangeArrayMatrix(args) {
+      var ranges = args.map(function (arg) {
+        if (isBigNumber(arg)) {
+          return arg.toNumber(); // convert BigNumber to Number
+        } else if (Array.isArray(arg) || isMatrix(arg)) {
+          return arg.map(function (elem) {
+            // convert BigNumber to Number
+            return isBigNumber(elem) ? elem.toNumber() : elem;
+          });
+        } else {
+          return arg;
+        }
+      });
+      var res = new Index();
+      Index.apply(res, ranges);
+      return res;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js b/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js
new file mode 100644
index 0000000..07f746d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js
@@ -0,0 +1,85 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'matrix';
+var dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];
+export var createMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Matrix,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+
+  /**
+   * Create a Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   * Supported storage formats are 'dense' and 'sparse'.
+   *
+   * Syntax:
+   *
+   *    math.matrix()                         // creates an empty matrix using default storage format (dense).
+   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).
+   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.
+   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.
+   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.
+   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.
+   *
+   * Examples:
+   *
+   *    let m = math.matrix([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, sparse
+   *
+   * @param {Array | Matrix} [data]    A multi dimensional array
+   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]        Type of the values
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return _create([]);
+    },
+    string: function string(format) {
+      return _create([], format);
+    },
+    'string, string': function stringString(format, datatype) {
+      return _create([], format, datatype);
+    },
+    Array: function Array(data) {
+      return _create(data);
+    },
+    Matrix: function Matrix(data) {
+      return _create(data, data.storage());
+    },
+    'Array | Matrix, string': _create,
+    'Array | Matrix, string, string': _create
+  });
+  /**
+   * Create a new Matrix with given storage format
+   * @param {Array} data
+   * @param {string} [format]
+   * @param {string} [datatype]
+   * @returns {Matrix} Returns a new Matrix
+   * @private
+   */
+
+  function _create(data, format, datatype) {
+    // get storage format constructor
+    if (format === 'dense' || format === 'default' || format === undefined) {
+      return new DenseMatrix(data, datatype);
+    }
+
+    if (format === 'sparse') {
+      return new SparseMatrix(data, datatype);
+    }
+
+    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/function/sparse.js b/node_modules/mathjs/lib/esm/type/matrix/function/sparse.js
new file mode 100644
index 0000000..ed4fe91
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/function/sparse.js
@@ -0,0 +1,51 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'sparse';
+var dependencies = ['typed', 'SparseMatrix'];
+export var createSparse = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    SparseMatrix
+  } = _ref;
+
+  /**
+   * Create a Sparse Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   *
+   * Syntax:
+   *
+   *    math.sparse()               // creates an empty sparse matrix.
+   *    math.sparse(data)           // creates a sparse matrix with initial data.
+   *    math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.
+   *
+   * Examples:
+   *
+   *    let m = math.sparse([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, matrix
+   *
+   * @param {Array | Matrix} [data]    A two dimensional array
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return new SparseMatrix([]);
+    },
+    string: function string(datatype) {
+      return new SparseMatrix([], datatype);
+    },
+    'Array | Matrix': function ArrayMatrix(data) {
+      return new SparseMatrix(data);
+    },
+    'Array | Matrix, string': function ArrayMatrixString(data, datatype) {
+      return new SparseMatrix(data, datatype);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm01.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm01.js
new file mode 100644
index 0000000..14eaf3d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm01.js
@@ -0,0 +1,109 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm01';
+var dependencies = ['typed'];
+export var createAlgorithm01 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  Dij          ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype; // sparse matrix arrays
+
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // process data types
+
+    var dt = typeof adt === 'string' && adt === bdt ? adt : undefined; // callback function
+
+    var cf = dt ? typed.find(callback, [dt, dt]) : callback; // vars
+
+    var i, j; // result (DenseMatrix)
+
+    var cdata = []; // initialize c
+
+    for (i = 0; i < rows; i++) {
+      cdata[i] = [];
+    } // workspace
+
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns in b
+
+    for (j = 0; j < columns; j++) {
+      // column mark
+      var mark = j + 1; // values in column j
+
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k]; // update workspace
+
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // mark i as updated
+
+        w[i] = mark;
+      } // loop rows
+
+
+      for (i = 0; i < rows; i++) {
+        // check row is in workspace
+        if (w[i] === mark) {
+          // c[i][j] was already calculated
+          cdata[i][j] = x[i];
+        } else {
+          // item does not exist in S
+          cdata[i][j] = adata[i][j];
+        }
+      }
+    } // return dense matrix
+
+
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm02.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm02.js
new file mode 100644
index 0000000..3104097
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm02.js
@@ -0,0 +1,113 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm02';
+var dependencies = ['typed', 'equalScalar'];
+export var createAlgorithm02 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm02(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype; // sparse matrix arrays
+
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result (SparseMatrix)
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // loop columns in b
+
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // values in column j
+
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = bindex[k]; // update C(i,j)
+
+        var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // check for nonzero
+
+        if (!eq(cij, zero)) {
+          // push i & v
+          cindex.push(i);
+          cvalues.push(cij);
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return sparseMatrix.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm03.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm03.js
new file mode 100644
index 0000000..5d59000
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm03.js
@@ -0,0 +1,119 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm03';
+var dependencies = ['typed'];
+export var createAlgorithm03 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked M*N times.
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(Dij, 0)    ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm03(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype; // sparse matrix arrays
+
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result (DenseMatrix)
+
+
+    var cdata = []; // initialize dense matrix
+
+    for (var z = 0; z < rows; z++) {
+      // initialize row
+      cdata[z] = [];
+    } // workspace
+
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns in b
+
+    for (var j = 0; j < columns; j++) {
+      // column mark
+      var mark = j + 1; // values in column j
+
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = bindex[k]; // update workspace
+
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        w[i] = mark;
+      } // process workspace
+
+
+      for (var y = 0; y < rows; y++) {
+        // check we have a calculated value for current row
+        if (w[y] === mark) {
+          // use calculated value
+          cdata[y][j] = x[y];
+        } else {
+          // calculate value
+          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);
+        }
+      }
+    } // return dense matrix
+
+
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm04.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm04.js
new file mode 100644
index 0000000..163fbcb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm04.js
@@ -0,0 +1,176 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm04';
+var dependencies = ['typed', 'equalScalar'];
+export var createAlgorithm04 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0
+   *          └  B(i,j)       ; B(i,j) !== 0
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm04(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspace
+
+    var xa = avalues && bvalues ? [] : undefined;
+    var xb = avalues && bvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var wa = [];
+    var wb = []; // vars
+
+    var i, j, k, k0, k1; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // loop A(:,j)
+
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k]; // update c
+
+        cindex.push(i); // update workspace
+
+        wa[i] = mark; // check we need to process values
+
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      } // loop B(:,j)
+
+
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k]; // check row exists in A
+
+        if (wa[i] === mark) {
+          // update record in xa @ i
+          if (xa) {
+            // invoke callback
+            var v = cf(xa[i], bvalues[k]); // check for zero
+
+            if (!eq(v, zero)) {
+              // update workspace
+              xa[i] = v;
+            } else {
+              // remove mark (index will be removed later)
+              wa[i] = null;
+            }
+          }
+        } else {
+          // update c
+          cindex.push(i); // update workspace
+
+          wb[i] = mark; // check we need to process values
+
+          if (xb) {
+            xb[i] = bvalues[k];
+          }
+        }
+      } // check we need to process values (non pattern matrix)
+
+
+      if (xa && xb) {
+        // initialize first index in j
+        k = cptr[j]; // loop index in j
+
+        while (k < cindex.length) {
+          // row
+          i = cindex[k]; // check workspace has value @ i
+
+          if (wa[i] === mark) {
+            // push value (Aij != 0 || (Aij != 0 && Bij != 0))
+            cvalues[k] = xa[i]; // increment pointer
+
+            k++;
+          } else if (wb[i] === mark) {
+            // push value (bij != 0)
+            cvalues[k] = xb[i]; // increment pointer
+
+            k++;
+          } else {
+            // remove index @ k
+            cindex.splice(k, 1);
+          }
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm05.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm05.js
new file mode 100644
index 0000000..c12740d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm05.js
@@ -0,0 +1,169 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm05';
+var dependencies = ['typed', 'equalScalar'];
+export var createAlgorithm05 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm05(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspaces
+
+    var xa = cvalues ? [] : undefined;
+    var xb = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var wa = [];
+    var wb = []; // vars
+
+    var i, j, k, k1; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // loop values A(:,j)
+
+      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {
+        // row
+        i = aindex[k]; // push index
+
+        cindex.push(i); // update workspace
+
+        wa[i] = mark; // check we need to process values
+
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      } // loop values B(:,j)
+
+
+      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {
+        // row
+        i = bindex[k]; // check row existed in A
+
+        if (wa[i] !== mark) {
+          // push index
+          cindex.push(i);
+        } // update workspace
+
+
+        wb[i] = mark; // check we need to process values
+
+        if (xb) {
+          xb[i] = bvalues[k];
+        }
+      } // check we need to process values (non pattern matrix)
+
+
+      if (cvalues) {
+        // initialize first index in j
+        k = cptr[j]; // loop index in j
+
+        while (k < cindex.length) {
+          // row
+          i = cindex[k]; // marks
+
+          var wai = wa[i];
+          var wbi = wb[i]; // check Aij or Bij are nonzero
+
+          if (wai === mark || wbi === mark) {
+            // matrix values @ i,j
+            var va = wai === mark ? xa[i] : zero;
+            var vb = wbi === mark ? xb[i] : zero; // Cij
+
+            var vc = cf(va, vb); // check for zero
+
+            if (!eq(vc, zero)) {
+              // push value
+              cvalues.push(vc); // increment pointer
+
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          }
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm06.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm06.js
new file mode 100644
index 0000000..e92f678
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm06.js
@@ -0,0 +1,149 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+import { scatter } from '../../../utils/collection.js';
+var name = 'algorithm06';
+var dependencies = ['typed', 'equalScalar'];
+export var createAlgorithm06 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm06(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspaces
+
+    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var w = []; // marks indicating value in a given row has been updated
+
+    var u = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // scatter the values of A(:,j) into workspace
+
+      scatter(a, j, w, x, u, mark, cindex, cf); // scatter the values of B(:,j) into workspace
+
+      scatter(b, j, w, x, u, mark, cindex, cf); // check we need to process values (non pattern matrix)
+
+      if (x) {
+        // initialize first index in j
+        var k = cptr[j]; // loop index in j
+
+        while (k < cindex.length) {
+          // row
+          var i = cindex[k]; // check function was invoked on current row (Aij !=0 && Bij != 0)
+
+          if (u[i] === mark) {
+            // value @ i
+            var v = x[i]; // check for zero value
+
+            if (!eq(v, zero)) {
+              // push value
+              cvalues.push(v); // increment pointer
+
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          } else {
+            // remove value @ i, do not increment pointer
+            cindex.splice(k, 1);
+          }
+        }
+      } else {
+        // initialize first index in j
+        var p = cptr[j]; // loop index in j
+
+        while (p < cindex.length) {
+          // row
+          var r = cindex[p]; // check function was invoked on current row (Aij !=0 && Bij != 0)
+
+          if (u[r] !== mark) {
+            // remove value @ i, do not increment pointer
+            cindex.splice(p, 1);
+          } else {
+            // increment pointer
+            p++;
+          }
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm07.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm07.js
new file mode 100644
index 0000000..0414c5a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm07.js
@@ -0,0 +1,118 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm07';
+var dependencies = ['typed', 'DenseMatrix'];
+export var createAlgorithm07 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j) = f(Aij, Bij)
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm07(a, b, callback) {
+    // sparse matrix arrays
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // vars
+
+
+    var i, j; // result arrays
+
+    var cdata = []; // initialize c
+
+    for (i = 0; i < rows; i++) {
+      cdata[i] = [];
+    } // workspaces
+
+
+    var xa = [];
+    var xb = []; // marks indicating we have a value in x for a given column
+
+    var wa = [];
+    var wb = []; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1; // scatter the values of A(:,j) into workspace
+
+      _scatter(a, j, wa, xa, mark); // scatter the values of B(:,j) into workspace
+
+
+      _scatter(b, j, wb, xb, mark); // loop rows
+
+
+      for (i = 0; i < rows; i++) {
+        // matrix values @ i,j
+        var va = wa[i] === mark ? xa[i] : zero;
+        var vb = wb[i] === mark ? xb[i] : zero; // invoke callback
+
+        cdata[i][j] = cf(va, vb);
+      }
+    } // return dense matrix
+
+
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+
+  function _scatter(m, j, w, x, mark) {
+    // a arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr; // loop values in column j
+
+    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {
+      // row
+      var i = index[k]; // update workspace
+
+      w[i] = mark;
+      x[i] = values[k];
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm08.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm08.js
new file mode 100644
index 0000000..eca7727
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm08.js
@@ -0,0 +1,151 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm08';
+var dependencies = ['typed', 'equalScalar'];
+export var createAlgorithm08 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm08(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // sparse matrix cannot be a Pattern matrix
+
+
+    if (!avalues || !bvalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrices');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // workspace
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // vars
+
+    var k, k0, k1, i; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // columns mark
+
+      var mark = j + 1; // loop values in a
+
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k]; // mark workspace
+
+        w[i] = mark; // set value
+
+        x[i] = avalues[k]; // add index
+
+        cindex.push(i);
+      } // loop values in b
+
+
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k]; // check value exists in workspace
+
+        if (w[i] === mark) {
+          // evaluate callback
+          x[i] = cf(x[i], bvalues[k]);
+        }
+      } // initialize first index in j
+
+
+      k = cptr[j]; // loop index in j
+
+      while (k < cindex.length) {
+        // row
+        i = cindex[k]; // value @ i
+
+        var v = x[i]; // check for zero value
+
+        if (!eq(v, zero)) {
+          // push value
+          cvalues.push(v); // increment pointer
+
+          k++;
+        } else {
+          // remove value @ i, do not increment pointer
+          cindex.splice(k, 1);
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm09.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm09.js
new file mode 100644
index 0000000..8c67b81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm09.js
@@ -0,0 +1,138 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm09';
+var dependencies = ['typed', 'equalScalar'];
+export var createAlgorithm09 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).
+   * Callback function invoked NZA times, number of nonzero elements in A.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function algorithm09(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype; // sparse matrix arrays
+
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // check rows & columns
+
+
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = []; // workspaces
+
+    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
+
+    var w = []; // vars
+
+    var i, j, k, k0, k1; // loop columns
+
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length; // column mark
+
+      var mark = j + 1; // check we need to process values
+
+      if (x) {
+        // loop B(:,j)
+        for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+          // row
+          i = bindex[k]; // update workspace
+
+          w[i] = mark;
+          x[i] = bvalues[k];
+        }
+      } // loop A(:,j)
+
+
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k]; // check we need to process values
+
+        if (x) {
+          // b value @ i,j
+          var vb = w[i] === mark ? x[i] : zero; // invoke f
+
+          var vc = cf(avalues[k], vb); // check zero value
+
+          if (!eq(vc, zero)) {
+            // push index
+            cindex.push(i); // push value
+
+            cvalues.push(vc);
+          }
+        } else {
+          // push index
+          cindex.push(i);
+        }
+      }
+    } // update cptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm10.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm10.js
new file mode 100644
index 0000000..5bb4e3d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm10.js
@@ -0,0 +1,103 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'algorithm10';
+var dependencies = ['typed', 'DenseMatrix'];
+export var createAlgorithm10 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  b          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function algorithm10(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
+
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cdata = []; // workspaces
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1; // values in j
+
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var r = aindex[k]; // update workspace
+
+        x[r] = avalues[k];
+        w[r] = mark;
+      } // loop rows
+
+
+      for (var i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        } // check sparse matrix has a value @ i,j
+
+
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = b;
+        }
+      }
+    } // return dense matrix
+
+
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm11.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm11.js
new file mode 100644
index 0000000..d6e2487
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm11.js
@@ -0,0 +1,100 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'algorithm11';
+var dependencies = ['typed', 'equalScalar'];
+export var createAlgorithm11 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function algorithm11(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
+
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // equal signature to use
+
+    var eq = equalScalar; // zero value
+
+    var zero = 0; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // find signature that matches (dt, dt)
+
+      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
+
+      zero = typed.convert(0, dt); // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cvalues = [];
+    var cindex = [];
+    var cptr = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // initialize ptr
+      cptr[j] = cindex.length; // values in j
+
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = aindex[k]; // invoke callback
+
+        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b); // check value is zero
+
+        if (!eq(v, zero)) {
+          // push index & value
+          cindex.push(i);
+          cvalues.push(v);
+        }
+      }
+    } // update ptr
+
+
+    cptr[columns] = cindex.length; // return sparse matrix
+
+    return s.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm12.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm12.js
new file mode 100644
index 0000000..77cb217
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm12.js
@@ -0,0 +1,103 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'algorithm12';
+var dependencies = ['typed', 'DenseMatrix'];
+export var createAlgorithm12 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    DenseMatrix
+  } = _ref;
+
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked MxN times.
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(0, b)    ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function algorithm12(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
+
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    } // rows & columns
+
+
+    var rows = asize[0];
+    var columns = asize[1]; // datatype
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // result arrays
+
+
+    var cdata = []; // workspaces
+
+    var x = []; // marks indicating we have a value in x for a given column
+
+    var w = []; // loop columns
+
+    for (var j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1; // values in j
+
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var r = aindex[k]; // update workspace
+
+        x[r] = avalues[k];
+        w[r] = mark;
+      } // loop rows
+
+
+      for (var i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        } // check sparse matrix has a value @ i,j
+
+
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);
+        }
+      }
+    } // return dense matrix
+
+
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm13.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm13.js
new file mode 100644
index 0000000..7158686
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm13.js
@@ -0,0 +1,93 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'algorithm13';
+var dependencies = ['typed'];
+export var createAlgorithm13 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, Bij..z)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Matrix}   b                 The DenseMatrix instance (B)
+   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658
+   */
+  return function algorithm13(a, b, callback) {
+    // a arrays
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // b arrays
+
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype; // c arrays
+
+    var csize = []; // validate dimensions
+
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    } // validate each one of the dimension sizes
+
+
+    for (var s = 0; s < asize.length; s++) {
+      // must match
+      if (asize[s] !== bsize[s]) {
+        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+      } // update dimension in c
+
+
+      csize[s] = asize[s];
+    } // datatype
+
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt; // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // populate cdata, iterate through dimensions
+
+
+    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []; // c matrix
+
+    return a.createDenseMatrix({
+      data: cdata,
+      size: csize,
+      datatype: dt
+    });
+  }; // recursive function
+
+  function _iterate(f, level, s, n, av, bv) {
+    // initialize array for this level
+    var cv = []; // check we reach the last level
+
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (var i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = f(av[i], bv[i]);
+      }
+    } else {
+      // iterate current level
+      for (var j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);
+      }
+    }
+
+    return cv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm14.js b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm14.js
new file mode 100644
index 0000000..ee67bb7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/algorithm14.js
@@ -0,0 +1,74 @@
+import { factory } from '../../../utils/factory.js';
+import { clone } from '../../../utils/object.js';
+var name = 'algorithm14';
+var dependencies = ['typed'];
+export var createAlgorithm14 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, b)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij..z,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042
+   */
+  return function algorithm14(a, b, callback, inverse) {
+    // a arrays
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype; // datatype
+
+    var dt; // callback signature to use
+
+    var cf = callback; // process data types
+
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt; // convert b to the same datatype
+
+      b = typed.convert(b, dt); // callback
+
+      cf = typed.find(callback, [dt, dt]);
+    } // populate cdata, iterate through dimensions
+
+
+    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []; // c matrix
+
+    return a.createDenseMatrix({
+      data: cdata,
+      size: clone(asize),
+      datatype: dt
+    });
+  }; // recursive function
+
+  function _iterate(f, level, s, n, av, bv, inverse) {
+    // initialize array for this level
+    var cv = []; // check we reach the last level
+
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (var i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);
+      }
+    } else {
+      // iterate current level
+      for (var j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);
+      }
+    }
+
+    return cv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/number.js b/node_modules/mathjs/lib/esm/type/number.js
new file mode 100644
index 0000000..ab06a95
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/number.js
@@ -0,0 +1,163 @@
+import { factory } from '../utils/factory.js';
+import { deepMap } from '../utils/collection.js';
+var name = 'number';
+var dependencies = ['typed'];
+/**
+ * Separates the radix, integer part, and fractional part of a non decimal number string
+ * @param {string} input string to parse
+ * @returns {object} the parts of the string or null if not a valid input
+ */
+
+function getNonDecimalNumberParts(input) {
+  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/);
+
+  if (nonDecimalWithRadixMatch) {
+    var radix = {
+      '0b': 2,
+      '0o': 8,
+      '0x': 16
+    }[nonDecimalWithRadixMatch[1]];
+    var integerPart = nonDecimalWithRadixMatch[2];
+    var fractionalPart = nonDecimalWithRadixMatch[3];
+    return {
+      input,
+      radix,
+      integerPart,
+      fractionalPart
+    };
+  } else {
+    return null;
+  }
+}
+/**
+ * Makes a number from a radix, and integer part, and a fractional part
+ * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)
+ * @returns {number} the number
+ */
+
+
+function makeNumberFromNonDecimalParts(parts) {
+  var n = parseInt(parts.integerPart, parts.radix);
+  var f = 0;
+
+  for (var i = 0; i < parts.fractionalPart.length; i++) {
+    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);
+    f += digitValue / Math.pow(parts.radix, i + 1);
+  }
+
+  var result = n + f;
+
+  if (isNaN(result)) {
+    throw new SyntaxError('String "' + parts.input + '" is no valid number');
+  }
+
+  return result;
+}
+
+export var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Create a number or convert a string, boolean, or unit to a number.
+   * When value is a matrix, all elements will be converted to number.
+   *
+   * Syntax:
+   *
+   *    math.number(value)
+   *    math.number(unit, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.number(2)                         // returns number 2
+   *    math.number('7.2')                     // returns number 7.2
+   *    math.number(true)                      // returns number 1
+   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]
+   *    math.number(math.unit('52cm'), 'm')    // returns 0.52
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, string, unit
+   *
+   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted
+   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number
+   * @return {number | Array | Matrix} The created number
+   */
+  var number = typed('number', {
+    '': function _() {
+      return 0;
+    },
+    number: function number(x) {
+      return x;
+    },
+    string: function string(x) {
+      if (x === 'NaN') return NaN;
+      var nonDecimalNumberParts = getNonDecimalNumberParts(x);
+
+      if (nonDecimalNumberParts) {
+        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);
+      }
+
+      var size = 0;
+      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+
+      if (wordSizeSuffixMatch) {
+        // x includes a size suffix like 0xffffi32, so we extract
+        // the suffix and remove it from x
+        size = Number(wordSizeSuffixMatch[2]);
+        x = wordSizeSuffixMatch[1];
+      }
+
+      var num = Number(x);
+
+      if (isNaN(num)) {
+        throw new SyntaxError('String "' + x + '" is no valid number');
+      }
+
+      if (wordSizeSuffixMatch) {
+        // x is a signed bin, oct, or hex literal
+        // num is the value of string x if x is interpreted as unsigned
+        if (num > 2 ** size - 1) {
+          // literal is too large for size suffix
+          throw new SyntaxError("String \"".concat(x, "\" is out of range"));
+        } // check if the bit at index size - 1 is set and if so do the twos complement
+
+
+        if (num >= 2 ** (size - 1)) {
+          num = num - 2 ** size;
+        }
+      }
+
+      return num;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.toNumber();
+    },
+    Fraction: function Fraction(x) {
+      return x.valueOf();
+    },
+    Unit: function Unit(x) {
+      throw new Error('Second argument with valueless unit expected');
+    },
+    null: function _null(x) {
+      return 0;
+    },
+    'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {
+      return unit.toNumber(valuelessUnit);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  }); // reviver function to parse a JSON object like:
+  //
+  //     {"mathjs":"number","value":"2.3"}
+  //
+  // into a number 2.3
+
+  number.fromJSON = function (json) {
+    return parseFloat(json.value);
+  };
+
+  return number;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js b/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js
new file mode 100644
index 0000000..514097a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js
@@ -0,0 +1,74 @@
+import { factory } from '../../utils/factory.js';
+var name = 'ResultSet';
+var dependencies = [];
+export var createResultSet = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * A ResultSet contains a list or results
+   * @class ResultSet
+   * @param {Array} entries
+   * @constructor ResultSet
+   */
+  function ResultSet(entries) {
+    if (!(this instanceof ResultSet)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    this.entries = entries || [];
+  }
+  /**
+   * Attach type information
+   */
+
+
+  ResultSet.prototype.type = 'ResultSet';
+  ResultSet.prototype.isResultSet = true;
+  /**
+   * Returns the array with results hold by this ResultSet
+   * @memberof ResultSet
+   * @returns {Array} entries
+   */
+
+  ResultSet.prototype.valueOf = function () {
+    return this.entries;
+  };
+  /**
+   * Returns the stringified results of the ResultSet
+   * @memberof ResultSet
+   * @returns {string} string
+   */
+
+
+  ResultSet.prototype.toString = function () {
+    return '[' + this.entries.join(', ') + ']';
+  };
+  /**
+   * Get a JSON representation of the ResultSet
+   * @memberof ResultSet
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "ResultSet", "entries": [...]}`
+   */
+
+
+  ResultSet.prototype.toJSON = function () {
+    return {
+      mathjs: 'ResultSet',
+      entries: this.entries
+    };
+  };
+  /**
+   * Instantiate a ResultSet from a JSON object
+   * @memberof ResultSet
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "ResultSet", "entries": [...]}`
+   * @return {ResultSet}
+   */
+
+
+  ResultSet.fromJSON = function (json) {
+    return new ResultSet(json.entries);
+  };
+
+  return ResultSet;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/string.js b/node_modules/mathjs/lib/esm/type/string.js
new file mode 100644
index 0000000..43f14df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/string.js
@@ -0,0 +1,57 @@
+import { factory } from '../utils/factory.js';
+import { deepMap } from '../utils/collection.js';
+import { format } from '../utils/number.js';
+var name = 'string';
+var dependencies = ['typed'];
+export var createString = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Create a string or convert any object into a string.
+   * Elements of Arrays and Matrices are processed element wise.
+   *
+   * Syntax:
+   *
+   *    math.string(value)
+   *
+   * Examples:
+   *
+   *    math.string(4.2)               // returns string '4.2'
+   *    math.string(math.complex(3, 2) // returns string '3 + 2i'
+   *
+   *    const u = math.unit(5, 'km')
+   *    math.string(u.to('m'))         // returns string '5000 m'
+   *
+   *    math.string([true, false])     // returns ['true', 'false']
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, unit
+   *
+   * @param {* | Array | Matrix | null} [value]  A value to convert to a string
+   * @return {string | Array | Matrix} The created string
+   */
+  return typed(name, {
+    '': function _() {
+      return '';
+    },
+    number: format,
+    null: function _null(x) {
+      return 'null';
+    },
+    boolean: function boolean(x) {
+      return x + '';
+    },
+    string: function string(x) {
+      return x;
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    },
+    any: function any(x) {
+      return String(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/Unit.js b/node_modules/mathjs/lib/esm/type/unit/Unit.js
new file mode 100644
index 0000000..b64a1cf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/Unit.js
@@ -0,0 +1,3975 @@
+import _extends from "@babel/runtime/helpers/extends";
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+import { isComplex, isUnit, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { memoize } from '../../utils/function.js';
+import { endsWith } from '../../utils/string.js';
+import { clone, hasOwnProperty } from '../../utils/object.js';
+import { createBigNumberPi as createPi } from '../../utils/bignumber/constants.js';
+var name = 'Unit';
+var dependencies = ['?on', 'config', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];
+export var createUnitClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    on,
+    config,
+    addScalar,
+    subtract,
+    multiplyScalar,
+    divideScalar,
+    pow,
+    abs,
+    fix,
+    round,
+    equal,
+    isNumeric,
+    format,
+    number,
+    Complex,
+    BigNumber: _BigNumber,
+    Fraction: _Fraction
+  } = _ref;
+  var toNumber = number;
+  /**
+   * A unit can be constructed in the following ways:
+   *
+   *     const a = new Unit(value, name)
+   *     const b = new Unit(null, name)
+   *     const c = Unit.parse(str)
+   *
+   * Example usage:
+   *
+   *     const a = new Unit(5, 'cm')               // 50 mm
+   *     const b = Unit.parse('23 kg')             // 23 kg
+   *     const c = math.in(a, new Unit(null, 'm')  // 0.05 m
+   *     const d = new Unit(9.81, "m/s^2")         // 9.81 m/s^2
+   *
+   * @class Unit
+   * @constructor Unit
+   * @param {number | BigNumber | Fraction | Complex | boolean} [value]  A value like 5.2
+   * @param {string} [name]   A unit name like "cm" or "inch", or a derived unit of the form: "u1[^ex1] [u2[^ex2] ...] [/ u3[^ex3] [u4[^ex4]]]", such as "kg m^2/s^2", where each unit appearing after the forward slash is taken to be in the denominator. "kg m^2 s^-2" is a synonym and is also acceptable. Any of the units can include a prefix.
+   */
+
+  function Unit(value, name) {
+    if (!(this instanceof Unit)) {
+      throw new Error('Constructor must be called with the new operator');
+    }
+
+    if (!(value === null || value === undefined || isNumeric(value) || isComplex(value))) {
+      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');
+    }
+
+    if (name !== undefined && (typeof name !== 'string' || name === '')) {
+      throw new TypeError('Second parameter in Unit constructor must be a string');
+    }
+
+    if (name !== undefined) {
+      var u = Unit.parse(name);
+      this.units = u.units;
+      this.dimensions = u.dimensions;
+    } else {
+      this.units = [{
+        unit: UNIT_NONE,
+        prefix: PREFIXES.NONE,
+        // link to a list with supported prefixes
+        power: 0
+      }];
+      this.dimensions = [];
+
+      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+        this.dimensions[i] = 0;
+      }
+    }
+
+    this.value = value !== undefined && value !== null ? this._normalize(value) : null;
+    this.fixPrefix = false; // if true, function format will not search for the
+    // best prefix but leave it as initially provided.
+    // fixPrefix is set true by the method Unit.to
+    // The justification behind this is that if the constructor is explicitly called,
+    // the caller wishes the units to be returned exactly as he supplied.
+
+    this.skipAutomaticSimplification = true;
+  }
+  /**
+   * Attach type information
+   */
+
+
+  Unit.prototype.type = 'Unit';
+  Unit.prototype.isUnit = true; // private variables and functions for the Unit parser
+
+  var text, index, c;
+
+  function skipWhitespace() {
+    while (c === ' ' || c === '\t') {
+      next();
+    }
+  }
+
+  function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  }
+
+  function isDigit(c) {
+    return c >= '0' && c <= '9';
+  }
+
+  function next() {
+    index++;
+    c = text.charAt(index);
+  }
+
+  function revert(oldIndex) {
+    index = oldIndex;
+    c = text.charAt(index);
+  }
+
+  function parseNumber() {
+    var number = '';
+    var oldIndex = index;
+
+    if (c === '+') {
+      next();
+    } else if (c === '-') {
+      number += c;
+      next();
+    }
+
+    if (!isDigitDot(c)) {
+      // a + or - must be followed by a digit
+      revert(oldIndex);
+      return null;
+    } // get number, can have a single dot
+
+
+    if (c === '.') {
+      number += c;
+      next();
+
+      if (!isDigit(c)) {
+        // this is no legal number, it is just a dot
+        revert(oldIndex);
+        return null;
+      }
+    } else {
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+
+      if (c === '.') {
+        number += c;
+        next();
+      }
+    }
+
+    while (isDigit(c)) {
+      number += c;
+      next();
+    } // check for exponential notation like "2.3e-4" or "1.23e50"
+
+
+    if (c === 'E' || c === 'e') {
+      // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as "4exabytes"
+      var tentativeNumber = '';
+      var tentativeIndex = index;
+      tentativeNumber += c;
+      next();
+
+      if (c === '+' || c === '-') {
+        tentativeNumber += c;
+        next();
+      } // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)
+
+
+      if (!isDigit(c)) {
+        // The e or E must belong to something else, so return the number without the e or E.
+        revert(tentativeIndex);
+        return number;
+      } // We can now safely say that this is scientific notation.
+
+
+      number = number + tentativeNumber;
+
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+    }
+
+    return number;
+  }
+
+  function parseUnit() {
+    var unitName = ''; // Alphanumeric characters only; matches [a-zA-Z0-9]
+
+    while (isDigit(c) || Unit.isValidAlpha(c)) {
+      unitName += c;
+      next();
+    } // Must begin with [a-zA-Z]
+
+
+    var firstC = unitName.charAt(0);
+
+    if (Unit.isValidAlpha(firstC)) {
+      return unitName;
+    } else {
+      return null;
+    }
+  }
+
+  function parseCharacter(toFind) {
+    if (c === toFind) {
+      next();
+      return toFind;
+    } else {
+      return null;
+    }
+  }
+  /**
+   * Parse a string into a unit. The value of the unit is parsed as number,
+   * BigNumber, or Fraction depending on the math.js config setting `number`.
+   *
+   * Throws an exception if the provided string does not contain a valid unit or
+   * cannot be parsed.
+   * @memberof Unit
+   * @param {string} str        A string like "5.2 inch", "4e2 cm/s^2"
+   * @return {Unit} unit
+   */
+
+
+  Unit.parse = function (str, options) {
+    options = options || {};
+    text = str;
+    index = -1;
+    c = '';
+
+    if (typeof text !== 'string') {
+      throw new TypeError('Invalid argument in Unit.parse, string expected');
+    }
+
+    var unit = new Unit();
+    unit.units = [];
+    var powerMultiplierCurrent = 1;
+    var expectingUnit = false; // A unit should follow this pattern:
+    // [number] ...[ [*/] unit[^number] ]
+    // unit[^number] ... [ [*/] unit[^number] ]
+    // Rules:
+    // number is any floating point number.
+    // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!
+    // The string may optionally begin with a number.
+    // Each unit may optionally be followed by ^number.
+    // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:
+    //   2m^2kg/s^2
+    // it is not good form. If a unit starts with e, then it could be confused as a floating point number:
+    //   4erg
+
+    next();
+    skipWhitespace(); // Optional number at the start of the string
+
+    var valueStr = parseNumber();
+    var value = null;
+
+    if (valueStr) {
+      if (config.number === 'BigNumber') {
+        value = new _BigNumber(valueStr);
+      } else if (config.number === 'Fraction') {
+        try {
+          // not all numbers can be turned in Fractions, for example very small numbers not
+          value = new _Fraction(valueStr);
+        } catch (err) {
+          value = parseFloat(valueStr);
+        }
+      } else {
+        // number
+        value = parseFloat(valueStr);
+      }
+
+      skipWhitespace(); // Whitespace is not required here
+      // handle multiplication or division right after the value, like '1/s'
+
+      if (parseCharacter('*')) {
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      }
+    } // Stack to keep track of powerMultipliers applied to each parentheses group
+
+
+    var powerMultiplierStack = []; // Running product of all elements in powerMultiplierStack
+
+    var powerMultiplierStackProduct = 1;
+
+    while (true) {
+      skipWhitespace(); // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack
+      // A '(' will always appear directly before a unit.
+
+      while (c === '(') {
+        powerMultiplierStack.push(powerMultiplierCurrent);
+        powerMultiplierStackProduct *= powerMultiplierCurrent;
+        powerMultiplierCurrent = 1;
+        next();
+        skipWhitespace();
+      } // Is there something here?
+
+
+      var uStr = void 0;
+
+      if (c) {
+        var oldC = c;
+        uStr = parseUnit();
+
+        if (uStr === null) {
+          throw new SyntaxError('Unexpected "' + oldC + '" in "' + text + '" at index ' + index.toString());
+        }
+      } else {
+        // End of input.
+        break;
+      } // Verify the unit exists and get the prefix (if any)
+
+
+      var res = _findUnit(uStr);
+
+      if (res === null) {
+        // Unit not found.
+        throw new SyntaxError('Unit "' + uStr + '" not found.');
+      }
+
+      var power = powerMultiplierCurrent * powerMultiplierStackProduct; // Is there a "^ number"?
+
+      skipWhitespace();
+
+      if (parseCharacter('^')) {
+        skipWhitespace();
+        var p = parseNumber();
+
+        if (p === null) {
+          // No valid number found for the power!
+          throw new SyntaxError('In "' + str + '", "^" must be followed by a floating-point number');
+        }
+
+        power *= p;
+      } // Add the unit to the list
+
+
+      unit.units.push({
+        unit: res.unit,
+        prefix: res.prefix,
+        power: power
+      });
+
+      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;
+      } // Check for and consume closing parentheses, popping from the stack.
+      // A ')' will always follow a unit.
+
+
+      skipWhitespace();
+
+      while (c === ')') {
+        if (powerMultiplierStack.length === 0) {
+          throw new SyntaxError('Unmatched ")" in "' + text + '" at index ' + index.toString());
+        }
+
+        powerMultiplierStackProduct /= powerMultiplierStack.pop();
+        next();
+        skipWhitespace();
+      } // "*" and "/" should mean we are expecting something to come next.
+      // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.
+
+
+      expectingUnit = false;
+
+      if (parseCharacter('*')) {
+        // explicit multiplication
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        // division
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      } else {
+        // implicit multiplication
+        powerMultiplierCurrent = 1;
+      } // Replace the unit into the auto unit system
+
+
+      if (res.unit.base) {
+        var baseDim = res.unit.base.key;
+        UNIT_SYSTEMS.auto[baseDim] = {
+          unit: res.unit,
+          prefix: res.prefix
+        };
+      }
+    } // Has the string been entirely consumed?
+
+
+    skipWhitespace();
+
+    if (c) {
+      throw new SyntaxError('Could not parse: "' + str + '"');
+    } // Is there a trailing slash?
+
+
+    if (expectingUnit) {
+      throw new SyntaxError('Trailing characters: "' + str + '"');
+    } // Is the parentheses stack empty?
+
+
+    if (powerMultiplierStack.length !== 0) {
+      throw new SyntaxError('Unmatched "(" in "' + text + '"');
+    } // Are there any units at all?
+
+
+    if (unit.units.length === 0 && !options.allowNoUnits) {
+      throw new SyntaxError('"' + str + '" contains no units');
+    }
+
+    unit.value = value !== undefined ? unit._normalize(value) : null;
+    return unit;
+  };
+  /**
+   * create a copy of this unit
+   * @memberof Unit
+   * @return {Unit} Returns a cloned version of the unit
+   */
+
+
+  Unit.prototype.clone = function () {
+    var unit = new Unit();
+    unit.fixPrefix = this.fixPrefix;
+    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;
+    unit.value = clone(this.value);
+    unit.dimensions = this.dimensions.slice(0);
+    unit.units = [];
+
+    for (var i = 0; i < this.units.length; i++) {
+      unit.units[i] = {};
+
+      for (var p in this.units[i]) {
+        if (hasOwnProperty(this.units[i], p)) {
+          unit.units[i][p] = this.units[i][p];
+        }
+      }
+    }
+
+    return unit;
+  };
+  /**
+   * Return whether the unit is derived (such as m/s, or cm^2, but not N)
+   * @memberof Unit
+   * @return {boolean} True if the unit is derived
+   */
+
+
+  Unit.prototype._isDerived = function () {
+    if (this.units.length === 0) {
+      return false;
+    }
+
+    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;
+  };
+  /**
+   * Normalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number | BigNumber | Fraction | boolean} value
+   * @return {number | BigNumber | Fraction | boolean} normalized value
+   * @private
+   */
+
+
+  Unit.prototype._normalize = function (value) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+
+    var res = value;
+
+    var convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed
+
+
+    for (var i = 0; i < this.units.length; i++) {
+      var unitValue = convert(this.units[i].unit.value);
+      var unitPrefixValue = convert(this.units[i].prefix.value);
+      var unitPower = convert(this.units[i].power);
+      res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+
+    return res;
+  };
+  /**
+   * Denormalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number} value
+   * @param {number} [prefixValue]    Optional prefix value to be used (ignored if this is a derived unit)
+   * @return {number} denormalized value
+   * @private
+   */
+
+
+  Unit.prototype._denormalize = function (value, prefixValue) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+
+    var res = value;
+
+    var convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed
+
+
+    for (var i = 0; i < this.units.length; i++) {
+      var unitValue = convert(this.units[i].unit.value);
+      var unitPrefixValue = convert(this.units[i].prefix.value);
+      var unitPower = convert(this.units[i].power);
+      res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+
+    return res;
+  };
+  /**
+   * Find a unit from a string
+   * @memberof Unit
+   * @param {string} str              A string like 'cm' or 'inch'
+   * @returns {Object | null} result  When found, an object with fields unit and
+   *                                  prefix is returned. Else, null is returned.
+   * @private
+   */
+
+
+  var _findUnit = memoize(str => {
+    // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.
+    if (hasOwnProperty(UNITS, str)) {
+      var unit = UNITS[str];
+      var prefix = unit.prefixes[''];
+      return {
+        unit,
+        prefix
+      };
+    }
+
+    for (var _name in UNITS) {
+      if (hasOwnProperty(UNITS, _name)) {
+        if (endsWith(str, _name)) {
+          var _unit = UNITS[_name];
+          var prefixLen = str.length - _name.length;
+          var prefixName = str.substring(0, prefixLen);
+
+          var _prefix = hasOwnProperty(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;
+
+          if (_prefix !== undefined) {
+            // store unit, prefix, and value
+            return {
+              unit: _unit,
+              prefix: _prefix
+            };
+          }
+        }
+      }
+    }
+
+    return null;
+  }, {
+    hasher: args => args[0],
+    limit: 100
+  });
+  /**
+   * Test if the given expression is a unit.
+   * The unit can have a prefix but cannot have a value.
+   * @memberof Unit
+   * @param {string} name   A string to be tested whether it is a value less unit.
+   *                        The unit can have prefix, like "cm"
+   * @return {boolean}      true if the given string is a unit
+   */
+
+
+  Unit.isValuelessUnit = function (name) {
+    return _findUnit(name) !== null;
+  };
+  /**
+   * check if this unit has given base unit
+   * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.
+   * @memberof Unit
+   * @param {BASE_UNITS | string | undefined} base
+   */
+
+
+  Unit.prototype.hasBase = function (base) {
+    if (typeof base === 'string') {
+      base = BASE_UNITS[base];
+    }
+
+    if (!base) {
+      return false;
+    } // All dimensions must be the same
+
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+
+    return true;
+  };
+  /**
+   * Check if this unit has a base or bases equal to another base or bases
+   * For derived units, the exponent on each base also must match
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if equal base
+   */
+
+
+  Unit.prototype.equalBase = function (other) {
+    // All dimensions must be the same
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+
+    return true;
+  };
+  /**
+   * Check if this unit equals another unit
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if both units are equal
+   */
+
+
+  Unit.prototype.equals = function (other) {
+    return this.equalBase(other) && equal(this.value, other.value);
+  };
+  /**
+   * Multiply this unit with another one
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {Unit} product of this unit and the other unit
+   */
+
+
+  Unit.prototype.multiply = function (other) {
+    var res = this.clone();
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0);
+    } // Append other's units list onto res
+
+
+    for (var _i = 0; _i < other.units.length; _i++) {
+      // Make a shallow copy of every unit
+      var inverted = _objectSpread({}, other.units[_i]);
+
+      res.units.push(inverted);
+    } // If at least one operand has a value, then the result should also have a value
+
+
+    if (this.value !== null || other.value !== null) {
+      var valThis = this.value === null ? this._normalize(1) : this.value;
+      var valOther = other.value === null ? other._normalize(1) : other.value;
+      res.value = multiplyScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+  /**
+   * Divide this unit by another one
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {Unit} result of dividing this unit by the other unit
+   */
+
+
+  Unit.prototype.divide = function (other) {
+    var res = this.clone();
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0);
+    } // Invert and append other's units list onto res
+
+
+    for (var _i2 = 0; _i2 < other.units.length; _i2++) {
+      // Make a shallow copy of every unit
+      var inverted = _objectSpread(_objectSpread({}, other.units[_i2]), {}, {
+        power: -other.units[_i2].power
+      });
+
+      res.units.push(inverted);
+    } // If at least one operand has a value, the result should have a value
+
+
+    if (this.value !== null || other.value !== null) {
+      var valThis = this.value === null ? this._normalize(1) : this.value;
+      var valOther = other.value === null ? other._normalize(1) : other.value;
+      res.value = divideScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+  /**
+   * Calculate the power of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} p
+   * @returns {Unit}      The result: this^p
+   */
+
+
+  Unit.prototype.pow = function (p) {
+    var res = this.clone();
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) * p;
+    } // Adjust the power of each unit in the list
+
+
+    for (var _i3 = 0; _i3 < res.units.length; _i3++) {
+      res.units[_i3].power *= p;
+    }
+
+    if (res.value !== null) {
+      res.value = pow(res.value, p); // only allow numeric output, we don't want to return a Complex number
+      // if (!isNumeric(res.value)) {
+      //  res.value = NaN
+      // }
+      // Update: Complex supported now
+    } else {
+      res.value = null;
+    }
+
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+  /**
+   * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise
+   * @param {Unit} unit
+   * @returns {number | Fraction | BigNumber | Unit}  The numeric value of the unit if conditions are met, or the original unit otherwise
+   */
+
+
+  function getNumericIfUnitless(unit) {
+    if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {
+      return unit.value;
+    } else {
+      return unit;
+    }
+  }
+  /**
+   * Calculate the absolute value of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} x
+   * @returns {Unit}      The result: |x|, absolute value of x
+   */
+
+
+  Unit.prototype.abs = function () {
+    var ret = this.clone();
+
+    if (ret.value !== null) {
+      if (ret._isDerived() || ret.units[0].unit.offset === 0) {
+        ret.value = abs(ret.value);
+      } else {
+        // To give the correct, but unexpected, results for units with an offset.
+        // For example, abs(-283.15 degC) = -263.15 degC !!!
+        // We must take the offset into consideration here
+        var convert = Unit._getNumberConverter(typeOf(ret.value)); // convert to Fraction or BigNumber if needed
+
+
+        var unitValue = convert(ret.units[0].unit.value);
+        var nominalOffset = convert(ret.units[0].unit.offset);
+        var unitOffset = multiplyScalar(unitValue, nominalOffset);
+        ret.value = subtract(abs(addScalar(ret.value, unitOffset)), unitOffset);
+      }
+    }
+
+    for (var i in ret.units) {
+      if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {
+        ret.units[i].unit = UNITS.W;
+      }
+    }
+
+    return ret;
+  };
+  /**
+   * Convert the unit to a specific unit name.
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like "cm"
+   * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.
+   */
+
+
+  Unit.prototype.to = function (valuelessUnit) {
+    var value = this.value === null ? this._normalize(1) : this.value;
+    var other;
+
+    if (typeof valuelessUnit === 'string') {
+      other = Unit.parse(valuelessUnit);
+    } else if (isUnit(valuelessUnit)) {
+      other = valuelessUnit.clone();
+    } else {
+      throw new Error('String or Unit expected as parameter');
+    }
+
+    if (!this.equalBase(other)) {
+      throw new Error("Units do not match ('".concat(other.toString(), "' != '").concat(this.toString(), "')"));
+    }
+
+    if (other.value !== null) {
+      throw new Error('Cannot convert to a unit with a value');
+    }
+
+    if (this.value === null || this._isDerived() || this.units[0].unit.offset === other.units[0].unit.offset) {
+      other.value = clone(value);
+    } else {
+      /* Need to adjust value by difference in offset to convert */
+      var convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed
+
+
+      var thisUnitValue = convert(this.units[0].unit.value);
+      var thisNominalOffset = convert(this.units[0].unit.offset);
+      var thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset);
+      var otherUnitValue = convert(other.units[0].unit.value);
+      var otherNominalOffset = convert(other.units[0].unit.offset);
+      var otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset);
+      other.value = subtract(addScalar(value, thisUnitOffset), otherUnitOffset);
+    }
+
+    other.fixPrefix = true;
+    other.skipAutomaticSimplification = true;
+    return other;
+  };
+  /**
+   * Return the value of the unit when represented with given valueless unit
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number} Returns the unit value as number.
+   */
+  // TODO: deprecate Unit.toNumber? It's always better to use toNumeric
+
+
+  Unit.prototype.toNumber = function (valuelessUnit) {
+    return toNumber(this.toNumeric(valuelessUnit));
+  };
+  /**
+   * Return the value of the unit in the original numeric type
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number | BigNumber | Fraction} Returns the unit value
+   */
+
+
+  Unit.prototype.toNumeric = function (valuelessUnit) {
+    var other;
+
+    if (valuelessUnit) {
+      // Allow getting the numeric value without converting to a different unit
+      other = this.to(valuelessUnit);
+    } else {
+      other = this.clone();
+    }
+
+    if (other._isDerived() || other.units.length === 0) {
+      return other._denormalize(other.value);
+    } else {
+      return other._denormalize(other.value, other.units[0].prefix.value);
+    }
+  };
+  /**
+   * Get a string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+
+
+  Unit.prototype.toString = function () {
+    return this.format();
+  };
+  /**
+   * Get a JSON representation of the unit
+   * @memberof Unit
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   */
+
+
+  Unit.prototype.toJSON = function () {
+    return {
+      mathjs: 'Unit',
+      value: this._denormalize(this.value),
+      unit: this.formatUnits(),
+      fixPrefix: this.fixPrefix
+    };
+  };
+  /**
+   * Instantiate a Unit from a JSON object
+   * @memberof Unit
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   * @return {Unit}
+   */
+
+
+  Unit.fromJSON = function (json) {
+    var unit = new Unit(json.value, json.unit);
+    unit.fixPrefix = json.fixPrefix || false;
+    return unit;
+  };
+  /**
+   * Returns the string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+
+
+  Unit.prototype.valueOf = Unit.prototype.toString;
+  /**
+   * Simplify this Unit's unit list and return a new Unit with the simplified list.
+   * The returned Unit will contain a list of the "best" units for formatting.
+   */
+
+  Unit.prototype.simplify = function () {
+    var ret = this.clone();
+    var proposedUnitList = []; // Search for a matching base
+
+    var matchingBase;
+
+    for (var key in currentUnitSystem) {
+      if (hasOwnProperty(currentUnitSystem, key)) {
+        if (ret.hasBase(BASE_UNITS[key])) {
+          matchingBase = key;
+          break;
+        }
+      }
+    }
+
+    if (matchingBase === 'NONE') {
+      ret.units = [];
+    } else {
+      var matchingUnit;
+
+      if (matchingBase) {
+        // Does the unit system have a matching unit?
+        if (hasOwnProperty(currentUnitSystem, matchingBase)) {
+          matchingUnit = currentUnitSystem[matchingBase];
+        }
+      }
+
+      if (matchingUnit) {
+        ret.units = [{
+          unit: matchingUnit.unit,
+          prefix: matchingUnit.prefix,
+          power: 1.0
+        }];
+      } else {
+        // Multiple units or units with powers are formatted like this:
+        // 5 (kg m^2) / (s^3 mol)
+        // Build an representation from the base units of the current unit system
+        var missingBaseDim = false;
+
+        for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+          var baseDim = BASE_DIMENSIONS[i];
+
+          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+            if (hasOwnProperty(currentUnitSystem, baseDim)) {
+              proposedUnitList.push({
+                unit: currentUnitSystem[baseDim].unit,
+                prefix: currentUnitSystem[baseDim].prefix,
+                power: ret.dimensions[i] || 0
+              });
+            } else {
+              missingBaseDim = true;
+            }
+          }
+        } // Is the proposed unit list "simpler" than the existing one?
+
+
+        if (proposedUnitList.length < ret.units.length && !missingBaseDim) {
+          // Replace this unit list with the proposed list
+          ret.units = proposedUnitList;
+        }
+      }
+    }
+
+    return ret;
+  };
+  /**
+   * Returns a new Unit in the SI system with the same value as this one
+   */
+
+
+  Unit.prototype.toSI = function () {
+    var ret = this.clone();
+    var proposedUnitList = []; // Multiple units or units with powers are formatted like this:
+    // 5 (kg m^2) / (s^3 mol)
+    // Build an representation from the base units of the SI unit system
+
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      var baseDim = BASE_DIMENSIONS[i];
+
+      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+        if (hasOwnProperty(UNIT_SYSTEMS.si, baseDim)) {
+          proposedUnitList.push({
+            unit: UNIT_SYSTEMS.si[baseDim].unit,
+            prefix: UNIT_SYSTEMS.si[baseDim].prefix,
+            power: ret.dimensions[i] || 0
+          });
+        } else {
+          throw new Error('Cannot express custom unit ' + baseDim + ' in SI units');
+        }
+      }
+    } // Replace this unit list with the proposed list
+
+
+    ret.units = proposedUnitList;
+    ret.fixPrefix = true;
+    ret.skipAutomaticSimplification = true;
+    return ret;
+  };
+  /**
+   * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.
+   * @memberof Unit
+   * @return {string}
+   */
+
+
+  Unit.prototype.formatUnits = function () {
+    var strNum = '';
+    var strDen = '';
+    var nNum = 0;
+    var nDen = 0;
+
+    for (var i = 0; i < this.units.length; i++) {
+      if (this.units[i].power > 0) {
+        nNum++;
+        strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name;
+
+        if (Math.abs(this.units[i].power - 1.0) > 1e-15) {
+          strNum += '^' + this.units[i].power;
+        }
+      } else if (this.units[i].power < 0) {
+        nDen++;
+      }
+    }
+
+    if (nDen > 0) {
+      for (var _i4 = 0; _i4 < this.units.length; _i4++) {
+        if (this.units[_i4].power < 0) {
+          if (nNum > 0) {
+            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
+
+            if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {
+              strDen += '^' + -this.units[_i4].power;
+            }
+          } else {
+            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
+            strDen += '^' + this.units[_i4].power;
+          }
+        }
+      }
+    } // Remove leading " "
+
+
+    strNum = strNum.substr(1);
+    strDen = strDen.substr(1); // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting
+
+    if (nNum > 1 && nDen > 0) {
+      strNum = '(' + strNum + ')';
+    }
+
+    if (nDen > 1 && nNum > 0) {
+      strDen = '(' + strDen + ')';
+    }
+
+    var str = strNum;
+
+    if (nNum > 0 && nDen > 0) {
+      str += ' / ';
+    }
+
+    str += strDen;
+    return str;
+  };
+  /**
+   * Get a string representation of the Unit, with optional formatting options.
+   * @memberof Unit
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string}
+   */
+
+
+  Unit.prototype.format = function (options) {
+    // Simplfy the unit list, unless it is valueless or was created directly in the
+    // constructor or as the result of to or toSI
+    var simp = this.skipAutomaticSimplification || this.value === null ? this.clone() : this.simplify(); // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.
+
+    var isImaginary = false;
+
+    if (typeof simp.value !== 'undefined' && simp.value !== null && isComplex(simp.value)) {
+      // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute
+      isImaginary = Math.abs(simp.value.re) < 1e-14;
+    }
+
+    for (var i in simp.units) {
+      if (hasOwnProperty(simp.units, i)) {
+        if (simp.units[i].unit) {
+          if (simp.units[i].unit.name === 'VA' && isImaginary) {
+            simp.units[i].unit = UNITS.VAR;
+          } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {
+            simp.units[i].unit = UNITS.VA;
+          }
+        }
+      }
+    } // Now apply the best prefix
+    // Units must have only one unit and not have the fixPrefix flag set
+
+
+    if (simp.units.length === 1 && !simp.fixPrefix) {
+      // Units must have integer powers, otherwise the prefix will change the
+      // outputted value by not-an-integer-power-of-ten
+      if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {
+        // Apply the best prefix
+        simp.units[0].prefix = simp._bestPrefix();
+      }
+    }
+
+    var value = simp._denormalize(simp.value);
+
+    var str = simp.value !== null ? format(value, options || {}) : '';
+    var unitStr = simp.formatUnits();
+
+    if (simp.value && isComplex(simp.value)) {
+      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing
+    }
+
+    if (unitStr.length > 0 && str.length > 0) {
+      str += ' ';
+    }
+
+    str += unitStr;
+    return str;
+  };
+  /**
+   * Calculate the best prefix using current value.
+   * @memberof Unit
+   * @returns {Object} prefix
+   * @private
+   */
+
+
+  Unit.prototype._bestPrefix = function () {
+    if (this.units.length !== 1) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    }
+
+    if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    } // find the best prefix value (resulting in the value of which
+    // the absolute value of the log10 is closest to zero,
+    // though with a little offset of 1.2 for nicer values: you get a
+    // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...
+    // Note: the units value can be any numeric type, but to find the best
+    // prefix it's enough to work with limited precision of a regular number
+    // Update: using mathjs abs since we also allow complex numbers
+
+
+    var absValue = this.value !== null ? abs(this.value) : 0;
+    var absUnitValue = abs(this.units[0].unit.value);
+    var bestPrefix = this.units[0].prefix;
+
+    if (absValue === 0) {
+      return bestPrefix;
+    }
+
+    var power = this.units[0].power;
+    var bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - 1.2;
+    if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix; // Allow the original prefix
+
+    bestDiff = Math.abs(bestDiff);
+    var prefixes = this.units[0].unit.prefixes;
+
+    for (var p in prefixes) {
+      if (hasOwnProperty(prefixes, p)) {
+        var prefix = prefixes[p];
+
+        if (prefix.scientific) {
+          var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);
+
+          if (diff < bestDiff || diff === bestDiff && prefix.name.length < bestPrefix.name.length) {
+            // choose the prefix with the smallest diff, or if equal, choose the one
+            // with the shortest name (can happen with SHORTLONG for example)
+            bestPrefix = prefix;
+            bestDiff = diff;
+          }
+        }
+      }
+    }
+
+    return bestPrefix;
+  };
+  /**
+   * Returns an array of units whose sum is equal to this unit
+   * @memberof Unit
+   * @param {Array} [parts] An array of strings or valueless units.
+   *
+   *   Example:
+   *
+   *   const u = new Unit(1, 'm')
+   *   u.splitUnit(['feet', 'inch'])
+   *     [ 3 feet, 3.3700787401575 inch ]
+   *
+   * @return {Array} An array of units.
+   */
+
+
+  Unit.prototype.splitUnit = function (parts) {
+    var x = this.clone();
+    var ret = [];
+
+    for (var i = 0; i < parts.length; i++) {
+      // Convert x to the requested unit
+      x = x.to(parts[i]);
+      if (i === parts.length - 1) break; // Get the numeric value of this unit
+
+      var xNumeric = x.toNumeric(); // Check to see if xNumeric is nearly equal to an integer,
+      // since fix can incorrectly round down if there is round-off error
+
+      var xRounded = round(xNumeric);
+      var xFixed = void 0;
+      var isNearlyEqual = equal(xRounded, xNumeric);
+
+      if (isNearlyEqual) {
+        xFixed = xRounded;
+      } else {
+        xFixed = fix(x.toNumeric());
+      }
+
+      var y = new Unit(xFixed, parts[i].toString());
+      ret.push(y);
+      x = subtract(x, y);
+    } // This little bit fixes a bug where the remainder should be 0 but is a little bit off.
+    // But instead of comparing x, the remainder, with zero--we will compare the sum of
+    // all the parts so far with the original value. If they are nearly equal,
+    // we set the remainder to 0.
+
+
+    var testSum = 0;
+
+    for (var _i5 = 0; _i5 < ret.length; _i5++) {
+      testSum = addScalar(testSum, ret[_i5].value);
+    }
+
+    if (equal(testSum, this.value)) {
+      x.value = 0;
+    }
+
+    ret.push(x);
+    return ret;
+  };
+
+  var PREFIXES = {
+    NONE: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      }
+    },
+    SHORT: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e1,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e2,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-1,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-2,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-3,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-6,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-9,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-12,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-15,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-18,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-21,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-24,
+        scientific: true
+      }
+    },
+    LONG: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      deca: {
+        name: 'deca',
+        value: 1e1,
+        scientific: false
+      },
+      hecto: {
+        name: 'hecto',
+        value: 1e2,
+        scientific: false
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      },
+      deci: {
+        name: 'deci',
+        value: 1e-1,
+        scientific: false
+      },
+      centi: {
+        name: 'centi',
+        value: 1e-2,
+        scientific: false
+      },
+      milli: {
+        name: 'milli',
+        value: 1e-3,
+        scientific: true
+      },
+      micro: {
+        name: 'micro',
+        value: 1e-6,
+        scientific: true
+      },
+      nano: {
+        name: 'nano',
+        value: 1e-9,
+        scientific: true
+      },
+      pico: {
+        name: 'pico',
+        value: 1e-12,
+        scientific: true
+      },
+      femto: {
+        name: 'femto',
+        value: 1e-15,
+        scientific: true
+      },
+      atto: {
+        name: 'atto',
+        value: 1e-18,
+        scientific: true
+      },
+      zepto: {
+        name: 'zepto',
+        value: 1e-21,
+        scientific: true
+      },
+      yocto: {
+        name: 'yocto',
+        value: 1e-24,
+        scientific: true
+      }
+    },
+    SQUARED: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e2,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e4,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e6,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e12,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e18,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e24,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e30,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e36,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e42,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e48,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-2,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-4,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-6,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-12,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-18,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-24,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-30,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-36,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-42,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-48,
+        scientific: true
+      }
+    },
+    CUBIC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e3,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e6,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e9,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e18,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e27,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e36,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e45,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e54,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e63,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e72,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-3,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-6,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-9,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-18,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-27,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-36,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-45,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-54,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-63,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-72,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      Ki: {
+        name: 'Ki',
+        value: 1024,
+        scientific: true
+      },
+      Mi: {
+        name: 'Mi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      Gi: {
+        name: 'Gi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      Ti: {
+        name: 'Ti',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      Pi: {
+        name: 'Pi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      Ei: {
+        name: 'Ei',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      Zi: {
+        name: 'Zi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      Yi: {
+        name: 'Yi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BINARY_LONG_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_LONG_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kibi: {
+        name: 'kibi',
+        value: 1024,
+        scientific: true
+      },
+      mebi: {
+        name: 'mebi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      gibi: {
+        name: 'gibi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      tebi: {
+        name: 'tebi',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      pebi: {
+        name: 'pebi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      exi: {
+        name: 'exi',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      zebi: {
+        name: 'zebi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      yobi: {
+        name: 'yobi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BTU: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      MM: {
+        name: 'MM',
+        value: 1e6,
+        scientific: true
+      }
+    }
+  };
+  PREFIXES.SHORTLONG = _extends({}, PREFIXES.SHORT, PREFIXES.LONG);
+  PREFIXES.BINARY_SHORT = _extends({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);
+  PREFIXES.BINARY_LONG = _extends({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);
+  /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:
+   * Index  Dimension
+   * -----  ---------
+   *   0    Length
+   *   1    Mass
+   *   2    Time
+   *   3    Current
+   *   4    Temperature
+   *   5    Luminous intensity
+   *   6    Amount of substance
+   *   7    Angle
+   *   8    Bit (digital)
+   * For example, the unit "298.15 K" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit "1 cal / (gm °C)" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].
+   *
+   */
+
+  var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];
+  var BASE_UNITS = {
+    NONE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    MASS: {
+      dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    LENGTH: {
+      dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]
+    },
+    TIME: {
+      dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]
+    },
+    CURRENT: {
+      dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]
+    },
+    TEMPERATURE: {
+      dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]
+    },
+    LUMINOUS_INTENSITY: {
+      dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]
+    },
+    AMOUNT_OF_SUBSTANCE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]
+    },
+    FORCE: {
+      dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    SURFACE: {
+      dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]
+    },
+    VOLUME: {
+      dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]
+    },
+    ENERGY: {
+      dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]
+    },
+    POWER: {
+      dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]
+    },
+    PRESSURE: {
+      dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CHARGE: {
+      dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CAPACITANCE: {
+      dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_POTENTIAL: {
+      dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_RESISTANCE: {
+      dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_INDUCTANCE: {
+      dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CONDUCTANCE: {
+      dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX: {
+      dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX_DENSITY: {
+      dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]
+    },
+    FREQUENCY: {
+      dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]
+    },
+    ANGLE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]
+    },
+    BIT: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]
+    }
+  };
+
+  for (var key in BASE_UNITS) {
+    if (hasOwnProperty(BASE_UNITS, key)) {
+      BASE_UNITS[key].key = key;
+    }
+  }
+
+  var BASE_UNIT_NONE = {};
+  var UNIT_NONE = {
+    name: '',
+    base: BASE_UNIT_NONE,
+    value: 1,
+    offset: 0,
+    dimensions: BASE_DIMENSIONS.map(x => 0)
+  };
+  var UNITS = {
+    // length
+    meter: {
+      name: 'meter',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    inch: {
+      name: 'inch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    foot: {
+      name: 'foot',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yard: {
+      name: 'yard',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mile: {
+      name: 'mile',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    link: {
+      name: 'link',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rod: {
+      name: 'rod',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.0292,
+      offset: 0
+    },
+    chain: {
+      name: 'chain',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    angstrom: {
+      name: 'angstrom',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1e-10,
+      offset: 0
+    },
+    m: {
+      name: 'm',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    in: {
+      name: 'in',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    ft: {
+      name: 'ft',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yd: {
+      name: 'yd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mi: {
+      name: 'mi',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    li: {
+      name: 'li',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rd: {
+      name: 'rd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.029210,
+      offset: 0
+    },
+    ch: {
+      name: 'ch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    mil: {
+      name: 'mil',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000254,
+      offset: 0
+    },
+    // 1/1000 inch
+    // Surface
+    m2: {
+      name: 'm2',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.SQUARED,
+      value: 1,
+      offset: 0
+    },
+    sqin: {
+      name: 'sqin',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.00064516,
+      offset: 0
+    },
+    // 645.16 mm2
+    sqft: {
+      name: 'sqft',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.09290304,
+      offset: 0
+    },
+    // 0.09290304 m2
+    sqyd: {
+      name: 'sqyd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.83612736,
+      offset: 0
+    },
+    // 0.83612736 m2
+    sqmi: {
+      name: 'sqmi',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 2589988.110336,
+      offset: 0
+    },
+    // 2.589988110336 km2
+    sqrd: {
+      name: 'sqrd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 25.29295,
+      offset: 0
+    },
+    // 25.29295 m2
+    sqch: {
+      name: 'sqch',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 404.6873,
+      offset: 0
+    },
+    // 404.6873 m2
+    sqmil: {
+      name: 'sqmil',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 6.4516e-10,
+      offset: 0
+    },
+    // 6.4516 * 10^-10 m2
+    acre: {
+      name: 'acre',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 4046.86,
+      offset: 0
+    },
+    // 4046.86 m2
+    hectare: {
+      name: 'hectare',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 10000,
+      offset: 0
+    },
+    // 10000 m2
+    // Volume
+    m3: {
+      name: 'm3',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.CUBIC,
+      value: 1,
+      offset: 0
+    },
+    L: {
+      name: 'L',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    l: {
+      name: 'l',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    litre: {
+      name: 'litre',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    cuin: {
+      name: 'cuin',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1.6387064e-5,
+      offset: 0
+    },
+    // 1.6387064e-5 m3
+    cuft: {
+      name: 'cuft',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.028316846592,
+      offset: 0
+    },
+    // 28.316 846 592 L
+    cuyd: {
+      name: 'cuyd',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.764554857984,
+      offset: 0
+    },
+    // 764.554 857 984 L
+    teaspoon: {
+      name: 'teaspoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000005,
+      offset: 0
+    },
+    // 5 mL
+    tablespoon: {
+      name: 'tablespoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000015,
+      offset: 0
+    },
+    // 15 mL
+    // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL  // not possible, we have already another cup
+    drop: {
+      name: 'drop',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+    gtt: {
+      name: 'gtt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+    // Liquid volume
+    minim: {
+      name: 'minim',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00000006161152,
+      offset: 0
+    },
+    // 0.06161152 mL
+    fluiddram: {
+      name: 'fluiddram',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000036966911,
+      offset: 0
+    },
+    // 3.696691 mL
+    fluidounce: {
+      name: 'fluidounce',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00002957353,
+      offset: 0
+    },
+    // 29.57353 mL
+    gill: {
+      name: 'gill',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0001182941,
+      offset: 0
+    },
+    // 118.2941 mL
+    cc: {
+      name: 'cc',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1e-6,
+      offset: 0
+    },
+    // 1e-6 L
+    cup: {
+      name: 'cup',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0002365882,
+      offset: 0
+    },
+    // 236.5882 mL
+    pint: {
+      name: 'pint',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0004731765,
+      offset: 0
+    },
+    // 473.1765 mL
+    quart: {
+      name: 'quart',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0009463529,
+      offset: 0
+    },
+    // 946.3529 mL
+    gallon: {
+      name: 'gallon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.003785412,
+      offset: 0
+    },
+    // 3.785412 L
+    beerbarrel: {
+      name: 'beerbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1173478,
+      offset: 0
+    },
+    // 117.3478 L
+    oilbarrel: {
+      name: 'oilbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1589873,
+      offset: 0
+    },
+    // 158.9873 L
+    hogshead: {
+      name: 'hogshead',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.2384810,
+      offset: 0
+    },
+    // 238.4810 L
+    // {name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute
+    fldr: {
+      name: 'fldr',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000036966911,
+      offset: 0
+    },
+    // 3.696691 mL
+    floz: {
+      name: 'floz',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00002957353,
+      offset: 0
+    },
+    // 29.57353 mL
+    gi: {
+      name: 'gi',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0001182941,
+      offset: 0
+    },
+    // 118.2941 mL
+    cp: {
+      name: 'cp',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0002365882,
+      offset: 0
+    },
+    // 236.5882 mL
+    pt: {
+      name: 'pt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0004731765,
+      offset: 0
+    },
+    // 473.1765 mL
+    qt: {
+      name: 'qt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0009463529,
+      offset: 0
+    },
+    // 946.3529 mL
+    gal: {
+      name: 'gal',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.003785412,
+      offset: 0
+    },
+    // 3.785412 L
+    bbl: {
+      name: 'bbl',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1173478,
+      offset: 0
+    },
+    // 117.3478 L
+    obl: {
+      name: 'obl',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.1589873,
+      offset: 0
+    },
+    // 158.9873 L
+    // {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh?
+    // Mass
+    g: {
+      name: 'g',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    gram: {
+      name: 'gram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    ton: {
+      name: 'ton',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 907.18474,
+      offset: 0
+    },
+    t: {
+      name: 't',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 1000,
+      offset: 0
+    },
+    tonne: {
+      name: 'tonne',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 1000,
+      offset: 0
+    },
+    grain: {
+      name: 'grain',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dram: {
+      name: 'dram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    ounce: {
+      name: 'ounce',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    poundmass: {
+      name: 'poundmass',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    hundredweight: {
+      name: 'hundredweight',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    stick: {
+      name: 'stick',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 115e-3,
+      offset: 0
+    },
+    stone: {
+      name: 'stone',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 6.35029318,
+      offset: 0
+    },
+    gr: {
+      name: 'gr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dr: {
+      name: 'dr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    oz: {
+      name: 'oz',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    lbm: {
+      name: 'lbm',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    cwt: {
+      name: 'cwt',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    // Time
+    s: {
+      name: 's',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    min: {
+      name: 'min',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    h: {
+      name: 'h',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    second: {
+      name: 'second',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    sec: {
+      name: 'sec',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    minute: {
+      name: 'minute',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    hour: {
+      name: 'hour',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    day: {
+      name: 'day',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 86400,
+      offset: 0
+    },
+    week: {
+      name: 'week',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 7 * 86400,
+      offset: 0
+    },
+    month: {
+      name: 'month',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 2629800,
+      // 1/12th of Julian year
+      offset: 0
+    },
+    year: {
+      name: 'year',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600,
+      // Julian year
+      offset: 0
+    },
+    decade: {
+      name: 'decade',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 315576000,
+      // Julian decade
+      offset: 0
+    },
+    century: {
+      name: 'century',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3155760000,
+      // Julian century
+      offset: 0
+    },
+    millennium: {
+      name: 'millennium',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600000,
+      // Julian millennium
+      offset: 0
+    },
+    // Frequency
+    hertz: {
+      name: 'Hertz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    Hz: {
+      name: 'Hz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    // Angle
+    rad: {
+      name: 'rad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    radian: {
+      name: 'radian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888
+    deg: {
+      name: 'deg',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    degree: {
+      name: 'degree',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // grad = rad / (2*pi) * 400  = rad / 0.015707963267948966192313216916399
+    grad: {
+      name: 'grad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    gradian: {
+      name: 'gradian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793
+    cycle: {
+      name: 'cycle',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795
+    arcsec: {
+      name: 'arcsec',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477
+    arcmin: {
+      name: 'arcmin',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // Electric current
+    A: {
+      name: 'A',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    ampere: {
+      name: 'ampere',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // Temperature
+    // K(C) = °C + 273.15
+    // K(F) = (°F + 459.67) / 1.8
+    // K(R) = °R / 1.8
+    K: {
+      name: 'K',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 0
+    },
+    degC: {
+      name: 'degC',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 273.15
+    },
+    degF: {
+      name: 'degF',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 459.67
+    },
+    degR: {
+      name: 'degR',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 0
+    },
+    kelvin: {
+      name: 'kelvin',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 0
+    },
+    celsius: {
+      name: 'celsius',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1,
+      offset: 273.15
+    },
+    fahrenheit: {
+      name: 'fahrenheit',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 459.67
+    },
+    rankine: {
+      name: 'rankine',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.NONE,
+      value: 1 / 1.8,
+      offset: 0
+    },
+    // amount of substance
+    mol: {
+      name: 'mol',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    mole: {
+      name: 'mole',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // luminous intensity
+    cd: {
+      name: 'cd',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    candela: {
+      name: 'candela',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // TODO: units STERADIAN
+    // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+    // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+    // Force
+    N: {
+      name: 'N',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    newton: {
+      name: 'newton',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    dyn: {
+      name: 'dyn',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 0.00001,
+      offset: 0
+    },
+    dyne: {
+      name: 'dyne',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 0.00001,
+      offset: 0
+    },
+    lbf: {
+      name: 'lbf',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    poundforce: {
+      name: 'poundforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    kip: {
+      name: 'kip',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 4448.2216,
+      offset: 0
+    },
+    kilogramforce: {
+      name: 'kilogramforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    // Energy
+    J: {
+      name: 'J',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    joule: {
+      name: 'joule',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    erg: {
+      name: 'erg',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.NONE,
+      value: 1e-7,
+      offset: 0
+    },
+    Wh: {
+      name: 'Wh',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 3600,
+      offset: 0
+    },
+    BTU: {
+      name: 'BTU',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.BTU,
+      value: 1055.05585262,
+      offset: 0
+    },
+    eV: {
+      name: 'eV',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    electronvolt: {
+      name: 'electronvolt',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.LONG,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    // Power
+    W: {
+      name: 'W',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    watt: {
+      name: 'watt',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    hp: {
+      name: 'hp',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.NONE,
+      value: 745.6998715386,
+      offset: 0
+    },
+    // Electrical power units
+    VAR: {
+      name: 'VAR',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: Complex.I,
+      offset: 0
+    },
+    VA: {
+      name: 'VA',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Pressure
+    Pa: {
+      name: 'Pa',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    psi: {
+      name: 'psi',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 6894.75729276459,
+      offset: 0
+    },
+    atm: {
+      name: 'atm',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 101325,
+      offset: 0
+    },
+    bar: {
+      name: 'bar',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORTLONG,
+      value: 100000,
+      offset: 0
+    },
+    torr: {
+      name: 'torr',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmHg: {
+      name: 'mmHg',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmH2O: {
+      name: 'mmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    cmH2O: {
+      name: 'cmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 98.0665,
+      offset: 0
+    },
+    // Electric charge
+    coulomb: {
+      name: 'coulomb',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    C: {
+      name: 'C',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric capacitance
+    farad: {
+      name: 'farad',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    F: {
+      name: 'F',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric potential
+    volt: {
+      name: 'volt',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    V: {
+      name: 'V',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric resistance
+    ohm: {
+      name: 'ohm',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORTLONG,
+      // Both Mohm and megaohm are acceptable
+      value: 1,
+      offset: 0
+    },
+
+    /*
+     * Unicode breaks in browsers if charset is not specified
+    Ω: {
+      name: 'Ω',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    */
+    // Electric inductance
+    henry: {
+      name: 'henry',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    H: {
+      name: 'H',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric conductance
+    siemens: {
+      name: 'siemens',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    S: {
+      name: 'S',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux
+    weber: {
+      name: 'weber',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    Wb: {
+      name: 'Wb',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux density
+    tesla: {
+      name: 'tesla',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    T: {
+      name: 'T',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Binary
+    b: {
+      name: 'b',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 1,
+      offset: 0
+    },
+    bits: {
+      name: 'bits',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 1,
+      offset: 0
+    },
+    B: {
+      name: 'B',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 8,
+      offset: 0
+    },
+    bytes: {
+      name: 'bytes',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 8,
+      offset: 0
+    }
+  }; // aliases (formerly plurals)
+
+  var ALIASES = {
+    meters: 'meter',
+    inches: 'inch',
+    feet: 'foot',
+    yards: 'yard',
+    miles: 'mile',
+    links: 'link',
+    rods: 'rod',
+    chains: 'chain',
+    angstroms: 'angstrom',
+    lt: 'l',
+    litres: 'litre',
+    liter: 'litre',
+    liters: 'litre',
+    teaspoons: 'teaspoon',
+    tablespoons: 'tablespoon',
+    minims: 'minim',
+    fluiddrams: 'fluiddram',
+    fluidounces: 'fluidounce',
+    gills: 'gill',
+    cups: 'cup',
+    pints: 'pint',
+    quarts: 'quart',
+    gallons: 'gallon',
+    beerbarrels: 'beerbarrel',
+    oilbarrels: 'oilbarrel',
+    hogsheads: 'hogshead',
+    gtts: 'gtt',
+    grams: 'gram',
+    tons: 'ton',
+    tonnes: 'tonne',
+    grains: 'grain',
+    drams: 'dram',
+    ounces: 'ounce',
+    poundmasses: 'poundmass',
+    hundredweights: 'hundredweight',
+    sticks: 'stick',
+    lb: 'lbm',
+    lbs: 'lbm',
+    kips: 'kip',
+    kgf: 'kilogramforce',
+    acres: 'acre',
+    hectares: 'hectare',
+    sqfeet: 'sqft',
+    sqyard: 'sqyd',
+    sqmile: 'sqmi',
+    sqmiles: 'sqmi',
+    mmhg: 'mmHg',
+    mmh2o: 'mmH2O',
+    cmh2o: 'cmH2O',
+    seconds: 'second',
+    secs: 'second',
+    minutes: 'minute',
+    mins: 'minute',
+    hours: 'hour',
+    hr: 'hour',
+    hrs: 'hour',
+    days: 'day',
+    weeks: 'week',
+    months: 'month',
+    years: 'year',
+    decades: 'decade',
+    centuries: 'century',
+    millennia: 'millennium',
+    hertz: 'hertz',
+    radians: 'radian',
+    degrees: 'degree',
+    gradians: 'gradian',
+    cycles: 'cycle',
+    arcsecond: 'arcsec',
+    arcseconds: 'arcsec',
+    arcminute: 'arcmin',
+    arcminutes: 'arcmin',
+    BTUs: 'BTU',
+    watts: 'watt',
+    joules: 'joule',
+    amperes: 'ampere',
+    coulombs: 'coulomb',
+    volts: 'volt',
+    ohms: 'ohm',
+    farads: 'farad',
+    webers: 'weber',
+    teslas: 'tesla',
+    electronvolts: 'electronvolt',
+    moles: 'mole',
+    bit: 'bits',
+    byte: 'bytes'
+  };
+  /**
+   * Calculate the values for the angle units.
+   * Value is calculated as number or BigNumber depending on the configuration
+   * @param {{number: 'number' | 'BigNumber'}} config
+   */
+
+  function calculateAngleValues(config) {
+    if (config.number === 'BigNumber') {
+      var pi = createPi(_BigNumber);
+      UNITS.rad.value = new _BigNumber(1);
+      UNITS.deg.value = pi.div(180); // 2 * pi / 360
+
+      UNITS.grad.value = pi.div(200); // 2 * pi / 400
+
+      UNITS.cycle.value = pi.times(2); // 2 * pi
+
+      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600
+
+      UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60
+    } else {
+      // number
+      UNITS.rad.value = 1;
+      UNITS.deg.value = Math.PI / 180; // 2 * pi / 360
+
+      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400
+
+      UNITS.cycle.value = Math.PI * 2; // 2 * pi
+
+      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600
+
+      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60
+    } // copy to the full names of the angles
+
+
+    UNITS.radian.value = UNITS.rad.value;
+    UNITS.degree.value = UNITS.deg.value;
+    UNITS.gradian.value = UNITS.grad.value;
+  } // apply the angle values now
+
+
+  calculateAngleValues(config);
+
+  if (on) {
+    // recalculate the values on change of configuration
+    on('config', function (curr, prev) {
+      if (curr.number !== prev.number) {
+        calculateAngleValues(curr);
+      }
+    });
+  }
+  /**
+   * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.
+   * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).
+   * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.
+   */
+
+
+  var UNIT_SYSTEMS = {
+    si: {
+      // Base units
+      NONE: {
+        unit: UNIT_NONE,
+        prefix: PREFIXES.NONE['']
+      },
+      LENGTH: {
+        unit: UNITS.m,
+        prefix: PREFIXES.SHORT['']
+      },
+      MASS: {
+        unit: UNITS.g,
+        prefix: PREFIXES.SHORT.k
+      },
+      TIME: {
+        unit: UNITS.s,
+        prefix: PREFIXES.SHORT['']
+      },
+      CURRENT: {
+        unit: UNITS.A,
+        prefix: PREFIXES.SHORT['']
+      },
+      TEMPERATURE: {
+        unit: UNITS.K,
+        prefix: PREFIXES.SHORT['']
+      },
+      LUMINOUS_INTENSITY: {
+        unit: UNITS.cd,
+        prefix: PREFIXES.SHORT['']
+      },
+      AMOUNT_OF_SUBSTANCE: {
+        unit: UNITS.mol,
+        prefix: PREFIXES.SHORT['']
+      },
+      ANGLE: {
+        unit: UNITS.rad,
+        prefix: PREFIXES.SHORT['']
+      },
+      BIT: {
+        unit: UNITS.bits,
+        prefix: PREFIXES.SHORT['']
+      },
+      // Derived units
+      FORCE: {
+        unit: UNITS.N,
+        prefix: PREFIXES.SHORT['']
+      },
+      ENERGY: {
+        unit: UNITS.J,
+        prefix: PREFIXES.SHORT['']
+      },
+      POWER: {
+        unit: UNITS.W,
+        prefix: PREFIXES.SHORT['']
+      },
+      PRESSURE: {
+        unit: UNITS.Pa,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CHARGE: {
+        unit: UNITS.C,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CAPACITANCE: {
+        unit: UNITS.F,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_POTENTIAL: {
+        unit: UNITS.V,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_RESISTANCE: {
+        unit: UNITS.ohm,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_INDUCTANCE: {
+        unit: UNITS.H,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CONDUCTANCE: {
+        unit: UNITS.S,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX: {
+        unit: UNITS.Wb,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX_DENSITY: {
+        unit: UNITS.T,
+        prefix: PREFIXES.SHORT['']
+      },
+      FREQUENCY: {
+        unit: UNITS.Hz,
+        prefix: PREFIXES.SHORT['']
+      }
+    }
+  }; // Clone to create the other unit systems
+
+  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.cgs.LENGTH = {
+    unit: UNITS.m,
+    prefix: PREFIXES.SHORT.c
+  };
+  UNIT_SYSTEMS.cgs.MASS = {
+    unit: UNITS.g,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.FORCE = {
+    unit: UNITS.dyn,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.ENERGY = {
+    unit: UNITS.erg,
+    prefix: PREFIXES.NONE['']
+  }; // there are wholly 4 unique cgs systems for electricity and magnetism,
+  // so let's not worry about it unless somebody complains
+
+  UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.us.LENGTH = {
+    unit: UNITS.ft,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.MASS = {
+    unit: UNITS.lbm,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.TEMPERATURE = {
+    unit: UNITS.degF,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.FORCE = {
+    unit: UNITS.lbf,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.ENERGY = {
+    unit: UNITS.BTU,
+    prefix: PREFIXES.BTU['']
+  };
+  UNIT_SYSTEMS.us.POWER = {
+    unit: UNITS.hp,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.PRESSURE = {
+    unit: UNITS.psi,
+    prefix: PREFIXES.NONE['']
+  }; // Add additional unit systems here.
+  // Choose a unit system to seed the auto unit system.
+
+  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si)); // Set the current unit system
+
+  var currentUnitSystem = UNIT_SYSTEMS.auto;
+  /**
+   * Set a unit system for formatting derived units.
+   * @param {string} [name] The name of the unit system.
+   */
+
+  Unit.setUnitSystem = function (name) {
+    if (hasOwnProperty(UNIT_SYSTEMS, name)) {
+      currentUnitSystem = UNIT_SYSTEMS[name];
+    } else {
+      throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '));
+    }
+  };
+  /**
+   * Return the current unit system.
+   * @return {string} The current unit system.
+   */
+
+
+  Unit.getUnitSystem = function () {
+    for (var _key in UNIT_SYSTEMS) {
+      if (hasOwnProperty(UNIT_SYSTEMS, _key)) {
+        if (UNIT_SYSTEMS[_key] === currentUnitSystem) {
+          return _key;
+        }
+      }
+    }
+  };
+  /**
+   * Converters to convert from number to an other numeric type like BigNumber
+   * or Fraction
+   */
+
+
+  Unit.typeConverters = {
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(x + ''); // stringify to prevent constructor error
+    },
+    Fraction: function Fraction(x) {
+      return new _Fraction(x);
+    },
+    Complex: function Complex(x) {
+      return x;
+    },
+    number: function number(x) {
+      return x;
+    }
+  };
+  /**
+   * Retrieve the right convertor function corresponding with the type
+   * of provided exampleValue.
+   *
+   * @param {string} type   A string 'number', 'BigNumber', or 'Fraction'
+   *                        In case of an unknown type,
+   * @return {Function}
+   */
+
+  Unit._getNumberConverter = function (type) {
+    if (!Unit.typeConverters[type]) {
+      throw new TypeError('Unsupported type "' + type + '"');
+    }
+
+    return Unit.typeConverters[type];
+  }; // Add dimensions to each built-in unit
+
+
+  for (var _key2 in UNITS) {
+    if (hasOwnProperty(UNITS, _key2)) {
+      var unit = UNITS[_key2];
+      unit.dimensions = unit.base.dimensions;
+    }
+  } // Create aliases
+
+
+  for (var _name2 in ALIASES) {
+    if (hasOwnProperty(ALIASES, _name2)) {
+      var _unit2 = UNITS[ALIASES[_name2]];
+      var alias = {};
+
+      for (var _key3 in _unit2) {
+        if (hasOwnProperty(_unit2, _key3)) {
+          alias[_key3] = _unit2[_key3];
+        }
+      }
+
+      alias.name = _name2;
+      UNITS[_name2] = alias;
+    }
+  }
+  /**
+   * Checks if a character is a valid latin letter (upper or lower case).
+   * Note that this function can be overridden, for example to allow support of other alphabets.
+   * @param {string} c Tested character
+   */
+
+
+  Unit.isValidAlpha = function isValidAlpha(c) {
+    return /^[a-zA-Z]$/.test(c);
+  };
+
+  function assertUnitNameIsValid(name) {
+    for (var i = 0; i < name.length; i++) {
+      c = name.charAt(i);
+
+      if (i === 0 && !Unit.isValidAlpha(c)) {
+        throw new Error('Invalid unit name (must begin with alpha character): "' + name + '"');
+      }
+
+      if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {
+        throw new Error('Invalid unit name (only alphanumeric characters are allowed): "' + name + '"');
+      }
+    }
+  }
+  /**
+   * Wrapper around createUnitSingle.
+   * Example:
+   *  createUnit({
+   *    foo: { },
+   *    bar: {
+   *      definition: 'kg/foo',
+   *      aliases: ['ba', 'barr', 'bars'],
+   *      offset: 200
+   *    },
+   *    baz: '4 bar'
+   *  },
+   *  {
+   *    override: true
+   *  })
+   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.
+   * @param {object} options
+   */
+
+
+  Unit.createUnit = function (obj, options) {
+    if (typeof obj !== 'object') {
+      throw new TypeError("createUnit expects first parameter to be of type 'Object'");
+    } // Remove all units and aliases we are overriding
+
+
+    if (options && options.override) {
+      for (var _key4 in obj) {
+        if (hasOwnProperty(obj, _key4)) {
+          Unit.deleteUnit(_key4);
+        }
+
+        if (obj[_key4].aliases) {
+          for (var i = 0; i < obj[_key4].aliases.length; i++) {
+            Unit.deleteUnit(obj[_key4].aliases[i]);
+          }
+        }
+      }
+    } // TODO: traverse multiple times until all units have been added
+
+
+    var lastUnit;
+
+    for (var _key5 in obj) {
+      if (hasOwnProperty(obj, _key5)) {
+        lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);
+      }
+    }
+
+    return lastUnit;
+  };
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * Example:
+   *  createUnitSingle('knot', '0.514444444 m/s')
+   *  createUnitSingle('acre', new Unit(43560, 'ft^2'))
+   *
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string, Unit, Object} definition      Definition of the unit in terms
+   * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,
+   * or an Object. If an Object, may have the following properties:
+   *   - definition {string|Unit} The definition of this unit.
+   *   - prefixes {string} "none", "short", "long", "binary_short", or "binary_long".
+   *     The default is "none".
+   *   - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']
+   *   - offset {Numeric} An offset to apply when converting from the unit. For
+   *     example, the offset for celsius is 273.15 and the offset for farhenheit
+   *     is 459.67. Default is 0.
+   *   - baseName {string} If the unit's dimension does not match that of any other
+   *     base unit, the name of the newly create base unit. Otherwise, this property
+   *     has no effect.
+   *
+   * @param {Object} options   (optional) An object containing any of the following
+   * properties:
+   *   - override {boolean} Whether this unit should be allowed to override existing
+   *     units.
+   *
+   * @return {Unit}
+   */
+
+
+  Unit.createUnitSingle = function (name, obj, options) {
+    if (typeof obj === 'undefined' || obj === null) {
+      obj = {};
+    }
+
+    if (typeof name !== 'string') {
+      throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");
+    } // Check collisions with existing units
+
+
+    if (hasOwnProperty(UNITS, name)) {
+      throw new Error('Cannot create unit "' + name + '": a unit with that name already exists');
+    } // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.
+
+
+    assertUnitNameIsValid(name);
+    var defUnit = null; // The Unit from which the new unit will be created.
+
+    var aliases = [];
+    var offset = 0;
+    var definition;
+    var prefixes;
+    var baseName;
+
+    if (obj && obj.type === 'Unit') {
+      defUnit = obj.clone();
+    } else if (typeof obj === 'string') {
+      if (obj !== '') {
+        definition = obj;
+      }
+    } else if (typeof obj === 'object') {
+      definition = obj.definition;
+      prefixes = obj.prefixes;
+      offset = obj.offset;
+      baseName = obj.baseName;
+
+      if (obj.aliases) {
+        aliases = obj.aliases.valueOf(); // aliases could be a Matrix, so convert to Array
+      }
+    } else {
+      throw new TypeError('Cannot create unit "' + name + '" from "' + obj.toString() + '": expecting "string" or "Unit" or "Object"');
+    }
+
+    if (aliases) {
+      for (var i = 0; i < aliases.length; i++) {
+        if (hasOwnProperty(UNITS, aliases[i])) {
+          throw new Error('Cannot create alias "' + aliases[i] + '": a unit with that name already exists');
+        }
+      }
+    }
+
+    if (definition && typeof definition === 'string' && !defUnit) {
+      try {
+        defUnit = Unit.parse(definition, {
+          allowNoUnits: true
+        });
+      } catch (ex) {
+        ex.message = 'Could not create unit "' + name + '" from "' + definition + '": ' + ex.message;
+        throw ex;
+      }
+    } else if (definition && definition.type === 'Unit') {
+      defUnit = definition.clone();
+    }
+
+    aliases = aliases || [];
+    offset = offset || 0;
+
+    if (prefixes && prefixes.toUpperCase) {
+      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;
+    } else {
+      prefixes = PREFIXES.NONE;
+    } // If defUnit is null, it is because the user did not
+    // specify a defintion. So create a new base dimension.
+
+
+    var newUnit = {};
+
+    if (!defUnit) {
+      // Add a new base dimension
+      baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+
+      if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {
+        throw new Error('Cannot create new base unit "' + name + '": a base unit with that name already exists (and cannot be overridden)');
+      }
+
+      BASE_DIMENSIONS.push(baseName); // Push 0 onto existing base units
+
+      for (var b in BASE_UNITS) {
+        if (hasOwnProperty(BASE_UNITS, b)) {
+          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;
+        }
+      } // Add the new base unit
+
+
+      var newBaseUnit = {
+        dimensions: []
+      };
+
+      for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {
+        newBaseUnit.dimensions[_i6] = 0;
+      }
+
+      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;
+      newBaseUnit.key = baseName;
+      BASE_UNITS[baseName] = newBaseUnit;
+      newUnit = {
+        name: name,
+        value: 1,
+        dimensions: BASE_UNITS[baseName].dimensions.slice(0),
+        prefixes: prefixes,
+        offset: offset,
+        base: BASE_UNITS[baseName]
+      };
+      currentUnitSystem[baseName] = {
+        unit: newUnit,
+        prefix: PREFIXES.NONE['']
+      };
+    } else {
+      newUnit = {
+        name: name,
+        value: defUnit.value,
+        dimensions: defUnit.dimensions.slice(0),
+        prefixes: prefixes,
+        offset: offset
+      }; // Create a new base if no matching base exists
+
+      var anyMatch = false;
+
+      for (var _i7 in BASE_UNITS) {
+        if (hasOwnProperty(BASE_UNITS, _i7)) {
+          var match = true;
+
+          for (var j = 0; j < BASE_DIMENSIONS.length; j++) {
+            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {
+              match = false;
+              break;
+            }
+          }
+
+          if (match) {
+            anyMatch = true;
+            newUnit.base = BASE_UNITS[_i7];
+            break;
+          }
+        }
+      }
+
+      if (!anyMatch) {
+        baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+        // Add the new base unit
+
+        var _newBaseUnit = {
+          dimensions: defUnit.dimensions.slice(0)
+        };
+        _newBaseUnit.key = baseName;
+        BASE_UNITS[baseName] = _newBaseUnit;
+        currentUnitSystem[baseName] = {
+          unit: newUnit,
+          prefix: PREFIXES.NONE['']
+        };
+        newUnit.base = BASE_UNITS[baseName];
+      }
+    }
+
+    Unit.UNITS[name] = newUnit;
+
+    for (var _i8 = 0; _i8 < aliases.length; _i8++) {
+      var aliasName = aliases[_i8];
+      var _alias = {};
+
+      for (var _key6 in newUnit) {
+        if (hasOwnProperty(newUnit, _key6)) {
+          _alias[_key6] = newUnit[_key6];
+        }
+      }
+
+      _alias.name = aliasName;
+      Unit.UNITS[aliasName] = _alias;
+    } // delete the memoization cache, since adding a new unit to the array
+    // invalidates all old results
+
+
+    delete _findUnit.cache;
+    return new Unit(null, name);
+  };
+
+  Unit.deleteUnit = function (name) {
+    delete Unit.UNITS[name];
+  }; // expose arrays with prefixes, dimensions, units, systems
+
+
+  Unit.PREFIXES = PREFIXES;
+  Unit.BASE_DIMENSIONS = BASE_DIMENSIONS;
+  Unit.BASE_UNITS = BASE_UNITS;
+  Unit.UNIT_SYSTEMS = UNIT_SYSTEMS;
+  Unit.UNITS = UNITS;
+  return Unit;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/function/createUnit.js b/node_modules/mathjs/lib/esm/type/unit/function/createUnit.js
new file mode 100644
index 0000000..80e09c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/function/createUnit.js
@@ -0,0 +1,79 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'createUnit';
+var dependencies = ['typed', 'Unit'];
+export var createCreateUnit = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Unit
+  } = _ref;
+
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   *
+   * Syntax:
+   *
+   *     math.createUnit({
+   *       baseUnit1: {
+   *         aliases: [string, ...]
+   *         prefixes: object
+   *       },
+   *       unit2: {
+   *         definition: string,
+   *         aliases: [string, ...]
+   *         prefixes: object,
+   *         offset: number
+   *       },
+   *       unit3: string    // Shortcut
+   *     })
+   *
+   *     // Another shortcut:
+   *     math.createUnit(string, unit : string, [object])
+   *
+   * Examples:
+   *
+   *     math.createUnit('foo')
+   *     math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})
+   *     math.createUnit('mph', '1 mile/hour')
+   *
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.
+   * @param {Object} options   (optional) An object containing any of the following properties:
+   *     - `prefixes {string}` "none", "short", "long", "binary_short", or "binary_long". The default is "none".
+   *     - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']
+   *     - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @return {Unit} The new unit
+   */
+  return typed(name, {
+    // General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.
+    'Object, Object': function ObjectObject(obj, options) {
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    Object: function Object(obj) {
+      return Unit.createUnit(obj, {});
+    },
+    // Shortcut method for creating one unit.
+    'string, Unit | string | Object, Object': function stringUnitStringObjectObject(name, def, options) {
+      var obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    'string, Unit | string | Object': function stringUnitStringObject(name, def) {
+      var obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, {});
+    },
+    // Without a definition, creates a base unit.
+    string: function string(name) {
+      var obj = {};
+      obj[name] = {};
+      return Unit.createUnit(obj, {});
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js b/node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js
new file mode 100644
index 0000000..f87e050
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js
@@ -0,0 +1,33 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'splitUnit';
+var dependencies = ['typed'];
+export var createSplitUnit = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Split a unit in an array of units whose sum is equal to the original unit.
+   *
+   * Syntax:
+   *
+   *     splitUnit(unit: Unit, parts: Array.<Unit>)
+   *
+   * Example:
+   *
+   *     math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])
+   *     // [ 3 feet, 3.3700787401575 inch ]
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @param {Array} [parts] An array of strings or valueless units.
+   * @return {Array} An array of units.
+   */
+  return typed(name, {
+    'Unit, Array': function UnitArray(unit, parts) {
+      return unit.splitUnit(parts);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/function/unit.js b/node_modules/mathjs/lib/esm/type/unit/function/unit.js
new file mode 100644
index 0000000..ec953f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/function/unit.js
@@ -0,0 +1,55 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'unit';
+var dependencies = ['typed', 'Unit']; // This function is named createUnitFunction to prevent a naming conflict with createUnit
+
+export var createUnitFunction = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Unit
+  } = _ref;
+
+  /**
+   * Create a unit. Depending on the passed arguments, the function
+   * will create and return a new math.Unit object.
+   * When a matrix is provided, all elements will be converted to units.
+   *
+   * Syntax:
+   *
+   *     math.unit(unit : string)
+   *     math.unit(value : number, unit : string)
+   *
+   * Examples:
+   *
+   *    const a = math.unit(5, 'cm')    // returns Unit 50 mm
+   *    const b = math.unit('23 kg')    // returns Unit 23 kg
+   *    a.to('m')                       // returns Unit 0.05 m
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, string, createUnit
+   *
+   * @param {* | Array | Matrix} args   A number and unit.
+   * @return {Unit | Array | Matrix}    The created unit
+   */
+  return typed(name, {
+    Unit: function Unit(x) {
+      return x.clone();
+    },
+    string: function string(x) {
+      if (Unit.isValuelessUnit(x)) {
+        return new Unit(null, x); // a pure unit
+      }
+
+      return Unit.parse(x, {
+        allowNoUnits: true
+      }); // a unit with value, like '5cm'
+    },
+    'number | BigNumber | Fraction | Complex, string': function numberBigNumberFractionComplexString(value, unit) {
+      return new Unit(value, unit);
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      return deepMap(x, this);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/physicalConstants.js b/node_modules/mathjs/lib/esm/type/unit/physicalConstants.js
new file mode 100644
index 0000000..44d76a2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/physicalConstants.js
@@ -0,0 +1,94 @@
+import { factory } from '../../utils/factory.js'; // Source: https://en.wikipedia.org/wiki/Physical_constant
+// Universal constants
+
+export var createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');
+export var createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');
+export var createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');
+export var createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s'); // Electromagnetic constants
+
+export var createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');
+export var createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');
+export var createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');
+export var createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2');
+export var createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');
+export var createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');
+export var createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');
+export var createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');
+export var createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');
+export var createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');
+export var createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');
+export var createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed
+// Atomic and nuclear constants
+
+export var createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');
+export var createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');
+export var createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');
+export var createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');
+export var createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);
+export var createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');
+export var createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');
+export var createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');
+export var createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');
+export var createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');
+export var createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');
+export var createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');
+export var createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);
+export var createEfimovFactor = numberFactory('efimovFactor', 22.7); // Physico-chemical constants
+
+export var createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');
+export var createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');
+export var createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');
+export var createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');
+export var createFirstRadiation = /* #__PURE__ */unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2'); // export const createSpectralRadiance = /* #__PURE__ */ unitFactory('spectralRadiance', '1.1910429723971881e-16', 'W m^2 sr^-1') // TODO spectralRadiance
+
+export var createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');
+export var createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');
+export var createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');
+export var createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');
+export var createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);
+export var createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');
+export var createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');
+export var createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K'); // Adopted values
+
+export var createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');
+export var createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');
+export var createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2'); // atm is defined in Unit.js
+// Natural units
+
+export var createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');
+export var createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');
+export var createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');
+export var createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');
+export var createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K'); // helper function to create a factory function which creates a physical constant,
+// a Unit with either a number value or a BigNumber value depending on the configuration
+
+function unitFactory(name, valueStr, unitStr) {
+  var dependencies = ['config', 'Unit', 'BigNumber'];
+  return factory(name, dependencies, _ref => {
+    var {
+      config,
+      Unit,
+      BigNumber
+    } = _ref;
+    // Note that we can parse into number or BigNumber.
+    // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values
+    // Therefore we dont use Unit.parse()
+    var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);
+    var unit = new Unit(value, unitStr);
+    unit.fixPrefix = true;
+    return unit;
+  });
+} // helper function to create a factory function which creates a numeric constant,
+// either a number or BigNumber depending on the configuration
+
+
+function numberFactory(name, value) {
+  var dependencies = ['config', 'BigNumber'];
+  return factory(name, dependencies, _ref2 => {
+    var {
+      config,
+      BigNumber
+    } = _ref2;
+    return config.number === 'BigNumber' ? new BigNumber(value) : value;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/array.js b/node_modules/mathjs/lib/esm/utils/array.js
new file mode 100644
index 0000000..f4d3e1f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/array.js
@@ -0,0 +1,629 @@
+import { isInteger } from './number.js';
+import { isNumber } from './is.js';
+import { format } from './string.js';
+import { DimensionError } from '../error/DimensionError.js';
+import { IndexError } from '../error/IndexError.js';
+/**
+ * Calculate the size of a multi dimensional array.
+ * This function checks the size of the first entry, it does not validate
+ * whether all dimensions match. (use function `validate` for that)
+ * @param {Array} x
+ * @Return {Number[]} size
+ */
+
+export function arraySize(x) {
+  var s = [];
+
+  while (Array.isArray(x)) {
+    s.push(x.length);
+    x = x[0];
+  }
+
+  return s;
+}
+/**
+ * Recursively validate whether each element in a multi dimensional array
+ * has a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @param {number} dim   Current dimension
+ * @throws DimensionError
+ * @private
+ */
+
+function _validate(array, size, dim) {
+  var i;
+  var len = array.length;
+
+  if (len !== size[dim]) {
+    throw new DimensionError(len, size[dim]);
+  }
+
+  if (dim < size.length - 1) {
+    // recursively validate each child array
+    var dimNext = dim + 1;
+
+    for (i = 0; i < len; i++) {
+      var child = array[i];
+
+      if (!Array.isArray(child)) {
+        throw new DimensionError(size.length - 1, size.length, '<');
+      }
+
+      _validate(array[i], size, dimNext);
+    }
+  } else {
+    // last dimension. none of the childs may be an array
+    for (i = 0; i < len; i++) {
+      if (Array.isArray(array[i])) {
+        throw new DimensionError(size.length + 1, size.length, '>');
+      }
+    }
+  }
+}
+/**
+ * Validate whether each element in a multi dimensional array has
+ * a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @throws DimensionError
+ */
+
+
+export function validate(array, size) {
+  var isScalar = size.length === 0;
+
+  if (isScalar) {
+    // scalar
+    if (Array.isArray(array)) {
+      throw new DimensionError(array.length, 0);
+    }
+  } else {
+    // array
+    _validate(array, size, 0);
+  }
+}
+/**
+ * Test whether index is an integer number with index >= 0 and index < length
+ * when length is provided
+ * @param {number} index    Zero-based index
+ * @param {number} [length] Length of the array
+ */
+
+export function validateIndex(index, length) {
+  if (!isNumber(index) || !isInteger(index)) {
+    throw new TypeError('Index must be an integer (value: ' + index + ')');
+  }
+
+  if (index < 0 || typeof length === 'number' && index >= length) {
+    throw new IndexError(index, length);
+  }
+}
+/**
+ * Resize a multi dimensional array. The resized array is returned.
+ * @param {Array} array         Array to be resized
+ * @param {Array.<number>} size Array with the size of each dimension
+ * @param {*} [defaultValue=0]  Value to be filled in in new entries,
+ *                              zero by default. Specify for example `null`,
+ *                              to clearly see entries that are not explicitly
+ *                              set.
+ * @return {Array} array         The resized array
+ */
+
+export function resize(array, size, defaultValue) {
+  // TODO: add support for scalars, having size=[] ?
+  // check the type of the arguments
+  if (!Array.isArray(array) || !Array.isArray(size)) {
+    throw new TypeError('Array expected');
+  }
+
+  if (size.length === 0) {
+    throw new Error('Resizing to scalar is not supported');
+  } // check whether size contains positive integers
+
+
+  size.forEach(function (value) {
+    if (!isNumber(value) || !isInteger(value) || value < 0) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');
+    }
+  }); // recursively resize the array
+
+  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;
+
+  _resize(array, size, 0, _defaultValue);
+
+  return array;
+}
+/**
+ * Recursively resize a multi dimensional array
+ * @param {Array} array         Array to be resized
+ * @param {number[]} size       Array with the size of each dimension
+ * @param {number} dim          Current dimension
+ * @param {*} [defaultValue]    Value to be filled in in new entries,
+ *                              undefined by default.
+ * @private
+ */
+
+function _resize(array, size, dim, defaultValue) {
+  var i;
+  var elem;
+  var oldLen = array.length;
+  var newLen = size[dim];
+  var minLen = Math.min(oldLen, newLen); // apply new length
+
+  array.length = newLen;
+
+  if (dim < size.length - 1) {
+    // non-last dimension
+    var dimNext = dim + 1; // resize existing child arrays
+
+    for (i = 0; i < minLen; i++) {
+      // resize child array
+      elem = array[i];
+
+      if (!Array.isArray(elem)) {
+        elem = [elem]; // add a dimension
+
+        array[i] = elem;
+      }
+
+      _resize(elem, size, dimNext, defaultValue);
+    } // create new child arrays
+
+
+    for (i = minLen; i < newLen; i++) {
+      // get child array
+      elem = [];
+      array[i] = elem; // resize new child array
+
+      _resize(elem, size, dimNext, defaultValue);
+    }
+  } else {
+    // last dimension
+    // remove dimensions of existing values
+    for (i = 0; i < minLen; i++) {
+      while (Array.isArray(array[i])) {
+        array[i] = array[i][0];
+      }
+    } // fill new elements with the default value
+
+
+    for (i = minLen; i < newLen; i++) {
+      array[i] = defaultValue;
+    }
+  }
+}
+/**
+ * Re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {Array.<number>} sizes  List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ *
+ * @throws {DimensionError}       If the product of the new dimension sizes does
+ *                                not equal that of the old ones
+ */
+
+
+export function reshape(array, sizes) {
+  var flatArray = flatten(array);
+  var currentLength = flatArray.length;
+
+  if (!Array.isArray(array) || !Array.isArray(sizes)) {
+    throw new TypeError('Array expected');
+  }
+
+  if (sizes.length === 0) {
+    throw new DimensionError(0, currentLength, '!=');
+  }
+
+  sizes = processSizesWildcard(sizes, currentLength);
+  var newLength = product(sizes);
+
+  if (currentLength !== newLength) {
+    throw new DimensionError(newLength, currentLength, '!=');
+  }
+
+  try {
+    return _reshape(flatArray, sizes);
+  } catch (e) {
+    if (e instanceof DimensionError) {
+      throw new DimensionError(newLength, currentLength, '!=');
+    }
+
+    throw e;
+  }
+}
+/**
+ * Replaces the wildcard -1 in the sizes array.
+ * @param {Array.<number>} sizes  List of sizes for each dimension. At most on wildcard.
+ * @param {number} currentLength  Number of elements in the array.
+ * @throws {Error}                If more than one wildcard or unable to replace it.
+ * @returns {Array.<number>}      The sizes array with wildcard replaced.
+ */
+
+export function processSizesWildcard(sizes, currentLength) {
+  var newLength = product(sizes);
+  var processedSizes = sizes.slice();
+  var WILDCARD = -1;
+  var wildCardIndex = sizes.indexOf(WILDCARD);
+  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;
+
+  if (isMoreThanOneWildcard) {
+    throw new Error('More than one wildcard in sizes');
+  }
+
+  var hasWildcard = wildCardIndex >= 0;
+  var canReplaceWildcard = currentLength % newLength === 0;
+
+  if (hasWildcard) {
+    if (canReplaceWildcard) {
+      processedSizes[wildCardIndex] = -currentLength / newLength;
+    } else {
+      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);
+    }
+  }
+
+  return processedSizes;
+}
+/**
+ * Computes the product of all array elements.
+ * @param {Array<number>} array Array of factors
+ * @returns {number}            Product of all elements
+ */
+
+function product(array) {
+  return array.reduce((prev, curr) => prev * curr, 1);
+}
+/**
+ * Iteratively re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {Array.<number>} sizes  List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ */
+
+
+function _reshape(array, sizes) {
+  // testing if there are enough elements for the requested shape
+  var tmpArray = array;
+  var tmpArray2; // for each dimensions starting by the last one and ignoring the first one
+
+  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {
+    var size = sizes[sizeIndex];
+    tmpArray2 = []; // aggregate the elements of the current tmpArray in elements of the requested size
+
+    var length = tmpArray.length / size;
+
+    for (var i = 0; i < length; i++) {
+      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));
+    } // set it as the new tmpArray for the next loop turn or for return
+
+
+    tmpArray = tmpArray2;
+  }
+
+  return tmpArray;
+}
+/**
+ * Squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {Array} [size]
+ * @returns {Array} returns the array itself
+ */
+
+
+export function squeeze(array, size) {
+  var s = size || arraySize(array); // squeeze outer dimensions
+
+  while (Array.isArray(array) && array.length === 1) {
+    array = array[0];
+    s.shift();
+  } // find the first dimension to be squeezed
+
+
+  var dims = s.length;
+
+  while (s[dims - 1] === 1) {
+    dims--;
+  } // squeeze inner dimensions
+
+
+  if (dims < s.length) {
+    array = _squeeze(array, dims, 0);
+    s.length = dims;
+  }
+
+  return array;
+}
+/**
+ * Recursively squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the squeezed array
+ * @private
+ */
+
+function _squeeze(array, dims, dim) {
+  var i, ii;
+
+  if (dim < dims) {
+    var next = dim + 1;
+
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _squeeze(array[i], dims, next);
+    }
+  } else {
+    while (Array.isArray(array)) {
+      array = array[0];
+    }
+  }
+
+  return array;
+}
+/**
+ * Unsqueeze a multi dimensional array: add dimensions when missing
+ *
+ * Paramter `size` will be mutated to match the new, unqueezed matrix size.
+ *
+ * @param {Array} array
+ * @param {number} dims       Desired number of dimensions of the array
+ * @param {number} [outer]    Number of outer dimensions to be added
+ * @param {Array} [size] Current size of array.
+ * @returns {Array} returns the array itself
+ * @private
+ */
+
+
+export function unsqueeze(array, dims, outer, size) {
+  var s = size || arraySize(array); // unsqueeze outer dimensions
+
+  if (outer) {
+    for (var i = 0; i < outer; i++) {
+      array = [array];
+      s.unshift(1);
+    }
+  } // unsqueeze inner dimensions
+
+
+  array = _unsqueeze(array, dims, 0);
+
+  while (s.length < dims) {
+    s.push(1);
+  }
+
+  return array;
+}
+/**
+ * Recursively unsqueeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the squeezed array
+ * @private
+ */
+
+function _unsqueeze(array, dims, dim) {
+  var i, ii;
+
+  if (Array.isArray(array)) {
+    var next = dim + 1;
+
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _unsqueeze(array[i], dims, next);
+    }
+  } else {
+    for (var d = dim; d < dims; d++) {
+      array = [array];
+    }
+  }
+
+  return array;
+}
+/**
+ * Flatten a multi dimensional array, put all elements in a one dimensional
+ * array
+ * @param {Array} array   A multi dimensional array
+ * @return {Array}        The flattened array (1 dimensional)
+ */
+
+
+export function flatten(array) {
+  if (!Array.isArray(array)) {
+    // if not an array, return as is
+    return array;
+  }
+
+  var flat = [];
+  array.forEach(function callback(value) {
+    if (Array.isArray(value)) {
+      value.forEach(callback); // traverse through sub-arrays recursively
+    } else {
+      flat.push(value);
+    }
+  });
+  return flat;
+}
+/**
+ * A safe map
+ * @param {Array} array
+ * @param {function} callback
+ */
+
+export function map(array, callback) {
+  return Array.prototype.map.call(array, callback);
+}
+/**
+ * A safe forEach
+ * @param {Array} array
+ * @param {function} callback
+ */
+
+export function forEach(array, callback) {
+  Array.prototype.forEach.call(array, callback);
+}
+/**
+ * A safe filter
+ * @param {Array} array
+ * @param {function} callback
+ */
+
+export function filter(array, callback) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+
+  return Array.prototype.filter.call(array, callback);
+}
+/**
+ * Filter values in a callback given a regular expression
+ * @param {Array} array
+ * @param {RegExp} regexp
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+
+export function filterRegExp(array, regexp) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+
+  return Array.prototype.filter.call(array, entry => regexp.test(entry));
+}
+/**
+ * A safe join
+ * @param {Array} array
+ * @param {string} separator
+ */
+
+export function join(array, separator) {
+  return Array.prototype.join.call(array, separator);
+}
+/**
+ * Assign a numeric identifier to every element of a sorted array
+ * @param {Array} a  An array
+ * @return {Array} An array of objects containing the original value and its identifier
+ */
+
+export function identify(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+
+  if (a.length === 0) {
+    return a;
+  }
+
+  var b = [];
+  var count = 0;
+  b[0] = {
+    value: a[0],
+    identifier: 0
+  };
+
+  for (var i = 1; i < a.length; i++) {
+    if (a[i] === a[i - 1]) {
+      count++;
+    } else {
+      count = 0;
+    }
+
+    b.push({
+      value: a[i],
+      identifier: count
+    });
+  }
+
+  return b;
+}
+/**
+ * Remove the numeric identifier from the elements
+ * @param {array} a  An array
+ * @return {array} An array of values without identifiers
+ */
+
+export function generalize(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+
+  if (a.length === 0) {
+    return a;
+  }
+
+  var b = [];
+
+  for (var i = 0; i < a.length; i++) {
+    b.push(a[i].value);
+  }
+
+  return b;
+}
+/**
+ * Check the datatype of a given object
+ * This is a low level implementation that should only be used by
+ * parent Matrix classes such as SparseMatrix or DenseMatrix
+ * This method does not validate Array Matrix shape
+ * @param {Array} array
+ * @param {function} typeOf   Callback function to use to determine the type of a value
+ * @return {string}
+ */
+
+export function getArrayDataType(array, typeOf) {
+  var type; // to hold type info
+
+  var length = 0; // to hold length value to ensure it has consistent sizes
+
+  for (var i = 0; i < array.length; i++) {
+    var item = array[i];
+    var isArray = Array.isArray(item); // Saving the target matrix row size
+
+    if (i === 0 && isArray) {
+      length = item.length;
+    } // If the current item is an array but the length does not equal the targetVectorSize
+
+
+    if (isArray && item.length !== length) {
+      return undefined;
+    }
+
+    var itemType = isArray ? getArrayDataType(item, typeOf) // recurse into a nested array
+    : typeOf(item);
+
+    if (type === undefined) {
+      type = itemType; // first item
+    } else if (type !== itemType) {
+      return 'mixed';
+    } else {// we're good, everything has the same type so far
+    }
+  }
+
+  return type;
+}
+/**
+ * Return the last item from an array
+ * @param array
+ * @returns {*}
+ */
+
+export function last(array) {
+  return array[array.length - 1];
+}
+/**
+ * Get all but the last element of array.
+ */
+
+export function initial(array) {
+  return array.slice(0, array.length - 1);
+}
+/**
+ * Test whether an array or string contains an item
+ * @param {Array | string} array
+ * @param {*} item
+ * @return {boolean}
+ */
+
+export function contains(array, item) {
+  return array.indexOf(item) !== -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js b/node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js
new file mode 100644
index 0000000..f0da03e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js
@@ -0,0 +1,475 @@
+/**
+ * Bitwise and for Bignumbers
+ *
+ * Special Cases:
+ *   N &  n =  N
+ *   n &  0 =  0
+ *   n & -1 =  n
+ *   n &  n =  n
+ *   I &  I =  I
+ *  -I & -I = -I
+ *   I & -I =  0
+ *   I &  n =  n
+ *   I & -n =  I
+ *  -I &  n =  0
+ *  -I & -n = -I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` & `y`, is fully precise
+ * @private
+ */
+export function bitAndBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero() || y.eq(-1) || x.eq(y)) {
+    return x;
+  }
+
+  if (y.isZero() || x.eq(-1)) {
+    return y;
+  }
+
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      if (x.isNegative() === y.isNegative()) {
+        return x;
+      }
+
+      return new BigNumber(0);
+    }
+
+    if (!x.isFinite()) {
+      if (y.isNegative()) {
+        return x;
+      }
+
+      if (x.isNegative()) {
+        return new BigNumber(0);
+      }
+
+      return y;
+    }
+
+    if (!y.isFinite()) {
+      if (x.isNegative()) {
+        return y;
+      }
+
+      if (y.isNegative()) {
+        return new BigNumber(0);
+      }
+
+      return x;
+    }
+  }
+
+  return bitwise(x, y, function (a, b) {
+    return a & b;
+  });
+}
+/**
+ * Bitwise not
+ * @param {BigNumber} x
+ * @return {BigNumber} Result of ~`x`, fully precise
+ *
+ */
+
+export function bitNotBigNumber(x) {
+  if (x.isFinite() && !x.isInteger()) {
+    throw new Error('Integer expected in function bitNot');
+  }
+
+  var BigNumber = x.constructor;
+  var prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+  var result = x.plus(new BigNumber(1));
+  result.s = -result.s || null;
+  BigNumber.config({
+    precision: prevPrec
+  });
+  return result;
+}
+/**
+ * Bitwise OR for BigNumbers
+ *
+ * Special Cases:
+ *   N |  n =  N
+ *   n |  0 =  n
+ *   n | -1 = -1
+ *   n |  n =  n
+ *   I |  I =  I
+ *  -I | -I = -I
+ *   I | -n = -1
+ *   I | -I = -1
+ *   I |  n =  I
+ *  -I |  n = -I
+ *  -I | -n = -n
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` | `y`, fully precise
+ */
+
+export function bitOrBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitOr');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+
+  var negOne = new BigNumber(-1);
+
+  if (x.isZero() || y.eq(negOne) || x.eq(y)) {
+    return y;
+  }
+
+  if (y.isZero() || x.eq(negOne)) {
+    return x;
+  }
+
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !x.isNegative() && y.isNegative() || x.isNegative() && !y.isNegative() && !y.isFinite()) {
+      return negOne;
+    }
+
+    if (x.isNegative() && y.isNegative()) {
+      return x.isFinite() ? x : y;
+    }
+
+    return x.isFinite() ? y : x;
+  }
+
+  return bitwise(x, y, function (a, b) {
+    return a | b;
+  });
+}
+/**
+ * Applies bitwise function to numbers
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @param {function (a, b)} func
+ * @return {BigNumber}
+ */
+
+export function bitwise(x, y, func) {
+  var BigNumber = x.constructor;
+  var xBits, yBits;
+  var xSign = +(x.s < 0);
+  var ySign = +(y.s < 0);
+
+  if (xSign) {
+    xBits = decCoefficientToBinaryString(bitNotBigNumber(x));
+
+    for (var i = 0; i < xBits.length; ++i) {
+      xBits[i] ^= 1;
+    }
+  } else {
+    xBits = decCoefficientToBinaryString(x);
+  }
+
+  if (ySign) {
+    yBits = decCoefficientToBinaryString(bitNotBigNumber(y));
+
+    for (var _i = 0; _i < yBits.length; ++_i) {
+      yBits[_i] ^= 1;
+    }
+  } else {
+    yBits = decCoefficientToBinaryString(y);
+  }
+
+  var minBits, maxBits, minSign;
+
+  if (xBits.length <= yBits.length) {
+    minBits = xBits;
+    maxBits = yBits;
+    minSign = xSign;
+  } else {
+    minBits = yBits;
+    maxBits = xBits;
+    minSign = ySign;
+  }
+
+  var shortLen = minBits.length;
+  var longLen = maxBits.length;
+  var expFuncVal = func(xSign, ySign) ^ 1;
+  var outVal = new BigNumber(expFuncVal ^ 1);
+  var twoPower = new BigNumber(1);
+  var two = new BigNumber(2);
+  var prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+
+  while (shortLen > 0) {
+    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+
+    twoPower = twoPower.times(two);
+  }
+
+  while (longLen > 0) {
+    if (func(minSign, maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+
+    twoPower = twoPower.times(two);
+  }
+
+  BigNumber.config({
+    precision: prevPrec
+  });
+
+  if (expFuncVal === 0) {
+    outVal.s = -outVal.s;
+  }
+
+  return outVal;
+}
+/* Extracted from decimal.js, and edited to specialize. */
+
+function decCoefficientToBinaryString(x) {
+  // Convert to string
+  var a = x.d; // array with digits
+
+  var r = a[0] + '';
+
+  for (var i = 1; i < a.length; ++i) {
+    var s = a[i] + '';
+
+    for (var z = 7 - s.length; z--;) {
+      s = '0' + s;
+    }
+
+    r += s;
+  }
+
+  var j = r.length;
+
+  while (r.charAt(j) === '0') {
+    j--;
+  }
+
+  var xe = x.e;
+  var str = r.slice(0, j + 1 || 1);
+  var strL = str.length;
+
+  if (xe > 0) {
+    if (++xe > strL) {
+      // Append zeros.
+      xe -= strL;
+
+      while (xe--) {
+        str += '0';
+      }
+    } else if (xe < strL) {
+      str = str.slice(0, xe) + '.' + str.slice(xe);
+    }
+  } // Convert from base 10 (decimal) to base 2
+
+
+  var arr = [0];
+
+  for (var _i2 = 0; _i2 < str.length;) {
+    var arrL = arr.length;
+
+    while (arrL--) {
+      arr[arrL] *= 10;
+    }
+
+    arr[0] += parseInt(str.charAt(_i2++)); // convert to int
+
+    for (var _j = 0; _j < arr.length; ++_j) {
+      if (arr[_j] > 1) {
+        if (arr[_j + 1] === null || arr[_j + 1] === undefined) {
+          arr[_j + 1] = 0;
+        }
+
+        arr[_j + 1] += arr[_j] >> 1;
+        arr[_j] &= 1;
+      }
+    }
+  }
+
+  return arr.reverse();
+}
+/**
+ * Bitwise XOR for BigNumbers
+ *
+ * Special Cases:
+ *   N ^  n =  N
+ *   n ^  0 =  n
+ *   n ^  n =  0
+ *   n ^ -1 = ~n
+ *   I ^  n =  I
+ *   I ^ -n = -I
+ *   I ^ -I = -1
+ *  -I ^  n = -I
+ *  -I ^ -n =  I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` ^ `y`, fully precise
+ *
+ */
+
+
+export function bitXor(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitXor');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero()) {
+    return y;
+  }
+
+  if (y.isZero()) {
+    return x;
+  }
+
+  if (x.eq(y)) {
+    return new BigNumber(0);
+  }
+
+  var negOne = new BigNumber(-1);
+
+  if (x.eq(negOne)) {
+    return bitNotBigNumber(y);
+  }
+
+  if (y.eq(negOne)) {
+    return bitNotBigNumber(x);
+  }
+
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      return negOne;
+    }
+
+    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);
+  }
+
+  return bitwise(x, y, function (a, b) {
+    return a ^ b;
+  });
+}
+/**
+ * Bitwise left shift
+ *
+ * Special Cases:
+ *  n << -n = N
+ *  n <<  N = N
+ *  N <<  n = N
+ *  n <<  0 = n
+ *  0 <<  n = 0
+ *  I <<  I = N
+ *  I <<  n = I
+ *  n <<  I = I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` << `y`
+ *
+ */
+
+export function leftShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function leftShift');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+
+  if (!x.isFinite() && !y.isFinite()) {
+    return new BigNumber(NaN);
+  } // Math.pow(2, y) is fully precise for y < 55, and fast
+
+
+  if (y.lt(55)) {
+    return x.times(Math.pow(2, y.toNumber()) + '');
+  }
+
+  return x.times(new BigNumber(2).pow(y));
+}
+/*
+ * Special Cases:
+ *   n >> -n =  N
+ *   n >>  N =  N
+ *   N >>  n =  N
+ *   I >>  I =  N
+ *   n >>  0 =  n
+ *   I >>  n =  I
+ *  -I >>  n = -I
+ *  -I >>  I = -I
+ *   n >>  I =  I
+ *  -n >>  I = -1
+ *   0 >>  n =  0
+ *
+ * @param {BigNumber} value
+ * @param {BigNumber} value
+ * @return {BigNumber} Result of `x` >> `y`
+ *
+ */
+
+export function rightArithShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+
+  var BigNumber = x.constructor;
+
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+
+  if (!y.isFinite()) {
+    if (x.isNegative()) {
+      return new BigNumber(-1);
+    }
+
+    if (!x.isFinite()) {
+      return new BigNumber(NaN);
+    }
+
+    return new BigNumber(0);
+  } // Math.pow(2, y) is fully precise for y < 55, and fast
+
+
+  if (y.lt(55)) {
+    return x.div(Math.pow(2, y.toNumber()) + '').floor();
+  }
+
+  return x.div(new BigNumber(2).pow(y)).floor();
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/constants.js b/node_modules/mathjs/lib/esm/utils/bignumber/constants.js
new file mode 100644
index 0000000..48016de
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/constants.js
@@ -0,0 +1,57 @@
+import { memoize } from '../function.js';
+/**
+ * Calculate BigNumber e
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns e
+ */
+
+export var createBigNumberE = memoize(function (BigNumber) {
+  return new BigNumber(1).exp();
+}, {
+  hasher
+});
+/**
+ * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns phi
+ */
+
+export var createBigNumberPhi = memoize(function (BigNumber) {
+  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);
+}, {
+  hasher
+});
+/**
+ * Calculate BigNumber pi.
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns pi
+ */
+
+export var createBigNumberPi = memoize(function (BigNumber) {
+  return BigNumber.acos(-1);
+}, {
+  hasher
+});
+/**
+ * Calculate BigNumber tau, tau = 2 * pi
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns tau
+ */
+
+export var createBigNumberTau = memoize(function (BigNumber) {
+  return createBigNumberPi(BigNumber).times(2);
+}, {
+  hasher
+});
+/**
+ * Create a hash for a BigNumber constructor function. The created has is
+ * the configured precision
+ * @param {Array} args         Supposed to contain a single entry with
+ *                             a BigNumber constructor
+ * @return {number} precision
+ * @private
+ */
+
+function hasher(args) {
+  return args[0].precision;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js b/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js
new file mode 100644
index 0000000..0a4c280
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js
@@ -0,0 +1,272 @@
+import { isInteger } from '../number.js';
+/**
+ * Formats a BigNumber in a given base
+ * @param {BigNumber} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+
+function formatBigNumberToBase(n, base, size) {
+  var BigNumberCtor = n.constructor;
+  var big2 = new BigNumberCtor(2);
+  var suffix = '';
+
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+
+    if (!isInteger(size)) {
+      throw new Error('size must be an integer');
+    }
+
+    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {
+      throw new Error("Value must be in range [-2^".concat(size - 1, ", 2^").concat(size - 1, "-1]"));
+    }
+
+    if (!n.isInteger()) {
+      throw new Error('Value must be an integer');
+    }
+
+    if (n.lessThan(0)) {
+      n = n.add(big2.pow(size));
+    }
+
+    suffix = "i".concat(size);
+  }
+
+  switch (base) {
+    case 2:
+      return "".concat(n.toBinary()).concat(suffix);
+
+    case 8:
+      return "".concat(n.toOctal()).concat(suffix);
+
+    case 16:
+      return "".concat(n.toHexadecimal()).concat(suffix);
+
+    default:
+      throw new Error("Base ".concat(base, " not supported "));
+  }
+}
+/**
+ * Convert a BigNumber to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lower` and `upper` bounds, and uses
+ *                                          exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+ *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'
+ *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'
+ *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'
+ *
+ * @param {BigNumber} value
+ * @param {Object | Function | number} [options]
+ * @return {string} str The formatted value
+ */
+
+
+export function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  } // handle special cases
+
+
+  if (!value.isFinite()) {
+    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';
+  } // default values for options
+
+
+  var notation = 'auto';
+  var precision;
+  var wordSize;
+
+  if (options !== undefined) {
+    // determine notation from options
+    if (options.notation) {
+      notation = options.notation;
+    } // determine precision from options
+
+
+    if (typeof options === 'number') {
+      precision = options;
+    } else if (options.precision) {
+      precision = options.precision;
+    }
+
+    if (options.wordSize) {
+      wordSize = options.wordSize;
+
+      if (typeof wordSize !== 'number') {
+        throw new Error('Option "wordSize" must be a number');
+      }
+    }
+  } // handle the various notations
+
+
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+
+    case 'exponential':
+      return toExponential(value, precision);
+
+    case 'engineering':
+      return toEngineering(value, precision);
+
+    case 'bin':
+      return formatBigNumberToBase(value, 2, wordSize);
+
+    case 'oct':
+      return formatBigNumberToBase(value, 8, wordSize);
+
+    case 'hex':
+      return formatBigNumberToBase(value, 16, wordSize);
+
+    case 'auto':
+      {
+        // determine lower and upper bound for exponential notation.
+        // TODO: implement support for upper and lower to be BigNumbers themselves
+        var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;
+        var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5; // handle special case zero
+
+        if (value.isZero()) return '0'; // determine whether or not to output exponential notation
+
+        var str;
+        var rounded = value.toSignificantDigits(precision);
+        var exp = rounded.e;
+
+        if (exp >= lowerExp && exp < upperExp) {
+          // normal number notation
+          str = rounded.toFixed();
+        } else {
+          // exponential notation
+          str = toExponential(value, precision);
+        } // remove trailing zeros after the decimal point
+
+
+        return str.replace(/((\.\d*?)(0+))($|e)/, function () {
+          var digits = arguments[2];
+          var e = arguments[4];
+          return digits !== '.' ? digits + e : e;
+        });
+      }
+
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+/**
+ * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {BigNumber | string} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+
+export function toEngineering(value, precision) {
+  // find nearest lower multiple of 3 for exponent
+  var e = value.e;
+  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3; // find difference in exponents, and calculate the value without exponent
+
+  var valueWithoutExp = value.mul(Math.pow(10, -newExp));
+  var valueStr = valueWithoutExp.toPrecision(precision);
+
+  if (valueStr.indexOf('e') !== -1) {
+    valueStr = valueWithoutExp.toString();
+  }
+
+  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+}
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {BigNumber} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ * @returns {string} str
+ */
+
+export function toExponential(value, precision) {
+  if (precision !== undefined) {
+    return value.toExponential(precision - 1); // Note the offset of one
+  } else {
+    return value.toExponential();
+  }
+}
+/**
+ * Format a number with fixed notation.
+ * @param {BigNumber} value
+ * @param {number} [precision=undefined] Optional number of decimals after the
+ *                                       decimal point. Undefined by default.
+ */
+
+export function toFixed(value, precision) {
+  return value.toFixed(precision);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js b/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js
new file mode 100644
index 0000000..7a21fa2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js
@@ -0,0 +1,42 @@
+/**
+ * Compares two BigNumbers.
+ * @param {BigNumber} x       First value to compare
+ * @param {BigNumber} y       Second value to compare
+ * @param {number} [epsilon]  The maximum relative difference between x and y
+ *                            If epsilon is undefined or null, the function will
+ *                            test whether x and y are exactly equal.
+ * @return {boolean} whether the two numbers are nearly equal
+ */
+export function nearlyEqual(x, y, epsilon) {
+  // if epsilon is null or undefined, test whether x and y are exactly equal
+  if (epsilon === null || epsilon === undefined) {
+    return x.eq(y);
+  } // use "==" operator, handles infinities
+
+
+  if (x.eq(y)) {
+    return true;
+  } // NaN
+
+
+  if (x.isNaN() || y.isNaN()) {
+    return false;
+  } // at this point x and y should be finite
+
+
+  if (x.isFinite() && y.isFinite()) {
+    // check numbers are very close, needed when comparing numbers near zero
+    var diff = x.minus(y).abs();
+
+    if (diff.isZero()) {
+      return true;
+    } else {
+      // use relative error
+      var max = x.constructor.max(x.abs(), y.abs());
+      return diff.lte(max.times(epsilon));
+    }
+  } // Infinite and Number or negative Infinite and positive Infinite cases
+
+
+  return false;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/collection.js b/node_modules/mathjs/lib/esm/utils/collection.js
new file mode 100644
index 0000000..2b909ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/collection.js
@@ -0,0 +1,187 @@
+import { isCollection, isMatrix } from './is.js';
+import { IndexError } from '../error/IndexError.js';
+import { arraySize } from './array.js';
+import { _switch } from './switch.js';
+/**
+ * Test whether an array contains collections
+ * @param {Array} array
+ * @returns {boolean} Returns true when the array contains one or multiple
+ *                    collections (Arrays or Matrices). Returns false otherwise.
+ */
+
+export function containsCollections(array) {
+  for (var i = 0; i < array.length; i++) {
+    if (isCollection(array[i])) {
+      return true;
+    }
+  }
+
+  return false;
+}
+/**
+ * Recursively loop over all elements in a given multi dimensional array
+ * and invoke the callback on each of the elements.
+ * @param {Array | Matrix} array
+ * @param {Function} callback     The callback method is invoked with one
+ *                                parameter: the current element in the array
+ */
+
+export function deepForEach(array, callback) {
+  if (isMatrix(array)) {
+    array = array.valueOf();
+  }
+
+  for (var i = 0, ii = array.length; i < ii; i++) {
+    var value = array[i];
+
+    if (Array.isArray(value)) {
+      deepForEach(value, callback);
+    } else {
+      callback(value);
+    }
+  }
+}
+/**
+ * Execute the callback function element wise for each element in array and any
+ * nested array
+ * Returns an array with the results
+ * @param {Array | Matrix} array
+ * @param {Function} callback   The callback is called with two parameters:
+ *                              value1 and value2, which contain the current
+ *                              element of both arrays.
+ * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+ *
+ * @return {Array | Matrix} res
+ */
+
+export function deepMap(array, callback, skipZeros) {
+  if (array && typeof array.map === 'function') {
+    // TODO: replace array.map with a for loop to improve performance
+    return array.map(function (x) {
+      return deepMap(x, callback, skipZeros);
+    });
+  } else {
+    return callback(array);
+  }
+}
+/**
+ * Reduce a given matrix or array to a new matrix or
+ * array with one less dimension, applying the given
+ * callback in the selected dimension.
+ * @param {Array | Matrix} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @return {Array | Matrix} res
+ */
+
+export function reduce(mat, dim, callback) {
+  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();
+
+  if (dim < 0 || dim >= size.length) {
+    // TODO: would be more clear when throwing a DimensionError here
+    throw new IndexError(dim, size.length);
+  }
+
+  if (isMatrix(mat)) {
+    return mat.create(_reduce(mat.valueOf(), dim, callback));
+  } else {
+    return _reduce(mat, dim, callback);
+  }
+}
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+
+function _reduce(mat, dim, callback) {
+  var i, ret, val, tran;
+
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      val = mat[0];
+
+      for (i = 1; i < mat.length; i++) {
+        val = callback(val, mat[i]);
+      }
+
+      return val;
+    } else {
+      tran = _switch(mat);
+      ret = [];
+
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _reduce(tran[i], dim - 1, callback);
+      }
+
+      return ret;
+    }
+  } else {
+    ret = [];
+
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _reduce(mat[i], dim - 1, callback);
+    }
+
+    return ret;
+  }
+} // TODO: document function scatter
+
+
+export function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr; // vars
+
+  var k, k0, k1, i; // check we need to process values (pattern matrix)
+
+  if (x) {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k]; // check value exists in current j
+
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark; // add i to pattern of C
+
+        cindex.push(i); // x(i) = A, check we need to call function this time
+
+        if (update) {
+          // copy value to workspace calling callback function
+          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]); // function was called on current row
+
+          u[i] = mark;
+        } else {
+          // copy value to workspace
+          x[i] = avalues[k];
+        }
+      } else {
+        // i exists in C already
+        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]); // function was called on current row
+
+        u[i] = mark;
+      }
+    }
+  } else {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k]; // check value exists in current j
+
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark; // add i to pattern of C
+
+        cindex.push(i);
+      } else {
+        // indicate function was called on current row
+        u[i] = mark;
+      }
+    }
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/complex.js b/node_modules/mathjs/lib/esm/utils/complex.js
new file mode 100644
index 0000000..1df9b24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/complex.js
@@ -0,0 +1,13 @@
+import { nearlyEqual } from './number.js';
+/**
+ * Test whether two complex values are equal provided a given epsilon.
+ * Does not use or change the global Complex.EPSILON setting
+ * @param {Complex} x
+ * @param {Complex} y
+ * @param {number} epsilon
+ * @returns {boolean}
+ */
+
+export function complexEquals(x, y, epsilon) {
+  return nearlyEqual(x.re, y.re, epsilon) && nearlyEqual(x.im, y.im, epsilon);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/customs.js b/node_modules/mathjs/lib/esm/utils/customs.js
new file mode 100644
index 0000000..c82905e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/customs.js
@@ -0,0 +1,173 @@
+import { hasOwnProperty } from './object.js';
+/**
+ * Get a property of a plain object
+ * Throws an error in case the object is not a plain object or the
+ * property is not defined on the object itself
+ * @param {Object} object
+ * @param {string} prop
+ * @return {*} Returns the property value when safe
+ */
+
+function getSafeProperty(object, prop) {
+  // only allow getting safe properties of a plain object
+  if (isPlainObject(object) && isSafeProperty(object, prop)) {
+    return object[prop];
+  }
+
+  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {
+    throw new Error('Cannot access method "' + prop + '" as a property');
+  }
+
+  throw new Error('No access to property "' + prop + '"');
+}
+/**
+ * Set a property on a plain object.
+ * Throws an error in case the object is not a plain object or the
+ * property would override an inherited property like .constructor or .toString
+ * @param {Object} object
+ * @param {string} prop
+ * @param {*} value
+ * @return {*} Returns the value
+ */
+// TODO: merge this function into access.js?
+
+
+function setSafeProperty(object, prop, value) {
+  // only allow setting safe properties of a plain object
+  if (isPlainObject(object) && isSafeProperty(object, prop)) {
+    object[prop] = value;
+    return value;
+  }
+
+  throw new Error('No access to property "' + prop + '"');
+}
+
+function getSafeProperties(object) {
+  return Object.keys(object).filter(prop => hasOwnProperty(object, prop));
+}
+
+function hasSafeProperty(object, prop) {
+  return prop in object;
+}
+/**
+ * Test whether a property is safe to use for an object.
+ * For example .toString and .constructor are not safe
+ * @param {string} prop
+ * @return {boolean} Returns true when safe
+ */
+
+
+function isSafeProperty(object, prop) {
+  if (!object || typeof object !== 'object') {
+    return false;
+  } // SAFE: whitelisted
+  // e.g length
+
+
+  if (hasOwnProperty(safeNativeProperties, prop)) {
+    return true;
+  } // UNSAFE: inherited from Object prototype
+  // e.g constructor
+
+
+  if (prop in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  } // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+
+
+  if (prop in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+
+  return true;
+}
+/**
+ * Validate whether a method is safe.
+ * Throws an error when that's not the case.
+ * @param {Object} object
+ * @param {string} method
+ */
+// TODO: merge this function into assign.js?
+
+
+function validateSafeMethod(object, method) {
+  if (!isSafeMethod(object, method)) {
+    throw new Error('No access to method "' + method + '"');
+  }
+}
+/**
+ * Check whether a method is safe.
+ * Throws an error when that's not the case (for example for `constructor`).
+ * @param {Object} object
+ * @param {string} method
+ * @return {boolean} Returns true when safe, false otherwise
+ */
+
+
+function isSafeMethod(object, method) {
+  if (object === null || object === undefined || typeof object[method] !== 'function') {
+    return false;
+  } // UNSAFE: ghosted
+  // e.g overridden toString
+  // Note that IE10 doesn't support __proto__ and we can't do this check there.
+
+
+  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {
+    return false;
+  } // SAFE: whitelisted
+  // e.g toString
+
+
+  if (hasOwnProperty(safeNativeMethods, method)) {
+    return true;
+  } // UNSAFE: inherited from Object prototype
+  // e.g constructor
+
+
+  if (method in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  } // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+
+
+  if (method in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+
+  return true;
+}
+
+function isPlainObject(object) {
+  return typeof object === 'object' && object && object.constructor === Object;
+}
+
+var safeNativeProperties = {
+  length: true,
+  name: true
+};
+var safeNativeMethods = {
+  toString: true,
+  valueOf: true,
+  toLocaleString: true
+};
+export { getSafeProperty };
+export { setSafeProperty };
+export { isSafeProperty };
+export { hasSafeProperty };
+export { getSafeProperties };
+export { validateSafeMethod };
+export { isSafeMethod };
+export { isPlainObject };
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/emitter.js b/node_modules/mathjs/lib/esm/utils/emitter.js
new file mode 100644
index 0000000..0f05273
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/emitter.js
@@ -0,0 +1,17 @@
+import Emitter from 'tiny-emitter';
+/**
+ * Extend given object with emitter functions `on`, `off`, `once`, `emit`
+ * @param {Object} obj
+ * @return {Object} obj
+ */
+
+export function mixin(obj) {
+  // create event emitter
+  var emitter = new Emitter(); // bind methods to obj (we don't want to expose the emitter.e Array...)
+
+  obj.on = emitter.on.bind(emitter);
+  obj.off = emitter.off.bind(emitter);
+  obj.once = emitter.once.bind(emitter);
+  obj.emit = emitter.emit.bind(emitter);
+  return obj;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/factory.js b/node_modules/mathjs/lib/esm/utils/factory.js
new file mode 100644
index 0000000..809ded9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/factory.js
@@ -0,0 +1,135 @@
+import { contains } from './array.js';
+import { pickShallow } from './object.js';
+/**
+ * Create a factory function, which can be used to inject dependencies.
+ *
+ * The created functions are memoized, a consecutive call of the factory
+ * with the exact same inputs will return the same function instance.
+ * The memoized cache is exposed on `factory.cache` and can be cleared
+ * if needed.
+ *
+ * Example:
+ *
+ *     const name = 'log'
+ *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']
+ *
+ *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {
+ *       // ... create the function log here and return it
+ *     }
+ *
+ * @param {string} name           Name of the function to be created
+ * @param {string[]} dependencies The names of all required dependencies
+ * @param {function} create       Callback function called with an object with all dependencies
+ * @param {Object} [meta]         Optional object with meta information that will be attached
+ *                                to the created factory function as property `meta`.
+ * @returns {function}
+ */
+
+export function factory(name, dependencies, create, meta) {
+  function assertAndCreate(scope) {
+    // we only pass the requested dependencies to the factory function
+    // to prevent functions to rely on dependencies that are not explicitly
+    // requested.
+    var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));
+    assertDependencies(name, dependencies, scope);
+    return create(deps);
+  }
+
+  assertAndCreate.isFactory = true;
+  assertAndCreate.fn = name;
+  assertAndCreate.dependencies = dependencies.slice().sort();
+
+  if (meta) {
+    assertAndCreate.meta = meta;
+  }
+
+  return assertAndCreate;
+}
+/**
+ * Sort all factories such that when loading in order, the dependencies are resolved.
+ *
+ * @param {Array} factories
+ * @returns {Array} Returns a new array with the sorted factories.
+ */
+
+export function sortFactories(factories) {
+  var factoriesByName = {};
+  factories.forEach(factory => {
+    factoriesByName[factory.fn] = factory;
+  });
+
+  function containsDependency(factory, dependency) {
+    // TODO: detect circular references
+    if (isFactory(factory)) {
+      if (contains(factory.dependencies, dependency.fn || dependency.name)) {
+        return true;
+      }
+
+      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {
+        return true;
+      }
+    }
+
+    return false;
+  }
+
+  var sorted = [];
+
+  function addFactory(factory) {
+    var index = 0;
+
+    while (index < sorted.length && !containsDependency(sorted[index], factory)) {
+      index++;
+    }
+
+    sorted.splice(index, 0, factory);
+  } // sort regular factory functions
+
+
+  factories.filter(isFactory).forEach(addFactory); // sort legacy factory functions AFTER the regular factory functions
+
+  factories.filter(factory => !isFactory(factory)).forEach(addFactory);
+  return sorted;
+} // TODO: comment or cleanup if unused in the end
+
+export function create(factories) {
+  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  sortFactories(factories).forEach(factory => factory(scope));
+  return scope;
+}
+/**
+ * Test whether an object is a factory. This is the case when it has
+ * properties name, dependencies, and a function create.
+ * @param {*} obj
+ * @returns {boolean}
+ */
+
+export function isFactory(obj) {
+  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);
+}
+/**
+ * Assert that all dependencies of a list with dependencies are available in the provided scope.
+ *
+ * Will throw an exception when there are dependencies missing.
+ *
+ * @param {string} name   Name for the function to be created. Used to generate a useful error message
+ * @param {string[]} dependencies
+ * @param {Object} scope
+ */
+
+export function assertDependencies(name, dependencies, scope) {
+  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals
+  .every(dependency => scope[dependency] !== undefined);
+
+  if (!allDefined) {
+    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined); // TODO: create a custom error class for this, a MathjsError or something like that
+
+    throw new Error("Cannot create function \"".concat(name, "\", ") + "some dependencies are missing: ".concat(missingDependencies.map(d => "\"".concat(d, "\"")).join(', '), "."));
+  }
+}
+export function isOptionalDependency(dependency) {
+  return dependency && dependency[0] === '?';
+}
+export function stripOptionalNotation(dependency) {
+  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/function.js b/node_modules/mathjs/lib/esm/utils/function.js
new file mode 100644
index 0000000..b90319a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/function.js
@@ -0,0 +1,108 @@
+// function utils
+import { lruQueue } from './lruQueue.js';
+/**
+ * Memoize a given function by caching the computed result.
+ * The cache of a memoized function can be cleared by deleting the `cache`
+ * property of the function.
+ *
+ * @param {function} fn                     The function to be memoized.
+ *                                          Must be a pure function.
+ * @param {Object} [options]
+ * @param {function(args: Array): string} [options.hasher]
+ *    A custom hash builder. Is JSON.stringify by default.
+ * @param {number | undefined} [options.limit]
+ *    Maximum number of values that may be cached. Undefined indicates
+ *    unlimited (default)
+ * @return {function}                       Returns the memoized function
+ */
+
+export function memoize(fn) {
+  var {
+    hasher,
+    limit
+  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  limit = limit == null ? Number.POSITIVE_INFINITY : limit;
+  hasher = hasher == null ? JSON.stringify : hasher;
+  return function memoize() {
+    if (typeof memoize.cache !== 'object') {
+      memoize.cache = {
+        values: new Map(),
+        lru: lruQueue(limit || Number.POSITIVE_INFINITY)
+      };
+    }
+
+    var args = [];
+
+    for (var i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+
+    var hash = hasher(args);
+
+    if (memoize.cache.values.has(hash)) {
+      memoize.cache.lru.hit(hash);
+      return memoize.cache.values.get(hash);
+    }
+
+    var newVal = fn.apply(fn, args);
+    memoize.cache.values.set(hash, newVal);
+    memoize.cache.values.delete(memoize.cache.lru.hit(hash));
+    return newVal;
+  };
+}
+/**
+ * Memoize a given function by caching all results and the arguments,
+ * and comparing against the arguments of previous results before
+ * executing again.
+ * This is less performant than `memoize` which calculates a hash,
+ * which is very fast to compare. Use `memoizeCompare` only when it is
+ * not possible to create a unique serializable hash from the function
+ * arguments.
+ * The isEqual function must compare two sets of arguments
+ * and return true when equal (can be a deep equality check for example).
+ * @param {function} fn
+ * @param {function(a: *, b: *) : boolean} isEqual
+ * @returns {function}
+ */
+
+export function memoizeCompare(fn, isEqual) {
+  var memoize = function memoize() {
+    var args = [];
+
+    for (var i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+
+    for (var c = 0; c < memoize.cache.length; c++) {
+      var cached = memoize.cache[c];
+
+      if (isEqual(args, cached.args)) {
+        // TODO: move this cache entry to the top so recently used entries move up?
+        return cached.res;
+      }
+    }
+
+    var res = fn.apply(fn, args);
+    memoize.cache.unshift({
+      args,
+      res
+    });
+    return res;
+  };
+
+  memoize.cache = [];
+  return memoize;
+}
+/**
+ * Find the maximum number of arguments expected by a typed function.
+ * @param {function} fn   A typed function
+ * @return {number} Returns the maximum number of expected arguments.
+ *                  Returns -1 when no signatures where found on the function.
+ */
+
+export function maxArgumentCount(fn) {
+  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {
+    var count = (signature.match(/,/g) || []).length + 1;
+    return Math.max(args, count);
+  }, -1);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/is.js b/node_modules/mathjs/lib/esm/utils/is.js
new file mode 100644
index 0000000..8fb1f0a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/is.js
@@ -0,0 +1,170 @@
+// type checks for all known types
+//
+// note that:
+//
+// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.
+//   instanceof cannot be used because that would not allow to pass data from
+//   one instance of math.js to another since each has it's own instance of Unit.
+// - check the `isUnit` property via the constructor, so there will be no
+//   matches for "fake" instances like plain objects with a property `isUnit`.
+//   That is important for security reasons.
+// - It must not be possible to override the type checks used internally,
+//   for security reasons, so these functions are not exposed in the expression
+//   parser.
+export function isNumber(x) {
+  return typeof x === 'number';
+}
+export function isBigNumber(x) {
+  if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {
+    return false;
+  }
+
+  if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {
+    return true;
+  }
+
+  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {
+    return true;
+  }
+
+  return false;
+}
+export function isComplex(x) {
+  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;
+}
+export function isFraction(x) {
+  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;
+}
+export function isUnit(x) {
+  return x && x.constructor.prototype.isUnit === true || false;
+}
+export function isString(x) {
+  return typeof x === 'string';
+}
+export var isArray = Array.isArray;
+export function isMatrix(x) {
+  return x && x.constructor.prototype.isMatrix === true || false;
+}
+/**
+ * Test whether a value is a collection: an Array or Matrix
+ * @param {*} x
+ * @returns {boolean} isCollection
+ */
+
+export function isCollection(x) {
+  return Array.isArray(x) || isMatrix(x);
+}
+export function isDenseMatrix(x) {
+  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+export function isSparseMatrix(x) {
+  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+export function isRange(x) {
+  return x && x.constructor.prototype.isRange === true || false;
+}
+export function isIndex(x) {
+  return x && x.constructor.prototype.isIndex === true || false;
+}
+export function isBoolean(x) {
+  return typeof x === 'boolean';
+}
+export function isResultSet(x) {
+  return x && x.constructor.prototype.isResultSet === true || false;
+}
+export function isHelp(x) {
+  return x && x.constructor.prototype.isHelp === true || false;
+}
+export function isFunction(x) {
+  return typeof x === 'function';
+}
+export function isDate(x) {
+  return x instanceof Date;
+}
+export function isRegExp(x) {
+  return x instanceof RegExp;
+}
+export function isObject(x) {
+  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));
+}
+export function isNull(x) {
+  return x === null;
+}
+export function isUndefined(x) {
+  return x === undefined;
+}
+export function isAccessorNode(x) {
+  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isArrayNode(x) {
+  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isAssignmentNode(x) {
+  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isBlockNode(x) {
+  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isConditionalNode(x) {
+  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isConstantNode(x) {
+  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isFunctionAssignmentNode(x) {
+  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isFunctionNode(x) {
+  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isIndexNode(x) {
+  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isNode(x) {
+  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isObjectNode(x) {
+  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isOperatorNode(x) {
+  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isParenthesisNode(x) {
+  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isRangeNode(x) {
+  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isSymbolNode(x) {
+  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isChain(x) {
+  return x && x.constructor.prototype.isChain === true || false;
+}
+export function typeOf(x) {
+  var t = typeof x;
+
+  if (t === 'object') {
+    // JavaScript types
+    if (x === null) return 'null';
+    if (Array.isArray(x)) return 'Array';
+    if (x instanceof Date) return 'Date';
+    if (x instanceof RegExp) return 'RegExp'; // math.js types
+
+    if (isBigNumber(x)) return 'BigNumber';
+    if (isComplex(x)) return 'Complex';
+    if (isFraction(x)) return 'Fraction';
+    if (isMatrix(x)) return 'Matrix';
+    if (isUnit(x)) return 'Unit';
+    if (isIndex(x)) return 'Index';
+    if (isRange(x)) return 'Range';
+    if (isResultSet(x)) return 'ResultSet';
+    if (isNode(x)) return x.type;
+    if (isChain(x)) return 'Chain';
+    if (isHelp(x)) return 'Help';
+    return 'Object';
+  }
+
+  if (t === 'function') return 'Function';
+  return t; // can be 'string', 'number', 'boolean', ...
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/latex.js b/node_modules/mathjs/lib/esm/utils/latex.js
new file mode 100644
index 0000000..e4f40f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/latex.js
@@ -0,0 +1,481 @@
+/* eslint no-template-curly-in-string: "off" */
+import escapeLatexLib from 'escape-latex';
+import { hasOwnProperty } from './object.js';
+export var latexSymbols = {
+  // GREEK LETTERS
+  Alpha: 'A',
+  alpha: '\\alpha',
+  Beta: 'B',
+  beta: '\\beta',
+  Gamma: '\\Gamma',
+  gamma: '\\gamma',
+  Delta: '\\Delta',
+  delta: '\\delta',
+  Epsilon: 'E',
+  epsilon: '\\epsilon',
+  varepsilon: '\\varepsilon',
+  Zeta: 'Z',
+  zeta: '\\zeta',
+  Eta: 'H',
+  eta: '\\eta',
+  Theta: '\\Theta',
+  theta: '\\theta',
+  vartheta: '\\vartheta',
+  Iota: 'I',
+  iota: '\\iota',
+  Kappa: 'K',
+  kappa: '\\kappa',
+  varkappa: '\\varkappa',
+  Lambda: '\\Lambda',
+  lambda: '\\lambda',
+  Mu: 'M',
+  mu: '\\mu',
+  Nu: 'N',
+  nu: '\\nu',
+  Xi: '\\Xi',
+  xi: '\\xi',
+  Omicron: 'O',
+  omicron: 'o',
+  Pi: '\\Pi',
+  pi: '\\pi',
+  varpi: '\\varpi',
+  Rho: 'P',
+  rho: '\\rho',
+  varrho: '\\varrho',
+  Sigma: '\\Sigma',
+  sigma: '\\sigma',
+  varsigma: '\\varsigma',
+  Tau: 'T',
+  tau: '\\tau',
+  Upsilon: '\\Upsilon',
+  upsilon: '\\upsilon',
+  Phi: '\\Phi',
+  phi: '\\phi',
+  varphi: '\\varphi',
+  Chi: 'X',
+  chi: '\\chi',
+  Psi: '\\Psi',
+  psi: '\\psi',
+  Omega: '\\Omega',
+  omega: '\\omega',
+  // logic
+  true: '\\mathrm{True}',
+  false: '\\mathrm{False}',
+  // other
+  i: 'i',
+  // TODO use \i ??
+  inf: '\\infty',
+  Inf: '\\infty',
+  infinity: '\\infty',
+  Infinity: '\\infty',
+  oo: '\\infty',
+  lim: '\\lim',
+  undefined: '\\mathbf{?}'
+};
+export var latexOperators = {
+  transpose: '^\\top',
+  ctranspose: '^H',
+  factorial: '!',
+  pow: '^',
+  dotPow: '.^\\wedge',
+  // TODO find ideal solution
+  unaryPlus: '+',
+  unaryMinus: '-',
+  bitNot: '\\~',
+  // TODO find ideal solution
+  not: '\\neg',
+  multiply: '\\cdot',
+  divide: '\\frac',
+  // TODO how to handle that properly?
+  dotMultiply: '.\\cdot',
+  // TODO find ideal solution
+  dotDivide: '.:',
+  // TODO find ideal solution
+  mod: '\\mod',
+  add: '+',
+  subtract: '-',
+  to: '\\rightarrow',
+  leftShift: '<<',
+  rightArithShift: '>>',
+  rightLogShift: '>>>',
+  equal: '=',
+  unequal: '\\neq',
+  smaller: '<',
+  larger: '>',
+  smallerEq: '\\leq',
+  largerEq: '\\geq',
+  bitAnd: '\\&',
+  bitXor: '\\underline{|}',
+  bitOr: '|',
+  and: '\\wedge',
+  xor: '\\veebar',
+  or: '\\vee'
+};
+export var latexFunctions = {
+  // arithmetic
+  abs: {
+    1: '\\left|${args[0]}\\right|'
+  },
+  add: {
+    2: "\\left(${args[0]}".concat(latexOperators.add, "${args[1]}\\right)")
+  },
+  cbrt: {
+    1: '\\sqrt[3]{${args[0]}}'
+  },
+  ceil: {
+    1: '\\left\\lceil${args[0]}\\right\\rceil'
+  },
+  cube: {
+    1: '\\left(${args[0]}\\right)^3'
+  },
+  divide: {
+    2: '\\frac{${args[0]}}{${args[1]}}'
+  },
+  dotDivide: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotDivide, "${args[1]}\\right)")
+  },
+  dotMultiply: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotMultiply, "${args[1]}\\right)")
+  },
+  dotPow: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotPow, "${args[1]}\\right)")
+  },
+  exp: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  expm1: "\\left(e".concat(latexOperators.pow, "{${args[0]}}-1\\right)"),
+  fix: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  floor: {
+    1: '\\left\\lfloor${args[0]}\\right\\rfloor'
+  },
+  gcd: '\\gcd\\left(${args}\\right)',
+  hypot: '\\hypot\\left(${args}\\right)',
+  log: {
+    1: '\\ln\\left(${args[0]}\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}\\right)'
+  },
+  log10: {
+    1: '\\log_{10}\\left(${args[0]}\\right)'
+  },
+  log1p: {
+    1: '\\ln\\left(${args[0]}+1\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}+1\\right)'
+  },
+  log2: '\\log_{2}\\left(${args[0]}\\right)',
+  mod: {
+    2: "\\left(${args[0]}".concat(latexOperators.mod, "${args[1]}\\right)")
+  },
+  multiply: {
+    2: "\\left(${args[0]}".concat(latexOperators.multiply, "${args[1]}\\right)")
+  },
+  norm: {
+    1: '\\left\\|${args[0]}\\right\\|',
+    2: undefined // use default template
+
+  },
+  nthRoot: {
+    2: '\\sqrt[${args[1]}]{${args[0]}}'
+  },
+  nthRoots: {
+    2: '\\{y : $y^{args[1]} = {${args[0]}}\\}'
+  },
+  pow: {
+    2: "\\left(${args[0]}\\right)".concat(latexOperators.pow, "{${args[1]}}")
+  },
+  round: {
+    1: '\\left\\lfloor${args[0]}\\right\\rceil',
+    2: undefined // use default template
+
+  },
+  sign: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  sqrt: {
+    1: '\\sqrt{${args[0]}}'
+  },
+  square: {
+    1: '\\left(${args[0]}\\right)^2'
+  },
+  subtract: {
+    2: "\\left(${args[0]}".concat(latexOperators.subtract, "${args[1]}\\right)")
+  },
+  unaryMinus: {
+    1: "".concat(latexOperators.unaryMinus, "\\left(${args[0]}\\right)")
+  },
+  unaryPlus: {
+    1: "".concat(latexOperators.unaryPlus, "\\left(${args[0]}\\right)")
+  },
+  // bitwise
+  bitAnd: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitAnd, "${args[1]}\\right)")
+  },
+  bitNot: {
+    1: latexOperators.bitNot + '\\left(${args[0]}\\right)'
+  },
+  bitOr: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitOr, "${args[1]}\\right)")
+  },
+  bitXor: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitXor, "${args[1]}\\right)")
+  },
+  leftShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.leftShift, "${args[1]}\\right)")
+  },
+  rightArithShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.rightArithShift, "${args[1]}\\right)")
+  },
+  rightLogShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.rightLogShift, "${args[1]}\\right)")
+  },
+  // combinatorics
+  bellNumbers: {
+    1: '\\mathrm{B}_{${args[0]}}'
+  },
+  catalan: {
+    1: '\\mathrm{C}_{${args[0]}}'
+  },
+  stirlingS2: {
+    2: '\\mathrm{S}\\left(${args}\\right)'
+  },
+  // complex
+  arg: {
+    1: '\\arg\\left(${args[0]}\\right)'
+  },
+  conj: {
+    1: '\\left(${args[0]}\\right)^*'
+  },
+  im: {
+    1: '\\Im\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  re: {
+    1: '\\Re\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  // logical
+  and: {
+    2: "\\left(${args[0]}".concat(latexOperators.and, "${args[1]}\\right)")
+  },
+  not: {
+    1: latexOperators.not + '\\left(${args[0]}\\right)'
+  },
+  or: {
+    2: "\\left(${args[0]}".concat(latexOperators.or, "${args[1]}\\right)")
+  },
+  xor: {
+    2: "\\left(${args[0]}".concat(latexOperators.xor, "${args[1]}\\right)")
+  },
+  // matrix
+  cross: {
+    2: '\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)'
+  },
+  ctranspose: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.ctranspose)
+  },
+  det: {
+    1: '\\det\\left(${args[0]}\\right)'
+  },
+  dot: {
+    2: '\\left(${args[0]}\\cdot${args[1]}\\right)'
+  },
+  expm: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  inv: {
+    1: '\\left(${args[0]}\\right)^{-1}'
+  },
+  sqrtm: {
+    1: "{${args[0]}}".concat(latexOperators.pow, "{\\frac{1}{2}}")
+  },
+  trace: {
+    1: '\\mathrm{tr}\\left(${args[0]}\\right)'
+  },
+  transpose: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.transpose)
+  },
+  // probability
+  combinations: {
+    2: '\\binom{${args[0]}}{${args[1]}}'
+  },
+  combinationsWithRep: {
+    2: '\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)'
+  },
+  factorial: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.factorial)
+  },
+  gamma: {
+    1: '\\Gamma\\left(${args[0]}\\right)'
+  },
+  // relational
+  equal: {
+    2: "\\left(${args[0]}".concat(latexOperators.equal, "${args[1]}\\right)")
+  },
+  larger: {
+    2: "\\left(${args[0]}".concat(latexOperators.larger, "${args[1]}\\right)")
+  },
+  largerEq: {
+    2: "\\left(${args[0]}".concat(latexOperators.largerEq, "${args[1]}\\right)")
+  },
+  smaller: {
+    2: "\\left(${args[0]}".concat(latexOperators.smaller, "${args[1]}\\right)")
+  },
+  smallerEq: {
+    2: "\\left(${args[0]}".concat(latexOperators.smallerEq, "${args[1]}\\right)")
+  },
+  unequal: {
+    2: "\\left(${args[0]}".concat(latexOperators.unequal, "${args[1]}\\right)")
+  },
+  // special
+  erf: {
+    1: 'erf\\left(${args[0]}\\right)'
+  },
+  // statistics
+  max: '\\max\\left(${args}\\right)',
+  min: '\\min\\left(${args}\\right)',
+  variance: '\\mathrm{Var}\\left(${args}\\right)',
+  // trigonometry
+  acos: {
+    1: '\\cos^{-1}\\left(${args[0]}\\right)'
+  },
+  acosh: {
+    1: '\\cosh^{-1}\\left(${args[0]}\\right)'
+  },
+  acot: {
+    1: '\\cot^{-1}\\left(${args[0]}\\right)'
+  },
+  acoth: {
+    1: '\\coth^{-1}\\left(${args[0]}\\right)'
+  },
+  acsc: {
+    1: '\\csc^{-1}\\left(${args[0]}\\right)'
+  },
+  acsch: {
+    1: '\\mathrm{csch}^{-1}\\left(${args[0]}\\right)'
+  },
+  asec: {
+    1: '\\sec^{-1}\\left(${args[0]}\\right)'
+  },
+  asech: {
+    1: '\\mathrm{sech}^{-1}\\left(${args[0]}\\right)'
+  },
+  asin: {
+    1: '\\sin^{-1}\\left(${args[0]}\\right)'
+  },
+  asinh: {
+    1: '\\sinh^{-1}\\left(${args[0]}\\right)'
+  },
+  atan: {
+    1: '\\tan^{-1}\\left(${args[0]}\\right)'
+  },
+  atan2: {
+    2: '\\mathrm{atan2}\\left(${args}\\right)'
+  },
+  atanh: {
+    1: '\\tanh^{-1}\\left(${args[0]}\\right)'
+  },
+  cos: {
+    1: '\\cos\\left(${args[0]}\\right)'
+  },
+  cosh: {
+    1: '\\cosh\\left(${args[0]}\\right)'
+  },
+  cot: {
+    1: '\\cot\\left(${args[0]}\\right)'
+  },
+  coth: {
+    1: '\\coth\\left(${args[0]}\\right)'
+  },
+  csc: {
+    1: '\\csc\\left(${args[0]}\\right)'
+  },
+  csch: {
+    1: '\\mathrm{csch}\\left(${args[0]}\\right)'
+  },
+  sec: {
+    1: '\\sec\\left(${args[0]}\\right)'
+  },
+  sech: {
+    1: '\\mathrm{sech}\\left(${args[0]}\\right)'
+  },
+  sin: {
+    1: '\\sin\\left(${args[0]}\\right)'
+  },
+  sinh: {
+    1: '\\sinh\\left(${args[0]}\\right)'
+  },
+  tan: {
+    1: '\\tan\\left(${args[0]}\\right)'
+  },
+  tanh: {
+    1: '\\tanh\\left(${args[0]}\\right)'
+  },
+  // unit
+  to: {
+    2: "\\left(${args[0]}".concat(latexOperators.to, "${args[1]}\\right)")
+  },
+  // utils
+  numeric: function numeric(node, options) {
+    // Not sure if this is strictly right but should work correctly for the vast majority of use cases.
+    return node.args[0].toTex();
+  },
+  // type
+  number: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  },
+  string: {
+    0: '\\mathtt{""}',
+    1: '\\mathrm{string}\\left(${args[0]}\\right)'
+  },
+  bignumber: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)'
+  },
+  complex: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: "\\left(\\left(${args[0]}\\right)+".concat(latexSymbols.i, "\\cdot\\left(${args[1]}\\right)\\right)")
+  },
+  matrix: {
+    0: '\\begin{bmatrix}\\end{bmatrix}',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(${args[0]}\\right)'
+  },
+  sparse: {
+    0: '\\begin{bsparse}\\end{bsparse}',
+    1: '\\left(${args[0]}\\right)'
+  },
+  unit: {
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  }
+};
+export var defaultTemplate = '\\mathrm{${name}}\\left(${args}\\right)';
+var latexUnits = {
+  deg: '^\\circ'
+};
+export function escapeLatex(string) {
+  return escapeLatexLib(string, {
+    preserveFormatting: true
+  });
+} // @param {string} name
+// @param {boolean} isUnit
+
+export function toSymbol(name, isUnit) {
+  isUnit = typeof isUnit === 'undefined' ? false : isUnit;
+
+  if (isUnit) {
+    if (hasOwnProperty(latexUnits, name)) {
+      return latexUnits[name];
+    }
+
+    return '\\mathrm{' + escapeLatex(name) + '}';
+  }
+
+  if (hasOwnProperty(latexSymbols, name)) {
+    return latexSymbols[name];
+  }
+
+  return escapeLatex(name);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/log.js b/node_modules/mathjs/lib/esm/utils/log.js
new file mode 100644
index 0000000..7c647c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/log.js
@@ -0,0 +1,18 @@
+/**
+ * Log a console.warn message only once
+ */
+export var warnOnce = (() => {
+  var messages = {};
+  return function warnOnce() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+
+    var message = args.join(', ');
+
+    if (!messages[message]) {
+      messages[message] = true;
+      console.warn('Warning:', ...args);
+    }
+  };
+})();
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/lruQueue.js b/node_modules/mathjs/lib/esm/utils/lruQueue.js
new file mode 100644
index 0000000..84477a3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/lruQueue.js
@@ -0,0 +1,64 @@
+// (c) 2018, Mariusz Nowak
+// SPDX-License-Identifier: ISC
+// Derived from https://github.com/medikoo/lru-queue
+export function lruQueue(limit) {
+  var size = 0;
+  var base = 1;
+  var queue = Object.create(null);
+  var map = Object.create(null);
+  var index = 0;
+
+  var del = function del(id) {
+    var oldIndex = map[id];
+    if (!oldIndex) return;
+    delete queue[oldIndex];
+    delete map[id];
+    --size;
+    if (base !== oldIndex) return;
+
+    if (!size) {
+      index = 0;
+      base = 1;
+      return;
+    }
+
+    while (!hasOwnProperty.call(queue, ++base)) {
+      continue;
+    }
+  };
+
+  limit = Math.abs(limit);
+  return {
+    hit: function hit(id) {
+      var oldIndex = map[id];
+      var nuIndex = ++index;
+      queue[nuIndex] = id;
+      map[id] = nuIndex;
+
+      if (!oldIndex) {
+        ++size;
+        if (size <= limit) return undefined;
+        id = queue[base];
+        del(id);
+        return id;
+      }
+
+      delete queue[oldIndex];
+      if (base !== oldIndex) return undefined;
+
+      while (!hasOwnProperty.call(queue, ++base)) {
+        continue;
+      }
+
+      return undefined;
+    },
+    delete: del,
+    clear: function clear() {
+      size = index = 0;
+      base = 1;
+      queue = Object.create(null);
+      map = Object.create(null);
+    }
+  };
+}
+;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/map.js b/node_modules/mathjs/lib/esm/utils/map.js
new file mode 100644
index 0000000..03bb822
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/map.js
@@ -0,0 +1,135 @@
+import { setSafeProperty, hasSafeProperty, getSafeProperty } from './customs.js';
+import { isObject } from './is.js';
+/**
+ * A map facade on a bare object.
+ *
+ * The small number of methods needed to implement a scope,
+ * forwarding on to the SafeProperty functions. Over time, the codebase
+ * will stop using this method, as all objects will be Maps, rather than
+ * more security prone objects.
+ */
+
+export class ObjectWrappingMap {
+  constructor(object) {
+    this.wrappedObject = object;
+  }
+
+  keys() {
+    return Object.keys(this.wrappedObject);
+  }
+
+  get(key) {
+    return getSafeProperty(this.wrappedObject, key);
+  }
+
+  set(key, value) {
+    setSafeProperty(this.wrappedObject, key, value);
+    return this;
+  }
+
+  has(key) {
+    return hasSafeProperty(this.wrappedObject, key);
+  }
+
+}
+/**
+ * Creates an empty map, or whatever your platform's polyfill is.
+ *
+ * @returns an empty Map or Map like object.
+ */
+
+export function createEmptyMap() {
+  return new Map();
+}
+/**
+ * Creates a Map from the given object.
+ *
+ * @param { Map | { [key: string]: unknown } | undefined } mapOrObject
+ * @returns
+ */
+
+export function createMap(mapOrObject) {
+  if (!mapOrObject) {
+    return createEmptyMap();
+  }
+
+  if (isMap(mapOrObject)) {
+    return mapOrObject;
+  }
+
+  if (isObject(mapOrObject)) {
+    return new ObjectWrappingMap(mapOrObject);
+  }
+
+  throw new Error('createMap can create maps from objects or Maps');
+}
+/**
+ * Unwraps a map into an object.
+ *
+ * @param {Map} map
+ * @returns { [key: string]: unknown }
+ */
+
+export function toObject(map) {
+  if (map instanceof ObjectWrappingMap) {
+    return map.wrappedObject;
+  }
+
+  var object = {};
+
+  for (var key of map.keys()) {
+    var value = map.get(key);
+    setSafeProperty(object, key, value);
+  }
+
+  return object;
+}
+/**
+ * Returns `true` if the passed object appears to be a Map (i.e. duck typing).
+ *
+ * Methods looked for are `get`, `set`, `keys` and `has`.
+ *
+ * @param {Map | object} object
+ * @returns
+ */
+
+export function isMap(object) {
+  // We can use the fast instanceof, or a slower duck typing check.
+  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.
+  if (!object) {
+    return false;
+  }
+
+  return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';
+}
+/**
+ * Copies the contents of key-value pairs from each `objects` in to `map`.
+ *
+ * Object is `objects` can be a `Map` or object.
+ *
+ * This is the `Map` analog to `Object.assign`.
+ */
+
+export function assign(map) {
+  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    objects[_key - 1] = arguments[_key];
+  }
+
+  for (var args of objects) {
+    if (!args) {
+      continue;
+    }
+
+    if (isMap(args)) {
+      for (var key of args.keys()) {
+        map.set(key, args.get(key));
+      }
+    } else if (isObject(args)) {
+      for (var _key2 of Object.keys(args)) {
+        map.set(_key2, args[_key2]);
+      }
+    }
+  }
+
+  return map;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/noop.js b/node_modules/mathjs/lib/esm/utils/noop.js
new file mode 100644
index 0000000..dd6e5d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/noop.js
@@ -0,0 +1,15 @@
+export function noBignumber() {
+  throw new Error('No "bignumber" implementation available');
+}
+export function noFraction() {
+  throw new Error('No "fraction" implementation available');
+}
+export function noMatrix() {
+  throw new Error('No "matrix" implementation available');
+}
+export function noIndex() {
+  throw new Error('No "index" implementation available');
+}
+export function noSubset() {
+  throw new Error('No "matrix" implementation available');
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/number.js b/node_modules/mathjs/lib/esm/utils/number.js
new file mode 100644
index 0000000..8d3c207
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/number.js
@@ -0,0 +1,688 @@
+import { isNumber } from './is.js';
+/**
+ * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue
+ */
+
+/**
+ * Check if a number is integer
+ * @param {number | boolean} value
+ * @return {boolean} isInteger
+ */
+
+export function isInteger(value) {
+  if (typeof value === 'boolean') {
+    return true;
+  }
+
+  return isFinite(value) ? value === Math.round(value) : false;
+}
+/**
+ * Calculate the sign of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+export var sign = /* #__PURE__ */Math.sign || function (x) {
+  if (x > 0) {
+    return 1;
+  } else if (x < 0) {
+    return -1;
+  } else {
+    return 0;
+  }
+};
+/**
+ * Calculate the base-2 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+export var log2 = /* #__PURE__ */Math.log2 || function log2(x) {
+  return Math.log(x) / Math.LN2;
+};
+/**
+ * Calculate the base-10 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+export var log10 = /* #__PURE__ */Math.log10 || function log10(x) {
+  return Math.log(x) / Math.LN10;
+};
+/**
+ * Calculate the natural logarithm of a number + 1
+ * @param {number} x
+ * @returns {number}
+ */
+
+export var log1p = /* #__PURE__ */Math.log1p || function (x) {
+  return Math.log(x + 1);
+};
+/**
+ * Calculate cubic root for a number
+ *
+ * Code from es6-shim.js:
+ *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577
+ *
+ * @param {number} x
+ * @returns {number} Returns the cubic root of x
+ */
+
+export var cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {
+  if (x === 0) {
+    return x;
+  }
+
+  var negate = x < 0;
+  var result;
+
+  if (negate) {
+    x = -x;
+  }
+
+  if (isFinite(x)) {
+    result = Math.exp(Math.log(x) / 3); // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods
+
+    result = (x / (result * result) + 2 * result) / 3;
+  } else {
+    result = x;
+  }
+
+  return negate ? -result : result;
+};
+/**
+ * Calculates exponentiation minus 1
+ * @param {number} x
+ * @return {number} res
+ */
+
+export var expm1 = /* #__PURE__ */Math.expm1 || function expm1(x) {
+  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;
+};
+/**
+ * Formats a number in a given base
+ * @param {number} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+
+function formatNumberToBase(n, base, size) {
+  var prefixes = {
+    2: '0b',
+    8: '0o',
+    16: '0x'
+  };
+  var prefix = prefixes[base];
+  var suffix = '';
+
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+
+    if (!isInteger(size)) {
+      throw new Error('size must be an integer');
+    }
+
+    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {
+      throw new Error("Value must be in range [-2^".concat(size - 1, ", 2^").concat(size - 1, "-1]"));
+    }
+
+    if (!isInteger(n)) {
+      throw new Error('Value must be an integer');
+    }
+
+    if (n < 0) {
+      n = n + 2 ** size;
+    }
+
+    suffix = "i".concat(size);
+  }
+
+  var sign = '';
+
+  if (n < 0) {
+    n = -n;
+    sign = '-';
+  }
+
+  return "".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);
+}
+/**
+ * Convert a number to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'engineering'    Always use engineering notation.
+ *                                          For example '123.4e+0' and '14.0e+6'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lowerExp` and `upperExp` bounds, and
+ *                                          uses exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default,
+ *                                          not rounding any digits.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12.071, {notation: 'fixed'})                // '12'
+ *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'
+ *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'
+ *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'
+ *
+ * @param {number} value
+ * @param {Object | Function | number} [options]
+ * @return {string} str The formatted value
+ */
+
+
+export function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  } // handle special cases
+
+
+  if (value === Infinity) {
+    return 'Infinity';
+  } else if (value === -Infinity) {
+    return '-Infinity';
+  } else if (isNaN(value)) {
+    return 'NaN';
+  } // default values for options
+
+
+  var notation = 'auto';
+  var precision;
+  var wordSize;
+
+  if (options) {
+    // determine notation from options
+    if (options.notation) {
+      notation = options.notation;
+    } // determine precision from options
+
+
+    if (isNumber(options)) {
+      precision = options;
+    } else if (isNumber(options.precision)) {
+      precision = options.precision;
+    }
+
+    if (options.wordSize) {
+      wordSize = options.wordSize;
+
+      if (typeof wordSize !== 'number') {
+        throw new Error('Option "wordSize" must be a number');
+      }
+    }
+  } // handle the various notations
+
+
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+
+    case 'exponential':
+      return toExponential(value, precision);
+
+    case 'engineering':
+      return toEngineering(value, precision);
+
+    case 'bin':
+      return formatNumberToBase(value, 2, wordSize);
+
+    case 'oct':
+      return formatNumberToBase(value, 8, wordSize);
+
+    case 'hex':
+      return formatNumberToBase(value, 16, wordSize);
+
+    case 'auto':
+      // remove trailing zeros after the decimal point
+      return toPrecision(value, precision, options && options).replace(/((\.\d*?)(0+))($|e)/, function () {
+        var digits = arguments[2];
+        var e = arguments[4];
+        return digits !== '.' ? digits + e : e;
+      });
+
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+/**
+ * Split a number into sign, coefficients, and exponent
+ * @param {number | string} value
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ */
+
+export function splitNumber(value) {
+  // parse the input value
+  var match = String(value).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);
+
+  if (!match) {
+    throw new SyntaxError('Invalid number ' + value);
+  }
+
+  var sign = match[1];
+  var digits = match[2];
+  var exponent = parseFloat(match[4] || '0');
+  var dot = digits.indexOf('.');
+  exponent += dot !== -1 ? dot - 1 : digits.length - 1;
+  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)
+  .replace(/^0*/, function (zeros) {
+    // remove leading zeros, add their count to the exponent
+    exponent -= zeros.length;
+    return '';
+  }).replace(/0*$/, '') // remove trailing zeros
+  .split('').map(function (d) {
+    return parseInt(d);
+  });
+
+  if (coefficients.length === 0) {
+    coefficients.push(0);
+    exponent++;
+  }
+
+  return {
+    sign: sign,
+    coefficients: coefficients,
+    exponent: exponent
+  };
+}
+/**
+ * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+
+export function toEngineering(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  var split = splitNumber(value);
+  var rounded = roundDigits(split, precision);
+  var e = rounded.exponent;
+  var c = rounded.coefficients; // find nearest lower multiple of 3 for exponent
+
+  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;
+
+  if (isNumber(precision)) {
+    // add zeroes to give correct sig figs
+    while (precision > c.length || e - newExp + 1 > c.length) {
+      c.push(0);
+    }
+  } else {
+    // concatenate coefficients with necessary zeros
+    // add zeros if necessary (for example: 1e+8 -> 100e+6)
+    var missingZeros = Math.abs(e - newExp) - (c.length - 1);
+
+    for (var i = 0; i < missingZeros; i++) {
+      c.push(0);
+    }
+  } // find difference in exponents
+
+
+  var expDiff = Math.abs(e - newExp);
+  var decimalIdx = 1; // push decimal index over by expDiff times
+
+  while (expDiff > 0) {
+    decimalIdx++;
+    expDiff--;
+  } // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.
+  // otherwise concat with the rest of the coefficients
+
+
+  var decimals = c.slice(decimalIdx).join('');
+  var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';
+  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+  return rounded.sign + str;
+}
+/**
+ * Format a number with fixed notation.
+ * @param {number | string} value
+ * @param {number} [precision=undefined]  Optional number of decimals after the
+ *                                        decimal point. null by default.
+ */
+
+export function toFixed(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  var splitValue = splitNumber(value);
+  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;
+  var c = rounded.coefficients;
+  var p = rounded.exponent + 1; // exponent may have changed
+  // append zeros if needed
+
+  var pp = p + (precision || 0);
+
+  if (c.length < pp) {
+    c = c.concat(zeros(pp - c.length));
+  } // prepend zeros if needed
+
+
+  if (p < 0) {
+    c = zeros(-p + 1).concat(c);
+    p = 1;
+  } // insert a dot if needed
+
+
+  if (p < c.length) {
+    c.splice(p, 0, p === 0 ? '0.' : '.');
+  }
+
+  return rounded.sign + c.join('');
+}
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ */
+
+export function toExponential(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  } // round if needed, else create a clone
+
+
+  var split = splitNumber(value);
+  var rounded = precision ? roundDigits(split, precision) : split;
+  var c = rounded.coefficients;
+  var e = rounded.exponent; // append zeros if needed
+
+  if (c.length < precision) {
+    c = c.concat(zeros(precision - c.length));
+  } // format as `C.CCCe+EEE` or `C.CCCe-EEE`
+
+
+  var first = c.shift();
+  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;
+}
+/**
+ * Format a number with a certain precision
+ * @param {number | string} value
+ * @param {number} [precision=undefined] Optional number of digits.
+ * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]
+ *                                       By default:
+ *                                         lowerExp = -3 (incl)
+ *                                         upper = +5 (excl)
+ * @return {string}
+ */
+
+export function toPrecision(value, precision, options) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  } // determine lower and upper bound for exponential notation.
+
+
+  var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;
+  var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;
+  var split = splitNumber(value);
+  var rounded = precision ? roundDigits(split, precision) : split;
+
+  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {
+    // exponential notation
+    return toExponential(value, precision);
+  } else {
+    var c = rounded.coefficients;
+    var e = rounded.exponent; // append trailing zeros
+
+    if (c.length < precision) {
+      c = c.concat(zeros(precision - c.length));
+    } // append trailing zeros
+    // TODO: simplify the next statement
+
+
+    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0))); // prepend zeros
+
+    c = zeros(-e).concat(c);
+    var dot = e > 0 ? e : 0;
+
+    if (dot < c.length - 1) {
+      c.splice(dot + 1, 0, '.');
+    }
+
+    return rounded.sign + c.join('');
+  }
+}
+/**
+ * Round the number of digits of a number *
+ * @param {SplitValue} split       A value split with .splitNumber(value)
+ * @param {number} precision  A positive integer
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ *              with rounded digits
+ */
+
+export function roundDigits(split, precision) {
+  // create a clone
+  var rounded = {
+    sign: split.sign,
+    coefficients: split.coefficients,
+    exponent: split.exponent
+  };
+  var c = rounded.coefficients; // prepend zeros if needed
+
+  while (precision <= 0) {
+    c.unshift(0);
+    rounded.exponent++;
+    precision++;
+  }
+
+  if (c.length > precision) {
+    var removed = c.splice(precision, c.length - precision);
+
+    if (removed[0] >= 5) {
+      var i = precision - 1;
+      c[i]++;
+
+      while (c[i] === 10) {
+        c.pop();
+
+        if (i === 0) {
+          c.unshift(0);
+          rounded.exponent++;
+          i++;
+        }
+
+        i--;
+        c[i]++;
+      }
+    }
+  }
+
+  return rounded;
+}
+/**
+ * Create an array filled with zeros.
+ * @param {number} length
+ * @return {Array}
+ */
+
+function zeros(length) {
+  var arr = [];
+
+  for (var i = 0; i < length; i++) {
+    arr.push(0);
+  }
+
+  return arr;
+}
+/**
+ * Count the number of significant digits of a number.
+ *
+ * For example:
+ *   2.34 returns 3
+ *   0.0034 returns 2
+ *   120.5e+30 returns 4
+ *
+ * @param {number} value
+ * @return {number} digits   Number of significant digits
+ */
+
+
+export function digits(value) {
+  return value.toExponential().replace(/e.*$/, '') // remove exponential notation
+  .replace(/^0\.?0*|\./, '') // remove decimal point and leading zeros
+  .length;
+}
+/**
+ * Minimum number added to one that makes the result different than one
+ */
+
+export var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;
+/**
+ * Compares two floating point numbers.
+ * @param {number} x          First value to compare
+ * @param {number} y          Second value to compare
+ * @param {number} [epsilon]  The maximum relative difference between x and y
+ *                            If epsilon is undefined or null, the function will
+ *                            test whether x and y are exactly equal.
+ * @return {boolean} whether the two numbers are nearly equal
+*/
+
+export function nearlyEqual(x, y, epsilon) {
+  // if epsilon is null or undefined, test whether x and y are exactly equal
+  if (epsilon === null || epsilon === undefined) {
+    return x === y;
+  }
+
+  if (x === y) {
+    return true;
+  } // NaN
+
+
+  if (isNaN(x) || isNaN(y)) {
+    return false;
+  } // at this point x and y should be finite
+
+
+  if (isFinite(x) && isFinite(y)) {
+    // check numbers are very close, needed when comparing numbers near zero
+    var diff = Math.abs(x - y);
+
+    if (diff < DBL_EPSILON) {
+      return true;
+    } else {
+      // use relative error
+      return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon;
+    }
+  } // Infinite and Number or negative Infinite and positive Infinite cases
+
+
+  return false;
+}
+/**
+ * Calculate the hyperbolic arccos of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+export var acosh = Math.acosh || function (x) {
+  return Math.log(Math.sqrt(x * x - 1) + x);
+};
+export var asinh = Math.asinh || function (x) {
+  return Math.log(Math.sqrt(x * x + 1) + x);
+};
+/**
+ * Calculate the hyperbolic arctangent of a number
+ * @param {number} x
+ * @return {number}
+ */
+
+export var atanh = Math.atanh || function (x) {
+  return Math.log((1 + x) / (1 - x)) / 2;
+};
+/**
+ * Calculate the hyperbolic cosine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+export var cosh = Math.cosh || function (x) {
+  return (Math.exp(x) + Math.exp(-x)) / 2;
+};
+/**
+ * Calculate the hyperbolic sine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+export var sinh = Math.sinh || function (x) {
+  return (Math.exp(x) - Math.exp(-x)) / 2;
+};
+/**
+ * Calculate the hyperbolic tangent of a number
+ * @param {number} x
+ * @returns {number}
+ */
+
+export var tanh = Math.tanh || function (x) {
+  var e = Math.exp(2 * x);
+  return (e - 1) / (e + 1);
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/object.js b/node_modules/mathjs/lib/esm/utils/object.js
new file mode 100644
index 0000000..14e1fa8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/object.js
@@ -0,0 +1,411 @@
+import { isBigNumber } from './is.js';
+/**
+ * Clone an object
+ *
+ *     clone(x)
+ *
+ * Can clone any primitive type, array, and object.
+ * If x has a function clone, this function will be invoked to clone the object.
+ *
+ * @param {*} x
+ * @return {*} clone
+ */
+
+export function clone(x) {
+  var type = typeof x; // immutable primitive types
+
+  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {
+    return x;
+  } // use clone function of the object when available
+
+
+  if (typeof x.clone === 'function') {
+    return x.clone();
+  } // array
+
+
+  if (Array.isArray(x)) {
+    return x.map(function (value) {
+      return clone(value);
+    });
+  }
+
+  if (x instanceof Date) return new Date(x.valueOf());
+  if (isBigNumber(x)) return x; // bignumbers are immutable
+
+  if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp
+  // object
+
+  return mapObject(x, clone);
+}
+/**
+ * Apply map to all properties of an object
+ * @param {Object} object
+ * @param {function} callback
+ * @return {Object} Returns a copy of the object with mapped properties
+ */
+
+export function mapObject(object, callback) {
+  var clone = {};
+
+  for (var key in object) {
+    if (hasOwnProperty(object, key)) {
+      clone[key] = callback(object[key]);
+    }
+  }
+
+  return clone;
+}
+/**
+ * Extend object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @return {Object} a
+ */
+
+export function extend(a, b) {
+  for (var prop in b) {
+    if (hasOwnProperty(b, prop)) {
+      a[prop] = b[prop];
+    }
+  }
+
+  return a;
+}
+/**
+ * Deep extend an object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @returns {Object}
+ */
+
+export function deepExtend(a, b) {
+  // TODO: add support for Arrays to deepExtend
+  if (Array.isArray(b)) {
+    throw new TypeError('Arrays are not supported by deepExtend');
+  }
+
+  for (var prop in b) {
+    // We check against prop not being in Object.prototype or Function.prototype
+    // to prevent polluting for example Object.__proto__.
+    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {
+      if (b[prop] && b[prop].constructor === Object) {
+        if (a[prop] === undefined) {
+          a[prop] = {};
+        }
+
+        if (a[prop] && a[prop].constructor === Object) {
+          deepExtend(a[prop], b[prop]);
+        } else {
+          a[prop] = b[prop];
+        }
+      } else if (Array.isArray(b[prop])) {
+        throw new TypeError('Arrays are not supported by deepExtend');
+      } else {
+        a[prop] = b[prop];
+      }
+    }
+  }
+
+  return a;
+}
+/**
+ * Deep test equality of all fields in two pairs of arrays or objects.
+ * Compares values and functions strictly (ie. 2 is not the same as '2').
+ * @param {Array | Object} a
+ * @param {Array | Object} b
+ * @returns {boolean}
+ */
+
+export function deepStrictEqual(a, b) {
+  var prop, i, len;
+
+  if (Array.isArray(a)) {
+    if (!Array.isArray(b)) {
+      return false;
+    }
+
+    if (a.length !== b.length) {
+      return false;
+    }
+
+    for (i = 0, len = a.length; i < len; i++) {
+      if (!deepStrictEqual(a[i], b[i])) {
+        return false;
+      }
+    }
+
+    return true;
+  } else if (typeof a === 'function') {
+    return a === b;
+  } else if (a instanceof Object) {
+    if (Array.isArray(b) || !(b instanceof Object)) {
+      return false;
+    }
+
+    for (prop in a) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {
+        return false;
+      }
+    }
+
+    for (prop in b) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in a)) {
+        return false;
+      }
+    }
+
+    return true;
+  } else {
+    return a === b;
+  }
+}
+/**
+ * Recursively flatten a nested object.
+ * @param {Object} nestedObject
+ * @return {Object} Returns the flattened object
+ */
+
+export function deepFlatten(nestedObject) {
+  var flattenedObject = {};
+
+  _deepFlatten(nestedObject, flattenedObject);
+
+  return flattenedObject;
+} // helper function used by deepFlatten
+
+function _deepFlatten(nestedObject, flattenedObject) {
+  for (var prop in nestedObject) {
+    if (hasOwnProperty(nestedObject, prop)) {
+      var value = nestedObject[prop];
+
+      if (typeof value === 'object' && value !== null) {
+        _deepFlatten(value, flattenedObject);
+      } else {
+        flattenedObject[prop] = value;
+      }
+    }
+  }
+}
+/**
+ * Test whether the current JavaScript engine supports Object.defineProperty
+ * @returns {boolean} returns true if supported
+ */
+
+
+export function canDefineProperty() {
+  // test needed for broken IE8 implementation
+  try {
+    if (Object.defineProperty) {
+      Object.defineProperty({}, 'x', {
+        get: function get() {}
+      });
+      return true;
+    }
+  } catch (e) {}
+
+  return false;
+}
+/**
+ * Attach a lazy loading property to a constant.
+ * The given function `fn` is called once when the property is first requested.
+ *
+ * @param {Object} object         Object where to add the property
+ * @param {string} prop           Property name
+ * @param {Function} valueResolver Function returning the property value. Called
+ *                                without arguments.
+ */
+
+export function lazy(object, prop, valueResolver) {
+  var _uninitialized = true;
+
+  var _value;
+
+  Object.defineProperty(object, prop, {
+    get: function get() {
+      if (_uninitialized) {
+        _value = valueResolver();
+        _uninitialized = false;
+      }
+
+      return _value;
+    },
+    set: function set(value) {
+      _value = value;
+      _uninitialized = false;
+    },
+    configurable: true,
+    enumerable: true
+  });
+}
+/**
+ * Traverse a path into an object.
+ * When a namespace is missing, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path   A dot separated string like 'name.space'
+ * @return {Object} Returns the object at the end of the path
+ */
+
+export function traverse(object, path) {
+  if (path && typeof path === 'string') {
+    return traverse(object, path.split('.'));
+  }
+
+  var obj = object;
+
+  if (path) {
+    for (var i = 0; i < path.length; i++) {
+      var key = path[i];
+
+      if (!(key in obj)) {
+        obj[key] = {};
+      }
+
+      obj = obj[key];
+    }
+  }
+
+  return obj;
+}
+/**
+ * A safe hasOwnProperty
+ * @param {Object} object
+ * @param {string} property
+ */
+
+export function hasOwnProperty(object, property) {
+  return object && Object.hasOwnProperty.call(object, property);
+}
+/**
+ * Test whether an object is a factory. a factory has fields:
+ *
+ * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)
+ * - name: string (optional)
+ * - path: string    A dot separated path (optional)
+ * - math: boolean   If true (false by default), the math namespace is passed
+ *                   as fifth argument of the factory function
+ *
+ * @param {*} object
+ * @returns {boolean}
+ */
+
+export function isLegacyFactory(object) {
+  return object && typeof object.factory === 'function';
+}
+/**
+ * Get a nested property from an object
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @returns {Object}
+ */
+
+export function get(object, path) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return get(object, path.split('.'));
+    } else {
+      return object[path];
+    }
+  }
+
+  var child = object;
+
+  for (var i = 0; i < path.length; i++) {
+    var key = path[i];
+    child = child ? child[key] : undefined;
+  }
+
+  return child;
+}
+/**
+ * Set a nested property in an object
+ * Mutates the object itself
+ * If the path doesn't exist, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @param {*} value
+ * @returns {Object}
+ */
+
+export function set(object, path, value) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return set(object, path.split('.'), value);
+    } else {
+      object[path] = value;
+      return object;
+    }
+  }
+
+  var child = object;
+
+  for (var i = 0; i < path.length - 1; i++) {
+    var key = path[i];
+
+    if (child[key] === undefined) {
+      child[key] = {};
+    }
+
+    child = child[key];
+  }
+
+  if (path.length > 0) {
+    var lastKey = path[path.length - 1];
+    child[lastKey] = value;
+  }
+
+  return object;
+}
+/**
+ * Create an object composed of the picked object properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @param {function} [transform] Optional value to transform a value when picking it
+ * @return {Object}
+ */
+
+export function pick(object, properties, transform) {
+  var copy = {};
+
+  for (var i = 0; i < properties.length; i++) {
+    var key = properties[i];
+    var value = get(object, key);
+
+    if (value !== undefined) {
+      set(copy, key, transform ? transform(value, key) : value);
+    }
+  }
+
+  return copy;
+}
+/**
+ * Shallow version of pick, creating an object composed of the picked object properties
+ * but not for nested properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @return {Object}
+ */
+
+export function pickShallow(object, properties) {
+  var copy = {};
+
+  for (var i = 0; i < properties.length; i++) {
+    var key = properties[i];
+    var value = object[key];
+
+    if (value !== undefined) {
+      copy[key] = value;
+    }
+  }
+
+  return copy;
+}
+export function values(object) {
+  return Object.keys(object).map(key => object[key]);
+} // helper function to test whether a string contains a path like 'user.name'
+
+function isPath(str) {
+  return str.indexOf('.') !== -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/polyfills.js b/node_modules/mathjs/lib/esm/utils/polyfills.js
new file mode 100644
index 0000000..43ef798
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/polyfills.js
@@ -0,0 +1,12 @@
+// TODO: remove these polyfills as soon as we have a build process that transpiles the code to ES5
+// Polyfill for IE 11 (Number.isFinite is used in `complex.js`)
+// source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/isFinite
+Number.isFinite = Number.isFinite || function (value) {
+  return typeof value === 'number' && isFinite(value);
+}; // Polyfill for IE 11
+// source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/isNaN
+
+
+Number.isNaN = Number.isNaN || function (value) {
+  return value !== value; // eslint-disable-line no-self-compare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/product.js b/node_modules/mathjs/lib/esm/utils/product.js
new file mode 100644
index 0000000..0ec18ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/product.js
@@ -0,0 +1,17 @@
+/** @param {number} i
+ *  @param {number} n
+ *  @returns {number} product of i to n
+ */
+export function product(i, n) {
+  if (n < i) {
+    return 1;
+  }
+
+  if (n === i) {
+    return n;
+  }
+
+  var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer
+
+  return product(i, half) * product(half + 1, n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/scope.js b/node_modules/mathjs/lib/esm/utils/scope.js
new file mode 100644
index 0000000..8c9de46
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/scope.js
@@ -0,0 +1,26 @@
+import { createEmptyMap, assign } from './map.js';
+/**
+ * Create a new scope which can access the parent scope,
+ * but does not affect it when written. This is suitable for variable definitions
+ * within a block node, or function definition.
+ *
+ * If parent scope has a createSubScope method, it delegates to that. Otherwise,
+ * creates an empty map, and copies the parent scope to it, adding in
+ * the remaining `args`.
+ *
+ * @param {Map} parentScope
+ * @param  {...any} args
+ * @returns {Map}
+ */
+
+export function createSubScope(parentScope) {
+  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    args[_key - 1] = arguments[_key];
+  }
+
+  if (typeof parentScope.createSubScope === 'function') {
+    return assign(parentScope.createSubScope(), ...args);
+  }
+
+  return assign(createEmptyMap(), parentScope, ...args);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/snapshot.js b/node_modules/mathjs/lib/esm/utils/snapshot.js
new file mode 100644
index 0000000..2864855
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/snapshot.js
@@ -0,0 +1,275 @@
+import _extends from "@babel/runtime/helpers/extends";
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+/**
+ * This file contains helper methods to create expected snapshot structures
+ * of both instance and ES6 exports.
+ *
+ * The files are located here and not under /test or /tools so it's transpiled
+ * into ES5 code under /lib and can be used straight by node.js
+ */
+import assert from 'assert';
+import * as allIsFunctions from './is.js';
+import { create } from '../core/create.js';
+import { endsWith } from './string.js';
+export function validateBundle(expectedBundleStructure, bundle) {
+  var originalWarn = console.warn;
+
+  console.warn = function () {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+
+    if (args.join(' ').indexOf('is moved to') !== -1 && args.join(' ').indexOf('Please use the new location instead') !== -1) {
+      // Ignore warnings like:
+      // Warning: math.type.isNumber is moved to math.isNumber in v6.0.0. Please use the new location instead.
+      return;
+    }
+
+    originalWarn.apply(console, args);
+  };
+
+  try {
+    var issues = []; // see whether all expected functions and objects are there
+
+    traverse(expectedBundleStructure, (expectedType, path) => {
+      var actualValue = get(bundle, path);
+      var actualType = validateTypeOf(actualValue);
+      var message = actualType === 'undefined' ? 'Missing entry in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType) : 'Unexpected entry type in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType);
+
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType,
+          expectedType,
+          message
+        });
+        console.warn(message);
+      }
+    }); // see whether there are any functions or objects that shouldn't be there
+
+    traverse(bundle, (actualValue, path) => {
+      var actualType = validateTypeOf(actualValue);
+      var expectedType = get(expectedBundleStructure, path) || 'undefined'; // FIXME: ugly to have these special cases
+
+      if (path.join('.').indexOf('docs.') !== -1) {
+        // ignore the contents of docs
+        return;
+      }
+
+      if (path.join('.').indexOf('all.') !== -1) {
+        // ignore the contents of all dependencies
+        return;
+      }
+
+      var message = expectedType === 'undefined' ? 'Unknown entry in bundle. ' + 'Is there a new function added which is missing in this snapshot test? ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType) : 'Unexpected entry type in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType);
+
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType,
+          expectedType,
+          message
+        });
+        console.warn(message);
+      }
+    }); // assert on the first issue (if any)
+
+    if (issues.length > 0) {
+      var {
+        actualType,
+        expectedType,
+        message
+      } = issues[0];
+      console.warn("".concat(issues.length, " bundle issues found"));
+      assert.strictEqual(actualType, expectedType, message);
+    }
+  } finally {
+    console.warn = originalWarn;
+  }
+}
+/**
+ * Based on an object with factory functions, create the expected
+ * structures for ES6 export and a mathjs instance.
+ * @param {Object} factories
+ * @return {{expectedInstanceStructure: Object, expectedES6Structure: Object}}
+ */
+
+export function createSnapshotFromFactories(factories) {
+  var math = create(factories);
+  var allFactoryFunctions = {};
+  var allFunctionsConstantsClasses = {};
+  var allFunctionsConstants = {};
+  var allTransformFunctions = {};
+  var allDependencyCollections = {};
+  var allClasses = {};
+  var allNodeClasses = {};
+  Object.keys(factories).forEach(factoryName => {
+    var factory = factories[factoryName];
+    var name = factory.fn;
+    var isTransformFunction = factory.meta && factory.meta.isTransformFunction;
+    var isClass = !isLowerCase(name[0]) && validateTypeOf(math[name]) === 'Function';
+    var dependenciesName = factory.fn + (isTransformFunction ? 'Transform' : '') + 'Dependencies';
+    allFactoryFunctions[factoryName] = 'Function';
+    allFunctionsConstantsClasses[name] = validateTypeOf(math[name]);
+    allDependencyCollections[dependenciesName] = 'Object';
+
+    if (isTransformFunction) {
+      allTransformFunctions[name] = 'Function';
+    }
+
+    if (isClass) {
+      if (endsWith(name, 'Node')) {
+        allNodeClasses[name] = 'Function';
+      } else {
+        allClasses[name] = 'Function';
+      }
+    } else {
+      allFunctionsConstants[name] = validateTypeOf(math[name]);
+    }
+  });
+  var embeddedDocs = {};
+  Object.keys(factories).forEach(factoryName => {
+    var factory = factories[factoryName];
+    var name = factory.fn;
+
+    if (isLowerCase(factory.fn[0])) {
+      // ignore class names starting with upper case
+      embeddedDocs[name] = 'Object';
+    }
+  });
+  embeddedDocs = exclude(embeddedDocs, ['equalScalar', 'apply', 'addScalar', 'multiplyScalar', 'print', 'divideScalar', 'parse', 'compile', 'parser', 'chain', 'reviver', 'replacer']);
+  var allTypeChecks = {};
+  Object.keys(allIsFunctions).forEach(name => {
+    if (name.indexOf('is') === 0) {
+      allTypeChecks[name] = 'Function';
+    }
+  });
+  var allErrorClasses = {
+    ArgumentsError: 'Function',
+    DimensionError: 'Function',
+    IndexError: 'Function'
+  };
+
+  var expectedInstanceStructure = _objectSpread(_objectSpread(_objectSpread(_objectSpread({}, allFunctionsConstantsClasses), {}, {
+    on: 'Function',
+    off: 'Function',
+    once: 'Function',
+    emit: 'Function',
+    import: 'Function',
+    config: 'Function',
+    create: 'Function',
+    factory: 'Function'
+  }, allTypeChecks), allErrorClasses), {}, {
+    expression: {
+      transform: _objectSpread({}, allTransformFunctions),
+      mathWithTransform: _objectSpread(_objectSpread({}, exclude(allFunctionsConstants, ['chain'])), {}, {
+        config: 'Function'
+      })
+    }
+  });
+
+  var expectedES6Structure = _objectSpread(_objectSpread(_objectSpread(_objectSpread(_objectSpread(_objectSpread({}, exclude(allFunctionsConstantsClasses, ['E', 'false', 'Infinity', 'NaN', 'null', 'PI', 'true'])), {}, {
+    create: 'Function',
+    config: 'Function',
+    factory: 'Function',
+    _true: 'boolean',
+    _false: 'boolean',
+    _null: 'null',
+    _Infinity: 'number',
+    _NaN: 'number'
+  }, allTypeChecks), allErrorClasses), allDependencyCollections), allFactoryFunctions), {}, {
+    docs: embeddedDocs
+  });
+
+  return {
+    expectedInstanceStructure,
+    expectedES6Structure
+  };
+}
+export function validateTypeOf(x) {
+  if (x && x.type === 'Unit') {
+    return 'Unit';
+  }
+
+  if (x && x.type === 'Complex') {
+    return 'Complex';
+  }
+
+  if (Array.isArray(x)) {
+    return 'Array';
+  }
+
+  if (x === null) {
+    return 'null';
+  }
+
+  if (typeof x === 'function') {
+    return 'Function';
+  }
+
+  if (typeof x === 'object') {
+    return 'Object';
+  }
+
+  return typeof x;
+}
+
+function traverse(obj) {
+  var callback = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : (value, path) => {};
+  var path = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+
+  // FIXME: ugly to have these special cases
+  if (path.length > 0 && path[0].indexOf('Dependencies') !== -1) {
+    // special case for objects holding a collection of dependencies
+    callback(obj, path);
+  } else if (validateTypeOf(obj) === 'Array') {
+    obj.map((item, index) => traverse(item, callback, path.concat(index)));
+  } else if (validateTypeOf(obj) === 'Object') {
+    Object.keys(obj).forEach(key => {
+      // FIXME: ugly to have these special cases
+      // ignore special case of deprecated docs
+      if (key === 'docs' && path.join('.') === 'expression') {
+        return;
+      }
+
+      traverse(obj[key], callback, path.concat(key));
+    });
+  } else {
+    callback(obj, path);
+  }
+}
+
+function get(object, path) {
+  var child = object;
+
+  for (var i = 0; i < path.length; i++) {
+    var key = path[i];
+    child = child ? child[key] : undefined;
+  }
+
+  return child;
+}
+/**
+ * Create a copy of the provided `object` and delete
+ * all properties listed in `excludedProperties`
+ * @param {Object} object
+ * @param {string[]} excludedProperties
+ * @return {Object}
+ */
+
+
+function exclude(object, excludedProperties) {
+  var strippedObject = _extends({}, object);
+
+  excludedProperties.forEach(excludedProperty => {
+    delete strippedObject[excludedProperty];
+  });
+  return strippedObject;
+}
+
+function isLowerCase(text) {
+  return typeof text === 'string' && text.toLowerCase() === text;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/string.js b/node_modules/mathjs/lib/esm/utils/string.js
new file mode 100644
index 0000000..87a2ff6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/string.js
@@ -0,0 +1,220 @@
+import { isBigNumber, isString, typeOf } from './is.js';
+import { format as formatNumber } from './number.js';
+import { format as formatBigNumber } from './bignumber/formatter.js';
+/**
+ * Check if a text ends with a certain string.
+ * @param {string} text
+ * @param {string} search
+ */
+
+export function endsWith(text, search) {
+  var start = text.length - search.length;
+  var end = text.length;
+  return text.substring(start, end) === search;
+}
+/**
+ * Format a value of any type into a string.
+ *
+ * Usage:
+ *     math.format(value)
+ *     math.format(value, precision)
+ *     math.format(value, options)
+ *
+ * When value is a function:
+ *
+ * - When the function has a property `syntax`, it returns this
+ *   syntax description.
+ * - In other cases, a string `'function'` is returned.
+ *
+ * When `value` is an Object:
+ *
+ * - When the object contains a property `format` being a function, this
+ *   function is invoked as `value.format(options)` and the result is returned.
+ * - When the object has its own `toString` method, this method is invoked
+ *   and the result is returned.
+ * - In other cases the function will loop over all object properties and
+ *   return JSON object notation like '{"a": 2, "b": 3}'.
+ *
+ * Example usage:
+ *     math.format(2/7)                // '0.2857142857142857'
+ *     math.format(math.pi, 3)         // '3.14'
+ *     math.format(new Complex(2, 3))  // '2 + 3i'
+ *     math.format('hello')            // '"hello"'
+ *
+ * @param {*} value             Value to be stringified
+ * @param {Object | number | Function} [options]
+ *     Formatting options. See src/utils/number.js:format for a
+ *     description of the available options controlling number output.
+ *     This generic "format" also supports the option property `truncate: NN`
+ *     giving the maximum number NN of characters to return (if there would
+ *     have been more, they are deleted and replaced by an ellipsis).
+ * @return {string} str
+ */
+
+export function format(value, options) {
+  var result = _format(value, options);
+
+  if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {
+    return result.substring(0, options.truncate - 3) + '...';
+  }
+
+  return result;
+}
+
+function _format(value, options) {
+  if (typeof value === 'number') {
+    return formatNumber(value, options);
+  }
+
+  if (isBigNumber(value)) {
+    return formatBigNumber(value, options);
+  } // note: we use unsafe duck-typing here to check for Fractions, this is
+  // ok here since we're only invoking toString or concatenating its values
+
+
+  if (looksLikeFraction(value)) {
+    if (!options || options.fraction !== 'decimal') {
+      // output as ratio, like '1/3'
+      return value.s * value.n + '/' + value.d;
+    } else {
+      // output as decimal, like '0.(3)'
+      return value.toString();
+    }
+  }
+
+  if (Array.isArray(value)) {
+    return formatArray(value, options);
+  }
+
+  if (isString(value)) {
+    return '"' + value + '"';
+  }
+
+  if (typeof value === 'function') {
+    return value.syntax ? String(value.syntax) : 'function';
+  }
+
+  if (value && typeof value === 'object') {
+    if (typeof value.format === 'function') {
+      return value.format(options);
+    } else if (value && value.toString(options) !== {}.toString()) {
+      // this object has a non-native toString method, use that one
+      return value.toString(options);
+    } else {
+      var entries = Object.keys(value).map(key => {
+        return '"' + key + '": ' + format(value[key], options);
+      });
+      return '{' + entries.join(', ') + '}';
+    }
+  }
+
+  return String(value);
+}
+/**
+ * Stringify a value into a string enclosed in double quotes.
+ * Unescaped double quotes and backslashes inside the value are escaped.
+ * @param {*} value
+ * @return {string}
+ */
+
+
+export function stringify(value) {
+  var text = String(value);
+  var escaped = '';
+  var i = 0;
+
+  while (i < text.length) {
+    var c = text.charAt(i);
+
+    if (c === '\\') {
+      escaped += c;
+      i++;
+      c = text.charAt(i);
+
+      if (c === '' || '"\\/bfnrtu'.indexOf(c) === -1) {
+        escaped += '\\'; // no valid escape character -> escape it
+      }
+
+      escaped += c;
+    } else if (c === '"') {
+      escaped += '\\"';
+    } else {
+      escaped += c;
+    }
+
+    i++;
+  }
+
+  return '"' + escaped + '"';
+}
+/**
+ * Escape special HTML characters
+ * @param {*} value
+ * @return {string}
+ */
+
+export function escape(value) {
+  var text = String(value);
+  text = text.replace(/&/g, '&amp;').replace(/"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');
+  return text;
+}
+/**
+ * Recursively format an n-dimensional matrix
+ * Example output: "[[1, 2], [3, 4]]"
+ * @param {Array} array
+ * @param {Object | number | Function} [options]  Formatting options. See
+ *                                                lib/utils/number:format for a
+ *                                                description of the available
+ *                                                options.
+ * @returns {string} str
+ */
+
+function formatArray(array, options) {
+  if (Array.isArray(array)) {
+    var str = '[';
+    var len = array.length;
+
+    for (var i = 0; i < len; i++) {
+      if (i !== 0) {
+        str += ', ';
+      }
+
+      str += formatArray(array[i], options);
+    }
+
+    str += ']';
+    return str;
+  } else {
+    return format(array, options);
+  }
+}
+/**
+ * Check whether a value looks like a Fraction (unsafe duck-type check)
+ * @param {*} value
+ * @return {boolean}
+ */
+
+
+function looksLikeFraction(value) {
+  return value && typeof value === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;
+}
+/**
+ * Compare two strings
+ * @param {string} x
+ * @param {string} y
+ * @returns {number}
+ */
+
+
+export function compareText(x, y) {
+  // we don't want to convert numbers to string, only accept string input
+  if (!isString(x)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');
+  }
+
+  if (!isString(y)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');
+  }
+
+  return x === y ? 0 : x > y ? 1 : -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/switch.js b/node_modules/mathjs/lib/esm/utils/switch.js
new file mode 100644
index 0000000..f5564c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/switch.js
@@ -0,0 +1,24 @@
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+export function _switch(mat) {
+  var I = mat.length;
+  var J = mat[0].length;
+  var i, j;
+  var ret = [];
+
+  for (j = 0; j < J; j++) {
+    var tmp = [];
+
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+
+    ret.push(tmp);
+  }
+
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/version.js b/node_modules/mathjs/lib/esm/version.js
new file mode 100644
index 0000000..3436c4e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/version.js
@@ -0,0 +1,2 @@
+export var version = '10.4.3'; // Note: This file is automatically generated when building math.js.
+// Changes made in this file will be overwritten.
\ No newline at end of file
diff --git a/node_modules/mathjs/main/es5/index.js b/node_modules/mathjs/main/es5/index.js
new file mode 100644
index 0000000..aabea94
--- /dev/null
+++ b/node_modules/mathjs/main/es5/index.js
@@ -0,0 +1,3 @@
+// TODO: deprecated since v8, remove this deprecation warning in v9
+throw new Error('The file "mathjs/main/es5/index.js" has been moved since mathjs@8.0.0. ' +
+  'Please load "mathjs" or "mathjs/lib/cjs/index.js" instead.')
diff --git a/node_modules/mathjs/main/es5/number.js b/node_modules/mathjs/main/es5/number.js
new file mode 100644
index 0000000..b0d1877
--- /dev/null
+++ b/node_modules/mathjs/main/es5/number.js
@@ -0,0 +1,3 @@
+// TODO: deprecated since v8, remove this deprecation warning in v9
+throw new Error('The file "mathjs/main/es5/number.js" has been moved since mathjs@8.0.0. ' +
+  'Please load "mathjs/number" or "mathjs/lib/cjs/number.js" instead.')
diff --git a/node_modules/mathjs/main/es5/package.json b/node_modules/mathjs/main/es5/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/main/es5/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/main/esm/index.js b/node_modules/mathjs/main/esm/index.js
new file mode 100644
index 0000000..569d3b4
--- /dev/null
+++ b/node_modules/mathjs/main/esm/index.js
@@ -0,0 +1,3 @@
+// TODO: deprecated since v8, remove this deprecation warning in v9
+throw new Error('The file "mathjs/main/esm/index.js" has been moved since mathjs@8.0.0. ' +
+  'Please load "mathjs" or "mathjs/lib/esm/index.js" instead.')
diff --git a/node_modules/mathjs/main/esm/number.js b/node_modules/mathjs/main/esm/number.js
new file mode 100644
index 0000000..cd2ef44
--- /dev/null
+++ b/node_modules/mathjs/main/esm/number.js
@@ -0,0 +1,3 @@
+// TODO: deprecated since v8, remove this deprecation warning in v9
+throw new Error('The file "mathjs/main/esm/number.js" has been moved since mathjs@8.0.0. ' +
+  'Please load "mathjs/number" or "mathjs/lib/esm/number.js" instead.')
diff --git a/node_modules/mathjs/main/esm/package.json b/node_modules/mathjs/main/esm/package.json
new file mode 100644
index 0000000..3dbc1ca
--- /dev/null
+++ b/node_modules/mathjs/main/esm/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "module"
+}
diff --git a/node_modules/mathjs/number.cjs b/node_modules/mathjs/number.cjs
new file mode 100644
index 0000000..4487738
--- /dev/null
+++ b/node_modules/mathjs/number.cjs
@@ -0,0 +1,3 @@
+// TODO: deprecated since v8, remove this deprecation warning in v9
+throw new Error('The file "mathjs/number.js" has been moved since mathjs@8.0.0. ' +
+    'Please load "mathjs/number" or "mathjs/lib/esm/number.js" instead.')
diff --git a/node_modules/mathjs/package.json b/node_modules/mathjs/package.json
new file mode 100644
index 0000000..c220dda
--- /dev/null
+++ b/node_modules/mathjs/package.json
@@ -0,0 +1,174 @@
+{
+  "name": "mathjs",
+  "version": "10.4.3",
+  "description": "Math.js is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with different data types like numbers, big numbers, complex numbers, fractions, units, and matrices.",
+  "author": "Jos de Jong <wjosdejong@gmail.com> (https://github.com/josdejong)",
+  "homepage": "https://mathjs.org",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/josdejong/mathjs.git"
+  },
+  "license": "Apache-2.0",
+  "keywords": [
+    "math",
+    "mathematics",
+    "functions",
+    "numeric",
+    "algebra",
+    "parser",
+    "expression",
+    "number",
+    "bignumber",
+    "complex",
+    "fraction",
+    "matrix",
+    "unit"
+  ],
+  "dependencies": {
+    "@babel/runtime": "^7.17.8",
+    "complex.js": "^2.1.0",
+    "decimal.js": "^10.3.1",
+    "escape-latex": "^1.2.0",
+    "fraction.js": "^4.2.0",
+    "javascript-natural-sort": "^0.7.1",
+    "seedrandom": "^3.0.5",
+    "tiny-emitter": "^2.1.0",
+    "typed-function": "^2.1.0"
+  },
+  "devDependencies": {
+    "@babel/core": "7.17.8",
+    "@babel/plugin-transform-object-assign": "7.16.7",
+    "@babel/plugin-transform-runtime": "7.17.0",
+    "@babel/preset-env": "7.16.11",
+    "@babel/register": "7.17.7",
+    "@types/assert": "^1.5.6",
+    "assert": "2.0.0",
+    "babel-loader": "8.2.4",
+    "benchmark": "2.1.4",
+    "codecov": "3.8.3",
+    "core-js": "3.21.1",
+    "del": "6.0.0",
+    "dtslint": "4.2.1",
+    "expect-type": "^0.13.0",
+    "expr-eval": "2.0.2",
+    "fancy-log": "2.0.0",
+    "glob": "7.2.0",
+    "gulp": "4.0.2",
+    "gulp-babel": "8.0.0",
+    "handlebars": "4.7.7",
+    "istanbul": "0.4.5",
+    "jsep": "1.3.4",
+    "karma": "6.3.17",
+    "karma-browserstack-launcher": "1.6.0",
+    "karma-firefox-launcher": "2.1.2",
+    "karma-mocha": "2.0.1",
+    "karma-mocha-reporter": "2.2.5",
+    "karma-webpack": "4.0.2",
+    "math-expression-evaluator": "1.3.14",
+    "mkdirp": "1.0.4",
+    "mocha": "8.4.0",
+    "ndarray": "1.0.19",
+    "ndarray-determinant": "1.0.0",
+    "ndarray-gemm": "1.0.0",
+    "ndarray-ops": "1.2.2",
+    "ndarray-pack": "1.2.1",
+    "numericjs": "1.2.6",
+    "nyc": "15.1.0",
+    "pad-right": "0.2.2",
+    "process": "0.11.10",
+    "standard": "16.0.4",
+    "sylvester": "0.0.21",
+    "ts-node": "10.7.0",
+    "typescript": "4.6.2",
+    "webpack": "4.46.0",
+    "zeros": "1.0.0"
+  },
+  "type": "module",
+  "main": "./lib/cjs",
+  "types": "./types/index.d.ts",
+  "module": "./lib/esm",
+  "unpkg": "./lib/browser/math.js",
+  "jsdelivr": "./lib/browser/math.js",
+  "exports": {
+    ".": {
+      "import": "./lib/esm/index.js",
+      "require": "./lib/cjs/index.js"
+    },
+    "./number": {
+      "import": "./lib/esm/number.js",
+      "require": "./lib/cjs/number.js"
+    },
+    "./lib/esm/number": {
+      "import": "./lib/esm/number.js",
+      "require": "./lib/cjs/number.js"
+    },
+    "./package.json": "./package.json",
+    "./lib/browser/math.js": "./lib/browser/math.js",
+    "./lib/browser/math.js.map": "./lib/browser/math.js.map",
+    "./dist/math.js": "./dist/math.js",
+    "./dist/math.min.js": "./dist/math.min.js",
+    "./main/es5/index.js": "./main/es5/index.js",
+    "./main/es5/number.js": "./main/es5/number.js",
+    "./main/esm/index.js": "./main/esm/index.js",
+    "./main/esm/number.js": "./main/esm/number.js",
+    "./number.js": "./number.cjs"
+  },
+  "files": [
+    "bin",
+    "dist",
+    "docs",
+    "lib",
+    "examples",
+    "main",
+    "types",
+    "number.cjs",
+    "LICENSE",
+    "NOTICE",
+    "README.md",
+    "HISTORY.md",
+    "CONTRIBUTING.md"
+  ],
+  "scripts": {
+    "build": "gulp --gulpfile gulpfile.cjs && npm run update-authors",
+    "build-and-test": "npm run build && npm run test:all && npm run lint",
+    "build:clean": "gulp --gulpfile gulpfile.cjs clean",
+    "build:docs": "gulp --gulpfile gulpfile.cjs docs",
+    "compile": "gulp --gulpfile gulpfile.cjs compile",
+    "watch": "gulp --gulpfile gulpfile.cjs watch",
+    "lint": "standard --env=mocha --env=worker",
+    "format": "npm run lint -- --fix",
+    "validate:ascii": "gulp --gulpfile gulpfile.cjs validate:ascii",
+    "test": "npm run test:src && npm run lint",
+    "test:src": "mocha test/unit-tests",
+    "test:generated": "mocha test/generated-code-tests",
+    "test:node": "mocha test/node-tests/*.test.js test/node-tests/**/*.test.js",
+    "test:all": "npm run test:src && npm run test:generated && npm run test:node && npm run test:types",
+    "test:browser": "karma start test/browser-test-config/local-karma.js",
+    "test:browserstack": "karma start test/browser-test-config/browserstack-karma.js",
+    "test:types": "cd types && node --loader ts-node/esm ./index.ts",
+    "coverage": "nyc --reporter=lcov --reporter=text-summary mocha test/unit-tests && echo \"\nDetailed coverage report is available at ./coverage/lcov-report/index.html\"",
+    "prepublishOnly": "npm run test:all && npm run lint",
+    "prepare": "npm run build",
+    "update-authors": "node ./tools/update-authors.js"
+  },
+  "bin": {
+    "mathjs": "./bin/cli.js"
+  },
+  "engines": {
+    "node": ">= 12"
+  },
+  "bugs": {
+    "url": "https://github.com/josdejong/mathjs/issues"
+  },
+  "directories": {
+    "doc": "./docs",
+    "example": "./examples",
+    "lib": "./lib",
+    "src": "./src",
+    "test": "./test"
+  },
+  "browserslist": [
+    "IE 11"
+  ],
+  "sideEffects": false
+}
diff --git a/node_modules/mathjs/types/index.d.ts b/node_modules/mathjs/types/index.d.ts
new file mode 100644
index 0000000..fc665bb
--- /dev/null
+++ b/node_modules/mathjs/types/index.d.ts
@@ -0,0 +1,5215 @@
+import { Decimal } from 'decimal.js';
+
+declare const math: math.MathJsStatic;
+export as namespace math;
+export = math;
+
+type NoLiteralType<T> =
+    T extends number ? number :
+        T extends string ? string :
+            T extends boolean ? boolean :
+                T;
+
+declare namespace math {
+  type MathArray = number[] | number[][];
+  type MathType = number | BigNumber | Fraction | Complex | Unit | MathArray | Matrix;
+  type MathExpression = string | string[] | MathArray | Matrix;
+
+  type FactoryFunction<T> = (scope: any) => T;
+
+  // FactoryFunctionMap can be nested; all nested objects will be flattened
+  interface FactoryFunctionMap {
+    [key: string]: FactoryFunction<any> | FactoryFunctionMap;
+  }
+
+
+  /** Available options for parse */
+  interface ParseOptions {
+    /** a set of custom nodes */
+    nodes?: Record<string, MathNode>;
+  }
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate().
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.parse(expr)
+   *     math.parse(expr, options)
+   *     math.parse([expr1, expr2, expr3, ...])
+   *     math.parse([expr1, expr2, expr3, ...], options)
+   *
+   * Example:
+   *
+   *     const node1 = math.parse('sqrt(3^2 + 4^2)')
+   *     node1.compile().evaluate() // 5
+   *
+   *     let scope = {a:3, b:4}
+   *     const node2 = math.parse('a * b') // 12
+   *     const code2 = node2.compile()
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].compile().evaluate() // 12
+   *
+   * See also:
+   *
+   *     evaluate, compile
+   */
+  interface ParseFunction {
+    /**
+     * Parse an expression. Returns a node tree, which can be evaluated by
+     * invoking node.evaluate();
+     *
+     * @param expr Expression to be parsed
+     * @param options Available options
+     * @returns A node
+     */
+    (expr: MathExpression, options?: ParseOptions): MathNode;
+
+    /**
+     * Parse an expression. Returns a node tree, which can be evaluated by
+     * invoking node.evaluate();
+     *
+     * @param exprs Expressions to be parsed
+     * @param options Available options
+     * @returns An array of nodes
+     */
+    (exprs: MathExpression[], options?: ParseOptions): MathNode[];
+
+    /**
+     * Checks whether the current character `c` is a valid alpha character:
+     *
+     * - A latin letter (upper or lower case) Ascii: a-z, A-Z
+     * - An underscore                        Ascii: _
+     * - A dollar sign                        Ascii: $
+     * - A latin letter with accents          Unicode: \u00C0 - \u02AF
+     * - A greek letter                       Unicode: \u0370 - \u03FF
+     * - A mathematical alphanumeric symbol   Unicode: \u{1D400} - \u{1D7FF} excluding invalid code points
+     *
+     * The previous and next characters are needed to determine whether
+     * this character is part of a unicode surrogate pair.
+     *
+     * @param c      Current character in the expression
+     * @param cPrev  Previous character
+     * @param cNext  Next character
+     */
+    isAlpha(c: string, cPrev: string, cNext: string): boolean;
+    /**
+     * Test whether a character is a valid latin, greek, or letter-like character
+     *
+     * @param c
+     */
+    isValidLatinOrGreek(c: string): boolean;
+    /**
+     * Test whether two given 16 bit characters form a surrogate pair of a
+     * unicode math symbol.
+     *
+     * https://unicode-table.com/en/
+     * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode
+     *
+     * Note: In ES6 will be unicode aware:
+     * https://stackoverflow.com/questions/280712/javascript-unicode-regexes
+     * https://mathiasbynens.be/notes/es6-unicode-regex
+     *
+     * @param high
+     * @param low
+     */
+    isValidMathSymbol(high: string, low: string): boolean;
+    /**
+     * Check whether given character c is a white space character: space, tab, or enter
+     *
+     * @param c
+     * @param nestingLevel
+     */
+    isWhitespace(c: string, nestingLevel: number): boolean;
+    /**
+     * Test whether the character c is a decimal mark (dot).
+     * This is the case when it's not the start of a delimiter '.*', './', or '.^'
+     *
+     * @param  c
+     * @param  cNext
+     */
+    isDecimalMark(c: string, cNext: string): boolean;
+    /**
+     * checks if the given char c is a digit or dot
+     *
+     * @param  c   a string with one character
+     */
+    isDigitDot(c: string): boolean;
+    /**
+     * checks if the given char c is a digit
+     *
+     * @param  c   a string with one character
+     */
+    isDigit(c: string): boolean;
+    /**
+     * checks if the given char c is a hex digit
+     *
+     * @param c   a string with one character
+     */
+    isHexDigit(c: string): boolean;
+  }
+
+  interface AccessorNode extends MathNodeCommon {
+    type: 'AccessorNode';
+    isAccessorNode: true;
+    object: MathNode;
+    index: IndexNode;
+    name: string;
+  }
+  interface AccessorNodeCtor {
+    new(object: MathNode, index: IndexNode): AccessorNode;
+  }
+
+  interface ArrayNode extends MathNodeCommon {
+    type: 'ArrayNode';
+    isArrayNode: true;
+    items: MathNode[];
+  }
+  interface ArrayNodeCtor {
+    new(items: MathNode[]): ArrayNode;
+  }
+
+  interface AssignmentNode extends MathNodeCommon {
+    type: 'AssignmentNode';
+    isAssignmentNode: true;
+    object: SymbolNode | AccessorNode;
+    index: IndexNode | null;
+    value: MathNode;
+    name: string;
+  }
+  interface AssignmentNodeCtor {
+    new(object: SymbolNode, value: MathNode): AssignmentNode;
+    new(object: SymbolNode | AccessorNode, index: IndexNode, value: MathNode): AssignmentNode;
+  }
+
+  interface BlockNode extends MathNodeCommon {
+    type: 'BlockNode';
+    isBlockNode: true;
+    blocks: Array<{node: MathNode, visible: boolean}>;
+  }
+  interface BlockNodeCtor {
+    new(arr: Array<{node: MathNode} | {node: MathNode, visible: boolean}>): BlockNode;
+  }
+
+  interface ConditionalNode extends MathNodeCommon {
+    type: 'ConditionalNode';
+    isConditionalNode: boolean;
+    condition: MathNode;
+    trueExpr: MathNode;
+    falseExpr: MathNode;
+  }
+  interface ConditionalNodeCtor {
+    new(condition: MathNode, trueExpr: MathNode, falseExpr: MathNode): ConditionalNode;
+  }
+
+  interface ConstantNode extends MathNodeCommon {
+    type: 'ConstantNode';
+    isConstantNode: true;
+    value: any;
+  }
+
+  interface ConstantNodeCtor {
+    new(constant: number): ConstantNode;
+  }
+
+  interface FunctionAssignmentNode extends MathNodeCommon {
+    type: 'FunctionAssignmentNode';
+    isFunctionAssignmentNode: true;
+    name: string;
+    params: string[];
+    expr: MathNode;
+  }
+  interface FunctionAssignmentNodeCtor {
+    new(name: string, params: string[], expr: MathNode): FunctionAssignmentNode;
+  }
+
+  interface FunctionNode extends MathNodeCommon {
+    type: 'FunctionNode';
+    isFunctionNode: true;
+    fn: SymbolNode;
+    args: MathNode[];
+  }
+  interface FunctionNodeCtor {
+    new(fn: MathNode | string, args: MathNode[]): FunctionNode;
+  }
+
+  interface IndexNode extends MathNodeCommon {
+    type: 'IndexNode';
+    isIndexNode: true;
+    dimensions: MathNode[];
+    dotNotation: boolean;
+  }
+  interface IndexNodeCtor {
+    new(dimensions: MathNode[]): IndexNode;
+    new(dimensions: MathNode[], dotNotation: boolean): IndexNode;
+  }
+
+  interface ObjectNode extends MathNodeCommon {
+    type: 'ObjectNode';
+    isObjectNode: true;
+    properties: Record<string, MathNode>;
+  }
+  interface ObjectNodeCtor {
+    new(properties: Record<string, MathNode>): ObjectNode;
+  }
+
+  interface OperatorNode extends MathNodeCommon {
+    type: 'OperatorNode';
+    isOperatorNode: true;
+    op: string;
+    fn: string;
+    args: MathNode[];
+    implicit: boolean;
+    isUnary(): boolean;
+    isBinary(): boolean;
+  }
+  interface OperatorNodeCtor {
+    new(op: string, fn: string, args: MathNode[], implicit?: boolean): OperatorNode;
+  }
+
+  interface ParenthesisNode extends MathNodeCommon {
+    type: 'ParenthesisNode';
+    isParenthesisNode: true;
+    content: MathNode;
+  }
+  interface ParenthesisNodeCtor {
+    new(content: MathNode): ParenthesisNode;
+  }
+
+  interface RangeNode extends MathNodeCommon {
+    type: 'RangeNode';
+    isRangeNode: true;
+    start: MathNode;
+    end: MathNode;
+    step: MathNode | null;
+  }
+  interface RangeNodeCtor {
+    new(start: MathNode, end: MathNode, step?: MathNode): RangeNode;
+  }
+
+  interface RelationalNode extends MathNodeCommon {
+    type: 'RelationalNode';
+    isRelationalNode: true;
+    conditionals: string[];
+    params: MathNode[];
+  }
+  interface RelationalNodeCtor {
+    new(conditionals: string[], params: MathNode[]): RelationalNode;
+  }
+
+  interface SymbolNode extends MathNodeCommon {
+    type: 'SymbolNode';
+    isSymbolNode: true;
+    name: string;
+  }
+  interface SymbolNodeCtor {
+    new(name: string): SymbolNode;
+  }
+
+  type MathNode = AccessorNode | ArrayNode | AssignmentNode | BlockNode | ConditionalNode | ConstantNode |
+      FunctionAssignmentNode | FunctionNode | IndexNode | ObjectNode | OperatorNode | ParenthesisNode | RangeNode |
+      RelationalNode | SymbolNode;
+
+
+  type MathJsFunctionName = keyof MathJsStatic;
+
+  interface MathJsStatic extends FactoryDependencies {
+    e: number;
+    pi: number;
+    i: number;
+    Infinity: number;
+    LN2: number;
+    LN10: number;
+    LOG2E: number;
+    LOG10E: number;
+    NaN: number;
+    phi: number;
+    SQRT1_2: number;
+    SQRT2: number;
+    tau: number;
+
+    // Class-like constructors
+    AccessorNode: AccessorNodeCtor;
+    ArrayNode: ArrayNodeCtor;
+    AssignmentNode: AssignmentNodeCtor;
+    BlockNode: BlockNodeCtor;
+    ConditionalNode: ConditionalNodeCtor;
+    ConstantNode: ConstantNodeCtor;
+    FunctionAssignmentNode: FunctionAssignmentNodeCtor;
+    FunctionNode: FunctionNodeCtor;
+    IndexNode: IndexNodeCtor;
+    ObjectNode: ObjectNodeCtor;
+    OperatorNode: OperatorNodeCtor;
+    ParenthesisNode: ParenthesisNodeCtor;
+    RangeNode: RangeNodeCtor;
+    RelationalNode: RelationalNodeCtor;
+    SymbolNode: SymbolNodeCtor;
+
+    Matrix: MatrixCtor;
+
+    /**
+     * If null were to be included in this interface, it would be
+     * auto-suggested as an import in VSCode. This causes issues because
+     * `null` is not a valid label.
+     *
+     * @see https://github.com/josdejong/mathjs/issues/2019
+     */
+    // null: number;
+
+    uninitialized: any;
+    version: string;
+
+    expression: MathNode;
+
+    /**
+     * Returns reviver function that can be used as reviver in JSON.parse function.
+     */
+     reviver(): (key: any, value: any) => any;
+
+    /*************************************************************************
+     * Core functions
+     ************************************************************************/
+
+    /**
+     * Set configuration options for math.js, and get current options. Will
+     * emit a ‘config’ event, with arguments (curr, prev, changes).
+     * @param options Available options: {number} epsilon Minimum relative
+     * difference between two compared values, used by all comparison
+     * functions. {string} matrix A string ‘Matrix’ (default) or ‘Array’.
+     * {string} number A string ‘number’ (default), ‘BigNumber’, or
+     * ‘Fraction’ {number} precision The number of significant digits for
+     * BigNumbers. Not applicable for Numbers. {string} parenthesis How to
+     * display parentheses in LaTeX and string output. {string} randomSeed
+     * Random seed for seeded pseudo random number generator. Set to null to
+     * randomly seed.
+     * @returns Returns the current configuration
+     */
+    config: (options: ConfigOptions) => ConfigOptions;
+    /**
+     * Create a typed-function which checks the types of the arguments and
+     * can match them against multiple provided signatures. The
+     * typed-function automatically converts inputs in order to find a
+     * matching signature. Typed functions throw informative errors in case
+     * of wrong input arguments.
+     * @param name Optional name for the typed-function
+     * @param signatures Object with one or multiple function signatures
+     * @returns The created typed-function.
+     */
+    typed: (name: string, signatures: Record<string, (...args: any[]) => any>) => (...args: any[]) => any;
+
+    /*************************************************************************
+     * Construction functions
+     ************************************************************************/
+
+    /**
+     * Create a BigNumber, which can store numbers with arbitrary precision.
+     * When a matrix is provided, all elements will be converted to
+     * BigNumber.
+     * @param x Value for the big number, 0 by default.
+     * @returns The created bignumber
+     */
+    bignumber(x?: number | string | Fraction | BigNumber | MathArray | Matrix | boolean | Fraction | null): BigNumber;
+
+    /**
+     * Create a boolean or convert a string or number to a boolean. In case
+     * of a number, true is returned for non-zero numbers, and false in case
+     * of zero. Strings can be 'true' or 'false', or can contain a number.
+     * When value is a matrix, all elements will be converted to boolean.
+     * @param x A value of any type
+     * @returns The boolean value
+     */
+    boolean(x: string | number | boolean | MathArray | Matrix | null): boolean | MathArray | Matrix;
+
+    /**
+     * Wrap any value in a chain, allowing to perform chained operations on
+     * the value. All methods available in the math.js library can be called
+     * upon the chain, and then will be evaluated with the value itself as
+     * first argument. The chain can be closed by executing chain.done(),
+     * which returns the final value. The chain has a number of special
+     * functions: done() Finalize the chain and return the chain's value.
+     * valueOf() The same as done() toString() Executes math.format() onto
+     * the chain's value, returning a string representation of the value.
+     * @param value A value of any type on which to start a chained
+     * operation.
+     * @returns The created chain
+     */
+    chain(value?: any): MathJsChain;
+
+    /**
+     * Create a complex value or convert a value to a complex value.
+     * @param args Arguments specifying the real and imaginary part of the
+     * complex number
+     * @returns Returns a complex value
+     */
+    complex(arg?: Complex | string | PolarCoordinates): Complex;
+    complex(arg?: MathArray | Matrix): MathArray | Matrix;
+    /**
+     * @param re Argument specifying the real part of the complex number
+     * @param im Argument specifying the imaginary part of the complex
+     * number
+     * @returns Returns a complex value
+     */
+    complex(re: number, im: number): Complex;
+
+    /**
+     * Create a user-defined unit and register it with the Unit type.
+     * @param name The name of the new unit. Must be unique. Example: ‘knot’
+     * @param definition Definition of the unit in terms of existing units.
+     * For example, ‘0.514444444 m / s’.
+     * @param options (optional) An object containing any of the following
+     * properties:</br>- prefixes {string} “none”, “short”, “long”,
+     * “binary_short”, or “binary_long”. The default is “none”.</br>-
+     * aliases {Array} Array of strings. Example: [‘knots’, ‘kt’,
+     * ‘kts’]</br>- offset {Numeric} An offset to apply when converting from
+     * the unit. For example, the offset for celsius is 273.15. Default is
+     * 0.
+     * @returns The new unit
+     */
+    createUnit(name: string, definition?: string | UnitDefinition, options?: CreateUnitOptions): Unit;
+    /**
+     * Create a user-defined unit and register it with the Unit type.
+     * @param units Definition of the unit
+     * @param options
+     * @returns The new unit
+     */
+    createUnit(units: Record<string, string | UnitDefinition>, options?: CreateUnitOptions): Unit;
+
+    /**
+     * Create a fraction convert a value to a fraction.
+     * @param args Arguments specifying the numerator and denominator of the
+     * fraction
+     * @returns Returns a fraction
+     */
+    fraction(args: Fraction | MathArray | Matrix): Fraction | MathArray | Matrix;
+    /**
+     * @param numerator Argument specifying the numerator of the fraction
+     * @param denominator Argument specifying the denominator of the
+     * fraction
+     * @returns Returns a fraction
+     */
+    fraction(
+        numerator: number | string | MathArray | Matrix,
+        denominator?: number | string | MathArray | Matrix
+    ): Fraction | MathArray | Matrix;
+
+    /**
+     * Create an index. An Index can store ranges having start, step, and
+     * end for multiple dimensions. Matrix.get, Matrix.set, and math.subset
+     * accept an Index as input.
+     * @param ranges Zero or more ranges or numbers.
+     * @returns Returns the created index
+     */
+    index(...ranges: any[]): Index;
+
+    /**
+     * Create a Matrix. The function creates a new math.type.Matrix object
+     * from an Array. A Matrix has utility functions to manipulate the data
+     * in the matrix, like getting the size and getting or setting values in
+     * the matrix. Supported storage formats are 'dense' and 'sparse'.
+     * @param format The Matrix storage format
+     * @returns The created Matrix
+     */
+    matrix(format?: 'sparse' | 'dense'): Matrix;
+    /**
+     * @param data A multi dimensional array
+     * @param format The Matrix storage format
+     * @param dataType The Matrix data type
+     * @returns The created Matrix
+     */
+    matrix(data: MathArray | Matrix, format?: 'sparse' | 'dense', dataType?: string): Matrix;
+
+    /**
+     * Create a number or convert a string, boolean, or unit to a number.
+     * When value is a matrix, all elements will be converted to number.
+     * @param value Value to be converted
+     * @returns The created number
+     */
+    number(value?: string | number | BigNumber | Fraction | boolean | MathArray | Matrix | Unit | null): number | MathArray | Matrix;
+    /**
+     * @param value Value to be converted
+     * @param valuelessUnit A valueless unit, used to convert a unit to a
+     * number
+     * @returns The created number
+     */
+    number(unit: Unit, valuelessUnit: Unit | string): number;
+
+    /**
+     * Create a Sparse Matrix. The function creates a new math.type.Matrix
+     * object from an Array. A Matrix has utility functions to manipulate
+     * the data in the matrix, like getting the size and getting or setting
+     * values in the matrix.
+     * @param data A two dimensional array
+     * @param dataType Sparse Matrix data type
+     * @returns The created matrix
+     */
+    sparse(data?: MathArray | Matrix, dataType?: string): Matrix;
+
+    /**
+     * Split a unit in an array of units whose sum is equal to the original
+     * unit.
+     * @param unit A unit to be split
+     * @param parts An array of strings or valueless units
+     * @returns An array of units
+     */
+    splitUnit(unit: Unit, parts: Unit[]): Unit[];
+
+    /**
+     * Create a string or convert any object into a string. Elements of
+     * Arrays and Matrices are processed element wise.
+     * @param value A value to convert to a string
+     * @returns The created string
+     */
+    string(value: MathType | null): string | MathArray | Matrix;
+
+    /**
+     * Create a unit. Depending on the passed arguments, the function will
+     * create and return a new math.type.Unit object. When a matrix is
+     * provided, all elements will be converted to units.
+     * @param unit The unit to be created
+     * @returns The created unit
+     */
+    unit(unit: string): Unit;
+    /**
+     * @param unit The unit to be created
+     * @returns The created unit
+     */
+    unit(unit: Unit): Unit;
+    /**
+     * @param value The value of the unit to be created
+     * @param unit The unit to be created
+     * @returns The created unit
+     */
+    unit(value: number | MathArray | Matrix | BigNumber, unit: string): Unit;
+
+    /*************************************************************************
+     * Expression functions
+     ************************************************************************/
+
+    /**
+     * Parse and compile an expression. Returns a an object with a function
+     * evaluate([scope]) to evaluate the compiled expression.
+     * @param expr The expression to be compiled
+     * @returns An object with the compiled expression
+     */
+    compile(expr: MathExpression): EvalFunction;
+    /**
+     * @param exprs The expressions to be compiled
+     * @returns An array of objects with the compiled expressions
+     */
+    compile(exprs: MathExpression[]): EvalFunction[];
+
+    /**
+     * Evaluate an expression.
+     * @param expr The expression to be evaluated
+     * @param scope Scope to read/write variables
+     * @returns The result of the expression
+     */
+    evaluate(expr: MathExpression | MathExpression[] | Matrix, scope?: object): any;
+
+    /**
+     * Retrieve help on a function or data type. Help files are retrieved
+     * from the documentation in math.expression.docs.
+     * @param search A function or function name for which to get help
+     * @returns A help object
+     */
+    help(search: () => any): Help;
+
+    /**
+     * Parse an expression. Returns a node tree, which can be evaluated by
+     * invoking node.evaluate();
+     */
+    parse: ParseFunction;
+
+    /**
+     * Create a parser. The function creates a new math.expression.Parser
+     * object.
+     * @returns A Parser object
+     */
+    parser(): Parser;
+
+    /*************************************************************************
+     * Algebra functions
+     ************************************************************************/
+    /**
+     * @param expr The expression to differentiate
+     * @param variable The variable over which to differentiate
+     * @param options There is one option available, simplify, which is true
+     * by default. When false, output will not be simplified.
+     * @returns The derivative of expr
+     */
+    derivative(expr: MathNode | string, variable: MathNode | string, options?: { simplify: boolean }): MathNode;
+
+    /**
+     * Solves the linear equation system by forwards substitution. Matrix
+     * must be a lower triangular matrix.
+     * @param L A N x N matrix or array (L)
+     * @param b A column vector with the b values
+     * @returns A column vector with the linear system solution (x)
+     */
+    lsolve(L: Matrix | MathArray, b: Matrix | MathArray): Matrix | MathArray;
+
+    /**
+     * Calculate the Matrix LU decomposition with partial pivoting. Matrix A
+     * is decomposed in two matrices (L, U) and a row permutation vector p
+     * where A[p,:] = L * U
+     * @param A A two dimensional matrix or array for which to get the LUP
+     * decomposition.
+     * @returns The lower triangular matrix, the upper triangular matrix and
+     * the permutation matrix.
+     */
+    lup(A?: Matrix | MathArray): { L: MathArray | Matrix; U: MathArray | Matrix; P: number[] };
+
+    /**
+     * Solves the linear system A * x = b where A is an [n x n] matrix and b
+     * is a [n] column vector.
+     * @param A Invertible Matrix or the Matrix LU decomposition
+     * @param b Column Vector
+     * @param order The Symbolic Ordering and Analysis order, see slu for
+     * details. Matrix must be a SparseMatrix
+     * @param threshold Partial pivoting threshold (1 for partial pivoting),
+     * see slu for details. Matrix must be a SparseMatrix.
+     * @returns Column vector with the solution to the linear system A * x =
+     * b
+     */
+    lusolve(A: Matrix | MathArray | number, b: Matrix | MathArray, order?: number, threshold?: number): Matrix | MathArray;
+
+    /**
+     * Calculate the Matrix QR decomposition. Matrix A is decomposed in two
+     * matrices (Q, R) where Q is an orthogonal matrix and R is an upper
+     * triangular matrix.
+     * @param A A two dimensional matrix or array for which to get the QR
+     * decomposition.
+     * @returns Q: the orthogonal matrix and R: the upper triangular matrix
+     */
+    qr(A: Matrix | MathArray): { Q: MathArray | Matrix; R: MathArray | Matrix };
+
+    rationalize(expr: MathNode | string, optional?: object | boolean, detailed?: false): MathNode;
+    /**
+     * Transform a rationalizable expression in a rational fraction. If
+     * rational fraction is one variable polynomial then converts the
+     * numerator and denominator in canonical form, with decreasing
+     * exponents, returning the coefficients of numerator.
+     * @param expr The expression to check if is a polynomial expression
+     * @param optional scope of expression or true for already evaluated
+     * rational expression at input
+     * @param detailed  optional True if return an object, false if return
+     * expression node (default)
+     * @returns The rational polynomial of expr
+     */
+    rationalize(
+        expr: MathNode | string,
+        optional?: object | boolean,
+        detailed?: true
+    ): { expression: MathNode | string; variables: string[]; coefficients: MathType[] };
+
+
+    /**
+     * Simplify an expression tree.
+     * @param expr The expression to be simplified
+     * @param [rules] (optional) A list of rules are applied to an expression, repeating
+     * over the list until no further changes are made. It’s possible to
+     * pass a custom set of rules to the function as second argument. A rule
+     * can be specified as an object, string, or function.
+     * @param [scope] (optional) Scope to variables
+     * @param [options] (optional) An object with simplify options
+     * @returns Returns the simplified form of expr
+     */
+    simplify: Simplify;
+
+    /**
+     * Calculate the Sparse Matrix LU decomposition with full pivoting.
+     * Sparse Matrix A is decomposed in two matrices (L, U) and two
+     * permutation vectors (pinv, q) where P * A * Q = L * U
+     * @param A A two dimensional sparse matrix for which to get the LU
+     * decomposition.
+     * @param order The Symbolic Ordering and Analysis order: 0 - Natural
+     * ordering, no permutation vector q is returned 1 - Matrix must be
+     * square, symbolic ordering and analisis is performed on M = A + A' 2 -
+     * Symbolic ordering and analysis is performed on M = A' * A. Dense
+     * columns from A' are dropped, A recreated from A'. This is appropriate
+     * for LU factorization of non-symmetric matrices. 3 - Symbolic ordering
+     * and analysis is performed on M = A' * A. This is best used for LU
+     * factorization is matrix M has no dense rows. A dense row is a row
+     * with more than 10*sqr(columns) entries.
+     * @param threshold Partial pivoting threshold (1 for partial pivoting)
+     * @returns The lower triangular matrix, the upper triangular matrix and
+     * the permutation vectors.
+     */
+    slu(A: Matrix, order: number, threshold: number): object;
+
+    /**
+     * Solves the linear equation system by backward substitution. Matrix
+     * must be an upper triangular matrix. U * x = b
+     * @param U A N x N matrix or array (U)
+     * @param b A column vector with the b values
+     * @returns A column vector with the linear system solution (x)
+     */
+    usolve(U: Matrix | MathArray, b: Matrix | MathArray): Matrix | MathArray;
+
+    /*************************************************************************
+     * Arithmetic functions
+     ************************************************************************/
+
+    /**
+     * Calculate the absolute value of a number. For matrices, the function
+     * is evaluated element wise.
+     * @param x A number or matrix for which to get the absolute value
+     * @returns Absolute value of x
+     */
+    abs(x: number): number;
+    abs(x: BigNumber): BigNumber;
+    abs(x: Fraction): Fraction;
+    abs(x: Complex): Complex;
+    abs(x: MathArray): MathArray;
+    abs(x: Matrix): Matrix;
+    abs(x: Unit): Unit;
+
+    /**
+     * Add two values, x + y. For matrices, the function is evaluated
+     * element wise.
+     * @param x First value to add
+     * @param y Second value to add
+     * @returns Sum of x and y
+     */
+    add<T extends MathType>(x: T, y: T): T;
+    add(x: MathType, y: MathType): MathType;
+
+    /**
+     * Calculate the cubic root of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param x Value for which to calculate the cubic root.
+     * @param allRoots Optional, false by default. Only applicable when x is
+     * a number or complex number. If true, all complex roots are returned,
+     * if false (default) the principal root is returned.
+     * @returns Returns the cubic root of x
+     */
+    cbrt(x: number, allRoots?: boolean): number;
+    cbrt(x: BigNumber, allRoots?: boolean): BigNumber;
+    cbrt(x: Fraction, allRoots?: boolean): Fraction;
+    cbrt(x: Complex, allRoots?: boolean): Complex;
+    cbrt(x: MathArray, allRoots?: boolean): MathArray;
+    cbrt(x: Matrix, allRoots?: boolean): Matrix;
+    cbrt(x: Unit, allRoots?: boolean): Unit;
+
+    /**
+     * Round a value towards plus infinity If x is complex, both real and
+     * imaginary part are rounded towards plus infinity. For matrices, the
+     * function is evaluated element wise.
+     * @param x Number to be rounded
+     * @returns Rounded value
+     */
+    ceil(x: number): number;
+    ceil(x: BigNumber): BigNumber;
+    ceil(x: Fraction): Fraction;
+    ceil(x: Complex): Complex;
+    ceil(x: MathArray): MathArray;
+    ceil(x: Matrix): Matrix;
+    ceil(x: Unit): Unit;
+
+    /**
+     * Compute the cube of a value, x * x * x. For matrices, the function is
+     * evaluated element wise.
+     * @param x Number for which to calculate the cube
+     * @returns Cube of x
+     */
+    cube(x: number): number;
+    cube(x: BigNumber): BigNumber;
+    cube(x: Fraction): Fraction;
+    cube(x: Complex): Complex;
+    cube(x: MathArray): MathArray;
+    cube(x: Matrix): Matrix;
+    cube(x: Unit): Unit;
+
+    /**
+     * Divide two values, x / y. To divide matrices, x is multiplied with
+     * the inverse of y: x * inv(y).
+     * @param x Numerator
+     * @param y Denominator
+     * @returns Quotient, x / y
+     */
+    divide(x: Unit, y: Unit): Unit | number;
+    divide(x: Unit, y: number): Unit;
+    divide(x: number, y: number): number;
+    divide(x: MathType, y: MathType): MathType;
+
+    /**
+     * Divide two matrices element wise. The function accepts both matrices
+     * and scalar values.
+     * @param x Numerator
+     * @param y Denominator
+     * @returns Quotient, x ./ y
+     */
+    dotDivide(x: MathType, y: MathType): MathType;
+
+    /**
+     * Multiply two matrices element wise. The function accepts both
+     * matrices and scalar values.
+     * @param x Left hand value
+     * @param y Right hand value
+     * @returns Multiplication of x and y
+     */
+    dotMultiply(x: MathType, y: MathType): MathType;
+
+    /**
+     * Calculates the power of x to y element wise.
+     * @param x The base
+     * @param y The exponent
+     * @returns The value of x to the power y
+     */
+    dotPow(x: MathType, y: MathType): MathType;
+
+    /**
+     * Calculate the exponent of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param x A number or matrix to exponentiate
+     * @returns Exponent of x
+     */
+    exp(x: number): number;
+    exp(x: BigNumber): BigNumber;
+    exp(x: Complex): Complex;
+    exp(x: MathArray): MathArray;
+    exp(x: Matrix): Matrix;
+
+    /**
+     * Calculate the value of subtracting 1 from the exponential value. For
+     * matrices, the function is evaluated element wise.
+     * @param x A number or matrix to apply expm1
+     * @returns Exponent of x
+     */
+    expm1(x: number): number;
+    expm1(x: BigNumber): BigNumber;
+    expm1(x: Complex): Complex;
+    expm1(x: MathArray): MathArray;
+    expm1(x: Matrix): Matrix;
+
+    /**
+     * Round a value towards zero. For matrices, the function is evaluated
+     * element wise.
+     * @param x Number to be rounded
+     * @returns Rounded value
+     */
+    fix(x: number): number;
+    fix(x: BigNumber): BigNumber;
+    fix(x: Fraction): Fraction;
+    fix(x: Complex): Complex;
+    fix(x: MathArray): MathArray;
+    fix(x: Matrix): Matrix;
+
+    /**
+     * Round a value towards minus infinity. For matrices, the function is
+     * evaluated element wise.
+     * @param Number to be rounded
+     * @returns Rounded value
+     */
+    floor(x: number): number;
+    floor(x: BigNumber): BigNumber;
+    floor(x: Fraction): Fraction;
+    floor(x: Complex): Complex;
+    floor(x: MathArray): MathArray;
+    floor(x: Matrix): Matrix;
+
+    /**
+     * Round a value towards minus infinity. For matrices, the function is
+     * evaluated element wise.
+     * @param x Number to be rounded
+     * @param n Number of decimals Default value: 0.
+     * @returns Rounded value
+     */
+    floor(
+        x: number | BigNumber | Fraction | Complex | MathArray | Matrix,
+        n: number | BigNumber | MathArray
+    ): number | BigNumber | Fraction | Complex | MathArray | Matrix;
+
+    /**
+     * Calculate the greatest common divisor for two or more values or
+     * arrays. For matrices, the function is evaluated element wise.
+     * @param args Two or more integer numbers
+     * @returns The greatest common divisor
+     */
+    gcd(...args: number[]): number;
+    gcd(...args: BigNumber[]): BigNumber;
+    gcd(...args: Fraction[]): Fraction;
+    gcd(...args: MathArray[]): MathArray;
+    gcd(...args: Matrix[]): Matrix;
+
+    /**
+     * Calculate the hypotenusa of a list with values. The hypotenusa is
+     * defined as: hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...) For
+     * matrix input, the hypotenusa is calculated for all values in the
+     * matrix.
+     * @param args A list with numeric values or an Array or Matrix. Matrix
+     * and Array input is flattened and returns a single number for the
+     * whole matrix.
+     * @returns Returns the hypothenuse of the input values.
+     */
+    hypot(...args: number[]): number;
+    hypot(...args: BigNumber[]): BigNumber;
+
+    /**
+     * Calculate the least common multiple for two or more values or arrays.
+     * lcm is defined as: lcm(a, b) = abs(a * b) / gcd(a, b) For matrices,
+     * the function is evaluated element wise.
+     * @param a An integer number
+     * @param b An integer number
+     * @returns The least common multiple
+     */
+    lcm(a: number, b: number): number;
+    lcm(a: BigNumber, b: BigNumber): BigNumber;
+    lcm(a: MathArray, b: MathArray): MathArray;
+    lcm(a: Matrix, b: Matrix): Matrix;
+
+    /**
+     * Calculate the logarithm of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param x Value for which to calculate the logarithm.
+     * @param base Optional base for the logarithm. If not provided, the
+     * natural logarithm of x is calculated. Default value: e.
+     * @returns Returns the logarithm of x
+     */
+    log<T extends number | BigNumber | Complex | MathArray | Matrix>(x: T, base?: number | BigNumber | Complex): NoLiteralType<T>;
+
+    /**
+     * Calculate the 10-base of a value. This is the same as calculating
+     * log(x, 10). For matrices, the function is evaluated element wise.
+     * @param x Value for which to calculate the logarithm.
+     * @returns Returns the 10-base logarithm of x
+     */
+    log10(x: number): number;
+    log10(x: BigNumber): BigNumber;
+    log10(x: Complex): Complex;
+    log10(x: MathArray): MathArray;
+    log10(x: Matrix): Matrix;
+
+    /**
+     * Calculate the logarithm of a value+1. For matrices, the function is
+     * evaluated element wise.
+     * @param x Value for which to calculate the logarithm.
+     * @returns Returns the logarithm of x+1
+     */
+    log1p(x: number, base?: number | BigNumber | Complex): number;
+    log1p(x: BigNumber, base?: number | BigNumber | Complex): BigNumber;
+    log1p(x: Complex, base?: number | BigNumber | Complex): Complex;
+    log1p(x: MathArray, base?: number | BigNumber | Complex): MathArray;
+    log1p(x: Matrix, base?: number | BigNumber | Complex): Matrix;
+
+    /**
+     * Calculate the 2-base of a value. This is the same as calculating
+     * log(x, 2). For matrices, the function is evaluated element wise.
+     * @param x Value for which to calculate the logarithm.
+     * @returns Returns the 2-base logarithm of x
+     */
+    log2(x: number): number;
+    log2(x: BigNumber): BigNumber;
+    log2(x: Complex): Complex;
+    log2(x: MathArray): MathArray;
+    log2(x: Matrix): Matrix;
+
+    /**
+     * Calculates the modulus, the remainder of an integer division. For
+     * matrices, the function is evaluated element wise. The modulus is
+     * defined as: x - y * floor(x / y)
+     * @see http://en.wikipedia.org/wiki/Modulo_operation.
+     * @param x Dividend
+     * @param y Divisor
+     * @returns Returns the remainder of x divided by y
+     */
+    mod<T extends number | BigNumber | Fraction | MathArray | Matrix>(
+        x: T,
+        y: number | BigNumber | Fraction | MathArray | Matrix
+    ): NoLiteralType<T>;
+
+    /**
+     * Multiply two values, x * y. The result is squeezed. For matrices, the
+     * matrix product is calculated.
+     * @param x The first value to multiply
+     * @param y The second value to multiply
+     * @returns Multiplication of x and y
+     */
+    multiply<T extends Matrix | MathArray>(x: T, y: MathType): T;
+    multiply(x: Unit, y: Unit): Unit;
+    multiply(x: number, y: number): number;
+    multiply(x: MathType, y: MathType): MathType;
+
+    /**
+     * Calculate the norm of a number, vector or matrix. The second
+     * parameter p is optional. If not provided, it defaults to 2.
+     * @param x Value for which to calculate the norm
+     * @param p Vector space. Supported numbers include Infinity and
+     * -Infinity. Supported strings are: 'inf', '-inf', and 'fro' (The
+     * Frobenius norm) Default value: 2.
+     * @returns the p-norm
+     */
+    norm(x: number | BigNumber | Complex | MathArray | Matrix, p?: number | BigNumber | string): number | BigNumber;
+
+    /**
+     * Calculate the nth root of a value. The principal nth root of a
+     * positive real number A, is the positive real solution of the equation
+     * x^root = A For matrices, the function is evaluated element wise.
+     * @param a Value for which to calculate the nth root
+     * @param root The root. Default value: 2.
+     * @return The nth root of a
+     */
+    nthRoot(a: number | BigNumber | MathArray | Matrix | Complex, root?: number | BigNumber): number | Complex | MathArray | Matrix;
+
+    /**
+     * Calculates the power of x to y, x ^ y. Matrix exponentiation is
+     * supported for square matrices x, and positive integer exponents y.
+     * @param x The base
+     * @param y The exponent
+     * @returns x to the power y
+     */
+    pow(x: MathType, y: number | BigNumber | Complex): MathType;
+
+    /**
+     * Round a value towards the nearest integer. For matrices, the function
+     * is evaluated element wise.
+     * @param x Number to be rounded
+     * @param n Number of decimals Default value: 0.
+     * @returns Rounded value of x
+     */
+    round<T extends number | BigNumber | Fraction | Complex | MathArray | Matrix>(
+        x: T,
+        n?: number | BigNumber | MathArray
+    ): NoLiteralType<T>;
+
+    /**
+     * Compute the sign of a value. The sign of a value x is: 1 when x > 1
+     * -1 when x < 0 0 when x == 0 For matrices, the function is evaluated
+     * element wise.
+     * @param x The number for which to determine the sign
+     * @returns The sign of x
+     */
+    sign(x: number): number;
+    sign(x: BigNumber): BigNumber;
+    sign(x: Fraction): Fraction;
+    sign(x: Complex): Complex;
+    sign(x: MathArray): MathArray;
+    sign(x: Matrix): Matrix;
+    sign(x: Unit): Unit;
+
+    /**
+     * Calculate the square root of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param x Value for which to calculate the square root
+     * @returns Returns the square root of x
+     */
+    sqrt(x: number): number;
+    sqrt(x: BigNumber): BigNumber;
+    sqrt(x: Complex): Complex;
+    sqrt(x: MathArray): MathArray;
+    sqrt(x: Matrix): Matrix;
+    sqrt(x: Unit): Unit;
+
+    /**
+     * Compute the square of a value, x * x. For matrices, the function is
+     * evaluated element wise.
+     * @param x Number for which to calculate the square
+     * @returns Squared value
+     */
+    square(x: number): number;
+    square(x: BigNumber): BigNumber;
+    square(x: Fraction): Fraction;
+    square(x: Complex): Complex;
+    square(x: MathArray): MathArray;
+    square(x: Matrix): Matrix;
+    square(x: Unit): Unit;
+
+    /**
+     * Subtract two values, x - y. For matrices, the function is evaluated
+     * element wise.
+     * @param x Initial value
+     * @param y Value to subtract from x
+     * @returns Subtraction of x and y
+     */
+    subtract<T extends MathType>(x: T, y: T): T;
+    subtract(x: MathType, y: MathType): MathType;
+
+    /**
+     * Inverse the sign of a value, apply a unary minus operation. For
+     * matrices, the function is evaluated element wise. Boolean values and
+     * strings will be converted to a number. For complex numbers, both real
+     * and complex value are inverted.
+     * @param x Number to be inverted
+     * @returns Retursn the value with inverted sign
+     */
+    unaryMinus(x: number): number;
+    unaryMinus(x: BigNumber): BigNumber;
+    unaryMinus(x: Fraction): Fraction;
+    unaryMinus(x: Complex): Complex;
+    unaryMinus(x: MathArray): MathArray;
+    unaryMinus(x: Matrix): Matrix;
+    unaryMinus(x: Unit): Unit;
+
+    /**
+     * Unary plus operation. Boolean values and strings will be converted to
+     * a number, numeric values will be returned as is. For matrices, the
+     * function is evaluated element wise.
+     * @param x Input value
+     * @returns Returns the input value when numeric, converts to a number
+     * when input is non-numeric.
+     */
+    unaryPlus(x: number): number;
+    unaryPlus(x: BigNumber): BigNumber;
+    unaryPlus(x: Fraction): Fraction;
+    unaryPlus(x: string): string;
+    unaryPlus(x: Complex): Complex;
+    unaryPlus(x: MathArray): MathArray;
+    unaryPlus(x: Matrix): Matrix;
+    unaryPlus(x: Unit): Unit;
+
+    /**
+     * Calculate the extended greatest common divisor for two values. See
+     * http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+     * @param a An integer number
+     * @param b An integer number
+     * @returns Returns an array containing 3 integers [div, m, n] where div
+     * = gcd(a, b) and a*m + b*n = div
+     */
+    xgcd(a: number | BigNumber, b: number | BigNumber): MathArray;
+
+    /*************************************************************************
+     * Bitwise functions
+     ************************************************************************/
+
+    /**
+     * Bitwise AND two values, x & y. For matrices, the function is
+     * evaluated element wise.
+     * @param x First value to and
+     * @param y Second value to and
+     * @returns AND of x and y
+     */
+    bitAnd<T extends number | BigNumber | MathArray | Matrix>(x: T, y: number | BigNumber | MathArray | Matrix): NoLiteralType<T>;
+
+    /**
+     * Bitwise NOT value, ~x. For matrices, the function is evaluated
+     * element wise. For units, the function is evaluated on the best prefix
+     * base.
+     * @param x Value to not
+     * @returns NOT of x
+     */
+    bitNot(x: number): number;
+    bitNot(x: BigNumber): BigNumber;
+    bitNot(x: MathArray): MathArray;
+    bitNot(x: Matrix): Matrix;
+
+    /**
+     * Bitwise OR two values, x | y. For matrices, the function is evaluated
+     * element wise. For units, the function is evaluated on the lowest
+     * print base.
+     * @param x First value to or
+     * @param y Second value to or
+     * @returns OR of x and y
+     */
+    bitOr(x: number, y: number): number;
+    bitOr(x: BigNumber, y: BigNumber): BigNumber;
+    bitOr(x: MathArray, y: MathArray): MathArray;
+    bitOr(x: Matrix, y: Matrix): Matrix;
+
+    /**
+     * Bitwise XOR two values, x ^ y. For matrices, the function is
+     * evaluated element wise.
+     * @param x First value to xor
+     * @param y Second value to xor
+     * @returns XOR of x and y
+     */
+    bitXor<T extends number | BigNumber | MathArray | Matrix>(x: T, y: number | BigNumber | MathArray | Matrix): NoLiteralType<T>;
+
+    /**
+     * Bitwise left logical shift of a value x by y number of bits, x << y.
+     * For matrices, the function is evaluated element wise. For units, the
+     * function is evaluated on the best prefix base.
+     * @param x Value to be shifted
+     * @param y Amount of shifts
+     * @returns x shifted left y times
+     */
+    leftShift<T extends number | BigNumber | MathArray | Matrix>(x: T, y: number | BigNumber): NoLiteralType<T>;
+
+    /**
+     * Bitwise right arithmetic shift of a value x by y number of bits, x >>
+     * y. For matrices, the function is evaluated element wise. For units,
+     * the function is evaluated on the best prefix base.
+     * @param x Value to be shifted
+     * @param y Amount of shifts
+     * @returns x sign-filled shifted right y times
+     */
+    rightArithShift<T extends number | BigNumber | MathArray | Matrix>(x: T, y: number | BigNumber): NoLiteralType<T>;
+
+    /**
+     * Bitwise right logical shift of value x by y number of bits, x >>> y.
+     * For matrices, the function is evaluated element wise. For units, the
+     * function is evaluated on the best prefix base.
+     * @param x Value to be shifted
+     * @param y Amount of shifts
+     * @returns x zero-filled shifted right y times
+     */
+    rightLogShift<T extends number | MathArray | Matrix>(x: T, y: number): NoLiteralType<T>;
+
+    /*************************************************************************
+     * Combinatorics functions
+     ************************************************************************/
+
+    /**
+     * The Bell Numbers count the number of partitions of a set. A partition
+     * is a pairwise disjoint subset of S whose union is S. bellNumbers only
+     * takes integer arguments. The following condition must be enforced: n
+     * >= 0
+     * @param n Total number of objects in the set
+     * @returns B(n)
+     */
+    bellNumbers(n: number): number;
+    bellNumbers(n: BigNumber): BigNumber;
+
+    /**
+     * The Catalan Numbers enumerate combinatorial structures of many
+     * different types. catalan only takes integer arguments. The following
+     * condition must be enforced: n >= 0
+     * @param n nth Catalan number
+     * @returns Cn(n)
+     */
+    catalan(n: number): number;
+    catalan(n: BigNumber): BigNumber;
+
+    /**
+     * The composition counts of n into k parts. Composition only takes
+     * integer arguments. The following condition must be enforced: k <= n.
+     * @param n Total number of objects in the set
+     * @param k Number of objects in the subset
+     * @returns Returns the composition counts of n into k parts.
+     */
+    composition<T extends number | BigNumber>(n: T, k: number | BigNumber): NoLiteralType<T>;
+
+    /**
+     * The Stirling numbers of the second kind, counts the number of ways to
+     * partition a set of n labelled objects into k nonempty unlabelled
+     * subsets. stirlingS2 only takes integer arguments. The following
+     * condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) =
+     * 1
+     * @param n Total number of objects in the set
+     * @param k Number of objects in the subset
+     * @returns S(n,k)
+     */
+    stirlingS2<T extends number | BigNumber>(n: T, k: number | BigNumber): NoLiteralType<T>;
+
+    /*************************************************************************
+     * Complex functions
+     ************************************************************************/
+
+    /**
+     * Compute the argument of a complex value. For a complex number a + bi,
+     * the argument is computed as atan2(b, a). For matrices, the function
+     * is evaluated element wise.
+     * @param x A complex number or array with complex numbers
+     * @returns The argument of x
+     */
+    arg(x: number | Complex): number;
+    arg(x: BigNumber | Complex): BigNumber;
+    arg(x: MathArray): MathArray;
+    arg(x: Matrix): Matrix;
+
+    /**
+     * Compute the complex conjugate of a complex value. If x = a+bi, the
+     * complex conjugate of x is a - bi. For matrices, the function is
+     * evaluated element wise.
+     * @param x A complex number or array with complex numbers
+     * @returns The complex conjugate of x
+     */
+    conj<T extends number | BigNumber | Complex | MathArray | Matrix>(x: T): NoLiteralType<T>;
+
+    /**
+     * Get the imaginary part of a complex number. For a complex number a +
+     * bi, the function returns b. For matrices, the function is evaluated
+     * element wise.
+     * @param x A complex number or array with complex numbers
+     * @returns The imaginary part of x
+     */
+    im(x: number | BigNumber | Complex | MathArray | Matrix): number | BigNumber | MathArray | Matrix;
+
+    /**
+     * Get the real part of a complex number. For a complex number a + bi,
+     * the function returns a. For matrices, the function is evaluated
+     * element wise.
+     * @param x A complex number or array of complex numbers
+     * @returns The real part of x
+     */
+    re(x: number | BigNumber | Complex | MathArray | Matrix): number | BigNumber | MathArray | Matrix;
+
+    /*************************************************************************
+     * Geometry functions
+     ************************************************************************/
+
+    /**
+     * Calculates: The eucledian distance between two points in 2 and 3
+     * dimensional spaces. Distance between point and a line in 2 and 3
+     * dimensional spaces. Pairwise distance between a set of 2D or 3D
+     * points NOTE: When substituting coefficients of a line(a, b and c),
+     * use ax + by + c = 0 instead of ax + by = c For parametric equation of
+     * a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b,
+     * c)
+     * @param x Coordinates of the first point
+     * @param y Coordinates of the second point
+     * @returns Returns the distance from two/three points
+     */
+    distance(x: MathArray | Matrix | object, y: MathArray | Matrix | object): number | BigNumber;
+
+    /**
+     * Calculates the point of intersection of two lines in two or three
+     * dimensions and of a line and a plane in three dimensions. The inputs
+     * are in the form of arrays or 1 dimensional matrices. The line
+     * intersection functions return null if the lines do not meet. Note:
+     * Fill the plane coefficients as x + y + z = c and not as x + y + z + c
+     * = 0.
+     * @param w Co-ordinates of first end-point of first line
+     * @param x Co-ordinates of second end-point of first line
+     * @param y Co-ordinates of first end-point of second line OR
+     * Coefficients of the plane's equation
+     * @param z Co-ordinates of second end-point of second line OR null if
+     * the calculation is for line and plane
+     * @returns Returns the point of intersection of lines/lines-planes
+     */
+    intersect(w: MathArray | Matrix, x: MathArray | Matrix, y: MathArray | Matrix, z: MathArray | Matrix): MathArray;
+
+    /*************************************************************************
+     * Logical functions
+     ************************************************************************/
+
+    /**
+     * Logical and. Test whether two values are both defined with a
+     * nonzero/nonempty value. For matrices, the function is evaluated
+     * element wise.
+     * @param x First value to and
+     * @param y Second value to and
+     * @returns Returns true when both inputs are defined with a
+     * nonzero/nonempty value.
+     */
+    and(
+        x: number | BigNumber | Complex | Unit | MathArray | Matrix,
+        y: number | BigNumber | Complex | Unit | MathArray | Matrix
+    ): boolean | MathArray | Matrix;
+
+    /**
+     * Logical not. Flips boolean value of a given parameter. For matrices,
+     * the function is evaluated element wise.
+     * @param x First value to not
+     * @returns Returns true when input is a zero or empty value.
+     */
+    not(x: number | BigNumber | Complex | Unit | MathArray | Matrix): boolean | MathArray | Matrix;
+
+    /**
+     * Logical or. Test if at least one value is defined with a
+     * nonzero/nonempty value. For matrices, the function is evaluated
+     * element wise.
+     * @param x First value to or
+     * @param y Second value to or
+     * @returns Returns true when one of the inputs is defined with a
+     * nonzero/nonempty value.
+     */
+    or(
+        x: number | BigNumber | Complex | Unit | MathArray | Matrix,
+        y: number | BigNumber | Complex | Unit | MathArray | Matrix
+    ): boolean | MathArray | Matrix;
+
+    /**
+     * Logical xor. Test whether one and only one value is defined with a
+     * nonzero/nonempty value. For matrices, the function is evaluated
+     * element wise.
+     * @param x First value to xor
+     * @param y Second value to xor
+     * @returns Returns true when one and only one input is defined with a
+     * nonzero/nonempty value.
+     */
+    xor(
+        x: number | BigNumber | Complex | Unit | MathArray | Matrix,
+        y: number | BigNumber | Complex | Unit | MathArray | Matrix
+    ): boolean | MathArray | Matrix;
+
+    /*************************************************************************
+     * Matrix functions
+     ************************************************************************/
+
+    /**
+     * Apply a function that maps an array to a scalar along a given axis of a
+     * matrix or array. Returns a new matrix or array with one less dimension
+     * than the input.
+     * @param array The input Matrix
+     * @param dim The dimension along which the callback is applied
+     * @param callback The callback function that is applied. This Function should take an
+     * array or 1-d matrix as an input and return a number.
+     * @returns The residual matrix with the function applied over some dimension.
+     */
+    apply<T extends MathArray | Matrix>(array: T, dim: number, callback: (array: MathArray | Matrix) => number): T
+
+
+    /**
+     * Concatenate two or more matrices. dim: number is a zero-based
+     * dimension over which to concatenate the matrices. By default the last
+     * dimension of the matrices.
+     * @param args Two or more matrices
+     * @returns Concatenated matrix
+     */
+    concat(...args: Array<MathArray | Matrix | number | BigNumber>): MathArray | Matrix;
+
+    /**
+     * Calculate the cross product for two vectors in three dimensional
+     * space. The cross product of A = [a1, a2, a3] and B =[b1, b2, b3] is
+     * defined as: cross(A, B) = [ a2 * b3 - a3 * b2, a3 * b1 - a1 * b3, a1
+     * * b2 - a2 * b1 ]
+     * @param x First vector
+     * @param y Second vector
+     * @returns Returns the cross product of x and y
+     */
+    cross(x: MathArray | Matrix, y: MathArray | Matrix): Matrix | MathArray;
+
+    /**
+     * Calculate the determinant of a matrix.
+     * @param x A Matrix
+     * @returns the determinant of x
+     */
+    det(x: MathArray | Matrix): number;
+
+    /**
+     * Create a diagonal matrix or retrieve the diagonal of a matrix. When x
+     * is a vector, a matrix with vector x on the diagonal will be returned.
+     * When x is a two dimensional matrix, the matrixes kth diagonal will be
+     * returned as vector. When k is positive, the values are placed on the
+     * super diagonal. When k is negative, the values are placed on the sub
+     * diagonal.
+     * @param X A two dimensional matrix or a vector
+     * @param k The diagonal where the vector will be filled in or
+     * retrieved. Default value: 0.
+     * @param format The matrix storage format. Default value: 'dense'.
+     * @returns Diagonal matrix from input vector, or diagonal from input
+     * matrix
+     */
+    diag(X: MathArray | Matrix, format?: string): Matrix;
+    diag(X: MathArray | Matrix, k: number | BigNumber, format?: string): Matrix | MathArray;
+
+    /**
+     * Calculate the dot product of two vectors. The dot product of A = [a1,
+     * a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as: dot(A,
+     * B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn
+     * @param x First vector
+     * @param y Second vector
+     * @returns Returns the dot product of x and y
+     */
+    dot(x: MathArray | Matrix, y: MathArray | Matrix): number;
+
+    /**
+     * Compute eigenvalues and eigenvectors of a matrix.
+     * The eigenvalues are sorted by their absolute value, ascending.
+     * An eigenvalue with multiplicity k will be listed k times.
+     * The eigenvectors are returned as columns of a matrix – the eigenvector
+     * that belongs to the j-th eigenvalue in the list (eg. values[j]) is the
+     * j-th column (eg. column(vectors, j)). If the algorithm fails to converge,
+     * it will throw an error – in that case, however, you may still find useful
+     * information in err.values and err.vectors
+     * @param x Matrix to be diagonalized
+     * @param prec Precision, default value: 1e-15
+     * @returns Object containing an array of eigenvalues and a matrix with eigenvectors as columns.
+     */
+    eigs(x: MathArray | Matrix, prec?:number|BigNumber): {values: MathArray | Matrix, vectors: MathArray | Matrix}
+
+    /**
+     * Compute the matrix exponential, expm(A) = e^A. The matrix must be
+     * square. Not to be confused with exp(a), which performs element-wise
+     * exponentiation. The exponential is calculated using the Padé
+     * approximant with scaling and squaring; see “Nineteen Dubious Ways to
+     * Compute the Exponential of a Matrix,” by Moler and Van Loan.
+     * @param x A square matrix
+     * @returns The exponential of x
+     */
+    expm(x: Matrix): Matrix;
+
+    /**
+     * Create a 2-dimensional identity matrix with size m x n or n x n. The
+     * matrix has ones on the diagonal and zeros elsewhere.
+     * @param size The size for the matrix
+     * @param format The Matrix storage format
+     * @returns A matrix with ones on the diagonal
+     */
+    identity(size: number | number[] | Matrix | MathArray, format?: string): Matrix | MathArray | number;
+    /**
+     * @param m The x dimension for the matrix
+     * @param n The y dimension for the matrix
+     * @param format The Matrix storage format
+     * @returns A matrix with ones on the diagonal
+     */
+    identity(m: number, n: number, format?: string): Matrix | MathArray | number;
+
+    /**
+     * Filter the items in an array or one dimensional matrix.
+     * @param x A one dimensional matrix or array to filter
+     * @param test A function or regular expression to test items. All
+     * entries for which test returns true are returned. When test is a
+     * function, it is invoked with three parameters: the value of the
+     * element, the index of the element, and the matrix/array being
+     * traversed. The function must return a boolean.
+     */
+    filter(
+        x: Matrix | MathArray | string[],
+        test: ((value: any, index: any, matrix: Matrix | MathArray | string[]) => boolean) | RegExp
+    ): Matrix | MathArray;
+
+    /**
+     * Flatten a multi dimensional matrix into a single dimensional matrix.
+     * @param x Matrix to be flattened
+     * @returns Returns the flattened matrix
+     */
+    flatten<T extends MathArray | Matrix>(x: T): T;
+
+    /**
+     * Iterate over all elements of a matrix/array, and executes the given
+     * callback function.
+     * @param x The matrix to iterate on.
+     * @param callback The callback function is invoked with three
+     * parameters: the value of the element, the index of the element, and
+     * the Matrix/array being traversed.
+     */
+    forEach<T extends Matrix | MathArray>(x: T, callback: (value: any, index: any, matrix: T) => void): void;
+
+    /**
+     * Calculate the inverse of a square matrix.
+     * @param x Matrix to be inversed
+     * @returns The inverse of x
+     */
+    inv<T extends number | Complex | MathArray | Matrix>(x: T): NoLiteralType<T>;
+
+    /**
+     * Calculate the kronecker product of two matrices or vectors
+     * @param x First vector
+     * @param y Second vector
+     * @returns Returns the kronecker product of x and y
+     */
+    kron(x: Matrix | MathArray, y: Matrix | MathArray): Matrix;
+
+    /**
+     * Iterate over all elements of a matrix/array, and executes the given
+     * callback function.
+     * @param x The matrix to iterate on.
+     * @param callback The callback function is invoked with three
+     * parameters: the value of the element, the index of the element, and
+     * the Matrix/array being traversed.
+     * @returns Transformed map of x
+     */
+    map<T extends Matrix | MathArray>(x: T, callback: (value: any, index: any, matrix: T) => MathType | string): T;
+
+    /**
+     * Create a matrix filled with ones. The created matrix can have one or
+     * multiple dimensions.
+     * @param size The size of each dimension of the matrix
+     * @param format The matrix storage format
+     * @returns A matrix filled with ones
+     */
+    ones(size: number | number[], format?: string): MathArray | Matrix;
+    /**
+     * @param m The x dimension of the matrix
+     * @param n The y dimension of the amtrix
+     * @param format The matrix storage format
+     * @returns A matrix filled with ones
+     */
+    ones(m: number, n: number, format?: string): MathArray | Matrix;
+
+    /**
+     * Partition-based selection of an array or 1D matrix. Will find the kth
+     * smallest value, and mutates the input array. Uses Quickselect.
+     * @param x A one dimensional matrix or array to sort
+     * @param k The kth smallest value to be retrieved; zero-based index
+     * @param compare  An optional comparator function. The function is
+     * called as compare(a, b), and must return 1 when a > b, -1 when a < b,
+     * and 0 when a == b. Default value: 'asc'.
+     * @returns Returns the kth lowest value.
+     */
+    partitionSelect(x: MathArray | Matrix, k: number, compare?: 'asc' | 'desc' | ((a: any, b: any) => number)): any;
+
+    /**
+     * Create an array from a range. By default, the range end is excluded.
+     * This can be customized by providing an extra parameter includeEnd.
+     * @param str A string 'start:end' or 'start:step:end'
+     * @param start Start of the range
+     * @param end End of the range, excluded by default, included when
+     * parameter includeEnd=true
+     * @param step Step size. Default value is 1.
+     * @param includeEnd: Option to specify whether to include the end or
+     * not. False by default
+     * @returns Parameters describing the ranges start, end, and optional
+     * step.
+     */
+    range(str: string, includeEnd?: boolean): Matrix;
+    range(start: number | BigNumber, end: number | BigNumber, includeEnd?: boolean): Matrix;
+    range(start: number | BigNumber, end: number | BigNumber, step: number | BigNumber, includeEnd?: boolean): Matrix;
+
+    /**
+     * Reshape a multi dimensional array to fit the specified dimensions
+     * @param x Matrix to be reshaped
+     * @param sizes One dimensional array with integral sizes for each
+     * dimension
+     * @returns A reshaped clone of matrix x
+     */
+    reshape<T extends MathArray | Matrix>(x: T, sizes: number[]): T;
+
+    /**
+     * Resize a matrix
+     * @param x Matrix to be resized
+     * @param size One dimensional array with numbers
+     * @param defaultValue Zero by default, except in case of a string, in
+     * that case defaultValue = ' ' Default value: 0.
+     * @returns A resized clone of matrix x
+     */
+    resize<T extends MathArray | Matrix>(x: T, size: MathArray | Matrix, defaultValue?: number | string): T;
+
+    /**
+     * Return a row from a Matrix.
+     * @param value An array or matrix
+     * @param row The index of the row
+     * @returns The retrieved row
+     */
+    row<T extends MathArray | Matrix>(
+        value: T,
+        row: number
+    ): T;
+
+    /**
+     * Return a column from a Matrix.
+     * @param value An array or matrix
+     * @param column The index of the column
+     * @returns The retrieved column
+     */
+    column<T extends MathArray | Matrix>(
+        value: T,
+        column: number
+    ): T;
+
+    /**
+     * Return a rotated matrix.
+     * @param {Array | Matrix} w                             Vector to rotate
+     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+     * @param {Array | Matrix} [v]                           Rotation axis
+     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w
+     */
+         rotate<T extends MathArray | Matrix>(
+          w: T,
+          theta: number | BigNumber | Complex | Unit,
+          v?: T
+      ): T;
+
+    /**
+     * Calculate the size of a matrix or scalar.
+     * @param A matrix
+     * @returns A vector with the size of x
+     */
+    size(x: boolean | number | Complex | Unit | string | MathArray | Matrix): MathArray | Matrix;
+
+    /**
+     * Sort the items in a matrix
+     * @param x A one dimensional matrix or array to sort
+     * @param compare An optional _comparator function or name. The function
+     * is called as compare(a, b), and must return 1 when a > b, -1 when a <
+     * b, and 0 when a == b. Default value: ‘asc’
+     * @returns Returns the sorted matrix
+     */
+    sort<T extends Matrix | MathArray>(x: T, compare: ((a: any, b: any) => number) | 'asc' | 'desc' | 'natural'): T;
+
+    /**
+     * Calculate the principal square root of a square matrix. The principal
+     * square root matrix X of another matrix A is such that X * X = A.
+     * @param A The square matrix A
+     * @returns The principal square root of matrix A
+     */
+    sqrtm<T extends MathArray | Matrix>(A: T): T;
+
+    /**
+     * Squeeze a matrix, remove inner and outer singleton dimensions from a
+     * matrix.
+     * @param x Matrix to be squeezed
+     * @returns Squeezed matrix
+     */
+    squeeze<T extends MathArray | Matrix>(x: T): T;
+
+    /**
+     * Get or set a subset of a matrix or string.
+     * @param value An array, matrix, or string
+     * @param index For each dimension, an index or list of indices to get or set.
+     * @param replacement An array, matrix, or scalar. If provided, the
+     * subset is replaced with replacement. If not provided, the subset is
+     * returned
+     * @param defaultValue Default value, filled in on new entries when the
+     * matrix is resized. If not provided, math.matrix elements will be left
+     * undefined. Default value: undefined.
+     * @returns Either the retrieved subset or the updated matrix
+     */
+    subset<T extends MathArray | Matrix | string>(value: T, index: Index, replacement?: any, defaultValue?: any): T;
+
+    /**
+     * Calculate the trace of a matrix: the sum of the elements on the main
+     * diagonal of a square matrix.
+     * @param x A matrix
+     * @returns The trace of x
+     */
+    trace(x: MathArray | Matrix): number;
+
+    /**
+     * Transpose a matrix. All values of the matrix are reflected over its
+     * main diagonal. Only two dimensional matrices are supported.
+     * @param x Matrix to be transposed
+     * @returns The transposed matrix
+     */
+    transpose<T extends MathArray | Matrix>(x: T): T;
+
+    /**
+     * Create a matrix filled with zeros. The created matrix can have one or
+     * multiple dimensions.
+     * @param size The size of each dimension of the matrix
+     * @param format The matrix storage format
+     * @returns A matrix filled with zeros
+     */
+    zeros(size: number | number[], format?: string): MathArray | Matrix;
+    /**
+     * @param m The x dimension of the matrix
+     * @param n The y dimension of the matrix
+     * @param format The matrix storage format
+     * @returns A matrix filled with zeros
+     */
+    zeros(m: number, n: number, format?: string): MathArray | Matrix;
+
+    /*************************************************************************
+     * Probability functions
+     ************************************************************************/
+
+    /**
+     * Compute the number of ways of picking k unordered outcomes from n
+     * possibilities. Combinations only takes integer arguments. The
+     * following condition must be enforced: k <= n.
+     * @param n Total number of objects in the set
+     * @param k Number of objects in the subset
+     * @returns Number of possible combinations
+     */
+    combinations<T extends number | BigNumber>(n: T, k: number | BigNumber): NoLiteralType<T>;
+
+    /**
+     * Compute the factorial of a value Factorial only supports an integer
+     * value as argument. For matrices, the function is evaluated element
+     * wise.
+     * @param n An integer number
+     * @returns The factorial of n
+     */
+    factorial<T extends number | BigNumber | MathArray | Matrix>(n: T): NoLiteralType<T>;
+
+    /**
+     * Compute the gamma function of a value using Lanczos approximation for
+     * small values, and an extended Stirling approximation for large
+     * values. For matrices, the function is evaluated element wise.
+     * @param n A real or complex number
+     * @returns The gamma of n
+     */
+    gamma<T extends number | BigNumber | Complex | MathArray | Matrix>(n: T): NoLiteralType<T>;
+
+    /**
+     * Calculate the Kullback-Leibler (KL) divergence between two
+     * distributions
+     * @param q First vector
+     * @param p Second vector
+     * @returns Returns disance between q and p
+     */
+    kldivergence(q: MathArray | Matrix, p: MathArray | Matrix): number;
+
+    /**
+     * Multinomial Coefficients compute the number of ways of picking a1,
+     * a2, ..., ai unordered outcomes from n possibilities. multinomial
+     * takes one array of integers as an argument. The following condition
+     * must be enforced: every ai <= 0
+     * @param a Integer number of objects in the subset
+     * @returns multinomial coefficent
+     */
+    multinomial<T extends number | BigNumber>(a: T[]): NoLiteralType<T>;
+
+    /**
+     * Compute the number of ways of obtaining an ordered subset of k
+     * elements from a set of n elements. Permutations only takes integer
+     * arguments. The following condition must be enforced: k <= n.
+     * @param n The number of objects in total
+     * @param k The number of objects in the subset
+     * @returns The number of permutations
+     */
+    permutations<T extends number | BigNumber>(n: T, k?: number | BigNumber): NoLiteralType<T>;
+
+    /**
+     * Random pick a value from a one dimensional array. Array element is
+     * picked using a random function with uniform distribution.
+     * @param array A one dimensional array
+     * @param number An int or float
+     * @param weights An array of ints or floats
+     * @returns Returns a single random value from array when number is 1 or
+     * undefined. Returns an array with the configured number of elements
+     * when number is > 1.
+     */
+    pickRandom(array: number[], number?: number, weights?: number[]): number | number[];
+
+    /**
+     * Return a random number larger or equal to min and smaller than max
+     * using a uniform distribution.
+     * @param size If provided, an array or matrix with given size and
+     * filled with random values is returned
+     * @param min Minimum boundary for the random value, included
+     * @param max Maximum boundary for the random value, excluded
+     * @returns A random number
+     */
+    random(min?: number, max?: number): number;
+    random<T extends MathArray | Matrix>(size: T, min?: number, max?: number): T;
+
+    /**
+     * Return a random integer number larger or equal to min and smaller
+     * than max using a uniform distribution.
+     * @param size If provided, an array or matrix with given size and
+     * filled with random values is returned
+     * @param min Minimum boundary for the random value, included
+     * @param max Maximum boundary for the random value, excluded
+     * @returns A random number
+     */
+    randomInt(min: number, max?: number): number;
+    randomInt<T extends MathArray | Matrix>(size: T, min?: number, max?: number): T;
+
+    /*************************************************************************
+     * Relational functions
+     ************************************************************************/
+
+    /**
+     * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x
+     * == y. x and y are considered equal when the relative difference
+     * between x and y is smaller than the configured epsilon. The function
+     * cannot be used to compare values smaller than approximately 2.22e-16.
+     * For matrices, the function is evaluated element wise.
+     * @param x First value to compare
+     * @param y Second value to compare
+     * @returns Returns the result of the comparison: 1 when x > y, -1 when
+     * x < y, and 0 when x == y.
+     */
+    compare(x: MathType | string, y: MathType | string): number | BigNumber | Fraction | MathArray | Matrix;
+
+    /**
+     * Compare two values of any type in a deterministic, natural way. For
+     * numeric values, the function works the same as math.compare. For
+     * types of values that can’t be compared mathematically, the function
+     * compares in a natural way.
+     * @param x First value to compare
+     * @param y Second value to compare
+     * @returns Returns the result of the comparison: 1 when x > y, -1 when
+     * x < y, and 0 when x == y.
+     */
+    compareNatural(x: any, y: any): number;
+
+    /**
+     * Compare two strings lexically. Comparison is case sensitive. Returns
+     * 1 when x > y, -1 when x < y, and 0 when x == y. For matrices, the
+     * function is evaluated element wise.
+     * @param x First string to compare
+     * @param y Second string to compare
+     * @returns Returns the result of the comparison: 1 when x > y, -1 when
+     * x < y, and 0 when x == y.
+     */
+    compareText(x: string | MathArray | Matrix, y: string | MathArray | Matrix): number | MathArray | Matrix;
+
+    /**
+     * Test element wise whether two matrices are equal. The function
+     * accepts both matrices and scalar values.
+     * @param x First matrix to compare
+     * @param y Second amtrix to compare
+     * @returns Returns true when the input matrices have the same size and
+     * each of their elements is equal.
+     */
+    deepEqual(x: MathType, y: MathType): number | BigNumber | Fraction | Complex | Unit | MathArray | Matrix;
+
+    /**
+     * Test whether two values are equal.
+     *
+     * The function tests whether the relative difference between x and y is
+     * smaller than the configured epsilon. The function cannot be used to
+     * compare values smaller than approximately 2.22e-16. For matrices, the
+     * function is evaluated element wise. In case of complex numbers, x.re
+     * must equal y.re, and x.im must equal y.im. Values null and undefined
+     * are compared strictly, thus null is only equal to null and nothing
+     * else, and undefined is only equal to undefined and nothing else.
+     * @param x First value to compare
+     * @param y Second value to compare
+     * @returns Returns true when the compared values are equal, else
+     * returns false
+     */
+    equal(x: MathType | string, y: MathType | string): boolean | MathArray | Matrix;
+
+    /**
+     * Check equality of two strings. Comparison is case sensitive. For
+     * matrices, the function is evaluated element wise.
+     * @param x First string to compare
+     * @param y Second string to compare
+     * @returns Returns true if the values are equal, and false if not.
+     */
+    equalText(x: string | MathArray | Matrix, y: string | MathArray | Matrix): number | MathArray | Matrix;
+
+    /**
+     * Test whether value x is larger than y. The function returns true when
+     * x is larger than y and the relative difference between x and y is
+     * larger than the configured epsilon. The function cannot be used to
+     * compare values smaller than approximately 2.22e-16. For matrices, the
+     * function is evaluated element wise.
+     * @param x First value to compare
+     * @param y Second value to vcompare
+     * @returns Returns true when x is larger than y, else returns false
+     */
+    larger(x: MathType | string, y: MathType | string): boolean | MathArray | Matrix;
+
+    /**
+     * Test whether value x is larger or equal to y. The function returns
+     * true when x is larger than y or the relative difference between x and
+     * y is smaller than the configured epsilon. The function cannot be used
+     * to compare values smaller than approximately 2.22e-16. For matrices,
+     * the function is evaluated element wise.
+     * @param x First value to compare
+     * @param y Second value to vcompare
+     * @returns Returns true when x is larger than or equal to y, else
+     * returns false
+     */
+    largerEq(x: MathType | string, y: MathType | string): boolean | MathArray | Matrix;
+
+    /**
+     * Test whether value x is smaller than y. The function returns true
+     * when x is smaller than y and the relative difference between x and y
+     * is smaller than the configured epsilon. The function cannot be used
+     * to compare values smaller than approximately 2.22e-16. For matrices,
+     * the function is evaluated element wise.
+     * @param x First value to compare
+     * @param y Second value to vcompare
+     * @returns Returns true when x is smaller than y, else returns false
+     */
+    smaller(x: MathType | string, y: MathType | string): boolean | MathArray | Matrix;
+
+    /**
+     * Test whether value x is smaller or equal to y. The function returns
+     * true when x is smaller than y or the relative difference between x
+     * and y is smaller than the configured epsilon. The function cannot be
+     * used to compare values smaller than approximately 2.22e-16. For
+     * matrices, the function is evaluated element wise.
+     * @param x First value to compare
+     * @param y Second value to vcompare
+     * @returns Returns true when x is smaller than or equal to y, else
+     * returns false
+     */
+    smallerEq(x: MathType | string, y: MathType | string): boolean | MathArray | Matrix;
+
+    /**
+     * Test whether two values are unequal. The function tests whether the
+     * relative difference between x and y is larger than the configured
+     * epsilon. The function cannot be used to compare values smaller than
+     * approximately 2.22e-16. For matrices, the function is evaluated
+     * element wise. In case of complex numbers, x.re must unequal y.re, or
+     * x.im must unequal y.im. Values null and undefined are compared
+     * strictly, thus null is unequal with everything except null, and
+     * undefined is unequal with everything except undefined.
+     * @param x First value to compare
+     * @param y Second value to vcompare
+     * @returns Returns true when the compared values are unequal, else
+     * returns false
+     */
+    unequal(x: MathType | string, y: MathType | string): boolean | MathArray | Matrix;
+
+    /*************************************************************************
+     * Set functions
+     ************************************************************************/
+
+    /**
+     * Create the cartesian product of two (multi)sets. Multi-dimension
+     * arrays will be converted to single-dimension arrays and the values
+     * will be sorted in ascending order before the operation.
+     * @param a1 A (multi)set
+     * @param a2 A (multi)set
+     * @returns The cartesian product of two (multi)sets
+     */
+    setCartesian<T extends MathArray | Matrix>(a1: T, a2: MathArray | Matrix): T;
+
+    /**
+     * Create the difference of two (multi)sets: every element of set1, that
+     * is not the element of set2. Multi-dimension arrays will be converted
+     * to single-dimension arrays before the operation
+     * @param a1 A (multi)set
+     * @param a2 A (multi)set
+     * @returns The difference of two (multi)sets
+     */
+    setDifference<T extends MathArray | Matrix>(a1: T, a2: MathArray | Matrix): T;
+
+    /**
+     * Collect the distinct elements of a multiset. A multi-dimension array
+     * will be converted to a single-dimension array before the operation.
+     * @param a A multiset
+     * @returns A set containing the distinct elements of the multiset
+     */
+    setDistinct<T extends MathArray | Matrix>(a: T): T;
+
+    /**
+     * Create the intersection of two (multi)sets. Multi-dimension arrays
+     * will be converted to single-dimension arrays before the operation.
+     * @param a1 A (multi)set
+     * @param a2 A (multi)set
+     * @returns The intersection of two (multi)sets
+     */
+    setIntersect<T extends MathArray | Matrix>(a1: T, a2: MathArray | Matrix): T;
+
+    /**
+     * Check whether a (multi)set is a subset of another (multi)set. (Every
+     * element of set1 is the element of set2.) Multi-dimension arrays will
+     * be converted to single-dimension arrays before the operation.
+     * @param a1 A (multi)set
+     * @param a2 A (multi)set
+     * @returns True if a1 is subset of a2, else false
+     */
+    setIsSubset(a1: MathArray | Matrix, a2: MathArray | Matrix): boolean;
+
+    /**
+     * Count the multiplicity of an element in a multiset. A multi-dimension
+     * array will be converted to a single-dimension array before the
+     * operation.
+     * @param e An element in the multiset
+     * @param a A multiset
+     * @returns The number of how many times the multiset contains the
+     * element
+     */
+    setMultiplicity(e: number | BigNumber | Fraction | Complex, a: MathArray | Matrix): number;
+
+    /**
+     * Create the powerset of a (multi)set. (The powerset contains very
+     * possible subsets of a (multi)set.) A multi-dimension array will be
+     * converted to a single-dimension array before the operation.
+     * @param a A multiset
+     * @returns The powerset of the (multi)set
+     */
+    setPowerset<T extends MathArray | Matrix>(a: T): T;
+
+    /**
+     * Count the number of elements of a (multi)set. When a second parameter
+     * is ‘true’, count only the unique values. A multi-dimension array will
+     * be converted to a single-dimension array before the operation.
+     * @param a A multiset
+     * @returns The number of elements of the (multi)set
+     */
+    setSize(a: MathArray | Matrix): number;
+
+    /**
+     * Create the symmetric difference of two (multi)sets. Multi-dimension
+     * arrays will be converted to single-dimension arrays before the
+     * operation.
+     * @param a1 A (multi)set
+     * @param a2 A (multi)set
+     * @returns The symmetric difference of two (multi)sets
+     */
+    setSymDifference<T extends MathArray | Matrix>(a1: T, a2: MathArray | Matrix): T;
+
+    /**
+     * Create the union of two (multi)sets. Multi-dimension arrays will be
+     * converted to single-dimension arrays before the operation.
+     * @param a1 A (multi)set
+     * @param a2 A (multi)set
+     * @returns The union of two (multi)sets
+     */
+    setUnion<T extends MathArray | Matrix>(a1: T, a2: MathArray | Matrix): T;
+
+    /*************************************************************************
+     * Special functions
+     ************************************************************************/
+
+    /**
+     * Compute the erf function of a value using a rational Chebyshev
+     * approximations for different intervals of x.
+     * @param x A real number
+     * @returns The erf of x
+     */
+    erf<T extends number | MathArray | Matrix>(x: T): NoLiteralType<T>;
+
+    /*************************************************************************
+     * Statistics functions
+     ************************************************************************/
+
+    /**
+     * Compute the median absolute deviation of a matrix or a list with
+     * values. The median absolute deviation is defined as the median of the
+     * absolute deviations from the median.
+     * @param array A single matrix or multiple scalar values.
+     * @returns The median absolute deviation
+     */
+    mad(array: MathArray | Matrix): any;
+
+    /**
+     * Compute the maximum value of a matrix or a list with values. In case
+     * of a multi dimensional array, the maximum of the flattened array will
+     * be calculated. When dim is provided, the maximum over the selected
+     * dimension will be calculated. Parameter dim is zero-based.
+     * @param args A single matrix or multiple scalar values
+     * @returns The maximum value
+     */
+    max(...args: MathType[]): any;
+    /**
+     * @param A A single matrix
+     * @param dim The maximum over the selected dimension
+     * @returns The maximum value
+     */
+    max(A: MathArray | Matrix, dim?: number): any;
+
+    /**
+     * Compute the mean value of matrix or a list with values. In case of a
+     * multi dimensional array, the mean of the flattened array will be
+     * calculated. When dim is provided, the maximum over the selected
+     * dimension will be calculated. Parameter dim is zero-based.
+     * @param args A single matrix or multiple scalar values
+     * @returns The mean of all values
+     */
+    mean(...args: MathType[]): any;
+    /**
+     * @param A A single matrix
+     * @param dim The mean over the selected dimension
+     * @returns The mean of all values
+     */
+    mean(A: MathArray | Matrix, dim?: number): any;
+
+    /**
+     * Compute the median of a matrix or a list with values. The values are
+     * sorted and the middle value is returned. In case of an even number of
+     * values, the average of the two middle values is returned. Supported
+     * types of values are: Number, BigNumber, Unit In case of a (multi
+     * dimensional) array or matrix, the median of all elements will be
+     * calculated.
+     * @param args A single matrix or or multiple scalar values
+     * @returns The median
+     */
+    median(...args: MathType[]): any;
+
+    /**
+     * Compute the maximum value of a matrix or a list of values. In case of
+     * a multi dimensional array, the maximum of the flattened array will be
+     * calculated. When dim is provided, the maximum over the selected
+     * dimension will be calculated. Parameter dim is zero-based.
+     * @param args A single matrix or or multiple scalar values
+     * @returns The minimum value
+     */
+    min(...args: MathType[]): any;
+    /**
+     * @param A A single matrix
+     * @param dim The minimum over the selected dimension
+     * @returns The minimum value
+     */
+    min(A: MathArray | Matrix, dim?: number): any;
+
+    /**
+     * Computes the mode of a set of numbers or a list with values(numbers
+     * or characters). If there are more than one modes, it returns a list
+     * of those values.
+     * @param args A single matrix
+     * @returns The mode of all values
+     */
+    mode(...args: MathType[]): any;
+
+    /**
+     * Compute the product of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the sum of all elements will be
+     * calculated.
+     * @param args A single matrix or multiple scalar values
+     * @returns The product of all values
+     */
+    prod(...args: MathType[]): any;
+
+    /**
+     * Compute the prob order quantile of a matrix or a list with values.
+     * The sequence is sorted and the middle value is returned. Supported
+     * types of sequence values are: Number, BigNumber, Unit Supported types
+     * of probability are: Number, BigNumber In case of a (multi
+     * dimensional) array or matrix, the prob order quantile of all elements
+     * will be calculated.
+     * @param A A single matrix or array
+     * @param probOrN prob is the order of the quantile, while N is the
+     * amount of evenly distributed steps of probabilities; only one of
+     * these options can be provided
+     * @param sorted =false is data sorted in ascending order
+     * @returns Quantile(s)
+     */
+    quantileSeq(A: MathArray | Matrix, prob: number | BigNumber | MathArray, sorted?: boolean): number | BigNumber | Unit | MathArray;
+
+    /**
+     * Compute the standard deviation of a matrix or a list with values. The
+     * standard deviations is defined as the square root of the variance:
+     * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+     * matrix, the standard deviation over all elements will be calculated.
+     * Optionally, the type of normalization can be specified as second
+     * parameter. The parameter normalization can be one of the following
+     * values: 'unbiased' (default) The sum of squared errors is divided by
+     * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+     * 'biased' The sum of squared errors is divided by (n + 1)
+     * @param a variadic argument of number to calculate standard deviation
+     * @returns The standard deviation array
+     */
+    std(...values: number[]): number
+    /**
+     * Compute the standard deviation of a matrix or a list with values. The
+     * standard deviations is defined as the square root of the variance:
+     * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+     * matrix, the standard deviation over all elements will be calculated.
+     * Optionally, the type of normalization can be specified as second
+     * parameter. The parameter normalization can be one of the following
+     * values: 'unbiased' (default) The sum of squared errors is divided by
+     * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+     * 'biased' The sum of squared errors is divided by (n + 1)
+     * @param array A single matrix to compute standard deviation.
+     * @param dimension A dimension to calculate standard deviation
+     * @param normalization Determines how to normalize the variance. Choose
+     * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+     * ‘unbiased’.
+     * @returns The standard deviation array
+     */
+    std(array: MathArray | Matrix, dimension?: number, normalization?: 'unbiased' | 'uncorrected' | 'biased'): number[]
+    /**
+     * Compute the standard deviation of a matrix or a list with values. The
+     * standard deviations is defined as the square root of the variance:
+     * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+     * matrix, the standard deviation over all elements will be calculated.
+     * Optionally, the type of normalization can be specified as second
+     * parameter. The parameter normalization can be one of the following
+     * values: 'unbiased' (default) The sum of squared errors is divided by
+     * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+     * 'biased' The sum of squared errors is divided by (n + 1)
+     * @param array A single matrix or multiple scalar values
+     * @param normalization Determines how to normalize the variance. Choose
+     * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+     * ‘unbiased’.
+     * @returns The standard deviation
+     */
+    std(array: MathArray | Matrix, normalization: 'unbiased' | 'uncorrected' | 'biased'): number
+
+    /**
+     * Compute the sum of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the sum of all elements will be
+     * calculated.
+     * @param args A single matrix or multiple scalar values
+     * @returns The sum of all values
+     */
+    sum(...args: Array<number | BigNumber | Fraction>): any;
+    /**
+     * @param array A single matrix
+     * @returns The sum of all values
+     */
+    sum(array: MathArray | Matrix): any;
+
+    /**
+     * Compute the cumulative sum of a matrix or a list with values.
+     * In case of a (multi dimensional) array or matrix, the cumulative sums
+     * along a specified dimension (defaulting to the first) will be calculated.
+     * @param args A single matrix or multiple scalar values
+     * @returns The cumulative sums of the the values.
+     */
+    cumsum(...args: MathType[]): MathType[];
+    /**
+     * @param array A single matrix
+     * @param dim The dimension along which to sum (defaults to 0)
+     * @returns The cumulative sums along the given dimension
+     */
+    cumsum(array: MathArray | Matrix, dim?: number): MathArray | Matrix;
+
+    /**
+     * Compute the variance of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the variance over all elements
+     * will be calculated. Optionally, the type of normalization can be
+     * specified as second parameter. The parameter normalization can be one
+     * of the following values: 'unbiased' (default) The sum of squared
+     * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+     * is divided by n 'biased' The sum of squared errors is divided by (n +
+     * 1) Note that older browser may not like the variable name var. In
+     * that case, the function can be called as math['var'](...) instead of
+     * math.variance(...).
+     * @param args A single matrix or multiple scalar values
+     * @returns The variance
+     */
+    variance(...args: Array<number | BigNumber | Fraction>): number;
+    /**
+     * Compute the variance of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the variance over all elements
+     * will be calculated. Optionally, the type of normalization can be
+     * specified as second parameter. The parameter normalization can be one
+     * of the following values: 'unbiased' (default) The sum of squared
+     * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+     * is divided by n 'biased' The sum of squared errors is divided by (n +
+     * 1) Note that older browser may not like the variable name var. In
+     * that case, the function can be called as math['var'](...) instead of
+     * math.variance(...).
+     * @param array A matrix to compute variance.
+     * @param dimension A dimension to compute variance on
+     * @param normalization normalization Determines how to normalize the
+     * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+     * Default value: ‘unbiased’.
+     * @returns variance matrix.
+     */
+    variance(array: MathArray | Matrix, dimension?: number, normalization?: 'unbiased' | 'uncorrected' | 'biased'): number[];
+    /**
+     * @param array A single matrix
+     * @param normalization normalization Determines how to normalize the
+     * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+     * Default value: ‘unbiased’.
+     * @returns The variance
+     */
+    variance(array: MathArray | Matrix, normalization: 'unbiased' | 'uncorrected' | 'biased'): number;
+
+    /*************************************************************************
+     * String functions
+     ************************************************************************/
+
+    /**
+     * Format a value of any type into a string.
+     * @param value The value to be formatted
+     * @param options An object with formatting options.
+     * @param callback A custom formatting function, invoked for all numeric
+     * elements in value, for example all elements of a matrix, or the real
+     * and imaginary parts of a complex number. This callback can be used to
+     * override the built-in numeric notation with any type of formatting.
+     * Function callback is called with value as parameter and must return a
+     * string.
+     * @see http://mathjs.org/docs/reference/functions/format.html
+     * @returns The formatted value
+     */
+    format(value: any, options?: FormatOptions | number | ((item: any) => string), callback?: (value: any) => string): string;
+
+    /**
+     * Interpolate values into a string template.
+     * @param template A string containing variable placeholders.
+     * @param values An object containing variables which will be filled in
+     * in the template.
+     * @param precision Number of digits to format numbers. If not provided,
+     * the value will not be rounded.
+     * @param options Formatting options, or the number of digits to format
+     * numbers. See function math.format for a description of all options.
+     * @returns Interpolated string
+     */
+    print(template: string, values: any, precision?: number, options?: number | object): void;
+
+    /*************************************************************************
+     * Trigonometry functions
+     ************************************************************************/
+
+    /**
+     * Calculate the inverse cosine of a value. For matrices, the function
+     * is evaluated element wise.
+     * @param x Function input
+     * @returns The arc cosine of x
+     */
+    acos(x: number): number;
+    acos(x: BigNumber): BigNumber;
+    acos(x: Complex): Complex;
+    acos(x: MathArray): MathArray;
+    acos(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic arccos of a value, defined as acosh(x) =
+     * ln(sqrt(x^2 - 1) + x). For matrices, the function is evaluated
+     * element wise.
+     * @param x Function input
+     * @returns The hyperbolic arccosine of x
+     */
+    acosh(x: number): number;
+    acosh(x: BigNumber): BigNumber;
+    acosh(x: Complex): Complex;
+    acosh(x: MathArray): MathArray;
+    acosh(x: Matrix): Matrix;
+
+    /**
+     * Calculate the inverse cotangent of a value. For matrices, the
+     * function is evaluated element wise.
+     * @param x Function input
+     * @returns The arc cotangent of x
+     */
+    acot(x: number): number;
+    acot(x: BigNumber): BigNumber;
+    acot(x: MathArray): MathArray;
+    acot(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic arccotangent of a value, defined as acoth(x)
+     * = (ln((x+1)/x) + ln(x/(x-1))) / 2. For matrices, the function is
+     * evaluated element wise.
+     * @param x Function input
+     * @returns The hyperbolic arccotangent of x
+     */
+    acoth(x: number): number;
+    acoth(x: BigNumber): BigNumber;
+    acoth(x: MathArray): MathArray;
+    acoth(x: Matrix): Matrix;
+
+    /**
+     * Calculate the inverse cosecant of a value. For matrices, the function
+     * is evaluated element wise.
+     * @param x Function input
+     * @returns The arc cosecant of x
+     */
+    acsc(x: number): number;
+    acsc(x: BigNumber): BigNumber;
+    acsc(x: MathArray): MathArray;
+    acsc(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic arccosecant of a value, defined as acsch(x)
+     * = ln(1/x + sqrt(1/x^2 + 1)). For matrices, the function is evaluated
+     * element wise.
+     * @param x Function input
+     * @returns The hyperbolic arccosecant of x
+     */
+    acsch(x: number): number;
+    acsch(x: BigNumber): BigNumber;
+    acsch(x: MathArray): MathArray;
+    acsch(x: Matrix): Matrix;
+
+    /**
+     * Calculate the inverse secant of a value. For matrices, the function
+     * is evaluated element wise.
+     * @param x Function input
+     * @returns The arc secant of x
+     */
+    asec(x: number): number;
+    asec(x: BigNumber): BigNumber;
+    asec(x: MathArray): MathArray;
+    asec(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic arcsecant of a value, defined as asech(x) =
+     * ln(sqrt(1/x^2 - 1) + 1/x). For matrices, the function is evaluated
+     * element wise.
+     * @param x Function input
+     * @returns The hyperbolic arcsecant of x
+     */
+    asech(x: number): number;
+    asech(x: BigNumber): BigNumber;
+    asech(x: MathArray): MathArray;
+    asech(x: Matrix): Matrix;
+
+    /**
+     * Calculate the inverse sine of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param x Function input
+     * @returns The arc sine of x
+     */
+    asin(x: number): number;
+    asin(x: BigNumber): BigNumber;
+    asin(x: Complex): Complex;
+    asin(x: MathArray): MathArray;
+    asin(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic arcsine of a value, defined as asinh(x) =
+     * ln(x + sqrt(x^2 + 1)). For matrices, the function is evaluated
+     * element wise.
+     * @param x Function input
+     * @returns The hyperbolic arcsine of x
+     */
+    asinh(x: number): number;
+    asinh(x: BigNumber): BigNumber;
+    asinh(x: MathArray): MathArray;
+    asinh(x: Matrix): Matrix;
+
+    /**
+     * Calculate the inverse tangent of a value. For matrices, the function
+     * is evaluated element wise.
+     * @param x Function input
+     * @returns The arc tangent of x
+     */
+    atan(x: number): number;
+    atan(x: BigNumber): BigNumber;
+    atan(x: MathArray): MathArray;
+    atan(x: Matrix): Matrix;
+
+    /**
+     * Calculate the inverse tangent function with two arguments, y/x. By
+     * providing two arguments, the right quadrant of the computed angle can
+     * be determined. For matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns Four quadrant inverse tangent
+     */
+    atan2(y: number, x: number): number;
+    atan2(y: MathArray | Matrix, x: MathArray | Matrix): MathArray | Matrix;
+
+    /**
+     * Calculate the hyperbolic arctangent of a value, defined as atanh(x) =
+     * ln((1 + x)/(1 - x)) / 2. For matrices, the function is evaluated
+     * element wise.
+     * @param x Function input
+     * @returns The hyperbolic arctangent of x
+     */
+    atanh(x: number): number;
+    atanh(x: BigNumber): BigNumber;
+    atanh(x: MathArray): MathArray;
+    atanh(x: Matrix): Matrix;
+
+    /**
+     * Calculate the cosine of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param x Function input
+     * @returns The cosine of x
+     */
+    cos(x: number | Unit): number;
+    cos(x: BigNumber): BigNumber;
+    cos(x: Complex): Complex;
+    cos(x: MathArray): MathArray;
+    cos(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic cosine of a value, defined as cosh(x) = 1/2
+     * * (exp(x) + exp(-x)). For matrices, the function is evaluated element
+     * wise.
+     * @param x Function input
+     * @returns The hyperbolic cosine of x
+     */
+    cosh(x: number | Unit): number;
+    cosh(x: BigNumber): BigNumber;
+    cosh(x: Complex): Complex;
+    cosh(x: MathArray): MathArray;
+    cosh(x: Matrix): Matrix;
+
+    /**
+     * Calculate the cotangent of a value. cot(x) is defined as 1 / tan(x).
+     * For matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns The cotangent of x
+     */
+    cot(x: number | Unit): number;
+    cot(x: Complex): Complex;
+    cot(x: MathArray): MathArray;
+    cot(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic cotangent of a value, defined as coth(x) = 1
+     * / tanh(x). For matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns The hyperbolic cotangent of x
+     */
+    coth(x: number | Unit): number;
+    coth(x: Complex): Complex;
+    coth(x: MathArray): MathArray;
+    coth(x: Matrix): Matrix;
+
+    /**
+     * Calculate the cosecant of a value, defined as csc(x) = 1/sin(x). For
+     * matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns The cosecant hof x
+     */
+    csc(x: number | Unit): number;
+    csc(x: Complex): Complex;
+    csc(x: MathArray): MathArray;
+    csc(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic cosecant of a value, defined as csch(x) = 1
+     * / sinh(x). For matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns The hyperbolic cosecant of x
+     */
+    csch(x: number | Unit): number;
+    csch(x: Complex): Complex;
+    csch(x: MathArray): MathArray;
+    csch(x: Matrix): Matrix;
+
+    /**
+     * Calculate the secant of a value, defined as sec(x) = 1/cos(x). For
+     * matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns The secant of x
+     */
+    sec(x: number | Unit): number;
+    sec(x: Complex): Complex;
+    sec(x: MathArray): MathArray;
+    sec(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic secant of a value, defined as sech(x) = 1 /
+     * cosh(x). For matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns The hyperbolic secant of x
+     */
+    sech(x: number | Unit): number;
+    sech(x: Complex): Complex;
+    sech(x: MathArray): MathArray;
+    sech(x: Matrix): Matrix;
+
+    /**
+     * Calculate the sine of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param x Function input
+     * @returns The sine of x
+     */
+    sin(x: number | Unit): number;
+    sin(x: BigNumber): BigNumber;
+    sin(x: Complex): Complex;
+    sin(x: MathArray): MathArray;
+    sin(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic sine of a value, defined as sinh(x) = 1/2 *
+     * (exp(x) - exp(-x)). For matrices, the function is evaluated element
+     * wise.
+     * @param x Function input
+     * @returns The hyperbolic sine of x
+     */
+    sinh(x: number | Unit): number;
+    sinh(x: BigNumber): BigNumber;
+    sinh(x: Complex): Complex;
+    sinh(x: MathArray): MathArray;
+    sinh(x: Matrix): Matrix;
+
+    /**
+     * Calculate the tangent of a value. tan(x) is equal to sin(x) / cos(x).
+     * For matrices, the function is evaluated element wise.
+     * @param x Function input
+     * @returns The tangent of x
+     */
+    tan(x: number | Unit): number;
+    tan(x: BigNumber): BigNumber;
+    tan(x: Complex): Complex;
+    tan(x: MathArray): MathArray;
+    tan(x: Matrix): Matrix;
+
+    /**
+     * Calculate the hyperbolic tangent of a value, defined as tanh(x) =
+     * (exp(2 * x) - 1) / (exp(2 * x) + 1). For matrices, the function is
+     * evaluated element wise.
+     * @param x Function input
+     * @returns The hyperbolic tangent of x
+     */
+    tanh(x: number | Unit): number;
+    tanh(x: BigNumber): BigNumber;
+    tanh(x: Complex): Complex;
+    tanh(x: MathArray): MathArray;
+    tanh(x: Matrix): Matrix;
+
+    /*************************************************************************
+     * Unit functions
+     ************************************************************************/
+
+    /**
+     * Change the unit of a value. For matrices, the function is evaluated
+     * element wise.
+     * @param x The unit to be converted.
+     * @param unit New unit. Can be a string like "cm" or a unit without
+     * value.
+     * @returns Value with changed, fixed unit
+     */
+    to(x: Unit | MathArray | Matrix, unit: Unit | string): Unit | MathArray | Matrix;
+
+    /*************************************************************************
+     * Utils
+     ************************************************************************/
+     isNumber(x: unknown): x is number;
+
+     isBigNumber(x: unknown): x is BigNumber;
+
+     isComplex(x: unknown): x is Complex;
+
+     isFraction(x: unknown): x is Fraction;
+
+     isUnit(x: unknown): x is Unit;
+
+     isString(x: unknown): x is string;
+
+     isArray: ArrayConstructor['isArray'];
+
+     isMatrix(x: unknown): x is Matrix;
+
+     isCollection(x: unknown): x is (Matrix | any[]);
+
+     isDenseMatrix(x: unknown): x is Matrix;
+
+     isSparseMatrix(x: unknown): x is Matrix;
+
+     isRange(x: unknown): boolean;
+
+     isIndex(x: unknown): x is Index;
+
+     isBoolean(x: unknown): x is boolean;
+
+     isResultSet(x: unknown): boolean;
+
+     isHelp(x: unknown): x is Help;
+
+     isFunction(x: unknown): boolean;
+
+     isDate(x: unknown): x is Date;
+
+     isRegExp(x: unknown): x is RegExp;
+
+     isObject(x: unknown): boolean;
+
+     isNull(x: unknown): x is null;
+
+     isUndefined(x: unknown): x is undefined;
+
+     isAccessorNode(x: unknown): x is AccessorNode;
+
+     isArrayNode(x: unknown): x is ArrayNode;
+
+     isAssignmentNode(x: unknown): x is AssignmentNode;
+
+     isBlockNode(x: unknown): x is BlockNode;
+
+     isConditionalNode(x: unknown): x is ConditionalNode;
+
+     isConstantNode(x: unknown): x is ConstantNode;
+
+     isFunctionAssignmentNode(x: unknown): x is FunctionAssignmentNode;
+
+     isFunctionNode(x: unknown): x is FunctionNode;
+
+     isIndexNode(x: unknown): x is IndexNode;
+
+     isNode(x: unknown): x is MathNodeCommon;
+
+     isObjectNode(x: unknown): x is ObjectNode;
+
+     isOperatorNode(x: unknown): x is OperatorNode;
+
+     isParenthesisNode(x: unknown): x is ParenthesisNode;
+
+     isRangeNode(x: unknown): x is RangeNode;
+
+     isSymbolNode(x: unknown): x is SymbolNode;
+
+     isChain(x: unknown): x is MathJsChain;
+
+    /*************************************************************************
+     * Functions -> Utils
+     ************************************************************************/
+
+    /**
+     * Clone an object.
+     * @param x Object to be cloned
+     * @returns A clone of object x
+     */
+    clone(x: any): any;
+
+    /**
+     * Test whether a value is an numeric value. In case of a string,
+     *  true is returned if the string contains a numeric value.
+     * @param x Value to be tested
+     * @returns Returns true when x is a number, BigNumber, Fraction, Boolean, or a String containing number.
+     * Returns false for other types.
+     * Throws an error in case of unknown types.
+     */
+    hasNumericValue(x: any ): boolean| boolean[];
+
+    /**
+     * Test whether a value is an integer number. The function supports
+     * number, BigNumber, and Fraction. The function is evaluated
+     * element-wise in case of Array or Matrix input.
+     * @param x Value to be tested
+     * @returns Returns true when x contains a numeric, integer value.
+     * Throws an error in case of an unknown data type.
+     */
+    isInteger(x: number | BigNumber | Fraction | MathArray | Matrix): boolean;
+
+    /**
+     * Test whether a value is NaN (not a number). The function supports
+     * types number, BigNumber, Fraction, Unit and Complex. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     * @param x Value to be tested
+     * @returns Returns true when x is NaN. Throws an error in case of an
+     * unknown data type.
+     */
+    isNaN(x: number | BigNumber | Fraction | MathArray | Matrix | Unit): boolean;
+
+    /**
+     * Test whether a value is negative: smaller than zero. The function
+     * supports types number, BigNumber, Fraction, and Unit. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     * @param x Value to be tested
+     * @returns Returns true when x is larger than zero. Throws an error in
+     * case of an unknown data type.
+     */
+    isNegative(x: number | BigNumber | Fraction | MathArray | Matrix | Unit): boolean;
+
+    /**
+     * Test whether a value is an numeric value. The function is evaluated
+     * element-wise in case of Array or Matrix input.
+     * @param x Value to be tested
+     * @returns Returns true when x is a number, BigNumber, Fraction, or
+     * boolean. Returns false for other types. Throws an error in case of
+     * unknown types.
+     */
+    isNumeric(x: any): x is number | BigNumber | Fraction | boolean;
+
+    /**
+     * Test whether a value is positive: larger than zero. The function
+     * supports types number, BigNumber, Fraction, and Unit. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     * @param x Value to be tested
+     * @returns Returns true when x is larger than zero. Throws an error in
+     * case of an unknown data type.
+     */
+    isPositive(x: number | BigNumber | Fraction | MathArray | Matrix | Unit): boolean;
+
+    /**
+     * Test whether a value is prime: has no divisors other than itself and
+     * one. The function supports type number, bignumber. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     * @param x Value to be tested
+     * @returns Returns true when x is larger than zero. Throws an error in
+     * case of an unknown data type.
+     */
+    isPrime(x: number | BigNumber | MathArray | Matrix): boolean;
+
+    /**
+     * Test whether a value is zero. The function can check for zero for
+     * types number, BigNumber, Fraction, Complex, and Unit. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     * @param x Value to be tested
+     * @returns Returns true when x is zero. Throws an error in case of an
+     * unknown data type.
+     */
+    isZero(x: number | BigNumber | Fraction | MathArray | Matrix | Unit | Complex): boolean;
+
+    /**
+     * Determine the type of a variable.
+     * @param x The variable for which to test the type
+     * @returns Returns the name of the type. Primitive types are lower
+     * case, non-primitive types are upper-camel-case. For example ‘number’,
+     * ‘string’, ‘Array’, ‘Date’.
+     */
+    typeOf(x: any): string;
+
+    /**
+     * Import functions from an object or a module
+     * To avoid errors when using one of the imported functions extend module like this:
+     *
+     * @example
+     * // imported_math_functions.ts
+     * declare module 'mathjs' {
+     *      interface MathJsStatic {
+     *          hello(a: number): number;
+     *      }
+     * }
+     *
+     * @param object An object with functions to be imported.
+     * @param options An object with import options.
+     */
+    import(object: ImportObject | ImportObject[], options: ImportOptions): void;
+  }
+
+  /*************************************************************************
+   * Factory and Dependencies
+   ************************************************************************/
+  interface FactoryDependencies {
+    create: (factories: FactoryFunctionMap, config?: ConfigOptions) => MathJsStatic;
+    factory: <T>(
+        name: string,
+        dependencies: MathJsFunctionName[],
+        create: (injected: Partial<MathJsStatic>) => T,
+        meta?: any
+    ) => FactoryFunction<T>;
+    all: FactoryFunctionMap;
+
+    typedDependencies: FactoryFunctionMap;
+    ResultSetDependencies: FactoryFunctionMap;
+    BigNumberDependencies: FactoryFunctionMap;
+    ComplexDependencies: FactoryFunctionMap;
+    FractionDependencies: FactoryFunctionMap;
+    RangeDependencies: FactoryFunctionMap;
+    MatrixDependencies: FactoryFunctionMap;
+    DenseMatrixDependencies: FactoryFunctionMap;
+    cloneDependencies: FactoryFunctionMap;
+    isIntegerDependencies: FactoryFunctionMap;
+    isNegativeDependencies: FactoryFunctionMap;
+    isNumericDependencies: FactoryFunctionMap;
+    hasNumericValueDependencies: FactoryFunctionMap;
+    isPositiveDependencies: FactoryFunctionMap;
+    isZeroDependencies: FactoryFunctionMap;
+    isNaNDependencies: FactoryFunctionMap;
+    typeOfDependencies: FactoryFunctionMap;
+    typeofDependencies: FactoryFunctionMap;
+    equalScalarDependencies: FactoryFunctionMap;
+    SparseMatrixDependencies: FactoryFunctionMap;
+    numberDependencies: FactoryFunctionMap;
+    stringDependencies: FactoryFunctionMap;
+    booleanDependencies: FactoryFunctionMap;
+    bignumberDependencies: FactoryFunctionMap;
+    complexDependencies: FactoryFunctionMap;
+    fractionDependencies: FactoryFunctionMap;
+    matrixDependencies: FactoryFunctionMap;
+    splitUnitDependencies: FactoryFunctionMap;
+    unaryMinusDependencies: FactoryFunctionMap;
+    unaryPlusDependencies: FactoryFunctionMap;
+    absDependencies: FactoryFunctionMap;
+    applyDependencies: FactoryFunctionMap;
+    addScalarDependencies: FactoryFunctionMap;
+    cbrtDependencies: FactoryFunctionMap;
+    ceilDependencies: FactoryFunctionMap;
+    cubeDependencies: FactoryFunctionMap;
+    expDependencies: FactoryFunctionMap;
+    expm1Dependencies: FactoryFunctionMap;
+    fixDependencies: FactoryFunctionMap;
+    floorDependencies: FactoryFunctionMap;
+    gcdDependencies: FactoryFunctionMap;
+    lcmDependencies: FactoryFunctionMap;
+    log10Dependencies: FactoryFunctionMap;
+    log2Dependencies: FactoryFunctionMap;
+    modDependencies: FactoryFunctionMap;
+    multiplyScalarDependencies: FactoryFunctionMap;
+    multiplyDependencies: FactoryFunctionMap;
+    nthRootDependencies: FactoryFunctionMap;
+    signDependencies: FactoryFunctionMap;
+    sqrtDependencies: FactoryFunctionMap;
+    squareDependencies: FactoryFunctionMap;
+    subtractDependencies: FactoryFunctionMap;
+    xgcdDependencies: FactoryFunctionMap;
+    dotMultiplyDependencies: FactoryFunctionMap;
+    bitAndDependencies: FactoryFunctionMap;
+    bitNotDependencies: FactoryFunctionMap;
+    bitOrDependencies: FactoryFunctionMap;
+    bitXorDependencies: FactoryFunctionMap;
+    argDependencies: FactoryFunctionMap;
+    conjDependencies: FactoryFunctionMap;
+    imDependencies: FactoryFunctionMap;
+    reDependencies: FactoryFunctionMap;
+    notDependencies: FactoryFunctionMap;
+    orDependencies: FactoryFunctionMap;
+    xorDependencies: FactoryFunctionMap;
+    concatDependencies: FactoryFunctionMap;
+    columnDependencies: FactoryFunctionMap;
+    crossDependencies: FactoryFunctionMap;
+    diagDependencies: FactoryFunctionMap;
+    eyeDependencies: FactoryFunctionMap;
+    filterDependencies: FactoryFunctionMap;
+    flattenDependencies: FactoryFunctionMap;
+    forEachDependencies: FactoryFunctionMap;
+    getMatrixDataTypeDependencies: FactoryFunctionMap;
+    identityDependencies: FactoryFunctionMap;
+    kronDependencies: FactoryFunctionMap;
+    mapDependencies: FactoryFunctionMap;
+    onesDependencies: FactoryFunctionMap;
+    rangeDependencies: FactoryFunctionMap;
+    reshapeDependencies: FactoryFunctionMap;
+    resizeDependencies: FactoryFunctionMap;
+    rowDependencies: FactoryFunctionMap;
+    sizeDependencies: FactoryFunctionMap;
+    squeezeDependencies: FactoryFunctionMap;
+    subsetDependencies: FactoryFunctionMap;
+    transposeDependencies: FactoryFunctionMap;
+    ctransposeDependencies: FactoryFunctionMap;
+    zerosDependencies: FactoryFunctionMap;
+    erfDependencies: FactoryFunctionMap;
+    modeDependencies: FactoryFunctionMap;
+    prodDependencies: FactoryFunctionMap;
+    formatDependencies: FactoryFunctionMap;
+    printDependencies: FactoryFunctionMap;
+    toDependencies: FactoryFunctionMap;
+    isPrimeDependencies: FactoryFunctionMap;
+    numericDependencies: FactoryFunctionMap;
+    divideScalarDependencies: FactoryFunctionMap;
+    powDependencies: FactoryFunctionMap;
+    roundDependencies: FactoryFunctionMap;
+    logDependencies: FactoryFunctionMap;
+    log1pDependencies: FactoryFunctionMap;
+    nthRootsDependencies: FactoryFunctionMap;
+    dotPowDependencies: FactoryFunctionMap;
+    dotDivideDependencies: FactoryFunctionMap;
+    lsolveDependencies: FactoryFunctionMap;
+    usolveDependencies: FactoryFunctionMap;
+    leftShiftDependencies: FactoryFunctionMap;
+    rightArithShiftDependencies: FactoryFunctionMap;
+    rightLogShiftDependencies: FactoryFunctionMap;
+    andDependencies: FactoryFunctionMap;
+    compareDependencies: FactoryFunctionMap;
+    compareNaturalDependencies: FactoryFunctionMap;
+    compareTextDependencies: FactoryFunctionMap;
+    equalDependencies: FactoryFunctionMap;
+    equalTextDependencies: FactoryFunctionMap;
+    smallerDependencies: FactoryFunctionMap;
+    smallerEqDependencies: FactoryFunctionMap;
+    largerDependencies: FactoryFunctionMap;
+    largerEqDependencies: FactoryFunctionMap;
+    deepEqualDependencies: FactoryFunctionMap;
+    unequalDependencies: FactoryFunctionMap;
+    partitionSelectDependencies: FactoryFunctionMap;
+    sortDependencies: FactoryFunctionMap;
+    maxDependencies: FactoryFunctionMap;
+    minDependencies: FactoryFunctionMap;
+    ImmutableDenseMatrixDependencies: FactoryFunctionMap;
+    IndexDependencies: FactoryFunctionMap;
+    FibonacciHeapDependencies: FactoryFunctionMap;
+    SpaDependencies: FactoryFunctionMap;
+    UnitDependencies: FactoryFunctionMap;
+    unitDependencies: FactoryFunctionMap;
+    sparseDependencies: FactoryFunctionMap;
+    createUnitDependencies: FactoryFunctionMap;
+    acosDependencies: FactoryFunctionMap;
+    acoshDependencies: FactoryFunctionMap;
+    acotDependencies: FactoryFunctionMap;
+    acothDependencies: FactoryFunctionMap;
+    acscDependencies: FactoryFunctionMap;
+    acschDependencies: FactoryFunctionMap;
+    asecDependencies: FactoryFunctionMap;
+    asechDependencies: FactoryFunctionMap;
+    asinDependencies: FactoryFunctionMap;
+    asinhDependencies: FactoryFunctionMap;
+    atanDependencies: FactoryFunctionMap;
+    atan2Dependencies: FactoryFunctionMap;
+    atanhDependencies: FactoryFunctionMap;
+    cosDependencies: FactoryFunctionMap;
+    coshDependencies: FactoryFunctionMap;
+    cotDependencies: FactoryFunctionMap;
+    cothDependencies: FactoryFunctionMap;
+    cscDependencies: FactoryFunctionMap;
+    cschDependencies: FactoryFunctionMap;
+    secDependencies: FactoryFunctionMap;
+    sechDependencies: FactoryFunctionMap;
+    sinDependencies: FactoryFunctionMap;
+    sinhDependencies: FactoryFunctionMap;
+    tanDependencies: FactoryFunctionMap;
+    tanhDependencies: FactoryFunctionMap;
+    setCartesianDependencies: FactoryFunctionMap;
+    setDifferenceDependencies: FactoryFunctionMap;
+    setDistinctDependencies: FactoryFunctionMap;
+    setIntersectDependencies: FactoryFunctionMap;
+    setIsSubsetDependencies: FactoryFunctionMap;
+    setMultiplicityDependencies: FactoryFunctionMap;
+    setPowersetDependencies: FactoryFunctionMap;
+    setSizeDependencies: FactoryFunctionMap;
+    setSymDifferenceDependencies: FactoryFunctionMap;
+    setUnionDependencies: FactoryFunctionMap;
+    addDependencies: FactoryFunctionMap;
+    hypotDependencies: FactoryFunctionMap;
+    normDependencies: FactoryFunctionMap;
+    dotDependencies: FactoryFunctionMap;
+    traceDependencies: FactoryFunctionMap;
+    indexDependencies: FactoryFunctionMap;
+    NodeDependencies: FactoryFunctionMap;
+    AccessorNodeDependencies: FactoryFunctionMap;
+    ArrayNodeDependencies: FactoryFunctionMap;
+    AssignmentNodeDependencies: FactoryFunctionMap;
+    BlockNodeDependencies: FactoryFunctionMap;
+    ConditionalNodeDependencies: FactoryFunctionMap;
+    ConstantNodeDependencies: FactoryFunctionMap;
+    FunctionAssignmentNodeDependencies: FactoryFunctionMap;
+    IndexNodeDependencies: FactoryFunctionMap;
+    ObjectNodeDependencies: FactoryFunctionMap;
+    OperatorNodeDependencies: FactoryFunctionMap;
+    ParenthesisNodeDependencies: FactoryFunctionMap;
+    RangeNodeDependencies: FactoryFunctionMap;
+    RelationalNodeDependencies: FactoryFunctionMap;
+    SymbolNodeDependencies: FactoryFunctionMap;
+    FunctionNodeDependencies: FactoryFunctionMap;
+    parseDependencies: FactoryFunctionMap;
+    compileDependencies: FactoryFunctionMap;
+    evaluateDependencies: FactoryFunctionMap;
+    evalDependencies: FactoryFunctionMap;
+    ParserDependencies: FactoryFunctionMap;
+    parserDependencies: FactoryFunctionMap;
+    lupDependencies: FactoryFunctionMap;
+    qrDependencies: FactoryFunctionMap;
+    sluDependencies: FactoryFunctionMap;
+    lusolveDependencies: FactoryFunctionMap;
+    HelpDependencies: FactoryFunctionMap;
+    ChainDependencies: FactoryFunctionMap;
+    helpDependencies: FactoryFunctionMap;
+    chainDependencies: FactoryFunctionMap;
+    detDependencies: FactoryFunctionMap;
+    invDependencies: FactoryFunctionMap;
+    expmDependencies: FactoryFunctionMap;
+    sqrtmDependencies: FactoryFunctionMap;
+    divideDependencies: FactoryFunctionMap;
+    distanceDependencies: FactoryFunctionMap;
+    intersectDependencies: FactoryFunctionMap;
+    sumDependencies: FactoryFunctionMap;
+    meanDependencies: FactoryFunctionMap;
+    medianDependencies: FactoryFunctionMap;
+    madDependencies: FactoryFunctionMap;
+    varianceDependencies: FactoryFunctionMap;
+    varDependencies: FactoryFunctionMap;
+    quantileSeqDependencies: FactoryFunctionMap;
+    stdDependencies: FactoryFunctionMap;
+    combinationsDependencies: FactoryFunctionMap;
+    gammaDependencies: FactoryFunctionMap;
+    factorialDependencies: FactoryFunctionMap;
+    kldivergenceDependencies: FactoryFunctionMap;
+    multinomialDependencies: FactoryFunctionMap;
+    permutationsDependencies: FactoryFunctionMap;
+    pickRandomDependencies: FactoryFunctionMap;
+    randomDependencies: FactoryFunctionMap;
+    randomIntDependencies: FactoryFunctionMap;
+    stirlingS2Dependencies: FactoryFunctionMap;
+    bellNumbersDependencies: FactoryFunctionMap;
+    catalanDependencies: FactoryFunctionMap;
+    compositionDependencies: FactoryFunctionMap;
+    simplifyDependencies: FactoryFunctionMap;
+    derivativeDependencies: FactoryFunctionMap;
+    rationalizeDependencies: FactoryFunctionMap;
+    reviverDependencies: FactoryFunctionMap;
+    eDependencies: FactoryFunctionMap;
+    EDependencies: FactoryFunctionMap;
+    falseDependencies: FactoryFunctionMap;
+    iDependencies: FactoryFunctionMap;
+    InfinityDependencies: FactoryFunctionMap;
+    LN10Dependencies: FactoryFunctionMap;
+    LN2Dependencies: FactoryFunctionMap;
+    LOG10EDependencies: FactoryFunctionMap;
+    LOG2EDependencies: FactoryFunctionMap;
+    NaNDependencies: FactoryFunctionMap;
+    nullDependencies: FactoryFunctionMap;
+    phiDependencies: FactoryFunctionMap;
+    piDependencies: FactoryFunctionMap;
+    PIDependencies: FactoryFunctionMap;
+    SQRT1_2Dependencies: FactoryFunctionMap;
+    SQRT2Dependencies: FactoryFunctionMap;
+    tauDependencies: FactoryFunctionMap;
+    trueDependencies: FactoryFunctionMap;
+    versionDependencies: FactoryFunctionMap;
+    atomicMassDependencies: FactoryFunctionMap;
+    avogadroDependencies: FactoryFunctionMap;
+    bohrMagnetonDependencies: FactoryFunctionMap;
+    bohrRadiusDependencies: FactoryFunctionMap;
+    boltzmannDependencies: FactoryFunctionMap;
+    classicalElectronRadiusDependencies: FactoryFunctionMap;
+    conductanceQuantumDependencies: FactoryFunctionMap;
+    coulombDependencies: FactoryFunctionMap;
+    deuteronMassDependencies: FactoryFunctionMap;
+    efimovFactorDependencies: FactoryFunctionMap;
+    electricConstantDependencies: FactoryFunctionMap;
+    electronMassDependencies: FactoryFunctionMap;
+    elementaryChargeDependencies: FactoryFunctionMap;
+    faradayDependencies: FactoryFunctionMap;
+    fermiCouplingDependencies: FactoryFunctionMap;
+    fineStructureDependencies: FactoryFunctionMap;
+    firstRadiationDependencies: FactoryFunctionMap;
+    gasConstantDependencies: FactoryFunctionMap;
+    gravitationConstantDependencies: FactoryFunctionMap;
+    gravityDependencies: FactoryFunctionMap;
+    hartreeEnergyDependencies: FactoryFunctionMap;
+    inverseConductanceQuantumDependencies: FactoryFunctionMap;
+    klitzingDependencies: FactoryFunctionMap;
+    loschmidtDependencies: FactoryFunctionMap;
+    magneticConstantDependencies: FactoryFunctionMap;
+    magneticFluxQuantumDependencies: FactoryFunctionMap;
+    molarMassDependencies: FactoryFunctionMap;
+    molarMassC12Dependencies: FactoryFunctionMap;
+    molarPlanckConstantDependencies: FactoryFunctionMap;
+    molarVolumeDependencies: FactoryFunctionMap;
+    neutronMassDependencies: FactoryFunctionMap;
+    nuclearMagnetonDependencies: FactoryFunctionMap;
+    planckChargeDependencies: FactoryFunctionMap;
+    planckConstantDependencies: FactoryFunctionMap;
+    planckLengthDependencies: FactoryFunctionMap;
+    planckMassDependencies: FactoryFunctionMap;
+    planckTemperatureDependencies: FactoryFunctionMap;
+    planckTimeDependencies: FactoryFunctionMap;
+    protonMassDependencies: FactoryFunctionMap;
+    quantumOfCirculationDependencies: FactoryFunctionMap;
+    reducedPlanckConstantDependencies: FactoryFunctionMap;
+    rydbergDependencies: FactoryFunctionMap;
+    sackurTetrodeDependencies: FactoryFunctionMap;
+    secondRadiationDependencies: FactoryFunctionMap;
+    speedOfLightDependencies: FactoryFunctionMap;
+    stefanBoltzmannDependencies: FactoryFunctionMap;
+    thomsonCrossSectionDependencies: FactoryFunctionMap;
+    vacuumImpedanceDependencies: FactoryFunctionMap;
+    weakMixingAngleDependencies: FactoryFunctionMap;
+    wienDisplacementDependencies: FactoryFunctionMap;
+    applyTransformDependencies: FactoryFunctionMap;
+    columnTransformDependencies: FactoryFunctionMap;
+    filterTransformDependencies: FactoryFunctionMap;
+    forEachTransformDependencies: FactoryFunctionMap;
+    indexTransformDependencies: FactoryFunctionMap;
+    mapTransformDependencies: FactoryFunctionMap;
+    maxTransformDependencies: FactoryFunctionMap;
+    meanTransformDependencies: FactoryFunctionMap;
+    minTransformDependencies: FactoryFunctionMap;
+    rangeTransformDependencies: FactoryFunctionMap;
+    rowTransformDependencies: FactoryFunctionMap;
+    subsetTransformDependencies: FactoryFunctionMap;
+    concatTransformDependencies: FactoryFunctionMap;
+    stdTransformDependencies: FactoryFunctionMap;
+    sumTransformDependencies: FactoryFunctionMap;
+    varianceTransformDependencies: FactoryFunctionMap;
+  }
+
+  interface Matrix {
+    type: string;
+    storage(): string;
+    datatype(): string;
+    create(data: MathArray, datatype?: string): void;
+    density(): number;
+    subset(index: Index, replacement?: any, defaultValue?: any): Matrix;
+    apply(dim: number, callback: (array: MathArray | Matrix) => number): Matrix | MathArray;
+    get(index: number[]): any;
+    set(index: number[], value: any, defaultValue?: number | string): Matrix;
+    resize(size: MathArray | Matrix, defaultValue?: number | string): Matrix;
+    clone(): Matrix;
+    size(): number[];
+    map(callback: (a: any, b: number, c: Matrix) => any, skipZeros?: boolean): Matrix;
+    forEach(callback: (a: any, b: number, c: Matrix) => void, skipZeros?: boolean): void;
+    toArray(): MathArray;
+    valueOf(): MathArray;
+    format(options?: FormatOptions | number | ((value: any) => string)): string;
+    toString(): string;
+    toJSON(): any;
+    diagonal(k?: number | BigNumber): any[];
+    swapRows(i: number, j: number): Matrix;
+  }
+
+  interface MatrixCtor {
+    new(): Matrix;
+  }
+
+  interface BigNumber extends Decimal {} // tslint:disable-line no-empty-interface
+
+  interface Fraction {
+    s: number;
+    n: number;
+    d: number;
+  }
+
+  interface Complex {
+    re: number;
+    im: number;
+    clone(): Complex;
+    equals(other: Complex): boolean;
+    format(precision?: number): string;
+    fromJSON(json: object): Complex;
+    fromPolar(polar: object): Complex;
+    fromPolar(r: number, phi: number): Complex;
+    toJSON(): object;
+    toPolar(): PolarCoordinates;
+    toString(): string;
+    compare(a: Complex, b: Complex): number;
+  }
+
+  interface PolarCoordinates {
+    r: number;
+    phi: number;
+  }
+
+  interface MathJSON {
+    mathjs?: string;
+    value: number;
+    unit: string;
+    fixPrefix?: boolean;
+  }
+
+  interface UnitComponent {
+    power: number;
+    prefix: string;
+    unit: {
+      name: string;
+      base: {
+        dimensions: number[];
+        key: string;
+      };
+      prefixes: Record<string, UnitPrefix>;
+      value: number;
+      offset: number;
+      dimensions: number[];
+    };
+  }
+
+  interface UnitPrefix {
+    name: string;
+    value: number;
+    scientific: boolean;
+  }
+
+  interface Unit {
+    valueOf(): string;
+    clone(): Unit;
+    hasBase(base: any): boolean;
+    equalBase(unit: Unit): boolean;
+    equals(unit: Unit): boolean;
+    multiply(unit: Unit): Unit;
+    divide(unit: Unit): Unit;
+    pow(unit: Unit): Unit;
+    abs(unit: Unit): Unit;
+    to(unit: string): Unit;
+    toNumber(unit?: string): number;
+    toNumeric(unit?: string): number | Fraction | BigNumber;
+    toSI(): Unit;
+    toString(): string;
+    toJSON(): MathJSON;
+    formatUnits(): string;
+    format(options: FormatOptions): string;
+    simplify(): Unit;
+    splitUnit(parts: ReadonlyArray<string | Unit>): Unit[];
+
+    units: UnitComponent[];
+    dimensions: number[];
+    value: number;
+    fixPrefix: boolean;
+    skipAutomaticSimplification: true;
+  }
+
+  interface CreateUnitOptions {
+    prefixes?: 'none' | 'short' | 'long' | 'binary_short' | 'binary_long';
+    aliases?: string[];
+    offset?: number;
+    override?: boolean;
+  }
+
+  interface SimplifyOptions {
+    /** A boolean which is `true` by default. */
+    exactFractions?: boolean;
+    /**
+     * When `exactFractions` is true, a fraction will be returned only
+     * when both numerator and denominator are smaller than `fractionsLimit`.
+     * Default value is 10000.
+     */
+    fractionsLimit?: number;
+  }
+
+  type SimplifyRule = { l: string; r: string } | string | ((node: MathNode) => MathNode);
+
+  interface Simplify {
+    (
+        expr: MathNode | string,
+        rules?: SimplifyRule[],
+        scope?: object,
+        options?: SimplifyOptions,
+    ): MathNode;
+    (
+        expr: MathNode | string,
+        scope?: object,
+        options?: SimplifyOptions,
+    ): MathNode;
+
+    rules: SimplifyRule[];
+  }
+
+  interface UnitDefinition {
+    definition?: string | Unit;
+    prefixes?: string;
+    offset?: number;
+    aliases?: string[];
+  }
+
+  interface Index {} // tslint:disable-line no-empty-interface
+
+  interface EvalFunction {
+    evaluate(scope?: any): any;
+  }
+
+  interface MathNodeCommon {
+    isNode: true;
+    comment: string;
+    type: 'AccessorNode' | 'ArrayNode' | 'AssignmentNode' | 'BlockNode' | 'ConditionalNode' | 'ConstantNode' |
+        'FunctionAssignmentNode' | 'FunctionNode' | 'IndexNode' | 'ObjectNode' | 'OperatorNode' | 'ParenthesisNode' |
+        'RangeNode' | 'RelationalNode' | 'SymbolNode';
+
+    isUpdateNode?: boolean;
+
+    /**
+     * Create a shallow clone of the node. The node itself is cloned, its
+     * childs are not cloned.
+     */
+    clone(): MathNode;
+    /**
+     * Create a deep clone of the node. Both the node as well as all its
+     * childs are cloned recursively.
+     */
+    cloneDeep(): MathNode;
+    /**
+     * Compile an expression into optimized JavaScript code. compile returns
+     * an object with a function evaluate([scope]) to evaluate. Example:
+     */
+    compile(): EvalFunction;
+    /**
+     * Compile and eval an expression, this is the equivalent of doing
+     * node.compile().evaluate(scope). Example:
+     */
+    evaluate(expr?: any): any;
+    /**
+     * Test whether this node equals an other node. Does a deep comparison
+     * of the values of both nodes.
+     */
+    equals(other: MathNode): boolean;
+    /**
+     *
+     * Filter nodes in an expression tree. The callback function is called
+     * as callback(node: MathNode, path: string, parent: MathNode) : boolean
+     * for every node in the tree, and must return a boolean. The function
+     * filter returns an array with nodes for which the test returned true.
+     * Parameter path is a string containing a relative JSON Path.
+     *
+     * Example:
+     *
+     * ```
+     * var node = math.parse('x^2 + x/4 + 3*y');
+     * var filtered = node.filter(function (node) {
+     * return node.isSymbolMathNode && node.name == 'x';
+     * });
+     * // returns an array with two entries: two SymbolMathNodes 'x'
+     * ```
+     *
+     * The callback function is called as callback(node: MathNode, path:
+     * string, parent: MathNode) : boolean for every node in the tree, and
+     * must return a boolean. The function filter returns an array with
+     * nodes for which the test returned true. Parameter path is a string
+     * containing a relative JSON Path.
+     * @return Returns an array with nodes for which test returned true
+     */
+    filter(callback: (node: MathNode, path: string, parent: MathNode) => any): MathNode[];
+
+    /**
+     * [forEach description]
+     */
+    forEach(callback: (node: MathNode, path: string, parent: MathNode) => any): MathNode[];
+
+    /**
+     * Transform a node. Creates a new MathNode having it’s child's be the
+     * results of calling the provided callback function for each of the
+     * child's of the original node. The callback function is called as
+     * `callback(child: MathNode, path: string, parent: MathNode)` and must
+     * return a MathNode. Parameter path is a string containing a relative
+     * JSON Path.
+     *
+     *
+     * See also transform, which is a recursive version of map.
+     */
+    map(callback: (node: MathNode, path: string, parent: MathNode) => MathNode): MathNode;
+
+    /**
+     * Get a HTML representation of the parsed expression.
+     */
+    toHTML(options?: object): string;
+
+    /**
+     * Get a string representation of the parsed expression. This is not
+     * exactly the same as the original input.
+     */
+    toString(options?: object): string;
+
+    /**
+     * Get a LaTeX representation of the expression.
+     */
+    toTex(options?: object): string;
+
+    /**
+     * Recursively transform an expression tree via a transform function.
+     * Similar to Array.map, but recursively executed on all nodes in the
+     * expression tree. The callback function is a mapping function
+     * accepting a node, and returning a replacement for the node or the
+     * original node. Function callback is called as callback(node:
+     * MathNode, path: string, parent: MathNode) for every node in the tree,
+     * and must return a MathNode. Parameter path is a string containing a
+     * relative JSON Path.
+     *
+     * For example, to replace all nodes of type SymbolMathNode having name
+     * ‘x’ with a ConstantMathNode with value 3:
+     * ```js
+     * var node = math.parse('x^2 + 5*x');
+     * var transformed = node.transform(function (node, path, parent) {
+     *   if (node.SymbolMathNode && node.name == 'x') {
+     *     return new math.expression.node.ConstantMathNode(3);
+     *   }
+     *   else {
+     *     return node;
+     *   }
+     * });
+     * transformed.toString(); // returns '(3 ^ 2) + (5 * 3)'
+     * ```
+     */
+    transform(callback: (node: MathNode, path: string, parent: MathNode) => MathNode): MathNode;
+
+    /**
+     * `traverse(callback)`
+     *
+     * Recursively traverse all nodes in a node tree. Executes given
+     * callback for this node and each of its child nodes. Similar to
+     * Array.forEach, except recursive. The callback function is a mapping
+     * function accepting a node, and returning a replacement for the node
+     * or the original node. Function callback is called as callback(node:
+     * MathNode, path: string, parent: MathNode) for every node in the tree.
+     * Parameter path is a string containing a relative JSON Path. Example:
+     *
+     * ```
+     * var node = math.parse('3 * x + 2');
+     * node.traverse(function (node, path, parent) {
+     * switch (node.type) {
+     * case 'OperatorMathNode': console.log(node.type, node.op);    break;
+     * case 'ConstantMathNode': console.log(node.type, node.value); break;
+     * case 'SymbolMathNode':   console.log(node.type, node.name);  break;
+     * default:             console.log(node.type);
+     * }
+     * });
+     * // outputs:
+     * //   OperatorMathNode +
+     * //   OperatorMathNode *
+     * //   ConstantMathNode 3
+     * //   SymbolMathNode x
+     * //   ConstantMathNode 2
+     * ```
+     */
+    traverse(callback: (node: MathNode, path: string, parent: MathNode) => void): any;
+  }
+
+  interface Parser {
+    evaluate(expr: string | string[]): any;
+    get(variable: string): any;
+    getAll(): { [key: string]: any };
+    set: (variable: string, value: any) => void;
+    clear: () => void;
+  }
+
+  interface Distribution {
+    random(size: any, min?: any, max?: any): any;
+    randomInt(min: any, max?: any): any;
+    pickRandom(array: any): any;
+  }
+
+  interface FormatOptions {
+    /**
+     * Number notation. Choose from: 'fixed' Always use regular number
+     * notation. For example '123.40' and '14000000' 'exponential' Always
+     * use exponential notation. For example '1.234e+2' and '1.4e+7' 'auto'
+     * (default) Regular number notation for numbers having an absolute
+     * value between lower and upper bounds, and uses exponential notation
+     * elsewhere. Lower bound is included, upper bound is excluded. For
+     * example '123.4' and '1.4e7'.
+     */
+    notation?: 'fixed' | 'exponential' | 'engineering' | 'auto';
+
+    /**
+     * A number between 0 and 16 to round the digits of the number. In case
+     * of notations 'exponential' and 'auto', precision defines the total
+     * number of significant digits returned and is undefined by default. In
+     * case of notation 'fixed', precision defines the number of significant
+     * digits after the decimal point, and is 0 by default.
+     */
+    precision?: number;
+
+    /**
+     * Exponent determining the lower boundary for formatting a value with
+     * an exponent when notation='auto. Default value is -3.
+     */
+    lowerExp?: number;
+
+    /**
+     * Exponent determining the upper boundary for formatting a value with
+     * an exponent when notation='auto. Default value is 5.
+     */
+    upperExp?: number;
+
+    /**
+     * Available values: 'ratio' (default) or 'decimal'. For example
+     * format(fraction(1, 3)) will output '1/3' when 'ratio' is configured,
+     * and will output 0.(3) when 'decimal' is configured.
+     */
+    fraction?: string;
+  }
+
+  interface Help {
+    toString(): string;
+    toJSON(): string;
+  }
+
+  interface ConfigOptions {
+    epsilon?: number;
+    matrix?: 'Matrix' | 'Array';
+    number?: 'number' | 'BigNumber' | 'Fraction';
+    precision?: number;
+    predictable?: boolean;
+    randomSeed?: string | null;
+  }
+
+  interface MathJsChain {
+    done(): any;
+
+    /*************************************************************************
+     * Construction functions
+     ************************************************************************/
+
+    /**
+     * Create a BigNumber, which can store numbers with arbitrary precision.
+     * When a matrix is provided, all elements will be converted to
+     * BigNumber.
+     */
+    bignumber(): MathJsChain;
+
+    /**
+     * Create a boolean or convert a string or number to a boolean. In case
+     * of a number, true is returned for non-zero numbers, and false in case
+     * of zero. Strings can be 'true' or 'false', or can contain a number.
+     * When value is a matrix, all elements will be converted to boolean.
+     */
+    boolean(): MathJsChain;
+
+    /**
+     * Create a complex value or convert a value to a complex value.
+     * @param im Argument specifying the imaginary part of the complex
+     * number
+     */
+    complex(im?: number): MathJsChain;
+
+    /**
+     * Create a user-defined unit and register it with the Unit type.
+     * @param definition Definition of the unit in terms of existing units.
+     * For example, ‘0.514444444 m / s’.
+     * @param options (optional) An object containing any of the following
+     * properties:</br>- prefixes {string} “none”, “short”, “long”,
+     * “binary_short”, or “binary_long”. The default is “none”.</br>-
+     * aliases {Array} Array of strings. Example: [‘knots’, ‘kt’,
+     * ‘kts’]</br>- offset {Numeric} An offset to apply when converting from
+     * the unit. For example, the offset for celsius is 273.15. Default is
+     * 0.
+     */
+    createUnit(definition?: string | UnitDefinition, options?: CreateUnitOptions): MathJsChain;
+    /**
+     * Create a user-defined unit and register it with the Unit type.
+     * @param options (optional) An object containing any of the following
+     * properties:</br>- prefixes {string} “none”, “short”, “long”,
+     * “binary_short”, or “binary_long”. The default is “none”.</br>-
+     * aliases {Array} Array of strings. Example: [‘knots’, ‘kt’,
+     * ‘kts’]</br>- offset {Numeric} An offset to apply when converting from
+     * the unit. For example, the offset for celsius is 273.15. Default is
+     * 0.
+     */
+    createUnit(options?: CreateUnitOptions): MathJsChain;
+
+    /**
+     * Create a fraction convert a value to a fraction.
+     * @param denominator Argument specifying the denominator of the
+     * fraction
+     */
+    fraction(denominator?: number | string | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Create an index. An Index can store ranges having start, step, and
+     * end for multiple dimensions. Matrix.get, Matrix.set, and math.subset
+     * accept an Index as input.
+     */
+    index(): MathJsChain;
+
+    /**
+     * Create a Matrix. The function creates a new math.type.Matrix object
+     * from an Array. A Matrix has utility functions to manipulate the data
+     * in the matrix, like getting the size and getting or setting values in
+     * the matrix. Supported storage formats are 'dense' and 'sparse'.
+     */
+    matrix(format?: 'sparse' | 'dense', dataType?: string): MathJsChain;
+
+    /**
+     * Create a number or convert a string, boolean, or unit to a number.
+     * When value is a matrix, all elements will be converted to number.
+     * @param valuelessUnit A valueless unit, used to convert a unit to a
+     * number
+     */
+    number(valuelessUnit?: Unit | string): MathJsChain;
+
+    /**
+     * Create a Sparse Matrix. The function creates a new math.type.Matrix
+     * object from an Array. A Matrix has utility functions to manipulate
+     * the data in the matrix, like getting the size and getting or setting
+     * values in the matrix.
+     * @param dataType Sparse Matrix data type
+     */
+    sparse(dataType?: string): MathJsChain;
+
+    /**
+     * Split a unit in an array of units whose sum is equal to the original
+     * unit.
+     * @param parts An array of strings or valueless units
+     */
+    splitUnit(parts: Unit[]): MathJsChain;
+
+    /**
+     * Create a string or convert any object into a string. Elements of
+     * Arrays and Matrices are processed element wise.
+     */
+    string(): MathJsChain;
+
+    /**
+     * Create a unit. Depending on the passed arguments, the function will
+     * create and return a new math.type.Unit object. When a matrix is
+     * provided, all elements will be converted to units.
+     * @param unit The unit to be created
+     */
+    unit(unit?: string): MathJsChain;
+
+    /*************************************************************************
+     * Expression functions
+     ************************************************************************/
+
+    /**
+     * Parse and compile an expression. Returns a an object with a function
+     * evaluate([scope]) to evaluate the compiled expression.
+     */
+    compile(): MathJsChain;
+
+    /**
+     * Evaluate an expression.
+     * @param scope Scope to read/write variables
+     */
+    evaluate(scope?: object): MathJsChain;
+
+    /**
+     * Retrieve help on a function or data type. Help files are retrieved
+     * from the documentation in math.expression.docs.
+     */
+    help(): MathJsChain;
+
+    /**
+     * Parse an expression. Returns a node tree, which can be evaluated by
+     * invoking node.evaluate();
+     * @param options Available options: nodes - a set of custome nodes
+     */
+    parse(options?: any): MathJsChain;
+    /**
+     * @param options Available options: nodes - a set of custome nodes
+     */
+    parse(options?: any): MathJsChain;
+
+    /**
+     * Create a parser. The function creates a new math.expression.Parser
+     * object.
+     */
+    parser(): MathJsChain;
+
+    /*************************************************************************
+     * Algebra functions
+     ************************************************************************/
+    /**
+     * @param variable The variable over which to differentiate
+     * @param options There is one option available, simplify, which is true
+     * by default. When false, output will not be simplified.
+     */
+    derivative(variable: MathNode | string, options?: { simplify: boolean }): MathJsChain;
+
+    /**
+     * Solves the linear equation system by forwards substitution. Matrix
+     * must be a lower triangular matrix.
+     * @param b A column vector with the b values
+     */
+    lsolve(b: Matrix | MathArray): MathJsChain;
+
+    /**
+     * Calculate the Matrix LU decomposition with partial pivoting. Matrix A
+     * is decomposed in two matrices (L, U) and a row permutation vector p
+     * where A[p,:] = L * U
+     */
+    lup(): MathJsChain;
+
+    /**
+     * Solves the linear system A * x = b where A is an [n x n] matrix and b
+     * is a [n] column vector.
+     * @param b Column Vector
+     * @param order The Symbolic Ordering and Analysis order, see slu for
+     * details. Matrix must be a SparseMatrix
+     * @param threshold Partial pivoting threshold (1 for partial pivoting),
+     * see slu for details. Matrix must be a SparseMatrix.
+     */
+    lusolve(b: Matrix | MathArray, order?: number, threshold?: number): MathJsChain;
+
+    /**
+     * Calculate the Matrix QR decomposition. Matrix A is decomposed in two
+     * matrices (Q, R) where Q is an orthogonal matrix and R is an upper
+     * triangular matrix.
+     */
+    qr(): MathJsChain;
+
+    /**
+     * Transform a rationalizable expression in a rational fraction. If
+     * rational fraction is one variable polynomial then converts the
+     * numerator and denominator in canonical form, with decreasing
+     * exponents, returning the coefficients of numerator.
+     * @param optional scope of expression or true for already evaluated
+     * rational expression at input
+     * @param detailed  optional True if return an object, false if return
+     * expression node (default)
+     */
+    rationalize(optional?: object | boolean, detailed?: boolean): MathJsChain;
+
+    /**
+     * Simplify an expression tree.
+     * @param rules A list of rules are applied to an expression, repeating
+     * over the list until no further changes are made. It’s possible to
+     * pass a custom set of rules to the function as second argument. A rule
+     * can be specified as an object, string, or function.
+     * @param scope Scope to variables
+     */
+    simplify(rules?: SimplifyRule[], scope?: object): MathJsChain;
+
+    simplifyCore(expr: MathNode): MathNode;
+
+    /**
+     * Calculate the Sparse Matrix LU decomposition with full pivoting.
+     * Sparse Matrix A is decomposed in two matrices (L, U) and two
+     * permutation vectors (pinv, q) where P * A * Q = L * U
+     * @param order The Symbolic Ordering and Analysis order: 0 - Natural
+     * ordering, no permutation vector q is returned 1 - Matrix must be
+     * square, symbolic ordering and analisis is performed on M = A + A' 2 -
+     * Symbolic ordering and analysis is performed on M = A' * A. Dense
+     * columns from A' are dropped, A recreated from A'. This is appropriate
+     * for LU factorization of non-symmetric matrices. 3 - Symbolic ordering
+     * and analysis is performed on M = A' * A. This is best used for LU
+     * factorization is matrix M has no dense rows. A dense row is a row
+     * with more than 10*sqr(columns) entries.
+     * @param threshold Partial pivoting threshold (1 for partial pivoting)
+     */
+    slu(order: number, threshold: number): MathJsChain;
+
+    /**
+     * Solves the linear equation system by backward substitution. Matrix
+     * must be an upper triangular matrix. U * x = b
+     * @param b A column vector with the b values
+     */
+    usolve(b: Matrix | MathArray): MathJsChain;
+
+    /*************************************************************************
+     * Arithmetic functions
+     ************************************************************************/
+
+    /**
+     * Calculate the absolute value of a number. For matrices, the function
+     * is evaluated element wise.
+     */
+    abs(): MathJsChain;
+
+    /**
+     * Add two values, x + y. For matrices, the function is evaluated
+     * element wise.
+     * @param y Second value to add
+     */
+    add(y: MathType): MathJsChain;
+
+    /**
+     * Apply a function that maps an array to a scalar along a given axis of the
+     * matrix or array. Returns a new matrix or array with one less dimension
+     * than the input.
+     * @param dim The dimension along which the callback is applied
+     * @param callback The callback function that is applied. This Function should take an
+     * array or 1-d matrix as an input and return a number.
+     * @returns The residual matrix with the function applied over some dimension.
+     */
+    apply(dim: number, callback: (array: Array<MathType> | Matrix) => number): MathJsChain;
+
+    /**
+     * Calculate the cubic root of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param allRoots Optional, false by default. Only applicable when x is
+     * a number or complex number. If true, all complex roots are returned,
+     * if false (default) the principal root is returned.
+     */
+    cbrt(allRoots?: boolean): MathJsChain;
+
+    /**
+     * Round a value towards plus infinity If x is complex, both real and
+     * imaginary part are rounded towards plus infinity. For matrices, the
+     * function is evaluated element wise.
+     */
+    ceil(): MathJsChain;
+
+    /**
+     * Compute the cube of a value, x * x * x. For matrices, the function is
+     * evaluated element wise.
+     */
+    cube(): MathJsChain;
+
+    /**
+     * Divide two values, x / y. To divide matrices, x is multiplied with
+     * the inverse of y: x * inv(y).
+     * @param y Denominator
+     */
+    divide(y: MathType): MathJsChain;
+
+    /**
+     * Divide two matrices element wise. The function accepts both matrices
+     * and scalar values.
+     * @param y Denominator
+     */
+    dotDivide(y: MathType): MathJsChain;
+
+    /**
+     * Multiply two matrices element wise. The function accepts both
+     * matrices and scalar values.
+     * @param y Right hand value
+     */
+    dotMultiply(y: MathType): MathJsChain;
+
+    /**
+     * Calculates the power of x to y element wise.
+     * @param y The exponent
+     */
+    dotPow(y: MathType): MathJsChain;
+
+    /**
+     * Calculate the exponent of a value. For matrices, the function is
+     * evaluated element wise.
+     */
+    exp(): MathJsChain;
+
+    /**
+     * Calculate the value of subtracting 1 from the exponential value. For
+     * matrices, the function is evaluated element wise.
+     */
+    expm1(): MathJsChain;
+
+    /**
+     * Round a value towards zero. For matrices, the function is evaluated
+     * element wise.
+     */
+    fix(): MathJsChain;
+
+    /**
+     * Round a value towards minus infinity. For matrices, the function is
+     * evaluated element wise.
+     */
+    floor(): MathJsChain;
+
+    /**
+     * Calculate the greatest common divisor for two or more values or
+     * arrays. For matrices, the function is evaluated element wise.
+     */
+    gcd(): MathJsChain;
+
+    /**
+     * Calculate the hypotenusa of a list with values. The hypotenusa is
+     * defined as: hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...) For
+     * matrix input, the hypotenusa is calculated for all values in the
+     * matrix.
+     */
+    hypot(): MathJsChain;
+
+    /**
+     * Calculate the least common multiple for two or more values or arrays.
+     * lcm is defined as: lcm(a, b) = abs(a * b) / gcd(a, b) For matrices,
+     * the function is evaluated element wise.
+     * @param b An integer number
+     */
+    lcm(b: number | BigNumber | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Calculate the logarithm of a value. For matrices, the function is
+     * evaluated element wise.
+     * @param base Optional base for the logarithm. If not provided, the
+     * natural logarithm of x is calculated. Default value: e.
+     */
+    log(base?: number | BigNumber | Complex): MathJsChain;
+
+    /**
+     * Calculate the 10-base of a value. This is the same as calculating
+     * log(x, 10). For matrices, the function is evaluated element wise.
+     */
+    log10(): MathJsChain;
+
+    /**
+     * Calculate the logarithm of a value+1. For matrices, the function is
+     * evaluated element wise.
+     */
+    log1p(base?: number | BigNumber | Complex): MathJsChain;
+    /**
+     * Calculate the 2-base of a value. This is the same as calculating
+     * log(x, 2). For matrices, the function is evaluated element wise.
+     */
+    log2(): MathJsChain;
+    /**
+     * Calculates the modulus, the remainder of an integer division. For
+     * matrices, the function is evaluated element wise. The modulus is
+     * defined as: x - y * floor(x / y)
+     * @see http://en.wikipedia.org/wiki/Modulo_operation.
+     * @param y Divisor
+     */
+    mod(y: number | BigNumber | Fraction | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Multiply two values, x * y. The result is squeezed. For matrices, the
+     * matrix product is calculated.
+     * @param y The second value to multiply
+     */
+    multiply(y: MathType): MathJsChain;
+
+    /**
+     * Calculate the norm of a number, vector or matrix. The second
+     * parameter p is optional. If not provided, it defaults to 2.
+     * @param p Vector space. Supported numbers include Infinity and
+     * -Infinity. Supported strings are: 'inf', '-inf', and 'fro' (The
+     * Frobenius norm) Default value: 2.
+     */
+    norm(p?: number | BigNumber | string): MathJsChain;
+
+    /**
+     * Calculate the nth root of a value. The principal nth root of a
+     * positive real number A, is the positive real solution of the equation
+     * x^root = A For matrices, the function is evaluated element wise.
+     * @param root The root. Default value: 2.
+     */
+    nthRoot(root?: number | BigNumber): MathJsChain;
+
+    /**
+     * Calculates the power of x to y, x ^ y. Matrix exponentiation is
+     * supported for square matrices x, and positive integer exponents y.
+     * @param y The exponent
+     */
+    pow(y: number | BigNumber): MathJsChain;
+
+    /**
+     * Round a value towards the nearest integer. For matrices, the function
+     * is evaluated element wise.
+     * @param n Number of decimals Default value: 0.
+     */
+    round(n?: number | BigNumber | MathArray): MathJsChain;
+
+    /**
+     * Compute the sign of a value. The sign of a value x is: 1 when x > 1
+     * -1 when x < 0 0 when x == 0 For matrices, the function is evaluated
+     * element wise.
+     * @param x The number for which to determine the sign
+     * @returns The sign of x
+     */
+    sign(x: number | BigNumber): MathJsChain;
+
+    /**
+     * Calculate the square root of a value. For matrices, the function is
+     * evaluated element wise.
+     */
+    sqrt(): MathJsChain;
+
+    /**
+     * Compute the square of a value, x * x. For matrices, the function is
+     * evaluated element wise.
+     */
+    square(): MathJsChain;
+
+    /**
+     * Subtract two values, x - y. For matrices, the function is evaluated
+     * element wise.
+     * @param y Value to subtract from x
+     */
+    subtract(y: MathType): MathJsChain;
+
+    /**
+     * Inverse the sign of a value, apply a unary minus operation. For
+     * matrices, the function is evaluated element wise. Boolean values and
+     * strings will be converted to a number. For complex numbers, both real
+     * and complex value are inverted.
+     */
+    unaryMinus(): MathJsChain;
+
+    /**
+     * Unary plus operation. Boolean values and strings will be converted to
+     * a number, numeric values will be returned as is. For matrices, the
+     * function is evaluated element wise.
+     */
+    unaryPlus(): MathJsChain;
+
+    /**
+     * Calculate the extended greatest common divisor for two values. See
+     * http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+     * @param b An integer number
+     */
+    xgcd(b: number | BigNumber): MathJsChain;
+
+    /*************************************************************************
+     * Bitwise functions
+     ************************************************************************/
+
+    /**
+     * Bitwise AND two values, x & y. For matrices, the function is
+     * evaluated element wise.
+     * @param y Second value to and
+     */
+    bitAnd(y: number | BigNumber | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Bitwise NOT value, ~x. For matrices, the function is evaluated
+     * element wise. For units, the function is evaluated on the best prefix
+     * base.
+     */
+    bitNot(): MathJsChain;
+
+    /**
+     * Bitwise OR two values, x | y. For matrices, the function is evaluated
+     * element wise. For units, the function is evaluated on the lowest
+     * print base.
+     * @param y Second value to or
+     */
+    bitOr(y: number | BigNumber | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Bitwise XOR two values, x ^ y. For matrices, the function is
+     * evaluated element wise.
+     * @param y Second value to xor
+     */
+    bitXor(y: number | BigNumber | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Bitwise left logical shift of a value x by y number of bits, x << y.
+     * For matrices, the function is evaluated element wise. For units, the
+     * function is evaluated on the best prefix base.
+     * @param y Amount of shifts
+     */
+    leftShift(y: number | BigNumber): MathJsChain;
+
+    /**
+     * Bitwise right arithmetic shift of a value x by y number of bits, x >>
+     * y. For matrices, the function is evaluated element wise. For units,
+     * the function is evaluated on the best prefix base.
+     * @param y Amount of shifts
+     */
+    rightArithShift(y: number | BigNumber): MathJsChain;
+
+    /**
+     * Bitwise right logical shift of value x by y number of bits, x >>> y.
+     * For matrices, the function is evaluated element wise. For units, the
+     * function is evaluated on the best prefix base.
+     * @param y Amount of shifts
+     */
+    rightLogShift(y: number): MathJsChain;
+
+    /*************************************************************************
+     * Combinatorics functions
+     ************************************************************************/
+
+    /**
+     * The Bell Numbers count the number of partitions of a set. A partition
+     * is a pairwise disjoint subset of S whose union is S. bellNumbers only
+     * takes integer arguments. The following condition must be enforced: n
+     * >= 0
+     */
+    bellNumbers(): MathJsChain;
+
+    /**
+     * The Catalan Numbers enumerate combinatorial structures of many
+     * different types. catalan only takes integer arguments. The following
+     * condition must be enforced: n >= 0
+     */
+    catalan(): MathJsChain;
+
+    /**
+     * The composition counts of n into k parts. Composition only takes
+     * integer arguments. The following condition must be enforced: k <= n.
+     * @param k Number of objects in the subset
+     */
+    composition(k: number | BigNumber): MathJsChain;
+
+    /**
+     * The Stirling numbers of the second kind, counts the number of ways to
+     * partition a set of n labelled objects into k nonempty unlabelled
+     * subsets. stirlingS2 only takes integer arguments. The following
+     * condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) =
+     * 1
+     * @param k Number of objects in the subset
+     */
+    stirlingS2(k: number | BigNumber): MathJsChain;
+
+    /*************************************************************************
+     * Complex functions
+     ************************************************************************/
+
+    /**
+     * Compute the argument of a complex value. For a complex number a + bi,
+     * the argument is computed as atan2(b, a). For matrices, the function
+     * is evaluated element wise.
+     */
+    arg(): MathJsChain;
+
+    /**
+     * Compute the complex conjugate of a complex value. If x = a+bi, the
+     * complex conjugate of x is a - bi. For matrices, the function is
+     * evaluated element wise.
+     */
+    conj(): MathJsChain;
+
+    /**
+     * Get the imaginary part of a complex number. For a complex number a +
+     * bi, the function returns b. For matrices, the function is evaluated
+     * element wise.
+     */
+    im(): MathJsChain;
+
+    /**
+     * Get the real part of a complex number. For a complex number a + bi,
+     * the function returns a. For matrices, the function is evaluated
+     * element wise.
+     */
+    re(): MathJsChain;
+
+    /*************************************************************************
+     * Geometry functions
+     ************************************************************************/
+
+    /**
+     * Calculates: The eucledian distance between two points in 2 and 3
+     * dimensional spaces. Distance between point and a line in 2 and 3
+     * dimensional spaces. Pairwise distance between a set of 2D or 3D
+     * points NOTE: When substituting coefficients of a line(a, b and c),
+     * use ax + by + c = 0 instead of ax + by = c For parametric equation of
+     * a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b,
+     * c)
+     * @param y Coordinates of the second point
+     */
+    distance(y: MathArray | Matrix | object): MathJsChain;
+
+    /**
+     * Calculates the point of intersection of two lines in two or three
+     * dimensions and of a line and a plane in three dimensions. The inputs
+     * are in the form of arrays or 1 dimensional matrices. The line
+     * intersection functions return null if the lines do not meet. Note:
+     * Fill the plane coefficients as x + y + z = c and not as x + y + z + c
+     * = 0.
+     * @param x Co-ordinates of second end-point of first line
+     * @param y Co-ordinates of first end-point of second line OR
+     * Coefficients of the plane's equation
+     * @param z Co-ordinates of second end-point of second line OR null if
+     * the calculation is for line and plane
+     */
+    intersect(x: MathArray | Matrix, y: MathArray | Matrix, z: MathArray | Matrix): MathJsChain;
+
+    /*************************************************************************
+     * Logical functions
+     ************************************************************************/
+
+    /**
+     * Logical and. Test whether two values are both defined with a
+     * nonzero/nonempty value. For matrices, the function is evaluated
+     * element wise.
+     * @param y Second value to and
+     */
+    and(y: number | BigNumber | Complex | Unit | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Logical not. Flips boolean value of a given parameter. For matrices,
+     * the function is evaluated element wise.
+     */
+    not(): MathJsChain;
+
+    /**
+     * Logical or. Test if at least one value is defined with a
+     * nonzero/nonempty value. For matrices, the function is evaluated
+     * element wise.
+     * @param y Second value to or
+     */
+    or(y: number | BigNumber | Complex | Unit | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Logical xor. Test whether one and only one value is defined with a
+     * nonzero/nonempty value. For matrices, the function is evaluated
+     * element wise.
+     * @param y Second value to xor
+     */
+    xor(y: number | BigNumber | Complex | Unit | MathArray | Matrix): MathJsChain;
+
+    /*************************************************************************
+     * Matrix functions
+     ************************************************************************/
+
+    /**
+     * Concatenate two or more matrices. dim: number is a zero-based
+     * dimension over which to concatenate the matrices. By default the last
+     * dimension of the matrices.
+     */
+    concat(): MathJsChain;
+
+    /**
+     * Calculate the cross product for two vectors in three dimensional
+     * space. The cross product of A = [a1, a2, a3] and B =[b1, b2, b3] is
+     * defined as: cross(A, B) = [ a2 * b3 - a3 * b2, a3 * b1 - a1 * b3, a1
+     * * b2 - a2 * b1 ]
+     * @param y Second vector
+     */
+    cross(y: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Calculate the determinant of a matrix.
+     */
+    det(): MathJsChain;
+
+    /**
+     * Create a diagonal matrix or retrieve the diagonal of a matrix. When x
+     * is a vector, a matrix with vector x on the diagonal will be returned.
+     * When x is a two dimensional matrix, the matrixes kth diagonal will be
+     * returned as vector. When k is positive, the values are placed on the
+     * super diagonal. When k is negative, the values are placed on the sub
+     * diagonal.
+     * @param k The diagonal where the vector will be filled in or
+     * retrieved. Default value: 0.
+     * @param format The matrix storage format. Default value: 'dense'.
+     */
+    diag(format?: string): MathJsChain;
+    diag(k: number | BigNumber, format?: string): MathJsChain;
+
+    /**
+     * Calculate the dot product of two vectors. The dot product of A = [a1,
+     * a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as: dot(A,
+     * B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn
+     * @param y Second vector
+     */
+    dot(y: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Compute the matrix exponential, expm(A) = e^A. The matrix must be
+     * square. Not to be confused with exp(a), which performs element-wise
+     * exponentiation. The exponential is calculated using the Padé
+     * approximant with scaling and squaring; see “Nineteen Dubious Ways to
+     * Compute the Exponential of a Matrix,” by Moler and Van Loan.
+     */
+    expm(): MathJsChain;
+
+    /**
+     * Create a 2-dimensional identity matrix with size m x n or n x n. The
+     * matrix has ones on the diagonal and zeros elsewhere.
+     * @param format The Matrix storage format
+     */
+    identity(format?: string): MathJsChain;
+    /**
+     * @param n The y dimension for the matrix
+     * @param format The Matrix storage format
+     */
+    identity(n: number, format?: string): MathJsChain;
+
+    /**
+     * Filter the items in an array or one dimensional matrix.
+     */
+    filter(test: ((value: any, index: any, matrix: Matrix | MathArray) => boolean) | RegExp): MathJsChain;
+
+    /**
+     * Flatten a multi dimensional matrix into a single dimensional matrix.
+     */
+    flatten(): MathJsChain;
+
+    /**
+     * Iterate over all elements of a matrix/array, and executes the given
+     * callback function.
+     */
+    forEach(callback: (value: any, index: any, matrix: Matrix | MathArray) => void): MathJsChain;
+
+    /**
+     * Calculate the inverse of a square matrix.
+     */
+    inv(): MathJsChain;
+
+    /**
+     * Calculate the kronecker product of two matrices or vectors
+     * @param y Second vector
+     */
+    kron(y: Matrix | MathArray): MathJsChain;
+
+    /**
+     * Iterate over all elements of a matrix/array, and executes the given
+     * callback function.
+     * @param callback The callback function is invoked with three
+     * parameters: the value of the element, the index of the element, and
+     * the Matrix/array being traversed.
+     */
+    map(callback: (value: any, index: any, matrix: Matrix | MathArray) => Matrix | MathArray): MathJsChain;
+
+    /**
+     * Create a matrix filled with ones. The created matrix can have one or
+     * multiple dimensions.
+     * @param format The matrix storage format
+     */
+    ones(format?: string): MathJsChain;
+    /**
+     * @param format The matrix storage format
+     */
+    ones(n: number, format?: string): MathJsChain;
+    /**
+     * Partition-based selection of an array or 1D matrix. Will find the kth
+     * smallest value, and mutates the input array. Uses Quickselect.
+     * @param k The kth smallest value to be retrieved; zero-based index
+     * @param compare  An optional comparator function. The function is
+     * called as compare(a, b), and must return 1 when a > b, -1 when a < b,
+     * and 0 when a == b. Default value: 'asc'.
+     */
+    partitionSelect(k: number, compare?: 'asc' | 'desc' | ((a: any, b: any) => number)): MathJsChain;
+
+    /**
+     * Create an array from a range. By default, the range end is excluded.
+     * This can be customized by providing an extra parameter includeEnd.
+     * @param end End of the range, excluded by default, included when
+     * parameter includeEnd=true
+     * @param step Step size. Default value is 1.
+     * @param includeEnd: Option to specify whether to include the end or
+     * not. False by default
+     */
+    range(includeEnd?: boolean): Matrix;
+    range(end: number | BigNumber, includeEnd?: boolean): MathJsChain;
+    range(end: number | BigNumber, step: number | BigNumber, includeEnd?: boolean): MathJsChain;
+
+    /**
+     * Reshape a multi dimensional array to fit the specified dimensions
+     * @param sizes One dimensional array with integral sizes for each
+     * dimension
+     */
+    reshape(sizes: number[]): MathJsChain;
+
+    /**
+     * Resize a matrix
+     * @param size One dimensional array with numbers
+     * @param defaultValue Zero by default, except in case of a string, in
+     * that case defaultValue = ' ' Default value: 0.
+     */
+    resize(size: MathArray | Matrix, defaultValue?: number | string): MathJsChain;
+
+    /**
+     * Calculate the size of a matrix or scalar.
+     */
+    size(): MathJsChain;
+
+    /**
+     * Sort the items in a matrix
+     * @param compare An optional _comparator function or name. The function
+     * is called as compare(a, b), and must return 1 when a > b, -1 when a <
+     * b, and 0 when a == b. Default value: ‘asc’
+     */
+    sort(compare: ((a: any, b: any) => number) | 'asc' | 'desc' | 'natural'): MathJsChain;
+
+    /**
+     * Calculate the principal square root of a square matrix. The principal
+     * square root matrix X of another matrix A is such that X * X = A.
+     */
+    sqrtm(): MathJsChain;
+
+    /**
+     * Squeeze a matrix, remove inner and outer singleton dimensions from a
+     * matrix.
+     */
+    squeeze(): MathJsChain;
+
+    /**
+     * Get or set a subset of a matrix or string.
+     * @param index For each dimension, an index or list of indices to get or set
+     * @param replacement An array, matrix, or scalar. If provided, the
+     * subset is replaced with replacement. If not provided, the subset is
+     * returned
+     * @param defaultValue Default value, filled in on new entries when the
+     * matrix is resized. If not provided, math.matrix elements will be left
+     * undefined. Default value: undefined.
+     */
+    subset(index: Index, replacement?: any, defaultValue?: any): MathJsChain;
+
+    /**
+     * Calculate the trace of a matrix: the sum of the elements on the main
+     * diagonal of a square matrix.
+     */
+    trace(): MathJsChain;
+
+    /**
+     * Transpose a matrix. All values of the matrix are reflected over its
+     * main diagonal. Only two dimensional matrices are supported.
+     */
+    transpose(): MathJsChain;
+
+    /**
+     * Create a matrix filled with zeros. The created matrix can have one or
+     * multiple dimensions.
+     * @param format The matrix storage format
+     * @returns A matrix filled with zeros
+     */
+    zeros(format?: string): MathJsChain;
+    /**
+     * @param n The y dimension of the matrix
+     * @param format The matrix storage format
+     */
+    zeros(n: number, format?: string): MathJsChain;
+
+    /*************************************************************************
+     * Probability functions
+     ************************************************************************/
+
+    /**
+     * Compute the number of ways of picking k unordered outcomes from n
+     * possibilities. Combinations only takes integer arguments. The
+     * following condition must be enforced: k <= n.
+     * @param k Number of objects in the subset
+     */
+    combinations(k: number | BigNumber): MathJsChain;
+
+    /**
+     * Compute the factorial of a value Factorial only supports an integer
+     * value as argument. For matrices, the function is evaluated element
+     * wise.
+     */
+    factorial(): MathJsChain;
+
+    /**
+     * Compute the gamma function of a value using Lanczos approximation for
+     * small values, and an extended Stirling approximation for large
+     * values. For matrices, the function is evaluated element wise.
+     */
+    gamma(): MathJsChain;
+
+    /**
+     * Calculate the Kullback-Leibler (KL) divergence between two
+     * distributions
+     * @param p Second vector
+     */
+    kldivergence(p: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Multinomial Coefficients compute the number of ways of picking a1,
+     * a2, ..., ai unordered outcomes from n possibilities. multinomial
+     * takes one array of integers as an argument. The following condition
+     * must be enforced: every ai <= 0
+     */
+    multinomial(): MathJsChain;
+
+    /**
+     * Compute the number of ways of obtaining an ordered subset of k
+     * elements from a set of n elements. Permutations only takes integer
+     * arguments. The following condition must be enforced: k <= n.
+     * @param k The number of objects in the subset
+     */
+    permutations(k?: number | BigNumber): MathJsChain;
+
+    /**
+     * Random pick a value from a one dimensional array. Array element is
+     * picked using a random function with uniform distribution.
+     * @param number An int or float
+     * @param weights An array of ints or floats
+     */
+    pickRandom(number?: number, weights?: number[]): MathJsChain;
+
+    /**
+     * Return a random number larger or equal to min and smaller than max
+     * using a uniform distribution.
+     * @param min Minimum boundary for the random value, included
+     * @param max Maximum boundary for the random value, excluded
+     */
+    random(max?: number): MathJsChain;
+    // tslint:disable-next-line unified-signatures
+    random(min: number, max: number): MathJsChain;
+
+    /**
+     * Return a random integer number larger or equal to min and smaller
+     * than max using a uniform distribution.
+     * @param min Minimum boundary for the random value, included
+     * @param max Maximum boundary for the random value, excluded
+     */
+    randomInt(max?: number): MathJsChain;
+    // tslint:disable-next-line unified-signatures
+    randomInt(min: number, max: number): MathJsChain;
+
+    /*************************************************************************
+     * Relational functions
+     ************************************************************************/
+
+    /**
+     * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x
+     * == y. x and y are considered equal when the relative difference
+     * between x and y is smaller than the configured epsilon. The function
+     * cannot be used to compare values smaller than approximately 2.22e-16.
+     * For matrices, the function is evaluated element wise.
+     * @param y Second value to compare
+     */
+    compare(y: MathType | string): MathJsChain;
+
+    /**
+     * Compare two values of any type in a deterministic, natural way. For
+     * numeric values, the function works the same as math.compare. For
+     * types of values that can’t be compared mathematically, the function
+     * compares in a natural way.
+     * @param y Second value to compare
+     */
+    compareNatural(y: any): MathJsChain;
+
+    /**
+     * Compare two strings lexically. Comparison is case sensitive. Returns
+     * 1 when x > y, -1 when x < y, and 0 when x == y. For matrices, the
+     * function is evaluated element wise.
+     * @param y Second string to compare
+     */
+    compareText(y: string | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Test element wise whether two matrices are equal. The function
+     * accepts both matrices and scalar values.
+     * @param y Second amtrix to compare
+     */
+    deepEqual(y: MathType): MathJsChain;
+
+    /**
+     * Test whether two values are equal.
+     *
+     * The function tests whether the relative difference between x and y is
+     * smaller than the configured epsilon. The function cannot be used to
+     * compare values smaller than approximately 2.22e-16. For matrices, the
+     * function is evaluated element wise. In case of complex numbers, x.re
+     * must equal y.re, and x.im must equal y.im. Values null and undefined
+     * are compared strictly, thus null is only equal to null and nothing
+     * else, and undefined is only equal to undefined and nothing else.
+     * @param y Second value to compare
+     */
+    equal(y: MathType | string): MathJsChain;
+
+    /**
+     * Check equality of two strings. Comparison is case sensitive. For
+     * matrices, the function is evaluated element wise.
+     * @param y Second string to compare
+     */
+    equalText(y: string | MathArray | Matrix): MathJsChain;
+
+    /**
+     * Test whether value x is larger than y. The function returns true when
+     * x is larger than y and the relative difference between x and y is
+     * larger than the configured epsilon. The function cannot be used to
+     * compare values smaller than approximately 2.22e-16. For matrices, the
+     * function is evaluated element wise.
+     * @param y Second value to compare
+     */
+    larger(y: MathType | string): MathJsChain;
+
+    /**
+     * Test whether value x is larger or equal to y. The function returns
+     * true when x is larger than y or the relative difference between x and
+     * y is smaller than the configured epsilon. The function cannot be used
+     * to compare values smaller than approximately 2.22e-16. For matrices,
+     * the function is evaluated element wise.
+     * @param y Second value to vcompare
+     */
+    largerEq(y: MathType | string): MathJsChain;
+
+    /**
+     * Test whether value x is smaller than y. The function returns true
+     * when x is smaller than y and the relative difference between x and y
+     * is smaller than the configured epsilon. The function cannot be used
+     * to compare values smaller than approximately 2.22e-16. For matrices,
+     * the function is evaluated element wise.
+     * @param y Second value to vcompare
+     */
+    smaller(y: MathType | string): MathJsChain;
+
+    /**
+     * Test whether value x is smaller or equal to y. The function returns
+     * true when x is smaller than y or the relative difference between x
+     * and y is smaller than the configured epsilon. The function cannot be
+     * used to compare values smaller than approximately 2.22e-16. For
+     * matrices, the function is evaluated element wise.
+     * @param y Second value to compare
+     */
+    smallerEq(y: MathType | string): MathJsChain;
+
+    /**
+     * Test whether two values are unequal. The function tests whether the
+     * relative difference between x and y is larger than the configured
+     * epsilon. The function cannot be used to compare values smaller than
+     * approximately 2.22e-16. For matrices, the function is evaluated
+     * element wise. In case of complex numbers, x.re must unequal y.re, or
+     * x.im must unequal y.im. Values null and undefined are compared
+     * strictly, thus null is unequal with everything except null, and
+     * undefined is unequal with everything except undefined.
+     * @param y Second value to vcompare
+     */
+    unequal(y: MathType | string): MathJsChain;
+
+    /*************************************************************************
+     * Set functions
+     ************************************************************************/
+
+    /**
+     * Create the cartesian product of two (multi)sets. Multi-dimension
+     * arrays will be converted to single-dimension arrays and the values
+     * will be sorted in ascending order before the operation.
+     * @param a2 A (multi)set
+     */
+    setCartesian(a2: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Create the difference of two (multi)sets: every element of set1, that
+     * is not the element of set2. Multi-dimension arrays will be converted
+     * to single-dimension arrays before the operation
+     * @param a2 A (multi)set
+     */
+    setDifference(a2: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Collect the distinct elements of a multiset. A multi-dimension array
+     * will be converted to a single-dimension array before the operation.
+     */
+    setDistinct(): MathJsChain;
+
+    /**
+     * Create the intersection of two (multi)sets. Multi-dimension arrays
+     * will be converted to single-dimension arrays before the operation.
+     * @param a2 A (multi)set
+     */
+    setIntersect(a2: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Check whether a (multi)set is a subset of another (multi)set. (Every
+     * element of set1 is the element of set2.) Multi-dimension arrays will
+     * be converted to single-dimension arrays before the operation.
+     * @param a2 A (multi)set
+     */
+    setIsSubset(a2: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Count the multiplicity of an element in a multiset. A multi-dimension
+     * array will be converted to a single-dimension array before the
+     * operation.
+     * @param a A multiset
+     */
+    setMultiplicity(a: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Create the powerset of a (multi)set. (The powerset contains very
+     * possible subsets of a (multi)set.) A multi-dimension array will be
+     * converted to a single-dimension array before the operation.
+     */
+    setPowerset(): MathJsChain;
+
+    /**
+     * Count the number of elements of a (multi)set. When a second parameter
+     * is ‘true’, count only the unique values. A multi-dimension array will
+     * be converted to a single-dimension array before the operation.
+     */
+    setSize(): MathJsChain;
+
+    /**
+     * Create the symmetric difference of two (multi)sets. Multi-dimension
+     * arrays will be converted to single-dimension arrays before the
+     * operation.
+     * @param a2 A (multi)set
+     */
+    setSymDifference(a2: MathArray | Matrix): MathJsChain;
+
+    /**
+     * Create the union of two (multi)sets. Multi-dimension arrays will be
+     * converted to single-dimension arrays before the operation.
+     * @param a2 A (multi)set
+     */
+    setUnion(a2: MathArray | Matrix): MathJsChain;
+
+    /*************************************************************************
+     * Special functions
+     ************************************************************************/
+
+    /**
+     * Compute the erf function of a value using a rational Chebyshev
+     * approximations for different intervals of x.
+     */
+    erf(): MathJsChain;
+
+    /*************************************************************************
+     * Statistics functions
+     ************************************************************************/
+
+    /**
+     * Compute the median absolute deviation of a matrix or a list with
+     * values. The median absolute deviation is defined as the median of the
+     * absolute deviations from the median.
+     */
+    mad(): MathJsChain;
+
+    /**
+     * Compute the maximum value of a matrix or a list with values. In case
+     * of a multi dimensional array, the maximum of the flattened array will
+     * be calculated. When dim is provided, the maximum over the selected
+     * dimension will be calculated. Parameter dim is zero-based.
+     * @param dim The maximum over the selected dimension
+     */
+    max(dim?: number): MathJsChain;
+
+    /**
+     * Compute the mean value of matrix or a list with values. In case of a
+     * multi dimensional array, the mean of the flattened array will be
+     * calculated. When dim is provided, the maximum over the selected
+     * dimension will be calculated. Parameter dim is zero-based.
+     * @param dim The mean over the selected dimension
+     */
+    mean(dim?: number): MathJsChain;
+
+    /**
+     * Compute the median of a matrix or a list with values. The values are
+     * sorted and the middle value is returned. In case of an even number of
+     * values, the average of the two middle values is returned. Supported
+     * types of values are: Number, BigNumber, Unit In case of a (multi
+     * dimensional) array or matrix, the median of all elements will be
+     * calculated.
+     */
+    median(): MathJsChain;
+
+    /**
+     * Compute the maximum value of a matrix or a list of values. In case of
+     * a multi dimensional array, the maximum of the flattened array will be
+     * calculated. When dim is provided, the maximum over the selected
+     * dimension will be calculated. Parameter dim is zero-based.
+     * @param dim The minimum over the selected dimension
+     */
+    min(dim?: number): MathJsChain;
+
+    /**
+     * Computes the mode of a set of numbers or a list with values(numbers
+     * or characters). If there are more than one modes, it returns a list
+     * of those values.
+     */
+    mode(): MathJsChain;
+
+    /**
+     * Compute the product of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the sum of all elements will be
+     * calculated.
+     */
+    prod(): MathJsChain;
+
+    /**
+     * Compute the prob order quantile of a matrix or a list with values.
+     * The sequence is sorted and the middle value is returned. Supported
+     * types of sequence values are: Number, BigNumber, Unit Supported types
+     * of probability are: Number, BigNumber In case of a (multi
+     * dimensional) array or matrix, the prob order quantile of all elements
+     * will be calculated.
+     * @param probOrN prob is the order of the quantile, while N is the
+     * amount of evenly distributed steps of probabilities; only one of
+     * these options can be provided
+     * @param sorted =false is data sorted in ascending order
+     */
+    quantileSeq(prob: number | BigNumber | MathArray, sorted?: boolean): MathJsChain;
+    /**
+     * Compute the standard deviation of a matrix or a list with values. The
+     * standard deviations is defined as the square root of the variance:
+     * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+     * matrix, the standard deviation over all elements will be calculated.
+     * Optionally, the type of normalization can be specified as second
+     * parameter. The parameter normalization can be one of the following
+     * values: 'unbiased' (default) The sum of squared errors is divided by
+     * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+     * 'biased' The sum of squared errors is divided by (n + 1)
+     * @param dim A dimension to compute standard deviation.
+     * @param normalization Determines how to normalize the variance. Choose
+     * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+     * ‘unbiased’.
+     * @returns The standard deviation
+     */
+    std(dim?: number, normalization?: 'unbiased' | 'uncorrected' | 'biased'): MathJsChain;
+    /**
+     * Compute the standard deviation of a matrix or a list with values. The
+     * standard deviations is defined as the square root of the variance:
+     * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+     * matrix, the standard deviation over all elements will be calculated.
+     * Optionally, the type of normalization can be specified as second
+     * parameter. The parameter normalization can be one of the following
+     * values: 'unbiased' (default) The sum of squared errors is divided by
+     * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+     * 'biased' The sum of squared errors is divided by (n + 1)
+     * @param normalization Determines how to normalize the variance. Choose
+     * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+     * ‘unbiased’.
+     * @returns The standard deviation
+     */
+    std(normalization: 'unbiased' | 'uncorrected' | 'biased'): MathJsChain;
+
+    /**
+     * Compute the sum of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the sum of all elements will be
+     * calculated.
+     */
+    sum(): MathJsChain;
+    /**
+     * Compute the variance of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the variance over all elements
+     * will be calculated. Optionally, the type of normalization can be
+     * specified as second parameter. The parameter normalization can be one
+     * of the following values: 'unbiased' (default) The sum of squared
+     * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+     * is divided by n 'biased' The sum of squared errors is divided by (n +
+     * 1) Note that older browser may not like the variable name var. In
+     * that case, the function can be called as math['var'](...) instead of
+     * math.variance(...).
+     * @param dim a dimension to compute variance.
+     * @param normalization normalization Determines how to normalize the
+     * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+     * Default value: ‘unbiased’.
+     * @returns The variance
+     */
+    variance(dim?: number, normalization?: 'unbiased' | 'uncorrected' | 'biased'): MathJsChain;
+    /**
+     * Compute the variance of a matrix or a list with values. In case of a
+     * (multi dimensional) array or matrix, the variance over all elements
+     * will be calculated. Optionally, the type of normalization can be
+     * specified as second parameter. The parameter normalization can be one
+     * of the following values: 'unbiased' (default) The sum of squared
+     * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+     * is divided by n 'biased' The sum of squared errors is divided by (n +
+     * 1) Note that older browser may not like the variable name var. In
+     * that case, the function can be called as math['var'](...) instead of
+     * math.variance(...).
+     * @param normalization normalization Determines how to normalize the
+     * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+     * Default value: ‘unbiased’.
+     * @returns The variance
+     */
+    variance(normalization: 'unbiased' | 'uncorrected' | 'biased'): MathJsChain;
+
+    /*************************************************************************
+     * String functions
+     ************************************************************************/
+
+    /**
+     * Format a value of any type into a string.
+     * @param options An object with formatting options.
+     * @param callback A custom formatting function, invoked for all numeric
+     * elements in value, for example all elements of a matrix, or the real
+     * and imaginary parts of a complex number. This callback can be used to
+     * override the built-in numeric notation with any type of formatting.
+     * Function callback is called with value as parameter and must return a
+     * string.
+     * @see http://mathjs.org/docs/reference/functions/format.html
+     */
+    format(value: any, options?: FormatOptions | number | ((item: any) => string), callback?: (value: any) => string): MathJsChain;
+
+    /**
+     * Interpolate values into a string template.
+     * @param values An object containing variables which will be filled in
+     * in the template.
+     * @param precision Number of digits to format numbers. If not provided,
+     * the value will not be rounded.
+     * @param options Formatting options, or the number of digits to format
+     * numbers. See function math.format for a description of all options.
+     */
+    print(values: any, precision?: number, options?: number | object): MathJsChain;
+
+    /*************************************************************************
+     * Trigonometry functions
+     ************************************************************************/
+
+    /**
+     * Calculate the inverse cosine of a value. For matrices, the function
+     * is evaluated element wise.
+     */
+    acos(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic arccos of a value, defined as acosh(x) =
+     * ln(sqrt(x^2 - 1) + x). For matrices, the function is evaluated
+     * element wise.
+     */
+    acosh(): MathJsChain;
+
+    /**
+     * Calculate the inverse cotangent of a value. For matrices, the
+     * function is evaluated element wise.
+     */
+    acot(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic arccotangent of a value, defined as acoth(x)
+     * = (ln((x+1)/x) + ln(x/(x-1))) / 2. For matrices, the function is
+     * evaluated element wise.
+     */
+    acoth(): MathJsChain;
+
+    /**
+     * Calculate the inverse cosecant of a value. For matrices, the function
+     * is evaluated element wise.
+     */
+    acsc(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic arccosecant of a value, defined as acsch(x)
+     * = ln(1/x + sqrt(1/x^2 + 1)). For matrices, the function is evaluated
+     * element wise.
+     */
+    acsch(): MathJsChain;
+
+    /**
+     * Calculate the inverse secant of a value. For matrices, the function
+     * is evaluated element wise.
+     */
+    asec(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic arcsecant of a value, defined as asech(x) =
+     * ln(sqrt(1/x^2 - 1) + 1/x). For matrices, the function is evaluated
+     * element wise.
+     */
+    asech(): MathJsChain;
+
+    /**
+     * Calculate the inverse sine of a value. For matrices, the function is
+     * evaluated element wise.
+     */
+    asin(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic arcsine of a value, defined as asinh(x) =
+     * ln(x + sqrt(x^2 + 1)). For matrices, the function is evaluated
+     * element wise.
+     */
+    asinh(): MathJsChain;
+
+    /**
+     * Calculate the inverse tangent of a value. For matrices, the function
+     * is evaluated element wise.
+     */
+    atan(): MathJsChain;
+
+    /**
+     * Calculate the inverse tangent function with two arguments, y/x. By
+     * providing two arguments, the right quadrant of the computed angle can
+     * be determined. For matrices, the function is evaluated element wise.
+     */
+    atan2(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic arctangent of a value, defined as atanh(x) =
+     * ln((1 + x)/(1 - x)) / 2. For matrices, the function is evaluated
+     * element wise.
+     */
+    atanh(): MathJsChain;
+
+    /**
+     * Calculate the cosine of a value. For matrices, the function is
+     * evaluated element wise.
+     */
+    cos(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic cosine of a value, defined as cosh(x) = 1/2
+     * * (exp(x) + exp(-x)). For matrices, the function is evaluated element
+     * wise.
+     */
+    cosh(): MathJsChain;
+
+    /**
+     * Calculate the cotangent of a value. cot(x) is defined as 1 / tan(x).
+     * For matrices, the function is evaluated element wise.
+     */
+    cot(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic cotangent of a value, defined as coth(x) = 1
+     * / tanh(x). For matrices, the function is evaluated element wise.
+     */
+    coth(): MathJsChain;
+
+    /**
+     * Calculate the cosecant of a value, defined as csc(x) = 1/sin(x). For
+     * matrices, the function is evaluated element wise.
+     */
+    csc(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic cosecant of a value, defined as csch(x) = 1
+     * / sinh(x). For matrices, the function is evaluated element wise.
+     */
+    csch(): MathJsChain;
+
+    /**
+     * Calculate the secant of a value, defined as sec(x) = 1/cos(x). For
+     * matrices, the function is evaluated element wise.
+     */
+    sec(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic secant of a value, defined as sech(x) = 1 /
+     * cosh(x). For matrices, the function is evaluated element wise.
+     */
+    sech(): MathJsChain;
+
+    /**
+     * Calculate the sine of a value. For matrices, the function is
+     * evaluated element wise.
+     */
+    sin(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic sine of a value, defined as sinh(x) = 1/2 *
+     * (exp(x) - exp(-x)). For matrices, the function is evaluated element
+     * wise.
+     */
+    sinh(): MathJsChain;
+
+    /**
+     * Calculate the tangent of a value. tan(x) is equal to sin(x) / cos(x).
+     * For matrices, the function is evaluated element wise.
+     */
+    tan(): MathJsChain;
+
+    /**
+     * Calculate the hyperbolic tangent of a value, defined as tanh(x) =
+     * (exp(2 * x) - 1) / (exp(2 * x) + 1). For matrices, the function is
+     * evaluated element wise.
+     */
+    tanh(): MathJsChain;
+
+    /*************************************************************************
+     * Unit functions
+     ************************************************************************/
+
+    /**
+     * Change the unit of a value. For matrices, the function is evaluated
+     * element wise.
+     * @param unit New unit. Can be a string like "cm" or a unit without
+     * value.
+     */
+    to(unit: Unit | string): MathJsChain;
+
+    /*************************************************************************
+     * Utils functions
+     ************************************************************************/
+
+    /**
+     * Clone an object.
+     */
+    clone(): MathJsChain;
+
+    /**
+     * Test whether a value is an integer number. The function supports
+     * number, BigNumber, and Fraction. The function is evaluated
+     * element-wise in case of Array or Matrix input.
+     */
+    isInteger(): MathJsChain;
+
+    /**
+     * Test whether a value is NaN (not a number). The function supports
+     * types number, BigNumber, Fraction, Unit and Complex. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     */
+    isNaN(): MathJsChain;
+
+    /**
+     * Test whether a value is negative: smaller than zero. The function
+     * supports types number, BigNumber, Fraction, and Unit. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     */
+    isNegative(): MathJsChain;
+
+    /**
+     * Test whether a value is an numeric value. The function is evaluated
+     * element-wise in case of Array or Matrix input.
+     */
+    isNumeric(): MathJsChain;
+
+    /**
+     * Test whether a value is positive: larger than zero. The function
+     * supports types number, BigNumber, Fraction, and Unit. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     */
+    isPositive(): MathJsChain;
+
+    /**
+     * Test whether a value is prime: has no divisors other than itself and
+     * one. The function supports type number, bignumber. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     */
+    isPrime(): MathJsChain;
+
+    /**
+     * Test whether a value is zero. The function can check for zero for
+     * types number, BigNumber, Fraction, Complex, and Unit. The function is
+     * evaluated element-wise in case of Array or Matrix input.
+     */
+    isZero(): MathJsChain;
+
+    /**
+     * Determine the type of a variable.
+     */
+    typeOf(): MathJsChain;
+  }
+
+  interface ImportOptions {
+    override?: boolean;
+    silent?: boolean;
+    wrap?: boolean;
+  }
+
+  interface ImportObject {
+    [key: string]: any;
+  }
+
+}
diff --git a/node_modules/mathjs/types/index.ts b/node_modules/mathjs/types/index.ts
new file mode 100644
index 0000000..09a03d2
--- /dev/null
+++ b/node_modules/mathjs/types/index.ts
@@ -0,0 +1,833 @@
+import {
+  create,
+  factory,
+  all,
+  MathJsFunctionName,
+  fractionDependencies,
+  addDependencies,
+  divideDependencies,
+  formatDependencies,
+} from 'mathjs';
+import * as assert from 'assert';
+import { expectTypeOf } from 'expect-type'
+
+// This file serves a dual purpose:
+// 1) examples of how to use math.js in TypeScript
+// 2) tests for the TypeScript declarations provided by math.js
+
+/*
+Basic usage examples
+*/
+{
+  const math = create(all);
+
+  // functions and constants
+  math.round(math.e, 3);
+  math.round(100.123, 3);
+  math.atan2(3, -3) / math.pi;
+  math.log(10000, 10);
+  math.sqrt(-4);
+  math.pow([[-1, 2], [3, 1]], 2);
+  const angle = 0.2;
+  math.add(math.pow(math.sin(angle), 2), math.pow(math.cos(angle), 2));
+
+  // std and variance check
+  math.std(1, 2, 3)
+  math.std([1, 2, 3])
+  math.std([1, 2, 3], "biased")
+  math.std([1,2, 3], 0, "biased")
+  math.std([[1,2,3], [4,5,6]], 1, "unbiased")
+  math.std([[1,2,3], [4,5,6]], 1, "uncorrected")
+  math.variance(1, 2, 3)
+  math.variance([1, 2, 3])
+  math.variance([1, 2, 3], "biased")
+  math.variance([1,2, 3], 0, "biased")
+  math.variance([[1,2,3], [4,5,6]], 1, "unbiased")
+  math.variance([[1,2,3], [4,5,6]], 1, "uncorrected")
+
+  // std and variance on chain
+  math.chain([1, 2, 3]).std("unbiased")
+  math.chain([[1, 2, 3], [4, 5, 6]]).std(0, "biased").std(0, "uncorrected")
+  math.chain([[1, 2, 3], [4, 5, 6]]).std(0, "biased").std(0, "uncorrected")
+  math.chain([1, 2, 3]).std("unbiased")
+  math.chain([[1, 2, 3], [4, 5, 6]]).variance(0, "biased")
+  math.chain([[1, 2, 3], [4, 5, 6]]).variance(1, "uncorrected").variance("unbiased")
+
+
+  // expressions
+  math.evaluate('1.2 * (2 + 4.5)');
+
+  // chained operations
+  const a = math.chain(3).add(4).multiply(2).done();
+  assert.strictEqual(a, 14);
+
+  // mixed use of different data types in functions
+  assert.deepStrictEqual(math.add(4, [5, 6]), [9, 10]); // number + Array
+  assert.deepStrictEqual(math.multiply(math.unit('5 mm'), 3), math.unit('15 mm')); // Unit * number
+  assert.deepStrictEqual(math.subtract([2, 3, 4], 5), [-3, -2, -1]); // Array - number
+  assert.deepStrictEqual(math.add(math.matrix([2, 3]), [4, 5]), math.matrix([6, 8])); // Matrix + Array
+
+  // narrowed type inference
+  const b: math.Matrix = math.add(math.matrix([2]), math.matrix([3]));
+  const c: math.Matrix = math.subtract(math.matrix([4]), math.matrix([5]));
+}
+
+/*
+Bignumbers examples
+*/
+{
+  // configure the default type of numbers as BigNumbers
+  const math = create(all, {
+    number: 'BigNumber',
+    precision: 20,
+  });
+
+  {
+    assert.deepStrictEqual(math.add(math.bignumber(0.1), math.bignumber(0.2)), math.bignumber(0.3));
+    assert.deepStrictEqual(math.divide(math.bignumber(0.3), math.bignumber(0.2)), math.bignumber(1.5));
+  }
+}
+
+/*
+Chaining examples
+*/
+{
+  const math = create(all, {});
+  const a = math.chain(3).add(4).multiply(2).done();
+  assert.strictEqual(a, 14);
+
+  // Another example, calculate square(sin(pi / 4))
+  const b = math.chain(math.pi).divide(4).sin().square().done();
+
+  // toString will return a string representation of the chain's value
+  const chain = math.chain(2).divide(3);
+  const str: string = chain.toString();
+  assert.strictEqual(str, "0.6666666666666666");
+
+  chain.valueOf();
+
+  // the function subset can be used to get or replace sub matrices
+  const array = [
+    [1, 2],
+    [3, 4],
+  ];
+  const v = math.chain(array).subset(math.index(1, 0)).done();
+  assert.strictEqual(v, 3);
+
+  const m = math.chain(array).subset(math.index(0, 0), 8).multiply(3).done();
+
+  // filtering
+  assert.deepStrictEqual(
+    math
+      .chain([-1, 0, 1.1, 2, 3, 1000])
+      .filter(math.isPositive)
+      .filter(math.isInteger)
+      .filter((n) => n !== 1000)
+      .done(),
+    [2, 3]
+  );
+}
+
+/*
+Simplify examples
+*/
+{
+  const math = create(all);
+
+  math.simplify("2 * 1 * x ^ (2 - 1)");
+  math.simplify("2 * 3 * x", { x: 4 });
+
+  const f = math.parse("2 * 1 * x ^ (2 - 1)");
+  math.simplify(f);
+
+  math.simplify("0.4 * x", {}, { exactFractions: true });
+  math.simplify("0.4 * x", {}, { exactFractions: false });
+}
+
+/*
+Complex numbers examples
+*/
+{
+  const math = create(all, {});
+  const a = math.complex(2, 3);
+  // create a complex number by providing a string with real and complex parts
+  const b = math.complex('3 - 7i');
+
+  // read the real and complex parts of the complex number
+  {
+    const x: number = a.re;
+    const y: number = a.im;
+
+    // adjust the complex value
+    a.re = 5;
+  }
+
+  // clone a complex value
+  {
+    const clone = a.clone();
+  }
+
+  // perform operations with complex numbers
+  {
+    math.add(a, b);
+    math.multiply(a, b);
+    math.sin(a);
+  }
+
+  // create a complex number from polar coordinates
+  {
+    const p: math.PolarCoordinates = { r: math.sqrt(2), phi: math.pi / 4 };
+    const c: math.Complex = math.complex(p);
+  }
+
+  // get polar coordinates of a complex number
+  {
+    const p: math.PolarCoordinates = math.complex(3, 4).toPolar();
+  }
+}
+
+/*
+Expressions examples
+*/
+{
+  const math = create(all, {});
+  // evaluate expressions
+  {
+    math.evaluate('sqrt(3^2 + 4^2)');
+  }
+
+  // evaluate multiple expressions at once
+  {
+    math.evaluate(['f = 3', 'g = 4', 'f * g']);
+  }
+
+  // get content of a parenthesis node
+  {
+    const node = math.parse('(1)');
+    if (node.type !== 'ParenthesisNode') {
+      throw Error(`expected ParenthesisNode, got ${node.type}`);
+    }
+    const innerNode = node.content;
+  }
+
+  // scope can contain both variables and functions
+  {
+    const scope = { hello: (name: string) => `hello, ${name}!` };
+    assert.strictEqual(math.evaluate('hello("hero")', scope), "hello, hero!");
+  }
+
+  // define a function as an expression
+  {
+    const scope: any = {
+      a: 3,
+      b: 4,
+    };
+    const f = math.evaluate('f(x) = x ^ a', scope);
+    f(2);
+    scope.f(2);
+  }
+
+  {
+    const node2 = math.parse('x^a');
+    const code2: math.EvalFunction = node2.compile();
+    node2.toString();
+  }
+
+  // 3. using function math.compile
+  // parse an expression
+  {
+    // provide a scope for the variable assignment
+    const code2 = math.compile('a = a + 3');
+    const scope = { a: 7 };
+    code2.evaluate(scope);
+  }
+  // 4. using a parser
+  const parser = math.parser();
+
+  // get and set variables and functions
+  {
+    assert.strictEqual(parser.evaluate('x = 7 / 2'), 3.5);
+    assert.strictEqual(parser.evaluate('x + 3'), 6.5);
+    parser.evaluate('f(x, y) = x^y'); // f(x, y)
+    assert.strictEqual(parser.evaluate('f(2, 3)'), 8);
+
+    const x = parser.get('x');
+    const f = parser.get('f');
+    const y = parser.getAll();
+    const g = f(3, 3);
+
+    parser.set('h', 500);
+    parser.set('hello', (name: string) => `hello, ${name}!`);
+  }
+
+  // clear defined functions and variables
+  parser.clear();
+}
+
+/*
+Fractions examples
+*/
+{
+  // configure the default type of numbers as Fractions
+  const math = create(all, {
+    number: 'Fraction',
+  });
+
+  const x = math.fraction(0.125);
+  const y = math.fraction('1/3');
+  math.fraction(2, 3);
+
+  math.add(x, y);
+  math.divide(x, y);
+
+  // output formatting
+  const a = math.fraction('2/3');
+}
+
+/*
+Matrices examples
+*/
+{
+  const math = create(all, {});
+
+  // create matrices and arrays. a matrix is just a wrapper around an Array,
+  // providing some handy utilities.
+  const a: math.Matrix = math.matrix([1, 4, 9, 16, 25]);
+  const b: math.Matrix = math.matrix(math.ones([2, 3]));
+  b.size();
+
+  // the Array data of a Matrix can be retrieved using valueOf()
+  const array = a.valueOf();
+
+  // Matrices can be cloned
+  const clone: math.Matrix = a.clone();
+
+  // perform operations with matrices
+  math.sqrt(a);
+  math.factorial(a);
+
+  // create and manipulate matrices. Arrays and Matrices can be used mixed.
+  {
+    const a = [
+      [1, 2],
+      [3, 4],
+    ];
+    const b: math.Matrix = math.matrix([
+      [5, 6],
+      [1, 1],
+    ]);
+
+    b.subset(math.index(1, [0, 1]), [[7, 8]]);
+    const c = math.multiply(a, b);
+    const f: math.Matrix = math.matrix([1, 0]);
+    const d: math.Matrix = f.subset(math.index(1));
+  }
+
+  // get a sub matrix
+  {
+    const a: math.Matrix = math.diag(math.range(1, 4));
+    a.subset(math.index([1, 2], [1, 2]));
+    const b: math.Matrix = math.range(1, 6);
+    b.subset(math.index(math.range(1, 4)));
+  }
+
+  // resize a multi dimensional matrix
+  {
+    const a = math.matrix();
+    a.resize([2, 2, 2], 0);
+    a.size();
+    a.resize([2, 2]);
+    a.size();
+  }
+
+  // can set a subset of a matrix to uninitialized
+  {
+    const m = math.matrix();
+    m.subset(math.index(2), 6, math.uninitialized);
+  }
+
+  // create ranges
+  {
+    math.range(1, 6);
+    math.range(0, 18, 3);
+    math.range('2:-1:-3');
+    math.factorial(math.range('1:6'));
+  }
+
+  // map matrix
+  {
+    assert.deepStrictEqual(
+      math.map([1, 2, 3], function (value) {
+        return value * value;
+      }),
+      [1, 4, 9]
+    );
+  }
+
+  // filter matrix
+  {
+    assert.deepStrictEqual(
+      math.filter([6, -2, -1, 4, 3], function (x) {
+        return x > 0;
+      }),
+      [6, 4, 3]
+    )
+    assert.deepStrictEqual(math.filter(['23', 'foo', '100', '55', 'bar'], /[0-9]+/), ["23", "100", "55"]);
+  }
+
+  // concat matrix
+  {
+    assert.deepStrictEqual(math.concat([[0, 1, 2]], [[1, 2, 3]]), [[ 0, 1, 2, 1, 2, 3 ]]);
+    assert.deepStrictEqual(math.concat([[0, 1, 2]], [[1, 2, 3]], 0), [[ 0, 1, 2 ], [ 1, 2, 3 ]]);
+  }
+
+  // Matrix is available as a constructor for instanceof checks
+  {
+    assert.strictEqual(math.matrix([1, 2, 3]) instanceof math.Matrix, true)
+  }
+}
+
+/*
+Sparse matrices examples
+*/
+{
+  const math = create(all, {});
+
+  // create a sparse matrix
+  const a = math.identity(1000, 1000, 'sparse');
+
+  // do operations with a sparse matrix
+  const b = math.multiply(a, a);
+  const c = math.multiply(b, math.complex(2, 2));
+  const d = math.matrix([0, 1]);
+  const e = math.transpose(d);
+  const f = math.multiply(e, d);
+}
+
+/*
+Units examples
+*/
+{
+  const math = create(all, {});
+
+  // units can be created by providing a value and unit name, or by providing
+  // a string with a valued unit.
+  const a = math.unit(45, 'cm'); // 450 mm
+  const b = math.unit('0.1m'); // 100 mm
+  const c = math.unit(b)
+
+  // creating units
+  math.createUnit('foo');
+  math.createUnit('furlong', '220 yards');
+  math.createUnit('furlong', '220 yards', { override: true });
+  math.createUnit('testunit', { definition: '0.555556 kelvin', offset: 459.67 });
+  math.createUnit('testunit', { definition: '0.555556 kelvin', offset: 459.67 }, { override: true });
+  math.createUnit('knot', { definition: '0.514444 m/s', aliases: ['knots', 'kt', 'kts'] });
+  math.createUnit('knot', { definition: '0.514444 m/s', aliases: ['knots', 'kt', 'kts'] }, { override: true });
+  math.createUnit(
+    'knot',
+    {
+      definition: '0.514444 m/s',
+      aliases: ['knots', 'kt', 'kts'],
+      prefixes: 'long',
+    },
+    { override: true }
+  );
+  math.createUnit(
+    {
+      foo2: {
+        prefixes: 'long',
+      },
+      bar: '40 foo',
+      baz: {
+        definition: '1 bar/hour',
+        prefixes: 'long',
+      },
+    },
+    {
+      override: true,
+    }
+  );
+  // use Unit as definition
+  math.createUnit('c', { definition: b });
+  math.createUnit('c', { definition: b }, { override: true });
+
+  // units can be added, subtracted, and multiplied or divided by numbers and by other units
+  math.add(a, b);
+  math.multiply(b, 2);
+  math.divide(math.unit('1 m'), math.unit('1 s'));
+  math.pow(math.unit('12 in'), 3);
+
+  // units can be converted to a specific type, or to a number
+  b.to('cm');
+  math.to(b, 'inch');
+  b.toNumber('cm');
+  math.number(b, 'cm');
+
+  // the expression parser supports units too
+  math.evaluate('2 inch to cm');
+
+  // units can be converted to SI
+  math.unit('1 inch').toSI();
+
+  // units can be split into other units
+  math.unit('1 m').splitUnit(['ft', 'in']);
+}
+
+/*
+Expression tree examples
+*/
+{
+  const math = create(all, {});
+
+  // Filter an expression tree
+  const node: math.MathNode = math.parse('x^2 + x/4 + 3*y');
+  const filtered: math.MathNode[] = node.filter((node: math.MathNode) => node.type === 'SymbolNode' && node.name === 'x');
+
+  const arr: string[] = filtered.map((node: math.MathNode) => node.toString());
+
+  // Traverse an expression tree
+  const node1: math.MathNode = math.parse('3 * x + 2');
+  node1.traverse((node: math.MathNode, path: string, parent: math.MathNode) => {
+    switch (node.type) {
+      case 'OperatorNode':
+        return node.type === 'OperatorNode';
+      case 'ConstantNode':
+        return node.type === 'ConstantNode';
+      case 'SymbolNode':
+        return node.type === 'SymbolNode';
+      default:
+        return;
+    }
+  });
+}
+
+/*
+Function floor examples
+*/
+{
+  const math = create(all, {});
+
+  // number input
+  assert.strictEqual(math.floor(3.2), 3);
+  assert.strictEqual(math.floor(-4.2), -5);
+
+  // number input
+  // roundoff result to 2 decimals
+  assert.strictEqual(math.floor(3.212, 2), 3.21);
+  assert.strictEqual(math.floor(-4.212, 2), -4.22);
+
+  // Complex input
+  const c = math.complex(3.24, -2.71);
+  assert.deepStrictEqual(math.floor(c), math.complex(3, -3));
+  assert.deepStrictEqual(math.floor(c, 1), math.complex(3.2, -2.8));
+
+  //array input
+  assert.deepStrictEqual(math.floor([3.2, 3.8, -4.7]), [3, 3, -5]);
+  assert.deepStrictEqual(math.floor([3.21, 3.82, -4.71], 1), [3.2, 3.8, -4.8]);
+}
+
+
+/*
+JSON serialization/deserialization
+*/
+{
+  const math = create(all, {});
+
+  const data = {
+    bigNumber: math.bignumber('1.5'),
+  };
+  const stringified = JSON.stringify(data);
+  const parsed = JSON.parse(stringified, math.reviver);
+  assert.deepStrictEqual(parsed.bigNumber, math.bignumber('1.5'));
+}
+
+/*
+Extend functionality with import
+ */
+
+declare module 'mathjs' {
+  interface MathJsStatic {
+    testFun(): number;
+    value: number;
+  }
+}
+
+{
+  const math = create(all, {});
+  const testFun = () => 5;
+
+  math.import(
+    {
+      testFun,
+      value: 10,
+    },
+    {}
+  );
+
+  math.testFun();
+
+  const a = math.value * 2;
+}
+
+/*
+Renamed functions from v5 => v6
+ */
+{
+  const math = create(all, {});
+  math.typeOf(1);
+  math.variance([1, 2, 3, 4]);
+  math.evaluate('1 + 2');
+
+  // chained operations
+  math.chain(3).typeOf().done();
+  math.chain([1, 2, 3]).variance().done();
+  math.chain('1 + 2').evaluate().done();
+}
+
+/*
+Factory Test
+ */
+{
+  // create a factory function
+  const name = 'negativeSquare';
+  const dependencies: MathJsFunctionName[] = ['multiply', 'unaryMinus'];
+  const createNegativeSquare = factory(name, dependencies, (injected) => {
+    const { multiply, unaryMinus } = injected;
+    return function negativeSquare(x: number): number {
+      return unaryMinus(multiply(x, x));
+    };
+  });
+
+  // create an instance of the function yourself:
+  const multiply = (a: number, b: number) => a * b;
+  const unaryMinus = (a: number) => -a;
+  const negativeSquare = createNegativeSquare({ multiply, unaryMinus });
+  negativeSquare(3);
+}
+
+/**
+ * Dependency map typing test from mathjs official document:
+ * https://mathjs.org/docs/custom_bundling.html#using-just-a-few-functions
+ */
+{
+  const config = {
+    // optionally, you can specify configuration
+  };
+
+  // Create just the functions we need
+  const { fraction, add, divide, format } = create(
+    {
+      fractionDependencies,
+      addDependencies,
+      divideDependencies,
+      formatDependencies,
+    },
+    config
+  );
+
+  // Use the created functions
+  const a = fraction(1, 3);
+  const b = fraction(3, 7);
+  const c = add(a, b);
+  const d = divide(a, b);
+  assert.strictEqual(format(c), "16/21");
+  assert.strictEqual(format(d), "7/9");
+}
+
+/**
+ * Custom parsing functions
+ * https://mathjs.org/docs/expressions/customization.html#customize-supported-characters
+ */
+{
+  const math = create(all, {});
+  const isAlphaOriginal = math.parse.isAlpha;
+  math.parse.isAlpha = (c, cPrev, cNext) => {
+    return isAlphaOriginal(c, cPrev, cNext) || c === "\u260E";
+  };
+
+  // now we can use the \u260E (phone) character in expressions
+  const result = math.evaluate("\u260Efoo", { "\u260Efoo": 42 });
+  assert.strictEqual(result, 42);
+}
+
+/**
+ * Util functions
+ * https://mathjs.org/docs/reference/functions.html#utils-functions
+ */
+{
+  const math = create(all, {});
+
+  // hasNumericValue function
+  assert.    strictEqual(math.hasNumericValue(2),                    true);
+  assert.    strictEqual(math.hasNumericValue('2'),                  true);
+  assert.    strictEqual(math.isNumeric('2'),                        false);
+  assert.    strictEqual(math.hasNumericValue(0),                    true);
+  assert.    strictEqual(math.hasNumericValue(math.bignumber(500)),  true);
+  assert.deepStrictEqual(math.hasNumericValue([2.3, 'foo', false]),  [true, false, true]);
+  assert.    strictEqual(math.hasNumericValue(math.fraction(4)),     true);
+  assert.    strictEqual(math.hasNumericValue(math.complex('2-4i')), false);
+}
+
+/**
+ * src/util/is functions
+ */
+{
+  const math = create(all, {});
+
+  type IsFunc = (x: unknown) => boolean;
+  const isFuncs: IsFunc[] = [
+    math.isNumber,
+    math.isBigNumber,
+    math.isComplex,
+    math.isFraction,
+    math.isUnit,
+    math.isString,
+    math.isArray,
+    math.isMatrix,
+    math.isCollection,
+    math.isDenseMatrix,
+    math.isSparseMatrix,
+    math.isRange,
+    math.isIndex,
+    math.isBoolean,
+    math.isResultSet,
+    math.isHelp,
+    math.isFunction,
+    math.isDate,
+    math.isRegExp,
+    math.isObject,
+    math.isNull,
+    math.isUndefined,
+    math.isAccessorNode,
+    math.isArrayNode,
+    math.isAssignmentNode,
+    math.isBlockNode,
+    math.isConditionalNode,
+    math.isConstantNode,
+    math.isFunctionAssignmentNode,
+    math.isFunctionNode,
+    math.isIndexNode,
+    math.isNode,
+    math.isObjectNode,
+    math.isOperatorNode,
+    math.isParenthesisNode,
+    math.isRangeNode,
+    math.isSymbolNode,
+    math.isChain
+  ]
+
+  isFuncs.forEach(f => {
+    const result = f(1);
+    const isResultBoolean = result === true || result === false;
+    assert.ok(isResultBoolean);
+  })
+
+  // Check guards do type refinement
+
+  let x: unknown
+
+  if (math.isNumber(x)) {
+    expectTypeOf(x).toMatchTypeOf<number>()
+  }
+  if (math.isBigNumber(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.BigNumber>()
+  }
+  if (math.isComplex(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Complex>()
+  }
+  if (math.isFraction(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Fraction>()
+  }
+  if (math.isUnit(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Unit>()
+  }
+  if (math.isString(x)) {
+    expectTypeOf(x).toMatchTypeOf<string>()
+  }
+  if (math.isArray(x)) {
+    expectTypeOf(x).toMatchTypeOf<unknown[]>()
+  }
+  if (math.isMatrix(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Matrix>()
+  }
+  if (math.isDenseMatrix(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Matrix>()
+  }
+  if (math.isSparseMatrix(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Matrix>()
+  }
+  if (math.isIndex(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Index>()
+  }
+  if (math.isBoolean(x)) {
+    expectTypeOf(x).toMatchTypeOf<boolean>()
+  }
+  if (math.isHelp(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.Help>()
+  }
+  if (math.isDate(x)) {
+    expectTypeOf(x).toMatchTypeOf<Date>()
+  }
+  if (math.isRegExp(x)) {
+    expectTypeOf(x).toMatchTypeOf<RegExp>()
+  }
+  if (math.isNull(x)) {
+    expectTypeOf(x).toMatchTypeOf<null>()
+  }
+  if (math.isUndefined(x)) {
+    expectTypeOf(x).toMatchTypeOf<undefined>()
+  }
+
+  if (math.isAccessorNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.AccessorNode>()
+  }
+  if (math.isArrayNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.ArrayNode>()
+  }
+  if (math.isAssignmentNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.AssignmentNode>()
+  }
+  if (math.isBlockNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.BlockNode>()
+  }
+  if (math.isConditionalNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.ConditionalNode>()
+  }
+  if (math.isConstantNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.ConstantNode>()
+  }
+  if (math.isFunctionAssignmentNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.FunctionAssignmentNode>()
+  }
+  if (math.isFunctionNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.FunctionNode>()
+  }
+  if (math.isIndexNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.IndexNode>()
+  }
+  if (math.isNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.MathNodeCommon>()
+  }
+  if (math.isNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.MathNodeCommon>()
+  }
+  if (math.isObjectNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.ObjectNode>()
+  }
+  if (math.isOperatorNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.OperatorNode>()
+  }
+  if (math.isParenthesisNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.ParenthesisNode>()
+  }
+  if (math.isRangeNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.RangeNode>()
+  }
+  if (math.isSymbolNode(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.SymbolNode>()
+  }
+  if (math.isChain(x)) {
+    expectTypeOf(x).toMatchTypeOf<math.MathJsChain>()
+  }
+}
diff --git a/node_modules/mathjs/types/tsconfig.json b/node_modules/mathjs/types/tsconfig.json
new file mode 100644
index 0000000..500f3c1
--- /dev/null
+++ b/node_modules/mathjs/types/tsconfig.json
@@ -0,0 +1,19 @@
+{
+  "compilerOptions": {
+    "baseUrl": ".",
+    "paths": {
+      "mathjs": ["./index.d.ts"]
+    },
+    "moduleResolution": "node",
+    "typeRoots": [],
+    "types": [],
+    "lib": ["ES6", "DOM"],
+    "module": "ESNEXT",
+    "noEmit": true,
+    "noImplicitAny": true,
+    "noImplicitThis": true,
+    "strictNullChecks": false,
+    "strictFunctionTypes": true,
+    "forceConsistentCasingInFileNames": true
+  }
+}
diff --git a/node_modules/mathjs/types/tslint.json b/node_modules/mathjs/types/tslint.json
new file mode 100644
index 0000000..422bfa8
--- /dev/null
+++ b/node_modules/mathjs/types/tslint.json
@@ -0,0 +1,6 @@
+{
+  "extends": "dtslint/dtslint.json",
+  "rules": {
+    "no-redundant-jsdoc": false
+  }
+}
diff --git a/node_modules/regenerator-runtime/LICENSE b/node_modules/regenerator-runtime/LICENSE
new file mode 100644
index 0000000..cde61b6
--- /dev/null
+++ b/node_modules/regenerator-runtime/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2014-present, Facebook, Inc.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/regenerator-runtime/README.md b/node_modules/regenerator-runtime/README.md
new file mode 100644
index 0000000..e8702ba
--- /dev/null
+++ b/node_modules/regenerator-runtime/README.md
@@ -0,0 +1,31 @@
+# regenerator-runtime
+
+Standalone runtime for
+[Regenerator](https://github.com/facebook/regenerator)-compiled generator
+and `async` functions.
+
+To import the runtime as a module (recommended), either of the following
+import styles will work:
+```js
+// CommonJS
+const regeneratorRuntime = require("regenerator-runtime");
+
+// ECMAScript 2015
+import regeneratorRuntime from "regenerator-runtime";
+```
+
+To ensure that `regeneratorRuntime` is defined globally, either of the
+following styles will work:
+```js
+// CommonJS
+require("regenerator-runtime/runtime");
+
+// ECMAScript 2015
+import "regenerator-runtime/runtime.js";
+```
+
+To get the absolute file system path of `runtime.js`, evaluate the
+following expression:
+```js
+require("regenerator-runtime/path").path
+```
diff --git a/node_modules/regenerator-runtime/package.json b/node_modules/regenerator-runtime/package.json
new file mode 100644
index 0000000..23575f4
--- /dev/null
+++ b/node_modules/regenerator-runtime/package.json
@@ -0,0 +1,19 @@
+{
+  "name": "regenerator-runtime",
+  "author": "Ben Newman <bn@cs.stanford.edu>",
+  "description": "Runtime for Regenerator-compiled generator and async functions.",
+  "version": "0.13.9",
+  "main": "runtime.js",
+  "keywords": [
+    "regenerator",
+    "runtime",
+    "generator",
+    "async"
+  ],
+  "sideEffects": true,
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/facebook/regenerator/tree/master/packages/runtime"
+  },
+  "license": "MIT"
+}
diff --git a/node_modules/regenerator-runtime/path.js b/node_modules/regenerator-runtime/path.js
new file mode 100644
index 0000000..ced878b
--- /dev/null
+++ b/node_modules/regenerator-runtime/path.js
@@ -0,0 +1,11 @@
+/**
+ * Copyright (c) 2014-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+exports.path = require("path").join(
+  __dirname,
+  "runtime.js"
+);
diff --git a/node_modules/regenerator-runtime/runtime.js b/node_modules/regenerator-runtime/runtime.js
new file mode 100644
index 0000000..a64424e
--- /dev/null
+++ b/node_modules/regenerator-runtime/runtime.js
@@ -0,0 +1,754 @@
+/**
+ * Copyright (c) 2014-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+var runtime = (function (exports) {
+  "use strict";
+
+  var Op = Object.prototype;
+  var hasOwn = Op.hasOwnProperty;
+  var undefined; // More compressible than void 0.
+  var $Symbol = typeof Symbol === "function" ? Symbol : {};
+  var iteratorSymbol = $Symbol.iterator || "@@iterator";
+  var asyncIteratorSymbol = $Symbol.asyncIterator || "@@asyncIterator";
+  var toStringTagSymbol = $Symbol.toStringTag || "@@toStringTag";
+
+  function define(obj, key, value) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+    return obj[key];
+  }
+  try {
+    // IE 8 has a broken Object.defineProperty that only works on DOM objects.
+    define({}, "");
+  } catch (err) {
+    define = function(obj, key, value) {
+      return obj[key] = value;
+    };
+  }
+
+  function wrap(innerFn, outerFn, self, tryLocsList) {
+    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.
+    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;
+    var generator = Object.create(protoGenerator.prototype);
+    var context = new Context(tryLocsList || []);
+
+    // The ._invoke method unifies the implementations of the .next,
+    // .throw, and .return methods.
+    generator._invoke = makeInvokeMethod(innerFn, self, context);
+
+    return generator;
+  }
+  exports.wrap = wrap;
+
+  // Try/catch helper to minimize deoptimizations. Returns a completion
+  // record like context.tryEntries[i].completion. This interface could
+  // have been (and was previously) designed to take a closure to be
+  // invoked without arguments, but in all the cases we care about we
+  // already have an existing method we want to call, so there's no need
+  // to create a new function object. We can even get away with assuming
+  // the method takes exactly one argument, since that happens to be true
+  // in every case, so we don't have to touch the arguments object. The
+  // only additional allocation required is the completion record, which
+  // has a stable shape and so hopefully should be cheap to allocate.
+  function tryCatch(fn, obj, arg) {
+    try {
+      return { type: "normal", arg: fn.call(obj, arg) };
+    } catch (err) {
+      return { type: "throw", arg: err };
+    }
+  }
+
+  var GenStateSuspendedStart = "suspendedStart";
+  var GenStateSuspendedYield = "suspendedYield";
+  var GenStateExecuting = "executing";
+  var GenStateCompleted = "completed";
+
+  // Returning this object from the innerFn has the same effect as
+  // breaking out of the dispatch switch statement.
+  var ContinueSentinel = {};
+
+  // Dummy constructor functions that we use as the .constructor and
+  // .constructor.prototype properties for functions that return Generator
+  // objects. For full spec compliance, you may wish to configure your
+  // minifier not to mangle the names of these two functions.
+  function Generator() {}
+  function GeneratorFunction() {}
+  function GeneratorFunctionPrototype() {}
+
+  // This is a polyfill for %IteratorPrototype% for environments that
+  // don't natively support it.
+  var IteratorPrototype = {};
+  define(IteratorPrototype, iteratorSymbol, function () {
+    return this;
+  });
+
+  var getProto = Object.getPrototypeOf;
+  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));
+  if (NativeIteratorPrototype &&
+      NativeIteratorPrototype !== Op &&
+      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {
+    // This environment has a native %IteratorPrototype%; use it instead
+    // of the polyfill.
+    IteratorPrototype = NativeIteratorPrototype;
+  }
+
+  var Gp = GeneratorFunctionPrototype.prototype =
+    Generator.prototype = Object.create(IteratorPrototype);
+  GeneratorFunction.prototype = GeneratorFunctionPrototype;
+  define(Gp, "constructor", GeneratorFunctionPrototype);
+  define(GeneratorFunctionPrototype, "constructor", GeneratorFunction);
+  GeneratorFunction.displayName = define(
+    GeneratorFunctionPrototype,
+    toStringTagSymbol,
+    "GeneratorFunction"
+  );
+
+  // Helper for defining the .next, .throw, and .return methods of the
+  // Iterator interface in terms of a single ._invoke method.
+  function defineIteratorMethods(prototype) {
+    ["next", "throw", "return"].forEach(function(method) {
+      define(prototype, method, function(arg) {
+        return this._invoke(method, arg);
+      });
+    });
+  }
+
+  exports.isGeneratorFunction = function(genFun) {
+    var ctor = typeof genFun === "function" && genFun.constructor;
+    return ctor
+      ? ctor === GeneratorFunction ||
+        // For the native GeneratorFunction constructor, the best we can
+        // do is to check its .name property.
+        (ctor.displayName || ctor.name) === "GeneratorFunction"
+      : false;
+  };
+
+  exports.mark = function(genFun) {
+    if (Object.setPrototypeOf) {
+      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);
+    } else {
+      genFun.__proto__ = GeneratorFunctionPrototype;
+      define(genFun, toStringTagSymbol, "GeneratorFunction");
+    }
+    genFun.prototype = Object.create(Gp);
+    return genFun;
+  };
+
+  // Within the body of any async function, `await x` is transformed to
+  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test
+  // `hasOwn.call(value, "__await")` to determine if the yielded value is
+  // meant to be awaited.
+  exports.awrap = function(arg) {
+    return { __await: arg };
+  };
+
+  function AsyncIterator(generator, PromiseImpl) {
+    function invoke(method, arg, resolve, reject) {
+      var record = tryCatch(generator[method], generator, arg);
+      if (record.type === "throw") {
+        reject(record.arg);
+      } else {
+        var result = record.arg;
+        var value = result.value;
+        if (value &&
+            typeof value === "object" &&
+            hasOwn.call(value, "__await")) {
+          return PromiseImpl.resolve(value.__await).then(function(value) {
+            invoke("next", value, resolve, reject);
+          }, function(err) {
+            invoke("throw", err, resolve, reject);
+          });
+        }
+
+        return PromiseImpl.resolve(value).then(function(unwrapped) {
+          // When a yielded Promise is resolved, its final value becomes
+          // the .value of the Promise<{value,done}> result for the
+          // current iteration.
+          result.value = unwrapped;
+          resolve(result);
+        }, function(error) {
+          // If a rejected Promise was yielded, throw the rejection back
+          // into the async generator function so it can be handled there.
+          return invoke("throw", error, resolve, reject);
+        });
+      }
+    }
+
+    var previousPromise;
+
+    function enqueue(method, arg) {
+      function callInvokeWithMethodAndArg() {
+        return new PromiseImpl(function(resolve, reject) {
+          invoke(method, arg, resolve, reject);
+        });
+      }
+
+      return previousPromise =
+        // If enqueue has been called before, then we want to wait until
+        // all previous Promises have been resolved before calling invoke,
+        // so that results are always delivered in the correct order. If
+        // enqueue has not been called before, then it is important to
+        // call invoke immediately, without waiting on a callback to fire,
+        // so that the async generator function has the opportunity to do
+        // any necessary setup in a predictable way. This predictability
+        // is why the Promise constructor synchronously invokes its
+        // executor callback, and why async functions synchronously
+        // execute code before the first await. Since we implement simple
+        // async functions in terms of async generators, it is especially
+        // important to get this right, even though it requires care.
+        previousPromise ? previousPromise.then(
+          callInvokeWithMethodAndArg,
+          // Avoid propagating failures to Promises returned by later
+          // invocations of the iterator.
+          callInvokeWithMethodAndArg
+        ) : callInvokeWithMethodAndArg();
+    }
+
+    // Define the unified helper method that is used to implement .next,
+    // .throw, and .return (see defineIteratorMethods).
+    this._invoke = enqueue;
+  }
+
+  defineIteratorMethods(AsyncIterator.prototype);
+  define(AsyncIterator.prototype, asyncIteratorSymbol, function () {
+    return this;
+  });
+  exports.AsyncIterator = AsyncIterator;
+
+  // Note that simple async functions are implemented on top of
+  // AsyncIterator objects; they just return a Promise for the value of
+  // the final result produced by the iterator.
+  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {
+    if (PromiseImpl === void 0) PromiseImpl = Promise;
+
+    var iter = new AsyncIterator(
+      wrap(innerFn, outerFn, self, tryLocsList),
+      PromiseImpl
+    );
+
+    return exports.isGeneratorFunction(outerFn)
+      ? iter // If outerFn is a generator, return the full iterator.
+      : iter.next().then(function(result) {
+          return result.done ? result.value : iter.next();
+        });
+  };
+
+  function makeInvokeMethod(innerFn, self, context) {
+    var state = GenStateSuspendedStart;
+
+    return function invoke(method, arg) {
+      if (state === GenStateExecuting) {
+        throw new Error("Generator is already running");
+      }
+
+      if (state === GenStateCompleted) {
+        if (method === "throw") {
+          throw arg;
+        }
+
+        // Be forgiving, per 25.3.3.3.3 of the spec:
+        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume
+        return doneResult();
+      }
+
+      context.method = method;
+      context.arg = arg;
+
+      while (true) {
+        var delegate = context.delegate;
+        if (delegate) {
+          var delegateResult = maybeInvokeDelegate(delegate, context);
+          if (delegateResult) {
+            if (delegateResult === ContinueSentinel) continue;
+            return delegateResult;
+          }
+        }
+
+        if (context.method === "next") {
+          // Setting context._sent for legacy support of Babel's
+          // function.sent implementation.
+          context.sent = context._sent = context.arg;
+
+        } else if (context.method === "throw") {
+          if (state === GenStateSuspendedStart) {
+            state = GenStateCompleted;
+            throw context.arg;
+          }
+
+          context.dispatchException(context.arg);
+
+        } else if (context.method === "return") {
+          context.abrupt("return", context.arg);
+        }
+
+        state = GenStateExecuting;
+
+        var record = tryCatch(innerFn, self, context);
+        if (record.type === "normal") {
+          // If an exception is thrown from innerFn, we leave state ===
+          // GenStateExecuting and loop back for another invocation.
+          state = context.done
+            ? GenStateCompleted
+            : GenStateSuspendedYield;
+
+          if (record.arg === ContinueSentinel) {
+            continue;
+          }
+
+          return {
+            value: record.arg,
+            done: context.done
+          };
+
+        } else if (record.type === "throw") {
+          state = GenStateCompleted;
+          // Dispatch the exception by looping back around to the
+          // context.dispatchException(context.arg) call above.
+          context.method = "throw";
+          context.arg = record.arg;
+        }
+      }
+    };
+  }
+
+  // Call delegate.iterator[context.method](context.arg) and handle the
+  // result, either by returning a { value, done } result from the
+  // delegate iterator, or by modifying context.method and context.arg,
+  // setting context.delegate to null, and returning the ContinueSentinel.
+  function maybeInvokeDelegate(delegate, context) {
+    var method = delegate.iterator[context.method];
+    if (method === undefined) {
+      // A .throw or .return when the delegate iterator has no .throw
+      // method always terminates the yield* loop.
+      context.delegate = null;
+
+      if (context.method === "throw") {
+        // Note: ["return"] must be used for ES3 parsing compatibility.
+        if (delegate.iterator["return"]) {
+          // If the delegate iterator has a return method, give it a
+          // chance to clean up.
+          context.method = "return";
+          context.arg = undefined;
+          maybeInvokeDelegate(delegate, context);
+
+          if (context.method === "throw") {
+            // If maybeInvokeDelegate(context) changed context.method from
+            // "return" to "throw", let that override the TypeError below.
+            return ContinueSentinel;
+          }
+        }
+
+        context.method = "throw";
+        context.arg = new TypeError(
+          "The iterator does not provide a 'throw' method");
+      }
+
+      return ContinueSentinel;
+    }
+
+    var record = tryCatch(method, delegate.iterator, context.arg);
+
+    if (record.type === "throw") {
+      context.method = "throw";
+      context.arg = record.arg;
+      context.delegate = null;
+      return ContinueSentinel;
+    }
+
+    var info = record.arg;
+
+    if (! info) {
+      context.method = "throw";
+      context.arg = new TypeError("iterator result is not an object");
+      context.delegate = null;
+      return ContinueSentinel;
+    }
+
+    if (info.done) {
+      // Assign the result of the finished delegate to the temporary
+      // variable specified by delegate.resultName (see delegateYield).
+      context[delegate.resultName] = info.value;
+
+      // Resume execution at the desired location (see delegateYield).
+      context.next = delegate.nextLoc;
+
+      // If context.method was "throw" but the delegate handled the
+      // exception, let the outer generator proceed normally. If
+      // context.method was "next", forget context.arg since it has been
+      // "consumed" by the delegate iterator. If context.method was
+      // "return", allow the original .return call to continue in the
+      // outer generator.
+      if (context.method !== "return") {
+        context.method = "next";
+        context.arg = undefined;
+      }
+
+    } else {
+      // Re-yield the result returned by the delegate method.
+      return info;
+    }
+
+    // The delegate iterator is finished, so forget it and continue with
+    // the outer generator.
+    context.delegate = null;
+    return ContinueSentinel;
+  }
+
+  // Define Generator.prototype.{next,throw,return} in terms of the
+  // unified ._invoke helper method.
+  defineIteratorMethods(Gp);
+
+  define(Gp, toStringTagSymbol, "Generator");
+
+  // A Generator should always return itself as the iterator object when the
+  // @@iterator function is called on it. Some browsers' implementations of the
+  // iterator prototype chain incorrectly implement this, causing the Generator
+  // object to not be returned from this call. This ensures that doesn't happen.
+  // See https://github.com/facebook/regenerator/issues/274 for more details.
+  define(Gp, iteratorSymbol, function() {
+    return this;
+  });
+
+  define(Gp, "toString", function() {
+    return "[object Generator]";
+  });
+
+  function pushTryEntry(locs) {
+    var entry = { tryLoc: locs[0] };
+
+    if (1 in locs) {
+      entry.catchLoc = locs[1];
+    }
+
+    if (2 in locs) {
+      entry.finallyLoc = locs[2];
+      entry.afterLoc = locs[3];
+    }
+
+    this.tryEntries.push(entry);
+  }
+
+  function resetTryEntry(entry) {
+    var record = entry.completion || {};
+    record.type = "normal";
+    delete record.arg;
+    entry.completion = record;
+  }
+
+  function Context(tryLocsList) {
+    // The root entry object (effectively a try statement without a catch
+    // or a finally block) gives us a place to store values thrown from
+    // locations where there is no enclosing try statement.
+    this.tryEntries = [{ tryLoc: "root" }];
+    tryLocsList.forEach(pushTryEntry, this);
+    this.reset(true);
+  }
+
+  exports.keys = function(object) {
+    var keys = [];
+    for (var key in object) {
+      keys.push(key);
+    }
+    keys.reverse();
+
+    // Rather than returning an object with a next method, we keep
+    // things simple and return the next function itself.
+    return function next() {
+      while (keys.length) {
+        var key = keys.pop();
+        if (key in object) {
+          next.value = key;
+          next.done = false;
+          return next;
+        }
+      }
+
+      // To avoid creating an additional object, we just hang the .value
+      // and .done properties off the next function object itself. This
+      // also ensures that the minifier will not anonymize the function.
+      next.done = true;
+      return next;
+    };
+  };
+
+  function values(iterable) {
+    if (iterable) {
+      var iteratorMethod = iterable[iteratorSymbol];
+      if (iteratorMethod) {
+        return iteratorMethod.call(iterable);
+      }
+
+      if (typeof iterable.next === "function") {
+        return iterable;
+      }
+
+      if (!isNaN(iterable.length)) {
+        var i = -1, next = function next() {
+          while (++i < iterable.length) {
+            if (hasOwn.call(iterable, i)) {
+              next.value = iterable[i];
+              next.done = false;
+              return next;
+            }
+          }
+
+          next.value = undefined;
+          next.done = true;
+
+          return next;
+        };
+
+        return next.next = next;
+      }
+    }
+
+    // Return an iterator with no values.
+    return { next: doneResult };
+  }
+  exports.values = values;
+
+  function doneResult() {
+    return { value: undefined, done: true };
+  }
+
+  Context.prototype = {
+    constructor: Context,
+
+    reset: function(skipTempReset) {
+      this.prev = 0;
+      this.next = 0;
+      // Resetting context._sent for legacy support of Babel's
+      // function.sent implementation.
+      this.sent = this._sent = undefined;
+      this.done = false;
+      this.delegate = null;
+
+      this.method = "next";
+      this.arg = undefined;
+
+      this.tryEntries.forEach(resetTryEntry);
+
+      if (!skipTempReset) {
+        for (var name in this) {
+          // Not sure about the optimal order of these conditions:
+          if (name.charAt(0) === "t" &&
+              hasOwn.call(this, name) &&
+              !isNaN(+name.slice(1))) {
+            this[name] = undefined;
+          }
+        }
+      }
+    },
+
+    stop: function() {
+      this.done = true;
+
+      var rootEntry = this.tryEntries[0];
+      var rootRecord = rootEntry.completion;
+      if (rootRecord.type === "throw") {
+        throw rootRecord.arg;
+      }
+
+      return this.rval;
+    },
+
+    dispatchException: function(exception) {
+      if (this.done) {
+        throw exception;
+      }
+
+      var context = this;
+      function handle(loc, caught) {
+        record.type = "throw";
+        record.arg = exception;
+        context.next = loc;
+
+        if (caught) {
+          // If the dispatched exception was caught by a catch block,
+          // then let that catch block handle the exception normally.
+          context.method = "next";
+          context.arg = undefined;
+        }
+
+        return !! caught;
+      }
+
+      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
+        var entry = this.tryEntries[i];
+        var record = entry.completion;
+
+        if (entry.tryLoc === "root") {
+          // Exception thrown outside of any try block that could handle
+          // it, so set the completion value of the entire function to
+          // throw the exception.
+          return handle("end");
+        }
+
+        if (entry.tryLoc <= this.prev) {
+          var hasCatch = hasOwn.call(entry, "catchLoc");
+          var hasFinally = hasOwn.call(entry, "finallyLoc");
+
+          if (hasCatch && hasFinally) {
+            if (this.prev < entry.catchLoc) {
+              return handle(entry.catchLoc, true);
+            } else if (this.prev < entry.finallyLoc) {
+              return handle(entry.finallyLoc);
+            }
+
+          } else if (hasCatch) {
+            if (this.prev < entry.catchLoc) {
+              return handle(entry.catchLoc, true);
+            }
+
+          } else if (hasFinally) {
+            if (this.prev < entry.finallyLoc) {
+              return handle(entry.finallyLoc);
+            }
+
+          } else {
+            throw new Error("try statement without catch or finally");
+          }
+        }
+      }
+    },
+
+    abrupt: function(type, arg) {
+      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
+        var entry = this.tryEntries[i];
+        if (entry.tryLoc <= this.prev &&
+            hasOwn.call(entry, "finallyLoc") &&
+            this.prev < entry.finallyLoc) {
+          var finallyEntry = entry;
+          break;
+        }
+      }
+
+      if (finallyEntry &&
+          (type === "break" ||
+           type === "continue") &&
+          finallyEntry.tryLoc <= arg &&
+          arg <= finallyEntry.finallyLoc) {
+        // Ignore the finally entry if control is not jumping to a
+        // location outside the try/catch block.
+        finallyEntry = null;
+      }
+
+      var record = finallyEntry ? finallyEntry.completion : {};
+      record.type = type;
+      record.arg = arg;
+
+      if (finallyEntry) {
+        this.method = "next";
+        this.next = finallyEntry.finallyLoc;
+        return ContinueSentinel;
+      }
+
+      return this.complete(record);
+    },
+
+    complete: function(record, afterLoc) {
+      if (record.type === "throw") {
+        throw record.arg;
+      }
+
+      if (record.type === "break" ||
+          record.type === "continue") {
+        this.next = record.arg;
+      } else if (record.type === "return") {
+        this.rval = this.arg = record.arg;
+        this.method = "return";
+        this.next = "end";
+      } else if (record.type === "normal" && afterLoc) {
+        this.next = afterLoc;
+      }
+
+      return ContinueSentinel;
+    },
+
+    finish: function(finallyLoc) {
+      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
+        var entry = this.tryEntries[i];
+        if (entry.finallyLoc === finallyLoc) {
+          this.complete(entry.completion, entry.afterLoc);
+          resetTryEntry(entry);
+          return ContinueSentinel;
+        }
+      }
+    },
+
+    "catch": function(tryLoc) {
+      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
+        var entry = this.tryEntries[i];
+        if (entry.tryLoc === tryLoc) {
+          var record = entry.completion;
+          if (record.type === "throw") {
+            var thrown = record.arg;
+            resetTryEntry(entry);
+          }
+          return thrown;
+        }
+      }
+
+      // The context.catch method must only be called with a location
+      // argument that corresponds to a known catch block.
+      throw new Error("illegal catch attempt");
+    },
+
+    delegateYield: function(iterable, resultName, nextLoc) {
+      this.delegate = {
+        iterator: values(iterable),
+        resultName: resultName,
+        nextLoc: nextLoc
+      };
+
+      if (this.method === "next") {
+        // Deliberately forget the last sent value so that we don't
+        // accidentally pass it on to the delegate.
+        this.arg = undefined;
+      }
+
+      return ContinueSentinel;
+    }
+  };
+
+  // Regardless of whether this script is executing as a CommonJS module
+  // or not, return the runtime object so that we can declare the variable
+  // regeneratorRuntime in the outer scope, which allows this module to be
+  // injected easily by `bin/regenerator --include-runtime script.js`.
+  return exports;
+
+}(
+  // If this script is executing as a CommonJS module, use module.exports
+  // as the regeneratorRuntime namespace. Otherwise create a new empty
+  // object. Either way, the resulting object will be used to initialize
+  // the regeneratorRuntime variable at the top of this file.
+  typeof module === "object" ? module.exports : {}
+));
+
+try {
+  regeneratorRuntime = runtime;
+} catch (accidentalStrictMode) {
+  // This module should not be running in strict mode, so the above
+  // assignment should always work unless something is misconfigured. Just
+  // in case runtime.js accidentally runs in strict mode, in modern engines
+  // we can explicitly access globalThis. In older engines we can escape
+  // strict mode using a global Function call. This could conceivably fail
+  // if a Content Security Policy forbids using Function, but in that case
+  // the proper solution is to fix the accidental strict mode problem. If
+  // you've misconfigured your bundler to force strict mode and applied a
+  // CSP to forbid Function, and you're not willing to fix either of those
+  // problems, please detail your unique predicament in a GitHub issue.
+  if (typeof globalThis === "object") {
+    globalThis.regeneratorRuntime = runtime;
+  } else {
+    Function("r", "regeneratorRuntime = r")(runtime);
+  }
+}
diff --git a/node_modules/seedrandom/.coveralls.yml b/node_modules/seedrandom/.coveralls.yml
new file mode 100644
index 0000000..9160059
--- /dev/null
+++ b/node_modules/seedrandom/.coveralls.yml
@@ -0,0 +1 @@
+service_name: travis-ci
diff --git a/node_modules/seedrandom/.nvmrc b/node_modules/seedrandom/.nvmrc
new file mode 100644
index 0000000..1e8b314
--- /dev/null
+++ b/node_modules/seedrandom/.nvmrc
@@ -0,0 +1 @@
+6
diff --git a/node_modules/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json b/node_modules/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
new file mode 100644
index 0000000..63d7513
--- /dev/null
+++ b/node_modules/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
@@ -0,0 +1 @@
+{"/home/davidbau/git/seedrandom/seedrandom.js":{"path":"/home/davidbau/git/seedrandom/seedrandom.js","statementMap":{"0":{"start":{"line":25,"column":0},"end":{"line":253,"column":2}},"1":{"start":{"line":30,"column":12},"end":{"line":30,"column":15}},"2":{"start":{"line":31,"column":13},"end":{"line":31,"column":14}},"3":{"start":{"line":32,"column":13},"end":{"line":32,"column":15}},"4":{"start":{"line":33,"column":14},"end":{"line":33,"column":22}},"5":{"start":{"line":34,"column":17},"end":{"line":34,"column":40}},"6":{"start":{"line":35,"column":19},"end":{"line":35,"column":38}},"7":{"start":{"line":36,"column":15},"end":{"line":36,"column":31}},"8":{"start":{"line":37,"column":11},"end":{"line":37,"column":20}},"9":{"start":{"line":45,"column":12},"end":{"line":45,"column":14}},"10":{"start":{"line":46,"column":2},"end":{"line":46,"column":68}},"11":{"start":{"line":49,"column":18},"end":{"line":51,"column":48}},"12":{"start":{"line":54,"column":13},"end":{"line":54,"column":26}},"13":{"start":{"line":58,"column":13},"end":{"line":73,"column":3}},"14":{"start":{"line":59,"column":12},"end":{"line":59,"column":26}},"15":{"start":{"line":60,"column":12},"end":{"line":60,"column":22}},"16":{"start":{"line":61,"column":12},"end":{"line":61,"column":13}},"17":{"start":{"line":62,"column":4},"end":{"line":66,"column":5}},"18":{"start":{"line":63,"column":6},"end":{"line":63,"column":26}},"19":{"start":{"line":64,"column":6},"end":{"line":64,"column":17}},"20":{"start":{"line":65,"column":6},"end":{"line":65,"column":20}},"21":{"start":{"line":67,"column":4},"end":{"line":71,"column":5}},"22":{"start":{"line":68,"column":6},"end":{"line":68,"column":13}},"23":{"start":{"line":69,"column":6},"end":{"line":69,"column":13}},"24":{"start":{"line":70,"column":6},"end":{"line":70,"column":15}},"25":{"start":{"line":72,"column":4},"end":{"line":72,"column":23}},"26":{"start":{"line":75,"column":2},"end":{"line":75,"column":51}},"27":{"start":{"line":75,"column":28},"end":{"line":75,"column":49}},"28":{"start":{"line":76,"column":2},"end":{"line":76,"column":61}},"29":{"start":{"line":76,"column":28},"end":{"line":76,"column":59}},"30":{"start":{"line":77,"column":2},"end":{"line":77,"column":21}},"31":{"start":{"line":80,"column":2},"end":{"line":80,"column":33}},"32":{"start":{"line":83,"column":2},"end":{"line":103,"column":17}},"33":{"start":{"line":85,"column":8},"end":{"line":90,"column":9}},"34":{"start":{"line":87,"column":10},"end":{"line":87,"column":45}},"35":{"start":{"line":87,"column":25},"end":{"line":87,"column":43}},"36":{"start":{"line":89,"column":10},"end":{"line":89,"column":60}},"37":{"start":{"line":89,"column":36},"end":{"line":89,"column":58}},"38":{"start":{"line":94,"column":8},"end":{"line":98,"column":25}},"39":{"start":{"line":94,"column":28},"end":{"line":94,"column":49}},"40":{"start":{"line":94,"column":50},"end":{"line":94,"column":62}},"41":{"start":{"line":98,"column":13},"end":{"line":98,"column":25}},"42":{"start":{"line":117,"column":18},"end":{"line":117,"column":28}},"43":{"start":{"line":118,"column":11},"end":{"line":118,"column":15}},"44":{"start":{"line":118,"column":21},"end":{"line":118,"column":22}},"45":{"start":{"line":118,"column":28},"end":{"line":118,"column":43}},"46":{"start":{"line":118,"column":49},"end":{"line":118,"column":58}},"47":{"start":{"line":121,"column":2},"end":{"line":121,"column":36}},"48":{"start":{"line":121,"column":17},"end":{"line":121,"column":34}},"49":{"start":{"line":124,"column":2},"end":{"line":126,"column":3}},"50":{"start":{"line":125,"column":4},"end":{"line":125,"column":15}},"51":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"52":{"start":{"line":128,"column":4},"end":{"line":128,"column":60}},"53":{"start":{"line":129,"column":4},"end":{"line":129,"column":13}},"54":{"start":{"line":133,"column":2},"end":{"line":146,"column":12}},"55":{"start":{"line":135,"column":15},"end":{"line":135,"column":16}},"56":{"start":{"line":136,"column":12},"end":{"line":136,"column":16}},"57":{"start":{"line":136,"column":22},"end":{"line":136,"column":26}},"58":{"start":{"line":136,"column":32},"end":{"line":136,"column":36}},"59":{"start":{"line":137,"column":4},"end":{"line":140,"column":5}},"60":{"start":{"line":138,"column":6},"end":{"line":138,"column":32}},"61":{"start":{"line":139,"column":6},"end":{"line":139,"column":78}},"62":{"start":{"line":141,"column":4},"end":{"line":141,"column":13}},"63":{"start":{"line":141,"column":14},"end":{"line":141,"column":23}},"64":{"start":{"line":142,"column":4},"end":{"line":142,"column":13}},"65":{"start":{"line":154,"column":2},"end":{"line":154,"column":12}},"66":{"start":{"line":155,"column":2},"end":{"line":155,"column":12}},"67":{"start":{"line":156,"column":2},"end":{"line":156,"column":20}},"68":{"start":{"line":157,"column":2},"end":{"line":157,"column":11}},"69":{"start":{"line":165,"column":15},"end":{"line":165,"column":17}},"70":{"start":{"line":165,"column":26},"end":{"line":165,"column":36}},"71":{"start":{"line":166,"column":2},"end":{"line":170,"column":3}},"72":{"start":{"line":167,"column":4},"end":{"line":169,"column":5}},"73":{"start":{"line":168,"column":6},"end":{"line":168,"column":70}},"74":{"start":{"line":168,"column":12},"end":{"line":168,"column":55}},"75":{"start":{"line":171,"column":2},"end":{"line":171,"column":71}},"76":{"start":{"line":180,"column":19},"end":{"line":180,"column":28}},"77":{"start":{"line":180,"column":41},"end":{"line":180,"column":42}},"78":{"start":{"line":181,"column":2},"end":{"line":184,"column":3}},"79":{"start":{"line":182,"column":4},"end":{"line":183,"column":74}},"80":{"start":{"line":185,"column":2},"end":{"line":185,"column":23}},"81":{"start":{"line":194,"column":2},"end":{"line":208,"column":3}},"82":{"start":{"line":196,"column":4},"end":{"line":202,"column":5}},"83":{"start":{"line":198,"column":6},"end":{"line":198,"column":23}},"84":{"start":{"line":200,"column":6},"end":{"line":200,"column":34}},"85":{"start":{"line":201,"column":6},"end":{"line":201,"column":62}},"86":{"start":{"line":203,"column":4},"end":{"line":203,"column":25}},"87":{"start":{"line":205,"column":18},"end":{"line":205,"column":34}},"88":{"start":{"line":206,"column":18},"end":{"line":206,"column":44}},"89":{"start":{"line":207,"column":4},"end":{"line":207,"column":71}},"90":{"start":{"line":216,"column":2},"end":{"line":216,"column":41}},"91":{"start":{"line":226,"column":0},"end":{"line":226,"column":28}},"92":{"start":{"line":232,"column":0},"end":{"line":243,"column":1}},"93":{"start":{"line":233,"column":2},"end":{"line":233,"column":30}},"94":{"start":{"line":235,"column":2},"end":{"line":237,"column":17}},"95":{"start":{"line":236,"column":4},"end":{"line":236,"column":35}},"96":{"start":{"line":238,"column":7},"end":{"line":243,"column":1}},"97":{"start":{"line":239,"column":2},"end":{"line":239,"column":44}},"98":{"start":{"line":239,"column":22},"end":{"line":239,"column":40}},"99":{"start":{"line":242,"column":2},"end":{"line":242,"column":38}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":25,"column":1},"end":{"line":25,"column":2}},"loc":{"start":{"line":25,"column":31},"end":{"line":247,"column":1}},"line":25},"1":{"name":"seedrandom","decl":{"start":{"line":44,"column":9},"end":{"line":44,"column":19}},"loc":{"start":{"line":44,"column":45},"end":{"line":104,"column":1}},"line":44},"2":{"name":"(anonymous_2)","decl":{"start":{"line":58,"column":13},"end":{"line":58,"column":14}},"loc":{"start":{"line":58,"column":24},"end":{"line":73,"column":3}},"line":58},"3":{"name":"(anonymous_3)","decl":{"start":{"line":75,"column":15},"end":{"line":75,"column":16}},"loc":{"start":{"line":75,"column":26},"end":{"line":75,"column":51}},"line":75},"4":{"name":"(anonymous_4)","decl":{"start":{"line":76,"column":15},"end":{"line":76,"column":16}},"loc":{"start":{"line":76,"column":26},"end":{"line":76,"column":61}},"line":76},"5":{"name":"(anonymous_5)","decl":{"start":{"line":84,"column":6},"end":{"line":84,"column":7}},"loc":{"start":{"line":84,"column":48},"end":{"line":99,"column":7}},"line":84},"6":{"name":"(anonymous_6)","decl":{"start":{"line":89,"column":23},"end":{"line":89,"column":24}},"loc":{"start":{"line":89,"column":34},"end":{"line":89,"column":60}},"line":89},"7":{"name":"ARC4","decl":{"start":{"line":116,"column":9},"end":{"line":116,"column":13}},"loc":{"start":{"line":116,"column":19},"end":{"line":147,"column":1}},"line":116},"8":{"name":"(anonymous_8)","decl":{"start":{"line":133,"column":10},"end":{"line":133,"column":11}},"loc":{"start":{"line":133,"column":26},"end":{"line":146,"column":3}},"line":133},"9":{"name":"copy","decl":{"start":{"line":153,"column":9},"end":{"line":153,"column":13}},"loc":{"start":{"line":153,"column":20},"end":{"line":158,"column":1}},"line":153},"10":{"name":"flatten","decl":{"start":{"line":164,"column":9},"end":{"line":164,"column":16}},"loc":{"start":{"line":164,"column":29},"end":{"line":172,"column":1}},"line":164},"11":{"name":"mixkey","decl":{"start":{"line":179,"column":9},"end":{"line":179,"column":15}},"loc":{"start":{"line":179,"column":27},"end":{"line":186,"column":1}},"line":179},"12":{"name":"autoseed","decl":{"start":{"line":193,"column":9},"end":{"line":193,"column":17}},"loc":{"start":{"line":193,"column":20},"end":{"line":209,"column":1}},"line":193},"13":{"name":"tostring","decl":{"start":{"line":215,"column":9},"end":{"line":215,"column":17}},"loc":{"start":{"line":215,"column":21},"end":{"line":217,"column":1}},"line":215},"14":{"name":"(anonymous_14)","decl":{"start":{"line":239,"column":9},"end":{"line":239,"column":10}},"loc":{"start":{"line":239,"column":20},"end":{"line":239,"column":42}},"line":239}},"branchMap":{"0":{"loc":{"start":{"line":46,"column":12},"end":{"line":46,"column":67}},"type":"cond-expr","locations":[{"start":{"line":46,"column":32},"end":{"line":46,"column":49}},{"start":{"line":46,"column":53},"end":{"line":46,"column":66}}],"line":46},"1":{"loc":{"start":{"line":46,"column":53},"end":{"line":46,"column":66}},"type":"binary-expr","locations":[{"start":{"line":46,"column":53},"end":{"line":46,"column":60}},{"start":{"line":46,"column":64},"end":{"line":46,"column":66}}],"line":46},"2":{"loc":{"start":{"line":50,"column":4},"end":{"line":51,"column":38}},"type":"cond-expr","locations":[{"start":{"line":50,"column":22},"end":{"line":50,"column":44}},{"start":{"line":51,"column":4},"end":{"line":51,"column":38}}],"line":50},"3":{"loc":{"start":{"line":51,"column":4},"end":{"line":51,"column":38}},"type":"cond-expr","locations":[{"start":{"line":51,"column":21},"end":{"line":51,"column":31}},{"start":{"line":51,"column":34},"end":{"line":51,"column":38}}],"line":51},"4":{"loc":{"start":{"line":83,"column":10},"end":{"line":99,"column":7}},"type":"binary-expr","locations":[{"start":{"line":83,"column":10},"end":{"line":83,"column":22}},{"start":{"line":83,"column":26},"end":{"line":83,"column":34}},{"start":{"line":84,"column":6},"end":{"line":99,"column":7}}],"line":83},"5":{"loc":{"start":{"line":85,"column":8},"end":{"line":90,"column":9}},"type":"if","locations":[{"start":{"line":85,"column":8},"end":{"line":90,"column":9}},{"start":{"line":85,"column":8},"end":{"line":90,"column":9}}],"line":85},"6":{"loc":{"start":{"line":87,"column":10},"end":{"line":87,"column":45}},"type":"if","locations":[{"start":{"line":87,"column":10},"end":{"line":87,"column":45}},{"start":{"line":87,"column":10},"end":{"line":87,"column":45}}],"line":87},"7":{"loc":{"start":{"line":94,"column":8},"end":{"line":98,"column":25}},"type":"if","locations":[{"start":{"line":94,"column":8},"end":{"line":98,"column":25}},{"start":{"line":94,"column":8},"end":{"line":98,"column":25}}],"line":94},"8":{"loc":{"start":{"line":102,"column":2},"end":{"line":102,"column":55}},"type":"cond-expr","locations":[{"start":{"line":102,"column":24},"end":{"line":102,"column":38}},{"start":{"line":102,"column":42},"end":{"line":102,"column":54}}],"line":102},"9":{"loc":{"start":{"line":121,"column":2},"end":{"line":121,"column":36}},"type":"if","locations":[{"start":{"line":121,"column":2},"end":{"line":121,"column":36}},{"start":{"line":121,"column":2},"end":{"line":121,"column":36}}],"line":121},"10":{"loc":{"start":{"line":166,"column":2},"end":{"line":170,"column":3}},"type":"if","locations":[{"start":{"line":166,"column":2},"end":{"line":170,"column":3}},{"start":{"line":166,"column":2},"end":{"line":170,"column":3}}],"line":166},"11":{"loc":{"start":{"line":166,"column":6},"end":{"line":166,"column":30}},"type":"binary-expr","locations":[{"start":{"line":166,"column":6},"end":{"line":166,"column":11}},{"start":{"line":166,"column":15},"end":{"line":166,"column":30}}],"line":166},"12":{"loc":{"start":{"line":171,"column":10},"end":{"line":171,"column":69}},"type":"cond-expr","locations":[{"start":{"line":171,"column":26},"end":{"line":171,"column":32}},{"start":{"line":171,"column":35},"end":{"line":171,"column":69}}],"line":171},"13":{"loc":{"start":{"line":171,"column":35},"end":{"line":171,"column":69}},"type":"cond-expr","locations":[{"start":{"line":171,"column":53},"end":{"line":171,"column":56}},{"start":{"line":171,"column":59},"end":{"line":171,"column":69}}],"line":171},"14":{"loc":{"start":{"line":196,"column":4},"end":{"line":202,"column":5}},"type":"if","locations":[{"start":{"line":196,"column":4},"end":{"line":202,"column":5}},{"start":{"line":196,"column":4},"end":{"line":202,"column":5}}],"line":196},"15":{"loc":{"start":{"line":196,"column":8},"end":{"line":196,"column":52}},"type":"binary-expr","locations":[{"start":{"line":196,"column":8},"end":{"line":196,"column":18}},{"start":{"line":196,"column":23},"end":{"line":196,"column":51}}],"line":196},"16":{"loc":{"start":{"line":201,"column":7},"end":{"line":201,"column":39}},"type":"binary-expr","locations":[{"start":{"line":201,"column":7},"end":{"line":201,"column":20}},{"start":{"line":201,"column":24},"end":{"line":201,"column":39}}],"line":201},"17":{"loc":{"start":{"line":206,"column":18},"end":{"line":206,"column":44}},"type":"binary-expr","locations":[{"start":{"line":206,"column":18},"end":{"line":206,"column":25}},{"start":{"line":206,"column":29},"end":{"line":206,"column":44}}],"line":206},"18":{"loc":{"start":{"line":232,"column":0},"end":{"line":243,"column":1}},"type":"if","locations":[{"start":{"line":232,"column":0},"end":{"line":243,"column":1}},{"start":{"line":232,"column":0},"end":{"line":243,"column":1}}],"line":232},"19":{"loc":{"start":{"line":232,"column":4},"end":{"line":232,"column":49}},"type":"binary-expr","locations":[{"start":{"line":232,"column":4},"end":{"line":232,"column":31}},{"start":{"line":232,"column":35},"end":{"line":232,"column":49}}],"line":232},"20":{"loc":{"start":{"line":238,"column":7},"end":{"line":243,"column":1}},"type":"if","locations":[{"start":{"line":238,"column":7},"end":{"line":243,"column":1}},{"start":{"line":238,"column":7},"end":{"line":243,"column":1}}],"line":238},"21":{"loc":{"start":{"line":238,"column":11},"end":{"line":238,"column":54}},"type":"binary-expr","locations":[{"start":{"line":238,"column":11},"end":{"line":238,"column":40}},{"start":{"line":238,"column":44},"end":{"line":238,"column":54}}],"line":238},"22":{"loc":{"start":{"line":250,"column":2},"end":{"line":250,"column":45}},"type":"cond-expr","locations":[{"start":{"line":250,"column":34},"end":{"line":250,"column":38}},{"start":{"line":250,"column":41},"end":{"line":250,"column":45}}],"line":250}},"s":{"0":6,"1":6,"2":6,"3":6,"4":6,"5":6,"6":6,"7":6,"8":6,"9":23,"10":23,"11":23,"12":23,"13":23,"14":3694,"15":3694,"16":3694,"17":3694,"18":3917,"19":3917,"20":3917,"21":3694,"22":9249,"23":9249,"24":9249,"25":3694,"26":23,"27":1025,"28":23,"29":4100001,"30":23,"31":23,"32":23,"33":20,"34":4,"35":2,"36":4,"37":2,"38":20,"39":1,"40":1,"41":19,"42":23,"43":23,"44":23,"45":23,"46":23,"47":23,"48":1,"49":23,"50":5888,"51":23,"52":5888,"53":5888,"54":23,"55":4108660,"56":4108660,"57":4108660,"58":4108660,"59":4108660,"60":16436073,"61":16436073,"62":4108660,"63":4108660,"64":4108660,"65":4,"66":4,"67":4,"68":4,"69":32,"70":32,"71":32,"72":4,"73":9,"74":9,"75":32,"76":52,"77":52,"78":52,"79":7735,"80":52,"81":4,"82":4,"83":3,"84":1,"85":1,"86":3,"87":1,"88":1,"89":1,"90":81,"91":6,"92":6,"93":6,"94":6,"95":6,"96":0,"97":0,"98":0,"99":0},"f":{"0":6,"1":23,"2":3694,"3":1025,"4":4100001,"5":20,"6":2,"7":23,"8":4108660,"9":4,"10":32,"11":52,"12":4,"13":81,"14":0},"b":{"0":[1,22],"1":[22,11],"2":[2,21],"3":[4,17],"4":[23,21,20],"5":[4,16],"6":[2,2],"7":[1,19],"8":[4,19],"9":[1,22],"10":[4,28],"11":[32,32],"12":[3,29],"13":[23,6],"14":[3,1],"15":[4,3],"16":[1,1],"17":[1,0],"18":[6,0],"19":[6,6],"20":[0,0],"21":[0,0],"22":[0,6]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"51713684804e6a2df630b16f82a817311168866e","contentHash":"8249b27b9573baed43d58f17ab1b4f20f9b703bbe06145f517fc6c05c6b6cfa4"},"/home/davidbau/git/seedrandom/lib/xor128.js":{"path":"/home/davidbau/git/seedrandom/lib/xor128.js","statementMap":{"0":{"start":{"line":4,"column":0},"end":{"line":79,"column":2}},"1":{"start":{"line":7,"column":11},"end":{"line":7,"column":15}},"2":{"start":{"line":7,"column":27},"end":{"line":7,"column":29}},"3":{"start":{"line":9,"column":2},"end":{"line":9,"column":11}},"4":{"start":{"line":10,"column":2},"end":{"line":10,"column":11}},"5":{"start":{"line":11,"column":2},"end":{"line":11,"column":11}},"6":{"start":{"line":12,"column":2},"end":{"line":12,"column":11}},"7":{"start":{"line":15,"column":2},"end":{"line":21,"column":4}},"8":{"start":{"line":16,"column":12},"end":{"line":16,"column":31}},"9":{"start":{"line":17,"column":4},"end":{"line":17,"column":16}},"10":{"start":{"line":18,"column":4},"end":{"line":18,"column":16}},"11":{"start":{"line":19,"column":4},"end":{"line":19,"column":16}},"12":{"start":{"line":20,"column":4},"end":{"line":20,"column":49}},"13":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"14":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"15":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"16":{"start":{"line":32,"column":2},"end":{"line":35,"column":3}},"17":{"start":{"line":32,"column":15},"end":{"line":32,"column":16}},"18":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"19":{"start":{"line":34,"column":4},"end":{"line":34,"column":14}},"20":{"start":{"line":39,"column":2},"end":{"line":39,"column":12}},"21":{"start":{"line":40,"column":2},"end":{"line":40,"column":12}},"22":{"start":{"line":41,"column":2},"end":{"line":41,"column":12}},"23":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"24":{"start":{"line":43,"column":2},"end":{"line":43,"column":11}},"25":{"start":{"line":47,"column":11},"end":{"line":47,"column":27}},"26":{"start":{"line":48,"column":14},"end":{"line":48,"column":32}},"27":{"start":{"line":49,"column":13},"end":{"line":49,"column":67}},"28":{"start":{"line":49,"column":26},"end":{"line":49,"column":65}},"29":{"start":{"line":50,"column":2},"end":{"line":57,"column":4}},"30":{"start":{"line":51,"column":4},"end":{"line":55,"column":27}},"31":{"start":{"line":52,"column":16},"end":{"line":52,"column":32}},"32":{"start":{"line":53,"column":16},"end":{"line":53,"column":47}},"33":{"start":{"line":54,"column":19},"end":{"line":54,"column":42}},"34":{"start":{"line":56,"column":4},"end":{"line":56,"column":18}},"35":{"start":{"line":58,"column":2},"end":{"line":58,"column":23}},"36":{"start":{"line":59,"column":2},"end":{"line":59,"column":20}},"37":{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},"38":{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},"39":{"start":{"line":61,"column":35},"end":{"line":61,"column":51}},"40":{"start":{"line":62,"column":4},"end":{"line":62,"column":52}},"41":{"start":{"line":62,"column":30},"end":{"line":62,"column":50}},"42":{"start":{"line":64,"column":2},"end":{"line":64,"column":14}},"43":{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},"44":{"start":{"line":68,"column":2},"end":{"line":68,"column":24}},"45":{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},"46":{"start":{"line":70,"column":2},"end":{"line":70,"column":38}},"47":{"start":{"line":70,"column":22},"end":{"line":70,"column":34}},"48":{"start":{"line":72,"column":2},"end":{"line":72,"column":21}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":4,"column":1},"end":{"line":4,"column":2}},"loc":{"start":{"line":4,"column":34},"end":{"line":75,"column":1}},"line":4},"1":{"name":"XorGen","decl":{"start":{"line":6,"column":9},"end":{"line":6,"column":15}},"loc":{"start":{"line":6,"column":22},"end":{"line":36,"column":1}},"line":6},"2":{"name":"(anonymous_2)","decl":{"start":{"line":15,"column":12},"end":{"line":15,"column":13}},"loc":{"start":{"line":15,"column":23},"end":{"line":21,"column":3}},"line":15},"3":{"name":"copy","decl":{"start":{"line":38,"column":9},"end":{"line":38,"column":13}},"loc":{"start":{"line":38,"column":20},"end":{"line":44,"column":1}},"line":38},"4":{"name":"impl","decl":{"start":{"line":46,"column":9},"end":{"line":46,"column":13}},"loc":{"start":{"line":46,"column":26},"end":{"line":65,"column":1}},"line":46},"5":{"name":"(anonymous_5)","decl":{"start":{"line":49,"column":13},"end":{"line":49,"column":14}},"loc":{"start":{"line":49,"column":24},"end":{"line":49,"column":67}},"line":49},"6":{"name":"(anonymous_6)","decl":{"start":{"line":50,"column":16},"end":{"line":50,"column":17}},"loc":{"start":{"line":50,"column":27},"end":{"line":57,"column":3}},"line":50},"7":{"name":"(anonymous_7)","decl":{"start":{"line":62,"column":17},"end":{"line":62,"column":18}},"loc":{"start":{"line":62,"column":28},"end":{"line":62,"column":52}},"line":62},"8":{"name":"(anonymous_8)","decl":{"start":{"line":70,"column":9},"end":{"line":70,"column":10}},"loc":{"start":{"line":70,"column":20},"end":{"line":70,"column":36}},"line":70}},"branchMap":{"0":{"loc":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},{"start":{"line":23,"column":2},"end":{"line":29,"column":3}}],"line":23},"1":{"loc":{"start":{"line":48,"column":14},"end":{"line":48,"column":32}},"type":"binary-expr","locations":[{"start":{"line":48,"column":14},"end":{"line":48,"column":18}},{"start":{"line":48,"column":22},"end":{"line":48,"column":32}}],"line":48},"2":{"loc":{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},"type":"if","locations":[{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},{"start":{"line":60,"column":2},"end":{"line":63,"column":3}}],"line":60},"3":{"loc":{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},"type":"if","locations":[{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},{"start":{"line":61,"column":4},"end":{"line":61,"column":51}}],"line":61},"4":{"loc":{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},"type":"if","locations":[{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},{"start":{"line":67,"column":0},"end":{"line":73,"column":1}}],"line":67},"5":{"loc":{"start":{"line":67,"column":4},"end":{"line":67,"column":28}},"type":"binary-expr","locations":[{"start":{"line":67,"column":4},"end":{"line":67,"column":10}},{"start":{"line":67,"column":14},"end":{"line":67,"column":28}}],"line":67},"6":{"loc":{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},"type":"if","locations":[{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},{"start":{"line":69,"column":7},"end":{"line":73,"column":1}}],"line":69},"7":{"loc":{"start":{"line":69,"column":11},"end":{"line":69,"column":31}},"type":"binary-expr","locations":[{"start":{"line":69,"column":11},"end":{"line":69,"column":17}},{"start":{"line":69,"column":21},"end":{"line":69,"column":31}}],"line":69},"8":{"loc":{"start":{"line":77,"column":2},"end":{"line":77,"column":39}},"type":"binary-expr","locations":[{"start":{"line":77,"column":2},"end":{"line":77,"column":29}},{"start":{"line":77,"column":33},"end":{"line":77,"column":39}}],"line":77},"9":{"loc":{"start":{"line":78,"column":2},"end":{"line":78,"column":41}},"type":"binary-expr","locations":[{"start":{"line":78,"column":2},"end":{"line":78,"column":31}},{"start":{"line":78,"column":35},"end":{"line":78,"column":41}}],"line":78}},"s":{"0":1,"1":3,"2":3,"3":3,"4":3,"5":3,"6":3,"7":3,"8":4105327,"9":4105327,"10":4105327,"11":4105327,"12":4105327,"13":3,"14":2,"15":1,"16":3,"17":3,"18":198,"19":198,"20":2,"21":2,"22":2,"23":2,"24":2,"25":3,"26":3,"27":3,"28":4102054,"29":3,"30":1025,"31":1025,"32":1025,"33":1025,"34":1025,"35":3,"36":3,"37":3,"38":2,"39":1,"40":2,"41":1,"42":3,"43":1,"44":1,"45":0,"46":0,"47":0,"48":0},"f":{"0":1,"1":3,"2":4105327,"3":2,"4":3,"5":4102054,"6":1025,"7":1,"8":0},"b":{"0":[2,1],"1":[3,2],"2":[2,1],"3":[1,1],"4":[1,0],"5":[1,1],"6":[0,0],"7":[0,0],"8":[1,1],"9":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"42c805c53b8a22e4d141f90ddecc8031ba21211b","contentHash":"2bd5b1ea82454991d6453cdd05e909475478ffed8cf6dd0ce02556ae981256d8"},"/home/davidbau/git/seedrandom/lib/xorwow.js":{"path":"/home/davidbau/git/seedrandom/lib/xorwow.js","statementMap":{"0":{"start":{"line":4,"column":0},"end":{"line":84,"column":2}},"1":{"start":{"line":7,"column":11},"end":{"line":7,"column":15}},"2":{"start":{"line":7,"column":27},"end":{"line":7,"column":29}},"3":{"start":{"line":10,"column":2},"end":{"line":15,"column":4}},"4":{"start":{"line":11,"column":13},"end":{"line":11,"column":32}},"5":{"start":{"line":12,"column":4},"end":{"line":12,"column":16}},"6":{"start":{"line":12,"column":17},"end":{"line":12,"column":29}},"7":{"start":{"line":12,"column":30},"end":{"line":12,"column":42}},"8":{"start":{"line":12,"column":43},"end":{"line":12,"column":55}},"9":{"start":{"line":13,"column":4},"end":{"line":14,"column":58}},"10":{"start":{"line":17,"column":2},"end":{"line":17,"column":11}},"11":{"start":{"line":18,"column":2},"end":{"line":18,"column":11}},"12":{"start":{"line":19,"column":2},"end":{"line":19,"column":11}},"13":{"start":{"line":20,"column":2},"end":{"line":20,"column":11}},"14":{"start":{"line":21,"column":2},"end":{"line":21,"column":11}},"15":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"16":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"17":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"18":{"start":{"line":32,"column":2},"end":{"line":38,"column":3}},"19":{"start":{"line":32,"column":15},"end":{"line":32,"column":16}},"20":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"21":{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},"22":{"start":{"line":35,"column":6},"end":{"line":35,"column":37}},"23":{"start":{"line":37,"column":4},"end":{"line":37,"column":14}},"24":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"25":{"start":{"line":43,"column":2},"end":{"line":43,"column":12}},"26":{"start":{"line":44,"column":2},"end":{"line":44,"column":12}},"27":{"start":{"line":45,"column":2},"end":{"line":45,"column":12}},"28":{"start":{"line":46,"column":2},"end":{"line":46,"column":12}},"29":{"start":{"line":47,"column":2},"end":{"line":47,"column":12}},"30":{"start":{"line":48,"column":2},"end":{"line":48,"column":11}},"31":{"start":{"line":52,"column":11},"end":{"line":52,"column":27}},"32":{"start":{"line":53,"column":14},"end":{"line":53,"column":32}},"33":{"start":{"line":54,"column":13},"end":{"line":54,"column":67}},"34":{"start":{"line":54,"column":26},"end":{"line":54,"column":65}},"35":{"start":{"line":55,"column":2},"end":{"line":62,"column":4}},"36":{"start":{"line":56,"column":4},"end":{"line":60,"column":27}},"37":{"start":{"line":57,"column":16},"end":{"line":57,"column":32}},"38":{"start":{"line":58,"column":16},"end":{"line":58,"column":47}},"39":{"start":{"line":59,"column":19},"end":{"line":59,"column":42}},"40":{"start":{"line":61,"column":4},"end":{"line":61,"column":18}},"41":{"start":{"line":63,"column":2},"end":{"line":63,"column":23}},"42":{"start":{"line":64,"column":2},"end":{"line":64,"column":20}},"43":{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},"44":{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},"45":{"start":{"line":66,"column":35},"end":{"line":66,"column":51}},"46":{"start":{"line":67,"column":4},"end":{"line":67,"column":52}},"47":{"start":{"line":67,"column":30},"end":{"line":67,"column":50}},"48":{"start":{"line":69,"column":2},"end":{"line":69,"column":14}},"49":{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},"50":{"start":{"line":73,"column":2},"end":{"line":73,"column":24}},"51":{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},"52":{"start":{"line":75,"column":2},"end":{"line":75,"column":38}},"53":{"start":{"line":75,"column":22},"end":{"line":75,"column":34}},"54":{"start":{"line":77,"column":2},"end":{"line":77,"column":21}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":4,"column":1},"end":{"line":4,"column":2}},"loc":{"start":{"line":4,"column":34},"end":{"line":80,"column":1}},"line":4},"1":{"name":"XorGen","decl":{"start":{"line":6,"column":9},"end":{"line":6,"column":15}},"loc":{"start":{"line":6,"column":22},"end":{"line":39,"column":1}},"line":6},"2":{"name":"(anonymous_2)","decl":{"start":{"line":10,"column":12},"end":{"line":10,"column":13}},"loc":{"start":{"line":10,"column":23},"end":{"line":15,"column":3}},"line":10},"3":{"name":"copy","decl":{"start":{"line":41,"column":9},"end":{"line":41,"column":13}},"loc":{"start":{"line":41,"column":20},"end":{"line":49,"column":1}},"line":41},"4":{"name":"impl","decl":{"start":{"line":51,"column":9},"end":{"line":51,"column":13}},"loc":{"start":{"line":51,"column":26},"end":{"line":70,"column":1}},"line":51},"5":{"name":"(anonymous_5)","decl":{"start":{"line":54,"column":13},"end":{"line":54,"column":14}},"loc":{"start":{"line":54,"column":24},"end":{"line":54,"column":67}},"line":54},"6":{"name":"(anonymous_6)","decl":{"start":{"line":55,"column":16},"end":{"line":55,"column":17}},"loc":{"start":{"line":55,"column":27},"end":{"line":62,"column":3}},"line":55},"7":{"name":"(anonymous_7)","decl":{"start":{"line":67,"column":17},"end":{"line":67,"column":18}},"loc":{"start":{"line":67,"column":28},"end":{"line":67,"column":52}},"line":67},"8":{"name":"(anonymous_8)","decl":{"start":{"line":75,"column":9},"end":{"line":75,"column":10}},"loc":{"start":{"line":75,"column":20},"end":{"line":75,"column":36}},"line":75}},"branchMap":{"0":{"loc":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},{"start":{"line":23,"column":2},"end":{"line":29,"column":3}}],"line":23},"1":{"loc":{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},"type":"if","locations":[{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},{"start":{"line":34,"column":4},"end":{"line":36,"column":5}}],"line":34},"2":{"loc":{"start":{"line":53,"column":14},"end":{"line":53,"column":32}},"type":"binary-expr","locations":[{"start":{"line":53,"column":14},"end":{"line":53,"column":18}},{"start":{"line":53,"column":22},"end":{"line":53,"column":32}}],"line":53},"3":{"loc":{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},"type":"if","locations":[{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},{"start":{"line":65,"column":2},"end":{"line":68,"column":3}}],"line":65},"4":{"loc":{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},"type":"if","locations":[{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},{"start":{"line":66,"column":4},"end":{"line":66,"column":51}}],"line":66},"5":{"loc":{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},"type":"if","locations":[{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},{"start":{"line":72,"column":0},"end":{"line":78,"column":1}}],"line":72},"6":{"loc":{"start":{"line":72,"column":4},"end":{"line":72,"column":28}},"type":"binary-expr","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":10}},{"start":{"line":72,"column":14},"end":{"line":72,"column":28}}],"line":72},"7":{"loc":{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},"type":"if","locations":[{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},{"start":{"line":74,"column":7},"end":{"line":78,"column":1}}],"line":74},"8":{"loc":{"start":{"line":74,"column":11},"end":{"line":74,"column":31}},"type":"binary-expr","locations":[{"start":{"line":74,"column":11},"end":{"line":74,"column":17}},{"start":{"line":74,"column":21},"end":{"line":74,"column":31}}],"line":74},"9":{"loc":{"start":{"line":82,"column":2},"end":{"line":82,"column":39}},"type":"binary-expr","locations":[{"start":{"line":82,"column":2},"end":{"line":82,"column":29}},{"start":{"line":82,"column":33},"end":{"line":82,"column":39}}],"line":82},"10":{"loc":{"start":{"line":83,"column":2},"end":{"line":83,"column":41}},"type":"binary-expr","locations":[{"start":{"line":83,"column":2},"end":{"line":83,"column":31}},{"start":{"line":83,"column":35},"end":{"line":83,"column":41}}],"line":83}},"s":{"0":1,"1":3,"2":3,"3":3,"4":4105327,"5":4105327,"6":4105327,"7":4105327,"8":4105327,"9":4105327,"10":3,"11":3,"12":3,"13":3,"14":3,"15":3,"16":2,"17":1,"18":3,"19":3,"20":198,"21":198,"22":3,"23":198,"24":2,"25":2,"26":2,"27":2,"28":2,"29":2,"30":2,"31":3,"32":3,"33":3,"34":4102054,"35":3,"36":1025,"37":1025,"38":1025,"39":1025,"40":1025,"41":3,"42":3,"43":3,"44":2,"45":1,"46":2,"47":1,"48":3,"49":1,"50":1,"51":0,"52":0,"53":0,"54":0},"f":{"0":1,"1":3,"2":4105327,"3":2,"4":3,"5":4102054,"6":1025,"7":1,"8":0},"b":{"0":[2,1],"1":[3,195],"2":[3,2],"3":[2,1],"4":[1,1],"5":[1,0],"6":[1,1],"7":[0,0],"8":[0,0],"9":[1,1],"10":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"279728a54e5ce9face1abbf1b1093f69bd5e2cef","contentHash":"870bba719eee59f28e0160645190fa7eda491db1be3c64600c523d0b510d2000"},"/home/davidbau/git/seedrandom/lib/xorshift7.js":{"path":"/home/davidbau/git/seedrandom/lib/xorshift7.js","statementMap":{"0":{"start":{"line":6,"column":0},"end":{"line":96,"column":2}},"1":{"start":{"line":9,"column":11},"end":{"line":9,"column":15}},"2":{"start":{"line":12,"column":2},"end":{"line":23,"column":4}},"3":{"start":{"line":14,"column":12},"end":{"line":14,"column":16}},"4":{"start":{"line":14,"column":22},"end":{"line":14,"column":26}},"5":{"start":{"line":15,"column":4},"end":{"line":15,"column":13}},"6":{"start":{"line":15,"column":14},"end":{"line":15,"column":29}},"7":{"start":{"line":15,"column":30},"end":{"line":15,"column":48}},"8":{"start":{"line":16,"column":4},"end":{"line":16,"column":23}},"9":{"start":{"line":16,"column":24},"end":{"line":16,"column":44}},"10":{"start":{"line":17,"column":4},"end":{"line":17,"column":23}},"11":{"start":{"line":17,"column":24},"end":{"line":17,"column":43}},"12":{"start":{"line":18,"column":4},"end":{"line":18,"column":23}},"13":{"start":{"line":18,"column":24},"end":{"line":18,"column":42}},"14":{"start":{"line":19,"column":4},"end":{"line":19,"column":23}},"15":{"start":{"line":19,"column":24},"end":{"line":19,"column":42}},"16":{"start":{"line":19,"column":43},"end":{"line":19,"column":61}},"17":{"start":{"line":20,"column":4},"end":{"line":20,"column":13}},"18":{"start":{"line":21,"column":4},"end":{"line":21,"column":23}},"19":{"start":{"line":22,"column":4},"end":{"line":22,"column":13}},"20":{"start":{"line":26,"column":18},"end":{"line":26,"column":20}},"21":{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},"22":{"start":{"line":30,"column":6},"end":{"line":30,"column":22}},"23":{"start":{"line":33,"column":6},"end":{"line":33,"column":23}},"24":{"start":{"line":34,"column":6},"end":{"line":37,"column":7}},"25":{"start":{"line":35,"column":8},"end":{"line":36,"column":56}},"26":{"start":{"line":40,"column":4},"end":{"line":40,"column":35}},"27":{"start":{"line":40,"column":25},"end":{"line":40,"column":35}},"28":{"start":{"line":41,"column":4},"end":{"line":41,"column":42}},"29":{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},"30":{"start":{"line":42,"column":16},"end":{"line":42,"column":30}},"31":{"start":{"line":42,"column":36},"end":{"line":42,"column":45}},"32":{"start":{"line":44,"column":4},"end":{"line":44,"column":13}},"33":{"start":{"line":45,"column":4},"end":{"line":45,"column":13}},"34":{"start":{"line":48,"column":4},"end":{"line":50,"column":5}},"35":{"start":{"line":49,"column":6},"end":{"line":49,"column":16}},"36":{"start":{"line":53,"column":2},"end":{"line":53,"column":17}},"37":{"start":{"line":57,"column":2},"end":{"line":57,"column":20}},"38":{"start":{"line":58,"column":2},"end":{"line":58,"column":12}},"39":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"40":{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},"41":{"start":{"line":63,"column":20},"end":{"line":63,"column":39}},"42":{"start":{"line":64,"column":11},"end":{"line":64,"column":27}},"43":{"start":{"line":65,"column":14},"end":{"line":65,"column":32}},"44":{"start":{"line":66,"column":13},"end":{"line":66,"column":67}},"45":{"start":{"line":66,"column":26},"end":{"line":66,"column":65}},"46":{"start":{"line":67,"column":2},"end":{"line":74,"column":4}},"47":{"start":{"line":68,"column":4},"end":{"line":72,"column":27}},"48":{"start":{"line":69,"column":16},"end":{"line":69,"column":32}},"49":{"start":{"line":70,"column":16},"end":{"line":70,"column":47}},"50":{"start":{"line":71,"column":19},"end":{"line":71,"column":42}},"51":{"start":{"line":73,"column":4},"end":{"line":73,"column":18}},"52":{"start":{"line":75,"column":2},"end":{"line":75,"column":23}},"53":{"start":{"line":76,"column":2},"end":{"line":76,"column":20}},"54":{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},"55":{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},"56":{"start":{"line":78,"column":17},"end":{"line":78,"column":33}},"57":{"start":{"line":79,"column":4},"end":{"line":79,"column":52}},"58":{"start":{"line":79,"column":30},"end":{"line":79,"column":50}},"59":{"start":{"line":81,"column":2},"end":{"line":81,"column":14}},"60":{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},"61":{"start":{"line":85,"column":2},"end":{"line":85,"column":24}},"62":{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},"63":{"start":{"line":87,"column":2},"end":{"line":87,"column":38}},"64":{"start":{"line":87,"column":22},"end":{"line":87,"column":34}},"65":{"start":{"line":89,"column":2},"end":{"line":89,"column":24}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":6,"column":1},"end":{"line":6,"column":2}},"loc":{"start":{"line":6,"column":34},"end":{"line":92,"column":1}},"line":6},"1":{"name":"XorGen","decl":{"start":{"line":8,"column":9},"end":{"line":8,"column":15}},"loc":{"start":{"line":8,"column":22},"end":{"line":54,"column":1}},"line":8},"2":{"name":"(anonymous_2)","decl":{"start":{"line":12,"column":12},"end":{"line":12,"column":13}},"loc":{"start":{"line":12,"column":23},"end":{"line":23,"column":3}},"line":12},"3":{"name":"init","decl":{"start":{"line":25,"column":11},"end":{"line":25,"column":15}},"loc":{"start":{"line":25,"column":26},"end":{"line":51,"column":3}},"line":25},"4":{"name":"copy","decl":{"start":{"line":56,"column":9},"end":{"line":56,"column":13}},"loc":{"start":{"line":56,"column":20},"end":{"line":60,"column":1}},"line":56},"5":{"name":"impl","decl":{"start":{"line":62,"column":9},"end":{"line":62,"column":13}},"loc":{"start":{"line":62,"column":26},"end":{"line":82,"column":1}},"line":62},"6":{"name":"(anonymous_6)","decl":{"start":{"line":66,"column":13},"end":{"line":66,"column":14}},"loc":{"start":{"line":66,"column":24},"end":{"line":66,"column":67}},"line":66},"7":{"name":"(anonymous_7)","decl":{"start":{"line":67,"column":16},"end":{"line":67,"column":17}},"loc":{"start":{"line":67,"column":27},"end":{"line":74,"column":3}},"line":67},"8":{"name":"(anonymous_8)","decl":{"start":{"line":79,"column":17},"end":{"line":79,"column":18}},"loc":{"start":{"line":79,"column":28},"end":{"line":79,"column":52}},"line":79},"9":{"name":"(anonymous_9)","decl":{"start":{"line":87,"column":9},"end":{"line":87,"column":10}},"loc":{"start":{"line":87,"column":20},"end":{"line":87,"column":36}},"line":87}},"branchMap":{"0":{"loc":{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},"type":"if","locations":[{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},{"start":{"line":28,"column":4},"end":{"line":38,"column":5}}],"line":28},"1":{"loc":{"start":{"line":41,"column":16},"end":{"line":41,"column":35}},"type":"binary-expr","locations":[{"start":{"line":41,"column":16},"end":{"line":41,"column":21}},{"start":{"line":41,"column":25},"end":{"line":41,"column":35}}],"line":41},"2":{"loc":{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},"type":"if","locations":[{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},{"start":{"line":42,"column":4},"end":{"line":42,"column":45}}],"line":42},"3":{"loc":{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},"type":"if","locations":[{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},{"start":{"line":63,"column":2},"end":{"line":63,"column":39}}],"line":63},"4":{"loc":{"start":{"line":65,"column":14},"end":{"line":65,"column":32}},"type":"binary-expr","locations":[{"start":{"line":65,"column":14},"end":{"line":65,"column":18}},{"start":{"line":65,"column":22},"end":{"line":65,"column":32}}],"line":65},"5":{"loc":{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},"type":"if","locations":[{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},{"start":{"line":77,"column":2},"end":{"line":80,"column":3}}],"line":77},"6":{"loc":{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},"type":"if","locations":[{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},{"start":{"line":78,"column":4},"end":{"line":78,"column":33}}],"line":78},"7":{"loc":{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},"type":"if","locations":[{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},{"start":{"line":84,"column":0},"end":{"line":90,"column":1}}],"line":84},"8":{"loc":{"start":{"line":84,"column":4},"end":{"line":84,"column":28}},"type":"binary-expr","locations":[{"start":{"line":84,"column":4},"end":{"line":84,"column":10}},{"start":{"line":84,"column":14},"end":{"line":84,"column":28}}],"line":84},"9":{"loc":{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},"type":"if","locations":[{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},{"start":{"line":86,"column":7},"end":{"line":90,"column":1}}],"line":86},"10":{"loc":{"start":{"line":86,"column":11},"end":{"line":86,"column":31}},"type":"binary-expr","locations":[{"start":{"line":86,"column":11},"end":{"line":86,"column":17}},{"start":{"line":86,"column":21},"end":{"line":86,"column":31}}],"line":86},"11":{"loc":{"start":{"line":94,"column":2},"end":{"line":94,"column":39}},"type":"binary-expr","locations":[{"start":{"line":94,"column":2},"end":{"line":94,"column":29}},{"start":{"line":94,"column":33},"end":{"line":94,"column":39}}],"line":94},"12":{"loc":{"start":{"line":95,"column":2},"end":{"line":95,"column":41}},"type":"binary-expr","locations":[{"start":{"line":95,"column":2},"end":{"line":95,"column":31}},{"start":{"line":95,"column":35},"end":{"line":95,"column":41}}],"line":95}},"s":{"0":1,"1":3,"2":3,"3":4105897,"4":4105897,"5":4105897,"6":4105897,"7":4105897,"8":4105897,"9":4105897,"10":4105897,"11":4105897,"12":4105897,"13":4105897,"14":4105897,"15":4105897,"16":4105897,"17":4105897,"18":4105897,"19":4105897,"20":3,"21":3,"22":2,"23":1,"24":1,"25":6,"26":3,"27":16,"28":3,"29":3,"30":2,"31":1,"32":3,"33":3,"34":3,"35":768,"36":3,"37":2,"38":2,"39":2,"40":3,"41":0,"42":3,"43":3,"44":3,"45":4102054,"46":3,"47":1025,"48":1025,"49":1025,"50":1025,"51":1025,"52":3,"53":3,"54":3,"55":2,"56":1,"57":2,"58":1,"59":3,"60":1,"61":1,"62":0,"63":0,"64":0,"65":0},"f":{"0":1,"1":3,"2":4105897,"3":3,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"b":{"0":[2,1],"1":[19,17],"2":[2,1],"3":[0,3],"4":[3,2],"5":[2,1],"6":[1,1],"7":[1,0],"8":[1,1],"9":[0,0],"10":[0,0],"11":[1,1],"12":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"131ac72069e0ca2a2df6aae06f4b2d31b91187b5","contentHash":"4aba94be2ce998b353804abdbf2962ed421abbc77501066348025b6fa45b856d"},"/home/davidbau/git/seedrandom/lib/xor4096.js":{"path":"/home/davidbau/git/seedrandom/lib/xor4096.js","statementMap":{"0":{"start":{"line":26,"column":0},"end":{"line":146,"column":2}},"1":{"start":{"line":29,"column":11},"end":{"line":29,"column":15}},"2":{"start":{"line":32,"column":2},"end":{"line":49,"column":4}},"3":{"start":{"line":33,"column":12},"end":{"line":33,"column":16}},"4":{"start":{"line":34,"column":12},"end":{"line":34,"column":16}},"5":{"start":{"line":34,"column":22},"end":{"line":34,"column":26}},"6":{"start":{"line":36,"column":4},"end":{"line":36,"column":36}},"7":{"start":{"line":38,"column":4},"end":{"line":38,"column":26}},"8":{"start":{"line":39,"column":4},"end":{"line":39,"column":31}},"9":{"start":{"line":40,"column":4},"end":{"line":40,"column":17}},"10":{"start":{"line":41,"column":4},"end":{"line":41,"column":17}},"11":{"start":{"line":42,"column":4},"end":{"line":42,"column":18}},"12":{"start":{"line":43,"column":4},"end":{"line":43,"column":18}},"13":{"start":{"line":45,"column":4},"end":{"line":45,"column":21}},"14":{"start":{"line":46,"column":4},"end":{"line":46,"column":13}},"15":{"start":{"line":48,"column":4},"end":{"line":48,"column":38}},"16":{"start":{"line":52,"column":27},"end":{"line":52,"column":29}},"17":{"start":{"line":52,"column":39},"end":{"line":52,"column":42}},"18":{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},"19":{"start":{"line":55,"column":6},"end":{"line":55,"column":15}},"20":{"start":{"line":56,"column":6},"end":{"line":56,"column":18}},"21":{"start":{"line":59,"column":6},"end":{"line":59,"column":25}},"22":{"start":{"line":60,"column":6},"end":{"line":60,"column":12}},"23":{"start":{"line":61,"column":6},"end":{"line":61,"column":43}},"24":{"start":{"line":64,"column":4},"end":{"line":78,"column":5}},"25":{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},"26":{"start":{"line":66,"column":16},"end":{"line":66,"column":61}},"27":{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},"28":{"start":{"line":68,"column":19},"end":{"line":68,"column":25}},"29":{"start":{"line":69,"column":6},"end":{"line":69,"column":19}},"30":{"start":{"line":70,"column":6},"end":{"line":70,"column":20}},"31":{"start":{"line":71,"column":6},"end":{"line":71,"column":18}},"32":{"start":{"line":72,"column":6},"end":{"line":72,"column":20}},"33":{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},"34":{"start":{"line":74,"column":8},"end":{"line":74,"column":33}},"35":{"start":{"line":75,"column":8},"end":{"line":75,"column":36}},"36":{"start":{"line":76,"column":8},"end":{"line":76,"column":33}},"37":{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},"38":{"start":{"line":81,"column":6},"end":{"line":81,"column":47}},"39":{"start":{"line":86,"column":4},"end":{"line":86,"column":12}},"40":{"start":{"line":87,"column":4},"end":{"line":95,"column":5}},"41":{"start":{"line":88,"column":6},"end":{"line":88,"column":28}},"42":{"start":{"line":89,"column":6},"end":{"line":89,"column":33}},"43":{"start":{"line":90,"column":6},"end":{"line":90,"column":19}},"44":{"start":{"line":91,"column":6},"end":{"line":91,"column":19}},"45":{"start":{"line":92,"column":6},"end":{"line":92,"column":20}},"46":{"start":{"line":93,"column":6},"end":{"line":93,"column":20}},"47":{"start":{"line":94,"column":6},"end":{"line":94,"column":19}},"48":{"start":{"line":97,"column":4},"end":{"line":97,"column":13}},"49":{"start":{"line":98,"column":4},"end":{"line":98,"column":13}},"50":{"start":{"line":99,"column":4},"end":{"line":99,"column":13}},"51":{"start":{"line":102,"column":2},"end":{"line":102,"column":17}},"52":{"start":{"line":106,"column":2},"end":{"line":106,"column":12}},"53":{"start":{"line":107,"column":2},"end":{"line":107,"column":12}},"54":{"start":{"line":108,"column":2},"end":{"line":108,"column":20}},"55":{"start":{"line":109,"column":2},"end":{"line":109,"column":11}},"56":{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},"57":{"start":{"line":113,"column":20},"end":{"line":113,"column":39}},"58":{"start":{"line":114,"column":11},"end":{"line":114,"column":27}},"59":{"start":{"line":115,"column":14},"end":{"line":115,"column":32}},"60":{"start":{"line":116,"column":13},"end":{"line":116,"column":67}},"61":{"start":{"line":116,"column":26},"end":{"line":116,"column":65}},"62":{"start":{"line":117,"column":2},"end":{"line":124,"column":4}},"63":{"start":{"line":118,"column":4},"end":{"line":122,"column":27}},"64":{"start":{"line":119,"column":16},"end":{"line":119,"column":32}},"65":{"start":{"line":120,"column":16},"end":{"line":120,"column":47}},"66":{"start":{"line":121,"column":19},"end":{"line":121,"column":42}},"67":{"start":{"line":123,"column":4},"end":{"line":123,"column":18}},"68":{"start":{"line":125,"column":2},"end":{"line":125,"column":23}},"69":{"start":{"line":126,"column":2},"end":{"line":126,"column":20}},"70":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"71":{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},"72":{"start":{"line":128,"column":17},"end":{"line":128,"column":33}},"73":{"start":{"line":129,"column":4},"end":{"line":129,"column":52}},"74":{"start":{"line":129,"column":30},"end":{"line":129,"column":50}},"75":{"start":{"line":131,"column":2},"end":{"line":131,"column":14}},"76":{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},"77":{"start":{"line":135,"column":2},"end":{"line":135,"column":24}},"78":{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},"79":{"start":{"line":137,"column":2},"end":{"line":137,"column":38}},"80":{"start":{"line":137,"column":22},"end":{"line":137,"column":34}},"81":{"start":{"line":139,"column":2},"end":{"line":139,"column":22}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":26,"column":1},"end":{"line":26,"column":2}},"loc":{"start":{"line":26,"column":34},"end":{"line":142,"column":1}},"line":26},"1":{"name":"XorGen","decl":{"start":{"line":28,"column":9},"end":{"line":28,"column":15}},"loc":{"start":{"line":28,"column":22},"end":{"line":103,"column":1}},"line":28},"2":{"name":"(anonymous_2)","decl":{"start":{"line":32,"column":12},"end":{"line":32,"column":13}},"loc":{"start":{"line":32,"column":23},"end":{"line":49,"column":3}},"line":32},"3":{"name":"init","decl":{"start":{"line":51,"column":11},"end":{"line":51,"column":15}},"loc":{"start":{"line":51,"column":26},"end":{"line":100,"column":3}},"line":51},"4":{"name":"copy","decl":{"start":{"line":105,"column":9},"end":{"line":105,"column":13}},"loc":{"start":{"line":105,"column":20},"end":{"line":110,"column":1}},"line":105},"5":{"name":"impl","decl":{"start":{"line":112,"column":9},"end":{"line":112,"column":13}},"loc":{"start":{"line":112,"column":26},"end":{"line":132,"column":1}},"line":112},"6":{"name":"(anonymous_6)","decl":{"start":{"line":116,"column":13},"end":{"line":116,"column":14}},"loc":{"start":{"line":116,"column":24},"end":{"line":116,"column":67}},"line":116},"7":{"name":"(anonymous_7)","decl":{"start":{"line":117,"column":16},"end":{"line":117,"column":17}},"loc":{"start":{"line":117,"column":27},"end":{"line":124,"column":3}},"line":117},"8":{"name":"(anonymous_8)","decl":{"start":{"line":129,"column":17},"end":{"line":129,"column":18}},"loc":{"start":{"line":129,"column":28},"end":{"line":129,"column":52}},"line":129},"9":{"name":"(anonymous_9)","decl":{"start":{"line":137,"column":9},"end":{"line":137,"column":10}},"loc":{"start":{"line":137,"column":20},"end":{"line":137,"column":36}},"line":137}},"branchMap":{"0":{"loc":{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},"type":"if","locations":[{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},{"start":{"line":53,"column":4},"end":{"line":62,"column":5}}],"line":53},"1":{"loc":{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},"type":"if","locations":[{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},{"start":{"line":66,"column":6},"end":{"line":66,"column":61}}],"line":66},"2":{"loc":{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},"type":"if","locations":[{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},{"start":{"line":68,"column":6},"end":{"line":68,"column":25}}],"line":68},"3":{"loc":{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},"type":"if","locations":[{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},{"start":{"line":73,"column":6},"end":{"line":77,"column":7}}],"line":73},"4":{"loc":{"start":{"line":76,"column":12},"end":{"line":76,"column":32}},"type":"cond-expr","locations":[{"start":{"line":76,"column":23},"end":{"line":76,"column":28}},{"start":{"line":76,"column":31},"end":{"line":76,"column":32}}],"line":76},"5":{"loc":{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},"type":"if","locations":[{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},{"start":{"line":80,"column":4},"end":{"line":82,"column":5}}],"line":80},"6":{"loc":{"start":{"line":81,"column":9},"end":{"line":81,"column":33}},"type":"binary-expr","locations":[{"start":{"line":81,"column":9},"end":{"line":81,"column":13}},{"start":{"line":81,"column":17},"end":{"line":81,"column":28}},{"start":{"line":81,"column":32},"end":{"line":81,"column":33}}],"line":81},"7":{"loc":{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},"type":"if","locations":[{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},{"start":{"line":113,"column":2},"end":{"line":113,"column":39}}],"line":113},"8":{"loc":{"start":{"line":115,"column":14},"end":{"line":115,"column":32}},"type":"binary-expr","locations":[{"start":{"line":115,"column":14},"end":{"line":115,"column":18}},{"start":{"line":115,"column":22},"end":{"line":115,"column":32}}],"line":115},"9":{"loc":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"type":"if","locations":[{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},{"start":{"line":127,"column":2},"end":{"line":130,"column":3}}],"line":127},"10":{"loc":{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},"type":"if","locations":[{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},{"start":{"line":128,"column":4},"end":{"line":128,"column":33}}],"line":128},"11":{"loc":{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},"type":"if","locations":[{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},{"start":{"line":134,"column":0},"end":{"line":140,"column":1}}],"line":134},"12":{"loc":{"start":{"line":134,"column":4},"end":{"line":134,"column":28}},"type":"binary-expr","locations":[{"start":{"line":134,"column":4},"end":{"line":134,"column":10}},{"start":{"line":134,"column":14},"end":{"line":134,"column":28}}],"line":134},"13":{"loc":{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},"type":"if","locations":[{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},{"start":{"line":136,"column":7},"end":{"line":140,"column":1}}],"line":136},"14":{"loc":{"start":{"line":136,"column":11},"end":{"line":136,"column":31}},"type":"binary-expr","locations":[{"start":{"line":136,"column":11},"end":{"line":136,"column":17}},{"start":{"line":136,"column":21},"end":{"line":136,"column":31}}],"line":136},"15":{"loc":{"start":{"line":144,"column":2},"end":{"line":144,"column":39}},"type":"binary-expr","locations":[{"start":{"line":144,"column":2},"end":{"line":144,"column":29}},{"start":{"line":144,"column":33},"end":{"line":144,"column":39}}],"line":144},"16":{"loc":{"start":{"line":145,"column":2},"end":{"line":145,"column":41}},"type":"binary-expr","locations":[{"start":{"line":145,"column":2},"end":{"line":145,"column":31}},{"start":{"line":145,"column":35},"end":{"line":145,"column":41}}],"line":145}},"s":{"0":1,"1":3,"2":3,"3":4105129,"4":4105129,"5":4105129,"6":4105129,"7":4105129,"8":4105129,"9":4105129,"10":4105129,"11":4105129,"12":4105129,"13":4105129,"14":4105129,"15":4105129,"16":3,"17":3,"18":3,"19":2,"20":2,"21":1,"22":1,"23":1,"24":3,"25":480,"26":160,"27":480,"28":3,"29":480,"30":480,"31":480,"32":480,"33":480,"34":384,"35":384,"36":384,"37":3,"38":0,"39":3,"40":3,"41":1536,"42":1536,"43":1536,"44":1536,"45":1536,"46":1536,"47":1536,"48":3,"49":3,"50":3,"51":3,"52":2,"53":2,"54":2,"55":2,"56":3,"57":0,"58":3,"59":3,"60":3,"61":4102054,"62":3,"63":1025,"64":1025,"65":1025,"66":1025,"67":1025,"68":3,"69":3,"70":3,"71":2,"72":1,"73":2,"74":1,"75":3,"76":1,"77":1,"78":0,"79":0,"80":0,"81":0},"f":{"0":1,"1":3,"2":4105129,"3":3,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"b":{"0":[2,1],"1":[160,320],"2":[3,477],"3":[384,96],"4":[0,384],"5":[0,3],"6":[0,0,0],"7":[0,3],"8":[3,2],"9":[2,1],"10":[1,1],"11":[1,0],"12":[1,1],"13":[0,0],"14":[0,0],"15":[1,1],"16":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"5de096409f62b3565b1ce6d3136eb46f59ce3abe","contentHash":"2e41775c8739abfedd52237d6d32ba6c6ccbf9e10e6721c3a313ec1d67788df4"},"/home/davidbau/git/seedrandom/lib/tychei.js":{"path":"/home/davidbau/git/seedrandom/lib/tychei.js","statementMap":{"0":{"start":{"line":5,"column":0},"end":{"line":101,"column":2}},"1":{"start":{"line":8,"column":11},"end":{"line":8,"column":15}},"2":{"start":{"line":8,"column":27},"end":{"line":8,"column":29}},"3":{"start":{"line":11,"column":2},"end":{"line":21,"column":4}},"4":{"start":{"line":12,"column":12},"end":{"line":12,"column":16}},"5":{"start":{"line":12,"column":22},"end":{"line":12,"column":26}},"6":{"start":{"line":12,"column":32},"end":{"line":12,"column":36}},"7":{"start":{"line":12,"column":42},"end":{"line":12,"column":46}},"8":{"start":{"line":13,"column":4},"end":{"line":13,"column":34}},"9":{"start":{"line":14,"column":4},"end":{"line":14,"column":20}},"10":{"start":{"line":15,"column":4},"end":{"line":15,"column":34}},"11":{"start":{"line":16,"column":4},"end":{"line":16,"column":20}},"12":{"start":{"line":17,"column":4},"end":{"line":17,"column":42}},"13":{"start":{"line":18,"column":4},"end":{"line":18,"column":27}},"14":{"start":{"line":19,"column":4},"end":{"line":19,"column":38}},"15":{"start":{"line":20,"column":4},"end":{"line":20,"column":30}},"16":{"start":{"line":39,"column":2},"end":{"line":39,"column":11}},"17":{"start":{"line":40,"column":2},"end":{"line":40,"column":11}},"18":{"start":{"line":41,"column":2},"end":{"line":41,"column":24}},"19":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"20":{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},"21":{"start":{"line":46,"column":4},"end":{"line":46,"column":36}},"22":{"start":{"line":47,"column":4},"end":{"line":47,"column":20}},"23":{"start":{"line":50,"column":4},"end":{"line":50,"column":20}},"24":{"start":{"line":54,"column":2},"end":{"line":57,"column":3}},"25":{"start":{"line":54,"column":15},"end":{"line":54,"column":16}},"26":{"start":{"line":55,"column":4},"end":{"line":55,"column":38}},"27":{"start":{"line":56,"column":4},"end":{"line":56,"column":14}},"28":{"start":{"line":61,"column":2},"end":{"line":61,"column":12}},"29":{"start":{"line":62,"column":2},"end":{"line":62,"column":12}},"30":{"start":{"line":63,"column":2},"end":{"line":63,"column":12}},"31":{"start":{"line":64,"column":2},"end":{"line":64,"column":12}},"32":{"start":{"line":65,"column":2},"end":{"line":65,"column":11}},"33":{"start":{"line":69,"column":11},"end":{"line":69,"column":27}},"34":{"start":{"line":70,"column":14},"end":{"line":70,"column":32}},"35":{"start":{"line":71,"column":13},"end":{"line":71,"column":67}},"36":{"start":{"line":71,"column":26},"end":{"line":71,"column":65}},"37":{"start":{"line":72,"column":2},"end":{"line":79,"column":4}},"38":{"start":{"line":73,"column":4},"end":{"line":77,"column":27}},"39":{"start":{"line":74,"column":16},"end":{"line":74,"column":32}},"40":{"start":{"line":75,"column":16},"end":{"line":75,"column":47}},"41":{"start":{"line":76,"column":19},"end":{"line":76,"column":42}},"42":{"start":{"line":78,"column":4},"end":{"line":78,"column":18}},"43":{"start":{"line":80,"column":2},"end":{"line":80,"column":23}},"44":{"start":{"line":81,"column":2},"end":{"line":81,"column":20}},"45":{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},"46":{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},"47":{"start":{"line":83,"column":35},"end":{"line":83,"column":51}},"48":{"start":{"line":84,"column":4},"end":{"line":84,"column":52}},"49":{"start":{"line":84,"column":30},"end":{"line":84,"column":50}},"50":{"start":{"line":86,"column":2},"end":{"line":86,"column":14}},"51":{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},"52":{"start":{"line":90,"column":2},"end":{"line":90,"column":24}},"53":{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},"54":{"start":{"line":92,"column":2},"end":{"line":92,"column":38}},"55":{"start":{"line":92,"column":22},"end":{"line":92,"column":34}},"56":{"start":{"line":94,"column":2},"end":{"line":94,"column":21}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":5,"column":1},"end":{"line":5,"column":2}},"loc":{"start":{"line":5,"column":34},"end":{"line":97,"column":1}},"line":5},"1":{"name":"XorGen","decl":{"start":{"line":7,"column":9},"end":{"line":7,"column":15}},"loc":{"start":{"line":7,"column":22},"end":{"line":58,"column":1}},"line":7},"2":{"name":"(anonymous_2)","decl":{"start":{"line":11,"column":12},"end":{"line":11,"column":13}},"loc":{"start":{"line":11,"column":23},"end":{"line":21,"column":3}},"line":11},"3":{"name":"copy","decl":{"start":{"line":60,"column":9},"end":{"line":60,"column":13}},"loc":{"start":{"line":60,"column":20},"end":{"line":66,"column":1}},"line":60},"4":{"name":"impl","decl":{"start":{"line":68,"column":9},"end":{"line":68,"column":13}},"loc":{"start":{"line":68,"column":26},"end":{"line":87,"column":1}},"line":68},"5":{"name":"(anonymous_5)","decl":{"start":{"line":71,"column":13},"end":{"line":71,"column":14}},"loc":{"start":{"line":71,"column":24},"end":{"line":71,"column":67}},"line":71},"6":{"name":"(anonymous_6)","decl":{"start":{"line":72,"column":16},"end":{"line":72,"column":17}},"loc":{"start":{"line":72,"column":27},"end":{"line":79,"column":3}},"line":72},"7":{"name":"(anonymous_7)","decl":{"start":{"line":84,"column":17},"end":{"line":84,"column":18}},"loc":{"start":{"line":84,"column":28},"end":{"line":84,"column":52}},"line":84},"8":{"name":"(anonymous_8)","decl":{"start":{"line":92,"column":9},"end":{"line":92,"column":10}},"loc":{"start":{"line":92,"column":20},"end":{"line":92,"column":36}},"line":92}},"branchMap":{"0":{"loc":{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},"type":"if","locations":[{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},{"start":{"line":44,"column":2},"end":{"line":51,"column":3}}],"line":44},"1":{"loc":{"start":{"line":70,"column":14},"end":{"line":70,"column":32}},"type":"binary-expr","locations":[{"start":{"line":70,"column":14},"end":{"line":70,"column":18}},{"start":{"line":70,"column":22},"end":{"line":70,"column":32}}],"line":70},"2":{"loc":{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},"type":"if","locations":[{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},{"start":{"line":82,"column":2},"end":{"line":85,"column":3}}],"line":82},"3":{"loc":{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},"type":"if","locations":[{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},{"start":{"line":83,"column":4},"end":{"line":83,"column":51}}],"line":83},"4":{"loc":{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},"type":"if","locations":[{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},{"start":{"line":89,"column":0},"end":{"line":95,"column":1}}],"line":89},"5":{"loc":{"start":{"line":89,"column":4},"end":{"line":89,"column":28}},"type":"binary-expr","locations":[{"start":{"line":89,"column":4},"end":{"line":89,"column":10}},{"start":{"line":89,"column":14},"end":{"line":89,"column":28}}],"line":89},"6":{"loc":{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},"type":"if","locations":[{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},{"start":{"line":91,"column":7},"end":{"line":95,"column":1}}],"line":91},"7":{"loc":{"start":{"line":91,"column":11},"end":{"line":91,"column":31}},"type":"binary-expr","locations":[{"start":{"line":91,"column":11},"end":{"line":91,"column":17}},{"start":{"line":91,"column":21},"end":{"line":91,"column":31}}],"line":91},"8":{"loc":{"start":{"line":99,"column":2},"end":{"line":99,"column":39}},"type":"binary-expr","locations":[{"start":{"line":99,"column":2},"end":{"line":99,"column":29}},{"start":{"line":99,"column":33},"end":{"line":99,"column":39}}],"line":99},"9":{"loc":{"start":{"line":100,"column":2},"end":{"line":100,"column":41}},"type":"binary-expr","locations":[{"start":{"line":100,"column":2},"end":{"line":100,"column":31}},{"start":{"line":100,"column":35},"end":{"line":100,"column":41}}],"line":100}},"s":{"0":1,"1":3,"2":3,"3":3,"4":4105195,"5":4105195,"6":4105195,"7":4105195,"8":4105195,"9":4105195,"10":4105195,"11":4105195,"12":4105195,"13":4105195,"14":4105195,"15":4105195,"16":3,"17":3,"18":3,"19":3,"20":3,"21":2,"22":2,"23":1,"24":3,"25":3,"26":66,"27":66,"28":2,"29":2,"30":2,"31":2,"32":2,"33":3,"34":3,"35":3,"36":4102054,"37":3,"38":1025,"39":1025,"40":1025,"41":1025,"42":1025,"43":3,"44":3,"45":3,"46":2,"47":1,"48":2,"49":1,"50":3,"51":1,"52":1,"53":0,"54":0,"55":0,"56":0},"f":{"0":1,"1":3,"2":4105195,"3":2,"4":3,"5":4102054,"6":1025,"7":1,"8":0},"b":{"0":[2,1],"1":[3,2],"2":[2,1],"3":[1,1],"4":[1,0],"5":[1,1],"6":[0,0],"7":[0,0],"8":[1,1],"9":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"3875c0e0fa564e9ae68114bde64afc883b7c9ca0","contentHash":"00c6380ad151ad19433a64fdc0b4051c1a7ee0af16dc43e971860cc64ce62b05"},"/home/davidbau/git/seedrandom/lib/alea.js":{"path":"/home/davidbau/git/seedrandom/lib/alea.js","statementMap":{"0":{"start":{"line":28,"column":0},"end":{"line":112,"column":2}},"1":{"start":{"line":31,"column":11},"end":{"line":31,"column":15}},"2":{"start":{"line":31,"column":24},"end":{"line":31,"column":30}},"3":{"start":{"line":33,"column":2},"end":{"line":38,"column":4}},"4":{"start":{"line":34,"column":12},"end":{"line":34,"column":59}},"5":{"start":{"line":35,"column":4},"end":{"line":35,"column":18}},"6":{"start":{"line":36,"column":4},"end":{"line":36,"column":18}},"7":{"start":{"line":37,"column":4},"end":{"line":37,"column":38}},"8":{"start":{"line":41,"column":2},"end":{"line":41,"column":11}},"9":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"10":{"start":{"line":43,"column":2},"end":{"line":43,"column":20}},"11":{"start":{"line":44,"column":2},"end":{"line":44,"column":20}},"12":{"start":{"line":45,"column":2},"end":{"line":45,"column":22}},"13":{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},"14":{"start":{"line":46,"column":19},"end":{"line":46,"column":30}},"15":{"start":{"line":47,"column":2},"end":{"line":47,"column":22}},"16":{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},"17":{"start":{"line":48,"column":19},"end":{"line":48,"column":30}},"18":{"start":{"line":49,"column":2},"end":{"line":49,"column":22}},"19":{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},"20":{"start":{"line":50,"column":19},"end":{"line":50,"column":30}},"21":{"start":{"line":51,"column":2},"end":{"line":51,"column":14}},"22":{"start":{"line":55,"column":2},"end":{"line":55,"column":12}},"23":{"start":{"line":56,"column":2},"end":{"line":56,"column":14}},"24":{"start":{"line":57,"column":2},"end":{"line":57,"column":14}},"25":{"start":{"line":58,"column":2},"end":{"line":58,"column":14}},"26":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"27":{"start":{"line":63,"column":11},"end":{"line":63,"column":25}},"28":{"start":{"line":64,"column":14},"end":{"line":64,"column":32}},"29":{"start":{"line":65,"column":13},"end":{"line":65,"column":20}},"30":{"start":{"line":66,"column":2},"end":{"line":66,"column":67}},"31":{"start":{"line":66,"column":28},"end":{"line":66,"column":65}},"32":{"start":{"line":67,"column":2},"end":{"line":69,"column":4}},"33":{"start":{"line":68,"column":4},"end":{"line":68,"column":69}},"34":{"start":{"line":70,"column":2},"end":{"line":70,"column":20}},"35":{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},"36":{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},"37":{"start":{"line":72,"column":35},"end":{"line":72,"column":51}},"38":{"start":{"line":73,"column":4},"end":{"line":73,"column":52}},"39":{"start":{"line":73,"column":30},"end":{"line":73,"column":50}},"40":{"start":{"line":75,"column":2},"end":{"line":75,"column":14}},"41":{"start":{"line":79,"column":10},"end":{"line":79,"column":20}},"42":{"start":{"line":81,"column":13},"end":{"line":94,"column":3}},"43":{"start":{"line":82,"column":4},"end":{"line":82,"column":24}},"44":{"start":{"line":83,"column":4},"end":{"line":92,"column":5}},"45":{"start":{"line":83,"column":17},"end":{"line":83,"column":18}},"46":{"start":{"line":84,"column":6},"end":{"line":84,"column":30}},"47":{"start":{"line":85,"column":14},"end":{"line":85,"column":37}},"48":{"start":{"line":86,"column":6},"end":{"line":86,"column":18}},"49":{"start":{"line":87,"column":6},"end":{"line":87,"column":13}},"50":{"start":{"line":88,"column":6},"end":{"line":88,"column":13}},"51":{"start":{"line":89,"column":6},"end":{"line":89,"column":18}},"52":{"start":{"line":90,"column":6},"end":{"line":90,"column":13}},"53":{"start":{"line":91,"column":6},"end":{"line":91,"column":27}},"54":{"start":{"line":93,"column":4},"end":{"line":93,"column":46}},"55":{"start":{"line":96,"column":2},"end":{"line":96,"column":14}},"56":{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},"57":{"start":{"line":101,"column":2},"end":{"line":101,"column":24}},"58":{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},"59":{"start":{"line":103,"column":2},"end":{"line":103,"column":38}},"60":{"start":{"line":103,"column":22},"end":{"line":103,"column":34}},"61":{"start":{"line":105,"column":2},"end":{"line":105,"column":19}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":28,"column":1},"end":{"line":28,"column":2}},"loc":{"start":{"line":28,"column":34},"end":{"line":108,"column":1}},"line":28},"1":{"name":"Alea","decl":{"start":{"line":30,"column":9},"end":{"line":30,"column":13}},"loc":{"start":{"line":30,"column":20},"end":{"line":52,"column":1}},"line":30},"2":{"name":"(anonymous_2)","decl":{"start":{"line":33,"column":12},"end":{"line":33,"column":13}},"loc":{"start":{"line":33,"column":23},"end":{"line":38,"column":3}},"line":33},"3":{"name":"copy","decl":{"start":{"line":54,"column":9},"end":{"line":54,"column":13}},"loc":{"start":{"line":54,"column":20},"end":{"line":60,"column":1}},"line":54},"4":{"name":"impl","decl":{"start":{"line":62,"column":9},"end":{"line":62,"column":13}},"loc":{"start":{"line":62,"column":26},"end":{"line":76,"column":1}},"line":62},"5":{"name":"(anonymous_5)","decl":{"start":{"line":66,"column":15},"end":{"line":66,"column":16}},"loc":{"start":{"line":66,"column":26},"end":{"line":66,"column":67}},"line":66},"6":{"name":"(anonymous_6)","decl":{"start":{"line":67,"column":16},"end":{"line":67,"column":17}},"loc":{"start":{"line":67,"column":27},"end":{"line":69,"column":3}},"line":67},"7":{"name":"(anonymous_7)","decl":{"start":{"line":73,"column":17},"end":{"line":73,"column":18}},"loc":{"start":{"line":73,"column":28},"end":{"line":73,"column":52}},"line":73},"8":{"name":"Mash","decl":{"start":{"line":78,"column":9},"end":{"line":78,"column":13}},"loc":{"start":{"line":78,"column":16},"end":{"line":97,"column":1}},"line":78},"9":{"name":"(anonymous_9)","decl":{"start":{"line":81,"column":13},"end":{"line":81,"column":14}},"loc":{"start":{"line":81,"column":28},"end":{"line":94,"column":3}},"line":81},"10":{"name":"(anonymous_10)","decl":{"start":{"line":103,"column":9},"end":{"line":103,"column":10}},"loc":{"start":{"line":103,"column":20},"end":{"line":103,"column":36}},"line":103}},"branchMap":{"0":{"loc":{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},"type":"if","locations":[{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},{"start":{"line":46,"column":2},"end":{"line":46,"column":32}}],"line":46},"1":{"loc":{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},"type":"if","locations":[{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},{"start":{"line":48,"column":2},"end":{"line":48,"column":32}}],"line":48},"2":{"loc":{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},"type":"if","locations":[{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},{"start":{"line":50,"column":2},"end":{"line":50,"column":32}}],"line":50},"3":{"loc":{"start":{"line":64,"column":14},"end":{"line":64,"column":32}},"type":"binary-expr","locations":[{"start":{"line":64,"column":14},"end":{"line":64,"column":18}},{"start":{"line":64,"column":22},"end":{"line":64,"column":32}}],"line":64},"4":{"loc":{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},"type":"if","locations":[{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},{"start":{"line":71,"column":2},"end":{"line":74,"column":3}}],"line":71},"5":{"loc":{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},"type":"if","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},{"start":{"line":72,"column":4},"end":{"line":72,"column":51}}],"line":72},"6":{"loc":{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},"type":"if","locations":[{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},{"start":{"line":100,"column":0},"end":{"line":106,"column":1}}],"line":100},"7":{"loc":{"start":{"line":100,"column":4},"end":{"line":100,"column":28}},"type":"binary-expr","locations":[{"start":{"line":100,"column":4},"end":{"line":100,"column":10}},{"start":{"line":100,"column":14},"end":{"line":100,"column":28}}],"line":100},"8":{"loc":{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},"type":"if","locations":[{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},{"start":{"line":102,"column":7},"end":{"line":106,"column":1}}],"line":102},"9":{"loc":{"start":{"line":102,"column":11},"end":{"line":102,"column":31}},"type":"binary-expr","locations":[{"start":{"line":102,"column":11},"end":{"line":102,"column":17}},{"start":{"line":102,"column":21},"end":{"line":102,"column":31}}],"line":102},"10":{"loc":{"start":{"line":110,"column":2},"end":{"line":110,"column":39}},"type":"binary-expr","locations":[{"start":{"line":110,"column":2},"end":{"line":110,"column":29}},{"start":{"line":110,"column":33},"end":{"line":110,"column":39}}],"line":110},"11":{"loc":{"start":{"line":111,"column":2},"end":{"line":111,"column":41}},"type":"binary-expr","locations":[{"start":{"line":111,"column":2},"end":{"line":111,"column":31}},{"start":{"line":111,"column":35},"end":{"line":111,"column":41}}],"line":111}},"s":{"0":1,"1":3,"2":3,"3":3,"4":4105129,"5":4105129,"6":4105129,"7":4105129,"8":3,"9":3,"10":3,"11":3,"12":3,"13":3,"14":1,"15":3,"16":3,"17":3,"18":3,"19":3,"20":0,"21":3,"22":2,"23":2,"24":2,"25":2,"26":2,"27":3,"28":3,"29":3,"30":3,"31":1025,"32":3,"33":1025,"34":3,"35":3,"36":2,"37":1,"38":2,"39":1,"40":3,"41":3,"42":3,"43":18,"44":18,"45":18,"46":33,"47":33,"48":33,"49":33,"50":33,"51":33,"52":33,"53":33,"54":18,"55":3,"56":1,"57":1,"58":0,"59":0,"60":0,"61":0},"f":{"0":1,"1":3,"2":4105129,"3":2,"4":3,"5":1025,"6":1025,"7":1,"8":3,"9":18,"10":0},"b":{"0":[1,2],"1":[3,0],"2":[0,3],"3":[3,2],"4":[2,1],"5":[1,1],"6":[1,0],"7":[1,1],"8":[0,0],"9":[0,0],"10":[1,1],"11":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"b70bcb8438fd8d93267e4355bb97ec0e15c51502","contentHash":"026d994d4bc0afeb3f977bb09d4e6284476ab12f7a5be78bdde751602626af54"}}
\ No newline at end of file
diff --git a/node_modules/seedrandom/.nyc_output/processinfo/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json b/node_modules/seedrandom/.nyc_output/processinfo/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
new file mode 100644
index 0000000..d596d96
--- /dev/null
+++ b/node_modules/seedrandom/.nyc_output/processinfo/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
@@ -0,0 +1 @@
+{"uuid":"f02e18a9-b1c7-4946-836e-c3dbfb9635a3","parent":null,"pid":8128,"argv":["/home/davidbau/.nvm/versions/node/v11.9.0/bin/node","/home/davidbau/git/seedrandom/node_modules/mocha/bin/_mocha","test/cryptotest.js","test/nodetest.js","test/prngtest.js"],"execArgv":[],"cwd":"/home/davidbau/git/seedrandom","time":1568716532937,"ppid":8121,"root":"23c2e786-6463-4b5a-9042-75ea3257640f","coverageFilename":"/home/davidbau/git/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json","files":["/home/davidbau/git/seedrandom/seedrandom.js","/home/davidbau/git/seedrandom/lib/xor128.js","/home/davidbau/git/seedrandom/lib/xorwow.js","/home/davidbau/git/seedrandom/lib/xorshift7.js","/home/davidbau/git/seedrandom/lib/xor4096.js","/home/davidbau/git/seedrandom/lib/tychei.js","/home/davidbau/git/seedrandom/lib/alea.js"]}
\ No newline at end of file
diff --git a/node_modules/seedrandom/.nyc_output/processinfo/index.json b/node_modules/seedrandom/.nyc_output/processinfo/index.json
new file mode 100644
index 0000000..f67865c
--- /dev/null
+++ b/node_modules/seedrandom/.nyc_output/processinfo/index.json
@@ -0,0 +1 @@
+{"processes":{"f02e18a9-b1c7-4946-836e-c3dbfb9635a3":{"parent":null,"children":[]}},"files":{"/home/davidbau/git/seedrandom/seedrandom.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xor128.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xorwow.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xorshift7.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xor4096.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/tychei.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/alea.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"]},"externalIds":{}}
\ No newline at end of file
diff --git a/node_modules/seedrandom/.travis.yml b/node_modules/seedrandom/.travis.yml
new file mode 100644
index 0000000..6852ab1
--- /dev/null
+++ b/node_modules/seedrandom/.travis.yml
@@ -0,0 +1,8 @@
+language: node_js
+sudo: false
+node_js:
+- '7'
+- '8'
+- '9'
+- '10'
+- '11'
diff --git a/node_modules/seedrandom/Gruntfile.js b/node_modules/seedrandom/Gruntfile.js
new file mode 100644
index 0000000..41585ec
--- /dev/null
+++ b/node_modules/seedrandom/Gruntfile.js
@@ -0,0 +1,97 @@
+module.exports = function(grunt) {
+  "use strict";
+
+  grunt.initConfig({
+    pkg: grunt.file.readJSON("package.json"),
+    copy: {
+      browsertest: {
+        files: [
+          { expand: true, cwd: 'node_modules/qunit/qunit', src: 'qunit.*' ,
+            dest: 'test/lib'},
+          { expand: true, cwd: 'node_modules/requirejs', src: 'require.js',
+            dest: 'test/lib'}
+        ],
+      }
+    },
+    uglify: {
+      all: {
+        files: {
+          "<%= pkg.name %>.min.js": [ "<%= pkg.name %>.js" ],
+          "lib/alea.min.js": [ "lib/alea.js" ],
+          "lib/tychei.min.js": [ "lib/tychei.js" ],
+          "lib/xor4096.min.js": [ "lib/xor4096.js" ],
+          "lib/xorshift7.min.js": [ "lib/xorshift7.js" ],
+          "lib/xorwow.min.js": [ "lib/xorwow.js" ],
+          "lib/xor128.min.js": [ "lib/xor128.js" ]
+        },
+        options: {
+          preserveComments: false,
+          report: "min",
+          output: {
+            ascii_only: true
+          }
+        }
+      }
+    },
+    qunit: {
+      options: {
+        noGlobals: true,
+        httpBase: 'http://localhost:8192'
+      },
+      all: ["test/*.html"]
+    },
+    connect: {
+      server: {
+        options: {
+          port: 8192,
+          base: '.'
+        }
+      }
+    },
+    browserify: {
+      test: {
+        files: {
+          'test/browserified.js': ['test/nodetest.js'],
+        },
+        options: {
+          ignore: ['requirejs', 'process'],
+          alias: {
+            'assert': './test/qunitassert.js'
+          }
+        }
+      }
+    },
+    mocha_nyc: {
+      coverage: {
+        src: 'test/*test.js'
+      },
+      coveralls: {
+        src: 'test/*test.js',
+        options: {
+          coverage: true
+        }
+      }
+    },
+    release: {
+      options: {
+        bump: false
+      }
+    }
+  });
+
+  grunt.event.on('coverage', require('coveralls').handleInput);
+
+  grunt.loadNpmTasks('grunt-contrib-copy');
+  grunt.loadNpmTasks('grunt-contrib-connect');
+  grunt.loadNpmTasks('grunt-contrib-qunit');
+  grunt.loadNpmTasks('grunt-contrib-uglify');
+  grunt.loadNpmTasks('grunt-mocha-nyc');
+  grunt.loadNpmTasks('grunt-release');
+  grunt.loadNpmTasks('grunt-browserify');
+
+  grunt.registerTask("test", ["copy:browsertest", "browserify",
+                     "connect", "qunit", "mocha_nyc:coverage"]);
+  grunt.registerTask("default", ["uglify", "test"]);
+  grunt.registerTask("travis", ["default", "mocha_nyc:coveralls"]);
+};
+
diff --git a/node_modules/seedrandom/README.md b/node_modules/seedrandom/README.md
new file mode 100644
index 0000000..9518915
--- /dev/null
+++ b/node_modules/seedrandom/README.md
@@ -0,0 +1,322 @@
+seedrandom.js
+=============
+[![Build Status](https://travis-ci.org/davidbau/seedrandom.svg?branch=master)](https://travis-ci.org/davidbau/seedrandom)
+[![NPM version](https://badge.fury.io/js/seedrandom.svg)](http://badge.fury.io/js/seedrandom)
+[![Bower version](https://badge.fury.io/bo/seedrandom.svg)](http://badge.fury.io/bo/seedrandom)
+
+Seeded random number generator for JavaScript.
+
+Version 3.0.5
+
+Author: David Bau
+
+Date: 2019-09-14
+
+Can be used as a plain script, a Node.js module or an AMD module.
+
+
+Script tag usage
+----------------
+
+```html
+<script src="//cdnjs.cloudflare.com/ajax/libs/seedrandom/3.0.5/seedrandom.min.js">
+</script>
+```
+
+```js
+// Make a predictable pseudorandom number generator.
+var myrng = new Math.seedrandom('hello.');
+console.log(myrng());                // Always 0.9282578795792454
+console.log(myrng());                // Always 0.3752569768646784
+
+// Use "quick" to get only 32 bits of randomness in a float.
+console.log(myrng.quick());          // Always 0.7316977467853576
+
+// Use "int32" to get a 32 bit (signed) integer
+console.log(myrng.int32());          // Always 1966374204
+
+// Calling seedrandom with no arguments creates an ARC4-based PRNG
+// that is autoseeded using the current time, dom state, and other
+// accumulated local entropy.
+var prng = new Math.seedrandom();
+console.log(prng());                // Reasonably unpredictable.
+
+// Seeds using the given explicit seed mixed with accumulated entropy.
+prng = new Math.seedrandom('added entropy.', { entropy: true });
+console.log(prng());                // As unpredictable as added entropy.
+
+// Warning: if you call Math.seedrandom without `new`, it replaces
+// Math.random with the predictable new Math.seedrandom(...), as follows:
+Math.seedrandom('hello.');
+console.log(Math.random());          // Always 0.9282578795792454
+console.log(Math.random());          // Always 0.3752569768646784
+
+```
+
+**Note**: calling `Math.seedrandom('constant')` without `new` will make
+`Math.random()` predictable globally, which is intended to be useful for
+derandomizing code for testing, but should not be done in a production library.
+If you need a local seeded PRNG, use `myrng = new Math.seedrandom('seed')`
+instead.  For example, [cryptico](https://www.npmjs.com/package/cryptico),
+an RSA encryption package, [uses the wrong form](
+https://github.com/wwwtyro/cryptico/blob/9291ece6/api.js#L264),
+and thus secretly makes `Math.random()` perfectly predictable.
+The cryptico library (and any other library that does this)
+should not be trusted in a security-sensitive application.
+
+
+Other Fast PRNG Algorithms
+--------------------------
+
+The package includes some other fast PRNGs.  To use Johannes Baagøe's
+extremely fast Alea PRNG:
+
+
+```html
+<script src="//cdnjs.cloudflare.com/ajax/libs/seedrandom/3.0.5/lib/alea.min.js">
+</script>
+```
+
+```js
+// Use alea for Johannes Baagøe's clever and fast floating-point RNG.
+var arng = new alea('hello.');
+
+// By default provides 32 bits of randomness in a float.
+console.log(arng());               // Always 0.4783254903741181
+
+// Use "double" to get 56 bits of randomness.
+console.log(arng.double());        // Always 0.8297006866124559
+
+// Use "int32" to get a 32 bit (signed) integer.
+console.log(arng.int32());         // Always 1076136327
+```
+
+Besides alea, there are several other faster PRNGs available.
+Note that none of these fast PRNGs provide autoseeding: you
+need to provide your own seed (or use the default autoseeded
+seedrandom to make a seed).
+
+|PRNG name  | Time vs native | Period      | Author               |
+|-----------|----------------|-------------|----------------------|
+|`alea`     |  1.95 ns, 0.9x | ~2^116      | Baagøe               |
+|`xor128`   |  2.04 ns, 0.9x | 2^128-1     | Marsaglia            |
+|`tychei`   |  2.32 ns, 1.1x | ~2^127      | Neves/Araujo (ChaCha)|
+|`xorwow`   |  2.40 ns, 1.1x | 2^192-2^32  | Marsaglia            |
+|`xor4096`  |  2.40 ns, 1.1x | 2^4096-2^32 | Brent (xorgens)      |
+|`xorshift7`|  2.64 ns, 1.3x | 2^256-1     | Panneton/L'ecuyer    |
+|`quick`    |  3.80 ns, 1.8x | ~2^1600     | Bau (ARC4)           |
+
+(Timings were done on node v0.12.2 on a single-core Google Compute Engine
+instance.  `quick` is just the 32-bit version of the RC4-based PRNG
+originally packaged with seedrandom.)
+
+
+CJS / Node.js usage
+-------------------
+
+```
+npm install seedrandom
+```
+
+```js
+// Local PRNG: does not affect Math.random.
+var seedrandom = require('seedrandom');
+var rng = seedrandom('hello.');
+console.log(rng());                  // Always 0.9282578795792454
+
+// Global PRNG: set Math.random.
+seedrandom('hello.', { global: true });
+console.log(Math.random());          // Always 0.9282578795792454
+
+// Autoseeded ARC4-based PRNG.
+rng = seedrandom();
+console.log(rng());                  // Reasonably unpredictable.
+
+// Mixing accumulated entropy.
+rng = seedrandom('added entropy.', { entropy: true });
+console.log(rng());                  // As unpredictable as added entropy.
+
+// Using alternate algorithms, as listed above.
+var rng2 = seedrandom.xor4096('hello.')
+console.log(rng2());
+```
+
+Starting in version 3, when using via require('seedrandom'), the global
+`Math.seedrandom` is no longer available.
+
+
+Require.js usage
+----------------
+
+Similar to Node.js usage:
+
+```
+bower install seedrandom
+```
+
+```
+require(['seedrandom'], function(seedrandom) {
+  var rng = seedrandom('hello.');
+  console.log(rng());                  // Always 0.9282578795792454
+});
+```
+
+
+Network seeding
+---------------
+
+```html
+<script src=//cdnjs.cloudflare.com/ajax/libs/seedrandom/3.0.5/seedrandom.min.js>
+</script>
+<!-- Seeds using urandom bits from a server. -->
+<script src=//jsonlib.appspot.com/urandom?callback=Math.seedrandom>
+</script>
+
+<!-- Seeds mixing in random.org bits -->
+<script>
+(function(x, u, s){
+  try {
+    // Make a synchronous request to random.org.
+    x.open('GET', u, false);
+    x.send();
+    s = unescape(x.response.trim().replace(/^|\s/g, '%'));
+  } finally {
+    // Seed with the response, or autoseed on failure.
+    Math.seedrandom(s, !!s);
+  }
+})(new XMLHttpRequest, 'https://www.random.org/integers/' +
+  '?num=256&min=0&max=255&col=1&base=16&format=plain&rnd=new');
+</script>
+```
+
+Reseeding using user input
+--------------------------
+
+```js
+var seed = Math.seedrandom();        // Use prng with an automatic seed.
+document.write(Math.random());       // Pretty much unpredictable x.
+
+var rng = new Math.seedrandom(seed); // A new prng with the same seed.
+document.write(rng());               // Repeat the 'unpredictable' x.
+
+function reseed(event, count) {      // Define a custom entropy collector.
+  var t = [];
+  function w(e) {
+    t.push([e.pageX, e.pageY, +new Date]);
+    if (t.length < count) { return; }
+    document.removeEventListener(event, w);
+    Math.seedrandom(t, { entropy: true });
+  }
+  document.addEventListener(event, w);
+}
+reseed('mousemove', 100);            // Reseed after 100 mouse moves.
+```
+
+The "pass" option can be used to get both the prng and the seed.
+The following returns both an autoseeded prng and the seed as an object,
+without mutating Math.random:
+
+```js
+var obj = Math.seedrandom(null, { pass: function(prng, seed) {
+  return { random: prng, seed: seed };
+}});
+```
+
+
+Saving and Restoring PRNG state
+-------------------------------
+
+```js
+var seedrandom = Math.seedrandom;
+var saveable = seedrandom("secret-seed", {state: true});
+for (var j = 0; j < 1e5; ++j) saveable();
+var saved = saveable.state();
+var replica = seedrandom("", {state: saved});
+assert(replica() == saveable());
+```
+
+In normal use the prng is opaque and its internal state cannot be accessed.
+However, if the "state" option is specified, the prng gets a state() method
+that returns a plain object the can be used to reconstruct a prng later in
+the same state (by passing that saved object back as the state option).
+
+
+Version notes
+-------------
+
+The random number sequence is the same as version 1.0 for string seeds.
+
+* Version 2.0 changed the sequence for non-string seeds.
+* Version 2.1 speeds seeding and uses window.crypto to autoseed if present.
+* Version 2.2 alters non-crypto autoseeding to sweep up entropy from plugins.
+* Version 2.3 adds support for "new", module loading, and a null seed arg.
+* Version 2.3.1 adds a build environment, module packaging, and tests.
+* Version 2.3.4 fixes bugs on IE8, and switches to MIT license.
+* Version 2.3.6 adds a readable options object argument.
+* Version 2.3.10 adds support for node.js crypto (contributed by ctd1500).
+* Version 2.3.11 adds an option to load and save internal state.
+* Version 2.4.0 adds implementations of several other fast PRNGs.
+* Version 2.4.2 adds an implementation of Baagoe's very fast Alea PRNG.
+* Version 2.4.3 ignores nodejs crypto when under browserify.
+* Version 2.4.4 avoids strict mode problem with global this reference.
+* Version 3.0.1 removes Math.seedrandom for require('seedrandom') users.
+* Version 3.0.3 updates package.json for CDN entrypoints.
+* Version 3.0.5 removes eval to avoid triggering content-security policy.
+
+The standard ARC4 key scheduler cycles short keys, which means that
+seedrandom('ab') is equivalent to seedrandom('abab') and 'ababab'.
+Therefore it is a good idea to add a terminator to avoid trivial
+equivalences on short string seeds, e.g., Math.seedrandom(str + '\0').
+Starting with version 2.0, a terminator is added automatically for
+non-string seeds, so seeding with the number 111 is the same as seeding
+with '111\0'.
+
+When seedrandom() is called with zero args or a null seed, it uses a
+seed drawn from the browser crypto object if present.  If there is no
+crypto support, seedrandom() uses the current time, the native rng,
+and a walk of several DOM objects to collect a few bits of entropy.
+
+Each time the one- or two-argument forms of seedrandom are called,
+entropy from the passed seed is accumulated in a pool to help generate
+future seeds for the zero- and two-argument forms of seedrandom.
+
+On speed - This javascript implementation of Math.random() is several
+times slower than the built-in Math.random() because it is not native
+code, but that is typically fast enough.  Some details (timings on
+Chrome 25 on a 2010 vintage macbook):
+
+* seeded Math.random()          - avg less than 0.0002 milliseconds per call
+* seedrandom('explicit.')       - avg less than 0.2 milliseconds per call
+* seedrandom('explicit.', true) - avg less than 0.2 milliseconds per call
+* seedrandom() with crypto      - avg less than 0.2 milliseconds per call
+
+Autoseeding without crypto is somewhat slow, about 20-30 milliseconds on
+a 2012 windows 7 1.5ghz i5 laptop, as seen on Firefox 19, IE 10, and Opera.
+Seeded rng calls themselves are fast across these browsers, with slowest
+numbers on Opera at about 0.0005 ms per seeded Math.random().
+
+
+LICENSE (MIT)
+-------------
+
+Copyright 2019 David Bau.
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
diff --git a/node_modules/seedrandom/bower.json b/node_modules/seedrandom/bower.json
new file mode 100644
index 0000000..8e62b3a
--- /dev/null
+++ b/node_modules/seedrandom/bower.json
@@ -0,0 +1,16 @@
+{
+  "name": "seedrandom",
+  "description": "Seeded random number generator for Javascript.",
+  "main": "seedrandom.js",
+  "license": "MIT",
+  "keywords": [
+    "random",
+    "seed",
+    "crypto"
+  ],
+  "ignore": [],
+  "devDependencies": {
+    "qunit": "latest",
+    "requirejs": "latest"
+  }
+}
diff --git a/node_modules/seedrandom/component.json b/node_modules/seedrandom/component.json
new file mode 100644
index 0000000..43fea29
--- /dev/null
+++ b/node_modules/seedrandom/component.json
@@ -0,0 +1,10 @@
+{
+  "name": "seedrandom",
+  "version": "3.0.0",
+  "description": "Seeded random number generator for Javascript",
+  "repository": "davidbau/seedrandom",
+  "main": "seedrandom.js",
+  "scripts": [ "seedrandom.js" ],
+  "keywords": [ "random", "seed", "crypto" ],
+  "license": "MIT"
+}
diff --git a/node_modules/seedrandom/coverage/coverage.json b/node_modules/seedrandom/coverage/coverage.json
new file mode 100644
index 0000000..9e9657b
--- /dev/null
+++ b/node_modules/seedrandom/coverage/coverage.json
@@ -0,0 +1 @@
+{"/home/davidbau/git/seedrandom/seedrandom.js":{"path":"/home/davidbau/git/seedrandom/seedrandom.js","s":{"1":6,"2":6,"3":1,"4":23,"5":23,"6":23,"7":23,"8":23,"9":3694,"10":3694,"11":3918,"12":3918,"13":3918,"14":3694,"15":9252,"16":9252,"17":9252,"18":3694,"19":23,"20":1025,"21":23,"22":4100001,"23":23,"24":23,"25":23,"26":20,"27":4,"28":2,"29":4,"30":2,"31":20,"32":1,"33":1,"34":19,"35":1,"36":23,"37":23,"38":1,"39":23,"40":5888,"41":23,"42":5888,"43":5888,"44":23,"45":4108661,"46":4108661,"47":16436074,"48":16436074,"49":4108661,"50":4108661,"51":4108661,"52":1,"53":4,"54":4,"55":4,"56":4,"57":1,"58":174,"59":174,"60":8,"61":151,"62":151,"63":174,"64":1,"65":52,"66":52,"67":46040,"68":52,"69":1,"70":4,"71":4,"72":4,"73":3,"74":1,"75":1,"76":3,"77":1,"78":1,"79":1,"80":81,"81":6,"82":6,"83":6,"84":6,"85":6,"86":0,"87":0,"88":0,"89":0},"b":{"1":[1,22],"2":[22,11],"3":[2,21],"4":[4,17],"5":[23,21,20],"6":[4,16],"7":[2,2],"8":[1,19],"9":[4,19],"10":[1,22],"11":[8,166],"12":[174,56],"13":[8,166],"14":[29,137],"15":[3,1],"16":[4,3],"17":[1,1],"18":[1,0],"19":[6,0],"20":[6,6],"21":[0,0],"22":[0,0]},"f":{"1":6,"2":23,"3":3694,"4":1025,"5":4100001,"6":20,"7":2,"8":23,"9":4108661,"10":4,"11":174,"12":52,"13":4,"14":81,"15":0},"fnMap":{"1":{"name":"(anonymous_1)","line":25,"loc":{"start":{"line":25,"column":1},"end":{"line":25,"column":23}}},"2":{"name":"seedrandom","line":47,"loc":{"start":{"line":47,"column":0},"end":{"line":47,"column":45}}},"3":{"name":"(anonymous_3)","line":61,"loc":{"start":{"line":61,"column":13},"end":{"line":61,"column":24}}},"4":{"name":"(anonymous_4)","line":78,"loc":{"start":{"line":78,"column":15},"end":{"line":78,"column":26}}},"5":{"name":"(anonymous_5)","line":79,"loc":{"start":{"line":79,"column":15},"end":{"line":79,"column":26}}},"6":{"name":"(anonymous_6)","line":87,"loc":{"start":{"line":87,"column":6},"end":{"line":87,"column":48}}},"7":{"name":"(anonymous_7)","line":92,"loc":{"start":{"line":92,"column":23},"end":{"line":92,"column":34}}},"8":{"name":"ARC4","line":119,"loc":{"start":{"line":119,"column":0},"end":{"line":119,"column":19}}},"9":{"name":"(anonymous_9)","line":136,"loc":{"start":{"line":136,"column":10},"end":{"line":136,"column":26}}},"10":{"name":"copy","line":156,"loc":{"start":{"line":156,"column":0},"end":{"line":156,"column":20}}},"11":{"name":"flatten","line":167,"loc":{"start":{"line":167,"column":0},"end":{"line":167,"column":29}}},"12":{"name":"mixkey","line":182,"loc":{"start":{"line":182,"column":0},"end":{"line":182,"column":27}}},"13":{"name":"autoseed","line":196,"loc":{"start":{"line":196,"column":0},"end":{"line":196,"column":20}}},"14":{"name":"tostring","line":218,"loc":{"start":{"line":218,"column":0},"end":{"line":218,"column":21}}},"15":{"name":"(anonymous_15)","line":242,"loc":{"start":{"line":242,"column":9},"end":{"line":242,"column":20}}}},"statementMap":{"1":{"start":{"line":25,"column":0},"end":{"line":253,"column":2}},"2":{"start":{"line":32,"column":0},"end":{"line":41,"column":15}},"3":{"start":{"line":47,"column":0},"end":{"line":107,"column":1}},"4":{"start":{"line":48,"column":2},"end":{"line":48,"column":15}},"5":{"start":{"line":49,"column":2},"end":{"line":49,"column":68}},"6":{"start":{"line":52,"column":2},"end":{"line":54,"column":49}},"7":{"start":{"line":57,"column":2},"end":{"line":57,"column":27}},"8":{"start":{"line":61,"column":2},"end":{"line":76,"column":4}},"9":{"start":{"line":62,"column":4},"end":{"line":64,"column":14}},"10":{"start":{"line":65,"column":4},"end":{"line":69,"column":5}},"11":{"start":{"line":66,"column":6},"end":{"line":66,"column":26}},"12":{"start":{"line":67,"column":6},"end":{"line":67,"column":17}},"13":{"start":{"line":68,"column":6},"end":{"line":68,"column":20}},"14":{"start":{"line":70,"column":4},"end":{"line":74,"column":5}},"15":{"start":{"line":71,"column":6},"end":{"line":71,"column":13}},"16":{"start":{"line":72,"column":6},"end":{"line":72,"column":13}},"17":{"start":{"line":73,"column":6},"end":{"line":73,"column":15}},"18":{"start":{"line":75,"column":4},"end":{"line":75,"column":23}},"19":{"start":{"line":78,"column":2},"end":{"line":78,"column":51}},"20":{"start":{"line":78,"column":28},"end":{"line":78,"column":49}},"21":{"start":{"line":79,"column":2},"end":{"line":79,"column":61}},"22":{"start":{"line":79,"column":28},"end":{"line":79,"column":59}},"23":{"start":{"line":80,"column":2},"end":{"line":80,"column":21}},"24":{"start":{"line":83,"column":2},"end":{"line":83,"column":33}},"25":{"start":{"line":86,"column":2},"end":{"line":106,"column":17}},"26":{"start":{"line":88,"column":8},"end":{"line":93,"column":9}},"27":{"start":{"line":90,"column":10},"end":{"line":90,"column":45}},"28":{"start":{"line":90,"column":25},"end":{"line":90,"column":43}},"29":{"start":{"line":92,"column":10},"end":{"line":92,"column":60}},"30":{"start":{"line":92,"column":36},"end":{"line":92,"column":58}},"31":{"start":{"line":97,"column":8},"end":{"line":101,"column":25}},"32":{"start":{"line":97,"column":28},"end":{"line":97,"column":49}},"33":{"start":{"line":97,"column":50},"end":{"line":97,"column":62}},"34":{"start":{"line":101,"column":13},"end":{"line":101,"column":25}},"35":{"start":{"line":119,"column":0},"end":{"line":150,"column":1}},"36":{"start":{"line":120,"column":2},"end":{"line":121,"column":59}},"37":{"start":{"line":124,"column":2},"end":{"line":124,"column":36}},"38":{"start":{"line":124,"column":17},"end":{"line":124,"column":34}},"39":{"start":{"line":127,"column":2},"end":{"line":129,"column":3}},"40":{"start":{"line":128,"column":4},"end":{"line":128,"column":15}},"41":{"start":{"line":130,"column":2},"end":{"line":133,"column":3}},"42":{"start":{"line":131,"column":4},"end":{"line":131,"column":60}},"43":{"start":{"line":132,"column":4},"end":{"line":132,"column":13}},"44":{"start":{"line":136,"column":2},"end":{"line":149,"column":12}},"45":{"start":{"line":138,"column":4},"end":{"line":139,"column":37}},"46":{"start":{"line":140,"column":4},"end":{"line":143,"column":5}},"47":{"start":{"line":141,"column":6},"end":{"line":141,"column":32}},"48":{"start":{"line":142,"column":6},"end":{"line":142,"column":78}},"49":{"start":{"line":144,"column":4},"end":{"line":144,"column":13}},"50":{"start":{"line":144,"column":14},"end":{"line":144,"column":23}},"51":{"start":{"line":145,"column":4},"end":{"line":145,"column":13}},"52":{"start":{"line":156,"column":0},"end":{"line":161,"column":1}},"53":{"start":{"line":157,"column":2},"end":{"line":157,"column":12}},"54":{"start":{"line":158,"column":2},"end":{"line":158,"column":12}},"55":{"start":{"line":159,"column":2},"end":{"line":159,"column":20}},"56":{"start":{"line":160,"column":2},"end":{"line":160,"column":11}},"57":{"start":{"line":167,"column":0},"end":{"line":175,"column":1}},"58":{"start":{"line":168,"column":2},"end":{"line":168,"column":44}},"59":{"start":{"line":169,"column":2},"end":{"line":173,"column":3}},"60":{"start":{"line":170,"column":4},"end":{"line":172,"column":5}},"61":{"start":{"line":171,"column":6},"end":{"line":171,"column":70}},"62":{"start":{"line":171,"column":12},"end":{"line":171,"column":55}},"63":{"start":{"line":174,"column":2},"end":{"line":174,"column":71}},"64":{"start":{"line":182,"column":0},"end":{"line":189,"column":1}},"65":{"start":{"line":183,"column":2},"end":{"line":183,"column":43}},"66":{"start":{"line":184,"column":2},"end":{"line":187,"column":3}},"67":{"start":{"line":185,"column":4},"end":{"line":186,"column":74}},"68":{"start":{"line":188,"column":2},"end":{"line":188,"column":23}},"69":{"start":{"line":196,"column":0},"end":{"line":212,"column":1}},"70":{"start":{"line":197,"column":2},"end":{"line":211,"column":3}},"71":{"start":{"line":198,"column":4},"end":{"line":198,"column":12}},"72":{"start":{"line":199,"column":4},"end":{"line":205,"column":5}},"73":{"start":{"line":201,"column":6},"end":{"line":201,"column":23}},"74":{"start":{"line":203,"column":6},"end":{"line":203,"column":34}},"75":{"start":{"line":204,"column":6},"end":{"line":204,"column":62}},"76":{"start":{"line":206,"column":4},"end":{"line":206,"column":25}},"77":{"start":{"line":208,"column":4},"end":{"line":209,"column":45}},"78":{"start":{"line":210,"column":4},"end":{"line":210,"column":71}},"79":{"start":{"line":218,"column":0},"end":{"line":220,"column":1}},"80":{"start":{"line":219,"column":2},"end":{"line":219,"column":41}},"81":{"start":{"line":229,"column":0},"end":{"line":229,"column":28}},"82":{"start":{"line":235,"column":0},"end":{"line":246,"column":1}},"83":{"start":{"line":236,"column":2},"end":{"line":236,"column":30}},"84":{"start":{"line":238,"column":2},"end":{"line":240,"column":17}},"85":{"start":{"line":239,"column":4},"end":{"line":239,"column":35}},"86":{"start":{"line":241,"column":7},"end":{"line":246,"column":1}},"87":{"start":{"line":242,"column":2},"end":{"line":242,"column":44}},"88":{"start":{"line":242,"column":22},"end":{"line":242,"column":40}},"89":{"start":{"line":245,"column":2},"end":{"line":245,"column":38}}},"branchMap":{"1":{"line":49,"type":"cond-expr","locations":[{"start":{"line":49,"column":32},"end":{"line":49,"column":49}},{"start":{"line":49,"column":53},"end":{"line":49,"column":66}}]},"2":{"line":49,"type":"binary-expr","locations":[{"start":{"line":49,"column":53},"end":{"line":49,"column":60}},{"start":{"line":49,"column":64},"end":{"line":49,"column":66}}]},"3":{"line":53,"type":"cond-expr","locations":[{"start":{"line":53,"column":22},"end":{"line":53,"column":44}},{"start":{"line":54,"column":4},"end":{"line":54,"column":38}}]},"4":{"line":54,"type":"cond-expr","locations":[{"start":{"line":54,"column":21},"end":{"line":54,"column":31}},{"start":{"line":54,"column":34},"end":{"line":54,"column":38}}]},"5":{"line":86,"type":"binary-expr","locations":[{"start":{"line":86,"column":10},"end":{"line":86,"column":22}},{"start":{"line":86,"column":26},"end":{"line":86,"column":34}},{"start":{"line":87,"column":6},"end":{"line":102,"column":7}}]},"6":{"line":88,"type":"if","locations":[{"start":{"line":88,"column":8},"end":{"line":88,"column":8}},{"start":{"line":88,"column":8},"end":{"line":88,"column":8}}]},"7":{"line":90,"type":"if","locations":[{"start":{"line":90,"column":10},"end":{"line":90,"column":10}},{"start":{"line":90,"column":10},"end":{"line":90,"column":10}}]},"8":{"line":97,"type":"if","locations":[{"start":{"line":97,"column":8},"end":{"line":97,"column":8}},{"start":{"line":97,"column":8},"end":{"line":97,"column":8}}]},"9":{"line":105,"type":"cond-expr","locations":[{"start":{"line":105,"column":24},"end":{"line":105,"column":38}},{"start":{"line":105,"column":42},"end":{"line":105,"column":54}}]},"10":{"line":124,"type":"if","locations":[{"start":{"line":124,"column":2},"end":{"line":124,"column":2}},{"start":{"line":124,"column":2},"end":{"line":124,"column":2}}]},"11":{"line":169,"type":"if","locations":[{"start":{"line":169,"column":2},"end":{"line":169,"column":2}},{"start":{"line":169,"column":2},"end":{"line":169,"column":2}}]},"12":{"line":169,"type":"binary-expr","locations":[{"start":{"line":169,"column":6},"end":{"line":169,"column":11}},{"start":{"line":169,"column":15},"end":{"line":169,"column":30}}]},"13":{"line":174,"type":"cond-expr","locations":[{"start":{"line":174,"column":26},"end":{"line":174,"column":32}},{"start":{"line":174,"column":35},"end":{"line":174,"column":69}}]},"14":{"line":174,"type":"cond-expr","locations":[{"start":{"line":174,"column":53},"end":{"line":174,"column":56}},{"start":{"line":174,"column":59},"end":{"line":174,"column":69}}]},"15":{"line":199,"type":"if","locations":[{"start":{"line":199,"column":4},"end":{"line":199,"column":4}},{"start":{"line":199,"column":4},"end":{"line":199,"column":4}}]},"16":{"line":199,"type":"binary-expr","locations":[{"start":{"line":199,"column":8},"end":{"line":199,"column":18}},{"start":{"line":199,"column":23},"end":{"line":199,"column":51}}]},"17":{"line":204,"type":"binary-expr","locations":[{"start":{"line":204,"column":7},"end":{"line":204,"column":20}},{"start":{"line":204,"column":24},"end":{"line":204,"column":39}}]},"18":{"line":209,"type":"binary-expr","locations":[{"start":{"line":209,"column":18},"end":{"line":209,"column":25}},{"start":{"line":209,"column":29},"end":{"line":209,"column":44}}]},"19":{"line":235,"type":"if","locations":[{"start":{"line":235,"column":0},"end":{"line":235,"column":0}},{"start":{"line":235,"column":0},"end":{"line":235,"column":0}}]},"20":{"line":235,"type":"binary-expr","locations":[{"start":{"line":235,"column":4},"end":{"line":235,"column":31}},{"start":{"line":235,"column":35},"end":{"line":235,"column":49}}]},"21":{"line":241,"type":"if","locations":[{"start":{"line":241,"column":7},"end":{"line":241,"column":7}},{"start":{"line":241,"column":7},"end":{"line":241,"column":7}}]},"22":{"line":241,"type":"binary-expr","locations":[{"start":{"line":241,"column":11},"end":{"line":241,"column":40}},{"start":{"line":241,"column":44},"end":{"line":241,"column":54}}]}}},"/home/davidbau/git/seedrandom/lib/xor128.js":{"path":"/home/davidbau/git/seedrandom/lib/xor128.js","s":{"1":1,"2":1,"3":3,"4":3,"5":3,"6":3,"7":3,"8":3,"9":4105327,"10":4105327,"11":4105327,"12":4105327,"13":4105327,"14":3,"15":2,"16":1,"17":3,"18":198,"19":198,"20":1,"21":2,"22":2,"23":2,"24":2,"25":2,"26":1,"27":3,"28":4102054,"29":3,"30":1025,"31":1025,"32":1025,"33":3,"34":3,"35":3,"36":2,"37":1,"38":2,"39":1,"40":3,"41":1,"42":1,"43":0,"44":0,"45":0,"46":0},"b":{"1":[2,1],"2":[3,2],"3":[2,1],"4":[1,1],"5":[1,0],"6":[1,1],"7":[0,0],"8":[0,0],"9":[1,1],"10":[1,0]},"f":{"1":1,"2":3,"3":4105327,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"fnMap":{"1":{"name":"(anonymous_1)","line":4,"loc":{"start":{"line":4,"column":1},"end":{"line":4,"column":34}}},"2":{"name":"XorGen","line":6,"loc":{"start":{"line":6,"column":0},"end":{"line":6,"column":22}}},"3":{"name":"(anonymous_3)","line":15,"loc":{"start":{"line":15,"column":12},"end":{"line":15,"column":23}}},"4":{"name":"copy","line":38,"loc":{"start":{"line":38,"column":0},"end":{"line":38,"column":20}}},"5":{"name":"impl","line":46,"loc":{"start":{"line":46,"column":0},"end":{"line":46,"column":26}}},"6":{"name":"(anonymous_6)","line":49,"loc":{"start":{"line":49,"column":13},"end":{"line":49,"column":24}}},"7":{"name":"(anonymous_7)","line":50,"loc":{"start":{"line":50,"column":16},"end":{"line":50,"column":27}}},"8":{"name":"(anonymous_8)","line":62,"loc":{"start":{"line":62,"column":17},"end":{"line":62,"column":28}}},"9":{"name":"(anonymous_9)","line":70,"loc":{"start":{"line":70,"column":9},"end":{"line":70,"column":20}}}},"statementMap":{"1":{"start":{"line":4,"column":0},"end":{"line":79,"column":2}},"2":{"start":{"line":6,"column":0},"end":{"line":36,"column":1}},"3":{"start":{"line":7,"column":2},"end":{"line":7,"column":30}},"4":{"start":{"line":9,"column":2},"end":{"line":9,"column":11}},"5":{"start":{"line":10,"column":2},"end":{"line":10,"column":11}},"6":{"start":{"line":11,"column":2},"end":{"line":11,"column":11}},"7":{"start":{"line":12,"column":2},"end":{"line":12,"column":11}},"8":{"start":{"line":15,"column":2},"end":{"line":21,"column":4}},"9":{"start":{"line":16,"column":4},"end":{"line":16,"column":32}},"10":{"start":{"line":17,"column":4},"end":{"line":17,"column":16}},"11":{"start":{"line":18,"column":4},"end":{"line":18,"column":16}},"12":{"start":{"line":19,"column":4},"end":{"line":19,"column":16}},"13":{"start":{"line":20,"column":4},"end":{"line":20,"column":49}},"14":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"15":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"16":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"17":{"start":{"line":32,"column":2},"end":{"line":35,"column":3}},"18":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"19":{"start":{"line":34,"column":4},"end":{"line":34,"column":14}},"20":{"start":{"line":38,"column":0},"end":{"line":44,"column":1}},"21":{"start":{"line":39,"column":2},"end":{"line":39,"column":12}},"22":{"start":{"line":40,"column":2},"end":{"line":40,"column":12}},"23":{"start":{"line":41,"column":2},"end":{"line":41,"column":12}},"24":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"25":{"start":{"line":43,"column":2},"end":{"line":43,"column":11}},"26":{"start":{"line":46,"column":0},"end":{"line":65,"column":1}},"27":{"start":{"line":47,"column":2},"end":{"line":49,"column":68}},"28":{"start":{"line":49,"column":26},"end":{"line":49,"column":65}},"29":{"start":{"line":50,"column":2},"end":{"line":57,"column":4}},"30":{"start":{"line":51,"column":4},"end":{"line":55,"column":27}},"31":{"start":{"line":52,"column":6},"end":{"line":54,"column":43}},"32":{"start":{"line":56,"column":4},"end":{"line":56,"column":18}},"33":{"start":{"line":58,"column":2},"end":{"line":58,"column":23}},"34":{"start":{"line":59,"column":2},"end":{"line":59,"column":20}},"35":{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},"36":{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},"37":{"start":{"line":61,"column":35},"end":{"line":61,"column":51}},"38":{"start":{"line":62,"column":4},"end":{"line":62,"column":52}},"39":{"start":{"line":62,"column":30},"end":{"line":62,"column":50}},"40":{"start":{"line":64,"column":2},"end":{"line":64,"column":14}},"41":{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},"42":{"start":{"line":68,"column":2},"end":{"line":68,"column":24}},"43":{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},"44":{"start":{"line":70,"column":2},"end":{"line":70,"column":38}},"45":{"start":{"line":70,"column":22},"end":{"line":70,"column":34}},"46":{"start":{"line":72,"column":2},"end":{"line":72,"column":21}}},"branchMap":{"1":{"line":23,"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":23,"column":2}},{"start":{"line":23,"column":2},"end":{"line":23,"column":2}}]},"2":{"line":48,"type":"binary-expr","locations":[{"start":{"line":48,"column":14},"end":{"line":48,"column":18}},{"start":{"line":48,"column":22},"end":{"line":48,"column":32}}]},"3":{"line":60,"type":"if","locations":[{"start":{"line":60,"column":2},"end":{"line":60,"column":2}},{"start":{"line":60,"column":2},"end":{"line":60,"column":2}}]},"4":{"line":61,"type":"if","locations":[{"start":{"line":61,"column":4},"end":{"line":61,"column":4}},{"start":{"line":61,"column":4},"end":{"line":61,"column":4}}]},"5":{"line":67,"type":"if","locations":[{"start":{"line":67,"column":0},"end":{"line":67,"column":0}},{"start":{"line":67,"column":0},"end":{"line":67,"column":0}}]},"6":{"line":67,"type":"binary-expr","locations":[{"start":{"line":67,"column":4},"end":{"line":67,"column":10}},{"start":{"line":67,"column":14},"end":{"line":67,"column":28}}]},"7":{"line":69,"type":"if","locations":[{"start":{"line":69,"column":7},"end":{"line":69,"column":7}},{"start":{"line":69,"column":7},"end":{"line":69,"column":7}}]},"8":{"line":69,"type":"binary-expr","locations":[{"start":{"line":69,"column":11},"end":{"line":69,"column":17}},{"start":{"line":69,"column":21},"end":{"line":69,"column":31}}]},"9":{"line":77,"type":"binary-expr","locations":[{"start":{"line":77,"column":2},"end":{"line":77,"column":29}},{"start":{"line":77,"column":33},"end":{"line":77,"column":39}}]},"10":{"line":78,"type":"binary-expr","locations":[{"start":{"line":78,"column":2},"end":{"line":78,"column":31}},{"start":{"line":78,"column":35},"end":{"line":78,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/xorwow.js":{"path":"/home/davidbau/git/seedrandom/lib/xorwow.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105327,"6":4105327,"7":4105327,"8":4105327,"9":4105327,"10":4105327,"11":3,"12":3,"13":3,"14":3,"15":3,"16":3,"17":2,"18":1,"19":3,"20":198,"21":198,"22":3,"23":198,"24":1,"25":2,"26":2,"27":2,"28":2,"29":2,"30":2,"31":2,"32":1,"33":3,"34":4102054,"35":3,"36":1025,"37":1025,"38":1025,"39":3,"40":3,"41":3,"42":2,"43":1,"44":2,"45":1,"46":3,"47":1,"48":1,"49":0,"50":0,"51":0,"52":0},"b":{"1":[2,1],"2":[3,195],"3":[3,2],"4":[2,1],"5":[1,1],"6":[1,0],"7":[1,1],"8":[0,0],"9":[0,0],"10":[1,1],"11":[1,0]},"f":{"1":1,"2":3,"3":4105327,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"fnMap":{"1":{"name":"(anonymous_1)","line":4,"loc":{"start":{"line":4,"column":1},"end":{"line":4,"column":34}}},"2":{"name":"XorGen","line":6,"loc":{"start":{"line":6,"column":0},"end":{"line":6,"column":22}}},"3":{"name":"(anonymous_3)","line":10,"loc":{"start":{"line":10,"column":12},"end":{"line":10,"column":23}}},"4":{"name":"copy","line":41,"loc":{"start":{"line":41,"column":0},"end":{"line":41,"column":20}}},"5":{"name":"impl","line":51,"loc":{"start":{"line":51,"column":0},"end":{"line":51,"column":26}}},"6":{"name":"(anonymous_6)","line":54,"loc":{"start":{"line":54,"column":13},"end":{"line":54,"column":24}}},"7":{"name":"(anonymous_7)","line":55,"loc":{"start":{"line":55,"column":16},"end":{"line":55,"column":27}}},"8":{"name":"(anonymous_8)","line":67,"loc":{"start":{"line":67,"column":17},"end":{"line":67,"column":28}}},"9":{"name":"(anonymous_9)","line":75,"loc":{"start":{"line":75,"column":9},"end":{"line":75,"column":20}}}},"statementMap":{"1":{"start":{"line":4,"column":0},"end":{"line":84,"column":2}},"2":{"start":{"line":6,"column":0},"end":{"line":39,"column":1}},"3":{"start":{"line":7,"column":2},"end":{"line":7,"column":30}},"4":{"start":{"line":10,"column":2},"end":{"line":15,"column":4}},"5":{"start":{"line":11,"column":4},"end":{"line":11,"column":34}},"6":{"start":{"line":12,"column":4},"end":{"line":12,"column":16}},"7":{"start":{"line":12,"column":17},"end":{"line":12,"column":29}},"8":{"start":{"line":12,"column":30},"end":{"line":12,"column":42}},"9":{"start":{"line":12,"column":43},"end":{"line":12,"column":55}},"10":{"start":{"line":13,"column":4},"end":{"line":14,"column":58}},"11":{"start":{"line":17,"column":2},"end":{"line":17,"column":11}},"12":{"start":{"line":18,"column":2},"end":{"line":18,"column":11}},"13":{"start":{"line":19,"column":2},"end":{"line":19,"column":11}},"14":{"start":{"line":20,"column":2},"end":{"line":20,"column":11}},"15":{"start":{"line":21,"column":2},"end":{"line":21,"column":11}},"16":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"17":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"18":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"19":{"start":{"line":32,"column":2},"end":{"line":38,"column":3}},"20":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"21":{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},"22":{"start":{"line":35,"column":6},"end":{"line":35,"column":37}},"23":{"start":{"line":37,"column":4},"end":{"line":37,"column":14}},"24":{"start":{"line":41,"column":0},"end":{"line":49,"column":1}},"25":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"26":{"start":{"line":43,"column":2},"end":{"line":43,"column":12}},"27":{"start":{"line":44,"column":2},"end":{"line":44,"column":12}},"28":{"start":{"line":45,"column":2},"end":{"line":45,"column":12}},"29":{"start":{"line":46,"column":2},"end":{"line":46,"column":12}},"30":{"start":{"line":47,"column":2},"end":{"line":47,"column":12}},"31":{"start":{"line":48,"column":2},"end":{"line":48,"column":11}},"32":{"start":{"line":51,"column":0},"end":{"line":70,"column":1}},"33":{"start":{"line":52,"column":2},"end":{"line":54,"column":68}},"34":{"start":{"line":54,"column":26},"end":{"line":54,"column":65}},"35":{"start":{"line":55,"column":2},"end":{"line":62,"column":4}},"36":{"start":{"line":56,"column":4},"end":{"line":60,"column":27}},"37":{"start":{"line":57,"column":6},"end":{"line":59,"column":43}},"38":{"start":{"line":61,"column":4},"end":{"line":61,"column":18}},"39":{"start":{"line":63,"column":2},"end":{"line":63,"column":23}},"40":{"start":{"line":64,"column":2},"end":{"line":64,"column":20}},"41":{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},"42":{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},"43":{"start":{"line":66,"column":35},"end":{"line":66,"column":51}},"44":{"start":{"line":67,"column":4},"end":{"line":67,"column":52}},"45":{"start":{"line":67,"column":30},"end":{"line":67,"column":50}},"46":{"start":{"line":69,"column":2},"end":{"line":69,"column":14}},"47":{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},"48":{"start":{"line":73,"column":2},"end":{"line":73,"column":24}},"49":{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},"50":{"start":{"line":75,"column":2},"end":{"line":75,"column":38}},"51":{"start":{"line":75,"column":22},"end":{"line":75,"column":34}},"52":{"start":{"line":77,"column":2},"end":{"line":77,"column":21}}},"branchMap":{"1":{"line":23,"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":23,"column":2}},{"start":{"line":23,"column":2},"end":{"line":23,"column":2}}]},"2":{"line":34,"type":"if","locations":[{"start":{"line":34,"column":4},"end":{"line":34,"column":4}},{"start":{"line":34,"column":4},"end":{"line":34,"column":4}}]},"3":{"line":53,"type":"binary-expr","locations":[{"start":{"line":53,"column":14},"end":{"line":53,"column":18}},{"start":{"line":53,"column":22},"end":{"line":53,"column":32}}]},"4":{"line":65,"type":"if","locations":[{"start":{"line":65,"column":2},"end":{"line":65,"column":2}},{"start":{"line":65,"column":2},"end":{"line":65,"column":2}}]},"5":{"line":66,"type":"if","locations":[{"start":{"line":66,"column":4},"end":{"line":66,"column":4}},{"start":{"line":66,"column":4},"end":{"line":66,"column":4}}]},"6":{"line":72,"type":"if","locations":[{"start":{"line":72,"column":0},"end":{"line":72,"column":0}},{"start":{"line":72,"column":0},"end":{"line":72,"column":0}}]},"7":{"line":72,"type":"binary-expr","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":10}},{"start":{"line":72,"column":14},"end":{"line":72,"column":28}}]},"8":{"line":74,"type":"if","locations":[{"start":{"line":74,"column":7},"end":{"line":74,"column":7}},{"start":{"line":74,"column":7},"end":{"line":74,"column":7}}]},"9":{"line":74,"type":"binary-expr","locations":[{"start":{"line":74,"column":11},"end":{"line":74,"column":17}},{"start":{"line":74,"column":21},"end":{"line":74,"column":31}}]},"10":{"line":82,"type":"binary-expr","locations":[{"start":{"line":82,"column":2},"end":{"line":82,"column":29}},{"start":{"line":82,"column":33},"end":{"line":82,"column":39}}]},"11":{"line":83,"type":"binary-expr","locations":[{"start":{"line":83,"column":2},"end":{"line":83,"column":31}},{"start":{"line":83,"column":35},"end":{"line":83,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/xorshift7.js":{"path":"/home/davidbau/git/seedrandom/lib/xorshift7.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105897,"6":4105897,"7":4105897,"8":4105897,"9":4105897,"10":4105897,"11":4105897,"12":4105897,"13":4105897,"14":4105897,"15":4105897,"16":4105897,"17":4105897,"18":4105897,"19":4105897,"20":4105897,"21":1,"22":3,"23":3,"24":2,"25":1,"26":1,"27":6,"28":3,"29":16,"30":3,"31":3,"32":2,"33":1,"34":3,"35":3,"36":3,"37":768,"38":3,"39":1,"40":2,"41":2,"42":2,"43":1,"44":3,"45":0,"46":3,"47":4102054,"48":3,"49":1025,"50":1025,"51":1025,"52":3,"53":3,"54":3,"55":2,"56":1,"57":2,"58":1,"59":3,"60":1,"61":1,"62":0,"63":0,"64":0,"65":0},"b":{"1":[2,1],"2":[19,17],"3":[2,1],"4":[0,3],"5":[3,2],"6":[2,1],"7":[1,1],"8":[1,0],"9":[1,1],"10":[0,0],"11":[0,0],"12":[1,1],"13":[1,0]},"f":{"1":1,"2":3,"3":4105897,"4":3,"5":2,"6":3,"7":4102054,"8":1025,"9":1,"10":0},"fnMap":{"1":{"name":"(anonymous_1)","line":6,"loc":{"start":{"line":6,"column":1},"end":{"line":6,"column":34}}},"2":{"name":"XorGen","line":8,"loc":{"start":{"line":8,"column":0},"end":{"line":8,"column":22}}},"3":{"name":"(anonymous_3)","line":12,"loc":{"start":{"line":12,"column":12},"end":{"line":12,"column":23}}},"4":{"name":"init","line":25,"loc":{"start":{"line":25,"column":2},"end":{"line":25,"column":26}}},"5":{"name":"copy","line":56,"loc":{"start":{"line":56,"column":0},"end":{"line":56,"column":20}}},"6":{"name":"impl","line":62,"loc":{"start":{"line":62,"column":0},"end":{"line":62,"column":26}}},"7":{"name":"(anonymous_7)","line":66,"loc":{"start":{"line":66,"column":13},"end":{"line":66,"column":24}}},"8":{"name":"(anonymous_8)","line":67,"loc":{"start":{"line":67,"column":16},"end":{"line":67,"column":27}}},"9":{"name":"(anonymous_9)","line":79,"loc":{"start":{"line":79,"column":17},"end":{"line":79,"column":28}}},"10":{"name":"(anonymous_10)","line":87,"loc":{"start":{"line":87,"column":9},"end":{"line":87,"column":20}}}},"statementMap":{"1":{"start":{"line":6,"column":0},"end":{"line":96,"column":2}},"2":{"start":{"line":8,"column":0},"end":{"line":54,"column":1}},"3":{"start":{"line":9,"column":2},"end":{"line":9,"column":16}},"4":{"start":{"line":12,"column":2},"end":{"line":23,"column":4}},"5":{"start":{"line":14,"column":4},"end":{"line":14,"column":36}},"6":{"start":{"line":15,"column":4},"end":{"line":15,"column":13}},"7":{"start":{"line":15,"column":14},"end":{"line":15,"column":29}},"8":{"start":{"line":15,"column":30},"end":{"line":15,"column":48}},"9":{"start":{"line":16,"column":4},"end":{"line":16,"column":23}},"10":{"start":{"line":16,"column":24},"end":{"line":16,"column":44}},"11":{"start":{"line":17,"column":4},"end":{"line":17,"column":23}},"12":{"start":{"line":17,"column":24},"end":{"line":17,"column":43}},"13":{"start":{"line":18,"column":4},"end":{"line":18,"column":23}},"14":{"start":{"line":18,"column":24},"end":{"line":18,"column":42}},"15":{"start":{"line":19,"column":4},"end":{"line":19,"column":23}},"16":{"start":{"line":19,"column":24},"end":{"line":19,"column":42}},"17":{"start":{"line":19,"column":43},"end":{"line":19,"column":61}},"18":{"start":{"line":20,"column":4},"end":{"line":20,"column":13}},"19":{"start":{"line":21,"column":4},"end":{"line":21,"column":23}},"20":{"start":{"line":22,"column":4},"end":{"line":22,"column":13}},"21":{"start":{"line":25,"column":2},"end":{"line":51,"column":3}},"22":{"start":{"line":26,"column":4},"end":{"line":26,"column":21}},"23":{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},"24":{"start":{"line":30,"column":6},"end":{"line":30,"column":22}},"25":{"start":{"line":33,"column":6},"end":{"line":33,"column":23}},"26":{"start":{"line":34,"column":6},"end":{"line":37,"column":7}},"27":{"start":{"line":35,"column":8},"end":{"line":36,"column":56}},"28":{"start":{"line":40,"column":4},"end":{"line":40,"column":35}},"29":{"start":{"line":40,"column":25},"end":{"line":40,"column":35}},"30":{"start":{"line":41,"column":4},"end":{"line":41,"column":42}},"31":{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},"32":{"start":{"line":42,"column":16},"end":{"line":42,"column":30}},"33":{"start":{"line":42,"column":36},"end":{"line":42,"column":45}},"34":{"start":{"line":44,"column":4},"end":{"line":44,"column":13}},"35":{"start":{"line":45,"column":4},"end":{"line":45,"column":13}},"36":{"start":{"line":48,"column":4},"end":{"line":50,"column":5}},"37":{"start":{"line":49,"column":6},"end":{"line":49,"column":16}},"38":{"start":{"line":53,"column":2},"end":{"line":53,"column":17}},"39":{"start":{"line":56,"column":0},"end":{"line":60,"column":1}},"40":{"start":{"line":57,"column":2},"end":{"line":57,"column":20}},"41":{"start":{"line":58,"column":2},"end":{"line":58,"column":12}},"42":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"43":{"start":{"line":62,"column":0},"end":{"line":82,"column":1}},"44":{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},"45":{"start":{"line":63,"column":20},"end":{"line":63,"column":39}},"46":{"start":{"line":64,"column":2},"end":{"line":66,"column":68}},"47":{"start":{"line":66,"column":26},"end":{"line":66,"column":65}},"48":{"start":{"line":67,"column":2},"end":{"line":74,"column":4}},"49":{"start":{"line":68,"column":4},"end":{"line":72,"column":27}},"50":{"start":{"line":69,"column":6},"end":{"line":71,"column":43}},"51":{"start":{"line":73,"column":4},"end":{"line":73,"column":18}},"52":{"start":{"line":75,"column":2},"end":{"line":75,"column":23}},"53":{"start":{"line":76,"column":2},"end":{"line":76,"column":20}},"54":{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},"55":{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},"56":{"start":{"line":78,"column":17},"end":{"line":78,"column":33}},"57":{"start":{"line":79,"column":4},"end":{"line":79,"column":52}},"58":{"start":{"line":79,"column":30},"end":{"line":79,"column":50}},"59":{"start":{"line":81,"column":2},"end":{"line":81,"column":14}},"60":{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},"61":{"start":{"line":85,"column":2},"end":{"line":85,"column":24}},"62":{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},"63":{"start":{"line":87,"column":2},"end":{"line":87,"column":38}},"64":{"start":{"line":87,"column":22},"end":{"line":87,"column":34}},"65":{"start":{"line":89,"column":2},"end":{"line":89,"column":24}}},"branchMap":{"1":{"line":28,"type":"if","locations":[{"start":{"line":28,"column":4},"end":{"line":28,"column":4}},{"start":{"line":28,"column":4},"end":{"line":28,"column":4}}]},"2":{"line":41,"type":"binary-expr","locations":[{"start":{"line":41,"column":16},"end":{"line":41,"column":21}},{"start":{"line":41,"column":25},"end":{"line":41,"column":35}}]},"3":{"line":42,"type":"if","locations":[{"start":{"line":42,"column":4},"end":{"line":42,"column":4}},{"start":{"line":42,"column":4},"end":{"line":42,"column":4}}]},"4":{"line":63,"type":"if","locations":[{"start":{"line":63,"column":2},"end":{"line":63,"column":2}},{"start":{"line":63,"column":2},"end":{"line":63,"column":2}}]},"5":{"line":65,"type":"binary-expr","locations":[{"start":{"line":65,"column":14},"end":{"line":65,"column":18}},{"start":{"line":65,"column":22},"end":{"line":65,"column":32}}]},"6":{"line":77,"type":"if","locations":[{"start":{"line":77,"column":2},"end":{"line":77,"column":2}},{"start":{"line":77,"column":2},"end":{"line":77,"column":2}}]},"7":{"line":78,"type":"if","locations":[{"start":{"line":78,"column":4},"end":{"line":78,"column":4}},{"start":{"line":78,"column":4},"end":{"line":78,"column":4}}]},"8":{"line":84,"type":"if","locations":[{"start":{"line":84,"column":0},"end":{"line":84,"column":0}},{"start":{"line":84,"column":0},"end":{"line":84,"column":0}}]},"9":{"line":84,"type":"binary-expr","locations":[{"start":{"line":84,"column":4},"end":{"line":84,"column":10}},{"start":{"line":84,"column":14},"end":{"line":84,"column":28}}]},"10":{"line":86,"type":"if","locations":[{"start":{"line":86,"column":7},"end":{"line":86,"column":7}},{"start":{"line":86,"column":7},"end":{"line":86,"column":7}}]},"11":{"line":86,"type":"binary-expr","locations":[{"start":{"line":86,"column":11},"end":{"line":86,"column":17}},{"start":{"line":86,"column":21},"end":{"line":86,"column":31}}]},"12":{"line":94,"type":"binary-expr","locations":[{"start":{"line":94,"column":2},"end":{"line":94,"column":29}},{"start":{"line":94,"column":33},"end":{"line":94,"column":39}}]},"13":{"line":95,"type":"binary-expr","locations":[{"start":{"line":95,"column":2},"end":{"line":95,"column":31}},{"start":{"line":95,"column":35},"end":{"line":95,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/xor4096.js":{"path":"/home/davidbau/git/seedrandom/lib/xor4096.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105129,"6":4105129,"7":4105129,"8":4105129,"9":4105129,"10":4105129,"11":4105129,"12":4105129,"13":4105129,"14":4105129,"15":4105129,"16":1,"17":3,"18":3,"19":2,"20":2,"21":1,"22":1,"23":1,"24":3,"25":480,"26":160,"27":480,"28":3,"29":480,"30":480,"31":480,"32":480,"33":480,"34":384,"35":384,"36":384,"37":3,"38":0,"39":3,"40":3,"41":1536,"42":1536,"43":1536,"44":1536,"45":1536,"46":1536,"47":1536,"48":3,"49":3,"50":3,"51":3,"52":1,"53":2,"54":2,"55":2,"56":2,"57":1,"58":3,"59":0,"60":3,"61":4102054,"62":3,"63":1025,"64":1025,"65":1025,"66":3,"67":3,"68":3,"69":2,"70":1,"71":2,"72":1,"73":3,"74":1,"75":1,"76":0,"77":0,"78":0,"79":0},"b":{"1":[2,1],"2":[160,320],"3":[3,477],"4":[384,96],"5":[0,384],"6":[0,3],"7":[0,0,0],"8":[0,3],"9":[3,2],"10":[2,1],"11":[1,1],"12":[1,0],"13":[1,1],"14":[0,0],"15":[0,0],"16":[1,1],"17":[1,0]},"f":{"1":1,"2":3,"3":4105129,"4":3,"5":2,"6":3,"7":4102054,"8":1025,"9":1,"10":0},"fnMap":{"1":{"name":"(anonymous_1)","line":26,"loc":{"start":{"line":26,"column":1},"end":{"line":26,"column":34}}},"2":{"name":"XorGen","line":28,"loc":{"start":{"line":28,"column":0},"end":{"line":28,"column":22}}},"3":{"name":"(anonymous_3)","line":32,"loc":{"start":{"line":32,"column":12},"end":{"line":32,"column":23}}},"4":{"name":"init","line":51,"loc":{"start":{"line":51,"column":2},"end":{"line":51,"column":26}}},"5":{"name":"copy","line":105,"loc":{"start":{"line":105,"column":0},"end":{"line":105,"column":20}}},"6":{"name":"impl","line":112,"loc":{"start":{"line":112,"column":0},"end":{"line":112,"column":26}}},"7":{"name":"(anonymous_7)","line":116,"loc":{"start":{"line":116,"column":13},"end":{"line":116,"column":24}}},"8":{"name":"(anonymous_8)","line":117,"loc":{"start":{"line":117,"column":16},"end":{"line":117,"column":27}}},"9":{"name":"(anonymous_9)","line":129,"loc":{"start":{"line":129,"column":17},"end":{"line":129,"column":28}}},"10":{"name":"(anonymous_10)","line":137,"loc":{"start":{"line":137,"column":9},"end":{"line":137,"column":20}}}},"statementMap":{"1":{"start":{"line":26,"column":0},"end":{"line":146,"column":2}},"2":{"start":{"line":28,"column":0},"end":{"line":103,"column":1}},"3":{"start":{"line":29,"column":2},"end":{"line":29,"column":16}},"4":{"start":{"line":32,"column":2},"end":{"line":49,"column":4}},"5":{"start":{"line":33,"column":4},"end":{"line":34,"column":33}},"6":{"start":{"line":36,"column":4},"end":{"line":36,"column":36}},"7":{"start":{"line":38,"column":4},"end":{"line":38,"column":26}},"8":{"start":{"line":39,"column":4},"end":{"line":39,"column":31}},"9":{"start":{"line":40,"column":4},"end":{"line":40,"column":17}},"10":{"start":{"line":41,"column":4},"end":{"line":41,"column":17}},"11":{"start":{"line":42,"column":4},"end":{"line":42,"column":18}},"12":{"start":{"line":43,"column":4},"end":{"line":43,"column":18}},"13":{"start":{"line":45,"column":4},"end":{"line":45,"column":21}},"14":{"start":{"line":46,"column":4},"end":{"line":46,"column":13}},"15":{"start":{"line":48,"column":4},"end":{"line":48,"column":38}},"16":{"start":{"line":51,"column":2},"end":{"line":100,"column":3}},"17":{"start":{"line":52,"column":4},"end":{"line":52,"column":43}},"18":{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},"19":{"start":{"line":55,"column":6},"end":{"line":55,"column":15}},"20":{"start":{"line":56,"column":6},"end":{"line":56,"column":18}},"21":{"start":{"line":59,"column":6},"end":{"line":59,"column":25}},"22":{"start":{"line":60,"column":6},"end":{"line":60,"column":12}},"23":{"start":{"line":61,"column":6},"end":{"line":61,"column":43}},"24":{"start":{"line":64,"column":4},"end":{"line":78,"column":5}},"25":{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},"26":{"start":{"line":66,"column":16},"end":{"line":66,"column":61}},"27":{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},"28":{"start":{"line":68,"column":19},"end":{"line":68,"column":25}},"29":{"start":{"line":69,"column":6},"end":{"line":69,"column":19}},"30":{"start":{"line":70,"column":6},"end":{"line":70,"column":20}},"31":{"start":{"line":71,"column":6},"end":{"line":71,"column":18}},"32":{"start":{"line":72,"column":6},"end":{"line":72,"column":20}},"33":{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},"34":{"start":{"line":74,"column":8},"end":{"line":74,"column":33}},"35":{"start":{"line":75,"column":8},"end":{"line":75,"column":36}},"36":{"start":{"line":76,"column":8},"end":{"line":76,"column":33}},"37":{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},"38":{"start":{"line":81,"column":6},"end":{"line":81,"column":47}},"39":{"start":{"line":86,"column":4},"end":{"line":86,"column":12}},"40":{"start":{"line":87,"column":4},"end":{"line":95,"column":5}},"41":{"start":{"line":88,"column":6},"end":{"line":88,"column":28}},"42":{"start":{"line":89,"column":6},"end":{"line":89,"column":33}},"43":{"start":{"line":90,"column":6},"end":{"line":90,"column":19}},"44":{"start":{"line":91,"column":6},"end":{"line":91,"column":19}},"45":{"start":{"line":92,"column":6},"end":{"line":92,"column":20}},"46":{"start":{"line":93,"column":6},"end":{"line":93,"column":20}},"47":{"start":{"line":94,"column":6},"end":{"line":94,"column":19}},"48":{"start":{"line":97,"column":4},"end":{"line":97,"column":13}},"49":{"start":{"line":98,"column":4},"end":{"line":98,"column":13}},"50":{"start":{"line":99,"column":4},"end":{"line":99,"column":13}},"51":{"start":{"line":102,"column":2},"end":{"line":102,"column":17}},"52":{"start":{"line":105,"column":0},"end":{"line":110,"column":1}},"53":{"start":{"line":106,"column":2},"end":{"line":106,"column":12}},"54":{"start":{"line":107,"column":2},"end":{"line":107,"column":12}},"55":{"start":{"line":108,"column":2},"end":{"line":108,"column":20}},"56":{"start":{"line":109,"column":2},"end":{"line":109,"column":11}},"57":{"start":{"line":112,"column":0},"end":{"line":132,"column":1}},"58":{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},"59":{"start":{"line":113,"column":20},"end":{"line":113,"column":39}},"60":{"start":{"line":114,"column":2},"end":{"line":116,"column":68}},"61":{"start":{"line":116,"column":26},"end":{"line":116,"column":65}},"62":{"start":{"line":117,"column":2},"end":{"line":124,"column":4}},"63":{"start":{"line":118,"column":4},"end":{"line":122,"column":27}},"64":{"start":{"line":119,"column":6},"end":{"line":121,"column":43}},"65":{"start":{"line":123,"column":4},"end":{"line":123,"column":18}},"66":{"start":{"line":125,"column":2},"end":{"line":125,"column":23}},"67":{"start":{"line":126,"column":2},"end":{"line":126,"column":20}},"68":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"69":{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},"70":{"start":{"line":128,"column":17},"end":{"line":128,"column":33}},"71":{"start":{"line":129,"column":4},"end":{"line":129,"column":52}},"72":{"start":{"line":129,"column":30},"end":{"line":129,"column":50}},"73":{"start":{"line":131,"column":2},"end":{"line":131,"column":14}},"74":{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},"75":{"start":{"line":135,"column":2},"end":{"line":135,"column":24}},"76":{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},"77":{"start":{"line":137,"column":2},"end":{"line":137,"column":38}},"78":{"start":{"line":137,"column":22},"end":{"line":137,"column":34}},"79":{"start":{"line":139,"column":2},"end":{"line":139,"column":22}}},"branchMap":{"1":{"line":53,"type":"if","locations":[{"start":{"line":53,"column":4},"end":{"line":53,"column":4}},{"start":{"line":53,"column":4},"end":{"line":53,"column":4}}]},"2":{"line":66,"type":"if","locations":[{"start":{"line":66,"column":6},"end":{"line":66,"column":6}},{"start":{"line":66,"column":6},"end":{"line":66,"column":6}}]},"3":{"line":68,"type":"if","locations":[{"start":{"line":68,"column":6},"end":{"line":68,"column":6}},{"start":{"line":68,"column":6},"end":{"line":68,"column":6}}]},"4":{"line":73,"type":"if","locations":[{"start":{"line":73,"column":6},"end":{"line":73,"column":6}},{"start":{"line":73,"column":6},"end":{"line":73,"column":6}}]},"5":{"line":76,"type":"cond-expr","locations":[{"start":{"line":76,"column":23},"end":{"line":76,"column":28}},{"start":{"line":76,"column":31},"end":{"line":76,"column":32}}]},"6":{"line":80,"type":"if","locations":[{"start":{"line":80,"column":4},"end":{"line":80,"column":4}},{"start":{"line":80,"column":4},"end":{"line":80,"column":4}}]},"7":{"line":81,"type":"binary-expr","locations":[{"start":{"line":81,"column":9},"end":{"line":81,"column":13}},{"start":{"line":81,"column":17},"end":{"line":81,"column":28}},{"start":{"line":81,"column":32},"end":{"line":81,"column":33}}]},"8":{"line":113,"type":"if","locations":[{"start":{"line":113,"column":2},"end":{"line":113,"column":2}},{"start":{"line":113,"column":2},"end":{"line":113,"column":2}}]},"9":{"line":115,"type":"binary-expr","locations":[{"start":{"line":115,"column":14},"end":{"line":115,"column":18}},{"start":{"line":115,"column":22},"end":{"line":115,"column":32}}]},"10":{"line":127,"type":"if","locations":[{"start":{"line":127,"column":2},"end":{"line":127,"column":2}},{"start":{"line":127,"column":2},"end":{"line":127,"column":2}}]},"11":{"line":128,"type":"if","locations":[{"start":{"line":128,"column":4},"end":{"line":128,"column":4}},{"start":{"line":128,"column":4},"end":{"line":128,"column":4}}]},"12":{"line":134,"type":"if","locations":[{"start":{"line":134,"column":0},"end":{"line":134,"column":0}},{"start":{"line":134,"column":0},"end":{"line":134,"column":0}}]},"13":{"line":134,"type":"binary-expr","locations":[{"start":{"line":134,"column":4},"end":{"line":134,"column":10}},{"start":{"line":134,"column":14},"end":{"line":134,"column":28}}]},"14":{"line":136,"type":"if","locations":[{"start":{"line":136,"column":7},"end":{"line":136,"column":7}},{"start":{"line":136,"column":7},"end":{"line":136,"column":7}}]},"15":{"line":136,"type":"binary-expr","locations":[{"start":{"line":136,"column":11},"end":{"line":136,"column":17}},{"start":{"line":136,"column":21},"end":{"line":136,"column":31}}]},"16":{"line":144,"type":"binary-expr","locations":[{"start":{"line":144,"column":2},"end":{"line":144,"column":29}},{"start":{"line":144,"column":33},"end":{"line":144,"column":39}}]},"17":{"line":145,"type":"binary-expr","locations":[{"start":{"line":145,"column":2},"end":{"line":145,"column":31}},{"start":{"line":145,"column":35},"end":{"line":145,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/tychei.js":{"path":"/home/davidbau/git/seedrandom/lib/tychei.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105195,"6":4105195,"7":4105195,"8":4105195,"9":4105195,"10":4105195,"11":4105195,"12":4105195,"13":4105195,"14":3,"15":3,"16":3,"17":3,"18":3,"19":2,"20":2,"21":1,"22":3,"23":66,"24":66,"25":1,"26":2,"27":2,"28":2,"29":2,"30":2,"31":1,"32":3,"33":4102054,"34":3,"35":1025,"36":1025,"37":1025,"38":3,"39":3,"40":3,"41":2,"42":1,"43":2,"44":1,"45":3,"46":1,"47":1,"48":0,"49":0,"50":0,"51":0},"b":{"1":[2,1],"2":[3,2],"3":[2,1],"4":[1,1],"5":[1,0],"6":[1,1],"7":[0,0],"8":[0,0],"9":[1,1],"10":[1,0]},"f":{"1":1,"2":3,"3":4105195,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"fnMap":{"1":{"name":"(anonymous_1)","line":5,"loc":{"start":{"line":5,"column":1},"end":{"line":5,"column":34}}},"2":{"name":"XorGen","line":7,"loc":{"start":{"line":7,"column":0},"end":{"line":7,"column":22}}},"3":{"name":"(anonymous_3)","line":11,"loc":{"start":{"line":11,"column":12},"end":{"line":11,"column":23}}},"4":{"name":"copy","line":60,"loc":{"start":{"line":60,"column":0},"end":{"line":60,"column":20}}},"5":{"name":"impl","line":68,"loc":{"start":{"line":68,"column":0},"end":{"line":68,"column":26}}},"6":{"name":"(anonymous_6)","line":71,"loc":{"start":{"line":71,"column":13},"end":{"line":71,"column":24}}},"7":{"name":"(anonymous_7)","line":72,"loc":{"start":{"line":72,"column":16},"end":{"line":72,"column":27}}},"8":{"name":"(anonymous_8)","line":84,"loc":{"start":{"line":84,"column":17},"end":{"line":84,"column":28}}},"9":{"name":"(anonymous_9)","line":92,"loc":{"start":{"line":92,"column":9},"end":{"line":92,"column":20}}}},"statementMap":{"1":{"start":{"line":5,"column":0},"end":{"line":101,"column":2}},"2":{"start":{"line":7,"column":0},"end":{"line":58,"column":1}},"3":{"start":{"line":8,"column":2},"end":{"line":8,"column":30}},"4":{"start":{"line":11,"column":2},"end":{"line":21,"column":4}},"5":{"start":{"line":12,"column":4},"end":{"line":12,"column":47}},"6":{"start":{"line":13,"column":4},"end":{"line":13,"column":34}},"7":{"start":{"line":14,"column":4},"end":{"line":14,"column":20}},"8":{"start":{"line":15,"column":4},"end":{"line":15,"column":34}},"9":{"start":{"line":16,"column":4},"end":{"line":16,"column":20}},"10":{"start":{"line":17,"column":4},"end":{"line":17,"column":42}},"11":{"start":{"line":18,"column":4},"end":{"line":18,"column":27}},"12":{"start":{"line":19,"column":4},"end":{"line":19,"column":38}},"13":{"start":{"line":20,"column":4},"end":{"line":20,"column":30}},"14":{"start":{"line":39,"column":2},"end":{"line":39,"column":11}},"15":{"start":{"line":40,"column":2},"end":{"line":40,"column":11}},"16":{"start":{"line":41,"column":2},"end":{"line":41,"column":24}},"17":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"18":{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},"19":{"start":{"line":46,"column":4},"end":{"line":46,"column":36}},"20":{"start":{"line":47,"column":4},"end":{"line":47,"column":20}},"21":{"start":{"line":50,"column":4},"end":{"line":50,"column":20}},"22":{"start":{"line":54,"column":2},"end":{"line":57,"column":3}},"23":{"start":{"line":55,"column":4},"end":{"line":55,"column":38}},"24":{"start":{"line":56,"column":4},"end":{"line":56,"column":14}},"25":{"start":{"line":60,"column":0},"end":{"line":66,"column":1}},"26":{"start":{"line":61,"column":2},"end":{"line":61,"column":12}},"27":{"start":{"line":62,"column":2},"end":{"line":62,"column":12}},"28":{"start":{"line":63,"column":2},"end":{"line":63,"column":12}},"29":{"start":{"line":64,"column":2},"end":{"line":64,"column":12}},"30":{"start":{"line":65,"column":2},"end":{"line":65,"column":11}},"31":{"start":{"line":68,"column":0},"end":{"line":87,"column":1}},"32":{"start":{"line":69,"column":2},"end":{"line":71,"column":68}},"33":{"start":{"line":71,"column":26},"end":{"line":71,"column":65}},"34":{"start":{"line":72,"column":2},"end":{"line":79,"column":4}},"35":{"start":{"line":73,"column":4},"end":{"line":77,"column":27}},"36":{"start":{"line":74,"column":6},"end":{"line":76,"column":43}},"37":{"start":{"line":78,"column":4},"end":{"line":78,"column":18}},"38":{"start":{"line":80,"column":2},"end":{"line":80,"column":23}},"39":{"start":{"line":81,"column":2},"end":{"line":81,"column":20}},"40":{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},"41":{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},"42":{"start":{"line":83,"column":35},"end":{"line":83,"column":51}},"43":{"start":{"line":84,"column":4},"end":{"line":84,"column":52}},"44":{"start":{"line":84,"column":30},"end":{"line":84,"column":50}},"45":{"start":{"line":86,"column":2},"end":{"line":86,"column":14}},"46":{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},"47":{"start":{"line":90,"column":2},"end":{"line":90,"column":24}},"48":{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},"49":{"start":{"line":92,"column":2},"end":{"line":92,"column":38}},"50":{"start":{"line":92,"column":22},"end":{"line":92,"column":34}},"51":{"start":{"line":94,"column":2},"end":{"line":94,"column":21}}},"branchMap":{"1":{"line":44,"type":"if","locations":[{"start":{"line":44,"column":2},"end":{"line":44,"column":2}},{"start":{"line":44,"column":2},"end":{"line":44,"column":2}}]},"2":{"line":70,"type":"binary-expr","locations":[{"start":{"line":70,"column":14},"end":{"line":70,"column":18}},{"start":{"line":70,"column":22},"end":{"line":70,"column":32}}]},"3":{"line":82,"type":"if","locations":[{"start":{"line":82,"column":2},"end":{"line":82,"column":2}},{"start":{"line":82,"column":2},"end":{"line":82,"column":2}}]},"4":{"line":83,"type":"if","locations":[{"start":{"line":83,"column":4},"end":{"line":83,"column":4}},{"start":{"line":83,"column":4},"end":{"line":83,"column":4}}]},"5":{"line":89,"type":"if","locations":[{"start":{"line":89,"column":0},"end":{"line":89,"column":0}},{"start":{"line":89,"column":0},"end":{"line":89,"column":0}}]},"6":{"line":89,"type":"binary-expr","locations":[{"start":{"line":89,"column":4},"end":{"line":89,"column":10}},{"start":{"line":89,"column":14},"end":{"line":89,"column":28}}]},"7":{"line":91,"type":"if","locations":[{"start":{"line":91,"column":7},"end":{"line":91,"column":7}},{"start":{"line":91,"column":7},"end":{"line":91,"column":7}}]},"8":{"line":91,"type":"binary-expr","locations":[{"start":{"line":91,"column":11},"end":{"line":91,"column":17}},{"start":{"line":91,"column":21},"end":{"line":91,"column":31}}]},"9":{"line":99,"type":"binary-expr","locations":[{"start":{"line":99,"column":2},"end":{"line":99,"column":29}},{"start":{"line":99,"column":33},"end":{"line":99,"column":39}}]},"10":{"line":100,"type":"binary-expr","locations":[{"start":{"line":100,"column":2},"end":{"line":100,"column":31}},{"start":{"line":100,"column":35},"end":{"line":100,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/alea.js":{"path":"/home/davidbau/git/seedrandom/lib/alea.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105129,"6":4105129,"7":4105129,"8":4105129,"9":3,"10":3,"11":3,"12":3,"13":3,"14":3,"15":1,"16":3,"17":3,"18":3,"19":3,"20":3,"21":0,"22":3,"23":1,"24":2,"25":2,"26":2,"27":2,"28":2,"29":1,"30":3,"31":3,"32":1025,"33":3,"34":1025,"35":3,"36":3,"37":2,"38":1,"39":2,"40":1,"41":3,"42":1,"43":3,"44":3,"45":18,"46":18,"47":33,"48":33,"49":33,"50":33,"51":33,"52":33,"53":33,"54":33,"55":18,"56":3,"57":1,"58":1,"59":0,"60":0,"61":0,"62":0},"b":{"1":[1,2],"2":[3,0],"3":[0,3],"4":[3,2],"5":[2,1],"6":[1,1],"7":[1,0],"8":[1,1],"9":[0,0],"10":[0,0],"11":[1,1],"12":[1,0]},"f":{"1":1,"2":3,"3":4105129,"4":2,"5":3,"6":1025,"7":1025,"8":1,"9":3,"10":18,"11":0},"fnMap":{"1":{"name":"(anonymous_1)","line":28,"loc":{"start":{"line":28,"column":1},"end":{"line":28,"column":34}}},"2":{"name":"Alea","line":30,"loc":{"start":{"line":30,"column":0},"end":{"line":30,"column":20}}},"3":{"name":"(anonymous_3)","line":33,"loc":{"start":{"line":33,"column":12},"end":{"line":33,"column":23}}},"4":{"name":"copy","line":54,"loc":{"start":{"line":54,"column":0},"end":{"line":54,"column":20}}},"5":{"name":"impl","line":62,"loc":{"start":{"line":62,"column":0},"end":{"line":62,"column":26}}},"6":{"name":"(anonymous_6)","line":66,"loc":{"start":{"line":66,"column":15},"end":{"line":66,"column":26}}},"7":{"name":"(anonymous_7)","line":67,"loc":{"start":{"line":67,"column":16},"end":{"line":67,"column":27}}},"8":{"name":"(anonymous_8)","line":73,"loc":{"start":{"line":73,"column":17},"end":{"line":73,"column":28}}},"9":{"name":"Mash","line":78,"loc":{"start":{"line":78,"column":0},"end":{"line":78,"column":16}}},"10":{"name":"(anonymous_10)","line":81,"loc":{"start":{"line":81,"column":13},"end":{"line":81,"column":28}}},"11":{"name":"(anonymous_11)","line":103,"loc":{"start":{"line":103,"column":9},"end":{"line":103,"column":20}}}},"statementMap":{"1":{"start":{"line":28,"column":0},"end":{"line":112,"column":2}},"2":{"start":{"line":30,"column":0},"end":{"line":52,"column":1}},"3":{"start":{"line":31,"column":2},"end":{"line":31,"column":31}},"4":{"start":{"line":33,"column":2},"end":{"line":38,"column":4}},"5":{"start":{"line":34,"column":4},"end":{"line":34,"column":60}},"6":{"start":{"line":35,"column":4},"end":{"line":35,"column":18}},"7":{"start":{"line":36,"column":4},"end":{"line":36,"column":18}},"8":{"start":{"line":37,"column":4},"end":{"line":37,"column":38}},"9":{"start":{"line":41,"column":2},"end":{"line":41,"column":11}},"10":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"11":{"start":{"line":43,"column":2},"end":{"line":43,"column":20}},"12":{"start":{"line":44,"column":2},"end":{"line":44,"column":20}},"13":{"start":{"line":45,"column":2},"end":{"line":45,"column":22}},"14":{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},"15":{"start":{"line":46,"column":19},"end":{"line":46,"column":30}},"16":{"start":{"line":47,"column":2},"end":{"line":47,"column":22}},"17":{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},"18":{"start":{"line":48,"column":19},"end":{"line":48,"column":30}},"19":{"start":{"line":49,"column":2},"end":{"line":49,"column":22}},"20":{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},"21":{"start":{"line":50,"column":19},"end":{"line":50,"column":30}},"22":{"start":{"line":51,"column":2},"end":{"line":51,"column":14}},"23":{"start":{"line":54,"column":0},"end":{"line":60,"column":1}},"24":{"start":{"line":55,"column":2},"end":{"line":55,"column":12}},"25":{"start":{"line":56,"column":2},"end":{"line":56,"column":14}},"26":{"start":{"line":57,"column":2},"end":{"line":57,"column":14}},"27":{"start":{"line":58,"column":2},"end":{"line":58,"column":14}},"28":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"29":{"start":{"line":62,"column":0},"end":{"line":76,"column":1}},"30":{"start":{"line":63,"column":2},"end":{"line":65,"column":21}},"31":{"start":{"line":66,"column":2},"end":{"line":66,"column":67}},"32":{"start":{"line":66,"column":28},"end":{"line":66,"column":65}},"33":{"start":{"line":67,"column":2},"end":{"line":69,"column":4}},"34":{"start":{"line":68,"column":4},"end":{"line":68,"column":69}},"35":{"start":{"line":70,"column":2},"end":{"line":70,"column":20}},"36":{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},"37":{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},"38":{"start":{"line":72,"column":35},"end":{"line":72,"column":51}},"39":{"start":{"line":73,"column":4},"end":{"line":73,"column":52}},"40":{"start":{"line":73,"column":30},"end":{"line":73,"column":50}},"41":{"start":{"line":75,"column":2},"end":{"line":75,"column":14}},"42":{"start":{"line":78,"column":0},"end":{"line":97,"column":1}},"43":{"start":{"line":79,"column":2},"end":{"line":79,"column":21}},"44":{"start":{"line":81,"column":2},"end":{"line":94,"column":4}},"45":{"start":{"line":82,"column":4},"end":{"line":82,"column":24}},"46":{"start":{"line":83,"column":4},"end":{"line":92,"column":5}},"47":{"start":{"line":84,"column":6},"end":{"line":84,"column":30}},"48":{"start":{"line":85,"column":6},"end":{"line":85,"column":38}},"49":{"start":{"line":86,"column":6},"end":{"line":86,"column":18}},"50":{"start":{"line":87,"column":6},"end":{"line":87,"column":13}},"51":{"start":{"line":88,"column":6},"end":{"line":88,"column":13}},"52":{"start":{"line":89,"column":6},"end":{"line":89,"column":18}},"53":{"start":{"line":90,"column":6},"end":{"line":90,"column":13}},"54":{"start":{"line":91,"column":6},"end":{"line":91,"column":27}},"55":{"start":{"line":93,"column":4},"end":{"line":93,"column":46}},"56":{"start":{"line":96,"column":2},"end":{"line":96,"column":14}},"57":{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},"58":{"start":{"line":101,"column":2},"end":{"line":101,"column":24}},"59":{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},"60":{"start":{"line":103,"column":2},"end":{"line":103,"column":38}},"61":{"start":{"line":103,"column":22},"end":{"line":103,"column":34}},"62":{"start":{"line":105,"column":2},"end":{"line":105,"column":19}}},"branchMap":{"1":{"line":46,"type":"if","locations":[{"start":{"line":46,"column":2},"end":{"line":46,"column":2}},{"start":{"line":46,"column":2},"end":{"line":46,"column":2}}]},"2":{"line":48,"type":"if","locations":[{"start":{"line":48,"column":2},"end":{"line":48,"column":2}},{"start":{"line":48,"column":2},"end":{"line":48,"column":2}}]},"3":{"line":50,"type":"if","locations":[{"start":{"line":50,"column":2},"end":{"line":50,"column":2}},{"start":{"line":50,"column":2},"end":{"line":50,"column":2}}]},"4":{"line":64,"type":"binary-expr","locations":[{"start":{"line":64,"column":14},"end":{"line":64,"column":18}},{"start":{"line":64,"column":22},"end":{"line":64,"column":32}}]},"5":{"line":71,"type":"if","locations":[{"start":{"line":71,"column":2},"end":{"line":71,"column":2}},{"start":{"line":71,"column":2},"end":{"line":71,"column":2}}]},"6":{"line":72,"type":"if","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":4}},{"start":{"line":72,"column":4},"end":{"line":72,"column":4}}]},"7":{"line":100,"type":"if","locations":[{"start":{"line":100,"column":0},"end":{"line":100,"column":0}},{"start":{"line":100,"column":0},"end":{"line":100,"column":0}}]},"8":{"line":100,"type":"binary-expr","locations":[{"start":{"line":100,"column":4},"end":{"line":100,"column":10}},{"start":{"line":100,"column":14},"end":{"line":100,"column":28}}]},"9":{"line":102,"type":"if","locations":[{"start":{"line":102,"column":7},"end":{"line":102,"column":7}},{"start":{"line":102,"column":7},"end":{"line":102,"column":7}}]},"10":{"line":102,"type":"binary-expr","locations":[{"start":{"line":102,"column":11},"end":{"line":102,"column":17}},{"start":{"line":102,"column":21},"end":{"line":102,"column":31}}]},"11":{"line":110,"type":"binary-expr","locations":[{"start":{"line":110,"column":2},"end":{"line":110,"column":29}},{"start":{"line":110,"column":33},"end":{"line":110,"column":39}}]},"12":{"line":111,"type":"binary-expr","locations":[{"start":{"line":111,"column":2},"end":{"line":111,"column":31}},{"start":{"line":111,"column":35},"end":{"line":111,"column":41}}]}}}}
\ No newline at end of file
diff --git a/node_modules/seedrandom/coverage/lcov-report/base.css b/node_modules/seedrandom/coverage/lcov-report/base.css
new file mode 100644
index 0000000..f418035
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/base.css
@@ -0,0 +1,224 @@
+body, html {
+  margin:0; padding: 0;
+  height: 100%;
+}
+body {
+    font-family: Helvetica Neue, Helvetica, Arial;
+    font-size: 14px;
+    color:#333;
+}
+.small { font-size: 12px; }
+*, *:after, *:before {
+  -webkit-box-sizing:border-box;
+     -moz-box-sizing:border-box;
+          box-sizing:border-box;
+  }
+h1 { font-size: 20px; margin: 0;}
+h2 { font-size: 14px; }
+pre {
+    font: 12px/1.4 Consolas, "Liberation Mono", Menlo, Courier, monospace;
+    margin: 0;
+    padding: 0;
+    -moz-tab-size: 2;
+    -o-tab-size:  2;
+    tab-size: 2;
+}
+a { color:#0074D9; text-decoration:none; }
+a:hover { text-decoration:underline; }
+.strong { font-weight: bold; }
+.space-top1 { padding: 10px 0 0 0; }
+.pad2y { padding: 20px 0; }
+.pad1y { padding: 10px 0; }
+.pad2x { padding: 0 20px; }
+.pad2 { padding: 20px; }
+.pad1 { padding: 10px; }
+.space-left2 { padding-left:55px; }
+.space-right2 { padding-right:20px; }
+.center { text-align:center; }
+.clearfix { display:block; }
+.clearfix:after {
+  content:'';
+  display:block;
+  height:0;
+  clear:both;
+  visibility:hidden;
+  }
+.fl { float: left; }
+@media only screen and (max-width:640px) {
+  .col3 { width:100%; max-width:100%; }
+  .hide-mobile { display:none!important; }
+}
+
+.quiet {
+  color: #7f7f7f;
+  color: rgba(0,0,0,0.5);
+}
+.quiet a { opacity: 0.7; }
+
+.fraction {
+  font-family: Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+  font-size: 10px;
+  color: #555;
+  background: #E8E8E8;
+  padding: 4px 5px;
+  border-radius: 3px;
+  vertical-align: middle;
+}
+
+div.path a:link, div.path a:visited { color: #333; }
+table.coverage {
+  border-collapse: collapse;
+  margin: 10px 0 0 0;
+  padding: 0;
+}
+
+table.coverage td {
+  margin: 0;
+  padding: 0;
+  vertical-align: top;
+}
+table.coverage td.line-count {
+    text-align: right;
+    padding: 0 5px 0 20px;
+}
+table.coverage td.line-coverage {
+    text-align: right;
+    padding-right: 10px;
+    min-width:20px;
+}
+
+table.coverage td span.cline-any {
+    display: inline-block;
+    padding: 0 5px;
+    width: 100%;
+}
+.missing-if-branch {
+    display: inline-block;
+    margin-right: 5px;
+    border-radius: 3px;
+    position: relative;
+    padding: 0 4px;
+    background: #333;
+    color: yellow;
+}
+
+.skip-if-branch {
+    display: none;
+    margin-right: 10px;
+    position: relative;
+    padding: 0 4px;
+    background: #ccc;
+    color: white;
+}
+.missing-if-branch .typ, .skip-if-branch .typ {
+    color: inherit !important;
+}
+.coverage-summary {
+  border-collapse: collapse;
+  width: 100%;
+}
+.coverage-summary tr { border-bottom: 1px solid #bbb; }
+.keyline-all { border: 1px solid #ddd; }
+.coverage-summary td, .coverage-summary th { padding: 10px; }
+.coverage-summary tbody { border: 1px solid #bbb; }
+.coverage-summary td { border-right: 1px solid #bbb; }
+.coverage-summary td:last-child { border-right: none; }
+.coverage-summary th {
+  text-align: left;
+  font-weight: normal;
+  white-space: nowrap;
+}
+.coverage-summary th.file { border-right: none !important; }
+.coverage-summary th.pct { }
+.coverage-summary th.pic,
+.coverage-summary th.abs,
+.coverage-summary td.pct,
+.coverage-summary td.abs { text-align: right; }
+.coverage-summary td.file { white-space: nowrap;  }
+.coverage-summary td.pic { min-width: 120px !important;  }
+.coverage-summary tfoot td { }
+
+.coverage-summary .sorter {
+    height: 10px;
+    width: 7px;
+    display: inline-block;
+    margin-left: 0.5em;
+    background: url(sort-arrow-sprite.png) no-repeat scroll 0 0 transparent;
+}
+.coverage-summary .sorted .sorter {
+    background-position: 0 -20px;
+}
+.coverage-summary .sorted-desc .sorter {
+    background-position: 0 -10px;
+}
+.status-line {  height: 10px; }
+/* yellow */
+.cbranch-no { background: yellow !important; color: #111; }
+/* dark red */
+.red.solid, .status-line.low, .low .cover-fill { background:#C21F39 }
+.low .chart { border:1px solid #C21F39 }
+.highlighted,
+.highlighted .cstat-no, .highlighted .fstat-no, .highlighted .cbranch-no{
+  background: #C21F39 !important;
+}
+/* medium red */
+.cstat-no, .fstat-no, .cbranch-no, .cbranch-no { background:#F6C6CE }
+/* light red */
+.low, .cline-no { background:#FCE1E5 }
+/* light green */
+.high, .cline-yes { background:rgb(230,245,208) }
+/* medium green */
+.cstat-yes { background:rgb(161,215,106) }
+/* dark green */
+.status-line.high, .high .cover-fill { background:rgb(77,146,33) }
+.high .chart { border:1px solid rgb(77,146,33) }
+/* dark yellow (gold) */
+.status-line.medium, .medium .cover-fill { background: #f9cd0b; }
+.medium .chart { border:1px solid #f9cd0b; }
+/* light yellow */
+.medium { background: #fff4c2; }
+
+.cstat-skip { background: #ddd; color: #111; }
+.fstat-skip { background: #ddd; color: #111 !important; }
+.cbranch-skip { background: #ddd !important; color: #111; }
+
+span.cline-neutral { background: #eaeaea; }
+
+.coverage-summary td.empty {
+    opacity: .5;
+    padding-top: 4px;
+    padding-bottom: 4px;
+    line-height: 1;
+    color: #888;
+}
+
+.cover-fill, .cover-empty {
+  display:inline-block;
+  height: 12px;
+}
+.chart {
+  line-height: 0;
+}
+.cover-empty {
+    background: white;
+}
+.cover-full {
+    border-right: none !important;
+}
+pre.prettyprint {
+    border: none !important;
+    padding: 0 !important;
+    margin: 0 !important;
+}
+.com { color: #999 !important; }
+.ignore-none { color: #999; font-weight: normal; }
+
+.wrapper {
+  min-height: 100%;
+  height: auto !important;
+  height: 100%;
+  margin: 0 auto -48px;
+}
+.footer, .push {
+  height: 48px;
+}
diff --git a/node_modules/seedrandom/coverage/lcov-report/block-navigation.js b/node_modules/seedrandom/coverage/lcov-report/block-navigation.js
new file mode 100644
index 0000000..c7ff5a5
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/block-navigation.js
@@ -0,0 +1,79 @@
+/* eslint-disable */
+var jumpToCode = (function init() {
+    // Classes of code we would like to highlight in the file view
+    var missingCoverageClasses = ['.cbranch-no', '.cstat-no', '.fstat-no'];
+
+    // Elements to highlight in the file listing view
+    var fileListingElements = ['td.pct.low'];
+
+    // We don't want to select elements that are direct descendants of another match
+    var notSelector = ':not(' + missingCoverageClasses.join('):not(') + ') > '; // becomes `:not(a):not(b) > `
+
+    // Selecter that finds elements on the page to which we can jump
+    var selector =
+        fileListingElements.join(', ') +
+        ', ' +
+        notSelector +
+        missingCoverageClasses.join(', ' + notSelector); // becomes `:not(a):not(b) > a, :not(a):not(b) > b`
+
+    // The NodeList of matching elements
+    var missingCoverageElements = document.querySelectorAll(selector);
+
+    var currentIndex;
+
+    function toggleClass(index) {
+        missingCoverageElements
+            .item(currentIndex)
+            .classList.remove('highlighted');
+        missingCoverageElements.item(index).classList.add('highlighted');
+    }
+
+    function makeCurrent(index) {
+        toggleClass(index);
+        currentIndex = index;
+        missingCoverageElements.item(index).scrollIntoView({
+            behavior: 'smooth',
+            block: 'center',
+            inline: 'center'
+        });
+    }
+
+    function goToPrevious() {
+        var nextIndex = 0;
+        if (typeof currentIndex !== 'number' || currentIndex === 0) {
+            nextIndex = missingCoverageElements.length - 1;
+        } else if (missingCoverageElements.length > 1) {
+            nextIndex = currentIndex - 1;
+        }
+
+        makeCurrent(nextIndex);
+    }
+
+    function goToNext() {
+        var nextIndex = 0;
+
+        if (
+            typeof currentIndex === 'number' &&
+            currentIndex < missingCoverageElements.length - 1
+        ) {
+            nextIndex = currentIndex + 1;
+        }
+
+        makeCurrent(nextIndex);
+    }
+
+    return function jump(event) {
+        switch (event.which) {
+            case 78: // n
+            case 74: // j
+                goToNext();
+                break;
+            case 66: // b
+            case 75: // k
+            case 80: // p
+                goToPrevious();
+                break;
+        }
+    };
+})();
+window.addEventListener('keydown', jumpToCode);
diff --git a/node_modules/seedrandom/coverage/lcov-report/index.html b/node_modules/seedrandom/coverage/lcov-report/index.html
new file mode 100644
index 0000000..6109d95
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/index.html
@@ -0,0 +1,110 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for All files</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="prettify.css" />
+    <link rel="stylesheet" href="base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      All files
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.21% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>439/471</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">73.2% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>142/194</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90.41% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>66/73</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94.44% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>374/396</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<div class="pad1">
+<table class="coverage-summary">
+<thead>
+<tr>
+   <th data-col="file" data-fmt="html" data-html="true" class="file">File</th>
+   <th data-col="pic" data-type="number" data-fmt="html" data-html="true" class="pic"></th>
+   <th data-col="statements" data-type="number" data-fmt="pct" class="pct">Statements</th>
+   <th data-col="statements_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="branches" data-type="number" data-fmt="pct" class="pct">Branches</th>
+   <th data-col="branches_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="functions" data-type="number" data-fmt="pct" class="pct">Functions</th>
+   <th data-col="functions_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="lines" data-type="number" data-fmt="pct" class="pct">Lines</th>
+   <th data-col="lines_raw" data-type="number" data-fmt="html" class="abs"></th>
+</tr>
+</thead>
+<tbody><tr>
+	<td class="file high" data-value="seedrandom"><a href="seedrandom/index.html">seedrandom</a></td>
+	<td data-value="96" class="pic high"><div class="chart"><div class="cover-fill" style="width: 96%;"></div><div class="cover-empty" style="width:4%;"></div></div></td>
+	<td data-value="96" class="pct high">96%</td>
+	<td data-value="100" class="abs high">96/100</td>
+	<td data-value="85.11" class="pct high">85.11%</td>
+	<td data-value="47" class="abs high">40/47</td>
+	<td data-value="93.33" class="pct high">93.33%</td>
+	<td data-value="15" class="abs high">14/15</td>
+	<td data-value="96.39" class="pct high">96.39%</td>
+	<td data-value="83" class="abs high">80/83</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="seedrandom/lib"><a href="seedrandom/lib/index.html">seedrandom/lib</a></td>
+	<td data-value="92.45" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.45" class="pct high">92.45%</td>
+	<td data-value="371" class="abs high">343/371</td>
+	<td data-value="69.39" class="pct medium">69.39%</td>
+	<td data-value="147" class="abs medium">102/147</td>
+	<td data-value="89.66" class="pct high">89.66%</td>
+	<td data-value="58" class="abs high">52/58</td>
+	<td data-value="93.93" class="pct high">93.93%</td>
+	<td data-value="313" class="abs high">294/313</td>
+	</tr>
+
+</tbody>
+</table>
+</div><div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="sorter.js"></script>
+<script src="block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/prettify.css b/node_modules/seedrandom/coverage/lcov-report/prettify.css
new file mode 100644
index 0000000..b317a7c
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/prettify.css
@@ -0,0 +1 @@
+.pln{color:#000}@media screen{.str{color:#080}.kwd{color:#008}.com{color:#800}.typ{color:#606}.lit{color:#066}.pun,.opn,.clo{color:#660}.tag{color:#008}.atn{color:#606}.atv{color:#080}.dec,.var{color:#606}.fun{color:red}}@media print,projection{.str{color:#060}.kwd{color:#006;font-weight:bold}.com{color:#600;font-style:italic}.typ{color:#404;font-weight:bold}.lit{color:#044}.pun,.opn,.clo{color:#440}.tag{color:#006;font-weight:bold}.atn{color:#404}.atv{color:#060}}pre.prettyprint{padding:2px;border:1px solid #888}ol.linenums{margin-top:0;margin-bottom:0}li.L0,li.L1,li.L2,li.L3,li.L5,li.L6,li.L7,li.L8{list-style-type:none}li.L1,li.L3,li.L5,li.L7,li.L9{background:#eee}
diff --git a/node_modules/seedrandom/coverage/lcov-report/prettify.js b/node_modules/seedrandom/coverage/lcov-report/prettify.js
new file mode 100644
index 0000000..b322523
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/prettify.js
@@ -0,0 +1,2 @@
+/* eslint-disable */
+window.PR_SHOULD_USE_CONTINUATION=true;(function(){var h=["break,continue,do,else,for,if,return,while"];var u=[h,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"];var p=[u,"catch,class,delete,false,import,new,operator,private,protected,public,this,throw,true,try,typeof"];var l=[p,"alignof,align_union,asm,axiom,bool,concept,concept_map,const_cast,constexpr,decltype,dynamic_cast,explicit,export,friend,inline,late_check,mutable,namespace,nullptr,reinterpret_cast,static_assert,static_cast,template,typeid,typename,using,virtual,where"];var x=[p,"abstract,boolean,byte,extends,final,finally,implements,import,instanceof,null,native,package,strictfp,super,synchronized,throws,transient"];var R=[x,"as,base,by,checked,decimal,delegate,descending,dynamic,event,fixed,foreach,from,group,implicit,in,interface,internal,into,is,lock,object,out,override,orderby,params,partial,readonly,ref,sbyte,sealed,stackalloc,string,select,uint,ulong,unchecked,unsafe,ushort,var"];var r="all,and,by,catch,class,else,extends,false,finally,for,if,in,is,isnt,loop,new,no,not,null,of,off,on,or,return,super,then,true,try,unless,until,when,while,yes";var w=[p,"debugger,eval,export,function,get,null,set,undefined,var,with,Infinity,NaN"];var s="caller,delete,die,do,dump,elsif,eval,exit,foreach,for,goto,if,import,last,local,my,next,no,our,print,package,redo,require,sub,undef,unless,until,use,wantarray,while,BEGIN,END";var I=[h,"and,as,assert,class,def,del,elif,except,exec,finally,from,global,import,in,is,lambda,nonlocal,not,or,pass,print,raise,try,with,yield,False,True,None"];var f=[h,"alias,and,begin,case,class,def,defined,elsif,end,ensure,false,in,module,next,nil,not,or,redo,rescue,retry,self,super,then,true,undef,unless,until,when,yield,BEGIN,END"];var H=[h,"case,done,elif,esac,eval,fi,function,in,local,set,then,until"];var A=[l,R,w,s+I,f,H];var e=/^(DIR|FILE|vector|(de|priority_)?queue|list|stack|(const_)?iterator|(multi)?(set|map)|bitset|u?(int|float)\d*)/;var C="str";var z="kwd";var j="com";var O="typ";var G="lit";var L="pun";var F="pln";var m="tag";var E="dec";var J="src";var P="atn";var n="atv";var N="nocode";var M="(?:^^\\.?|[+-]|\\!|\\!=|\\!==|\\#|\\%|\\%=|&|&&|&&=|&=|\\(|\\*|\\*=|\\+=|\\,|\\-=|\\->|\\/|\\/=|:|::|\\;|<|<<|<<=|<=|=|==|===|>|>=|>>|>>=|>>>|>>>=|\\?|\\@|\\[|\\^|\\^=|\\^\\^|\\^\\^=|\\{|\\||\\|=|\\|\\||\\|\\|=|\\~|break|case|continue|delete|do|else|finally|instanceof|return|throw|try|typeof)\\s*";function k(Z){var ad=0;var S=false;var ac=false;for(var V=0,U=Z.length;V<U;++V){var ae=Z[V];if(ae.ignoreCase){ac=true}else{if(/[a-z]/i.test(ae.source.replace(/\\u[0-9a-f]{4}|\\x[0-9a-f]{2}|\\[^ux]/gi,""))){S=true;ac=false;break}}}var Y={b:8,t:9,n:10,v:11,f:12,r:13};function ab(ah){var ag=ah.charCodeAt(0);if(ag!==92){return ag}var af=ah.charAt(1);ag=Y[af];if(ag){return ag}else{if("0"<=af&&af<="7"){return parseInt(ah.substring(1),8)}else{if(af==="u"||af==="x"){return parseInt(ah.substring(2),16)}else{return ah.charCodeAt(1)}}}}function T(af){if(af<32){return(af<16?"\\x0":"\\x")+af.toString(16)}var ag=String.fromCharCode(af);if(ag==="\\"||ag==="-"||ag==="["||ag==="]"){ag="\\"+ag}return ag}function X(am){var aq=am.substring(1,am.length-1).match(new RegExp("\\\\u[0-9A-Fa-f]{4}|\\\\x[0-9A-Fa-f]{2}|\\\\[0-3][0-7]{0,2}|\\\\[0-7]{1,2}|\\\\[\\s\\S]|-|[^-\\\\]","g"));var ak=[];var af=[];var ao=aq[0]==="^";for(var ar=ao?1:0,aj=aq.length;ar<aj;++ar){var ah=aq[ar];if(/\\[bdsw]/i.test(ah)){ak.push(ah)}else{var ag=ab(ah);var al;if(ar+2<aj&&"-"===aq[ar+1]){al=ab(aq[ar+2]);ar+=2}else{al=ag}af.push([ag,al]);if(!(al<65||ag>122)){if(!(al<65||ag>90)){af.push([Math.max(65,ag)|32,Math.min(al,90)|32])}if(!(al<97||ag>122)){af.push([Math.max(97,ag)&~32,Math.min(al,122)&~32])}}}}af.sort(function(av,au){return(av[0]-au[0])||(au[1]-av[1])});var ai=[];var ap=[NaN,NaN];for(var ar=0;ar<af.length;++ar){var at=af[ar];if(at[0]<=ap[1]+1){ap[1]=Math.max(ap[1],at[1])}else{ai.push(ap=at)}}var an=["["];if(ao){an.push("^")}an.push.apply(an,ak);for(var ar=0;ar<ai.length;++ar){var at=ai[ar];an.push(T(at[0]));if(at[1]>at[0]){if(at[1]+1>at[0]){an.push("-")}an.push(T(at[1]))}}an.push("]");return an.join("")}function W(al){var aj=al.source.match(new RegExp("(?:\\[(?:[^\\x5C\\x5D]|\\\\[\\s\\S])*\\]|\\\\u[A-Fa-f0-9]{4}|\\\\x[A-Fa-f0-9]{2}|\\\\[0-9]+|\\\\[^ux0-9]|\\(\\?[:!=]|[\\(\\)\\^]|[^\\x5B\\x5C\\(\\)\\^]+)","g"));var ah=aj.length;var an=[];for(var ak=0,am=0;ak<ah;++ak){var ag=aj[ak];if(ag==="("){++am}else{if("\\"===ag.charAt(0)){var af=+ag.substring(1);if(af&&af<=am){an[af]=-1}}}}for(var ak=1;ak<an.length;++ak){if(-1===an[ak]){an[ak]=++ad}}for(var ak=0,am=0;ak<ah;++ak){var ag=aj[ak];if(ag==="("){++am;if(an[am]===undefined){aj[ak]="(?:"}}else{if("\\"===ag.charAt(0)){var af=+ag.substring(1);if(af&&af<=am){aj[ak]="\\"+an[am]}}}}for(var ak=0,am=0;ak<ah;++ak){if("^"===aj[ak]&&"^"!==aj[ak+1]){aj[ak]=""}}if(al.ignoreCase&&S){for(var ak=0;ak<ah;++ak){var ag=aj[ak];var ai=ag.charAt(0);if(ag.length>=2&&ai==="["){aj[ak]=X(ag)}else{if(ai!=="\\"){aj[ak]=ag.replace(/[a-zA-Z]/g,function(ao){var ap=ao.charCodeAt(0);return"["+String.fromCharCode(ap&~32,ap|32)+"]"})}}}}return aj.join("")}var aa=[];for(var V=0,U=Z.length;V<U;++V){var ae=Z[V];if(ae.global||ae.multiline){throw new Error(""+ae)}aa.push("(?:"+W(ae)+")")}return new RegExp(aa.join("|"),ac?"gi":"g")}function a(V){var U=/(?:^|\s)nocode(?:\s|$)/;var X=[];var T=0;var Z=[];var W=0;var S;if(V.currentStyle){S=V.currentStyle.whiteSpace}else{if(window.getComputedStyle){S=document.defaultView.getComputedStyle(V,null).getPropertyValue("white-space")}}var Y=S&&"pre"===S.substring(0,3);function aa(ab){switch(ab.nodeType){case 1:if(U.test(ab.className)){return}for(var ae=ab.firstChild;ae;ae=ae.nextSibling){aa(ae)}var ad=ab.nodeName;if("BR"===ad||"LI"===ad){X[W]="\n";Z[W<<1]=T++;Z[(W++<<1)|1]=ab}break;case 3:case 4:var ac=ab.nodeValue;if(ac.length){if(!Y){ac=ac.replace(/[ \t\r\n]+/g," ")}else{ac=ac.replace(/\r\n?/g,"\n")}X[W]=ac;Z[W<<1]=T;T+=ac.length;Z[(W++<<1)|1]=ab}break}}aa(V);return{sourceCode:X.join("").replace(/\n$/,""),spans:Z}}function B(S,U,W,T){if(!U){return}var V={sourceCode:U,basePos:S};W(V);T.push.apply(T,V.decorations)}var v=/\S/;function o(S){var V=undefined;for(var U=S.firstChild;U;U=U.nextSibling){var T=U.nodeType;V=(T===1)?(V?S:U):(T===3)?(v.test(U.nodeValue)?S:V):V}return V===S?undefined:V}function g(U,T){var S={};var V;(function(){var ad=U.concat(T);var ah=[];var ag={};for(var ab=0,Z=ad.length;ab<Z;++ab){var Y=ad[ab];var ac=Y[3];if(ac){for(var ae=ac.length;--ae>=0;){S[ac.charAt(ae)]=Y}}var af=Y[1];var aa=""+af;if(!ag.hasOwnProperty(aa)){ah.push(af);ag[aa]=null}}ah.push(/[\0-\uffff]/);V=k(ah)})();var X=T.length;var W=function(ah){var Z=ah.sourceCode,Y=ah.basePos;var ad=[Y,F];var af=0;var an=Z.match(V)||[];var aj={};for(var ae=0,aq=an.length;ae<aq;++ae){var ag=an[ae];var ap=aj[ag];var ai=void 0;var am;if(typeof ap==="string"){am=false}else{var aa=S[ag.charAt(0)];if(aa){ai=ag.match(aa[1]);ap=aa[0]}else{for(var ao=0;ao<X;++ao){aa=T[ao];ai=ag.match(aa[1]);if(ai){ap=aa[0];break}}if(!ai){ap=F}}am=ap.length>=5&&"lang-"===ap.substring(0,5);if(am&&!(ai&&typeof ai[1]==="string")){am=false;ap=J}if(!am){aj[ag]=ap}}var ab=af;af+=ag.length;if(!am){ad.push(Y+ab,ap)}else{var al=ai[1];var ak=ag.indexOf(al);var ac=ak+al.length;if(ai[2]){ac=ag.length-ai[2].length;ak=ac-al.length}var ar=ap.substring(5);B(Y+ab,ag.substring(0,ak),W,ad);B(Y+ab+ak,al,q(ar,al),ad);B(Y+ab+ac,ag.substring(ac),W,ad)}}ah.decorations=ad};return W}function i(T){var W=[],S=[];if(T.tripleQuotedStrings){W.push([C,/^(?:\'\'\'(?:[^\'\\]|\\[\s\S]|\'{1,2}(?=[^\']))*(?:\'\'\'|$)|\"\"\"(?:[^\"\\]|\\[\s\S]|\"{1,2}(?=[^\"]))*(?:\"\"\"|$)|\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$))/,null,"'\""])}else{if(T.multiLineStrings){W.push([C,/^(?:\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$)|\`(?:[^\\\`]|\\[\s\S])*(?:\`|$))/,null,"'\"`"])}else{W.push([C,/^(?:\'(?:[^\\\'\r\n]|\\.)*(?:\'|$)|\"(?:[^\\\"\r\n]|\\.)*(?:\"|$))/,null,"\"'"])}}if(T.verbatimStrings){S.push([C,/^@\"(?:[^\"]|\"\")*(?:\"|$)/,null])}var Y=T.hashComments;if(Y){if(T.cStyleComments){if(Y>1){W.push([j,/^#(?:##(?:[^#]|#(?!##))*(?:###|$)|.*)/,null,"#"])}else{W.push([j,/^#(?:(?:define|elif|else|endif|error|ifdef|include|ifndef|line|pragma|undef|warning)\b|[^\r\n]*)/,null,"#"])}S.push([C,/^<(?:(?:(?:\.\.\/)*|\/?)(?:[\w-]+(?:\/[\w-]+)+)?[\w-]+\.h|[a-z]\w*)>/,null])}else{W.push([j,/^#[^\r\n]*/,null,"#"])}}if(T.cStyleComments){S.push([j,/^\/\/[^\r\n]*/,null]);S.push([j,/^\/\*[\s\S]*?(?:\*\/|$)/,null])}if(T.regexLiterals){var X=("/(?=[^/*])(?:[^/\\x5B\\x5C]|\\x5C[\\s\\S]|\\x5B(?:[^\\x5C\\x5D]|\\x5C[\\s\\S])*(?:\\x5D|$))+/");S.push(["lang-regex",new RegExp("^"+M+"("+X+")")])}var V=T.types;if(V){S.push([O,V])}var U=(""+T.keywords).replace(/^ | $/g,"");if(U.length){S.push([z,new RegExp("^(?:"+U.replace(/[\s,]+/g,"|")+")\\b"),null])}W.push([F,/^\s+/,null," \r\n\t\xA0"]);S.push([G,/^@[a-z_$][a-z_$@0-9]*/i,null],[O,/^(?:[@_]?[A-Z]+[a-z][A-Za-z_$@0-9]*|\w+_t\b)/,null],[F,/^[a-z_$][a-z_$@0-9]*/i,null],[G,new RegExp("^(?:0x[a-f0-9]+|(?:\\d(?:_\\d+)*\\d*(?:\\.\\d*)?|\\.\\d\\+)(?:e[+\\-]?\\d+)?)[a-z]*","i"),null,"0123456789"],[F,/^\\[\s\S]?/,null],[L,/^.[^\s\w\.$@\'\"\`\/\#\\]*/,null]);return g(W,S)}var K=i({keywords:A,hashComments:true,cStyleComments:true,multiLineStrings:true,regexLiterals:true});function Q(V,ag){var U=/(?:^|\s)nocode(?:\s|$)/;var ab=/\r\n?|\n/;var ac=V.ownerDocument;var S;if(V.currentStyle){S=V.currentStyle.whiteSpace}else{if(window.getComputedStyle){S=ac.defaultView.getComputedStyle(V,null).getPropertyValue("white-space")}}var Z=S&&"pre"===S.substring(0,3);var af=ac.createElement("LI");while(V.firstChild){af.appendChild(V.firstChild)}var W=[af];function ae(al){switch(al.nodeType){case 1:if(U.test(al.className)){break}if("BR"===al.nodeName){ad(al);if(al.parentNode){al.parentNode.removeChild(al)}}else{for(var an=al.firstChild;an;an=an.nextSibling){ae(an)}}break;case 3:case 4:if(Z){var am=al.nodeValue;var aj=am.match(ab);if(aj){var ai=am.substring(0,aj.index);al.nodeValue=ai;var ah=am.substring(aj.index+aj[0].length);if(ah){var ak=al.parentNode;ak.insertBefore(ac.createTextNode(ah),al.nextSibling)}ad(al);if(!ai){al.parentNode.removeChild(al)}}}break}}function ad(ak){while(!ak.nextSibling){ak=ak.parentNode;if(!ak){return}}function ai(al,ar){var aq=ar?al.cloneNode(false):al;var ao=al.parentNode;if(ao){var ap=ai(ao,1);var an=al.nextSibling;ap.appendChild(aq);for(var am=an;am;am=an){an=am.nextSibling;ap.appendChild(am)}}return aq}var ah=ai(ak.nextSibling,0);for(var aj;(aj=ah.parentNode)&&aj.nodeType===1;){ah=aj}W.push(ah)}for(var Y=0;Y<W.length;++Y){ae(W[Y])}if(ag===(ag|0)){W[0].setAttribute("value",ag)}var aa=ac.createElement("OL");aa.className="linenums";var X=Math.max(0,((ag-1))|0)||0;for(var Y=0,T=W.length;Y<T;++Y){af=W[Y];af.className="L"+((Y+X)%10);if(!af.firstChild){af.appendChild(ac.createTextNode("\xA0"))}aa.appendChild(af)}V.appendChild(aa)}function D(ac){var aj=/\bMSIE\b/.test(navigator.userAgent);var am=/\n/g;var al=ac.sourceCode;var an=al.length;var V=0;var aa=ac.spans;var T=aa.length;var ah=0;var X=ac.decorations;var Y=X.length;var Z=0;X[Y]=an;var ar,aq;for(aq=ar=0;aq<Y;){if(X[aq]!==X[aq+2]){X[ar++]=X[aq++];X[ar++]=X[aq++]}else{aq+=2}}Y=ar;for(aq=ar=0;aq<Y;){var at=X[aq];var ab=X[aq+1];var W=aq+2;while(W+2<=Y&&X[W+1]===ab){W+=2}X[ar++]=at;X[ar++]=ab;aq=W}Y=X.length=ar;var ae=null;while(ah<T){var af=aa[ah];var S=aa[ah+2]||an;var ag=X[Z];var ap=X[Z+2]||an;var W=Math.min(S,ap);var ak=aa[ah+1];var U;if(ak.nodeType!==1&&(U=al.substring(V,W))){if(aj){U=U.replace(am,"\r")}ak.nodeValue=U;var ai=ak.ownerDocument;var ao=ai.createElement("SPAN");ao.className=X[Z+1];var ad=ak.parentNode;ad.replaceChild(ao,ak);ao.appendChild(ak);if(V<S){aa[ah+1]=ak=ai.createTextNode(al.substring(W,S));ad.insertBefore(ak,ao.nextSibling)}}V=W;if(V>=S){ah+=2}if(V>=ap){Z+=2}}}var t={};function c(U,V){for(var S=V.length;--S>=0;){var T=V[S];if(!t.hasOwnProperty(T)){t[T]=U}else{if(window.console){console.warn("cannot override language handler %s",T)}}}}function q(T,S){if(!(T&&t.hasOwnProperty(T))){T=/^\s*</.test(S)?"default-markup":"default-code"}return t[T]}c(K,["default-code"]);c(g([],[[F,/^[^<?]+/],[E,/^<!\w[^>]*(?:>|$)/],[j,/^<\!--[\s\S]*?(?:-\->|$)/],["lang-",/^<\?([\s\S]+?)(?:\?>|$)/],["lang-",/^<%([\s\S]+?)(?:%>|$)/],[L,/^(?:<[%?]|[%?]>)/],["lang-",/^<xmp\b[^>]*>([\s\S]+?)<\/xmp\b[^>]*>/i],["lang-js",/^<script\b[^>]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-css",/^<style\b[^>]*>([\s\S]*?)(<\/style\b[^>]*>)/i],["lang-in.tag",/^(<\/?[a-z][^<>]*>)/i]]),["default-markup","htm","html","mxml","xhtml","xml","xsl"]);c(g([[F,/^[\s]+/,null," \t\r\n"],[n,/^(?:\"[^\"]*\"?|\'[^\']*\'?)/,null,"\"'"]],[[m,/^^<\/?[a-z](?:[\w.:-]*\w)?|\/?>$/i],[P,/^(?!style[\s=]|on)[a-z](?:[\w:-]*\w)?/i],["lang-uq.val",/^=\s*([^>\'\"\s]*(?:[^>\'\"\s\/]|\/(?=\s)))/],[L,/^[=<>\/]+/],["lang-js",/^on\w+\s*=\s*\"([^\"]+)\"/i],["lang-js",/^on\w+\s*=\s*\'([^\']+)\'/i],["lang-js",/^on\w+\s*=\s*([^\"\'>\s]+)/i],["lang-css",/^style\s*=\s*\"([^\"]+)\"/i],["lang-css",/^style\s*=\s*\'([^\']+)\'/i],["lang-css",/^style\s*=\s*([^\"\'>\s]+)/i]]),["in.tag"]);c(g([],[[n,/^[\s\S]+/]]),["uq.val"]);c(i({keywords:l,hashComments:true,cStyleComments:true,types:e}),["c","cc","cpp","cxx","cyc","m"]);c(i({keywords:"null,true,false"}),["json"]);c(i({keywords:R,hashComments:true,cStyleComments:true,verbatimStrings:true,types:e}),["cs"]);c(i({keywords:x,cStyleComments:true}),["java"]);c(i({keywords:H,hashComments:true,multiLineStrings:true}),["bsh","csh","sh"]);c(i({keywords:I,hashComments:true,multiLineStrings:true,tripleQuotedStrings:true}),["cv","py"]);c(i({keywords:s,hashComments:true,multiLineStrings:true,regexLiterals:true}),["perl","pl","pm"]);c(i({keywords:f,hashComments:true,multiLineStrings:true,regexLiterals:true}),["rb"]);c(i({keywords:w,cStyleComments:true,regexLiterals:true}),["js"]);c(i({keywords:r,hashComments:3,cStyleComments:true,multilineStrings:true,tripleQuotedStrings:true,regexLiterals:true}),["coffee"]);c(g([],[[C,/^[\s\S]+/]]),["regex"]);function d(V){var U=V.langExtension;try{var S=a(V.sourceNode);var T=S.sourceCode;V.sourceCode=T;V.spans=S.spans;V.basePos=0;q(U,T)(V);D(V)}catch(W){if("console" in window){console.log(W&&W.stack?W.stack:W)}}}function y(W,V,U){var S=document.createElement("PRE");S.innerHTML=W;if(U){Q(S,U)}var T={langExtension:V,numberLines:U,sourceNode:S};d(T);return S.innerHTML}function b(ad){function Y(af){return document.getElementsByTagName(af)}var ac=[Y("pre"),Y("code"),Y("xmp")];var T=[];for(var aa=0;aa<ac.length;++aa){for(var Z=0,V=ac[aa].length;Z<V;++Z){T.push(ac[aa][Z])}}ac=null;var W=Date;if(!W.now){W={now:function(){return +(new Date)}}}var X=0;var S;var ab=/\blang(?:uage)?-([\w.]+)(?!\S)/;var ae=/\bprettyprint\b/;function U(){var ag=(window.PR_SHOULD_USE_CONTINUATION?W.now()+250:Infinity);for(;X<T.length&&W.now()<ag;X++){var aj=T[X];var ai=aj.className;if(ai.indexOf("prettyprint")>=0){var ah=ai.match(ab);var am;if(!ah&&(am=o(aj))&&"CODE"===am.tagName){ah=am.className.match(ab)}if(ah){ah=ah[1]}var al=false;for(var ak=aj.parentNode;ak;ak=ak.parentNode){if((ak.tagName==="pre"||ak.tagName==="code"||ak.tagName==="xmp")&&ak.className&&ak.className.indexOf("prettyprint")>=0){al=true;break}}if(!al){var af=aj.className.match(/\blinenums\b(?::(\d+))?/);af=af?af[1]&&af[1].length?+af[1]:true:false;if(af){Q(aj,af)}S={langExtension:ah,sourceNode:aj,numberLines:af};d(S)}}}if(X<T.length){setTimeout(U,250)}else{if(ad){ad()}}}U()}window.prettyPrintOne=y;window.prettyPrint=b;window.PR={createSimpleLexer:g,registerLangHandler:c,sourceDecorator:i,PR_ATTRIB_NAME:P,PR_ATTRIB_VALUE:n,PR_COMMENT:j,PR_DECLARATION:E,PR_KEYWORD:z,PR_LITERAL:G,PR_NOCODE:N,PR_PLAIN:F,PR_PUNCTUATION:L,PR_SOURCE:J,PR_STRING:C,PR_TAG:m,PR_TYPE:O}})();PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_DECLARATION,/^<!\w[^>]*(?:>|$)/],[PR.PR_COMMENT,/^<\!--[\s\S]*?(?:-\->|$)/],[PR.PR_PUNCTUATION,/^(?:<[%?]|[%?]>)/],["lang-",/^<\?([\s\S]+?)(?:\?>|$)/],["lang-",/^<%([\s\S]+?)(?:%>|$)/],["lang-",/^<xmp\b[^>]*>([\s\S]+?)<\/xmp\b[^>]*>/i],["lang-handlebars",/^<script\b[^>]*type\s*=\s*['"]?text\/x-handlebars-template['"]?\b[^>]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-js",/^<script\b[^>]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-css",/^<style\b[^>]*>([\s\S]*?)(<\/style\b[^>]*>)/i],["lang-in.tag",/^(<\/?[a-z][^<>]*>)/i],[PR.PR_DECLARATION,/^{{[#^>/]?\s*[\w.][^}]*}}/],[PR.PR_DECLARATION,/^{{&?\s*[\w.][^}]*}}/],[PR.PR_DECLARATION,/^{{{>?\s*[\w.][^}]*}}}/],[PR.PR_COMMENT,/^{{![^}]*}}/]]),["handlebars","hbs"]);PR.registerLangHandler(PR.createSimpleLexer([[PR.PR_PLAIN,/^[ \t\r\n\f]+/,null," \t\r\n\f"]],[[PR.PR_STRING,/^\"(?:[^\n\r\f\\\"]|\\(?:\r\n?|\n|\f)|\\[\s\S])*\"/,null],[PR.PR_STRING,/^\'(?:[^\n\r\f\\\']|\\(?:\r\n?|\n|\f)|\\[\s\S])*\'/,null],["lang-css-str",/^url\(([^\)\"\']*)\)/i],[PR.PR_KEYWORD,/^(?:url|rgb|\!important|@import|@page|@media|@charset|inherit)(?=[^\-\w]|$)/i,null],["lang-css-kw",/^(-?(?:[_a-z]|(?:\\[0-9a-f]+ ?))(?:[_a-z0-9\-]|\\(?:\\[0-9a-f]+ ?))*)\s*:/i],[PR.PR_COMMENT,/^\/\*[^*]*\*+(?:[^\/*][^*]*\*+)*\//],[PR.PR_COMMENT,/^(?:<!--|-->)/],[PR.PR_LITERAL,/^(?:\d+|\d*\.\d+)(?:%|[a-z]+)?/i],[PR.PR_LITERAL,/^#(?:[0-9a-f]{3}){1,2}/i],[PR.PR_PLAIN,/^-?(?:[_a-z]|(?:\\[\da-f]+ ?))(?:[_a-z\d\-]|\\(?:\\[\da-f]+ ?))*/i],[PR.PR_PUNCTUATION,/^[^\s\w\'\"]+/]]),["css"]);PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_KEYWORD,/^-?(?:[_a-z]|(?:\\[\da-f]+ ?))(?:[_a-z\d\-]|\\(?:\\[\da-f]+ ?))*/i]]),["css-kw"]);PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_STRING,/^[^\)\"\']+/]]),["css-str"]);
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/index.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/index.html
new file mode 100644
index 0000000..7c99c88
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/index.html
@@ -0,0 +1,97 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../prettify.css" />
+    <link rel="stylesheet" href="../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../index.html">All files</a> seedrandom
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>96/100</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">85.11% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>40/47</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.33% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>14/15</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96.39% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>80/83</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<div class="pad1">
+<table class="coverage-summary">
+<thead>
+<tr>
+   <th data-col="file" data-fmt="html" data-html="true" class="file">File</th>
+   <th data-col="pic" data-type="number" data-fmt="html" data-html="true" class="pic"></th>
+   <th data-col="statements" data-type="number" data-fmt="pct" class="pct">Statements</th>
+   <th data-col="statements_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="branches" data-type="number" data-fmt="pct" class="pct">Branches</th>
+   <th data-col="branches_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="functions" data-type="number" data-fmt="pct" class="pct">Functions</th>
+   <th data-col="functions_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="lines" data-type="number" data-fmt="pct" class="pct">Lines</th>
+   <th data-col="lines_raw" data-type="number" data-fmt="html" class="abs"></th>
+</tr>
+</thead>
+<tbody><tr>
+	<td class="file high" data-value="seedrandom.js"><a href="seedrandom.js.html">seedrandom.js</a></td>
+	<td data-value="96" class="pic high"><div class="chart"><div class="cover-fill" style="width: 96%;"></div><div class="cover-empty" style="width:4%;"></div></div></td>
+	<td data-value="96" class="pct high">96%</td>
+	<td data-value="100" class="abs high">96/100</td>
+	<td data-value="85.11" class="pct high">85.11%</td>
+	<td data-value="47" class="abs high">40/47</td>
+	<td data-value="93.33" class="pct high">93.33%</td>
+	<td data-value="15" class="abs high">14/15</td>
+	<td data-value="96.39" class="pct high">96.39%</td>
+	<td data-value="83" class="abs high">80/83</td>
+	</tr>
+
+</tbody>
+</table>
+</div><div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../sorter.js"></script>
+<script src="../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/alea.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/alea.js.html
new file mode 100644
index 0000000..584d7c2
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/alea.js.html
@@ -0,0 +1,411 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/alea.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> alea.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">91.94% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>57/62</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">66.67% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>16/24</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90.91% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>10/11</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94.34% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>50/53</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a>
+<a name='L105'></a><a href='#L105'>105</a>
+<a name='L106'></a><a href='#L106'>106</a>
+<a name='L107'></a><a href='#L107'>107</a>
+<a name='L108'></a><a href='#L108'>108</a>
+<a name='L109'></a><a href='#L109'>109</a>
+<a name='L110'></a><a href='#L110'>110</a>
+<a name='L111'></a><a href='#L111'>111</a>
+<a name='L112'></a><a href='#L112'>112</a>
+<a name='L113'></a><a href='#L113'>113</a>
+<a name='L114'></a><a href='#L114'>114</a>
+<a name='L115'></a><a href='#L115'>115</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">18x</span>
+<span class="cline-any cline-yes">18x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">18x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A port of an algorithm by Johannes Baagøe &lt;baagoe@baagoe.com&gt;, 2010
+// http://baagoe.com/en/RandomMusings/javascript/
+// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror
+// Original work is under MIT license -
+&nbsp;
+// Copyright (C) 2010 by Johannes Baagøe &lt;baagoe@baagoe.org&gt;
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+&nbsp;
+&nbsp;
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function Alea(seed) {
+  var me = this, mash = Mash();
+&nbsp;
+  me.next = function() {
+    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32
+    me.s0 = me.s1;
+    me.s1 = me.s2;
+    return me.s2 = t - (me.c = t | 0);
+  };
+&nbsp;
+  // Apply the seeding algorithm from Baagoe.
+  me.c = 1;
+  me.s0 = mash(' ');
+  me.s1 = mash(' ');
+  me.s2 = mash(' ');
+  me.s0 -= mash(seed);
+  if (me.s0 &lt; 0) { me.s0 += 1; }
+  me.s1 -= mash(seed);
+  <span class="missing-if-branch" title="else path not taken" >E</span>if (me.s1 &lt; 0) { me.s1 += 1; }
+  me.s2 -= mash(seed);
+  <span class="missing-if-branch" title="if path not taken" >I</span>if (me.s2 &lt; 0) { <span class="cstat-no" title="statement not covered" >me.s2 += 1; </span>}
+  mash = null;
+}
+&nbsp;
+function copy(f, t) {
+  t.c = f.c;
+  t.s0 = f.s0;
+  t.s1 = f.s1;
+  t.s2 = f.s2;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  var xg = new Alea(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = xg.next;
+  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }
+  prng.double = function() {
+    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53
+  };
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+function Mash() {
+  var n = 0xefc8249d;
+&nbsp;
+  var mash = function(data) {
+    data = String(data);
+    for (var i = 0; i &lt; data.length; i++) {
+      n += data.charCodeAt(i);
+      var h = 0.02519603282416938 * n;
+      n = h &gt;&gt;&gt; 0;
+      h -= n;
+      h *= n;
+      n = h &gt;&gt;&gt; 0;
+      h -= n;
+      n += h * 0x100000000; // 2^32
+    }
+    return (n &gt;&gt;&gt; 0) * 2.3283064365386963e-10; // 2^-32
+  };
+&nbsp;
+  return mash;
+}
+&nbsp;
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.alea = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/index.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/index.html
new file mode 100644
index 0000000..4986a5b
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/index.html
@@ -0,0 +1,162 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> seedrandom/lib
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.45% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>343/371</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">69.39% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>102/147</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">89.66% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>52/58</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.93% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>294/313</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<div class="pad1">
+<table class="coverage-summary">
+<thead>
+<tr>
+   <th data-col="file" data-fmt="html" data-html="true" class="file">File</th>
+   <th data-col="pic" data-type="number" data-fmt="html" data-html="true" class="pic"></th>
+   <th data-col="statements" data-type="number" data-fmt="pct" class="pct">Statements</th>
+   <th data-col="statements_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="branches" data-type="number" data-fmt="pct" class="pct">Branches</th>
+   <th data-col="branches_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="functions" data-type="number" data-fmt="pct" class="pct">Functions</th>
+   <th data-col="functions_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="lines" data-type="number" data-fmt="pct" class="pct">Lines</th>
+   <th data-col="lines_raw" data-type="number" data-fmt="html" class="abs"></th>
+</tr>
+</thead>
+<tbody><tr>
+	<td class="file high" data-value="alea.js"><a href="alea.js.html">alea.js</a></td>
+	<td data-value="91.94" class="pic high"><div class="chart"><div class="cover-fill" style="width: 91%;"></div><div class="cover-empty" style="width:9%;"></div></div></td>
+	<td data-value="91.94" class="pct high">91.94%</td>
+	<td data-value="62" class="abs high">57/62</td>
+	<td data-value="66.67" class="pct medium">66.67%</td>
+	<td data-value="24" class="abs medium">16/24</td>
+	<td data-value="90.91" class="pct high">90.91%</td>
+	<td data-value="11" class="abs high">10/11</td>
+	<td data-value="94.34" class="pct high">94.34%</td>
+	<td data-value="53" class="abs high">50/53</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="tychei.js"><a href="tychei.js.html">tychei.js</a></td>
+	<td data-value="92.98" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.98" class="pct high">92.98%</td>
+	<td data-value="57" class="abs high">53/57</td>
+	<td data-value="70" class="pct medium">70%</td>
+	<td data-value="20" class="abs medium">14/20</td>
+	<td data-value="88.89" class="pct high">88.89%</td>
+	<td data-value="9" class="abs high">8/9</td>
+	<td data-value="93.75" class="pct high">93.75%</td>
+	<td data-value="48" class="abs high">45/48</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xor128.js"><a href="xor128.js.html">xor128.js</a></td>
+	<td data-value="91.84" class="pic high"><div class="chart"><div class="cover-fill" style="width: 91%;"></div><div class="cover-empty" style="width:9%;"></div></div></td>
+	<td data-value="91.84" class="pct high">91.84%</td>
+	<td data-value="49" class="abs high">45/49</td>
+	<td data-value="70" class="pct medium">70%</td>
+	<td data-value="20" class="abs medium">14/20</td>
+	<td data-value="88.89" class="pct high">88.89%</td>
+	<td data-value="9" class="abs high">8/9</td>
+	<td data-value="93.02" class="pct high">93.02%</td>
+	<td data-value="43" class="abs high">40/43</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xor4096.js"><a href="xor4096.js.html">xor4096.js</a></td>
+	<td data-value="92.68" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.68" class="pct high">92.68%</td>
+	<td data-value="82" class="abs high">76/82</td>
+	<td data-value="65.71" class="pct medium">65.71%</td>
+	<td data-value="35" class="abs medium">23/35</td>
+	<td data-value="90" class="pct high">90%</td>
+	<td data-value="10" class="abs high">9/10</td>
+	<td data-value="94.52" class="pct high">94.52%</td>
+	<td data-value="73" class="abs high">69/73</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xorshift7.js"><a href="xorshift7.js.html">xorshift7.js</a></td>
+	<td data-value="92.42" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.42" class="pct high">92.42%</td>
+	<td data-value="66" class="abs high">61/66</td>
+	<td data-value="73.08" class="pct medium">73.08%</td>
+	<td data-value="26" class="abs medium">19/26</td>
+	<td data-value="90" class="pct high">90%</td>
+	<td data-value="10" class="abs high">9/10</td>
+	<td data-value="94" class="pct high">94%</td>
+	<td data-value="50" class="abs high">47/50</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xorwow.js"><a href="xorwow.js.html">xorwow.js</a></td>
+	<td data-value="92.73" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.73" class="pct high">92.73%</td>
+	<td data-value="55" class="abs high">51/55</td>
+	<td data-value="72.73" class="pct medium">72.73%</td>
+	<td data-value="22" class="abs medium">16/22</td>
+	<td data-value="88.89" class="pct high">88.89%</td>
+	<td data-value="9" class="abs high">8/9</td>
+	<td data-value="93.48" class="pct high">93.48%</td>
+	<td data-value="46" class="abs high">43/46</td>
+	</tr>
+
+</tbody>
+</table>
+</div><div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/tychei.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/tychei.js.html
new file mode 100644
index 0000000..29c3483
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/tychei.js.html
@@ -0,0 +1,378 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/tychei.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> tychei.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.98% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>53/57</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">70% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>14/20</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">88.89% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>8/9</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.75% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>45/48</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">66x</span>
+<span class="cline-any cline-yes">66x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "Tyche-i" prng algorithm by
+// Samuel Neves and Filipe Araujo.
+// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this, strseed = '';
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var b = me.b, c = me.c, d = me.d, a = me.a;
+    b = (b &lt;&lt; 25) ^ (b &gt;&gt;&gt; 7) ^ c;
+    c = (c - d) | 0;
+    d = (d &lt;&lt; 24) ^ (d &gt;&gt;&gt; 8) ^ a;
+    a = (a - b) | 0;
+    me.b = b = (b &lt;&lt; 20) ^ (b &gt;&gt;&gt; 12) ^ c;
+    me.c = c = (c - d) | 0;
+    me.d = (d &lt;&lt; 16) ^ (c &gt;&gt;&gt; 16) ^ a;
+    return me.a = (a - b) | 0;
+  };
+&nbsp;
+  /* The following is non-inverted tyche, which has better internal
+   * bit diffusion, but which is about 25% slower than tyche-i in JS.
+  me.next = function() {
+    var a = me.a, b = me.b, c = me.c, d = me.d;
+    a = (me.a + me.b | 0) &gt;&gt;&gt; 0;
+    d = me.d ^ a; d = d &lt;&lt; 16 ^ d &gt;&gt;&gt; 16;
+    c = me.c + d | 0;
+    b = me.b ^ c; b = b &lt;&lt; 12 ^ d &gt;&gt;&gt; 20;
+    me.a = a = a + b | 0;
+    d = d ^ a; me.d = d = d &lt;&lt; 8 ^ d &gt;&gt;&gt; 24;
+    me.c = c = c + d | 0;
+    b = b ^ c;
+    return me.b = (b &lt;&lt; 7 ^ b &gt;&gt;&gt; 25);
+  }
+  */
+&nbsp;
+  me.a = 0;
+  me.b = 0;
+  me.c = 2654435769 | 0;
+  me.d = 1367130551;
+&nbsp;
+  if (seed === Math.floor(seed)) {
+    // Integer seed.
+    me.a = (seed / 0x100000000) | 0;
+    me.b = seed | 0;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+&nbsp;
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k &lt; strseed.length + 20; k++) {
+    me.b ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+&nbsp;
+function copy(f, t) {
+  t.a = f.a;
+  t.b = f.b;
+  t.c = f.c;
+  t.d = f.d;
+  return t;
+};
+&nbsp;
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.tychei = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor128.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor128.js.html
new file mode 100644
index 0000000..77ec76f
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor128.js.html
@@ -0,0 +1,312 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xor128.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xor128.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">91.84% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>45/49</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">70% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>14/20</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">88.89% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>8/9</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.02% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>40/43</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "xor128" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this, strseed = '';
+&nbsp;
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var t = me.x ^ (me.x &lt;&lt; 11);
+    me.x = me.y;
+    me.y = me.z;
+    me.z = me.w;
+    return me.w ^= (me.w &gt;&gt;&gt; 19) ^ t ^ (t &gt;&gt;&gt; 8);
+  };
+&nbsp;
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+&nbsp;
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k &lt; strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+&nbsp;
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xor128 = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor4096.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor4096.js.html
new file mode 100644
index 0000000..a9b085b
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor4096.js.html
@@ -0,0 +1,507 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xor4096.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xor4096.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.68% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>76/82</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">65.71% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>23/35</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>9/10</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94.52% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>69/73</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a>
+<a name='L105'></a><a href='#L105'>105</a>
+<a name='L106'></a><a href='#L106'>106</a>
+<a name='L107'></a><a href='#L107'>107</a>
+<a name='L108'></a><a href='#L108'>108</a>
+<a name='L109'></a><a href='#L109'>109</a>
+<a name='L110'></a><a href='#L110'>110</a>
+<a name='L111'></a><a href='#L111'>111</a>
+<a name='L112'></a><a href='#L112'>112</a>
+<a name='L113'></a><a href='#L113'>113</a>
+<a name='L114'></a><a href='#L114'>114</a>
+<a name='L115'></a><a href='#L115'>115</a>
+<a name='L116'></a><a href='#L116'>116</a>
+<a name='L117'></a><a href='#L117'>117</a>
+<a name='L118'></a><a href='#L118'>118</a>
+<a name='L119'></a><a href='#L119'>119</a>
+<a name='L120'></a><a href='#L120'>120</a>
+<a name='L121'></a><a href='#L121'>121</a>
+<a name='L122'></a><a href='#L122'>122</a>
+<a name='L123'></a><a href='#L123'>123</a>
+<a name='L124'></a><a href='#L124'>124</a>
+<a name='L125'></a><a href='#L125'>125</a>
+<a name='L126'></a><a href='#L126'>126</a>
+<a name='L127'></a><a href='#L127'>127</a>
+<a name='L128'></a><a href='#L128'>128</a>
+<a name='L129'></a><a href='#L129'>129</a>
+<a name='L130'></a><a href='#L130'>130</a>
+<a name='L131'></a><a href='#L131'>131</a>
+<a name='L132'></a><a href='#L132'>132</a>
+<a name='L133'></a><a href='#L133'>133</a>
+<a name='L134'></a><a href='#L134'>134</a>
+<a name='L135'></a><a href='#L135'>135</a>
+<a name='L136'></a><a href='#L136'>136</a>
+<a name='L137'></a><a href='#L137'>137</a>
+<a name='L138'></a><a href='#L138'>138</a>
+<a name='L139'></a><a href='#L139'>139</a>
+<a name='L140'></a><a href='#L140'>140</a>
+<a name='L141'></a><a href='#L141'>141</a>
+<a name='L142'></a><a href='#L142'>142</a>
+<a name='L143'></a><a href='#L143'>143</a>
+<a name='L144'></a><a href='#L144'>144</a>
+<a name='L145'></a><a href='#L145'>145</a>
+<a name='L146'></a><a href='#L146'>146</a>
+<a name='L147'></a><a href='#L147'>147</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">384x</span>
+<span class="cline-any cline-yes">384x</span>
+<span class="cline-any cline-yes">384x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.
+//
+// This fast non-cryptographic random number generator is designed for
+// use in Monte-Carlo algorithms. It combines a long-period xorshift
+// generator with a Weyl generator, and it passes all common batteries
+// of stasticial tests for randomness while consuming only a few nanoseconds
+// for each prng generated.  For background on the generator, see Brent's
+// paper: "Some long-period random number generators using shifts and xors."
+// http://arxiv.org/pdf/1004.3115v1.pdf
+//
+// Usage:
+//
+// var xor4096 = require('xor4096');
+// random = xor4096(1);                        // Seed with int32 or string.
+// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.
+// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.
+//
+// For nonzero numeric keys, this impelementation provides a sequence
+// identical to that by Brent's xorgens 3 implementaion in C.  This
+// implementation also provides for initalizing the generator with
+// string seeds, or for saving and restoring the state of the generator.
+//
+// On Chrome, this prng benchmarks about 2.1 times slower than
+// Javascript's built-in Math.random().
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this;
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var w = me.w,
+        X = me.X, i = me.i, t, v;
+    // Update Weyl generator.
+    me.w = w = (w + 0x61c88647) | 0;
+    // Update xor generator.
+    v = X[(i + 34) &amp; 127];
+    t = X[i = ((i + 1) &amp; 127)];
+    v ^= v &lt;&lt; 13;
+    t ^= t &lt;&lt; 17;
+    v ^= v &gt;&gt;&gt; 15;
+    t ^= t &gt;&gt;&gt; 12;
+    // Update Xor generator array state.
+    v = X[i] = v ^ t;
+    me.i = i;
+    // Result is the combination.
+    return (v + (w ^ (w &gt;&gt;&gt; 16))) | 0;
+  };
+&nbsp;
+  function init(me, seed) {
+    var t, v, i, j, w, X = [], limit = 128;
+    if (seed === (seed | 0)) {
+      // Numeric seeds initialize v, which is used to generates X.
+      v = seed;
+      seed = null;
+    } else {
+      // String seeds are mixed into v and X one character at a time.
+      seed = seed + '\0';
+      v = 0;
+      limit = Math.max(limit, seed.length);
+    }
+    // Initialize circular array and weyl value.
+    for (i = 0, j = -32; j &lt; limit; ++j) {
+      // Put the unicode characters into the array, and shuffle them.
+      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);
+      // After 32 shuffles, take v as the starting w value.
+      if (j === 0) w = v;
+      v ^= v &lt;&lt; 10;
+      v ^= v &gt;&gt;&gt; 15;
+      v ^= v &lt;&lt; 4;
+      v ^= v &gt;&gt;&gt; 13;
+      if (j &gt;= 0) {
+        w = (w + 0x61c88647) | 0;     // Weyl.
+        t = (X[j &amp; 127] ^= (v + w));  // Combine xor and weyl to init array.
+        i = (0 == t) ? <span class="branch-0 cbranch-no" title="branch not covered" >i + 1 </span>: 0;     // Count zeroes.
+      }
+    }
+    // We have detected all zeroes; make the key nonzero.
+    <span class="missing-if-branch" title="if path not taken" >I</span>if (i &gt;= 128) {
+<span class="cstat-no" title="statement not covered" >      X[(seed &amp;&amp; seed.length || 0) &amp; 127] = -1;</span>
+    }
+    // Run the generator 512 times to further mix the state before using it.
+    // Factoring this as a function slows the main generator, so it is just
+    // unrolled here.  The weyl generator is not advanced while warming up.
+    i = 127;
+    for (j = 4 * 128; j &gt; 0; --j) {
+      v = X[(i + 34) &amp; 127];
+      t = X[i = ((i + 1) &amp; 127)];
+      v ^= v &lt;&lt; 13;
+      t ^= t &lt;&lt; 17;
+      v ^= v &gt;&gt;&gt; 15;
+      t ^= t &gt;&gt;&gt; 12;
+      X[i] = v ^ t;
+    }
+    // Storing state as object members is faster than using closure variables.
+    me.w = w;
+    me.X = X;
+    me.i = i;
+  }
+&nbsp;
+  init(me, seed);
+}
+&nbsp;
+function copy(f, t) {
+  t.i = f.i;
+  t.w = f.w;
+  t.X = f.X.slice();
+  return t;
+};
+&nbsp;
+function impl(seed, opts) {
+  <span class="missing-if-branch" title="if path not taken" >I</span>if (seed == null) <span class="cstat-no" title="statement not covered" >seed = +(new Date);</span>
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.X) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xor4096 = impl;</span>
+}
+&nbsp;
+})(
+  this,                                     // window object or global
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorshift7.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorshift7.js.html
new file mode 100644
index 0000000..e50230c
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorshift7.js.html
@@ -0,0 +1,360 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xorshift7.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xorshift7.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.42% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>61/66</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">73.08% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>19/26</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>9/10</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>47/50</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">16x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">768x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "xorshift7" algorithm by
+// François Panneton and Pierre L'ecuyer:
+// "On the Xorgshift Random Number Generators"
+// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this;
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    // Update xor generator.
+    var X = me.x, i = me.i, t, v, w;
+    t = X[i]; t ^= (t &gt;&gt;&gt; 7); v = t ^ (t &lt;&lt; 24);
+    t = X[(i + 1) &amp; 7]; v ^= t ^ (t &gt;&gt;&gt; 10);
+    t = X[(i + 3) &amp; 7]; v ^= t ^ (t &gt;&gt;&gt; 3);
+    t = X[(i + 4) &amp; 7]; v ^= t ^ (t &lt;&lt; 7);
+    t = X[(i + 7) &amp; 7]; t = t ^ (t &lt;&lt; 13); v ^= t ^ (t &lt;&lt; 9);
+    X[i] = v;
+    me.i = (i + 1) &amp; 7;
+    return v;
+  };
+&nbsp;
+  function init(me, seed) {
+    var j, w, X = [];
+&nbsp;
+    if (seed === (seed | 0)) {
+      // Seed state array using a 32-bit integer.
+      w = X[0] = seed;
+    } else {
+      // Seed state using a string.
+      seed = '' + seed;
+      for (j = 0; j &lt; seed.length; ++j) {
+        X[j &amp; 7] = (X[j &amp; 7] &lt;&lt; 15) ^
+            (seed.charCodeAt(j) + X[(j + 1) &amp; 7] &lt;&lt; 13);
+      }
+    }
+    // Enforce an array length of 8, not all zeroes.
+    while (X.length &lt; 8) X.push(0);
+    for (j = 0; j &lt; 8 &amp;&amp; X[j] === 0; ++j);
+    if (j == 8) w = X[7] = -1; else w = X[j];
+&nbsp;
+    me.x = X;
+    me.i = 0;
+&nbsp;
+    // Discard an initial 256 values.
+    for (j = 256; j &gt; 0; --j) {
+      me.next();
+    }
+  }
+&nbsp;
+  init(me, seed);
+}
+&nbsp;
+function copy(f, t) {
+  t.x = f.x.slice();
+  t.i = f.i;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  <span class="missing-if-branch" title="if path not taken" >I</span>if (seed == null) <span class="cstat-no" title="statement not covered" >seed = +(new Date);</span>
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.x) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xorshift7 = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorwow.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorwow.js.html
new file mode 100644
index 0000000..3c8d5a7
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorwow.js.html
@@ -0,0 +1,327 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xorwow.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xorwow.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.73% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>51/55</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">72.73% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>16/22</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">88.89% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>8/9</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.48% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>43/46</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "xorwow" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this, strseed = '';
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var t = (me.x ^ (me.x &gt;&gt;&gt; 2));
+    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;
+    return (me.d = (me.d + 362437 | 0)) +
+       (me.v = (me.v ^ (me.v &lt;&lt; 4)) ^ (t ^ (t &lt;&lt; 1))) | 0;
+  };
+&nbsp;
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+  me.v = 0;
+&nbsp;
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+&nbsp;
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k &lt; strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    if (k == strseed.length) {
+      me.d = me.x &lt;&lt; 10 ^ me.x &gt;&gt;&gt; 4;
+    }
+    me.next();
+  }
+}
+&nbsp;
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  t.v = f.v;
+  t.d = f.d;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xorwow = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/seedrandom.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/seedrandom.js.html
new file mode 100644
index 0000000..ca72564
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/seedrandom.js.html
@@ -0,0 +1,828 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/seedrandom.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../prettify.css" />
+    <link rel="stylesheet" href="../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../index.html">All files</a> / <a href="index.html">seedrandom</a> seedrandom.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>96/100</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">85.11% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>40/47</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.33% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>14/15</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96.39% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>80/83</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a>
+<a name='L105'></a><a href='#L105'>105</a>
+<a name='L106'></a><a href='#L106'>106</a>
+<a name='L107'></a><a href='#L107'>107</a>
+<a name='L108'></a><a href='#L108'>108</a>
+<a name='L109'></a><a href='#L109'>109</a>
+<a name='L110'></a><a href='#L110'>110</a>
+<a name='L111'></a><a href='#L111'>111</a>
+<a name='L112'></a><a href='#L112'>112</a>
+<a name='L113'></a><a href='#L113'>113</a>
+<a name='L114'></a><a href='#L114'>114</a>
+<a name='L115'></a><a href='#L115'>115</a>
+<a name='L116'></a><a href='#L116'>116</a>
+<a name='L117'></a><a href='#L117'>117</a>
+<a name='L118'></a><a href='#L118'>118</a>
+<a name='L119'></a><a href='#L119'>119</a>
+<a name='L120'></a><a href='#L120'>120</a>
+<a name='L121'></a><a href='#L121'>121</a>
+<a name='L122'></a><a href='#L122'>122</a>
+<a name='L123'></a><a href='#L123'>123</a>
+<a name='L124'></a><a href='#L124'>124</a>
+<a name='L125'></a><a href='#L125'>125</a>
+<a name='L126'></a><a href='#L126'>126</a>
+<a name='L127'></a><a href='#L127'>127</a>
+<a name='L128'></a><a href='#L128'>128</a>
+<a name='L129'></a><a href='#L129'>129</a>
+<a name='L130'></a><a href='#L130'>130</a>
+<a name='L131'></a><a href='#L131'>131</a>
+<a name='L132'></a><a href='#L132'>132</a>
+<a name='L133'></a><a href='#L133'>133</a>
+<a name='L134'></a><a href='#L134'>134</a>
+<a name='L135'></a><a href='#L135'>135</a>
+<a name='L136'></a><a href='#L136'>136</a>
+<a name='L137'></a><a href='#L137'>137</a>
+<a name='L138'></a><a href='#L138'>138</a>
+<a name='L139'></a><a href='#L139'>139</a>
+<a name='L140'></a><a href='#L140'>140</a>
+<a name='L141'></a><a href='#L141'>141</a>
+<a name='L142'></a><a href='#L142'>142</a>
+<a name='L143'></a><a href='#L143'>143</a>
+<a name='L144'></a><a href='#L144'>144</a>
+<a name='L145'></a><a href='#L145'>145</a>
+<a name='L146'></a><a href='#L146'>146</a>
+<a name='L147'></a><a href='#L147'>147</a>
+<a name='L148'></a><a href='#L148'>148</a>
+<a name='L149'></a><a href='#L149'>149</a>
+<a name='L150'></a><a href='#L150'>150</a>
+<a name='L151'></a><a href='#L151'>151</a>
+<a name='L152'></a><a href='#L152'>152</a>
+<a name='L153'></a><a href='#L153'>153</a>
+<a name='L154'></a><a href='#L154'>154</a>
+<a name='L155'></a><a href='#L155'>155</a>
+<a name='L156'></a><a href='#L156'>156</a>
+<a name='L157'></a><a href='#L157'>157</a>
+<a name='L158'></a><a href='#L158'>158</a>
+<a name='L159'></a><a href='#L159'>159</a>
+<a name='L160'></a><a href='#L160'>160</a>
+<a name='L161'></a><a href='#L161'>161</a>
+<a name='L162'></a><a href='#L162'>162</a>
+<a name='L163'></a><a href='#L163'>163</a>
+<a name='L164'></a><a href='#L164'>164</a>
+<a name='L165'></a><a href='#L165'>165</a>
+<a name='L166'></a><a href='#L166'>166</a>
+<a name='L167'></a><a href='#L167'>167</a>
+<a name='L168'></a><a href='#L168'>168</a>
+<a name='L169'></a><a href='#L169'>169</a>
+<a name='L170'></a><a href='#L170'>170</a>
+<a name='L171'></a><a href='#L171'>171</a>
+<a name='L172'></a><a href='#L172'>172</a>
+<a name='L173'></a><a href='#L173'>173</a>
+<a name='L174'></a><a href='#L174'>174</a>
+<a name='L175'></a><a href='#L175'>175</a>
+<a name='L176'></a><a href='#L176'>176</a>
+<a name='L177'></a><a href='#L177'>177</a>
+<a name='L178'></a><a href='#L178'>178</a>
+<a name='L179'></a><a href='#L179'>179</a>
+<a name='L180'></a><a href='#L180'>180</a>
+<a name='L181'></a><a href='#L181'>181</a>
+<a name='L182'></a><a href='#L182'>182</a>
+<a name='L183'></a><a href='#L183'>183</a>
+<a name='L184'></a><a href='#L184'>184</a>
+<a name='L185'></a><a href='#L185'>185</a>
+<a name='L186'></a><a href='#L186'>186</a>
+<a name='L187'></a><a href='#L187'>187</a>
+<a name='L188'></a><a href='#L188'>188</a>
+<a name='L189'></a><a href='#L189'>189</a>
+<a name='L190'></a><a href='#L190'>190</a>
+<a name='L191'></a><a href='#L191'>191</a>
+<a name='L192'></a><a href='#L192'>192</a>
+<a name='L193'></a><a href='#L193'>193</a>
+<a name='L194'></a><a href='#L194'>194</a>
+<a name='L195'></a><a href='#L195'>195</a>
+<a name='L196'></a><a href='#L196'>196</a>
+<a name='L197'></a><a href='#L197'>197</a>
+<a name='L198'></a><a href='#L198'>198</a>
+<a name='L199'></a><a href='#L199'>199</a>
+<a name='L200'></a><a href='#L200'>200</a>
+<a name='L201'></a><a href='#L201'>201</a>
+<a name='L202'></a><a href='#L202'>202</a>
+<a name='L203'></a><a href='#L203'>203</a>
+<a name='L204'></a><a href='#L204'>204</a>
+<a name='L205'></a><a href='#L205'>205</a>
+<a name='L206'></a><a href='#L206'>206</a>
+<a name='L207'></a><a href='#L207'>207</a>
+<a name='L208'></a><a href='#L208'>208</a>
+<a name='L209'></a><a href='#L209'>209</a>
+<a name='L210'></a><a href='#L210'>210</a>
+<a name='L211'></a><a href='#L211'>211</a>
+<a name='L212'></a><a href='#L212'>212</a>
+<a name='L213'></a><a href='#L213'>213</a>
+<a name='L214'></a><a href='#L214'>214</a>
+<a name='L215'></a><a href='#L215'>215</a>
+<a name='L216'></a><a href='#L216'>216</a>
+<a name='L217'></a><a href='#L217'>217</a>
+<a name='L218'></a><a href='#L218'>218</a>
+<a name='L219'></a><a href='#L219'>219</a>
+<a name='L220'></a><a href='#L220'>220</a>
+<a name='L221'></a><a href='#L221'>221</a>
+<a name='L222'></a><a href='#L222'>222</a>
+<a name='L223'></a><a href='#L223'>223</a>
+<a name='L224'></a><a href='#L224'>224</a>
+<a name='L225'></a><a href='#L225'>225</a>
+<a name='L226'></a><a href='#L226'>226</a>
+<a name='L227'></a><a href='#L227'>227</a>
+<a name='L228'></a><a href='#L228'>228</a>
+<a name='L229'></a><a href='#L229'>229</a>
+<a name='L230'></a><a href='#L230'>230</a>
+<a name='L231'></a><a href='#L231'>231</a>
+<a name='L232'></a><a href='#L232'>232</a>
+<a name='L233'></a><a href='#L233'>233</a>
+<a name='L234'></a><a href='#L234'>234</a>
+<a name='L235'></a><a href='#L235'>235</a>
+<a name='L236'></a><a href='#L236'>236</a>
+<a name='L237'></a><a href='#L237'>237</a>
+<a name='L238'></a><a href='#L238'>238</a>
+<a name='L239'></a><a href='#L239'>239</a>
+<a name='L240'></a><a href='#L240'>240</a>
+<a name='L241'></a><a href='#L241'>241</a>
+<a name='L242'></a><a href='#L242'>242</a>
+<a name='L243'></a><a href='#L243'>243</a>
+<a name='L244'></a><a href='#L244'>244</a>
+<a name='L245'></a><a href='#L245'>245</a>
+<a name='L246'></a><a href='#L246'>246</a>
+<a name='L247'></a><a href='#L247'>247</a>
+<a name='L248'></a><a href='#L248'>248</a>
+<a name='L249'></a><a href='#L249'>249</a>
+<a name='L250'></a><a href='#L250'>250</a>
+<a name='L251'></a><a href='#L251'>251</a>
+<a name='L252'></a><a href='#L252'>252</a>
+<a name='L253'></a><a href='#L253'>253</a>
+<a name='L254'></a><a href='#L254'>254</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3917x</span>
+<span class="cline-any cline-yes">3917x</span>
+<span class="cline-any cline-yes">3917x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">9249x</span>
+<span class="cline-any cline-yes">9249x</span>
+<span class="cline-any cline-yes">9249x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">4100001x</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">20x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">20x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">19x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">5888x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">5888x</span>
+<span class="cline-any cline-yes">5888x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">16436073x</span>
+<span class="cline-any cline-yes">16436073x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">32x</span>
+<span class="cline-any cline-yes">32x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">9x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">32x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">52x</span>
+<span class="cline-any cline-yes">52x</span>
+<span class="cline-any cline-yes">7735x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">52x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">81x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">/*
+Copyright 2019 David Bau.
+&nbsp;
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+&nbsp;
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+&nbsp;
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+&nbsp;
+*/
+&nbsp;
+(function (global, pool, math) {
+//
+// The following constants are related to IEEE 754 limits.
+//
+&nbsp;
+var width = 256,        // each RC4 output is 0 &lt;= x &lt; 256
+    chunks = 6,         // at least six RC4 outputs for each double
+    digits = 52,        // there are 52 significant digits in a double
+    rngname = 'random', // rngname: name for Math.random and Math.seedrandom
+    startdenom = math.pow(width, chunks),
+    significance = math.pow(2, digits),
+    overflow = significance * 2,
+    mask = width - 1,
+    nodecrypto;         // node.js crypto module, initialized at the bottom.
+&nbsp;
+//
+// seedrandom()
+// This is the seedrandom function described above.
+//
+function seedrandom(seed, options, callback) {
+  var key = [];
+  options = (options == true) ? { entropy: true } : (options || {});
+&nbsp;
+  // Flatten the seed string or build one from local entropy if needed.
+  var shortseed = mixkey(flatten(
+    options.entropy ? [seed, tostring(pool)] :
+    (seed == null) ? autoseed() : seed, 3), key);
+&nbsp;
+  // Use the seed to initialize an ARC4 generator.
+  var arc4 = new ARC4(key);
+&nbsp;
+  // This function returns a random double in [0, 1) that contains
+  // randomness in every bit of the mantissa of the IEEE 754 value.
+  var prng = function() {
+    var n = arc4.g(chunks),             // Start with a numerator n &lt; 2 ^ 48
+        d = startdenom,                 //   and denominator d = 2 ^ 48.
+        x = 0;                          //   and no 'extra last byte'.
+    while (n &lt; significance) {          // Fill up all significant digits by
+      n = (n + x) * width;              //   shifting numerator and
+      d *= width;                       //   denominator and generating a
+      x = arc4.g(1);                    //   new least-significant-byte.
+    }
+    while (n &gt;= overflow) {             // To avoid rounding up, before adding
+      n /= 2;                           //   last byte, shift everything
+      d /= 2;                           //   right using integer math until
+      x &gt;&gt;&gt;= 1;                         //   we have exactly the desired bits.
+    }
+    return (n + x) / d;                 // Form the number within [0, 1).
+  };
+&nbsp;
+  prng.int32 = function() { return arc4.g(4) | 0; }
+  prng.quick = function() { return arc4.g(4) / 0x100000000; }
+  prng.double = prng;
+&nbsp;
+  // Mix the randomness into accumulated entropy.
+  mixkey(tostring(arc4.S), pool);
+&nbsp;
+  // Calling convention: what to return as a function of prng, seed, is_math.
+  return (options.pass || callback ||
+      function(prng, seed, is_math_call, state) {
+        if (state) {
+          // Load the arc4 state from the given state if it has an S array.
+          if (state.S) { copy(state, arc4); }
+          // Only provide the .state method if requested via options.state.
+          prng.state = function() { return copy(arc4, {}); }
+        }
+&nbsp;
+        // If called as a method of Math (Math.seedrandom()), mutate
+        // Math.random because that is how seedrandom.js has worked since v1.0.
+        if (is_math_call) { math[rngname] = prng; return seed; }
+&nbsp;
+        // Otherwise, it is a newer calling convention, so return the
+        // prng directly.
+        else return prng;
+      })(
+  prng,
+  shortseed,
+  'global' in options ? options.global : (this == math),
+  options.state);
+}
+&nbsp;
+//
+// ARC4
+//
+// An ARC4 implementation.  The constructor takes a key in the form of
+// an array of at most (width) integers that should be 0 &lt;= x &lt; (width).
+//
+// The g(count) method returns a pseudorandom integer that concatenates
+// the next (count) outputs from ARC4.  Its return value is a number x
+// that is in the range 0 &lt;= x &lt; (width ^ count).
+//
+function ARC4(key) {
+  var t, keylen = key.length,
+      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];
+&nbsp;
+  // The empty key [] is treated as [0].
+  if (!keylen) { key = [keylen++]; }
+&nbsp;
+  // Set up S using the standard key scheduling algorithm.
+  while (i &lt; width) {
+    s[i] = i++;
+  }
+  for (i = 0; i &lt; width; i++) {
+    s[i] = s[j = mask &amp; (j + key[i % keylen] + (t = s[i]))];
+    s[j] = t;
+  }
+&nbsp;
+  // The "g" method returns the next (count) outputs as one number.
+  (me.g = function(count) {
+    // Using instance members instead of closure state nearly doubles speed.
+    var t, r = 0,
+        i = me.i, j = me.j, s = me.S;
+    while (count--) {
+      t = s[i = mask &amp; (i + 1)];
+      r = r * width + s[mask &amp; ((s[i] = s[j = mask &amp; (j + t)]) + (s[j] = t))];
+    }
+    me.i = i; me.j = j;
+    return r;
+    // For robust unpredictability, the function call below automatically
+    // discards an initial batch of values.  This is called RC4-drop[256].
+    // See http://google.com/search?q=rsa+fluhrer+response&amp;btnI
+  })(width);
+}
+&nbsp;
+//
+// copy()
+// Copies internal state of ARC4 to or from a plain object.
+//
+function copy(f, t) {
+  t.i = f.i;
+  t.j = f.j;
+  t.S = f.S.slice();
+  return t;
+};
+&nbsp;
+//
+// flatten()
+// Converts an object tree to nested arrays of strings.
+//
+function flatten(obj, depth) {
+  var result = [], typ = (typeof obj), prop;
+  if (depth &amp;&amp; typ == 'object') {
+    for (prop in obj) {
+      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
+    }
+  }
+  return (result.length ? result : typ == 'string' ? obj : obj + '\0');
+}
+&nbsp;
+//
+// mixkey()
+// Mixes a string seed into a key that is an array of integers, and
+// returns a shortened string seed that is equivalent to the result key.
+//
+function mixkey(seed, key) {
+  var stringseed = seed + '', smear, j = 0;
+  while (j &lt; stringseed.length) {
+    key[mask &amp; j] =
+      mask &amp; ((smear ^= key[mask &amp; j] * 19) + stringseed.charCodeAt(j++));
+  }
+  return tostring(key);
+}
+&nbsp;
+//
+// autoseed()
+// Returns an object for autoseeding, using window.crypto and Node crypto
+// module if available.
+//
+function autoseed() {
+  try {
+    var out;
+    if (nodecrypto &amp;&amp; (out = nodecrypto.randomBytes)) {
+      // The use of 'out' to remember randomBytes makes tight minified code.
+      out = out(width);
+    } else {
+      out = new Uint8Array(width);
+      (global.crypto || global.msCrypto).getRandomValues(out);
+    }
+    return tostring(out);
+  } catch (e) {
+    var browser = global.navigator,
+        plugins = browser &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >browser.plugins;</span>
+    return [+new Date, global, plugins, global.screen, tostring(pool)];
+  }
+}
+&nbsp;
+//
+// tostring()
+// Converts an array of charcodes to a string
+//
+function tostring(a) {
+  return String.fromCharCode.apply(0, a);
+}
+&nbsp;
+//
+// When seedrandom.js is loaded, we immediately mix a few bits
+// from the built-in RNG into the entropy pool.  Because we do
+// not want to interfere with deterministic PRNG state later,
+// seedrandom will not call math.random on its own again after
+// initialization.
+//
+mixkey(math.random(), pool);
+&nbsp;
+//
+// Nodejs and AMD support: export the implementation as a module using
+// either convention.
+//
+<span class="missing-if-branch" title="else path not taken" >E</span>if ((typeof module) == 'object' &amp;&amp; module.exports) {
+  module.exports = seedrandom;
+  // When in node.js, try using crypto package for autoseeding.
+  try {
+    nodecrypto = require('crypto');
+  } catch (ex) {}
+} else <span class="cstat-no" title="statement not covered" >if ((typeof define) == 'function' &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return seedrandom; </span>});</span>
+} else {
+  // When included as a plain script, set up Math.seedrandom global.
+<span class="cstat-no" title="statement not covered" >  math['seed' + rngname] = seedrandom;</span>
+}
+&nbsp;
+&nbsp;
+// End anonymous scope, and pass initial values.
+})(
+  // global: `self` in browsers (including strict mode and web workers),
+  // otherwise `this` in Node and other environments
+  (typeof self !== 'undefined') ? <span class="branch-0 cbranch-no" title="branch not covered" >self </span>: this,
+  [],     // pool: entropy pool starts empty
+  Math    // math: package containing random, pow, and seedrandom
+);
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../sorter.js"></script>
+<script src="../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/sort-arrow-sprite.png b/node_modules/seedrandom/coverage/lcov-report/sort-arrow-sprite.png
new file mode 100644
index 0000000..03f704a
Binary files /dev/null and b/node_modules/seedrandom/coverage/lcov-report/sort-arrow-sprite.png differ
diff --git a/node_modules/seedrandom/coverage/lcov-report/sorter.js b/node_modules/seedrandom/coverage/lcov-report/sorter.js
new file mode 100644
index 0000000..16de10c
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/sorter.js
@@ -0,0 +1,170 @@
+/* eslint-disable */
+var addSorting = (function() {
+    'use strict';
+    var cols,
+        currentSort = {
+            index: 0,
+            desc: false
+        };
+
+    // returns the summary table element
+    function getTable() {
+        return document.querySelector('.coverage-summary');
+    }
+    // returns the thead element of the summary table
+    function getTableHeader() {
+        return getTable().querySelector('thead tr');
+    }
+    // returns the tbody element of the summary table
+    function getTableBody() {
+        return getTable().querySelector('tbody');
+    }
+    // returns the th element for nth column
+    function getNthColumn(n) {
+        return getTableHeader().querySelectorAll('th')[n];
+    }
+
+    // loads all columns
+    function loadColumns() {
+        var colNodes = getTableHeader().querySelectorAll('th'),
+            colNode,
+            cols = [],
+            col,
+            i;
+
+        for (i = 0; i < colNodes.length; i += 1) {
+            colNode = colNodes[i];
+            col = {
+                key: colNode.getAttribute('data-col'),
+                sortable: !colNode.getAttribute('data-nosort'),
+                type: colNode.getAttribute('data-type') || 'string'
+            };
+            cols.push(col);
+            if (col.sortable) {
+                col.defaultDescSort = col.type === 'number';
+                colNode.innerHTML =
+                    colNode.innerHTML + '<span class="sorter"></span>';
+            }
+        }
+        return cols;
+    }
+    // attaches a data attribute to every tr element with an object
+    // of data values keyed by column name
+    function loadRowData(tableRow) {
+        var tableCols = tableRow.querySelectorAll('td'),
+            colNode,
+            col,
+            data = {},
+            i,
+            val;
+        for (i = 0; i < tableCols.length; i += 1) {
+            colNode = tableCols[i];
+            col = cols[i];
+            val = colNode.getAttribute('data-value');
+            if (col.type === 'number') {
+                val = Number(val);
+            }
+            data[col.key] = val;
+        }
+        return data;
+    }
+    // loads all row data
+    function loadData() {
+        var rows = getTableBody().querySelectorAll('tr'),
+            i;
+
+        for (i = 0; i < rows.length; i += 1) {
+            rows[i].data = loadRowData(rows[i]);
+        }
+    }
+    // sorts the table using the data for the ith column
+    function sortByIndex(index, desc) {
+        var key = cols[index].key,
+            sorter = function(a, b) {
+                a = a.data[key];
+                b = b.data[key];
+                return a < b ? -1 : a > b ? 1 : 0;
+            },
+            finalSorter = sorter,
+            tableBody = document.querySelector('.coverage-summary tbody'),
+            rowNodes = tableBody.querySelectorAll('tr'),
+            rows = [],
+            i;
+
+        if (desc) {
+            finalSorter = function(a, b) {
+                return -1 * sorter(a, b);
+            };
+        }
+
+        for (i = 0; i < rowNodes.length; i += 1) {
+            rows.push(rowNodes[i]);
+            tableBody.removeChild(rowNodes[i]);
+        }
+
+        rows.sort(finalSorter);
+
+        for (i = 0; i < rows.length; i += 1) {
+            tableBody.appendChild(rows[i]);
+        }
+    }
+    // removes sort indicators for current column being sorted
+    function removeSortIndicators() {
+        var col = getNthColumn(currentSort.index),
+            cls = col.className;
+
+        cls = cls.replace(/ sorted$/, '').replace(/ sorted-desc$/, '');
+        col.className = cls;
+    }
+    // adds sort indicators for current column being sorted
+    function addSortIndicators() {
+        getNthColumn(currentSort.index).className += currentSort.desc
+            ? ' sorted-desc'
+            : ' sorted';
+    }
+    // adds event listeners for all sorter widgets
+    function enableUI() {
+        var i,
+            el,
+            ithSorter = function ithSorter(i) {
+                var col = cols[i];
+
+                return function() {
+                    var desc = col.defaultDescSort;
+
+                    if (currentSort.index === i) {
+                        desc = !currentSort.desc;
+                    }
+                    sortByIndex(i, desc);
+                    removeSortIndicators();
+                    currentSort.index = i;
+                    currentSort.desc = desc;
+                    addSortIndicators();
+                };
+            };
+        for (i = 0; i < cols.length; i += 1) {
+            if (cols[i].sortable) {
+                // add the click event handler on the th so users
+                // dont have to click on those tiny arrows
+                el = getNthColumn(i).querySelector('.sorter').parentElement;
+                if (el.addEventListener) {
+                    el.addEventListener('click', ithSorter(i));
+                } else {
+                    el.attachEvent('onclick', ithSorter(i));
+                }
+            }
+        }
+    }
+    // adds sorting functionality to the UI
+    return function() {
+        if (!getTable()) {
+            return;
+        }
+        cols = loadColumns();
+        loadData();
+        addSortIndicators();
+        enableUI();
+    };
+})();
+
+window.addEventListener('load', addSorting);
diff --git a/node_modules/seedrandom/coverage/lcov.info b/node_modules/seedrandom/coverage/lcov.info
new file mode 100644
index 0000000..bf8175d
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov.info
@@ -0,0 +1,799 @@
+TN:
+SF:/home/davidbau/git/seedrandom/seedrandom.js
+FN:25,(anonymous_0)
+FN:44,seedrandom
+FN:58,(anonymous_2)
+FN:75,(anonymous_3)
+FN:76,(anonymous_4)
+FN:84,(anonymous_5)
+FN:89,(anonymous_6)
+FN:116,ARC4
+FN:133,(anonymous_8)
+FN:153,copy
+FN:164,flatten
+FN:179,mixkey
+FN:193,autoseed
+FN:215,tostring
+FN:239,(anonymous_14)
+FNF:15
+FNH:14
+FNDA:6,(anonymous_0)
+FNDA:23,seedrandom
+FNDA:3694,(anonymous_2)
+FNDA:1025,(anonymous_3)
+FNDA:4100001,(anonymous_4)
+FNDA:20,(anonymous_5)
+FNDA:2,(anonymous_6)
+FNDA:23,ARC4
+FNDA:4108660,(anonymous_8)
+FNDA:4,copy
+FNDA:32,flatten
+FNDA:52,mixkey
+FNDA:4,autoseed
+FNDA:81,tostring
+FNDA:0,(anonymous_14)
+DA:25,6
+DA:30,6
+DA:31,6
+DA:32,6
+DA:33,6
+DA:34,6
+DA:35,6
+DA:36,6
+DA:37,6
+DA:45,23
+DA:46,23
+DA:49,23
+DA:54,23
+DA:58,23
+DA:59,3694
+DA:60,3694
+DA:61,3694
+DA:62,3694
+DA:63,3917
+DA:64,3917
+DA:65,3917
+DA:67,3694
+DA:68,9249
+DA:69,9249
+DA:70,9249
+DA:72,3694
+DA:75,1025
+DA:76,4100001
+DA:77,23
+DA:80,23
+DA:83,23
+DA:85,20
+DA:87,4
+DA:89,4
+DA:94,20
+DA:98,19
+DA:117,23
+DA:118,23
+DA:121,23
+DA:124,23
+DA:125,5888
+DA:127,23
+DA:128,5888
+DA:129,5888
+DA:133,23
+DA:135,4108660
+DA:136,4108660
+DA:137,4108660
+DA:138,16436073
+DA:139,16436073
+DA:141,4108660
+DA:142,4108660
+DA:154,4
+DA:155,4
+DA:156,4
+DA:157,4
+DA:165,32
+DA:166,32
+DA:167,4
+DA:168,9
+DA:171,32
+DA:180,52
+DA:181,52
+DA:182,7735
+DA:185,52
+DA:194,4
+DA:196,4
+DA:198,3
+DA:200,1
+DA:201,1
+DA:203,3
+DA:205,1
+DA:206,1
+DA:207,1
+DA:216,81
+DA:226,6
+DA:232,6
+DA:233,6
+DA:235,6
+DA:236,6
+DA:238,0
+DA:239,0
+DA:242,0
+LF:83
+LH:80
+BRDA:46,0,0,1
+BRDA:46,0,1,22
+BRDA:46,1,0,22
+BRDA:46,1,1,11
+BRDA:50,2,0,2
+BRDA:50,2,1,21
+BRDA:51,3,0,4
+BRDA:51,3,1,17
+BRDA:83,4,0,23
+BRDA:83,4,1,21
+BRDA:83,4,2,20
+BRDA:85,5,0,4
+BRDA:85,5,1,16
+BRDA:87,6,0,2
+BRDA:87,6,1,2
+BRDA:94,7,0,1
+BRDA:94,7,1,19
+BRDA:102,8,0,4
+BRDA:102,8,1,19
+BRDA:121,9,0,1
+BRDA:121,9,1,22
+BRDA:166,10,0,4
+BRDA:166,10,1,28
+BRDA:166,11,0,32
+BRDA:166,11,1,32
+BRDA:171,12,0,3
+BRDA:171,12,1,29
+BRDA:171,13,0,23
+BRDA:171,13,1,6
+BRDA:196,14,0,3
+BRDA:196,14,1,1
+BRDA:196,15,0,4
+BRDA:196,15,1,3
+BRDA:201,16,0,1
+BRDA:201,16,1,1
+BRDA:206,17,0,1
+BRDA:206,17,1,0
+BRDA:232,18,0,6
+BRDA:232,18,1,0
+BRDA:232,19,0,6
+BRDA:232,19,1,6
+BRDA:238,20,0,0
+BRDA:238,20,1,0
+BRDA:238,21,0,0
+BRDA:238,21,1,0
+BRDA:250,22,0,0
+BRDA:250,22,1,6
+BRF:47
+BRH:40
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/alea.js
+FN:28,(anonymous_0)
+FN:30,Alea
+FN:33,(anonymous_2)
+FN:54,copy
+FN:62,impl
+FN:66,(anonymous_5)
+FN:67,(anonymous_6)
+FN:73,(anonymous_7)
+FN:78,Mash
+FN:81,(anonymous_9)
+FN:103,(anonymous_10)
+FNF:11
+FNH:10
+FNDA:1,(anonymous_0)
+FNDA:3,Alea
+FNDA:4105129,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:1025,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:3,Mash
+FNDA:18,(anonymous_9)
+FNDA:0,(anonymous_10)
+DA:28,1
+DA:31,3
+DA:33,3
+DA:34,4105129
+DA:35,4105129
+DA:36,4105129
+DA:37,4105129
+DA:41,3
+DA:42,3
+DA:43,3
+DA:44,3
+DA:45,3
+DA:46,3
+DA:47,3
+DA:48,3
+DA:49,3
+DA:50,3
+DA:51,3
+DA:55,2
+DA:56,2
+DA:57,2
+DA:58,2
+DA:59,2
+DA:63,3
+DA:64,3
+DA:65,3
+DA:66,1025
+DA:67,3
+DA:68,1025
+DA:70,3
+DA:71,3
+DA:72,2
+DA:73,2
+DA:75,3
+DA:79,3
+DA:81,3
+DA:82,18
+DA:83,18
+DA:84,33
+DA:85,33
+DA:86,33
+DA:87,33
+DA:88,33
+DA:89,33
+DA:90,33
+DA:91,33
+DA:93,18
+DA:96,3
+DA:100,1
+DA:101,1
+DA:102,0
+DA:103,0
+DA:105,0
+LF:53
+LH:50
+BRDA:46,0,0,1
+BRDA:46,0,1,2
+BRDA:48,1,0,3
+BRDA:48,1,1,0
+BRDA:50,2,0,0
+BRDA:50,2,1,3
+BRDA:64,3,0,3
+BRDA:64,3,1,2
+BRDA:71,4,0,2
+BRDA:71,4,1,1
+BRDA:72,5,0,1
+BRDA:72,5,1,1
+BRDA:100,6,0,1
+BRDA:100,6,1,0
+BRDA:100,7,0,1
+BRDA:100,7,1,1
+BRDA:102,8,0,0
+BRDA:102,8,1,0
+BRDA:102,9,0,0
+BRDA:102,9,1,0
+BRDA:110,10,0,1
+BRDA:110,10,1,1
+BRDA:111,11,0,1
+BRDA:111,11,1,0
+BRF:24
+BRH:16
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/tychei.js
+FN:5,(anonymous_0)
+FN:7,XorGen
+FN:11,(anonymous_2)
+FN:60,copy
+FN:68,impl
+FN:71,(anonymous_5)
+FN:72,(anonymous_6)
+FN:84,(anonymous_7)
+FN:92,(anonymous_8)
+FNF:9
+FNH:8
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105195,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:0,(anonymous_8)
+DA:5,1
+DA:8,3
+DA:11,3
+DA:12,4105195
+DA:13,4105195
+DA:14,4105195
+DA:15,4105195
+DA:16,4105195
+DA:17,4105195
+DA:18,4105195
+DA:19,4105195
+DA:20,4105195
+DA:39,3
+DA:40,3
+DA:41,3
+DA:42,3
+DA:44,3
+DA:46,2
+DA:47,2
+DA:50,1
+DA:54,3
+DA:55,66
+DA:56,66
+DA:61,2
+DA:62,2
+DA:63,2
+DA:64,2
+DA:65,2
+DA:69,3
+DA:70,3
+DA:71,4102054
+DA:72,3
+DA:73,1025
+DA:74,1025
+DA:75,1025
+DA:76,1025
+DA:78,1025
+DA:80,3
+DA:81,3
+DA:82,3
+DA:83,2
+DA:84,2
+DA:86,3
+DA:89,1
+DA:90,1
+DA:91,0
+DA:92,0
+DA:94,0
+LF:48
+LH:45
+BRDA:44,0,0,2
+BRDA:44,0,1,1
+BRDA:70,1,0,3
+BRDA:70,1,1,2
+BRDA:82,2,0,2
+BRDA:82,2,1,1
+BRDA:83,3,0,1
+BRDA:83,3,1,1
+BRDA:89,4,0,1
+BRDA:89,4,1,0
+BRDA:89,5,0,1
+BRDA:89,5,1,1
+BRDA:91,6,0,0
+BRDA:91,6,1,0
+BRDA:91,7,0,0
+BRDA:91,7,1,0
+BRDA:99,8,0,1
+BRDA:99,8,1,1
+BRDA:100,9,0,1
+BRDA:100,9,1,0
+BRF:20
+BRH:14
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xor128.js
+FN:4,(anonymous_0)
+FN:6,XorGen
+FN:15,(anonymous_2)
+FN:38,copy
+FN:46,impl
+FN:49,(anonymous_5)
+FN:50,(anonymous_6)
+FN:62,(anonymous_7)
+FN:70,(anonymous_8)
+FNF:9
+FNH:8
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105327,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:0,(anonymous_8)
+DA:4,1
+DA:7,3
+DA:9,3
+DA:10,3
+DA:11,3
+DA:12,3
+DA:15,3
+DA:16,4105327
+DA:17,4105327
+DA:18,4105327
+DA:19,4105327
+DA:20,4105327
+DA:23,3
+DA:25,2
+DA:28,1
+DA:32,3
+DA:33,198
+DA:34,198
+DA:39,2
+DA:40,2
+DA:41,2
+DA:42,2
+DA:43,2
+DA:47,3
+DA:48,3
+DA:49,4102054
+DA:50,3
+DA:51,1025
+DA:52,1025
+DA:53,1025
+DA:54,1025
+DA:56,1025
+DA:58,3
+DA:59,3
+DA:60,3
+DA:61,2
+DA:62,2
+DA:64,3
+DA:67,1
+DA:68,1
+DA:69,0
+DA:70,0
+DA:72,0
+LF:43
+LH:40
+BRDA:23,0,0,2
+BRDA:23,0,1,1
+BRDA:48,1,0,3
+BRDA:48,1,1,2
+BRDA:60,2,0,2
+BRDA:60,2,1,1
+BRDA:61,3,0,1
+BRDA:61,3,1,1
+BRDA:67,4,0,1
+BRDA:67,4,1,0
+BRDA:67,5,0,1
+BRDA:67,5,1,1
+BRDA:69,6,0,0
+BRDA:69,6,1,0
+BRDA:69,7,0,0
+BRDA:69,7,1,0
+BRDA:77,8,0,1
+BRDA:77,8,1,1
+BRDA:78,9,0,1
+BRDA:78,9,1,0
+BRF:20
+BRH:14
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xor4096.js
+FN:26,(anonymous_0)
+FN:28,XorGen
+FN:32,(anonymous_2)
+FN:51,init
+FN:105,copy
+FN:112,impl
+FN:116,(anonymous_6)
+FN:117,(anonymous_7)
+FN:129,(anonymous_8)
+FN:137,(anonymous_9)
+FNF:10
+FNH:9
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105129,(anonymous_2)
+FNDA:3,init
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_6)
+FNDA:1025,(anonymous_7)
+FNDA:1,(anonymous_8)
+FNDA:0,(anonymous_9)
+DA:26,1
+DA:29,3
+DA:32,3
+DA:33,4105129
+DA:34,4105129
+DA:36,4105129
+DA:38,4105129
+DA:39,4105129
+DA:40,4105129
+DA:41,4105129
+DA:42,4105129
+DA:43,4105129
+DA:45,4105129
+DA:46,4105129
+DA:48,4105129
+DA:52,3
+DA:53,3
+DA:55,2
+DA:56,2
+DA:59,1
+DA:60,1
+DA:61,1
+DA:64,3
+DA:66,480
+DA:68,480
+DA:69,480
+DA:70,480
+DA:71,480
+DA:72,480
+DA:73,480
+DA:74,384
+DA:75,384
+DA:76,384
+DA:80,3
+DA:81,0
+DA:86,3
+DA:87,3
+DA:88,1536
+DA:89,1536
+DA:90,1536
+DA:91,1536
+DA:92,1536
+DA:93,1536
+DA:94,1536
+DA:97,3
+DA:98,3
+DA:99,3
+DA:102,3
+DA:106,2
+DA:107,2
+DA:108,2
+DA:109,2
+DA:113,3
+DA:114,3
+DA:115,3
+DA:116,4102054
+DA:117,3
+DA:118,1025
+DA:119,1025
+DA:120,1025
+DA:121,1025
+DA:123,1025
+DA:125,3
+DA:126,3
+DA:127,3
+DA:128,2
+DA:129,2
+DA:131,3
+DA:134,1
+DA:135,1
+DA:136,0
+DA:137,0
+DA:139,0
+LF:73
+LH:69
+BRDA:53,0,0,2
+BRDA:53,0,1,1
+BRDA:66,1,0,160
+BRDA:66,1,1,320
+BRDA:68,2,0,3
+BRDA:68,2,1,477
+BRDA:73,3,0,384
+BRDA:73,3,1,96
+BRDA:76,4,0,0
+BRDA:76,4,1,384
+BRDA:80,5,0,0
+BRDA:80,5,1,3
+BRDA:81,6,0,0
+BRDA:81,6,1,0
+BRDA:81,6,2,0
+BRDA:113,7,0,0
+BRDA:113,7,1,3
+BRDA:115,8,0,3
+BRDA:115,8,1,2
+BRDA:127,9,0,2
+BRDA:127,9,1,1
+BRDA:128,10,0,1
+BRDA:128,10,1,1
+BRDA:134,11,0,1
+BRDA:134,11,1,0
+BRDA:134,12,0,1
+BRDA:134,12,1,1
+BRDA:136,13,0,0
+BRDA:136,13,1,0
+BRDA:136,14,0,0
+BRDA:136,14,1,0
+BRDA:144,15,0,1
+BRDA:144,15,1,1
+BRDA:145,16,0,1
+BRDA:145,16,1,0
+BRF:35
+BRH:23
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xorshift7.js
+FN:6,(anonymous_0)
+FN:8,XorGen
+FN:12,(anonymous_2)
+FN:25,init
+FN:56,copy
+FN:62,impl
+FN:66,(anonymous_6)
+FN:67,(anonymous_7)
+FN:79,(anonymous_8)
+FN:87,(anonymous_9)
+FNF:10
+FNH:9
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105897,(anonymous_2)
+FNDA:3,init
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_6)
+FNDA:1025,(anonymous_7)
+FNDA:1,(anonymous_8)
+FNDA:0,(anonymous_9)
+DA:6,1
+DA:9,3
+DA:12,3
+DA:14,4105897
+DA:15,4105897
+DA:16,4105897
+DA:17,4105897
+DA:18,4105897
+DA:19,4105897
+DA:20,4105897
+DA:21,4105897
+DA:22,4105897
+DA:26,3
+DA:28,3
+DA:30,2
+DA:33,1
+DA:34,1
+DA:35,6
+DA:40,16
+DA:41,3
+DA:42,3
+DA:44,3
+DA:45,3
+DA:48,3
+DA:49,768
+DA:53,3
+DA:57,2
+DA:58,2
+DA:59,2
+DA:63,3
+DA:64,3
+DA:65,3
+DA:66,4102054
+DA:67,3
+DA:68,1025
+DA:69,1025
+DA:70,1025
+DA:71,1025
+DA:73,1025
+DA:75,3
+DA:76,3
+DA:77,3
+DA:78,2
+DA:79,2
+DA:81,3
+DA:84,1
+DA:85,1
+DA:86,0
+DA:87,0
+DA:89,0
+LF:50
+LH:47
+BRDA:28,0,0,2
+BRDA:28,0,1,1
+BRDA:41,1,0,19
+BRDA:41,1,1,17
+BRDA:42,2,0,2
+BRDA:42,2,1,1
+BRDA:63,3,0,0
+BRDA:63,3,1,3
+BRDA:65,4,0,3
+BRDA:65,4,1,2
+BRDA:77,5,0,2
+BRDA:77,5,1,1
+BRDA:78,6,0,1
+BRDA:78,6,1,1
+BRDA:84,7,0,1
+BRDA:84,7,1,0
+BRDA:84,8,0,1
+BRDA:84,8,1,1
+BRDA:86,9,0,0
+BRDA:86,9,1,0
+BRDA:86,10,0,0
+BRDA:86,10,1,0
+BRDA:94,11,0,1
+BRDA:94,11,1,1
+BRDA:95,12,0,1
+BRDA:95,12,1,0
+BRF:26
+BRH:19
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xorwow.js
+FN:4,(anonymous_0)
+FN:6,XorGen
+FN:10,(anonymous_2)
+FN:41,copy
+FN:51,impl
+FN:54,(anonymous_5)
+FN:55,(anonymous_6)
+FN:67,(anonymous_7)
+FN:75,(anonymous_8)
+FNF:9
+FNH:8
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105327,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:0,(anonymous_8)
+DA:4,1
+DA:7,3
+DA:10,3
+DA:11,4105327
+DA:12,4105327
+DA:13,4105327
+DA:17,3
+DA:18,3
+DA:19,3
+DA:20,3
+DA:21,3
+DA:23,3
+DA:25,2
+DA:28,1
+DA:32,3
+DA:33,198
+DA:34,198
+DA:35,3
+DA:37,198
+DA:42,2
+DA:43,2
+DA:44,2
+DA:45,2
+DA:46,2
+DA:47,2
+DA:48,2
+DA:52,3
+DA:53,3
+DA:54,4102054
+DA:55,3
+DA:56,1025
+DA:57,1025
+DA:58,1025
+DA:59,1025
+DA:61,1025
+DA:63,3
+DA:64,3
+DA:65,3
+DA:66,2
+DA:67,2
+DA:69,3
+DA:72,1
+DA:73,1
+DA:74,0
+DA:75,0
+DA:77,0
+LF:46
+LH:43
+BRDA:23,0,0,2
+BRDA:23,0,1,1
+BRDA:34,1,0,3
+BRDA:34,1,1,195
+BRDA:53,2,0,3
+BRDA:53,2,1,2
+BRDA:65,3,0,2
+BRDA:65,3,1,1
+BRDA:66,4,0,1
+BRDA:66,4,1,1
+BRDA:72,5,0,1
+BRDA:72,5,1,0
+BRDA:72,6,0,1
+BRDA:72,6,1,1
+BRDA:74,7,0,0
+BRDA:74,7,1,0
+BRDA:74,8,0,0
+BRDA:74,8,1,0
+BRDA:82,9,0,1
+BRDA:82,9,1,1
+BRDA:83,10,0,1
+BRDA:83,10,1,0
+BRF:22
+BRH:16
+end_of_record
diff --git a/node_modules/seedrandom/index.js b/node_modules/seedrandom/index.js
new file mode 100644
index 0000000..513669a
--- /dev/null
+++ b/node_modules/seedrandom/index.js
@@ -0,0 +1,60 @@
+// A library of seedable RNGs implemented in Javascript.
+//
+// Usage:
+//
+// var seedrandom = require('seedrandom');
+// var random = seedrandom(1); // or any seed.
+// var x = random();       // 0 <= x < 1.  Every bit is random.
+// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.
+
+// alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.
+// Period: ~2^116
+// Reported to pass all BigCrush tests.
+var alea = require('./lib/alea');
+
+// xor128, a pure xor-shift generator by George Marsaglia.
+// Period: 2^128-1.
+// Reported to fail: MatrixRank and LinearComp.
+var xor128 = require('./lib/xor128');
+
+// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.
+// Period: 2^192-2^32
+// Reported to fail: CollisionOver, SimpPoker, and LinearComp.
+var xorwow = require('./lib/xorwow');
+
+// xorshift7, by François Panneton and Pierre L'ecuyer, takes
+// a different approach: it adds robustness by allowing more shifts
+// than Marsaglia's original three.  It is a 7-shift generator
+// with 256 bits, that passes BigCrush with no systmatic failures.
+// Period 2^256-1.
+// No systematic BigCrush failures reported.
+var xorshift7 = require('./lib/xorshift7');
+
+// xor4096, by Richard Brent, is a 4096-bit xor-shift with a
+// very long period that also adds a Weyl generator. It also passes
+// BigCrush with no systematic failures.  Its long period may
+// be useful if you have many generators and need to avoid
+// collisions.
+// Period: 2^4128-2^32.
+// No systematic BigCrush failures reported.
+var xor4096 = require('./lib/xor4096');
+
+// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random
+// number generator derived from ChaCha, a modern stream cipher.
+// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
+// Period: ~2^127
+// No systematic BigCrush failures reported.
+var tychei = require('./lib/tychei');
+
+// The original ARC4-based prng included in this library.
+// Period: ~2^1600
+var sr = require('./seedrandom');
+
+sr.alea = alea;
+sr.xor128 = xor128;
+sr.xorwow = xorwow;
+sr.xorshift7 = xorshift7;
+sr.xor4096 = xor4096;
+sr.tychei = tychei;
+
+module.exports = sr;
diff --git a/node_modules/seedrandom/lib/alea.js b/node_modules/seedrandom/lib/alea.js
new file mode 100644
index 0000000..478b956
--- /dev/null
+++ b/node_modules/seedrandom/lib/alea.js
@@ -0,0 +1,114 @@
+// A port of an algorithm by Johannes Baagøe <baagoe@baagoe.com>, 2010
+// http://baagoe.com/en/RandomMusings/javascript/
+// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror
+// Original work is under MIT license -
+
+// Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+
+
+
+(function(global, module, define) {
+
+function Alea(seed) {
+  var me = this, mash = Mash();
+
+  me.next = function() {
+    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32
+    me.s0 = me.s1;
+    me.s1 = me.s2;
+    return me.s2 = t - (me.c = t | 0);
+  };
+
+  // Apply the seeding algorithm from Baagoe.
+  me.c = 1;
+  me.s0 = mash(' ');
+  me.s1 = mash(' ');
+  me.s2 = mash(' ');
+  me.s0 -= mash(seed);
+  if (me.s0 < 0) { me.s0 += 1; }
+  me.s1 -= mash(seed);
+  if (me.s1 < 0) { me.s1 += 1; }
+  me.s2 -= mash(seed);
+  if (me.s2 < 0) { me.s2 += 1; }
+  mash = null;
+}
+
+function copy(f, t) {
+  t.c = f.c;
+  t.s0 = f.s0;
+  t.s1 = f.s1;
+  t.s2 = f.s2;
+  return t;
+}
+
+function impl(seed, opts) {
+  var xg = new Alea(seed),
+      state = opts && opts.state,
+      prng = xg.next;
+  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }
+  prng.double = function() {
+    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53
+  };
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+function Mash() {
+  var n = 0xefc8249d;
+
+  var mash = function(data) {
+    data = String(data);
+    for (var i = 0; i < data.length; i++) {
+      n += data.charCodeAt(i);
+      var h = 0.02519603282416938 * n;
+      n = h >>> 0;
+      h -= n;
+      h *= n;
+      n = h >>> 0;
+      h -= n;
+      n += h * 0x100000000; // 2^32
+    }
+    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32
+  };
+
+  return mash;
+}
+
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.alea = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/alea.min.js b/node_modules/seedrandom/lib/alea.min.js
new file mode 100644
index 0000000..be30a46
--- /dev/null
+++ b/node_modules/seedrandom/lib/alea.min.js
@@ -0,0 +1 @@
+!function(n,t,e){function u(n){var t=this,e=function(){var s=4022871197;return function(n){n=String(n);for(var t=0;t<n.length;t++){var e=.02519603282416938*(s+=n.charCodeAt(t));e-=s=e>>>0,s=(e*=s)>>>0,s+=4294967296*(e-=s)}return 2.3283064365386963e-10*(s>>>0)}}();t.next=function(){var n=2091639*t.s0+2.3283064365386963e-10*t.c;return t.s0=t.s1,t.s1=t.s2,t.s2=n-(t.c=0|n)},t.c=1,t.s0=e(" "),t.s1=e(" "),t.s2=e(" "),t.s0-=e(n),t.s0<0&&(t.s0+=1),t.s1-=e(n),t.s1<0&&(t.s1+=1),t.s2-=e(n),t.s2<0&&(t.s2+=1),e=null}function o(n,t){return t.c=n.c,t.s0=n.s0,t.s1=n.s1,t.s2=n.s2,t}function s(n,t){var e=new u(n),s=t&&t.state,r=e.next;return r.int32=function(){return 4294967296*e.next()|0},r.double=function(){return r()+11102230246251565e-32*(2097152*r()|0)},r.quick=r,s&&("object"==typeof s&&o(s,e),r.state=function(){return o(e,{})}),r}t&&t.exports?t.exports=s:e&&e.amd?e(function(){return s}):this.alea=s}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/crypto.js b/node_modules/seedrandom/lib/crypto.js
new file mode 100644
index 0000000..18ee91f
--- /dev/null
+++ b/node_modules/seedrandom/lib/crypto.js
@@ -0,0 +1,11 @@
+// mimic a subset of node's crypto API for the browser
+
+function randomBytes(width) {
+  var out = new Uint8Array(width);
+  (global.crypto || global.msCrypto).getRandomValues(out);
+  return out;
+}
+
+module.exports = {
+  randomBytes: randomBytes
+}
diff --git a/node_modules/seedrandom/lib/tychei.js b/node_modules/seedrandom/lib/tychei.js
new file mode 100644
index 0000000..3d0ddd4
--- /dev/null
+++ b/node_modules/seedrandom/lib/tychei.js
@@ -0,0 +1,103 @@
+// A Javascript implementaion of the "Tyche-i" prng algorithm by
+// Samuel Neves and Filipe Araujo.
+// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this, strseed = '';
+
+  // Set up generator function.
+  me.next = function() {
+    var b = me.b, c = me.c, d = me.d, a = me.a;
+    b = (b << 25) ^ (b >>> 7) ^ c;
+    c = (c - d) | 0;
+    d = (d << 24) ^ (d >>> 8) ^ a;
+    a = (a - b) | 0;
+    me.b = b = (b << 20) ^ (b >>> 12) ^ c;
+    me.c = c = (c - d) | 0;
+    me.d = (d << 16) ^ (c >>> 16) ^ a;
+    return me.a = (a - b) | 0;
+  };
+
+  /* The following is non-inverted tyche, which has better internal
+   * bit diffusion, but which is about 25% slower than tyche-i in JS.
+  me.next = function() {
+    var a = me.a, b = me.b, c = me.c, d = me.d;
+    a = (me.a + me.b | 0) >>> 0;
+    d = me.d ^ a; d = d << 16 ^ d >>> 16;
+    c = me.c + d | 0;
+    b = me.b ^ c; b = b << 12 ^ d >>> 20;
+    me.a = a = a + b | 0;
+    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;
+    me.c = c = c + d | 0;
+    b = b ^ c;
+    return me.b = (b << 7 ^ b >>> 25);
+  }
+  */
+
+  me.a = 0;
+  me.b = 0;
+  me.c = 2654435769 | 0;
+  me.d = 1367130551;
+
+  if (seed === Math.floor(seed)) {
+    // Integer seed.
+    me.a = (seed / 0x100000000) | 0;
+    me.b = seed | 0;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k < strseed.length + 20; k++) {
+    me.b ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+
+function copy(f, t) {
+  t.a = f.a;
+  t.b = f.b;
+  t.c = f.c;
+  t.d = f.d;
+  return t;
+};
+
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.tychei = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/tychei.min.js b/node_modules/seedrandom/lib/tychei.min.js
new file mode 100644
index 0000000..fa24abb
--- /dev/null
+++ b/node_modules/seedrandom/lib/tychei.min.js
@@ -0,0 +1 @@
+!function(t,n,e){function u(t){var r=this,n="";r.next=function(){var t=r.b,n=r.c,e=r.d,o=r.a;return t=t<<25^t>>>7^n,n=n-e|0,e=e<<24^e>>>8^o,o=o-t|0,r.b=t=t<<20^t>>>12^n,r.c=n=n-e|0,r.d=e<<16^n>>>16^o,r.a=o-t|0},r.a=0,r.b=0,r.c=-1640531527,r.d=1367130551,t===Math.floor(t)?(r.a=t/4294967296|0,r.b=0|t):n+=t;for(var e=0;e<n.length+20;e++)r.b^=0|n.charCodeAt(e),r.next()}function c(t,n){return n.a=t.a,n.b=t.b,n.c=t.c,n.d=t.d,n}function o(t,n){function e(){return(o.next()>>>0)/4294967296}var o=new u(t),r=n&&n.state;return e.double=function(){do{var t=((o.next()>>>11)+(o.next()>>>0)/4294967296)/(1<<21)}while(0===t);return t},e.int32=o.next,e.quick=e,r&&("object"==typeof r&&c(r,o),e.state=function(){return c(o,{})}),e}n&&n.exports?n.exports=o:e&&e.amd?e(function(){return o}):this.tychei=o}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xor128.js b/node_modules/seedrandom/lib/xor128.js
new file mode 100644
index 0000000..c461934
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor128.js
@@ -0,0 +1,81 @@
+// A Javascript implementaion of the "xor128" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this, strseed = '';
+
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+
+  // Set up generator function.
+  me.next = function() {
+    var t = me.x ^ (me.x << 11);
+    me.x = me.y;
+    me.y = me.z;
+    me.z = me.w;
+    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);
+  };
+
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k < strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  return t;
+}
+
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xor128 = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/xor128.min.js b/node_modules/seedrandom/lib/xor128.min.js
new file mode 100644
index 0000000..bd60553
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor128.min.js
@@ -0,0 +1 @@
+!function(t,n,e){function u(t){var n=this,e="";n.x=0,n.y=0,n.z=0,n.w=0,n.next=function(){var t=n.x^n.x<<11;return n.x=n.y,n.y=n.z,n.z=n.w,n.w^=n.w>>>19^t^t>>>8},t===(0|t)?n.x=t:e+=t;for(var o=0;o<e.length+64;o++)n.x^=0|e.charCodeAt(o),n.next()}function i(t,n){return n.x=t.x,n.y=t.y,n.z=t.z,n.w=t.w,n}function o(t,n){function e(){return(o.next()>>>0)/4294967296}var o=new u(t),r=n&&n.state;return e.double=function(){do{var t=((o.next()>>>11)+(o.next()>>>0)/4294967296)/(1<<21)}while(0===t);return t},e.int32=o.next,e.quick=e,r&&("object"==typeof r&&i(r,o),e.state=function(){return i(o,{})}),e}n&&n.exports?n.exports=o:e&&e.amd?e(function(){return o}):this.xor128=o}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xor4096.js b/node_modules/seedrandom/lib/xor4096.js
new file mode 100644
index 0000000..6adf19f
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor4096.js
@@ -0,0 +1,146 @@
+// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.
+//
+// This fast non-cryptographic random number generator is designed for
+// use in Monte-Carlo algorithms. It combines a long-period xorshift
+// generator with a Weyl generator, and it passes all common batteries
+// of stasticial tests for randomness while consuming only a few nanoseconds
+// for each prng generated.  For background on the generator, see Brent's
+// paper: "Some long-period random number generators using shifts and xors."
+// http://arxiv.org/pdf/1004.3115v1.pdf
+//
+// Usage:
+//
+// var xor4096 = require('xor4096');
+// random = xor4096(1);                        // Seed with int32 or string.
+// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.
+// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.
+//
+// For nonzero numeric keys, this impelementation provides a sequence
+// identical to that by Brent's xorgens 3 implementaion in C.  This
+// implementation also provides for initalizing the generator with
+// string seeds, or for saving and restoring the state of the generator.
+//
+// On Chrome, this prng benchmarks about 2.1 times slower than
+// Javascript's built-in Math.random().
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this;
+
+  // Set up generator function.
+  me.next = function() {
+    var w = me.w,
+        X = me.X, i = me.i, t, v;
+    // Update Weyl generator.
+    me.w = w = (w + 0x61c88647) | 0;
+    // Update xor generator.
+    v = X[(i + 34) & 127];
+    t = X[i = ((i + 1) & 127)];
+    v ^= v << 13;
+    t ^= t << 17;
+    v ^= v >>> 15;
+    t ^= t >>> 12;
+    // Update Xor generator array state.
+    v = X[i] = v ^ t;
+    me.i = i;
+    // Result is the combination.
+    return (v + (w ^ (w >>> 16))) | 0;
+  };
+
+  function init(me, seed) {
+    var t, v, i, j, w, X = [], limit = 128;
+    if (seed === (seed | 0)) {
+      // Numeric seeds initialize v, which is used to generates X.
+      v = seed;
+      seed = null;
+    } else {
+      // String seeds are mixed into v and X one character at a time.
+      seed = seed + '\0';
+      v = 0;
+      limit = Math.max(limit, seed.length);
+    }
+    // Initialize circular array and weyl value.
+    for (i = 0, j = -32; j < limit; ++j) {
+      // Put the unicode characters into the array, and shuffle them.
+      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);
+      // After 32 shuffles, take v as the starting w value.
+      if (j === 0) w = v;
+      v ^= v << 10;
+      v ^= v >>> 15;
+      v ^= v << 4;
+      v ^= v >>> 13;
+      if (j >= 0) {
+        w = (w + 0x61c88647) | 0;     // Weyl.
+        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.
+        i = (0 == t) ? i + 1 : 0;     // Count zeroes.
+      }
+    }
+    // We have detected all zeroes; make the key nonzero.
+    if (i >= 128) {
+      X[(seed && seed.length || 0) & 127] = -1;
+    }
+    // Run the generator 512 times to further mix the state before using it.
+    // Factoring this as a function slows the main generator, so it is just
+    // unrolled here.  The weyl generator is not advanced while warming up.
+    i = 127;
+    for (j = 4 * 128; j > 0; --j) {
+      v = X[(i + 34) & 127];
+      t = X[i = ((i + 1) & 127)];
+      v ^= v << 13;
+      t ^= t << 17;
+      v ^= v >>> 15;
+      t ^= t >>> 12;
+      X[i] = v ^ t;
+    }
+    // Storing state as object members is faster than using closure variables.
+    me.w = w;
+    me.X = X;
+    me.i = i;
+  }
+
+  init(me, seed);
+}
+
+function copy(f, t) {
+  t.i = f.i;
+  t.w = f.w;
+  t.X = f.X.slice();
+  return t;
+};
+
+function impl(seed, opts) {
+  if (seed == null) seed = +(new Date);
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.X) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xor4096 = impl;
+}
+
+})(
+  this,                                     // window object or global
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
diff --git a/node_modules/seedrandom/lib/xor4096.min.js b/node_modules/seedrandom/lib/xor4096.min.js
new file mode 100644
index 0000000..fee9f8a
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor4096.min.js
@@ -0,0 +1 @@
+!function(n,t,e){function o(n){var o=this;o.next=function(){var n,t,e=o.w,r=o.X,i=o.i;return o.w=e=e+1640531527|0,t=r[i+34&127],n=r[i=i+1&127],t^=t<<13,n^=n<<17,t^=t>>>15,n^=n>>>12,t=r[i]=t^n,o.i=i,t+(e^e>>>16)|0},function(n,t){var e,r,i,o,u,f=[],c=128;for(t===(0|t)?(r=t,t=null):(t+="\0",r=0,c=Math.max(c,t.length)),i=0,o=-32;o<c;++o)t&&(r^=t.charCodeAt((o+32)%t.length)),0===o&&(u=r),r^=r<<10,r^=r>>>15,r^=r<<4,r^=r>>>13,0<=o&&(u=u+1640531527|0,i=0==(e=f[127&o]^=r+u)?i+1:0);for(128<=i&&(f[127&(t&&t.length||0)]=-1),i=127,o=512;0<o;--o)r=f[i+34&127],e=f[i=i+1&127],r^=r<<13,e^=e<<17,r^=r>>>15,e^=e>>>12,f[i]=r^e;n.w=u,n.X=f,n.i=i}(o,n)}function u(n,t){return t.i=n.i,t.w=n.w,t.X=n.X.slice(),t}function r(n,t){null==n&&(n=+new Date);function e(){return(r.next()>>>0)/4294967296}var r=new o(n),i=t&&t.state;return e.double=function(){do{var n=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===n);return n},e.int32=r.next,e.quick=e,i&&(i.X&&u(i,r),e.state=function(){return u(r,{})}),e}t&&t.exports?t.exports=r:e&&e.amd?e(function(){return r}):this.xor4096=r}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xorshift7.js b/node_modules/seedrandom/lib/xorshift7.js
new file mode 100644
index 0000000..b7e5151
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorshift7.js
@@ -0,0 +1,97 @@
+// A Javascript implementaion of the "xorshift7" algorithm by
+// François Panneton and Pierre L'ecuyer:
+// "On the Xorgshift Random Number Generators"
+// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this;
+
+  // Set up generator function.
+  me.next = function() {
+    // Update xor generator.
+    var X = me.x, i = me.i, t, v, w;
+    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);
+    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);
+    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);
+    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);
+    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);
+    X[i] = v;
+    me.i = (i + 1) & 7;
+    return v;
+  };
+
+  function init(me, seed) {
+    var j, w, X = [];
+
+    if (seed === (seed | 0)) {
+      // Seed state array using a 32-bit integer.
+      w = X[0] = seed;
+    } else {
+      // Seed state using a string.
+      seed = '' + seed;
+      for (j = 0; j < seed.length; ++j) {
+        X[j & 7] = (X[j & 7] << 15) ^
+            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);
+      }
+    }
+    // Enforce an array length of 8, not all zeroes.
+    while (X.length < 8) X.push(0);
+    for (j = 0; j < 8 && X[j] === 0; ++j);
+    if (j == 8) w = X[7] = -1; else w = X[j];
+
+    me.x = X;
+    me.i = 0;
+
+    // Discard an initial 256 values.
+    for (j = 256; j > 0; --j) {
+      me.next();
+    }
+  }
+
+  init(me, seed);
+}
+
+function copy(f, t) {
+  t.x = f.x.slice();
+  t.i = f.i;
+  return t;
+}
+
+function impl(seed, opts) {
+  if (seed == null) seed = +(new Date);
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.x) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xorshift7 = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
diff --git a/node_modules/seedrandom/lib/xorshift7.min.js b/node_modules/seedrandom/lib/xorshift7.min.js
new file mode 100644
index 0000000..c6db5f6
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorshift7.min.js
@@ -0,0 +1 @@
+!function(n,t,e){function o(n){var i=this;i.next=function(){var n,t,e=i.x,r=i.i;return n=e[r],t=(n^=n>>>7)^n<<24,t^=(n=e[r+1&7])^n>>>10,t^=(n=e[r+3&7])^n>>>3,t^=(n=e[r+4&7])^n<<7,n=e[r+7&7],t^=(n^=n<<13)^n<<9,e[r]=t,i.i=r+1&7,t},function(n,t){var e,r=[];if(t===(0|t))r[0]=t;else for(t=""+t,e=0;e<t.length;++e)r[7&e]=r[7&e]<<15^t.charCodeAt(e)+r[e+1&7]<<13;for(;r.length<8;)r.push(0);for(e=0;e<8&&0===r[e];++e);for(8==e?r[7]=-1:r[e],n.x=r,n.i=0,e=256;0<e;--e)n.next()}(i,n)}function u(n,t){return t.x=n.x.slice(),t.i=n.i,t}function r(n,t){null==n&&(n=+new Date);function e(){return(r.next()>>>0)/4294967296}var r=new o(n),i=t&&t.state;return e.double=function(){do{var n=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===n);return n},e.int32=r.next,e.quick=e,i&&(i.x&&u(i,r),e.state=function(){return u(r,{})}),e}t&&t.exports?t.exports=r:e&&e.amd?e(function(){return r}):this.xorshift7=r}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xorwow.js b/node_modules/seedrandom/lib/xorwow.js
new file mode 100644
index 0000000..79d5e44
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorwow.js
@@ -0,0 +1,86 @@
+// A Javascript implementaion of the "xorwow" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this, strseed = '';
+
+  // Set up generator function.
+  me.next = function() {
+    var t = (me.x ^ (me.x >>> 2));
+    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;
+    return (me.d = (me.d + 362437 | 0)) +
+       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;
+  };
+
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+  me.v = 0;
+
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k < strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    if (k == strseed.length) {
+      me.d = me.x << 10 ^ me.x >>> 4;
+    }
+    me.next();
+  }
+}
+
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  t.v = f.v;
+  t.d = f.d;
+  return t;
+}
+
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xorwow = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/xorwow.min.js b/node_modules/seedrandom/lib/xorwow.min.js
new file mode 100644
index 0000000..be1c626
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorwow.min.js
@@ -0,0 +1 @@
+!function(t,n,e){function u(t){var n=this,e="";n.next=function(){var t=n.x^n.x>>>2;return n.x=n.y,n.y=n.z,n.z=n.w,n.w=n.v,(n.d=n.d+362437|0)+(n.v=n.v^n.v<<4^t^t<<1)|0},n.x=0,n.y=0,n.z=0,n.w=0,t===((n.v=0)|t)?n.x=t:e+=t;for(var o=0;o<e.length+64;o++)n.x^=0|e.charCodeAt(o),o==e.length&&(n.d=n.x<<10^n.x>>>4),n.next()}function x(t,n){return n.x=t.x,n.y=t.y,n.z=t.z,n.w=t.w,n.v=t.v,n.d=t.d,n}function o(t,n){function e(){return(o.next()>>>0)/4294967296}var o=new u(t),r=n&&n.state;return e.double=function(){do{var t=((o.next()>>>11)+(o.next()>>>0)/4294967296)/(1<<21)}while(0===t);return t},e.int32=o.next,e.quick=e,r&&("object"==typeof r&&x(r,o),e.state=function(){return x(o,{})}),e}n&&n.exports?n.exports=o:e&&e.amd?e(function(){return o}):this.xorwow=o}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/package.json b/node_modules/seedrandom/package.json
new file mode 100644
index 0000000..86aad13
--- /dev/null
+++ b/node_modules/seedrandom/package.json
@@ -0,0 +1,60 @@
+{
+  "name": "seedrandom",
+  "version": "3.0.5",
+  "description": "Seeded random number generator for Javascript.",
+  "main": "index.js",
+  "jsdelivr": "seedrandom.min.js",
+  "unpkg": "seedrandom.min.js",
+  "keywords": [
+    "seed",
+    "random",
+    "crypto"
+  ],
+  "scripts": {
+    "test": "grunt travis"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/davidbau/seedrandom.git"
+  },
+  "author": "David Bau",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/davidbau/seedrandom/issues"
+  },
+  "homepage": "http://davidbau.com/archives/2010/01/30/random_seeds_coded_hints_and_quintillions.html",
+  "config": {
+    "blanket": {
+      "pattern": [
+        "seedrandom.js",
+        "lib/alea.js",
+        "lib/xor128.js",
+        "lib/xorwow.js",
+        "lib/xorshift7.js",
+        "lib/tychei.js",
+        "lib/xor4096.js"
+      ]
+    }
+  },
+  "browser": {
+    "crypto": false
+  },
+  "devDependencies": {
+    "blanket": "latest",
+    "coveralls": "latest",
+    "grunt": "latest",
+    "grunt-browserify": "latest",
+    "grunt-release": "davidbau/grunt-release",
+    "grunt-cli": "latest",
+    "grunt-contrib-connect": "latest",
+    "grunt-contrib-copy": "latest",
+    "grunt-contrib-qunit": "latest",
+    "grunt-contrib-uglify": "latest",
+    "grunt-mocha-nyc": "latest",
+    "mocha": "latest",
+    "nyc": "latest",
+    "proxyquire": "latest",
+    "qunit": "latest",
+    "requirejs": "latest"
+  }
+}
diff --git a/node_modules/seedrandom/seedrandom.js b/node_modules/seedrandom/seedrandom.js
new file mode 100644
index 0000000..12d7ee1
--- /dev/null
+++ b/node_modules/seedrandom/seedrandom.js
@@ -0,0 +1,253 @@
+/*
+Copyright 2019 David Bau.
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+*/
+
+(function (global, pool, math) {
+//
+// The following constants are related to IEEE 754 limits.
+//
+
+var width = 256,        // each RC4 output is 0 <= x < 256
+    chunks = 6,         // at least six RC4 outputs for each double
+    digits = 52,        // there are 52 significant digits in a double
+    rngname = 'random', // rngname: name for Math.random and Math.seedrandom
+    startdenom = math.pow(width, chunks),
+    significance = math.pow(2, digits),
+    overflow = significance * 2,
+    mask = width - 1,
+    nodecrypto;         // node.js crypto module, initialized at the bottom.
+
+//
+// seedrandom()
+// This is the seedrandom function described above.
+//
+function seedrandom(seed, options, callback) {
+  var key = [];
+  options = (options == true) ? { entropy: true } : (options || {});
+
+  // Flatten the seed string or build one from local entropy if needed.
+  var shortseed = mixkey(flatten(
+    options.entropy ? [seed, tostring(pool)] :
+    (seed == null) ? autoseed() : seed, 3), key);
+
+  // Use the seed to initialize an ARC4 generator.
+  var arc4 = new ARC4(key);
+
+  // This function returns a random double in [0, 1) that contains
+  // randomness in every bit of the mantissa of the IEEE 754 value.
+  var prng = function() {
+    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48
+        d = startdenom,                 //   and denominator d = 2 ^ 48.
+        x = 0;                          //   and no 'extra last byte'.
+    while (n < significance) {          // Fill up all significant digits by
+      n = (n + x) * width;              //   shifting numerator and
+      d *= width;                       //   denominator and generating a
+      x = arc4.g(1);                    //   new least-significant-byte.
+    }
+    while (n >= overflow) {             // To avoid rounding up, before adding
+      n /= 2;                           //   last byte, shift everything
+      d /= 2;                           //   right using integer math until
+      x >>>= 1;                         //   we have exactly the desired bits.
+    }
+    return (n + x) / d;                 // Form the number within [0, 1).
+  };
+
+  prng.int32 = function() { return arc4.g(4) | 0; }
+  prng.quick = function() { return arc4.g(4) / 0x100000000; }
+  prng.double = prng;
+
+  // Mix the randomness into accumulated entropy.
+  mixkey(tostring(arc4.S), pool);
+
+  // Calling convention: what to return as a function of prng, seed, is_math.
+  return (options.pass || callback ||
+      function(prng, seed, is_math_call, state) {
+        if (state) {
+          // Load the arc4 state from the given state if it has an S array.
+          if (state.S) { copy(state, arc4); }
+          // Only provide the .state method if requested via options.state.
+          prng.state = function() { return copy(arc4, {}); }
+        }
+
+        // If called as a method of Math (Math.seedrandom()), mutate
+        // Math.random because that is how seedrandom.js has worked since v1.0.
+        if (is_math_call) { math[rngname] = prng; return seed; }
+
+        // Otherwise, it is a newer calling convention, so return the
+        // prng directly.
+        else return prng;
+      })(
+  prng,
+  shortseed,
+  'global' in options ? options.global : (this == math),
+  options.state);
+}
+
+//
+// ARC4
+//
+// An ARC4 implementation.  The constructor takes a key in the form of
+// an array of at most (width) integers that should be 0 <= x < (width).
+//
+// The g(count) method returns a pseudorandom integer that concatenates
+// the next (count) outputs from ARC4.  Its return value is a number x
+// that is in the range 0 <= x < (width ^ count).
+//
+function ARC4(key) {
+  var t, keylen = key.length,
+      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];
+
+  // The empty key [] is treated as [0].
+  if (!keylen) { key = [keylen++]; }
+
+  // Set up S using the standard key scheduling algorithm.
+  while (i < width) {
+    s[i] = i++;
+  }
+  for (i = 0; i < width; i++) {
+    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];
+    s[j] = t;
+  }
+
+  // The "g" method returns the next (count) outputs as one number.
+  (me.g = function(count) {
+    // Using instance members instead of closure state nearly doubles speed.
+    var t, r = 0,
+        i = me.i, j = me.j, s = me.S;
+    while (count--) {
+      t = s[i = mask & (i + 1)];
+      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];
+    }
+    me.i = i; me.j = j;
+    return r;
+    // For robust unpredictability, the function call below automatically
+    // discards an initial batch of values.  This is called RC4-drop[256].
+    // See http://google.com/search?q=rsa+fluhrer+response&btnI
+  })(width);
+}
+
+//
+// copy()
+// Copies internal state of ARC4 to or from a plain object.
+//
+function copy(f, t) {
+  t.i = f.i;
+  t.j = f.j;
+  t.S = f.S.slice();
+  return t;
+};
+
+//
+// flatten()
+// Converts an object tree to nested arrays of strings.
+//
+function flatten(obj, depth) {
+  var result = [], typ = (typeof obj), prop;
+  if (depth && typ == 'object') {
+    for (prop in obj) {
+      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
+    }
+  }
+  return (result.length ? result : typ == 'string' ? obj : obj + '\0');
+}
+
+//
+// mixkey()
+// Mixes a string seed into a key that is an array of integers, and
+// returns a shortened string seed that is equivalent to the result key.
+//
+function mixkey(seed, key) {
+  var stringseed = seed + '', smear, j = 0;
+  while (j < stringseed.length) {
+    key[mask & j] =
+      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));
+  }
+  return tostring(key);
+}
+
+//
+// autoseed()
+// Returns an object for autoseeding, using window.crypto and Node crypto
+// module if available.
+//
+function autoseed() {
+  try {
+    var out;
+    if (nodecrypto && (out = nodecrypto.randomBytes)) {
+      // The use of 'out' to remember randomBytes makes tight minified code.
+      out = out(width);
+    } else {
+      out = new Uint8Array(width);
+      (global.crypto || global.msCrypto).getRandomValues(out);
+    }
+    return tostring(out);
+  } catch (e) {
+    var browser = global.navigator,
+        plugins = browser && browser.plugins;
+    return [+new Date, global, plugins, global.screen, tostring(pool)];
+  }
+}
+
+//
+// tostring()
+// Converts an array of charcodes to a string
+//
+function tostring(a) {
+  return String.fromCharCode.apply(0, a);
+}
+
+//
+// When seedrandom.js is loaded, we immediately mix a few bits
+// from the built-in RNG into the entropy pool.  Because we do
+// not want to interfere with deterministic PRNG state later,
+// seedrandom will not call math.random on its own again after
+// initialization.
+//
+mixkey(math.random(), pool);
+
+//
+// Nodejs and AMD support: export the implementation as a module using
+// either convention.
+//
+if ((typeof module) == 'object' && module.exports) {
+  module.exports = seedrandom;
+  // When in node.js, try using crypto package for autoseeding.
+  try {
+    nodecrypto = require('crypto');
+  } catch (ex) {}
+} else if ((typeof define) == 'function' && define.amd) {
+  define(function() { return seedrandom; });
+} else {
+  // When included as a plain script, set up Math.seedrandom global.
+  math['seed' + rngname] = seedrandom;
+}
+
+
+// End anonymous scope, and pass initial values.
+})(
+  // global: `self` in browsers (including strict mode and web workers),
+  // otherwise `this` in Node and other environments
+  (typeof self !== 'undefined') ? self : this,
+  [],     // pool: entropy pool starts empty
+  Math    // math: package containing random, pow, and seedrandom
+);
diff --git a/node_modules/seedrandom/seedrandom.min.js b/node_modules/seedrandom/seedrandom.min.js
new file mode 100644
index 0000000..56e1afc
--- /dev/null
+++ b/node_modules/seedrandom/seedrandom.min.js
@@ -0,0 +1 @@
+!function(f,a,c){var s,l=256,p="random",d=c.pow(l,6),g=c.pow(2,52),y=2*g,h=l-1;function n(n,t,r){function e(){for(var n=u.g(6),t=d,r=0;n<g;)n=(n+r)*l,t*=l,r=u.g(1);for(;y<=n;)n/=2,t/=2,r>>>=1;return(n+r)/t}var o=[],i=j(function n(t,r){var e,o=[],i=typeof t;if(r&&"object"==i)for(e in t)try{o.push(n(t[e],r-1))}catch(n){}return o.length?o:"string"==i?t:t+"\0"}((t=1==t?{entropy:!0}:t||{}).entropy?[n,S(a)]:null==n?function(){try{var n;return s&&(n=s.randomBytes)?n=n(l):(n=new Uint8Array(l),(f.crypto||f.msCrypto).getRandomValues(n)),S(n)}catch(n){var t=f.navigator,r=t&&t.plugins;return[+new Date,f,r,f.screen,S(a)]}}():n,3),o),u=new m(o);return e.int32=function(){return 0|u.g(4)},e.quick=function(){return u.g(4)/4294967296},e.double=e,j(S(u.S),a),(t.pass||r||function(n,t,r,e){return e&&(e.S&&v(e,u),n.state=function(){return v(u,{})}),r?(c[p]=n,t):n})(e,i,"global"in t?t.global:this==c,t.state)}function m(n){var t,r=n.length,u=this,e=0,o=u.i=u.j=0,i=u.S=[];for(r||(n=[r++]);e<l;)i[e]=e++;for(e=0;e<l;e++)i[e]=i[o=h&o+n[e%r]+(t=i[e])],i[o]=t;(u.g=function(n){for(var t,r=0,e=u.i,o=u.j,i=u.S;n--;)t=i[e=h&e+1],r=r*l+i[h&(i[e]=i[o=h&o+t])+(i[o]=t)];return u.i=e,u.j=o,r})(l)}function v(n,t){return t.i=n.i,t.j=n.j,t.S=n.S.slice(),t}function j(n,t){for(var r,e=n+"",o=0;o<e.length;)t[h&o]=h&(r^=19*t[h&o])+e.charCodeAt(o++);return S(t)}function S(n){return String.fromCharCode.apply(0,n)}if(j(c.random(),a),"object"==typeof module&&module.exports){module.exports=n;try{s=require("crypto")}catch(n){}}else"function"==typeof define&&define.amd?define(function(){return n}):c["seed"+p]=n}("undefined"!=typeof self?self:this,[],Math);
\ No newline at end of file
diff --git a/node_modules/tiny-emitter/LICENSE b/node_modules/tiny-emitter/LICENSE
new file mode 100644
index 0000000..24f1024
--- /dev/null
+++ b/node_modules/tiny-emitter/LICENSE
@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Scott Corgan
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/tiny-emitter/README.md b/node_modules/tiny-emitter/README.md
new file mode 100644
index 0000000..cd474cd
--- /dev/null
+++ b/node_modules/tiny-emitter/README.md
@@ -0,0 +1,88 @@
+# tiny-emitter
+
+A tiny (less than 1k) event emitter library.
+
+## Install
+
+### npm
+
+```
+npm install tiny-emitter --save
+```
+
+## Usage
+
+```js
+var Emitter = require('tiny-emitter');
+var emitter = new Emitter();
+
+emitter.on('some-event', function (arg1, arg2, arg3) {
+ //
+});
+
+emitter.emit('some-event', 'arg1 value', 'arg2 value', 'arg3 value');
+```
+
+Alternatively, you can skip the initialization step by requiring `tiny-emitter/instance` instead. This pulls in an already initialized emitter.
+
+```js
+var emitter = require('tiny-emitter/instance');
+
+emitter.on('some-event', function (arg1, arg2, arg3) {
+ //
+});
+
+emitter.emit('some-event', 'arg1 value', 'arg2 value', 'arg3 value');
+```
+
+## Instance Methods
+
+### on(event, callback[, context])
+
+Subscribe to an event
+
+* `event` - the name of the event to subscribe to
+* `callback` - the function to call when event is emitted
+* `context` - (OPTIONAL) - the context to bind the event callback to
+
+### once(event, callback[, context])
+
+Subscribe to an event only **once**
+
+* `event` - the name of the event to subscribe to
+* `callback` - the function to call when event is emitted
+* `context` - (OPTIONAL) - the context to bind the event callback to
+
+### off(event[, callback])
+
+Unsubscribe from an event or all events. If no callback is provided, it unsubscribes you from all events.
+
+* `event` - the name of the event to unsubscribe from
+* `callback` - the function used when binding to the event
+
+### emit(event[, arguments...])
+
+Trigger a named event
+
+* `event` - the event name to emit
+* `arguments...` - any number of arguments to pass to the event subscribers
+
+## Test and Build
+
+Build (Tests, Browserifies, and minifies)
+
+```
+npm install
+npm run build
+```
+
+Test
+
+```
+npm install
+npm test
+```
+
+## License
+
+[MIT](https://github.com/scottcorgan/tiny-emitter/blob/master/LICENSE)
diff --git a/node_modules/tiny-emitter/dist/tinyemitter.js b/node_modules/tiny-emitter/dist/tinyemitter.js
new file mode 100644
index 0000000..6e25e05
--- /dev/null
+++ b/node_modules/tiny-emitter/dist/tinyemitter.js
@@ -0,0 +1,71 @@
+(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.TinyEmitter = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
+function E () {
+  // Keep this empty so it's easier to inherit from
+  // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)
+}
+
+E.prototype = {
+  on: function (name, callback, ctx) {
+    var e = this.e || (this.e = {});
+
+    (e[name] || (e[name] = [])).push({
+      fn: callback,
+      ctx: ctx
+    });
+
+    return this;
+  },
+
+  once: function (name, callback, ctx) {
+    var self = this;
+    function listener () {
+      self.off(name, listener);
+      callback.apply(ctx, arguments);
+    };
+
+    listener._ = callback
+    return this.on(name, listener, ctx);
+  },
+
+  emit: function (name) {
+    var data = [].slice.call(arguments, 1);
+    var evtArr = ((this.e || (this.e = {}))[name] || []).slice();
+    var i = 0;
+    var len = evtArr.length;
+
+    for (i; i < len; i++) {
+      evtArr[i].fn.apply(evtArr[i].ctx, data);
+    }
+
+    return this;
+  },
+
+  off: function (name, callback) {
+    var e = this.e || (this.e = {});
+    var evts = e[name];
+    var liveEvents = [];
+
+    if (evts && callback) {
+      for (var i = 0, len = evts.length; i < len; i++) {
+        if (evts[i].fn !== callback && evts[i].fn._ !== callback)
+          liveEvents.push(evts[i]);
+      }
+    }
+
+    // Remove event from queue to prevent memory leak
+    // Suggested by https://github.com/lazd
+    // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910
+
+    (liveEvents.length)
+      ? e[name] = liveEvents
+      : delete e[name];
+
+    return this;
+  }
+};
+
+module.exports = E;
+module.exports.TinyEmitter = E;
+
+},{}]},{},[1])(1)
+});
\ No newline at end of file
diff --git a/node_modules/tiny-emitter/dist/tinyemitter.min.js b/node_modules/tiny-emitter/dist/tinyemitter.min.js
new file mode 100644
index 0000000..6340f09
--- /dev/null
+++ b/node_modules/tiny-emitter/dist/tinyemitter.min.js
@@ -0,0 +1 @@
+(function(e){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=e()}else if(typeof define==="function"&&define.amd){define([],e)}else{var n;if(typeof window!=="undefined"){n=window}else if(typeof global!=="undefined"){n=global}else if(typeof self!=="undefined"){n=self}else{n=this}n.TinyEmitter=e()}})(function(){var e,n,t;return function r(e,n,t){function i(o,u){if(!n[o]){if(!e[o]){var s=typeof require=="function"&&require;if(!u&&s)return s(o,!0);if(f)return f(o,!0);var a=new Error("Cannot find module '"+o+"'");throw a.code="MODULE_NOT_FOUND",a}var l=n[o]={exports:{}};e[o][0].call(l.exports,function(n){var t=e[o][1][n];return i(t?t:n)},l,l.exports,r,e,n,t)}return n[o].exports}var f=typeof require=="function"&&require;for(var o=0;o<t.length;o++)i(t[o]);return i}({1:[function(e,n,t){function r(){}r.prototype={on:function(e,n,t){var r=this.e||(this.e={});(r[e]||(r[e]=[])).push({fn:n,ctx:t});return this},once:function(e,n,t){var r=this;function i(){r.off(e,i);n.apply(t,arguments)}i._=n;return this.on(e,i,t)},emit:function(e){var n=[].slice.call(arguments,1);var t=((this.e||(this.e={}))[e]||[]).slice();var r=0;var i=t.length;for(r;r<i;r++){t[r].fn.apply(t[r].ctx,n)}return this},off:function(e,n){var t=this.e||(this.e={});var r=t[e];var i=[];if(r&&n){for(var f=0,o=r.length;f<o;f++){if(r[f].fn!==n&&r[f].fn._!==n)i.push(r[f])}}i.length?t[e]=i:delete t[e];return this}};n.exports=r;n.exports.TinyEmitter=r},{}]},{},[1])(1)});
\ No newline at end of file
diff --git a/node_modules/tiny-emitter/index.d.ts b/node_modules/tiny-emitter/index.d.ts
new file mode 100644
index 0000000..6640610
--- /dev/null
+++ b/node_modules/tiny-emitter/index.d.ts
@@ -0,0 +1,6 @@
+export declare class TinyEmitter {
+  on(event: string, callback: Function, ctx?: any): this;
+  once(event: string, callback: Function, ctx?: any): this;
+  emit(event: string, ...args: any[]): this;
+  off(event: string, callback?: Function): this;
+}
\ No newline at end of file
diff --git a/node_modules/tiny-emitter/index.js b/node_modules/tiny-emitter/index.js
new file mode 100644
index 0000000..7ca4a60
--- /dev/null
+++ b/node_modules/tiny-emitter/index.js
@@ -0,0 +1,67 @@
+function E () {
+  // Keep this empty so it's easier to inherit from
+  // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)
+}
+
+E.prototype = {
+  on: function (name, callback, ctx) {
+    var e = this.e || (this.e = {});
+
+    (e[name] || (e[name] = [])).push({
+      fn: callback,
+      ctx: ctx
+    });
+
+    return this;
+  },
+
+  once: function (name, callback, ctx) {
+    var self = this;
+    function listener () {
+      self.off(name, listener);
+      callback.apply(ctx, arguments);
+    };
+
+    listener._ = callback
+    return this.on(name, listener, ctx);
+  },
+
+  emit: function (name) {
+    var data = [].slice.call(arguments, 1);
+    var evtArr = ((this.e || (this.e = {}))[name] || []).slice();
+    var i = 0;
+    var len = evtArr.length;
+
+    for (i; i < len; i++) {
+      evtArr[i].fn.apply(evtArr[i].ctx, data);
+    }
+
+    return this;
+  },
+
+  off: function (name, callback) {
+    var e = this.e || (this.e = {});
+    var evts = e[name];
+    var liveEvents = [];
+
+    if (evts && callback) {
+      for (var i = 0, len = evts.length; i < len; i++) {
+        if (evts[i].fn !== callback && evts[i].fn._ !== callback)
+          liveEvents.push(evts[i]);
+      }
+    }
+
+    // Remove event from queue to prevent memory leak
+    // Suggested by https://github.com/lazd
+    // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910
+
+    (liveEvents.length)
+      ? e[name] = liveEvents
+      : delete e[name];
+
+    return this;
+  }
+};
+
+module.exports = E;
+module.exports.TinyEmitter = E;
diff --git a/node_modules/tiny-emitter/instance.js b/node_modules/tiny-emitter/instance.js
new file mode 100644
index 0000000..6dcdba2
--- /dev/null
+++ b/node_modules/tiny-emitter/instance.js
@@ -0,0 +1,2 @@
+var E = require('./index.js');
+module.exports = new E();
diff --git a/node_modules/tiny-emitter/package.json b/node_modules/tiny-emitter/package.json
new file mode 100644
index 0000000..5da6335
--- /dev/null
+++ b/node_modules/tiny-emitter/package.json
@@ -0,0 +1,53 @@
+{
+  "name": "tiny-emitter",
+  "version": "2.1.0",
+  "description": "A tiny (less than 1k) event emitter library",
+  "main": "index.js",
+  "scripts": {
+    "test-node": "tape test/index.js | tap-format-spec",
+    "test": "testling | tap-format-spec",
+    "bundle": "node_modules/.bin/browserify index.js > dist/tinyemitter.js -s TinyEmitter && echo 'Bundled'",
+    "minify": "node_modules/.bin/uglifyjs dist/tinyemitter.js -o dist/tinyemitter.min.js -m && echo 'Minified'",
+    "build": "npm test && npm run bundle && npm run minify",
+    "size": "node_modules/.bin/uglifyjs index.js -o minified.js -m && ls -l && rm minified.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/scottcorgan/tiny-emitter.git"
+  },
+  "keywords": [
+    "event",
+    "emitter",
+    "pubsub",
+    "tiny",
+    "events",
+    "bind"
+  ],
+  "author": "Scott Corgan",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/scottcorgan/tiny-emitter/issues"
+  },
+  "devDependencies": {
+    "@tap-format/spec": "0.2.0",
+    "browserify": "11.2.0",
+    "tape": "4.2.1",
+    "testling": "1.7.1",
+    "uglify-js": "2.5.0"
+  },
+  "testling": {
+    "files": [
+      "test/index.js"
+    ],
+    "browsers": [
+      "iexplore/10.0",
+      "iexplore/9.0",
+      "firefox/16..latest",
+      "chrome/22..latest",
+      "safari/5.1..latest",
+      "ipad/6.0..latest",
+      "iphone/6.0..latest",
+      "android-browser/4.2..latest"
+    ]
+  }
+}
diff --git a/node_modules/tiny-emitter/test/index.js b/node_modules/tiny-emitter/test/index.js
new file mode 100644
index 0000000..7f95f62
--- /dev/null
+++ b/node_modules/tiny-emitter/test/index.js
@@ -0,0 +1,217 @@
+var Emitter = require('../index');
+var emitter = require('../instance');
+var test = require('tape');
+
+test('subscribes to an event', function (t) {
+  var emitter = new Emitter();
+  emitter.on('test', function () {});
+
+  t.equal(emitter.e.test.length, 1, 'subscribed to event');
+  t.end();
+});
+
+test('subscribes to an event with context', function (t) {
+  var emitter = new Emitter();
+  var context = {
+    contextValue: true
+  };
+
+  emitter.on('test', function () {
+    t.ok(this.contextValue, 'is in context');
+    t.end();
+  }, context);
+
+  emitter.emit('test');
+});
+
+test('subscibes only once to an event', function (t) {
+  var emitter = new Emitter();
+
+  emitter.once('test', function () {
+    t.notOk(emitter.e.test, 'removed event from list');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('keeps context when subscribed only once', function (t) {
+  var emitter = new Emitter();
+  var context = {
+    contextValue: true
+  };
+
+  emitter.once('test', function () {
+    t.ok(this.contextValue, 'is in context');
+    t.notOk(emitter.e.test, 'not subscribed anymore');
+    t.end();
+  }, context);
+
+  emitter.emit('test');
+});
+
+test('emits an event', function (t) {
+  var emitter = new Emitter();
+
+  emitter.on('test', function () {
+    t.ok(true, 'triggered event');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('passes all arguments to event listener', function (t) {
+  var emitter = new Emitter();
+
+  emitter.on('test', function (arg1, arg2) {
+    t.equal(arg1, 'arg1', 'passed the first argument');
+    t.equal(arg2, 'arg2', 'passed the second argument');
+    t.end();
+  });
+
+  emitter.emit('test', 'arg1', 'arg2');
+});
+
+test('unsubscribes from all events with name', function (t) {
+  var emitter = new Emitter();
+  emitter.on('test', function () {
+    t.fail('should not get called');
+  });
+  emitter.off('test');
+  emitter.emit('test')
+
+  process.nextTick(function () {
+    t.end();
+  });
+});
+
+test('unsubscribes single event with name and callback', function (t) {
+  var emitter = new Emitter();
+  var fn = function () {
+    t.fail('should not get called');
+  }
+
+  emitter.on('test', fn);
+  emitter.off('test', fn);
+  emitter.emit('test')
+
+  process.nextTick(function () {
+    t.end();
+  });
+});
+
+// Test added by https://github.com/lazd
+// From PR: https://github.com/scottcorgan/tiny-emitter/pull/6
+test('unsubscribes single event with name and callback when subscribed twice', function (t) {
+  var emitter = new Emitter();
+  var fn = function () {
+    t.fail('should not get called');
+  };
+
+  emitter.on('test', fn);
+  emitter.on('test', fn);
+
+  emitter.off('test', fn);
+  emitter.emit('test');
+
+  process.nextTick(function () {
+    t.notOk(emitter.e['test'], 'removes all events');
+    t.end();
+  });
+});
+
+test('unsubscribes single event with name and callback when subscribed twice out of order', function (t) {
+  var emitter = new Emitter();
+  var calls = 0;
+  var fn = function () {
+    t.fail('should not get called');
+  };
+  var fn2 = function () {
+    calls++;
+  };
+
+  emitter.on('test', fn);
+  emitter.on('test', fn2);
+  emitter.on('test', fn);
+  emitter.off('test', fn);
+  emitter.emit('test');
+
+  process.nextTick(function () {
+    t.equal(calls, 1, 'callback was called');
+    t.end();
+  });
+});
+
+test('removes an event inside another event', function (t) {
+  var emitter = new Emitter();
+
+  emitter.on('test', function () {
+    t.equal(emitter.e.test.length, 1, 'event is still in list');
+
+    emitter.off('test');
+
+    t.notOk(emitter.e.test, 0, 'event is gone from list');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('event is emitted even if unsubscribed in the event callback', function (t) {
+  var emitter = new Emitter();
+  var calls = 0;
+  var fn = function () {
+    calls += 1;
+    emitter.off('test', fn);
+  };
+
+  emitter.on('test', fn);
+
+  emitter.on('test', function () {
+    calls += 1;
+  });
+
+  emitter.on('test', function () {
+    calls += 1;
+  });
+
+  process.nextTick(function () {
+    t.equal(calls, 3, 'all callbacks were called');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('calling off before any events added does nothing', function (t) {
+  var emitter = new Emitter();
+  emitter.off('test', function () {});
+  t.end();
+});
+
+test('emitting event that has not been subscribed to yet', function (t) {
+  var emitter = new Emitter();
+
+  emitter.emit('some-event', 'some message');
+  t.end();
+});
+
+test('unsubscribes single event with name and callback which was subscribed once', function (t) {
+  var emitter = new Emitter();
+  var fn = function () {
+    t.fail('event not unsubscribed');
+  }
+
+  emitter.once('test', fn);
+  emitter.off('test', fn);
+  emitter.emit('test');
+
+  t.end();
+});
+
+test('exports an instance', function (t) {
+  t.ok(emitter, 'exports an instance')
+  t.ok(emitter instanceof Emitter, 'an instance of the Emitter class');
+  t.end();
+});
diff --git a/node_modules/tiny-emitter/yarn.lock b/node_modules/tiny-emitter/yarn.lock
new file mode 100644
index 0000000..730a024
--- /dev/null
+++ b/node_modules/tiny-emitter/yarn.lock
@@ -0,0 +1,1857 @@
+# THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY.
+# yarn lockfile v1
+
+
+"@tap-format/exit@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/exit/-/exit-0.2.0.tgz#b58736bc55d30802c012c5adfca51b47040310cd"
+  dependencies:
+    ramda "^0.18.0"
+    rx "^4.0.7"
+
+"@tap-format/failures@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/failures/-/failures-0.2.0.tgz#bb6f5edc3bc3c57c62885bc7c214cc7abdfc2a07"
+  dependencies:
+    chalk "^1.1.1"
+    diff "^2.2.1"
+    figures "^1.4.0"
+    ramda "^0.18.0"
+    rx "^4.0.7"
+
+"@tap-format/parser@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/parser/-/parser-0.2.0.tgz#bdc1d95e694781157593283bb3c3fec132a3115d"
+  dependencies:
+    duplexer "^0.1.1"
+    js-yaml "^3.4.6"
+    ramda "^0.18.0"
+    readable-stream "^2.0.4"
+    rx "^4.0.7"
+    rx-node "^1.0.1"
+    split "^1.0.0"
+
+"@tap-format/results@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/results/-/results-0.2.0.tgz#192d64ac41f146fa2722db1c0a22ed80478f54fd"
+  dependencies:
+    chalk "^1.1.1"
+    hirestime "^1.0.6"
+    pretty-ms "^2.1.0"
+    rx "^4.0.7"
+
+"@tap-format/spec@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/spec/-/spec-0.2.0.tgz#93f7d2f0dcefe526b4776800b9bd7f80db5aaec7"
+  dependencies:
+    "@tap-format/exit" "0.2.0"
+    "@tap-format/failures" "0.2.0"
+    "@tap-format/parser" "0.2.0"
+    "@tap-format/results" "0.2.0"
+    chalk "^1.1.1"
+    figures "^1.4.0"
+    rx "^4.0.7"
+
+Base64@~0.2.0:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/Base64/-/Base64-0.2.1.tgz#ba3a4230708e186705065e66babdd4c35cf60028"
+
+JSONStream@^1.0.3:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/JSONStream/-/JSONStream-1.3.2.tgz#c102371b6ec3a7cf3b847ca00c20bb0fce4c6dea"
+  dependencies:
+    jsonparse "^1.2.0"
+    through ">=2.2.7 <3"
+
+JSONStream@~0.6.4:
+  version "0.6.4"
+  resolved "https://registry.yarnpkg.com/JSONStream/-/JSONStream-0.6.4.tgz#4b2c8063f8f512787b2375f7ee9db69208fa2dcb"
+  dependencies:
+    jsonparse "0.0.5"
+    through "~2.2.7"
+
+JSONStream@~0.7.1:
+  version "0.7.4"
+  resolved "https://registry.yarnpkg.com/JSONStream/-/JSONStream-0.7.4.tgz#734290e41511eea7c2cfe151fbf9a563a97b9786"
+  dependencies:
+    jsonparse "0.0.5"
+    through ">=2.2.7 <3"
+
+acorn-node@^1.2.0:
+  version "1.3.0"
+  resolved "https://registry.yarnpkg.com/acorn-node/-/acorn-node-1.3.0.tgz#5f86d73346743810ef1269b901dbcbded020861b"
+  dependencies:
+    acorn "^5.4.1"
+    xtend "^4.0.1"
+
+acorn@^2.7.0:
+  version "2.7.0"
+  resolved "https://registry.yarnpkg.com/acorn/-/acorn-2.7.0.tgz#ab6e7d9d886aaca8b085bc3312b79a198433f0e7"
+
+acorn@^4.0.3:
+  version "4.0.13"
+  resolved "https://registry.yarnpkg.com/acorn/-/acorn-4.0.13.tgz#105495ae5361d697bd195c825192e1ad7f253787"
+
+acorn@^5.2.1, acorn@^5.4.1:
+  version "5.4.1"
+  resolved "https://registry.yarnpkg.com/acorn/-/acorn-5.4.1.tgz#fdc58d9d17f4a4e98d102ded826a9b9759125102"
+
+amdefine@>=0.0.4:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/amdefine/-/amdefine-1.0.1.tgz#4a5282ac164729e93619bcfd3ad151f817ce91f5"
+
+ansi-regex@^2.0.0:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/ansi-regex/-/ansi-regex-2.1.1.tgz#c3b33ab5ee360d86e0e628f0468ae7ef27d654df"
+
+ansi-styles@^2.2.1:
+  version "2.2.1"
+  resolved "https://registry.yarnpkg.com/ansi-styles/-/ansi-styles-2.2.1.tgz#b432dd3358b634cf75e1e4664368240533c1ddbe"
+
+argparse@^1.0.7:
+  version "1.0.10"
+  resolved "https://registry.yarnpkg.com/argparse/-/argparse-1.0.10.tgz#bcd6791ea5ae09725e17e5ad988134cd40b3d911"
+  dependencies:
+    sprintf-js "~1.0.2"
+
+asn1.js@^4.0.0:
+  version "4.10.1"
+  resolved "https://registry.yarnpkg.com/asn1.js/-/asn1.js-4.10.1.tgz#b9c2bf5805f1e64aadeed6df3a2bfafb5a73f5a0"
+  dependencies:
+    bn.js "^4.0.0"
+    inherits "^2.0.1"
+    minimalistic-assert "^1.0.0"
+
+assert@~1.1.0:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/assert/-/assert-1.1.2.tgz#adaa04c46bb58c6dd1f294da3eb26e6228eb6e44"
+  dependencies:
+    util "0.10.3"
+
+assert@~1.3.0:
+  version "1.3.0"
+  resolved "https://registry.yarnpkg.com/assert/-/assert-1.3.0.tgz#03939a622582a812cc202320a0b9a56c9b815849"
+  dependencies:
+    util "0.10.3"
+
+astw@^2.0.0:
+  version "2.2.0"
+  resolved "https://registry.yarnpkg.com/astw/-/astw-2.2.0.tgz#7bd41784d32493987aeb239b6b4e1c57a873b917"
+  dependencies:
+    acorn "^4.0.3"
+
+async@~0.2.6:
+  version "0.2.10"
+  resolved "https://registry.yarnpkg.com/async/-/async-0.2.10.tgz#b6bbe0b0674b9d719708ca38de8c237cb526c3d1"
+
+balanced-match@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/balanced-match/-/balanced-match-1.0.0.tgz#89b4d199ab2bee49de164ea02b89ce462d71b767"
+
+base64-js@0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/base64-js/-/base64-js-0.0.2.tgz#024f0f72afa25b75f9c0ee73cd4f55ec1bed9784"
+
+base64-js@0.0.8, base64-js@~0.0.4:
+  version "0.0.8"
+  resolved "https://registry.yarnpkg.com/base64-js/-/base64-js-0.0.8.tgz#1101e9544f4a76b1bc3b26d452ca96d7a35e7978"
+
+bn.js@^4.0.0, bn.js@^4.1.0, bn.js@^4.1.1, bn.js@^4.4.0:
+  version "4.11.8"
+  resolved "https://registry.yarnpkg.com/bn.js/-/bn.js-4.11.8.tgz#2cde09eb5ee341f484746bb0309b3253b1b1442f"
+
+bops@0.0.6:
+  version "0.0.6"
+  resolved "https://registry.yarnpkg.com/bops/-/bops-0.0.6.tgz#082d1d55fa01e60dbdc2ebc2dba37f659554cf3a"
+  dependencies:
+    base64-js "0.0.2"
+    to-utf8 "0.0.1"
+
+bouncy@~3.2.0:
+  version "3.2.2"
+  resolved "https://registry.yarnpkg.com/bouncy/-/bouncy-3.2.2.tgz#82ab4ad7beae05890eed54b9af3c45394b185dc7"
+  dependencies:
+    optimist "~0.3.5"
+    through "~2.3.4"
+
+brace-expansion@^1.0.0, brace-expansion@^1.1.7:
+  version "1.1.11"
+  resolved "https://registry.yarnpkg.com/brace-expansion/-/brace-expansion-1.1.11.tgz#3c7fcbf529d87226f3d2f52b966ff5271eb441dd"
+  dependencies:
+    balanced-match "^1.0.0"
+    concat-map "0.0.1"
+
+brorand@^1.0.1:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/brorand/-/brorand-1.1.0.tgz#12c25efe40a45e3c323eb8675a0a0ce57b22371f"
+
+browser-launcher@~0.3.2:
+  version "0.3.5"
+  resolved "https://registry.yarnpkg.com/browser-launcher/-/browser-launcher-0.3.5.tgz#d9a3663fa064d8155044991c00e61dbcb6730a16"
+  dependencies:
+    headless "~0.1.3"
+    merge "~1.0.0"
+    minimist "0.0.5"
+    mkdirp "~0.3.3"
+    plist "0.2.1"
+    xtend "^4.0.0"
+
+browser-pack@^5.0.0:
+  version "5.0.1"
+  resolved "https://registry.yarnpkg.com/browser-pack/-/browser-pack-5.0.1.tgz#4197719b20c6e0aaa09451c5111e53efb6fbc18d"
+  dependencies:
+    JSONStream "^1.0.3"
+    combine-source-map "~0.6.1"
+    defined "^1.0.0"
+    through2 "^1.0.0"
+    umd "^3.0.0"
+
+browser-pack@~2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/browser-pack/-/browser-pack-2.0.1.tgz#5d1c527f56c582677411c4db2a128648ff6bf150"
+  dependencies:
+    JSONStream "~0.6.4"
+    combine-source-map "~0.3.0"
+    through "~2.3.4"
+
+browser-resolve@^1.7.0, browser-resolve@^1.7.1:
+  version "1.11.2"
+  resolved "https://registry.yarnpkg.com/browser-resolve/-/browser-resolve-1.11.2.tgz#8ff09b0a2c421718a1051c260b32e48f442938ce"
+  dependencies:
+    resolve "1.1.7"
+
+browser-resolve@~1.2.1, browser-resolve@~1.2.4:
+  version "1.2.4"
+  resolved "https://registry.yarnpkg.com/browser-resolve/-/browser-resolve-1.2.4.tgz#59ae7820a82955ecd32f5fb7c468ac21c4723806"
+  dependencies:
+    resolve "0.6.3"
+
+browserify-aes@^1.0.0, browserify-aes@^1.0.4:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/browserify-aes/-/browserify-aes-1.1.1.tgz#38b7ab55edb806ff2dcda1a7f1620773a477c49f"
+  dependencies:
+    buffer-xor "^1.0.3"
+    cipher-base "^1.0.0"
+    create-hash "^1.1.0"
+    evp_bytestokey "^1.0.3"
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+browserify-cipher@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/browserify-cipher/-/browserify-cipher-1.0.0.tgz#9988244874bf5ed4e28da95666dcd66ac8fc363a"
+  dependencies:
+    browserify-aes "^1.0.4"
+    browserify-des "^1.0.0"
+    evp_bytestokey "^1.0.0"
+
+browserify-des@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/browserify-des/-/browserify-des-1.0.0.tgz#daa277717470922ed2fe18594118a175439721dd"
+  dependencies:
+    cipher-base "^1.0.1"
+    des.js "^1.0.0"
+    inherits "^2.0.1"
+
+browserify-rsa@^4.0.0:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/browserify-rsa/-/browserify-rsa-4.0.1.tgz#21e0abfaf6f2029cf2fafb133567a701d4135524"
+  dependencies:
+    bn.js "^4.1.0"
+    randombytes "^2.0.1"
+
+browserify-sign@^4.0.0:
+  version "4.0.4"
+  resolved "https://registry.yarnpkg.com/browserify-sign/-/browserify-sign-4.0.4.tgz#aa4eb68e5d7b658baa6bf6a57e630cbd7a93d298"
+  dependencies:
+    bn.js "^4.1.1"
+    browserify-rsa "^4.0.0"
+    create-hash "^1.1.0"
+    create-hmac "^1.1.2"
+    elliptic "^6.0.0"
+    inherits "^2.0.1"
+    parse-asn1 "^5.0.0"
+
+browserify-zlib@~0.1.2:
+  version "0.1.4"
+  resolved "https://registry.yarnpkg.com/browserify-zlib/-/browserify-zlib-0.1.4.tgz#bb35f8a519f600e0fa6b8485241c979d0141fb2d"
+  dependencies:
+    pako "~0.2.0"
+
+browserify@11.2.0:
+  version "11.2.0"
+  resolved "https://registry.yarnpkg.com/browserify/-/browserify-11.2.0.tgz#a11bb9dd209d79572b813f7eeeaf828a5f5c0e4e"
+  dependencies:
+    JSONStream "^1.0.3"
+    assert "~1.3.0"
+    browser-pack "^5.0.0"
+    browser-resolve "^1.7.1"
+    browserify-zlib "~0.1.2"
+    buffer "^3.0.0"
+    builtins "~0.0.3"
+    commondir "0.0.1"
+    concat-stream "~1.4.1"
+    console-browserify "^1.1.0"
+    constants-browserify "~0.0.1"
+    crypto-browserify "^3.0.0"
+    defined "^1.0.0"
+    deps-sort "^1.3.7"
+    domain-browser "~1.1.0"
+    duplexer2 "~0.0.2"
+    events "~1.0.0"
+    glob "^4.0.5"
+    has "^1.0.0"
+    htmlescape "^1.1.0"
+    https-browserify "~0.0.0"
+    inherits "~2.0.1"
+    insert-module-globals "^6.4.1"
+    isarray "0.0.1"
+    labeled-stream-splicer "^1.0.0"
+    module-deps "^3.7.11"
+    os-browserify "~0.1.1"
+    parents "^1.0.1"
+    path-browserify "~0.0.0"
+    process "~0.11.0"
+    punycode "^1.3.2"
+    querystring-es3 "~0.2.0"
+    read-only-stream "^1.1.1"
+    readable-stream "^2.0.2"
+    resolve "^1.1.4"
+    shasum "^1.0.0"
+    shell-quote "~0.0.1"
+    stream-browserify "^2.0.0"
+    stream-http "^1.2.0"
+    string_decoder "~0.10.0"
+    subarg "^1.0.0"
+    syntax-error "^1.1.1"
+    through2 "^1.0.0"
+    timers-browserify "^1.0.1"
+    tty-browserify "~0.0.0"
+    url "~0.10.1"
+    util "~0.10.1"
+    vm-browserify "~0.0.1"
+    xtend "^4.0.0"
+
+browserify@3.x.x:
+  version "3.46.1"
+  resolved "https://registry.yarnpkg.com/browserify/-/browserify-3.46.1.tgz#2c2e4a7f2f408178e78c223b5b57b37c2185ad8e"
+  dependencies:
+    JSONStream "~0.7.1"
+    assert "~1.1.0"
+    browser-pack "~2.0.0"
+    browser-resolve "~1.2.1"
+    browserify-zlib "~0.1.2"
+    buffer "~2.1.4"
+    builtins "~0.0.3"
+    commondir "0.0.1"
+    concat-stream "~1.4.1"
+    console-browserify "~1.0.1"
+    constants-browserify "~0.0.1"
+    crypto-browserify "~1.0.9"
+    deep-equal "~0.1.0"
+    defined "~0.0.0"
+    deps-sort "~0.1.1"
+    derequire "~0.8.0"
+    domain-browser "~1.1.0"
+    duplexer "~0.1.1"
+    events "~1.0.0"
+    glob "~3.2.8"
+    http-browserify "~1.3.1"
+    https-browserify "~0.0.0"
+    inherits "~2.0.1"
+    insert-module-globals "~6.0.0"
+    module-deps "~2.0.0"
+    os-browserify "~0.1.1"
+    parents "~0.0.1"
+    path-browserify "~0.0.0"
+    process "^0.7.0"
+    punycode "~1.2.3"
+    querystring-es3 "0.2.0"
+    resolve "~0.6.1"
+    shallow-copy "0.0.1"
+    shell-quote "~0.0.1"
+    stream-browserify "~0.1.0"
+    stream-combiner "~0.0.2"
+    string_decoder "~0.0.0"
+    subarg "0.0.1"
+    syntax-error "~1.1.0"
+    through2 "~0.4.1"
+    timers-browserify "~1.0.1"
+    tty-browserify "~0.0.0"
+    umd "~2.0.0"
+    url "~0.10.1"
+    util "~0.10.1"
+    vm-browserify "~0.0.1"
+    xtend "^3.0.0"
+
+buffer-xor@^1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/buffer-xor/-/buffer-xor-1.0.3.tgz#26e61ed1422fb70dd42e6e36729ed51d855fe8d9"
+
+buffer@^3.0.0:
+  version "3.6.0"
+  resolved "https://registry.yarnpkg.com/buffer/-/buffer-3.6.0.tgz#a72c936f77b96bf52f5f7e7b467180628551defb"
+  dependencies:
+    base64-js "0.0.8"
+    ieee754 "^1.1.4"
+    isarray "^1.0.0"
+
+buffer@~2.1.4:
+  version "2.1.13"
+  resolved "https://registry.yarnpkg.com/buffer/-/buffer-2.1.13.tgz#c88838ebf79f30b8b4a707788470bea8a62c2355"
+  dependencies:
+    base64-js "~0.0.4"
+    ieee754 "~1.1.1"
+
+builtin-status-codes@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/builtin-status-codes/-/builtin-status-codes-1.0.0.tgz#30637ee262978ac07174e16d7f82f0ad06e085ad"
+
+builtins@~0.0.3:
+  version "0.0.7"
+  resolved "https://registry.yarnpkg.com/builtins/-/builtins-0.0.7.tgz#355219cd6cf18dbe7c01cc7fd2dce765cfdc549a"
+
+callsite@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/callsite/-/callsite-1.0.0.tgz#280398e5d664bd74038b6f0905153e6e8af1bc20"
+
+camelcase@^1.0.2:
+  version "1.2.1"
+  resolved "https://registry.yarnpkg.com/camelcase/-/camelcase-1.2.1.tgz#9bb5304d2e0b56698b2c758b08a3eaa9daa58a39"
+
+chalk@^1.1.1:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/chalk/-/chalk-1.1.3.tgz#a8115c55e4a702fe4d150abd3872822a7e09fc98"
+  dependencies:
+    ansi-styles "^2.2.1"
+    escape-string-regexp "^1.0.2"
+    has-ansi "^2.0.0"
+    strip-ansi "^3.0.0"
+    supports-color "^2.0.0"
+
+cipher-base@^1.0.0, cipher-base@^1.0.1, cipher-base@^1.0.3:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/cipher-base/-/cipher-base-1.0.4.tgz#8760e4ecc272f4c363532f926d874aae2c1397de"
+  dependencies:
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+combine-source-map@~0.3.0:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/combine-source-map/-/combine-source-map-0.3.0.tgz#d9e74f593d9cd43807312cb5d846d451efaa9eb7"
+  dependencies:
+    convert-source-map "~0.3.0"
+    inline-source-map "~0.3.0"
+    source-map "~0.1.31"
+
+combine-source-map@~0.6.1:
+  version "0.6.1"
+  resolved "https://registry.yarnpkg.com/combine-source-map/-/combine-source-map-0.6.1.tgz#9b4a09c316033d768e0f11e029fa2730e079ad96"
+  dependencies:
+    convert-source-map "~1.1.0"
+    inline-source-map "~0.5.0"
+    lodash.memoize "~3.0.3"
+    source-map "~0.4.2"
+
+commondir@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/commondir/-/commondir-0.0.1.tgz#89f00fdcd51b519c578733fec563e6a6da7f5be2"
+
+concat-map@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/concat-map/-/concat-map-0.0.1.tgz#d8a96bd77fd68df7793a73036a3ba0d5405d477b"
+
+concat-stream@~0.1.0:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/concat-stream/-/concat-stream-0.1.1.tgz#d7f4e278b90cfc4f0f3ef77fe4c03b40eb3f7900"
+
+concat-stream@~1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/concat-stream/-/concat-stream-1.0.1.tgz#018b18bc1c7d073a2dc82aa48442341a2c4dd79f"
+  dependencies:
+    bops "0.0.6"
+
+concat-stream@~1.4.1, concat-stream@~1.4.5:
+  version "1.4.10"
+  resolved "https://registry.yarnpkg.com/concat-stream/-/concat-stream-1.4.10.tgz#acc3bbf5602cb8cc980c6ac840fa7d8603e3ef36"
+  dependencies:
+    inherits "~2.0.1"
+    readable-stream "~1.1.9"
+    typedarray "~0.0.5"
+
+console-browserify@^1.1.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/console-browserify/-/console-browserify-1.1.0.tgz#f0241c45730a9fc6323b206dbf38edc741d0bb10"
+  dependencies:
+    date-now "^0.1.4"
+
+console-browserify@~1.0.1:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/console-browserify/-/console-browserify-1.0.3.tgz#d3898d2c3a93102f364197f8874b4f92b5286a8e"
+
+constants-browserify@~0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/constants-browserify/-/constants-browserify-0.0.1.tgz#92577db527ba6c4cf0a4568d84bc031f441e21f2"
+
+convert-source-map@~0.3.0:
+  version "0.3.5"
+  resolved "https://registry.yarnpkg.com/convert-source-map/-/convert-source-map-0.3.5.tgz#f1d802950af7dd2631a1febe0596550c86ab3190"
+
+convert-source-map@~1.1.0:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/convert-source-map/-/convert-source-map-1.1.3.tgz#4829c877e9fe49b3161f3bf3673888e204699860"
+
+core-util-is@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/core-util-is/-/core-util-is-1.0.2.tgz#b5fd54220aa2bc5ab57aab7140c940754503c1a7"
+
+create-ecdh@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/create-ecdh/-/create-ecdh-4.0.0.tgz#888c723596cdf7612f6498233eebd7a35301737d"
+  dependencies:
+    bn.js "^4.1.0"
+    elliptic "^6.0.0"
+
+create-hash@^1.1.0, create-hash@^1.1.2:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/create-hash/-/create-hash-1.1.3.tgz#606042ac8b9262750f483caddab0f5819172d8fd"
+  dependencies:
+    cipher-base "^1.0.1"
+    inherits "^2.0.1"
+    ripemd160 "^2.0.0"
+    sha.js "^2.4.0"
+
+create-hmac@^1.1.0, create-hmac@^1.1.2, create-hmac@^1.1.4:
+  version "1.1.6"
+  resolved "https://registry.yarnpkg.com/create-hmac/-/create-hmac-1.1.6.tgz#acb9e221a4e17bdb076e90657c42b93e3726cf06"
+  dependencies:
+    cipher-base "^1.0.3"
+    create-hash "^1.1.0"
+    inherits "^2.0.1"
+    ripemd160 "^2.0.0"
+    safe-buffer "^5.0.1"
+    sha.js "^2.4.8"
+
+crypto-browserify@^3.0.0:
+  version "3.12.0"
+  resolved "https://registry.yarnpkg.com/crypto-browserify/-/crypto-browserify-3.12.0.tgz#396cf9f3137f03e4b8e532c58f698254e00f80ec"
+  dependencies:
+    browserify-cipher "^1.0.0"
+    browserify-sign "^4.0.0"
+    create-ecdh "^4.0.0"
+    create-hash "^1.1.0"
+    create-hmac "^1.1.0"
+    diffie-hellman "^5.0.0"
+    inherits "^2.0.1"
+    pbkdf2 "^3.0.3"
+    public-encrypt "^4.0.0"
+    randombytes "^2.0.0"
+    randomfill "^1.0.3"
+
+crypto-browserify@~1.0.9:
+  version "1.0.9"
+  resolved "https://registry.yarnpkg.com/crypto-browserify/-/crypto-browserify-1.0.9.tgz#cc5449685dfb85eb11c9828acc7cb87ab5bbfcc0"
+
+date-now@^0.1.4:
+  version "0.1.4"
+  resolved "https://registry.yarnpkg.com/date-now/-/date-now-0.1.4.tgz#eaf439fd4d4848ad74e5cc7dbef200672b9e345b"
+
+decamelize@^1.0.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/decamelize/-/decamelize-1.2.0.tgz#f6534d15148269b20352e7bee26f501f9a191290"
+
+deep-equal@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-0.0.0.tgz#99679d3bbd047156fcd450d3d01eeb9068691e83"
+
+deep-equal@~0.1.0:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-0.1.2.tgz#b246c2b80a570a47c11be1d9bd1070ec878b87ce"
+
+deep-equal@~1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-1.0.1.tgz#f5d260292b660e084eff4cdbc9f08ad3247448b5"
+
+define-properties@^1.1.2:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/define-properties/-/define-properties-1.1.2.tgz#83a73f2fea569898fb737193c8f873caf6d45c94"
+  dependencies:
+    foreach "^2.0.5"
+    object-keys "^1.0.8"
+
+defined@^1.0.0, defined@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/defined/-/defined-1.0.0.tgz#c98d9bcef75674188e110969151199e39b1fa693"
+
+defined@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/defined/-/defined-0.0.0.tgz#f35eea7d705e933baf13b2f03b3f83d921403b3e"
+
+deps-sort@^1.3.7:
+  version "1.3.9"
+  resolved "https://registry.yarnpkg.com/deps-sort/-/deps-sort-1.3.9.tgz#29dfff53e17b36aecae7530adbbbf622c2ed1a71"
+  dependencies:
+    JSONStream "^1.0.3"
+    shasum "^1.0.0"
+    subarg "^1.0.0"
+    through2 "^1.0.0"
+
+deps-sort@~0.1.1:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/deps-sort/-/deps-sort-0.1.2.tgz#daa2fb614a17c9637d801e2f55339ae370f3611a"
+  dependencies:
+    JSONStream "~0.6.4"
+    minimist "~0.0.1"
+    through "~2.3.4"
+
+derequire@~0.8.0:
+  version "0.8.0"
+  resolved "https://registry.yarnpkg.com/derequire/-/derequire-0.8.0.tgz#c1f7f1da2cede44adede047378f03f444e9c4c0d"
+  dependencies:
+    esprima-fb "^3001.1.0-dev-harmony-fb"
+    esrefactor "~0.1.0"
+    estraverse "~1.5.0"
+
+des.js@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/des.js/-/des.js-1.0.0.tgz#c074d2e2aa6a8a9a07dbd61f9a15c2cd83ec8ecc"
+  dependencies:
+    inherits "^2.0.1"
+    minimalistic-assert "^1.0.0"
+
+detective@^4.0.0:
+  version "4.7.1"
+  resolved "https://registry.yarnpkg.com/detective/-/detective-4.7.1.tgz#0eca7314338442febb6d65da54c10bb1c82b246e"
+  dependencies:
+    acorn "^5.2.1"
+    defined "^1.0.0"
+
+detective@~3.1.0:
+  version "3.1.0"
+  resolved "https://registry.yarnpkg.com/detective/-/detective-3.1.0.tgz#77782444ab752b88ca1be2e9d0a0395f1da25eed"
+  dependencies:
+    escodegen "~1.1.0"
+    esprima-fb "3001.1.0-dev-harmony-fb"
+
+diff@^2.2.1:
+  version "2.2.3"
+  resolved "https://registry.yarnpkg.com/diff/-/diff-2.2.3.tgz#60eafd0d28ee906e4e8ff0a52c1229521033bf99"
+
+diffie-hellman@^5.0.0:
+  version "5.0.2"
+  resolved "https://registry.yarnpkg.com/diffie-hellman/-/diffie-hellman-5.0.2.tgz#b5835739270cfe26acf632099fded2a07f209e5e"
+  dependencies:
+    bn.js "^4.1.0"
+    miller-rabin "^4.0.0"
+    randombytes "^2.0.0"
+
+domain-browser@~1.1.0:
+  version "1.1.7"
+  resolved "https://registry.yarnpkg.com/domain-browser/-/domain-browser-1.1.7.tgz#867aa4b093faa05f1de08c06f4d7b21fdf8698bc"
+
+duplexer2@0.0.2, duplexer2@~0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/duplexer2/-/duplexer2-0.0.2.tgz#c614dcf67e2fb14995a91711e5a617e8a60a31db"
+  dependencies:
+    readable-stream "~1.1.9"
+
+duplexer@^0.1.1, duplexer@~0.1.1:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/duplexer/-/duplexer-0.1.1.tgz#ace6ff808c1ce66b57d1ebf97977acb02334cfc1"
+
+ecstatic@~0.4.5:
+  version "0.4.13"
+  resolved "https://registry.yarnpkg.com/ecstatic/-/ecstatic-0.4.13.tgz#9cb6eaffe211b9c84efb3f553cde2c3002717b29"
+  dependencies:
+    ent "0.0.x"
+    mime "1.2.x"
+    optimist "~0.3.5"
+
+elliptic@^6.0.0:
+  version "6.4.0"
+  resolved "https://registry.yarnpkg.com/elliptic/-/elliptic-6.4.0.tgz#cac9af8762c85836187003c8dfe193e5e2eae5df"
+  dependencies:
+    bn.js "^4.4.0"
+    brorand "^1.0.1"
+    hash.js "^1.0.0"
+    hmac-drbg "^1.0.0"
+    inherits "^2.0.1"
+    minimalistic-assert "^1.0.0"
+    minimalistic-crypto-utils "^1.0.0"
+
+ent@0.0.x, ent@~0.0.5:
+  version "0.0.7"
+  resolved "https://registry.yarnpkg.com/ent/-/ent-0.0.7.tgz#835d4e7f9e7a8d4921c692e9010ec976da5e9949"
+
+es-abstract@^1.5.0:
+  version "1.10.0"
+  resolved "https://registry.yarnpkg.com/es-abstract/-/es-abstract-1.10.0.tgz#1ecb36c197842a00d8ee4c2dfd8646bb97d60864"
+  dependencies:
+    es-to-primitive "^1.1.1"
+    function-bind "^1.1.1"
+    has "^1.0.1"
+    is-callable "^1.1.3"
+    is-regex "^1.0.4"
+
+es-to-primitive@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/es-to-primitive/-/es-to-primitive-1.1.1.tgz#45355248a88979034b6792e19bb81f2b7975dd0d"
+  dependencies:
+    is-callable "^1.1.1"
+    is-date-object "^1.0.1"
+    is-symbol "^1.0.1"
+
+escape-string-regexp@^1.0.2, escape-string-regexp@^1.0.5:
+  version "1.0.5"
+  resolved "https://registry.yarnpkg.com/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz#1b61c0562190a8dff6ae3bb2cf0200ca130b86d4"
+
+escodegen@~1.1.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/escodegen/-/escodegen-1.1.0.tgz#c663923f6e20aad48d0c0fa49f31c6d4f49360cf"
+  dependencies:
+    esprima "~1.0.4"
+    estraverse "~1.5.0"
+    esutils "~1.0.0"
+  optionalDependencies:
+    source-map "~0.1.30"
+
+escope@~0.0.13:
+  version "0.0.16"
+  resolved "https://registry.yarnpkg.com/escope/-/escope-0.0.16.tgz#418c7a0afca721dafe659193fd986283e746538f"
+  dependencies:
+    estraverse ">= 0.0.2"
+
+esprima-fb@3001.1.0-dev-harmony-fb, esprima-fb@^3001.1.0-dev-harmony-fb:
+  version "3001.1.0-dev-harmony-fb"
+  resolved "https://registry.yarnpkg.com/esprima-fb/-/esprima-fb-3001.0001.0000-dev-harmony-fb.tgz#b77d37abcd38ea0b77426bb8bc2922ce6b426411"
+
+esprima@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/esprima/-/esprima-4.0.0.tgz#4499eddcd1110e0b218bacf2fa7f7f59f55ca804"
+
+esprima@~1.0.2, esprima@~1.0.4:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/esprima/-/esprima-1.0.4.tgz#9f557e08fc3b4d26ece9dd34f8fbf476b62585ad"
+
+esrefactor@~0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/esrefactor/-/esrefactor-0.1.0.tgz#d142795a282339ab81e936b5b7a21b11bf197b13"
+  dependencies:
+    escope "~0.0.13"
+    esprima "~1.0.2"
+    estraverse "~0.0.4"
+
+"estraverse@>= 0.0.2":
+  version "4.2.0"
+  resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-4.2.0.tgz#0dee3fed31fcd469618ce7342099fc1afa0bdb13"
+
+estraverse@~0.0.4:
+  version "0.0.4"
+  resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-0.0.4.tgz#01a0932dfee574684a598af5a67c3bf9b6428db2"
+
+estraverse@~1.5.0:
+  version "1.5.1"
+  resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-1.5.1.tgz#867a3e8e58a9f84618afb6c2ddbcd916b7cbaf71"
+
+esutils@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/esutils/-/esutils-1.0.0.tgz#8151d358e20c8acc7fb745e7472c0025fe496570"
+
+events@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/events/-/events-1.0.2.tgz#75849dcfe93d10fb057c30055afdbd51d06a8e24"
+
+evp_bytestokey@^1.0.0, evp_bytestokey@^1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/evp_bytestokey/-/evp_bytestokey-1.0.3.tgz#7fcbdb198dc71959432efe13842684e0525acb02"
+  dependencies:
+    md5.js "^1.3.4"
+    safe-buffer "^5.1.1"
+
+figures@^1.4.0:
+  version "1.7.0"
+  resolved "https://registry.yarnpkg.com/figures/-/figures-1.7.0.tgz#cbe1e3affcf1cd44b80cadfed28dc793a9701d2e"
+  dependencies:
+    escape-string-regexp "^1.0.5"
+    object-assign "^4.1.0"
+
+foreach@^2.0.5:
+  version "2.0.5"
+  resolved "https://registry.yarnpkg.com/foreach/-/foreach-2.0.5.tgz#0bee005018aeb260d0a3af3ae658dd0136ec1b99"
+
+function-bind@^1.0.2, function-bind@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/function-bind/-/function-bind-1.1.1.tgz#a56899d3ea3c9bab874bb9773b7c5ede92f4895d"
+
+function-bind@~1.0.2:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/function-bind/-/function-bind-1.0.2.tgz#c2873b69c5e6d7cefae47d2555172926c8c2e05e"
+
+glob@^4.0.5:
+  version "4.5.3"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-4.5.3.tgz#c6cb73d3226c1efef04de3c56d012f03377ee15f"
+  dependencies:
+    inflight "^1.0.4"
+    inherits "2"
+    minimatch "^2.0.1"
+    once "^1.3.0"
+
+glob@~3.2.1, glob@~3.2.8:
+  version "3.2.11"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-3.2.11.tgz#4a973f635b9190f715d10987d5c00fd2815ebe3d"
+  dependencies:
+    inherits "2"
+    minimatch "0.3"
+
+glob@~5.0.3:
+  version "5.0.15"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-5.0.15.tgz#1bc936b9e02f4a603fcc222ecf7633d30b8b93b1"
+  dependencies:
+    inflight "^1.0.4"
+    inherits "2"
+    minimatch "2 || 3"
+    once "^1.3.0"
+    path-is-absolute "^1.0.0"
+
+has-ansi@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/has-ansi/-/has-ansi-2.0.0.tgz#34f5049ce1ecdf2b0649af3ef24e45ed35416d91"
+  dependencies:
+    ansi-regex "^2.0.0"
+
+has@^1.0.0, has@^1.0.1, has@~1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/has/-/has-1.0.1.tgz#8461733f538b0837c9361e39a9ab9e9704dc2f28"
+  dependencies:
+    function-bind "^1.0.2"
+
+hash-base@^2.0.0:
+  version "2.0.2"
+  resolved "https://registry.yarnpkg.com/hash-base/-/hash-base-2.0.2.tgz#66ea1d856db4e8a5470cadf6fce23ae5244ef2e1"
+  dependencies:
+    inherits "^2.0.1"
+
+hash-base@^3.0.0:
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/hash-base/-/hash-base-3.0.4.tgz#5fc8686847ecd73499403319a6b0a3f3f6ae4918"
+  dependencies:
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+hash.js@^1.0.0, hash.js@^1.0.3:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/hash.js/-/hash.js-1.1.3.tgz#340dedbe6290187151c1ea1d777a3448935df846"
+  dependencies:
+    inherits "^2.0.3"
+    minimalistic-assert "^1.0.0"
+
+headless@~0.1.3:
+  version "0.1.7"
+  resolved "https://registry.yarnpkg.com/headless/-/headless-0.1.7.tgz#6e62fae668947f88184d5c156ede7c5695a7e9c8"
+
+hirestime@^1.0.6:
+  version "1.0.7"
+  resolved "https://registry.yarnpkg.com/hirestime/-/hirestime-1.0.7.tgz#2d5271ea84356cec3f25da8c56a9402f8fc0a700"
+
+hmac-drbg@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/hmac-drbg/-/hmac-drbg-1.0.1.tgz#d2745701025a6c775a6c545793ed502fc0c649a1"
+  dependencies:
+    hash.js "^1.0.3"
+    minimalistic-assert "^1.0.0"
+    minimalistic-crypto-utils "^1.0.1"
+
+htmlescape@^1.1.0:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/htmlescape/-/htmlescape-1.1.1.tgz#3a03edc2214bca3b66424a3e7959349509cb0351"
+
+http-browserify@~1.3.1:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/http-browserify/-/http-browserify-1.3.2.tgz#b562c34479349a690d7a6597df495aefa8c604f5"
+  dependencies:
+    Base64 "~0.2.0"
+    inherits "~2.0.1"
+
+https-browserify@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/https-browserify/-/https-browserify-0.0.1.tgz#3f91365cabe60b77ed0ebba24b454e3e09d95a82"
+
+ieee754@^1.1.4, ieee754@~1.1.1:
+  version "1.1.8"
+  resolved "https://registry.yarnpkg.com/ieee754/-/ieee754-1.1.8.tgz#be33d40ac10ef1926701f6f08a2d86fbfd1ad3e4"
+
+indexof@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/indexof/-/indexof-0.0.1.tgz#82dc336d232b9062179d05ab3293a66059fd435d"
+
+inflight@^1.0.4:
+  version "1.0.6"
+  resolved "https://registry.yarnpkg.com/inflight/-/inflight-1.0.6.tgz#49bd6331d7d02d0c09bc910a1075ba8165b56df9"
+  dependencies:
+    once "^1.3.0"
+    wrappy "1"
+
+inherits@2, inherits@^2.0.1, inherits@^2.0.3, inherits@~2.0.1, inherits@~2.0.3:
+  version "2.0.3"
+  resolved "https://registry.yarnpkg.com/inherits/-/inherits-2.0.3.tgz#633c2c83e3da42a502f52466022480f4208261de"
+
+inherits@2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/inherits/-/inherits-2.0.1.tgz#b17d08d326b4423e568eff719f91b0b1cbdf69f1"
+
+inline-source-map@~0.3.0:
+  version "0.3.1"
+  resolved "https://registry.yarnpkg.com/inline-source-map/-/inline-source-map-0.3.1.tgz#a528b514e689fce90db3089e870d92f527acb5eb"
+  dependencies:
+    source-map "~0.3.0"
+
+inline-source-map@~0.5.0:
+  version "0.5.0"
+  resolved "https://registry.yarnpkg.com/inline-source-map/-/inline-source-map-0.5.0.tgz#4a4c5dd8e4fb5e9b3cda60c822dfadcaee66e0af"
+  dependencies:
+    source-map "~0.4.0"
+
+insert-module-globals@^6.4.1:
+  version "6.6.3"
+  resolved "https://registry.yarnpkg.com/insert-module-globals/-/insert-module-globals-6.6.3.tgz#20638e29a30f9ed1ca2e3a825fbc2cba5246ddfc"
+  dependencies:
+    JSONStream "^1.0.3"
+    combine-source-map "~0.6.1"
+    concat-stream "~1.4.1"
+    is-buffer "^1.1.0"
+    lexical-scope "^1.2.0"
+    process "~0.11.0"
+    through2 "^1.0.0"
+    xtend "^4.0.0"
+
+insert-module-globals@~6.0.0:
+  version "6.0.0"
+  resolved "https://registry.yarnpkg.com/insert-module-globals/-/insert-module-globals-6.0.0.tgz#ee8aeb9dee16819e33aa14588a558824af0c15dc"
+  dependencies:
+    JSONStream "~0.7.1"
+    concat-stream "~1.4.1"
+    lexical-scope "~1.1.0"
+    process "~0.6.0"
+    through "~2.3.4"
+    xtend "^3.0.0"
+
+is-buffer@^1.1.0:
+  version "1.1.6"
+  resolved "https://registry.yarnpkg.com/is-buffer/-/is-buffer-1.1.6.tgz#efaa2ea9daa0d7ab2ea13a97b2b8ad51fefbe8be"
+
+is-callable@^1.1.1, is-callable@^1.1.3:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/is-callable/-/is-callable-1.1.3.tgz#86eb75392805ddc33af71c92a0eedf74ee7604b2"
+
+is-date-object@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/is-date-object/-/is-date-object-1.0.1.tgz#9aa20eb6aeebbff77fbd33e74ca01b33581d3a16"
+
+is-finite@^1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/is-finite/-/is-finite-1.0.2.tgz#cc6677695602be550ef11e8b4aa6305342b6d0aa"
+  dependencies:
+    number-is-nan "^1.0.0"
+
+is-regex@^1.0.4:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/is-regex/-/is-regex-1.0.4.tgz#5517489b547091b0930e095654ced25ee97e9491"
+  dependencies:
+    has "^1.0.1"
+
+is-symbol@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/is-symbol/-/is-symbol-1.0.1.tgz#3cc59f00025194b6ab2e38dbae6689256b660572"
+
+isarray@0.0.1, isarray@~0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/isarray/-/isarray-0.0.1.tgz#8a18acfca9a8f4177e09abfc6038939b05d1eedf"
+
+isarray@^1.0.0, isarray@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/isarray/-/isarray-1.0.0.tgz#bb935d48582cba168c06834957a54a3e07124f11"
+
+js-yaml@^3.4.6:
+  version "3.10.0"
+  resolved "https://registry.yarnpkg.com/js-yaml/-/js-yaml-3.10.0.tgz#2e78441646bd4682e963f22b6e92823c309c62dc"
+  dependencies:
+    argparse "^1.0.7"
+    esprima "^4.0.0"
+
+json-stable-stringify@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/json-stable-stringify/-/json-stable-stringify-0.0.1.tgz#611c23e814db375527df851193db59dd2af27f45"
+  dependencies:
+    jsonify "~0.0.0"
+
+jsonify@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/jsonify/-/jsonify-0.0.0.tgz#2c74b6ee41d93ca51b7b5aaee8f503631d252a73"
+
+jsonparse@0.0.5:
+  version "0.0.5"
+  resolved "https://registry.yarnpkg.com/jsonparse/-/jsonparse-0.0.5.tgz#330542ad3f0a654665b778f3eb2d9a9fa507ac64"
+
+jsonparse@^1.2.0:
+  version "1.3.1"
+  resolved "https://registry.yarnpkg.com/jsonparse/-/jsonparse-1.3.1.tgz#3f4dae4a91fac315f71062f8521cc239f1366280"
+
+labeled-stream-splicer@^1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/labeled-stream-splicer/-/labeled-stream-splicer-1.0.2.tgz#4615331537784981e8fd264e1f3a434c4e0ddd65"
+  dependencies:
+    inherits "^2.0.1"
+    isarray "~0.0.1"
+    stream-splicer "^1.1.0"
+
+lexical-scope@^1.2.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/lexical-scope/-/lexical-scope-1.2.0.tgz#fcea5edc704a4b3a8796cdca419c3a0afaf22df4"
+  dependencies:
+    astw "^2.0.0"
+
+lexical-scope@~1.1.0:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/lexical-scope/-/lexical-scope-1.1.1.tgz#debac1067435f1359d90fcfd9e94bcb2ee47b2bf"
+  dependencies:
+    astw "^2.0.0"
+
+lodash.memoize@~3.0.3:
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/lodash.memoize/-/lodash.memoize-3.0.4.tgz#2dcbd2c287cbc0a55cc42328bd0c736150d53e3f"
+
+lru-cache@2:
+  version "2.7.3"
+  resolved "https://registry.yarnpkg.com/lru-cache/-/lru-cache-2.7.3.tgz#6d4524e8b955f95d4f5b58851ce21dd72fb4e952"
+
+md5.js@^1.3.4:
+  version "1.3.4"
+  resolved "https://registry.yarnpkg.com/md5.js/-/md5.js-1.3.4.tgz#e9bdbde94a20a5ac18b04340fc5764d5b09d901d"
+  dependencies:
+    hash-base "^3.0.0"
+    inherits "^2.0.1"
+
+merge@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/merge/-/merge-1.0.0.tgz#b443ab46d837c491e6222056ab0f7933ecb3568f"
+
+miller-rabin@^4.0.0:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/miller-rabin/-/miller-rabin-4.0.1.tgz#f080351c865b0dc562a8462966daa53543c78a4d"
+  dependencies:
+    bn.js "^4.0.0"
+    brorand "^1.0.1"
+
+mime@1.2.x:
+  version "1.2.11"
+  resolved "https://registry.yarnpkg.com/mime/-/mime-1.2.11.tgz#58203eed86e3a5ef17aed2b7d9ebd47f0a60dd10"
+
+minimalistic-assert@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/minimalistic-assert/-/minimalistic-assert-1.0.0.tgz#702be2dda6b37f4836bcb3f5db56641b64a1d3d3"
+
+minimalistic-crypto-utils@^1.0.0, minimalistic-crypto-utils@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/minimalistic-crypto-utils/-/minimalistic-crypto-utils-1.0.1.tgz#f6c00c1c0b082246e5c4d99dfb8c7c083b2b582a"
+
+minimatch@0.3:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-0.3.0.tgz#275d8edaac4f1bb3326472089e7949c8394699dd"
+  dependencies:
+    lru-cache "2"
+    sigmund "~1.0.0"
+
+"minimatch@2 || 3":
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-3.0.4.tgz#5166e286457f03306064be5497e8dbb0c3d32083"
+  dependencies:
+    brace-expansion "^1.1.7"
+
+minimatch@^2.0.1:
+  version "2.0.10"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-2.0.10.tgz#8d087c39c6b38c001b97fca7ce6d0e1e80afbac7"
+  dependencies:
+    brace-expansion "^1.0.0"
+
+minimist@0.0.5:
+  version "0.0.5"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-0.0.5.tgz#d7aa327bcecf518f9106ac6b8f003fa3bcea8566"
+
+minimist@^1.1.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-1.2.0.tgz#a35008b20f41383eec1fb914f4cd5df79a264284"
+
+minimist@~0.0.1, minimist@~0.0.7, minimist@~0.0.9:
+  version "0.0.10"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-0.0.10.tgz#de3f98543dbf96082be48ad1a0c7cda836301dcf"
+
+mkdirp@~0.3.3:
+  version "0.3.5"
+  resolved "https://registry.yarnpkg.com/mkdirp/-/mkdirp-0.3.5.tgz#de3e5f8961c88c787ee1368df849ac4413eca8d7"
+
+module-deps@^3.7.11:
+  version "3.9.1"
+  resolved "https://registry.yarnpkg.com/module-deps/-/module-deps-3.9.1.tgz#ea75caf9199090d25b0d5512b5acacb96e7f87f3"
+  dependencies:
+    JSONStream "^1.0.3"
+    browser-resolve "^1.7.0"
+    concat-stream "~1.4.5"
+    defined "^1.0.0"
+    detective "^4.0.0"
+    duplexer2 "0.0.2"
+    inherits "^2.0.1"
+    parents "^1.0.0"
+    readable-stream "^1.1.13"
+    resolve "^1.1.3"
+    stream-combiner2 "~1.0.0"
+    subarg "^1.0.0"
+    through2 "^1.0.0"
+    xtend "^4.0.0"
+
+module-deps@~2.0.0:
+  version "2.0.6"
+  resolved "https://registry.yarnpkg.com/module-deps/-/module-deps-2.0.6.tgz#b999321c73ac33580f00712c0f3075fdca42563f"
+  dependencies:
+    JSONStream "~0.7.1"
+    browser-resolve "~1.2.4"
+    concat-stream "~1.4.5"
+    detective "~3.1.0"
+    duplexer2 "0.0.2"
+    inherits "~2.0.1"
+    minimist "~0.0.9"
+    parents "0.0.2"
+    readable-stream "^1.0.27-1"
+    resolve "~0.6.3"
+    stream-combiner "~0.1.0"
+    through2 "~0.4.1"
+
+number-is-nan@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/number-is-nan/-/number-is-nan-1.0.1.tgz#097b602b53422a522c1afb8790318336941a011d"
+
+object-assign@^4.1.0:
+  version "4.1.1"
+  resolved "https://registry.yarnpkg.com/object-assign/-/object-assign-4.1.1.tgz#2109adc7965887cfc05cbbd442cac8bfbb360863"
+
+object-inspect@~0.1.3:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/object-inspect/-/object-inspect-0.1.3.tgz#d05a65c2e34fe8225d9fda2e484e4e47b7e2f490"
+  dependencies:
+    tape "~1.0.4"
+
+object-inspect@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/object-inspect/-/object-inspect-1.0.2.tgz#a97885b553e575eb4009ebc09bdda9b1cd21979a"
+
+object-keys@^1.0.4, object-keys@^1.0.8:
+  version "1.0.11"
+  resolved "https://registry.yarnpkg.com/object-keys/-/object-keys-1.0.11.tgz#c54601778ad560f1142ce0e01bcca8b56d13426d"
+
+object-keys@~0.4.0:
+  version "0.4.0"
+  resolved "https://registry.yarnpkg.com/object-keys/-/object-keys-0.4.0.tgz#28a6aae7428dd2c3a92f3d95f21335dd204e0336"
+
+once@^1.3.0:
+  version "1.4.0"
+  resolved "https://registry.yarnpkg.com/once/-/once-1.4.0.tgz#583b1aa775961d4b113ac17d9c50baef9dd76bd1"
+  dependencies:
+    wrappy "1"
+
+optimist@~0.3.5:
+  version "0.3.7"
+  resolved "https://registry.yarnpkg.com/optimist/-/optimist-0.3.7.tgz#c90941ad59e4273328923074d2cf2e7cbc6ec0d9"
+  dependencies:
+    wordwrap "~0.0.2"
+
+optimist@~0.5.2:
+  version "0.5.2"
+  resolved "https://registry.yarnpkg.com/optimist/-/optimist-0.5.2.tgz#85c8c1454b3315e4a78947e857b1df033450bfbc"
+  dependencies:
+    wordwrap "~0.0.2"
+
+ordered-emitter@~0.1.0:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/ordered-emitter/-/ordered-emitter-0.1.1.tgz#aa20bdafbdcc1631834a350f68b4ef8eb34eed7b"
+
+os-browserify@~0.1.1:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/os-browserify/-/os-browserify-0.1.2.tgz#49ca0293e0b19590a5f5de10c7f265a617d8fe54"
+
+pako@~0.2.0:
+  version "0.2.9"
+  resolved "https://registry.yarnpkg.com/pako/-/pako-0.2.9.tgz#f3f7522f4ef782348da8161bad9ecfd51bf83a75"
+
+parents@0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/parents/-/parents-0.0.2.tgz#67147826e497d40759aaf5ba4c99659b6034d302"
+
+parents@^1.0.0, parents@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/parents/-/parents-1.0.1.tgz#fedd4d2bf193a77745fe71e371d73c3307d9c751"
+  dependencies:
+    path-platform "~0.11.15"
+
+parents@~0.0.1:
+  version "0.0.3"
+  resolved "https://registry.yarnpkg.com/parents/-/parents-0.0.3.tgz#fa212f024d9fa6318dbb6b4ce676c8be493b9c43"
+  dependencies:
+    path-platform "^0.0.1"
+
+parse-asn1@^5.0.0:
+  version "5.1.0"
+  resolved "https://registry.yarnpkg.com/parse-asn1/-/parse-asn1-5.1.0.tgz#37c4f9b7ed3ab65c74817b5f2480937fbf97c712"
+  dependencies:
+    asn1.js "^4.0.0"
+    browserify-aes "^1.0.0"
+    create-hash "^1.1.0"
+    evp_bytestokey "^1.0.0"
+    pbkdf2 "^3.0.3"
+
+parse-ms@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/parse-ms/-/parse-ms-1.0.1.tgz#56346d4749d78f23430ca0c713850aef91aa361d"
+
+path-browserify@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/path-browserify/-/path-browserify-0.0.0.tgz#a0b870729aae214005b7d5032ec2cbbb0fb4451a"
+
+path-is-absolute@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/path-is-absolute/-/path-is-absolute-1.0.1.tgz#174b9268735534ffbc7ace6bf53a5a9e1b5c5f5f"
+
+path-parse@^1.0.5:
+  version "1.0.5"
+  resolved "https://registry.yarnpkg.com/path-parse/-/path-parse-1.0.5.tgz#3c1adf871ea9cd6c9431b6ea2bd74a0ff055c4c1"
+
+path-platform@^0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/path-platform/-/path-platform-0.0.1.tgz#b5585d7c3c463d89aa0060d86611cf1afd617e2a"
+
+path-platform@~0.11.15:
+  version "0.11.15"
+  resolved "https://registry.yarnpkg.com/path-platform/-/path-platform-0.11.15.tgz#e864217f74c36850f0852b78dc7bf7d4a5721bf2"
+
+pbkdf2@^3.0.3:
+  version "3.0.14"
+  resolved "https://registry.yarnpkg.com/pbkdf2/-/pbkdf2-3.0.14.tgz#a35e13c64799b06ce15320f459c230e68e73bade"
+  dependencies:
+    create-hash "^1.1.2"
+    create-hmac "^1.1.4"
+    ripemd160 "^2.0.1"
+    safe-buffer "^5.0.1"
+    sha.js "^2.4.8"
+
+plist@0.2.1:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/plist/-/plist-0.2.1.tgz#f3a3de07885d773e66d8a96782f1bec28cf2b2d0"
+  dependencies:
+    sax "0.1.x"
+
+plur@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/plur/-/plur-1.0.0.tgz#db85c6814f5e5e5a3b49efc28d604fec62975156"
+
+pretty-ms@^2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/pretty-ms/-/pretty-ms-2.1.0.tgz#4257c256df3fb0b451d6affaab021884126981dc"
+  dependencies:
+    is-finite "^1.0.1"
+    parse-ms "^1.0.0"
+    plur "^1.0.0"
+
+process-nextick-args@~2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/process-nextick-args/-/process-nextick-args-2.0.0.tgz#a37d732f4271b4ab1ad070d35508e8290788ffaa"
+
+process@^0.7.0:
+  version "0.7.0"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.7.0.tgz#c52208161a34adf3812344ae85d3e6150469389d"
+
+process@~0.11.0:
+  version "0.11.10"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.11.10.tgz#7332300e840161bda3e69a1d1d91a7d4bc16f182"
+
+process@~0.5.1:
+  version "0.5.2"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.5.2.tgz#1638d8a8e34c2f440a91db95ab9aeb677fc185cf"
+
+process@~0.6.0:
+  version "0.6.0"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.6.0.tgz#7dd9be80ffaaedd4cb628f1827f1cbab6dc0918f"
+
+public-encrypt@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/public-encrypt/-/public-encrypt-4.0.0.tgz#39f699f3a46560dd5ebacbca693caf7c65c18cc6"
+  dependencies:
+    bn.js "^4.1.0"
+    browserify-rsa "^4.0.0"
+    create-hash "^1.1.0"
+    parse-asn1 "^5.0.0"
+    randombytes "^2.0.1"
+
+punycode@1.3.2:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/punycode/-/punycode-1.3.2.tgz#9653a036fb7c1ee42342f2325cceefea3926c48d"
+
+punycode@^1.3.2:
+  version "1.4.1"
+  resolved "https://registry.yarnpkg.com/punycode/-/punycode-1.4.1.tgz#c0d5a63b2718800ad8e1eb0fa5269c84dd41845e"
+
+punycode@~1.2.3:
+  version "1.2.4"
+  resolved "https://registry.yarnpkg.com/punycode/-/punycode-1.2.4.tgz#54008ac972aec74175def9cba6df7fa9d3918740"
+
+querystring-es3@0.2.0:
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/querystring-es3/-/querystring-es3-0.2.0.tgz#c365a08a69c443accfeb3a9deab35e3f0abaa476"
+
+querystring-es3@~0.2.0:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/querystring-es3/-/querystring-es3-0.2.1.tgz#9ec61f79049875707d69414596fd907a4d711e73"
+
+querystring@0.2.0:
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/querystring/-/querystring-0.2.0.tgz#b209849203bb25df820da756e747005878521620"
+
+ramda@^0.18.0:
+  version "0.18.0"
+  resolved "https://registry.yarnpkg.com/ramda/-/ramda-0.18.0.tgz#c6e3c5d4b9ab1f7906727fdeeb039152a85d4db3"
+
+randombytes@^2.0.0, randombytes@^2.0.1, randombytes@^2.0.5:
+  version "2.0.6"
+  resolved "https://registry.yarnpkg.com/randombytes/-/randombytes-2.0.6.tgz#d302c522948588848a8d300c932b44c24231da80"
+  dependencies:
+    safe-buffer "^5.1.0"
+
+randomfill@^1.0.3:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/randomfill/-/randomfill-1.0.4.tgz#c92196fc86ab42be983f1bf31778224931d61458"
+  dependencies:
+    randombytes "^2.0.5"
+    safe-buffer "^5.1.0"
+
+read-only-stream@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/read-only-stream/-/read-only-stream-1.1.1.tgz#5da77c799ed1388d3ef88a18471bb5924f8a0ba1"
+  dependencies:
+    readable-stream "^1.0.31"
+    readable-wrap "^1.0.0"
+
+"readable-stream@>=1.1.13-1 <1.2.0-0", readable-stream@^1.0.27-1, readable-stream@^1.0.31, readable-stream@^1.1.13, readable-stream@^1.1.13-1, readable-stream@~1.1.9:
+  version "1.1.14"
+  resolved "https://registry.yarnpkg.com/readable-stream/-/readable-stream-1.1.14.tgz#7cf4c54ef648e3813084c636dd2079e166c081d9"
+  dependencies:
+    core-util-is "~1.0.0"
+    inherits "~2.0.1"
+    isarray "0.0.1"
+    string_decoder "~0.10.x"
+
+readable-stream@^2.0.2, readable-stream@^2.0.4:
+  version "2.3.4"
+  resolved "https://registry.yarnpkg.com/readable-stream/-/readable-stream-2.3.4.tgz#c946c3f47fa7d8eabc0b6150f4a12f69a4574071"
+  dependencies:
+    core-util-is "~1.0.0"
+    inherits "~2.0.3"
+    isarray "~1.0.0"
+    process-nextick-args "~2.0.0"
+    safe-buffer "~5.1.1"
+    string_decoder "~1.0.3"
+    util-deprecate "~1.0.1"
+
+readable-stream@~1.0.17:
+  version "1.0.34"
+  resolved "https://registry.yarnpkg.com/readable-stream/-/readable-stream-1.0.34.tgz#125820e34bc842d2f2aaafafe4c2916ee32c157c"
+  dependencies:
+    core-util-is "~1.0.0"
+    inherits "~2.0.1"
+    isarray "0.0.1"
+    string_decoder "~0.10.x"
+
+readable-wrap@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/readable-wrap/-/readable-wrap-1.0.0.tgz#3b5a211c631e12303a54991c806c17e7ae206bff"
+  dependencies:
+    readable-stream "^1.1.13-1"
+
+resolve@0.6.3, resolve@~0.6.1, resolve@~0.6.3:
+  version "0.6.3"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-0.6.3.tgz#dd957982e7e736debdf53b58a4dd91754575dd46"
+
+resolve@1.1.7:
+  version "1.1.7"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.1.7.tgz#203114d82ad2c5ed9e8e0411b3932875e889e97b"
+
+resolve@^1.1.3, resolve@^1.1.4:
+  version "1.5.0"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.5.0.tgz#1f09acce796c9a762579f31b2c1cc4c3cddf9f36"
+  dependencies:
+    path-parse "^1.0.5"
+
+resolve@~0.3.0:
+  version "0.3.1"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-0.3.1.tgz#34c63447c664c70598d1c9b126fc43b2a24310a4"
+
+resolve@~0.4.0:
+  version "0.4.3"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-0.4.3.tgz#dcadad202e7cacc2467e3a38800211f42f9c13df"
+
+resumer@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/resumer/-/resumer-0.0.0.tgz#f1e8f461e4064ba39e82af3cdc2a8c893d076759"
+  dependencies:
+    through "~2.3.4"
+
+rfile@~1.0, rfile@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/rfile/-/rfile-1.0.0.tgz#59708cf90ca1e74c54c3cfc5c36fdb9810435261"
+  dependencies:
+    callsite "~1.0.0"
+    resolve "~0.3.0"
+
+ripemd160@^2.0.0, ripemd160@^2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/ripemd160/-/ripemd160-2.0.1.tgz#0f4584295c53a3628af7e6d79aca21ce57d1c6e7"
+  dependencies:
+    hash-base "^2.0.0"
+    inherits "^2.0.1"
+
+ruglify@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/ruglify/-/ruglify-1.0.0.tgz#dc8930e2a9544a274301cc9972574c0d0986b675"
+  dependencies:
+    rfile "~1.0"
+    uglify-js "~2.2"
+
+rx-node@^1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/rx-node/-/rx-node-1.0.2.tgz#151240725a79e857360ab06cc626799965e094de"
+  dependencies:
+    rx "*"
+
+rx@*, rx@^4.0.7:
+  version "4.1.0"
+  resolved "https://registry.yarnpkg.com/rx/-/rx-4.1.0.tgz#a5f13ff79ef3b740fe30aa803fb09f98805d4782"
+
+safe-buffer@^5.0.1, safe-buffer@^5.1.0, safe-buffer@^5.1.1, safe-buffer@~5.1.0, safe-buffer@~5.1.1:
+  version "5.1.1"
+  resolved "https://registry.yarnpkg.com/safe-buffer/-/safe-buffer-5.1.1.tgz#893312af69b2123def71f57889001671eeb2c853"
+
+sax@0.1.x:
+  version "0.1.5"
+  resolved "https://registry.yarnpkg.com/sax/-/sax-0.1.5.tgz#d1829a6120fa01665eb4dbff6c43f29fd6d61471"
+
+sha.js@^2.4.0, sha.js@^2.4.8, sha.js@~2.4.4:
+  version "2.4.10"
+  resolved "https://registry.yarnpkg.com/sha.js/-/sha.js-2.4.10.tgz#b1fde5cd7d11a5626638a07c604ab909cfa31f9b"
+  dependencies:
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+shallow-copy@0.0.1, shallow-copy@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/shallow-copy/-/shallow-copy-0.0.1.tgz#415f42702d73d810330292cc5ee86eae1a11a170"
+
+shasum@^1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/shasum/-/shasum-1.0.2.tgz#e7012310d8f417f4deb5712150e5678b87ae565f"
+  dependencies:
+    json-stable-stringify "~0.0.0"
+    sha.js "~2.4.4"
+
+shell-quote@~0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/shell-quote/-/shell-quote-0.0.1.tgz#1a41196f3c0333c482323593d6886ecf153dd986"
+
+shell-quote@~1.3.1:
+  version "1.3.3"
+  resolved "https://registry.yarnpkg.com/shell-quote/-/shell-quote-1.3.3.tgz#07b8826f427c052511e8b5627639e172596e8e4b"
+
+sigmund@~1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/sigmund/-/sigmund-1.0.1.tgz#3ff21f198cad2175f9f3b781853fd94d0d19b590"
+
+source-map@0.1.34:
+  version "0.1.34"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.1.34.tgz#a7cfe89aec7b1682c3b198d0acfb47d7d090566b"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.1.30, source-map@~0.1.31, source-map@~0.1.7:
+  version "0.1.43"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.1.43.tgz#c24bc146ca517c1471f5dacbe2571b2b7f9e3346"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.3.0:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.3.0.tgz#8586fb9a5a005e5b501e21cd18b6f21b457ad1f9"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.4.0, source-map@~0.4.2:
+  version "0.4.4"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.4.4.tgz#eba4f5da9c0dc999de68032d8b4f76173652036b"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.5.1:
+  version "0.5.7"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.5.7.tgz#8a039d2d1021d22d1ea14c80d8ea468ba2ef3fcc"
+
+split@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/split/-/split-1.0.1.tgz#605bd9be303aa59fb35f9229fbea0ddec9ea07d9"
+  dependencies:
+    through "2"
+
+split@~0.1.2:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/split/-/split-0.1.2.tgz#f0710744c453d551fc7143ead983da6014e336cc"
+  dependencies:
+    through "1"
+
+sprintf-js@~1.0.2:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/sprintf-js/-/sprintf-js-1.0.3.tgz#04e6926f662895354f3dd015203633b857297e2c"
+
+stream-browserify@^2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/stream-browserify/-/stream-browserify-2.0.1.tgz#66266ee5f9bdb9940a4e4514cafb43bb71e5c9db"
+  dependencies:
+    inherits "~2.0.1"
+    readable-stream "^2.0.2"
+
+stream-browserify@~0.1.0:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/stream-browserify/-/stream-browserify-0.1.3.tgz#95cf1b369772e27adaf46352265152689c6c4be9"
+  dependencies:
+    inherits "~2.0.1"
+    process "~0.5.1"
+
+stream-combiner2@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/stream-combiner2/-/stream-combiner2-1.0.2.tgz#ba72a6b50cbfabfa950fc8bc87604bd01eb60671"
+  dependencies:
+    duplexer2 "~0.0.2"
+    through2 "~0.5.1"
+
+stream-combiner@~0.0.2:
+  version "0.0.4"
+  resolved "https://registry.yarnpkg.com/stream-combiner/-/stream-combiner-0.0.4.tgz#4d5e433c185261dde623ca3f44c586bcf5c4ad14"
+  dependencies:
+    duplexer "~0.1.1"
+
+stream-combiner@~0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/stream-combiner/-/stream-combiner-0.1.0.tgz#0dc389a3c203f8f4d56368f95dde52eb9269b5be"
+  dependencies:
+    duplexer "~0.1.1"
+    through "~2.3.4"
+
+stream-http@^1.2.0:
+  version "1.7.1"
+  resolved "https://registry.yarnpkg.com/stream-http/-/stream-http-1.7.1.tgz#d3d2a6e14c36a38b9dafb199aee7bbc570519978"
+  dependencies:
+    builtin-status-codes "^1.0.0"
+    foreach "^2.0.5"
+    indexof "0.0.1"
+    inherits "^2.0.1"
+    object-keys "^1.0.4"
+    xtend "^4.0.0"
+
+stream-splicer@^1.1.0:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/stream-splicer/-/stream-splicer-1.3.2.tgz#3c0441be15b9bf4e226275e6dc83964745546661"
+  dependencies:
+    indexof "0.0.1"
+    inherits "^2.0.1"
+    isarray "~0.0.1"
+    readable-stream "^1.1.13-1"
+    readable-wrap "^1.0.0"
+    through2 "^1.0.0"
+
+string.prototype.trim@^1.1.1:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/string.prototype.trim/-/string.prototype.trim-1.1.2.tgz#d04de2c89e137f4d7d206f086b5ed2fae6be8cea"
+  dependencies:
+    define-properties "^1.1.2"
+    es-abstract "^1.5.0"
+    function-bind "^1.0.2"
+
+string_decoder@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/string_decoder/-/string_decoder-0.0.1.tgz#f5472d0a8d1650ec823752d24e6fd627b39bf141"
+
+string_decoder@~0.10.0, string_decoder@~0.10.x:
+  version "0.10.31"
+  resolved "https://registry.yarnpkg.com/string_decoder/-/string_decoder-0.10.31.tgz#62e203bc41766c6c28c9fc84301dab1c5310fa94"
+
+string_decoder@~1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/string_decoder/-/string_decoder-1.0.3.tgz#0fc67d7c141825de94282dd536bec6b9bce860ab"
+  dependencies:
+    safe-buffer "~5.1.0"
+
+strip-ansi@^3.0.0:
+  version "3.0.1"
+  resolved "https://registry.yarnpkg.com/strip-ansi/-/strip-ansi-3.0.1.tgz#6a385fb8853d952d5ff05d0e8aaf94278dc63dcf"
+  dependencies:
+    ansi-regex "^2.0.0"
+
+subarg@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/subarg/-/subarg-0.0.1.tgz#3d56b07dacfbc45bbb63f7672b43b63e46368e3a"
+  dependencies:
+    minimist "~0.0.7"
+
+subarg@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/subarg/-/subarg-1.0.0.tgz#f62cf17581e996b48fc965699f54c06ae268b8d2"
+  dependencies:
+    minimist "^1.1.0"
+
+supports-color@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/supports-color/-/supports-color-2.0.0.tgz#535d045ce6b6363fa40117084629995e9df324c7"
+
+syntax-error@^1.1.1:
+  version "1.4.0"
+  resolved "https://registry.yarnpkg.com/syntax-error/-/syntax-error-1.4.0.tgz#2d9d4ff5c064acb711594a3e3b95054ad51d907c"
+  dependencies:
+    acorn-node "^1.2.0"
+
+syntax-error@~1.1.0:
+  version "1.1.6"
+  resolved "https://registry.yarnpkg.com/syntax-error/-/syntax-error-1.1.6.tgz#b4549706d386cc1c1dc7c2423f18579b6cade710"
+  dependencies:
+    acorn "^2.7.0"
+
+tap-finished@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/tap-finished/-/tap-finished-0.0.1.tgz#08b5b543fdc04830290c6c561279552e71c4bd67"
+  dependencies:
+    tap-parser "~0.2.0"
+    through "~2.3.4"
+
+tap-parser@~0.2.0:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/tap-parser/-/tap-parser-0.2.1.tgz#8e1e823f2114ee21d032e2f31e4fb642a296f50b"
+  dependencies:
+    split "~0.1.2"
+
+tape@4.2.1:
+  version "4.2.1"
+  resolved "https://registry.yarnpkg.com/tape/-/tape-4.2.1.tgz#1a0ed63cc86bfaa84ebb3bb311f09d8520416216"
+  dependencies:
+    deep-equal "~1.0.0"
+    defined "~1.0.0"
+    function-bind "~1.0.2"
+    glob "~5.0.3"
+    has "~1.0.1"
+    inherits "~2.0.1"
+    object-inspect "~1.0.0"
+    resumer "~0.0.0"
+    string.prototype.trim "^1.1.1"
+    through "~2.3.4"
+
+tape@~1.0.4:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/tape/-/tape-1.0.4.tgz#e2e8e5c6dd3f00fdc2a5e4514f62fc221e59f9c4"
+  dependencies:
+    deep-equal "~0.0.0"
+    defined "~0.0.0"
+    jsonify "~0.0.0"
+    through "~2.3.4"
+
+testling@1.7.1:
+  version "1.7.1"
+  resolved "https://registry.yarnpkg.com/testling/-/testling-1.7.1.tgz#bfcfa877c8b15dd28d920692c03d8d64ca47874e"
+  dependencies:
+    bouncy "~3.2.0"
+    browser-launcher "~0.3.2"
+    browserify "3.x.x"
+    concat-stream "~1.0.0"
+    ecstatic "~0.4.5"
+    ent "~0.0.5"
+    glob "~3.2.1"
+    jsonify "~0.0.0"
+    object-inspect "~0.1.3"
+    optimist "~0.5.2"
+    resolve "~0.4.0"
+    shallow-copy "~0.0.0"
+    shell-quote "~1.3.1"
+    tap-finished "~0.0.0"
+    win-spawn "~2.0.0"
+    xhr-write-stream "~0.1.2"
+
+through2@^1.0.0:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/through2/-/through2-1.1.1.tgz#0847cbc4449f3405574dbdccd9bb841b83ac3545"
+  dependencies:
+    readable-stream ">=1.1.13-1 <1.2.0-0"
+    xtend ">=4.0.0 <4.1.0-0"
+
+through2@~0.4.1:
+  version "0.4.2"
+  resolved "https://registry.yarnpkg.com/through2/-/through2-0.4.2.tgz#dbf5866031151ec8352bb6c4db64a2292a840b9b"
+  dependencies:
+    readable-stream "~1.0.17"
+    xtend "~2.1.1"
+
+through2@~0.5.1:
+  version "0.5.1"
+  resolved "https://registry.yarnpkg.com/through2/-/through2-0.5.1.tgz#dfdd012eb9c700e2323fd334f38ac622ab372da7"
+  dependencies:
+    readable-stream "~1.0.17"
+    xtend "~3.0.0"
+
+through@1:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/through/-/through-1.1.2.tgz#344a5425a3773314ca7e0eb6512fbafaf76c0bfe"
+
+through@2, "through@>=2.2.7 <3", through@~2.3.4:
+  version "2.3.8"
+  resolved "https://registry.yarnpkg.com/through/-/through-2.3.8.tgz#0dd4c9ffaabc357960b1b724115d7e0e86a2e1f5"
+
+through@~2.2.7:
+  version "2.2.7"
+  resolved "https://registry.yarnpkg.com/through/-/through-2.2.7.tgz#6e8e21200191d4eb6a99f6f010df46aa1c6eb2bd"
+
+timers-browserify@^1.0.1:
+  version "1.4.2"
+  resolved "https://registry.yarnpkg.com/timers-browserify/-/timers-browserify-1.4.2.tgz#c9c58b575be8407375cb5e2462dacee74359f41d"
+  dependencies:
+    process "~0.11.0"
+
+timers-browserify@~1.0.1:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/timers-browserify/-/timers-browserify-1.0.3.tgz#ffba70c9c12eed916fd67318e629ac6f32295551"
+  dependencies:
+    process "~0.5.1"
+
+to-utf8@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/to-utf8/-/to-utf8-0.0.1.tgz#d17aea72ff2fba39b9e43601be7b3ff72e089852"
+
+tty-browserify@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/tty-browserify/-/tty-browserify-0.0.1.tgz#3f05251ee17904dfd0677546670db9651682b811"
+
+typedarray@~0.0.5:
+  version "0.0.6"
+  resolved "https://registry.yarnpkg.com/typedarray/-/typedarray-0.0.6.tgz#867ac74e3864187b1d3d47d996a78ec5c8830777"
+
+uglify-js@2.5.0:
+  version "2.5.0"
+  resolved "https://registry.yarnpkg.com/uglify-js/-/uglify-js-2.5.0.tgz#4ab5d65a4730ecb7a4fb62d3f499e2054d98fba1"
+  dependencies:
+    async "~0.2.6"
+    source-map "~0.5.1"
+    uglify-to-browserify "~1.0.0"
+    yargs "~3.5.4"
+
+uglify-js@~2.2:
+  version "2.2.5"
+  resolved "https://registry.yarnpkg.com/uglify-js/-/uglify-js-2.2.5.tgz#a6e02a70d839792b9780488b7b8b184c095c99c7"
+  dependencies:
+    optimist "~0.3.5"
+    source-map "~0.1.7"
+
+uglify-js@~2.4.0:
+  version "2.4.24"
+  resolved "https://registry.yarnpkg.com/uglify-js/-/uglify-js-2.4.24.tgz#fad5755c1e1577658bb06ff9ab6e548c95bebd6e"
+  dependencies:
+    async "~0.2.6"
+    source-map "0.1.34"
+    uglify-to-browserify "~1.0.0"
+    yargs "~3.5.4"
+
+uglify-to-browserify@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/uglify-to-browserify/-/uglify-to-browserify-1.0.2.tgz#6e0924d6bda6b5afe349e39a6d632850a0f882b7"
+
+umd@^3.0.0:
+  version "3.0.1"
+  resolved "https://registry.yarnpkg.com/umd/-/umd-3.0.1.tgz#8ae556e11011f63c2596708a8837259f01b3d60e"
+
+umd@~2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/umd/-/umd-2.0.0.tgz#749683b0d514728ae0e1b6195f5774afc0ad4f8f"
+  dependencies:
+    rfile "~1.0.0"
+    ruglify "~1.0.0"
+    through "~2.3.4"
+    uglify-js "~2.4.0"
+
+url@~0.10.1:
+  version "0.10.3"
+  resolved "https://registry.yarnpkg.com/url/-/url-0.10.3.tgz#021e4d9c7705f21bbf37d03ceb58767402774c64"
+  dependencies:
+    punycode "1.3.2"
+    querystring "0.2.0"
+
+util-deprecate@~1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/util-deprecate/-/util-deprecate-1.0.2.tgz#450d4dc9fa70de732762fbd2d4a28981419a0ccf"
+
+util@0.10.3, util@~0.10.1:
+  version "0.10.3"
+  resolved "https://registry.yarnpkg.com/util/-/util-0.10.3.tgz#7afb1afe50805246489e3db7fe0ed379336ac0f9"
+  dependencies:
+    inherits "2.0.1"
+
+vm-browserify@~0.0.1:
+  version "0.0.4"
+  resolved "https://registry.yarnpkg.com/vm-browserify/-/vm-browserify-0.0.4.tgz#5d7ea45bbef9e4a6ff65f95438e0a87c357d5a73"
+  dependencies:
+    indexof "0.0.1"
+
+win-spawn@~2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/win-spawn/-/win-spawn-2.0.0.tgz#397a29130ec98d0aa0bc86baa4621393effd0b07"
+
+window-size@0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/window-size/-/window-size-0.1.0.tgz#5438cd2ea93b202efa3a19fe8887aee7c94f9c9d"
+
+wordwrap@0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/wordwrap/-/wordwrap-0.0.2.tgz#b79669bb42ecb409f83d583cad52ca17eaa1643f"
+
+wordwrap@~0.0.2:
+  version "0.0.3"
+  resolved "https://registry.yarnpkg.com/wordwrap/-/wordwrap-0.0.3.tgz#a3d5da6cd5c0bc0008d37234bbaf1bed63059107"
+
+wrappy@1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/wrappy/-/wrappy-1.0.2.tgz#b5243d8f3ec1aa35f1364605bc0d1036e30ab69f"
+
+xhr-write-stream@~0.1.2:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/xhr-write-stream/-/xhr-write-stream-0.1.2.tgz#e357848e0d039b411fdd5b3bf81be47ee5ce26aa"
+  dependencies:
+    concat-stream "~0.1.0"
+    ordered-emitter "~0.1.0"
+
+"xtend@>=4.0.0 <4.1.0-0", xtend@^4.0.0, xtend@^4.0.1:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/xtend/-/xtend-4.0.1.tgz#a5c6d532be656e23db820efb943a1f04998d63af"
+
+xtend@^3.0.0, xtend@~3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/xtend/-/xtend-3.0.0.tgz#5cce7407baf642cba7becda568111c493f59665a"
+
+xtend@~2.1.1:
+  version "2.1.2"
+  resolved "https://registry.yarnpkg.com/xtend/-/xtend-2.1.2.tgz#6efecc2a4dad8e6962c4901b337ce7ba87b5d28b"
+  dependencies:
+    object-keys "~0.4.0"
+
+yargs@~3.5.4:
+  version "3.5.4"
+  resolved "https://registry.yarnpkg.com/yargs/-/yargs-3.5.4.tgz#d8aff8f665e94c34bd259bdebd1bfaf0ddd35361"
+  dependencies:
+    camelcase "^1.0.2"
+    decamelize "^1.0.0"
+    window-size "0.1.0"
+    wordwrap "0.0.2"
diff --git a/node_modules/typed-function/.github/dependabot.yml b/node_modules/typed-function/.github/dependabot.yml
new file mode 100644
index 0000000..04d8cbc
--- /dev/null
+++ b/node_modules/typed-function/.github/dependabot.yml
@@ -0,0 +1,26 @@
+version: 2
+updates:
+- package-ecosystem: npm
+  directory: "/"
+  schedule:
+    interval: weekly
+    time: "04:00"
+  open-pull-requests-limit: 10
+  ignore:
+  - dependency-name: uglify-js
+    versions:
+    - 3.12.5
+    - 3.12.6
+    - 3.12.8
+    - 3.13.0
+    - 3.13.1
+    - 3.13.2
+    - 3.13.3
+  - dependency-name: mocha
+    versions:
+    - 8.3.0
+    - 8.3.1
+    - 8.3.2
+  - dependency-name: brace-expansion
+    versions:
+    - 2.0.1
diff --git a/node_modules/typed-function/.github/workflows/ci-test.yaml b/node_modules/typed-function/.github/workflows/ci-test.yaml
new file mode 100644
index 0000000..408a390
--- /dev/null
+++ b/node_modules/typed-function/.github/workflows/ci-test.yaml
@@ -0,0 +1,31 @@
+# This workflow will do a clean installation of node dependencies, cache/restore them, build the source code and run tests across different versions of node
+# For more information see: https://help.github.com/actions/language-and-framework-guides/using-nodejs-with-github-actions
+
+name: Node.js CI
+
+on:
+  push:
+    branches: [ develop, master ]
+  pull_request:
+    branches: [ develop, master ]
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    strategy:
+      matrix:
+        node-version: [12.x, 14.x, 16.x]
+        # See supported Node.js release schedule at https://nodejs.org/en/about/releases/
+
+    steps:
+      - uses: actions/checkout@v2
+      - name: Use Node.js ${{ matrix.node-version }}
+        uses: actions/setup-node@v2
+        with:
+          node-version: ${{ matrix.node-version }}
+          cache: 'npm'
+      - run: npm ci
+      - run: npm run build --if-present
+      - run: npm test
diff --git a/node_modules/typed-function/HISTORY.md b/node_modules/typed-function/HISTORY.md
new file mode 100644
index 0000000..a67c1b3
--- /dev/null
+++ b/node_modules/typed-function/HISTORY.md
@@ -0,0 +1,240 @@
+# History
+
+
+## 2022-03-11, version 2.1.0
+
+- Implemented configurable callbacks `typed.createError` and `typed.onMismatch`. 
+  Thanks @gwhitney.
+
+
+## 2020-07-03, version 2.0.0
+
+- Drop official support for node.js 6 and 8, though no breaking changes 
+  at this point.
+- Implemented support for recursion using the `this` keyword. Thanks @nickewing. 
+
+
+## 2019-08-22, version 1.1.1
+
+- Fix #15: passing `null` to an `Object` parameter throws wrong error.
+
+
+## 2018-07-28, version 1.1.0
+
+- Implemented support for creating typed functions from a plain function
+  having a property `signature`.
+- Implemented providing a name when merging multiple typed functions.
+
+
+## 2018-07-04, version 1.0.4
+
+- By default, `addType` will insert new types before the `Object` test
+  since the `Object` test also matches arrays and classes.
+- Upgraded `devDependencies`.
+
+
+## 2018-03-17, version 1.0.3
+
+- Dropped usage of ES6 feature `Array.find`, so typed-function is
+  directly usable on any ES5 compatible JavaScript engine (like IE11).
+
+
+## 2018-03-17, version 1.0.2
+
+- Fixed typed-function not working on browsers that don't allow
+  setting the `name` property of a function.
+
+
+## 2018-02-21, version 1.0.1
+
+- Upgraded dev dependencies.
+
+
+## 2018-02-20, version 1.0.0
+
+Version 1.0.0 is rewritten from scratch. The API is the same,
+though generated error messages may differ slightly.
+
+Version 1.0.0 no longer uses `eval` under the hood to achieve good
+performance. This reduces security risks and makes typed-functions
+easier to debug.
+
+Type `Object` is no longer treated specially from other types. This
+means that the test for `Object` must not give false positives for
+types like `Array`, `Date`, or class instances.
+
+In version 1.0.0, support for browsers like IE9, IE10 is dropped,
+though typed-function can still work when using es5 and es6 polyfills.
+
+
+## 2018-01-24, version 0.10.7
+
+- Fixed the field `data.actual` in a `TypeError` message containing
+  the type index instead of the actual type of the argument.
+
+
+## 2017-11-18, version 0.10.6
+
+- Fixed a security issue allowing to execute arbitrary JavaScript
+  code via a specially prepared function name of a typed function.
+  Thanks Masato Kinugawa.
+
+
+## 2016-11-18, version 0.10.5
+
+- Fixed the use of multi-layered use of `any` type. See #8.
+
+
+## 2016-04-09, version 0.10.4
+
+- Typed functions can only inherit names from other typed functions and no
+  longer from regular JavaScript functions since these names are unreliable:
+  they can be manipulated by minifiers and browsers.
+
+
+## 2015-10-07, version 0.10.3
+
+- Reverted the fix of v0.10.2 until the introduced issue with variable
+  arguments is fixed too. Added unit test for the latter case.
+
+
+## 2015-10-04, version 0.10.2
+
+- Fixed support for using `any` multiple times in a single signture.
+  Thanks @luke-gumbley.
+
+
+## 2015-07-27, version 0.10.1
+
+- Fixed functions `addType` and `addConversion` not being robust against
+  replaced arrays `typed.types` and `typed.conversions`.
+
+
+## 2015-07-26, version 0.10.0
+
+- Dropped support for the following construction signatures in order to simplify
+  the API:
+  - `typed(signature: string, fn: function)`
+  - `typed(name: string, signature: string, fn: function)`
+- Implemented convenience methods `typed.addType` and `typed.addConversion`.
+- Changed the casing of the type `'function'` to `'Function'`. Breaking change.
+- `typed.types` is now an ordered Array containing objects 
+  `{name: string, test: function}`. Breaking change.
+- List with expected types in error messages no longer includes converted types.
+
+
+## 2015-05-17, version 0.9.0
+
+- `typed.types` is now an ordered Array containing objects 
+  `{type: string, test: function}` instead of an object. Breaking change.
+- `typed-function` now allows merging typed functions with duplicate signatures
+  when they point to the same function.
+
+
+## 2015-05-16, version 0.8.3
+
+- Function `typed.find` now throws an error instead of returning `null` when a 
+  signature is not found.
+- Fixed: the attached signatures no longer contains signatures with conversions.
+
+
+## 2015-05-09, version 0.8.2
+
+- Fixed function `typed.convert` not handling the case where the value already
+  has the requested type. Thanks @rjbaucells.
+
+
+## 2015-05-09, version 0.8.1
+
+- Implemented option `typed.ignore` to ignore/filter signatures of a typed
+  function.
+
+
+## 2015-05-09, version 0.8.0
+
+- Implemented function `create` to create a new instance of typed-function.
+- Implemented a utility function `convert(value, type)` (#1).
+- Implemented a simple `typed.find` function to find the implementation of a
+  specific function signature.
+- Extended the error messages to denote the function name, like `"Too many 
+  arguments in function foo (...)"`.
+
+
+## 2015-04-17, version 0.7.0
+
+- Performance improvements.
+
+
+## 2015-03-08, version 0.6.3
+
+- Fixed generated internal Signature and Param objects not being cleaned up
+  after the typed function has been generated.
+
+
+## 2015-02-26, version 0.6.2
+
+- Fixed a bug sometimes not ordering the handling of any type arguments last.
+- Fixed a bug sometimes not choosing the signature with the lowest number of
+  conversions.
+
+
+## 2015-02-07, version 0.6.1
+
+- Large code refactoring.
+- Fixed bugs related to any type parameters.
+
+
+## 2015-01-16, version 0.6.0
+
+- Removed the configuration option `minify`
+  (it's not clear yet whether minifying really improves the performance).
+- Internal code simplifications.
+- Bug fixes.
+
+
+## 2015-01-07, version 0.5.0
+
+- Implemented support for merging typed functions.
+- Typed functions inherit the name of the function in case of one signature.
+- Fixed a bug where a regular argument was not matched when there was a
+  signature with variable arguments too.
+- Slightly changed the error messages.
+
+
+## 2014-12-17, version 0.4.0
+
+- Introduced new constructor options, create a typed function as
+  `typed([name,] signature, fn)` or `typed([name,] signatures)`.
+- Support for multiple types per parameter like `number | string, number'`.
+- Support for variable parameters like `sting, ...number'`.
+- Changed any type notation `'*'` to `'any'`.
+- Implemented detailed error messages.
+- Implemented option `typed.config.minify`.
+
+
+## 2014-11-05, version 0.3.1
+
+- Renamed module to `typed-function`.
+
+
+## 2014-11-05, version 0.3.0
+
+- Implemented support for any type arguments (denoted with `*`).
+
+
+## 2014-10-23, version 0.2.0
+
+- Implemented support for named functions.
+- Implemented support for type conversions.
+- Implemented support for custom types.
+- Library packaged as UMD, usable with CommonJS (node.js), AMD, and browser globals.
+
+
+## 2014-10-21, version 0.1.0
+
+- Implemented support for functions with zero, one, or multiple arguments.
+
+
+## 2014-10-19, version 0.0.1
+
+- First release (no functionality yet)
diff --git a/node_modules/typed-function/LICENSE b/node_modules/typed-function/LICENSE
new file mode 100644
index 0000000..3e0d27f
--- /dev/null
+++ b/node_modules/typed-function/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2018 Jos de Jong
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/typed-function/README.md b/node_modules/typed-function/README.md
new file mode 100644
index 0000000..8fdc6b8
--- /dev/null
+++ b/node_modules/typed-function/README.md
@@ -0,0 +1,480 @@
+# typed-function
+
+[![Version](https://img.shields.io/npm/v/typed-function.svg)](https://www.npmjs.com/package/typed-function)
+[![Downloads](https://img.shields.io/npm/dm/typed-function.svg)](https://www.npmjs.com/package/typed-function)
+[![Build Status](https://github.com/josdejong/typed-function/workflows/Node.js%20CI/badge.svg)](https://github.com/josdejong/typed-function/actions)
+
+Move type checking logic and type conversions outside of your function in a
+flexible, organized way. Automatically throw informative errors in case of
+wrong input arguments.
+
+
+## Features
+
+typed-function has the following features:
+
+- Runtime type-checking of input arguments.
+- Automatic type conversion of arguments.
+- Compose typed functions with multiple signatures.
+- Supports union types, any type, and variable arguments.
+- Detailed error messaging.
+
+Supported environments: node.js, Chrome, Firefox, Safari, Opera, IE11+.
+
+
+## Why?
+
+In JavaScript, functions can be called with any number and any type of arguments.
+When writing a function, the easiest way is to just assume that the function
+will be called with the correct input. This leaves the function's behavior on
+invalid input undefined. The function may throw some error, or worse,
+it may silently fail or return wrong results. Typical errors are
+*TypeError: undefined is not a function* or *TypeError: Cannot call method
+'request' of undefined*. These error messages are not very helpful. It can be
+hard to debug them, as they can be the result of a series of nested function
+calls manipulating and propagating invalid or incomplete data.
+
+Often, JavaScript developers add some basic type checking where it is important,
+using checks like `typeof fn === 'function'`, `date instanceof Date`, and
+`Array.isArray(arr)`. For functions supporting multiple signatures,
+the type checking logic can grow quite a bit, and distract from the actual
+logic of the function.
+
+For functions dealing with a considerable amount of type checking and conversion
+logic, or functions facing a public API, it can be very useful to use the
+`typed-function` module to handle the type-checking logic. This way:
+
+-   Users of the function get useful and consistent error messages when using
+    the function wrongly.
+-   The function cannot silently fail or silently give wrong results due to
+    invalid input.
+-   Correct type of input is assured inside the function. The function's code
+    becomes easier to understand as it only contains the actual function logic.
+    Lower level utility functions called by the type-checked function can
+    possibly be kept simpler as they don't need to do additional type checking.
+
+It's important however not to *overuse* type checking:
+
+-   Locking down the type of input that a function accepts can unnecessarily
+    limit its flexibility. Keep functions as flexible and forgiving as possible,
+    follow the
+    [robustness principle](http://en.wikipedia.org/wiki/Robustness_principle)
+    here: "be liberal in what you accept and conservative in what you send"
+    (Postel's law).
+-   There is no need to apply type checking to *all* functions. It may be
+    enough to apply type checking to one tier of public facing functions.
+-   There is a performance penalty involved for all type checking, so applying
+    it everywhere can unnecessarily worsen the performance.
+
+
+## Load
+
+Install via npm:
+
+    npm install typed-function
+
+
+## Usage
+
+Here are some usage examples. More examples are available in the
+[/examples](/examples) folder.
+
+```js
+var typed = require('typed-function');
+
+// create a typed function
+var fn1 = typed({
+  'number, string': function (a, b) {
+    return 'a is a number, b is a string';
+  }
+});
+
+// create a typed function with multiple types per argument (type union)
+var fn2 = typed({
+  'string, number | boolean': function (a, b) {
+    return 'a is a string, b is a number or a boolean';
+  }
+});
+
+// create a typed function with any type argument
+var fn3 = typed({
+  'string, any': function (a, b) {
+    return 'a is a string, b can be anything';
+  }
+});
+
+// create a typed function with multiple signatures
+var fn4 = typed({
+  'number': function (a) {
+    return 'a is a number';
+  },
+  'number, boolean': function (a, b) {
+    return 'a is a number, b is a boolean';
+  },
+  'number, number': function (a, b) {
+    return 'a is a number, b is a number';
+  }
+});
+
+// create a typed function from a plain function with signature
+function fnPlain(a, b) {
+  return 'a is a number, b is a string';
+}
+fnPlain.signature = 'number, string';
+var fn5 = typed(fnPlain);
+
+// use the functions
+console.log(fn1(2, 'foo'));      // outputs 'a is a number, b is a string'
+console.log(fn4(2));             // outputs 'a is a number'
+
+// calling the function with a non-supported type signature will throw an error
+try {
+  fn2('hello', 'world');
+}
+catch (err) {
+  console.log(err.toString());
+  // outputs:  TypeError: Unexpected type of argument.
+  //           Expected: number or boolean, actual: string, index: 1.
+}
+```
+
+
+## Types
+
+typed-function has the following built-in types:
+
+- `null`
+- `boolean`
+- `number`
+- `string`
+- `Function`
+- `Array`
+- `Date`
+- `RegExp`
+- `Object`
+
+The following type expressions are supported:
+
+- Multiple arguments: `string, number, Function`
+- Union types: `number | string`
+- Variable arguments: `...number`
+- Any type: `any`
+
+
+## API
+
+### Construction
+
+A typed function can be constructed in two ways:
+
+-   Create from an object with one or multiple signatures:
+
+    ```
+    typed(signatures: Object.<string, function>) : function
+    typed(name: string, signatures: Object.<string, function>) : function
+    ```
+
+-   Merge multiple typed functions into a new typed function:
+
+    ```
+    typed(functions: ...function) : function
+    typed(name: string, functions: ...function) : function
+    ```
+
+    Each function in `functions` can be either a typed function created before,
+    or a plain function having a `signature` property.
+
+
+### Methods
+
+-   `typed.convert(value: *, type: string) : *`
+
+    Convert a value to another type. Only applicable when conversions have
+    been defined in `typed.conversions` (see section [Properties](#properties)). 
+    Example:
+    
+    ```js
+    typed.conversions.push({
+      from: 'number',
+      to: 'string',
+      convert: function (x) {
+        return +x;
+    });
+    
+    var str = typed.convert(2.3, 'string'); // '2.3' 
+    ```
+
+-   `typed.create() : function`
+
+    Create a new, isolated instance of typed-function. Example:
+    
+    ```js
+    var typed = require('typed-function');  // default instance
+    var typed2 = typed.create();            // a second instance
+    ```
+
+    This would allow you, for example, to have two different type hierarchies
+    for different purposes.
+
+-   `typed.find(fn: typed-function, signature: string | Array) : function | null`
+
+    Find a specific signature from a typed function. The function currently
+    only finds exact matching signatures.
+    
+    For example:
+    
+    ```js
+    var fn = typed(...);
+    var f = typed.find(fn, ['number', 'string']);
+    var f = typed.find(fn, 'number, string');
+    ```
+
+-   `typed.addType(type: {name: string, test: function} [, beforeObjectTest=true]): void`
+
+    Add a new type. A type object contains a name and a test function.
+    The order of the types determines in which order function arguments are 
+    type-checked, so for performance it's important to put the most used types 
+    first. All types are added to the Array `typed.types`. 
+    
+    Example:
+    
+    ```js
+    function Person(...) {
+      ...
+    }
+    
+    Person.prototype.isPerson = true;
+
+    typed.addType({
+      name: 'Person',
+      test: function (x) {
+        return x && x.isPerson === true;
+      }
+    });
+    ```
+
+    By default, the new type will be inserted before the `Object` test
+    because the `Object` test also matches arrays and classes and hence
+    `typed-function` would never reach the new type. When `beforeObjectTest`
+    is `false`, the new type will be added at the end of all tests.
+
+-   `typed.addConversion(conversion: {from: string, to: string, convert: function}) : void`
+
+    Add a new conversion. Conversions are added to the Array `typed.conversions`.
+    
+    ```js
+    typed.addConversion({
+      from: 'boolean',
+      to: 'number',
+      convert: function (x) {
+        return +x;
+    });
+    ```
+
+    Note that any typed functions created before this conversion is added will
+    not have their arguments undergo this new conversion automatically, so it is
+    best to add all of your desired automatic conversions before defining any
+    typed functions.
+
+-   `typed.createError(name: string, args: Array.<any>, signatures: Array.<Signature>): TypeError`
+
+    Generates a custom error object reporting the problem with calling
+    the typed function of the given `name` with the given `signatures` on the
+    actual arguments `args`. Note the error object has an extra property `data`
+    giving the details of the problem. This method is primarily useful in
+    writing your own handler for a type mismatch (see the `typed.onMismatch`
+    property below), in case you have tried to recover but end up deciding
+    you want to throw the error that the default handler would have.
+
+### Properties
+
+-   `typed.types: Array.<{name: string, test: function}>`
+
+    Array with types. Each object contains a type name and a test function.
+    The order of the types determines in which order function arguments are 
+    type-checked, so for performance it's important to put the most used types 
+    first. Custom types can be added like:
+
+    ```js
+    function Person(...) {
+      ...
+    }
+    
+    Person.prototype.isPerson = true;
+
+    typed.types.push({
+      name: 'Person',
+      test: function (x) {
+        return x && x.isPerson === true;
+      }
+    });
+    ```
+
+-   `typed.conversions: Array.<{from: string, to: string, convert: function}>`
+
+    An Array with built-in conversions. Empty by default. Can be used to define
+    conversions from `boolean` to `number`. For example:
+
+    ```js
+    typed.conversions.push({
+      from: 'boolean',
+      to: 'number',
+      convert: function (x) {
+        return +x;
+    });
+    ```
+
+    Also note the `addConversion()` method above for simply adding a single
+    conversion at a time.
+    
+-   `typed.ignore: Array.<string>`
+
+    An Array with names of types to be ignored when creating a typed function.
+    This can be useful to filter signatures when creating a typed function.
+    For example:
+
+    ```js
+    // a set with signatures maybe loaded from somewhere
+    var signatures = {
+      'number': function () {...},
+      'string': function () {...}
+    }
+
+    // we want to ignore a specific type
+    typed.ignore = ['string'];
+
+    // the created function fn will only contain the 'number' signature 
+    var fn = typed('fn', signatures);
+    ```
+
+-   `typed.onMismatch: function`
+
+    The handler called when a typed-function call fails to match with any
+    of its signatures. The handler is called with three arguments: the name
+    of the typed function being called, the actual argument list, and an array
+    of the signatures for the typed function being called. (Each signature is
+    an object with property 'signature' giving the actual signature and\
+    property 'fn' giving the raw function for that signature.) The default
+    value of `onMismatch` is `typed.throwMismatchError`.
+
+    This can be useful if you have a collection of functions and have common
+    behavior for any invalid call. For example, you might just want to log
+    the problem and continue:
+
+    ```
+    const myErrorLog = [];
+    typed.onMismatch = (name, args, signatures) => {
+      myErrorLog.push(`Invalid call of ${name} with ${args.length} arguments.`);
+      return null;
+    };
+    typed.sqrt(9); // assuming definition as above, will return 3
+    typed.sqrt([]); // no error will be thrown; will return null.
+    console.log(`There have been ${myErrorLog.length} invalid calls.`)
+    ```
+
+    Note that there is only one `onMismatch` handler at a time; assigning a
+    new value discards the previous handler. To restore the default behavior,
+    just assign `typed.onMismatch = typed.throwMismatchError`.
+
+    Finally note that this handler fires whenever _any_ typed function call
+    does not match any of its signatures. You can in effect define such a
+    "handler" for a single typed function by simply specifying an implementation
+    for the `...` signature:
+
+    ```
+    const lenOrNothing = typed({
+      string: s => s.length,
+      '...': () => 0
+    });
+    console.log(lenOrNothing('Hello, world!')) // Output: 13
+    console.log(lenOrNothing(57, 'varieties')) // Output: 0
+    ```
+
+### Recursion
+
+The `this` keyword can be used to self-reference the typed-function:
+
+```js
+var sqrt = typed({
+  'number': function (value) {
+    return Math.sqrt(value);
+  },
+  'string': function (value) {
+    // on the following line we self reference the typed-function using "this"
+    return this(parseInt(value, 10));
+  }
+});
+
+// use the typed function
+console.log(sqrt('9')); // output: 3
+```
+
+
+### Output
+
+The functions generated with `typed({...})` have:
+
+- A function `toString`. Returns well readable code which can be used to see
+  what the function exactly does. Mostly for debugging purposes.
+- A property `signatures`, which holds a map with the (normalized)
+  signatures as key and the original sub-functions as value.
+- A property `name` containing the name of the typed function, if it was
+  assigned one at creation, or an empty string.
+
+
+## Roadmap
+
+### Version 2
+
+- Be able to turn off exception throwing.
+- Extend function signatures:
+  - Optional arguments like `'[number], array'` or like `number=, array`
+  - Nullable arguments like `'?Object'`
+- Create a good benchmark, to get insight in the overhead.
+- Allow conversions to fail (for example string to number is not always
+  possible). Call this `fallible` or `optional`?
+
+### Version 3
+
+- Extend function signatures:
+  - Constants like `'"linear" | "cubic"'`, `'0..10'`, etc.
+  - Object definitions like `'{name: string, age: number}'`
+  - Object definitions like `'Object.<string, Person>'`
+  - Array definitions like `'Array.<Person>'`
+- Improve performance of both generating a typed function as well as
+  the performance and memory footprint of a typed function.
+
+
+## Test
+
+To test the library, run:
+
+    npm test
+
+
+## Minify
+
+To generate the minified version of the library, run:
+
+    npm run minify
+
+
+## Publish
+
+1. Describe the changes in `HISTORY.md`
+2. Increase the version number in `package.json`
+3. Test and build:
+    ```
+    npm install
+    npm run build
+    npm test
+    ```
+4. Verify whether the bundle and minified bundle works correctly by opening
+   `./test/browser.html`  and `./test/browser.min.html` in your browser. 
+5. Commit the changes
+6. Merge `develop` into `master`, and push `master`
+7. Create a git tag, and pus this
+8. publish the library:
+    ```
+    npm publish
+    ```
diff --git a/node_modules/typed-function/benchmark/benchmark.js b/node_modules/typed-function/benchmark/benchmark.js
new file mode 100644
index 0000000..9decd06
--- /dev/null
+++ b/node_modules/typed-function/benchmark/benchmark.js
@@ -0,0 +1,71 @@
+//
+// typed-function benchmark
+//
+// WARNING: be careful, these are micro-benchmarks, which can only be used
+//          to get an indication of the performance. Real performance and
+//          bottlenecks should be assessed in real world applications,
+//          not in micro-benchmarks.
+//
+// Before running, make sure you've installed the needed packages which
+// are defined in the devDependencies of the project.
+//
+// To create a bundle:
+//
+//     browserify -o benchmark/benchmark.bundle.js benchmark/benchmark.js
+//
+
+'use strict';
+
+var assert = require('assert');
+var Benchmark = require('benchmark');
+var padRight = require('pad-right');
+var typed = require('../typed-function');
+
+// expose on window when using bundled in a browser
+if (typeof window !== 'undefined') {
+  window['Benchmark'] = Benchmark;
+}
+
+function add(x, y) {
+  return x + y;
+}
+
+var signatures = {
+  'number, number': add,
+  'boolean, boolean': add,
+  'Date, Date': add,
+  'string, string': add
+};
+
+var addTyped = typed('add', signatures);
+
+assert(add(2,3), 5);
+assert(addTyped(2,3), 5);
+assert(addTyped('hello', 'world'), 'helloworld');
+assert.throws(function () { addTyped(1) }, /TypeError/)
+assert.throws(function () { addTyped(1,2,3) }, /TypeError/)
+
+var result = 0;
+var suite = new Benchmark.Suite();
+suite
+    .add(pad('typed add'), function() {
+      result += addTyped(result, 4);
+      result += addTyped(String(result), 'world').length;
+    })
+    .add(pad('native add'), function() {
+      result += add(result, 4);
+      result += add(String(result), 'world').length;
+    })
+    .on('cycle', function(event) {
+      console.log(String(event.target));
+    })
+    .on('complete', function() {
+      if (result > Infinity) {
+        console.log()
+      }
+    })
+    .run();
+
+function pad (text) {
+  return padRight(text, 20, ' ');
+}
diff --git a/node_modules/typed-function/examples/any_type.js b/node_modules/typed-function/examples/any_type.js
new file mode 100644
index 0000000..127b263
--- /dev/null
+++ b/node_modules/typed-function/examples/any_type.js
@@ -0,0 +1,12 @@
+var typed = require('../typed-function');
+
+// create a typed function with an any type argument
+var log = typed({
+  'string, any': function (event, data) {
+    console.log('event: ' + event + ', data: ' + JSON.stringify(data));
+  }
+});
+
+// use the typed function
+log('start', {count: 2});   // output: 'event: start, data: {"count":2}'
+log('end', 'success!');     // output: 'event: start, data: "success!"
diff --git a/node_modules/typed-function/examples/basic_usage.js b/node_modules/typed-function/examples/basic_usage.js
new file mode 100644
index 0000000..4c4649b
--- /dev/null
+++ b/node_modules/typed-function/examples/basic_usage.js
@@ -0,0 +1,56 @@
+var typed = require('../typed-function');
+
+// create a typed function
+var fn1 = typed({
+  'number, string': function (a, b) {
+    return 'a is a number, b is a string';
+  }
+});
+
+// create a typed function with multiple types per argument (type union)
+var fn2 = typed({
+  'string, number | boolean': function (a, b) {
+    return 'a is a string, b is a number or a boolean';
+  }
+});
+
+// create a typed function with any type argument
+var fn3 = typed({
+  'string, any': function (a, b) {
+    return 'a is a string, b can be anything';
+  }
+});
+
+// create a typed function with multiple signatures
+var fn4 = typed({
+  'number': function (a) {
+    return 'a is a number';
+  },
+  'number, boolean': function (a, b) {
+    return 'a is a number, b is a boolean';
+  },
+  'number, number': function (a, b) {
+    return 'a is a number, b is a number';
+  }
+});
+
+// create a typed function from a plain function with signature
+function fnPlain(a, b) {
+  return 'a is a number, b is a string';
+}
+fnPlain.signature = 'number, string';
+var fn5 = typed(fnPlain);
+
+// use the functions
+console.log(fn1(2, 'foo'));      // outputs 'a is a number, b is a string'
+console.log(fn4(2));             // outputs 'a is a number'
+
+// calling the function with a non-supported type signature will throw an error
+try {
+  fn2('hello', 'world');
+}
+catch (err) {
+  console.log(err.toString());
+  // outputs:  TypeError: Unexpected type of argument.
+  //           Expected: number or boolean, actual: string, index: 1.
+}
diff --git a/node_modules/typed-function/examples/browser.html b/node_modules/typed-function/examples/browser.html
new file mode 100644
index 0000000..8f6f0dc
--- /dev/null
+++ b/node_modules/typed-function/examples/browser.html
@@ -0,0 +1,20 @@
+<!DOCTYPE html>
+<html>
+<head>
+  <title>typed-function | basic usage</title>
+  <script src="../typed-function.js"></script>
+</head>
+<body>
+<script>
+  // create a typed function
+  var fn1 = typed({
+    'number, string': function (a, b) {
+      return 'a is a number, b is a string';
+    }
+  });
+
+  // use the function
+  document.write(fn1(2, 'foo') + '<br>'); // outputs 'a is a number, b is a string'
+</script>
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/typed-function/examples/browser_amd.html b/node_modules/typed-function/examples/browser_amd.html
new file mode 100644
index 0000000..6bbeb2c
--- /dev/null
+++ b/node_modules/typed-function/examples/browser_amd.html
@@ -0,0 +1,25 @@
+<!DOCTYPE html>
+<html>
+<head>
+  <title>typed-function | basic usage with amd</title>
+  <script src="http://cdnjs.cloudflare.com/ajax/libs/require.js/2.1.15/require.min.js"></script>
+</head>
+<body>
+
+<script>
+  // load math.js using require.js
+  require(['../typed-function.js'], function (typed) {
+    // create a typed function
+    var fn1 = typed({
+      'number, string': function (a, b) {
+        return 'a is a number, b is a string';
+      }
+    });
+
+    // use the function
+    document.write(fn1(2, 'foo') + '<br>'); // outputs 'a is a number, b is a string'
+  });
+</script>
+
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/typed-function/examples/custom_type.js b/node_modules/typed-function/examples/custom_type.js
new file mode 100644
index 0000000..696a359
--- /dev/null
+++ b/node_modules/typed-function/examples/custom_type.js
@@ -0,0 +1,39 @@
+var typed = require('../typed-function');
+
+// create a prototype
+function Person(params) {
+  this.name = params.name;
+  this.age = params.age;
+}
+
+// register a test for this new type
+typed.addType({
+  name: 'Person',
+  test: function (x) {
+    return x instanceof Person;
+  }
+});
+
+// create a typed function
+var stringify = typed({
+  'Person': function (person) {
+    return JSON.stringify(person);
+  }
+});
+
+// use the function
+var person = new Person({name: 'John', age: 28});
+
+console.log(stringify(person));
+// outputs: '{"name":"John","age":28}'
+
+// calling the function with a non-supported type signature will throw an error
+try {
+  stringify('ooops');
+}
+catch (err) {
+  console.log('Wrong input will throw an error:');
+  console.log('  ' + err.toString());
+  // outputs: TypeError: Unexpected type of argument (expected: Person,
+  //          actual: string, index: 0)
+}
diff --git a/node_modules/typed-function/examples/merge_plain_functions.js b/node_modules/typed-function/examples/merge_plain_functions.js
new file mode 100644
index 0000000..85b3cff
--- /dev/null
+++ b/node_modules/typed-function/examples/merge_plain_functions.js
@@ -0,0 +1,20 @@
+var typed = require('../typed-function');
+
+// create a couple of plain functions with a signature
+function fn1 (a) {
+  return a + a;
+}
+fn1.signature = 'number';
+
+function fn2 (a) {
+  var value = +a;
+  return value + value;
+}
+fn2.signature = 'string';
+
+// merge multiple typed functions
+var fn3 = typed('fn3', fn1, fn2);
+
+// use merged function
+console.log(fn3(2));    // outputs 4
+console.log(fn3('3'));  // outputs 6
diff --git a/node_modules/typed-function/examples/merge_typed_functions.js b/node_modules/typed-function/examples/merge_typed_functions.js
new file mode 100644
index 0000000..decbd27
--- /dev/null
+++ b/node_modules/typed-function/examples/merge_typed_functions.js
@@ -0,0 +1,21 @@
+var typed = require('../typed-function');
+
+// create a couple of typed functions
+var fn1 = typed({
+  'number': function (a) {
+    return a + a;
+  }
+});
+var fn2 = typed({
+  'string': function (a) {
+    var value = +a;
+    return value + value;
+  }
+});
+
+// merge multiple typed functions
+var fn3 = typed(fn1, fn2);
+
+// use merged function
+console.log(fn3(2));    // outputs 4
+console.log(fn3('3'));  // outputs 6
diff --git a/node_modules/typed-function/examples/multiple_signatures.js b/node_modules/typed-function/examples/multiple_signatures.js
new file mode 100644
index 0000000..546076a
--- /dev/null
+++ b/node_modules/typed-function/examples/multiple_signatures.js
@@ -0,0 +1,18 @@
+var typed = require('../typed-function');
+
+// create a typed function with multiple signatures
+var fn = typed({
+  'number': function (a) {
+    return 'a is a number';
+  },
+  'number, boolean': function (a, b) {
+    return 'a is a number, b is a boolean';
+  },
+  'number, number': function (a, b) {
+    return 'a is a number, b is a number';
+  }
+});
+
+// use the function
+console.log(fn(2, true));      // outputs 'a is a number, b is a boolean'
+console.log(fn(2));            // outputs 'a is a number'
diff --git a/node_modules/typed-function/examples/recursion.js b/node_modules/typed-function/examples/recursion.js
new file mode 100644
index 0000000..7dad474
--- /dev/null
+++ b/node_modules/typed-function/examples/recursion.js
@@ -0,0 +1,14 @@
+var typed = require('../typed-function');
+
+// create a typed function that invokes itself
+var sqrt = typed({
+  'number': function (value) {
+    return Math.sqrt(value);
+  },
+  'string': function (value) {
+    return this(parseInt(value, 10));
+  }
+});
+
+// use the typed function
+console.log(sqrt("9"));         // output: 3
diff --git a/node_modules/typed-function/examples/rest_parameters.js b/node_modules/typed-function/examples/rest_parameters.js
new file mode 100644
index 0000000..35eaa7a
--- /dev/null
+++ b/node_modules/typed-function/examples/rest_parameters.js
@@ -0,0 +1,16 @@
+var typed = require('../typed-function');
+
+// create a typed function with a variable number of arguments
+var sum = typed({
+  '...number': function (values) {
+    var sum = 0;
+    for (var i = 0; i < values.length; i++) {
+      sum += values[i];
+    }
+    return sum;
+  }
+});
+
+// use the typed function
+console.log(sum(2, 3));         // output: 5
+console.log(sum(2, 3, 1, 2));   // output: 8
diff --git a/node_modules/typed-function/examples/type_conversion.js b/node_modules/typed-function/examples/type_conversion.js
new file mode 100644
index 0000000..2a4eb3a
--- /dev/null
+++ b/node_modules/typed-function/examples/type_conversion.js
@@ -0,0 +1,53 @@
+var typed = require('../typed-function');
+
+// define type conversions that we want to support order is important.
+// There is also an utility function typed.addConversion(conversion) for this.
+typed.conversions = [
+  {
+    from: 'boolean',
+    to: 'number',
+    convert: function (x) {
+      return +x;
+    }
+  },
+  {
+    from: 'boolean',
+    to: 'string',
+    convert: function (x) {
+      return x + '';
+    }
+  },
+  {
+    from: 'number',
+    to: 'string',
+    convert: function (x) {
+      return x + '';
+    }
+  }
+];
+
+// create a typed function with multiple signatures
+//
+// where possible, the created function will automatically convert booleans to
+// numbers or strings, and convert numbers to strings.
+//
+// note that the length property is only available on strings, and the toFixed
+// function only on numbers, so this requires the right type of argument else
+// the function will throw an exception.
+var fn = typed({
+  'string': function (name) {
+    return 'Name: ' + name + ', length: ' + name.length;
+  },
+  'string, number': function (name, value) {
+    return 'Name: ' + name + ', length: ' + name.length + ', value: ' + value.toFixed(3);
+  }
+});
+
+// use the function the regular way
+console.log(fn('foo'));        // outputs 'Name: foo, length: 3'
+console.log(fn('foo', 2/3));   // outputs 'Name: foo, length: 3, value: 0.667'
+
+// calling the function with non-supported but convertible types
+// will work just fine:
+console.log(fn(false));         // outputs 'Name: false, length: 5'
+console.log(fn('foo', true));   // outputs 'Name: foo, length: 3, value: 1.000'
diff --git a/node_modules/typed-function/package.json b/node_modules/typed-function/package.json
new file mode 100644
index 0000000..c16ed54
--- /dev/null
+++ b/node_modules/typed-function/package.json
@@ -0,0 +1,41 @@
+{
+  "name": "typed-function",
+  "version": "2.1.0",
+  "description": "Type checking for JavaScript functions",
+  "author": "Jos de Jong <wjosdejong@gmail.com> (https://github.com/josdejong)",
+  "contributors": [
+    "Luke Gumbley (https://github.com/luke-gumbley)"
+  ],
+  "homepage": "https://github.com/josdejong/typed-function",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/josdejong/typed-function.git"
+  },
+  "keywords": [
+    "typed",
+    "function",
+    "arguments",
+    "compose",
+    "types"
+  ],
+  "dependencies": {},
+  "devDependencies": {
+    "benchmark": "2.1.4",
+    "brace-expansion": "2.0.1",
+    "istanbul": "0.4.5",
+    "mocha": "8.3.2",
+    "pad-right": "0.2.2",
+    "uglify-js": "3.13.3"
+  },
+  "comment": "brace-expansion is installed because an old insecure version is used by one of the dev depencencies (under istanbul)",
+  "main": "typed-function.js",
+  "scripts": {
+    "build": "uglifyjs typed-function.js -o typed-function.min.js -c -m",
+    "test": "mocha test --recursive",
+    "coverage": "istanbul cover _mocha -- test --recursive; echo \"\nCoverage report is available at ./coverage/lcov-report/index.html\"",
+    "prepublishOnly": "npm test && npm run build"
+  },
+  "engines": {
+    "node": ">= 10"
+  }
+}
diff --git a/node_modules/typed-function/test/any_type.test.js b/node_modules/typed-function/test/any_type.test.js
new file mode 100644
index 0000000..c85c771
--- /dev/null
+++ b/node_modules/typed-function/test/any_type.test.js
@@ -0,0 +1,220 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('any type', function () {
+
+  it('should compose a function with one any type argument', function() {
+    var fn = typed({
+      'any': function (value) {
+        return 'any:' + value;
+      },
+      'string': function (value) {
+        return 'string:' + value;
+      },
+      'boolean': function (value) {
+        return 'boolean:' + value;
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 3);
+    assert.equal(fn(2), 'any:2');
+    assert.equal(fn([1,2,3]), 'any:1,2,3');
+    assert.equal(fn('foo'), 'string:foo');
+    assert.equal(fn(false), 'boolean:false');
+  });
+
+  it('should compose a function with multiple any type arguments (1)', function() {
+    var fn = typed({
+      'any,boolean': function () {
+        return 'any,boolean';
+      },
+      'any,string': function () {
+        return 'any,string';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 2);
+    assert.equal(fn([],true), 'any,boolean');
+    assert.equal(fn(2,'foo'), 'any,string');
+    assert.throws(function () {fn([], new Date())}, /TypeError: Unexpected type of argument in function unnamed \(expected: string or boolean, actual: Date, index: 1\)/);
+    assert.throws(function () {fn(2, 2)},           /TypeError: Unexpected type of argument in function unnamed \(expected: string or boolean, actual: number, index: 1\)/);
+    assert.throws(function () {fn(2)},              /TypeError: Too few arguments in function unnamed \(expected: string or boolean, index: 1\)/);
+  });
+
+  it('should compose a function with multiple any type arguments (2)', function() {
+    var fn = typed({
+      'any,boolean': function () {
+        return 'any,boolean';
+      },
+      'any,number': function () {
+        return 'any,number';
+      },
+      'string,any': function () {
+        return 'string,any';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 3);
+    assert.equal(fn([],true), 'any,boolean');
+    assert.equal(fn([],2), 'any,number');
+    assert.equal(fn('foo', 2), 'string,any');
+    assert.throws(function () {fn([], new Date())}, /TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: Date, index: 1\)/);
+    assert.throws(function () {fn([], 'foo')},      /TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: string, index: 1\)/)
+  });
+
+  it('should compose a function with multiple any type arguments (3)', function() {
+    var fn = typed({
+      'string,any': function () {
+        return 'string,any';
+      },
+      'any': function () {
+        return 'any';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.deepEqual(Object.keys(fn.signatures), ['string,any', 'any']);
+    assert.equal(fn('foo', 2), 'string,any');
+    assert.equal(fn([]), 'any');
+    assert.equal(fn('foo'), 'any');
+    assert.throws(function () {fn()}, /TypeError: Too few arguments in function unnamed \(expected: any, index: 0\)/);
+    assert.throws(function () {fn([], 'foo')}, /TypeError: Too many arguments in function unnamed \(expected: 1, actual: 2\)/);
+    assert.throws(function () {fn('foo', 4, [])}, /TypeError: Too many arguments in function unnamed \(expected: 2, actual: 3\)/);
+  });
+
+  it('should compose a function with multiple any type arguments (4)', function() {
+    var fn = typed('fn1', {
+      'number,number': function () {
+        return 'number,number';
+      },
+      'any,string': function () {
+        return 'any,string';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 2);
+    assert.equal(fn(2, 2), 'number,number');
+    assert.equal(fn(2, 'foo'), 'any,string');
+    assert.throws(function () {fn('foo')}, /TypeError: Too few arguments in function fn1 \(expected: string, index: 1\)/);
+    assert.throws(function () {fn(1,2,3)}, /TypeError: Too many arguments in function fn1 \(expected: 2, actual: 3\)/);
+  });
+
+  it('should compose a function with multiple any type arguments (5)', function() {
+    var fn = typed({
+      'string,string': function () {
+        return 'string,string';
+      },
+      'any': function () {
+        return 'any';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 2);
+    assert.equal(fn('foo', 'bar'), 'string,string');
+    assert.equal(fn([]), 'any');
+    assert.equal(fn('foo'), 'any');
+    assert.throws(function () {fn('foo', 'bar', 5)}, /TypeError: Too many arguments in function unnamed \(expected: 2, actual: 3\)/);
+    assert.throws(function () {fn('foo', 2, 5)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string, actual: number, index: 1\)/);
+    assert.throws(function () {fn('foo', 'bar', 5)}, /TypeError: Too many arguments in function unnamed \(expected: 2, actual: 3\)/);
+  });
+
+  it('var arg any type arguments should only handle unmatched types', function() {
+    var fn = typed({
+      'Array,string': function () {
+        return 'Array,string';
+      },
+      '...': function () {
+        return 'any';
+      }
+    });
+
+    assert.equal(fn([], 'foo'), 'Array,string');
+    assert.equal(fn([], 'foo', 'bar'), 'any');
+    assert.equal(fn('string'), 'any');
+    assert.equal(fn(2), 'any');
+    assert.equal(fn(2,3,4), 'any');
+    assert.equal(fn([]), 'any');
+    assert.throws(function () {fn()}, /TypeError: Too few arguments in function unnamed \(expected: any, index: 0\)/);
+  });
+
+  it('multiple use of any', function() {
+    var fn = typed({
+      'number,number': function () {
+        return 'numbers';
+      },
+      'any,any': function () {
+        return 'any';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 2);
+    assert.equal(fn('a','b'), 'any');
+    assert.equal(fn(1,1), 'numbers');
+    assert.equal(fn(1,'b'), 'any');
+    assert.equal(fn('a',1), 'any');
+  });
+
+  it('use one any in combination with vararg', function() {
+    var fn = typed({
+      'number': function () {
+        return 'numbers';
+      },
+      'any,...any': function () {
+        return 'any';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 2);
+    assert.equal(fn('a','b'), 'any');
+    assert.equal(fn(1), 'numbers');
+    assert.equal(fn(1,'b'), 'any');
+    assert.equal(fn('a',2), 'any');
+    assert.equal(fn(1,2), 'any');
+    assert.equal(fn(1,2,3), 'any');
+  });
+
+  it('use multi-layered any in combination with vararg', function() {
+    var fn = typed({
+      'number,number': function () {
+        return 'numbers';
+      },
+      'any,any,...any': function () {
+        return 'any';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 2);
+    assert.equal(fn('a','b','c'), 'any');
+    assert.equal(fn(1,2), 'numbers');
+    assert.equal(fn(1,'b',2), 'any');
+    assert.equal(fn('a',2,3), 'any');
+    assert.equal(fn(1,2,3), 'any');
+  });
+
+  it('should permit multi-layered use of any', function() {
+    var fn = typed({
+      'any,any': function () {
+        return 'two';
+      },
+      'number,number,string': function () {
+        return 'three';
+      }
+    });
+
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 2);
+    assert.equal(fn('a','b'), 'two');
+    assert.equal(fn(1,1), 'two');
+    assert.equal(fn(1,1,'a'), 'three');
+    assert.throws(function () {fn(1,1,1)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string, actual: number, index: 2\)/);
+  });
+
+});
diff --git a/node_modules/typed-function/test/browser.html b/node_modules/typed-function/test/browser.html
new file mode 100644
index 0000000..01a216b
--- /dev/null
+++ b/node_modules/typed-function/test/browser.html
@@ -0,0 +1,20 @@
+<!DOCTYPE html>
+<html>
+<head>
+  <title>browser test</title>
+  <script src="../typed-function.js"></script>
+</head>
+<body>
+<script>
+  // create a typed function
+  var fn1 = typed({
+    'number, string': function (a, b) {
+      return 'a is a number, b is a string';
+    }
+  });
+
+  // use the function
+  document.write(fn1(2, 'foo') + '<br>'); // outputs 'a is a number, b is a string'
+</script>
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/typed-function/test/browser.min.html b/node_modules/typed-function/test/browser.min.html
new file mode 100644
index 0000000..db452b4
--- /dev/null
+++ b/node_modules/typed-function/test/browser.min.html
@@ -0,0 +1,20 @@
+<!DOCTYPE html>
+<html>
+<head>
+  <title>browser test - minified file</title>
+  <script src="../typed-function.min.js"></script>
+</head>
+<body>
+<script>
+  // create a typed function
+  var fn1 = typed({
+    'number, string': function (a, b) {
+      return 'a is a number, b is a string';
+    }
+  });
+
+  // use the function
+  document.write(fn1(2, 'foo') + '<br>'); // outputs 'a is a number, b is a string'
+</script>
+</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/typed-function/test/compose.test.js b/node_modules/typed-function/test/compose.test.js
new file mode 100644
index 0000000..5e2c625
--- /dev/null
+++ b/node_modules/typed-function/test/compose.test.js
@@ -0,0 +1,77 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('compose', function () {
+
+  it('should create a composed function with multiple types per argument', function() {
+    var fn = typed({
+      'string | number, boolean':  function () {return 'A';},
+      'boolean, boolean | number': function () {return 'B';},
+      'string':                    function () {return 'C';}
+    });
+
+    assert.equal(fn('str', false), 'A');
+    assert.equal(fn(2, true), 'A');
+    assert.equal(fn(false, true), 'B');
+    assert.equal(fn(false, 2), 'B');
+    assert.equal(fn('str'), 'C');
+    // FIXME: should return correct error message
+    assert.throws(function () {fn()},           /TypeError: Too few arguments in function unnamed \(expected: number or string or boolean, index: 0\)/);
+    assert.throws(function () {fn(1,2,3)},      /TypeError: Unexpected type of argument in function unnamed \(expected: boolean, actual: number, index: 1\)/);
+    assert.throws(function () {fn('str', 2)},   /TypeError: Unexpected type of argument in function unnamed \(expected: boolean, actual: number, index: 1\)/);
+    assert.throws(function () {fn(true, 'str')},/TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: string, index: 1\)/);
+    assert.throws(function () {fn(2, 3)},       /TypeError: Unexpected type of argument in function unnamed \(expected: boolean, actual: number, index: 1\)/);
+    assert.throws(function () {fn(2, 'str')},   /TypeError: Unexpected type of argument in function unnamed \(expected: boolean, actual: string, index: 1\)/);
+  });
+
+  // TODO: test whether the constructor throws errors when providing wrong arguments to typed(...)
+
+  it('should compose a function with one argument', function() {
+    var signatures = {
+      'number': function (value) {
+        return 'number:' + value;
+      },
+      'string': function (value) {
+        return 'string:' + value;
+      },
+      'boolean': function (value) {
+        return 'boolean:' + value;
+      }
+    };
+    var fn = typed(signatures);
+
+    assert.equal(fn(2), 'number:2');
+    assert.equal(fn('foo'), 'string:foo');
+    assert.equal(fn(false), 'boolean:false');
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 3);
+    assert.strictEqual(fn.signatures['number'], signatures['number']);
+    assert.strictEqual(fn.signatures['string'], signatures['string']);
+    assert.strictEqual(fn.signatures['boolean'], signatures['boolean']);
+  });
+
+  it('should compose a function with multiple arguments', function() {
+    var signatures = {
+      'number': function (value) {
+        return 'number:' + value;
+      },
+      'string': function (value) {
+        return 'string:' + value;
+      },
+      'number, boolean': function (a, b) { // mind space after the comma, should be normalized by composer
+        return 'number,boolean:' + a + ',' + b;
+      }
+    };
+    var fn = typed(signatures);
+
+    assert.equal(fn(2), 'number:2');
+    assert.equal(fn('foo'), 'string:foo');
+    assert.equal(fn(2, false), 'number,boolean:2,false');
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 3);
+    assert.strictEqual(fn.signatures['number'], signatures['number']);
+    assert.strictEqual(fn.signatures['string'], signatures['string']);
+    assert.strictEqual(fn.signatures['number,boolean'], signatures['number, boolean']);
+  });
+
+});
diff --git a/node_modules/typed-function/test/construction.test.js b/node_modules/typed-function/test/construction.test.js
new file mode 100644
index 0000000..2e08c76
--- /dev/null
+++ b/node_modules/typed-function/test/construction.test.js
@@ -0,0 +1,371 @@
+// test parse
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('construction', function() {
+
+  it('should throw an error when not providing any signatures', function() {
+    assert.throws(function () {
+      typed({});
+    }, /Error: No signatures provided/);
+  });
+
+  it('should create a named function', function() {
+    var fn = typed('myFunction',  {
+      'string': function (str) {
+        return 'foo';
+      }
+    });
+
+    assert.equal(fn('bar'), 'foo');
+    assert.equal(fn.name, 'myFunction');
+  });
+
+  it('should create a typed function from a regular function with a signature', function() {
+    function myFunction(str) {
+      return 'foo';
+    }
+    myFunction.signature = 'string'
+
+    var fn = typed(myFunction);
+
+    assert.equal(fn('bar'), 'foo');
+    assert.equal(fn.name, 'myFunction');
+    assert.deepEqual(Object.keys(fn.signatures), ['string']);
+  });
+
+  it('should create an unnamed function', function() {
+    var fn = typed({
+      'string': function (str) {
+        return 'foo';
+      }
+    });
+
+    assert.equal(fn('bar'), 'foo');
+    assert.equal(fn.name, '');
+  });
+
+  it('should inherit the name of typed functions', function() {
+    var fn = typed({
+      'string': typed('fn1', {
+        'string': function (str) {
+          return 'foo';
+        }
+      })
+    });
+
+    assert.equal(fn('bar'), 'foo');
+    assert.equal(fn.name, 'fn1');
+  });
+
+  it('should not inherit the name of the JavaScript functions (only from typed functions)', function() {
+    var fn = typed({
+      'string': function fn1 (str) {
+        return 'foo';
+      }
+    });
+
+    assert.equal(fn('bar'), 'foo');
+    assert.equal(fn.name, '');
+  });
+
+  it('should compose a function with zero arguments', function() {
+    var signatures = {
+      '': function () {
+        return 'noargs';
+      }
+    };
+    var fn = typed(signatures);
+
+    assert.equal(fn(), 'noargs');
+    assert(fn.signatures instanceof Object);
+    assert.strictEqual(Object.keys(fn.signatures).length, 1);
+    assert.strictEqual(fn.signatures[''], signatures['']);
+  });
+
+  it('should create a typed function with one argument', function() {
+    var fn = typed({
+      'string': function () {
+        return 'string';
+      }
+    });
+
+    assert.equal(fn('hi'), 'string');
+  });
+
+  it('should create a typed function with two arguments', function() {
+    var fn = typed({
+      'string, boolean': function () {
+        return 'foo';
+      }
+    });
+
+    assert.equal(fn('hi', true), 'foo');
+  });
+
+  it('should create a named, typed function', function() {
+    var fn = typed('myFunction', {
+      'string, boolean': function () {
+        return 'noargs';
+      }
+    });
+
+    assert.equal(fn('hi', true), 'noargs');
+    assert.equal(fn.name, 'myFunction');
+  });
+
+  it('should correctly recognize Date from Object (both are an Object)', function() {
+    var signatures = {
+      'Object': function (value) {
+        assert(value instanceof Object);
+        return 'Object';
+      },
+      'Date': function (value) {
+        assert(value instanceof Date);
+        return 'Date';
+      }
+    };
+    var fn = typed(signatures);
+
+    assert.equal(fn({foo: 'bar'}), 'Object');
+    assert.equal(fn(new Date()), 'Date');
+  });
+
+  it('should correctly handle null', function () {
+    var fn = typed({
+      'Object': function (a) {
+        return 'Object';
+      },
+      'null': function (a) {
+        return 'null';
+      },
+      'undefined': function (a) {
+        return 'undefined';
+      }
+    });
+
+    assert.equal(fn(new Object(null)), 'Object');
+    assert.equal(fn(null), 'null');
+    assert.equal(fn(undefined), 'undefined');
+  });
+
+  it('should throw correct error message when passing null from an Object', function() {
+    var signatures = {
+      'Object': function (value) {
+        assert(value instanceof Object);
+        return 'Object';
+      }
+    };
+    var fn = typed(signatures);
+
+    assert.equal(fn({}), 'Object');
+    assert.throws(function () { fn(null) },
+        /TypeError: Unexpected type of argument in function unnamed \(expected: Object, actual: null, index: 0\)/);
+  });
+
+  it('should create a new, isolated instance of typed-function', function() {
+    var typed1 = typed.create();
+    var typed2 = typed.create();
+    function Person() {}
+
+    typed1.types.push({
+      name: 'Person',
+      test: function (x) {
+        return x instanceof Person;
+      }
+    });
+
+    assert.strictEqual(typed.create, typed1.create);
+    assert.notStrictEqual(typed.types, typed1.types);
+    assert.notStrictEqual(typed.conversions, typed1.conversions);
+
+    assert.strictEqual(typed.create, typed2.create);
+    assert.notStrictEqual(typed.types, typed2.types);
+    assert.notStrictEqual(typed.conversions, typed2.conversions);
+
+    assert.strictEqual(typed1.create, typed2.create);
+    assert.notStrictEqual(typed1.types, typed2.types);
+    assert.notStrictEqual(typed1.conversions, typed2.conversions);
+
+    typed1({
+      'Person': function (p) {return 'Person'}
+    });
+
+    assert.throws(function () {
+      typed2({
+        'Person': function (p) {return 'Person'}
+      });
+    }, /Error: Unknown type "Person"/)
+  });
+
+  it('should add a type using addType (before object)', function() {
+    var typed2 = typed.create();
+    function Person() {}
+
+    var newType = {
+      name: 'Person',
+      test: function (x) {
+        return x instanceof Person;
+      }
+    };
+
+    var objectEntry = typed2.types.find(function (entry) {
+      return entry.name === 'Object';
+    });
+    var objectIndex = typed2.types.indexOf(objectEntry);
+
+    typed2.addType(newType);
+
+    assert.strictEqual(typed2.types[objectIndex], newType);
+  });
+
+  it('should add a type using addType at the end (after Object)', function() {
+    var typed2 = typed.create();
+    function Person() {}
+
+    var newType = {
+      name: 'Person',
+      test: function (x) {
+        return x instanceof Person;
+      }
+    };
+
+    typed2.addType(newType, false);
+
+    assert.strictEqual(typed2.types[typed2.types.length - 1], newType);
+  });
+
+  it('should throw an error when passing an invalid type to addType', function() {
+    var typed2 = typed.create();
+    var errMsg = /TypeError: Object with properties {name: string, test: function} expected/;
+
+    assert.throws(function () {typed2.addType({})}, errMsg);
+    assert.throws(function () {typed2.addType({name: 2, test: function () {}})}, errMsg);
+    assert.throws(function () {typed2.addType({name: 'foo', test: 'bar'})}, errMsg);
+  });
+
+  it('should throw an error when providing an unsupported type of argument', function() {
+    var fn = typed('fn1', {
+      'number': function (value) {
+        return 'number:' + value;
+      }
+    });
+
+    assert.throws(function () {fn(new Date())}, /TypeError: Unexpected type of argument in function fn1 \(expected: number, actual: Date, index: 0\)/);
+  });
+
+  it('should throw an error when providing a wrong function signature', function() {
+    var fn = typed('fn1', {
+      'number': function (value) {
+        return 'number:' + value;
+      }
+    });
+
+    assert.throws(function () {fn(1, 2)}, /TypeError: Too many arguments in function fn1 \(expected: 1, actual: 2\)/);
+  });
+
+  it('should throw an error when composing with an unknown type', function() {
+    assert.throws(function () {
+      var fn = typed({
+        'foo': function (value) {
+          return 'number:' + value;
+        }
+      });
+    }, /Error: Unknown type "foo"/);
+  });
+
+  it('should ignore types from typed.ignore', function() {
+    var typed2 = typed.create();
+    typed2.ignore = ['string'];
+
+    var fn = typed2({
+      'number': function () {},
+      'number, number': function () {},
+
+      'string, number': function () {},
+      'number, string': function () {},
+      'boolean | string, boolean': function () {},
+      'any, ...string': function () {},
+      'string': function () {}
+    });
+
+    assert.deepEqual(Object.keys(fn.signatures).sort(), ['boolean,boolean', 'number', 'number,number']);
+  });
+
+  it('should give a hint when composing with a wrongly cased type', function() {
+    assert.throws(function () {
+      var fn = typed({
+        'array': function (value) {
+          return 'array:' + value;
+        }
+      });
+    }, /Error: Unknown type "array". Did you mean "Array"?/);
+
+    assert.throws(function () {
+      var fn = typed({
+        'function': function (value) {
+          return 'Function:' + value;
+        }
+      });
+    }, /Error: Unknown type "function". Did you mean "Function"?/);
+  });
+
+  it('should attach signatures to the created typed-function', function() {
+    var fn1 = function () {}
+    var fn2 = function () {}
+    var fn3 = function () {}
+    var fn4 = function () {}
+
+    var fn = typed({
+      'string': fn1,
+      'string, boolean': fn2,
+      'number | Date, boolean': fn3,
+      'Array | Object, string | RegExp': fn3,
+      'number, ...string | number': fn4
+    });
+
+    assert.deepStrictEqual(fn.signatures, {
+      'string': fn1,
+      'string,boolean': fn2,
+      'number,boolean': fn3,
+      'Date,boolean': fn3,
+      'Array,string': fn3,
+      'Array,RegExp': fn3,
+      'Object,string': fn3,
+      'Object,RegExp': fn3,
+      'number,...string|number': fn4
+    });
+  });
+
+  it('should correctly order signatures', function () {
+    var fn = typed({
+      'boolean': function (a) {
+        return 'boolean';
+      },
+      'string': function (a) {
+        return 'string';
+      },
+      'number': function (a) {
+        return 'number';
+      }
+    });
+
+    // TODO: this is tricky, object keys do not officially have a guaranteed order
+    assert.deepEqual(Object.keys(fn.signatures),
+        ['number', 'string', 'boolean']);
+  });
+
+  it('should allow a function to be defined recursively', function () {
+    var fn = typed({
+      'number': function (value) {
+        return 'number:' + value;
+      },
+      'string': function (value) {
+        return this(parseInt(value, 10));
+      }
+    });
+
+    assert.equal(fn('2'), 'number:2');
+  })
+
+});
diff --git a/node_modules/typed-function/test/conversion.test.js b/node_modules/typed-function/test/conversion.test.js
new file mode 100644
index 0000000..00a4c11
--- /dev/null
+++ b/node_modules/typed-function/test/conversion.test.js
@@ -0,0 +1,437 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+var strictEqualArray = require('./strictEqualArray');
+
+describe('conversion', function () {
+
+  before(function () {
+    typed.conversions = [
+      {from: 'boolean', to: 'number', convert: function (x) {return +x;}},
+      {from: 'boolean', to: 'string', convert: function (x) {return x + '';}},
+      {from: 'number',  to: 'string', convert: function (x) {return x + '';}},
+      {
+        from: 'string',
+        to: 'Date',
+        convert: function (x) {
+          var d = new Date(x);
+          return isNaN(d.valueOf()) ? undefined : d;
+        },
+        fallible: true // TODO: not yet supported
+      }
+    ];
+  });
+
+  after(function () {
+    // cleanup conversions
+    typed.conversions = [];
+  });
+
+  it('should add conversions to a function with one argument', function() {
+    var fn = typed({
+      'string': function (a) {
+        return a;
+      }
+    });
+
+    assert.equal(fn(2), '2');
+    assert.equal(fn(false), 'false');
+    assert.equal(fn('foo'), 'foo');
+  });
+
+  it('should add a conversion using addConversion', function() {
+    var typed2 = typed.create();
+
+    var conversion = {
+      from: 'number',
+      to: 'string',
+      convert: function (x) {
+        return x + '';
+      }
+    };
+
+    assert.equal(typed2.conversions.length, 0);
+
+    typed2.addConversion(conversion);
+
+    assert.equal(typed2.conversions.length, 1);
+    assert.strictEqual(typed2.conversions[0], conversion);
+  });
+
+  it('should throw an error when passing an invalid conversion object to addConversion', function() {
+    var typed2 = typed.create();
+    var errMsg = /TypeError: Object with properties \{from: string, to: string, convert: function} expected/;
+
+    assert.throws(function () {typed2.addConversion({})}, errMsg);
+    assert.throws(function () {typed2.addConversion({from: 'number', to: 'string'})}, errMsg);
+    assert.throws(function () {typed2.addConversion({from: 'number', convert: function () {}})}, errMsg);
+    assert.throws(function () {typed2.addConversion({to: 'string', convert: function () {}})}, errMsg);
+    assert.throws(function () {typed2.addConversion({from: 2, to: 'string', convert: function () {}})}, errMsg);
+    assert.throws(function () {typed2.addConversion({from: 'number', to: 2, convert: function () {}})}, errMsg);
+    assert.throws(function () {typed2.addConversion({from: 'number', to: 'string', convert: 'foo'})}, errMsg);
+  });
+
+  it('should add conversions to a function with multiple arguments', function() {
+    // note: we add 'string, string' first, and `string, number` afterwards,
+    //       to test whether the conversions are correctly ordered.
+    var fn = typed({
+      'string, string': function (a, b) {
+        assert.equal(typeof a, 'string');
+        assert.equal(typeof b, 'string');
+        return 'string, string';
+      },
+      'string, number': function (a, b) {
+        assert.equal(typeof a, 'string');
+        assert.equal(typeof b, 'number');
+        return 'string, number';
+      }
+    });
+
+    assert.equal(fn(true, false), 'string, number');
+    assert.equal(fn(true, 2), 'string, number');
+    assert.equal(fn(true, 'foo'), 'string, string');
+    assert.equal(fn(2, false), 'string, number');
+    assert.equal(fn(2, 3), 'string, number');
+    assert.equal(fn(2, 'foo'), 'string, string');
+    assert.equal(fn('foo', true), 'string, number');
+    assert.equal(fn('foo', 2), 'string, number');
+    assert.equal(fn('foo', 'foo'), 'string, string');
+    assert.deepEqual(Object.keys(fn.signatures), [
+      'string,number',
+      'string,string'
+    ]);
+  });
+
+  it('should add conversions to a function with rest parameters (1)', function() {
+    var toNumber = typed({
+      '...number': function (values) {
+        assert(Array.isArray(values));
+        return values;
+      }
+    });
+
+    assert.deepStrictEqual(toNumber(2,3,4), [2,3,4]);
+    assert.deepStrictEqual(toNumber(2,true,4), [2,1,4]);
+    assert.deepStrictEqual(toNumber(1,2,false), [1,2,0]);
+    assert.deepStrictEqual(toNumber(1,2,true), [1,2,1]);
+    assert.deepStrictEqual(toNumber(true,1,2), [1,1,2]);
+    assert.deepStrictEqual(toNumber(true,false, true), [1,0,1]);
+  });
+
+  it('should add conversions to a function with rest parameters (2)', function() {
+    var sum = typed({
+      'string, ...number': function (name, values) {
+        assert.equal(typeof name, 'string');
+        assert(Array.isArray(values));
+        var sum = 0;
+        for (var i = 0; i < values.length; i++) {
+          sum += values[i];
+        }
+        return sum;
+      }
+    });
+
+    assert.equal(sum('foo', 2,3,4), 9);
+    assert.equal(sum('foo', 2,true,4), 7);
+    assert.equal(sum('foo', 1,2,false), 3);
+    assert.equal(sum('foo', 1,2,true), 4);
+    assert.equal(sum('foo', true,1,2), 4);
+    assert.equal(sum('foo', true,false, true), 2);
+    assert.equal(sum(123, 2,3), 5);
+    assert.equal(sum(false, 2,3), 5);
+  });
+
+  it('should add conversions to a function with rest parameters in a non-conflicting way', function() {
+    var fn = typed({
+      '...number': function (values) {
+        return values;
+      },
+      'boolean': function (value) {
+        assert.equal(typeof value, 'boolean');
+        return 'boolean';
+      }
+    });
+
+    assert.deepStrictEqual(fn(2,3,4), [2,3,4]);
+    assert.deepStrictEqual(fn(2,true,4), [2,1,4]);
+    assert.deepStrictEqual(fn(true,3,4), [1,3,4]);
+    assert.equal(fn(false), 'boolean');
+    assert.equal(fn(true), 'boolean');
+  });
+
+  it('should add conversions to a function with rest parameters in a non-conflicting way', function() {
+    var typed2 = typed.create();
+    typed2.conversions = [
+      {from: 'boolean', to: 'number', convert: function (x) {return +x}},
+      {from: 'string',  to: 'number', convert: function (x) {return parseFloat(x)}},
+      {from: 'string', to: 'boolean', convert: function (x) {return !!x}}
+    ];
+
+    // booleans can be converted to numbers, so the `...number` signature
+    // will match. But the `...boolean` signature is a better (exact) match so that
+    // should be picked
+    var fn = typed2({
+      '...number': function (values) {
+        return values;
+      },
+      '...boolean': function (values) {
+        return values;
+      }
+    });
+
+    assert.deepStrictEqual(fn(2,3,4), [2,3,4]);
+    assert.deepStrictEqual(fn(2,true,4), [2,1,4]);
+    assert.deepStrictEqual(fn(true,true,true), [true,true,true]);
+  });
+
+  it('should add conversions to a function with variable and union arguments', function() {
+    var fn = typed({
+      '...string | number': function (values) {
+        assert(Array.isArray(values));
+        return values;
+      }
+    });
+
+    assert.deepStrictEqual(fn(2,3,4), [2,3,4]);
+    assert.deepStrictEqual(fn(2,true,4), [2,1,4]);
+    assert.deepStrictEqual(fn(2,'str'), [2,'str']);
+    assert.deepStrictEqual(fn('str', true, false), ['str', 1, 0]);
+    assert.deepStrictEqual(fn('str', 2, false), ['str', 2, 0]);
+
+    assert.throws(function () {fn(new Date(), '2')}, /TypeError: Unexpected type of argument in function unnamed \(expected: string or number or boolean, actual: Date, index: 0\)/)
+  });
+
+  it('should order conversions and type Object correctly ', function() {
+    var typed2 = typed.create();
+    typed2.conversions = [
+      {from: 'Date', to: 'string', convert: function (x) {return x.toISOString()}}
+    ];
+
+    var fn = typed2({
+      'string': function () {
+        return 'string';
+      },
+      'Object': function () {
+        return 'object';
+      }
+    });
+
+    assert.equal(fn('foo'), 'string');
+    assert.equal(fn(new Date(2018, 1, 20)), 'string');
+    assert.equal(fn({a: 2}), 'object');
+  });
+
+  it('should add non-conflicting conversions to a function with one argument', function() {
+    var fn = typed({
+      'number': function (a) {
+        return a;
+      },
+      'string': function (a) {
+        return a;
+      }
+    });
+
+    // booleans should be converted to number
+    assert.strictEqual(fn(false), 0);
+    assert.strictEqual(fn(true), 1);
+
+    // numbers and strings should be left as is
+    assert.strictEqual(fn(2), 2);
+    assert.strictEqual(fn('foo'), 'foo');
+  });
+
+  it('should add non-conflicting conversions to a function with one argument', function() {
+    var fn = typed({
+      'boolean': function (a) {
+        return a;
+      }
+    });
+
+    // booleans should be converted to number
+    assert.equal(fn(false), 0);
+    assert.equal(fn(true), 1);
+  });
+
+  it('should add non-conflicting conversions to a function with two arguments', function() {
+    var fn = typed({
+      'boolean, boolean': function (a, b) {
+        return 'boolean, boolean';
+      },
+      'number, number': function (a, b) {
+        return 'number, number';
+      }
+    });
+
+    //console.log('FN', fn.toString());
+
+    // booleans should be converted to number
+    assert.equal(fn(false, true), 'boolean, boolean');
+    assert.equal(fn(2, 4), 'number, number');
+    assert.equal(fn(false, 4), 'number, number');
+    assert.equal(fn(2, true), 'number, number');
+  });
+
+  it('should add non-conflicting conversions to a function with three arguments', function() {
+    var fn = typed({
+      'boolean, boolean, boolean': function (a, b, c) {
+        return 'booleans';
+      },
+      'number, number, number': function (a, b, c) {
+        return 'numbers';
+      }
+    });
+
+    //console.log('FN', fn.toString());
+
+    // booleans should be converted to number
+    assert.equal(fn(false, true, true), 'booleans');
+    assert.equal(fn(false, false, 5), 'numbers');
+    assert.equal(fn(false, 4, false), 'numbers');
+    assert.equal(fn(2, false, false), 'numbers');
+    assert.equal(fn(false, 4, 5), 'numbers');
+    assert.equal(fn(2, false, 5), 'numbers');
+    assert.equal(fn(2, 4, false), 'numbers');
+    assert.equal(fn(2, 4, 5), 'numbers');
+  });
+
+  it('should not apply conversions when having an any type argument', function() {
+    var fn = typed({
+      'number': function (a) {
+        return 'number';
+      },
+      'any': function (a) {
+        return 'any';
+      }
+    });
+
+    assert.equal(fn(2), 'number');
+    assert.equal(fn(true), 'any');
+    assert.equal(fn('foo'), 'any');
+    assert.equal(fn('{}'), 'any');
+  });
+
+  describe ('ordering', function () {
+
+    it('should correctly select the signatures with the least amount of conversions', function () {
+      typed.conversions = [
+        {from: 'boolean', to: 'number', convert: function (x) {return +x;}},
+        {from: 'number',  to: 'string', convert: function (x) {return x + '';}},
+        {from: 'boolean', to: 'string', convert: function (x) {return x + '';}}
+      ];
+
+      var fn = typed({
+        'boolean, boolean': function (a, b) {
+          assert.equal(typeof a, 'boolean');
+          assert.equal(typeof b, 'boolean');
+          return 'booleans';
+        },
+        'number, number': function (a, b) {
+          assert.equal(typeof a, 'number');
+          assert.equal(typeof b, 'number');
+          return 'numbers';
+        },
+        'string, string': function (a, b) {
+          assert.equal(typeof a, 'string');
+          assert.equal(typeof b, 'string');
+          return 'strings';
+        }
+      });
+
+      assert.equal(fn(true, true), 'booleans');
+      assert.equal(fn(2, true), 'numbers');
+      assert.equal(fn(true, 2), 'numbers');
+      assert.equal(fn(2, 2), 'numbers');
+      assert.equal(fn('foo', 'bar'), 'strings');
+      assert.equal(fn('foo', 2), 'strings');
+      assert.equal(fn(2, 'foo'), 'strings');
+      assert.equal(fn(true, 'foo'), 'strings');
+      assert.equal(fn('foo', true), 'strings');
+
+      assert.deepEqual(Object.keys(fn.signatures), [
+        'number,number',
+        'string,string',
+        'boolean,boolean'
+      ]);
+    });
+
+    it('should select the signatures with the conversion with the lowest index (1)', function () {
+      typed.conversions = [
+        {from: 'boolean', to: 'string', convert: function (x) {return x + '';}},
+        {from: 'boolean', to: 'number', convert: function (x) {return x + 0;}}
+      ];
+
+      // in the following typed function, a boolean input can be converted to
+      // both a string or a number, which is both ok. In that case,
+      // the conversion with the lowest index should be picked: boolean -> string
+      var fn = typed({
+        'string | number': function (a) {
+          return a;
+        }
+      });
+
+      assert.strictEqual(fn(true), 'true');
+
+      assert.deepEqual(Object.keys(fn.signatures), [
+        'number',
+        'string'
+      ]);
+    });
+
+    it('should select the signatures with the conversion with the lowest index (2)', function () {
+      typed.conversions = [
+        {from: 'boolean', to: 'number', convert: function (x) {return x + 0;}},
+        {from: 'boolean', to: 'string', convert: function (x) {return x + '';}}
+      ];
+
+      // in the following typed function, a boolean input can be converted to
+      // both a string or a number, which is both ok. In that case,
+      // the conversion with the lowest index should be picked: boolean -> number
+      var fn = typed({
+        'string | number': function (a) {
+          return a;
+        }
+      });
+
+      assert.strictEqual(fn(true), 1);
+    });
+
+    it('should select the signatures with least needed conversions (1)', function () {
+      typed.conversions = [
+        {from: 'number', to: 'boolean', convert: function (x) {return !!x }},
+        {from: 'number', to: 'string', convert: function (x) {return x + '' }},
+        {from: 'boolean', to: 'string', convert: function (x) {return x + '' }}
+      ];
+
+      // in the following typed function, the number input can be converted to
+      // both a string or a boolean, which is both ok. It should pick the
+      // conversion to boolean because that is defined first
+      var fn = typed({
+        'string': function (a) { return a; },
+        'boolean': function (a) { return a; }
+      });
+
+      assert.strictEqual(fn(1), true);
+    });
+
+    it('should select the signatures with least needed conversions (2)', function () {
+      typed.conversions = [
+        {from: 'number', to: 'boolean', convert: function (x) {return !!x }},
+        {from: 'number', to: 'string', convert: function (x) {return x + '' }},
+        {from: 'boolean', to: 'string', convert: function (x) {return x + '' }}
+      ];
+
+      // in the following typed function, the number input can be converted to
+      // both a string or a boolean, which is both ok. It should pick the
+      // conversion to boolean because that conversion is defined first
+      var fn = typed({
+        'number, number': function (a, b) { return [a, b]; },
+        'string, string': function (a, b) { return [a, b]; },
+        'boolean, boolean': function (a, b) { return [a, b]; }
+      });
+
+      assert.deepStrictEqual(fn('foo', 2), ['foo', '2']);
+      assert.deepStrictEqual(fn(1, true), [true, true]);
+    });
+
+  });
+
+});
diff --git a/node_modules/typed-function/test/convert.test.js b/node_modules/typed-function/test/convert.test.js
new file mode 100644
index 0000000..ec422e8
--- /dev/null
+++ b/node_modules/typed-function/test/convert.test.js
@@ -0,0 +1,42 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('convert', function () {
+
+  before(function () {
+    typed.conversions = [
+      {from: 'boolean', to: 'number', convert: function (x) {return +x;}},
+      {from: 'boolean', to: 'string', convert: function (x) {return x + '';}},
+      {from: 'number',  to: 'string', convert: function (x) {return x + '';}},
+      {
+        from: 'string',
+        to: 'Date',
+        convert: function (x) {
+          var d = new Date(x);
+          return isNaN(d.valueOf()) ? undefined : d;
+        },
+        fallible: true // TODO: not yet supported
+      }
+    ];
+  });
+
+  after(function () {
+    // cleanup conversions
+    typed.conversions = [];
+  });
+
+  it('should convert a value', function() {
+    assert.strictEqual(typed.convert(2, 'string'), '2');
+    assert.strictEqual(typed.convert(true, 'string'), 'true');
+    assert.strictEqual(typed.convert(true, 'number'), 1);
+  });
+  
+  it('should return same value when conversion is not needed', function () {
+    assert.strictEqual(typed.convert(2, 'number'), 2);
+    assert.strictEqual(typed.convert(true, 'boolean'), true);
+  });
+
+  it('should throw an error when no conversion function is found', function() {
+    assert.throws(function () {typed.convert(2, 'boolean')}, /Error: Cannot convert from number to boolean/);
+  });
+});
diff --git a/node_modules/typed-function/test/errors.test.js b/node_modules/typed-function/test/errors.test.js
new file mode 100644
index 0000000..10837ca
--- /dev/null
+++ b/node_modules/typed-function/test/errors.test.js
@@ -0,0 +1,157 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('errors', function () {
+  it('should give correct error in case of too few arguments (named function)', function() {
+    var fn = typed('fn1', {'string, boolean': function () {}});
+
+    assert.throws(function () {fn()}, /TypeError: Too few arguments in function fn1 \(expected: string, index: 0\)/);
+    assert.throws(function () {fn('foo')}, /TypeError: Too few arguments in function fn1 \(expected: boolean, index: 1\)/);
+  });
+
+  it('should give correct error in case of too few arguments (unnamed function)', function() {
+    var fn = typed({'string, boolean': function () {}});
+
+    assert.throws(function () {fn()}, /TypeError: Too few arguments in function unnamed \(expected: string, index: 0\)/);
+    assert.throws(function () {fn('foo')}, /TypeError: Too few arguments in function unnamed \(expected: boolean, index: 1\)/);
+  });
+
+  it('should give correct error in case of too few arguments (rest params)', function() {
+    var fn = typed({'...string': function () {}});
+
+    assert.throws(function () {fn()}, /TypeError: Too few arguments in function unnamed \(expected: string, index: 0\)/);
+  });
+
+  it('should give correct error in case of too few arguments (rest params) (2)', function() {
+    var fn = typed({'boolean, ...string': function () {}});
+
+    assert.throws(function () {fn()}, /TypeError: Too few arguments in function unnamed \(expected: boolean, index: 0\)/);
+    assert.throws(function () {fn(true)}, /TypeError: Too few arguments in function unnamed \(expected: string, index: 1\)/);
+  });
+
+  it('should give correct error in case of too many arguments (unnamed function)', function() {
+    var fn = typed({'string, boolean': function () {}});
+
+    assert.throws(function () {fn('foo', true, 2)}, /TypeError: Too many arguments in function unnamed \(expected: 2, actual: 3\)/);
+    assert.throws(function () {fn('foo', true, 2, 1)}, /TypeError: Too many arguments in function unnamed \(expected: 2, actual: 4\)/);
+  });
+
+  it('should give correct error in case of too many arguments (named function)', function() {
+    var fn = typed('fn2', {'string, boolean': function () {}});
+
+    assert.throws(function () {fn('foo', true, 2)}, /TypeError: Too many arguments in function fn2 \(expected: 2, actual: 3\)/);
+    assert.throws(function () {fn('foo', true, 2, 1)}, /TypeError: Too many arguments in function fn2 \(expected: 2, actual: 4\)/);
+  });
+
+  it('should give correct error in case of wrong type of argument (unnamed function)', function() {
+    var fn = typed({'boolean': function () {}});
+
+    assert.throws(function () {fn('foo')}, /TypeError: Unexpected type of argument in function unnamed \(expected: boolean, actual: string, index: 0\)/);
+  });
+
+  it('should give correct error in case of wrong type of argument (named function)', function() {
+    var fn = typed('fn3', {'boolean': function () {}});
+
+    assert.throws(function () {fn('foo')}, /TypeError: Unexpected type of argument in function fn3 \(expected: boolean, actual: string, index: 0\)/);
+  });
+
+  it('should give correct error in case of wrong type of argument (union args)', function() {
+    var fn = typed({'boolean | string | Date': function () {}});
+
+    assert.throws(function () {fn(2)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string or boolean or Date, actual: number, index: 0\)/);
+  });
+
+  it('should give correct error in case of conflicting union arguments', function() {
+    assert.throws(function () {
+      var fn = typed({
+        'string | number': function () {},
+        'string': function () {}
+      });
+    }, /TypeError: Conflicting signatures "string\|number" and "string"/);
+  });
+
+  it('should give correct error in case of conflicting union arguments (2)', function() {
+    assert.throws(function () {
+      var fn = typed({
+        '...string | number': function () {},
+        '...string': function () {}
+      });
+    }, /TypeError: Conflicting signatures "...string\|number" and "...string"/);
+  });
+
+  it('should give correct error in case of conflicting rest params (1)', function() {
+    assert.throws(function () {
+      var fn = typed({
+        '...string': function () {},
+        'string': function () {}
+      });
+    }, /TypeError: Conflicting signatures "...string" and "string"/);
+  });
+
+  it('should give correct error in case of conflicting rest params (2)', function() {
+    // should not throw
+    var fn = typed({
+      '...string': function () {},
+      'string, number': function () {}
+    });
+
+    assert.throws(function () {
+      var fn = typed({
+        '...string': function () {},
+        'string, string': function () {}
+      });
+    }, /TypeError: Conflicting signatures "...string" and "string,string"/);
+  });
+
+  it('should give correct error in case of conflicting rest params (3)', function() {
+    assert.throws(function () {
+      var fn = typed({
+        '...number|string': function () {},
+        'number, string': function () {}
+      });
+    }, /TypeError: Conflicting signatures "...number\|string" and "number,string"/);
+  });
+
+  it('should give correct error in case of wrong type of argument (rest params)', function() {
+    var fn = typed({'...number': function () {}});
+
+    assert.throws(function () {fn(true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 0\)/);
+    assert.throws(function () {fn(2, true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 1\)/);
+    assert.throws(function () {fn(2, 3, true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 2\)/);
+  });
+
+  it('should give correct error in case of wrong type of argument (nested rest params)', function() {
+    var fn = typed({'string, ...number': function () {}});
+
+    assert.throws(function () {fn(true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string, actual: boolean, index: 0\)/);
+    assert.throws(function () {fn('foo', true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 1\)/);
+    assert.throws(function () {fn('foo', 2, true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 2\)/);
+    assert.throws(function () {fn('foo', 2, 3, true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 3\)/);
+  });
+
+  it('should give correct error in case of wrong type of argument (union and rest params)', function() {
+    var fn = typed({'...number|boolean': function () {}});
+
+    assert.throws(function () {fn('foo')}, /TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: string, index: 0\)/);
+    assert.throws(function () {fn(2, 'foo')}, /TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: string, index: 1\)/);
+    assert.throws(function () {fn(2, true, 'foo')}, /TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: string, index: 2\)/);
+  });
+
+  it('should only list matches of exact and convertable types', function() {
+    var typed2 = typed.create();
+    typed2.conversions.push({
+      from: 'number',
+      to: 'string',
+      convert: function (x) {
+        return +x;
+      }
+    });
+
+    var fn1 = typed2({'string': function () {}});
+    var fn2 = typed2({'...string': function () {}});
+
+    assert.throws(function () {fn1(true)},    /TypeError: Unexpected type of argument in function unnamed \(expected: string or number, actual: boolean, index: 0\)/);
+    assert.throws(function () {fn2(true)},    /TypeError: Unexpected type of argument in function unnamed \(expected: string or number, actual: boolean, index: 0\)/);
+    assert.throws(function () {fn2(2, true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string or number, actual: boolean, index: 1\)/);
+  });
+});
diff --git a/node_modules/typed-function/test/find.test.js b/node_modules/typed-function/test/find.test.js
new file mode 100644
index 0000000..2770a58
--- /dev/null
+++ b/node_modules/typed-function/test/find.test.js
@@ -0,0 +1,48 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('find', function () {
+
+  function a () {}
+  function b () {}
+  function c () {}
+  function d () {}
+  function e () {}
+
+  var fn = typed('fn', {
+    'number': a,
+    'string, ...number': b,
+    'number, boolean': c,
+    'any': d,
+    '': e
+  });
+
+
+  it('should find a signature from an array with types', function() {
+    assert.strictEqual(typed.find(fn, ['number']), a);
+    assert.strictEqual(typed.find(fn, ['number', 'boolean']), c);
+    assert.strictEqual(typed.find(fn, ['any']), d);
+    assert.strictEqual(typed.find(fn, []), e);
+
+  });
+
+  it('should find a signature from a comma separated string with types', function() {
+    assert.strictEqual(typed.find(fn, 'number'), a);
+    assert.strictEqual(typed.find(fn, 'number,boolean'), c);
+    assert.strictEqual(typed.find(fn, ' number, boolean '), c); // with spaces
+    assert.strictEqual(typed.find(fn, 'any'), d);
+    assert.strictEqual(typed.find(fn, ''), e);
+  });
+
+  it('should throw an error when not found', function() {
+    assert.throws(function () {
+      typed.find(fn, 'number, number');
+    }, /TypeError: Signature not found \(signature: fn\(number, number\)\)/);
+  });
+
+
+  // TODO: implement support for matching non-exact signatures
+  //assert.strictEqual(typed.find(fn, ['Array']), d);
+
+
+});
diff --git a/node_modules/typed-function/test/merge.test.js b/node_modules/typed-function/test/merge.test.js
new file mode 100644
index 0000000..e32ea5c
--- /dev/null
+++ b/node_modules/typed-function/test/merge.test.js
@@ -0,0 +1,118 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('merge', function () {
+  it('should merge two typed-functions', function () {
+    var typed1 = typed({'boolean': function (value) { return 'boolean:' + value; }});
+    var typed2 = typed({'number':  function (value) { return 'number:' + value;  }});
+
+    var typed3 = typed(typed1, typed2);
+
+    assert.deepEqual(Object.keys(typed3.signatures).sort(), ['boolean', 'number']);
+
+    assert.strictEqual(typed3(true), 'boolean:true');
+    assert.strictEqual(typed3(2), 'number:2');
+    assert.throws(function () {typed3('foo')}, /TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: string, index: 0\)/);
+  });
+
+  it('should merge three typed-functions', function () {
+    var typed1 = typed({'boolean': function (value) { return 'boolean:' + value; }});
+    var typed2 = typed({'number':  function (value) { return 'number:' + value;  }});
+    var typed3 = typed({'string':  function (value) { return 'string:' + value;  }});
+
+    var typed4 = typed(typed1, typed2, typed3);
+
+    assert.deepEqual(Object.keys(typed4.signatures).sort(), ['boolean', 'number', 'string']);
+
+    assert.strictEqual(typed4(true), 'boolean:true');
+    assert.strictEqual(typed4(2), 'number:2');
+    assert.strictEqual(typed4('foo'), 'string:foo');
+    assert.throws(function () {typed4(new Date())}, /TypeError: Unexpected type of argument in function unnamed \(expected: number or string or boolean, actual: Date, index: 0\)/);
+  });
+
+  it('should merge two typed-functions with a custom name', function () {
+    var typed1 = typed('typed1', {'boolean': function (value) { return 'boolean:' + value; }});
+    var typed2 = typed('typed2', {'number':  function (value) { return 'number:' + value;  }});
+
+    var typed3 = typed('typed3', typed1, typed2);
+
+    assert.equal(typed3.name, 'typed3');
+  });
+
+  it('should not copy conversions as exact signatures', function () {
+    var typed2 = typed.create();
+    typed2.conversions = [
+      {from: 'string', to: 'number', convert: function (x) {return parseFloat(x)}}
+    ];
+
+    var fn2 = typed2({'number': function (value) { return value }});
+
+    assert.strictEqual(fn2(2), 2);
+    assert.strictEqual(fn2('123'), 123);
+
+    var fn1 = typed({ 'Date': function (value) {return value} });
+    var fn3 = typed(fn1, fn2); // create via typed which has no conversions
+
+    var date = new Date()
+    assert.strictEqual(fn3(2), 2);
+    assert.strictEqual(fn3(date), date);
+    assert.throws(function () {fn3('123') }, /TypeError: Unexpected type of argument in function unnamed \(expected: number or Date, actual: string, index: 0\)/);
+  });
+
+  it('should allow merging duplicate signatures when pointing to the same function', function () {
+    var typed1 = typed({'boolean': function (value) { return 'boolean:' + value; }});
+
+    var merged = typed(typed1, typed1);
+
+    assert.deepEqual(Object.keys(merged.signatures).sort(), ['boolean']);
+  });
+
+  it('should throw an error in case of conflicting signatures when merging', function () {
+    var typed1 = typed({'boolean': function (value) { return 'boolean:' + value; }});
+    var typed2 = typed({'boolean': function (value) { return 'boolean:' + value; }});
+
+    assert.throws(function () {
+      typed(typed1, typed2)
+    }, /Error: Signature "boolean" is defined twice/);
+  });
+
+  it('should throw an error in case of conflicting names when merging', function () {
+    var typed1 = typed('fn1', {'boolean': function () {}});
+    var typed2 = typed('fn2', {'string': function () {}});
+    var typed3 = typed({'number': function () {}});
+
+    assert.throws(function () {
+      typed(typed1, typed2)
+    }, /Error: Function names do not match \(expected: fn1, actual: fn2\)/);
+
+    var typed4 = typed(typed2, typed3);
+    assert.equal(typed4.name, 'fn2');
+  });
+
+  it('should allow recursive across merged signatures', function () {
+    var fn1 = typed({
+      '...number': function (values) {
+        var sum = 0;
+        for (var i = 0; i < values.length; i++) {
+          sum += values[i];
+        }
+        return sum;
+      }
+    });
+
+    var fn2 = typed({
+      '...string': function (values) {
+        var newValues = [];
+        for (var i = 0; i < values.length; i++) {
+          newValues[i] = parseInt(values[i], 10);
+        }
+        return this.apply(null, newValues);
+      }
+    });
+
+    var fn3 = typed(fn1, fn2);
+
+    assert.equal(fn3('1', '2', '3'), '6');
+    assert.equal(fn3(1, 2, 3), 6);
+  })
+});
diff --git a/node_modules/typed-function/test/onMismatch.test.js b/node_modules/typed-function/test/onMismatch.test.js
new file mode 100644
index 0000000..e951468
--- /dev/null
+++ b/node_modules/typed-function/test/onMismatch.test.js
@@ -0,0 +1,40 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('onMismatch handler', () => {
+  const square = typed('square', {
+    number: x => x*x,
+    string: s => s + s
+  })
+
+  it('should replace the return value of a mismatched call', () => {
+    typed.onMismatch = () => 42
+    assert.strictEqual(square(5), 25)
+    assert.strictEqual(square('yo'), 'yoyo')
+    assert.strictEqual(square([13]), 42)
+  })
+
+  const myErrorLog = []
+  it('should allow error logging', () => {
+    typed.onMismatch = (name, args, signatures) => {
+      myErrorLog.push(typed.createError(name, args, signatures))
+      return null
+    }
+    square({the: 'circle'})
+    square(7)
+    square('me')
+    square(1,2)
+    assert.strictEqual(myErrorLog.length, 2)
+    assert('data' in myErrorLog[0])
+  })
+
+  it('should allow changing the error', () => {
+    typed.onMismatch = name => { throw Error('Problem with ' + name) }
+    assert.throws(() => square(['one']), /Problem with square/)
+  })
+
+  it('should allow a return to standard behavior', () => {
+    typed.onMismatch = typed.throwMismatchError
+    assert.throws(() => square('be', 'there'), TypeError)
+  })
+})
diff --git a/node_modules/typed-function/test/rest_params.js b/node_modules/typed-function/test/rest_params.js
new file mode 100644
index 0000000..5a88912
--- /dev/null
+++ b/node_modules/typed-function/test/rest_params.js
@@ -0,0 +1,200 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+var strictEqualArray = require('./strictEqualArray');
+
+describe('rest parameters', function () {
+
+  it('should create a typed function with rest parameters', function() {
+    var sum = typed({
+      '...number': function (values) {
+        assert(Array.isArray(values));
+        var sum = 0;
+        for (var i = 0; i < values.length; i++) {
+          sum += values[i];
+        }
+        return sum;
+      }
+    });
+
+    assert.equal(sum(2), 2);
+    assert.equal(sum(2,3,4), 9);
+    assert.throws(function () {sum()},                /TypeError: Too few arguments in function unnamed \(expected: number, index: 0\)/);
+    assert.throws(function () {sum(true)},            /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 0\)/);
+    assert.throws(function () {sum('string')},        /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: string, index: 0\)/);
+    assert.throws(function () {sum(2, 'string')},     /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: string, index: 1\)/);
+    assert.throws(function () {sum(2, 3, 'string')},  /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: string, index: 2\)/);
+  });
+
+  it('should create a typed function with rest parameters (2)', function() {
+    var fn = typed({
+      'string, ...number': function (str, values) {
+        assert.equal(typeof str, 'string');
+        assert(Array.isArray(values));
+        return str + ': ' + values.join(', ');
+      }
+    });
+
+    assert.equal(fn('foo', 2), 'foo: 2');
+    assert.equal(fn('foo', 2, 4), 'foo: 2, 4');
+    assert.throws(function () {fn(2, 4)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string, actual: number, index: 0\)/);
+    assert.throws(function () {fn('string')}, /TypeError: Too few arguments in function unnamed \(expected: number, index: 1\)/);
+    assert.throws(function () {fn('string', 'string')}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: string, index: 1\)/);
+  });
+
+  it('should create a typed function with any type arguments (1)', function() {
+    var fn = typed({
+      'string, ...any': function (str, values) {
+        assert.equal(typeof str, 'string');
+        assert(Array.isArray(values));
+        return str + ': ' + values.join(', ');
+      }
+    });
+
+    assert.equal(fn('foo', 2), 'foo: 2');
+    assert.equal(fn('foo', 2, true, 'bar'), 'foo: 2, true, bar');
+    assert.equal(fn('foo', 'bar'), 'foo: bar');
+    assert.throws(function () {fn(2, 4)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string, actual: number, index: 0\)/);
+    assert.throws(function () {fn('string')}, /TypeError: Too few arguments in function unnamed \(expected: any, index: 1\)/);
+  });
+
+  it('should create a typed function with implicit any type arguments', function() {
+    var fn = typed({
+      'string, ...': function (str, values) {
+        assert.equal(typeof str, 'string');
+        assert(Array.isArray(values));
+        return str + ': ' + values.join(', ');
+      }
+    });
+
+    assert.equal(fn('foo', 2), 'foo: 2');
+    assert.equal(fn('foo', 2, true, 'bar'), 'foo: 2, true, bar');
+    assert.equal(fn('foo', 'bar'), 'foo: bar');
+    assert.throws(function () {fn(2, 4)}, /TypeError: Unexpected type of argument in function unnamed \(expected: string, actual: number, index: 0\)/);
+    assert.throws(function () {fn('string')}, /TypeError: Too few arguments in function unnamed \(expected: any, index: 1\)/);
+  });
+
+  it('should create a typed function with any type arguments (2)', function() {
+    var fn = typed({
+      'any, ...number': function (any, values) {
+        assert(Array.isArray(values));
+        return any + ': ' + values.join(', ');
+      }
+    });
+
+    assert.equal(fn('foo', 2), 'foo: 2');
+    assert.equal(fn(1, 2, 4), '1: 2, 4');
+    assert.equal(fn(null, 2, 4), 'null: 2, 4');
+    assert.throws(function () {fn('string')},           /TypeError: Too few arguments in function unnamed \(expected: number, index: 1\)/);
+    assert.throws(function () {fn('string', 'string')}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: string, index: 1\)/);
+  });
+
+  it('should create a typed function with union type arguments', function() {
+    var fn = typed({
+      '...number|string': function (values) {
+        assert(Array.isArray(values));
+        return values;
+      }
+    });
+
+    strictEqualArray(fn(2,3,4), [2,3,4]);
+    strictEqualArray(fn('a','b','c'), ['a','b','c']);
+    strictEqualArray(fn('a',2,'c',3), ['a',2,'c',3]);
+    assert.throws(function () {fn()},               /TypeError: Too few arguments in function unnamed \(expected: number or string, index: 0\)/);
+    assert.throws(function () {fn('string', true)}, /TypeError: Unexpected type of argument. Index: 1 in function unnamed \(expected: string | number/);
+    assert.throws(function () {fn(2, false)},       /TypeError: Unexpected type of argument. Index: 1 in function unnamed \(expected: string | number/);
+    assert.throws(function () {fn(2, 3, false)},    /TypeError: Unexpected type of argument. Index: 2 in function unnamed \(expected: string | number/);
+  });
+
+  it('should create a composed function with rest parameters', function() {
+    var fn = typed({
+      'string, ...number': function (str, values) {
+        assert.equal(typeof str, 'string');
+        assert(Array.isArray(values));
+        return str + ': ' + values.join(', ');
+      },
+
+      '...boolean': function (values) {
+        assert(Array.isArray(values));
+        return 'booleans';
+      }
+    });
+
+    assert.equal(fn('foo', 2), 'foo: 2');
+    assert.equal(fn('foo', 2, 4), 'foo: 2, 4');
+    assert.equal(fn(true, false, false), 'booleans');
+    assert.throws(function () {fn(2, 4)},           /TypeError: Unexpected type of argument in function unnamed \(expected: string or boolean, actual: number, index: 0\)/);
+    assert.throws(function () {fn('string')},       /TypeError: Too few arguments in function unnamed \(expected: number, index: 1\)/);
+    assert.throws(function () {fn('string', true)}, /TypeError: Unexpected type of argument in function unnamed \(expected: number, actual: boolean, index: 1\)/);
+  });
+
+  it('should continue with other options if rest params do not match', function() {
+    var fn = typed({
+      '...number': function (values) {
+        return '...number';
+      },
+
+      'Object': function (value) {
+        return 'Object';
+      }
+    });
+
+    assert.equal(fn(2, 3), '...number');
+    assert.equal(fn(2), '...number');
+    assert.equal(fn({}), 'Object');
+    assert.deepEqual(Object.keys(fn.signatures), [
+      'Object',
+      '...number'
+    ]);
+  });
+
+  it('should split rest params with conversions in two and order them correctly', function() {
+    var typed2 = typed.create()
+    typed2.conversions = [
+      {from: 'string', to: 'number', convert: function (x) {return parseFloat(x)}}
+    ];
+
+    var fn = typed2({
+      '...number': function (values) {
+        return values;
+      },
+
+      '...string': function (value) {
+        return value;
+      }
+    });
+
+    assert.deepEqual(fn(2, 3), [2,3]);
+    assert.deepEqual(fn(2), [2]);
+    assert.deepEqual(fn(2, '4'), [2, 4]);
+    assert.deepEqual(fn('2', 4), [2, 4]);
+    assert.deepEqual(fn('foo'), ['foo']);
+    assert.deepEqual(Object.keys(fn.signatures), [
+      '...number',
+      '...string'
+    ]);
+  });
+
+  it('should throw an error in case of unexpected rest parameters', function() {
+    assert.throws(function () {
+      typed({'...number, string': function () {}});
+    }, /SyntaxError: Unexpected rest parameter "...number": only allowed for the last parameter/);
+  });
+
+  it('should correctly interact with any', function() {
+    var fn = typed({
+      'string': function () {
+        return 'one';
+      },
+      '...any': function () {
+        return 'two';
+      }
+    });
+
+    assert.equal(fn('a'), 'one');
+    assert.equal(fn([]), 'two');
+    assert.equal(fn('a','a'), 'two');
+    assert.equal(fn('a',[]), 'two');
+    assert.equal(fn([],[]), 'two');
+  });
+
+});
diff --git a/node_modules/typed-function/test/security.test.js b/node_modules/typed-function/test/security.test.js
new file mode 100644
index 0000000..0b5a5f8
--- /dev/null
+++ b/node_modules/typed-function/test/security.test.js
@@ -0,0 +1,17 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('security', function () {
+
+  it ('should not allow bad code in the function name', function () {
+    // simple example:
+    // var fn = typed("(){}+console.log('hacked...');function a", {     
+    //   "": function () {} 
+    // });
+
+    // example resulting in throwing an error if successful
+    var fn = typed("(){}+(function(){throw new Error('Hacked... should not have executed this function!!!')})();function a", { 
+      "": function () {} 
+    });
+  })
+})
diff --git a/node_modules/typed-function/test/strictEqualArray.js b/node_modules/typed-function/test/strictEqualArray.js
new file mode 100644
index 0000000..2cb2124
--- /dev/null
+++ b/node_modules/typed-function/test/strictEqualArray.js
@@ -0,0 +1,14 @@
+var assert = require('assert');
+
+/**
+ * Test strict equality of all elements in two arrays.
+ * @param {Array} a
+ * @param {Array} b
+ */
+module.exports = function strictEqualArray(a, b) {
+  assert.strictEqual(a.length, b.length);
+
+  for (var i = 0; i < a.length; a++) {
+    assert.strictEqual(a[i], b[i]);
+  }
+};
diff --git a/node_modules/typed-function/test/union_types.test.js b/node_modules/typed-function/test/union_types.test.js
new file mode 100644
index 0000000..9bf15aa
--- /dev/null
+++ b/node_modules/typed-function/test/union_types.test.js
@@ -0,0 +1,18 @@
+var assert = require('assert');
+var typed = require('../typed-function');
+
+describe('union types', function () {
+
+  it('should create a typed function with union types', function() {
+    var fn = typed({
+      'number | boolean': function (arg) {
+        return typeof arg;
+      }
+    });
+
+    assert.equal(fn(true), 'boolean');
+    assert.equal(fn(2), 'number');
+    assert.throws(function () {fn('string')}, /TypeError: Unexpected type of argument in function unnamed \(expected: number or boolean, actual: string, index: 0\)/);
+  });
+
+});
diff --git a/node_modules/typed-function/typed-function.js b/node_modules/typed-function/typed-function.js
new file mode 100644
index 0000000..a62e5ca
--- /dev/null
+++ b/node_modules/typed-function/typed-function.js
@@ -0,0 +1,1404 @@
+/**
+ * typed-function
+ *
+ * Type checking for JavaScript functions
+ *
+ * https://github.com/josdejong/typed-function
+ */
+'use strict';
+
+(function (root, factory) {
+  if (typeof define === 'function' && define.amd) {
+    // AMD. Register as an anonymous module.
+    define([], factory);
+  } else if (typeof exports === 'object') {
+    // OldNode. Does not work with strict CommonJS, but
+    // only CommonJS-like environments that support module.exports,
+    // like OldNode.
+    module.exports = factory();
+  } else {
+    // Browser globals (root is window)
+    root.typed = factory();
+  }
+}(this, function () {
+
+  function ok () {
+    return true;
+  }
+
+  function notOk () {
+    return false;
+  }
+
+  function undef () {
+    return undefined;
+  }
+
+  /**
+   * @typedef {{
+   *   params: Param[],
+   *   fn: function
+   * }} Signature
+   *
+   * @typedef {{
+   *   types: Type[],
+   *   restParam: boolean
+   * }} Param
+   *
+   * @typedef {{
+   *   name: string,
+   *   typeIndex: number,
+   *   test: function,
+   *   conversion?: ConversionDef,
+   *   conversionIndex: number,
+   * }} Type
+   *
+   * @typedef {{
+   *   from: string,
+   *   to: string,
+   *   convert: function (*) : *
+   * }} ConversionDef
+   *
+   * @typedef {{
+   *   name: string,
+   *   test: function(*) : boolean
+   * }} TypeDef
+   */
+
+  // create a new instance of typed-function
+  function create () {
+    // data type tests
+    var _types = [
+      { name: 'number',    test: function (x) { return typeof x === 'number' } },
+      { name: 'string',    test: function (x) { return typeof x === 'string' } },
+      { name: 'boolean',   test: function (x) { return typeof x === 'boolean' } },
+      { name: 'Function',  test: function (x) { return typeof x === 'function'} },
+      { name: 'Array',     test: Array.isArray },
+      { name: 'Date',      test: function (x) { return x instanceof Date } },
+      { name: 'RegExp',    test: function (x) { return x instanceof RegExp } },
+      { name: 'Object',    test: function (x) {
+        return typeof x === 'object' && x !== null && x.constructor === Object
+      }},
+      { name: 'null',      test: function (x) { return x === null } },
+      { name: 'undefined', test: function (x) { return x === undefined } }
+    ];
+
+    var anyType = {
+      name: 'any',
+      test: ok
+    }
+
+    // types which need to be ignored
+    var _ignore = [];
+
+    // type conversions
+    var _conversions = [];
+
+    // This is a temporary object, will be replaced with a typed function at the end
+    var typed = {
+      types: _types,
+      conversions: _conversions,
+      ignore: _ignore
+    };
+
+    /**
+     * Find the test function for a type
+     * @param {String} typeName
+     * @return {TypeDef} Returns the type definition when found,
+     *                    Throws a TypeError otherwise
+     */
+    function findTypeByName (typeName) {
+      var entry = findInArray(typed.types, function (entry) {
+        return entry.name === typeName;
+      });
+
+      if (entry) {
+        return entry;
+      }
+
+      if (typeName === 'any') { // special baked-in case 'any'
+        return anyType;
+      }
+
+      var hint = findInArray(typed.types, function (entry) {
+        return entry.name.toLowerCase() === typeName.toLowerCase();
+      });
+
+      throw new TypeError('Unknown type "' + typeName + '"' +
+          (hint ? ('. Did you mean "' + hint.name + '"?') : ''));
+    }
+
+    /**
+     * Find the index of a type definition. Handles special case 'any'
+     * @param {TypeDef} type
+     * @return {number}
+     */
+    function findTypeIndex(type) {
+      if (type === anyType) {
+        return 999;
+      }
+
+      return typed.types.indexOf(type);
+    }
+
+    /**
+     * Find a type that matches a value.
+     * @param {*} value
+     * @return {string} Returns the name of the first type for which
+     *                  the type test matches the value.
+     */
+    function findTypeName(value) {
+      var entry = findInArray(typed.types, function (entry) {
+        return entry.test(value);
+      });
+
+      if (entry) {
+        return entry.name;
+      }
+
+      throw new TypeError('Value has unknown type. Value: ' + value);
+    }
+
+    /**
+     * Find a specific signature from a (composed) typed function, for example:
+     *
+     *   typed.find(fn, ['number', 'string'])
+     *   typed.find(fn, 'number, string')
+     *
+     * Function find only only works for exact matches.
+     *
+     * @param {Function} fn                   A typed-function
+     * @param {string | string[]} signature   Signature to be found, can be
+     *                                        an array or a comma separated string.
+     * @return {Function}                     Returns the matching signature, or
+     *                                        throws an error when no signature
+     *                                        is found.
+     */
+    function find (fn, signature) {
+      if (!fn.signatures) {
+        throw new TypeError('Function is no typed-function');
+      }
+
+      // normalize input
+      var arr;
+      if (typeof signature === 'string') {
+        arr = signature.split(',');
+        for (var i = 0; i < arr.length; i++) {
+          arr[i] = arr[i].trim();
+        }
+      }
+      else if (Array.isArray(signature)) {
+        arr = signature;
+      }
+      else {
+        throw new TypeError('String array or a comma separated string expected');
+      }
+
+      var str = arr.join(',');
+
+      // find an exact match
+      var match = fn.signatures[str];
+      if (match) {
+        return match;
+      }
+
+      // TODO: extend find to match non-exact signatures
+
+      throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + arr.join(', ') + '))');
+    }
+
+    /**
+     * Convert a given value to another data type.
+     * @param {*} value
+     * @param {string} type
+     */
+    function convert (value, type) {
+      var from = findTypeName(value);
+
+      // check conversion is needed
+      if (type === from) {
+        return value;
+      }
+
+      for (var i = 0; i < typed.conversions.length; i++) {
+        var conversion = typed.conversions[i];
+        if (conversion.from === from && conversion.to === type) {
+          return conversion.convert(value);
+        }
+      }
+
+      throw new Error('Cannot convert from ' + from + ' to ' + type);
+    }
+    
+    /**
+     * Stringify parameters in a normalized way
+     * @param {Param[]} params
+     * @return {string}
+     */
+    function stringifyParams (params) {
+      return params
+          .map(function (param) {
+            var typeNames = param.types.map(getTypeName);
+
+            return (param.restParam ? '...' : '') + typeNames.join('|');
+          })
+          .join(',');
+    }
+
+    /**
+     * Parse a parameter, like "...number | boolean"
+     * @param {string} param
+     * @param {ConversionDef[]} conversions
+     * @return {Param} param
+     */
+    function parseParam (param, conversions) {
+      var restParam = param.indexOf('...') === 0;
+      var types = (!restParam)
+          ? param
+          : (param.length > 3)
+              ? param.slice(3)
+              : 'any';
+
+      var typeNames = types.split('|').map(trim)
+          .filter(notEmpty)
+          .filter(notIgnore);
+
+      var matchingConversions = filterConversions(conversions, typeNames);
+
+      var exactTypes = typeNames.map(function (typeName) {
+        var type = findTypeByName(typeName);
+
+        return {
+          name: typeName,
+          typeIndex: findTypeIndex(type),
+          test: type.test,
+          conversion: null,
+          conversionIndex: -1
+        };
+      });
+
+      var convertibleTypes = matchingConversions.map(function (conversion) {
+        var type = findTypeByName(conversion.from);
+
+        return {
+          name: conversion.from,
+          typeIndex: findTypeIndex(type),
+          test: type.test,
+          conversion: conversion,
+          conversionIndex: conversions.indexOf(conversion)
+        };
+      });
+
+      return {
+        types: exactTypes.concat(convertibleTypes),
+        restParam: restParam
+      };
+    }
+
+    /**
+     * Parse a signature with comma separated parameters,
+     * like "number | boolean, ...string"
+     * @param {string} signature
+     * @param {function} fn
+     * @param {ConversionDef[]} conversions
+     * @return {Signature | null} signature
+     */
+    function parseSignature (signature, fn, conversions) {
+      var params = [];
+
+      if (signature.trim() !== '') {
+        params = signature
+            .split(',')
+            .map(trim)
+            .map(function (param, index, array) {
+              var parsedParam = parseParam(param, conversions);
+
+              if (parsedParam.restParam && (index !== array.length - 1)) {
+                throw new SyntaxError('Unexpected rest parameter "' + param + '": ' +
+                    'only allowed for the last parameter');
+              }
+
+              return parsedParam;
+          });
+      }
+
+      if (params.some(isInvalidParam)) {
+        // invalid signature: at least one parameter has no types
+        // (they may have been filtered)
+        return null;
+      }
+
+      return {
+        params: params,
+        fn: fn
+      };
+    }
+
+    /**
+     * Test whether a set of params contains a restParam
+     * @param {Param[]} params
+     * @return {boolean} Returns true when the last parameter is a restParam
+     */
+    function hasRestParam(params) {
+      var param = last(params)
+      return param ? param.restParam : false;
+    }
+
+    /**
+     * Test whether a parameter contains conversions
+     * @param {Param} param
+     * @return {boolean} Returns true when at least one of the parameters
+     *                   contains a conversion.
+     */
+    function hasConversions(param) {
+      return param.types.some(function (type) {
+        return type.conversion != null;
+      });
+    }
+
+    /**
+     * Create a type test for a single parameter, which can have one or multiple
+     * types.
+     * @param {Param} param
+     * @return {function(x: *) : boolean} Returns a test function
+     */
+    function compileTest(param) {
+      if (!param || param.types.length === 0) {
+        // nothing to do
+        return ok;
+      }
+      else if (param.types.length === 1) {
+        return findTypeByName(param.types[0].name).test;
+      }
+      else if (param.types.length === 2) {
+        var test0 = findTypeByName(param.types[0].name).test;
+        var test1 = findTypeByName(param.types[1].name).test;
+        return function or(x) {
+          return test0(x) || test1(x);
+        }
+      }
+      else { // param.types.length > 2
+        var tests = param.types.map(function (type) {
+          return findTypeByName(type.name).test;
+        })
+        return function or(x) {
+          for (var i = 0; i < tests.length; i++) {
+            if (tests[i](x)) {
+              return true;
+            }
+          }
+          return false;
+        }
+      }
+    }
+
+    /**
+     * Create a test for all parameters of a signature
+     * @param {Param[]} params
+     * @return {function(args: Array<*>) : boolean}
+     */
+    function compileTests(params) {
+      var tests, test0, test1;
+
+      if (hasRestParam(params)) {
+        // variable arguments like '...number'
+        tests = initial(params).map(compileTest);
+        var varIndex = tests.length;
+        var lastTest = compileTest(last(params));
+        var testRestParam = function (args) {
+          for (var i = varIndex; i < args.length; i++) {
+            if (!lastTest(args[i])) {
+              return false;
+            }
+          }
+          return true;
+        }
+
+        return function testArgs(args) {
+          for (var i = 0; i < tests.length; i++) {
+            if (!tests[i](args[i])) {
+              return false;
+            }
+          }
+          return testRestParam(args) && (args.length >= varIndex + 1);
+        };
+      }
+      else {
+        // no variable arguments
+        if (params.length === 0) {
+          return function testArgs(args) {
+            return args.length === 0;
+          };
+        }
+        else if (params.length === 1) {
+          test0 = compileTest(params[0]);
+          return function testArgs(args) {
+            return test0(args[0]) && args.length === 1;
+          };
+        }
+        else if (params.length === 2) {
+          test0 = compileTest(params[0]);
+          test1 = compileTest(params[1]);
+          return function testArgs(args) {
+            return test0(args[0]) && test1(args[1]) && args.length === 2;
+          };
+        }
+        else { // arguments.length > 2
+          tests = params.map(compileTest);
+          return function testArgs(args) {
+            for (var i = 0; i < tests.length; i++) {
+              if (!tests[i](args[i])) {
+                return false;
+              }
+            }
+            return args.length === tests.length;
+          };
+        }
+      }
+    }
+
+    /**
+     * Find the parameter at a specific index of a signature.
+     * Handles rest parameters.
+     * @param {Signature} signature
+     * @param {number} index
+     * @return {Param | null} Returns the matching parameter when found,
+     *                        null otherwise.
+     */
+    function getParamAtIndex(signature, index) {
+      return index < signature.params.length
+          ? signature.params[index]
+          : hasRestParam(signature.params)
+              ? last(signature.params)
+              : null
+    }
+
+    /**
+     * Get all type names of a parameter
+     * @param {Signature} signature
+     * @param {number} index
+     * @param {boolean} excludeConversions
+     * @return {string[]} Returns an array with type names
+     */
+    function getExpectedTypeNames (signature, index, excludeConversions) {
+      var param = getParamAtIndex(signature, index);
+      var types = param
+          ? excludeConversions
+                  ? param.types.filter(isExactType)
+                  : param.types
+          : [];
+
+      return types.map(getTypeName);
+    }
+
+    /**
+     * Returns the name of a type
+     * @param {Type} type
+     * @return {string} Returns the type name
+     */
+    function getTypeName(type) {
+      return type.name;
+    }
+
+    /**
+     * Test whether a type is an exact type or conversion
+     * @param {Type} type
+     * @return {boolean} Returns true when
+     */
+    function isExactType(type) {
+      return type.conversion === null || type.conversion === undefined;
+    }
+
+    /**
+     * Helper function for creating error messages: create an array with
+     * all available types on a specific argument index.
+     * @param {Signature[]} signatures
+     * @param {number} index
+     * @return {string[]} Returns an array with available types
+     */
+    function mergeExpectedParams(signatures, index) {
+      var typeNames = uniq(flatMap(signatures, function (signature) {
+        return getExpectedTypeNames(signature, index, false);
+      }));
+
+      return (typeNames.indexOf('any') !== -1) ? ['any'] : typeNames;
+    }
+
+    /**
+     * Create
+     * @param {string} name             The name of the function
+     * @param {array.<*>} args          The actual arguments passed to the function
+     * @param {Signature[]} signatures  A list with available signatures
+     * @return {TypeError} Returns a type error with additional data
+     *                     attached to it in the property `data`
+     */
+    function createError(name, args, signatures) {
+      var err, expected;
+      var _name = name || 'unnamed';
+
+      // test for wrong type at some index
+      var matchingSignatures = signatures;
+      var index;
+      for (index = 0; index < args.length; index++) {
+        var nextMatchingDefs = matchingSignatures.filter(function (signature) {
+          var test = compileTest(getParamAtIndex(signature, index));
+          return (index < signature.params.length || hasRestParam(signature.params)) &&
+              test(args[index]);
+        });
+
+        if (nextMatchingDefs.length === 0) {
+          // no matching signatures anymore, throw error "wrong type"
+          expected = mergeExpectedParams(matchingSignatures, index);
+          if (expected.length > 0) {
+            var actualType = findTypeName(args[index]);
+
+            err = new TypeError('Unexpected type of argument in function ' + _name +
+                ' (expected: ' + expected.join(' or ') +
+                ', actual: ' + actualType + ', index: ' + index + ')');
+            err.data = {
+              category: 'wrongType',
+              fn: _name,
+              index: index,
+              actual: actualType,
+              expected: expected
+            }
+            return err;
+          }
+        }
+        else {
+          matchingSignatures = nextMatchingDefs;
+        }
+      }
+
+      // test for too few arguments
+      var lengths = matchingSignatures.map(function (signature) {
+        return hasRestParam(signature.params) ? Infinity : signature.params.length;
+      });
+      if (args.length < Math.min.apply(null, lengths)) {
+        expected = mergeExpectedParams(matchingSignatures, index);
+        err = new TypeError('Too few arguments in function ' + _name +
+            ' (expected: ' + expected.join(' or ') +
+            ', index: ' + args.length + ')');
+        err.data = {
+          category: 'tooFewArgs',
+          fn: _name,
+          index: args.length,
+          expected: expected
+        }
+        return err;
+      }
+
+      // test for too many arguments
+      var maxLength = Math.max.apply(null, lengths);
+      if (args.length > maxLength) {
+        err = new TypeError('Too many arguments in function ' + _name +
+            ' (expected: ' + maxLength + ', actual: ' + args.length + ')');
+        err.data = {
+          category: 'tooManyArgs',
+          fn: _name,
+          index: args.length,
+          expectedLength: maxLength
+        }
+        return err;
+      }
+
+      err = new TypeError('Arguments of type "' + args.join(', ') +
+          '" do not match any of the defined signatures of function ' + _name + '.');
+      err.data = {
+        category: 'mismatch',
+        actual: args.map(findTypeName)
+      }
+      return err;
+    }
+
+    /**
+     * Find the lowest index of all exact types of a parameter (no conversions)
+     * @param {Param} param
+     * @return {number} Returns the index of the lowest type in typed.types
+     */
+    function getLowestTypeIndex (param) {
+      var min = 999;
+
+      for (var i = 0; i < param.types.length; i++) {
+        if (isExactType(param.types[i])) {
+          min = Math.min(min, param.types[i].typeIndex);
+        }
+      }
+
+      return min;
+    }
+
+    /**
+     * Find the lowest index of the conversion of all types of the parameter
+     * having a conversion
+     * @param {Param} param
+     * @return {number} Returns the lowest index of the conversions of this type
+     */
+    function getLowestConversionIndex (param) {
+      var min = 999;
+
+      for (var i = 0; i < param.types.length; i++) {
+        if (!isExactType(param.types[i])) {
+          min = Math.min(min, param.types[i].conversionIndex);
+        }
+      }
+
+      return min;
+    }
+
+    /**
+     * Compare two params
+     * @param {Param} param1
+     * @param {Param} param2
+     * @return {number} returns a negative number when param1 must get a lower
+     *                  index than param2, a positive number when the opposite,
+     *                  or zero when both are equal
+     */
+    function compareParams (param1, param2) {
+      var c;
+
+      // compare having a rest parameter or not
+      c = param1.restParam - param2.restParam;
+      if (c !== 0) {
+        return c;
+      }
+
+      // compare having conversions or not
+      c = hasConversions(param1) - hasConversions(param2);
+      if (c !== 0) {
+        return c;
+      }
+
+      // compare the index of the types
+      c = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);
+      if (c !== 0) {
+        return c;
+      }
+
+      // compare the index of any conversion
+      return getLowestConversionIndex(param1) - getLowestConversionIndex(param2);
+    }
+
+    /**
+     * Compare two signatures
+     * @param {Signature} signature1
+     * @param {Signature} signature2
+     * @return {number} returns a negative number when param1 must get a lower
+     *                  index than param2, a positive number when the opposite,
+     *                  or zero when both are equal
+     */
+    function compareSignatures (signature1, signature2) {
+      var len = Math.min(signature1.params.length, signature2.params.length);
+      var i;
+      var c;
+
+      // compare whether the params have conversions at all or not
+      c = signature1.params.some(hasConversions) - signature2.params.some(hasConversions)
+      if (c !== 0) {
+        return c;
+      }
+
+      // next compare whether the params have conversions one by one
+      for (i = 0; i < len; i++) {
+        c = hasConversions(signature1.params[i]) - hasConversions(signature2.params[i]);
+        if (c !== 0) {
+          return c;
+        }
+      }
+
+      // compare the types of the params one by one
+      for (i = 0; i < len; i++) {
+        c = compareParams(signature1.params[i], signature2.params[i]);
+        if (c !== 0) {
+          return c;
+        }
+      }
+
+      // compare the number of params
+      return signature1.params.length - signature2.params.length;
+    }
+
+    /**
+     * Get params containing all types that can be converted to the defined types.
+     *
+     * @param {ConversionDef[]} conversions
+     * @param {string[]} typeNames
+     * @return {ConversionDef[]} Returns the conversions that are available
+     *                        for every type (if any)
+     */
+    function filterConversions(conversions, typeNames) {
+      var matches = {};
+
+      conversions.forEach(function (conversion) {
+        if (typeNames.indexOf(conversion.from) === -1 &&
+            typeNames.indexOf(conversion.to) !== -1 &&
+            !matches[conversion.from]) {
+          matches[conversion.from] = conversion;
+        }
+      });
+
+      return Object.keys(matches).map(function (from) {
+        return matches[from];
+      });
+    }
+
+    /**
+     * Preprocess arguments before calling the original function:
+     * - if needed convert the parameters
+     * - in case of rest parameters, move the rest parameters into an Array
+     * @param {Param[]} params
+     * @param {function} fn
+     * @return {function} Returns a wrapped function
+     */
+    function compileArgsPreprocessing(params, fn) {
+      var fnConvert = fn;
+
+      // TODO: can we make this wrapper function smarter/simpler?
+
+      if (params.some(hasConversions)) {
+        var restParam = hasRestParam(params);
+        var compiledConversions = params.map(compileArgConversion)
+
+        fnConvert = function convertArgs() {
+          var args = [];
+          var last = restParam ? arguments.length - 1 : arguments.length;
+          for (var i = 0; i < last; i++) {
+            args[i] = compiledConversions[i](arguments[i]);
+          }
+          if (restParam) {
+            args[last] = arguments[last].map(compiledConversions[last]);
+          }
+
+          return fn.apply(this, args);
+        }
+      }
+
+      var fnPreprocess = fnConvert;
+      if (hasRestParam(params)) {
+        var offset = params.length - 1;
+
+        fnPreprocess = function preprocessRestParams () {
+          return fnConvert.apply(this,
+              slice(arguments, 0, offset).concat([slice(arguments, offset)]));
+        }
+      }
+
+      return fnPreprocess;
+    }
+
+    /**
+     * Compile conversion for a parameter to the right type
+     * @param {Param} param
+     * @return {function} Returns the wrapped function that will convert arguments
+     *
+     */
+    function compileArgConversion(param) {
+      var test0, test1, conversion0, conversion1;
+      var tests = [];
+      var conversions = [];
+
+      param.types.forEach(function (type) {
+        if (type.conversion) {
+          tests.push(findTypeByName(type.conversion.from).test);
+          conversions.push(type.conversion.convert);
+        }
+      });
+
+      // create optimized conversion functions depending on the number of conversions
+      switch (conversions.length) {
+        case 0:
+          return function convertArg(arg) {
+            return arg;
+          }
+
+        case 1:
+          test0 = tests[0]
+          conversion0 = conversions[0];
+          return function convertArg(arg) {
+            if (test0(arg)) {
+              return conversion0(arg)
+            }
+            return arg;
+          }
+
+        case 2:
+          test0 = tests[0]
+          test1 = tests[1]
+          conversion0 = conversions[0];
+          conversion1 = conversions[1];
+          return function convertArg(arg) {
+            if (test0(arg)) {
+              return conversion0(arg)
+            }
+            if (test1(arg)) {
+              return conversion1(arg)
+            }
+            return arg;
+          }
+
+        default:
+          return function convertArg(arg) {
+            for (var i = 0; i < conversions.length; i++) {
+              if (tests[i](arg)) {
+                return conversions[i](arg);
+              }
+            }
+            return arg;
+          }
+      }
+    }
+
+    /**
+     * Convert an array with signatures into a map with signatures,
+     * where signatures with union types are split into separate signatures
+     *
+     * Throws an error when there are conflicting types
+     *
+     * @param {Signature[]} signatures
+     * @return {Object.<string, function>}  Returns a map with signatures
+     *                                      as key and the original function
+     *                                      of this signature as value.
+     */
+    function createSignaturesMap(signatures) {
+      var signaturesMap = {};
+      signatures.forEach(function (signature) {
+        if (!signature.params.some(hasConversions)) {
+          splitParams(signature.params, true).forEach(function (params) {
+            signaturesMap[stringifyParams(params)] = signature.fn;
+          });
+        }
+      });
+
+      return signaturesMap;
+    }
+
+    /**
+     * Split params with union types in to separate params.
+     *
+     * For example:
+     *
+     *     splitParams([['Array', 'Object'], ['string', 'RegExp'])
+     *     // returns:
+     *     // [
+     *     //   ['Array', 'string'],
+     *     //   ['Array', 'RegExp'],
+     *     //   ['Object', 'string'],
+     *     //   ['Object', 'RegExp']
+     *     // ]
+     *
+     * @param {Param[]} params
+     * @param {boolean} ignoreConversionTypes
+     * @return {Param[]}
+     */
+    function splitParams(params, ignoreConversionTypes) {
+      function _splitParams(params, index, types) {
+        if (index < params.length) {
+          var param = params[index]
+          var filteredTypes = ignoreConversionTypes
+              ? param.types.filter(isExactType)
+              : param.types;
+          var typeGroups
+
+          if (param.restParam) {
+            // split the types of a rest parameter in two:
+            // one with only exact types, and one with exact types and conversions
+            var exactTypes = filteredTypes.filter(isExactType)
+            typeGroups = exactTypes.length < filteredTypes.length
+                ? [exactTypes, filteredTypes]
+                : [filteredTypes]
+
+          }
+          else {
+            // split all the types of a regular parameter into one type per group
+            typeGroups = filteredTypes.map(function (type) {
+              return [type]
+            })
+          }
+
+          // recurse over the groups with types
+          return flatMap(typeGroups, function (typeGroup) {
+            return _splitParams(params, index + 1, types.concat([typeGroup]));
+          });
+
+        }
+        else {
+          // we've reached the end of the parameters. Now build a new Param
+          var splittedParams = types.map(function (type, typeIndex) {
+            return {
+              types: type,
+              restParam: (typeIndex === params.length - 1) && hasRestParam(params)
+            }
+          });
+
+          return [splittedParams];
+        }
+      }
+
+      return _splitParams(params, 0, []);
+    }
+
+    /**
+     * Test whether two signatures have a conflicting signature
+     * @param {Signature} signature1
+     * @param {Signature} signature2
+     * @return {boolean} Returns true when the signatures conflict, false otherwise.
+     */
+    function hasConflictingParams(signature1, signature2) {
+      var ii = Math.max(signature1.params.length, signature2.params.length);
+
+      for (var i = 0; i < ii; i++) {
+        var typesNames1 = getExpectedTypeNames(signature1, i, true);
+        var typesNames2 = getExpectedTypeNames(signature2, i, true);
+
+        if (!hasOverlap(typesNames1, typesNames2)) {
+          return false;
+        }
+      }
+
+      var len1 = signature1.params.length;
+      var len2 = signature2.params.length;
+      var restParam1 = hasRestParam(signature1.params);
+      var restParam2 = hasRestParam(signature2.params);
+
+      return restParam1
+          ? restParam2 ? (len1 === len2) : (len2 >= len1)
+          : restParam2 ? (len1 >= len2)  : (len1 === len2)
+    }
+
+    /**
+     * Create a typed function
+     * @param {String} name               The name for the typed function
+     * @param {Object.<string, function>} signaturesMap
+     *                                    An object with one or
+     *                                    multiple signatures as key, and the
+     *                                    function corresponding to the
+     *                                    signature as value.
+     * @return {function}  Returns the created typed function.
+     */
+    function createTypedFunction(name, signaturesMap) {
+      if (Object.keys(signaturesMap).length === 0) {
+        throw new SyntaxError('No signatures provided');
+      }
+
+      // parse the signatures, and check for conflicts
+      var parsedSignatures = [];
+      Object.keys(signaturesMap)
+          .map(function (signature) {
+            return parseSignature(signature, signaturesMap[signature], typed.conversions);
+          })
+          .filter(notNull)
+          .forEach(function (parsedSignature) {
+            // check whether this parameter conflicts with already parsed signatures
+            var conflictingSignature = findInArray(parsedSignatures, function (s) {
+              return hasConflictingParams(s, parsedSignature)
+            });
+            if (conflictingSignature) {
+              throw new TypeError('Conflicting signatures "' +
+                  stringifyParams(conflictingSignature.params) + '" and "' +
+                  stringifyParams(parsedSignature.params) + '".');
+            }
+
+            parsedSignatures.push(parsedSignature);
+          });
+
+      // split and filter the types of the signatures, and then order them
+      var signatures = flatMap(parsedSignatures, function (parsedSignature) {
+        var params = parsedSignature ? splitParams(parsedSignature.params, false) : []
+
+        return params.map(function (params) {
+          return {
+            params: params,
+            fn: parsedSignature.fn
+          };
+        });
+      }).filter(notNull);
+
+      signatures.sort(compareSignatures);
+
+      // we create a highly optimized checks for the first couple of signatures with max 2 arguments
+      var ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);
+      var ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);
+      var ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);
+      var ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);
+      var ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);
+      var ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);
+      var allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;
+
+      // compile the tests
+      var tests = signatures.map(function (signature) {
+        return compileTests(signature.params);
+      });
+
+      var test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;
+      var test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;
+      var test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;
+      var test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;
+      var test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;
+      var test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;
+
+      var test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;
+      var test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;
+      var test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;
+      var test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;
+      var test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;
+      var test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;
+
+      // compile the functions
+      var fns = signatures.map(function(signature) {
+        return compileArgsPreprocessing(signature.params, signature.fn);
+      });
+
+      var fn0 = ok0 ? fns[0] : undef;
+      var fn1 = ok1 ? fns[1] : undef;
+      var fn2 = ok2 ? fns[2] : undef;
+      var fn3 = ok3 ? fns[3] : undef;
+      var fn4 = ok4 ? fns[4] : undef;
+      var fn5 = ok5 ? fns[5] : undef;
+
+      var len0 = ok0 ? signatures[0].params.length : -1;
+      var len1 = ok1 ? signatures[1].params.length : -1;
+      var len2 = ok2 ? signatures[2].params.length : -1;
+      var len3 = ok3 ? signatures[3].params.length : -1;
+      var len4 = ok4 ? signatures[4].params.length : -1;
+      var len5 = ok5 ? signatures[5].params.length : -1;
+
+      // simple and generic, but also slow
+      var iStart = allOk ? 6 : 0;
+      var iEnd = signatures.length;
+      var generic = function generic() {
+        'use strict';
+
+        for (var i = iStart; i < iEnd; i++) {
+          if (tests[i](arguments)) {
+            return fns[i].apply(this, arguments);
+          }
+        }
+
+        return typed.onMismatch(name, arguments, signatures);
+      }
+
+      // create the typed function
+      // fast, specialized version. Falls back to the slower, generic one if needed
+      var fn = function fn(arg0, arg1) {
+        'use strict';
+
+        if (arguments.length === len0 && test00(arg0) && test01(arg1)) { return fn0.apply(fn, arguments); }
+        if (arguments.length === len1 && test10(arg0) && test11(arg1)) { return fn1.apply(fn, arguments); }
+        if (arguments.length === len2 && test20(arg0) && test21(arg1)) { return fn2.apply(fn, arguments); }
+        if (arguments.length === len3 && test30(arg0) && test31(arg1)) { return fn3.apply(fn, arguments); }
+        if (arguments.length === len4 && test40(arg0) && test41(arg1)) { return fn4.apply(fn, arguments); }
+        if (arguments.length === len5 && test50(arg0) && test51(arg1)) { return fn5.apply(fn, arguments); }
+
+        return generic.apply(fn, arguments);
+      }
+
+      // attach name the typed function
+      try {
+        Object.defineProperty(fn, 'name', {value: name});
+      }
+      catch (err) {
+        // old browsers do not support Object.defineProperty and some don't support setting the name property
+        // the function name is not essential for the functioning, it's mostly useful for debugging,
+        // so it's fine to have unnamed functions.
+      }
+
+      // attach signatures to the function
+      fn.signatures = createSignaturesMap(signatures);
+
+      return fn;
+    }
+
+    /**
+     * Action to take on mismatch
+     * @param {string} name      Name of function that was attempted to be called
+     * @param {Array} args       Actual arguments to the call
+     * @param {Array} signatures Known signatures of the named typed-function
+     */
+    function _onMismatch(name, args, signatures) {
+      throw createError(name, args, signatures);
+    }
+
+    /**
+     * Test whether a type should be NOT be ignored
+     * @param {string} typeName
+     * @return {boolean}
+     */
+    function notIgnore(typeName) {
+      return typed.ignore.indexOf(typeName) === -1;
+    }
+
+    /**
+     * trim a string
+     * @param {string} str
+     * @return {string}
+     */
+    function trim(str) {
+      return str.trim();
+    }
+
+    /**
+     * Test whether a string is not empty
+     * @param {string} str
+     * @return {boolean}
+     */
+    function notEmpty(str) {
+      return !!str;
+    }
+
+    /**
+     * test whether a value is not strict equal to null
+     * @param {*} value
+     * @return {boolean}
+     */
+    function notNull(value) {
+      return value !== null;
+    }
+
+    /**
+     * Test whether a parameter has no types defined
+     * @param {Param} param
+     * @return {boolean}
+     */
+    function isInvalidParam (param) {
+      return param.types.length === 0;
+    }
+
+    /**
+     * Return all but the last items of an array
+     * @param {Array} arr
+     * @return {Array}
+     */
+    function initial(arr) {
+      return arr.slice(0, arr.length - 1);
+    }
+
+    /**
+     * return the last item of an array
+     * @param {Array} arr
+     * @return {*}
+     */
+    function last(arr) {
+      return arr[arr.length - 1];
+    }
+
+    /**
+     * Slice an array or function Arguments
+     * @param {Array | Arguments | IArguments} arr
+     * @param {number} start
+     * @param {number} [end]
+     * @return {Array}
+     */
+    function slice(arr, start, end) {
+      return Array.prototype.slice.call(arr, start, end);
+    }
+
+    /**
+     * Test whether an array contains some item
+     * @param {Array} array
+     * @param {*} item
+     * @return {boolean} Returns true if array contains item, false if not.
+     */
+    function contains(array, item) {
+      return array.indexOf(item) !== -1;
+    }
+
+    /**
+     * Test whether two arrays have overlapping items
+     * @param {Array} array1
+     * @param {Array} array2
+     * @return {boolean} Returns true when at least one item exists in both arrays
+     */
+    function hasOverlap(array1, array2) {
+      for (var i = 0; i < array1.length; i++) {
+        if (contains(array2, array1[i])) {
+          return true;
+        }
+      }
+
+      return false;
+    }
+
+    /**
+     * Return the first item from an array for which test(arr[i]) returns true
+     * @param {Array} arr
+     * @param {function} test
+     * @return {* | undefined} Returns the first matching item
+     *                         or undefined when there is no match
+     */
+    function findInArray(arr, test) {
+      for (var i = 0; i < arr.length; i++) {
+        if (test(arr[i])) {
+          return arr[i];
+        }
+      }
+      return undefined;
+    }
+
+    /**
+     * Filter unique items of an array with strings
+     * @param {string[]} arr
+     * @return {string[]}
+     */
+    function uniq(arr) {
+      var entries = {}
+      for (var i = 0; i < arr.length; i++) {
+        entries[arr[i]] = true;
+      }
+      return Object.keys(entries);
+    }
+
+    /**
+     * Flat map the result invoking a callback for every item in an array.
+     * https://gist.github.com/samgiles/762ee337dff48623e729
+     * @param {Array} arr
+     * @param {function} callback
+     * @return {Array}
+     */
+    function flatMap(arr, callback) {
+      return Array.prototype.concat.apply([], arr.map(callback));
+    }
+
+    /**
+     * Retrieve the function name from a set of typed functions,
+     * and check whether the name of all functions match (if given)
+     * @param {function[]} fns
+     */
+    function getName (fns) {
+      var name = '';
+
+      for (var i = 0; i < fns.length; i++) {
+        var fn = fns[i];
+
+        // check whether the names are the same when defined
+        if ((typeof fn.signatures === 'object' || typeof fn.signature === 'string') && fn.name !== '') {
+          if (name === '') {
+            name = fn.name;
+          }
+          else if (name !== fn.name) {
+            var err = new Error('Function names do not match (expected: ' + name + ', actual: ' + fn.name + ')');
+            err.data = {
+              actual: fn.name,
+              expected: name
+            };
+            throw err;
+          }
+        }
+      }
+
+      return name;
+    }
+
+    // extract and merge all signatures of a list with typed functions
+    function extractSignatures(fns) {
+      var err;
+      var signaturesMap = {};
+
+      function validateUnique(_signature, _fn) {
+        if (signaturesMap.hasOwnProperty(_signature) && _fn !== signaturesMap[_signature]) {
+          err = new Error('Signature "' + _signature + '" is defined twice');
+          err.data = {signature: _signature};
+          throw err;
+          // else: both signatures point to the same function, that's fine
+        }
+      }
+
+      for (var i = 0; i < fns.length; i++) {
+        var fn = fns[i];
+
+        // test whether this is a typed-function
+        if (typeof fn.signatures === 'object') {
+          // merge the signatures
+          for (var signature in fn.signatures) {
+            if (fn.signatures.hasOwnProperty(signature)) {
+              validateUnique(signature, fn.signatures[signature]);
+              signaturesMap[signature] = fn.signatures[signature];
+            }
+          }
+        }
+        else if (typeof fn.signature === 'string') {
+          validateUnique(fn.signature, fn);
+          signaturesMap[fn.signature] = fn;
+        }
+        else {
+          err = new TypeError('Function is no typed-function (index: ' + i + ')');
+          err.data = {index: i};
+          throw err;
+        }
+      }
+
+      return signaturesMap;
+    }
+
+    typed = createTypedFunction('typed', {
+      'string, Object': createTypedFunction,
+      'Object': function (signaturesMap) {
+        // find existing name
+        var fns = [];
+        for (var signature in signaturesMap) {
+          if (signaturesMap.hasOwnProperty(signature)) {
+            fns.push(signaturesMap[signature]);
+          }
+        }
+        var name = getName(fns);
+        return createTypedFunction(name, signaturesMap);
+      },
+      '...Function': function (fns) {
+        return createTypedFunction(getName(fns), extractSignatures(fns));
+      },
+      'string, ...Function': function (name, fns) {
+        return createTypedFunction(name, extractSignatures(fns));
+      }
+    });
+
+    typed.create = create;
+    typed.types = _types;
+    typed.conversions = _conversions;
+    typed.ignore = _ignore;
+    typed.onMismatch = _onMismatch;
+    typed.throwMismatchError = _onMismatch;
+    typed.createError = createError;
+    typed.convert = convert;
+    typed.find = find;
+
+    /**
+     * add a type
+     * @param {{name: string, test: function}} type
+     * @param {boolean} [beforeObjectTest=true]
+     *                          If true, the new test will be inserted before
+     *                          the test with name 'Object' (if any), since
+     *                          tests for Object match Array and classes too.
+     */
+    typed.addType = function (type, beforeObjectTest) {
+      if (!type || typeof type.name !== 'string' || typeof type.test !== 'function') {
+        throw new TypeError('Object with properties {name: string, test: function} expected');
+      }
+
+      if (beforeObjectTest !== false) {
+        for (var i = 0; i < typed.types.length; i++) {
+          if (typed.types[i].name === 'Object') {
+            typed.types.splice(i, 0, type);
+            return
+          }
+        }
+      }
+
+      typed.types.push(type);
+    };
+
+    // add a conversion
+    typed.addConversion = function (conversion) {
+      if (!conversion
+          || typeof conversion.from !== 'string'
+          || typeof conversion.to !== 'string'
+          || typeof conversion.convert !== 'function') {
+        throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');
+      }
+
+      typed.conversions.push(conversion);
+    };
+
+    return typed;
+  }
+
+  return create();
+}));
diff --git a/node_modules/typed-function/typed-function.min.js b/node_modules/typed-function/typed-function.min.js
new file mode 100644
index 0000000..0290e6f
--- /dev/null
+++ b/node_modules/typed-function/typed-function.min.js
@@ -0,0 +1 @@
+"use strict";!function(n,t){"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?module.exports=t():n.typed=t()}(this,function(){function O(){return!0}function en(){return!1}function an(){}return function n(){var t=[{name:"number",test:function(n){return"number"==typeof n}},{name:"string",test:function(n){return"string"==typeof n}},{name:"boolean",test:function(n){return"boolean"==typeof n}},{name:"Function",test:function(n){return"function"==typeof n}},{name:"Array",test:Array.isArray},{name:"Date",test:function(n){return n instanceof Date}},{name:"RegExp",test:function(n){return n instanceof RegExp}},{name:"Object",test:function(n){return"object"==typeof n&&null!==n&&n.constructor===Object}},{name:"null",test:function(n){return null===n}},{name:"undefined",test:function(n){return void 0===n}}],r={name:"any",test:O},e=[],a=[],q={types:t,conversions:a,ignore:e};function u(t){var n=tn(q.types,function(n){return n.name===t});if(n)return n;if("any"===t)return r;throw n=tn(q.types,function(n){return n.name.toLowerCase()===t.toLowerCase()}),new TypeError('Unknown type "'+t+'"'+(n?'. Did you mean "'+n.name+'"?':""))}function i(n){return n===r?999:q.types.indexOf(n)}function c(t){var n=tn(q.types,function(n){return n.test(t)});if(n)return n.name;throw new TypeError("Value has unknown type. Value: "+t)}function z(n){return n.map(function(n){var t=n.types.map(o);return(n.restParam?"...":"")+t.join("|")}).join(",")}function B(n,r){var t,e,a=0===n.indexOf("..."),o=(a?3<n.length?n.slice(3):"any":n).split("|").map(Z).filter(w).filter(d),n=(t=o,e={},r.forEach(function(n){-1!==t.indexOf(n.from)||-1===t.indexOf(n.to)||e[n.from]||(e[n.from]=n)}),Object.keys(e).map(function(n){return e[n]})),o=o.map(function(n){var t=u(n);return{name:n,typeIndex:i(t),test:t.test,conversion:null,conversionIndex:-1}}),n=n.map(function(n){var t=u(n.from);return{name:n.from,typeIndex:i(t),test:t.test,conversion:n,conversionIndex:r.indexOf(n)}});return{types:o.concat(n),restParam:a}}function G(n){return!!(n=x(n))&&n.restParam}function H(n){return n.types.some(function(n){return null!=n.conversion})}function J(n){if(n&&0!==n.types.length){if(1===n.types.length)return u(n.types[0].name).test;if(2===n.types.length){var t=u(n.types[0].name).test,r=u(n.types[1].name).test;return function(n){return t(n)||r(n)}}var e=n.types.map(function(n){return u(n.name).test});return function(n){for(var t=0;t<e.length;t++)if(e[t](n))return!0;return!1}}return O}function K(n){var t,r,e;if(G(n)){var a,o=(a=(e=n).slice(0,e.length-1).map(J)).length,i=J(x(n));return function(n){for(var t=0;t<a.length;t++)if(!a[t](n[t]))return!1;return function(n){for(var t=o;t<n.length;t++)if(!i(n[t]))return!1;return!0}(n)&&n.length>=o+1}}return 0===n.length?function(n){return 0===n.length}:1===n.length?(t=J(n[0]),function(n){return t(n[0])&&1===n.length}):2===n.length?(t=J(n[0]),r=J(n[1]),function(n){return t(n[0])&&r(n[1])&&2===n.length}):(a=n.map(J),function(n){for(var t=0;t<a.length;t++)if(!a[t](n[t]))return!1;return n.length===a.length})}function p(n,t){return t<n.params.length?n.params[t]:G(n.params)?x(n.params):null}function s(n,t,r){return((t=p(n,t))?r?t.types.filter(f):t.types:[]).map(o)}function o(n){return n.name}function f(n){return null===n.conversion||void 0===n.conversion}function m(n,t){return-1!==(n=function(n){for(var t={},r=0;r<n.length;r++)t[n[r]]=!0;return Object.keys(t)}(rn(n,function(n){return s(n,t,!1)}))).indexOf("any")?["any"]:n}function l(n,r,t){for(var e,a=n||"unnamed",o=t,i=0;i<r.length;i++){var u=o.filter(function(n){var t=J(p(n,i));return(i<n.params.length||G(n.params))&&t(r[i])});if(0===u.length){if(0<(e=m(o,i)).length){var s,f=c(r[i]);return(s=new TypeError("Unexpected type of argument in function "+a+" (expected: "+e.join(" or ")+", actual: "+f+", index: "+i+")")).data={category:"wrongType",fn:a,index:i,actual:f,expected:e},s}}else o=u}return t=o.map(function(n){return G(n.params)?1/0:n.params.length}),r.length<Math.min.apply(null,t)?(e=m(o,i),(s=new TypeError("Too few arguments in function "+a+" (expected: "+e.join(" or ")+", index: "+r.length+")")).data={category:"tooFewArgs",fn:a,index:r.length,expected:e}):(t=Math.max.apply(null,t),r.length>t?(s=new TypeError("Too many arguments in function "+a+" (expected: "+t+", actual: "+r.length+")")).data={category:"tooManyArgs",fn:a,index:r.length,expectedLength:t}:(s=new TypeError('Arguments of type "'+r.join(", ")+'" do not match any of the defined signatures of function '+a+".")).data={category:"mismatch",actual:r.map(c)}),s}function h(n){for(var t=999,r=0;r<n.types.length;r++)f(n.types[r])&&(t=Math.min(t,n.types[r].typeIndex));return t}function g(n){for(var t=999,r=0;r<n.types.length;r++)f(n.types[r])||(t=Math.min(t,n.types[r].conversionIndex));return t}function Q(n,t){var r,e,a,o,i=Math.min(n.params.length,t.params.length),u=n.params.some(H)-t.params.some(H);if(0!==u)return u;for(r=0;r<i;r++)if(0!=(u=H(n.params[r])-H(t.params[r])))return u;for(r=0;r<i;r++)if(e=n.params[r],a=t.params[r],o=void 0,0!==(u=0!=(o=e.restParam-a.restParam)||0!=(o=H(e)-H(a))||0!=(o=h(e)-h(a))?o:g(e)-g(a)))return u;return n.params.length-t.params.length}function W(n){var t,r,e,a,o=[],i=[];switch(n.types.forEach(function(n){n.conversion&&(o.push(u(n.conversion.from).test),i.push(n.conversion.convert))}),i.length){case 0:return function(n){return n};case 1:return t=o[0],e=i[0],function(n){return t(n)?e(n):n};case 2:return t=o[0],r=o[1],e=i[0],a=i[1],function(n){return t(n)?e(n):r(n)?a(n):n};default:return function(n){for(var t=0;t<i.length;t++)if(o[t](n))return i[t](n);return n}}}function X(n,i){return function t(r,e,a){if(e<r.length){var n=r[e],o=i?n.types.filter(f):n.types;return rn(n.restParam?(n=o.filter(f)).length<o.length?[n,o]:[o]:o.map(function(n){return[n]}),function(n){return t(r,e+1,a.concat([n]))})}return[a.map(function(n,t){return{types:n,restParam:t===r.length-1&&G(r)}})]}(n,0,[])}function Y(n,t){for(var r=Math.max(n.params.length,t.params.length),e=0;e<r;e++)if(!function(n,t){for(var r=0;r<n.length;r++)if(function(n,t){return-1!==n.indexOf(t)}(t,n[r]))return 1}(s(n,e,!0),s(t,e,!0)))return!1;var a=n.params.length,o=t.params.length,i=G(n.params),u=G(t.params);return i?u?a===o:a<=o:u?o<=a:a===o}function y(e,o){if(0===Object.keys(o).length)throw new SyntaxError("No signatures provided");var r=[];Object.keys(o).map(function(n){return r=o[t=n],a=q.conversions,n=[],(n=""!==t.trim()?t.split(",").map(Z).map(function(n,t,r){var e=B(n,a);if(e.restParam&&t!==r.length-1)throw new SyntaxError('Unexpected rest parameter "'+n+'": only allowed for the last parameter');return e}):n).some(_)?null:{params:n,fn:r};var t,r,a}).filter($).forEach(function(t){var n=tn(r,function(n){return Y(n,t)});if(n)throw new TypeError('Conflicting signatures "'+z(n.params)+'" and "'+z(t.params)+'".');r.push(t)});var a=rn(r,function(t){return(t?X(t.params,!1):[]).map(function(n){return{params:n,fn:t.fn}})}).filter($);a.sort(Q);var i,n=a[0]&&a[0].params.length<=2&&!G(a[0].params),t=a[1]&&a[1].params.length<=2&&!G(a[1].params),u=a[2]&&a[2].params.length<=2&&!G(a[2].params),s=a[3]&&a[3].params.length<=2&&!G(a[3].params),f=a[4]&&a[4].params.length<=2&&!G(a[4].params),c=a[5]&&a[5].params.length<=2&&!G(a[5].params),p=n&&t&&u&&s&&f&&c,m=a.map(function(n){return K(n.params)}),l=n?J(a[0].params[0]):en,h=t?J(a[1].params[0]):en,g=u?J(a[2].params[0]):en,y=s?J(a[3].params[0]):en,v=f?J(a[4].params[0]):en,d=c?J(a[5].params[0]):en,w=n?J(a[0].params[1]):en,x=t?J(a[1].params[1]):en,E=u?J(a[2].params[1]):en,j=s?J(a[3].params[1]):en,O=f?J(a[4].params[1]):en,b=c?J(a[5].params[1]):en,T=a.map(function(n){return function(n,e){var a,o,t=e;n.some(H)&&(a=G(n),o=n.map(W),t=function(){for(var n=[],t=a?arguments.length-1:arguments.length,r=0;r<t;r++)n[r]=o[r](arguments[r]);return a&&(n[t]=arguments[t].map(o[t])),e.apply(this,n)});var r,i=t;return G(n)&&(r=n.length-1,i=function(){return t.apply(this,nn(arguments,0,r).concat([nn(arguments,r)]))}),i}(n.params,n.fn)}),P=n?T[0]:an,A=t?T[1]:an,M=u?T[2]:an,F=s?T[3]:an,k=f?T[4]:an,I=c?T[5]:an,C=n?a[0].params.length:-1,S=t?a[1].params.length:-1,D=u?a[2].params.length:-1,L=s?a[3].params.length:-1,U=f?a[4].params.length:-1,R=c?a[5].params.length:-1,V=p?6:0,N=a.length,p=function n(t,r){return(arguments.length===C&&l(t)&&w(r)?P:arguments.length===S&&h(t)&&x(r)?A:arguments.length===D&&g(t)&&E(r)?M:arguments.length===L&&y(t)&&j(r)?F:arguments.length===U&&v(t)&&O(r)?k:arguments.length===R&&d(t)&&b(r)?I:function(){for(var n=V;n<N;n++)if(m[n](arguments))return T[n].apply(this,arguments);return q.onMismatch(e,arguments,a)}).apply(n,arguments)};try{Object.defineProperty(p,"name",{value:e})}catch(n){}return p.signatures=(i={},a.forEach(function(t){t.params.some(H)||X(t.params,!0).forEach(function(n){i[z(n)]=t.fn})}),i),p}function v(n,t,r){throw l(n,t,r)}function d(n){return-1===q.ignore.indexOf(n)}function Z(n){return n.trim()}function w(n){return!!n}function $(n){return null!==n}function _(n){return 0===n.types.length}function x(n){return n[n.length-1]}function nn(n,t,r){return Array.prototype.slice.call(n,t,r)}function tn(n,t){for(var r=0;r<n.length;r++)if(t(n[r]))return n[r]}function rn(n,t){return Array.prototype.concat.apply([],n.map(t))}function E(n){for(var t="",r=0;r<n.length;r++){var e=n[r];if(("object"==typeof e.signatures||"string"==typeof e.signature)&&""!==e.name)if(""===t)t=e.name;else if(t!==e.name){var a=new Error("Function names do not match (expected: "+t+", actual: "+e.name+")");throw a.data={actual:e.name,expected:t},a}}return t}function j(n){var r,e={};function t(n,t){if(e.hasOwnProperty(n)&&t!==e[n])throw(r=new Error('Signature "'+n+'" is defined twice')).data={signature:n},r}for(var a=0;a<n.length;a++){var o=n[a];if("object"==typeof o.signatures)for(var i in o.signatures)o.signatures.hasOwnProperty(i)&&(t(i,o.signatures[i]),e[i]=o.signatures[i]);else{if("string"!=typeof o.signature)throw(r=new TypeError("Function is no typed-function (index: "+a+")")).data={index:a},r;t(o.signature,o),e[o.signature]=o}}return e}return(q=y("typed",{"string, Object":y,Object:function(n){var t,r=[];for(t in n)n.hasOwnProperty(t)&&r.push(n[t]);return y(E(r),n)},"...Function":function(n){return y(E(n),j(n))},"string, ...Function":function(n,t){return y(n,j(t))}})).create=n,q.types=t,q.conversions=a,q.ignore=e,q.onMismatch=v,q.throwMismatchError=v,q.createError=l,q.convert=function(n,t){var r=c(n);if(t===r)return n;for(var e=0;e<q.conversions.length;e++){var a=q.conversions[e];if(a.from===r&&a.to===t)return a.convert(n)}throw new Error("Cannot convert from "+r+" to "+t)},q.find=function(n,t){if(!n.signatures)throw new TypeError("Function is no typed-function");if("string"==typeof t)for(var r=t.split(","),e=0;e<r.length;e++)r[e]=r[e].trim();else{if(!Array.isArray(t))throw new TypeError("String array or a comma separated string expected");r=t}if(t=r.join(","),t=n.signatures[t])return t;throw new TypeError("Signature not found (signature: "+(n.name||"unnamed")+"("+r.join(", ")+"))")},q.addType=function(n,t){if(!n||"string"!=typeof n.name||"function"!=typeof n.test)throw new TypeError("Object with properties {name: string, test: function} expected");if(!1!==t)for(var r=0;r<q.types.length;r++)if("Object"===q.types[r].name)return void q.types.splice(r,0,n);q.types.push(n)},q.addConversion=function(n){if(!n||"string"!=typeof n.from||"string"!=typeof n.to||"function"!=typeof n.convert)throw new TypeError("Object with properties {from: string, to: string, convert: function} expected");q.conversions.push(n)},q}()});
\ No newline at end of file
diff --git a/package-lock.json b/package-lock.json
new file mode 100644
index 0000000..51e2978
--- /dev/null
+++ b/package-lock.json
@@ -0,0 +1,182 @@
+{
+  "name": "squiggle-simplex",
+  "version": "1.0.0",
+  "lockfileVersion": 2,
+  "requires": true,
+  "packages": {
+    "": {
+      "name": "squiggle-simplex",
+      "version": "1.0.0",
+      "license": "ISC",
+      "dependencies": {
+        "mathjs": "^10.4.3"
+      }
+    },
+    "node_modules/@babel/runtime": {
+      "version": "7.17.9",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.17.9.tgz",
+      "integrity": "sha512-lSiBBvodq29uShpWGNbgFdKYNiFDo5/HIYsaCEY9ff4sb10x9jizo2+pRrSyF4jKZCXqgzuqBOQKbUm90gQwJg==",
+      "dependencies": {
+        "regenerator-runtime": "^0.13.4"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/complex.js": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.1.1.tgz",
+      "integrity": "sha512-8njCHOTtFFLtegk6zQo0kkVX1rngygb/KQI6z1qZxlFI3scluC+LVTCFbrkWjBv4vvLlbQ9t88IPMC6k95VTTg==",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "patreon",
+        "url": "https://www.patreon.com/infusion"
+      }
+    },
+    "node_modules/decimal.js": {
+      "version": "10.3.1",
+      "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.3.1.tgz",
+      "integrity": "sha512-V0pfhfr8suzyPGOx3nmq4aHqabehUZn6Ch9kyFpV79TGDTWFmHqUqXdabR7QHqxzrYolF4+tVmJhUG4OURg5dQ=="
+    },
+    "node_modules/escape-latex": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/escape-latex/-/escape-latex-1.2.0.tgz",
+      "integrity": "sha512-nV5aVWW1K0wEiUIEdZ4erkGGH8mDxGyxSeqPzRNtWP7ataw+/olFObw7hujFWlVjNsaDFw5VZ5NzVSIqRgfTiw=="
+    },
+    "node_modules/fraction.js": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-4.2.0.tgz",
+      "integrity": "sha512-MhLuK+2gUcnZe8ZHlaaINnQLl0xRIGRfcGk2yl8xoQAfHrSsL3rYu6FCmBdkdbhc9EPlwyGHewaRsvwRMJtAlA==",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "patreon",
+        "url": "https://www.patreon.com/infusion"
+      }
+    },
+    "node_modules/javascript-natural-sort": {
+      "version": "0.7.1",
+      "resolved": "https://registry.npmjs.org/javascript-natural-sort/-/javascript-natural-sort-0.7.1.tgz",
+      "integrity": "sha1-+eIwPUUH9tdDVac2ZNFED7Wg71k="
+    },
+    "node_modules/mathjs": {
+      "version": "10.4.3",
+      "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-10.4.3.tgz",
+      "integrity": "sha512-C50lWorCOplBec9Ik5fzhHuOx4G4+mtdz3r1G2I1/r8yj+CpYFXLXNqTdg59oKmIF1tKcIzpxlC4s2dGL7f3pg==",
+      "dependencies": {
+        "@babel/runtime": "^7.17.8",
+        "complex.js": "^2.1.0",
+        "decimal.js": "^10.3.1",
+        "escape-latex": "^1.2.0",
+        "fraction.js": "^4.2.0",
+        "javascript-natural-sort": "^0.7.1",
+        "seedrandom": "^3.0.5",
+        "tiny-emitter": "^2.1.0",
+        "typed-function": "^2.1.0"
+      },
+      "bin": {
+        "mathjs": "bin/cli.js"
+      },
+      "engines": {
+        "node": ">= 12"
+      }
+    },
+    "node_modules/regenerator-runtime": {
+      "version": "0.13.9",
+      "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.13.9.tgz",
+      "integrity": "sha512-p3VT+cOEgxFsRRA9X4lkI1E+k2/CtnKtU4gcxyaCUreilL/vqI6CdZ3wxVUx3UOUg+gnUOQQcRI7BmSI656MYA=="
+    },
+    "node_modules/seedrandom": {
+      "version": "3.0.5",
+      "resolved": "https://registry.npmjs.org/seedrandom/-/seedrandom-3.0.5.tgz",
+      "integrity": "sha512-8OwmbklUNzwezjGInmZ+2clQmExQPvomqjL7LFqOYqtmuxRgQYqOD3mHaU+MvZn5FLUeVxVfQjwLZW/n/JFuqg=="
+    },
+    "node_modules/tiny-emitter": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/tiny-emitter/-/tiny-emitter-2.1.0.tgz",
+      "integrity": "sha512-NB6Dk1A9xgQPMoGqC5CVXn123gWyte215ONT5Pp5a0yt4nlEoO1ZWeCwpncaekPHXO60i47ihFnZPiRPjRMq4Q=="
+    },
+    "node_modules/typed-function": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-2.1.0.tgz",
+      "integrity": "sha512-bctQIOqx2iVbWGDGPWwIm18QScpu2XRmkC19D8rQGFsjKSgteq/o1hTZvIG/wuDq8fanpBDrLkLq+aEN/6y5XQ==",
+      "engines": {
+        "node": ">= 10"
+      }
+    }
+  },
+  "dependencies": {
+    "@babel/runtime": {
+      "version": "7.17.9",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.17.9.tgz",
+      "integrity": "sha512-lSiBBvodq29uShpWGNbgFdKYNiFDo5/HIYsaCEY9ff4sb10x9jizo2+pRrSyF4jKZCXqgzuqBOQKbUm90gQwJg==",
+      "requires": {
+        "regenerator-runtime": "^0.13.4"
+      }
+    },
+    "complex.js": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.1.1.tgz",
+      "integrity": "sha512-8njCHOTtFFLtegk6zQo0kkVX1rngygb/KQI6z1qZxlFI3scluC+LVTCFbrkWjBv4vvLlbQ9t88IPMC6k95VTTg=="
+    },
+    "decimal.js": {
+      "version": "10.3.1",
+      "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.3.1.tgz",
+      "integrity": "sha512-V0pfhfr8suzyPGOx3nmq4aHqabehUZn6Ch9kyFpV79TGDTWFmHqUqXdabR7QHqxzrYolF4+tVmJhUG4OURg5dQ=="
+    },
+    "escape-latex": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/escape-latex/-/escape-latex-1.2.0.tgz",
+      "integrity": "sha512-nV5aVWW1K0wEiUIEdZ4erkGGH8mDxGyxSeqPzRNtWP7ataw+/olFObw7hujFWlVjNsaDFw5VZ5NzVSIqRgfTiw=="
+    },
+    "fraction.js": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-4.2.0.tgz",
+      "integrity": "sha512-MhLuK+2gUcnZe8ZHlaaINnQLl0xRIGRfcGk2yl8xoQAfHrSsL3rYu6FCmBdkdbhc9EPlwyGHewaRsvwRMJtAlA=="
+    },
+    "javascript-natural-sort": {
+      "version": "0.7.1",
+      "resolved": "https://registry.npmjs.org/javascript-natural-sort/-/javascript-natural-sort-0.7.1.tgz",
+      "integrity": "sha1-+eIwPUUH9tdDVac2ZNFED7Wg71k="
+    },
+    "mathjs": {
+      "version": "10.4.3",
+      "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-10.4.3.tgz",
+      "integrity": "sha512-C50lWorCOplBec9Ik5fzhHuOx4G4+mtdz3r1G2I1/r8yj+CpYFXLXNqTdg59oKmIF1tKcIzpxlC4s2dGL7f3pg==",
+      "requires": {
+        "@babel/runtime": "^7.17.8",
+        "complex.js": "^2.1.0",
+        "decimal.js": "^10.3.1",
+        "escape-latex": "^1.2.0",
+        "fraction.js": "^4.2.0",
+        "javascript-natural-sort": "^0.7.1",
+        "seedrandom": "^3.0.5",
+        "tiny-emitter": "^2.1.0",
+        "typed-function": "^2.1.0"
+      }
+    },
+    "regenerator-runtime": {
+      "version": "0.13.9",
+      "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.13.9.tgz",
+      "integrity": "sha512-p3VT+cOEgxFsRRA9X4lkI1E+k2/CtnKtU4gcxyaCUreilL/vqI6CdZ3wxVUx3UOUg+gnUOQQcRI7BmSI656MYA=="
+    },
+    "seedrandom": {
+      "version": "3.0.5",
+      "resolved": "https://registry.npmjs.org/seedrandom/-/seedrandom-3.0.5.tgz",
+      "integrity": "sha512-8OwmbklUNzwezjGInmZ+2clQmExQPvomqjL7LFqOYqtmuxRgQYqOD3mHaU+MvZn5FLUeVxVfQjwLZW/n/JFuqg=="
+    },
+    "tiny-emitter": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/tiny-emitter/-/tiny-emitter-2.1.0.tgz",
+      "integrity": "sha512-NB6Dk1A9xgQPMoGqC5CVXn123gWyte215ONT5Pp5a0yt4nlEoO1ZWeCwpncaekPHXO60i47ihFnZPiRPjRMq4Q=="
+    },
+    "typed-function": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-2.1.0.tgz",
+      "integrity": "sha512-bctQIOqx2iVbWGDGPWwIm18QScpu2XRmkC19D8rQGFsjKSgteq/o1hTZvIG/wuDq8fanpBDrLkLq+aEN/6y5XQ=="
+    }
+  }
+}
diff --git a/package.json b/package.json
new file mode 100644
index 0000000..22cc05c
--- /dev/null
+++ b/package.json
@@ -0,0 +1,15 @@
+{
+  "name": "squiggle-simplex",
+  "version": "1.0.0",
+  "description": "",
+  "main": "index.js",
+  "type": "module",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "author": "",
+  "license": "ISC",
+  "dependencies": {
+    "mathjs": "^10.4.3"
+  }
+}